开源软件构建与测试

Changes of Revision 2

_service:extract_file:slang.spec Deleted

@@ -1,100 +0,0 @@
-%bcond_with oniguruma
-
-Name:		slang
-Version:	2.3.2
-Release:	9
-Summary:	An interpreted language and programing library
-License:	GPLv2+
-URL:		https://www.jedsoft.org/slang/
-Source0:	https://www.jedsoft.org/releases/slang/%{name}-%{version}.tar.bz2
-
-Provides: %{name}-slsh = %{version}-%{release}
-Obsoletes: %{name}-slsh < %{version}-%{release}
-
-Patch6000:	slang-getkey-memmove.patch
-Patch6001:	slang-sighuptest.patch
-
-BuildRequires:	gcc libpng-devel pcre-devel zlib-devel
-
-%description
-S-Lang is a multi-platform programmer's library designed to allow
-a developer to create robust multi-platform software. It provides
-facilities required by interactive applications such as display/
-screen management, keyboard input, keymaps, and so on.
-
-%package devel
-Summary: Files for %{name} development
-Requires: %{name}%{?_isa} = %{version}-%{release}
-
-%description devel
-Files for %{name} development
-
-%package help
-Summary: Help files for %{name}
-BuildArch: noarch
-
-%description help
-Help files for %{name}
-
-%prep
-%autosetup -n %{name}-%{version} -p1
-
-sed -i '/^INSTALL_MODULE=/s/_DATA//' configure
-
-%build
-%configure --with-{pcre,png,z}lib=%{_libdir} --with-{pcre,png,z}inc=%{_includedir}
-
-make RPATH="" install_doc_dir=%{_pkgdocdir} all
-
-%install
-make install-all RPATH="" INSTALL="install -p" DESTDIR=%{buildroot}
-
-mkdir %{buildroot}%{_includedir}/slang
-for h in slang.h slcurses.h; do
- ln -s ../$h %{buildroot}%{_includedir}/slang/$h
-done
-
-%check
-make check
-
-%ldconfig_scriptlets
-
-%files
-%exclude %{_docdir}/{slang,slsh}
-%exclude %{_libdir}/libslang.a
-%{!?_licensedir:%global license %%doc}
-%config(noreplace) %{_sysconfdir}/slsh.rc
-%license COPYING
-%doc NEWS slsh/doc/html/*.html
-%{_libdir}/libslang.so.2*
-%{_libdir}/%{name}
-%{_bindir}/slsh
-%{_datadir}/slsh
-
-%files devel
-%doc doc/text/*.txt doc/README doc/*.txt
-%{_libdir}/libslang.so
-%{_libdir}/pkgconfig/%{name}.pc
-%{_includedir}/slang.h
-%{_includedir}/slcurses.h
-%{_includedir}/%{name}
-
-%files help
-%defattr(-,root,root)
-%{_mandir}/man1/slsh.1*
-
-%changelog
-* Mon Aug 02 2021 chenyanpanHW <chenyanpan@huawei.com> - 2.3.2-9
-- DESC: delete -Sgit from %autosetup, and delete BuildRequires git
-
-* Wed Dec 25 2019 openEuler Buildteam <buildteam@openeuler.org> - 2.3.2-8
-- Add provides of slang-slsh
-
-* Thu Nov 21 2019 fangyufa <fangyufa1@huawei.com> - 2.3.2-7
-- add buildrequires of git for x86_64 build
-
-* Mon Sep 24 2019 openEuler Buildteam <buildteam@openeuler.org> - 2.3.2-6
-- Remove unnecessary info in spec
-
-* Tue Sep 16 2019 openEuler Buildteam <buildteam@openeuler.org> - 2.3.2-5
-- Package init

_service:tar_scm:slang.spec Added

@@ -0,0 +1,100 @@
+%bcond_with oniguruma
+
+Name:		slang
+Version:	2.3.2
+Release:	9
+Summary:	An interpreted language and programing library
+License:	GPLv2+
+URL:		https://www.jedsoft.org/slang/
+Source0:	https://www.jedsoft.org/releases/slang/%{name}-%{version}.tar.bz2
+
+Provides: %{name}-slsh = %{version}-%{release}
+Obsoletes: %{name}-slsh < %{version}-%{release}
+
+Patch6000:	slang-getkey-memmove.patch
+Patch6001:	slang-sighuptest.patch
+
+BuildRequires:	gcc libpng-devel pcre-devel zlib-devel
+
+%description
+S-Lang is a multi-platform programmer's library designed to allow
+a developer to create robust multi-platform software. It provides
+facilities required by interactive applications such as display/
+screen management, keyboard input, keymaps, and so on.
+
+%package devel
+Summary: Files for %{name} development
+Requires: %{name}%{?_isa} = %{version}-%{release}
+
+%description devel
+Files for %{name} development
+
+%package help
+Summary: Help files for %{name}
+BuildArch: noarch
+
+%description help
+Help files for %{name}
+
+%prep
+%autosetup -n %{name}-%{version} -p1
+
+sed -i '/^INSTALL_MODULE=/s/_DATA//' configure
+
+%build
+%configure --with-{pcre,png,z}lib=%{_libdir} --with-{pcre,png,z}inc=%{_includedir}
+
+make RPATH="" install_doc_dir=%{_pkgdocdir} all
+
+%install
+make install-all RPATH="" INSTALL="install -p" DESTDIR=%{buildroot}
+
+mkdir %{buildroot}%{_includedir}/slang
+for h in slang.h slcurses.h; do
+ ln -s ../$h %{buildroot}%{_includedir}/slang/$h
+done
+
+%check
+make check
+
+%ldconfig_scriptlets
+
+%files
+%exclude %{_docdir}/{slang,slsh}
+%exclude %{_libdir}/libslang.a
+%{!?_licensedir:%global license %%doc}
+%config(noreplace) %{_sysconfdir}/slsh.rc
+%license COPYING
+%doc NEWS slsh/doc/html/*.html
+%{_libdir}/libslang.so.2*
+%{_libdir}/%{name}
+%{_bindir}/slsh
+%{_datadir}/slsh
+
+%files devel
+%doc doc/text/*.txt doc/README doc/*.txt
+%{_libdir}/libslang.so
+%{_libdir}/pkgconfig/%{name}.pc
+%{_includedir}/slang.h
+%{_includedir}/slcurses.h
+%{_includedir}/%{name}
+
+%files help
+%defattr(-,root,root)
+%{_mandir}/man1/slsh.1*
+
+%changelog
+* Mon Aug 02 2021 chenyanpanHW <chenyanpan@huawei.com> - 2.3.2-9
+- DESC: delete -Sgit from %autosetup, and delete BuildRequires git
+
+* Wed Dec 25 2019 openEuler Buildteam <buildteam@openeuler.org> - 2.3.2-8
+- Add provides of slang-slsh
+
+* Thu Nov 21 2019 fangyufa <fangyufa1@huawei.com> - 2.3.2-7
+- add buildrequires of git for x86_64 build
+
+* Tue Sep 24 2019 openEuler Buildteam <buildteam@openeuler.org> - 2.3.2-6
+- Remove unnecessary info in spec
+
+* Mon Sep 16 2019 openEuler Buildteam <buildteam@openeuler.org> - 2.3.2-5
+- Package init

_service:extract_file:slang-getkey-memmove.patch Deleted

@@ -1,31 +0,0 @@
-commit d338fd6e949ef62e7eac4eb5c024059e02158b06
-Author: Miroslav Lichvar <mlichvar@redhat.com>
-Date: Wed Jul 25 13:07:42 2018 +0200
-
- Replaced memcpy in SLang_getkey
- 
- memcpy() is not defined for overlapping buffers, i.e. it may copy bytes
- in any direction. As SLMEMMOVE is not defined in slang, replace the
- SLMEMCPY call with a for loop.
-
-diff --git a/src/slgetkey.c b/src/slgetkey.c
-index 86e7946..d9bc678 100644
---- a/src/slgetkey.c
-+++ b/src/slgetkey.c
-@@ -40,13 +40,13 @@ unsigned int SLang_getkey (void)
- 
- if (SLang_Input_Buffer_Len)
- {
--	unsigned int imax;
-+	unsigned int i, imax;
- 	ch = (unsigned int) *SLang_Input_Buffer;
- 	SLang_Input_Buffer_Len--;
- 	imax = SLang_Input_Buffer_Len;
- 
--	SLMEMCPY ((char *) SLang_Input_Buffer,
--		(char *) (SLang_Input_Buffer + 1), imax);
-+	for (i = 0; i < imax; i++)
-+	 SLang_Input_Bufferi = SLang_Input_Bufferi + 1;
- }
- else if (SLANG_GETKEY_ERROR == (ch = _pSLsys_getkey ())) return ch;
-

_service:extract_file:slang-sighuptest.patch Deleted

_service:tar_scm:slang-getkey-memmove.patch Added

@@ -0,0 +1,31 @@
+commit d338fd6e949ef62e7eac4eb5c024059e02158b06
+Author: Miroslav Lichvar <mlichvar@redhat.com>
+Date: Wed Jul 25 13:07:42 2018 +0200
+
+ Replaced memcpy in SLang_getkey
+ 
+ memcpy() is not defined for overlapping buffers, i.e. it may copy bytes
+ in any direction. As SLMEMMOVE is not defined in slang, replace the
+ SLMEMCPY call with a for loop.
+
+diff --git a/src/slgetkey.c b/src/slgetkey.c
+index 86e7946..d9bc678 100644
+--- a/src/slgetkey.c
++++ b/src/slgetkey.c
+@@ -40,13 +40,13 @@ unsigned int SLang_getkey (void)
+ 
+ if (SLang_Input_Buffer_Len)
+ {
+-	unsigned int imax;
++	unsigned int i, imax;
+ 	ch = (unsigned int) *SLang_Input_Buffer;
+ 	SLang_Input_Buffer_Len--;
+ 	imax = SLang_Input_Buffer_Len;
+ 
+-	SLMEMCPY ((char *) SLang_Input_Buffer,
+-		(char *) (SLang_Input_Buffer + 1), imax);
++	for (i = 0; i < imax; i++)
++	 SLang_Input_Bufferi = SLang_Input_Bufferi + 1;
+ }
+ else if (SLANG_GETKEY_ERROR == (ch = _pSLsys_getkey ())) return ch;
+

_service:tar_scm:slang-sighuptest.patch Added

_service Changed

_service:extract_file:slang-2.3.2.tar.bz2 Deleted

_service:extract_file:slang.yaml Deleted

_service:tar_scm:slang-1629454377.099436e.tar/slang-2.3.2.tar.bz2 Deleted

_service:tar_scm:slang-1629454377.099436e.tar/slang-getkey-memmove.patch Deleted

_service:tar_scm:slang-1629454377.099436e.tar/slang-sighuptest.patch Deleted

_service:tar_scm:slang-1629454377.099436e.tar/slang.spec Deleted

_service:tar_scm:slang-1629454377.099436e.tar/slang.yaml Deleted

_service:tar_scm:slang-2.3.2.tar.bz2/.gitignore Added

_service:tar_scm:slang-2.3.2.tar.bz2/COPYING Added

@@ -0,0 +1,339 @@
+		 GNU GENERAL PUBLIC LICENSE
+		 Version 2, June 1991
+
+ Copyright (C) 1989, 1991 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.
+
+			 Preamble
+
+ The licenses for most software are designed to take away your
+freedom to share and change it. By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users. This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it. (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.) 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
+this service 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 make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have. 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.
+
+ We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+ Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software. If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+ Finally, any free program is threatened constantly by software
+patents. We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary. To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+&#xc;
+		 GNU GENERAL PUBLIC LICENSE
+ TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+ 0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License. The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language. (Hereinafter, translation is included without limitation in
+the term "modification".) Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope. The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+ 1. You may copy and distribute 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 and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+ 2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+ a) You must cause the modified files to carry prominent notices
+ stating that you changed the files and the date of any change.
+
+ b) You must cause any work that you distribute or publish, that in
+ whole or in part contains or is derived from the Program or any
+ part thereof, to be licensed as a whole at no charge to all third
+ parties under the terms of this License.
+
+ c) If the modified program normally reads commands interactively
+ when run, you must cause it, when started running for such
+ interactive use in the most ordinary way, to print or display an
+ announcement including an appropriate copyright notice and a
+ notice that there is no warranty (or else, saying that you provide
+ a warranty) and that users may redistribute the program under
+ these conditions, and telling the user how to view a copy of this
+ License. (Exception: if the Program itself is interactive but
+ does not normally print such an announcement, your work based on
+ the Program is not required to print an announcement.)
+&#xc;
+These requirements apply to the modified work as a whole. If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works. But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+ 3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+ a) Accompany it with the complete corresponding machine-readable
+ source code, which must be distributed under the terms of Sections
+ 1 and 2 above on a medium customarily used for software interchange; or,
+
+ b) Accompany it with a written offer, valid for at least three
+ years, to give any third party, for a charge no more than your
+ cost of physically performing source distribution, a complete
+ machine-readable copy of the corresponding source code, to be
+ distributed under the terms of Sections 1 and 2 above on a medium
+ customarily used for software interchange; or,
+
+ c) Accompany it with the information you received as to the offer
+ to distribute corresponding source code. (This alternative is
+ allowed only for noncommercial distribution and only if you
+ received the program in object code or executable form with such
+ an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it. For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable. However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+&#xc;
+ 4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License. Any attempt
+otherwise to copy, modify, sublicense or distribute the Program 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.
+
+ 5. You are not required to accept this License, since you have not
+signed it. However, nothing else grants you permission to modify or
+distribute the Program or its derivative works. These actions are
+prohibited by law if you do not accept this License. Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+ 6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions. You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+ 7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+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
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all. For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices. Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+&#xc;
+ 8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded. In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+ 9. The Free Software Foundation may publish revised and/or new versions
+of the 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 a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation. If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+ 10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission. For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this. Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+			 NO WARRANTY
+
+ 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, 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.
+
+ 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE 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.
+
+		 END OF TERMS AND CONDITIONS
+&#xc;
+	 How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+ To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) 19yy <name of author>
+
+ 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 2 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, write to the Free Software
+ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+ Gnomovision version 69, Copyright (C) 19yy name of author
+ Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary. Here is a sample; alter the names:
+
+ Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+ `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+ <signature of Ty Coon>, 1 April 1989
+ Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs. If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library. If this is what you want to do, use the GNU Library General
+Public License instead of this License.

_service:tar_scm:slang-2.3.2.tar.bz2/INSTALL.pc Added

@@ -0,0 +1,40 @@
+-*- text -*-
+
+The slang library is available for OS/2, MSDOS, and WIN32 (windows
+9x/NT) systems.  This _includes_ the various GNU environments such as
+DJGPP, and MINGW32/64.  For CYGWIN, follow the UNIX instructions.
+
+Each of the src, modules, and slsh directories contains a mkfiles
+subdirectory that can be used to create Makefiles for non-CYGWIN
+builds.  The simplest approach to building the distribution is to
+invoke the build scripts located in the top-level mkfiles directory.
+
+For example, from a CMD window, a mingw32 version may be built and
+installed using a simple 3-step process:
+
+   1.    C:\path\to\slang> mkfiles\m32init.bat
+   2.    C:\path\to\slang> mingw32-make
+   3.    C:\path\to\slang> mingw32-make install
+
+The first step will generate makefiles for mingw32/mingw64.  Note that
+mingw32-make is used for both 32 and 64 bit builds.  In particular,
+this step will create a top-level makefile that contains the locations
+where the library and its components will get installed. Before, going
+on to step 2, it is a good idea to look at the makefile and edit it if
+necessary.
+
+The second step will build the library, slsh, and the modules.  If
+something goes wrong here, fix it before going to step 3.
+
+The final step installs the library and its components.  The actual
+work is carried out by slsh, which was created in step 2.  Please
+note, if you make an changes the installation paths in the makefile
+after completing step 2, then you will need to rebuild it.  That is,
+run `mingw32-make clean', then go to step 2.
+
+Finally you will need to make sure that the $PREFIX/bin directory is
+in your PATH.  Assuming that this has been done, you should be able
+to run `slsh' at the CMD prompt.
+
+More information on the makefile generation process is available
+in src/mkfiles/README.

_service:tar_scm:slang-2.3.2.tar.bz2/INSTALL.unx Added

@@ -0,0 +1,337 @@
+-*- text -*-
+
+Note: You are looking in the wrong place if you intend to compile a
+ Unix version using the MINGW32 or the DJGPP development
+ environments. As far as the S-Lang library is concerned, these
+ do not constitute Unix environments. Read INSTALL.pc.
+
+This distribution contains the source for the slang library, a
+``slang-shell'' program called slsh, and dynamically loadable modules
+that may be ``imported'' into the interpreter. Be sure to install all
+3 components.
+
+---------------------------------------------------------------------
+ Prerequisites
+---------------------------------------------------------------------
+
+Some of the modules require third party libraries. If the configure
+script cannot find one of the libraries, the corresponding module will
+not be built. Currently, the following additional libraries are
+strongly recommended:
+
+ PCRE (Perl Compatible Regular Expression)
+ URL: <http://www.pcre.org>
+ *** Note: PCRE2, released in 2015 is currently unsupported.
+
+ PNG (Portable Network Graphics)
+ URL: <http://www.libpng.org/pub/png/>
+
+ ZLIB (Z compression library)
+ URL: <http://www.zlib.net/>
+
+ ONIGURUMA (Regular expression library)
+ URL: <https://github.com/kkos/oniguruma>
+
+On a Debian system, these libraries can be installed using:
+
+ apt-get install libpng12-dev zlib1g-dev libpcre3-dev libonig-dev
+
+ (Double check the package names-- the ones quoted above are
+ appropriate for Debian Lenny)
+
+If you have these installed in non-standard places and the configure
+script cannot find them, then run configure with the "--with-pcre" and
+"--with-png" options. Use "./configure --help" to see other options.
+In any case, these libraries are not required but without them the png
+and pcre modules will not be created.
+
+---------------------------------------------------------------------
+Building and installing the S-Lang library
+---------------------------------------------------------------------
+
+Under Unix, the S-Lang library makes use of the GNU autoconf package.
+The process may be as simple as:
+
+ ./configure
+ make (or make static)
+ make runtests (this builds the static library)
+ make install (or `make install-static` to install the static library)
+ make clean
+
+The first two steps:
+
+ ./configure
+ make
+
+will cause the (shared) library and the .o files to be placed
+src/elfobjs. Using
+
+ make static
+
+will build a static version of the library in src/objs. By default,
+`make` builds the shared version of the library.
+
+The 'runtests' step is designed to test the interpreter. It uses the
+static version of the library for this.
+
+ ***Note: If you are installing the library for other users, be sure
+ to set your umask value to 022 before running `make install`,
+	 i.e.,
+
+	 umask 022
+	 make install
+
+ ***Note: If you have the png, pcre, etc libraries installed in a
+	 non-standard location, e.g., /opt/software, then the script
+	 may not be able to find them. The locations may be
+	 specified using, e.g.,
+
+ ./configure --with-pcre=/opt/software --with-png=/opt/software
+
+ This assumes that the header files and the libraries are in
+	 include/ and lib of /opt/software, resp. If not, run
+
+ ./configure --help
+
+ for other options regarding the locations of the pcre and png.
+
+ In any case, the pcre and png libraries are NOT REQUIRED.
+	 But without them, the corresponding modules will not be created.
+
+ ***Note: By default, slsh is built using the slang readline
+ interface. To use GNU readline use the --with-readline=gnu
+	 option.
+
+ ***Note: Object files are placed in subdirectories with names
+ ${ARCH}objs and ${ARCH}elfobjs, where ${ARCH} is set from
+	 the environment. This may be exploited for the purposes of
+	 building the library for multiple architectures. For
+	 example, one might use ARCH=sun4 for a Sun 4 system, and
+	 ARCH=i686 on a Linux system with a 32 bit processor.
+
+	 In principle, any file generated by the configure process is
+	 architecture specific and should be placed in an
+	 architecture-specific directory. This is currently not
+	 supported by the configure script. For this reason, when
+	 building for a different architecture, the configure script
+	 must be re-run. 
+
+ ***Note: This package does not support the --srcdir command line
+ option. This option is typically used to compile separate
+	 versions of the library. If your intent is to do something
+	 like
+
+	 mkdir foo; cd foo; ../configure --srcdir=..; make
+
+ then after reading the previous note, try:
+
+	 setenv ARCH foo; ./configure; make (csh syntax)
+ ARCH=foo; export ARCH; ./configure make (/bin/sh)
+
+ The reason that --srcdir is not supported is that it fails
+	 in the presence of symbolic links, e.g.,
+
+	 cd foo; cd ..
+
+	 does not bring you back where you started if foo is a
+	 symbolic link.
+
+By default, the slang library (libslang.so.*) will be installed into
+/usr/local/lib and slang.h into /usr/local/include. To install it
+under some other directory, e.g.., /opt, the use the --prefix argument
+when running the configure script, e.g.,
+
+ ./configure --prefix=/opt
+
+As mentioned above, simply running `make` will create a shared version
+of the library. If your system does not support such libraries, or
+the build process fails to create a shared version of the library, you
+may want to install the static version:
+
+ make static
+ make install-static
+
+Below, I have attached the generic INSTALL instructions included in the
+autoconf distribution.
+----------------------------------------------------------------------------
+Basic Installation
+==================
+
+ These are generic installation instructions.
+
+ The `configure' shell script attempts to guess correct values for
+various system-dependent variables used during compilation. It uses
+those values to create a `Makefile' in each directory of the package.
+It may also create one or more `.h' files containing system-dependent
+definitions. Finally, it creates a shell script `config.status' that
+you can run in the future to recreate the current configuration, a file
+`config.cache' that saves the results of its tests to speed up
+reconfiguring, and a file `config.log' containing compiler output
+(useful mainly for debugging `configure').
+
+ If you need to do unusual things to compile the package, please try
+to figure out how `configure' could check whether to do them, and mail
+diffs or instructions to the address given in the `README' so they can
+be considered for the next release. If at some point `config.cache'
+contains results you don't want to keep, you may remove or edit it.
+
+ The file `configure.in' is used to create `configure' by a program
+called `autoconf'. You only need `configure.in' if you want to change
+it or regenerate `configure' using a newer version of `autoconf'.
+
+The simplest way to compile this package is:
+
+ 1. `cd' to the directory containing the package's source code and type
+ `./configure' to configure the package for your system. If you're
+ using `csh' on an old version of System V, you might need to type
+ `sh ./configure' instead to prevent `csh' from trying to execute
+ `configure' itself.
+
+ Running `configure' takes awhile. While running, it prints some
+ messages telling which features it is checking for.
+
+ 2. Type `make' to compile the package.
+
+ 3. Optionally, type `make check' to run any self-tests that come with
+ the package.
+
+ 4. Type `make install' to install the programs and any data files and
+ documentation.
+
+ 5. You can remove the program binaries and object files from the
+ source code directory by typing `make clean'. To also remove the
+ files that `configure' created (so you can compile the package for
+ a different kind of computer), type `make distclean'. There is
+ also a `make maintainer-clean' target, but that is intended mainly
+ for the package's developers. If you use it, you may have to get
+ all sorts of other programs in order to regenerate files that came
+ with the distribution.
+
+Compilers and Options
+=====================
+
+ Some systems require unusual options for compilation or linking that
+the `configure' script does not know about. You can give `configure'
+initial values for variables by setting them in the environment. Using
+a Bourne-compatible shell, you can do that on the command line like
+this:
+ CC=c89 CFLAGS=-O2 LIBS=-lposix ./configure
+
+Or on systems that have the `env' program, you can do it like this:
+ env CPPFLAGS=-I/usr/local/include LDFLAGS=-s ./configure
+
+Compiling For Multiple Architectures
+====================================
+
+ You can compile the package for more than one kind of computer at the
+same time, by placing the object files for each architecture in their
+own directory. To do this, you must use a version of `make' that
+supports the `VPATH' variable, such as GNU `make'. `cd' to the
+directory where you want the object files and executables to go and run
+the `configure' script. `configure' automatically checks for the
+source code in the directory that `configure' is in and in `..'.
+
+ If you have to use a `make' that does not supports the `VPATH'
+variable, you have to compile the package for one architecture at a time
+in the source code directory. After you have installed the package for
+one architecture, use `make distclean' before reconfiguring for another
+architecture.
+
+Installation Names
+==================
+
+ By default, `make install' will install the package's files in
+`/usr/local/bin', `/usr/local/man', etc. You can specify an
+installation prefix other than `/usr/local' by giving `configure' the
+option `--prefix=PATH'.
+
+ You can specify separate installation prefixes for
+architecture-specific files and architecture-independent files. If you
+give `configure' the option `--exec-prefix=PATH', the package will use
+PATH as the prefix for installing programs and libraries.
+Documentation and other data files will still use the regular prefix.
+
+ In addition, if you use an unusual directory layout you can give
+options like `--bindir=PATH' to specify different values for particular
+kinds of files. Run `configure --help' for a list of the directories
+you can set and what kinds of files go in them.
+
+ If the package supports it, you can cause programs to be installed
+with an extra prefix or suffix on their names by giving `configure' the
+option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'.
+
+Optional Features
+=================
+
+ Some packages pay attention to `--enable-FEATURE' options to
+`configure', where FEATURE indicates an optional part of the package.
+They may also pay attention to `--with-PACKAGE' options, where PACKAGE
+is something like `gnu-as' or `x' (for the X Window System). The
+`README' should mention any `--enable-' and `--with-' options that the
+package recognizes.
+
+ For packages that use the X Window System, `configure' can usually
+find the X include and library files automatically, but if it doesn't,
+you can use the `configure' options `--x-includes=DIR' and
+`--x-libraries=DIR' to specify their locations.
+
+Specifying the System Type
+==========================
+
+ There may be some features `configure' can not figure out
+automatically, but needs to determine by the type of host the package
+will run on. Usually `configure' can figure that out, but if it prints
+a message saying it can not guess the host type, give it the
+`--host=TYPE' option. TYPE can either be a short name for the system
+type, such as `sun4', or a canonical name with three fields:
+ CPU-COMPANY-SYSTEM
+
+See the file `config.sub' for the possible values of each field. If
+`config.sub' isn't included in this package, then this package doesn't
+need to know the host type.
+
+ If you are building compiler tools for cross-compiling, you can also
+use the `--target=TYPE' option to select the type of system they will
+produce code for and the `--build=TYPE' option to select the type of
+system on which you are compiling the package.
+
+Sharing Defaults
+================
+
+ If you want to set default values for `configure' scripts to share,
+you can create a site shell script called `config.site' that gives
+default values for variables like `CC', `cache_file', and `prefix'.
+`configure' looks for `PREFIX/share/config.site' if it exists, then
+`PREFIX/etc/config.site' if it exists. Or, you can set the
+`CONFIG_SITE' environment variable to the location of the site script.
+A warning: not all `configure' scripts look for a site script.
+
+Operation Controls
+==================
+
+ `configure' recognizes the following options to control how it
+operates.
+
+`--cache-file=FILE'
+ Use and save the results of the tests in FILE instead of
+ `./config.cache'. Set FILE to `/dev/null' to disable caching, for
+ debugging `configure'.
+
+`--help'
+ Print a summary of the options to `configure', and exit.
+
+`--quiet'
+`--silent'
+`-q'
+ Do not print messages saying which checks are being made.
+
+`--srcdir=DIR'
+ Look for the package's source code in directory DIR. Usually
+ `configure' can determine that directory automatically.
+
+`--version'
+ Print the version of Autoconf used to generate the `configure'
+ script, and exit.
+
+`configure' also accepts some other, not widely useful, options.
+

_service:tar_scm:slang-2.3.2.tar.bz2/INSTALL.vms Added

_service:tar_scm:slang-2.3.2.tar.bz2/NEWS Added

@@ -0,0 +1,578 @@
+NEWS for version 2.3.x -*-text-*-
+
+24 bit color support (new for version 2.3.1)
+============================================
+
+ The SLtt interface has been modified to support 24 bit (true)
+ colors. Until the next major release (version 3), this feature is
+ available for 64 bit Unix/VMS systems to keep binary compatibility.
+ Support for 32 bit systems will be added in version 3.
+
+ Since not all terminals support true color, and it is not supported
+ by terminfo, 24 bit color is disabled by default. A list of
+ terminals that support true color may be found at
+ <https://gist.github.com/XVilka/8346728>.
+
+ To indicate that a terminal supports true color, set the value of
+ the environment variable COLORTERM to either "24bit" or "truecolor",
+ e.g.,
+
+ export COLORTERM=truecolor
+
+ Then to use 24 bit color in applications such as jed and slrn, use a
+ 24bit RGB value in the form "#RRGGBB" as the name of the color.
+ For example, to set the color of the status line in jed to AliceBlue
+ (#F0F8FF) on a SlateGray (#708090) background, use
+
+ set_color ("status", "#F0F8FF", "#708090");
+
+ in the .jedrc file. In slrn, to set the color of the author name to
+ the above colors use
+
+ color author "#F0F8FF" "#708090"
+
+ in the .slrnrc file. Also note other character attributes may be
+ specified, e.g., "#F0F8FF;italics;underline".
+
+New Modules
+===========
+
+ 1. base64: A base64 encoder/decoder module
+ 2. chksum: A module for computing various checksums (currently md5
+ and sha1)
+ 3. stats: A statistics module
+ 4. histogram: A histogram module
+ 5. json: Encode/decode json structures
+
+Module Updates
+==============
+
+ stats-module: Added Anderson-Darling normality and
+ k-sample tests (version 2.3.1)
+
+Intrinsic Functions
+===================
+
+ The following intrinsic functions have been added for 2.3.x:
+
+ sincos : returns both sin and cos in one function call
+
+ get/setitimer: get/set an interval timer
+
+ wherefirstmin/max, wherelastmin/max: returns index for first/last
+ min/max values of an array
+
+ wherefirst_eq/ne/gt/lt/ge/le, where_last_eq/ne/gt/lt/ge/le:
+ returns first/last index of an array where the array value is
+ eq/ne/gt/lt/ge/le of a specified value. (version 2.3.1)
+
+ wherediff: returns indices where adjacient elements of an array
+ differ.
+
+ bstrjoin, bstrcat: like strjoin/strcat but for binary strings.
+
+ get_environ: returns an array of currently defined environment variables.
+
+ getrusage: Get resource usage
+
+ lchown: Change ownership of a symbolic link
+
+ get/set_printable_bstring_size: Get/set the length of the
+ printable representation of binary strings. (version 2.3.1)
+
+ statvfs: Intrinsic that wraps statvfs POSIX function that returns
+ file system statistics. (version 2.3.1)
+
+ _ftime: returns the number of (wallclock) seconds since an epoch
+ (version 2.3.1)
+
+ wchars_to_string/string_to_wchars: Convert a UTF-8 encoded string
+ to and from an array of Unicode characters. (version 2.3.1)
+
+ _array_byteswap: used to convert the values of an array from one
+ endianness to another (version 2.3.2)
+
+ The following functions have been enhanced:
+
+ array_map modified to support multiple return values.
+
+ is_substrbytes: Added support for an optional offset into the
+ string.
+
+ _push_struct_field_values: An optional argument may be used to
+ specify the fields to be pushed. (version 2.3.1)
+
+Interpreter Syntax
+==================
+
+ The step parameter was made optional for the _for statement.
+
+ Struct field names may be an arbitrary string:
+
+ X = struct {"some-field", some_other_field };
+ X.some_other_field = 3;
+ X."some-field" = 4;
+
+ String literals now support \uABCD to specify a 32 bit unicode
+ character. Previously, the braces were required (\u{ABCD}).
+ (version 2.3.1)
+
+ A reserved word may be used for a struct field name without quoting
+ it (version 2.3.2)
+
+
+slsh library (used by conforming slang apps such as jed, slrn, ...)
+===================================================================
+
+ fswalk.sl: Functions that facilitate walking the filesystem.
+
+ listfuns.sl: Set of functions dealing with lists and list-based
+ structures (e.g., heaps).
+
+ rearrange: Performs an in-place arrangement of values in an array
+ or list (defined in arrayfuns.sl).
+
+
+slsh
+====
+
+ Using "who" at the slsh> prompt will list the names/values of
+ variables and functions defined at the prompt.
+
+API News
+========
+
+ Note: The slang 2.3.x API is backward binary compatible with slang
+ 2.y.z.
+
+ Font attributes (italics, bold, underline, ...) may be enabled for
+ terminals that support them by using a color name with a qualifier:
+
+ SLtt_set_color ("menu", "white;italics", "blue");
+ SLtt_set_color ("comment", "black;underline;italics", "cyan");
+
+ SLang_init_tty: if flow control parameter is negative, the
+ terminal's flow control setting will not be changed.
+
+ New functions:
+
+ Functions for dealing with qualifiers passed to intrinsic
+ functions:
+ SLang_qualifier_exists;
+	SLang_get_int_qualifier;
+	SLang_get_long_qualifier;
+	SLang_get_double_qualifier;
+	SLang_get_string_qualifier;
+
+ Callback functions that allow an app additional hooks into the
+ slang readline functions:
+
+ SLrline_set_free_update_cb;
+	SLrline_set_update_clear_cb;
+	SLrline_set_update_preread_cb;
+	SLrline_set_update_postread_cb;
+	SLrline_set_update_width_cb;
+	SLrline_get_update_client_data;
+
+ Functions for dealing with interpreter associative arrays:
+
+	SLang_create_assoc;
+	SLang_push_assoc;
+	SLang_pop_assoc;
+	SLang_free_assoc;
+	SLang_assoc_put;
+	SLang_assoc_get;
+	SLang_assoc_key_exists;
+
+ Functions for dealing with interpreter list objects:
+
+ SLang_create_list;
+	SLang_list_append;
+	SLang_list_insert;
+	SLang_push_list;
+	SLang_pop_list;
+	SLang_free_list;
+
+ Functions for dealing with interpreter structures:
+
+ SLang_create_struct;
+	SLang_push_struct_field;
+	SLang_pop_struct_field;
+	SLang_pop_struct_fields;
+
+ Miscellaneous Functions:
+
+ SLstack_exch;
+	SLcompute_string_hash;
+	SLpath_getcwd;
+
+Unicode Support
+===============
+
+ Unicode tables were updated to version 10.0.0 (version 2.3.2)
+
+Miscellaneous
+=============
+
+ Support was added to support 32-bit terminfo database
+ entries introduced by ncurses 6.1 (version 2.3.2)
+
+=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=
+
+NEWS for version 2.2.x -*-text-*-
+
+Interpreter Enhancements
+========================
+
+ 1. The ternary expression was added:
+
+ expression = condition ? val1 : val2
+
+ If condition is non-zero, then expression = val1,
+ otherwise expression = val2
+
+ 2. The break and condition statements support an optional integer
+ that indicates how many loop levels the statement affects, e.g.,
+ the break statement in
+
+ while (1)
+	 {
+	 loop (10)
+		 {
+		 break 2;
+		 }
+	 }
+
+ will cause both loops to be terminated.
+
+ 3. Multiline strings have been added:
+
+ "This is a \
+	 multiline \
+	 string"
+
+ `This is
+	 another multiline
+	 string that
+	 does not require
+	 a \ for continuation`
+
+ 4. List_Type objects may be indexed using an array of indices
+ instead of just a single scalar index.
+
+ 5. (v2.2.3) Binary literal integers of the form 0bxx...x are supported.
+ Here, x is 0 or 1. The printf "%B" format specifier was added
+	to format integers as binary.
+
+ 6. (v2.2.3) The dereference operator (@) may be used in a structure
+ definition to include the fields from the dereferenced
+	structure, e.g.,
+
+	 space = struct {x, y, z};
+	 spacetime = struct {@space, t};
+
+ 7. (v2.2.3) Dereferencing a scalar or vector class type now
+ results in duplication of the object, e.g, @7 will produce 7.
+
+ 8. (v2.2.3) Mergesort was made the default sorting algorithm. See the
+ array_sort for details.
+
+Modules
+=======
+
+ 1. zlib: A module that wraps the popular z compression library.
+
+ 2. fork: A module that wraps the fork, exec*, and waitpid functions.
+
+ slsh/lib/process.sl utilizes this module to allow an
+	 application to easily create subprocesses and pipelines.
+
+ 3. sysconf: Module that implements interfaces to the posix
+ sysconf, pathconf, etc. functions.
+
+ 4. (2.2.3) csv: A module that supports the reading and writing of
+ so-called Comma Separated Values files.
+
+Intrinsic Functions
+===================
+
+ The following intrinsic functions have been added for 2.2.x:
+
+ sumsq
+ equivalent to sum(x*x)
+
+ expm1
+ More accurate version of exp(x)-1 for x near 0.
+
+ log1p
+ More accurate version of log(1+x) for x near 0
+
+ list_to_array
+ Creates an array from a list.
+
+ string_matches
+ A convenient alternative to string_match and string_match_nth
+	 functions.
+
+ strskipbytes (v2.2.3)
+ Skip a range of bytes in a byte string.
+
+ is_substrbytes (v2.2.3)
+ Like is_substr except this works with binary strings
+	 containing embedded null characters.
+
+ strskipchar, strbskipchar (v2.2.3)
+ Analogous to C ch=*p++ and ch=*p-- for UTF-8 encoded strings.
+
+ _close
+ Close an integer descriptor
+ _fileno
+ Returns the descriptor as an integer
+
+ dup2, getsid, killpg, getpriority/setpriority
+ Wraps the corresponding system functions.
+
+ utime (v2.2.3)
+ Change a file's last access and modification time.
+
+ ldexp, frexp:
+ If x == a*2^b, where 0.5<=a<1.0 then (a,b)=frexp(x),
+	 and x=ldexp(a,b).
+
+ islower, isupper, isxdigit, isalnum, isalpha, iscntrl, isprint,
+ isgraph, ispunct, isblank, isascii, isspace (v2.2.3):
+ Character classification functions.
+
+ list_append, list_join (v2.2.3)
+ Functions for merging two lists together.
+
+ ttyname (v2.2.3)
+ Get the name of the terminal
+
+ timegm (v2.2.3)
+ Inverse of gmtime
+
+ The following functions have been enhanced:
+
+ hypot
+ If given a single array argument, it returns the equivalent
+	 of sqrt(sum(X*X)).
+
+ Support for N arrays added for e.g., the Euclidean norm in
+	 an N dimensional space (v2.2.3)
+
+ _min, _max: (v2.2.3)
+ Added support for more than two elements.
+
+ polynom
+ The calling interface to this function was changed and
+	 support added for arrays.
+
+ strjoin (v2.2.3)
+ delimiter made optional
+
+ strreplace (v2.2.3)
+ New usage designed to facilitate the most common case where
+	 one wants to replace all the substrings.
+
+ strtrans (v2.2.3)
+ Additional character classes added (see documentation).
+
+ string_match, string_matches (v2.2.3)
+ The position argument made optional
+
+ The following string functions have been vectorized to act upon
+ arrays of strings (v2.2.3):
+
+ is_substr
+ str_delete_chars
+ strbytelen
+ strcharlen
+ strcmp
+ strcompress
+ strlen
+ strlow
+ strnbytecmp
+ strncharcmp
+ strncmp
+ strtrans
+ strtrim
+ strtrim_beg
+ strtrim_end
+ strup
+
+
+slsh
+====
+ slang readline enhancements:
+ New functions:
+	 rline_up/down_hist
+	 Behaves similar to zsh up/down-line-or-search functions (v2.2.3).
+
+	 rline_call_editor
+ rline_edit_history
+	 rline_edit_line
+	 Call external editor for line/history editing. (v2.2.3)
+
+ Structure field completion. (v2.2.3)
+
+ Instead of scrolling horizontally when editing a line,
+	 attempt to wrap the line. (v2.2.3)
+
+ setfuns.sl: Various set functions: unique, intersection,
+	 complement,union (v2.2.3)
+
+Misc
+====
+
+ Unicode tables updated to version 5.1.
+
+=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x=x
+
+NEWS for version 2.1
+
+Building the library
+====================
+
+ `make install' installs the shared version of the library.
+ Previously `make install' installed just the static version and a
+ separate step (`make install-elf') was required to install the
+ shared version. Now, `make install-static' is necessary to install
+ the static one.
+
+Interpreter News
+=================
+
+Syntax enhancements:
+--------------------
+
+ 1. Short circuiting boolean operators:
+
+ if ((x == y) || (y == 3) && (x != 4)) ...
+
+ (orelse and andelse are deprecated)
+
+ 2. Structure definitions allow embdedded assignment expressions:
+
+ s = struct {x = 3, name="foo", a = 1:10};
+
+ 3. Qualifiers (aka "keywords") added to the language:
+
+ save_file ("foo.c"; overwrite=1);
+	 plot_points (1:10, sin(1:10); color="red", style="solid");
+
+ 3. Expressions such as (a < b < c) now interpreted to mean
+ (a<b)and(b<c).
+
+ 4. New keywords: ifnot, then
+
+ ifnot may be used instead of !if, which has been deprecated.
+ For "then" see the next item.
+
+ 5. Looping constructs support a "then" clause that will get
+ executed if the loop runs to completion, e.g.,
+
+ loop (20)
+	 {
+	 if (this ())
+	 break; % The then clause will NOT get executed
+	 }
+	 then do_that ();
+
+ 6. A floating point array of exactly N elements may be created
+ using the form a:b:#N, where the elements are uniformly
+ spaced and run from a to b, inclusive.
+
+ 7. References to array elements and structure fields are
+ supported, e.g., &A3, &s.foo.
+
+ 8. An exception may be rethrown by calling "throw" without any
+ arguments:
+
+ try { something (); }
+	 catch AnyError: { do_this (); throw; }
+
+New Intrinsic Functions:
+------------------------
+
+ wherenot(x) :
+ Equivalent to where (not(x))
+
+ _$(str) :
+ Evaluates strings with embedded "dollar" variables, e.g.,
+ _$("$TERM");
+
+ __push_list/__pop_list :
+ Push list items onto the stack
+
+ prod(x) :
+ Computes the product of an array a0*a1*...
+
+ minabs(x), maxabs(x):
+ Equivalent to min(abs(x)) and max(abs(x))
+
+ getpgrp,setgid, getpgid:
+ Get and set the process group (Unix)
+ setsid :
+ Create a new session
+
+API News
+========
+
+ Although not new I feel that this point should be stressed now
+ because it was not emphasized earlier: The SLarray_* functions that
+ deal with indices or sizes use `SLindex_Type' instead of `int'.
+ Currently, `SLindex_Type' is typedefed to be an `int', but this will
+ change in a future version. So for future compatibility, use
+ `SLindex_Type' instead of `int' in functions that deal with slang
+ arrays. Similarly, instead of using SLang_pop_int for obtaining an
+ array index, use SLang_pop_array_index. See the array-specific
+ examples in the documentation for more information.
+
+ There have been significant enhancements to the slang readline
+ interface. The interface has been opened up to the interpreter
+ allowing for such features as completion and a persistent history
+ mechanism. Applications wishing to take advantage of these features
+ should use the new function `SLrline_open2' instead of
+ `SLrline_open'. For an example, see how this function is used in
+ slsh/src/readline.c.
+
+ SLclass_patch_intrin_fun_table was added to facilitiate the patching
+ of intrinsic tables during runtime. If you have created dynamically
+ loaded modules, then you may have a good idea what this function is
+ for.
+
+ The SLang_Traceback variable is now interpreted as a bitmapped
+ integer providing greater flexibility and control over traceback
+ messages.
+
+ SLerr_throw was added to permit applications to mimic the semantics
+ of the `throw' statement.
+
+ SLang_verror_va was added to support calling the error routines with
+ a va_list argument.
+
+slsh enhancements
+=================
+
+ When configured to use slang's readline routines, new features
+ include filename completion and persistent history.
+
+ The profiler was rewritten to be much more friendly, flexible, and
+ more accurate.
+
+ struct_filter and struct_combine defined in structfuns.sl have been
+ made more flxible. See their documentation for more information.
+
+ A new function called readascii may be used for reading
+ non-binary (or so-called "ascii") data files.
+
+New modules
+===========
+
+ The following modules have been added:
+
+ iconv: Performs character-set conversion using the iconv library.
+ onig: A regular expression module using oniguruma RE library.
+ rand: A random number module
+

_service:tar_scm:slang-2.3.2.tar.bz2/README Added

_service:tar_scm:slang-2.3.2.tar.bz2/UPGRADE.txt Added

_service:tar_scm:slang-2.3.2.tar.bz2/autoconf Added

_service:tar_scm:slang-2.3.2.tar.bz2/autoconf/Makefile Added

_service:tar_scm:slang-2.3.2.tar.bz2/autoconf/Makefile.in Added

@@ -0,0 +1,109 @@
+# -*- make -*-
+
+#This is a UNIX-only makefile.  For other systems, get a makefile from
+#src/mkfiles/
+
+# If you want to change these variables, re-run the configure script.
+INSTALL= @INSTALL@
+INSTALL_DATA = @INSTALL_DATA@
+prefix = @prefix@
+exec_prefix = @exec_prefix@
+libdir = @libdir@
+pkgconfigdir = @pkgconfigdir@
+#---------------------------------------------------------------------------
+# DESTDIR is designed to facilitate making packages.  Normally it is empty
+#---------------------------------------------------------------------------
+#DESTDIR =
+DEST_PKGCONFIGDIR = $(DESTDIR)$(pkgconfigdir)
+#
+MKINSDIR = autoconf/mkinsdir.sh
+
+@SET_MAKE@
+SHELL = /bin/sh
+
+all: elf
+Makefile: configure autoconf/Makefile.in
+	@echo "Makefile is older than the configure script".
+	@echo "Please re-run the configure script."
+	@exit 1
+slsh/Makefile: configure slsh/Makefile.in
+	@echo "slsh/Makefile is older than its dependencies".
+	@echo "Please re-run the configure script."
+	@exit 1
+modules/Makefile: configure modules/Makefile.in
+	@echo "modules/Makefile is older than its dependencies".
+	@echo "Please re-run the configure script."
+	@exit 1
+src/Makefile: configure src/Makefile.in src/config.hin
+	@echo "src/Makefile is older than its dependencies".
+	@echo "Please re-run the configure script."
+	@exit 1
+#
+makefiles: Makefile slsh/Makefile modules/Makefile src/Makefile
+help:
+	@echo "make install ==> shared version of the library, slsh and modules"
+	@echo "make install-static ==> static version of the library and slsh; no modules"
+	@echo "make install-all ==> shared/static versions of the library/modules + shared slsh."
+	@echo "make install-modules ==> install the modules"
+	@echo "make check ==> Build the library and run the regression tests"
+slang.pc: configure autoconf/slangpc.in
+	@echo "slang.pc needs to be updated -- rerun configure"
+	@exit 1
+static: makefiles slang.pc
+	cd src; $(MAKE) static
+	cd slsh; $(MAKE) static
+modules:
+	cd modules; $(MAKE) all
+elf: makefiles slang.pc
+	cd src; $(MAKE) elf
+	cd slsh; $(MAKE) all
+	cd modules; $(MAKE) all
+	@echo Use make install to install it.
+runtests: all
+	@failed=0; \
+	cd src; $(MAKE) runtests || failed=1; cd ..; \
+	cd modules; $(MAKE) runtests || failed=1; cd ..; \
+	cd slsh; $(MAKE) runtests || failed=1; cd ..; \
+	exit $$failed
+check: runtests
+
+demos:
+	cd demo; $(MAKE)
+clean:
+	/bin/rm -f *~
+	cd src; $(MAKE) clean
+	cd modules; $(MAKE) clean
+	cd slsh; $(MAKE) clean
+	cd demo; $(MAKE) clean
+install-static: install-pkgconfig
+	cd src; $(MAKE) install-static
+	cd slsh; $(MAKE) install-static
+install-pkgconfig: slang.pc
+	$(MKINSDIR) $(DEST_PKGCONFIGDIR)
+	$(INSTALL_DATA) slang.pc $(DEST_PKGCONFIGDIR)/
+install-elf: install-pkgconfig
+	cd src; $(MAKE) install-elf
+	@echo Now installing slsh
+	cd slsh; $(MAKE) install
+	@echo Now installing the modules
+	cd modules; $(MAKE) install
+	@echo ""
+	@echo "On some systems, e.g., linux, you may also have to run ldconfig."
+	@echo ""
+install: install-elf install-pkgconfig
+install-all: install-elf
+	cd src; $(MAKE) install-static
+install-modules:
+	cd modules; $(MAKE) install
+install-links:
+	cd src; $(MAKE) install-links
+#
+distclean:
+	/bin/rm -f *~ Makefile config.status config.log config.cache files.pck slang.pc
+	cd src; $(MAKE) distclean
+	cd demo; $(MAKE) distclean
+	cd modules; $(MAKE) distclean
+	cd slsh; $(MAKE) distclean
+#
+.PHONY: all help static elf install clean check install-elf install-static makefiles install-pkgconfig
+#

_service:tar_scm:slang-2.3.2.tar.bz2/autoconf/aclocal.m4 Added

@@ -0,0 +1,1096 @@
+dnl# -*- mode: sh; mode: fold -*-
+dnl# 0.3.3-1: Use INSTALL instead of INSTALL_DATA to install modules to get executable permissions
+dnl# 0.3.3-0: Added $(OBJ_O_DEPS) and $(ELF_O_DEPS) to PROGRAM_OBJECT_RULES
+dnl# 0.3.2-0: Add rpath support for freebsd
+dnl# 0.3.1-0: New output variable: CC_SHARED_FLAGS; CC_SHARED is deprecated
+dnl# 0.3.0-0: Added support for parsing /etc/ld.so.conf
+dnl# 0.2.7-3: Change ncurses5w-config to ncursesw5-config (Gilles Espinasse)
+dnl# 0.2.7-2: For the Makefile rules, use cd foo && bar instead of cd foo; bar
+dnl# 0.2.7-1: Use "$ARCH"elfobjs instead of elf"$ARCH"objs for better flexibility
+dnl# 0.2.7-0: Instead of expanding $ARCH at configure time, use \$ARCH for compile-time expansion
+dnl# 0.2.6-2: Missing hyphen for cygwin ELFLIB_MAJOR (Marco Atzeri)
+dnl# 0.2.6-1: Added optional second and third arguments to AC_DEFINE (Marco Atzeri)
+dnl# 0.2.6-0: On cygwin, change libfooX_Y_Z.dll to cygfoo-X_Y_Z.dll (Marco Atzeri)
+dnl# 0.2.5-3: Changed AC_DEFUN(foo...) to AC_DEFUN(foo...)
+dnl# 0.2.5-2: JD_CHECK_FOR_LIBRARY will alse output *_INC_DIR and *_LIB_DIR
+dnl# 0.2.5-1: Updated using autoupdate
+dnl# 0.2.5-0: M_LIB output variable created for haiku support (Scott McCreary)
+dnl# 0.2.4-0: Added optional 3rd argument to JD_WITH_LIBRARY for a default path
+dnl# 0.2.3-2: X was missing in a "test" statement (Joerg Sommer)
+dnl# 0.2.3-1: AC_AIX needs to be called before running the compiler (Miroslav Lichvar)
+dnl# 0.2.3: rewrote JD_CHECK_FOR_LIBRARY to loop over include/lib pairs
+dnl# 0.2.2-1: JD_WITH_LIBRARY bug-fix
+dnl# 0.2.2: Use ncurses5-config to search for terminfo dirs.
+dnl# 0.2.1: Add .dll.a to list of extensions to when searching for libs (cygwin)
+dnl# 0.2.0: Added install target name and more fixes for cygwin
+dnl# 0.1.12: Improved support for cygwin
+dnl# 0.1.11: Fixed elf linking on freebsd (Renato Botelho (garga at freebsd, org)
+dnl# Version 0.1.10: rpath support for netbsd
+dnl# Version 0.1.9: When searching for libs, use dylib on darwin
+dnl# Version 0.1.8: Add rpath support for OpenBSD
+dnl# Version 0.1.7: removed "-K pic" from IRIX compiler lines
+dnl# Version 0.1.6: Added cygwin module support
+dnl# Version 0.1.5: Added gcc version-script support.
+
+AC_DEFUN(JD_INIT, dnl#{{{
+
+#These variable are initialized by JD init function
+CONFIG_DIR=`pwd`
+cd $srcdir
+if test "`pwd`" != "$CONFIG_DIR"
+then
+ AC_MSG_ERROR("This software does not support configuring from another directory. See the INSTALL file")
+fi
+dnl# if test "X$PWD" != "X"
+dnl# then
+dnl# CONFIG_DIR="$PWD"
+dnl# fi
+AC_SUBST(CONFIG_DIR)dnl
+# Note: these will differ if one is a symbolic link
+if test -f /usr/bin/dirname; then
+ JD_Above_Dir=`dirname $CONFIG_DIR`
+else
+# system is a loser
+ JD_Above_Dir=`cd ..;pwd`
+fi
+JD_Above_Dir2=`cd ..;pwd`
+)
+dnl#}}}
+
+dnl# This function expand the "prefix variables. For example, it will expand
+dnl# values such as ${exec_prefix}/foo when ${exec_prefix} itself has a
+dnl# of ${prefix}. This function produces the shell variables:
+dnl# jd_prefix_libdir, jd_prefix_incdir
+AC_DEFUN(JD_EXPAND_PREFIX, dnl#{{{
+
+ if test "X$jd_prefix" = "X"
+ then
+ jd_prefix=$ac_default_prefix
+ if test "X$prefix" != "XNONE"
+ then
+ jd_prefix="$prefix"
+ fi
+ jd_exec_prefix="$jd_prefix"
+ if test "X$exec_prefix" != "XNONE"
+ then
+ jd_exec_prefix="$exec_prefix"
+ fi
+
+ dnl#Unfortunately, exec_prefix may have a value like ${prefix}, etc.
+ dnl#Let the shell expand those. Yuk.
+ eval `sh <<EOF
+ prefix=$jd_prefix
+ exec_prefix=$jd_exec_prefix
+ libdir=$libdir
+ includedir=$includedir
+ echo jd_prefix_libdir="\$libdir" jd_prefix_incdir="\$includedir"
+EOF
+`
+ fi
+)
+#}}}
+
+AC_DEFUN(JD_GET_SYS_INCLIBS, dnl#{{{
+
+ if test -x $ac_aux_dir/scripts/getsyslibs.sh
+ then
+ JD_SYS_INCLIBS=`$ac_aux_dir/scripts/getsyslibs.sh`
+ else
+ JD_SYS_INCLIBS=""
+ fi
+)
+dnl#}}}
+
+AC_DEFUN(JD_SET_OBJ_SRC_DIR, dnl#{{{
+
+#---------------------------------------------------------------------------
+# Set the source directory and object directory. The makefile assumes an
+# absolute path name. This is because src/Makefile cds to OBJDIR and compiles
+# the src file which is in SRCDIR
+#---------------------------------------------------------------------------
+SRCDIR=$CONFIG_DIR
+if test "$1" != "."
+then
+ if test -z "$1"
+ then
+ SRCDIR=$SRCDIR/src
+ else
+ SRCDIR=$SRCDIR/$1
+ fi
+fi
+
+OBJDIR=$SRCDIR/"\$(ARCH)"objs
+ELFDIR=$SRCDIR/"\$(ARCH)"elfobjs
+AC_SUBST(SRCDIR)dnl
+AC_SUBST(OBJDIR)dnl
+AC_SUBST(ELFDIR)dnl
+)
+dnl#}}}
+
+RPATH=""
+AC_DEFUN(JD_INIT_RPATH, dnl#{{{
+
+dnl# determine whether or not -R or -rpath can be used
+case "$host_os" in
+ *linux*|*solaris* )
+ if test "X$GCC" = Xyes
+ then
+ if test "X$ac_R_nospace" = "Xno"
+ then
+ RPATH="-Wl,-R,"
+ else
+ RPATH="-Wl,-R"
+ fi
+ else
+ if test "X$ac_R_nospace" = "Xno"
+ then
+ RPATH="-R "
+ else
+	RPATH="-R"
+ fi
+ fi
+ ;;
+ *osf*|*openbsd*|*freebsd*)
+ if test "X$GCC" = Xyes
+ then
+ RPATH="-Wl,-rpath,"
+ else
+ RPATH="-rpath "
+ fi
+ ;;
+ *netbsd*)
+ if test "X$GCC" = Xyes
+ then
+ RPATH="-Wl,-R"
+ fi
+ ;;
+esac
+)
+
+dnl#}}}
+
+AC_DEFUN(JD_SET_RPATH, dnl#{{{
+
+if test "X$1" != "X"
+then
+ if test "X$RPATH" = "X"
+ then
+ JD_INIT_RPATH
+ if test "X$RPATH" != "X"
+ then
+ RPATH="$RPATH$1"
+ fi
+ else
+ _already_there=0
+ for X in `echo $RPATH | sed 's/:/ /g'`
+ do
+ if test "$X" = "$1"
+ then
+ _already_there=1
+	break
+ fi
+ done
+ if test $_already_there = 0
+ then
+ RPATH="$RPATH:$1"
+ fi
+ fi
+fi
+)
+AC_SUBST(RPATH)dnl
+
+dnl#}}}
+
+AC_DEFUN(JD_UPPERCASE, dnl#{{{
+
+changequote(<<, >>)dnl
+define(<<$2>>, translit($1, a-z, A-Z))dnl
+changequote(, )dnl
+)
+#}}}
+
+AC_DEFUN(JD_SIMPLE_LIB_DIR, dnl#{{{
+
+JD_UPPERCASE($1,JD_UP_NAME)
+JD_UP_NAME_LIB_DIR=$JD_Above_Dir/$1/libsrc/"$ARCH"objs
+JD_UP_NAME_INCLUDE=$JD_Above_Dir/$1/libsrc
+
+if test ! -d "$JD_UP_NAME_INCLUDE"
+then
+ JD_UP_NAME_LIB_DIR=$JD_Above_Dir/$1/src/"$ARCH"objs
+ JD_UP_NAME_INCLUDE=$JD_Above_Dir/$1/src
+ if test ! -d "$JD_UP_NAME_INCLUDE"
+ then
+ echo ""
+ echo WARNING------Unable to find the JD_UP_NAME directory
+ echo You may have to edit $CONFIG_DIR/src/Makefile.
+ echo ""
+ fi
+fi
+
+AC_SUBST(JD_UP_NAME_LIB_DIR)dnl
+AC_SUBST(JD_UP_NAME_INCLUDE)dnl
+undefine(JD_UP_NAME)dnl
+)
+
+dnl#}}}
+
+AC_DEFUN(JD_FIND_GENERIC, dnl#{{{
+
+ AC_REQUIRE(JD_EXPAND_PREFIX)dnl
+
+ changequote(<<, >>)dnl
+ define(<<JD_UP_NAME>>, translit($1, a-z, A-Z))dnl
+ changequote(, )dnl
+# Look for the JD_UP_NAME package
+#JD_UP_NAME_INCLUDE=""
+#JD_UP_NAME_LIB_DIR=""
+
+# This list consists of "include,lib include,lib ..."
+JD_Search_Dirs="$JD_Above_Dir2/$1/libsrc,$JD_Above_Dir2/$1/libsrc/"$ARCH"objs \
+ $JD_Above_Dir/$1/libsrc,$JD_Above_Dir/$1/libsrc/"$ARCH"objs \
+		$JD_Above_Dir2/$1/src,$JD_Above_Dir2/$1/src/"$ARCH"objs \
+ $JD_Above_Dir/$1/src,$JD_Above_Dir/$1/src/"$ARCH"objs"
+
+JD_Search_Dirs="$JD_Search_Dirs \
+ $jd_prefix_incdir,$jd_prefix_libdir \
+		$HOME/include,$HOME/lib"
+
+if test -n "$ARCH"
+then
+ JD_Search_Dirs="$JD_Search_Dirs $HOME/include,$HOME/$ARCH/lib"
+ JD_Search_Dirs="$JD_Search_Dirs $HOME/include,$HOME/sys/$ARCH/lib"
+fi
+
+# Now add the standard system includes. The reason for doing this is that
+# the other directories may have a better chance of containing a more recent
+# version.
+
+JD_Search_Dirs="$JD_Search_Dirs \
+ /usr/local/include,/usr/local/lib \
+		/usr/include,/usr/lib \
+		/usr/include/$1,/usr/lib \
+		/usr/include/$1,/usr/lib/$1"
+
+echo looking for the JD_UP_NAME library
+
+for include_and_lib in $JD_Search_Dirs
+do
+ # Yuk. Is there a better way to set these variables??
+ generic_include=`echo $include_and_lib | tr ',' ' ' | awk '{print $1}'`
+ generic_lib=`echo $include_and_lib | tr ',' ' ' | awk '{print $2}'`
+ echo Looking for $1.h in $generic_include
+ echo and lib$1.a in $generic_lib
+ if test -r $generic_include/$1.h && test -r $generic_lib/lib$1.a
+ then
+ echo Found it.
+ JD_UP_NAME_LIB_DIR="$generic_lib"
+ JD_UP_NAME_INCLUDE="$generic_include"
+ break
+ else
+ if test -r $generic_include/$1.h && test -r $generic_lib/lib$1.so
+ then
+ echo Found it.
+ JD_UP_NAME_LIB_DIR="$generic_lib"
+ JD_UP_NAME_INCLUDE="$generic_include"
+ break
+ fi
+ fi
+done
+
+if test -n "$JD_UP_NAME_LIB_DIR"
+then
+ jd_have_$1="yes"
+else
+ echo Unable to find the $JD_UP_NAME library.
+ echo You may have to edit $CONFIG_DIR/src/Makefile.
+ JD_UP_NAME_INCLUDE=$JD_Above_Dir/$1/src
+ JD_UP_NAME_LIB_DIR=$JD_Above_Dir/$1/src/"$ARCH"objs
+ jd_have_$1="no"
+fi
+
+JD_UP_NAME_INC="-I$JD_UP_NAME_INCLUDE"
+JD_UP_NAME_LIB="-L$JD_UP_NAME_LIB_DIR"
+JD_SET_RPATH($JD_UP_NAME_LIB_DIR)
+dnl# if test "X$GCC" = Xyes
+dnl# then
+dnl# RPATH_JD_UP_NAME="-Wl,-R$JD_UP_NAME_LIB_DIR"
+dnl# else
+dnl# RPATH_JD_UP_NAME="-R$JD_UP_NAME_LIB_DIR"
+dnl# fi
+
+# gcc under solaris is often not installed correctly. Avoid specifying
+# -I/usr/include.
+if test "$JD_UP_NAME_INC" = "-I/usr/include"
+then
+ JD_UP_NAME_INC=""
+fi
+
+if test "$JD_UP_NAME_LIB" = "-L/usr/lib"
+then
+ JD_UP_NAME_LIB=""
+ RPATH_JD_UP_NAME=""
+fi
+
+AC_SUBST(JD_UP_NAME_LIB)dnl
+AC_SUBST(JD_UP_NAME_INC)dnl
+AC_SUBST(JD_UP_NAME_LIB_DIR)dnl
+AC_SUBST(JD_UP_NAME_INCLUDE)dnl
+dnl# AC_SUBST(RPATH_JD_UP_NAME)dnl
+undefine(JD_UP_NAME)dnl
+)
+
+dnl#}}}
+
+AC_DEFUN(JD_FIND_SLANG, dnl#{{{
+
+JD_FIND_GENERIC(slang)
+)
+
+dnl#}}}
+
+AC_DEFUN(JD_GCC_WARNINGS, dnl#{{{
+
+AC_ARG_ENABLE(warnings,
+	 AC_HELP_STRING(--enable-warnings,turn on GCC compiler warnings),
+	 gcc_warnings=$enableval)
+if test -n "$GCC"
+then
+ #CFLAGS="$CFLAGS -fno-strength-reduce"
+ if test -n "$gcc_warnings"
+ then
+ CFLAGS="$CFLAGS -Wall -W -pedantic -Winline -Wmissing-prototypes \
+ -Wnested-externs -Wpointer-arith -Wcast-align -Wshadow -Wstrict-prototypes \
+ -Wformat=2"
+ # Now trim excess whitespace
+ CFLAGS=`echo $CFLAGS`
+ fi
+fi
+)
+
+dnl#}}}
+
+IEEE_CFLAGS=""
+AC_DEFUN(JD_IEEE_CFLAGS, dnl#{{{
+
+case "$host_cpu" in
+ *alpha* )
+ if test "$GCC" = yes
+ then
+ IEEE_CFLAGS="-mieee"
+ else
+ IEEE_CFLAGS="-ieee_with_no_inexact"
+ fi
+ ;;
+ * )
+ IEEE_CFLAGS=""
+esac
+)
+
+dnl#}}}
+
+AC_DEFUN(JD_CREATE_ORULE, dnl#{{{
+
+PROGRAM_OBJECT_RULES="$PROGRAM_OBJECT_RULES
+\$(OBJDIR)/$1.o : \$(SRCDIR)/$1.c \$(DOT_O_DEPS) \$(OBJ_O_DEPS) \$("$1"_O_DEP)
+	cd \$(OBJDIR) && \$(COMPILE_CMD) \$("$1"_C_FLAGS) \$(SRCDIR)/$1.c
+"
+)
+
+dnl#}}}
+
+AC_DEFUN(JD_CREATE_ELFORULE, dnl#{{{
+
+PROGRAM_ELF_ORULES="$PROGRAM_ELF_ORULES
+\$(ELFDIR)/$1.o : \$(SRCDIR)/$1.c \$(DOT_O_DEPS) \$(ELF_O_DEPS) \$("$1"_O_DEP)
+	cd \$(ELFDIR) && \$(ELFCOMPILE_CMD) \$("$1"_C_FLAGS) \$(SRCDIR)/$1.c
+"
+)
+
+dnl#}}}
+
+AC_DEFUN(JD_CREATE_EXEC_RULE, dnl#{{{
+
+PROGRAM_OBJECT_RULES="$PROGRAM_OBJECT_RULES
+$1 : \$(OBJDIR)/$1
+	@echo $1 created in \$(OBJDIR)
+\$(OBJDIR)/$1 : \$(OBJDIR)/$1.o \$("$1"_DEPS) \$(EXECDEPS)
+	\$(CC) -o \$(OBJDIR)/$1 \$(LDFLAGS) \$(OBJDIR)/$1.o \$("$1"_LIBS) \$(EXECLIBS)
+\$(OBJDIR)/$1.o : \$(SRCDIR)/$1.c \$(DOT_O_DEPS) \$("$1"_O_DEP)
+	cd \$(OBJDIR) && \$(COMPILE_CMD) \$("$1"_INC) \$(EXECINC) \$(SRCDIR)/$1.c
+"
+)
+
+dnl#}}}
+
+AC_DEFUN(JD_CREATE_MODULE_ORULES, dnl#{{{
+
+ for program_module in $Program_Modules; do
+ JD_CREATE_ORULE($program_module)
+ JD_CREATE_ELFORULE($program_module)
+ done
+)
+
+dnl#}}}
+
+AC_DEFUN(JD_GET_MODULES, dnl#{{{
+
+ PROGRAM_HFILES=""
+ PROGRAM_OFILES=""
+ PROGRAM_CFILES=""
+ PROGRAM_OBJECTS=""
+ PROGRAM_ELFOBJECTS=""
+ PROGRAM_OBJECT_RULES=""
+ PROGRAM_ELF_ORULES=""
+ if test -z "$1"
+ then
+ Program_Modules=""
+ else
+ comment_re="^#"
+ Program_Modules=`grep -v '$comment_re' $1 | awk '{print $1}'`
+ Program_H_Modules=`grep -v '$comment_re' $1 | awk '{print $2}'`
+ for program_module in $Program_H_Modules; do
+ PROGRAM_HFILES="$PROGRAM_HFILES $program_module"
+ done
+ fi
+ for program_module in $Program_Modules; do
+ PROGRAM_OFILES="$PROGRAM_OFILES $program_module.o"
+ PROGRAM_CFILES="$PROGRAM_CFILES $program_module.c"
+ PROGRAM_OBJECTS="$PROGRAM_OBJECTS \$(OBJDIR)/$program_module.o"
+ PROGRAM_ELFOBJECTS="$PROGRAM_ELFOBJECTS \$(ELFDIR)/$program_module.o"
+ done
+dnl echo $PROGRAM_OFILES
+dnl echo $PROGRAM_HFILES
+AC_SUBST(PROGRAM_OFILES)dnl
+AC_SUBST(PROGRAM_CFILES)dnl
+AC_SUBST(PROGRAM_HFILES)dnl
+AC_SUBST(PROGRAM_OBJECTS)dnl
+AC_SUBST(PROGRAM_ELFOBJECTS)dnl
+)
+
+dnl#}}}
+
+AC_DEFUN(JD_APPEND_RULES, dnl#{{{
+
+ echo "$PROGRAM_OBJECT_RULES" >> $1
+)
+
+dnl#}}}
+
+AC_DEFUN(JD_APPEND_ELFRULES, dnl#{{{
+
+ echo "$PROGRAM_ELF_ORULES" >> $1
+)
+
+dnl#}}}
+
+AC_DEFUN(JD_CREATE_MODULE_EXEC_RULES, dnl#{{{
+
+ for program_module in $Program_Modules; do
+ JD_CREATE_EXEC_RULE($program_module)
+ done
+)
+
+dnl#}}}
+
+AC_DEFUN(JD_TERMCAP, dnl#{{{
+
+AC_PATH_PROG(nc5config, ncurses5-config, no)
+if test "$nc5config" = "no"
+then
+ AC_PATH_PROG(nc5config, ncursesw5-config, no)
+fi
+AC_MSG_CHECKING(for terminfo)
+if test "$nc5config" != "no"
+then
+ MISC_TERMINFO_DIRS=`$nc5config --terminfo`
+else
+ MISC_TERMINFO_DIRS=""
+fi
+JD_Terminfo_Dirs="$MISC_TERMINFO_DIRS \
+ /usr/lib/terminfo \
+ /usr/share/terminfo \
+ /usr/share/lib/terminfo \
+		 /usr/local/lib/terminfo"
+TERMCAP=-ltermcap
+
+for terminfo_dir in $JD_Terminfo_Dirs
+do
+ if test -d $terminfo_dir
+ then
+ AC_MSG_RESULT(yes)
+ TERMCAP=""
+ break
+ fi
+done
+if test "$TERMCAP"; then
+ AC_MSG_RESULT(no)
+ AC_DEFINE(USE_TERMCAP,1,Define to use termcap)
+fi
+AC_SUBST(TERMCAP)dnl
+AC_SUBST(MISC_TERMINFO_DIRS)dnl
+)
+
+dnl#}}}
+
+AC_DEFUN(JD_ANSI_CC, dnl#{{{
+
+AC_AIX
+AC_REQUIRE(AC_PROG_CC)
+AC_REQUIRE(AC_PROG_CPP)
+AC_REQUIRE(AC_PROG_GCC_TRADITIONAL)
+AC_ISC_POSIX
+
+dnl #This stuff came from Yorick config script
+dnl
+dnl # HPUX needs special stuff
+dnl
+AC_EGREP_CPP(yes,
+#ifdef hpux
+ yes
+#endif
+, 
+AC_DEFINE(_HPUX_SOURCE,1,Special define needed for HPUX)
+if test "$CC" = cc; then CC="cc -Ae"; fi
+)dnl
+dnl
+dnl #Be sure we've found compiler that understands prototypes
+dnl
+AC_MSG_CHECKING(C compiler that understands ANSI prototypes)
+AC_COMPILE_IFELSE(AC_LANG_PROGRAM( , 
+ extern int silly (int);),
+ AC_MSG_RESULT($CC looks ok. Good.),
+ AC_MSG_RESULT($CC is not a good enough compiler)
+ AC_MSG_ERROR(Set env variable CC to your ANSI compiler and rerun configure.)
+ )dnl
+)dnl
+
+dnl#}}}
+
+AC_DEFUN(JD_ELF_COMPILER, dnl#{{{
+
+dnl #-------------------------------------------------------------------------
+dnl # Check for dynamic linker
+dnl #-------------------------------------------------------------------------
+DYNAMIC_LINK_LIB=""
+
+dnl# AH_TEMPLATE(HAVE_DLOPEN,1,Define if you have dlopen)
+
+AC_CHECK_HEADER(dlfcn.h,
+ AC_DEFINE(HAVE_DLFCN_H,1,Define if you have the dlfcn.h header)
+ AC_CHECK_LIB(dl,dlopen,
+ DYNAMIC_LINK_LIB="-ldl"
+ AC_DEFINE(HAVE_DLOPEN,1,Define if you have dlopen)
+ ,
+ AC_CHECK_FUNC(dlopen,AC_DEFINE(HAVE_DLOPEN,Define if you have dlopen))
+ if test "$ac_cv_func_dlopen" != yes
+ then
+ AC_MSG_WARN(cannot perform dynamic linking)
+ fi
+ ))
+AC_SUBST(DYNAMIC_LINK_LIB)
+
+if test "$GCC" = yes
+then
+ if test X"$CFLAGS" = X
+ then
+ CFLAGS="-O2"
+ fi
+fi
+
+dnl #Some defaults
+ELFLIB="lib\$(THIS_LIB).so"
+ELFLIB_MAJOR="\$(ELFLIB).\$(ELF_MAJOR_VERSION)"
+ELFLIB_MAJOR_MINOR="\$(ELFLIB_MAJOR).\$(ELF_MINOR_VERSION)"
+ELFLIB_MAJOR_MINOR_MICRO="\$(ELFLIB_MAJOR_MINOR).\$(ELF_MICRO_VERSION)"
+
+dnl# This specifies the target to use in the makefile to install the shared library
+INSTALL_ELFLIB_TARGET="install-elf-and-links"
+ELFLIB_BUILD_NAME="\$(ELFLIB_MAJOR_MINOR_MICRO)"
+INSTALL_MODULE="\$(INSTALL)"
+SLANG_DLL_CFLAGS=""
+M_LIB="-lm"
+
+case "$host_os" in
+ *linux*|*gnu*|k*bsd*-gnu )
+ DYNAMIC_LINK_FLAGS="-Wl,-export-dynamic"
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fPIC"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-O1 -Wl,--version-script,\$(VERSION_SCRIPT) -Wl,-soname,\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS="\$(DL_LIB) -lm -lc"
+ CC_SHARED_FLAGS="-shared -fPIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ ;;
+ *solaris* )
+ if test "$GCC" = yes
+ then
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fPIC"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-ztext -Wl,-h,\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS="\$(DL_LIB) -lm -lc"
+ CC_SHARED_FLAGS="-G -fPIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ else
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -K PIC"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -G -h\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS="\$(DL_LIB) -lm -lc"
+ CC_SHARED_FLAGS="-G -K PIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ fi
+ ;;
+ # osr5 or unixware7 with current or late autoconf
+ *sco3.2v5* | *unixware-5* | *sco-sysv5uw7*)
+ if test "$GCC" = yes
+ then
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fPIC"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-h,\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS=
+ CC_SHARED_FLAGS="-G -fPIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ else
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -K pic"
+ # ELF_LINK="ld -G -z text -h#"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -G -z text -h\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS=
+ CC_SHARED_FLAGS="-G -K pic"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ fi
+ ;;
+ *irix6.5* )
+ echo "Note: ELF compiler for host_os=$host_os may not be correct"
+ echo "double-check: 'mode_t', 'pid_t' may be wrong!"
+ if test "$GCC" = yes
+ then
+ # not tested
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fPIC"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-h,\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS=
+ CC_SHARED_FLAGS="-shared -fPIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ else
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS)" # default anyhow
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -o \$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS=
+ CC_SHARED_FLAGS="-shared"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ fi
+ ;;
+ *darwin* )
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fno-common"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -dynamiclib -install_name \$(install_lib_dir)/\$(ELFLIB_MAJOR) -compatibility_version \$(ELF_MAJOR_VERSION) -current_version \$(ELF_MAJOR_VERSION).\$(ELF_MINOR_VERSION)"
+ ELF_DEP_LIBS="\$(LDFLAGS) \$(DL_LIB)"
+ CC_SHARED_FLAGS="-bundle -flat_namespace -undefined suppress -fno-common"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ ELFLIB="lib\$(THIS_LIB).dylib"
+ ELFLIB_MAJOR="lib\$(THIS_LIB).\$(ELF_MAJOR_VERSION).dylib"
+ ELFLIB_MAJOR_MINOR="lib\$(THIS_LIB).\$(ELF_MAJOR_VERSION).\$(ELF_MINOR_VERSION).dylib"
+ ELFLIB_MAJOR_MINOR_MICRO="lib\$(THIS_LIB).\$(ELF_MAJOR_VERSION).\$(ELF_MINOR_VERSION).\$(ELF_MICRO_VERSION).dylib"
+ ;;
+ *freebsd* )
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fPIC"
+ #if test "X$PORTOBJFORMAT" = "Xelf" ; then
+ # ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-soname,\$(ELFLIB_MAJOR)"
+ #else
+ # ELF_LINK="ld -Bshareable -x"
+ #fi
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-soname,\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS="\$(DL_LIB) -lm"
+ CC_SHARED_FLAGS="-shared -fPIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ ;;
+ *cygwin* )
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ SLANG_DLL_CFLAGS="-DSLANG_DLL=1"
+ ELF_CFLAGS="\$(CFLAGS) -DBUILD_DLL=1"
+ DLL_IMPLIB_NAME="lib\$(THIS_LIB)\$(ELFLIB_MAJOR_VERSION).dll.a"
+ #ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-O1 -Wl,--version-script,\$(VERSION_SCRIPT) -Wl,-soname,\$(ELFLIB_MAJOR) -Wl,--out-implib=\$(DLL_IMPLIB_NAME) -Wl,-export-all-symbols -Wl,-enable-auto-import"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-O1 -Wl,--version-script,\$(VERSION_SCRIPT) -Wl,-soname,\$(ELFLIB_MAJOR) -Wl,--out-implib=\$(DLL_IMPLIB_NAME)"
+ ELF_DEP_LIBS="\$(DL_LIB) -lm"
+ CC_SHARED_FLAGS="-shared -DSLANG_DLL=1"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ dnl# CYGWIN prohibits undefined symbols when linking shared libs
+ SLANG_LIB_FOR_MODULES="-L\$(ELFDIR) -lslang"
+ INSTALL_MODULE="\$(INSTALL)"
+ INSTALL_ELFLIB_TARGET="install-elf-cygwin"
+ ELFLIB="lib\$(THIS_LIB).dll"
+ ELFLIB_MAJOR="cyg\$(THIS_LIB)-\$(ELF_MAJOR_VERSION).dll"
+ ELFLIB_MAJOR_MINOR="cyg\$(THIS_LIB)-\$(ELF_MAJOR_VERSION)_\$(ELF_MINOR_VERSION).dll"
+ ELFLIB_MAJOR_MINOR_MICRO="cyg\$(THIS_LIB)-\$(ELF_MAJOR_VERSION)_\$(ELF_MINOR_VERSION)_\$(ELF_MICRO_VERSION).dll"
+ ELFLIB_BUILD_NAME="\$(ELFLIB_MAJOR)"
+ ;;
+ *haiku* )
+ M_LIB=""
+ DYNAMIC_LINK_FLAGS="-Wl,-export-dynamic"
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fPIC"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-O1 -Wl,--version-script,\$(VERSION_SCRIPT) -Wl,-soname,\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS="\$(DL_LIB)"
+ CC_SHARED_FLAGS="-shared -fPIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ ;;
+ * )
+ echo "Note: ELF compiler for host_os=$host_os may be wrong"
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fPIC"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared"
+ ELF_DEP_LIBS="\$(DL_LIB) -lm -lc"
+ CC_SHARED_FLAGS="-shared -fPIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+esac
+
+AC_SUBST(ELF_CC)
+AC_SUBST(ELF_CFLAGS)
+AC_SUBST(ELF_LINK)
+AC_SUBST(ELF_LINK_CMD)
+AC_SUBST(ELF_DEP_LIBS)
+AC_SUBST(DYNAMIC_LINK_FLAGS)
+AC_SUBST(CC_SHARED_FLAGS)
+AC_SUBST(CC_SHARED)
+AC_SUBST(ELFLIB)
+AC_SUBST(ELFLIB_MAJOR)
+AC_SUBST(ELFLIB_MAJOR_MINOR)
+AC_SUBST(ELFLIB_MAJOR_MINOR_MICRO)
+AC_SUBST(SLANG_LIB_FOR_MODULES)
+AC_SUBST(DLL_IMPLIB_NAME)
+AC_SUBST(INSTALL_MODULE)
+AC_SUBST(INSTALL_ELFLIB_TARGET)
+AC_SUBST(ELFLIB_BUILD_NAME)
+AC_SUBST(SLANG_DLL_CFLAGS)
+AC_SUBST(M_LIB)
+)
+
+dnl#}}}
+
+AC_DEFUN(JD_F77_COMPILER, dnl#{{{
+
+case "$host_os" in
+ *linux* )
+ F77="g77"
+ F77_LIBS="-lg2c"
+ ;;
+ *solaris*)
+ F77=f77
+ #F77_LIBS="-lF77 -lM77 -L/opt/SUNWspro/SC4.0/lib -lsunmath"
+ F77_LIBS="-lF77 -lM77 -lsunmath"
+ ;;
+ *)
+ echo ""
+ echo "WARNING: Assuming f77 as your FORTRAN compiler"
+ echo ""
+ F77=f77
+ F77_LIBS=""
+esac
+AC_SUBST(F77)
+AC_SUBST(F77_LIBS)
+)
+
+dnl#}}}
+
+dnl# This macro process the --with-xxx, --with-xxxinc, and --with-xxxlib
+dnl# command line arguments and returns the values as shell variables
+dnl# jd_xxx_include_dir and jd_xxx_library_dir. It does not perform any
+dnl# substitutions, nor check for the existence of the supplied values.
+AC_DEFUN(JD_WITH_LIBRARY_PATHS, dnl#{{{
+
+ JD_UPPERCASE($1,JD_ARG1)
+ jd_$1_include_dir=""
+ jd_$1_library_dir=""
+ if test X"$jd_with_$1_library" = X
+ then
+ jd_with_$1_library=""
+ fi
+
+ AC_ARG_WITH($1,
+ --with-$1=DIR Use DIR/lib and DIR/include for $1,
+ jd_with_$1_arg=$withval, jd_with_$1_arg=unspecified)
+
+ case "x$jd_with_$1_arg" in
+ xno)
+ jd_with_$1_library="no"
+ ;;
+ x)
+ dnl# AC_MSG_ERROR(--with-$1 requires a value-- try yes or no)
+ jd_with_$1_library="yes"
+ ;;
+ xunspecified)
+ ;;
+ xyes)
+ jd_with_$1_library="yes"
+ ;;
+ *)
+ jd_with_$1_library="yes"
+ jd_$1_include_dir="$jd_with_$1_arg"/include
+ jd_$1_library_dir="$jd_with_$1_arg"/lib
+ ;;
+ esac
+
+ AC_ARG_WITH($1lib,
+ --with-$1lib=DIR $1 library in DIR,
+ jd_with_$1lib_arg=$withval, jd_with_$1lib_arg=unspecified)
+ case "x$jd_with_$1lib_arg" in
+ xunspecified)
+ ;;
+ xno)
+ ;;
+ x)
+ AC_MSG_ERROR(--with-$1lib requres a value)
+ ;;
+ *)
+ jd_with_$1_library="yes"
+ jd_$1_library_dir="$jd_with_$1lib_arg"
+ ;;
+ esac
+
+ AC_ARG_WITH($1inc,
+ --with-$1inc=DIR $1 include files in DIR,
+ jd_with_$1inc_arg=$withval, jd_with_$1inc_arg=unspecified)
+ case "x$jd_with_$1inc_arg" in
+ x)
+ AC_MSG_ERROR(--with-$1inc requres a value)
+ ;;
+ xunspecified)
+ ;;
+ xno)
+ ;;
+ *)
+ jd_with_$1_library="yes"
+ jd_$1_include_dir="$jd_with_$1inc_arg"
+ ;;
+ esac
+)
+dnl#}}}
+
+dnl# This function checks for the existence of the specified library $1 with
+dnl# header file $2. If the library exists, then the shell variables will
+dnl# be created:
+dnl# jd_with_$1_library=yes/no,
+dnl# jd_$1_inc_file
+dnl# jd_$1_include_dir
+dnl# jd_$1_library_dir
+dnl# If $3 is present, then also look in $3/include+$3/lib
+AC_DEFUN(JD_CHECK_FOR_LIBRARY, dnl#{{{
+
+ AC_REQUIRE(JD_EXPAND_PREFIX)dnl
+ AC_REQUIRE(JD_GET_SYS_INCLIBS)dnl
+ dnl JD_UPPERCASE($1,JD_ARG1)
+ JD_WITH_LIBRARY_PATHS($1)
+ AC_MSG_CHECKING(for the $1 library and header files $2)
+ if test X"$jd_with_$1_library" != Xno
+ then
+ jd_$1_inc_file=$2
+ dnl# jd_with_$1_library="yes"
+
+ if test "X$jd_$1_inc_file" = "X"
+ then
+ jd_$1_inc_file=$1.h
+ fi
+
+ if test X"$jd_$1_include_dir" = X
+ then
+ inc_and_lib_dirs="\
+ $jd_prefix_incdir,$jd_prefix_libdir \
+	 /usr/local/$1/include,/usr/local/$1/lib \
+	 /usr/local/include/$1,/usr/local/lib \
+	 /usr/local/include,/usr/local/lib \
+	 $JD_SYS_INCLIBS \
+	 /usr/include/$1,/usr/lib \
+	 /usr/$1/include,/usr/$1/lib \
+	 /usr/include,/usr/lib \
+	 /opt/include/$1,/opt/lib \
+	 /opt/$1/include,/opt/$1/lib \
+	 /opt/include,/opt/lib"
+
+ if test X$3 != X
+ then
+ inc_and_lib_dirs="$3/include,$3/lib $inc_and_lib_dirs"
+ fi
+
+ case "$host_os" in
+ *darwin* )
+	 exts="dylib so a"
+	 ;;
+	 *cygwin* )
+	 exts="dll.a so a"
+	 ;;
+	 * )
+	 exts="so a"
+ esac
+
+ xincfile="$jd_$1_inc_file"
+ xlibfile="lib$1"
+ jd_with_$1_library="no"
+
+ for include_and_lib in $inc_and_lib_dirs
+ do
+ # Yuk. Is there a better way to set these variables??
+ xincdir=`echo $include_and_lib | tr ',' ' ' | awk '{print $1}'`
+	xlibdir=`echo $include_and_lib | tr ',' ' ' | awk '{print $2}'`
+	found=0
+	if test -r $xincdir/$xincfile
+	then
+	 for E in $exts
+	 do
+	 if test -r "$xlibdir/$xlibfile.$E"
+	 then
+	 jd_$1_include_dir="$xincdir"
+	 jd_$1_library_dir="$xlibdir"
+	 jd_with_$1_library="yes"
+	 found=1
+	 break
+	 fi
+	 done
+	fi
+	if test $found -eq 1
+	then
+	 break
+	fi
+ done
+ fi
+ fi
+
+ if test X"$jd_$1_include_dir" != X -a X"$jd_$1_library_dir" != X
+ then
+ AC_MSG_RESULT(yes: $jd_$1_library_dir and $jd_$1_include_dir)
+ jd_with_$1_library="yes"
+ dnl# Avoid using /usr/lib and /usr/include because of problems with
+ dnl# gcc on some solaris systems.
+ JD_ARG1_LIB=-L$jd_$1_library_dir
+ JD_ARG1_LIB_DIR=$jd_$1_library_dir
+ if test "X$jd_$1_library_dir" = "X/usr/lib" -o "X$jd_$1_include_dir" = "X/usr/include"
+ then
+ JD_ARG1_LIB=""
+ else
+ JD_SET_RPATH($jd_$1_library_dir)
+ fi
+
+ JD_ARG1_INC=-I$jd_$1_include_dir
+ JD_ARG1_INC_DIR=$jd_$1_include_dir
+ if test "X$jd_$1_include_dir" = "X/usr/include"
+ then
+ JD_ARG1_INC=""
+ fi
+ else
+ AC_MSG_RESULT(no)
+ jd_with_$1_library="no"
+ JD_ARG1_INC=""
+ JD_ARG1_LIB=""
+ JD_ARG1_INC_DIR=""
+ JD_ARG1_LIB_DIR=""
+ fi
+ AC_SUBST(JD_ARG1_LIB)
+ AC_SUBST(JD_ARG1_INC)
+ AC_SUBST(JD_ARG1_LIB_DIR)
+ AC_SUBST(JD_ARG1_INC_DIR)
+)
+dnl#}}}
+
+AC_DEFUN(JD_WITH_LIBRARY, dnl#{{{
+
+ JD_CHECK_FOR_LIBRARY($1, $2, $3)
+ if test "$jd_with_$1_library" = "no"
+ then
+ AC_MSG_ERROR(unable to find the $1 library and header file $jd_$1_inc_file)
+ fi
+)
+dnl#}}}
+
+AC_DEFUN(JD_SLANG_VERSION, dnl#{{{
+
+ slang_h=$jd_slang_include_dir/slang.h
+ AC_MSG_CHECKING(SLANG_VERSION in $slang_h)
+slang_version=`grep "^#define *SLANG_VERSION " $slang_h |
+ awk '{ print $3 }'`
+slang_major_version=`echo $slang_version |
+ awk '{ print int($1/10000) }'`
+slang_minor_version=`echo $slang_version $slang_major_version |
+ awk '{ print int(($1 - $2*10000)/100) }'`
+slang_patchlevel_version=`echo $slang_version $slang_major_version $slang_minor_version |
+ awk '{ print ($1 - $2*10000 - $3*100) }'`
+
+AC_MSG_RESULT($slang_major_version.$slang_minor_version.$slang_patchlevel_version)
+AC_SUBST(slang_version)
+AC_SUBST(slang_major_version)
+AC_SUBST(slang_minor_version)
+AC_SUBST(slang_patchlevel_version)
+)
+#}}}
+
+AC_DEFUN(JD_SLANG_MODULE_INSTALL_DIR, dnl#{{{
+
+ AC_REQUIRE(JD_SLANG_VERSION)
+ if test "X$slang_major_version" = "X1"
+ then
+ MODULE_INSTALL_DIR="$libdir/slang/modules"
+ else
+ MODULE_INSTALL_DIR="$libdir/slang/v$slang_major_version/modules"
+ fi
+ SL_FILES_INSTALL_DIR=$datadir/slsh/local-packages
+ AC_SUBST(MODULE_INSTALL_DIR)
+ AC_SUBST(SL_FILES_INSTALL_DIR)
+)
+#}}}
+
+AC_DEFUN(JD_CHECK_LONG_LONG, dnl#{{{
+
+ AC_CHECK_TYPES(long long)
+ AC_CHECK_SIZEOF(long long)
+)
+dnl#}}}
+
+AC_DEFUN(JD_LARGE_FILE_SUPPORTXXX, dnl#{{{
+
+ AC_REQUIRE(JD_CHECK_LONG_LONG)
+ AC_MSG_CHECKING(whether to explicitly activate long file support)
+ AC_DEFINE(_LARGEFILE_SOURCE, 1)
+ AC_DEFINE(_FILE_OFFSET_BITS, 64)
+ jd_large_file_support=no
+ if test X$ac_cv_type_long_long = Xyes
+ then
+ if test $ac_cv_sizeof_long_long -ge 8
+ then
+ jd_large_file_support=yes
+ fi
+ fi
+
+ if test $jd_large_file_support = yes
+ then
+ AC_DEFINE(HAVE_LARGEFILE_SUPPORT, 1)
+ AC_MSG_RESULT(yes)
+ else
+ AC_MSG_RESULT(no)
+ fi
+)
+dnl#}}}
+
+AC_DEFUN(JD_LARGE_FILE_SUPPORT, dnl#{{{
+
+ AC_SYS_LARGEFILE
+ AC_FUNC_FSEEKO
+ AC_TYPE_OFF_T
+ AC_CHECK_SIZEOF(off_t)
+)
+#}}}
+
+AC_DEFUN(JD_HAVE_ISINF, dnl#{{{
+
+ AC_MSG_CHECKING(for isinf)
+ AC_LINK_IFELSE(AC_LANG_PROGRAM( #include <math.h>, isinf (0.0);),
+ AC_MSG_RESULT(yes)
+ AC_DEFINE(HAVE_ISINF, 1))
+)
+#}}}

_service:tar_scm:slang-2.3.2.tar.bz2/autoconf/config.guess Added

@@ -0,0 +1,1454 @@
+#! /bin/sh
+# Attempt to guess a canonical system name.
+# Copyright 1992-2016 Free Software Foundation, Inc.
+
+timestamp='2016-04-02'
+
+# This file 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/>.
+#
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that
+# program. This Exception is an additional permission under section 7
+# of the GNU General Public License, version 3 ("GPLv3").
+#
+# Originally written by Per Bothner; maintained since 2000 by Ben Elliston.
+#
+# You can get the latest version of this script from:
+# http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess
+#
+# Please send patches to <config-patches@gnu.org>.
+
+
+me=`echo "$0" | sed -e 's,.*/,,'`
+
+usage="\
+Usage: $0 OPTION
+
+Output the configuration name of the system \`$me' is run on.
+
+Operation modes:
+ -h, --help print this help, then exit
+ -t, --time-stamp print date of last modification, then exit
+ -v, --version print version number, then exit
+
+Report bugs and patches to <config-patches@gnu.org>."
+
+version="\
+GNU config.guess ($timestamp)
+
+Originally written by Per Bothner.
+Copyright 1992-2016 Free Software Foundation, Inc.
+
+This is free software; see the source for copying conditions. There is NO
+warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE."
+
+help="
+Try \`$me --help' for more information."
+
+# Parse command line
+while test $# -gt 0 ; do
+ case $1 in
+ --time-stamp | --time* | -t )
+ echo "$timestamp" ; exit ;;
+ --version | -v )
+ echo "$version" ; exit ;;
+ --help | --h* | -h )
+ echo "$usage"; exit ;;
+ -- ) # Stop option processing
+ shift; break ;;
+ - )	# Use stdin as input.
+ break ;;
+ -* )
+ echo "$me: invalid option $1$help" >&2
+ exit 1 ;;
+ * )
+ break ;;
+ esac
+done
+
+if test $# != 0; then
+ echo "$me: too many arguments$help" >&2
+ exit 1
+fi
+
+trap 'exit 1' 1 2 15
+
+# CC_FOR_BUILD -- compiler used by this script. Note that the use of a
+# compiler to aid in system detection is discouraged as it requires
+# temporary files to be created and, as you can see below, it is a
+# headache to deal with in a portable fashion.
+
+# Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still
+# use `HOST_CC' if defined, but it is deprecated.
+
+# Portable tmp directory creation inspired by the Autoconf team.
+
+set_cc_for_build='
+trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ;
+trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ;
+: ${TMPDIR=/tmp} ;
+ { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } ||
+ { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } ||
+ { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } ||
+ { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ;
+dummy=$tmp/dummy ;
+tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ;
+case $CC_FOR_BUILD,$HOST_CC,$CC in
+ ,,) echo "int x;" > $dummy.c ;
+	for c in cc gcc c89 c99 ; do
+	 if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then
+	 CC_FOR_BUILD="$c"; break ;
+	 fi ;
+	done ;
+	if test x"$CC_FOR_BUILD" = x ; then
+	 CC_FOR_BUILD=no_compiler_found ;
+	fi
+	;;
+ ,,*) CC_FOR_BUILD=$CC ;;
+ ,*,*) CC_FOR_BUILD=$HOST_CC ;;
+esac ; set_cc_for_build= ;'
+
+# This is needed to find uname on a Pyramid OSx when run in the BSD universe.
+# (ghazi@noc.rutgers.edu 1994-08-24)
+if (test -f /.attbin/uname) >/dev/null 2>&1 ; then
+	PATH=$PATH:/.attbin ; export PATH
+fi
+
+UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown
+UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown
+UNAME_SYSTEM=`(uname -s) 2>/dev/null` || UNAME_SYSTEM=unknown
+UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown
+
+case "${UNAME_SYSTEM}" in
+Linux|GNU|GNU/*)
+	# If the system lacks a compiler, then just pick glibc.
+	# We could probably try harder.
+	LIBC=gnu
+
+	eval $set_cc_for_build
+	cat <<-EOF > $dummy.c
+	#include <features.h>
+	#if defined(__UCLIBC__)
+	LIBC=uclibc
+	#elif defined(__dietlibc__)
+	LIBC=dietlibc
+	#else
+	LIBC=gnu
+	#endif
+	EOF
+	eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^LIBC' | sed 's, ,,g'`
+	;;
+esac
+
+# Note: order is significant - the case branches are not exclusive.
+
+case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in
+ *:NetBSD:*:*)
+	# NetBSD (nbsd) targets should (where applicable) match one or
+	# more of the tuples: *-*-netbsdelf*, *-*-netbsdaout*,
+	# *-*-netbsdecoff* and *-*-netbsd*. For targets that recently
+	# switched to ELF, *-*-netbsd* would select the old
+	# object file format. This provides both forward
+	# compatibility and a consistent mechanism for selecting the
+	# object file format.
+	#
+	# Note: NetBSD doesn't particularly care about the vendor
+	# portion of the name. We always set it to "unknown".
+	sysctl="sysctl -n hw.machine_arch"
+	UNAME_MACHINE_ARCH=`(uname -p 2>/dev/null || \
+	 /sbin/$sysctl 2>/dev/null || \
+	 /usr/sbin/$sysctl 2>/dev/null || \
+	 echo unknown)`
+	case "${UNAME_MACHINE_ARCH}" in
+	 armeb) machine=armeb-unknown ;;
+	 arm*) machine=arm-unknown ;;
+	 sh3el) machine=shl-unknown ;;
+	 sh3eb) machine=sh-unknown ;;
+	 sh5el) machine=sh5le-unknown ;;
+	 earmv*)
+		arch=`echo ${UNAME_MACHINE_ARCH} | sed -e 's,^e$armv0-9$.*$,\1,'`
+		endian=`echo ${UNAME_MACHINE_ARCH} | sed -ne 's,^.*$eb$$,\1,p'`
+		machine=${arch}${endian}-unknown
+		;;
+	 *) machine=${UNAME_MACHINE_ARCH}-unknown ;;
+	esac
+	# The Operating System including object format, if it has switched
+	# to ELF recently, or will in the future.
+	case "${UNAME_MACHINE_ARCH}" in
+	 arm*|earm*|i386|m68k|ns32k|sh3*|sparc|vax)
+		eval $set_cc_for_build
+		if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \
+			| grep -q __ELF__
+		then
+		 # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout).
+		 # Return netbsd for either. FIX?
+		 os=netbsd
+		else
+		 os=netbsdelf
+		fi
+		;;
+	 *)
+		os=netbsd
+		;;
+	esac
+	# Determine ABI tags.
+	case "${UNAME_MACHINE_ARCH}" in
+	 earm*)
+		expr='s/^earmv0-9/-eabi/;s/eb$//'
+		abi=`echo ${UNAME_MACHINE_ARCH} | sed -e "$expr"`
+		;;
+	esac
+	# The OS release
+	# Debian GNU/NetBSD machines have a different userland, and
+	# thus, need a distinct triplet. However, they do not need
+	# kernel version information, so it can be replaced with a
+	# suitable tag, in the style of linux-gnu.
+	case "${UNAME_VERSION}" in
+	 Debian*)
+		release='-gnu'
+		;;
+	 *)
+		release=`echo ${UNAME_RELEASE} | sed -e 's/-_.*//' | cut -d. -f1,2`
+		;;
+	esac
+	# Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM:
+	# contains redundant information, the shorter form:
+	# CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used.
+	echo "${machine}-${os}${release}${abi}"
+	exit ;;
+ *:Bitrig:*:*)
+	UNAME_MACHINE_ARCH=`arch | sed 's/Bitrig.//'`
+	echo ${UNAME_MACHINE_ARCH}-unknown-bitrig${UNAME_RELEASE}
+	exit ;;
+ *:OpenBSD:*:*)
+	UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'`
+	echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE}
+	exit ;;
+ *:LibertyBSD:*:*)
+	UNAME_MACHINE_ARCH=`arch | sed 's/^.*BSD\.//'`
+	echo ${UNAME_MACHINE_ARCH}-unknown-libertybsd${UNAME_RELEASE}
+	exit ;;
+ *:ekkoBSD:*:*)
+	echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE}
+	exit ;;
+ *:SolidBSD:*:*)
+	echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE}
+	exit ;;
+ macppc:MirBSD:*:*)
+	echo powerpc-unknown-mirbsd${UNAME_RELEASE}
+	exit ;;
+ *:MirBSD:*:*)
+	echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE}
+	exit ;;
+ *:Sortix:*:*)
+	echo ${UNAME_MACHINE}-unknown-sortix
+	exit ;;
+ alpha:OSF1:*:*)
+	case $UNAME_RELEASE in
+	*4.0)
+		UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'`
+		;;
+	*5.*)
+		UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'`
+		;;
+	esac
+	# According to Compaq, /usr/sbin/psrinfo has been available on
+	# OSF/1 and Tru64 systems produced since 1995. I hope that
+	# covers most systems running today. This code pipes the CPU
+	# types through head -n 1, so we only detect the type of CPU 0.
+	ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^ The alpha $.*$ processor.*$/\1/p' | head -n 1`
+	case "$ALPHA_CPU_TYPE" in
+	 "EV4 (21064)")
+		UNAME_MACHINE=alpha ;;
+	 "EV4.5 (21064)")
+		UNAME_MACHINE=alpha ;;
+	 "LCA4 (21066/21068)")
+		UNAME_MACHINE=alpha ;;
+	 "EV5 (21164)")
+		UNAME_MACHINE=alphaev5 ;;
+	 "EV5.6 (21164A)")
+		UNAME_MACHINE=alphaev56 ;;
+	 "EV5.6 (21164PC)")
+		UNAME_MACHINE=alphapca56 ;;
+	 "EV5.7 (21164PC)")
+		UNAME_MACHINE=alphapca57 ;;
+	 "EV6 (21264)")
+		UNAME_MACHINE=alphaev6 ;;
+	 "EV6.7 (21264A)")
+		UNAME_MACHINE=alphaev67 ;;
+	 "EV6.8CB (21264C)")
+		UNAME_MACHINE=alphaev68 ;;
+	 "EV6.8AL (21264B)")
+		UNAME_MACHINE=alphaev68 ;;
+	 "EV6.8CX (21264D)")
+		UNAME_MACHINE=alphaev68 ;;
+	 "EV6.9A (21264/EV69A)")
+		UNAME_MACHINE=alphaev69 ;;
+	 "EV7 (21364)")
+		UNAME_MACHINE=alphaev7 ;;
+	 "EV7.9 (21364A)")
+		UNAME_MACHINE=alphaev79 ;;
+	esac
+	# A Pn.n version is a patched version.
+	# A Vn.n version is a released version.
+	# A Tn.n version is a released field test version.
+	# A Xn.n version is an unreleased experimental baselevel.
+	# 1.2 uses "1.2" for uname -r.
+	echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^PVTX//' | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz`
+	# Reset EXIT trap before exiting to avoid spurious non-zero exit code.
+	exitcode=$?
+	trap '' 0
+	exit $exitcode ;;
+ Alpha\ *:Windows_NT*:*)
+	# How do we know it's Interix rather than the generic POSIX subsystem?
+	# Should we change UNAME_MACHINE based on the output of uname instead
+	# of the specific Alpha model?
+	echo alpha-pc-interix
+	exit ;;
+ 21064:Windows_NT:50:3)
+	echo alpha-dec-winnt3.5
+	exit ;;
+ Amiga*:UNIX_System_V:4.0:*)
+	echo m68k-unknown-sysv4
+	exit ;;
+ *:AamigaOoSs:*:*)
+	echo ${UNAME_MACHINE}-unknown-amigaos
+	exit ;;
+ *:MmorphOoSs:*:*)
+	echo ${UNAME_MACHINE}-unknown-morphos
+	exit ;;
+ *:OS/390:*:*)
+	echo i370-ibm-openedition
+	exit ;;
+ *:z/VM:*:*)
+	echo s390-ibm-zvmoe
+	exit ;;
+ *:OS400:*:*)
+	echo powerpc-ibm-os400
+	exit ;;
+ arm:RISC*:1.012*:*|arm:riscix:1.012*:*)
+	echo arm-acorn-riscix${UNAME_RELEASE}
+	exit ;;
+ arm*:riscos:*:*|arm*:RISCOS:*:*)
+	echo arm-unknown-riscos
+	exit ;;
+ SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*)
+	echo hppa1.1-hitachi-hiuxmpp
+	exit ;;
+ Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*)
+	# akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE.
+	if test "`(/bin/universe) 2>/dev/null`" = att ; then
+		echo pyramid-pyramid-sysv3
+	else
+		echo pyramid-pyramid-bsd
+	fi
+	exit ;;
+ NILE*:*:*:dcosx)
+	echo pyramid-pyramid-svr4
+	exit ;;
+ DRS?6000:unix:4.0:6*)
+	echo sparc-icl-nx6
+	exit ;;
+ DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*)
+	case `/usr/bin/uname -p` in
+	 sparc) echo sparc-icl-nx7; exit ;;
+	esac ;;
+ s390x:SunOS:*:*)
+	echo ${UNAME_MACHINE}-ibm-solaris2`echo ${UNAME_RELEASE}|sed -e 's/^.*//'`
+	exit ;;
+ sun4H:SunOS:5.*:*)
+	echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/^.*//'`
+	exit ;;
+ sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*)
+	echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/^.*//'`
+	exit ;;
+ i86pc:AuroraUX:5.*:* | i86xen:AuroraUX:5.*:*)
+	echo i386-pc-auroraux${UNAME_RELEASE}
+	exit ;;
+ i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*)
+	eval $set_cc_for_build
+	SUN_ARCH=i386
+	# If there is a compiler, see if it is configured for 64-bit objects.
+	# Note that the Sun cc does not turn __LP64__ into 1 like gcc does.
+	# This test works for both compilers.
+	if "$CC_FOR_BUILD" != no_compiler_found ; then
+	 if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \
+		(CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | \
+		grep IS_64BIT_ARCH >/dev/null
+	 then
+		SUN_ARCH=x86_64
+	 fi
+	fi
+	echo ${SUN_ARCH}-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/^.*//'`
+	exit ;;
+ sun4*:SunOS:6*:*)
+	# According to config.sub, this is the proper way to canonicalize
+	# SunOS6. Hard to guess exactly what SunOS6 will be like, but
+	# it's likely to be more like Solaris than SunOS4.
+	echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/^.*//'`
+	exit ;;
+ sun4*:SunOS:*:*)
+	case "`/usr/bin/arch -k`" in
+	 Series*|S4*)
+		UNAME_RELEASE=`uname -v`
+		;;
+	esac
+	# Japanese Language versions have a version number like `4.1.3-JL'.
+	echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'`
+	exit ;;
+ sun3*:SunOS:*:*)
+	echo m68k-sun-sunos${UNAME_RELEASE}
+	exit ;;
+ sun*:*:4.2BSD:*)
+	UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null`
+	test "x${UNAME_RELEASE}" = x && UNAME_RELEASE=3
+	case "`/bin/arch`" in
+	 sun3)
+		echo m68k-sun-sunos${UNAME_RELEASE}
+		;;
+	 sun4)
+		echo sparc-sun-sunos${UNAME_RELEASE}
+		;;
+	esac
+	exit ;;
+ aushp:SunOS:*:*)
+	echo sparc-auspex-sunos${UNAME_RELEASE}
+	exit ;;
+ # The situation for MiNT is a little confusing. The machine name
+ # can be virtually everything (everything which is not
+ # "atarist" or "atariste" at least should have a processor
+ # > m68000). The system name ranges from "MiNT" over "FreeMiNT"
+ # to the lowercase version "mint" (or "freemint"). Finally
+ # the system name "TOS" denotes a system which is actually not
+ # MiNT. But MiNT is downward compatible to TOS, so this should
+ # be no problem.
+ atariste:*MiNT:*:* | atariste:*mint:*:* | atariste:*TOS:*:*)
+	echo m68k-atari-mint${UNAME_RELEASE}
+	exit ;;
+ atari*:*MiNT:*:* | atari*:*mint:*:* | atariste:*TOS:*:*)
+	echo m68k-atari-mint${UNAME_RELEASE}
+	exit ;;
+ *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*)
+	echo m68k-atari-mint${UNAME_RELEASE}
+	exit ;;
+ milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*)
+	echo m68k-milan-mint${UNAME_RELEASE}
+	exit ;;
+ hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*)
+	echo m68k-hades-mint${UNAME_RELEASE}
+	exit ;;
+ *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*)
+	echo m68k-unknown-mint${UNAME_RELEASE}
+	exit ;;
+ m68k:machten:*:*)
+	echo m68k-apple-machten${UNAME_RELEASE}
+	exit ;;
+ powerpc:machten:*:*)
+	echo powerpc-apple-machten${UNAME_RELEASE}
+	exit ;;
+ RISC*:Mach:*:*)
+	echo mips-dec-mach_bsd4.3
+	exit ;;
+ RISC*:ULTRIX:*:*)
+	echo mips-dec-ultrix${UNAME_RELEASE}
+	exit ;;
+ VAX*:ULTRIX*:*:*)
+	echo vax-dec-ultrix${UNAME_RELEASE}
+	exit ;;
+ 2020:CLIX:*:* | 2430:CLIX:*:*)
+	echo clipper-intergraph-clix${UNAME_RELEASE}
+	exit ;;
+ mips:*:*:UMIPS | mips:*:*:RISCos)
+	eval $set_cc_for_build
+	sed 's/^	//' << EOF >$dummy.c
+#ifdef __cplusplus
+#include <stdio.h> /* for printf() prototype */
+	int main (int argc, char *argv) {
+#else
+	int main (argc, argv) int argc; char *argv; {
+#endif
+	#if defined (host_mips) && defined (MIPSEB)
+	#if defined (SYSTYPE_SYSV)
+	 printf ("mips-mips-riscos%ssysv\n", argv1); exit (0);
+	#endif
+	#if defined (SYSTYPE_SVR4)
+	 printf ("mips-mips-riscos%ssvr4\n", argv1); exit (0);
+	#endif
+	#if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD)
+	 printf ("mips-mips-riscos%sbsd\n", argv1); exit (0);
+	#endif
+	#endif
+	 exit (-1);
+	}
+EOF
+	$CC_FOR_BUILD -o $dummy $dummy.c &&
+	 dummyarg=`echo "${UNAME_RELEASE}" | sed -n 's/$0-9*$.*/\1/p'` &&
+	 SYSTEM_NAME=`$dummy $dummyarg` &&
+	 { echo "$SYSTEM_NAME"; exit; }
+	echo mips-mips-riscos${UNAME_RELEASE}
+	exit ;;
+ Motorola:PowerMAX_OS:*:*)
+	echo powerpc-motorola-powermax
+	exit ;;
+ Motorola:*:4.3:PL8-*)
+	echo powerpc-harris-powermax
+	exit ;;
+ Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*)
+	echo powerpc-harris-powermax
+	exit ;;
+ Night_Hawk:Power_UNIX:*:*)
+	echo powerpc-harris-powerunix
+	exit ;;
+ m88k:CX/UX:7*:*)
+	echo m88k-harris-cxux7
+	exit ;;
+ m88k:*:4*:R4*)
+	echo m88k-motorola-sysv4
+	exit ;;
+ m88k:*:3*:R3*)
+	echo m88k-motorola-sysv3
+	exit ;;
+ AViiON:dgux:*:*)
+	# DG/UX returns AViiON for all architectures
+	UNAME_PROCESSOR=`/usr/bin/uname -p`
+	if $UNAME_PROCESSOR = mc88100 || $UNAME_PROCESSOR = mc88110 
+	then
+	 if ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx || \
+	 ${TARGET_BINARY_INTERFACE}x = x 
+	 then
+		echo m88k-dg-dgux${UNAME_RELEASE}
+	 else
+		echo m88k-dg-dguxbcs${UNAME_RELEASE}
+	 fi
+	else
+	 echo i586-dg-dgux${UNAME_RELEASE}
+	fi
+	exit ;;
+ M88*:DolphinOS:*:*)	# DolphinOS (SVR3)
+	echo m88k-dolphin-sysv3
+	exit ;;
+ M88*:*:R3*:*)
+	# Delta 88k system running SVR3
+	echo m88k-motorola-sysv3
+	exit ;;
+ XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3)
+	echo m88k-tektronix-sysv3
+	exit ;;
+ Tek430-90-9:UTek:*:*) # Tektronix 4300 system running UTek (BSD)
+	echo m68k-tektronix-bsd
+	exit ;;
+ *:IRIX*:*:*)
+	echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'`
+	exit ;;
+ ????????:AIX?:12.1:2) # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX.
+	echo romp-ibm-aix # uname -m gives an 8 hex-code CPU id
+	exit ;; # Note that: echo "'`uname -s`'" gives 'AIX '
+ i*86:AIX:*:*)
+	echo i386-ibm-aix
+	exit ;;
+ ia64:AIX:*:*)
+	if -x /usr/bin/oslevel ; then
+		IBM_REV=`/usr/bin/oslevel`
+	else
+		IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}
+	fi
+	echo ${UNAME_MACHINE}-ibm-aix${IBM_REV}
+	exit ;;
+ *:AIX:2:3)
+	if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then
+		eval $set_cc_for_build
+		sed 's/^		//' << EOF >$dummy.c
+		#include <sys/systemcfg.h>
+
+		main()
+			{
+			if (!__power_pc())
+				exit(1);
+			puts("powerpc-ibm-aix3.2.5");
+			exit(0);
+			}
+EOF
+		if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy`
+		then
+			echo "$SYSTEM_NAME"
+		else
+			echo rs6000-ibm-aix3.2.5
+		fi
+	elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then
+		echo rs6000-ibm-aix3.2.4
+	else
+		echo rs6000-ibm-aix3.2
+	fi
+	exit ;;
+ *:AIX:*:4567)
+	IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'`
+	if /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then
+		IBM_ARCH=rs6000
+	else
+		IBM_ARCH=powerpc
+	fi
+	if -x /usr/bin/lslpp ; then
+		IBM_REV=`/usr/bin/lslpp -Lqc bos.rte.libc |
+			 awk -F: '{ print $3 }' | sed s/0-9*$/0/`
+	else
+		IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}
+	fi
+	echo ${IBM_ARCH}-ibm-aix${IBM_REV}
+	exit ;;
+ *:AIX:*:*)
+	echo rs6000-ibm-aix
+	exit ;;
+ ibmrt:4.4BSD:*|romp-ibm:BSD:*)
+	echo romp-ibm-bsd4.4
+	exit ;;
+ ibmrt:*BSD:*|romp-ibm:BSD:*) # covers RT/PC BSD and
+	echo romp-ibm-bsd${UNAME_RELEASE} # 4.3 with uname added to
+	exit ;; # report: romp-ibm BSD 4.3
+ *:BOSX:*:*)
+	echo rs6000-bull-bosx
+	exit ;;
+ DPX/2?00:B.O.S.:*:*)
+	echo m68k-bull-sysv3
+	exit ;;
+ 9000/34??:4.3bsd:1.*:*)
+	echo m68k-hp-bsd
+	exit ;;
+ hp300:4.4BSD:*:* | 9000/34??:4.3bsd:2.*:*)
+	echo m68k-hp-bsd4.4
+	exit ;;
+ 9000/34678??:HP-UX:*:*)
+	HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/^.*.0B*//'`
+	case "${UNAME_MACHINE}" in
+	 9000/31? ) HP_ARCH=m68000 ;;
+	 9000/34?? ) HP_ARCH=m68k ;;
+	 9000/6780-90-9)
+		if -x /usr/bin/getconf ; then
+		 sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null`
+		 sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null`
+		 case "${sc_cpu_version}" in
+		 523) HP_ARCH=hppa1.0 ;; # CPU_PA_RISC1_0
+		 528) HP_ARCH=hppa1.1 ;; # CPU_PA_RISC1_1
+		 532) # CPU_PA_RISC2_0
+			case "${sc_kernel_bits}" in
+			 32) HP_ARCH=hppa2.0n ;;
+			 64) HP_ARCH=hppa2.0w ;;
+			 '') HP_ARCH=hppa2.0 ;; # HP-UX 10.20
+			esac ;;
+		 esac
+		fi
+		if "${HP_ARCH}" = "" ; then
+		 eval $set_cc_for_build
+		 sed 's/^		//' << EOF >$dummy.c
+
+		#define _HPUX_SOURCE
+		#include <stdlib.h>
+		#include <unistd.h>
+
+		int main ()
+		{
+		#if defined(_SC_KERNEL_BITS)
+		 long bits = sysconf(_SC_KERNEL_BITS);
+		#endif
+		 long cpu = sysconf (_SC_CPU_VERSION);
+
+		 switch (cpu)
+			{
+			case CPU_PA_RISC1_0: puts ("hppa1.0"); break;
+			case CPU_PA_RISC1_1: puts ("hppa1.1"); break;
+			case CPU_PA_RISC2_0:
+		#if defined(_SC_KERNEL_BITS)
+			 switch (bits)
+				{
+				case 64: puts ("hppa2.0w"); break;
+				case 32: puts ("hppa2.0n"); break;
+				default: puts ("hppa2.0"); break;
+				} break;
+		#else /* !defined(_SC_KERNEL_BITS) */
+			 puts ("hppa2.0"); break;
+		#endif
+			default: puts ("hppa1.0"); break;
+			}
+		 exit (0);
+		}
+EOF
+		 (CCOPTS="" $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy`
+		 test -z "$HP_ARCH" && HP_ARCH=hppa
+		fi ;;
+	esac
+	if ${HP_ARCH} = hppa2.0w 
+	then
+	 eval $set_cc_for_build
+
+	 # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating
+	 # 32-bit code. hppa64-hp-hpux* has the same kernel and a compiler
+	 # generating 64-bit code. GNU and HP use different nomenclature:
+	 #
+	 # $ CC_FOR_BUILD=cc ./config.guess
+	 # => hppa2.0w-hp-hpux11.23
+	 # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess
+	 # => hppa64-hp-hpux11.23
+
+	 if echo __LP64__ | (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) |
+		grep -q __LP64__
+	 then
+		HP_ARCH=hppa2.0w
+	 else
+		HP_ARCH=hppa64
+	 fi
+	fi
+	echo ${HP_ARCH}-hp-hpux${HPUX_REV}
+	exit ;;
+ ia64:HP-UX:*:*)
+	HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/^.*.0B*//'`
+	echo ia64-hp-hpux${HPUX_REV}
+	exit ;;
+ 3050*:HI-UX:*:*)
+	eval $set_cc_for_build
+	sed 's/^	//' << EOF >$dummy.c
+	#include <unistd.h>
+	int
+	main ()
+	{
+	 long cpu = sysconf (_SC_CPU_VERSION);
+	 /* The order matters, because CPU_IS_HP_MC68K erroneously returns
+	 true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct
+	 results, however. */
+	 if (CPU_IS_PA_RISC (cpu))
+	 {
+	 switch (cpu)
+		{
+		 case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break;
+		 case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break;
+		 case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break;
+		 default: puts ("hppa-hitachi-hiuxwe2"); break;
+		}
+	 }
+	 else if (CPU_IS_HP_MC68K (cpu))
+	 puts ("m68k-hitachi-hiuxwe2");
+	 else puts ("unknown-hitachi-hiuxwe2");
+	 exit (0);
+	}
+EOF
+	$CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` &&
+		{ echo "$SYSTEM_NAME"; exit; }
+	echo unknown-hitachi-hiuxwe2
+	exit ;;
+ 9000/7??:4.3bsd:*:* | 9000/8?79:4.3bsd:*:* )
+	echo hppa1.1-hp-bsd
+	exit ;;
+ 9000/8??:4.3bsd:*:*)
+	echo hppa1.0-hp-bsd
+	exit ;;
+ *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*)
+	echo hppa1.0-hp-mpeix
+	exit ;;
+ hp7??:OSF1:*:* | hp8?79:OSF1:*:* )
+	echo hppa1.1-hp-osf
+	exit ;;
+ hp8??:OSF1:*:*)
+	echo hppa1.0-hp-osf
+	exit ;;
+ i*86:OSF1:*:*)
+	if -x /usr/sbin/sysversion ; then
+	 echo ${UNAME_MACHINE}-unknown-osf1mk
+	else
+	 echo ${UNAME_MACHINE}-unknown-osf1
+	fi
+	exit ;;
+ parisc*:Lites*:*:*)
+	echo hppa1.1-hp-lites
+	exit ;;
+ C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*)
+	echo c1-convex-bsd
+	exit ;;
+ C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*)
+	if getsysinfo -f scalar_acc
+	then echo c32-convex-bsd
+	else echo c2-convex-bsd
+	fi
+	exit ;;
+ C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*)
+	echo c34-convex-bsd
+	exit ;;
+ C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*)
+	echo c38-convex-bsd
+	exit ;;
+ C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*)
+	echo c4-convex-bsd
+	exit ;;
+ CRAY*Y-MP:*:*:*)
+	echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.^.*$/.X/'
+	exit ;;
+ CRAY*A-Z90:*:*:*)
+	echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \
+	| sed -e 's/CRAY.*$A-Z90$/\1/' \
+	 -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \
+	 -e 's/\.^.*$/.X/'
+	exit ;;
+ CRAY*TS:*:*:*)
+	echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.^.*$/.X/'
+	exit ;;
+ CRAY*T3E:*:*:*)
+	echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.^.*$/.X/'
+	exit ;;
+ CRAY*SV1:*:*:*)
+	echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.^.*$/.X/'
+	exit ;;
+ *:UNICOS/mp:*:*)
+	echo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.^.*$/.X/'
+	exit ;;
+ F3001:UNIX_System_V:*:* | F700:UNIX_System_V:*:*)
+	FUJITSU_PROC=`uname -m | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz`
+	FUJITSU_SYS=`uname -p | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/\///'`
+	FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'`
+	echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}"
+	exit ;;
+ 5000:UNIX_System_V:4.*:*)
+	FUJITSU_SYS=`uname -p | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/\///'`
+	FUJITSU_REL=`echo ${UNAME_RELEASE} | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/ /_/'`
+	echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}"
+	exit ;;
+ i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*)
+	echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE}
+	exit ;;
+ sparc*:BSD/OS:*:*)
+	echo sparc-unknown-bsdi${UNAME_RELEASE}
+	exit ;;
+ *:BSD/OS:*:*)
+	echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE}
+	exit ;;
+ *:FreeBSD:*:*)
+	UNAME_PROCESSOR=`/usr/bin/uname -p`
+	case ${UNAME_PROCESSOR} in
+	 amd64)
+		echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/-(.*//'` ;;
+	 *)
+		echo ${UNAME_PROCESSOR}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/-(.*//'` ;;
+	esac
+	exit ;;
+ i*:CYGWIN*:*)
+	echo ${UNAME_MACHINE}-pc-cygwin
+	exit ;;
+ *:MINGW64*:*)
+	echo ${UNAME_MACHINE}-pc-mingw64
+	exit ;;
+ *:MINGW*:*)
+	echo ${UNAME_MACHINE}-pc-mingw32
+	exit ;;
+ *:MSYS*:*)
+	echo ${UNAME_MACHINE}-pc-msys
+	exit ;;
+ i*:windows32*:*)
+	# uname -m includes "-pc" on this system.
+	echo ${UNAME_MACHINE}-mingw32
+	exit ;;
+ i*:PW*:*)
+	echo ${UNAME_MACHINE}-pc-pw32
+	exit ;;
+ *:Interix*:*)
+	case ${UNAME_MACHINE} in
+	 x86)
+		echo i586-pc-interix${UNAME_RELEASE}
+		exit ;;
+	 authenticamd | genuineintel | EM64T)
+		echo x86_64-unknown-interix${UNAME_RELEASE}
+		exit ;;
+	 IA64)
+		echo ia64-unknown-interix${UNAME_RELEASE}
+		exit ;;
+	esac ;;
+ 34586:Windows_95:* | 34586:Windows_98:* | 34586:Windows_NT:*)
+	echo i${UNAME_MACHINE}-pc-mks
+	exit ;;
+ 8664:Windows_NT:*)
+	echo x86_64-pc-mks
+	exit ;;
+ i*:Windows_NT*:* | Pentium*:Windows_NT*:*)
+	# How do we know it's Interix rather than the generic POSIX subsystem?
+	# It also conflicts with pre-2.0 versions of AT&T UWIN. Should we
+	# UNAME_MACHINE based on the output of uname instead of i386?
+	echo i586-pc-interix
+	exit ;;
+ i*:UWIN*:*)
+	echo ${UNAME_MACHINE}-pc-uwin
+	exit ;;
+ amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*)
+	echo x86_64-unknown-cygwin
+	exit ;;
+ p*:CYGWIN*:*)
+	echo powerpcle-unknown-cygwin
+	exit ;;
+ prep*:SunOS:5.*:*)
+	echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/^.*//'`
+	exit ;;
+ *:GNU:*:*)
+	# the GNU system
+	echo `echo ${UNAME_MACHINE}|sed -e 's,-/.*$,,'`-unknown-${LIBC}`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'`
+	exit ;;
+ *:GNU/*:*:*)
+	# other systems with GNU libc and userland
+	echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^^/*/,,' | tr ":upper:" ":lower:"``echo ${UNAME_RELEASE}|sed -e 's/-(.*//'`-${LIBC}
+	exit ;;
+ i*86:Minix:*:*)
+	echo ${UNAME_MACHINE}-pc-minix
+	exit ;;
+ aarch64:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ aarch64_be:Linux:*:*)
+	UNAME_MACHINE=aarch64_be
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ alpha:Linux:*:*)
+	case `sed -n '/^cpu model/s/^.*: $.*$/\1/p' < /proc/cpuinfo` in
+	 EV5) UNAME_MACHINE=alphaev5 ;;
+	 EV56) UNAME_MACHINE=alphaev56 ;;
+	 PCA56) UNAME_MACHINE=alphapca56 ;;
+	 PCA57) UNAME_MACHINE=alphapca56 ;;
+	 EV6) UNAME_MACHINE=alphaev6 ;;
+	 EV67) UNAME_MACHINE=alphaev67 ;;
+	 EV68*) UNAME_MACHINE=alphaev68 ;;
+	esac
+	objdump --private-headers /bin/sh | grep -q ld.so.1
+	if test "$?" = 0 ; then LIBC=gnulibc1 ; fi
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ arc:Linux:*:* | arceb:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ arm*:Linux:*:*)
+	eval $set_cc_for_build
+	if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \
+	 | grep -q __ARM_EABI__
+	then
+	 echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	else
+	 if echo __ARM_PCS_VFP | $CC_FOR_BUILD -E - 2>/dev/null \
+		| grep -q __ARM_PCS_VFP
+	 then
+		echo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabi
+	 else
+		echo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabihf
+	 fi
+	fi
+	exit ;;
+ avr32*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ cris:Linux:*:*)
+	echo ${UNAME_MACHINE}-axis-linux-${LIBC}
+	exit ;;
+ crisv32:Linux:*:*)
+	echo ${UNAME_MACHINE}-axis-linux-${LIBC}
+	exit ;;
+ e2k:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ frv:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ hexagon:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ i*86:Linux:*:*)
+	echo ${UNAME_MACHINE}-pc-linux-${LIBC}
+	exit ;;
+ ia64:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ k1om:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ m32r*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ m68*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ mips:Linux:*:* | mips64:Linux:*:*)
+	eval $set_cc_for_build
+	sed 's/^	//' << EOF >$dummy.c
+	#undef CPU
+	#undef ${UNAME_MACHINE}
+	#undef ${UNAME_MACHINE}el
+	#if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL)
+	CPU=${UNAME_MACHINE}el
+	#else
+	#if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB)
+	CPU=${UNAME_MACHINE}
+	#else
+	CPU=
+	#endif
+	#endif
+EOF
+	eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^CPU'`
+	test x"${CPU}" != x && { echo "${CPU}-unknown-linux-${LIBC}"; exit; }
+	;;
+ openrisc*:Linux:*:*)
+	echo or1k-unknown-linux-${LIBC}
+	exit ;;
+ or32:Linux:*:* | or1k*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ padre:Linux:*:*)
+	echo sparc-unknown-linux-${LIBC}
+	exit ;;
+ parisc64:Linux:*:* | hppa64:Linux:*:*)
+	echo hppa64-unknown-linux-${LIBC}
+	exit ;;
+ parisc:Linux:*:* | hppa:Linux:*:*)
+	# Look for CPU level
+	case `grep '^cpu^a-z*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in
+	 PA7*) echo hppa1.1-unknown-linux-${LIBC} ;;
+	 PA8*) echo hppa2.0-unknown-linux-${LIBC} ;;
+	 *) echo hppa-unknown-linux-${LIBC} ;;
+	esac
+	exit ;;
+ ppc64:Linux:*:*)
+	echo powerpc64-unknown-linux-${LIBC}
+	exit ;;
+ ppc:Linux:*:*)
+	echo powerpc-unknown-linux-${LIBC}
+	exit ;;
+ ppc64le:Linux:*:*)
+	echo powerpc64le-unknown-linux-${LIBC}
+	exit ;;
+ ppcle:Linux:*:*)
+	echo powerpcle-unknown-linux-${LIBC}
+	exit ;;
+ s390:Linux:*:* | s390x:Linux:*:*)
+	echo ${UNAME_MACHINE}-ibm-linux-${LIBC}
+	exit ;;
+ sh64*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ sh*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ sparc:Linux:*:* | sparc64:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ tile*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ vax:Linux:*:*)
+	echo ${UNAME_MACHINE}-dec-linux-${LIBC}
+	exit ;;
+ x86_64:Linux:*:*)
+	echo ${UNAME_MACHINE}-pc-linux-${LIBC}
+	exit ;;
+ xtensa*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+ i*86:DYNIX/ptx:4*:*)
+	# ptx 4.0 does uname -s correctly, with DYNIX/ptx in there.
+	# earlier versions are messed up and put the nodename in both
+	# sysname and nodename.
+	echo i386-sequent-sysv4
+	exit ;;
+ i*86:UNIX_SV:4.2MP:2.*)
+	# Unixware is an offshoot of SVR4, but it has its own version
+	# number series starting with 2...
+	# I am not positive that other SVR4 systems won't match this,
+	# I just have to hope. -- rms.
+	# Use sysv4.2uw... so that sysv4* matches it.
+	echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION}
+	exit ;;
+ i*86:OS/2:*:*)
+	# If we were able to find `uname', then EMX Unix compatibility
+	# is probably installed.
+	echo ${UNAME_MACHINE}-pc-os2-emx
+	exit ;;
+ i*86:XTS-300:*:STOP)
+	echo ${UNAME_MACHINE}-unknown-stop
+	exit ;;
+ i*86:atheos:*:*)
+	echo ${UNAME_MACHINE}-unknown-atheos
+	exit ;;
+ i*86:syllable:*:*)
+	echo ${UNAME_MACHINE}-pc-syllable
+	exit ;;
+ i*86:LynxOS:2.*:* | i*86:LynxOS:3.01*:* | i*86:LynxOS:4.02*:*)
+	echo i386-unknown-lynxos${UNAME_RELEASE}
+	exit ;;
+ i*86:*DOS:*:*)
+	echo ${UNAME_MACHINE}-pc-msdosdjgpp
+	exit ;;
+ i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*)
+	UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'`
+	if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then
+		echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL}
+	else
+		echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL}
+	fi
+	exit ;;
+ i*86:*:5:678*)
+	# UnixWare 7.x, OpenUNIX and OpenServer 6.
+	case `/bin/uname -X | grep "^Machine"` in
+	 *486*)	 UNAME_MACHINE=i486 ;;
+	 *Pentium)	 UNAME_MACHINE=i586 ;;
+	 *Pent*|*Celeron) UNAME_MACHINE=i686 ;;
+	esac
+	echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION}
+	exit ;;
+ i*86:*:3.2:*)
+	if test -f /usr/options/cb.name; then
+		UNAME_REL=`sed -n 's/.*Version //p' </usr/options/cb.name`
+		echo ${UNAME_MACHINE}-pc-isc$UNAME_REL
+	elif /bin/uname -X 2>/dev/null >/dev/null ; then
+		UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')`
+		(/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486
+		(/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \
+			&& UNAME_MACHINE=i586
+		(/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \
+			&& UNAME_MACHINE=i686
+		(/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \
+			&& UNAME_MACHINE=i686
+		echo ${UNAME_MACHINE}-pc-sco$UNAME_REL
+	else
+		echo ${UNAME_MACHINE}-pc-sysv32
+	fi
+	exit ;;
+ pc:*:*:*)
+	# Left here for compatibility:
+	# uname -m prints for DJGPP always 'pc', but it prints nothing about
+	# the processor, so we play safe by assuming i586.
+	# Note: whatever this is, it MUST be the same as what config.sub
+	# prints for the "djgpp" host, or else GDB configure will decide that
+	# this is a cross-build.
+	echo i586-pc-msdosdjgpp
+	exit ;;
+ Intel:Mach:3*:*)
+	echo i386-pc-mach3
+	exit ;;
+ paragon:*:*:*)
+	echo i860-intel-osf1
+	exit ;;
+ i860:*:4.*:*) # i860-SVR4
+	if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then
+	 echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4
+	else # Add other i860-SVR4 vendors below as they are discovered.
+	 echo i860-unknown-sysv${UNAME_RELEASE} # Unknown i860-SVR4
+	fi
+	exit ;;
+ mini*:CTIX:SYS*5:*)
+	# "miniframe"
+	echo m68010-convergent-sysv
+	exit ;;
+ mc68k:UNIX:SYSTEM5:3.51m)
+	echo m68k-convergent-sysv
+	exit ;;
+ M680?0:D-NIX:5.3:*)
+	echo m68k-diab-dnix
+	exit ;;
+ M68*:*:R3V5678*:*)
+	test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;;
+ 3345??:*:4.0:3.0 | 334??A:*:4.0:3.0 | 334??,*:*:4.0:3.0 | 334??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0)
+	OS_REL=''
+	test -r /etc/.relid \
+	&& OS_REL=.`sed -n 's/^ * ^ * $0-90-9$.*/\1/p' < /etc/.relid`
+	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
+	 && { echo i486-ncr-sysv4.3${OS_REL}; exit; }
+	/bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \
+	 && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;;
+ 334??:*:4.0:* | 334??,*:*:4.0:*)
+	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
+	 && { echo i486-ncr-sysv4; exit; } ;;
+ NCR*:*:4.2:* | MPRAS*:*:4.2:*)
+	OS_REL='.3'
+	test -r /etc/.relid \
+	 && OS_REL=.`sed -n 's/^ * ^ * $0-90-9$.*/\1/p' < /etc/.relid`
+	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
+	 && { echo i486-ncr-sysv4.3${OS_REL}; exit; }
+	/bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \
+	 && { echo i586-ncr-sysv4.3${OS_REL}; exit; }
+	/bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \
+	 && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;;
+ m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*)
+	echo m68k-unknown-lynxos${UNAME_RELEASE}
+	exit ;;
+ mc68030:UNIX_System_V:4.*:*)
+	echo m68k-atari-sysv4
+	exit ;;
+ TSUNAMI:LynxOS:2.*:*)
+	echo sparc-unknown-lynxos${UNAME_RELEASE}
+	exit ;;
+ rs6000:LynxOS:2.*:*)
+	echo rs6000-unknown-lynxos${UNAME_RELEASE}
+	exit ;;
+ PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.01*:* | PowerPC:LynxOS:4.02*:*)
+	echo powerpc-unknown-lynxos${UNAME_RELEASE}
+	exit ;;
+ SMBES:UNIX_SV:*:*)
+	echo mips-dde-sysv${UNAME_RELEASE}
+	exit ;;
+ RM*:ReliantUNIX-*:*:*)
+	echo mips-sni-sysv4
+	exit ;;
+ RM*:SINIX-*:*:*)
+	echo mips-sni-sysv4
+	exit ;;
+ *:SINIX-*:*:*)
+	if uname -p 2>/dev/null >/dev/null ; then
+		UNAME_MACHINE=`(uname -p) 2>/dev/null`
+		echo ${UNAME_MACHINE}-sni-sysv4
+	else
+		echo ns32k-sni-sysv
+	fi
+	exit ;;
+ PENTIUM:*:4.0*:*)	# Unisys `ClearPath HMP IX 4000' SVR4/MP effort
+			# says <Richard.M.Bartel@ccMail.Census.GOV>
+	echo i586-unisys-sysv4
+	exit ;;
+ *:UNIX_System_V:4*:FTX*)
+	# From Gerald Hewes <hewes@openmarket.com>.
+	# How about differentiating between stratus architectures? -djm
+	echo hppa1.1-stratus-sysv4
+	exit ;;
+ *:*:*:FTX*)
+	# From seanf@swdc.stratus.com.
+	echo i860-stratus-sysv4
+	exit ;;
+ i*86:VOS:*:*)
+	# From Paul.Green@stratus.com.
+	echo ${UNAME_MACHINE}-stratus-vos
+	exit ;;
+ *:VOS:*:*)
+	# From Paul.Green@stratus.com.
+	echo hppa1.1-stratus-vos
+	exit ;;
+ mc68*:A/UX:*:*)
+	echo m68k-apple-aux${UNAME_RELEASE}
+	exit ;;
+ news*:NEWS-OS:6*:*)
+	echo mips-sony-newsos6
+	exit ;;
+ R34000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*)
+	if -d /usr/nec ; then
+		echo mips-nec-sysv${UNAME_RELEASE}
+	else
+		echo mips-unknown-sysv${UNAME_RELEASE}
+	fi
+	exit ;;
+ BeBox:BeOS:*:*)	# BeOS running on hardware made by Be, PPC only.
+	echo powerpc-be-beos
+	exit ;;
+ BeMac:BeOS:*:*)	# BeOS running on Mac or Mac clone, PPC only.
+	echo powerpc-apple-beos
+	exit ;;
+ BePC:BeOS:*:*)	# BeOS running on Intel PC compatible.
+	echo i586-pc-beos
+	exit ;;
+ BePC:Haiku:*:*)	# Haiku running on Intel PC compatible.
+	echo i586-pc-haiku
+	exit ;;
+ x86_64:Haiku:*:*)
+	echo x86_64-unknown-haiku
+	exit ;;
+ SX-4:SUPER-UX:*:*)
+	echo sx4-nec-superux${UNAME_RELEASE}
+	exit ;;
+ SX-5:SUPER-UX:*:*)
+	echo sx5-nec-superux${UNAME_RELEASE}
+	exit ;;
+ SX-6:SUPER-UX:*:*)
+	echo sx6-nec-superux${UNAME_RELEASE}
+	exit ;;
+ SX-7:SUPER-UX:*:*)
+	echo sx7-nec-superux${UNAME_RELEASE}
+	exit ;;
+ SX-8:SUPER-UX:*:*)
+	echo sx8-nec-superux${UNAME_RELEASE}
+	exit ;;
+ SX-8R:SUPER-UX:*:*)
+	echo sx8r-nec-superux${UNAME_RELEASE}
+	exit ;;
+ SX-ACE:SUPER-UX:*:*)
+	echo sxace-nec-superux${UNAME_RELEASE}
+	exit ;;
+ Power*:Rhapsody:*:*)
+	echo powerpc-apple-rhapsody${UNAME_RELEASE}
+	exit ;;
+ *:Rhapsody:*:*)
+	echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE}
+	exit ;;
+ *:Darwin:*:*)
+	UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown
+	eval $set_cc_for_build
+	if test "$UNAME_PROCESSOR" = unknown ; then
+	 UNAME_PROCESSOR=powerpc
+	fi
+	if test `echo "$UNAME_RELEASE" | sed -e 's/\..*//'` -le 10 ; then
+	 if "$CC_FOR_BUILD" != no_compiler_found ; then
+		if (echo '#ifdef __LP64__'; echo IS_64BIT_ARCH; echo '#endif') | \
+		 (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | \
+		 grep IS_64BIT_ARCH >/dev/null
+		then
+		 case $UNAME_PROCESSOR in
+			i386) UNAME_PROCESSOR=x86_64 ;;
+			powerpc) UNAME_PROCESSOR=powerpc64 ;;
+		 esac
+		fi
+	 fi
+	elif test "$UNAME_PROCESSOR" = i386 ; then
+	 # Avoid executing cc on OS X 10.9, as it ships with a stub
+	 # that puts up a graphical alert prompting to install
+	 # developer tools. Any system running Mac OS X 10.7 or
+	 # later (Darwin 11 and later) is required to have a 64-bit
+	 # processor. This is not true of the ARM version of Darwin
+	 # that Apple uses in portable devices.
+	 UNAME_PROCESSOR=x86_64
+	fi
+	echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE}
+	exit ;;
+ *:procnto*:*:* | *:QNX:0123456789*:*)
+	UNAME_PROCESSOR=`uname -p`
+	if test "$UNAME_PROCESSOR" = x86; then
+		UNAME_PROCESSOR=i386
+		UNAME_MACHINE=pc
+	fi
+	echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE}
+	exit ;;
+ *:QNX:*:4*)
+	echo i386-pc-qnx
+	exit ;;
+ NEO-?:NONSTOP_KERNEL:*:*)
+	echo neo-tandem-nsk${UNAME_RELEASE}
+	exit ;;
+ NSE-*:NONSTOP_KERNEL:*:*)
+	echo nse-tandem-nsk${UNAME_RELEASE}
+	exit ;;
+ NSR-?:NONSTOP_KERNEL:*:*)
+	echo nsr-tandem-nsk${UNAME_RELEASE}
+	exit ;;
+ *:NonStop-UX:*:*)
+	echo mips-compaq-nonstopux
+	exit ;;
+ BS2000:POSIX*:*:*)
+	echo bs2000-siemens-sysv
+	exit ;;
+ DS/*:UNIX_System_V:*:*)
+	echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE}
+	exit ;;
+ *:Plan9:*:*)
+	# "uname -m" is not consistent, so use $cputype instead. 386
+	# is converted to i386 for consistency with other x86
+	# operating systems.
+	if test "$cputype" = 386; then
+	 UNAME_MACHINE=i386
+	else
+	 UNAME_MACHINE="$cputype"
+	fi
+	echo ${UNAME_MACHINE}-unknown-plan9
+	exit ;;
+ *:TOPS-10:*:*)
+	echo pdp10-unknown-tops10
+	exit ;;
+ *:TENEX:*:*)
+	echo pdp10-unknown-tenex
+	exit ;;
+ KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*)
+	echo pdp10-dec-tops20
+	exit ;;
+ XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*)
+	echo pdp10-xkl-tops20
+	exit ;;
+ *:TOPS-20:*:*)
+	echo pdp10-unknown-tops20
+	exit ;;
+ *:ITS:*:*)
+	echo pdp10-unknown-its
+	exit ;;
+ SEI:*:*:SEIUX)
+	echo mips-sei-seiux${UNAME_RELEASE}
+	exit ;;
+ *:DragonFly:*:*)
+	echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/-(.*//'`
+	exit ;;
+ *:*VMS:*:*)
+	UNAME_MACHINE=`(uname -p) 2>/dev/null`
+	case "${UNAME_MACHINE}" in
+	 A*) echo alpha-dec-vms ; exit ;;
+	 I*) echo ia64-dec-vms ; exit ;;
+	 V*) echo vax-dec-vms ; exit ;;
+	esac ;;
+ *:XENIX:*:SysV)
+	echo i386-pc-xenix
+	exit ;;
+ i*86:skyos:*:*)
+	echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE} | sed -e 's/ .*$//'`
+	exit ;;
+ i*86:rdos:*:*)
+	echo ${UNAME_MACHINE}-pc-rdos
+	exit ;;
+ i*86:AROS:*:*)
+	echo ${UNAME_MACHINE}-pc-aros
+	exit ;;
+ x86_64:VMkernel:*:*)
+	echo ${UNAME_MACHINE}-unknown-esx
+	exit ;;
+ amd64:Isilon\ OneFS:*:*)
+	echo x86_64-unknown-onefs
+	exit ;;
+esac
+
+cat >&2 <<EOF
+$0: unable to guess system type
+
+This script, last modified $timestamp, has failed to recognize
+the operating system you are using. It is advised that you
+download the most up to date version of the config scripts from
+
+ http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess
+and
+ http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub
+
+If the version you run ($0) is already up to date, please
+send the following data and any information you think might be
+pertinent to <config-patches@gnu.org> in order to provide the needed
+information to handle your system.
+
+config.guess timestamp = $timestamp
+
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null`
+/bin/uname -X = `(/bin/uname -X) 2>/dev/null`
+
+hostinfo = `(hostinfo) 2>/dev/null`
+/bin/universe = `(/bin/universe) 2>/dev/null`
+/usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null`
+/bin/arch = `(/bin/arch) 2>/dev/null`
+/usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null`
+
+UNAME_MACHINE = ${UNAME_MACHINE}
+UNAME_RELEASE = ${UNAME_RELEASE}
+UNAME_SYSTEM = ${UNAME_SYSTEM}
+UNAME_VERSION = ${UNAME_VERSION}
+EOF
+
+exit 1
+
+# Local variables:
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "timestamp='"
+# time-stamp-format: "%:y-%02m-%02d"
+# time-stamp-end: "'"
+# End:

_service:tar_scm:slang-2.3.2.tar.bz2/autoconf/config.sub Added

_service:tar_scm:slang-2.3.2.tar.bz2/autoconf/configure.ac Added

@@ -0,0 +1,411 @@
+dnl# -*- sh -*-
+dnl#
+dnl# This file requires JD_* m4 macros that are defined in 
+dnl# the aclocal.m4 file.
+dnl#
+
+AC_INIT(src/slang.c)
+#AC_PREFIX_DEFAULT($MY_PREFIX_DEAULT)
+
+# Installation location
+AC_PREFIX_DEFAULT("/usr/local"
+dnl# if test -f "/usr/include/slang.h"; then
+dnl# ac_default_prefix="/usr"
+dnl# fi
+)
+
+AC_CONFIG_AUX_DIR(autoconf)
+AC_CANONICAL_HOST
+
+JD_INIT
+JD_ANSI_CC
+
+AC_PROG_MAKE_SET
+AC_PROG_RANLIB
+AC_PROG_INSTALL
+
+AC_ARG_WITH(pkgconfigdir,
+ AC_HELP_STRING(--with-pkgconfigdir=DIR,
+ pkgconfig dir (libdir/pkgconfig)),
+ pkgconfigdir=${withval},
+ pkgconfigdir='${libdir}/pkgconfig')
+AC_SUBST(pkgconfigdir)
+
+dnl # Terminfo binary format
+AC_ARG_WITH(terminfo,
+ --with-terminfo=xxx Terminfo layout: default, hpux11, osf1r5, aix4, uwin ,
+ jd_with_terminfo_arg=$withval , jd_with_terminfo_arg=default)
+AC_MSG_CHECKING(terminfo layout)
+if test "x$jd_with_terminfo_arg" = "x"
+then
+ jd_with_terminfo_arg="default"
+fi
+if test -r src/terminfo/$jd_with_terminfo_arg.inc
+then
+ AC_MSG_RESULT($jd_with_terminfo_arg)
+ TERMINFO_LAYOUT="$jd_with_terminfo_arg"
+else
+ AC_MSG_ERROR(-"-with-terminfo=$jd_with_terminfo_arg is invalid. src/terminfo/$jd_with_terminfo_arg.inc does not exist")
+fi
+AC_SUBST(TERMINFO_LAYOUT)
+
+dnl # Readline support for slsh
+AC_ARG_WITH(readline,
+ --with-readline=xxx Use slang(default) or gnu readline for slsh ,
+ jd_with_readline_arg=$withval , jd_with_readline_arg=slang)
+AC_MSG_CHECKING(type of readline support for slsh)
+case "x$jd_with_readline_arg" in
+ xgnu|xGNU )
+ GNU_READLINE=1
+ LIB_READLINE=-lreadline
+ AC_MSG_RESULT(gnu);
+ ;;
+ *)
+ GNU_READLINE=0
+ LIB_READLINE="# -lreadline"
+ AC_MSG_RESULT(slang);
+ ;;
+esac
+AC_SUBST(GNU_READLINE)
+AC_SUBST(LIB_READLINE)
+
+dnl #
+AC_ARG_WITH(slsyswrap,
+ --with-slsyswrap=DIR Not for production use,
+ jd_with_slsyswrap_arg=$withval , jd_with_slsyswrap_arg=no)
+AC_MSG_CHECKING(for slsyswrap)
+
+case "x$jd_with_slsyswrap_arg" in
+ x|xno)
+ DSLSYSWRAP=""
+ LIB_SLSYSWRAP=""
+ AC_MSG_RESULT(no);
+ ;;
+ *)
+ DSLSYSWRAP="-I$jd_with_slsyswrap_arg/include -DSLSYSWRAP=1"
+ LIB_SLSYSWRAP="-L$jd_with_slsyswrap_arg/lib -lslsyswrap"
+ AC_MSG_RESULT(yes);
+ ;;
+esac
+AC_SUBST(DSLSYSWRAP)
+AC_SUBST(LIB_SLSYSWRAP)
+
+# For the socket module
+AC_PATH_XTRA
+
+#Check these header since they cause trouble
+AC_CHECK_HEADERS( \
+stdlib.h \
+unistd.h \
+memory.h \
+termios.h \
+malloc.h \
+locale.h \
+xlocale.h \
+langinfo.h \
+fcntl.h \
+sys/fcntl.h \
+sys/types.h \
+sys/wait.h \
+sys/utsname.h \
+sys/times.h \
+sys/statvfs.h \
+sys/time.h \
+utime.h \
+floatingpoint.h \
+ieeefp.h \
+nan.h \
+fenv.h \
+sys/mman.h \
+sys/socket.h \
+netinet/in.h \
+arpa/inet.h \
+sys/un.h \
+sys/resource.h \
+)
+
+AC_TYPE_MODE_T
+AC_TYPE_PID_T
+AC_TYPE_UID_T
+dnl# AC_TYPE_OFF_T
+
+AC_MSG_CHECKING(for socklen_t)
+AC_EGREP_HEADER(socklen_t, sys/socket.h,
+ AC_MSG_RESULT(yes),
+ AC_MSG_RESULT(no)
+ AC_DEFINE(socklen_t,int,
+ Define to 'int' if not in <sys/socket.h>))
+
+AC_HEADER_DIRENT
+
+AC_CHECK_FUNCS(\
+memset \
+memcpy \
+putenv \
+getcwd \
+setlocale \
+tcgetattr \
+tcsetattr \
+cfgetospeed \
+sigaction \
+sigemptyset \
+sigprocmask \
+sigaddset \
+alarm \
+pause \
+vfscanf \
+lstat readlink symlink link \
+kill killpg \
+snprintf vsnprintf \
+getppid getegid geteuid getuid getgid setgid setuid \
+setpgid getpgid setpgrp getpgrp setsid getsid \
+mmap \
+chown lchown popen mkfifo \
+atexit on_exit umask uname \
+times gmtime mktime gettimeofday \
+getitimer setitimer \
+gmtime_r ctime_r localtime_r \
+strtod atoll strtoll \
+issetugid \
+isnan \
+finite \
+isinf \
+round \
+siglongjmp \
+fork waitpid \
+socket socketpair \
+confstr pathconf \
+getpriority setpriority \
+getrusage \
+setvbuf \
+utime utimes \
+ttyname ttyname_r \
+newlocale strtod_l localeconv \
+statvfs \
+)
+
+if test x"$ac_cv_func_socketpair" != x"yes"; then
+ AC_CHECK_LIB(socket, socketpair, AC_DEFINE(HAVE_SOCKETPAIR,1))
+fi
+if test x"$ac_cv_func_socket" != x"yes"; then
+ AC_CHECK_LIB(socket, socket, AC_DEFINE(HAVE_SOCKET,1))
+fi
+
+
+dnl# Systems that have nl_langinfo may not have CODESET. Test for both here
+AC_CACHE_CHECK(for nl_langinfo and CODESET, jd_cv_nl_langinfo_codeset,
+ AC_TRY_LINK(#include <langinfo.h>, char* cs = nl_langinfo(CODESET);,
+ jd_cv_nl_langinfo_codeset=yes, jd_cv_nl_langinfo_codeset=no)
+)
+if test $jd_cv_nl_langinfo_codeset = yes
+then
+ AC_DEFINE(HAVE_NL_LANGINFO_CODESET, 1, Set to 1 if you have the nl_langinfo(CODESET) function)
+fi
+
+AC_MSG_CHECKING(for environ variable)
+AC_TRY_LINK(
+#include <stdlib.h>
+extern char **environ;
+,
+exit (environ == NULL);,
+have_environ=yes, have_environ=no)
+AC_MSG_RESULT($have_environ)
+if test $have_environ = yes
+then
+ AC_DEFINE(HAVE_ENVIRON, 1, Set to 1 if environ exists)
+fi
+
+
+AC_CHECK_LIB(m, acosh, AC_DEFINE(HAVE_ACOSH,1,Set to 1 if you have the acosh function))
+AC_CHECK_LIB(m, asinh, AC_DEFINE(HAVE_ASINH,1,Set to 1 if you have the asinh function))
+AC_CHECK_LIB(m, atanh, AC_DEFINE(HAVE_ATANH,1,Set to 1 if you have the atanh function))
+AC_CHECK_LIB(m, hypot, AC_DEFINE(HAVE_HYPOT,1,Set to 1 if you have the hypot function))
+AC_CHECK_LIB(m, atan2, AC_DEFINE(HAVE_ATAN2,1,Set to 1 if you have the atan2 function))
+AC_CHECK_LIB(m, frexp, AC_DEFINE(HAVE_FREXP,1,Set to 1 if you have the frexp function))
+AC_CHECK_LIB(m, frexpf, AC_DEFINE(HAVE_FREXPF,1,Set to 1 if you have the frexpf function))
+AC_CHECK_LIB(m, ldexp, AC_DEFINE(HAVE_LDEXP,1,Set to 1 if you have the ldexp function))
+AC_CHECK_LIB(m, ldexpf, AC_DEFINE(HAVE_LDEXPF,1,Set to 1 if you have the ldexpf function))
+AC_CHECK_LIB(m, sincos, AC_DEFINE(HAVE_SINCOS,1,Set to 1 if you have the sincos function))
+AC_CHECK_LIB(m, sincosf, AC_DEFINE(HAVE_SINCOSF,1,Set to 1 if you have the sincosf function))
+AC_CHECK_LIB(m, feclearexcept, AC_DEFINE(HAVE_FECLEAREXCEPT,1,Set to 1 if you have the feclearexcept function))
+AC_CHECK_LIB(m, fpsetsticky, AC_DEFINE(HAVE_FPSETSTICKY,1,Set to 1 if you have the fpsetsticky function))
+
+JD_ELF_COMPILER
+JD_IEEE_CFLAGS
+
+ELF_CFLAGS="$ELF_CFLAGS $IEEE_CFLAGS"
+CFLAGS="$CFLAGS $IEEE_CFLAGS"
+
+JD_SET_RPATH($libdir)
+
+AC_CHECK_SIZEOF(short, 2)
+AC_CHECK_SIZEOF(int, 4)
+AC_CHECK_SIZEOF(long, 4)
+AC_CHECK_SIZEOF(float, 4)
+AC_CHECK_SIZEOF(double, 8)
+
+AC_CHECK_TYPE(ptrdiff_t,long)
+
+AC_TYPE_SIZE_T
+AC_CHECK_SIZEOF(size_t)
+
+JD_CHECK_LONG_LONG
+JD_LARGE_FILE_SUPPORT
+
+JD_TERMCAP
+JD_GCC_WARNINGS
+
+JD_SET_OBJ_SRC_DIR(src)
+
+missingmodules=""
+extramodules=""
+JD_CHECK_FOR_LIBRARY(pcre)
+if test $jd_with_pcre_library = yes
+then
+ PCRE_MODULE="pcre-module.so"
+ AC_DEFINE(HAVE_PCRE_H,1,Set to 1 if you have the pcre.h header)
+ extramodules="$extramodules pcre"
+else
+ PCRE_MODULE=""
+ missingmodules="$missingmodules pcre"
+fi
+AC_SUBST(PCRE_MODULE)
+
+JD_CHECK_FOR_LIBRARY(onig,oniguruma.h)
+if test $jd_with_onig_library = yes
+then
+ ONIG_MODULE="onig-module.so"
+ AC_DEFINE(HAVE_ONIGURUMA_H,1,Set to 1 if you have the oniguruma.h header)
+ extramodules="$extramodules oniguruma"
+else
+ ONIG_MODULE=""
+ missingmodules="$missingmodules oniguruma"
+fi
+AC_SUBST(ONIG_MODULE)
+
+JD_CHECK_FOR_LIBRARY(png)
+if test $jd_with_png_library = yes
+then
+ PNG_MODULE="png-module.so"
+ AC_DEFINE(HAVE_PNG_H,1,Set to 1 if you have the png.h header)
+ extramodules="$extramodules png"
+else
+ PNG_MODULE=""
+ missingmodules="$missingmodules png"
+fi
+AC_SUBST(PNG_MODULE)
+
+JD_CHECK_FOR_LIBRARY(z,zlib.h)
+if test $jd_with_z_library = yes
+then
+ ZLIB_MODULE="zlib-module.so"
+ AC_DEFINE(HAVE_ZLIB_H,1,Set to 1 if you have the zlib.h header)
+ extramodules="$extramodules z"
+else
+ ZLIB_MODULE=""
+ missingmodules="$missingmodules z"
+fi
+AC_SUBST(ZLIB_MODULE)
+
+m4_include(./iconv.m4)
+
+ICONV_MODULE=""
+JD_CHECK_FOR_LIBRARY(iconv)
+if test $jd_with_iconv_library = yes
+then
+ ICONV_MODULE="iconv-module.so"
+ AC_DEFINE(HAVE_ICONV_H,1,Set to 1 if you have the iconv.h header)
+ ICONV_LIB="$ICONV_LIB -liconv"
+ extramodules="$extramodules iconv"
+else
+ SLANG_AM_ICONV
+ if test "$am_cv_func_iconv" = yes
+ then
+ ICONV_MODULE="iconv-module.so"
+ extramodules="$extramodules iconv"
+ if test "X$am_cv_lib_iconv" = Xyes
+ then
+ ICONV_LIB=$LIBICONV
+ ICONV_INC=""
+ fi
+ else
+ missingmodules="$missingmodules iconv"
+ fi
+fi
+AC_SUBST(ICONV_MODULE)
+dnl # AC_SUBST(ICONV_LIB)
+dnl # AC_SUBST(ICONV_INC)
+
+AC_CHECK_FUNCS(sysconf, 
+ SYSCONF_MODULE="sysconf-module.so"
+ , SYSCONF_MODULE="")
+AC_SUBST(SYSCONF_MODULE)
+
+JD_GET_MODULES(src/modules.unx)
+JD_CREATE_MODULE_ORULES
+
+AC_MSG_CHECKING(SLANG_VERSION)
+slang_version=`grep "^#define *SLANG_VERSION " $srcdir/src/slang.h |
+ awk '{ print $3 }'`
+slang_major_version=`echo $slang_version |
+ awk '{ print int($1/10000) }'`
+slang_minor_version=`echo $slang_version $slang_major_version |
+ awk '{ print int(($1 - $2*10000)/100) }'`
+slang_micro_version=`echo $slang_version $slang_major_version $slang_minor_version |
+ awk '{ print ($1 - $2*10000 - $3*100) }'`
+
+dnl# slang_minor_version="$slang_minor_version.$slang_mminor_version"
+slang_version="$slang_major_version.$slang_minor_version.$slang_micro_version"
+AC_MSG_RESULT($slang_version)
+AC_SUBST(slang_major_version)
+AC_SUBST(slang_minor_version)
+AC_SUBST(slang_micro_version)
+AC_SUBST(slang_version)
+
+AC_CONFIG_HEADER(src/sysconf.h:src/config.hin)
+
+dnl AC_CONFIG_SUBDIRS(demo)
+
+AC_OUTPUT(Makefile:autoconf/Makefile.in \
+ src/Makefile slsh/Makefile modules/Makefile demo/Makefile \
+ slang.pc:autoconf/slangpc.in \
+)
+
+JD_CREATE_EXEC_RULE(calc)
+JD_CREATE_EXEC_RULE(untic)
+JD_APPEND_RULES(src/Makefile)
+JD_APPEND_ELFRULES(src/Makefile)
+
+echo ""
+echo "Configuration complete. You may need to edit src/Makefile."
+echo "You are compiling SLANG with the following compiler configuration:"
+echo " CC =" "$CC"
+echo " CFLAGS =" "$CFLAGS"
+echo " LDFLAGS =" "$LDFLAGS $DYNAMIC_LINK_FLAGS"
+echo ""
+echo " ELF_CC =" "$ELF_CC"
+echo " ELF_LINK =" "$ELF_LINK"
+echo "ELF_CFLAGS=" "$ELF_CFLAGS"
+echo ""
+echo " prefix:" "$prefix"
+echo " exec_prefix:" "$exec_prefix"
+echo " Installation Lib Dir:" "$libdir"
+echo "Installation Include Dir:" "$includedir"
+echo ""
+echo "See also src/sl-feat.h for various features."
+
+echo ""
+echo "The following modules that depend upon external libraries will be built:"
+echo " $extramodules"
+echo ""
+if test "X$missingmodules" != "X"
+then
+ echo ""
+ echo "While not required, it is recommended that you install the following"
+ echo "libraries and reconfigure so that the corresponding modules can be built:"
+ echo " $missingmodules"
+ echo ""
+fi
+echo "Type 'make' to build a shared version of the library."
+echo "Type 'make help' for more options"
+echo ""

_service:tar_scm:slang-2.3.2.tar.bz2/autoconf/iconv.m4 Added

@@ -0,0 +1,66 @@
+#serial AM2
+
+dnl From Bruno Haible.
+dnl Adapted from MUTT
+
+AC_DEFUN(SLANG_AM_ICONV,
+
+ dnl Some systems have iconv in libc, some have it in libiconv (OSF/1 and
+ dnl those with the standalone portable GNU libiconv installed).
+
+ AC_CACHE_CHECK(for iconv, am_cv_func_iconv, 
+ am_cv_func_iconv="no, consider installing GNU libiconv"
+ am_cv_lib_iconv=no
+ AC_TRY_LINK(#include <stdlib.h>
+#include <iconv.h>,
+ iconv_t cd = iconv_open("","");
+ iconv(cd,NULL,NULL,NULL,NULL);
+ iconv_close(cd);,
+ am_cv_func_iconv=yes)
+ if test "$am_cv_func_iconv" != yes; then
+ am_save_LIBS="$LIBS"
+ LIBS="$LIBS -liconv"
+ AC_TRY_LINK(#include <stdlib.h>
+#include <iconv.h>,
+ iconv_t cd = iconv_open("","");
+ iconv(cd,NULL,NULL,NULL,NULL);
+ iconv_close(cd);,
+ am_cv_lib_iconv=yes
+ am_cv_func_iconv=yes)
+ LIBS="$am_save_LIBS"
+ fi
+ )
+
+ if test "$am_cv_func_iconv" = yes; then
+ AC_DEFINE(HAVE_ICONV, 1, Define if you have the iconv() function.)
+ AC_MSG_CHECKING(for iconv declaration)
+
+ AC_CACHE_VAL(am_cv_proto_iconv, 
+ AC_TRY_COMPILE(
+#include <stdlib.h>
+#include <iconv.h>
+extern
+#ifdef __cplusplus
+"C"
+#endif
+#if defined(__STDC__) || defined(__cplusplus)
+size_t iconv (iconv_t cd, char * *inbuf, size_t *inbytesleft, char * *outbuf, size_t *outbytesleft);
+#else
+size_t iconv();
+#endif
+, , am_cv_proto_iconv_arg1="", am_cv_proto_iconv_arg1="const")
+ am_cv_proto_iconv="extern size_t iconv (iconv_t cd, $am_cv_proto_iconv_arg1 char * *inbuf, size_t *inbytesleft, char * *outbuf, size_t *outbytesleft);")
+
+ am_cv_proto_iconv=`echo "$am_cv_proto_iconv" | tr -s ' ' | sed -e 's/( /(/'`
+ AC_MSG_RESULT(${ac_t:-
+ }$am_cv_proto_iconv)
+ AC_DEFINE_UNQUOTED(ICONV_CONST, $am_cv_proto_iconv_arg1,
+ Define as const if the declaration of iconv() needs const.)
+ fi
+
+ LIBICONV=
+ if test "$am_cv_lib_iconv" = yes; then
+ LIBICONV="-liconv"
+ fi
+ dnl AC_SUBST(LIBICONV)
+)

_service:tar_scm:slang-2.3.2.tar.bz2/autoconf/install.sh Added

@@ -0,0 +1,248 @@
+#!/bin/sh
+#
+# install - install a program, script, or datafile
+# This comes from X11R5 (mit/util/scripts/install.sh).
+#
+# Copyright 1991 by the Massachusetts Institute of Technology
+#
+# Permission to use, copy, modify, distribute, and sell this software and its
+# documentation for any purpose is hereby granted without fee, provided that
+# the above copyright notice appear in all copies and that both that
+# copyright notice and this permission notice appear in supporting
+# documentation, and that the name of M.I.T. not be used in advertising or
+# publicity pertaining to distribution of the software without specific,
+# written prior permission.  M.I.T. makes no representations about the
+# suitability of this software for any purpose.  It is provided "as is"
+# without express or implied warranty.
+#
+# Calling this script install-sh is preferred over install.sh, to prevent
+# `make' implicit rules from creating a file called install from it
+# when there is no Makefile.
+#
+# This script is compatible with the BSD install script, but was written
+# from scratch.  It can only install one file at a time, a restriction
+# shared with many OS's install programs.
+
+# set DOITPROG to echo to test this script
+
+# Don't use :- since 4.3BSD and earlier shells don't like it.
+doit="${DOITPROG-}"
+
+# put in absolute paths if you don't have them in your path; or use env. vars.
+
+mvprog="${MVPROG-mv}"
+cpprog="${CPPROG-cp}"
+chmodprog="${CHMODPROG-chmod}"
+chownprog="${CHOWNPROG-chown}"
+chgrpprog="${CHGRPPROG-chgrp}"
+stripprog="${STRIPPROG-strip}"
+rmprog="${RMPROG-rm}"
+mkdirprog="${MKDIRPROG-mkdir}"
+
+transformbasename=""
+transform_arg=""
+instcmd="$mvprog"
+chmodcmd="$chmodprog 0755"
+chowncmd=""
+chgrpcmd=""
+stripcmd=""
+rmcmd="$rmprog -f"
+mvcmd="$mvprog"
+src=""
+dst=""
+dir_arg=""
+
+while  x"$1" != x ; do
+    case $1 in
+	-c) instcmd="$cpprog"
+	    shift
+	    continue;;
+
+	-d) dir_arg=true
+	    shift
+	    continue;;
+
+	-m) chmodcmd="$chmodprog $2"
+	    shift
+	    shift
+	    continue;;
+
+	-o) chowncmd="$chownprog $2"
+	    shift
+	    shift
+	    continue;;
+
+	-g) chgrpcmd="$chgrpprog $2"
+	    shift
+	    shift
+	    continue;;
+
+	-s) stripcmd="$stripprog"
+	    shift
+	    continue;;
+
+	-t=*) transformarg=`echo $1 | sed 's/-t=//'`
+	    shift
+	    continue;;
+
+	-b=*) transformbasename=`echo $1 | sed 's/-b=//'`
+	    shift
+	    continue;;
+
+	*)  if  x"$src" = x 
+	    then
+		src=$1
+	    else
+		# this colon is to work around a 386BSD /bin/sh bug
+		:
+		dst=$1
+	    fi
+	    shift
+	    continue;;
+    esac
+done
+
+if  x"$src" = x 
+then
+	echo "install:	no input file specified"
+	exit 1
+else
+	true
+fi
+
+if  x"$dir_arg" != x ; then
+	dst=$src
+	src=""
+
+	if  -d $dst ; then
+		instcmd=:
+		chmodcmd=""
+	else
+		instcmd=mkdir
+	fi
+else
+
+# Waiting for this to be detected by the "$instcmd $src $dsttmp" command
+# might cause directories to be created, which would be especially bad
+# if $src (and thus $dsttmp) contains '*'.
+
+	if  -f $src -o -d $src 
+	then
+		true
+	else
+		echo "install:  $src does not exist"
+		exit 1
+	fi
+
+	if  x"$dst" = x 
+	then
+		echo "install:	no destination specified"
+		exit 1
+	else
+		true
+	fi
+
+# If destination is a directory, append the input filename; if your system
+# does not like double slashes in filenames, you may need to add some logic
+
+	if  -d $dst 
+	then
+		dst="$dst"/`basename $src`
+	else
+		true
+	fi
+fi
+
+## this sed command emulates the dirname command
+dstdir=`echo $dst | sed -e 's,^/*$,,;s,/$,,;s,^$,.,'`
+
+# Make sure that the destination directory exists.
+#  this part is taken from Noah Friedman's mkinstalldirs script
+
+# Skip lots of stat calls in the usual case.
+if  ! -d "$dstdir" ; then
+defaultIFS='
+'
+IFS="${IFS-${defaultIFS}}"
+
+oIFS="${IFS}"
+# Some sh's can't handle IFS=/ for some reason.
+IFS='%'
+set - `echo ${dstdir} | sed -e 's@/@%@g' -e 's@^%@/@'`
+IFS="${oIFS}"
+
+pathcomp=''
+
+while  $# -ne 0  ; do
+	pathcomp="${pathcomp}${1}"
+	shift
+
+	if  ! -d "${pathcomp}"  ;
+        then
+		$mkdirprog "${pathcomp}"
+	else
+		true
+	fi
+
+	pathcomp="${pathcomp}/"
+done
+fi
+
+if  x"$dir_arg" != x 
+then
+	$doit $instcmd $dst &&
+
+	if  x"$chowncmd" != x ; then $doit $chowncmd $dst; else true ; fi &&
+	if  x"$chgrpcmd" != x ; then $doit $chgrpcmd $dst; else true ; fi &&
+	if  x"$stripcmd" != x ; then $doit $stripcmd $dst; else true ; fi &&
+	if  x"$chmodcmd" != x ; then $doit $chmodcmd $dst; else true ; fi
+else
+
+# If we're going to rename the final executable, determine the name now.
+
+	if  x"$transformarg" = x 
+	then
+		dstfile=`basename $dst`
+	else
+		dstfile=`basename $dst $transformbasename |
+			sed $transformarg`$transformbasename
+	fi
+
+# don't allow the sed command to completely eliminate the filename
+
+	if  x"$dstfile" = x 
+	then
+		dstfile=`basename $dst`
+	else
+		true
+	fi
+
+# Make a temp file name in the proper directory.
+
+	dsttmp=$dstdir/#inst.$$#
+
+# Move or copy the file name to the temp name
+
+	$doit $instcmd $src $dsttmp &&
+
+	trap "rm -f ${dsttmp}" 0 &&
+
+# and set any options; do chmod last to preserve setuid bits
+
+# If any of these fail, we abort the whole thing.  If we want to
+# ignore errors from any of these, just make sure not to ignore
+# errors from the above "$doit $instcmd $src $dsttmp" command.
+
+	if  x"$chowncmd" != x ; then $doit $chowncmd $dsttmp; else true;fi &&
+	if  x"$chgrpcmd" != x ; then $doit $chgrpcmd $dsttmp; else true;fi &&
+	if  x"$stripcmd" != x ; then $doit $stripcmd $dsttmp; else true;fi &&
+	if  x"$chmodcmd" != x ; then $doit $chmodcmd $dsttmp; else true;fi &&
+
+# Now rename the file to the real destination.
+
+	$doit $rmcmd -f $dstdir/$dstfile &&
+	$doit $mvcmd $dsttmp $dstdir/$dstfile
+
+fi &&
+
+exit 0

_service:tar_scm:slang-2.3.2.tar.bz2/autoconf/mkinsdir.sh Added

@@ -0,0 +1,161 @@
+#! /bin/sh
+# mkinstalldirs --- make directory hierarchy
+
+scriptversion=2006-05-11.19
+
+# Original author: Noah Friedman <friedman@prep.ai.mit.edu>
+# Created: 1993-05-16
+# Public domain.
+#
+# This file is maintained in Automake, please report
+# bugs to <bug-automake@gnu.org> or send patches to
+# <automake-patches@gnu.org>.
+
+nl='
+'
+IFS=" ""	$nl"
+errstatus=0
+dirmode=
+
+usage="\
+Usage: mkinstalldirs -h --help --version -m MODE DIR ...
+
+Create each directory DIR (with mode MODE, if specified), including all
+leading file name components.
+
+Report bugs to <bug-automake@gnu.org>."
+
+# process command line arguments
+while test $# -gt 0 ; do
+ case $1 in
+ -h | --help | --h*) # -h for help
+ echo "$usage"
+ exit $?
+ ;;
+ -m) # -m PERM arg
+ shift
+ test $# -eq 0 && { echo "$usage" 1>&2; exit 1; }
+ dirmode=$1
+ shift
+ ;;
+ --version)
+ echo "$0 $scriptversion"
+ exit $?
+ ;;
+ --) # stop option processing
+ shift
+ break
+ ;;
+ -*) # unknown option
+ echo "$usage" 1>&2
+ exit 1
+ ;;
+ *) # first non-opt arg
+ break
+ ;;
+ esac
+done
+
+for file
+do
+ if test -d "$file"; then
+ shift
+ else
+ break
+ fi
+done
+
+case $# in
+ 0) exit 0 ;;
+esac
+
+# Solaris 8's mkdir -p isn't thread-safe. If you mkdir -p a/b and
+# mkdir -p a/c at the same time, both will detect that a is missing,
+# one will create a, then the other will try to create a and die with
+# a "File exists" error. This is a problem when calling mkinstalldirs
+# from a parallel make. We use --version in the probe to restrict
+# ourselves to GNU mkdir, which is thread-safe.
+case $dirmode in
+ '')
+ if mkdir -p --version . >/dev/null 2>&1 && test ! -d ./--version; then
+ echo "mkdir -p -- $*"
+ exec mkdir -p -- "$@"
+ else
+ # On NextStep and OpenStep, the `mkdir' command does not
+ # recognize any option. It will interpret all options as
+ # directories to create, and then abort because `.' already
+ # exists.
+ test -d ./-p && rmdir ./-p
+ test -d ./--version && rmdir ./--version
+ fi
+ ;;
+ *)
+ if mkdir -m "$dirmode" -p --version . >/dev/null 2>&1 &&
+ test ! -d ./--version; then
+ echo "mkdir -m $dirmode -p -- $*"
+ exec mkdir -m "$dirmode" -p -- "$@"
+ else
+ # Clean up after NextStep and OpenStep mkdir.
+ for d in ./-m ./-p ./--version "./$dirmode";
+ do
+ test -d $d && rmdir $d
+ done
+ fi
+ ;;
+esac
+
+for file
+do
+ case $file in
+ /*) pathcomp=/ ;;
+ *) pathcomp= ;;
+ esac
+ oIFS=$IFS
+ IFS=/
+ set fnord $file
+ shift
+ IFS=$oIFS
+
+ for d
+ do
+ test "x$d" = x && continue
+
+ pathcomp=$pathcomp$d
+ case $pathcomp in
+ -*) pathcomp=./$pathcomp ;;
+ esac
+
+ if test ! -d "$pathcomp"; then
+ echo "mkdir $pathcomp"
+
+ mkdir "$pathcomp" || lasterr=$?
+
+ if test ! -d "$pathcomp"; then
+	errstatus=$lasterr
+ else
+	if test ! -z "$dirmode"; then
+	 echo "chmod $dirmode $pathcomp"
+	 lasterr=
+	 chmod "$dirmode" "$pathcomp" || lasterr=$?
+
+	 if test ! -z "$lasterr"; then
+	 errstatus=$lasterr
+	 fi
+	fi
+ fi
+ fi
+
+ pathcomp=$pathcomp/
+ done
+done
+
+exit $errstatus
+
+# Local Variables:
+# mode: shell-script
+# sh-indentation: 2
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "scriptversion="
+# time-stamp-format: "%:y-%02m-%02d.%02H"
+# time-stamp-end: "$"
+# End:

_service:tar_scm:slang-2.3.2.tar.bz2/autoconf/scripts Added

_service:tar_scm:slang-2.3.2.tar.bz2/autoconf/scripts/getsyslibs.sh Added

@@ -0,0 +1,77 @@
+#!/bin/sh
+
+# This script parses /etc/ld.so.conf and returns lib and include directories 
+# in a form that JD_CHECK_FOR_LIBRARY can grok.
+
+SH_TRUE=0
+SH_FALSE=1
+
+# Usage: sh_substr string a b ==> stringa:b (1s-based)
+sh_substr()
+{
+ echo "$1" | cut "-c" "$2-$3"
+}
+
+# if sh_is_comment line; then ...
+sh_is_comment()
+{
+ ch=`sh_substr "$1" 1 1`
+ if test "X$ch" = "X#" -o "X$ch" = "X"
+ then
+ return $SH_TRUE;
+ fi
+ return $SH_FALSE;
+}
+
+sh_read_ldsoconf ()
+{
+ file="$1"
+ dirlist=""
+ if test ! -f "$file"
+ then
+ return $SH_FALSE;
+ fi
+
+ while read line
+ do
+ if sh_is_comment "$line"; then continue; fi
+ read p1 p2 pn << EOF
+ ${line}
+EOF
+ if test "$p1" = "include"
+ then
+ for file in $p2
+ do
+ dirs=`sh_read_ldsoconf "$file"`
+ dirlist="$dirlist $dirs"
+ done
+ else
+ dirlist="$dirlist $p1"
+ fi
+ done < "$file"
+ echo "$dirlist"
+}
+
+dirs=`sh_read_ldsoconf "/etc/ld.so.conf"`
+XY=""
+for Y in $dirs
+do
+ if test "/usr/lib" = `sh_substr $Y 1 8`
+ then
+ X="/usr/include"
+ else
+ if test "/lib" = `sh_substr $Y 1 4`
+ then
+ X="/usr/include"
+ else
+ X=`dirname $Y`"/include"
+ fi
+ fi
+ if test -d "$Y"
+ then
+ XY="$XY $X,$Y"
+ fi
+done
+
+echo $XY
+

_service:tar_scm:slang-2.3.2.tar.bz2/autoconf/slangpc.in Added

_service:tar_scm:slang-2.3.2.tar.bz2/changes.txt Added

@@ -0,0 +1,4070 @@
+-*- mode: text; mode: fold -*-
+Changes since 2.3.1a
+1. modules/stats_kendall.c: Updated to use Knight's O(NlogN)
+ algorithm. This update was facilitating by separating out some
+ integer typedefs from _slang.h and placing them in _slint.h. The
+ closely relation mann_kendall function was also added to the stats
+ module.
+2. modules/stats_kendall.c: In the prtaus function, the loops were
+ reorganized loops to eliminate embedded if-tests, and the code that
+ deals with arrays were made for "C-like".
+3. Merged Manfred Hanke's CSV module documentation updates.
+4. slsh/lib/cmdopt.sl: The form -fVAL was not working as described for
+ short-options whose value (VAL) is optional.
+5. src/sl*.h: Updated Unicode tables from version 5 to 9
+6. src/slischar.h: Previously, if a lower(upper) case character did
+ not have a mapping to an upper(lower) case character, it was take
+ to not have a case. This restriction has been dropped. In other
+ words, it is nolonger necessary for an upper(lower) case character
+ to have a lower(upper) case equivalent.
+7. src/slpack.c: Added an intrinsic function (_array_byteswap) that
+ may be used to convert the values of an array from one endianness
+ to another.
+8. src/slparse.c: It is now possible to use reserved words as struct
+ field names without quoting them. For example, it is now possible
+ to write
+ s = struct { public = value };
+ Previously, this required the field name to be quoted:
+ s = struct { "public" = value };
+
+9. modules/json-module.c: Malformed UTF-8 was not being properly
+ handled by the json-encoder.
+10. modules/csv-module.c: The decode_csv_row function was ignoring the
+ delimiter setting after a quoted string.
+11. src/slparse.c: A for statement lacking a conditional expression
+ was not being properly handled (noticed by rocket penguin).
+12. src/struct.c: Rewrote the __add_binary function, which was not
+ properly handling multiple data types.
+13. changes.txt: Converted to UTF-8 (Miroslav Lichvar)
+14. src/slscanf.c: The sscanf function was not parsing ".0" as a
+ floating poing number (zero).
+15. The library was failing to compile when __tmp operator
+ optimizations were turned off. The default is to permit such
+ optimizations since they can lead to faster running code and less
+ memory usage. Bug reported by Henry.
+16. src/slsh.c: Updated copyright year.
+17. INSTALL.unx: Corrected the URL for the ONIGURUMA regexp library; added
+ a small note that PCRE2 is not supported (Henry Nelson).
+18. modules/csv-module.c: If the delimiter or quote character is
+ specified to be 0, then use the defaults (, and ").
+19. src/sltermin.c: Added support for the new ncurses 32-bit terminfo
+ database entries.
+20. autoconf/aclocal.m4,src/Makefile.in: Install shared objects
+ (modules and library) with executable permissions.
+21. src/sl*.h: Updated Unicode tables from version 9 to 10
+22. src/sltermin.c: Corrected a few typos in the comments (Manfred
+ Hanke).
+23. Updated Copyright year to 2018
+24. doc updates
+25. src/sltermin.c: removed unnecessary "extern" function attribute.
+26. src/test/syntax.sl: The version number test required the use of
+ isalpha and not isascii.
+
+{{{ Previous Versions
+
+Changes since 2.3.1
+a. Some tests were failing when compiled with a compiler that defaults
+ to using `unsigned char'. In the few places where a `signed char'
+ was assumed, `char' was changed to `signed char'. Also, a
+ copy-paste error was corrected in the src/test/sltest.c that caused
+ the test program to fail on big-endian 64 bit systems.
+
+Changes since 2.3.0
+1. modules/json-module.c: Fix a possible uninitialized variable error.
+2. Define _BSD_SOURCE the few places necessary to get prototypes for
+ strtoll and BSD specific network struct fields.
+3. src/slstd.c: define _SVID_SOURCE to get prototype for putenv
+4. modules/Makefile.in: On cygwin, the libraries must be placed last
+ for module compilation (Marco Atzeri).
+5. src/slstrops.c: The return value from pop_lut was not being
+ checked leading to a segv upon faiure (reported by Morten Bo
+ Johansen).
+6. slsh/lib/slshrl.sl: Floating point literals with a leading '.' were
+ not being properly handled by slsh_interactive_massage_hook
+ (Manfred Hanke).
+7. src/slarrfun.c: Added wherefirst/last_eq/ne/gt/lt/ge/le functions,
+ which are much faster than using just wherefirst or wherefast with
+ the implied binary comparison. For example:
+
+ slsh> .load rand
+ slsh> x = rand_uniform (100000);
+ slsh> tic; loop (1000) i=wherefirst(x>=0.999); toc; i;
+ 0.597183
+ 268
+ slsh> tic; loop (1000) i=wherefirst_ge(x,0.999); toc; i;
+ 0.0024419999999999997
+ 268
+
+ For this case, the speedup about 0.60/0.0024 = 250.
+8. Rebuilt text documentation for change #7.
+9. Documentation updates (Manfred Hanke).
+10. src/slarrfun.inc: use a macro for the common case statements of
+ the wherefirst_op and wherelast_op code. (Manfred Hanke)
+11. modules/stats.sl: Added Anderson-Darling tests:
+
+ ad_test: test for normality
+ ad_ktest: k-sample test
+
+ I also broke out some of the statistical tests into separate files.
+12. Tweaked the makefiles to create a statically-linked version of
+ slsh when `make static` and `make install-static` are run.
+13. For the static slsh build, disable dynamic linking.
+14. src/slstdio.c:fread_bytes: A size_t vs unsigned int issue was
+ causing SLmalloc to be called with an incorrect size in some cases.
+15. src/slbstr.c: Made the size of the printable representation of
+ binary strings customizable via get/set_printable_bstring_size
+ intrinsics.
+16. slsh/slsh.c: A missing continue statement was causing slsh to stop
+ parsing command line options after the first occurrence of -D.
+17. src/slang.h: Remove duplicate prototype for
+ SLrline_get_update_client_data. (Valdis Kletnieks)
+18. src/slposdir.c: Add statvfs intrinsic that wraps corresponding
+ POSIX function.
+19. modules/Makefile.in, png-module.c: Cygwin tweaks
+ (Marco Atzeri).
+20. */*.c: Added explicit (unsigned char) typecast to isspace/isdigit
+ functions.
+21. */*.c: reduced the scope of some variables; removed duplicate ||
+ expression from slarray.c (David Binderman)
+22. src/slarray.c: The Kahan error corrections were not be added back
+ when summing complex arrays.
+23. slsh/lib/listfuns.sl: Corrected the usage method for heap_new().
+24. Found and corrected a few memory leaks that occur after a malloc
+ failure; added some more unit tests
+25. Added more regression tests and bug fixes:
+
+ slscanf.c: %i was failing for Octal and Hex forms
+ slbstr.c: <, and > operators were swapped for binary strings
+ histogram-module.c: A missing 'break' statement was causing hist2d
+ to fail when binning 8 bit integers.
+
+26. src/slposdir.c: If an fdopen'd FILE* object was closed, then do
+ not close the underlying fd descriptor; added more regression/unit
+ tests.
+27. modules/test/test_stats.sl: Do not use 64 bit ints when testing
+ the mean and stddev functions on 32 bit systems since these
+ integers are not supported by the functions.
+28. modules/stats-module.inc: Some arrays were causing median_nc to
+ not converge.
+29. src/slscanf.c: Allow whitespace in the format to match 0
+ whitespace characters in the input string.
+30. src/slproc.c: define _XOPEN_SOURCE to be 500
+31. src/slproc.c: #30 caused a compilation error on macos since it
+ caused certain rusage fields to not be exposed. Define
+ _BSD_SOURCE to expose them.
+32. src/slerr.c: Add a windows error handler so that windows will
+ return an error code instead of aborting when passed a bad file
+ descriptor, etc.
+33. src/slproc.c: Use _XOPEN_SOURCE=1 instead of 500. This setting
+ works for both OSX and Windows. (See #30,31)
+34. src/slcurses.h: SLtt_Char_Type and SLcurses_Char_Type were being
+ used interchangably.
+35. src/sldisply.c: Added support for 24 bit color terminals based
+ upon a patch from Egmont Koblinger forwarded to me by Anton Kochkov.
+ See NEWS for usage. (for 64 bit systems)
+36. src/slposio.c: Rename the posix_close function to avoid conflict
+ with an upcoming POSIX standard. (patch provided by Thomas
+ Petazzoni).
+37. slposio.c,slstdio.c,slposdir.c: Do not include <sys/fcntl.h> if
+ <fcntl.h> was included. (variation on a patch provided by Thomas
+ Petazzoni).
+38. slsh/: Move processing of the SLSH_PATH environment variable to
+ slsh.rc. Also, guess the slsh lib path based upon the location of
+ the executable.
+39. modules/onig-module.c: Only allow certain flags for onig_search.
+ Others cause onig_search to reinterpret the meaning of the region
+ argument.
+40. slsh/etc/slsh.rc: Add support for multiple paths to the
+ *_to_slang_load_path functions.
+41. src/slscanf.c: The formats %x and %o were producing a signed values instead
+ of an unsigned ones.
+42. src/slconfig.h,...: Added longlong functions to win32, use
+ "%I64d/u" format when printing long long on win32.
+43. src/slcurses.c: Changed the data type of SLcurses_Char_Type back
+ to long128 (change #34 broke backward compatibility)
+44. src/slstruct.c: Optional argument to _push_struct_field_values may
+ be used to specify the fields to be pushed.
+45. src/sllimits.h: Bumped up the size of the slsring table. A future
+ version will dynamically resize the table.
+46. src/slstd.c,slstrops.c: Improve the speed of sprintf by reducing
+ the number of reallocs and special casing strings in the
+ _pSLstring_intrinsic function.
+47. modules/cvs.sl: Reading a CSV file from an open file descriptor
+ (e.g., stdin) was failing. The updated regression test also
+ exposed a side effect of change #38: the uninstalled version of
+ slsh.rc lacks processing of SLSH_PATH. Processing of SLSH_PATH
+ was added to the test.sl include file.
+48. src/slregexp.c: The RE \d? was not handled properly.
+49. src/slmisc.c: Catch empty hex \x and decimal \d escape sequences.
+50. autoconf/Makefile.in: Add install-pkgconfig to the install-static
+ target. (Max Filippov).
+51. src/test/signal.sl: Skip the sigsuspend test when running from
+ make. The test involves the user pressing ^C, which kills the
+ make process. This test should be run outside of make.
+52. src/slmisc.c: Corrected a typo in the error message introduced in
+ change #49 (Manfred Hanke).
+53. src/sltime.c: Added _ftime, which returns the number of
+ (wallclock) seconds since an epoch.
+54. Changes the array allocation routines to use a signed integer
+ (SLindex_Type) vs an unsigned one (SLuindex_Type). The reason for
+ this is that all slang arrays may be indexed from the end using a
+ negative index, and multidemsional arrays must allow indexing
+ using a single signed index, e.g.,
+
+ a = Int_Type10,20; ...; awhere(a<0) = 0;
+55. src/sltime.c: Fixed a windows compile error involving _ftime
+ (see change #53).
+56. src/slnspace.c,...: Check for malformed namepace names.
+57. doc/tm/: Documentation updates (Agathoklis D. Chatzimanikas)
+58. slsh/slsh.c: Added __slsh_startup_hook function that slsh will
+ call after loading slsh.rc.
+59. modules/: Updated the png and pcre modules, and added new test
+ scripts. Added support for setting the compression value to the
+ png module, and added additional symbolic constants to the pcre
+ module.
+60. slsh/lib/test/: Have `make check` run the test scripts in this
+ directory.
+61. modules/csv-module.c: Added line number information to error
+ messages.
+62. src/test/: Updated some tests
+63. src/sltoken.c: bug fix affecting reading byte-compiled files: Use
+ SLatoul for unsigned longs instead of atol; remove alignment test
+ from pack.sl until a new test can be devised.
+64. Added support for compiling against slsyswrap testing library.
+ It is disabled for production code.
+65. Bug fixes:
+
+ src/slarrfun.c: SLang_duplicate_array return value not checked;
+ src/slstdio.c: SLfree was used in an error handler instead of
+ SLang_free_slstring
+ src/slposio.c: If EINTR happens in the close function, do not
+ restart it. See <http://lwn.net/Articles/576478/>.
+ src/sltoken.c: Use unsigned char * cast for SLatol functions.
+
+66. src/slmisc.c: \uABCD supported in string literals. Previously,
+ braces were required (\u{ABCD}).
+67. Updated many of the unit tests/regression scripts.
+68. Updated more tests. Made use of the _slang.h LONG_IS_INT macro to
+ eliminate some unused functions on systems where
+ sizeof(long)==sizeof(int).
+69. modules/slsmg-module.c: was not compiling on windows; fixed a
+ malformed comment in src/test/sltest.c.
+70. Added "#define _DEFAULT_SOURCE" to a few places to quiet gcc;
+ Added slsyswrap support to src/slposdir.c,slposio.c,slcommon.c
+71. src/slexcept.c: The deprecated _clear_error function using in
+ ERROR_BLOCKs was not completely removing queued error messages.
+ Note: ERROR_BLOCKs will be removed in version 3.
+72. src/slregexp.c: Added "\{m,n\}" support to '\1'-'\9', '.', and
+ '\d' REs. '$' changed to match only at the end of a string, or
+ just before a \n at the end of the string. Updated regexp.sl test.
+73. src/slang.c: The delete_interpreter function (called upon program
+ exit) was not freeing local variables on the function call stack. This
+ showed up as a memory leak when a function called "exit", which
+ would not allow the function stack to unroll and trigger the
+ destructors.
+74. src/*.c: Added a few gcc #pragmas to turn off warnings about
+ non-string literals as printf-style formats.
+75. src/*.c, modules/*.c: If close fails with errno=EINTR, do not restart
+ it. Doing so invokes undefined behavior.
+76. src/slerr.c: Add _pSLerr_deinit to the exit hook.
+77. src/slarray.c,src/slclass.c,src/slstruct.c: Use the SLclass_set*
+ functions to set SLang_Class_Type fields instead of directly
+ accessing them.
+78. Added additional unit/regresssion tests.
+79. Makefiles: Add a time-stamp dependency to directory targets to
+ avoid race conditions when running parallel make (Based upon a
+ patch from Kylie McClain).
+80. src/Makefile.in: Updated the libslang.a dependency to account for
+ change #79.
+81. tweaked a few files (modules/png-module.c,src/slarith.inc,src/slimport.c)
+ to reduce gcc warnings.
+82. modules/test/test_slsmg.sl: Test skipped if the terminal type is
+ "unknown".
+83. Updated copyright years; some doc updates
+84. src/sldisply.c: make JMAX_COLORS consistent with SLTT_MAX_COLORS.
+85. src/slstrops.c: Added string_to_wchars and wchars_to_string
+ intrinsic functions.
+86. Moved gcc diagnosic pragmas outside function bodies for
+ compatibility with old versions of gcc.
+87. src/slwclut.c: Unclosed ranges (hyphen at the end of a character
+ set specification string) were not being handled properly: the
+ character befor the hyphen was being dropped, e.g.,
+
+ strcompress ("foo-(bar)", "_()-");
+
+ was producing "foo_bar)" instead of "foo_bar".
+88. src/sllimits.h: Reduce SLANG_MAX_RECURSIVE_DEPTH to 500 on
+ CYGWIN/WIN32 to avoid hitting the default runtime stacklimit.
+89. Updates to the mingw32/64 build system.
+90. src/sltermin.c: Avoid invalid free when TERMCAP is used. See
+ <https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=837868>.
+91. Some documentation typos corrected (Agathoklis D. Hatzimanikas;
+ debian patches)
+92. src/_slang.h: On at least one platform, clang defines GNUC but
+ does not implement GNU C inline semantics. Disble inline support
+ for clang if GNUC defined.
+93. src/sllimits.h: SLANG_MAX_RECURSIVE_DEPTH set to 1500 to decrease
+ the probability of running into the C runtime stacksize limit.
+94. src/test/sltest.c: A missing preprocessor #else block in change
+ #78 was causing UTF-8 tests to fail in a non-UTF8 environment.
+95. MacOSX changes: fix environ intrinsic, export DYLD_LIBRARY env
+ variable in test scripts.
+96. slsh/lib/process.sl: If execvp fails, include the name of the executable
+ in the error message.
+97. autoconf/config.*: Updated scripts
+98. .../runtests.sh: Added LD_LIBRARY_PATH to test scripts (removed in
+ #96)
+99. mkfiles/makefile.m32: Use mkfiles\runslsh.bat instead of
+ mkfiles/runslsh.bat (Windows only).
+100. documentation updates
+
+
+Changes since 2.2.4
+1. src/slarray.c: Try to find a suitable multiplier for range arrays
+ to avoid roundoff errors. Using the multiplier avoids the
+ 1:10:0.001 from having the element 1.1260000000000001.
+2. doc/tm/rtl/strops.tm: Correct typos in string_match documentation
+ (Manfred Hanke).
+3. modules/base64-module.c: Added a base64 encoder module.
+4. modules/chksum-module.c: A module to compute md5, sha1, etc
+ checksums.
+5. Removed a few unused variables from the code.
+6. Documentation updates and corrections by Agathoklis D. Hatzimanikas.
+7. src/slarray.c: array_map enhanced to handle functions that return
+ multiple values (based upon a patch from Manfred Hanke).
+8. Documentation tweaks (Manfred Hanke).
+9. src/slmath.c: Added sincos intrinsic (Manfred Hanke)
+10. doc/tm/rtl/array.tm: Changed an example used in the array_map
+ documentation.
+11. More documentation updates/corrections (Agathoklis D. Hatzimanikas).
+12. src/slarray.c: Tweaked the code that computes the
+ array-range-multiplier to avoid agressive optimization by the
+ compiler.
+13. modules/rand.sl: The rand_int function was not working correctly
+ (Thomas Dauser).
+14. modules/test/test_rand.sl: Added a simple statistical test for
+ rand_int (based upon an idea by Thomas Dauser).
+15. modules/test/test_rand.sl: Corrected a typo introduced by #14.
+16. src/slarray.c: #12 introduced a truncation error for some
+ values involving the range multiplier.
+17. autoconf/aclocal.m4: Change ncurses5w-config to ncursesw5-config
+ (Gilles Espinasse).
+18. modules/base64-module.c: Added decoder.
+19. slsh/lib/sldbcore.sl: Only run the debugger from the pid that
+ started it. This avoids problems debugging scripts that call fork.
+20. src/slrline.c: SLrline_read_line will return NULL if getkey
+ returns SLANG_GETKEY_ERROR.
+21. doc/tm/rtl/*.tm: A few typos corrected (Manfred Hanke).
+22. slsh/lib/print.sl; print binary strings differently from regular
+ ones (Manfred Hanke).
+23. slsh/lib/print.sl: I introduced a typo in #21 (Pablo Cassatella).
+24. src/slutty.c: if the flow control parameter to the SLang_init_tty
+ argument is negative, the terminal's flow control handling will
+ not be changed.
+25. src/slrline.c: Ammend #20 to return NULL if errno != EINTR.
+26. src/sldisply.c: Changed Termcap_Initalized -> Termcap_Initialized
+27. src/slarray.c: avoid an expensive memcpy when doing
+ an aget via an index array on a (b)string. (Paul Boekholt).
+28. slsh/scripts/badlinks: Updated to use array_map and cmdopt
+ (Agathoklis D. Hatzimanikas).
+29. Some minor documentation tweaks (Agathoklis D. Hatzimanikas)
+30. More doc tweaks (Agathoklis D. Hatzimanikas)
+31. src/slposio.c: lseek was not working properly.
+32. slsh/scripts/badlinks: Changed from GPLv3 to GPLv2 with permission
+ from Agathoklis Hatzimanikas.
+33. src/slscanf.c: Call strtod in a locale where the decimal point is
+ ".". This works around problems associated with modules that
+ change the locale.
+34. src/slscanf.c: include <xlocale.h> if available.
+35. src/slscanf.c: Avoid the use of setlocale and simply copy the
+ locale's decimal point before calling strtod (Paul Boekholt).
+36. modules/socket-module.c: NULL was being returned when accept was
+ called with a single argument (Fixes bug reported by Arik
+ Mitschang).
+37. src/slwclut.c: A logic error was causing strtrans to function
+ improperly for some UTF-8 encoded strings.
+38. src/fork-module.c: If WCONTINUED is not defined, define it to be 0
+ (from debian patch).
+39. src/slbstr.c: Added support for an optional offset parameter to
+ is_substrbytes.
+40. modules/csv.sl: Allow the "names" qualifier to be a list in
+ addition to an array.
+41. *.c/*.h: provide a path for a future change in the
+ return value of the malloc/free functions. Now they process char*
+ pointers but this will be changed to void* in the future.
+42. modules/: Merged stats and histogram modules into the distribution.
+43. modules/stats-module.c: removed a couple of unused variables.
+ Also modules/test/test_*.sl updated to use modules in the $(ARCH)objs
+ subdir.
+44. src/slang.c: Local_Variable_Stack is now dynamically allocated,
+ and the value of SLANG_MAX_LOCAL_STACK made to scale with
+ SLANG_MAX_RECURSIVE_DEPTH.
+45. modules/cmaps/: Added 3 perceptually balanced color maps derived
+ from matlab code by Matteo Niccoli under the BSD license.
+46. src/slmath.c: Use _pSLang_peek_at_stack2 instead of the combination
+ SLang_peek_at_stack and SLang_peek_at_stack1. This change
+ provides a bit more performnce.
+47. slsh/lib/fswalk.sl: Functions here facilitate walking the
+ filesystem.
+48. Some doc updates.
+49. slsh/: Using help at the prompt will invoke the pager if the
+ number of lines is longer than the screen size. This required add
+ an slsh-specific intrinsic that returns the number of rows.
+50. modules/stats.sl: Avoid integer overflow when computing Spearman's
+ rank correlation (Victoria Grinberg).
+51. modules/csv.sl; Added support for RDB tab-delimited files via the
+ ";rdb" qualifier.
+52. modules/stats-module.c: The stddev function was computing an
+ incorrectly normalized value when passed the optional dims argument.
+53. src/slang.h: The following qualifier functions were added to the
+ public API:
+
+ SLang_qualifier_exists;
+ SLang_get_int_qualifier;
+ SLang_get_long_qualifier;
+ SLang_get_double_qualifier;
+ SLang_get_string_qualifier;
+
+ These functions may be used to create intrinsic functions that use
+ qualifiers.
+54. The previous change necessitated a minor change in the qualifier
+ semantics such that qualifiers that are created with no value
+ assigned are implicitly given a value of 1. That is, foo(arg;q)
+ and foo(arg;q=1) are now equivalent forms. Previously, foo(arg;q)
+ and foo(and;q=NULL) were equivalent. Experience has shown that
+ the new semantics result in simpler code. This change should not
+ break any existing interpreter scripts.
+55. Backed out change #54 because it did break some scripts.
+56. src/util/mkslarith2.sl: Used "signed char" instead of "char" to
+ avoid problems with systems that assume unsigned characters.
+ (RongQing Li).
+57. modules/socket-module.c: Added support for socket credentials
+ (Arik Mitschang).
+58. src/signal.c: Added support for interval timers via the
+ get/setitimer functions.
+59. src/test/signal.sl: Missing #endif (Paul Boekholt)
+60. autoconf/slang.pc: Allow prefix and exec_prefix to be different
+ (Diab Jerius).
+61. src/sltoken.c: Use an unsigned cast when calling putc to
+ work-around what looks like a VMS C library bug bug.
+62. src/slarrfun.c: Added wherefirstmin/max and wherelastmin/max
+ functions.
+63. src/slarrfun.inc: Removed an unused variable from the
+ wherefirst/last/min/max functions.
+64. src/slcommon.c: find_interrupt_hook was not setting the prevp
+ variable causing some hooks to become lost during calls to
+ SLang_remove_interrupt_hook.
+65. src/slrline.c,slsh/readline.c: Added support for SLrline
+ callbacks. See the slsh docs for details.
+66. src/slarray.c: Added wherediff intrinsic. This returns an array
+ of indices where adjacent elements of an array differ.
+67. modules/stats-module.c: Rewrote the log_gamma_star function to
+ avoid double precision overflows when computing the poisson_cdf
+ function for large values. Also, the poisson_cdf function now
+ uses the Wilson and Hilferty normal approximation for values of
+ lambda greater than 1000.
+68. src/slrline.c: Use the SLang_set_error function instead of
+ manipulating the _pSLang_Error variable. Also, changed the readline
+ "kbd_quit" function to throw a UserBreakError.
+69. src/mkfiles/mkmake.exe: Compiled as a win32 executable. The old
+ 16bit DOS version was renamed to mkmake16.exe.
+70. slsh/readline.c: Change #65 broke the slsh --no-readline option.
+71. mkfiles/: Added the /y option to the DOS copy command to avoid
+ being prompted to overwriting files when installing on a windows
+ system.
+72. win32-specific changes: Additional makefile tweaks. Also, permit
+ "./foo" to represent a "relatively-absolute" filename on
+ DOS/Windows.
+73. modules/stats.sl: Added the correlation function.
+74. src/slarray.c: _isnull was not handling Null_Type arrays.
+75. src/slparse.c: If the _for statement contains two control
+ variables instead of 3, assume the third is 1.
+76. modules/fork-module.c: The execve_intrin was not functioning
+ properly (Agathoklis D. Hatzimanikas).
+77. slsh/readline.c: Check to see if an update_hook has been set
+ before adding callbacks to it.
+78. modules/csv.sl: Add support for empty field names.
+79. slsh/lib/slshrl.sl: Added "who" interactive command that shows the
+ names and values of all variables/functions defined at the prompt:
+
+ slsh> x = 1; y = "foo";
+ slsh> who;
+ Integer_Type x=1
+ String_Type y="foo"
+
+80. slsh/lib/print.sl: If the string form of the object ends in a
+ newline, do not write another.
+81. modules/stats.sl: The usage message for Welch's t-test referred to
+ Student's form.
+82. slsh/lib/sldbcore.sl: When entering the debugger_input_loop,
+ initialize the SIGINT handler.
+83. slsh/lib/arrayfuns.sl: New function: rearrange, which may be used
+ to perform an in-place rearrangement of an array or list.
+84. slsh/lib/listfuns.sl: New file that includes various functions
+ dealing with lists and list-based data structures. Currently this
+ includes list_sort and a heap object.
+85. slsh/lib/listfuns.sl: heap_peek was improperly declared.
+86. Numerous changes from int -> SLindex_Type. Note that SLindex_Type
+ is currently typedefed to be an int. For version 3, SLindex_Type
+ will become a long. This change lays some of that groundwork.
+ Similarly, I added SLFUTURE_CONST here and there. Neither of
+ these changes break binary compatibility nor affect the API.
+87. src/slarrfun.c: The prod function for complex numbers had a sign
+ error.
+88. modules/csv.sl: Modify fixup_header_names to work with scalars.
+89. modules/json-module.c: New module provided by Manfred Hanke. To
+ support this module several other changes were made including some
+ additions to the API.
+90. Initial support for 64-bit windows: Use ptrdiff_t instead of long
+ when subtracting pointers. Also json-module added to windows
+ makefiles.
+91. modules/rand.sl: rand_int was not properly handing intervals
+ larger than INT_MAX.
+92. src/slbstr.c: Added bstrjoin and bstrcat intrinsics.
+93. modules/json-module: Modified to use bstrcat. The
+ json_generate/json_parse functions were renamed to
+ json_encode/json_decode.
+94. configure: added support for parsing /etc/ld.so.conf
+95. modules/json.sl: Use bstrcat throughout json_encode; additional
+ renames: generate->encode, parse->decode. (Manfred Hanke).
+96. src/sllist.c: To decrease memory usages by lists, a size hint may
+ be specified upon list creation.
+97. Allow struct field names to be an arbitrary string. When
+ referencing such a field, quotes must be used:
+
+ X = struct {"some-field", some_other_field };
+	 X.some_other_field = 3;
+	 X."some-field" = 4;
+
+ New struct-related functions were added to the C API:
+
+ SLang_create_struct
+ SLang_push_struct_field
+ SLang_pop_struct_field
+ SLang_pop_struct_fields
+
+98. Changed the json module to use structs instead of associative
+ arrays. (Paul Boekholt).
+99. src/slassoc.c: Add C API SLang_assoc_key_exists (Paul Boekholt).
+100. src/slang.c: Add SLstack_exch and tweak the json module to use it.
+101. src/slang.h: Made the SLcompute_string_hash function public and
+ rewrote the hash table function in the json module to use it.
+102. json-module: Doc updates, use compact encoding by default
+ (Manfred Hanke).
+103. src/slstd.c: Added get_environ intrinsic, which returns an array of
+ the currently defined environment variables.
+104. src/slang.c: Fixed a small memory leak introduced by the byte-code
+ optimizer when dealing with floating point literals.
+105. src/slang.c: The changes added in #104 were a bit too aggressive.
+ I added code so that only literals get freed.
+106. src/slstd.c: OSX has no proper environ, need to use a function
+ call. (Dima Pasechnik).
+107. src/sldisply.c: Added support for an italic attribute if the
+ terminal supports it. This can be enabled using a color name
+ with a qualifier, e.g.,
+
+ SLtt_set_color ("menu", "white;italics", "blue");
+
+ This mechanism has also been extended to other attributes:
+
+ SLtt_set_color ("comment", "black;underline;italics", "cyan");
+
+ (Based upon a patch provided by Egmont Koblinger).
+
+108. *.tm: Documentation updates and corrections. (Agathoklis D.
+ Hatzimanikas)
+109. modules/csv-module.c: The store_value function was not updating
+ the num_allocated variable when resizing the value array. This
+ caused it to fail when reading a CSV table with more than 256
+ data columns.
+110. modules/csv.sl: Since S-Lang structure field names may be
+ arbitrary strings, there is no need to massage the csv column
+ names. (See change 97).
+111. modules/iconv-module.c: If the iconv descriptor has been closed,
+ then do not close it again in the iconv object destructor
+112. src/slproc.c: Added getrusage function to get process resource
+ usage.
+113. modules/png-module.c: Only the first 1/4 pixels of an RGB+alpha
+ image were getting byte-swapped. (RGB images were ok).
+114. configure,*/Makefile.in: rearranged the compiler command so that
+ include flags occur before CFLAGS. This is a protective measure
+ designed to avoid issues when the CFLAGS variable also contains an
+ include path.
+115. slsh/lib/process.sl: Added support to the pre_exec_hook callback
+ function for an optional argument.
+116. Change 107 introduced a cut/paste error that prevented the
+ background color on Windows systems from being properly parsed.
+ (Reported by Frank and Manfred from jed-users).
+117. src/sldisply.c: SLSMG_COLOR_BRIGHT_MAGENTA and
+ SLSMG_COLOR_BRIGHT_CYAN were swapped (patch provided by Thorben
+ from slang-users list).
+118. Updated copyright year for upcoming release.
+119. src/slposdir.c: Added lchown intrinsic.
+120. src/slang.h, src/slpath.c: Added API function SLpath_getcwd
+121. src/slsh.c: Use SLpath_getcwd instead of "." for CWD.
+122. src/slpath.c: Added support for \\netdrive\paths for Windows, and
+ modified SLpath_dirname (path_dirname intrinsic) to perform some
+ expansion of .. and . in path names (e.g.,
+ path_dirname("/foo/../bar") will produce "/" instead of
+ "/foo/..").
+
+ The old bahavior was consident with that of the Unix
+ dirname command:
+ $ dirname `dirname /usr/bin/./slsh`
+	/usr/bin
+
+ The new behavior produces an arguably more accurate result:
+ slsh> path_dirname(path_dirname("/usr/bin/./slsh"));
+	/usr
+
+123. slsh/scripts/badlinks updated to use the fswalk functions
+ (Agathoklis D. Hatzimanikas).
+124. Various documentation updates/corrections (Agathoklis D.
+ Hatzimanikas).
+125. slsh/slsh.c: bumped copyright year.
+126. src/slconfig.h: For non-Unix, HAVE_LSTAT and HAVE_LCHOWN were
+ defined to be 0 instead of undef'd. Also, removed an unused
+ function from slposdir.c and a shadowed variable from slpath.c
+127. documentation updates (Manfred Hanke)
+128. modules/test/: Additional json-modules tests (Manfred Hanke)
+129. src/slarray.c: Allow functions called by array_map to return
+ NULL. (Manfred Hanke)
+130. src/slang.c: Fixed a bug in the short-circuiting of non-boolean
+ expressions.
+131. Updated the NEWS file for release.
+132. documentation updates
+133. autoconf/: Updated configure scripts
+134. src/mkfiles/mkmake.c: Add definitions for SLmalloc/free so that
+ mkmake can be built without the full slang library.
+
+Changes since 2.2.3
+1. src/slpack.c: Typo affecting 64 bit integers ('q' & 'Q') (Paul
+ Boekholt).
+2. src/Makefile.in: Make libslang.so a symlink to libslang.so.2
+ instead of libslang.so.2.2.4 (Miroslav Lichvar)
+3. modules/Makefile.in: Cygwin needs ELFDIR defined (Marco Atzeri).
+4. src/slutty.c: Added additional baud rate values (Sergey Vlasov)
+5. autoconf/configure.ac: Check for socket and socketpair in -lsocket
+ if it is not in libc.
+6. *.tm, src/slstrops.c, src/slbstr.c: Changed occurances to
+ occurrences (Marcel Telka).
+7. src/slparse.c: Increment the _boseos_info value for qualifier
+ expressions.
+8. src/sltoken.c,slparse.c: The semantics of the _boseos_info variable
+ changed such that bos/eos callbacks are not generated for
+ preprocessor #ifeval statements unless bit 0x100 is set.
+9. slsh/scripts/slstkchk: a new script used for running the
+ stack-check debugger.
+10. documentation updates/tweaks (Manfred Hanke).
+11. slsh/lib/rline/histsrch.sl: When building history search
+ completions, use most recent history first.
+12. src/slarray.c: Detect integer overflows for multi-dimensional
+ arrays.
+13. Updated year from 2010 to 2011
+14. src/slcommon.c: Added _slcalloc, _slrecalloc memory allocation
+ functions that check for unsigned integer wrapping. A number of
+ vulnerable calls to SLmalloc were modified to use these functions.
+ (Fixes an issue reported by Pablo Cassatella).
+15. src/slarray.c: Detect attempts to create a 0 dimensional array.
+16. modules/csv.sl: Float and double NaNs were reversed. When
+ normalizing columns names, _ characters were not being properly
+ treated.
+17. doc/tm/rtl/time.tm: Added documentation for timegm (Manfred Hanke).
+18. doc/tm/crtl/slsmg.tm: Corrected prototype for SLsmg_read_raw (Manfred Hanke).
+19. Tweaked doc macros and rebuilt docs.
+20. src/slarray.c: Added a check for too small of a range array
+ increment.
+
+Changes since 2.2.2
+1. src/sltermin.c: Added support for native terminfo binary layouts.
+ Some systems have binary terminfo files that are incompatible with
+ the standard ncurses layout. Use the --terminfo=layout configure
+ option to specify a non-standard layout (hpux11, osf1r5, uwin,
+ aix4, default). This incompatibity was pointed out by River Tarnell.
+2. src/slparse.c: complicated lvalue expressions were not being properly
+ parsed.
+3. src/slstrops.c: Added strskipbytes function.
+4. doc/tm/rtl/*.tm: A number of typos were corrected. (Agathoklis D.
+ Hatzimanikas)
+5. src/slang.c,slparse.c: Qualifiers were not being passed to functions called
+ via derefencing an array of function references, e.g.,
+ (@fn)(args;q).
+6. src/slparse.c: Flag attempts to call literals as functions.
+7. slsh/lib/process.sl: Added a "dir" qualifier to the new_process
+ function. This allows the subprocess to be started in a specified
+ directory.
+8. src/slrline.c: Added rline_get_last_key_function, which returns the
+ last slang readline key function.
+9. */Makefile.in: Commmened out "DESTDIR=" lines (Marcel Telka).
+10. slsh/lib/rline.sl: Added rline_edit_history (allows the history to
+ be edited in an external editor) and rline_up/down_hist functions.
+11. src/slparse.c: An incorrect check (< instead of <=) was causing -0
+ to generate an error.
+12. .../tm/*: Corrected some documentation typos and spelling errors
+ (Agathoklis D. Hatzimanikas).
+13. doc/tm/rtl/misc.tm: Documented the __tmp function and corrected a
+ few more documentation typos (Agathoklis D. Hatzimanikas).
+14. src/slerrno.c: ELOOP was defined twice (Agathoklis D. Hatzimanikas).
+15. doc/tm/slang.tm: Fixed a few doc errors noticed by Manfred Hanke.
+16. src/slsh/scripts/mv: removed redundant call to rename, and added
+ force, noclobber, and verbose options (Agathoklis D. Hatzimanikas).
+17. src/slsh/scripts/*: changed "static" to "private".
+18. src/sldisply.c: Underlined space characters were not appearing
+ with the underline.
+19. src/sldisply.c: Do not rely upon terminals that can
+ background-color-erase (BCE) to erase using the monochrome attributes (e.g.,
+ underline).
+20. src/slarith.c: Tweaked the %S format to better round decimals with
+ repeated 9s or 0s.
+21. autoconf/mkinsdir.sh: Updated to a newer version of
+ mkinstalldirs.
+22. src/slagetput.c: Change 2.2.2-10 fixed a problem with aget. The
+ same change needed to be made to aput to avoid an access violation.
+23. modules/pcre-module.c: Added support for binary strings (Paul
+ Boekholt).
+24. src/slposdir.c: Added utime function.
+25. slsh/scripts/mv: Added a missing call to stat_file (Agathoklis
+ Hatzimanikas).
+26. src/sldisply.c: Moved the keypad init/deinit code to separate
+ functions for more fine-grained control.
+27. slsh/rline/editor.sl: Added rline_call_editor and rline_edit_line functions
+28. src/slbstr.c: Added is_substrbytes function.
+29. doc/tm/rtl/strops.tm: The strncmp example used strcmp function
+ (Brian Murray).
+30. src/sltermin.c: Changed the search order for terminfo files to:
+ $TERMINFO, $HOME/.terminfo, /usr/local/{etc,share,lib}/terminfo,
+ /etc/terminfo, ...
+31. src/slparse.c: Change #6 triggered an invalid parse error for
+ statements involving foreach-using such as:
+
+ foreach x (y) using ("bar") (@foo)();
+
+32. src/slstrops.c: Added an alternative interface to strreplace that
+ facilitates the most common case where one wants to replace all
+ substrings. The function now supports
+
+ new = strreplace (a, b, c);
+
+ in addition to the older usage:
+
+ (new,m) = strreplace (a, b, c, n);
+
+33. src/sltoken.c,...: Added support for binary integer literals of
+ the form 0b010101. Integers may be formatted as unsigned binary using the
+ %B format specifier, e.g.,
+
+ sprintf ("%B", 5) ==> "101"
+	sprintf ("%#B", 5) ==> "0b101"
+	sprintf ("%#8B", 5) ==> " 0b101"
+	sprintf ("%#.8B", 5) ==> "0b00000101"
+	sprintf ("%#12.8B", 5) ==> " 0b00000101"
+
+34. src/slarith.c: ullong_to_binary was not getting defined on systems
+ where sizeof(long)==sizeof(long long). (Mark Olesen).
+35. src/slsh.c: The stat_mode_to_string function was using 'f' unstead
+ of 'p' for FIFOs. (Agathoklis Hatzimanikas).
+36. src/slarray.c: Switched to using mergesort instead of qsort and
+ added support for sorting non-array types. For details, see the
+ updated documentation for array_sort.
+37. src/slarray.c: Reduced the memory requirments for the mergesort
+ function, which produced a 5% speed improvement.
+38. src/slarray.c: Added support for qsort to array_sort. See the
+ updated documentation for details.
+39. src/slparse.c: Added a syntax enhancement to structs and
+ qualifiers to allow the fields of structure-valued expressions to
+ be used to define the structure. For example:
+
+ space = struct {x, y, z};
+ spacetime = struct {@space, t};
+
+ Here spacetime is a structure containing 4 fields: (x,y,z,t). In
+ this context, @ is not a dereference operator. Rather it is used
+ to tell the parser that the following expression is a structure
+ valued.
+40. src/slcommon.c: SLmalloc inherited malloc's undefined behavior
+ when 0 bytes were requested. The change will cause SLmalloc to
+ allocate at least 1 byte if the OS version of malloc returns NULL
+ for 0 byte sizes.
+41. src/slclass.c: The default dereference method for all scalar and
+ vector classes was changed from undefined to duplicate. That is,
+ @7 will produce 7 instead of triggering a method-undefined
+ exception.
+42. src/slwclut.c: Added \x\c\p\,\g character classes to strtrans (See
+ strtrans doc).
+43. src/*.c: Made numerous int->SLindex changes to match function
+ prototypes. Note that SLindex_Type is currently typedef'd to be
+ an int, but if that ever changes, these changes will be necessary.
+ I also added SLang_push_array_index to the public API. Also
+ updated copyright year since a number of files changed.
+44. src/slarrfun.c: change 43 would not compile on 64 bit systems.
+45. src/slnspace.c: the apropos function was not returning float,
+ short, long, and long long constants.
+46. src/slarith.c: If LLONG_MAX is not defined, and sizeof(long long)
+ is 64 bits, then use the standard value.
+47. src/slang.c: long long constants were not working.
+48. slsh/lib/process.sl: modesi was being set after i was bumped.
+ This caused modes0 to be NULL.
+49. slsh/lib/slshrl.sl: If the first word is callable, and is followed
+ by a ',', then add parenthesis, i.e., "print,7" ==> "print(7);".
+ Note: this is a commandline convenience feature and has nothing to
+ do with the slang syntax.
+50. slsh/lib/rline/complete.sl: Attempt to complete structure field
+ names.
+51. src/slrline.c,slsmg.c,sldisply.c: Added support for multiline
+ readline.
+52. configure,src/*.hin: Added autoconf support for size_t.
+53. src/slang.h,...: Added 'typedef unsigned in SLstrlen_Type' to
+ create migration path for size_t in place of unsigned int.
+54. src/slstrops.c: New intrinsics:
+
+ islower, isupper, isxdigit, isalnum, isalpha, iscntrl, isprint,
+ isgraph, ispunct, isblank, isspace, strskipchar, strbskipchar
+
+ The latter two functions play a role in the context of the
+ variable length UTF-8 encoding
+ encoding analogous to that of ch=*s++ and ch=*s-- in a fixed
+ encoding.
+55. slsh/lib/rline/editfuns.sl: Used functios in change #54 to implement
+ bskip_word and skip_word readline functions.
+56. src/slstrops.c: Added isascii, and updated docs.
+57. src/sldisply.c: _pSLtt_cmdline_mode_reset will also clear to the
+ end of the screen.
+58. mingw32 compilation problems: typo in src/slconfig.h;
+ src/slarrfun.c: missing '#ifdef HAVE_LONG_LONG'.
+59. src/slsmg.c: Change #51 introduced a bug that manifests itself
+ when expanding a tab at the right edge of the display.
+60. src/slarrfunc.c: If contracting an empty array over all dimensions
+ to produce a scalar, clear the transfer buffer.
+61. src/slarrfun.c: If a scalar is passed to array_reverse, then do
+ nothing.
+62. src/slarith.c: LONG_MIN/MAX values were placed in an integer
+ contant table instead of a long integer table.
+ SLadd_lconstant_table added to the interface.
+63. src/slsmg.c: Change 51 introduced a bug in SLsmg_write_chars when
+ SLsmg_Newline_Behavior != SLSMG_NEWLINE_IGNORED.
+64. autoconf/config.sub+config.guess updated.
+65. src/slstrops.c: If a delimiter is not passed to strjoin, assume
+ the empty string.
+66. modules/test/test_rand.sl: Some integer constants changed to
+ unsigned values.
+67. src/slstruct.c: tweak code to remove a false uninitialized
+ variable warning.
+68. src/slarray.c: fix NULL pointer deref from invalid binary
+ operation Array_TypeN+1:N.
+69. src/slang.c: '>' instead of '<' should have been used in in the
+ try/catch code when decrementing the frame pointer.
+70. src/slparse.c: Method qualifiers were getting lost when called
+ from the constructor, e.g., new_object(arg1;qual1).method(arg;qual2)
+71. src/sltoken.c: preprocessor statements #if, #ifeval, and #ifexists
+ will use the (non-anonymous) namespace of the file containing the
+ statements.
+72. src/slang.c: _pSLlocate_name return NULL instead of an exception
+ if the name contains a non-existent namespace.
+73. Removed excess whitespace from all files (*.c, *.h, *.tm, *.sl, ...).
+74. src/slang.c: define MAX_USER_BLOCKS to be 5, and use it instead of `5'.
+75. src/slsignal.c: Use (char*)NULL instead of NULL in call to execl
+ to avoid a compiler warning on OpenBSD.
+76. src/slproc.c: define _XOPEN_SOURCE_EXTENDED to be 1 instead of
+ just defining it. This pulls in some prototypes on OpenBSD.
+77. src/slmath.c: The hypot intrinsic was modified to work with N
+ arrays instead of just 2. (Manfred Hanke)
+78. src/slarith.inc: Use doubles for intermediate calculations when
+ double is the expected result. This avoids some integer overflows 
+ (Matthias Kühnel, Michael Wille, Manfred Hanke).
+79. src/slparse.c,slang.c: Added FOREACH_EARGS byte-code that will
+ implicitly call the __eargs function. This avoids a problem with
+ the standard FOREACH bytecode if a hook gets called after __eargs
+ but before the FOREACH byte-code executes.
+80. src/slstrops.c: The pos argument to the string_match and
+ string_matches function was made optional (defaults to 1).
+81. src/slstring.c: Use _pSLuint32_Type instead of unsigned long for
+ hashes since the hash algorithm was designed for 32 bits.
+82. src/slstd.c: Save the pointer passed to putenv to a global array
+ so that leak checkers can find it. The reason for this is that
+ some libc implementations copy the pointer but others do not.
+83. src/slang.c: An off-by-one error was causing a stackunderflow
+ error when handling a exception list in a try-catch statement.
+84. slsh/lib/arrayfuns.sl: Add support for empty arrays to the shift
+ function (Manfred Hanke).
+85. */examples/*.sl: Various updates and corrections (Manfred Hanke).
+86. src/sllist.c: A extra call to SLang_free_mmt was causing a list to
+ be freed when set via an index array.
+87. src/slstrops.c: Vectorized strlow/strup intrinsics.
+88. src/slmath.c: Add support for more than 2 arguments to the
+ _min/_max functions (Manfred Hanke).
+89. src/sllist.c: Added list_join, list_concat intrinsics (Mike Noble).
+90. slsh/lib/setfuns.sl: adds unique, intersection, complement, union
+91. modules/csv.sl: Added a module to support the reading and writing
+ of comma separated values (csv) formatted files.
+92. Some documentation corrections (Manfred Hanke).
+93. src/slmath.c: In the hypot function, use the convenience function
+ do_binary_function_on_nargs instead of an explicit loop. (Manfred
+ Hanke).
+94. modules/tm/slsmg.tm: Manfred Hanke has started documenting the
+ slsmg module. He also provided a new example (slsmgex2.sl).
+95. src/slnspace.c,slang.c: Free up some memory associated with
+ namespaces upon exit.
+96. src/slposio.c: added ttyname intrinsic
+97. autoconf/slang.pc: Use @libdir@ instead of assuming $prefix/lib.
+98. modules/csv.sl: The read_cols method allows the type qualifier to
+ be a string of type specifiers, e.g., types="liff". This is
+ equivalent to types='l', 'i', 'f', 'f'.
+99. src/sltime.c: Added timegm, which is the inverse of gmtime. I
+ also made changes to the time functions so that time_t is not
+ assumed to be a long. This means that _time may produce a
+ longlong integer on some platforms.
+100. modules/cmaps/coolwarm.map: A color map by Kenneth Moreland.
+101. modules/png-module.c: Use png_set_expand_gray_1_2_4_to_8 instead
+ of png_set_gray_1_2_4_to_8 if available (patch forwarded from Marco
+ Atzeri).
+102. src/slcommon.c: Code using __libc_enable_secure was removed
+ (patch forwarded from Marco Atzeri)
+103. src/sldisply.c: Added some termcap compatibility functions that
+ were ifdefed out in v2.2.2 but were made available by some linux
+ distributions for code to use: SLtt_tgetent, SLtt_tgoto,
+ SLtt_tputs (patch forwarded by Marco Atzeri).
+104. autoconf/aclocal.m4,configure.ac: Various updates by Marco Atzeri
+ including a cygwin specific change.
+105. autoconf/aclocal.m4: Missing hyphen for ELFLIB_MAJOR on cygin
+ (Marco Atzeri).
+106. slsh/lib/doc/tm/setfuns.tm: Add newlines to the note1 macro
+ (Manfred Hanke).
+107. src/slang.c: change #5 caused a problem evaluating the bytecode
+ produced by preparsed files (.slc) produced by slang v2.2.2.
+108. modules/tm/csvfuns.tm: Documentation updates
+109. src/sldisply.c: slsh would exit if the underlying terminal was
+ unknown because _pSLtt_init_cmdline_mode was returning a fatal
+ error.
+110. configure, *Makefile.in,etc: Made changes so that ARCH
+ environment variable influences where the .o files are placed.
+ The INSTALL.unx file documented this feature but the slsh and
+ modules Makefiles did not implement this.
+111. */mkfiles/makefile.all: Added WFLAGS to mingw sections to allow
+ the warning flags to be specified independently of the CFLAGS.
+112. src/slang.c,_slang.h: Changed `#if HAVE_LONG_LONG' to `#ifdef
+ HAVE_LONG_LONG' in a few places.
+113. src/slstrops.c: A number of string functions have been vectorized
+ to work on arrays of strings. These include:
+
+ is_substr str_delete_chars strbytelen strcharlen strcmp
+	strcompress strlen strlow strnbytecmp strncharcmp strncmp
+	strtrans strtrim strtrim_beg strtrim_end strup
+
+114. modules/Makefile.in: Change #110 introduced a bug
+ that caused the modules to always be need rebuilding.
+115. src/sltoken.c: Change #if HAVE_LONG_LONG to #ifdef HAVE_LONG_LONG.
+116. src/slmath.c: Tweaked the Kahan sum for the hypot function.
+117. slsh/readline.c: Added __rline_init/reset_tty functions and used
+ them in the rline editor routines to reset the terminal before
+ calling an external editor. This avoids problems when the editor
+ is subsequently suspended.
+118. modules/csv.sl: Typo causing a bug involving the mapping of string valued
+ column-specifiers to column numbers by csv.readcol. (Paul Boekholt)
+119. doc/tm/rtl/strops.tm: Typo in sprintf documentation (Andreas
+ Irrgang).
+120. src/sltime.c,slposio.c: Avoid certain posix *_r functions if
+ _POSIX_C_SOURCE is too old.
+
+Changes since 2.2.1
+1. src/slsmg.c: Call SLutf8_enable if UTF8 mode has not been setup.
+2. src/slutty.c: Allow the hook that gets called when the read
+ function gets interrupted to change the read file descriptor.
+ Before, if this happened, the SLang_getkey function would return
+ SLANG_GETKEY_ERROR.
+3. lib/slsh/print.sl: Turn off buffering of the pager pipe.
+4. modules/tm/*.tm: A couple of typos corrected (John Houck)
+5. src/slmath.c: The round function was not correctly rounding values
+ between 0.5 and 1.0.
+6. src/slstdio.c,slclass.c: If a call to fwrite produces errno=EPIPE,
+ then do not bother trying the write again.
+7. modules/fork-module.c: Use WIFCONTINUED only if it is defined.
+8. slsh/Makefile.in: Change the order of the libraries such that the
+ newly built ones will be found first. (Markus Hennecke)
+9. src/slagetput.inc: Avoid possible access violation when using a
+ range array as an index.
+10. doc/tm/rtl/lists.tm: Documented the optional argument to the
+ list_to_array function (Manfred Hanke).
+
+Changes since 2.2.0
+1. modules/socket-module.c: glibc-2.8 removed the h_addr macro.
+2. src/slclass.c: Call clearerr before performing the
+ stdio_fread/fwrite functions.
+3. src/slstdio.c: typeof in the fputs intrinsic fixed (n instead of dn
+ was compared to 0).
+4. src/slscanf.c: sscanf will treat NaN and Inf in a case-insensitive
+ manner. Also, the NaN(a-zA-Z0-9*) form is also supported.
+5. src/slang.h: SLclass_set_aelem_init_function was missing from the
+ API.
+6. src/slmath.c: The expm1 and log1p functions were returning NaN when
+ given Inf arguments.
+7. src/slmath,c: log1p(-1) produced nan instead of -inf.
+8. configure: Added pkg-config support (based upon a debian patch sent
+ to me by Luca Bigliardi).
+9. doc/tm/rtl/math.tm: Updated the help for set_float_format and added
+ documentation for the get_float_format function.
+10. autoconf/slangpc.in: Added URL and Libs.private entries to the
+ slang.pc pkg-config file.
+11. src/slang.h: prototype for SLang_create_array1 missing from slang.h.
+12. src/slcurses.c: Added debian patch that adds support for
+ additional graphics characters (DIAMOND, DEGREE, etc...).
+13. doc/tm/slang.tm: Added a small section about arrays of arrays.
+14. src/slang.c: __builtin_expect is used for the stack functions if
+ compiled with gcc.
+15. src/*.c: A few public variables were not explicitly initialized
+ to 0. Apparantly not doing so causes them not be be exported from
+ the windows DLL.
+
+Changes since 2.1.4
+1. modules/termios-module.c: Added the VMIN constant (Laurent Perez).
+2. src/slbstr.c: Added foreach method to BString_Type objects.
+3. module/zlib-module.c: New module that wraps libz
+ (compression/decompression library).
+4. doc/tm/rtl/: Some documentation updates
+5. configure: Added messages about what extra modules will and will
+ not be built.
+6. modules/mkfiles/makefile.all: Added zlib module to the makefile.
+7. autoconf/configure.ac: Fixed the spelling oniguruma (Peter J. Ross)
+8. src/slang.c,slparse.c,sltoken.c: Added 'break n' and 'continue n'
+ statements.
+9. src/slang.c: break-n and continue-n were not being properly handled
+ when used outside a function.
+10. src/slparse.c, sltoken.c: Added the C-like ternary-expression
+ "condition ? foo : bar".
+11. src/sltoken.c: Added support for mult-line strings:
+
+ "This is a \
+	 multiline \
+	 string".
+
+ `This is another
+	 multiline
+	 string.`
+
+ Note that the backquoted does not require a backslash at the end
+ of lines.
+12. src/sltoken.c: When reading subsequent lines of a multiline
+ string, increment the readline parse_level.
+13. src/sltoken.c: When performing backslash expansion, if a solitary
+ backslash occurs at the end of a line, or is preceeded by a
+ newline at the end of a line, then ignore it.
+14. src/slexcept.c: The use of an ERROR_BLOCK was causing the pointer
+ holding the name of the function with the error to be freed twice.
+15. slsh/lib/rline/*keys.sl: Bind "\n" to the readline "enter" function.
+16. src/sltoken.c: Improved and simplified the way operators are
+ mapped to tokens.
+17. slsh/lib/sldbcore.sl: sldb was printing all the elements of a
+ container object when using the "p" command.
+18. src/slarrfun.c: Added a "sumsq" function, which sums over the
+ squares of the elements of an array.
+19. src/slsignal.c: Added SLsystem_intr, which unlike SLsystem does
+ not ignore SIGINT by the calling process. This function is
+ available to the interpreter via system_intr.
+20. doc/tm/rtl/debug.tm: Documentation for the call stack frames added
+ (Jörg Sommer).
+21. src/slarrfun.c: array_reverse was producing an index-error when
+ passed an empty array.
+22. src/slcurses.c: SLcurses_initscr calls SLutf8_enable (Michal
+ Ratajsky).
+23. src/slang.c, slparse.c: "then" clauses were not being executed for
+ top-level looping statements (statements occuring outside function
+ definitions).
+24. src/slang.c: Change #23 was causing byte-compiled (.slc) files
+ from previous versions of jed to be misinterpreted.
+25. modules/zlib-module.c: The error message associated with
+ ZLIB_DATA_ERROR was incorrect (Paul Boekholt).
+26. src/slarray.c: Fixed a bug involving due to an overzealous __tmp
+ optimization involving binary operations between arrays of arrays.
+ Fortunately the bug manifests itself in a useless context.
+27. src/slstring.c: Improved performance of SLang_concat_slstrings
+ function. (Paul Boekholt)
+29. src/slang.c: When adding two strings together, make a direct call
+ to SLang_concat_slstrings avoiding some function call overhead.
+30. src/slmath.c: Added expm1 and log1p functions.
+31. src/slmath.c: If hypot is passed a single array X, then it will
+ compute sqrt(sumsq(X)), which is useful for computing the norm of
+ a vector represented by X.
+32. src/slarith.c: Changed the default floating point format to %S,
+ which means that the floating point number will be formatted in a
+ slang specific way to preserve the precision of the number such
+ that x == atof (string(x)).
+33. src/slarray.c: Passing an object to size_t to SLmalloc was
+ resulting in a SEGV on 64 bit systems.
+34. src/slbstring.c,slang.c: Small modifications to generalize the __tmp
+ optimization to binary-strings.
+35. src/slstrops.c: Changed strcpy to memcpy where permissible (Paul
+ Boekholt).
+36. src/slarray.c: __tmp optimization of binary optimization was not
+ obeying the READONLY flag.
+37. src/slang.c: __tmp optimization for struct.field OP= value.
+38. src/slarith.c: For floating point types, the %S format specified
+ will always print the decimal point or exponent.
+39. src/slmisc.c, sltoken.c: Added parser checks for overflows of
+ literal integer constants.
+40. src/slarith.c: Change #38 resulted in decimal points in inf and nan.
+41. src/slarithlc: By default, a floating point number x, where
+ |x|>=1e6 is printed in exponential form.
+42. src/slparse.c: Added looping context checks for break and continue
+ statements.
+43. src/slang.c: Small tweak to inner_interp to improve
+ branch-prediction (Paul Boekholt)
+44. src/slang.c: Optimized additional byte-code combinations.
+45. src/sldisply.c: On TERMCAP based systems, the "ac" capability was
+ being returned as the address of a local variable (Szalai Andras).
+46. src/slrline.c: The SLrline_redraw function was not properly
+ setting the last_nonblank_column variable.
+47. src/slstd.c: SLang_Doc_Dir was implicitly defined to be an int
+ when SLANG_DOC_DIR is defined. (Jon Parise)
+48. src/mkfiles/makefile.all, src/slconfig.h: Visual Studio tweaks
+ (Jon Parise).
+49. modules/module.c: Added sockerpair to the module.
+50. src/slang.c: The string representation of a Ref_Type will show the
+ namespace prefix, e.g, "&ns->foo". Also the __get_reference
+ function was modified to ignore a leading '&'.
+51. src/slposio.c: Added dup2_fd intrinsic (a wrapper around dup2).
+52. modules/fork-module.c: New module (fork, waitpid, exec*, ...)
+53. src/slagetput.inc: ai=b was sometimes resulting in a buffer
+ overflow when i had elements outside the range of a.
+54. modules/select-module.c: A small memory leak was corrected.
+55. doc/*.tm: Some documentation updates.
+56. src/slposio.c: Allow a file descriptor to be fdopen'd multiple times.
+57. src/slstdio.c, src/slclass.c: Restart the fread/fwrite calls
+ calls when interrupted by a signal.
+58. src/slcommon.c: SLang_handle_interrupt will preserve errno.
+59. src/mkfiles/makefile.all: Updated for newer versions of Visual C
+ (Jon Parise).
+60. src/slang.c: set_array_lvalue was not preserving
+ SLang_Num_Function_Args.
+61. src/slang.c,sig.c: Continual bombarding the interpreter with
+ signals revealed a subtle race condition in the interpreter's
+ implementation of signals.
+62. src/sllist.c: Added list_to_array intrinsic function:
+ array = list_to_array (list ,type)
+63. .../makefile.all,slsh/slsh.c: Additional Visual C updates. Also, io.h is
+ needed to compile slsh Visual C. (Jon Parise)
+64. src/slproc.c: added killpg intrinsic
+65. modules/sysconf.c: Wrappers around the sysconf, pathconf, and
+ confstr posix function.s
+66. modules/fork-module.c: Added the pipe intrinsic.
+67. src/slexcept.c: Added traceback info to the exception object.
+68. src/slposio.c: Added a _close intrinsic, which takes an integer
+ file descriptor instead of the corresponding slang object. A
+ _fileno intrinsic was also added that returns the integer
+ descriptor. A bug in the dup2 intrinsic added in change 51 was
+ fixed.
+69. src/slstruct.c: Added aget/aput methods for user-defined types.
+70. src/slang.c: handle_signals was made reentrant.
+71. modules/fcntl-module.c: Accept an int as a file descriptor.
+72. src/slposio.c: @FD_Type(int) may be used to convert an int into
+ the corresponding FD_Type object.
+73. modules/sysconf-module.c: Added #ifdefs for HAVE_SYSCONF, etc.
+74. modules/zlib-module.c: Added #ifdefs for the ZLIB constants
+75. src/slstdio.c: Rewrote fputs intrinsic in terms of fwrite to
+ better deal with EINTR. Also, fopen, fclose and fflush are
+ restarted upon EINTR.
+76. src/slstring.c: Avoid a problem where the first n bytes of a
+ string hashes to the same location as the full string.
+77. src/slparse.c: Reworked the integer-overflow code.
+78. src/*.h: Updated Unicode tables to v5.1.
+79. src/slwclut.c: Added \7 to indicate a 7 bit character class.
+80. slsh/lib/readascii.sl: The readascii function defaults to using
+ double precision instead of single.
+81. src/sllist.c: Change the chunk size and how it is allocated to be
+ more cache friendly.
+82. src/slstrops.c: Added string_matches, which combines the
+ operations of string_match and string_match_nth.
+83. modules/fork-module.c: Restart waitpid if EINTR received.
+84. slsh/lib/process.sl: A new process module for creation of child
+ processes, pipelines, etc.
+85. slsh/lib/process.sl: If no qualifiers were passed, list_to_array
+ was failing on an empty list.
+86. src/sllist.c: improved indexing performance.
+87. src/slproc.c: Added getsid
+88. modules/onig-module.c: Added BString_Type support to onig_search
+ (Paul Boekholt).
+89. src/slmath.c: The calling syntax of the polynom function was
+ simplified and extended to support arrays. As such, this function
+ is not backwards compatible.
+90. src/slang.c: Added optimizations for the power operation a^b.
+91. src/slstruct.c; Added an struct-specific acopy function instead of
+ using the default.
+92. src/slarray.c: streamlined the case of getting a single array
+ element of non-scalar types.
+93. src/slang.c: Additional optimizations involving binary expressions.
+94. src/slparse.c: Avoid an explicit chs bytecode for negative
+ floating point literals.
+95. src/slang.c: optimization tweak for expressions involving
+ scalar assignments to an array element.
+96. src/slang.c: change #93 introduced a small leak.
+97. src/slang.c: optimization tweak involving pushing the value of a
+ structure field.
+98. src/slstdio.c: If fread/fwrite returns a short, non-zero item count,
+ clear the error and try again.
+99. src/slstdio.c: If fflush appears to succeed, check ferror and if
+ errno==EINTR, try it again.
+100. src/slproc.c: Added get/setpriority functions.
+101. src/slstdio.c: Added setvbuf
+102. src/slproc.c: Added the "static" to the get/setpriority wrappers.
+103. doc/tm/: Updated docs and reprocessed with an upgraded version of
+ linuxdoc. Unfortunately, a table of contents for the text files
+ is nolonger generated by linuxdoc.
+104. src/slang.c: Added inline support for the bit-wise binary
+ operators.
+105. src/slang.c: Optimized pushing arbitrary single 1d array elements.
+106. src/slang.c: Optimization tweak for assigmnents to structure
+ fields.
+107. src/slang.c: Reordered some of the code in the inner_interp
+ switch statement and optimized some of the code that deals with
+ assignments to global variables. The latter change improves the
+ performance of the profiler a bit.
+108. src/slang.c: If an intrinsic takes no arguments and returns
+ nothing, then call it directly from inner_interp.
+109. src/sltype.c: Added __datatype intrinsic, which is the opposite
+ of the __class_id function.
+110. src/slang.c: set_struct_obj_lvalue was not always incrementing a
+ reference count on non-struct objects with struct semantics.
+111. src/slarith.c: On a system where sizeof(long)==sizeof(long long),
+ omit the long-long specific functions.
+112. modules/pcre.sl: Added pcre_matches function that combines the
+ other pcre functions into a simple to use form.
+113. src/sltoken.c,slparse.c: Overflow check was failing on 64 bit
+ systems.
+114. src/sltoken.c: If the default read method encounters a too long line,
+ then issue an error instead of passing it back up for the parser
+ to handle.
+115. src/sltoken.c: preparsed files were being mishandled by #114.
+116. src/sllist.c: Added array indexing support to list objects.
+117. src/slarrfun.inc: Tweaked the implmentation of Kahan sums.
+118. src/slmath.c: An optional argument may be provided to the polynom
+ function to indicate that the kth term should be divided by k!.
+119. src/slmath.c: Added frexp and ldexp intrinsic functions.
+120. src/slmath.c: #119 introduced a typo that was preventing
+ compilation on systems that lack frexpf.
+121. src/slarray.c: When indexing a scalar as an array, allow the use
+ of multiple indices, e.g., x=2; y=x0; z=x0,0; w=x0,0,0;
+122. slsh/lib/readascii.sl: When reading the first column as a string, comments
+ were not getting ignored.
+123. slsh/lib/rline/emacskeys.sl: The IBMPC_SYSTEM preprocessor macro
+ was used but not defined causing readline to fail on windows.
+124. Updated copyrights on files for upcoming release.
+125. doc/tm/slang.tm: Add documentation for the looping-then clause,
+ and various other documentation tweaks.
+126. src/slconfig.h: non-Unix systems: Remove defines for mode_t etc.
+ Define HAVE_POPEN for MINGW32.
+127. slsh/lib/print.sl: Do not attempt to call popen unless it
+ actually exists.
+
+Changes since 2.1.3
+1. src/slang.c: The identifier syntax was not being checked for
+ symbols added to the global namespace.
+2. slsh/slsh.c: If ENV_SLSH_PATH is undefined, set it to SLSH_PATH
+3. */mkfiles/*: Modified the various makefile.all files to facilitate
+ mingw32 builds. Read INSTALL.pc for quick-start.
+4. mkfiles/install.sl: Added a function to install the slang docs
+5. src/slvideo.c: #define UNICODE so that wide-character functions are
+ used instead of byte functions. Also codepage set to 65001 in
+ unicode mode.
+6. src/slvideo.c: Added SLtt_is_utf8_mode.
+7. src/sltermin.c: Added support for new ncurses hex-encoded terminfo
+ directories.
+8. slsh/lib/tm/cmdopt.tm: Missing commas in the documentation for
+ cmdopt_add. (Doug Burke).
+9. src/slarrmisc.inc: Changed inner-product code to use block arrays
+ to be more cache friendly. Since the block size is cpu-dependent,
+ __get/set_innerprod_block_size functions have been added. The
+ default value is controlled by a variable in src/sllimits.h.
+10. modules/termios-module.c: Added additional termios constants
+ (Laurent Perez).
+11. src/slarray.c: Better optimization when indexing arrays with
+ ranges.
+12. src/slsignal.c: If SLsystem fails, set the interpreter's errno
+ value accordingly.
+13. modules/rand-module.c: A uniform random number generator module,
+ which also provides generators for some well-known distributions.
+14. src/*.c: Changed field name for SLang_Object_Type.data_type to
+ o_data_type.
+15. src/slang.c: Optimization tweaks to improved performance for small
+ arrays and indexing via scalar indices.
+16. doc/tm/rtl/stack.tm: Typos in the example for __pop_list corrected
+ (Doug Burke).
+17. src/slang.c: Improved optimizations for scalar arithmetic
+ operations.
+18. src/slarray.c: slices such as A*,0:-1,* of multi-dimensional
+ arrays were producing single dimension ones.
+19. src/sltoken.c: Changed the semantics of the
+ SLang_set_verbose_loading function. Previously this function
+ accepted a zero or non-zero value to disable or enable loading
+ messages for .sl files. Now this integer value is a bitmapped
+ one: If bit 0 is set, loading messages will be generated for .sl
+ files. If bit 1 is set, messages will be generated for
+ dynamically loaded modules.
+20. slsh/slsh.c: Calling slsh with -v will generate loading messages
+ for both modules and slang files. I also created a new
+ slsh-specific intrinsic called set_verbose_loading and bumped the
+ slsh version number.
+21. modules/cmaps: Added "ds9b" and "ds9sls" colormaps --- these correspond
+ to analogous colormaps in saotng ds9.
+22. utf8/tools/mktables: Characters with general category "Mc" or in
+ the bi-directional category are nolonger flagged as combining characters.
+23. utf8/tools/: Updated unicode database from 3.2 to 5.0 and
+ recreated the internal character set tables.
+24. src/slsmg.c: If an ambiguous-width unicode line drawing character
+ is double width, then use a single-width alternative (Sugiyama).
+25. src/slsignal.c: Call SLang_handle_interrupt when system calls are
+ interrupted.
+26. src/slarray.c: Speed improvements when transferring elements from
+ one array to another via range indices, e.g., a = b1:9;
+27. src/slarrfun.c: transpose of multi-dim non-scalar arrays was using
+ unitialized memory.
+28. src/slarray.c: Improved speed of binary arithmetic of range arrays.
+29. src/slstd.c: atoi, atof, atol, atoll, and integer now accept an array
+ arguments.
+30. demo/pager.c: args swapped in call to memset (Dave Jones
+ davej at redhat)
+31. src/slstring.c: Move last used string in the hash table to the top
+ if it is more than a few deep.
+32. slsh/doc/tm/slsh.1: Added a small section to the slsh man page
+ about customizing the readline environment.
+33. slsh/etc/slsh.rc: changed dir_exists from static to private
+34. src/slposio.c: The low level read/write functions should not be
+ restarted when errno is EAGAIN.
+35. src/sltoken.c: When run in verbose mode, SLns_load_file will
+ display the name of the namespace the file is being loaded into when
+ the namespace is not the Global one.
+36. slsh/lib/require.sl: If the "feature" is a filename, then
+ automatically "provide" that feature.
+37. slsh/lib/tm/require.tm: Fixed the typos for the require function.
+38. src/slstrops.c: Until `|' is supported in REs, glob_to_regexp
+ cannot be made to produce a single RE that does not match leading
+ dots. Hence, the glob expression "*X" will match ".X".
+39. slsh/lib/glob.sl: Changed to compensate for modification to
+ glob_to_regexp. That is, glob("*X") will not match the file ".X",
+ which preserves the bahavior of the glob function.
+40. src/slcommon.c: On win32 systems, if the codepage is 65001, then
+ use UTF-8 mode (Thomas Wiegner).
+41. src/slarray.c: Trivial change to avoid a warning in gcc
+ about the possible use of an uninitialized variable.
+42. slsh/slsh.c: Added -q, --quiet command line option to inhibit the
+ printing of the startup messages.
+43. slsh/lib/print.sl: Added pager=val and nopager qualifiers to the
+ print function. Also if printing a single structure, each field
+ will appear on a separate line.
+44. src/slstrops.c, src/slbstr.c: Added count_char/byte_occurances
+ function to count the number of occurances of a specific character
+ or byte in a string.
+45. src/slparse.c: &if was causing a SEGV.
+46. src/slstd.c: Added get_float_format intrinsic.
+47. doc/tm/Makefile: Added rules to make cref.pdf
+48. slsh/lib/print.sl: Updated the usage message for the print function.
+49. src/slang.h: Added __attribute_(format(printf)) to SLsnprintf
+ prototype.
+50. src/*.c: Function prototypes were changed from, e.g.,
+ char *SLang_create_slstring (char *);
+ to
+ char *SLang_create_slstring (SLFUTURE_CONST char *);
+ where SLFUTURE_CONST is defined to have no value. As a result,
+ these changes has no effect at present but will in a future
+ version (slang-3) where SLFUTURE_CONST will be defined to be
+ `const'. The use of `const' now would constitute a major API change,
+ which is not permitted until a new major version is released.
+51. src/slmisc.c: SLFUTURE_CONST added to SLextract_list_element
+ prototype.
+52. src/slang.h: Added SLFUTURE_CONST to arg_type field of
+ SLcmd_Cmd_Type object.
+53. src/slarith.c: The return value of fmod was being truncated to
+ single precision.
+54. doc/tm/cslang.tm: COLORTERM was used instead of COLORFGBG (Nathan
+ Stratton Treadway).
+55. configure,*/Makefile.in: Haiku systems do not require -lm. -lm
+ was replaced */Makefile.in by @M_LIB@ which is not set from the
+ configure script. (Scott McCreary)
+56. src/slutty.c,src/slidsply.c: More Haiku-specific patches from
+ Scott McCreary.
+57. mkfiles/makefile.m32: Made changes to work with recent versions of
+ mingw32 and added a silly hack to work-around CMD.EXE
+ interpretation of '=' as whitespace on the command line.
+58. doc/tm/rtl/rline.tm: New file containing documentation for
+ intrinsic functions dealing with the slang readline interface.
+59. slsh/lib/print.sl: If a string is passed as a file descriptor to
+ the print function, then regard the string as a filename.
+60. src/Makefile.in: Added _slang.h and sllimits.h as a global
+ dependency.
+61. slsh/lib/tm/print.tm: Documented the slsh print function.
+62. slsh/lib/print.sl: Rewrote and simplified the code that prints to
+ the various output "devices" by using a device-object.
+63. autoconf/Makefile.in: Added src/Makefile.in as a dependency.
+
+Changes since 2.1.2
+1. autoconf/Makefile.in: If any */Makefile.in is more recent than the
+ corresponding Makefile, request that the configure script be rerun.
+2. src/slcmplex.c: If the complex number z is 0, then return 1 for z^0.
+3. src/slerr.c: SLang_set_error: If the error code is
+ SL_UserBreak_Error, then do not add a string representation to the
+ queue in case this function was called from a signal handler. This
+ avoids a call to malloc, which is generally a bad idea on systems
+ where malloc is not reentrant.
+4. slsh/lib/sldbcore.sl: The "c" alias was not working. (John Houck)
+5. src/slsmg.c: Avoid a possible segv if SLsmg_Scroll_Hash_Border is
+ greater than the display size. (Miroslav Lichvar).
+6. src/slang.c: Line number information was not always getting
+ propagated in slang code involving function dereferences, e.g.,
+ (@funcptr)(args). The bug-fix checks to see that funcptr is
+ callable.
+7. src/slparse.c: Generate bos/eos byte-code for empty code blocks,
+ e.g., while (1){}.
+8. lib/sldbcore.sl: When exiting the debugger via the "exit" command,
+ the old SIGINT handler was not getting installed.
+9. src/slang.c: Make sure check_signals gets called when returning
+ from inner_interp.
+10. src/slsig.c: If a slang script establishes a signal handler for
+ SIGINT, then set SLKeyBoard_Quit to 1 if SIGINT is received.
+11. src/slstruct.c: New intrinsic:__add_typecast. This may be used to
+ define a typecast function for a user-defined type.
+12. autoconf/aclocal.m4: Added support for ncurses5-config to query
+ the terminfo path (Wenchieh Yen).
+13. src/slang.h: If __APPLE__ is defined, then also define __unix__.
+14. src/slmath.c: Avoid a NULL pointer dereference when feqs(a,b) is
+ called with mixed scalar and array arguments.
+15. src/slsmg,c: Avoid writing a double-wide character to the last
+ column of the display.
+16. src/sltermin.c: Search the autoconf-derived terminfo dirs before
+ the hard-coded paths (Wenchieh Yen).
+17. doc/tm/rtl/math.tm: feqs documentation updated to reflect a
+ default relative difference of 0.01.
+18. doc/tm/rtl/eval.tm: In one example, get_path_delimiter is
+ incorrectly used (Frank Primini).
+19. src/slstrops.c: Memory corruption was occuring when using a number
+ greater than 10^256 in a "%f" format statement.
+20. src/slstrops.c: Small tweak in the way #19 was implemented.
+21. modules/socket-module.c: If INADDR_NONE is defined, use it to test
+ the return value of inet_addr.
+22. src/slang.c: SLang_start_arg_list made a wrapper around
+ start_arg_list.
+
+Changes since 2.1.1
+1. slsh/lib/readascii.sl: Typo in the usage message corrected.
+2. autoconf/aclocal.m4: Fixed elf link problem on freebsd (Renato
+ Botelho)
+3. doc/tm/slang.tm: Some documentation updates
+4. slsh/lib/cmdopt.sl: The value passed to a callback function was not
+ be converted to the specified type, e.g., for
+ cmdopt_add (opt, "foo", &callback; type="int");
+ callback was not being passed an integer.
+5. src/slang.c,slassoc.c: Optimization tweaks for inc/decrementing
+ associative arrays (e.g., foo"bar"++).
+6. src/slerr.c: When SLang_set_error is called, then add the string
+ representation of the error message to the message queue.
+7. doc/tm/strops.tm: Corrected the documentation for the string_match
+ function. (Guenter Milde)
+8. src/sllimits.h: Increased the size of the hash table that stores
+ SLstrings for better efficiency.
+9. src/slstrops.c:_pSLang_push_nstring: Inlined the call to
+ _pSLang_push_slstring.
+10. slsh/lib/structfuns.sl: Ignore any NULL arguments.
+11. slsh/src/readline.c: Turned on output processing in the call to
+ SLang_init_tty.
+12. src/slang.h: Several functions were marked as "extern" and not as
+ SL_EXTERN. This makes a difference for CYGWIN and WIN32.
+13. src/Makefile.in, autoconf/*: Better support for the creation of
+ cygwin DLLs.
+14. src/slang.h: Under windows+cygwin, if SLANG_DLL is not defined,
+ the it will get defined as 1. This means that by default, the
+ application will get compiled against the slang DLL. To build
+ against a static version of the library. compile your code using
+ -DSLANG_DLL=0.
+15. Backed out the previous change (#14) to avoid breaking third-party
+ code that compiles against the library.
+16. Makefile: `make` will only build the shared version of the
+ library. Use `make static` to create the static version.
+17. src/slcmplex.c; Division by zero errors are no longer trapped.
+ This has been the default behavior for reals; this change
+ applies to complex numbers.
+18. */*/*.tm: Documentation updates
+19. src/slrline.c: When completing a quoted string, the final quote
+ character will automatically get added (instead of a space as
+ before).
+20. src/slrline.c: SLang_peek_at_stack+SLang_pop_int recoded as
+ wrappers around inlined versions.
+21. src/Makefile.in: Avoid creating a symlink if the target is the
+ same as the link (affects cygwin).
+22. src/slsh.c: If exit is called without arguments, interpret that as
+ exit(0).
+23. src/slsh.c: Prior to entering interactive mode, turn tracebacks
+ off.
+24. src/Makfile.in: LDFLAGS was not getting used.
+25. doc/tm/: Some typos corrected (Jörg Sommer)
+26. slsh/Makefile.in: slsh/doc/html/*.html gets installed in
+ $prefix/share/doc/slsh/.
+
+Changes since 2.1.0
+1. slsh/lib/print.sl: Only the first element of arrays such as
+ Float_Type1,1,1,10 were getting printed.
+2. src/slscanf.c: strings containing only whitespace were not parsed
+ properly by _pSLang_sscanf when %s was used in the format.
+3. slsh/lib/readascii.sl: A flexible ascii data file reader.
+4. src/slang.ver: Updated the linker version script
+ (mlichvar at redhat, com).
+5. src/slang.ver: The wildcard for the SLANG2 symbols was picking up
+ the SLANG2.1.0 symbols. (mlichvar at redhat, com).
+6. slsh/lib/readascii.sl: Added type and cols qualifiers. Updated docs.
+7. src/slang.c: If auto_declare is non-zero, and a reference to an
+ undefined variable is made, that variable will be automatically
+ created and given static scope.
+8. slsh/lib/autoload.sl: readascii added.
+9. src/slrline.c: The redraw function was ignoring the application
+ installed update hook, disrupting the display when a redraw was
+ requested.
+10. autoconf/configure.ac: -liconv was not getting added when creating
+ the iconv module on systems with a standalone iconv library.
+11. slsh/lib/readascii.sl: Added "as_list" qualifier to return values in
+ lists rather than arrays.
+12. src/slscanf.c: Added inf/nan support to sscanf.
+13. src/slboseos.c: Before calling the hooks, push the error context
+ so that they will work in the presence of errors.
+14. lib/slsh/tm/profile.tm: Documented the profile_* functions.
+15. doc/tm/slang.tm: Added documentation about qualifiers.
+16. src/slarray.c,modules/*.c: Use SLindex_Type instead of int for
+ indexing arrays. Currently SLindex_Type is typedefd as an int.
+17. src/slang.c: Added SLang_pop_array_index to the API. Applications
+ should use this function instead of SLang_pop_int for getting
+ array indices. This new symbol is versioned at 2.1.1.
+18. src/slstruct.c: SLang_pop_cstruct will now force SLang_Array_Type
+ objects to linear ones.
+19. ./NEWS: Updated
+20. slsh/lib/test_readascii.sl: Changed the "list" qualifier to
+ "as_list".
+
+Changes since 2.0.7
+1. src/slrline.c: SLrline_bol/eol functions were missing from the
+ interface.
+2. src/slarray.c: An optional reference argument may be passed to the
+ where function to get the complement indices. That is:
+
+ i = where (foo, &j);
+
+ is equivalent to
+
+ i = where (foo);
+ j = where (not foo);
+
+3. src/slexcept.c: SLerr_throw added to allow applications to mimic
+ the semantics of "throw".
+4. src/slparse.c,slang.c: New short-circuit operators || and &&. Use
+ of the "orelse" and "andelse" constructs has been deprecated.
+5. src/slsmg.c: SLsmg_write_wrapped_string and SLsmg_write_nstring
+ were broken for double-width characters. Updated demo/smgtest.c to
+ test these functions in the presence of such characters.
+6. demo/smgtest.sl: Embedded some control characters in the
+ double-wide character string for testing the handling of them.
+7. doc/tm/cslang.tm: Updated some of the documentation for the SLsmg
+ interface.
+8. src/slstd.c,slang.c: Added new function intrinisc called "_$" that
+ expands embedded "dollar-escaped" variables.
+9. src/sllist.c: Added __push_list/__pop_list functions that push list
+ elements to the stack or create a list from objects on the stack.
+ These functions may also be used as an alternative to
+ __push_args/__pop_args.
+10. slsh/lib/structfuns.sl: Modified struct_combine to use __pop_list
+ instead of __push_list.
+11. src/test/scircuit.sl used for regression testing of the
+ short-circuit operators was missing.
+12. src/slang.c: Small memory leak involving method calls plugged.
+13. src/slparse.c,slang.c,slstruct.c: Added support for embedded
+ assignments in structure definitions, e.g.,
+
+ X = struct { a = 4, b = 3, c = sin(PI/4)};
+
+14. src/slang.c,slparse.c,slstruct.c: Added support for
+ "function-qualifiers", e.g,.
+
+ define plot_point (x, y)
+	 {
+	 set_color (qualifier ("color", "black"));
+	 .
+	 .
+	 }
+	 plot_point (2, 1; color="red");
+
+ See docs for more info.
+15. modules/png.sl: Added gmin and gmax qualifiers to the
+ png_gray_to_rgb function.
+16. src/kwhash.c: New keywords: "ifnot" and "then". The "ifnot"
+ keyword plays the same role as "!if", except the use of "!if" is
+ deprecated. Then "then" keyword is used in looping constructs as
+ described in #17.
+17. src/slparse.c,src/slang.c: All looping constructs may be followed
+ either an "else" block, or a "then" block, or a combination of
+ both:
+ loop (N)
+	 {
+	 if (foo)
+		 break; % execute the else block if present
+	 }
+	 then
+	 {
+	 % This block executes if the loop ran to completion
+	 }
+	 else
+	 {
+	 % This block executes if the loop was broken prematurely
+	 }
+
+ *** NOTE: This change broke backward-compatibility. For this
+ reason, support for the else clause was dropped". See #48 below.
+
+18. slsh/scripts/slprof: Rewrote much of this script to make it more
+ friendly and useful.
+19. src/sldisply.c: When checking for the equality of space
+ characters, it is only necessary to see see if their background
+ colors are equal -- the foreground color does not matter.
+ Miroslav Lichvar mlichvar at redhat, com.
+20. modules/png.sl: A variable (bad_level) was undefined.
+21. src/slparse.c: The meaning of constructs such as (a<b<c) has been
+ changed to have its mathematical meaning, namely ((a<b)and(b<c)).
+ Before, (a<b<c) was interpreted as (a<b)<c. Also, == and != now
+ have the same precedence level as <,<=,>,>= to permit, e.g.,
+ (a==b<c). Note that (a<b<....<c<d) is also defined as
+ ((a<b)and(b<...<c)and(c<d).
+22. src/slarray.c: New intrinsic: wherenot(x), which means where(not x).
+23. src/slarray.c,slparse.c: a:b:#n may be used to specify a
+ floating point array with n elements running from a to b, inclusive.
+24. src/slparse,slang.c: Fixed the bug where _NARGS was incorrectly
+ set in functions called via expressions such as (@Ai)(x).
+25. src/slang.c,slarray.c,slparse.c,slstruct.c: References to
+ structure fields and array elements are now supported, e.g.,
+ &s.foo and &A20.
+26. slsh/slsh.c: Added '-e string' command-line option.
+27. slsh/lib/profile.sl: Rewrote much of it to support both profiling
+ individual lines and functions.
+28. slsh/scripts/slprof: Added 'calibrate' and 'lines' command-line
+ options.
+29. src/slang.c: Unsigned ints were sometimes pushed as signed ints.
+30. src/slrline.c: Added a new public function called SLrline_move
+ that moves the cursor a specified number of columns.
+31. slsh/lib/glob.sl: If a glob pattern does not include a path, the
+ returned list of files will nolonger be prefixed with "./", i.e.,
+ glob("foo") returns "foo" and not "./foo".
+32. slsh/readline.c: If slsh_interactive_hook exists, it will be
+ called prior to going into interactive mode.
+33. src/slrline.c: A completion mechanism was added. This works by
+ making a callback to a user or application provied hook that
+ returns a list of possible completions. This functionality is
+ available if SLrline_init has be called to add readline-specific
+ intrinsics to the interpreter. The slang code implementing the
+ completion hook is in slsh/lib/complete.sl.
+34. modules/png.sl: Load the colormaps into the same namespace that
+ was used by png.sl (Mike Noble).
+35. slsh/slsh.c: readline intrinsics were not getting initialized.
+36. slsh/lib/rline/completion.sl: Avoid adding NULL to the completion
+ list when no completions are in the global or current namespace.
+37. src/slerr.c: Added SLang_verror_va function. It is like
+ SLang_verror, except it takes a va_list argument instead of a
+ variable argument list.
+38. slsh/scripts/slprof: If atexit exists, use it.
+39. src/slwclut.c: Typo in is_posix_charclass (> instead of >=) was
+ causing the long form of posix character class names not to be
+ properly recognized.
+40. src/slrline.c: SLrline_init was using SLfree instead of
+ SLang_free_slstring, causing a core-dump.
+41. slsh/lib/slshrl.sl: Use slsh_get_doc_string defined in slshhelp.sl.
+42. autoconf/aclocal.m4: Add support for rpath on OpenBSD.
+43. src/slarray.c: Single element arrays specified via, e.g., a:b:#1
+ produced the array b instead of the "more" correct answer a.
+44. src/slexcept.c: __get_exception_info will NULL if no exception is
+ active. Previously it reported an unknown exception.
+45. src/slang.c: If a finally-block threw an exception and then caught
+ it, the outer exception was getting lost.
+46. slsh/lib/glob.sl: glob("*") nolonger matches files that begin with
+ ".". A leading dot in a filename must be matched explicitely. A
+ similar change was made to glob_to_regexp.
+47. src/slang.c,src/slexcept.c: An exception may be rethrown by using
+ "throw" without any arguments. This required support for multiple
+ error-queues.
+48. src/slparse.c: The "loop-else" feature added in change #17 was
+ dropped because the change was not backwards compatible, changing
+ the meaning of connstructs such as
+
+ if (some_condition)
+	 loop (N) {...}
+	 else
+	 something_else();
+
+ "loop-then" is still supported. (Thanks go to Paul Boekholt for
+ picking up on this).
+49. src/sldisply.c: If the terminal supports BCE, then ignore the
+ background color of space characters that occur as trailing
+ whitespace (Miroslav Lichvar).
+50. src/slrline.c: Added additional rline intrinsic functions:
+
+ rline_call
+ rline_set_point
+ rline_set_line
+
+51. src/slrline.c: SLrline_init was using SLang_free_slstring
+ instead of SLfree. Also SLrline_set_point was using < instead of
+ > when comparing point to len.
+52. src/slrline.c: Added rline_getkey and rline_input_pending
+ intrinsic functions.
+53. src/slstd.c: If the "char" function is passed a negative integer,
+ byte-semantics will be used.
+54. src/slrline.c: When browsing previous history items, the item that
+ is currently being edited will not be lost.
+55. src/slrline.c: A new function called SLrline_open2 was added to
+ the API. It is like SLrline_open except that it associates a name
+ with the underlying SLrline_Type object and calls an interpreter
+ hook (rline_open_hook) with that name. This mechanism permits
+ the readline history to be saved to a file and then later retrieved.
+56. slsh/lib/rline/*.sl: A few .sl files were added:
+ vikeys.sl: A simple vi-like emulation
+ emacs.sl: A emacs-like emulation
+ editfuns.sl: Some utility editing functions
+ history.sl: Functions to save/restore history
+57. slsh/scripts/sldb: If the file was specified using a relative
+ path, prefix its name with the cwd to ensure that it loads.
+58. src/slmath.c: Add "fuzzy" floating point comparison functions
+ feqs, fneqs, flteqs, fgteqs, which compare numbers using a
+ specified relative and absolute error.
+59. slsh/readline.c: Readline objects were made available to the
+ interpreter.
+60. slsh/scripts/svnsh, slsh/lib/sldb.sl: Added readline-specific
+ calls to enable the saving/loading of history.
+61. src/slrline.c: Added rline_get_edit_width intrinsic.
+62. src/slarrfuns.c: prod function added (Mike Noble).
+63. src/slstrops.c: %b may be used in sprintf to specify a byte
+ conversion. This is equivalent to %c when UTF-8 mode is not in
+ effect.
+64. src/slarrfuns.c: PROD_RESULT_TYPE was not getting defined on 64
+ bit systems (Brian McQueen)
+65. src/Makefile.in,autoconf/Makefile.in: Now `make install` installs
+ the shared library but not the static one. Use `make
+ install-static` to install the static one.
+66. autoconf/aclocal.m4: rpath support for netbsd
+67. slsh/slsh.c: A preprocessor symbol may be added using -Dname
+ command-line option.
+68. src/slstd.c: changed __is_numeric to return 1 if an integer, 2 if
+ a floating point, and 3 if complex.
+69. src/slang.c: missing break statement in the handling of the
+ qualifier token. This bug manifested itself only when running
+ with slprof or sldb.
+70. slsh/lib/cmdopt.sl: Functions to facilitate the processing of
+ command line options.
+71. slsh/scripts/slprof: modified slprof to use the cmdopt interface.
+72. slsh/lib/structfuns.sl: Enhanced the struct_filter function to
+ filter on specific array dimensions and to return a new structure
+ when given the "copy" qualifier.
+73. src/slimport.c: Allow pathname in an import statement, e.g.,
+ import("/path/to/module");
+74. src/slarrfun.c: Added minabs/maxabs functions.
+75. lib/cmdopt.sl: Added support for type="str" qualifier. Also,
+ cmdopt documentation corrected.
+76. src/slassoc.c: When resizing an associative array that had
+ elements deleted, the num_occupied field was not being properly
+ updated. This was causing the length of the array to be
+ incorrectly computed.
+77. src/slproc.c: Added getpgrp,setpgrp,getgid functions.
+78. src/slutty.c: In the getkey function, if a SIGINT caused
+ SLKeyBoard_Quit to be a non-zero value, the interrupt_hook was not
+ getting executed.
+79. autoconf/Makefile.in: Tell the user to re-run the configure script
+ if it is more recent than the Makefile.
+80. src/slstd.c: __is_numeric was not returning 3 for Complex_Type.
+81. src/slexcept.c: Do not log traeback messages unless _traceback is
+ non-zero.
+82. src/slclass.c: Added SLclass_patch_intrin_fun_table to the library
+ and modified the code in modules/ to make use of this function.
+83. src/slang.c: SLang_Traceback is now a bitmapped variable, but
+ defined in a backward compatible manner. See slang.h and the
+ documentation for the _traceback variable for more information.
+84. src/slang.c,slexcept.c: Change 83 required a small tweak to the testing of
+ traceback variable.
+85. src/slparse.c: MAX_TOKEN_LISTS increased to 256.
+86. src/slparse.c: Added a couple of #if..#endif constructs to avoid
+ compiling bos/eos hooks when the debug feature has been disabled.
+ (Tijs Michels tijs, michels at t-online, de)
+87. src/slproc.c: The setpgrp function that was added in change #77
+ has been removed because on some systems it takes arguments, and
+ on others it takes none. It is also equivalent to setpgid(0,0),
+ so there is no net loss.
+88. src/slutty.c: Set the FD_CLOEXEC flag on the /dev/tty file
+ descriptor.
+89. src/doc/tm/cslang.tm: Changed the array examples to use
+ `SLindex_Type' instead of `int'. I also added a note about this
+ to the NEWS file.
+90. modules/iconv-module.c: a new module (Dino Sangoid).
+91. src/slsig.c: SLsignal was used instead of SLsignal_intr. The
+ difference is that SLsignal_intr interrupts system calls, which is
+ a better choice for the interpreter.
+92. src/slproc.c: added setsid intrinsic
+93. src/slarray.c: a:b:#1 was producing NaN instead of a.
+94. src/sldbcore.c: The debugger was not stopping upon SIGINT.
+95. src/sltermin.c: Added _pSLtt_tifreeent to free the SLterminfo_Type
+ object and avoid a memory leak (Miroslav Lichvar
+ mlichvar at redhat, com)
+96. slsh/lib/cmdopt.sl: Add bor=FLAG and band=MASK qualifiers to support
+ bitmapped options.
+97. modules/onig-module.c: New module that wraps the oniguruma regular
+ expression library.
+98. src/slang.c: If a file defining a namespace was loaded, a
+ duplicate namespace error was getting generated when also loading
+ a byte-compiled version of the same file.
+99. src/slclass.c: In _pSLclass_copy_class, a possible NULL return
+ value by alloc_class_slot was not being handled.
+
+Changes since 2.0.6
+1. src/slmath.c: if a double precision array was passed to nint, it
+ was treated as a single precision one leading to a core dump.
+2. src/sldisply.c: The Is_Fg_BGR variable was re-introduced and a typo
+ affecting it was corrected.
+3. src/slinclud.h: Do not include malloc.h on FreeBSD (Renato Botelho
+ garga at freebsd, org).
+4. doc/tm/cslang.tm: Changed a couple of occurances of "unsigned char"
+ to "SLtype". (Doug Burke dburke at head, cfa, harvard, edu)
+5. doc/tm/rtl/list.tm: Documentation changed to indicate that the
+ third parameters to list_append/insert are optional. (Doug Burke).
+6. src/slwcwidth.c: Added a new function to the API called
+ SLwchar_set_wcwidth_flags. This may be used to force
+ SLwchar_wcwidth to 1 for double width characters. Such a feature
+ is sometimes needed for fixed fonts that treat single and double
+ width characters the same.
+7. slsh/lib/slshrl.sl: The readline-massage hook was interpreting
+ lines beginning with a '.' as RPN.
+8. slsh/lib/sldb*.sl: The debugger was not stopping upon errors
+ generated by the deprecated function verror.
+9. src/slparse.c: "++()" was flagged by the parser as an error, but no
+ error message for it was being generated.
+10. src/slang.h: #if HAVE_LONG_LONG changed to #ifdef HAVE_LONG_LONG
+11. src/slsmg.c: Return right away if SLsmg_write_chars is told to
+ write 0 characters. Also a bug fixed in the logic of this routine
+ involving the test for overwriting the second half of a double
+ width character.
+12. src/slrline.c: Finished the UTF-8 support by the readline functions.
+13. slsh/*.c: Added slsh_get/set_prompt_hook functions for setting of
+ the slsh command-line prompt. (Douglas Burke)
+14. src/sltoken.c: Added additional string representations for tokens
+ so that some error messages will not appear to be so cryptic.
+15. src/sltoken.c: _pSLparse_error: Use the line number of the input
+ stream if the linenumber associated with a token is unknown.
+16. src/slparse.c: Inline arrays and lists are allowed to have a
+ trailing comma, e.g., 1,2, is the same as 1,2.
+17. doc/tm/rtl/type.tm: typo in example for atof corrected (Doug
+ Burke).
+18. Improvements for building on DOS/Windows (Mike Noble):
+
+ * The various mkfiles/makefile.all now include a clean: target
+ * The top-level mkfiles directory now includes 3 new files:
+
+ 	 A build.sh script, which auto-generates the Makefiles
+	 (using mkmake) and commences a build, similar to the
+	 build.bat script which was already there (and which I
+	 tweaked slightly).
+
+ 	 Seed makefile.dos and makefile.sh scripts, which get copied
+	 to the root of the S-Lang distro when either build.sh or
+	 build.bat are run. This makes it easier to build
+	 everything at once, or clean, etc, from the top of the
+	 distro.
+
+ * A few new paragraphs in INSTALL.pc
+ * In the various mkfiles/makefile.all, "CFLAGS +=" changed to
+	"CFLAGS =" to avoid nmake 1.5 problems.
+ * Simplified the module build targets in modules/makefile.all,
+	and made it much easier to add new modules in the future.
+19. Added module support for cygwin. This involved a few minor
+ changes to the Makefiles and aclocal.m4 (Mike Noble)
+20. slsh/slsh.c: Brief copyright message displayed when started up in
+ interactive mode.
+21. src/slarray.c: Improved support for mixed-type inline arrays:
+ NULLs supported ("foo", NULL) where it makes sense, and
+ type-promotion rules are used to determine the resulting type when
+ concatenating mix-type arrays ("foo", NULL, "bar\0");
+22. src/slrline.c: SLrline_close was not freeing the history creating
+ a memory leak.
+23. src/keywhash.c: Removed obsolete and unused "do_while" keyword,
+ and regenerated keywhash.c
+24. doc/tm/slang.tm: List of keywords updated to reflect the actual
+ keywords used.
+25. modules/mkfiles/makefile.all: Updated VC-specific LINK_CMD macro
+ to support the changes outlines in 18 above (Dino Sangoid).
+26. src/slang.c,src/slboseos.c: Added hooks for entering and leaving a
+ function. The beginning-of-statement and end-of-statement hooks
+ were found insufficient to support a debugger support. See the
+ documentation for _bofeof_info for more information.
+27. slsh/lib/sldbcore.sl: Modified to use the bof/eof hooks introduced
+ in #26.
+28. Various documentation tweaks.
+29. src/slboseos.c: Changed the beginning-of-function handler to
+ include the filename.
+30. src/slsh/lib/require.sl: Removed the "feature not provided" message.
+31. src/slrline.c: Tabs were not being expanded properly when the
+ window was horizontally scrolled. Also, the last column of the
+ display is not used in case the terminal has automatic margins.
+32. lib/sldbcore.sl: The debugger's "finish" command was not quite
+ working as it should have.
+33. lib/sldbcore.sl: Added an sldb_initialize function that can be
+ overridden by the debugger.
+34. src/slposio.c: Made changes to allow arbitrary objects to be
+ attached to file descriptors.
+35. src/sl*tty.c: Set SLKeyBoard_Quit to 0 in the init_tty routines.
+36. modules/socket-module.c: A new module that defines various socket
+ functions. This required additions to the configure script and
+ related files.
+37. src/slstrops.c, slsh/readline.c: Removed statements that were never
+ reached.
+38. src/sltypes.c: foreach(X) where X is String_Type produces a
+ sequence of UChar_Type objects. This is consistent with
+ typeof(Xi). Also added "using" forms to specify char or
+ byte-semantics: foreach (X) using ("bytes"|"chars"). The default
+ is byte semantics. Updated the corresponding docs.
+39. src/slang.h: Added SLang_push/pop_wchar macros.
+40. src/sldisply.c: This file was failing to compile with Kanji
+ support enabled. Kanji is unsupported in slang-2.
+41. src/slcurses.*: Alt-character set handling was not working. Once
+ again, I strongly encourage you to modify your programs to use the
+ native SLsmg routines instead of the partial curses emulation hacks.
+42. slsh/lib/sldbsock.sl: New file to implement socket-based debugger.
+43. slsh/scripts/sldb: Added --pid <pid> option for debugging a
+ separate process via the socket-based debugger interface.
+44. src/slang.c: If a try-finally block contained a return statement,
+ the function would sometimes continue after the finally block.
+45. modules/termios-module.c: Added tcget/seti/ospeed functions for
+ setting baudrates of termios structures. Also added CRTSCTS
+ constant to the module.
+46. src/slclass.c: If an application calls SLang_pop_mmt with a
+ non-MMT type specified, a SL_Application_Error exception will be
+ generated.
+47. src/slang.c: A misplaced return statement was introduced by #44
+ above.
+48. src/slparse.c: Allow the "finally" keyword to be followed by a
+ colon, e.g., try foo; finally: bar;
+49. src/sltoken.c,slang,c: "Dollar" and long-longs were not being properly
+ handled in byte-compiled files.
+50. src/test/Makefile: Changes were made to test byte-compiled
+ versions of the test scripts.
+51. modules/socket-module.c: added #include <time.h> to get it to
+ compile on mac osx.
+52. src/slmath.c: The data field was not properly used by the nint function.
+53. modules/select-module.c: Call SLang_handle_interrupt when the
+ select system calls gets interrupted.
+54. src/slposio.c: Add == and != operators to FD_Type objects so that
+ fileno(stdin)==fileno(stdin) works as expected.
+55. src/slarray.c: wherefirst and wherelast were not working with
+ empty arrays.
+56. src/slmisc.c: SLang_guess_type was failing on numbers containing a
+ leading '+' sign.
+57. src/slimport.c: The name of the SLANG_MODULE_PATH environment
+ variable may be changed in src/Makefile.
+58. src/slrline.c: Added a delete-to-beginning-of-line (delbol)
+ function and bound it to ^U.
+59. slsh/Makefile.in: $(CFLAGS) added to the final link line. (Nelson
+ H. F. Beebe)
+60. src/slmath.c: Avoid the use of function pointers to standard math
+ functions to support a wider range of compilers.
+61. autoconf/aclocal.m4: IRIX compilers do not require "-K pic"
+62. autoconf/configure.ac: Probe for socklen_t.
+63. */Makefile.in: Added support for the $LIBS env variable
+64. src/slerr.c: Added fflush(stdout) to SLang_vmessage.
+65. slsh/lib/sldbcore.sl: The eof hook was improperly handling the
+ debugger step.
+66. src/slarray.c: Optimization added for index-array operations on
+ double, float, and int arrays.
+67. src/slarith.c: Optimization added for boolean operations between
+ UChar_Types.
+68. lib/structfuns.sl: Typo in the documentation corrected (Doug Burke)
+69. lib/*.sl, lib/tm/*.tm, lib/help/*.hlp: Documentation for the
+ functions in *.sl has been moved to *.tm and integrated into the
+ help system.
+70. src/slwclut.c: a missing "default" label in a switch statement was
+ causing invalid character class specifiers to pass.
+71. src/slang.c: Optimization added for struct method calls. In
+ addition, linenumber information was propagated for such function
+ calls to permit better interaction with the debugger.
+72. slsh/lib/profile.sl: profile_on was not being called with an
+ argument.
+
+Changes since 2.0.5
+1. src/slmath.c: nint was returning the wrong value for numbers 0.5<=x<1.
+2. src/slarrfuns.c: sum(Double_Type0,0,1) was generating an access
+ error.
+3. src/*.c: Removed some unused variables.
+4. src/slcommon.c: '=' instead of '==' was being used in the
+ utf8_enable function.
+5. doc/tm/*.tm: corrected some documentation typos (Nelson Beebe,
+ beebe at math, utah, edu).
+7. src/sltime.c: times function was returning a structure containing
+ incorrect values (cstawarz at head, cfa, harvard, edu).
+8. src/sldisply.c: Writing a multi-byte character to the lower-right corner
+ of terminals with automatic margins was not working (Vladimir
+ Nadvornik nadvornik at suse, cz).
+9. src/slwclut.c: Allow \\^ in character set specifications to
+ represent a literal '^'. See the documentation for strtrans for
+ more information.
+10. src/slcommon.c: Some systems that have nl_langinfo do not have
+ CODESET. The configure script now checks for both.
+11. autoconf/Makefile.in: Added ".PHONY" and "check" targets.
+12. src/slstrops.c: "%c" in an sprintf style format descriptor made to
+ work with wide-character arguments. It is nolonger necessary to
+ use "%lc".
+13. src/slmisc.c: Semantics of "\x{...}" changed to be more useful
+ when the interpreter is running in non-UTF8 mode. Previously,
+ "\x{...}" always expanded to a UTF-8 encoded string, regardless of
+ the UTF-8 mode. Now, in non-UTF8 mode, \x{...} will expand to a
+ UTF-8 encoded string when "..." consists of 3 or more characters,
+ and for less than 2 characters, it specifies a byte. The behavior
+ in UTF-8 mode has not changed: \x{...} always returns a UTF-8
+ encoded string. The upshot is that "\x{FF}" will produce the byte
+ 0xFF when not in UTF-8 mode, and the 2 byte UTF-8 encoding when
+ run in UTF-8 mode. "\x{FFF}" will expand to the apropriate UTF-8
+ encoding regardless of the mode. Note that the behavior of the
+ non-brace form such as \xAB has not changed--- the result is still
+ a single byte 0xAB.
+14. src/slmisc.c: \u{...} may be used in string literals to specify a
+ unicode character, regardless of the UTF-8 mode (on or off).
+ Previously, \x{...} had this behavior. (See #13).
+15. src/test: Tests are run in both UTF-8 and non-UTF-8 modes.
+16. src/slvideo.c: djgpp version of write_attributes was broken (Gisle
+ Vanem giva at bgnett, no)
+17. slsh/readline.c: Call SLang_handle_interrupt if a read was
+ interrupted by a signal. This will ensure that signal handlers
+ will execute at the prompt.
+18. src/sldisply.c: Added a check for buffer-overflow by tgetstr on TERMCAP
+ based systems.
+19. autoconf/: Updated config.sub and config.guess
+20. slsh/readline.c: Added slsh_readline_noecho function. Also, strip
+ trailing newline from string returned by slsh_readline* when in
+ --no-readline mode.
+
+Changes since 2.0.4
+1. slsh/slsh.c: Error messages were not being printed if an error
+ occured during an atexit hook.
+2. src/slstrops.c: Use _pSLstring_bytelen instead of strlen to get the
+ number of bytes.
+3. src/slstring.c: Several tweaks were made for faster string handling.
+4. src/slparse.c: A negative integer literal raised to a power was not
+ being properly parsed.
+5. doc/tm/cslang.tm: Documentation updated to reflect the changed
+ SLang_pop_double API, as well as other C API documentation
+ tweaks (Doug Burke).
+6. doc/tm/rtl/type.tm: Documentation for "integer" changed to indicate
+ that integer throws a SyntaxError exception if the string does not
+ have a valid syntax. (Joshua Kempner jkempner at bowdoin, edu)
+7. src/slmath.c: Added nint (round to the nearest integer) intrinsic.
+8. src/slarray.c: NULL arguments to array_map were not getting
+ converted to arrays of NULL.
+9. src/slang.h: Added SLclass_set_length_function for setting the
+ length method of application-defined classes.
+10. src/slang.ver: A versioning script is used to restrict the
+ visibility of the _pSL* symbols. (Alastair McKinstry
+ mckinstry at computer, org)
+11. slsh/slsh.c: Ignore SIGPIPE.
+12. src/slutf8.c: If SLutf8_decode is passed an inproperly encoded
+ UTF-8 sequence, then set the target of the SLwchar_Type pointer to
+ the ascii value of the byte, in addition to returning NULL.
+13. src/slposdir.c: Added "access" intrinsic.
+14. src/slsmg.c: Fixed a buffer-overflow in the SLsmg_write_chars
+ function.
+15. src/slsig.c: A missing return statement was causing sigsuspend to
+ fail when called with 0 arguments.
+16. src/slarray.c: Added wherefirst and wherelast intrinsics.
+17. src/slang.c: Inline attribute removed from some functions that
+ were failing to be inlined by the compiler.
+19. src/slstdio.c: SLang_get_fileptr added to permit an application to
+ get the FILE* object associated with a SLANG_FILE_PTR_TYPE.
+20. src/slang.c: It was failing to compile when
+ SLANG_HAS_DEBUGGER_SUPPORT was set to 0.
+21. src/sltime.c: strftime intrinsic added.
+
+Changes since 2.0.3
+1. slsh/scripts/svnsh: Empty lines were not being handled.
+2. src/slutf.c: Incorrect bracketing in the IS_ILLEGAL_UNICODE macro.
+ (johannes figgen at flextronicssoftware, com)
+3. src/sllist.c: A prev link was not always getting set by the list_insert
+ function.
+4. doc/tm/rtl/eval.tm: Tweaked the documentation for the eval function
+ (Mike Noble mnoble at space, mit, edu)
+5. modules/png.sl: Make sure the scale factor is a float and not an int.
+6. src/sltime.c: The tic/toc functions were changed to use
+ gettimeofday or its equivalent. This change results in greater resolution
+ for these interval timers, but not necessarily greater accuracy.
+ Also, previously the tic/toc functions measured the time used by
+ the current process but now they measure elapsed time. The old
+ behavior is still available via _tic/_toc.
+7. slsh/lib/profile.sl: The above change made it possible to create a
+ more accurate profiling tool. The functions in this file are used
+ by the slsh/scripts/slprof profiling tool.
+8. src/slarith.c: Missing break statement caused signed long long
+ values to be printed as unsigned long longs.
+9. tm/doc/cslang.tm: Two small typos corrected (Alastair McKinstry
+ mckinstry at computer, org)
+10. autoconf/aclocal.m4: Support for GNU Hurd and GNU KFreeBSD /
+ KNetBSD systems (Alastair McKinstry)
+11. src/slstrops.sl: Added support for long long to the sprintf
+ intrinsic function (e.g., sprintf ("%lld", 1234LL))
+12. modules/png-module.c: 8 bit gray scale images were being written
+ out as 8 bit images with an alpha channel. Bug fixed and version
+ bumped to 0.1.1.
+
+Changes since 2.0.2
+1. src/slang.c: Optimization of multiple assignment statements involving
+ binary operators was generating bad byte-code causing a run-time
+ error. In order to see this effect, code such as
+
+ w = 3*t+s;
+ x = 2*z+1;
+	y = z*z;
+
+ would have to be written as a as multiple assignment statement:
+
+ (w,x,y) = (3*t+s, 2*z+1, z*z);
+
+2. src/sltypes.c: Added SLang_push_function to complement
+ SLang_pop_function.
+3. src/slkeymap.c: SLkm_define_slkey implemented. It was already
+ declared in slang.h but never implemented until now.
+
+Changes since 2.0.1
+1. src/slang.h: Forgot to bump SLANG_VERSION to 20001.
+
+Changes since 2.0.0
+1. modules/png.sl: png_gray_to_rgb was missing an assignment after
+ normalization.
+2. slsh/lib/print.sl: Ignore SIGPIPE while in the pager.
+3. src/slang.c: SLang_peek_at_stack1_n was broken.
+4. src/slsmg.c: If the cursor is left outside the visible display area
+ during SLsmg_refresh, then "clip" its position to the visible area.
+5. src/slarray.c: Typo (= vs ==) was corrected in the array_eqs_method
+ function. (Dino Sangoid)
+6. src/slmath.c: Use IS_NAN macro instead of isnan (Dino Sangoid)
+7. src/mkfiles/makefile.all: Added dll support for the mingw32 build
+ (Marko Mahnic; marko mahnic at email, si)
+8. src/slang.c: Removed a while loop that did nothing. (Dino Sangoid)
+9. src/mkfiles/makefile.all, src/slconfig.h, src/slposdir.c: Support
+ added for 16 bit systems using watcom C (Dino Sangoid)
+10.doc/tm/*.tm: Some spelling errors corrected (Mike Noble)
+11. src/slang.c, src/slnspace.c: There was a conflict between private
+ and static namespaces that arose when _implicitly_ loading a file
+ into a specified namespace. Resolving this issue involved the
+ complete separation of the private and static namespaces.
+12. The _get_frame_info function now provides the name of the active
+ namespace.
+13. src/sldisply.c: Line drawing characters were not activated when
+ xterm was started in locale mode. Escape sequences were tweaked.
+ (Alexander E. Patrakov, patrakov at ums, usu, ru)
+14. slsh/lib/print.sl: If an element of an array of structs is NULL
+ then print the element as NULL.
+15. modules/varray.c: typo was preventing mmapping of a file from
+ working properly.
+16. slsh/lib/*.sl: changed "static" to "private" to protect the
+ functions when loaded into a namespace.
+17. autoconf/configure.ac: Add tests for atoll and strtoll. Some
+ versions of MacOS X do not have atoll.
+18. modules/png.sl: Added png_get_colormap_names and changed
+ examples/colormap.sl to use it.
+19. src/slarrfun.c: Ignore _NaNs in min/max functions.
+20. slsh/lib/sldbcore.sl: Added several aliases to the debugger:
+ b(reak), c(ont), d(elete), h(elp), l(ist), n(ext), p(rint),
+ pp(rint), q(uit), s(tep)
+
+Changes since 2.0.0 pre-release 8
+1. src/slang.c: Under some conditions, no line number information was
+ being reported for stack underflow errors.
+2. lib/sldbcore.sl: Missing return value was causing a stack-underflow
+ error. (Paul Boekholt)
+3. src/slmisc.c,src/sltoken.c: In UTF-8 mode, an escaped sequence of
+ the form "\xAB" is interpreted as a byte. Previously, it was
+ interpreted as a wide character. To encode a wide character using
+ an escape sequence, use braces ("\x{AB}").
+4. src/slstd.c: The putenv function now throws an OSError exception
+ upon failure. Previously it threw a RunTimeError.
+5. src/slerr.c: Added NamespaceError exception and changed some of the
+ namespace specific function to throw this exception instead of a
+ RunTimeError exception.
+6. src/slang.h: SL_Domain_Error was missing from the file.
+7. src/slerrno.c: If errno_string is called without an errno argument, the
+ current value of _pSLerrno_errno will be used.
+9. src/sltime.c: The "time" functions were changed from using an
+ unsigned long to a long to match time_t.
+10.src/slvideo.c: Corrected a typo in the non-Unix/non-VMS specific
+ SLtt_utf8_enable function.
+
+Changes since 2.0.0 pre-release 7
+1. slsh/lib/structfuns.sl was missing from the distribution.
+2. src/sldisply.c: SLtt_Blink_Mode set to have a default of 0 instead
+ of 1.
+3. slsh/slsh.c: Add -t option, which causes slsh_main (if defined) to
+ not be executed.
+4. src/sltoken.c:SLang_load_object: Do not reset the line_num field.
+ This gives the line numbers in slsh interactive mode some meaning.
+5. src/slsh/lib/slshrl.sl: Usage message for "exit"
+6. src/slvideo.c: SLtt_utf8_enable function added
+7. src/slexcept.c: If tracebacks are turned off, make sure that the
+ line number field in exception objects is meaningful.
+8. src/slang.c: SLang_peek_at_stack1_n was not working. (Mike Noble
+ mnoble at space, mit, edu).
+9. src/slang.c: Small optimization tweak when dealing with a single
+ array index.
+10. src/slposio.c: Jorge Gonzalez, jgonzalez at atsautomation, com
+ found and fixed a leak in the "read" function.
+11. modules/png-module.c: New module to read/write png files. It
+ includes about 20 colormaps. See examples/colormap.sl.
+12. src/slclass.c: SLang_get_int_type returns the SLtype for the
+ integer with the specified number of bits.
+13. src/slarray.c: array_shape intrinsic function added as an
+ alternative to array_info for getting the dimensionality of an
+ array.
+14. src/slospath.c: new intrinsic: path_basename_sans_extname
+15. src/, slsh/: A number of win32 tweaks to support dynamic linking under
+ windows. (Dino Sangoid; sangoid at lloydadriatico, it).
+16. src/slstruct.c: Check for duplicate fields in a struct. (Doug
+ Burke; burke at cfa, harvard, edu).
+17. src/slarrfun.c: New matlab-like functions "any" and "all". (Doug
+ Burke; burke at cfa, harvard, edu).
+18. src/slang.c: Calling SLang_restart will also clear the slang error
+ state. There is no need to call SLang_set_error(0) after calling
+ SLang_restart.
+19. src/sltoken.c: Allow the evaluation of '#if (expr)' when created a
+ pre-parsed file (.slc).
+20. src/slang.c: If a function defined in the currently loading
+ file is to also be autoloaded into another namespace, and that
+ namespace is not current one, then make sure an anonymous
+ namespace is being used.
+21. src/slang.c, slboseos.c: Experimental support for a debugger. New
+ functions:
+ _set_frame_variable
+ _get_frame_variable
+ _get_frame_depth
+ _get_frame_info
+ _use_frame_namespace
+22. slsh/lib/sdb*.sl: An experimental source code debugger based upon
+ a Dino Sangoid's jed debugger.
+23. src/slang.c: The "_pSL" prefix was dropped from a few file-local
+ variables. Also calls to _pSLclass_push_* were changed to calls to
+ file-local specific versions of the functions.
+24. src/slsh/mkfiles/: A couple of win32 icons for slsh were provided
+ by Marko Mahnic (marko. mahnic at email, si)
+25. src/slarray.c: If typeof(t)==DataType_Type, then put back the old
+ behavior of array creation via tN.
+26. doc/tm/slang.tm: The slang manual has been updated for version 2,
+ with numerous typos corrected.
+27. slsh/scripts/sldb: New script that invokes the debugger.
+28. src/slstruct.c: Added _is_struct_type. This works like
+ is_struct_type excepted if the object is an array, it returns
+ information about the array elements.
+29. slsh/lib/print.sl: The "print" defined by this file may be used to
+ print arrays, structures, lists, etc. It is also used by sldb's
+ pprint command.
+
+Changes since 2.0.0 pre-release 6
+1. The _traceback variable was being ignored. As a result, error
+ messages were more verbose than requested.
+2. I fixed the negative indexing issues and made such indexing much
+ more consistent. Before it was possible to index the first through
+ last elements of an array using the index 0:-1. However, there
+ were too many inconsistencies associated with this feature.
+ Negative indices are still supported but in a much more consistent
+ fashion. See UPGRADE.txt for more details.
+
+Changes since 2.0.0 pre-release 5
+
+0. src/slang.h+others: I created a new typedef in slang.h representing
+ array indices (SLindex_Type). This is used in the SLang_Array_Type
+ structure. Previously the affected fields were ints. For backward
+ compatibility, SLindex_Type is defined as an int. This change was
+ made with an eye to the future when 64 bit platforms become more
+ common with physical memory such that one wants to index arrays
+ with more than MAX_INT elements per dimensions (the current
+ limit).
+1. src/slarith.c: missing comma in a code block specific to 64 bit systems
+ prevented compilation.
+2. src/: OS/2 specific patches.
+3. src/mkfiles/makefile.all: Added some ranlib commands for the mingw32,
+ cygwin, and EMX compilers.
+4. */mkfiles/makefile.all: Add TOOL_PREFIX variable to support
+ cross-compilation.
+5. slsh/slsh.c: win32 specific changes to get path to slsh.rc via
+ the GetModuleFileName function (DINO SANGOI (SANGOID at lloydadriatico, it)).
+6. slsh/mkfiles/makefile.all: Corrected the values of the SLANGINC and
+ SLANGLIB variables.
+7. src/slstd.c: atoll intrinsic was not getting defined. (Doug Burke
+ (dburke at head-cfa, cfa, harvard, edu)).
+8. src/test/longlong.sl: Add test for atoll (Doug Burke)
+9. src/slerr.c: SLang_set_error: Allow an error to be cleared but not
+ changed to another value in the presence of an error.
+10. src/slarray.c: Allow a 1-d integer array to always address a
+ multidimensional array. Not just "sometimes".
+11. slsh/lib/arrayfuns.sl: local variable a was multiply defined in
+ reverse function.
+12. src/slpack.c: Add support for long long and 64 bit types. Also
+ 'z' specifier added as an alternative to 's'.
+13. src/slstdio.c: Previously, fread(&v,Char_Type,n,fp) would
+ assign a BString_Type object to v if n>1 or Char_Type if n==1.
+ Now, for consistency it returns Char_Typen for n > 1. To get
+ the value as a binary string, use fread_bytes. This change is not
+ backwards compatible and may break code that relies upon the old
+ behavior. See UPGRADE.txt for additional information.
+14. src/slrline.c: A silly typo prevented multiple instances of
+ readline objects.
+15. slsh/: New intrinsic: slsh_readline. This allows a script to get
+ input from the user using the readline interface.
+16. slsh/scripts/svnsh: A simple shell for interacting with an SVN
+ repository.
+17. src/slang.h: The SLANG_MODULE macro was incorrectly defined when
+ compiled with C++.
+18. src/slkeymap.c: A small memory leak was found by Gilles Mazoyer
+ pgid at free, fr.
+19. src/slarith.c,...: Some problems were found on 64bit big-endian
+ machines. Correcting this involved adding new functions to the
+ interface long and short intrinsic constants.
+20. src/slang.c: Inside a finally block, loops were not working if the
+ exception handler issued a break or return statement.
+21. src/slrline.c: On a 64bit big-endian system a SEGV would result
+ when inserting text.
+22. configure: CFLAGS added to the ELF_CFLAGS variable. LDFLAGS added
+ to the ELF_LINK variable.
+23. src/slposdir.c: hardlink intrinsic added.
+24. src/slexcept.c: "function" field added to the exception object.
+25. src/slang.c: The way line number information is stored has been
+ changed. Now it is nolonger necessary to get line number
+ information by setting the _debug_info variable. In the process I
+ tried to make the error messages somewhat more useful.
+26. src/slang.h: SLvsnprintf and SLsnprintf functions made public
+ Previously these were _pSLvsnprinf and _pSLsnprintf. (Dino Sangoid).
+27. src/slang.c, _slang.h: Bytecodes were made enums instead of
+ preprocessor symbols.
+28. src/slang.h: External symbols have been prefixed with SL_EXTERN to
+ facilitate the construction of a slang DLL on windows. When
+ compiling against the slang DLL, be sure to define SLANG_DLL.
+ (Dino Sangoid).
+29. src/sllist.c: Added foreach method to lists.
+30. src/slsmg.c: Experimental feature: If rendering a character string
+ that contains an character sequence of the form 'ESC x m', or
+ 'ESC x ', where x represents a decimal integer, then the
+ current color will be switched to the value of x. If x is omitted
+ (ESCm) then the color will be set to the color active at the time
+ of the function call.
+
+ SLsmg_set_color (1);
+ SLsmg_write_string ("This is a \033123mnew\033m feature");
+
+ is equivalent to:
+
+ SLsmg_set_color (1);
+ SLsmg_write_string ("This is a ");
+ SLsmg_set_color (123);
+ SLsmg_write_string ("new");
+ SLsmg_set_color (1);
+ SLsmg_write_string (" feature");
+
+ By default, this feature is turned off but may be turned on via
+
+ SLsmg_embedded_escape_mode (1);
+
+ Although this special color-changing-byte-sequence looks like an
+ ANSI escape sequence, the semantics are very different.
+31. doc/tm/rtl/type.tm: The "string" function was documented as
+ returning an integer. (Doug Burke)
+
+Changes since 2.0.0 pre-release 4
+0. src/*: For POSIX compliance, all _SL* symbols were changed to
+ _pSL*. Change suggested by Alastair McKinstry. If you experience
+ a linker error such as "undefined symbol: _SLChg_UCase_Lut" after
+ upgrading, then you will have to recompile your application.
+1. src/slstring.c: Bug fix. For some strings, a substring would
+ produce the same hash as the full string. As a result, the
+ substring was not being properly generated.
+2. src/slerr.c: For applications not using the interpreter,
+ _pSLerr_init was not getting called. As a result, the error-codes
+ were not getting initialized.
+3. src/slsmg.c: Bug fix affecting SLsmg_Newline_Behavior (Thomas
+ Dickey).
+4. src/doc/tm/rtl/strops.tm: typo caught by Doug Burke.
+5. src/slstd.c: added atoi, atol, atoll as simple wrappers around
+ corrsponding standard library functions--- same caveats apply.
+6. src/slstd.c: New intrinsics: add_doc_file, get_doc_files,
+ set_doc_files. These functions facilitate the addition of
+ documentation via a standard mechanism across all apps using the
+ interpreter.
+7. slsh: Interactive support with readline-editing added to slsh. By
+ default, the slang library readline functions are used. If you
+ want GNU readline, then run configure with the appropriate option.
+ (This feature is due to Mike Noble, mnoble at space, mit, edu).
+8. slsh: A man page for slsh (Rafael Laboissiere, rafael at debian, org).
+9. src/slwclut.c: No provision was allowed for backslashes in ranges
+ that also permitted character classes.
+10. slsh/mkfiles/makefile.all: New file for non-unix systems.
+ (DINO SANGOI (SANGOID at lloydadriatico, it)).
+
+Changes since 2.0.0 pre-release 3
+1. New intrinsics: array_swap, array_reverse
+2. src/slrline.c:SLrline_open: If the display width argument is 0, set
+ it to 80.
+3. sldisply.c: Initialize SLtt_Screen_Cols/Rows to (80,24) instead of
+ (0,0).
+4. src/slparse.c: Expressions such as &s.foo and &s0 are flagged as
+ unsupported at parse time.
+5. src/slimport.c: A module may now be imported into more than one
+ namespace. See modules/README if you are a module writer.
+6. slsh/Makefile.in, modules/Makefile.in: Made changes so that
+ nothing gets compiled during the install step.
+7. src/slimport.c: If "import" is called without a namespace argument,
+ the current namespace will be used. If the current namespace is
+ anonymous, the global namespace will be used.
+8. slsh/lib/require.sl: The provide/require functions have been
+ changed to take a namespace argument.
+9. doc/tm/slang.tm: Added section on operator overloading for
+ user-defined types.
+10. doc/tm/tools/fixtxt: a jed-script to repair the text files
+ generated by the linuxdoc sgml2txt program.
+11. doc/tm/slang.tm: Corrected some typos spotted by Doug Burke.
+12. src/mkfiles/makefile.all: DOS/Windows: The response file was not
+ being properly generated (SANGOI DINO (SANGOID at lloydadriatico, it)
+13. src/slang.c: The autoload function may be used to load a file into
+ a namespace. (Based upon an idea from Jörg Sommer (joerg at alea,
+ gnuu, de)
+14. src/slstring.c: New hash function (from Bob Jenkins-- see
+ See http://burtleburtle.net/bob/hash/evahash.html)
+15. src/slassoc.c: rewritten to use double hashing.
+
+Changes since 2.0.0 pre-release 2
+1. autoconf/aclocal.m4: "if ..." replaced by "if test ..." (Lloyd
+ Zusman)
+2. src/slsearch.c: BM searches for a string with the same length as
+ the string to be searched was failing.
+3. slsh/scripts/jpegsize: New demo script that finds the dimensions of
+ jpeg-encoded images.
+4. src/slstd.c: Added _slang_install_prefix intrinsic variable.
+5. src/slboseos.c: New file. This file allows to define callback
+ functions that will be called at the beginning (BOS) and end (EOS) of
+ every statement executed by the interpreter.
+6. slsh/lib/stkcheck,sl: The code in this file makes use of the new
+ BOS/EOS hooks to display lines in a source file that leave
+ something on the slang stack.
+7. examples/profile.sl: This file defines a few functions that take
+ advantage of the BOS/EOS hooks to profile slang code.
+8. src/slarrfun.inc: sum and cumsum tweaked to use a "compensated
+ summation" technique to reduce the effect of roundoff and
+ truncation errors.
+9. src/slmisc.c: SLatoi("h") was producing 0, and not an exception.
+10. src/slmath.c: On VMS, slang is compiled with IEEE support (Jouk
+ Jansen).
+11. src/slassoc.c: Rewrote the implementation to use a double hashing
+ scheme.
+
+Changes since 2.0.0 pre-release 1
+1. slsh/lib/require.sl: Protect the Features variable against multiple
+ loading.
+2. src/*.c: VMS-specific patches from Jacob (=Jouk) Jansen.
+3. src/slsearch.c: non-UTF-8 case-insensitive searches were not working.
+4. src/SLwchar*.c: SLwchar_xxxx functions will use the current locale
+ if UTF-8 has not been enabled for the interpreter.
+5. src/sldisply.c: The display of double-wide unicode
+ characters was not working properly under some conditions.
+6. src/slsmg.c: If a double wide character is being displayed, then if
+ a character is written to either of the cells occupied by the
+ double wide character, then the opposing cell will be overwritten
+ with a space.
+7. src/sltoken.c: Characters specified as 'x' where 0 !=(x&0x80) were
+ not being properly parsed.
+8. src/aclocal.m4: --without-foo was not working.
+9. src/slstrops.sl: Fixed an access error in the "string_match"
+ function.
+
+Changes since 2.0.0 pre-release 0
+1. src/slpath.c: slpath_dirname on VMS was failing to include the
+ closing "" in its return value.
+2. src/slprep.c: A comment in a slang "#ifdef" directive would cause
+ an infinite loop.
+3. src/slarray.c: An integer array such as a:b:c where a>b and c>b was being
+ improperly computed.
+4. src/slparse.c: Function calls with missing arguments was not being
+ properly handled, e.g., func(,);
+5. src/slang.h, src/slclass.h: SLclass_set_foreach_functions added.
+6. src/slcurses.ch: changes added to support UTF-8 (Adrian Colley)
+7. src/Makefile.in: $(prefix)/doc changed to $(prefix)/share/doc
+ (Adrian Colley)
+8. src/sldisply.c: Missing "break" added to tt_sprintf (Andrew V.
+ Samoilov).
+9. src/slang.c: SLang_peek_at_stack_n and SLang_peek_at_stack1_n
+ functions added to peek deeper into the stack (Mike Noble)
+10. src/slang.c: The actual name of the local variable is used in the
+ traceback messages.
+11. src/slsig.c: Support for the signals added to the
+ interpreter. The new intrinsics include: signal, sigsuspend,
+ sigprocmask, alarm.
+12. src/slcommon.c, slang.h: When system calls are interrupted, a set
+ of "interrupt" hooks may be called. The return values of the
+ hooks determine whether or not the system call is restarted.
+13. src/slang.c: If a string has a $ suffix, then
+ variable name expansion will take place on the string, e.g., "$CC"$.
+14. src/sldisply.c: misc patches (optimization and buffer
+ overflow) (Andrew V. Samoilov)
+15. src/slprep.c: #<whatever> was not working (Paul Boekholt).
+16. src/sldisply.c: Applied a patch from Andriy I Pylypenko dealing
+ with tgetstr on termcap-based systems.
+17. src/slcurses.c: combining character support added to curses
+ emulation (Adrian Colley)
+18. src/slsmg.c: New function SLsmg_strwidth returns the displayable
+ width of a character string assuming it will be displayed at the
+ current position.
+19. src/slstrops.c: string_match and string_match_nth work in terms of
+ byte-offsets, not character offsets. New intrinsics: strbytesub
+ and substrbytes that substitute a byte and return a byte sequence,
+ resp.
+20. src/slarray.c: If A is a string, the An returns a UChar_Type.
+ Indexing a string using array notation uses byte-semantics.
+21. src/slang.h: Tracing messages were being queued instead of
+ processed right away.
+22. src/slcommon.c: SLutf8_enable will use nl_langinfo if available.
+23. src/slstdio.c: new intrinsic: fputslines
+24. src/slerr.c: Explicit CRs (\r) removed from error and message
+ handling routines.
+25. modules/: smg-module.c renamed to slsmg-module.c, with similar
+ name changes to the module symbols. Also, for each xxx-module.c, a
+ new xxx.sl was added to be installed in the slsh install-dir so
+ that slsh's "require" will pick up the specified module.
+
+Changes since 1.4.9
+0. There have been many changes for the version 2 release. See NEWS
+ and UPGRADE.txt for some of the changes. The ones listed here were
+ to appear in 1.4.10, if released. Version 2 contains these changes
+ and many more.
+1. src/slang.c: Test for local variable stack overflow was using >
+ instead of >=.
+2. src/slarray.c: Fixed a bug that prevented 7 dim arrays from being
+ indexed. Similar problem to #1 above: > vs >=.
+3. src/slassoc.c: The following caused a segv:
+ X = Assoc_TypeInt_Type; X"foo" = 1:10;
+ Now a type-mismatch error will get generated.
+4. src/slerr.c,sltermin.c: Off by 1 calculations of buffer-sizes fixed
+ by Andrew V. Samoilov (andrew at email, zp, ua).
+5. src/slkeypad.c: More escape sequences courtesy of Denis Zaitsev
+ (zzz at cd-club.ru)
+6. src/slerr.c: SLang_get/set_error functions have been added to the
+ API to get and set the value of SLang_Error, resp. The variable
+ SLang_Error will be removed from slang 2. Applications should
+ start using these functions to ease migration to the next version.
+7. src/slstruct.c: Added SLang_push/pop/free_struct functions to
+ public API. The objects themselves are still opaque.
+8. src/slparse.c: allow the semi-colon to be used as a field separator
+ in a structure declaration.
+9. src/slpath.c: path_sans_extname was failing when a dot was in a
+ directory part of the name.
+10. slsh/slsh.c: The names of environment variables defining the location of
+ the global slsh.rc and the slsh library files may be specified in
+ slsh/Makefile.
+11. src/sltoken.c: Local buffer overflow when the size of an
+ identifier exceeds 256 characters was found and corrected.
+12. src/slarray.c: Leak fixed: Under some circumstances, a memory leak was
+ generated when using user-defined "typedefd" objects in an array,
+ e.g.,
+ typedef struct {a} Foo_Type;
+	()=Struct_Type1,@Foo_Type;
+13. src/slarray.c: Indexing a multi-dimensional array using a
+ mult-dimensional array was broken. Now AI returns an array with
+ the same dimensionality as I, regardless of the dimensionality of A.
+14. New intrinsics:
+ __is_callable (Mike Noble mnoble at space, mit, edu)
+ __is_numeric (Mike Noble mnoble at space, mit, edu)
+ __datatype (John Houck houck at space, mit, edu)
+ mktime
+ symlink
+
+Changes since 1.4.8
+1. src/slarray.c: superfluous call to SLclass_add_math_op removed
+ (Michael Noble <mnoble at space.mit.edu>)
+2. src/slang.c: foreach (NULL) using("next"){} foo (); caused _NARGS=1
+ in foo.
+3. src/slarrfunc.c: Fix to prevent sum(NULL) from causing a core-dump.
+4. src/slimport.c: import (module, "") made equivalent to
+ import(module,"Global"); This way, import(module, current_namespace())
+ will work when the current namespace is anonymous.
+5. src/slospath.c: Several users have requested that I add the ability
+ to define a load path and use that path when loading interpreter
+ files. To this end, several new functions were added to the API:
+
+ char *SLpath_get_load_path (void);
+ int SLpath_set_load_path (char *path);
+ /* Get and Set the path to be searched for files */
+ int SLpath_get_path_delimiter (void);
+ SLpath_set_path_delimiter (int delimiter);
+ /* Get and set the character delimiter for search paths */
+ int SLang_load_file_verbose (int verbose);
+ /* if non-zero, display file loading messages */
+
+ New intrinsics include:
+
+ set_slang_load_path
+ get_slang_load_path
+ path_get_delimiter
+
+ These functions, nor the intrinsics have an effect on applications
+ that use SLang_load_file_hook or SLns_load_file_hook for loading
+ files. The change should be transparant to applications that use
+ the stock load file mechanism. The main difference is that if one
+ attempts to load a file with no extension, e.g., "foo", but the
+ file does not exist, then the interpreter will try to load the more
+ recent of "foo.sl" and "foo.slc".
+
+ See src/slsh.c for how the functions may be used.
+
+6. slsh/slsh.c: Updated to use the new search path code outlined
+ above. Also, slsh is distributed with a collection of general
+ purpose slang functions, including jed's provide/require functions.
+ See slsh/README for more information.
+7. doc/tm/cslang.tm: Modified the section describing the implemetation
+ of intrinsic functions in an effort to clarify the discussion.
+8. src/slang.c: tiny memory leak resulting from peephole optimzations
+ added earlier found and fixed.
+9. src/slarrmisc.c: new intrinsic: cumsum computes the cumulative sum
+ of an array via the new SLarray_map_array function.
+10. src/modules: perl compatible regular expression (pcre) module added.
+
+Changes since 1.4.7
+1. src/sldisply.c: make sure SLtt_erase_line leaves the cursor at the
+ beginning of a line in all cases. Previously, this happened only
+ for terminals able to delete to the end of line _and_, when
+ writing to the last line, the ability to insert a character.
+2. doc/tm/cslang.tm: In the discussion of the MAKE_CSTRUCT_FIELD
+ macro, SLANG_STRING_TYPE was used instead of SLANG_INT_TYPE
+ (mnoble at space.mit.edu). Similarly, in the discussion of intrinsic
+ structures, My_Window was used instead of My_Win
+ dburke at head-cfa.cfa.harvard.edu.
+3. src/slang.c: peephole optimizations of 1.4.7 were conflicting with __tmp
+ optimizations. This was causing something as simple as
+
+ define f()
+ {
+ variable a = 1.0:10.0:1;
+	 variable b = a * 0.0;
+	 return a;
+ }
+
+ to fail.
+4. src/slarray.c Allow ranges to index higher dimensional array.
+5. slsh/slsh.c: Updated to allow a user specified search path. See
+ slsh/README for more info.
+
+Changes since 1.4.6
+1. src/slclass.c: Change "-??-" to "- ?? -" to avoid its
+ interpretation as a trigraph. Miquel Garriga <miquel at icmab.es>
+2. src/mkfiles/makefile.all: If compiling with mingw32, use "cp"
+ instead of "copy". Miquel Garriga <miquel at icmab.es>
+3. src/sllimits.h: Increased the size of the local variable and
+ recursion stacks on 32 bit systems.
+4. src/slarrfun.c: "sum", "min", and "max" intrinsic functions added.
+ Since these may conflict with application defined function, they
+ have been placed in their own module. To get them, use
+ SLang_init_array_extra --- SLang_init_all will not pick up this
+ module. Version 2 of the library will add these functions to the
+ main array function module.
+5. src/sltermin.c: Work around a bug in the solaris 7+8 tset program
+ which improperly sets the TERMCAP environment variable
+ (Paananen Mikko <mikkopa at cs.tut.fi>).
+6. src/slprep.c: Added support for "#stop" and a few other useful
+ or convenient features. See comments at the top of slprep.c for
+ more details. (Mark Olesen <molesen at zeunastaerker.de>).
+7. src/<misc>.c: "const" qualifier added to several places to put
+ constant variables in rdata/text segment to be shared between
+ other processes. ("Andrew V. Samoilov" <samoilov at usb.zp.ua>)
+8. src/sldisply.c: If colors were defined using the "Sf" capability
+ instead of the "AF" capability, then assume those are specified in
+ BGR format instead of RGB. (Pavel Roskin <proski at gnu.org>)
+9. slsh/slsh.c: "status" was not declared if compiled with
+ SLSH_LIB_DIR defined. (mnoble at space.mit.edu)
+10. slsh/Makefile.g32: new file to allow slsh to be compiled with
+ mingw32.
+11. src/sldisply.c,sltermin.c: if running as setuid/setgid, then limit
+ access to the environment for such a process. <solar at openwall.com>.
+12. src/slstd.c: New intrinsic function _get_namespaces may be used to
+ get a list of currently defined namespaces.
+13. src/slstruct.c: better support for pushing and popping structures
+ from C via the SLang_push/pop_cstruct. See doc/text/cslang.txt
+ for details.
+14. slsh/Makefile.in: install target added
+15. src/slang.c: additional peep-hole optimizations added
+16. src/*.c: fixes it enable the library to be compiled without floating
+ support support.
+
+Changes since 1.4.5
+1. doc/tm/rtl/struct.tm: Typos in documentation for set_struct_fields
+ corrected by Douglas Burke <dburke at head-cfa.harvard.edu>.
+2. src/sldisply.c: VMS specific problem: SLang_TT_Write_FD was not
+ getting initialized (Hartmut Becker <Hartmut.Becker at compaq.com>).
+3. src/slarith.c: On a 64 bit system, it was possible that Int_Type
+ objects were not getting properly converted to Double_Type.
+4. src/sltoken.c: A unitialized memory reference fixed in the
+ error handling of an empty character declaration ('').
+5. src/slstd.c: call to _SLinit_slcomplex moved to slmath.c. This
+ means that one does not get complex number support unless math
+ support is also enabled. (suggested by Michael Noble
+ <mnoble at head-cfa.harvard.edu>)
+6. src/slclass.c: Make sure that when registering a class using
+ SLANG_VOID_TYPE, the reserved class ids are not used.
+7. src/slmisc.c, src/sltoken.c: moved SLatoi and friends from sltoken
+ to slmisc.c. This avoids linking in the interpreter when it is not
+ needed.
+8. doc/tm/rtl/array.tm: Documentation for the "where" function
+ corrected by <G.Milde at physik.tu-dresden.de>.
+9. src/slkeypad.c: support added for F11 and F12 keys
+10. src/slimport.c: Better handling of dlopen errors as suggested by
+ Michael Noble <mnoble at head-cfa.harvard.edu.
+11. src/slstruct.c: make sure field names have legal names.
+12. src/slistruct.c: SLns_add_istruct_table added.
+13. src/sltoken.c: New name-space specific functions added:
+ SLns_load_file, SLns_load_string
+ These may be used to load a file or a string into a specified
+ namespace. Simarily, the "eval" and "evalfile" functions may now
+ be given a second argument to specify a namespace.
+14. src/slstd.c: __eqs function added to test for "sameness" of
+ its arguments, __class_type returns information about how an
+ object is classified, __class_id to return its class id. See
+ examples/saveobj.sl for an example of the use of these functions.
+15. src/slarray.c: a 2-d array can nolonger be specified in-line as,
+ e.g., 1,2,3,4. This now produces a 1-d array: 1,2,3,4.
+16. src/slregexp.c: fix for case-insentive matches involving e.g.,
+ a\{1,3\} type regexps (Thomas Schultz <tststs at gmx.de>)
+17. src/slarray.c: Allow setting elements of pointer type arrays to
+ NULL, e.g., a10 = NULL.
+18. src/slsignal.c: If CYGWIN, then assume posix signal handling works.
+19. src/slang.c: Do not allow an intrinsic function, variable, etc
+ table to be added twice.
+20. src/slarray.c: Added _isnull intrinsic for checking for NULL values of
+ array elements. This is useful since something like
+ "where(a==NULL)" does not check the individual elements, whereas
+ "where(_isnull(a))" does.
+21. src/sldisply.c: typo involving the initialization of Del_Eol_Str
+ for terminals that do not have such capability.
+ (Pavel Roskin <proski at gnu.org>)
+
+Changes since 1.4.4
+1. Added QNX specific patches and fixed some typos that prevented it
+ from compiling when _SLANG_OPTIMIZE_FOR_SPEED is 0. (Tijs Michels
+ <tijs at vimec.nl>).
+2. Make sure '#ifeval expr' evaluates up to the end of a line and no
+ further.
+3. src/sldisply.c: Do not look for pad info in the graphic charset
+ pairs string. Also, when comparing space characters, be sure to
+ take into account ACS. (Marek Paliwoda <paliwoda at inetia.pl>)
+4. Trivial code cleanups to avoid BCC 5.x warnings.
+5. src/mkfiles/makefile.all: BCC-specific tweaks (John Skilleter
+ <John.Skilleter at pace.co.uk>)
+6. SLang_push/pop_datatype made public
+7. src/slutty.c: if tty is not initialized and an attempt is made to
+ read from the tty, set errno to EBADF.
+8. src/slkeypad.c: New function SLkp_set_getkey_function. This may be
+ used to specify a different function to read keys.
+9. src/slcurses.c: If an invalid keysequence is entered, simply return the
+ characters of the sequence on successive getkey calls.
+10. src/slarray.c: Inline arrays of the form 1f, 0 were not working.
+11. src/sldisply.c: Make sure SLtt_get_screen size gets called by
+ SLtt_initialize.
+12. doc/tm/rtl/struct.tm: typeof in example for get_struct_field_names
+ corrected by Chris Baluta.
+13. modules/varray.c: example showing how a memory mapped array may be
+ created. It also illustrates the free_fun callback for arrays.
+14. examples/life.sl: a S-Lang implementation of Conway's life.
+15. src/slclass.c: SLclass_dup_object function added. Although
+ push/pop can be used to achieve a duplicated object, this function
+ makes it a little easier.
+16. src/slang.h: Prototyes involving "unsigned char" to represent data
+ types have been modified to use SLtype, which is typedefed to be
+ an unsigned char. V2 will use a different size for data types.
+17. Misc tweaks to aclocal.m4, src/Makefile.in, etc to support MacOSX.
+ I have not tested it on that system.
+18. The library may now be compiled under CYGWIN using the same
+ procedure as under Unix.
+19. src/slkeypad.c: Some xterm-specific escape sequences added by
+ Denis Zaitsev <zzz at cd-club.ru>.
+
+Changes since 1.4.3
+1. Fixed a bug that shows up on 64 bit BigEndian machines--- it
+ affected no others.
+2. Fixed potential problem in pre-parsing binary strings.
+3. Bug a fixed affecting only pure termcap-based systems. It has
+ been around a while, I am surprised that it took so long to be
+ discovered.
+
+Changes since 1.4.2
+1. If init_NAME_module_ns does not exist in a module, then try to
+ load init_NAME_module as long as the module is to be imported into
+ the Global namespace.
+2. src/sldisply.c: allow more than 200 rows and 250 columns. Who
+ uses such windows?
+3. Allow Void_Type to be specified for the data-type in array_map if the
+ function returns nothing.
+4. src/slarray.c: A statement such as 1:-11:-1 = 1:-1; was
+ causing a core dump.
+5. src/sldisply.c: (Unix/VMS) SLsmg/SLtt routines will write using the file
+ descriptor SLang_TT_Write_FD, which, by default, is initialized to
+ fileno(stdout).
+6. src/slposio.c: New C API functions:
+ SLfile_get_fd returns the file descriptor associated with the
+ SLFile object.
+ SLfile_dup_fd: duplicate an SLFile object
+7. src/slposio.c: New intrinsics: dup_fd (dup a file descriptor)
+8. SLerrno.c: C API Function: SLerrno_set_errno.
+9. SLerrno.c: More errno values added.
+10. Raising complex types to powers supported.
+11. slang.c: current_namespace was returning "global" instead of
+ "Global" for the global namespace.
+12. slang.c: `use_namespace("X");define f();' was not placing `f' into
+ `X'.
+13. path_is_absolute fixed to return integer
+14. src/slarray.c: generate an error when an empty array is passed to
+ array_map.
+15. src/slarray.c: a=3; a* should return an array.
+16. Make sure setlocale(LC_NUMERIC,"C") gets called.
+17. slvideo.c: SLtt_set_cursor_visibility implemented for win32.
+18. slvideo.c: SLtt_get_screen_size corrected for win32 by Zusha P.
+19. configure: modified to not automatically assume that -ldl is
+ required for dlopen. In addition, molesen at zeunastaerker.de sent
+ patches for building dynamically linked library under irix.
+20. slsh/Makefile: generated by configure.
+21. modules/Makefile: generated by configure
+22. src/slimport.c: If no module path has been set, fall back on
+ $(prefix)/lib/slang/modules
+23. src/Makefile.in: DESTDIR support added by Brad <brad at comstyle.com>.
+24. src/Makefile.in: documentation is installed in $(prefix)/doc/slang
+ and no longer in $(prefix)/doc/slang/$(slang_version)
+25. sleep intrinsic can take a floating point number to sleep
+ fractional seconds.
+26. src/slang.c: fix SLang_run_hooks to accept a namespace qualifier.
+27. New modules added to the module directory: fcntl, select, termios.
+
+Changes since 1.4.1
+1. slang.c: Under certain conditions, the continue statement was not
+ properly handled in do..while statements. src/test/loops.sl added
+ for testing.
+2. slparse.c: avoid potential (rare?) infinite loop when slang error occurs
+ (Stanisła Bartkowski <sb at protest.com.pl>).
+3. slsmg.c: When SLsmg_init_smg is called, mark the display as trashed.
+4. It is now possible to add intrinsics to their own namespace via
+ new SLns_add* functions. Moreover, the import function now takes
+ an optional additional argument that specifies a namespace.
+5. New namespace intrinsics: use_namespace, current_namespace
+6. Changed inner-product algorithm to minimize the number of cache
+ misses.
+7. sldisply.c: Kanji specific patch from Jim Chen
+ <jimc at ns.turbolinux.com.cn>.
+8. sldisply.c: Assume that Eterm and rxvt are xterm-like (Michael
+ Jennings <mej at valinux.com>).
+9. sldostty.c: mouse support added by Gisle Vanem <giva at bgnett.no>.
+10. slsearch.c: avoid infinite loop if search string has no length.
+11. SCO elf support added by Mike Hopkirk <hops at sco.com>.
+12. slregexp.c: regexp \d+ was not working properly
+13. keyhash.c: typos involving USER_BLOCK keywords corrected.
+ (the use of USER_BLOCKs is discouraged).
+14. New intrinsic variable: _slang_doc_dir. This specifies the
+ installation location of the doc files.
+15. Make sure it can compile with SLTT_HAS_NON_BCE_SUPPORT set to 0.
+
+Changes since 1.4.0
+1. slw32tty.c: `v' key was not being handled on win32 systems. Also,
+ Shift-TAB will now generate ^@-TAB.
+2. New intrinsic function: strreplace. This is more flexible than
+ str_replace.
+3. VMSMAKE.COM: slstring added to list of files to get compiled.
+4. slsh/Makefile, modules/Makefile: added patch from Jim Knoble
+ <jmknoble at pobox.com> to create elf versions (make ELF=elf).
+5. AIX IBMC patches from Andy Igoshin <ai at vsu.ru>.
+6. autoconf/config.sub: tweaked to properly handle recent alpha
+ systems.
+7. If compiling on an alpha, add -mieee compiler flags.
+8. SLang_roll_stack and SLang_reverse_stack functions made public.
+9. SLang_free_function added. If you call SLang_pop_function, then when
+ finished, call SLang_free_function. This does nothing in 1.X but
+ may do something in 2.x.
+10. src/slrline.c: Keybindings for ESC O A, etc added.
+11. src/slsmg.c: SLsmg_write_nstring: avoid many loops if an extremely
+ large value is passed (> 0x7FFFFFFF).
+12. src/slregexp.c made thread safe
+13. src/slsmg.c: Cursor was not always properly positioned when
+ after SLsmg_touch_lines called.
+14. If terminal does not have erase to eol capability, then use spaces.
+15. doc/tm/strops.sl: doc for strcat updated to reflect its ability to
+ concatenate N strings.
+16. Documentation updated to indicate that floating point range arrays
+ are open intervals such that a:b does not include b. slarray.c
+ was modified to enforce this specification. Previously, whether
+ or not b was included in the interval was indeterminate.
+17. src/slsmg.c: bug involving SLsmg_set_screen_start fixed.
+18. src/slparse.c: parser was failing to catch misplaced `}'.
+
+Changes since 1.3.10
+1. If a floating point exception occurs and the OS allows the library
+ to handle it without forcing a longjmp, then SL_FLOATING_EXCEPTION
+ will get generated instead of SL_INTRINSIC_ERROR. Note: Linux
+ provides no way to handle floating point exceptions without
+ forcing a longjmp. In my opinion, this is a flaw.
+2. SLang_pop_double was returning the wrong value for short and
+ character types.
+3. New intrinsic: is_struct_type(X) ==> non-zero is X is a struct.
+4. typecast operation from user defined type to Struct_Type added.
+5. slkeypad.c: DOS/Windows DELETE_KEY definition added (Doug Kaufman
+ <dkaufman at rahul.net>)
+6. slposdir.c: Do not depend upon the existence of rmdir on VMS
+ systems.
+7. slang.c: abs, sign, mul2, chs, sqr were not being treated as
+ function calls.
+8. sldisply.c:SLtt_cls: If the terminal is a color terminal but
+ being used as a black and white terminal, then reset colors before
+ clearing.
+9. path_sans_extname intrinsic added.
+10. slimport.c: If module defines deinit_NAME, will be be called prior
+ to unloading the module. (Ulrich Dessauer <des at gmx.de>)
+
+Changes since 1.3.9
+0. typedef unsigned short SLsmg_Char_Type added to slang.h.
+ Applications that access SLsmg functions read/write_raw and
+ SLsmg_char_at should use SLsmg_Char_Type unstead of unsigned short
+ because this will be changed to unsigned long in version 2.0.
+
+1. Documentation patches from Vlad Harchev <hvv at hippo.ru> added.
+2. slstring.c: offsetof(SLstring,bytes) -->
+ offsetof(SLstring,bytes0) to avoid compiler warning on some
+ systems.
+3. slcmplex.c: an int was used where a double should have beed used.
+4. egcs g++ was optimizing slang.c:SLclass_push_ptr_obj away because
+ it was declared as inline. In my opinion, this is another g++ bug.
+5. sscanf intrinsic added. See docs.
+6. SLmake_lut rewritten to correct incorrect handling of ranges with a
+ hyphen at the end.
+7. Small bug involving non-BCE terminals in SLsmg_set_color_in_region
+ fixed.
+8. Functions SLcomplex_asinh/acosh/atanh implemented.
+9. install-elf will nolonger install .h files twice.
+10. @Struct_Type may be used to create a struct.
+12. Xi++, Xi-=Y, etc implemented.
+13. Much of slw32tty.c rewritten to fix several bugs in the win32 tty
+ support. In addition, if SLgetkey_map_to_ansi(1) has been called,
+ then function and arrow keys will produce escape sequences that
+ allow one to distinguish alt, ctrl, and shift function keys.
+14. OS/2 specific typo in slposdir.c corrected (Eddie Penninkhof
+ <wizball at xs4all.nl>).
+15. slang.c:add_slang_function: On the very rare occasion that this
+ function failed, memory would get freed twice.
+
+Changes since 1.3.8
+1. Color was not enabled on VMS.
+2. If MAKE_INTRINSIC was used to declare a function which takes
+ arguments, then a typecast error would result when the function was
+ called. New programs should not use MAKE_INTRINSIC since it
+ bypasses argument type-checking.
+3. src/sl-feat.h: SLTT_XTERM_ALWAYS_BCE variable added to force the
+ assumption of the bce (background-color-erase) capability of xterm.
+ The default is 0, which means to accept the terminfo setting.
+ To force it to 1 during run-time, set the COLORTERM_BCE environment
+ variable. This is useful when using, e.g., rxvt to login to a
+ solaris system where the terminfo file will probably not indicate
+ bce.
+4. SLw32tty.c:SLang_init_tty: Open CONIN$ instead of using
+ GetStdHandle. This is necessary if stdin has been redirected.
+5. SLposdir.c: Stat structure contains new field `st_opt_attrs' that
+ may be used to contain system specific information that `struct
+ stat' does not provide. In particular, under win32, this field
+ contains the file attributes, e.g., whether or not a file is
+ hidden.
+6. Appropriate typecasts added to avoid warnings on systems that do not
+ support `void *'.
+7. Characters in the range 128-255 are allowed in identifiers.
+8. Correction to the documentation for SLang_init_tty (Ricard Sierra
+ <irebulle at nexo.es>).
+9. SLANG_END_*_TABLE macros added to quiet silly egcs compiler warnings.
+10. typo in sltime.c caused it not to compile under Ultrix.
+11. Speed improvement of binary operations involving arrays,
+ particularly when used in conjunction with the __tmp function.
+12. traceback messages include the filename containing the function
+13. File local intrinsic variable `_auto_declare' added. If non-zero,
+ any undefined global variable will be given static scope.
+14. __uninitialize intrinsic function added.
+15. listdir was returning NULL on empty directories. It has been
+ changed to return String_Type0. It will return NULL upon error.
+16. slang.h: if __unix is defined, then also define __unix__ (Albert
+ Chin-A-Young <china at thewrittenword.com>).
+17. foreach using extended to File_Type objects. See documentation.
+18. Tweak to the inner-product operator such that if A is a vector,
+ and B is a 2-d matrix, then A will be regarded as a 2-d matrix
+ with 1 column.
+
+Changes since 1.3.7
+0. configure script updated to autoconf 2.13. If /usr/include/slang.h
+ exists, then the default prefix will be set to /usr.
+1. Compile error fixed if _SLANG_HAS_DEBUG_CODE is 0.
+2. Bug fix involving typecast(Array_Type, Any_Type).
+3. __IBMC__ patches from Eddie Penninkhof <wizball at xs4all.nl>.
+4. If A = Assoc_Type (Any_Type array), then Ax automatically
+ dereferences the Any_Type object.
+5. Bug fixed involving Assoc_Type optimization cache.
+6. Tweaks to SLtt_smart_puts for improved performace.
+7. array_map modifed such that the first array in its argument list
+ controls the number of elements in the output array. This is a
+ backward compatible change and makes the function more flexible.
+8. Additional tweaks to speedup array inary functions if
+ _SLANG_OPTIMIZE_FOR_SPEED > 1.
+9. Patch from Thomas Henlich <henlich at mmers1.mw.tu-dresden.de> fixing
+ a problem with the `SLang_define_case' function, which allows
+ customization of the upper/lower case tables.
+10. strtrans and str_delete_chars intrinsic functions added.
+11. tweaks to interpreter for some additional speed.
+
+Changes since 1.3.6
+1. Added a modified version of a patch from Martynas Kunigelis
+ <martynas at diskena.dammit.lt> to allow writes to the lower left
+ corner.
+2. SIZEOF_LONG changed to 4 for VMS alpha systems (Jouk Jansen
+ <joukj at hrem.stm.tudelft.nl>).
+3. MSC patches from gustav at morpheus.demon.co.uk (Paul Moore). He also
+ contributed code for listdir with MSC.
+4. SLsmg.c: Background color erase tweaks for terminals that lack this
+ capability.
+5. Fixed a NULL pointer dereference when doing Struct_Type20.
+6. Added slsh/scripts/ls and slsh/scripts/badlinks. `ls' is designed
+ for non-Unix systems and `badlinks' finds all symbolic links in
+ specified directories that point to non-existent files.
+7. SLang_Version_String and intrinsic variable _slang_version_string
+ added.
+8. stat_file modified under win32 such that a trailing `\' is stripped
+ if present.
+9. stat_is intrinsic modified to return a character instead of an
+ integer.
+10. The matrix-multiplication operator `#' now performs inner-products
+ on arrays, e.g., if A and B arrays:
+ A = A_i..jk
+	 B = B_kl..m
+ Then, (A#B)_i..jl..m = A_i..jk B_kl..m where k is summed over.
+ This means that `#' is a matrix multiplication operator for 2-d
+ arrays, and acts as a dot-product operator for 1-d arrays.
+ In the process, it has been extended to complex numbers.
+
+11. _reshape intrinsic function added. Unlike `reshape', this
+ function creates a new array and returns it.
+12. Array indexing via characters works again, e.g., A'a'.
+
+Changes since 1.2.2
+0. New assignment operators: *= /= &= |=
+ The addition of these operators meant that some of the internal
+ byte-codes had to be modified. This change should only cause
+ problems with byte-compiled or preprocessed .sl files. As far as I
+ know, only the JED editors uses this feature. So, after upgrading
+ the library, and before running JED, do the equivalent of
+
+ rm $JED_ROOT/lib/*.slc
+
+ That is, delete the byte-compiled .slc files.
+
+1. Now the language supports `!if ... else' statements.
+2. New intrinsics:
+
+ __is_initialized: This may be used to see whether or
+ not a variable is initialized, e.g, __is_initialized (&variable);
+ __get_reference: Returns a reference to an object with a
+ specified name.
+ rmdir, rename, remove (slfile.c): these return 0 upon success, -1 upon
+ failure and set errno
+ getpid, getgid, getppid (slunix.c)
+ _typeof: This is similar to `typeof' except in the case of
+ arrays where it returns the data type of the array
+ __pop_args, __push_args: see documentation
+ fseek, ftell, and symbolic constants SEEK_END, SEEK_CUR, SEEK_SET
+ sleep
+ usage
+
+3. `Conj' function added to get the complex conjugate
+4. New array module that implementes additional array functions, e.g.,
+ transpose, matrix multiplication, etc... Use `SLang_init_array' to
+ initialize.
+5. An array such as 1,2,3,4,5,6 is interpreted as a 2-row
+ 3-column array.
+6. Amiga patches from Jörg Strohmayer <j_s at gmx.de>.
+7. New table types:
+
+ SLang_IConstant_Type
+ SLang_DConstant_Type
+
+ These are useful for defining symbolic constants. See slmath.c and
+ slfile.c for examples of their use.
+
+8. A new pseudo-function: __tmp
+ This `function' takes a single argument, a variable, and returns
+ the value of the variable, and then undefines the variable. For
+ example,
+
+ variable x = 3;
+	variable y;
+	y = __tmp(x);
+
+ will result in `y' having a value of `3' and `x' will be undefined.
+ The purpose of this pseudo-function is to free any memory
+ associated with a variable if that variable is going to be
+ re-assigned. For example, consider:
+
+ variable x = 1:10:0.1;
+ x = 3*x^2 + 2;
+
+ At the time of the re-assignment of `x' in the last statement, two
+ arrays will exist. However,
+
+ x = 3*__tmp(x)^2 + 2;
+
+ results in only one array at the time of the assignment, because
+ the original array associated with `x' will have been deleted. This
+ function is a pseudo-function because a syntax error results if
+ used like
+
+ __tmp (sin(x));
+
+9. New low-level push/pop functions that are designed specifically
+ for use in constructing the push/pop methods of application
+ defined data types. These functions have names of the form:
+
+ SLclass_push_*_obj
+ SLclass_pop_*_obj
+
+ where * represents int, long, char, short, ptr, double, float.
+ See sltypes.c to see how they are used by, e.g., SLANG_INT_TYPE.
+
+10. New module import facility. See modules subdirectory for
+ examples. To enable this, use
+
+ SLang_init_module
+
+ in you application. Modules will be searched in the following order
+
+ 1. Along the path specified by the `set_import_module_path'
+	 function, or by the C functiion SLang_set_module_load_path.
+	2. Along the path given by the SLANG_MODULE_PATH environment
+	 variable.
+	3. Along a system dependent path, e.g., LD_LIBRARY_PATH
+ 4. In the current directory.
+
+ New interpreter intrinsics include:
+
+ import (String_Type MODULE_NAME);
+	set_import_module_path (String_Type PATH);
+	String_Type get_import_module_path ();
+
+11. New integer and floating point types added to the language. Now
+ all basic C signed and unsigned integer types are supported:
+
+ C bindings S-Lang bindings
+ ---------------------------------------
+ SLANG_CHAR_TYPE Char_Type
+ SLANG_UCHAR_TYPE UChar_Type
+ SLANG_SHORT_TYPE Short_Type
+ SLANG_USHORT_TYPE UShort_Type
+ SLANG_INT_TYPE Int_Type
+ SLANG_UINT_TYPE UInt_Type
+ SLANG_LONG_TYPE Long_Type
+ SLANG_ULONG_TYPE ULong_Type
+ SLANG_FLOAT_TYPE Float_Type
+ SLANG_DOUBLE_TYPE Double_Type
+
+ For example, `Long_Type10' creates an array of 10 longs.
+
+12. New intrinsic: set_struct_field. See function reference for more
+ info.
+
+----- snapshot slang1.3_981030 made available -----
+
+13. Type synonyms added:
+
+ Int16_Type, UInt16_Type (16 bit (un)signed integer)
+ Int32_Type, UInt32_Type (32 bit (un)signed integer)
+ Int64_Type, UInt64_Type (64 bit (un)signed integer)
+ Float32_Type (32 bit float)
+ Float64_Type (64 bit float)
+
+ Not all systems support 64 bit integers. These synonyms are
+ useful when one needs integers and floats of a definite size.
+
+14. array_sort changed to use qsort. The main reason for this is that
+ the previous sorting method was derived from a numerical recipes
+ merge sort.
+
+15. New namespace manipulation functions available. When a function
+ or variable is declared as `static', it is placed in the private
+ namespace associated with the object being parsed (a file). By
+ default, there is no way of getting at that function or variable
+ from outside the the file. However, the private namespace may be
+ given a name via the `implements' function:
+
+ implements ("A");
+
+ Then the private variables and functions of the namespace A may be
+ accessed via A->variable_name or A->function_name. The default
+ global namespace is called `Global'. For example, the intrinsic
+ function `message' is defined in the global namespace. One may
+ use either of the following forms to access it:
+
+ message ("hello");
+	 Global->message ("hello");
+
+----- snapshot slang1.3_981104 made available -----
+
+16. New intrinsics:
+
+ strtok (See documentation)
+	length (Get the length of an object)
+
+17. New data type added: Any_Type. An array of such a type is capable
+ of holding any object, e.g.,
+
+ a = Any_Type 3;
+	 a0 = 1; a1 = "string"; a2 = (1 + 2i);
+
+ Dereferencing an Any_Type object returns the actual object. That
+ is, @a1 produces "string".
+
+18. Associative arrays added. See documentation.
+19. New `foreach' statement. See the section on `foreach' in
+ doc/text/slang.txt as well as the examples in examples/assoc.sl
+ and src/calc.sl.
+20. Oops. sign function was broken.
+21. array_sort modified to also accept &function_name.
+
+----- snapshot slang1.3_981116 made available (1.3.4) -----
+
+22. Before, it was necessary for the aplication to to call
+ SLang_init_slassoc to enable associative array support. This is
+ nolonger necessary if associative array support is enabled in
+ sl-feat.h.
+
+23. Examples in the documentation modified to use foreach whenever a
+ simplification occurred.
+
+24. Max screen size for 32 bit systems inclreased to 256 rows.
+
+25. `private' keyword added to prevent access to an object via the
+ namespace. This works exactly like `static' except that `static'
+ objects may be accessed via the namespace.
+
+26. structure access methods now available for application defined
+ types (cl_sput, cl_sget). Also, note that array access methods
+ are also available. See slassoc.c for examples.
+
+27. If x is a string, then xa:b produces a string composed of the
+ characters xa, ... xb.
+
+29. New intrinsics:
+
+ listdir: This returns the filenames in a specified
+ directory as an array of strings.
+
+30. Source code for intrinsic functions reorganized in a more coherent
+ fashion. In particular, SLang_init_slfile and SLang_init_slunix
+ are obsolete (though still available) and applications should call
+ a combination of the new functions:
+
+ SLang_init_stdio() /* fgets, fopen, ... */
+ SLang_init_posix_process () /* getpid, kill, ... */
+ SLang_init_posix_dir () /* mkdir, stat, ... */
+
+ Note that `unix_kill' has been replaced by `kill'. So, if you use
+ unix_kill in your application, change it to `kill'.
+
+31. It is now safe to redefine an object while executing the object,
+ e.g., this is now ok:
+
+ define f(x) { eval ("define f(x) { return x; }"); }
+
+32. Binary strings added. This means that it is now possible to use
+ strings with embedded null characters. Too fully exploit this new
+ feature, `fread' and `fwrite' functions were added to the stdio
+ module. In addition `pack', `unpack', `sizeof_pack',
+ `pad_pack_format' were added for converting between binary strings
+ and other data types. See Stdio chapter of the documentation for
+ more information.
+
+33. New structure intrinsic: set_struct_fields. This is useful for
+ setting the fields of a structure without doing each one
+ individually.
+
+34. Interpreter now understands __FILE__ and __LINE__ as referring to
+ the file name and line number of the object being parsed.
+
+35. New intrinsic: array_map. This applies a function to each element
+ of an array and returns the result as an array.
+
+36. The documentation for the intrinsic functions has been updated and
+ organized into a more coherent form.
+
+37. New interface to C structures. See the documentation.
+
+38. Modifications to the interpreter integer types so that short and
+ int are equivalent whenever sizeof(short)==sizeof(int). Ditto for
+ int and long. This reduces the code size.
+
+39. NULL is equivalent to 0 in while and if statements, e.g.,
+
+ x = NULL;
+ if (x) { never_executed (); }
+ while (x) { never_executed (); }
+
+40. `public' made a keyword to for symmetry with `private' and
+ `static', e.g.,
+
+ public define a_public_function ();
+	 public variable a_public_variable;
+
+41. semantics of `implements' modified such that the default variable
+ and function declarations are `static', i.e.,
+
+ define xxx (); % ==> public function
+	implements ("foo");
+	define yyy (); % ==> static function
+
+42. Patch from Martynas Kunigelis <kunimart at pit.ktu.lt> adding more
+ line and symbol drawing characters. Also a patch from
+ k-yosino at inatori.netsweb.ne.jp forcing a flush when disabling
+ use of the terminal's status line.
+
+--- Version 1.3.5 released ---
+
+43. Corrected the name of SLang_(sg)et_array_element to be consistent
+ with the documentation.
+
+44. Fixed a bug involving orelse and andelse statements when
+ _debug_info is non-zero.
+
+45. The _apropos intrinsic modified to work with namespaces. In fact,
+ it now returns an array of matches, or if called with out a
+ namespace argument, it returns values to the stack for backward
+ compatibility.
+
+46. strchop and strchopr functions modified to return arrays. (this
+ changes was actually made in 1.3.5).
+
+47. Semantics of strcompress modified to be more useful. The new
+ semantics are probably more natural and should pose no
+ compatibility problems.
+
+48. The `*' operator may be used in array index expressions and is
+ equivalent to `:', e.g., a*,1 means all elements in column 1
+ of the 2d array.
+
+49. New intrinsics to convert bstrings <--> arrays:
+
+ bstring_to_array
+	array_to_bstring
+
+50. New timing intrinsics: tic(); toc(); times (); Also, unix_ctime
+ renamed to ctime (This change occurred in 1.3.5).
+
+51. strcat modified to accept more than 2 arguments:
+
+ strcat ("a", "b", ..., "c") ==> "ab...c";
+
+52. %S in format specifiers will convert the object to its string
+ representation and use it as %s.
+
+53. strtok defaults to using " \t\r\n\f" if called with one argument.
+
+54. fgetslines takes optional second argument that specifies the
+ number of lines to read.
+
+55. If typeof(A) is IStruct_Type, and the corresponding C pointer is
+ NULL, then pushing A will result in pushing NULL. This allows A
+ to be compared to NULL.
+
+56. More optimization of arithmetic operations to improve speed. My
+ tests indicate that the resulting code involving arithmetic
+ operations are about twice as fast as python (1.5) and about 20%
+ faster than perl 5.
+
+57. Patches from Andreas Kraft <kraft at fokus.gmd.de> disabling the
+ listdir intrinsic function if compiled with MSC. Apparantly, the
+ MSC compiler does not support posix functions such as opendir
+ (although other vendors, e.g, Borland, have no problem with this).
+
+58. `array_sort' intrinsic may be used without a comparison function.
+ See docs.
+
+59. Spelling errors in slang.tm corrected by Uichi Katsuta
+ <katsuta at cced.mt.nec.co.jp> (Thanks!).
+
+60. Default install prefix changed from /usr to /usr/local
+
+61. Changes made to SLtt/SLsmg code so that when a color definition is
+ made via, e.g., SLtt_set_color, then the SLsmg interface will be
+ get automatcally notified so that the next SLsmg_refresh will
+ produce the correct colors. In addition, SLsmg_touch_screen added.
+
+62. It is now possible to evaluate S-Lang expressions with the
+ S-Lang preprocessor e.g.,
+
+ #ifeval (_slang_version > 9900) || (x == 1)
+
+63. sl-feat.h: Patch from Jörg Strohmayer <j_s at gmx.de> to define
+ _SLANG_MAP_VTXX_8BIT=1 for AMIGA.
+
+64. New intrinsics:
+ strjoin. This joins elements of a string array.
+ localtime, gmtime
+
+65. New SLsmg function: SLsmg_reinit_smg. Instead of calling
+ SLsmg_reset_smg followed immediately by SLsmg_init_smg when
+ processing SIGWINCH signals, call SLsmg_init_smg instead. This
+ will allow SLsmg based code to properly redraw themselves when
+ running in a SunOS cmdtool window by working around a bug in
+ cmdtool.
+
+===========================================================================
+
+Changes since 1.2.1
+ 1. slcmd.c was not parsing characters in single quotes correctly,
+ e.g., 'a'.
+
+Changes since 1.2.0
+ 1. Oops. A NULL pointer could be referenced in slcmd.c.
+
+Changes since 1.0.3 beta
+
+-1. The SLKeyMap_List_Type structure has been modified to allow the
+ name of the keymap be be an arbitrary length. Unfortunately, this
+ change breaks backward compatibility. So, if you have programs
+ ^^^^^^^^^^^^^^^^^^^^
+ that are dynamically linked to previous BETA versions of 1.0, you
+ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+ will have to recompile those applications!!!
+ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+
+0. The variable SLsmg_Newline_Moves has been renamed to
+ SLsmg_Newline_Behavior with the following interpretation:
+#define SLSMG_NEWLINE_IGNORED	0 /* default */
+#define SLSMG_NEWLINE_MOVES	1 /* moves to next line, column 0 */
+#define SLSMG_NEWLINE_SCROLLS	2 /* moves but scrolls at bottom of screen */
+#define SLSMG_NEWLINE_PRINTABLE	3 /* prints as ^J */
+
+1. Added patches from Joao Luis Fonseca <joaolf at centroin.com.br>
+ to src/mkfiles/makefile.all and a necessary OS/2 specific
+ declaration to slvideo.c. I also added the Watcom patches from
+ Bill McCarthy <WJMc at pobox.com> to makefile.all.
+2. The terminfo code is now aware of the complete set of terminfo
+ definitions. However, the screen management routines support a
+ small subset. (Eric W. Biederman <ebiederm+eric at npwt.net>).
+3. Improvements to the SLsmg scrolling alogorithm.
+4. SLang_process_keystring and SLang_make_keystring now return NULL upon
+ failure.
+5. SLcomplex_sqrt branch cut modifed to be consistent with FORTRAN.
+6. If the system supports vsnprintf and snprintf, they are used. The
+ assumption is that they return EOF upon failure. My linux man page
+ for these functions have conflicting statements regarding this.
+
+7. Simplified handling of memory managed types. Now it is possible to
+ pass the managed object directly to the intrinsic function. See
+ slfile.c for an explicit example of this technique. Similarly,
+ references may also be passed and the function SLang_assign_to_ref
+ may be used to assign values to the referenced object. This is
+ also illustrated in slfile.c.
+
+8. QNX specific tweak to slfile.c from Pavanas Abludo Incusus
+ <pavanas at ccia.com>.
+
+9. Fixed a problem where, e.g.,
+
+ x = Double_Type 7,8,9;
+	y = x0,:,:;
+
+ returned y = Double_Type8*9 instead of the more intuitive result
+ Double_Type8,9;
+
+10. SLcmd_Cmd_Table_Type structure changed to permit an unlimited
+ number of arguments. The changed should be backward compatible
+ except that a recompilation of the application will be necessary.
+11. New SLsmg function: SLsmg_set_color_in_region may be used to set
+ the color of a specified region. See demo/smgtest.c for an
+ example of how this is used. Another use would be to draw shadows
+ around a box.
+12. OS2 ICC patches from Eddie Penninkhof <eddie.penninkhof at tip.nl>.
+13. Grammar tweaked to make the pow (^) operator postfix-unary. This
+ makes more sense mathematically so that:
+
+ a^b^c ==> a^(b^c);
+	-(a)^b ==> -(a^b);
+
+14. New struct specific intrinsics:
+
+ get_struct_field_names
+ get_struct_field_value
+ _push_struct_field_values
+
+ See function reference for more information on these.
+
+Changes since 1.0.2 beta
+0. SLtt_init_video, SLtt_reset_video, SLsmg_resume_smg,
+ SLsmg_suspend_smg have been modifed to return 0 upon success, or -1
+ upon error.
+1. Configure script modified to report slang version as 1.0.x instead
+ of 1.0.0x.
+2. Bug fix involving automatic detection of color (Unix)
+3. slvideo.c bug fixed (WIN32, Thanks Chin Huang <cthuang at vex.net>)
+4. Slsignal modified so that fork is not used for CYGWIN32, suggested
+ by vischne at ibm.net.
+5. Solaris ELF patches integrated into configure.in. Now ELF support
+ is available for Linux and Solaris. Thanks Jan Hlavacek
+ <lahvak at math.ohio-state.edu>.
+6. The library now works with MING32 and should work with CYGWIN as
+ well. See INSTALL.pc and src/mkfiles/README for more information.
+ Do NOT use the configure script under these environments.
+7. A new IBMPC_SYSTEM function added that affects WIN32, MSDOS, and
+ OS/2 systems:
+
+ SLang_getkey_map_to_ansi (int enable);
+
+ If `enable' is non-zero, arrow and function keys will be mapped to
+ the ansi equivalents.
+8. The WIN32 terminal support has been modified to be more consistent with
+ the other platforms. In particular, mouse button press reporting
+ has been added (SLtt_set_mouse_mode), and bright color support
+ appears to have been fixed. Note: For MINGW32 and CYGWIN32, use
+ src/mkfiles/makefile.all. Do not use the Unix configure script
+ because WIN32 is NOT Unix.
+9. Several changes to slvideo.c that deals with the proper use of the
+ scroll region for DOS/Windows type systems.
+10. demo/smgtest.c has been enhanced.
+11. Some cleanup performed to src/slprepr.c
+12. WIN32 and WIN16 preprocessing symbols are defined when appropriate.
+
+Changes since 1.0.1 beta
+1. More VMS patches. Thanks Andy.
+
+Changes since 1.0.0 beta
+1. Fixed a bug in the automatic detection of color terminal
+2. Patches to get it to compile on OS2 and VMS
+3. Replaced \r\n in slarray.c with \n
+
+Changes since 0.99-38
+0. Many, many changes to the interpreter. See documentation.
+
+1. SLang_free_intrinsic_user_object shortened via define on VMS.
+2. Make sure slang.h does not defined REAL_UNIX_SYSTEM on OS/2.
+3. New search paths for termin directories include $HOME/.terminfo and
+ /usr/share/terminfo.
+4. SLsystem function added. This is a replacement for `system'. It
+ implements POSIX semantics for POSIX systems. Although Linux
+ claims to be a POSIX system, it's `system' routine is broken.
+5. color names color0 ... color7, brightcolor0, ... brightcolor7
+ added for Unix and VMS systems.
+
+Changes since 0.99-37
+1. SLang_input_pending returns -1 if Ctrl-Break pressed (DOS specific).
+2. SLtty_VMS_Ctrl_Y_Hook added for Ctrl-Y trapping. Keep in mind that
+ this is called from an AST.
+3. Documentation updates
+4. Fixed bug dealing with keymaps with escape sequences involving
+ characters with the high bit set.
+5. slkeypad code ported to DOS
+6. SLsmg_write_raw and SLsmg_read_raw functions added.
+7. Compilation error under QNX fixed.
+9. Small change involving SLang_flush_input.
+
+Changes since 0.99-36
+1. Oops fixed a bug in alternate character set handling when
+ SLtt_Use_Blink_For_ACS is set. This bug only affected DOSEMU.
+2. slvideo.c modification that affects DJGPP version of library. Now
+ the screen is saved and restored.
+3. Updates to slcurses.c by Michael Elkins.
+4. If a color called `default' is specified, the escape sequence to
+ set the default color will be sent. Be careful, not all terminals
+ support this feature. If your terminal supports it, e.g., rxvt,
+ then using
+
+ setenv COLORFGBG default
+
+ is a good choice.
+
+Changes since 0.99-35
+1. Fixed alt char set bug introduced in 0.99-35.
+2. New intrinsic: _stk_reverse
+3. New demos: keypad, smgtest, pager
+4. The environment variable COLORFGBG may be used to specify default
+ foreground background colors, e.g., in csh use:
+
+ setenv COLORFGBG "white;black"
+
+ to specify white on black as the default colors. This also means
+ that a color name of NULL or the empty string "" will get mapped to
+ the default color.
+5. Improved curses emulation provided by Michael Elkins
+ (me at muddcs.cs.hmc.edu).
+6. Small bug fix to SLang_flush_output provided by Balakrishnan k
+ <MDSAAA27 at giasmd01.vsnl.net.in>.
+7. Updated some documentation in doc/cslang.tex (Gasp).
+8. Update vmsmake.com file provided by Martin P.J. Zinser
+ (m.zinser at gsi.de).
+
+Changes since 0.99-34
+0. OS/2 video problem solved by Rob Biggar (rb14 at cornell.edu).
+
+1. The way the interpreter internally handles strings has changed.
+ This should not affect programs which utilize the library. Now all
+ strings returned by the function SLang_pop_string should be freed
+ after use. The SLang_pop_string function will always set the value
+ of the second parameter passed to it to a non-zero value. For this
+ reason, programs should use the new function SLpop_string and
+ always free the string returned by it after use.
+
+2. If SL_RLINE_NO_ECHO bit is set in the readline structure, the
+ user response will not be echoed.
+
+3. If terminal is xterm, the TERMCAP environment variable will be
+ ignored. This change was necessary because of the braindead
+ TERMCAP setting created by the latest version xterm.
+
+4. Some of the keymap routines were re-coded. Now it is possible to
+ have lowercase characters as part of the prefix character sequence.
+
+5. New modules. See demo/pager.c for information. See also the slrn
+ source code for a more sophisticated use.
+
+ SLscroll: may be useful for routines that deal with displaying
+ linked lists of lines.
+ SLsignal: POSIX signal interface for programs that use SLsmg and
+ SLtt modules. doc/signal.txt may also prove useful.
+ SLkeypad: Simplified interface to SLang keymaps.
+ SLerrno: System independ errno routines
+
+Changes since 0.99-33
+1. A couple of interpreter bug fixes.
+
+2. Some macros, e.g., MEMSET, removed from slang.h. I do not feel
+ that they belong there and it is unlikely that they are used by
+ others. I made them avalable in the file src/jdmacros.h for anyone
+ whose code depends on them.
+
+3. The functions jed_mem??? have been renamed to SLmem???.
+
+4. New intrinsic: _obj_type returns type information about object on top
+ of stack.
+
+Changes since 0.99-32
+1. appropriate header files added for VMS
+2. Oops. 0.99-32 introduced a bug positioning cursor. :(
+
+Changes since 0.99-31
+1. Simple minded curses emulation added. This should help those migrating
+ from curses. See slang/src/curses/*.c for sample curses demo programs
+ that the SLsmg routines can handle. See also slang/src/slcurses.c for
+ some wrapper functions.
+2. Changed <config.h> to "config.h" in all source files.
+3. If system lacks terminfo directories, it is compiled with termcap
+ support. This generalizes and replaces the test for NeXT.
+4. New functions for slang/src/sldisply.c:
+
+ void SLtt_get_screen_size (void);
+ SLtt_Char_Type SLtt_get_color_object (int);
+ void SLtt_set_color_fgbg (int, SLtt_Char_Type, SLtt_Char_Type);
+
+ The first function attempts to deduce the correct values of
+ SLtt_Screen_Rows and SLtt_Screen_Cols. This function is called by
+ sltt_get_terminfo.
+
+ New constants such as SLSMG_COLOR_BLACK, SLSMG_COLOR_RED, ... have been
+ added to slang.h to facilitate the use of SLtt_set_color_fgbg.
+
+5. Improved error messages
+6. ELF support. Do: make elf; make install-elf
+
+Changes since 0.99.30
+
+1. Small bug fixed that affects 64 bit machines with a certain byte
+ ordering.
+2. slutty.c: _POSIX_VDISABLE is used if defined.
+
+Changes since 0.99.29
+
+0. BIG change in handling keymaps. Specifically, this change effects the
+ change of the `f' field of the SLang_Key_Type structure. Before, this
+ was VOID_STAR, now it is a union. The new change is much more portable.
+ In addition, the function `SLang_define_key1' has been removed and
+ replaced by `SLkm_define_key'. See src/slrline.c for the use of this new
+ interface. For a short time, the old interface will be available if the
+ preprocessor symbol `SLKEYMAP_OBSOLETE' is defined when slang is compiled.
+ See jed and slrn source for more examples.
+
+1. SLang_getkey now reads from /dev/tty (unix).
+2. If the first argument to SLang_init_tty is -1, the current value of the
+ interrupt character will not be changed (unix).
+3. New intrinsic: time
+Changes since 0.99.28
+1. Oops! Horrible bug in src/slmemcmp fixed.
+2. slvideo: init_video modified to be more consistent with VMS/Unix routine.
+
+Changes since 0.99.27
+1. More changes to the configure script
+2. It looks like hpterm support is in place. This terminal has a glitch
+ that prevents efficient screen updating.
+3. New SLsmg function:
+
+ void SLsmg_write_color_chars (unsigned short *s, unsigned int len)
+
+ This function may be used to write a string of characters with
+ attributes.
+
+Changes since 0.99.26
+1. Slang now uses a configure script under Unix to configure itself.
+2. New intrinsic functions include _stk_roll, strchop, strchopr.
+3. Terminals which require an escape sequence to make their arrow keys work
+ are now sent the escape sequence.
+
+Changes since 0.99.25
+1. New SLsmg variables:
+ SLsmg_Newline_Moves
+ SLsmg_Backspace_Moves
+ These variables control the interpretation of newline and backspace
+ characters in smg.
+
+Changes since 0.99.24
+1. SLSMG_RTEE_CHAR, etc... added to OS/2 part of slang.h
+2. Small fix for aix-term
+
+Changes since 0.99.23
+0. The makefile for unix has been completely re-written.
+1. Some problems dealing with certain color terminals have been resolved.
+2. `g' generic type added to SLcmd.
+
+Changes since 0.99.22
+0. The Macro `VOID' has been removed. The whole point of this macro was to
+ mimick `void *' declarations for compilers that did not support such a
+ construct. Instead of `VOID *', slang.h now defines `VOID_STAR' and all
+ `VOID *' declarations have been renamed to `VOID_STAR'.
+
+ If you use the VOID macro in your application, you have two choices:
+
+ 1. Rename all occurances of VOID * to VOID_STAR
+ 2. Add: #define VOID void somewhere appropriate.
+
+1. \< and \> regular expressions added.
+
+Changes since 0.99.21
+1. Oops. I added too much linux stuff (see 3 below). Some of it backed
+ out to Linux only.
+
+Changes since 0.99.20
+1. Problem on some VMS systems which lack prototype for atof fixed.
+2. New function: SLtt_set_mouse_mode. This is used to turn on/off mouse
+ reporting on Unix and VMS systems.
+3. The terminal type `linux' is now recognized by the SLtt interface---
+ even if there is no termcap/terminfo entry for it.
+
+Changes since 0.99.19
+1. User definable types must now have object identification numbers larger
+ than 127. The lower limit used to be 100 but this comflicts with many
+ applications (as well as slang itself) using lower case letters as the
+ object number, e.g., create_array ('s', 10, 1); which creates an array
+ of 10 strings (object number 's' = 115).
+
+2. New intrinsic: array_info available.
+3. regular expression matching bug involving \{m,n\} expressions fixed.
+4. New module: slprepr.c. This gives programs the ability to use the slang
+ preprocessor.
+5. News slsmg functions: SLsmg_suspend_smg () and SLsmg_resume_smg ().
+ These are designed to be used before and after suspension. The SLsmg
+ state is remembered and a redraw is performed by the resume_smg function.
+6. The function `sltty_set_suspend_state' is now available for Unix
+ systems. It may be used to turn on/off processing of the suspend
+ character by the terminal driver.
+7. If SLtt_Try_Termcap is 0, the TERMCAP variable will not be parsed.
+8. SLang_TT_Read_FD variable is now available for unix. This is the file
+ descriptor used by SLang_getkey.
+9. New preprocessor symbols available:
+ SLMATH : If math functions are available
+ SLUNIX : If unix system calls are available
+ SLFILES : Stdio functions available
+ FLOAT_TYPE : Floating point version
+
+Changes since 0.99.18
+1. New intrinsic function: strcompress. This collapses a string by removing
+ repeated characters. For example,
+
+ define collapse (f)
+	 {
+	 while (str_replace (f, " ", ",")) f = ();
+	 return strcompress (f, ",");
+	 }
+
+ collapse (", ,a b c ,,,d e,f ");
+
+ returns: "a,b,c,d,e,f"
+
+2. QNX support added.
+3. New Functions (unix only): SLtt_tgetstr, SLtt_tgetnum, SLtt_tgetflag.
+4. Fixed parsing of Octal and Hex numbers so that incorrect values are
+ flagged as errors. Also, both lower and uppercase values may be used in
+ HEX numbers, e.g., 0xa == 0XA == 0Xa == 0xA.
+5. MS-Windows support added. Compile using makefile.msw. This creates
+ `wslang.lib'.
+6. New SLsmg functions: SLsmg_get_row, SLsmg_get_column. These return the
+ current position.
+
+Changes since 0.99.17
+1. I have added limited termcap support although slang is still a terminfo
+ based system. The support is provided via the TERMCAP environment
+ variable. If this variable exists and contains a termcap entry for which
+ there is no reference to another entry (via tc field), it will be used
+ to setup the terminal. If the TERMCAP variable does not exist, or it
+ refers to a file, terminfo is used instead. This is not really a
+ limitation since one can set this variable in a way that slang likes by
+ using `tset -s'.
+
+ The motivation for this support is two-fold:
+ a. Slang programs can now run inside the screen program which sets
+ the TERMCAP variable appropriately.
+ b. A user can now correct defective termcap entries (e.g., for Linux),
+ and have those corrections made available to slang via the `tset'
+	 command, e.g., by putting something analogous to:
+
+	 setenv TERMCAP /corrected/termcap/file/absolute/path/name
+	 eval `tset -s terminal-name`
+
+	 in the .login file.
+ c. This also means that I can distribute corrected termcap entries for
+ common terminals.
+
+Changes since 0.99.16
+1. Inadequate terminfo entries for `linux' terminal are compensated for.
+2. Terminals with the ``Magic cookie glitch'' are flagged as having an
+ unusable highlighting mode.
+
+changes since 0.99.15
+1. Better checking of parameters passed to search routines.
+2. Problem with line drawing characters fixed.
+
+changes since 0.99.14
+1. Ran code through purify. Fixed one problem reported in slkeymap.c
+2. Fixed a bug in sldisply.c regarding mono-attributes.
+3. Code ready for ELF
+changes since 0.99.13
+1. SLtt_Has_Alt_Charset variable added to xterm.c. This is motivated by the
+ sad, pathetic fact that although some termcap/terminfo databases suggest
+ that the terminal can do line drawing characters, the terminal cannot.
+2. SLsmg_write_nstring function added. This function may be used to write
+ only n characters of a string padding wit hblanks if necessary.
+3. If the environment variable COLORTERM exist, SLtt_get_terminfo will set
+ SLtt_Use_Ansi_Colors to 1.
+4. Sltt_set_cursor_visibility function added. If passed a zero integer value,
+ the cursor is hidden; otherwise, it is made visible.
+
+changes since 0.99.12
+1. SLsmg now uses the `te' and `ti' termcap entries if present. Apparantly
+ some terminals need to be put in cursor addressing mode. This also has
+ the effect of restoring the screen of the xterm to what it was before
+ the program was executed.
+2. For some types of code, slang is 20% faster! This is especially
+ noticeable for branching constructs inside tight loops or recursive
+ functions.
+
+changes since 0.99.10
+1. New version control added:
+
+ A new preprocessor symbol was added: SLANG_VERSION
+ This is a 6 digit integer of the form: abcdef
+ This corresponds to version number ab.cd.ef. So for version 0.99.11:
+ #define SLANG_VERSION 9911
+
+ In addition, the intrinsic variable `SLang_Version' was changed from a
+ string to an integer that has the value SLANG_VERSION. This also implies
+ that the interpreter variable _slang_version is now an integer.
+
+changes since 0.99.9
+1. The terminfo code failed to recognize the automatic margin flag. This
+ has been corrected. In addition, the display code nolonger resets the
+ character set upon initialization. This is considered to be a good thing.
+
+2. There is a new program in slang/doc called `texconv' that will produce a
+ nicely formatted ascii document from the tex formatted ones. In
+ addition, new documentation has been added: slang.tex which describes the
+ syntax of the slang programming language and cslang.tex which describes
+ the C interface to the library. The latter document is far from complete
+ but it is a start.
+
+3. A new variable declaration keyword has beed added: global_variable
+ This keyword is useful for declaring global variables from within
+ functions. Such a feature simplifies some scripts.
+
+4. The SLsmg line drawing functions are now in place.
+
+changes since 0.99.8
+1. \d may now be used in regular expressions to specify a digit. In addition,
+ \e specifies an escape character. So for example, `\e\\d;\dH' matches
+ an ANSI cursor position escape sequence.
+2. Small bug in dealing with terminals that have automatic margins has been
+ fixed.
+3. When compiled with -DSLANG_TERMINFO will use terminfo. This means that
+ there is no need to link to termcap.
+
+changes since 0.99.7
+1. New function added to the readline package:
+ int SLang_rline_insert (char *s);
+ this may be used to stuff strings into the rline buffer. SLSC exploits
+ this feature.
+
+changes since 0.99.6
+
+1. ALL macros beginning with LANG have been changed to use SLANG as the
+ prefix. For example, the macro LANG_IVARIABLE has been renamed to
+ SLANG_IVARIABLE. If you have used one of these macros, please make the
+ change.
+
+2. Application defined types. See demo/complex.c for an example that
+ defines complex numbers and overloads the binary and unary operators to
+ work with them.
+
+changes since 0.99.5
+
+1. New interface for application defined objects. Functions include:
+
+ extern SLuser_Object_Type *SLang_pop_user_object (unsigned char);
+ extern void SLang_free_user_object (SLuser_Object_Type *);
+ extern void SLang_push_user_object (SLuser_Object_Type *);
+ extern SLuser_Object_Type *SLang_create_user_object (unsigned char type);
+
+ This means that S-Lang scripts do not have to worry about freeing
+ structures, arrays, etc... A consequence of this fact is that the
+ intrinsic function `free_array' has been removed. See examples of this
+ exciting new feature in slang/demo.
+
+2. Better documentation and examples. See slang/doc/*.* as well as examples
+ in slang/demo.
+
+3. Memory allocation macros have changed from MALLOC to SLMALLOC, etc...
+ Applications are encouraged to use these rather than `malloc' because by
+ compiling your application AND the slang library with the -DMALLOC_DEBUG
+ will link in code that checks if you have corrupted memory, freed
+ something twice, etc... Use the function `SLmalloc_dump_statistics' for
+ a report of memory consumption by your program.
+
+changes since 0.99.4
+1. cleaned up the source some and I changed the names of the hooks
+ user_whatever to `SLang_User_Whatever'. This makes them more consistent
+ with other external functions and variables and helps avoid name space
+ pollution.
+changes since 0.99.3
+* added screen management stuff
+* added a new help file reader (see help directory)
+* DOUBLE precision is now the default. I think that this makes more sense
+ for an interpreted langauge.
+* searching routines added.
+changes since 0.99.2
+* added low level tty support for VMS, DOS, and Unix
+* slang readline added
+* keymap support
+* files restructured so that programs can link, say, the readline library
+ and not get the whole interpreter linked in.
+
+changes since 0.99.1
+* obscure bug in regular expression fixed
+* optimizing performed for 10% speed increase in speed for some language
+ constructs
+
+changes since 0.99.0
+* semantics of the `switch' statement changed to be more C-like with the
+ addition of the `case' keyword. For example, one can write:
+
+ switch (ch)
+	{ case 'A':
+	 something ();
+	}
+	{
+	 case 'B':
+	 something_else ();
+	}
+	{ case 3.14:
+	 print ("Almost PI");
+	}
+	{ case "hello":
+	 print ("hi");
+	}
+
+ Note that one may mix data types without the possibility of a type
+ mismatch error.
+
+changes since 0.98:
+* matrix package added. Currently only matrix multiplication and addition
+ is supported. More functions will be added (determinants, inverse, etc..)
+ This support is provided by the `init_SLmatrix ()' call. This support
+ provides the following S-Lang intrinsics:
+
+ matrix_multiply, matrix_add
+
+* New S-Lang core intrinsic:
+
+ copy_array : copys the contents of one array to another
+
+changes since 0.97:
+
+* Double precision floating point supported.
+ Use the -DFLOAT_TYPE -DUSE_DOUBLE compiler flags to enable this.
+ Note that S-Lang does not support single precision and double precision
+ floating point number SIMULTANEOUSLY. You must choose one or the other
+ and stick with it!
+
+* Byte compiling is now more than simple preprocessing. This results in
+ about a 20% decrease in loading time. This also means that if you
+ rebuild your application, you MUST re-bytecompile.
+
+* New syntax added: Consider a function f that returns multiple values.
+ Then to assign these values to, say var_1, and var_2, simply write:
+
+ (var_1, var_2) = f ();
+
+ This is an alternative to:
+
+ f (); =var_2; =var_1;
+
+Changes since 0.96:
+
+ It is now possible to use short circuit boolean evaluation of logical
+ expressions is the `orelse' and `andelse' constructs. Previously, these
+ constructs were only available at the infix level. The new syntax looks
+ like (example taken from JED's rmail.sl):
+
+ if (orelse
+	 {re_bsearch("^\\CFrom:.*<\$.+\$>");}
+	 {re_bsearch("^\\CReply-To: *\$^ +\$ *");}
+	 {re_bsearch("^\\CFrom:.*<\$.+\$>");}
+	 {re_bsearch("^\\CFrom: *\$^ +\$ *");}
+	 {re_bsearch("^\\cFrom +\$^ +\$ *");}
+ )
+ {
+	from = rmail_complex_get_from(from);
+ }
+
+ Modified some of the array code to use handles to arrays instead of actual
+ arrays. This adds alot more protection for the use of arrays. The
+ downside is that there is a limit on the number of active arrays. This
+ limit has been set to a default value ot 256. An ``active'' array is an
+ array that has been created but not freed.
+
+ Fixed a parse error that occurred when an `if' statement imediately follow
+ the `:' in a switch statement.
+
+ putenv intrinsic added.
+
+ EXIT_BLOCK: if an exit block is declared, it is called just before the
+ function returns to its caller.
+
+It is now possible to perform assignments in variable declaration
+statements, e.g.,
+
+variable i = 0, imax = 10, n = strlen (name);
+
+Condition compilation of S-Lang source possible. See .sl files in the jed
+distribution.
+
+A bug which prevent assignment to a global C floating point variable was
+fixed.
+
+Changes to `calc':
+
+ `apropos' function added to calc.sl. For example, `apropos("str")'
+ creates a list of all intrinsic functions that contain the substring
+ "str" (strcmp, strcat, etc...)
+
+ Command line arguments are now loaded as S-Lang source files. This makes
+ it possible to create a Unix executable such as:
+
+ #! /usr/local/bin/calc
+
+	 define hello_world () { print ("hello world"); }
+	 loop (10) hello_world ();
+	 quit ();
+}}}

_service:tar_scm:slang-2.3.2.tar.bz2/configure Added

@@ -0,0 +1,10014 @@
+#! /bin/sh
+# Guess values for system-dependent variables and create Makefiles.
+# Generated by GNU Autoconf 2.69.
+#
+#
+# Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc.
+#
+#
+# This configure script is free software; the Free Software Foundation
+# gives unlimited permission to copy, distribute and modify it.
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+ emulate sh
+ NULLCMD=:
+ # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+ # is contrary to our usage. Disable this feature.
+ alias -g '${1+"$@"}'='"$@"'
+ setopt NO_GLOB_SUBST
+else
+ case `(set -o) 2>/dev/null` in #(
+ *posix*) :
+ set -o posix ;; #(
+ *) :
+ ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+ as_echo='print -r --'
+ as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+ as_echo='printf %s\n'
+ as_echo_n='printf %s'
+else
+ if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+ as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+ as_echo_n='/usr/ucb/echo -n'
+ else
+ as_echo_body='eval expr "X$1" : "X\$.*\$"'
+ as_echo_n_body='eval
+ arg=$1;
+ case $arg in #(
+ *"$as_nl"*)
+	expr "X$arg" : "X\$.*\$$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\$.*\$"`;;
+ esac;
+ expr "X$arg" : "X\$.*\$" | tr -d "$as_nl"
+ '
+ export as_echo_n_body
+ as_echo_n='sh -c $as_echo_n_body as_echo'
+ fi
+ export as_echo_body
+ as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+ PATH_SEPARATOR=:
+ (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+ (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+ PATH_SEPARATOR=';'
+ }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order. Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are. Look in the path if we contain no directory separator.
+as_myself=
+case $0 in #((
+ *\\/* ) as_myself=$0 ;;
+ *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+ done
+IFS=$as_save_IFS
+
+ ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+ as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+ $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+ exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there. '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+# Use a proper internal environment variable to ensure we don't fall
+ # into an infinite loop, continuously re-executing ourselves.
+ if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then
+ _as_can_reexec=no; export _as_can_reexec;
+ # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in # ((((
+ *v*x* | *x*v* ) as_opts=-vx ;;
+ *v* ) as_opts=-v ;;
+ *x* ) as_opts=-x ;;
+ * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+as_fn_exit 255
+ fi
+ # We don't want this to propagate to other subprocesses.
+ { _as_can_reexec=; unset _as_can_reexec;}
+if test "x$CONFIG_SHELL" = x; then
+ as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :
+ emulate sh
+ NULLCMD=:
+ # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which
+ # is contrary to our usage. Disable this feature.
+ alias -g '\${1+\"\$@\"}'='\"\$@\"'
+ setopt NO_GLOB_SUBST
+else
+ case \`(set -o) 2>/dev/null\` in #(
+ *posix*) :
+ set -o posix ;; #(
+ *) :
+ ;;
+esac
+fi
+"
+ as_required="as_fn_return () { (exit \$1); }
+as_fn_success () { as_fn_return 0; }
+as_fn_failure () { as_fn_return 1; }
+as_fn_ret_success () { return 0; }
+as_fn_ret_failure () { return 1; }
+
+exitcode=0
+as_fn_success || { exitcode=1; echo as_fn_success failed.; }
+as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }
+as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }
+as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }
+if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then :
+
+else
+ exitcode=1; echo positional parameters were not saved.
+fi
+test x\$exitcode = x0 || exit 1
+test -x / || exit 1"
+ as_suggested=" as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO
+ as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO
+ eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" &&
+ test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1
+test \$(( 1 + 1 )) = 2 || exit 1"
+ if (eval "$as_required") 2>/dev/null; then :
+ as_have_required=yes
+else
+ as_have_required=no
+fi
+ if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then :
+
+else
+ as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+as_found=false
+for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ as_found=:
+ case $as_dir in #(
+	 /*)
+	 for as_base in sh bash ksh sh5; do
+	 # Try only shells that exist, to save several forks.
+	 as_shell=$as_dir/$as_base
+	 if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
+		 { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then :
+ CONFIG_SHELL=$as_shell as_have_required=yes
+		 if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then :
+ break 2
+fi
+fi
+	 done;;
+ esac
+ as_found=false
+done
+$as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } &&
+	 { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then :
+ CONFIG_SHELL=$SHELL as_have_required=yes
+fi; }
+IFS=$as_save_IFS
+
+
+ if test "x$CONFIG_SHELL" != x; then :
+ export CONFIG_SHELL
+ # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in # ((((
+ *v*x* | *x*v* ) as_opts=-vx ;;
+ *v* ) as_opts=-v ;;
+ *x* ) as_opts=-x ;;
+ * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+exit 255
+fi
+
+ if test x$as_have_required = xno; then :
+ $as_echo "$0: This script requires a shell more modern than all"
+ $as_echo "$0: the shells that I found on your system."
+ if test x${ZSH_VERSION+set} = xset ; then
+ $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should"
+ $as_echo "$0: be upgraded to zsh 4.3.4 or later."
+ else
+ $as_echo "$0: Please tell bug-autoconf@gnu.org about your system,
+$0: including any error possibly output before this
+$0: message. Then install a modern shell, or manually run
+$0: the script under such a shell if you do have one."
+ fi
+ exit 1
+fi
+fi
+fi
+SHELL=${CONFIG_SHELL-/bin/sh}
+export SHELL
+# Unset more variables known to interfere with behavior of common tools.
+CLICOLOR_FORCE= GREP_OPTIONS=
+unset CLICOLOR_FORCE GREP_OPTIONS
+
+## --------------------- ##
+## M4sh Shell Functions. ##
+## --------------------- ##
+# as_fn_unset VAR
+# ---------------
+# Portably unset VAR.
+as_fn_unset ()
+{
+ { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+
+# as_fn_set_status STATUS
+# -----------------------
+# Set $? to STATUS, without forking.
+as_fn_set_status ()
+{
+ return $1
+} # as_fn_set_status
+
+# as_fn_exit STATUS
+# -----------------
+# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+ set +e
+ as_fn_set_status $1
+ exit $1
+} # as_fn_exit
+
+# as_fn_mkdir_p
+# -------------
+# Create "$as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+ case $as_dir in #(
+ -*) as_dir=./$as_dir;;
+ esac
+ test -d "$as_dir" || eval $as_mkdir_p || {
+ as_dirs=
+ while :; do
+ case $as_dir in #(
+ *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+ *) as_qdir=$as_dir;;
+ esac
+ as_dirs="'$as_qdir' $as_dirs"
+ as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X$.*^/$//*^/^/*/*$' \| \
+	 X"$as_dir" : 'X$//$^/' \| \
+	 X"$as_dir" : 'X$//$$' \| \
+	 X"$as_dir" : 'X$/$' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+ sed '/^X$.*^/$\/\/*^/^/*\/*$/{
+	 s//\1/
+	 q
+	 }
+	 /^X$\/\/$^/.*/{
+	 s//\1/
+	 q
+	 }
+	 /^X$\/\/$$/{
+	 s//\1/
+	 q
+	 }
+	 /^X$\/$.*/{
+	 s//\1/
+	 q
+	 }
+	 s/.*/./; q'`
+ test -d "$as_dir" && break
+ done
+ test -z "$as_dirs" || eval "mkdir $as_dirs"
+ } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} # as_fn_mkdir_p
+
+# as_fn_executable_p FILE
+# -----------------------
+# Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+ test -f "$1" && test -x "$1"
+} # as_fn_executable_p
+# as_fn_append VAR VALUE
+# ----------------------
+# Append the text in VALUE to the end of the definition contained in VAR. Take
+# advantage of any shell optimizations that allow amortized linear growth over
+# repeated appends, instead of the typical quadratic growth present in naive
+# implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+ eval 'as_fn_append ()
+ {
+ eval $1+=\$2
+ }'
+else
+ as_fn_append ()
+ {
+ eval $1=\$$1\$2
+ }
+fi # as_fn_append
+
+# as_fn_arith ARG...
+# ------------------
+# Perform arithmetic evaluation on the ARGs, and store the result in the
+# global $as_val. Take advantage of shells that can avoid forks. The arguments
+# must be portable across $(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+ eval 'as_fn_arith ()
+ {
+ as_val=$(( $* ))
+ }'
+else
+ as_fn_arith ()
+ {
+ as_val=`expr "$@" || test $? -eq 1`
+ }
+fi # as_fn_arith
+
+
+# as_fn_error STATUS ERROR LINENO LOG_FD
+# ----------------------------------------
+# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+# script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+ as_status=$1; test $as_status -eq 0 && as_status=1
+ if test "$4"; then
+ as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+ $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+ fi
+ $as_echo "$as_me: error: $2" >&2
+ as_fn_exit $as_status
+} # as_fn_error
+
+if expr a : '$a$' >/dev/null 2>&1 &&
+ test "X`expr 00001 : '.*$...$'`" = X001; then
+ as_expr=expr
+else
+ as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+ as_basename=basename
+else
+ as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+ as_dirname=dirname
+else
+ as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/$^/^/*$/*$' \| \
+	 X"$0" : 'X$//$$' \| \
+	 X"$0" : 'X$/$' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+ sed '/^.*\/$^/^/*$\/*$/{
+	 s//\1/
+	 q
+	 }
+	 /^X\/$\/\/$$/{
+	 s//\1/
+	 q
+	 }
+	 /^X\/$\/$.*/{
+	 s//\1/
+	 q
+	 }
+	 s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+
+ as_lineno_1=$LINENO as_lineno_1a=$LINENO
+ as_lineno_2=$LINENO as_lineno_2a=$LINENO
+ eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" &&
+ test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || {
+ # Blame Lee E. McMahon (1931-1989) for sed's syntax. :-)
+ sed -n '
+ p
+ /$LINENO/=
+ ' <$as_myself |
+ sed '
+ s/$LINENO.*/&-/
+ t lineno
+ b
+ :lineno
+ N
+ :loop
+ s/$LINENO$^'$as_cr_alnum'_.*\n$$.*$/\2\1\2/
+ t loop
+ s/-\n.*//
+ ' >$as_me.lineno &&
+ chmod +x "$as_me.lineno" ||
+ { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; }
+
+ # If we had to re-execute with $CONFIG_SHELL, we're ensured to have
+ # already done that, so ensure we don't try to do so again and fall
+ # in an infinite loop. This has already happened in practice.
+ _as_can_reexec=no; export _as_can_reexec
+ # Don't try to exec as it changes $0, causing all sort of problems
+ # (the dirname of $0 is not the place where we might find the
+ # original and so on. Autoconf is especially sensitive to this).
+ . "./$as_me.lineno"
+ # Exit status is that of the last command.
+ exit
+}
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in #(((((
+-n*)
+ case `echo 'xy\c'` in
+ *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+ xy) ECHO_C='\c';;
+ *) echo `echo ksh88 bug on AIX 6.1` > /dev/null
+ ECHO_T='	';;
+ esac;;
+*)
+ ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+ rm -f conf$$.dir/conf$$.file
+else
+ rm -f conf$$.dir
+ mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+ if ln -s conf$$.file conf$$ 2>/dev/null; then
+ as_ln_s='ln -s'
+ # ... but there are two gotchas:
+ # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+ # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+ # In both cases, we have to default to `cp -pR'.
+ ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+ as_ln_s='cp -pR'
+ elif ln conf$$.file conf$$ 2>/dev/null; then
+ as_ln_s=ln
+ else
+ as_ln_s='cp -pR'
+ fi
+else
+ as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+if mkdir -p . 2>/dev/null; then
+ as_mkdir_p='mkdir -p "$as_dir"'
+else
+ test -d ./-p && rmdir ./-p
+ as_mkdir_p=false
+fi
+
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%^_$as_cr_alnum%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%^_$as_cr_alnum%_%g'"
+
+
+test -n "$DJDIR" || exec 7<&0 </dev/null
+exec 6>&1
+
+# Name of the host.
+# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status,
+# so uname gets run too.
+ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`
+
+#
+# Initializations.
+#
+ac_default_prefix=/usr/local
+ac_clean_files=
+ac_config_libobj_dir=.
+LIBOBJS=
+cross_compiling=no
+subdirs=
+MFLAGS=
+MAKEFLAGS=
+
+# Identity of this package.
+PACKAGE_NAME=
+PACKAGE_TARNAME=
+PACKAGE_VERSION=
+PACKAGE_STRING=
+PACKAGE_BUGREPORT=
+PACKAGE_URL=
+
+ac_unique_file="src/slang.c"
+ac_default_prefix="/usr/local"
+
+# Factoring default headers for most tests.
+ac_includes_default="\
+#include <stdio.h>
+#ifdef HAVE_SYS_TYPES_H
+# include <sys/types.h>
+#endif
+#ifdef HAVE_SYS_STAT_H
+# include <sys/stat.h>
+#endif
+#ifdef STDC_HEADERS
+# include <stdlib.h>
+# include <stddef.h>
+#else
+# ifdef HAVE_STDLIB_H
+# include <stdlib.h>
+# endif
+#endif
+#ifdef HAVE_STRING_H
+# if !defined STDC_HEADERS && defined HAVE_MEMORY_H
+# include <memory.h>
+# endif
+# include <string.h>
+#endif
+#ifdef HAVE_STRINGS_H
+# include <strings.h>
+#endif
+#ifdef HAVE_INTTYPES_H
+# include <inttypes.h>
+#endif
+#ifdef HAVE_STDINT_H
+# include <stdint.h>
+#endif
+#ifdef HAVE_UNISTD_H
+# include <unistd.h>
+#endif"
+
+ac_subst_vars='LTLIBOBJS
+LIBOBJS
+slang_version
+slang_micro_version
+slang_minor_version
+slang_major_version
+PROGRAM_ELFOBJECTS
+PROGRAM_OBJECTS
+PROGRAM_HFILES
+PROGRAM_CFILES
+PROGRAM_OFILES
+SYSCONF_MODULE
+ICONV_MODULE
+ICONV_INC_DIR
+ICONV_LIB_DIR
+ICONV_INC
+ICONV_LIB
+ZLIB_MODULE
+Z_INC_DIR
+Z_LIB_DIR
+Z_INC
+Z_LIB
+PNG_MODULE
+PNG_INC_DIR
+PNG_LIB_DIR
+PNG_INC
+PNG_LIB
+ONIG_MODULE
+ONIG_INC_DIR
+ONIG_LIB_DIR
+ONIG_INC
+ONIG_LIB
+PCRE_MODULE
+PCRE_INC_DIR
+PCRE_LIB_DIR
+PCRE_INC
+PCRE_LIB
+ELFDIR
+OBJDIR
+SRCDIR
+MISC_TERMINFO_DIRS
+TERMCAP
+nc5config
+M_LIB
+SLANG_DLL_CFLAGS
+ELFLIB_BUILD_NAME
+INSTALL_ELFLIB_TARGET
+INSTALL_MODULE
+DLL_IMPLIB_NAME
+SLANG_LIB_FOR_MODULES
+ELFLIB_MAJOR_MINOR_MICRO
+ELFLIB_MAJOR_MINOR
+ELFLIB_MAJOR
+ELFLIB
+CC_SHARED
+CC_SHARED_FLAGS
+DYNAMIC_LINK_FLAGS
+ELF_DEP_LIBS
+ELF_LINK_CMD
+ELF_LINK
+ELF_CFLAGS
+ELF_CC
+DYNAMIC_LINK_LIB
+X_EXTRA_LIBS
+X_LIBS
+X_PRE_LIBS
+X_CFLAGS
+XMKMF
+LIB_SLSYSWRAP
+DSLSYSWRAP
+LIB_READLINE
+GNU_READLINE
+TERMINFO_LAYOUT
+pkgconfigdir
+INSTALL_DATA
+INSTALL_SCRIPT
+INSTALL_PROGRAM
+RANLIB
+SET_MAKE
+EGREP
+GREP
+CPP
+OBJEXT
+EXEEXT
+ac_ct_CC
+CPPFLAGS
+LDFLAGS
+CFLAGS
+CC
+CONFIG_DIR
+host_os
+host_vendor
+host_cpu
+host
+build_os
+build_vendor
+build_cpu
+build
+target_alias
+host_alias
+build_alias
+LIBS
+ECHO_T
+ECHO_N
+ECHO_C
+DEFS
+mandir
+localedir
+libdir
+psdir
+pdfdir
+dvidir
+htmldir
+infodir
+docdir
+oldincludedir
+includedir
+localstatedir
+sharedstatedir
+sysconfdir
+datadir
+datarootdir
+libexecdir
+sbindir
+bindir
+program_transform_name
+prefix
+exec_prefix
+PACKAGE_URL
+PACKAGE_BUGREPORT
+PACKAGE_STRING
+PACKAGE_VERSION
+PACKAGE_TARNAME
+PACKAGE_NAME
+PATH_SEPARATOR
+SHELL
+RPATH'
+ac_subst_files=''
+ac_user_opts='
+enable_option_checking
+with_pkgconfigdir
+with_terminfo
+with_readline
+with_slsyswrap
+with_x
+enable_largefile
+enable_warnings
+with_pcre
+with_pcrelib
+with_pcreinc
+with_onig
+with_oniglib
+with_oniginc
+with_png
+with_pnglib
+with_pnginc
+with_z
+with_zlib
+with_zinc
+with_iconv
+with_iconvlib
+with_iconvinc
+'
+ ac_precious_vars='build_alias
+host_alias
+target_alias
+CC
+CFLAGS
+LDFLAGS
+LIBS
+CPPFLAGS
+CPP
+XMKMF'
+
+
+# Initialize some variables set by options.
+ac_init_help=
+ac_init_version=false
+ac_unrecognized_opts=
+ac_unrecognized_sep=
+# The variables have the same names as the options, with
+# dashes changed to underlines.
+cache_file=/dev/null
+exec_prefix=NONE
+no_create=
+no_recursion=
+prefix=NONE
+program_prefix=NONE
+program_suffix=NONE
+program_transform_name=s,x,x,
+silent=
+site=
+srcdir=
+verbose=
+x_includes=NONE
+x_libraries=NONE
+
+# Installation directory options.
+# These are left unexpanded so users can "make install exec_prefix=/foo"
+# and all the variables that are supposed to be based on exec_prefix
+# by default will actually change.
+# Use braces instead of parens because sh, perl, etc. also accept them.
+# (The list follows the same order as the GNU Coding Standards.)
+bindir='${exec_prefix}/bin'
+sbindir='${exec_prefix}/sbin'
+libexecdir='${exec_prefix}/libexec'
+datarootdir='${prefix}/share'
+datadir='${datarootdir}'
+sysconfdir='${prefix}/etc'
+sharedstatedir='${prefix}/com'
+localstatedir='${prefix}/var'
+includedir='${prefix}/include'
+oldincludedir='/usr/include'
+docdir='${datarootdir}/doc/${PACKAGE}'
+infodir='${datarootdir}/info'
+htmldir='${docdir}'
+dvidir='${docdir}'
+pdfdir='${docdir}'
+psdir='${docdir}'
+libdir='${exec_prefix}/lib'
+localedir='${datarootdir}/locale'
+mandir='${datarootdir}/man'
+
+ac_prev=
+ac_dashdash=
+for ac_option
+do
+ # If the previous option needs an argument, assign it.
+ if test -n "$ac_prev"; then
+ eval $ac_prev=\$ac_option
+ ac_prev=
+ continue
+ fi
+
+ case $ac_option in
+ *=?*) ac_optarg=`expr "X$ac_option" : '^=*=$.*$'` ;;
+ *=) ac_optarg= ;;
+ *) ac_optarg=yes ;;
+ esac
+
+ # Accept the important Cygnus configure options, so we can diagnose typos.
+
+ case $ac_dashdash$ac_option in
+ --)
+ ac_dashdash=yes ;;
+
+ -bindir | --bindir | --bindi | --bind | --bin | --bi)
+ ac_prev=bindir ;;
+ -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)
+ bindir=$ac_optarg ;;
+
+ -build | --build | --buil | --bui | --bu)
+ ac_prev=build_alias ;;
+ -build=* | --build=* | --buil=* | --bui=* | --bu=*)
+ build_alias=$ac_optarg ;;
+
+ -cache-file | --cache-file | --cache-fil | --cache-fi \
+ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)
+ ac_prev=cache_file ;;
+ -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \
+ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)
+ cache_file=$ac_optarg ;;
+
+ --config-cache | -C)
+ cache_file=config.cache ;;
+
+ -datadir | --datadir | --datadi | --datad)
+ ac_prev=datadir ;;
+ -datadir=* | --datadir=* | --datadi=* | --datad=*)
+ datadir=$ac_optarg ;;
+
+ -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \
+ | --dataroo | --dataro | --datar)
+ ac_prev=datarootdir ;;
+ -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \
+ | --dataroot=* | --dataroo=* | --dataro=* | --datar=*)
+ datarootdir=$ac_optarg ;;
+
+ -disable-* | --disable-*)
+ ac_useropt=`expr "x$ac_option" : 'x-*disable-$.*$'`
+ # Reject names that are not valid shell variable names.
+ expr "x$ac_useropt" : ".*^-+._$as_cr_alnum" >/dev/null &&
+ as_fn_error $? "invalid feature name: $ac_useropt"
+ ac_useropt_orig=$ac_useropt
+ ac_useropt=`$as_echo "$ac_useropt" | sed 's/-+./_/g'`
+ case $ac_user_opts in
+ *"
+"enable_$ac_useropt"
+"*) ;;
+ *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+ esac
+ eval enable_$ac_useropt=no ;;
+
+ -docdir | --docdir | --docdi | --doc | --do)
+ ac_prev=docdir ;;
+ -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)
+ docdir=$ac_optarg ;;
+
+ -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)
+ ac_prev=dvidir ;;
+ -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)
+ dvidir=$ac_optarg ;;
+
+ -enable-* | --enable-*)
+ ac_useropt=`expr "x$ac_option" : 'x-*enable-$^=*$'`
+ # Reject names that are not valid shell variable names.
+ expr "x$ac_useropt" : ".*^-+._$as_cr_alnum" >/dev/null &&
+ as_fn_error $? "invalid feature name: $ac_useropt"
+ ac_useropt_orig=$ac_useropt
+ ac_useropt=`$as_echo "$ac_useropt" | sed 's/-+./_/g'`
+ case $ac_user_opts in
+ *"
+"enable_$ac_useropt"
+"*) ;;
+ *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+ esac
+ eval enable_$ac_useropt=\$ac_optarg ;;
+
+ -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \
+ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \
+ | --exec | --exe | --ex)
+ ac_prev=exec_prefix ;;
+ -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \
+ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \
+ | --exec=* | --exe=* | --ex=*)
+ exec_prefix=$ac_optarg ;;
+
+ -gas | --gas | --ga | --g)
+ # Obsolete; use --with-gas.
+ with_gas=yes ;;
+
+ -help | --help | --hel | --he | -h)
+ ac_init_help=long ;;
+ -help=r* | --help=r* | --hel=r* | --he=r* | -hr*)
+ ac_init_help=recursive ;;
+ -help=s* | --help=s* | --hel=s* | --he=s* | -hs*)
+ ac_init_help=short ;;
+
+ -host | --host | --hos | --ho)
+ ac_prev=host_alias ;;
+ -host=* | --host=* | --hos=* | --ho=*)
+ host_alias=$ac_optarg ;;
+
+ -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)
+ ac_prev=htmldir ;;
+ -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \
+ | --ht=*)
+ htmldir=$ac_optarg ;;
+
+ -includedir | --includedir | --includedi | --included | --include \
+ | --includ | --inclu | --incl | --inc)
+ ac_prev=includedir ;;
+ -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \
+ | --includ=* | --inclu=* | --incl=* | --inc=*)
+ includedir=$ac_optarg ;;
+
+ -infodir | --infodir | --infodi | --infod | --info | --inf)
+ ac_prev=infodir ;;
+ -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)
+ infodir=$ac_optarg ;;
+
+ -libdir | --libdir | --libdi | --libd)
+ ac_prev=libdir ;;
+ -libdir=* | --libdir=* | --libdi=* | --libd=*)
+ libdir=$ac_optarg ;;
+
+ -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \
+ | --libexe | --libex | --libe)
+ ac_prev=libexecdir ;;
+ -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \
+ | --libexe=* | --libex=* | --libe=*)
+ libexecdir=$ac_optarg ;;
+
+ -localedir | --localedir | --localedi | --localed | --locale)
+ ac_prev=localedir ;;
+ -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)
+ localedir=$ac_optarg ;;
+
+ -localstatedir | --localstatedir | --localstatedi | --localstated \
+ | --localstate | --localstat | --localsta | --localst | --locals)
+ ac_prev=localstatedir ;;
+ -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \
+ | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)
+ localstatedir=$ac_optarg ;;
+
+ -mandir | --mandir | --mandi | --mand | --man | --ma | --m)
+ ac_prev=mandir ;;
+ -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)
+ mandir=$ac_optarg ;;
+
+ -nfp | --nfp | --nf)
+ # Obsolete; use --without-fp.
+ with_fp=no ;;
+
+ -no-create | --no-create | --no-creat | --no-crea | --no-cre \
+ | --no-cr | --no-c | -n)
+ no_create=yes ;;
+
+ -no-recursion | --no-recursion | --no-recursio | --no-recursi \
+ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
+ no_recursion=yes ;;
+
+ -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \
+ | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \
+ | --oldin | --oldi | --old | --ol | --o)
+ ac_prev=oldincludedir ;;
+ -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \
+ | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \
+ | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)
+ oldincludedir=$ac_optarg ;;
+
+ -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)
+ ac_prev=prefix ;;
+ -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)
+ prefix=$ac_optarg ;;
+
+ -program-prefix | --program-prefix | --program-prefi | --program-pref \
+ | --program-pre | --program-pr | --program-p)
+ ac_prev=program_prefix ;;
+ -program-prefix=* | --program-prefix=* | --program-prefi=* \
+ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)
+ program_prefix=$ac_optarg ;;
+
+ -program-suffix | --program-suffix | --program-suffi | --program-suff \
+ | --program-suf | --program-su | --program-s)
+ ac_prev=program_suffix ;;
+ -program-suffix=* | --program-suffix=* | --program-suffi=* \
+ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)
+ program_suffix=$ac_optarg ;;
+
+ -program-transform-name | --program-transform-name \
+ | --program-transform-nam | --program-transform-na \
+ | --program-transform-n | --program-transform- \
+ | --program-transform | --program-transfor \
+ | --program-transfo | --program-transf \
+ | --program-trans | --program-tran \
+ | --progr-tra | --program-tr | --program-t)
+ ac_prev=program_transform_name ;;
+ -program-transform-name=* | --program-transform-name=* \
+ | --program-transform-nam=* | --program-transform-na=* \
+ | --program-transform-n=* | --program-transform-=* \
+ | --program-transform=* | --program-transfor=* \
+ | --program-transfo=* | --program-transf=* \
+ | --program-trans=* | --program-tran=* \
+ | --progr-tra=* | --program-tr=* | --program-t=*)
+ program_transform_name=$ac_optarg ;;
+
+ -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)
+ ac_prev=pdfdir ;;
+ -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)
+ pdfdir=$ac_optarg ;;
+
+ -psdir | --psdir | --psdi | --psd | --ps)
+ ac_prev=psdir ;;
+ -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)
+ psdir=$ac_optarg ;;
+
+ -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+ | -silent | --silent | --silen | --sile | --sil)
+ silent=yes ;;
+
+ -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)
+ ac_prev=sbindir ;;
+ -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \
+ | --sbi=* | --sb=*)
+ sbindir=$ac_optarg ;;
+
+ -sharedstatedir | --sharedstatedir | --sharedstatedi \
+ | --sharedstated | --sharedstate | --sharedstat | --sharedsta \
+ | --sharedst | --shareds | --shared | --share | --shar \
+ | --sha | --sh)
+ ac_prev=sharedstatedir ;;
+ -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \
+ | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \
+ | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \
+ | --sha=* | --sh=*)
+ sharedstatedir=$ac_optarg ;;
+
+ -site | --site | --sit)
+ ac_prev=site ;;
+ -site=* | --site=* | --sit=*)
+ site=$ac_optarg ;;
+
+ -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)
+ ac_prev=srcdir ;;
+ -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)
+ srcdir=$ac_optarg ;;
+
+ -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \
+ | --syscon | --sysco | --sysc | --sys | --sy)
+ ac_prev=sysconfdir ;;
+ -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \
+ | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)
+ sysconfdir=$ac_optarg ;;
+
+ -target | --target | --targe | --targ | --tar | --ta | --t)
+ ac_prev=target_alias ;;
+ -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)
+ target_alias=$ac_optarg ;;
+
+ -v | -verbose | --verbose | --verbos | --verbo | --verb)
+ verbose=yes ;;
+
+ -version | --version | --versio | --versi | --vers | -V)
+ ac_init_version=: ;;
+
+ -with-* | --with-*)
+ ac_useropt=`expr "x$ac_option" : 'x-*with-$^=*$'`
+ # Reject names that are not valid shell variable names.
+ expr "x$ac_useropt" : ".*^-+._$as_cr_alnum" >/dev/null &&
+ as_fn_error $? "invalid package name: $ac_useropt"
+ ac_useropt_orig=$ac_useropt
+ ac_useropt=`$as_echo "$ac_useropt" | sed 's/-+./_/g'`
+ case $ac_user_opts in
+ *"
+"with_$ac_useropt"
+"*) ;;
+ *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+ esac
+ eval with_$ac_useropt=\$ac_optarg ;;
+
+ -without-* | --without-*)
+ ac_useropt=`expr "x$ac_option" : 'x-*without-$.*$'`
+ # Reject names that are not valid shell variable names.
+ expr "x$ac_useropt" : ".*^-+._$as_cr_alnum" >/dev/null &&
+ as_fn_error $? "invalid package name: $ac_useropt"
+ ac_useropt_orig=$ac_useropt
+ ac_useropt=`$as_echo "$ac_useropt" | sed 's/-+./_/g'`
+ case $ac_user_opts in
+ *"
+"with_$ac_useropt"
+"*) ;;
+ *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+ esac
+ eval with_$ac_useropt=no ;;
+
+ --x)
+ # Obsolete; use --with-x.
+ with_x=yes ;;
+
+ -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \
+ | --x-incl | --x-inc | --x-in | --x-i)
+ ac_prev=x_includes ;;
+ -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \
+ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)
+ x_includes=$ac_optarg ;;
+
+ -x-libraries | --x-libraries | --x-librarie | --x-librari \
+ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)
+ ac_prev=x_libraries ;;
+ -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \
+ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)
+ x_libraries=$ac_optarg ;;
+
+ -*) as_fn_error $? "unrecognized option: \`$ac_option'
+Try \`$0 --help' for more information"
+ ;;
+
+ *=*)
+ ac_envvar=`expr "x$ac_option" : 'x$^=*$='`
+ # Reject names that are not valid shell variable names.
+ case $ac_envvar in #(
+ '' | 0-9* | *!_$as_cr_alnum* )
+ as_fn_error $? "invalid variable name: \`$ac_envvar'" ;;
+ esac
+ eval $ac_envvar=\$ac_optarg
+ export $ac_envvar ;;
+
+ *)
+ # FIXME: should be removed in autoconf 3.0.
+ $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2
+ expr "x$ac_option" : ".*^-._$as_cr_alnum" >/dev/null &&
+ $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2
+ : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}"
+ ;;
+
+ esac
+done
+
+if test -n "$ac_prev"; then
+ ac_option=--`echo $ac_prev | sed 's/_/-/g'`
+ as_fn_error $? "missing argument to $ac_option"
+fi
+
+if test -n "$ac_unrecognized_opts"; then
+ case $enable_option_checking in
+ no) ;;
+ fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;;
+ *) $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;;
+ esac
+fi
+
+# Check all directory arguments for consistency.
+for ac_var in	exec_prefix prefix bindir sbindir libexecdir datarootdir \
+		datadir sysconfdir sharedstatedir localstatedir includedir \
+		oldincludedir docdir infodir htmldir dvidir pdfdir psdir \
+		libdir localedir mandir
+do
+ eval ac_val=\$$ac_var
+ # Remove trailing slashes.
+ case $ac_val in
+ */ )
+ ac_val=`expr "X$ac_val" : 'X$.*^/$' \| "X$ac_val" : 'X$.*$'`
+ eval $ac_var=\$ac_val;;
+ esac
+ # Be sure to have absolute directory names.
+ case $ac_val in
+ \\/$* | ?:\\/* ) continue;;
+ NONE | '' ) case $ac_var in *prefix ) continue;; esac;;
+ esac
+ as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val"
+done
+
+# There might be people who depend on the old broken behavior: `$host'
+# used to hold the argument of --host etc.
+# FIXME: To remove some day.
+build=$build_alias
+host=$host_alias
+target=$target_alias
+
+# FIXME: To remove some day.
+if test "x$host_alias" != x; then
+ if test "x$build_alias" = x; then
+ cross_compiling=maybe
+ elif test "x$build_alias" != "x$host_alias"; then
+ cross_compiling=yes
+ fi
+fi
+
+ac_tool_prefix=
+test -n "$host_alias" && ac_tool_prefix=$host_alias-
+
+test "$silent" = yes && exec 6>/dev/null
+
+
+ac_pwd=`pwd` && test -n "$ac_pwd" &&
+ac_ls_di=`ls -di .` &&
+ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` ||
+ as_fn_error $? "working directory cannot be determined"
+test "X$ac_ls_di" = "X$ac_pwd_ls_di" ||
+ as_fn_error $? "pwd does not report name of working directory"
+
+
+# Find the source files, if location was not specified.
+if test -z "$srcdir"; then
+ ac_srcdir_defaulted=yes
+ # Try the directory containing this script, then the parent directory.
+ ac_confdir=`$as_dirname -- "$as_myself" ||
+$as_expr X"$as_myself" : 'X$.*^/$//*^/^/*/*$' \| \
+	 X"$as_myself" : 'X$//$^/' \| \
+	 X"$as_myself" : 'X$//$$' \| \
+	 X"$as_myself" : 'X$/$' \| . 2>/dev/null ||
+$as_echo X"$as_myself" |
+ sed '/^X$.*^/$\/\/*^/^/*\/*$/{
+	 s//\1/
+	 q
+	 }
+	 /^X$\/\/$^/.*/{
+	 s//\1/
+	 q
+	 }
+	 /^X$\/\/$$/{
+	 s//\1/
+	 q
+	 }
+	 /^X$\/$.*/{
+	 s//\1/
+	 q
+	 }
+	 s/.*/./; q'`
+ srcdir=$ac_confdir
+ if test ! -r "$srcdir/$ac_unique_file"; then
+ srcdir=..
+ fi
+else
+ ac_srcdir_defaulted=no
+fi
+if test ! -r "$srcdir/$ac_unique_file"; then
+ test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .."
+ as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir"
+fi
+ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work"
+ac_abs_confdir=`(
+	cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg"
+	pwd)`
+# When building in place, set srcdir=.
+if test "$ac_abs_confdir" = "$ac_pwd"; then
+ srcdir=.
+fi
+# Remove unnecessary trailing slashes from srcdir.
+# Double slashes in file names in object file debugging info
+# mess up M-x gdb in Emacs.
+case $srcdir in
+*/) srcdir=`expr "X$srcdir" : 'X$.*^/$' \| "X$srcdir" : 'X$.*$'`;;
+esac
+for ac_var in $ac_precious_vars; do
+ eval ac_env_${ac_var}_set=\${${ac_var}+set}
+ eval ac_env_${ac_var}_value=\$${ac_var}
+ eval ac_cv_env_${ac_var}_set=\${${ac_var}+set}
+ eval ac_cv_env_${ac_var}_value=\$${ac_var}
+done
+
+#
+# Report the --help message.
+#
+if test "$ac_init_help" = "long"; then
+ # Omit some internal or obsolete options to make the list less imposing.
+ # This message is too long to be a string in the A/UX 3.1 sh.
+ cat <<_ACEOF
+\`configure' configures this package to adapt to many kinds of systems.
+
+Usage: $0 OPTION... VAR=VALUE...
+
+To assign environment variables (e.g., CC, CFLAGS...), specify them as
+VAR=VALUE. See below for descriptions of some of the useful variables.
+
+Defaults for the options are specified in brackets.
+
+Configuration:
+ -h, --help display this help and exit
+ --help=short display options specific to this package
+ --help=recursive display the short help of all the included packages
+ -V, --version display version information and exit
+ -q, --quiet, --silent do not print \`checking ...' messages
+ --cache-file=FILE cache test results in FILE disabled
+ -C, --config-cache alias for \`--cache-file=config.cache'
+ -n, --no-create do not create output files
+ --srcdir=DIR find the sources in DIR configure dir or \`..'
+
+Installation directories:
+ --prefix=PREFIX install architecture-independent files in PREFIX
+ $ac_default_prefix
+ --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX
+ PREFIX
+
+By default, \`make install' will install all the files in
+\`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify
+an installation prefix other than \`$ac_default_prefix' using \`--prefix',
+for instance \`--prefix=\$HOME'.
+
+For better control, use the options below.
+
+Fine tuning of the installation directories:
+ --bindir=DIR user executables EPREFIX/bin
+ --sbindir=DIR system admin executables EPREFIX/sbin
+ --libexecdir=DIR program executables EPREFIX/libexec
+ --sysconfdir=DIR read-only single-machine data PREFIX/etc
+ --sharedstatedir=DIR modifiable architecture-independent data PREFIX/com
+ --localstatedir=DIR modifiable single-machine data PREFIX/var
+ --libdir=DIR object code libraries EPREFIX/lib
+ --includedir=DIR C header files PREFIX/include
+ --oldincludedir=DIR C header files for non-gcc /usr/include
+ --datarootdir=DIR read-only arch.-independent data root PREFIX/share
+ --datadir=DIR read-only architecture-independent data DATAROOTDIR
+ --infodir=DIR info documentation DATAROOTDIR/info
+ --localedir=DIR locale-dependent data DATAROOTDIR/locale
+ --mandir=DIR man documentation DATAROOTDIR/man
+ --docdir=DIR documentation root DATAROOTDIR/doc/PACKAGE
+ --htmldir=DIR html documentation DOCDIR
+ --dvidir=DIR dvi documentation DOCDIR
+ --pdfdir=DIR pdf documentation DOCDIR
+ --psdir=DIR ps documentation DOCDIR
+_ACEOF
+
+ cat <<\_ACEOF
+
+X features:
+ --x-includes=DIR X include files are in DIR
+ --x-libraries=DIR X library files are in DIR
+
+System types:
+ --build=BUILD configure for building on BUILD guessed
+ --host=HOST cross-compile to build programs to run on HOST BUILD
+_ACEOF
+fi
+
+if test -n "$ac_init_help"; then
+
+ cat <<\_ACEOF
+
+Optional Features:
+ --disable-option-checking ignore unrecognized --enable/--with options
+ --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no)
+ --enable-FEATURE=ARG include FEATURE ARG=yes
+ --disable-largefile omit support for large files
+ --enable-warnings turn on GCC compiler warnings
+
+Optional Packages:
+ --with-PACKAGE=ARG use PACKAGE ARG=yes
+ --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no)
+ --with-pkgconfigdir=DIR pkgconfig dir (libdir/pkgconfig)
+ --with-terminfo=xxx Terminfo layout: default, hpux11, osf1r5, aix4, uwin
+ --with-readline=xxx Use slang(default) or gnu readline for slsh
+ --with-slsyswrap=DIR Not for production use
+ --with-x use the X Window System
+ --with-pcre=DIR Use DIR/lib and DIR/include for pcre
+ --with-pcrelib=DIR pcre library in DIR
+ --with-pcreinc=DIR pcre include files in DIR
+ --with-onig=DIR Use DIR/lib and DIR/include for onig
+ --with-oniglib=DIR onig library in DIR
+ --with-oniginc=DIR onig include files in DIR
+ --with-png=DIR Use DIR/lib and DIR/include for png
+ --with-pnglib=DIR png library in DIR
+ --with-pnginc=DIR png include files in DIR
+ --with-z=DIR Use DIR/lib and DIR/include for z
+ --with-zlib=DIR z library in DIR
+ --with-zinc=DIR z include files in DIR
+ --with-iconv=DIR Use DIR/lib and DIR/include for iconv
+ --with-iconvlib=DIR iconv library in DIR
+ --with-iconvinc=DIR iconv include files in DIR
+
+Some influential environment variables:
+ CC C compiler command
+ CFLAGS C compiler flags
+ LDFLAGS linker flags, e.g. -L<lib dir> if you have libraries in a
+ nonstandard directory <lib dir>
+ LIBS libraries to pass to the linker, e.g. -l<library>
+ CPPFLAGS (Objective) C/C++ preprocessor flags, e.g. -I<include dir> if
+ you have headers in a nonstandard directory <include dir>
+ CPP C preprocessor
+ XMKMF Path to xmkmf, Makefile generator for X Window System
+
+Use these variables to override the choices made by `configure' or to help
+it to find libraries and programs with nonstandard names/locations.
+
+Report bugs to the package provider.
+_ACEOF
+ac_status=$?
+fi
+
+if test "$ac_init_help" = "recursive"; then
+ # If there are subdirs, report their specific --help.
+ for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue
+ test -d "$ac_dir" ||
+ { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } ||
+ continue
+ ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+ ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.\\/||'`
+ # A ".." for each directory in $ac_dir_suffix.
+ ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/^\\/*|/..|g;s|/||'`
+ case $ac_top_builddir_sub in
+ "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+ *) ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+ esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+ .) # We are building in place.
+ ac_srcdir=.
+ ac_top_srcdir=$ac_top_builddir_sub
+ ac_abs_top_srcdir=$ac_pwd ;;
+ \\/* | ?:\\/* ) # Absolute name.
+ ac_srcdir=$srcdir$ac_dir_suffix;
+ ac_top_srcdir=$srcdir
+ ac_abs_top_srcdir=$srcdir ;;
+ *) # Relative name.
+ ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+ ac_top_srcdir=$ac_top_build_prefix$srcdir
+ ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+ cd "$ac_dir" || { ac_status=$?; continue; }
+ # Check for guested configure.
+ if test -f "$ac_srcdir/configure.gnu"; then
+ echo &&
+ $SHELL "$ac_srcdir/configure.gnu" --help=recursive
+ elif test -f "$ac_srcdir/configure"; then
+ echo &&
+ $SHELL "$ac_srcdir/configure" --help=recursive
+ else
+ $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2
+ fi || ac_status=$?
+ cd "$ac_pwd" || { ac_status=$?; break; }
+ done
+fi
+
+test -n "$ac_init_help" && exit $ac_status
+if $ac_init_version; then
+ cat <<\_ACEOF
+configure
+generated by GNU Autoconf 2.69
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This configure script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it.
+_ACEOF
+ exit
+fi
+
+## ------------------------ ##
+## Autoconf initialization. ##
+## ------------------------ ##
+
+# ac_fn_c_try_compile LINENO
+# --------------------------
+# Try to compile conftest.$ac_ext, and return whether this succeeded.
+ac_fn_c_try_compile ()
+{
+ as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+ rm -f conftest.$ac_objext
+ if { { ac_try="$ac_compile"
+case "(($ac_try" in
+ *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+ *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+ (eval "$ac_compile") 2>conftest.err
+ ac_status=$?
+ if test -s conftest.err; then
+ grep -v '^ *+' conftest.err >conftest.er1
+ cat conftest.er1 >&5
+ mv -f conftest.er1 conftest.err
+ fi
+ $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+ test $ac_status = 0; } && {
+	 test -z "$ac_c_werror_flag" ||
+	 test ! -s conftest.err
+ } && test -s conftest.$ac_objext; then :
+ ac_retval=0
+else
+ $as_echo "$as_me: failed program was:" >&5
+sed 's/^/| /' conftest.$ac_ext >&5
+
+	ac_retval=1
+fi
+ eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+ as_fn_set_status $ac_retval
+
+} # ac_fn_c_try_compile
+
+# ac_fn_c_try_cpp LINENO
+# ----------------------
+# Try to preprocess conftest.$ac_ext, and return whether this succeeded.
+ac_fn_c_try_cpp ()
+{
+ as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+ if { { ac_try="$ac_cpp conftest.$ac_ext"
+case "(($ac_try" in
+ *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+ *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+ (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err
+ ac_status=$?
+ if test -s conftest.err; then
+ grep -v '^ *+' conftest.err >conftest.er1
+ cat conftest.er1 >&5
+ mv -f conftest.er1 conftest.err
+ fi
+ $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+ test $ac_status = 0; } > conftest.i && {
+	 test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" ||
+	 test ! -s conftest.err
+ }; then :
+ ac_retval=0
+else
+ $as_echo "$as_me: failed program was:" >&5
+sed 's/^/| /' conftest.$ac_ext >&5
+
+ ac_retval=1
+fi
+ eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+ as_fn_set_status $ac_retval
+
+} # ac_fn_c_try_cpp
+
+# ac_fn_c_check_header_mongrel LINENO HEADER VAR INCLUDES
+# -------------------------------------------------------
+# Tests whether HEADER exists, giving a warning if it cannot be compiled using
+# the include files in INCLUDES and setting the cache variable VAR
+# accordingly.
+ac_fn_c_check_header_mongrel ()
+{
+ as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+ if eval \${$3+:} false; then :
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5
+$as_echo_n "checking for $2... " >&6; }
+if eval \${$3+:} false; then :
+ $as_echo_n "(cached) " >&6
+fi
+eval ac_res=\$$3
+	 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5
+$as_echo "$ac_res" >&6; }
+else
+ # Is the header compilable?
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 usability" >&5
+$as_echo_n "checking $2 usability... " >&6; }
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+$4
+#include <$2>
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ ac_header_compiler=yes
+else
+ ac_header_compiler=no
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_compiler" >&5
+$as_echo "$ac_header_compiler" >&6; }
+
+# Is the header present?
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 presence" >&5
+$as_echo_n "checking $2 presence... " >&6; }
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <$2>
+_ACEOF
+if ac_fn_c_try_cpp "$LINENO"; then :
+ ac_header_preproc=yes
+else
+ ac_header_preproc=no
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_preproc" >&5
+$as_echo "$ac_header_preproc" >&6; }
+
+# So? What about this header?
+case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in #((
+ yes:no: )
+ { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&5
+$as_echo "$as_me: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&2;}
+ { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5
+$as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;}
+ ;;
+ no:yes:* )
+ { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: present but cannot be compiled" >&5
+$as_echo "$as_me: WARNING: $2: present but cannot be compiled" >&2;}
+ { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: check for missing prerequisite headers?" >&5
+$as_echo "$as_me: WARNING: $2: check for missing prerequisite headers?" >&2;}
+ { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: see the Autoconf documentation" >&5
+$as_echo "$as_me: WARNING: $2: see the Autoconf documentation" >&2;}
+ { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&5
+$as_echo "$as_me: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&2;}
+ { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5
+$as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;}
+ ;;
+esac
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5
+$as_echo_n "checking for $2... " >&6; }
+if eval \${$3+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ eval "$3=\$ac_header_compiler"
+fi
+eval ac_res=\$$3
+	 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5
+$as_echo "$ac_res" >&6; }
+fi
+ eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+
+} # ac_fn_c_check_header_mongrel
+
+# ac_fn_c_try_run LINENO
+# ----------------------
+# Try to link conftest.$ac_ext, and return whether this succeeded. Assumes
+# that executables *can* be run.
+ac_fn_c_try_run ()
+{
+ as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+ if { { ac_try="$ac_link"
+case "(($ac_try" in
+ *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+ *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+ (eval "$ac_link") 2>&5
+ ac_status=$?
+ $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+ test $ac_status = 0; } && { ac_try='./conftest$ac_exeext'
+ { { case "(($ac_try" in
+ *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+ *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+ (eval "$ac_try") 2>&5
+ ac_status=$?
+ $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+ test $ac_status = 0; }; }; then :
+ ac_retval=0
+else
+ $as_echo "$as_me: program exited with status $ac_status" >&5
+ $as_echo "$as_me: failed program was:" >&5
+sed 's/^/| /' conftest.$ac_ext >&5
+
+ ac_retval=$ac_status
+fi
+ rm -rf conftest.dSYM conftest_ipa8_conftest.oo
+ eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+ as_fn_set_status $ac_retval
+
+} # ac_fn_c_try_run
+
+# ac_fn_c_check_header_compile LINENO HEADER VAR INCLUDES
+# -------------------------------------------------------
+# Tests whether HEADER exists and can be compiled using the include files in
+# INCLUDES, setting the cache variable VAR accordingly.
+ac_fn_c_check_header_compile ()
+{
+ as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5
+$as_echo_n "checking for $2... " >&6; }
+if eval \${$3+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+$4
+#include <$2>
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ eval "$3=yes"
+else
+ eval "$3=no"
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+fi
+eval ac_res=\$$3
+	 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5
+$as_echo "$ac_res" >&6; }
+ eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+
+} # ac_fn_c_check_header_compile
+
+# ac_fn_c_try_link LINENO
+# -----------------------
+# Try to link conftest.$ac_ext, and return whether this succeeded.
+ac_fn_c_try_link ()
+{
+ as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+ rm -f conftest.$ac_objext conftest$ac_exeext
+ if { { ac_try="$ac_link"
+case "(($ac_try" in
+ *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+ *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+ (eval "$ac_link") 2>conftest.err
+ ac_status=$?
+ if test -s conftest.err; then
+ grep -v '^ *+' conftest.err >conftest.er1
+ cat conftest.er1 >&5
+ mv -f conftest.er1 conftest.err
+ fi
+ $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+ test $ac_status = 0; } && {
+	 test -z "$ac_c_werror_flag" ||
+	 test ! -s conftest.err
+ } && test -s conftest$ac_exeext && {
+	 test "$cross_compiling" = yes ||
+	 test -x conftest$ac_exeext
+ }; then :
+ ac_retval=0
+else
+ $as_echo "$as_me: failed program was:" >&5
+sed 's/^/| /' conftest.$ac_ext >&5
+
+	ac_retval=1
+fi
+ # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information
+ # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would
+ # interfere with the next link command; also delete a directory that is
+ # left behind by Apple's compiler. We do this before executing the actions.
+ rm -rf conftest.dSYM conftest_ipa8_conftest.oo
+ eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+ as_fn_set_status $ac_retval
+
+} # ac_fn_c_try_link
+
+# ac_fn_c_check_func LINENO FUNC VAR
+# ----------------------------------
+# Tests whether FUNC exists, setting the cache variable VAR accordingly
+ac_fn_c_check_func ()
+{
+ as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5
+$as_echo_n "checking for $2... " >&6; }
+if eval \${$3+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+/* Define $2 to an innocuous variant, in case <limits.h> declares $2.
+ For example, HP-UX 11i <limits.h> declares gettimeofday. */
+#define $2 innocuous_$2
+
+/* System header to define __stub macros and hopefully few prototypes,
+ which can conflict with char $2 (); below.
+ Prefer <limits.h> to <assert.h> if __STDC__ is defined, since
+ <limits.h> exists even on freestanding compilers. */
+
+#ifdef __STDC__
+# include <limits.h>
+#else
+# include <assert.h>
+#endif
+
+#undef $2
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char $2 ();
+/* The GNU C library defines this for functions which it implements
+ to always fail with ENOSYS. Some functions are actually named
+ something starting with __ and the normal name is an alias. */
+#if defined __stub_$2 || defined __stub___$2
+choke me
+#endif
+
+int
+main ()
+{
+return $2 ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ eval "$3=yes"
+else
+ eval "$3=no"
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+fi
+eval ac_res=\$$3
+	 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5
+$as_echo "$ac_res" >&6; }
+ eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+
+} # ac_fn_c_check_func
+
+# ac_fn_c_check_type LINENO TYPE VAR INCLUDES
+# -------------------------------------------
+# Tests whether TYPE exists after having included INCLUDES, setting cache
+# variable VAR accordingly.
+ac_fn_c_check_type ()
+{
+ as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5
+$as_echo_n "checking for $2... " >&6; }
+if eval \${$3+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ eval "$3=no"
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+$4
+int
+main ()
+{
+if (sizeof ($2))
+	 return 0;
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+$4
+int
+main ()
+{
+if (sizeof (($2)))
+	 return 0;
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+
+else
+ eval "$3=yes"
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+fi
+eval ac_res=\$$3
+	 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5
+$as_echo "$ac_res" >&6; }
+ eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+
+} # ac_fn_c_check_type
+
+# ac_fn_c_compute_int LINENO EXPR VAR INCLUDES
+# --------------------------------------------
+# Tries to find the compile-time value of EXPR in a program that includes
+# INCLUDES, setting VAR accordingly. Returns whether the value could be
+# computed
+ac_fn_c_compute_int ()
+{
+ as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+ if test "$cross_compiling" = yes; then
+ # Depending upon the size, compute the lo and hi bounds.
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+$4
+int
+main ()
+{
+static int test_array 1 - 2 * !(($2) >= 0);
+test_array 0 = 0;
+return test_array 0;
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ ac_lo=0 ac_mid=0
+ while :; do
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+$4
+int
+main ()
+{
+static int test_array 1 - 2 * !(($2) <= $ac_mid);
+test_array 0 = 0;
+return test_array 0;
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ ac_hi=$ac_mid; break
+else
+ as_fn_arith $ac_mid + 1 && ac_lo=$as_val
+			if test $ac_lo -le $ac_mid; then
+			 ac_lo= ac_hi=
+			 break
+			fi
+			as_fn_arith 2 '*' $ac_mid + 1 && ac_mid=$as_val
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+ done
+else
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+$4
+int
+main ()
+{
+static int test_array 1 - 2 * !(($2) < 0);
+test_array 0 = 0;
+return test_array 0;
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ ac_hi=-1 ac_mid=-1
+ while :; do
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+$4
+int
+main ()
+{
+static int test_array 1 - 2 * !(($2) >= $ac_mid);
+test_array 0 = 0;
+return test_array 0;
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ ac_lo=$ac_mid; break
+else
+ as_fn_arith '(' $ac_mid ')' - 1 && ac_hi=$as_val
+			if test $ac_mid -le $ac_hi; then
+			 ac_lo= ac_hi=
+			 break
+			fi
+			as_fn_arith 2 '*' $ac_mid && ac_mid=$as_val
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+ done
+else
+ ac_lo= ac_hi=
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+# Binary search between lo and hi bounds.
+while test "x$ac_lo" != "x$ac_hi"; do
+ as_fn_arith '(' $ac_hi - $ac_lo ')' / 2 + $ac_lo && ac_mid=$as_val
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+$4
+int
+main ()
+{
+static int test_array 1 - 2 * !(($2) <= $ac_mid);
+test_array 0 = 0;
+return test_array 0;
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ ac_hi=$ac_mid
+else
+ as_fn_arith '(' $ac_mid ')' + 1 && ac_lo=$as_val
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+done
+case $ac_lo in #((
+?*) eval "$3=\$ac_lo"; ac_retval=0 ;;
+'') ac_retval=1 ;;
+esac
+ else
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+$4
+static long int longval () { return $2; }
+static unsigned long int ulongval () { return $2; }
+#include <stdio.h>
+#include <stdlib.h>
+int
+main ()
+{
+
+ FILE *f = fopen ("conftest.val", "w");
+ if (! f)
+ return 1;
+ if (($2) < 0)
+ {
+ long int i = longval ();
+ if (i != ($2))
+	return 1;
+ fprintf (f, "%ld", i);
+ }
+ else
+ {
+ unsigned long int i = ulongval ();
+ if (i != ($2))
+	return 1;
+ fprintf (f, "%lu", i);
+ }
+ /* Do not output a trailing newline, as this causes \r\n confusion
+ on some platforms. */
+ return ferror (f) || fclose (f) != 0;
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_run "$LINENO"; then :
+ echo >>conftest.val; read $3 <conftest.val; ac_retval=0
+else
+ ac_retval=1
+fi
+rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \
+ conftest.$ac_objext conftest.beam conftest.$ac_ext
+rm -f conftest.val
+
+ fi
+ eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+ as_fn_set_status $ac_retval
+
+} # ac_fn_c_compute_int
+cat >config.log <<_ACEOF
+This file contains any messages produced by compilers while
+running configure, to aid debugging if configure makes a mistake.
+
+It was created by $as_me, which was
+generated by GNU Autoconf 2.69. Invocation command line was
+
+ $ $0 $@
+
+_ACEOF
+exec 5>>config.log
+{
+cat <<_ASUNAME
+## --------- ##
+## Platform. ##
+## --------- ##
+
+hostname = `(hostname || uname -n) 2>/dev/null | sed 1q`
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`
+/bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown`
+
+/bin/arch = `(/bin/arch) 2>/dev/null || echo unknown`
+/usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`
+/usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown`
+/bin/machine = `(/bin/machine) 2>/dev/null || echo unknown`
+/usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown`
+/bin/universe = `(/bin/universe) 2>/dev/null || echo unknown`
+
+_ASUNAME
+
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ $as_echo "PATH: $as_dir"
+ done
+IFS=$as_save_IFS
+
+} >&5
+
+cat >&5 <<_ACEOF
+
+
+## ----------- ##
+## Core tests. ##
+## ----------- ##
+
+_ACEOF
+
+
+# Keep a trace of the command line.
+# Strip out --no-create and --no-recursion so they do not pile up.
+# Strip out --silent because we don't want to record it for future runs.
+# Also quote any args containing shell meta-characters.
+# Make two passes to allow for proper duplicate-argument suppression.
+ac_configure_args=
+ac_configure_args0=
+ac_configure_args1=
+ac_must_keep_next=false
+for ac_pass in 1 2
+do
+ for ac_arg
+ do
+ case $ac_arg in
+ -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;
+ -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+ | -silent | --silent | --silen | --sile | --sil)
+ continue ;;
+ *\'*)
+ ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;;
+ esac
+ case $ac_pass in
+ 1) as_fn_append ac_configure_args0 " '$ac_arg'" ;;
+ 2)
+ as_fn_append ac_configure_args1 " '$ac_arg'"
+ if test $ac_must_keep_next = true; then
+	ac_must_keep_next=false # Got value, back to normal.
+ else
+	case $ac_arg in
+	 *=* | --config-cache | -C | -disable-* | --disable-* \
+	 | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \
+	 | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \
+	 | -with-* | --with-* | -without-* | --without-* | --x)
+	 case "$ac_configure_args0 " in
+	 "$ac_configure_args1"*" '$ac_arg' "* ) continue ;;
+	 esac
+	 ;;
+	 -* ) ac_must_keep_next=true ;;
+	esac
+ fi
+ as_fn_append ac_configure_args " '$ac_arg'"
+ ;;
+ esac
+ done
+done
+{ ac_configure_args0=; unset ac_configure_args0;}
+{ ac_configure_args1=; unset ac_configure_args1;}
+
+# When interrupted or exit'd, cleanup temporary files, and complete
+# config.log. We remove comments because anyway the quotes in there
+# would cause problems or look ugly.
+# WARNING: Use '\'' to represent an apostrophe within the trap.
+# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.
+trap 'exit_status=$?
+ # Save into config.log some information that might help in debugging.
+ {
+ echo
+
+ $as_echo "## ---------------- ##
+## Cache variables. ##
+## ---------------- ##"
+ echo
+ # The following way of writing the cache mishandles newlines in values,
+(
+ for ac_var in `(set) 2>&1 | sed -n '\''s/^$a-zA-Z_a-zA-Z0-9_*$=.*/\1/p'\''`; do
+ eval ac_val=\$$ac_var
+ case $ac_val in #(
+ *${as_nl}*)
+ case $ac_var in #(
+ *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+ esac
+ case $ac_var in #(
+ _ | IFS | as_nl) ;; #(
+ BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+ *) { eval $ac_var=; unset $ac_var;} ;;
+ esac ;;
+ esac
+ done
+ (set) 2>&1 |
+ case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #(
+ *${as_nl}ac_space=\ *)
+ sed -n \
+	"s/'\''/'\''\\\\'\'''\''/g;
+	 s/^\$_$as_cr_alnum*_cv__$as_cr_alnum*\$=\$.*\$/\\1='\''\\2'\''/p"
+ ;; #(
+ *)
+ sed -n "/^_$as_cr_alnum*_cv__$as_cr_alnum*=/p"
+ ;;
+ esac |
+ sort
+)
+ echo
+
+ $as_echo "## ----------------- ##
+## Output variables. ##
+## ----------------- ##"
+ echo
+ for ac_var in $ac_subst_vars
+ do
+ eval ac_val=\$$ac_var
+ case $ac_val in
+ *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+ esac
+ $as_echo "$ac_var='\''$ac_val'\''"
+ done | sort
+ echo
+
+ if test -n "$ac_subst_files"; then
+ $as_echo "## ------------------- ##
+## File substitutions. ##
+## ------------------- ##"
+ echo
+ for ac_var in $ac_subst_files
+ do
+	eval ac_val=\$$ac_var
+	case $ac_val in
+	*\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+	esac
+	$as_echo "$ac_var='\''$ac_val'\''"
+ done | sort
+ echo
+ fi
+
+ if test -s confdefs.h; then
+ $as_echo "## ----------- ##
+## confdefs.h. ##
+## ----------- ##"
+ echo
+ cat confdefs.h
+ echo
+ fi
+ test "$ac_signal" != 0 &&
+ $as_echo "$as_me: caught signal $ac_signal"
+ $as_echo "$as_me: exit $exit_status"
+ } >&5
+ rm -f core *.core core.conftest.* &&
+ rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&
+ exit $exit_status
+' 0
+for ac_signal in 1 2 13 15; do
+ trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal
+done
+ac_signal=0
+
+# confdefs.h avoids OS command line length limits that DEFS can exceed.
+rm -f -r conftest* confdefs.h
+
+$as_echo "/* confdefs.h */" > confdefs.h
+
+# Predefined preprocessor variables.
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_NAME "$PACKAGE_NAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_TARNAME "$PACKAGE_TARNAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_VERSION "$PACKAGE_VERSION"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_STRING "$PACKAGE_STRING"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_URL "$PACKAGE_URL"
+_ACEOF
+
+
+# Let the site file select an alternate cache file if it wants to.
+# Prefer an explicitly selected file to automatically selected ones.
+ac_site_file1=NONE
+ac_site_file2=NONE
+if test -n "$CONFIG_SITE"; then
+ # We do not want a PATH search for config.site.
+ case $CONFIG_SITE in #((
+ -*) ac_site_file1=./$CONFIG_SITE;;
+ */*) ac_site_file1=$CONFIG_SITE;;
+ *) ac_site_file1=./$CONFIG_SITE;;
+ esac
+elif test "x$prefix" != xNONE; then
+ ac_site_file1=$prefix/share/config.site
+ ac_site_file2=$prefix/etc/config.site
+else
+ ac_site_file1=$ac_default_prefix/share/config.site
+ ac_site_file2=$ac_default_prefix/etc/config.site
+fi
+for ac_site_file in "$ac_site_file1" "$ac_site_file2"
+do
+ test "x$ac_site_file" = xNONE && continue
+ if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5
+$as_echo "$as_me: loading site script $ac_site_file" >&6;}
+ sed 's/^/| /' "$ac_site_file" >&5
+ . "$ac_site_file" \
+ || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "failed to load site script $ac_site_file
+See \`config.log' for more details" "$LINENO" 5; }
+ fi
+done
+
+if test -r "$cache_file"; then
+ # Some versions of bash will fail to source /dev/null (special files
+ # actually), so we avoid doing that. DJGPP emulates it as a regular file.
+ if test /dev/null != "$cache_file" && test -f "$cache_file"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5
+$as_echo "$as_me: loading cache $cache_file" >&6;}
+ case $cache_file in
+ \\/* | ?:\\/* ) . "$cache_file";;
+ *) . "./$cache_file";;
+ esac
+ fi
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5
+$as_echo "$as_me: creating cache $cache_file" >&6;}
+ >$cache_file
+fi
+
+# Check that the precious variables saved in the cache have kept the same
+# value.
+ac_cache_corrupted=false
+for ac_var in $ac_precious_vars; do
+ eval ac_old_set=\$ac_cv_env_${ac_var}_set
+ eval ac_new_set=\$ac_env_${ac_var}_set
+ eval ac_old_val=\$ac_cv_env_${ac_var}_value
+ eval ac_new_val=\$ac_env_${ac_var}_value
+ case $ac_old_set,$ac_new_set in
+ set,)
+ { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;}
+ ac_cache_corrupted=: ;;
+ ,set)
+ { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;}
+ ac_cache_corrupted=: ;;
+ ,);;
+ *)
+ if test "x$ac_old_val" != "x$ac_new_val"; then
+	# differences in whitespace do not lead to failure.
+	ac_old_val_w=`echo x $ac_old_val`
+	ac_new_val_w=`echo x $ac_new_val`
+	if test "$ac_old_val_w" != "$ac_new_val_w"; then
+	 { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5
+$as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;}
+	 ac_cache_corrupted=:
+	else
+	 { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5
+$as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;}
+	 eval $ac_var=\$ac_old_val
+	fi
+	{ $as_echo "$as_me:${as_lineno-$LINENO}: former value: \`$ac_old_val'" >&5
+$as_echo "$as_me: former value: \`$ac_old_val'" >&2;}
+	{ $as_echo "$as_me:${as_lineno-$LINENO}: current value: \`$ac_new_val'" >&5
+$as_echo "$as_me: current value: \`$ac_new_val'" >&2;}
+ fi;;
+ esac
+ # Pass precious variables to config.status.
+ if test "$ac_new_set" = set; then
+ case $ac_new_val in
+ *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;;
+ *) ac_arg=$ac_var=$ac_new_val ;;
+ esac
+ case " $ac_configure_args " in
+ *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy.
+ *) as_fn_append ac_configure_args " '$ac_arg'" ;;
+ esac
+ fi
+done
+if $ac_cache_corrupted; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+ { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5
+$as_echo "$as_me: error: changes in the environment can compromise the build" >&2;}
+ as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5
+fi
+## -------------------- ##
+## Main body of script. ##
+## -------------------- ##
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+#AC_PREFIX_DEFAULT($MY_PREFIX_DEAULT)
+
+# Installation location
+
+
+ac_aux_dir=
+for ac_dir in autoconf "$srcdir"/autoconf; do
+ if test -f "$ac_dir/install-sh"; then
+ ac_aux_dir=$ac_dir
+ ac_install_sh="$ac_aux_dir/install-sh -c"
+ break
+ elif test -f "$ac_dir/install.sh"; then
+ ac_aux_dir=$ac_dir
+ ac_install_sh="$ac_aux_dir/install.sh -c"
+ break
+ elif test -f "$ac_dir/shtool"; then
+ ac_aux_dir=$ac_dir
+ ac_install_sh="$ac_aux_dir/shtool install -c"
+ break
+ fi
+done
+if test -z "$ac_aux_dir"; then
+ as_fn_error $? "cannot find install-sh, install.sh, or shtool in autoconf \"$srcdir\"/autoconf" "$LINENO" 5
+fi
+
+# These three variables are undocumented and unsupported,
+# and are intended to be withdrawn in a future Autoconf release.
+# They can cause serious problems if a builder's source tree is in a directory
+# whose full name contains unusual characters.
+ac_config_guess="$SHELL $ac_aux_dir/config.guess" # Please don't use this var.
+ac_config_sub="$SHELL $ac_aux_dir/config.sub" # Please don't use this var.
+ac_configure="$SHELL $ac_aux_dir/configure" # Please don't use this var.
+
+
+# Make sure we can run config.sub.
+$SHELL "$ac_aux_dir/config.sub" sun4 >/dev/null 2>&1 ||
+ as_fn_error $? "cannot run $SHELL $ac_aux_dir/config.sub" "$LINENO" 5
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking build system type" >&5
+$as_echo_n "checking build system type... " >&6; }
+if ${ac_cv_build+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_build_alias=$build_alias
+test "x$ac_build_alias" = x &&
+ ac_build_alias=`$SHELL "$ac_aux_dir/config.guess"`
+test "x$ac_build_alias" = x &&
+ as_fn_error $? "cannot guess build type; you must specify one" "$LINENO" 5
+ac_cv_build=`$SHELL "$ac_aux_dir/config.sub" $ac_build_alias` ||
+ as_fn_error $? "$SHELL $ac_aux_dir/config.sub $ac_build_alias failed" "$LINENO" 5
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_build" >&5
+$as_echo "$ac_cv_build" >&6; }
+case $ac_cv_build in
+*-*-*) ;;
+*) as_fn_error $? "invalid value of canonical build" "$LINENO" 5;;
+esac
+build=$ac_cv_build
+ac_save_IFS=$IFS; IFS='-'
+set x $ac_cv_build
+shift
+build_cpu=$1
+build_vendor=$2
+shift; shift
+# Remember, the first character of IFS is used to create $*,
+# except with old shells:
+build_os=$*
+IFS=$ac_save_IFS
+case $build_os in *\ *) build_os=`echo "$build_os" | sed 's/ /-/g'`;; esac
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking host system type" >&5
+$as_echo_n "checking host system type... " >&6; }
+if ${ac_cv_host+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if test "x$host_alias" = x; then
+ ac_cv_host=$ac_cv_build
+else
+ ac_cv_host=`$SHELL "$ac_aux_dir/config.sub" $host_alias` ||
+ as_fn_error $? "$SHELL $ac_aux_dir/config.sub $host_alias failed" "$LINENO" 5
+fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_host" >&5
+$as_echo "$ac_cv_host" >&6; }
+case $ac_cv_host in
+*-*-*) ;;
+*) as_fn_error $? "invalid value of canonical host" "$LINENO" 5;;
+esac
+host=$ac_cv_host
+ac_save_IFS=$IFS; IFS='-'
+set x $ac_cv_host
+shift
+host_cpu=$1
+host_vendor=$2
+shift; shift
+# Remember, the first character of IFS is used to create $*,
+# except with old shells:
+host_os=$*
+IFS=$ac_save_IFS
+case $host_os in *\ *) host_os=`echo "$host_os" | sed 's/ /-/g'`;; esac
+
+
+
+
+#These variable are initialized by JD init function
+CONFIG_DIR=`pwd`
+cd $srcdir
+if test "`pwd`" != "$CONFIG_DIR"
+then
+ as_fn_error $? "\"This software does not support configuring from another directory. See the INSTALL file\"" "$LINENO" 5
+fi
+# Note: these will differ if one is a symbolic link
+if test -f /usr/bin/dirname; then
+ JD_Above_Dir=`dirname $CONFIG_DIR`
+else
+# system is a loser
+ JD_Above_Dir=`cd ..;pwd`
+fi
+JD_Above_Dir2=`cd ..;pwd`
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+if test -n "$ac_tool_prefix"; then
+ # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args.
+set dummy ${ac_tool_prefix}gcc; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_CC+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if test -n "$CC"; then
+ ac_cv_prog_CC="$CC" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ for ac_exec_ext in '' $ac_executable_extensions; do
+ if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+ ac_cv_prog_CC="${ac_tool_prefix}gcc"
+ $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+ break 2
+ fi
+done
+ done
+IFS=$as_save_IFS
+
+fi
+fi
+CC=$ac_cv_prog_CC
+if test -n "$CC"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5
+$as_echo "$CC" >&6; }
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_CC"; then
+ ac_ct_CC=$CC
+ # Extract the first word of "gcc", so it can be a program name with args.
+set dummy gcc; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_CC+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if test -n "$ac_ct_CC"; then
+ ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ for ac_exec_ext in '' $ac_executable_extensions; do
+ if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+ ac_cv_prog_ac_ct_CC="gcc"
+ $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+ break 2
+ fi
+done
+ done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_CC=$ac_cv_prog_ac_ct_CC
+if test -n "$ac_ct_CC"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5
+$as_echo "$ac_ct_CC" >&6; }
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+ if test "x$ac_ct_CC" = x; then
+ CC=""
+ else
+ case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+ CC=$ac_ct_CC
+ fi
+else
+ CC="$ac_cv_prog_CC"
+fi
+
+if test -z "$CC"; then
+ if test -n "$ac_tool_prefix"; then
+ # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args.
+set dummy ${ac_tool_prefix}cc; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_CC+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if test -n "$CC"; then
+ ac_cv_prog_CC="$CC" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ for ac_exec_ext in '' $ac_executable_extensions; do
+ if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+ ac_cv_prog_CC="${ac_tool_prefix}cc"
+ $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+ break 2
+ fi
+done
+ done
+IFS=$as_save_IFS
+
+fi
+fi
+CC=$ac_cv_prog_CC
+if test -n "$CC"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5
+$as_echo "$CC" >&6; }
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+ fi
+fi
+if test -z "$CC"; then
+ # Extract the first word of "cc", so it can be a program name with args.
+set dummy cc; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_CC+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if test -n "$CC"; then
+ ac_cv_prog_CC="$CC" # Let the user override the test.
+else
+ ac_prog_rejected=no
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ for ac_exec_ext in '' $ac_executable_extensions; do
+ if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+ if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then
+ ac_prog_rejected=yes
+ continue
+ fi
+ ac_cv_prog_CC="cc"
+ $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+ break 2
+ fi
+done
+ done
+IFS=$as_save_IFS
+
+if test $ac_prog_rejected = yes; then
+ # We found a bogon in the path, so make sure we never use it.
+ set dummy $ac_cv_prog_CC
+ shift
+ if test $# != 0; then
+ # We chose a different compiler from the bogus one.
+ # However, it has the same basename, so the bogon will be chosen
+ # first if we set CC to just the basename; use the full file name.
+ shift
+ ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@"
+ fi
+fi
+fi
+fi
+CC=$ac_cv_prog_CC
+if test -n "$CC"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5
+$as_echo "$CC" >&6; }
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$CC"; then
+ if test -n "$ac_tool_prefix"; then
+ for ac_prog in cl.exe
+ do
+ # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args.
+set dummy $ac_tool_prefix$ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_CC+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if test -n "$CC"; then
+ ac_cv_prog_CC="$CC" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ for ac_exec_ext in '' $ac_executable_extensions; do
+ if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+ ac_cv_prog_CC="$ac_tool_prefix$ac_prog"
+ $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+ break 2
+ fi
+done
+ done
+IFS=$as_save_IFS
+
+fi
+fi
+CC=$ac_cv_prog_CC
+if test -n "$CC"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5
+$as_echo "$CC" >&6; }
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+ test -n "$CC" && break
+ done
+fi
+if test -z "$CC"; then
+ ac_ct_CC=$CC
+ for ac_prog in cl.exe
+do
+ # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_CC+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if test -n "$ac_ct_CC"; then
+ ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ for ac_exec_ext in '' $ac_executable_extensions; do
+ if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+ ac_cv_prog_ac_ct_CC="$ac_prog"
+ $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+ break 2
+ fi
+done
+ done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_CC=$ac_cv_prog_ac_ct_CC
+if test -n "$ac_ct_CC"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5
+$as_echo "$ac_ct_CC" >&6; }
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+ test -n "$ac_ct_CC" && break
+done
+
+ if test "x$ac_ct_CC" = x; then
+ CC=""
+ else
+ case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+ CC=$ac_ct_CC
+ fi
+fi
+
+fi
+
+
+test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "no acceptable C compiler found in \$PATH
+See \`config.log' for more details" "$LINENO" 5; }
+
+# Provide some information about the compiler.
+$as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5
+set X $ac_compile
+ac_compiler=$2
+for ac_option in --version -v -V -qversion; do
+ { { ac_try="$ac_compiler $ac_option >&5"
+case "(($ac_try" in
+ *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+ *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+ (eval "$ac_compiler $ac_option >&5") 2>conftest.err
+ ac_status=$?
+ if test -s conftest.err; then
+ sed '10a\
+... rest of stderr output deleted ...
+ 10q' conftest.err >conftest.er1
+ cat conftest.er1 >&5
+ fi
+ rm -f conftest.er1 conftest.err
+ $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+ test $ac_status = 0; }
+done
+
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+int
+main ()
+{
+
+ ;
+ return 0;
+}
+_ACEOF
+ac_clean_files_save=$ac_clean_files
+ac_clean_files="$ac_clean_files a.out a.out.dSYM a.exe b.out"
+# Try to create an executable without -o first, disregard a.out.
+# It will help us diagnose broken compilers, and finding out an intuition
+# of exeext.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler works" >&5
+$as_echo_n "checking whether the C compiler works... " >&6; }
+ac_link_default=`$as_echo "$ac_link" | sed 's/ -o *conftest^ *//'`
+
+# The possible output files:
+ac_files="a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*"
+
+ac_rmfiles=
+for ac_file in $ac_files
+do
+ case $ac_file in
+ *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;;
+ * ) ac_rmfiles="$ac_rmfiles $ac_file";;
+ esac
+done
+rm -f $ac_rmfiles
+
+if { { ac_try="$ac_link_default"
+case "(($ac_try" in
+ *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+ *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+ (eval "$ac_link_default") 2>&5
+ ac_status=$?
+ $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+ test $ac_status = 0; }; then :
+ # Autoconf-2.13 could set the ac_cv_exeext variable to `no'.
+# So ignore a value of `no', otherwise this would lead to `EXEEXT = no'
+# in a Makefile. We should not override ac_cv_exeext if it was cached,
+# so that the user can short-circuit this test for compilers unknown to
+# Autoconf.
+for ac_file in $ac_files ''
+do
+ test -f "$ac_file" || continue
+ case $ac_file in
+ *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj )
+	;;
+ ab.out )
+	# We found the default executable, but exeext='' is most
+	# certainly right.
+	break;;
+ *.* )
+	if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no;
+	then :; else
+	 ac_cv_exeext=`expr "$ac_file" : '^.*$\..*$'`
+	fi
+	# We set ac_cv_exeext here because the later test for it is not
+	# safe: cross compilers may not add the suffix if given an `-o'
+	# argument, so we may need to know it at that point already.
+	# Even if this section looks crufty: it has the advantage of
+	# actually working.
+	break;;
+ * )
+	break;;
+ esac
+done
+test "$ac_cv_exeext" = no && ac_cv_exeext=
+
+else
+ ac_file=''
+fi
+if test -z "$ac_file"; then :
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+$as_echo "$as_me: failed program was:" >&5
+sed 's/^/| /' conftest.$ac_ext >&5
+
+{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error 77 "C compiler cannot create executables
+See \`config.log' for more details" "$LINENO" 5; }
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler default output file name" >&5
+$as_echo_n "checking for C compiler default output file name... " >&6; }
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_file" >&5
+$as_echo "$ac_file" >&6; }
+ac_exeext=$ac_cv_exeext
+
+rm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out
+ac_clean_files=$ac_clean_files_save
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of executables" >&5
+$as_echo_n "checking for suffix of executables... " >&6; }
+if { { ac_try="$ac_link"
+case "(($ac_try" in
+ *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+ *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+ (eval "$ac_link") 2>&5
+ ac_status=$?
+ $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+ test $ac_status = 0; }; then :
+ # If both `conftest.exe' and `conftest' are `present' (well, observable)
+# catch `conftest.exe'. For instance with Cygwin, `ls conftest' will
+# work properly (i.e., refer to `conftest.exe'), while it won't with
+# `rm'.
+for ac_file in conftest.exe conftest conftest.*; do
+ test -f "$ac_file" || continue
+ case $ac_file in
+ *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;;
+ *.* ) ac_cv_exeext=`expr "$ac_file" : '^.*$\..*$'`
+	 break;;
+ * ) break;;
+ esac
+done
+else
+ { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "cannot compute suffix of executables: cannot compile and link
+See \`config.log' for more details" "$LINENO" 5; }
+fi
+rm -f conftest conftest$ac_cv_exeext
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_exeext" >&5
+$as_echo "$ac_cv_exeext" >&6; }
+
+rm -f conftest.$ac_ext
+EXEEXT=$ac_cv_exeext
+ac_exeext=$EXEEXT
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <stdio.h>
+int
+main ()
+{
+FILE *f = fopen ("conftest.out", "w");
+ return ferror (f) || fclose (f) != 0;
+
+ ;
+ return 0;
+}
+_ACEOF
+ac_clean_files="$ac_clean_files conftest.out"
+# Check that the compiler produces executables we can run. If not, either
+# the compiler is broken, or we cross compile.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are cross compiling" >&5
+$as_echo_n "checking whether we are cross compiling... " >&6; }
+if test "$cross_compiling" != yes; then
+ { { ac_try="$ac_link"
+case "(($ac_try" in
+ *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+ *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+ (eval "$ac_link") 2>&5
+ ac_status=$?
+ $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+ test $ac_status = 0; }
+ if { ac_try='./conftest$ac_cv_exeext'
+ { { case "(($ac_try" in
+ *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+ *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+ (eval "$ac_try") 2>&5
+ ac_status=$?
+ $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+ test $ac_status = 0; }; }; then
+ cross_compiling=no
+ else
+ if test "$cross_compiling" = maybe; then
+	cross_compiling=yes
+ else
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "cannot run C compiled programs.
+If you meant to cross compile, use \`--host'.
+See \`config.log' for more details" "$LINENO" 5; }
+ fi
+ fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $cross_compiling" >&5
+$as_echo "$cross_compiling" >&6; }
+
+rm -f conftest.$ac_ext conftest$ac_cv_exeext conftest.out
+ac_clean_files=$ac_clean_files_save
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of object files" >&5
+$as_echo_n "checking for suffix of object files... " >&6; }
+if ${ac_cv_objext+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+int
+main ()
+{
+
+ ;
+ return 0;
+}
+_ACEOF
+rm -f conftest.o conftest.obj
+if { { ac_try="$ac_compile"
+case "(($ac_try" in
+ *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+ *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+ (eval "$ac_compile") 2>&5
+ ac_status=$?
+ $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+ test $ac_status = 0; }; then :
+ for ac_file in conftest.o conftest.obj conftest.*; do
+ test -f "$ac_file" || continue;
+ case $ac_file in
+ *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;;
+ *) ac_cv_objext=`expr "$ac_file" : '.*\.$.*$'`
+ break;;
+ esac
+done
+else
+ $as_echo "$as_me: failed program was:" >&5
+sed 's/^/| /' conftest.$ac_ext >&5
+
+{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "cannot compute suffix of object files: cannot compile
+See \`config.log' for more details" "$LINENO" 5; }
+fi
+rm -f conftest.$ac_cv_objext conftest.$ac_ext
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext" >&5
+$as_echo "$ac_cv_objext" >&6; }
+OBJEXT=$ac_cv_objext
+ac_objext=$OBJEXT
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5
+$as_echo_n "checking whether we are using the GNU C compiler... " >&6; }
+if ${ac_cv_c_compiler_gnu+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+int
+main ()
+{
+#ifndef __GNUC__
+ choke me
+#endif
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ ac_compiler_gnu=yes
+else
+ ac_compiler_gnu=no
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+ac_cv_c_compiler_gnu=$ac_compiler_gnu
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5
+$as_echo "$ac_cv_c_compiler_gnu" >&6; }
+if test $ac_compiler_gnu = yes; then
+ GCC=yes
+else
+ GCC=
+fi
+ac_test_CFLAGS=${CFLAGS+set}
+ac_save_CFLAGS=$CFLAGS
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5
+$as_echo_n "checking whether $CC accepts -g... " >&6; }
+if ${ac_cv_prog_cc_g+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_save_c_werror_flag=$ac_c_werror_flag
+ ac_c_werror_flag=yes
+ ac_cv_prog_cc_g=no
+ CFLAGS="-g"
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+int
+main ()
+{
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ ac_cv_prog_cc_g=yes
+else
+ CFLAGS=""
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+int
+main ()
+{
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+
+else
+ ac_c_werror_flag=$ac_save_c_werror_flag
+	 CFLAGS="-g"
+	 cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+int
+main ()
+{
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ ac_cv_prog_cc_g=yes
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+ ac_c_werror_flag=$ac_save_c_werror_flag
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5
+$as_echo "$ac_cv_prog_cc_g" >&6; }
+if test "$ac_test_CFLAGS" = set; then
+ CFLAGS=$ac_save_CFLAGS
+elif test $ac_cv_prog_cc_g = yes; then
+ if test "$GCC" = yes; then
+ CFLAGS="-g -O2"
+ else
+ CFLAGS="-g"
+ fi
+else
+ if test "$GCC" = yes; then
+ CFLAGS="-O2"
+ else
+ CFLAGS=
+ fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5
+$as_echo_n "checking for $CC option to accept ISO C89... " >&6; }
+if ${ac_cv_prog_cc_c89+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_cv_prog_cc_c89=no
+ac_save_CC=$CC
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <stdarg.h>
+#include <stdio.h>
+struct stat;
+/* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */
+struct buf { int x; };
+FILE * (*rcsopen) (struct buf *, struct stat *, int);
+static char *e (p, i)
+ char **p;
+ int i;
+{
+ return pi;
+}
+static char *f (char * (*g) (char **, int), char **p, ...)
+{
+ char *s;
+ va_list v;
+ va_start (v,p);
+ s = g (p, va_arg (v,int));
+ va_end (v);
+ return s;
+}
+
+/* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has
+ function prototypes and stuff, but not '\xHH' hex character constants.
+ These don't provoke an error unfortunately, instead are silently treated
+ as 'x'. The following induces an error, until -std is added to get
+ proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an
+ array size at least. It's necessary to write '\x00'==0 to get something
+ that's true only with -std. */
+int osf4_cc_array '\x00' == 0 ? 1 : -1;
+
+/* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters
+ inside strings and character constants. */
+#define FOO(x) 'x'
+int xlc6_cc_arrayFOO(a) == 'x' ? 1 : -1;
+
+int test (int i, double x);
+struct s1 {int (*f) (int a);};
+struct s2 {int (*f) (double a);};
+int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int);
+int argc;
+char **argv;
+int
+main ()
+{
+return f (e, argv, 0) != argv0 || f (e, argv, 1) != argv1;
+ ;
+ return 0;
+}
+_ACEOF
+for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \
+	-Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__"
+do
+ CC="$ac_save_CC $ac_arg"
+ if ac_fn_c_try_compile "$LINENO"; then :
+ ac_cv_prog_cc_c89=$ac_arg
+fi
+rm -f core conftest.err conftest.$ac_objext
+ test "x$ac_cv_prog_cc_c89" != "xno" && break
+done
+rm -f conftest.$ac_ext
+CC=$ac_save_CC
+
+fi
+# AC_CACHE_VAL
+case "x$ac_cv_prog_cc_c89" in
+ x)
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5
+$as_echo "none needed" >&6; } ;;
+ xno)
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5
+$as_echo "unsupported" >&6; } ;;
+ *)
+ CC="$CC $ac_cv_prog_cc_c89"
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5
+$as_echo "$ac_cv_prog_cc_c89" >&6; } ;;
+esac
+if test "x$ac_cv_prog_cc_c89" != xno; then :
+
+fi
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C preprocessor" >&5
+$as_echo_n "checking how to run the C preprocessor... " >&6; }
+# On Suns, sometimes $CPP names a directory.
+if test -n "$CPP" && test -d "$CPP"; then
+ CPP=
+fi
+if test -z "$CPP"; then
+ if ${ac_cv_prog_CPP+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ # Double quotes because CPP needs to be expanded
+ for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp"
+ do
+ ac_preproc_ok=false
+for ac_c_preproc_warn_flag in '' yes
+do
+ # Use a header file that comes with gcc, so configuring glibc
+ # with a fresh cross-compiler works.
+ # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since
+ # <limits.h> exists even on freestanding compilers.
+ # On the NeXT, cc -E runs the code through the compiler's parser,
+ # not just through cpp. "Syntax error" is here to catch this case.
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#ifdef __STDC__
+# include <limits.h>
+#else
+# include <assert.h>
+#endif
+		 Syntax error
+_ACEOF
+if ac_fn_c_try_cpp "$LINENO"; then :
+
+else
+ # Broken: fails on valid input.
+continue
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+ # OK, works on sane cases. Now check whether nonexistent headers
+ # can be detected and how.
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <ac_nonexistent.h>
+_ACEOF
+if ac_fn_c_try_cpp "$LINENO"; then :
+ # Broken: success on invalid input.
+continue
+else
+ # Passes both tests.
+ac_preproc_ok=:
+break
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+done
+# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.
+rm -f conftest.i conftest.err conftest.$ac_ext
+if $ac_preproc_ok; then :
+ break
+fi
+
+ done
+ ac_cv_prog_CPP=$CPP
+
+fi
+ CPP=$ac_cv_prog_CPP
+else
+ ac_cv_prog_CPP=$CPP
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $CPP" >&5
+$as_echo "$CPP" >&6; }
+ac_preproc_ok=false
+for ac_c_preproc_warn_flag in '' yes
+do
+ # Use a header file that comes with gcc, so configuring glibc
+ # with a fresh cross-compiler works.
+ # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since
+ # <limits.h> exists even on freestanding compilers.
+ # On the NeXT, cc -E runs the code through the compiler's parser,
+ # not just through cpp. "Syntax error" is here to catch this case.
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#ifdef __STDC__
+# include <limits.h>
+#else
+# include <assert.h>
+#endif
+		 Syntax error
+_ACEOF
+if ac_fn_c_try_cpp "$LINENO"; then :
+
+else
+ # Broken: fails on valid input.
+continue
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+ # OK, works on sane cases. Now check whether nonexistent headers
+ # can be detected and how.
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <ac_nonexistent.h>
+_ACEOF
+if ac_fn_c_try_cpp "$LINENO"; then :
+ # Broken: success on invalid input.
+continue
+else
+ # Passes both tests.
+ac_preproc_ok=:
+break
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+done
+# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.
+rm -f conftest.i conftest.err conftest.$ac_ext
+if $ac_preproc_ok; then :
+
+else
+ { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "C preprocessor \"$CPP\" fails sanity check
+See \`config.log' for more details" "$LINENO" 5; }
+fi
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e" >&5
+$as_echo_n "checking for grep that handles long lines and -e... " >&6; }
+if ${ac_cv_path_GREP+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if test -z "$GREP"; then
+ ac_path_GREP_found=false
+ # Loop through the user's path and test for each of PROGNAME-LIST
+ as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ for ac_prog in grep ggrep; do
+ for ac_exec_ext in '' $ac_executable_extensions; do
+ ac_path_GREP="$as_dir/$ac_prog$ac_exec_ext"
+ as_fn_executable_p "$ac_path_GREP" || continue
+# Check for GNU ac_path_GREP and select it if it is found.
+ # Check for GNU $ac_path_GREP
+case `"$ac_path_GREP" --version 2>&1` in
+*GNU*)
+ ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_found=:;;
+*)
+ ac_count=0
+ $as_echo_n 0123456789 >"conftest.in"
+ while :
+ do
+ cat "conftest.in" "conftest.in" >"conftest.tmp"
+ mv "conftest.tmp" "conftest.in"
+ cp "conftest.in" "conftest.nl"
+ $as_echo 'GREP' >> "conftest.nl"
+ "$ac_path_GREP" -e 'GREP$' -e '-(cannot match)-' < "conftest.nl" >"conftest.out" 2>/dev/null || break
+ diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break
+ as_fn_arith $ac_count + 1 && ac_count=$as_val
+ if test $ac_count -gt ${ac_path_GREP_max-0}; then
+ # Best one so far, save it but keep looking for a better one
+ ac_cv_path_GREP="$ac_path_GREP"
+ ac_path_GREP_max=$ac_count
+ fi
+ # 10*(2^10) chars as input seems more than enough
+ test $ac_count -gt 10 && break
+ done
+ rm -f conftest.in conftest.tmp conftest.nl conftest.out;;
+esac
+
+ $ac_path_GREP_found && break 3
+ done
+ done
+ done
+IFS=$as_save_IFS
+ if test -z "$ac_cv_path_GREP"; then
+ as_fn_error $? "no acceptable grep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5
+ fi
+else
+ ac_cv_path_GREP=$GREP
+fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_GREP" >&5
+$as_echo "$ac_cv_path_GREP" >&6; }
+ GREP="$ac_cv_path_GREP"
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for egrep" >&5
+$as_echo_n "checking for egrep... " >&6; }
+if ${ac_cv_path_EGREP+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if echo a | $GREP -E '(a|b)' >/dev/null 2>&1
+ then ac_cv_path_EGREP="$GREP -E"
+ else
+ if test -z "$EGREP"; then
+ ac_path_EGREP_found=false
+ # Loop through the user's path and test for each of PROGNAME-LIST
+ as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ for ac_prog in egrep; do
+ for ac_exec_ext in '' $ac_executable_extensions; do
+ ac_path_EGREP="$as_dir/$ac_prog$ac_exec_ext"
+ as_fn_executable_p "$ac_path_EGREP" || continue
+# Check for GNU ac_path_EGREP and select it if it is found.
+ # Check for GNU $ac_path_EGREP
+case `"$ac_path_EGREP" --version 2>&1` in
+*GNU*)
+ ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_found=:;;
+*)
+ ac_count=0
+ $as_echo_n 0123456789 >"conftest.in"
+ while :
+ do
+ cat "conftest.in" "conftest.in" >"conftest.tmp"
+ mv "conftest.tmp" "conftest.in"
+ cp "conftest.in" "conftest.nl"
+ $as_echo 'EGREP' >> "conftest.nl"
+ "$ac_path_EGREP" 'EGREP$' < "conftest.nl" >"conftest.out" 2>/dev/null || break
+ diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break
+ as_fn_arith $ac_count + 1 && ac_count=$as_val
+ if test $ac_count -gt ${ac_path_EGREP_max-0}; then
+ # Best one so far, save it but keep looking for a better one
+ ac_cv_path_EGREP="$ac_path_EGREP"
+ ac_path_EGREP_max=$ac_count
+ fi
+ # 10*(2^10) chars as input seems more than enough
+ test $ac_count -gt 10 && break
+ done
+ rm -f conftest.in conftest.tmp conftest.nl conftest.out;;
+esac
+
+ $ac_path_EGREP_found && break 3
+ done
+ done
+ done
+IFS=$as_save_IFS
+ if test -z "$ac_cv_path_EGREP"; then
+ as_fn_error $? "no acceptable egrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5
+ fi
+else
+ ac_cv_path_EGREP=$EGREP
+fi
+
+ fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_EGREP" >&5
+$as_echo "$ac_cv_path_EGREP" >&6; }
+ EGREP="$ac_cv_path_EGREP"
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5
+$as_echo_n "checking for ANSI C header files... " >&6; }
+if ${ac_cv_header_stdc+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <stdlib.h>
+#include <stdarg.h>
+#include <string.h>
+#include <float.h>
+
+int
+main ()
+{
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ ac_cv_header_stdc=yes
+else
+ ac_cv_header_stdc=no
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+
+if test $ac_cv_header_stdc = yes; then
+ # SunOS 4.x string.h does not declare mem*, contrary to ANSI.
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <string.h>
+
+_ACEOF
+if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
+ $EGREP "memchr" >/dev/null 2>&1; then :
+
+else
+ ac_cv_header_stdc=no
+fi
+rm -f conftest*
+
+fi
+
+if test $ac_cv_header_stdc = yes; then
+ # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI.
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <stdlib.h>
+
+_ACEOF
+if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
+ $EGREP "free" >/dev/null 2>&1; then :
+
+else
+ ac_cv_header_stdc=no
+fi
+rm -f conftest*
+
+fi
+
+if test $ac_cv_header_stdc = yes; then
+ # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi.
+ if test "$cross_compiling" = yes; then :
+ :
+else
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <ctype.h>
+#include <stdlib.h>
+#if ((' ' & 0x0FF) == 0x020)
+# define ISLOWER(c) ('a' <= (c) && (c) <= 'z')
+# define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c))
+#else
+# define ISLOWER(c) \
+		 (('a' <= (c) && (c) <= 'i') \
+		 || ('j' <= (c) && (c) <= 'r') \
+		 || ('s' <= (c) && (c) <= 'z'))
+# define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c))
+#endif
+
+#define XOR(e, f) (((e) && !(f)) || (!(e) && (f)))
+int
+main ()
+{
+ int i;
+ for (i = 0; i < 256; i++)
+ if (XOR (islower (i), ISLOWER (i))
+	|| toupper (i) != TOUPPER (i))
+ return 2;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_run "$LINENO"; then :
+
+else
+ ac_cv_header_stdc=no
+fi
+rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \
+ conftest.$ac_objext conftest.beam conftest.$ac_ext
+fi
+
+fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5
+$as_echo "$ac_cv_header_stdc" >&6; }
+if test $ac_cv_header_stdc = yes; then
+
+$as_echo "#define STDC_HEADERS 1" >>confdefs.h
+
+fi
+
+# On IRIX 5.3, sys/types and inttypes.h are conflicting.
+for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \
+		 inttypes.h stdint.h unistd.h
+do :
+ as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh`
+ac_fn_c_check_header_compile "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default
+"
+if eval test \"x\$"$as_ac_Header"\" = x"yes"; then :
+ cat >>confdefs.h <<_ACEOF
+#define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1
+_ACEOF
+
+fi
+
+done
+
+
+
+ ac_fn_c_check_header_mongrel "$LINENO" "minix/config.h" "ac_cv_header_minix_config_h" "$ac_includes_default"
+if test "x$ac_cv_header_minix_config_h" = xyes; then :
+ MINIX=yes
+else
+ MINIX=
+fi
+
+
+ if test "$MINIX" = yes; then
+
+$as_echo "#define _POSIX_SOURCE 1" >>confdefs.h
+
+
+$as_echo "#define _POSIX_1_SOURCE 2" >>confdefs.h
+
+
+$as_echo "#define _MINIX 1" >>confdefs.h
+
+ fi
+
+
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether it is safe to define __EXTENSIONS__" >&5
+$as_echo_n "checking whether it is safe to define __EXTENSIONS__... " >&6; }
+if ${ac_cv_safe_to_define___extensions__+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+# define __EXTENSIONS__ 1
+ $ac_includes_default
+int
+main ()
+{
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ ac_cv_safe_to_define___extensions__=yes
+else
+ ac_cv_safe_to_define___extensions__=no
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_safe_to_define___extensions__" >&5
+$as_echo "$ac_cv_safe_to_define___extensions__" >&6; }
+ test $ac_cv_safe_to_define___extensions__ = yes &&
+ $as_echo "#define __EXTENSIONS__ 1" >>confdefs.h
+
+ $as_echo "#define _ALL_SOURCE 1" >>confdefs.h
+
+ $as_echo "#define _GNU_SOURCE 1" >>confdefs.h
+
+ $as_echo "#define _POSIX_PTHREAD_SEMANTICS 1" >>confdefs.h
+
+ $as_echo "#define _TANDEM_SOURCE 1" >>confdefs.h
+
+
+if test $ac_cv_c_compiler_gnu = yes; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC needs -traditional" >&5
+$as_echo_n "checking whether $CC needs -traditional... " >&6; }
+if ${ac_cv_prog_gcc_traditional+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_pattern="Autoconf.*'x'"
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <sgtty.h>
+Autoconf TIOCGETP
+_ACEOF
+if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
+ $EGREP "$ac_pattern" >/dev/null 2>&1; then :
+ ac_cv_prog_gcc_traditional=yes
+else
+ ac_cv_prog_gcc_traditional=no
+fi
+rm -f conftest*
+
+
+ if test $ac_cv_prog_gcc_traditional = no; then
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <termio.h>
+Autoconf TCGETA
+_ACEOF
+if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
+ $EGREP "$ac_pattern" >/dev/null 2>&1; then :
+ ac_cv_prog_gcc_traditional=yes
+fi
+rm -f conftest*
+
+ fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_gcc_traditional" >&5
+$as_echo "$ac_cv_prog_gcc_traditional" >&6; }
+ if test $ac_cv_prog_gcc_traditional = yes; then
+ CC="$CC -traditional"
+ fi
+fi
+
+
+
+
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for library containing strerror" >&5
+$as_echo_n "checking for library containing strerror... " >&6; }
+if ${ac_cv_search_strerror+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_func_search_save_LIBS=$LIBS
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char strerror ();
+int
+main ()
+{
+return strerror ();
+ ;
+ return 0;
+}
+_ACEOF
+for ac_lib in '' cposix; do
+ if test -z "$ac_lib"; then
+ ac_res="none required"
+ else
+ ac_res=-l$ac_lib
+ LIBS="-l$ac_lib $ac_func_search_save_LIBS"
+ fi
+ if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_search_strerror=$ac_res
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext
+ if ${ac_cv_search_strerror+:} false; then :
+ break
+fi
+done
+if ${ac_cv_search_strerror+:} false; then :
+
+else
+ ac_cv_search_strerror=no
+fi
+rm conftest.$ac_ext
+LIBS=$ac_func_search_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_search_strerror" >&5
+$as_echo "$ac_cv_search_strerror" >&6; }
+ac_res=$ac_cv_search_strerror
+if test "$ac_res" != no; then :
+ test "$ac_res" = "none required" || LIBS="$ac_res $LIBS"
+
+fi
+
+
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#ifdef hpux
+ yes
+#endif
+
+_ACEOF
+if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
+ $EGREP "yes" >/dev/null 2>&1; then :
+
+
+$as_echo "#define _HPUX_SOURCE 1" >>confdefs.h
+
+if test "$CC" = cc; then CC="cc -Ae"; fi
+
+fi
+rm -f conftest*
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking C compiler that understands ANSI prototypes" >&5
+$as_echo_n "checking C compiler that understands ANSI prototypes... " >&6; }
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+int
+main ()
+{
+
+ extern int silly (int);
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC looks ok. Good." >&5
+$as_echo "$CC looks ok. Good." >&6; }
+else
+
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC is not a good enough compiler" >&5
+$as_echo "$CC is not a good enough compiler" >&6; }
+ as_fn_error $? "Set env variable CC to your ANSI compiler and rerun configure." "$LINENO" 5
+
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5
+$as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; }
+set x ${MAKE-make}
+ac_make=`$as_echo "$2" | sed 's/+/p/g; s/^a-zA-Z0-9_/_/g'`
+if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ cat >conftest.make <<\_ACEOF
+SHELL = /bin/sh
+all:
+	@echo '@@@%%%=$(MAKE)=@@@%%%'
+_ACEOF
+# GNU make sometimes prints "make1: Entering ...", which would confuse us.
+case `${MAKE-make} -f conftest.make 2>/dev/null` in
+ *@@@%%%=?*=@@@%%%*)
+ eval ac_cv_prog_make_${ac_make}_set=yes;;
+ *)
+ eval ac_cv_prog_make_${ac_make}_set=no;;
+esac
+rm -f conftest.make
+fi
+if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+ SET_MAKE=
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+ SET_MAKE="MAKE=${MAKE-make}"
+fi
+
+if test -n "$ac_tool_prefix"; then
+ # Extract the first word of "${ac_tool_prefix}ranlib", so it can be a program name with args.
+set dummy ${ac_tool_prefix}ranlib; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_RANLIB+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if test -n "$RANLIB"; then
+ ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ for ac_exec_ext in '' $ac_executable_extensions; do
+ if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+ ac_cv_prog_RANLIB="${ac_tool_prefix}ranlib"
+ $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+ break 2
+ fi
+done
+ done
+IFS=$as_save_IFS
+
+fi
+fi
+RANLIB=$ac_cv_prog_RANLIB
+if test -n "$RANLIB"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: $RANLIB" >&5
+$as_echo "$RANLIB" >&6; }
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_RANLIB"; then
+ ac_ct_RANLIB=$RANLIB
+ # Extract the first word of "ranlib", so it can be a program name with args.
+set dummy ranlib; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_RANLIB+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if test -n "$ac_ct_RANLIB"; then
+ ac_cv_prog_ac_ct_RANLIB="$ac_ct_RANLIB" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ for ac_exec_ext in '' $ac_executable_extensions; do
+ if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+ ac_cv_prog_ac_ct_RANLIB="ranlib"
+ $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+ break 2
+ fi
+done
+ done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB
+if test -n "$ac_ct_RANLIB"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_RANLIB" >&5
+$as_echo "$ac_ct_RANLIB" >&6; }
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+ if test "x$ac_ct_RANLIB" = x; then
+ RANLIB=":"
+ else
+ case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+ RANLIB=$ac_ct_RANLIB
+ fi
+else
+ RANLIB="$ac_cv_prog_RANLIB"
+fi
+
+# Find a good install program. We prefer a C program (faster),
+# so one script is as good as another. But avoid the broken or
+# incompatible versions:
+# SysV /etc/install, /usr/sbin/install
+# SunOS /usr/etc/install
+# IRIX /sbin/install
+# AIX /bin/install
+# AmigaOS /C/install, which installs bootblocks on floppy discs
+# AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag
+# AFS /usr/afsws/bin/install, which mishandles nonexistent args
+# SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff"
+# OS/2's system install, which has a completely different semantic
+# ./install, which can be erroneously created by make from ./install.sh.
+# Reject install programs that cannot install multiple files.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5
+$as_echo_n "checking for a BSD-compatible install... " >&6; }
+if test -z "$INSTALL"; then
+if ${ac_cv_path_install+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ # Account for people who put trailing slashes in PATH elements.
+case $as_dir/ in #((
+ ./ | .// | /cC/* | \
+ /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \
+ ?:\\/os2\\/install\\/* | ?:\\/OS2\\/INSTALL\\/* | \
+ /usr/ucb/* ) ;;
+ *)
+ # OSF1 and SCO ODT 3.0 have their own names for install.
+ # Don't use installbsd from OSF since it installs stuff as root
+ # by default.
+ for ac_prog in ginstall scoinst install; do
+ for ac_exec_ext in '' $ac_executable_extensions; do
+	if as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then
+	 if test $ac_prog = install &&
+	 grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	 # AIX install. It has an incompatible calling convention.
+	 :
+	 elif test $ac_prog = install &&
+	 grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	 # program-specific install script used by HP pwplus--don't use.
+	 :
+	 else
+	 rm -rf conftest.one conftest.two conftest.dir
+	 echo one > conftest.one
+	 echo two > conftest.two
+	 mkdir conftest.dir
+	 if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" &&
+	 test -s conftest.one && test -s conftest.two &&
+	 test -s conftest.dir/conftest.one &&
+	 test -s conftest.dir/conftest.two
+	 then
+	 ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c"
+	 break 3
+	 fi
+	 fi
+	fi
+ done
+ done
+ ;;
+esac
+
+ done
+IFS=$as_save_IFS
+
+rm -rf conftest.one conftest.two conftest.dir
+
+fi
+ if test "${ac_cv_path_install+set}" = set; then
+ INSTALL=$ac_cv_path_install
+ else
+ # As a last resort, use the slow shell script. Don't cache a
+ # value for INSTALL within a source directory, because that will
+ # break other packages using the cache if that directory is
+ # removed, or if the value is a relative name.
+ INSTALL=$ac_install_sh
+ fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5
+$as_echo "$INSTALL" >&6; }
+
+# Use test -z because SunOS4 sh mishandles braces in ${var-val}.
+# It thinks the first close brace ends the variable substitution.
+test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}'
+
+test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}'
+
+test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644'
+
+
+
+# Check whether --with-pkgconfigdir was given.
+if test "${with_pkgconfigdir+set}" = set; then :
+ withval=$with_pkgconfigdir; pkgconfigdir=${withval}
+else
+ pkgconfigdir='${libdir}/pkgconfig'
+fi
+
+
+
+
+# Check whether --with-terminfo was given.
+if test "${with_terminfo+set}" = set; then :
+ withval=$with_terminfo; jd_with_terminfo_arg=$withval
+else
+ jd_with_terminfo_arg=default
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking terminfo layout" >&5
+$as_echo_n "checking terminfo layout... " >&6; }
+if test "x$jd_with_terminfo_arg" = "x"
+then
+ jd_with_terminfo_arg="default"
+fi
+if test -r src/terminfo/$jd_with_terminfo_arg.inc
+then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: $jd_with_terminfo_arg" >&5
+$as_echo "$jd_with_terminfo_arg" >&6; }
+ TERMINFO_LAYOUT="$jd_with_terminfo_arg"
+else
+ as_fn_error $? "-\"-with-terminfo=$jd_with_terminfo_arg is invalid. src/terminfo/$jd_with_terminfo_arg.inc does not exist\"" "$LINENO" 5
+fi
+
+
+
+# Check whether --with-readline was given.
+if test "${with_readline+set}" = set; then :
+ withval=$with_readline; jd_with_readline_arg=$withval
+else
+ jd_with_readline_arg=slang
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking type of readline support for slsh" >&5
+$as_echo_n "checking type of readline support for slsh... " >&6; }
+case "x$jd_with_readline_arg" in
+ xgnu|xGNU )
+ GNU_READLINE=1
+ LIB_READLINE=-lreadline
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: gnu" >&5
+$as_echo "gnu" >&6; };
+ ;;
+ *)
+ GNU_READLINE=0
+ LIB_READLINE="# -lreadline"
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: slang" >&5
+$as_echo "slang" >&6; };
+ ;;
+esac
+
+
+
+
+# Check whether --with-slsyswrap was given.
+if test "${with_slsyswrap+set}" = set; then :
+ withval=$with_slsyswrap; jd_with_slsyswrap_arg=$withval
+else
+ jd_with_slsyswrap_arg=no
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for slsyswrap" >&5
+$as_echo_n "checking for slsyswrap... " >&6; }
+
+case "x$jd_with_slsyswrap_arg" in
+ x|xno)
+ DSLSYSWRAP=""
+ LIB_SLSYSWRAP=""
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; };
+ ;;
+ *)
+ DSLSYSWRAP="-I$jd_with_slsyswrap_arg/include -DSLSYSWRAP=1"
+ LIB_SLSYSWRAP="-L$jd_with_slsyswrap_arg/lib -lslsyswrap"
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; };
+ ;;
+esac
+
+
+
+# For the socket module
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for X" >&5
+$as_echo_n "checking for X... " >&6; }
+
+
+# Check whether --with-x was given.
+if test "${with_x+set}" = set; then :
+ withval=$with_x;
+fi
+
+# $have_x is `yes', `no', `disabled', or empty when we do not yet know.
+if test "x$with_x" = xno; then
+ # The user explicitly disabled X.
+ have_x=disabled
+else
+ case $x_includes,$x_libraries in #(
+ *\'*) as_fn_error $? "cannot use X directory names containing '" "$LINENO" 5;; #(
+ *,NONE | NONE,*) if ${ac_cv_have_x+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ # One or both of the vars are not set, and there is no cached value.
+ac_x_includes=no ac_x_libraries=no
+rm -f -r conftest.dir
+if mkdir conftest.dir; then
+ cd conftest.dir
+ cat >Imakefile <<'_ACEOF'
+incroot:
+	@echo incroot='${INCROOT}'
+usrlibdir:
+	@echo usrlibdir='${USRLIBDIR}'
+libdir:
+	@echo libdir='${LIBDIR}'
+_ACEOF
+ if (export CC; ${XMKMF-xmkmf}) >/dev/null 2>/dev/null && test -f Makefile; then
+ # GNU make sometimes prints "make1: Entering ...", which would confuse us.
+ for ac_var in incroot usrlibdir libdir; do
+ eval "ac_im_$ac_var=\`\${MAKE-make} $ac_var 2>/dev/null | sed -n 's/^$ac_var=//p'\`"
+ done
+ # Open Windows xmkmf reportedly sets LIBDIR instead of USRLIBDIR.
+ for ac_extension in a so sl dylib la dll; do
+ if test ! -f "$ac_im_usrlibdir/libX11.$ac_extension" &&
+	 test -f "$ac_im_libdir/libX11.$ac_extension"; then
+	ac_im_usrlibdir=$ac_im_libdir; break
+ fi
+ done
+ # Screen out bogus values from the imake configuration. They are
+ # bogus both because they are the default anyway, and because
+ # using them would break gcc on systems where it needs fixed includes.
+ case $ac_im_incroot in
+	/usr/include) ac_x_includes= ;;
+	*) test -f "$ac_im_incroot/X11/Xos.h" && ac_x_includes=$ac_im_incroot;;
+ esac
+ case $ac_im_usrlibdir in
+	/usr/lib | /usr/lib64 | /lib | /lib64) ;;
+	*) test -d "$ac_im_usrlibdir" && ac_x_libraries=$ac_im_usrlibdir ;;
+ esac
+ fi
+ cd ..
+ rm -f -r conftest.dir
+fi
+
+# Standard set of common directories for X headers.
+# Check X11 before X11Rn because it is often a symlink to the current release.
+ac_x_header_dirs='
+/usr/X11/include
+/usr/X11R7/include
+/usr/X11R6/include
+/usr/X11R5/include
+/usr/X11R4/include
+
+/usr/include/X11
+/usr/include/X11R7
+/usr/include/X11R6
+/usr/include/X11R5
+/usr/include/X11R4
+
+/usr/local/X11/include
+/usr/local/X11R7/include
+/usr/local/X11R6/include
+/usr/local/X11R5/include
+/usr/local/X11R4/include
+
+/usr/local/include/X11
+/usr/local/include/X11R7
+/usr/local/include/X11R6
+/usr/local/include/X11R5
+/usr/local/include/X11R4
+
+/usr/X386/include
+/usr/x386/include
+/usr/XFree86/include/X11
+
+/usr/include
+/usr/local/include
+/usr/unsupported/include
+/usr/athena/include
+/usr/local/x11r5/include
+/usr/lpp/Xamples/include
+
+/usr/openwin/include
+/usr/openwin/share/include'
+
+if test "$ac_x_includes" = no; then
+ # Guess where to find include files, by looking for Xlib.h.
+ # First, try using that file with no special directory specified.
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <X11/Xlib.h>
+_ACEOF
+if ac_fn_c_try_cpp "$LINENO"; then :
+ # We can compile using X headers with no special include directory.
+ac_x_includes=
+else
+ for ac_dir in $ac_x_header_dirs; do
+ if test -r "$ac_dir/X11/Xlib.h"; then
+ ac_x_includes=$ac_dir
+ break
+ fi
+done
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+fi # $ac_x_includes = no
+
+if test "$ac_x_libraries" = no; then
+ # Check for the libraries.
+ # See if we find them without any special options.
+ # Don't add to $LIBS permanently.
+ ac_save_LIBS=$LIBS
+ LIBS="-lX11 $LIBS"
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <X11/Xlib.h>
+int
+main ()
+{
+XrmInitialize ()
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ LIBS=$ac_save_LIBS
+# We can link X programs with no special library path.
+ac_x_libraries=
+else
+ LIBS=$ac_save_LIBS
+for ac_dir in `$as_echo "$ac_x_includes $ac_x_header_dirs" | sed s/include/lib/g`
+do
+ # Don't even attempt the hair of trying to link an X program!
+ for ac_extension in a so sl dylib la dll; do
+ if test -r "$ac_dir/libX11.$ac_extension"; then
+ ac_x_libraries=$ac_dir
+ break 2
+ fi
+ done
+done
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+fi # $ac_x_libraries = no
+
+case $ac_x_includes,$ac_x_libraries in #(
+ no,* | *,no | *\'*)
+ # Didn't find X, or a directory has "'" in its name.
+ ac_cv_have_x="have_x=no";; #(
+ *)
+ # Record where we found X for the cache.
+ ac_cv_have_x="have_x=yes\
+	ac_x_includes='$ac_x_includes'\
+	ac_x_libraries='$ac_x_libraries'"
+esac
+fi
+;; #(
+ *) have_x=yes;;
+ esac
+ eval "$ac_cv_have_x"
+fi # $with_x != no
+
+if test "$have_x" != yes; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: $have_x" >&5
+$as_echo "$have_x" >&6; }
+ no_x=yes
+else
+ # If each of the values was on the command line, it overrides each guess.
+ test "x$x_includes" = xNONE && x_includes=$ac_x_includes
+ test "x$x_libraries" = xNONE && x_libraries=$ac_x_libraries
+ # Update the cache value to reflect the command line values.
+ ac_cv_have_x="have_x=yes\
+	ac_x_includes='$x_includes'\
+	ac_x_libraries='$x_libraries'"
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: libraries $x_libraries, headers $x_includes" >&5
+$as_echo "libraries $x_libraries, headers $x_includes" >&6; }
+fi
+
+if test "$no_x" = yes; then
+ # Not all programs may use this symbol, but it does not hurt to define it.
+
+$as_echo "#define X_DISPLAY_MISSING 1" >>confdefs.h
+
+ X_CFLAGS= X_PRE_LIBS= X_LIBS= X_EXTRA_LIBS=
+else
+ if test -n "$x_includes"; then
+ X_CFLAGS="$X_CFLAGS -I$x_includes"
+ fi
+
+ # It would also be nice to do this for all -L options, not just this one.
+ if test -n "$x_libraries"; then
+ X_LIBS="$X_LIBS -L$x_libraries"
+ # For Solaris; some versions of Sun CC require a space after -R and
+ # others require no space. Words are not sufficient . . . .
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -R must be followed by a space" >&5
+$as_echo_n "checking whether -R must be followed by a space... " >&6; }
+ ac_xsave_LIBS=$LIBS; LIBS="$LIBS -R$x_libraries"
+ ac_xsave_c_werror_flag=$ac_c_werror_flag
+ ac_c_werror_flag=yes
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+int
+main ()
+{
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+ X_LIBS="$X_LIBS -R$x_libraries"
+else
+ LIBS="$ac_xsave_LIBS -R $x_libraries"
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+int
+main ()
+{
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	 X_LIBS="$X_LIBS -R $x_libraries"
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: neither works" >&5
+$as_echo "neither works" >&6; }
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+ ac_c_werror_flag=$ac_xsave_c_werror_flag
+ LIBS=$ac_xsave_LIBS
+ fi
+
+ # Check for system-dependent libraries X programs must link with.
+ # Do this before checking for the system-independent R6 libraries
+ # (-lICE), since we may need -lsocket or whatever for X linking.
+
+ if test "$ISC" = yes; then
+ X_EXTRA_LIBS="$X_EXTRA_LIBS -lnsl_s -linet"
+ else
+ # Martyn Johnson says this is needed for Ultrix, if the X
+ # libraries were built with DECnet support. And Karl Berry says
+ # the Alpha needs dnet_stub (dnet does not exist).
+ ac_xsave_LIBS="$LIBS"; LIBS="$LIBS $X_LIBS -lX11"
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char XOpenDisplay ();
+int
+main ()
+{
+return XOpenDisplay ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dnet_ntoa in -ldnet" >&5
+$as_echo_n "checking for dnet_ntoa in -ldnet... " >&6; }
+if ${ac_cv_lib_dnet_dnet_ntoa+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-ldnet $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char dnet_ntoa ();
+int
+main ()
+{
+return dnet_ntoa ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_dnet_dnet_ntoa=yes
+else
+ ac_cv_lib_dnet_dnet_ntoa=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dnet_dnet_ntoa" >&5
+$as_echo "$ac_cv_lib_dnet_dnet_ntoa" >&6; }
+if test "x$ac_cv_lib_dnet_dnet_ntoa" = xyes; then :
+ X_EXTRA_LIBS="$X_EXTRA_LIBS -ldnet"
+fi
+
+ if test $ac_cv_lib_dnet_dnet_ntoa = no; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dnet_ntoa in -ldnet_stub" >&5
+$as_echo_n "checking for dnet_ntoa in -ldnet_stub... " >&6; }
+if ${ac_cv_lib_dnet_stub_dnet_ntoa+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-ldnet_stub $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char dnet_ntoa ();
+int
+main ()
+{
+return dnet_ntoa ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_dnet_stub_dnet_ntoa=yes
+else
+ ac_cv_lib_dnet_stub_dnet_ntoa=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dnet_stub_dnet_ntoa" >&5
+$as_echo "$ac_cv_lib_dnet_stub_dnet_ntoa" >&6; }
+if test "x$ac_cv_lib_dnet_stub_dnet_ntoa" = xyes; then :
+ X_EXTRA_LIBS="$X_EXTRA_LIBS -ldnet_stub"
+fi
+
+ fi
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+ LIBS="$ac_xsave_LIBS"
+
+ # msh@cis.ufl.edu says -lnsl (and -lsocket) are needed for his 386/AT,
+ # to get the SysV transport functions.
+ # Chad R. Larson says the Pyramis MIS-ES running DC/OSx (SVR4)
+ # needs -lnsl.
+ # The nsl library prevents programs from opening the X display
+ # on Irix 5.2, according to T.E. Dickey.
+ # The functions gethostbyname, getservbyname, and inet_addr are
+ # in -lbsd on LynxOS 3.0.1/i386, according to Lars Hecking.
+ ac_fn_c_check_func "$LINENO" "gethostbyname" "ac_cv_func_gethostbyname"
+if test "x$ac_cv_func_gethostbyname" = xyes; then :
+
+fi
+
+ if test $ac_cv_func_gethostbyname = no; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for gethostbyname in -lnsl" >&5
+$as_echo_n "checking for gethostbyname in -lnsl... " >&6; }
+if ${ac_cv_lib_nsl_gethostbyname+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lnsl $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char gethostbyname ();
+int
+main ()
+{
+return gethostbyname ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_nsl_gethostbyname=yes
+else
+ ac_cv_lib_nsl_gethostbyname=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_nsl_gethostbyname" >&5
+$as_echo "$ac_cv_lib_nsl_gethostbyname" >&6; }
+if test "x$ac_cv_lib_nsl_gethostbyname" = xyes; then :
+ X_EXTRA_LIBS="$X_EXTRA_LIBS -lnsl"
+fi
+
+ if test $ac_cv_lib_nsl_gethostbyname = no; then
+	{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for gethostbyname in -lbsd" >&5
+$as_echo_n "checking for gethostbyname in -lbsd... " >&6; }
+if ${ac_cv_lib_bsd_gethostbyname+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lbsd $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char gethostbyname ();
+int
+main ()
+{
+return gethostbyname ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_bsd_gethostbyname=yes
+else
+ ac_cv_lib_bsd_gethostbyname=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_bsd_gethostbyname" >&5
+$as_echo "$ac_cv_lib_bsd_gethostbyname" >&6; }
+if test "x$ac_cv_lib_bsd_gethostbyname" = xyes; then :
+ X_EXTRA_LIBS="$X_EXTRA_LIBS -lbsd"
+fi
+
+ fi
+ fi
+
+ # lieder@skyler.mavd.honeywell.com says without -lsocket,
+ # socket/setsockopt and other routines are undefined under SCO ODT
+ # 2.0. But -lsocket is broken on IRIX 5.2 (and is not necessary
+ # on later versions), says Simon Leinen: it contains gethostby*
+ # variants that don't use the name server (or something). -lsocket
+ # must be given before -lnsl if both are needed. We assume that
+ # if connect needs -lnsl, so does gethostbyname.
+ ac_fn_c_check_func "$LINENO" "connect" "ac_cv_func_connect"
+if test "x$ac_cv_func_connect" = xyes; then :
+
+fi
+
+ if test $ac_cv_func_connect = no; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for connect in -lsocket" >&5
+$as_echo_n "checking for connect in -lsocket... " >&6; }
+if ${ac_cv_lib_socket_connect+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lsocket $X_EXTRA_LIBS $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char connect ();
+int
+main ()
+{
+return connect ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_socket_connect=yes
+else
+ ac_cv_lib_socket_connect=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_socket_connect" >&5
+$as_echo "$ac_cv_lib_socket_connect" >&6; }
+if test "x$ac_cv_lib_socket_connect" = xyes; then :
+ X_EXTRA_LIBS="-lsocket $X_EXTRA_LIBS"
+fi
+
+ fi
+
+ # Guillermo Gomez says -lposix is necessary on A/UX.
+ ac_fn_c_check_func "$LINENO" "remove" "ac_cv_func_remove"
+if test "x$ac_cv_func_remove" = xyes; then :
+
+fi
+
+ if test $ac_cv_func_remove = no; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for remove in -lposix" >&5
+$as_echo_n "checking for remove in -lposix... " >&6; }
+if ${ac_cv_lib_posix_remove+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lposix $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char remove ();
+int
+main ()
+{
+return remove ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_posix_remove=yes
+else
+ ac_cv_lib_posix_remove=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_posix_remove" >&5
+$as_echo "$ac_cv_lib_posix_remove" >&6; }
+if test "x$ac_cv_lib_posix_remove" = xyes; then :
+ X_EXTRA_LIBS="$X_EXTRA_LIBS -lposix"
+fi
+
+ fi
+
+ # BSDI BSD/OS 2.1 needs -lipc for XOpenDisplay.
+ ac_fn_c_check_func "$LINENO" "shmat" "ac_cv_func_shmat"
+if test "x$ac_cv_func_shmat" = xyes; then :
+
+fi
+
+ if test $ac_cv_func_shmat = no; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for shmat in -lipc" >&5
+$as_echo_n "checking for shmat in -lipc... " >&6; }
+if ${ac_cv_lib_ipc_shmat+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lipc $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char shmat ();
+int
+main ()
+{
+return shmat ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_ipc_shmat=yes
+else
+ ac_cv_lib_ipc_shmat=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_ipc_shmat" >&5
+$as_echo "$ac_cv_lib_ipc_shmat" >&6; }
+if test "x$ac_cv_lib_ipc_shmat" = xyes; then :
+ X_EXTRA_LIBS="$X_EXTRA_LIBS -lipc"
+fi
+
+ fi
+ fi
+
+ # Check for libraries that X11R6 Xt/Xaw programs need.
+ ac_save_LDFLAGS=$LDFLAGS
+ test -n "$x_libraries" && LDFLAGS="$LDFLAGS -L$x_libraries"
+ # SM needs ICE to (dynamically) link under SunOS 4.x (so we have to
+ # check for ICE first), but we must link in the order -lSM -lICE or
+ # we get undefined symbols. So assume we have SM if we have ICE.
+ # These have to be linked with before -lX11, unlike the other
+ # libraries we check for below, so use a different variable.
+ # John Interrante, Karl Berry
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for IceConnectionNumber in -lICE" >&5
+$as_echo_n "checking for IceConnectionNumber in -lICE... " >&6; }
+if ${ac_cv_lib_ICE_IceConnectionNumber+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lICE $X_EXTRA_LIBS $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char IceConnectionNumber ();
+int
+main ()
+{
+return IceConnectionNumber ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_ICE_IceConnectionNumber=yes
+else
+ ac_cv_lib_ICE_IceConnectionNumber=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_ICE_IceConnectionNumber" >&5
+$as_echo "$ac_cv_lib_ICE_IceConnectionNumber" >&6; }
+if test "x$ac_cv_lib_ICE_IceConnectionNumber" = xyes; then :
+ X_PRE_LIBS="$X_PRE_LIBS -lSM -lICE"
+fi
+
+ LDFLAGS=$ac_save_LDFLAGS
+
+fi
+
+
+#Check these header since they cause trouble
+for ac_header in \
+stdlib.h \
+unistd.h \
+memory.h \
+termios.h \
+malloc.h \
+locale.h \
+xlocale.h \
+langinfo.h \
+fcntl.h \
+sys/fcntl.h \
+sys/types.h \
+sys/wait.h \
+sys/utsname.h \
+sys/times.h \
+sys/statvfs.h \
+sys/time.h \
+utime.h \
+floatingpoint.h \
+ieeefp.h \
+nan.h \
+fenv.h \
+sys/mman.h \
+sys/socket.h \
+netinet/in.h \
+arpa/inet.h \
+sys/un.h \
+sys/resource.h \
+
+do :
+ as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh`
+ac_fn_c_check_header_mongrel "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default"
+if eval test \"x\$"$as_ac_Header"\" = x"yes"; then :
+ cat >>confdefs.h <<_ACEOF
+#define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1
+_ACEOF
+
+fi
+
+done
+
+
+ac_fn_c_check_type "$LINENO" "mode_t" "ac_cv_type_mode_t" "$ac_includes_default"
+if test "x$ac_cv_type_mode_t" = xyes; then :
+
+else
+
+cat >>confdefs.h <<_ACEOF
+#define mode_t int
+_ACEOF
+
+fi
+
+ac_fn_c_check_type "$LINENO" "pid_t" "ac_cv_type_pid_t" "$ac_includes_default"
+if test "x$ac_cv_type_pid_t" = xyes; then :
+
+else
+
+cat >>confdefs.h <<_ACEOF
+#define pid_t int
+_ACEOF
+
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for uid_t in sys/types.h" >&5
+$as_echo_n "checking for uid_t in sys/types.h... " >&6; }
+if ${ac_cv_type_uid_t+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <sys/types.h>
+
+_ACEOF
+if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
+ $EGREP "uid_t" >/dev/null 2>&1; then :
+ ac_cv_type_uid_t=yes
+else
+ ac_cv_type_uid_t=no
+fi
+rm -f conftest*
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_type_uid_t" >&5
+$as_echo "$ac_cv_type_uid_t" >&6; }
+if test $ac_cv_type_uid_t = no; then
+
+$as_echo "#define uid_t int" >>confdefs.h
+
+
+$as_echo "#define gid_t int" >>confdefs.h
+
+fi
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for socklen_t" >&5
+$as_echo_n "checking for socklen_t... " >&6; }
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <sys/socket.h>
+
+_ACEOF
+if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
+ $EGREP "socklen_t" >/dev/null 2>&1; then :
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+
+$as_echo "#define socklen_t int" >>confdefs.h
+
+fi
+rm -f conftest*
+
+
+ac_header_dirent=no
+for ac_hdr in dirent.h sys/ndir.h sys/dir.h ndir.h; do
+ as_ac_Header=`$as_echo "ac_cv_header_dirent_$ac_hdr" | $as_tr_sh`
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_hdr that defines DIR" >&5
+$as_echo_n "checking for $ac_hdr that defines DIR... " >&6; }
+if eval \${$as_ac_Header+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <sys/types.h>
+#include <$ac_hdr>
+
+int
+main ()
+{
+if ((DIR *) 0)
+return 0;
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ eval "$as_ac_Header=yes"
+else
+ eval "$as_ac_Header=no"
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+fi
+eval ac_res=\$$as_ac_Header
+	 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5
+$as_echo "$ac_res" >&6; }
+if eval test \"x\$"$as_ac_Header"\" = x"yes"; then :
+ cat >>confdefs.h <<_ACEOF
+#define `$as_echo "HAVE_$ac_hdr" | $as_tr_cpp` 1
+_ACEOF
+
+ac_header_dirent=$ac_hdr; break
+fi
+
+done
+# Two versions of opendir et al. are in -ldir and -lx on SCO Xenix.
+if test $ac_header_dirent = dirent.h; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for library containing opendir" >&5
+$as_echo_n "checking for library containing opendir... " >&6; }
+if ${ac_cv_search_opendir+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_func_search_save_LIBS=$LIBS
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char opendir ();
+int
+main ()
+{
+return opendir ();
+ ;
+ return 0;
+}
+_ACEOF
+for ac_lib in '' dir; do
+ if test -z "$ac_lib"; then
+ ac_res="none required"
+ else
+ ac_res=-l$ac_lib
+ LIBS="-l$ac_lib $ac_func_search_save_LIBS"
+ fi
+ if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_search_opendir=$ac_res
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext
+ if ${ac_cv_search_opendir+:} false; then :
+ break
+fi
+done
+if ${ac_cv_search_opendir+:} false; then :
+
+else
+ ac_cv_search_opendir=no
+fi
+rm conftest.$ac_ext
+LIBS=$ac_func_search_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_search_opendir" >&5
+$as_echo "$ac_cv_search_opendir" >&6; }
+ac_res=$ac_cv_search_opendir
+if test "$ac_res" != no; then :
+ test "$ac_res" = "none required" || LIBS="$ac_res $LIBS"
+
+fi
+
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for library containing opendir" >&5
+$as_echo_n "checking for library containing opendir... " >&6; }
+if ${ac_cv_search_opendir+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_func_search_save_LIBS=$LIBS
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char opendir ();
+int
+main ()
+{
+return opendir ();
+ ;
+ return 0;
+}
+_ACEOF
+for ac_lib in '' x; do
+ if test -z "$ac_lib"; then
+ ac_res="none required"
+ else
+ ac_res=-l$ac_lib
+ LIBS="-l$ac_lib $ac_func_search_save_LIBS"
+ fi
+ if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_search_opendir=$ac_res
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext
+ if ${ac_cv_search_opendir+:} false; then :
+ break
+fi
+done
+if ${ac_cv_search_opendir+:} false; then :
+
+else
+ ac_cv_search_opendir=no
+fi
+rm conftest.$ac_ext
+LIBS=$ac_func_search_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_search_opendir" >&5
+$as_echo "$ac_cv_search_opendir" >&6; }
+ac_res=$ac_cv_search_opendir
+if test "$ac_res" != no; then :
+ test "$ac_res" = "none required" || LIBS="$ac_res $LIBS"
+
+fi
+
+fi
+
+
+for ac_func in \
+memset \
+memcpy \
+putenv \
+getcwd \
+setlocale \
+tcgetattr \
+tcsetattr \
+cfgetospeed \
+sigaction \
+sigemptyset \
+sigprocmask \
+sigaddset \
+alarm \
+pause \
+vfscanf \
+lstat readlink symlink link \
+kill killpg \
+snprintf vsnprintf \
+getppid getegid geteuid getuid getgid setgid setuid \
+setpgid getpgid setpgrp getpgrp setsid getsid \
+mmap \
+chown lchown popen mkfifo \
+atexit on_exit umask uname \
+times gmtime mktime gettimeofday \
+getitimer setitimer \
+gmtime_r ctime_r localtime_r \
+strtod atoll strtoll \
+issetugid \
+isnan \
+finite \
+isinf \
+round \
+siglongjmp \
+fork waitpid \
+socket socketpair \
+confstr pathconf \
+getpriority setpriority \
+getrusage \
+setvbuf \
+utime utimes \
+ttyname ttyname_r \
+newlocale strtod_l localeconv \
+statvfs \
+
+do :
+ as_ac_var=`$as_echo "ac_cv_func_$ac_func" | $as_tr_sh`
+ac_fn_c_check_func "$LINENO" "$ac_func" "$as_ac_var"
+if eval test \"x\$"$as_ac_var"\" = x"yes"; then :
+ cat >>confdefs.h <<_ACEOF
+#define `$as_echo "HAVE_$ac_func" | $as_tr_cpp` 1
+_ACEOF
+
+fi
+done
+
+
+if test x"$ac_cv_func_socketpair" != x"yes"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for socketpair in -lsocket" >&5
+$as_echo_n "checking for socketpair in -lsocket... " >&6; }
+if ${ac_cv_lib_socket_socketpair+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lsocket $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char socketpair ();
+int
+main ()
+{
+return socketpair ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_socket_socketpair=yes
+else
+ ac_cv_lib_socket_socketpair=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_socket_socketpair" >&5
+$as_echo "$ac_cv_lib_socket_socketpair" >&6; }
+if test "x$ac_cv_lib_socket_socketpair" = xyes; then :
+ $as_echo "#define HAVE_SOCKETPAIR 1" >>confdefs.h
+
+fi
+
+fi
+if test x"$ac_cv_func_socket" != x"yes"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for socket in -lsocket" >&5
+$as_echo_n "checking for socket in -lsocket... " >&6; }
+if ${ac_cv_lib_socket_socket+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lsocket $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char socket ();
+int
+main ()
+{
+return socket ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_socket_socket=yes
+else
+ ac_cv_lib_socket_socket=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_socket_socket" >&5
+$as_echo "$ac_cv_lib_socket_socket" >&6; }
+if test "x$ac_cv_lib_socket_socket" = xyes; then :
+ $as_echo "#define HAVE_SOCKET 1" >>confdefs.h
+
+fi
+
+fi
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for nl_langinfo and CODESET" >&5
+$as_echo_n "checking for nl_langinfo and CODESET... " >&6; }
+if ${jd_cv_nl_langinfo_codeset+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <langinfo.h>
+int
+main ()
+{
+char* cs = nl_langinfo(CODESET);
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ jd_cv_nl_langinfo_codeset=yes
+else
+ jd_cv_nl_langinfo_codeset=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $jd_cv_nl_langinfo_codeset" >&5
+$as_echo "$jd_cv_nl_langinfo_codeset" >&6; }
+if test $jd_cv_nl_langinfo_codeset = yes
+then
+
+$as_echo "#define HAVE_NL_LANGINFO_CODESET 1" >>confdefs.h
+
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for environ variable" >&5
+$as_echo_n "checking for environ variable... " >&6; }
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+#include <stdlib.h>
+extern char **environ;
+
+int
+main ()
+{
+exit (environ == NULL);
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ have_environ=yes
+else
+ have_environ=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $have_environ" >&5
+$as_echo "$have_environ" >&6; }
+if test $have_environ = yes
+then
+
+$as_echo "#define HAVE_ENVIRON 1" >>confdefs.h
+
+fi
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for acosh in -lm" >&5
+$as_echo_n "checking for acosh in -lm... " >&6; }
+if ${ac_cv_lib_m_acosh+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lm $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char acosh ();
+int
+main ()
+{
+return acosh ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_m_acosh=yes
+else
+ ac_cv_lib_m_acosh=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_acosh" >&5
+$as_echo "$ac_cv_lib_m_acosh" >&6; }
+if test "x$ac_cv_lib_m_acosh" = xyes; then :
+
+$as_echo "#define HAVE_ACOSH 1" >>confdefs.h
+
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for asinh in -lm" >&5
+$as_echo_n "checking for asinh in -lm... " >&6; }
+if ${ac_cv_lib_m_asinh+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lm $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char asinh ();
+int
+main ()
+{
+return asinh ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_m_asinh=yes
+else
+ ac_cv_lib_m_asinh=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_asinh" >&5
+$as_echo "$ac_cv_lib_m_asinh" >&6; }
+if test "x$ac_cv_lib_m_asinh" = xyes; then :
+
+$as_echo "#define HAVE_ASINH 1" >>confdefs.h
+
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for atanh in -lm" >&5
+$as_echo_n "checking for atanh in -lm... " >&6; }
+if ${ac_cv_lib_m_atanh+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lm $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char atanh ();
+int
+main ()
+{
+return atanh ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_m_atanh=yes
+else
+ ac_cv_lib_m_atanh=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_atanh" >&5
+$as_echo "$ac_cv_lib_m_atanh" >&6; }
+if test "x$ac_cv_lib_m_atanh" = xyes; then :
+
+$as_echo "#define HAVE_ATANH 1" >>confdefs.h
+
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for hypot in -lm" >&5
+$as_echo_n "checking for hypot in -lm... " >&6; }
+if ${ac_cv_lib_m_hypot+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lm $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char hypot ();
+int
+main ()
+{
+return hypot ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_m_hypot=yes
+else
+ ac_cv_lib_m_hypot=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_hypot" >&5
+$as_echo "$ac_cv_lib_m_hypot" >&6; }
+if test "x$ac_cv_lib_m_hypot" = xyes; then :
+
+$as_echo "#define HAVE_HYPOT 1" >>confdefs.h
+
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for atan2 in -lm" >&5
+$as_echo_n "checking for atan2 in -lm... " >&6; }
+if ${ac_cv_lib_m_atan2+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lm $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char atan2 ();
+int
+main ()
+{
+return atan2 ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_m_atan2=yes
+else
+ ac_cv_lib_m_atan2=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_atan2" >&5
+$as_echo "$ac_cv_lib_m_atan2" >&6; }
+if test "x$ac_cv_lib_m_atan2" = xyes; then :
+
+$as_echo "#define HAVE_ATAN2 1" >>confdefs.h
+
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for frexp in -lm" >&5
+$as_echo_n "checking for frexp in -lm... " >&6; }
+if ${ac_cv_lib_m_frexp+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lm $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char frexp ();
+int
+main ()
+{
+return frexp ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_m_frexp=yes
+else
+ ac_cv_lib_m_frexp=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_frexp" >&5
+$as_echo "$ac_cv_lib_m_frexp" >&6; }
+if test "x$ac_cv_lib_m_frexp" = xyes; then :
+
+$as_echo "#define HAVE_FREXP 1" >>confdefs.h
+
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for frexpf in -lm" >&5
+$as_echo_n "checking for frexpf in -lm... " >&6; }
+if ${ac_cv_lib_m_frexpf+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lm $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char frexpf ();
+int
+main ()
+{
+return frexpf ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_m_frexpf=yes
+else
+ ac_cv_lib_m_frexpf=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_frexpf" >&5
+$as_echo "$ac_cv_lib_m_frexpf" >&6; }
+if test "x$ac_cv_lib_m_frexpf" = xyes; then :
+
+$as_echo "#define HAVE_FREXPF 1" >>confdefs.h
+
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for ldexp in -lm" >&5
+$as_echo_n "checking for ldexp in -lm... " >&6; }
+if ${ac_cv_lib_m_ldexp+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lm $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char ldexp ();
+int
+main ()
+{
+return ldexp ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_m_ldexp=yes
+else
+ ac_cv_lib_m_ldexp=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_ldexp" >&5
+$as_echo "$ac_cv_lib_m_ldexp" >&6; }
+if test "x$ac_cv_lib_m_ldexp" = xyes; then :
+
+$as_echo "#define HAVE_LDEXP 1" >>confdefs.h
+
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for ldexpf in -lm" >&5
+$as_echo_n "checking for ldexpf in -lm... " >&6; }
+if ${ac_cv_lib_m_ldexpf+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lm $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char ldexpf ();
+int
+main ()
+{
+return ldexpf ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_m_ldexpf=yes
+else
+ ac_cv_lib_m_ldexpf=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_ldexpf" >&5
+$as_echo "$ac_cv_lib_m_ldexpf" >&6; }
+if test "x$ac_cv_lib_m_ldexpf" = xyes; then :
+
+$as_echo "#define HAVE_LDEXPF 1" >>confdefs.h
+
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for sincos in -lm" >&5
+$as_echo_n "checking for sincos in -lm... " >&6; }
+if ${ac_cv_lib_m_sincos+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lm $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char sincos ();
+int
+main ()
+{
+return sincos ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_m_sincos=yes
+else
+ ac_cv_lib_m_sincos=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_sincos" >&5
+$as_echo "$ac_cv_lib_m_sincos" >&6; }
+if test "x$ac_cv_lib_m_sincos" = xyes; then :
+
+$as_echo "#define HAVE_SINCOS 1" >>confdefs.h
+
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for sincosf in -lm" >&5
+$as_echo_n "checking for sincosf in -lm... " >&6; }
+if ${ac_cv_lib_m_sincosf+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lm $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char sincosf ();
+int
+main ()
+{
+return sincosf ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_m_sincosf=yes
+else
+ ac_cv_lib_m_sincosf=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_sincosf" >&5
+$as_echo "$ac_cv_lib_m_sincosf" >&6; }
+if test "x$ac_cv_lib_m_sincosf" = xyes; then :
+
+$as_echo "#define HAVE_SINCOSF 1" >>confdefs.h
+
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for feclearexcept in -lm" >&5
+$as_echo_n "checking for feclearexcept in -lm... " >&6; }
+if ${ac_cv_lib_m_feclearexcept+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lm $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char feclearexcept ();
+int
+main ()
+{
+return feclearexcept ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_m_feclearexcept=yes
+else
+ ac_cv_lib_m_feclearexcept=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_feclearexcept" >&5
+$as_echo "$ac_cv_lib_m_feclearexcept" >&6; }
+if test "x$ac_cv_lib_m_feclearexcept" = xyes; then :
+
+$as_echo "#define HAVE_FECLEAREXCEPT 1" >>confdefs.h
+
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for fpsetsticky in -lm" >&5
+$as_echo_n "checking for fpsetsticky in -lm... " >&6; }
+if ${ac_cv_lib_m_fpsetsticky+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-lm $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char fpsetsticky ();
+int
+main ()
+{
+return fpsetsticky ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_m_fpsetsticky=yes
+else
+ ac_cv_lib_m_fpsetsticky=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_fpsetsticky" >&5
+$as_echo "$ac_cv_lib_m_fpsetsticky" >&6; }
+if test "x$ac_cv_lib_m_fpsetsticky" = xyes; then :
+
+$as_echo "#define HAVE_FPSETSTICKY 1" >>confdefs.h
+
+fi
+
+
+
+DYNAMIC_LINK_LIB=""
+
+
+ac_fn_c_check_header_mongrel "$LINENO" "dlfcn.h" "ac_cv_header_dlfcn_h" "$ac_includes_default"
+if test "x$ac_cv_header_dlfcn_h" = xyes; then :
+
+
+$as_echo "#define HAVE_DLFCN_H 1" >>confdefs.h
+
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5
+$as_echo_n "checking for dlopen in -ldl... " >&6; }
+if ${ac_cv_lib_dl_dlopen+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_check_lib_save_LIBS=$LIBS
+LIBS="-ldl $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+/* Override any GCC internal prototype to avoid an error.
+ Use char because int might match the return type of a GCC
+ builtin and then its argument prototype would still apply. */
+#ifdef __cplusplus
+extern "C"
+#endif
+char dlopen ();
+int
+main ()
+{
+return dlopen ();
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_lib_dl_dlopen=yes
+else
+ ac_cv_lib_dl_dlopen=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5
+$as_echo "$ac_cv_lib_dl_dlopen" >&6; }
+if test "x$ac_cv_lib_dl_dlopen" = xyes; then :
+
+ DYNAMIC_LINK_LIB="-ldl"
+
+$as_echo "#define HAVE_DLOPEN 1" >>confdefs.h
+
+
+else
+
+ ac_fn_c_check_func "$LINENO" "dlopen" "ac_cv_func_dlopen"
+if test "x$ac_cv_func_dlopen" = xyes; then :
+ $as_echo "#define HAVE_DLOPEN Define if you have dlopen" >>confdefs.h
+
+fi
+
+ if test "$ac_cv_func_dlopen" != yes
+ then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cannot perform dynamic linking" >&5
+$as_echo "$as_me: WARNING: cannot perform dynamic linking" >&2;}
+ fi
+
+fi
+
+fi
+
+
+
+
+if test "$GCC" = yes
+then
+ if test X"$CFLAGS" = X
+ then
+ CFLAGS="-O2"
+ fi
+fi
+
+ELFLIB="lib\$(THIS_LIB).so"
+ELFLIB_MAJOR="\$(ELFLIB).\$(ELF_MAJOR_VERSION)"
+ELFLIB_MAJOR_MINOR="\$(ELFLIB_MAJOR).\$(ELF_MINOR_VERSION)"
+ELFLIB_MAJOR_MINOR_MICRO="\$(ELFLIB_MAJOR_MINOR).\$(ELF_MICRO_VERSION)"
+
+INSTALL_ELFLIB_TARGET="install-elf-and-links"
+ELFLIB_BUILD_NAME="\$(ELFLIB_MAJOR_MINOR_MICRO)"
+INSTALL_MODULE="\$(INSTALL_DATA)"
+SLANG_DLL_CFLAGS=""
+M_LIB="-lm"
+
+case "$host_os" in
+ *linux*|*gnu*|k*bsd*-gnu )
+ DYNAMIC_LINK_FLAGS="-Wl,-export-dynamic"
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fPIC"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-O1 -Wl,--version-script,\$(VERSION_SCRIPT) -Wl,-soname,\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS="\$(DL_LIB) -lm -lc"
+ CC_SHARED_FLAGS="-shared -fPIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ ;;
+ *solaris* )
+ if test "$GCC" = yes
+ then
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fPIC"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-ztext -Wl,-h,\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS="\$(DL_LIB) -lm -lc"
+ CC_SHARED_FLAGS="-G -fPIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ else
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -K PIC"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -G -h\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS="\$(DL_LIB) -lm -lc"
+ CC_SHARED_FLAGS="-G -K PIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ fi
+ ;;
+ # osr5 or unixware7 with current or late autoconf
+ *sco3.2v5* | *unixware-5* | *sco-sysv5uw7*)
+ if test "$GCC" = yes
+ then
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fPIC"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-h,\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS=
+ CC_SHARED_FLAGS="-G -fPIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ else
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -K pic"
+ # ELF_LINK="ld -G -z text -h#"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -G -z text -h\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS=
+ CC_SHARED_FLAGS="-G -K pic"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ fi
+ ;;
+ *irix6.5* )
+ echo "Note: ELF compiler for host_os=$host_os may not be correct"
+ echo "double-check: 'mode_t', 'pid_t' may be wrong!"
+ if test "$GCC" = yes
+ then
+ # not tested
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fPIC"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-h,\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS=
+ CC_SHARED_FLAGS="-shared -fPIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ else
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS)" # default anyhow
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -o \$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS=
+ CC_SHARED_FLAGS="-shared"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ fi
+ ;;
+ *darwin* )
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fno-common"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -dynamiclib -install_name \$(install_lib_dir)/\$(ELFLIB_MAJOR) -compatibility_version \$(ELF_MAJOR_VERSION) -current_version \$(ELF_MAJOR_VERSION).\$(ELF_MINOR_VERSION)"
+ ELF_DEP_LIBS="\$(LDFLAGS) \$(DL_LIB)"
+ CC_SHARED_FLAGS="-bundle -flat_namespace -undefined suppress -fno-common"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ ELFLIB="lib\$(THIS_LIB).dylib"
+ ELFLIB_MAJOR="lib\$(THIS_LIB).\$(ELF_MAJOR_VERSION).dylib"
+ ELFLIB_MAJOR_MINOR="lib\$(THIS_LIB).\$(ELF_MAJOR_VERSION).\$(ELF_MINOR_VERSION).dylib"
+ ELFLIB_MAJOR_MINOR_MICRO="lib\$(THIS_LIB).\$(ELF_MAJOR_VERSION).\$(ELF_MINOR_VERSION).\$(ELF_MICRO_VERSION).dylib"
+ ;;
+ *freebsd* )
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fPIC"
+ #if test "X$PORTOBJFORMAT" = "Xelf" ; then
+ # ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-soname,\$(ELFLIB_MAJOR)"
+ #else
+ # ELF_LINK="ld -Bshareable -x"
+ #fi
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-soname,\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS="\$(DL_LIB) -lm"
+ CC_SHARED_FLAGS="-shared -fPIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ ;;
+ *cygwin* )
+ DYNAMIC_LINK_FLAGS=""
+ ELF_CC="\$(CC)"
+ SLANG_DLL_CFLAGS="-DSLANG_DLL=1"
+ ELF_CFLAGS="\$(CFLAGS) -DBUILD_DLL=1"
+ DLL_IMPLIB_NAME="lib\$(THIS_LIB)\$(ELFLIB_MAJOR_VERSION).dll.a"
+ #ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-O1 -Wl,--version-script,\$(VERSION_SCRIPT) -Wl,-soname,\$(ELFLIB_MAJOR) -Wl,--out-implib=\$(DLL_IMPLIB_NAME) -Wl,-export-all-symbols -Wl,-enable-auto-import"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-O1 -Wl,--version-script,\$(VERSION_SCRIPT) -Wl,-soname,\$(ELFLIB_MAJOR) -Wl,--out-implib=\$(DLL_IMPLIB_NAME)"
+ ELF_DEP_LIBS="\$(DL_LIB) -lm"
+ CC_SHARED_FLAGS="-shared -DSLANG_DLL=1"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ SLANG_LIB_FOR_MODULES="-L\$(ELFDIR) -lslang"
+ INSTALL_MODULE="\$(INSTALL)"
+ INSTALL_ELFLIB_TARGET="install-elf-cygwin"
+ ELFLIB="lib\$(THIS_LIB).dll"
+ ELFLIB_MAJOR="cyg\$(THIS_LIB)-\$(ELF_MAJOR_VERSION).dll"
+ ELFLIB_MAJOR_MINOR="cyg\$(THIS_LIB)-\$(ELF_MAJOR_VERSION)_\$(ELF_MINOR_VERSION).dll"
+ ELFLIB_MAJOR_MINOR_MICRO="cyg\$(THIS_LIB)-\$(ELF_MAJOR_VERSION)_\$(ELF_MINOR_VERSION)_\$(ELF_MICRO_VERSION).dll"
+ ELFLIB_BUILD_NAME="\$(ELFLIB_MAJOR)"
+ ;;
+ *haiku* )
+ M_LIB=""
+ DYNAMIC_LINK_FLAGS="-Wl,-export-dynamic"
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fPIC"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared -Wl,-O1 -Wl,--version-script,\$(VERSION_SCRIPT) -Wl,-soname,\$(ELFLIB_MAJOR)"
+ ELF_DEP_LIBS="\$(DL_LIB)"
+ CC_SHARED_FLAGS="-shared -fPIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+ ;;
+ * )
+ echo "Note: ELF compiler for host_os=$host_os may be wrong"
+ ELF_CC="\$(CC)"
+ ELF_CFLAGS="\$(CFLAGS) -fPIC"
+ ELF_LINK="\$(CC) \$(LDFLAGS) -shared"
+ ELF_DEP_LIBS="\$(DL_LIB) -lm -lc"
+ CC_SHARED_FLAGS="-shared -fPIC"
+ CC_SHARED="\$(CC) $CC_SHARED_FLAGS \$(CFLAGS)"
+esac
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+case "$host_cpu" in
+ *alpha* )
+ if test "$GCC" = yes
+ then
+ IEEE_CFLAGS="-mieee"
+ else
+ IEEE_CFLAGS="-ieee_with_no_inexact"
+ fi
+ ;;
+ * )
+ IEEE_CFLAGS=""
+esac
+
+
+ELF_CFLAGS="$ELF_CFLAGS $IEEE_CFLAGS"
+CFLAGS="$CFLAGS $IEEE_CFLAGS"
+
+
+if test "X$libdir" != "X"
+then
+ if test "X$RPATH" = "X"
+ then
+
+case "$host_os" in
+ *linux*|*solaris* )
+ if test "X$GCC" = Xyes
+ then
+ if test "X$ac_R_nospace" = "Xno"
+ then
+ RPATH="-Wl,-R,"
+ else
+ RPATH="-Wl,-R"
+ fi
+ else
+ if test "X$ac_R_nospace" = "Xno"
+ then
+ RPATH="-R "
+ else
+	RPATH="-R"
+ fi
+ fi
+ ;;
+ *osf*|*openbsd*|*freebsd*)
+ if test "X$GCC" = Xyes
+ then
+ RPATH="-Wl,-rpath,"
+ else
+ RPATH="-rpath "
+ fi
+ ;;
+ *netbsd*)
+ if test "X$GCC" = Xyes
+ then
+ RPATH="-Wl,-R"
+ fi
+ ;;
+esac
+
+ if test "X$RPATH" != "X"
+ then
+ RPATH="$RPATH$libdir"
+ fi
+ else
+ _already_there=0
+ for X in `echo $RPATH | sed 's/:/ /g'`
+ do
+ if test "$X" = "$libdir"
+ then
+ _already_there=1
+	break
+ fi
+ done
+ if test $_already_there = 0
+ then
+ RPATH="$RPATH:$libdir"
+ fi
+ fi
+fi
+
+
+# The cast to long int works around a bug in the HP C Compiler
+# version HP92453-01 B.11.11.23709.GP, which incorrectly rejects
+# declarations like `int a3(sizeof (unsigned char)) >= 0;'.
+# This bug is HP SR number 8606223364.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking size of short" >&5
+$as_echo_n "checking size of short... " >&6; }
+if ${ac_cv_sizeof_short+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (short))" "ac_cv_sizeof_short" "$ac_includes_default"; then :
+
+else
+ if test "$ac_cv_type_short" = yes; then
+ { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error 77 "cannot compute sizeof (short)
+See \`config.log' for more details" "$LINENO" 5; }
+ else
+ ac_cv_sizeof_short=0
+ fi
+fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_short" >&5
+$as_echo "$ac_cv_sizeof_short" >&6; }
+
+
+
+cat >>confdefs.h <<_ACEOF
+#define SIZEOF_SHORT $ac_cv_sizeof_short
+_ACEOF
+
+
+# The cast to long int works around a bug in the HP C Compiler
+# version HP92453-01 B.11.11.23709.GP, which incorrectly rejects
+# declarations like `int a3(sizeof (unsigned char)) >= 0;'.
+# This bug is HP SR number 8606223364.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking size of int" >&5
+$as_echo_n "checking size of int... " >&6; }
+if ${ac_cv_sizeof_int+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (int))" "ac_cv_sizeof_int" "$ac_includes_default"; then :
+
+else
+ if test "$ac_cv_type_int" = yes; then
+ { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error 77 "cannot compute sizeof (int)
+See \`config.log' for more details" "$LINENO" 5; }
+ else
+ ac_cv_sizeof_int=0
+ fi
+fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_int" >&5
+$as_echo "$ac_cv_sizeof_int" >&6; }
+
+
+
+cat >>confdefs.h <<_ACEOF
+#define SIZEOF_INT $ac_cv_sizeof_int
+_ACEOF
+
+
+# The cast to long int works around a bug in the HP C Compiler
+# version HP92453-01 B.11.11.23709.GP, which incorrectly rejects
+# declarations like `int a3(sizeof (unsigned char)) >= 0;'.
+# This bug is HP SR number 8606223364.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking size of long" >&5
+$as_echo_n "checking size of long... " >&6; }
+if ${ac_cv_sizeof_long+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (long))" "ac_cv_sizeof_long" "$ac_includes_default"; then :
+
+else
+ if test "$ac_cv_type_long" = yes; then
+ { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error 77 "cannot compute sizeof (long)
+See \`config.log' for more details" "$LINENO" 5; }
+ else
+ ac_cv_sizeof_long=0
+ fi
+fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_long" >&5
+$as_echo "$ac_cv_sizeof_long" >&6; }
+
+
+
+cat >>confdefs.h <<_ACEOF
+#define SIZEOF_LONG $ac_cv_sizeof_long
+_ACEOF
+
+
+# The cast to long int works around a bug in the HP C Compiler
+# version HP92453-01 B.11.11.23709.GP, which incorrectly rejects
+# declarations like `int a3(sizeof (unsigned char)) >= 0;'.
+# This bug is HP SR number 8606223364.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking size of float" >&5
+$as_echo_n "checking size of float... " >&6; }
+if ${ac_cv_sizeof_float+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (float))" "ac_cv_sizeof_float" "$ac_includes_default"; then :
+
+else
+ if test "$ac_cv_type_float" = yes; then
+ { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error 77 "cannot compute sizeof (float)
+See \`config.log' for more details" "$LINENO" 5; }
+ else
+ ac_cv_sizeof_float=0
+ fi
+fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_float" >&5
+$as_echo "$ac_cv_sizeof_float" >&6; }
+
+
+
+cat >>confdefs.h <<_ACEOF
+#define SIZEOF_FLOAT $ac_cv_sizeof_float
+_ACEOF
+
+
+# The cast to long int works around a bug in the HP C Compiler
+# version HP92453-01 B.11.11.23709.GP, which incorrectly rejects
+# declarations like `int a3(sizeof (unsigned char)) >= 0;'.
+# This bug is HP SR number 8606223364.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking size of double" >&5
+$as_echo_n "checking size of double... " >&6; }
+if ${ac_cv_sizeof_double+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (double))" "ac_cv_sizeof_double" "$ac_includes_default"; then :
+
+else
+ if test "$ac_cv_type_double" = yes; then
+ { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error 77 "cannot compute sizeof (double)
+See \`config.log' for more details" "$LINENO" 5; }
+ else
+ ac_cv_sizeof_double=0
+ fi
+fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_double" >&5
+$as_echo "$ac_cv_sizeof_double" >&6; }
+
+
+
+cat >>confdefs.h <<_ACEOF
+#define SIZEOF_DOUBLE $ac_cv_sizeof_double
+_ACEOF
+
+
+
+ac_fn_c_check_type "$LINENO" "ptrdiff_t" "ac_cv_type_ptrdiff_t" "$ac_includes_default"
+if test "x$ac_cv_type_ptrdiff_t" = xyes; then :
+
+else
+
+cat >>confdefs.h <<_ACEOF
+#define ptrdiff_t long
+_ACEOF
+
+fi
+
+
+ac_fn_c_check_type "$LINENO" "size_t" "ac_cv_type_size_t" "$ac_includes_default"
+if test "x$ac_cv_type_size_t" = xyes; then :
+
+else
+
+cat >>confdefs.h <<_ACEOF
+#define size_t unsigned int
+_ACEOF
+
+fi
+
+# The cast to long int works around a bug in the HP C Compiler
+# version HP92453-01 B.11.11.23709.GP, which incorrectly rejects
+# declarations like `int a3(sizeof (unsigned char)) >= 0;'.
+# This bug is HP SR number 8606223364.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking size of size_t" >&5
+$as_echo_n "checking size of size_t... " >&6; }
+if ${ac_cv_sizeof_size_t+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (size_t))" "ac_cv_sizeof_size_t" "$ac_includes_default"; then :
+
+else
+ if test "$ac_cv_type_size_t" = yes; then
+ { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error 77 "cannot compute sizeof (size_t)
+See \`config.log' for more details" "$LINENO" 5; }
+ else
+ ac_cv_sizeof_size_t=0
+ fi
+fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_size_t" >&5
+$as_echo "$ac_cv_sizeof_size_t" >&6; }
+
+
+
+cat >>confdefs.h <<_ACEOF
+#define SIZEOF_SIZE_T $ac_cv_sizeof_size_t
+_ACEOF
+
+
+
+
+ ac_fn_c_check_type "$LINENO" "long long" "ac_cv_type_long_long" "$ac_includes_default"
+if test "x$ac_cv_type_long_long" = xyes; then :
+
+cat >>confdefs.h <<_ACEOF
+#define HAVE_LONG_LONG 1
+_ACEOF
+
+
+fi
+
+ # The cast to long int works around a bug in the HP C Compiler
+# version HP92453-01 B.11.11.23709.GP, which incorrectly rejects
+# declarations like `int a3(sizeof (unsigned char)) >= 0;'.
+# This bug is HP SR number 8606223364.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking size of long long" >&5
+$as_echo_n "checking size of long long... " >&6; }
+if ${ac_cv_sizeof_long_long+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (long long))" "ac_cv_sizeof_long_long" "$ac_includes_default"; then :
+
+else
+ if test "$ac_cv_type_long_long" = yes; then
+ { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error 77 "cannot compute sizeof (long long)
+See \`config.log' for more details" "$LINENO" 5; }
+ else
+ ac_cv_sizeof_long_long=0
+ fi
+fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_long_long" >&5
+$as_echo "$ac_cv_sizeof_long_long" >&6; }
+
+
+
+cat >>confdefs.h <<_ACEOF
+#define SIZEOF_LONG_LONG $ac_cv_sizeof_long_long
+_ACEOF
+
+
+
+
+ # Check whether --enable-largefile was given.
+if test "${enable_largefile+set}" = set; then :
+ enableval=$enable_largefile;
+fi
+
+if test "$enable_largefile" != no; then
+
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for special C compiler options needed for large files" >&5
+$as_echo_n "checking for special C compiler options needed for large files... " >&6; }
+if ${ac_cv_sys_largefile_CC+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ ac_cv_sys_largefile_CC=no
+ if test "$GCC" != yes; then
+ ac_save_CC=$CC
+ while :; do
+	 # IRIX 6.2 and later do not support large files by default,
+	 # so use the C compiler's -n32 option if that helps.
+	 cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <sys/types.h>
+ /* Check that off_t can represent 2**63 - 1 correctly.
+ We can't simply define LARGE_OFF_T to be 9223372036854775807,
+ since some C++ compilers masquerading as C compilers
+ incorrectly reject 9223372036854775807. */
+#define LARGE_OFF_T ((((off_t) 1 << 31) << 31) - 1 + (((off_t) 1 << 31) << 31))
+ int off_t_is_large(LARGE_OFF_T % 2147483629 == 721
+		 && LARGE_OFF_T % 2147483647 == 1)
+		 ? 1 : -1;
+int
+main ()
+{
+
+ ;
+ return 0;
+}
+_ACEOF
+	 if ac_fn_c_try_compile "$LINENO"; then :
+ break
+fi
+rm -f core conftest.err conftest.$ac_objext
+	 CC="$CC -n32"
+	 if ac_fn_c_try_compile "$LINENO"; then :
+ ac_cv_sys_largefile_CC=' -n32'; break
+fi
+rm -f core conftest.err conftest.$ac_objext
+	 break
+ done
+ CC=$ac_save_CC
+ rm -f conftest.$ac_ext
+ fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sys_largefile_CC" >&5
+$as_echo "$ac_cv_sys_largefile_CC" >&6; }
+ if test "$ac_cv_sys_largefile_CC" != no; then
+ CC=$CC$ac_cv_sys_largefile_CC
+ fi
+
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for _FILE_OFFSET_BITS value needed for large files" >&5
+$as_echo_n "checking for _FILE_OFFSET_BITS value needed for large files... " >&6; }
+if ${ac_cv_sys_file_offset_bits+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ while :; do
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <sys/types.h>
+ /* Check that off_t can represent 2**63 - 1 correctly.
+ We can't simply define LARGE_OFF_T to be 9223372036854775807,
+ since some C++ compilers masquerading as C compilers
+ incorrectly reject 9223372036854775807. */
+#define LARGE_OFF_T ((((off_t) 1 << 31) << 31) - 1 + (((off_t) 1 << 31) << 31))
+ int off_t_is_large(LARGE_OFF_T % 2147483629 == 721
+		 && LARGE_OFF_T % 2147483647 == 1)
+		 ? 1 : -1;
+int
+main ()
+{
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ ac_cv_sys_file_offset_bits=no; break
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#define _FILE_OFFSET_BITS 64
+#include <sys/types.h>
+ /* Check that off_t can represent 2**63 - 1 correctly.
+ We can't simply define LARGE_OFF_T to be 9223372036854775807,
+ since some C++ compilers masquerading as C compilers
+ incorrectly reject 9223372036854775807. */
+#define LARGE_OFF_T ((((off_t) 1 << 31) << 31) - 1 + (((off_t) 1 << 31) << 31))
+ int off_t_is_large(LARGE_OFF_T % 2147483629 == 721
+		 && LARGE_OFF_T % 2147483647 == 1)
+		 ? 1 : -1;
+int
+main ()
+{
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ ac_cv_sys_file_offset_bits=64; break
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+ ac_cv_sys_file_offset_bits=unknown
+ break
+done
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sys_file_offset_bits" >&5
+$as_echo "$ac_cv_sys_file_offset_bits" >&6; }
+case $ac_cv_sys_file_offset_bits in #(
+ no | unknown) ;;
+ *)
+cat >>confdefs.h <<_ACEOF
+#define _FILE_OFFSET_BITS $ac_cv_sys_file_offset_bits
+_ACEOF
+;;
+esac
+rm -rf conftest*
+ if test $ac_cv_sys_file_offset_bits = unknown; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for _LARGE_FILES value needed for large files" >&5
+$as_echo_n "checking for _LARGE_FILES value needed for large files... " >&6; }
+if ${ac_cv_sys_large_files+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ while :; do
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <sys/types.h>
+ /* Check that off_t can represent 2**63 - 1 correctly.
+ We can't simply define LARGE_OFF_T to be 9223372036854775807,
+ since some C++ compilers masquerading as C compilers
+ incorrectly reject 9223372036854775807. */
+#define LARGE_OFF_T ((((off_t) 1 << 31) << 31) - 1 + (((off_t) 1 << 31) << 31))
+ int off_t_is_large(LARGE_OFF_T % 2147483629 == 721
+		 && LARGE_OFF_T % 2147483647 == 1)
+		 ? 1 : -1;
+int
+main ()
+{
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ ac_cv_sys_large_files=no; break
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#define _LARGE_FILES 1
+#include <sys/types.h>
+ /* Check that off_t can represent 2**63 - 1 correctly.
+ We can't simply define LARGE_OFF_T to be 9223372036854775807,
+ since some C++ compilers masquerading as C compilers
+ incorrectly reject 9223372036854775807. */
+#define LARGE_OFF_T ((((off_t) 1 << 31) << 31) - 1 + (((off_t) 1 << 31) << 31))
+ int off_t_is_large(LARGE_OFF_T % 2147483629 == 721
+		 && LARGE_OFF_T % 2147483647 == 1)
+		 ? 1 : -1;
+int
+main ()
+{
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ ac_cv_sys_large_files=1; break
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+ ac_cv_sys_large_files=unknown
+ break
+done
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sys_large_files" >&5
+$as_echo "$ac_cv_sys_large_files" >&6; }
+case $ac_cv_sys_large_files in #(
+ no | unknown) ;;
+ *)
+cat >>confdefs.h <<_ACEOF
+#define _LARGE_FILES $ac_cv_sys_large_files
+_ACEOF
+;;
+esac
+rm -rf conftest*
+ fi
+
+
+fi
+
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for _LARGEFILE_SOURCE value needed for large files" >&5
+$as_echo_n "checking for _LARGEFILE_SOURCE value needed for large files... " >&6; }
+if ${ac_cv_sys_largefile_source+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ while :; do
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <sys/types.h> /* for off_t */
+ #include <stdio.h>
+int
+main ()
+{
+int (*fp) (FILE *, off_t, int) = fseeko;
+ return fseeko (stdin, 0, 0) && fp (stdin, 0, 0);
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_sys_largefile_source=no; break
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#define _LARGEFILE_SOURCE 1
+#include <sys/types.h> /* for off_t */
+ #include <stdio.h>
+int
+main ()
+{
+int (*fp) (FILE *, off_t, int) = fseeko;
+ return fseeko (stdin, 0, 0) && fp (stdin, 0, 0);
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ ac_cv_sys_largefile_source=1; break
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+ ac_cv_sys_largefile_source=unknown
+ break
+done
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sys_largefile_source" >&5
+$as_echo "$ac_cv_sys_largefile_source" >&6; }
+case $ac_cv_sys_largefile_source in #(
+ no | unknown) ;;
+ *)
+cat >>confdefs.h <<_ACEOF
+#define _LARGEFILE_SOURCE $ac_cv_sys_largefile_source
+_ACEOF
+;;
+esac
+rm -rf conftest*
+
+# We used to try defining _XOPEN_SOURCE=500 too, to work around a bug
+# in glibc 2.1.3, but that breaks too many other things.
+# If you want fseeko and ftello with glibc, upgrade to a fixed glibc.
+if test $ac_cv_sys_largefile_source != unknown; then
+
+$as_echo "#define HAVE_FSEEKO 1" >>confdefs.h
+
+fi
+
+ ac_fn_c_check_type "$LINENO" "off_t" "ac_cv_type_off_t" "$ac_includes_default"
+if test "x$ac_cv_type_off_t" = xyes; then :
+
+else
+
+cat >>confdefs.h <<_ACEOF
+#define off_t long int
+_ACEOF
+
+fi
+
+ # The cast to long int works around a bug in the HP C Compiler
+# version HP92453-01 B.11.11.23709.GP, which incorrectly rejects
+# declarations like `int a3(sizeof (unsigned char)) >= 0;'.
+# This bug is HP SR number 8606223364.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking size of off_t" >&5
+$as_echo_n "checking size of off_t... " >&6; }
+if ${ac_cv_sizeof_off_t+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (off_t))" "ac_cv_sizeof_off_t" "$ac_includes_default"; then :
+
+else
+ if test "$ac_cv_type_off_t" = yes; then
+ { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error 77 "cannot compute sizeof (off_t)
+See \`config.log' for more details" "$LINENO" 5; }
+ else
+ ac_cv_sizeof_off_t=0
+ fi
+fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_off_t" >&5
+$as_echo "$ac_cv_sizeof_off_t" >&6; }
+
+
+
+cat >>confdefs.h <<_ACEOF
+#define SIZEOF_OFF_T $ac_cv_sizeof_off_t
+_ACEOF
+
+
+
+
+
+# Extract the first word of "ncurses5-config", so it can be a program name with args.
+set dummy ncurses5-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_nc5config+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ case $nc5config in
+ \\/* | ?:\\/*)
+ ac_cv_path_nc5config="$nc5config" # Let the user override the test with a path.
+ ;;
+ *)
+ as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ for ac_exec_ext in '' $ac_executable_extensions; do
+ if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+ ac_cv_path_nc5config="$as_dir/$ac_word$ac_exec_ext"
+ $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+ break 2
+ fi
+done
+ done
+IFS=$as_save_IFS
+
+ test -z "$ac_cv_path_nc5config" && ac_cv_path_nc5config="no"
+ ;;
+esac
+fi
+nc5config=$ac_cv_path_nc5config
+if test -n "$nc5config"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: $nc5config" >&5
+$as_echo "$nc5config" >&6; }
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test "$nc5config" = "no"
+then
+ # Extract the first word of "ncursesw5-config", so it can be a program name with args.
+set dummy ncursesw5-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_nc5config+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+ case $nc5config in
+ \\/* | ?:\\/*)
+ ac_cv_path_nc5config="$nc5config" # Let the user override the test with a path.
+ ;;
+ *)
+ as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ for ac_exec_ext in '' $ac_executable_extensions; do
+ if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+ ac_cv_path_nc5config="$as_dir/$ac_word$ac_exec_ext"
+ $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+ break 2
+ fi
+done
+ done
+IFS=$as_save_IFS
+
+ test -z "$ac_cv_path_nc5config" && ac_cv_path_nc5config="no"
+ ;;
+esac
+fi
+nc5config=$ac_cv_path_nc5config
+if test -n "$nc5config"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: $nc5config" >&5
+$as_echo "$nc5config" >&6; }
+else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for terminfo" >&5
+$as_echo_n "checking for terminfo... " >&6; }
+if test "$nc5config" != "no"
+then
+ MISC_TERMINFO_DIRS=`$nc5config --terminfo`
+else
+ MISC_TERMINFO_DIRS=""
+fi
+JD_Terminfo_Dirs="$MISC_TERMINFO_DIRS \
+ /usr/lib/terminfo \
+ /usr/share/terminfo \
+ /usr/share/lib/terminfo \
+		 /usr/local/lib/terminfo"
+TERMCAP=-ltermcap
+
+for terminfo_dir in $JD_Terminfo_Dirs
+do
+ if test -d $terminfo_dir
+ then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+ TERMCAP=""
+ break
+ fi
+done
+if test "$TERMCAP"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+
+$as_echo "#define USE_TERMCAP 1" >>confdefs.h
+
+fi
+
+
+# Check whether --enable-warnings was given.
+if test "${enable_warnings+set}" = set; then :
+ enableval=$enable_warnings; gcc_warnings=$enableval
+fi
+
+if test -n "$GCC"
+then
+ #CFLAGS="$CFLAGS -fno-strength-reduce"
+ if test -n "$gcc_warnings"
+ then
+ CFLAGS="$CFLAGS -Wall -W -pedantic -Winline -Wmissing-prototypes \
+ -Wnested-externs -Wpointer-arith -Wcast-align -Wshadow -Wstrict-prototypes \
+ -Wformat=2"
+ # Now trim excess whitespace
+ CFLAGS=`echo $CFLAGS`
+ fi
+fi
+
+
+
+#---------------------------------------------------------------------------
+# Set the source directory and object directory. The makefile assumes an
+# absolute path name. This is because src/Makefile cds to OBJDIR and compiles
+# the src file which is in SRCDIR
+#---------------------------------------------------------------------------
+SRCDIR=$CONFIG_DIR
+if test "src" != "."
+then
+ if test -z "src"
+ then
+ SRCDIR=$SRCDIR/src
+ else
+ SRCDIR=$SRCDIR/src
+ fi
+fi
+
+OBJDIR=$SRCDIR/"\$(ARCH)"objs
+ELFDIR=$SRCDIR/"\$(ARCH)"elfobjs
+
+
+missingmodules=""
+extramodules=""
+
+ if test "X$jd_prefix" = "X"
+ then
+ jd_prefix=$ac_default_prefix
+ if test "X$prefix" != "XNONE"
+ then
+ jd_prefix="$prefix"
+ fi
+ jd_exec_prefix="$jd_prefix"
+ if test "X$exec_prefix" != "XNONE"
+ then
+ jd_exec_prefix="$exec_prefix"
+ fi
+
+ eval `sh <<EOF
+ prefix=$jd_prefix
+ exec_prefix=$jd_exec_prefix
+ libdir=$libdir
+ includedir=$includedir
+ echo jd_prefix_libdir="\$libdir" jd_prefix_incdir="\$includedir"
+EOF
+`
+ fi
+
+
+ if test -x $ac_aux_dir/scripts/getsyslibs.sh
+ then
+ JD_SYS_INCLIBS=`$ac_aux_dir/scripts/getsyslibs.sh`
+ else
+ JD_SYS_INCLIBS=""
+ fi
+
+
+
+
+
+ jd_pcre_include_dir=""
+ jd_pcre_library_dir=""
+ if test X"$jd_with_pcre_library" = X
+ then
+ jd_with_pcre_library=""
+ fi
+
+
+# Check whether --with-pcre was given.
+if test "${with_pcre+set}" = set; then :
+ withval=$with_pcre; jd_with_pcre_arg=$withval
+else
+ jd_with_pcre_arg=unspecified
+fi
+
+
+ case "x$jd_with_pcre_arg" in
+ xno)
+ jd_with_pcre_library="no"
+ ;;
+ x)
+ jd_with_pcre_library="yes"
+ ;;
+ xunspecified)
+ ;;
+ xyes)
+ jd_with_pcre_library="yes"
+ ;;
+ *)
+ jd_with_pcre_library="yes"
+ jd_pcre_include_dir="$jd_with_pcre_arg"/include
+ jd_pcre_library_dir="$jd_with_pcre_arg"/lib
+ ;;
+ esac
+
+
+# Check whether --with-pcrelib was given.
+if test "${with_pcrelib+set}" = set; then :
+ withval=$with_pcrelib; jd_with_pcrelib_arg=$withval
+else
+ jd_with_pcrelib_arg=unspecified
+fi
+
+ case "x$jd_with_pcrelib_arg" in
+ xunspecified)
+ ;;
+ xno)
+ ;;
+ x)
+ as_fn_error $? "--with-pcrelib requres a value" "$LINENO" 5
+ ;;
+ *)
+ jd_with_pcre_library="yes"
+ jd_pcre_library_dir="$jd_with_pcrelib_arg"
+ ;;
+ esac
+
+
+# Check whether --with-pcreinc was given.
+if test "${with_pcreinc+set}" = set; then :
+ withval=$with_pcreinc; jd_with_pcreinc_arg=$withval
+else
+ jd_with_pcreinc_arg=unspecified
+fi
+
+ case "x$jd_with_pcreinc_arg" in
+ x)
+ as_fn_error $? "--with-pcreinc requres a value" "$LINENO" 5
+ ;;
+ xunspecified)
+ ;;
+ xno)
+ ;;
+ *)
+ jd_with_pcre_library="yes"
+ jd_pcre_include_dir="$jd_with_pcreinc_arg"
+ ;;
+ esac
+
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for the pcre library and header files " >&5
+$as_echo_n "checking for the pcre library and header files ... " >&6; }
+ if test X"$jd_with_pcre_library" != Xno
+ then
+ jd_pcre_inc_file=
+
+ if test "X$jd_pcre_inc_file" = "X"
+ then
+ jd_pcre_inc_file=pcre.h
+ fi
+
+ if test X"$jd_pcre_include_dir" = X
+ then
+ inc_and_lib_dirs="\
+ $jd_prefix_incdir,$jd_prefix_libdir \
+	 /usr/local/pcre/include,/usr/local/pcre/lib \
+	 /usr/local/include/pcre,/usr/local/lib \
+	 /usr/local/include,/usr/local/lib \
+	 $JD_SYS_INCLIBS \
+	 /usr/include/pcre,/usr/lib \
+	 /usr/pcre/include,/usr/pcre/lib \
+	 /usr/include,/usr/lib \
+	 /opt/include/pcre,/opt/lib \
+	 /opt/pcre/include,/opt/pcre/lib \
+	 /opt/include,/opt/lib"
+
+ if test X != X
+ then
+ inc_and_lib_dirs="/include,/lib $inc_and_lib_dirs"
+ fi
+
+ case "$host_os" in
+ *darwin* )
+	 exts="dylib so a"
+	 ;;
+	 *cygwin* )
+	 exts="dll.a so a"
+	 ;;
+	 * )
+	 exts="so a"
+ esac
+
+ xincfile="$jd_pcre_inc_file"
+ xlibfile="libpcre"
+ jd_with_pcre_library="no"
+
+ for include_and_lib in $inc_and_lib_dirs
+ do
+ # Yuk. Is there a better way to set these variables??
+ xincdir=`echo $include_and_lib | tr ',' ' ' | awk '{print $1}'`
+	xlibdir=`echo $include_and_lib | tr ',' ' ' | awk '{print $2}'`
+	found=0
+	if test -r $xincdir/$xincfile
+	then
+	 for E in $exts
+	 do
+	 if test -r "$xlibdir/$xlibfile.$E"
+	 then
+	 jd_pcre_include_dir="$xincdir"
+	 jd_pcre_library_dir="$xlibdir"
+	 jd_with_pcre_library="yes"
+	 found=1
+	 break
+	 fi
+	 done
+	fi
+	if test $found -eq 1
+	then
+	 break
+	fi
+ done
+ fi
+ fi
+
+ if test X"$jd_pcre_include_dir" != X -a X"$jd_pcre_library_dir" != X
+ then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes: $jd_pcre_library_dir and $jd_pcre_include_dir" >&5
+$as_echo "yes: $jd_pcre_library_dir and $jd_pcre_include_dir" >&6; }
+ jd_with_pcre_library="yes"
+ PCRE_LIB=-L$jd_pcre_library_dir
+ PCRE_LIB_DIR=$jd_pcre_library_dir
+ if test "X$jd_pcre_library_dir" = "X/usr/lib" -o "X$jd_pcre_include_dir" = "X/usr/include"
+ then
+ PCRE_LIB=""
+ else
+
+if test "X$jd_pcre_library_dir" != "X"
+then
+ if test "X$RPATH" = "X"
+ then
+
+case "$host_os" in
+ *linux*|*solaris* )
+ if test "X$GCC" = Xyes
+ then
+ if test "X$ac_R_nospace" = "Xno"
+ then
+ RPATH="-Wl,-R,"
+ else
+ RPATH="-Wl,-R"
+ fi
+ else
+ if test "X$ac_R_nospace" = "Xno"
+ then
+ RPATH="-R "
+ else
+	RPATH="-R"
+ fi
+ fi
+ ;;
+ *osf*|*openbsd*|*freebsd*)
+ if test "X$GCC" = Xyes
+ then
+ RPATH="-Wl,-rpath,"
+ else
+ RPATH="-rpath "
+ fi
+ ;;
+ *netbsd*)
+ if test "X$GCC" = Xyes
+ then
+ RPATH="-Wl,-R"
+ fi
+ ;;
+esac
+
+ if test "X$RPATH" != "X"
+ then
+ RPATH="$RPATH$jd_pcre_library_dir"
+ fi
+ else
+ _already_there=0
+ for X in `echo $RPATH | sed 's/:/ /g'`
+ do
+ if test "$X" = "$jd_pcre_library_dir"
+ then
+ _already_there=1
+	break
+ fi
+ done
+ if test $_already_there = 0
+ then
+ RPATH="$RPATH:$jd_pcre_library_dir"
+ fi
+ fi
+fi
+
+ fi
+
+ PCRE_INC=-I$jd_pcre_include_dir
+ PCRE_INC_DIR=$jd_pcre_include_dir
+ if test "X$jd_pcre_include_dir" = "X/usr/include"
+ then
+ PCRE_INC=""
+ fi
+ else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+ jd_with_pcre_library="no"
+ PCRE_INC=""
+ PCRE_LIB=""
+ PCRE_INC_DIR=""
+ PCRE_LIB_DIR=""
+ fi
+
+
+
+
+
+if test $jd_with_pcre_library = yes
+then
+ PCRE_MODULE="pcre-module.so"
+
+$as_echo "#define HAVE_PCRE_H 1" >>confdefs.h
+
+ extramodules="$extramodules pcre"
+else
+ PCRE_MODULE=""
+ missingmodules="$missingmodules pcre"
+fi
+
+
+
+
+
+
+ jd_onig_include_dir=""
+ jd_onig_library_dir=""
+ if test X"$jd_with_onig_library" = X
+ then
+ jd_with_onig_library=""
+ fi
+
+
+# Check whether --with-onig was given.
+if test "${with_onig+set}" = set; then :
+ withval=$with_onig; jd_with_onig_arg=$withval
+else
+ jd_with_onig_arg=unspecified
+fi
+
+
+ case "x$jd_with_onig_arg" in
+ xno)
+ jd_with_onig_library="no"
+ ;;
+ x)
+ jd_with_onig_library="yes"
+ ;;
+ xunspecified)
+ ;;
+ xyes)
+ jd_with_onig_library="yes"
+ ;;
+ *)
+ jd_with_onig_library="yes"
+ jd_onig_include_dir="$jd_with_onig_arg"/include
+ jd_onig_library_dir="$jd_with_onig_arg"/lib
+ ;;
+ esac
+
+
+# Check whether --with-oniglib was given.
+if test "${with_oniglib+set}" = set; then :
+ withval=$with_oniglib; jd_with_oniglib_arg=$withval
+else
+ jd_with_oniglib_arg=unspecified
+fi
+
+ case "x$jd_with_oniglib_arg" in
+ xunspecified)
+ ;;
+ xno)
+ ;;
+ x)
+ as_fn_error $? "--with-oniglib requres a value" "$LINENO" 5
+ ;;
+ *)
+ jd_with_onig_library="yes"
+ jd_onig_library_dir="$jd_with_oniglib_arg"
+ ;;
+ esac
+
+
+# Check whether --with-oniginc was given.
+if test "${with_oniginc+set}" = set; then :
+ withval=$with_oniginc; jd_with_oniginc_arg=$withval
+else
+ jd_with_oniginc_arg=unspecified
+fi
+
+ case "x$jd_with_oniginc_arg" in
+ x)
+ as_fn_error $? "--with-oniginc requres a value" "$LINENO" 5
+ ;;
+ xunspecified)
+ ;;
+ xno)
+ ;;
+ *)
+ jd_with_onig_library="yes"
+ jd_onig_include_dir="$jd_with_oniginc_arg"
+ ;;
+ esac
+
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for the onig library and header files oniguruma.h" >&5
+$as_echo_n "checking for the onig library and header files oniguruma.h... " >&6; }
+ if test X"$jd_with_onig_library" != Xno
+ then
+ jd_onig_inc_file=oniguruma.h
+
+ if test "X$jd_onig_inc_file" = "X"
+ then
+ jd_onig_inc_file=onig.h
+ fi
+
+ if test X"$jd_onig_include_dir" = X
+ then
+ inc_and_lib_dirs="\
+ $jd_prefix_incdir,$jd_prefix_libdir \
+	 /usr/local/onig/include,/usr/local/onig/lib \
+	 /usr/local/include/onig,/usr/local/lib \
+	 /usr/local/include,/usr/local/lib \
+	 $JD_SYS_INCLIBS \
+	 /usr/include/onig,/usr/lib \
+	 /usr/onig/include,/usr/onig/lib \
+	 /usr/include,/usr/lib \
+	 /opt/include/onig,/opt/lib \
+	 /opt/onig/include,/opt/onig/lib \
+	 /opt/include,/opt/lib"
+
+ if test X != X
+ then
+ inc_and_lib_dirs="/include,/lib $inc_and_lib_dirs"
+ fi
+
+ case "$host_os" in
+ *darwin* )
+	 exts="dylib so a"
+	 ;;
+	 *cygwin* )
+	 exts="dll.a so a"
+	 ;;
+	 * )
+	 exts="so a"
+ esac
+
+ xincfile="$jd_onig_inc_file"
+ xlibfile="libonig"
+ jd_with_onig_library="no"
+
+ for include_and_lib in $inc_and_lib_dirs
+ do
+ # Yuk. Is there a better way to set these variables??
+ xincdir=`echo $include_and_lib | tr ',' ' ' | awk '{print $1}'`
+	xlibdir=`echo $include_and_lib | tr ',' ' ' | awk '{print $2}'`
+	found=0
+	if test -r $xincdir/$xincfile
+	then
+	 for E in $exts
+	 do
+	 if test -r "$xlibdir/$xlibfile.$E"
+	 then
+	 jd_onig_include_dir="$xincdir"
+	 jd_onig_library_dir="$xlibdir"
+	 jd_with_onig_library="yes"
+	 found=1
+	 break
+	 fi
+	 done
+	fi
+	if test $found -eq 1
+	then
+	 break
+	fi
+ done
+ fi
+ fi
+
+ if test X"$jd_onig_include_dir" != X -a X"$jd_onig_library_dir" != X
+ then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes: $jd_onig_library_dir and $jd_onig_include_dir" >&5
+$as_echo "yes: $jd_onig_library_dir and $jd_onig_include_dir" >&6; }
+ jd_with_onig_library="yes"
+ ONIG_LIB=-L$jd_onig_library_dir
+ ONIG_LIB_DIR=$jd_onig_library_dir
+ if test "X$jd_onig_library_dir" = "X/usr/lib" -o "X$jd_onig_include_dir" = "X/usr/include"
+ then
+ ONIG_LIB=""
+ else
+
+if test "X$jd_onig_library_dir" != "X"
+then
+ if test "X$RPATH" = "X"
+ then
+
+case "$host_os" in
+ *linux*|*solaris* )
+ if test "X$GCC" = Xyes
+ then
+ if test "X$ac_R_nospace" = "Xno"
+ then
+ RPATH="-Wl,-R,"
+ else
+ RPATH="-Wl,-R"
+ fi
+ else
+ if test "X$ac_R_nospace" = "Xno"
+ then
+ RPATH="-R "
+ else
+	RPATH="-R"
+ fi
+ fi
+ ;;
+ *osf*|*openbsd*|*freebsd*)
+ if test "X$GCC" = Xyes
+ then
+ RPATH="-Wl,-rpath,"
+ else
+ RPATH="-rpath "
+ fi
+ ;;
+ *netbsd*)
+ if test "X$GCC" = Xyes
+ then
+ RPATH="-Wl,-R"
+ fi
+ ;;
+esac
+
+ if test "X$RPATH" != "X"
+ then
+ RPATH="$RPATH$jd_onig_library_dir"
+ fi
+ else
+ _already_there=0
+ for X in `echo $RPATH | sed 's/:/ /g'`
+ do
+ if test "$X" = "$jd_onig_library_dir"
+ then
+ _already_there=1
+	break
+ fi
+ done
+ if test $_already_there = 0
+ then
+ RPATH="$RPATH:$jd_onig_library_dir"
+ fi
+ fi
+fi
+
+ fi
+
+ ONIG_INC=-I$jd_onig_include_dir
+ ONIG_INC_DIR=$jd_onig_include_dir
+ if test "X$jd_onig_include_dir" = "X/usr/include"
+ then
+ ONIG_INC=""
+ fi
+ else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+ jd_with_onig_library="no"
+ ONIG_INC=""
+ ONIG_LIB=""
+ ONIG_INC_DIR=""
+ ONIG_LIB_DIR=""
+ fi
+
+
+
+
+
+if test $jd_with_onig_library = yes
+then
+ ONIG_MODULE="onig-module.so"
+
+$as_echo "#define HAVE_ONIGURUMA_H 1" >>confdefs.h
+
+ extramodules="$extramodules oniguruma"
+else
+ ONIG_MODULE=""
+ missingmodules="$missingmodules oniguruma"
+fi
+
+
+
+
+
+
+ jd_png_include_dir=""
+ jd_png_library_dir=""
+ if test X"$jd_with_png_library" = X
+ then
+ jd_with_png_library=""
+ fi
+
+
+# Check whether --with-png was given.
+if test "${with_png+set}" = set; then :
+ withval=$with_png; jd_with_png_arg=$withval
+else
+ jd_with_png_arg=unspecified
+fi
+
+
+ case "x$jd_with_png_arg" in
+ xno)
+ jd_with_png_library="no"
+ ;;
+ x)
+ jd_with_png_library="yes"
+ ;;
+ xunspecified)
+ ;;
+ xyes)
+ jd_with_png_library="yes"
+ ;;
+ *)
+ jd_with_png_library="yes"
+ jd_png_include_dir="$jd_with_png_arg"/include
+ jd_png_library_dir="$jd_with_png_arg"/lib
+ ;;
+ esac
+
+
+# Check whether --with-pnglib was given.
+if test "${with_pnglib+set}" = set; then :
+ withval=$with_pnglib; jd_with_pnglib_arg=$withval
+else
+ jd_with_pnglib_arg=unspecified
+fi
+
+ case "x$jd_with_pnglib_arg" in
+ xunspecified)
+ ;;
+ xno)
+ ;;
+ x)
+ as_fn_error $? "--with-pnglib requres a value" "$LINENO" 5
+ ;;
+ *)
+ jd_with_png_library="yes"
+ jd_png_library_dir="$jd_with_pnglib_arg"
+ ;;
+ esac
+
+
+# Check whether --with-pnginc was given.
+if test "${with_pnginc+set}" = set; then :
+ withval=$with_pnginc; jd_with_pnginc_arg=$withval
+else
+ jd_with_pnginc_arg=unspecified
+fi
+
+ case "x$jd_with_pnginc_arg" in
+ x)
+ as_fn_error $? "--with-pnginc requres a value" "$LINENO" 5
+ ;;
+ xunspecified)
+ ;;
+ xno)
+ ;;
+ *)
+ jd_with_png_library="yes"
+ jd_png_include_dir="$jd_with_pnginc_arg"
+ ;;
+ esac
+
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for the png library and header files " >&5
+$as_echo_n "checking for the png library and header files ... " >&6; }
+ if test X"$jd_with_png_library" != Xno
+ then
+ jd_png_inc_file=
+
+ if test "X$jd_png_inc_file" = "X"
+ then
+ jd_png_inc_file=png.h
+ fi
+
+ if test X"$jd_png_include_dir" = X
+ then
+ inc_and_lib_dirs="\
+ $jd_prefix_incdir,$jd_prefix_libdir \
+	 /usr/local/png/include,/usr/local/png/lib \
+	 /usr/local/include/png,/usr/local/lib \
+	 /usr/local/include,/usr/local/lib \
+	 $JD_SYS_INCLIBS \
+	 /usr/include/png,/usr/lib \
+	 /usr/png/include,/usr/png/lib \
+	 /usr/include,/usr/lib \
+	 /opt/include/png,/opt/lib \
+	 /opt/png/include,/opt/png/lib \
+	 /opt/include,/opt/lib"
+
+ if test X != X
+ then
+ inc_and_lib_dirs="/include,/lib $inc_and_lib_dirs"
+ fi
+
+ case "$host_os" in
+ *darwin* )
+	 exts="dylib so a"
+	 ;;
+	 *cygwin* )
+	 exts="dll.a so a"
+	 ;;
+	 * )
+	 exts="so a"
+ esac
+
+ xincfile="$jd_png_inc_file"
+ xlibfile="libpng"
+ jd_with_png_library="no"
+
+ for include_and_lib in $inc_and_lib_dirs
+ do
+ # Yuk. Is there a better way to set these variables??
+ xincdir=`echo $include_and_lib | tr ',' ' ' | awk '{print $1}'`
+	xlibdir=`echo $include_and_lib | tr ',' ' ' | awk '{print $2}'`
+	found=0
+	if test -r $xincdir/$xincfile
+	then
+	 for E in $exts
+	 do
+	 if test -r "$xlibdir/$xlibfile.$E"
+	 then
+	 jd_png_include_dir="$xincdir"
+	 jd_png_library_dir="$xlibdir"
+	 jd_with_png_library="yes"
+	 found=1
+	 break
+	 fi
+	 done
+	fi
+	if test $found -eq 1
+	then
+	 break
+	fi
+ done
+ fi
+ fi
+
+ if test X"$jd_png_include_dir" != X -a X"$jd_png_library_dir" != X
+ then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes: $jd_png_library_dir and $jd_png_include_dir" >&5
+$as_echo "yes: $jd_png_library_dir and $jd_png_include_dir" >&6; }
+ jd_with_png_library="yes"
+ PNG_LIB=-L$jd_png_library_dir
+ PNG_LIB_DIR=$jd_png_library_dir
+ if test "X$jd_png_library_dir" = "X/usr/lib" -o "X$jd_png_include_dir" = "X/usr/include"
+ then
+ PNG_LIB=""
+ else
+
+if test "X$jd_png_library_dir" != "X"
+then
+ if test "X$RPATH" = "X"
+ then
+
+case "$host_os" in
+ *linux*|*solaris* )
+ if test "X$GCC" = Xyes
+ then
+ if test "X$ac_R_nospace" = "Xno"
+ then
+ RPATH="-Wl,-R,"
+ else
+ RPATH="-Wl,-R"
+ fi
+ else
+ if test "X$ac_R_nospace" = "Xno"
+ then
+ RPATH="-R "
+ else
+	RPATH="-R"
+ fi
+ fi
+ ;;
+ *osf*|*openbsd*|*freebsd*)
+ if test "X$GCC" = Xyes
+ then
+ RPATH="-Wl,-rpath,"
+ else
+ RPATH="-rpath "
+ fi
+ ;;
+ *netbsd*)
+ if test "X$GCC" = Xyes
+ then
+ RPATH="-Wl,-R"
+ fi
+ ;;
+esac
+
+ if test "X$RPATH" != "X"
+ then
+ RPATH="$RPATH$jd_png_library_dir"
+ fi
+ else
+ _already_there=0
+ for X in `echo $RPATH | sed 's/:/ /g'`
+ do
+ if test "$X" = "$jd_png_library_dir"
+ then
+ _already_there=1
+	break
+ fi
+ done
+ if test $_already_there = 0
+ then
+ RPATH="$RPATH:$jd_png_library_dir"
+ fi
+ fi
+fi
+
+ fi
+
+ PNG_INC=-I$jd_png_include_dir
+ PNG_INC_DIR=$jd_png_include_dir
+ if test "X$jd_png_include_dir" = "X/usr/include"
+ then
+ PNG_INC=""
+ fi
+ else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+ jd_with_png_library="no"
+ PNG_INC=""
+ PNG_LIB=""
+ PNG_INC_DIR=""
+ PNG_LIB_DIR=""
+ fi
+
+
+
+
+
+if test $jd_with_png_library = yes
+then
+ PNG_MODULE="png-module.so"
+
+$as_echo "#define HAVE_PNG_H 1" >>confdefs.h
+
+ extramodules="$extramodules png"
+else
+ PNG_MODULE=""
+ missingmodules="$missingmodules png"
+fi
+
+
+
+
+
+
+ jd_z_include_dir=""
+ jd_z_library_dir=""
+ if test X"$jd_with_z_library" = X
+ then
+ jd_with_z_library=""
+ fi
+
+
+# Check whether --with-z was given.
+if test "${with_z+set}" = set; then :
+ withval=$with_z; jd_with_z_arg=$withval
+else
+ jd_with_z_arg=unspecified
+fi
+
+
+ case "x$jd_with_z_arg" in
+ xno)
+ jd_with_z_library="no"
+ ;;
+ x)
+ jd_with_z_library="yes"
+ ;;
+ xunspecified)
+ ;;
+ xyes)
+ jd_with_z_library="yes"
+ ;;
+ *)
+ jd_with_z_library="yes"
+ jd_z_include_dir="$jd_with_z_arg"/include
+ jd_z_library_dir="$jd_with_z_arg"/lib
+ ;;
+ esac
+
+
+# Check whether --with-zlib was given.
+if test "${with_zlib+set}" = set; then :
+ withval=$with_zlib; jd_with_zlib_arg=$withval
+else
+ jd_with_zlib_arg=unspecified
+fi
+
+ case "x$jd_with_zlib_arg" in
+ xunspecified)
+ ;;
+ xno)
+ ;;
+ x)
+ as_fn_error $? "--with-zlib requres a value" "$LINENO" 5
+ ;;
+ *)
+ jd_with_z_library="yes"
+ jd_z_library_dir="$jd_with_zlib_arg"
+ ;;
+ esac
+
+
+# Check whether --with-zinc was given.
+if test "${with_zinc+set}" = set; then :
+ withval=$with_zinc; jd_with_zinc_arg=$withval
+else
+ jd_with_zinc_arg=unspecified
+fi
+
+ case "x$jd_with_zinc_arg" in
+ x)
+ as_fn_error $? "--with-zinc requres a value" "$LINENO" 5
+ ;;
+ xunspecified)
+ ;;
+ xno)
+ ;;
+ *)
+ jd_with_z_library="yes"
+ jd_z_include_dir="$jd_with_zinc_arg"
+ ;;
+ esac
+
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for the z library and header files zlib.h" >&5
+$as_echo_n "checking for the z library and header files zlib.h... " >&6; }
+ if test X"$jd_with_z_library" != Xno
+ then
+ jd_z_inc_file=zlib.h
+
+ if test "X$jd_z_inc_file" = "X"
+ then
+ jd_z_inc_file=z.h
+ fi
+
+ if test X"$jd_z_include_dir" = X
+ then
+ inc_and_lib_dirs="\
+ $jd_prefix_incdir,$jd_prefix_libdir \
+	 /usr/local/z/include,/usr/local/z/lib \
+	 /usr/local/include/z,/usr/local/lib \
+	 /usr/local/include,/usr/local/lib \
+	 $JD_SYS_INCLIBS \
+	 /usr/include/z,/usr/lib \
+	 /usr/z/include,/usr/z/lib \
+	 /usr/include,/usr/lib \
+	 /opt/include/z,/opt/lib \
+	 /opt/z/include,/opt/z/lib \
+	 /opt/include,/opt/lib"
+
+ if test X != X
+ then
+ inc_and_lib_dirs="/include,/lib $inc_and_lib_dirs"
+ fi
+
+ case "$host_os" in
+ *darwin* )
+	 exts="dylib so a"
+	 ;;
+	 *cygwin* )
+	 exts="dll.a so a"
+	 ;;
+	 * )
+	 exts="so a"
+ esac
+
+ xincfile="$jd_z_inc_file"
+ xlibfile="libz"
+ jd_with_z_library="no"
+
+ for include_and_lib in $inc_and_lib_dirs
+ do
+ # Yuk. Is there a better way to set these variables??
+ xincdir=`echo $include_and_lib | tr ',' ' ' | awk '{print $1}'`
+	xlibdir=`echo $include_and_lib | tr ',' ' ' | awk '{print $2}'`
+	found=0
+	if test -r $xincdir/$xincfile
+	then
+	 for E in $exts
+	 do
+	 if test -r "$xlibdir/$xlibfile.$E"
+	 then
+	 jd_z_include_dir="$xincdir"
+	 jd_z_library_dir="$xlibdir"
+	 jd_with_z_library="yes"
+	 found=1
+	 break
+	 fi
+	 done
+	fi
+	if test $found -eq 1
+	then
+	 break
+	fi
+ done
+ fi
+ fi
+
+ if test X"$jd_z_include_dir" != X -a X"$jd_z_library_dir" != X
+ then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes: $jd_z_library_dir and $jd_z_include_dir" >&5
+$as_echo "yes: $jd_z_library_dir and $jd_z_include_dir" >&6; }
+ jd_with_z_library="yes"
+ Z_LIB=-L$jd_z_library_dir
+ Z_LIB_DIR=$jd_z_library_dir
+ if test "X$jd_z_library_dir" = "X/usr/lib" -o "X$jd_z_include_dir" = "X/usr/include"
+ then
+ Z_LIB=""
+ else
+
+if test "X$jd_z_library_dir" != "X"
+then
+ if test "X$RPATH" = "X"
+ then
+
+case "$host_os" in
+ *linux*|*solaris* )
+ if test "X$GCC" = Xyes
+ then
+ if test "X$ac_R_nospace" = "Xno"
+ then
+ RPATH="-Wl,-R,"
+ else
+ RPATH="-Wl,-R"
+ fi
+ else
+ if test "X$ac_R_nospace" = "Xno"
+ then
+ RPATH="-R "
+ else
+	RPATH="-R"
+ fi
+ fi
+ ;;
+ *osf*|*openbsd*|*freebsd*)
+ if test "X$GCC" = Xyes
+ then
+ RPATH="-Wl,-rpath,"
+ else
+ RPATH="-rpath "
+ fi
+ ;;
+ *netbsd*)
+ if test "X$GCC" = Xyes
+ then
+ RPATH="-Wl,-R"
+ fi
+ ;;
+esac
+
+ if test "X$RPATH" != "X"
+ then
+ RPATH="$RPATH$jd_z_library_dir"
+ fi
+ else
+ _already_there=0
+ for X in `echo $RPATH | sed 's/:/ /g'`
+ do
+ if test "$X" = "$jd_z_library_dir"
+ then
+ _already_there=1
+	break
+ fi
+ done
+ if test $_already_there = 0
+ then
+ RPATH="$RPATH:$jd_z_library_dir"
+ fi
+ fi
+fi
+
+ fi
+
+ Z_INC=-I$jd_z_include_dir
+ Z_INC_DIR=$jd_z_include_dir
+ if test "X$jd_z_include_dir" = "X/usr/include"
+ then
+ Z_INC=""
+ fi
+ else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+ jd_with_z_library="no"
+ Z_INC=""
+ Z_LIB=""
+ Z_INC_DIR=""
+ Z_LIB_DIR=""
+ fi
+
+
+
+
+
+if test $jd_with_z_library = yes
+then
+ ZLIB_MODULE="zlib-module.so"
+
+$as_echo "#define HAVE_ZLIB_H 1" >>confdefs.h
+
+ extramodules="$extramodules z"
+else
+ ZLIB_MODULE=""
+ missingmodules="$missingmodules z"
+fi
+
+
+#serial AM2
+
+
+
+
+
+ICONV_MODULE=""
+
+
+
+
+ jd_iconv_include_dir=""
+ jd_iconv_library_dir=""
+ if test X"$jd_with_iconv_library" = X
+ then
+ jd_with_iconv_library=""
+ fi
+
+
+# Check whether --with-iconv was given.
+if test "${with_iconv+set}" = set; then :
+ withval=$with_iconv; jd_with_iconv_arg=$withval
+else
+ jd_with_iconv_arg=unspecified
+fi
+
+
+ case "x$jd_with_iconv_arg" in
+ xno)
+ jd_with_iconv_library="no"
+ ;;
+ x)
+ jd_with_iconv_library="yes"
+ ;;
+ xunspecified)
+ ;;
+ xyes)
+ jd_with_iconv_library="yes"
+ ;;
+ *)
+ jd_with_iconv_library="yes"
+ jd_iconv_include_dir="$jd_with_iconv_arg"/include
+ jd_iconv_library_dir="$jd_with_iconv_arg"/lib
+ ;;
+ esac
+
+
+# Check whether --with-iconvlib was given.
+if test "${with_iconvlib+set}" = set; then :
+ withval=$with_iconvlib; jd_with_iconvlib_arg=$withval
+else
+ jd_with_iconvlib_arg=unspecified
+fi
+
+ case "x$jd_with_iconvlib_arg" in
+ xunspecified)
+ ;;
+ xno)
+ ;;
+ x)
+ as_fn_error $? "--with-iconvlib requres a value" "$LINENO" 5
+ ;;
+ *)
+ jd_with_iconv_library="yes"
+ jd_iconv_library_dir="$jd_with_iconvlib_arg"
+ ;;
+ esac
+
+
+# Check whether --with-iconvinc was given.
+if test "${with_iconvinc+set}" = set; then :
+ withval=$with_iconvinc; jd_with_iconvinc_arg=$withval
+else
+ jd_with_iconvinc_arg=unspecified
+fi
+
+ case "x$jd_with_iconvinc_arg" in
+ x)
+ as_fn_error $? "--with-iconvinc requres a value" "$LINENO" 5
+ ;;
+ xunspecified)
+ ;;
+ xno)
+ ;;
+ *)
+ jd_with_iconv_library="yes"
+ jd_iconv_include_dir="$jd_with_iconvinc_arg"
+ ;;
+ esac
+
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for the iconv library and header files " >&5
+$as_echo_n "checking for the iconv library and header files ... " >&6; }
+ if test X"$jd_with_iconv_library" != Xno
+ then
+ jd_iconv_inc_file=
+
+ if test "X$jd_iconv_inc_file" = "X"
+ then
+ jd_iconv_inc_file=iconv.h
+ fi
+
+ if test X"$jd_iconv_include_dir" = X
+ then
+ inc_and_lib_dirs="\
+ $jd_prefix_incdir,$jd_prefix_libdir \
+	 /usr/local/iconv/include,/usr/local/iconv/lib \
+	 /usr/local/include/iconv,/usr/local/lib \
+	 /usr/local/include,/usr/local/lib \
+	 $JD_SYS_INCLIBS \
+	 /usr/include/iconv,/usr/lib \
+	 /usr/iconv/include,/usr/iconv/lib \
+	 /usr/include,/usr/lib \
+	 /opt/include/iconv,/opt/lib \
+	 /opt/iconv/include,/opt/iconv/lib \
+	 /opt/include,/opt/lib"
+
+ if test X != X
+ then
+ inc_and_lib_dirs="/include,/lib $inc_and_lib_dirs"
+ fi
+
+ case "$host_os" in
+ *darwin* )
+	 exts="dylib so a"
+	 ;;
+	 *cygwin* )
+	 exts="dll.a so a"
+	 ;;
+	 * )
+	 exts="so a"
+ esac
+
+ xincfile="$jd_iconv_inc_file"
+ xlibfile="libiconv"
+ jd_with_iconv_library="no"
+
+ for include_and_lib in $inc_and_lib_dirs
+ do
+ # Yuk. Is there a better way to set these variables??
+ xincdir=`echo $include_and_lib | tr ',' ' ' | awk '{print $1}'`
+	xlibdir=`echo $include_and_lib | tr ',' ' ' | awk '{print $2}'`
+	found=0
+	if test -r $xincdir/$xincfile
+	then
+	 for E in $exts
+	 do
+	 if test -r "$xlibdir/$xlibfile.$E"
+	 then
+	 jd_iconv_include_dir="$xincdir"
+	 jd_iconv_library_dir="$xlibdir"
+	 jd_with_iconv_library="yes"
+	 found=1
+	 break
+	 fi
+	 done
+	fi
+	if test $found -eq 1
+	then
+	 break
+	fi
+ done
+ fi
+ fi
+
+ if test X"$jd_iconv_include_dir" != X -a X"$jd_iconv_library_dir" != X
+ then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes: $jd_iconv_library_dir and $jd_iconv_include_dir" >&5
+$as_echo "yes: $jd_iconv_library_dir and $jd_iconv_include_dir" >&6; }
+ jd_with_iconv_library="yes"
+ ICONV_LIB=-L$jd_iconv_library_dir
+ ICONV_LIB_DIR=$jd_iconv_library_dir
+ if test "X$jd_iconv_library_dir" = "X/usr/lib" -o "X$jd_iconv_include_dir" = "X/usr/include"
+ then
+ ICONV_LIB=""
+ else
+
+if test "X$jd_iconv_library_dir" != "X"
+then
+ if test "X$RPATH" = "X"
+ then
+
+case "$host_os" in
+ *linux*|*solaris* )
+ if test "X$GCC" = Xyes
+ then
+ if test "X$ac_R_nospace" = "Xno"
+ then
+ RPATH="-Wl,-R,"
+ else
+ RPATH="-Wl,-R"
+ fi
+ else
+ if test "X$ac_R_nospace" = "Xno"
+ then
+ RPATH="-R "
+ else
+	RPATH="-R"
+ fi
+ fi
+ ;;
+ *osf*|*openbsd*|*freebsd*)
+ if test "X$GCC" = Xyes
+ then
+ RPATH="-Wl,-rpath,"
+ else
+ RPATH="-rpath "
+ fi
+ ;;
+ *netbsd*)
+ if test "X$GCC" = Xyes
+ then
+ RPATH="-Wl,-R"
+ fi
+ ;;
+esac
+
+ if test "X$RPATH" != "X"
+ then
+ RPATH="$RPATH$jd_iconv_library_dir"
+ fi
+ else
+ _already_there=0
+ for X in `echo $RPATH | sed 's/:/ /g'`
+ do
+ if test "$X" = "$jd_iconv_library_dir"
+ then
+ _already_there=1
+	break
+ fi
+ done
+ if test $_already_there = 0
+ then
+ RPATH="$RPATH:$jd_iconv_library_dir"
+ fi
+ fi
+fi
+
+ fi
+
+ ICONV_INC=-I$jd_iconv_include_dir
+ ICONV_INC_DIR=$jd_iconv_include_dir
+ if test "X$jd_iconv_include_dir" = "X/usr/include"
+ then
+ ICONV_INC=""
+ fi
+ else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+ jd_with_iconv_library="no"
+ ICONV_INC=""
+ ICONV_LIB=""
+ ICONV_INC_DIR=""
+ ICONV_LIB_DIR=""
+ fi
+
+
+
+
+
+if test $jd_with_iconv_library = yes
+then
+ ICONV_MODULE="iconv-module.so"
+
+$as_echo "#define HAVE_ICONV_H 1" >>confdefs.h
+
+ ICONV_LIB="$ICONV_LIB -liconv"
+ extramodules="$extramodules iconv"
+else
+
+
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for iconv" >&5
+$as_echo_n "checking for iconv... " >&6; }
+if ${am_cv_func_iconv+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+
+ am_cv_func_iconv="no, consider installing GNU libiconv"
+ am_cv_lib_iconv=no
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <stdlib.h>
+#include <iconv.h>
+int
+main ()
+{
+iconv_t cd = iconv_open("","");
+ iconv(cd,NULL,NULL,NULL,NULL);
+ iconv_close(cd);
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ am_cv_func_iconv=yes
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+ if test "$am_cv_func_iconv" != yes; then
+ am_save_LIBS="$LIBS"
+ LIBS="$LIBS -liconv"
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+#include <stdlib.h>
+#include <iconv.h>
+int
+main ()
+{
+iconv_t cd = iconv_open("","");
+ iconv(cd,NULL,NULL,NULL,NULL);
+ iconv_close(cd);
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+ am_cv_lib_iconv=yes
+ am_cv_func_iconv=yes
+fi
+rm -f core conftest.err conftest.$ac_objext \
+ conftest$ac_exeext conftest.$ac_ext
+ LIBS="$am_save_LIBS"
+ fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_func_iconv" >&5
+$as_echo "$am_cv_func_iconv" >&6; }
+
+ if test "$am_cv_func_iconv" = yes; then
+
+$as_echo "#define HAVE_ICONV 1" >>confdefs.h
+
+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking for iconv declaration" >&5
+$as_echo_n "checking for iconv declaration... " >&6; }
+
+ if ${am_cv_proto_iconv+:} false; then :
+ $as_echo_n "(cached) " >&6
+else
+
+ cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h. */
+
+#include <stdlib.h>
+#include <iconv.h>
+extern
+#ifdef __cplusplus
+"C"
+#endif
+#if defined(__STDC__) || defined(__cplusplus)
+size_t iconv (iconv_t cd, char * *inbuf, size_t *inbytesleft, char * *outbuf, size_t *outbytesleft);
+#else
+size_t iconv();
+#endif
+
+int
+main ()
+{
+
+ ;
+ return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+ am_cv_proto_iconv_arg1=""
+else
+ am_cv_proto_iconv_arg1="const"
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+ am_cv_proto_iconv="extern size_t iconv (iconv_t cd, $am_cv_proto_iconv_arg1 char * *inbuf, size_t *inbytesleft, char * *outbuf, size_t *outbytesleft);"
+fi
+
+
+ am_cv_proto_iconv=`echo "$am_cv_proto_iconv" | tr -s ' ' | sed -e 's/( /(/'`
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${ac_t:-
+ }$am_cv_proto_iconv" >&5
+$as_echo "${ac_t:-
+ }$am_cv_proto_iconv" >&6; }
+
+cat >>confdefs.h <<_ACEOF
+#define ICONV_CONST $am_cv_proto_iconv_arg1
+_ACEOF
+
+ fi
+
+ LIBICONV=
+ if test "$am_cv_lib_iconv" = yes; then
+ LIBICONV="-liconv"
+ fi
+
+ if test "$am_cv_func_iconv" = yes
+ then
+ ICONV_MODULE="iconv-module.so"
+ extramodules="$extramodules iconv"
+ if test "X$am_cv_lib_iconv" = Xyes
+ then
+ ICONV_LIB=$LIBICONV
+ ICONV_INC=""
+ fi
+ else
+ missingmodules="$missingmodules iconv"
+ fi
+fi
+
+
+for ac_func in sysconf
+do :
+ ac_fn_c_check_func "$LINENO" "sysconf" "ac_cv_func_sysconf"
+if test "x$ac_cv_func_sysconf" = xyes; then :
+ cat >>confdefs.h <<_ACEOF
+#define HAVE_SYSCONF 1
+_ACEOF
+
+ SYSCONF_MODULE="sysconf-module.so"
+
+else
+ SYSCONF_MODULE=""
+fi
+done
+
+
+
+
+ PROGRAM_HFILES=""
+ PROGRAM_OFILES=""
+ PROGRAM_CFILES=""
+ PROGRAM_OBJECTS=""
+ PROGRAM_ELFOBJECTS=""
+ PROGRAM_OBJECT_RULES=""
+ PROGRAM_ELF_ORULES=""
+ if test -z "src/modules.unx"
+ then
+ Program_Modules=""
+ else
+ comment_re="^#"
+ Program_Modules=`grep -v '$comment_re' src/modules.unx | awk '{print $1}'`
+ Program_H_Modules=`grep -v '$comment_re' src/modules.unx | awk '{print $2}'`
+ for program_module in $Program_H_Modules; do
+ PROGRAM_HFILES="$PROGRAM_HFILES $program_module"
+ done
+ fi
+ for program_module in $Program_Modules; do
+ PROGRAM_OFILES="$PROGRAM_OFILES $program_module.o"
+ PROGRAM_CFILES="$PROGRAM_CFILES $program_module.c"
+ PROGRAM_OBJECTS="$PROGRAM_OBJECTS \$(OBJDIR)/$program_module.o"
+ PROGRAM_ELFOBJECTS="$PROGRAM_ELFOBJECTS \$(ELFDIR)/$program_module.o"
+ done
+
+
+ for program_module in $Program_Modules; do
+
+PROGRAM_OBJECT_RULES="$PROGRAM_OBJECT_RULES
+\$(OBJDIR)/$program_module.o : \$(SRCDIR)/$program_module.c \$(DOT_O_DEPS) \$(OBJ_O_DEPS) \$("$program_module"_O_DEP)
+	cd \$(OBJDIR) && \$(COMPILE_CMD) \$("$program_module"_C_FLAGS) \$(SRCDIR)/$program_module.c
+"
+
+
+PROGRAM_ELF_ORULES="$PROGRAM_ELF_ORULES
+\$(ELFDIR)/$program_module.o : \$(SRCDIR)/$program_module.c \$(DOT_O_DEPS) \$(ELF_O_DEPS) \$("$program_module"_O_DEP)
+	cd \$(ELFDIR) && \$(ELFCOMPILE_CMD) \$("$program_module"_C_FLAGS) \$(SRCDIR)/$program_module.c
+"
+
+ done
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking SLANG_VERSION" >&5
+$as_echo_n "checking SLANG_VERSION... " >&6; }
+slang_version=`grep "^#define *SLANG_VERSION " $srcdir/src/slang.h |
+ awk '{ print $3 }'`
+slang_major_version=`echo $slang_version |
+ awk '{ print int($1/10000) }'`
+slang_minor_version=`echo $slang_version $slang_major_version |
+ awk '{ print int(($1 - $2*10000)/100) }'`
+slang_micro_version=`echo $slang_version $slang_major_version $slang_minor_version |
+ awk '{ print ($1 - $2*10000 - $3*100) }'`
+
+slang_version="$slang_major_version.$slang_minor_version.$slang_micro_version"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $slang_version" >&5
+$as_echo "$slang_version" >&6; }
+
+
+
+
+
+ac_config_headers="$ac_config_headers src/sysconf.h:src/config.hin"
+
+
+
+ac_config_files="$ac_config_files Makefile:autoconf/Makefile.in src/Makefile slsh/Makefile modules/Makefile demo/Makefile slang.pc:autoconf/slangpc.in"
+
+cat >confcache <<\_ACEOF
+# This file is a shell script that caches the results of configure
+# tests run on this system so they can be shared between configure
+# scripts and configure runs, see configure's option --config-cache.
+# It is not useful on other systems. If it contains results you don't
+# want to keep, you may remove or edit it.
+#
+# config.status only pays attention to the cache file if you give it
+# the --recheck option to rerun configure.
+#
+# `ac_cv_env_foo' variables (set or unset) will be overridden when
+# loading this file, other *unset* `ac_cv_foo' will be assigned the
+# following values.
+
+_ACEOF
+
+# The following way of writing the cache mishandles newlines in values,
+# but we know of no workaround that is simple, portable, and efficient.
+# So, we kill variables containing newlines.
+# Ultrix sh set writes to stderr and can't be redirected directly,
+# and sets the high bit in the cache file unless we assign to the vars.
+(
+ for ac_var in `(set) 2>&1 | sed -n 's/^$a-zA-Z_a-zA-Z0-9_*$=.*/\1/p'`; do
+ eval ac_val=\$$ac_var
+ case $ac_val in #(
+ *${as_nl}*)
+ case $ac_var in #(
+ *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+ esac
+ case $ac_var in #(
+ _ | IFS | as_nl) ;; #(
+ BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+ *) { eval $ac_var=; unset $ac_var;} ;;
+ esac ;;
+ esac
+ done
+
+ (set) 2>&1 |
+ case $as_nl`(ac_space=' '; set) 2>&1` in #(
+ *${as_nl}ac_space=\ *)
+ # `set' does not quote correctly, so add quotes: double-quote
+ # substitution turns \\\\ into \\, and sed turns \\ into \.
+ sed -n \
+	"s/'/'\\\\''/g;
+	 s/^\$_$as_cr_alnum*_cv__$as_cr_alnum*\$=\$.*\$/\\1='\\2'/p"
+ ;; #(
+ *)
+ # `set' quotes correctly as required by POSIX, so do not add quotes.
+ sed -n "/^_$as_cr_alnum*_cv__$as_cr_alnum*=/p"
+ ;;
+ esac |
+ sort
+) |
+ sed '
+ /^ac_cv_env_/b end
+ t clear
+ :clear
+ s/^$^=*$=$.*{}.*$$/test "${\1+set}" = set || &/
+ t end
+ s/^$^=*$=$.*$$/\1=${\1=\2}/
+ :end' >>confcache
+if diff "$cache_file" confcache >/dev/null 2>&1; then :; else
+ if test -w "$cache_file"; then
+ if test "x$cache_file" != "x/dev/null"; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5
+$as_echo "$as_me: updating cache $cache_file" >&6;}
+ if test ! -f "$cache_file" || test -h "$cache_file"; then
+	cat confcache >"$cache_file"
+ else
+ case $cache_file in #(
+ */* | ?:*)
+	 mv -f confcache "$cache_file"$$ &&
+	 mv -f "$cache_file"$$ "$cache_file" ;; #(
+ *)
+	 mv -f confcache "$cache_file" ;;
+	esac
+ fi
+ fi
+ else
+ { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5
+$as_echo "$as_me: not updating unwritable cache $cache_file" >&6;}
+ fi
+fi
+rm -f confcache
+
+test "x$prefix" = xNONE && prefix=$ac_default_prefix
+# Let make expand exec_prefix.
+test "x$exec_prefix" = xNONE && exec_prefix='${prefix}'
+
+DEFS=-DHAVE_CONFIG_H
+
+ac_libobjs=
+ac_ltlibobjs=
+U=
+for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue
+ # 1. Remove the extension, and $U if already installed.
+ ac_script='s/\$U\././;s/\.o$//;s/\.obj$//'
+ ac_i=`$as_echo "$ac_i" | sed "$ac_script"`
+ # 2. Prepend LIBOBJDIR. When used with automake>=1.10 LIBOBJDIR
+ # will be set to the directory where LIBOBJS objects are built.
+ as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext"
+ as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo'
+done
+LIBOBJS=$ac_libobjs
+
+LTLIBOBJS=$ac_ltlibobjs
+
+
+
+: "${CONFIG_STATUS=./config.status}"
+ac_write_fail=0
+ac_clean_files_save=$ac_clean_files
+ac_clean_files="$ac_clean_files $CONFIG_STATUS"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5
+$as_echo "$as_me: creating $CONFIG_STATUS" >&6;}
+as_write_fail=0
+cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1
+#! $SHELL
+# Generated by $as_me.
+# Run this file to recreate the current configuration.
+# Compiler output produced by configure, useful for debugging
+# configure, is in config.log if it exists.
+
+debug=false
+ac_cs_recheck=false
+ac_cs_silent=false
+
+SHELL=\${CONFIG_SHELL-$SHELL}
+export SHELL
+_ASEOF
+cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+ emulate sh
+ NULLCMD=:
+ # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+ # is contrary to our usage. Disable this feature.
+ alias -g '${1+"$@"}'='"$@"'
+ setopt NO_GLOB_SUBST
+else
+ case `(set -o) 2>/dev/null` in #(
+ *posix*) :
+ set -o posix ;; #(
+ *) :
+ ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+ as_echo='print -r --'
+ as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+ as_echo='printf %s\n'
+ as_echo_n='printf %s'
+else
+ if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+ as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+ as_echo_n='/usr/ucb/echo -n'
+ else
+ as_echo_body='eval expr "X$1" : "X\$.*\$"'
+ as_echo_n_body='eval
+ arg=$1;
+ case $arg in #(
+ *"$as_nl"*)
+	expr "X$arg" : "X\$.*\$$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\$.*\$"`;;
+ esac;
+ expr "X$arg" : "X\$.*\$" | tr -d "$as_nl"
+ '
+ export as_echo_n_body
+ as_echo_n='sh -c $as_echo_n_body as_echo'
+ fi
+ export as_echo_body
+ as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+ PATH_SEPARATOR=:
+ (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+ (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+ PATH_SEPARATOR=';'
+ }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order. Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are. Look in the path if we contain no directory separator.
+as_myself=
+case $0 in #((
+ *\\/* ) as_myself=$0 ;;
+ *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+ done
+IFS=$as_save_IFS
+
+ ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+ as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+ $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+ exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there. '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+
+# as_fn_error STATUS ERROR LINENO LOG_FD
+# ----------------------------------------
+# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+# script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+ as_status=$1; test $as_status -eq 0 && as_status=1
+ if test "$4"; then
+ as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+ $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+ fi
+ $as_echo "$as_me: error: $2" >&2
+ as_fn_exit $as_status
+} # as_fn_error
+
+
+# as_fn_set_status STATUS
+# -----------------------
+# Set $? to STATUS, without forking.
+as_fn_set_status ()
+{
+ return $1
+} # as_fn_set_status
+
+# as_fn_exit STATUS
+# -----------------
+# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+ set +e
+ as_fn_set_status $1
+ exit $1
+} # as_fn_exit
+
+# as_fn_unset VAR
+# ---------------
+# Portably unset VAR.
+as_fn_unset ()
+{
+ { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+# as_fn_append VAR VALUE
+# ----------------------
+# Append the text in VALUE to the end of the definition contained in VAR. Take
+# advantage of any shell optimizations that allow amortized linear growth over
+# repeated appends, instead of the typical quadratic growth present in naive
+# implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+ eval 'as_fn_append ()
+ {
+ eval $1+=\$2
+ }'
+else
+ as_fn_append ()
+ {
+ eval $1=\$$1\$2
+ }
+fi # as_fn_append
+
+# as_fn_arith ARG...
+# ------------------
+# Perform arithmetic evaluation on the ARGs, and store the result in the
+# global $as_val. Take advantage of shells that can avoid forks. The arguments
+# must be portable across $(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+ eval 'as_fn_arith ()
+ {
+ as_val=$(( $* ))
+ }'
+else
+ as_fn_arith ()
+ {
+ as_val=`expr "$@" || test $? -eq 1`
+ }
+fi # as_fn_arith
+
+
+if expr a : '$a$' >/dev/null 2>&1 &&
+ test "X`expr 00001 : '.*$...$'`" = X001; then
+ as_expr=expr
+else
+ as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+ as_basename=basename
+else
+ as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+ as_dirname=dirname
+else
+ as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/$^/^/*$/*$' \| \
+	 X"$0" : 'X$//$$' \| \
+	 X"$0" : 'X$/$' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+ sed '/^.*\/$^/^/*$\/*$/{
+	 s//\1/
+	 q
+	 }
+	 /^X\/$\/\/$$/{
+	 s//\1/
+	 q
+	 }
+	 /^X\/$\/$.*/{
+	 s//\1/
+	 q
+	 }
+	 s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in #(((((
+-n*)
+ case `echo 'xy\c'` in
+ *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+ xy) ECHO_C='\c';;
+ *) echo `echo ksh88 bug on AIX 6.1` > /dev/null
+ ECHO_T='	';;
+ esac;;
+*)
+ ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+ rm -f conf$$.dir/conf$$.file
+else
+ rm -f conf$$.dir
+ mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+ if ln -s conf$$.file conf$$ 2>/dev/null; then
+ as_ln_s='ln -s'
+ # ... but there are two gotchas:
+ # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+ # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+ # In both cases, we have to default to `cp -pR'.
+ ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+ as_ln_s='cp -pR'
+ elif ln conf$$.file conf$$ 2>/dev/null; then
+ as_ln_s=ln
+ else
+ as_ln_s='cp -pR'
+ fi
+else
+ as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+
+# as_fn_mkdir_p
+# -------------
+# Create "$as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+ case $as_dir in #(
+ -*) as_dir=./$as_dir;;
+ esac
+ test -d "$as_dir" || eval $as_mkdir_p || {
+ as_dirs=
+ while :; do
+ case $as_dir in #(
+ *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+ *) as_qdir=$as_dir;;
+ esac
+ as_dirs="'$as_qdir' $as_dirs"
+ as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X$.*^/$//*^/^/*/*$' \| \
+	 X"$as_dir" : 'X$//$^/' \| \
+	 X"$as_dir" : 'X$//$$' \| \
+	 X"$as_dir" : 'X$/$' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+ sed '/^X$.*^/$\/\/*^/^/*\/*$/{
+	 s//\1/
+	 q
+	 }
+	 /^X$\/\/$^/.*/{
+	 s//\1/
+	 q
+	 }
+	 /^X$\/\/$$/{
+	 s//\1/
+	 q
+	 }
+	 /^X$\/$.*/{
+	 s//\1/
+	 q
+	 }
+	 s/.*/./; q'`
+ test -d "$as_dir" && break
+ done
+ test -z "$as_dirs" || eval "mkdir $as_dirs"
+ } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} # as_fn_mkdir_p
+if mkdir -p . 2>/dev/null; then
+ as_mkdir_p='mkdir -p "$as_dir"'
+else
+ test -d ./-p && rmdir ./-p
+ as_mkdir_p=false
+fi
+
+
+# as_fn_executable_p FILE
+# -----------------------
+# Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+ test -f "$1" && test -x "$1"
+} # as_fn_executable_p
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%^_$as_cr_alnum%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%^_$as_cr_alnum%_%g'"
+
+
+exec 6>&1
+## ----------------------------------- ##
+## Main body of $CONFIG_STATUS script. ##
+## ----------------------------------- ##
+_ASEOF
+test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# Save the log message, to keep $0 and so on meaningful, and to
+# report actual input values of CONFIG_FILES etc. instead of their
+# values after options handling.
+ac_log="
+This file was extended by $as_me, which was
+generated by GNU Autoconf 2.69. Invocation command line was
+
+ CONFIG_FILES = $CONFIG_FILES
+ CONFIG_HEADERS = $CONFIG_HEADERS
+ CONFIG_LINKS = $CONFIG_LINKS
+ CONFIG_COMMANDS = $CONFIG_COMMANDS
+ $ $0 $@
+
+on `(hostname || uname -n) 2>/dev/null | sed 1q`
+"
+
+_ACEOF
+
+case $ac_config_files in *"
+"*) set x $ac_config_files; shift; ac_config_files=$*;;
+esac
+
+case $ac_config_headers in *"
+"*) set x $ac_config_headers; shift; ac_config_headers=$*;;
+esac
+
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+# Files that config.status was made for.
+config_files="$ac_config_files"
+config_headers="$ac_config_headers"
+
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+ac_cs_usage="\
+\`$as_me' instantiates files and other configuration actions
+from templates according to the current configuration. Unless the files
+and actions are specified as TAGs, all are instantiated by default.
+
+Usage: $0 OPTION... TAG...
+
+ -h, --help print this help, then exit
+ -V, --version print version number and configuration settings, then exit
+ --config print configuration, then exit
+ -q, --quiet, --silent
+ do not print progress messages
+ -d, --debug don't remove temporary files
+ --recheck update $as_me by reconfiguring in the same conditions
+ --file=FILE:TEMPLATE
+ instantiate the configuration file FILE
+ --header=FILE:TEMPLATE
+ instantiate the configuration header FILE
+
+Configuration files:
+$config_files
+
+Configuration headers:
+$config_headers
+
+Report bugs to the package provider."
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/\\""\`\$/\\\\&/g'`"
+ac_cs_version="\\
+config.status
+configured by $0, generated by GNU Autoconf 2.69,
+ with options \\"\$ac_cs_config\\"
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This config.status script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it."
+
+ac_pwd='$ac_pwd'
+srcdir='$srcdir'
+INSTALL='$INSTALL'
+test -n "\$AWK" || AWK=awk
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# The default lists apply if the user does not specify any file.
+ac_need_defaults=:
+while test $# != 0
+do
+ case $1 in
+ --*=?*)
+ ac_option=`expr "X$1" : 'X$^=*$='`
+ ac_optarg=`expr "X$1" : 'X^=*=$.*$'`
+ ac_shift=:
+ ;;
+ --*=)
+ ac_option=`expr "X$1" : 'X$^=*$='`
+ ac_optarg=
+ ac_shift=:
+ ;;
+ *)
+ ac_option=$1
+ ac_optarg=$2
+ ac_shift=shift
+ ;;
+ esac
+
+ case $ac_option in
+ # Handling of the options.
+ -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
+ ac_cs_recheck=: ;;
+ --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
+ $as_echo "$ac_cs_version"; exit ;;
+ --config | --confi | --conf | --con | --co | --c )
+ $as_echo "$ac_cs_config"; exit ;;
+ --debug | --debu | --deb | --de | --d | -d )
+ debug=: ;;
+ --file | --fil | --fi | --f )
+ $ac_shift
+ case $ac_optarg in
+ *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+ '') as_fn_error $? "missing file argument" ;;
+ esac
+ as_fn_append CONFIG_FILES " '$ac_optarg'"
+ ac_need_defaults=false;;
+ --header | --heade | --head | --hea )
+ $ac_shift
+ case $ac_optarg in
+ *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+ esac
+ as_fn_append CONFIG_HEADERS " '$ac_optarg'"
+ ac_need_defaults=false;;
+ --he | --h)
+ # Conflict between --help and --header
+ as_fn_error $? "ambiguous option: \`$1'
+Try \`$0 --help' for more information.";;
+ --help | --hel | -h )
+ $as_echo "$ac_cs_usage"; exit ;;
+ -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+ | -silent | --silent | --silen | --sile | --sil | --si | --s)
+ ac_cs_silent=: ;;
+
+ # This is an error.
+ -*) as_fn_error $? "unrecognized option: \`$1'
+Try \`$0 --help' for more information." ;;
+
+ *) as_fn_append ac_config_targets " $1"
+ ac_need_defaults=false ;;
+
+ esac
+ shift
+done
+
+ac_configure_extra_args=
+
+if $ac_cs_silent; then
+ exec 6>/dev/null
+ ac_configure_extra_args="$ac_configure_extra_args --silent"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+if \$ac_cs_recheck; then
+ set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion
+ shift
+ \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6
+ CONFIG_SHELL='$SHELL'
+ export CONFIG_SHELL
+ exec "\$@"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+exec 5>>config.log
+{
+ echo
+ sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX
+## Running $as_me. ##
+_ASBOX
+ $as_echo "$ac_log"
+} >&5
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+
+# Handling of arguments.
+for ac_config_target in $ac_config_targets
+do
+ case $ac_config_target in
+ "src/sysconf.h") CONFIG_HEADERS="$CONFIG_HEADERS src/sysconf.h:src/config.hin" ;;
+ "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile:autoconf/Makefile.in" ;;
+ "src/Makefile") CONFIG_FILES="$CONFIG_FILES src/Makefile" ;;
+ "slsh/Makefile") CONFIG_FILES="$CONFIG_FILES slsh/Makefile" ;;
+ "modules/Makefile") CONFIG_FILES="$CONFIG_FILES modules/Makefile" ;;
+ "demo/Makefile") CONFIG_FILES="$CONFIG_FILES demo/Makefile" ;;
+ "slang.pc") CONFIG_FILES="$CONFIG_FILES slang.pc:autoconf/slangpc.in" ;;
+
+ *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;;
+ esac
+done
+
+
+# If the user did not use the arguments to specify the items to instantiate,
+# then the envvar interface is used. Set only those that are not.
+# We use the long form for the default assignment because of an extremely
+# bizarre bug on SunOS 4.1.3.
+if $ac_need_defaults; then
+ test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
+ test "${CONFIG_HEADERS+set}" = set || CONFIG_HEADERS=$config_headers
+fi
+
+# Have a temporary directory for convenience. Make it in the build tree
+# simply because there is no reason against having it here, and in addition,
+# creating and moving files from /tmp can sometimes cause problems.
+# Hook for its removal unless debugging.
+# Note that there is a small window in which the directory will not be cleaned:
+# after its creation but before its name has been assigned to `$tmp'.
+$debug ||
+{
+ tmp= ac_tmp=
+ trap 'exit_status=$?
+ : "${ac_tmp:=$tmp}"
+ { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status
+' 0
+ trap 'as_fn_exit 1' 1 2 13 15
+}
+# Create a (secure) tmp directory for tmp files.
+
+{
+ tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
+ test -d "$tmp"
+} ||
+{
+ tmp=./conf$$-$RANDOM
+ (umask 077 && mkdir "$tmp")
+} || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5
+ac_tmp=$tmp
+
+# Set up the scripts for CONFIG_FILES section.
+# No need to generate them if there are no CONFIG_FILES.
+# This happens for instance with `./config.status config.h'.
+if test -n "$CONFIG_FILES"; then
+
+
+ac_cr=`echo X | tr X '\015'`
+# On cygwin, bash can eat \r inside `` if the user requested igncr.
+# But we know of no other shell where ac_cr would be empty at this
+# point, so we can use a bashism as a fallback.
+if test "x$ac_cr" = x; then
+ eval ac_cr=\$\'\\r\'
+fi
+ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' </dev/null 2>/dev/null`
+if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then
+ ac_cs_awk_cr='\\r'
+else
+ ac_cs_awk_cr=$ac_cr
+fi
+
+echo 'BEGIN {' >"$ac_tmp/subs1.awk" &&
+_ACEOF
+
+
+{
+ echo "cat >conf$$subs.awk <<_ACEOF" &&
+ echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' &&
+ echo "_ACEOF"
+} >conf$$subs.sh ||
+ as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'`
+ac_delim='%!_!# '
+for ac_last_try in false false false false false :; do
+ . ./conf$$subs.sh ||
+ as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+
+ ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X`
+ if test $ac_delim_n = $ac_delim_num; then
+ break
+ elif $ac_last_try; then
+ as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+ else
+ ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
+ fi
+done
+rm -f conf$$subs.sh
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&
+_ACEOF
+sed -n '
+h
+s/^/S"/; s/!.*/"=/
+p
+g
+s/^^!*!//
+:repl
+t repl
+s/'"$ac_delim"'$//
+t delim
+:nl
+h
+s/$.\{148\}$..*/\1/
+t more1
+s/"\\/\\&/g; s/^/"/; s/$/\\n"\\/
+p
+n
+b repl
+:more1
+s/"\\/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t nl
+:delim
+h
+s/$.\{148\}$..*/\1/
+t more2
+s/"\\/\\&/g; s/^/"/; s/$/"/
+p
+b
+:more2
+s/"\\/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t delim
+' <conf$$subs.awk | sed '
+/^^""/{
+ N
+ s/\n//
+}
+' >>$CONFIG_STATUS || ac_write_fail=1
+rm -f conf$$subs.awk
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACAWK
+cat >>"\$ac_tmp/subs1.awk" <<_ACAWK &&
+ for (key in S) S_is_setkey = 1
+ FS = "&#x7;"
+
+}
+{
+ line = $ 0
+ nfields = split(line, field, "@")
+ substed = 0
+ len = length(field1)
+ for (i = 2; i < nfields; i++) {
+ key = fieldi
+ keylen = length(key)
+ if (S_is_setkey) {
+ value = Skey
+ line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3)
+ len += length(value) + length(field++i)
+ substed = 1
+ } else
+ len += 1 + keylen
+ }
+
+ print line
+}
+
+_ACAWK
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then
+ sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g"
+else
+ cat
+fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \
+ || as_fn_error $? "could not setup config files machinery" "$LINENO" 5
+_ACEOF
+
+# VPATH may cause trouble with some makes, so we remove sole $(srcdir),
+# ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and
+# trailing colons and then remove the whole line if VPATH becomes empty
+# (actually we leave an empty line to preserve line numbers).
+if test "x$srcdir" = x.; then
+ ac_vpsub='/^	 *VPATH	 *=	 */{
+h
+s///
+s/^/:/
+s/	 *$/:/
+s/:\$(srcdir):/:/g
+s/:\${srcdir}:/:/g
+s/:@srcdir@:/:/g
+s/^:*//
+s/:*$//
+x
+s/$=	 *$.*/\1/
+G
+s/\n//
+s/^^=*=	 *$//
+}'
+fi
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+fi # test -n "$CONFIG_FILES"
+
+# Set up the scripts for CONFIG_HEADERS section.
+# No need to generate them if there are no CONFIG_HEADERS.
+# This happens for instance with `./config.status Makefile'.
+if test -n "$CONFIG_HEADERS"; then
+cat >"$ac_tmp/defines.awk" <<\_ACAWK ||
+BEGIN {
+_ACEOF
+
+# Transform confdefs.h into an awk script `defines.awk', embedded as
+# here-document in config.status, that substitutes the proper values into
+# config.h.in to produce config.h.
+
+# Create a delimiter string that does not exist in confdefs.h, to ease
+# handling of long lines.
+ac_delim='%!_!# '
+for ac_last_try in false false :; do
+ ac_tt=`sed -n "/$ac_delim/p" confdefs.h`
+ if test -z "$ac_tt"; then
+ break
+ elif $ac_last_try; then
+ as_fn_error $? "could not make $CONFIG_HEADERS" "$LINENO" 5
+ else
+ ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
+ fi
+done
+
+# For the awk script, D is an array of macro values keyed by name,
+# likewise P contains macro parameters if any. Preserve backslash
+# newline sequences.
+
+ac_word_re=_$as_cr_Letters_$as_cr_alnum*
+sed -n '
+s/.\{148\}/&'"$ac_delim"'/g
+t rset
+:rset
+s/^	 *#	 *define	 	 */ /
+t def
+d
+:def
+s/\\$//
+t bsnl
+s/"\\/\\&/g
+s/^ $'"$ac_word_re"'$$(^()*)$	 *$.*$/P"\1"="\2"\
+D"\1"=" \3"/p
+s/^ $'"$ac_word_re"'$	 *$.*$/D"\1"=" \2"/p
+d
+:bsnl
+s/"\\/\\&/g
+s/^ $'"$ac_word_re"'$$(^()*)$	 *$.*$/P"\1"="\2"\
+D"\1"=" \3\\\\\\n"\\/p
+t cont
+s/^ $'"$ac_word_re"'$	 *$.*$/D"\1"=" \2\\\\\\n"\\/p
+t cont
+d
+:cont
+n
+s/.\{148\}/&'"$ac_delim"'/g
+t clear
+:clear
+s/\\$//
+t bsnlc
+s/"\\/\\&/g; s/^/"/; s/$/"/p
+d
+:bsnlc
+s/"\\/\\&/g; s/^/"/; s/$/\\\\\\n"\\/p
+b cont
+' <confdefs.h | sed '
+s/'"$ac_delim"'/"\\\
+"/g' >>$CONFIG_STATUS || ac_write_fail=1
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ for (key in D) D_is_setkey = 1
+ FS = "&#x7;"
+}
+/^\t *#\t *(define|undef)\t +$ac_word_re(\t (|\$)/ {
+ line = \$ 0
+ split(line, arg, " ")
+ if (arg1 == "#") {
+ defundef = arg2
+ mac1 = arg3
+ } else {
+ defundef = substr(arg1, 2)
+ mac1 = arg2
+ }
+ split(mac1, mac2, "(") #)
+ macro = mac21
+ prefix = substr(line, 1, index(line, defundef) - 1)
+ if (D_is_setmacro) {
+ # Preserve the white space surrounding the "#".
+ print prefix "define", macro Pmacro Dmacro
+ next
+ } else {
+ # Replace #undef with comments. This is necessary, for example,
+ # in the case of _POSIX_SOURCE, which is predefined and required
+ # on some systems where configure will not decide to define it.
+ if (defundef == "undef") {
+ print "/*", prefix defundef, macro, "*/"
+ next
+ }
+ }
+}
+{ print }
+_ACAWK
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+ as_fn_error $? "could not setup config headers machinery" "$LINENO" 5
+fi # test -n "$CONFIG_HEADERS"
+
+
+eval set X " :F $CONFIG_FILES :H $CONFIG_HEADERS "
+shift
+for ac_tag
+do
+ case $ac_tag in
+ :FHLC) ac_mode=$ac_tag; continue;;
+ esac
+ case $ac_mode$ac_tag in
+ :FHL*:*);;
+ :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;;
+ :FH-) ac_tag=-:-;;
+ :FH*) ac_tag=$ac_tag:$ac_tag.in;;
+ esac
+ ac_save_IFS=$IFS
+ IFS=:
+ set x $ac_tag
+ IFS=$ac_save_IFS
+ shift
+ ac_file=$1
+ shift
+
+ case $ac_mode in
+ :L) ac_source=$1;;
+ :FH)
+ ac_file_inputs=
+ for ac_f
+ do
+ case $ac_f in
+ -) ac_f="$ac_tmp/stdin";;
+ *) # Look for the file first in the build tree, then in the source tree
+	 # (if the path is not absolute). The absolute path cannot be DOS-style,
+	 # because $ac_f cannot contain `:'.
+	 test -f "$ac_f" ||
+	 case $ac_f in
+	 \\/$*) false;;
+	 *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
+	 esac ||
+	 as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;;
+ esac
+ case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac
+ as_fn_append ac_file_inputs " '$ac_f'"
+ done
+
+ # Let's still pretend it is `configure' which instantiates (i.e., don't
+ # use $as_me), people would be surprised to read:
+ # /* config.h. Generated by config.status. */
+ configure_input='Generated from '`
+	 $as_echo "$*" | sed 's|^^:*/||;s|:^:*/|, |g'
+	`' by configure.'
+ if test x"$ac_file" != x-; then
+ configure_input="$ac_file. $configure_input"
+ { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5
+$as_echo "$as_me: creating $ac_file" >&6;}
+ fi
+ # Neutralize special characters interpreted by sed in replacement strings.
+ case $configure_input in #(
+ *\&* | *\|* | *\\* )
+ ac_sed_conf_input=`$as_echo "$configure_input" |
+ sed 's/\\\\&|/\\\\&/g'`;; #(
+ *) ac_sed_conf_input=$configure_input;;
+ esac
+
+ case $ac_tag in
+ *:-:* | *:-) cat >"$ac_tmp/stdin" \
+ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;;
+ esac
+ ;;
+ esac
+
+ ac_dir=`$as_dirname -- "$ac_file" ||
+$as_expr X"$ac_file" : 'X$.*^/$//*^/^/*/*$' \| \
+	 X"$ac_file" : 'X$//$^/' \| \
+	 X"$ac_file" : 'X$//$$' \| \
+	 X"$ac_file" : 'X$/$' \| . 2>/dev/null ||
+$as_echo X"$ac_file" |
+ sed '/^X$.*^/$\/\/*^/^/*\/*$/{
+	 s//\1/
+	 q
+	 }
+	 /^X$\/\/$^/.*/{
+	 s//\1/
+	 q
+	 }
+	 /^X$\/\/$$/{
+	 s//\1/
+	 q
+	 }
+	 /^X$\/$.*/{
+	 s//\1/
+	 q
+	 }
+	 s/.*/./; q'`
+ as_dir="$ac_dir"; as_fn_mkdir_p
+ ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+ ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.\\/||'`
+ # A ".." for each directory in $ac_dir_suffix.
+ ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/^\\/*|/..|g;s|/||'`
+ case $ac_top_builddir_sub in
+ "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+ *) ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+ esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+ .) # We are building in place.
+ ac_srcdir=.
+ ac_top_srcdir=$ac_top_builddir_sub
+ ac_abs_top_srcdir=$ac_pwd ;;
+ \\/* | ?:\\/* ) # Absolute name.
+ ac_srcdir=$srcdir$ac_dir_suffix;
+ ac_top_srcdir=$srcdir
+ ac_abs_top_srcdir=$srcdir ;;
+ *) # Relative name.
+ ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+ ac_top_srcdir=$ac_top_build_prefix$srcdir
+ ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+
+ case $ac_mode in
+ :F)
+ #
+ # CONFIG_FILE
+ #
+
+ case $INSTALL in
+ \\/$* | ?:\\/* ) ac_INSTALL=$INSTALL ;;
+ *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
+ esac
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# If the template does not know about datarootdir, expand it.
+# FIXME: This hack should be removed a few years after 2.60.
+ac_datarootdir_hack=; ac_datarootdir_seen=
+ac_sed_dataroot='
+/datarootdir/ {
+ p
+ q
+}
+/@datadir@/p
+/@docdir@/p
+/@infodir@/p
+/@localedir@/p
+/@mandir@/p'
+case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in
+*datarootdir*) ac_datarootdir_seen=yes;;
+*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)
+ { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5
+$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;}
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ ac_datarootdir_hack='
+ s&@datadir@&$datadir&g
+ s&@docdir@&$docdir&g
+ s&@infodir@&$infodir&g
+ s&@localedir@&$localedir&g
+ s&@mandir@&$mandir&g
+ s&\\\${datarootdir}&$datarootdir&g' ;;
+esac
+_ACEOF
+
+# Neutralize VPATH when `$srcdir' = `.'.
+# Shell code in configure.ac might set extrasub.
+# FIXME: do we really want to maintain this feature?
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_sed_extra="$ac_vpsub
+$extrasub
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+:t
+/@a-zA-Z_a-zA-Z_0-9*@/!b
+s|@configure_input@|$ac_sed_conf_input|;t t
+s&@top_builddir@&$ac_top_builddir_sub&;t t
+s&@top_build_prefix@&$ac_top_build_prefix&;t t
+s&@srcdir@&$ac_srcdir&;t t
+s&@abs_srcdir@&$ac_abs_srcdir&;t t
+s&@top_srcdir@&$ac_top_srcdir&;t t
+s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t
+s&@builddir@&$ac_builddir&;t t
+s&@abs_builddir@&$ac_abs_builddir&;t t
+s&@abs_top_builddir@&$ac_abs_top_builddir&;t t
+s&@INSTALL@&$ac_INSTALL&;t t
+$ac_datarootdir_hack
+"
+eval sed \"\$ac_sed_extra\" "$ac_file_inputs" | $AWK -f "$ac_tmp/subs.awk" \
+ >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+
+test -z "$ac_datarootdir_hack$ac_datarootdir_seen" &&
+ { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } &&
+ { ac_out=`sed -n '/^	 *datarootdir	 *:*=/p' \
+ "$ac_tmp/out"`; test -z "$ac_out"; } &&
+ { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined. Please make sure it is defined" >&5
+$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined. Please make sure it is defined" >&2;}
+
+ rm -f "$ac_tmp/stdin"
+ case $ac_file in
+ -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";;
+ *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";;
+ esac \
+ || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ ;;
+ :H)
+ #
+ # CONFIG_HEADER
+ #
+ if test x"$ac_file" != x-; then
+ {
+ $as_echo "/* $configure_input */" \
+ && eval '$AWK -f "$ac_tmp/defines.awk"' "$ac_file_inputs"
+ } >"$ac_tmp/config.h" \
+ || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ if diff "$ac_file" "$ac_tmp/config.h" >/dev/null 2>&1; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: $ac_file is unchanged" >&5
+$as_echo "$as_me: $ac_file is unchanged" >&6;}
+ else
+ rm -f "$ac_file"
+ mv "$ac_tmp/config.h" "$ac_file" \
+	|| as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ fi
+ else
+ $as_echo "/* $configure_input */" \
+ && eval '$AWK -f "$ac_tmp/defines.awk"' "$ac_file_inputs" \
+ || as_fn_error $? "could not create -" "$LINENO" 5
+ fi
+ ;;
+
+
+ esac
+
+done # for ac_tag
+
+
+as_fn_exit 0
+_ACEOF
+ac_clean_files=$ac_clean_files_save
+
+test $ac_write_fail = 0 ||
+ as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5
+
+
+# configure is writing to config.log, and then calls config.status.
+# config.status does its own redirection, appending to config.log.
+# Unfortunately, on DOS this fails, as config.log is still kept open
+# by configure, so config.status won't be able to write to it; its
+# output is simply discarded. So we exec the FD to /dev/null,
+# effectively closing config.log, so it can be properly (re)opened and
+# appended to by config.status. When coming back to configure, we
+# need to make the FD available again.
+if test "$no_create" != yes; then
+ ac_cs_success=:
+ ac_config_status_args=
+ test "$silent" = yes &&
+ ac_config_status_args="$ac_config_status_args --quiet"
+ exec 5>/dev/null
+ $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false
+ exec 5>>config.log
+ # Use ||, not &&, to avoid exiting from the if with $? = 1, which
+ # would make configure fail if this is the last instruction.
+ $ac_cs_success || as_fn_exit 1
+fi
+if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then
+ { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5
+$as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;}
+fi
+
+
+
+PROGRAM_OBJECT_RULES="$PROGRAM_OBJECT_RULES
+calc : \$(OBJDIR)/calc
+	@echo calc created in \$(OBJDIR)
+\$(OBJDIR)/calc : \$(OBJDIR)/calc.o \$("calc"_DEPS) \$(EXECDEPS)
+	\$(CC) -o \$(OBJDIR)/calc \$(LDFLAGS) \$(OBJDIR)/calc.o \$("calc"_LIBS) \$(EXECLIBS)
+\$(OBJDIR)/calc.o : \$(SRCDIR)/calc.c \$(DOT_O_DEPS) \$("calc"_O_DEP)
+	cd \$(OBJDIR) && \$(COMPILE_CMD) \$("calc"_INC) \$(EXECINC) \$(SRCDIR)/calc.c
+"
+
+
+PROGRAM_OBJECT_RULES="$PROGRAM_OBJECT_RULES
+untic : \$(OBJDIR)/untic
+	@echo untic created in \$(OBJDIR)
+\$(OBJDIR)/untic : \$(OBJDIR)/untic.o \$("untic"_DEPS) \$(EXECDEPS)
+	\$(CC) -o \$(OBJDIR)/untic \$(LDFLAGS) \$(OBJDIR)/untic.o \$("untic"_LIBS) \$(EXECLIBS)
+\$(OBJDIR)/untic.o : \$(SRCDIR)/untic.c \$(DOT_O_DEPS) \$("untic"_O_DEP)
+	cd \$(OBJDIR) && \$(COMPILE_CMD) \$("untic"_INC) \$(EXECINC) \$(SRCDIR)/untic.c
+"
+
+
+ echo "$PROGRAM_OBJECT_RULES" >> src/Makefile
+
+
+ echo "$PROGRAM_ELF_ORULES" >> src/Makefile
+
+
+echo ""
+echo "Configuration complete. You may need to edit src/Makefile."
+echo "You are compiling SLANG with the following compiler configuration:"
+echo " CC =" "$CC"
+echo " CFLAGS =" "$CFLAGS"
+echo " LDFLAGS =" "$LDFLAGS $DYNAMIC_LINK_FLAGS"
+echo ""
+echo " ELF_CC =" "$ELF_CC"
+echo " ELF_LINK =" "$ELF_LINK"
+echo "ELF_CFLAGS=" "$ELF_CFLAGS"
+echo ""
+echo " prefix:" "$prefix"
+echo " exec_prefix:" "$exec_prefix"
+echo " Installation Lib Dir:" "$libdir"
+echo "Installation Include Dir:" "$includedir"
+echo ""
+echo "See also src/sl-feat.h for various features."
+
+echo ""
+echo "The following modules that depend upon external libraries will be built:"
+echo " $extramodules"
+echo ""
+if test "X$missingmodules" != "X"
+then
+ echo ""
+ echo "While not required, it is recommended that you install the following"
+ echo "libraries and reconfigure so that the corresponding modules can be built:"
+ echo " $missingmodules"
+ echo ""
+fi
+echo "Type 'make' to build a shared version of the library."
+echo "Type 'make help' for more options"
+echo ""

_service:tar_scm:slang-2.3.2.tar.bz2/demo Added

_service:tar_scm:slang-2.3.2.tar.bz2/demo/Makefile.in Added

@@ -0,0 +1,69 @@
+# -*- sh -*-
+
+#---------------------------------------------------------------------------
+# Choose a C compiler.  It must understand prototypes.
+#-----------------------------------------------------------------------------
+CC = @CC@
+CFLAGS = @CFLAGS@
+LDFLAGS = @LDFLAGS@ @DYNAMIC_LINK_FLAGS@
+#-----------------------------------------------------------------------------
+# Directory where the various libraries are located.
+#-----------------------------------------------------------------------------
+SLANG_INCLUDE = ../src#             location of slang.h
+SLANG_LIB = $(SLANG_INCLUDE)/$(ARCH)objs#     location of libslang.a
+
+#---------------------------------------------------------------------------
+# Other libraries
+#---------------------------------------------------------------------------
+TCAPLIB = @TERMCAP@ @DYNAMIC_LINK_LIB@
+#TCAPLIB = -ltermcap
+
+#----------------------------------------------------------------------------
+# End of user configuration
+#----------------------------------------------------------------------------
+@SET_MAKE@
+SHELL = /bin/sh
+OTHERSTUFF = useropen pager keypad smgtest
+CONFIG_H = config.h
+
+ALL_CFLAGS = $(CFLAGS) -Dunix -I$(SLANG_INCLUDE)
+
+COMPILE_CMD = $(CC) -c $(ALL_CFLAGS)
+EXECLIBS = -L$(SLANG_LIB) -lslang @M_LIB@ $(TCAPLIB)
+EXECDEPS = $(SLANG_LIB)/libslang.a
+DOT_O_DEPS = demolib.c
+
+#---------------------------------------------------------------------------
+all: $(CONFIG_H) $(OTHERSTUFF)
+
+$(CONFIG_H) : $(SLANG_LIB)/libslang.a ../src/config.h
+	/bin/cp ../src/config.h $(CONFIG_H)
+$(SLANG_LIB)/libslang.a :
+	cd ../src; $(MAKE)
+#---------------------------------------------------------------------------
+# Housekeeping
+#---------------------------------------------------------------------------
+clean:
+	-/bin/rm -f *~ $(OTHERSTUFF) *.o
+distclean: clean
+	-/bin/rm -rf Makefile config.h
+#
+useropen : useropen.o $(useropen_DEPS) $(EXECDEPS)
+	$(CC) -o useropen $(LDFLAGS) useropen.o $(useropen_LIBS) $(EXECLIBS)
+useropen.o : useropen.c $(DOT_O_DEPS) $(useropen_O_DEP)
+	$(COMPILE_CMD) $(useropen_INC) $(EXECINC) useropen.c
+
+pager : pager.o $(pager_DEPS) $(EXECDEPS)
+	$(CC) -o pager $(LDFLAGS) pager.o $(pager_LIBS) $(EXECLIBS)
+pager.o : pager.c $(DOT_O_DEPS) $(pager_O_DEP)
+	$(COMPILE_CMD) $(pager_INC) $(EXECINC) pager.c
+
+keypad : keypad.o $(keypad_DEPS) $(EXECDEPS)
+	$(CC) -o keypad $(LDFLAGS) keypad.o $(keypad_LIBS) $(EXECLIBS)
+keypad.o : keypad.c $(DOT_O_DEPS) $(keypad_O_DEP)
+	$(COMPILE_CMD) $(keypad_INC) $(EXECINC) keypad.c
+
+smgtest : smgtest.o $(smgtest_DEPS) $(EXECDEPS)
+	$(CC) -o smgtest $(LDFLAGS) smgtest.o $(smgtest_LIBS) $(EXECLIBS)
+smgtest.o : smgtest.c $(DOT_O_DEPS) $(smgtest_O_DEP)
+	$(COMPILE_CMD) $(smgtest_INC) $(EXECINC) smgtest.c

_service:tar_scm:slang-2.3.2.tar.bz2/demo/Makefile.w32 Added

_service:tar_scm:slang-2.3.2.tar.bz2/demo/README Added

@@ -0,0 +1,43 @@
+What's here?
+
+Each C file in this directory are heavily commented examples that illustrate
+only one or two S-Lang features.  Some C files are accompanied by a .sl file
+that contains S-Lang code relevant to the example.
+
+If you find these demos confusing, please let me know so I can work on
+improving them.
+
+Please note that these demos WILL NOT WORK under msdos unless the S-lang
+library is compiled with the -DFLOAT_TYPE option.
+
+---------------------------------------------------------------------------
+pager.c:    A simple file pager demo.  Use pageup/down keys to scroll
+            through the file.  It illustrates the SLsmg, SLsig, SLkp,
+	    and SLscroll routines of the S-Lang library.  This example
+	    should be contrasted with the curses demo ../src/curses/view.c.
+
+keypad.c:   Illustrates the slkeypad facility.
+
+simple.c:   This file contains slightly more than the miniumum required to
+	    embed S-Lang.  It loads a file specified on the command line.
+
+simple.sl:  An S-Lang script that prompts for a filename and returns
+            information about the file.  Use this with the `simple'
+	    executable.
+
+array.c:    This example shows how to embed a C array into S-Lang allowing
+            access to the array from a S-Lang script.
+array.sl:   This script reads and writes the array specified in array.c.
+
+useropen.c  This example shows how to specify an object that S-Lang will
+	    interpret.  S-lang already knows how to interpret code contained
+	    in strings and files.  Interpreting code from a `readline'
+	    structure is illustrated here.  The demo in ../src/calc.c uses
+	    this technique to interpret data from S-Lang's readline routines.
+
+complex.c   Adding an application defined data type is the focus of this
+            example.  Specifically, a complex number type is added and the
+	    binary and unary operators are overloaded to work with the new
+	    type.
+complex.sl  A script that manipulates the complex number type defined in
+            complex.c.

_service:tar_scm:slang-2.3.2.tar.bz2/demo/demolib.c Added

@@ -0,0 +1,98 @@
+/* These routines are used by several of the demos. */
+#include "config.h"
+#include <stdio.h>
+#include <signal.h>
+
+#ifdef HAVE_STDLIB_H
+# include <stdlib.h>
+#endif
+
+#include <slang.h>
+
+static void demolib_exit (int sig)
+{
+ SLang_reset_tty ();
+ SLsmg_reset_smg ();
+
+ if (sig)
+ {
+	fprintf (stderr, "Exiting on signal %d\n", sig);
+	exit (1);
+ }
+ exit (sig);
+}
+
+#ifdef SIGTSTP
+static void sigtstp_handler (int sig)
+{
+ demolib_exit (sig);
+}
+#endif
+
+#ifdef SIGINT
+static void sigint_handler (int sig)
+{
+ demolib_exit (sig);
+}
+#endif
+
+static void init_signals (void)
+{
+#ifdef SIGTSTP
+ SLsignal (SIGTSTP, sigtstp_handler);
+#endif
+#ifdef SIGINT
+ SLsignal (SIGINT, sigint_handler);
+#endif
+}
+
+static void exit_error_hook (char *fmt, va_list ap)
+{
+ SLang_reset_tty ();
+ SLsmg_reset_smg ();
+
+ vfprintf (stderr, fmt, ap);
+ fputc ('\n', stderr);
+ exit (1);
+}
+
+static int demolib_init_terminal (int tty, int smg)
+{
+ SLang_Exit_Error_Hook = exit_error_hook;
+
+ /* It is wise to block the occurrence of display related signals while we are
+ * initializing.
+ */
+ SLsig_block_signals ();
+
+ SLtt_get_terminfo ();
+
+ /* SLkp_init assumes that SLtt_get_terminfo has been called. */
+ if (tty && (-1 == SLkp_init ()))
+ {
+	SLsig_unblock_signals ();
+	return -1;
+ }
+
+ init_signals ();
+
+ if (tty) SLang_init_tty (-1, 0, 1);
+#ifdef REAL_UNIX_SYSTEM
+ if (tty) SLtty_set_suspend_state (1);
+#endif
+ if (smg)
+ {
+	(void) SLutf8_enable (-1);
+
+	if (-1 == SLsmg_init_smg ())
+	 {
+	 SLsig_unblock_signals ();
+	 return -1;
+	 }
+ }
+
+ SLsig_unblock_signals ();
+
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/demo/keypad.c Added

_service:tar_scm:slang-2.3.2.tar.bz2/demo/pager.c Added

@@ -0,0 +1,278 @@
+/* This file pager demo illustrates the screen management and
+ * keyboard routines.
+ */
+
+#include <stdio.h>
+#include <string.h>
+
+#include <stdlib.h>
+
+#include <signal.h>
+
+#ifdef unix
+# include <unistd.h>
+#endif
+
+#include <slang.h>
+
+#include "demolib.c"
+
+static void usage (char *pgm)
+{
+ fprintf (stderr, "Usage: %s FILENAME\n", pgm);
+ exit (1);
+}
+
+static int read_file (char *);
+static void main_loop (void);
+
+static char *File_Name;		 /* if NULL, use stdin */
+
+int main (int argc, char **argv)
+{
+ if (argc == 2)
+ {
+	File_Name = argv1;
+ }
+ else if ((argc != 1) || (1 == isatty (fileno(stdin))))
+ usage (argv0);
+
+ if (-1 == read_file (File_Name))
+ {
+	fprintf (stderr, "Unable to read %s\n", File_Name);
+	return 1;
+ }
+
+ /* This sets up the terminal, signals, screen management routines, etc... */
+ if (-1 == demolib_init_terminal (1, 1))
+ {
+	fprintf (stderr, "Unable to initialize terminal.");
+	return 1;
+ }
+
+#define APP_KEY_EOB 0x1001
+#define APP_KEY_BOB 0x1002
+
+ /* Add a few application defined keysyms. 0x1000 and above are for
+ * applications.
+ */
+ (void) SLkp_define_keysym ("\033>", APP_KEY_EOB);
+ (void) SLkp_define_keysym ("\033<", APP_KEY_BOB);
+
+ main_loop ();		 /* should not return */
+ return 1;
+}
+
+/* The SLscroll routines will be used for pageup/down commands. They assume
+ * a linked list of lines. The first element of the structure MUST point to
+ * the NEXT line, the second MUST point to the PREVIOUS line.
+ */
+typedef struct _File_Line_Type
+{
+ struct _File_Line_Type *next;
+ struct _File_Line_Type *prev;
+ char *data;			 /* pointer to line data */
+}
+File_Line_Type;
+
+static File_Line_Type *File_Lines;
+
+/* The SLscroll routines will use this structure. */
+static SLscroll_Window_Type Line_Window;
+
+static void free_lines (void)
+{
+ File_Line_Type *line, *next;
+
+ line = File_Lines;
+ while (line != NULL)
+ {
+	next = line->next;
+	if (line->data != NULL) free (line->data);
+	free (line);
+	line = next;
+ }
+ File_Lines = NULL;
+}
+
+static File_Line_Type *create_line (char *buf)
+{
+ File_Line_Type *line;
+
+ line = (File_Line_Type *) malloc (sizeof (File_Line_Type));
+ if (line == NULL) return NULL;
+
+ memset ((char *) line, 0, sizeof (File_Line_Type));
+
+ line->data = SLmake_string (buf); /* use a slang routine */
+ if (line->data == NULL)
+ {
+	free (line);
+	return NULL;
+ }
+
+ return line;
+}
+
+static int read_file (char *file)
+{
+ FILE *fp;
+ char buf 1024;
+ File_Line_Type *line, *last_line;
+ unsigned int num_lines;
+
+ if (file == NULL)
+ fp = stdin;
+ else fp = fopen (file, "r");
+
+ if (fp == NULL) return -1;
+
+ last_line = NULL;
+ num_lines = 0;
+
+ while (NULL != fgets (buf, sizeof(buf), fp))
+ {
+	num_lines++;
+
+	if (NULL == (line = create_line (buf)))
+	 {
+	 fprintf (stderr, "Out of memory.");
+	 free_lines ();
+	 return -1;
+	 }
+
+	if (last_line == NULL)
+	 File_Lines = line;
+	else
+	 last_line->next = line;
+
+	line->prev = last_line;
+	line->next = NULL;
+
+	last_line = line;
+ }
+
+ memset ((char *)&Line_Window, 0, sizeof (SLscroll_Window_Type));
+
+ Line_Window.current_line = (SLscroll_Type *) File_Lines;
+ Line_Window.lines = (SLscroll_Type *) File_Lines;
+ Line_Window.line_num = 1;
+ Line_Window.num_lines = num_lines;
+ /* Line_Window.border = 3; */
+
+ return 0;
+}
+
+static void update_display (void)
+{
+ unsigned int row, nrows;
+ File_Line_Type *line;
+
+ /* All well behaved applications should block signals that may affect
+ * the display while performing screen update.
+ */
+ SLsig_block_signals ();
+
+ Line_Window.nrows = nrows = SLtt_Screen_Rows - 1;
+
+ /* Always make the current line equal to the top window line. */
+ if (Line_Window.top_window_line != NULL)
+ Line_Window.current_line = Line_Window.top_window_line;
+
+ SLscroll_find_top (&Line_Window);
+
+ row = 0;
+ line = (File_Line_Type *) Line_Window.top_window_line;
+
+ SLsmg_normal_video ();
+
+ while (row < Line_Window.nrows)
+ {
+	SLsmg_gotorc (row, 0);
+
+	if (line != NULL)
+	 {
+	 SLsmg_write_string (line->data);
+	 line = line->next;
+	 }
+	SLsmg_erase_eol ();
+	row++;
+ }
+
+ SLsmg_gotorc (row, 0);
+ SLsmg_reverse_video ();
+ SLsmg_printf ("%s | UTF-8 = %d",
+		 (File_Name == NULL) ? "<stdin>" : File_Name,
+		 SLutf8_is_utf8_mode ());
+ SLsmg_erase_eol ();
+ SLsmg_refresh ();
+
+ SLsig_unblock_signals ();
+}
+
+static int Screen_Start;
+
+static void main_loop (void)
+{
+ int screen_start;
+
+ while (1)
+ {
+	update_display ();
+	switch (SLkp_getkey ())
+	 {
+	 case SL_KEY_ERR:
+	 case 'q':
+	 case 'Q':
+	 demolib_exit (0);
+	 break;
+
+	 case SL_KEY_RIGHT:
+	 Screen_Start += 1;
+	 screen_start = Screen_Start;
+	 SLsmg_set_screen_start (NULL, &screen_start);
+	 break;
+
+	 case SL_KEY_LEFT:
+	 Screen_Start -= 1;
+	 if (Screen_Start < 0) Screen_Start = 0;
+	 screen_start = Screen_Start;
+	 SLsmg_set_screen_start (NULL, &screen_start);
+	 break;
+
+	 case SL_KEY_UP:
+	 SLscroll_prev_n (&Line_Window, 1);
+	 Line_Window.top_window_line = Line_Window.current_line;
+	 break;
+
+	 case '\r':
+	 case SL_KEY_DOWN:
+	 SLscroll_next_n (&Line_Window, 1);
+	 Line_Window.top_window_line = Line_Window.current_line;
+	 break;
+
+	 case SL_KEY_NPAGE:
+	 case ' ': case 4:
+	 SLscroll_pagedown (&Line_Window);
+	 break;
+
+	 case SL_KEY_PPAGE:
+	 case 127: case 21:
+	 SLscroll_pageup (&Line_Window);
+	 break;
+
+	 case APP_KEY_BOB:
+	 while (-1 != SLscroll_pageup (&Line_Window))
+	 ;
+	 break;
+
+	 case APP_KEY_EOB:
+	 while (-1 != SLscroll_pagedown (&Line_Window))
+	 ;
+	 break;
+
+	 default:
+	 SLtt_beep ();
+	 }
+ }
+}

_service:tar_scm:slang-2.3.2.tar.bz2/demo/rline.c Added

@@ -0,0 +1,179 @@
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <slang.h>
+
+static void issue_instructions (void)
+{
+ (void) fputs ("Enter any text at the prompts.\n", stdout);
+ (void) fputs ("Entering \"quit\" will exit the example\n", stdout);
+ (void) fputs ("An EOF (^D) will also exit the example\n", stdout);
+ (void) fputs ("\n", stdout);
+}
+
+static int example_1 (void)
+{
+ SLrline_Type *rl;
+ unsigned int width = 80;
+
+ issue_instructions ();
+
+ SLang_init_tty (-1, 0, 1);
+ rl = SLrline_open (width, SL_RLINE_BLINK_MATCH);
+
+ while (1)
+ {
+	char *line;
+	unsigned int len;
+
+	line = SLrline_read_line (rl, "prompt>", &len);
+	if (line == NULL)
+	 break;
+	if (0 == strcmp (line, "quit"))
+	 {
+	 SLfree (line);
+	 break;
+	 }
+	(void) fprintf (stdout, "\nRead %d bytes: %s\n", strlen(line), line);
+	SLfree (line);
+ }
+ SLrline_close (rl);
+ SLang_reset_tty ();
+ return 0;
+}
+
+static int example_2 (void)
+{
+ SLrline_Type *rl;
+ unsigned int width = 80;
+
+ issue_instructions ();
+
+ SLang_init_tty (-1, 0, 1);
+ SLang_set_abort_signal (NULL);
+
+ rl = SLrline_open (width, SL_RLINE_BLINK_MATCH);
+ if (rl == NULL)
+ return -1;
+
+ while (1)
+ {
+	char *line;
+	unsigned int len;
+
+	line = SLrline_read_line (rl, "prompt>", &len);
+	if (line == NULL)
+	 {
+	 int err = SLang_get_error ();
+	 if (err == SL_UserBreak_Error)
+	 {
+		 (void) fprintf (stderr, "*Interrupted*\n");
+		 SLang_set_error (0);
+		 SLKeyBoard_Quit = 0;
+		 continue;
+	 }
+	 if (err == 0)
+	 break;		 /* EOF */
+	 fprintf (stderr, "Error Occurred: %s\n", SLerr_strerror (err));
+	 break;
+	 }
+	if (0 == strcmp (line, "quit"))
+	 {
+	 SLfree (line);
+	 break;
+	 }
+	(void) fprintf (stdout, "\nRead %d bytes: %s\n", strlen(line), line);
+	SLfree (line);
+ }
+ SLrline_close (rl);
+ SLang_reset_tty ();
+ return 0;
+}
+
+static int example_3 (void)
+{
+ SLrline_Type *rl;
+ unsigned int width = 80;
+
+ if ((-1 == SLang_init_all ())
+ || (-1 == SLang_init_array_extra ())
+ || (-1 == SLang_init_import ()))
+ return -1;
+
+ (void) SLpath_set_load_path ("../slsh/lib");
+
+ if (-1 == SLrline_init ("demo/rline", NULL, NULL))
+ return -1;
+
+ issue_instructions ();
+
+ SLang_init_tty (-1, 0, 1);
+ SLang_set_abort_signal (NULL);
+
+ rl = SLrline_open2 ("rline", width, SL_RLINE_BLINK_MATCH);
+ if (rl == NULL)
+ return -1;
+
+ while (1)
+ {
+	char *line;
+	unsigned int len;
+
+	line = SLrline_read_line (rl, "prompt>", &len);
+	if (line == NULL)
+	 {
+	 int err = SLang_get_error ();
+	 if (err == SL_UserBreak_Error)
+	 {
+		 (void) fprintf (stderr, "*Interrupted*\n");
+		 SLang_set_error (0);
+		 SLKeyBoard_Quit = 0;
+		 continue;
+	 }
+	 if (err == 0)
+	 break;		 /* EOF */
+	 fprintf (stderr, "Error Occurred: %s\n", SLerr_strerror (err));
+	 break;
+	 }
+	if (0 == strcmp (line, "quit"))
+	 {
+	 SLfree (line);
+	 break;
+	 }
+	(void) fprintf (stdout, "\nRead %d bytes: %s\n", strlen(line), line);
+	if (-1 == SLrline_save_line (rl))
+	 break;
+
+	SLfree (line);
+ }
+ SLrline_close (rl);
+ SLang_reset_tty ();
+ return 0;
+}
+
+int main (int argc, char **argv)
+{
+ int n = 1;
+
+ if (argc == 2)
+ n = atoi (argv1);
+
+ switch (n)
+ {
+ case 1:
+	(void) example_1 ();
+	break;
+ case 2:
+	(void) example_2 ();
+	break;
+ case 3:
+	(void) example_3 ();
+	break;
+
+ default:
+	(void) fprintf (stderr, "Invalid/Unsupported example number: %d\n", n);
+	return 1;
+ }
+ (void) fprintf (stdout, "\nExample %d done\n", n);
+ return 0;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/demo/smgtest.c Added

@@ -0,0 +1,980 @@
+/* This demo test some of the slsmg features. */
+#include "config.h"
+
+#include <stdio.h>
+#ifdef HAVE_STDLIB_H
+# include <stdlib.h>
+#endif
+
+#include <string.h>
+#include <slang.h>
+
+#include "demolib.c"
+
+static void menu_loop (void);
+static int select_menu_item (int i);
+static void init_colors (void);
+
+int main (int argc, char **argv)
+{
+ if (-1 == demolib_init_terminal (1, 1))
+ return 1;
+
+ init_colors ();
+
+ (void) SLtt_set_mouse_mode (1, 0);
+
+ if (argc <= 1)
+ menu_loop ();
+
+ do
+ {
+	argc--;
+	argv++;
+
+	if (-1 == select_menu_item (atoi (*argv)))
+	 menu_loop ();
+ }
+ while (argc > 1);
+
+ demolib_exit (0);
+ return 1;
+}
+
+static void quit (void)
+{
+ demolib_exit (0);
+}
+
+static void bce_color_test (void);
+static void color_test (void);
+static void color_test1 (void);
+static void alt_char_test (void);
+static void esc_seq_test (void);
+static void ansi_esc_seq_test (void);
+static void line_test (void);
+static void mouse_test (void);
+static void low_level_test (void);
+static void box_test (void);
+static void draw_symbols_test (void);
+static void lr_corner_test (void);
+static void mono_test (void);
+static void mono_attr_test (void);
+static void wrapped_string_test (void);
+
+typedef struct
+{
+ char *name;
+ void (*funct) (void);
+}
+Menu_Type;
+
+static Menu_Type Root_Menu =
+{
+ {"Color Test", color_test},
+ {"Another Color Test", color_test1},
+ {"BCE Color Test", bce_color_test},
+ {"Alt charset test", alt_char_test},
+ {"Drawing Symbols", draw_symbols_test},
+ {"Key Escape Sequence Report", esc_seq_test},
+#ifdef IBMPC_SYSTEM
+ {"ANSI Key Escape Sequence Report", ansi_esc_seq_test},
+#endif
+ {"Line Drawing Test", line_test},
+ {"Test Mouse", mouse_test},
+ {"Box Test", box_test},
+ {"Write to Lower Right Corner Test", lr_corner_test},
+ {"Write Wrapped String Test", wrapped_string_test},
+ {"Test Low Level Functions", low_level_test},
+ {"Test monochrome functions", mono_test},
+ {"Test monochrome attributes", mono_attr_test},
+ {"Quit", quit},
+ {NULL, NULL}
+};
+
+Menu_Type *Current_Menu = Root_Menu;
+
+static void print_menu (void)
+{
+ int i;
+ int row;
+ Menu_Type *menu;
+
+ menu = Current_Menu;
+
+ SLsig_block_signals ();
+
+ SLsmg_cls ();
+
+ row = 2;
+ i = 1;
+ while (menu->name != NULL)
+ {
+	SLsmg_gotorc (row, 3);
+	SLsmg_printf ("%2X. %s", i, menu->name);
+	menu++;
+	row++;
+	i++;
+ }
+
+ row = 0;
+ SLsmg_gotorc (row, 1);
+ SLsmg_write_string ("Choose number:");
+
+ SLsmg_refresh ();
+ SLsig_unblock_signals ();
+}
+
+static int select_menu_item (int num)
+{
+ int i = 1;
+ Menu_Type *m = Current_Menu;
+
+ while (m->name != NULL)
+ {
+	if (i == num)
+	 {
+	 (*m->funct) ();
+	 return 0;
+	 }
+	i++;
+	m++;
+ }
+
+ return -1;
+}
+
+static void menu_loop (void)
+{
+ int ch;
+
+ print_menu ();
+
+ while (1)
+ {
+	ch = SLkp_getkey ();
+
+	if ((ch == 'q') || (ch == 'Q'))
+	 quit ();
+
+	if ((ch >= '0')
+	 && (ch <= '9'))
+	 ch -= '0';
+	else if ((ch >= 'A') && (ch <= 'Z'))
+	 ch = 10 + (ch - 'A');
+	else
+	 ch = 10 + (ch - 'a');
+
+	if (-1 == select_menu_item (ch))
+	 {
+	 SLtt_beep ();
+	 continue;
+	 }
+	print_menu ();
+ }
+}
+
+static void write_centered_string (char *s, int row)
+{
+ unsigned int len;
+ int col;
+
+ if (s == NULL)
+ return;
+
+ len = strlen (s);
+
+ /* Want 2 * col + len == SLtt_Screen_Rows */
+ if (len >= (unsigned int) SLtt_Screen_Cols) col = 0;
+ else col = (SLtt_Screen_Cols - (int)len) / 2;
+
+ SLsmg_gotorc (row, col);
+ SLsmg_write_string (s);
+}
+
+static void pre_test (char *title)
+{
+ SLsig_block_signals ();
+ SLsmg_cls ();
+ write_centered_string (title, 0);
+}
+
+static void post_test (void)
+{
+ write_centered_string ("Press any key to return.", SLtt_Screen_Rows - 1);
+ SLsmg_refresh ();
+ SLsig_unblock_signals ();
+ (void) SLkp_getkey ();
+}
+
+/* Various tests */
+
+#define NUM_COLORS 16
+static char *Colors NUM_COLORS =
+{
+ "black/default",
+ "red",
+ "green",
+ "brown",
+ "blue",
+ "magenta",
+ "cyan",
+ "lightgray",
+ "gray",
+ "brightred",
+ "brightgreen",
+ "yellow",
+ "brightblue",
+ "brightmagenta",
+ "brightcyan",
+ "white"
+};
+
+#define MONO_UNDERLINE_COLOR	1
+#define MONO_BOLD_COLOR		2
+#define MONO_REVVIDEO_COLOR	3
+#define MONO_BOLDULINE_COLOR	4
+#define MONO_REVULINE_COLOR	5
+
+static void set_mono_color (int obj, SLtt_Char_Type mask)
+{
+ SLtt_set_color (obj, NULL, "lightgray", "blue");
+ SLtt_add_color_attribute (obj, mask);
+ SLtt_set_mono (obj, NULL, mask);
+}
+
+static void init_mono_colors (void)
+{
+ set_mono_color (MONO_UNDERLINE_COLOR, SLTT_ULINE_MASK);
+ set_mono_color (MONO_REVVIDEO_COLOR, SLTT_REV_MASK);
+ set_mono_color (MONO_BOLDULINE_COLOR, SLTT_BOLD_MASK|SLTT_ULINE_MASK);
+ set_mono_color (MONO_BOLD_COLOR, SLTT_BOLD_MASK);
+ set_mono_color (MONO_REVVIDEO_COLOR, SLTT_REV_MASK);
+ set_mono_color (MONO_REVULINE_COLOR, SLTT_REV_MASK|SLTT_ULINE_MASK);
+}
+
+static void init_colors (void)
+{
+ int i;
+ char *fg, *bg;
+
+ fg = "black";
+ SLtt_set_color (1, NULL, fg, "default");
+ SLtt_set_color (1+NUM_COLORS, NULL, "default", "fg");
+ for (i = 1; i < NUM_COLORS; i++)
+ {
+	bg = Colorsi;
+	SLtt_set_color (i + 1, NULL, fg, bg);
+	SLtt_set_color (i + 1 + NUM_COLORS, NULL, bg, fg);
+ }
+}
+
+static void box_test (void)
+{
+ char *msg = "This is a box with changing background";
+ int r, c, dr, dc;
+ int color;
+
+ pre_test ("Box Test");
+
+ dr = 8;
+ dc = 4 + strlen (msg);
+ r = SLtt_Screen_Rows / 2 - dr/2;
+ c = SLtt_Screen_Cols / 2 - dc/2;
+
+ SLsmg_set_color (1);
+ SLsmg_set_char_set (1);
+ SLsmg_fill_region (r + 1, c + 1, dr - 2, dc - 2, SLSMG_CKBRD_CHAR);
+ SLsmg_set_char_set (0);
+ SLsmg_set_color (0);
+ SLsmg_gotorc (r + dr/2, c + 2); SLsmg_write_string (msg);
+ SLsmg_draw_box (r, c, dr, dc);
+
+ SLsmg_refresh ();
+
+ color = 2;
+ while (0 == SLang_input_pending (10))
+ {
+	SLsmg_set_color_in_region (color, r, c, dr, dc);
+	SLsmg_refresh ();
+	color++;
+	color = color % NUM_COLORS;
+ }
+ post_test ();
+}
+
+static int check_color_support (void)
+{
+ if (SLtt_Use_Ansi_Colors)
+ return 0;
+
+ pre_test ("Your terminal does not provide color support.");
+ post_test ();
+ return -1;
+}
+
+static void bce_color_test (void)
+{
+ int row;
+
+ if (-1 == check_color_support ())
+ return;
+
+ pre_test ("Background Color Erase Test");
+
+ SLtt_set_color (0, NULL, "lightgray", "blue");
+
+ row = SLtt_Screen_Rows/2;
+ SLsmg_set_color (0);
+ SLsmg_gotorc (row, 1);
+ SLsmg_write_string ("The screen background should be blue.");
+
+ row += 2;
+ SLsmg_gotorc (row++, 1);
+ SLsmg_write_string ("****If the screen update is slow, then your terminal");
+ SLsmg_gotorc (row++, 1);
+ SLsmg_write_string (" does not support background-color-erase.");
+ SLsmg_set_color (0);
+ post_test ();
+}
+
+static void lr_corner_test (void)
+{
+ pre_test ("Write to Lower Right Corner Test");
+
+ SLsmg_gotorc (SLtt_Screen_Rows-1, SLtt_Screen_Cols-1);
+ SLsmg_write_string ("Ç");
+
+ write_centered_string ("A 'Ç' should be in the lower-right corner. (assuming UTF-8)",
+			 SLtt_Screen_Rows/2);
+
+ SLsmg_refresh ();
+ SLsig_unblock_signals ();
+ (void) SLkp_getkey ();
+}
+
+static void color_test (void)
+{
+ int color;
+ int row;
+
+ if (-1 == check_color_support ())
+ return;
+
+ pre_test ("Color Test");
+
+ row = 1;
+
+ color = 0;
+ while (row < SLtt_Screen_Rows - 1)
+ {
+	color = color % NUM_COLORS;
+
+	SLsmg_gotorc (row, 0);
+	SLsmg_set_color (color+1+NUM_COLORS);
+	SLsmg_write_string (Colorscolor);
+	color++;
+	SLsmg_set_color (color);
+	SLsmg_erase_eol ();
+	row++;
+ }
+
+ SLsmg_set_color (0);
+ post_test ();
+}
+
+static void color_test1 (void)
+{
+ int color;
+ int r0, r1;
+ int c0, c1;
+ unsigned int dr0, dr1, dc0, dc1;
+
+ if (-1 == check_color_support ())
+ return;
+
+ pre_test ("Another Color Test");
+
+ r0 = 1;
+ r1 = SLtt_Screen_Rows / 2;
+ dr0 = r1;
+ dr1 = SLtt_Screen_Rows;
+
+ c0 = 0;
+ c1 = SLtt_Screen_Cols / 2;
+ dc0 = c1;
+ dc1 = SLtt_Screen_Cols;
+
+ color = 0;
+ do
+ {
+	SLsmg_gotorc (r1, 0);
+	SLsmg_set_color (color); color++; color = color % NUM_COLORS;
+	SLsmg_write_string (" ");
+	SLsmg_set_color (color); color++; color = color % NUM_COLORS;
+	SLsmg_write_string ("X");
+	SLsmg_set_color (color); color++; color = color % NUM_COLORS;
+	SLsmg_erase_eol ();
+	SLsmg_refresh ();
+ }
+ while (0 == SLang_input_pending (30));
+ SLang_flush_input ();
+
+ color = 0;
+ do
+ {
+	SLsmg_set_color (color); color++; color = color % NUM_COLORS;
+	SLsmg_fill_region (r0, c0, dr0, dc0, ' ');
+
+	SLsmg_set_color (color); color++; color = color % NUM_COLORS;
+	SLsmg_fill_region (r0, c1, dr0, dc1, ' ');
+
+	SLsmg_set_color (color); color++; color = color % NUM_COLORS;
+	SLsmg_fill_region (r1, c0, dr1, dc0, ' ');
+
+	SLsmg_set_color (color); color++; color = color % NUM_COLORS;
+	SLsmg_fill_region (r1, c1, dr1, dc1, ' ');
+
+	SLsmg_refresh ();
+ }
+ while (0 == SLang_input_pending (30));
+
+ SLsmg_set_color (0);
+ post_test ();
+}
+
+static void alt_char_test (void)
+{
+ int row, col;
+ SLwchar_Type ch;
+
+ pre_test ("Alternate Charset Test");
+
+ row = SLtt_Screen_Rows / 2 - 2;
+ col = 0;
+ for (ch = 32; ch < 128; ch++)
+ {
+	SLsmg_gotorc (row, col);
+	SLsmg_write_char (ch);
+	SLsmg_gotorc (row + 1, col);
+	SLsmg_set_char_set (1);
+	SLsmg_write_char (ch);
+	SLsmg_set_char_set (0);
+	col++;
+
+	if (col > 40)
+	 {
+	 col = 0;
+	 row += 4;
+	 }
+ }
+
+ post_test ();
+}
+
+typedef struct
+{
+ char *name;
+ unsigned char value;
+}
+Draw_Symbols_Type;
+
+static Draw_Symbols_Type Draw_Symbols =
+{
+ {"SLSMG_HLINE_CHAR",		SLSMG_HLINE_CHAR},
+ {"SLSMG_VLINE_CHAR",		SLSMG_VLINE_CHAR},
+ {"SLSMG_ULCORN_CHAR",		SLSMG_ULCORN_CHAR},
+ {"SLSMG_URCORN_CHAR",		SLSMG_URCORN_CHAR},
+ {"SLSMG_LLCORN_CHAR",		SLSMG_LLCORN_CHAR},
+ {"SLSMG_LRCORN_CHAR",		SLSMG_LRCORN_CHAR},
+ {"SLSMG_RTEE_CHAR",		SLSMG_RTEE_CHAR},
+ {"SLSMG_LTEE_CHAR",		SLSMG_LTEE_CHAR},
+ {"SLSMG_UTEE_CHAR",		SLSMG_UTEE_CHAR},
+ {"SLSMG_DTEE_CHAR",		SLSMG_DTEE_CHAR},
+ {"SLSMG_PLUS_CHAR",		SLSMG_PLUS_CHAR},
+ {"SLSMG_CKBRD_CHAR",		SLSMG_CKBRD_CHAR},
+ {"SLSMG_DIAMOND_CHAR",		SLSMG_DIAMOND_CHAR},
+ {"SLSMG_DEGREE_CHAR",		SLSMG_DEGREE_CHAR},
+ {"SLSMG_PLMINUS_CHAR",		SLSMG_PLMINUS_CHAR},
+ {"SLSMG_BULLET_CHAR",		SLSMG_BULLET_CHAR},
+ {"SLSMG_LARROW_CHAR",		SLSMG_LARROW_CHAR},
+ {"SLSMG_RARROW_CHAR",		SLSMG_RARROW_CHAR},
+ {"SLSMG_DARROW_CHAR",		SLSMG_DARROW_CHAR},
+ {"SLSMG_UARROW_CHAR",		SLSMG_UARROW_CHAR},
+ {"SLSMG_BOARD_CHAR",		SLSMG_BOARD_CHAR},
+ {"SLSMG_BLOCK_CHAR",		SLSMG_BLOCK_CHAR},
+ {NULL, 0}
+};
+
+static void draw_symbols_test (void)
+{
+ int row, col;
+ Draw_Symbols_Type *d;
+
+ pre_test ("Alternate Charset Test");
+
+ row = 3;
+ col = 3;
+ d = Draw_Symbols;
+ while (d->name != NULL)
+ {
+	SLsmg_gotorc (row, col);
+	SLsmg_set_char_set (1);
+	SLsmg_write_char (d->value);
+	SLsmg_set_char_set (0);
+	SLsmg_printf (":%s", d->name);
+	col += 40;
+	if (col >= 80)
+	 {
+	 col = 3;
+	 row++;
+	 }
+	d++;
+ }
+ post_test ();
+}
+
+static void line_test (void)
+{
+ int row, col;
+ pre_test ("Line Test");
+
+ row = 4;
+ col = 2;
+ SLsmg_gotorc (row, col);
+ SLsmg_draw_hline (10);
+ SLsmg_write_string ("Result of SLsmg_draw_hline(10)");
+ SLsmg_draw_vline (5);
+ SLsmg_write_string ("Result of SLsmg_draw_vline(5)");
+
+ post_test ();
+}
+
+static void do_esc_seq_test (char *testname)
+{
+ int row;
+ unsigned char ch;
+ unsigned char buf80, *b;
+
+ pre_test (testname);
+
+ while (1)
+ {
+	row = SLtt_Screen_Rows / 2;
+
+	SLsmg_gotorc (row, 0);
+	SLsmg_write_string ("Press key: (RETURN quits)");
+	SLsmg_refresh ();
+
+	ch = SLang_getkey ();
+	SLang_ungetkey (ch);
+	if (ch == '\r')
+	 break;
+
+	SLsmg_gotorc (row+1, 0);
+	SLsmg_write_string ("Key returned \"");
+
+	b = buf;
+	do
+	 {
+	 ch = SLang_getkey ();
+	 if (ch < ' ')
+	 {
+		 *b++ = '^';
+		 ch += '@';
+		 *b++ = ch;
+	 }
+	 else if (ch >= 127)
+	 {
+		 sprintf ((char *) b, "\\x%02X", ch);
+		 b += strlen ((char *) b);
+	 }
+	 else if ((ch == '"') || (ch == '\\'))
+	 {
+		 *b++ = '\\';
+		 *b++ = ch;
+	 }
+	 else *b++ = ch;
+	 }
+	while (SLang_input_pending (3) > 0);
+	*b++ = '"';
+	*b = 0;
+	SLsmg_write_string ((char *) buf);
+	SLsmg_erase_eol ();
+	SLsmg_refresh ();
+ }
+
+ post_test ();
+}
+
+static void esc_seq_test (void)
+{
+#ifdef IBMPC_SYSTEM
+ SLgetkey_map_to_ansi (0);
+#endif
+ do_esc_seq_test ("Escape Sequence Report");
+}
+
+#ifdef IBMPC_SYSTEM
+static void ansi_esc_seq_test (void)
+{
+ SLgetkey_map_to_ansi (1);
+ do_esc_seq_test ("ANSI Escape Sequence Report");
+}
+#endif
+
+static void mouse_test (void)
+{
+ int row;
+ int b, x, y;
+
+ pre_test ("Mouse Test");
+
+ row = SLtt_Screen_Rows / 2;
+
+ SLsmg_gotorc (row, 0);
+ SLsmg_write_string ("Click Mouse: ");
+ SLsmg_refresh ();
+
+ if ((27 != SLang_getkey ())
+ || ('' != SLang_getkey ())
+ || ('M' != SLang_getkey ()))
+ {
+	SLsmg_gotorc (row, 0);
+	SLsmg_write_string ("That did not appear to be a mouse escape sequence");
+	post_test ();
+	return;
+ }
+
+ b = SLang_getkey () - ' ';
+ x = SLang_getkey () - ' ';
+ y = SLang_getkey () - ' ';
+
+ SLsmg_gotorc (row, 0); SLsmg_printf ("Button: %d ", b);
+ SLsmg_gotorc (row + 1, 0); SLsmg_printf ("Column: %d", x);
+ SLsmg_gotorc (row + 2, 0); SLsmg_printf (" Row: %d", y);
+
+ post_test ();
+}
+
+static void mono_test_internal (int uac, char *msg)
+{
+ int row;
+ int c;
+
+ c = SLtt_Use_Ansi_Colors;
+ SLsmg_suspend_smg ();
+ SLtt_Use_Ansi_Colors = uac;
+ SLsmg_resume_smg ();
+
+ init_mono_colors ();
+
+ SLsmg_normal_video ();
+ SLsmg_cls ();
+
+ pre_test ("Mono Test");
+
+ row = 2;
+ SLsmg_gotorc (row, 0);
+ SLsmg_write_string (msg);
+
+ row = SLtt_Screen_Rows / 2;
+
+ SLsmg_gotorc (row, 0);
+ SLsmg_set_color (MONO_UNDERLINE_COLOR);
+ SLsmg_write_string ("This line should be completely underlined");
+ SLsmg_erase_eol ();
+
+ row++;
+ SLsmg_gotorc (row, 0);
+ SLsmg_set_color (MONO_REVVIDEO_COLOR);
+ SLsmg_write_string ("This line should be in reverse video");
+
+ row++;
+ SLsmg_gotorc (row, 0);
+ SLsmg_set_color (MONO_BOLD_COLOR);
+ SLsmg_write_string ("This line should appear in bold");
+
+ row++;
+ SLsmg_gotorc (row, 0);
+ SLsmg_set_color (MONO_BOLDULINE_COLOR);
+ SLsmg_write_string ("This line should appear underlined and in bold");
+
+ row++;
+ SLsmg_gotorc (row, 0);
+ SLsmg_set_color (MONO_REVULINE_COLOR);
+ SLsmg_write_string ("This line should appear completely underlined in reverse video");
+ SLsmg_erase_eol ();
+
+ SLsmg_refresh ();
+ SLsmg_set_color (0);
+ post_test ();
+ SLtt_Use_Ansi_Colors = c;
+ init_colors ();
+}
+
+static void mono_test (void)
+{
+ mono_test_internal (0, "This test uses SLtt_Use_Ansi_Colors=0, assuming a monochrome terminal");
+ mono_test_internal (1, "This test uses SLtt_Use_Ansi_Colors=1, assuming a color terminal");
+}
+
+static void mono_attr_test (void)
+{
+ int row;
+ int col;
+ int c, i;
+ int num_chars;
+#define NUM_MONO_COLORS 6
+ static int colors NUM_MONO_COLORS =
+ {
+	MONO_REVULINE_COLOR, MONO_BOLD_COLOR, MONO_REVVIDEO_COLOR,
+	MONO_BOLDULINE_COLOR, MONO_REVULINE_COLOR
+ };
+ pre_test ("Mono Attr Test");
+
+ init_mono_colors ();
+ c = 0, i = 0;
+ num_chars = NUM_MONO_COLORS;
+ col = 0;
+ do
+ {
+	SLsmg_set_color (0);
+	SLsmg_gotorc (2, 0); SLsmg_erase_eos ();
+	for (row = 2; row < SLtt_Screen_Rows - 2; row++)
+	 {
+	 col = col % SLtt_Screen_Cols;
+	 while (col < SLtt_Screen_Cols)
+	 {
+		 SLsmg_gotorc (row, col);
+		 c = c % NUM_MONO_COLORS;
+		 SLsmg_set_color (colorsc);
+		 SLsmg_write_char ('A' + i); col++;
+		 SLsmg_set_color (colorsrow % NUM_MONO_COLORS);
+		 SLsmg_write_string ("**********");
+		 col += 10;
+		 i = (i + 1) % num_chars;
+		 /* if (i == 0) col += 9; */
+		 c++;
+	 }
+	 col = 0;
+	 }
+	SLsmg_gotorc (0,0);
+	SLsmg_refresh ();
+ }
+ while (0 == SLang_input_pending (10));
+
+ init_colors ();
+ post_test ();
+}
+
+static void wrapped_string_test (void)
+{
+ int row, col;
+ unsigned int dr, dc;
+ char *str;
+
+ dc = 15;
+ dr = 10;
+ row = (SLtt_Screen_Rows - (int)dr)/2;
+ col = (SLtt_Screen_Cols - (int)dc)/2;
+
+ pre_test ("Wrapped-string test");
+
+ str = "This is a string that should be wrapped in a 12x15 cell.\n\
+It even contains a\n\
+couple of newline chacters\n\
+for fun.";
+
+ SLsmg_fill_region (row-1, col-1, dr+2, dc+2, '.');
+ SLsmg_draw_box (row-1, col-1, dr+2, dc+2);
+ SLsmg_write_wrapped_string ((SLuchar_Type *)str, row, col, dr, dc, 1);
+
+ post_test ();
+
+ if (SLutf8_is_utf8_mode ())
+ {
+	unsigned int len, i;
+	static char *long_strings2 =
+	 {
+	 "พระปกเกศกองบู๊กู้ขึ้นใหม่\
+สององค์ไซร้โง่เขลาเบาปัญญา\
+บ้านเมืองจึงวิปริตเป็นนักหนา\
+หมายจะฆ่ามดชั่วตัวสำคัญ\
+รับหมาป่าเข้ามาเลยอาสัญ\
+ใช้สาวนั้นเป็นชนวนชื่นชวนใจ\
+ฤๅหาใครค้ำชูกู้บร",
+	 "(CJK)を選択しる違いを知りたければ\
+を設|ctrls:\x01\x02\x84|定した状態とを選択した状態の両方で"
+	 };
+	static char *short_strings2 =
+	 {
+	 "รั\tบ\tหมาป่าเข้าม&#x1;า&#x2;เลยอาสัญ\xAB",
+	 "定し&#x1;た状&#x2;態\xAB"
+	 };
+
+	for (i = 0; i < 2; i++)
+	 {
+	 str = long_stringsi;
+
+	 pre_test ("Wrapped-string test (UTF-8)");
+	 SLsmg_fill_region (row-1, col-1, dr+2, dc+2, '.');
+	 SLsmg_draw_box (row-1, col-1, dr+2, dc+2);
+	 SLsmg_write_wrapped_string ((SLuchar_Type *)str, row, col, dr, dc, 1);
+	 post_test ();
+
+	 pre_test ("SLsmg_strwidth test (UTF-8)");
+	 col = 5;
+	 str = short_stringsi;
+	 SLsmg_cls ();
+	 SLsmg_gotorc (row, col);
+	 len = SLsmg_strwidth ((SLuchar_Type*)str, (SLuchar_Type*)str + strlen (str));
+	 SLsmg_write_string (str);
+	 SLsmg_gotorc (row+1, col+len);
+	 SLsmg_write_string ("^---End of above line should be here");
+	 post_test ();
+
+	 pre_test ("SLsmg_write_nstring test (UTF-8)");
+	 str = long_stringsi;
+	 SLsmg_gotorc (row+2, col);
+	 len = 15;
+	 SLsmg_write_nstring (str, len);
+	 SLsmg_write_string ("X");
+	 SLsmg_gotorc (row+3, col+len+1);
+	 SLsmg_write_string ("^---End of the line with an X should be here");
+	 post_test ();
+	 }
+ }
+}
+
+static void low_level_test (void)
+{
+ int mid, bot;
+ int r;
+
+ if (SLtt_Term_Cannot_Scroll)
+ {
+	pre_test ("Sorry! Your terminal lacks scrolling capability.");
+	post_test ();
+	return;
+ }
+
+ if (-1 == SLsmg_suspend_smg ())
+ SLang_exit_error ("SLsmg_suspend_smg failed");
+
+ if (-1 == SLtt_init_video ())
+ SLang_exit_error ("SLang_init_video failed");
+
+ SLtt_get_screen_size ();
+
+ mid = SLtt_Screen_Rows/2;
+ bot = SLtt_Screen_Rows - 1;
+
+ SLtt_cls ();
+ SLtt_goto_rc (0, 0);
+ SLtt_write_string ("The following set of tests are designed to test the display system.");
+ SLtt_goto_rc (1, 0);
+ SLtt_write_string ("There should be a line of text in the middle and one at the bottom.");
+ SLtt_goto_rc (mid, 0);
+ SLtt_write_string ("This line is in the middle.");
+ SLtt_goto_rc (bot, 0);
+ SLtt_write_string ("This line is at the bottom.");
+
+ SLtt_goto_rc (2, 0);
+ SLtt_write_string ("Press return now.");
+ SLtt_flush_output ();
+ SLang_flush_input ();
+ (void) SLang_getkey ();
+
+ SLtt_goto_rc (2, 0);
+ SLtt_write_string ("The middle row should slowly move down next the bottom and then back up.");
+ SLtt_goto_rc (mid - 1, 0);
+ SLtt_write_string ("This line should not move.");
+ SLtt_goto_rc (mid + 1, 0);
+ SLtt_write_string ("This line should vanish at the bottom");
+ SLtt_goto_rc (mid + 1, SLtt_Screen_Cols - 5);
+ SLtt_write_string ("End->");
+ SLtt_flush_output ();
+
+ SLtt_set_scroll_region (mid, bot - 1);
+
+ r = (bot - mid) - 1;
+ while (r > 0)
+ {
+	(void) SLang_input_pending (2); /* 3/10 sec delay */
+	SLtt_goto_rc (0,0);		 /* relative to scroll region */
+	SLtt_reverse_index (1);
+	SLtt_flush_output ();
+	r--;
+ }
+
+ r = (bot - mid) - 1;
+ while (r > 0)
+ {
+	(void) SLang_input_pending (2); /* 3/10 sec delay */
+	SLtt_goto_rc (0,0);		 /* relative to scroll region */
+	SLtt_delete_nlines (1);
+	SLtt_flush_output ();
+	r--;
+ }
+
+ SLtt_reset_scroll_region ();
+ SLtt_goto_rc (mid - 1, 0);
+ SLtt_write_string ("Now the bottom will come up and clear the lines below");
+
+ SLtt_set_scroll_region (mid, bot);
+ r = (bot - mid) + 1;
+ while (r > 0)
+ {
+	(void) SLang_input_pending (2); /* 3/10 sec delay */
+	SLtt_goto_rc (0,0);		 /* relative to scroll region */
+	SLtt_delete_nlines (1);
+	SLtt_flush_output ();
+	r--;
+ }
+
+ SLtt_reset_scroll_region ();
+ SLtt_goto_rc (3,0);
+ SLtt_write_string ("This line will go down and vanish");
+ SLtt_set_scroll_region (3, mid - 2);
+
+ r = ((mid - 2) - 3) + 1;
+ while (r > 0)
+ {
+	(void) SLang_input_pending (3); /* 3/10 sec delay */
+	SLtt_goto_rc (0,0);		 /* relative to scroll region */
+	SLtt_reverse_index (1);
+	SLtt_flush_output ();
+	r--;
+ }
+
+ SLtt_reset_scroll_region ();
+ SLtt_set_scroll_region (1,1); SLtt_goto_rc (0,0);
+ SLtt_delete_nlines (1);
+ SLtt_reset_scroll_region ();
+ SLtt_set_scroll_region (2,2); SLtt_goto_rc (0,0);
+ SLtt_reverse_index (1);
+ SLtt_reset_scroll_region ();
+
+ SLtt_goto_rc (1, 10);
+ SLtt_write_string ("Press Any Key To Continue.");
+ SLtt_flush_output ();
+ r = 15;
+ if (0 == SLtt_Term_Cannot_Insert) while (r)
+ {
+	r--;
+	SLtt_goto_rc (1, 0);
+	SLtt_begin_insert ();
+	SLtt_putchar (' ');
+	SLtt_end_insert ();
+	SLtt_flush_output ();
+	SLang_input_pending (2);
+ }
+
+ SLang_flush_input ();
+ (void) SLang_getkey ();
+
+ SLtt_reset_video ();
+ SLsmg_resume_smg ();
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/demo/useropen.c Added

@@ -0,0 +1,116 @@
+/* This demo indicates how to read and parse a S-Lang file by bypassing the
+ * built-in routines.
+ */
+#include "config.h"
+#include <stdio.h>
+#include <string.h>
+#ifdef HAVE_STDLIB_H
+# include <stdlib.h>
+#endif
+#include <slang.h>
+
+/* Suppose that you want to read input using a read line package
+ * such as one provided by S-Lang. For generality, lets assume that this
+ * function is called 'readline' and it is prototyped as:
+ * int readline (char *prompt, char *buffer);
+ * where it returns the number of characters read and -1 if end of file. The
+ * first parameter is a prompt and the second represents the buffer where the
+ * characters are to placed. Also assume that this routine requires that the
+ * function 'init_readline' be called first before it can be used and
+ * 'reset_readline' must be called after using it.
+ *
+ * The goal here is to get S-Lang to call the readline function.
+ */
+
+/* For the purposes of this demo, we will use just fgets */
+#define MAX_BUF_LEN	256
+static int readline (char *prompt, char *buf)
+{
+ fputs (prompt, stdout); fflush (stdout);
+ if (NULL == fgets (buf, MAX_BUF_LEN, stdin)) return -1;
+ return (int) strlen (buf);
+}
+
+static int init_readline (void)
+{
+ puts ("Initializing readline."); fflush (stdout);
+ return 0;
+}
+
+static void reset_readline (void)
+{
+ puts ("Resetting readline."); fflush (stdout);
+}
+
+/* Now lets define the function that S-Lang will use to actually read the data.
+ * It calls readline. S-Lang will call this function and the function must
+ * return a pointer to the buffer containg the characters of the line or NULL
+ * upon end of file. In many ways, it is like fgets except that it is passed
+ * a pointer to SLang_Load_Type in stead of FILE.
+ */
+
+typedef struct
+{
+ char bufMAX_BUF_LEN;
+ char *prompt;
+}
+Our_Client_Data_Type;
+
+static char *read_using_readline (SLang_Load_Type *x)
+{
+ Our_Client_Data_Type *client_data;
+
+ client_data = (Our_Client_Data_Type *) x->client_data;
+ if (-1 == readline (client_data->prompt, client_data->buf))
+ return NULL;
+
+ return client_data->buf;
+}
+
+/* Now, we all of this is tied together in this routine which will be called
+ * from main below.
+ */
+
+static int read_input (void)
+{
+ SLang_Load_Type *x;
+ Our_Client_Data_Type client_data;
+
+ if (NULL == (x = SLallocate_load_type ("<readline>")))
+ return -1;
+
+ client_data.prompt = "Demo> ";
+
+ x->client_data = (VOID_STAR) &client_data;
+ x->read = read_using_readline; /* function to call to perform the read */
+ SLang_load_object (x);
+ return 0;
+}
+
+/* Now here is are some intrinsic functions */
+
+int main (int argc, char **argv)
+{
+ /* usual stuff */
+
+ (void) argc; (void) argv;
+
+ if ((-1 == SLang_init_slang ()) /* basic interpreter functions */
+ || (-1 == SLang_init_slmath ()) 	 /* sin, cos, etc... */
+#ifdef unix
+ || (-1 == SLang_init_slunix ())	 /* unix system calls */
+#endif
+ || (-1 == SLang_init_slfile ()))	 /* file i/o */
+ {
+	fprintf(stderr, "Unable to initialize S-Lang.\n");
+	return 1;
+ }
+
+ init_readline ();
+
+ read_input ();
+
+ reset_readline ();
+ return SLang_get_error ();
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc Added

_service:tar_scm:slang-2.3.2.tar.bz2/doc/OLD Added

_service:tar_scm:slang-2.3.2.tar.bz2/doc/OLD/help Added

_service:tar_scm:slang-2.3.2.tar.bz2/doc/OLD/help/README Added

_service:tar_scm:slang-2.3.2.tar.bz2/doc/OLD/help/makefile.djg Added

_service:tar_scm:slang-2.3.2.tar.bz2/doc/OLD/help/makefile.os2 Added

@@ -0,0 +1,70 @@
+#================ JED makefile for DMAKE 3.8 ======================
+# This makefile is for DMAKE, either under DOS or OS/2
+# The following OS/Compiler combinations are supported:
+#
+# Target       Compiler    Command                Compiler
+# Operating    Mnemoic     Line
+# System                   
+#-----------------------------------------------------------------------
+# OS2            MSC       OS=OS2 COMP=MSC        Microsoft C
+# OS2            EMX       OS=OS2 COMP=EMX        emx/gcc
+#-----------------------------------------------------------------------
+MODEL = L
+#-----------------------------------------------------------------------
+# default setup for EMX under OS/2, optimized version
+# change values below or override with -e switch on command line
+#-----------------------------------------------------------------------
+OS=OS2
+COMP=EMX
+OPT=Y
+#-----------------------------------------------------------------------
+.IF $(TOS) == $(NULL)
+    TOS = $(OS)
+.END
+.IF $(OS) == OS2
+#========================================================================
+#========================= OS2 - MSC ====================================
+#========================================================================
+    .IF $(COMP) == MSC
+        CC        = cl -nologo -MT
+        LIB_CMD   = lib
+        .IF $(OPT) == N
+            CDBUG = -Od -Zi -W2
+            LDEBUG = -Zi
+        .ELSE
+            CDBUG = 
+            LDEBUG =
+        .END
+	CDEBUG = $(CDBUG)
+        O = .obj
+	LFLAGS2 = setargv.obj $(SLANG).lib $(SLIB)os2sl16.def -link /NOE $(SLIB)
+#========================================================================
+#========================= OS2 - EMX ====================================
+#========================================================================
+    .ELIF $(COMP) == EMX
+        CC        = gcc -Zmtd
+        .IF $(OPT) == N
+            CDEBUG =-g
+            LDEBUG =
+        .ELSE
+            CDEBUG = -O
+            LDEBUG = 
+        .END
+	O = .o
+	LFLAGS2 = $(SLIB)os2sl.def -L$(SLIB) -l$(SLANG)
+    .ENDIF
+.ENDIF
+
+CFLAGS=$(CDEBUG) -I$(SLIB) -DHAS_MEMSET
+LFLAGS = $(LDEBUG)
+
+SLIB = ..\src\\
+SLANG = slang
+
+.c$O:
+	$(CC) -c $(CFLAGS) $*.c
+
+slhelp : slhelp.exe
+
+slhelp.exe: slhelp$O
+	$(CC) $(LFLAGS) -o $@ slhelp$O $(LFLAGS2)

_service:tar_scm:slang-2.3.2.tar.bz2/doc/OLD/help/makefile.unx Added

_service:tar_scm:slang-2.3.2.tar.bz2/doc/OLD/help/slang.hlp Added

@@ -0,0 +1,241 @@
+Help file for slang
+
+1 Interpreter
+  See readme files for information--- no help file yet.
+1 Keyboard-Interface
+  SLang's keyboard interface is designed to allow one to read a character
+  at a time in a system independent manner.  To initialize the interface,
+  one must first call the function `SLang_init_tty'.  Before exiting the
+  program, the function `SLang_reset_tty' must be called to restore the
+  keyboard interface to its original state.  This is particularly true for
+  MSDOS since INT-9 is hooked by S-Lang.
+ 
+2 Functions
+  
+3 init_tty
+
+  Prototype: int SLang_init_tty (int abort_char, int flow_ctrl, int opost);
+
+  This function must be called to initialize the tty for single character
+  input.  The first parameter `abort_char' must lie in the range 0-255 and
+  is used as an abort character.  By default, pressing this character sets
+  the global variable `SLang_Error' to USER_BREAK.  See help on the function 
+  `SLang_set_abort_signal' to change the default action.
+
+  If the second parameter `flow_ctrl' is non-zero, flow control is enabled.
+
+  If the third parmeter `opost' is zero, output processing is NOT turned on.
+  A value of zero is required for SLang's screen management routines (SLsmg)
+  to work properly. 
+
+  This function returns 0 upon success. In addition, if the global variable
+  SLang_TT_Baud_Rate == 0 when this function is called, SLang will attempt
+  to determine the terminals baud rate and set this variable accordingly. As
+  far as the SLang library is concerned, if SLang_TT_Baud_Rate is less than
+  or equal to zero, the baud rate is effectively infinite.
+
+3 reset_tty
+
+   Prototype:  void SLang_reset_tty (void);
+   
+   This function must be called to reset the tty to the state the terminal
+   was in before a previous call to `SLang_init_tty'.
+
+3 getkey
+
+  Prototype: unsigned int SLang_getkey (void);
+
+  This function returns a single key from the tty.  If the read fails,
+  0xFFFF is returned.  Before attempting to use this function, one myust
+  first call SLang_init_tty to initialize the terminal.
+  
+  If the abort character is pressed while this function is called, it will
+  return the value of the abort character.  In addition, the global variable
+  SLKeyBoard_Quit will be set and SLang_Error will will be set to USER_BREAK
+  unless the variable SLang_Ignore_User_Abort is non-zero.
+
+3 unget_keystring
+
+  Prototype: void SLang_ungetkey_string (unsigned char *buf, int buflen);
+
+3 buffer_keystring
+
+  Prototype: void SLang_buffer_keystring (unsigned char *buf, int buflen);
+
+3 ungetkey
+
+  Prototype: void SLang_ungetkey (unsigned char ch);
+  
+3 flush_input  
+
+  Prototype: void SLang_flush_input (void);
+  
+3 input_pending  
+
+  Prototype int SLang_input_pending (int tsecs);
+  
+3 set_abort_signal
+ 
+  Prototype: void SLang_set_abort_signal (void (*f)(int));
+  
+  If SIGINT is generated, the function p1 will be called.  If `f' is NULL
+  the SLang default signal handler is called.  This sets SLang_Error to 
+  USER_BREAK.  I suspect most users will simply want to pass NULL.
+  
+2 Variables
+3 Abort_Char
+
+  int SLang_Abort_Char;
+  The value of the character (0-255) used to trigger SIGINT
+  
+3 Ignore_User_Abort
+
+  int SLang_Ignore_User_Abort;
+  If non-zero, pressing the abort character will not result in USER_BREAK
+  SLang_Error.
+ 
+3 KeyBoard_Quit
+
+  volatile int SLKeyBoard_Quit
+
+3 TT_Baud_Rate
+
+  int SLang_TT_Baud_Rate;
+  
+  If this value is zero before SLang_init_tty is called, after the call, it
+  will be set to the baud rate if the terminal on systems which support it.
+
+1Screen_Management
+ S-Lang's screen management routines are located in the slsmg.c file.  All
+ exported functions and variables are prefixed by `SLsmg', e.g., `SLsmg_cls'.
+ The screen management code uses the `SLtt' routines for writing output to
+ the terminal.
+
+ To initialize the screen management system, call `SLtt_get_terminfo' first
+ to initialize the display system. Then call `SLsmg_init_smg' to initialize
+ the SLsmg routines.  If you are going to read characters from the keyboard,
+ it is also a good idea to initialize the tty at this point via the
+ SLang_init_tty function (See `Keyboard'). 
+
+ Before exiting the program, call the approriate routines to reset the
+ terminal and display system.  Basically, your program will look like
+ something like:
+\begin{verbatim}
+ #include "slang.h"
+ 
+ int main ()
+ {
+    SLtt_get_terminfo ();
+    SLang_init_tty (7, 0, 0);
+    SLsmg_init_smg ();
+    
+    /* do stuff .... */
+    
+    SLsmg_reset_smg ();
+    SLang_reset_tty ();
+    return 0;
+ }
+\end{verbatim}
+
+2Functions
+3erase_eol
+ Prototype: void SLsmg_erase_eol (void);
+ Erase line from current position to the end of the line.
+3gotorc
+ Prototype: void SLsmg_gotorc (int row, int col);
+ Move cursor position to ('row', 'col').  (0,0) corresponds to the top left
+ corner of the screen.
+3erase_eos
+ Prototype: void SLsmg_erase_eos (void);
+ Erase fro the current position to the end of the screen.
+3reverse_video
+ Prototype: void SLsmg_reverse_video (void);
+ Start writing characters in reverse video.
+3set_color
+ Prototype: void SLsmg_set_color (int obj);
+ Set the character attributes to those of 'obj'.
+3normal_video
+ Prototype: void SLsmg_normal_video (void);
+ Turn off characters attributes and set attributes to object 0.
+3printf
+ Prototype: void SLsmg_printf (char *, ...);
+ Write a formatted string to the virtual display.
+3vprintf
+ Prototype: void SLsmg_vprintf (char *, va_list);
+ Like 'SLsmg_printf' but uses a variable argument list.
+3write_string
+ Prototype: void SLsmg_write_string (char *);
+3write_char
+ Prototype: void SLsmg_write_char (char);
+3write_nchars
+ Prototype: void SLsmg_write_nchars (char *, int);
+3cls
+ Prototype: void SLsmg_cls (void);
+ Clear the screen
+3refresh
+ Prototype: void SLsmg_refresh (void);
+ Make the physical display look like the virtual display.
+3touch_lines
+ Prototype: void SLsmg_touch_lines (int row, int n);
+ Mark screen rows 'row', 'row + 1', ... 'row + (n - 1)' as modified.
+3init_smg
+ Prototype: int SLsmg_init_smg (void);
+ Must be called before any of the other routines will work.
+3reset_smg
+ Prototype: void SLsmg_reset_smg (void);
+3char_at
+ unsigned short SLsmg_char_at(void);
+ Prototype: unsigned short SLsmg_char_at(void);
+ Returns the character and its attributes object number at the current
+ cursor position.
+2Variables
+ SLsmg_Tab_Width (Default is 8).
+
+1Searching-Functions
+ The S-Lang library incorporates two types of searches: Regular expression
+ pattern matching and ordinary searching.
+2Regular-Expressions
+
+             !!! No documentation available yet !!!
+
+2Simple-Searches
+ The routines for ordinary searching are defined in the `slsearch.c' file.
+ To use these routines, simply include "slang.h" in your program and simply
+ call the appropriate routines.
+ 
+ The searches can go in either a forward or backward direction and can
+ either be case or case insensitive.  The region that is searched may
+ contain null characters (ASCII 0) however, the search string cannot in the
+ current implementation.  In addition the length of the string to be found
+ is currently limited to 256 characters.
+ 
+ Before searching, the function `SLsearch_init' must first be called to
+ ``preprocess'' the search string.
+3initialization
+ The function `SLsearch_init' must be called before a search can take place.
+ Its prototype is:
+ 
+    int SLsearch_init (char *key, int dir, int case_sens, SLsearch_Type *st);
+    
+ Here `key' is the string to be searched for.  `dir' specifies the direction
+ of the search: a value greater than zero is used for searching forward and
+ a value less than zero is used for searching backward.  The parameter
+ `case_sens' specifies whether the search is case sensitive or not.  A
+ non-zero value indicates that case is important.  `st' is a pointer to a
+ structure of type `SLsearch_Type' defined in "slang.h".  This structure is
+ initialized by this routine and must be passed to `SLsearch' when the
+ search is actually performed.
+ 
+ This routine returns the length of the string to be searched for.
+
+3SLsearch
+ Prototype: unsigned char *SLsearch (unsigned char *pmin, unsigned char *pmax, 
+                                     SLsearch_Type *st);
+				     
+ This function performs the search defined by a previous call to
+ `SLsearch_init'  over a region specified by the pointers `pmin' and `pmax'.
+ 
+ It returns a pointer to the start of the match if successful or it will
+ return NULL if a match was not found.
+  
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/OLD/help/slhelp.c Added

@@ -0,0 +1,587 @@
+#include "config.h"
+
+#include <stdio.h>
+
+#ifdef unix
+# include <signal.h>
+#endif
+
+#include "slang.h"
+#include "jdmacros.h"
+
+#ifndef HELP_DIR
+#define HELP_DIR ""
+#endif
+
+#ifndef SEEK_SET
+#define SEEK_SET 0
+#endif
+
+
+typedef struct SLhlp_Node_Type
+{
+ char *name;
+ struct SLhlp_Node_Type *child;
+ struct SLhlp_Node_Type *sister;
+ unsigned long pos;
+} SLhlp_Node_Type;
+
+typedef struct
+{
+ FILE *fp;
+ SLhlp_Node_Type *root;
+ SLhlp_Node_Type *sub;	 /* current subtopic node */
+ SLhlp_Node_Type *now;	 /* Node we are currently reading from */
+ SLhlp_Node_Type *path10;	 /* path to current node */
+ int level;
+} SLhlp_File_Type;
+
+#define MAX_HELP_FILES 10
+
+SLhlp_File_Type Help_FilesMAX_HELP_FILES;
+
+
+static int add_level (int level, int fd, char *name, unsigned long pos)
+{
+ SLhlp_Node_Type *node, *parent, *new_node;
+ int len;
+ 
+ while (*name == ' ') name++;
+ len = strlen(name);
+ 
+ if (len) while (namelen - 1 == ' ') len--;
+ if (len == 0) return -1;
+ namelen = 0;
+ 
+ parent = node = Help_Filesfd.root;
+ while (level-- > 0)
+ {
+	if (node == NULL)
+	 {
+	 return -1;
+	 }
+	while (node->sister != NULL) node = node->sister;
+	parent = node;
+	node = node->child;
+ }
+ 
+ 
+ if ((NULL == (new_node = (SLhlp_Node_Type *) SLMALLOC (sizeof (SLhlp_Node_Type))))
+ || (NULL == (new_node->name = (char *) SLMALLOC (len + 1))))
+ {
+	SLang_Error = SL_MALLOC_ERROR;
+	return -1;
+ }
+ 
+ new_node->sister = NULL;
+ new_node->child = NULL;
+ new_node->pos = pos;
+ strcpy (new_node->name, name);
+ 
+ if (node == NULL)
+ {
+	if (parent == NULL) 
+	 {
+	 Help_Filesfd.root = new_node;
+	 }
+	else parent->child = new_node;
+ }
+ else
+ {
+	while (node->sister != NULL) node = node->sister;
+	node->sister = new_node;
+ }
+ return 0;
+}
+
+
+static void free_nodes (SLhlp_Node_Type *node)
+{
+ if (node->child != NULL) free_nodes (node->child);
+ if (node->sister != NULL) free_nodes (node->sister);
+ if (node->name != NULL) SLFREE (node->name);
+ SLFREE (node);
+}
+
+
+
+static int check_fd (int fd)
+{
+ if (((fd >= MAX_HELP_FILES) || (fd < 0)) || (Help_Filesfd.fp == NULL))
+ {
+	if (SLang_Error == 0) SLang_Error = INTRINSIC_ERROR;
+	return 0;
+ }
+ return 1;
+}
+
+
+static void SLhlp_close_help (int fd)
+{
+ if (!check_fd (fd)) return;
+ fclose (Help_Filesfd.fp); Help_Filesfd.fp = NULL;
+ if (Help_Filesfd.root != NULL) free_nodes (Help_Filesfd.root);
+}
+
+
+static int SLhlp_open_help (char *file)
+{ 
+ int fd = 0, ch;
+ FILE *fp;
+ int level;
+ char topic256, *b;
+ unsigned long pos;
+ 
+ while ((fd < MAX_HELP_FILES) && (Help_Filesfd.fp != NULL))
+ fd++;
+ 
+ if (fd == MAX_HELP_FILES) return -1;
+ if (NULL == (Help_Filesfd.fp = fp = fopen (file, "r"))) return -1;
+ 
+ 
+ while (1)
+ {
+	ch = getc (fp);
+	
+	bypass_getc:
+	
+	if ((ch > '9') || (ch == ' ')) continue;
+	if (ch == '\n')
+	 {
+	 ch = getc (fp);
+	 if ((ch == ' ') || (ch > '9')) continue;
+	 if (ch >= '1')
+	 {
+		 level = ch - '1';
+		 pos = ftell (fp);
+		 b = topic;
+		 while (('\n' != (ch = getc (fp))) && (ch != EOF))
+		 {
+		 *b++ = ch;
+		 }
+		 *b = 0;
+		 if (add_level (level, fd, topic, pos)) goto error;
+	 }
+	 goto bypass_getc;
+	 }
+	if (ch == EOF) break;
+ }
+
+ Help_Filesfd.now = NULL;
+ Help_Filesfd.sub = Help_Filesfd.root;
+ Help_Filesfd.path0 = NULL;
+ 
+ return fd;
+
+ 
+ error:
+ SLhlp_close_help (fd);
+ return -1;
+}
+
+static char *SLhlp_get_subtopic (int fd)
+{
+ SLhlp_Node_Type *node;
+ 
+ if (!check_fd(fd)) return NULL;
+ if ((node = Help_Filesfd.sub) == NULL) return NULL;
+ 
+ Help_Filesfd.sub = node->sister;
+ return node->name;
+}
+ 
+
+static char *SLhlp_gets (int fd, char *buf)
+{
+ SLhlp_Node_Type *node;
+ char ch;
+ 
+ 
+ if (!check_fd(fd)) return NULL;
+ 
+ node = Help_Filesfd.now;
+ if (node == NULL) return NULL;
+
+ if ((NULL == fgets(buf, 255, Help_Filesfd.fp))
+ || ((*buf <= '9') && (*buf >= '0')))
+ {
+	if ((node->child == NULL) && Help_Filesfd.level)
+	 {
+	 Help_Filesfd.level--;
+	 }
+	Help_Filesfd.now = NULL;
+	return NULL;
+ }
+ 
+ /* First character is reserved. */
+ if (*buf > ' ')
+ {
+	ch = *buf | 0x20;
+	if ((ch < 'a') || (ch > 'z'))
+	 {
+	 *buf = '\n';
+	 *(buf + 1) = 0;
+	 }
+ }
+ 
+ return buf;
+}
+
+static int my_strncasecmp (char *a, char *b, int n)
+{
+ register char cha, chb;
+ 
+ while (n--)
+ {
+	cha = *a++;
+	chb = *b++;
+	if (cha != 0) 
+	 {
+	 if ((cha == chb)
+		 || ((cha | 0x20) == (chb | 0x20))) continue;
+	 }
+	return cha - chb;
+ }
+ return 0;
+}
+
+
+
+static int SLhlp_select_topic (int fd, char *topic)
+{
+ char topic_buf256;
+ char *t, ch;
+ int level = 0;
+ int len;
+ 
+ SLhlp_Node_Type *node, *parent;
+ 
+ if (!check_fd (fd)) return -1;
+
+ parent = node = Help_Filesfd.root;
+
+ ch = 0;
+ if (topic != NULL) 
+ while (((ch = *topic) <= ' ') && ch) topic++;
+ 
+ if (ch != 0) while (node != NULL)
+ {
+	parent = node;
+	t = topic_buf;
+	
+	while ((ch = *topic) > ' ')
+	 {
+	 *t++ = ch;
+	 topic++;
+	 }
+	while (((ch = *topic) <= ' ') && ch) topic++;
+	*t = 0;
+	
+	len = strlen (topic_buf);
+	
+ 
+	if (len) while (my_strncasecmp (node->name, topic_buf, len))
+	 {
+	 node = node->sister;
+	 if (node == NULL) break;
+	 }
+	
+	if (node == NULL) break;
+	Help_Filesfd.pathlevel++ = node;
+	if ((ch == 0) || (ch == '\n')) break;
+	node = node -> child;
+ }
+
+ /* level comes out at 1 greater than last valid one */
+ Help_Filesfd.level = level;
+ 
+ if (node != NULL)		 /* success */
+ {
+	Help_Filesfd.sub = node->child;
+	Help_Filesfd.now = node;
+	fseek (Help_Filesfd.fp, node->pos, SEEK_SET);
+	return 0;
+ }
+ else				 /* failure */
+ {
+	Help_Filesfd.now = NULL;
+	Help_Filesfd.sub = parent;
+	return -1;
+ }
+}
+
+static int SLhlp_what_topic (int fd, char *buf)
+{
+ int level, i;
+ char *b;
+ if (!check_fd(fd)) return -1;
+ 
+ level = Help_Filesfd.level;
+ *buf = 0;
+ if (level == 0) return 0;
+ 
+ b = buf;
+ for (i = 0; i < level; i++)
+ {
+	strcpy (b, Help_Filesfd.pathi->name);
+	b = b + strlen (b);
+	*b++ = ' ';
+ }
+ *(b - 1) = 0;
+ return level;
+}
+
+static int SLhlp_up_topic (int fd)
+{
+ if (!check_fd(fd)) return -1;
+ 
+ if (Help_Filesfd.level) Help_Filesfd.level--;
+ return 0;
+}
+
+
+
+
+/* --------------------------------------------------------------------- */
+
+static void cls (void)
+{
+ SLtt_cls ();
+ SLtt_flush_output ();
+}
+
+
+static void newline (int nl, int reset, int cls_flag)
+{
+ static int n;
+ 
+ if (nl) putc('\n', stdout);
+ n++;
+ 
+ if (n == SLtt_Screen_Rows - 1)
+ {
+	SLtt_reverse_video (1);
+	SLtt_write_string ("---Press RETURN to continue.---");
+	SLtt_normal_video ();
+	SLtt_flush_output ();
+	
+	SLang_getkey ();
+	if (cls_flag) cls ();
+	else
+	 fputs("\r \r", stdout);
+
+	cls_flag = 0;
+	n = 0;
+ }
+
+ if (reset) 
+ {
+	n = 0;
+	if (cls_flag) cls ();
+	return;
+ }
+}
+
+SLang_RLine_Info_Type *Help_Rli;
+
+static SLang_RLine_Info_Type *init_readline (void)
+{
+ unsigned char *buf = NULL;
+ SLang_RLine_Info_Type *rli;
+ 
+ if ((NULL == (rli = (SLang_RLine_Info_Type *) SLMALLOC (sizeof(SLang_RLine_Info_Type))))
+ || (NULL == (buf = (unsigned char *) SLMALLOC (256))))
+ {
+	fprintf(stderr, "malloc error.\n");
+	exit(-1);
+ }
+ 
+ SLMEMSET ((char *) rli, 0, sizeof (SLang_RLine_Info_Type));
+ rli->buf = buf;
+ rli->buf_len = 255;
+ rli->tab = 8;
+ rli->dhscroll = 20;
+ rli->getkey = SLang_getkey;
+ rli->tt_goto_column = NULL;
+ rli->update_hook = NULL;
+ 
+ if (SLang_init_readline (rli) < 0)
+ {
+	fprintf(stderr, "Unable to initialize readline library.\n");
+	exit (-1);
+ }
+ 
+ return rli;
+}
+
+static char *hlp_get_input (char *prompt)
+{
+ int i;
+ 
+ if (Help_Rli == NULL) 
+ {
+	Help_Rli = init_readline ();
+	Help_Rli->update_hook = NULL;
+ }
+ 
+ Help_Rli->edit_width = SLtt_Screen_Cols - 1;
+ Help_Rli->prompt = prompt;
+ *Help_Rli->buf = 0;
+ 
+ 
+ i = SLang_read_line (Help_Rli);
+ 
+ if ((i >= 0) && !SLang_Error && !SLKeyBoard_Quit)
+ {
+	SLang_rline_save_line (Help_Rli);
+ }
+ else return NULL;
+ 
+ return (char *) Help_Rli->buf;
+}
+
+	
+static void do_subtopics (int fd)
+{
+ char *s;
+ int len, dlen;
+ 
+ if ((s = SLhlp_get_subtopic (fd)) != NULL)
+ {
+	len = 0;
+	newline (1, 0, 0);
+	fprintf(stdout, "Available Topics/Subtopics:");
+	newline (1, 0, 0);
+	newline (1, 0, 0);
+	do
+	 {
+	 dlen = strlen (s);
+	 len += dlen;
+	 
+	 if (len >= 80)
+	 {
+		 len = dlen;
+		 newline (1, 0, 0);
+	 }
+	 fputs(s, stdout);
+	 dlen = 21 - len % 20;
+	 len += dlen;
+	 if (len < 80)
+	 {
+		 while (dlen--) putc(' ', stdout);
+	 }
+	 }
+	while (NULL != (s = SLhlp_get_subtopic(fd)));
+	newline (1, 0, 0);
+ }
+}
+
+static void get_screen_size (int sig)
+{
+ SLtt_get_screen_size ();
+#ifdef SIGWINCH
+ signal (SIGWINCH, get_screen_size);
+#endif
+}
+
+
+ 
+int main (int argc, char **argv)
+{
+ char *buf, *file;
+ char buffer256;
+ static int fd = -1;
+ int len;
+ 
+ if (argc != 2)
+ {
+	fprintf(stderr, "Usage: slhelp HELP-FILE\n");
+	exit (-1);
+ }
+ 
+ file = argv1;
+ if (fd < 0) fd = SLhlp_open_help (file);
+ if (fd < 0) 
+ {
+	fprintf (stderr, "Unable to open help file %s\n", file);
+	exit (-1);
+ }
+ 
+ SLang_init_tty (7, 1, 1);
+ SLtt_get_terminfo ();
+ SLtt_init_video ();
+ SLtt_Use_Ansi_Colors = 0;
+ 
+#ifdef SIGWINCH
+ signal (SIGWINCH, get_screen_size);
+#endif
+ 
+ get_screen_size (0);
+ cls ();
+
+ fputs ("\n\nSimply press RETURN at the 'Topic>' prompt to quit help.\n\n",
+	 stdout);
+
+ if (SLhlp_what_topic (fd, buffer) > 0)
+ {
+	SLhlp_select_topic (fd, buffer);
+ }
+ 
+ while (1)
+ {
+	while (1)
+	 {
+	 if (SLhlp_what_topic (fd, buffer) <= 0)
+	 {
+		 SLhlp_select_topic (fd, "?");
+		 *buffer = 0;
+	 }
+	 do_subtopics (fd);
+	 
+	 len = strlen (buffer);
+	 if (len) strcat (buffer, " Subtopic> ");
+	 else strcpy (buffer, "Topic> ");
+	 newline (1, 1, 0);
+	 
+	 if (NULL == (buf = hlp_get_input (buffer)))
+	 {
+		 SLang_Error = 0;
+		 if (SLKeyBoard_Quit) 
+		 {
+		 SLKeyBoard_Quit = 0;
+		 continue;
+		 }
+		 goto the_return;
+	 }
+	 
+	 if ((*buf == '\n') || (*buf == 0))
+	 {
+		 if (len == 0) goto the_return;
+		 SLhlp_up_topic (fd);
+		 continue;
+	 }
+	 
+	 bufferlen = ' ';	 /* kill prompt */
+	 strcpy (buffer + (len + 1), buf);
+	 break;
+	 }
+	
+	newline (1, 1, 1);
+	if (-1 == SLhlp_select_topic (fd, buffer))
+	 {
+	 fprintf(stdout, "No help available on: %s", buf);
+	 newline (1, 0, 0);
+	 }
+	else while (NULL != SLhlp_gets (fd, buffer))
+	 {
+	 fputs(buffer, stdout);
+	 newline (0, 0, 1);
+	 }
+ }
+ 
+ the_return:
+ 
+ SLtt_reset_video ();
+ SLang_reset_tty ();
+ return 0;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/doc/README Added

@@ -0,0 +1,25 @@
+The documentation here is provided in text format. Documentation in
+SGML, HTML, TeX, and postscript formats are also available from
+<ftp://space.mit.edu/pub/davis/slang/v2.0/slang-doc.tar.gz> as well as the
+mirror sites. In addition, the documentation is available on-line from
+<http://www.jedsoft.org/slang/docs.html>.
+
+The text subdirectory contains:
+
+ text/slang.txt Documentation describing the slang language
+ text/cslang.txt C programmer's guide to the library
+ text/cref.txt Reference Manual for the C functions
+ text/slangfun.txt Reference Manual for the slang intrinsic functions
+
+There may be additional subdirectories:
+
+ tm/ Text-Macro source for documentation
+ html/ Documentation in HTML form
+ text/ Documentation in text form
+ ps/ Documentation in postscript (from LaTeX)
+ pdf/ Documentation in postscript (from pdflatex)
+
+The documentation was created by linuxdoc-tools from an SGML format,
+which itself was created from text-macro source. The LaTeX2e output
+produced by linuxdoc-tools needed some additional tweaking by the
+script tm/fixtex.sl.

_service:tar_scm:slang-2.3.2.tar.bz2/doc/grammar.txt Added

@@ -0,0 +1,125 @@
+This grammar was derived from slparse.c --- it is out-dated.
+
+statement:
+	 compound-statement
+	 if ( expression ) statement
+	 if ( expression ) statement else statement
+	 !if ( expression ) statement
+	 loop ( expression ) statement
+	 _for ( expression ) statement
+	 while ( expression ) statement
+	 do statement while (expression) ;
+	 for ( expressionopt ; expressionopt ; expressionopt ) statement
+	 ERROR_BLOCK statement
+	 EXIT_BLOCK statement
+	 USER_BLOCK0 statement
+	 USER_BLOCK1 statement
+	 USER_BLOCK2 statement
+	 USER_BLOCK3 statement
+	 USER_BLOCK4 statement
+	 forever statement
+	 break ;
+	 continue ;
+	 return expressionopt ;
+	 variable variable-list ;
+	 struct struct-decl ;
+	 define identifier function-args ;
+	 define identifier function-args compound-statement
+	 switch ( expression ) statement
+	 rpn-line
+	 at-line
+	 push ( expression )
+	 ( expression ) = expression ;
+	 expression ;
+	 expression :
+
+statement-list:
+	 statement
+	 statement-list statement
+
+compound-statement:
+	 { statement-list }
+
+variable-list:
+	variable-decl
+	variable-decl variable-list
+
+variable-decl:
+	identifier
+	identifier = simple-expression
+
+struct-declaration:
+	struct { struct-field-list };
+
+struct-field-list:
+	struct-field-name , struct-field-list
+	struct-field-name
+
+struct-declaration:
+	typedef struct { struct-field-list } Type_Name;
+
+struct-field-list:
+	struct-field-name , struct-field-list
+	struct-field-name
+
+function-args:
+	( args-dec-opt )
+
+args-decl-opt:
+	identifier
+	args-decl , identifier
+
+expression:
+	 simple_expression
+	 simple-expression , expression
+ <none>
+
+% Note: simple-expression groups operators OP1 at same level. The
+% actual implementation will not do this.
+simple-expression:
+	 unary-expression
+	 binary-expression BINARY-OP unary-expression
+	 andelse xxelse-expression-list
+	 orelse xxelse-expression-list
+
+xxelse-expression-list:
+	{ expression }
+	xxelse-expression-list { expression }
+binary-expression:
+ unary-expression
+	unary-expression BINARY-OP binary-expression
+
+unary-expression:
+	 postfix-expression
+	 ++ postfix-expression
+	 -- postfix-expression
+	 case unary-expression
+	 OP3 unary-expression
+	 (OP3: + - ~ & not @)
+
+postfix-expression:
+	 primary-expression
+	 postfix-expression expression 
+	 postfix-expression ( function-args-expression )
+	 postfix-expression . identifier
+	 postfix-expression ^ unary-expression
+	 postfix-expression ++
+	 postfix-expression --
+	 postfix-expression = simple-expression
+	 postfix-expression += simple-expression
+	 postfix-expression -= simple-expression
+
+primary-expression:
+	literal
+	identifier
+	( expression_opt )
+	 inline-array-expression 
+	&identifier
+	struct-definition
+	__tmp(literal)
+
+inline-array-expression:
+ expression
+	expression : expression
+	expression : expression : expression
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/internal Added

_service:tar_scm:slang-2.3.2.tar.bz2/doc/internal/rpn.txt Added

@@ -0,0 +1,59 @@
+Variable Assignment:
+   x =   --> =x
+   x +=  --> +=x
+   x -=  --> -=x
+   x++   --> ++x
+   x--   --> --x
+  Note: The current version of slang does not distguish between the
+  post and pre-increment operators.  A future version may make a
+  distinction and assignment statements may return a value.
+
+Function Definition: define f (arg1, ..., argN) { statements }
+   --> (  arg1 arg2 ... argN  =argN ... =arg1 rpn-statements ) f
+
+Variable Declaration: variable x1, ... xN;
+   -->  x1 ... xN 
+
+Structure Definition: struct {f1, ... fN}
+   -->  "f1" ... "fN" N struct
+
+Structure Typedef: typedef struct { f1, ... fN } Type_Name ;
+   --> __typedef f1 ... fN  "Type_Name"
+
+Multiple Assignment Expression: (x1, ..., xN) = expression
+   --> rpn-expression =xN ... =x1
+   Note: If xj is missing, it will be replaced by `pop'
+
+Function call:  f (x1, ..., xN)
+   --> __arg x1 ... xN __earg f
+   Note: if xj is missing, it will be replaced by NULL
+
+Array reference: X x1, .., xN
+   --> __arg x1 ... xN X __aget
+   Note: __earg is implicit
+
+Array assignment: X x1, ... xN ASSIGNMENT-OP
+   --> __arg x1 ... xN X RPN-ASSIGNMENT-OP
+   ASSIGNMENT-OP:
+      =   --> __aput
+      ++  --> __aput_plusplus
+      --  --> __aput_minusminus
+      +=  --> __aput_pluseqs
+      -=  --> __aput_minuseqs
+   Note: __earg is implicit
+
+Structure Reference: X.a --> "a" X .
+
+Structure Assignment: X.a ASSIGNMENT-OP expression;
+   --> rpn-expression "a" X RPN-ASSIGNMENT-OP
+   ASSIGNMENT-OP --> RPN-ASSIGNMENT-OP:
+     =   --> __struct_eqs
+     +=  --> __struct_pluseqs
+     -=  --> __struct_minuseqs
+     --  --> __struct_minusminus
+     ++  --> __struct_plusplus
+
+Variable Alias:  &x --> __alias x
+
+foreach (X) using (Y,...) block
+   --> X __arg Y... __earg { block } foreach

_service:tar_scm:slang-2.3.2.tar.bz2/doc/slangdoc.html Added

_service:tar_scm:slang-2.3.2.tar.bz2/doc/text Added

_service:tar_scm:slang-2.3.2.tar.bz2/doc/text/cref.txt Added

@@ -0,0 +1,5364 @@
+ The S-Lang C Library Reference
+ John E. Davis <www.jedsoft.org>
+ Nov 11, 2013
+ ____________________________________________________________
+
+
+ 1. Functions dealing with UTF-8 encoded strings
+
+ 1.1. SLutf8_skip_char
+
+ Synopsis
+ Skip past a UTF-8 encoded character
+
+ Usage
+ SLuchar_Type *SLutf8_skip_char (SLuchar_Type *u, SLuchar_Type
+ *umax)
+
+ Description
+ The SLutf8_skip_char function returns a pointer to the character
+ immediately following the UTF-8 encoded character at u. It will
+ make no attempt to examine the bytes at the position umax and
+ beyond. If the bytes at u do not represent a valid or legal
+ UTF-8 encoded sequence, a pointer to the byte following u will
+ be returned.
+
+ Notes
+ Unicode combining characters are treated as distinct characters
+ by this function.
+
+ See Also
+ SLutf8_skip_chars, SLutf8_bskip_char, SLutf8_strlen
+
+ 1.2. SLutf8_skip_chars
+
+ Synopsis
+ Skip past a specified number of characters in a UTF-8 encoded
+ string
+
+ Usage
+ SLuchar_Type *SLutf8_skip_chars (u, umax, num, dnum,
+ ignore_combining)
+
+ SLuchar_Type *u, *umax;
+ unsigned int num;
+ unsigned int *dnum;
+ int ignore_combining;
+
+ Description
+ This functions attempts to skip forward past num UTF-8 encoded
+ characters at u returning the actual number skipped via the
+ parameter dnum. It will make no attempt to examine bytes at umax
+ and beyond. Unicode combining characters will not be counted if
+ ignore_combining is non-zero, otherwise they will be treated as
+ distinct characters. If the input contains an invalid or illegal
+ UTF-8 sequence, then each byte in the sequence will be treated
+ as a single character.
+
+ See Also
+ SLutf8_skip_char, SLutf8_bskip_chars
+
+ 1.3. SLutf8_bskip_char
+
+ Synopsis
+ Skip backward past a UTF-8 encoded character
+
+ Usage
+ SLuchar_Type *SLutf8_bskip_char (SLuchar_Type *umin,
+ SLuchar_Type *u)
+
+ Description
+ The SLutf8_bskip_char skips backward to the start of the UTF-8
+ encoded character immediately before the position u. The
+ function will make no attempt to examine characters before the
+ position umin. UTF-8 combining characters are treated as
+ distinct characters.
+
+ See Also
+ SLutf8_bskip_chars, SLutf8_skip_char
+
+ 1.4. SLutf8_bskip_chars
+
+ Synopsis
+ Skip backward past a specified number of UTF-8 encoded
+ characters
+
+ Usage
+ SLuchar_Type *SLutf8_bskip_chars (umin, u, num, dnum,
+ ignore_combining)
+
+ SLuchar_Type *umin, *u;
+ unsigned int num;
+ unsigned int *dnum;
+ int ignore_combining;
+
+ Description
+ This functions attempts to skip backward past num UTF-8 encoded
+ characters occurring immediately before u. It returns the the
+ actual number skipped via the parameter dnum. No attempt will be
+ made to examine the bytes occurring before umin. Unicode
+ combining characters will not be counted if ignore_combining is
+ non-zero, otherwise they will be treated as distinct characters.
+ If the input contains an invalid or illegal UTF-8 sequence, then
+ each byte in the sequence will be treated as a single character.
+
+ See Also
+ SLutf8_skip_char, SLutf8_bskip_chars
+
+ 1.5. SLutf8_decode
+
+ Synopsis
+ Decode a UTF-8 encoded character sequence
+
+ Usage
+ SLuchar_Type *SLutf8_decode (u, umax, w, nconsumedp
+
+ SLuchar_Type *u, *umax;
+ SLwchar_Type *w;
+ unsigned int *nconsumedp;
+
+ Description
+ The SLutf8_decode function decodes the UTF-8 encoded character
+ occurring at u and returns the decoded character via the
+ parameter w. No attempt will be made to examine the bytes at
+ umax and beyond. If the parameter nconsumedp is non-NULL, then
+ the number of bytes consumed by the function will be returned to
+ it. If the sequence at u is invalid or illegal, the function
+ will return NULL and with the number of bytes consumed by the
+ function equal to the size of the invalid sequence. Otherwise
+ the function will return a pointer to byte following encoded
+ sequence.
+
+ See Also
+ SLutf8_decode, SLutf8_strlen, SLutf8_skip_char
+
+ 1.6. SLutf8_encode
+
+ Synopsis
+ UTF-8 encode a character
+
+ Usage
+ SLuchar_Type *SLutf8_encode (w, u, ulen)
+
+ SLwchar_Type w;
+ SLuchar_Type *u;
+ unsigned int ulen;
+
+ Description
+ This function UTF-8 encodes the Unicode character represented by
+ w and stored the encoded representation in the buffer of size
+ ulen bytes at u. The function will return NULL if the size of
+ the buffer is too small to represent the UTF-8 encoded
+ character, otherwise it will return a pointer to the byte
+ following encoded representation.
+
+ Notes
+ This function does not null terminate the resulting byte
+ sequence. The function SLutf8_encode_null_terminate may be used
+ for that purpose.
+
+ To guarantee that the buffer is large enough to hold the encoded
+ bytes, its size should be at least SLUTF8_MAX_BLEN bytes.
+
+ The function will encode illegal Unicode characters, i.e.,
+ characters in the range 0xD800-0xFFFF (the UTF-16 surrogates)
+ and 0xFFFE-0xFFFF.
+
+ See Also
+ SLutf8_decode, SLutf8_encode_bytes, SLutf8_encode_null_terminate
+
+ 1.7. SLutf8_strlen
+
+ Synopsis
+ Determine the number of characters in a UTF-8 sequence
+
+ Usage
+ unsigned int SLutf8_strlen (SLuchar_Type *s, int
+ ignore_combining)
+
+ Description
+ This function may be used to determine the number of characters
+ represented by the null-terminated UTF-8 byte sequence. If the
+ ignore_combining parameter is non-zero, then Unicode combining
+ characters will not be counted.
+
+ See Also
+ SLutf8_skip_chars, SLutf8_decode
+
+ 1.8. SLutf8_extract_utf8_char
+
+ Synopsis
+ Extract a UTF-8 encoded character
+
+ Usage
+ SLuchar_Type *SLutf8_extract_utf8_char (u, umax, buf)
+
+ SLuchar_Type *u, *umax, *buf;
+
+ Description
+ This function extracts the bytes representing UTF-8 encoded
+ character at u and places them in the buffer buf, and then null
+ terminates the result. The buffer is assumed to consist of at
+ least SLUTF8_MAX_BLEN+1 bytes, where the extra byte may be
+ necessary for null termination. No attempt will be made to
+ examine the characters at umax and beyond. If the byte-sequence
+ at u is an illegal or invalid UTF-8 sequence, then the byte at u
+ will be copied to the buffer. The function returns a pointer to
+ the byte following copied bytes.
+
+ Notes
+ One may think of this function as the single byte analogue of
+
+ if (u < umax)
+ {
+ buf0 = *u++;
+ buf1 = 0;
+ }
+
+ See Also
+ SLutf8_decode, SLutf8_skip_char
+
+ 1.9. SLutf8_encode_null_terminate
+
+ Synopsis
+ UTF-8 encode a character and null terminate the result
+
+ Usage
+ SLuchar_Type *SLutf8_encode_null_terminate (w, buf)
+
+ SLwchar_Type w;
+ SLuchar_Type *buf;
+
+ Description
+ This function has the same functionality as SLutf8_encode,
+ except that it also null terminates the encoded sequences. The
+ buffer buf, where the encoded sequence is placed, is assumed to
+ consist of at least SLUTF8_MAX_BLEN+1 bytes.
+
+ See Also
+ SLutf8_encode
+
+ 1.10. SLutf8_strup
+
+ Synopsis
+ Uppercase a UTF-8 encoded string
+
+ Usage
+ SLuchar_Type *SLutf8_strup (SLuchar_Type *u, SLuchar_Type *umax)
+
+ Description
+ The SLutf8_strup function returns the uppercase equivalent of
+ UTF-8 encoded sequence of umax-u bytes at u. The result will be
+ returned as a null-terminated SLstring and should be freed with
+ SLang_free_slstring when it is nolonger needed. If the function
+ encounters an invalid of illegal byte sequence, then the byte-
+ sequence will be copied as as-is.
+
+ See Also
+ SLutf8_strlow, SLwchar_toupper
+
+ 1.11. SLutf8_strlo
+
+ Synopsis
+ Lowercase a UTF-8 encoded string
+
+ Usage
+ SLuchar_Type *SLutf8_strlo (SLuchar_Type *u, SLuchar_Type *umax)
+
+ Description
+ The SLutf8_strlo function returns the lowercase equivalent of
+ UTF-8 encoded sequence of umax-u bytes at u. The result will be
+ returned as a null-terminated SLstring and should be freed with
+ SLang_free_slstring when it is nolonger needed. If the function
+ encounters an invalid of illegal byte sequence, then the byte-
+ sequence will be copied as as-is.
+
+ See Also
+ SLutf8_strlow, SLwchar_toupper
+
+ 1.12. SLutf8_subst_wchar
+
+ Synopsis
+ Replace a character in a UTF-8 encoded string
+
+ Usage
+ SLstr_Type *SLutf8_subst_wchar (u, umax, wch,
+ nth,ignore_combining)
+
+ SLuchar_Type *u, *umax;
+ SLwchar_Type wch;
+ unsigned int nth;
+ int ignore_combining;
+
+ Description
+ The SLutf8_subst_wchar function replaces the UTF-8 sequence
+ representing the nth character of u by the UTF-8 representation
+ of the character wch. If the value of the ignore_combining
+ parameter is non-zero, then combining characters will not be
+ counted when computing the position of the nth character. In
+ addition, if the nth character contains any combining
+ characters, then the byte-sequence associated with those
+ characters will also be replaced.
+
+ Since the byte sequence representing wch could be longer than
+ the sequence of the nth character, the function returns a new
+ copy of the resulting string as an SLSTRING. Hence, the calling
+ function should call SLang_free_slstring when the result is
+ nolonger needed.
+
+ See Also
+ SLutf8_strup, SLutf8_strlow, SLutf8_skip_chars, SLutf8_strlen
+
+ 1.13. SLutf8_compare
+
+ Synopsis
+ Compare two UTF-8 encoded sequences
+
+ Usage
+ int SLutf8_compare (a, amax, b, bmax, nchars, case_sensitive)
+
+ SLuchar_Type *a, *amax;
+ SLuchar_Type *b, *bmax;
+ unsigned int nchars;
+ int case_sensitive;
+
+ Description
+ This function compares nchars of one UTF-8 encoded character
+ sequence to another by performing a character by character
+ comparison. The function returns 0, +1, or -1 according to
+ whether the string a is is equal to, greater than, or less than
+ the string at b. At most nchars characters will be tested. The
+ parameters amax and bmax serve as upper boundaries of the
+ strings a and b, resp.
+
+ If the value of the case_sensitive parameter is non-zero, then a
+ case-sensitive comparison will be performed, otherwise
+ characters will be compared in a case-insensitive manner.
+
+ Notes
+ For case-sensitive comparisons, this function is analogous to
+ the standard C library's strncmp function. However,
+ SLutf8_compare can also cope with invalid or illegal UTF-8
+ sequences.
+
+ See Also
+ SLutf8_strup, SLutf8_strlen, SLutf8_strlen
+
+ 2. Character classification functions
+
+ 2.1. SLwchar_toupper
+
+ Synopsis
+ Uppercase a Unicode character
+
+ Usage
+ SLwchar_Type SLwchar_toupper (SLwchar_Type wc)
+
+ Description
+ SLwchar_toupper returns the uppercase equivalent of the
+ specified character.
+
+ Notes
+ If the library is not in UTF-8 mode, then the current locale
+ will be used.
+
+ See Also
+ SLwchar_tolower, SLwchar_isupper, SLutf8_strup
+
+ 2.2. SLwchar_tolower
+
+ Synopsis
+ Lowercase a Unicode character
+
+ Usage
+ SLwchar_Type SLwchar_tolower (SLwchar_Type wc)
+
+ Description
+ SLwchar_tolower returns the lowercase equivalent of the
+ specified character.
+
+ Notes
+ If the library is not in UTF-8 mode, then the current locale
+ will be used.
+
+ See Also
+ SLwchar_toupper, SLwchar_islower, SLutf8_strlow
+
+ 2.3. SLwchar_wcwidth
+
+ Synopsis
+ Determine the displayable width of a wide character
+
+ Usage
+ int SLwchar_wcwidth (SLwchar_Type wc)
+
+ Description
+ This function returns the number of columns necessary to display
+ the specified Unicode character. Combining characters are meant
+ to be combined with other characters and, as such, have 0 width.
+
+ Notes
+ If the library is not in UTF-8 mode, then the current locale
+ will be used.
+
+ See Also
+ SLwchar_isspace, SLwchar_iscntrl
+
+ 2.4. SLwchar_isalnum
+
+ Synopsis
+ Determine if a Unicode character is alphanumeric
+
+ Usage
+ int SLwchar_isalnum (SLwchar_Type wc)
+
+ Description
+ SLwchar_isalnum returns a non-zero value if the Unicode
+ character is alphanumeric, otherwise it returns 0.
+
+ Notes
+ If the library is not in UTF-8 mode, then the current locale
+ will be used.
+
+ See Also
+ SLwchar_isalpha, SLwchar_isdigit, SLwchar_iscntrl
+
+ 2.5. SLwchar_isalpha
+
+ Synopsis
+ Determine if a Unicode character is an alphabetic character
+
+ Usage
+ int SLwchar_isalpha (SLwchar_Type wc)
+
+ Description
+ SLwchar_isalpha returns a non-zero value if the Unicode
+ character is alphabetic, otherwise it returns 0.
+
+ Notes
+ If the library is not in UTF-8 mode, then the current locale
+ will be used.
+
+ See Also
+ SLwchar_isalnum, SLwchar_isalpha, SLwchar_isdigit,
+ SLwchar_iscntrl
+
+ 2.6. SLwchar_isblank
+
+ Synopsis
+ Determine if a Unicode character is a blank
+
+ Usage
+ int SLwchar_isblank (SLwchar_Type wc)
+
+ Description
+ SLwchar_isblank returns a non-zero value if the Unicode
+ character is a blank one (space or tab), otherwise it returns 0.
+
+ Notes
+ If the library is not in UTF-8 mode, then the current locale
+ will be used.
+
+ See Also
+ SLwchar_isspace, SLwchar_isalpha, SLwchar_isdigit,
+ SLwchar_iscntrl
+
+ 2.7. SLwchar_iscntrl
+
+ Synopsis
+ Determine if a Unicode character is a control character
+
+ Usage
+ int SLwchar_iscntrl (SLwchar_Type wc)
+
+ Description
+ SLwchar_isblank returns a non-zero value if the Unicode
+ character is a control character, otherwise it returns 0.
+
+ Notes
+ If the library is not in UTF-8 mode, then the current locale
+ will be used.
+
+ See Also
+ SLwchar_isspace, SLwchar_isalpha, SLwchar_isdigit,
+ SLwchar_isprint
+
+ 2.8. SLwchar_isdigit
+
+ Synopsis
+ Determine if a Unicode character is a digit
+
+ Usage
+ int SLwchar_isdigit (SLwchar_Type wc)
+
+ Description
+ This function returns a non-zero value if the specified Unicode
+ character is a digit, otherwise it returns 0.
+
+ Notes
+ If the library is not in UTF-8 mode, then the current locale
+ will be used.
+
+ See Also
+ SLwchar_isspace, SLwchar_isalpha, SLwchar_isxdigit,
+ SLwchar_isprint
+
+ 2.9. SLwchar_isgraph
+
+ Synopsis
+ Determine if a non-space Unicode character is printable
+
+ Usage
+ int SLwchar_isgraph (SLwchar_Type wc)
+
+ Description
+ This function returns a non-zero value if the specified Unicode
+ character is a non-space printable character, otherwise it
+ returns 0.
+
+ Notes
+ If the library is not in UTF-8 mode, then the current locale
+ will be used.
+
+ See Also
+ SLwchar_isspace, SLwchar_isalpha, SLwchar_isdigit,
+ SLwchar_isprint
+
+ 2.10. SLwchar_islower
+
+ Synopsis
+ Determine if a Unicode character is alphanumeric
+
+ Usage
+ int SLwchar_islower (SLwchar_Type wc)
+
+ Description
+ This function returns a non-zero value if the specified Unicode
+ character is a lowercase one, otherwise it returns 0.
+
+ Notes
+ If the library is not in UTF-8 mode, then the current locale
+ will be used.
+
+ See Also
+ SLwchar_isupper, SLwchar_isspace, SLwchar_isalpha,
+ SLwchar_isdigit, SLwchar_iscntrl
+
+ 2.11. SLwchar_isprint
+
+ Synopsis
+ Determine if a Unicode character is printable
+
+ Usage
+ int SLwchar_isprint (SLwchar_Type wc)
+
+ Description
+ This function returns a non-zero value if the specified Unicode
+ character is a printable one (includes space), otherwise it
+ returns 0.
+
+ Notes
+ If the library is not in UTF-8 mode, then the current locale
+ will be used.
+
+ See Also
+ SLwchar_isgraph, SLwchar_isspace, SLwchar_isalpha,
+ SLwchar_isdigit
+
+ 2.12. SLwchar_ispunct
+
+ Synopsis
+ Determine if a Unicode character is a punctuation character
+
+ Usage
+ int SLwchar_ispunct (SLwchar_Type wc)
+
+ Description
+ This function returns a non-zero value if the specified Unicode
+ character is a punctuation character, otherwise it returns 0.
+
+ Notes
+ If the library is not in UTF-8 mode, then the current locale
+ will be used.
+
+ See Also
+ SLwchar_isspace, SLwchar_isalpha, SLwchar_isdigit,
+ SLwchar_isprint
+
+ 2.13. SLwchar_isspace
+
+ Synopsis
+ Determine if a Unicode character is a whitespace character
+
+ Usage
+ int SLwchar_isspace (SLwchar_Type wc)
+
+ Description
+ This function returns a non-zero value if the specified Unicode
+ character is a whitespace character, otherwise it returns 0.
+
+ Notes
+ If the library is not in UTF-8 mode, then the current locale
+ will be used.
+
+ See Also
+ SLwchar_isblank, SLwchar_isalpha, SLwchar_isdigit,
+ SLwchar_ispunct
+
+ 2.14. SLwchar_isupper
+
+ Synopsis
+ Determine if a Unicode character is uppercase
+
+ Usage
+ int SLwchar_isupper (SLwchar_Type wc)
+
+ Description
+ This function returns a non-zero value if the specified Unicode
+ character is an uppercase character, otherwise it returns 0.
+
+ Notes
+ If the library is not in UTF-8 mode, then the current locale
+ will be used.
+
+ See Also
+ SLwchar_islower, SLwchar_isspace, SLwchar_isalpha,
+ SLwchar_isdigit
+
+ 2.15. SLwchar_isxdigit
+
+ Synopsis
+ Determine if a Unicode character is a hexidecimal digit
+
+ Usage
+ int SLwchar_isxdigit (SLwchar_Type wc)
+
+ Description
+ This function returns a non-zero value if the specified Unicode
+ character is a hexadecimal digit character, otherwise it returns
+ 0.
+
+ Notes
+ If the library is not in UTF-8 mode, then the current locale
+ will be used.
+
+ See Also
+ SLwchar_isdigit, SLwchar_isspace, SLwchar_isalpha,
+ SLwchar_ispunct
+
+ 3. SLsearch interface Functions
+
+ 3.1. SLsearch_new
+
+ Synopsis
+ Create an SLsearch_Type object
+
+ Usage
+ SLsearch_Type *SLsearch_new (SLuchar_Type *key, int
+ search_flags)
+
+ Description
+ The SLsearch_new function instantiates an SLsearch_Type object
+ for use in ordinary searches (non-regular expression) by the
+ functions in the SLsearch interface. The first argument key is a
+ pointer to a null terminated string that specifies the character
+ string to be searched. This character string may not contain any
+ embedded null characters.
+
+ The second argument search_flags is used to specify how the
+ search is to be performed. It is a bit-mapped integer whose
+ value is constructed by the bitwise-or of zero or more of the
+ following:
+
+ SLSEARCH_CASELESS
+ The search shall be performed in a case-insensitive manner.
+
+ SLSEARCH_UTF8
+ Both the search string and the text to be searched is UTF-8
+ encoded.
+
+ Upon sucess, the function returns the newly created object, and
+ NULL otherwise. When the search object is nolonger needed, it
+ should be freed via the SLsearch_delete function.
+
+ See Also
+ SLsearch_delete, SLsearch_forward, SLsearch_backward
+
+ 3.2. SLsearch_delete
+
+ Synopsis
+ Free the memory associated with a SLsearch_Type object
+
+ Usage
+ SLsearch_delete (SLsearch_Type *)
+
+ Description
+ This function should be called to free the memory associated
+ with a SLsearch_Type object created by the SLsearch_new
+ function. Failure to do so will result in a memory leak.
+
+ See Also
+ SLsearch_new, SLsearch_forward, SLsearch_backward
+
+ 3.3. SLsearch_forward
+
+ Synopsis
+ Search forward in a buffer
+
+ Usage
+ SLuchar_Type SLsearch_forward (st, pmin, pmax)
+
+ SLsearch_Type *st;
+ SLuchar_Type *pmin, *pmax;
+
+ Description
+ The SLsearch_forward function searches forward in the buffer
+ defined by the pointers pmin and pmax. The starting point for
+ the search is at the beginning of the buffer at pmin. At no
+ point will the bytes at pmax and beyond be examined. The first
+ parameter st, obtained by a prior call to SLsearch_new,
+ specifies the object to found. be found from a previous call to
+ SLsearch_new.
+
+ If the object was found, the pointer to the beginning of it will
+ be returned. Otherwise, SLsearch_forward will return NULL. The
+ length of the object may be obtained via the SLsearch_match_len
+ function.
+
+ Notes
+ This function uses the Boyer-Moore search algorithm when
+ possible.
+
+ See Also
+ SLsearch_new, SLsearch_backward, SLsearch_delete,
+ SLsearch_match_len
+
+ 3.4. SLsearch_backward
+
+ Synopsis
+ Search backward in a buffer
+
+ Usage
+ SLuchar_Type SLsearch_forward (st, pmin, pstart, pmax)
+
+ SLsearch_Type *st;
+ SLuchar_Type *pmin, *pstart, *pmax;
+
+ Description
+ The SLsearch_forward function searches backward in the buffer
+ defined by the pointers pmin and pmax. The starting point for
+ the search is at the position pstart. At no point will the bytes
+ at pmax and beyond be examined. The first parameter st, obtained
+ by a prior call to SLsearch_new, specifies the object to found.
+
+ If the object was found, the pointer to the beginning of it will
+ be returned. Otherwise, SLsearch_forward will return NULL. The
+ length of the object may be obtained via the SLsearch_match_len
+ function.
+
+ Notes
+ This function uses the Boyer-Moore search algorithm when
+ possible.
+
+ It is possible for the end of match to appear after the point
+ where the search began (pstart).
+
+ See Also
+ SLsearch_new, SLsearch_forward, SLsearch_delete,
+ SLsearch_match_len
+
+ 3.5. SLsearch_match_len
+
+ Synopsis
+ Get the length of the previous match
+
+ Usage
+ unsigned int SLsearch_match_len (SLsearch_Type *st)
+
+ Description
+ The SLsearch_match_len function returns the length of the match
+ from the most recent search involving the specified
+ SLsearch_Type object. If the most recent search was
+ unsuccessful, the function will return 0.
+
+ See Also
+ SLsearch_forward, SLsearch_backward, SLsearch_new,
+ SLsearch_delete
+
+ 4. Screen Management (SLsmg) functions
+
+ 4.1. SLsmg_fill_region
+
+ Synopsis
+ Fill a rectangular region with a character
+
+ Usage
+ void SLsmg_fill_region (r, c, nr, nc, ch)
+
+ int r
+ int c
+ unsigned int nr
+ unsigned int nc
+ unsigned char ch
+
+ Description
+ The SLsmg_fill_region function may be used to a rectangular
+ region with the character ch in the current color. The
+ rectangle's upper left corner is at row r and column c, and
+ spans nr rows and nc columns. The position of the virtual cursor
+ will be left at (r, c).
+
+ See Also
+ SLsmg_write_char, SLsmg_set_color
+
+ 4.2. SLsmg_set_char_set
+
+ Synopsis
+ Turn on or off line drawing characters
+
+ Usage
+ void SLsmg_set_char_set (int a);
+
+ Description
+ SLsmg_set_char_set may be used to select or deselect the line
+ drawing character set as the current character set. If a is non-
+ zero, the line drawing character set will be selected.
+ Otherwise, the standard character set will be selected.
+
+ Notes
+ There is no guarantee that this function will actually enable
+ the use of line drawing characters. All it does is cause
+ subsequent characters to be rendered using the terminal's
+ alternate character set. Such character sets usually contain
+ line drawing characters.
+
+ See Also
+ SLsmg_write_char, SLtt_get_terminfo
+
+ 4.3. int SLsmg_Scroll_Hash_Border;
+
+ Synopsis
+ Set the size of the border for the scroll hash
+
+ Usage
+ int SLsmg_Scroll_Hash_Border = 0;
+
+ Description
+ This variable may be used to ignore the characters that occur at
+ the beginning and the end of a row when performing the hash
+ calculation to determine whether or not a line has scrolled. The
+ default value is zero which means that all the characters on a
+ line will be used.
+
+ See Also
+ SLsmg_refresh
+
+ 4.4. SLsmg_suspend_smg
+
+ Synopsis
+ Suspend screen management
+
+ Usage
+ int SLsmg_suspend_smg (void)
+
+ Description
+ SLsmg_suspend_smg can be used to suspend the state of the screen
+ management facility during suspension of the program. Use of
+ this function will reset the display back to its default state.
+ The funtion SLsmg_resume_smg should be called after suspension.
+
+ It returns zero upon success, or -1 upon error.
+
+ This function is similar to SLsmg_reset_smg except that the
+ state of the display prior to calling SLsmg_suspend_smg is
+ saved.
+
+ See Also
+ SLsmg_resume_smg, SLsmg_reset_smg
+
+ 4.5. SLsmg_resume_smg
+
+ Synopsis
+ Resume screen management
+
+ Usage
+ int SLsmg_resume_smg (void)
+
+ Description
+ SLsmg_resume_smg should be called after SLsmg_suspend_smg to
+ redraw the display exactly like it was before SLsmg_suspend_smg
+ was called. It returns zero upon success, or -1 upon error.
+
+ See Also
+ SLsmg_suspend_smg
+
+ 4.6. SLsmg_erase_eol
+
+ Synopsis
+ Erase to the end of the row
+
+ Usage
+ void SLsmg_erase_eol (void);
+
+ Description
+ SLsmg_erase_eol erases all characters from the current position
+ to the end of the line. The newly created space is given the
+ color of the current color. This function has no effect on the
+ position of the virtual cursor.
+
+ See Also
+ SLsmg_gotorc, SLsmg_erase_eos, SLsmg_fill_region
+
+ 4.7. SLsmg_gotorc
+
+ Synopsis
+ Move the virtual cursor
+
+ Usage
+ void SLsmg_gotorc (int r, int c)
+
+ Description
+ The SLsmg_gotorc function moves the virtual cursor to the row r
+ and column c. The first row and first column is specified by r =
+ 0 and c = 0.
+
+ See Also
+ SLsmg_refresh
+
+ 4.8. SLsmg_erase_eos
+
+ Synopsis
+ Erase to the end of the screen
+
+ Usage
+ void SLsmg_erase_eos (void);
+
+ Description
+ The SLsmg_erase_eos is like SLsmg_erase_eol except that it
+ erases all text from the current position to the end of the
+ display. The current color will be used to set the background of
+ the erased area.
+
+ See Also
+ SLsmg_erase_eol
+
+ 4.9. SLsmg_reverse_video
+
+ Synopsis
+ Set the current color to 1
+
+ Usage
+ void SLsmg_reverse_video (void);
+
+ Description
+ This function is nothing more than SLsmg_set_color(1).
+
+ See Also
+ SLsmg_set_color
+
+ 4.10. SLsmg_set_color (int)
+
+ Synopsis
+ Set the current color
+
+ Usage
+ void SLsmg_set_color (int c);
+
+ Description
+ SLsmg_set_color is used to set the current color. The parameter
+ c is really a color object descriptor. Actual foreground and
+ background colors as well as other visual attributes may be
+ associated with a color descriptor via the SLtt_set_color
+ function.
+
+ Example
+ This example defines color 7 to be green foreground on black
+ background and then displays some text in this color:
+
+ SLtt_set_color (7, NULL, "green", "black");
+ SLsmg_set_color (7);
+ SLsmg_write_string ("Hello");
+ SLsmg_refresh ();
+
+ Notes
+ It is important to understand that the screen managment routines
+ know nothing about the actual colors associated with a color
+ descriptor. Only the descriptor itself is used by the SLsmg
+ routines. The lower level SLtt interface converts the color
+ descriptors to actual colors. Thus
+
+ SLtt_set_color (7, NULL, "green", "black");
+ SLsmg_set_color (7);
+ SLsmg_write_string ("Hello");
+ SLtt_set_color (7, NULL, "red", "blue");
+ SLsmg_write_string ("World");
+ SLsmg_refresh ();
+
+ will result in "hello" displayed in red on blue and not green on
+ black.
+
+ See Also
+ SLtt_set_color, SLtt_set_color_object
+
+ 4.11. SLsmg_normal_video
+
+ Synopsis
+ Set the current color to 0
+
+ Usage
+ void SLsmg_normal_video (void);
+
+ Description
+ SLsmg_normal_video sets the current color descriptor to 0.
+
+ See Also
+ SLsmg_set_color
+
+ 4.12. SLsmg_printf
+
+ Synopsis
+ Format a string on the virtual display
+
+ Usage
+ void SLsmg_printf (char *fmt, ...)
+
+ Description
+ SLsmg_printf format a printf style variable argument list and
+ writes it on the virtual display. The virtual cursor will be
+ moved to the end of the string.
+
+ See Also
+ SLsmg_write_string, SLsmg_vprintf
+
+ 4.13. SLsmg_vprintf
+
+ Synopsis
+ Format a string on the virtual display
+
+ Usage
+ void SLsmg_vprintf (char *fmt, va_list ap)
+
+ Description
+ SLsmg_vprintf formats a string in the manner of vprintf and
+ writes the result to the display. The virtual cursor is advanced
+ to the end of the string.
+
+ See Also
+ SLsmg_write_string, SLsmg_printf
+
+ 4.14. SLsmg_write_string
+
+ Synopsis
+ Write a character string on the display
+
+ Usage
+ void SLsmg_write_string (char *s)
+
+ Description
+ The function SLsmg_write_string displays the string s on the
+ virtual display at the current position and moves the position
+ to the end of the string.
+
+ See Also
+ SLsmg_printf, SLsmg_write_nstring
+
+ 4.15. SLsmg_write_nstring
+
+ Synopsis
+ Write the first n characters of a string on the display
+
+ Usage
+ void SLsmg_write_nstring (char *s, unsigned int n);
+
+ Description
+ SLsmg_write_nstring writes the first n characters of s to this
+ virtual display. If the length of the string s is less than n,
+ the spaces will used until n characters have been written. s can
+ be NULL, in which case n spaces will be written.
+
+ See Also
+ SLsmg_write_string, SLsmg_write_nchars
+
+ 4.16. SLsmg_write_char
+
+ Synopsis
+ Write a character to the virtual display
+
+ Usage
+ void SLsmg_write_char (char ch);
+
+ Description
+ SLsmg_write_char writes the character ch to the virtual display.
+
+ See Also
+ SLsmg_write_nchars, SLsmg_write_string
+
+ 4.17. SLsmg_write_nchars
+
+ Synopsis
+ Write n characters to the virtual display
+
+ Usage
+ void SLsmg_write_nchars (char *s, unsigned int n);
+
+ Description
+ SLsmg_write_nchars writes at most n characters from the string s
+ to the display. If the length of s is less than n, the whole
+ length of the string will get written.
+
+ This function differs from SLsmg_write_nstring in that
+ SLsmg_write_nstring will pad the string to write exactly n
+ characters. SLsmg_write_nchars does not perform any padding.
+
+ See Also
+ SLsmg_write_nchars, SLsmg_write_nstring
+
+ 4.18. SLsmg_write_wrapped_string
+
+ Synopsis
+ Write a string to the display with wrapping
+
+ Usage
+ void SLsmg_write_wrapped_string (s, r, c, nr, nc, fill)
+
+ char *s
+ int r, c
+ unsigned int nr, nc
+ int fill
+
+ Description
+ SLsmg_write_wrapped_string writes the string s to the virtual
+ display. The string will be confined to the rectangular region
+ whose upper right corner is at row r and column c, and consists
+ of nr rows and nc columns. The string will be wrapped at the
+ boundaries of the box. If fill is non-zero, the last line to
+ which characters have been written will get padded with spaces.
+
+ Notes
+ This function does not wrap on word boundaries. However, it will
+ wrap when a newline charater is encountered.
+
+ See Also
+ SLsmg_write_string
+
+ 4.19. SLsmg_cls
+
+ Synopsis
+ Clear the virtual display
+
+ Usage
+ void SLsmg_cls (void)
+
+ Description
+ SLsmg_cls erases the virtual display using the current color.
+ This will cause the physical display to get cleared the next
+ time SLsmg_refresh is called.
+
+ Notes
+ This function is not the same as
+
+ SLsmg_gotorc (0,0); SLsmg_erase_eos ();
+
+ since these statements do not guarantee that the physical screen
+ will get cleared.
+
+ See Also
+ SLsmg_refresh, SLsmg_erase_eos
+
+ 4.20. SLsmg_refresh
+
+ Synopsis
+ Update physical screen
+
+ Usage
+ void SLsmg_refresh (void)
+
+ Description
+ The SLsmg_refresh function updates the physical display to look
+ like the virtual display.
+
+ See Also
+ SLsmg_suspend_smg, SLsmg_init_smg, SLsmg_reset_smg
+
+ 4.21. SLsmg_touch_lines
+
+ Synopsis
+ Mark lines on the virtual display for redisplay
+
+ Usage
+ void SLsmg_touch_lines (int r, unsigned int nr)
+
+ Description
+ SLsmg_touch_lines marks the nr lines on the virtual display
+ starting at row r for redisplay upon the next call to
+ SLsmg_refresh.
+
+ Notes
+ This function should rarely be called, if ever. If you find that
+ you need to call this function, then your application should be
+ modified to properly use the SLsmg screen management routines.
+ This function is provided only for curses compatibility.
+
+ See Also
+ SLsmg_refresh
+
+ 4.22. SLsmg_init_smg
+
+ Synopsis
+ Initialize the SLsmg routines
+
+ Usage
+ int SLsmg_init_smg (void)
+
+ Description
+ The SLsmg_init_smg function initializes the SLsmg screen
+ management routines. Specifically, this function allocates space
+ for the virtual display and calls SLtt_init_video to put the
+ terminal's physical display in the proper state. It is up to the
+ caller to make sure that the SLtt routines are initialized via
+ SLtt_get_terminfo before calling SLsmg_init_smg.
+
+ This function should also be called any time the size of the
+ physical display has changed so that it can reallocate a new
+ virtual display to match the physical display.
+
+ It returns zero upon success, or -1 upon failure.
+
+ See Also
+ SLsmg_reset_smg
+
+ 4.23. SLsmg_reset_smg
+
+ Synopsis
+ Reset the SLsmg routines
+
+ Usage
+ int SLsmg_reset_smg (void);
+
+ Description
+ SLsmg_reset_smg resets the SLsmg screen management routines by
+ freeing all memory allocated while it was active. It also calls
+ SLtt_reset_video to put the terminal's display in it default
+ state.
+
+ See Also
+ SLsmg_init_smg
+
+ 4.24. SLsmg_char_at
+
+ Synopsis
+ Get the character at the current position on the virtual display
+
+ Usage
+ unsigned short SLsmg_char_at(void)
+
+ Description
+ The SLsmg_char_at function returns the character and its color
+ at the current position on the virtual display.
+
+ See Also
+ SLsmg_read_raw, SLsmg_write_char
+
+ 4.25. SLsmg_set_screen_start
+
+ Synopsis
+ Set the origin of the virtual display
+
+ Usage
+ void SLsmg_set_screen_start (int *r, int *c)
+
+ Description
+ SLsmg_set_screen_start sets the origin of the virtual display to
+ the row *r and the column *c. If either r or c is NULL, then the
+ corresponding value will be set to 0. Otherwise, the location
+ specified by the pointers will be updated to reflect the old
+ origin.
+
+ See slang/demo/pager.c for how this function may be used to
+ scroll horizontally.
+
+ See Also
+ SLsmg_init_smg
+
+ 4.26. SLsmg_draw_hline
+
+ Synopsis
+ Draw a horizontal line
+
+ Usage
+ void SLsmg_draw_hline (unsigned int len)
+
+ Description
+ The SLsmg_draw_hline function draws a horizontal line of length
+ len on the virtual display. The position of the virtual cursor
+ is left at the end of the line.
+
+ See Also
+ SLsmg_draw_vline
+
+ 4.27. SLsmg_draw_vline
+
+ Synopsis
+ Draw a vertical line
+
+ Usage
+ void SLsmg_draw_vline (unsigned int len);
+
+ Description
+ The SLsmg_draw_vline function draws a vertical line of length
+ len on the virtual display. The position of the virtual cursor
+ is left at the end of the line.
+
+ See Also
+ ??
+
+ 4.28. SLsmg_draw_object
+
+ Synopsis
+ Draw an object from the alternate character set
+
+ Usage
+ void SLsmg_draw_object (int r, int c, unsigned char obj)
+
+ Description
+ The SLsmg_draw_object function may be used to place the object
+ specified by obj at row r and column c. The object is really a
+ character from the alternate character set and may be specified
+ using one of the following constants:
+
+ SLSMG_HLINE_CHAR Horizontal line
+ SLSMG_VLINE_CHAR Vertical line
+ SLSMG_ULCORN_CHAR Upper left corner
+ SLSMG_URCORN_CHAR Upper right corner
+ SLSMG_LLCORN_CHAR Lower left corner
+ SLSMG_LRCORN_CHAR Lower right corner
+ SLSMG_CKBRD_CHAR Checkboard character
+ SLSMG_RTEE_CHAR Right Tee
+ SLSMG_LTEE_CHAR Left Tee
+ SLSMG_UTEE_CHAR Up Tee
+ SLSMG_DTEE_CHAR Down Tee
+ SLSMG_PLUS_CHAR Plus or Cross character
+
+ See Also
+ SLsmg_draw_vline, SLsmg_draw_hline, SLsmg_draw_box
+
+ 4.29. SLsmg_draw_box
+
+ Synopsis
+ Draw a box on the virtual display
+
+ Usage
+ void SLsmg_draw_box (int r, int c, unsigned int dr, unsigned int
+ dc)
+
+ Description
+ SLsmg_draw_box uses the SLsmg_draw_hline and SLsmg_draw_vline
+ functions to draw a rectangular box on the virtual display. The
+ box's upper left corner is placed at row r and column c. The
+ width and length of the box is specified by dc and dr,
+ respectively.
+
+ See Also
+ SLsmg_draw_vline, SLsmg_draw_hline, SLsmg_draw_object
+
+ 4.30. SLsmg_set_color_in_region
+
+ Synopsis
+ Change the color of a specifed region
+
+ Usage
+ void SLsmg_set_color_in_region (color, r, c, dr, dc)
+
+ int color;
+ int r, c;
+ unsigned int dr, dc;
+
+ Description
+ SLsmg_set_color_in_region may be used to change the color of a
+ rectangular region whose upper left corner is given by (r,c),
+ and whose width and height is given by dc and dr, respectively.
+ The color of the region is given by the color parameter.
+
+ See Also
+ SLsmg_draw_box, SLsmg_set_color
+
+ 4.31. SLsmg_get_column
+
+ Synopsis
+ Get the column of the virtual cursor
+
+ Usage
+ int SLsmg_get_column(void);
+
+ Description
+ The SLsmg_get_column function returns the current column of the
+ virtual cursor on the virtual display.
+
+ See Also
+ SLsmg_get_row, SLsmg_gotorc
+
+ 4.32. SLsmg_get_row
+
+ Synopsis
+ Get the row of the virtual cursor
+
+ Usage
+ int SLsmg_get_row(void);
+
+ Description
+ The SLsmg_get_row function returns the current row of the
+ virtual cursor on the virtual display.
+
+ See Also
+ SLsmg_get_column, SLsmg_gotorc
+
+ 4.33. SLsmg_forward
+
+ Synopsis
+ Move the virtual cursor forward n columns
+
+ Usage
+ void SLsmg_forward (int n);
+
+ Description
+ The SLsmg_forward function moves the virtual cursor forward n
+ columns.
+
+ See Also
+ SLsmg_gotorc
+
+ 4.34. SLsmg_write_color_chars
+
+ Synopsis
+ Write characters with color descriptors to virtual display
+
+ Usage
+ void SLsmg_write_color_chars (unsigned short *s, unsigned int
+ len)
+
+ Description
+ The SLsmg_write_color_chars function may be used to write len
+ characters, each with a different color descriptor to the
+ virtual display. Each character and its associated color are
+ encoded as an unsigned short such that the lower eight bits form
+ the character and the next eight bits form the color.
+
+ See Also
+ SLsmg_char_at, SLsmg_write_raw
+
+ 4.35. SLsmg_read_raw
+
+ Synopsis
+ Read characters from the virtual display
+
+ Usage
+ unsigned int SLsmg_read_raw (SLsmg_Char_Type *buf, unsigned int
+ len)
+
+ Description
+ SLsmg_read_raw attempts to read len characters from the current
+ position on the virtual display into the buffer specified by
+ buf. It returns the number of characters actually read. This
+ number will be less than len if an attempt is made to read past
+ the right margin of the display.
+
+ Notes
+ The purpose of the pair of functions, SLsmg_read_raw and
+ SLsmg_write_raw, is to permit one to copy the contents of one
+ region of the virtual display to another region.
+
+ See Also
+ SLsmg_char_at, SLsmg_write_raw
+
+ 4.36. SLsmg_write_raw
+
+ Synopsis
+ Write characters directly to the virtual display
+
+ Usage
+ unsigned int SLsmg_write_raw (unsigned short *buf, unsigned int
+ len)
+
+ Description
+ The SLsmg_write_raw function attempts to write len characters
+ specified by buf to the display at the current position. It
+ returns the number of characters successfully written, which
+ will be less than len if an attempt is made to write past the
+ right margin.
+
+ Notes
+ The purpose of the pair of functions, SLsmg_read_raw and
+ SLsmg_write_raw, is to permit one to copy the contents of one
+ region of the virtual display to another region.
+
+ See Also
+ SLsmg_read_raw
+
+ 5. Functions that deal with the interpreter
+
+ 5.1. SLallocate_load_type
+
+ Synopsis
+ Allocate a SLang_Load_Type object
+
+ Usage
+ SLang_Load_Type *SLallocate_load_type (char *name)
+
+ Description
+ The SLallocate_load_type function allocates and initializes
+ space for a SLang_Load_Type object and returns it. Upon failure,
+ the function returns NULL. The parameter name must uniquely
+ identify the object. For example, if the object represents a
+ file, then name could be the absolute path name of the file.
+
+ See Also
+ SLdeallocate_load_type, SLang_load_object
+
+ 5.2. SLdeallocate_load_type
+
+ Synopsis
+ Free a SLang_Load_Type object
+
+ Usage
+ void SLdeallocate_load_type (SLang_Load_Type *slt)
+
+ Description
+ This function frees the memory associated with a SLang_Load_Type
+ object that was acquired from a call to the SLallocate_load_type
+ function.
+
+ See Also
+ SLallocate_load_type, SLang_load_object
+
+ 5.3. SLang_load_object
+
+ Synopsis
+ Load an object into the interpreter
+
+ Usage
+ int SLang_load_object (SLang_Load_Type *obj)
+
+ Description
+ The function SLang_load_object is a generic function that may be
+ used to loaded an object of type SLang_Load_Type into the
+ interpreter. For example, the functions SLang_load_file and
+ SLang_load_string are wrappers around this function to load a
+ file and a string, respectively.
+
+ See Also
+ SLang_load_file, SLang_load_string, SLallocate_load_type
+
+ 5.4. SLclass_allocate_class
+
+ Synopsis
+ Allocate a class for a new data type
+
+ Usage
+ SLang_Class_Type *SLclass_allocate_class (char *name)
+
+ Description
+ The purpose of this function is to allocate and initialize space
+ that defines a new data type or class called name. If
+ successful, a pointer to the class is returned, or upon failure
+ the function returns NULL.
+
+ This function does not automatically create the new data type.
+ Callback functions must first be associated with the data type
+ via functions such as SLclass_set_push_function, and the data
+ type must be registered with the interpreter via
+ SLclass_register_class. See the S-Lang library programmer's
+ guide for more information.
+
+ See Also
+ SLclass_register_class, SLclass_set_push_function
+
+ 5.5. SLclass_register_class
+
+ Synopsis
+ Register a new data type with the interpreter
+
+ Usage
+ int SLclass_register_class (cl, type, sizeof_type, class_type)
+
+ SLang_Class_Type *cl
+ SLtype type
+ unsigned int sizeof_type
+ SLclass_Type class_type
+
+ Description
+ The SLclass_register_class function is used to register a new
+ class or data type with the interpreter. If successful, the
+ function returns 0, or upon failure, it returns -1.
+
+ The first parameter, cl, must have been previously obtained via
+ the SLclass_allocate_class function.
+
+ The second parameter, type specifies the data type of the new
+ class. If set to SLANG_VOID_TYPE then the library will
+ automatically allocate an unused value for the class (the
+ allocated value can then be found using the SLclass_get_class_id
+ function), otherwise a value greater than 255 should be used.
+ The values in the range 0-255 are reserved for internal use by
+ the library.
+
+ The size that the data type represents in bytes is specified by
+ the third parameter, sizeof_type. This value should not be
+ confused with the sizeof the structure that represents the data
+ type, unless the data type is of class SLANG_CLASS_TYPE_VECTOR
+ or SLANG_CLASS_TYPE_SCALAR. For pointer objects, the value of
+ this parameter is just sizeof(void *).
+
+ The final parameter specifies the class type of the data type.
+ It must be one of the values:
+
+ SLANG_CLASS_TYPE_SCALAR
+ SLANG_CLASS_TYPE_VECTOR
+ SLANG_CLASS_TYPE_PTR
+ SLANG_CLASS_TYPE_MMT
+
+ The SLANG_CLASS_TYPE_SCALAR indicates that the new data type is a
+ scalar. Examples of scalars in SLANG_INT_TYPE and SLANG_DOU-
+ BLE_TYPE.
+
+ Setting class_type to SLANG_CLASS_TYPE_VECTOR implies that the new
+ data type is a vector, or a 1-d array of scalar types. An example
+ of a data type of this class is the SLANG_COMPLEX_TYPE, which
+ represents complex numbers.
+
+ SLANG_CLASS_TYPE_PTR specifies the data type is of a pointer type.
+ Examples of data types of this class include SLANG_STRING_TYPE and
+ SLANG_ARRAY_TYPE. Such types must provide for their own memory
+ management.
+
+ Data types of class SLANG_CLASS_TYPE_MMT are pointer types except
+ that the memory management, i.e., creation and destruction of the
+ type, is handled by the interpreter. Such a type is called a memory
+ managed type. An example of this data type is the
+ SLANG_FILEPTR_TYPE.
+
+ Notes
+ See the S-Lang Library C Programmer's Guide for more
+ information.
+
+ See Also
+ SLclass_allocate_class, SLclass_get_class_id
+
+ 5.6. SLclass_set_string_function
+
+ Synopsis
+ Set a data type's string representation callback
+
+ Usage
+ int SLclass_set_string_function (cl, sfun)
+
+ SLang_Class_Type *cl
+ char *(*sfun) (SLtype, VOID_STAR);
+
+ Description
+ The SLclass_set_string_function routine is used to define a
+ callback function, sfun, that will be used when a string
+ representation of an object of the data type represented by cl
+ is needed. cl must have already been obtained via a call to
+ SLclass_allocate_class. When called, sfun will be passed two
+ arguments: an SLtype which represents the data type, and the
+ address of the object for which a string represetation is
+ required. The callback function must return a malloced string.
+
+ Upon success, SLclass_set_string_function returns zero, or upon
+ error it returns -1.
+
+ Example
+ A callback function that handles both SLANG_STRING_TYPE and
+ SLANG_INT_TYPE variables looks like:
+
+ char *string_and_int_callback (SLtype type, VOID_STAR addr)
+ {
+ char buf64;
+
+ switch (type)
+ {
+ case SLANG_STRING_TYPE:
+ return SLmake_string (*(char **)addr);
+
+ case SLANG_INTEGER_TYPE:
+ sprintf (buf, "%d", *(int *)addr);
+ return SLmake_string (buf);
+ }
+ return NULL;
+ }
+
+ Notes
+ The default string callback simply returns the name of the data
+ type.
+
+ See Also
+ SLclass_allocate_class, SLclass_register_class
+
+ 5.7. SLclass_set_destroy_function
+
+ Synopsis
+ Set the destroy method callback for a data type
+
+ Usage
+ int SLclass_set_destroy_function (cl, destroy_fun)
+
+ SLang_Class_Type *cl
+ void (*destroy_fun) (SLtype, VOID_STAR);
+
+ Description
+ SLclass_set_destroy_function is used to set the destroy callback
+ for a data type. The data type's class cl must have been
+ previously obtained via a call to SLclass_allocate_class. When
+ called, destroy_fun will be passed two arguments: an SLtype
+ which represents the data type, and the address of the object to
+ be destroyed.
+
+ SLclass_set_destroy_function returns zero upon success, and -1
+ upon failure.
+
+ Example
+ The destroy method for SLANG_STRING_TYPE looks like:
+
+ static void string_destroy (SLtype type, VOID_STAR ptr)
+ {
+ char *s = *(char **) ptr;
+ if (s != NULL) SLang_free_slstring (*(char **) s);
+ }
+
+ Notes
+ Data types of class SLANG_CLASS_TYPE_SCALAR do not require a
+ destroy callback. However, other classes do.
+
+ See Also
+ SLclass_allocate_class, SLclass_register_class
+
+ 5.8. SLclass_set_push_function
+
+ Synopsis
+ Set the push callback for a new data type
+
+ Usage
+ int SLclass_set_push_function (cl, push_fun)
+
+ SLang_Class_Type *cl
+ int (*push_fun) (SLtype, VOID_STAR);
+
+ Description
+ SLclass_set_push_function is used to set the push callback for a
+ new data type specified by cl, which must have been previously
+ obtained via SLclass_allocate_class.
+
+ The parameter push_fun is a pointer to the push callback. It is
+ required to take two arguments: an SLtype representing the data
+ type, and the address of the object to be pushed. It must return
+ zero upon success, or -1 upon failure.
+
+ SLclass_set_push_function returns zero upon success, or -1 upon
+ failure.
+
+ Example
+ The push callback for SLANG_COMPLEX_TYPE looks like:
+
+ static int complex_push (SLtype type, VOID_STAR ptr)
+ {
+ double *z = *(double **) ptr;
+ return SLang_push_complex (z0, z1);
+ }
+
+ See Also
+ SLclass_allocate_class, SLclass_register_class
+
+ 5.9. SLclass_set_pop_function
+
+ Synopsis
+ Set the pop callback for a new data type
+
+ Usage
+ int SLclass_set_pop_function (cl, pop_fun)
+
+ SLang_Class_Type *cl
+ int (*pop_fun) (SLtype, VOID_STAR);
+
+ Description
+ SLclass_set_pop_function is used to set the callback for popping
+ an object from the stack for a new data type specified by cl,
+ which must have been previously obtained via
+ SLclass_allocate_class.
+
+ The parameter pop_fun is a pointer to the pop callback function,
+ which is required to take two arguments: an unsigned character
+ representing the data type, and the address of the object to be
+ popped. It must return zero upon success, or -1 upon failure.
+
+ SLclass_set_pop_function returns zero upon success, or -1 upon
+ failure.
+
+ Example
+ The pop callback for SLANG_COMPLEX_TYPE looks like:
+
+ static int complex_push (SLtype type, VOID_STAR ptr)
+ {
+ double *z = *(double **) ptr;
+ return SLang_pop_complex (&z0, &z1);
+ }
+
+ See Also
+ SLclass_allocate_class, SLclass_register_class
+
+ 5.10. SLclass_get_datatype_name
+
+ Synopsis
+ Get the name of a data type
+
+ Usage
+ char *SLclass_get_datatype_name (SLtype type)
+
+ Description
+ The SLclass_get_datatype_name function returns the name of the
+ data type specified by type. For example, if type is
+ SLANG_INT_TYPE, the string "Integer_Type" will be returned.
+
+ This function returns a pointer that should not be modified or
+ freed.
+
+ See Also
+ SLclass_allocate_class, SLclass_register_class
+
+ 5.11. SLang_free_mmt
+
+ Synopsis
+ Free a memory managed type
+
+ Usage
+ void SLang_free_mmt (SLang_MMT_Type *mmt)
+
+ Description
+ The SLang_MMT_Type function is used to free a memory managed
+ data type.
+
+ See Also
+ SLang_object_from_mmt, SLang_create_mmt
+
+ 5.12. SLang_object_from_mmt
+
+ Synopsis
+ Get a pointer to the value of a memory managed type
+
+ Usage
+ VOID_STAR SLang_object_from_mmt (SLang_MMT_Type *mmt)
+
+ Description
+ The SLang_object_from_mmt function returns a pointer to the
+ actual object whose memory is being managed by the interpreter.
+
+ See Also
+ SLang_free_mmt, SLang_create_mmt
+
+ 5.13. SLang_create_mmt
+
+ Synopsis
+ Create a memory managed data type
+
+ Usage
+ SLang_MMT_Type *SLang_create_mmt (SLtype t, VOID_STAR ptr)
+
+ Description
+ The SLang_create_mmt function returns a pointer to a new memory
+ managed object. This object contains information necessary to
+ manage the memory associated with the pointer ptr which
+ represents the application defined data type of type t.
+
+ See Also
+ SLang_object_from_mmt, SLang_push_mmt, SLang_free_mmt
+
+ 5.14. SLang_push_mmt
+
+ Synopsis
+ Push a memory managed type
+
+ Usage
+ int SLang_push_mmt (SLang_MMT_Type *mmt)
+
+ Description
+ This function is used to push a memory managed type onto the
+ interpreter stack. It returns zero upon success, or -1 upon
+ failure.
+
+ See Also
+ SLang_create_mmt, SLang_pop_mmt
+
+ 5.15. SLang_pop_mmt
+
+ Synopsis
+ Pop a memory managed data type
+
+ Usage
+ SLang_MMT_Type *SLang_pop_mmt (SLtype t)
+
+ Description
+ The SLang_pop_mmt function may be used to pop a memory managed
+ type of type t from the stack. It returns a pointer to the
+ memory managed object upon success, or NULL upon failure. The
+ function SLang_object_from_mmt should be used to access the
+ actual pointer to the data type.
+
+ See Also
+ SLang_object_from_mmt, SLang_push_mmt
+
+ 5.16. SLang_inc_mmt
+
+ Synopsis
+ Increment a memory managed type reference count
+
+ Usage
+ void SLang_inc_mmt (SLang_MMT_Type *mmt);
+
+ Description
+ The SLang_inc_mmt function may be used to increment the
+ reference count associated with the memory managed data type
+ given by mmt.
+
+ See Also
+ SLang_free_mmt, SLang_create_mmt, SLang_pop_mmt, SLang_pop_mmt
+
+ 5.17. SLadd_intrin_fun_table
+
+ Synopsis
+ Add a table of intrinsic functions to the interpreter
+
+ Usage
+ int SLadd_intrin_fun_table(SLang_Intrin_Fun_Type *tbl, char
+ *pp_name);
+
+ Description
+ The SLadd_intrin_fun_table function adds an array, or table, of
+ SLang_Intrin_Fun_Type objects to the interpreter. The first
+ parameter, tbl specifies the table to be added. The second
+ parameter pp_name, if non-NULL will be added to the list of
+ preprocessor symbols.
+
+ This function returns -1 upon failure or zero upon success.
+
+ Notes
+ A table should only be loaded one time and it is considered to
+ be an error on the part of the application if it loads a table
+ more than once.
+
+ See Also
+ SLadd_intrin_var_table, SLadd_intrinsic_function,
+ SLdefine_for_ifdef
+
+ 5.18. SLadd_intrin_var_table
+
+ Synopsis
+ Add a table of intrinsic variables to the interpreter
+
+ Usage
+ int SLadd_intrin_var_table (SLang_Intrin_Var_Type *tbl, char
+ *pp_name);
+
+ Description
+ The SLadd_intrin_var_table function adds an array, or table, of
+ SLang_Intrin_Var_Type objects to the interpreter. The first
+ parameter, tbl specifies the table to be added. The second
+ parameter pp_name, if non-NULL will be added to the list of
+ preprocessor symbols.
+
+ This function returns -1 upon failure or zero upon success.
+
+ Notes
+ A table should only be loaded one time and it is considered to
+ be an error on the part of the application if it loads a table
+ more than once.
+
+ See Also
+ SLadd_intrin_var_table, SLadd_intrinsic_function,
+ SLdefine_for_ifdef
+
+ 5.19. SLang_load_file
+
+ Synopsis
+ Load a file into the interpreter
+
+ Usage
+ int SLang_load_file (char *fn)
+
+ Description
+ The SLang_load_file function opens the file whose name is
+ specified by fn and feeds it to the interpreter, line by line,
+ for execution. If fn is NULL, the function will take input from
+ stdin.
+
+ If no error occurs, it returns 0; otherwise, it returns -1, and
+ sets SLang_Error accordingly. For example, if it fails to open
+ the file, it will return -1 with SLang_Error set to
+ SL_OBJ_NOPEN.
+
+ Notes
+ If the hook SLang_Load_File_Hook declared as
+
+ int (*SLang_Load_File_Hook)(char *);
+
+ is non-NULL, the function point to by it will be used to load the
+ file. For example, the jed editor uses this hook to load files via
+ its own routines.
+
+ See Also
+ SLang_load_object, SLang_load_string
+
+ 5.20. SLang_restart
+
+ Synopsis
+ Reset the interpreter after an error
+
+ Usage
+ void SLang_restart (int full)
+
+ Description
+ The SLang_restart function should be called by the application
+ at top level if an error occurs. If the parameter full is non-
+ zero, any objects on the S-Lang run time stack will be removed
+ from the stack; otherwise, the stack will be left intact. Any
+ time the stack is believed to be trashed, this routine should be
+ called with a non-zero argument (e.g., if setjmp/longjmp is
+ called).
+
+ Calling SLang_restart does not reset the global variable
+ SLang_Error to zero. It is up to the application to reset that
+ variable to zero after calling SLang_restart.
+
+ Example
+
+ while (1)
+ {
+ if (SLang_Error)
+ {
+ SLang_restart (1);
+ SLang_Error = 0;
+ }
+ (void) SLang_load_file (NULL);
+ }
+
+ See Also
+ SLang_init_slang, SLang_load_file
+
+ 5.21. SLang_byte_compile_file
+
+ Synopsis
+ Byte-compile a file for faster loading
+
+ Usage
+ int SLang_byte_compile_file(char *fn, int reserved)
+
+ Description
+ The SLang_byte_compile_file function ``byte-compiles'' the file
+ fn for faster loading by the interpreter. This produces a new
+ file whose filename is equivalent to the one specified by fn,
+ except that a 'c' is appended to the name. For example, if fn is
+ set to init.sl, then the new file will have the name init.slc.
+ The meaning of the second parameter, reserved, is reserved for
+ future use. For now, set it to 0.
+
+ The function returns zero upon success, or -1 upon error and
+ sets SLang_Error accordingly.
+
+ See Also
+ SLang_load_file, SLang_init_slang
+
+ 5.22. SLang_autoload
+
+ Synopsis
+ Autoload a function from a file
+
+ Usage
+ int SLang_autoload(char *funct, char *filename)
+
+ Description
+ The SLang_autoload function may be used to associate a slang
+ function name funct with the file filename such that if funct
+ has not already been defined when needed, it will be loaded from
+ filename.
+
+ SLang_autoload has no effect if funct has already been defined.
+ Otherwise it declares funct as a user-defined S-Lang function.
+ It returns 0 upon success, or -1 upon error.
+
+ See Also
+ SLang_load_file, SLang_is_defined
+
+ 5.23. SLang_load_string
+
+ Synopsis
+ Interpret a string
+
+ Usage
+ int SLang_load_string(char *str)
+
+ Description
+ The SLang_load_string function feeds the string specified by str
+ to the interpreter for execution. It returns zero upon success,
+ or -1 upon failure.
+
+ See Also
+ SLang_load_file, SLang_load_object
+
+ 5.24. SLdo_pop
+
+ Synopsis
+ Delete an object from the stack
+
+ Usage
+ int SLdo_pop(void)
+
+ Description
+ This function removes an object from the top of the interpeter's
+ run-time stack and frees any memory associated with it. It
+ returns zero upon success, or -1 upon error (most likely due to
+ a stack-underflow).
+
+ See Also
+ SLdo_pop_n, SLang_pop_integer, SLang_pop_string
+
+ 5.25. SLdo_pop_n
+
+ Synopsis
+ Delete n objects from the stack
+
+ Usage
+ int SLdo_pop_n (unsigned int n)
+
+ Description
+ The SLdo_pop_n function removes the top n objects from the
+ interpreter's run-time stack and frees all memory associated
+ with the objects. It returns zero upon success, or -1 upon error
+ (most likely due to a stack-underflow).
+
+ See Also
+ SLdo_pop, SLang_pop_integer, SLang_pop_string
+
+ 5.26. SLang_pop_integer
+
+ Synopsis
+ Pop an integer off the stack
+
+ Usage
+ int SLang_pop_integer (int *i)
+
+ Description
+ The SLang_pop_integer function removes an integer from the top
+ of the interpreter's run-time stack and returns its value via
+ the pointer i. If successful, it returns zero. However, if the
+ top stack item is not of type SLANG_INT_TYPE, or the stack is
+ empty, the function will return -1 and set SLang_Error
+ accordingly.
+
+ See Also
+ SLang_push_integer, SLang_pop_double
+
+ 5.27. SLpop_string
+
+ Synopsis
+ Pop a string from the stack
+
+ Usage
+ int SLpop_string (char **strptr);
+
+ Description
+ The SLpop_string function pops a string from the stack and
+ returns it as a malloced pointer. It is up to the calling
+ routine to free this string via a call to free or SLfree. If
+ successful, SLpop_string returns zero. However, if the top stack
+ item is not of type SLANG_STRING_TYPE, or the stack is empty,
+ the function will return -1 and set SLang_Error accordingly.
+
+ Example
+
+ define print_string (void)
+ {
+ char *s;
+ if (-1 == SLpop_string (&s))
+ return;
+ fputs (s, stdout);
+ SLfree (s);
+ }
+
+ Notes
+ This function should not be confused with SLang_pop_slstring,
+ which pops a hashed string from the stack.
+
+ See Also
+ SLang_pop_slstring. SLfree
+
+ 5.28. SLang_pop_string
+
+ Synopsis
+ Pop a string from the stack
+
+ Usage
+ int SLang_pop_string(char **strptr, int *do_free)
+
+ Description
+ The SLpop_string function pops a string from the stack and
+ returns it as a malloced pointer via strptr. After the function
+ returns, the integer pointed to by the second parameter will be
+ set to a non-zero value if *strptr should be freed via free or
+ SLfree. If successful, SLpop_string returns zero. However, if
+ the top stack item is not of type SLANG_STRING_TYPE, or the
+ stack is empty, the function will return -1 and set SLang_Error
+ accordingly.
+
+ Notes
+ This function is considered obsolete and should not be used by
+ applications. If one requires a malloced string for
+ modification, SLpop_string should be used. If one requires a
+ constant string that will not be modifed by the application,
+ SLang_pop_slstring should be used.
+
+ See Also
+ SLang_pop_slstring, SLpop_string
+
+ 5.29. SLang_pop_slstring
+
+ Synopsis
+ Pop a hashed string from the stack
+
+ Usage
+ int SLang_pop_slstring (char **s_ptr)
+
+ Description
+ The SLang_pop_slstring function pops a hashed string from the S-
+ Lang run-time stack and returns it via s_ptr. It returns zero if
+ successful, or -1 upon failure. The resulting string should be
+ freed via a call to SLang_free_slstring after use.
+
+ Example
+
+ void print_string (void)
+ {
+ char *s;
+ if (-1 == SLang_pop_slstring (&s))
+ return;
+ fprintf (stdout, "%s\n", s);
+ SLang_free_slstring (s);
+ }
+
+ Notes
+ SLang_free_slstring is the preferred function for popping
+ strings. This is a result of the fact that the interpreter uses
+ hashed strings as the native representation for string data.
+
+ One must never free a hashed string using free or SLfree. In
+ addition, one must never make any attempt to modify a hashed
+ string and doing so will result in memory corruption.
+
+ See Also
+ SLang_free_slstring, SLpop_string
+
+ 5.30. SLang_pop_double
+
+ Synopsis
+ Pop a double from the stack
+
+ Usage
+ int SLang_pop_double (double *dptr)
+
+ Description
+ The SLang_pop_double function pops a double precision number
+ from the stack and returns it via dptr. This function returns 0
+ upon success, otherwise it returns -1 and sets SLang_Error
+ accordingly.
+
+ See Also
+ SLang_pop_integer, SLang_push_double
+
+ 5.31. SLang_pop_complex
+
+ Synopsis
+ Pop a complex number from the stack
+
+ Usage
+ int SLang_pop_complex (double *re, double *im)
+
+ Description
+ SLang_pop_complex pops a complex number from the stack and
+ returns it via the parameters re and im as the real and
+ imaginary parts of the complex number, respectively. This
+ function automatically converts objects of type
+ SLANG_DOUBLE_TYPE and SLANG_INT_TYPE to SLANG_COMPLEX_TYPE, if
+ necessary. It returns zero upon success, or -1 upon error
+ setting SLang_Error accordingly.
+
+ See Also
+ SLang_pop_integer, SLang_pop_double, SLang_push_complex
+
+ 5.32. SLang_push_complex
+
+ Synopsis
+ Push a complex number onto the stack
+
+ Usage
+ int SLang_push_complex (double re, double im)
+
+ Description
+ SLang_push_complex may be used to push the complex number whose
+ real and imaginary parts are given by re and im, respectively.
+ It returns zero upon success, or -1 upon error setting
+ SLang_Error accordingly.
+
+ See Also
+ SLang_pop_complex, SLang_push_double
+
+ 5.33. SLang_push_double
+
+ Synopsis
+ Push a double onto the stack
+
+ Usage
+ int SLang_push_double(double d)
+
+ Description
+ SLang_push_double may be used to push the double precision
+ floating point number d onto the interpreter's run-time stack.
+ It returns zero upon success, or -1 upon error setting
+ SLang_Error accordingly.
+
+ See Also
+ SLang_pop_double, SLang_push_integer
+
+ 5.34. SLang_push_string
+
+ Synopsis
+ Push a string onto the stack
+
+ Usage
+ int SLang_push_string (char *s)
+
+ Description
+ SLang_push_string pushes a copy of the string specified by s
+ onto the interpreter's run-time stack. It returns zero upon
+ success, or -1 upon error setting SLang_Error accordingly.
+
+ Notes
+ If s is NULL, this function pushes NULL (SLANG_NULL_TYPE) onto
+ the stack.
+
+ See Also
+ SLang_push_malloced_string
+
+ 5.35. SLang_push_integer
+
+ Synopsis
+ Push an integer onto the stack
+
+ Usage
+ int SLang_push_integer (int i)
+
+ Description
+ SLang_push_integer the integer i onto the interpreter's run-time
+ stack. It returns zero upon success, or -1 upon error setting
+ SLang_Error accordingly.
+
+ See Also
+ SLang_pop_integer, SLang_push_double, SLang_push_string
+
+ 5.36. SLang_push_malloced_string
+
+ Synopsis
+ Push a malloced string onto the stack
+
+ Usage
+ int SLang_push_malloced_string (char *s);
+
+ Description
+ SLang_push_malloced_string may be used to push a malloced string
+ onto the interpreter's run-time stack. It returns zero upon
+ success, or -1 upon error setting SLang_Error accordingly.
+
+ Example
+ The following example illustrates that it is up to the calling
+ routine to free the string if SLang_push_malloced_string fails:
+
+ int push_hello (void)
+ {
+ char *s = malloc (6);
+ if (s == NULL) return -1;
+ strcpy (s, "hello");
+ if (-1 == SLang_push_malloced_string (s))
+ {
+ free (s);
+ return -1;
+ }
+ return 0;
+ }
+
+ Example
+ The function SLang_create_slstring returns a hashed string.
+ Such a string may not be malloced and should not be passed to
+ SLang_push_malloced_string.
+
+ Notes
+ If s is NULL, this function pushes NULL (SLANG_NULL_TYPE) onto
+ the stack.
+
+ See Also
+ SLang_push_string, SLmake_string
+
+ 5.37. SLang_is_defined
+
+ Synopsis
+ Check to see if the interpreter defines an object
+
+ Usage
+ int SLang_is_defined (char *nm)
+
+ Description
+ The SLang_is_defined function may be used to determine whether
+ or not a variable or function whose name is given by em has been
+ defined. It returns zero if no such object has been defined.
+ Otherwise it returns a non-zero value according to the following
+ table:
+
+ 1 intrinsic function
+ 2 user-defined slang function
+ -1 intrinsic variable
+ -2 user-defined global variable
+
+ Note that variables correspond to negative numbers and functions
+ are represented by positive numbers.
+
+ See Also
+ SLadd_intrinsic_function, SLang_run_hooks,
+ SLang_execute_function
+
+ 5.38. SLang_run_hooks
+
+ Synopsis
+ Run a user-defined hook with arguments
+
+ Usage
+ int SLang_run_hooks (char *fname, unsigned int n, ...)
+
+ Description
+ The SLang_run_hooks function may be used to execute a user-
+ defined function named fname. Before execution of the function,
+ the n string arguments specified by the variable parameter list
+ are pushed onto the stack. If the function fname does not exist,
+ SLang_run_hooks returns zero; otherwise, it returns 1 upon
+ successful execution of the function, or -1 if an error
+ occurred.
+
+ Example
+ The jed editor uses SLang_run_hooks to setup the mode of a
+ buffer based on the filename extension of the file associated
+ with the buffer:
+
+ char *ext = get_filename_extension (filename);
+ if (ext == NULL) return -1;
+ if (-1 == SLang_run_hooks ("mode_hook", 1, ext))
+ return -1;
+ return 0;
+
+ See Also
+ SLang_is_defined, SLang_execute_function
+
+ 5.39. SLang_execute_function
+
+ Synopsis
+ Execute a user or intrinsic function
+
+ Usage
+ int SLang_execute_function (char *fname)
+
+ Description
+ This function may be used to execute either a user-defined
+ function or an intrinisic function. The name of the function is
+ specified by fname. It returns zero if fname is not defined, or
+ 1 if the function was successfully executed, or -1 upon error.
+
+ Notes
+ The function SLexecute_function may be a better alternative for
+ some uses.
+
+ See Also
+ SLang_run_hooks, SLexecute_function, SLang_is_defined
+
+ 5.40. SLang_get_function
+
+ Synopsis
+ Get a pointer to a S-Lang function
+
+ Usage
+ SLang_Name_Type *SLang_get_function (char *fname)
+
+ Description
+ This function returns a pointer to the internal S-Lang table
+ entry of a function whose name is given by fname. It returns
+ NULL upon failure. The value returned by this function can be
+ used SLexecute_function to call the function directly from C.
+
+ See Also
+ SLexecute_function
+
+ 5.41. SLexecute_function
+
+ Synopsis
+ Execute a S-Lang or intrinsic function
+
+ Usage
+ int SLexecute_function (SLang_Name_Type *nt)
+
+ Description
+ The SLexecute_function allows an application to call the S-Lang
+ function specified by the SLang_Name_Type pointer nt. This
+ parameter must be non NULL and must have been previously
+ obtained by a call to SLang_get_function.
+
+ Example
+ Consider the S-Lang function:
+
+ define my_fun (x)
+ {
+ return x^2 - 2;
+ }
+
+ Suppose that it is desired to call this function many times with
+ different values of x. There are at least two ways to do this. The
+ easiest way is to use SLang_execute_function by passing the string
+ "my_fun". A better way that is much faster is to use SLexe-
+ cute_function:
+
+ int sum_a_function (char *fname, double *result)
+ {
+ double sum, x, y;
+ SLang_Name_Type *nt;
+
+ if (NULL == (nt = SLang_get_function (fname)))
+ return -1;
+
+ sum = 0;
+ for (x = 0; x < 10.0; x += 0.1)
+ {
+ SLang_start_arg_list ();
+ if (-1 == SLang_push_double (x))
+ return -1;
+ SLang_end_arg_list ();
+ if (-1 == SLexecute_function (nt))
+ return -1;
+ if (-1 == SLang_pop_double (&y))
+ return -1;
+
+ sum += y;
+ }
+ return sum;
+ }
+
+ Although not necessary in this case, SLang_start_arg_list and
+ SLang_end_arg_list were used to provide the function with informa-
+ tion about the number of parameters passed to it.
+
+ See Also
+ SLang_get_function, SLang_start_arg_list, SLang_end_arg_list
+
+ 5.42. SLang_peek_at_stack
+
+ Synopsis
+ Find the type of object on the top of the stack
+
+ Usage
+ int SLang_peek_at_stack (void)
+
+ Description
+ The SLang_peek_at_stack function is useful for determining the
+ data type of the object at the top of the stack. It returns the
+ data type, or -1 upon a stack-underflow error. It does not
+ remove anything from the stack.
+
+ See Also
+ SLang_pop_string, SLang_pop_integer
+
+ 5.43. SLang_pop_fileptr
+
+ Synopsis
+ Pop a file pointer
+
+ Usage
+ int SLang_pop_fileptr (SLang_MMT_Type **mmt, FILE **fp)
+
+ Description
+ SLang_pop_fileptr pops a file pointer from the S-Lang run-time
+ stack. It returns zero upon success, or -1 upon failure.
+
+ A S-Lang file pointer (SLANG_FILEPTR_TYPE) is actually a memory
+ managed object. For this reason, SLang_pop_fileptr also returns
+ the memory managed object via the argument list. It is up to the
+ calling routine to call SLang_free_mmt to free the object.
+
+ Example
+ The following example illustrates an application defined
+ intrinsic function that writes a user defined double precision
+ number to a file. Note the use of SLang_free_mmt:
+
+ int write_double (void)
+ {
+ double t;
+ SLang_MMT_Type *mmt;
+ FILE *fp;
+ int status;
+
+ if (-1 == SLang_pop_double (&d, NULL, NULL))
+ return -1;
+ if (-1 == SLang_pop_fileptr (&mmt, &fp))
+ return -1;
+
+ status = fwrite (&d, sizeof (double), 1, fp);
+ SLang_free_mmt (mmt);
+ return status;
+ }
+
+ This function can be used by a S-Lang function as follows:
+
+ define write_some_values ()
+ {
+ variable fp, d;
+
+ fp = fopen ("myfile.dat", "wb");
+ if (fp == NULL)
+ error ("file failed to open");
+ for (d = 0; d < 10.0; d += 0.1)
+ {
+ if (-1 == write_double (fp, d))
+ error ("write failed");
+ }
+ if (-1 == fclose (fp))
+ error ("fclose failed");
+ }
+
+ See Also
+ SLang_free_mmt, SLang_pop_double
+
+ 5.44. SLadd_intrinsic_function
+
+ Synopsis
+ Add a new intrinsic function to the interpreter
+
+ Usage
+ int SLadd_intrinsic_function (name, f, type, nargs, ...)
+
+ char *name
+ FVOID_STAR f
+ SLtype type
+ unsigned int nargs
+
+ Description
+ The SLadd_intrinsic_function function may be used to add a new
+ intrinsic function. The S-Lang name of the function is specified
+ by name and the actual function pointer is given by f, cast to
+ FVOID_STAR. The third parameter, type specifies the return type
+ of the function and must be one of the following values:
+
+ SLANG_VOID_TYPE (returns nothing)
+ SLANG_INT_TYPE (returns int)
+ SLANG_DOUBLE_TYPE (returns double)
+ SLANG_STRING_TYPE (returns char *)
+
+ The nargs parameter specifies the number of parameters to pass to
+ the function. The variable argument list following nargs must con-
+ sists of nargs integers which specify the data type of each argu-
+ ment.
+
+ The function returns zero upon success or -1 upon failure.
+
+ Example
+ The jed editor uses this function to change the system intrinsic
+ function to the following:
+
+ static int jed_system (char *cmd)
+ {
+ if (Jed_Secure_Mode)
+ {
+ msg_error ("Access denied.");
+ return -1;
+ }
+ return SLsystem (cmd);
+ }
+
+ After initializing the interpreter with SLang_init_slang, jed calls
+ SLadd_intrinsic_function to substitute the above definition for the
+ default S-Lang definition:
+
+ if (-1 == SLadd_intrinsic_function ("system", (FVOID_STAR)jed_system,
+ SLANG_INT_TYPE, 1,
+ SLANG_STRING_TYPE))
+ return -1;
+
+ See Also
+ SLadd_intrinsic_variable, SLadd_intrinsic_array
+
+ 5.45. SLadd_intrinsic_variable
+
+ Synopsis
+ Add an intrinsic variable to the interpreter
+
+ Usage
+ int SLadd_intrinsic_variable (name, addr, type, rdonly)
+
+ char *name
+ VOID_STAR addr
+ SLtype type
+ int rdonly
+
+ Description
+ The SLadd_intrinsic_variable function adds an intrinsic variable
+ called name to the interpeter. The second parameter addr
+ specifies the address of the variable (cast to VOID_STAR). The
+ third parameter, type, specifies the data type of the variable.
+ If the fourth parameter, rdonly, is non-zero, the variable will
+ interpreted by the interpreter as read-only.
+
+ If successful, SLadd_intrinsic_variable returns zero, otherwise
+ it returns -1.
+
+ Example
+ Suppose that My_Global_Int is a global variable (at least not a
+ local one):
+
+ int My_Global_Int;
+
+ It can be added to the interpreter via the function call
+
+ if (-1 == SLadd_intrinsic_variable ("MyGlobalInt",
+ (VOID_STAR)&My_Global_Int,
+ SLANG_INT_TYPE, 0))
+ exit (1);
+
+ Notes
+ The current implementation requires all pointer type intrinsic
+ variables to be read-only. For example,
+
+ char *My_Global_String;
+
+ is of type SLANG_STRING_TYPE, and must be declared as read-only.
+ Finally, not that
+
+ char My_Global_Char_Buf256;
+
+ is not a SLANG_STRING_TYPE object. This difference is very impor-
+ tant because internally the interpreter dereferences the address
+ passed to it to get to the value of the variable.
+
+ See Also
+ SLadd_intrinsic_function, SLadd_intrinsic_array
+
+ 5.46. SLclass_add_unary_op
+
+ Synopsis
+ ??
+
+ Usage
+ int SLclass_add_unary_op (SLtype,int (*) (int, SLtype,
+ VOID_STAR, unsigned int, VOID_STAR), int (*) (int, SLtype,
+ SLtype *));
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 5.47. SLclass_add_app_unary_op
+
+ Synopsis
+ ??
+
+ Usage
+ int SLclass_add_app_unary_op (SLtype, int (*) (int,SLtype,
+ VOID_STAR, unsigned int,VOID_STAR),int (*) (int, SLtype, SLtype
+ *));
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 5.48. SLclass_add_binary_op
+
+ Synopsis
+ ??
+
+ Usage
+ int SLclass_add_binary_op (SLtype, SLtype,int (*)(int, SLtype,
+ VOID_STAR, unsigned int,SLtype, VOID_STAR, unsigned
+ int,VOID_STAR),int (*) (int, SLtype, SLtype, SLtype *));
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 5.49. SLclass_add_math_op
+
+ Synopsis
+ ??
+
+ Usage
+ int SLclass_add_math_op (SLtype,int (*)(int,SLtype, VOID_STAR,
+ unsigned int,VOID_STAR),int (*)(int, SLtype, SLtype *));
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 5.50. SLclass_add_typecast
+
+ Synopsis
+ ??
+
+ Usage
+ int SLclass_add_typecast (SLtype, SLtype int (*)_PROTO((SLtype,
+ VOID_STAR, unsigned int,SLtype, VOID_STAR)),int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 6. Library Initialization Functions
+
+ 6.1. SLang_init_slang
+
+ Synopsis
+ Initialize the interpreter
+
+ Usage
+ int SLang_init_slang (void)
+
+ Description
+ The SLang_init_slang function must be called by all applications
+ that use the S-Lang interpreter. It initializes the interpreter,
+ defines the built-in data types, and adds a set of core
+ intrinsic functions.
+
+ The function returns 0 upon success, or -1 upon failure.
+
+ See Also
+ SLang_init_slfile, SLang_init_slmath, SLang_init_slunix
+
+ 6.2. SLang_init_slfile
+
+ Synopsis
+ Initialize the interpreter file I/O intrinsics
+
+ Usage
+ int SLang_init_slfile (void)
+
+ Description
+ This function initializes the interpreters file I/O intrinsic
+ functions. This function adds intrinsic functions such as fopen,
+ fclose, and fputs to the interpreter. It returns 0 if
+ successful, or -1 upon error.
+
+ Notes
+ Before this function can be called, it is first necessary to
+ call SLang_init_slang. It also adds the preprocessor symbol
+ __SLFILE__ to the interpreter.
+
+ See Also
+ SLang_init_slang, SLang_init_slunix, SLang_init_slmath
+
+ 6.3. SLang_init_slmath
+
+ Synopsis
+ Initialize the interpreter math intrinsics
+
+ Usage
+ int SLang_init_slmath (void)
+
+ Description
+ The SLang_init_slmath function initializes the interpreter's
+ mathematical intrinsic functions and makes them available to the
+ language. The intrinsic functions include sin, cos, tan, etc...
+ It returns 0 if successful, or -1 upon failure.
+
+ Notes
+ This function must be called after SLang_init_slang. It adds the
+ preprocessor symbol __SLMATH__ to the interpreter.
+
+ See Also
+ SLang_init_slang, SLang_init_slfile, SLang_init_slunix
+
+ 6.4. SLang_init_slunix
+
+ Synopsis
+ Make available some unix system calls to the interpreter
+
+ Usage
+ int SLang_init_slunix (void)
+
+ Description
+ The SLang_init_slunix function initializes the interpreter's
+ unix system call intrinsic functions and makes them available to
+ the language. Examples of functions made available by
+ SLang_init_slunix include chmod, chown, and stat_file. It
+ returns 0 if successful, or -1 upon failure.
+
+ Notes
+ This function must be called after SLang_init_slang. It adds the
+ preprocessor symbol __SLUNIX__ to the interpreter.
+
+ See Also
+ SLang_init_slang, SLang_init_slfile, SLang_init_slmath
+
+ 7. Miscellaneous Functions
+
+ 7.1. SLcurrent_time_string
+
+ Synopsis
+ Get the current time as a string
+
+ Usage
+ char *SLcurrent_time_string (void)
+
+ Description
+ The SLcurrent_time_string function uses the C library function
+ ctime to obtain a string representation of the current date and
+ time in the form
+
+ "Wed Dec 10 12:50:28 1997"
+
+ However, unlike the ctime function, a newline character is not
+ present in the string.
+
+ The returned value points to a statically allocated memory block
+ which may get overwritten on subsequent function calls.
+
+ See Also
+ SLmake_string
+
+ 7.2. SLatoi
+
+ Synopsis
+ Convert a text string to an integer
+
+ Usage
+ int SLatoi(unsigned char *str
+
+ Description
+ SLatoi parses the string str to interpret it as an integer
+ value. Unlike atoi, SLatoi can also parse strings containing
+ integers expressed in hexidecimal (e.g., "0x7F") and octal
+ (e.g., "012".) notation.
+
+ See Also
+ SLang_guess_type
+
+ 7.3. SLextract_list_element
+
+ Synopsis
+ Extract a substring of a delimited string
+
+ Usage
+ int SLextract_list_element (dlist, nth, delim, buf, buflen)
+
+ char *dlist;
+ unsigned int nth;
+ char delim;
+ char *buf;
+ unsigned int buflen;
+
+ Description
+ SLextract_list_element may be used to obtain the nth element of
+ a list of strings, dlist, that are delimited by the character
+ delim. The routine copies the nth element of dlist to the buffer
+ buf whose size is buflen characters. It returns zero upon
+ success, or -1 if dlist does not contain an nth element.
+
+ Example
+ A delimited list of strings may be turned into an array of
+ strings as follows. For conciseness, all malloc error checking
+ has been omitted.
+
+ int list_to_array (char *list, char delim, char ***ap)
+ {
+ unsigned int nth;
+ char **a;
+ char buf1024;
+
+ /* Determine the size of the array */
+ nth = 0;
+ while (0 == SLextract_list_element (list, nth, delim, buf, sizeof(buf)))
+ nth++;
+
+ ap = (char **) SLmalloc ((nth + 1) * sizeof (char **));
+ nth = 0;
+ while (0 == SLextract_list_element (list, nth, delim, buf, sizeof(buf)))
+ {
+ anth = SLmake_string (buf);
+ nth++;
+ }
+ anth = NULL;
+ *ap = a;
+ return 0;
+ }
+
+ See Also
+ SLmalloc, SLmake_string
+
+ 8. Error and Messaging Functions
+
+ 8.1. SLang_verror
+
+ Synopsis
+ Signal an error with a message
+
+ Usage
+ void SLang_verror (int code, char *fmt, ...);
+
+ Description
+ The SLang_verror function sets SLang_Error to code if
+ SLang_Error is 0. It also displays the error message implied by
+ the printf variable argument list using fmt as the format.
+
+ Example
+
+ FILE *open_file (char *file)
+ {
+ char *file = "my_file.dat";
+ if (NULL == (fp = fopen (file, "w")))
+ SLang_verror (SL_INTRINSIC_ERROR, "Unable to open %s", file);
+ return fp;
+ }
+
+ See Also
+ SLang_vmessage, SLang_exit_error
+
+ 8.2. SLang_doerror
+
+ Synopsis
+ Signal an error
+
+ Usage
+ void SLang_doerror (char *err_str)
+
+ Description
+ The SLang_doerror function displays the string err_str to the
+ error device and signals a S-Lang error.
+
+ Notes
+ SLang_doerror is considered to obsolete. Applications should use
+ the SLang_verror function instead.
+
+ See Also
+ SLang_verror, SLang_exit_error
+
+ 8.3. SLang_vmessage
+
+ Synopsis
+ Display a message to the message device
+
+ Usage
+ void SLang_vmessage (char *fmt, ...)
+
+ Description
+ This function prints a printf style formatted variable argument
+ list to the message device. The default message device is
+ stdout.
+
+ See Also
+ SLang_verror
+
+ 8.4. SLang_exit_error
+
+ Synopsis
+ Exit the program and display an error message
+
+ Usage
+ void SLang_exit_error (char *fmt, ...)
+
+ Description
+ The SLang_exit_error function terminates the program and
+ displays an error message using a printf type variable argument
+ list. The default behavior to this function is to write the
+ message to stderr and exit with the exit system call.
+
+ If the function pointer SLang_Exit_Error_Hook is non-NULL, the
+ function to which it points will be called. This permits an
+ application to perform whatever cleanup is necessary. This hook
+ has the prototype:
+
+ void (*SLang_Exit_Error_Hook)(char *, va_list);
+
+ See Also
+ SLang_verror, exit
+
+ 9. String and Memory Allocation Functions
+
+ 9.1. SLmake_string
+
+ Synopsis
+ Duplicate a string
+
+ Usage
+ char *SLmake_string (char *s)
+
+ Description
+ The SLmake_string function creates a new copy of the string s,
+ via malloc, and returns it. Upon failure it returns NULL. Since
+ the resulting string is malloced, it should be freed when
+ nolonger needed via a call to either free or SLfree.
+
+ Notes
+ SLmake_string should not be confused with the function
+ SLang_create_slstring, which performs a similar function.
+
+ See Also
+ SLmake_nstring, SLfree, SLmalloc, SLang_create_slstring
+
+ 9.2. SLmake_nstring
+
+ Synopsis
+ Duplicate a substring
+
+ Usage
+ char *SLmake_nstring (char *s, unsigned int n)
+
+ Description
+ This function is like SLmake_string except that it creates a
+ null terminated string formed from the first n characters of s.
+ Upon failure, it returns NULL, otherwise it returns the new
+ string. When nolonger needed, the returned string should be
+ freed with SLfree.
+
+ See Also
+ SLmake_string, SLfree, SLang_create_nslstring
+
+ 9.3. SLang_create_nslstring
+
+ Synopsis
+ Created a hashed substring
+
+ Usage
+ char *SLang_create_nslstring (char *s, unsigned int n)
+
+ Description
+ SLang_create_nslstring is like SLang_create_slstring except that
+ only the first n characters of s are used to create the hashed
+ string. Upon error, it returns NULL, otherwise it returns the
+ hashed substring. Such a string must be freed by the function
+ SLang_free_slstring.
+
+ Notes
+ Do not use free or SLfree to free the string returned by
+ SLang_create_slstring or SLang_create_nslstring. Also it is
+ important that no attempt is made to modify the hashed string
+ returned by either of these functions. If one needs to modify a
+ string, the functions SLmake_string or SLmake_nstring should be
+ used instead.
+
+ See Also
+ SLang_free_slstring, SLang_create_slstring, SLmake_nstring
+
+ 9.4. SLang_create_slstring
+
+ Synopsis
+ Create a hashed string
+
+ Usage
+ char *SLang_create_slstring (char *s)
+
+ Description
+ The SLang_create_slstring creates a copy of s and returns it as
+ a hashed string. Upon error, the function returns NULL,
+ otherwise it returns the hashed string. Such a string must only
+ be freed via the SLang_free_slstring function.
+
+ Notes
+ Do not use free or SLfree to free the string returned by
+ SLang_create_slstring or SLang_create_nslstring. Also it is
+ important that no attempt is made to modify the hashed string
+ returned by either of these functions. If one needs to modify a
+ string, the functions SLmake_string or SLmake_nstring should be
+ used instead.
+
+ See Also
+ SLang_free_slstring, SLang_create_nslstring, SLmake_string
+
+ 9.5. SLang_free_slstring
+
+ Synopsis
+ Free a hashed string
+
+ Usage
+ void SLang_free_slstring (char *s)
+
+ Description
+ The SLang_free_slstring function is used to free a hashed string
+ such as one returned by SLang_create_slstring,
+ SLang_create_nslstring, or SLang_create_static_slstring. If s
+ is NULL, the routine does nothing.
+
+ See Also
+ SLang_create_slstring, SLang_create_nslstring,
+ SLang_create_static_slstring
+
+ 9.6. SLang_concat_slstrings
+
+ Synopsis
+ Concatenate two strings to produce a hashed string
+
+ Usage
+ char *SLang_concat_slstrings (char *a, char *b)
+
+ Description
+ The SLang_concat_slstrings function concatenates two strings, a
+ and b, and returns the result as a hashed string. Upon failure,
+ NULL is returned.
+
+ Notes
+ A hashed string can only be freed using SLang_free_slstring.
+ Never use free or SLfree to free a hashed string, otherwise
+ memory corruption will result.
+
+ See Also
+ SLang_free_slstring, SLang_create_slstring
+
+ 9.7. SLang_create_static_slstring
+
+ Synopsis
+ Create a hashed string
+
+ Usage
+ char *SLang_create_static_slstring (char *s_literal)
+
+ Description
+ The SLang_create_static_slstring creates a hashed string from
+ the string literal s_literal and returns the result. Upon
+ failure it returns NULL.
+
+ Example
+
+ char *create_hello (void)
+ {
+ return SLang_create_static_slstring ("hello");
+ }
+
+ Notes
+ This function should only be used with string literals.
+
+ See Also
+ SLang_create_slstring, SLang_create_nslstring
+
+ 9.8. SLmalloc
+
+ Synopsis
+ Allocate some memory
+
+ Usage
+ char *SLmalloc (unsigned int nbytes)
+
+ Description
+ This function uses malloc to allocate nbytes of memory. Upon
+ error it returns NULL; otherwise it returns a pointer to the
+ allocated memory. One should use SLfree to free the memory after
+ use.
+
+ See Also
+ SLfree, SLrealloc, SLcalloc
+
+ 9.9. SLcalloc
+
+ Synopsis
+ Allocate some memory
+
+ Usage
+ char *SLcalloc (unsigned int num_elem, unsigned int elem_size)
+
+ Description
+ This function uses calloc to allocate memory for num_elem
+ objects with each of size elem_size and returns the result. In
+ addition, the newly allocated memory is zeroed. Upon error it
+ returns NULL; otherwise it returns a pointer to the allocated
+ memory. One should use SLfree to free the memory after use.
+
+ See Also
+ SLmalloc, SLrealloc, SLfree
+
+ 9.10. SLfree
+
+ Synopsis
+ Free some allocated memory
+
+ Usage
+ void SLfree (char *ptr)
+
+ Description
+ The SLfree function deallocates the memory specified by ptr,
+ which may be NULL in which case the function does nothing.
+
+ Notes
+ Never use this function to free a hashed string returned by one
+ of the family of slstring functions, e.g., SLang_pop_slstring.
+
+ See Also
+ SLmalloc, SLcalloc, SLrealloc, SLmake_string
+
+ 9.11. SLrealloc
+
+ Synopsis
+ Resize a dynamic memory block
+
+ Usage
+ char *SLrealloc (char *ptr, unsigned int new_size)
+
+ Description
+ The SLrealloc uses the realloc function to resize the memory
+ block specified by ptr to the new size new_size. If ptr is
+ NULL, the function call is equivalent to SLmalloc(new_size).
+ Similarly, if new_size is zero, the function call is equivalent
+ to SLfree(ptr).
+
+ If the function fails, or if new_size is zero, NULL is returned.
+ Otherwise a pointer is returned to the (possibly moved) new
+ block of memory.
+
+ See Also
+ SLfree, SLmalloc, SLcalloc
+
+ 10. Keyboard Input Functions
+
+ 10.1. SLang_init_tty
+
+ Synopsis
+ Initialize the terminal keyboard interface
+
+ Usage
+ int SLang_init_tty (int intr_ch, int no_flow_ctrl, int opost)
+
+ Description
+ SLang_init_tty initializes the terminal for single character
+ input. If the first parameter intr_ch is in the range 0-255, it
+ will be used as the interrupt character, e.g., under Unix this
+ character will generate a SIGINT signal. Otherwise, if it is -1,
+ the interrupt character will be left unchanged.
+
+ If the second parameter no_flow_ctrl is non-zero, flow control
+ (XON/XOFF) processing will be enabled.
+
+ If the last parmeter opost is non-zero, output processing by the
+ terminal will be enabled. If one intends to use this function in
+ conjunction with the S-Lang screen management routines (SLsmg),
+ this paramete shold be set to zero.
+
+ SLang_init_tty returns zero upon success, or -1 upon error.
+
+ Notes
+ Terminal I/O is a complex subject. The S-Lang interface presents
+ a simplification that the author has found useful in practice.
+ For example, the only special character processing that
+ SLang_init_tty enables is that of the SIGINT character, and the
+ generation of other signals via the keyboard is disabled.
+ However, generation of the job control signal SIGTSTP is
+ possible via the SLtty_set_suspend_state function.
+
+ Under Unix, the integer variable SLang_TT_Read_FD is used to
+ specify the input descriptor for the terminal. If
+ SLang_TT_Read_FD represents a terminal device as determined via
+ the isatty system call, then it will be used as the terminal
+ file descriptor. Otherwise, the terminal device /dev/tty will
+ used as the input device. The default value of SLang_TT_Read_FD
+ is -1 which causes /dev/tty to be used. So, if you prefer to use
+ stdin for input, then set SLang_TT_Read_FD to fileno(stdin)
+ before calling SLang_init_tty.
+
+ If the variable SLang_TT_Baud_Rate is zero when this function is
+ called, the function will attempt to determine the baud rate by
+ querying the terminal driver and set SLang_TT_Baud_Rate to that
+ value.
+
+ See Also
+ SLang_reset_tty, SLang_getkey, SLtty_set_suspend_state
+
+ 10.2. SLang_reset_tty
+
+ Synopsis
+ Reset the terminal
+
+ Usage
+ void SLang_reset_tty (void)
+
+ Description
+ SLang_reset_tty resets the terminal interface back to the state
+ it was in before SLang_init_tty was called.
+
+ See Also
+ SLang_init_tty
+
+ 10.3. SLtty_set_suspend_state
+
+ Synopsis
+ Enable or disable keyboard suspension
+
+ Usage
+ void SLtty_set_suspend_state (int s)
+
+ Description
+ The SLtty_set_suspend_state function may be used to enable or
+ disable keyboard generation of the SIGTSTP job control signal.
+ If s is non-zero, generation of this signal via the terminal
+ interface will be enabled, otherwise it will be disabled.
+
+ This function should only be called after the terminal driver
+ has be initialized via SLang_init_tty. The SLang_init_tty always
+ disables the generation of SIGTSTP via the keyboard.
+
+ See Also
+ SLang_init_tty
+
+ 10.4. SLang_getkey
+
+ Synopsis
+ Read a character from the keyboard
+
+ Usage
+ unsigned int SLang_getkey (void);
+
+ Description
+ The SLang_getkey reads a single character from the terminal and
+ returns it. The terminal must first be initialized via a call to
+ SLang_init_tty before this function can be called. Upon success,
+ SLang_getkey returns the character read from the terminal,
+ otherwise it returns SLANG_GETKEY_ERROR.
+
+ See Also
+ SLang_init_tty, SLang_input_pending, SLang_ungetkey
+
+ 10.5. SLang_ungetkey_string
+
+ Synopsis
+ Unget a key string
+
+ Usage
+ int SLang_ungetkey_string (unsigned char *buf, unsigned int n)
+
+ Description
+ The SLang_ungetkey_string function may be used to push the n
+ characters pointed to by buf onto the buffered input stream that
+ SLgetkey uses. If there is not enough room for the characters,
+ -1 is returned and none are buffered. Otherwise, it returns
+ zero.
+
+ Notes
+ The difference between SLang_buffer_keystring and
+ SLang_ungetkey_string is that the SLang_buffer_keystring appends
+ the characters to the end of the getkey buffer, whereas
+ SLang_ungetkey_string inserts the characters at the beginning of
+ the input buffer.
+
+ See Also
+ SLang_ungetkey, SLang_getkey
+
+ 10.6. SLang_buffer_keystring
+
+ Synopsis
+ Append a keystring to the input buffer
+
+ Usage
+ int SLang_buffer_keystring (unsigned char *b, unsigned int len)
+
+ Description
+ SLang_buffer_keystring places the len characters specified by b
+ at the end of the buffer that SLang_getkey uses. Upon success it
+ returns 0; otherwise, no characters are buffered and it returns
+ -1.
+
+ Notes
+ The difference between SLang_buffer_keystring and
+ SLang_ungetkey_string is that the SLang_buffer_keystring appends
+ the characters to the end of the getkey buffer, whereas
+ SLang_ungetkey_string inserts the characters at the beginning of
+ the input buffer.
+
+ See Also
+ SLang_getkey, SLang_ungetkey, SLang_ungetkey_string
+
+ 10.7. SLang_ungetkey
+
+ Synopsis
+ Push a character back onto the input buffer
+
+ Usage
+ int SLang_ungetkey (unsigned char ch)
+
+ Description
+ SLang_ungetkey pushes the character ch back onto the SLgetkey
+ input stream. Upon success, it returns zero, otherwise it
+ returns 1.
+
+ Example
+ This function is implemented as:
+
+ int SLang_ungetkey (unsigned char ch)
+ {
+ return SLang_ungetkey_string(&ch, 1);
+ }
+
+ See Also
+ SLang_getkey, SLang_ungetkey_string
+
+ 10.8. SLang_flush_input
+
+ Synopsis
+ Discard all keyboard input waiting to be read
+
+ Usage
+ void SLang_flush_input (void)
+
+ Description
+ SLang_flush_input discards all input characters waiting to be
+ read by the SLang_getkey function.
+
+ See Also
+ SLang_getkey
+
+ 10.9. SLang_input_pending
+
+ Synopsis
+ Check to see if input is pending
+
+ Usage
+ int SLang_input_pending (int tsecs)
+
+ Description
+ SLang_input_pending may be used to see if an input character is
+ available to be read without causing SLang_getkey to block. It
+ will wait up to tsecs tenths of a second if no characters are
+ immediately available for reading. If tsecs is less than zero,
+ then SLang_input_pending will wait -tsecs milliseconds for
+ input, otherwise tsecs represents 1/10 of a second intervals.
+
+ Notes
+ Not all systems support millisecond resolution.
+
+ See Also
+ SLang_getkey
+
+ 10.10. SLang_set_abort_signal
+
+ Synopsis
+ Set the signal to trap SIGINT
+
+ Usage
+ void SLang_set_abort_signal (void (*f)(int));
+
+ Description
+ SLang_set_abort_signal sets the function that gets triggered
+ when the user presses the interrupt key (SIGINT) to the function
+ f. If f is NULL the default handler will get installed.
+
+ Example
+ The default interrupt handler on a Unix system is:
+
+ static void default_sigint (int sig)
+ {
+ SLKeyBoard_Quit = 1;
+ if (SLang_Ignore_User_Abort == 0) SLang_Error = SL_USER_BREAK;
+ SLsignal_intr (SIGINT, default_sigint);
+ }
+
+ Notes
+ For Unix programmers, the name of this function may appear
+ misleading since it is associated with SIGINT and not SIGABRT.
+ The origin of the name stems from the original intent of the
+ function: to allow the user to abort the running of a S-Lang
+ interpreter function.
+
+ See Also
+ SLang_init_tty, SLsignal_intr
+
+ 11. Keymap Functions
+
+ 11.1. SLkm_define_key
+
+ Synopsis
+ Define a key in a keymap
+
+ Usage
+ int SLkm_define_key (char *seq, FVOID_STAR f, SLKeyMap_List_Type
+ *km)
+
+ Description
+ SLkm_define_key associates the key sequence seq with the
+ function pointer f in the keymap specified by km. Upon success,
+ it returns zero, otherwise it returns a negative integer upon
+ error.
+
+ See Also
+ SLkm_define_keysym, SLang_define_key
+
+ 11.2. SLang_define_key
+
+ Synopsis
+ Define a key in a keymap
+
+ Usage
+ int SLang_define_key(char *seq, char *fun, SLKeyMap_List_Type
+ *km)
+
+ Description
+ SLang_define_key associates the key sequence seq with the
+ function whose name is fun in the keymap specified by km.
+
+ See Also
+ SLkm_define_keysym, SLkm_define_key
+
+ 11.3. SLkm_define_keysym
+
+ Synopsis
+ Define a keysym in a keymap
+
+ Usage
+ int SLkm_define_keysym (seq, ks, km)
+
+ char *seq;
+ unsigned int ks;
+ SLKeyMap_List_Type *km;
+
+ Description
+ SLkm_define_keysym associates the key sequence seq with the
+ keysym ks in the keymap km. Keysyms whose value is less than or
+ equal to 0x1000 is reserved by the library and should not be
+ used.
+
+ See Also
+ SLkm_define_key, SLang_define_key
+
+ 11.4. SLang_undefine_key
+
+ Synopsis
+ Undefined a key from a keymap
+
+ Usage
+ void SLang_undefine_key(char *seq, SLKeyMap_List_Type *km);
+
+ Description
+ SLang_undefine_key removes the key sequence seq from the keymap
+ km.
+
+ See Also
+ SLang_define_key
+
+ 11.5. SLang_create_keymap
+
+ Synopsis
+ Create a new keymap
+
+ Usage
+ SLKeyMap_List_Type *SLang_create_keymap (name, km)
+
+ char *name;
+ SLKeyMap_List_Type *km;
+
+ Description
+ SLang_create_keymap creates a new keymap called name by copying
+ the key definitions from the keymap km. If km is NULL, the newly
+ created keymap will be empty and it is up to the calling routine
+ to initialize it via the SLang_define_key and SLkm_define_keysym
+ functions. SLang_create_keymap returns a pointer to the new
+ keymap, or NULL upon failure.
+
+ See Also
+ SLang_define_key, SLkm_define_keysym
+
+ 11.6. SLang_do_key
+
+ Synopsis
+ Read a keysequence and return its keymap entry
+
+ Usage
+ SLang_Key_Type *SLang_do_key (kml, getkey)
+
+ SLKeyMap_List_Type *kml;
+ int (*getkey)(void);
+
+ Description
+ The SLang_do_key function reads characters using the function
+ specified by the getkey function pointer and uses the key
+ sequence to return the appropriate entry in the keymap specified
+ by kml.
+
+ SLang_do_key returns NULL if the key sequence is not defined by
+ the keymap, otherwise it returns a pointer to an object of type
+ SLang_Key_Type, which is defined in slang.h as
+
+ #define SLANG_MAX_KEYMAP_KEY_SEQ 14
+ typedef struct SLang_Key_Type
+ {
+ struct SLang_Key_Type *next;
+ union
+ {
+ char *s;
+ FVOID_STAR f;
+ unsigned int keysym;
+ }
+ f;
+ unsigned char type; /* type of function */
+ #define SLKEY_F_INTERPRET 0x01
+ #define SLKEY_F_INTRINSIC 0x02
+ #define SLKEY_F_KEYSYM 0x03
+ unsigned char strSLANG_MAX_KEYMAP_KEY_SEQ + 1;/* key sequence */
+ }
+ SLang_Key_Type;
+
+ The type field specifies which field of the union f should be used.
+ If type is SLKEY_F_INTERPRET, then f.s is a string that should be
+ passed to the interpreter for evaluation. If type is
+ SLKEY_F_INTRINSIC, then f.f refers to function that should be
+ called. Otherwise, type is SLKEY_F_KEYSYM and f.keysym represents
+ the value of the keysym that is associated with the key sequence.
+
+ See Also
+ SLkm_define_keysym, SLkm_define_key
+
+ 11.7. SLang_find_key_function
+
+ Synopsis
+ Obtain a function pointer associated with a keymap
+
+ Usage
+ FVOID_STAR SLang_find_key_function (fname, km);
+
+ char *fname;
+ SLKeyMap_List_Type *km;
+
+ Description
+ The SLang_find_key_function routine searches through the
+ SLKeymap_Function_Type list of functions associated with the
+ keymap km for the function with name fname. If a matching
+ function is found, a pointer to the function will be returned,
+ otherwise SLang_find_key_function will return NULL.
+
+ See Also
+ SLang_create_keymap, SLang_find_keymap
+
+ 11.8. SLang_find_keymap
+
+ Synopsis
+ Find a keymap
+
+ Usage
+ SLKeyMap_List_Type *SLang_find_keymap (char *keymap_name);
+
+ Description
+ The SLang_find_keymap function searches through the list of
+ keymaps looking for one whose name is keymap_name. If a matching
+ keymap is found, the function returns a pointer to the keymap.
+ It returns NULL if no such keymap exists.
+
+ See Also
+ SLang_create_keymap, SLang_find_key_function
+
+ 11.9. SLang_process_keystring
+
+ Synopsis
+ Un-escape a key-sequence
+
+ Usage
+ char *SLang_process_keystring (char *kseq);
+
+ Description
+ The SLang_process_keystring function converts an escaped key
+ sequence to its raw form by converting two-character
+ combinations such as ^A to the single character Ctrl-A (ASCII
+ 1). In addition, if the key sequence contains constructs such as
+ ^(XX), where XX represents a two-character termcap specifier,
+ the termcap escape sequence will be looked up and substituted.
+
+ Upon success, SLang_process_keystring returns a raw key-sequence
+ whose first character represents the total length of the key-
+ sequence, including the length specifier itself. It returns NULL
+ upon failure.
+
+ Example
+ Consider the following examples:
+
+ SLang_process_keystring ("^X^C");
+ SLang_process_keystring ("^A");
+
+ The first example will return a pointer to a buffer of three char-
+ acters whose ASCII values are given by {3,24,3}. Similarly, the
+ second example will return a pointer to the four characters
+ {4,27,91,65}. Finally, the result of
+
+ SLang_process_keystring ("^^(ku)");
+
+ will depend upon the termcap/terminfo capability "ku", which repre-
+ sents the escape sequence associated with the terminal's UP arrow
+ key. For an ANSI terminal whose UP arrow produces "ESC A", the
+ result will be 5,27,27,91,65.
+
+ Notes
+ SLang_process_keystring returns a pointer to a static area that
+ will be overwritten on subsequent calls.
+
+ See Also
+ SLang_define_key, SLang_make_keystring
+
+ 11.10. SLang_make_keystring
+
+ Synopsis
+ Make a printable key sequence
+
+ Usage
+ char *SLang_make_keystring (unsigned char *ks);
+
+ Description
+ The SLang_make_keystring function takes a raw key sequence ks
+ and converts it to a printable form by converting characters
+ such as ASCII 1 (ctrl-A) to ^A. That is, it performs the
+ opposite function of SLang_process_keystring.
+
+ Notes
+ This function returns a pointer to a static area that will be
+ overwritten on the next call to SLang_make_keystring.
+
+ See Also
+ SLang_process_keystring
+
+ 12. Undocumented Functions
+
+ The following functions are not yet documented:
+
+ 12.1. SLprep_open_prep
+
+ Synopsis
+ ??
+
+ Usage
+ int SLprep_open_prep (SLPreprocess_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.2. SLprep_close_prep
+
+ Synopsis
+ ??
+
+ Usage
+ void SLprep_close_prep (SLPreprocess_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.3. SLprep_line_ok
+
+ Synopsis
+ ??
+
+ Usage
+ int SLprep_line_ok (char *, SLPreprocess_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.4. SLdefine_for_ifdef
+
+ Synopsis
+ ??
+
+ Usage
+ int SLdefine_for_ifdef (char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.5. SLang_Read_Line_Type * SLang_rline_save_line
+ (SLang_RLine_Info_Type *);
+
+ Synopsis
+ ??
+
+ Usage
+ SLang_Read_Line_Type * SLang_rline_save_line
+ (SLang_RLine_Info_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.6. int SLang_init_readline (SLang_RLine_Info_Type *);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLang_init_readline (SLang_RLine_Info_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.7. int SLang_read_line (SLang_RLine_Info_Type *);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLang_read_line (SLang_RLine_Info_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.8. int SLang_rline_insert (char *);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLang_rline_insert (char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.9. void SLrline_redraw (SLang_RLine_Info_Type *);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLrline_redraw (SLang_RLine_Info_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.10. int SLtt_flush_output (void);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLtt_flush_output (void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.11. void SLtt_set_scroll_region(int, int);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_set_scroll_region(int, int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.12. void SLtt_reset_scroll_region(void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_reset_scroll_region(void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.13. void SLtt_reverse_video (int);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_reverse_video (int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.14. void SLtt_bold_video (void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_bold_video (void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.15. void SLtt_begin_insert(void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_begin_insert(void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.16. void SLtt_end_insert(void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_end_insert(void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.17. void SLtt_del_eol(void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_del_eol(void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.18. void SLtt_goto_rc (int, int);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_goto_rc (int, int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.19. void SLtt_delete_nlines(int);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_delete_nlines(int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.20. void SLtt_delete_char(void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_delete_char(void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.21. void SLtt_erase_line(void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_erase_line(void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.22. void SLtt_normal_video(void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_normal_video(void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.23. void SLtt_cls(void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_cls(void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.24. void SLtt_beep(void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_beep(void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.25. void SLtt_reverse_index(int);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_reverse_index(int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.26. void SLtt_smart_puts(unsigned short *, unsigned short *, int,
+ int);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_smart_puts(unsigned short *, unsigned short *, int,
+ int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.27. void SLtt_write_string (char *);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_write_string (char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.28. void SLtt_putchar(char);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_putchar(char);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.29. int SLtt_init_video (void);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLtt_init_video (void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.30. int SLtt_reset_video (void);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLtt_reset_video (void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.31. void SLtt_get_terminfo(void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_get_terminfo(void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.32. void SLtt_get_screen_size (void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_get_screen_size (void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.33. int SLtt_set_cursor_visibility (int);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLtt_set_cursor_visibility (int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.34. int SLtt_initialize (char *);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLtt_initialize (char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.35. void SLtt_enable_cursor_keys(void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_enable_cursor_keys(void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.36. void SLtt_set_term_vtxxx(int *);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_set_term_vtxxx(int *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.37. void SLtt_set_color_esc (int, char *);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_set_color_esc (int, char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.38. void SLtt_wide_width(void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_wide_width(void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.39. void SLtt_narrow_width(void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_narrow_width(void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.40. int SLtt_set_mouse_mode (int, int);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLtt_set_mouse_mode (int, int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.41. void SLtt_set_alt_char_set (int);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_set_alt_char_set (int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.42. int SLtt_write_to_status_line (char *, int);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLtt_write_to_status_line (char *, int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.43. void SLtt_disable_status_line (void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_disable_status_line (void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.44. char *SLtt_tgetstr (char *);
+
+ Synopsis
+ ??
+
+ Usage
+ char *SLtt_tgetstr (char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.45. int SLtt_tgetnum (char *);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLtt_tgetnum (char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.46. int SLtt_tgetflag (char *);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLtt_tgetflag (char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.47. char *SLtt_tigetent (char *);
+
+ Synopsis
+ ??
+
+ Usage
+ char *SLtt_tigetent (char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.48. char *SLtt_tigetstr (char *, char **);
+
+ Synopsis
+ ??
+
+ Usage
+ char *SLtt_tigetstr (char *, char **);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.49. int SLtt_tigetnum (char *, char **);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLtt_tigetnum (char *, char **);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.50. SLtt_Char_Type SLtt_get_color_object (int);
+
+ Synopsis
+ ??
+
+ Usage
+ SLtt_Char_Type SLtt_get_color_object (int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.51. void SLtt_set_color_object (int, SLtt_Char_Type);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_set_color_object (int, SLtt_Char_Type);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.52. void SLtt_set_color (int, char *, char *, char *);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_set_color (int, char *, char *, char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.53. void SLtt_set_mono (int, char *, SLtt_Char_Type);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_set_mono (int, char *, SLtt_Char_Type);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.54. void SLtt_add_color_attribute (int, SLtt_Char_Type);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_add_color_attribute (int, SLtt_Char_Type);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.55. void SLtt_set_color_fgbg (int, SLtt_Char_Type,
+ SLtt_Char_Type);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLtt_set_color_fgbg (int, SLtt_Char_Type, SLtt_Char_Type);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.56. int SLkp_define_keysym (char *, unsigned int);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLkp_define_keysym (char *, unsigned int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.57. int SLkp_init (void);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLkp_init (void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.58. int SLkp_getkey (void);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLkp_getkey (void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.59. int SLscroll_find_top (SLscroll_Window_Type *);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLscroll_find_top (SLscroll_Window_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.60. int SLscroll_find_line_num (SLscroll_Window_Type *);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLscroll_find_line_num (SLscroll_Window_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.61. unsigned int SLscroll_next_n (SLscroll_Window_Type *, unsigned
+ int);
+
+ Synopsis
+ ??
+
+ Usage
+ unsigned int SLscroll_next_n (SLscroll_Window_Type *, unsigned
+ int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.62. unsigned int SLscroll_prev_n (SLscroll_Window_Type *, unsigned
+ int);
+
+ Synopsis
+ ??
+
+ Usage
+ unsigned int SLscroll_prev_n (SLscroll_Window_Type *, unsigned
+ int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.63. int SLscroll_pageup (SLscroll_Window_Type *);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLscroll_pageup (SLscroll_Window_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.64. int SLscroll_pagedown (SLscroll_Window_Type *);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLscroll_pagedown (SLscroll_Window_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.65. SLSig_Fun_Type *SLsignal (int, SLSig_Fun_Type *);
+
+ Synopsis
+ ??
+
+ Usage
+ SLSig_Fun_Type *SLsignal (int, SLSig_Fun_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.66. SLSig_Fun_Type *SLsignal_intr (int, SLSig_Fun_Type *);
+
+ Synopsis
+ ??
+
+ Usage
+ SLSig_Fun_Type *SLsignal_intr (int, SLSig_Fun_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.67. int SLsig_block_signals (void);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLsig_block_signals (void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.68. int SLsig_unblock_signals (void);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLsig_unblock_signals (void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.69. int SLsystem (char *);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLsystem (char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.70. void SLadd_at_handler (long *, char *);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLadd_at_handler (long *, char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.71. void SLang_define_case(int *, int *);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLang_define_case(int *, int *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.72. void SLang_init_case_tables (void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLang_init_case_tables (void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.73. unsigned char *SLang_regexp_match(unsigned char *, unsigned
+ int, SLRegexp_Type *);
+
+ Synopsis
+ ??
+
+ Usage
+ unsigned char *SLang_regexp_match(unsigned char *, unsigned int,
+ SLRegexp_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.74. int SLang_regexp_compile (SLRegexp_Type *);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLang_regexp_compile (SLRegexp_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.75. char *SLregexp_quote_string (char *, char *, unsigned int);
+
+ Synopsis
+ ??
+
+ Usage
+ char *SLregexp_quote_string (char *, char *, unsigned int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.76. int SLcmd_execute_string (char *, SLcmd_Cmd_Table_Type *);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLcmd_execute_string (char *, SLcmd_Cmd_Table_Type *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.77. SLcomplex_abs
+
+ Synopsis
+ Returns the norm of a complex number
+
+ Usage
+ double SLcomplex_abs (double *z)}
+
+ Description
+ The SLcomplex_abs function returns the absolute value or the
+ norm of the complex number given by z.
+
+ See Also
+ SLcomplex_times
+
+ 12.78. double *SLcomplex_times (double *, double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_times (double *, double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.79. double *SLcomplex_divide (double *, double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_divide (double *, double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.80. double *SLcomplex_sin (double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_sin (double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.81. double *SLcomplex_cos (double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_cos (double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.82. double *SLcomplex_tan (double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_tan (double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.83. double *SLcomplex_asin (double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_asin (double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.84. double *SLcomplex_acos (double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_acos (double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.85. double *SLcomplex_atan (double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_atan (double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.86. double *SLcomplex_exp (double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_exp (double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.87. double *SLcomplex_log (double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_log (double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.88. double *SLcomplex_log10 (double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_log10 (double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.89. double *SLcomplex_sqrt (double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_sqrt (double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.90. double *SLcomplex_sinh (double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_sinh (double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.91. double *SLcomplex_cosh (double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_cosh (double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.92. double *SLcomplex_tanh (double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_tanh (double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.93. double *SLcomplex_pow (double *, double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_pow (double *, double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.94. double SLmath_hypot (double x, double y);
+
+ Synopsis
+ ??
+
+ Usage
+ double SLmath_hypot (double x, double y);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ extern double *SLcomplex_asinh (double *, double *);
+
+ 12.95. double *SLcomplex_acosh (double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_acosh (double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.96. double *SLcomplex_atanh (double *, double *);
+
+ Synopsis
+ ??
+
+ Usage
+ double *SLcomplex_atanh (double *, double *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.97. char *SLdebug_malloc (unsigned long);
+
+ Synopsis
+ ??
+
+ Usage
+ char *SLdebug_malloc (unsigned long);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.98. char *SLdebug_calloc (unsigned long, unsigned long);
+
+ Synopsis
+ ??
+
+ Usage
+ char *SLdebug_calloc (unsigned long, unsigned long);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.99. char *SLdebug_realloc (char *, unsigned long);
+
+ Synopsis
+ ??
+
+ Usage
+ char *SLdebug_realloc (char *, unsigned long);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.100. void SLdebug_free (char *);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLdebug_free (char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.101. void SLmalloc_dump_statistics (void);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLmalloc_dump_statistics (void);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.102. char *SLstrcpy(register char *, register char *);
+
+ Synopsis
+ ??
+
+ Usage
+ char *SLstrcpy(register char *, register char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.103. int SLstrcmp(register char *, register char *);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLstrcmp(register char *, register char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.104. char *SLstrncpy(char *, register char *, register int);
+
+ Synopsis
+ ??
+
+ Usage
+ char *SLstrncpy(char *, register char *, register int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.105. void SLmemset (char *, char, int);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLmemset (char *, char, int);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.106. void SLexpand_escaped_string (register char *, register char
+ *, register char *);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLexpand_escaped_string (register char *, register char *,
+ register char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.107. void SLmake_lut (unsigned char *, unsigned char *, unsigned
+ char);
+
+ Synopsis
+ ??
+
+ Usage
+ void SLmake_lut (unsigned char *, unsigned char *, unsigned
+ char);
+
+ Description
+ ??
+
+ See Also
+ ??
+
+ 12.108. int SLang_guess_type (char *);
+
+ Synopsis
+ ??
+
+ Usage
+ int SLang_guess_type (char *);
+
+ Description
+ ??
+
+ See Also
+ ??
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/text/cslang.txt Added

@@ -0,0 +1,2796 @@
+ S-Lang Library C Programmer's Guide (v2.3.0)
+ John E. Davis <www.jedsoft.org>
+ Sep 14, 2014
+ ____________________________________________________________
+
+
+ 1. Preface
+
+ S-Lang is an interpreted language that was designed from the start to
+ be easily embedded into a program to provide it with a powerful
+ extension language. Examples of programs that use S-Lang as an
+ extension language include the jed text editor and the slrn
+ newsreader. Although S-Lang does not exist as a separate application,
+ it is distributed with a quite capable program called slsh (``slang-
+ shell'') that embeds the interpreter and allows one to execute S-Lang
+ scripts, or simply experiment with S-Lang at an interactive prompt.
+ Many of the the examples in this document are presented in the context
+ of one of the above applications.
+
+ S-Lang is also a programmer's library that permits a programmer to
+ develop sophisticated platform-independent software. In addition to
+ providing the S-Lang interpreter, the library provides facilities for
+ screen management, keymaps, low-level terminal I/O, etc.
+
+ 1.1. A Brief History of S-Lang
+
+ I first began working on S-Lang sometime during the fall of 1992. At
+ that time I was writing a text editor (jed), which I wanted to endow
+ with a macro language. It occurred to me that an application-
+ independent language that could be embedded into the editor would
+ prove more useful because I could envision embedding it into other
+ programs. As a result, S-Lang was born.
+
+ S-Lang was originally a stack language that supported a postscript-
+ like syntax. For that reason, I named it S-Lang, where the S was
+ supposed to emphasize its stack-based nature. About a year later, I
+ began to work on a preparser that would allow one unfamiliar with
+ stack based languages to make use of a more traditional infix syntax.
+ Currently, the syntax of the language resembles C, nevertheless some
+ postscript-like features still remain, e.g., the `%' character is
+ still used as a comment delimiter.
+
+ 1.2. Acknowledgements
+
+ Since I first released S-Lang, I have received a lot feedback about
+ the library and the language from many people. This has given me the
+ opportunity and pleasure to interact with a number of people to make
+ the library portable and easy to use. In particular, I would like to
+ thank the following individuals:
+
+ Luchesar Ionkov for his comments and criticisms of the syntax of the
+ language. He was the person who made me realize that the low-level
+ byte-code engine should be totally type-independent. He also improved
+ the tokenizer and preparser and impressed upon me that the language
+ needed a grammar.
+
+ Mark Olesen for his many patches to various aspects of the library and
+ his support on AIX. He also contributed a lot to the pre-processing
+ (SLprep) routines.
+
+ John Burnell for the OS/2 port of the video and keyboard routines. He
+ also made value suggestions regarding the interpreter interface.
+
+ Darrel Hankerson for cleaning up and unifying some of the code and the
+ makefiles.
+
+ Dominik Wujastyk who was always willing to test new releases of the
+ library.
+
+ Michael Elkins for his work on the curses emulation.
+
+ Hunter Goatley, Andy Harper, Martin P.J. Zinser, and Jouk Jansen for
+ their VMS support.
+
+ Dave Sims and Chin Huang for Windows 95 and Windows NT support, and
+ Dino Sangoi for the Windows DLL support.
+
+ I am also grateful to many other people who send in bug-reports, bug-
+ fixes, little enhancements, and suggestions, and so on. Without such
+ community involvement, S-Lang would not be as well-tested and stable
+ as it is. Finally, I would like to thank my wife for her support and
+ understanding while I spent long weekend hours developing the library.
+
+ 2. Introduction
+
+ S-Lang is a C programmer's library that includes routines for the
+ rapid development of sophisticated, user friendly, multi-platform
+ applications. The S-Lang library includes the following:
+
+ o Low level tty input routines for reading single characters at a
+ time.
+
+ o Keymap routines for defining keys and manipulating multiple
+ keymaps.
+
+ o A high-level keyprocessing interface (SLkp) for handling function
+ and arrow keys.
+
+ o High level screen management routines for manipulating both
+ monochrome and color terminals. These routines are very efficient.
+ (SLsmg)
+
+ o Low level terminal-independent routines for manipulating the
+ display of a terminal. (SLtt)
+
+ o Routines for reading single line input with line editing and recall
+ capabilities. (SLrline)
+
+ o Searching functions: both ordinary searches and regular expression
+ searches. (SLsearch)
+
+ o An embedded stack-based language interpreter with a C-like syntax.
+
+ The library is currently available for OS/2, MSDOS, Unix, and VMS
+ systems. For the most part, the interface to library routines has been
+ implemented in such a way that it appears to be platform independent
+ from the point of view of the application. In addition, care has been
+ taken to ensure that the routines are ``independent'' of one another
+ as much as possible. For example, although the keymap routines require
+ keyboard input, they are not tied to S-Lang's keyboard input
+ routines--- one can use a different keyboard getkey routine if one
+ desires. This also means that linking to only part of the S-Lang
+ library does not pull the whole library into the application. Thus, S-
+ Lang applications tend to be relatively small in comparison to
+ programs that use libraries with similar capabilities.
+
+ 3. Error Handling
+
+ Many of the S-Lang functions return 0 upon success or -1 to signify
+ failure. Other functions may return NULL to indicate failure. In
+ addition, upon failure, many will set the error state of the library
+ to a value that indicates the nature of the error. The value of this
+ state may be queried via the SLang_get_error function. This function
+ will return 0 to indicate that there is no error, or a non-zero value
+ such as one of the following constants:
+
+ SL_Any_Error SL_Index_Error
+ SL_OS_Error SL_Parse_Error
+ SL_Malloc_Error SL_Syntax_Error
+ SL_IO_Error SL_DuplicateDefinition_Error
+ SL_Write_Error SL_UndefinedName_Error
+ SL_Read_Error SL_Usage_Error
+ SL_Open_Error SL_Application_Error
+ SL_RunTime_Error SL_Internal_Error
+ SL_InvalidParm_Error SL_NotImplemented_Error
+ SL_TypeMismatch_Error SL_LimitExceeded_Error
+ SL_UserBreak_Error SL_Forbidden_Error
+ SL_Stack_Error SL_Math_Error
+ SL_StackOverflow_Error SL_DivideByZero_Error
+ SL_StackUnderflow_Error SL_ArithOverflow_Error
+ SL_ReadOnly_Error SL_ArithUnderflow_Error
+ SL_VariableUninitialized_Error SL_Domain_Error
+ SL_NumArgs_Error SL_Data_Error
+ SL_Unknown_Error SL_Unicode_Error
+ SL_Import_Error SL_InvalidUTF8_Error
+
+ For example, if a function tries to allocate memory but fails, then
+ SLang_get_error will return SL_Malloc_Error.
+
+ If the application makes use of the interpreter, then it is important
+ that application-specific functions called from the interpreter set
+ the error state of the library in order for exception handling to
+ work. This may be accomplished using the SLang_set_error function,
+ e.g.,
+
+ if (NULL == (fp = fopen (file, "r")))
+ SLang_set_error (SL_Open_Error);
+
+ Often it is desirable to give error message that contains more
+ information about the error. The SLang_verror function may be used for
+ this purpose:
+
+ if (NULL == (fp = fopen (file, "r")))
+ SLang_verror (SL_Open_Error, "Failed to open %s: errno=%d",
+ file, errno);
+
+ By default, SLang_verror will write the error message to stderr. For
+ applications that make use of the SLsmg routines it is probably better
+ for the error message to be printed to a specific area of the display.
+ The SLang_Error_Hook variable may be used to redirect error messages
+ to an application defined function, e.g.,
+
+ static void write_error (char *err)
+ {
+ SLsmg_gotorc (0, 0);
+ SLsmg_set_color (ERROR_COLOR);
+ SLsmg_write_string (err);
+ }
+ int main (int argc, char **argv)
+ {
+ /* Redirect error messages to write_error */
+ SLang_Error_Hook = write_error;
+ .
+ .
+ }
+
+ Under extremely rare circumstances the library will call the C exit
+ function causing the application to exit. This will happen if the
+ SLtt_get_terminfo is called but the terminal is not sufficiently
+ powerful. If this behavior is undesirable, then another function
+ exists (SLtt_initialize) that returns an error code. The other times
+ the library will exit are when the interpreter is called upon to do
+ something but has not been properly initialized by the application.
+ Such a condition is regarded as misuse of the libary and should be
+ caught by routine testing of the application during development. In
+ any case, when the library does call the exit function, it will call
+ an application-defined exit hook specified by the
+ SLang_Exit_Error_Hook variable:
+
+ static int exit_error_hook (char *fmt, va_list ap)
+ {
+ fprintf (stderr, "Fatal Error. Reason:");
+ vfprintf (stderr, fmt, va_list);
+ }
+ int main (int argc, char **argv)
+ {
+ SLang_Exit_Error_Hook = exit_error_hook;
+ .
+ .
+ }
+
+ The idea is that the hook can be used to perform some cleanup, free
+ resources, and other tasks that the application needs to do for a
+ clean exit.
+
+ 4. Unicode Support
+
+ S-Lang has native support for the UTF-8 encoding of unicode in a
+ number of its interfaces including the the SLsmg screen mangement
+ interface as well as the interpreter. UTF-8 is a variable length
+ multibyte encoding where unicode characters are represented by one to
+ six bytes. A technical description of the UTF-encoding is beyond the
+ scope of this document, and as such the reader is advised to look
+ elsewhere for a more detailed specification of the encoding.
+
+ By default, the library's handling of UTF-8 is turned off. It may be
+ enabled by a call to the SLutf8_enable function:
+
+ int SLutf8_enable (int mode)
+
+ If the value of mode is 1, then the library will be put in UTF-8 mode.
+ If the value of mode is 0, then the library will be initialized with
+ UTF-8 support disabled. If the value is -1, then the mode will deter-
+ mined through an OS-dependent manner, e.g., for Unix, the standard
+ locale mechanism will be used. The return value of this function will
+ be 1 if UTF-8 support was activated, or 0 if not.
+
+ The above function determines the UTF-8 state of the library as a
+ whole. For some purposes it may be desirable to have more fine-grained
+ control of the UTF-8 support. For example, one might be using the jed
+ editor to view a UTF-8 encoded file but the terminal associated with
+ the editor may not support UTF-8. In such a case, one would want the
+ SLsmg interface to be in UTF-8 mode but lower-level SLtt interface to
+ not be in UTF-8 mode. Hence, the following activation functions are
+ also provided:
+
+ int SLsmg_utf8_enable (int mode);
+ int SLtt_utf8_enable (int mode);
+ int SLinterp_utf8_enable (int mode);
+
+ Note that once one of these interface specific functions has been
+ called, any further calls to the umbrella function SLutf8_enable will
+ have no effect on that interface. For this reason, it is best to call
+ SLutf8_enable first before the calling one of the interface-specific
+ functions.
+
+ Until support for Unicode is more widespread among users, it is
+ expected that most users will still be using a national character set
+ such as ASCII or iso-8869-1. For example, iso-8869-1 is a very
+ widespread character set used on Usenet. As a result, applications
+ will still have to provide support for such character sets.
+ Unfortunately there appears to be no best way to do this.
+
+ For the most part, the UTF-8 support should be largely transparent to
+ the user. For example, the interpreter treats all multibyte characters
+ as a single character which means that the user does not have to be
+ concerned about the internal representation of a character. Rather one
+ must keep in mind the distinction between a character and a byte.
+
+ 5. Interpreter Interface
+
+ The S-Lang library provides an interpreter that when embedded into an
+ application, makes the application extensible. Examples of programs
+ that embed the interpreter include the jed editor and the slrn
+ newsreader.
+
+ Embedding the interpreter is easy. The hard part is to decide what
+ application specific built-in or intrinsic functions should be
+ provided by the application. The S-Lang library provides some pre-
+ defined intrinsic functions, such as string processing functions, and
+ simple file input-output routines. However, the basic philosophy
+ behind the interpreter is that it is not a standalone program and it
+ derives much of its power from the application that embeds it.
+
+ 5.1. Embedding the Interpreter
+
+ Only one function needs to be called to embed the S-Lang interpreter
+ into an application: SLang_init_slang. This function initializes the
+ interpreter's data structures and adds some intrinsic functions:
+
+ if (-1 == SLang_init_slang ())
+ exit (EXIT_FAILURE);
+
+ This function does not provide file input output intrinsic nor does it
+ provide mathematical functions. To make these as well as some posix
+ system calls available use
+
+ if ((-1 == SLang_init_slang ()) /* basic interpreter functions */
+ || (-1 == SLang_init_slmath ()) /* sin, cos, etc... */
+ || (-1 == SLang_init_array ()) /* sum, min, max, transpose... */
+ || (-1 == SLang_init_stdio ()) /* stdio file I/O */
+ || (-1 == SLang_init_ospath ()) /* path_concat, etc... */
+ || (-1 == SLang_init_posix_dir ()) /* mkdir, stat, etc. */
+ || (-1 == SLang_init_posix_process ()) /* getpid, umask, etc. */
+ || (-1 == SLang_init_posix_io ()) /* open, close, read, ... */
+ || (-1 == SLang_init_signal ()) /* signal, alarm, ... */
+ )
+ exit (EXIT_FAILURE);
+
+ If you intend to enable all intrinsic functions, then it is simpler to
+ initialize the interpreter via
+
+ if (-1 == SLang_init_all ())
+ exit (EXIT_FAILURE);
+
+ See the S-Lang Library Intrinsic Function Reference for more informa-
+ tion about the intrinsic functions.
+
+ 5.2. Calling the Interpreter
+
+ There are several ways of calling the interpreter. The two most common
+ method is to load a file containing S-Lang code, or to load a string.
+
+ 5.2.1. Loading Files
+
+ The SLang_load_file and SLns_load_file functions may be used to
+ interpret a file. Both these functions return zero if successful, or
+ -1 upon failure. If either of these functions fail, the interpreter
+ will accept no more code unless the error state is cleared. This is
+ done by calling SLang_restart function to set the interpreter to its
+ default state:
+
+ if (-1 == SLang_load_file ("site.sl"))
+ {
+ /* Clear the error and reset the interpreter */
+ SLang_restart (1);
+ }
+
+ When a file is loaded via SLang_load_file, any non-public variables
+ and functions defined in the file will be placed into a namespace that
+ is local to the file itself. The SLns_load_file function may be used
+ to load a file using a specified namespace, e.g.,
+
+ if (-1 == SLns_load_file ("site.sl", "NS"))
+ {
+ SLang_restart (1);
+ SLang_set_error (0);
+ }
+
+ will load site.sl into a namespace called NS. If such a namespace does
+ not exist, then it will be created.
+
+ Both the SLang_load_file and SLns_load_file functions search for files
+ along an application-specified search path. This path may be set using
+ the SLpath_set_load_path function, as well as from interpeted code via
+ the set_slang_load_path function. By default, no search path is
+ defined.
+
+ NOTE: It is highly recommended that an application embedding the
+ interpreter include the slsh lib directory in the search path. The .sl
+ files that are part of slsh are both useful and and should work with
+ any application embedding the interpreter. Moreover, if the
+ application permits dynamically loaded modules, then there are a
+ growing number of excellent quality modules for slsh that can be
+ utilized by it. Applications that follow this recommendation are said
+ to be conforming.
+
+ Files are searched as follows: If the name begins with the equivalent
+ of "./" or "../", then it is searched for with respect to the current
+ directory, and not along the load-path. If no such file exists, then
+ an error will be generated. Otherwise, the file is searched for in
+ each of the directories of the load-path by concatenating the path
+ element with the specified file name. The first such file found to
+ exist by this process will be loaded. If a matching file still has not
+ been found, and the file name lacks an extension, then the path is
+ searched with ".sl" and ".slc" appended to the filename. If two such
+ files are found (one ending with ".sl" and the other with ".slc"),
+ then the more recent of the two will be used. If no matching file has
+ been found by this process, then the search will cease and an error
+ generated.
+
+ The search path is a delimiter separated list of directories that
+ specify where the interpreter looks for files. By default, the value
+ of the delimiter is OS-dependent following the convention of the
+ underlying OS. For example, on Unix the delimiter is represented by a
+ colon, on DOS/Windows it is a semi-colon, and on VMS it is a space.
+ The SLpath_set_delimiter and SLpath_get_delimiter may be used to set
+ and query the delimiter's value, respectively.
+
+ 5.2.2. Loading Strings
+
+ There are several other mechanisms for interacting with the
+ interpreter. For example, the SLang_load_string function loads a
+ string into the interpreter and interprets it:
+
+ if (-1 == SLang_load_string ("message (\"hello\");"))
+ return;
+
+ Similarly, the SLns_load_string function may be used to load a string
+ into a specified namespace.
+
+ Typically, an interactive application will load a file via
+ SLang_load_file and then go into a loop that consists of reading lines
+ of input and sending them to the interpreter, e.g.,
+
+ while (EOF != fgets (buf, sizeof (buf), stdin))
+ {
+ if (-1 == SLang_load_string (buf))
+ {
+ SLang_restart (1);
+ }
+ }
+
+ Finally, some applications such as jed and slrn use another method of
+ interacting with the interpreter. They read key sequences from the
+ keyboard and map those key sequences to interpreter functions via the
+ S-Lang keymap interface.
+
+ 5.3. Intrinsic Functions
+
+ An intrinsic function is simply a function that is written in C and is
+ made available to the interpreter as a built-in function. For this
+ reason, the words `intrinsic' and `built-in' are often used
+ interchangeably.
+
+ Applications are expected to add application specific functions to the
+ interpreter. For example, jed adds nearly 300 editor-specific
+ intrinsic functions. The application designer should think carefully
+ about what intrinsic functions to add to the interpreter.
+
+ 5.3.1. Restrictions on Intrinsic Functions
+
+ When implementing intrinsic functions, it is necessary to follow a few
+ rules to cooperate with the interpreter.
+
+ The C version of an intrinsic function takes only pointer arguments.
+ This is because when the interpreter calls an intrinsic function, it
+ passes values to the function by reference and not by value. For
+ example, intrinsic with the declarations:
+
+ int intrinsic_0 (void);
+ int intrinsic_1 (char *s);
+ void intrinsic_2 (char *s, int *i);
+ void intrinsic_3 (int *i, double *d, double *e);
+
+ are all valid. However,
+
+ int invalid_1 (char *s, int len);
+
+ is not valid since the len parameter is not a pointer.
+
+ The return value of an intrinsic function must be one of the following
+ types: void, char, short, int, long, double, char *, as well as
+ unsigned versions of the integer types. A function such as
+
+ int *invalid (void);
+
+ is not permitted since int* is not a valid return-type for an intrin-
+ sic function. Any other type of value can be passed back to the inter-
+ preter by explicitly pushing the object onto the interpreter's stack
+ via the appropriate "push" function.
+
+ The current implementation limits the number of arguments of an
+ intrinsic function to 7. The "pop" functions can be used to allow the
+ function to take an arbitrary number as seen from an interpreter
+ script.
+
+ Another restriction is that the intrinsic function should regard all
+ its parameters as pointers to constant objects and make no attempt to
+ modify the value to which they point. For example,
+
+ void truncate (char *s)
+ {
+ s0 = 0;
+ }
+
+ is illegal since the function modifies the string s.
+
+ 5.3.2. Adding a New Intrinsic
+
+ There are two basic mechanisms for adding an intrinsic function to the
+ interpreter: SLadd_intrinsic_function and SLadd_intrin_fun_table.
+ Functions may be added to a specified namespace via
+ SLns_add_intrinsic_function and SLns_add_intrin_fun_table functions.
+
+ As an specific example, consider a function that will cause the
+ program to exit via the exit C library function. It is not possible to
+ make this function an intrinsic because it does not meet the
+ specifications for an intrinsic function that were described earlier.
+ However, one can call exit from a function that is suitable, e.g.,
+
+ void intrin_exit (int *code)
+ {
+ exit (*code);
+ }
+
+ This function may be made available to the interpreter as an intrinsic
+ via the SLadd_intrinsic_function routine:
+
+ if (-1 == SLadd_intrinsic_function ("exit", (FVOID_STAR) intrin_exit,
+ SLANG_VOID_TYPE, 1,
+ SLANG_INT_TYPE))
+ exit (EXIT_FAILURE);
+
+ This statement basically tells the interpreter that intrin_exit is a
+ function that returns nothing and takes a single argument: a pointer
+ to an integer (SLANG_INT_TYPE). A user can call this function from
+ within the interpreter via
+
+ message ("Calling the exit function");
+ exit (0);
+
+ After printing a message, this will cause the intrin_exit function to
+ execute, which in turn calls exit.
+
+ The most convenient mechanism for adding new intrinsic functions is to
+ create a table of SLang_Intrin_Fun_Type objects and add the table via
+ the SLadd_intrin_fun_table function. The table will look like:
+
+ SLang_Intrin_Fun_Type My_Intrinsics =
+ {
+ /* table entries */
+ MAKE_INTRINSIC_N(...),
+ MAKE_INTRINSIC_N(...),
+ .
+ .
+ MAKE_INTRINSIC_N(...),
+ SLANG_END_INTRIN_FUN_TABLE
+ };
+
+ Construction of the table entries may be facilitated using a set of
+ MAKE_INTRINSIC macros defined in slang.h. The main macro is called
+ MAKE_INTRINSIC_N and takes 11 arguments:
+
+ MAKE_INTRINSIC_N(name, funct-ptr, return-type, num-args,
+ arg-1-type, arg-2-type, ... arg-7-type)
+
+ Here name is the name of the intrinsic function that the interpreter
+ is to give to the function. func-ptr is a pointer to the intrinsic
+ function taking num-args and returning ret-type. The final 7 arguments
+ specify the argument types. For example, the intrin_exit intrinsic
+ described above may be added to the table using
+
+ MAKE_INTRINSIC_N("exit", intrin_exit, SLANG_VOID_TYPE, 1,
+ SLANG_INT_TYPE, 0,0,0,0,0,0)
+
+ While MAKE_INTRINSIC_N is the main macro for constructing table
+ entries, slang.h defines other macros that may prove useful. In
+ particular, an entry for the intrin_exit function may also be created
+ using any of the following forms:
+
+ MAKE_INTRINSIC_1("exit", intrin_exit, SLANG_VOID_TYPE, SLANG_INT_TYPE)
+ MAKE_INTRINSIC_I("exit", intrin_exit, SLANG_VOID_TYPE)
+
+ See slang.h for related macros. You are also encouraged to look at,
+ e.g., slang/src/slstd.c for a more extensive examples.
+
+ The table may be added via the SLadd_intrin_fun_table function, e.g.,
+
+ if (-1 == SLadd_intrin_fun_table (My_Intrinsics, NULL))
+ {
+ /* an error occurred */
+ }
+
+ Please note that there is no need to load a given table more than
+ once, and it is considered to be an error on the part of the applica-
+ tion it adds the same table multiple times. For performance reasons,
+ no checking is performed by the library to see if a table has already
+ been added.
+
+ Earlier it was mentioned that intrinsics may be added to a specified
+ namespace. To this end, one must first get a pointer to the namespace
+ via the SLns_create_namespace function. The following example
+ illustrates how this function is used to add the My_Intrinsics table
+ to a namespace called my:
+
+ SLang_NameSpace_Type *ns = SLns_create_namespace ("my");
+ if (ns == NULL)
+ return -1;
+
+ return SLns_add_intrin_fun_table (ns, My_Intrinsics, "__MY__"));
+
+ 5.3.3. More Complicated Intrinsics
+
+ The intrinsic functions described in the previous example were
+ functions that took a fixed number of arguments. In this section we
+ explore more complex intrinsics such as those that take a variable
+ number of arguments.
+
+ Consider a function that takes two double precision numbers and
+ returns the lesser:
+
+ double intrin_min (double *a, double *b)
+ {
+ if (*a < *b) return *a;
+ return *b;
+ }
+
+ This function may be added to a table of intrinsics using
+
+ MAKE_INTRINSIC_2("vmin", intrin_min, SLANG_DOUBLE_TYPE,
+ SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE)
+
+ It is useful to extend this function to take an arbitray number of
+ arguments and return the lesser. Consider the following variant:
+
+ double intrin_min_n (int *num_ptr)
+ {
+ double min_value, x;
+ unsigned int num = (unsigned int) *num_ptr;
+
+ if (-1 == SLang_pop_double (&min_value))
+ return 0.0;
+ num--;
+
+ while (num > 0)
+ {
+ num--;
+ if (-1 == SLang_pop_double (&x))
+ return 0.0;
+ if (x < min_value) min_value = x;
+ }
+ return min_value;
+ }
+
+ Here the number to compare is passed to the function and the actual
+ numbers are removed from the stack via the SLang_pop_double function.
+ A suitable table entry for it is
+
+ MAKE_INTRINSIC_I("vmin", intrin_min_n, SLANG_DOUBLE_TYPE)
+
+ This function would be used in an interpreter script via a statement
+ such as
+
+ variable xmin = vmin (x0, x1, x2, x3, x4, 5);
+
+ which computes the smallest of 5 values.
+
+ The problem with this intrinsic function is that the user must
+ explicitly specify how many numbers to compare. It would be more
+ convenient to simply use
+
+ variable xmin = vmin (x0, x1, x2, x3, x4);
+
+ An intrinsic function can query the value of the variable
+ SLang_Num_Function_Args to obtain the necessary information:
+
+ double intrin_min (void)
+ {
+ double min_value, x;
+
+ unsigned int num = SLang_Num_Function_Args;
+
+ if (-1 == SLang_pop_double (&min_value, NULL, NULL))
+ return 0.0;
+ num--;
+
+ while (num > 0)
+ {
+ num--;
+ if (-1 == SLang_pop_double (&x, NULL, NULL))
+ return 0.0;
+ if (x < min_value) min_value = x;
+ }
+ return min_value;
+ }
+
+ This may be declared as an intrinsic using:
+
+ MAKE_INTRINSIC_0("vmin", intrin_min, SLANG_DOUBLE_TYPE)
+
+ 5.4. Intrinsic Variables
+
+ It is possible to access an application's global variables from within
+ the interpreter. The current implementation supports the access of
+ variables of type int, char *, and double.
+
+ There are two basic methods of making an intrinsic variable available
+ to the interpreter. The most straight forward method is to use the
+ function SLadd_intrinsic_variable:
+
+ int SLadd_intrinsic_variable (char *name, VOID_STAR addr,
+ SLtype data_type,
+ int read_only);
+
+ For example, suppose that I is an integer variable, e.g.,
+
+ int I;
+
+ One can make it known to the interpreter as I_Variable via a statement
+ such as
+
+ if (-1 == SLadd_intrinsic_variable ("I_Variable", &I,
+ SLANG_INT_TYPE, 0))
+ exit (EXIT_FAILURE);
+
+ Similarly, if S is declared as
+
+ char *S;
+
+ then
+
+ if (-1 == SLadd_intrinsic_variable ("S_Variable", &S,
+ SLANG_STRING_TYPE, 1))
+ exit (EXIT_FAILURE);
+
+ makes S available as a read-only variable with the name S_Variable.
+ Note that if a pointer variable is made available to the interpreter,
+ it should be declared as being read-only to prevent the interpreter
+ from changing the pointer's value.
+
+ It is important to note that if S were declared as an array of
+ characters, e.g.,
+
+ char S256;
+
+ then it would not be possible to make it directly available to the
+ interpreter. However, one could create a pointer to it, i.e.,
+
+ char *S_Ptr = S;
+
+ and make S_Ptr available as a read-only variable.
+
+ One should not make the mistake of trying to use the same address for
+ different variables as the following example illustrates:
+
+ int do_not_try_this (void)
+ {
+ static char *names3 = {"larry", "curly", "moe"};
+ unsigned int i;
+
+ for (i = 0; i < 3; i++)
+ {
+ int value;
+ if (-1 == SLadd_intrinsic_variable (namesi, (VOID_STAR) &value,
+ SLANG_INT_TYPE, 1))
+ return -1;
+ }
+ return 0;
+ }
+
+ Not only does this piece of code create intrinsic variables that use
+ the same address, it also uses the address of a local variable that
+ will go out of scope.
+
+ The most convenient method for adding many intrinsic variables to the
+ interpreter is to create an array of SLang_Intrin_Var_Type objects and
+ then add the array via SLadd_intrin_var_table. For example, the array
+
+ static SLang_Intrin_Var_Type Intrin_Vars =
+ {
+ MAKE_VARIABLE("I_Variable", &I, SLANG_INT_TYPE, 0),
+ MAKE_VARIABLE("S_Variable", &S_Ptr, SLANG_STRING_TYPE, 1),
+ SLANG_END_TABLE
+ };
+
+ may be added via
+
+ if (-1 == SLadd_intrin_var_table (Intrin_Vars, NULL))
+ exit (EXIT_FAILURE);
+
+ It should be rather obvious that the arguments to the MAKE_VARIABLE
+ macro correspond to the parameters of the SLadd_intrinsic_variable
+ function.
+
+ Finally, variables may be added to a specific namespace via the
+ SLns_add_intrin_var_table and SLns_add_intrinsic_variable functions.
+
+ 5.5. Aggregate Data Objects
+
+ An aggregate data object is an object that can contain more than one
+ data value. The S-Lang interpreter supports several such objects:
+ arrays, structure, and associative arrays. In the following sections,
+ information about interacting with these objects is given.
+
+ 5.5.1. Arrays
+
+ An intrinsic function may interact with an array in several different
+ ways. For example, an intrinsic may create an array and return it.
+ The basic functions for manipulating arrays include:
+
+ SLang_create_array
+ SLang_pop_array_of_type
+ SLang_push_array
+ SLang_free_array
+ SLang_get_array_element
+ SLang_set_array_element
+
+ The use of these functions will be illustrated via a few simple exam-
+ ples.
+
+ The first example shows how to create an return an array of strings to
+ the interpreter. In particular, the names of the four seasons of the
+ year will be returned:
+
+ void months_of_the_year (void)
+ {
+ static char *seasons4 =
+ {
+ "Spring", "Summer", "Autumn", "Winter"
+ };
+ SLang_Array_Type *at;
+ SLindex_Type i, four;
+
+ four = 4;
+ at = SLang_create_array (SLANG_STRING_TYPE, 0, NULL, &four, 1);
+ if (at == NULL)
+ return;
+
+ /* Now set the elements of the array */
+ for (i = 0; i < 4; i++)
+ {
+ if (-1 == SLang_set_array_element (at, &i, &seasonsi))
+ {
+ SLang_free_array (at);
+ return;
+ }
+ }
+
+ (void) SLang_push_array (at, 0);
+ SLang_free_array (at);
+ }
+
+ This example illustrates several points:
+
+ First of all, the SLang_create_array function was used to create a 1
+ dimensional array of 4 strings. Since this function could fail, its
+ return value was checked. Also SLindex_Type was used for the array
+ size and index types. In S-Lang version 2, SLindex_Type is typedefed
+ to be an int. However, as this will change in a future version of the
+ library, SLindex_Type should be used.
+
+ The SLang_set_array_element function was used to set the elements of
+ the newly created array. Note that the address containing the value of
+ the array element was passed and not the value of the array element
+ itself. That is,
+
+ SLang_set_array_element (at, &i, seasonsi)
+
+ was not used. The return value from this function was also checked
+ because it too could also fail.
+
+ Finally, the array was pushed onto the interpreter's stack and then it
+ was freed. It is important to understand why it was freed. This is
+ because arrays are reference-counted. When the array was created, it
+ was returned with a reference count of 1. When it was pushed, the
+ reference count was bumped up to 2. Then since it was nolonger needed
+ by the function, SLang_free_array was called to decrement the
+ reference count back to 1. For convenience, the second argument to
+ SLang_push_array determines whether or not it is to also free the
+ array. So, instead of the two function calls:
+
+ (void) SLang_push_array (at, 0);
+ SLang_free_array (at);
+
+ it is preferable to combine them as
+
+ (void) SLang_push_array (at, 1);
+
+ The second example returns a diagonal array of a specified size to the
+ stack. A diagonal array is a 2-d array with all elements zero except
+ for those along the diagonal, which have a value of one:
+
+ void make_diagonal_array (SLindex_Type n)
+ {
+ SLang_Array_Type *at;
+ SLindex_Type dims2;
+ SLindex_Type i, one;
+
+ dims0 = dims1 = n;
+ at = SLang_create_array (SLANG_INT_TYPE, 0, NULL, dims, 2);
+ if (at == NULL)
+ return;
+
+ one = 1;
+ for (i = 0; i < n; i++)
+ {
+ dims0 = dims1 = i;
+ if (-1 == SLang_set_array_element (at, dims, &one))
+ {
+ SLang_free_array (at);
+ return;
+ }
+ }
+
+ (void) SLang_push_array (at, 1);
+ }
+
+ In this example, only the diagonal elements of the array were set.
+ This is bacause when the array was created, all its elements were set
+ to zero.
+
+ Now consider an example that acts upon an existing array. In
+ particular, consider one that computes the trace of a 2-d matrix,
+ i.e., the sum of the diagonal elements:
+
+ double compute_trace (void)
+ {
+ SLang_Array_Type *at;
+ double trace;
+ SLindex_Type dims2;
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_DOUBLE_TYPE))
+ return 0.0;
+
+ /* We want a 2-d square matrix. If the matrix is 1-d and has only one
+ element, then return that element. */
+ trace = 0.0;
+ if (((at->num_dims == 1) && (at->dims0 == 1))
+ || ((at->num_dims == 2) && (at->dims0 == at->dims1)))
+ {
+ double dtrace;
+ SLindex_Type n = at->dims0;
+
+ for (i = 0; i < n; i++)
+ {
+ dims0 = dims1 = i;
+ (void) SLang_get_array_element (at, &dims, &dtrace);
+ trace += dtrace;
+ }
+ }
+ else SLang_verror (SL_TYPE_MISMATCH, "Expecting a square matrix");
+
+ SLang_free_array (at);
+ return trace;
+ }
+
+ In this example, SLang_pop_array_of_type was used to pop an array of
+ doubles from the stack. This function will make implicit typecasts in
+ order to return an array of the requested type.
+
+ 5.5.2. Structures
+
+ For the purposes of this section, we shall differentiate structures
+ according to whether or not they correspond to an application defined
+ C structure. Those that do are called intrinsic structures, and those
+ do not are called S-Lang interpreter structures.
+
+ 5.5.2.1. Interpreter Structures
+
+ The following simple example shows one method that may be used to
+ create and return a structure with a string and integer field to the
+ interpreter's stack:
+
+ int push_struct_example (char *string_value, int int_value)
+ {
+ char *field_names2;
+ SLtype field_types2;
+ VOID_STAR field_values2;
+
+ field_names0 = "string_field";
+ field_types0 = SLANG_STRING_TYPE;
+ field_values0 = &string_value;
+
+ field_names1 = "int_field";
+ field_types1 = SLANG_INT_TYPE;
+ field_values1 = &int_value;
+
+ if (-1 == SLstruct_create_struct (2, field_names,
+ field_types, field_values))
+ return -1;
+ return 0;
+ }
+
+ Here, SLstruct_create_struct is used to push a structure with the
+ specified field names and values onto the interpreter's stack.
+
+ A simpler mechanism exists provided that one has already defined a C
+ structure with a description of how the structure is laid out. For
+ example, consider a C structure defined by
+
+ typedef struct
+ {
+ char *s;
+ int i;
+ }
+ SI_Type;
+
+ Its layout may be specified via a table of SLang_CStruct_Field_Type
+ entries:
+
+ SLang_CStruct_Field_Type SI_Type_Layout =
+ {
+ MAKE_CSTRUCT_FIELD(SI_Type, s, "string_field", SLANG_STRING_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(SI_Type, i, "int_field", SLANG_INT_TYPE, 0),
+ SLANG_END_CSTRUCT_TABLE
+ };
+
+ Here, MAKE_CSTRUCT_FIELD is a macro taking 5 arguments:
+
+ MAKE_CSTRUCT_FIELD(C-structure-type,
+ C-field-name,
+ slang-field-name,
+ slang-data-type,
+ is-read-only)
+
+ The first argument is the structure type, the second is the name of a
+ field of the structure, the third is a string that specifies the name
+ of the corresponding field of the S-Lang structure, the fourth argu-
+ ment specifies the field's type, and the last argument specifies
+ whether or not the field should be regarded as read-only.
+
+ Once the layout of the structure has been specified, pushing a S-Lang
+ version of the structure is trival:
+
+ int push_struct_example (char *string_value, int int_value)
+ {
+ SI_Type si;
+
+ si.s = string_value;
+ si.i = int_value;
+ return SLang_push_cstruct ((VOID_STAR)&si, SI_Type_Layout);
+ }
+
+ This mechanism of structure creation also permits a S-Lang structure
+ to be passed to an intrinsic function through the use of the
+ SLang_pop_cstruct routine, e.g.,
+
+ void print_si_struct (void)
+ {
+ SI_Type si;
+ if (-1 == SLang_pop_cstruct ((VOID_STAR)&si, SI_Type_Layout))
+ return;
+ printf ("si.i=%d", si.i);
+ printf ("si.s=%s", si.s);
+ SLang_free_cstruct ((VOID_STAR)&si, SI_Type_Layout);
+ }
+
+ Assuming print_si_struct exists as an intrinsic function, the S-Lang
+ code
+
+ variable s = struct {string_field, int_field};
+ s.string_field = "hello";
+ s.int_field = 20;
+ print_si_struct (s);
+
+ would result in the display of
+
+ si.i=20;
+ si.s=hello
+
+ Note that the SLang_free_cstruct function was called after the con-
+ tents of si were nolonger needed. This was necessary because
+ SLang_pop_cstruct allocated memory to set the char *s field of si.
+ Calling SLang_free_cstruct frees up such memory.
+
+ Now consider the following:
+
+ typedef struct
+ {
+ pid_t pid;
+ gid_t group;
+ }
+ X_t;
+
+ How should the layout of this structure be defined? One might be
+ tempted to use:
+
+ SLang_CStruct_Field_Type X_t_Layout =
+ {
+ MAKE_CSTRUCT_FIELD(X_t, pid, "pid", SLANG_INT_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(X_t, group, "group", SLANG_INT_TYPE, 0),
+ SLANG_END_CSTRUCT_TABLE
+ };
+
+ However, this assumes pid_t and gid_t have been typedefed as ints. But
+ what if gid_t is a short? In such a case, using
+
+ MAKE_CSTRUCT_FIELD(X_t, group, "group", SLANG_SHORT_TYPE, 0),
+
+ would be the appropriate entry for the group field. Of course, one has
+ no way of knowing how gid_t is declared on other systems. For this
+ reason, it is preferable to use the MAKE_CSTRUCT_INT_FIELD macro in
+ cases involving integer valued fields, e.g.,
+
+ SLang_CStruct_Field_Type X_t_Layout =
+ {
+ MAKE_CSTRUCT_INT_FIELD(X_t, pid, "pid", 0),
+ MAKE_CSTRUCT_INT_FIELD(X_t, group, "group", 0),
+ SLANG_END_CSTRUCT_TABLE
+ };
+
+ Before leaving this section, it is important to mention that access to
+ character array fields is not permitted via this interface. That is, a
+ structure such as
+
+ typedef struct
+ {
+ char name32;
+ }
+ Name_Type;
+
+ is not supported since char name32 is not a SLANG_STRING_TYPE
+ object. Always keep in mind that a SLANG_STRING_TYPE object is a char
+ *.
+
+ 5.5.2.2. Intrinsic Structures
+
+ Here we show how to make intrinsic structures available to the
+ interpreter.
+
+ The simplest interface is to structure pointers and not to the actual
+ structures themselves. The latter would require the interpreter to be
+ involved with the creation and destruction of the structures. Dealing
+ with the pointers themselves is far simpler.
+
+ As an example, consider an object such as
+
+ typedef struct _Window_Type
+ {
+ char *title;
+ int row;
+ int col;
+ int width;
+ int height;
+ } Window_Type;
+
+ which defines a window object with a title, size (width, height), and
+ location (row, col).
+
+ We can make variables of type Window_Type available to the interpreter
+ via a table as follows:
+
+ static SLang_IStruct_Field_Type Window_Type_Field_Table =
+ {
+ MAKE_ISTRUCT_FIELD(Window_Type, title, "title", SLANG_STRING_TYPE, 1),
+ MAKE_ISTRUCT_FIELD(Window_Type, row, "row", SLANG_INT_TYPE, 0),
+ MAKE_ISTRUCT_FIELD(Window_Type, col, "col", SLANG_INT_TYPE, 0),
+ MAKE_ISTRUCT_FIELD(Window_Type, width, "width", SLANG_INT_TYPE, 0),
+ MAKE_ISTRUCT_FIELD(Window_Type, height, "height", SLANG_INT_TYPE, 0),
+ SLANG_END_ISTRUCT_TABLE
+ };
+
+ More precisely, this defines the layout of the Window_Type structure.
+ Here, the title has been declared as a read-only field. Using
+
+ MAKE_ISTRUCT_FIELD(Window_Type, title, "title", SLANG_STRING_TYPE, 0),
+
+ would allow read-write access.
+
+ Now suppose that My_Window is a pointer to a Window_Type object, i.e.,
+
+ Window_Type *My_Window;
+
+ We can make this variable available to the interpreter via the
+ SLadd_istruct_table function:
+
+ if (-1 == SLadd_istruct_table (Window_Type_Field_Table,
+ (VOID_STAR) &My_Window,
+ "My_Win"))
+ exit (1);
+
+ This creates a S-Lang interpreter variable called My_Win whose value
+ corresponds to the My_Win structure. This would permit one to access
+ the fields of My_Window via S-Lang statements such as
+
+ define set_width_and_height (w,h)
+ {
+ My_Win.width = w;
+ My_Win.height = h;
+ }
+
+ It is extremely important to understand that the interface described
+ in this section does not allow the interpreter to create new instances
+ of Window_Type objects. The interface merely defines an association or
+ correspondence between an intrinsic structure pointer and a S-Lang
+ variable. For example, if the value of My_Window is NULL, then My_Win
+ would also be NULL.
+
+ One should be careful in allowing read/write access to character
+ string fields. If read/write access is allowed, then the application
+ should always use the SLang_create_slstring and SLang_free_slstring
+ functions to set the character string field of the structure.
+
+ 5.6. Signals
+
+ If your program that embeds the interpreter processes signals, then it
+ may be undesirable to allow access to all signals from the
+ interpreter. For example, if your program has a signal handler for
+ SIGHUP then it is possible that an interpreter script could specify a
+ different signal handler, which may or may not be desirable. If you
+ do not want to allow the interpreter access to some signal, then that
+ signal can be made off-limits to the interpreter via the
+ SLsig_forbid_signal function:
+
+ /* forbid a signal handler for SIGHUP */
+ SLsig_forbid_signal (SIGHUP, 1);
+
+ /* Allow a signal handler for SIGTERM */
+ SLsig_forbid_signal (SIGTERM, 0);
+
+ By default, all signals are allowed access from the interpreter.
+
+ 5.7. Exceptions
+
+ 6. Keyboard Interface
+
+ S-Lang's keyboard interface has been designed to allow an application
+ to read keyboard input from the user in a system-independent manner.
+ The interface consists of a set of low routines for reading single
+ character data as well as a higher level interface (SLkp) which
+ utilize S-Lang's keymap facility for reading multi-character
+ sequences.
+
+ To initialize the interface, one must first call the function
+ SLang_init_tty. Before exiting the program, the function
+ SLang_reset_tty must be called to restore the keyboard interface to
+ its original state. Once initialized, the low-level SLang_getkey
+ function may be used to read single keyboard characters from the
+ terminal. An application using the higher-level SLkp interface will
+ read charcters using the SLkp_getkey function.
+
+ In addition to these basic functions, there are also functions to
+ ``unget'' keyboard characters, flush the input, detect pending-input
+ with a timeout, etc. These functions are defined below.
+
+ 6.1. Initializing the Keyboard Interface
+
+ The function SLang_init_tty must be called to initialize the terminal
+ for single character input. This puts the terminal in a mode usually
+ referred to as ``raw'' mode.
+
+ The prototype for the function is:
+
+ int SLang_init_tty (int abort_char, int flow_ctrl, int opost);
+
+ It takes three parameters that are used to specify how the terminal is
+ to be initialized.
+
+ The first parameter, abort_char, is used to specify the interrupt
+ character (SIGINT). Under MSDOS, this value corresponds to the scan
+ code of the character that will be used to generate the interrupt. For
+ example, under MSDOS, 34 should be used to make Ctrl-G generate an
+ interrupt signal since 34 is the scan code for G. On other systems,
+ the value of abort_char will simply be the ascii value of the control
+ character that will be used to generate the interrupt signal, e.g., 7
+ for Ctrl-G. If -1 is passed, the interrupt character will not be
+ changed.
+
+ Pressing the interrupt character specified by the first argument will
+ generate a signal (SIGINT) that may or not be caught by the
+ application. It is up to the application to catch this signal. S-Lang
+ provides the function Slang_set_abort_signal to make it easy to
+ facilitate this task.
+
+ The second parameter is used to specify whether or not flow control
+ should be used. If this parameter is zero, flow control is enabled.
+ If the value is positive, flow control will be disabled. Disabling
+ flow control is necessary to pass certain characters to the
+ application (e.g., Ctrl-S and Ctrl-Q). Otherwise, the value is
+ negative and the flow control behavior will be inherited from the
+ terminal. The latter interpretation was added to version 2.3.0 of the
+ library; earlier versions disabled flow control for both positive and
+ negative values of this parameter. For some systems such as MSDOS,
+ this parameter is meaningless.
+
+ The third parameter, opost, is used to turn output processing on or
+ off. If opost is zero, output processing is not turned on otherwise,
+ output processing is turned on.
+
+ The SLang_init_tty function returns -1 upon failure. In addition,
+ after it returns, the S-Lang global variable SLang_TT_Baud_Rate will
+ be set to the baud rate of the terminal if this value can be
+ determined.
+
+ Example:
+
+ if (-1 == SLang_init_tty (7, 0, 0)) /* For MSDOS, use 34 as scan code */
+ {
+ fprintf (stderr, "Unable to initialize the terminal.\n");
+ exit (1);
+ }
+ SLang_set_abort_signal (NULL);
+
+ Here the terminal is initialized such that flow control and output
+ processing are turned off. In addition, the character Ctrl-G (-- For
+ MSDOS systems, use the scan code 34 instead of 7 for Ctrl-G--) has
+ been specified to be the interrupt character. The function
+ SLang_set_abort_signal is used to install the default S-Lang interrupt
+ signal handler.
+
+ 6.2. Resetting the Keyboard Interface
+
+ The function SLang_reset_tty must be called to reset the terminal to
+ the state it was in before the call to SLang_init_tty. The prototype
+ for this function is:
+
+ void SLang_reset_tty (void);
+
+ Usually this function is only called before the program exits. How-
+ ever, if the program is suspended it should also be called just before
+ suspension.
+
+ 6.3. Initializing the SLkp Routines
+
+ Extra initialization of the higher-level SLkp functions are required
+ because they are layered on top of the lower level routines. Since the
+ SLkp_getkey function is able to process function and arrow keys in a
+ terminal independent manner, it is necessary to call the
+ SLtt_get_terminfo function to get information about the escape
+ character sequences that the terminal's function keys send. Once that
+ information is available, the SLkp_init function can construct the
+ proper keymaps to process the escape sequences.
+
+ This part of the initialization process for an application using this
+ interface will look something like:
+
+ SLtt_get_terminfo ();
+ if (-1 == SLkp_init ())
+ {
+ SLang_doerror ("SLkp_init failed.");
+ exit (1);
+ }
+ if (-1 == SLang_init_tty (-1, 0, 1))
+ {
+ SLang_doerror ("SLang_init_tty failed.");
+ exit (1);
+ }
+
+ It is important to check the return status of the SLkp_init function
+ which can failed if it cannot allocate enough memory for the keymap.
+
+ 6.4. Setting the Interrupt Handler
+
+ The function SLang_set_abort_signal may be used to associate an
+ interrupt handler with the interrupt character that was previously
+ specified by the SLang_init_tty function call. The prototype for this
+ function is:
+
+ void SLang_set_abort_signal (void (*)(int));
+
+ This function returns nothing and takes a single parameter which is a
+ pointer to a function taking an integer value and returning void. If a
+ NULL pointer is passed, the default S-Lang interrupt handler will be
+ used. The S-Lang default interrupt handler under Unix looks like:
+
+ static void default_sigint (int sig)
+ {
+ SLsignal_intr (SIGINT, default_sigint);
+ SLKeyBoard_Quit = 1;
+ if (SLang_Ignore_User_Abort == 0)
+ SLang_set_error (SL_UserBreak_Error);
+ }
+
+ It simply sets the global variable SLKeyBoard_Quit to one and if the
+ variable SLang_Ignore_User_Abort is non-zero, the error state is set
+ to indicate a user break condition. (The function SLsignal_intr is
+ similar to the standard C signal function except that it will inter-
+ rupt system calls. Some may not like this behavior and may wish to
+ call this SLang_set_abort_signal with a different handler.)
+
+ Although the function expressed above is specific to Unix, the
+ analogous routines for other operating systems are equivalent in
+ functionality even though the details of the implementation may vary
+ drastically (e.g., under MSDOS, the hardware keyboard interrupt int 9h
+ is hooked).
+
+ 6.5. Reading Keyboard Input with SLang_getkey
+
+ After initializing the keyboard via SLang_init_tty, the S-Lang
+ function SLang_getkey may be used to read characters from the terminal
+ interface. In addition, the function SLang_input_pending may be used
+ to determine whether or not keyboard input is available to be read.
+
+ These functions have prototypes:
+
+ unsigned int SLang_getkey (void);
+ int SLang_input_pending (int tsecs);
+
+ The SLang_getkey function returns a single character from the termi-
+ nal. Upon failure, it returns 0xFFFF. If the interrupt character spec-
+ ified by the SLang_init_tty function is pressed while this function is
+ called, the function will return the value of the interrupt character
+ and set the S-Lang global variable SLKeyBoard_Quit to a non-zero
+ value. In addition, if the default S-Lang interrupt handler has been
+ specified by a NULL argument to the SLang_set_abort_signal function,
+ the error state of the library will be set to SL_UserBreak_Error
+ unless the variable SLang_Ignore_User_Abort is non-zero.
+
+ The SLang_getkey function waits until input is available to be read.
+ The SLang_input_pending function may be used to determine whether or
+ not input is ready. It takes a single parameter that indicates the
+ amount of time to wait for input before returning with information
+ regarding the availability of input. This parameter has units of one
+ tenth (1/10) of a second, i.e., to wait one second, the value of the
+ parameter should be 10. Passing a value of zero causes the function to
+ return right away. SLang_input_pending returns a positive integer if
+ input is available or zero if input is not available. It will return
+ -1 if an error occurs.
+
+ Here is a simple example that reads keys from the terminal until one
+ presses Ctrl-G or until 5 seconds have gone by with no input:
+
+ #include <stdio.h>
+ #include <slang.h>
+ int main ()
+ {
+ int abort_char = 7; /* For MSDOS, use 34 as scan code */
+ unsigned int ch;
+
+ if (-1 == SLang_init_tty (abort_char, 0, 1))
+ {
+ fprintf (stderr, "Unable to initialize the terminal.\n");
+ exit (-1);
+ }
+ SLang_set_abort_signal (NULL);
+ while (1)
+ {
+ fputs ("\nPress any key. To quit, press Ctrl-G: ", stdout);
+ fflush (stdout);
+ if (SLang_input_pending (50) == 0) /* 50/10 seconds */
+ {
+ fputs ("Waited too long! Bye\n", stdout);
+ break;
+ }
+
+ ch = SLang_getkey ();
+ if (SLang_get_error () == SL_UserBreak_Error)
+ {
+ fputs ("Ctrl-G pressed! Bye\n", stdout);
+ break;
+ }
+ putc ((int) ch, stdout);
+ }
+ SLang_reset_tty ();
+ return 0;
+ }
+
+ 6.6. Reading Keyboard Input with SLkp_getkey
+
+ Unlike the low-level function SLang_getkey, the SLkp_getkey function
+ can read a multi-character sequence associated with function keys. The
+ SLkp_getkey function uses SLang_getkey and S-Lang's keymap facility to
+ process escape sequences. It returns a single integer which describes
+ the key that was pressed:
+
+ int SLkp_getkey (void);
+
+ That is, the SLkp_getkey function simple provides a mapping between
+ keys and integers. In this context the integers are called keysyms.
+
+ For single character input such as generated by the a key on the
+ keyboard, the function returns the character that was generated, e.g.,
+ 'a'. For single characters, SLkp_getkey will always return an keysym
+ whose value ranges from 0 to 256. For keys that generate multiple
+ character sequences, e.g., a function or arrow key, the function
+ returns an keysym whose value is greater that 256. The actual values
+ of these keysyms are represented as macros defined in the slang.h
+ include file. For example, the up arrow key corresponds to the keysym
+ whose value is SL_KEY_UP.
+
+ Since it is possible for the user to enter a character sequence that
+ does not correspond to any key. If this happens, the special keysym
+ SL_KEY_ERR will be returned.
+
+ Here is an example of how SLkp_getkey may be used by a file viewer:
+
+ switch (SLkp_getkey ())
+ {
+ case ' ':
+ case SL_KEY_NPAGE:
+ next_page ();
+ break;
+ case 'b':
+ case SL_KEY_PPAGE:
+ previous_page ();
+ break;
+ case '\r':
+ case SL_KEY_DOWN:
+ next_line ();
+ break;
+ .
+ .
+ case SL_KEY_ERR:
+ default:
+ SLtt_beep ();
+ }
+
+ Unlike its lower-level counterpart, SLang_getkey, there do not yet
+ exist any functions in the library that are capable of ``ungetting''
+ keysyms. In particular, the SLang_ungetkey function will not work.
+
+ 6.7. Buffering Input
+
+ S-Lang has several functions pushing characters back onto the input
+ stream to be read again later by SLang_getkey. It should be noted that
+ none of the above functions are designed to push back keysyms read by
+ the SLkp_getkey function. These functions are declared as follows:
+
+ void SLang_ungetkey (unsigned char ch);
+ void SLang_ungetkey_string (unsigned char *buf, int buflen);
+ void SLang_buffer_keystring (unsigned char *buf, int buflen);
+
+ SLang_ungetkey is the most simple of the three functions. It takes a
+ single character a pushes it back on to the input stream. The next
+ call to SLang_getkey will return this character. This function may be
+ used to peek at the character to be read by first reading it and then
+ putting it back.
+
+ SLang_ungetkey_string has the same function as SLang_ungetkey except
+ that it is able to push more than one character back onto the input
+ stream. Since this function can push back null (ascii 0) characters,
+ the number of characters to push is required as one of the parameters.
+
+ The last of these three functions, SLang_buffer_keystring can handle
+ more than one charater but unlike the other two, it places the
+ characters at the end of the keyboard buffer instead of at the
+ beginning.
+
+ Note that the use of each of these three functions will cause
+ SLang_input_pending to return right away with a non-zero value.
+
+ Finally, the S-Lang keyboard interface includes the function
+ SLang_flush_input with prototype
+
+ void SLang_flush_input (void);
+
+ It may be used to discard all input.
+
+ Here is a simple example that looks to see what the next key to be
+ read is if one is available:
+
+ int peek_key ()
+ {
+ int ch;
+ if (SLang_input_pending (0) == 0) return -1;
+ ch = SLang_getkey ();
+ SLang_ungetkey (ch);
+ return ch;
+ }
+
+ 6.8. Global Variables
+
+ Although the following S-Lang global variables have already been
+ mentioned earlier, they are gathered together here for completeness.
+
+ int SLang_Ignore_User_Abort; If non-zero, pressing the interrupt
+ character will not result in the libraries error state set to
+ SL_UserBreak_Error.
+
+ volatile int SLKeyBoard_Quit; This variable is set to a non-zero value
+ when the interrupt character is pressed. If the interrupt character is
+ pressed when SLang_getkey is called, the interrupt character will be
+ returned from SLang_getkey.
+
+ int SLang_TT_Baud_Rate; On systems which support it, this variable is
+ set to the value of the terminal's baud rate after the call to
+ SLang_init_tty.
+
+ 7. Readline Interface
+
+ The S-Lang library includes simple but capable readline functionality
+ in its SLrline layer. The SLrline routines provide a simple mechanism
+ for an application to get prompted input from a user with command line
+ editing, completions, and history recall.
+
+ The use of the SLrline routines will be illustrated with a few simple
+ examples. All of the examples given in this section may be found in
+ the file demo/rline.c in the S-Lang source code distribution. For
+ clarity, the code shown below omits most error checking.
+
+ 7.1. Introduction
+
+ The first example simply reads input from the user until the user
+ enters quit:
+
+ SLrline_Type *rl;
+ SLang_init_tty (-1, 0, 1);
+ rl = SLrline_open (80, SL_RLINE_BLINK_MATCH);
+ while (1)
+ {
+ char *line;
+ unsigned int len;
+
+ line = SLrline_read_line (rl, "prompt>", &len);
+ if (line == NULL) break;
+ if (0 == strcmp (line, "quit"))
+ {
+ SLfree (line);
+ break;
+ }
+ (void) fprintf (stdout, "\nRead %d bytes: %s\n", strlen(line), line);
+ SLfree (line);
+ }
+ SLrline_close (rl);
+ SLang_reset_tty ();
+
+ In this example, the SLtt interface functions SLang_init_tty and
+ SLang_reset_tty functions have been used to open and close the termi-
+ nal for reading input. By default, the SLrline functions use the
+ SLang_getkey function to read characters and assume that the terminal
+ has been properly initialized before use.
+
+ The SLrline_open function was used to create an instance of an
+ SLrline_Type object. The function takes two arguments: and edit window
+ display width (80 above), and a set of flags. In this case, the
+ SL_RLINE_BLINK_MATCH flags has been used to turn on parenthesis
+ blinking. Once finished, the SLrline_Type object must be freed using
+ the SLrline_close function.
+
+ The actual reading of the line occurs in the SLrline_read_line
+ function, which takes an SLrline_Type instance and a string
+ representing the prompt to be used. The line itself is returned as a
+ malloced char * and must be freed using the SLfree function after
+ used. The length (in bytes) of the line is returned via the parameter
+ list.
+
+ If an end-of-file character (^D on Unix) was entered at the beginning
+ of a line, the SLrline_read_line function will return NULL. However,
+ it also return NULL if an error of some sort was encountered. The only
+ way to tell the difference between these two conditions is to call
+ SLang_get_error.
+
+ The above code fragment did not provide for any sort of SIGINT
+ handling. Without such a provision, pressing ^C at the prompt could be
+ enough to kill the application. This is especially undesirable if one
+ wants to press ^C to abort the call to SLrline_read_line. The function
+ example_2 in demo/rline.c shows code to handle this situation as well
+ as distinguish between EOF and other errors.
+
+ 7.2. Interpreter Interface
+
+ SLrline features such as command-line completion, vi-emulation, and so
+ on are implemented through callbacks or hooks from the SLrline
+ functions to the S-Lang interpreter. Hence, this functionality is only
+ available to applications that make use of the interpreter.
+
+ TBD...
+
+ 8. Screen Management
+
+ The S-Lang library provides two interfaces to terminal independent
+ routines for manipulating the display on a terminal. The highest level
+ interface, known as the SLsmg interface is discussed in this section.
+ It provides high level screen management functions for manipulating
+ the display in an optimal manner and is similar in spirit to the
+ curses library. The lowest level interface, or the SLtt interface, is
+ used by the SLsmg routines to actually perform the task of writing to
+ the display. This interface is discussed in another section. Like the
+ keyboard routines, the SLsmg routines are platform independent and
+ work the same on MSDOS, OS/2, Unix, and VMS.
+
+ The screen management, or SLsmg, routines are initialized by function
+ SLsmg_init_smg. Once initialized, the application uses various SLsmg
+ functions to write to a virtual display. This does not cause the
+ physical terminal display to be updated immediately. The physical
+ display is updated to look like the virtual display only after a call
+ to the function SLsmg_refresh. Before exiting, the application using
+ these routines is required to call SLsmg_reset_smg to reset the
+ display system.
+
+ The following subsections explore S-Lang's screen management system in
+ greater detail.
+
+ 8.1. Initialization
+
+ The function SLsmg_init_smg must be called before any other SLsmg
+ function can be used. It has the simple prototype:
+
+ int SLsmg_init_smg (void);
+
+ It returns zero if successful or -1 if it cannot allocate space for
+ the virtual display.
+
+ For this routine to properly initialize the virtual display, the
+ capabilities of the terminal must be known as well as the size of the
+ physical display. For these reasons, the lower level SLtt routines
+ come into play. In particular, before the first call to
+ SLsmg_init_smg, the application is required to call the function
+ SLtt_get_terminfo before calling SLsmg_init_smg.
+
+ The SLtt_get_terminfo function sets the global variables
+ SLtt_Screen_Rows and SLtt_Screen_Cols to the values appropriate for
+ the terminal. It does this by calling the SLtt_get_screen_size
+ function to query the terminal driver for the appropriate values for
+ these variables. From this point on, it is up to the application to
+ maintain the correct values for these variables by calling the
+ SLtt_get_screen_size function whenever the display size changes, e.g.,
+ in response to a SIGWINCH signal. Finally, if the application is going
+ to read characters from the keyboard, it is also a good idea to
+ initialize the keyboard routines at this point as well.
+
+ 8.2. Resetting SLsmg
+
+ Before the program exits or suspends, the function SLsmg_reset_smg
+ should be called to shutdown the display system. This function has the
+ prototype
+
+ void SLsmg_reset_smg (void);
+
+ This will deallocate any memory allocated for the virtual screen and
+ reset the terminal's display.
+
+ Basically, a program that uses the SLsmg screen management functions
+ and S-Lang's keyboard interface will look something like:
+
+ #include <slang.h>
+ int main ()
+ {
+ SLtt_get_terminfo ();
+ SLang_init_tty (-1, 0, 0);
+ SLsmg_init_smg ();
+
+ /* do stuff .... */
+
+ SLsmg_reset_smg ();
+ SLang_reset_tty ();
+ return 0;
+ }
+
+ If this program is compiled and run, all it will do is clear the
+ screen and position the cursor at the bottom of the display. In the
+ following sections, other SLsmg functions will be introduced which may
+ be used to make this simple program do much more.
+
+ 8.3. Handling Screen Resize Events
+
+ The function SLsmg_reinit_smg is designed to be used in conjunction
+ with resize events.
+
+ Under Unix-like operating systems, when the size of the display
+ changes, the application will be sent a SIGWINCH signal. To properly
+ handle this signal, the SLsmg routines must be reinitialized to use
+ the new display size. This may be accomplished by calling
+ SLtt_get_screen_size to get the new size, followed by SLsmg_reinit_smg
+ to reinitialize the SLsmg interface to use the new size. Keep in mind
+ that these routines should not be called from within the signal
+ handler. The following code illustrates the main ideas involved in
+ handling such events:
+
+ static volatile int Screen_Size_Changed;
+ static sigwinch_handler (int sig)
+ {
+ Screen_Size_Changed = 1;
+ SLsignal (SIGWINCH, sigwinch_handler);
+ }
+
+ int main (int argc, char **argv)
+ {
+ SLsignal (SIGWINCH, sigwinch_handler);
+ SLsmg_init_smg ();
+ .
+ .
+ /* Now enter main loop */
+ while (not_done)
+ {
+ if (Screen_Size_Changed)
+ {
+ SLtt_get_screen_size ();
+ SLsmg_reinit_smg ();
+ redraw_display ();
+ }
+ .
+ .
+ }
+ return 0;
+ }
+
+ 8.4. SLsmg Functions
+
+ In the previous sections, functions for initializing and shutting down
+ the SLsmg routines were discussed. In this section, the rest of the
+ SLsmg functions are presented. These functions act only on the virtual
+ display. The physical display is updated when the SLsmg_refresh
+ function is called and not until that time. This function has the
+ simple prototype:
+
+ void SLsmg_refresh (void);
+
+ 8.4.1. Positioning the cursor
+
+ The SLsmg_gotorc function is used to position the cursor at a given
+ row and column. The prototype for this function is:
+
+ void SLsmg_gotorc (int row, int col);
+
+ The origin of the screen is at the top left corner and is given the
+ coordinate (0, 0), i.e., the top row of the screen corresponds to row
+ = 0 and the first column corresponds to col = 0. The last row of the
+ screen is given by row = SLtt_Screen_Rows - 1.
+
+ It is possible to change the origin of the coordinate system by using
+ the function SLsmg_set_screen_start with prototype:
+
+ void SLsmg_set_screen_start (int *r, int *c);
+
+ This function takes pointers to the new values of the first row and
+ first column. It returns the previous values by modifying the values
+ of the integers at the addresses specified by the parameter list. A
+ NULL pointer may be passed to indicate that the origin is to be set to
+ its initial value of 0. For example,
+
+ int r = 10;
+ SLsmg_set_screen_start (&r, NULL);
+
+ sets the origin to (10, 0) and after the function returns, the vari-
+ able r will have the value of the previous row origin.
+
+ 8.4.2. Writing to the Display
+
+ SLsmg has several routines for outputting text to the virtual display.
+ The following points should be understood:
+
+ o The text is output at the position of the cursor of the virtual
+ display and the cursor is advanced to the position that corresponds
+ to the end of the text.
+
+ o Text does not wrap at the boundary of the display--- it is
+ trucated. This behavior seems to be more useful in practice since
+ most programs that would use screen management tend to be line
+ oriented.
+
+ o Control characters are displayed in a two character sequence
+ representation with ^ as the first character. That is, Ctrl-X is
+ output as ^X.
+
+ o The behavior of the newline character depends upon the value of the
+ SLsmg_Newline_Behavior variable. It may be set to any one of the
+ following values:
+
+ SLSMG_NEWLINE_IGNORED : If a newline character is encountered when
+ writing a string to the virtual display, the characters in the
+ string following the newline character will not be written. In
+ other words, the newline character will act like a string
+ termination character. This is the default setting for the
+ SLsmg_Newline_Behavior.
+
+ SLSMG_NEWLINE_MOVES : If a newline character is when writing to the
+ virtual display, the following characters will be written to the
+ beginning of the next row.
+
+ SLSMG_NEWLINE_SCROLLS : When set to this value and a newline
+ character is output at the bottom of the virtual display, the
+ display will scroll up. Otherwise the behavior will be the same as
+ that of SLSMG_NEWLINE_MOVES.
+
+ SLSMG_NEWLINE_PRINTABLE : When set to this value, a newline
+ character will be printed as the two characters sequence ^J.
+
+ Although the some of the above items might appear to be too
+ restrictive, in practice this is not seem to be the case. In fact, the
+ design of the output routines was influenced by their actual use and
+ modified to simplify the code of the application utilizing them.
+
+ void SLsmg_write_char (char ch);
+ Write a single character to the virtual display.
+
+ void SLsmg_write_nchars (char *str, int len);
+ Write len characters pointed to by str to the virtual display.
+
+ void SLsmg_write_string (char *str);
+ Write the null terminated string given by pointer str to the
+ virtual display. This function is a wrapper around
+ SLsmg_write_nchars.
+
+ void SLsmg_write_nstring (char *str, int n);
+ The purpose of this function is to write a null terminated
+ string to a field that is at most n cells wide. Each double-wide
+ character in the string will use two cells. If the string is not
+ big enough to fill the n cells, the rest of the cells will be
+ filled with space characters. This function is a wrapper around
+ SLsmg_write_wrapped_string.
+
+ void SLsmg_write_wrapped_string(SLuchar_Type *str, int r, int c,
+ unsigned int dr, unsigned int dc, int fill)
+ The purpose of this function is to write a string str to a box
+ defined by rows and columns satisfying r<=row<r+dc and
+ c<=column<c+dc. The string will be wrapped at the column
+ boundaries of the box and truncated if its size exceeds to size
+ of the box. If the total size of the string is less than that of
+ the box, and the fill parameter is non-zero, then the rest of
+ the cells in the box will be filled with space characters.
+ Currently the wrapping algorithm is very simple and knows
+ nothing about word boundaries.
+
+ void SLsmg_printf (char *fmt, ...);
+ This function is similar to printf except that it writes to the
+ SLsmg virtual display.
+
+ void SLsmg_vprintf (char *, va_list);
+ Like SLsmg_printf but uses a variable argument list.
+
+ 8.4.3. Erasing the Display
+
+ The following functions may be used to fill portions of the display
+ with blank characters. The attributes of blank character are the
+ current attributes. (See below for a discussion of character
+ attributes)
+
+ void SLsmg_erase_eol (void);
+ Erase line from current position to the end of the line.
+
+ void SLsmg_erase_eos (void);
+ Erase from the current position to the end of the screen.
+
+ void SLsmg_cls (void);
+ Clear the entire virtual display.
+
+ 8.4.4. Setting Character Attributes
+
+ Character attributes define the visual characteristics the character
+ possesses when it is displayed. Visual characteristics include the
+ foreground and background colors as well as other attributes such as
+ blinking, bold, and so on. Since SLsmg takes a different approach to
+ this problem than other screen management libraries an explanation of
+ this approach is given here. This approach has been motivated by
+ experience with programs that require some sort of screen management.
+
+ Most programs that use SLsmg are composed of specific textual objects
+ or objects made up of line drawing characters. For example, consider
+ an application with a menu bar with drop down menus. The menus might
+ be enclosed by some sort of frame or perhaps a shadow. The basic idea
+ is to associate an integer to each of the objects (e.g., menu bar,
+ shadow, current menu item, etc.) and create a mapping from the integer
+ to the set of attributes. In the terminology of SLsmg, the integer is
+ simply called an object.
+
+ For example, the menu bar might be associated with the object 1, the
+ drop down menu could be object 2, the shadow could be object 3, and so
+ on.
+
+ The range of values for the object integer is restricted from 0 up to
+ and including 255 on all systems except MSDOS where the maximum
+ allowed integer is 15 (-- This difference is due to memory constraints
+ imposed by MSDOS. This restriction might be removed in a future
+ version of the library.--) . The object numbered zero should not be
+ regarding as an object at all. Rather it should be regarded as all
+ other objects that have not explicitly been given an object number.
+ SLsmg, or more precisely SLtt, refers to the attributes of this
+ special object as the default or normal attributes.
+
+ The SLsmg routines know nothing about the mapping of the color to the
+ attributes associated with the color. The actual mapping takes place
+ at a lower level in the SLtt routines. Hence, to map an object to the
+ actual set of attributes requires a call to any of the following SLtt
+ routines:
+
+ void SLtt_set_color (int obj, char *name, char *fg, char *bg);
+ void SLtt_set_color_object (int obj, SLtt_Char_Type attr);
+ void SLtt_set_mono (int obj, char *, SLtt_Char_Type attr);
+
+ Only the first of these routines will be discussed briefly here. The
+ latter two functions allow more fine control over the object to
+ attribute mapping (such as assigning a ``blink'' attribute to the
+ object). For a more full explanation on all of these routines see the
+ section about the SLtt interface.
+
+ The SLtt_set_color function takes four parameters. The first
+ parameter, obj, is simply the integer of the object for which
+ attributes are to be assigned. The second parameter is currently
+ unused by these routines. The third and forth parameters, fg and bg,
+ are the names of the foreground and background color to be used
+ associated with the object. The strings that one can use for the third
+ and fourth parameters can be any one of the 16 colors:
+
+ "black" "gray"
+ "red" "brightred"
+ "green" "brightgreen"
+ "brown" "yellow"
+ "blue" "brightblue"
+ "magenta" "brightmagenta"
+ "cyan" "brightcyan"
+ "lightgray" "white"
+
+ The value of the foreground parameter fg can be anyone of these six-
+ teen colors. However, on most terminals, the background color will can
+ only be one of the colors listed in the first column (-- This is also
+ true on the Linux console. However, it need not be the case and hope-
+ fully the designers of Linux will someday remove this restriction.--)
+ .
+
+ Of course not all terminals are color terminals. If the S-Lang global
+ variable SLtt_Use_Ansi_Colors is non-zero, the terminal is assumed to
+ be a color terminal. The SLtt_get_terminfo will try to determine
+ whether or not the terminal supports colors and set this variable
+ accordingly. It does this by looking for the capability in the
+ terminfo/termcap database. Unfortunately many Unix databases lack this
+ information and so the SLtt_get_terminfo routine will check whether or
+ not the environment variable COLORTERM exists. If it exists, the
+ terminal will be assumed to support ANSI colors and
+ SLtt_Use_Ansi_Colors will be set to one. Nevertheless, the
+ application should provide some other mechanism to set this variable,
+ e.g., via a command line parameter.
+
+ When the SLtt_Use_Ansi_Colors variable is zero, all objects with
+ numbers greater than one will be displayed in inverse video (-- This
+ behavior can be modified by using the SLtt_set_mono function call.--)
+ .
+
+ With this background, the SLsmg functions for setting the character
+ attributes can now be defined. These functions simply set the object
+ attributes that are to be assigned to subsequent characters written to
+ the virtual display. For this reason, the new attribute is called the
+ current attribute.
+
+ void SLsmg_set_color (int obj);
+ Set the current attribute to those of object obj.
+
+ void SLsmg_normal_video (void);
+ This function is equivalent to SLsmg_set_color (0).
+
+ void SLsmg_reverse_video (void);
+ This function is equivalent to SLsmg_set_color (1). On
+ monochrome terminals, it is equivalent to setting the subsequent
+ character attributes to inverse video.
+
+ Unfortunately there does not seem to be a standard way for the
+ application or, in particular, the library to determine which color
+ will be used by the terminal for the default background. Such
+ information would be useful in initializing the foreground and
+ background colors associated with the default color object (0). For
+ this reason, it is up to the application to provide some means for the
+ user to indicate what these colors are for the particular terminal
+ setup. To facilitate this, the SLtt_get_terminfo function checks for
+ the existence of the COLORFGBG environment variable. If this variable
+ exists, its value will be used to initialize the colors associated
+ with the default color object. Specifically, the value is assumed to
+ consist of a foreground color name and a background color name
+ separated by a semicolon. For example, if the value of COLORFGBG is
+ lightgray;blue, the default color object will be initialized to
+ represent a lightgray foreground upon a blue background.
+
+ 8.4.5. Lines and Alternate Character Sets
+
+ The S-Lang screen management library also includes routines for
+ turning on and turning off alternate character sets. This is
+ especially useful for drawing horizontal and vertical lines.
+
+ void SLsmg_set_char_set (int flag);
+ If flag is non-zero, subsequent write functions will use
+ characters from the alternate character set. If flag is zero,
+ the default, or, ordinary character set will be used.
+
+ void SLsmg_draw_hline (int len);
+ Draw a horizontal line from the current position to the column
+ that is len characters to the right.
+
+ void SLsmg_draw_vline (int len);
+ Draw a horizontal line from the current position to the row that
+ is len rows below.
+
+ void SLsmg_draw_box (int r, int c, int dr, int dc);
+ Draw a box whose upper right corner is at row r and column c.
+ The box spans dr rows and dc columns. The current position will
+ be left at row r and column c.
+
+ 8.4.6. Miscellaneous Functions
+
+ void SLsmg_touch_lines (int r, int n);
+ Mark screen rows numbered r, r + 1, ... r + (n - 1) as modified.
+ When SLsmg_refresh is called, these rows will be completely
+ redrawn.
+
+ int SLsmg_char_at(SLsmg_Char_Type *ch);
+ Returns the character and its attributes at the current
+ position. The SLsmg_Char_Type object is a structure
+ representing the character cell:
+
+ #define SLSMG_MAX_CHARS_PER_CELL 5
+ typedef struct
+ {
+ unsigned int nchars;
+ SLwchar_Type wcharsSLSMG_MAX_CHARS_PER_CELL;
+ SLsmg_Color_Type color;
+ }
+ SLsmg_Char_Type;
+
+ Normally the value of the nchars field will be 1 to indicate that
+ the character contains precisely one character whose value is given
+ by the zeroth element of the wchars array of the structure. The
+ value of nchars will be greater than one if the character cell also
+ contains so-called Unicode combining characters. The combining
+ characters are given by the elements 1 through nchars-1 of the
+ wchars array. If nchars is 0, then the character cell represents
+ the second half of a double-wide character.
+
+ The color field repesents both the color of the character cell and
+ the alternate character set setting of the cell. This value may be
+ bitwise-anded with SLSMG_COLOR_MASK to obtain the cell's color, and
+ bitwise-anded with SLSMG_ACS_MASK to determine whether or not the
+ alternate-character set setting is in effect for the cell (zero or
+ non-zero).
+
+ 8.5. Variables
+
+ The following S-Lang global variables are used by the SLsmg interface.
+ Some of these have been previously discussed.
+
+ int SLtt_Screen_Rows; int SLtt_Screen_Cols; The number of rows and
+ columns of the physical display. If either of these numbers changes,
+ the functions SLsmg_reset_smg and SLsmg_init_smg should be called
+ again so that the SLsmg routines can re-adjust to the new size.
+
+ int SLsmg_Tab_Width; Set this variable to the tab width that will be
+ used when expanding tab characters. The default is 8.
+
+ int SLsmg_Display_Eight_Bit; This variable determines how characters
+ with the high bit set are to be output. Specifically, a character with
+ the high bit set with a value greater than or equal to this value is
+ output as is; otherwise, it will be output in a 7-bit representation.
+ The default value for this variable is 128 for MSDOS and 160 for other
+ systems (ISO-Latin). In UTF-8 mode, the value of this variable is 0.
+
+ int SLtt_Use_Ansi_Colors; If this value is non-zero, the terminal is
+ assumed to support ANSI colors otherwise it is assumed to be
+ monochrome. The default is 0.
+
+ int SLtt_Term_Cannot_Scroll; If this value is zero, the SLsmg will
+ attempt to scroll the physical display to optimize the update. If it
+ is non-zero, the screen management routines will not perform this
+ optimization. For some applications, this variable should be set to
+ zero. The default value is set by the SLtt_get_terminfo function.
+
+ 8.6. Hints for using SLsmg
+
+ This section discusses some general design issues that one must face
+ when writing an application that requires some sort of screen
+ management.
+
+ 9. Signal Functions
+
+ Almost all non-trivial programs must worry about signals. This is
+ especially true for programs that use the S-Lang terminal input/output
+ and screen management routines. Unfortunately, there is no fixed way
+ to handle signals; otherwise, the Unix kernel would take care of all
+ issues regarding signals and the application programmer would never
+ have to worry about them. For this reason, none of the routines in the
+ S-Lang library catch signals; however, some of the routines block the
+ delivery of signals during crucial moments. It is up to the
+ application programmer to install handlers for the various signals of
+ interest.
+
+ If the application makes use of the interpreter, then a signal handler
+ for SIGINT should be installed to allow the user to break out of the
+ interpreter via, e.g., Ctrl-C. In order for this to work, the signal
+ handler should call SLang_set_error to generate a SL_UserBreak_Error
+ exception, i.e.,
+
+ void sigint_handler (int sig)
+ {
+ if (SLang_Ignore_User_Abort == 0)
+ SLang_set_error (SL_UserBreak_Error);
+ }
+
+ Applications that use the tty getkey routines or the screen management
+ routines must worry about signals such as:
+
+ SIGINT interrupt
+ SIGTSTP stop
+ SIGQUIT quit
+ SIGTTOU background write
+ SIGTTIN background read
+ SIGWINCH window resize
+
+ It is important that handlers be established for these signals while
+ the either the SLsmg routines or the getkey routines are initialized.
+ The SLang_init_tty, SLang_reset_tty, SLsmg_init_smg, and
+ SLsmg_reset_smg functions block these signals from occurring while
+ they are being called.
+
+ Since a signal can be delivered at any time, it is important for the
+ signal handler to call only functions that can be called from a signal
+ handler. This usually means that such function must be re-entrant. In
+ particular, the SLsmg routines are not re-entrant; hence, they should
+ not be called when a signal is being processed unless the application
+ can ensure that the signal was not delivered while an SLsmg function
+ was called. This statement applies to many other functions such as
+ malloc, or, more generally, any function that calls malloc. The upshot
+ is that the signal handler should not attempt to do too much except
+ set a global variable for the application to look at while not in a
+ signal handler.
+
+ The S-Lang library provides two functions for blocking and unblocking
+ the above signals:
+
+ int SLsig_block_signals (void);
+ int SLsig_unblock_signals (void);
+
+ It should be noted that for every call to SLsig_block_signals, a cor-
+ responding call should be made to SLsig_unblock_signals, e.g.,
+
+ void update_screen ()
+ {
+ SLsig_block_signals ();
+
+ /* Call SLsmg functions */
+ .
+ .
+ SLsig_unblock_signals ();
+ }
+
+ See demo/pager.c for examples.
+
+ 10. Searching Functions
+
+ The S-Lang library incorporates two types of searches: Regular
+ expression pattern matching and ordinary searching.
+
+ 10.1. Simple Searches
+
+ S-Lang's SLsearch interface functions a convenient interface to the
+ famous Boyer-Moore fast searching algrothim. The searches can go in
+ either a forward or backward direction and and may be performed with
+ or without regard to case. Moreover, UTF-8 encoded strings are fully
+ supported by the interface.
+
+ 10.2. Regular Expressions
+
+ !!! No documentation available yet !!!
+
+ A. S-Lang 2 API NEWS and UPGRADE information
+
+ The S-Lang API underwent a number of changes for version 2. In
+ particular, the following interfaces have been affected:
+
+ SLsmg
+ SLregexp
+ SLsearch
+ SLrline
+ SLprep
+ slang interpreter modules
+
+ Detailed information about these changes is given below. Other changes
+ include:
+
+ o UTF-8 encoded strings are now supported at both the C library level
+ and the interpreter.
+
+ o Error handling by the interpreter has been rewritten to support
+ try/catch style exception. Applications may also define
+ application-specific error codes.
+
+ o The library may be compiled with large-file-support.
+
+ See the relevant chapters in this manual for more information.
+
+ A.1. SLang_Error
+
+ The SLang_Error variable is nolonger part of the API. Change code such
+ as
+
+ SLang_Error = foo;
+ if (SLang_Error == bar) ...
+
+ to
+
+ SLang_set_error (foo);
+ if (bar == SLang_get_error ()) ...
+
+ A.2. SLsmg/SLtt Functions
+
+ The changes to these functions were dictated by the new UTF-8 support.
+ For the most part, the changes should be transparent but some
+ functions and variables have been changed.
+
+ o SLtt_Use_Blink_For_ACS is nolonger supported, nor necessary I think
+ only DOSEMU uses this.
+
+ o Prototypes for SLsmg_draw_object and SLsmg_write_char were changed
+ to use wide characters (SLwchar_Type).
+
+ o SLsmg_Char_Type was changed from an unsigned short to a structure.
+ This change was necessary in order to support combining characters
+ and double width unicode characters. This change may affect the use
+ of the following functions:
+
+ SLsmg_char_at
+ SLsmg_read_raw
+ SLsmg_write_raw
+ SLsmg_write_color_chars
+
+ o The SLSMG_BUILD_CHAR macro has been removed. The
+ SLSMG_EXTRACT_CHAR macro will continue to work as long as combining
+ characters are not present.
+
+ o The prototype for SLsmg_char_at was changed to
+
+ int SLsmg_char_at (SLsmg_Char_Type *);
+
+ A.3. SLsearch Functions
+
+ SLsearch_Type is now an opaque type. Code such as
+
+ SLsearch_Type st;
+ SLsearch_init (string, 1, 0, &st);
+ .
+ .
+ s = SLsearch (buf, bufmax, &st);
+
+ which searches forward in buf for string must be changed to
+
+ SLsearch_Type *st = SLsearch_open (string, SLSEARCH_CASELESS);
+ if (st == NULL)
+ return;
+ .
+ .
+ s = SLsearch_forward (st, buf, bufmax);
+ .
+ .
+ SLsearch_close (st);
+
+ A.4. Regular Expression Functions
+
+ The slang v1 regular expression API has been redesigned in order to
+ facilitate the incorporation of third party regular expression
+ engines.
+
+ New functions include:
+
+ SLregexp_compile
+ SLregexp_free
+ SLregexp_match
+ SLregexp_nth_match
+ SLregexp_get_hints
+
+ The plan is to migrate to the use of the PCRE regular expressions for
+ version 2.2. As such, you may find it convenient to adopt the PCRE
+ library now instead of updating to the changed S-Lang API.
+
+ A.5. Readline Functions
+
+ The readline interface has changed in order to make it easier to use.
+ Using it now is as simple as:
+
+ SLrline_Type *rli;
+ rli = SLrline_open (SLtt_Screen_Cols, flags);
+ buf = SLrline_read_line (rli, prompt, &len);
+ /* Use buf */
+ .
+ .
+ SLfree (buf);
+ SLrline_close (rli);
+
+ See how it is used in slsh/readline.c.
+
+ A.6. Preprocessor Interface
+
+ SLPreprocess_Type was renamed to SLprep_Type and made opaque. New
+ functions include:
+
+ SLprep_new
+ SLprep_delete
+ SLprep_set_flags
+ SLprep_set_comment
+ SLprep_set_prefix
+ SLprep_set_exists_hook
+ SLprep_set_eval_hook
+
+ If you currently use:
+
+ SLPreprocess_Type pt;
+ SLprep_open_prep (&pt);
+ .
+ .
+ SLprep_close_prep (&pt);
+
+ Then change it to:
+
+ SLprep_Type *pt;
+ pt = SLprep_new ();
+ .
+ .
+ SLprep_delete (pt);
+
+ A.7. Functions dealing with the interpreter C API
+
+ o SLang_pop_double has been changed to be more like the other
+ SLang_pop_* functions. Now, it may be used as:
+
+ double x;
+ if (-1 == SLang_pop_double (&x))
+ .
+ .
+
+ o All the functions that previously took an "unsigned char" to
+ specify a slang data type have changed to require an SLtype.
+ Previously, SLtype was typedefed to be an unsigned char, but now it
+ is an int.
+
+ o The SLang_Class_Type object is now an opaque type. If you were
+ previously accessing its fields directly, then you will have to
+ change the code to use one of the accessor functions.
+
+ A.8. Modules
+
+ o In order to support the loading of a module into multiple
+ namespaces, a module's init function may be called more than once.
+ See modules/README for more information.
+
+ o The init_<module>_module function is no longer supported because it
+ did not support namespaces. Use the init_<module>_module_ns
+ function instead.
+
+ B. Copyright
+
+ The S-Lang library is distributed under the terms of the GNU General
+ Public License.
+
+ B.1. The GNU Public License
+
+ GNU GENERAL PUBLIC LICENSE
+ Version 2, June 1991
+
+ Copyright (C) 1989, 1991 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.
+
+ Preamble
+
+ The licenses for most software are designed to take away your freedom
+ to share and change it. By contrast, the GNU General Public License is
+ intended to guarantee your freedom to share and change free soft-
+ ware--to make sure the software is free for all its users. This Gen-
+ eral Public License applies to most of the Free Software Foundation's
+ software and to any other program whose authors commit to using it.
+ (Some other Free Software Foundation software is covered by the GNU
+ Library General Public License instead.) You can apply it to your pro-
+ grams, 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
+ this service 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 make restrictions that forbid
+ anyone to deny you these rights or to ask you to surrender the rights.
+ These restrictions translate to certain responsibilities for you if
+ you distribute copies of the software, or if you modify it.
+
+ For example, if you distribute copies of such a program, whether
+ gratis or for a fee, you must give the recipients all the rights that
+ you have. 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.
+
+ We protect your rights with two steps: (1) copyright the software, and
+ (2) offer you this license which gives you legal permission to copy,
+ distribute and/or modify the software.
+
+ Also, for each author's protection and ours, we want to make certain
+ that everyone understands that there is no warranty for this free
+ software. If the software is modified by someone else and passed on,
+ we want its recipients to know that what they have is not the
+ original, so that any problems introduced by others will not reflect
+ on the original authors' reputations.
+
+ Finally, any free program is threatened constantly by software
+ patents. We wish to avoid the danger that redistributors of a free
+ program will individually obtain patent licenses, in effect making the
+ program proprietary. To prevent this, we have made it clear that any
+ patent must be licensed for everyone's free use or not licensed at
+ all.
+
+ The precise terms and conditions for copying, distribution and
+ modification follow.
+
+ GNU GENERAL PUBLIC LICENSE
+ TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+ 0. This License applies to any program or other work which contains a
+ notice placed by the copyright holder saying it may be distributed
+ under the terms of this General Public License. The "Program", below,
+ refers to any such program or work, and a "work based on the Program"
+ means either the Program or any derivative work under copyright law:
+ that is to say, a work containing the Program or a portion of it,
+ either verbatim or with modifications and/or translated into another
+ language. (Hereinafter, translation is included without limitation in
+ the term "modification".) Each licensee is addressed as "you".
+
+ Activities other than copying, distribution and modification are not
+ covered by this License; they are outside its scope. The act of
+ running the Program is not restricted, and the output from the Program
+ is covered only if its contents constitute a work based on the Program
+ (independent of having been made by running the Program). Whether
+ that is true depends on what the Program does.
+
+ 1. You may copy and distribute 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
+ and disclaimer of warranty; keep intact all the notices that refer to
+ this License and to the absence of any warranty; and give any other
+ recipients of the Program a copy of this License along with the
+ Program.
+
+ You may charge a fee for the physical act of transferring a copy, and
+ you may at your option offer warranty protection in exchange for a
+ fee.
+
+ 2. You may modify your copy or copies of the Program or any portion of
+ it, thus forming a work based on the Program, and copy and distribute
+ such modifications or work under the terms of Section 1 above,
+ provided that you also meet all of these conditions:
+
+ a) You must cause the modified files to carry prominent notices
+ stating that you changed the files and the date of any change.
+
+ b) You must cause any work that you distribute or publish, that in
+ whole or in part contains or is derived from the Program or any
+ part thereof, to be licensed as a whole at no charge to all third
+ parties under the terms of this License.
+
+ c) If the modified program normally reads commands interactively
+ when run, you must cause it, when started running for such
+ interactive use in the most ordinary way, to print or display an
+ announcement including an appropriate copyright notice and a
+ notice that there is no warranty (or else, saying that you provide
+ a warranty) and that users may redistribute the program under
+ these conditions, and telling the user how to view a copy of this
+ License. (Exception: if the Program itself is interactive but
+ does not normally print such an announcement, your work based on
+ the Program is not required to print an announcement.)
+
+ These requirements apply to the modified work as a whole. If identifi-
+ able sections of that work are not derived from the Program, and can
+ be reasonably considered independent and separate works in themselves,
+ then this License, and its terms, do not apply to those sections when
+ you distribute them as separate works. But when you distribute the
+ same sections as part of a whole which is a work based on the Program,
+ the distribution of the whole must be on the terms of this License,
+ whose permissions for other licensees extend to the entire whole, and
+ thus to each and every part regardless of who wrote it.
+
+ Thus, it is not the intent of this section to claim rights or contest
+ your rights to work written entirely by you; rather, the intent is to
+ exercise the right to control the distribution of derivative or
+ collective works based on the Program.
+
+ In addition, mere aggregation of another work not based on the Program
+ with the Program (or with a work based on the Program) on a volume of
+ a storage or distribution medium does not bring the other work under
+ the scope of this License.
+
+ 3. You may copy and distribute the Program (or a work based on it,
+ under Section 2) in object code or executable form under the terms of
+ Sections 1 and 2 above provided that you also do one of the following:
+
+ a) Accompany it with the complete corresponding machine-readable
+ source code, which must be distributed under the terms of Sections
+ 1 and 2 above on a medium customarily used for software interchange; or,
+
+ b) Accompany it with a written offer, valid for at least three
+ years, to give any third party, for a charge no more than your
+ cost of physically performing source distribution, a complete
+ machine-readable copy of the corresponding source code, to be
+ distributed under the terms of Sections 1 and 2 above on a medium
+ customarily used for software interchange; or,
+
+ c) Accompany it with the information you received as to the offer
+ to distribute corresponding source code. (This alternative is
+ allowed only for noncommercial distribution and only if you
+ received the program in object code or executable form with such
+ an offer, in accord with Subsection b above.)
+
+ The source code for a work means the preferred form of the work for
+ making modifications to it. For an executable work, complete source
+ code means all the source code for all modules it contains, plus any
+ associated interface definition files, plus the scripts used to con-
+ trol compilation and installation of the executable. However, as a
+ special exception, the source code distributed need not include any-
+ thing that is normally distributed (in either source or binary form)
+ with the major components (compiler, kernel, and so on) of the operat-
+ ing system on which the executable runs, unless that component itself
+ accompanies the executable.
+
+ If distribution of executable or object code is made by offering
+ access to copy from a designated place, then offering equivalent
+ access to copy the source code from the same place counts as
+ distribution of the source code, even though third parties are not
+ compelled to copy the source along with the object code.
+
+ 4. You may not copy, modify, sublicense, or distribute the Program
+ except as expressly provided under this License. Any attempt otherwise
+ to copy, modify, sublicense or distribute the Program 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.
+
+ 5. You are not required to accept this License, since you have not
+ signed it. However, nothing else grants you permission to modify or
+ distribute the Program or its derivative works. These actions are
+ prohibited by law if you do not accept this License. Therefore, by
+ modifying or distributing the Program (or any work based on the
+ Program), you indicate your acceptance of this License to do so, and
+ all its terms and conditions for copying, distributing or modifying
+ the Program or works based on it.
+
+ 6. Each time you redistribute the Program (or any work based on the
+ Program), the recipient automatically receives a license from the
+ original licensor to copy, distribute or modify the Program subject to
+ these terms and conditions. You may not impose any further
+ restrictions on the recipients' exercise of the rights granted herein.
+ You are not responsible for enforcing compliance by third parties to
+ this License.
+
+ 7. If, as a consequence of a court judgment or allegation of patent
+ infringement or for any other reason (not limited to patent issues),
+ 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
+ distribute so as to satisfy simultaneously your obligations under this
+ License and any other pertinent obligations, then as a consequence you
+ may not distribute the Program at all. For example, if a patent
+ license would not permit royalty-free redistribution of the Program by
+ all those who receive copies directly or indirectly through you, then
+ the only way you could satisfy both it and this License would be to
+ refrain entirely from distribution of the Program.
+
+ If any portion of this section is held invalid or unenforceable under
+ any particular circumstance, the balance of the section is intended to
+ apply and the section as a whole is intended to apply in other
+ circumstances.
+
+ It is not the purpose of this section to induce you to infringe any
+ patents or other property right claims or to contest validity of any
+ such claims; this section has the sole purpose of protecting the
+ integrity of the free software distribution system, which is
+ implemented by public license practices. Many people have made
+ generous contributions to the wide range of software distributed
+ through that system in reliance on consistent application of that
+ system; it is up to the author/donor to decide if he or she is willing
+ to distribute software through any other system and a licensee cannot
+ impose that choice.
+
+ This section is intended to make thoroughly clear what is believed to
+ be a consequence of the rest of this License.
+
+ 8. If the distribution and/or use of the Program is restricted in
+ certain countries either by patents or by copyrighted interfaces, the
+ original copyright holder who places the Program under this License
+ may add an explicit geographical distribution limitation excluding
+ those countries, so that distribution is permitted only in or among
+ countries not thus excluded. In such case, this License incorporates
+ the limitation as if written in the body of this License.
+
+ 9. The Free Software Foundation may publish revised and/or new
+ versions of the 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 a version number of this License which applies to it and
+ "any later version", you have the option of following the terms and
+ conditions either of that version or of any later version published by
+ the Free Software Foundation. If the Program does not specify a
+ version number of this License, you may choose any version ever
+ published by the Free Software Foundation.
+
+ 10. If you wish to incorporate parts of the Program into other free
+ programs whose distribution conditions are different, write to the
+ author to ask for permission. For software which is copyrighted by the
+ Free Software Foundation, write to the Free Software Foundation; we
+ sometimes make exceptions for this. Our decision will be guided by the
+ two goals of preserving the free status of all derivatives of our free
+ software and of promoting the sharing and reuse of software generally.
+
+ NO WARRANTY
+
+ 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, 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.
+
+ 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+ WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+ REDISTRIBUTE 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.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+ possible use to the public, the best way to achieve this is to make it
+ free software which everyone can redistribute and change under these
+ terms.
+
+ To do so, attach the following notices to the program. It is safest to
+ attach them to the start of each source file to most effectively
+ convey the exclusion of warranty; and each file should have at least
+ the "copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) 19yy <name of author>
+
+ 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 2 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, write to the Free Software
+ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+ Also add information on how to contact you by electronic and paper
+ mail.
+
+ If the program is interactive, make it output a short notice like this
+ when it starts in an interactive mode:
+
+ Gnomovision version 69, Copyright (C) 19yy name of author
+ Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+ The hypothetical commands `show w' and `show c' should show the appro-
+ priate parts of the General Public License. Of course, the commands
+ you use may be called something other than `show w' and `show c'; they
+ could even be mouse-clicks or menu items--whatever suits your program.
+
+ You should also get your employer (if you work as a programmer) or
+ your school, if any, to sign a "copyright disclaimer" for the program,
+ if necessary. Here is a sample; alter the names:
+
+ Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+ `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+ <signature of Ty Coon>, 1 April 1989
+ Ty Coon, President of Vice
+
+ This General Public License does not permit incorporating your program
+ into proprietary programs. If your program is a subroutine library,
+ you may consider it more useful to permit linking proprietary applica-
+ tions with the library. If this is what you want to do, use the GNU
+ Library General Public License instead of this License.
+
+ B.2. The Unicode Inc. Copyright
+
+ This software makes use of the Unicode tables published by Unicode,
+ Inc under the following terms:
+
+ COPYRIGHT AND PERMISSION NOTICE
+
+ Copyright (c) 1991-2009 Unicode, Inc. All rights reserved. Distributed
+ under the Terms of Use in http://www.unicode.org/copyright.html.
+
+ Permission is hereby granted, free of charge, to any person
+ obtaining a copy of the Unicode data files and any associated
+ documentation (the "Data Files") or Unicode software and any
+ associated documentation (the "Software") to deal in the Data Files
+ or Software without restriction, including without limitation the
+ rights to use, copy, modify, merge, publish, distribute, and/or sell
+ copies of the Data Files or Software, and to permit persons to whom
+ the Data Files or Software are furnished to do so, provided that (a)
+ the above copyright notice(s) and this permission notice appear with
+ all copies of the Data Files or Software, (b) both the above
+ copyright notice(s) and this permission notice appear in associated
+ documentation, and (c) there is clear notice in each modified Data
+ File or in the Software as well as in the documentation associated
+ with the Data File(s) or Software that the data or software has been
+ modified.
+
+ THE DATA FILES AND SOFTWARE ARE 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 OF THIRD PARTY RIGHTS. IN NO EVENT SHALL THE
+ COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE BE LIABLE FOR
+ ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY
+ DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
+ WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
+ ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
+ OF THE DATA FILES OR SOFTWARE.
+
+ Except as contained in this notice, the name of a copyright holder
+ shall not be used in advertising or otherwise to promote the sale,
+ use or other dealings in these Data Files or Software without prior
+ written authorization of the copyright holder.
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/text/slang.txt Added

@@ -0,0 +1,6756 @@
+ A Guide to the S-Lang Language (v2.3.0)
+ John E. Davis <www.jedsoft.org>
+ Aug 18, 2016
+ ____________________________________________________________
+
+
+ 1. Preface
+
+ S-Lang is an interpreted language that was designed from the start to
+ be easily embedded into a program to provide it with a powerful
+ extension language. Examples of programs that use S-Lang as an
+ extension language include the jed text editor and the slrn
+ newsreader. Although S-Lang does not exist as a separate application,
+ it is distributed with a quite capable program called slsh (``slang-
+ shell'') that embeds the interpreter and allows one to execute S-Lang
+ scripts, or simply experiment with S-Lang at an interactive prompt.
+ Many of the the examples in this document are presented in the context
+ of one of the above applications.
+
+ S-Lang is also a programmer's library that permits a programmer to
+ develop sophisticated platform-independent software. In addition to
+ providing the S-Lang interpreter, the library provides facilities for
+ screen management, keymaps, low-level terminal I/O, etc. However, this
+ document is concerned only with the extension language and does not
+ address these other features of the S-Lang library. For information
+ about the other components of the library, the reader is referred to
+ the S-Lang Library C Programmer's Guide.
+
+ 1.1. A Brief History of S-Lang
+
+ I first began working on S-Lang sometime during the fall of 1992. At
+ that time I was writing a text editor (jed), which I wanted to endow
+ with a macro language. It occurred to me that an application-
+ independent language that could be embedded into the editor would
+ prove more useful because I could envision embedding it into other
+ programs. As a result, S-Lang was born.
+
+ S-Lang was originally a stack language that supported a postscript-
+ like syntax. For that reason, I named it S-Lang, where the S was
+ supposed to emphasize its stack-based nature. About a year later, I
+ began to work on a preparser that would allow one unfamiliar with
+ stack based languages to make use of a more traditional infix syntax.
+ Currently, the syntax of the language resembles C, nevertheless some
+ postscript-like features still remain, e.g., the `%' character is
+ still used as a comment delimiter.
+
+ 1.2. Acknowledgements
+
+ Since I first released S-Lang, I have received a lot feedback about
+ the library and the language from many people. This has given me the
+ opportunity and pleasure to interact with a number of people to make
+ the library portable and easy to use. In particular, I would like to
+ thank the following individuals:
+
+ Luchesar Ionkov for his comments and criticisms of the syntax of the
+ language. He was the person who made me realize that the low-level
+ byte-code engine should be totally type-independent. He also improved
+ the tokenizer and preparser and impressed upon me that the language
+ needed a grammar.
+
+ Mark Olesen for his many patches to various aspects of the library and
+ his support on AIX. He also contributed a lot to the pre-processing
+ (SLprep) routines.
+
+ John Burnell for the OS/2 port of the video and keyboard routines. He
+ also made value suggestions regarding the interpreter interface.
+
+ Darrel Hankerson for cleaning up and unifying some of the code and the
+ makefiles.
+
+ Dominik Wujastyk who was always willing to test new releases of the
+ library.
+
+ Michael Elkins for his work on the curses emulation.
+
+ Hunter Goatley, Andy Harper, Martin P.J. Zinser, and Jouk Jansen for
+ their VMS support.
+
+ Dave Sims and Chin Huang for Windows 95 and Windows NT support, and
+ Dino Sangoi for the Windows DLL support.
+
+ I am also grateful to many other people who send in bug-reports, bug-
+ fixes, little enhancements, and suggestions, and so on. Without such
+ community involvement, S-Lang would not be as well-tested and stable
+ as it is. Finally, I would like to thank my wife for her support and
+ understanding while I spent long weekend hours developing the library.
+
+ 2. Introduction
+
+ S-Lang is a powerful interpreted language that may be embedded into an
+ application to make the application extensible. This enables the
+ application to be used in ways not envisioned by the programmer, thus
+ providing the application with much more flexibility and power.
+ Examples of applications that take advantage of the interpreter in
+ this way include the jed editor and the slrn newsreader.
+
+ 2.1. slsh -- The S-Lang shell
+
+ The S-Lang distribution contains a standalone application called slsh
+ that may be used for writing S-Lang scripts and full-blown S-Lang
+ based applications. For example, the author has used slsh to create a
+ mediacenter for his home entertainment system that integrates internet
+ radio and tv, podcasts, digital pictures and video, CDs, and so forth.
+ The use of slsh in such non-interactive modes is discussed in the
+ chapter on ``slsh''.
+
+ slsh also may be used interactively and has full access to all
+ components of the S-Lang interpreter. With features such as
+ customizable command-line editing, history recall and completion, slsh
+ is a convenient environment for learning and using the language. In
+ fact, as you are reading this manual, it is recommended that you use
+ slsh in its interactive mode as an aid to understanding the language.
+
+ While a standard S-Lang installation includes slsh, some some binary
+ distributions package slsh separately from the S-Lang library, and as
+ such must be installed separately. For example, on Debian Linux it can
+ be installed via
+
+ apt-get install slsh
+
+ When called without arguments, slsh will start in interactive mode by
+ issuing a (customizable) slsh> prompt and waits for input. While most
+ of the time one would enter S-Lang statements at the prompt, slsh also
+ accepts some other commands, most notably help:
+
+ slsh> help
+ Most commands must end in a semi-colon.
+ If a command begins with '!', then the command is passed to the shell.
+ Examples: !ls, !pwd, !cd foo, ...
+ Special commands:
+ help <help-topic>
+ apropos <something>
+ start_log( <optional-log-file> );
+ start logging input to a file (default is slsh.log)
+ stop_log();
+ stop logging input
+ save_input (<optional-file>);
+ save all previous input to a file (default: slsh.log)
+ quit;
+
+ Although the language normally requires variables to be declared
+ before use, it is not necessary to do so when using slsh
+ interactively. For example, in this document you will see examples
+ such as
+
+ variable x = 1:10;
+ variable y = sin (x^2);
+
+ At the slsh command line, the use of the variable keyword in such
+ statements is optional:
+
+ slsh> x = 1:10; y = sin(x^2);
+
+ As the above example suggests, one use of slsh is as a sophisticated
+ calculator. For example,
+
+ slsh> sin (1.24) + 3*cos (1.3*PI);
+ -0.817572
+
+ This is especially true when combined with modules, e.g.,
+
+ slsh> require ("fits");
+ slsh> require ("histogram");
+ slsh> tbl = fit_read_table ("evt1a.fits");
+ slsh> engrid = min(tbl.energy):max(energy):#1024;
+ slsh> spectrum = hist1d (tbl.energywhere(tbl.status==0), engrid);
+
+ In this example, the fits module was used to read data from a binary
+ file called evt1a.fits, and the histogram module was used to bin the
+ data in the energy column into a histogram to create a spectrum. The
+ expression involving where filters the data by accepting only those
+ energy values whose status is set to 0. The fits and histogram modules
+ are not distributed with S-Lang but may be obtained separately-- see
+ http://www.jedsoft.org/slang/modules/ for links to them. For more
+ information about modules, see the ``Modules'' chapter in this docu-
+ ment.
+
+ For more information about using slsh, see the chapter on ``slsh''.
+
+ 2.2. Language Features
+
+ The language features both global and local variables, branching and
+ looping constructs, user-defined functions, structures, datatypes, and
+ arrays. In addition, there is limited support for pointer types. The
+ concise array syntax rivals that of commercial array-based numerical
+ computing environments.
+
+ 2.3. Data Types and Operators
+
+ The language provides built-in support for string, integer (signed and
+ unsigned long and short), double precision floating point, and double
+ precision complex numbers. In addition, it supports user defined
+ structure types, multi-dimensional array types, lists, and associative
+ arrays. To facilitate the construction of sophisticated data
+ structures such as linked lists and trees, the language also includes
+ a ``reference'' type. The reference type provides much of the same
+ flexibility as pointers in other languages. Finally, applications
+ embedding the interpreter may also provide special application
+ specific types, such as the Mark_Type that the jed editor provides.
+
+ The language provides standard arithmetic operations such as addition,
+ subtraction, multiplication, and division. It also provides support
+ for modulo arithmetic as well as operations at the bit level, e.g.,
+ exclusive-or. Any binary or unary operator may be extended to work
+ with any data type, including user-defined types. For example, the
+ addition operator (+) has been extended to work between string types
+ to permit string concatenation.
+
+ The binary and unary operators work transparently with array types.
+ For example, if a and b are arrays, then a + b produces an array whose
+ elements are the result of element by element addition of a and b.
+ This permits one to do vector operations without explicitly looping
+ over the array indices.
+
+ 2.4. Statements and Functions
+
+ The S-Lang language supports several types of looping constructs and
+ conditional statements. The looping constructs include while,
+ do...while, for, forever, loop, foreach, and _for. The conditional
+ statements include if, if-then-else, and ifnot.
+
+ User defined functions may be defined to return zero, one, or more
+ values. Functions that return zero values are similar to
+ ``procedures'' in languages such as PASCAL. The local variables of a
+ function are always created on a stack allowing one to create
+ recursive functions. Parameters to a function are always passed by
+ value and never by reference. However, the language supports a
+ reference data type that allows one to simulate pass by reference.
+
+ Unlike many interpreted languages, S-Lang allows functions to be
+ dynamically loaded (function autoloading). It also provides constructs
+ specifically designed for error handling and recovery as well as
+ debugging aids (e.g., function tracebacks).
+
+ Functions and variables may be declared as private belonging to a
+ namespace associated with the compilation unit that defines the
+ function or variable. The ideas behind the namespace implementation
+ stem from the C language and should be quite familiar to any one
+ familiar with C.
+
+ 2.5. Error Handling
+
+ The S-Lang language has a try/throw/catch/finally exception model
+ whose semantics are similar to that of other languages. Users may also
+ extend the exception class hierarchy with user-defined exceptions. The
+ ERROR_BLOCK based exception model of S-Lang 1.x is still supported but
+ deprecated.
+
+ 2.6. Run-Time Library
+
+ Functions that compose the S-Lang run-time library are called
+ intrinsics. Examples of S-Lang intrinsic functions available to every
+ S-Lang application include string manipulation functions such as
+ strcat, strchop, and strcmp. The S-Lang library also provides
+ mathematical functions such as sin, cos, and tan; however, not all
+ applications enable the use of these intrinsics. For example, to
+ conserve memory, the 16 bit version of the jed editor does not provide
+ support for any mathematics other than simple integer arithmetic,
+ whereas other versions of the editor do support these functions.
+
+ Most applications embedding the languages will also provide a set of
+ application specific intrinsic functions. For example, the jed editor
+ adds over 100 application specific intrinsic functions to the
+ language. Consult your application specific documentation to see what
+ additional intrinsics are supported.
+
+ Operating systems that support dynamic linking allow a slang
+ interpreter to dynamically link additional libraries of intrinsic
+ functions and variables into the interpreter. Such loadable objects
+ are called modules. A separate chapter of this manual is devoted to
+ this important feature.
+
+ 2.7. Input/Output
+
+ The language supports C-like stdio input/output functions such as
+ fopen, fgets, fputs, and fclose. In addition it provides two
+ functions, message and error, for writing to the standard output
+ device and standard error. Specific applications may provide other
+ I/O mechanisms, e.g., the jed editor supports I/O to files via the
+ editor's buffers.
+
+ 2.8. Obtaining more information about S-Lang
+
+ Comprehensive information about the library may be obtained via the
+ World Wide Web from http://www.jedsoft.org/slang/. In particular see
+ http://www.jedsoft.org/slang/download.html for downloading the latest
+ version of the library.
+
+ Users with generic questions about the interpreter are encouraged to
+ post questions to the Usenet newsgroup alt.lang.s-lang. More specific
+ questions relating to the use of S-Lang within some application may be
+ better answered in an application-specific forum. For example, users
+ with questions about using S-Lang as embedded in the jed editor are
+ more likely to be answered in the comp.editors newsgroup or on the jed
+ mailing list. Similarly users with questions concerning slrn will find
+ news.software.readers to be a valuable source of information.
+
+ Developers who have embedded the interpreter are encouraged to join
+ the S-Lang mailing list. To subscribe to the list or just browse the
+ archives, visit http://www.jedsoft.org/slang/mailinglists.html.
+
+ 3. Overview of the Language
+
+ This purpose of this section is to give the reader a feel for the S-
+ Lang language, its syntax, and its capabilities. The information and
+ examples presented in this section should be sufficient to provide the
+ reader with the necessary background to understand the rest of the
+ document.
+
+ 3.1. Variables and Functions
+
+ S-Lang is different from many other interpreted languages in the sense
+ that all variables and functions must be declared before they can be
+ used.
+
+ Variables are declared using the variable keyword, e.g.,
+
+ variable x, y, z;
+
+ declares three variables, x, y, and z. Note the semicolon at the end
+ of the statement. All S-Lang statements must end in a semicolon.
+
+ Unlike compiled languages such as C, it is not necessary to specify
+ the data type of a S-Lang variable. The data type of a S-Lang variable
+ is determined upon assignment. For example, after execution of the
+ statements
+
+ x = 3;
+ y = sin (5.6);
+ z = "I think, therefore I am.";
+
+ x will be an integer, y will be a double, and z will be a string. In
+ fact, it is even possible to re-assign x to a string:
+
+ x = "x was an integer, but now is a string";
+
+ Finally, one can combine variable declarations and assignments in the
+ same statement:
+
+ variable x = 3, y = sin(5.6), z = "I think, therefore I am.";
+
+ Most functions are declared using the define keyword. A simple example
+ is
+
+ define compute_average (x, y)
+ {
+ variable s = x + y;
+ return s / 2.0;
+ }
+
+ which defines a function that simply computes the average of two num-
+ bers and returns the result. This example shows that a function con-
+ sists of three parts: the function name, a parameter list, and the
+ function body.
+
+ The parameter list consists of a comma separated list of variable
+ names. It is not necessary to declare variables within a parameter
+ list; they are implicitly declared. However, all other local variables
+ used in the function must be declared. If the function takes no
+ parameters, then the parameter list must still be present, but empty:
+
+ define go_left_5 ()
+ {
+ go_left (5);
+ }
+
+ The last example is a function that takes no arguments and returns no
+ value. Some languages such as PASCAL distinguish such objects from
+ functions that return values by calling these objects procedures. How-
+ ever, S-Lang, like C, does not make such a distinction.
+
+ The language permits recursive functions, i.e., functions that call
+ themselves. The way to do this in S-Lang is to first declare the
+ function using the form:
+
+ define function-name ();
+
+ It is not necessary to declare a list of parameters when declaring a
+ function in this way.
+
+ Perhaps the most famous example of a recursive function is the
+ factorial function. Here is how to implement it using S-Lang:
+
+ define factorial (); % declare it for recursion
+
+ define factorial (n)
+ {
+ if (n < 2) return 1;
+ return n * factorial (n - 1);
+ }
+
+ This example also shows how to mix comments with code. S-Lang uses the
+ `%' character to start a comment and all characters from the comment
+ character to the end of the line are ignored.
+
+ 3.2. Qualifiers
+
+ S-Lang 2.1 introduced support for function qualifiers as a mechanism
+ for passing additional information to a function. For example,
+ consider a plotting application with a function
+
+ define plot (x, y)
+ {
+ variable linestyle = qualifier ("linestyle", "solid");
+ variable color = qualifier ("color", "black");
+
+ sys_set_color (color);
+ sys_set_linestyle (linestyle);
+ sys_plot (x,y);
+ }
+
+ Here the functions sys_set_linestyle, sys_set_color, and sys_plot are
+ hypothetical low-level functions that perform the actual work. This
+ function may be called simply as
+
+ x = 0:10:0.1;
+ plot (x, sin(x));
+
+ to produce a solid black line connecting the points. Through the use
+ of qualifiers, the color or linestyle may be specified, e.g,,
+
+ plot (x, sin(x); linestyle="dashed");
+
+ would produce a ``dashed'' black curve, whereas
+
+ plot (x, sin(x); linestyle="dotted", color="blue");
+
+ would produce a blue ``dotted'' one.
+
+ 3.3. Strings
+
+ Perhaps the most appealing feature of any interpreted language is that
+ it frees the user from the responsibility of memory management. This
+ is particularly evident when contrasting how S-Lang handles string
+ variables with a lower level language such as C. Consider a function
+ that concatenates three strings. An example in S-Lang is:
+
+ define concat_3_strings (a, b, c)
+ {
+ return strcat (a, b, c);
+ }
+
+ This function uses the built-in strcat function for concatenating two
+ or more strings. In C, the simplest such function would look like:
+
+ char *concat_3_strings (char *a, char *b, char *c)
+ {
+ unsigned int len;
+ char *result;
+ len = strlen (a) + strlen (b) + strlen (c);
+ if (NULL == (result = (char *) malloc (len + 1)))
+ exit (1);
+ strcpy (result, a);
+ strcat (result, b);
+ strcat (result, c);
+ return result;
+ }
+
+ Even this C example is misleading since none of the issues of memory
+ management of the strings has been dealt with. The S-Lang language
+ hides all these issues from the user.
+
+ Binary operators have been defined to work with the string data type.
+ In particular the + operator may be used to perform string
+ concatenation. That is, one can use the + operator as an alternative
+ to strcat:
+
+ define concat_3_strings (a, b, c)
+ {
+ return a + b + c;
+ }
+
+ See the section on ``Strings'' for more information about string vari-
+ ables.
+
+ 3.4. Referencing and Dereferencing
+
+ The unary prefix operator, &, may be used to create a reference to an
+ object, which is similar to a pointer in other languages. References
+ are commonly used as a mechanism to pass a function as an argument to
+ another function as the following example illustrates:
+
+ define compute_functional_sum (funct)
+ {
+ variable i, s;
+
+ s = 0;
+ for (i = 0; i < 10; i++)
+ {
+ s += (@funct)(i);
+ }
+ return s;
+ }
+
+ variable sin_sum = compute_functional_sum (&sin);
+ variable cos_sum = compute_functional_sum (&cos);
+
+ Here, the function compute_functional_sum applies the function speci-
+ fied by the parameter funct to the first 10 integers and returns the
+ sum. The two statements following the function definition show how the
+ sin and cos functions may be used.
+
+ Note the @ operator in the definition of compute_functional_sum. It is
+ known as the dereference operator and is the inverse of the reference
+ operator.
+
+ Another use of the reference operator is in the context of the fgets
+ function. For example,
+
+ define read_nth_line (file, n)
+ {
+ variable fp, line;
+ fp = fopen (file, "r");
+
+ while (n > 0)
+ {
+ if (-1 == fgets (&line, fp))
+ return NULL;
+ n--;
+ }
+ return line;
+ }
+
+ uses the fgets function to read the nth line of a file. In particu-
+ lar, a reference to the local variable line is passed to fgets, and
+ upon return line will be set to the character string read by fgets.
+
+ Finally, references may be used as an alternative to multiple return
+ values by passing information back via the parameter list. The
+ example involving fgets presented above provided an illustration of
+ this. Another example is
+
+ define set_xyz (x, y, z)
+ {
+ @x = 1;
+ @y = 2;
+ @z = 3;
+ }
+ variable X, Y, Z;
+ set_xyz (&X, &Y, &Z);
+
+ which, after execution, results in X set to 1, Y set to 2, and Z set
+ to 3. A C programmer will note the similarity of set_xyz to the fol-
+ lowing C implementation:
+
+ void set_xyz (int *x, int *y, int *z)
+ {
+ *x = 1;
+ *y = 2;
+ *z = 3;
+ }
+
+ 3.5. Arrays
+
+ The S-Lang language supports multi-dimensional arrays of all
+ datatypes. For example, one can define arrays of references to
+ functions as well as arrays of arrays. Here are a few examples of
+ creating arrays:
+
+ variable A = Int_Type 10;
+ variable B = Int_Type 10, 3;
+ variable C = 1, 3, 5, 7, 9;
+
+ The first example creates an array of 10 integers and assigns it to
+ the variable A. The second example creates a 2-d array of 30 integers
+ arranged in 10 rows and 3 columns and assigns the result to B. In the
+ last example, an array of 5 integers is assigned to the variable C.
+ However, in this case the elements of the array are initialized to the
+ values specified. This is known as an inline-array.
+
+ S-Lang also supports something called a range-array. An example of
+ such an array is
+
+ variable C = 1:9:2;
+
+ This will produce an array of 5 integers running from 1 through 9 in
+ increments of 2. Similarly 0:1:#1000 represents a 1000 element
+ floating point array of numbers running from 0 to 1 (inclusive).
+
+ Arrays are passed by reference to functions and never by value. This
+ permits one to write functions that can initialize arrays. For
+ example,
+
+ define init_array (a)
+ {
+ variable i, imax;
+
+ imax = length (a);
+ for (i = 0; i < imax; i++)
+ {
+ ai = 7;
+ }
+ }
+
+ variable A = Int_Type 10;
+ init_array (A);
+
+ creates an array of 10 integers and initializes all its elements to 7.
+
+ There are more concise ways of accomplishing the result of the
+ previous example. These include:
+
+ A = 7, 7, 7, 7, 7, 7, 7, 7, 7, 7;
+ A = Int_Type 10; A0:9 = 7;
+ A = Int_Type 10; A* = 7;
+
+ The second and third methods use an array of indices to index the
+ array A. In the second, the range of indices has been explicitly spec-
+ ified, whereas the third example uses a wildcard form. See chapter
+ ``Arrays'' for more information about array indexing.
+
+ Although the examples have pertained to integer arrays, the fact is
+ that S-Lang arrays can be of any type, e.g.,
+
+ A = Double_Type 10;
+ B = Complex_Type 10;
+ C = String_Type 10;
+ D = Ref_Type 10;
+
+ create 10 element arrays of double, complex, string, and reference
+ types, respectively. The last example may be used to create an array
+ of functions, e.g.,
+
+ D0 = &sin;
+ D1 = &cos;
+
+ S-Lang arrays also can be of Any_Type. An array of such a type is
+ capable of holding any object, e.g.,
+
+ A = Any_Type 3;
+ A0 = 1; A1 = "string"; A2 = (1 + 2i);
+
+ Dereferencing an Any_Type object returns the actual object. That is,
+ @A1 produces "string".
+
+ The language also defines unary, binary, and mathematical operations
+ on arrays. For example, if A and B are integer arrays, then A + B is
+ an array whose elements are the sum of the elements of A and B. A
+ trivial example that illustrates the power of this capability is
+
+ variable X, Y;
+ X = 0:2*PI:0.01;
+ Y = 20 * sin (X);
+
+ which is equivalent to the highly simplified C code:
+
+ double *X, *Y;
+ unsigned int i, n;
+
+ n = (2 * PI) / 0.01 + 1;
+ X = (double *) malloc (n * sizeof (double));
+ Y = (double *) malloc (n * sizeof (double));
+ for (i = 0; i < n; i++)
+ {
+ Xi = i * 0.01;
+ Yi = 20 * sin (Xi);
+ }
+
+ 3.6. Lists
+
+ A S-Lang list is like an array except that it may contain a
+ heterogeneous collection of data, e.g.,
+
+ my_list = { 3, 2.9, "foo", &sin };
+
+ is a list of four objects, each with a different type. Like an array,
+ the elements of a list may be accessed via an index, e.g.,
+ x=my_list2 will result in the assignment of "foo" to x. The most
+ important difference between an array and a list is that an array's
+ size is fixed whereas a list may grow or shrink. Algorithms that
+ require such a data structure may execute many times faster when a
+ list is used instead of an array.
+
+ 3.7. Structures and User-Defined Types
+
+ A structure is similar to an array in the sense that it is a container
+ object. However, the elements of an array must all be of the same type
+ (or of Any_Type), whereas a structure is heterogeneous. As an example,
+ consider
+
+ variable person = struct
+ {
+ first_name, last_name, age
+ };
+ variable bill = @person;
+ bill.first_name = "Bill";
+ bill.last_name = "Clinton";
+ bill.age = 51;
+
+ In this example a structure consisting of the three fields has been
+ created and assigned to the variable person. Then an instance of this
+ structure has been created using the dereference operator and assigned
+ to bill. Finally, the individual fields of bill were initialized. This
+ is an example of an anonymous structure.
+
+ Note: S-Lang versions 2.1 and higher permit assignment statements
+ within the structure definition, e.g.,
+
+ variable bill = struct
+ {
+ first_name = "Bill",
+ last_name = "Clinton",
+ age = 51
+ };
+
+ A named structure is really a new data type and may be created using
+ the typedef keyword:
+
+ typedef struct
+ {
+ first_name, last_name, age
+ }
+ Person_Type;
+
+ variable bill = @Person_Type;
+ bill.first_name = "Bill";
+ bill.last_name = "Clinton";
+ bill.age = 51;
+
+ One advantage of creating a new type is that array elements of such
+ types are automatically initialized to instances of the type. For
+ example,
+
+ People = Person_Type 100;
+ People0.first_name = "Bill";
+ People1.first_name = "Hillary";
+
+ may be used to create an array of 100 such objects and initialize the
+ first_name fields of the first two elements. In contrast, the form
+ using an anonymous would require a separate step to instantiate the
+ array elements:
+
+ People = Struct_Type 100;
+ People0 = @person;
+ People0.first_name = "Bill";
+ People1 = @person;
+ People1.first_name = "Hillary";
+
+ Another big advantage of a user-defined type is that the binary and
+ unary operators may be overloaded onto such types. This is explained
+ in more detail below.
+
+ The creation and initialization of a structure may be facilitated by a
+ function such as
+
+ define create_person (first, last, age)
+ {
+ variable person = @Person_Type;
+ person.first_name = first;
+ person.last_name = last;
+ person.age = age;
+ return person;
+ }
+ variable Bill = create_person ("Bill", "Clinton", 51);
+
+ Other common uses of structures is the creation of linked lists,
+ binary trees, etc. For more information about these and other features
+ of structures, see the section on ``Linked Lists''.
+
+ 3.8. Namespaces
+
+ The language supports namespaces that may be used to control the scope
+ and visibility of variables and functions. In addition to the global
+ or public namespace, each S-Lang source file or compilation unit has a
+ private or anonymous namespace associated with it. The private
+ namespace may be used to define symbols that are local to the
+ compilation unit and inaccessible from the outside. The language also
+ allows the creation of named (non-anonymous or static) namespaces that
+ permit access via the namespace operator. See the chapter on
+ ``Namespaces'' for more information.
+
+ 4. Data Types and Literal Constants
+
+ The current implementation of the S-Lang language permits up to 65535
+ distinct data types, including predefined data types such as integer
+ and floating point, as well as specialized application-specific data
+ types. It is also possible to create new data types in the language
+ using the typedef mechanism.
+
+ Literal constants are objects such as the integer 3 or the string
+ "hello". The actual data type given to a literal constant depends upon
+ the syntax of the constant. The following sections describe the syntax
+ of literals of specific data types.
+
+ 4.1. Predefined Data Types
+
+ The current version of S-Lang defines integer, floating point,
+ complex, and string types. It also defines special purpose data types
+ such as Null_Type, DataType_Type, and Ref_Type. These types are
+ discussed below.
+
+ 4.1.1. Integers
+
+ The S-Lang language supports both signed and unsigned characters,
+ short integer, long integer, and long long integer types. On most 32
+ bit systems, there is no difference between an integer and a long
+ integer; however, they may differ on 16 and 64 bit systems. Generally
+ speaking, on a 16 bit system, plain integers are 16 bit quantities
+ with a range of -32767 to 32767. On a 32 bit system, plain integers
+ range from -2147483648 to 2147483647.
+
+ An plain integer literal can be specified in one of several ways:
+
+ o As a decimal (base 10) integer consisting of the characters 0
+ through 9, e.g., 127. An integer specified this way cannot begin
+ with a leading 0. That is, 0127 is not the same as 127.
+
+ o Using hexadecimal (base 16) notation consisting of the characters 0
+ to 9 and A through F. The hexadecimal number must be preceded by
+ the characters 0x. For example, 0x7F specifies an integer using
+ hexadecimal notation and has the same value as decimal 127.
+
+ o In Octal notation using characters 0 through 7. The Octal number
+ must begin with a leading 0. For example, 0177 and 127 represent
+ the same integer.
+
+ o In Binary notation using characters 0 and 1 with the 0b prefix. For
+ example, 21 may be expressed in binary using 0b10101.
+
+ Short, long, long long, and unsigned types may be specified by using
+ the proper suffixes: L indicates that the integer is a long integer,
+ LL indicates a long long integer, h indicates that the integer is a
+ short integer, and U indicates that it is unsigned. For example, 1UL
+ specifies an unsigned long integer.
+
+ Finally, a character literal may be specified using a notation
+ containing a character enclosed in single quotes as 'a'. The value of
+ the character specified this way will lie in the range 0 to 256 and
+ will be determined by the ASCII value of the character in quotes. For
+ example,
+
+ i = '0';
+
+ assigns to i the character 48 since the '0' character has an ASCII
+ value of 48.
+
+ A ``wide'' character (unicode) may be specified using the form
+ '\x{y...y}' where y...y are hexadecimal digits. For example,
+
+ '\x{12F}' % Latin Small Letter I With Ogonek;
+ '\x{1D7BC}' % Mathematical Sans-Serif Bold Italic Small Sigma
+
+ Any integer may be preceded by a minus sign to indicate that it is a
+ negative integer.
+
+ 4.1.2. Floating Point Numbers
+
+ Single and double precision floating point literals must contain
+ either a decimal point or an exponent (or both). Here are examples of
+ specifying the same double precision point number:
+
+ 12. 12.0 12e0 1.2e1 120e-1 .12e2 0.12e2
+
+ Note that 12 is not a floating point number since it contains neither
+ a decimal point nor an exponent. In fact, 12 is an integer.
+
+ One may append the f character to the end of the number to indicate
+ that the number is a single precision literal. The following are all
+ single precision values:
+
+ 12.f 12.0f 12e0f 1.2e1f 120e-1f .12e2f 0.12e2f
+
+ 4.1.3. Complex Numbers
+
+ The language implements complex numbers as a pair of double precision
+ floating point numbers. The first number in the pair forms the real
+ part, while the second number forms the imaginary part. That is, a
+ complex number may be regarded as the sum of a real number and an
+ imaginary number.
+
+ Strictly speaking, the current implementation of the S-Lang does not
+ support generic complex literals. However, it does support imaginary
+ literals permitting a more generic complex number with a non-zero real
+ part to be constructed from the imaginary literal via addition of a
+ real number.
+
+ An imaginary literal is specified in the same way as a floating point
+ literal except that i or j is appended. For example,
+
+ 12i 12.0i 12e0j
+
+ all represent the same imaginary number.
+
+ A more generic complex number may be constructed from an imaginary
+ literal via addition, e.g.,
+
+ 3.0 + 4.0i
+
+ produces a complex number whose real part is 3.0 and whose imaginary
+ part is 4.0.
+
+ The intrinsic functions Real and Imag may be used to retrieve the real
+ and imaginary parts of a complex number, respectively.
+
+ 4.1.4. Strings
+
+ A string literal must be enclosed in double quotes as in:
+
+ "This is a string".
+
+ As described below, the string literal may contain a suffix that spec-
+ ifies how the string is to be interpreted, e.g., a string literal such
+ as
+
+ "$HOME/.jedrc"$
+
+ with the '$' suffix will be subject to variable name expansion.
+
+ Although there is no imposed limit on the length of a string, single-
+ line string literals must be less than 256 characters in length. It is
+ possible to construct strings longer than this by string
+ concatenation, e.g.,
+
+ "This is the first part of a long string"
+ + " and this is the second part"
+
+ S-Lang version 2.2 introduced support for multi-line string literals.
+ There are basic variants supported. The first makes use of the
+ backslash at the end of a line to indicate that the string is
+ continued onto the next line:
+
+ "This is a \
+ multi-line string. \
+ Note the presence of the \
+ backslash character at the end \
+ of each of the lines."
+
+ The second form of multiline string is delimited by the backquote
+ character (`) and does not require backslashes:
+
+ `This form does not
+ require backslash characters.
+ In fact, here the backslash
+ character \ has no special
+ meaning (unless given the ``Q' suffix`
+
+ Note that if a backquote is to appear in such a string, then it must
+ be doubled, as illustrated in the above example.
+
+ Any character except a newline (ASCII 10) or the null character (ASCII
+ 0) may appear explicitly in a string literal. However, these
+ characters may embedded implicitly using the mechanism described
+ below.
+
+ The backslash character is a special character and is used to include
+ other special characters (such as a newline character) in the string.
+ The special characters recognized are:
+
+ \" -- double quote
+ \' -- single quote
+ \\ -- backslash
+ \a -- bell character (ASCII 7)
+ \t -- tab character (ASCII 9)
+ \n -- newline character (ASCII 10)
+ \e -- escape character (ASCII 27)
+ \xhh -- byte expressed in HEXADECIMAL notation
+ \ooo -- byte expressed in OCTAL notation
+ \dnnn -- byte expressed in DECIMAL
+ \u{h..h} -- the Unicode character U+h..h
+ \x{h..h} -- the Unicode character U+h..h modal
+
+ In the above table, h represents one of the HEXADECIMAL characters
+ from the set 0-9A-Fa-f. It is important to understand the distinc-
+ tion between the \x{h..h} and \u{h..h} forms. When used in a string,
+ the \u form always expands to the corresponding UTF-8 sequence regard-
+ less of the UTF-8 mode. In contrast, when in non-UTF-8 mode, the \x
+ form expands to a byte when given two hex characters, or to the corre-
+ sponding UTF-8 sequence when used with three or more hex characters.
+
+ For example, to include the double quote character as part of the
+ string, it must be preceded by a backslash character, e.g.,
+
+ "This is a \"quote\"."
+
+ Similarly, the next example illustrates how a newline character may be
+ included:
+
+ "This is the first line\nand this is the second."
+
+ Alternatively, slang-2.2 or newer permits
+
+ `This is a "quote".`
+ `This is the first line
+ and this is the second.`
+
+ 4.1.4.1. Suffixes
+
+ A string literal may be contain a suffix that specifies how the string
+ is to be interpreted. The suffix may consist of one or more of the
+ following characters:
+
+ R Backslash substitution will not be performed on the string.
+ This is the default when using back-quoted strings.
+
+ Q Backslash substitution will be performed on the string. This is
+ the default when using strings using the double-quote character.
+
+ B If this suffix is present, the string will be interpreted as a
+ binary string (BString_Type).
+
+ $ Variable name substitution will be performed on the string.
+
+ Not all combinations of the above controls characters are supported,
+ nor make sense. For example, a string with the suffix QR will cause a
+ parse-error because Q and R have opposing meanings.
+
+ 4.1.4.1.1. The Q and R suffixes
+
+ These suffixes turn on and off backslash expansion. Unless the R
+ suffix is present, all double-quoted string literals will have
+ backslash substitution performed. By default, backslash expansion is
+ turned off for backquoted strings.
+
+ Sometimes it is desirable to turn off backslash expansion for double-
+ quoted strings. For example, pathnames on an MSDOS or Windows system
+ use the backslash character as a path separator. The R prefix turns
+ off backslash expansion, and as a result the following statements are
+ equivalent:
+
+ file = "C:\\windows\\apps\\slrn.rc";
+ file = "C:\\windows\\apps\\slrn.rc"Q;
+ file = "C:\windows\apps\slrn.rc"R;
+ file = `C:\windows\apps\slrn.rc`; % slang-2.2 and above
+
+ The only exception is that a backslash character is not permitted as
+ the last character of a string with the R suffix. That is,
+
+ string = "This is illegal\"R;
+
+ is not permitted. Without this exception, a string such as
+
+ string = "Some characters: \"R, S, T\"";
+
+ would not be parsed properly.
+
+ 4.1.4.1.2. The $ suffix
+
+ If the string contains the $ suffix, then variable name expansion will
+ be performed upon names prefixed by a $ character occurring within the
+ string, e.g.,
+
+ "The value of X is $X and the value of Y is $Y"$.
+
+ with variable name substitution to be performed on the names X and Y.
+ Such strings may be used as a convenient alternative to the sprintf
+ function.
+
+ Name expansion is carried out according to the following rules: If the
+ string literal occurs in a function, and the name corresponds to a
+ variable local to the function, then the string representation of the
+ value of that variable will be substituted. Otherwise, if the name
+ corresponds to a variable that is local to the compilation unit (i.e.,
+ is declared as static or private), then its value's string
+ representation will be used. Otherwise, if the name corresponds to a
+ variable that exists as a global (public) then its value's string
+ representation will be substituted. If the above searches fail and the
+ name exists in the environment, then the value of the corresponding
+ environment variable will be used. Otherwise, the variable will
+ expand to the empty string.
+
+ Consider the following example:
+
+ private variable bar = "two";
+ putenv ("MYHOME=/home/baz");
+ define funct (foo)
+ {
+ variable bar = 1;
+ message ("file: $MYHOME/foo: garage=$MYGARAGE,bar=$bar"$);
+ }
+
+ When executed, this will produce the message:
+
+ file: /home/baz/foo: garage=,bar=1
+
+ assuming that MYGARAGE is not defined anywhere.
+
+ A name may be enclosed in braces. For example,
+
+ "${MYHOME}/foo: bar=${bar}"$
+
+ This is useful in cases when the name is followed immediately by other
+ characters that may be interpreted as part of the name, e.g.,
+
+ variable HELLO="Hello ";
+ message ("${HELLO}World"$);
+
+ will produce the message "Hello World".
+
+ 4.1.5. Null_Type
+
+ Objects of type Null_Type can have only one value: NULL. About the
+ only thing that you can do with this data type is to assign it to
+ variables and test for equality with other objects. Nevertheless,
+ Null_Type is an important and extremely useful data type. Its main use
+ stems from the fact that since it can be compared for equality with
+ any other data type, it is ideal to represent the value of an object
+ which does not yet have a value, or has an illegal value.
+
+ As a trivial example of its use, consider
+
+ define add_numbers (a, b)
+ {
+ if (a == NULL) a = 0;
+ if (b == NULL) b = 0;
+ return a + b;
+ }
+ variable c = add_numbers (1, 2);
+ variable d = add_numbers (1, NULL);
+ variable e = add_numbers (1,);
+ variable f = add_numbers (,);
+
+ It should be clear that after these statements have been executed, c
+ will have a value of 3. It should also be clear that d will have a
+ value of 1 because NULL has been passed as the second parameter. One
+ feature of the language is that if a parameter has been omitted from a
+ function call, the variable associated with that parameter will be set
+ to NULL. Hence, e and f will be set to 1 and 0, respectively.
+
+ The Null_Type data type also plays an important role in the context of
+ structures.
+
+ 4.1.6. Ref_Type
+
+ Objects of Ref_Type are created using the unary reference operator &.
+ Such objects may be dereferenced using the dereference operator @. For
+ example,
+
+ sin_ref = &sin;
+ y = (@sin_ref) (1.0);
+
+ creates a reference to the sin function and assigns it to sin_ref. The
+ second statement uses the dereference operator to call the function
+ that sin_ref references.
+
+ The Ref_Type is useful for passing functions as arguments to other
+ functions, or for returning information from a function via its
+ parameter list. The dereference operator may also used to create an
+ instance of a structure. For these reasons, further discussion of this
+ important type can be found in the section on ``Referencing
+ Variables''.
+
+ 4.1.7. Array_Type, Assoc_Type, List_Type, and Struct_Type
+
+ Variables of type Array_Type, Assoc_Type, List_Type, and Struct_Type
+ are known as container objects. They are more complicated than the
+ simple data types discussed so far and each obeys a special syntax.
+ For these reasons they are discussed in a separate chapters.
+
+ 4.1.8. DataType_Type Type
+
+ S-Lang defines a type called DataType_Type. Objects of this type have
+ values that are type names. For example, an integer is an object of
+ type Integer_Type. The literals of DataType_Type include:
+
+ Char_Type (signed character)
+ UChar_Type (unsigned character)
+ Short_Type (short integer)
+ UShort_Type (unsigned short integer)
+ Integer_Type (plain integer)
+ UInteger_Type (plain unsigned integer)
+ Long_Type (long integer)
+ ULong_Type (unsigned long integer)
+ LLong_Type (long long integer)
+ ULLong_Type (unsigned long long integer)
+ Float_Type (single precision real)
+ Double_Type (double precision real)
+ Complex_Type (complex numbers)
+ String_Type (strings, C strings)
+ BString_Type (binary strings)
+ Struct_Type (structures)
+ Ref_Type (references)
+ Null_Type (NULL)
+ Array_Type (arrays)
+ Assoc_Type (associative arrays/hashes)
+ List_Type (lists)
+ DataType_Type (data types)
+
+ as well as the names of any other types that an application defines.
+
+ The built-in function typeof returns the data type of its argument,
+ i.e., a DataType_Type. For instance typeof(7) returns Integer_Type and
+ typeof(Integer_Type) returns DataType_Type. One can use this function
+ as in the following example:
+
+ if (Integer_Type == typeof (x)) message ("x is an integer");
+
+ The literals of DataType_Type have other uses as well. One of the most
+ common uses of these literals is to create arrays, e.g.,
+
+ x = Complex_Type 100;
+
+ creates an array of 100 complex numbers and assigns it to x.
+
+ 4.1.9. Boolean Type
+
+ Strictly speaking, S-Lang has no separate boolean type; rather it
+ represents boolean values as Char_Type objects. In particular, boolean
+ FALSE is equivalent to Char_Type 0, and TRUE as any non-zero Char_Type
+ value. Since the exact value of TRUE is unspecified, it is unnecessary
+ and even pointless to define TRUE and FALSE literals in S-Lang.
+
+ 4.2. Typecasting: Converting from one Type to Another
+
+ Occasionally, it is necessary to convert from one data type to
+ another. For example, if you need to print an object as a string, it
+ may be necessary to convert it to a String_Type. The typecast function
+ may be used to perform such conversions. For example, consider
+
+ variable x = 10, y;
+ y = typecast (x, Double_Type);
+
+ After execution of these statements, x will have the integer value 10
+ and y will have the double precision floating point value 10.0. If the
+ object to be converted is an array, the typecast function will act
+ upon all elements of the array. For example,
+
+ x = 1:10; % Array of integers
+ y = typecast (x, Double_Type);
+
+ will create an array of 10 double precision values and assign it to y.
+ One should also realize that it is not always possible to perform a
+ typecast. For example, any attempt to convert an Integer_Type to a
+ Null_Type will result in a run-time error. Typecasting works only when
+ datatypes are similar.
+
+ Often the interpreter will perform implicit type conversions as
+ necessary to complete calculations. For example, when multiplying an
+ Integer_Type with a Double_Type, it will convert the Integer_Type to a
+ Double_Type for the purpose of the calculation. Thus, the example
+ involving the conversion of an array of integers to an array of
+ doubles could have been performed by multiplication by 1.0, i.e.,
+
+ x = 1:10; % Array of integers
+ y = 1.0 * x;
+
+ The string intrinsic function should be used whenever a string
+ representation is needed. Using the typecast function for this purpose
+ will usually fail unless the object to be converted is similar to a
+ string--- most are not. Moreover, when typecasting an array to
+ String_Type, the typecast function acts on each element of the array
+ to produce another array, whereas the string function will produce a
+ string.
+
+ One use of string function is to print the value of an object. This
+ use is illustrated in the following simple example:
+
+ define print_object (x)
+ {
+ message (string (x));
+ }
+
+ Here, the message function has been used because it writes a string to
+ the display. If the string function was not used and the message func-
+ tion was passed an integer, a type-mismatch error would have resulted.
+
+ 5. Identifiers
+
+ The names given to variables, functions, and data types are called
+ identifiers. There are some restrictions upon the actual characters
+ that make up an identifier. An identifier name must start with an
+ alphabetic character (A-Za-z), an underscore character, or a dollar
+ sign. The rest of the characters in the name can be any combination of
+ letters, digits, dollar signs, or underscore characters. However, all
+ identifiers whose name begins with two underscore characters are
+ reserved for internal use by the interpreter and declarations of
+ objects with such names should be avoided.
+
+ Examples of valid identifiers include:
+
+ mary _3 _this_is_ok
+ a7e1 $44 _44$_Three
+
+ However, the following are not legal:
+
+ 7abc 2e0 #xx
+
+ In fact, 2e0 actually specifies the double precision number 2.0.
+
+ There is no limit to the maximum length of an identifier. For
+ practical usage it is wise to limit the length of identifiers to a
+ reasonable value.
+
+ The following identifiers are reserved by the language for use as
+ keywords:
+
+ and andelse break case catch
+ continue define do else ERROR_BLOCK
+ exch EXIT_BLOCK finally _for for
+ foreach forever !if if ifnot
+ loop mod not or orelse
+ pop private public return shl
+ shr static struct switch __tmp
+ then throw try typedef USER_BLOCK0
+ USER_BLOCK1 USER_BLOCK2 USER_BLOCK3 USER_BLOCK4 using
+ variable while xor
+
+ 6. Variables
+
+ As many of the preceding examples have shown, a variable must be
+ declared before it can be used, otherwise an undefined name error will
+ be generated. A variable is declared using the variable keyword, e.g,
+
+ variable x, y, z;
+
+ declares three variables, x, y, and z. This is an example of a vari-
+ able declaration statement, and like all statements, it must end in a
+ semicolon.
+
+ Variables declared this way are untyped and inherit a type upon
+ assignment. As such, type-checking of function arguments, etc is
+ performed at run-time. For example,
+
+ x = "This is a string";
+ x = 1.2;
+ x = 3;
+ x = 2i;
+
+ results in x being set successively to a string, a float, an integer,
+ and to a complex number (0+2i). Any attempt to use a variable before
+ it has acquired a type will result in an uninitialized variable error.
+
+ It is legal to put executable code in a variable declaration list.
+ That is,
+
+ variable x = 1, y = sin (x);
+
+ are legal variable declarations. This also provides a convenient way
+ of initializing a variable.
+
+ Variables are classified as either global or local. A variable
+ declared inside a function is said to be local and has no meaning
+ outside the function. A variable is said to be global if it was
+ declared outside a function. Global variables are further classified
+ as being public, static, or private, according to the namespace where
+ they were defined. See the chapter on ``Namespaces'' for more
+ information about namespaces.
+
+ The following global variables are predefined by the language and live
+ in the public namespace. They are mainly used as convenience
+ variables:
+
+ $0 $1 $2 $3 $4 $5 $6 $7 $8 $9
+
+ An intrinsic variable is another type of global variable. Such
+ variables have a definite type which cannot be altered. Variables of
+ this type may also be defined to be read-only, or constant variables.
+ An example of an intrinsic variable is PI which is a read-only double
+ precision variable with a value of approximately
+ 3.14159265358979323846.
+
+ 7. Operators
+
+ S-Lang supports a variety of operators that are grouped into three
+ classes: assignment operators, binary operators, and unary operators.
+
+ An assignment operator is used to assign a value to a variable. They
+ will be discussed more fully in the context of the assignment
+ statement in the section on ``Assignment Statements''.
+
+ An unary operator acts only upon a single quantity while a binary
+ operation is an operation between two quantities. The boolean operator
+ not is an example of an unary operator. Examples of binary operators
+ include the usual arithmetic operators +, -, *, and /. The operator
+ given by - can be either an unary operator (negation) or a binary
+ operator (subtraction); the actual operation is determined from the
+ context in which it is used.
+
+ Binary operators are used in algebraic forms, e.g., a + b. Unary
+ operators fall into one of two classes: postfix-unary or prefix-unary.
+ For example, in the expression -x, the minus sign is a prefix-unary
+ operator.
+
+ All binary and unary operators may be defined for any supported data
+ type. For example, the arithmetic plus operator has been extended to
+ the String_Type data type to permit concatenation between strings. But
+ just because it is possible to define the action of an operator upon a
+ data type, it does not mean that all data types support all the binary
+ and unary operators. For example, while String_Type supports the +
+ operator, it does not admit the * operator.
+
+ 7.1. Unary Operators
+
+ The unary operators operate only upon a single operand. They include:
+ not, ~, -, @, &, as well as the increment and decrement operators ++
+ and --, respectively.
+
+ The boolean operator not acts only upon integers and produces 0 if its
+ operand is non-zero, otherwise it produces 1.
+
+ The bit-level not operator ~ performs a similar function, except that
+ it operates on the individual bits of its integer operand.
+
+ The arithmetic negation operator - is perhaps the most well-known
+ unary operator. It simply reverses the sign of its operand.
+
+ The reference (&) and dereference (@) operators will be discussed in
+ greater detail in the section on ``Referencing Variables''.
+ Similarly, the increment (++) and decrement (--) operators will be
+ discussed in the context of the assignment operator.
+
+ 7.2. Binary Operators
+
+ The binary operators may be grouped according to several classes:
+ arithmetic operators, relational operators, boolean operators, and
+ bitwise operators.
+
+ 7.2.1. Arithmetic Operators
+
+ The arithmetic operators include +, -, *, and /, which perform
+ addition, subtraction, multiplication, and division, respectively. In
+ addition to these, S-Lang supports the mod operator, which divides two
+ numbers and produces the remainder, as as well as the power operator
+ ^.
+
+ The data type of the result produced by the use of one of these
+ operators depends upon the data types of the binary participants. If
+ they are both integers, the result will be an integer. However, if the
+ operands are not of the same type, they will be converted to a common
+ type before the operation is performed. For example, if one is a
+ floating point type and the other is an integer, the integer will be
+ converted to a float. In general, the promotion from one type to
+ another is such that no information is lost, if possible. As an
+ example, consider the expression 8/5 which indicates division of the
+ integer 8 by the integer 5. The result will be the integer 1 and not
+ the floating point value 1.6. However, 8/5.0 will produce 1.6 because
+ 5.0 is a floating point number.
+
+ 7.2.2. Relational Operators
+
+ The relational operators are >, >=, <, <=, ==, and !=. These perform
+ the comparisons greater than, greater than or equal, less than, less
+ than or equal, equal, and not equal, respectively. For most data
+ types, the result of the comparison will be a boolean value; however,
+ for arrays the result will be an array of boolean values. The section
+ on arrays will explain this is greater detail.
+
+ Note: For S-Lang versions 2.1 and higher, relational expressions such
+ as a<b<=c are defined in the mathematical sense, i.e.,
+
+ ((a < b) and (b <= c))
+
+ Simarily, (a < b <= c < d) is the same as
+
+ ((a < b) and (b <= c) and (c < d))
+
+ and so on. In previous versions of S-Lang, (a<b<c) meant (a<b)<c; how-
+ ever this interpretation was not very useful.
+
+ 7.2.3. Boolean Operators
+
+ S-Lang supports four boolean binary operators: or, and, ||, and &&,
+ which for most data types, return a boolean result. In particular, the
+ or and || operators return a non-zero value (boolean TRUE) if either
+ of their operands are non-zero, otherwise they produce zero (boolean
+ FALSE). The and and && operators produce a non-zero value if and only
+ if both their operands are non-zero, otherwise they produce zero.
+
+ Unlike the operators && and ||, the and and or operators do not
+ perform the so-called boolean short-circuit evaluation. For example,
+ consider the expression:
+
+ (x != 0) and (1/x > 10)
+
+ Here, if x were to have a value of zero, a division by zero error
+ would occur because even though x!=0 evaluates to zero, the and opera-
+ tor is not short-circuited and the 1/x expression would still be eval-
+ uated. This problem can be avoided using the short-circuiting && oper-
+ ator:
+
+ (x != 0) && (1/x > 10)
+
+ Another difference between the short-circuiting (&&,||) and the non-
+ short-circuiting operators (and,or) is that the short-circuiting forms
+ work only with integer or boolean types. In contrast, if either of the
+ operands of the and or or operators is an array then a corresponding
+ array of boolean values will result. This is explained in more detail
+ in the section on arrays.
+
+ Note: the short-circuiting operators && and || were first introduced
+ in S-Lang 2.1; they are not available in older versions.
+
+ 7.2.4. Bitwise Operators
+
+ The bitwise binary operators are currently defined for integer
+ operands and are used for bit-level operations. Operators that fall in
+ this class include &, |, shl, shr, and xor. The & operator performs a
+ boolean AND operation between the corresponding bits of the operands.
+ Similarly, the | operator performs the boolean OR operation on the
+ bits. The bit-shifting operators shl and shr shift the bits of the
+ first operand by the number given by the second operand to the left or
+ right, respectively. Finally, the xor performs an EXCLUSIVE-OR
+ operation.
+
+ These operators are commonly used to manipulate variables whose
+ individual bits have distinct meanings. In particular, & is usually
+ used to test bits, | can be used to set bits, and xor may be used to
+ flip a bit.
+
+ As an example of using & to perform tests on bits, consider the
+ following: The jed text editor stores some of the information about a
+ buffer in a bitmapped integer variable. The value of this variable may
+ be retrieved using the jed intrinsic function getbuf_info, which
+ actually returns four quantities: the buffer flags, the name of the
+ buffer, directory name, and file name. For the purposes of this
+ section, only the buffer flags are of interest and can be retrieved
+ via a function such as
+
+ define get_buffer_flags ()
+ {
+ variable flags;
+ (,,,flags) = getbuf_info ();
+ return flags;
+ }
+
+ The buffer flags object is a bitmapped quantity where the 0th bit
+ indicates whether or not the buffer has been modified, the first bit
+ indicates whether or not autosave has been enabled for the buffer, and
+ so on. Consider for the moment the task of determining if the buffer
+ has been modified. This can be determined by looking at the zeroth
+ bit: if it is 0 the buffer has not been modified, otherwise it has
+ been modified. Thus we can create the function,
+
+ define is_buffer_modified ()
+ {
+ variable flags = get_buffer_flags ();
+ return (flags & 1);
+ }
+
+ where the integer 1 has been used since it is represented as an object
+ with all bits unset, except for the zeroth one, which is set. (At this
+ point, it should also be apparent that bits are numbered from zero,
+ thus an 8 bit integer consists of bits 0 to 7, where 0 is the least
+ significant bit and 7 is the most significant one.) Similarly, we can
+ create another function
+
+ define is_autosave_on ()
+ {
+ variable flags = get_buffer_flags ();
+ return (flags & 2);
+ }
+
+ to determine whether or not autosave has been turned on for the buf-
+ fer.
+
+ The shl operator may be used to form the integer with only the nth bit
+ set. For example, 1 shl 6 produces an integer with all bits set to
+ zero except the sixth bit, which is set to one. The following example
+ exploits this fact:
+
+ define test_nth_bit (flags, nth)
+ {
+ return flags & (1 shl nth);
+ }
+
+ 7.2.5. The Namespace Operator
+
+ The operator -> is used to in conjunction with a namespace to access
+ an object within the namespace. For example, if A is the name of a
+ namespace containing the variable v, then A->v refers to that
+ variable. Namespaces are discussed more fully in the chapter on
+ ``Namespaces''.
+
+ 7.2.6. Operator Precedence
+
+ 7.2.7. Binary Operators and Functions Returning Multiple Values
+
+ Care must be exercised when using binary operators with an operand
+ that returns multiple values. In fact, the current implementation of
+ the S-Lang language will produce incorrect results if both operands of
+ a binary expression return multiple values. At most, only one of
+ operands of a binary expression can return multiple values, and that
+ operand must be the first one, not the second. For example,
+
+ define read_line (fp)
+ {
+ variable line, status;
+
+ status = fgets (&line, fp);
+ if (status == -1)
+ return -1;
+ return (line, status);
+ }
+
+ defines a function, read_line that takes a single argument specifying
+ a handle to an open file, and returns one or two values, depending
+ upon the return value of fgets. Now consider
+
+ while (read_line (fp) > 0)
+ {
+ text = ();
+ % Do something with text
+ .
+ .
+ }
+
+ Here the relational binary operator > forms a comparison between one
+ of the return values (the one at the top of the stack) and 0. In
+ accordance with the above rule, since read_line returns multiple val-
+ ues, it must occur as the left binary operand. Putting it on the
+ right as in
+
+ while (0 < read_line (fp)) % Incorrect
+ {
+ text = ();
+ % Do something with text
+ .
+ .
+ }
+
+ violates the rule and will result in the wrong answer. For this rea-
+ son, one should avoid using a function that returns muliple return
+ values as a binary operand.
+
+ 7.3. Mixing Integer and Floating Point Arithmetic
+
+ If a binary operation (+, -, * , /) is performed on two integers, the
+ result is an integer. If at least one of the operands is a floating
+ point value, the other will be converted to a floating point value,
+ and a floating point result be produced. For example:
+
+ 11 / 2 --> 5 (integer)
+ 11 / 2.0 --> 5.5 (double)
+ 11.0 / 2 --> 5.5 (double)
+ 11.0 / 2.0 --> 5.5 (double)
+
+ Sometimes to achive the desired result, it is necessary to explicitly
+ convert from one data type to another. For example, suppose that a and
+ b are integers, and that one wants to compute a/b using floating point
+ arithmetic. In such a case, it is necessary to convert at least one of
+ the operands to a floating point value using, e.g., the double
+ function:
+
+ x = a/double(b);
+
+ 7.4. Short Circuit Boolean Evaluation
+
+ As of S-Lang version 2.1, use of the andelse and orelse have been
+ deprecated in favor of the && and || short-circuiting operators.
+
+ The boolean operators or and and are not short circuited as they are
+ in some languages. S-Lang uses orelse and andelse expressions for
+ short circuit boolean evaluation. However, these are not binary
+ operators. Expressions of the form:
+
+ expr-1 and expr-2 and ... expr-n
+
+ can be replaced by the short circuited version using andelse:
+
+ andelse {expr-1} {expr-2} ... {expr-n}
+
+ A similar syntax holds for the orelse operator. For example, consider
+ the statement:
+
+ if ((x != 0) and (1/x > 10)) do_something ();
+
+ Here, if x were to have a value of zero, a division by zero error
+ would occur because even though x!=0 evaluates to zero, the and opera-
+ tor is not short circuited and the 1/x expression would be evaluated
+ causing division by zero. For this case, the andelse expression could
+ be used to avoid the problem:
+
+ if (andelse
+ {x != 0}
+ {1 / x > 10}) do_something ();
+
+ 8. Statements
+
+ Loosely speaking, a statement is composed of expressions that are
+ grouped according to the syntax or grammar of the language to express
+ a complete computation. A semicolon is used to denote the end of a
+ statement.
+
+ A statement that occurs within a function is executed only during
+ execution of the function. However, statements that occur outside the
+ context of a function are evaluated immediately.
+
+ The language supports several different types of statements such as
+ assignment statements, conditional statements, and so forth. These are
+ described in detail in the following sections.
+
+ 8.1. Variable Declaration Statements
+
+ Variable declarations were already discussed in the chapter on
+ ``Variables''. For the sake of completeness, a variable declaration is
+ a statement of the form
+
+ variable variable-declaration-list ;
+
+ where the variable-declaration-list is a comma separated list of one
+ or more variable names with optional initializations, e.g.,
+
+ variable x, y = 2, z;
+
+ 8.2. Assignment Statements
+
+ Perhaps the most well known form of statement is the assignment
+ statement. Statements of this type consist of a left-hand side, an
+ assignment operator, and a right-hand side. The left-hand side must be
+ something to which an assignment can be performed. Such an object is
+ called an lvalue.
+
+ The most common assignment operator is the simple assignment operator
+ =. Examples of its use include
+
+ x = 3;
+ x = some_function (10);
+ x = 34 + 27/y + some_function (z);
+ x = x + 3;
+
+ In addition to the simple assignment operator, S-Lang also supports
+ the binary assignment operators:
+
+ += -= *= /= &= |=
+
+ Internally, S-Lang transforms
+
+ a += b;
+
+ to
+
+ a = a + b;
+
+ Likewise a-=b is transformed to a=a-b, a*=b is transformed to a=a*b,
+ and so on.
+
+ It is extremely important to realize that, in general, a+b is not
+ equal to b+a. For example if a and b are strings, then a+b will be the
+ string resulting from the concatenation of a and b, which generally is
+ not he same as the concatenation of b with a. This means that a+=b may
+ not be the same as a=b+a, as the following example illustrates:
+
+ a = "hello"; b = "world";
+ a += b; % a will become "helloworld"
+ c = b + a; % c will become "worldhelloworld"
+
+ Since adding or subtracting 1 from a variable is quite common, S-Lang
+ also supports the unary increment and decrement operators ++, and --,
+ respectively. That is, for numeric data types,
+
+ x = x + 1;
+ x += 1;
+ x++;
+
+ are all equivalent. Similarly,
+
+ x = x - 1;
+ x -= 1;
+ x--;
+
+ are also equivalent.
+
+ Strictly speaking, ++ and -- are unary operators. When used as x++,
+ the ++ operator is said to be a postfix-unary operator. However, when
+ used as ++x it is said to be a prefix-unary operator. The current
+ implementation does not distinguish between the two forms, thus x++
+ and ++x are equivalent. The reason for this equivalence is that
+ assignment expressions do not return a value in the S-Lang language as
+ they do in C. Thus one should exercise care and not try to write C-
+ like code such as
+
+ x = 10;
+ while (--x) do_something (x); % Ok in C, but not in S-Lang
+
+ The closest valid S-Lang form involves a comma-expression:
+
+ x = 10;
+ while (x--, x) do_something (x); % Ok in S-Lang and in C
+
+ S-Lang also supports a multiple-assignment statement. It is discussed
+ in detail in the section on ``Multiple Assignment Statement''.
+
+ 8.3. Conditional and Looping Statements
+
+ S-Lang supports a wide variety of conditional and looping statements.
+ These constructs operate on statements grouped together in blocks. A
+ block is a sequence of S-Lang statements enclosed in braces and may
+ contain other blocks. However, a block cannot include function
+ declarations. In the following, statement-or-block refers to either a
+ single S-Lang statement or to a block of statements, and integer-
+ expression is an integer-valued or boolean expression. next-statement
+ represents the statement following the form under discussion.
+
+ 8.3.1. Conditional Forms
+
+ 8.3.1.1. if
+
+ The simplest condition statement is the if statement. It follows the
+ syntax
+
+ if (integer-expression) statement-or-block next-statement
+
+ If integer-expression evaluates to a non-zero (boolean TRUE) result,
+ then the statement or group of statements implied statement-or-block
+ will get executed. Otherwise, control will proceed to next-statement.
+
+ An example of the use of this type of conditional statement is
+
+ if (x != 0)
+ {
+ y = 1.0 / x;
+ if (x > 0) z = log (x);
+ }
+
+ This example illustrates two if statements where the second if state-
+ ment is part of the block of statements that belong to the first.
+
+ 8.3.1.2. if-else
+
+ Another form of if statement is the if-else statement. It follows the
+ syntax:
+
+ if (integer-expression) statement-or-block-1 else statement-or-block-2
+ next-statement
+
+ Here, if expression evaluates to a non-zero integer, statement-or-
+ block-1 will get executed and control will pass on to next-statement.
+ However, if expression evaluates to zero, statement-or-block-2 will
+ get executed before continuing on to next-statement. A simple example
+ of this form is
+
+ if (x > 0)
+ z = log (x);
+ else
+ throw DomainError, "x must be positive";
+
+ Consider the more complex example:
+
+ if (city == "Boston")
+ if (street == "Beacon") found = 1;
+ else if (city == "Madrid")
+ if (street == "Calle Mayor") found = 1;
+ else found = 0;
+
+ This example illustrates a problem that beginners have with if-else
+ statements. Syntactically, this example is equivalent to
+
+ if (city == "Boston")
+ {
+ if (street == "Beacon") found = 1;
+ else if (city == "Madrid")
+ {
+ if (street == "Calle Mayor") found = 1;
+ else found = 0;
+ }
+ }
+
+ although the indentation indicates otherwise. It is important to
+ understand the grammar and not be seduced by the indentation!
+
+ 8.3.1.3. ifnot
+
+ One often encounters if statements similar to
+
+ if (integer-expression == 0) statement-or-block
+
+ or equivalently,
+
+ if (not(integer-expression)) statement-or-block
+
+ The ifnot statement was added to the language to simplify the handling
+ of such statements. It obeys the syntax
+
+ ifnot (integer-expression) statement-or-block
+
+ and is functionally equivalent to
+
+ if (not (expression)) statement-or-block
+
+ Note: The ifnot keyword was added in version 2.1 and is not supported
+ by earlier versions. For compatibility with older code, the !if
+ keyword can be used, although its use is deprecated in favor of ifnot.
+
+ 8.3.1.4. orelse, andelse
+
+ As of S-Lang version 2.1, use of the andelse and orelse have been
+ deprecated in favor of the && and || short-circuiting operators.
+
+ The syntax for the orelse statement is:
+
+ orelse {integer-expression-1} ... {integer-expression-n}
+
+ This causes each of the blocks to be executed in turn until one of
+ them returns a non-zero integer value. The result of this statement is
+ the integer value returned by the last block executed. For example,
+
+ orelse { 0 } { 6 } { 2 } { 3 }
+
+ returns 6 since the second block is the first to return a non-zero
+ result. The last two block will not get executed.
+
+ The syntax for the andelse statement is:
+
+ andelse {integer-expression-1} ... {integer-expression-n}
+
+ Each of the blocks will be executed in turn until one of them returns
+ a zero value. The result of this statement is the integer value
+ returned by the last block executed. For example,
+
+ andelse { 6 } { 2 } { 0 } { 4 }
+
+ evaluates to 0 since the third block will be the last to execute.
+
+ 8.3.1.5. switch
+
+ The switch statement deviates from its C counterpart. The syntax is:
+
+ switch (x)
+ { ... : ...}
+ .
+ .
+ { ... : ...}
+
+ The `:' operator is a special symbol that in the context of the switch
+ statement, causes the top item on the stack to be tested, and if it is
+ non-zero, the rest of the block will get executed and control will
+ pass out of the switch statement. Otherwise, the execution of the
+ block will be terminated and the process will be repeated for the next
+ block. If a block contains no : operator, the entire block is executed
+ and control will pass onto the next statement following the switch
+ statement. Such a block is known as the default case.
+
+ As a simple example, consider the following:
+
+ switch (x)
+ { x == 1 : message("Number is one.");}
+ { x == 2 : message("Number is two.");}
+ { x == 3 : message("Number is three.");}
+ { x == 4 : message("Number is four.");}
+ { x == 5 : message("Number is five.");}
+ { message ("Number is greater than five.");}
+
+ Suppose x has an integer value of 3. The first two blocks will termi-
+ nate at the `:' character because each of the comparisons with x will
+ produce zero. However, the third block will execute to completion.
+ Similarly, if x is 7, only the last block will execute in full.
+
+ A more familiar way to write the previous example is to make use of
+ the case keyword:
+
+ switch (x)
+ { case 1 : message("Number is one.");}
+ { case 2 : message("Number is two.");}
+ { case 3 : message("Number is three.");}
+ { case 4 : message("Number is four.");}
+ { case 5 : message("Number is five.");}
+ { message ("Number is greater than five.");}
+
+ The case keyword is a more useful comparison operator because it can
+ perform a comparison between different data types while using == may
+ result in a type-mismatch error. For example,
+
+ switch (x)
+ { (x == 1) or (x == "one") : message("Number is one.");}
+ { (x == 2) or (x == "two") : message("Number is two.");}
+ { (x == 3) or (x == "three") : message("Number is three.");}
+ { (x == 4) or (x == "four") : message("Number is four.");}
+ { (x == 5) or (x == "five") : message("Number is five.");}
+ { message ("Number is greater than five.");}
+
+ will fail because the == operation is not defined between strings and
+ integers. The correct way to write this is to use the case keyword:
+
+ switch (x)
+ { case 1 or case "one" : message("Number is one.");}
+ { case 2 or case "two" : message("Number is two.");}
+ { case 3 or case "three" : message("Number is three.");}
+ { case 4 or case "four" : message("Number is four.");}
+ { case 5 or case "five" : message("Number is five.");}
+ { message ("Number is greater than five.");}
+
+ 8.3.2. Looping Forms
+
+ In this section, the various looping statements are discussed. Each of
+ these statements support an optional then clause, which is discussed
+ in a separate section below.
+
+ 8.3.2.1. while
+
+ The while statement follows the syntax
+
+ while (integer-expression) statement-or-block then statement-or-
+ block next-statement
+
+ It simply causes statement-or-block to get executed as long as inte-
+ ger-expression evaluates to a non-zero result. For example,
+
+ i = 10;
+ while (i)
+ {
+ i--;
+ newline ();
+ }
+
+ will cause the newline function to get called 10 times. However,
+
+ i = -10;
+ while (i)
+ {
+ i--;
+ newline ();
+ }
+
+ would loop forever (or until i wraps from the most negative integer
+ value to the most positive and then decrements to zero).
+
+ If you are a C programmer, do not let the syntax of the language
+ seduce you into writing this example as you would in C:
+
+ i = 10;
+ while (i--) newline ();
+
+ Keep in mind that expressions such as i-- do not return a value in S-
+ Lang as they do in C. The same effect can be achieved to use a comma
+ to separate the expressions as in
+
+ i = 10;
+ while (i, i--) newline ();
+
+ 8.3.2.2. do...while
+
+ The do...while statement follows the syntax
+
+ do statement-or-block while (integer-expression); then statement-or-
+ block 
+
+ The main difference between this statement and the while statement is
+ that the do...while form performs the test involving integer-expres-
+ sion after each execution of statement-or-block rather than before.
+ This guarantees that statement-or-block will get executed at least
+ once.
+
+ A simple example from the jed editor follows:
+
+ bob (); % Move to beginning of buffer
+ do
+ {
+ indent_line ();
+ }
+ while (down (1));
+
+ This will cause all lines in the buffer to get indented via the jed
+ intrinsic function indent_line.
+
+ 8.3.2.3. for
+
+ Perhaps the most complex looping statement is the for statement;
+ nevertheless, it is a favorite of many C programmers. This statement
+ obeys the syntax
+
+ for (init-expression; integer-expression; end-expression) statement-
+ or-block then statement-or-block next-statement
+
+ In addition to statement-or-block, its specification requires three
+ other expressions. When executed, the for statement evaluates init-
+ expression, then it tests integer-expression. If integer-expression
+ evaluates to zero, control passes to next-statement. Otherwise, it
+ executes statement-or-block as long as integer-expression evaluates to
+ a non-zero result. After every execution of statement-or-block, end-
+ expression will get evaluated.
+
+ This statement is almost equivalent to
+
+ init-expression; while (integer-expression) { statement-or-block end-
+ expression; }
+
+ The reason that they are not fully equivalent involves what happens
+ when statement-or-block contains a continue statement.
+
+ Despite the apparent complexity of the for statement, it is very easy
+ to use. As an example, consider
+
+ s = 0;
+ for (i = 1; i <= 10; i++) s += i;
+
+ which computes the sum of the first 10 integers.
+
+ 8.3.2.4. loop
+
+ The loop statement simply executes a block of code a fixed number of
+ times. It follows the syntax
+
+ loop (integer-expression) statement-or-block then statement-or-block
+ next-statement
+
+ If the integer-expression evaluates to a positive integer, statement-
+ or-block will get executed that many times. Otherwise, control will
+ pass to next-statement.
+
+ For example,
+
+ loop (10) newline ();
+
+ will execute the newline function 10 times.
+
+ 8.3.2.5. _for
+
+ Like loop, the _for statement simply executes a block of code a fixed
+ number times. Unlike the loop statement, the _for loop is useful in
+ situations where the loop index is needed. It obeys the syntax
+
+ _for loop-variable (first-value, last-value, increment) block then
+ statement-or-block next-statement
+
+ Each time through the loop, the loop-variable will take on the succes-
+ sive values dictated by the other parameters. The first time through,
+ the loop-variable will have the value of first-value. The second time
+ its value will be first-value + increment, and so on. The loop will
+ terminate when the value of the loop index exceeds last-value. The
+ current implementation requires the control parameters first-value,
+ last-value, and increment to be integer-valued expressions.
+
+ For example, the _for statement may be used to compute the sum of the
+ first ten integers:
+
+ s = 0;
+ _for i (1, 10, 1)
+ s += i;
+
+ The execution speed of the _for loop is more than twice as fast as the
+ more powerful for loop making it a better choice for many situations.
+
+ 8.3.2.6. forever
+
+ The forever statement is similar to the loop statement except that it
+ loops forever, or until a break or a return statement is executed. It
+ obeys the syntax
+
+ forever statement-or-block then statement-or-block 
+
+ A trivial example of this statement is
+
+ n = 10;
+ forever
+ {
+ if (n == 0) break;
+ newline ();
+ n--;
+ }
+
+ 8.3.2.7. foreach
+
+ The foreach statement is used to loop over one or more statements for
+ every element of an object. Most often the object will be a container
+ object such as an array, structure, or associative arrays, but it need
+ not be.
+
+ The simple type of foreach statement obeys the syntax
+
+ foreach var (object) statement-or-block then statement-or-block 
+
+ Here object can be an expression that evaluates to a value. Each time
+ through the loop the variable var will take on a value that depends
+ upon the data type of the object being processed. For container
+ objects, var will take on values of successive members of the object.
+
+ A simple example is
+
+ foreach fruit ("apple", "peach", "pear")
+ process_fruit (fruit);
+
+ This example shows that if the container object is an array, then suc-
+ cessive elements of the array are assigned to fruit prior to each exe-
+ cution cycle. If the container object is a string, then successive
+ characters of the string are assigned to the variable.
+
+ What actually gets assigned to the variable may be controlled via the
+ using form of the foreach statement. This more complex type of foreach
+ statement follows the syntax
+
+ foreach var ( container-object ) using ( control-list ) statement-or-
+ block
+
+ The allowed values of control-list will depend upon the type of con-
+ tainer object. For associative arrays (Assoc_Type), control-list spec-
+ ifies whether keys, values, or both are used. For example,
+
+ foreach k (a) using ("keys")
+ {
+ .
+ .
+ }
+
+ results in the keys of the associative array a being successively
+ assigned to k. Similarly,
+
+ foreach v (a) using ("values")
+ {
+ .
+ .
+ }
+
+ will cause the values to be used. The form
+
+ foreach k,v (a) using ("keys", "values")
+ {
+ .
+ .
+ }
+
+ may be used when both keys and values are desired.
+
+ Similarly, for linked-lists of structures, one may walk the list via
+ code like
+
+ foreach s (linked_list) using ("next")
+ {
+ .
+ .
+ }
+
+ This foreach statement is equivalent
+
+ s = linked_list;
+ while (s != NULL)
+ {
+ .
+ .
+ s = s.next;
+ }
+
+ Consult the type-specific documentation for a discussion of the using
+ control words, if any, appropriate for a given type.
+
+ 8.3.3. break, return, and continue
+
+ S-Lang also includes the non-local transfer statements return, break,
+ and continue. The return statement causes control to return to the
+ calling function while the break and continue statements are used in
+ the context of loop structures. Consider:
+
+ define fun ()
+ {
+ forever
+ {
+ s1;
+ s2;
+ ..
+ if (condition_1) break;
+ if (condition_2) return;
+ if (condition_3) continue;
+ ..
+ s3;
+ }
+ s4;
+ ..
+ }
+
+ Here, a function fun has been defined that contains a forever loop
+ consisting of statements s1, s2,...,s3, and three if statements. As
+ long as the expressions condition_1, condition_2, and condition_3
+ evaluate to zero, the statements s1, s2,...,s3 will be repeatedly exe-
+ cuted. However, if condition_1 returns a non-zero value, the break
+ statement will get executed, and control will pass out of the forever
+ loop to the statement immediately following the loop, which in this
+ case is s4. Similarly, if condition_2 returns a non-zero number, the
+ return statement will cause control to pass back to the caller of fun.
+ Finally, the continue statement will cause control to pass back to the
+ start of the loop, skipping the statement s3 altogether.
+
+ 8.3.4. The looping then clause
+
+ As mentioned above, all the looping statements support an optional
+ then clause. The statements that comprise this clause get executed
+ only when the loop has run to completion and was not prematurely
+ terminated via a break statement. As an example, consider the
+ following:
+
+ count = 0;
+ max_tries = 20;
+ while (count < max_tries)
+ {
+ if (try_something ())
+ break;
+
+ count++;
+ % Failed -- try again
+ }
+ if (count == 20)
+ throw RunTimeError, "try_something failed 20 times";
+
+ Here, the code makes 20 attempts to perform some task (via the
+ try_something function) and if not successful it will throw an excep-
+ tion. Compare the above to an equivalent form that makes use of a
+ then-clause for the loop statement:
+
+ max_tries = 20;
+ loop (max_tries)
+ {
+ if (try_something ())
+ break;
+ % Failed -- try again
+ }
+ then throw RunTimeError, "try_something failed 20 times";
+
+ Here, the then statement would get executed only if the loop statement
+ has run to completion, i.e., loops 20 times in this case. This only
+ happens if the try_something function fails each time through the
+ loop. However, if the try_something function succeeds, then the break
+ statement will get executed causing the loop to abort prematurely,
+ which would result in the then clause not getting executed.
+
+ The use of such a construct can also simplify code such as:
+
+ if (some_condition)
+ {
+ foo_statements;
+ if (another_condition)
+ bar_statements;
+ else
+ fizzle_statements;
+ }
+ else fizzle_statements;
+
+ In this case the fizzle_statements are duplicated making the code ugly
+ and less maintainable. Ideally one would wrap the fizzle_statements in
+ a separate function and call it twice. However, this is not always
+ possible or convenient. The duplication can be eliminated by using the
+ then form of the loop statement:
+
+ loop (some_condition != 0)
+ {
+ foo_statements;
+ if (another_condition)
+ {
+ bar_statements;
+ break;
+ }
+ }
+ then fizzle_statements;
+
+ Here, the expression some_condition != 0 is going to result in either
+ 0 or 1, causing the code to execute 0 or 1 loops. Since the fiz-
+ zle_statements are contained in the then clause, they will get exe-
+ cuted only when the requested number of loops executes to completion.
+ Executing 0 loops is regarded as successful completion of the loop
+ statement. Hence, when some_condition is 0, the fizzle_statements will
+ get executed. The fizzle_statements will not get executed only when
+ the loop is prematurely terminated, and that will occur when both
+ some_condition and another_condition are non-zero.
+
+ 9. Functions
+
+ There are essentially two classes of functions that may be called from
+ the interpreter: intrinsic functions and slang functions.
+
+ An intrinsic function is one that is implemented in C or some other
+ compiled language and is callable from the interpreter. Nearly all of
+ the built-in functions are of this variety. At the moment the basic
+ interpreter provides nearly 300 intrinsic functions. Examples include
+ the trigonometric functions sin and cos, string functions such as
+ strcat, etc. Dynamically loaded modules such as the png and pcre
+ modules add additional intrinsic functions.
+
+ The other type of function is written in S-Lang and is known simply as
+ a ``S-Lang function''. Such a function may be thought of as a group of
+ statements that work together to perform a computation. The
+ specification of such functions is the main subject of this chapter.
+
+ 9.1. Declaring Functions
+
+ Like variables, functions must be declared before they can be used.
+ The define keyword is used for this purpose. For example,
+
+ define factorial ();
+
+ is sufficient to declare a function named factorial. Unlike the vari-
+ able keyword used for declaring variables, the define keyword does not
+ accept a list of names.
+
+ Usually, the above form is used only for recursive functions. In most
+ cases, the function name is almost always followed by a parameter list
+ and the body of the function:
+
+ define function-name (parameter-list) { statement-list }
+
+ The function-name is an identifier and must conform to the naming
+ scheme for identifiers discussed in the chapter on ``Identifiers''.
+ The parameter-list is a comma-separated list of variable names that
+ represent parameters passed to the function, and may be empty if no
+ parameters are to be passed. The variables in the parameter-list are
+ implicitly declared, thus, there is no need to declare them via a
+ variable declaration statement. In fact any attempt to do so will
+ result in a syntax error.
+
+ The body of the function is enclosed in braces and consists of zero or
+ more statements (statement-list). While there are no imposed limits
+ upon the number statements that may occur within a S-Lang function, it
+ is considered poor programming practice if a function contains many
+ statements. This notion stems from the belief that a function should
+ have a simple, well-defined purpose.
+
+ 9.2. Parameter Passing Mechanism
+
+ Parameters to a function are always passed by value and never by
+ reference. To see what this means, consider
+
+ define add_10 (a)
+ {
+ a = a + 10;
+ }
+ variable b = 0;
+ add_10 (b);
+
+ Here a function add_10 has been defined, which when executed, adds 10
+ to its parameter. A variable b has also been declared and initialized
+ to zero before being passed to add_10. What will be the value of b
+ after the call to add_10? If S-Lang were a language that passed param-
+ eters by reference, the value of b would be changed to 10. However,
+ S-Lang always passes by value, which means that b will retain its
+ value during and after after the function call.
+
+ S-Lang does provide a mechanism for simulating pass by reference via
+ the reference operator. This is described in greater detail in the
+ next section.
+
+ If a function is called with a parameter in the parameter list
+ omitted, the corresponding variable in the function will be set to
+ NULL. To make this clear, consider the function
+
+ define add_two_numbers (a, b)
+ {
+ if (a == NULL) a = 0;
+ if (b == NULL) b = 0;
+ return a + b;
+ }
+
+ This function must be called with two parameters. However, either of
+ them may omitted by calling the function in one of the following ways:
+
+ variable s = add_two_numbers (2,3);
+ variable s = add_two_numbers (2,);
+ variable s = add_two_numbers (,3);
+ variable s = add_two_numbers (,);
+
+ The first example calls the function using both parameters, but at
+ least one of the parameters was omitted in the other examples. If the
+ parser recognizes that a parameter has been omitted by finding a comma
+ or right-parenthesis where a value is expected, it will substitute
+ NULL for missing value. This means that the parser will convert the
+ latter three statements in the above example to:
+
+ variable s = add_two_numbers (2, NULL);
+ variable s = add_two_numbers (NULL, 3);
+ variable s = add_two_numbers (NULL, NULL);
+
+ It is important to note that this mechanism is available only for
+ function calls that specify more than one parameter. That is,
+
+ variable s = add_10 ();
+
+ is not equivalent to add_10(NULL). The reason for this is simple: the
+ parser can only tell whether or not NULL should be substituted by
+ looking at the position of the comma character in the parameter list,
+ and only function calls that indicate more than one parameter will use
+ a comma. A mechanism for handling single parameter function calls is
+ described later in this chapter.
+
+ 9.3. Returning Values
+
+ The usual way to return values from a function is via the return
+ statement. This statement has the simple syntax
+
+ return expression-list ;
+
+ where expression-list is a comma separated list of expressions. If a
+ function does not return any values, the expression list will be
+ empty. A simple example of a function that can return multiple values
+ (two in this case) is:
+
+ define sum_and_diff (x, y)
+ {
+ variable sum, diff;
+
+ sum = x + y; diff = x - y;
+ return sum, diff;
+ }
+
+ 9.4. Multiple Assignment Statement
+
+ In the previous section an example of a function returning two values
+ was given. That function can also be written somewhat simpler as:
+
+ define sum_and_diff (x, y)
+ {
+ return x + y, x - y;
+ }
+
+ This function may be called using
+
+ (s, d) = sum_and_diff (12, 5);
+
+ After the above line is executed, s will have a value of 17 and the
+ value of d will be 7.
+
+ The most general form of the multiple assignment statement is
+
+ ( var_1, var_2, ..., var_n ) = expression;
+
+ Here expression is an arbitrary expression that leaves n items on the
+ stack, and var_k represents an l-value object (permits assignment).
+ The assignment statement removes those values and assigns them to the
+ specified variables. Usually, expression is a call to a function that
+ returns multiple values, but it need not be. For example,
+
+ (s,d) = (x+y, x-y);
+
+ produces results that are equivalent to the call to the sum_and_diff
+ function. Another common use of the multiple assignment statement is
+ to swap values:
+
+ (x,y) = (y,x);
+ (ai, aj, ak) = (aj, ak, ai);
+
+ If an l-value is omitted from the list, then the corresponding value
+ will be removed fro the stack. For example,
+
+ (s, ) = sum_and_diff (9, 4);
+
+ assigns the sum of 9 and 4 to s and the difference (9-4) is removed
+ from the stack. Similarly,
+
+ () = fputs ("good luck", fp);
+
+ causes the return value of the fputs function to be discarded.
+
+ It is possible to create functions that return a variable number of
+ values instead of a fixed number. Although such functions are
+ discouraged, it is easy to cope with them. Usually, the value at the
+ top of the stack will indicate the actual number of return values. For
+ such functions, the multiple assignment statement cannot directly be
+ used. To see how such functions can be dealt with, consider the
+ following function:
+
+ define read_line (fp)
+ {
+ variable line;
+ if (-1 == fgets (&line, fp))
+ return -1;
+ return (line, 0);
+ }
+
+ This function returns either one or two values, depending upon the
+ return value of fgets. Such a function may be handled using:
+
+ status = read_line (fp);
+ if (status != -1)
+ {
+ s = ();
+ .
+ .
+ }
+
+ In this example, the last value returned by read_line is assigned to
+ status and then tested. If it is non-zero, the second return value is
+ assigned to s. In particular note the empty set of parenthesis in the
+ assignment to s. This simply indicates that whatever is on the top of
+ the stack when the statement is executed will be assigned to s.
+
+ 9.5. Referencing Variables
+
+ One can achieve the effect of passing by reference by using the
+ reference (&) and dereference (@) operators. Consider again the add_10
+ function presented in the previous section. This time it is written
+ as:
+
+ define add_10 (a)
+ {
+ @a = @a + 10;
+ }
+ variable b = 0;
+ add_10 (&b);
+
+ The expression &b creates a reference to the variable b and it is the
+ reference that gets passed to add_10. When the function add_10 is
+ called, the value of the local variable a will be a reference to the
+ variable b. It is only by dereferencing this value that b can be
+ accessed and changed. So, the statement @a=@a+10 should be read as
+ ``add 10 to the value of the object that a references and assign the
+ result to the object that a references''.
+
+ The reader familiar with C will note the similarity between references
+ in S-Lang and pointers in C.
+
+ References are not limited to variables. A reference to a function may
+ also be created and passed to other functions. As a simple example
+ from elementary calculus, consider the following function which
+ returns an approximation to the derivative of another function at a
+ specified point:
+
+ define derivative (f, x)
+ {
+ variable h = 1e-6;
+ return ((@f)(x+h) - (@f)(x)) / h;
+ }
+ define x_squared (x)
+ {
+ return x^2;
+ }
+ dydx = derivative (&x_squared, 3);
+
+ When the derivative function is called, the local variable f will be a
+ reference to the x_squared function. The x_squared function is called
+ with the specified parameters by dereferencing f with the dereference
+ operator.
+
+ 9.6. Functions with a Variable Number of Arguments
+
+ S-Lang functions may be called with a variable number of arguments. A
+ natural example of such functions is the strcat function, which takes
+ one or more string arguments and returns the concatenated result. An
+ example of different sort is the strtrim function which moves both
+ leading and trailing whitespace from a string. In this case, when
+ called with one argument (the string to be ``trimmed''), the
+ characters that are considered to be whitespace are those in the
+ character-set that have the whitespace property (space, tab, newline,
+ ...). However, when called with two arguments, the second argument may
+ be used to specify the characters that are to be considered as
+ whitespace. The strtrim function exemplifies a class of variadic
+ functions where the additional arguments are used to pass optional
+ information to the function. Another more flexible and powerful way of
+ passing optional information is through the use of qualifiers, which
+ is the subject of the next section.
+
+ When a S-Lang function is called with parameters, those parameters are
+ placed on the run-time stack. The function accesses those parameters
+ by removing them from the stack and assigning them to the variables in
+ its parameter list. This details of this operation are for the most
+ part hidden from the programmer. But what happens when the number of
+ parameters in the parameter list is not equal to the number of
+ parameters passed to the function? If the number passed to the
+ function is less than what the function expects, a StackUnderflow
+ error could result as the function tries to remove items from the
+ stack. If the number passed is greater than the number in the
+ parameter list, then the extras will remain on the stack. The latter
+ feature makes it possible to write functions that take a variable
+ number of arguments.
+
+ Consider the add_10 example presented earlier. This time it is written
+
+ define add_10 ()
+ {
+ variable x;
+ x = ();
+ return x + 10;
+ }
+ variable s = add_10 (12); % ==> s = 22;
+
+ For the uninitiated, this example looks as if it is destined for dis-
+ aster. The add_10 function appears to accept zero arguments, yet it
+ was called with a single argument. On top of that, the assignment to x
+ might look a bit strange. The truth is, the code presented in this
+ example makes perfect sense, once you realize what is happening.
+
+ First, consider what happens when add_10 is called with the parameter
+ 12. Internally, 12 is pushed onto the stack and then the function
+ called. Now, consider the function add_10 itself. In it, x is a local
+ variable. The strange looking assignment `x=()' causes whatever is on
+ the top of the stack to be assigned to x. In other words, after this
+ statement, the value of x will be 12, since 12 is at the top of the
+ stack.
+
+ A generic function of the form
+
+ define function_name (x, y, ..., z)
+ {
+ .
+ .
+ }
+
+ is transformed internally by the parser to something akin to
+
+ define function_name ()
+ {
+ variable x, y, ..., z;
+ z = ();
+ .
+ .
+ y = ();
+ x = ();
+ .
+ .
+ }
+
+ before further parsing. (The add_10 function, as defined above, is
+ already in this form.) With this knowledge in hand, one can write a
+ function that accepts a variable number of arguments. Consider the
+ function:
+
+ define average_n (n)
+ {
+ variable x, y;
+ variable s;
+
+ if (n == 1)
+ {
+ x = ();
+ s = x;
+ }
+ else if (n == 2)
+ {
+ y = ();
+ x = ();
+ s = x + y;
+ }
+ else throw NotImplementedError;
+
+ return s / n;
+ }
+ variable ave1 = average_n (3.0, 1); % ==> 3.0
+ variable ave2 = average_n (3.0, 5.0, 2); % ==> 4.0
+
+ Here, the last argument passed to average_n is an integer reflecting
+ the number of quantities to be averaged. Although this example works
+ fine, its principal limitation is obvious: it only supports one or two
+ values. Extending it to three or more values by adding more else if
+ constructs is rather straightforward but hardly worth the effort.
+ There must be a better way, and there is:
+
+ define average_n (n)
+ {
+ variable s, x;
+ s = 0;
+ loop (n)
+ {
+ x = (); % get next value from stack
+ s += x;
+ }
+ return s / n;
+ }
+
+ The principal limitation of this approach is that one must still pass
+ an integer that specifies how many values are to be averaged. Fortu-
+ nately, a special variable exists that is local to every function and
+ contains the number of values that were passed to the function. That
+ variable has the name _NARGS and may be used as follows:
+
+ define average_n ()
+ {
+ variable x, s = 0;
+
+ if (_NARGS == 0)
+ usage ("ave = average_n (x, ...);");
+
+ loop (_NARGS)
+ {
+ x = ();
+ s += x;
+ }
+ return s / _NARGS;
+ }
+
+ Here, if no arguments are passed to the function, the usage function
+ will generate a UsageError exception along with a simple message indi-
+ cating how to use the function.
+
+ 9.7. Qualifiers
+
+ One way to pass optional information to a function is to do so using
+ the variable arguments mechanism described in the previous section.
+ However, a much more powerful mechanism is through the use of
+ qualifiers, which were added in version 2.1.
+
+ To illustrate the use of qualifiers, consider a graphics application
+ that defines a function called plot that plots a set of (x,y) values
+ specified as 1-d arrays:
+
+ plot(x,y);
+
+ Suppose that when called in the above manner, the application will
+ plot the data as black points. But instead of black points, one might
+ want to plot the data using a red diamond as the plot symbol. It
+ would be silly to have a separate function such as plot_red_diamond
+ for this purpose. A much better way to achieve this functionality is
+ through the use of qualifiers:
+
+ plot(x,y ; color="red", symbol="diamond");
+
+ Here, a single semicolon is used to separate the argument-list proper
+ (x,y) from the list of qualifiers. In this case, the qualifiers are
+ ``color'' and ``symbol''. The order of the qualifiers in unimportant;
+ the function could just as well have been called with the symbol qual-
+ ifier listed first.
+
+ Now consider the implementation of the plot function:
+
+ define plot (x, y)
+ {
+ variable color = qualifier ("color", "black");
+ variable symbol = qualifier ("symbol", "point");
+ variable symbol_size = qualifier ("size", 1.0);
+ .
+ .
+ }
+
+ Note that the qualifiers are not handled in the parameter list; rather
+ they are handled in the function body using the qualifier function,
+ which is used to obtain the value of the qualifier. The second argu-
+ ment to the qualifier function specifies the default value to be used
+ if the function was not called with the specified qualifier. Also note
+ that the variable associated with the qualifier need not have the same
+ name as the qualifier.
+
+ A qualifier need not have a value--- its mere presence may be used to
+ enable or disable a feature or trigger some action. For example,
+
+ plot (x, y; connect_points);
+
+ specifies a qualifier called connect_points that indicates that a line
+ should be drawn between the data points. The presence of such a quali-
+ fier can be detected using the qualifier_exists function:
+
+ define plot (x,y)
+ {
+ .
+ .
+ variable connect_points = qualifier_exists ("connect_points");
+ .
+ .
+ }
+
+ Sometimes it is useful for a function to pass the qualifiers that it
+ has received to other functions. Suppose that the plot function calls
+ draw_symbol to plot the specified symbol at a particular location and
+ that it requires the symbol attibutes to be specified using
+ qualifiers. Then the plot function might look like:
+
+ define plot (x, y)
+ {
+ variable color = qualifier ("color", "black");
+ variable symbol = qualifier ("symbol", "point");
+ variable symbol_size = qualifier ("size", 1.0);
+ .
+ .
+ _for i (0, length(x)-1, 1)
+ draw_symbol (xi,yi
+ ;color=color, size=symbol_size, symbol=symbol);
+ .
+ .
+ }
+
+ The problem with this approach is that it does not scale well: the
+ plot function has to be aware of all the qualifiers that the draw_sym-
+ bol function takes and explicitly pass them. In many cases this can be
+ quite cumbersome and error prone. Rather it is better to simply pass
+ the qualifiers that were passed to the plot function on to the
+ draw_symbol function. This may be achieved using the __qualifiers
+ function. The __qualifiers function returns the list of qualifiers in
+ the form of a structure whose field names are the same as the quali-
+ fier names. In fact, the use of this function can simplify the imple-
+ mentation of the plot function, which may be coded more simply as
+
+ define plot (x, y)
+ {
+ variable i;
+ _for i (0, length(x)-1, 1)
+ draw_symbol (xi,yi ;; __qualifiers());
+ }
+
+ Note the syntax is slightly different. The two semicolons indicate
+ that the qualifiers are specified not as name-value pairs, but as a
+ structure. Using a single semicolon would have created a qualifier
+ called __qualifiers, which is not what was desired.
+
+ As alluded to above an added benefit of this approach is that the plot
+ function does not need to know nor care about the qualifiers supported
+ by draw_symbol. When called as
+
+ plot (x, y; symbol="square", size=2.0, fill=0.8);
+
+ the fill qualifier would get passed to the draw_symbol function to
+ specify the ``fill'' value to be used when creating the symbol.
+
+ 9.8. Exit-Blocks
+
+ An exit-block is a set of statements that get executed when a
+ functions returns. They are very useful for cleaning up when a
+ function returns via an explicit call to return from deep within a
+ function.
+
+ An exit-block is created by using the EXIT_BLOCK keyword according to
+ the syntax
+
+ EXIT_BLOCK { statement-list }
+
+ where statement-list represents the list of statements that comprise
+ the exit-block. The following example illustrates the use of an exit-
+ block:
+
+ define simple_demo ()
+ {
+ variable n = 0;
+
+ EXIT_BLOCK { message ("Exit block called."); }
+
+ forever
+ {
+ if (n == 10) return;
+ n++;
+ }
+ }
+
+ Here, the function contains an exit-block and a forever loop. The
+ loop will terminate via the return statement when n is 10. Before it
+ returns, the exit-block will get executed.
+
+ A function can contain multiple exit-blocks, but only the last one
+ encountered during execution will actually get used. For example,
+
+ define simple_demo (n)
+ {
+ EXIT_BLOCK { return 1; }
+
+ if (n != 1)
+ {
+ EXIT_BLOCK { return 2; }
+ }
+ return;
+ }
+
+ If 1 is passed to this function, the first exit-block will get exe-
+ cuted because the second one would not have been encountered during
+ the execution. However, if some other value is passed, the second
+ exit-block would get executed. This example also illustrates that it
+ is possible to explicitly return from an exit-block, but nested exit-
+ blocks are illegal.
+
+ 9.9. Handling Return Values from a Function
+
+ The most important rule to remember in calling a function is that if
+ the function returns a value, the caller must do something with it.
+ While this might sound like a trivial statement it is the number one
+ issue that trips-up novice users of the language.
+
+ To elaborate on this point further, consider the fputs function, which
+ writes a string to a file descriptor. This function can fail when,
+ e.g., a disk is full, or the file is located on a network share and
+ the network goes down, etc.
+
+ S-Lang supports two mechanisms that a function may use to report a
+ failure: raising an exception, returning a status code. The latter
+ mechanism is used by the S-Lang fputs function. i.e., it returns a
+ value to indicate whether or not is was successful. Many users
+ familiar with this function either seem to forget this fact, or assume
+ that the function will succeed and not bother handling the return
+ value. While some languages silently remove such values from the
+ stack, S-Lang regards the stack as a dynamic data structure that
+ programs can utilize. As a result, the value will be left on the S-
+ Lang stack and can cause problems later on.
+
+ There are a number of correct ways of ``doing something'' with the
+ return value from a function. Of course the recommended procedure is
+ to use the return value as it was meant to be used. In the case of
+ fputs, the proper thing to do is to check the return value, e.g.,
+
+ if (-1 == fputs ("good luck", fp))
+ {
+ % Handle the error
+ }
+
+ Other acceptable ways to ``do something'' with the return value
+ include assigning it to a dummy variable,
+
+ dummy = fputs ("good luck", fp);
+
+ or simply ``popping'' it from the stack:
+
+ fputs ("good luck", fp); pop();
+
+ The latter mechanism can also be written as
+
+ () = fputs ("good luck", fp);
+
+ The last form is a special case of the multiple assignment statement,
+ which was discussed earlier. Since this form is simpler than assigning
+ the value to a dummy variable or explicitly calling the pop function,
+ it is recommended over the other two mechanisms. Finally, this form
+ has the redeeming feature that it presents a visual reminder that the
+ function is returning a value that is not being used.
+
+ 10. Namespaces
+
+ By default, all global variables and functions are defined in the
+ global or public namespace. In addition to the global namespace, every
+ compilation unit (e.g., a file containing S-Lang code) has a private,
+ or anonymous namespace. The private namespace is used when one wants
+ to restrict the usage of one or more functions or variables to the
+ compilation unit that defines them without worrying about objects with
+ the same names defined elsewhere.
+
+ Objects are declared as belonging to the private namespace using the
+ private declaration keyword. Similarly if a variable is declared using
+ the public qualifier, it will be placed in the public namespace. For
+ example,
+
+ private variable i;
+ public variable j;
+
+ defines a variable called i in the private namespace and one called j
+ in the public namespace.
+
+ The implements function may be used to create a new namespace of a
+ specified name and have it associated with the compilation unit.
+ Objects may be placed into this namespace space using the static
+ keyword, e.g.,
+
+ static variable X;
+ static define foo () {...}
+
+ For this reason, such a namespace will be called the static namespace
+ associated with the compilation unit. Such objects may be accessed
+ from outside the local compilation unit using the namespace operator
+ -> in conjunction with the name of the namespace.
+
+ Since it is possible for three namespaces (private, static, public) to
+ be associated with a compilation unit, it is important to understand
+ how names are resolved by the parser. During the compilation stage,
+ symbols are looked up according to the current scope. If in a
+ function, the local variables of the function are searched first. Then
+ the search proceeds with symbols in the private namespace, followed by
+ those in the static namespace associated with the compilation unit (if
+ any), and finally with the public namespace. If after searching the
+ public namespace the symbol has not been resolved, an
+ UndefinedNameError exception will result.
+
+ In addition to using the implements function, there are other ways to
+ associate a namespace with a compilation unit. One is via the optional
+ namespace argument of the evalfile function. For example,
+
+ () = evalfile ("foo.sl", "bar");
+
+ will cause foo.sl to be loaded and associated with a namespace called
+ bar. Then any static symbols of foo.sl may accessed using the bar->
+ prefix.
+
+ It is important to note that if a static namespace has been associated
+ with the compilation unit, then any symbols in that unit declared
+ without an namespace qualifier will be placed in the static namespace.
+ Otherwise such symbols will be placed in the public namespace, and any
+ symbols declared as static will be placed in the private namespace.
+
+ To illustrate these concepts, consider the following example:
+
+ % foo.sl
+ variable X = 1;
+ static variable Y;
+ private variable Z;
+ public define set_Y (y) { Y = y; }
+ static define set_z (z) { Z = z; }
+
+ If foo.sl is loaded via
+
+ () = evalfile ("foo.sl");
+
+ then no static namespace will be associated with it. As a result, X
+ will be placed in the public namespace since it was declared with no
+ namespace qualifier. Also Y and set_z will be placed in the private
+ namespace since no static namespace has been associated with the file.
+ In this scenario there will be no way to get at the Z variable from
+ outside of foo.sl since both it and the function that accesses it
+ (set_z) are placed in the private namespace.
+
+ On the other hand, suppose that the file is loaded using a namespace
+ argument:
+
+ () = evalfile ("foo.sl", "foo");
+
+ In this case X, Y, and set_z will be placed in the foo namespace.
+ These objects may be accessed from outside foo.sl using the foo-> pre-
+ fix, e.g.,
+
+ foo->set_z (3.0);
+ if (foo->X == 2) foo->Y = 1;
+
+ Because a file may be loaded with or without a namespace attached to
+ it, it is a good idea to avoid using the static qualifier. To see
+ this, consider again the above example but this time without the use
+ of the static qualifier:
+
+ % foo.sl
+ variable X = 1;
+ variable Y;
+ private variable Z;
+ public define set_Y (y) { Y = y; }
+ define set_z (z) { Z = z; }
+
+ When loaded without a namespace argument, the variable Z will remain
+ in the private namespace, but the set_z function will be put in the
+ public namespace. Previously set_z was put in the private namespace
+ making both it and Z inaccessible.
+
+ 11. Arrays
+
+ An array is a container object that can contain many values of one
+ data type. Arrays are very useful objects and are indispensable for
+ certain types of programming. The purpose of this chapter is to
+ describe how arrays are defined and used in the S-Lang language.
+
+ 11.1. Creating Arrays
+
+ The S-Lang language supports multi-dimensional arrays of all data
+ types. Since the Array_Type is a data type, one can even have arrays
+ of arrays. To create a multi-dimensional array of SomeType and assign
+ to some variable, use:
+
+ a = SomeType dim0, dim1, ..., dimN;
+
+ Here dim0, dim1, ... dimN specify the size of the individual dimen-
+ sions of the array. The current implementation permits arrays to con-
+ tain as many as 7 dimensions. When a numeric array is created, all its
+ elements are initialized to zero. The initialization of other array
+ types depend upon the data type, e.g., the elements in String_Type and
+ Struct_Type arrays are initialized to NULL.
+
+ As a concrete example, consider
+
+ a = Integer_Type 10;
+
+ which creates a one-dimensional array of 10 integers and assigns it to
+ a. Similarly,
+
+ b = Double_Type 10, 3;
+
+ creates a 30 element array of double precision numbers arranged in 10
+ rows and 3 columns, and assigns it to b.
+
+ 11.1.1. Range Arrays
+
+ There is a more convenient syntax for creating and initializing 1-d
+ arrays. For example, to create an array of ten integers whose elements
+ run from 1 through 10, one may simply use:
+
+ a = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
+
+ Similarly,
+
+ b = 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0;
+
+ specifies an array of ten doubles.
+
+ An even more compact way of specifying a numeric array is to use a
+ range-array. For example,
+
+ a = 0:9;
+
+ specifies an array of 10 integers whose elements range from 0 through
+ 9. The syntax for the most general form of range array is given by
+
+ first-value : last-value : increment
+
+ where the increment is optional and defaults to 1. This creates an
+ array whose first element is first-value and whose successive values
+ differ by increment. last-value sets an upper limit upon the last
+ value of the array as described below.
+
+ If the range array a:b:c is integer valued, then the interval
+ specified by a and b is closed. That is, the kth element of the array
+ x_k is given by x_k=a+kc and satisfies a<=x_k<=b. Hence, the number of
+ elements in an integer range array is given by the expression 1 + (b-
+ a)/c.
+
+ The situation is somewhat more complicated for floating point range
+ arrays. The interval specified by a floating point range array a:b:c
+ is semi-open such that b is not contained in the interval. In
+ particular, the kth element of a:b:c is given by x_k=a+kc such that
+ a<=x_k=0, and b<x_k<=a otherwise. The number of elements in
+ the array is one greater than the largest k that satisfies the open
+ interval constraint.
+
+ In contrast, a range-array expressed in the form a:b:#n represents
+ an array of exactly n elements running from a to b inclusive. It is
+ equivalent to a+0:n-1*(b-a)/(n-1).
+
+ Here are a few examples that illustrate the above comments:
+
+ 1:5:1 ==> 1,2,3,4,5
+ 1.0:5.0:1.0 ==> 1.0, 2.0, 3.0, 4.0
+ 5:1:-1 ==> 5,4,3,2,1
+ 5.0:1.0:-1.0 ==> 5.0, 4.0, 3.0, 2.0;
+ 1:1 ==> 1
+ 1.0:1.0 ==> 
+ 1.0:1.0001 ==> 1.0
+ 1:-3 ==> 
+ 0:1:#5 ==> 0.0, 0.25, 0.50, 0.75, 1.0
+ 0:-1:#3 ==> 0.0, -0.5, -1.0
+
+ Currently Int_Type is the only integer type supported by range
+ arrays--- arbitrary integer types will be supported in a future
+ version. This means that 1h:5h will not produce an array of
+ Short_Type, rather it will produce an Int_Type array. However,
+ 1h,2h,3h,4h,5h will produce an array of Short_Type integers.
+
+ 11.1.2. Creating arrays via the dereference operator
+
+ Another way to create an array is to apply the dereference operator @
+ to the DataType_Type literal Array_Type. The actual syntax for this
+ operation resembles a function call
+
+ variable a = @Array_Type (data-type, integer-array);
+
+ where data-type is of type DataType_Type and integer-array is a 1-d
+ array of integers that specify the size of each dimension. For exam-
+ ple,
+
+ variable a = @Array_Type (Double_Type, 10, 20);
+
+ will create a 10 by 20 array of doubles and assign it to a. This
+ method of creating arrays derives its power from the fact that it is
+ more flexible than the methods discussed in this section. It is par-
+ ticularly useful for creating arrays during run-time in situations
+ where the data-type can vary.
+
+ 11.2. Reshaping Arrays
+
+ It is sometimes useful to change the `shape' of an array using the
+ reshape function. For example, a 1-d 10 element array may be reshaped
+ into a 2-d array consisting of 5 rows and 2 columns. The only
+ restriction on the operation is that the arrays must be commensurate.
+ The reshape function follows the syntax
+
+ reshape (array-name, integer-array);
+
+ where array-name specifies the array to be reshaped to the dimensions
+ given by integer-array, a 1-dimensional array of integers. It is
+ important to note that this does not create a new array, it simply
+ reshapes the existing array. Thus,
+
+ variable a = Double_Type 100;
+ reshape (a, 10, 10);
+
+ turns a into a 10 by 10 array, as well as any other variables attached
+ to the array.
+
+ The _reshape function works like reshape except that it creates a new
+ array instead of changing the shape of an existing array:
+
+ new_a = _reshape (a, 10,10);
+
+ 11.3. Simple Array Indexing
+
+ An individual element of an array may be referred to by its index. For
+ example, a0 specifies the zeroth element of the one dimensional
+ array a, and b3,2 specifies the element in the third row and second
+ column of the two dimensional array b. As in C, array indices are
+ numbered from 0. Thus if a is a one-dimensional array of ten integers,
+ the last element of the array is given by a9. Using a10 would
+ result in an IndexError exception.
+
+ A negative index may be used to index from the end of the array, with
+ a-1 referring to the last element of a. Similarly, a-2 refers to
+ the next to the last element, and so on.
+
+ One may use the indexed value like any other variable. For example, to
+ set the third element of an integer array to 6, use
+
+ a2 = 6;
+
+ Similarly, that element may be used in an expression, such as
+
+ y = a2 + 7;
+
+ Unlike other S-Lang variables which inherit a type upon assignment,
+ array elements already have a type and any attempt to assign a value
+ with an incompatible type will result in a TypeMismatchError excep-
+ tion. For example, it is illegal to assign a string value to an inte-
+ ger array.
+
+ One may use any integer expression to index an array. A simple example
+ that computes the sum of the elements of a 10 element 1-d array is
+
+ variable i, s;
+ s = 0;
+ for (i = 0; i < 10; i++) s += ai;
+
+ (In practice, do not carry out sums this way--- use the sum function
+ instead, which is much simpler and faster, i.e., s=sum(a)).
+
+ 11.4. Indexing Multiple Elements with Ranges
+
+ Unlike many other languages, S-Lang permits arrays to be indexed by
+ other integer arrays. Suppose that a is a 1-d array of 10 doubles. Now
+ consider:
+
+ i = 6:8;
+ b = ai;
+
+ Here, i is a 1-dimensional range array of three integers with i0
+ equal to 6, i1 equal to 7, and i2 equal to 8. The statement b =
+ ai; will create a 1-d array of three doubles and assign it to b.
+ The zeroth element of b, b0 will be set to the sixth element of a,
+ or a6, and so on. In fact, these two simple statements are equiva-
+ lent to
+
+ b = Double_Type 3;
+ b0 = a6;
+ b1 = a7;
+ b2 = a8;
+
+ except that using an array of indices is not only much more conve-
+ nient, but executes much faster.
+
+ More generally, one may use an index array to specify which elements
+ are to participate in a calculation. For example, consider
+
+ a = Double_Type 1000;
+ i = 0:499;
+ j = 500:999;
+ ai = -1.0;
+ aj = 1.0;
+
+ This creates an array of 1000 doubles and sets the first 500 elements
+ to -1.0 and the last 500 to 1.0. Actually, one may do away with the i
+ and j variables altogether and use
+
+ a = Double_Type 1000;
+ a0:499 = -1.0;
+ a500:999 = 1.0;
+
+ It is important to note that the syntax requires the use of the double
+ square brackets, and in particular that a0:499 is not the same as
+ a0:499. In fact, the latter will generate a syntax error.
+
+ Index-arrays are not contrained to be one-dimensional arrays. Suppose
+ that I represents a multidimensional index array, and that A is the
+ array to be indexed. Then what does AI represent? Its value will be
+ an array of the same type as A, but with the dimensionality of I. For
+ example,
+
+ a = 1.0*1:10;
+ i = _reshape (4,5,6,7,8,9, 2,3);
+
+ defines a to be a 10 element array of doubles, and i to be 2x3 array
+ of integers. Then ai will be a 2x3 array of doubles with elements:
+
+ a4 a5 a6
+ a7 a8 a9
+
+ Often, it is convenient to use a ``rubber'' range to specify indices.
+ For example, a500: specifies all elements of a whose index is
+ greater than or equal to 500. Similarly, a:499 specifies the first
+ 500 elements of a. Finally, a: specifies all the elements of a.
+ The latter form may also be written as a*.
+
+ One should be careful when using index arrays with negative elements.
+ As pointed out above, a negative index is used to index from the end
+ of the array. That is, a-1 refers to the last element of a. How
+ should a0:-1 be interpreted?
+
+ In version 1 of the interpreter, when used in an array indexing
+ context, a construct such as 0:-1 was taken to mean from the first
+ element through the last. While this might seem like a convenient
+ shorthand, in retrospect it was a bad idea. For this reason, the
+ meaning of a ranges over negative valued indices was changed in
+ version 2 of the interpreter as follows: First the index-range gets
+ expanded to an array of indices according to the rules for range
+ arrays described above. Then if any of the resulting indices are
+ negative, they are interpreted as indices from the end of the array.
+ For example, if a is an array of 10 elements, then a-2:3 is first
+ expanded to a-2,-1,0,1,2,3, and then to the 6 element array
+
+ a8, a9, a0, a1, a2, a3 
+
+ So, what does a0:-1 represent in the new interpretation? Since
+ 0:-1 expands to an empty array, a0:-1 will also produce an empty
+ array.
+
+ Indexing of multidimensional arrays using ranges works similarly.
+ Suppose a is a 100 by 100 array of doubles. Then the expression a0,
+ * specifies all elements in the zeroth row. Similarly, a*, 7
+ specifies all elements in the seventh column. Finally, a3:5,6:12
+ specifies the 3 by 7 region consisting of rows 3, 4, and 5, and
+ columns 6 through 12 of a.
+
+ Before leaving this section, a few examples are presented to
+ illustrate some of these points.
+
+ The ``trace'' of a matrix is an important concept that occurs
+ frequently in linear algebra. The trace of a 2d matrix is given by the
+ sum of its diagonal elements. Consider the creation of a function that
+ computes the trace of such a matrix.
+
+ The most straightforward implementation of such a function uses an
+ explicit loop:
+
+ define array_trace (a, n)
+ {
+ variable s = 0, i;
+ for (i = 0; i < n; i++) s += ai, i;
+ return s;
+ }
+
+ Better yet is to recognize that the diagonal elements of an n by n
+ array are given by an index array I with elements 0, n+1, 2*n+2, ...,
+ n*n-1, or more precisely as
+
+ 0:n*n-1:n+1
+
+ Hence the above may be written more simply as
+
+ define array_trace (a, n)
+ {
+ return sum (a0:n*n-1:n+1);
+ }
+
+ The following example creates a 10 by 10 integer array, sets its
+ diagonal elements to 5, and then computes the trace of the array:
+
+ a = Integer_Type 10, 10;
+ a0:99:11 = 5;
+ the_trace = array_trace(a, 10);
+
+ In the previous examples, the size of the array was passed as an
+ additional argument. This is unnecessary because the size may be
+ obtained from array itself by using the array_shape function. For
+ example, the following function may be used to obtain the indices of
+ the diagonal element of an array:
+
+ define diag_indices (a)
+ {
+ variable dims = array_shape (a);
+ if (length (dims) != 2)
+ throw InvalidParmError, "Expecting a 2d array";
+ if (dims0 != dims1)
+ throw InvalidParmError, "Expecting a square array";
+ variable n = dims0;
+ return 0:n*(n-1):n+1;
+ }
+
+ Using this function, the trace function may be written more simply as
+
+ define array_trace (a)
+ {
+ return sum (adiag_indices(a));
+ }
+
+ Another example of this technique is a function that creates an n by n
+ unit matrix:
+
+ define unit_matrix (n)
+ {
+ variable a = Int_Typen, n;
+ adiag_indices(a) = 1;
+ return a;
+ }
+
+ 11.5. Arrays and Variables
+
+ When an array is created and assigned to a variable, the interpreter
+ allocates the proper amount of space for the array, initializes it,
+ and then assigns to the variable a reference to the array. So, a
+ variable that represents an array has a value that is really a
+ reference to the array. This has several consequences, most good and
+ some bad. It is believed that the advantages of this representation
+ outweigh the disadvantages. First, we shall look at the positive
+ aspects.
+
+ When a variable is passed to a function, it is always the value of the
+ variable that gets passed. Since the value of a variable representing
+ an array is a reference, a reference to the array gets passed. One
+ major advantage of this is rather obvious: it is a fast and efficient
+ way to pass the array. This also has another consequence that is
+ illustrated by the function
+
+ define init_array (a)
+ {
+ variable i;
+ variable n = length(a);
+ _for i (0, n-1, 1)
+ ai = some_function (i);
+ }
+
+ where some_function is a function that generates a scalar value to
+ initialize the ith element. This function can be used in the following
+ way:
+
+ variable X = Double_Type 100000;
+ init_array (X);
+
+ Since the array is passed to the function by reference, there is no
+ need to make a separate copy of the 100000 element array. As pointed
+ out above, this saves both execution time and memory. The other
+ salient feature to note is that any changes made to the elements of
+ the array within the function will be manifested in the array outside
+ the function. Of course, in this case this is a desirable side-effect.
+
+ To see the downside of this representation, consider:
+
+ a = Double_Type 10;
+ b = a;
+ a0 = 7;
+
+ What will be the value of b0? Since the value of a is really a ref-
+ erence to the array of ten doubles, and that reference was assigned to
+ b, b also refers to the same array. Thus any changes made to the ele-
+ ments of a, will also be made implicitly to b.
+
+ This begs the question: If the assignment of a variable attached to an
+ an array to another variable results in the assignment of the same
+ array, then how does one make separate copies of the array? There are
+ several answers including using an index array, e.g., b = a*;
+ however, the most natural method is to use the dereference operator:
+
+ a = Double_Type 10;
+ b = @a;
+ a0 = 7;
+
+ In this example, a separate copy of a will be created and assigned to
+ b. It is very important to note that S-Lang never implicitly derefer-
+ ences an object. So, one must explicitly use the dereference operator.
+ This means that the elements of a dereferenced array are not them-
+ selves dereferenced. For example, consider dereferencing an array of
+ arrays, e.g.,
+
+ a = Array_Type 2;
+ a0 = Double_Type 10;
+ a1 = Double_Type 10;
+ b = @a;
+
+ In this example, b0 will be a reference to the array that a0 ref-
+ erences because a0 was not explicitly dereferenced.
+
+ 11.6. Using Arrays in Computations
+
+ Many functions and operations work transparently with arrays. For
+ example, if a and b are arrays, then the sum a + b is an array whose
+ elements are formed from the sum of the corresponding elements of a
+ and b. A similar statement holds for all other binary and unary
+ operations.
+
+ Let's consider a simple example. Suppose, that we wish to solve a set
+ of n quadratic equations whose coefficients are given by the 1-d
+ arrays a, b, and c. In general, the solution of a quadratic equation
+ will be two complex numbers. For simplicity, suppose that all we
+ really want is to know what subset of the coefficients, a, b, c,
+ correspond to real-valued solutions. In terms of for loops, we can
+ write:
+
+ index_array = Char_Type n;
+ _for i (0, n-1, 1)
+ {
+ d = bi^2 - 4 * ai * ci;
+ index_array i = (d >= 0.0);
+ }
+
+ In this example, the array index_array will contain a non-zero value
+ if the corresponding set of coefficients has a real-valued solution.
+ This code may be written much more compactly and with more clarity as
+ follows:
+
+ index_array = ((b^2 - 4 * a * c) >= 0.0);
+
+ Moreover, it executes about 20 times faster than the version using an
+ explicit loop.
+
+ S-Lang has a powerful built-in function called where. This function
+ takes an array of boolean values and returns an array of indices that
+ correspond to where the elements of the input array are non-zero. The
+ utility of this simple operation cannot be overstated. For example,
+ suppose a is a 1-d array of n doubles, and it is desired to set all
+ elements of the array whose value is less than zero to zero. One way
+ is to use a for loop:
+
+ _for i (0, n-1, 1)
+ if (ai < 0.0) ai = 0.0;
+
+ If n is a large number, this statement can take some time to execute.
+ The optimal way to achieve the same result is to use the where func-
+ tion:
+
+ awhere (a < 0.0) = 0;
+
+ Here, the expression (a < 0.0) returns a boolean array whose dimen-
+ sions are the same size as a but whose elements are either 1 or 0,
+ according to whether or not the corresponding element of a is less
+ than zero. This array of zeros and ones is then passed to the where
+ function, which returns a 1-d integer array of indices that indicate
+ where the elements of a are less than zero. Finally, those elements of
+ a are set to zero.
+
+ Consider once more the example involving the set of n quadratic
+ equations presented above. Suppose that we wish to get rid of the
+ coefficients of the previous example that generated non-real
+ solutions. Using an explicit for loop requires code such as:
+
+ nn = 0;
+ _for i (0, n-1, 1)
+ if (index_array i) nn++;
+
+ tmp_a = Double_Type nn;
+ tmp_b = Double_Type nn;
+ tmp_c = Double_Type nn;
+
+ j = 0;
+ _for i (0, n-1, 1)
+ {
+ if (index_array i)
+ {
+ tmp_a j = ai;
+ tmp_b j = bi;
+ tmp_c j = ci;
+ j++;
+ }
+ }
+ a = tmp_a;
+ b = tmp_b;
+ c = tmp_c;
+
+ Not only is this a lot of code, making it hard to digest, but it is
+ also clumsy and error-prone. Using the where function, this task is
+ trivial and executes in a fraction of the time:
+
+ i = where (index_array != 0);
+ a = ai;
+ b = bi;
+ c = ci;
+
+ Most of the examples up till now assumed that the dimensions of the
+ array were known. Although the intrinsic function length may be used
+ to get the total number of elements of an array, it cannot be used to
+ get the individual dimensions of a multi-dimensional array. The
+ array_shape function may be used to determine the dimensionality of an
+ array. It may be used to determine the number of rows of an array as
+ follows:
+
+ define num_rows (a)
+ {
+ return array_shape (a)0;
+ }
+
+ The number of columns may be obtained in a similar manner:
+
+ define num_cols (a)
+ {
+ variable dims = array_shape (a);
+ if (length(dims) > 1) return dims1;
+ return 1;
+ }
+
+ The array_shape function may also be used to create an array that has
+ the same number of dimensions as another array:
+
+ define make_int_array (a)
+ {
+ return @Array_Type (Int_Type, array_shape (a));
+ }
+
+ Finally, the array_info function may be used to get additional
+ information about an array, such as its data type and size.
+
+ 11.7. Arrays of Arrays: A Cautionary Note
+
+ Sometimes it is desirable to create an array of arrays. For example,
+
+ a = Array_Type3;
+ a0 = 1:10;
+ a1 = 1:100;
+ a2 = 1:1000;
+
+ will produce an array of the 3 arrays 1:10, 1:100, and 1:1000.
+ Index arrays may be used to access elements of an array of arrays:
+ a1,2 will produce an array of arrays that consists of the elements
+ a1 and a2. However, it is important to note that setting the ele-
+ ments of an array of arrays via an index array does not work as one
+ might naively expect. Consider the following:
+
+ b = Array_Type3;
+ b* = a2,1,0;
+
+ where a is the array of arrays given in the previous example. The
+ reader might expect b to have elements b0=a2, b1=a1, and
+ b2=a0, and be surprised to learn that b0=b1=b2=a2,1,0.
+ The reason for this is that, by definition, b is an array of arrays,
+ and even though a2,1,0 is an array of arrays, it is first and
+ foremost an array, and it is that array that is assigned to the ele-
+ ments of b.
+
+ 12. Associative Arrays
+
+ An associative array differs from an ordinary array in the sense that
+ its size is not fixed and that it is indexed by a string, called the
+ key. For example, consider:
+
+ A = Assoc_Type Int_Type;
+ A"alpha" = 1;
+ A"beta" = 2;
+ A"gamma" = 3;
+
+ Here, A has been assigned to an associative array of integers
+ (Int_Type) and then three keys were been added to the array.
+
+ As the example suggests, an associative array may be created using one
+ of the following forms:
+
+ Assoc_Type type Assoc_Type type, default-value Assoc_Type 
+
+ The last form returns an un-typed associative array capable of storing
+ values of any type.
+
+ The form involving a default-value is useful for associating a default
+ value with non-existent array members. This feature is explained in
+ more detail below.
+
+ There are several functions that are specially designed to work with
+ associative arrays. These include:
+
+ o assoc_get_keys, which returns an ordinary array of strings
+ containing the keys of the array.
+
+ o assoc_get_values, which returns an ordinary array of the values of
+ the associative array. If the associative array is un-typed, then
+ an array of Any_Type objects will be returned.
+
+ o assoc_key_exists, which can be used to determine whether or not a
+ key exists in the array.
+
+ o assoc_delete_key, which may be used to remove a key (and its value)
+ from the array.
+
+ To illustrate the use of an associative array, consider the problem of
+ counting the number of repeated occurrences of words in a list. Let
+ the word list be represented as an array of strings given by
+ word_list. The number of occurrences of each word may be stored in an
+ associative array as follows:
+
+ a = Assoc_Type Int_Type;
+ foreach word (word_list)
+ {
+ if (0 == assoc_key_exists (a, word))
+ aword = 0;
+ aword++; % same as aword = aword + 1;
+ }
+
+ Note that assoc_key_exists was necessary to determine whether or not a
+ word was already added to the array in order to properly initialize
+ it. However, by creating the associative array with a default value of
+ 0, the above code may be simplified to
+
+ variable a, word;
+ a = Assoc_Type Int_Type, 0;
+ foreach word (word_list)
+ aword++;
+
+ Associative arrays are extremely useful and have may other
+ applications. Whenever there is a one to one mapping between a string
+ and some object, one should always consider using an associative array
+ to represent the mapping. To illustrate this point, consider the
+ following code fragment:
+
+ define call_function (name, arg)
+ {
+ if (name == "foo") return foo (arg);
+ if (name == "bar") return bar (arg);
+ .
+ .
+ if (name == "baz") return baz (arg);
+ throw InvalidParmError;
+ }
+
+ This represents a mapping between names and functions. Such a mapping
+ may be written in terms of an associative array as follows:
+
+ private define invalid_fun (arg) { throw InvalidParmError; }
+ Fun_Map = Assoc_TypeRef_Type, &invalid_fun;
+ define add_function (name, fun)
+ {
+ Fun_Mapname = fun;
+ }
+ add_function ("foo", &foo);
+ add_function ("bar", &bar);
+ .
+ .
+ add_function ("baz", &baz);
+ define call_function (name, arg)
+ {
+ return (@Fun_Mapname)(arg);
+ }
+
+ The most redeeming feature of the version involving the series of if
+ statements is that it is easy to understand. However, the version
+ involving the associative array has two significant advantages over
+ the former. Namely, the function lookup will be much faster with a
+ time that is independent of the item being searched, and it is exten-
+ sible in the sense that additional functions may be added at run-time,
+ e.g.,
+
+ add_function ("bing", &bing);
+
+ 13. Structures and User-Defined Types
+
+ A structure is a heterogeneous container object, i.e., it is an object
+ with elements whose values do not have to be of the same data type.
+ The elements or fields of a structure are named, and one accesses a
+ particular field of the structure via the field name. This should be
+ contrasted with an array whose values are of the same type, and whose
+ elements are accessed via array indices.
+
+ A user-defined data type is a structure with a fixed set of fields
+ defined by the user.
+
+ 13.1. Defining a Structure
+
+ The struct keyword is used to define a structure. The syntax for this
+ operation is:
+
+ struct {field-name-1, field-name-2, ... field-name-N};
+
+ This creates and returns a structure with N fields whose names are
+ specified by field-name-1, field-name-2, ..., field-name-N. When a
+ structure is created, the values of its fields are initialized to
+ NULL.
+
+ For example,
+
+ variable t = struct { city_name, population, next };
+
+ creates a structure with three fields and assigns it to the variable
+ t.
+
+ Alternatively, a structure may be created by dereferencing
+ Struct_Type. Using this technique, the above structure may be created
+ using one of the two forms:
+
+ t = @Struct_Type ("city_name", "population", "next");
+ t = @Struct_Type ("city_name", "population", "next");
+
+ This approach is useful when creating structures dynamically where one
+ does not know the name of the fields until run-time.
+
+ Like arrays, structures are passed around by reference. Thus, in the
+ above example, the value of t is a reference to the structure. This
+ means that after execution of
+
+ u = t;
+
+ both t and u refer to the same underlying structure, since only the
+ reference was copied by the assignment. To actually create a new copy
+ of the structure, use the dereference operator, e.g.,
+
+ variable u = @t;
+
+ It create new structure whose field names are identical to the old and
+ copies the field values to the new structure. If any of the values are
+ objects that are passed by reference, then only the references will be
+ copied. In other words,
+
+ t = struct{a};
+ t.a = 1:10;
+ u = @t;
+
+ will produce a structure u that references the same array as t.
+
+ 13.2. Accessing the Fields of a Structure
+
+ The dot (.) operator is used to specify the particular field of
+ structure. If s is a structure and field_name is a field of the
+ structure, then s.field_name specifies that field of s. This
+ specification can be used in expressions just like ordinary variables.
+ Again, consider
+
+ t = struct { city_name, population, next };
+
+ described in the last section. Then,
+
+ t.city_name = "New York";
+ t.population = 13000000;
+ if (t.population > 200) t = t.next;
+
+ are all valid statements involving the fields of t.
+
+ 13.3. Linked Lists
+
+ One of the most important uses of structures is the creation of
+ dynamic data structures such as linked-lists. A linked-list is simply
+ a chain of structures that are linked together such that one structure
+ in the chain is the value of a field of the previous structure in the
+ chain. To be concrete, consider the structure discussed earlier:
+
+ t = struct { city_name, population, next };
+
+ and suppose that it is desired to create a linked-list of such objects
+ to store population data. The purpose of the next field is to provide
+ the link to the next structure in the chain. Suppose that there exists
+ a function, read_next_city, that reads city names and populations from
+ a file. Then the list may be created using:
+
+ define create_population_list ()
+ {
+ variable city_name, population, list_root, list_tail;
+ variable next;
+
+ list_root = NULL;
+ while (read_next_city (&city_name, &population))
+ {
+ next = struct {city_name, population, next };
+
+ next.city_name = city_name;
+ next.population = population;
+ next.next = NULL;
+
+ if (list_root == NULL)
+ list_root = next;
+ else
+ list_tail.next = next;
+
+ list_tail = next;
+ }
+ return list_root;
+ }
+
+ In this function, the variables list_root and list_tail represent the
+ beginning and end of the list, respectively. As long as read_next_city
+ returns a non-zero value, a new structure is created, initialized, and
+ then appended to the list via the next field of the list_tail struc-
+ ture. On the first time through the loop, the list is created via the
+ assignment to the list_root variable.
+
+ This function may be used as follows:
+
+ Population_List = create_population_list ();
+ if (Population_List == NULL)
+ throw RunTimeError, "List is empty";
+
+ Other functions may be created that manipulate the list. Here is one
+ that finds the city with the largest population:
+
+ define get_largest_city (list)
+ {
+ variable largest;
+
+ largest = list;
+ while (list != NULL)
+ {
+ if (list.population > largest.population)
+ largest = list;
+ list = list.next;
+ }
+ return largest.city_name;
+ }
+
+ vmessage ("%s is the largest city in the list",
+ get_largest_city (Population_List));
+
+ The get_largest_city is a typical example of how one traverses a lin-
+ ear linked-list by starting at the head of the list and successively
+ moves to the next element of the list via the next field.
+
+ In the previous example, a while loop was used to traverse the linked
+ list. It is also possible to use a foreach loop for this:
+
+ define get_largest_city (list)
+ {
+ variable largest, elem;
+
+ largest = list;
+ foreach elem (list)
+ {
+ if (elem.population > largest.population)
+ largest = elem;
+ }
+ return largest.city_name;
+ }
+
+ Here a foreach loop has been used to walk the list via its next field.
+ If the field name linking the elements was not called next, then it
+ would have been necessary to use the using form of the foreach state-
+ ment. For example, if the field name implementing the linked list was
+ next_item, then
+
+ foreach item (list) using ("next_item")
+ {
+ .
+ .
+ }
+
+ would have been used. In other words, unless otherwise indicated via
+ the using clause, foreach walks the list using a field named next by
+ default.
+
+ Now consider a function that sorts the list according to population.
+ To illustrate the technique, a bubble-sort will be used, not because
+ it is efficient (it is not), but because it is simple, intuitive, and
+ provides another example of structure manipulation:
+
+ define sort_population_list (list)
+ {
+ variable changed;
+ variable node, next_node, last_node;
+ do
+ {
+ changed = 0;
+ node = list;
+ next_node = node.next;
+ last_node = NULL;
+ while (next_node != NULL)
+ {
+ if (node.population < next_node.population)
+ {
+ % swap node and next_node
+ node.next = next_node.next;
+ next_node.next = node;
+ if (last_node != NULL)
+ last_node.next = next_node;
+
+ if (list == node) list = next_node;
+ node = next_node;
+ next_node = node.next;
+ changed++;
+ }
+ last_node = node;
+ node = next_node;
+ next_node = next_node.next;
+ }
+ }
+ while (changed);
+
+ return list;
+ }
+
+ Note the test for equality between list and node, i.e.,
+
+ if (list == node) list = next_node;
+
+ It is important to appreciate the fact that the values of these vari-
+ ables are references to structures, and that the comparison only com-
+ pares the references and not the actual structures they reference. If
+ it were not for this, the algorithm would fail.
+
+ 13.4. Defining New Types
+
+ A user-defined data type may be defined using the typedef keyword. In
+ the current implementation, a user-defined data type is essentially a
+ structure with a user-defined set of fields. For example, in the
+ previous section a structure was used to represent a city/population
+ pair. We can define a data type called Population_Type to represent
+ the same information:
+
+ typedef struct
+ {
+ city_name,
+ population
+ } Population_Type;
+
+ This data type can be used like all other data types. For example, an
+ array of Population_Type types can be created,
+
+ variable a = Population_Type10;
+
+ and `populated' via expressions such as
+
+ a0.city_name = "Boston";
+ a0.population = 2500000;
+
+ The new type Population_Type may also be used with the typeof func-
+ tion:
+
+ if (Population_Type == typeof (a))
+ city = a.city_name;
+
+ The dereference @ may be used to create an instance of the new type:
+
+ a = @Population_Type;
+ a.city_name = "Calcutta";
+ a.population = 13000000;
+
+ Another feature that user-defined types possess is that the action of
+ the binary and unary operations may be defined for them. This idea is
+ discussed in more detail below.
+
+ 13.5. Operator Overloading
+
+ The binary and unary operators may be extended to user-defined types.
+ To illustrate how this works, consider a data type that represents a
+ vector in 3-space:
+
+ typedef struct { x, y, z } Vector_Type;
+
+ and a function that instantiates such an object:
+
+ define vector_new (x, y, z)
+ {
+ variable v = @Vector_Type;
+ v.x = double(x); v.y = double(y); v.z = double(z);
+ return v;
+ }
+
+ This function may be used to define a function that adds two vectors
+ together:
+
+ define vector_add (v1, v2)
+ {
+ return vector_new (v1.x+v2.x, v1.y+v2.y, v1.z+v2.z);
+ }
+
+ Using these functions, three vectors representing the points (2,3,4),
+ (6,2,1), and (-3,1,-6) may be created using
+
+ V1 = vector_new (2,3,4);
+ V2 = vector_new (6,2,1);
+ V3 = vector_new (-3,1,-6);
+
+ and then added together via
+
+ V4 = vector_add (V1, vector_add (V2, V3));
+
+ The problem with the last statement is that it is not a very natural
+ way to express the addition of three vectors. It would be far better
+ to extend the action of the binary + operator to the Vector_Type
+ objects and then write the above sum more simply as
+
+ V4 = V1 + V2 + V3;
+
+ The __add_binary function defines the result of a binary operation
+ between two data types:
+
+ __add_binary (op, result-type, funct, typeA,typeB);
+
+ Here, op is a string representing any one of the binary operators
+ ("+", "-", "*", "/", "==",...), and funct is reference to a function
+ that carries out the binary operation between objects of types typeA
+ and typeB to produce an object of type result-type.
+
+ This function may be used to extend the + operator to Vector_Type
+ objects:
+
+ __add_binary ("+", Vector_Type, &vector_add, Vector_Type, Vector_Type);
+
+ Similarly the subtraction and equality operators may be extended to
+ Vector_Type via
+
+ define vector_minus (v1, v2)
+ {
+ return vector_new (v1.x-v2.x, v1.y-v2.y, v1.z-v2.z);
+ }
+ __add_binary ("-", Vector_Type, &vector_minus, Vector_Type, Vector_Type);
+
+ define vector_eqs (v1, v2)
+ {
+ return (v1.x==v2.x) and (v1.y==v2.y) and (v1.z==v2.z);
+ }
+ __add_binary ("==", Char_Type, &vector_eqs, Vector_Type, Vector_Type);
+
+ permitting a statement such as
+
+ if (V2 != V1) V3 = V2 - V1;
+
+ The - operator is also an unary operator that is customarily used to
+ change the sign of an object. Unary operations may be extended to Vec-
+ tor_Type objects using the __add_unary function:
+
+ define vector_chs (v)
+ {
+ return vector_new (-v.x, -v.y, -v.z);
+ }
+ __add_unary ("-", Vector_Type, &vector_chs, Vector_Type);
+
+ A trivial example of the use of the unary minus is V4 = -V2.
+
+ It is interesting to consider the extension of the multiplication
+ operator * to Vector_Type. A vector may be multiplied by a scalar to
+ produce another vector. This can happen in two ways as reflected by
+ the following functions:
+
+ define vector_scalar_mul (v, a)
+ {
+ return vector_new (a*v.x, a*v.y, a*v.z);
+ }
+ define scalar_vector_mul (a, v)
+ {
+ return vector_new (a*v.x, a*v.y, a*v.z);
+ }
+
+ Here a represents the scalar, which can be any object that may be mul-
+ tiplied by a Double_Type, e.g., Int_Type, Float_Type, etc. Instead of
+ using multiple statements involving __add_binary to define the action
+ of Int_Type+Vector_Type, Float_Type+Vector_Type, etc, a single state-
+ ment using Any_Type to represent a ``wildcard'' type may be used:
+
+ __add_binary ("*", Vector_Type, &vector_scalar_mul, Vector_Type, Any_Type);
+ __add_binary ("*", Vector_Type, &scalar_vector_mul, Any_Type, Vector_Type);
+
+ There are a couple of natural possibilities for Vector_Type*Vec-
+ tor_Type: The cross-product defined by
+
+ define crossprod (v1, v2)
+ {
+ return vector_new (v1.y*v2.z-v1.z*v2.y,
+ v1.z*v2.x-v1.x*v2.z,
+ v1.x*v2.y-v1.y*v2.x);
+ }
+
+ and the dot-product:
+
+ define dotprod (v1, v2)
+ {
+ return v1.x*v2.x + v1.y*v2.y + v1.z*v2.z;
+ }
+
+ The binary * operator between two vector types may be defined to be
+ just one of these functions--- it cannot be extended to both. If the
+ dot-product is chosen then one would use
+
+ __add_binary ("*", Double_Type, &dotprod, Vector_Type_Type, Vector_Type);
+
+ Just because it is possible to define the action of a binary or unary
+ operator on an user-defined type, it is not always wise to do so. A
+ useful rule of thumb is to ask whether defining a particular operation
+ leads to more readable and maintainable code. For example, simply
+ looking at
+
+ c = a + b;
+
+ in isolation one can easily overlook the fact that a function such as
+ vector_add may be getting executed. Moreover, in cases where the
+ action is ambiguous such as Vector_Type*Vector_Type it may not be
+ clear what
+
+ c = a*b;
+
+ means unless one knows exactly what choice was made when extending the
+ * operator to the types. For this reason it may be wise to leave Vec-
+ tor_Type*Vector_Type undefined and use ``old-fashioned'' function
+ calls such as
+
+ c = dotprod (a, b);
+ d = crossprod (a, b);
+
+ to avoid the ambiguity altogether.
+
+ Finally, the __add_string function may be used to define the string
+ representation of an object. Examples involving the string
+ representation include:
+
+ message ("The value is " + string (V));
+ vmessage ("The result of %S+%S is %S", V1, V1, V1+V2);
+ str = "The value of V is $V"$;
+
+ For the Vector_Type one might want to use the string represention gen-
+ erated by
+
+ define vector_string (v)
+ {
+ return sprintf ("(%S,%S,%S)", v.x, v.y, v.z);
+ }
+ __add_string (Vector_Type, &vector_string);
+
+ 14. Lists
+
+ Sometimes it is desirable to utilize an object that has many of the
+ properties of an array, but can also easily grow or shrink upon
+ demand. The List_Type object has such properties.
+
+ An empty list may be created either by the list_new function or more
+ simply using curly braces, e.g.,
+
+ list = {};
+
+ More generally a list of objects may be created by simply enclosing
+ them in braces. For example,
+
+ list = { "hello", 7, 3.14, {&sin, &cos}}
+
+ specifies a list of 4 elements, where the last element is also a list.
+ The number of items in a list may be obtained using the length func-
+ tion. For the above list, length(list) will return 4.
+
+ One may examine the contents of the list using an array index
+ notation. For the above example, list0 refers to the zeroth element
+ of the list ("hello" in this case). Similarly,
+
+ list1 = 1,2,3;
+
+ changes the first element of the list (7) to the array 1,2,3. Also
+ as the case for arrays one may index from the end of the list using
+ negative indices, e.g., list-1 refers to the last element of the
+ list.
+
+ The functions list_insert and list_append may be used to add items to
+ a list. In particular, list_insert(list,obj,nth) will insert the
+ object obj into the list at the nth position. Similarly,
+ list_append(list,obj,nth) will insert the object obj into the list
+ right after nth position. If
+
+ list = { "hello", 7, 3.14, {&sin, &cos}}
+
+ then
+
+ list_insert (list, 0, "hi");
+ list_append (list, 0, "there");
+ list_insert (list, -1, "before");
+ list_append (list, -1, "after");
+
+ will result in the list
+
+ {"hi", "there", "hello", 7, 3.14, "before", {&sin,&cos}, "after"}
+
+ One might be tempted to use
+
+ list = {"hi", list};
+
+ to insert "hi" at the head of the list. However, this simply creates a
+ new list of two items: hi and the original list.
+
+ Items may be removed from a list via the list_delete function, which
+ deletes the item from the specified position and shrinks the list. In
+ the context of the above example,
+
+ list_delete (list, 2);
+
+ will shrink the list to
+
+ {"hi", "there", 7, 3.14, "before", {&sin,&cos}, "after"}
+
+ Another way of removing items from the list is to use the list_pop
+ function. The main difference between it and list_delete is that
+ list_pop returns the deleted item. For example,
+
+ item = list_pop (list, -2);
+
+ would reduce the list to
+
+ {"hi", "there", 7, 3.14, "before", "after"}
+
+ and assign {&sin,&cos} to item. If the position parameter to list_pop
+ is left unspecified, then the position will default to the zeroth,
+ i.e., list_pop(list) is equaivalent to list_pop(list,0).
+
+ To copy a list, use the dereference operator @:
+
+ new_list = @list;
+
+ Keep in mind that this does not perform a so-called deep copy. If any
+ of the elements of the list are objects that are assigned by refer-
+ ence, only the references will be copied.
+
+ The list_reverse function may be used to reverse the elements of a
+ list. Note that this does not create a new list. To create new list
+ that is the reverse of another, copy the original using the
+ dereference operator (@) and reverse that, i.e.,
+
+ new_list = list_reverse (@list);
+
+ 15. Error Handling
+
+ All non-trivial programs or scripts must be deal with the possibility
+ of run-time errors. In fact, one sign of a seasoned programmer is that
+ such a person pays particular attention to error handling. This
+ chapter presents some techniques for handling errors using S-Lang.
+ First the traditional method of using return values to indicate errors
+ will be discussed. Then attention will turn to S-Lang's more powerful
+ exception handling mechanisms.
+
+ 15.1. Traditional Error Handling
+
+ The simplist and perhaps most common mechanism for signaling a failure
+ or error in a function is for the function to return an error code,
+ e.g.,
+
+ define write_to_file (file, str)
+ {
+ variable fp = fopen (file, "w");
+ if (fp == NULL)
+ return -1;
+ if (-1 == fputs (str, fp))
+ return -1;
+ if (-1 == fclose (fp))
+ return -1;
+ return 0;
+ }
+
+ Here, the write_to_file function returns 0 if successful, or -1 upon
+ failure. It is up to the calling routine to check the return value of
+ write_to_file and act accordingly. For instance:
+
+ if (-1 == write_to_file ("/tmp/foo", "bar"))
+ {
+ () = fprintf (stderr, "Write failed\n");
+ exit (1);
+ }
+
+ The main advantage of this technique is in its simplicity. The
+ weakness in this approach is that the return value must be checked for
+ every function that returns information in this way. A more subtle
+ problem is that even minor changes to large programs can become
+ unwieldy. To illustrate the latter aspect, consider the following
+ function which is supposed to be so simple that it cannot fail:
+
+ define simple_function ()
+ {
+ do_something_simple ();
+ more_simple_stuff ();
+ }
+
+ Since the functions called by simple_function are not supposed to
+ fail, simple_function itself cannot fail and there is no return value
+ for its callers to check:
+
+ define simple ()
+ {
+ simple_function ();
+ another_simple_function ();
+ }
+
+ Now suppose that the function do_something_simple is changed in some
+ way that could cause it to fail from time to time. Such a change could
+ be the result of a bug-fix or some feature enhancement. In the tradi-
+ tional error handling approach, the function would need to be modified
+ to return an error code. That error code would have to be checked by
+ the calling routine simple_function and as a result, it can now fail
+ and must return an error code. The obvious effect is that a tiny
+ change in one function can be felt up the entire call chain. While
+ making the appropriate changes for a small program can be a trivial
+ task, for a large program this could be a major undertaking opening
+ the possibility of introducing additional errors along the way. In a
+ nutshell, this is a code maintenance issue. For this reason, a veteran
+ programmer using this approach to error handling will consider such
+ possibilities from the outset and allow for error codes the first time
+ regardless of whether the functions can fail or not, e.g.,
+
+ define simple_function ()
+ {
+ if (-1 == do_something_simple ())
+ return -1;
+ if (-1 == more_simple_stuff ())
+ return -1;
+ return 0;
+ }
+ define simple ()
+ {
+ if (-1 == simple_function ())
+ return -1;
+ if (-1 == another_simple_function ())
+ return -1;
+ return 0;
+ }
+
+ Although latter code containing explicit checks for failure is more
+ robust and more easily maintainable than the former, it is also less
+ readable. Moreover, since return values are now checked the code will
+ execute somewhat slower than the code that lacks such checks. There
+ is also no clean separation of the error handling code from the other
+ code. This can make it difficult to maintain if the error handling
+ semantics of a function change. The next section discusses another
+ approach to error handling that tries to address these issues.
+
+ 15.2. Error Handling through Exceptions
+
+ This section describes S-Lang's exception model. The idea is that
+ when a function encounters an error, instead of returning an error
+ code, it simply gives up and throws an exception. This idea will be
+ fleshed out in what follows.
+
+ 15.2.1. Introduction to Exceptions
+
+ Consider the write_to_file function used in the previous section but
+ adapted to throw an exception:
+
+ define write_to_file (file, str)
+ {
+ variable fp = fopen (file, "w");
+ if (fp == NULL)
+ throw OpenError;
+ if (-1 == fputs (str, fp))
+ throw WriteError;
+ if (-1 == fclose (fp))
+ throw WriteError;
+ }
+
+ Here the throw statement has been used to generate the appropriate
+ exception, which in this case is either an OpenError exception or a
+ WriteError exception. Since the function now returns nothing (no error
+ code), it may be called as
+
+ write_to_file ("/tmp/foo", "bar");
+ next_statement;
+
+ As long as the write_to_file function encounters no errors, control
+ passes from write_to_file to next_statement.
+
+ Now consider what happens when the function encounters an error. For
+ concreteness assume that the fopen function failed causing
+ write_to_file to throw the OpenError exception. The write_to_file
+ function will stop execution after executing the throw statement and
+ return to its caller. Since no provision has been made to handle the
+ exception, next_statement will not execute and control will pass to
+ the previous caller on the call stack. This process will continue
+ until the exception is either handled or until control reaches the
+ top-level at which point the interpreter will terminate. This process
+ is known as unwinding of the call stack.
+
+ An simple exception handler may be created through the use of a try-
+ catch statement, such as
+
+ try
+ {
+ write_to_file ("/tmp/foo", "bar");
+ }
+ catch OpenError:
+ {
+ message ("*** Warning: failed to open /tmp/foo.");
+ }
+ next_statement;
+
+ The above code works as follows: First the statement (or statements)
+ inside the try-block are executed. As long as no exception occurs,
+ once they have executed, control will pass on to next_statement, skip-
+ ping the catch statement(s).
+
+ If an exception occurs while executing the statements in the try-
+ block, any remaining statements in the block will be skipped and
+ control will pass to the ``catch'' portion of the exception handler.
+ This may consist of one or more catch statements and an optional
+ finally statement. Each catch statement specifies a list of exceptions
+ it will handle as well as the code that is to be excecuted when a
+ matching exception is caught. If a matching catch statement is found
+ for the exception, the exception will be cleared and the code
+ associated with the catch statement will get executed. Control will
+ then pass to next_statement (or first to the code in an optional
+ finally block).
+
+ Catch-statements are tested against the exception in the order that
+ they appear. Once a matching catch statement is found, the search will
+ terminate. If no matching catch-statement is found, an optional
+ finally block will be processed, and the call-stack will continue to
+ unwind until either a matching exception handler is found or the
+ interpreter terminates.
+
+ In the above example, an exception handler was established for the
+ OpenError exception. The error handling code for this exception will
+ cause a warning message to be displayed. Execution will resume at
+ next_statement.
+
+ Now suppose that write_to_file successfully opened the file, but that
+ for some reason, e.g., a full disk, the actual write operation failed.
+ In such a case, write_to_file will throw a WriteError exception
+ passing control to the caller. The file will remain on the disk but
+ not fully written. An exception handler can be added for WriteError
+ that removes the file:
+
+ try
+ {
+ write_to_file ("/tmp/foo", "bar");
+ }
+ catch OpenError:
+ {
+ message ("*** Warning: failed to open /tmp/foo.");
+ }
+ catch WriteError:
+ {
+ () = remove ("/tmp/foo");
+ message ("*** Warning: failed to write to /tmp/foo");
+ }
+ next_statement;
+
+ Here the exception handler for WriteError uses the remove intrinsic
+ function to delete the file and then issues a warning message. Note
+ that the remove intrinsic uses the traditional error handling mecha-
+ nism--- in the above example its return status has been discarded.
+
+ Above it was assumed that failure to write to the file was not
+ critical allowing a warning message to suffice upon failure. Now
+ suppose that it is important for the file to be written but that it is
+ still desirable for the file to be removed upon failure. In this
+ scenario, next_statement should not get executed upon failure. This
+ can be achieved as follows:
+
+ try
+ {
+ write_to_file ("/tmp/foo", "bar");
+ }
+ catch WriteError:
+ {
+ () = remove ("/tmp/foo");
+ throw WriteError;
+ }
+ next_statement;
+
+ Here the exception handler for WriteError removes the file and then
+ re-throws the exception.
+
+ 15.2.2. Obtaining information about the exception
+
+ When an exception is generated, an exception object is thrown. The
+ object is a structure containing the following fields:
+
+ error
+ The exception error code (Int_Type).
+
+ descr
+ A brief description of the error (String_Type).
+
+ file
+ The filename containing the code that generated the exception
+ (String_Type).
+
+ line
+ The line number where the exception was thrown (Int_Type).
+
+ function
+ The name of the currently executing function, or NULL if at top-
+ level (String_Type).
+
+ message
+ A text message that may provide more information about the
+ exception (String_Type).
+
+ object
+ A user-defined object.
+
+ If it is desired to have information about the exception, then an
+ alternative form of the try statement must be used:
+
+ try (e)
+ {
+ % try-block code
+ }
+ catch SomeException: { code ... }
+
+ If an exception occurs while executing the code in the try-block, then
+ the variable e will be assigned the value of the exception object. As
+ a simple example, suppose that the file foo.sl consists of:
+
+ define invert_x (x)
+ {
+ if (x == 0)
+ throw DivideByZeroError;
+ return 1/x;
+ }
+
+ and that the code is called using
+
+ try (e)
+ {
+ y = invert_x (0);
+ }
+ catch DivideByZeroError:
+ {
+ vmessage ("Caught %s, generated by %s:%d\n",
+ e.descr, e.file, e.line);
+ vmessage ("message: %s\nobject: %S\n",
+ e.message, e.object);
+ y = 0;
+ }
+
+ When this code is executed, it will generate the message:
+
+ Caught Divide by Zero, generated by foo.sl:5
+ message: Divide by Zero
+ object: NULL
+
+ In this case, the value of the message field was assigned a default
+ value. The reason that the object field is NULL is that no object was
+ specified when the exception was generated. In order to throw an
+ object, a more complex form of throw statement must be used:
+
+ throw exception-name , message , object 
+
+ where the square brackets indicate optional parameters
+
+ To illustrate this form, suppose that invert_x is modified to accept
+ an array object:
+
+ private define invert_x(x)
+ {
+ variable i = where (x == 0);
+ if (length (i))
+ throw DivideByZeroError,
+ "Array contains elements that are zero", i;
+ return 1/x;
+ }
+
+ In this case, the message field of the exception will contain the
+ string "Array contains elements that are zero" and the object field
+ will be set to the indices of the zero elements.
+
+ 15.2.3. The finally block
+
+ The full form of the try-catch statement obeys the following syntax:
+
+ try (opt-e) { try-block-statements } catch Exception-List-1: {
+ catch-block-1-statements } . . catch Exception-List-N: { catch-
+ block-N-statements } finally { finally-block-statements } 
+
+ Here an exception-list is simply a list of exceptions such as:
+
+ catch OSError, RunTimeError:
+
+ The last clause of a try-statement is the finally-block, which is
+ optional and is introduced using the finally keyword. If the try-
+ statement contains no catch-clauses, then it must specify a finally-
+ clause, otherwise a syntax error will result.
+
+ If the finally-clause is present, then its corresponding statements
+ will be executed regardless of whether an exception occurs. If an
+ exception occurs while executing the statements in the try-block, then
+ the finally-block will execute after the code in any of the catch-
+ blocks. The finally-clause is useful for freeing any resources (file
+ handles, etc) allocated by the try-block regardless of whether an
+ exception has occurred.
+
+ 15.2.4. Creating new exceptions: the Exception Hierarchy
+
+ The following table gives the class hierarchy for the built-in
+ exceptions.
+
+ AnyError
+ OSError
+ MallocError
+ ImportError
+ ParseError
+ SyntaxError
+ DuplicateDefinitionError
+ UndefinedNameError
+ RunTimeError
+ InvalidParmError
+ TypeMismatchError
+ UserBreakError
+ StackError
+ StackOverflowError
+ StackUnderflowError
+ ReadOnlyError
+ VariableUninitializedError
+ NumArgsError
+ IndexError
+ UsageError
+ ApplicationError
+ InternalError
+ NotImplementedError
+ LimitExceededError
+ MathError
+ DivideByZeroError
+ ArithOverflowError
+ ArithUnderflowError
+ DomainError
+ IOError
+ WriteError
+ ReadError
+ OpenError
+ DataError
+ UnicodeError
+ InvalidUTF8Error
+ UnknownError
+
+ The above table shows that the root class of all exceptions is
+ AnyError. This means that a catch block for AnyError will catch any
+ exception. The OSError, ParseError, and RunTimeError exceptions are
+ subclasses of the AnyError class. Subclasses of OSError include
+ MallocError, and ImportError. Hence a handler for the OSError
+ exception will catch MallocError but not ParseError since the latter
+ is not a subclass of OSError.
+
+ The user may extend this tree with new exceptions using the
+ new_exception function. This function takes three arguments:
+
+ new_exception (exception-name, baseclass, description);
+
+ The exception-name is the name of the exception, baseclass represents
+ the node in the exception hierarchy where it is to be placed, and
+ description is a string that provides a brief description of the
+ exception.
+
+ For example, suppose that you are writing some code that processes
+ numbers stored in a binary format. In particular, assume that the
+ format specifies that data be stored in a specific byte-order, e.g.,
+ in big-endian form. Then it might be useful to extend the DataError
+ exception with EndianError. This is easily accomplished via
+
+ new_exception ("EndianError", DataError, "Invalid byte-ordering");
+
+ This will create a new exception object called EndianError subclassed
+ on DataError, and code that catches the DataError exception will addi-
+ tionally catch the EndianError exception.
+
+ 16. Loading Files: evalfile, autoload, and require
+
+ 17. Modules
+
+ 17.1. Introduction
+
+ A module is a shared object that may be dynamically linked into the
+ interpreter at run-time to provide the interpreter with additional
+ intrinsic functions and variables. Several modules are distributed
+ with the stock version of the S-Lang library, including a pcre module
+ that allows the interpreter to make use of the Perl Compatible Regular
+ Expression library, a png module that allows the interpreter to easily
+ read and write PNG files, and a rand module for producing random
+ numbers. There are also a number of modules for the interpreter that
+ are not distributed with the library. See
+ http://www.jedsoft.org/slang/modules/ for links to some of those.
+
+ 17.2. Using Modules
+
+ In order to make use of a module, it must first be ``imported'' into
+ the interpreter. There are two ways to go about this. One is to use
+ the import function to dynamically link-in the specified module, e.g.,
+
+ import ("pcre");
+
+ will dynamically link to the pcre module and make its symbols avail-
+ able to the interpreter using the active namespace. However, this is
+ not the preferred method for loading a module.
+
+ Module writers are encouraged to distribute a module with a file of S-
+ Lang code that performs the actual import of the module. Rather than a
+ user making direct use of the import function, the preferred method of
+ loading the modules is to load that file instead. For example the pcre
+ module is distributed with a file called pcre.sl that contains little
+ more than the import("pcre") statement. To use the pcre module, load
+ pcre.sl, e.g.,
+
+ require ("pcre");
+
+ The main advantage of this approach to loading a module is that the
+ functionality provided by the module may be split between intrinsic
+ functions in the module proper, and interpreted functions contained in
+ the .sl file. In such a case, loading the module via import would only
+ provide partial functionality. The png module provides a simple
+ example of this concept. The current version of the png module
+ consists of a couple intrinsic functions (png_read and png_write)
+ contained in the shared object (png-module.so), and a number of other
+ interpreted S-Lang functions defined in png.sl. Using the import
+ statement to load the module would miss the latter set of functions.
+
+ In some cases, the symbols in a module may conflict with symbols that
+ are currently defined by the interpreter. In order to avoid the
+ conflict, it may be necessary to load the module into its own
+ namespace and access its symbols via the namespace prefix. For
+ example, the GNU Scientific Library Special Function module, gslsf,
+ defines a couple hundred functions, some with common names such as
+ zeta. In order to avoid any conflict, it is recommended that the
+ symbols from such a module be imported into a separate namespace. This
+ may be accomplished by specifying the namespace as a second argument
+ to the require function, e.g.,
+
+ require ("gslsf", "gsl");
+ .
+ .
+ y = gsl->zeta(x);
+
+ This form requires that the module's symbols be accessed via the
+ namespace qualifier "gsl->".
+
+ 18. File Input/Output
+
+ S-Lang provides built-in support for two different I/O facilities.
+ The simplest interface is modeled upon the C language stdio interface
+ and consists of functions such as fopen, fgets, etc. The other
+ interface is modeled on a lower level POSIX interface consisting of
+ functions such as open, read, etc. In addition to permitting more
+ control, the lower level interface permits one to access network
+ objects as well as disk files.
+
+ For reading data formatted in text files, e.g., columns of numbers,
+ then do not overlook the high-level routines in the slsh library. In
+ particular, the readascii function is quite flexible and can read data
+ from text files that are formatted in a variety of ways. For data
+ stored in a standard binary format such as HDF or FITS, then the
+ corresponding modules should be used.
+
+ 18.1. Input/Output via stdio
+
+ 18.1.1. Stdio Overview
+
+ The stdio interface consists of the following functions:
+
+ o fopen: opens a file for reading or writing.
+
+ o fclose: closes a file opened by fopen.
+
+ o fgets: reads a line from a file.
+
+ o fputs: writes text to a file.
+
+ o fprintf: writes formatted text to a file.
+
+ o fwrite: writes one of more objects to a file.
+
+ o fread: reads a specified number of objects from a file.
+
+ o fread_bytes: reads a specified number of bytes from a file and
+ returns them as a string.
+
+ o feof: tests if a file pointer is at the end of the file.
+
+ o ferror: tests whether or not the stream associated with a file has
+ an error.
+
+ o clearerr: clears the end-of-file and error indicators for a stream.
+
+ o fflush, forces all buffered data associated with a stream to be
+ written out.
+
+ o ftell: queries the file position indicator a the stream.
+
+ o fseek: sets the position of a file position indicator of the
+ stream.
+
+ o fgetslines: reads all the lines from a text file and returns them
+ as an array of strings.
+
+ In addition, the interface supports the popen and pclose functions on
+ systems where the corresponding C functions are available.
+
+ Before reading or writing to a file, it must first be opened using the
+ fopen function. The only exceptions to this rule involve use of the
+ pre-opened streams: stdin, stdout, and stderr. fopen accepts two
+ arguments: a file name and a string argument that indicates how the
+ file is to be opened, e.g., for reading, writing, update, etc. It
+ returns a File_Type stream object that is used as an argument to all
+ other functions of the stdio interface. Upon failure, it returns NULL.
+ See the reference manual for more information about fopen.
+
+ 18.1.2. Stdio Examples
+
+ In this section, some simple examples of the use of the stdio
+ interface is presented. It is important to realize that all the
+ functions of the interface return something, and that return value
+ must be handled in some way by the caller.
+
+ The first example involves writing a function to count the number of
+ lines in a text file. To do this, we shall read in the lines, one by
+ one, and count them:
+
+ define count_lines_in_file (file)
+ {
+ variable fp, line, count;
+
+ fp = fopen (file, "r"); % Open the file for reading
+ if (fp == NULL)
+ throw OpenError, "$file failed to open"$;
+
+ count = 0;
+ while (-1 != fgets (&line, fp))
+ count++;
+
+ () = fclose (fp);
+ return count;
+ }
+
+ Note that &line was passed to the fgets function. When fgets returns,
+ line will contain the line of text read in from the file. Also note
+ how the return value from fclose was handled (discarded in this case).
+
+ Although the preceding example closed the file via fclose, there is no
+ need to explicitly close a file because the interpreter will
+ automatically close a file when it is no longer referenced. Since the
+ only variable to reference the file is fp, it would have automatically
+ been closed when the function returned.
+
+ Suppose that it is desired to count the number of characters in the
+ file instead of the number of lines. To do this, the while loop could
+ be modified to count the characters as follows:
+
+ while (-1 != fgets (&line, fp))
+ count += strlen (line);
+
+ The main difficulty with this approach is that it will not work for
+ binary files, i.e., files that contain null characters. For such
+ files, the file should be opened in binary mode via
+
+ fp = fopen (file, "rb");
+
+ and then the data read using the fread function:
+
+ while (-1 != fread (&line, Char_Type, 1024, fp))
+ count += length (line);
+
+ The fread function requires two additional arguments: the type of
+ object to read (Char_Type in the case), and the number of such objects
+ to be read. The function returns the number of objects actually read
+ in the form of an array of the specified type, or -1 upon failure.
+
+ Sometimes it is more convenient to obtain the data from a file in the
+ form of a character string instead of an array of characters. The
+ fread_bytes function may be used in such situations. Using this
+ function, the equivalent of the above loop is
+
+ while (-1 != fread_bytes (&line, 1024, fp))
+ count += bstrlen (line);
+
+ The foreach construct also works with File_Type objects. For example,
+ the number of characters in a file may be counted via
+
+ foreach ch (fp) using ("char")
+ count++;
+
+ Similarly, one can count the number of lines using:
+
+ foreach line (fp) using ("line")
+ {
+ num_lines++;
+ count += strlen (line);
+ }
+
+ Often one is not interested in trailing whitespace in the lines of a
+ file. To have trailing whitespace automatically stripped from the
+ lines as they are read in, use the "wsline" form, e.g.,
+
+ foreach line (fp) using ("wsline")
+ {
+ .
+ .
+ }
+
+ Finally, it should be mentioned that none of these examples should be
+ used to count the number of bytes in a file when that information is
+ more readily accessible by another means. For example, it is
+ preferable to get this information via the stat_file function:
+
+ define count_chars_in_file (file)
+ {
+ variable st;
+
+ st = stat_file (file);
+ if (st == NULL)
+ throw IOError, "stat_file failed";
+ return st.st_size;
+ }
+
+ 18.2. POSIX I/O
+
+ 18.3. Advanced I/O techniques
+
+ The previous examples illustrate how to read and write objects of a
+ single data-type from a file, e.g.,
+
+ num = fread (&a, Double_Type, 20, fp);
+
+ would result in a Double_Typenum array being assigned to a if suc-
+ cessful. However, suppose that the binary data file consists of num-
+ bers in a specified byte-order. How can one read such objects with the
+ proper byte swapping? The answer is to use the fread_bytes function to
+ read the objects as a (binary) character string and then unpack the
+ resulting string into the specified data type, or types. This process
+ is facilitated using the pack and unpack functions.
+
+ The pack function follows the syntax
+
+ BString_Type pack (format-string, item-list);
+
+ and combines the objects in the item-list according to format-string
+ into a binary string and returns the result. Likewise, the unpack
+ function may be used to convert a binary string into separate data
+ objects:
+
+ (variable-list) = unpack (format-string, binary-string);
+
+ The format string consists of one or more data-type specification
+ characters, and each may be followed by an optional decimal length
+ specifier. Specifically, the data-types are specified according to the
+ following table:
+
+ c char
+ C unsigned char
+ h short
+ H unsigned short
+ i int
+ I unsigned int
+ l long
+ L unsigned long
+ j 16 bit int
+ J 16 unsigned int
+ k 32 bit int
+ K 32 bit unsigned int
+ f float
+ d double
+ F 32 bit float
+ D 64 bit float
+ s character string, null padded
+ S character string, space padded
+ z character string, null padded
+ x a null pad character
+
+ A decimal length specifier may follow the data-type specifier. With
+ the exception of the s and S specifiers, the length specifier indi-
+ cates how many objects of that data type are to be packed or unpacked
+ from the string. When used with the s or S specifiers, it indicates
+ the field width to be used. If the length specifier is not present,
+ the length defaults to one.
+
+ With the exception of c, C, s, S, z, and x, each of these may be
+ prefixed by a character that indicates the byte-order of the object:
+
+ > big-endian order (network order)
+ < little-endian order
+ = native byte-order
+
+ The default is to use the native byte order.
+
+ Here are a few examples that should make this more clear:
+
+ a = pack ("cc", 'A', 'B'); % ==> a = "AB";
+ a = pack ("c2", 'A', 'B'); % ==> a = "AB";
+ a = pack ("xxcxxc", 'A', 'B'); % ==> a = "\0\0A\0\0B";
+ a = pack ("h2", 'A', 'B'); % ==> a = "\0A\0B" or "\0B\0A"
+ a = pack (">h2", 'A', 'B'); % ==> a = "\0\xA\0\xB"
+ a = pack ("<h2", 'A', 'B'); % ==> a = "\0B\0A"
+ a = pack ("s4", "AB", "CD"); % ==> a = "AB\0\0"
+ a = pack ("s4s2", "AB", "CD"); % ==> a = "AB\0\0CD"
+ a = pack ("S4", "AB", "CD"); % ==> a = "AB "
+ a = pack ("S4S2", "AB", "CD"); % ==> a = "AB CD"
+
+ When unpacking, if the length specifier is greater than one, then an
+ array of that length will be returned. In addition, trailing
+ whitespace and null characters are stripped when unpacking an object
+ given by the S specifier. Here are a few examples:
+
+ (x,y) = unpack ("cc", "AB"); % ==> x = 'A', y = 'B'
+ x = unpack ("c2", "AB"); % ==> x = 'A', 'B'
+ x = unpack ("x<H", "\0\xAB\xCD"); % ==> x = 0xCDABuh
+ x = unpack ("xxs4", "a b c\0d e f"); % ==> x = "b c\0"
+ x = unpack ("xxS4", "a b c\0d e f"); % ==> x = "b c"
+
+ 18.3.1. Example: Reading /var/log/wtmp
+
+ Consider the task of reading the Unix system file /var/log/utmp, which
+ contains login records about who logged onto the system. This file
+ format is documented in section 5 of the online Unix man pages, and
+ consists of a sequence of entries formatted according to the C
+ structure utmp defined in the utmp.h C header file. The actual details
+ of the structure may vary from one version of Unix to the other. For
+ the purposes of this example, consider its definition under the Linux
+ operating system running on an Intel 32 bit processor:
+
+ struct utmp {
+ short ut_type; /* type of login */
+ pid_t ut_pid; /* pid of process */
+ char ut_line12; /* device name of tty - "/dev/" */
+ char ut_id2; /* init id or abbrev. ttyname */
+ time_t ut_time; /* login time */
+ char ut_user8; /* user name */
+ char ut_host16; /* host name for remote login */
+ long ut_addr; /* IP addr of remote host */
+ };
+
+ On this system, pid_t is defined to be an int and time_t is a long.
+ Hence, a format specifier for the pack and unpack functions is easily
+ constructed to be:
+
+ "h i S12 S2 l S8 S16 l"
+
+ However, this particular definition is naive because it does not allow
+ for structure padding performed by the C compiler in order to align
+ the data types on suitable word boundaries. Fortunately, the intrinsic
+ function pad_pack_format may be used to modify a format by adding the
+ correct amount of padding in the right places. In fact, pad_pack_for-
+ mat applied to the above format on an Intel-based Linux system pro-
+ duces the result:
+
+ "h x2 i S12 S2 x2 l S8 S16 l"
+
+ Here we see that 4 bytes of padding were added.
+
+ The other missing piece of information is the size of the structure.
+ This is useful because we would like to read in one structure at a
+ time using the fread function. Knowing the size of the various data
+ types makes this easy; however it is even easier to use the
+ sizeof_pack intrinsic function, which returns the size (in bytes) of
+ the structure described by the pack format.
+
+ So, with all the pieces in place, it is rather straightforward to
+ write the code:
+
+ variable format, size, fp, buf;
+
+ typedef struct
+ {
+ ut_type, ut_pid, ut_line, ut_id,
+ ut_time, ut_user, ut_host, ut_addr
+ } UTMP_Type;
+
+ format = pad_pack_format ("h i S12 S2 l S8 S16 l");
+ size = sizeof_pack (format);
+
+ define print_utmp (u)
+ {
+
+ () = fprintf (stdout, "%-16s %-12s %-16s %s\n",
+ u.ut_user, u.ut_line, u.ut_host, ctime (u.ut_time));
+ }
+
+ fp = fopen ("/var/log/utmp", "rb");
+ if (fp == NULL)
+ throw OpenError, "Unable to open utmp file";
+
+ () = fprintf (stdout, "%-16s %-12s %-16s %s\n",
+ "USER", "TTY", "FROM", "LOGIN@");
+
+ variable U = @UTMP_Type;
+
+ while (-1 != fread (&buf, Char_Type, size, fp))
+ {
+ set_struct_fields (U, unpack (format, buf));
+ print_utmp (U);
+ }
+
+ () = fclose (fp);
+
+ A few comments about this example are in order. First of all, note
+ that a new data type called UTMP_Type was created, although this was
+ not really necessary. The file was opened in binary mode, but this too
+ was optional because, for example, on a Unix system there is no dis-
+ tinction between binary and text modes. The print_utmp function does
+ not print all of the structure fields. Finally, last but not least,
+ the return values from fprintf and fclose were handled by discarding
+ them.
+
+ 19. slsh
+
+ slsh, also known as the S-Lang shell, is an application that is
+ included in the stock S-Lang distribution. As some binary
+ distributions include slsh as a separate package it must be installed
+ separately, e.g.,
+
+ apt-get install slsh
+
+ on Debian Linux systems. The use of slsh in its interactive mode was
+ discussed briefly in the ``Introduction''. This chapter concentrates
+ on the use of slsh for writing executable S-Lang scripts.
+
+ 19.1. Running slsh
+
+ When run the --help command-line argument, slsh displays a brief usage
+ message:
+
+ # slsh --help
+ Usage: slsh OPTIONS -|file args...
+ --help Print this help
+ --version Show slsh version information
+ -e string Execute 'string' as S-Lang code
+ -g Compile with debugging code, tracebacks, etc
+ -n Don't load personal init file
+ --init file Use this file instead of ~/.slshrc
+ --no-readline Do not use readline
+ -i Force interactive input
+ -t Test mode. If slsh_main exists, do not call it
+ -v Show verbose loading messages
+ -Dname Define "name" as a preprocessor symbol
+
+ Note: - and -i are mutually exclusive
+
+ Default search path: /usr/local/share/slsh
+
+ When started with no arguments, slsh will start in interactive mode
+ and take input from the terminal. As the usage message indicates slsh
+ loads a personal initialization file called .slshrc (on non-Unix
+ systems, this file is called slsh.rc). The contents of this file must
+ be valid S-Lang code, but are otherwise arbitrary. One use of this
+ file is to define commonly used functions and to setup personal search
+ paths.
+
+ slsh will run in non-interactive mode when started with a file (also
+ known as a ``script'') as its first (non-option) command-line
+ argument. The rest of the arguments on the command line serve as
+ arguments for the script. The next section deals with the use of the
+ cmdopt routines for parsing those arguments.
+
+ slsh will read the script and feed it to the S-Lang interpreter for
+ execution. If the script defines a public function called slsh_main,
+ then slsh will call it after the script has been loaded. In this
+ sense, slsh_main is analogous to main in C or C++.
+
+ A typical slsh script is be structured as
+
+ #!/usr/bin/env slsh
+ .
+ .
+ define slsh_main ()
+ {
+ .
+ .
+ }
+
+ The first line of the script Unix-specific and should be familiar to
+ Unix users. Typically, the code before slsh_main will load any
+ required modules or packages, and define other functions to be used by
+ the script.
+
+ Although the use of slsh_main is not required, its use is strongly
+ urged for several reasons. In addition to lending uniformity to S-Lang
+ scripts, slsh_main is well supported by the S-Lang debugger (sldb) and
+ the S-Lang profiler (slprof), which look for slsh_main as a starting
+ point for script execution. Also as scripts necessarily do something
+ (otherwise they have no use), slsh's -t command-line option may be
+ used to turn off the automatic execution of slsh_main. This allows the
+ syntax of the entire script to be checked for errors instead of
+ running it.
+
+ 19.2. Command line processing
+
+ The script's command-line arguments are availble to it via the __argc
+ and __argv intrinsic variables. Any optional arguments represented by
+ these variables may be parsed using slsh's cmdopt routines.
+
+ As a useful illustration, consider the script that the author uses to
+ rip tracks from CDs to OGG encoded files. The name of the script is
+ cd2ogg.sl. Running the script without arguments causes it to issue a
+ usage message:
+
+ Usage: cd2ogg.sl options device
+ Options:
+ --help This help
+ --work DIR Use DIR as working dir /tmp/29848
+ --root DIR Use DIR/GENRE as root for final output /data/CDs
+ --genre GENRE Use GENRE for output dir
+ --no-rip Skip rip stage
+ --no-normalize Skip normalizing stage
+ --no-encode Don't encode to ogg
+ --albuminfo PERFORMER/TITLE
+ Use PERFORMER/TITLE if audio.cddb is absent
+
+ As the message shows, some of the options require an argument while
+ others do not. The cd2ogg.sl script looks like:
+
+ #!/usr/bin/env slsh
+ require ("cmdopt");
+ .
+ .
+ private define exit_usage ()
+ {
+ () = fprintf (stderr, "Usage: %s options device\n",
+ path_basename (__argv0));
+ () = fprintf (stderr, "Options:\n");
+ .
+ .
+ exit (1);
+ }
+
+ private define parse_album_info (albuminfo)
+ {
+ ...
+ }
+
+ define slsh_main ()
+ {
+ variable genre = NULL;
+ variable no_rip = 0;
+ variable no_normalize = 0;
+ variable no_encode = 0;
+
+ variable opts = cmdopt_new ();
+ opts.add ("help", &exit_usage);
+ opts.add ("device", &CD_Device; type="str");
+ opts.add ("work", &Work_Dir; type="str");
+ opts.add ("root", &Root_Dir; type="str");
+ opts.add ("genre", &genre; type="str");
+ opts.add ("albuminfo", &parse_album_info; type="str");
+ opts.add ("no-normalize", &no_normalize);
+ opts.add ("no-encode", &no_encode);
+ variable i = opts.process (__argv, 1);
+ if (i + 1 != __argc)
+ exit_usage ();
+ CD_Device = __argvi;
+ .
+ .
+ }
+
+ There are several points that one should take from the above example.
+ First, to use the cmdopt interface it is necessary to load it. This
+ is accomplished using the require statement. Second, the above example
+ uses cmdopt's object-oriented style interface through the use of the
+ add and process methods of the cmdopt object created by the call to
+ cmdopt_new. Third, two of the command line options make use of
+ callback functions: the exit_usage function will get called when
+ --help appears on the command line, and the parse_album_info function
+ will get called to handle the --albuminfo option. Options such as
+ --no-encode do not take a value and the presence of such an option on
+ the command line causes the variable associated with the option to be
+ set to 1. Other options such as --genre will cause the variable
+ associated with them to be set of the value specified on the command-
+ line. Finally, the process method returns the index of __argv that
+ corresponds to ``non-option'' argument. In this case, for proper usage
+ of the script, that argument would correspond to device representing
+ the CD drive.
+
+ For more information about the cmdopt interface, see the documentation
+ for cmdopt_add:
+
+ slsh> help cmdopt_add
+
+ 20. Debugging
+
+ There are several ways to debug a S-Lang script. When the interpreter
+ encounters an uncaught exception, it can generate a traceback report
+ showing where the error occurred and the values of local variables in
+ the function call stack frames at the time of the error. Often just
+ knowing where the error occurs is all that is required to correct the
+ problem. More subtle bugs may require a deeper analysis to diagnose
+ the problem. While one can insert the appropriate print statements in
+ the code to get some idea about what is going on, it may be simpler to
+ use the interactive debugger.
+
+ 20.1. Tracebacks
+
+ When the value of the _traceback variable is non-zero, the interpreter
+ will generate a traceback report when it encounters an error. This
+ variable may be set by putting the line
+
+ _traceback = 1;
+
+ at the top of the suspect file. If the script is running in slsh, then
+ invoking slsh using the -g option will enable tracebacks:
+
+ slsh -g myscript.sl
+
+ If _traceback is set to a positive value, the values of local
+ variables will be printed in the traceback report. If set to a
+ negative integer, the values of the local variables will be absent.
+
+ Here is an example of a traceback report:
+
+ Traceback: error
+ ***string***:1:verror:Run-Time Error
+ /grandpa/d1/src/jed/lib/search.sl:78:search_generic_search:Run-Time Error
+ Local Variables:
+ String_Type prompt = "Search forward:"
+ Integer_Type dir = 1
+ Ref_Type line_ok_fun = &_function_return_1
+ String_Type str = "ascascascasc"
+ Char_Type not_found = 1
+ Integer_Type cs = 0
+ /grandpa/d1/src/jed/lib/search.sl:85:search_forward:Run-Time Error
+
+ There are several ways to read this report; perhaps the simplest is to
+ read it from the bottom. This report says that on line 85 in search.sl
+ the search_forward function called the search_generic_search function.
+ On line 78 it called the verror function, which in turn called error.
+ The search_generic_search function contains 6 local variables whose
+ values at the time of the error are given by the traceback output. The
+ above example shows that a local variable called "not_found" had a
+ Char_Type value of 1 at the time of the error.
+
+ 20.2. Using the sldb debugger
+
+ The interpreter contains a number of hooks that support a debugger.
+ sldb consists of a set of functions that use these hooks to implement
+ a simple debugger. Although written for slsh, the debugger may be used
+ by other S-Lang interpreters that permit the loading of slsh library
+ files. The examples presented here are given in the context of slsh.
+
+ In order to use the debugger, the code to to be debugged must be
+ loaded with debugging info enabled. This can be in done several ways,
+ depending upon the application embedding the interpreter.
+
+ For applications that support a command line, the simplest way to
+ access the debugger is to use the sldb function with the name of the
+ file to be debugged:
+
+ require ("sldb");
+ sldb ("foo.sl");
+
+ When called without an argument, sldb will prompt for input. This can
+ be useful for setting or removing breakpoints.
+
+ Another mechanism to access the debugger is to put
+
+ require ("sldb");
+ sldb_enable ();
+
+ at the top of the suspect file. Any files loaded by the file will also
+ be compiled with debugging support, making it unnecessary to add this
+ to all files.
+
+ If the file contains any top-level executable statements, the debugger
+ will display the line to be executed and prompt for input. If the
+ file does not contain any executable statements, the debugger will not
+ be activated until one of the functions in the file is executed.
+
+ As a concrete example, consider the following contrived slsh script
+ called buggy.sl:
+
+ define divide (a, b, i)
+ {
+ return ai / b;
+ }
+ define slsh_main ()
+ {
+ variable x = 1:5;
+ variable y = x*x;
+ variable i;
+ _for i (0, length(x), 1)
+ {
+ variable z = divide (x, y, i);
+ () = fprintf (stdout, "%g/%g = %g", xi, yi, z);
+ }
+ }
+
+ Running this via
+
+ slsh buggy.sl
+
+ yields
+
+ Expecting Double_Type, found Array_Type
+ ./buggy.sl:13:slsh_main:Type Mismatch
+
+ More information may be obtained by using slsh's -g option to cause a
+ traceback report to be printed:
+
+ slsh -g buggy.sl
+ Expecting Double_Type, found Array_Type
+ Traceback: fprintf
+ ./buggy.sl:13:slsh_main:Type Mismatch
+ Local variables for slsh_main:
+ Array_Type x = Integer_Type5
+ Array_Type y = Integer_Type5
+ Integer_Type i = 0
+ Array_Type z = Integer_Type5
+ Error encountered while executing slsh_main
+
+ From this one can see that the problem is that z is an array and not a
+ scalar as expected.
+
+ To run the program under debugger control, startup slsh and load the
+ file using the sldb function:
+
+ slsh> sldb ("./buggy.sl");
+
+ Note the use of "./" in the filename. This may be necessary if the
+ file is not in the slsh search path.
+
+ The above command causes execution to stop with the following
+ displayed:
+
+ slsh_main at ./buggy.sl:9
+ 9 variable x = 1:5;
+ (sldb)
+
+ This shows that the debugger has stopped the script at line 9 of
+ buggy.sl and is waiting for input. The print function may be used to
+ print the value of an expression or variable. Using it to display the
+ value of x yields
+
+ (sldb) print x
+ Caught exception:Variable Uninitialized Error
+ (sldb)
+
+ This is because x has not yet been assigned a value and will not be
+ until line 9 has been executed. The next command may be used to exe-
+ cute the current line and stop at the next one:
+
+ (sldb) next
+ 10 variable y = x*x;
+ (sldb)
+
+ The step command functions almost the same as next, except when a
+ function call is involved. In such a case, the next command will step
+ over the function call but step will cause the debugger to enter the
+ function and stop there.
+
+ Now the value of x may be displayed using the print command:
+
+ (sldb) print x
+ Integer_Type5
+ (sldb) print x0
+ 1
+ (sldb) print x-1
+ 5
+ (sldb)
+
+ The list command may be used to get a list of the source code around
+ the current line:
+
+ (sldb) list
+ 5 return ai / b;
+ 6 }
+ 7 define slsh_main ()
+ 8 {
+ 9 variable x = 1:5;
+ 10 variable y = x*x;
+ 11 variable i;
+ 12 _for i (0, length(x), 1)
+ 13 {
+ 14 variable z = divide (x, y, i);
+ 15 () = fprintf (stdout, "%g/%g = %g", xi, yi, z);
+
+ The break function may be used to set a breakpoint. For example,
+
+ (sldb) break 15
+ breakpoint #1 set at ./buggy.sl:15
+
+ will set a break point at the line 15 of the current file.
+
+ The cont command may be used to continue execution until the next
+ break point:
+
+ (sldb) cont
+ Breakpoint 1, slsh_main
+ at ./buggy.sl:15
+ 15 () = fprintf (stdout, "%g/%g = %g", xi, yi, z);
+ (sldb)
+
+ Using the next command produces:
+
+ Received Type Mismatch error. Entering the debugger
+ 15 () = fprintf (stdout, "%g/%g = %g", xi, yi, z);
+
+ This shows that during the execution of line 15, a TypeMismatchError
+ was generated. Let's see what caused it:
+
+ (sldb) print xi
+ 1
+ (sldb) print yi
+ 1
+ (sldb) print z
+ Integer_Type5
+
+ This shows that the problem was caused by z being an array and not a
+ scalar--- something that was already known from the traceback report.
+ Now let's see why it is not a scalar. Start the program again and set
+ a breakpoint in the divide function:
+
+ slsh_main at ./buggy.sl:9
+ 9 variable x = 1:5;
+ (sldb) break divide
+ breakpoint #1 set at divide
+ (sldb) cont
+ Breakpoint 1, divide
+ at ./buggy.sl:5
+ 5 return ai / b;
+ (sldb)
+
+ The values of ai/b and b may be printed:
+
+ (sldb) print ai/b
+ Integer_Type5
+ (sldb) print b
+ Integer_Type5
+
+ From this it is easy to see that z is an array because b is an array.
+ The fix for this is to change line 5 to
+
+ z = ai/bi;
+
+ The debugger supports several other commands. For example, the up and
+ down commands may be used to move up and down the stack-frames, and
+ where command may be used to display the stack-frames. These commands
+ are useful for examining the variables in the other frames:
+
+ (sldb) where
+ #0 ./buggy.sl:5:divide
+ #1 ./buggy.sl:14:slsh_main
+ (sldb) up
+ #1 ./buggy.sl:14:slsh_main
+ 14 variable z = divide (x, y, i);
+ (sldb) print x
+ Integer_Type5
+ (sldb) down
+ #0 ./buggy.sl:5:divide
+ 5 return ai / b;
+ (sldb) print z
+ Integer_Type5
+
+ On some operating systems, the debugger's watchfpu command may be used
+ to help isolate floating point exceptions. Consider the following
+ example:
+
+ define solve_quadratic (a, b, c)
+ {
+ variable d = b^2 - 4.0*a*c;
+ variable x = -b + sqrt (d);
+ return x / (2.0*a);
+ }
+ define print_root (a, b, c)
+ {
+ vmessage ("%f %f %f %f\n", a, b, c, solve_quadratic (a,b,c));
+ }
+ print_root (1,2,3);
+
+ Running it via slsh produces:
+
+ 1.000000 2.000000 3.000000 nan
+
+ Now run it in the debugger:
+
+ <top-level> at ./example.sl:12
+ 11 print_root (1,2,3);
+ (sldb) watchfpu FE_INVALID
+ (sldb) cont
+ *** FPU exception bits set: FE_INVALID
+ Entering the debugger.
+ solve_quadratic at ./t.sl:4
+ 4 variable x = -b + sqrt (d);
+
+ This shows the the NaN was produced on line 4.
+
+ The watchfpu command may be used to watch for the occurrence of any
+ combination of the following exceptions
+
+ FE_DIVBYZERO
+ FE_INEXACT
+ FE_INVALID
+ FE_OVERFLOW
+ FE_UNDERFLOW
+
+ by the bitwise-or operation of the desired combination. For instance,
+ to track both FE_INVALID and FE_OVERFLOW, use:
+
+ (sldb) watchfpu FE_INVALID | FE_OVERFLOW
+
+ 21. Profiling
+
+ 21.1. Introduction
+
+ This chapter deals with the subject of writing efficient S-Lang code,
+ and using the S-Lang profiler to isolate places in the code that could
+ benefit from optimization.
+
+ The most important consideration in writing efficient code is the
+ choice of algorithm. A poorly optimized good algorithm will almost
+ always execute faster than a highly optimized poor algorithm. In
+ choosing an algorithm, it is also important to choose the right data
+ structures for its implementation. As a simple example, consider the
+ task of counting words. Any algorithm would involve a some sort of
+ table with word/number pairs. Such a table could be implemented using
+ a variety of data structures, e.g., as a pair of arrays or lists
+ representing the words and corresponding numbers, as an array of
+ structures, etc. But in this case, the associative array is ideally
+ suited to the task:
+
+ a = Assoc_TypeInt_Type, 0;
+ while (get_word (&word))
+ aword++;
+
+ Note the conciseness of the above code. It is important to appreciate
+ the fact that S-Lang is a byte-compiled interpreter that executes
+ statements much slower than that of a language that compiles to
+ machine code. The overhead of the processing of byte-codes by the
+ interpreter may be used to roughly justify the rule of thumb that the
+ smaller the code is, the faster it will run.
+
+ When possible, always take advantage of S-Lang's powerful array
+ facilities. For example, consider the act of clipping an array by
+ setting all values greater than 10 to 10. Rather than coding this as
+
+ n = length(a);
+ for (i = 0; i < n; i++)
+ if (ai > 10) ai = 10;
+
+ it should be written as
+
+ awhere(a>10) = 10;
+
+ Finally, do not overlook the specialized modules that are available
+ for S-Lang.
+
+ 21.2. Using the profiler
+
+ slprof is an executable slsh script that implements a standalone
+ profiler for slsh scripts. The script is essentially a front-end for a
+ set of interpreter hooks defined in a file called profile.sl, which
+ may be used by any application embedding S-Lang. The use of the
+ profiler will first be demonstrated in the context of slprof, and
+ after that follows a discussion of how to use profile.sl for other S-
+ Lang applications.
+
+ (To be completed...)
+
+ 22. Regular Expressions
+
+ The S-Lang library includes a regular expression (RE) package that may
+ be used by an application embedding the library. The RE syntax should
+ be familiar to anyone acquainted with regular expressions. In this
+ section the syntax of the S-Lang regular expressions is discussed.
+
+ NOTE: At the moment, the S-Lang regular expressions do not support
+ UTF-8 encoded strings. The S-Lang library will most likely migrate to
+ the use of the PCRE regular expression library, deprecating the use of
+ the S-Lang REs in the process. For these reasons, the user is
+ encouraged to make use of the pcre module if possible.
+
+ 22.1. S-Lang RE Syntax
+
+ A regular expression specifies a pattern to be matched against a
+ string, and has the property that the contcatenation of two REs is
+ also a RE.
+
+ The S-Lang library supports the following standard regular
+ expressions:
+
+ . match any character except newline
+ * matches zero or more occurrences of previous RE
+ + matches one or more occurrences of previous RE
+ ? matches zero or one occurrence of previous RE
+ ^ matches beginning of a line
+ $ matches end of line
+ ... matches any single character between brackets.
+ For example, -02468 matches `-' or any even digit.
+ and -0-9a-z matches `-' and any digit between 0 and 9
+ as well as letters a through z.
+ \< Match the beginning of a word.
+ \> Match the end of a word.
+ $ ... $
+ \1, \2, ..., \9 Matches the match specified by nth $ ... $
+ expression.
+
+ In addition the following extensions are also supported:
+
+ \c turn on case-sensitivity (default)
+ \C turn off case-sensitivity
+ \d match any digit
+ \e match ESC char
+
+ Here are some simple examples:
+
+ "^int " matches the "int " at the beginning of a line.
+
+ "\<money\>" matches "money" but only if it appears as a separate word.
+
+ "^$" matches an empty line.
+
+ A more complex pattern is
+
+ "$\<a-zA-Z+\>$ +\1\>"
+
+ which matches any word repeated consecutively. Note how the grouping
+ operators $ and $ are used to define the text matched by the
+ enclosed regular expression, and then subsequently referred to \1.
+
+ Finally, remember that when used in string literals either in the S-
+ Lang language or in the C language, care must be taken to "double-up"
+ the '\' character since both languages treat it as an escape
+ character.
+
+ 22.2. Differences between S-Lang and egrep REs
+
+ There are several differences between S-Lang regular expressions and,
+ e.g., egrep regular expressions.
+
+ The most notable difference is that the S-Lang regular expressions do
+ not support the OR operator | in expressions. This means that "a|b" or
+ "a\|b" do not have the meaning that they have in regular expression
+ packages that support egrep-style expressions.
+
+ The other main difference is that while S-Lang regular expressions
+ support the grouping operators $ and $, they are only used as a
+ means of specifying the text that is matched. That is, the expression
+
+ "@$a-z*$@.*@\1@"
+
+ matches "xxx@abc@silly@abc@yyy", where the pattern \1 matches the text
+ enclosed by the $ and $ expressions. However, in the current imple-
+ mentation, the grouping operators are not used to group regular
+ expressions to form a single regular expression. Thus expression such
+ as "$hello$*" is not a pattern to match zero or more occurrences of
+ "hello" as it is in e.g., egrep.
+
+ One question that comes up from time to time is why doesn't S-Lang
+ simply employ some posix-compatible regular expression library. The
+ simple answer is that, at the time of this writing, none exists that
+ is available across all the platforms that the S-Lang library supports
+ (Unix, VMS, OS/2, win32, win16, BEOS, MSDOS, and QNX) and can be
+ distributed under both the GNU licenses. It is particularly important
+ that the library and the interpreter support a common set of regular
+ expressions in a platform independent manner.
+
+ A. S-Lang 2 Interpreter NEWS
+
+ This chapter describes features that were added to various 2.0
+ releases. For a much more complete and detailed list of changes, see
+ the changes.txt file that is distributed with the library.
+
+ A.1. What's new for S-Lang 2.2
+
+ o The ternary expression was added:
+
+ expression = condition ? val1 : val2
+
+ If condition is non-zero, then expression = val1, otherwise expression
+ = val2.
+
+ o The break and continue statements support an optional integer that
+ indicates how many loop levels the statement affects, e.g., the
+ break statement in
+
+ while (1)
+ {
+ loop (10)
+ {
+ break 2;
+ }
+ }
+
+ will cause both loops to be terminated.
+
+ o Multiline strings have been added:
+
+ "This is a \
+ multiline \
+ string"
+
+ `This is
+ another multiline
+ string that
+ does not require
+ a \ for continuation`
+
+ o List_Type objects may be indexed using an array of indices instead
+ of just a single scalar index.
+
+ The following intrinsic function were added in version 2.2:
+
+ sumsq
+ Equivalent to sum(x*x).
+
+ expm1
+ More accurate version of exp(x)-1 for x near 0.
+
+ log1p
+ More accurate version of log(1+x) for x near 0.
+
+ list_to_array
+ Creates an array from a list.
+
+ string_matches
+ A convenient alternative to the string_match and
+ string_match_nth functions.
+
+ _close
+ Close an integer descriptor.
+
+ _fileno
+ Returns the descriptor as an integer.
+
+ dup2_fd
+ Duplicates a file descriptor via the dup2 POSIX function.
+
+ getsid, killpg, getpriority, setpriority
+ These functions correspond to the corresponding POSIX functions.
+
+ ldexp, frexp
+ If x == a*2^b, where 0.5<=a<1.0 then (a,b)=frexp(x), and
+ x=ldexp(a,b).
+
+ The following functions have been enhanced:
+
+ hypot
+ If given a single array argument X, it returns the equivalent of
+ sqrt(sum(X*X).
+
+ polynom
+ The calling interface to this function was changed and support
+ added for arrays.
+
+ The following modules were added to version 2.2:
+
+ zlib
+ A module that wraps the popular z compression library.
+
+ fork
+ A module that wraps the fork, exec*, and waitpid functions.
+
+ sysconf
+ A module that implements interfaces to the POSIX sysconf,
+ pathconf, and confstr functions.
+
+ The following library files and functions were add to slsh:
+
+ process.sl
+ The code in this file utilizes the fork module to implement the
+ new_process function, which allows the caller to easily create
+ and communicate with subprocesses and pipelines.
+
+ A.2. What's new for S-Lang 2.1
+
+ o Short circuiting boolean operators || and && have been added to the
+ languange. The use of orelse and andelse constructs are nolonger
+ necessary nor encouraged.
+
+ o Qualifiers have been added to the language as a convenient and
+ powerful mechanism to pass optional information to functions.
+
+ o Structure definitions allow embeded assignemnts, e.g,
+
+ s = struct {foo = 3, bar = "hello" };
+
+ o Comparison expressions such as a<b<c are now interpretered as
+ (a<b)and(b<c).
+
+ o The ifnot keyword was added as an alternative to !if. The use of
+ !if has been deprecated.
+
+ o Looping constructs now support a "then" clause that will get
+ executed if the loop runs to completion, e.g.,
+
+ loop (20)
+ {
+ if (this ())
+ break; % The then clause will NOT get executed
+ }
+ then do_that ();
+
+ Note: then is now a reserved word.
+
+ o A floating point array of exactly N elements may be created using
+ the form a:b:#N, where the elements are uniformly spaced and run
+ from a to b, inclusive.
+
+ o References to array elements and structure fields are now
+ supported, e.g., &A3, &s.foo.
+
+ o An exception may be rethrown by calling "throw" without any
+ arguments:
+
+ try { something (); }
+ catch AnyError: { do_this (); throw; }
+
+ The following intrinsic function were added in version 2.1:
+
+ wherenot(x)
+ Equivalent to where (not(x))
+
+ _$(str)
+ Evaluates strings with embedded "dollar" variables, e.g.,
+ _$("$TERM").
+
+ __push_list/__pop_list
+ Push list items onto the stack
+
+ prod(x)
+ Computes the product of an array a0*a1*...
+
+ minabs(x), maxabs(x)
+ Equivalent to min(abs(x)) and max(abs(x)), resp.
+
+ getpgrp, setgid, getpgid
+ Get and set the process group ids (Unix).
+
+ setsid
+ Create a new session (Unix).
+
+ The following modules were added to version 2.1:
+
+ iconv
+ Performs character-set conversion using the iconv library.
+
+ onig
+ A regular expression module using oniguruma RE library.
+
+ The following library files and functions were add to slsh:
+
+ readascii
+ A flexible and power ascii (as opposed to binary) data file
+ reader.
+
+ cmdopt
+ A set of functions that vastly simplify the parsing of command
+ line options.
+
+ Also a history and completion mechanism was added to the S-Lang
+ readline interface, and as a result, slsh now supports history and
+ command/file completion.
+
+ A.3. What's new for S-Lang 2.0
+
+ Here is a brief list of some of the new features and improvements in
+ S-Lang 2.0.
+
+ o slsh, the generic S-Lang interpreter, now supports and interactive
+ command-line mode with readline support.
+
+ o Native support for Unicode via UTF-8 throughout the library.
+
+ o A List_Type object has been added to the language, e.g.,
+
+ x = {1, 2.7, "foo", 1:10};
+
+ will create a (heterogeneous) list of 4 elements.
+
+ o A much improved exception handling model.
+
+ o Variable expansion within string literals:
+
+ file = "$HOME/src/slang-$VERSION/"$;
+
+ o Operator overloading for user-defined types. For example it is
+ possible to define a meaning to X+Y where X and Y are defined as
+
+ typedef struct { x, y, z } Vector;
+ define vector (x,y,z) { variable v = @Vector; v.x=x; v.y=y; v.z=z;}
+ X = vector (1,2,3);
+ Y = vector (4,5,6);
+
+ o Syntactic sugar for objected-oriented style method calls. S-Lang 1
+ code such as
+
+ (@s.method)(s, args);
+
+ may be written much more simply as
+
+ s.method(args);
+
+ This should make "object-oriented" code somewhat more readable. See
+ also the next section if your code uses constructs such as
+
+ @s.method(args);
+
+ because it is not supported by S-Lang 2.
+
+ o More intrinsic functions including math functions such as hypot,
+ atan2, floor, ceil, round, isnan, isinf, and many more.
+
+ o Support for long long integers.
+
+ X = 18446744073709551615ULL;
+
+ o Large file support
+
+ o Performance improvements. The S-Lang 2 interpreter is about 20
+ percent faster for many operations than the previous version.
+
+ o Better debugging support including an interactive debugger. See the
+ section on ``Using the sldb debugger'' for more information.
+
+ See the relevent chapters in in the manual for more information.
+
+ A.4. Upgrading to S-Lang 2
+
+ For the most part S-Lang 2 is backwards-compatible with S-Lang 1.
+ However there are a few important differences that need to be
+ understood before upgrading to version 2.
+
+ ++ and -- operators in function calls
+ Previously the ++ and {--} operators were permitted in a
+ function argument list, e.g.,
+
+ some_function (x++, x);
+
+ Such uses are flagged as syntax errors and need to be changed to
+
+ x++; some_function (x);
+
+ Array indexing of strings
+ Array indexing of strings uses byte-semantics and not character-
+ semantics. This distinction is important only if UTF-8 mode is
+ in effect. If you use array indexing with functions that use
+ character semantics, then your code may not work properly in
+ UTF-8 mode. For example, one might have used
+
+ i = is_substr (a, b);
+ if (i) c = a0:i-2;
+
+ to extract that portion of a that preceeds the occurrence of b in
+ a. This may nolonger work in UTF-8 mode where bytes and characters
+ are not generally the same. The correct way to write the above is
+ to use the substr function since it uses character semantics:
+
+ i = is_substr (a, b);
+ if (i) c = substr (a, 1, i-1);
+
+ Array indexing with negative integer ranges
+ Previously the interpretation of a range array was context
+ sensitive. In an indexing situation 0:-1 was used to index
+ from the first through the last element of an array, but outside
+ this context, 0:-1 was an empty array. For S-Lang 2, the
+ meaning of such arrays is always the same regardless of the
+ context. Since by itself 0:-1 represents an empty array,
+ indexing with such an array will also produce an empty array.
+ The behavior of scalar indices has not changed: A-1 still
+ refers to the last element of the array.
+
+ Range arrays with an implied endpoint make sense only in
+ indexing situations. Hence the value of the endpoint can be
+ inferred from the context. Such arrays include *, :-1, etc.
+
+ Code that use index-ranges with negative valued indices such as
+
+ B = A0:-2; % Get all but the last element of A
+
+ will have to be changed to use an array with an implied endpoint:
+
+ B = A:-2; % Get all but the last element of A
+
+ Similarly, code such as
+
+ B = A-3:-1; % Get the last 3 elements of A
+
+ must be changed to
+
+ B = A-3:;
+
+ Dereferencing function members of a structure
+ Support for the non-parenthesized form of function member
+ dereferencing has been dropped. Code such as
+
+ @s.foo(args);
+
+ will need to be changed to use the parenthesized form:
+
+ (@s.foo)(args);
+
+ The latter form will work in both S-Lang 1 and S-Lang 2.
+
+ If your code passes the structure as the first argument of the
+ method call, e.g.,
+
+ (@s.foo)(s, moreargs);
+
+ then it may be changed to
+
+ s.foo (moreargs);
+
+ However, this objected-oriented form of method calling is not sup-
+ ported by S-Lang 1.
+
+ ERROR_BLOCKS
+ Exception handling via ERROR_BLOCKS is still supported but
+ deprecated. If your code uses ERROR_BLOCKS it should be changed
+ to use the new exception handling model. For example, code that
+ looks like:
+
+ ERROR_BLOCK { cleanup_after_error (); }
+ do_something ();
+ .
+ .
+
+ should be changed to:
+
+ variable e;
+ try (e)
+ {
+ do_something ();
+ .
+ .
+ }
+ catch RunTimeError:
+ {
+ cleanup_after_error ();
+ throw e.error, e.message;
+ }
+
+ Code that makes use of EXECUTE_ERROR_BLOCK
+
+ ERROR_BLOCK { cleanup_after_error (); }
+ do_something ();
+ .
+ .
+ EXECUTE_ERROR_BLOCK;
+
+ should be changed to make use of a finally clause:
+
+ variable e;
+ try (e)
+ {
+ do_something ();
+ .
+ .
+ }
+ finally
+ {
+ cleanup_after_error ();
+ }
+
+ It is not possible to emulate the complete semantics of the
+ _clear_error function. However, those semantics are flawed and
+ fixing the problems associated with the use of _clear_error was one
+ of the primary reasons for the new exception handling model. The
+ main problem with the _clear_error method is that it causes
+ execution to resume at the byte-code following the code that
+ triggered the error. As such, _clear_error defines no absolute
+ resumption point. In contrast, the try-catch exception model has
+ well-defined points of execution. With the above caveats, code such
+ as
+
+ ERROR_BLOCK { cleanup_after_error (); _clear_error ();}
+ do_something ();
+ .
+ .
+
+ should be changed to:
+
+ variable e;
+ try (e)
+ {
+ do_something ();
+ .
+ .
+ }
+ catch RunTimeError:
+ {
+ cleanup_after_error ();
+ }
+
+ And code using _clear_error in conjunction with EXE-
+ CUTE_ERROR_BLOCK:
+
+ ERROR_BLOCK { cleanup_after_error (); _clear_error ();}
+ do_something ();
+ .
+ .
+ EXECUTE_ERROR_BLOCK;
+
+ should be changed to:
+
+ variable e;
+ try (e)
+ {
+ do_something ();
+ .
+ .
+ }
+ catch RunTimeError:
+ {
+ cleanup_after_error ();
+ }
+ finally:
+ {
+ cleanup_after_error ();
+ }
+
+ fread
+ When reading Char_Type and UChar_Type objects the S-Lang 1
+ version of fread returned a binary string (BString_Type if the
+ number of characters read was greater than one, or a U/Char_Type
+ if the number read was one. In other words, the resulting type
+ depended upon how many bytes were read with no way to predict
+ the resulting type in advance. In contrast, when reading, e.g,
+ Int_Type objects, fread returned an Int_Type when it read one
+ integer, or an array of Int_Type if more than one was read. For
+ S-Lang 2, the behavior of fread with respect to UChar_Type and
+ Char_Type types was changed to have the same semantics as the
+ other data types.
+
+ The upshot is that code that used
+
+ nread = fread (&str, Char_Type, num_wanted, fp)
+
+ will no longer result in str being a BString_Type if nread > 1.
+ Instead, str will now become a Char_Typenread object. In order to
+ read a specified number of bytes from a file in the form of a
+ string, use the fread_bytes function:
+
+ #if (_slang_version >= 20000)
+ nread = fread_bytes (&str, num_wanted, fp);
+ #else
+ nread = fread (&str, Char_Type, num_wanted, fp)
+ #endif
+
+ The above will work with both versions of the interpreter.
+
+ strtrans
+ The strtrans function has been changed to support Unicode. One
+ ramification of this is that when mapping from one range of
+ characters to another, the length of the ranges must now be
+ equal.
+
+ str_delete_chars
+ This function was changed to support unicode character classes.
+ Code such as
+
+ y = str_delete_chars (x, "\\a");
+
+ is now implies the deletion of all alphabetic characters from x.
+ Previously it meant to delete the backslashes and as from from x.
+ Use
+
+ y = str_delete_chars (x, "\\\\a");
+
+ to achieve the latter.
+
+ substr, is_substr, strsub
+ These functions use character-semantics and not byte-semantics.
+ The distinction is important in UTF-8 mode. If you use array
+ indexing in conjunction with these functions, then read on.
+
+ B. Copyright
+
+ The S-Lang library is distributed under the terms of the GNU General
+ Public License.
+
+ B.1. The GNU Public License
+
+ GNU GENERAL PUBLIC LICENSE
+ Version 2, June 1991
+
+ Copyright (C) 1989, 1991 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.
+
+ Preamble
+
+ The licenses for most software are designed to take away your freedom
+ to share and change it. By contrast, the GNU General Public License is
+ intended to guarantee your freedom to share and change free soft-
+ ware--to make sure the software is free for all its users. This Gen-
+ eral Public License applies to most of the Free Software Foundation's
+ software and to any other program whose authors commit to using it.
+ (Some other Free Software Foundation software is covered by the GNU
+ Library General Public License instead.) You can apply it to your pro-
+ grams, 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
+ this service 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 make restrictions that forbid
+ anyone to deny you these rights or to ask you to surrender the rights.
+ These restrictions translate to certain responsibilities for you if
+ you distribute copies of the software, or if you modify it.
+
+ For example, if you distribute copies of such a program, whether
+ gratis or for a fee, you must give the recipients all the rights that
+ you have. 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.
+
+ We protect your rights with two steps: (1) copyright the software, and
+ (2) offer you this license which gives you legal permission to copy,
+ distribute and/or modify the software.
+
+ Also, for each author's protection and ours, we want to make certain
+ that everyone understands that there is no warranty for this free
+ software. If the software is modified by someone else and passed on,
+ we want its recipients to know that what they have is not the
+ original, so that any problems introduced by others will not reflect
+ on the original authors' reputations.
+
+ Finally, any free program is threatened constantly by software
+ patents. We wish to avoid the danger that redistributors of a free
+ program will individually obtain patent licenses, in effect making the
+ program proprietary. To prevent this, we have made it clear that any
+ patent must be licensed for everyone's free use or not licensed at
+ all.
+
+ The precise terms and conditions for copying, distribution and
+ modification follow.
+
+ GNU GENERAL PUBLIC LICENSE
+ TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+ 0. This License applies to any program or other work which contains a
+ notice placed by the copyright holder saying it may be distributed
+ under the terms of this General Public License. The "Program", below,
+ refers to any such program or work, and a "work based on the Program"
+ means either the Program or any derivative work under copyright law:
+ that is to say, a work containing the Program or a portion of it,
+ either verbatim or with modifications and/or translated into another
+ language. (Hereinafter, translation is included without limitation in
+ the term "modification".) Each licensee is addressed as "you".
+
+ Activities other than copying, distribution and modification are not
+ covered by this License; they are outside its scope. The act of
+ running the Program is not restricted, and the output from the Program
+ is covered only if its contents constitute a work based on the Program
+ (independent of having been made by running the Program). Whether
+ that is true depends on what the Program does.
+
+ 1. You may copy and distribute 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
+ and disclaimer of warranty; keep intact all the notices that refer to
+ this License and to the absence of any warranty; and give any other
+ recipients of the Program a copy of this License along with the
+ Program.
+
+ You may charge a fee for the physical act of transferring a copy, and
+ you may at your option offer warranty protection in exchange for a
+ fee.
+
+ 2. You may modify your copy or copies of the Program or any portion of
+ it, thus forming a work based on the Program, and copy and distribute
+ such modifications or work under the terms of Section 1 above,
+ provided that you also meet all of these conditions:
+
+ a) You must cause the modified files to carry prominent notices
+ stating that you changed the files and the date of any change.
+
+ b) You must cause any work that you distribute or publish, that in
+ whole or in part contains or is derived from the Program or any
+ part thereof, to be licensed as a whole at no charge to all third
+ parties under the terms of this License.
+
+ c) If the modified program normally reads commands interactively
+ when run, you must cause it, when started running for such
+ interactive use in the most ordinary way, to print or display an
+ announcement including an appropriate copyright notice and a
+ notice that there is no warranty (or else, saying that you provide
+ a warranty) and that users may redistribute the program under
+ these conditions, and telling the user how to view a copy of this
+ License. (Exception: if the Program itself is interactive but
+ does not normally print such an announcement, your work based on
+ the Program is not required to print an announcement.)
+
+ These requirements apply to the modified work as a whole. If identifi-
+ able sections of that work are not derived from the Program, and can
+ be reasonably considered independent and separate works in themselves,
+ then this License, and its terms, do not apply to those sections when
+ you distribute them as separate works. But when you distribute the
+ same sections as part of a whole which is a work based on the Program,
+ the distribution of the whole must be on the terms of this License,
+ whose permissions for other licensees extend to the entire whole, and
+ thus to each and every part regardless of who wrote it.
+
+ Thus, it is not the intent of this section to claim rights or contest
+ your rights to work written entirely by you; rather, the intent is to
+ exercise the right to control the distribution of derivative or
+ collective works based on the Program.
+
+ In addition, mere aggregation of another work not based on the Program
+ with the Program (or with a work based on the Program) on a volume of
+ a storage or distribution medium does not bring the other work under
+ the scope of this License.
+
+ 3. You may copy and distribute the Program (or a work based on it,
+ under Section 2) in object code or executable form under the terms of
+ Sections 1 and 2 above provided that you also do one of the following:
+
+ a) Accompany it with the complete corresponding machine-readable
+ source code, which must be distributed under the terms of Sections
+ 1 and 2 above on a medium customarily used for software interchange; or,
+
+ b) Accompany it with a written offer, valid for at least three
+ years, to give any third party, for a charge no more than your
+ cost of physically performing source distribution, a complete
+ machine-readable copy of the corresponding source code, to be
+ distributed under the terms of Sections 1 and 2 above on a medium
+ customarily used for software interchange; or,
+
+ c) Accompany it with the information you received as to the offer
+ to distribute corresponding source code. (This alternative is
+ allowed only for noncommercial distribution and only if you
+ received the program in object code or executable form with such
+ an offer, in accord with Subsection b above.)
+
+ The source code for a work means the preferred form of the work for
+ making modifications to it. For an executable work, complete source
+ code means all the source code for all modules it contains, plus any
+ associated interface definition files, plus the scripts used to con-
+ trol compilation and installation of the executable. However, as a
+ special exception, the source code distributed need not include any-
+ thing that is normally distributed (in either source or binary form)
+ with the major components (compiler, kernel, and so on) of the operat-
+ ing system on which the executable runs, unless that component itself
+ accompanies the executable.
+
+ If distribution of executable or object code is made by offering
+ access to copy from a designated place, then offering equivalent
+ access to copy the source code from the same place counts as
+ distribution of the source code, even though third parties are not
+ compelled to copy the source along with the object code.
+
+ 4. You may not copy, modify, sublicense, or distribute the Program
+ except as expressly provided under this License. Any attempt otherwise
+ to copy, modify, sublicense or distribute the Program 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.
+
+ 5. You are not required to accept this License, since you have not
+ signed it. However, nothing else grants you permission to modify or
+ distribute the Program or its derivative works. These actions are
+ prohibited by law if you do not accept this License. Therefore, by
+ modifying or distributing the Program (or any work based on the
+ Program), you indicate your acceptance of this License to do so, and
+ all its terms and conditions for copying, distributing or modifying
+ the Program or works based on it.
+
+ 6. Each time you redistribute the Program (or any work based on the
+ Program), the recipient automatically receives a license from the
+ original licensor to copy, distribute or modify the Program subject to
+ these terms and conditions. You may not impose any further
+ restrictions on the recipients' exercise of the rights granted herein.
+ You are not responsible for enforcing compliance by third parties to
+ this License.
+
+ 7. If, as a consequence of a court judgment or allegation of patent
+ infringement or for any other reason (not limited to patent issues),
+ 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
+ distribute so as to satisfy simultaneously your obligations under this
+ License and any other pertinent obligations, then as a consequence you
+ may not distribute the Program at all. For example, if a patent
+ license would not permit royalty-free redistribution of the Program by
+ all those who receive copies directly or indirectly through you, then
+ the only way you could satisfy both it and this License would be to
+ refrain entirely from distribution of the Program.
+
+ If any portion of this section is held invalid or unenforceable under
+ any particular circumstance, the balance of the section is intended to
+ apply and the section as a whole is intended to apply in other
+ circumstances.
+
+ It is not the purpose of this section to induce you to infringe any
+ patents or other property right claims or to contest validity of any
+ such claims; this section has the sole purpose of protecting the
+ integrity of the free software distribution system, which is
+ implemented by public license practices. Many people have made
+ generous contributions to the wide range of software distributed
+ through that system in reliance on consistent application of that
+ system; it is up to the author/donor to decide if he or she is willing
+ to distribute software through any other system and a licensee cannot
+ impose that choice.
+
+ This section is intended to make thoroughly clear what is believed to
+ be a consequence of the rest of this License.
+
+ 8. If the distribution and/or use of the Program is restricted in
+ certain countries either by patents or by copyrighted interfaces, the
+ original copyright holder who places the Program under this License
+ may add an explicit geographical distribution limitation excluding
+ those countries, so that distribution is permitted only in or among
+ countries not thus excluded. In such case, this License incorporates
+ the limitation as if written in the body of this License.
+
+ 9. The Free Software Foundation may publish revised and/or new
+ versions of the 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 a version number of this License which applies to it and
+ "any later version", you have the option of following the terms and
+ conditions either of that version or of any later version published by
+ the Free Software Foundation. If the Program does not specify a
+ version number of this License, you may choose any version ever
+ published by the Free Software Foundation.
+
+ 10. If you wish to incorporate parts of the Program into other free
+ programs whose distribution conditions are different, write to the
+ author to ask for permission. For software which is copyrighted by the
+ Free Software Foundation, write to the Free Software Foundation; we
+ sometimes make exceptions for this. Our decision will be guided by the
+ two goals of preserving the free status of all derivatives of our free
+ software and of promoting the sharing and reuse of software generally.
+
+ NO WARRANTY
+
+ 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, 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.
+
+ 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+ WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+ REDISTRIBUTE 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.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+ possible use to the public, the best way to achieve this is to make it
+ free software which everyone can redistribute and change under these
+ terms.
+
+ To do so, attach the following notices to the program. It is safest to
+ attach them to the start of each source file to most effectively
+ convey the exclusion of warranty; and each file should have at least
+ the "copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) 19yy <name of author>
+
+ 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 2 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, write to the Free Software
+ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+ Also add information on how to contact you by electronic and paper
+ mail.
+
+ If the program is interactive, make it output a short notice like this
+ when it starts in an interactive mode:
+
+ Gnomovision version 69, Copyright (C) 19yy name of author
+ Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+ The hypothetical commands `show w' and `show c' should show the appro-
+ priate parts of the General Public License. Of course, the commands
+ you use may be called something other than `show w' and `show c'; they
+ could even be mouse-clicks or menu items--whatever suits your program.
+
+ You should also get your employer (if you work as a programmer) or
+ your school, if any, to sign a "copyright disclaimer" for the program,
+ if necessary. Here is a sample; alter the names:
+
+ Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+ `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+ <signature of Ty Coon>, 1 April 1989
+ Ty Coon, President of Vice
+
+ This General Public License does not permit incorporating your program
+ into proprietary programs. If your program is a subroutine library,
+ you may consider it more useful to permit linking proprietary applica-
+ tions with the library. If this is what you want to do, use the GNU
+ Library General Public License instead of this License.
+
+ B.2. The Unicode Inc. Copyright
+
+ This software makes use of the Unicode tables published by Unicode,
+ Inc under the following terms:
+
+ COPYRIGHT AND PERMISSION NOTICE
+
+ Copyright (c) 1991-2009 Unicode, Inc. All rights reserved. Distributed
+ under the Terms of Use in http://www.unicode.org/copyright.html.
+
+ Permission is hereby granted, free of charge, to any person
+ obtaining a copy of the Unicode data files and any associated
+ documentation (the "Data Files") or Unicode software and any
+ associated documentation (the "Software") to deal in the Data Files
+ or Software without restriction, including without limitation the
+ rights to use, copy, modify, merge, publish, distribute, and/or sell
+ copies of the Data Files or Software, and to permit persons to whom
+ the Data Files or Software are furnished to do so, provided that (a)
+ the above copyright notice(s) and this permission notice appear with
+ all copies of the Data Files or Software, (b) both the above
+ copyright notice(s) and this permission notice appear in associated
+ documentation, and (c) there is clear notice in each modified Data
+ File or in the Software as well as in the documentation associated
+ with the Data File(s) or Software that the data or software has been
+ modified.
+
+ THE DATA FILES AND SOFTWARE ARE 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 OF THIRD PARTY RIGHTS. IN NO EVENT SHALL THE
+ COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE BE LIABLE FOR
+ ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY
+ DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
+ WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
+ ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
+ OF THE DATA FILES OR SOFTWARE.
+
+ Except as contained in this notice, the name of a copyright holder
+ shall not be used in advertising or otherwise to promote the sale,
+ use or other dealings in these Data Files or Software without prior
+ written authorization of the copyright holder.
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/text/slangfun.txt Added

@@ -0,0 +1,11428 @@
+all
+
+ SYNOPSIS
+ Tests if all elements of an array are non-zero
+
+ USAGE
+ Char_Type all (Array_Type a ,Int_Type dim)
+
+ DESCRIPTION
+ The `all' function examines the elements of a numeric array and
+ returns 1 if all elements are non-zero, otherwise it returns 0. If a
+ second argument is given, then it specifies the dimension of the
+ array over which the function is to be applied. In this case, the
+ result will be an array with the same shape as the input array minus
+ the specified dimension.
+
+ EXAMPLE
+ Consider the 2-d array
+
+ 1 2 3 4 5
+ 6 7 8 9 10
+
+ generated by
+
+ a = _reshape (1:10, 2, 5);
+
+ Then `all(a)' will return 1, and `all(a>3, 0)' will return
+ a 1-d array
+
+ 0, 0, 0, 1, 1
+
+ Similarly, `all(a>3, 1)' will return the 1-d array
+
+ 0,1
+
+
+ SEE ALSO
+ where, any, wherediff
+
+--------------------------------------------------------------
+
+any
+
+ SYNOPSIS
+ Test if any element of an array is non-zero
+
+ USAGE
+ Char_Type any (Array_Type a ,Int_Type dim)
+
+ DESCRIPTION
+ The `any' function examines the elements of a numeric array and
+ returns 1 if any element is both non-zero and not a NaN, otherwise
+ it returns 0. If a second argument is given, then it specifies
+ the dimension of the array to be tested.
+
+ EXAMPLE
+ Consider the 2-d array
+
+ 1 2 3 4 5
+ 6 7 8 9 10
+
+ generated by
+
+ a = _reshape (1:10, 2, 5);
+
+ Then `any(a==3)' will return 1, and `any(a==3, 0)'
+ will return a 1-d array with elements:
+
+ 0 0 1 0 0
+
+
+ SEE ALSO
+ all, where, wherediff
+
+--------------------------------------------------------------
+
+array_info
+
+ SYNOPSIS
+ Returns information about an array
+
+ USAGE
+ (Array_Type, Integer_Type, DataType_Type) array_info (Array_Type a)
+
+ DESCRIPTION
+ The `array_info' function returns information about the array `a'.
+ It returns three values: an 1-d integer array specifying the
+ size of each dimension of `a', the number of dimensions of
+ `a', and the data type of `a'.
+
+ EXAMPLE
+ The `array_info' function may be used to find the number of rows
+ of an array:
+
+ define num_rows (a)
+ {
+ variable dims, num_dims, data_type;
+
+ (dims, num_dims, data_type) = array_info (a);
+ return dims 0;
+ }
+
+
+ SEE ALSO
+ typeof, array_shape, length, reshape, _reshape
+
+--------------------------------------------------------------
+
+array_map
+
+ SYNOPSIS
+ Apply a function to each element of an array
+
+ USAGE
+ Array_Type array_map (type, func, args...)
+ % or
+ (Array_Type, ...) array_map (type, ..., func, args...)
+
+ DataType_Type type, ...;
+ Ref_Type func;
+
+
+ DESCRIPTION
+ The `array_map' function may be used to apply a function to
+ each element of an array and returns the resulting values as an
+ array of the specified type. The `type' parameter indicates
+ what kind of array should be returned and generally corresponds to
+ the return type of the function. If the function returns multiple
+ values, then the type of each return value must be given. The first
+ array-valued argument is used to determine the dimensions of the
+ resulting array(s). If any subsequent arguments correspond to an array
+ of the same size, then those array elements will be passed in
+ parallel with the elements of the first array argument.
+
+ To use `array_map' with functions that return no value, either
+ omit the `type' argument, or explicitly indicate that it
+ returns no value using the Void_Type type.
+
+ EXAMPLE
+ The first example illustrates how to apply the `strlen' function
+ to an array of strings.
+
+ S = "", "Train", "Subway", "Car";
+ L = array_map (Integer_Type, &strlen, S);
+
+ This is equivalent to:
+
+ S = "", "Train", "Subway", "Car";
+ L = Integer_Type length (S);
+ for (i = 0; i < length (S); i++) Li = strlen (Si);
+
+
+ Now consider an example involving the `strcat' function:
+
+ files = "slang", "slstring", "slarray";
+
+ exts = ".c";
+ cfiles = array_map (String_Type, &strcat, files, exts);
+ % ==> cfiles = "slang.c", "slstring.c", "slarray.c";
+
+ exts = ".a",".b",".c";
+ xfiles = array_map (String_Type, &strcat, files, exts);
+ % ==> xfiles = "slang.a", "slstring.b", "slarray.c";
+
+
+ Here is an example of its application to a function that returns 3
+ values. Suppose `A' is an array of arrays whose types and
+ sizes are arbitrary, and we wish to find the indices of `A'
+ that contain arrays of type `String_Type'. For this purpose, the
+ `array_info' function will be used:
+
+ (dims, ndims, types)
+ = array_map (Array_Type, Int_Type, DataType_Type, &array_info, A);
+ i = where (types == String_Type);
+
+
+ The `message' function prints a string and returns no value.
+ This example shows how it may be used to print an array of strings:
+
+ a = "Line 1", "Line 2", "Line 3";
+ array_map (&message, a); % Form 1
+ array_map (Void_Type, &message, a); % Form 2
+
+
+ NOTES
+ Many mathematical functions already work transparently on arrays.
+ For example, the following two statements produce identical results:
+
+ B = sin (A);
+ B = array_map (Double_Type, &sin, A);
+
+
+ NOTES
+ A number of the string functions have been vectorized, including the
+ `strlen' function. This means that there is no need to use the
+ `array_map' function with the `strlen' function.
+
+ SEE ALSO
+ array_info, strlen, strcat, sin
+
+--------------------------------------------------------------
+
+array_reverse
+
+ SYNOPSIS
+ Reverse the elements of an array
+
+ USAGE
+ array_reverse (Array_Type a ,Int_Type i0, Int_Type i1 ,Int_Type dim)
+
+ DESCRIPTION
+ In its simplest form, the `array_reverse' function reverses the
+ elements of an array. If passed 2 or 4 arguments,
+ `array_reverse' reverses the elements of the specified
+ dimension of a multi-dimensional array. If passed 3 or 4 arguments,
+ the parameters `i0' and `i1' specify a range of elements
+ to reverse.
+
+ EXAMPLE
+ If `a' is a one dimensional array, then
+
+ array_reverse (a, i, j);
+ ai:j = aj:i:-1;
+
+ are equivalent to one another. However, the form using
+ `array_reverse' is about 10 times faster than the version that
+ uses explicit array indexing.
+
+ SEE ALSO
+ array_swap, transpose
+
+--------------------------------------------------------------
+
+array_shape
+
+ SYNOPSIS
+ Get the shape or dimensions of an array
+
+ USAGE
+ dims = array_shape (Array_Type a)
+
+ DESCRIPTION
+ This function returns an array representing the dimensionality or
+ shape of a specified array. The `array_info' function also
+ returns this information but for many purposes the
+ `array_shape' function is more convenient.
+
+ SEE ALSO
+ array_info, reshape
+
+--------------------------------------------------------------
+
+array_sort
+
+ SYNOPSIS
+ Sort an array or opaque object
+
+ USAGE
+ Array_Type array_sort (obj , &func , n)
+
+ DESCRIPTION
+ The `array_sort' function may be used to sort an object and
+ returns an integer index array that represents the result of the
+ sort as a permutation.
+
+ If a single parameter is passed, that parameter must be an array,
+ which will be sorted into ascending order using a built-in type-specific
+ comparison function.
+
+ If two parameters are passed (`obj' and `func'), then the
+ first parameter must be the array to be sorted, and the second is a
+ reference to the comparison function. In this case, the comparison
+ function represented by `func' must take two arguments
+ representing two array elements to be compared, and must return an
+ integer that represents the result of the comparison. The return
+ value must be less than zero if the first parameter is
+ less than the second, zero if they are equal, and a value greater
+ than zero if the first is greater than the second.
+
+ If three parameters are passed, then the first argument will be
+ regarded as an opaque object by the sorting algorithm. For this
+ reason, the number of elements represented by the object must also
+ be passed to `array_sort' function as the third function
+ argument. The second function argument must be a reference to
+ comparison function. In this case, the comparison function will be
+ passed three values: the opaque object, the (0-based) index of the
+ first element to be compared, and the (0-based) index of the second
+ element. The return value must be less than zero if the value of
+ the element at the first index considered to be less than the value
+ of the element at the second index, zero if the values are equal,
+ and a value greater than zero if the first value is greater than the
+ second.
+
+ `array_sort' sorts the array `a' into ascending order and
+ returns an integer array that represents the result of the sort. If
+ the optional second parameter `f' is present, the function
+ specified by `f' will be used to compare elements of `a';
+ otherwise, a built-in sorting function will be used.
+
+ The integer array returned by this function is simply an index array
+ that indicates the order of the sorted object. The input object
+ `obj' is not changed.
+
+ QUALIFIERS
+ By default, elements are sorted in ascending order. The `dir'
+ qualifier may be used to specify the sort direction. Specifically
+ if `dir>=0', the sort will be an ascending one, otherwise it
+ will be descending.
+
+ The `method' qualifier may be used to select between the
+ available sorting algorithms. There are currently two algorithms
+ supported: merge-sort and quick-sort. Using `method="msort"'
+ will cause the merge-sort algorithm to be used. The quick-sort
+ algorithm may be selected using `method="qsort"'.
+
+ EXAMPLE
+ An array of strings may be sorted using the `strcmp' function
+ since it fits the specification for the sorting function described
+ above:
+
+ A = "gamma", "alpha", "beta";
+ I = array_sort (A, &strcmp);
+
+ Alternatively, one may use
+
+ variable I = array_sort (A);
+
+ to use the built-in comparison function.
+
+ After the `array_sort' has executed, the variable `I' will
+ have the values `2, 0, 1'. This array can be used to
+ re-shuffle the elements of `A' into the sorted order via the
+ array index expression `A = AI'. This operation may also be
+ written:
+
+ A = Aarray_sort(A);
+
+
+ EXAMPLE
+ A homogeneous list may be sorted by using the opaque form of the
+ `array_sort' function:
+
+ private define cmp_function (s, i, j)
+ {
+ if (si > sj) return 1;
+ if (si < sj) return -1;
+ return 0;
+ }
+
+ list = {};
+ % fill list ....
+ % now sort it
+ i = array_sort (list, &cmp_function, length(list));
+
+ % Create a new sorted list
+ list = listi;
+
+ Alternatively one may first convert it to an array and use the
+ built-in comparison function:
+
+ a = list_to_array (list);
+ i = array_sort(a);
+
+ % Rearrange the elements
+ list* = ai;
+
+ to get the effect of an "in-place" sort.
+
+ NOTES
+ The default sorting algorithm is merge-sort. It has an N*log(N)
+ worst-case runtime compared to quick-sort's worst-case N^2 runtime.
+ The primary advantage of quick-sort is that it uses O(1) additional
+ memory, whereas merge-sort requires O(N) additional memory.
+
+ A stable sorting algorithm is one that preserves the order of equal
+ elements. Merge-sort is an inherently stable algorithm, whereas
+ quick-sort is not. Nevertheless, the slang library ensures the
+ stability of the results because it uses the indices themselves as
+ tie-breakers. As a result, the following two statements may not
+ produce the same results:
+
+ i = array_sort (a; dir=-1);
+ i = array_reverse (array_sort (a; dir=1));
+
+
+ SEE ALSO
+ set_default_sort_method, get_default_sort_method, strcmp, list_to_array
+
+--------------------------------------------------------------
+
+array_swap
+
+ SYNOPSIS
+ Swap elements of an array
+
+ USAGE
+ array_swap (Array_Type a, Int_Type i, Int_Type j)
+
+ DESCRIPTION
+ The `array_swap' function swaps the specified elements of an
+ array. It is equivalent to
+
+ (ai, aj) = (aj, ai);
+
+ except that it executes several times faster than the above construct.
+
+ SEE ALSO
+ array_reverse, transpose
+
+--------------------------------------------------------------
+
+cumsum
+
+ SYNOPSIS
+ Compute the cumulative sum of an array
+
+ USAGE
+ result = cumsum (Array_Type a , Int_Type dim)
+
+ DESCRIPTION
+ The `cumsum' function performs a cumulative sum over the
+ elements of a numeric array and returns the result. If a second
+ argument is given, then it specifies the dimension of the array to
+ be summed over. For example, the cumulative sum of
+ `1,2,3,4', is the array `1,1+2,1+2+3,1+2+3+4', i.e.,
+ `1,3,6,10'.
+
+ SEE ALSO
+ sum, sumsq
+
+--------------------------------------------------------------
+
+get_default_sort_method
+
+ SYNOPSIS
+ Get the default sorting method
+
+ USAGE
+ String_Type get_default_sort_method ()
+
+ DESCRIPTION
+ This function may be used to get the default sorting method used by
+ `array_sort'. It will return one of the following strings:
+
+ "msort" Merge-Sort
+ "qsort" Quick-Sort
+
+
+ SEE ALSO
+ set_default_sort_method, array_sort
+
+--------------------------------------------------------------
+
+init_char_array
+
+ SYNOPSIS
+ Initialize an array of characters
+
+ USAGE
+ init_char_array (Array_Type a, String_Type s)
+
+ DESCRIPTION
+ The `init_char_array' function may be used to initialize a
+ Char_Type array `a' by setting the elements of the array
+ `a' to the corresponding bytes of the string `s'.
+
+ EXAMPLE
+ The statements
+
+ variable a = Char_Type 10;
+ init_char_array (a, "HelloWorld");
+
+ creates an character array and initializes its elements to the
+ bytes in the string `"HelloWorld"'.
+
+ NOTES
+ The character array must be large enough to hold all the characters
+ of the initialization string. This function uses byte-semantics.
+
+ SEE ALSO
+ bstring_to_array, strlen, strcat
+
+--------------------------------------------------------------
+
+_isnull
+
+ SYNOPSIS
+ Check an array for NULL elements
+
+ USAGE
+ Char_Type = _isnull (a)
+
+ DESCRIPTION
+ This function may be used to test for the presence of NULL elements
+ of an array. Specifically, it returns a Char_Type array of
+ with the same number of elements and dimensionality of the input
+ array. If an element of the input array is NULL, then the
+ corresponding element of the output array will be set to 1,
+ otherwise it will be set to 0.
+
+ EXAMPLE
+ Set all NULL elements of a string array `A' to the empty
+ string `""':
+
+ Awhere(_isnull(A)) = "";
+
+
+ NOTES
+ It is important to understand the difference between `A==NULL'
+ and `_isnull(A)'. The latter tests all elements of `A'
+ against NULL, whereas the former only tests `A' itself.
+
+ SEE ALSO
+ where, array_map
+
+--------------------------------------------------------------
+
+length
+
+ SYNOPSIS
+ Get the length of an object
+
+ USAGE
+ Integer_Type length (obj)
+
+ DESCRIPTION
+ The `length' function may be used to get information about the
+ length of an object. For simple scalar data-types, it returns 1.
+ For arrays, it returns the total number of elements of the array.
+
+ NOTES
+ If `obj' is a string, `length' returns 1 because a
+ String_Type object is considered to be a scalar. To get the
+ number of characters in a string, use the `strlen' function.
+
+ SEE ALSO
+ array_info, array_shape, typeof, strlen
+
+--------------------------------------------------------------
+
+max
+
+ SYNOPSIS
+ Get the maximum value of an array
+
+ USAGE
+ result = max (Array_Type a ,Int_Type dim)
+
+ DESCRIPTION
+ The `max' function examines the elements of a numeric array and
+ returns the value of the largest element. If a second argument is
+ given, then it specifies the dimension of the array to be searched.
+ In this case, an array of dimension one less than that of the input array
+ will be returned with the corresponding elements in the specified
+ dimension replaced by the maximum value in that dimension.
+
+ EXAMPLE
+ Consider the 2-d array
+
+ 1 2 3 4 5
+ 6 7 8 9 10
+
+ generated by
+
+ a = _reshape (1:10, 2, 5);
+
+ Then `max(a)' will return `10', and `max(a,0)' will return
+ a 1-d array with elements
+
+ 6 7 8 9 10
+
+
+ NOTES
+ This function ignores NaNs in the input array.
+
+ SEE ALSO
+ min, maxabs, sum, reshape
+
+--------------------------------------------------------------
+
+maxabs
+
+ SYNOPSIS
+ Get the maximum absolute value of an array
+
+ USAGE
+ result = maxabs (Array_Type a ,Int_Type dim)
+
+ DESCRIPTION
+ The `maxabs' function behaves like the `max' function
+ except that it returns the maximum absolute value of the array. That
+ is, `maxabs(x)' is equivalent to `max(abs(x)'. See the
+ documentation for the `max' function for more information.
+
+ SEE ALSO
+ min, max, minabs
+
+--------------------------------------------------------------
+
+min
+
+ SYNOPSIS
+ Get the minimum value of an array
+
+ USAGE
+ result = min (Array_Type a ,Int_Type dim)
+
+ DESCRIPTION
+ The `min' function examines the elements of a numeric array and
+ returns the value of the smallest element. If a second argument is
+ given, then it specifies the dimension of the array to be searched.
+ In this case, an array of dimension one less than that of the input array
+ will be returned with the corresponding elements in the specified
+ dimension replaced by the minimum value in that dimension.
+
+ EXAMPLE
+ Consider the 2-d array
+
+ 1 2 3 4 5
+ 6 7 8 9 10
+
+ generated by
+
+ a = _reshape (1:10, 2, 5);
+
+ Then `min(a)' will return `1', and `min(a,0)' will return
+ a 1-d array with elements
+
+ 1 2 3 4 5
+
+
+ NOTES
+ This function ignores NaNs in the input array.
+
+ SEE ALSO
+ max, sum, reshape
+
+--------------------------------------------------------------
+
+minabs
+
+ SYNOPSIS
+ Get the minimum absolute value of an array
+
+ USAGE
+ result = minabs (Array_Type a ,Int_Type dim)
+
+ DESCRIPTION
+ The `minabs' function behaves like the `min' function
+ except that it returns the minimum absolute value of the array. That
+ is, `minabs(x)' is equivalent to `min(abs(x)'. See the
+ documentation for the `min' function for more information.
+
+ SEE ALSO
+ min, max, maxabs
+
+--------------------------------------------------------------
+
+prod
+
+ SYNOPSIS
+ Compute the product of the elements of an array
+
+ USAGE
+ result = prod (Array_Type a , Int_Type dim)
+
+ DESCRIPTION
+ The `prod' function computes the product of the elements of a
+ numeric array and returns the result. If a second argument is
+ given, then it specifies the dimension of the array over which the
+ product is to be taken. In this case, an array of dimension one
+ less than that of the input array will be returned.
+
+ If the input array is an integer type, then the resulting value will
+ be a Double_Type. If the input array is a
+ Complex_Type, then the result will be a Complex_Type.
+
+ SEE ALSO
+ sum, sumsq
+
+--------------------------------------------------------------
+
+_reshape
+
+ SYNOPSIS
+ Copy an array to a new shape
+
+ USAGE
+ Array_Type _reshape (Array_Type A, Array_Type I)
+
+ DESCRIPTION
+ The `_reshape' function creates a copy of an array `A',
+ reshapes it to the form specified by `I' and returns the result.
+ The elements of `I' specify the new dimensions of the copy of
+ `A' and must be consistent with the number of elements `A'.
+
+ EXAMPLE
+ If `A' is a `100' element 1-d array, a new 2-d array of
+ size `20' by `5' may be created from the elements of `A'
+ by
+
+ B = _reshape (A, 20, 5);
+
+
+ NOTES
+ The `reshape' function performs a similar function to
+ `_reshape'. In fact, the `_reshape' function could have been
+ implemented via:
+
+ define _reshape (a, i)
+ {
+ a = @a; % Make a new copy
+ reshape (a, i);
+ return a;
+ }
+
+
+ SEE ALSO
+ reshape, array_shape, array_info
+
+--------------------------------------------------------------
+
+reshape
+
+ SYNOPSIS
+ Reshape an array
+
+ USAGE
+ reshape (Array_Type A, Array_Type I)
+
+ DESCRIPTION
+ The `reshape' function changes the shape of `A' to have the
+ shape specified by the 1-d integer array `I'. The elements of `I'
+ specify the new dimensions of `A' and must be consistent with
+ the number of elements `A'.
+
+ EXAMPLE
+ If `A' is a `100' element 1-d array, it can be changed to a
+ 2-d `20' by `5' array via
+
+ reshape (A, 20, 5);
+
+ However, `reshape(A, 11,5)' will result in an error because
+ the `11,5' array specifies `55' elements.
+
+ NOTES
+ Since `reshape' modifies the shape of an array, and arrays are
+ treated as references, then all references to the array will
+ reference the new shape. If this effect is unwanted, then use the
+ `_reshape' function instead.
+
+ SEE ALSO
+ _reshape, array_info, array_shape
+
+--------------------------------------------------------------
+
+set_default_sort_method
+
+ SYNOPSIS
+ Set the default sorting method
+
+ USAGE
+ set_default_sort_method (String_Type method)
+
+ DESCRIPTION
+ This function may be used to set the default sorting method used by
+ `array_sort'. The following methods are supported:
+
+ "msort" Merge-Sort
+ "qsort" Quick-Sort
+
+
+ SEE ALSO
+ get_default_sort_method, array_sort
+
+--------------------------------------------------------------
+
+sum
+
+ SYNOPSIS
+ Sum over the elements of an array
+
+ USAGE
+ result = sum (Array_Type a , Int_Type dim)
+
+ DESCRIPTION
+ The `sum' function sums over the elements of a numeric array and
+ returns its result. If a second argument is given, then it
+ specifies the dimension of the array to be summed over. In this
+ case, an array of dimension one less than that of the input array
+ will be returned.
+
+ If the input array is an integer type, then the resulting value will
+ be a Double_Type. If the input array is a Float_Type,
+ then the result will be a Float_Type.
+
+ EXAMPLE
+ The mean of an array `a' of numbers is
+
+ sum(a)/length(a)
+
+
+ SEE ALSO
+ cumsum, sumsq, transpose, reshape
+
+--------------------------------------------------------------
+
+sumsq
+
+ SYNOPSIS
+ Sum over the squares of the elements of an array
+
+ USAGE
+ result = sumsq (Array_Type a , Int_Type dim)
+
+ DESCRIPTION
+ The `sumsq' function sums over the squares of the elements of a
+ numeric array and returns its result. If a second argument is
+ given, then it specifies the dimension of the array to be summed
+ over. In this case, an array of dimension one less than that of the
+ input array will be returned.
+
+ If the input array is an integer type, then the resulting value will
+ be a Double_Type. If the input array is a Float_Type,
+ then the result will be a Float_Type.
+
+ For complex arrays, the sum will be over the squares of the moduli of
+ the complex elements.
+
+ SEE ALSO
+ cumsum, sumsq, hypot, transpose, reshape
+
+--------------------------------------------------------------
+
+transpose
+
+ SYNOPSIS
+ Transpose an array
+
+ USAGE
+ Array_Type transpose (Array_Type a)
+
+ DESCRIPTION
+ The `transpose' function returns the transpose of a specified
+ array. By definition, the transpose of an array, say one with
+ elements `ai,j,...k' is an array whose elements are
+ `ak,...,j,i'.
+
+ SEE ALSO
+ _reshape, reshape, sum, array_info, array_shape
+
+--------------------------------------------------------------
+
+where
+
+ USAGE
+ Array_Type where (Array_Type a , Ref_Type jp)
+
+ DESCRIPTION
+ The `where' function examines a numeric array `a' and
+ returns an integer array giving the indices of `a'
+ where the corresponding element of `a' is non-zero. The
+ function accepts an optional Ref_Type argument that will be
+ set to complement set of indices, that is, the indices where
+ `a' is zero. In fact
+
+ i = where (a);
+ j = where (not a);
+
+ and
+
+ i = where (a, &j);
+
+ are equivalent, but the latter form is preferred since it executes
+ about twice as fast as the former.
+
+ The `where' function can also be used with relational operators
+ and with the boolean binary `or' and `and' operators, e.g.,
+
+ a = where (array == "a string");
+ a = where (array <= 5);
+ a = where (2 <= array <= 10);
+ a = where ((array == "a string") or (array == "another string"));
+
+ Using in the last example the short-circuiting `||' and
+ `&&' operators, will result in a `TypeMismatchError' exception.
+
+ Although this function may appear to be simple or even trivial, it
+ is arguably one of the most important and powerful functions for
+ manipulating arrays.
+
+ EXAMPLE
+ Consider the following:
+
+ variable X = 0.0:10.0:0.01;
+ variable A = sin (X);
+ variable I = where (A < 0.0);
+ AI = cos (X) I;
+
+ Here the variable `X' has been assigned an array of doubles
+ whose elements range from `0.0' through `10.0' in
+ increments of `0.01'. The second statement assigns `A' to
+ an array whose elements are the `sin' of the elements of `X'.
+ The third statement uses the `where' function to get the indices of
+ the elements of `A' that are less than 0. Finally, the
+ last statement replaces those elements of `A' by the cosine of the
+ corresponding elements of `X'.
+
+ NOTES
+ Support for the optional argument was added to version 2.1.0.
+
+ SEE ALSO
+ wherefirst, wherelast, wherenot, wherediff, array_info, array_shape, _isnull
+
+--------------------------------------------------------------
+
+wherediff
+
+ SYNOPSIS
+ Get the indices where adjacent elements differ
+
+ USAGE
+ Array_Type wherediff (Array_Type A , Ref_Type jp)
+
+ DESCRIPTION
+ This function returns an array of the indices where adjacent
+ elements of the array `A' differ. If the optional second
+ argument is given, it must be a reference to a variable whose value
+ will be set to the complement indices (those where adjacient
+ elements are the same).
+
+ The returned array of indices will consist of those elements
+ `i' where `Ai != Ai-1'. Since no element preceeds the
+ 0th element, `A0' differs from its non-existing
+ preceeding element; hence the index `0' will a member of the
+ returned array.
+
+ EXAMPLE
+ Suppose that `A = 1, 1, 3, 0, 0, 4, 7, 7'. Then,
+
+ i = wherediff (A, &j);
+
+ will result in `i = 0, 2, 3, 5, 6' and `j = 1, 4, 7'.
+
+ NOTES
+ Higher dimensional arrays are treated as a 1-d array of contiguous
+ elements.
+
+ SEE ALSO
+ where, wherenot
+
+--------------------------------------------------------------
+
+wherefirst
+
+ SYNOPSIS
+ Get the index of the first non-zero array element
+
+ USAGE
+ Int_Type wherefirst (Array_Type a ,start_index)
+
+ DESCRIPTION
+ The `wherefirst' function returns the index of the first
+ non-zero element of a specified array. If the optional parameter
+ `start_index' is given, the search will take place starting
+ from that index. If a non-zero element is not found, the function
+ will return NULL.
+
+ NOTES
+ The single parameter version of this function is equivalent to
+
+ define wherefirst (a)
+ {
+ variable i = where (a);
+ if (length(i))
+ return i0;
+ else
+ return NULL;
+ }
+
+
+ SEE ALSO
+ where, wherelast, wherfirstmin, wherfirstmax, wherefirst_eq
+
+--------------------------------------------------------------
+
+wherefirst_eq, wherefirst_ne, wherefirst_ge, wherefirst_gt, wherefirst_le, wherefirst_lt, wherelast_eq, wherelast_ne, wherelast_ge, wherelast_gt, wherelast_le, wherelast_lt
+
+ SYNOPSIS
+ Get the first or last matching element of an array
+
+ USAGE
+ Int_Type wherefirst_eq (A, b ,istart)
+ Int_Type wherefirst_ne (A, b ,istart)
+ Int_Type wherefirst_ge (A, b ,istart)
+ Int_Type wherefirst_gt (A, b ,istart)
+ Int_Type wherefirst_le (A, b ,istart)
+ Int_Type wherefirst_lt (A, b ,istart)
+ Int_Type wherelast_eq (A, b ,istart)
+ Int_Type wherelast_ne (A, b ,istart)
+ Int_Type wherelast_ge (A, b ,istart)
+ Int_Type wherelast_gt (A, b ,istart)
+ Int_Type wherelast_le (A, b ,istart)
+ Int_Type wherelast_lt (A, b ,istart)
+
+ DESCRIPTION
+ These functions perform the indicated binary operation between the
+ elements of numeric array `A' and a number `b'. The
+ `wherefirst_*' functions return the index of the first element for which the
+ comparison is true. The `wherelast_*' functions return the last
+ index where the binary operation is true. If no matching elements are
+ found, the functions return NULL.
+
+ If the optional third parameter, `istart', is given, then it
+ indicates the index into the array where the search is to start.
+
+ These functions have the following equivalent forms:
+
+ wherefirst_eq (A, b, istart) <==> wherefirst (A == b, istart)
+ wherefirst_ne (A, b, istart) <==> wherefirst (A != b, istart)
+ wherefirst_ge (A, b, istart) <==> wherefirst (A >= b, istart)
+ wherefirst_gt (A, b, istart) <==> wherefirst (A > b, istart)
+ wherefirst_le (A, b, istart) <==> wherefirst (A <= b, istart)
+ wherefirst_lt (A, b, istart) <==> wherefirst (A < b, istart)
+
+ wherelast_eq (A, b, istart) <==> wherelast (A == b, istart)
+ wherelast_ne (A, b, istart) <==> wherelast (A != b, istart)
+ wherelast_ge (A, b, istart) <==> wherelast (A >= b, istart)
+ wherelast_gt (A, b, istart) <==> wherelast (A > b, istart)
+ wherelast_le (A, b, istart) <==> wherelast (A <= b, istart)
+ wherelast_lt (A, b, istart) <==> wherelast (A < b, istart)
+
+ However, the `wherefirst_*' and `wherelast_*' function can
+ execute several orders of magnitude faster, depending upon the context.
+
+ NOTES
+ The current implementation of these functions is limited to numeric
+ types.
+
+ SEE ALSO
+ wherefirst, wherelast
+
+wherefirstmax
+
+ SYNOPSIS
+ Get the index of the first maximum array value
+
+ USAGE
+ Int_Type wherefirstmax (Array_Type a)
+
+ DESCRIPTION
+ This function is equivalent to
+
+ index = wherefirst (a == max(a));
+
+ It executes about 3 times faster, and does not require the creation of
+ temporary arrays.
+
+ SEE ALSO
+ wherefirst, wherefirstmax, wherelastmin, min, max
+
+--------------------------------------------------------------
+
+wherefirstmin
+
+ SYNOPSIS
+ Get the index of the first minimum array value
+
+ USAGE
+ Int_Type wherefirstmin (Array_Type a)
+
+ DESCRIPTION
+ This function is equivalent to
+
+ index = wherefirst (a == min(a));
+
+ It executes about 3 times faster, and does not require the creation of
+ temporary arrays.
+
+ SEE ALSO
+ wherefirst, wherelastmin, wherefirstmax, min, max
+
+--------------------------------------------------------------
+
+wherelast
+
+ SYNOPSIS
+ Get the index of the last non-zero array element
+
+ USAGE
+ Int_Type wherelast (Array_Type a ,start_index)
+
+ DESCRIPTION
+ The `wherelast' function returns the index of the last
+ non-zero element of a specified array. If the optional parameter
+ `start_index' is given, the backward search will take place starting
+ from that index. If a non-zero element is not found, the function
+ will return NULL.
+
+ NOTES
+ The single parameter version of this function is equivalent to
+
+ define wherelast (a)
+ {
+ variable i = where (a);
+ if (length(i))
+ return i-1;
+ else
+ return NULL;
+ }
+
+
+ SEE ALSO
+ where, wherefirst, wherelastmin, wherelastmax, wherefirst_eq
+
+--------------------------------------------------------------
+
+wherelastmax
+
+ SYNOPSIS
+ Get the index of the last maximum array value
+
+ USAGE
+ Int_Type wherelastmax (Array_Type a)
+
+ DESCRIPTION
+ This function is equivalent to
+
+ index = wherelast (a == max(a));
+
+ It executes about 3 times faster, and does not require the creation of
+ temporary arrays.
+
+ SEE ALSO
+ wherelast, wherefirstmin, wherelastmin, min, max
+
+--------------------------------------------------------------
+
+wherelastmin
+
+ SYNOPSIS
+ Get the index of the last minimum array value
+
+ USAGE
+ Int_Type wherelastmin (Array_Type a)
+
+ DESCRIPTION
+ This function is equivalent to
+
+ index = wherelast (a == min(a));
+
+ It executes about 3 times faster, and does not require the creation of
+ temporary arrays.
+
+ SEE ALSO
+ wherelast, wherefirstmin, wherelastmax, min, max
+
+--------------------------------------------------------------
+
+wherenot
+
+ SYNOPSIS
+ Get indices where a numeric array is 0
+
+ USAGE
+ Array_Type wherenot (Array_Type a)
+
+ DESCRIPTION
+ This function is equivalent to `where(not a)'. See the
+ documentation for `where' for more information.
+
+ SEE ALSO
+ where, wherediff, wherefirst, wherelast
+
+--------------------------------------------------------------
+
+assoc_delete_key
+
+ SYNOPSIS
+ Delete a key from an Associative Array
+
+ USAGE
+ assoc_delete_key (Assoc_Type a, String_Type k)
+
+ DESCRIPTION
+ The `assoc_delete_key' function deletes a key given by `k'
+ from the associative array `a'. If the specified key does not
+ exist in `a', then this function has no effect.
+
+ SEE ALSO
+ assoc_key_exists, assoc_get_keys
+
+--------------------------------------------------------------
+
+assoc_get_keys
+
+ SYNOPSIS
+ Return all the key names of an Associative Array
+
+ USAGE
+ String_Type assoc_get_keys (Assoc_Type a)
+
+ DESCRIPTION
+ This function returns all the key names of an associative array
+ `a' as an ordinary one dimensional array of strings. If the
+ associative array contains no keys, an empty array will be returned.
+
+ SEE ALSO
+ assoc_get_values, assoc_key_exists, assoc_delete_key, length
+
+--------------------------------------------------------------
+
+assoc_get_values
+
+ SYNOPSIS
+ Return all the values of an Associative Array
+
+ USAGE
+ Array_Type assoc_get_values (Assoc_Type a)
+
+ DESCRIPTION
+ This function returns all the values in the associative array
+ `a' as an array of proper type. If the associative array
+ contains no keys, an empty array will be returned.
+
+ EXAMPLE
+ Suppose that `a' is an associative array of type
+ Integer_Type, i.e., it was created via
+
+ variable a = Assoc_TypeInteger_Type;
+
+ Then the following may be used to print the values of the array in
+ ascending order:
+
+ define print_sorted_values (a)
+ {
+ variable v = assoc_get_values (a);
+ variable i = array_sort (v);
+ v = vi;
+ foreach (v)
+ {
+ variable vi = ();
+ () = fprintf (stdout, "%d\n", vi);
+ }
+ }
+
+
+ SEE ALSO
+ assoc_get_keys, assoc_key_exists, assoc_delete_key, array_sort
+
+--------------------------------------------------------------
+
+assoc_key_exists
+
+ SYNOPSIS
+ Check to see whether a key exists in an Associative Array
+
+ USAGE
+ Integer_Type assoc_key_exists (Assoc_Type a, String_Type k)
+
+ DESCRIPTION
+ The `assoc_key_exists' function may be used to determine whether
+ or not a specified key `k' exists in an associative array `a'.
+ It returns 1 if the key exists, or 0 if it does not.
+
+ SEE ALSO
+ assoc_get_keys, assoc_get_values, assoc_delete_key
+
+--------------------------------------------------------------
+
+array_to_bstring
+
+ SYNOPSIS
+ Convert an array to a binary string
+
+ USAGE
+ BString_Type array_to_bstring (Array_Type a)
+
+ DESCRIPTION
+ The `array_to_bstring' function returns the elements of an
+ array `a' as a binary string.
+
+ SEE ALSO
+ bstring_to_array, init_char_array
+
+--------------------------------------------------------------
+
+bstring_to_array
+
+ SYNOPSIS
+ Convert a binary string to an array of bytes
+
+ USAGE
+ UChar_Type bstring_to_array (BString_Type b)
+
+ DESCRIPTION
+ The `bstring_to_array' function returns an array of unsigned
+ characters whose elements correspond to the bytes in the
+ binary string.
+
+ SEE ALSO
+ array_to_bstring, init_char_array
+
+--------------------------------------------------------------
+
+bstrcat
+
+ SYNOPSIS
+ Concatenate binary strings
+
+ USAGE
+ String_Type bstrcat (BString_Type a_1, ..., BString_Type a_N)
+
+ DESCRIPTION
+ The `bstrcat' function concatenates its N binary string
+ arguments `a_1', ... `a_N' together and returns the result.
+
+ NOTES
+ This function will produce a result that is identical to that of
+ `strcat' if the input strings do not contain null characters.
+
+ SEE ALSO
+ strcat, bstrjoin
+
+--------------------------------------------------------------
+
+bstrjoin
+
+ SYNOPSIS
+ Concatenate elements of an array of BString_Type objects
+
+ USAGE
+ String_Type bstrjoin (Array_Type a , BString_Type delim)
+
+ DESCRIPTION
+ The `bstrjoin' function operates on an array of binary strings
+ by joining successive elements together separated with the optional
+ delimiter `delim'. If `delim' is not specified, then
+ empty string `""' will be used resulting in a concatenation of
+ the elements.
+
+ SEE ALSO
+ bstrcat, strjoin
+
+--------------------------------------------------------------
+
+bstrlen
+
+ SYNOPSIS
+ Get the length of a binary string
+
+ USAGE
+ UInt_Type bstrlen (BString_Type s)
+
+ DESCRIPTION
+ The `bstrlen' function may be used to obtain the length of a
+ binary string. A binary string differs from an ordinary string (a C
+ string) in that a binary string may include null characters.
+
+ EXAMPLE
+
+ s = "hello\0";
+ len = bstrlen (s); % ==> len = 6
+ len = strlen (s); % ==> len = 5
+
+
+ SEE ALSO
+ strlen, length
+
+--------------------------------------------------------------
+
+count_byte_occurrences
+
+ SYNOPSIS
+ Count the number of occurrences of a byte in a binary string
+
+ USAGE
+ UInt_Type count_byte_occurrences (bstring, byte)
+
+ DESCRIPTION
+ This function returns the number of times the specified byte
+ occurs in the binary string `bstr'.
+
+ NOTES
+ This function uses byte-semantics. If character semantics are
+ desired, use the `count_char_occurrences' function.
+
+ SEE ALSO
+ count_char_occurrences
+
+--------------------------------------------------------------
+
+is_substrbytes
+
+ SYNOPSIS
+ test if a binary string contains a series of bytes
+
+ USAGE
+ Int_Type is_substrbytes (a, b ,ofs)
+
+ DESCRIPTION
+This function may be used to see if the binary string `a'
+contains the byte-sequence given by the binary string `b'. If
+`b' is contained in `a', then a ones-based offset of the
+first occurance of `b' in `a' is returned. Otherwise, the
+function will return 0 to indicate that `a' does not contain
+`b'.
+
+An optional 1-based parameter `ofs' may be passed to the function
+to indicate where in `a' the search is to start. The returned
+value is still a 1-based offset from the beginning of `a' where
+`b' is located.
+
+ NOTES
+ Support for the optional argument was added in version 2.3.0.
+
+ SEE ALSO
+ is_substr, count_byte_occurrences
+
+--------------------------------------------------------------
+
+pack
+
+ SYNOPSIS
+ Pack objects into a binary string
+
+ USAGE
+ BString_Type pack (String_Type fmt, ...)
+
+ DESCRIPTION
+ The `pack' function combines zero or more objects (represented
+ by the ellipses above) into a binary string according to the format
+ string `fmt'.
+
+ The format string consists of one or more data-type specification
+ characters defined by the following table:
+
+ c signed byte
+ C unsigned byte
+ h short
+ H unsigned short
+ i int
+ I unsigned int
+ l long
+ L unsigned long
+ m long long
+ M unsigned long long
+ j 16 bit int
+ J 16 bit unsigned int
+ k 32 bit int
+ K 32 bit unsigned int
+ q 64 bit int
+ Q 64 bit unsigned int
+ f float
+ d double
+ F 32 bit float
+ D 64 bit float
+ s character string, null padded
+ S character string, space padded
+ z character string, null padded
+ x a null pad character
+
+ A decimal length specifier may follow the data-type specifier. With
+ the exception of the `s' and `S' specifiers, the length
+ specifier indicates how many objects of that data type are to be
+ packed or unpacked from the string. When used with the `s',
+ `S', or `z' specifiers, it indicates the field width to be
+ used. If the length specifier is not present, the length defaults
+ to one.
+
+ When packing, unlike the `s' specifier, the `z' specifier
+ guarantees that at least one null byte will be written even if the
+ field has to be truncated to do so.
+
+ With the exception of `c', `C', `s', `S', and
+ `x', each of these may be prefixed by a character that indicates
+ the byte-order of the object:
+
+ > big-endian order (network order)
+ < little-endian order
+ = native byte-order
+
+ The default is to use native byte order.
+
+ When unpacking via the `unpack' function, if the length
+ specifier is greater than one, then an array of that length will be
+ returned. In addition, trailing whitespace and null characters are
+ stripped when unpacking an object given by the `S' specifier.
+ Trailing null characters will be stripped from an object represented
+ by the `z' specifier. No such stripping is performed by the `s'
+ specifier.
+
+ EXAMPLE
+
+ a = pack ("cc", 'A', 'B'); % ==> a = "AB";
+ a = pack ("c2", 'A', 'B'); % ==> a = "AB";
+ a = pack ("xxcxxc", 'A', 'B'); % ==> a = "\0\0A\0\0B";
+ a = pack ("h2", 'A', 'B'); % ==> a = "\0A\0B" or "\0B\0A"
+ a = pack (">h2", 'A', 'B'); % ==> a = "\0\xA\0\xB"
+ a = pack ("<h2", 'A', 'B'); % ==> a = "\0B\0A"
+ a = pack ("s4", "AB", "CD"); % ==> a = "AB\0\0"
+ a = pack ("s4s2", "AB", "CD"); % ==> a = "AB\0\0CD"
+ a = pack ("S4", "AB", "CD"); % ==> a = "AB "
+ a = pack ("S4S2", "AB", "CD"); % ==> a = "AB CD"
+ a = pack ("z4", "AB"); % ==> a = "AB\0\0"
+ a = pack ("s4", "ABCDEFG"); % ==> a = "ABCD"
+ a = pack ("z4", "ABCDEFG"); % ==> a = "ABC\0"
+
+
+ SEE ALSO
+ unpack, sizeof_pack, pad_pack_format, sprintf
+
+--------------------------------------------------------------
+
+pad_pack_format
+
+ SYNOPSIS
+ Add padding to a pack format
+
+ USAGE
+ BString_Type pad_pack_format (String_Type fmt)
+
+ DESCRIPTION
+ The `pad_pack_format' function may be used to add the
+ appropriate padding characters to the format `fmt' such that the
+ data types specified by the format will be properly aligned on word
+ boundaries. This is especially important when reading or writing files
+ that assume the native alignment.
+
+ SEE ALSO
+ pack, unpack, sizeof_pack
+
+--------------------------------------------------------------
+
+sizeof_pack
+
+ SYNOPSIS
+ Compute the size implied by a pack format string
+
+ USAGE
+ UInt_Type sizeof_pack (String_Type fmt)
+
+ DESCRIPTION
+ The `sizeof_pack' function returns the size of the binary string
+ represented by the format string `fmt'. This information may be
+ needed when reading a structure from a file.
+
+ SEE ALSO
+ pack, unpack, pad_pack_format
+
+--------------------------------------------------------------
+
+unpack
+
+ SYNOPSIS
+ Unpack Objects from a Binary String
+
+ USAGE
+ (...) = unpack (String_Type fmt, BString_Type s)
+
+ DESCRIPTION
+ The `unpack' function unpacks objects from a binary string
+ `s' according to the format `fmt' and returns the objects to
+ the stack in the order in which they were unpacked. See the
+ documentation of the `pack' function for details about the
+ format string.
+
+ EXAMPLE
+
+ (x,y) = unpack ("cc", "AB"); % ==> x = 'A', y = 'B'
+ x = unpack ("c2", "AB"); % ==> x = 'A', 'B'
+ x = unpack ("x<H", "\0\xAB\xCD"); % ==> x = 0xCDABuh
+ x = unpack ("xxs4", "a b c\0d e f"); % ==> x = "b c\0"
+ x = unpack ("xxS4", "a b c\0d e f"); % ==> x = "b c"
+
+
+ SEE ALSO
+ pack, sizeof_pack, pad_pack_format
+
+--------------------------------------------------------------
+
+Assoc_Type
+
+ SYNOPSIS
+ An associative array or hash type
+
+ DESCRIPTION
+ An Assoc_Type object is like an array except that it is
+ indexed using strings and not integers. Unlike an Array_Type
+ object, the size of an associative array is not fixed, but grows as
+ objects are added to the array. Another difference is that ordinary
+ arrays represent ordered object; however, the ordering of the
+ elements of an `Assoc_Type' object is unspecified.
+
+ An Assoc_Type object whose elements are of some data-type
+ `d' may be created using using
+
+ A = Assoc_Typed;
+
+ For example,
+
+ A = Assoc_TypeInt_Type;
+
+ will create an associative array of integers. To create an
+ associative array capable of storing an arbitrary type, use the form
+
+ A = Assoc_Type;
+
+
+ An optional parameter may be used to specify a default value for
+ array elements. For example,
+
+ A = Assoc_TypeInt_Type, -1;
+
+ creates an integer-valued associative array with a default element
+ value of -1. Then `A"foo"' will return -1 if the key
+ `"foo"' does not exist in the array. Default values are
+ available only if the type was specified when the associative array
+ was created.
+
+ The following functions may be used with associative arrays:
+
+ assoc_get_keys
+ assoc_get_values
+ assoc_key_exists
+ assoc_delete_key
+
+ The `length' function may be used to obtain the number of
+ elements in the array.
+
+ The `foreach' construct may be used with associative arrays via
+ one of the following forms:
+
+ foreach k,v (A) {...}
+ foreach k (A) using ("keys") { ... }
+ foreach v (A) using ("values") { ... }
+ foreach k,v (A) using ("keys", "values") { ... }
+
+ In all the above forms, the loop is over all elements of the array
+ such that `v=Ak'.
+
+ SEE ALSO
+ List_Type, Array_Type, Struct_Type
+
+--------------------------------------------------------------
+
+File_Type
+
+ SYNOPSIS
+ A type representing a C stdio object
+
+ DESCRIPTION
+ An File_Type is the interpreter's representation of a C
+ stdio FILE object and is usually created using the `fopen'
+ function, i.e.,
+
+ fp = fopen ("file.dat", "r");
+
+ Functions that utilize the File_Type include:
+
+ fopen
+ fclose
+ fgets
+ fputs
+ ferror
+ feof
+ fflush
+ fprintf
+ fseek
+ ftell
+ fread
+ fwrite
+ fread_bytes
+
+ The `foreach' construct may be used with File_Type
+ objects via one of the following forms:
+
+ foreach line (fp) {...}
+ foreach byte (A) using ("char") { ... } % read bytes
+ foreach line (A) using ("line") { ... } % read lines (default)
+ foreach line (A) using ("wsline") { ... } % whitespace stripped from lines
+
+
+ SEE ALSO
+ List_Type, Array_Type, Struct_Type
+
+--------------------------------------------------------------
+
+List_Type
+
+ SYNOPSIS
+ A list object
+
+ DESCRIPTION
+ An object of type `List_Type' represents a list, which is
+ defined as an ordered heterogeneous collection of objects.
+ A list may be created using, e.g.,
+
+ empty_list = {};
+ list_with_4_items = {1:10, "three", 9, {1,2,3}};
+
+ Note that the last item of the list in the last example is also a
+ list. A List_Type object may be manipulated by the following
+ functions:
+
+ list_new
+ list_insert
+ list_append
+ list_delete
+ list_reverse
+ list_pop
+
+ A `List_Type' object may be indexed using an array syntax with
+ the first item on the list given by an index of 0. The
+ `length' function may be used to obtain the number of elements
+ in the list.
+
+ A copy of the list may be created using the @ operator, e.g.,
+ `copy = @list'.
+
+ The `foreach' statement may be used with a List_Type
+ object to loop over its elements:
+
+ foreach elem (list) {....}
+
+
+ SEE ALSO
+ Array_Type, Assoc_Type, Struct_Type
+
+--------------------------------------------------------------
+
+String_Type
+
+ SYNOPSIS
+ A string object
+
+ DESCRIPTION
+ An object of type `String_Type' represents a string of bytes or
+ characters, which in general have different semantics depending upon
+ the UTF-8 mode.
+
+ The string obeys byte-semantics when indexed as an
+ array. That is, `S0' will return the first byte of the
+ string `S'. For character semantics, the nth character in the
+ string may be obtained using `substr' function.
+
+ The `foreach' statement may be used with a String_Type
+ object `S' to loop over its bytes:
+
+ foreach b (S) {....}
+ foreach b (S) using ("bytes") {....}
+
+ To loop over its characters, the following form may be used:
+
+ foreach c (S) using ("chars") {...}
+
+ When UTF-8 mode is not in effect, the byte and character forms will
+ produce the same sequence. Otherwise, the string will be decoded
+ to generate the (wide) character sequence. If the string contains
+ an invalid UTF-8 encoded character, successive bytes of the invalid
+ sequence will be returned as negative integers. For example,
+ `"a\xAB\x{AB}"' specifies a string composed of the character
+ `a', a byte `0xAB', and the character `0xAB'. In
+ this case,
+
+ foreach c ("a\xAB\x{AB}") {...}
+
+ will produce the integer-valued sequence `'a', -0xAB, 0xAB'.
+
+ SEE ALSO
+ Array_Type, _slang_utf8_ok
+
+--------------------------------------------------------------
+
+Struct_Type
+
+ SYNOPSIS
+ A structure datatype
+
+ DESCRIPTION
+ A Struct_Type object with fields `f1', `f2',...,
+ `fN' may be created using
+
+ s = struct { f1, f2, ..., fN };
+
+ The fields may be accessed via the "dot" operator, e.g.,
+
+ s.f1 = 3;
+ if (s12.f1 == 4) s.f1++;
+
+ By default, all fields will be initialized to NULL.
+
+ A structure may also be created using the dereference operator (@):
+
+ s = @Struct_Type ("f1", "f2", ..., "fN");
+ s = @Struct_Type ( "f1", "f2", ..., "fN" );
+
+ Functions for manipulating structure fields include:
+
+ _push_struct_field_values
+ get_struct_field
+ get_struct_field_names
+ set_struct_field
+ set_struct_fields
+
+
+ The `foreach' loop may be used to loop over elements of a linked
+ list. Suppose that first structure in the list is called
+ `root', and that the `child' field is used to form the
+ chain. Then one may walk the list using:
+
+ foreach s (root) using ("child")
+ {
+ % s will take on successive values in the list
+ .
+ .
+ }
+
+ The loop will terminate when the last elements `child' field is
+ NULL. If no ``linking'' field is specified, the field name will
+ default to `next'.
+
+ User-defined data types are similar to the `Struct_Type'. A
+ type, e.g., `Vector_Type' may be created using:
+
+ typedef struct { x, y, z } Vector_Type;
+
+ Objects of this type may be created via the @ operator, e.g.,
+
+ v = @Vector_Type;
+
+ It is recommended that this be used in a function for creating such
+ types, e.g.,
+
+ define vector (x, y, z)
+ {
+ variable v = @Vector_Type;
+ v.x = x;
+ v.y = y;
+ v.z = z;
+ return v;
+ }
+
+ The action of the binary and unary operators may be defined for such
+ types. Consider the "+" operator. First define a function for
+ adding two `Vector_Type' objects:
+
+ static define vector_add (v1, v2)
+ {
+ return vector (v1.x+v2.x, v1.y+v2.y, v1.z, v2.z);
+ }
+
+ Then use
+
+ __add_binary ("+", Vector_Type, &vector_add, Vector_Type, Vector_Type);
+
+ to indicate that the function is to be called whenever the "+"
+ binary operation between two `Vector_Type' objects takes place,
+ e.g.,
+
+ V1 = vector (1, 2, 3);
+ V2 = vector (8, 9, 1);
+ V3 = V1 + V2;
+
+ will assigned the vector (9, 11, 4) to `V3'. Similarly, the
+ `"*"' operator between scalars and vectors may be defined using:
+
+ static define vector_scalar_mul (v, a)
+ {
+ return vector (a*v.x, a*v.y, a*v.z);
+ }
+ static define scalar_vector_mul (a, v)
+ {
+ return vector_scalar_mul (v, a);
+ }
+ __add_binary ("*", Vector_Type, &scalar_vector_mul, Any_Type, Vector_Type);
+ __add_binary ("*", Vector_Type, &vector_scalar_mul, Vector_Type, Any_Type);
+
+ Related functions include:
+
+ __add_unary
+ __add_string
+ __add_destroy
+
+
+ SEE ALSO
+ List_Type, Assoc_Type
+
+--------------------------------------------------------------
+
+_bofeof_info
+
+ SYNOPSIS
+ Control the generation of function callback code
+
+ USAGE
+ Int_Type _bofeof_info
+
+ DESCRIPTION
+ This value of this variable dictates whether or not the S-Lang
+ interpreter will generate code to call the beginning and end of
+ function callback handlers. The value of this variable is local to
+ the compilation unit, but is inherited by other units loaded by the
+ current unit.
+
+ If the value of this variable is 1 when a function is defined, then
+ when the function is executed, the callback handlers defined via
+ `_set_bof_handler' and `_set_eof_handler' will be called.
+
+ SEE ALSO
+ _set_bof_handler, _set_eof_handler, _boseos_info
+
+--------------------------------------------------------------
+
+_boseos_info
+
+ SYNOPSIS
+ Control the generation of BOS/EOS callback code
+
+ USAGE
+ Int_Type _boseos_info
+
+ DESCRIPTION
+ This value of this variable dictates whether or not the S-Lang
+ interpreter will generate code to call the beginning and end of
+ statement callback handlers. The value of this variable is local to
+ the compilation unit, but is inherited by other units loaded by the
+ current unit.
+
+ The lower 8 bits of `_boseos_info' controls the generation of code for
+ callbacks as follows:
+
+ Value Description
+ -----------------------------------------------------------------
+ 0 No code for making callbacks will be produced.
+ 1 Callback generation will take place for all non-branching
+ and looping statements.
+ 2 Same as for 1 with the addition that code will also be
+ generated for branching statements (if, !if, loop, ...)
+ 3 Same as 2, but also including break and continue
+ statements.
+
+ A non-branching statement is one that does not effect chain of
+ execution. Branching statements include all looping statements,
+ conditional statement, `break', `continue', and `return'.
+
+ If bit 0x100 is set, callbacks will be generated for preprocessor
+ statements.
+
+ EXAMPLE
+ Consider the following:
+
+ _boseos_info = 1;
+ define foo ()
+ {
+ if (some_expression)
+ some_statement;
+ }
+ _boseos_info = 2;
+ define bar ()
+ {
+ if (some_expression)
+ some_statement;
+ }
+
+ The function `foo' will be compiled with code generated to call the
+ BOS and EOS handlers when `some_statement' is executed. The
+ function `bar' will be compiled with code to call the handlers
+ for both `some_expression' and `some_statement'.
+
+ NOTES
+ The `sldb' debugger and `slsh''s `stkcheck.sl' make use of this
+ facility.
+
+ SEE ALSO
+ _set_bos_handler, _set_eos_handler, _bofeof_info
+
+--------------------------------------------------------------
+
+_clear_error
+
+ SYNOPSIS
+ Clear an error condition (deprecated)
+
+ USAGE
+ _clear_error ()
+
+ DESCRIPTION
+ This function has been deprecated. New code should make use of
+ try-catch exception handling.
+
+ This function may be used in error-blocks to clear the error that
+ triggered execution of the error block. Execution resumes following
+ the statement, in the scope of the error-block, that triggered the
+ error.
+
+ EXAMPLE
+ Consider the following wrapper around the `putenv' function:
+
+ define try_putenv (name, value)
+ {
+ variable status;
+ ERROR_BLOCK
+ {
+ _clear_error ();
+ status = -1;
+ }
+ status = 0;
+ putenv (sprintf ("%s=%s", name, value);
+ return status;
+ }
+
+ If `putenv' fails, it generates an error condition, which the
+ `try_putenv' function catches and clears. Thus `try_putenv'
+ is a function that returns -1 upon failure and 0 upon
+ success.
+
+ SEE ALSO
+ _trace_function, _slangtrace, _traceback
+
+--------------------------------------------------------------
+
+_get_frame_info
+
+ SYNOPSIS
+ Get information about a stack frame
+
+ USAGE
+ Struct_Type _get_frame_info (Integer_Type depth)
+
+ DESCRIPTION
+ `_get_frame_info' returns a structure with information about
+ the function call stack from of depth `depth'. The structure
+ contains the following fields:
+
+ file: The file that contains the code of the stack frame.
+ line: The line number the file the stack frame is in.
+ function: the name of the function containing the code of the stack
+ frame; it might be NULL if the code isn't inside a function.
+ locals: Array of String_Type containing the names of variables local
+ to the stack frame; it might be NULL if the stack frame doesn't
+ belong to a function.
+ namespace: The namespace the code of this stack frame is in.
+
+
+ SEE ALSO
+ _get_frame_variable, _use_frame_namespace
+
+--------------------------------------------------------------
+
+_get_frame_variable
+
+ SYNOPSIS
+ Get the value of a variable local to a stack frame
+
+ USAGE
+ Any_Type _get_frame_variable (Integer_Type depth, String_Type name)
+
+ DESCRIPTION
+ This function returns value of the variable `name' in the stack
+ frame at depth `depth'. This might not only be a local variable but
+ also variables from outer scopes, e.g., a variable private to the
+ namespace.
+
+ If no variable with this name is found an `UndefinedNameError'
+ will be thrown. An `VariableUninitializedError' will be
+ generated if the variable has no value.
+
+ SEE ALSO
+ _get_frame_info, _use_frame_namespace
+
+--------------------------------------------------------------
+
+_set_bof_handler
+
+ SYNOPSIS
+ Set the beginning of function callback handler
+
+ USAGE
+ _set_bof_handler (Ref_Type func)
+
+ DESCRIPTION
+ This function is used to set the function to be called prior to the
+ execution of the body S-Lang function but after its arguments have
+ been evaluated, provided that function was defined
+ with `_bofeof_info' set appropriately. The callback function
+ must be defined to take two parameters, the function name and the
+ filename and must return nothing.
+
+ EXAMPLE
+
+ private define bof_handler (fun, file)
+ {
+ () = fputs ("About to execute function $fun from file $file"$, stdout);
+ }
+ _set_bof_handler (&bof_handler);
+
+
+ SEE ALSO
+ _set_eof_handler, _boseos_info, _set_bos_handler
+
+--------------------------------------------------------------
+
+_set_bos_handler
+
+ SYNOPSIS
+ Set the beginning of statement callback handler
+
+ USAGE
+ _set_bos_handler (Ref_Type func)
+
+ DESCRIPTION
+ This function is used to set the function to be called prior to the
+ beginning of a statement. The function will be passed two
+ parameters: the name of the file and the line number of the statement
+ to be executed. It should return nothing.
+
+ EXAMPLE
+
+ private define bos_handler (file, line)
+ {
+ () = fputs ("About to execute $file:$line\n"$, stdout);
+ }
+ _set_bos_handler (&bos_handler);
+
+
+ NOTES
+ The beginning and end of statement handlers will be called for
+ statements in a file only if that file was compiled with the variable
+ `_boseos_info' set to a non-zero value.
+
+ SEE ALSO
+ _set_eos_handler, _boseos_info, _bofeof_info
+
+--------------------------------------------------------------
+
+_set_eof_handler
+
+ SYNOPSIS
+ Set the beginning of function callback handler
+
+ USAGE
+ _set_eof_handler (Ref_Type func)
+
+ DESCRIPTION
+ This function is used to set the function to be called at the end of
+ execution of a S-Lang function, provided that function was compiled with
+ `_bofeof_info' set accordingly.
+
+ The callback function will be passed no parameters and it must return
+ nothing.
+
+ EXAMPLE
+
+ private define eof_handler ()
+ {
+ () = fputs ("Done executing the function\n", stdout);
+ }
+ _set_eof_handler (&eof_handler);
+
+
+ SEE ALSO
+ _set_bof_handler, _bofeof_info, _boseos_info
+
+--------------------------------------------------------------
+
+_set_eos_handler
+
+ SYNOPSIS
+ Set the end of statement callback handler
+
+ USAGE
+ _set_eos_handler (Ref_Type func)
+
+ DESCRIPTION
+ This function is used to set the function to be called at the end of
+ a statement. The function will be passed no parameters and it should
+ return nothing.
+
+ EXAMPLE
+
+ private define eos_handler ()
+ {
+ () = fputs ("Done executing the statement\n", stdout);
+ }
+ _set_eos_handler (&eos_handler);
+
+
+ NOTES
+ The beginning and end of statement handlers will be called for
+ statements in a file only if that file was compiled with the variable
+ `_boseos_info' set to a non-zero value.
+
+ SEE ALSO
+ _set_bos_handler, _boseos_info, _bofeof_info
+
+--------------------------------------------------------------
+
+_slangtrace
+
+ SYNOPSIS
+ Turn function tracing on or off
+
+ USAGE
+ Integer_Type _slangtrace
+
+ DESCRIPTION
+ The `_slangtrace' variable is a debugging aid that when set to a
+ non-zero value enables tracing when function declared by
+ `_trace_function' is entered. If the value is greater than
+ zero, both intrinsic and user defined functions will get traced.
+ However, if set to a value less than zero, intrinsic functions will
+ not get traced.
+
+ SEE ALSO
+ _trace_function, _traceback, _print_stack
+
+--------------------------------------------------------------
+
+_traceback
+
+ SYNOPSIS
+ Generate a traceback upon error
+
+ USAGE
+ Integer_Type _traceback
+
+ DESCRIPTION
+ `_traceback' is an intrinsic integer variable whose bitmapped value
+ controls the generation of the call-stack traceback upon error.
+ When set to 0, no traceback will be generated. Otherwise its value
+ is the bitwise-or of the following integers:
+
+ 1 Create a full traceback
+ 2 Omit local variable information
+ 4 Generate just one line of traceback
+
+ The default value of this variable is 4.
+
+ NOTES
+ Running `slsh' with the `-g' option causes this variable to be
+ set to 1.
+
+ SEE ALSO
+ _boseos_info
+
+--------------------------------------------------------------
+
+_trace_function
+
+ SYNOPSIS
+ Set the function to trace
+
+ USAGE
+ _trace_function (String_Type f)
+
+ DESCRIPTION
+ `_trace_function' declares that the S-Lang function with name
+ `f' is to be traced when it is called. Calling
+ `_trace_function' does not in itself turn tracing on. Tracing
+ is turned on only when the variable `_slangtrace' is non-zero.
+
+ SEE ALSO
+ _slangtrace, _traceback
+
+--------------------------------------------------------------
+
+_use_frame_namespace
+
+ SYNOPSIS
+ Selects the namespace of a stack frame
+
+ USAGE
+ _use_frame_namespace (Integer_Type depth)
+
+ DESCRIPTION
+ This function sets the current namespace to the one belonging to the
+ call stack frame at depth `depth'.
+
+ SEE ALSO
+ _get_frame_info, _get_frame_variable
+
+--------------------------------------------------------------
+
+access
+
+ SYNOPSIS
+ Check to see if a file is accessible
+
+ USAGE
+ Int_Type access (String_Type pathname, Int_Type mode)
+
+ DESCRIPTION
+ This functions checks to see if the current process has access to the
+ specified pathname. The `mode' parameter determines the type of
+ desired access. Its value is given by the bitwise-or of one or more
+ of the following constants:
+
+ R_OK Check for read permission
+ W_OK Check for write permission
+ X_OK Check for execute permission
+ F_OK Check for existence
+
+
+ The function will return 0 if process has the requested access
+ permissions to the file, otherwise it will return -1 and set
+ `errno' accordingly.
+
+ Access to a file depends not only upon the file itself, but also upon
+ the permissions of each of the directories in the pathname. The
+ checks are done using the real user and group ids of the process, and
+ not using the effective ids.
+
+ SEE ALSO
+ stat_file
+
+--------------------------------------------------------------
+
+chdir
+
+ SYNOPSIS
+ Change the current working directory
+
+ USAGE
+ Int_Type chdir (String_Type dir)
+
+ DESCRIPTION
+ The `chdir' function may be used to change the current working
+ directory to the directory specified by `dir'. Upon success it
+ returns zero. Upon failure it returns `-1' and sets
+ `errno' accordingly.
+
+ SEE ALSO
+ mkdir, stat_file
+
+--------------------------------------------------------------
+
+chmod
+
+ SYNOPSIS
+ Change the mode of a file
+
+ USAGE
+ Int_Type chmod (String_Type file, Int_Type mode)
+
+ DESCRIPTION
+ The `chmod' function changes the permissions of the specified
+ file to those given by `mode'. It returns `0' upon
+ success, or `-1' upon failure setting `errno' accordingly.
+
+ See the system specific documentation for the C library
+ function `chmod' for a discussion of the `mode' parameter.
+
+ SEE ALSO
+ chown, stat_file
+
+--------------------------------------------------------------
+
+chown
+
+ SYNOPSIS
+ Change the owner of a file
+
+ USAGE
+ Int_Type chown (String_Type file, Int_Type uid, Int_Type gid)
+
+ DESCRIPTION
+ The `chown' function is used to change the user-id and group-id of
+ `file' to `uid' and `gid', respectively. It returns
+ 0 upon success and -1 upon failure, with `errno'
+ set accordingly.
+
+ NOTES
+ On most systems, only the superuser can change the ownership of a
+ file.
+
+ Some systems do not support this function.
+
+ SEE ALSO
+ lchown, chmod, stat_file
+
+--------------------------------------------------------------
+
+getcwd
+
+ SYNOPSIS
+ Get the current working directory
+
+ USAGE
+ String_Type getcwd ()
+
+ DESCRIPTION
+ The `getcwd' function returns the absolute pathname of the
+ current working directory. If an error occurs or it cannot
+ determine the working directory, it returns NULL and sets
+ `errno' accordingly.
+
+ NOTES
+ Under Unix, OS/2, and MSDOS, the pathname returned by this function
+ includes the trailing slash character. It may also include
+ the drive specifier for systems where that is meaningful.
+
+ SEE ALSO
+ mkdir, chdir, errno
+
+--------------------------------------------------------------
+
+hardlink
+
+ SYNOPSIS
+ Create a hard-link
+
+ USAGE
+ Int_Type hardlink (String_Type oldpath, String_Type newpath)
+
+ DESCRIPTION
+ The `hardlink' function creates a hard-link called
+ `newpath' to the existing file `oldpath'. If the link was
+ successfully created, the function will return 0. Upon error, the
+ function returns -1 and sets `errno' accordingly.
+
+ NOTES
+ Not all systems support the concept of a hard-link.
+
+ SEE ALSO
+ symlink
+
+--------------------------------------------------------------
+
+lchown
+
+ SYNOPSIS
+ Change the owner of a file
+
+ USAGE
+ Int_Type lchown (String_Type file, Int_Type uid, Int_Type gid)
+
+ DESCRIPTION
+ The `lchown' function is like `chown', except that it does
+ not dereference a symbolic link. Hence, it may be used to change
+ the ownership of a symbolic link itself, and not to what it
+ references. See the documentation for the `chown' function for
+ more details.
+
+ SEE ALSO
+ chown, chmod, stat_file
+
+--------------------------------------------------------------
+
+listdir
+
+ SYNOPSIS
+ Get a list of the files in a directory
+
+ USAGE
+ String_Type listdir (String_Type dir)
+
+ DESCRIPTION
+ The `listdir' function returns the directory listing of all the
+ files in the specified directory `dir' as an array of strings.
+ It does not return the special files `".."' and `"."' as
+ part of the list.
+
+ SEE ALSO
+ stat_file, stat_is, length
+
+--------------------------------------------------------------
+
+lstat_file
+
+ SYNOPSIS
+ Get information about a symbolic link
+
+ USAGE
+ Struct_Type lstat_file (String_Type file)
+
+ DESCRIPTION
+ The `lstat_file' function behaves identically to `stat_file'
+ but if `file' is a symbolic link, `lstat_file' returns
+ information about the link itself, and not the file that it
+ references.
+
+ See the documentation for `stat_file' for more information.
+
+ NOTES
+ On systems that do not support symbolic links, there is no
+ difference between this function and the `stat_file' function.
+
+ SEE ALSO
+ stat_file, stat_is, stat_mode_to_string, readlink
+
+--------------------------------------------------------------
+
+mkdir
+
+ SYNOPSIS
+ Create a new directory
+
+ USAGE
+ Int_Type mkdir (String_Type dir ,Int_Type mode)
+
+ DESCRIPTION
+ The `mkdir' function creates a directory whose name is specified
+ by the `dir' parameter with permissions given by the optional
+ `mode' parameter. Upon success `mkdir' returns 0, or it
+ returns `-1' upon failure setting `errno' accordingly. In
+ particular, if the directory already exists, the function will fail
+ and set errno to EEXIST.
+
+ EXAMPLE
+ The following function creates a new directory, if it does not
+ already exist (indicated by `errno==EEXIST').
+
+ define my_mkdir (dir)
+ {
+ if (0 == mkdir (dir)) return;
+ if (errno == EEXIST) return;
+ throw IOError,
+ sprintf ("mkdir %s failed: %s", dir, errno_string (errno));
+ }
+
+
+ NOTES
+ The `mode' parameter may not be meaningful on all systems. On
+ systems where it is meaningful, the actual permissions on the newly
+ created directory are modified by the process's umask.
+
+ SEE ALSO
+ rmdir, getcwd, chdir, fopen, errno
+
+--------------------------------------------------------------
+
+readlink
+
+ SYNOPSIS
+ String_Type readlink (String_Type path)
+
+ USAGE
+ Get the value of a symbolic link
+
+ DESCRIPTION
+ The `readlink' function returns the value of a symbolic link.
+ Upon failure, NULL is returned and `errno' set accordingly.
+
+ NOTES
+ Not all systems support this function.
+
+ SEE ALSO
+ symlink, lstat_file, stat_file, stat_is
+
+--------------------------------------------------------------
+
+remove
+
+ SYNOPSIS
+ Delete a file
+
+ USAGE
+ Int_Type remove (String_Type file)
+
+ DESCRIPTION
+ The `remove' function deletes a file. It returns 0 upon
+ success, or -1 upon error and sets `errno' accordingly.
+
+ SEE ALSO
+ rename, rmdir
+
+--------------------------------------------------------------
+
+rename
+
+ SYNOPSIS
+ Rename a file
+
+ USAGE
+ Int_Type rename (String_Type old, String_Type new)
+
+ DESCRIPTION
+ The `rename' function renames a file from `old' to `new'
+ moving it between directories if necessary. This function may fail
+ if the directories are not on the same file system. It returns
+ 0 upon success, or -1 upon error and sets `errno' accordingly.
+
+ SEE ALSO
+ remove, errno
+
+--------------------------------------------------------------
+
+rmdir
+
+ SYNOPSIS
+ Remove a directory
+
+ USAGE
+ Int_Type rmdir (String_Type dir)
+
+ DESCRIPTION
+ The `rmdir' function deletes the specified directory. It returns
+ 0 upon success or -1 upon error and sets `errno' accordingly.
+
+ NOTES
+ The directory must be empty before it can be removed.
+
+ SEE ALSO
+ rename, remove, mkdir
+
+--------------------------------------------------------------
+
+stat_file
+
+ SYNOPSIS
+ Get information about a file
+
+ USAGE
+ Struct_Type stat_file (String_Type file)
+
+ DESCRIPTION
+ The `stat_file' function returns information about `file'
+ through the use of the system `stat' call. If the stat call
+ fails, the function returns NULL and sets errno accordingly.
+ If it is successful, it returns a stat structure with the following
+ integer-value fields:
+
+ st_dev
+ st_ino
+ st_mode
+ st_nlink
+ st_uid
+ st_gid
+ st_rdev
+ st_size
+ st_atime
+ st_mtime
+ st_ctime
+
+ See the C library documentation of `stat' for a discussion of the
+ meanings of these fields.
+
+ EXAMPLE
+ The following example shows how the `stat_file' function may be
+ used to get the size of a file:
+
+ define file_size (file)
+ {
+ variable st;
+ st = stat_file(file);
+ if (st == NULL)
+ throw IOError, "Unable to stat $file"$;
+ return st.st_size;
+ }
+
+
+ SEE ALSO
+ lstat_file, stat_is, stat_mode_to_string, utime
+
+--------------------------------------------------------------
+
+stat_is
+
+ SYNOPSIS
+ Parse the st_mode field of a stat structure
+
+ USAGE
+ Char_Type stat_is (String_Type type, Int_Type st_mode)
+
+ DESCRIPTION
+ The `stat_is' function returns a boolean value according to
+ whether or not the `st_mode' parameter is of the specified type.
+ Specifically, `type' must be one of the strings:
+
+ "sock" (socket)
+ "fifo" (fifo)
+ "blk" (block device)
+ "chr" (character device)
+ "reg" (regular file)
+ "lnk" (link)
+ "dir" (dir)
+
+ It returns a non-zero value if `st_mode' corresponds to
+ `type'.
+
+ EXAMPLE
+ The following example illustrates how to use the `stat_is'
+ function to determine whether or not a file is a directory:
+
+ define is_directory (file)
+ {
+ variable st;
+
+ st = stat_file (file);
+ if (st == NULL) return 0;
+ return stat_is ("dir", st.st_mode);
+ }
+
+
+ SEE ALSO
+ stat_file, lstat_file, stat_mode_to_string
+
+--------------------------------------------------------------
+
+stat_mode_to_string
+
+ SYNOPSIS
+ Format the file type code and access permission bits as a string
+
+ USAGE
+ String_Type stat_mode_to_string (Int_Type st_mode)
+
+ DESCRIPTION
+ The `stat_mode_to_string' function returns a 10 characters string
+ that indicates the type and permissions of a file as represented by
+ the `st_mode' parameter. The returned string consists of the following
+ characters:
+
+ "s" (socket)
+ "p" (fifo)
+ "b" (block device)
+ "c" (character device)
+ "-" (regular file)
+ "l" (link)
+ "d" (dir)
+
+ The access permission bit is one of the following characters:
+
+ "s" (set-user-id)
+ "w" (writable)
+ "x" (executable)
+ "r" (readable)
+
+
+ NOTES
+ This function is an `slsh' intrinsic. As such, it is not part of
+ S-Lang proper.
+
+ SEE ALSO
+ stat_file, lstat_file, stat_is
+
+--------------------------------------------------------------
+
+symlink
+
+ SYNOPSIS
+ Create a symbolic link
+
+ USAGE
+ Int_Type symlink (String_Type oldpath, String_Type new_path)
+
+ DESCRIPTION
+ The `symlink' function may be used to create a symbolic link
+ named `new_path' for `oldpath'. If successful, the function
+ returns 0, otherwise it returns -1 and sets `errno' appropriately.
+
+ NOTES
+ This function is not supported on all systems and even if supported,
+ not all file systems support the concept of a symbolic link.
+
+ SEE ALSO
+ readlink, hardlink
+
+--------------------------------------------------------------
+
+utime
+
+ SYNOPSIS
+ Change a file's last access and modification times
+
+ USAGE
+ Int_Type utime(String_Type file, Double_Type actime, Double_Type modtime)
+
+ DESCRIPTION
+ This function may be used to change the last access (actime) and last
+ modification (modtime) times associated with the specified file. If
+ successful, the function returns 0; otherwise it returns -1 and sets
+ `errno' accordingly.
+
+ NOTES
+ The `utime' function will call the C library `utimes'
+ function if available, which permits microsecond accuracy.
+ Otherwise, it will truncate the time arguments to integers and call
+ the `utime' function.
+
+ SEE ALSO
+ stat_file
+
+--------------------------------------------------------------
+
+_$
+
+ SYNOPSIS
+ Expand the dollar-escaped variables in a string
+
+ USAGE
+ String_Type _$(String_Type s)
+
+ DESCRIPTION
+ This function expands the dollar-escaped variables in a string and
+ returns the resulting string.
+
+ EXAMPLE
+ Consider the following code fragment:
+
+ private variable Format = "/tmp/foo-$time.$pid";
+ define make_filename ()
+ {
+ variable pid = getpid ();
+ variable time = _time ();
+ return _$(Format);
+ }
+
+ Note that the variable `Format' contains dollar-escaped
+ variables, but because the `$' suffix was omitted from the
+ string literal, the variables are not expanded. Instead expansion is
+ deferred until execution of the `make_filename' function through
+ the use of the `_$' function.
+
+ SEE ALSO
+ eval, getenv
+
+--------------------------------------------------------------
+
+autoload
+
+ SYNOPSIS
+ Load a function from a file
+
+ USAGE
+ autoload (String_Type funct, String_Type file)
+
+ DESCRIPTION
+ The `autoload' function is used to declare `funct' to the
+ interpreter and indicate that it should be loaded from `file'
+ when it is actually used. If `func' contains a namespace
+ prefix, then the file will be loaded into the corresponding
+ namespace. Otherwise, if the `autoload' function is called
+ from an execution namespace that is not the Global namespace nor an
+ anonymous namespace, then the file will be loaded into the execution
+ namespace.
+
+ EXAMPLE
+ Suppose `bessel_j0' is a function defined in the file
+ `bessel.sl'. Then the statement
+
+ autoload ("bessel_j0", "bessel.sl");
+
+ will cause `bessel.sl' to be loaded prior to the execution of
+ `bessel_j0'.
+
+ SEE ALSO
+ evalfile, import
+
+--------------------------------------------------------------
+
+byte_compile_file
+
+ SYNOPSIS
+ Compile a file to byte-code for faster loading.
+
+ USAGE
+ byte_compile_file (String_Type file, Int_Type method)
+
+ DESCRIPTION
+ The `byte_compile_file' function byte-compiles `file'
+ producing a new file with the same name except a `'c'' is added
+ to the output file name. For example, `file' is
+ `"site.sl"', then this function produces a new file named
+ `site.slc'.
+
+ NOTES
+ The `method' parameter is not used in the current
+ implementation, but may be in the future. For now, set
+ it to `0'.
+
+ SEE ALSO
+ evalfile
+
+--------------------------------------------------------------
+
+eval
+
+ SYNOPSIS
+ Interpret a string as S-Lang code
+
+ USAGE
+ eval (String_Type expression ,String_Type namespace)
+
+ DESCRIPTION
+ The `eval' function parses a string as S-Lang code and executes the
+ result. If called with the optional namespace argument, then the
+ string will be evaluated in the specified namespace. If that
+ namespace does not exist it will be created first.
+
+ This is a useful function in many contexts including those where
+ it is necessary to dynamically generate function definitions.
+
+ EXAMPLE
+
+ if (0 == is_defined ("my_function"))
+ eval ("define my_function () { message (\"my_function\"); }");
+
+
+ SEE ALSO
+ is_defined, autoload, evalfile
+
+--------------------------------------------------------------
+
+evalfile
+
+ SYNOPSIS
+ Interpret a file containing S-Lang code
+
+ USAGE
+ Int_Type evalfile (String_Type file ,String_Type namespace)
+
+ DESCRIPTION
+ The `evalfile' function loads `file' into the interpreter
+ and executes it. If called with the optional namespace argument,
+ the file will be loaded into the specified namespace, which will be
+ created if necessary. If given no namespace argument and the file
+ has already been loaded, then it will be loaded again into an
+ anonymous namespace. A namespace argument given by the empty string
+ will also cause the file to be loaded into a new anonymous namespace.
+
+ If no errors were encountered, 1 will be returned; otherwise,
+ a S-Lang exception will be thrown and the function will return zero.
+
+ EXAMPLE
+
+ define load_file (file)
+ {
+ try
+ {
+ () = evalfile (file);
+ }
+ catch AnyError;
+ }
+
+
+ NOTES
+ For historical reasons, the return value of this function is not
+ really useful.
+
+ The file is searched along an application-defined load-path. The
+ `get_slang_load_path' and `set_slang_load_path' functions
+ may be used to set and query the path.
+
+ SEE ALSO
+ eval, autoload, set_slang_load_path, get_slang_load_path
+
+--------------------------------------------------------------
+
+get_slang_load_path
+
+ SYNOPSIS
+ Get the value of the interpreter's load-path
+
+ USAGE
+ String_Type get_slang_load_path ()
+
+ DESCRIPTION
+ This function retrieves the value of the delimiter-separated search
+ path used for loading files. The delimiter is OS-specific and may
+ be queried using the `path_get_delimiter' function.
+
+ NOTES
+ Some applications may not support the built-in load-path searching
+ facility provided by the underlying library.
+
+ SEE ALSO
+ set_slang_load_path, path_get_delimiter
+
+--------------------------------------------------------------
+
+set_slang_load_path
+
+ SYNOPSIS
+ Set the value of the interpreter's load-path
+
+ USAGE
+ set_slang_load_path (String_Type path)
+
+ DESCRIPTION
+ This function may be used to set the value of the
+ delimiter-separated search path used by the `evalfile' and
+ `autoload' functions for locating files. The delimiter is
+ OS-specific and may be queried using the `path_get_delimiter'
+ function.
+
+ EXAMPLE
+
+ public define prepend_to_slang_load_path (p)
+ {
+ variable s = stat_file (p);
+ if (s == NULL) return;
+ if (0 == stat_is ("dir", s.st_mode))
+ return;
+
+ p = sprintf ("%s%c%s", p, path_get_delimiter (), get_slang_load_path ());
+ set_slang_load_path (p);
+ }
+
+
+ NOTES
+ Some applications may not support the built-in load-path searching
+ facility provided by the underlying library.
+
+ SEE ALSO
+ get_slang_load_path, path_get_delimiter, evalfile, autoload
+
+--------------------------------------------------------------
+
+get_import_module_path
+
+ SYNOPSIS
+ Get the search path for dynamically loadable objects
+
+ USAGE
+ String_Type get_import_module_path ()
+
+ DESCRIPTION
+ The `get_import_module_path' may be used to get the search path
+ for dynamically shared objects. Such objects may be made accessible
+ to the application via the `import' function.
+
+ SEE ALSO
+ import, set_import_module_path
+
+--------------------------------------------------------------
+
+import
+
+ SYNOPSIS
+ Dynamically link to a specified module
+
+ USAGE
+ import (String_Type module , String_Type namespace)
+
+ DESCRIPTION
+ The `import' function causes the run-time linker to dynamically
+ link to the shared object specified by the `module' parameter.
+ It searches for the shared object as follows: First a search is
+ performed along all module paths specified by the application. Then
+ a search is made along the paths defined via the
+ `set_import_module_path' function. If not found, a search is
+ performed along the paths given by the `SLANG_MODULE_PATH'
+ environment variable. Finally, a system dependent search is
+ performed (e.g., using the `LD_LIBRARY_PATH' environment
+ variable).
+
+ The optional second parameter may be used to specify a namespace
+ for the intrinsic functions and variables of the module. If this
+ parameter is not present, the intrinsic objects will be placed into
+ the active namespace, or global namespace if the active namespace is
+ anonymous.
+
+ This function throws an `ImportError' if the specified module is
+ not found.
+
+ NOTES
+ The `import' function is not available on all systems.
+
+ SEE ALSO
+ set_import_module_path, use_namespace, current_namespace, getenv, evalfile
+
+--------------------------------------------------------------
+
+set_import_module_path
+
+ SYNOPSIS
+ Set the search path for dynamically loadable objects
+
+ USAGE
+ set_import_module_path (String_Type path_list)
+
+ DESCRIPTION
+ The `set_import_module_path' may be used to set the search path
+ for dynamically shared objects. Such objects may be made accessible
+ to the application via the `import' function.
+
+ The actual syntax for the specification of the set of paths will
+ vary according to the operating system. Under Unix, a colon
+ character is used to separate paths in `path_list'. For win32
+ systems a semi-colon is used. The `path_get_delimiter'
+ function may be used to get the value of the delimiter.
+
+ SEE ALSO
+ import, get_import_module_path, path_get_delimiter
+
+--------------------------------------------------------------
+
+add_doc_file
+
+ SYNOPSIS
+ Make a documentation file known to the help system
+
+ USAGE
+ add_doc_file (String_Type file)
+
+ DESCRIPTION
+ The `add_doc_file' is used to add a documentation file to the
+ system. Such files are searched by the
+ `get_doc_string_from_file' function. The `file' must be
+ specified using the full path.
+
+ SEE ALSO
+ set_doc_files, get_doc_files, get_doc_string_from_file
+
+--------------------------------------------------------------
+
+_apropos
+
+ SYNOPSIS
+ Generate a list of functions and variables
+
+ USAGE
+ Array_Type _apropos (String_Type ns, String_Type s, Integer_Type flags)
+
+ DESCRIPTION
+ The `_apropos' function may be used to get a list of all defined
+ objects in the namespace `ns' whose name matches the regular
+ expression `s' and whose type matches those specified by
+ `flags'. It returns an array of strings containing the names
+ matched.
+
+ The third parameter `flags' is a bit mapped value whose bits
+ are defined according to the following table
+
+ 1 Intrinsic Function
+ 2 User-defined Function
+ 4 Intrinsic Variable
+ 8 User-defined Variable
+
+
+ EXAMPLE
+
+ define apropos (s)
+ {
+ variable n, name, a;
+ a = _apropos ("Global", s, 0xF);
+
+ vmessage ("Found %d matches:", length (a));
+ foreach name (a)
+ message (name);
+ }
+
+ prints a list of all matches.
+
+ NOTES
+ If the namespace specifier `ns' is the empty string `""',
+ then the namespace will default to the static namespace of the
+ current compilation unit.
+
+ SEE ALSO
+ is_defined, sprintf, _get_namespaces
+
+--------------------------------------------------------------
+
+__FILE__
+
+ SYNOPSIS
+ Path of the compilation unit
+
+ USAGE
+ String_Type __FILE__
+
+ DESCRIPTION
+ Every private namespace has `__FILE__' variable associated with
+ it. If the namespace is associated with a file, then the value of
+ this variable will be equal to the pathname of the file. If the
+ namespace is associated with a string, such as one passed to the
+ `eval' function, then the value of this variable will be
+ `"***string***"';
+
+ NOTES
+ In the case of a file, the pathname may be an absolute path or a
+ relative one. If it is a relative one, then it will be relative to
+ the directory from where the file was loaded, i.e., the value
+ returned by the `getcwd' function.
+
+--------------------------------------------------------------
+
+_function_name
+
+ SYNOPSIS
+ Returns the name of the currently executing function
+
+ USAGE
+ String_Type _function_name ()
+
+ DESCRIPTION
+ This function returns the name of the currently executing function.
+ If called from top-level, it returns the empty string.
+
+ SEE ALSO
+ _trace_function, is_defined
+
+--------------------------------------------------------------
+
+__get_defined_symbols
+
+ SYNOPSIS
+ Get the symbols defined by the preprocessor
+
+ USAGE
+ Int_Type __get_defined_symbols ()
+
+ DESCRIPTION
+ The `__get_defined_symbols' functions is used to get the list of
+ all the symbols defined by the S-Lang preprocessor. It pushes each
+ of the symbols on the stack followed by the number of items pushed.
+
+ SEE ALSO
+ is_defined, _apropos, _get_namespaces
+
+--------------------------------------------------------------
+
+get_doc_files
+
+ SYNOPSIS
+ Get the list of documentation files
+
+ USAGE
+ String_Type = get_doc_files ()
+
+ DESCRIPTION
+ The `get_doc_files' function returns the internal list of
+ documentation files as an array of strings.
+
+ SEE ALSO
+ set_doc_files, add_doc_file, get_doc_string_from_file
+
+--------------------------------------------------------------
+
+get_doc_string_from_file
+
+ SYNOPSIS
+ Read documentation from a file
+
+ USAGE
+ String_Type get_doc_string_from_file (String_Type f, String_Type t)
+
+ DESCRIPTION
+ If called with two arguments, `get_doc_string_from_file' opens
+ the documentation file `f' and searches it for topic `t'.
+ Otherwise, it will search an internal list of documentation files
+ looking for the documentation associated with the topic `t'. If
+ found, the documentation for `t' will be returned, otherwise the
+ function will return NULL.
+
+ Files may be added to the internal list via the `add_doc_file'
+ or `set_doc_files' functions.
+
+ SEE ALSO
+ add_doc_file, set_doc_files, get_doc_files, _slang_doc_dir
+
+--------------------------------------------------------------
+
+_get_namespaces
+
+ SYNOPSIS
+ Returns a list of namespace names
+
+ USAGE
+ String_Type _get_namespaces ()
+
+ DESCRIPTION
+ This function returns a string array containing the names of the
+ currently defined namespaces.
+
+ SEE ALSO
+ _apropos, use_namespace, implements, __get_defined_symbols
+
+--------------------------------------------------------------
+
+is_defined
+
+ SYNOPSIS
+ Determine if a variable or function is defined
+
+ USAGE
+ Integer_Type is_defined (String_Type name)
+
+ DESCRIPTION
+ This function is used to determine whether or not a function or
+ variable of the given name has been defined. If the specified name
+ has not been defined, the function returns 0. Otherwise, it
+ returns a non-zero value that depends on the type of object
+ attached to the name. Specifically, it returns one of the following
+ values:
+
+ +1 intrinsic function
+ +2 slang function
+ -1 intrinsic variable
+ -2 slang variable
+ 0 undefined
+
+
+ EXAMPLE
+ Consider the function:
+
+ define runhooks (hook)
+ {
+ if (2 == is_defined(hook)) eval(hook);
+ }
+
+ This function could be called from another S-Lang function to
+ allow customization of that function, e.g., if the function
+ represents a mode, the hook could be called to setup keybindings
+ for the mode.
+
+ SEE ALSO
+ typeof, eval, autoload, __get_reference, __is_initialized
+
+--------------------------------------------------------------
+
+__is_initialized
+
+ SYNOPSIS
+ Determine whether or not a variable has a value
+
+ USAGE
+ Integer_Type __is_initialized (Ref_Type r)
+
+ DESCRIPTION
+ This function returns non-zero of the object referenced by `r'
+ is initialized, i.e., whether it has a value. It returns 0 if the
+ referenced object has not been initialized.
+
+ EXAMPLE
+ The function:
+
+ define zero ()
+ {
+ variable f;
+ return __is_initialized (&f);
+ }
+
+ will always return zero, but
+
+ define one ()
+ {
+ variable f = 0;
+ return __is_initialized (&f);
+ }
+
+ will return one.
+
+ SEE ALSO
+ __get_reference, __uninitialize, is_defined, typeof, eval
+
+--------------------------------------------------------------
+
+_NARGS
+
+ SYNOPSIS
+ The number of parameters passed to a function
+
+ USAGE
+ Integer_Type _NARGS
+ The value of the `_NARGS' variable represents the number of
+ arguments passed to the function. This variable is local to each
+ function.
+
+ EXAMPLE
+ This example uses the `_NARGS' variable to print the list of
+ values passed to the function:
+
+ define print_values ()
+ {
+ variable arg;
+
+ if (_NARGS == 0)
+ {
+ message ("Nothing to print");
+ return;
+ }
+ foreach arg (__pop_args (_NARGS))
+ vmessage ("Argument value is: %S", arg.value);
+ }
+
+
+ SEE ALSO
+ __pop_args, __push_args, typeof
+
+--------------------------------------------------------------
+
+set_doc_files
+
+ SYNOPSIS
+ Set the internal list of documentation files
+
+ USAGE
+ set_doc_files (String_Type list)
+
+ DESCRIPTION
+ The `set_doc_files' function may be used to set the internal
+ list of documentation files. It takes a single parameter, which is
+ required to be an array of strings. The internal file list is set
+ to the files specified by the elements of the array.
+
+ EXAMPLE
+ The following example shows how to add all the files in a specified
+ directory to the internal list. It makes use of the `glob'
+ function that is distributed as part of `slsh'.
+
+ files = glob ("/path/to/doc/files/*.sld");
+ set_doc_files (files, get_doc_files ());
+
+
+ SEE ALSO
+ get_doc_files, add_doc_file, get_doc_string_from_file
+
+--------------------------------------------------------------
+
+_slang_doc_dir
+
+ SYNOPSIS
+ Installed documentation directory
+
+ USAGE
+ String_Type _slang_doc_dir
+
+ DESCRIPTION
+ The `_slang_doc_dir' variable is a read-only variable that
+ specifies the compile-time installation location of the S-Lang
+ documentation.
+
+ SEE ALSO
+ get_doc_string_from_file
+
+--------------------------------------------------------------
+
+_slang_version
+
+ SYNOPSIS
+ The S-Lang library version number
+
+ USAGE
+ Integer_Type _slang_version
+
+ DESCRIPTION
+ `_slang_version' is a read-only variable that gives the version
+ number of the S-Lang library.
+
+ SEE ALSO
+ _slang_version_string
+
+--------------------------------------------------------------
+
+_slang_version_string
+
+ SYNOPSIS
+ The S-Lang library version number as a string
+
+ USAGE
+ String_Type _slang_version_string
+
+ DESCRIPTION
+ `_slang_version_string' is a read-only variable that gives a
+ string representation of the version number of the S-Lang library.
+
+ SEE ALSO
+ _slang_version
+
+--------------------------------------------------------------
+
+list_append
+
+ SYNOPSIS
+ Append an object to a list
+
+ USAGE
+ list_append (List_Type list, object ,Int_Type nth)
+
+ DESCRIPTION
+ The `list_append' function is like `list_insert' except
+ this function appends the object to the list. The optional
+ argument `nth' may be used to specify where the object is to be
+ appended. See the documentation on `list_insert' for more details.
+
+ SEE ALSO
+ list_concat, list_insert, list_join, list_delete, list_pop, list_new, list_reverse
+
+--------------------------------------------------------------
+
+list_concat
+
+ SYNOPSIS
+ Concatenate two lists to form a third
+
+ USAGE
+ List_Type = list_concat (List_Type a, List_Type b)
+
+ DESCRIPTION
+ This function creates a new list that is formed by concatenating the
+ two lists `a' and `b' together. Neither of the input
+ lists are modified by this operation.
+
+ SEE ALSO
+ list_join, list_append, list_insert
+
+--------------------------------------------------------------
+
+list_delete
+
+ SYNOPSIS
+ Remove an item from a list
+
+ USAGE
+ list_delete (List_Type list, Int_Type nth)
+
+ DESCRIPTION
+ This function removes the `nth' item in the specified list.
+ The first item in the list corresponds to a value of `nth'
+ equal to zero. If `nth' is negative, then the indexing is with
+ respect to the end of the list with the last item corresponding to
+ `nth' equal to -1.
+
+ SEE ALSO
+ list_insert, list_append, list_pop, list_new, list_reverse
+
+--------------------------------------------------------------
+
+list_insert
+
+ SYNOPSIS
+ Insert an item into a list
+
+ USAGE
+ list_insert (List_Type list, object ,Int_Type nth)
+
+ DESCRIPTION
+ This function may be used to insert an object into the specified
+ list. With just two arguments, the object will be inserted at the
+ beginning of the list. The optional third argument, `nth', may
+ be used to specify the insertion point. The first item in the list
+ corresponds to a value of `nth' equal to zero. If `nth'
+ is negative, then the indexing is with respect to the end of the
+ list with the last item given by a value of `nth' equal to -1.
+
+ NOTES
+ It is important to note that
+
+ list_insert (list, object, 0);
+
+ is not the same as
+
+ list = {object, list}
+
+ since the latter creates a new list with two items, `object'
+ and the old list.
+
+ SEE ALSO
+ list_append, list_pop, list_delete, list_new, list_reverse
+
+--------------------------------------------------------------
+
+list_join
+
+ SYNOPSIS
+ Join the elements of a second list onto the end of the first
+
+ USAGE
+ list_join (List_Type a, List_Type b)
+
+ DESCRIPTION
+ This function modifies the list `a' by appending the elements
+ of `b' to it.
+
+ SEE ALSO
+ list_concat, list_append, list_insert
+
+--------------------------------------------------------------
+
+list_new
+
+ SYNOPSIS
+ Create a new list
+
+ USAGE
+ List_Type list_new ()
+
+ DESCRIPTION
+ This function creates a new empty List_Type object. Such a
+ list may also be created using the syntax
+
+ list = {};
+
+
+ SEE ALSO
+ list_delete, list_insert, list_append, list_reverse, list_pop
+
+--------------------------------------------------------------
+
+list_pop
+
+ SYNOPSIS
+ Extract an item from a list
+
+ USAGE
+ object = list_pop (List_Type list , Int_Type nth)
+
+ DESCRIPTION
+ The `list_pop' function returns a object from a list deleting
+ the item from the list in the process. If the second argument is
+ present, then it may be used to specify the position in the list
+ where the item is to be obtained. If called with a single argument,
+ the first item in the list will be used.
+
+ SEE ALSO
+ list_delete, list_insert, list_append, list_reverse, list_new
+
+--------------------------------------------------------------
+
+list_reverse
+
+ SYNOPSIS
+ Reverse a list
+
+ USAGE
+ list_reverse (List_Type list)
+
+ DESCRIPTION
+ This function may be used to reverse the items in list.
+
+ NOTES
+ This function does not create a new list. The list passed to the
+ function will be reversed upon return from the function. If it is
+ desired to create a separate reversed list, then a separate copy
+ should be made, e.g.,
+
+ rev_list = @list;
+ list_reverse (rev_list);
+
+
+ SEE ALSO
+ list_new, list_insert, list_append, list_delete, list_pop
+
+--------------------------------------------------------------
+
+list_to_array
+
+ SYNOPSIS
+ Convert a list into an array
+
+ USAGE
+ Array_Type list_to_array (List_Type list ,DataType_Type type)
+
+ DESCRIPTION
+ The `list_to_array' function converts a list of objects into an
+ array of the same length and returns the result. The optional
+ argument may be used to specify the array's data type. If no
+ `type' is given, `list_to_array' tries to find the common
+ data type of all list elements. This function will generate an
+ exception if the list is empty and no type has been specified, or the
+ objects in the list cannot be converted to a common type.
+
+ NOTES
+ A future version of this function may produce an Any_Type
+ array for an empty or heterogeneous list.
+
+ SEE ALSO
+ length, typecast, __pop_list, typeof, array_sort
+
+--------------------------------------------------------------
+
+abs
+
+ SYNOPSIS
+ Compute the absolute value of a number
+
+ USAGE
+ y = abs(x)
+
+ DESCRIPTION
+ The `abs' function returns the absolute value of an arithmetic
+ type. If its argument is a complex number (Complex_Type),
+ then it returns the modulus. If the argument is an array, a new
+ array will be created whose elements are obtained from the original
+ array by using the `abs' function.
+
+ SEE ALSO
+ sign, sqr
+
+--------------------------------------------------------------
+
+acos
+
+ SYNOPSIS
+ Compute the arc-cosine of a number
+
+ USAGE
+ y = acos (x)
+
+ DESCRIPTION
+ The `acos' function computes the arc-cosine of a number and
+ returns the result. If its argument is an array, the
+ `acos' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ cos, atan, acosh, cosh
+
+--------------------------------------------------------------
+
+acosh
+
+ SYNOPSIS
+ Compute the inverse cosh of a number
+
+ USAGE
+ y = acosh (x)
+
+ DESCRIPTION
+ The `acosh' function computes the inverse hyperbolic cosine of a number and
+ returns the result. If its argument is an array, the
+ `acosh' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ cos, atan, acosh, cosh
+
+--------------------------------------------------------------
+
+asin
+
+ SYNOPSIS
+ Compute the arc-sine of a number
+
+ USAGE
+ y = asin (x)
+
+ DESCRIPTION
+ The `asin' function computes the arc-sine of a number and
+ returns the result. If its argument is an array, the
+ `asin' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ cos, atan, acosh, cosh
+
+--------------------------------------------------------------
+
+asinh
+
+ SYNOPSIS
+ Compute the inverse-sinh of a number
+
+ USAGE
+ y = asinh (x)
+
+ DESCRIPTION
+ The `asinh' function computes the inverse hyperbolic sine of a number and
+ returns the result. If its argument is an array, the
+ `asinh' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ cos, atan, acosh, cosh
+
+--------------------------------------------------------------
+
+atan
+
+ SYNOPSIS
+ Compute the arc-tangent of a number
+
+ USAGE
+ y = atan (x)
+
+ DESCRIPTION
+ The `atan' function computes the arc-tangent of a number and
+ returns the result. If its argument is an array, the
+ `atan' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ atan2, cos, acosh, cosh
+
+--------------------------------------------------------------
+
+atan2
+
+ SYNOPSIS
+ Compute the arc-tangent of the ratio of two variables
+
+ USAGE
+ z = atan2 (y, x)
+
+ DESCRIPTION
+ The `atan2' function computes the arc-tangent of the ratio
+ `y/x' and returns the result as a value that has the
+ proper sign for the quadrant where the point (x,y) is located. The
+ returned value `z' will satisfy (-PI < z <= PI). If either of the
+ arguments is an array, an array of the corresponding values will be returned.
+
+ SEE ALSO
+ hypot, cos, atan, acosh, cosh
+
+--------------------------------------------------------------
+
+atanh
+
+ SYNOPSIS
+ Compute the inverse-tanh of a number
+
+ USAGE
+ y = atanh (x)
+
+ DESCRIPTION
+ The `atanh' function computes the inverse hyperbolic tangent of a number and
+ returns the result. If its argument is an array, the
+ `atanh' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ cos, atan, acosh, cosh
+
+--------------------------------------------------------------
+
+ceil
+
+ SYNOPSIS
+ Round x up to the nearest integral value
+
+ USAGE
+ y = ceil (x)
+
+ DESCRIPTION
+ This function rounds its numeric argument up to the nearest integral
+ value. If the argument is an array, the corresponding array will be
+ returned.
+
+ SEE ALSO
+ floor, round
+
+--------------------------------------------------------------
+
+Conj
+
+ SYNOPSIS
+ Compute the complex conjugate of a number
+
+ USAGE
+ z1 = Conj (z)
+
+ DESCRIPTION
+ The `Conj' function returns the complex conjugate of a number.
+ If its argument is an array, the `Conj' function will be applied to each
+ element and the result returned as an array.
+
+ SEE ALSO
+ Real, Imag, abs
+
+--------------------------------------------------------------
+
+cos
+
+ SYNOPSIS
+ Compute the cosine of a number
+
+ USAGE
+ y = cos (x)
+
+ DESCRIPTION
+ The `cos' function computes the cosine of a number and
+ returns the result. If its argument is an array, the
+ `cos' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ sin, atan, acosh, cosh, sincos
+
+--------------------------------------------------------------
+
+cosh
+
+ SYNOPSIS
+ Compute the hyperbolic cosine of a number
+
+ USAGE
+ y = cosh (x)
+
+ DESCRIPTION
+ The `cosh' function computes the hyperbolic cosine of a number and
+ returns the result. If its argument is an array, the
+ `cosh' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ cos, atan, acosh, cosh
+
+--------------------------------------------------------------
+
+_diff
+
+ SYNOPSIS
+ Compute the absolute difference of two values
+
+ USAGE
+ y = _diff (x, y)
+
+ DESCRIPTION
+ The `_diff' function returns a floating point number equal to
+ the absolute value of the difference of its two arguments.
+ If either argument is an array, an array of the corresponding values
+ will be returned.
+
+ SEE ALSO
+ abs
+
+--------------------------------------------------------------
+
+exp
+
+ SYNOPSIS
+ Compute the exponential of a number
+
+ USAGE
+ y = exp (x)
+
+ DESCRIPTION
+ The `exp' function computes the exponential of a number and
+ returns the result. If its argument is an array, the
+ `exp' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ expm1, cos, atan, acosh, cosh
+
+--------------------------------------------------------------
+
+expm1
+
+ SYNOPSIS
+ Compute exp(x)-1
+
+ USAGE
+ y = expm1(x)
+
+ DESCRIPTION
+ The `expm1' function computes `exp(x)-1' and returns the
+ result. If its argument is an array, the `expm1' function will
+ be applied to each element and the results returned as an array.
+
+ This function should be called whenever `x' is close to 0 to
+ avoid the numerical error that would arise in a naive computation of
+ `exp(x)-1'.
+
+ SEE ALSO
+ expm1, log1p, cos, atan, acosh, cosh
+
+--------------------------------------------------------------
+
+feqs
+
+ SYNOPSIS
+ Test the approximate equality of two numbers
+
+ USAGE
+ Char_Type feqs (a, b ,reldiff ,absdiff)
+
+ DESCRIPTION
+ This function compares two floating point numbers `a' and
+ `b', and returns a non-zero value if they are equal to within a
+ specified tolerance; otherwise 0 will be returned. If either is an
+ array, a corresponding boolean array will be returned.
+
+ The tolerances are specified as relative and absolute differences via
+ the optional third and fourth arguments. If no optional arguments
+ are present, the tolerances default to `reldiff=0.01' and
+ `absdiff=1e-6'. If only the relative difference has been
+ specified, the absolute difference (`absdiff') will be taken to
+ be 0.0.
+
+ For the case when `|b|>=|a|', `a' and `b' are
+ considered to be equal to within the specified tolerances if either
+ `|b-a|<=absdiff' or `|b-a|/|b|<=reldiff' is true.
+
+ SEE ALSO
+ fneqs, fgteqs, flteqs
+
+--------------------------------------------------------------
+
+fgteqs
+
+ SYNOPSIS
+ Compare two numbers using specified tolerances
+.
+
+ USAGE
+ Char_Type fgteqs (a, b ,reldiff ,absdiff)
+
+ DESCRIPTION
+ This function is functionally equivalent to:
+
+ (a >= b) or feqs(a,b,...)
+
+ See the documentation of `feqs' for more information.
+
+ SEE ALSO
+ feqs, fneqs, flteqs
+
+--------------------------------------------------------------
+
+floor
+
+ SYNOPSIS
+ Round x down to the nearest integer
+
+ USAGE
+ y = floor (x)
+
+ DESCRIPTION
+ This function rounds its numeric argument down to the nearest
+ integral value. If the argument is an array, the corresponding array
+ will be returned.
+
+ SEE ALSO
+ ceil, round, nint
+
+--------------------------------------------------------------
+
+flteqs
+
+ SYNOPSIS
+ Compare two numbers using specified tolerances
+.
+
+ USAGE
+ Char_Type flteqs (a, b ,reldiff ,absdiff)
+
+ DESCRIPTION
+ This function is functionally equivalent to:
+
+ (a <= b) or feqs(a,b,...)
+
+ See the documentation of `feqs' for more information.
+
+ SEE ALSO
+ feqs, fneqs, fgteqs
+
+--------------------------------------------------------------
+
+fneqs
+
+ SYNOPSIS
+ Test the approximate inequality of two numbers
+
+ USAGE
+ Char_Type fneqs (a, b ,reldiff ,absdiff)
+
+ DESCRIPTION
+ This function is functionally equivalent to:
+
+ not fneqs(a,b,...)
+
+ See the documentation of `feqs' for more information.
+
+ SEE ALSO
+ feqs, fgteqs, flteqs
+
+--------------------------------------------------------------
+
+frexp
+
+ SYNOPSIS
+ Obtain the integral and fractional parts of a floating point number
+
+ USAGE
+ (b,e) = frexp(x)
+
+ DESCRIPTION
+ This function breaks a floating point number `x' into two values
+ `b' and `e' such that `x=b*2^x', where
+
+ 0.5 <= abs(b) < 1 for x != 0,
+ b = 0, e = 0 for x = 0
+ b = _NaN for x = _NaN
+ b = +/-_Inf for x = +/-Inf
+
+ For the latter two cases, the value is `e' is implementation
+ dependent.
+
+ If `x' is an array, the `frexp' function will be applied
+ to each element and corresponding arrays will be returned.
+
+ SEE ALSO
+ ldexp, pow, log
+
+--------------------------------------------------------------
+
+get_float_format
+
+ SYNOPSIS
+ Get the format for printing floating point values.
+
+ USAGE
+ String_Type get_float_format ()
+
+ DESCRIPTION
+ The `get_float_format' retrieves the format string used for
+ printing single and double precision floating point numbers. See the
+ documentation for the `set_float_format' function for more
+ information about the format.
+
+ SEE ALSO
+ set_float_format
+
+--------------------------------------------------------------
+
+hypot
+
+ SYNOPSIS
+ Compute sqrt(x1^2+x2^2+...+xN^2)
+
+ USAGE
+ r = hypot (x1 ,x2,..,xN)
+
+ DESCRIPTION
+ If given two or more arguments, `x1,...,xN', the `hypot'
+ function computes the quantity `sqrt(x1^2+...+xN^2)' using an
+ algorithm that tries to avoid arithmetic overflow. If any of the
+ arguments is an array, an array of the corresponding values will be
+ returned.
+
+ If given a single array argument `x', the `hypot' function
+ computes `sqrt(sumsq(x))', where `sumsq(x)' computes
+ the sum of the squares of the elements of `x'.
+
+ EXAMPLE
+ A vector in Euclidean 3 dimensional space may be represented by an
+ array of three values representing the components of the vector in
+ some orthogonal Cartesian coordinate system. Then the length of the
+ vector may be computed using the `hypot' function, e.g.,
+
+ A = 2,3,4;
+ len_A = hypot (A);
+
+ The dot-product or scalar-product between two such vectors `A'
+ and `B' may be computed using the `sum(A*B)'. It is well
+ known that this is also equal to the product of the lengths of the
+ two vectors and the cosine of the angle between them. Hence, the
+ angle between the vectors `A' and `B' may be computed using
+
+ ahat = A/hypot(A);
+ bhat = B/hypot(B);
+ theta = acos(\sum(ahat*bhat));
+
+ Here, `ahat' and `bhat' are the unit vectors associated
+ with the vectors `A' and `B', respectively.
+ Unfortunately, the above method for computing the angle between the
+ vectors is numerically unstable when `A' and `B' are
+ nearly parallel. An alternative method is to use:
+
+ ahat = A/hypot(A);
+ bhat = B/hypot(B);
+ ab = sum(ahat*bhat);
+ theta = atan2 (hypot(bhat - ab*ahat), ab);
+
+
+ SEE ALSO
+ atan2, cos, atan, acosh, cosh, sum, sumsq
+
+--------------------------------------------------------------
+
+Imag
+
+ SYNOPSIS
+ Compute the imaginary part of a number
+
+ USAGE
+ i = Imag (z)
+
+ DESCRIPTION
+ The `Imag' function returns the imaginary part of a number.
+ If its argument is an array, the `Imag' function will be applied to each
+ element and the result returned as an array.
+
+ SEE ALSO
+ Real, Conj, abs
+
+--------------------------------------------------------------
+
+isinf
+
+ SYNOPSIS
+ Test for infinity
+
+ USAGE
+ y = isinf (x)
+
+ DESCRIPTION
+ This function returns 1 if x corresponds to an IEEE infinity, or 0
+ otherwise. If the argument is an array, an array of the
+ corresponding values will be returned.
+
+ SEE ALSO
+ isnan, _Inf
+
+--------------------------------------------------------------
+
+isnan
+
+ SYNOPSIS
+ isnan
+
+ USAGE
+ y = isnan (x)
+
+ DESCRIPTION
+ This function returns 1 if x corresponds to an IEEE NaN (Not a Number),
+ or 0 otherwise. If the argument is an array, an array of
+ the corresponding values will be returned.
+
+ SEE ALSO
+ isinf, _NaN
+
+--------------------------------------------------------------
+
+_isneg
+
+ SYNOPSIS
+ Test if a number is less than 0
+
+ USAGE
+ Char_Type _isneg(x)
+
+ DESCRIPTION
+ This function returns 1 if a number is less than 0, and zero
+ otherwise. If the argument is an array, then the corresponding
+ array of boolean (Char_Type) values will be returned.
+
+ SEE ALSO
+ _ispos, _isnonneg
+
+--------------------------------------------------------------
+
+_isnonneg
+
+ SYNOPSIS
+ Test if a number is greater than or equal to 0
+
+ USAGE
+ Char_Type _isnonneg(x)
+
+ DESCRIPTION
+ This function returns 1 if a number is greater than or equal to 0,
+ and zero otherwise. If the argument is an array, then the
+ corresponding array of boolean (Char_Type) values will be
+ returned.
+
+ SEE ALSO
+ _isneg, _ispos
+
+--------------------------------------------------------------
+
+_ispos
+
+ SYNOPSIS
+ Test if a number is greater than 0
+
+ USAGE
+ Char_Type _ispos(x)
+
+ DESCRIPTION
+ This function returns 1 if a number is greater than 0, and zero
+ otherwise. If the argument is an array, then the corresponding
+ array of boolean (Char_Type) values will be returned.
+
+ SEE ALSO
+ _isneg, _isnonneg
+
+--------------------------------------------------------------
+
+ldexp
+
+ SYNOPSIS
+ Multiply a number by a power of 2
+
+ USAGE
+ x = ldexp(b, e)
+
+ DESCRIPTION
+ This function computes the value of `b*2^e' and returns the
+ result. If either `b' or `e' is an array, a corresponding
+ array of values will be returned.
+
+ NOTES
+ This function is the inverse of `frexp'.
+
+ SEE ALSO
+ frexp
+
+--------------------------------------------------------------
+
+log
+
+ SYNOPSIS
+ Compute the logarithm of a number
+
+ USAGE
+ y = log (x)
+
+ DESCRIPTION
+ The `log' function computes the natural logarithm of a number and
+ returns the result. If its argument is an array, the
+ `log' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ cos, atan, acosh, cosh, log1p
+
+--------------------------------------------------------------
+
+log10
+
+ SYNOPSIS
+ Compute the base-10 logarithm of a number
+
+ USAGE
+ y = log10 (x)
+
+ DESCRIPTION
+ The `log10' function computes the base-10 logarithm of a number and
+ returns the result. If its argument is an array, the
+ `log10' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ cos, atan, acosh, cosh
+
+--------------------------------------------------------------
+
+log1p
+
+ SYNOPSIS
+ Compute the logarithm of 1 plus a number
+
+ USAGE
+ y = log1p (x)
+
+ DESCRIPTION
+ The `log1p' function computes the natural logarithm of 1.0 plus
+ `x' returns the result. If its argument is an array, the
+ `log1p' function will be applied to each element and the results
+ returned as an array.
+
+ This function should be used instead of `log(1+x)' to avoid
+ numerical errors whenever `x' is close to 0.
+
+ SEE ALSO
+ log, expm1, cos, atan, acosh, cosh
+
+--------------------------------------------------------------
+
+_max
+
+ SYNOPSIS
+ Compute the maximum of two or more numeric values
+
+ USAGE
+ z = _max (x1,...,xN)
+
+ DESCRIPTION
+ The `_max' function returns a floating point number equal to
+ the maximum value of its arguments. If any of the arguments are
+ arrays (of equal length), an array of the corresponding values will
+ be returned.
+
+ NOTES
+ This function returns a floating point result even when the
+ arguments are integers.
+
+ SEE ALSO
+ _min, min, max
+
+--------------------------------------------------------------
+
+_min
+
+ SYNOPSIS
+ Compute the minimum of two or more numeric values
+
+ USAGE
+ z = _min (x1,...,xN)
+
+ DESCRIPTION
+ The `_min' function returns a floating point number equal to
+ the minimum value of its arguments. If any of the arguments are
+ arrays (of equal length), an array of the corresponding values will
+ be returned.
+
+ NOTES
+ This function returns a floating point result even when the
+ arguments are integers.
+
+ SEE ALSO
+ min, _max, max
+
+--------------------------------------------------------------
+
+mul2
+
+ SYNOPSIS
+ Multiply a number by 2
+
+ USAGE
+ y = mul2(x)
+
+ DESCRIPTION
+ The `mul2' function multiplies an arithmetic type by two and
+ returns the result. If its argument is an array, a new array will
+ be created whose elements are obtained from the original array by
+ using the `mul2' function.
+
+ SEE ALSO
+ sqr, abs
+
+--------------------------------------------------------------
+
+nint
+
+ SYNOPSIS
+ Round to the nearest integer
+
+ USAGE
+ i = nint(x)
+
+ DESCRIPTION
+ The `nint' rounds its argument to the nearest integer and
+ returns the result. If its argument is an array, a new array will
+ be created whose elements are obtained from the original array
+ elements by using the `nint' function.
+
+ SEE ALSO
+ round, floor, ceil
+
+--------------------------------------------------------------
+
+polynom
+
+ SYNOPSIS
+ Evaluate a polynomial
+
+ USAGE
+ Double_Type polynom(a0,a1,...aN, x ,use_factorial)
+
+ DESCRIPTION
+ The `polynom' function returns the value of the polynomial expression
+
+ a0 + a1*x + a2*x^2 + ... + aN*x^N
+
+ where the coefficients are given by an array of values
+ `a0,...,aN'. If `x' is an array, the function will
+ return a corresponding array. If the value of the optional
+ `use_factorial' parameter is non-zero, then each term in the sum
+ will be normalized by the corresponding factorial, i.e.,
+
+ a0/0! + a1*x/1! + a2*x^2/2! + ... + aN*x^N/N!
+
+
+ NOTES
+ Prior to version 2.2, this function had a different calling syntax
+ and and was less useful.
+
+ The `polynom' function does not yet support complex-valued
+ coefficients.
+
+ For the case of a scalar value of `x' and a small degree
+ polynomial, it is more efficient to use an explicit expression.
+
+ SEE ALSO
+ exp
+
+--------------------------------------------------------------
+
+Real
+
+ SYNOPSIS
+ Compute the real part of a number
+
+ USAGE
+ r = Real (z)
+
+ DESCRIPTION
+ The `Real' function returns the real part of a number. If its
+ argument is an array, the `Real' function will be applied to
+ each element and the result returned as an array.
+
+ SEE ALSO
+ Imag, Conj, abs
+
+--------------------------------------------------------------
+
+round
+
+ SYNOPSIS
+ Round to the nearest integral value
+
+ USAGE
+ y = round (x)
+
+ DESCRIPTION
+ This function rounds its argument to the nearest integral value and
+ returns it as a floating point result. If the argument is an array,
+ an array of the corresponding values will be returned.
+
+ SEE ALSO
+ floor, ceil, nint
+
+--------------------------------------------------------------
+
+set_float_format
+
+ SYNOPSIS
+ Set the format for printing floating point values.
+
+ USAGE
+ set_float_format (String_Type fmt)
+
+ DESCRIPTION
+ The `set_float_format' function is used to set the floating
+ point format to be used when floating point numbers are printed.
+ The routines that use this are the traceback routines and the
+ `string' function, any anything based upon the `string'
+ function. The default value is `"%S"', which causes the number
+ to be displayed with enough significant digits such that
+ `x==atof(string(x))'.
+
+ EXAMPLE
+
+ set_float_format ("%S"); % default
+ s = string (PI); % --> s = "3.141592653589793"
+ set_float_format ("%16.10f");
+ s = string (PI); % --> s = "3.1415926536"
+ set_float_format ("%10.6e");
+ s = string (PI); % --> s = "3.141593e+00"
+
+
+ SEE ALSO
+ get_float_format, string, sprintf, atof, double
+
+--------------------------------------------------------------
+
+sign
+
+ SYNOPSIS
+ Compute the sign of a number
+
+ USAGE
+ y = sign(x)
+
+ DESCRIPTION
+ The `sign' function returns the sign of an arithmetic type. If
+ its argument is a complex number (Complex_Type), the
+ `sign' will be applied to the imaginary part of the number. If
+ the argument is an array, a new array will be created whose elements
+ are obtained from the original array by using the `sign'
+ function.
+
+ When applied to a real number or an integer, the `sign' function
+ returns -1, 0, or `+1' according to whether the number is
+ less than zero, equal to zero, or greater than zero, respectively.
+
+ SEE ALSO
+ abs
+
+--------------------------------------------------------------
+
+sin
+
+ SYNOPSIS
+ Compute the sine of a number
+
+ USAGE
+ y = sin (x)
+
+ DESCRIPTION
+ The `sin' function computes the sine of a number and
+ returns the result. If its argument is an array, the
+ `sin' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ cos, atan, acosh, cosh, sincos
+
+--------------------------------------------------------------
+
+sincos
+
+ SYNOPSIS
+ Compute the sine and cosine of a number
+
+ USAGE
+ (s, c) = sincos (x)
+
+ DESCRIPTION
+ The `sincos' function computes the sine and cosine of a
+ number and returns the result. If its argument is an array,
+ the `sincos' function will be applied to each element
+ and the result returned as an array.
+
+ SEE ALSO
+ sin, cos
+
+--------------------------------------------------------------
+
+sinh
+
+ SYNOPSIS
+ Compute the hyperbolic sine of a number
+
+ USAGE
+ y = sinh (x)
+
+ DESCRIPTION
+ The `sinh' function computes the hyperbolic sine of a number and
+ returns the result. If its argument is an array, the
+ `sinh' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ cos, atan, acosh, cosh
+
+--------------------------------------------------------------
+
+sqr
+
+ SYNOPSIS
+ Compute the square of a number
+
+ USAGE
+ y = sqr(x)
+
+ DESCRIPTION
+ The `sqr' function returns the square of an arithmetic type. If its
+ argument is a complex number (Complex_Type), then it returns
+ the square of the modulus. If the argument is an array, a new array
+ will be created whose elements are obtained from the original array
+ by using the `sqr' function.
+
+ NOTES
+ For real scalar numbers, using `x*x' instead of `sqr(x)'
+ will result in faster executing code. However, if `x' is an
+ array, then `sqr(x)' will execute faster.
+
+ SEE ALSO
+ abs, mul2
+
+--------------------------------------------------------------
+
+sqrt
+
+ SYNOPSIS
+ Compute the square root of a number
+
+ USAGE
+ y = sqrt (x)
+
+ DESCRIPTION
+ The `sqrt' function computes the square root of a number and
+ returns the result. If its argument is an array, the
+ `sqrt' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ sqr, cos, atan, acosh, cosh
+
+--------------------------------------------------------------
+
+tan
+
+ SYNOPSIS
+ Compute the tangent of a number
+
+ USAGE
+ y = tan (x)
+
+ DESCRIPTION
+ The `tan' function computes the tangent of a number and
+ returns the result. If its argument is an array, the
+ `tan' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ cos, atan, acosh, cosh
+
+--------------------------------------------------------------
+
+tanh
+
+ SYNOPSIS
+ Compute the hyperbolic tangent of a number
+
+ USAGE
+ y = tanh (x)
+
+ DESCRIPTION
+ The `tanh' function computes the hyperbolic tangent of a number and
+ returns the result. If its argument is an array, the
+ `tanh' function will be applied to each element and the result returned
+ as an array.
+
+ SEE ALSO
+ cos, atan, acosh, cosh
+
+--------------------------------------------------------------
+
+errno
+
+ SYNOPSIS
+ Error code set by system functions
+
+ USAGE
+ Int_Type errno
+
+ DESCRIPTION
+ A system function can fail for a variety of reasons. For example, a
+ file operation may fail because lack of disk space, or the process
+ does not have permission to perform the operation. Such functions
+ will return -1 and set the variable `errno' to an error
+ code describing the reason for failure.
+
+ Particular values of `errno' may be specified by the following
+ symbolic constants (read-only variables) and the corresponding
+ `errno_string' value:
+
+ E2BIG "Arg list too long"
+ EACCES "Permission denied"
+ EBADF "Bad file number"
+ EBUSY "Mount device busy"
+ ECHILD "No children"
+ EEXIST "File exists"
+ EFAULT "Bad address"
+ EFBIG "File too large"
+ EINTR "Interrupted system call"
+ EINVAL "Invalid argument"
+ EIO "I/O error"
+ EISDIR "Is a directory"
+ ELOOP "Too many levels of symbolic links"
+ EMFILE "Too many open files"
+ EMLINK "Too many links"
+ ENAMETOOLONG "File name too long"
+ ENFILE "File table overflow"
+ ENODEV "No such device"
+ ENOENT "No such file or directory"
+ ENOEXEC "Exec format error"
+ ENOMEM "Not enough core"
+ ENOSPC "No space left on device"
+ ENOTBLK "Block device required"
+ ENOTDIR "Not a directory"
+ ENOTEMPTY "Directory not empty"
+ ENOTTY "Not a typewriter"
+ ENXIO "No such device or address"
+ EPERM "Operation not permitted"
+ EPIPE "Broken pipe"
+ EROFS "Read-only file system"
+ ESPIPE "Illegal seek"
+ ESRCH "No such process"
+ ETXTBSY "Text file busy"
+ EXDEV "Cross-device link"
+
+
+ EXAMPLE
+ The `mkdir' function will attempt to create a directory. If it
+ fails, the function will throw an IOError exception with a message
+ containing the string representation of the `errno' value.
+
+ if (-1 == mkdir (dir))
+ throw IOError, sprintf ("mkdir %s failed: %s",
+ dir, errno_string (errno));
+
+
+ SEE ALSO
+ errno_string, error, mkdir
+
+--------------------------------------------------------------
+
+errno_string
+
+ SYNOPSIS
+ Return a string describing an errno.
+
+ USAGE
+ String_Type errno_string ( Int_Type err )
+
+ DESCRIPTION
+ The `errno_string' function returns a string describing the
+ integer errno code `err'. If the `err' parameter is
+ omitted, the current value of `errno' will be used. See the
+ description for `errno' for more information.
+
+ EXAMPLE
+ The `errno_string' function may be used as follows:
+
+ define sizeof_file (file)
+ {
+ variable st = stat_file (file);
+ if (st == NULL)
+ throw IOError, sprintf ("%s: %s", file, errno_string (errno));
+ return st.st_size;
+ }
+
+
+ SEE ALSO
+ errno, stat_file
+
+--------------------------------------------------------------
+
+error
+
+ SYNOPSIS
+ Generate an error condition (deprecated)
+
+ USAGE
+ error (String_Type msg)
+
+ DESCRIPTION
+ This function has been deprecated in favor of `throw'.
+
+ The `error' function generates a S-Lang `RunTimeError'
+ exception. It takes a single string parameter which is displayed on
+ the stderr output device.
+
+ EXAMPLE
+
+ define add_txt_extension (file)
+ {
+ if (typeof (file) != String_Type)
+ error ("add_extension: parameter must be a string");
+ file += ".txt";
+ return file;
+ }
+
+
+ SEE ALSO
+ verror, message
+
+--------------------------------------------------------------
+
+__get_exception_info
+
+ SYNOPSIS
+ Get information about the current exception
+
+ USAGE
+ Struct_Type __get_exception_info ()
+
+ DESCRIPTION
+ This function returns information about the currently active
+ exception in the form as a structure with the
+ following fields:
+
+ error The current exception, e.g., RunTimeError
+ descr A description of the exception
+ file Name of the file generating the exception
+ line Line number where the exception originated
+ function Function where the exception originated
+ object A user-defined object thrown by the exception
+ message A user-defined message
+ traceback Traceback messages
+
+ If no exception is active, NULL will be returned.
+
+ This same information may also be obtained via the optional argument
+ to the `try' statement:
+
+ variable e = NULL;
+ try (e)
+ {
+ do_something ();
+ }
+ finally
+ {
+ if (e != NULL)
+ vmessage ("An error occurred: %s", e.message);
+ }
+
+
+ SEE ALSO
+ error
+
+--------------------------------------------------------------
+
+message
+
+ SYNOPSIS
+ Print a string onto the message device
+
+ USAGE
+ message (String_Type s)
+
+ DESCRIPTION
+ The `message' function will print the string specified by
+ `s' onto the message device.
+
+ EXAMPLE
+
+ define print_current_time ()
+ {
+ message (time ());
+ }
+
+
+ NOTES
+ The message device will depend upon the application. For example,
+ the output message device for the jed editor corresponds to the
+ line at the bottom of the display window. The default message
+ device is the standard output device.
+
+ SEE ALSO
+ vmessage, sprintf, error
+
+--------------------------------------------------------------
+
+new_exception
+
+ SYNOPSIS
+ Create a new exception
+
+ USAGE
+ new_exception (String_Type name, Int_Type baseclass, String_Type descr)
+
+ DESCRIPTION
+ This function creates a new exception called `name' subclassed
+ upon `baseclass'. The description of the exception is
+ specified by `descr'.
+
+ EXAMPLE
+
+ new_exception ("MyError", RunTimeError, "My very own error");
+ try
+ {
+ if (something_is_wrong ())
+ throw MyError;
+ }
+ catch RunTimeError;
+
+ In this case, catching `RunTimeError' will also catch
+ `MyError' since it is a subclass of `RunTimeError'.
+
+ SEE ALSO
+ error, verror
+
+--------------------------------------------------------------
+
+usage
+
+ SYNOPSIS
+ Generate a usage error
+
+ USAGE
+ usage (String_Type msg)
+
+ DESCRIPTION
+ The `usage' function generates a `UsageError' exception and
+ displays `msg' to the message device.
+
+ EXAMPLE
+ Suppose that a function called `plot' plots an array of `x' and
+ `y' values. Then such a function could be written to issue a
+ usage message if the wrong number of arguments was passed:
+
+ define plot ()
+ {
+ variable x, y;
+
+ if (_NARGS != 2)
+ usage ("plot (x, y)");
+
+ (x, y) = ();
+ % Now do the hard part
+ .
+ .
+ }
+
+
+ SEE ALSO
+ error, message
+
+--------------------------------------------------------------
+
+verror
+
+ SYNOPSIS
+ Generate an error condition (deprecated)
+
+ USAGE
+ verror (String_Type fmt, ...)
+
+ DESCRIPTION
+ This function has been deprecated in favor or `throw'.
+
+ The `verror' function performs the same role as the `error'
+ function. The only difference is that instead of a single string
+ argument, `verror' takes a sprintf style argument list.
+
+ EXAMPLE
+
+ define open_file (file)
+ {
+ variable fp;
+
+ fp = fopen (file, "r");
+ if (fp == NULL) verror ("Unable to open %s", file);
+ return fp;
+ }
+
+
+ NOTES
+ In the current implementation, the `verror' function is not an
+ intrinsic function. Rather it is a predefined S-Lang function using
+ a combination of `sprintf' and `error'.
+
+ To generate a specific exception, a `throw' statement should be
+ used. In fact, a `throw' statement such as:
+
+ if (fp == NULL)
+ throw OpenError, "Unable to open $file"$;
+
+ is preferable to the use of `verror' in the above example.
+
+ SEE ALSO
+ error, Sprintf, vmessage
+
+--------------------------------------------------------------
+
+vmessage
+
+ SYNOPSIS
+ Print a formatted string onto the message device
+
+ USAGE
+ vmessage (String_Type fmt, ...)
+
+ DESCRIPTION
+ The `vmessage' function formats a sprintf style argument list
+ and displays the resulting string onto the message device.
+
+ NOTES
+ In the current implementation, the `vmessage' function is not an
+ intrinsic function. Rather it is a predefined S-Lang function using
+ a combination of `Sprintf' and `message'.
+
+ SEE ALSO
+ message, sprintf, Sprintf, verror
+
+--------------------------------------------------------------
+
+_auto_declare
+
+ SYNOPSIS
+ Set automatic variable declaration mode
+
+ USAGE
+ Integer_Type _auto_declare
+
+ DESCRIPTION
+ The `_auto_declare' variable may be used to have undefined
+ variable implicitly declared. If set to zero, any
+ variable must be declared with a `variable' declaration before it
+ can be used. If set to one, then any undeclared variable will be
+ declared as a `static' variable.
+
+ The `_auto_declare' variable is local to each compilation unit and
+ setting its value in one unit has no effect upon its value in other
+ units. The value of this variable has no effect upon the variables
+ in a function.
+
+ EXAMPLE
+ The following code will not compile if `X' not been
+ declared:
+
+ X = 1;
+
+ However,
+
+ _auto_declare = 1; % declare variables as static.
+ X = 1;
+
+ is equivalent to
+
+ static variable X = 1;
+
+
+ NOTES
+ This variable should be used sparingly and is intended primarily for
+ interactive applications where one types S-Lang commands at a
+ prompt.
+
+--------------------------------------------------------------
+
+__class_id
+
+ SYNOPSIS
+ Return the class-id of a specified type
+
+ USAGE
+ Int_Type __class_id (DataType_Type type)
+
+ DESCRIPTION
+ This function returns the internal class-id of a specified data type.
+
+ SEE ALSO
+ typeof, _typeof, __class_type, __datatype
+
+--------------------------------------------------------------
+
+__class_type
+
+ SYNOPSIS
+ Return the class-type of a specified type
+
+ USAGE
+ Int_Type __class_type (DataType_Type type))
+
+ DESCRIPTION
+ Internally S-Lang objects are classified according to four types:
+ scalar, vector, pointer, and memory managed types. For example, an
+ integer is implemented as a scalar, a complex number as a vector,
+ and a string is represented as a pointer. The `__class_type'
+ function returns an integer representing the class-type associated
+ with the specified data type. Specifically, it returns:
+
+ 0 memory-managed
+ 1 scalar
+ 2 vector
+ 3 pointer
+
+
+ SEE ALSO
+ typeof, _typeof, __class_id, __datatype
+
+--------------------------------------------------------------
+
+current_namespace
+
+ SYNOPSIS
+ Get the name of the current namespace
+
+ USAGE
+ String_Type current_namespace ()
+
+ DESCRIPTION
+ The `current_namespace' function returns the name of the
+ static namespace associated with the compilation unit. If there is
+ no such namespace associated with the compilation unit, then the
+ empty string `""' will be returned.
+
+ SEE ALSO
+ implements, use_namespace, import, evalfile
+
+--------------------------------------------------------------
+
+__datatype
+
+ SYNOPSIS
+ Get the DataType_Type for a specified internal class-id
+
+ USAGE
+ DataType_Type __datatype (Int_Type id)
+
+ DESCRIPTION
+ This function is the inverse of __class_type in the sense that it
+ returns the DataType_Type for the specified class-id. If no
+ such class exists, the function will return NULL.
+
+ NOTES
+ One should not expect distinct interpreter instances to always return
+ the same value for a dynamically assigned class-id such as one
+ defined by a module or one stemming from a `typedef' statement.
+
+ SEE ALSO
+ __class_id, __class_type, typeof
+
+--------------------------------------------------------------
+
+_eqs
+
+ SYNOPSIS
+ Test for equality of two objects
+
+ USAGE
+ Int_Type _eqs (a, b)
+
+ DESCRIPTION
+ This function tests its two arguments for equality and returns 1 if
+ they are equal or 0 otherwise. What it means to be equal depends
+ upon the data types of the objects being compared. If the types are
+ numeric, they are regarded as equal if their numerical values are
+ equal. If they are arrays, then they are equal if they have the
+ same shape with equal elements. If they are structures, then they
+ are equal if they contain identical fields, and the corresponding
+ values are equal.
+
+ EXAMPLE
+
+ _eqs (1, 1) ===> 1
+ _eqs (1, 1.0) ===> 1
+ _eqs ("a", 1) ===> 0
+ _eqs (1,2, 1.0,2.0) ===> 1
+
+
+ NOTES
+ For testing sameness, use `__is_same'.
+
+ SEE ALSO
+ typeof, __is_same, __get_reference, __is_callable
+
+--------------------------------------------------------------
+
+get_environ
+
+ SYNOPSIS
+ Get all environment variables
+
+ USAGE
+ String_Type = get_environ()
+
+ DESCRIPTION
+ The `get_environ' function returns an array of strings
+ representing the environment variables defined for the current
+ process. Each element of the array will be of the form
+ `NAME=VALUE'.
+
+ This function will return NULL if the system does not support this
+ feature.
+
+ SEE ALSO
+ getenv, putenv, is_defined
+
+--------------------------------------------------------------
+
+getenv
+
+ SYNOPSIS
+ Get the value of an environment variable
+
+ USAGE
+ String_Type getenv(String_Type var)
+
+ DESCRIPTION
+ The `getenv' function returns a string that represents the
+ value of an environment variable `var'. It will return
+ NULL if there is no environment variable whose name is given
+ by `var'.
+
+ EXAMPLE
+
+ if (NULL != getenv ("USE_COLOR"))
+ {
+ set_color ("normal", "white", "blue");
+ set_color ("status", "black", "gray");
+ USE_ANSI_COLORS = 1;
+ }
+
+
+ SEE ALSO
+ get_environ, putenv, strlen, is_defined
+
+--------------------------------------------------------------
+
+__get_reference
+
+ SYNOPSIS
+ Get a reference to a global object
+
+ USAGE
+ Ref_Type __get_reference (String_Type nm)
+
+ DESCRIPTION
+ This function returns a reference to a global variable or function
+ whose name is specified by `nm'. If no such object exists, it
+ returns NULL, otherwise it returns a reference.
+
+ EXAMPLE
+ Consider the function:
+
+ define runhooks (hook)
+ {
+ variable f;
+ f = __get_reference (hook);
+ if (f != NULL)
+ @f ();
+ }
+
+ This function could be called from another S-Lang function to allow
+ customization of that function, e.g., if the function represents a
+ jed editor mode, the hook could be called to setup keybindings for
+ the mode.
+
+ SEE ALSO
+ is_defined, typeof, eval, autoload, __is_initialized, __uninitialize
+
+--------------------------------------------------------------
+
+implements
+
+ SYNOPSIS
+ Create a new static namespace
+
+ USAGE
+ implements (String_Type name)
+
+ DESCRIPTION
+ The `implements' function may be used to create a new static
+ namespace and have it associated with the current compilation unit.
+ If a namespace with the specified name already exists, a
+ `NamespaceError' exception will be thrown.
+
+ In addition to creating a new static namespace and associating it
+ with the compilation unit, the function will also create a new
+ private namespace. As a result, any symbols in the previous private
+ namespace will be no longer be accessible. For this reason, it is
+ recommended that this function should be used before any private
+ symbols have been created.
+
+ EXAMPLE
+ Suppose that some file `t.sl' contains:
+
+ implements ("My");
+ define message (x)
+ {
+ Global->message ("My's message: $x"$);
+ }
+ message ("hello");
+
+ will produce `"My's message: hello"'. This `message'
+ function may be accessed from outside the namespace via:
+
+ My->message ("hi");
+
+
+ NOTES
+ Since `message' is an intrinsic function, it is public and may
+ not be redefined in the public namespace.
+
+ The `implements' function should rarely be used. It is
+ preferable to allow a static namespace to be associated with a
+ compilation unit using, e.g., `evalfile'.
+
+ SEE ALSO
+ use_namespace, current_namespace, import
+
+--------------------------------------------------------------
+
+__is_callable
+
+ SYNOPSIS
+ Determine whether or not an object is callable
+
+ USAGE
+ Int_Type __is_callable (obj)
+
+ DESCRIPTION
+ This function may be used to determine if an object is callable by
+ dereferencing the object. It returns 1 if the argument is callable,
+ or zero otherwise.
+
+ EXAMPLE
+
+ __is_callable (7) ==> 0
+ __is_callable (&sin) ==> 1
+ a = &sin;
+ __is_callable (a0) ==> 1
+ __is_callable (&a0) ==> 0
+
+
+ SEE ALSO
+ __is_numeric, is_defined
+
+--------------------------------------------------------------
+
+__is_datatype_numeric
+
+ SYNOPSIS
+ Determine whether or not a type is a numeric type
+
+ USAGE
+ Int_Type __is_datatype_numeric (DataType_Type type)
+
+ DESCRIPTION
+ This function may be used to determine if the specified datatype
+ represents a numeric type. It returns 0 if the datatype does not
+ represents a numeric type; otherwise it returns 1 for an
+ integer type, 2 for a floating point type, and 3 for a complex type.
+
+ SEE ALSO
+ typeof, __is_numeric, __is_callable
+
+--------------------------------------------------------------
+
+__is_numeric
+
+ SYNOPSIS
+ Determine whether or not an object is a numeric type
+
+ USAGE
+ Int_Type __is_numeric (obj)
+
+ DESCRIPTION
+ This function may be used to determine if an object represents a
+ numeric type. It returns 0 if the argument is non-numeric, 1 if it
+ is an integer, 2 if a floating point number, and 3 if it is complex.
+ If the argument is an array, then the array type will be used for
+ the test.
+
+ EXAMPLE
+
+ __is_numeric ("foo"); ==> 0
+ __is_numeric ("0"); ==> 0
+ __is_numeric (0); ==> 1
+ __is_numeric (PI); ==> 2
+ __is_numeric (2j); ==> 3
+ __is_numeric (1,2); ==> 1
+ __is_numeric ({1,2}); ==> 0
+
+
+ SEE ALSO
+ typeof, __is_datatype_numeric
+
+--------------------------------------------------------------
+
+__is_same
+
+ SYNOPSIS
+ Test for sameness of two objects
+
+ USAGE
+ Int_Type __is_same (a, b)
+
+ DESCRIPTION
+ This function tests its two arguments for sameness and returns 1
+ if they are the same, or 0 otherwise. To be the same, the data type of
+ the arguments must match and the values of the objects must
+ reference the same underlying object.
+
+ EXAMPLE
+
+ __is_same (1, 1) ===> 1
+ __is_same (1, 1.0) ===> 0
+ __is_same ("a", 1) ===> 0
+ __is_same (1,2, 1,2) ===> 0
+
+
+ NOTES
+ For testing equality, use `_eqs'.
+
+ SEE ALSO
+ typeof, _eqs, __get_reference, __is_callable
+
+--------------------------------------------------------------
+
+putenv
+
+ SYNOPSIS
+ Add or change an environment variable
+
+ USAGE
+ putenv (String_Type s)
+
+ DESCRIPTION
+ This functions adds string `s' to the environment. Typically,
+ `s' should have the form `"name=value"'. The function
+ throws an `OSError' upon failure.
+
+ NOTES
+ This function may not be available on all systems.
+
+ SEE ALSO
+ getenv, sprintf
+
+--------------------------------------------------------------
+
+__set_argc_argv
+
+ SYNOPSIS
+ Set the argument list
+
+ USAGE
+ __set_argc_argv (Array_Type a)
+
+ DESCRIPTION
+ This function sets the `__argc' and `__argv' intrinsic variables.
+
+--------------------------------------------------------------
+
+_slang_install_prefix
+
+ SYNOPSIS
+ S-Lang's installation prefix
+
+ USAGE
+ String_Type _slang_install_prefix
+
+ DESCRIPTION
+ The value of this variable is set at the S-Lang library's
+ compilation time. On Unix systems, the value corresponds to the
+ value of the `prefix' variable in the Makefile. For normal
+ installations, the library itself will be located in the `lib'
+ subdirectory of the `prefix' directory.
+
+ NOTES
+ The value of this variable may or may not have anything to do with
+ where the slang library is located. As such, it should be regarded
+ as a hint. A standard installation will have the `slsh'
+ library files located in the `share/slsh' subdirectory of the
+ installation prefix.
+
+ SEE ALSO
+ _slang_doc_dir
+
+--------------------------------------------------------------
+
+_slang_utf8_ok
+
+ SYNOPSIS
+ Test if the interpreter running in UTF-8 mode
+
+ USAGE
+ Int_Type _slang_utf8_ok
+
+ DESCRIPTION
+ If the value of this variable is non-zero, then the interpreter is
+ running in UTF-8 mode. In this mode, characters in strings are
+ interpreted as variable length byte sequences according to the
+ semantics of the UTF-8 encoding.
+
+ NOTES
+ When running in UTF-8 mode, one must be careful not to confuse a
+ character with a byte. For example, in this mode the `strlen'
+ function returns the number of characters in a string which may be
+ different than the number of bytes. The latter information may be
+ obtained by the `strbytelen' function.
+
+ SEE ALSO
+ strbytelen, strlen, strcharlen
+
+--------------------------------------------------------------
+
+__tmp
+
+ SYNOPSIS
+ Returns the value of a variable and uninitialize the variable
+
+ USAGE
+ __tmp (x)
+
+ DESCRIPTION
+ The `__tmp' function takes a single argument, a variable,
+ returns the value of the variable, and then undefines the variable.
+ The purpose of this pseudo-function is to free any memory
+ associated with a variable if that variable is going to be
+ re-assigned.
+
+ EXAMPLE
+
+ x = 3;
+ y = __tmp(x);
+
+ will result in `y' having a value of `3' and `x' will be undefined.
+
+ NOTES
+ This function is a pseudo-function because a syntax error results if
+ used like
+
+ __tmp(sin(x));
+
+
+ SEE ALSO
+ __uninitialize, __is_initialized
+
+--------------------------------------------------------------
+
+__uninitialize
+
+ SYNOPSIS
+ Uninitialize a variable
+
+ USAGE
+ __uninitialize (Ref_Type x)
+
+ DESCRIPTION
+ The `__uninitialize' function may be used to uninitialize the
+ variable referenced by the parameter `x'.
+
+ EXAMPLE
+ The following two lines are equivalent:
+
+ () = __tmp(z);
+ __uninitialize (&z);
+
+
+ SEE ALSO
+ __tmp, __is_initialized
+
+--------------------------------------------------------------
+
+use_namespace
+
+ SYNOPSIS
+ Change to another namespace
+
+ USAGE
+ use_namespace (String_Type name)
+
+ DESCRIPTION
+ The `use_namespace' function changes the current static namespace to
+ the one specified by the parameter. If the specified namespace
+ does not exist, a `NamespaceError' exception will be generated.
+
+ SEE ALSO
+ implements, current_namespace, import
+
+--------------------------------------------------------------
+
+path_basename
+
+ SYNOPSIS
+ Get the basename part of a filename
+
+ USAGE
+ String_Type path_basename (String_Type filename)
+
+ DESCRIPTION
+ The `path_basename' function returns the basename associated
+ with the `filename' parameter. The basename is the non-directory
+ part of the filename, e.g., on unix `c' is the basename of
+ `/a/b/c'.
+
+ SEE ALSO
+ path_dirname, path_extname, path_concat, path_is_absolute
+
+--------------------------------------------------------------
+
+path_basename_sans_extname
+
+ SYNOPSIS
+ Get the basename part of a filename but without the extension
+
+ USAGE
+ String_Type path_basename_sans_extname (String_Type path)
+
+ DESCRIPTION
+ The `path_basename_sans_extname' function returns the basename
+ associated with the `filename' parameter, omitting the
+ extension if present. The basename is the non-directory part of
+ the filename, e.g., on unix `c' is the basename of
+ `/a/b/c'.
+
+ SEE ALSO
+ path_dirname, path_basename, path_extname, path_concat, path_is_absolute
+
+--------------------------------------------------------------
+
+path_concat
+
+ SYNOPSIS
+ Combine elements of a filename
+
+ USAGE
+ String_Type path_concat (String_Type dir, String_Type basename)
+
+ DESCRIPTION
+ The `path_concat' function combines the arguments `dir' and
+ `basename' to produce a filename. For example, on Unix if
+ `dir' is `x/y' and `basename' is `z', then the
+ function will return `x/y/z'.
+
+ SEE ALSO
+ path_dirname, path_basename, path_extname, path_is_absolute
+
+--------------------------------------------------------------
+
+path_dirname
+
+ SYNOPSIS
+ Get the directory name part of a filename
+
+ USAGE
+ String_Type path_dirname (String_Type filename)
+
+ DESCRIPTION
+ The `path_dirname' function returns the directory name
+ associated with a specified filename.
+
+ NOTES
+ On systems that include a drive specifier as part of the filename,
+ the value returned by this function will also include the drive
+ specifier.
+
+ SEE ALSO
+ path_basename, path_extname, path_concat, path_is_absolute
+
+--------------------------------------------------------------
+
+path_extname
+
+ SYNOPSIS
+ Return the extension part of a filename
+
+ USAGE
+ String_Type path_extname (String_Type filename)
+
+ DESCRIPTION
+ The `path_extname' function returns the extension portion of the
+ specified filename. If an extension is present, this function will
+ also include the dot as part of the extension, e.g., if `filename'
+ is `"file.c"', then this function will return `".c"'. If no
+ extension is present, the function returns an empty string `""'.
+
+ NOTES
+ Under VMS, the file version number is not returned as part of the
+ extension.
+
+ SEE ALSO
+ path_sans_extname, path_dirname, path_basename, path_concat, path_is_absolute
+
+--------------------------------------------------------------
+
+path_get_delimiter
+
+ SYNOPSIS
+ Get the value of a search-path delimiter
+
+ USAGE
+ Char_Type path_get_delimiter ()
+
+ DESCRIPTION
+ This function returns the value of the character used to delimit
+ fields of a search-path.
+
+ SEE ALSO
+ set_slang_load_path, get_slang_load_path
+
+--------------------------------------------------------------
+
+path_is_absolute
+
+ SYNOPSIS
+ Determine whether or not a filename is absolute
+
+ USAGE
+ Int_Type path_is_absolute (String_Type filename)
+
+ DESCRIPTION
+ The `path_is_absolute' function will return non-zero if
+ `filename' refers to an absolute filename, otherwise it returns zero.
+
+ SEE ALSO
+ path_dirname, path_basename, path_extname, path_concat
+
+--------------------------------------------------------------
+
+path_sans_extname
+
+ SYNOPSIS
+ Strip the extension from a filename
+
+ USAGE
+ String_Type path_sans_extname (String_Type filename)
+
+ DESCRIPTION
+ The `path_sans_extname' function removes the file name extension
+ (including the dot) from the filename and returns the result.
+
+ SEE ALSO
+ path_basename_sans_extname, path_extname, path_basename, path_dirname, path_concat
+
+--------------------------------------------------------------
+
+close
+
+ SYNOPSIS
+ Close an open file descriptor
+
+ USAGE
+ Int_Type close (FD_Type fd)
+
+ DESCRIPTION
+ The `close' function is used to close an open file descriptor
+ created by the `open' function. Upon success 0 is returned,
+ otherwise the function returns -1 and sets `errno' accordingly.
+
+ SEE ALSO
+ open, _close, fclose, read, write
+
+--------------------------------------------------------------
+
+_close
+
+ SYNOPSIS
+ Close an open file descriptor
+
+ USAGE
+ Int_Type _close (Int_Type fd)
+
+ DESCRIPTION
+ The `_close' function is used to close the underlying integer
+ open file descriptor. Upon success 0 is returned, otherwise the
+ function returns -1 and sets `errno' accordingly.
+
+ SEE ALSO
+ open, _fileno, close, fclose, read, write
+
+--------------------------------------------------------------
+
+dup_fd
+
+ SYNOPSIS
+ Duplicate a file descriptor
+
+ USAGE
+ FD_Type dup_fd (FD_Type fd)
+
+ DESCRIPTION
+ The `dup_fd' function duplicates a specified file descriptor and
+ returns the duplicate. If the function fails, NULL will be
+ returned and `errno' set accordingly.
+
+ NOTES
+ This function is essentially a wrapper around the POSIX `dup'
+ function.
+
+ SEE ALSO
+ open, close
+
+--------------------------------------------------------------
+
+dup2_fd
+
+ SYNOPSIS
+ Duplicate a file descriptor
+
+ USAGE
+ Int_Type dup2_fd (FD_Type fd, int newfd)
+
+ DESCRIPTION
+ The `dup2_fd' function makes `newfd' a copy of the
+ specified file descriptor `fd'. Upon success returns `newfd',
+ otherwise it returns -1 and sets `errno' accordingly.
+
+ SEE ALSO
+ dup, open, close, _close, _fileno, read
+
+--------------------------------------------------------------
+
+_fileno
+
+ SYNOPSIS
+ Get the underlying integer file descriptor
+
+ USAGE
+ Int_Type _fileno (File_Type|FD_Type fp)
+
+ DESCRIPTION
+ The `_fileno' function returns the underlying integer
+ descriptor for a specified stdio File_Type or
+ FD_Type object. Upon failure it returns -1 and sets
+ `errno' accordingly.
+
+ SEE ALSO
+ fileno, fopen, open, fclose, close, dup_fd
+
+--------------------------------------------------------------
+
+fileno
+
+ SYNOPSIS
+ Convert a stdio File_Type object to a FD_Type descriptor
+
+ USAGE
+ FD_Type fileno (File_Type fp)
+
+ DESCRIPTION
+ The `fileno' function returns the FD_Type descriptor
+ associated with the stdio File_Type file pointer. Upon failure,
+ NULL is returned.
+
+ NOTES
+ Closing the resulting file descriptor will have no effect.
+
+ SEE ALSO
+ fopen, open, fclose, close, dup_fd, _fileno
+
+--------------------------------------------------------------
+
+isatty
+
+ SYNOPSIS
+ Determine if an open file descriptor refers to a terminal
+
+ USAGE
+ Int_Type isatty (FD_Type or File_Type fd)
+
+ DESCRIPTION
+ This function returns 1 if the file descriptor `fd' refers to a
+ terminal; otherwise it returns 0. The object `fd' may either
+ be a File_Type stdio descriptor or a lower-level FD_Type
+ object.
+
+ SEE ALSO
+ fopen, fclose, fileno, ttyname
+
+--------------------------------------------------------------
+
+lseek
+
+ SYNOPSIS
+ Reposition a file descriptor's file pointer
+
+ USAGE
+ Long_Type lseek (FD_Type fd, LLong_Type ofs, int mode)
+ The `lseek' function repositions the file pointer associated
+ with the open file descriptor `fd' to the offset `ofs'
+ according to the mode parameter. Specifically, `mode' must be
+ one of the values:
+
+ SEEK_SET Set the offset to ofs from the beginning of the file
+ SEEK_CUR Add ofs to the current offset
+ SEEK_END Add ofs to the current file size
+
+ Upon error, `lseek' returns -1 and sets `errno'. If
+ successful, it returns the new filepointer offset.
+
+ NOTES
+ Not all file descriptors are capable of supporting the seek
+ operation, e.g., a descriptor associated with a pipe.
+
+ By using SEEK_END with a positive value of the `ofs'
+ parameter, it is possible to position the file pointer beyond the
+ current size of the file.
+
+ SEE ALSO
+ fseek, ftell, open, close
+
+--------------------------------------------------------------
+
+open
+
+ SYNOPSIS
+ Open a file
+
+ USAGE
+ FD_Type open (String_Type filename, Int_Type flags ,Int_Type mode)
+
+ DESCRIPTION
+ The `open' function attempts to open a file specified by the
+ `filename' parameter according to the `flags' parameter,
+ which must be one of the following values:
+
+ O_RDONLY (read-only)
+ O_WRONLY (write-only)
+ O_RDWR (read/write)
+
+ In addition, `flags' may also be bitwise-or'd with any of the
+ following:
+
+ O_BINARY (open the file in binary mode)
+ O_TEXT (open the file in text mode)
+ O_CREAT (create the file if it does not exist)
+ O_EXCL (fail if the file already exists)
+ O_NOCTTY (do not make the device the controlling terminal)
+ O_TRUNC (truncate the file if it exists)
+ O_APPEND (open the file in append mode)
+ O_NONBLOCK (open the file in non-blocking mode)
+
+ Some of these flags make sense only when combined with other flags.
+ For example, if O_EXCL is used, then O_CREAT must also be
+ specified, otherwise unpredictable behavior may result.
+
+ If O_CREAT is used for the `flags' parameter then the
+ `mode' parameter must be present. `mode' specifies the
+ permissions to use if a new file is created. The actual file
+ permissions will be affected by the process's `umask' via
+ `mode&~umask'. The `mode' parameter's value is
+ constructed via bitwise-or of the following values:
+
+ S_IRWXU (Owner has read/write/execute permission)
+ S_IRUSR (Owner has read permission)
+ S_IWUSR (Owner has write permission)
+ S_IXUSR (Owner has execute permission)
+ S_IRWXG (Group has read/write/execute permission)
+ S_IRGRP (Group has read permission)
+ S_IWGRP (Group has write permission)
+ S_IXGRP (Group has execute permission)
+ S_IRWXO (Others have read/write/execute permission)
+ S_IROTH (Others have read permission)
+ S_IWOTH (Others have write permission)
+ S_IXOTH (Others have execute permission)
+
+ Upon success `open' returns a file descriptor object
+ (FD_Type), otherwise NULL is returned and `errno'
+ is set.
+
+ NOTES
+ If you are not familiar with the `open' system call, then it
+ is recommended that you use `fopen' instead and use the higher
+ level stdio interface.
+
+ SEE ALSO
+ fopen, close, read, write, stat_file
+
+--------------------------------------------------------------
+
+read
+
+ SYNOPSIS
+ Read from an open file descriptor
+
+ USAGE
+ UInt_Type read (FD_Type fd, Ref_Type buf, UInt_Type num)
+
+ DESCRIPTION
+ The `read' function attempts to read at most `num' bytes
+ into the variable indicated by `buf' from the open file
+ descriptor `fd'. It returns the number of bytes read, or -1
+ upon failure and sets `errno'. The number of bytes
+ read may be less than `num', and will be zero if an attempt is
+ made to read past the end of the file.
+
+ NOTES
+ `read' is a low-level function and may return -1 for a variety
+ of reasons. For example, if non-blocking I/O has been specified for
+ the open file descriptor and no data is available for reading then
+ the function will return -1 and set `errno' to EAGAIN.
+
+ SEE ALSO
+ fread, open, close, write
+
+--------------------------------------------------------------
+
+ttyname
+
+ SYNOPSIS
+ Get the pathname of the terminal
+
+ USAGE
+ String_Type ttyname (FD_Type fd)
+
+ DESCRIPTION
+ This function returns the pathname of the terminal associated with
+ the file descriptor `fd' or NULL if `fd' does not refer
+ to a terminal.
+
+ NOTES
+ This function is not available in all systems.
+
+ SEE ALSO
+ isatty
+
+--------------------------------------------------------------
+
+write
+
+ SYNOPSIS
+ Write to an open file descriptor
+
+ USAGE
+ UInt_Type write (FD_Type fd, BString_Type buf)
+
+ DESCRIPTION
+ The `write' function attempts to write the bytes specified by
+ the `buf' parameter to the open file descriptor `fd'. It
+ returns the number of bytes successfully written, or -1 and sets
+ `errno' upon failure. The number of bytes written may be less
+ than `length(buf)'.
+
+ SEE ALSO
+ read, fwrite, open, close
+
+--------------------------------------------------------------
+
+getegid
+
+ SYNOPSIS
+ Get the effective group id of the current process
+
+ USAGE
+ Int_Type getegid ()
+
+ DESCRIPTION
+ The `getegid' function returns the effective group ID of the
+ current process.
+
+ NOTES
+ This function is not supported by all systems.
+
+ SEE ALSO
+ getgid, geteuid, setgid
+
+--------------------------------------------------------------
+
+geteuid
+
+ SYNOPSIS
+ Get the effective user-id of the current process
+
+ USAGE
+ Int_Type geteuid ()
+
+ DESCRIPTION
+ The `geteuid' function returns the effective user-id of the
+ current process.
+
+ NOTES
+ This function is not supported by all systems.
+
+ SEE ALSO
+ getuid, setuid, setgid
+
+--------------------------------------------------------------
+
+getgid
+
+ SYNOPSIS
+ Get the group id of the current process
+
+ USAGE
+ Integer_Type getgid ()
+
+ DESCRIPTION
+ The `getgid' function returns the real group id of the current
+ process.
+
+ NOTES
+ This function is not supported by all systems.
+
+ SEE ALSO
+ getpid, getppid
+
+--------------------------------------------------------------
+
+getpgid
+
+ SYNOPSIS
+ Get the process group id
+
+ USAGE
+ Int_Type getpgid (Int_Type pid)
+
+ DESCRIPTION
+ The `getpgid' function returns the process group id of the
+ process whose process is `pid'. If `pid' is 0, then the
+ current process will be used.
+
+ NOTES
+ This function is not supported by all systems.
+
+ SEE ALSO
+ getpgrp, getpid, getppid
+
+--------------------------------------------------------------
+
+getpgrp
+
+ SYNOPSIS
+ Get the process group id of the calling process
+
+ USAGE
+ Int_Type getpgrp ()
+
+ DESCRIPTION
+ The `getpgrp' function returns the process group id of the
+ current process.
+
+ NOTES
+ This function is not supported by all systems.
+
+ SEE ALSO
+ getpgid, getpid, getppid
+
+--------------------------------------------------------------
+
+getpid
+
+ SYNOPSIS
+ Get the current process id
+
+ USAGE
+ Integer_Type getpid ()
+
+ DESCRIPTION
+ The `getpid' function returns the current process identification
+ number.
+
+ SEE ALSO
+ getppid, getgid
+
+--------------------------------------------------------------
+
+getppid
+
+ SYNOPSIS
+ Get the parent process id
+
+ USAGE
+ Integer_Type getppid ()
+
+ DESCRIPTION
+ The `getpid' function returns the process identification
+ number of the parent process.
+
+ NOTES
+ This function is not supported by all systems.
+
+ SEE ALSO
+ getpid, getgid
+
+--------------------------------------------------------------
+
+getpriority
+
+ SYNOPSIS
+ Get a process's scheduling priority
+
+ USAGE
+ result = getpriority (which, who)
+
+ DESCRIPTION
+ The `setpriority' function may be used to obtain the kernel's
+ scheduling priority for a process, process group, or a user depending
+ upon the values of the `which' and `who' parameters.
+ Specifically, if the value of `which' is `PRIO_PROCESS',
+ then the value of `who' specifies the process id of the affected
+ process. If `which' is `PRIO_PGRP', then `who'
+ specifies a process group id. If `which' is `PRIO_USER',
+ then the value of `who' is interpreted as a user id. For the
+ latter two cases, where `which' refers to a set of processes,
+ the value returned corresponds to the highest priority of a process
+ in the set. A value of 0 may be used for who to denote the process
+ id, process group id, or real user ID of the current process.
+
+ Upon success, the function returns the specified priority value. If
+ an error occurs, the function will return NULL with `errno' set
+ accordingly.
+
+ SEE ALSO
+ setpriority, getpid, getppid
+
+--------------------------------------------------------------
+
+getrusage
+
+ SYNOPSIS
+ Get process resource usage
+
+ USAGE
+ Struct_Type getrusage (Int_Type who)
+
+ DESCRIPTION
+ This function returns a structure whose fields contain information
+ about the resource usage of calling process, summed over all threads
+ of the process. The optional integer argument `who' may be
+ used to obtain resource usage of child processes, or of the calling
+ thread itself. Specifically, the optional integer argument
+ `who' may take on one of the following values:
+
+ RUSAGE_SELF (default)
+ RUSAGE_CHILDREN
+
+ If `RUSAGE_CHILDREN' is specified, then the process information
+ will be the sum of all descendents of the calling process that have
+ terminated and have been waited for (via, e.g., `waitpid'). It
+ will not contain any information about child processes that have not
+ terminated.
+
+ The structure that is returned will contain the following fields:
+
+ ru_utimesecs user CPU time used (Double_Type secs)
+ ru_stimesecs system CPU time used (Double_Type secs)
+ ru_maxrss maximum resident_set_size
+ ru_minflt page reclaims (soft page faults)
+ ru_majflt page faults (hard page faults)
+ ru_inblock block input operations
+ ru_oublock block output operations
+ ru_nvcsw voluntary context switches
+ ru_nivcsw involuntary context switches
+ ru_ixrss integral shared memory size
+ ru_idrss integral unshared data size
+ ru_isrss integral unshared stack size
+ ru_nswap swaps
+ ru_msgsnd IPC messages sent
+ ru_msgrcv IPC messages received
+ ru_nsignals signals received
+
+ Some of the fields may not be supported for a particular OS or
+ kernel version. For example, on Linux the 2.6.32 kernel supports
+ only the following fields:
+
+ ru_utimesecs
+ ru_stimesecs
+ ru_maxrss (since Linux 2.6.32)
+ ru_minflt
+ ru_majflt
+ ru_inblock (since Linux 2.6.22)
+ ru_oublock (since Linux 2.6.22)
+ ru_nvcsw (since Linux 2.6)
+ ru_nivcsw (since Linux 2.6)
+
+
+ NOTES
+ The underlying system call returns the CPU user and system times
+ as C `struct timeval' objects. For convenience, the interpreter
+ interface represents these objects as double precision floating point
+ values.
+
+ SEE ALSO
+ times
+
+--------------------------------------------------------------
+
+getsid
+
+ SYNOPSIS
+ get the session id of a process
+
+ USAGE
+ Int_Type getsid (Int_Type pid)
+
+ DESCRIPTION
+ The `getsid' function returns the session id of the current
+ process. If the optional integer `pid' argument is given, then
+ the function returns the session id of the specified process id.
+
+ SEE ALSO
+ setsid, getpid, getpid
+
+--------------------------------------------------------------
+
+getuid
+
+ SYNOPSIS
+ Get the user-id of the current process
+
+ USAGE
+ Int_Type getuid ()
+
+ DESCRIPTION
+ The `getuid' function returns the user-id of the current
+ process.
+
+ NOTES
+ This function is not supported by all systems.
+
+ SEE ALSO
+ getuid, getegid
+
+--------------------------------------------------------------
+
+kill
+
+ SYNOPSIS
+ Send a signal to a process
+
+ USAGE
+ Integer_Type kill (Integer_Type pid, Integer_Type sig)
+
+ DESCRIPTION
+ This function may be used to send a signal given by the integer `sig'
+ to the process specified by `pid'. The function returns zero upon
+ success or `-1' upon failure setting `errno' accordingly.
+
+ EXAMPLE
+ The `kill' function may be used to determine whether or not
+ a specific process exists:
+
+ define process_exists (pid)
+ {
+ if (-1 == kill (pid, 0))
+ return 0; % Process does not exist
+ return 1;
+ }
+
+
+ NOTES
+ This function is not supported by all systems.
+
+ SEE ALSO
+ killpg, getpid
+
+--------------------------------------------------------------
+
+killpg
+
+ SYNOPSIS
+ Send a signal to a process group
+
+ USAGE
+ Integer_Type killpg (Integer_Type pgrppid, Integer_Type sig)
+
+ DESCRIPTION
+ This function may be used to send a signal given by the integer `sig'
+ to the process group specified by `pgrppid'. The function returns zero upon
+ success or `-1' upon failure setting `errno' accordingly.
+
+ NOTES
+ This function is not supported by all systems.
+
+ SEE ALSO
+ kill, getpid
+
+--------------------------------------------------------------
+
+mkfifo
+
+ SYNOPSIS
+ Create a named pipe
+
+ USAGE
+ Int_Type mkfifo (String_Type name, Int_Type mode)
+
+ DESCRIPTION
+ The `mkfifo' attempts to create a named pipe with the specified
+ name and mode (modified by the process's umask). The function
+ returns 0 upon success, or -1 and sets `errno' upon failure.
+
+ NOTES
+ Not all systems support the `mkfifo' function and even on
+ systems that do implement the `mkfifo' system call, the
+ underlying file system may not support the concept of a named pipe,
+ e.g, an NFS filesystem.
+
+ SEE ALSO
+ stat_file
+
+--------------------------------------------------------------
+
+setgid
+
+ SYNOPSIS
+ Set the group-id of the current process
+
+ USAGE
+ Int_Type setgid (Int_Type gid)
+
+ DESCRIPTION
+ The `setgid' function sets the effective group-id of the current
+ process. It returns zero upon success, or -1 upon error and sets
+ `errno' appropriately.
+
+ NOTES
+ This function is not supported by all systems.
+
+ SEE ALSO
+ getgid, setuid
+
+--------------------------------------------------------------
+
+setpgid
+
+ SYNOPSIS
+ Set the process group-id
+
+ USAGE
+ Int_Type setpgid (Int_Type pid, Int_Type gid)
+
+ DESCRIPTION
+ The `setpgid' function sets the group-id `gid' of the
+ process whose process-id is `pid'. If `pid' is 0, then the
+ current process-id will be used. If `pgid' is 0, then the pid
+ of the affected process will be used.
+
+ If successful 0 will be returned, otherwise the function will
+ return -1 and set `errno' accordingly.
+
+ NOTES
+ This function is not supported by all systems.
+
+ SEE ALSO
+ setgid, setuid
+
+--------------------------------------------------------------
+
+setpriority
+
+ SYNOPSIS
+ Set the scheduling priority for a process
+
+ USAGE
+ Int_Type setpriority (which, who, prio)
+
+ DESCRIPTION
+ The `setpriority' function may be used to set the kernel's
+ scheduling priority for a process, process group, or a user depending
+ upon the values of the `which' and `who' parameters.
+ Specifically, if the value of `which' is `PRIO_PROCESS', then the
+ value of `who' specifies the process id of the affected process.
+ If `which' is `PRIO_PGRP', then `who' specifies a process
+ group id. If `which' is `PRIO_USER', then the value of
+ `who' is interpreted as a user id. A value of 0 may be used for
+ who to denote the process id, process group id, or real user ID of
+ the current process.
+
+ Upon sucess, the `setpriority' function returns 0. If an error occurs,
+ -1 is returned and errno will be set accordingly.
+
+ EXAMPLE
+ The `getpriority' and `setpriority' functions may be used
+ to implement a `nice' function for incrementing the priority of
+ the current process as follows:
+
+ define nice (dp)
+ {
+ variable p = getpriority (PRIO_PROCESS, 0);
+ if (p == NULL)
+ return -1;
+ variable s = setpriority (PRIO_PROCESS, 0, p + dp);
+ if (s == -1)
+ return -1;
+ return getpriority (PRIO_PROCESS, 0);
+ }
+
+
+ NOTES
+ Priority values are sometimes called "nice" values. The actual
+ range of priority values is system dependent but commonly range from
+ -20 to 20, with -20 being the highest scheduling priority, and +20
+ the lowest.
+
+ SEE ALSO
+ getpriority, getpid
+
+--------------------------------------------------------------
+
+setsid
+
+ SYNOPSIS
+ Create a new session for the current process
+
+ USAGE
+ Int_Type setsid ()
+
+ DESCRIPTION
+ If the current process is not a session leader, the `setsid'
+ function will create a new session and make the process the session
+ leader for the new session. It returns the the process group id of
+ the new session.
+
+ Upon failure, -1 will be returned and `errno' set accordingly.
+
+ SEE ALSO
+ getsid, setpgid
+
+--------------------------------------------------------------
+
+setuid
+
+ SYNOPSIS
+ Set the user-id of the current process
+
+ USAGE
+ Int_Type setuid (Int_Type id)
+
+ DESCRIPTION
+ The `setuid' function sets the effective user-id of the current
+ process. It returns zero upon success, or -1 upon error and sets
+ `errno' appropriately.
+
+ NOTES
+ This function is not supported by all systems.
+
+ SEE ALSO
+ setgid, setpgid, getuid, geteuid
+
+--------------------------------------------------------------
+
+sleep
+
+ SYNOPSIS
+ Pause for a specified number of seconds
+
+ USAGE
+ sleep (Double_Type n)
+
+ DESCRIPTION
+ The `sleep' function delays the current process for the
+ specified number of seconds. If it is interrupted by a signal, it
+ will return prematurely.
+
+ NOTES
+ Not all system support sleeping for a fractional part of a second.
+
+--------------------------------------------------------------
+
+statvfs
+
+ SYNOPSIS
+ Get file system statistics
+
+ USAGE
+ Struct_Type statvfs (fsobj)
+
+ DESCRIPTION
+ This function is a wrapper around the corresponding POSIX function.
+ It returns a structure whose fields provide information about the
+ filesystem object `fsobj'. This object can be either a path
+ name within the file system, or an open file descriptor represented
+ by an integer, File_Type, or FD_Type object.
+
+ The fields of the structure are defined as follows:
+
+ f_bsize : file system block size
+ f_frsize : fragment size
+ f_blocks : size of fs in f_frsize units
+ f_bfree : number of free blocks
+ f_bavail : number of free blocks for unprivileged users
+ f_files : number of inodes
+ f_ffree : number of free inodes
+ f_favail : number of free inodes for unprivileged users
+ f_fsid : file system ID
+ f_flag : mount flags
+ f_namemax: maximum filename length
+
+ The value of the `f_flag' field is a bitmapped integer composed
+ of the following bits:
+
+ ST_RDONLY : Read-only file system.
+ ST_NOSUID : Set-user-ID/set-group-ID bits are ignored by the exec
+ functions.
+
+
+ Upon error, the function returns NULL and sets `errno'
+ accordingly.
+
+ NOTES
+ This function is not supported by all systems.
+
+ SEE ALSO
+ stat_file
+
+--------------------------------------------------------------
+
+system
+
+ SYNOPSIS
+ Execute a shell command
+
+ USAGE
+ Integer_Type system (String_Type cmd)
+
+ DESCRIPTION
+ The `system' function may be used to execute the string
+ expression `cmd' in an inferior shell. This function is an
+ interface to the C `system' function which returns an
+ implementation-defined result. On Linux, it returns 127 if the
+ inferior shell could not be invoked, -1 if there was some other
+ error, otherwise it returns the return code for `cmd'.
+
+ EXAMPLE
+
+ define dir ()
+ {
+ () = system ("DIR");
+ }
+
+ displays a directory listing of the current directory under MSDOS or
+ VMS.
+
+ SEE ALSO
+ system_intr, new_process, popen
+
+--------------------------------------------------------------
+
+system_intr
+
+ SYNOPSIS
+ Execute a shell command
+
+ USAGE
+ Integer_Type system_intr (String_Type cmd)
+
+ DESCRIPTION
+ The `system_intr' function performs the same task as the
+ `system' function, except that the `SIGINT' signal will not
+ be ignored by the calling process. This means that if a S-Lang script
+ calls `system_intr' function, and Ctrl-C is pressed, both the
+ command invoked by the `system_intr' function and the script
+ will be interrupted. In contrast, if the command were invoked using
+ the `system' function, only the command called by it would be
+ interrupted, but the script would continue executing.
+
+ SEE ALSO
+ system, new_process, popen
+
+--------------------------------------------------------------
+
+umask
+
+ SYNOPSIS
+ Set the file creation mask
+
+ USAGE
+ Int_Type umask (Int_Type m)
+
+ DESCRIPTION
+ The `umask' function sets the file creation mask to the value of
+ `m' and returns the previous mask.
+
+ SEE ALSO
+ stat_file
+
+--------------------------------------------------------------
+
+uname
+
+ SYNOPSIS
+ Get the system name
+
+ USAGE
+ Struct_Type uname ()
+
+ DESCRIPTION
+ The `uname' function returns a structure containing information
+ about the operating system. The structure contains the following
+ fields:
+
+ sysname (Name of the operating system)
+ nodename (Name of the node within the network)
+ release (Release level of the OS)
+ version (Current version of the release)
+ machine (Name of the hardware)
+
+
+ NOTES
+ Not all systems support this function.
+
+ SEE ALSO
+ getenv
+
+--------------------------------------------------------------
+
+qualifier
+
+ SYNOPSIS
+ Get the value of a qualifier
+
+ USAGE
+ value = qualifier (String_Type name ,default_value)
+
+ DESCRIPTION
+ This function may be used to get the value of a qualifier. If the
+ specified qualifier does not exist, NULL will be returned,
+ unless a default value has been provided.
+
+ EXAMPLE
+
+ define echo (text)
+ {
+ variable fp = qualifier ("out", stdout);
+ () = fputs (text, fp);
+ }
+ echo ("hello"); % writes hello to stdout
+ echo ("hello"; out=stderr); % writes hello to stderr
+
+
+ NOTES
+ Since NULL is a valid value for a qualifier, this function is
+ unable to distinguish between a non-existent qualifier and one whose
+ value is NULL. If such a distinction is important, the
+ `qualifier_exists' function can be used. For example,
+
+ define echo (text)
+ {
+ variable fp = stdout;
+ if (qualifier_exists ("use_stderr"))
+ fp = stderr;
+ () = fputs (text, fp);
+ }
+ echo ("hello"; use_stderr); % writes hello to stderr
+
+ In this case, no value was provided for the `use_stderr'
+ qualifier: it exists but has a value of NULL.
+
+ SEE ALSO
+ qualifier_exists, __qualifiers
+
+--------------------------------------------------------------
+
+__qualifiers
+
+ SYNOPSIS
+ Get the active set of qualifiers
+
+ USAGE
+ Struct_Type __qualifiers ()
+
+ DESCRIPTION
+ This function returns the set of qualifiers associated with the
+ current execution context. If qualifiers are active, then the result
+ is a structure representing the names of the qualifiers and their
+ corresponding values. Otherwise NULL will be returned.
+
+ One of the main uses of this function is to pass the current set of
+ qualifiers to another another function. For example, consider a
+ plotting application with a function called called `lineto' that
+ sets the pen-color before drawing the line to the specified point:
+
+ define lineto (x, y)
+ {
+ % The color may be specified by a qualifier, defaulting to black
+ variable color = qualifier ("color", "black");
+ set_pen_color (color);
+ .
+ .
+ }
+
+ The `lineto' function permits the color to be specified by a
+ qualifier. Now consider a function that make use of lineto to draw a
+ line segment between two points:
+
+ define line_segment (x0, y0, x1, y1)
+ {
+ moveto (x0, y0);
+ lineto (x1, y1 ; color=qualifier("color", "black"));
+ }
+ line_segment (1,1, 10,10; color="blue");
+
+ Note that in this implementation of `line_segment', the
+ `color' qualifier was explicitly passed to the `lineto'
+ function. However, this technique does not scale well. For example, the
+ `lineto' function might also take a qualifier that specifies the
+ line-style, to be used as
+
+ line_segment (1,1, 10,10; color="blue", linestyle="solid");
+
+ But the above implementation of `line_segment' does not pass the
+ `linestyle' qualifier. In such a case, it is preferable to pass
+ all the qualifiers, e.g.,
+
+ define line_segment (x0, y0, x1, y1)
+ {
+ moveto (x0, y0);
+ lineto (x1, y1 ;; __qualifiers());
+ }
+
+ Note the use of the double-semi colon in the `lineto'
+ statement. This tells the parser that the qualifiers are specified
+ by a structure-valued argument and not a set of name-value pairs.
+
+ SEE ALSO
+ qualifier, qualifier_exists
+
+--------------------------------------------------------------
+
+qualifier_exists
+
+ SYNOPSIS
+ Check for the existence of a qualifier
+
+ USAGE
+ Int_Type qualifier_exists (String_Type name)
+
+ DESCRIPTION
+ This function will return 1 if a qualifier of the specified name
+ exists, or 0 otherwise.
+
+ SEE ALSO
+ qualifier, __qualifiers
+
+--------------------------------------------------------------
+
+rline_bolp
+
+ SYNOPSIS
+ Test of the editing point is at the beginning of the line
+
+ USAGE
+ Int_Type rline_bolp()
+
+ DESCRIPTION
+ The `rline_bolp' function returns a non-zero value if the
+ current editing position is at the beginning of the line.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_eolp, rline_get_point, rline_get_line
+
+--------------------------------------------------------------
+
+rline_call
+
+ SYNOPSIS
+ Invoke an internal readline function
+
+ USAGE
+ rline_call (String_Type func)
+
+ DESCRIPTION
+ Not all of the readline functions are available directly from the
+ S-Lang interpreter. For example, the "deleol" function, which
+ deletes through the end of the line may be executed using
+
+ rline_call("deleol");
+
+ See the documentation for the `rline_setkey' function for a
+ list of internal functions that may be invoked by `rline_call'.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_setkey, rline_del, rline_ins
+
+--------------------------------------------------------------
+
+rline_del
+
+ SYNOPSIS
+ Delete a specified number of characters at the current position
+
+ USAGE
+ rline_del(Int_Type n)
+
+ DESCRIPTION
+ This function delete a specified number of characters at the current
+ editing position. If the number `n' is less than zero, then the
+ previous `n' characters will be deleted. Otherwise, the next
+ `n' characters will be deleted.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_ins, rline_setkey
+
+--------------------------------------------------------------
+
+rline_eolp
+
+ SYNOPSIS
+ Test of the editing point is at the end of the line
+
+ USAGE
+ Int_Type rline_eolp()
+
+ DESCRIPTION
+ The `rline_bolp' function returns a non-zero value if the
+ current editing position is at the end of the line.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_bolp, rline_get_point, rline_get_line
+
+--------------------------------------------------------------
+
+rline_getkey
+
+ SYNOPSIS
+ Obtain the next byte in the readline input stream
+
+ USAGE
+ Int_Type rline_getkey ()
+
+ DESCRIPTION
+ This function returns the next byte in the readline input stream.
+ If no byte is available, the function will wait until one is.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_input_pending, rline_setkey
+
+--------------------------------------------------------------
+
+rline_get_edit_width
+
+ SYNOPSIS
+ Get the width of the readline edit window
+
+ USAGE
+ Int_Type rline_get_edit_width ()
+
+ DESCRIPTION
+ This function returns the width of the edit window. For `slsh', this
+ number corresponds to the width of the terminal window.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_ins
+
+--------------------------------------------------------------
+
+rline_get_history
+
+ SYNOPSIS
+ Retrieve the readline history
+
+ USAGE
+ Array_Type rline_get_history ()
+
+ DESCRIPTION
+ This function returns the readline edit history as an array of
+ strings.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_set_line
+
+--------------------------------------------------------------
+
+rline_get_line
+
+ SYNOPSIS
+ Get a copy of the line being edited
+
+ USAGE
+ String_Type rline_get_line ()
+
+ DESCRIPTION
+ This function returns the current edit line.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_set_line, rline_get_history
+
+--------------------------------------------------------------
+
+rline_get_point
+
+ SYNOPSIS
+ Get the current editing position
+
+ USAGE
+ Int_Type rline_get_point ()
+
+ DESCRIPTION
+ The `rline_get_point' function returns the byte-offset of the
+ current editing position.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_set_point
+
+--------------------------------------------------------------
+
+rline_input_pending
+
+ SYNOPSIS
+ Test to see if readline input is available for reading
+
+ USAGE
+ Int_Type rline_input_pending (Int_Type tsecs)
+
+ DESCRIPTION
+ This function returns a non-zero value if readline input is
+ available to be read. If none is immediately available, it will
+ wait for up to `tsecs' tenths of a second for input before
+ returning.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_getkey
+
+--------------------------------------------------------------
+
+rline_ins
+
+ SYNOPSIS
+ Insert a string at the current editing point
+
+ USAGE
+ rline_ins (String_Type text)
+
+ DESCRIPTION
+ This function inserts the specified string into the line being edited.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_set_line, rline_del
+
+--------------------------------------------------------------
+
+rline_setkey
+
+ SYNOPSIS
+ Bind a key in the readline keymap to a function
+
+ USAGE
+ rline_setkey (func, keyseq)
+
+ DESCRIPTION
+ The `rline_setkey' function binds the function `func' to
+ the specified key sequence `keyseq'. The value of `func'
+ may be either a reference to a S-Lang function, or a string giving
+ the name of an internal readline function.
+
+ Functions that are internal to the readline interface include:
+
+ bdel Delete the previous character
+ bol Move to the beginning of the line
+ complete The command line completion function
+ del Delete the character at the current position
+ delbol Delete to the beginning of the line
+ deleol Delete through the end of the line
+ down Goto the next line in the history
+ enter Return to the caller of the readline function
+ eol Move to the end of the line
+ kbd_quit Abort editing of the current line
+ left Move left one character
+ quoted_insert Insert the next byte into the line
+ redraw Redraw the line
+ right Move right one character
+ self_insert Insert the byte that invoked the function
+ trim Remove whitespace about the current position
+ up Goto the previous line in the history
+
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_unsetkey
+
+--------------------------------------------------------------
+
+rline_set_completion_callback
+
+ SYNOPSIS
+ Set the function to be used for completion at the readline prompt
+
+ USAGE
+ rline_set_completion_callback (Ref_Type func)
+
+ DESCRIPTION
+ This function sets the callback function to be used for completion at the
+ readline prompt. The callback function must be defined to accept
+ two values, the first being a string containing the text of the line
+ being edited, and an integer giving the position of the byte-offset
+ into the string where completion was requested.
+
+ The callback function must return two values: an array giving the
+ list of possible completion strings, and an integer giving the byte
+ offset into the string of the start of the text to be completed.
+
+ EXAMPLE
+ See completion-callback function defined in the `slsh' library file
+ `rline/complete.sl'.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_set_list_completions_callback
+
+--------------------------------------------------------------
+
+rline_set_history
+
+ SYNOPSIS
+ Replace the current history list with a new one
+
+ USAGE
+ rline_set_history (Array_Type lines)
+
+ DESCRIPTION
+ The `rline_set_history' function replaces the current history
+ by the specified array of strings.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_get_history
+
+--------------------------------------------------------------
+
+rline_set_line
+
+ SYNOPSIS
+ Replace the current line with a new one
+
+ USAGE
+ rline_set_line (String_Type line)
+
+ DESCRIPTION
+ The `rline_set_line' function replaces the line being edited by
+ the specified one.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_get_line
+
+--------------------------------------------------------------
+
+rline_set_list_completions_callback
+
+ SYNOPSIS
+ Set a callback function to display the list of completions
+
+ USAGE
+ rline_set_list_completions_callback (Ref_Type func)
+
+ DESCRIPTION
+ This function sets the S-Lang function that is to be used to display the
+ list of possible completions for current word at the readline prompt.
+ The callback function must be defined to accept a single parameter
+ representing an array of completion strings.
+
+ EXAMPLE
+ This callback function writes the completions using the message
+ functions:
+
+ private define display_completions (strings)
+ {
+ variable str;
+ vmessage ("There are %d completions:\n", length(strings));
+ foreach str (strings) vmessage ("%s\n", str);
+ }
+ rline_set_list_completions_callback (&display_completions);
+
+
+ SEE ALSO
+ rline_set_completion_callback
+
+--------------------------------------------------------------
+
+rline_set_point
+
+ SYNOPSIS
+ Move the current editing position to another
+
+ USAGE
+ rline_set_point (Int_Type ofs)
+
+ DESCRIPTION
+ The `rline_set_point' function sets the editing point to the
+ specified byte-offset from the beginning of the line.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_get_point
+
+--------------------------------------------------------------
+
+rline_unsetkey
+
+ SYNOPSIS
+ Unset a key binding from the readline keymap
+
+ USAGE
+ rline_unsetkey (String_Type keyseq)
+
+ DESCRIPTION
+ The `rline_unsetkey' function unbinds the specified key sequence
+ from the readline keymap.
+
+ NOTES
+ This function is part of the S-Lang readline interface.
+
+ SEE ALSO
+ rline_setkey
+
+--------------------------------------------------------------
+
+alarm
+
+ SYNOPSIS
+ Schedule an alarm signal
+
+ USAGE
+ alarm (UInt_Type secs , Ref_Type secs_remaining)
+
+ DESCRIPTION
+ The `alarm' function schedules the delivery of a SIGALRM
+ signal in `secs' seconds. Any previously scheduled alarm will
+ be canceled. If `secs' is zero, then no new alarm will be
+ scheduled. If the second argument is present, then it must be a
+ reference to a variable whose value will be set upon return to the
+ number of seconds remaining for a previously scheduled alarm to take
+ place.
+
+ EXAMPLE
+ This example demonstrates how the `alarm' function may be
+ used to read from `stdin' within a specified amount of time:
+
+ define sigalrm_handler (sig)
+ {
+ throw ReadError, "Read timed out";
+ }
+ define read_or_timeout (secs)
+ {
+ variable line, err;
+ signal (SIGALRM, &sigalrm_handler);
+ () = fputs ("Enter some text> ", stdout); () = fflush (stdout);
+ alarm (secs);
+ try (err)
+ {
+ if (-1 == fgets (&line, stdin))
+ throw ReadError, "Failed to read from stdin";
+ }
+ catch IOError:
+ {
+ message (err.message);
+ return NULL;
+ }
+ return line;
+ }
+
+
+ NOTES
+ Some operating systems may implement the `sleep' function using
+ `alarm'. As a result, it is not a good idea to mix calls to
+ `alarm' and `sleep'.
+
+ The default action for SIGALRM is to terminate the process.
+ Hence, if `alarm' is called it is wise to establish a signal
+ handler for `SIGALRM'.
+
+ SEE ALSO
+ signal, sleep, setitimer, getitimer
+
+--------------------------------------------------------------
+
+getitimer
+
+ SYNOPSIS
+ Get the value of an interval timer
+
+ USAGE
+ (secs, period) = getitimer (Int_Type timer)
+
+ DESCRIPTION
+ This function returns the value of the specified interval timer as a
+ pair of double precision values: `period' and `secs'.
+
+ The value of `secs' indicates the number of seconds
+ remaining before the timer expires. A value of 0 for
+ `secs' indicates that the timer is inactive.
+ The value of `period' indicates the periodicity of the timer.
+ That is, when the timer goes off, it will automatically be reset to
+ go off again after `period' seconds.
+
+ There are 3 interval timers available: ITIMER_REAL,
+ ITIMER_VIRTUAL, and ITIMER_PROF.
+
+ The ITIMER_REAL timer operates in real time and when the time
+ elapses, a SIGALRM will be sent to the process.
+
+ The ITIMER_VIRTUAL timer operates in the virtual time of the
+ process; that is, when process is actively running. When it
+ elapses, SIGVTALRM will be sent to the process.
+
+ The ITIMER_PROF operates when the process is actively
+ running, or when the kernel is performing a task on behalf of the
+ process. It sends a SIGPROF signal to the process.
+
+ NOTES
+ The interaction between these timers and the `sleep' and
+ `alarm' functions is OS dependent.
+
+ The resolution of a timer is system dependent; typical values are on
+ the order of milliseconds.
+
+ SEE ALSO
+ setitimer, alarm, signal
+
+--------------------------------------------------------------
+
+setitimer
+
+ SYNOPSIS
+ Set the value of an interval timer
+
+ USAGE
+ setitimer (Int_Type timer, secs , period ,&old_secs, &old_period)
+
+ DESCRIPTION
+ This function sets the value of a specified interval timer, and
+ optionally returns the previous value. The value of the
+ `timer' argument must be one of the 3 interval timers
+ ITIMER_REAL, ITIMER_VIRTUAL, or ITIMER_PROF.
+ See the documentation for the `getitimer' function for
+ information about the semantics of these timers.
+
+ The value of the `secs' parameter specifies the expiration time
+ for the timer. If this value is 0, the timer will be disabled.
+ Unless a non-zero value for the optional `period' parameter is
+ given, the timer will be disabled after it expires. Otherwise,
+ the timer will reset to go off with a period of `period' seconds.
+
+ The final two optional arguments are references to variables that
+ will be set to the previous values associated with the timer.
+
+ SEE ALSO
+ getitimer, alarm, signal
+
+--------------------------------------------------------------
+
+signal
+
+ SYNOPSIS
+ Establish a signal handler
+
+ USAGE
+ signal (Int_Type sig, Ref_Type func ,Ref_Type old_func)
+
+ DESCRIPTION
+ The `signal' function assigns the signal handler represented by
+ `func' to the signal `sig'. Here `func' is usually
+ reference to a function that takes an integer argument (the signal)
+ and returns nothing, e.g.,
+
+ define signal_handler (sig)
+ {
+ return;
+ }
+
+ Alternatively, `func' may be given by one of the symbolic
+ constants SIG_IGN or SIG_DFL to indicate that the
+ signal is to be ignored or given its default action, respectively.
+
+ The first parameter, `sig', specifies the signal to be handled.
+ The actual supported values vary with the OS. Common values on Unix
+ include `SIGHUP', `SIGINT', and `SIGTERM'.
+
+ If a third argument is present, then it must be a reference to a
+ variable whose value will be set to the value of the previously
+ installed handler.
+
+ EXAMPLE
+ This example establishes a handler for `SIGTSTP'.
+
+ static define sig_suspend (); % forward declaration
+ static define sig_suspend (sig)
+ {
+ message ("SIGTSTP received-- stopping");
+ signal (sig, SIG_DFL);
+ () = kill (getpid(), SIGSTOP);
+ message ("Resuming");
+ signal (sig, &sig_suspend);
+ }
+ signal (SIGTSTP, &sig_suspend);
+
+
+ NOTES
+ Currently the signal interface is supported only on systems that
+ implement signals according to the POSIX standard.
+
+ Once a signal has been received, it will remain blocked until after
+ the signal handler has completed. This is the reason SIGSTOP
+ was used in the above signal handler instead of SIGTSTP.
+
+ SEE ALSO
+ alarm, sigsuspend, sigprocmask
+
+--------------------------------------------------------------
+
+sigprocmask
+
+ SYNOPSIS
+ Change the list of currently blocked signals
+
+ USAGE
+ sigprocmask (Int_Type how, Array_Type mask ,Ref_Type old_mask)
+
+ DESCRIPTION
+ The `sigprocmask' function may be used to change the list of
+ signals that are currently blocked. The first parameter indicates
+ how this is accomplished. Specifically, `how' must be one of
+ the following values: SIG_BLOCK, SIG_UNBLOCK, or
+ SIG_SETMASK.
+
+ If `how' is SIG_BLOCK, then the set of blocked signals
+ will be the union the current set with the values specified in the
+ `mask' argument.
+
+ If `how' is SIG_UNBLOCK, then the signals specified by
+ the `mask' parameter will be removed from the currently blocked
+ set.
+
+ If `how' is SIG_SETMASK, then the set of blocked signals
+ will be set to those given by the `mask'.
+
+ If a third argument is present, then it must be a reference to a
+ variable whose value will be set to the previous signal mask.
+
+ SEE ALSO
+ signal, sigsuspend, alarm
+
+--------------------------------------------------------------
+
+sigsuspend
+
+ SYNOPSIS
+ Suspend the process until a signal is delivered
+
+ USAGE
+ sigsuspend (Array_Type signal_mask)
+
+ DESCRIPTION
+ The `sigsuspend' function suspends the current process
+ until a signal is received. An optional array argument may be
+ passed to the function to specify a list of signals that should be
+ temporarily blocked while waiting for a signal.
+
+ EXAMPLE
+ The following example pauses the current process for 10 seconds
+ while blocking the SIGHUP and SIGINT signals.
+
+ static variable Tripped;
+ define sigalrm_handler (sig)
+ {
+ Tripped = 1;
+ }
+ signal (SIGALRM, &sigalrm_handler);
+ Tripped = 0;
+ alarm (10);
+ while (Tripped == 0) sigsuspend (SIGHUP, SIGINT);
+
+ Note that in this example the call to `sigsuspend' was wrapped in
+ a while-loop. This was necessary because there is no guarantee that
+ another signal would not cause `sigsuspend' to return.
+
+ SEE ALSO
+ signal, alarm, sigprocmask
+
+--------------------------------------------------------------
+
+dup
+
+ SYNOPSIS
+ Duplicate the value at the top of the stack
+
+ USAGE
+ dup ()
+
+ DESCRIPTION
+ This function returns an exact duplicate of the object on top of the
+ stack. For some objects such as arrays or structures, it creates a
+ new reference to the object. However, for simple scalar S-Lang types such
+ as strings, integers, and doubles, it creates a new copy of the
+ object.
+
+ SEE ALSO
+ pop, typeof
+
+--------------------------------------------------------------
+
+exch
+
+ SYNOPSIS
+ Exchange two items on the stack
+
+ USAGE
+ exch ()
+
+ DESCRIPTION
+ The `exch' swaps the two top items on the stack.
+
+ SEE ALSO
+ pop, _stk_reverse, _stk_roll
+
+--------------------------------------------------------------
+
+pop
+
+ SYNOPSIS
+ Discard an item from the stack
+
+ USAGE
+ pop ()
+
+ DESCRIPTION
+ The `pop' function removes the top item from the stack.
+
+ SEE ALSO
+ _pop_n, __pop_args
+
+--------------------------------------------------------------
+
+__pop_args
+
+ SYNOPSIS
+ Remove n function arguments from the stack
+
+ USAGE
+ args = __pop_args(Integer_Type n)
+
+ DESCRIPTION
+ This function, together with the companion function
+ `__push_args', is useful for creating a function that takes a
+ variable number of arguments, as well as passing the arguments of
+ one function to another function.
+
+ `__pop_args' removes the specified number of values from the
+ stack and returns them as an array of structures of the corresponding
+ length. Each structure in the array consists of a single
+ field called `value', which represents the value of the
+ argument.
+
+ EXAMPLE
+ Consider the following function. It prints all its arguments to
+ `stdout' separated by spaces:
+
+ define print_args ()
+ {
+ variable i;
+ variable args = __pop_args (_NARGS);
+
+ for (i = 0; i < _NARGS; i++)
+ {
+ () = fputs (string (argsi.value), stdout);
+ () = fputs (" ", stdout);
+ }
+ () = fputs ("\n", stdout);
+ () = fflush (stdout);
+ }
+
+ Now consider the problem of defining a function called `ones'
+ that returns a multi-dimensional array with all the elements set to
+ 1. For example, `ones(10)' should return a 1-d array of 10
+ ones, whereas `ones(10,20)' should return a 10x20 array.
+
+ define ones ()
+ {
+ !if (_NARGS) return 1;
+ variable a;
+
+ a = __pop_args (_NARGS);
+ return @Array_Type (Integer_Type, __push_args (a)) + 1;
+ }
+
+ Here, `__push_args' was used to push the arguments passed to
+ the `ones' function onto the stack to be used when dereferencing
+ Array_Type.
+
+ NOTES
+ This function has been superseded by the `__pop_list' function,
+ which returns the objects as a list instead of an array of structures.
+
+ SEE ALSO
+ __push_args, __pop_list, __push_list, typeof, _pop_n
+
+--------------------------------------------------------------
+
+__pop_list
+
+ SYNOPSIS
+ Convert items on the stack to a List_Type
+
+ USAGE
+ List_Type = __pop_list (Int_Type n)
+
+ DESCRIPTION
+ This function removes a specified number of items from the stack and
+ converts returns them in the form of a list.
+
+ EXAMPLE
+
+ define print_args ()
+ {
+ variable list = __pop_list (_NARGS);
+ variable i;
+ _for i (0, length(list)-1, 1)
+ {
+ vmessage ("arg%d: %S", i, listi);
+ }
+ }
+
+
+ SEE ALSO
+ __push_list
+
+--------------------------------------------------------------
+
+_pop_n
+
+ SYNOPSIS
+ Remove objects from the stack
+
+ USAGE
+ _pop_n (Integer_Type n);
+
+ DESCRIPTION
+ The `_pop_n' function removes the specified number of objects
+ from the top of the stack.
+
+ SEE ALSO
+ _stkdepth, pop
+
+--------------------------------------------------------------
+
+_print_stack
+
+ SYNOPSIS
+ Print the values on the stack.
+
+ USAGE
+ _print_stack ()
+
+ DESCRIPTION
+ This function dumps out what is currently on the S-Lang stack. It does not
+ alter the stack and it is usually used for debugging purposes.
+
+ SEE ALSO
+ _stkdepth, string, message
+
+--------------------------------------------------------------
+
+__push_args
+
+ SYNOPSIS
+ Move n function arguments onto the stack
+
+ USAGE
+ __push_args (Struct_Type args);
+
+ DESCRIPTION
+ This function together with the companion function `__pop_args'
+ is useful for the creation of functions that take a variable number
+ of arguments. See the description of `__pop_args' for more
+ information.
+
+ NOTES
+ This function has been superseded by the `__push_list' function.
+
+ SEE ALSO
+ __pop_args, __push_list, __pop_list, typeof, _pop_n
+
+--------------------------------------------------------------
+
+__push_list
+
+ SYNOPSIS
+ Push the elements of a list to the stack
+
+ USAGE
+ __push_list (List_Type list)
+
+ DESCRIPTION
+ This function pushes the elements of a list to the stack.
+
+ EXAMPLE
+
+ private define list_to_array (list)
+ {
+ return __push_list (list);
+ }
+
+
+ SEE ALSO
+ __pop_list
+
+--------------------------------------------------------------
+
+_stkdepth
+
+ USAGE
+ Get the number of objects currently on the stack
+
+ SYNOPSIS
+ Integer_Type _stkdepth ()
+
+ DESCRIPTION
+ The `_stkdepth' function returns number of items on the stack.
+
+ SEE ALSO
+ _print_stack, _stk_reverse, _stk_roll
+
+--------------------------------------------------------------
+
+_stk_reverse
+
+ SYNOPSIS
+ Reverse the order of the objects on the stack
+
+ USAGE
+ _stk_reverse (Integer_Type n)
+
+ DESCRIPTION
+ The `_stk_reverse' function reverses the order of the top
+ `n' items on the stack.
+
+ SEE ALSO
+ _stkdepth, _stk_roll
+
+--------------------------------------------------------------
+
+_stk_roll
+
+ SYNOPSIS
+ Roll items on the stack
+
+ USAGE
+ _stk_roll (Integer_Type n)
+
+ DESCRIPTION
+ This function may be used to alter the arrangement of objects on the
+ stack. Specifically, if the integer `n' is positive, the top
+ `n' items on the stack are rotated up. If
+ `n' is negative, the top `abs(n)' items on the stack are
+ rotated down.
+
+ EXAMPLE
+ If the stack looks like:
+
+ item-0
+ item-1
+ item-2
+ item-3
+
+ where `item-0' is at the top of the stack, then
+ `_stk_roll(-3)' will change the stack to:
+
+ item-2
+ item-0
+ item-1
+ item-3
+
+
+ NOTES
+ This function only has an effect if `abs(n) > 1'.
+
+ SEE ALSO
+ _stkdepth, _stk_reverse, _pop_n, _print_stack
+
+--------------------------------------------------------------
+
+clearerr
+
+ SYNOPSIS
+ Clear the error of a file stream
+
+ USAGE
+ clearerr (File_Type fp)
+
+ DESCRIPTION
+ The `clearerr' function clears the error and end-of-file flags
+ associated with the open file stream `fp'.
+
+ SEE ALSO
+ ferror, feof, fopen
+
+--------------------------------------------------------------
+
+fclose
+
+ SYNOPSIS
+ Close a file
+
+ USAGE
+ Integer_Type fclose (File_Type fp)
+
+ DESCRIPTION
+ The `fclose' function may be used to close an open file pointer
+ `fp'. Upon success it returns zero, and upon failure it sets
+ `errno' and returns `-1'. Failure usually indicates a that
+ the file system is full or that `fp' does not refer to an open file.
+
+ NOTES
+ Many C programmers call `fclose' without checking the return
+ value. The S-Lang language requires the programmer to explicitly
+ handle any value returned by a function. The simplest way to
+ handle the return value from `fclose' is to call it via:
+
+ () = fclose (fp);
+
+
+ SEE ALSO
+ fopen, fgets, fflush, pclose, errno
+
+--------------------------------------------------------------
+
+fdopen
+
+ SYNOPSIS
+ Convert a FD_Type file descriptor to a stdio File_Type object
+
+ USAGE
+ File_Type fdopen (FD_Type, String_Type mode)
+
+ DESCRIPTION
+ The `fdopen' function creates and returns a stdio
+ File_Type object from the open FD_Type
+ descriptor `fd'. The `mode' parameter corresponds to the
+ `mode' parameter of the `fopen' function and must be
+ consistent with the mode of the descriptor `fd'. The function
+ returns NULL upon failure and sets `errno'.
+
+ NOTES
+ Since the stdio File_Type object created by this function
+ is derived from the FD_Type descriptor, the FD_Type
+ is regarded as more fundamental than the File_Type object.
+ This means that the descriptor must be in scope while the
+ File_Type object is used. In particular, if the descriptor
+ goes out of scope, the descriptor will get closed causing I/O to the
+ File_Type object to fail, e.g.,
+
+ fd = open ("/path/to/file", O_RDONLY);
+ fp = fdopen (fd);
+ fd = 0; % This will cause the FD_Type descriptor to go out of
+ % scope. Any I/O on fp will now fail.
+
+
+ Calling the `fclose' function on the File_Type object
+ will cause the underlying descriptor to close.
+
+ Any stdio File_Type object created by the `fdopen'
+ function will remain associated with the FD_Type descriptor,
+ unless the object is explicitly removed via `fclose'. This
+ means that code such as
+
+ fd = open (...);
+ loop (50)
+ {
+ fp = fdopen (fd, ...);
+ .
+ .
+ }
+
+ will result in 50 File_Type objects attached to `fd'
+ after the loop has terminated.
+
+ SEE ALSO
+ fileno, fopen, open, close, fclose, dup_fd
+
+--------------------------------------------------------------
+
+feof
+
+ SYNOPSIS
+ Get the end-of-file status
+
+ USAGE
+ Integer_Type feof (File_Type fp)
+
+ DESCRIPTION
+ This function may be used to determine the state of the end-of-file
+ indicator of the open file descriptor `fp'. It returns zero
+ if the indicator is not set, or non-zero if it is. The end-of-file
+ indicator may be cleared by the `clearerr' function.
+
+ SEE ALSO
+ ferror, clearerr, fopen
+
+--------------------------------------------------------------
+
+ferror
+
+ SYNOPSIS
+ Determine the error status of an open file descriptor
+
+ USAGE
+ Integer_Type ferror (File_Type fp)
+
+ DESCRIPTION
+ This function may be used to determine the state of the error
+ indicator of the open file descriptor `fp'. It returns zero
+ if the indicator is not set, or non-zero if it is. The error
+ indicator may be cleared by the `clearerr' function.
+
+ SEE ALSO
+ feof, clearerr, fopen
+
+--------------------------------------------------------------
+
+fflush
+
+ SYNOPSIS
+ Flush an output stream
+
+ USAGE
+ Integer_Type fflush (File_Type fp)
+
+ DESCRIPTION
+ The `fflush' function may be used to update the stdio _output_
+ stream specified by `fp'. It returns 0 upon success, or
+ -1 upon failure and sets `errno' accordingly. In
+ particular, this function will fail if `fp' does not represent
+ an open output stream, or if `fp' is associated with a disk file and
+ there is insufficient disk space.
+
+ EXAMPLE
+ This example illustrates how to use the `fflush' function
+ without regard to the return value:
+
+ () = fputs ("Enter value> ", stdout);
+ () = fflush (stdout);
+
+
+ SEE ALSO
+ fopen, fclose
+
+--------------------------------------------------------------
+
+fgets
+
+ SYNOPSIS
+ Read a line from a file
+
+ USAGE
+ Integer_Type fgets (SLang_Ref_Type ref, File_Type fp)
+
+ DESCRIPTION
+ `fgets' reads a line from the open file specified by `fp'
+ and places the characters in the variable whose reference is
+ specified by `ref'.
+ It returns -1 if `fp' is not associated with an open file
+ or an attempt was made to read at the end the file; otherwise, it
+ returns the number of characters read.
+
+ EXAMPLE
+ The following example returns the lines of a file via a linked list:
+
+ define read_file (file)
+ {
+ variable buf, fp, root, tail;
+ variable list_type = struct { text, next };
+
+ root = NULL;
+
+ fp = fopen(file, "r");
+ if (fp == NULL)
+ throw OpenError, "fopen failed to open $file for reading"$;
+ while (-1 != fgets (&buf, fp))
+ {
+ if (root == NULL)
+ {
+ root = @list_type;
+ tail = root;
+ }
+ else
+ {
+ tail.next = @list_type;
+ tail = tail.next;
+ }
+ tail.text = buf;
+ tail.next = NULL;
+ }
+ () = fclose (fp);
+ return root;
+ }
+
+
+ SEE ALSO
+ fgetslines, fopen, fclose, fputs, fread, error
+
+--------------------------------------------------------------
+
+fgetslines
+
+ SYNOPSIS
+ Read lines as an array from an open file
+
+ USAGE
+ String_Type fgetslines (File_Type fp ,Int_Type num)
+
+ DESCRIPTION
+ The `fgetslines' function reads a specified number of
+ lines as an array of strings from the file associated with the
+ file pointer `fp'. If the number of lines to be read is left
+ unspecified, the function will return the rest of the lines in the
+ file. If the file is empty, an empty string array will be returned.
+ The function returns NULL upon error.
+
+ EXAMPLE
+ The following function returns the number of lines in a file:
+
+ define count_lines_in_file (file)
+ {
+ variable fp, lines;
+
+ fp = fopen (file, "r");
+ if (fp == NULL)
+ return -1;
+
+ lines = fgetslines (fp);
+ if (lines == NULL)
+ return -1;
+
+ return length (lines);
+ }
+
+ Note that the file was implicitly closed when the variable `fp'
+ goes out of scope (in the case, when the function returns).
+
+ SEE ALSO
+ fgets, fread, fopen, fputslines
+
+--------------------------------------------------------------
+
+fopen
+
+ SYNOPSIS
+ Open a file
+
+ USAGE
+ File_Type fopen (String_Type f, String_Type m)
+
+ DESCRIPTION
+ The `fopen' function opens a file `f' according to the mode
+ string `m'. Allowed values for `m' are:
+
+ "r" Read only
+ "w" Write only
+ "a" Append
+ "r+" Reading and writing at the beginning of the file.
+ "w+" Reading and writing. The file is created if it does not
+ exist; otherwise, it is truncated.
+ "a+" Reading and writing at the end of the file. The file is created
+ if it does not already exist.
+
+ In addition, the mode string can also include the letter `'b''
+ as the last character to indicate that the file is to be opened in
+ binary mode.
+
+ Upon success, `fopen' returns a File_Type object which is
+ meant to be used by other operations that require an open file
+ pointer. Upon failure, the function returns NULL.
+
+ EXAMPLE
+ The following function opens a file in append mode and writes a
+ string to it:
+
+ define append_string_to_file (str, file)
+ {
+ variable fp = fopen (file, "a");
+ if (fp == NULL)
+ throw OpenError, "$file could not be opened"$;
+ () = fputs (str, fp);
+ () = fclose (fp);
+ }
+
+ Note that the return values from `fputs' and `fclose' were
+ ignored.
+
+ NOTES
+ There is no need to explicitly close a file opened with `fopen'.
+ If the returned File_Type object goes out of scope, the
+ interpreter will automatically close the file. However, explicitly
+ closing a file with `fclose' and checking its return value is
+ recommended.
+
+ SEE ALSO
+ fclose, fgets, fputs, popen
+
+--------------------------------------------------------------
+
+fprintf
+
+ SYNOPSIS
+ Create and write a formatted string to a file
+
+ USAGE
+ Int_Type fprintf (File_Type fp, String_Type fmt, ...)
+
+ DESCRIPTION
+ `fprintf' formats the objects specified by the variable argument
+ list according to the format `fmt' and write the result to the
+ open file pointer `fp'.
+
+ The format string obeys the same syntax and semantics as the
+ `sprintf' format string. See the description of the
+ `sprintf' function for more information.
+
+ `fprintf' returns the number of bytes written to the file,
+ or -1 upon error.
+
+ SEE ALSO
+ fputs, printf, fwrite, message
+
+--------------------------------------------------------------
+
+fputs
+
+ SYNOPSIS
+ Write a string to an open stream
+
+ USAGE
+ Integer_Type fputs (String_Type s, File_Type fp)
+
+ DESCRIPTION
+ The `fputs' function writes the string `s' to the open file
+ pointer `fp'. It returns -1 upon failure and sets `errno',
+ otherwise it returns the length of the string.
+
+ EXAMPLE
+ The following function opens a file in append mode and uses the
+ `fputs' function to write to it.
+
+ define append_string_to_file (str, file)
+ {
+ variable fp;
+ fp = fopen (file, "a");
+ if (fp == NULL)
+ throw OpenError, "Unable to open $file"$;
+ if ((-1 == fputs (str, fp))
+ || (-1 == fclose (fp)))
+ throw WriteError, "Error writing to $file"$;
+ }
+
+
+ NOTES
+ One must not disregard the return value from the `fputs'
+ function. Doing so may lead to a stack overflow error.
+
+ To write an object that contains embedded null characters, use the
+ `fwrite' function.
+
+ SEE ALSO
+ fclose, fopen, fgets, fwrite
+
+--------------------------------------------------------------
+
+fputslines
+
+ SYNOPSIS
+ Write an array of strings to an open file
+
+ USAGE
+ Int_Type fputslines (String_Typea, File_Type fp)
+
+ DESCRIPTION
+ The `fputslines' function writes an array of strings to the
+ specified file pointer. It returns the number of elements
+ successfully written. Any NULL elements in the array will be
+ skipped.
+
+ EXAMPLE
+
+ if (length (lines) != fputslines (lines, fp))
+ throw WriteError;
+
+
+ SEE ALSO
+ fputs, fgetslines, fopen
+
+--------------------------------------------------------------
+
+fread
+
+ SYNOPSIS
+ Read binary data from a file
+
+ USAGE
+ UInt_Type fread (Ref_Type b, DataType_Type t, UInt_Type n, File_Type fp)
+
+ DESCRIPTION
+ The `fread' function may be used to read `n' objects of type
+ `t' from an open file pointer `fp'. Upon success, it
+ returns the number of objects read from the file and places the
+ objects in variable specified by `b'. Upon error or
+ end-of-file, it returns -1 and sets `errno' accordingly.
+
+ If more than one object is read from the file, those objects will be
+ placed in an array of the appropriate size.
+
+ EXAMPLE
+ The following example illustrates how to read 50 integers from a file:
+
+ define read_50_ints_from_a_file (file)
+ {
+ variable fp, n, buf;
+
+ fp = fopen (file, "rb");
+ if (fp == NULL)
+ throw OpenError;
+ n = fread (&buf, Int_Type, 50, fp);
+ if (n == -1)
+ throw ReadError, "fread failed";
+ () = fclose (fp);
+ return buf;
+ }
+
+
+ NOTES
+ Use the `pack' and `unpack' functions to read data with a
+ specific byte-ordering.
+
+ The `fread_bytes' function may be used to read a specified number of
+ bytes in the form of a binary string (`BString_Type').
+
+ If an attempt is made to read at the end of a file, the function
+ will return -1. To distinguish this condition from a system error,
+ the `feof' function should be used. This distinction is
+ particularly important when reading from a socket or pipe.
+
+ SEE ALSO
+ fread_bytes, fwrite, fgets, feof, ferror, fopen, pack, unpack
+
+--------------------------------------------------------------
+
+fread_bytes
+
+ SYNOPSIS
+ Read bytes from a file as a binary-string
+
+ USAGE
+ UInt_Type fread_bytes (Ref_Type b, UInt_Type n, File_Type fp)
+
+ DESCRIPTION
+ The `fread_bytes' function may be used to read `n' bytes
+ from from an open file pointer `fp'. Upon success, it returns
+ the number of bytes read from the file and assigns to the variable
+ attached to the reference `b' a binary string formed from the
+ bytes read. Upon error or end of file, the function returns
+ -1 and sets `errno' accordingly.
+
+ NOTES
+ Use the `pack' and `unpack' functions to read data with a
+ specific byte-ordering.
+
+ SEE ALSO
+ fread, fwrite, fgets, fopen, pack, unpack
+
+--------------------------------------------------------------
+
+fseek
+
+ SYNOPSIS
+ Reposition a stdio stream
+
+ USAGE
+ Integer_Type fseek (File_Type fp, LLong_Type ofs, Integer_Type whence)
+
+ DESCRIPTION
+ The `fseek' function may be used to reposition the file position
+ pointer associated with the open file stream `fp'. Specifically,
+ it moves the pointer `ofs' bytes relative to the position
+ indicated by `whence'. If `whence' is set to one of the symbolic
+ constants SEEK_SET, SEEK_CUR, or SEEK_END, the
+ offset is relative to the start of the file, the current position
+ indicator, or end-of-file, respectively.
+
+ The function returns 0 upon success, or -1 upon failure and sets
+ `errno' accordingly.
+
+ EXAMPLE
+ define rewind (fp)
+ {
+ if (0 == fseek (fp, 0, SEEK_SET)) return;
+ vmessage ("rewind failed, reason: %s", errno_string (errno));
+ }
+
+ SEE ALSO
+ ftell, fopen
+
+--------------------------------------------------------------
+
+ftell
+
+ SYNOPSIS
+ Obtain the current position in an open stream
+
+ USAGE
+ LLong_Type ftell (File_Type fp)
+
+ DESCRIPTION
+ The ftell function may be used to obtain the current position in the
+ stream associated with the open file pointer `fp'. It returns
+ the position of the pointer measured in bytes from the beginning of
+ the file. Upon error, it returns `-1' and sets `errno'
+ accordingly.
+
+ SEE ALSO
+ fseek, fopen
+
+--------------------------------------------------------------
+
+fwrite
+
+ SYNOPSIS
+ Write binary data to a file
+
+ USAGE
+ UInt_Type fwrite (b, File_Type fp)
+
+ DESCRIPTION
+ The `fwrite' function may be used to write the object represented by
+ `b' to an open file. If `b' is a string or an array, the
+ function will attempt to write all elements of the object to the
+ file. It returns the number of elements successfully written,
+ otherwise it returns -1 upon error and sets `errno'
+ accordingly.
+
+ EXAMPLE
+ The following example illustrates how to write an integer array to a
+ file. In this example, `fp' is an open file descriptor:
+
+ variable a = 1:50; % 50 element integer array
+ if (50 != fwrite (a, fp))
+ throw WriteError;
+
+ Here is how to write the array one element at a time:
+
+ variable ai, a = 1:50;
+
+ foreach ai (a)
+ {
+ if (1 != fwrite(ai, fp))
+ throw WriteError;
+ }
+
+
+ NOTES
+ Not all data types may be supported the `fwrite' function. It
+ is supported by all vector, scalar, and string objects.
+
+ SEE ALSO
+ fread, fputs, fopen, pack, unpack
+
+--------------------------------------------------------------
+
+pclose
+
+ SYNOPSIS
+ Close a process pipe
+
+ USAGE
+ Integer_Type pclose (File_Type fp)
+
+ DESCRIPTION
+ The `pclose' function waits for the process associated with
+ `fp' to exit and then returns the exit status of the command.
+
+ SEE ALSO
+ popen, fclose
+
+--------------------------------------------------------------
+
+popen
+
+ SYNOPSIS
+ Open a pipe to a process
+
+ USAGE
+ File_Type popen (String_Type cmd, String_Type mode)
+
+ DESCRIPTION
+ The `popen' function executes a process specified by `cmd'
+ and opens a unidirectional pipe to the newly created process. The
+ `mode' indicates whether or not the pipe is open for reading
+ or writing. Specifically, if `mode' is `"r"', then the
+ pipe is opened for reading, or if `mode' is `"w"', then the
+ pipe will be open for writing.
+
+ Upon success, a File_Type pointer will be returned, otherwise
+ the function failed and NULL will be returned.
+
+ NOTES
+ This function is not available on all systems.
+
+ The `process' module's `new_process' function provides a
+ much more secure and powerful interface to process I/O.
+
+ SEE ALSO
+ new_process, pclose, fopen
+
+--------------------------------------------------------------
+
+printf
+
+ SYNOPSIS
+ Create and write a formatted string to stdout
+
+ USAGE
+ Int_Type printf (String_Type fmt, ...)
+
+ DESCRIPTION
+ `printf' formats the objects specified by the variable argument
+ list according to the format `fmt' and write the result to
+ `stdout'. This function is equivalent to `fprintf' used
+ with the `stdout' file pointer. See `fprintf' for more
+ information.
+
+ `printf' returns the number of bytes written or -1 upon error.
+
+ NOTES
+ Many C programmers do not check the return status of the
+ `printf' C library function. Make sure that if you do not care
+ about whether or not the function succeeds, then code it as in the
+ following example:
+
+ () = printf ("%s laid %d eggs\n", chicken_name, num_egg);
+
+
+ SEE ALSO
+ fputs, fprintf, fwrite, message
+
+--------------------------------------------------------------
+
+setvbuf
+
+ SYNOPSIS
+
+ USAGE
+ Int_Type setvbuf (File_Type fp, Int_Type mode, Int_Type size)
+
+ DESCRIPTION
+ The `setvbuf' function may be used to control how the stdio
+ stream specified by the open File_Type object is buffered.
+
+ The `mode' argument must be one of the following values:
+
+ _IONBF : unbuffered
+ _IOFBF : fully buffered
+ _IOLBF : line buffered
+
+ The `size' argument controls the size of the buffer. If
+ `size' is 0, then the function will not change the size of the
+ buffer, only the mode. Otherwise, `size' is expected to be
+ larger than 0 and a buffer of the requested size will be allocated
+ for the stream.
+ are buffered.
+
+ NOTES
+ This function must be used only after the stream has been opened and
+ before any other operations have been performed on the stream.
+
+ SEE ALSO
+ fopen, fclose, fflush
+
+--------------------------------------------------------------
+
+count_char_occurrences
+
+ SYNOPSIS
+ Count the number of occurrences of a character in a string
+
+ USAGE
+ UInt_Type count_char_occurrences (str, ch)
+
+ DESCRIPTION
+ This function returns the number of times the specified character
+ `ch' occurs in the string `str'.
+
+ NOTES
+ If UTF-8 mode is in effect, then the character may correspond to
+ more than one byte. In such a case, the function returns the number
+ of such byte-sequences in the string. To count actual bytes, use
+ the `count_byte_occurrences' function.
+
+ SEE ALSO
+ count_byte_occurrences
+
+--------------------------------------------------------------
+
+create_delimited_string
+
+ SYNOPSIS
+ Concatenate strings using a delimiter
+
+ USAGE
+ String_Type create_delimited_string (delim, s_1, s_2, ..., s_n, n)
+
+ String_Type delim, s_1, ..., s_n
+ Int_Type n
+
+
+ DESCRIPTION
+ `create_delimited_string' performs a concatenation operation on
+ the `n' strings `s_1', ...,`s_n', using the string
+ `delim' as a delimiter. The resulting string is equivalent to
+ one obtained via
+
+ s_1 + delim + s_2 + delim + ... + s_n
+
+
+ EXAMPLE
+
+ create_delimited_string ("/", "user", "local", "bin", 3);
+
+ will produce `"usr/local/bin"'.
+
+ NOTES
+ New code should use the `strjoin' function, which performs a
+ similar task.
+
+ SEE ALSO
+ strjoin, is_list_element, extract_element, strchop, strcat
+
+--------------------------------------------------------------
+
+extract_element
+
+ SYNOPSIS
+ Extract the nth element of a string with delimiters
+
+ USAGE
+ String_Type extract_element (String_Type list, Int_Type nth, Int_Type delim)
+
+ DESCRIPTION
+ The `extract_element' function may be used to extract the
+ `nth' substring of a string delimited by the character given by
+ the `delim' parameter. If the string contains fewer than the
+ requested substring, the function will return NULL. Substring
+ elements are numbered from 0.
+
+ EXAMPLE
+ The expression
+
+ extract_element ("element 0, element 1, element 2", 1, ',')
+
+ returns the string `" element 1"', whereas
+
+ extract_element ("element 0, element 1, element 2", 1, ' ')
+
+ returns `"0,"'.
+
+ The following function may be used to compute the number of elements
+ in the list:
+
+ define num_elements (list, delim)
+ {
+ variable nth = 0;
+ while (NULL != extract_element (list, nth, delim))
+ nth++;
+ return nth;
+ }
+
+ Alternatively, the `strchop' function may be more useful. In
+ fact, `extract_element' may be expressed in terms of the
+ function `strchop' as
+
+ define extract_element (list, nth, delim)
+ {
+ list = strchop(list, delim, 0);
+ if (nth >= length (list))
+ return NULL;
+ else
+ return listnth;
+ }
+
+ and the `num_elements' function used above may be recoded more
+ simply as:
+
+ define num_elements (list, delim)
+ {
+ return length (strchop (length, delim, 0));
+ }
+
+
+ NOTES
+ New code should make use of the `List_Type' object for lists.
+
+ SEE ALSO
+ is_list_element, is_substr, strtok, strchop, create_delimited_string
+
+--------------------------------------------------------------
+
+glob_to_regexp
+
+ SYNOPSIS
+ Convert a globbing expression to a regular expression
+
+ USAGE
+ String_Type glob_to_regexp (String_Type g)
+
+ DESCRIPTION
+ This function may be used to convert a so-called globbing expression
+ to a regular expression. A globbing expression is frequently used
+ for matching filenames where '?' represents a single character and
+ '*' represents 0 or more characters.
+
+ NOTES
+ The `slsh' program that is distributed with the S-Lang library
+ includes a function called `glob' that is a wrapper around
+ `glob_to_regexp' and `listdir'. It returns a list of
+ filenames matching a globbing expression.
+
+ SEE ALSO
+ string_match, listdir
+
+--------------------------------------------------------------
+
+is_list_element
+
+ SYNOPSIS
+ Test whether a delimited string contains a specific element
+
+ USAGE
+ Int_Type is_list_element (String_Type list, String_Type elem, Int_Type delim)
+
+ DESCRIPTION
+ The `is_list_element' function may be used to determine whether
+ or not a delimited list of substring, `list', contains the element
+ `elem'. If `elem' is not an element of `list', the function
+ will return zero, otherwise, it returns 1 plus the matching element
+ number.
+
+ EXAMPLE
+ The expression
+
+ is_list_element ("element 0, element 1, element 2", "0,", ' ');
+
+ returns `2' since `"0,"' is element number one of the list
+ (numbered from zero).
+
+ SEE ALSO
+ extract_element, is_substr, create_delimited_string
+
+--------------------------------------------------------------
+
+is_substr
+
+ SYNOPSIS
+ Test for a specified substring within a string
+
+ USAGE
+ Int_Type is_substr (String_Type a, String_Type b)
+
+ DESCRIPTION
+ This function may be used to determine if `a' contains the
+ string `b'. If it does not, the function returns 0; otherwise it
+ returns the position of the first occurrence of `b' in `a'
+ expressed in terms of characters, not bytes.
+
+ NOTES
+ This function regards the first character of a string to be given by
+ a position value of 1.
+
+ The distinction between characters and bytes is significant in UTF-8
+ mode.
+
+ This function has been vectorized in the sense that if an array of strings
+ is passed for either of the string-valued arguments, then a
+ corresponding array of integers will be returned. If two arrays
+ are passed then the arrays must have the same length.
+
+ SEE ALSO
+ substr, string_match, strreplace
+
+--------------------------------------------------------------
+
+make_printable_string
+
+ SYNOPSIS
+ Format a string suitable for parsing
+
+ USAGE
+ String_Type make_printable_string(String_Type str)
+
+ DESCRIPTION
+ This function formats a string in such a way that it may be used as
+ an argument to the `eval' function. The resulting string is
+ identical to `str' except that it is enclosed in double quotes
+ and the backslash, newline, control, and double quote characters are
+ expanded.
+
+ SEE ALSO
+ eval, str_quote_string
+
+--------------------------------------------------------------
+
+Sprintf
+
+ SYNOPSIS
+ Format objects into a string (deprecated)
+
+ USAGE
+ String_Type Sprintf (String_Type format, ..., Int_Type n)
+
+ DESCRIPTION
+ This function performs a similar task as the `sprintf'
+ function but requires an additional argument that specifies the
+ number of items to format. For this reason, the `sprintf'
+ function should be used.
+
+ SEE ALSO
+ sprintf, string, sscanf, vmessage
+
+--------------------------------------------------------------
+
+strbskipchar
+
+ SYNOPSIS
+ Get an index to the previous character in a UTF-8 encoded string
+
+ USAGE
+ (p1, wch) = strbskipchar (str, p0 ,skip_combining)
+
+ DESCRIPTION
+ This function moves backward from the 0-based byte-offset `p0'
+ in the string `str' to the previous character in the string.
+ It returns the byte-offset (`p1' of the previous character and
+ the decoded character value at that byte-offset.
+
+ The optional third argument specifies the handling of
+ combining characters. If it is non-zero, combining characters will
+ be ignored, otherwise a combining character will not be treated
+ differently from other characters. The default is to ignore such
+ characters.
+
+ If the byte-offset `p0' corresponds to the end of the string
+ (`p0=0'), then `(p0,0)' will be returned. Otherwise if
+ the byte-offset specifies a value that lies outside the string, an
+ `IndexError' exception will be thrown. Finally, if the
+ byte-offset corresponds to an illegally coded character, the
+ character returned will be the negative byte-value at the position.
+
+ SEE ALSO
+ strskipchar, strskipbytes
+
+--------------------------------------------------------------
+
+sprintf
+
+ SYNOPSIS
+ Format objects into a string
+
+ USAGE
+ String_Type sprintf (String fmt, ...)
+
+ DESCRIPTION
+ The `sprintf' function formats a string from a variable number
+ of arguments according to according to the format specification
+ string `fmt'.
+
+ The format string is a C library `sprintf' style format
+ descriptor. Briefly, the format string may consist of ordinary
+ characters (not including the `%' character), which are copied
+ into the output string as-is, and conversion specification sequences
+ introduced by the `%' character. The number of additional
+ arguments passed to the `sprintf' function must be consistent
+ with the number required by the format string.
+
+ The `%' character in the format string starts a conversion
+ specification that indicates how an object is to be formatted.
+ Usually the percent character is followed immediately by a
+ conversion specification character. However, it may optionally be
+ followed by flag characters, field width characters, and precision
+ modifiers, as described below.
+
+ The character immediately following the `%' character may be
+ one or more of the following flag characters:
+
+ - Use left-justification
+ # Use alternate form for formatting.
+ 0 Use 0 padding
+ + Precede a number by a plus or minus sign.
+ (space) Use a blank instead of a plus sign.
+
+
+ The flag characters (if any) may be followed by an optional field
+ width specification string represented by one or more digit
+ characters. If the size of the formatted object is less than the
+ field width, it will be right-justified in the specified field
+ width, unless the `-' flag was given, in which case it will be
+ left justified.
+
+ If the next character in the control sequence is a period, then it
+ introduces a precision specification sequence. The precision is
+ given by the digit characters following the period. If none are
+ given the precision is taken to be 0. The meaning of the precision
+ specifier depends upon the type of conversion: For integer
+ conversions, it gives the minimum number digits to appear in the
+ output. For `e' and `f' floating point conversions, it
+ gives the number of digits to appear after the decimal point. For
+ the `g' floating point conversion, it gives the maximum number
+ of significant digits to appear. Finally for the `s' and
+ `S' conversions it specifies the maximum number of characters
+ to be copied to the output string.
+
+ The next character in the sequence may be a modifier that controls
+ the size of object to be formatted. It may consist of the following
+ characters:
+
+ h This character is ignored in the current implementation.
+ l The integer is be formatted as a long integer, or a
+ character as a wide character.
+
+
+ Finally the conversion specification sequence ends with the
+ conversion specification character that describes how the object is
+ to be
+ formatted:
+
+ s as a string
+ f as a floating point number
+ e as a float using exponential form, e.g., 2.345e08
+ g format as e or f, depending upon its value
+ c as a character
+ b as a byte
+ % a literal percent character
+ d as a signed decimal integer
+ u as an unsigned decimal integer
+ o as an octal integer
+ X,x as hexadecimal
+ B as a binary integer
+ S convert object to a string and format accordingly
+
+ The `S' conversion specifier is a S-Lang extension which will
+ cause the corresponding object to be converted to a string using the
+ `string' function, and then converted as `s'. formatted as
+ string. In fact, `sprintf("%S",x)' is equivalent to
+ `sprintf("%s",string(x))'.
+
+ EXAMPLE
+
+ sprintf("%s","hello") ===> "hello"
+ sprintf("%s %s","hello", "world") ===> "hello world"
+ sprintf("Agent %.3d",7) ===> "Agent 007"
+ sprintf("%S",PI) ===> "3.141592653589793"
+ sprintf("%g",PI) ===> "3.14159"
+ sprintf("%.2g",PI) ===> "3.1"
+ sprintf("%.2e",PI) ===> "3.14e+00"
+ sprintf("%.2f",PI) ===> "3.14"
+ sprintf("|% 8.2f|",PI) ===> "| 3.14|"
+ sprintf("|%-8.2f|",PI) ===> "|3.14 |"
+ sprintf("|%+8.2f|",PI) ===> "| +3.14|"
+ sprintf("|%8B|", 21) ===> "| 10101|"
+ sprintf("|%.8B|", 21) ===> "|00010101|"
+ sprintf("|%#.8B|", 21) ===> "|0b00010101|"
+ sprintf("%S",{1,2,3}) ===> "List_Type with 3 elements"
+ sprintf("%S",1+2i) ===> "(1 + 2i)"
+
+
+ NOTES
+ The `set_float_format' function controls the format for the
+ `S' conversion of floating point numbers.
+
+ SEE ALSO
+ string, sscanf, message, pack, set_float_format
+
+--------------------------------------------------------------
+
+sscanf
+
+ SYNOPSIS
+ Parse a formatted string
+
+ USAGE
+ Int_Type sscanf (s, fmt, r1, ... rN)
+
+ String_Type s, fmt;
+ Ref_Type r1, ..., rN
+
+
+ DESCRIPTION
+ The `sscanf' function parses the string `s' according to the
+ format `fmt' and sets the variables whose references are given by
+ `r1', ..., `rN'. The function returns the number of
+ references assigned, or throws an exception upon error.
+
+ The format string `fmt' consists of ordinary characters and
+ conversion specifiers. A conversion specifier begins with the
+ special character `%' and is described more fully below. A white
+ space character in the format string matches any amount of whitespace
+ in the input string. Parsing of the format string stops whenever a
+ match fails.
+
+ The `%' character is used to denote a conversion specifier whose
+ general form is given by `%*widthtypeformat' where the
+ brackets indicate optional items. If `*' is present, then the
+ conversion will be performed but no assignment to a reference will be
+ made. The `width' specifier specifies the maximum field width to
+ use for the conversion. The `type' modifier is used to indicate
+ the size of the object, e.g., a short integer, as follows.
+
+ If _type_ is given as the character `h', then if the format
+ conversion is for an integer (`dioux'), the object assigned will
+ be a short integer. If _type_ is `l', then the conversion
+ will be to a long integer for integer conversions, or to a double
+ precision floating point number for floating point conversions.
+
+ The format specifier is a character that specifies the conversion:
+
+ % Matches a literal percent character. No assignment is
+ performed.
+ d Matches a signed decimal integer.
+ D Matches a long decimal integer (equiv to `ld')
+ u Matches an unsigned decimal integer
+ U Matches an unsigned long decimal integer (equiv to `lu')
+ i Matches either a hexadecimal integer, decimal integer, or
+ octal integer.
+ I Equivalent to `li'.
+ o Matches an unsigned octal integer.
+ O Matches an unsigned long octal integer.
+ x Matches an unsigned hexadecimal integer.
+ X Matches a long unsigned hexadecimal integer (same as `lx').
+ e,f,g Matches a decimal floating point number (Float_Type).
+ E,F,G Matches a double precision floating point number, same as `lf'.
+ s Matches a string of non-whitespace characters (String_Type).
+ c Matches one character. If width is given, width
+ characters are matched.
+ n Assigns the number of characters scanned so far.
+ ... Matches zero or more characters from the set of characters
+ enclosed by the square brackets. If '^' is given as the
+ first character, then the complement set is matched.
+
+
+ EXAMPLE
+ Suppose that `s' is `"Coffee: (3,4,12.4)"'. Then
+
+ n = sscanf (s, "%a-zA-Z: (%d,%d,%lf)", &item, &x, &y, &z);
+
+ will set `n' to 4, `item' to `"Coffee"', `x' to 3,
+ `y' to 4, and `z' to the double precision number
+ `12.4'. However,
+
+ n = sscanf (s, "%s: (%d,%d,%lf)", &item, &x, &y, &z);
+
+ will set `n' to 1, `item' to `"Coffee:"' and the
+ remaining variables will not be assigned.
+
+ SEE ALSO
+ sprintf, unpack, string, atof, int, integer, string_matches
+
+--------------------------------------------------------------
+
+strbytelen
+
+ SYNOPSIS
+ Get the number of bytes in a string
+
+ USAGE
+ Int_Type strbytelen (String_Type s)
+
+ DESCRIPTION
+ This function returns the number of bytes in a string. In UTF-8
+ mode, this value is generally different from the number of
+ characters in a string. For the latter information, the
+ `strlen' or `strcharlen' functions should be used.
+
+ NOTES
+ This function has been vectorized in the sense that if an array of strings
+ is passed to the function, then a corresponding array of integers
+ will be returned.
+
+ SEE ALSO
+ strlen, strcharlen, length
+
+--------------------------------------------------------------
+
+strbytesub
+
+ SYNOPSIS
+ Replace a byte with another in a string.
+
+ USAGE
+ String_Type strsub (String_Type s, Int_Type pos, UChar_Type b)
+
+ DESCRIPTION
+ The `strbytesub' function may be be used to substitute the byte
+ `b' for the byte at byte position `pos' of the string
+ `s'. The resulting string is returned.
+
+ NOTES
+ The first byte in the string `s' is specified by `pos'
+ equal to 1. This function uses byte semantics, not character
+ semantics.
+
+ SEE ALSO
+ strsub, is_substr, strreplace, strbytelen
+
+--------------------------------------------------------------
+
+strcat
+
+ SYNOPSIS
+ Concatenate strings
+
+ USAGE
+ String_Type strcat (String_Type a_1, ..., String_Type a_N)
+
+ DESCRIPTION
+ The `strcat' function concatenates its N string
+ arguments `a_1', ... `a_N' together and returns the result.
+
+ EXAMPLE
+
+ strcat ("Hello", " ", "World");
+
+ produces the string `"Hello World"'.
+
+ NOTES
+ This function is equivalent to the binary operation `a_1+...+a_N'.
+ However, `strcat' is much faster making it the preferred method
+ to concatenate strings.
+
+ SEE ALSO
+ sprintf, strjoin
+
+--------------------------------------------------------------
+
+strcharlen
+
+ SYNOPSIS
+ Get the number of characters in a string including combining characters
+
+ USAGE
+ Int_Type strcharlen (String_Type s)
+
+ DESCRIPTION
+ The `strcharlen' function returns the number of characters in a
+ string. If the string contains combining characters, then they are
+ also counted. Use the `strlen' function to obtain the
+ character count ignoring combining characters.
+
+ NOTES
+ This function has been vectorized in the sense that if an array of strings
+ is passed to the function, then a corresponding array of integers
+ will be returned.
+
+ SEE ALSO
+ strlen, strbytelen
+
+--------------------------------------------------------------
+
+strchop
+
+ SYNOPSIS
+ Chop or split a string into substrings.
+
+ USAGE
+ String_Type strchop (String_Type str, Int_Type delim, Int_Type quote)
+
+ DESCRIPTION
+ The `strchop' function may be used to split-up a string
+ `str' that consists of substrings delimited by the character
+ specified by `delim'. If the integer `quote' is non-zero,
+ it will be taken as a quote character for the delimiter. The
+ function returns the substrings as an array.
+
+ EXAMPLE
+ The following function illustrates how to sort a comma separated
+ list of strings:
+
+ define sort_string_list (a)
+ {
+ variable i, b, c;
+ b = strchop (a, ',', 0);
+
+ i = array_sort (b);
+ b = bi; % rearrange
+
+ % Convert array back into comma separated form
+ return strjoin (b, ",");
+ }
+
+
+ SEE ALSO
+ strchopr, strjoin, strtok
+
+--------------------------------------------------------------
+
+strchopr
+
+ SYNOPSIS
+ Chop or split a string into substrings.
+
+ USAGE
+ String_Type strchopr (String_Type str, String_Type delim, String_Type quote)
+
+ DESCRIPTION
+ This routine performs exactly the same function as `strchop' except
+ that it returns the substrings in the reverse order. See the
+ documentation for `strchop' for more information.
+
+ SEE ALSO
+ strchop, strtok, strjoin
+
+--------------------------------------------------------------
+
+strcmp
+
+ SYNOPSIS
+ Compare two strings
+
+ USAGE
+ Int_Type strcmp (String_Type a, String_Type b)
+
+ DESCRIPTION
+ The `strcmp' function may be used to perform a case-sensitive
+ string comparison, in the lexicographic sense, on strings `a'
+ and `b'. It returns 0 if the strings are identical, a negative
+ integer if `a' is less than `b', or a positive integer if
+ `a' is greater than `b'.
+
+ EXAMPLE
+ The `strup' function may be used to perform a case-insensitive
+ string comparison:
+
+ define case_insensitive_strcmp (a, b)
+ {
+ return strcmp (strup(a), strup(b));
+ }
+
+
+ NOTES
+ One may also use one of the binary comparison operators, e.g.,
+ `a > b'.
+
+ This function has been vectorized in the sense that if an array of strings
+ is passed to the function, then a corresponding array of integers
+ will be returned.
+
+ SEE ALSO
+ strup, strncmp
+
+--------------------------------------------------------------
+
+strcompress
+
+ SYNOPSIS
+ Remove excess whitespace characters from a string
+
+ USAGE
+ String_Type strcompress (String_Type s, String_Type white)
+
+ DESCRIPTION
+ The `strcompress' function compresses the string `s' by
+ replacing a sequence of one or more characters from the set
+ `white' by the first character of `white'. In addition, it
+ also removes all leading and trailing characters from `s' that
+ are part of `white'.
+
+ EXAMPLE
+ The expression
+
+ strcompress (",;apple,,cherry;,banana", ",;");
+
+ returns the string `"apple,cherry,banana"'.
+
+ NOTES
+ This function has been vectorized in the sense that if an array of strings
+ is passed as the first argument then a corresponding array of strings
+ will be returned. Array values are not supported for the remaining
+ arguments.
+
+ SEE ALSO
+ strtrim, strtrans, str_delete_chars
+
+--------------------------------------------------------------
+
+string_match
+
+ SYNOPSIS
+ Match a string against a regular expression
+
+ USAGE
+ Int_Type string_match(String_Type str, String_Type pat ,Int_Type pos)
+
+ DESCRIPTION
+ The `string_match' function returns zero if `str' does not
+ match the regular expression specified by `pat'. This function
+ performs the match starting at the first byte of the string. The
+ optional `pos' argument may be used to specify a different byte
+ offset (numbered from 1). This function returns the position in
+ bytes (numbered from 1) of the start of the match in `str'.
+ The exact substring matched may be found using
+ `string_match_nth'.
+
+ NOTES
+ Positions in the string are specified using byte-offsets not
+ character offsets. The value returned by this function is measured
+ from the beginning of the string `str'.
+
+ The function is not yet UTF-8 aware. If possible, consider using
+ the `pcre' module for better, more sophisticated regular
+ expressions.
+
+ The `pos' argument was made optional in version 2.2.3.
+
+ SEE ALSO
+ string_matches, string_match_nth, strcmp, strncmp
+
+--------------------------------------------------------------
+
+string_match_nth
+
+ SYNOPSIS
+ Get the result of the last call to string_match
+
+ USAGE
+ (Int_Type pos, Int_Type len) = string_match_nth(Int_Type nth)
+
+ DESCRIPTION
+ The `string_match_nth' function returns two integers describing
+ the result of the last call to `string_match'. It returns both
+ the zero-based byte-position of the `nth' submatch and
+ the length of the match.
+
+ By convention, `nth' equal to zero means the entire match.
+ Otherwise, `nth' must be an integer with a value 1 through 9,
+ and refers to the set of characters matched by the `nth' regular
+ expression enclosed by the pairs `$, $'.
+
+ EXAMPLE
+ Consider:
+
+ variable matched, pos, len;
+ matched = string_match("hello world", "$a-z+$ $a-z+$"R, 1);
+ if (matched)
+ (pos, len) = string_match_nth(2);
+
+ This will set `matched' to 1 since a match will be found at the
+ first byte position, `pos' to 6 since `w' is offset 6 bytes
+ from the beginning of the string, and `len' to 5 since
+ `"world"' is 5 bytes long.
+
+ NOTES
+ The position offset is _not_ affected by the value of the offset
+ parameter to the `string_match' function. For example, if the
+ value of the last parameter to the `string_match' function had
+ been 3, `pos' would still have been set to 6.
+
+ The `string_matches' function may be used as an alternative to
+ `string_match_nth'.
+
+ SEE ALSO
+ string_match, string_matches
+
+--------------------------------------------------------------
+
+string_matches
+
+ SYNOPSIS
+ Match a string against a regular expression and return the matches
+
+ USAGE
+ String_Type string_matches(String_Type str, String_Type pat ,Int_Type pos)
+
+ DESCRIPTION
+ The `string_matches' function combines the functionality of
+ `string_match' and `string_match_nth'. Like
+ `string_match', it matches the string `str' against
+ the regular expression `pat'. If the string does not match the
+ pattern the function will return NULL. Otherwise, the function
+ will return an array of strings whose `ith' element is the string that
+ corresponds to the return value of the `string_match_nth'
+ function.
+
+ EXAMPLE
+
+ strs = string_matches ("p0.5keV_27deg.dat",
+ "p$0-9.+$keV_$0-9.+$deg\.dat"R, 1);
+ % ==> strs0 = "p0.5keV_27deg.dat"
+ % strs1 = "0.5"
+ % strs2 = "27"
+
+ strs = string_matches ("q0.5keV_27deg.dat",
+ "p$0-9.+$keV_$0-9.+$deg\.dat"R);
+ % ==> strs = NULL
+
+
+ NOTES
+ The function is not yet UTF-8 aware. If possible, consider using
+ the `pcre' module for better, more sophisticated regular
+ expressions.
+
+ The `pos' argument was made optional in version 2.2.3.
+
+ SEE ALSO
+ string_match, string_match_nth, strcmp, strncmp
+
+--------------------------------------------------------------
+
+strjoin
+
+ SYNOPSIS
+ Concatenate elements of a string array
+
+ USAGE
+ String_Type strjoin (Array_Type a , String_Type delim)
+
+ DESCRIPTION
+ The `strjoin' function operates on an array of strings by joining
+ successive elements together separated with the optional delimiter
+ `delim'. If `delim' is not specified, then empty string
+ `""' will be used resulting in a concatenation of the elements.
+
+ EXAMPLE
+ Suppose that
+
+ days = "Sun","Mon","Tue","Wed","Thu","Fri","Sat","Sun";
+
+ Then `strjoin (days,"+")' will produce
+ `"Sun+Mon+Tue+Wed+Thu+Fri+Sat+Sun"'. Similarly,
+ `strjoin ("","","", "X")' will produce `"XX"'.
+
+ SEE ALSO
+ strchop, strcat
+
+--------------------------------------------------------------
+
+strlen
+
+ SYNOPSIS
+ Compute the length of a string
+
+ USAGE
+ Int_Type strlen (String_Type a)
+
+ DESCRIPTION
+ The `strlen' function may be used to compute the character
+ length of a string ignoring the presence of combining characters.
+ The `strcharlen' function may be used to count combining
+ characters as distinct characters. For byte-semantics, use the
+ `strbytelen' function.
+
+ EXAMPLE
+ After execution of
+
+ variable len = strlen ("hello");
+
+ `len' will have a value of `5'.
+
+ NOTES
+ This function has been vectorized in the sense that if an array of strings
+ is passed to the function, then a corresponding array of integers
+ will be returned.
+
+ SEE ALSO
+ strbytelen, strcharlen, bstrlen, length, substr
+
+--------------------------------------------------------------
+
+strlow
+
+ SYNOPSIS
+ Convert a string to lowercase
+
+ USAGE
+ String_Type strlow (String_Type s)
+
+ DESCRIPTION
+ The `strlow' function takes a string `s' and returns another
+ string identical to `s' except that all upper case characters
+ that are contained in `s' are converted converted to lower case.
+
+ EXAMPLE
+ The function
+
+ define Strcmp (a, b)
+ {
+ return strcmp (strlow (a), strlow (b));
+ }
+
+ performs a case-insensitive comparison operation of two strings by
+ converting them to lower case first.
+
+ NOTES
+ This function has been vectorized in the sense that if an array of strings
+ is passed to the function, then a corresponding array of strings
+ will be returned.
+
+ SEE ALSO
+ strup, tolower, strcmp, strtrim, define_case
+
+--------------------------------------------------------------
+
+strnbytecmp
+
+ SYNOPSIS
+ Compare the first n bytes of two strings
+
+ USAGE
+ Int_Type strnbytecmp (String_Type a, String_Type b, Int_Type n)
+
+ DESCRIPTION
+ This function compares the first `n' bytes of the strings
+ `a' and `b'. See the documentation for `strcmp' for
+ information about the return value.
+
+ NOTES
+ This function has been vectorized in the sense that if an array of strings
+ is passed for either of the string-valued arguments, then a
+ corresponding array of integers will be returned. If two arrays
+ are passed then the arrays must have the same length.
+
+ SEE ALSO
+ strncmp, strncharcmp, strcmp
+
+--------------------------------------------------------------
+
+strncharcmp
+
+ SYNOPSIS
+ Compare the first n characters of two strings
+
+ USAGE
+ Int_Type strncharcmp (String_Type a, String_Type b, Int_Type n)
+
+ DESCRIPTION
+ This function compares the first `n' characters of the strings
+ `a' and `b' counting combining characters as distinct
+ characters. See the documentation for `strcmp' for information
+ about the return value.
+
+ NOTES
+ This function has been vectorized in the sense that if an array of strings
+ is passed for either of the string-valued arguments, then a
+ corresponding array of integers will be returned. If two arrays
+ are passed then the arrays must have the same length.
+
+ SEE ALSO
+ strncmp, strnbytecmp, strcmp
+
+--------------------------------------------------------------
+
+strncmp
+
+ SYNOPSIS
+ Compare the first few characters of two strings
+
+ USAGE
+ Int_Type strncmp (String_Type a, String_Type b, Int_Type n)
+
+ DESCRIPTION
+ This function behaves like `strcmp' except that it compares only the
+ first `n' characters in the strings `a' and `b'.
+ See the documentation for `strcmp' for information about the return
+ value.
+
+ In counting characters, combining characters are not counted,
+ although they are used in the comparison. Use the
+ `strncharcmp' function if you want combining characters to be
+ included in the character count. The `strnbytecmp' function
+ should be used to compare bytes.
+
+ EXAMPLE
+ The expression
+
+ strncmp ("apple", "appliance", 3);
+
+ will return zero since the first three characters match.
+
+ NOTES
+ This function uses character semantics.
+
+ This function has been vectorized in the sense that if an array of strings
+ is passed for either of the string-valued arguments, then a
+ corresponding array of integers will be returned. If two arrays
+ are passed then the arrays must have the same length.
+
+ SEE ALSO
+ strcmp, strlen, strncharcmp, strnbytecmp
+
+--------------------------------------------------------------
+
+strreplace
+
+ SYNOPSIS
+ Replace one or more substrings
+
+ USAGE
+ (new,n) = strreplace(a, b, c, max_n)
+ % or
+ new = strreplace(a, b, c)
+
+ DESCRIPTION
+ The `strreplace' function may be used to replace one or more
+ occurrences of `b' in `a' with `c'. This function
+ supports two calling interfaces.
+
+ The first form may be used to replace a specified number of
+ substrings. If `max_n' is positive, then the first
+ `max_n' occurrences of `b' in `a' will be replaced.
+ Otherwise, if `max_n' is negative, then the last
+ `abs(max_n)' occurrences will be replaced. The function returns
+ the resulting string and an integer indicating how many replacements
+ were made.
+
+ The second calling form may be used to replace all occurrences of
+ `b' in `a' with `c'. In this case, only the
+ resulting string will be returned.
+
+ EXAMPLE
+ The following function illustrates how `strreplace' may be used
+ to remove all occurrences of a specified substring:
+
+ define delete_substrings (a, b)
+ {
+ return strreplace (a, b, "");
+ }
+
+
+ SEE ALSO
+ is_substr, strsub, strtrim, strtrans, str_delete_chars
+
+--------------------------------------------------------------
+
+strskipbytes
+
+ SYNOPSIS
+ Skip a range of bytes in a byte string
+
+ USAGE
+ Int_Type strskipbytes (str, range n0 ,nmax)
+
+ String_Type s;
+ String_Type range;
+ Int_Type n0, nmax;
+
+
+ DESCRIPTION
+ This function skips over a range of bytes in a string `str'.
+ The byte range to be skipped is specified by the `range'
+ parameter. Optional start (`n0') and stop (`nmax')
+ (0-based) parameters may be used to specify the part of the input
+ string to be processed. The function returns a 0-based offset from
+ the beginning of the string where processing stopped.
+
+ See the documentation for the `strtrans' function for the
+ format of the range parameter.
+
+ SEE ALSO
+ strskipchar, strbskipchar, strtrans
+
+--------------------------------------------------------------
+
+strskipchar
+
+ SYNOPSIS
+ Get an index to the next character in a UTF-8 encoded string
+
+ USAGE
+ (p1, wch) = strskipchar (str, p0 ,skip_combining)
+
+ DESCRIPTION
+ This function decodes the character at the 0-based byte-offset `p0' in
+ the string `str'. It returns the byte-offset (`p1' of the next
+ character in the string and the decoded character at byte-offset
+ `p0'.
+
+ The optional third argument specifies the handling of
+ combining characters. If it is non-zero, combining characters will
+ be ignored, otherwise a combining character will not be treated
+ differently from other characters. The default is to ignore such
+ characters.
+
+ If the byte-offset `p0' corresponds to the end of the string,
+ then `(p0,0)' will be returned. Otherwise if the byte-offset
+ specifies a value that lies outside the string, an `IndexError'
+ exception will be thrown. Finally, if the byte-offset corresponds
+ to an illegally coded character, the character returned will be the
+ negative byte-value at the position.
+
+ EXAMPLE
+ The following is an example of a function that skips alphanumeric
+ characters and returns the new byte-offset.
+
+ private define skip_word_chars (line, p)
+ {
+ variable p1 = p, ch;
+ do
+ {
+ p = p1;
+ (p1, ch) = strskipchar (line, p, 1);
+ }
+ while (isalnum(ch));
+ return p;
+ }
+
+
+ NOTES
+ In non-UTF-8 mode (`_slang_utf8_ok=0'), this function is
+ equivalent to:
+
+ define strskipchar (s, p)
+ {
+ if ((p < 0) || (p > strlen(s)))
+ throw IndexError;
+ if (p == strlen(s))
+ return (p, sp)
+ return (p+1, sp);
+ }
+
+ It is important to understand that the above code relies upon
+ byte-semantics, which are invalid for multi-byte characters.
+
+ SEE ALSO
+ strbskipchar, strskipbytes
+
+--------------------------------------------------------------
+
+strsub
+
+ SYNOPSIS
+ Replace a character with another in a string.
+
+ USAGE
+ String_Type strsub (String_Type s, Int_Type pos, Int_Type ch)
+
+ DESCRIPTION
+ The `strsub' function may be used to substitute the character
+ `ch' for the character at character position `pos' of the string
+ `s'. The resulting string is returned.
+
+ EXAMPLE
+
+ define replace_spaces_with_comma (s)
+ {
+ variable n;
+ while (n = is_substr (s, " "), n) s = strsub (s, n, ',');
+ return s;
+ }
+
+ For uses such as this, the `strtrans' function is a better choice.
+
+ NOTES
+ The first character in the string `s' is specified by `pos'
+ equal to 1. This function uses character semantics, not byte
+ semantics.
+
+ SEE ALSO
+ is_substr, strreplace, strlen
+
+--------------------------------------------------------------
+
+strtok
+
+ SYNOPSIS
+ Extract tokens from a string
+
+ USAGE
+ String_Type strtok (String_Type str ,String_Type white)
+
+ DESCRIPTION
+ `strtok' breaks the string `str' into a series of tokens
+ and returns them as an array of strings. If the second parameter
+ `white' is present, then it specifies the set of characters
+ that are to be regarded as whitespace when extracting the tokens,
+ and may consist of the whitespace characters or a range of such
+ characters. If the first character of `white' is `'^'',
+ then the whitespace characters consist of all characters except
+ those in `white'. For example, if `white' is `"
+ \t\n,;."', then those characters specify the whitespace
+ characters. However, if `white' is given by
+ `"^a-zA-Z0-9_"', then any character is a whitespace character
+ except those in the ranges `a-z', `A-Z', `0-9', and
+ the underscore character. To specify the hyphen character as a
+ whitespace character, then it should be the first character of the
+ whitespace string. In addition to ranges, the whitespace specifier
+ may also include character classes:
+
+ \w matches a unicode "word" character, taken to be alphanumeric.
+ \a alphabetic character, excluding digits
+ \s matches whitespace
+ \l matches lowercase
+ \u matches uppercase
+ \d matches a digit
+ \\ matches a backslash
+ \^ matches a ^ character
+
+
+ If the second parameter is not present, then it defaults to
+ `"\s"'.
+
+ EXAMPLE
+ The following example may be used to count the words in a text file:
+
+ define count_words (file)
+ {
+ variable fp, line, count;
+
+ fp = fopen (file, "r");
+ if (fp == NULL) return -1;
+
+ count = 0;
+ while (-1 != fgets (&line, fp))
+ {
+ line = strtok (line, "^\\a");
+ count += length (line);
+ }
+ () = fclose (fp);
+ return count;
+ }
+
+ Here a word was assumed to consist only of alphabetic characters.
+
+ SEE ALSO
+ strchop, strcompress, strjoin
+
+--------------------------------------------------------------
+
+strtrans
+
+ SYNOPSIS
+ Replace characters in a string
+
+ USAGE
+ String_Type strtrans (str, old_set, new_set)
+
+ String_Type str, old_set, new_set;
+
+
+ DESCRIPTION
+ The `strtrans' function may be used to replace all the characters
+ from the set `old_set' with the corresponding characters from
+ `new_set' in the string `str'. If `new_set' is empty,
+ then the characters in `old_set' will be removed from `str'.
+
+ If `new_set' is not empty, then `old_set' and
+ `new_set' must be commensurate. Each set may consist of
+ character ranges such as `A-Z' and character classes:
+
+ \, matches a punctuation character
+ \7 matches any 7bit ascii character
+ \\ matches a backslash
+ \^ matches the ^ character
+ \a matches an alphabetic character, excluding digits
+ \c matches a control character
+ \d matches a digit
+ \g matches a graphic character
+ \l matches lowercase
+ \p matches a printable character
+ \s matches whitespace
+ \u matches uppercase
+ \w matches a unicode "word" character, taken to be alphanumeric.
+ \x matches hex digit (a-fA-F0-9)
+
+ If the first character of a set is `^' then the set is taken to
+ be the complement set.
+
+ EXAMPLE
+
+ str = strtrans (str, "\\u", "\\l"); % lower-case str
+ str = strtrans (str, "^0-9", " "); % Replace anything but 0-9 by space
+ str = strtrans (str, "\\^0-9", " "); % Replace '^' and 0-9 by a space
+
+
+ NOTES
+ This function has been vectorized in the sense that if an array of strings
+ is passed as the first argument then a corresponding array of strings
+ will be returned. Array values are not supported for the remaining
+ arguments.
+
+ SEE ALSO
+ strreplace, strtrim, strup, strlow
+
+--------------------------------------------------------------
+
+strtrim
+
+ SYNOPSIS
+ Remove whitespace from the ends of a string
+
+ USAGE
+ String_Type strtrim (String_Type s ,String_Type w)
+
+ DESCRIPTION
+ The `strtrim' function removes all leading and trailing whitespace
+ characters from the string `s' and returns the result. The
+ optional second parameter specifies the set of whitespace
+ characters. If the argument is not present, then the set defaults
+ to `"\s"'. The whitespace specification may consist of
+ character ranges such as `A-Z' and character classes:
+
+ \w matches a unicode "word" character, taken to be alphanumeric.
+ \a alphabetic character, excluding digits
+ \s matches whitespace
+ \l matches lowercase
+ \u matches uppercase
+ \d matches a digit
+ \\ matches a backslash
+ \^ matches a ^ character
+
+ If the first character of a set is `^' then the set is taken to
+ be the complement set.
+
+ NOTES
+ This function has been vectorized in the sense that if the first argument
+ is an array of strings, then a corresponding array of strings
+ will be returned. An array value for the optional whitespace
+ argument is not supported.
+
+ SEE ALSO
+ strtrim_beg, strtrim_end, strcompress
+
+--------------------------------------------------------------
+
+strtrim_beg
+
+ SYNOPSIS
+ Remove leading whitespace from a string
+
+ USAGE
+ String_Type strtrim_beg (String_Type s ,String_Type w)
+
+ DESCRIPTION
+ The `strtrim_beg' function removes all leading whitespace
+ characters from the string `s' and returns the result.
+ The optional second parameter specifies the set of whitespace
+ characters. See the documentation for the `strtrim' function
+ form more information about the whitespace parameter.
+
+ NOTES
+ This function has been vectorized in the sense that if the first argument
+ is an array of strings, then a corresponding array of strings
+ will be returned. An array value for the optional whitespace
+ argument is not supported.
+
+ SEE ALSO
+ strtrim, strtrim_end, strcompress
+
+--------------------------------------------------------------
+
+strtrim_end
+
+ SYNOPSIS
+ Remove trailing whitespace from a string
+
+ USAGE
+ String_Type strtrim_end (String_Type s ,String_Type w)
+
+ DESCRIPTION
+ The `strtrim_end' function removes all trailing whitespace
+ characters from the string `s' and returns the result. The
+ optional second parameter specifies the set of whitespace
+ characters. See the documentation for the `strtrim' function
+ form more information about the whitespace parameter.
+
+ NOTES
+ This function has been vectorized in the sense that if the first argument
+ is an array of strings, then a corresponding array of strings
+ will be returned. An array value for the optional whitespace
+ argument is not supported.
+
+ SEE ALSO
+ strtrim, strtrim_beg, strcompress
+
+--------------------------------------------------------------
+
+strup
+
+ SYNOPSIS
+ Convert a string to uppercase
+
+ USAGE
+ String_Type strup (String_Type s)
+
+ DESCRIPTION
+ The `strup' function takes a string `s' and returns another
+ string identical to `s' except that all lower case characters
+ that contained in `s' are converted to upper case.
+
+ EXAMPLE
+ The function
+
+ define Strcmp (a, b)
+ {
+ return strcmp (strup (a), strup (b));
+ }
+
+ performs a case-insensitive comparison operation of two strings by
+ converting them to upper case first.
+
+ NOTES
+ This function has been vectorized in the sense that if an array of strings
+ is passed to the function, then a corresponding array of strings
+ will be returned.
+
+ SEE ALSO
+ strlow, toupper, strcmp, strtrim, define_case, strtrans
+
+--------------------------------------------------------------
+
+str_delete_chars
+
+ SYNOPSIS
+ Delete characters from a string
+
+ USAGE
+ String_Type str_delete_chars (String_Type str , String_Type del_set)
+
+ DESCRIPTION
+ This function may be used to delete the set of characters specified
+ by the optional argument `del_set' from the string `str'.
+ If `del_set' is not given, `"\s"' will be used.
+ The modified string is returned.
+
+ The set of characters to be deleted may include ranges such as
+ `A-Z' and characters classes:
+
+ \w matches a unicode "word" character, taken to be alphanumeric.
+ \a alphabetic character, excluding digits
+ \s matches whitespace
+ \l matches lowercase
+ \u matches uppercase
+ \d matches a digit
+ \\ matches a backslash
+ \^ matches a ^ character
+
+ If the first character of `del_set' is `^', then the set
+ is taken to be the complement of the remaining string.
+
+ EXAMPLE
+
+ str = str_delete_chars (str, "^A-Za-z");
+
+ will remove all characters except `A-Z' and `a-z' from
+ `str'. Similarly,
+
+ str = str_delete_chars (str, "^\\a");
+
+ will remove all but the alphabetic characters.
+
+ NOTES
+ This function has been vectorized in the sense that if an array of strings
+ is passed as the first argument then a corresponding array of strings
+ will be returned. Array values are not supported for the remaining
+ arguments.
+
+ SEE ALSO
+ strtrans, strreplace, strcompress
+
+--------------------------------------------------------------
+
+str_quote_string
+
+ SYNOPSIS
+ Escape characters in a string.
+
+ USAGE
+ String_Type str_quote_string(String_Type str, String_Type qlis, Int_Type quote)
+
+ DESCRIPTION
+ The `str_quote_string' returns a string identical to `str'
+ except that all characters contained in the string `qlis' are
+ escaped with the `quote' character, including the quote
+ character itself. This function is useful for making a string that
+ can be used in a regular expression.
+
+ EXAMPLE
+ Execution of the statements
+
+ node = "Is it the coat really worth $100?";
+ tag = str_quote_string (node, "\\^$*.+?", '\\');
+
+ will result in `tag' having the value:
+
+ Is it \the coat\ really worth \$100\?
+
+
+ SEE ALSO
+ str_uncomment_string, make_printable_string
+
+--------------------------------------------------------------
+
+str_replace
+
+ SYNOPSIS
+ Replace a substring of a string (deprecated)
+
+ USAGE
+ Int_Type str_replace (String_Type a, String_Type b, String_Type c)
+
+ DESCRIPTION
+ The `str_replace' function replaces the first occurrence of `b' in
+ `a' with `c' and returns an integer that indicates whether a
+ replacement was made. If `b' does not occur in `a', zero is
+ returned. However, if `b' occurs in `a', a non-zero integer is
+ returned as well as the new string resulting from the replacement.
+
+ NOTES
+ This function has been superseded by `strreplace'. It should no
+ longer be used.
+
+ SEE ALSO
+ strreplace
+
+--------------------------------------------------------------
+
+str_uncomment_string
+
+ SYNOPSIS
+ Remove comments from a string
+
+ USAGE
+ String_Type str_uncomment_string(String_Type s, String_Type beg, String_Type end)
+
+ DESCRIPTION
+ This function may be used to remove simple forms of comments from a
+ string `s'. The parameters, `beg' and `end', are strings
+ of equal length whose corresponding characters specify the begin and
+ end comment characters, respectively. It returns the uncommented
+ string.
+
+ EXAMPLE
+ The expression
+
+ str_uncomment_string ("Hello (testing) 'example' World", "'(", "')")
+
+ returns the string `"Hello World"'.
+
+ NOTES
+ This routine does not handle multi-character comment delimiters and it
+ assumes that comments are not nested.
+
+ SEE ALSO
+ str_quote_string, str_delete_chars, strtrans
+
+--------------------------------------------------------------
+
+substr
+
+ SYNOPSIS
+ Extract a substring from a string
+
+ USAGE
+ String_Type substr (String_Type s, Int_Type n, Int_Type len)
+
+ DESCRIPTION
+ The `substr' function returns a substring with character length
+ `len' of the string `s' beginning at the character position
+ `n'. If `len' is `-1', the entire length of the string
+ `s' will be used for `len'. The first character of `s'
+ is given by `n' equal to 1.
+
+ EXAMPLE
+
+ substr ("To be or not to be", 7, 5);
+
+ returns `"or no"'
+
+ NOTES
+ This function assumes character semantics and not byte semantics.
+ Use the `substrbytes' function to extract bytes from a string.
+
+ SEE ALSO
+ is_substr, substrbytes, strlen
+
+--------------------------------------------------------------
+
+substrbytes
+
+ SYNOPSIS
+ Extract a byte sequence from a string
+
+ USAGE
+ String_Type substrbytes (String_Type s, Int_Type n, Int_Type len)
+
+ DESCRIPTION
+ The `substrbytes' function returns a substring with byte length
+ `len' of the string `s' beginning at the byte position
+ `n', counting from 1. If `len' is `-1', the entire
+ byte-length of the string `s' will be used for `len'. The first
+ byte of `s' is given by `n' equal to 1.
+
+ EXAMPLE
+
+ substrbytes ("To be or not to be", 7, 5);
+
+ returns `"or no"'
+
+ NOTES
+ In many cases it is more convenient to use array indexing rather
+ than the `substrbytes' function. In fact
+ `substrbytes(s,i+1,-1)' is equivalent to
+ `si:'.
+
+ The function `substr' may be used if character semantics are
+ desired.
+
+ SEE ALSO
+ substr, strbytelen
+
+--------------------------------------------------------------
+
+wchars_to_string,string_to_wchars
+
+ SYNOPSIS
+ Convert a UTF-8 encoded string to and from character codes
+
+ USAGE
+ Int_Type string_to_wchars(String_Type str)
+ String_Type wchars_to_string(Int_Type array)
+
+ DESCRIPTION
+The `string_to_wchars' function decodes a UTF-8 encoded string
+and returns the Unicode characters as an array of integer values. The
+`wchars_to_string' performs the opposite conversion to produce a
+UTF-8 encoded string from an array of Unicode characters.
+
+ NOTES
+A malformed UTF-8 encoded string will result in negative byte-values in the
+output array at the positions corresponding to the malformed sequence.
+For example, the following function will substitute a '?' character
+for each byte in the malformed sequence to produce a valid string:
+
+ define handle_malformed_bytes (str)
+ {
+ variable codes = string_to_wchars (str);
+ variable is_bad = (codes < 0);
+ if (any(is_bad))
+ {
+ codeswhere(is_bad) = '?';
+ str = wchars_to_string (codes);
+ }
+ return str;
+ }
+
+
+ SEE ALSO
+ char, substr, array_to_bstring, bstring_to_array
+
+--------------------------------------------------------------
+
+__add_binary
+
+ SYNOPSIS
+ Extend a binary operation to a user defined type
+
+ USAGE
+ __add_binary(op, return_type, binary_funct, lhs_type, rhs_type)
+
+ String_Type op;
+ Ref_Type binary_funct;
+ DataType_Type return_type, lhs_type, rhs_type;
+
+
+ DESCRIPTION
+ The `__add_binary' function is used to specify a function to be
+ called when a binary operation takes place between specified data
+ types. The first parameter indicates the binary operator and must
+ be one of the following:
+
+ "+", "-", "*", "/", "==", "!=", ">", ">=", "<", "<=", "^",
+ "or", "and", "&", "|", "xor", "shl", "shr", "mod"
+
+ The second parameter (`binary_funct') specifies the function to
+ be called when the binary function takes place between the
+ types `lhs_type' and `rhs_type'. The `return_type'
+ parameter stipulates the return values of the function and the data
+ type of the result of the binary operation.
+
+ The data type for `lhs_type' or `rhs_type' may be left
+ unspecified by using Any_Type for either of these values.
+ However, at least one of the parameters must correspond to a
+ user-defined datatype.
+
+ EXAMPLE
+ This example defines a vector data type and extends the "*" operator
+ to the new type:
+
+ typedef struct { x, y, z } Vector_Type;
+ define vector (x, y, z)
+ {
+ variable v = @Vector_Type;
+ v.x = x;
+ v.y = y;
+ v.z = z;
+ return v;
+ }
+ static define vector_scalar_mul (v, a)
+ {
+ return vector (a*v.x, a*v.y, a*v.z);
+ }
+ static define scalar_vector_mul (a, v)
+ {
+ return vector_scalar_mul (v, a);
+ }
+ static define dotprod (v1,v2)
+ {
+ return v1.x*v2.x + v1.y*v2.y + v1.z*v2.z;
+ }
+ __add_binary ("*", Vector_Type, &scalar_vector_mul, Any_Type, Vector_Type);
+ __add_binary ("*", Vector_Type, &scalar_vector_mul, Any_Type, Vector_Type);
+ __add_binary ("*", Double_Type, &dotprod, Vector_Type, Vector_Type);
+
+
+ SEE ALSO
+ __add_unary, __add_string, __add_destroy
+
+--------------------------------------------------------------
+
+__add_string
+
+ SYNOPSIS
+ Specify a string representation for a user-defined type
+
+ USAGE
+ __add_string (DataType_Type user_type, Ref_Type func)
+
+ DESCRIPTION
+ The `__add_string' function specifies a function to be called
+ when a string representation is required for the specified
+ user-defined datatype.
+
+ EXAMPLE
+ Consider the `Vector_Type' object defined in the example
+ for the `__add_binary' function.
+
+ static define vector_string (v)
+ {
+ return sprintf ("%S,%S,%S", v.x, v.y, v.z);
+ }
+ __add_string (Vector_Type, &vector_string);
+
+ Then
+
+ v = vector (3, 4, 5);
+ vmessage ("v=%S", v);
+
+ will generate the message:
+
+ v=3,4,5
+
+
+ SEE ALSO
+ __add_unary, __add_binary, __add_destroy, __add_typecast
+
+--------------------------------------------------------------
+
+__add_typecast
+
+ SYNOPSIS
+ Add a typecast-function for a user-defined type
+
+ USAGE
+ __add_typecast (DataType_Type user_type, DataType_Type totype, Ref_Type func)
+
+ DESCRIPTION
+ The `__add_typecast' function specifies a function to be called
+ to typecast the user-defined type to an object of type
+ `totype'. The function must be defined to take a single
+ argument (the user-type to be converted) and must return an object
+ of type `totype'.
+
+ SEE ALSO
+ __add_unary, __add_binary, __add_destroy, __add_string
+
+--------------------------------------------------------------
+
+__add_unary
+
+ SYNOPSIS
+ Extend a unary operator to a user-defined type
+
+ USAGE
+ __add_unary (op, return_type, unary_func, user_type)
+
+ String_Type op;
+ Ref_Type unary_func;
+ DataType_Type return_type, user_type;
+
+
+ DESCRIPTION
+ The `__add_unary' function is used to define the action of an
+ unary operation on a user-defined type. The first parameter
+ `op' must be a valid unary operator
+
+ "-", "not", "~"
+
+ or one of the following:
+
+ "++", "--",
+ "abs", "sign", "sqr", "mul2", "_ispos", "_isneg", "_isnonneg",
+
+ The third parameter, `unary_func' specifies the function to be
+ called to carry out the specified unary operation on the data type
+ `user_type'. The result of the operation is indicated by the
+ value of the `return_type' parameter and must also be the
+ return type of the unary function.
+
+ EXAMPLE
+ The example for the `__add_binary' function defined a
+ `Vector_Type' object. Here, the unary `"-"' and
+ `"abs"' operators are
+ extended to this type:
+
+ static define vector_chs (v)
+ {
+ variable v1 = @Vector_Type;
+ v1.x = -v.x;
+ v1.y = -v.y;
+ v1.z = -v.z;
+ return v1;
+ }
+ static define vector_abs (v)
+ {
+ return sqrt (v.x*v.x + v.y*v.y + v.z*v.z);
+ }
+ __add_unary ("-", Vector_Type, &vector_chs, Vector_Type);
+ __add_unary ("abs", Double_Type, &vector_abs, Vector_Type);
+
+
+ SEE ALSO
+ __add_binary, __add_string, __add_destroy
+
+--------------------------------------------------------------
+
+get_struct_field
+
+ SYNOPSIS
+ Get the value associated with a structure field
+
+ USAGE
+ x = get_struct_field (Struct_Type s, String field_name)
+
+ DESCRIPTION
+ The `get_struct_field' function gets the value of the field
+ whose name is specified by `field_name' of the structure
+ `s'. If the specified name is not a field of the structure, the
+ function will throw an `InvalidParmError' exception.
+
+ SEE ALSO
+ set_struct_field, get_struct_field_names, array_info
+
+--------------------------------------------------------------
+
+get_struct_field_names
+
+ SYNOPSIS
+ Retrieve the field names associated with a structure
+
+ USAGE
+ String_Type = get_struct_field_names (Struct_Type s)
+
+ DESCRIPTION
+ The `get_struct_field_names' function returns an array of
+ strings whose elements specify the names of the fields of the
+ struct `s'.
+
+ EXAMPLE
+ The following example illustrates how the
+ `get_struct_field_names' function may be used in conjunction
+ with the `get_struct_field' function to print the
+ value of a structure.
+
+ define print_struct (s)
+ {
+ variable name, value;
+
+ foreach (get_struct_field_names (s))
+ {
+ name = ();
+ value = get_struct_field (s, name);
+ vmessage ("s.%s = %s\n", name, string (value));
+ }
+ }
+
+
+ SEE ALSO
+ _push_struct_field_values, get_struct_field
+
+--------------------------------------------------------------
+
+_is_struct_type
+
+ SYNOPSIS
+ Determine whether or not an object is a structure
+
+ USAGE
+ Integer_Type _is_struct_type (X)
+
+ DESCRIPTION
+ The `_is_struct_type' function returns 1 if the parameter
+ refers to a structure or a user-defined type, or to an array of
+ structures or user-defined types. If the object is neither, 0 will
+ be returned.
+
+ SEE ALSO
+ typeof, _typeof, is_struct_type
+
+--------------------------------------------------------------
+
+is_struct_type
+
+ SYNOPSIS
+ Determine whether or not an object is a structure
+
+ USAGE
+ Integer_Type is_struct_type (X)
+
+ DESCRIPTION
+ The `is_struct_type' function returns 1 if the parameter
+ refers to a structure or a user-defined type. If the object is
+ neither, 0 will be returned.
+
+ SEE ALSO
+ typeof, _typeof, _is_struct_type
+
+--------------------------------------------------------------
+
+_push_struct_field_values
+
+ SYNOPSIS
+ Push the values of a structure's fields onto the stack
+
+ USAGE
+ Integer_Type num = _push_struct_field_values (Struct_Type s)
+ % or
+ (v1,v2,...,vN) = _push_struct_field_values (Struct_Type s, Array_Type names)
+
+ DESCRIPTION
+ The `_push_struct_field_values' function may be used to obtain
+ the values of one of more fields of a structure. This function has
+ two usage forms.
+
+ The first form pushes the values of all the fields of a structure
+ onto the stack, returning the number of items pushed. The fields are
+ pushed such that the last field of the structure is pushed first.
+
+ The second form has an additional array argument that specifies the
+ names of the fields to process. It returns the values in the order
+ specified by the array. Unlike the first form, it does not return
+ the number of items pushed.
+
+ EXAMPLE
+
+ s = struct {foo=1, bar="seven", z = "zz"};
+
+ % Form 1
+ n = _push_struct_field_values (s); % ==> n = 3
+ list = __pop_list (n); % ==> list = {"zz", "seven", 1};
+
+ % Form 2
+ list = {_push_struct_field_values (s, "foo", "bar", "z")};
+ % ==> list = {1, "seven", "zz"};
+
+ % Form 2
+ list = {_push_struct_field_values (s, "z", "foo")};
+ % ==> list = {"zz", 1};
+
+
+ SEE ALSO
+ get_struct_field_names, get_struct_field
+
+--------------------------------------------------------------
+
+set_struct_field
+
+ SYNOPSIS
+ Set the value associated with a structure field
+
+ USAGE
+ set_struct_field (s, field_name, field_value)
+
+ Struct_Type s;
+ String_Type field_name;
+ Generic_Type field_value;
+
+
+ DESCRIPTION
+ The `set_struct_field' function sets the value of the field
+ whose name is specified by `field_name' of the structure
+ `s' to `field_value'.
+
+ SEE ALSO
+ get_struct_field, get_struct_field_names, set_struct_fields, array_info
+
+--------------------------------------------------------------
+
+set_struct_fields
+
+ SYNOPSIS
+ Set the fields of a structure
+
+ USAGE
+ set_struct_fields (Struct_Type s, ...)
+
+ DESCRIPTION
+ The `set_struct_fields' function may be used to set zero or more
+ fields of a structure. The fields are set in the order in which
+ they were created when the structure was defined.
+
+ EXAMPLE
+
+ variable s = struct { name, age, height };
+ set_struct_fields (s, "Bill", 13, 64);
+
+
+ SEE ALSO
+ set_struct_field, get_struct_field_names
+
+--------------------------------------------------------------
+
+ctime
+
+ SYNOPSIS
+ Convert a calendar time to a string
+
+ USAGE
+ String_Type ctime(Long_Type secs)
+
+ DESCRIPTION
+ This function returns a string representation of the time as given
+ by `secs' seconds since 00:00:00 UTC, Jan 1, 1970.
+
+ SEE ALSO
+ time, strftime, _time, localtime, gmtime
+
+--------------------------------------------------------------
+
+gmtime
+
+ SYNOPSIS
+ Break down a time in seconds to the GMT timezone
+
+ USAGE
+ Struct_Type gmtime (Long_Type secs)
+
+ DESCRIPTION
+ The `gmtime' function is exactly like `localtime' except
+ that the values in the structure it returns are with respect to GMT
+ instead of the local timezone. See the documentation for
+ `localtime' for more information.
+
+ NOTES
+ On systems that do not support the `gmtime' C library function,
+ this function is the same as `localtime'.
+
+ SEE ALSO
+ localtime, _time, mktime
+
+--------------------------------------------------------------
+
+localtime
+
+ SYNOPSIS
+ Break down a time in seconds to the local timezone
+
+ USAGE
+ Struct_Type localtime (Long_Type secs)
+
+ DESCRIPTION
+ The `localtime' function takes a parameter `secs'
+ representing the number of seconds since 00:00:00, January 1 1970
+ UTC and returns a structure containing information about `secs'
+ in the local timezone. The structure contains the following
+ Int_Type fields:
+
+ `tm_sec' The number of seconds after the minute, normally
+ in the range 0 to 59, but can be up to 61 to allow for
+ leap seconds.
+
+ `tm_min' The number of minutes after the hour, in the
+ range 0 to 59.
+
+ `tm_hour' The number of hours past midnight, in the range
+ 0 to 23.
+
+ `tm_mday' The day of the month, in the range 1 to 31.
+
+ `tm_mon' The number of months since January, in the range
+ 0 to 11.
+
+ `tm_year' The number of years since 1900.
+
+ `tm_wday' The number of days since Sunday, in the range 0
+ to 6.
+
+ `tm_yday' The number of days since January 1, in the
+ range 0 to 365.
+
+ `tm_isdst' A flag that indicates whether daylight saving
+ time is in effect at the time described. The value is
+ positive if daylight saving time is in effect, zero if it
+ is not, and negative if the information is not available.
+
+ SEE ALSO
+ gmtime, _time, ctime, mktime
+
+--------------------------------------------------------------
+
+mktime
+
+ SYNOPSIS
+ Convert a time-structure to seconds
+
+ USAGE
+ secs = mktime (Struct_Type tm)
+
+ DESCRIPTION
+ The `mktime' function is essentially the inverse of the
+ `localtime' function. See the documentation for that function
+ for more details.
+
+ SEE ALSO
+ localtime, gmtime, _time
+
+--------------------------------------------------------------
+
+strftime
+
+ SYNOPSIS
+ Format a date and time string
+
+ USAGE
+ str = strftime (String_Type format ,Struct_Type tm)
+
+ DESCRIPTION
+ The `strftime' creates a date and time string according to a
+ specified format. If called with a single argument, the current
+ local time will be used as the reference time. If called with two
+ arguments, the second argument specifies the reference time, and
+ must be a structure with the same fields as the structure returned
+ by the `localtime' function.
+
+ The format string may be composed of one or more of the following
+ format descriptors:
+
+ %A full weekday name (Monday)
+ %a abbreviated weekday name (Mon)
+ %B full month name (January)
+ %b abbreviated month name (Jan)
+ %c standard date and time representation
+ %d day-of-month (01-31)
+ %H hour (24 hour clock) (00-23)
+ %I hour (12 hour clock) (01-12)
+ %j day-of-year (001-366)
+ %M minute (00-59)
+ %m month (01-12)
+ %p local equivalent of AM or PM
+ %S second (00-59)
+ %U week-of-year, first day Sunday (00-53)
+ %W week-of-year, first day Monday (00-53)
+ %w weekday (0-6, Sunday is 0)
+ %X standard time representation
+ %x standard date representation
+ %Y year with century
+ %y year without century (00-99)
+ %Z timezone name
+ %% percent sign
+
+ as well as any others provided by the C library. The actual values
+ represented by the format descriptors are locale-dependent.
+
+ EXAMPLE
+
+ message (strftime ("Today is %A, day %j of the year"));
+ tm = localtime (0);
+ message (strftime ("Unix time 0 was on a %A", tm));
+
+
+ SEE ALSO
+ localtime, time
+
+--------------------------------------------------------------
+
+_tic
+
+ SYNOPSIS
+ Reset the CPU timer
+
+ USAGE
+ _tic ()
+
+ DESCRIPTION
+ The `_tic' function resets the internal CPU timer. The
+ `_toc' may be used to read this timer. See the documentation
+ for the `_toc' function for more information.
+
+ SEE ALSO
+ _toc, times, tic, toc
+
+--------------------------------------------------------------
+
+tic
+
+ SYNOPSIS
+ Reset the interval timer
+
+ USAGE
+ void tic ()
+
+ DESCRIPTION
+ The `tic' function resets the internal interval timer. The
+ `toc' may be used to read the interval timer.
+
+ EXAMPLE
+ The tic/toc functions may be used to measure execution times. For
+ example, at the `slsh' prompt, they may be used to measure the speed
+ of a loop:
+
+ slsh> tic; loop (500000); toc;
+ 0.06558
+
+
+ NOTES
+ On Unix, this timer makes use of the C library `gettimeofday'
+ function.
+
+ SEE ALSO
+ toc, _toc, _tic, times
+
+--------------------------------------------------------------
+
+_time
+
+ SYNOPSIS
+ Get the current calendar time in seconds
+
+ USAGE
+ Long_Type _time ()
+
+ DESCRIPTION
+ The `_time' function returns the number of elapsed seconds since
+ 00:00:00 UTC, January 1, 1970. A number of functions (`ctime',
+ `gmtime', `localtime', etc.) are able to convert such a
+ value to other representations.
+
+ NOTES
+ This function is a wrapper around the C library `time'
+ function, and as such, probably does not account for leap seconds.
+
+ SEE ALSO
+ _ftime, ctime, time, localtime, gmtime
+
+--------------------------------------------------------------
+
+_ftime
+
+ SYNOPSIS
+ Get the current calendar time in seconds
+
+ USAGE
+ Double_Type _ftime ( Double_Type opt_epoch )
+
+ DESCRIPTION
+ The `_ftime' function returns the number seconds since the Unix
+ epoch, 00:00:00 UTC, January 1, 1970 as a double precision number.
+ If the optional argument `opt_epoch' is passed, the function
+ will return a value relative to that epoch, which is defined as the
+ number of seconds since the Unix epoch.
+
+ SEE ALSO
+ _time, ctime, time, localtime, gmtime
+
+--------------------------------------------------------------
+
+time
+
+ SYNOPSIS
+ Return the current date and time as a string
+
+ USAGE
+ String_Type time ()
+
+ DESCRIPTION
+ This function returns the current time as a string of the form:
+
+ Sun Apr 21 13:34:17 1996
+
+
+ SEE ALSO
+ strftime, ctime, message, substr
+
+--------------------------------------------------------------
+
+timegm
+
+ SYNOPSIS
+ Convert a time structure for the GMT timezone to seconds
+
+ USAGE
+ Long_Type secs = timegm(Struct_Type tm)
+
+ DESCRIPTION
+ `timegm' is the inverse of the `gmtime' function.
+
+ SEE ALSO
+ gmtime, mktime, localtime
+
+--------------------------------------------------------------
+
+times
+
+ SYNOPSIS
+ Get process times
+
+ USAGE
+ Struct_Type times ()
+
+ DESCRIPTION
+ The `times' function returns a structure containing the
+ following fields:
+
+ tms_utime (user time)
+ tms_stime (system time)
+ tms_cutime (user time of child processes)
+ tms_cstime (system time of child processes)
+
+
+ NOTES
+ Not all systems support this function.
+
+ SEE ALSO
+ _tic, _toc, _time
+
+--------------------------------------------------------------
+
+_toc
+
+ SYNOPSIS
+ Get the elapsed CPU time for the current process
+
+ USAGE
+ Double_Type _toc ()
+
+ DESCRIPTION
+ The `_toc' function returns the elapsed CPU time in seconds since
+ the last call to `_tic'. The CPU time is the amount of time the
+ CPU spent running the code of the current process.
+
+ NOTES
+ This function may not be available on all systems.
+
+ The implementation of this function is based upon the `times'
+ system call. The precision of the clock is system dependent and may
+ not be very accurate for small time intervals. For this reason, the
+ tic/toc functions may be more useful for small time-intervals.
+
+ SEE ALSO
+ _tic, tic, toc, times, _time
+
+--------------------------------------------------------------
+
+toc
+
+ SYNOPSIS
+ Read the interval timer
+
+ USAGE
+ Double_Type toc ()
+
+ DESCRIPTION
+ The `toc' function returns the elapsed time in seconds since
+ the last call to `tic'. See the documentation for the
+ `tic' function for more information.
+
+ SEE ALSO
+ tic, _tic, _toc, times, _time
+
+--------------------------------------------------------------
+
+_array_byteswap
+
+ SYNOPSIS
+ Convert an array from one endianness to another
+
+ USAGE
+ b = _array_byteswap (Array_Type a, Int_Type from, Int_Type to)
+
+ DESCRIPTION
+The `_array_byteswap' function converts the elements of an array
+from one endianess to another via a byte-swapping operation. The
+parameters `from' and `to' indicate the endianesss of the
+input and output arrays, respectively. The values for `from' and
+`to' parameters must be one of the following:
+
+ 'B', 'b', '>' : Big Endian (network order)
+ 'L', 'l', '<' : Little Endian
+ 'N', 'n', '=' : Native (host order)
+
+The function returns an array of the corresponding byte-swapped
+elements.
+
+ NOTES
+If the parameter `a' is a scalar, a corresponding byte-swapped
+scalar will be returned.
+
+If the object represented by the parameter `a' cannot be
+byteswapped, an exception will be thrown. For example, an error will
+be thrown if `a' is a String_Type object.
+
+ SEE ALSO
+ pack, unpack, typecast
+
+--------------------------------------------------------------
+
+atof
+
+ SYNOPSIS
+ Convert a string to a double precision number
+
+ USAGE
+ Double_Type atof (String_Type s)
+
+ DESCRIPTION
+ This function converts a string `s' to a double precision value
+ and returns the result. It performs no error checking on the format
+ of the string. The function `_slang_guess_type' may be used to
+ check the syntax of the string.
+
+ EXAMPLE
+
+ define error_checked_atof (s)
+ {
+ if (__is_datatype_numeric (_slang_guess_type (s)))
+ return atof (s);
+ throw InvalidParmError, "$s is not a double"$;
+ }
+
+
+ SEE ALSO
+ typecast, double, _slang_guess_type
+
+--------------------------------------------------------------
+
+atoi
+
+ SYNOPSIS
+ Convert a string to an integer
+
+ USAGE
+ Int_Type atoi (String_Type str)
+
+ DESCRIPTION
+ The `atoi' function converts a string to an `Int_Type'
+ using the standard C library function of the corresponding name.
+
+ NOTES
+ This function performs no syntax checking upon its argument.
+
+ SEE ALSO
+ integer, atol, atoll, atof, sscanf
+
+--------------------------------------------------------------
+
+atol
+
+ SYNOPSIS
+ Convert a string to an long integer
+
+ USAGE
+ Long_Type atol (String_Type str)
+
+ DESCRIPTION
+ The `atol' function converts a string to a `Long_Type'
+ using the standard C library function of the corresponding name.
+
+ NOTES
+ This function performs no syntax checking upon its argument.
+
+ SEE ALSO
+ integer, atoi, atoll, atof, sscanf
+
+--------------------------------------------------------------
+
+atoll
+
+ SYNOPSIS
+ Convert a string to a long long
+
+ USAGE
+ LLong_Type atoll (String_Type str)
+
+ DESCRIPTION
+ The `atoll' function converts a string to a `LLong_Type'
+ using the standard C library function of the corresponding name.
+
+ NOTES
+ This function performs no syntax checking upon its argument. Not
+ all platforms provide support for the long long data type.
+
+ SEE ALSO
+ integer, atoi, atol, atof, sscanf
+
+--------------------------------------------------------------
+
+char
+
+ SYNOPSIS
+ Convert a character code to a string
+
+ USAGE
+ String_Type char (Integer_Type c)
+
+ DESCRIPTION
+ The `char' function converts an integer character code (ascii)
+ value `c' to a string of unit character length such that the
+ first character of the string is `c'. For example,
+ `char('a')' returns the string `"a"'.
+
+ If UTF-8 mode is in effect (`_slang_utf8_ok' is non-zero), the
+ resulting single character may be represented by several bytes.
+
+ If the character code `c' is less than 0, then byte-semantics
+ will be used with the resulting string consisting of a single byte
+ whose value is that of `-c&0xFF'.
+
+ NOTES
+ A better name should have been chosen for this function.
+
+ SEE ALSO
+ integer, string, typedef, sprintf, pack
+
+--------------------------------------------------------------
+
+define_case
+
+ SYNOPSIS
+ Define upper-lower case conversion
+
+ USAGE
+ define_case (Integer_Type ch_up, Integer_Type ch_low)
+
+ DESCRIPTION
+ This function defines an upper and lowercase relationship between two
+ characters specified by the arguments. This relationship is used by
+ routines which perform uppercase and lowercase conversions.
+ The first integer `ch_up' is the ascii value of the uppercase character
+ and the second parameter `ch_low' is the ascii value of its
+ lowercase counterpart.
+
+ NOTES
+ This function has no effect in UTF-8 mode.
+
+ SEE ALSO
+ strlow, strup
+
+--------------------------------------------------------------
+
+double
+
+ SYNOPSIS
+ Convert an object to double precision
+
+ USAGE
+ Double_Type double (x)
+
+ DESCRIPTION
+ The `double' function typecasts an object `x' to double
+ precision. For example, if `x' is an array of integers, an
+ array of double types will be returned. If an object cannot be
+ converted to `Double_Type', a type-mismatch error will result.
+
+ NOTES
+ The `double' function is equivalent to the typecast operation
+
+ typecast (x, Double_Type)
+
+ To convert a string to a double precision number, use the `atof'
+ function.
+
+ SEE ALSO
+ typecast, atof, int
+
+--------------------------------------------------------------
+
+int
+
+ SYNOPSIS
+ Typecast an object to an integer
+
+ USAGE
+ Int_Type int (s)
+
+ DESCRIPTION
+ This function performs a typecast of an object `s' to
+ an object of Integer_Type. If `s' is a string, it returns
+ returns the ascii value of the first bytes of the string
+ `s'. If `s' is Double_Type, `int' truncates the
+ number to an integer and returns it.
+
+ EXAMPLE
+ `int' can be used to convert single byte strings to
+ integers. As an example, the intrinsic function `isdigit' may
+ be defined as
+
+ define isdigit (s)
+ {
+ if ((int (s) >= '0') and (int (s) <= '9')) return 1;
+ return 0;
+ }
+
+
+ NOTES
+ This function is equivalent to `typecast (s, Integer_Type)';
+
+ SEE ALSO
+ typecast, double, integer, char, isdigit, isxdigit
+
+--------------------------------------------------------------
+
+integer
+
+ SYNOPSIS
+ Convert a string to an integer
+
+ USAGE
+ Integer_Type integer (String_Type s)
+
+ DESCRIPTION
+ The `integer' function converts a string representation of an
+ integer back to an integer. If the string does not form a valid
+ integer, a SyntaxError will be thrown.
+
+ EXAMPLE
+ `integer ("1234")' returns the integer value `1234'.
+
+ NOTES
+ This function operates only on strings and is not the same as the
+ more general `typecast' operator.
+
+ SEE ALSO
+ typecast, _slang_guess_type, string, sprintf, char
+
+--------------------------------------------------------------
+
+isalnum, isalpha, isascii, isblank, iscntrl, isdigit, isgraph, islower, isprint, ispunct, isspace, isupper, isxdigit
+
+ SYNOPSIS
+ Character classification functions
+
+ USAGE
+ Char_Type isalnum(wch)
+ Char_Type isalpha(wch)
+ Char_Type isascii(wch)
+ Char_Type isblank(wch)
+ Char_Type iscntrl(wch)
+ Char_Type isdigit(wch)
+ Char_Type isgraph(wch)
+ Char_Type islower(wch)
+ Char_Type isprint(wch)
+ Char_Type ispunct(wch)
+ Char_Type isspace(wch)
+ Char_Type isupper(wch)
+ Char_Type isxdigit(wch)
+
+ DESCRIPTION
+ These functions return a non-zero value if the character given by
+ `wch' is a member of the character class represented by the
+ function, according to the table below. Otherwise, 0 will be
+ returned to indicate that the character is not a member of the
+ class. If the parameter `wch' is a string, then the first
+ character (not necessarily a byte) of the string will be used.
+
+ isalnum : alphanumeric character, equivalent to isalpha or isdigit
+ isalpha : alphabetic character
+ isascii : 7-bit unsigned ascii character
+ isblank : space or a tab
+ iscntrl : control character
+ isdigit : digit 0-9
+ isgraph : non-space printable character
+ islower : lower-case character
+ isprint : printable character, including a space
+ ispunct : non-alphanumeric graphic character
+ isspace : whitespace character (space, newline, tab, etc)
+ isupper : uppercase case character
+ isxdigit: hexadecimal digit character 0-9, a-f, A-F
+
+
+ SEE ALSO
+ strtrans
+
+--------------------------------------------------------------
+
+_slang_guess_type
+
+ SYNOPSIS
+ Guess the data type that a string represents
+
+ USAGE
+ DataType_Type _slang_guess_type (String_Type s)
+
+ DESCRIPTION
+ This function tries to determine whether its argument `s'
+ represents an integer (short, int, long), floating point (float,
+ double), or a complex number. If it appears to be none of these,
+ then a string is assumed. It returns one of the following values
+ depending on the format of the string `s':
+
+ Short_Type : short integer (e.g., "2h")
+ UShort_Type : unsigned short integer (e.g., "2hu")
+ Integer_Type : integer (e.g., "2")
+ UInteger_Type : unsigned integer (e.g., "2")
+ Long_Type : long integer (e.g., "2l")
+ ULong_Type : unsigned long integer (e.g., "2l")
+ Float_Type : float (e.g., "2.0f")
+ Double_Type : double (e.g., "2.0")
+ Complex_Type : imaginary (e.g., "2i")
+ String_Type : Anything else. (e.g., "2foo")
+
+ For example, `_slang_guess_type("1e2")' returns
+ Double_Type but `_slang_guess_type("e12")' returns
+ String_Type.
+
+ SEE ALSO
+ integer, string, double, atof, __is_datatype_numeric
+
+--------------------------------------------------------------
+
+string
+
+ SYNOPSIS
+ Convert an object to a string representation.
+
+ USAGE
+ String_Type string (obj)
+
+ DESCRIPTION
+ The `string' function may be used to convert an object
+ `obj' of any type to its string representation.
+ For example, `string(12.34)' returns `"12.34"'.
+
+ EXAMPLE
+
+ define print_anything (anything)
+ {
+ message (string (anything));
+ }
+
+
+ NOTES
+ This function is _not_ the same as typecasting to a String_Type
+ using the `typecast' function.
+
+ SEE ALSO
+ typecast, sprintf, integer, char
+
+--------------------------------------------------------------
+
+tolower
+
+ SYNOPSIS
+ Convert a character to lowercase.
+
+ USAGE
+ Integer_Type lower (Integer_Type ch)
+
+ DESCRIPTION
+ This function takes an integer `ch' and returns its lowercase
+ equivalent.
+
+ SEE ALSO
+ toupper, strup, strlow, int, char, define_case
+
+--------------------------------------------------------------
+
+toupper
+
+ SYNOPSIS
+ Convert a character to uppercase.
+
+ USAGE
+ Integer_Type toupper (Integer_Type ch)
+
+ DESCRIPTION
+ This function takes an integer `ch' and returns its uppercase
+ equivalent.
+
+ SEE ALSO
+ tolower, strup, strlow, int, char, define_case
+
+--------------------------------------------------------------
+
+typecast
+
+ SYNOPSIS
+ Convert an object from one data type to another.
+
+ USAGE
+ typecast (x, new_type)
+
+ DESCRIPTION
+ The `typecast' function performs a generic typecast operation on
+ `x' to convert it to `new_type'. If `x' represents an
+ array, the function will attempt to convert all elements of `x'
+ to `new_type'. Not all objects can be converted and a
+ type-mismatch error will result upon failure.
+
+ EXAMPLE
+
+ define to_complex (x)
+ {
+ return typecast (x, Complex_Type);
+ }
+
+ defines a function that converts its argument, `x' to a complex
+ number.
+
+ SEE ALSO
+ int, double, typeof, _array_byteswap
+
+--------------------------------------------------------------
+
+_typeof
+
+ SYNOPSIS
+ Get the data type of an object
+
+ USAGE
+ DataType_Type _typeof (x)
+
+ DESCRIPTION
+ This function is similar to the `typeof' function except in the
+ case of arrays. If the object `x' is an array, then the data
+ type of the array will be returned. Otherwise `_typeof' returns
+ the data type of `x'.
+
+ EXAMPLE
+
+ if (Integer_Type == _typeof (x))
+ message ("x is an integer or an integer array");
+
+
+ SEE ALSO
+ typeof, array_info, _slang_guess_type, typecast
+
+--------------------------------------------------------------
+
+typeof
+
+ SYNOPSIS
+ Get the data type of an object
+
+ USAGE
+ DataType_Type typeof (x)
+
+ DESCRIPTION
+ This function returns the data type of `x'.
+
+ EXAMPLE
+
+ if (Integer_Type == typeof (x)) message ("x is an integer");
+
+
+ SEE ALSO
+ _typeof, is_struct_type, array_info, _slang_guess_type, typecast
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm Added

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/Makefile Added

@@ -0,0 +1,131 @@
+# -*- sh -*-
+#
+# To create the SGML files, you will need to install the tmexpand
+# package. See http://www.jedsoft.org/ for more information.
+#
+#TMEXPAND = $(HOME)/lib/tmexpand/bin/tmexpand
+TMEXPAND = tmexpand
+MACRODIR = -I$(HOME)/lib/tmexpand/macros
+TM2SGML = $(TMEXPAND)
+TM2HLP = $(TMEXPAND) -Mslhlp
+
+TXT_FILES = slang.txt cslang.txt cref.txt slangfun.txt
+SGML_FILES = slang.sgml cslang.sgml cref.sgml slangfun.sgml
+HTML_FILES = slang.html cslang.html cref.html slangfun.html
+TEX_FILES = slang.tex cslang.tex cref.tex #slangfun.tex
+PS_FILES = slang.ps cslang.ps slangfun.ps #cref.ps
+PDF_FILES = slang.pdf cslang.pdf slangfun.pdf cref.pdf
+
+SGML2LATEX = sgml2latex -p letter -o tex
+SGML2HTML = sgml2html
+#SGML2TXT = sgml2txt -f
+SGML2TXT = linuxdoc -B txt -f
+TM2TXT = tools/$(ARCH)objs/tm2txt --quiet
+LATEX = latex
+PDFLATEX = pdflatex
+
+TEXTDIR = ../text
+PSDIR = ../ps
+HTMLDIR = ../html
+PDFDIR = ../pdf
+
+SUBDIRS = $(TEXTDIR) $(HTMLDIR) $(PSDIR) $(SGMLDIR) $(PDFDIR)
+SRCDIR = `pwd`
+
+text-files: $(TXT_FILES)
+all: $(SGML_FILES) $(HTML_FILES) $(TEX_FILES) $(TXT_FILES) $(PDF_FILES) $(PS_FILES)
+#----- SGML Files -----------------------------------------------------------
+cslang.sgml : cslang.tm preface.tm copyright.tm local.tm apinews.tm
+	$(TM2SGML) cslang.tm cslang.sgml
+slang.sgml : slang.tm preface.tm copyright.tm local.tm intnews.tm
+	$(TM2SGML) slang.tm slang.sgml
+cref.sgml : cref.tm crtl/*.tm
+	$(TM2SGML) cref.tm cref.sgml
+slangfun.sgml : slangfun.tm local.tm rtl/*.tm
+	$(TM2SGML) slangfun.tm slangfun.sgml
+#----- HTML Files -----------------------------------------------------------
+html-files: $(HTML_FILES)
+cslang.html : cslang.sgml
+	$(SGML2HTML) cslang.sgml
+slang.html : slang.sgml
+	$(SGML2HTML) slang.sgml
+cref.html : cref.sgml
+	$(SGML2HTML) cref.sgml
+slangfun.html : slangfun.sgml
+	$(SGML2HTML) slangfun.sgml
+#----- TeX Files ------------------------------------------------------------
+slang.tex : slang.sgml
+	$(SGML2LATEX) slang.sgml
+	jed -script ./fixtex.sl slang.tex
+cslang.tex : cslang.sgml
+	$(SGML2LATEX) cslang.sgml
+	jed -script ./fixtex.sl cslang.tex
+slangfun.tex: slangfun.sgml
+	$(SGML2LATEX) slangfun.sgml
+	jed -script ./fixtex.sl slangfun.tex
+cref.tex: cref.sgml
+	$(SGML2LATEX) cref.sgml
+	jed -script ./fixtex.sl cref.tex
+#----- PDF Files -----------------------------------------------------------
+pdf-files: $(PDF_FILES)
+cslang.pdf : cslang.tex
+	$(PDFLATEX) cslang.tex
+	$(PDFLATEX) cslang.tex
+	$(PDFLATEX) cslang.tex
+slang.pdf : slang.tex
+	$(PDFLATEX) slang.tex
+	$(PDFLATEX) slang.tex
+	$(PDFLATEX) slang.tex
+slangfun.pdf: slangfun.tex
+	$(PDFLATEX) slangfun.tex
+	$(PDFLATEX) slangfun.tex
+	$(PDFLATEX) slangfun.tex
+cref.pdf : cref.tex
+	$(PDFLATEX) cref.tex
+	$(PDFLATEX) cref.tex
+	$(PDFLATEX) cref.tex
+#----- PS Files -----------------------------------------------------------
+cslang.ps : cslang.tex
+	$(LATEX) cslang.tex
+	$(LATEX) cslang.tex
+	dvips -o cslang.ps cslang.dvi
+slang.ps : slang.tex
+	$(LATEX) slang.tex
+	$(LATEX) slang.tex
+	dvips -o slang.ps slang.dvi
+slangfun.ps : slangfun.tex
+	$(LATEX) slangfun.tex
+	$(LATEX) slangfun.tex
+	dvips -o slangfun.ps slangfun.dvi
+#----- Text Files -----------------------------------------------------------
+cslang.txt: cslang.sgml
+	$(SGML2TXT) cslang.sgml
+	./tools/fixtxt cslang.txt
+slang.txt: slang.sgml
+	$(SGML2TXT) slang.sgml
+	./tools/fixtxt slang.txt
+#
+slangfun.txt : slangfun.tm hlpdefs.tm rtl/*.tm
+	cat hlpdefs.tm rtl/*.tm | $(TM2HLP) - slangfun.txt
+#	cat rtl/*.tm | $(TM2TXT) > slangfun.txt
+cref.txt : cref.sgml
+	$(SGML2TXT) cref.sgml
+	./tools/fixtxt cref.txt
+#	$(TM2TXT) < cref.tm > cref.txt
+$(TM2TXT) : tools/tm2txt.c
+	cd tools; make SRCDIR=$(SRCDIR)
+#----------------------------------------------------------------------------
+clean:
+	-rm -f *~ *.dvi *.log *.aux *.toc rtl/*.BAK rtl/*~ crtl/*~ *.tmp *-error
+distclean: clean
+	-rm -f *.html *.ps $(TXT_FILES) $(TEX_FILES) $(SGML_FILES) $(PDF_FILES)
+	cd tools; make clean
+install: $(TXT_FILES)
+	-mv $(TXT_FILES) ../text
+
+install-all: all
+	-mkdir $(SUBDIRS)
+	-mv $(TXT_FILES) ../text
+	-mv *.html ../html
+	-mv $(PS_FILES) ../ps
+	-mv $(PDF_FILES) ../pdf

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/apinews.tm Added

@@ -0,0 +1,191 @@
+\chapter{S-Lang 2 API NEWS and UPGRADE information}
+
+ The \slang API underwent a number of changes for version 2. In
+ particular, the following interfaces have been affected:
+#v+
+ SLsmg
+ SLregexp
+ SLsearch
+ SLrline
+ SLprep
+ slang interpreter modules
+#v-
+ Detailed information about these changes is given below. Other
+ changes include:
+\begin{itemize}
+\item UTF-8 encoded strings are now supported at both the C library level
+ and the interpreter.
+\item Error handling by the interpreter has been rewritten to support
+ try/catch style exception. Applications may also define
+ application-specific error codes.
+\item The library may be compiled with large-file-support.
+\end{itemize}
+See the relevant chapters in this manual for more information.
+
+\sect{SLang_Error}
+
+ The \var{SLang_Error} variable is nolonger part of the API. Change code
+ such as
+#v+
+ SLang_Error = foo;
+ if (SLang_Error == bar) ...
+#v-
+ to
+#v+
+ SLang_set_error (foo);
+ if (bar == SLang_get_error ()) ...
+#v-
+
+\sect{SLsmg/SLtt Functions}
+
+ The changes to these functions were dictated by the new UTF-8
+ support. For the most part, the changes should be transparent but
+ some functions and variables have been changed.
+
+\begin{itemize}
+\item SLtt_Use_Blink_For_ACS is nolonger supported, nor necessary I think only
+ DOSEMU uses this.
+\item
+ Prototypes for \cfun{SLsmg_draw_object} and \cfun{SLsmg_write_char}
+ were changed to use wide characters (SLwchar_Type).
+\item
+ \var{SLsmg_Char_Type} was changed from an \exmp{unsigned short} to a
+ structure. This change was necessary in order to support combining
+ characters and double width unicode characters. This change may affect
+ the use of the following functions:
+#v+
+ SLsmg_char_at
+ SLsmg_read_raw
+ SLsmg_write_raw
+ SLsmg_write_color_chars
+#v-
+\item The \exmp{SLSMG_BUILD_CHAR} macro has been removed.
+ The \exmp{SLSMG_EXTRACT_CHAR} macro will continue to work as long as
+ combining characters are not present.
+\item The prototype for \cfun{SLsmg_char_at} was changed to
+#v+
+ int SLsmg_char_at (SLsmg_Char_Type *);
+#v-
+\end{itemize}
+
+\sect{SLsearch Functions}
+
+ \var{SLsearch_Type} is now an opaque type. Code such as
+#v+
+ SLsearch_Type st;
+ SLsearch_init (string, 1, 0, &st);
+ .
+ .
+ s = SLsearch (buf, bufmax, &st);
+#v-
+ which searches forward in \exmp{buf} for \exmp{string} must be changed to
+#v+
+ SLsearch_Type *st = SLsearch_open (string, SLSEARCH_CASELESS);
+ if (st == NULL)
+ return;
+ .
+ .
+ s = SLsearch_forward (st, buf, bufmax);
+ .
+ .
+ SLsearch_close (st);
+#v-
+
+\sect{Regular Expression Functions}
+
+ The slang v1 regular expression API has been redesigned in order to
+ facilitate the incorporation of third party regular expression
+ engines.
+
+ New functions include:
+#v+
+ SLregexp_compile
+ SLregexp_free
+ SLregexp_match
+ SLregexp_nth_match
+ SLregexp_get_hints
+#v-
+
+ The plan is to migrate to the use of the PCRE regular expressions
+ for version 2.2. As such, you may find it convenient to adopt the
+ PCRE library now instead of updating to the changed \slang API.
+
+\sect{Readline Functions}
+
+ The readline interface has changed in order to make it easier to
+ use. Using it now is as simple as:
+#v+
+ SLrline_Type *rli;
+ rli = SLrline_open (SLtt_Screen_Cols, flags);
+ buf = SLrline_read_line (rli, prompt, &len);
+ /* Use buf */
+ .
+ .
+ SLfree (buf);
+ SLrline_close (rli);
+#v-
+ See how it is used in \file{slsh/readline.c}.
+
+\sect{Preprocessor Interface}
+
+ SLPreprocess_Type was renamed to SLprep_Type and made opaque.
+ New functions include:
+#v+
+ SLprep_new
+ SLprep_delete
+ SLprep_set_flags
+ SLprep_set_comment
+ SLprep_set_prefix
+ SLprep_set_exists_hook
+ SLprep_set_eval_hook
+#v-
+ If you currently use:
+#v+
+ SLPreprocess_Type pt;
+ SLprep_open_prep (&pt);
+ .
+ .
+ SLprep_close_prep (&pt);
+#v-
+ Then change it to:
+#v+
+ SLprep_Type *pt;
+ pt = SLprep_new ();
+ .
+ .
+ SLprep_delete (pt);
+#v-
+
+\sect{Functions dealing with the interpreter C API}
+
+\begin{itemize}
+\item \cfun{SLang_pop_double} has been changed to be more like the other
+ \cfun{SLang_pop_*} functions. Now, it may be used as:
+#v+
+ double x;
+ if (-1 == SLang_pop_double (&x))
+ .
+ .
+#v-
+\item All the functions that previously took an "unsigned char" to
+ specify a slang data type have changed to require an \var{SLtype}.
+ Previously, \var{SLtype} was typedefed to be an \var{unsigned
+ char}, but now it is an \var{int}.
+
+\item The \var{SLang_Class_Type} object is now an opaque type. If you were
+ previously accessing its fields directly, then you will have to
+ change the code to use one of the accessor functions.
+\end{itemize}
+
+\sect{Modules}
+
+\begin{itemize}
+\item
+ In order to support the loading of a module into multiple
+ namespaces, a module's init function may be called more than once.
+ See modules/README for more information.
+\item
+ The \var{init_<module>_module} function is no longer supported
+ because it did not support namespaces. Use the
+ \var{init_<module>_module_ns} function instead.
+\end{itemize}

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/copyright.tm Added

@@ -0,0 +1,387 @@
+\chapter{Copyright}
+ The \slang library is distributed under the terms of the GNU General
+ Public License.
+
+\sect{The GNU Public License}
+#v+
+ GNU GENERAL PUBLIC LICENSE
+ Version 2, June 1991
+
+ Copyright (C) 1989, 1991 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.
+
+ Preamble
+#v-
+ The licenses for most software are designed to take away your
+freedom to share and change it. By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users. This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it. (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.) 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
+this service 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 make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have. 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.
+
+ We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+ Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software. If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+ Finally, any free program is threatened constantly by software
+patents. We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary. To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+#v+
+ GNU GENERAL PUBLIC LICENSE
+ TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+#v-
+ 0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License. The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language. (Hereinafter, translation is included without limitation in
+the term "modification".) Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope. The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+ 1. You may copy and distribute 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 and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+ 2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+#v+
+ a) You must cause the modified files to carry prominent notices
+ stating that you changed the files and the date of any change.
+
+ b) You must cause any work that you distribute or publish, that in
+ whole or in part contains or is derived from the Program or any
+ part thereof, to be licensed as a whole at no charge to all third
+ parties under the terms of this License.
+
+ c) If the modified program normally reads commands interactively
+ when run, you must cause it, when started running for such
+ interactive use in the most ordinary way, to print or display an
+ announcement including an appropriate copyright notice and a
+ notice that there is no warranty (or else, saying that you provide
+ a warranty) and that users may redistribute the program under
+ these conditions, and telling the user how to view a copy of this
+ License. (Exception: if the Program itself is interactive but
+ does not normally print such an announcement, your work based on
+ the Program is not required to print an announcement.)
+#v-
+These requirements apply to the modified work as a whole. If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works. But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+ 3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+#v+
+ a) Accompany it with the complete corresponding machine-readable
+ source code, which must be distributed under the terms of Sections
+ 1 and 2 above on a medium customarily used for software interchange; or,
+
+ b) Accompany it with a written offer, valid for at least three
+ years, to give any third party, for a charge no more than your
+ cost of physically performing source distribution, a complete
+ machine-readable copy of the corresponding source code, to be
+ distributed under the terms of Sections 1 and 2 above on a medium
+ customarily used for software interchange; or,
+
+ c) Accompany it with the information you received as to the offer
+ to distribute corresponding source code. (This alternative is
+ allowed only for noncommercial distribution and only if you
+ received the program in object code or executable form with such
+ an offer, in accord with Subsection b above.)
+#v-
+The source code for a work means the preferred form of the work for
+making modifications to it. For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable. However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+ 4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License. Any attempt
+otherwise to copy, modify, sublicense or distribute the Program 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.
+
+ 5. You are not required to accept this License, since you have not
+signed it. However, nothing else grants you permission to modify or
+distribute the Program or its derivative works. These actions are
+prohibited by law if you do not accept this License. Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+ 6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions. You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+ 7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+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
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all. For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices. Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+ 8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded. In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+ 9. The Free Software Foundation may publish revised and/or new versions
+of the 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 a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation. If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+ 10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission. For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this. Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+#v+
+ NO WARRANTY
+
+ 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, 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.
+
+ 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE 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.
+
+ END OF TERMS AND CONDITIONS
+#v-
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+ To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+#v+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) 19yy <name of author>
+
+ 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 2 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, write to the Free Software
+ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+#v-
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+#v+
+ Gnomovision version 69, Copyright (C) 19yy name of author
+ Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+#v-
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary. Here is a sample; alter the names:
+#v+
+ Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+ `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+ <signature of Ty Coon>, 1 April 1989
+ Ty Coon, President of Vice
+#v-
+This General Public License does not permit incorporating your program into
+proprietary programs. If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library. If this is what you want to do, use the GNU Library General
+Public License instead of this License.
+
+\sect{The Unicode Inc. Copyright}
+This software makes use of the Unicode tables published by Unicode, Inc
+under the following terms:
+#v+
+ COPYRIGHT AND PERMISSION NOTICE
+
+ Copyright (c) 1991-2009 Unicode, Inc. All rights reserved. Distributed
+ under the Terms of Use in http://www.unicode.org/copyright.html.
+
+ Permission is hereby granted, free of charge, to any person
+ obtaining a copy of the Unicode data files and any associated
+ documentation (the "Data Files") or Unicode software and any
+ associated documentation (the "Software") to deal in the Data Files
+ or Software without restriction, including without limitation the
+ rights to use, copy, modify, merge, publish, distribute, and/or sell
+ copies of the Data Files or Software, and to permit persons to whom
+ the Data Files or Software are furnished to do so, provided that (a)
+ the above copyright notice(s) and this permission notice appear with
+ all copies of the Data Files or Software, (b) both the above
+ copyright notice(s) and this permission notice appear in associated
+ documentation, and (c) there is clear notice in each modified Data
+ File or in the Software as well as in the documentation associated
+ with the Data File(s) or Software that the data or software has been
+ modified.
+
+ THE DATA FILES AND SOFTWARE ARE 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 OF THIRD PARTY RIGHTS. IN NO EVENT SHALL THE
+ COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE BE LIABLE FOR
+ ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY
+ DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
+ WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
+ ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
+ OF THE DATA FILES OR SOFTWARE.
+
+ Except as contained in this notice, the name of a copyright holder
+ shall not be used in advertising or otherwise to promote the sale,
+ use or other dealings in these Data Files or Software without prior
+ written authorization of the copyright holder.
+#v-

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/cref.tm Added

@@ -0,0 +1,68 @@
+#i linuxdoc.tm
+
+#i local.tm
+
+#d chapter#1 <chapt>$1
+#d preface <preface>
+#d tag#1 <tag>$1</tag>
+
+#d function#1 \sect1{<bf>$1</bf>\label{$1}}<descrip>
+#d variable#1 \sect1{<bf>$1</bf>\label{$1}}<descrip>
+#cd function#1 <bf>$1</bf>\label{$1}<descrip>
+#d synopsis#1 <tag> Synopsis </tag> $1
+#d keywords#1 <tag> Keywords </tag> $1
+#d usage#1 <tag> Usage </tag> <tt>$1</tt>
+#d description <tag> Description </tag>
+#d example <tag> Example </tag>
+#d notes <tag> Notes </tag>
+#d seealso#1 <tag> See Also </tag> <tt>$1</tt>
+#d documentstyle article
+#d done </descrip>
+
+\linuxdoc
+\begin{\documentstyle}
+
+\title The S-Lang C Library Reference
+\author John E. Davis <www.jedsoft.org>
+\date \__today__
+
+\toc
+
+\sect{Functions dealing with UTF-8 encoded strings}
+#i crtl/slutf8.tm
+
+\sect{Character classification functions}
+#i crtl/slwchar.tm
+
+\sect{SLsearch interface Functions}
+#i crtl/slsearch.tm
+
+\sect{Screen Management (SLsmg) functions}
+#i crtl/slsmg.tm
+
+\sect{Functions that deal with the interpreter}
+#i crtl/slinterp.tm
+
+\sect{Library Initialization Functions}
+#i crtl/slinit.tm
+
+\sect{Miscellaneous Functions}
+#i crtl/slmisc.tm
+
+\sect{Error and Messaging Functions}
+#i crtl/slerr.tm
+
+\sect{String and Memory Allocation Functions}
+#i crtl/slalloc.tm
+
+\sect{Keyboard Input Functions}
+#i crtl/sltty.tm
+
+\sect{Keymap Functions}
+#i crtl/slkeymap.tm
+
+\sect{Undocumented Functions}
+The following functions are not yet documented:
+#i crtl/undoc.tm
+
+\end{\documentstyle}

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/crtl Added

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/crtl/slalloc.tm Added

@@ -0,0 +1,162 @@
+\function{SLmake_string}
+\synopsis{Duplicate a string}
+\usage{char *SLmake_string (char *s)}
+\description
+  The \var{SLmake_string} function creates a new copy of the string
+  \var{s}, via \var{malloc}, and returns it.  Upon failure it returns
+  \var{NULL}.  Since the resulting string is malloced, it should be
+  freed when nolonger needed via a call to either \var{free} or
+  \var{SLfree}.
+\notes
+  \var{SLmake_string} should not be confused with the function
+  \var{SLang_create_slstring}, which performs a similar function.
+\seealso{SLmake_nstring, SLfree, SLmalloc, SLang_create_slstring}
+\done
+
+\function{SLmake_nstring}
+\synopsis{Duplicate a substring}
+\usage{char *SLmake_nstring (char *s, unsigned int n)}
+\description
+  This function is like \var{SLmake_string} except that it creates a
+  null terminated string formed from the first \var{n} characters of
+  \var{s}.  Upon failure, it returns \var{NULL}, otherwise it returns
+  the new string.  When nolonger needed, the returned string should be
+  freed with \var{SLfree}.
+\seealso{SLmake_string, SLfree, SLang_create_nslstring}
+\done
+
+\function{SLang_create_nslstring}
+\synopsis{Created a hashed substring}
+\usage{char *SLang_create_nslstring (char *s, unsigned int n)}
+\description
+  \var{SLang_create_nslstring} is like \var{SLang_create_slstring}
+  except that only the first \var{n} characters of \var{s} are used to
+  create the hashed string.  Upon error, it returns \var{NULL}, otherwise it
+  returns the hashed substring.  Such a string must be freed by the
+  function \var{SLang_free_slstring}.
+\notes
+  Do not use \var{free} or \var{SLfree} to free the string returned by
+  \var{SLang_create_slstring} or \var{SLang_create_nslstring}.  Also
+  it is important that no attempt is made to modify the hashed string
+  returned by either of these functions.  If one needs to modify a
+  string, the functions \var{SLmake_string} or \var{SLmake_nstring}
+  should be used instead.
+\seealso{SLang_free_slstring, SLang_create_slstring, SLmake_nstring}
+\done
+
+\function{SLang_create_slstring}
+\synopsis{Create a hashed string}
+\usage{char *SLang_create_slstring (char *s)}
+\description
+  The \var{SLang_create_slstring} creates a copy of \var{s} and
+  returns it as a hashed string.  Upon error, the function returns
+  \var{NULL}, otherwise it returns the hashed string.  Such a string
+  must only be freed via the \var{SLang_free_slstring} function.
+\notes
+  Do not use \var{free} or \var{SLfree} to free the string returned by
+  \var{SLang_create_slstring} or \var{SLang_create_nslstring}.  Also
+  it is important that no attempt is made to modify the hashed string
+  returned by either of these functions.  If one needs to modify a
+  string, the functions \var{SLmake_string} or \var{SLmake_nstring}
+  should be used instead.
+\seealso{SLang_free_slstring, SLang_create_nslstring, SLmake_string}
+\done
+
+\function{SLang_free_slstring}
+\synopsis{Free a hashed string}
+\usage{void SLang_free_slstring (char *s)}
+\description
+  The \var{SLang_free_slstring} function is used to free a hashed
+  string such as one returned by \var{SLang_create_slstring},
+  \var{SLang_create_nslstring}, or \var{SLang_create_static_slstring}.
+  If \var{s} is \var{NULL}, the routine does nothing.
+\seealso{SLang_create_slstring, SLang_create_nslstring, SLang_create_static_slstring}
+\done
+
+\function{SLang_concat_slstrings}
+\synopsis{Concatenate two strings to produce a hashed string}
+\usage{char *SLang_concat_slstrings (char *a, char *b)}
+\description
+  The \var{SLang_concat_slstrings} function concatenates two strings,
+  \var{a} and \var{b}, and returns the result as a hashed string.
+  Upon failure, \var{NULL} is returned.
+\notes
+  A hashed string can only be freed using \var{SLang_free_slstring}.
+  Never use \var{free} or \var{SLfree} to free a hashed string,
+  otherwise memory corruption will result.
+\seealso{SLang_free_slstring, SLang_create_slstring}
+\done
+
+\function{SLang_create_static_slstring}
+\synopsis{Create a hashed string}
+\usage{char *SLang_create_static_slstring (char *s_literal)}
+\description
+  The \var{SLang_create_static_slstring} creates a hashed string from
+  the string literal \var{s_literal} and returns the result.  Upon
+  failure it returns \var{NULL}.
+\example
+#v+
+     char *create_hello (void)
+     {
+        return SLang_create_static_slstring ("hello");
+     }
+#v-
+\notes
+  This function should only be used with string literals.
+\seealso{SLang_create_slstring, SLang_create_nslstring}
+\done
+
+\function{SLmalloc}
+\synopsis{Allocate some memory}
+\usage{char *SLmalloc (unsigned int nbytes)}
+\description
+  This function uses \var{malloc} to allocate \var{nbytes} of memory.
+  Upon error it returns \var{NULL}; otherwise it returns a pointer to
+  the allocated memory.  One should use \var{SLfree} to free the
+  memory after use.
+\seealso{SLfree, SLrealloc, SLcalloc}
+\done
+
+\function{SLcalloc}
+\synopsis{Allocate some memory}
+\usage{char *SLcalloc (unsigned int num_elem, unsigned int elem_size)}
+\description
+  This function uses \var{calloc} to allocate memory for
+  \var{num_elem} objects with each of size \var{elem_size} and returns
+  the result.  In addition, the newly allocated memory is zeroed.
+  Upon error it returns \var{NULL}; otherwise it returns a pointer to
+  the allocated memory.  One should use \var{SLfree} to free the
+  memory after use.
+\seealso{SLmalloc, SLrealloc, SLfree}
+\done
+
+\function{SLfree}
+\synopsis{Free some allocated memory}
+\usage{void SLfree (char *ptr)}
+\description
+  The \var{SLfree} function deallocates the memory specified by
+  \var{ptr}, which may be \var{NULL} in which case the function does
+  nothing.
+\notes
+  Never use this function to free a hashed string returned by one of
+  the family of \var{slstring} functions, e.g.,
+  \var{SLang_pop_slstring}.
+\seealso{SLmalloc, SLcalloc, SLrealloc, SLmake_string}
+\done
+
+\function{SLrealloc}
+\synopsis{Resize a dynamic memory block}
+\usage{char *SLrealloc (char *ptr, unsigned int new_size)}
+\description
+  The \var{SLrealloc} uses the \var{realloc} function to resize the
+  memory block specified by \var{ptr} to the new size \var{new_size}.
+  If \var{ptr} is \var{NULL}, the function call is equivalent to
+  \exmp{SLmalloc(new_size)}.  Similarly, if \var{new_size} is zero,
+  the function call is equivalent to \var{SLfree(ptr)}.
+
+  If the function fails, or if \var{new_size} is zero, \var{NULL} is
+  returned.  Otherwise a pointer is returned to the (possibly moved)
+  new block of memory.
+\seealso{SLfree, SLmalloc, SLcalloc}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/crtl/slerr.tm Added

@@ -0,0 +1,62 @@
+\function{SLang_verror}
+\synopsis{Signal an error with a message}
+\usage{void SLang_verror (int code, char *fmt, ...);}
+\description
+   The \var{SLang_verror} function sets \var{SLang_Error} to
+   \var{code} if \var{SLang_Error} is 0.  It also displays the error
+   message implied by the \var{printf} variable argument list using
+   \var{fmt} as the format.
+\example
+#v+
+      FILE *open_file (char *file)
+      {
+         char *file = "my_file.dat";
+	 if (NULL == (fp = fopen (file, "w")))
+	   SLang_verror (SL_INTRINSIC_ERROR, "Unable to open %s", file);
+	 return fp;
+      }
+#v-
+\seealso{SLang_vmessage, SLang_exit_error}
+\done
+
+\function{SLang_doerror}
+\synopsis{Signal an error}
+\usage{void SLang_doerror (char *err_str)}
+\description
+  The \var{SLang_doerror} function displays the string \var{err_str}
+  to the error device and signals a \slang error.
+\notes
+  \var{SLang_doerror} is considered to obsolete.  Applications should
+  use the \var{SLang_verror} function instead.
+\seealso{SLang_verror, SLang_exit_error}
+\done
+
+\function{SLang_vmessage}
+\synopsis{Display a message to the message device}
+\usage{void SLang_vmessage (char *fmt, ...)}
+\description
+  This function prints a \var{printf} style formatted variable
+  argument list to the message device.  The default message device is
+  \var{stdout}.
+\seealso{SLang_verror}
+\done
+
+\function{SLang_exit_error}
+\synopsis{Exit the program and display an error message}
+\usage{void SLang_exit_error (char *fmt, ...)}
+\description
+   The \var{SLang_exit_error} function terminates the program and
+   displays an error message using a \var{printf} type variable
+   argument list.  The default behavior to this function is to write
+   the message to \var{stderr} and exit with the \var{exit} system
+   call.
+
+   If the function pointer \var{SLang_Exit_Error_Hook} is
+   non-NULL, the function to which it points will be called.  This
+   permits an application to perform whatever cleanup is necessary.
+   This hook has the prototype:
+#v+
+     void (*SLang_Exit_Error_Hook)(char *, va_list);
+#v-
+\seealso{SLang_verror, exit}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/crtl/slinit.tm Added

@@ -0,0 +1,59 @@
+\function{SLang_init_slang}
+\synopsis{Initialize the interpreter}
+\usage{int SLang_init_slang (void)}
+\description
+  The \var{SLang_init_slang} function must be called by all
+  applications that use the \slang interpreter.  It initializes the
+  interpreter, defines the built-in data types, and adds a set of core
+  intrinsic functions.
+
+  The function returns \var{0} upon success, or \var{-1} upon failure.
+\seealso{SLang_init_slfile, SLang_init_slmath, SLang_init_slunix}
+\done
+
+\function{SLang_init_slfile}
+\synopsis{Initialize the interpreter file I/O intrinsics}
+\usage{int SLang_init_slfile (void)}
+\description
+  This function initializes the interpreters file I/O intrinsic
+  functions.  This function adds intrinsic functions such as
+  \var{fopen}, \var{fclose}, and \var{fputs} to the interpreter.
+  It returns \exmp{0} if successful, or \exmp{-1} upon error.
+\notes
+  Before this function can be called, it is first necessary to call
+  \var{SLang_init_slang}.  It also adds
+  the preprocessor symbol \var{__SLFILE__} to the interpreter.
+\seealso{SLang_init_slang, SLang_init_slunix, SLang_init_slmath}
+\done
+
+\function{SLang_init_slmath}
+\synopsis{Initialize the interpreter math intrinsics}
+\usage{int SLang_init_slmath (void)}
+\description
+  The \var{SLang_init_slmath} function initializes the interpreter's
+  mathematical intrinsic functions and makes them available to the
+  language.  The intrinsic functions include \var{sin}, \var{cos},
+  \var{tan}, etc...  It returns \exmp{0} if successful, or \exmp{-1}
+  upon failure.
+\notes
+  This function must be called after \var{SLang_init_slang}.  It adds
+  the preprocessor symbol \var{__SLMATH__} to the interpreter.
+\seealso{SLang_init_slang, SLang_init_slfile, SLang_init_slunix}
+\done
+
+\function{SLang_init_slunix}
+\synopsis{Make available some unix system calls to the interpreter}
+\usage{int SLang_init_slunix (void)}
+\description
+  The \var{SLang_init_slunix} function initializes the interpreter's
+  unix system call intrinsic functions and makes them available to the
+  language.  Examples of functions made available by
+  \var{SLang_init_slunix} include \var{chmod}, \var{chown}, and
+  \var{stat_file}.  It returns \exmp{0} if successful, or \exmp{-1}
+  upon failure.
+\notes
+  This function must be called after \var{SLang_init_slang}.  It adds
+  the preprocessor symbol \var{__SLUNIX__} to the interpreter.
+\seealso{SLang_init_slang, SLang_init_slfile, SLang_init_slmath}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/crtl/slinterp.tm Added

@@ -0,0 +1,1018 @@
+\function{SLallocate_load_type}
+\synopsis{Allocate a SLang_Load_Type object}
+\usage{SLang_Load_Type *SLallocate_load_type (char *name)}
+\description
+ The \var{SLallocate_load_type} function allocates and initializes
+ space for a \var{SLang_Load_Type} object and returns it. Upon
+ failure, the function returns \var{NULL}. The parameter \var{name}
+ must uniquely identify the object. For example, if the object
+ represents a file, then \var{name} could be the absolute path name
+ of the file.
+\seealso{SLdeallocate_load_type, SLang_load_object}
+\done
+
+\function{SLdeallocate_load_type}
+\synopsis{Free a SLang_Load_Type object}
+\usage{void SLdeallocate_load_type (SLang_Load_Type *slt)}
+\description
+ This function frees the memory associated with a
+ \var{SLang_Load_Type} object that was acquired from a call to the
+ \var{SLallocate_load_type} function.
+\seealso{SLallocate_load_type, SLang_load_object}
+\done
+
+\function{SLang_load_object}
+\synopsis{Load an object into the interpreter}
+\usage{int SLang_load_object (SLang_Load_Type *obj)}
+\description
+ The function \var{SLang_load_object} is a generic function that may
+ be used to loaded an object of type \var{SLang_Load_Type} into the
+ interpreter. For example, the functions \var{SLang_load_file} and
+ \var{SLang_load_string} are wrappers around this function to load a
+ file and a string, respectively.
+\seealso{SLang_load_file, SLang_load_string, SLallocate_load_type}
+\done
+
+\function{SLclass_allocate_class}
+\synopsis{Allocate a class for a new data type}
+\usage{SLang_Class_Type *SLclass_allocate_class (char *name)}
+\description
+ The purpose of this function is to allocate and initialize space
+ that defines a new data type or class called \var{name}. If
+ successful, a pointer to the class is returned, or upon failure the
+ function returns \var{NULL}.
+
+ This function does not automatically create the new data type.
+ Callback functions must first be associated with the data type via
+ functions such as \var{SLclass_set_push_function}, and the data
+ type must be registered with the interpreter via
+ \var{SLclass_register_class}. See the \slang library programmer's
+ guide for more information.
+\seealso{SLclass_register_class, SLclass_set_push_function}
+\done
+
+\function{SLclass_register_class}
+\synopsis{Register a new data type with the interpreter}
+\usage{int SLclass_register_class (cl, type, sizeof_type, class_type)}
+#v+
+ SLang_Class_Type *cl
+ SLtype type
+ unsigned int sizeof_type
+ SLclass_Type class_type
+#v-
+\description
+ The \var{SLclass_register_class} function is used to register a new
+ class or data type with the interpreter. If successful, the
+ function returns \exmp{0}, or upon failure, it returns \var{-1}.
+
+ The first parameter, \var{cl}, must have been previously obtained
+ via the \var{SLclass_allocate_class} function.
+
+ The second parameter, \var{type} specifies the data type of the new
+ class. If set to \var{SLANG_VOID_TYPE} then the library will
+ automatically allocate an unused value for the class (the allocated
+ value can then be found using the \var{SLclass_get_class_id}
+ function), otherwise a value greater than \exmp{255} should be
+ used. The values in the range \exmp{0-255} are reserved for
+ internal use by the library.
+
+ The size that the data type represents in bytes is specified by the
+ third parameter, \var{sizeof_type}. This value should not be
+ confused with the sizeof the structure that represents the data
+ type, unless the data type is of class \var{SLANG_CLASS_TYPE_VECTOR}
+ or \var{SLANG_CLASS_TYPE_SCALAR}. For pointer objects, the value
+ of this parameter is just \var{sizeof(void *)}.
+
+ The final parameter specifies the class type of the data type. It must
+ be one of the values:
+#v+
+ SLANG_CLASS_TYPE_SCALAR
+ SLANG_CLASS_TYPE_VECTOR
+ SLANG_CLASS_TYPE_PTR
+ SLANG_CLASS_TYPE_MMT
+#v-
+ The \var{SLANG_CLASS_TYPE_SCALAR} indicates that the new data type
+ is a scalar. Examples of scalars in \var{SLANG_INT_TYPE} and
+ \var{SLANG_DOUBLE_TYPE}.
+
+ Setting \var{class_type} to SLANG_CLASS_TYPE_VECTOR implies that the
+ new data type is a vector, or a 1-d array of scalar types. An
+ example of a data type of this class is the
+ \var{SLANG_COMPLEX_TYPE}, which represents complex numbers.
+
+ \var{SLANG_CLASS_TYPE_PTR} specifies the data type is of a pointer
+ type. Examples of data types of this class include
+ \var{SLANG_STRING_TYPE} and \var{SLANG_ARRAY_TYPE}. Such types must
+ provide for their own memory management.
+
+ Data types of class \var{SLANG_CLASS_TYPE_MMT} are pointer types
+ except that the memory management, i.e., creation and destruction of
+ the type, is handled by the interpreter. Such a type is called a
+ \em{memory managed type}. An example of this data type is the
+ \var{SLANG_FILEPTR_TYPE}.
+\notes
+ See the \slang-library-programmers-guide for more information.
+\seealso{SLclass_allocate_class, SLclass_get_class_id}
+\done
+
+\function{SLclass_set_string_function}
+\synopsis{Set a data type's string representation callback}
+\usage{int SLclass_set_string_function (cl, sfun)}
+#v+
+ SLang_Class_Type *cl
+ char *(*sfun) (SLtype, VOID_STAR);
+#v-
+\description
+ The \var{SLclass_set_string_function} routine is used to define a
+ callback function, \var{sfun}, that will be used when a string
+ representation of an object of the data type represented by \var{cl}
+ is needed. \var{cl} must have already been obtained via a call to
+ \var{SLclass_allocate_class}. When called, \var{sfun} will be
+ passed two arguments: an SLtype which represents the data
+ type, and the address of the object for which a string represetation
+ is required. The callback function must return a \em{malloced}
+ string.
+
+ Upon success, \var{SLclass_set_string_function} returns zero, or
+ upon error it returns \-1.
+\example
+ A callback function that handles both \var{SLANG_STRING_TYPE} and
+ \var{SLANG_INT_TYPE} variables looks like:
+#v+
+ char *string_and_int_callback (SLtype type, VOID_STAR addr)
+ {
+ char buf64;
+
+ switch (type)
+ {
+ case SLANG_STRING_TYPE:
+ return SLmake_string (*(char **)addr);
+
+ case SLANG_INTEGER_TYPE:
+ sprintf (buf, "%d", *(int *)addr);
+ return SLmake_string (buf);
+ }
+ return NULL;
+ }
+#v-
+\notes
+ The default string callback simply returns the name of the data type.
+\seealso{SLclass_allocate_class, SLclass_register_class}
+\done
+
+\function{SLclass_set_destroy_function}
+\synopsis{Set the destroy method callback for a data type}
+\usage{int SLclass_set_destroy_function (cl, destroy_fun)}
+#v+
+ SLang_Class_Type *cl
+ void (*destroy_fun) (SLtype, VOID_STAR);
+#v-
+\description
+ \var{SLclass_set_destroy_function} is used to set the destroy
+ callback for a data type. The data type's class \var{cl} must have
+ been previously obtained via a call to \var{SLclass_allocate_class}.
+ When called, \var{destroy_fun} will be passed two arguments: an
+ SLtype which represents the data type, and the address of the
+ object to be destroyed.
+
+ \var{SLclass_set_destroy_function} returns zero upon success, and
+ \-1 upon failure.
+\example
+ The destroy method for \var{SLANG_STRING_TYPE} looks like:
+#v+
+ static void string_destroy (SLtype type, VOID_STAR ptr)
+ {
+ char *s = *(char **) ptr;
+ if (s != NULL) SLang_free_slstring (*(char **) s);
+ }
+#v-
+\notes
+ Data types of class SLANG_CLASS_TYPE_SCALAR do not require a destroy
+ callback. However, other classes do.
+\seealso{SLclass_allocate_class, SLclass_register_class}
+\done
+
+\function{SLclass_set_push_function}
+\synopsis{Set the push callback for a new data type}
+\usage{int SLclass_set_push_function (cl, push_fun)}
+#v+
+ SLang_Class_Type *cl
+ int (*push_fun) (SLtype, VOID_STAR);
+#v-
+\description
+ \var{SLclass_set_push_function} is used to set the push callback
+ for a new data type specified by \var{cl}, which must have been
+ previously obtained via \var{SLclass_allocate_class}.
+
+ The parameter \var{push_fun} is a pointer to the push callback. It
+ is required to take two arguments: an SLtype
+ representing the data type, and the address of the object to be
+ pushed. It must return zero upon success, or \-1 upon failure.
+
+ \var{SLclass_set_push_function} returns zero upon success, or \-1
+ upon failure.
+\example
+ The push callback for \var{SLANG_COMPLEX_TYPE} looks like:
+#v+
+ static int complex_push (SLtype type, VOID_STAR ptr)
+ {
+ double *z = *(double **) ptr;
+ return SLang_push_complex (z0, z1);
+ }
+#v-
+\seealso{SLclass_allocate_class, SLclass_register_class}
+\done
+
+\function{SLclass_set_pop_function}
+\synopsis{Set the pop callback for a new data type}
+\usage{int SLclass_set_pop_function (cl, pop_fun)}
+#v+
+ SLang_Class_Type *cl
+ int (*pop_fun) (SLtype, VOID_STAR);
+#v-
+\description
+ \var{SLclass_set_pop_function} is used to set the callback for
+ popping an object from the stack for a new data type specified by
+ \var{cl}, which must have been previously obtained via
+ \var{SLclass_allocate_class}.
+
+ The parameter \var{pop_fun} is a pointer to the pop callback
+ function, which is required to take two arguments: an unsigned
+ character representing the data type, and the address of the object
+ to be popped. It must return zero upon success, or \-1 upon
+ failure.
+
+ \var{SLclass_set_pop_function} returns zero upon success, or \-1
+ upon failure.
+\example
+ The pop callback for \var{SLANG_COMPLEX_TYPE} looks like:
+#v+
+ static int complex_push (SLtype type, VOID_STAR ptr)
+ {
+ double *z = *(double **) ptr;
+ return SLang_pop_complex (&z0, &z1);
+ }
+#v-
+\seealso{SLclass_allocate_class, SLclass_register_class}
+\done
+
+\function{SLclass_get_datatype_name}
+\synopsis{Get the name of a data type}
+\usage{char *SLclass_get_datatype_name (SLtype type)}
+\description
+ The \var{SLclass_get_datatype_name} function returns the name of the
+ data type specified by \var{type}. For example, if \var{type} is
+ \var{SLANG_INT_TYPE}, the string \exmp{"Integer_Type"} will be
+ returned.
+
+ This function returns a pointer that should not be modified or freed.
+\seealso{SLclass_allocate_class, SLclass_register_class}
+\done
+
+\function{SLang_free_mmt}
+\synopsis{Free a memory managed type}
+\usage{void SLang_free_mmt (SLang_MMT_Type *mmt)}
+\description
+ The \var{SLang_MMT_Type} function is used to free a memory managed
+ data type.
+\seealso{SLang_object_from_mmt, SLang_create_mmt}
+\done
+
+\function{SLang_object_from_mmt}
+\synopsis{Get a pointer to the value of a memory managed type}
+\usage{VOID_STAR SLang_object_from_mmt (SLang_MMT_Type *mmt)}
+\description
+ The \var{SLang_object_from_mmt} function returns a pointer to the
+ actual object whose memory is being managed by the interpreter.
+\seealso{SLang_free_mmt, SLang_create_mmt}
+\done
+
+\function{SLang_create_mmt}
+\synopsis{Create a memory managed data type}
+\usage{SLang_MMT_Type *SLang_create_mmt (SLtype t, VOID_STAR ptr)}
+\description
+ The \var{SLang_create_mmt} function returns a pointer to a new
+ memory managed object. This object contains information necessary
+ to manage the memory associated with the pointer \var{ptr} which
+ represents the application defined data type of type \var{t}.
+\seealso{SLang_object_from_mmt, SLang_push_mmt, SLang_free_mmt}
+\done
+
+\function{SLang_push_mmt}
+\synopsis{Push a memory managed type}
+\usage{int SLang_push_mmt (SLang_MMT_Type *mmt)}
+\description
+ This function is used to push a memory managed type onto the
+ interpreter stack. It returns zero upon success, or \exmp{-1} upon
+ failure.
+\seealso{SLang_create_mmt, SLang_pop_mmt}
+\done
+
+\function{SLang_pop_mmt}
+\synopsis{Pop a memory managed data type}
+\usage{SLang_MMT_Type *SLang_pop_mmt (SLtype t)}
+\description
+ The \var{SLang_pop_mmt} function may be used to pop a memory managed
+ type of type \var{t} from the stack. It returns a pointer to the
+ memory managed object upon success, or \var{NULL} upon failure. The
+ function \var{SLang_object_from_mmt} should be used to access the
+ actual pointer to the data type.
+\seealso{SLang_object_from_mmt, SLang_push_mmt}
+\done
+
+\function{SLang_inc_mmt}
+\synopsis{Increment a memory managed type reference count}
+\usage{void SLang_inc_mmt (SLang_MMT_Type *mmt);}
+\description
+ The \var{SLang_inc_mmt} function may be used to increment the
+ reference count associated with the memory managed data type given
+ by \var{mmt}.
+\seealso{SLang_free_mmt, SLang_create_mmt, SLang_pop_mmt, SLang_pop_mmt}
+\done
+
+\function{SLadd_intrin_fun_table}
+\synopsis{Add a table of intrinsic functions to the interpreter}
+\usage{int SLadd_intrin_fun_table(SLang_Intrin_Fun_Type *tbl, char *pp_name);}
+\description
+ The \var{SLadd_intrin_fun_table} function adds an array, or table, of
+ \var{SLang_Intrin_Fun_Type} objects to the interpreter. The first
+ parameter, \var{tbl} specifies the table to be added. The second
+ parameter \var{pp_name}, if non-NULL will be added to the list of
+ preprocessor symbols.
+
+ This function returns \-1 upon failure or zero upon success.
+\notes
+ A table should only be loaded one time and it is considered to be an
+ error on the part of the application if it loads a table more than
+ once.
+\seealso{SLadd_intrin_var_table, SLadd_intrinsic_function, SLdefine_for_ifdef}
+\done
+
+\function{SLadd_intrin_var_table}
+\synopsis{Add a table of intrinsic variables to the interpreter}
+\usage{int SLadd_intrin_var_table (SLang_Intrin_Var_Type *tbl, char *pp_name);}
+\description
+ The \var{SLadd_intrin_var_table} function adds an array, or table, of
+ \var{SLang_Intrin_Var_Type} objects to the interpreter. The first
+ parameter, \var{tbl} specifies the table to be added. The second
+ parameter \var{pp_name}, if non-NULL will be added to the list of
+ preprocessor symbols.
+
+ This function returns \-1 upon failure or zero upon success.
+\notes
+ A table should only be loaded one time and it is considered to be an
+ error on the part of the application if it loads a table more than
+ once.
+\seealso{SLadd_intrin_var_table, SLadd_intrinsic_function, SLdefine_for_ifdef}
+\done
+
+\function{SLang_load_file}
+\synopsis{Load a file into the interpreter}
+\usage{int SLang_load_file (char *fn)}
+\description
+ The \var{SLang_load_file} function opens the file whose name is
+ specified by \var{fn} and feeds it to the interpreter, line by line,
+ for execution. If \var{fn} is \var{NULL}, the function will take
+ input from \var{stdin}.
+
+ If no error occurs, it returns \exmp{0}; otherwise,
+ it returns \exmp{-1}, and sets \var{SLang_Error} accordingly. For
+ example, if it fails to open the file, it will return \exmp{-1} with
+ \var{SLang_Error} set to \var{SL_OBJ_NOPEN}.
+\notes
+ If the hook \var{SLang_Load_File_Hook} declared as
+#v+
+ int (*SLang_Load_File_Hook)(char *);
+#v-
+ is non-NULL, the function point to by it will be used to load the
+ file. For example, the \jed editor uses this hook to load files
+ via its own routines.
+\seealso{SLang_load_object, SLang_load_string}
+\done
+
+\function{SLang_restart}
+\synopsis{Reset the interpreter after an error}
+\usage{void SLang_restart (int full)}
+\description
+ The \var{SLang_restart} function should be called by the
+ application at top level if an error occurs. If the parameter
+ \var{full} is non-zero, any objects on the \slang run time stack
+ will be removed from the stack; otherwise, the stack will be left
+ intact. Any time the stack is believed to be trashed, this routine
+ should be called with a non-zero argument (e.g., if
+ \var{setjmp}/\var{longjmp} is called).
+
+ Calling \var{SLang_restart} does not reset the global variable
+ \var{SLang_Error} to zero. It is up to the application to reset
+ that variable to zero after calling \var{SLang_restart}.
+\example
+#v+
+ while (1)
+ {
+ if (SLang_Error)
+ {
+ SLang_restart (1);
+ SLang_Error = 0;
+ }
+ (void) SLang_load_file (NULL);
+ }
+#v-
+\seealso{SLang_init_slang, SLang_load_file}
+\done
+
+\function{SLang_byte_compile_file}
+\synopsis{Byte-compile a file for faster loading}
+\usage{int SLang_byte_compile_file(char *fn, int reserved)}
+\description
+ The \var{SLang_byte_compile_file} function ``byte-compiles'' the
+ file \var{fn} for faster loading by the interpreter. This produces
+ a new file whose filename is equivalent to the one specified by
+ \var{fn}, except that a \var{'c'} is appended to the name. For
+ example, if \var{fn} is set to \exmp{init.sl}, then the new file
+ will have the name \exmp{init.slc}. The meaning of the second
+ parameter, \var{reserved}, is reserved for future use. For now, set
+ it to \var{0}.
+
+ The function returns zero upon success, or \exmp{-1} upon error and
+ sets SLang_Error accordingly.
+\seealso{SLang_load_file, SLang_init_slang}
+\done
+
+\function{SLang_autoload}
+\synopsis{Autoload a function from a file}
+\usage{int SLang_autoload(char *funct, char *filename)}
+\description
+ The \var{SLang_autoload} function may be used to associate a
+ \var{slang} function name \var{funct} with the file \var{filename}
+ such that if \var{funct} has not already been defined when needed,
+ it will be loaded from \var{filename}.
+
+ \var{SLang_autoload} has no effect if \var{funct} has already been
+ defined. Otherwise it declares \var{funct} as a user-defined \slang
+ function. It returns \exmp{0} upon success, or \exmp{-1} upon error.
+\seealso{SLang_load_file, SLang_is_defined}
+\done
+
+\function{SLang_load_string}
+\synopsis{Interpret a string}
+\usage{int SLang_load_string(char *str)}
+\description
+ The \var{SLang_load_string} function feeds the string specified by
+ \var{str} to the interpreter for execution. It returns zero upon
+ success, or \exmp{-1} upon failure.
+\seealso{SLang_load_file, SLang_load_object}
+\done
+
+\function{SLdo_pop}
+\synopsis{Delete an object from the stack}
+\usage{int SLdo_pop(void)}
+\description
+ This function removes an object from the top of the interpeter's
+ run-time stack and frees any memory associated with it. It returns
+ zero upon success, or \var{-1} upon error (most likely due to a
+ stack-underflow).
+\seealso{SLdo_pop_n, SLang_pop_integer, SLang_pop_string}
+\done
+
+\function{SLdo_pop_n}
+\synopsis{Delete n objects from the stack}
+\usage{int SLdo_pop_n (unsigned int n)}
+\description
+ The \var{SLdo_pop_n} function removes the top \var{n} objects from
+ the interpreter's run-time stack and frees all memory associated
+ with the objects. It returns zero upon success, or \var{-1} upon
+ error (most likely due to a stack-underflow).
+\seealso{SLdo_pop, SLang_pop_integer, SLang_pop_string}
+\done
+
+\function{SLang_pop_integer}
+\synopsis{Pop an integer off the stack}
+\usage{int SLang_pop_integer (int *i)}
+\description
+ The \var{SLang_pop_integer} function removes an integer from the
+ top of the interpreter's run-time stack and returns its value via
+ the pointer \var{i}. If successful, it returns zero. However, if
+ the top stack item is not of type \var{SLANG_INT_TYPE}, or the
+ stack is empty, the function will return \exmp{-1} and set
+ \var{SLang_Error} accordingly.
+\seealso{SLang_push_integer, SLang_pop_double}
+\done
+
+\function{SLpop_string}
+\synopsis{Pop a string from the stack}
+\usage{int SLpop_string (char **strptr);}
+\description
+ The \var{SLpop_string} function pops a string from the stack and
+ returns it as a malloced pointer. It is up to the calling routine
+ to free this string via a call to \var{free} or \var{SLfree}. If
+ successful, \var{SLpop_string} returns zero. However, if the top
+ stack item is not of type \var{SLANG_STRING_TYPE}, or the stack is
+ empty, the function will return \exmp{-1} and set
+ \var{SLang_Error} accordingly.
+\example
+#v+
+ define print_string (void)
+ {
+ char *s;
+ if (-1 == SLpop_string (&s))
+ return;
+ fputs (s, stdout);
+ SLfree (s);
+ }
+#v-
+\notes
+ This function should not be confused with \var{SLang_pop_slstring},
+ which pops a \em{hashed} string from the stack.
+\seealso{SLang_pop_slstring. SLfree}
+\done
+
+\function{SLang_pop_string}
+\synopsis{Pop a string from the stack}
+\usage{int SLang_pop_string(char **strptr, int *do_free)}
+\description
+ The \var{SLpop_string} function pops a string from the stack and
+ returns it as a malloced pointer via \var{strptr}. After the
+ function returns, the integer pointed to by the second parameter
+ will be set to a non-zero value if \var{*strptr} should be freed via
+ \var{free} or \var{SLfree}. If successful, \var{SLpop_string}
+ returns zero. However, if the top stack item is not of type
+ \var{SLANG_STRING_TYPE}, or the stack is empty, the function will
+ return \exmp{-1} and set \var{SLang_Error} accordingly.
+\notes
+ This function is considered obsolete and should not be used by
+ applications. If one requires a malloced string for modification,
+ \var{SLpop_string} should be used. If one requires a constant
+ string that will not be modifed by the application,
+ \var{SLang_pop_slstring} should be used.
+\seealso{SLang_pop_slstring, SLpop_string}
+\done
+
+\function{SLang_pop_slstring}
+\synopsis{Pop a hashed string from the stack}
+\usage{int SLang_pop_slstring (char **s_ptr)}
+\description
+ The \var{SLang_pop_slstring} function pops a hashed string from the
+ \slang run-time stack and returns it via \var{s_ptr}. It returns
+ zero if successful, or \-1 upon failure. The resulting string
+ should be freed via a call to \var{SLang_free_slstring} after use.
+\example
+#v+
+ void print_string (void)
+ {
+ char *s;
+ if (-1 == SLang_pop_slstring (&s))
+ return;
+ fprintf (stdout, "%s\n", s);
+ SLang_free_slstring (s);
+ }
+#v-
+\notes
+ \var{SLang_free_slstring} is the preferred function for popping
+ strings. This is a result of the fact that the interpreter uses
+ hashed strings as the native representation for string data.
+
+ One must \em{never} free a hashed string using \var{free} or
+ \var{SLfree}. In addition, one must never make any attempt to
+ modify a hashed string and doing so will result in memory
+ corruption.
+\seealso{SLang_free_slstring, SLpop_string}
+\done
+
+\function{SLang_pop_double}
+\synopsis{Pop a double from the stack}
+\usage{int SLang_pop_double (double *dptr)}
+\description
+ The \var{SLang_pop_double} function pops a double precision number
+ from the stack and returns it via \var{dptr}. This
+ function returns \0 upon success, otherwise it returns \-1 and sets
+ \var{SLang_Error} accordingly.
+\seealso{SLang_pop_integer, SLang_push_double}
+\done
+
+\function{SLang_pop_complex}
+\synopsis{Pop a complex number from the stack}
+\usage{int SLang_pop_complex (double *re, double *im)}
+\description
+ \var{SLang_pop_complex} pops a complex number from the stack and
+ returns it via the parameters \var{re} and \var{im} as the real and
+ imaginary parts of the complex number, respectively. This function
+ automatically converts objects of type \var{SLANG_DOUBLE_TYPE} and
+ \var{SLANG_INT_TYPE} to \var{SLANG_COMPLEX_TYPE}, if necessary.
+ It returns zero upon success, or \-1 upon error setting
+ \var{SLang_Error} accordingly.
+\seealso{SLang_pop_integer, SLang_pop_double, SLang_push_complex}
+\done
+
+\function{SLang_push_complex}
+\synopsis{Push a complex number onto the stack}
+\usage{int SLang_push_complex (double re, double im)}
+\description
+ \var{SLang_push_complex} may be used to push the complex number
+ whose real and imaginary parts are given by \var{re} and \var{im},
+ respectively. It returns zero upon success, or \-1 upon error
+ setting \var{SLang_Error} accordingly.
+\seealso{SLang_pop_complex, SLang_push_double}
+\done
+
+\function{SLang_push_double}
+\synopsis{Push a double onto the stack}
+\usage{int SLang_push_double(double d)}
+\description
+ \var{SLang_push_double} may be used to push the double precision
+ floating point number \var{d} onto the interpreter's run-time
+ stack. It returns zero upon success, or \-1 upon error setting
+ \var{SLang_Error} accordingly.
+\seealso{SLang_pop_double, SLang_push_integer}
+\done
+
+\function{SLang_push_string}
+\synopsis{Push a string onto the stack}
+\usage{int SLang_push_string (char *s)}
+\description
+ \var{SLang_push_string} pushes a copy of the string specified by
+ \var{s} onto the interpreter's run-time stack. It returns zero
+ upon success, or \-1 upon error setting \var{SLang_Error}
+ accordingly.
+\notes
+ If \var{s} is \var{NULL}, this function pushes \var{NULL}
+ (\var{SLANG_NULL_TYPE}) onto the stack.
+\seealso{SLang_push_malloced_string}
+\done
+
+\function{SLang_push_integer}
+\synopsis{Push an integer onto the stack}
+\usage{int SLang_push_integer (int i)}
+\description
+ \var{SLang_push_integer} the integer \var{i} onto the interpreter's
+ run-time stack. It returns zero upon success, or \-1 upon error
+ setting \var{SLang_Error} accordingly.
+\seealso{SLang_pop_integer, SLang_push_double, SLang_push_string}
+\done
+
+\function{SLang_push_malloced_string}
+\synopsis{Push a malloced string onto the stack}
+\usage{int SLang_push_malloced_string (char *s);}
+\description
+ \var{SLang_push_malloced_string} may be used to push a malloced
+ string onto the interpreter's run-time stack. It returns zero upon
+ success, or \-1 upon error setting \var{SLang_Error} accordingly.
+\example
+ The following example illustrates that it is up to the calling
+ routine to free the string if \var{SLang_push_malloced_string} fails:
+#v+
+ int push_hello (void)
+ {
+ char *s = malloc (6);
+ if (s == NULL) return -1;
+ strcpy (s, "hello");
+ if (-1 == SLang_push_malloced_string (s))
+ {
+ free (s);
+ return -1;
+ }
+ return 0;
+ }
+#v-
+\example
+ The function \var{SLang_create_slstring} returns a hashed string.
+ Such a string may not be malloced and should not be passed to
+ \var{SLang_push_malloced_string}.
+\notes
+ If \var{s} is \var{NULL}, this function pushes \var{NULL}
+ (\var{SLANG_NULL_TYPE}) onto the stack.
+\seealso{SLang_push_string, SLmake_string}
+\done
+
+\function{SLang_is_defined}
+\synopsis{Check to see if the interpreter defines an object}
+\usage{int SLang_is_defined (char *nm)}
+\description
+ The \var{SLang_is_defined} function may be used to determine
+ whether or not a variable or function whose name is given by
+ \var{em} has been defined. It returns zero if no such object has
+ been defined. Otherwise it returns a non-zero value according to
+ the following table:
+#v+
+ 1 intrinsic function
+ 2 user-defined slang function
+ -1 intrinsic variable
+ -2 user-defined global variable
+#v-
+ Note that variables correspond to negative numbers and functions
+ are represented by positive numbers.
+\seealso{SLadd_intrinsic_function, SLang_run_hooks, SLang_execute_function}
+\done
+
+\function{SLang_run_hooks}
+\synopsis{Run a user-defined hook with arguments}
+\usage{int SLang_run_hooks (char *fname, unsigned int n, ...)}
+\description
+ The \var{SLang_run_hooks} function may be used to execute a
+ user-defined function named \var{fname}. Before execution of the
+ function, the \var{n} string arguments specified by the variable
+ parameter list are pushed onto the stack. If the function
+ \var{fname} does not exist, \var{SLang_run_hooks} returns zero;
+ otherwise, it returns \exmp{1} upon successful execution of the
+ function, or \-1 if an error occurred.
+\example
+ The \jed editor uses \var{SLang_run_hooks} to setup the mode of a
+ buffer based on the filename extension of the file associated with
+ the buffer:
+#v+
+ char *ext = get_filename_extension (filename);
+ if (ext == NULL) return -1;
+ if (-1 == SLang_run_hooks ("mode_hook", 1, ext))
+ return -1;
+ return 0;
+#v-
+\seealso{SLang_is_defined, SLang_execute_function}
+\done
+
+\function{SLang_execute_function}
+\synopsis{Execute a user or intrinsic function}
+\usage{int SLang_execute_function (char *fname)}
+\description
+ This function may be used to execute either a user-defined function
+ or an intrinisic function. The name of the function is specified
+ by \var{fname}. It returns zero if \var{fname} is not defined, or
+ \exmp{1} if the function was successfully executed, or \-1 upon
+ error.
+\notes
+ The function \var{SLexecute_function} may be a better alternative
+ for some uses.
+\seealso{SLang_run_hooks, SLexecute_function, SLang_is_defined}
+\done
+
+\function{SLang_get_function}
+\synopsis{Get a pointer to a \slang function}
+\usage{SLang_Name_Type *SLang_get_function (char *fname)}
+\description
+ This function returns a pointer to the internal \slang table entry
+ of a function whose name is given by \var{fname}. It returns
+ \var{NULL} upon failure. The value returned by this function can be
+ used \var{SLexecute_function} to call the function directly
+ from C.
+\seealso{SLexecute_function}
+\done
+
+\function{SLexecute_function}
+\synopsis{Execute a \slang or intrinsic function}
+\usage{int SLexecute_function (SLang_Name_Type *nt)}
+\description
+ The \var{SLexecute_function} allows an application to call the
+ \slang function specified by the \var{SLang_Name_Type} pointer
+ \var{nt}. This parameter must be non \var{NULL} and must have been
+ previously obtained by a call to \var{SLang_get_function}.
+\example
+ Consider the \slang function:
+#v+
+ define my_fun (x)
+ {
+ return x^2 - 2;
+ }
+#v-
+ Suppose that it is desired to call this function many times with
+ different values of x. There are at least two ways to do this.
+ The easiest way is to use \var{SLang_execute_function} by passing
+ the string \exmp{"my_fun"}. A better way that is much faster is to
+ use \var{SLexecute_function}:
+#v+
+ int sum_a_function (char *fname, double *result)
+ {
+ double sum, x, y;
+ SLang_Name_Type *nt;
+
+ if (NULL == (nt = SLang_get_function (fname)))
+ return -1;
+
+ sum = 0;
+ for (x = 0; x < 10.0; x += 0.1)
+ {
+ SLang_start_arg_list ();
+ if (-1 == SLang_push_double (x))
+ return -1;
+ SLang_end_arg_list ();
+ if (-1 == SLexecute_function (nt))
+ return -1;
+ if (-1 == SLang_pop_double (&y))
+ return -1;
+
+ sum += y;
+ }
+ return sum;
+ }
+#v-
+ Although not necessary in this case, \var{SLang_start_arg_list} and
+ \var{SLang_end_arg_list} were used to provide the function with
+ information about the number of parameters passed to it.
+\seealso{SLang_get_function, SLang_start_arg_list, SLang_end_arg_list}
+\done
+
+\function{SLang_peek_at_stack}
+\synopsis{Find the type of object on the top of the stack}
+\usage{int SLang_peek_at_stack (void)}
+\description
+ The \var{SLang_peek_at_stack} function is useful for determining the
+ data type of the object at the top of the stack. It returns the
+ data type, or -1 upon a stack-underflow error. It does not remove
+ anything from the stack.
+\seealso{SLang_pop_string, SLang_pop_integer}
+\done
+
+\function{SLang_pop_fileptr}
+\synopsis{Pop a file pointer}
+\usage{int SLang_pop_fileptr (SLang_MMT_Type **mmt, FILE **fp)}
+\description
+ \var{SLang_pop_fileptr} pops a file pointer from the \slang
+ run-time stack. It returns zero upon success, or \-1 upon failure.
+
+ A \slang file pointer (SLANG_FILEPTR_TYPE) is actually a memory
+ managed object. For this reason, \var{SLang_pop_fileptr} also
+ returns the memory managed object via the argument list. It is up
+ to the calling routine to call \var{SLang_free_mmt} to free the
+ object.
+\example
+ The following example illustrates an application defined intrinsic
+ function that writes a user defined double precision number to a
+ file. Note the use of \var{SLang_free_mmt}:
+#v+
+ int write_double (void)
+ {
+ double t;
+ SLang_MMT_Type *mmt;
+ FILE *fp;
+ int status;
+
+ if (-1 == SLang_pop_double (&d, NULL, NULL))
+ return -1;
+ if (-1 == SLang_pop_fileptr (&mmt, &fp))
+ return -1;
+
+ status = fwrite (&d, sizeof (double), 1, fp);
+ SLang_free_mmt (mmt);
+ return status;
+ }
+#v-
+ This function can be used by a \slang function as follows:
+#v+
+ define write_some_values ()
+ {
+ variable fp, d;
+
+ fp = fopen ("myfile.dat", "wb");
+ if (fp == NULL)
+ error ("file failed to open");
+ for (d = 0; d < 10.0; d += 0.1)
+ {
+ if (-1 == write_double (fp, d))
+ error ("write failed");
+ }
+ if (-1 == fclose (fp))
+ error ("fclose failed");
+ }
+#v-
+\seealso{SLang_free_mmt, SLang_pop_double}
+\done
+
+\function{SLadd_intrinsic_function}
+\synopsis{Add a new intrinsic function to the interpreter}
+\usage{int SLadd_intrinsic_function (name, f, type, nargs, ...)}
+#v+
+ char *name
+ FVOID_STAR f
+ SLtype type
+ unsigned int nargs
+#v-
+\description
+ The \var{SLadd_intrinsic_function} function may be used to add a new
+ intrinsic function. The \slang name of the function is specified by
+ \var{name} and the actual function pointer is given by \var{f}, cast
+ to \var{FVOID_STAR}. The third parameter, \var{type} specifies the
+ return type of the function and must be one of the following values:
+#v+
+ SLANG_VOID_TYPE (returns nothing)
+ SLANG_INT_TYPE (returns int)
+ SLANG_DOUBLE_TYPE (returns double)
+ SLANG_STRING_TYPE (returns char *)
+#v-
+ The \var{nargs} parameter specifies the number of parameters to pass
+ to the function. The variable argument list following \var{nargs}
+ must consists of \var{nargs} integers which specify the data type of
+ each argument.
+
+ The function returns zero upon success or \-1 upon failure.
+\example
+ The \jed editor uses this function to change the \var{system}
+ intrinsic function to the following:
+#v+
+ static int jed_system (char *cmd)
+ {
+ if (Jed_Secure_Mode)
+ {
+ msg_error ("Access denied.");
+ return -1;
+ }
+ return SLsystem (cmd);
+ }
+#v-
+ After initializing the interpreter with \var{SLang_init_slang},
+ \jed calls \var{SLadd_intrinsic_function} to substitute the above
+ definition for the default \slang definition:
+#v+
+ if (-1 == SLadd_intrinsic_function ("system", (FVOID_STAR)jed_system,
+ SLANG_INT_TYPE, 1,
+ SLANG_STRING_TYPE))
+ return -1;
+#v-
+\seealso{SLadd_intrinsic_variable, SLadd_intrinsic_array}
+\done
+
+\function{SLadd_intrinsic_variable}
+\synopsis{Add an intrinsic variable to the interpreter}
+\usage{int SLadd_intrinsic_variable (name, addr, type, rdonly)}
+#v+
+ char *name
+ VOID_STAR addr
+ SLtype type
+ int rdonly
+#v-
+\description
+ The \var{SLadd_intrinsic_variable} function adds an intrinsic
+ variable called \var{name} to the interpeter. The second parameter
+ \var{addr} specifies the address of the variable (cast to
+ \var{VOID_STAR}). The third parameter, \var{type}, specifies the
+ data type of the variable. If the fourth parameter, \var{rdonly},
+ is non-zero, the variable will interpreted by the interpreter as
+ read-only.
+
+ If successful, \var{SLadd_intrinsic_variable} returns zero,
+ otherwise it returns \-1.
+\example
+ Suppose that \var{My_Global_Int} is a global variable (at least not
+ a local one):
+#v+
+ int My_Global_Int;
+#v-
+ It can be added to the interpreter via the function call
+#v+
+ if (-1 == SLadd_intrinsic_variable ("MyGlobalInt",
+ (VOID_STAR)&My_Global_Int,
+ SLANG_INT_TYPE, 0))
+ exit (1);
+#v-
+\notes
+ The current implementation requires all pointer type intrinsic
+ variables to be read-only. For example,
+#v+
+ char *My_Global_String;
+#v-
+ is of type \var{SLANG_STRING_TYPE}, and must be declared as
+ read-only. Finally, not that
+#v+
+ char My_Global_Char_Buf256;
+#v-
+ is \em{not} a \var{SLANG_STRING_TYPE} object. This difference is
+ very important because internally the interpreter dereferences the
+ address passed to it to get to the value of the variable.
+\seealso{SLadd_intrinsic_function, SLadd_intrinsic_array}
+\done
+
+\function{SLclass_add_unary_op}
+\synopsis{??}
+\usage{int SLclass_add_unary_op (SLtype,int (*) (int, SLtype, VOID_STAR, unsigned int, VOID_STAR), int (*) (int, SLtype, SLtype *));}
+\description
+??
+\seealso{??}
+\done
+
+\function{SLclass_add_app_unary_op}
+\synopsis{??}
+\usage{int SLclass_add_app_unary_op (SLtype, int (*) (int,SLtype, VOID_STAR, unsigned int,VOID_STAR),int (*) (int, SLtype, SLtype *));}
+\description
+??
+\seealso{??}
+\done
+
+\function{SLclass_add_binary_op}
+\synopsis{??}
+\usage{int SLclass_add_binary_op (SLtype, SLtype,int (*)(int, SLtype, VOID_STAR, unsigned int,SLtype, VOID_STAR, unsigned int,VOID_STAR),int (*) (int, SLtype, SLtype, SLtype *));}
+\description
+??
+\seealso{??}
+\done
+
+\function{SLclass_add_math_op}
+\synopsis{??}
+\usage{int SLclass_add_math_op (SLtype,int (*)(int,SLtype, VOID_STAR, unsigned int,VOID_STAR),int (*)(int, SLtype, SLtype *));}
+\description
+??
+\seealso{??}
+\done
+
+\function{SLclass_add_typecast}
+\synopsis{??}
+\usage{int SLclass_add_typecast (SLtype, SLtype int (*)_PROTO((SLtype, VOID_STAR, unsigned int,SLtype, VOID_STAR)),int);}
+\description
+??
+\seealso{??}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/crtl/slkeymap.tm Added

@@ -0,0 +1,192 @@
+\function{SLkm_define_key}
+\synopsis{Define a key in a keymap}
+\usage{int SLkm_define_key (char *seq, FVOID_STAR f, SLKeyMap_List_Type *km)}
+\description
+  \var{SLkm_define_key} associates the key sequence \var{seq} with the
+  function pointer \var{f} in the keymap specified by \var{km}.  Upon
+  success, it returns zero, otherwise it returns a negative integer
+  upon error.
+\seealso{SLkm_define_keysym, SLang_define_key}
+\done
+
+\function{SLang_define_key}
+\synopsis{Define a key in a keymap}
+\usage{int SLang_define_key(char *seq, char *fun, SLKeyMap_List_Type *km)}
+\description
+  \var{SLang_define_key} associates the key sequence \var{seq} with
+  the function whose name is \var{fun} in the keymap specified by
+  \var{km}.
+\seealso{SLkm_define_keysym, SLkm_define_key}
+\done
+
+\function{SLkm_define_keysym}
+\synopsis{Define a keysym in a keymap}
+\usage{int SLkm_define_keysym (seq, ks, km)}
+#v+
+      char *seq;
+      unsigned int ks;
+      SLKeyMap_List_Type *km;
+#v-
+\description
+  \var{SLkm_define_keysym} associates the key sequence \var{seq} with
+  the keysym \var{ks} in the keymap \var{km}.  Keysyms whose value is
+  less than or equal to \exmp{0x1000} is reserved by the library and
+  should not be used.
+\seealso{SLkm_define_key, SLang_define_key}
+\done
+
+\function{SLang_undefine_key}
+\synopsis{Undefined a key from a keymap}
+\usage{void SLang_undefine_key(char *seq, SLKeyMap_List_Type *km);}
+\description
+  \var{SLang_undefine_key} removes the key sequence \var{seq} from the
+  keymap \var{km}.
+\seealso{SLang_define_key}
+\done
+
+\function{SLang_create_keymap}
+\synopsis{Create a new keymap}
+\usage{SLKeyMap_List_Type *SLang_create_keymap (name, km)}
+#v+
+     char *name;
+     SLKeyMap_List_Type *km;
+#v-
+\description
+  \var{SLang_create_keymap} creates a new keymap called \var{name} by
+  copying the key definitions from the keymap \var{km}.  If \var{km}
+  is \var{NULL}, the newly created keymap will be empty and it is up
+  to the calling routine to initialize it via the
+  \var{SLang_define_key} and \var{SLkm_define_keysym} functions.
+  \var{SLang_create_keymap} returns a pointer to the new keymap, or
+  \var{NULL} upon failure.
+\seealso{SLang_define_key, SLkm_define_keysym}
+\done
+
+\function{SLang_do_key}
+\synopsis{Read a keysequence and return its keymap entry}
+\usage{SLang_Key_Type *SLang_do_key (kml, getkey)}
+#v+
+     SLKeyMap_List_Type *kml;
+     int (*getkey)(void);
+#v-
+\description
+  The \var{SLang_do_key} function reads characters using the function
+  specified by the \var{getkey} function pointer and uses the
+  key sequence to return the appropriate entry in the keymap specified
+  by \var{kml}.
+
+  \var{SLang_do_key} returns \var{NULL} if the key sequence is not
+  defined by the keymap, otherwise it returns a pointer to an object
+  of type \var{SLang_Key_Type}, which is defined in \exmp{slang.h} as
+#v+
+     #define SLANG_MAX_KEYMAP_KEY_SEQ 14
+     typedef struct SLang_Key_Type
+     {
+       struct SLang_Key_Type *next;
+       union
+       {
+          char *s;
+	  FVOID_STAR f;
+	  unsigned int keysym;
+       }
+       f;
+       unsigned char type;	       /* type of function */
+     #define SLKEY_F_INTERPRET  0x01
+     #define SLKEY_F_INTRINSIC  0x02
+     #define SLKEY_F_KEYSYM     0x03
+       unsigned char strSLANG_MAX_KEYMAP_KEY_SEQ + 1;/* key sequence */
+     }
+SLang_Key_Type;
+
+#v-
+  The \var{type} field specifies which field of the union \var{f}
+  should be used.  If \var{type} is \var{SLKEY_F_INTERPRET}, then
+  \var{f.s} is a string that should be passed to the interpreter for
+  evaluation.  If \var{type} is \var{SLKEY_F_INTRINSIC}, then
+  \var{f.f} refers to function that should be called.  Otherwise,
+  \var{type} is \var{SLKEY_F_KEYSYM} and \var{f.keysym} represents the
+  value of the keysym that is associated with the key sequence.
+\seealso{SLkm_define_keysym, SLkm_define_key}
+\done
+
+\function{SLang_find_key_function}
+\synopsis{Obtain a function pointer associated with a keymap}
+\usage{FVOID_STAR SLang_find_key_function (fname, km);}
+#v+
+    char *fname;
+    SLKeyMap_List_Type *km;
+#v-
+\description
+  The \var{SLang_find_key_function} routine searches through the
+  \var{SLKeymap_Function_Type} list of functions associated with the
+  keymap \var{km} for the function with name \var{fname}.
+  If a matching function is found, a pointer to the function will
+  be returned, otherwise \var{SLang_find_key_function} will return
+  \var{NULL}.
+\seealso{SLang_create_keymap, SLang_find_keymap}
+\done
+
+\function{SLang_find_keymap}
+\synopsis{Find a keymap}
+\usage{SLKeyMap_List_Type *SLang_find_keymap (char *keymap_name);}
+\description
+  The \var{SLang_find_keymap} function searches through the list of
+  keymaps looking for one whose name is \var{keymap_name}.  If a
+  matching keymap is found, the function returns a pointer to the
+  keymap.  It returns \var{NULL} if no such keymap exists.
+\seealso{SLang_create_keymap, SLang_find_key_function}
+\done
+
+\function{SLang_process_keystring}
+\synopsis{Un-escape a key-sequence}
+\usage{char *SLang_process_keystring (char *kseq);}
+\description
+  The \var{SLang_process_keystring} function converts an escaped key
+  sequence to its raw form by converting two-character combinations
+  such as \var{^A} to the \em{single} character \exmp{Ctrl-A} (ASCII
+  1).  In addition, if the key sequence contains constructs such as
+  \exmp{^(XX)}, where \exmp{XX} represents a two-character termcap
+  specifier, the termcap escape sequence will be looked up and
+  substituted.
+
+  Upon success, \var{SLang_process_keystring} returns a raw
+  key-sequence whose first character represents the total length of
+  the key-sequence, including the length specifier itself.  It returns
+  \var{NULL} upon failure.
+\example
+  Consider the following examples:
+#v+
+     SLang_process_keystring ("^X^C");
+     SLang_process_keystring ("^A");
+#v-
+  The first example will return a pointer to a buffer of three characters
+  whose ASCII values are given by \exmp{\{3,24,3\}}.  Similarly, the
+  second example will return a pointer to the four characters
+  \exmp{\{4,27,91,65\}}.  Finally, the result of
+#v+
+     SLang_process_keystring ("^^(ku)");
+#v-
+  will depend upon the termcap/terminfo capability \exmp{"ku"}, which
+  represents the escape sequence associated with the terminal's UP
+  arrow key.  For an ANSI terminal whose UP arrow produces
+  \exmp{"ESC  A"}, the result will be \exmp{5,27,27,91,65}.
+\notes
+  \var{SLang_process_keystring} returns a pointer to a static area
+  that will be overwritten on subsequent calls.
+\seealso{SLang_define_key, SLang_make_keystring}
+\done
+
+\function{SLang_make_keystring}
+\synopsis{Make a printable key sequence}
+\usage{char *SLang_make_keystring (unsigned char *ks);}
+\description
+  The \var{SLang_make_keystring} function takes a raw key sequence
+  \var{ks} and converts it to a printable form by converting
+  characters such as ASCII 1 (ctrl-A) to \exmp{^A}.  That is, it
+  performs the opposite function of \var{SLang_process_keystring}.
+\notes
+  This function returns a pointer to a static area that will be
+  overwritten on the next call to \var{SLang_make_keystring}.
+\seealso{SLang_process_keystring}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/crtl/slmisc.tm Added

@@ -0,0 +1,78 @@
+\function{SLcurrent_time_string}
+\synopsis{Get the current time as a string}
+\usage{char *SLcurrent_time_string (void)}
+\description
+  The \var{SLcurrent_time_string} function uses the C library function
+  \var{ctime} to obtain a string representation of the
+  current date and time in the form
+#v+
+     "Wed Dec 10 12:50:28 1997"
+#v-
+  However, unlike the \var{ctime} function, a newline character is not
+  present in the string.
+
+  The returned value points to a statically allocated memory block
+  which may get overwritten on subsequent function calls.
+\seealso{SLmake_string}
+\done
+
+\function{SLatoi}
+\synopsis{Convert a text string to an integer}
+\usage{int SLatoi(unsigned char *str}
+\description
+  \var{SLatoi} parses the string \var{str} to interpret it as an
+  integer value.  Unlike \var{atoi}, \var{SLatoi} can also parse
+  strings containing integers expressed in
+  hexidecimal (e.g., \exmp{"0x7F"}) and octal (e.g., \exmp{"012"}.)
+  notation.
+\seealso{SLang_guess_type}
+\done
+
+\function{SLextract_list_element}
+\synopsis{Extract a substring of a delimited string}
+\usage{int SLextract_list_element (dlist, nth, delim, buf, buflen)}
+#v+
+    char *dlist;
+    unsigned int nth;
+    char delim;
+    char *buf;
+    unsigned int buflen;
+#v-
+\description
+  \var{SLextract_list_element} may be used to obtain the \var{nth}
+  element of a list of strings, \var{dlist}, that are delimited by the
+  character \var{delim}.  The routine copies the \var{nth} element of
+  \var{dlist} to the buffer \var{buf} whose size is \var{buflen}
+  characters.  It returns zero upon success, or \-1 if \var{dlist}
+  does not contain an \var{nth} element.
+\example
+  A delimited list of strings may be turned into an array of strings
+  as follows.  For conciseness, all malloc error checking has been
+  omitted.
+#v+
+    int list_to_array (char *list, char delim, char ***ap)
+    {
+       unsigned int nth;
+       char **a;
+       char buf1024;
+
+       /* Determine the size of the array */
+       nth = 0;
+       while (0 == SLextract_list_element (list, nth, delim, buf, sizeof(buf)))
+         nth++;
+
+       ap = (char **) SLmalloc ((nth + 1) * sizeof (char **));
+       nth = 0;
+       while (0 == SLextract_list_element (list, nth, delim, buf, sizeof(buf)))
+         {
+	     anth = SLmake_string (buf);
+	     nth++;
+	 }
+       anth = NULL;
+       *ap = a;
+       return 0;
+    }
+#v-
+\seealso{SLmalloc, SLmake_string}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/crtl/slsearch.tm Added

@@ -0,0 +1,101 @@
+\function{SLsearch_new}
+\synopsis{Create an SLsearch_Type object}
+\usage{SLsearch_Type *SLsearch_new (SLuchar_Type *key, int search_flags)}
+\description
+ The \cfun{SLsearch_new} function instantiates  an \ctype{SLsearch_Type}
+ object for use in ordinary searches (non-regular expression) by the
+ functions in the SLsearch interface.  The first argument \exmp{key}
+ is a pointer to a null terminated string that specifies the character
+ string to be searched.  This character string may not contain any
+ embedded null characters.
+
+ The second argument \exmp{search_flags} is used to specify how the
+ search is to be performed.  It is a bit-mapped integer whose value is
+ constructed by the bitwise-or of zero or more of the following:
+#v+
+   SLSEARCH_CASELESS
+     The search shall be performed in a case-insensitive manner.
+
+   SLSEARCH_UTF8
+     Both the search string and the text to be searched is UTF-8
+     encoded.
+#v-
+
+ Upon sucess, the function returns the newly created object, and \NULL
+ otherwise.  When the search object is nolonger needed, it should be
+ freed via the \cfun{SLsearch_delete} function.
+\seealso{SLsearch_delete, SLsearch_forward, SLsearch_backward}
+\done
+
+\function{SLsearch_delete}
+\synopsis{Free the memory associated with a SLsearch_Type object}
+\usage{SLsearch_delete (SLsearch_Type *)}
+\description
+  This function should be called to free the memory associated with a
+  \ctype{SLsearch_Type} object created by the \cfun{SLsearch_new}
+  function.  Failure to do so will result in a memory leak.
+\seealso{SLsearch_new, SLsearch_forward, SLsearch_backward}
+\done
+
+\function{SLsearch_forward}
+\synopsis{Search forward in a buffer}
+\usage{SLuchar_Type SLsearch_forward (st, pmin, pmax)}
+#v+
+   SLsearch_Type *st;
+   SLuchar_Type *pmin, *pmax;
+#v-
+\description
+  The \cfun{SLsearch_forward} function searches forward in the buffer
+  defined by the pointers \exmp{pmin} and \exmp{pmax}.  The
+  starting point for the search is at the beginning of the buffer at
+  \exmp{pmin}.  At no point will the bytes at \exmp{pmax} and beyond
+  be examined.  The first parameter \exmp{st}, obtained by a prior call to
+  \exmp{SLsearch_new}, specifies the object to found.
+  be found from a previous call to \exmp{SLsearch_new}.
+
+  If the object was found, the pointer to the beginning of it will be
+  returned.  Otherwise, \cfun{SLsearch_forward} will return \NULL.
+  The length of the object may be obtained via the
+  \cfun{SLsearch_match_len} function.
+\notes
+  This function uses the Boyer-Moore search algorithm when possible.
+\seealso{SLsearch_new, SLsearch_backward, SLsearch_delete, SLsearch_match_len}
+\done
+
+\function{SLsearch_backward}
+\synopsis{Search backward in a buffer}
+\usage{SLuchar_Type SLsearch_forward (st, pmin, pstart, pmax)}
+#v+
+   SLsearch_Type *st;
+   SLuchar_Type *pmin, *pstart, *pmax;
+#v-
+\description
+  The \cfun{SLsearch_forward} function searches backward in the buffer
+  defined by the pointers \exmp{pmin} and \exmp{pmax}.  The starting
+  point for the search is at the position \exmp{pstart}. At no point
+  will the bytes at \exmp{pmax} and beyond be examined.  The first
+  parameter \exmp{st}, obtained by a prior call to
+  \exmp{SLsearch_new}, specifies the object to found.
+
+  If the object was found, the pointer to the beginning of it will be
+  returned.  Otherwise, \cfun{SLsearch_forward} will return \NULL.
+  The length of the object may be obtained via the
+  \cfun{SLsearch_match_len} function.
+\notes
+  This function uses the Boyer-Moore search algorithm when possible.
+
+  It is possible for the end of match to appear after the point where
+  the search began (\exmp{pstart}).
+\seealso{SLsearch_new, SLsearch_forward, SLsearch_delete, SLsearch_match_len}
+\done
+
+\function{SLsearch_match_len}
+\synopsis{Get the length of the previous match}
+\usage{unsigned int SLsearch_match_len (SLsearch_Type *st)}
+\description
+  The \cfun{SLsearch_match_len} function returns the length of the
+  match from the most recent search involving the specified
+  \ctype{SLsearch_Type} object.  If the most recent search was
+  unsuccessful, the function will return 0.
+\seealso{SLsearch_forward, SLsearch_backward, SLsearch_new, SLsearch_delete}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/crtl/slsmg.tm Added

@@ -0,0 +1,487 @@
+\function{SLsmg_fill_region}
+\synopsis{Fill a rectangular region with a character}
+\usage{void SLsmg_fill_region (r, c, nr, nc, ch)}
+#v+
+    int r
+    int c
+    unsigned int nr
+    unsigned int nc
+    unsigned char ch
+#v-
+\description
+  The \var{SLsmg_fill_region} function may be used to a
+  rectangular region with the character \var{ch} in the current color.
+  The rectangle's upper left corner is at row \var{r} and column
+  \var{c}, and spans \var{nr} rows and \var{nc} columns.  The position
+  of the virtual cursor will be left at (\var{r}, \var{c}).
+\seealso{SLsmg_write_char, SLsmg_set_color}
+\done
+
+\function{SLsmg_set_char_set}
+\synopsis{Turn on or off line drawing characters}
+\usage{void SLsmg_set_char_set (int a);}
+\description
+  \var{SLsmg_set_char_set} may be used to select or deselect the line drawing
+  character set as the current character set.  If \var{a} is non-zero,
+  the line drawing character set will be selected.  Otherwise, the
+  standard character set will be selected.
+\notes
+  There is no guarantee that this function will actually enable the
+  use of line drawing characters.  All it does is cause subsequent
+  characters to be rendered using the terminal's alternate character
+  set.  Such character sets usually contain line drawing characters.
+\seealso{SLsmg_write_char, SLtt_get_terminfo}
+\done
+
+\variable{int SLsmg_Scroll_Hash_Border;}
+\synopsis{Set the size of the border for the scroll hash}
+\usage{int SLsmg_Scroll_Hash_Border = 0;}
+\description
+  This variable may be used to ignore the characters that occur at the
+  beginning and the end of a row when performing the hash calculation
+  to determine whether or not a line has scrolled.  The default value
+  is zero which means that all the characters on a line will be used.
+\seealso{SLsmg_refresh}
+\done
+
+\function{SLsmg_suspend_smg}
+\synopsis{Suspend screen management}
+\usage{int SLsmg_suspend_smg (void)}
+\description
+  \var{SLsmg_suspend_smg} can be used to suspend the state of the
+  screen management facility during suspension of the program.  Use of
+  this function will reset the display back to its default state.  The
+  funtion \var{SLsmg_resume_smg} should be called after suspension.
+
+  It returns zero upon success, or \-1 upon error.
+
+  This function is similar to \var{SLsmg_reset_smg} except that the
+  state of the display prior to calling \var{SLsmg_suspend_smg} is saved.
+\seealso{SLsmg_resume_smg, SLsmg_reset_smg}
+\done
+
+\function{SLsmg_resume_smg}
+\synopsis{Resume screen management}
+\usage{int SLsmg_resume_smg (void)}
+\description
+  \var{SLsmg_resume_smg} should be called after
+  \var{SLsmg_suspend_smg} to redraw the display exactly like it was
+  before \var{SLsmg_suspend_smg} was called.  It returns zero upon
+  success, or \-1 upon error.
+\seealso{SLsmg_suspend_smg}
+\done
+
+\function{SLsmg_erase_eol}
+\synopsis{Erase to the end of the row}
+\usage{void SLsmg_erase_eol (void);}
+\description
+  \var{SLsmg_erase_eol} erases all characters from the current
+  position to the end of the line.  The newly created space is given
+  the color of the current color.  This function has no effect on the
+  position of the virtual cursor.
+\seealso{SLsmg_gotorc, SLsmg_erase_eos, SLsmg_fill_region}
+\done
+
+\function{SLsmg_gotorc}
+\synopsis{Move the virtual cursor}
+\usage{void SLsmg_gotorc (int r, int c)}
+\description
+  The \var{SLsmg_gotorc} function moves the virtual cursor to the row
+  \var{r} and column \var{c}.  The first row and first column is
+  specified by \exmp{r = 0} and \exmp{c = 0}.
+\seealso{SLsmg_refresh}
+\done
+
+\function{SLsmg_erase_eos}
+\synopsis{Erase to the end of the screen}
+\usage{void SLsmg_erase_eos (void);}
+\description
+  The \var{SLsmg_erase_eos} is like \var{SLsmg_erase_eol} except that
+  it erases all text from the current position to the end of the
+  display.  The current color will be used to set the background of
+  the erased area.
+\seealso{SLsmg_erase_eol}
+\done
+
+\function{SLsmg_reverse_video}
+\synopsis{Set the current color to 1}
+\usage{void SLsmg_reverse_video (void);}
+\description
+  This function is nothing more than \exmp{SLsmg_set_color(1)}.
+\seealso{SLsmg_set_color}
+\done
+
+\function{SLsmg_set_color (int)}
+\synopsis{Set the current color}
+\usage{void SLsmg_set_color (int c);}
+\description
+  \var{SLsmg_set_color} is used to set the current color.  The
+  parameter \var{c} is really a color object descriptor.  Actual
+  foreground and background colors as well as other visual attributes
+  may be associated with a color descriptor via the
+  \var{SLtt_set_color} function.
+\example
+  This example defines color \exmp{7} to be green foreground on black
+  background and then displays some text in this color:
+#v+
+      SLtt_set_color (7, NULL, "green", "black");
+      SLsmg_set_color (7);
+      SLsmg_write_string ("Hello");
+      SLsmg_refresh ();
+#v-
+\notes
+  It is important to understand that the screen managment routines
+  know nothing about the actual colors associated with a color
+  descriptor.  Only the descriptor itself is used by the \var{SLsmg}
+  routines.  The lower level \var{SLtt} interface converts the color
+  descriptors to actual colors.  Thus
+#v+
+      SLtt_set_color (7, NULL, "green", "black");
+      SLsmg_set_color (7);
+      SLsmg_write_string ("Hello");
+      SLtt_set_color (7, NULL, "red", "blue");
+      SLsmg_write_string ("World");
+      SLsmg_refresh ();
+#v-
+  will result in \exmp{"hello"} displayed in red on blue and \em{not}
+  green on black.
+\seealso{SLtt_set_color, SLtt_set_color_object}
+\done
+
+\function{SLsmg_normal_video}
+\synopsis{Set the current color to 0}
+\usage{void SLsmg_normal_video (void);}
+\description
+  \var{SLsmg_normal_video} sets the current color descriptor to \var{0}.
+\seealso{SLsmg_set_color}
+\done
+
+\function{SLsmg_printf}
+\synopsis{Format a string on the virtual display}
+\usage{void SLsmg_printf (char *fmt, ...)}
+\description
+  \var{SLsmg_printf} format a \var{printf} style variable argument
+  list and writes it on the virtual display.  The virtual cursor will
+  be moved to the end of the string.
+\seealso{SLsmg_write_string, SLsmg_vprintf}
+\done
+
+\function{SLsmg_vprintf}
+\synopsis{Format a string on the virtual display}
+\usage{void SLsmg_vprintf (char *fmt, va_list ap)}
+\description
+  \var{SLsmg_vprintf} formats a string in the manner of \em{vprintf}
+  and writes the result to the display.  The virtual cursor is
+  advanced to the end of the string.
+\seealso{SLsmg_write_string, SLsmg_printf}
+\done
+
+\function{SLsmg_write_string}
+\synopsis{Write a character string on the display }
+\usage{void SLsmg_write_string (char *s)}
+\description
+  The function \var{SLsmg_write_string} displays the string \var{s} on
+  the virtual display at the current position and moves the position
+  to the end of the string.
+\seealso{SLsmg_printf, SLsmg_write_nstring}
+\done
+
+\function{SLsmg_write_nstring}
+\synopsis{Write the first n characters of a string on the display}
+\usage{void SLsmg_write_nstring (char *s, unsigned int n);}
+\description
+  \var{SLsmg_write_nstring} writes the first \var{n} characters of
+  \var{s} to this virtual display.  If the length of the string
+  \var{s} is less than \var{n}, the spaces will used until
+  \var{n} characters have been written.  \var{s} can be \var{NULL}, in
+  which case \var{n} spaces will be written.
+\seealso{SLsmg_write_string, SLsmg_write_nchars}
+\done
+
+\function{SLsmg_write_char}
+\synopsis{Write a character to the virtual display}
+\usage{void SLsmg_write_char (char ch);}
+\description
+  \var{SLsmg_write_char} writes the character \var{ch} to the virtual
+  display.
+\seealso{SLsmg_write_nchars, SLsmg_write_string}
+\done
+
+\function{SLsmg_write_nchars}
+\synopsis{Write n characters to the virtual display}
+\usage{void SLsmg_write_nchars (char *s, unsigned int n);}
+\description
+  \var{SLsmg_write_nchars} writes at most \var{n} characters from the
+  string \var{s} to the display.  If the length of \var{s} is less
+  than \var{n}, the whole length of the string will get written.
+
+  This function differs from \var{SLsmg_write_nstring} in that
+  \var{SLsmg_write_nstring} will pad the string to write exactly
+  \var{n} characters.  \var{SLsmg_write_nchars} does not perform any
+  padding.
+\seealso{SLsmg_write_nchars, SLsmg_write_nstring}
+\done
+
+\function{SLsmg_write_wrapped_string}
+\synopsis{Write a string to the display with wrapping}
+\usage{void SLsmg_write_wrapped_string (s, r, c, nr, nc, fill)}
+#v+
+    char *s
+    int r, c
+    unsigned int nr, nc
+    int fill
+#v-
+\description
+  \var{SLsmg_write_wrapped_string} writes the string \var{s} to the
+  virtual display.  The string will be confined to the rectangular
+  region whose upper right corner is at row \var{r} and column \var{c},
+  and consists of \var{nr} rows and \var{nc} columns.  The string will
+  be wrapped at the boundaries of the box.  If \var{fill} is non-zero,
+  the last line to which characters have been written will get padded
+  with spaces.
+\notes
+  This function does not wrap on word boundaries.  However, it will
+  wrap when a newline charater is encountered.
+\seealso{SLsmg_write_string}
+\done
+
+\function{SLsmg_cls}
+\synopsis{Clear the virtual display}
+\usage{void SLsmg_cls (void)}
+\description
+  \var{SLsmg_cls} erases the virtual display using the current color.
+  This will cause the physical display to get cleared the next time
+  \var{SLsmg_refresh} is called.
+\notes
+  This function is not the same as
+#v+
+     SLsmg_gotorc (0,0); SLsmg_erase_eos ();
+#v-
+  since these statements do not guarantee that the physical screen
+  will get cleared.
+\seealso{SLsmg_refresh, SLsmg_erase_eos}
+\done
+
+\function{SLsmg_refresh}
+\synopsis{Update physical screen}
+\usage{void SLsmg_refresh (void)}
+\description
+  The \var{SLsmg_refresh} function updates the physical display to
+  look like the virtual display.
+\seealso{SLsmg_suspend_smg, SLsmg_init_smg, SLsmg_reset_smg}
+\done
+
+\function{SLsmg_touch_lines}
+\synopsis{Mark lines on the virtual display for redisplay}
+\usage{void SLsmg_touch_lines (int r, unsigned int nr)}
+\description
+  \var{SLsmg_touch_lines} marks the \var{nr} lines on the virtual
+  display starting at row \var{r} for redisplay upon the next call to
+  \var{SLsmg_refresh}.
+\notes
+  This function should rarely be called, if ever.  If you find that
+  you need to call this function, then your application should be
+  modified to properly use the \var{SLsmg} screen management routines.
+  This function is provided only for curses compatibility.
+\seealso{SLsmg_refresh}
+\done
+
+\function{SLsmg_init_smg}
+\synopsis{Initialize the \var{SLsmg} routines}
+\usage{int SLsmg_init_smg (void)}
+\description
+  The \var{SLsmg_init_smg} function initializes the \var{SLsmg} screen
+  management routines.   Specifically, this function allocates space
+  for the virtual display and calls \var{SLtt_init_video} to put the
+  terminal's physical display in the proper state.  It is up to the
+  caller to make sure that the \var{SLtt} routines are initialized via
+  \var{SLtt_get_terminfo} before calling \var{SLsmg_init_smg}.
+
+  This function should also be called any time the size of the
+  physical display has changed so that it can reallocate a new virtual
+  display to match the physical display.
+
+  It returns zero upon success, or \-1 upon failure.
+\seealso{SLsmg_reset_smg}
+\done
+
+\function{SLsmg_reset_smg}
+\synopsis{Reset the \var{SLsmg} routines}
+\usage{int SLsmg_reset_smg (void);}
+\description
+  \var{SLsmg_reset_smg} resets the \var{SLsmg} screen management
+  routines by freeing all memory allocated while it was active.  It
+  also calls \var{SLtt_reset_video} to put the terminal's display in
+  it default state.
+\seealso{SLsmg_init_smg}
+\done
+
+\function{SLsmg_char_at}
+\synopsis{Get the character at the current position on the virtual display}
+\usage{unsigned short SLsmg_char_at(void)}
+\description
+  The \var{SLsmg_char_at} function returns the character and its color
+  at the current position on the virtual display.
+\seealso{SLsmg_read_raw, SLsmg_write_char}
+\done
+
+\function{SLsmg_set_screen_start}
+\synopsis{Set the origin of the virtual display}
+\usage{void SLsmg_set_screen_start (int *r, int *c)}
+\description
+  \var{SLsmg_set_screen_start} sets the origin of the virtual display
+  to the row \var{*r} and the column \var{*c}.  If either \var{r} or \var{c}
+  is \var{NULL}, then the corresponding value will be set to \var{0}.
+  Otherwise, the location specified by the pointers will be updated to
+  reflect the old origin.
+
+  See \tt{slang/demo/pager.c} for how this function may be used to
+  scroll horizontally.
+\seealso{SLsmg_init_smg}
+\done
+
+\function{SLsmg_draw_hline}
+\synopsis{Draw a horizontal line}
+\usage{void SLsmg_draw_hline (unsigned int len)}
+\description
+  The \var{SLsmg_draw_hline} function draws a horizontal line of
+  length \var{len} on the virtual display.  The position of the
+  virtual cursor is left at the end of the line.
+\seealso{SLsmg_draw_vline}
+\done
+
+\function{SLsmg_draw_vline}
+\synopsis{Draw a vertical line}
+\usage{void SLsmg_draw_vline (unsigned int len);}
+\description
+  The \var{SLsmg_draw_vline} function draws a vertical line of
+  length \var{len} on the virtual display.  The position of the
+  virtual cursor is left at the end of the line.
+\seealso{??}
+\done
+
+\function{SLsmg_draw_object}
+\synopsis{Draw an object from the alternate character set}
+\usage{void SLsmg_draw_object (int r, int c, unsigned char obj)}
+\description
+  The \var{SLsmg_draw_object} function may be used to place the object
+  specified by \var{obj} at row \var{r} and column \var{c}.  The
+  object is really a character from the alternate character set and
+  may be specified using one of the following constants:
+#v+
+    SLSMG_HLINE_CHAR         Horizontal line
+    SLSMG_VLINE_CHAR         Vertical line
+    SLSMG_ULCORN_CHAR        Upper left corner
+    SLSMG_URCORN_CHAR        Upper right corner
+    SLSMG_LLCORN_CHAR        Lower left corner
+    SLSMG_LRCORN_CHAR        Lower right corner
+    SLSMG_CKBRD_CHAR         Checkboard character
+    SLSMG_RTEE_CHAR          Right Tee
+    SLSMG_LTEE_CHAR          Left Tee
+    SLSMG_UTEE_CHAR          Up Tee
+    SLSMG_DTEE_CHAR          Down Tee
+    SLSMG_PLUS_CHAR          Plus or Cross character
+#v-
+\seealso{SLsmg_draw_vline, SLsmg_draw_hline, SLsmg_draw_box}
+\done
+
+\function{SLsmg_draw_box}
+\synopsis{Draw a box on the virtual display}
+\usage{void SLsmg_draw_box (int r, int c, unsigned int dr, unsigned int dc)}
+\description
+  \var{SLsmg_draw_box} uses the \var{SLsmg_draw_hline} and
+  \var{SLsmg_draw_vline} functions to draw a rectangular box on the
+  virtual display.  The box's upper left corner is placed at row
+  \var{r} and column \var{c}.  The width and length of the box is
+  specified by \var{dc} and \var{dr}, respectively.
+\seealso{SLsmg_draw_vline, SLsmg_draw_hline, SLsmg_draw_object}
+\done
+
+\function{SLsmg_set_color_in_region}
+\synopsis{Change the color of a specifed region}
+\usage{void SLsmg_set_color_in_region (color, r, c, dr, dc)}
+#v+
+  int color;
+  int r, c;
+  unsigned int dr, dc;
+#v-
+\description
+  \var{SLsmg_set_color_in_region} may be used to change the color of a
+  rectangular region whose upper left corner is given by
+  (\var{r},\var{c}), and whose width and height is given by \var{dc}
+  and \var{dr}, respectively.  The color of the region is given by the
+  \var{color} parameter.
+\seealso{SLsmg_draw_box, SLsmg_set_color}
+\done
+
+\function{SLsmg_get_column}
+\synopsis{Get the column of the virtual cursor}
+\usage{int SLsmg_get_column(void);}
+\description
+  The \var{SLsmg_get_column} function returns the current column of
+  the virtual cursor on the virtual display.
+\seealso{SLsmg_get_row, SLsmg_gotorc}
+\done
+
+\function{SLsmg_get_row}
+\synopsis{Get the row of the virtual cursor}
+\usage{int SLsmg_get_row(void);}
+\description
+  The \var{SLsmg_get_row} function returns the current row of the
+  virtual cursor on the virtual display.
+\seealso{SLsmg_get_column, SLsmg_gotorc}
+\done
+
+\function{SLsmg_forward}
+\synopsis{Move the virtual cursor forward n columns}
+\usage{void SLsmg_forward (int n);}
+\description
+  The \var{SLsmg_forward} function moves the virtual cursor forward
+  \var{n} columns.
+\seealso{SLsmg_gotorc}
+\done
+
+\function{SLsmg_write_color_chars}
+\synopsis{Write characters with color descriptors to virtual display}
+\usage{void SLsmg_write_color_chars (unsigned short *s, unsigned int len)}
+\description
+  The \var{SLsmg_write_color_chars} function may be used to write
+  \var{len} characters, each with a different color descriptor to the
+  virtual display.  Each character and its associated color are
+  encoded as an \exmp{unsigned short} such that the lower eight bits
+  form the character and the next eight bits form the color.
+\seealso{SLsmg_char_at, SLsmg_write_raw}
+\done
+
+\function{SLsmg_read_raw}
+\synopsis{Read characters from the virtual display}
+\usage{unsigned int SLsmg_read_raw (SLsmg_Char_Type *buf, unsigned int len)}
+\description
+  \var{SLsmg_read_raw} attempts to read \var{len} characters from the
+  current position on the virtual display into the buffer specified by
+  \var{buf}.  It returns the number of characters actually read.  This
+  number will be less than \var{len} if an attempt is made to read
+  past the right margin of the display.
+\notes
+  The purpose of the pair of functions, \var{SLsmg_read_raw} and
+  \var{SLsmg_write_raw}, is to permit one to copy the contents of one
+  region of the virtual display to another region.
+\seealso{SLsmg_char_at, SLsmg_write_raw}
+\done
+
+\function{SLsmg_write_raw}
+\synopsis{Write characters directly to the virtual display}
+\usage{unsigned int SLsmg_write_raw (unsigned short *buf, unsigned int len)}
+\description
+  The \var{SLsmg_write_raw} function attempts to write \var{len}
+  characters specified by \var{buf} to the display at the current
+  position.  It returns the number of characters successfully written,
+  which will be less than \var{len} if an attempt is made to write
+  past the right margin.
+\notes
+  The purpose of the pair of functions, \var{SLsmg_read_raw} and
+  \var{SLsmg_write_raw}, is to permit one to copy the contents of one
+  region of the virtual display to another region.
+\seealso{SLsmg_read_raw}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/crtl/sltty.tm Added

@@ -0,0 +1,187 @@
+\function{SLang_init_tty}
+\synopsis{Initialize the terminal keyboard interface}
+\usage{int SLang_init_tty (int intr_ch, int no_flow_ctrl, int opost)}
+\description
+  \var{SLang_init_tty} initializes the terminal for single character
+  input.  If the first parameter \var{intr_ch} is in the range 0-255,
+  it will be used as the interrupt character, e.g., under Unix this
+  character will generate a \var{SIGINT} signal.  Otherwise, if it is
+  \exmp{-1}, the interrupt character will be left unchanged.
+
+  If the second parameter \var{no_flow_ctrl} is non-zero, flow control
+  (\var{XON}/\var{XOFF}) processing will be
+  enabled.
+
+  If the last parmeter \var{opost} is non-zero, output processing by the
+  terminal will be enabled.  If one intends to use this function in
+  conjunction with the \slang screen management routines
+  (\var{SLsmg}), this paramete shold be set to zero.
+
+  \var{SLang_init_tty} returns zero upon success, or \-1 upon error.
+\notes
+  Terminal I/O is a complex subject.  The \slang interface presents a
+  simplification that the author has found useful in practice.  For
+  example, the only special character processing that
+  \var{SLang_init_tty} enables is that of the \var{SIGINT} character,
+  and the generation of other signals via the keyboard is disabled.
+  However, generation of the job control signal \var{SIGTSTP} is possible
+  via the \var{SLtty_set_suspend_state} function.
+
+  Under Unix, the integer variable \var{SLang_TT_Read_FD} is used to
+  specify the input descriptor for the terminal.  If
+  \var{SLang_TT_Read_FD} represents a terminal device as determined
+  via the \var{isatty} system call, then it will be used as the
+  terminal file descriptor.  Otherwise, the terminal device
+  \exmp{/dev/tty} will used as the input device.  The default value of
+  \var{SLang_TT_Read_FD} is \-1 which causes \exmp{/dev/tty} to be
+  used.  So, if you prefer to use \var{stdin} for input, then set
+  \var{SLang_TT_Read_FD} to \exmp{fileno(stdin)} \em{before} calling
+  \var{SLang_init_tty}.
+
+  If the variable \var{SLang_TT_Baud_Rate} is zero when this function
+  is called, the function will attempt to determine the baud rate by
+  querying the terminal driver and set \var{SLang_TT_Baud_Rate} to
+  that value.
+\seealso{SLang_reset_tty, SLang_getkey, SLtty_set_suspend_state}
+\done
+
+\function{SLang_reset_tty}
+\synopsis{Reset the terminal}
+\usage{void SLang_reset_tty (void)}
+\description
+  \var{SLang_reset_tty} resets the terminal interface back to the
+  state it was in before \var{SLang_init_tty} was called.
+\seealso{SLang_init_tty}
+\done
+
+\function{SLtty_set_suspend_state}
+\synopsis{Enable or disable keyboard suspension}
+\usage{void SLtty_set_suspend_state (int s)}
+\description
+  The \var{SLtty_set_suspend_state} function may be used to enable or
+  disable keyboard generation of the \var{SIGTSTP} job control signal.
+  If \var{s} is non-zero, generation of this signal via the terminal
+  interface will be enabled, otherwise it will be disabled.
+
+  This function should only be called after the terminal driver has be
+  initialized via \var{SLang_init_tty}.  The \var{SLang_init_tty}
+  always disables the generation of \var{SIGTSTP} via the keyboard.
+\seealso{SLang_init_tty}
+\done
+
+\function{SLang_getkey}
+\synopsis{Read a character from the keyboard}
+\usage{unsigned int SLang_getkey (void);}
+\description
+  The \var{SLang_getkey} reads a single character from the terminal
+  and returns it.  The terminal must first be initialized via a call
+  to \var{SLang_init_tty} before this function can be called.  Upon
+  success, \var{SLang_getkey} returns the character read from the
+  terminal, otherwise it returns \var{SLANG_GETKEY_ERROR}.
+\seealso{SLang_init_tty, SLang_input_pending, SLang_ungetkey}
+\done
+
+\function{SLang_ungetkey_string}
+\synopsis{Unget a key string}
+\usage{int SLang_ungetkey_string (unsigned char *buf, unsigned int n)}
+\description
+  The \var{SLang_ungetkey_string} function may be used to push the
+  \var{n} characters pointed to by \var{buf} onto the buffered input
+  stream that \var{SLgetkey} uses.  If there is not enough room for
+  the characters, \-1 is returned and none are buffered.  Otherwise,
+  it returns zero.
+\notes
+  The difference between \var{SLang_buffer_keystring} and
+  \var{SLang_ungetkey_string} is that the \var{SLang_buffer_keystring}
+  appends the characters to the end of the getkey buffer, whereas
+  \var{SLang_ungetkey_string} inserts the characters at the beginning
+  of the input buffer.
+\seealso{SLang_ungetkey, SLang_getkey}
+\done
+
+\function{SLang_buffer_keystring}
+\synopsis{Append a keystring to the input buffer}
+\usage{int SLang_buffer_keystring (unsigned char *b, unsigned int len)}
+\description
+  \var{SLang_buffer_keystring} places the \var{len} characters
+  specified by \var{b} at the \em{end} of the buffer that
+  \var{SLang_getkey} uses.  Upon success it returns 0; otherwise, no
+  characters are buffered and it returns \-1.
+\notes
+  The difference between \var{SLang_buffer_keystring} and
+  \var{SLang_ungetkey_string} is that the \var{SLang_buffer_keystring}
+  appends the characters to the end of the getkey buffer, whereas
+  \var{SLang_ungetkey_string} inserts the characters at the beginning
+  of the input buffer.
+\seealso{SLang_getkey, SLang_ungetkey, SLang_ungetkey_string}
+\done
+
+\function{SLang_ungetkey}
+\synopsis{Push a character back onto the input buffer}
+\usage{int SLang_ungetkey (unsigned char ch)}
+\description
+  \var{SLang_ungetkey} pushes the character \var{ch} back onto the
+  \var{SLgetkey} input stream.  Upon success, it returns zero,
+  otherwise it returns \1.
+\example
+  This function is implemented as:
+#v+
+    int SLang_ungetkey (unsigned char ch)
+    {
+       return SLang_ungetkey_string(&ch, 1);
+    }
+#v-
+\seealso{SLang_getkey, SLang_ungetkey_string}
+\done
+
+\function{SLang_flush_input}
+\synopsis{Discard all keyboard input waiting to be read}
+\usage{void SLang_flush_input (void)}
+\description
+  \var{SLang_flush_input} discards all input characters waiting to be
+  read by the \var{SLang_getkey} function.
+\seealso{SLang_getkey}
+\done
+
+\function{SLang_input_pending}
+\synopsis{Check to see if input is pending}
+\usage{int SLang_input_pending (int tsecs)}
+\description
+  \var{SLang_input_pending} may be used to see if an input character
+  is available to be read without causing \var{SLang_getkey} to block.
+  It will wait up to \var{tsecs} tenths of a second if no characters
+  are immediately available for reading.  If \var{tsecs} is less than
+  zero, then \var{SLang_input_pending} will wait \exmp{-tsecs}
+  milliseconds for input, otherwise \var{tsecs} represents \var{1/10}
+  of a second intervals.
+\notes
+  Not all systems support millisecond resolution.
+\seealso{SLang_getkey}
+\done
+
+\function{SLang_set_abort_signal}
+\synopsis{Set the signal to trap SIGINT}
+\usage{void SLang_set_abort_signal (void (*f)(int));}
+\description
+  \var{SLang_set_abort_signal} sets the function that gets
+  triggered when the user presses the interrupt key (\var{SIGINT}) to
+  the function \var{f}.  If \var{f} is \var{NULL} the default handler
+  will get installed.
+\example
+  The default interrupt handler on a Unix system is:
+#v+
+     static void default_sigint (int sig)
+     {
+        SLKeyBoard_Quit = 1;
+	if (SLang_Ignore_User_Abort == 0) SLang_Error = SL_USER_BREAK;
+	SLsignal_intr (SIGINT, default_sigint);
+   }
+#v-
+\notes
+  For Unix programmers, the name of this function may appear
+  misleading since it is associated with \var{SIGINT} and not
+  \var{SIGABRT}.  The origin of the name stems from the original intent
+  of the function: to allow the user to abort the running of a \slang
+  interpreter function.
+\seealso{SLang_init_tty, SLsignal_intr}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/crtl/slutf8.tm Added

@@ -0,0 +1,292 @@
+\function{SLutf8_skip_char}
+\synopsis{Skip past a UTF-8 encoded character}
+\usage{SLuchar_Type *SLutf8_skip_char (SLuchar_Type *u, SLuchar_Type *umax)}
+\description
+ The \cfun{SLutf8_skip_char} function returns a pointer to the
+ character immediately following the UTF-8 encoded character at
+ \exmp{u}. It will make no attempt to examine the bytes at the
+ position \exmp{umax} and beyond. If the bytes at \exmp{u} do not
+ represent a valid or legal UTF-8 encoded sequence, a pointer to the
+ byte following \exmp{u} will be returned.
+\notes
+ Unicode combining characters are treated as distinct characters by
+ this function.
+\seealso{SLutf8_skip_chars, SLutf8_bskip_char, SLutf8_strlen}
+\done
+
+\function{SLutf8_skip_chars}
+\synopsis{Skip past a specified number of characters in a UTF-8
+ encoded string}
+\usage{SLuchar_Type *SLutf8_skip_chars (u, umax, num, dnum, ignore_combining)}
+#v+
+ SLuchar_Type *u, *umax;
+ unsigned int num;
+ unsigned int *dnum;
+ int ignore_combining;
+#v-
+\description
+ This functions attempts to skip forward past \exmp{num} UTF-8 encoded
+ characters at \exmp{u} returning the actual number skipped via the
+ parameter \exmp{dnum}. It will make no attempt to examine bytes at
+ \exmp{umax} and beyond. Unicode combining characters will not be
+ counted if \exmp{ignore_combining} is non-zero, otherwise they will
+ be treated as distinct characters. If the input contains an
+ invalid or illegal UTF-8 sequence, then each byte in the sequence
+ will be treated as a single character.
+\seealso{SLutf8_skip_char, SLutf8_bskip_chars}
+\done
+
+\function{SLutf8_bskip_char}
+\synopsis{Skip backward past a UTF-8 encoded character}
+\usage{SLuchar_Type *SLutf8_bskip_char (SLuchar_Type *umin, SLuchar_Type *u)}
+\description
+ The \cfun{SLutf8_bskip_char} skips backward to the start of the
+ UTF-8 encoded character immediately before the position \exmp{u}.
+ The function will make no attempt to examine characters before the
+ position \exmp{umin}. UTF-8 combining characters are treated as
+ distinct characters.
+\seealso{SLutf8_bskip_chars, SLutf8_skip_char}
+\done
+
+\function{SLutf8_bskip_chars}
+\synopsis{Skip backward past a specified number of UTF-8 encoded characters}
+\usage{SLuchar_Type *SLutf8_bskip_chars (umin, u, num, dnum, ignore_combining)}
+#v+
+ SLuchar_Type *umin, *u;
+ unsigned int num;
+ unsigned int *dnum;
+ int ignore_combining;
+#v-
+\description
+ This functions attempts to skip backward past \exmp{num} UTF-8
+ encoded characters occurring immediately before \exmp{u}. It returns
+ the the actual number skipped via the parameter \exmp{dnum}. No
+ attempt will be made to examine the bytes occurring before \exmp{umin}.
+ Unicode combining characters will not be counted if \exmp{ignore_combining}
+ is non-zero, otherwise they will be treated as distinct characters.
+ If the input contains an invalid or illegal UTF-8 sequence, then each
+ byte in the sequence will be treated as a single character.
+\seealso{SLutf8_skip_char, SLutf8_bskip_chars}
+\done
+
+\function{SLutf8_decode}
+\synopsis{Decode a UTF-8 encoded character sequence}
+\usage{SLuchar_Type *SLutf8_decode (u, umax, w, nconsumedp}
+#v+
+ SLuchar_Type *u, *umax;
+ SLwchar_Type *w;
+ unsigned int *nconsumedp;
+#v-
+\description
+ The \cfun{SLutf8_decode} function decodes the UTF-8 encoded character
+ occurring at \exmp{u} and returns the decoded character via the
+ parameter \exmp{w}. No attempt will be made to examine the bytes at
+ \exmp{umax} and beyond. If the parameter \exmp{nconsumedp} is
+ non-NULL, then the number of bytes consumed by the function will
+ be returned to it. If the sequence at \exmp{u} is invalid or
+ illegal, the function will return \NULL and with the number of
+ bytes consumed by the function equal to the size of the invalid
+ sequence. Otherwise the function will return a pointer to byte
+ following encoded sequence.
+\seealso{SLutf8_decode, SLutf8_strlen, SLutf8_skip_char}
+\done
+
+\function{SLutf8_encode}
+\synopsis{UTF-8 encode a character}
+\usage{SLuchar_Type *SLutf8_encode (w, u, ulen)}
+#v+
+ SLwchar_Type w;
+ SLuchar_Type *u;
+ unsigned int ulen;
+#v-
+\description
+ This function UTF-8 encodes the Unicode character represented by
+ \exmp{w} and stored the encoded representation in the buffer of size
+ \exmp{ulen} bytes at \exmp{u}. The function will return \NULL if the
+ size of the buffer is too small to represent the UTF-8 encoded
+ character, otherwise it will return a pointer to the byte following
+ encoded representation.
+\notes
+ This function does not null terminate the resulting byte sequence.
+ The function \cfun{SLutf8_encode_null_terminate} may be used for that
+ purpose.
+
+ To guarantee that the buffer is large enough to hold the encoded
+ bytes, its size should be at least \exmp{SLUTF8_MAX_BLEN} bytes.
+
+ The function will encode illegal Unicode characters, i.e., characters
+ in the range 0xD800-0xFFFF (the UTF-16 surrogates) and 0xFFFE-0xFFFF.
+\seealso{SLutf8_decode, SLutf8_encode_bytes, SLutf8_encode_null_terminate}
+\done
+
+\function{SLutf8_strlen}
+\synopsis{Determine the number of characters in a UTF-8 sequence}
+\usage{unsigned int SLutf8_strlen (SLuchar_Type *s, int ignore_combining)}
+\description
+ This function may be used to determine the number of characters
+ represented by the null-terminated UTF-8 byte sequence. If the
+ \exmp{ignore_combining} parameter is non-zero, then Unicode combining
+ characters will not be counted.
+\seealso{SLutf8_skip_chars, SLutf8_decode}
+\done
+
+\function{SLutf8_extract_utf8_char}
+\synopsis{Extract a UTF-8 encoded character}
+\usage{SLuchar_Type *SLutf8_extract_utf8_char (u, umax, buf)}
+#v+
+ SLuchar_Type *u, *umax, *buf;
+#v-
+\description
+ This function extracts the bytes representing UTF-8 encoded character
+ at \exmp{u} and places them in the buffer \exmp{buf}, and then null
+ terminates the result. The buffer is assumed to consist of at least
+ \exmp{SLUTF8_MAX_BLEN+1} bytes, where the extra byte may be necessary
+ for null termination. No attempt will be made to examine the
+ characters at \exmp{umax} and beyond. If the byte-sequence at
+ \exmp{u} is an illegal or invalid UTF-8 sequence, then the byte at
+ \exmp{u} will be copied to the buffer. The function returns a
+ pointer to the byte following copied bytes.
+\notes
+ One may think of this function as the single byte analogue of
+#v+
+ if (u < umax)
+ {
+ buf0 = *u++;
+ buf1 = 0;
+ }
+#v-
+\seealso{SLutf8_decode, SLutf8_skip_char}
+\done
+
+\function{SLutf8_encode_null_terminate}
+\synopsis{UTF-8 encode a character and null terminate the result}
+\usage{SLuchar_Type *SLutf8_encode_null_terminate (w, buf)}
+#v+
+ SLwchar_Type w;
+ SLuchar_Type *buf;
+#v-
+\description
+ This function has the same functionality as \cfun{SLutf8_encode},
+ except that it also null terminates the encoded sequences. The
+ buffer \exmp{buf}, where the encoded sequence is placed, is assumed
+ to consist of at least \exmp{SLUTF8_MAX_BLEN+1} bytes.
+\seealso{SLutf8_encode}
+\done
+
+\function{SLutf8_strup}
+\synopsis{Uppercase a UTF-8 encoded string}
+\usage{SLuchar_Type *SLutf8_strup (SLuchar_Type *u, SLuchar_Type *umax)}
+\description
+ The \cfun{SLutf8_strup} function returns the uppercase equivalent of
+ UTF-8 encoded sequence of \exmp{umax-u} bytes at \exmp{u}. The
+ result will be returned as a null-terminated \exmp{SLstring} and
+ should be freed with \cfun{SLang_free_slstring} when it is nolonger
+ needed. If the function encounters an invalid of illegal byte
+ sequence, then the byte-sequence will be copied as as-is.
+\seealso{SLutf8_strlow, SLwchar_toupper}
+\done
+
+\function{SLutf8_strlo}
+\synopsis{Lowercase a UTF-8 encoded string}
+\usage{SLuchar_Type *SLutf8_strlo (SLuchar_Type *u, SLuchar_Type *umax)}
+\description
+ The \cfun{SLutf8_strlo} function returns the lowercase equivalent of
+ UTF-8 encoded sequence of \exmp{umax-u} bytes at \exmp{u}. The
+ result will be returned as a null-terminated \exmp{SLstring} and
+ should be freed with \cfun{SLang_free_slstring} when it is nolonger
+ needed. If the function encounters an invalid of illegal byte
+ sequence, then the byte-sequence will be copied as as-is.
+\seealso{SLutf8_strlow, SLwchar_toupper}
+\done
+
+\function{SLutf8_subst_wchar}
+\synopsis{Replace a character in a UTF-8 encoded string}
+\usage{SLstr_Type *SLutf8_subst_wchar (u, umax, wch, nth,ignore_combining)}
+#v+
+ SLuchar_Type *u, *umax;
+ SLwchar_Type wch;
+ unsigned int nth;
+ int ignore_combining;
+#v-
+\description
+ The \cfun{SLutf8_subst_wchar} function replaces the UTF-8 sequence
+ representing the \exmp{nth} character of \exmp{u} by the UTF-8
+ representation of the character \exmp{wch}. If the value of the
+ \exmp{ignore_combining} parameter is non-zero, then combining
+ characters will not be counted when computing the position of the
+ \exmp{nth} character. In addition, if the \exmp{nth} character
+ contains any combining characters, then the byte-sequence associated
+ with those characters will also be replaced.
+
+ Since the byte sequence representing \exmp{wch} could be longer than
+ the sequence of the \exmp{nth} character, the function returns a new
+ copy of the resulting string as an \exmp{SLSTRING}. Hence, the
+ calling function should call \cfun{SLang_free_slstring} when the
+ result is nolonger needed.
+\seealso{SLutf8_strup, SLutf8_strlow, SLutf8_skip_chars, SLutf8_strlen}
+\done
+
+\function{SLutf8_compare}
+\synopsis{Compare two UTF-8 encoded sequences}
+\usage{int SLutf8_compare (a, amax, b, bmax, nchars, case_sensitive)}
+#v+
+ SLuchar_Type *a, *amax;
+ SLuchar_Type *b, *bmax;
+ unsigned int nchars;
+ int case_sensitive;
+#v-
+\description
+ This function compares \exmp{nchars} of one UTF-8 encoded character
+ sequence to another by performing a character by character comparison.
+ The function returns 0, +1, or -1 according to whether the string
+ \exmp{a} is is equal to, greater than, or less than the string at
+ \exmp{b}. At most \exmp{nchars} characters will be tested. The
+ parameters \exmp{amax} and \exmp{bmax} serve as upper boundaries of
+ the strings \exmp{a} and \exmp{b}, resp.
+
+ If the value of the \exmp{case_sensitive} parameter is non-zero, then
+ a case-sensitive comparison will be performed, otherwise characters
+ will be compared in a case-insensitive manner.
+\notes
+ For case-sensitive comparisons, this function is analogous to the
+ standard C library's \cfun{strncmp} function. However,
+ \ifun{SLutf8_compare} can also cope with invalid or illegal UTF-8
+ sequences.
+\seealso{SLutf8_strup, SLutf8_strlen, SLutf8_strlen}
+\done
+
+#% \function{SLutf8_decode_bytes}
+#% \synopsis{}
+#% \usage{int SLutf8_decode_bytes (u, umax, b, np)}
+#% #v+
+#% SLuchar_Type *u, *umax;
+#% unsigned char *b;
+#% unsigned int *np;
+#% #v-
+#% \description
+#% \seealso{}
+#% \done
+
+#% \function{SLutf8_encode_bytes}
+#% \synopsis{UTF-8 encode an byte-sequence}
+#% \usage{SLuchar_Type *SLutf8_encode_bytes (b, bmax, u, ulen, np)}
+#% #v+
+#% unsigned char *b, *bmax;
+#% SLuchar_Type *u;
+#% unsigned int ulen;
+#% unsigned int *np;
+#% #v-
+#% \description
+#% The \cfun{SLutf8_encode_bytes} function UTF-8 encodes each byte
+#% between \exmp{b} and \exmp{bmax} and placing the \exmp{bmax-b}
+#% encoded characters into the buffer at \exmp{u}, whose length is
+#% given by \exmp{ulen}. Upon return, \exmp{*np} will be set to the
+#% number of bytes sucessfully encoded. The number will be less than
+#% the number requested if the buffer at \exmp{u} is too small.
+#% \notes
+#% This function interprets the value of each byte as a wide-character
+#% to be encoded. As such, the function can be used to UTF-8 encode
+#% characters from an iso-latin-1 character set.
+#% \seealso{SLutf8_decode_bytes}
+#% \done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/crtl/slwchar.tm Added

@@ -0,0 +1,180 @@
+\function{SLwchar_toupper}
+\synopsis{Uppercase a Unicode character}
+\usage{SLwchar_Type SLwchar_toupper (SLwchar_Type wc)}
+\description
+ \cfun{SLwchar_toupper} returns the uppercase equivalent of the
+ specified character.
+\notes
+  If the library is not in UTF-8 mode, then the current locale will be
+  used.
+\seealso{SLwchar_tolower, SLwchar_isupper, SLutf8_strup}
+\done
+
+\function{SLwchar_tolower}
+\synopsis{Lowercase a Unicode character}
+\usage{SLwchar_Type SLwchar_tolower (SLwchar_Type wc)}
+\description
+ \cfun{SLwchar_tolower} returns the lowercase equivalent of the
+ specified character.
+\notes
+  If the library is not in UTF-8 mode, then the current locale will be
+  used.
+\seealso{SLwchar_toupper, SLwchar_islower, SLutf8_strlow}
+\done
+
+\function{SLwchar_wcwidth}
+\synopsis{Determine the displayable width of a wide character}
+\usage{int SLwchar_wcwidth (SLwchar_Type wc)}
+\description
+ This function returns the number of columns necessary to display the
+ specified Unicode character.  Combining characters are meant to be
+ combined with other characters and, as such, have 0 width.
+\notes
+  If the library is not in UTF-8 mode, then the current locale will be
+  used.
+\seealso{SLwchar_isspace, SLwchar_iscntrl}
+\done
+
+\function{SLwchar_isalnum}
+\synopsis{Determine if a Unicode character is alphanumeric}
+\usage{int SLwchar_isalnum (SLwchar_Type wc)}
+\description
+  \cfun{SLwchar_isalnum} returns a non-zero value if the Unicode
+  character is alphanumeric, otherwise it returns 0.
+\notes
+  If the library is not in UTF-8 mode, then the current locale will be
+  used.
+\seealso{SLwchar_isalpha, SLwchar_isdigit, SLwchar_iscntrl}
+\done
+
+\function{SLwchar_isalpha}
+\synopsis{Determine if a Unicode character is an alphabetic character}
+\usage{int SLwchar_isalpha (SLwchar_Type wc)}
+\description
+  \cfun{SLwchar_isalpha} returns a non-zero value if the Unicode
+  character is alphabetic, otherwise it returns 0.
+\notes
+  If the library is not in UTF-8 mode, then the current locale will be
+  used.
+\seealso{SLwchar_isalnum, SLwchar_isalpha, SLwchar_isdigit, SLwchar_iscntrl}
+\done
+
+\function{SLwchar_isblank}
+\synopsis{Determine if a Unicode character is a blank}
+\usage{int SLwchar_isblank (SLwchar_Type wc)}
+\description
+  \cfun{SLwchar_isblank} returns a non-zero value if the Unicode
+  character is a blank one (space or tab), otherwise it returns 0.
+\notes
+  If the library is not in UTF-8 mode, then the current locale will be
+  used.
+\seealso{SLwchar_isspace, SLwchar_isalpha, SLwchar_isdigit, SLwchar_iscntrl}
+\done
+
+\function{SLwchar_iscntrl}
+\synopsis{Determine if a Unicode character is a control character}
+\usage{int SLwchar_iscntrl (SLwchar_Type wc)}
+\description
+  \cfun{SLwchar_isblank} returns a non-zero value if the Unicode
+  character is a control character, otherwise it returns 0.
+\notes
+  If the library is not in UTF-8 mode, then the current locale will be
+  used.
+\seealso{SLwchar_isspace, SLwchar_isalpha, SLwchar_isdigit, SLwchar_isprint}
+\done
+
+\function{SLwchar_isdigit}
+\synopsis{Determine if a Unicode character is a digit}
+\usage{int SLwchar_isdigit (SLwchar_Type wc)}
+\description
+  This function returns a non-zero value if the specified Unicode
+  character is a digit, otherwise it returns 0.
+\notes
+  If the library is not in UTF-8 mode, then the current locale will be
+  used.
+\seealso{SLwchar_isspace, SLwchar_isalpha, SLwchar_isxdigit, SLwchar_isprint}
+\done
+
+\function{SLwchar_isgraph}
+\synopsis{Determine if a non-space Unicode character is printable}
+\usage{int SLwchar_isgraph (SLwchar_Type wc)}
+\description
+  This function returns a non-zero value if the specified Unicode
+  character is a non-space printable character, otherwise it returns 0.
+\notes
+  If the library is not in UTF-8 mode, then the current locale will be
+  used.
+\seealso{SLwchar_isspace, SLwchar_isalpha, SLwchar_isdigit, SLwchar_isprint}
+\done
+
+\function{SLwchar_islower}
+\synopsis{Determine if a Unicode character is alphanumeric}
+\usage{int SLwchar_islower (SLwchar_Type wc)}
+\description
+  This function returns a non-zero value if the specified Unicode
+  character is a lowercase one, otherwise it returns 0.
+\notes
+  If the library is not in UTF-8 mode, then the current locale will be
+  used.
+\seealso{SLwchar_isupper, SLwchar_isspace, SLwchar_isalpha, SLwchar_isdigit, SLwchar_iscntrl}
+\done
+
+\function{SLwchar_isprint}
+\synopsis{Determine if a Unicode character is printable}
+\usage{int SLwchar_isprint (SLwchar_Type wc)}
+\description
+  This function returns a non-zero value if the specified Unicode
+  character is a printable one (includes space), otherwise it returns 0.
+\notes
+  If the library is not in UTF-8 mode, then the current locale will be
+  used.
+\seealso{SLwchar_isgraph, SLwchar_isspace, SLwchar_isalpha, SLwchar_isdigit}
+\done
+
+\function{SLwchar_ispunct}
+\synopsis{Determine if a Unicode character is a punctuation character}
+\usage{int SLwchar_ispunct (SLwchar_Type wc)}
+\description
+  This function returns a non-zero value if the specified Unicode
+  character is a punctuation character, otherwise it returns 0.
+\notes
+  If the library is not in UTF-8 mode, then the current locale will be
+  used.
+\seealso{SLwchar_isspace, SLwchar_isalpha, SLwchar_isdigit, SLwchar_isprint}
+\done
+
+\function{SLwchar_isspace}
+\synopsis{Determine if a Unicode character is a whitespace character}
+\usage{int SLwchar_isspace (SLwchar_Type wc)}
+\description
+  This function returns a non-zero value if the specified Unicode
+  character is a whitespace character, otherwise it returns 0.
+\notes
+  If the library is not in UTF-8 mode, then the current locale will be
+  used.
+\seealso{SLwchar_isblank, SLwchar_isalpha, SLwchar_isdigit, SLwchar_ispunct}
+\done
+
+\function{SLwchar_isupper}
+\synopsis{Determine if a Unicode character is uppercase}
+\usage{int SLwchar_isupper (SLwchar_Type wc)}
+\description
+  This function returns a non-zero value if the specified Unicode
+  character is an uppercase character, otherwise it returns 0.
+\notes
+  If the library is not in UTF-8 mode, then the current locale will be
+  used.
+\seealso{SLwchar_islower, SLwchar_isspace, SLwchar_isalpha, SLwchar_isdigit}
+\done
+
+\function{SLwchar_isxdigit}
+\synopsis{Determine if a Unicode character is a hexidecimal digit}
+\usage{int SLwchar_isxdigit (SLwchar_Type wc)}
+\description
+  This function returns a non-zero value if the specified Unicode
+  character is a hexadecimal digit character, otherwise it returns 0.
+\notes
+  If the library is not in UTF-8 mode, then the current locale will be
+  used.
+\seealso{SLwchar_isdigit, SLwchar_isspace, SLwchar_isalpha, SLwchar_ispunct}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/crtl/undoc.tm Added

@@ -0,0 +1,866 @@
+\function{SLprep_open_prep}
+\synopsis{??}
+\usage{int SLprep_open_prep (SLPreprocess_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{SLprep_close_prep}
+\synopsis{??}
+\usage{void SLprep_close_prep (SLPreprocess_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{SLprep_line_ok}
+\synopsis{??}
+\usage{int SLprep_line_ok (char *, SLPreprocess_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{SLdefine_for_ifdef}
+\synopsis{??}
+\usage{int SLdefine_for_ifdef (char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{SLang_Read_Line_Type * SLang_rline_save_line (SLang_RLine_Info_Type *);}
+\synopsis{??}
+\usage{SLang_Read_Line_Type * SLang_rline_save_line (SLang_RLine_Info_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLang_init_readline (SLang_RLine_Info_Type *);}
+\synopsis{??}
+\usage{int SLang_init_readline (SLang_RLine_Info_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLang_read_line (SLang_RLine_Info_Type *);}
+\synopsis{??}
+\usage{int SLang_read_line (SLang_RLine_Info_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLang_rline_insert (char *);}
+\synopsis{??}
+\usage{int SLang_rline_insert (char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLrline_redraw (SLang_RLine_Info_Type *);}
+\synopsis{??}
+\usage{void SLrline_redraw (SLang_RLine_Info_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLtt_flush_output (void);}
+\synopsis{??}
+\usage{int SLtt_flush_output (void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_set_scroll_region(int, int);}
+\synopsis{??}
+\usage{void SLtt_set_scroll_region(int, int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_reset_scroll_region(void);}
+\synopsis{??}
+\usage{void SLtt_reset_scroll_region(void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_reverse_video (int);}
+\synopsis{??}
+\usage{void SLtt_reverse_video (int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_bold_video (void);}
+\synopsis{??}
+\usage{void SLtt_bold_video (void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_begin_insert(void);}
+\synopsis{??}
+\usage{void SLtt_begin_insert(void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_end_insert(void);}
+\synopsis{??}
+\usage{void SLtt_end_insert(void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_del_eol(void);}
+\synopsis{??}
+\usage{void SLtt_del_eol(void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_goto_rc (int, int);}
+\synopsis{??}
+\usage{void SLtt_goto_rc (int, int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_delete_nlines(int);}
+\synopsis{??}
+\usage{void SLtt_delete_nlines(int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_delete_char(void);}
+\synopsis{??}
+\usage{void SLtt_delete_char(void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_erase_line(void);}
+\synopsis{??}
+\usage{void SLtt_erase_line(void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_normal_video(void);}
+\synopsis{??}
+\usage{void SLtt_normal_video(void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_cls(void);}
+\synopsis{??}
+\usage{void SLtt_cls(void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_beep(void);}
+\synopsis{??}
+\usage{void SLtt_beep(void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_reverse_index(int);}
+\synopsis{??}
+\usage{void SLtt_reverse_index(int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_smart_puts(unsigned short *, unsigned short *, int, int);}
+\synopsis{??}
+\usage{void SLtt_smart_puts(unsigned short *, unsigned short *, int, int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_write_string (char *);}
+\synopsis{??}
+\usage{void SLtt_write_string (char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_putchar(char);}
+\synopsis{??}
+\usage{void SLtt_putchar(char);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLtt_init_video (void);}
+\synopsis{??}
+\usage{int SLtt_init_video (void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLtt_reset_video (void);}
+\synopsis{??}
+\usage{int SLtt_reset_video (void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_get_terminfo(void);}
+\synopsis{??}
+\usage{void SLtt_get_terminfo(void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_get_screen_size (void);}
+\synopsis{??}
+\usage{void SLtt_get_screen_size (void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLtt_set_cursor_visibility (int);}
+\synopsis{??}
+\usage{int SLtt_set_cursor_visibility (int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLtt_initialize (char *);}
+\synopsis{??}
+\usage{int SLtt_initialize (char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_enable_cursor_keys(void);}
+\synopsis{??}
+\usage{void SLtt_enable_cursor_keys(void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_set_term_vtxxx(int *);}
+\synopsis{??}
+\usage{void SLtt_set_term_vtxxx(int *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_set_color_esc (int, char *);}
+\synopsis{??}
+\usage{void SLtt_set_color_esc (int, char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_wide_width(void);}
+\synopsis{??}
+\usage{void SLtt_wide_width(void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_narrow_width(void);}
+\synopsis{??}
+\usage{void SLtt_narrow_width(void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLtt_set_mouse_mode (int, int);}
+\synopsis{??}
+\usage{int SLtt_set_mouse_mode (int, int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_set_alt_char_set (int);}
+\synopsis{??}
+\usage{void SLtt_set_alt_char_set (int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLtt_write_to_status_line (char *, int);}
+\synopsis{??}
+\usage{int SLtt_write_to_status_line (char *, int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_disable_status_line (void);}
+\synopsis{??}
+\usage{void SLtt_disable_status_line (void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{char *SLtt_tgetstr (char *);}
+\synopsis{??}
+\usage{char *SLtt_tgetstr (char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLtt_tgetnum (char *);}
+\synopsis{??}
+\usage{int SLtt_tgetnum (char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLtt_tgetflag (char *);}
+\synopsis{??}
+\usage{int SLtt_tgetflag (char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{char *SLtt_tigetent (char *);}
+\synopsis{??}
+\usage{char *SLtt_tigetent (char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{char *SLtt_tigetstr (char *, char **);}
+\synopsis{??}
+\usage{char *SLtt_tigetstr (char *, char **);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLtt_tigetnum (char *, char **);}
+\synopsis{??}
+\usage{int SLtt_tigetnum (char *, char **);}
+\description
+??
+\seealso{??}
+\done
+
+\function{SLtt_Char_Type SLtt_get_color_object (int);}
+\synopsis{??}
+\usage{SLtt_Char_Type SLtt_get_color_object (int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_set_color_object (int, SLtt_Char_Type);}
+\synopsis{??}
+\usage{void SLtt_set_color_object (int, SLtt_Char_Type);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_set_color (int, char *, char *, char *);}
+\synopsis{??}
+\usage{void SLtt_set_color (int, char *, char *, char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_set_mono (int, char *, SLtt_Char_Type);}
+\synopsis{??}
+\usage{void SLtt_set_mono (int, char *, SLtt_Char_Type);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_add_color_attribute (int, SLtt_Char_Type);}
+\synopsis{??}
+\usage{void SLtt_add_color_attribute (int, SLtt_Char_Type);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLtt_set_color_fgbg (int, SLtt_Char_Type, SLtt_Char_Type);}
+\synopsis{??}
+\usage{void SLtt_set_color_fgbg (int, SLtt_Char_Type, SLtt_Char_Type);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLkp_define_keysym (char *, unsigned int);}
+\synopsis{??}
+\usage{int SLkp_define_keysym (char *, unsigned int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLkp_init (void);}
+\synopsis{??}
+\usage{int SLkp_init (void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLkp_getkey (void);}
+\synopsis{??}
+\usage{int SLkp_getkey (void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLscroll_find_top (SLscroll_Window_Type *);}
+\synopsis{??}
+\usage{int SLscroll_find_top (SLscroll_Window_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLscroll_find_line_num (SLscroll_Window_Type *);}
+\synopsis{??}
+\usage{int SLscroll_find_line_num (SLscroll_Window_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{unsigned int SLscroll_next_n (SLscroll_Window_Type *, unsigned int);}
+\synopsis{??}
+\usage{unsigned int SLscroll_next_n (SLscroll_Window_Type *, unsigned int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{unsigned int SLscroll_prev_n (SLscroll_Window_Type *, unsigned int);}
+\synopsis{??}
+\usage{unsigned int SLscroll_prev_n (SLscroll_Window_Type *, unsigned int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLscroll_pageup (SLscroll_Window_Type *);}
+\synopsis{??}
+\usage{int SLscroll_pageup (SLscroll_Window_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLscroll_pagedown (SLscroll_Window_Type *);}
+\synopsis{??}
+\usage{int SLscroll_pagedown (SLscroll_Window_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{SLSig_Fun_Type *SLsignal (int, SLSig_Fun_Type *);}
+\synopsis{??}
+\usage{SLSig_Fun_Type *SLsignal (int, SLSig_Fun_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{SLSig_Fun_Type *SLsignal_intr (int, SLSig_Fun_Type *);}
+\synopsis{??}
+\usage{SLSig_Fun_Type *SLsignal_intr (int, SLSig_Fun_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLsig_block_signals (void);}
+\synopsis{??}
+\usage{int SLsig_block_signals (void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLsig_unblock_signals (void);}
+\synopsis{??}
+\usage{int SLsig_unblock_signals (void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLsystem (char *);}
+\synopsis{??}
+\usage{int SLsystem (char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLadd_at_handler (long *, char *);}
+\synopsis{??}
+\usage{void SLadd_at_handler (long *, char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLang_define_case(int *, int *);}
+\synopsis{??}
+\usage{void SLang_define_case(int *, int *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLang_init_case_tables (void);}
+\synopsis{??}
+\usage{void SLang_init_case_tables (void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{unsigned char *SLang_regexp_match(unsigned char *, unsigned int, SLRegexp_Type *);}
+\synopsis{??}
+\usage{unsigned char *SLang_regexp_match(unsigned char *, unsigned int, SLRegexp_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLang_regexp_compile (SLRegexp_Type *);}
+\synopsis{??}
+\usage{int SLang_regexp_compile (SLRegexp_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{char *SLregexp_quote_string (char *, char *, unsigned int);}
+\synopsis{??}
+\usage{char *SLregexp_quote_string (char *, char *, unsigned int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLcmd_execute_string (char *, SLcmd_Cmd_Table_Type *);}
+\synopsis{??}
+\usage{int SLcmd_execute_string (char *, SLcmd_Cmd_Table_Type *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{SLcomplex_abs}
+\synopsis{Returns the norm of a complex number}
+\usage{double SLcomplex_abs (double *z)}}
+\description
+  The \var{SLcomplex_abs} function returns the absolute value or the
+  norm of the complex number given by \var{z}.
+\seealso{SLcomplex_times}
+\done
+
+\function{double *SLcomplex_times (double *, double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_times (double *, double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_divide (double *, double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_divide (double *, double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_sin (double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_sin (double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_cos (double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_cos (double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_tan (double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_tan (double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_asin (double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_asin (double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_acos (double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_acos (double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_atan (double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_atan (double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_exp (double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_exp (double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_log (double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_log (double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_log10 (double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_log10 (double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_sqrt (double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_sqrt (double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_sinh (double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_sinh (double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_cosh (double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_cosh (double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_tanh (double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_tanh (double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_pow (double *, double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_pow (double *, double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double SLmath_hypot (double x, double y);}
+\synopsis{??}
+\usage{double SLmath_hypot (double x, double y);}
+\description
+??
+\seealso{??}
+\done
+
+extern double *SLcomplex_asinh (double *, double *);
+\function{double *SLcomplex_acosh (double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_acosh (double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{double *SLcomplex_atanh (double *, double *);}
+\synopsis{??}
+\usage{double *SLcomplex_atanh (double *, double *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{char *SLdebug_malloc (unsigned long);}
+\synopsis{??}
+\usage{char *SLdebug_malloc (unsigned long);}
+\description
+??
+\seealso{??}
+\done
+
+\function{char *SLdebug_calloc (unsigned long, unsigned long);}
+\synopsis{??}
+\usage{char *SLdebug_calloc (unsigned long, unsigned long);}
+\description
+??
+\seealso{??}
+\done
+
+\function{char *SLdebug_realloc (char *, unsigned long);}
+\synopsis{??}
+\usage{char *SLdebug_realloc (char *, unsigned long);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLdebug_free (char *);}
+\synopsis{??}
+\usage{void SLdebug_free (char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLmalloc_dump_statistics (void);}
+\synopsis{??}
+\usage{void SLmalloc_dump_statistics (void);}
+\description
+??
+\seealso{??}
+\done
+
+\function{char *SLstrcpy(register char *, register char *);}
+\synopsis{??}
+\usage{char *SLstrcpy(register char *, register char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLstrcmp(register char *, register char *);}
+\synopsis{??}
+\usage{int SLstrcmp(register char *, register char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{char *SLstrncpy(char *, register char *, register  int);}
+\synopsis{??}
+\usage{char *SLstrncpy(char *, register char *, register  int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLmemset (char *, char, int);}
+\synopsis{??}
+\usage{void SLmemset (char *, char, int);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLexpand_escaped_string (register char *, register char *, register char *);}
+\synopsis{??}
+\usage{void SLexpand_escaped_string (register char *, register char *, register char *);}
+\description
+??
+\seealso{??}
+\done
+
+\function{void SLmake_lut (unsigned char *, unsigned char *, unsigned char);}
+\synopsis{??}
+\usage{void SLmake_lut (unsigned char *, unsigned char *, unsigned char);}
+\description
+??
+\seealso{??}
+\done
+
+\function{int SLang_guess_type (char *);}
+\synopsis{??}
+\usage{int SLang_guess_type (char *);}
+\description
+??
+\seealso{??}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/cslang.tm Added

@@ -0,0 +1,2331 @@
+#c -*- mode: tm; mode: fold -*-
+
+#c text-macro definitions #%{{{
+#i linuxdoc.tm
+#i local.tm
+
+#d function#1 \sect{<bf>$1</bf>\label{$1}}<descrip>
+#d variable#1 \sect{<bf>$1</bf>\label{$1}}<descrip>
+#d synopsis#1 <tag> Synopsis </tag> $1
+#d keywords#1 <tag> Keywords </tag> $1
+#d usage#1 <tag> Usage </tag> <tt>$1</tt>
+#d description <tag> Description </tag>
+#d example <tag> Example </tag>
+#d notes <tag> Notes </tag>
+#d seealso#1 <tag> See Also </tag> <tt>$1</tt>
+#d done </descrip>
+
+#d proto#1 \tag{\tt{$1}}
+#d documentstyle book
+
+#d SLinterface#1 \bf{$1}
+
+#d SLsmg \SLinterface{SLsmg}
+#d SLtt \SLinterface{SLtt}
+#d SLsearch \SLinterface{SLsearch}
+#%}}}
+
+\linuxdoc
+
+\begin{\documentstyle}
+
+#d DocTitle \slang-library-programmers-guide
+\title \DocTitle (\docversion)
+\author John E. Davis <www.jedsoft.org>
+\date \__today__
+
+\toc
+
+#i preface.tm
+
+\chapter{Introduction} #%{{{
+
+ \slang is a C programmer's library that includes routines for the rapid
+ development of sophisticated, user friendly, multi-platform applications.
+ The \slang library includes the following:
+
+\begin{itemize}
+\item Low level tty input routines for reading single characters at a time.
+\item Keymap routines for defining keys and manipulating multiple keymaps.
+\item A high-level keyprocessing interface (\verb{SLkp}) for
+ handling function and arrow keys.
+\item High level screen management routines for manipulating both
+ monochrome and color terminals. These routines are \em{very}
+ efficient. (\tt{SLsmg})
+\item Low level terminal-independent routines for manipulating the display
+ of a terminal. (\tt{SLtt})
+\item Routines for reading single line input with line editing and recall
+ capabilities. (\tt{SLrline})
+\item Searching functions: both ordinary searches and regular expression
+ searches. (\tt{SLsearch})
+\item An embedded stack-based language interpreter with a C-like syntax.
+\end{itemize}
+
+ The library is currently available for OS/2, MSDOS, Unix, and VMS
+ systems. For the most part, the interface to library routines has
+ been implemented in such a way that it appears to be platform
+ independent from the point of view of the application. In addition,
+ care has been taken to ensure that the routines are ``independent''
+ of one another as much as possible. For example, although the
+ keymap routines require keyboard input, they are not tied to
+ \slang's keyboard input routines--- one can use a different keyboard
+ \verb{getkey} routine if one desires. This also means that linking
+ to only part of the \slang library does not pull the whole library
+ into the application. Thus, \slang applications tend to be
+ relatively small in comparison to programs that use libraries with
+ similar capabilities.
+
+#%}}}
+
+\chapter{Error Handling} #%{{{
+
+ Many of the \slang functions return 0 upon success or -1 to signify
+ failure. Other functions may return \NULL to indicate failure. In
+ addition, upon failure, many will set the error state of the library
+ to a value that indicates the nature of the error. The value of this
+ state may be queried via the \cfun{SLang_get_error} function. This
+ function will return 0 to indicate that there is no error, or a
+ non-zero value such as one of the following constants:
+#v+
+ SL_Any_Error SL_Index_Error
+ SL_OS_Error SL_Parse_Error
+ SL_Malloc_Error SL_Syntax_Error
+ SL_IO_Error SL_DuplicateDefinition_Error
+ SL_Write_Error SL_UndefinedName_Error
+ SL_Read_Error SL_Usage_Error
+ SL_Open_Error SL_Application_Error
+ SL_RunTime_Error SL_Internal_Error
+ SL_InvalidParm_Error SL_NotImplemented_Error
+ SL_TypeMismatch_Error SL_LimitExceeded_Error
+ SL_UserBreak_Error SL_Forbidden_Error
+ SL_Stack_Error SL_Math_Error
+ SL_StackOverflow_Error SL_DivideByZero_Error
+ SL_StackUnderflow_Error SL_ArithOverflow_Error
+ SL_ReadOnly_Error SL_ArithUnderflow_Error
+ SL_VariableUninitialized_Error SL_Domain_Error
+ SL_NumArgs_Error SL_Data_Error
+ SL_Unknown_Error SL_Unicode_Error
+ SL_Import_Error SL_InvalidUTF8_Error
+#v-
+ For example, if a function tries to allocate memory but fails, then
+ \cfun{SLang_get_error} will return \var{SL_Malloc_Error}.
+
+ If the application makes use of the interpreter, then it is
+ important that application-specific functions called from the
+ interpreter set the error state of the library in order for
+ exception handling to work. This may be accomplished using the
+ \cfun{SLang_set_error} function, e.g.,
+#v+
+ if (NULL == (fp = fopen (file, "r")))
+ SLang_set_error (SL_Open_Error);
+#v-
+
+ Often it is desirable to give error message that contains more
+ information about the error. The \cfun{SLang_verror} function may
+ be used for this purpose:
+#v+
+ if (NULL == (fp = fopen (file, "r")))
+ SLang_verror (SL_Open_Error, "Failed to open %s: errno=%d",
+ file, errno);
+#v-
+ By default, \cfun{SLang_verror} will write the error message to
+ \var{stderr}. For applications that make use of the \SLsmg routines
+ it is probably better for the error message to be printed to a
+ specific area of the display. The \var{SLang_Error_Hook} variable
+ may be used to redirect error messages to an application defined
+ function, e.g.,
+#v+
+ static void write_error (char *err)
+ {
+ SLsmg_gotorc (0, 0);
+ SLsmg_set_color (ERROR_COLOR);
+ SLsmg_write_string (err);
+ }
+ int main (int argc, char **argv)
+ {
+ /* Redirect error messages to write_error */
+ SLang_Error_Hook = write_error;
+ .
+ .
+ }
+#v-
+
+ Under extremely rare circumstances the library will call the C
+ \cfun{exit} function causing the application to exit. This will
+ happen if the \cfun{SLtt_get_terminfo} is called but the terminal is
+ not sufficiently powerful. If this behavior is undesirable, then
+ another function exists (\cfun{SLtt_initialize}) that returns an
+ error code. The other times the library will exit are when the
+ interpreter is called upon to do something but has not been properly
+ initialized by the application. Such a condition is regarded as
+ misuse of the libary and should be caught by routine testing of the
+ application during development. In any case, when the library does
+ call the exit function, it will call an application-defined exit
+ hook specified by the SLang_Exit_Error_Hook variable:
+#v+
+ static int exit_error_hook (char *fmt, va_list ap)
+ {
+ fprintf (stderr, "Fatal Error. Reason:");
+ vfprintf (stderr, fmt, va_list);
+ }
+ int main (int argc, char **argv)
+ {
+ SLang_Exit_Error_Hook = exit_error_hook;
+ .
+ .
+ }
+#v-
+ The idea is that the hook can be used to perform some cleanup, free
+ resources, and other tasks that the application needs to do for a
+ clean exit.
+
+#%}}}
+
+\chapter{Unicode Support} #%{{{
+
+ \slang has native support for the UTF-8 encoding of unicode in a
+ number of its interfaces including the the \SLsmg screen mangement
+ interface as well as the interpreter. UTF-8 is a variable length
+ multibyte encoding where unicode characters are represented by one
+ to six bytes. A technical description of the UTF-encoding is beyond
+ the scope of this document, and as such the reader is advised to
+ look elsewhere for a more detailed specification of the encoding.
+
+ By default, the library's handling of UTF-8 is turned off. It may
+ be enabled by a call to the \ifun{SLutf8_enable} function:
+#v+
+ int SLutf8_enable (int mode)
+#v-
+ If the value of \exmp{mode} is 1, then the library will be put in
+ UTF-8 mode. If the value of \exmp{mode} is 0, then the library will
+ be initialized with UTF-8 support disabled. If the value is -1,
+ then the mode will determined through an OS-dependent manner, e.g.,
+ for Unix, the standard locale mechanism will be used. The return
+ value of this function will be 1 if UTF-8 support was activated, or
+ 0 if not.
+
+ The above function determines the UTF-8 state of the library as a
+ whole. For some purposes it may be desirable to have more
+ fine-grained control of the UTF-8 support. For example, one might
+ be using the \jed editor to view a UTF-8 encoded file but
+ the terminal associated with the editor may not support UTF-8. In
+ such a case, one would want the \SLsmg interface to be in UTF-8 mode
+ but lower-level \SLtt interface to not be in UTF-8 mode. Hence, the
+ following activation functions are also provided:
+#v+
+ int SLsmg_utf8_enable (int mode);
+ int SLtt_utf8_enable (int mode);
+ int SLinterp_utf8_enable (int mode);
+#v-
+
+ Note that once one of these interface specific functions has been
+ called, any further calls to the umbrella function
+ \cfun{SLutf8_enable} will have no effect on that interface. For
+ this reason, it is best to call \cfun{SLutf8_enable} first before
+ the calling one of the interface-specific functions.
+
+ Until support for Unicode is more widespread among users, it is
+ expected that most users will still be using a national character
+ set such as ASCII or iso-8869-1. For example, iso-8869-1 is a very
+ widespread character set used on Usenet. As a result, applications
+ will still have to provide support for such character sets.
+ Unfortunately there appears to be no best way to do this.
+
+ For the most part, the UTF-8 support should be largely transparent
+ to the user. For example, the interpreter treats all multibyte
+ characters as a single character which means that the user does not
+ have to be concerned about the internal representation of a
+ character. Rather one must keep in mind the distinction between a
+ character and a byte.
+
+#%}}}
+
+\chapter{Interpreter Interface} #%{{{
+
+ The \slang library provides an interpreter that when embedded into
+ an application, makes the application extensible. Examples of
+ programs that embed the interpreter include the \jed editor and the
+ \slrn newsreader.
+
+ Embedding the interpreter is easy. The hard part is to decide what
+ application specific built-in or intrinsic functions should be
+ provided by the application. The \slang library provides some
+ pre-defined intrinsic functions, such as string processing
+ functions, and simple file input-output routines. However, the
+ basic philosophy behind the interpreter is that it is not a
+ standalone program and it derives much of its power from the
+ application that embeds it.
+
+\sect{Embedding the Interpreter} #%{{{
+
+ Only one function needs to be called to embed the \slang interpreter
+ into an application: \cfun{SLang_init_slang}. This function
+ initializes the interpreter's data structures and adds some intrinsic
+ functions:
+#v+
+ if (-1 == SLang_init_slang ())
+ exit (EXIT_FAILURE);
+#v-
+ This function does not provide file input output intrinsic nor does
+ it provide mathematical functions. To make these as well as some
+ posix system calls available use
+#v+
+ if ((-1 == SLang_init_slang ()) /* basic interpreter functions */
+ || (-1 == SLang_init_slmath ()) /* sin, cos, etc... */
+ || (-1 == SLang_init_array ()) /* sum, min, max, transpose... */
+ || (-1 == SLang_init_stdio ()) /* stdio file I/O */
+ || (-1 == SLang_init_ospath ()) /* path_concat, etc... */
+ || (-1 == SLang_init_posix_dir ()) /* mkdir, stat, etc. */
+ || (-1 == SLang_init_posix_process ()) /* getpid, umask, etc. */
+ || (-1 == SLang_init_posix_io ()) /* open, close, read, ... */
+ || (-1 == SLang_init_signal ()) /* signal, alarm, ... */
+ )
+ exit (EXIT_FAILURE);
+#v-
+ If you intend to enable all intrinsic functions, then it is simpler
+ to initialize the interpreter via
+#v+
+ if (-1 == SLang_init_all ())
+ exit (EXIT_FAILURE);
+#v-
+ See the \bf{\slang-intrinsic-function-reference} for more information about the
+ intrinsic functions.
+
+#%}}}
+
+\sect{Calling the Interpreter} #%{{{
+
+ There are several ways of calling the interpreter. The two most common
+ method is to load a file containing \slang code, or to load a
+ string.
+
+\sect1{Loading Files}
+ The \cfun{SLang_load_file} and \cfun{SLns_load_file} functions may
+ be used to interpret a file. Both these functions return zero if
+ successful, or \-1 upon failure. If either of these functions fail,
+ the interpreter will accept no more code unless the error state is
+ cleared. This is done by calling \cfun{SLang_restart} function to
+ set the interpreter to its default state:
+#v+
+ if (-1 == SLang_load_file ("site.sl"))
+ {
+ /* Clear the error and reset the interpreter */
+ SLang_restart (1);
+ }
+#v-
+
+ When a file is loaded via \cfun{SLang_load_file}, any non-public
+ variables and functions defined in the file will be placed into a
+ namespace that is local to the file itself. The
+ \cfun{SLns_load_file} function may be used to load a file using a
+ specified namespace, e.g.,
+#v+
+ if (-1 == SLns_load_file ("site.sl", "NS"))
+ {
+ SLang_restart (1);
+ SLang_set_error (0);
+ }
+#v-
+ will load \exfile{site.sl} into a namespace called \exns{NS}. If such a
+ namespace does not exist, then it will be created.
+
+ Both the \cfun{SLang_load_file} and \cfun{SLns_load_file} functions
+ search for files along an application-specified search path. This
+ path may be set using the \cfun{SLpath_set_load_path} function, as
+ well as from interpeted code via the \ifun{set_slang_load_path}
+ function. By default, no search path is defined.
+
+ \bf{
+ NOTE: It is highly recommended that an application embedding the
+ interpreter include the \slsh lib directory in the search path. The
+ \exfile{.sl} files that are part of \slsh are both useful and
+ and should work with any application embedding the interpreter.
+ Moreover, if the application permits dynamically loaded modules,
+ then there are a growing number of excellent quality modules for
+ \slsh that can be utilized by it. Applications that follow this
+ recommendation are said to be conforming.
+ }
+
+ Files are searched as follows: If the name begins with the
+ equivalent of \exstr{./} or \exstr{../}, then it is searched for
+ with respect to the current directory, and not along the load-path.
+ If no such file exists, then an error will be generated. Otherwise,
+ the file is searched for in each of the directories of the load-path
+ by concatenating the path element with the specified file name. The
+ first such file found to exist by this process will be loaded. If a
+ matching file still has not been found, and the file name lacks an
+ extension, then the path is searched with \exstr{.sl} and
+ \exstr{.slc} appended to the filename. If two such files are found
+ (one ending with \exstr{.sl} and the other with \exstr{.slc}), then
+ the more recent of the two will be used. If no matching file has
+ been found by this process, then the search will cease and an error
+ generated.
+
+ The search path is a delimiter separated list of directories that
+ specify where the interpreter looks for files. By default, the
+ value of the delimiter is OS-dependent following the convention of
+ the underlying OS. For example, on Unix the delimiter is
+ represented by a colon, on DOS/Windows it is a semi-colon, and on
+ VMS it is a space. The \cfun{SLpath_set_delimiter} and
+ \cfun{SLpath_get_delimiter} may be used to set and query the
+ delimiter's value, respectively.
+
+\sect1{Loading Strings}
+ There are several other mechanisms for interacting with the
+ interpreter. For example, the \cfun{SLang_load_string} function
+ loads a string into the interpreter and interprets it:
+#v+
+ if (-1 == SLang_load_string ("message (\"hello\");"))
+ return;
+#v-
+ Similarly, the \cfun{SLns_load_string} function may be used to load
+ a string into a specified namespace.
+
+ Typically, an interactive application will load a file via
+ \cfun{SLang_load_file} and then go into a loop that consists of
+ reading lines of input and sending them to the interpreter, e.g.,
+#v+
+ while (EOF != fgets (buf, sizeof (buf), stdin))
+ {
+ if (-1 == SLang_load_string (buf))
+ {
+ SLang_restart (1);
+ }
+ }
+#v-
+
+ Finally, some applications such as \jed and \slrn use another method of
+ interacting with the interpreter. They read key sequences from the
+ keyboard and map those key sequences to interpreter functions via
+ the \slang keymap interface.
+
+#%}}}
+
+\sect{Intrinsic Functions} #%{{{
+
+ An intrinsic function is simply a function that is written in C and
+ is made available to the interpreter as a built-in function. For
+ this reason, the words `intrinsic' and `built-in' are often used
+ interchangeably.
+
+ Applications are expected to add application specific functions to
+ the interpreter. For example, \jed adds nearly 300 editor-specific
+ intrinsic functions. The application designer should think
+ carefully about what intrinsic functions to add to the interpreter.
+
+\sect1{Restrictions on Intrinsic Functions} #%{{{
+
+ When implementing intrinsic functions, it is necessary to follow a
+ few rules to cooperate with the interpreter.
+
+ The C version of an intrinsic function takes only pointer arguments.
+ This is because when the interpreter calls an intrinsic function, it
+ passes values to the function by reference and \em{not} by value. For
+ example, intrinsic with the declarations:
+#v+
+ int intrinsic_0 (void);
+ int intrinsic_1 (char *s);
+ void intrinsic_2 (char *s, int *i);
+ void intrinsic_3 (int *i, double *d, double *e);
+#v-
+ are all valid. However,
+#v+
+ int invalid_1 (char *s, int len);
+#v-
+ is not valid since the \var{len} parameter is not a pointer.
+
+ The return value of an intrinsic function must be one of the
+ following types: \var{void}, \var{char}, \var{short}, \var{int},
+ \var{long}, \var{double}, \var{char *}, as well as unsigned versions
+ of the integer types. A function such as
+#v+
+ int *invalid (void);
+#v-
+ is not permitted since \var{int*} is not a valid return-type for an
+ intrinsic function. Any other type of value can be passed back to
+ the interpreter by explicitly pushing the object onto the
+ interpreter's stack via the appropriate "push" function.
+
+ The current implementation limits the number of arguments of an
+ intrinsic function to \exmp{7}. The "pop" functions can be used to
+ allow the function to take an arbitrary number as seen from an
+ interpreter script.
+
+ Another restriction is that the intrinsic function should regard all its
+ parameters as pointers to constant objects and make no attempt to
+ modify the value to which they point. For example,
+#v+
+ void truncate (char *s)
+ {
+ s0 = 0;
+ }
+#v-
+ is illegal since the function modifies the string \var{s}.
+
+#%}}}
+
+\sect1{Adding a New Intrinsic} #%{{{
+
+ There are two basic mechanisms for adding an intrinsic function to the
+ interpreter: \cfun{SLadd_intrinsic_function} and
+ \cfun{SLadd_intrin_fun_table}. Functions may be added to a specified
+ namespace via \cfun{SLns_add_intrinsic_function} and
+ \cfun{SLns_add_intrin_fun_table} functions.
+
+ As an specific example, consider a function that will cause the
+ program to exit via the \var{exit} C library function. It is not
+ possible to make this function an intrinsic because it does not meet
+ the specifications for an intrinsic function that were described
+ earlier. However, one can call \var{exit} from a function that is
+ suitable, e.g.,
+#v+
+ void intrin_exit (int *code)
+ {
+ exit (*code);
+ }
+#v-
+ This function may be made available to the interpreter as an
+ intrinsic via the \cfun{SLadd_intrinsic_function} routine:
+#v+
+ if (-1 == SLadd_intrinsic_function ("exit", (FVOID_STAR) intrin_exit,
+ SLANG_VOID_TYPE, 1,
+ SLANG_INT_TYPE))
+ exit (EXIT_FAILURE);
+#v-
+ This statement basically tells the interpreter that
+ \var{intrin_exit} is a function that returns nothing and takes a
+ single argument: a pointer to an integer (\var{SLANG_INT_TYPE}).
+ A user can call this function from within the interpreter
+ via
+#v+
+ message ("Calling the exit function");
+ exit (0);
+#v-
+ After printing a message, this will cause the \var{intrin_exit}
+ function to execute, which in turn calls \var{exit}.
+
+ The most convenient mechanism for adding new intrinsic functions is
+ to create a table of \cfun{SLang_Intrin_Fun_Type} objects and add the
+ table via the \cfun{SLadd_intrin_fun_table} function. The table will
+ look like:
+#v+
+ SLang_Intrin_Fun_Type My_Intrinsics =
+ {
+ /* table entries */
+ MAKE_INTRINSIC_N(...),
+ MAKE_INTRINSIC_N(...),
+ .
+ .
+ MAKE_INTRINSIC_N(...),
+ SLANG_END_INTRIN_FUN_TABLE
+ };
+#v-
+ Construction of the table entries may be facilitated using a set of
+ \var{MAKE_INTRINSIC} macros defined in \var{slang.h}. The main
+ macro is called \var{MAKE_INTRINSIC_N} and takes 11 arguments:
+#v+
+ MAKE_INTRINSIC_N(name, funct-ptr, return-type, num-args,
+ arg-1-type, arg-2-type, ... arg-7-type)
+#v-
+ Here \var{name} is the name of the intrinsic function that the
+ interpreter is to give to the function. \var{func-ptr} is a pointer
+ to the intrinsic function taking \var{num-args} and returning
+ \var{ret-type}. The final \exmp{7} arguments specify the argument
+ types. For example, the \var{intrin_exit} intrinsic described above
+ may be added to the table using
+#v+
+ MAKE_INTRINSIC_N("exit", intrin_exit, SLANG_VOID_TYPE, 1,
+ SLANG_INT_TYPE, 0,0,0,0,0,0)
+#v-
+
+ While \var{MAKE_INTRINSIC_N} is the main macro for constructing
+ table entries, \var{slang.h} defines other macros that may prove
+ useful. In particular, an entry for the \var{intrin_exit} function
+ may also be created using any of the following forms:
+#v+
+ MAKE_INTRINSIC_1("exit", intrin_exit, SLANG_VOID_TYPE, SLANG_INT_TYPE)
+ MAKE_INTRINSIC_I("exit", intrin_exit, SLANG_VOID_TYPE)
+#v-
+ See \var{slang.h} for related macros. You are also encouraged to
+ look at, e.g., \var{slang/src/slstd.c} for a more extensive examples.
+
+ The table may be added via the \cfun{SLadd_intrin_fun_table}
+ function, e.g.,
+#v+
+ if (-1 == SLadd_intrin_fun_table (My_Intrinsics, NULL))
+ {
+ /* an error occurred */
+ }
+#v-
+ Please note that there is no need to load a given table more than
+ once, and it is considered to be an error on the part of the
+ application it adds the same table multiple times. For performance
+ reasons, no checking is performed by the library to see if a table
+ has already been added.
+
+ Earlier it was mentioned that intrinsics may be added to a specified
+ namespace. To this end, one must first get a pointer to the
+ namespace via the \cfun{SLns_create_namespace} function. The
+ following example illustrates how this function is used to add the
+ \var{My_Intrinsics} table to a namespace called \exmp{my}:
+#v+
+ SLang_NameSpace_Type *ns = SLns_create_namespace ("my");
+ if (ns == NULL)
+ return -1;
+
+ return SLns_add_intrin_fun_table (ns, My_Intrinsics, "__MY__"));
+#v-
+
+#%}}}
+
+\sect1{More Complicated Intrinsics} #%{{{
+ The intrinsic functions described in the previous example were
+ functions that took a fixed number of arguments. In this section we
+ explore more complex intrinsics such as those that take a variable
+ number of arguments.
+
+ Consider a function that takes two double precision numbers and
+ returns the lesser:
+#v+
+ double intrin_min (double *a, double *b)
+ {
+ if (*a < *b) return *a;
+ return *b;
+ }
+#v-
+ This function may be added to a table of intrinsics using
+#v+
+ MAKE_INTRINSIC_2("vmin", intrin_min, SLANG_DOUBLE_TYPE,
+ SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE)
+#v-
+ It is useful to extend this function to take an arbitray number of
+ arguments and return the lesser. Consider the following variant:
+#v+
+ double intrin_min_n (int *num_ptr)
+ {
+ double min_value, x;
+ unsigned int num = (unsigned int) *num_ptr;
+
+ if (-1 == SLang_pop_double (&min_value))
+ return 0.0;
+ num--;
+
+ while (num > 0)
+ {
+ num--;
+ if (-1 == SLang_pop_double (&x))
+ return 0.0;
+ if (x < min_value) min_value = x;
+ }
+ return min_value;
+ }
+#v-
+ Here the number to compare is passed to the function and the actual
+ numbers are removed from the stack via the \cfun{SLang_pop_double}
+ function. A suitable table entry for it is
+#v+
+ MAKE_INTRINSIC_I("vmin", intrin_min_n, SLANG_DOUBLE_TYPE)
+#v-
+ This function would be used in an interpreter script via a statement
+ such as
+#v+
+ variable xmin = vmin (x0, x1, x2, x3, x4, 5);
+#v-
+ which computes the smallest of \exmp{5} values.
+
+ The problem with this intrinsic function is that the user must
+ explicitly specify how many numbers to compare. It would be more
+ convenient to simply use
+#v+
+ variable xmin = vmin (x0, x1, x2, x3, x4);
+#v-
+ An intrinsic function can query the value of the variable
+ \var{SLang_Num_Function_Args} to obtain the necessary information:
+#v+
+ double intrin_min (void)
+ {
+ double min_value, x;
+
+ unsigned int num = SLang_Num_Function_Args;
+
+ if (-1 == SLang_pop_double (&min_value, NULL, NULL))
+ return 0.0;
+ num--;
+
+ while (num > 0)
+ {
+ num--;
+ if (-1 == SLang_pop_double (&x, NULL, NULL))
+ return 0.0;
+ if (x < min_value) min_value = x;
+ }
+ return min_value;
+ }
+#v-
+ This may be declared as an intrinsic using:
+#v+
+ MAKE_INTRINSIC_0("vmin", intrin_min, SLANG_DOUBLE_TYPE)
+#v-
+
+#%}}}
+
+#%}}}
+
+\sect{Intrinsic Variables} #%{{{
+
+ It is possible to access an application's global variables from
+ within the interpreter. The current implementation supports the
+ access of variables of type \var{int}, \var{char *}, and
+ \var{double}.
+
+ There are two basic methods of making an intrinsic variable
+ available to the interpreter. The most straight forward method is
+ to use the function \cfun{SLadd_intrinsic_variable}:
+#v+
+ int SLadd_intrinsic_variable (char *name, VOID_STAR addr,
+ SLtype data_type,
+ int read_only);
+#v-
+ For example, suppose that \var{I} is an integer variable, e.g.,
+#v+
+ int I;
+#v-
+ One can make it known to the interpreter as \var{I_Variable} via a
+ statement such as
+#v+
+ if (-1 == SLadd_intrinsic_variable ("I_Variable", &I,
+ SLANG_INT_TYPE, 0))
+ exit (EXIT_FAILURE);
+#v-
+ Similarly, if \var{S} is declared as
+#v+
+ char *S;
+#v-
+ then
+#v+
+ if (-1 == SLadd_intrinsic_variable ("S_Variable", &S,
+ SLANG_STRING_TYPE, 1))
+ exit (EXIT_FAILURE);
+#v-
+ makes \var{S} available as a \em{read-only} variable with the name
+ \var{S_Variable}. Note that if a pointer variable is made available
+ to the interpreter, it should be declared as being \em{read-only} to
+ prevent the interpreter from changing the pointer's value.
+
+ It is important to note that if \var{S} were declared as an array of
+ characters, e.g.,
+#v+
+ char S256;
+#v-
+ then it would not be possible to make it directly available to the
+ interpreter. However, one could create a pointer to it, i.e.,
+#v+
+ char *S_Ptr = S;
+#v-
+ and make \var{S_Ptr} available as a read-only variable.
+
+ One should not make the mistake of trying to use the same address
+ for different variables as the following example illustrates:
+#v+
+ int do_not_try_this (void)
+ {
+ static char *names3 = {"larry", "curly", "moe"};
+ unsigned int i;
+
+ for (i = 0; i < 3; i++)
+ {
+ int value;
+ if (-1 == SLadd_intrinsic_variable (namesi, (VOID_STAR) &value,
+ SLANG_INT_TYPE, 1))
+ return -1;
+ }
+ return 0;
+ }
+#v-
+ Not only does this piece of code create intrinsic variables that use
+ the same address, it also uses the address of a local variable that
+ will go out of scope.
+
+ The most convenient method for adding many intrinsic variables to
+ the interpreter is to create an array of \var{SLang_Intrin_Var_Type}
+ objects and then add the array via \cfun{SLadd_intrin_var_table}.
+ For example, the array
+#v+
+ static SLang_Intrin_Var_Type Intrin_Vars =
+ {
+ MAKE_VARIABLE("I_Variable", &I, SLANG_INT_TYPE, 0),
+ MAKE_VARIABLE("S_Variable", &S_Ptr, SLANG_STRING_TYPE, 1),
+ SLANG_END_TABLE
+ };
+#v-
+ may be added via
+#v+
+ if (-1 == SLadd_intrin_var_table (Intrin_Vars, NULL))
+ exit (EXIT_FAILURE);
+#v-
+ It should be rather obvious that the arguments to the
+ \var{MAKE_VARIABLE} macro correspond to the parameters of the
+ \cfun{SLadd_intrinsic_variable} function.
+
+ Finally, variables may be added to a specific namespace via the
+ SLns_add_intrin_var_table and SLns_add_intrinsic_variable functions.
+
+#%}}}
+
+\sect{Aggregate Data Objects} #%{{{
+ An aggregate data object is an object that can contain more than one
+ data value. The \slang interpreter supports several such objects:
+ arrays, structure, and associative arrays. In the following
+ sections, information about interacting with these objects is given.
+
+\sect1{Arrays} #%{{{
+ An intrinsic function may interact with an array in several different
+ ways. For example, an intrinsic may create an array and return it.
+ The basic functions for manipulating arrays include:
+#v+
+ SLang_create_array
+ SLang_pop_array_of_type
+ SLang_push_array
+ SLang_free_array
+ SLang_get_array_element
+ SLang_set_array_element
+#v-
+ The use of these functions will be illustrated via a few simple
+ examples.
+
+ The first example shows how to create an return an array of strings
+ to the interpreter. In particular, the names of the four seasons of
+ the year will be returned:
+#v+
+ void months_of_the_year (void)
+ {
+ static char *seasons4 =
+ {
+ "Spring", "Summer", "Autumn", "Winter"
+ };
+ SLang_Array_Type *at;
+ SLindex_Type i, four;
+
+ four = 4;
+ at = SLang_create_array (SLANG_STRING_TYPE, 0, NULL, &four, 1);
+ if (at == NULL)
+ return;
+
+ /* Now set the elements of the array */
+ for (i = 0; i < 4; i++)
+ {
+ if (-1 == SLang_set_array_element (at, &i, &seasonsi))
+ {
+ SLang_free_array (at);
+ return;
+ }
+ }
+
+ (void) SLang_push_array (at, 0);
+ SLang_free_array (at);
+ }
+#v-
+
+ This example illustrates several points:
+
+ First of all, the
+ \cfun{SLang_create_array} function was used to create a 1 dimensional
+ array of 4 strings. Since this function could fail, its return value
+ was checked. Also \var{SLindex_Type} was used for the array size and
+ index types. In \slang version 2, \var{SLindex_Type} is typedefed to
+ be an \var{int}. However, as this will change in a future version of
+ the library, \var{SLindex_Type} should be used.
+
+ The \cfun{SLang_set_array_element} function was
+ used to set the elements of the newly created array. Note that the
+ address containing the value of the array element was passed and not
+ the value of the array element itself. That is,
+#v+
+ SLang_set_array_element (at, &i, seasonsi)
+#v-
+ was not used. The return value from this function was also checked
+ because it too could also fail.
+
+ Finally, the array was pushed onto the interpreter's stack and then
+ it was freed. It is important to understand why it was freed. This
+ is because arrays are reference-counted. When the array was created,
+ it was returned with a reference count of \var{1}. When it was
+ pushed, the reference count was bumped up to \var{2}. Then since it
+ was nolonger needed by the function, \cfun{SLang_free_array} was
+ called to decrement the reference count back to \var{1}. For
+ convenience, the second argument to \cfun{SLang_push_array}
+ determines whether or not it is to also free the array. So, instead
+ of the two function calls:
+#v+
+ (void) SLang_push_array (at, 0);
+ SLang_free_array (at);
+#v-
+ it is preferable to combine them as
+#v+
+ (void) SLang_push_array (at, 1);
+#v-
+
+ The second example returns a diagonal array of a specified size to
+ the stack. A diagonal array is a 2-d array with all elements zero
+ except for those along the diagonal, which have a value of one:
+#v+
+ void make_diagonal_array (SLindex_Type n)
+ {
+ SLang_Array_Type *at;
+ SLindex_Type dims2;
+ SLindex_Type i, one;
+
+ dims0 = dims1 = n;
+ at = SLang_create_array (SLANG_INT_TYPE, 0, NULL, dims, 2);
+ if (at == NULL)
+ return;
+
+ one = 1;
+ for (i = 0; i < n; i++)
+ {
+ dims0 = dims1 = i;
+ if (-1 == SLang_set_array_element (at, dims, &one))
+ {
+ SLang_free_array (at);
+ return;
+ }
+ }
+
+ (void) SLang_push_array (at, 1);
+ }
+#v-
+ In this example, only the diagonal elements of the array were set.
+ This is bacause when the array was created, all its elements were
+ set to zero.
+
+ Now consider an example that acts upon an existing array. In
+ particular, consider one that computes the trace of a 2-d matrix,
+ i.e., the sum of the diagonal elements:
+#v+
+ double compute_trace (void)
+ {
+ SLang_Array_Type *at;
+ double trace;
+ SLindex_Type dims2;
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_DOUBLE_TYPE))
+ return 0.0;
+
+ /* We want a 2-d square matrix. If the matrix is 1-d and has only one
+ element, then return that element. */
+ trace = 0.0;
+ if (((at->num_dims == 1) && (at->dims0 == 1))
+ || ((at->num_dims == 2) && (at->dims0 == at->dims1)))
+ {
+ double dtrace;
+ SLindex_Type n = at->dims0;
+
+ for (i = 0; i < n; i++)
+ {
+ dims0 = dims1 = i;
+ (void) SLang_get_array_element (at, &dims, &dtrace);
+ trace += dtrace;
+ }
+ }
+ else SLang_verror (SL_TYPE_MISMATCH, "Expecting a square matrix");
+
+ SLang_free_array (at);
+ return trace;
+ }
+#v-
+ In this example, \cfun{SLang_pop_array_of_type} was used to pop an
+ array of doubles from the stack. This function will make implicit
+ typecasts in order to return an array of the requested type.
+
+#%}}}
+
+\sect1{Structures} #%{{{
+
+ For the purposes of this section, we shall differentiate structures
+ according to whether or not they correspond to an application defined
+ C structure. Those that do are called intrinsic structures, and
+ those do not are called \slang interpreter structures.
+
+\sect2{Interpreter Structures}
+
+ The following simple example shows one method that may be used to
+ create and return a structure with a string and integer field to the
+ interpreter's stack:
+#v+
+ int push_struct_example (char *string_value, int int_value)
+ {
+ char *field_names2;
+ SLtype field_types2;
+ VOID_STAR field_values2;
+
+ field_names0 = "string_field";
+ field_types0 = SLANG_STRING_TYPE;
+ field_values0 = &string_value;
+
+ field_names1 = "int_field";
+ field_types1 = SLANG_INT_TYPE;
+ field_values1 = &int_value;
+
+ if (-1 == SLstruct_create_struct (2, field_names,
+ field_types, field_values))
+ return -1;
+ return 0;
+ }
+#v-
+ Here, \cfun{SLstruct_create_struct} is used to push a
+ structure with the specified field names and values onto the
+ interpreter's stack.
+
+ A simpler mechanism exists provided that one has already defined a C
+ structure with a description of how the structure is laid out. For
+ example, consider a C structure defined by
+#v+
+ typedef struct
+ {
+ char *s;
+ int i;
+ }
+ SI_Type;
+#v-
+ Its layout may be specified via a table of
+ \var{SLang_CStruct_Field_Type} entries:
+#v+
+ SLang_CStruct_Field_Type SI_Type_Layout =
+ {
+ MAKE_CSTRUCT_FIELD(SI_Type, s, "string_field", SLANG_STRING_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(SI_Type, i, "int_field", SLANG_INT_TYPE, 0),
+ SLANG_END_CSTRUCT_TABLE
+ };
+#v-
+ Here, MAKE_CSTRUCT_FIELD is a macro taking 5 arguments:
+#v+
+ MAKE_CSTRUCT_FIELD(C-structure-type,
+ C-field-name,
+ slang-field-name,
+ slang-data-type,
+ is-read-only)
+#v-
+ The first argument is the structure type, the second is the name of
+ a field of the structure, the third is a string that specifies the
+ name of the corresponding field of the \slang structure, the fourth
+ argument specifies the field's type, and the last argument
+ specifies whether or not the field should be regarded as read-only.
+
+ Once the layout of the structure has been specified, pushing a
+ \slang version of the structure is trival:
+#v+
+ int push_struct_example (char *string_value, int int_value)
+ {
+ SI_Type si;
+
+ si.s = string_value;
+ si.i = int_value;
+ return SLang_push_cstruct ((VOID_STAR)&si, SI_Type_Layout);
+ }
+#v-
+
+ This mechanism of structure creation also permits a \slang
+ structure to be passed to an intrinsic function through the use of
+ the SLang_pop_cstruct routine, e.g.,
+#v+
+ void print_si_struct (void)
+ {
+ SI_Type si;
+ if (-1 == SLang_pop_cstruct ((VOID_STAR)&si, SI_Type_Layout))
+ return;
+ printf ("si.i=%d", si.i);
+ printf ("si.s=%s", si.s);
+ SLang_free_cstruct ((VOID_STAR)&si, SI_Type_Layout);
+ }
+#v-
+ Assuming \exmp{print_si_struct} exists as an intrinsic function,
+ the \slang code
+#v+
+ variable s = struct {string_field, int_field};
+ s.string_field = "hello";
+ s.int_field = 20;
+ print_si_struct (s);
+#v-
+ would result in the display of
+#v+
+ si.i=20;
+ si.s=hello
+#v-
+ Note that the \cfun{SLang_free_cstruct} function was called after
+ the contents of \exmp{si} were nolonger needed. This was necessary
+ because \cfun{SLang_pop_cstruct} allocated memory to set the
+ \exmp{char *s} field of \exmp{si}. Calling
+ \cfun{SLang_free_cstruct} frees up such memory.
+
+ Now consider the following:
+#v+
+ typedef struct
+ {
+ pid_t pid;
+ gid_t group;
+ }
+ X_t;
+#v-
+ How should the layout of this structure be defined? One might be
+ tempted to use:
+#v+
+ SLang_CStruct_Field_Type X_t_Layout =
+ {
+ MAKE_CSTRUCT_FIELD(X_t, pid, "pid", SLANG_INT_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(X_t, group, "group", SLANG_INT_TYPE, 0),
+ SLANG_END_CSTRUCT_TABLE
+ };
+#v-
+ However, this assumes \exmp{pid_t} and \exmp{gid_t} have been
+ typedefed as ints. But what if \exmp{gid_t} is a \exmp{short}? In
+ such a case, using
+#v+
+ MAKE_CSTRUCT_FIELD(X_t, group, "group", SLANG_SHORT_TYPE, 0),
+#v-
+ would be the appropriate entry for the \exmp{group} field. Of
+ course, one has no way of knowing how \exmp{gid_t} is declared on
+ other systems. For this reason, it is preferable to use the
+ \var{MAKE_CSTRUCT_INT_FIELD} macro in cases involving integer valued
+ fields, e.g.,
+#v+
+ SLang_CStruct_Field_Type X_t_Layout =
+ {
+ MAKE_CSTRUCT_INT_FIELD(X_t, pid, "pid", 0),
+ MAKE_CSTRUCT_INT_FIELD(X_t, group, "group", 0),
+ SLANG_END_CSTRUCT_TABLE
+ };
+#v-
+
+ Before leaving this section, it is important to mention that
+ access to character array fields is not permitted via this
+ interface. That is, a structure such as
+#v+
+ typedef struct
+ {
+ char name32;
+ }
+ Name_Type;
+#v-
+ is not supported since \exmp{char name32} is not a
+ \var{SLANG_STRING_TYPE} object. Always keep in mind that a
+ \var{SLANG_STRING_TYPE} object is a \exmp{char *}.
+
+\sect2{Intrinsic Structures}
+
+ Here we show how to make intrinsic structures available to
+ the interpreter.
+
+ The simplest interface is to structure pointers and not
+ to the actual structures themselves. The latter would require the
+ interpreter to be involved with the creation and destruction of the
+ structures. Dealing with the pointers themselves is far simpler.
+
+ As an example, consider an object such as
+#v+
+ typedef struct _Window_Type
+ {
+ char *title;
+ int row;
+ int col;
+ int width;
+ int height;
+ } Window_Type;
+#v-
+ which defines a window object with a title, size (\var{width},
+ \var{height}), and location (\var{row}, \var{col}).
+
+ We can make variables of type \var{Window_Type} available to the
+ interpreter via a table as follows:
+#v+
+ static SLang_IStruct_Field_Type Window_Type_Field_Table =
+ {
+ MAKE_ISTRUCT_FIELD(Window_Type, title, "title", SLANG_STRING_TYPE, 1),
+ MAKE_ISTRUCT_FIELD(Window_Type, row, "row", SLANG_INT_TYPE, 0),
+ MAKE_ISTRUCT_FIELD(Window_Type, col, "col", SLANG_INT_TYPE, 0),
+ MAKE_ISTRUCT_FIELD(Window_Type, width, "width", SLANG_INT_TYPE, 0),
+ MAKE_ISTRUCT_FIELD(Window_Type, height, "height", SLANG_INT_TYPE, 0),
+ SLANG_END_ISTRUCT_TABLE
+ };
+#v-
+ More precisely, this defines the layout of the \var{Window_Type} structure.
+ Here, the \var{title} has been declared as a read-only field. Using
+#v+
+ MAKE_ISTRUCT_FIELD(Window_Type, title, "title", SLANG_STRING_TYPE, 0),
+#v-
+ would allow read-write access.
+
+ Now suppose that \var{My_Window} is a pointer to a \var{Window_Type}
+ object, i.e.,
+#v+
+ Window_Type *My_Window;
+#v-
+ We can make this variable available to the interpreter via the
+ \cfun{SLadd_istruct_table} function:
+#v+
+ if (-1 == SLadd_istruct_table (Window_Type_Field_Table,
+ (VOID_STAR) &My_Window,
+ "My_Win"))
+ exit (1);
+#v-
+ This creates a S-Lang interpreter variable called \var{My_Win} whose value
+ corresponds to the \var{My_Win} structure. This would permit one to
+ access the fields of \var{My_Window} via \slang statements such as
+#v+
+ define set_width_and_height (w,h)
+ {
+ My_Win.width = w;
+ My_Win.height = h;
+ }
+#v-
+
+ It is extremely important to understand that the interface described in
+ this section does not allow the interpreter to create new instances of
+ \var{Window_Type} objects. The interface merely defines an association or
+ correspondence between an intrinsic structure pointer and a \slang
+ variable. For example, if the value of \var{My_Window} is \var{NULL}, then
+ \var{My_Win} would also be \var{NULL}.
+
+ One should be careful in allowing read/write access to character string
+ fields. If read/write access is allowed, then the application should
+ always use the \cfun{SLang_create_slstring} and \cfun{SLang_free_slstring}
+ functions to set the character string field of the structure.
+
+#%}}}
+
+#%}}}
+
+\sect{Signals} #%{{{
+
+ If your program that embeds the interpreter processes signals, then
+ it may be undesirable to allow access to all signals from the
+ interpreter. For example, if your program has a signal handler for
+ \ivar{SIGHUP} then it is possible that an interpreter script could
+ specify a different signal handler, which may or may not be desirable.
+ If you do not want to allow the interpreter access to some signal,
+ then that signal can be made off-limits to the interpreter via the
+ \cfun{SLsig_forbid_signal} function:
+#v+
+ /* forbid a signal handler for SIGHUP */
+ SLsig_forbid_signal (SIGHUP, 1);
+
+ /* Allow a signal handler for SIGTERM */
+ SLsig_forbid_signal (SIGTERM, 0);
+#v-
+
+ By default, all signals are allowed access from the interpreter.
+
+#%}}}
+
+\sect{Exceptions}
+#%}}}
+
+\chapter{Keyboard Interface} #%{{{
+
+#%{{{ Overview
+
+ \slang's keyboard interface has been designed to allow an
+ application to read keyboard input from the user in a
+ system-independent manner. The interface consists of a set of low
+ routines for reading single character data as well as a higher
+ level interface (\grp{SLkp}) which utilize \slang's keymap facility
+ for reading multi-character sequences.
+
+ To initialize the interface, one must first call the function
+ \verb{SLang_init_tty}. Before exiting the program, the function
+ \verb{SLang_reset_tty} must be called to restore the keyboard
+ interface to its original state. Once initialized, the low-level
+ \verb{SLang_getkey} function may be used to read \em{single}
+ keyboard characters from the terminal. An application using the
+ higher-level \grp{SLkp} interface will read charcters using the
+ \verb{SLkp_getkey} function.
+
+ In addition to these basic functions, there are also functions to
+ ``unget'' keyboard characters, flush the input, detect pending-input
+ with a timeout, etc. These functions are defined below.
+
+#%}}}
+
+\sect{Initializing the Keyboard Interface} #%{{{
+
+ The function \verb{SLang_init_tty} must be called to initialize the
+ terminal for single character input. This puts the terminal in a mode
+ usually referred to as ``raw'' mode.
+
+ The prototype for the function is:
+#v+
+ int SLang_init_tty (int abort_char, int flow_ctrl, int opost);
+#v-
+ It takes three parameters that are used to specify how the terminal is to
+ be initialized.
+#%+
+ Although the \slang keyboard interface has been
+ %designed to be as system independent as possible, there are semantic
+ % differences.
+#%-
+
+ The first parameter, \verb{abort_char}, is used to specify the interrupt
+ character (\tt{SIGINT}). Under MSDOS, this value corresponds to the scan
+ code of the character that will be used to generate the interrupt. For
+ example, under MSDOS, \verb{34} should be used to make \key{Ctrl-G} generate an
+ interrupt signal since 34 is the scan code for \key{G}. On other
+ systems, the value of \verb{abort_char} will simply be the ascii value of
+ the control character that will be used to generate the interrupt signal,
+ e.g., \tt{7} for \key{Ctrl-G}. If \verb{-1} is passed, the interrupt
+ character will not be changed.
+
+ Pressing the interrupt character specified by the first argument will
+ generate a signal (\tt{SIGINT}) that may or not be caught by the
+ application. It is up to the application to catch this signal. \slang
+ provides the function \verb{Slang_set_abort_signal} to make it easy to
+ facilitate this task.
+
+ The second parameter is used to specify whether or not flow control
+ should be used. If this parameter is zero, flow control is enabled.
+ If the value is positive, flow control will be disabled. Disabling
+ flow control is necessary to pass certain characters to the
+ application (e.g., \key{Ctrl-S} and \key{Ctrl-Q}). Otherwise, the
+ value is negative and the flow control behavior will be inherited
+ from the terminal. The latter interpretation was added to version
+ 2.3.0 of the library; earlier versions disabled flow control for
+ both positive and negative values of this parameter. For some
+ systems such as MSDOS, this parameter is meaningless.
+
+ The third parameter, \verb{opost}, is used to turn output processing on or
+ off. If \verb{opost} is zero, output processing is \em{not} turned on
+ otherwise, output processing is turned on.
+
+ The \verb{SLang_init_tty} function returns -1 upon failure. In addition,
+ after it returns, the \slang global variable \verb{SLang_TT_Baud_Rate}
+ will be set to the baud rate of the terminal if this value can be
+ determined.
+
+ Example:
+#v+
+ if (-1 == SLang_init_tty (7, 0, 0)) /* For MSDOS, use 34 as scan code */
+ {
+ fprintf (stderr, "Unable to initialize the terminal.\n");
+ exit (1);
+ }
+ SLang_set_abort_signal (NULL);
+#v-
+ Here the terminal is initialized such that flow control and output
+ processing are turned off. In addition, the character
+ \key{Ctrl-G}\footnote{For MSDOS systems, use the \em{scan code} 34
+ instead of 7 for \key{Ctrl-G}} has been specified to be the interrupt
+ character. The function \verb{SLang_set_abort_signal} is used to
+ install the default \slang interrupt signal handler.
+
+#%}}}
+
+\sect{Resetting the Keyboard Interface} #%{{{
+
+ The function \verb{SLang_reset_tty} must be called to reset the terminal
+ to the state it was in before the call to \verb{SLang_init_tty}. The
+ prototype for this function is:
+#v+
+ void SLang_reset_tty (void);
+#v-
+ Usually this function is only called before the program exits. However,
+ if the program is suspended it should also be called just before suspension.
+
+#%}}}
+
+\sect{Initializing the \grp{SLkp} Routines} #%{{{
+
+ Extra initialization of the higher-level \grp{SLkp} functions are
+ required because they are layered on top of the lower level
+ routines. Since the \verb{SLkp_getkey} function is able to process
+ function and arrow keys in a terminal independent manner, it is
+ necessary to call the \verb{SLtt_get_terminfo} function to get
+ information about the escape character sequences that the terminal's
+ function keys send. Once that information is available, the
+ \verb{SLkp_init} function can construct the proper keymaps to
+ process the escape sequences.
+
+ This part of the initialization process for an application using
+ this interface will look something like:
+
+#v+
+ SLtt_get_terminfo ();
+ if (-1 == SLkp_init ())
+ {
+ SLang_doerror ("SLkp_init failed.");
+ exit (1);
+ }
+ if (-1 == SLang_init_tty (-1, 0, 1))
+ {
+ SLang_doerror ("SLang_init_tty failed.");
+ exit (1);
+ }
+#v-
+
+ It is important to check the return status of the \verb{SLkp_init}
+ function which can failed if it cannot allocate enough memory for
+ the keymap.
+
+#%}}}
+
+\sect{Setting the Interrupt Handler} #%{{{
+
+ The function \verb{SLang_set_abort_signal} may be used to associate an
+ interrupt handler with the interrupt character that was previously
+ specified by the \verb{SLang_init_tty} function call. The prototype for
+ this function is:
+#v+
+ void SLang_set_abort_signal (void (*)(int));
+#v-
+ This function returns nothing and takes a single parameter which is a
+ pointer to a function taking an integer value and returning
+ \verb{void}. If a \verb{NULL} pointer is passed, the default \slang
+ interrupt handler will be used. The \slang default interrupt handler
+ under Unix looks like:
+#v+
+ static void default_sigint (int sig)
+ {
+ SLsignal_intr (SIGINT, default_sigint);
+ SLKeyBoard_Quit = 1;
+ if (SLang_Ignore_User_Abort == 0)
+ SLang_set_error (SL_UserBreak_Error);
+ }
+#v-
+ It simply sets the global variable \verb{SLKeyBoard_Quit} to one and
+ if the variable \verb{SLang_Ignore_User_Abort} is non-zero,
+ the error state is set to indicate a user break condition. (The
+ function \verb{SLsignal_intr} is similar to the standard C
+ \verb{signal} function \em{except that it will interrupt system
+ calls}. Some may not like this behavior and may wish to call
+ this \verb{SLang_set_abort_signal} with a different handler.)
+
+ Although the function expressed above is specific to Unix, the
+ analogous routines for other operating systems are equivalent in
+ functionality even though the details of the implementation may vary
+ drastically (e.g., under MSDOS, the hardware keyboard interrupt
+ \verb{int 9h} is hooked).
+
+#%}}}
+
+\sect{Reading Keyboard Input with SLang_getkey} #%{{{
+
+ After initializing the keyboard via \verb{SLang_init_tty},
+ the \slang function \verb{SLang_getkey} may be used to read
+ characters from the terminal interface. In addition, the function
+ \verb{SLang_input_pending} may be used to determine whether or not
+ keyboard input is available to be read.
+
+ These functions have prototypes:
+#v+
+ unsigned int SLang_getkey (void);
+ int SLang_input_pending (int tsecs);
+#v-
+ The \verb{SLang_getkey} function returns a single character from the
+ terminal. Upon failure, it returns \verb{0xFFFF}. If the interrupt
+ character specified by the \verb{SLang_init_tty} function is pressed
+ while this function is called, the function will return the value of
+ the interrupt character and set the \slang global variable
+ \verb{SLKeyBoard_Quit} to a non-zero value. In addition, if the
+ default \slang interrupt handler has been specified by a \verb{NULL}
+ argument to the \verb{SLang_set_abort_signal} function, the error
+ state of the library will be set to \verb{SL_UserBreak_Error}
+ \em{unless} the variable \verb{SLang_Ignore_User_Abort} is non-zero.
+
+ The \verb{SLang_getkey} function waits until input is available to be
+ read. The \verb{SLang_input_pending} function may be used to determine
+ whether or not input is ready. It takes a single parameter that indicates
+ the amount of time to wait for input before returning with information
+ regarding the availability of input. This parameter has units of one
+ tenth (1/10) of a second, i.e., to wait one second, the value of the
+ parameter should be \tt{10}. Passing a value of zero causes the function
+ to return right away. \verb{SLang_input_pending} returns a positive
+ integer if input is available or zero if input is not available. It will
+ return -1 if an error occurs.
+
+ Here is a simple example that reads keys from the terminal until one
+ presses \key{Ctrl-G} or until 5 seconds have gone by with no input:
+#v+
+ #include <stdio.h>
+ #include <slang.h>
+ int main ()
+ {
+ int abort_char = 7; /* For MSDOS, use 34 as scan code */
+ unsigned int ch;
+
+ if (-1 == SLang_init_tty (abort_char, 0, 1))
+ {
+ fprintf (stderr, "Unable to initialize the terminal.\n");
+ exit (-1);
+ }
+ SLang_set_abort_signal (NULL);
+ while (1)
+ {
+ fputs ("\nPress any key. To quit, press Ctrl-G: ", stdout);
+ fflush (stdout);
+ if (SLang_input_pending (50) == 0) /* 50/10 seconds */
+ {
+ fputs ("Waited too long! Bye\n", stdout);
+ break;
+ }
+
+ ch = SLang_getkey ();
+ if (SLang_get_error () == SL_UserBreak_Error)
+ {
+ fputs ("Ctrl-G pressed! Bye\n", stdout);
+ break;
+ }
+ putc ((int) ch, stdout);
+ }
+ SLang_reset_tty ();
+ return 0;
+ }
+#v-
+
+#%}}}
+
+\sect{Reading Keyboard Input with SLkp_getkey} #%{{{
+
+ Unlike the low-level function \verb{SLang_getkey}, the
+ \verb{SLkp_getkey} function can read a multi-character sequence
+ associated with function keys. The \verb{SLkp_getkey} function uses
+ \verb{SLang_getkey} and \slang's keymap facility to process escape
+ sequences. It returns a single integer which describes the key that
+ was pressed:
+#v+
+ int SLkp_getkey (void);
+#v-
+ That is, the \verb{SLkp_getkey} function simple provides a mapping
+ between keys and integers. In this context the integers are called
+ \em{keysyms}.
+
+ For single character input such as generated by the \key{a} key on
+ the keyboard, the function returns the character that was generated,
+ e.g., \verb{'a'}. For single characters, \verb{SLkp_getkey} will
+ always return an keysym whose value ranges from 0 to 256. For
+ keys that generate multiple character sequences, e.g., a function or
+ arrow key, the function returns an keysym whose value is greater
+ that 256. The actual values of these keysyms are represented as
+ macros defined in the \file{slang.h} include file. For example, the
+ up arrow key corresponds to the keysym whose value is
+ \verb{SL_KEY_UP}.
+
+ Since it is possible for the user to enter a character sequence that
+ does not correspond to any key. If this happens, the special keysym
+ \verb{SL_KEY_ERR} will be returned.
+
+ Here is an example of how \verb{SLkp_getkey} may be used by a file
+ viewer:
+#v+
+ switch (SLkp_getkey ())
+ {
+ case ' ':
+ case SL_KEY_NPAGE:
+ next_page ();
+ break;
+ case 'b':
+ case SL_KEY_PPAGE:
+ previous_page ();
+ break;
+ case '\r':
+ case SL_KEY_DOWN:
+ next_line ();
+ break;
+ .
+ .
+ case SL_KEY_ERR:
+ default:
+ SLtt_beep ();
+ }
+#v-
+
+ Unlike its lower-level counterpart, \verb{SLang_getkey}, there do
+ not yet exist any functions in the library that are capable of
+ ``ungetting'' keysyms. In particular, the \verb{SLang_ungetkey}
+ function will not work.
+
+#%}}}
+
+\sect{Buffering Input} #%{{{
+
+ \slang has several functions pushing characters back onto the
+ input stream to be read again later by \verb{SLang_getkey}. It
+ should be noted that none of the above functions are designed to
+ push back keysyms read by the \verb{SLkp_getkey} function. These
+ functions are declared as follows:
+#v+
+ void SLang_ungetkey (unsigned char ch);
+ void SLang_ungetkey_string (unsigned char *buf, int buflen);
+ void SLang_buffer_keystring (unsigned char *buf, int buflen);
+#v-
+
+ \verb{SLang_ungetkey} is the most simple of the three functions. It takes
+ a single character a pushes it back on to the input stream. The next call to
+ \verb{SLang_getkey} will return this character. This function may be used
+ to \em{peek} at the character to be read by first reading it and then
+ putting it back.
+
+ \verb{SLang_ungetkey_string} has the same function as
+ \verb{SLang_ungetkey} except that it is able to push more than one
+ character back onto the input stream. Since this function can push back
+ null (ascii 0) characters, the number of characters to push is required as
+ one of the parameters.
+
+ The last of these three functions, \verb{SLang_buffer_keystring} can
+ handle more than one charater but unlike the other two, it places the
+ characters at the \em{end} of the keyboard buffer instead of at the
+ beginning.
+
+ Note that the use of each of these three functions will cause
+ \verb{SLang_input_pending} to return right away with a non-zero value.
+
+ Finally, the \slang keyboard interface includes the function
+ \verb{SLang_flush_input} with prototype
+#v+
+ void SLang_flush_input (void);
+#v-
+ It may be used to discard \em{all} input.
+
+ Here is a simple example that looks to see what the next key to be read is
+ if one is available:
+#v+
+ int peek_key ()
+ {
+ int ch;
+ if (SLang_input_pending (0) == 0) return -1;
+ ch = SLang_getkey ();
+ SLang_ungetkey (ch);
+ return ch;
+ }
+#v-
+
+#%}}}
+
+\sect{Global Variables} #%{{{
+ Although the following \slang global variables have already been
+ mentioned earlier, they are gathered together here for completeness.
+
+ \verb{int SLang_Ignore_User_Abort;}
+ If non-zero, pressing the interrupt character will not result in
+ the libraries error state set to \verb{SL_UserBreak_Error}.
+
+ \verb{volatile int SLKeyBoard_Quit;}
+ This variable is set to a non-zero value when the interrupt
+ character is pressed. If the interrupt character is pressed when
+ \verb{SLang_getkey} is called, the interrupt character will be
+ returned from \verb{SLang_getkey}.
+
+ \verb{int SLang_TT_Baud_Rate;}
+ On systems which support it, this variable is set to the value of the
+ terminal's baud rate after the call to \verb{SLang_init_tty}.
+
+#%}}}
+
+#%}}}
+
+\chapter{Readline Interface}
+
+ The \slang library includes simple but capable readline
+ functionality in its \verb{SLrline} layer. The \verb{SLrline}
+ routines provide a simple mechanism for an application to get
+ prompted input from a user with command line editing, completions,
+ and history recall.
+
+ The use of the \verb{SLrline} routines will be illustrated with a
+ few simple examples. All of the examples given in this section may
+ be found in the file \verb{demo/rline.c} in the \slang source code
+ distribution. For clarity, the code shown below omits most error
+ checking.
+
+\sect{Introduction}
+
+ The first example simply reads input from the user until the user
+ enters \exmp{quit}:
+#v+
+ SLrline_Type *rl;
+ SLang_init_tty (-1, 0, 1);
+ rl = SLrline_open (80, SL_RLINE_BLINK_MATCH);
+ while (1)
+ {
+ char *line;
+ unsigned int len;
+
+ line = SLrline_read_line (rl, "prompt>", &len);
+ if (line == NULL) break;
+ if (0 == strcmp (line, "quit"))
+ {
+ SLfree (line);
+ break;
+ }
+ (void) fprintf (stdout, "\nRead %d bytes: %s\n", strlen(line), line);
+ SLfree (line);
+ }
+ SLrline_close (rl);
+ SLang_reset_tty ();
+#v-
+ In this example, the \verb{SLtt} interface functions
+ \cfun{SLang_init_tty} and \cfun{SLang_reset_tty} functions have been
+ used to open and close the terminal for reading input. By default,
+ the \verb{SLrline} functions use the \verb{SLang_getkey} function to
+ read characters and assume that the terminal has been properly
+ initialized before use.
+
+ The \cfun{SLrline_open} function was used to create an instance of
+ an \verb{SLrline_Type} object. The function takes two arguments:
+ and edit window display width (80 above), and a set of flags. In
+ this case, the \verb{SL_RLINE_BLINK_MATCH} flags has been used to
+ turn on parenthesis blinking. Once finished, the
+ \exmp{SLrline_Type} object must be freed using the
+ \exmp{SLrline_close} function.
+
+ The actual reading of the line occurs in the
+ \cfun{SLrline_read_line} function, which takes an
+ \verb{SLrline_Type} instance and a string representing the prompt to
+ be used. The line itself is returned as a malloced \exmp{char *}
+ and must be freed using the \cfun{SLfree} function after used. The
+ length (in bytes) of the line is returned via the parameter list.
+
+ If an end-of-file character (\exmp{^D} on Unix) was entered at the
+ beginning of a line, the \cfun{SLrline_read_line} function will
+ return \NULL. However, it also return \NULL if an error of
+ some sort was encountered. The only way to tell the difference
+ between these two conditions is to call \cfun{SLang_get_error}.
+
+ The above code fragment did not provide for any sort of
+ \exmp{SIGINT} handling. Without such a provision, pressing
+ \exmp{^C} at the prompt could be enough to kill the application.
+ This is especially undesirable if one wants to press \exmp{^C} to
+ abort the call to \exmp{SLrline_read_line}. The function
+ \exmp{example_2} in \exmp{demo/rline.c} shows code to handle this
+ situation as well as distinguish between EOF and other errors.
+
+\sect{Interpreter Interface}
+
+ \verb{SLrline} features such as command-line completion,
+ vi-emulation, and so on are implemented through callbacks or hooks from
+ the \verb{SLrline} functions to the \slang interpreter. Hence, this
+ functionality is only available to applications that make use of the
+ interpreter.
+
+ TBD...
+
+\chapter{Screen Management} #%{{{
+
+ The \slang library provides two interfaces to terminal independent
+ routines for manipulating the display on a terminal. The highest level
+ interface, known as the \verb{SLsmg} interface is discussed in this
+ section. It provides high level screen management functions for
+ manipulating the display in an optimal manner and is similar in spirit to
+ the \verb{curses} library. The lowest level interface, or the
+ \verb{SLtt}
+ interface, is used by the \verb{SLsmg} routines to actually perform the
+ task of writing to the display. This interface is discussed in another
+ section. Like the keyboard routines, the \verb{SLsmg} routines are
+ \em{platform independent} and work the same on MSDOS, OS/2, Unix, and VMS.
+
+ The screen management, or \verb{SLsmg}, routines are initialized by
+ function \verb{SLsmg_init_smg}. Once initialized, the application uses
+ various \verb{SLsmg} functions to write to a \em{virtual} display. This does
+ not cause the \em{physical} terminal display to be updated immediately.
+ The physical display is updated to look like the virtual display only
+ after a call to the function \verb{SLsmg_refresh}. Before exiting, the
+ application using these routines is required to call
+ \verb{SLsmg_reset_smg} to reset the display system.
+
+ The following subsections explore \slang's screen management system in
+ greater detail.
+
+\sect{Initialization}
+
+ The function \verb{SLsmg_init_smg} must be called before any other
+ \verb{SLsmg} function can be used. It has the simple prototype:
+#v+
+ int SLsmg_init_smg (void);
+#v-
+ It returns zero if successful or -1 if it cannot allocate space for
+ the virtual display.
+
+ For this routine to properly initialize the virtual display, the
+ capabilities of the terminal must be known as well as the size of
+ the \em{physical} display. For these reasons, the lower level \verb{SLtt} routines
+ come into play. In particular, before the first call to
+ \verb{SLsmg_init_smg}, the application is required to call the function
+ \verb{SLtt_get_terminfo} before calling \verb{SLsmg_init_smg}.
+
+ The \verb{SLtt_get_terminfo} function sets the global variables
+ \verb{SLtt_Screen_Rows} and \verb{SLtt_Screen_Cols} to the values
+ appropriate for the terminal. It does this by calling the
+ \verb{SLtt_get_screen_size} function to query the terminal driver
+ for the appropriate values for these variables. From this point on,
+ it is up to the application to maintain the correct values for these
+ variables by calling the \verb{SLtt_get_screen_size} function
+ whenever the display size changes, e.g., in response to a
+ \verb{SIGWINCH} signal. Finally, if the application is going to read
+ characters from the keyboard, it is also a good idea to initialize
+ the keyboard routines at this point as well.
+
+\sect{Resetting SLsmg}
+
+ Before the program exits or suspends, the function
+ \verb{SLsmg_reset_smg}
+ should be called to shutdown the display system. This function has the
+ prototype
+#v+
+ void SLsmg_reset_smg (void);
+#v-
+ This will deallocate any memory allocated for the virtual screen and
+ reset the terminal's display.
+
+ Basically, a program that uses the \verb{SLsmg} screen management functions
+ and \slang's keyboard interface will look something like:
+#v+
+ #include <slang.h>
+ int main ()
+ {
+ SLtt_get_terminfo ();
+ SLang_init_tty (-1, 0, 0);
+ SLsmg_init_smg ();
+
+ /* do stuff .... */
+
+ SLsmg_reset_smg ();
+ SLang_reset_tty ();
+ return 0;
+ }
+#v-
+ If this program is compiled and run, all it will do is clear the screen
+ and position the cursor at the bottom of the display. In the following
+ sections, other \verb{SLsmg} functions will be introduced which may be used
+ to make this simple program do much more.
+
+\sect{Handling Screen Resize Events}
+ The function \verb{SLsmg_reinit_smg} is designed to be used in
+ conjunction with resize events.
+
+ Under Unix-like operating systems, when the size of the display
+ changes, the application will be sent a \verb{SIGWINCH} signal. To
+ properly handle this signal, the \verb{SLsmg} routines must be
+ reinitialized to use the new display size. This may be accomplished
+ by calling \verb{SLtt_get_screen_size} to get the new size, followed by
+ \verb{SLsmg_reinit_smg} to reinitialize the \verb{SLsmg} interface
+ to use the new size. Keep in mind that these routines should
+ not be called from within the signal handler. The following code
+ illustrates the main ideas involved in handling such events:
+#v+
+ static volatile int Screen_Size_Changed;
+ static sigwinch_handler (int sig)
+ {
+ Screen_Size_Changed = 1;
+ SLsignal (SIGWINCH, sigwinch_handler);
+ }
+
+ int main (int argc, char **argv)
+ {
+ SLsignal (SIGWINCH, sigwinch_handler);
+ SLsmg_init_smg ();
+ .
+ .
+ /* Now enter main loop */
+ while (not_done)
+ {
+ if (Screen_Size_Changed)
+ {
+ SLtt_get_screen_size ();
+ SLsmg_reinit_smg ();
+ redraw_display ();
+ }
+ .
+ .
+ }
+ return 0;
+ }
+#v-
+
+\sect{SLsmg Functions} #%{{{
+
+ In the previous sections, functions for initializing and shutting down the
+ \verb{SLsmg} routines were discussed. In this section, the rest of the
+ \verb{SLsmg} functions are presented. These functions act only on the
+ \em{virtual} display. The \em{physical} display is updated when the
+ \verb{SLsmg_refresh} function is called and \em{not until that time}.
+ This function has the simple prototype:
+#v+
+ void SLsmg_refresh (void);
+#v-
+
+\sect1{Positioning the cursor}
+
+ The \verb{SLsmg_gotorc} function is used to position the cursor at a given
+ row and column. The prototype for this function is:
+#v+
+ void SLsmg_gotorc (int row, int col);
+#v-
+ The origin of the screen is at the top left corner and is given the
+ coordinate (0, 0), i.e., the top row of the screen corresponds to
+ \verb{row = 0} and the first column corresponds to \verb{col = 0}. The last
+ row of the screen is given by \verb{row = SLtt_Screen_Rows - 1}.
+
+ It is possible to change the origin of the coordinate system by using the
+ function \verb{SLsmg_set_screen_start} with prototype:
+#v+
+ void SLsmg_set_screen_start (int *r, int *c);
+#v-
+ This function takes pointers to the new values of the first row and first
+ column. It returns the previous values by modifying the values of the
+ integers at the addresses specified by the parameter list. A
+ \verb{NULL}
+ pointer may be passed to indicate that the origin is to be set to its
+ initial value of 0. For example,
+#v+
+ int r = 10;
+ SLsmg_set_screen_start (&r, NULL);
+#v-
+ sets the origin to (10, 0) and after the function returns, the variable
+ \verb{r} will have the value of the previous row origin.
+
+\sect1{Writing to the Display}
+
+ \verb{SLsmg} has several routines for outputting text to the virtual
+ display. The following points should be understood:
+\begin{itemize}
+\item The text is output at the position of the cursor of the virtual
+ display and the cursor is advanced to the position that corresponds to
+ the end of the text.
+
+\item Text does \em{not} wrap at the boundary of the
+ display--- it is trucated. This behavior seems to be more useful in
+ practice since most programs that would use screen management tend to
+ be line oriented.
+
+\item Control characters are displayed in a two character sequence
+ representation with \verb{^} as the first character. That is,
+ \key{Ctrl-X} is output as \verb{^X}.
+
+\item The behavior of the newline character depends upon the value of
+ the \verb{SLsmg_Newline_Behavior} variable. It may be set to
+ any one of the following values:
+
+ \p\verb{SLSMG_NEWLINE_IGNORED} : If a newline character is
+ encountered when writing a string to the virtual display, the
+ characters in the string following the newline character will not
+ be written. In other words, the newline character will act like
+ a string termination character. This is the default setting for
+ the \verb{SLsmg_Newline_Behavior}.
+
+ \p\verb{SLSMG_NEWLINE_MOVES} : If a newline character is when
+ writing to the virtual display, the following characters will be
+ written to the beginning of the next row.
+
+ \p\verb{SLSMG_NEWLINE_SCROLLS} : When set to this value and a
+ newline character is output at the bottom of the virtual
+ display, the display will scroll up. Otherwise the behavior
+ will be the same as that of \verb{SLSMG_NEWLINE_MOVES}.
+
+ \p\verb{SLSMG_NEWLINE_PRINTABLE} : When set to this value, a
+ newline character will be printed as the two characters sequence
+ \verb{^J}.
+
+\end{itemize}
+
+ Although the some of the above items might appear to be too restrictive, in
+ practice this is not seem to be the case. In fact, the design of the
+ output routines was influenced by their actual use and modified to
+ simplify the code of the application utilizing them.
+\begin{descrip}
+\proto{void SLsmg_write_char (char ch);}
+ Write a single character to the virtual display.
+
+\proto{void SLsmg_write_nchars (char *str, int len);}
+ Write \verb{len} characters pointed to by \verb{str} to the
+ virtual display.
+
+\proto{void SLsmg_write_string (char *str);}
+ Write the null terminated string given by pointer \verb{str} to the
+ virtual display. This function is a wrapper around
+ \verb{SLsmg_write_nchars}.
+
+\proto{void SLsmg_write_nstring (char *str, int n);}
+ The purpose of this function is to write a null terminated string to
+ a field that is at most \verb{n} cells wide. Each double-wide
+ character in the string will use two cells. If the string is not
+ big enough to fill the \verb{n} cells, the rest of the cells will be
+ filled with space characters. This function is a wrapper around
+ \verb{SLsmg_write_wrapped_string}.
+
+\proto{void SLsmg_write_wrapped_string(SLuchar_Type *str, int r, int c, unsigned int dr, unsigned int dc, int fill)}
+ The purpose of this function is to write a string \verb{str} to a
+ box defined by rows and columns satisfying \verb{r<=row<r+dc} and
+ \verb{c<=column<c+dc}. The string will be wrapped at the column
+ boundaries of the box and truncated if its size exceeds to size of
+ the box. If the total size of the string is less than that of the
+ box, and the \verb{fill} parameter is non-zero, then the rest of the
+ cells in the box will be filled with space characters. Currently the
+ wrapping algorithm is very simple and knows nothing about word
+ boundaries.
+
+\proto{void SLsmg_printf (char *fmt, ...);}
+ This function is similar to \verb{printf} except that it writes to
+ the \verb{SLsmg} virtual display.
+
+ \proto{void SLsmg_vprintf (char *, va_list);}
+ Like \verb{SLsmg_printf} but uses a variable argument list.
+\end{descrip}
+\sect1{Erasing the Display}
+
+ The following functions may be used to fill portions of the display with
+ blank characters. The attributes of blank character are the current
+ attributes. (See below for a discussion of character attributes)
+\begin{descrip}
+ \proto{void SLsmg_erase_eol (void);}
+ Erase line from current position to the end of the line.
+
+ \proto{void SLsmg_erase_eos (void);}
+ Erase from the current position to the end of the screen.
+
+ \proto{void SLsmg_cls (void);}
+ Clear the entire virtual display.
+\end{descrip}
+\sect1{Setting Character Attributes}
+
+ Character attributes define the visual characteristics the character
+ possesses when it is displayed. Visual characteristics include the
+ foreground and background colors as well as other attributes such as
+ blinking, bold, and so on. Since \verb{SLsmg} takes a different approach
+ to this problem than other screen management libraries an explanation of
+ this approach is given here. This approach has been motivated by
+ experience with programs that require some sort of screen management.
+
+ Most programs that use \verb{SLsmg} are composed of specific textual
+ objects or objects made up of line drawing characters. For example,
+ consider an application with a menu bar with drop down menus. The menus
+ might be enclosed by some sort of frame or perhaps a shadow. The basic
+ idea is to associate an integer to each of the objects (e.g., menu bar,
+ shadow, current menu item, etc.) and create a mapping from the integer to
+ the set of attributes. In the terminology of \verb{SLsmg}, the integer is
+ simply called an \em{object}.
+
+ For example, the menu bar might be associated with the object \verb{1}, the
+ drop down menu could be object \verb{2}, the shadow could be object
+ \verb{3},
+ and so on.
+
+ The range of values for the object integer is restricted from 0 up to
+ and including 255 on all systems except MSDOS where the maximum allowed
+ integer is 15\footnote{This difference is due to memory constraints
+ imposed by MSDOS. This restriction might be removed in a future version of
+ the library.}. The object numbered zero should not be regarding as an
+ object at all. Rather it should be regarded as all \em{other} objects
+ that have not explicitly been given an object number. \verb{SLsmg}, or
+ more precisely \verb{SLtt}, refers to the attributes of this special object
+ as the \em{default} or \em{normal} attributes.
+
+ The \verb{SLsmg} routines know nothing about the mapping of the color to the
+ attributes associated with the color. The actual mapping takes place at a
+ lower level in the \verb{SLtt} routines. Hence, to map an object to the
+ actual set of attributes requires a call to any of the following
+ \verb{SLtt}
+ routines:
+#v+
+ void SLtt_set_color (int obj, char *name, char *fg, char *bg);
+ void SLtt_set_color_object (int obj, SLtt_Char_Type attr);
+ void SLtt_set_mono (int obj, char *, SLtt_Char_Type attr);
+#v-
+ Only the first of these routines will be discussed briefly here. The
+ latter two functions allow more fine control over the object to attribute
+ mapping (such as assigning a ``blink'' attribute to the object). For a
+ more full explanation on all of these routines see the section about the
+ \verb{SLtt} interface.
+
+ The \verb{SLtt_set_color} function takes four parameters. The first
+ parameter, \verb{obj}, is simply the integer of the object for which
+ attributes are to be assigned. The second parameter is currently
+ unused by these routines. The third and forth parameters, \verb{fg}
+ and \verb{bg}, are the names of the foreground and background color
+ to be used associated with the object. The strings that one can use
+ for the third and fourth parameters can be any one of the 16 colors:
+#v+
+ "black" "gray"
+ "red" "brightred"
+ "green" "brightgreen"
+ "brown" "yellow"
+ "blue" "brightblue"
+ "magenta" "brightmagenta"
+ "cyan" "brightcyan"
+ "lightgray" "white"
+#v-
+ The value of the foreground parameter \verb{fg} can be anyone of these
+ sixteen colors. However, on most terminals, the background color will
+ can only be one of the colors listed in the first column\footnote{This is
+ also true on the Linux console. However, it need not be the case and
+ hopefully the designers of Linux will someday remove this restriction.}.
+
+ Of course not all terminals are color terminals. If the \slang global
+ variable \verb{SLtt_Use_Ansi_Colors} is non-zero, the terminal is
+ assumed to be a color terminal. The \verb{SLtt_get_terminfo} will
+ try to determine whether or not the terminal supports colors and set
+ this variable accordingly. It does this by looking for the
+ capability in the terminfo/termcap database. Unfortunately many Unix
+ databases lack this information and so the \verb{SLtt_get_terminfo}
+ routine will check whether or not the environment variable
+ \verb{COLORTERM} exists. If it exists, the terminal will be assumed
+ to support ANSI colors and \verb{SLtt_Use_Ansi_Colors} will be set to one.
+ Nevertheless, the application should provide some other mechanism to set
+ this variable, e.g., via a command line parameter.
+
+ When the \verb{SLtt_Use_Ansi_Colors} variable is zero, all objects
+ with numbers greater than one will be displayed in inverse
+ video\footnote{This behavior can be modified by using the
+ \tt{SLtt_set_mono} function call.}.
+
+ With this background, the \verb{SLsmg} functions for setting the character
+ attributes can now be defined. These functions simply set the object
+ attributes that are to be assigned to \em{subsequent} characters written
+ to the virtual display. For this reason, the new attribute is called the
+ \em{current} attribute.
+\begin{descrip}
+ \proto{void SLsmg_set_color (int obj);}
+ Set the current attribute to those of object \verb{obj}.
+
+ \proto{void SLsmg_normal_video (void);}
+ This function is equivalent to \verb{SLsmg_set_color (0)}.
+
+ \proto{void SLsmg_reverse_video (void);}
+ This function is equivalent to \verb{SLsmg_set_color (1)}. On monochrome
+ terminals, it is equivalent to setting the subsequent character attributes
+ to inverse video.
+\end{descrip}
+
+ Unfortunately there does not seem to be a standard way for the
+ application or, in particular, the library to determine which color
+ will be used by the terminal for the default background. Such
+ information would be useful in initializing the foreground and
+ background colors associated with the default color object (0). For
+ this reason, it is up to the application to provide some means for
+ the user to indicate what these colors are for the particular
+ terminal setup. To facilitate this, the \verb{SLtt_get_terminfo}
+ function checks for the existence of the \verb{COLORFGBG}
+ environment variable. If this variable exists, its value will be
+ used to initialize the colors associated with the default color
+ object. Specifically, the value is assumed to consist of a
+ foreground color name and a background color name separated by a
+ semicolon. For example, if the value of \verb{COLORFGBG} is
+ \verb{lightgray;blue}, the default color object will be initialized
+ to represent a \verb{lightgray} foreground upon a \verb{blue}
+ background.
+
+\sect1{Lines and Alternate Character Sets}
+ The \slang screen management library also includes routines for turning
+ on and turning off alternate character sets. This is especially useful
+ for drawing horizontal and vertical lines.
+\begin{descrip}
+ \proto{void SLsmg_set_char_set (int flag);}
+ If \verb{flag} is non-zero, subsequent write functions will use characters
+ from the alternate character set. If \verb{flag} is zero, the default, or,
+ ordinary character set will be used.
+
+ \proto{void SLsmg_draw_hline (int len);}
+ Draw a horizontal line from the current position to the column that is
+ \verb{len} characters to the right.
+
+ \proto{void SLsmg_draw_vline (int len);}
+ Draw a horizontal line from the current position to the row that is
+ \verb{len} rows below.
+
+ \proto{void SLsmg_draw_box (int r, int c, int dr, int dc);}
+ Draw a box whose upper right corner is at row \verb{r} and column
+ \verb{c}.
+ The box spans \verb{dr} rows and \verb{dc} columns. The current position
+ will be left at row \verb{r} and column \verb{c}.
+\end{descrip}
+
+\sect1{Miscellaneous Functions}
+
+\begin{descrip}
+ \proto{void SLsmg_touch_lines (int r, int n);}
+ Mark screen rows numbered \verb{r}, \verb{r + 1}, \ldots \verb{r +
+ (n - 1)} as
+ modified. When \verb{SLsmg_refresh} is called, these rows will be
+ completely redrawn.
+
+ \proto{int SLsmg_char_at(SLsmg_Char_Type *ch);}
+ Returns the character and its attributes at the current position.
+ The SLsmg_Char_Type object is a structure representing the character
+ cell:
+#v+
+ #define SLSMG_MAX_CHARS_PER_CELL 5
+ typedef struct
+ {
+ unsigned int nchars;
+ SLwchar_Type wcharsSLSMG_MAX_CHARS_PER_CELL;
+ SLsmg_Color_Type color;
+ }
+ SLsmg_Char_Type;
+#v-
+ Normally the value of the \verb{nchars} field will be 1 to indicate
+ that the character contains precisely one character whose value is
+ given by the zeroth element of the wchars array of the structure.
+ The value of \verb{nchars} will be greater than one if the character
+ cell also contains so-called Unicode combining characters. The
+ combining characters are given by the elements 1 through
+ \verb{nchars-1} of the \verb{wchars} array. If \verb{nchars} is 0,
+ then the character cell represents the second half of a double-wide
+ character.
+
+ The \verb{color} field repesents both the color of the character
+ cell and the alternate character set setting of the cell. This
+ value may be bitwise-anded with \verb{SLSMG_COLOR_MASK} to obtain
+ the cell's color, and bitwise-anded with \verb{SLSMG_ACS_MASK} to
+ determine whether or not the alternate-character set setting is in
+ effect for the cell (zero or non-zero).
+\end{descrip}
+
+#%}}}
+
+\sect{Variables} #%{{{
+
+ The following \slang global variables are used by the \verb{SLsmg}
+ interface. Some of these have been previously discussed.
+
+ \verb{int SLtt_Screen_Rows;}
+ \verb{int SLtt_Screen_Cols;}
+ The number of rows and columns of the \em{physical} display. If either of
+ these numbers changes, the functions \verb{SLsmg_reset_smg} and
+ \verb{SLsmg_init_smg} should be called again so that the \verb{SLsmg}
+ routines can re-adjust to the new size.
+
+ \verb{int SLsmg_Tab_Width;}
+ Set this variable to the tab width that will be used when expanding tab
+ characters. The default is 8.
+
+ \verb{int SLsmg_Display_Eight_Bit;}
+ This variable determines how characters with the high bit set are to be
+ output. Specifically, a character with the high bit set with a value
+ greater than or equal to this value is output as is; otherwise, it will be
+ output in a 7-bit representation. The default value for this variable is
+ \verb{128} for MSDOS and \verb{160} for other systems (ISO-Latin).
+ In UTF-8 mode, the value of this variable is 0.
+
+ \verb{int SLtt_Use_Ansi_Colors;}
+ If this value is non-zero, the terminal is assumed to support ANSI colors
+ otherwise it is assumed to be monochrome. The default is 0.
+
+ \verb{int SLtt_Term_Cannot_Scroll;}
+ If this value is zero, the \verb{SLsmg} will attempt to scroll the physical
+ display to optimize the update. If it is non-zero, the screen management
+ routines will not perform this optimization. For some applications, this
+ variable should be set to zero. The default value is set by the
+ \verb{SLtt_get_terminfo} function.
+
+#%}}}
+
+\sect{Hints for using SLsmg}
+
+ This section discusses some general design issues that one must face when
+ writing an application that requires some sort of screen management.
+
+#%}}}
+
+\chapter{Signal Functions} #%{{{
+
+ Almost all non-trivial programs must worry about signals. This is
+ especially true for programs that use the \slang terminal
+ input/output and screen management routines. Unfortunately, there is
+ no fixed way to handle signals; otherwise, the Unix kernel would take
+ care of all issues regarding signals and the application programmer
+ would never have to worry about them. For this reason, none of the
+ routines in the \slang library catch signals; however, some of the
+ routines block the delivery of signals during crucial moments. It is
+ up to the application programmer to install handlers for the various
+ signals of interest.
+
+ If the application makes use of the interpreter, then a signal
+ handler for \var{SIGINT} should be installed to allow the user to
+ break out of the interpreter via, e.g., \key{Ctrl-C}. In order for
+ this to work, the signal handler should call \cfun{SLang_set_error}
+ to generate a \var{SL_UserBreak_Error} exception, i.e.,
+#v+
+ void sigint_handler (int sig)
+ {
+ if (SLang_Ignore_User_Abort == 0)
+ SLang_set_error (SL_UserBreak_Error);
+ }
+#v-
+
+ Applications that use the \grp{tty} \var{getkey} routines or the screen
+ management routines must worry about signals such as:
+#v+
+ SIGINT interrupt
+ SIGTSTP stop
+ SIGQUIT quit
+ SIGTTOU background write
+ SIGTTIN background read
+ SIGWINCH window resize
+#v-
+ It is important that handlers be established for these signals while
+ the either the \var{SLsmg} routines or the \var{getkey} routines are
+ initialized. The \cfun{SLang_init_tty}, \cfun{SLang_reset_tty},
+ \cfun{SLsmg_init_smg}, and \cfun{SLsmg_reset_smg} functions block these
+ signals from occurring while they are being called.
+
+ Since a signal can be delivered at any time, it is important for the
+ signal handler to call only functions that can be called from a
+ signal handler. This usually means that such function must be
+ re-entrant. In particular, the \var{SLsmg} routines are \em{not}
+ re-entrant; hence, they should not be called when a signal is being
+ processed unless the application can ensure that the signal was not
+ delivered while an \var{SLsmg} function was called. This statement
+ applies to many other functions such as \var{malloc}, or, more
+ generally, any function that calls \var{malloc}. The upshot is that
+ the signal handler should not attempt to do too much except set a
+ global variable for the application to look at while not in a signal
+ handler.
+
+ The \slang library provides two functions for blocking and unblocking the
+ above signals:
+#v+
+ int SLsig_block_signals (void);
+ int SLsig_unblock_signals (void);
+#v-
+ It should be noted that for every call to \cfun{SLsig_block_signals}, a
+ corresponding call should be made to \cfun{SLsig_unblock_signals}, e.g.,
+#v+
+ void update_screen ()
+ {
+ SLsig_block_signals ();
+
+ /* Call SLsmg functions */
+ .
+ .
+ SLsig_unblock_signals ();
+ }
+#v-
+ See \file{demo/pager.c} for examples.
+
+#%}}}
+
+\chapter{Searching Functions} #%{{{
+
+ The S-Lang library incorporates two types of searches: Regular expression
+ pattern matching and ordinary searching.
+
+\sect{Simple Searches} #%{{{
+
+ \slang's \SLsearch interface functions a convenient interface to the
+ famous Boyer-Moore fast searching algrothim. The searches can go in
+ either a forward or backward direction and and may be performed with
+ or without regard to case. Moreover, UTF-8 encoded strings are fully
+ supported by the interface.
+
+#%}}}
+
+\sect{Regular Expressions} #%{{{
+
+ !!! No documentation available yet !!!
+
+#%}}}
+
+#%}}}
+
+\appendix
+
+#i apinews.tm
+
+#i copyright.tm
+
+\end{\documentstyle}

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/fixtex.sl Added

@@ -0,0 +1,130 @@
+#!/usr/bin/env jed-script
+
+private variable Version = "0.3.2-0";
+
+if (__argc != 2)
+{
+ message ("Version $Version Usage: ./fixtex.sl <filename>"$);
+ quit_jed ();
+}
+
+variable file = __argv1;
+() = read_file (file);
+
+% Patch up the >,< signs
+bob ();
+replace ("$<$", "<");
+replace ("$>$", ">");
+
+% It appears that sgml2tex screws up _for in section titles, producing \_{for}.
+replace ("ion\\_{", "ion{\\_");
+
+% Make the first chapter a preface
+bob ();
+if (bol_fsearch ("\\chapter{Preface}"))
+{
+ push_spot ();
+ push_mark ();
+ go_right (8); insert ("*");	 % \chapter{ --> \chapter*{
+ () = bol_fsearch ("\\chapter{");
+ push_spot ();
+
+ insert("\\tableofcontents\n");
+ eol ();
+ insert ("\n\\pagenumbering{arabic}");
+
+ pop_spot ();
+ narrow ();
+ bob ();
+ replace ("\\section{", "\\section*{");
+ widen ();
+
+ if (bol_bsearch ("\\tableofcontents"))
+ delete_line ();
+
+ pop_spot ();
+ if (bol_bsearch ("\\maketitle"))
+ insert ("\\pagenumbering{roman}\n");
+
+}
+
+static define fixup_urldefs ()
+{
+ % pdflatex cannot grok urldef
+ bob ();
+ while (bol_fsearch("\\urldef{") and ffind ("\\url{"))
+ {
+	variable line = line_as_string ();
+	bol ();
+	insert ("\\ifpdf\n");
+
+	deln (7); insert ("\\newcommand");
+	push_mark ();
+	()=ffind ("}");
+	variable macro = bufsubstr ();
+	() = ffind ("\\url");
+	go_left (1);
+	trim ();
+	insert("{");
+
+	% pdflatex cannot grok # in urls. Nuke em.
+	if (ffind ("#"))
+	 {
+	 del_eol ();
+	 insert ("}");
+	 }
+	eol ();
+	insert ("}\n\\else\n");
+	insert (line); newline ();
+	insert ("\\fi\n");
+ }
+}
+
+static define remove_repeated_urls ()
+{
+ variable name, url;
+ variable names = Assoc_TypeInt_Type, 0;
+ while (bol_fsearch ("{\\em "))
+ {
+	go_right (4);
+	skip_white ();
+	push_mark ();
+	() = ffind ("}");
+	!if (looking_at ("} {\\tt "))
+	 {
+	 pop_mark(0);
+	 continue;
+	 }
+	name = bufsubstr ();
+	if (namesname)
+	 {
+	 go_right(1);
+	 push_mark ();
+	 () = ffind ("}");
+	 go_right(1);
+	 del_region ();
+	 }
+	else
+	 {
+	 namesname = 1;
+	 go_right(1);
+	 () = ffind ("}");
+	 go_right (1);
+	 }
+
+	% Now remove empty lines inserted by the broken sgml2latex program.
+	skip_white ();
+	!if (eolp ())
+	 continue;
+	go_right(1);
+	skip_white ();
+	if (eolp ())
+	 del ();
+ }
+}
+
+fixup_urldefs ();
+remove_repeated_urls ();
+save_buffer ();
+quit_jed ();
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/hlpdefs.tm Added

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/intnews.tm Added

@@ -0,0 +1,512 @@
+\chapter{S-Lang 2 Interpreter NEWS}
+
+ This chapter describes features that were added to various 2.0
+ releases. For a much more complete and detailed list of changes, see
+ the \file{changes.txt} file that is distributed with the library.
+
+\sect{What's new for \slang 2.2}
+#d tagexmp#1 \tag{\exmp{$1}}
+
+\begin{itemize}
+\item
+ The ternary expression was added:
+#v+
+ expression = condition ? val1 : val2
+#v-
+ If \em{condition} is non-zero, then \em{expression = val1},
+ otherwise \em{expression = val2}.
+
+\item
+ The break and continue statements support an optional integer that
+ indicates how many loop levels the statement affects, e.g., the
+ break statement in
+#v+
+ while (1)
+ {
+ loop (10)
+ {
+ break 2;
+ }
+ }
+#v-
+ will cause both loops to be terminated.
+
+\item
+ Multiline strings have been added:
+#v+
+ "This is a \
+ multiline \
+ string"
+
+ `This is
+ another multiline
+ string that
+ does not require
+ a \ for continuation`
+#v-
+\item
+ \dtype{List_Type} objects may be indexed using an array of indices
+ instead of just a single scalar index.
+\end{itemize}
+
+The following intrinsic function were added in version 2.2:
+\begin{descrip}
+\tagexmp{sumsq}
+ Equivalent to \exmp{sum(x*x)}.
+\tagexmp{expm1}
+ More accurate version of \exmp{exp(x)-1} for \exmp{x} near 0.
+\tagexmp{log1p}
+ More accurate version of \exmp{log(1+x)} for \exmp{x} near 0.
+\tagexmp{list_to_array}
+ Creates an array from a list.
+\tagexmp{string_matches}
+ A convenient alternative to the \exmp{string_match} and
+ \exmp{string_match_nth} functions.
+\tagexmp{_close}
+ Close an integer descriptor.
+\tagexmp{_fileno}
+ Returns the descriptor as an integer.
+\tagexmp{dup2_fd}
+ Duplicates a file descriptor via the \exmp{dup2} POSIX function.
+\tagexmp{getsid, killpg, getpriority, setpriority}
+ These functions correspond to the corresponding POSIX functions.
+\tagexmp{ldexp, frexp}
+ If \exmp{x == a*2^b}, where \exmp{0.5<=a<1.0} then
+ \exmp{(a,b)=frexp(x)}, and \exmp{x=ldexp(a,b)}.
+\end{descrip}
+
+The following functions have been enhanced:
+\begin{descrip}
+\tagexmp{hypot}
+ If given a single array argument \exmp{X}, it returns the equivalent
+ of \exmp{sqrt(sum(X*X)}.
+\tagexmp{polynom}
+ The calling interface to this function was changed and support added
+ for arrays.
+\end{descrip}
+
+The following modules were added to version 2.2:
+\begin{descrip}
+\tagexmp{zlib}
+ A module that wraps the popular z compression library.
+\tagexmp{fork}
+ A module that wraps the \exmp{fork}, \exmp{exec*}, and
+ \exmp{waitpid} functions.
+\tagexmp{sysconf}
+ A module that implements interfaces to the POSIX
+ \exmp{sysconf}, \exmp{pathconf}, and \exmp{confstr} functions.
+\end{descrip}
+
+The following library files and functions were add to \slsh:
+\begin{descrip}
+\tagexmp{process.sl}
+ The code in this file utilizes the \exmp{fork} module to implement
+ the \exmp{new_process} function, which allows the caller to easily
+ create and communicate with subprocesses and pipelines.
+\end{descrip}
+
+\sect{What's new for \slang 2.1}
+
+\begin{itemize}
+\item
+ Short circuiting boolean operators \exmp{||} and \exmp{&&}
+ have been added to the languange. The use of \exmp{orelse} and
+ \exmp{andelse} constructs are nolonger necessary nor encouraged.
+\item
+ \em{Qualifiers} have been added to the language as a convenient
+ and powerful mechanism to pass optional information to functions.
+\item
+ Structure definitions allow embeded assignemnts, e.g,
+#v+
+ s = struct {foo = 3, bar = "hello" };
+#v-
+\item
+ Comparison expressions such as \exmp{a<b<c} are now interpretered as
+ \exmp{(a<b)and(b<c)}.
+\item
+ The \kw{ifnot} keyword was added as an alternative to \kw{!if}. The
+ use of \kw{!if} has been deprecated.
+\item
+ Looping constructs now support a "then" clause that will get
+ executed if the loop runs to completion, e.g.,
+#v+
+ loop (20)
+ {
+ if (this ())
+ break; % The then clause will NOT get executed
+ }
+ then do_that ();
+#v-
+ Note: \kw{then} is now a reserved word.
+\item
+ A floating point array of exactly N elements may be created
+ using the form \exmp{a:b:#N}, where the elements are uniformly
+ spaced and run from a to b, inclusive.
+\item
+ References to array elements and structure fields are now
+ supported, e.g., \exmp{&A3}, \exmp{&s.foo}.
+\item
+ An exception may be rethrown by calling "throw" without any
+ arguments:
+#v+
+ try { something (); }
+ catch AnyError: { do_this (); throw; }
+#v-
+\end{itemize}
+
+The following intrinsic function were added in version 2.1:
+\begin{descrip}
+\tagexmp{wherenot(x)} Equivalent to where (not(x))
+\tagexmp{_$(str)}
+ Evaluates strings with embedded "dollar" variables, e.g.,
+ \exmp{_$("$TERM")}.
+\tagexmp{__push_list/__pop_list}
+ Push list items onto the stack
+\tagexmp{prod(x)}
+ Computes the product of an array \exmp{a0*a1*...}
+\tagexmp{minabs(x), maxabs(x)}
+ Equivalent to \exmp{min(abs(x))} and \exmp{max(abs(x))}, resp.
+\tagexmp{getpgrp, setgid, getpgid}
+ Get and set the process group ids (Unix).
+\tagexmp{setsid}
+ Create a new session (Unix).
+\end{descrip}
+
+The following modules were added to version 2.1:
+\begin{descrip}
+ \tagexmp{iconv}
+ Performs character-set conversion using the iconv library.
+ \tagexmp{onig}
+ A regular expression module using oniguruma RE library.
+\end{descrip}
+
+The following library files and functions were add to \slsh:
+\begin{descrip}
+\tagexmp{readascii} A flexible and power ascii (as opposed to binary)
+ data file reader.
+\tagexmp{cmdopt} A set of functions that vastly simplify the parsing
+of command line options.
+\end{descrip}
+
+Also a history and completion mechanism was added to the \slang
+readline interface, and as a result, \slsh now supports history and
+command/file completion.
+
+\sect{What's new for \slang 2.0}
+
+Here is a brief list of some of the new features and improvements in
+\slang 2.0.
+
+\begin{itemize}
+\item \slsh, the generic \slang interpreter, now supports and
+ interactive command-line mode with readline support.
+\item Native support for Unicode via UTF-8 throughout the library.
+\item A \dtype{List_Type} object has been added to the language, e.g.,
+#v+
+ x = {1, 2.7, "foo", 1:10};
+#v-
+ will create a (heterogeneous) list of 4 elements.
+\item A much improved exception handling model.
+\item Variable expansion within string literals:
+#v+
+ file = "$HOME/src/slang-$VERSION/"$;
+#v-
+\item Operator overloading for user-defined types.
+ For example it is possible to define a meaning to \exmp{X+Y} where
+ \exmp{X} and \exmp{Y} are defined as
+#v+
+ typedef struct { x, y, z } Vector;
+ define vector (x,y,z) { variable v = @Vector; v.x=x; v.y=y; v.z=z;}
+ X = vector (1,2,3);
+ Y = vector (4,5,6);
+#v-
+\item Syntactic sugar for objected-oriented style method calls.
+ \slang 1 code such as
+#v+
+
+ (@s.method)(s, args);
+#v-
+ may be written much more simply as
+#v+
+ s.method(args);
+#v-
+ This should make "object-oriented" code somewhat more readable.
+ See also the next section if your code uses constructs such as
+#v+
+ @s.method(args);
+#v-
+ because it is not supported by \slang 2.
+
+\item More intrinsic functions including math functions such
+ as \ifun{hypot}, \ifun{atan2}, \ifun{floor}, \ifun{ceil},
+ \ifun{round}, \ifun{isnan}, \ifun{isinf}, and many more.
+
+\item Support for \exmp{long long} integers.
+#v+
+ X = 18446744073709551615ULL;
+#v-
+\item Large file support
+\item Performance improvements. The \slang 2 interpreter is about 20 percent
+ faster for many operations than the previous version.
+\item Better debugging support including an interactive debugger. See
+ \sectref{Using the sldb debugger} for more information.
+\end{itemize}
+
+See the relevent chapters in in the manual for more information.
+
+\sect{Upgrading to \slang 2}
+
+ For the most part \slang 2 is backwards-compatible with \slang 1.
+ However there are a few important differences that need to be
+ understood before upgrading to version 2.
+
+\begin{descrip}
+ \tag{++ and -- operators in function calls}
+ Previously the \exmp{++} and {--} operators were permitted in
+ a function argument list, e.g.,
+#v+
+ some_function (x++, x);
+#v-
+ Such uses are flagged as syntax errors and need to be changed to
+#v+
+ x++; some_function (x);
+#v-
+
+ \tag{Array indexing of strings} Array indexing of strings uses
+ byte-semantics and not character-semantics. This distinction is
+ important only if UTF-8 mode is in effect. If you use array
+ indexing with functions that use character semantics, then your code
+ may not work properly in UTF-8 mode. For example, one might have used
+#v+
+ i = is_substr (a, b);
+ if (i) c = a0:i-2;
+#v-
+ to extract that portion of \exmp{a} that preceeds the occurrence of
+ \exmp{b} in \exmp{a}. This may nolonger work in UTF-8 mode where
+ bytes and characters are not generally the same. The correct way to
+ write the above is to use the \exmp{substr} function since it uses
+ character semantics:
+#v+
+ i = is_substr (a, b);
+ if (i) c = substr (a, 1, i-1);
+#v-
+
+ \tag{Array indexing with negative integer ranges} Previously the
+ interpretation of a range array was context sensitive. In an
+ indexing situation \exmp{0:-1} was used to index from the first
+ through the last element of an array, but outside this context,
+ \exmp{0:-1} was an empty array. For \slang2, the meaning of
+ such arrays is always the same regardless of the context. Since
+ by itself \exmp{0:-1} represents an empty array, indexing with
+ such an array will also produce an empty array. The behavior of
+ scalar indices has not changed: \exmp{A-1} still refers to the
+ last element of the array.
+
+ Range arrays with an implied endpoint make sense only in indexing
+ situations. Hence the value of the endpoint can be inferred from
+ the context. Such arrays include \exmp{*}, \exmp{:-1}, etc.
+
+ Code that use index-ranges with negative valued indices such as
+#v+
+ B = A0:-2; % Get all but the last element of A
+#v-
+ will have to be changed to use an array with an implied endpoint:
+#v+
+ B = A:-2; % Get all but the last element of A
+#v-
+ Similarly, code such as
+#v+
+ B = A-3:-1; % Get the last 3 elements of A
+#v-
+ must be changed to
+#v+
+ B = A-3:;
+#v-
+\tag{Dereferencing function members of a structure} Support for the
+ non-parenthesized form of function member dereferencing has been
+ dropped. Code such as
+#v+
+ @s.foo(args);
+#v-
+ will need to be changed to use the parenthesized form:
+#v+
+ (@s.foo)(args);
+#v-
+ The latter form will work in both \slang 1 and \slang 2.
+
+ If your code passes the structure as the first argument of the
+ method call, e.g.,
+#v+
+ (@s.foo)(s, moreargs);
+#v-
+ then it may be changed to
+#v+
+ s.foo (moreargs);
+#v-
+ However, this \em{objected-oriented} form of method calling is not
+ supported by \slang 1.
+
+\tag{ERROR_BLOCKS}
+ Exception handling via \exmp{ERROR_BLOCKS} is still supported but
+ deprecated. If your code uses \exmp{ERROR_BLOCKS} it should be
+ changed to use the new exception handling model. For example,
+ code that looks like:
+#v+
+ ERROR_BLOCK { cleanup_after_error (); }
+ do_something ();
+ .
+ .
+#v-
+ should be changed to:
+#v+
+ variable e;
+ try (e)
+ {
+ do_something ();
+ .
+ .
+ }
+ catch RunTimeError:
+ {
+ cleanup_after_error ();
+ throw e.error, e.message;
+ }
+#v-
+
+ Code that makes use of \exmp{EXECUTE_ERROR_BLOCK}
+#v+
+ ERROR_BLOCK { cleanup_after_error (); }
+ do_something ();
+ .
+ .
+ EXECUTE_ERROR_BLOCK;
+#v-
+ should be changed to make use of a \kw{finally} clause:
+#v+
+ variable e;
+ try (e)
+ {
+ do_something ();
+ .
+ .
+ }
+ finally
+ {
+ cleanup_after_error ();
+ }
+#v-
+
+ It is not possible to emulate the complete semantics of the
+ \ifun{_clear_error} function. However, those semantics are flawed
+ and fixing the problems associated with the use of
+ \ifun{_clear_error} was one of the primary reasons for the new
+ exception handling model. The main problem with the
+ \ifun{_clear_error} method is that it causes execution to resume at the
+ byte-code following the code that triggered the error. As such,
+ \ifun{_clear_error} defines no absolute resumption point. In
+ contrast, the try-catch exception model has well-defined points of
+ execution. With the above caveats, code such as
+#v+
+ ERROR_BLOCK { cleanup_after_error (); _clear_error ();}
+ do_something ();
+ .
+ .
+#v-
+ should be changed to:
+#v+
+ variable e;
+ try (e)
+ {
+ do_something ();
+ .
+ .
+ }
+ catch RunTimeError:
+ {
+ cleanup_after_error ();
+ }
+#v-
+ And code using \ifun{_clear_error} in conjunction with
+ \kw{EXECUTE_ERROR_BLOCK}:
+#v+
+ ERROR_BLOCK { cleanup_after_error (); _clear_error ();}
+ do_something ();
+ .
+ .
+ EXECUTE_ERROR_BLOCK;
+#v-
+ should be changed to:
+#v+
+ variable e;
+ try (e)
+ {
+ do_something ();
+ .
+ .
+ }
+ catch RunTimeError:
+ {
+ cleanup_after_error ();
+ }
+ finally:
+ {
+ cleanup_after_error ();
+ }
+#v-
+
+ \tag{fread} When reading \dtype{Char_Type} and
+ \dtype{UChar_Type} objects the \slang 1 version of \ifun{fread}
+ returned a binary string (\dtype{BString_Type} if the number of
+ characters read was greater than one, or a \exmp{U/Char_Type} if the
+ number read was one. In other words, the resulting type depended
+ upon how many bytes were read with no way to predict the resulting
+ type in advance. In contrast, when reading, e.g, \exmp{Int_Type}
+ objects, \ifun{fread} returned an \exmp{Int_Type} when it read one
+ integer, or an array of \exmp{Int_Type} if more than one was read.
+ For \slang 2, the behavior of \ifun{fread} with respect to
+ \dtype{UChar_Type} and \dtype{Char_Type} types was changed to
+ have the same semantics as the other data types.
+
+ The upshot is that code that used
+#v+
+ nread = fread (&str, Char_Type, num_wanted, fp)
+#v-
+ will no longer result in \exmp{str} being a \dtype{BString_Type} if
+ \exmp{nread > 1}. Instead, \exmp{str} will now become a
+ \exmp{Char_Typenread} object. In order to read a specified number
+ of bytes from a file in the form of a string, use the
+ \ifun{fread_bytes} function:
+#v+
+ #if (_slang_version >= 20000)
+ nread = fread_bytes (&str, num_wanted, fp);
+ #else
+ nread = fread (&str, Char_Type, num_wanted, fp)
+ #endif
+#v-
+ The above will work with both versions of the interpreter.
+
+ \tag{strtrans} The \ifun{strtrans} function has been changed to
+ support Unicode. One ramification of this is that when mapping
+ from one range of characters to another, the length of the ranges
+ must now be equal.
+
+ \tag{str_delete_chars} This function was changed to support unicode
+ character classes. Code such as
+#v+
+ y = str_delete_chars (x, "\\a");
+#v-
+ is now implies the deletion of all alphabetic characters from
+ \exmp{x}. Previously it meant to delete the backslashes and
+ \exmp{a}s from from \exmp{x}. Use
+#v+
+ y = str_delete_chars (x, "\\\\a");
+#v-
+ to achieve the latter.
+
+ \tag{substr, is_substr, strsub}
+ These functions use character-semantics and not byte-semantics. The
+ distinction is important in UTF-8 mode. If you use array indexing
+ in conjunction with these functions, then read on.
+
+\end{descrip}
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/local.tm Added

@@ -0,0 +1,53 @@
+#d slang \bf{S-Lang}
+#d slang2 \bf{S-Lang 2}
+#d slrn \bf{slrn}
+#d sldb \bf{sldb}
+#d slprof \bf{slprof}
+#d slsh \bf{slsh}
+#d jed \bf{jed}
+#d key#1 <tt>$1</tt>
+#d footnote#1 <footnote>$1</footnote>
+#d grp#1 <tt>$1</tt>
+#d file#1 <tt>$1</tt>
+#d -1 <tt>-1</tt>
+#d 0 <tt>0</tt>
+#d 1 <tt>1</tt>
+#d NULL <tt>NULL</tt>
+
+#d kw#1 \tt{$1}
+#d exmp#1 \tt{$1}
+#d var#1 \tt{$1}
+
+#d ctype#1 \tt{$1}
+#d cfun#1 \tt{$1}
+#d ivar#1 \tt{$1}
+#d ifun#1 \tt{$1}
+#d icon#1 \tt{$1}
+#d sfun#1 \tt{$1}
+#d svar#1 \tt{$1}
+#d exfile#1 \tt{$1}
+#d exns#1 \tt{$1}
+#d exstr#1 \tt{"$1"}
+#d module#1 \tt{$1}
+#d dtype#1 \tt{$1}
+
+#% Environment variables
+#d env#1 \tt{$1}
+
+#% Exceptions
+#d exc#1 \tt{$1}
+
+#d ldots ...
+#d times *
+#d sc#1 \tt{$1}
+#d verb#1 \tt{$1}
+#d url#1 <htmlurl url="$1" name="$1">
+#d slang-library-programmers-guide S-Lang Library C Programmer's Guide
+#d slang-intrinsic-function-reference S-Lang Library Intrinsic Function Reference
+#d chapter#1 <chapt>$1
+#d tag#1 <tag>$1</tag>
+#d appendix <appendix>
+
+#d kbd#1 <tt>$1</tt>
+#d math#1 $1
+#d docversion v2.3.0

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/preface.tm Added

@@ -0,0 +1,89 @@
+\chapter{Preface} #%{{{
+
+  \slang is an interpreted language that was designed from the start
+  to be easily embedded into a program to provide it with a powerful
+  extension language.  Examples of programs that use \slang as an
+  extension language include the \jed text editor and the \slrn
+  newsreader.  Although \slang does not exist as a separate
+  application, it is distributed with a quite capable program called
+  \slsh (``slang-shell'') that embeds the interpreter and allows one
+  to execute \slang scripts, or simply experiment with \slang at an
+  interactive prompt.  Many of the the examples in this document are
+  presented in the context of one of the above applications.
+
+  \slang is also a programmer's library that permits a programmer to
+  develop sophisticated platform-independent software.  In addition to
+  providing the \slang interpreter, the library provides
+  facilities for screen management, keymaps, low-level terminal I/O,
+  etc. \if{\strcmp{\DocTitle}{\slang-library-programmers-guide}}{However, this document is concerned only with the extension
+  language and does not address these other features of the \slang
+  library.  For information about the other components of the library,
+  the reader is referred to the \bf{\slang-library-programmers-guide.}}
+
+\sect{A Brief History of \slang} #%{{{
+
+  I first began working on \slang sometime during the fall of 1992.
+  At that time I was writing a text editor (\jed), which I wanted to
+  endow with a macro language.  It occurred to me that an
+  application-independent language that could be embedded into the
+  editor would prove more useful because I could envision embedding it
+  into other programs.  As a result, \slang was born.
+
+  \slang was originally a stack language that supported a
+  postscript-like syntax.  For that reason, I named it \slang, where
+  the \em{S} was supposed to emphasize its stack-based nature.  About
+  a year later, I began to work on a preparser that would allow one
+  unfamiliar with stack based languages to make use of a more
+  traditional infix syntax. Currently, the syntax of the language
+  resembles C, nevertheless some postscript-like features still
+  remain, e.g., the `\var{%}' character is still used as a comment
+  delimiter.
+
+#%}}}
+
+\sect{Acknowledgements} #%{{{
+
+   Since I first released \slang, I have received a lot feedback about
+   the library and the language from many people.  This has given me
+   the opportunity and pleasure to interact with a number of people to
+   make the library portable and easy to use.  In particular, I would
+   like to thank the following individuals:
+
+     Luchesar Ionkov for his comments and criticisms of the syntax of
+     the language.  He was the person who made me realize that the
+     low-level byte-code engine should be totally type-independent.
+     He also improved the tokenizer and preparser and impressed upon
+     me that the language needed a grammar.
+
+     Mark Olesen for his many patches to various aspects of the
+     library and his support on AIX. He also contributed a lot to the
+     pre-processing (\var{SLprep}) routines.
+
+     John Burnell for the OS/2 port of the video and keyboard
+     routines.  He also made value suggestions regarding the
+     interpreter interface.
+
+     Darrel Hankerson for cleaning up and unifying some of the code
+     and the makefiles.
+
+     Dominik Wujastyk who was always willing to test new releases of
+     the library.
+
+     Michael Elkins for his work on the curses emulation.
+
+     Hunter Goatley, Andy Harper, Martin P.J. Zinser, and Jouk Jansen
+     for their VMS support.
+
+     Dave Sims and Chin Huang for Windows 95 and Windows NT support,
+     and Dino Sangoi for the Windows DLL support.
+
+  I am also grateful to many other people who send in bug-reports,
+  bug-fixes, little enhancements, and suggestions, and so on.  Without
+  such community involvement, \slang would not be as well-tested and
+  stable as it is.  Finally, I would like to thank my wife for her
+  support and understanding while I spent long weekend hours
+  developing the library.
+
+#%}}}
+
+#%}}}

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/regexp.tm Added

@@ -0,0 +1,104 @@
+\chapter{Regular Expressions}
+
+ The S-Lang library includes a regular expression (RE) package that
+ may be used by an application embedding the library. The RE syntax
+ should be familiar to anyone acquainted with regular expressions. In
+ this section the syntax of the \slang regular expressions is
+ discussed.
+
+ NOTE: At the moment, the \slang regular expressions do not support
+ UTF-8 encoded strings. The \slang library will most likely migrate
+ to the use of the PCRE regular expression library, deprecating the
+ use of the \slang REs in the process. For these reasons, the user is
+ encouraged to make use of the \module{pcre} module if possible.
+
+\sect{\slang RE Syntax}
+
+ A regular expression specifies a pattern to be matched against a
+ string, and has the property that the contcatenation of two REs is
+ also a RE.
+
+ The \slang library supports the following standard regular
+ expressions:
+#v+
+ . match any character except newline
+ * matches zero or more occurrences of previous RE
+ + matches one or more occurrences of previous RE
+ ? matches zero or one occurrence of previous RE
+ ^ matches beginning of a line
+ $ matches end of line
+ ... matches any single character between brackets.
+ For example, -02468 matches `-' or any even digit.
+ and -0-9a-z matches `-' and any digit between 0 and 9
+ as well as letters a through z.
+ \< Match the beginning of a word.
+ \> Match the end of a word.
+ $ ... $
+ \1, \2, ..., \9 Matches the match specified by nth $ ... $
+ expression.
+#v-
+ In addition the following extensions are also supported:
+#v+
+ \c turn on case-sensitivity (default)
+ \C turn off case-sensitivity
+ \d match any digit
+ \e match ESC char
+#v-
+Here are some simple examples:
+
+ \exmp{"^int "} matches the \exmp{"int "} at the beginning of a line.
+
+ \exmp{"\\<money\\>"} matches \exmp{"money"} but only if it appears
+ as a separate word.
+
+ \exmp{"^$"} matches an empty line.
+
+ A more complex pattern is
+#v+
+ "$\<a-zA-Z+\>$ +\1\>"
+#v-
+ which matches any word repeated consecutively. Note how the grouping
+ operators \exmp{\$} and \exmp{\$} are used to define the text
+ matched by the enclosed regular expression, and then subsequently
+ referred to \exmp{\\1}.
+
+ Finally, remember that when used in string literals either in the
+ \slang language or in the C language, care must be taken to
+ "double-up" the \exmp{'\\'} character since both languages treat it
+ as an escape character.
+
+\sect{Differences between \slang and egrep REs}
+
+ There are several differences between \slang regular expressions and,
+ e.g., \bf{egrep} regular expressions.
+
+ The most notable difference is that the \slang regular expressions do
+ not support the \bf{OR} operator \exmp{|} in expressions. This means
+ that \exmp{"a|b"} or \exmp{"a\\|b"} do not have the meaning that they
+ have in regular expression packages that support egrep-style
+ expressions.
+
+ The other main difference is that while \slang regular expressions
+ support the grouping operators \exmp{\$} and \exmp{\$}, they are
+ only used as a means of specifying the text that is matched. That
+ is, the expression
+#v+
+ "@$a-z*$@.*@\1@"
+#v-
+ matches \exmp{"xxx@abc@silly@abc@yyy"}, where the pattern \exmp{\\1}
+ matches the text enclosed by the \exmp{\$} and \exmp{\$}
+ expressions. However, in the current implementation, the grouping
+ operators are not used to group regular expressions to form a single
+ regular expression. Thus expression such as \exmp{"\$hello\$*"} is
+ \em{not} a pattern to match zero or more occurrences of \exmp{"hello"}
+ as it is in e.g., \bf{egrep}.
+
+ One question that comes up from time to time is why doesn't \slang
+ simply employ some posix-compatible regular expression library. The
+ simple answer is that, at the time of this writing, none exists that
+ is available across all the platforms that the \slang library
+ supports (Unix, VMS, OS/2, win32, win16, BEOS, MSDOS, and QNX) and
+ can be distributed under both the GNU licenses. It is particularly
+ important that the library and the interpreter support a common set
+ of regular expressions in a platform independent manner.
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl Added

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/array.tm Added

@@ -0,0 +1,881 @@
+\function{all}
+\synopsis{Tests if all elements of an array are non-zero}
+\usage{Char_Type all (Array_Type a ,Int_Type dim)}
+\description
+ The \ifun{all} function examines the elements of a numeric array and
+ returns 1 if all elements are non-zero, otherwise it returns 0. If a
+ second argument is given, then it specifies the dimension of the
+ array over which the function is to be applied. In this case, the
+ result will be an array with the same shape as the input array minus
+ the specified dimension.
+\example
+ Consider the 2-d array
+#v+
+ 1 2 3 4 5
+ 6 7 8 9 10
+#v-
+ generated by
+#v+
+ a = _reshape (1:10, 2, 5);
+#v-
+ Then \exmp{all(a)} will return 1, and \exmp{all(a>3, 0)} will return
+ a 1-d array
+#v+
+ 0, 0, 0, 1, 1
+#v-
+ Similarly, \exmp{all(a>3, 1)} will return the 1-d array
+#v+
+ 0,1
+#v-
+\seealso{where, any, wherediff}
+\done
+
+\function{any}
+\synopsis{Test if any element of an array is non-zero}
+\usage{Char_Type any (Array_Type a ,Int_Type dim)}
+\description
+ The \ifun{any} function examines the elements of a numeric array and
+ returns 1 if any element is both non-zero and not a NaN, otherwise
+ it returns 0. If a second argument is given, then it specifies
+ the dimension of the array to be tested.
+\example
+ Consider the 2-d array
+#v+
+ 1 2 3 4 5
+ 6 7 8 9 10
+#v-
+ generated by
+#v+
+ a = _reshape (1:10, 2, 5);
+#v-
+ Then \exmp{any(a==3)} will return 1, and \exmp{any(a==3, 0)}
+ will return a 1-d array with elements:
+#v+
+ 0 0 1 0 0
+#v-
+\seealso{all, where, wherediff}
+\done
+
+\function{array_info}
+\synopsis{Returns information about an array}
+\usage{(Array_Type, Integer_Type, DataType_Type) array_info (Array_Type a)}
+\description
+ The \ifun{array_info} function returns information about the array \exmp{a}.
+ It returns three values: an 1-d integer array specifying the
+ size of each dimension of \exmp{a}, the number of dimensions of
+ \exmp{a}, and the data type of \exmp{a}.
+\example
+ The \ifun{array_info} function may be used to find the number of rows
+ of an array:
+#v+
+ define num_rows (a)
+ {
+ variable dims, num_dims, data_type;
+
+ (dims, num_dims, data_type) = array_info (a);
+ return dims 0;
+ }
+#v-
+\seealso{typeof, array_shape, length, reshape, _reshape}
+\done
+
+\function{array_map}
+\synopsis{Apply a function to each element of an array}
+\usage{Array_Type array_map (type, func, args...)}
+\altusage{(Array_Type, ...) array_map (type, ..., func, args...)}
+#v+
+ DataType_Type type, ...;
+ Ref_Type func;
+#v-
+\description
+ The \ifun{array_map} function may be used to apply a function to
+ each element of an array and returns the resulting values as an
+ array of the specified type. The \exmp{type} parameter indicates
+ what kind of array should be returned and generally corresponds to
+ the return type of the function. If the function returns multiple
+ values, then the type of each return value must be given. The first
+ array-valued argument is used to determine the dimensions of the
+ resulting array(s). If any subsequent arguments correspond to an array
+ of the same size, then those array elements will be passed in
+ parallel with the elements of the first array argument.
+
+ To use \ifun{array_map} with functions that return no value, either
+ omit the \exmp{type} argument, or explicitly indicate that it
+ returns no value using the \dtype{Void_Type} type.
+
+\example
+ The first example illustrates how to apply the \ifun{strlen} function
+ to an array of strings.
+#v+
+ S = "", "Train", "Subway", "Car";
+ L = array_map (Integer_Type, &strlen, S);
+#v-
+ This is equivalent to:
+#v+
+ S = "", "Train", "Subway", "Car";
+ L = Integer_Type length (S);
+ for (i = 0; i < length (S); i++) Li = strlen (Si);
+#v-
+
+ Now consider an example involving the \ifun{strcat} function:
+#v+
+ files = "slang", "slstring", "slarray";
+
+ exts = ".c";
+ cfiles = array_map (String_Type, &strcat, files, exts);
+ % ==> cfiles = "slang.c", "slstring.c", "slarray.c";
+
+ exts = ".a",".b",".c";
+ xfiles = array_map (String_Type, &strcat, files, exts);
+ % ==> xfiles = "slang.a", "slstring.b", "slarray.c";
+#v-
+
+ Here is an example of its application to a function that returns 3
+ values. Suppose \exmp{A} is an array of arrays whose types and
+ sizes are arbitrary, and we wish to find the indices of \exmp{A}
+ that contain arrays of type \exmp{String_Type}. For this purpose, the
+ \ifun{array_info} function will be used:
+#v+
+ (dims, ndims, types)
+ = array_map (Array_Type, Int_Type, DataType_Type, &array_info, A);
+ i = where (types == String_Type);
+#v-
+
+ The \ifun{message} function prints a string and returns no value.
+ This example shows how it may be used to print an array of strings:
+#v+
+ a = "Line 1", "Line 2", "Line 3";
+ array_map (&message, a); % Form 1
+ array_map (Void_Type, &message, a); % Form 2
+#v-
+\notes
+ Many mathematical functions already work transparently on arrays.
+ For example, the following two statements produce identical results:
+#v+
+ B = sin (A);
+ B = array_map (Double_Type, &sin, A);
+#v-
+\notes
+ A number of the string functions have been vectorized, including the
+ \ifun{strlen} function. This means that there is no need to use the
+ \ifun{array_map} function with the \ifun{strlen} function.
+\seealso{array_info, strlen, strcat, sin}
+\done
+
+\function{array_reverse}
+\synopsis{Reverse the elements of an array}
+\usage{array_reverse (Array_Type a ,Int_Type i0, Int_Type i1 ,Int_Type dim)}
+\description
+ In its simplest form, the \ifun{array_reverse} function reverses the
+ elements of an array. If passed 2 or 4 arguments,
+ \ifun{array_reverse} reverses the elements of the specified
+ dimension of a multi-dimensional array. If passed 3 or 4 arguments,
+ the parameters \exmp{i0} and \exmp{i1} specify a range of elements
+ to reverse.
+\example
+ If \exmp{a} is a one dimensional array, then
+#v+
+ array_reverse (a, i, j);
+ ai:j = aj:i:-1;
+#v-
+ are equivalent to one another. However, the form using
+ \ifun{array_reverse} is about 10 times faster than the version that
+ uses explicit array indexing.
+\seealso{array_swap, transpose}
+\done
+
+\function{array_shape}
+\synopsis{Get the shape or dimensions of an array}
+\usage{dims = array_shape (Array_Type a)}
+\description
+ This function returns an array representing the dimensionality or
+ shape of a specified array. The \ifun{array_info} function also
+ returns this information but for many purposes the
+ \ifun{array_shape} function is more convenient.
+\seealso{array_info, reshape}
+\done
+
+\function{array_sort}
+\synopsis{Sort an array or opaque object}
+\usage{Array_Type array_sort (obj , &func , n)}
+\description
+ The \ifun{array_sort} function may be used to sort an object and
+ returns an integer index array that represents the result of the
+ sort as a permutation.
+
+ If a single parameter is passed, that parameter must be an array,
+ which will be sorted into ascending order using a built-in type-specific
+ comparison function.
+
+ If two parameters are passed (\exmp{obj} and \exmp{func}), then the
+ first parameter must be the array to be sorted, and the second is a
+ reference to the comparison function. In this case, the comparison
+ function represented by \exmp{func} must take two arguments
+ representing two array elements to be compared, and must return an
+ integer that represents the result of the comparison. The return
+ value must be less than zero if the first parameter is
+ less than the second, zero if they are equal, and a value greater
+ than zero if the first is greater than the second.
+
+ If three parameters are passed, then the first argument will be
+ regarded as an opaque object by the sorting algorithm. For this
+ reason, the number of elements represented by the object must also
+ be passed to \ifun{array_sort} function as the third function
+ argument. The second function argument must be a reference to
+ comparison function. In this case, the comparison function will be
+ passed three values: the opaque object, the (0-based) index of the
+ first element to be compared, and the (0-based) index of the second
+ element. The return value must be less than zero if the value of
+ the element at the first index considered to be less than the value
+ of the element at the second index, zero if the values are equal,
+ and a value greater than zero if the first value is greater than the
+ second.
+
+ \ifun{array_sort} sorts the array \exmp{a} into ascending order and
+ returns an integer array that represents the result of the sort. If
+ the optional second parameter \exmp{f} is present, the function
+ specified by \exmp{f} will be used to compare elements of \exmp{a};
+ otherwise, a built-in sorting function will be used.
+
+ The integer array returned by this function is simply an index array
+ that indicates the order of the sorted object. The input object
+ \exmp{obj} is not changed.
+
+\qualifiers
+ By default, elements are sorted in ascending order. The \exmp{dir}
+ qualifier may be used to specify the sort direction. Specifically
+ if \exmp{dir>=0}, the sort will be an ascending one, otherwise it
+ will be descending.
+
+ The \exmp{method} qualifier may be used to select between the
+ available sorting algorithms. There are currently two algorithms
+ supported: merge-sort and quick-sort. Using \exmp{method="msort"}
+ will cause the merge-sort algorithm to be used. The quick-sort
+ algorithm may be selected using \exmp{method="qsort"}.
+
+\example
+ An array of strings may be sorted using the \ifun{strcmp} function
+ since it fits the specification for the sorting function described
+ above:
+#v+
+ A = "gamma", "alpha", "beta";
+ I = array_sort (A, &strcmp);
+#v-
+ Alternatively, one may use
+#v+
+ variable I = array_sort (A);
+#v-
+ to use the built-in comparison function.
+
+ After the \ifun{array_sort} has executed, the variable \exmp{I} will
+ have the values \exmp{2, 0, 1}. This array can be used to
+ re-shuffle the elements of \exmp{A} into the sorted order via the
+ array index expression \exmp{A = AI}. This operation may also be
+ written:
+#v+
+ A = Aarray_sort(A);
+#v-
+\example
+ A homogeneous list may be sorted by using the opaque form of the
+ \ifun{array_sort} function:
+#v+
+ private define cmp_function (s, i, j)
+ {
+ if (si > sj) return 1;
+ if (si < sj) return -1;
+ return 0;
+ }
+
+ list = {};
+ % fill list ....
+ % now sort it
+ i = array_sort (list, &cmp_function, length(list));
+
+ % Create a new sorted list
+ list = listi;
+#v-
+ Alternatively one may first convert it to an array and use the
+ built-in comparison function:
+#v+
+ a = list_to_array (list);
+ i = array_sort(a);
+
+ % Rearrange the elements
+ list* = ai;
+#v-
+ to get the effect of an "in-place" sort.
+\notes
+ The default sorting algorithm is merge-sort. It has an N*log(N)
+ worst-case runtime compared to quick-sort's worst-case N^2 runtime.
+ The primary advantage of quick-sort is that it uses O(1) additional
+ memory, whereas merge-sort requires O(N) additional memory.
+
+ A stable sorting algorithm is one that preserves the order of equal
+ elements. Merge-sort is an inherently stable algorithm, whereas
+ quick-sort is not. Nevertheless, the slang library ensures the
+ stability of the results because it uses the indices themselves as
+ tie-breakers. As a result, the following two statements may not
+ produce the same results:
+#v+
+ i = array_sort (a; dir=-1);
+ i = array_reverse (array_sort (a; dir=1));
+#v-
+\seealso{set_default_sort_method, get_default_sort_method, strcmp, list_to_array}
+\done
+
+\function{array_swap}
+\synopsis{Swap elements of an array}
+\usage{array_swap (Array_Type a, Int_Type i, Int_Type j)}
+\description
+ The \ifun{array_swap} function swaps the specified elements of an
+ array. It is equivalent to
+#v+
+ (ai, aj) = (aj, ai);
+#v-
+ except that it executes several times faster than the above construct.
+\seealso{array_reverse, transpose}
+\done
+
+\function{cumsum}
+\synopsis{Compute the cumulative sum of an array}
+\usage{result = cumsum (Array_Type a , Int_Type dim)}
+\description
+ The \ifun{cumsum} function performs a cumulative sum over the
+ elements of a numeric array and returns the result. If a second
+ argument is given, then it specifies the dimension of the array to
+ be summed over. For example, the cumulative sum of
+ \exmp{1,2,3,4}, is the array \exmp{1,1+2,1+2+3,1+2+3+4}, i.e.,
+ \exmp{1,3,6,10}.
+\seealso{sum, sumsq}
+\done
+
+\function{get_default_sort_method}
+\synopsis{Get the default sorting method}
+\usage{String_Type get_default_sort_method ()}
+\description
+ This function may be used to get the default sorting method used by
+ \ifun{array_sort}. It will return one of the following strings:
+#v+
+ "msort" Merge-Sort
+ "qsort" Quick-Sort
+#v-
+\seealso{set_default_sort_method, array_sort}
+\done
+
+\function{init_char_array}
+\synopsis{Initialize an array of characters}
+\usage{init_char_array (Array_Type a, String_Type s)}
+\description
+ The \ifun{init_char_array} function may be used to initialize a
+ Char_Type array \exmp{a} by setting the elements of the array
+ \exmp{a} to the corresponding bytes of the string \exmp{s}.
+\example
+ The statements
+#v+
+ variable a = Char_Type 10;
+ init_char_array (a, "HelloWorld");
+#v-
+ creates an character array and initializes its elements to the
+ bytes in the string \exmp{"HelloWorld"}.
+\notes
+ The character array must be large enough to hold all the characters
+ of the initialization string. This function uses byte-semantics.
+\seealso{bstring_to_array, strlen, strcat}
+\done
+
+\function{_isnull}
+\synopsis{Check an array for NULL elements}
+\usage{Char_Type = _isnull (a)}
+\description
+ This function may be used to test for the presence of \NULL elements
+ of an array. Specifically, it returns a \dtype{Char_Type} array of
+ with the same number of elements and dimensionality of the input
+ array. If an element of the input array is \NULL, then the
+ corresponding element of the output array will be set to \1,
+ otherwise it will be set to \0.
+\example
+ Set all \NULL elements of a string array \exmp{A} to the empty
+ string \exmp{""}:
+#v+
+ Awhere(_isnull(A)) = "";
+#v-
+\notes
+ It is important to understand the difference between \exmp{A==NULL}
+ and \exmp{_isnull(A)}. The latter tests all elements of \exmp{A}
+ against \NULL, whereas the former only tests \exmp{A} itself.
+\seealso{where, array_map}
+\done
+
+\function{length}
+\synopsis{Get the length of an object}
+\usage{Integer_Type length (obj)}
+\description
+ The \ifun{length} function may be used to get information about the
+ length of an object. For simple scalar data-types, it returns 1.
+ For arrays, it returns the total number of elements of the array.
+\notes
+ If \exmp{obj} is a string, \ifun{length} returns \1 because a
+ \dtype{String_Type} object is considered to be a scalar. To get the
+ number of characters in a string, use the \ifun{strlen} function.
+\seealso{array_info, array_shape, typeof, strlen}
+\done
+
+\function{max}
+\synopsis{Get the maximum value of an array}
+\usage{result = max (Array_Type a ,Int_Type dim)}
+\description
+ The \ifun{max} function examines the elements of a numeric array and
+ returns the value of the largest element. If a second argument is
+ given, then it specifies the dimension of the array to be searched.
+ In this case, an array of dimension one less than that of the input array
+ will be returned with the corresponding elements in the specified
+ dimension replaced by the maximum value in that dimension.
+\example
+ Consider the 2-d array
+#v+
+ 1 2 3 4 5
+ 6 7 8 9 10
+#v-
+ generated by
+#v+
+ a = _reshape (1:10, 2, 5);
+#v-
+ Then \exmp{max(a)} will return \exmp{10}, and \exmp{max(a,0)} will return
+ a 1-d array with elements
+#v+
+ 6 7 8 9 10
+#v-
+\notes
+ This function ignores NaNs in the input array.
+\seealso{min, maxabs, sum, reshape}
+\done
+
+\function{maxabs}
+\synopsis{Get the maximum absolute value of an array}
+\usage{result = maxabs (Array_Type a ,Int_Type dim)}
+\description
+ The \ifun{maxabs} function behaves like the \ifun{max} function
+ except that it returns the maximum absolute value of the array. That
+ is, \exmp{maxabs(x)} is equivalent to \exmp{max(abs(x)}. See the
+ documentation for the \ifun{max} function for more information.
+\seealso{min, max, minabs}
+\done
+
+\function{min}
+\synopsis{Get the minimum value of an array}
+\usage{result = min (Array_Type a ,Int_Type dim)}
+\description
+ The \ifun{min} function examines the elements of a numeric array and
+ returns the value of the smallest element. If a second argument is
+ given, then it specifies the dimension of the array to be searched.
+ In this case, an array of dimension one less than that of the input array
+ will be returned with the corresponding elements in the specified
+ dimension replaced by the minimum value in that dimension.
+\example
+ Consider the 2-d array
+#v+
+ 1 2 3 4 5
+ 6 7 8 9 10
+#v-
+ generated by
+#v+
+ a = _reshape (1:10, 2, 5);
+#v-
+ Then \exmp{min(a)} will return \exmp{1}, and \exmp{min(a,0)} will return
+ a 1-d array with elements
+#v+
+ 1 2 3 4 5
+#v-
+\notes
+ This function ignores NaNs in the input array.
+\seealso{max, sum, reshape}
+\done
+
+\function{minabs}
+\synopsis{Get the minimum absolute value of an array}
+\usage{result = minabs (Array_Type a ,Int_Type dim)}
+\description
+ The \ifun{minabs} function behaves like the \ifun{min} function
+ except that it returns the minimum absolute value of the array. That
+ is, \exmp{minabs(x)} is equivalent to \exmp{min(abs(x)}. See the
+ documentation for the \ifun{min} function for more information.
+\seealso{min, max, maxabs}
+\done
+
+\function{prod}
+\synopsis{Compute the product of the elements of an array}
+\usage{result = prod (Array_Type a , Int_Type dim)}
+\description
+ The \ifun{prod} function computes the product of the elements of a
+ numeric array and returns the result. If a second argument is
+ given, then it specifies the dimension of the array over which the
+ product is to be taken. In this case, an array of dimension one
+ less than that of the input array will be returned.
+
+ If the input array is an integer type, then the resulting value will
+ be a \dtype{Double_Type}. If the input array is a
+ \dtype{Complex_Type}, then the result will be a \dtype{Complex_Type}.
+\seealso{sum, sumsq}
+\done
+
+\function{_reshape}
+\synopsis{Copy an array to a new shape}
+\usage{Array_Type _reshape (Array_Type A, Array_Type I)}
+\description
+ The \ifun{_reshape} function creates a copy of an array \exmp{A},
+ reshapes it to the form specified by \exmp{I} and returns the result.
+ The elements of \exmp{I} specify the new dimensions of the copy of
+ \exmp{A} and must be consistent with the number of elements \exmp{A}.
+\example
+ If \exmp{A} is a \exmp{100} element 1-d array, a new 2-d array of
+ size \exmp{20} by \exmp{5} may be created from the elements of \exmp{A}
+ by
+#v+
+ B = _reshape (A, 20, 5);
+#v-
+\notes
+ The \ifun{reshape} function performs a similar function to
+ \ifun{_reshape}. In fact, the \ifun{_reshape} function could have been
+ implemented via:
+#v+
+ define _reshape (a, i)
+ {
+ a = @a; % Make a new copy
+ reshape (a, i);
+ return a;
+ }
+#v-
+\seealso{reshape, array_shape, array_info}
+\done
+
+\function{reshape}
+\synopsis{Reshape an array}
+\usage{reshape (Array_Type A, Array_Type I)}
+\description
+ The \ifun{reshape} function changes the shape of \exmp{A} to have the
+ shape specified by the 1-d integer array \exmp{I}. The elements of \exmp{I}
+ specify the new dimensions of \exmp{A} and must be consistent with
+ the number of elements \exmp{A}.
+\example
+ If \exmp{A} is a \exmp{100} element 1-d array, it can be changed to a
+ 2-d \exmp{20} by \exmp{5} array via
+#v+
+ reshape (A, 20, 5);
+#v-
+ However, \exmp{reshape(A, 11,5)} will result in an error because
+ the \exmp{11,5} array specifies \exmp{55} elements.
+\notes
+ Since \ifun{reshape} modifies the shape of an array, and arrays are
+ treated as references, then all references to the array will
+ reference the new shape. If this effect is unwanted, then use the
+ \ifun{_reshape} function instead.
+\seealso{_reshape, array_info, array_shape}
+\done
+
+\function{set_default_sort_method}
+\synopsis{Set the default sorting method}
+\usage{set_default_sort_method (String_Type method)}
+\description
+ This function may be used to set the default sorting method used by
+ \ifun{array_sort}. The following methods are supported:
+#v+
+ "msort" Merge-Sort
+ "qsort" Quick-Sort
+#v-
+\seealso{get_default_sort_method, array_sort}
+\done
+
+\function{sum}
+\synopsis{Sum over the elements of an array}
+\usage{result = sum (Array_Type a , Int_Type dim)}
+\description
+ The \ifun{sum} function sums over the elements of a numeric array and
+ returns its result. If a second argument is given, then it
+ specifies the dimension of the array to be summed over. In this
+ case, an array of dimension one less than that of the input array
+ will be returned.
+
+ If the input array is an integer type, then the resulting value will
+ be a \dtype{Double_Type}. If the input array is a \dtype{Float_Type},
+ then the result will be a \dtype{Float_Type}.
+\example
+ The mean of an array \exmp{a} of numbers is
+#v+
+ sum(a)/length(a)
+#v-
+\seealso{cumsum, sumsq, transpose, reshape}
+\done
+
+\function{sumsq}
+\synopsis{Sum over the squares of the elements of an array}
+\usage{result = sumsq (Array_Type a , Int_Type dim)}
+\description
+ The \ifun{sumsq} function sums over the squares of the elements of a
+ numeric array and returns its result. If a second argument is
+ given, then it specifies the dimension of the array to be summed
+ over. In this case, an array of dimension one less than that of the
+ input array will be returned.
+
+ If the input array is an integer type, then the resulting value will
+ be a \dtype{Double_Type}. If the input array is a \dtype{Float_Type},
+ then the result will be a \dtype{Float_Type}.
+
+ For complex arrays, the sum will be over the squares of the moduli of
+ the complex elements.
+\seealso{cumsum, sumsq, hypot, transpose, reshape}
+\done
+
+\function{transpose}
+\synopsis{Transpose an array}
+\usage{Array_Type transpose (Array_Type a)}
+\description
+ The \ifun{transpose} function returns the transpose of a specified
+ array. By definition, the transpose of an array, say one with
+ elements \exmp{ai,j,...k} is an array whose elements are
+ \exmp{ak,...,j,i}.
+\seealso{_reshape, reshape, sum, array_info, array_shape}
+\done
+
+\function{where}
+\usage{Array_Type where (Array_Type a , Ref_Type jp)}
+\description
+ The \ifun{where} function examines a numeric array \exmp{a} and
+ returns an integer array giving the indices of \exmp{a}
+ where the corresponding element of \exmp{a} is non-zero. The
+ function accepts an optional \dtype{Ref_Type} argument that will be
+ set to complement set of indices, that is, the indices where
+ \exmp{a} is zero. In fact
+#v+
+ i = where (a);
+ j = where (not a);
+#v-
+ and
+#v+
+ i = where (a, &j);
+#v-
+ are equivalent, but the latter form is preferred since it executes
+ about twice as fast as the former.
+
+ The \ifun{where} function can also be used with relational operators
+ and with the boolean binary \exmp{or} and \exmp{and} operators, e.g.,
+#v+
+ a = where (array == "a string");
+ a = where (array <= 5);
+ a = where (2 <= array <= 10);
+ a = where ((array == "a string") or (array == "another string"));
+#v-
+ Using in the last example the short-circuiting \exmp{||} and
+ \exmp{&&} operators, will result in a \exc{TypeMismatchError} exception.
+
+ Although this function may appear to be simple or even trivial, it
+ is arguably one of the most important and powerful functions for
+ manipulating arrays.
+\example
+ Consider the following:
+#v+
+ variable X = 0.0:10.0:0.01;
+ variable A = sin (X);
+ variable I = where (A < 0.0);
+ AI = cos (X) I;
+#v-
+ Here the variable \exmp{X} has been assigned an array of doubles
+ whose elements range from \exmp{0.0} through \exmp{10.0} in
+ increments of \exmp{0.01}. The second statement assigns \exmp{A} to
+ an array whose elements are the \ifun{sin} of the elements of \exmp{X}.
+ The third statement uses the \ifun{where} function to get the indices of
+ the elements of \exmp{A} that are less than 0. Finally, the
+ last statement replaces those elements of \exmp{A} by the cosine of the
+ corresponding elements of \exmp{X}.
+\notes
+ Support for the optional argument was added to version 2.1.0.
+\seealso{wherefirst, wherelast, wherenot, wherediff, array_info, array_shape, _isnull}
+\done
+
+\function{wherediff}
+\synopsis{Get the indices where adjacent elements differ}
+\usage{Array_Type wherediff (Array_Type A , Ref_Type jp)}
+\description
+ This function returns an array of the indices where adjacent
+ elements of the array \exmp{A} differ. If the optional second
+ argument is given, it must be a reference to a variable whose value
+ will be set to the complement indices (those where adjacient
+ elements are the same).
+
+ The returned array of indices will consist of those elements
+ \exmp{i} where \exmp{Ai != Ai-1}. Since no element preceeds the
+ 0th element, \exmp{A0} differs from its non-existing
+ preceeding element; hence the index \exmp{0} will a member of the
+ returned array.
+\example
+ Suppose that \exmp{A = 1, 1, 3, 0, 0, 4, 7, 7}. Then,
+#v+
+ i = wherediff (A, &j);
+#v-
+ will result in \exmp{i = 0, 2, 3, 5, 6} and \exmp{j = 1, 4, 7}.
+\notes
+ Higher dimensional arrays are treated as a 1-d array of contiguous
+ elements.
+\seealso{where, wherenot}
+\done
+
+\function{wherefirst}
+\synopsis{Get the index of the first non-zero array element}
+\usage{Int_Type wherefirst (Array_Type a ,start_index)}
+\description
+ The \ifun{wherefirst} function returns the index of the first
+ non-zero element of a specified array. If the optional parameter
+ \exmp{start_index} is given, the search will take place starting
+ from that index. If a non-zero element is not found, the function
+ will return \NULL.
+\notes
+ The single parameter version of this function is equivalent to
+#v+
+ define wherefirst (a)
+ {
+ variable i = where (a);
+ if (length(i))
+ return i0;
+ else
+ return NULL;
+ }
+#v-
+\seealso{where, wherelast, wherfirstmin, wherfirstmax, wherefirst_eq}
+\done
+
+\function{wherefirst_eq,
+wherefirst_ne, wherefirst_ge, wherefirst_gt, wherefirst_le, wherefirst_lt,
+wherelast_eq, wherelast_ne, wherelast_ge, wherelast_gt, wherelast_le, wherelast_lt
+}
+\synopsis{Get the first or last matching element of an array}
+\usage{Int_Type wherefirst_eq (A, b ,istart)
+ Int_Type wherefirst_ne (A, b ,istart)
+ Int_Type wherefirst_ge (A, b ,istart)
+ Int_Type wherefirst_gt (A, b ,istart)
+ Int_Type wherefirst_le (A, b ,istart)
+ Int_Type wherefirst_lt (A, b ,istart)
+ Int_Type wherelast_eq (A, b ,istart)
+ Int_Type wherelast_ne (A, b ,istart)
+ Int_Type wherelast_ge (A, b ,istart)
+ Int_Type wherelast_gt (A, b ,istart)
+ Int_Type wherelast_le (A, b ,istart)
+ Int_Type wherelast_lt (A, b ,istart)
+}
+\description
+ These functions perform the indicated binary operation between the
+ elements of numeric array \exmp{A} and a number \exmp{b}. The
+ \exmp{wherefirst_*} functions return the index of the first element for which the
+ comparison is true. The \exmp{wherelast_*} functions return the last
+ index where the binary operation is true. If no matching elements are
+ found, the functions return \NULL.
+
+ If the optional third parameter, \exmp{istart}, is given, then it
+ indicates the index into the array where the search is to start.
+
+ These functions have the following equivalent forms:
+#v+
+ wherefirst_eq (A, b, istart) <==> wherefirst (A == b, istart)
+ wherefirst_ne (A, b, istart) <==> wherefirst (A != b, istart)
+ wherefirst_ge (A, b, istart) <==> wherefirst (A >= b, istart)
+ wherefirst_gt (A, b, istart) <==> wherefirst (A > b, istart)
+ wherefirst_le (A, b, istart) <==> wherefirst (A <= b, istart)
+ wherefirst_lt (A, b, istart) <==> wherefirst (A < b, istart)
+
+ wherelast_eq (A, b, istart) <==> wherelast (A == b, istart)
+ wherelast_ne (A, b, istart) <==> wherelast (A != b, istart)
+ wherelast_ge (A, b, istart) <==> wherelast (A >= b, istart)
+ wherelast_gt (A, b, istart) <==> wherelast (A > b, istart)
+ wherelast_le (A, b, istart) <==> wherelast (A <= b, istart)
+ wherelast_lt (A, b, istart) <==> wherelast (A < b, istart)
+#v-
+ However, the \exmp{wherefirst_*} and \exmp{wherelast_*} function can
+ execute several orders of magnitude faster, depending upon the context.
+\notes
+ The current implementation of these functions is limited to numeric
+ types.
+\seealso{wherefirst, wherelast}
+
+\function{wherefirstmax}
+\synopsis{Get the index of the first maximum array value}
+\usage{Int_Type wherefirstmax (Array_Type a)}
+\description
+ This function is equivalent to
+#v+
+ index = wherefirst (a == max(a));
+#v-
+ It executes about 3 times faster, and does not require the creation of
+ temporary arrays.
+\seealso{wherefirst, wherefirstmax, wherelastmin, min, max}
+\done
+
+\function{wherefirstmin}
+\synopsis{Get the index of the first minimum array value}
+\usage{Int_Type wherefirstmin (Array_Type a)}
+\description
+ This function is equivalent to
+#v+
+ index = wherefirst (a == min(a));
+#v-
+ It executes about 3 times faster, and does not require the creation of
+ temporary arrays.
+\seealso{wherefirst, wherelastmin, wherefirstmax, min, max}
+\done
+
+\function{wherelast}
+\synopsis{Get the index of the last non-zero array element}
+\usage{Int_Type wherelast (Array_Type a ,start_index)}
+\description
+ The \ifun{wherelast} function returns the index of the last
+ non-zero element of a specified array. If the optional parameter
+ \exmp{start_index} is given, the backward search will take place starting
+ from that index. If a non-zero element is not found, the function
+ will return \NULL.
+\notes
+ The single parameter version of this function is equivalent to
+#v+
+ define wherelast (a)
+ {
+ variable i = where (a);
+ if (length(i))
+ return i-1;
+ else
+ return NULL;
+ }
+#v-
+\seealso{where, wherefirst, wherelastmin, wherelastmax, wherefirst_eq}
+\done
+
+\function{wherelastmax}
+\synopsis{Get the index of the last maximum array value}
+\usage{Int_Type wherelastmax (Array_Type a)}
+\description
+ This function is equivalent to
+#v+
+ index = wherelast (a == max(a));
+#v-
+ It executes about 3 times faster, and does not require the creation of
+ temporary arrays.
+\seealso{wherelast, wherefirstmin, wherelastmin, min, max}
+\done
+
+\function{wherelastmin}
+\synopsis{Get the index of the last minimum array value}
+\usage{Int_Type wherelastmin (Array_Type a)}
+\description
+ This function is equivalent to
+#v+
+ index = wherelast (a == min(a));
+#v-
+ It executes about 3 times faster, and does not require the creation of
+ temporary arrays.
+\seealso{wherelast, wherefirstmin, wherelastmax, min, max}
+\done
+
+\function{wherenot}
+\synopsis{Get indices where a numeric array is 0}
+\usage{Array_Type wherenot (Array_Type a)}
+\description
+ This function is equivalent to \exmp{where(not a)}. See the
+ documentation for \ifun{where} for more information.
+\seealso{where, wherediff, wherefirst, wherelast}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/assoc.tm Added

@@ -0,0 +1,61 @@
+\function{assoc_delete_key}
+\synopsis{Delete a key from an Associative Array}
+\usage{assoc_delete_key (Assoc_Type a, String_Type k)}
+\description
+  The \ifun{assoc_delete_key} function deletes a key given by \exmp{k}
+  from the associative array \exmp{a}.  If the specified key does not
+  exist in \exmp{a}, then this function has no effect.
+\seealso{assoc_key_exists, assoc_get_keys}
+\done
+
+\function{assoc_get_keys}
+\synopsis{Return all the key names of an Associative Array}
+\usage{String_Type assoc_get_keys (Assoc_Type a)}
+\description
+  This function returns all the key names of an associative array
+  \exmp{a} as an ordinary one dimensional array of strings.  If the
+  associative array contains no keys, an empty array will be returned.
+\seealso{assoc_get_values, assoc_key_exists, assoc_delete_key, length}
+\done
+
+\function{assoc_get_values}
+\synopsis{Return all the values of an Associative Array}
+\usage{Array_Type assoc_get_values (Assoc_Type a)}
+\description
+  This function returns all the values in the associative array
+  \exmp{a} as an array of proper type.  If the associative array
+  contains no keys, an empty array will be returned.
+\example
+  Suppose that \exmp{a} is an associative array of type
+  \dtype{Integer_Type}, i.e., it was created via
+#v+
+      variable a = Assoc_TypeInteger_Type;
+#v-
+  Then the following may be used to print the values of the array in
+  ascending order:
+#v+
+      define print_sorted_values (a)
+      {
+         variable v = assoc_get_values (a);
+         variable i = array_sort (v);
+         v = vi;
+         foreach (v)
+           {
+              variable vi = ();
+              () = fprintf (stdout, "%d\n", vi);
+           }
+      }
+#v-
+\seealso{assoc_get_keys, assoc_key_exists, assoc_delete_key, array_sort}
+\done
+
+\function{assoc_key_exists}
+\synopsis{Check to see whether a key exists in an Associative Array}
+\usage{Integer_Type assoc_key_exists (Assoc_Type a, String_Type k)}
+\description
+  The \ifun{assoc_key_exists} function may be used to determine whether
+  or not a specified key \exmp{k} exists in an associative array \exmp{a}.
+  It returns 1 if the key exists, or 0 if it does not.
+\seealso{assoc_get_keys, assoc_get_values, assoc_delete_key}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/bstr.tm Added

@@ -0,0 +1,217 @@
+\function{array_to_bstring}
+\synopsis{Convert an array to a binary string}
+\usage{BString_Type array_to_bstring (Array_Type a)}
+\description
+ The \ifun{array_to_bstring} function returns the elements of an
+ array \exmp{a} as a binary string.
+\seealso{bstring_to_array, init_char_array}
+\done
+
+\function{bstring_to_array}
+\synopsis{Convert a binary string to an array of bytes}
+\usage{UChar_Type bstring_to_array (BString_Type b)}
+\description
+ The \ifun{bstring_to_array} function returns an array of unsigned
+ characters whose elements correspond to the bytes in the
+ binary string.
+\seealso{array_to_bstring, init_char_array}
+\done
+
+\function{bstrcat}
+\synopsis{Concatenate binary strings}
+\usage{String_Type bstrcat (BString_Type a_1, ..., BString_Type a_N)}
+\description
+ The \ifun{bstrcat} function concatenates its N binary string
+ arguments \exmp{a_1}, ... \exmp{a_N} together and returns the result.
+\notes
+ This function will produce a result that is identical to that of
+ \ifun{strcat} if the input strings do not contain null characters.
+\seealso{strcat, bstrjoin}
+\done
+
+\function{bstrjoin}
+\synopsis{Concatenate elements of an array of BString_Type objects}
+\usage{String_Type bstrjoin (Array_Type a , BString_Type delim)}
+\description
+ The \ifun{bstrjoin} function operates on an array of binary strings
+ by joining successive elements together separated with the optional
+ delimiter \exmp{delim}. If \exmp{delim} is not specified, then
+ empty string \exmp{""} will be used resulting in a concatenation of
+ the elements.
+\seealso{bstrcat, strjoin}
+\done
+
+\function{bstrlen}
+\synopsis{Get the length of a binary string}
+\usage{UInt_Type bstrlen (BString_Type s)}
+\description
+ The \ifun{bstrlen} function may be used to obtain the length of a
+ binary string. A binary string differs from an ordinary string (a C
+ string) in that a binary string may include null characters.
+\example
+#v+
+ s = "hello\0";
+ len = bstrlen (s); % ==> len = 6
+ len = strlen (s); % ==> len = 5
+#v-
+\seealso{strlen, length}
+\done
+
+\function{count_byte_occurrences}
+\synopsis{Count the number of occurrences of a byte in a binary string}
+\usage{UInt_Type count_byte_occurrences (bstring, byte)}
+\description
+ This function returns the number of times the specified byte
+ occurs in the binary string \exmp{bstr}.
+\notes
+ This function uses byte-semantics. If character semantics are
+ desired, use the \ifun{count_char_occurrences} function.
+\seealso{count_char_occurrences}
+\done
+
+\function{is_substrbytes}
+\synopsis{test if a binary string contains a series of bytes}
+\usage{Int_Type is_substrbytes (a, b ,ofs)}
+\description
+This function may be used to see if the binary string \exmp{a}
+contains the byte-sequence given by the binary string \exmp{b}. If
+\exmp{b} is contained in \exmp{a}, then a ones-based offset of the
+first occurance of \exmp{b} in \exmp{a} is returned. Otherwise, the
+function will return 0 to indicate that \exmp{a} does not contain
+\exmp{b}.
+
+An optional 1-based parameter \exmp{ofs} may be passed to the function
+to indicate where in \exmp{a} the search is to start. The returned
+value is still a 1-based offset from the beginning of \exmp{a} where
+\exmp{b} is located.
+\notes
+ Support for the optional argument was added in version 2.3.0.
+\seealso{is_substr, count_byte_occurrences}
+\done
+
+\function{pack}
+\synopsis{Pack objects into a binary string}
+\usage{BString_Type pack (String_Type fmt, ...)}
+\description
+ The \ifun{pack} function combines zero or more objects (represented
+ by the ellipses above) into a binary string according to the format
+ string \exmp{fmt}.
+
+ The format string consists of one or more data-type specification
+ characters defined by the following table:
+#v+
+ c signed byte
+ C unsigned byte
+ h short
+ H unsigned short
+ i int
+ I unsigned int
+ l long
+ L unsigned long
+ m long long
+ M unsigned long long
+ j 16 bit int
+ J 16 bit unsigned int
+ k 32 bit int
+ K 32 bit unsigned int
+ q 64 bit int
+ Q 64 bit unsigned int
+ f float
+ d double
+ F 32 bit float
+ D 64 bit float
+ s character string, null padded
+ S character string, space padded
+ z character string, null padded
+ x a null pad character
+#v-
+ A decimal length specifier may follow the data-type specifier. With
+ the exception of the \exmp{s} and \exmp{S} specifiers, the length
+ specifier indicates how many objects of that data type are to be
+ packed or unpacked from the string. When used with the \exmp{s},
+ \exmp{S}, or \exmp{z} specifiers, it indicates the field width to be
+ used. If the length specifier is not present, the length defaults
+ to one.
+
+ When packing, unlike the \exmp{s} specifier, the \exmp{z} specifier
+ guarantees that at least one null byte will be written even if the
+ field has to be truncated to do so.
+
+ With the exception of \exmp{c}, \exmp{C}, \exmp{s}, \exmp{S}, and
+ \exmp{x}, each of these may be prefixed by a character that indicates
+ the byte-order of the object:
+#v+
+ > big-endian order (network order)
+ < little-endian order
+ = native byte-order
+#v-
+ The default is to use native byte order.
+
+ When unpacking via the \ifun{unpack} function, if the length
+ specifier is greater than one, then an array of that length will be
+ returned. In addition, trailing whitespace and null characters are
+ stripped when unpacking an object given by the \exmp{S} specifier.
+ Trailing null characters will be stripped from an object represented
+ by the \exmp{z} specifier. No such stripping is performed by the \exmp{s}
+ specifier.
+\example
+#v+
+ a = pack ("cc", 'A', 'B'); % ==> a = "AB";
+ a = pack ("c2", 'A', 'B'); % ==> a = "AB";
+ a = pack ("xxcxxc", 'A', 'B'); % ==> a = "\0\0A\0\0B";
+ a = pack ("h2", 'A', 'B'); % ==> a = "\0A\0B" or "\0B\0A"
+ a = pack (">h2", 'A', 'B'); % ==> a = "\0\xA\0\xB"
+ a = pack ("<h2", 'A', 'B'); % ==> a = "\0B\0A"
+ a = pack ("s4", "AB", "CD"); % ==> a = "AB\0\0"
+ a = pack ("s4s2", "AB", "CD"); % ==> a = "AB\0\0CD"
+ a = pack ("S4", "AB", "CD"); % ==> a = "AB "
+ a = pack ("S4S2", "AB", "CD"); % ==> a = "AB CD"
+ a = pack ("z4", "AB"); % ==> a = "AB\0\0"
+ a = pack ("s4", "ABCDEFG"); % ==> a = "ABCD"
+ a = pack ("z4", "ABCDEFG"); % ==> a = "ABC\0"
+#v-
+\seealso{unpack, sizeof_pack, pad_pack_format, sprintf}
+\done
+
+\function{pad_pack_format}
+\synopsis{Add padding to a pack format}
+\usage{BString_Type pad_pack_format (String_Type fmt)}
+\description
+ The \ifun{pad_pack_format} function may be used to add the
+ appropriate padding characters to the format \exmp{fmt} such that the
+ data types specified by the format will be properly aligned on word
+ boundaries. This is especially important when reading or writing files
+ that assume the native alignment.
+\seealso{pack, unpack, sizeof_pack}
+\done
+
+\function{sizeof_pack}
+\synopsis{Compute the size implied by a pack format string}
+\usage{UInt_Type sizeof_pack (String_Type fmt)}
+\description
+ The \ifun{sizeof_pack} function returns the size of the binary string
+ represented by the format string \exmp{fmt}. This information may be
+ needed when reading a structure from a file.
+\seealso{pack, unpack, pad_pack_format}
+\done
+
+\function{unpack}
+\synopsis{Unpack Objects from a Binary String}
+\usage{(...) = unpack (String_Type fmt, BString_Type s)}
+\description
+ The \ifun{unpack} function unpacks objects from a binary string
+ \exmp{s} according to the format \exmp{fmt} and returns the objects to
+ the stack in the order in which they were unpacked. See the
+ documentation of the \ifun{pack} function for details about the
+ format string.
+\example
+#v+
+ (x,y) = unpack ("cc", "AB"); % ==> x = 'A', y = 'B'
+ x = unpack ("c2", "AB"); % ==> x = 'A', 'B'
+ x = unpack ("x<H", "\0\xAB\xCD"); % ==> x = 0xCDABuh
+ x = unpack ("xxs4", "a b c\0d e f"); % ==> x = "b c\0"
+ x = unpack ("xxS4", "a b c\0d e f"); % ==> x = "b c"
+#v-
+\seealso{pack, sizeof_pack, pad_pack_format}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/checktm.sl Added

@@ -0,0 +1,101 @@
+#!/usr/bin/env slsh
+private define check_file (file)
+{
+ variable infun = 0, inexample = 0, innotes = 0, indescr = 0;
+ variable fp = fopen (file, "r");
+
+ variable fun_name = "";
+ variable line, strs;
+ variable lineno = 0;
+ while (-1 != fgets (&line, fp))
+ {
+	lineno++;
+
+	if (line0 != '\\')
+	 {
+	 if (inexample) inexample++;
+	 if (innotes) innotes++;
+	 if (indescr) indescr++;
+	 continue;
+	 }
+
+	if (0 == strncmp (line, "\function{"R, 10))
+	 {
+	 strs = string_matches (line, "\\function{$^}*$}"R, 1);
+	 if (strs == NULL)
+	 {
+		 () = fprintf (stderr, "%s:%d:Bad function start after function %s\n",
+				file, lineno, fun_name);
+		 continue;
+	 }
+	 if (infun)
+	 {
+		 () = fprintf (stderr, "%s:%d:Missing \\done for function %s\n",
+				file, lineno, fun_name);
+		 infun = 0;
+	 }
+	 fun_name = strs1;
+	 infun++;
+	 inexample=0;
+	 innotes=0;
+	 indescr=0;
+	 continue;
+	 }
+
+	if (inexample == 1)
+	 {
+	 () = fprintf (stderr, "%s:%d:Empty Example in %s\n",
+			 file, lineno, fun_name);
+	 inexample = 0;
+	 }
+	if (innotes == 1)
+	 {
+	 () = fprintf (stderr, "%s:%d:Empty Notes in %s\n",
+			 file, lineno, fun_name);
+	 innotes = 0;
+	 }
+	if (indescr == 1)
+	 {
+	 () = fprintf (stderr, "%s:%d:Empty Description in %s\n",
+			 file, lineno, fun_name);
+	 indescr = 0;
+	 }
+
+	if (0 == strncmp (line, "\example"R, 8))
+	 {
+	 inexample++;
+	 continue;
+	 }
+
+	if (0 == strncmp (line, "\description"R, 12))
+	 {
+	 indescr++;
+	 continue;
+	 }
+
+	if (0 == strncmp (line, "\notes"R, 6))
+	 {
+	 innotes++;
+	 continue;
+	 }
+
+	if (strncmp (line, "\done"R, 5))
+	 infun = 0;
+ }
+}
+
+define slsh_main ()
+{
+ if (__argc < 2)
+ {
+	() = fprintf (stderr, "Usage: %s files...\n", __argv0);
+	exit (1);
+ }
+ variable files = __argv1:;
+
+ foreach (files)
+ {
+	variable file = ();
+	check_file (file);
+ }
+}

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/datatype.tm Added

@@ -0,0 +1,280 @@
+\datatype{Assoc_Type}
+\synopsis{An associative array or hash type}
+\description
+  An \dtype{Assoc_Type} object is like an array except that it is
+  indexed using strings and not integers.  Unlike an \dtype{Array_Type}
+  object, the size of an associative array is not fixed, but grows as
+  objects are added to the array.  Another difference is that ordinary
+  arrays represent ordered object; however, the ordering of the
+  elements of an \var{Assoc_Type} object is unspecified.
+
+  An \dtype{Assoc_Type} object whose elements are of some data-type
+  \exmp{d} may be created using using
+#v+
+    A = Assoc_Typed;
+#v-
+  For example,
+#v+
+    A = Assoc_TypeInt_Type;
+#v-
+  will create an associative array of integers.  To create an
+  associative array capable of storing an arbitrary type, use the form
+#v+
+    A = Assoc_Type;
+#v-
+
+  An optional parameter may be used to specify a default value for
+  array elements.  For example,
+#v+
+   A = Assoc_TypeInt_Type, -1;
+#v-
+  creates an integer-valued associative array with a default element
+  value of -1.  Then \exmp{A"foo"} will return -1 if the key
+  \exmp{"foo"} does not exist in the array.  Default values are
+  available only if the type was specified when the associative array
+  was created.
+
+  The following functions may be used with associative arrays:
+#v+
+    assoc_get_keys
+    assoc_get_values
+    assoc_key_exists
+    assoc_delete_key
+#v-
+  The \ifun{length} function may be used to obtain the number of
+  elements in the array.
+
+  The \var{foreach} construct may be used with associative arrays via
+  one of the following forms:
+#v+
+      foreach k,v (A) {...}
+      foreach k (A) using ("keys") { ... }
+      foreach v (A) using ("values") { ... }
+      foreach k,v (A) using ("keys", "values") { ... }
+#v-
+  In all the above forms, the loop is over all elements of the array
+  such that \exmp{v=Ak}.
+\seealso{List_Type, Array_Type, Struct_Type}
+\done
+
+\datatype{File_Type}
+\synopsis{A type representing a C stdio object}
+\description
+  An \dtype{File_Type} is the interpreter's representation of a C
+  stdio FILE object and is usually created using the \ifun{fopen}
+  function, i.e.,
+#v+
+    fp = fopen ("file.dat", "r");
+#v-
+  Functions that utilize the \dtype{File_Type} include:
+#v+
+    fopen
+    fclose
+    fgets
+    fputs
+    ferror
+    feof
+    fflush
+    fprintf
+    fseek
+    ftell
+    fread
+    fwrite
+    fread_bytes
+#v-
+  The \var{foreach} construct may be used with \dtype{File_Type}
+  objects via one of the following forms:
+#v+
+   foreach line (fp) {...}
+   foreach byte (A) using ("char") { ... }   % read bytes
+   foreach line (A) using ("line") { ... }   % read lines (default)
+   foreach line (A) using ("wsline") { ... } % whitespace stripped from lines
+#v-
+\seealso{List_Type, Array_Type, Struct_Type}
+\done
+
+\datatype{List_Type}
+\synopsis{A list object}
+\description
+  An object of type \var{List_Type} represents a list, which is
+  defined as an ordered heterogeneous collection of objects.
+  A list may be created using, e.g.,
+#v+
+    empty_list = {};
+    list_with_4_items = {1:10, "three", 9, {1,2,3}};
+#v-
+  Note that the last item of the list in the last example is also a
+  list.  A List_Type object may be manipulated by the following
+  functions:
+#v+
+    list_new
+    list_insert
+    list_append
+    list_delete
+    list_reverse
+    list_pop
+#v-
+  A \var{List_Type} object may be indexed using an array syntax with
+  the first item on the list given by an index of 0.  The
+  \ifun{length} function may be used to obtain the number of elements
+  in the list.
+
+  A copy of the list may be created using the @ operator, e.g.,
+  \exmp{copy = @list}.
+
+  The \kw{foreach} statement may be used with a \dtype{List_Type}
+  object to loop over its elements:
+#v+
+    foreach elem (list) {....}
+#v-
+\seealso{Array_Type, Assoc_Type, Struct_Type}
+\done
+
+\datatype{String_Type}
+\synopsis{A string object}
+\description
+  An object of type \var{String_Type} represents a string of bytes or
+  characters, which in general have different semantics depending upon
+  the UTF-8 mode.
+
+  The string obeys byte-semantics when indexed as an
+  array.  That is, \exmp{S0} will return the first byte of the
+  string \exmp{S}.  For character semantics, the nth character in the
+  string may be obtained using \ivar{substr} function.
+
+  The \kw{foreach} statement may be used with a \dtype{String_Type}
+  object \exmp{S} to loop over its bytes:
+#v+
+    foreach b (S) {....}
+    foreach b (S) using ("bytes") {....}
+#v-
+  To loop over its characters, the following form may be used:
+#v+
+    foreach c (S) using ("chars") {...}
+#v-
+  When UTF-8 mode is not in effect, the byte and character forms will
+  produce the same sequence.  Otherwise, the string will be decoded
+  to generate the (wide) character sequence.  If the string contains
+  an invalid UTF-8 encoded character, successive bytes of the invalid
+  sequence will be returned as negative integers.  For example,
+  \exmp{"a\\xAB\\x{AB}"} specifies a string composed of the character
+  \exmp{a}, a byte \exmp{0xAB}, and the character \exmp{0xAB}.  In
+  this case,
+#v+
+     foreach c ("a\xAB\x{AB}") {...}
+#v-
+  will produce the integer-valued sequence \exmp{'a', -0xAB, 0xAB}.
+
+\seealso{Array_Type, _slang_utf8_ok}
+\done
+
+\datatype{Struct_Type}
+\synopsis{A structure datatype}
+\description
+  A \dtype{Struct_Type} object with fields \exmp{f1}, \exmp{f2},...,
+  \exmp{fN} may be created using
+#v+
+    s = struct { f1, f2, ..., fN };
+#v-
+  The fields may be accessed via the "dot" operator, e.g.,
+#v+
+     s.f1 = 3;
+     if (s12.f1 == 4) s.f1++;
+#v-
+  By default, all fields will be initialized to \NULL.
+
+  A structure may also be created using the dereference operator (@):
+#v+
+    s = @Struct_Type ("f1", "f2", ..., "fN");
+    s = @Struct_Type ( "f1", "f2", ..., "fN" );
+#v-
+  Functions for manipulating structure fields include:
+#v+
+     _push_struct_field_values
+     get_struct_field
+     get_struct_field_names
+     set_struct_field
+     set_struct_fields
+#v-
+
+  The \kw{foreach} loop may be used to loop over elements of a linked
+  list.  Suppose that first structure in the list is called
+  \exmp{root}, and that the \exmp{child} field is used to form the
+  chain.  Then one may walk the list using:
+#v+
+     foreach s (root) using ("child")
+      {
+         % s will take on successive values in the list
+          .
+          .
+      }
+#v-
+  The loop will terminate when the last elements \exmp{child} field is
+  \NULL.  If no ``linking'' field is specified, the field name will
+  default to \exmp{next}.
+
+  User-defined data types are similar to the \var{Struct_Type}.  A
+  type, e.g., \exmp{Vector_Type} may be created using:
+#v+
+    typedef struct { x, y, z } Vector_Type;
+#v-
+  Objects of this type may be created via the @ operator, e.g.,
+#v+
+    v = @Vector_Type;
+#v-
+  It is recommended that this be used in a function for creating such
+  types, e.g.,
+#v+
+    define vector (x, y, z)
+    {
+       variable v = @Vector_Type;
+       v.x = x;
+       v.y = y;
+       v.z = z;
+       return v;
+    }
+#v-
+  The action of the binary and unary operators may be defined for such
+  types.  Consider the "+" operator.  First define a function for
+  adding two \exmp{Vector_Type} objects:
+#v+
+    static define vector_add (v1, v2)
+    {
+       return vector (v1.x+v2.x, v1.y+v2.y, v1.z, v2.z);
+    }
+#v-
+  Then use
+#v+
+    __add_binary ("+", Vector_Type, &vector_add, Vector_Type, Vector_Type);
+#v-
+  to indicate that the function is to be called whenever the "+"
+  binary operation between two \exmp{Vector_Type} objects takes place,
+  e.g.,
+#v+
+    V1 = vector (1, 2, 3);
+    V2 = vector (8, 9, 1);
+    V3 = V1 + V2;
+#v-
+  will assigned the vector (9, 11, 4) to \exmp{V3}.  Similarly, the
+  \exmp{"*"} operator between scalars and vectors may be defined using:
+#v+
+    static define vector_scalar_mul (v, a)
+    {
+       return vector (a*v.x, a*v.y, a*v.z);
+    }
+    static define scalar_vector_mul (a, v)
+    {
+       return vector_scalar_mul (v, a);
+    }
+    __add_binary ("*", Vector_Type, &scalar_vector_mul, Any_Type, Vector_Type);
+    __add_binary ("*", Vector_Type, &vector_scalar_mul, Vector_Type, Any_Type);
+#v-
+  Related functions include:
+#v+
+    __add_unary
+    __add_string
+    __add_destroy
+#v-
+\seealso{List_Type, Assoc_Type}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/debug.tm Added

@@ -0,0 +1,280 @@
+\variable{_bofeof_info}
+\synopsis{Control the generation of function callback code}
+\usage{Int_Type _bofeof_info}
+\description
+ This value of this variable dictates whether or not the \slang
+ interpreter will generate code to call the beginning and end of
+ function callback handlers.  The value of this variable is local to
+ the compilation unit, but is inherited by other units loaded by the
+ current unit.
+
+ If the value of this variable is 1 when a function is defined, then
+ when the function is executed, the callback handlers defined via
+ \ifun{_set_bof_handler} and \ifun{_set_eof_handler} will be called.
+\seealso{_set_bof_handler, _set_eof_handler, _boseos_info}
+\done
+
+\variable{_boseos_info}
+\synopsis{Control the generation of BOS/EOS callback code}
+\usage{Int_Type _boseos_info}
+\description
+ This value of this variable dictates whether or not the \slang
+ interpreter will generate code to call the beginning and end of
+ statement callback handlers.  The value of this variable is local to
+ the compilation unit, but is inherited by other units loaded by the
+ current unit.
+
+ The lower 8 bits of \ivar{_boseos_info} controls the generation of code for
+ callbacks as follows:
+#v+
+   Value      Description
+   -----------------------------------------------------------------
+     0        No code for making callbacks will be produced.
+     1        Callback generation will take place for all non-branching
+              and looping statements.
+     2        Same as for 1 with the addition that code will also be
+              generated for branching statements (if, !if, loop, ...)
+     3        Same as 2, but also including break and continue
+              statements.
+#v-
+ A non-branching statement is one that does not effect chain of
+ execution.  Branching statements include all looping statements,
+ conditional statement, \exmp{break}, \exmp{continue}, and \exmp{return}.
+
+ If bit 0x100 is set, callbacks will be generated for preprocessor
+ statements.
+\example
+ Consider the following:
+#v+
+   _boseos_info = 1;
+   define foo ()
+   {
+      if (some_expression)
+        some_statement;
+   }
+   _boseos_info = 2;
+   define bar ()
+   {
+      if (some_expression)
+        some_statement;
+   }
+#v-
+ The function \exmp{foo} will be compiled with code generated to call the
+ BOS and EOS handlers when \exmp{some_statement} is executed.  The
+ function \exmp{bar} will be compiled with code to call the handlers
+ for both \exmp{some_expression} and \exmp{some_statement}.
+\notes
+ The \sldb debugger and \slsh's \exmp{stkcheck.sl} make use of this
+ facility.
+\seealso{_set_bos_handler, _set_eos_handler, _bofeof_info}
+\done
+
+\function{_clear_error}
+\synopsis{Clear an error condition (deprecated)}
+\usage{_clear_error ()}
+\description
+  This function has been deprecated.  New code should make use of
+  try-catch exception handling.
+
+  This function may be used in error-blocks to clear the error that
+  triggered execution of the error block.  Execution resumes following
+  the statement, in the scope of the error-block, that triggered the
+  error.
+\example
+  Consider the following wrapper around the \ifun{putenv} function:
+#v+
+    define try_putenv (name, value)
+    {
+       variable status;
+       ERROR_BLOCK
+        {
+          _clear_error ();
+          status = -1;
+        }
+       status = 0;
+       putenv (sprintf ("%s=%s", name, value);
+       return status;
+    }
+#v-
+  If \ifun{putenv} fails, it generates an error condition, which the
+  \exmp{try_putenv} function catches and clears.  Thus \exmp{try_putenv}
+  is a function that returns -1 upon failure and 0 upon
+  success.
+\seealso{_trace_function, _slangtrace, _traceback}
+\done
+
+\function{_get_frame_info}
+\synopsis{Get information about a stack frame}
+\usage{Struct_Type _get_frame_info (Integer_Type depth)}
+\description
+  \ifun{_get_frame_info} returns a structure with information about
+  the function call stack from of depth \svar{depth}. The structure
+  contains the following fields:
+#v+
+    file: The file that contains the code of the stack frame.
+    line: The line number the file the stack frame is in.
+    function: the name of the function containing the code of the stack
+      frame; it might be NULL if the code isn't inside a function.
+    locals: Array of String_Type containing the names of variables local
+      to the stack frame; it might be NULL if the stack frame doesn't
+      belong to a function.
+    namespace: The namespace the code of this stack frame is in.
+#v-
+\seealso{_get_frame_variable, _use_frame_namespace}
+\done
+
+\function{_get_frame_variable}
+\synopsis{Get the value of a variable local to a stack frame}
+\usage{Any_Type _get_frame_variable (Integer_Type depth, String_Type name)}
+\description
+  This function returns value of the variable \exmp{name} in the stack
+  frame at depth \exmp{depth}.  This might not only be a local variable but
+  also variables from outer scopes, e.g., a variable private to the
+  namespace.
+
+  If no variable with this name is found an \exc{UndefinedNameError}
+  will be thrown.  An \exc{VariableUninitializedError} will be
+  generated if the variable has no value.
+\seealso{_get_frame_info, _use_frame_namespace}
+\done
+
+\function{_set_bof_handler}
+\synopsis{Set the beginning of function callback handler}
+\usage{_set_bof_handler (Ref_Type func)}
+\description
+ This function is used to set the function to be called prior to the
+ execution of the body \slang function but after its arguments have
+ been evaluated, provided that function was defined
+ with \ivar{_bofeof_info} set appropriately.  The callback function
+ must be defined to take two parameters, the function name and the
+ filename and must return nothing.
+\example
+#v+
+    private define bof_handler (fun, file)
+    {
+      () = fputs ("About to execute function $fun from file $file"$, stdout);
+    }
+    _set_bof_handler (&bof_handler);
+#v-
+\seealso{_set_eof_handler, _boseos_info, _set_bos_handler}
+\done
+
+\function{_set_bos_handler}
+\synopsis{Set the beginning of statement callback handler}
+\usage{_set_bos_handler (Ref_Type func)}
+\description
+ This function is used to set the function to be called prior to the
+ beginning of a statement.  The function will be passed two
+ parameters: the name of the file and the line number of the statement
+ to be executed.  It should return nothing.
+\example
+#v+
+    private define bos_handler (file, line)
+    {
+      () = fputs ("About to execute $file:$line\n"$, stdout);
+    }
+    _set_bos_handler (&bos_handler);
+#v-
+\notes
+ The beginning and end of statement handlers will be called for
+ statements in a file only if that file was compiled with the variable
+ \ivar{_boseos_info} set to a non-zero value.
+\seealso{_set_eos_handler, _boseos_info, _bofeof_info}
+\done
+
+\function{_set_eof_handler}
+\synopsis{Set the beginning of function callback handler}
+\usage{_set_eof_handler (Ref_Type func)}
+\description
+ This function is used to set the function to be called at the end of
+ execution of a \slang function, provided that function was compiled with
+ \ivar{_bofeof_info} set accordingly.
+
+ The callback function will be passed no parameters and it must return
+ nothing.
+\example
+#v+
+   private define eof_handler ()
+   {
+     () = fputs ("Done executing the function\n", stdout);
+   }
+   _set_eof_handler (&eof_handler);
+#v-
+\seealso{_set_bof_handler, _bofeof_info, _boseos_info}
+\done
+
+\function{_set_eos_handler}
+\synopsis{Set the end of statement callback handler}
+\usage{_set_eos_handler (Ref_Type func)}
+\description
+ This function is used to set the function to be called at the end of
+ a statement.  The function will be passed no parameters and it should
+ return nothing.
+\example
+#v+
+   private define eos_handler ()
+   {
+     () = fputs ("Done executing the statement\n", stdout);
+   }
+   _set_eos_handler (&eos_handler);
+#v-
+\notes
+ The beginning and end of statement handlers will be called for
+ statements in a file only if that file was compiled with the variable
+ \ivar{_boseos_info} set to a non-zero value.
+\seealso{_set_bos_handler, _boseos_info, _bofeof_info}
+\done
+
+\variable{_slangtrace}
+\synopsis{Turn function tracing on or off}
+\usage{Integer_Type _slangtrace}
+\description
+  The \ivar{_slangtrace} variable is a debugging aid that when set to a
+  non-zero value enables tracing when function declared by
+  \ifun{_trace_function} is entered.  If the value is greater than
+  zero, both intrinsic and user defined functions will get traced.
+  However, if set to a value less than zero, intrinsic functions will
+  not get traced.
+\seealso{_trace_function, _traceback, _print_stack}
+\done
+
+\variable{_traceback}
+\synopsis{Generate a traceback upon error}
+\usage{Integer_Type _traceback}
+\description
+  \ivar{_traceback} is an intrinsic integer variable whose bitmapped value
+  controls the generation of the call-stack traceback upon error.
+  When set to 0, no traceback will be generated.  Otherwise its value
+  is the bitwise-or of the following integers:
+#v+
+       1        Create a full traceback
+       2        Omit local variable information
+       4        Generate just one line of traceback
+#v-
+  The default value of this variable is 4.
+\notes
+  Running \slsh with the \exmp{-g} option causes this variable to be
+  set to 1.
+\seealso{_boseos_info}
+\done
+
+\function{_trace_function}
+\synopsis{Set the function to trace}
+\usage{_trace_function (String_Type f)}
+\description
+  \ifun{_trace_function} declares that the \slang function with name
+  \exmp{f} is to be traced when it is called.  Calling
+  \ifun{_trace_function} does not in itself turn tracing on.  Tracing
+  is turned on only when the variable \ivar{_slangtrace} is non-zero.
+\seealso{_slangtrace, _traceback}
+\done
+
+\function{_use_frame_namespace}
+\synopsis{Selects the namespace of a stack frame}
+\usage{_use_frame_namespace (Integer_Type depth)}
+\description
+  This function sets the current namespace to the one belonging to the
+  call stack frame at depth \svar{depth}.
+\seealso{_get_frame_info, _get_frame_variable}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/dir.tm Added

@@ -0,0 +1,337 @@
+\function{access}
+\synopsis{Check to see if a file is accessible}
+\usage{Int_Type access (String_Type pathname, Int_Type mode)}
+\description
+ This functions checks to see if the current process has access to the
+ specified pathname.  The \exmp{mode} parameter determines the type of
+ desired access.  Its value is given by the bitwise-or of one or more
+ of the following constants:
+#v+
+    R_OK   Check for read permission
+    W_OK   Check for write permission
+    X_OK   Check for execute permission
+    F_OK   Check for existence
+#v-
+
+ The function will return 0 if process has the requested access
+ permissions to the file, otherwise it will return -1 and set
+ \ivar{errno} accordingly.
+
+ Access to a file depends not only upon the file itself, but also upon
+ the permissions of each of the directories in the pathname.  The
+ checks are done using the real user and group ids of the process, and
+ not using the effective ids.
+\seealso{stat_file}
+\done
+
+\function{chdir}
+\synopsis{Change the current working directory}
+\usage{Int_Type chdir (String_Type dir)}
+\description
+  The \ifun{chdir} function may be used to change the current working
+  directory to the directory specified by \exmp{dir}.  Upon success it
+  returns zero.  Upon failure it returns \exmp{-1} and sets
+  \ivar{errno} accordingly.
+\seealso{mkdir, stat_file}
+\done
+
+\function{chmod}
+\synopsis{Change the mode of a file}
+\usage{Int_Type chmod (String_Type file, Int_Type mode)}
+\description
+  The \ifun{chmod} function changes the permissions of the specified
+  file to those given by \exmp{mode}.  It returns \exmp{0} upon
+  success, or \exmp{-1} upon failure setting \ivar{errno} accordingly.
+
+  See the system specific documentation for the C library
+  function \ifun{chmod} for a discussion of the \exmp{mode} parameter.
+\seealso{chown, stat_file}
+\done
+
+\function{chown}
+\synopsis{Change the owner of a file}
+\usage{Int_Type chown (String_Type file, Int_Type uid, Int_Type gid)}
+\description
+  The \ifun{chown} function is used to change the user-id and group-id of
+  \exmp{file} to \exmp{uid} and \exmp{gid}, respectively.  It returns
+  0 upon success and -1 upon failure, with \ivar{errno}
+  set accordingly.
+\notes
+  On most systems, only the superuser can change the ownership of a
+  file.
+
+  Some systems do not support this function.
+\seealso{lchown, chmod, stat_file}
+\done
+
+\function{getcwd}
+\synopsis{Get the current working directory}
+\usage{String_Type getcwd ()}
+\description
+  The \ifun{getcwd} function returns the absolute pathname of the
+  current working directory.  If an error occurs or it cannot
+  determine the working directory, it returns \NULL and sets
+  \ivar{errno} accordingly.
+\notes
+  Under Unix, OS/2, and MSDOS, the pathname returned by this function
+  includes the trailing slash character.  It may also include
+  the drive specifier for systems where that is meaningful.
+\seealso{mkdir, chdir, errno}
+\done
+
+\function{hardlink}
+\synopsis{Create a hard-link}
+\usage{Int_Type hardlink (String_Type oldpath, String_Type newpath)}
+\description
+  The \ifun{hardlink} function creates a hard-link called
+  \exmp{newpath} to the existing file \exmp{oldpath}.  If the link was
+  successfully created, the function will return 0.  Upon error, the
+  function returns -1 and sets \ivar{errno} accordingly.
+\notes
+  Not all systems support the concept of a hard-link.
+\seealso{symlink}
+\done
+
+\function{lchown}
+\synopsis{Change the owner of a file}
+\usage{Int_Type lchown (String_Type file, Int_Type uid, Int_Type gid)}
+\description
+  The \ifun{lchown} function is like \ifun{chown}, except that it does
+  not dereference a symbolic link.  Hence, it may be used to change
+  the ownership of a symbolic link itself, and not to what it
+  references.  See the documentation for the \ifun{chown} function for
+  more details.
+\seealso{chown, chmod, stat_file}
+\done
+
+\function{listdir}
+\synopsis{Get a list of the files in a directory}
+\usage{String_Type listdir (String_Type dir)}
+\description
+  The \ifun{listdir} function returns the directory listing of all the
+  files in the specified directory \exmp{dir} as an array of strings.
+  It does not return the special files \exmp{".."} and \exmp{"."} as
+  part of the list.
+\seealso{stat_file, stat_is, length}
+\done
+
+\function{lstat_file}
+\synopsis{Get information about a symbolic link}
+\usage{Struct_Type lstat_file (String_Type file)}
+\description
+  The \ifun{lstat_file} function behaves identically to \ifun{stat_file}
+  but if \exmp{file} is a symbolic link, \ifun{lstat_file} returns
+  information about the link itself, and not the file that it
+  references.
+
+  See the documentation for \ifun{stat_file} for more information.
+\notes
+  On systems that do not support symbolic links, there is no
+  difference between this function and the \ifun{stat_file} function.
+\seealso{stat_file, stat_is, stat_mode_to_string, readlink}
+\done
+
+\function{mkdir}
+\synopsis{Create a new directory}
+\usage{Int_Type mkdir (String_Type dir ,Int_Type mode)}
+\description
+  The \ifun{mkdir} function creates a directory whose name is specified
+  by the \exmp{dir} parameter with permissions given by the optional
+  \exmp{mode} parameter.  Upon success \ifun{mkdir} returns 0, or it
+  returns \exmp{-1} upon failure setting \ivar{errno} accordingly.  In
+  particular, if the directory already exists, the function will fail
+  and set errno to \icon{EEXIST}.
+\example
+  The following function creates a new directory, if it does not
+  already exist (indicated by \exmp{errno==EEXIST}).
+#v+
+     define my_mkdir (dir)
+     {
+        if (0 == mkdir (dir)) return;
+        if (errno == EEXIST) return;
+        throw IOError,
+           sprintf ("mkdir %s failed: %s", dir, errno_string (errno));
+     }
+#v-
+\notes
+  The \exmp{mode} parameter may not be meaningful on all systems.  On
+  systems where it is meaningful, the actual permissions on the newly
+  created directory are modified by the process's umask.
+\seealso{rmdir, getcwd, chdir, fopen, errno}
+\done
+
+\function{readlink}
+\synopsis{String_Type readlink (String_Type path)}
+\usage{Get the value of a symbolic link}
+\description
+  The \ifun{readlink} function returns the value of a symbolic link.
+  Upon failure, \NULL is returned and \ivar{errno} set accordingly.
+\notes
+  Not all systems support this function.
+\seealso{symlink, lstat_file, stat_file, stat_is}
+\done
+
+\function{remove}
+\synopsis{Delete a file}
+\usage{Int_Type remove (String_Type file)}
+\description
+  The \ifun{remove} function deletes a file.  It returns 0 upon
+  success, or -1 upon error and sets \ivar{errno} accordingly.
+\seealso{rename, rmdir}
+\done
+
+\function{rename}
+\synopsis{Rename a file}
+\usage{Int_Type rename (String_Type old, String_Type new)}
+\description
+  The \ifun{rename} function renames a file from \exmp{old} to \exmp{new}
+  moving it between directories if necessary.  This function may fail
+  if the directories are not on the same file system.  It returns
+  0 upon success, or -1 upon error and sets \ivar{errno} accordingly.
+\seealso{remove, errno}
+\done
+
+\function{rmdir}
+\synopsis{Remove a directory}
+\usage{Int_Type rmdir (String_Type dir)}
+\description
+  The \ifun{rmdir} function deletes the specified directory.  It returns
+  0 upon success or -1 upon error and sets \ivar{errno} accordingly.
+\notes
+  The directory must be empty before it can be removed.
+\seealso{rename, remove, mkdir}
+\done
+
+\function{stat_file}
+\synopsis{Get information about a file}
+\usage{Struct_Type stat_file (String_Type file)}
+\description
+  The \ifun{stat_file} function returns information about \exmp{file}
+  through the use of the system \cfun{stat} call.  If the stat call
+  fails, the function returns \NULL and sets errno accordingly.
+  If it is successful, it returns a stat structure with the following
+  integer-value fields:
+#v+
+    st_dev
+    st_ino
+    st_mode
+    st_nlink
+    st_uid
+    st_gid
+    st_rdev
+    st_size
+    st_atime
+    st_mtime
+    st_ctime
+#v-
+  See the C library documentation of \cfun{stat} for a discussion of the
+  meanings of these fields.
+\example
+  The following example shows how the \ifun{stat_file} function may be
+  used to get the size of a file:
+#v+
+     define file_size (file)
+     {
+        variable st;
+        st = stat_file(file);
+        if (st == NULL)
+          throw IOError, "Unable to stat $file"$;
+        return st.st_size;
+     }
+#v-
+\seealso{lstat_file, stat_is, stat_mode_to_string, utime}
+\done
+
+\function{stat_is}
+\synopsis{Parse the st_mode field of a stat structure}
+\usage{Char_Type stat_is (String_Type type, Int_Type st_mode)}
+\description
+  The \ifun{stat_is} function returns a boolean value according to
+  whether or not the \exmp{st_mode} parameter is of the specified type.
+  Specifically, \exmp{type} must be one of the strings:
+#v+
+     "sock"     (socket)
+     "fifo"     (fifo)
+     "blk"      (block device)
+     "chr"      (character device)
+     "reg"      (regular file)
+     "lnk"      (link)
+     "dir"      (dir)
+#v-
+  It returns a non-zero value if \exmp{st_mode} corresponds to
+  \exmp{type}.
+\example
+  The following example illustrates how to use the \ifun{stat_is}
+  function to determine whether or not a file is a directory:
+#v+
+     define is_directory (file)
+     {
+        variable st;
+
+        st = stat_file (file);
+        if (st == NULL) return 0;
+        return stat_is ("dir", st.st_mode);
+     }
+#v-
+\seealso{stat_file, lstat_file, stat_mode_to_string}
+\done
+
+\function{stat_mode_to_string}
+\synopsis{Format the file type code and access permission bits as a string}
+\usage{String_Type stat_mode_to_string (Int_Type st_mode)}
+\description
+  The \ifun{stat_mode_to_string} function returns a 10 characters string
+  that indicates the type and permissions of a file as represented by
+  the \var{st_mode} parameter.  The returned string consists of the following
+  characters:
+#v+
+     "s"      (socket)
+     "p"      (fifo)
+     "b"      (block device)
+     "c"      (character device)
+     "-"      (regular file)
+     "l"      (link)
+     "d"      (dir)
+#v-
+  The access permission bit is one of the following characters:
+#v+
+     "s"      (set-user-id)
+     "w"      (writable)
+     "x"      (executable)
+     "r"      (readable)
+#v-
+\notes
+  This function is an \slsh intrinsic.  As such, it is not part of
+  \slang proper.
+\seealso{stat_file, lstat_file, stat_is}
+\done
+
+\function{symlink}
+\synopsis{Create a symbolic link}
+\usage{Int_Type symlink (String_Type oldpath, String_Type new_path)}
+\description
+  The \ifun{symlink} function may be used to create a symbolic link
+  named \exmp{new_path} for  \exmp{oldpath}.  If successful, the function
+  returns 0, otherwise it returns -1 and sets \ivar{errno} appropriately.
+\notes
+  This function is not supported on all systems and even if supported,
+  not all file systems support the concept of a symbolic link.
+\seealso{readlink, hardlink}
+\done
+
+\function{utime}
+\synopsis{Change a file's last access and modification times}
+\usage{Int_Type utime(String_Type file, Double_Type actime, Double_Type modtime)}
+\description
+ This function may be used to change the last access (actime) and last
+ modification (modtime) times associated with the specified file.  If
+ successful, the function returns 0; otherwise it returns -1 and sets
+ \ivar{errno} accordingly.
+\notes
+ The \ifun{utime} function will call the C library \cfun{utimes}
+ function if available, which permits microsecond accuracy.
+ Otherwise, it will truncate the time arguments to integers and call
+ the \cfun{utime} function.
+\seealso{stat_file}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/eval.tm Added

@@ -0,0 +1,159 @@
+\function{_$}
+\synopsis{Expand the dollar-escaped variables in a string}
+\usage{String_Type _$(String_Type s)}
+\description
+ This function expands the dollar-escaped variables in a string and
+ returns the resulting string.
+\example
+ Consider the following code fragment:
+#v+
+     private variable Format = "/tmp/foo-$time.$pid";
+     define make_filename ()
+     {
+        variable pid = getpid ();
+        variable time = _time ();
+        return _$(Format);
+     }
+#v-
+ Note that the variable \exmp{Format} contains dollar-escaped
+ variables, but because the \exmp{$} suffix was omitted from the
+ string literal, the variables are not expanded.  Instead expansion is
+ deferred until execution of the \exmp{make_filename} function through
+ the use of the \exmp{_$} function.
+\seealso{eval, getenv}
+\done
+
+\function{autoload}
+\synopsis{Load a function from a file}
+\usage{autoload (String_Type funct, String_Type file)}
+\description
+  The \ifun{autoload} function is used to declare \exmp{funct} to the
+  interpreter and indicate that it should be loaded from \exmp{file}
+  when it is actually used.  If \exmp{func} contains a namespace
+  prefix, then the file will be loaded into the corresponding
+  namespace.  Otherwise, if the \ifun{autoload} function is called
+  from an execution namespace that is not the Global namespace nor an
+  anonymous namespace, then the file will be loaded into the execution
+  namespace.
+\example
+    Suppose \exmp{bessel_j0} is a function defined in the file
+    \exmp{bessel.sl}.  Then the statement
+#v+
+      autoload ("bessel_j0", "bessel.sl");
+#v-
+    will cause \exmp{bessel.sl} to be loaded prior to the execution of
+    \exmp{bessel_j0}.
+\seealso{evalfile, import}
+\done
+
+\function{byte_compile_file}
+\synopsis{Compile a file to byte-code for faster loading.}
+\usage{byte_compile_file (String_Type file, Int_Type method)}
+\description
+  The \ifun{byte_compile_file} function byte-compiles \exmp{file}
+  producing a new file with the same name except a \exmp{'c'} is added
+  to the output file name.  For example, \exmp{file} is
+  \exmp{"site.sl"}, then this function produces a new file named
+  \exmp{site.slc}.
+\notes
+  The \exmp{method} parameter is not used in the current
+  implementation, but may be in the future.  For now, set
+  it to \exmp{0}.
+\seealso{evalfile}
+\done
+
+\function{eval}
+\synopsis{Interpret a string as \slang code}
+\usage{eval (String_Type expression ,String_Type namespace)}
+\description
+  The \ifun{eval} function parses a string as S-Lang code and executes the
+  result.  If called with the optional namespace argument, then the
+  string will be evaluated in the specified namespace.  If that
+  namespace does not exist it will be created first.
+
+  This is a useful function in many contexts including those where
+  it is necessary to dynamically generate function definitions.
+\example
+#v+
+    if (0 == is_defined ("my_function"))
+      eval ("define my_function () { message (\"my_function\"); }");
+#v-
+\seealso{is_defined, autoload, evalfile}
+\done
+
+\function{evalfile}
+\synopsis{Interpret a file containing \slang code}
+\usage{Int_Type evalfile (String_Type file ,String_Type namespace)}
+\description
+  The \ifun{evalfile} function loads \exmp{file} into the interpreter
+  and executes it.  If called with the optional namespace argument,
+  the file will be loaded into the specified namespace, which will be
+  created if necessary.  If given no namespace argument and the file
+  has already been loaded, then it will be loaded again into an
+  anonymous namespace.  A namespace argument given by the empty string
+  will also cause the file to be loaded into a new anonymous namespace.
+
+  If no errors were encountered, 1 will be returned; otherwise,
+  a \slang exception will be thrown and the function will return zero.
+\example
+#v+
+    define load_file (file)
+    {
+       try
+       {
+         () = evalfile (file);
+       }
+       catch AnyError;
+    }
+#v-
+\notes
+  For historical reasons, the return value of this function is not
+  really useful.
+
+  The file is searched along an application-defined load-path.  The
+  \ifun{get_slang_load_path} and \ifun{set_slang_load_path} functions
+  may be used to set and query the path.
+\seealso{eval, autoload, set_slang_load_path, get_slang_load_path}
+\done
+
+\function{get_slang_load_path}
+\synopsis{Get the value of the interpreter's load-path}
+\usage{String_Type get_slang_load_path ()}
+\description
+  This function retrieves the value of the delimiter-separated search
+  path used for loading files.  The delimiter is OS-specific and may
+  be queried using the \ifun{path_get_delimiter} function.
+\notes
+  Some applications may not support the built-in load-path searching
+  facility provided by the underlying library.
+\seealso{set_slang_load_path, path_get_delimiter}
+\done
+
+\function{set_slang_load_path}
+\synopsis{Set the value of the interpreter's load-path}
+\usage{set_slang_load_path (String_Type path)}
+\description
+  This function may be used to set the value of the
+  delimiter-separated search path used by the \ifun{evalfile} and
+  \ifun{autoload} functions for locating files.  The delimiter is
+  OS-specific and may be queried using the \ifun{path_get_delimiter}
+  function.
+\example
+#v+
+    public define prepend_to_slang_load_path (p)
+    {
+       variable s = stat_file (p);
+       if (s == NULL) return;
+       if (0 == stat_is ("dir", s.st_mode))
+         return;
+
+       p = sprintf ("%s%c%s", p, path_get_delimiter (), get_slang_load_path ());
+       set_slang_load_path (p);
+    }
+#v-
+\notes
+  Some applications may not support the built-in load-path searching
+  facility provided by the underlying library.
+\seealso{get_slang_load_path, path_get_delimiter, evalfile, autoload}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/import.tm Added

@@ -0,0 +1,54 @@
+\function{get_import_module_path}
+\synopsis{Get the search path for dynamically loadable objects}
+\usage{String_Type get_import_module_path ()}
+\description
+  The \ifun{get_import_module_path} may be used to get the search path
+  for dynamically shared objects.  Such objects may be made accessible
+  to the application via the \ifun{import} function.
+\seealso{import, set_import_module_path}
+\done
+
+\function{import}
+\synopsis{Dynamically link to a specified module}
+\usage{import (String_Type module , String_Type namespace)}
+\description
+  The \ifun{import} function causes the run-time linker to dynamically
+  link to the shared object specified by the \exmp{module} parameter.
+  It searches for the shared object as follows: First a search is
+  performed along all module paths specified by the application.  Then
+  a search is made along the paths defined via the
+  \ifun{set_import_module_path} function.  If not found, a search is
+  performed along the paths given by the \env{SLANG_MODULE_PATH}
+  environment variable.  Finally, a system dependent search is
+  performed (e.g., using the \env{LD_LIBRARY_PATH} environment
+  variable).
+
+  The optional second parameter may be used to specify a namespace
+  for the intrinsic functions and variables of the module.  If this
+  parameter is not present, the intrinsic objects will be placed into
+  the active namespace, or global namespace if the active namespace is
+  anonymous.
+
+  This function throws an \exc{ImportError} if the specified module is
+  not found.
+\notes
+  The \ifun{import} function is not available on all systems.
+\seealso{set_import_module_path, use_namespace, current_namespace, getenv, evalfile}
+\done
+
+\function{set_import_module_path}
+\synopsis{Set the search path for dynamically loadable objects}
+\usage{set_import_module_path (String_Type path_list)}
+\description
+  The \ifun{set_import_module_path} may be used to set the search path
+  for dynamically shared objects.  Such objects may be made accessible
+  to the application via the \ifun{import} function.
+
+  The actual syntax for the specification of the set of paths will
+  vary according to the operating system.  Under Unix, a colon
+  character is used to separate paths in \exmp{path_list}.  For win32
+  systems a semi-colon is used.  The \ifun{path_get_delimiter}
+  function may be used to get the value of the delimiter.
+\seealso{import, get_import_module_path, path_get_delimiter}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/info.tm Added

@@ -0,0 +1,252 @@
+\function{add_doc_file}
+\synopsis{Make a documentation file known to the help system}
+\usage{add_doc_file (String_Type file)}
+\description
+  The \ifun{add_doc_file} is used to add a documentation file to the
+  system.  Such files are searched by the
+  \ifun{get_doc_string_from_file} function.  The \exmp{file} must be
+  specified using the full path.
+\seealso{set_doc_files, get_doc_files, get_doc_string_from_file}
+\done
+
+\function{_apropos}
+\synopsis{Generate a list of functions and variables}
+\usage{Array_Type _apropos (String_Type ns, String_Type s, Integer_Type flags)}
+\description
+  The \ifun{_apropos} function may be used to get a list of all defined
+  objects in the namespace \exmp{ns} whose name matches the regular
+  expression \exmp{s} and whose type matches those specified by
+  \exmp{flags}.  It returns an array of strings containing the names
+  matched.
+
+  The third parameter \exmp{flags} is a bit mapped value whose bits
+  are defined according to the following table
+#v+
+     1          Intrinsic Function
+     2          User-defined Function
+     4          Intrinsic Variable
+     8          User-defined Variable
+#v-
+\example
+#v+
+    define apropos (s)
+    {
+      variable n, name, a;
+      a = _apropos ("Global", s, 0xF);
+
+      vmessage ("Found %d matches:", length (a));
+      foreach name (a)
+        message (name);
+    }
+#v-
+  prints a list of all matches.
+\notes
+  If the namespace specifier \exmp{ns} is the empty string \exmp{""},
+  then the namespace will default to the static namespace of the
+  current compilation unit.
+\seealso{is_defined, sprintf, _get_namespaces}
+\done
+
+\variable{__FILE__}
+\synopsis{Path of the compilation unit}
+\usage{String_Type __FILE__}
+\description
+  Every private namespace has \ivar{__FILE__} variable associated with
+  it.  If the namespace is associated with a file, then the value of
+  this variable will be equal to the pathname of the file.  If the
+  namespace is associated with a string, such as one passed to the
+  \ifun{eval} function, then the value of this variable will be
+  \exmp{"***string***"};
+\notes
+  In the case of a file, the pathname may be an absolute path or a
+  relative one.  If it is a relative one, then it will be relative to
+  the directory from where the file was loaded, i.e., the value
+  returned by the \ifun{getcwd} function.
+\done
+
+\function{_function_name}
+\synopsis{Returns the name of the currently executing function}
+\usage{String_Type _function_name ()}
+\description
+  This function returns the name of the currently executing function.
+  If called from top-level, it returns the empty string.
+\seealso{_trace_function, is_defined}
+\done
+
+\function{__get_defined_symbols}
+\synopsis{Get the symbols defined by the preprocessor}
+\usage{Int_Type __get_defined_symbols ()}
+\description
+  The \ifun{__get_defined_symbols} functions is used to get the list of
+  all the symbols defined by the \slang preprocessor.  It pushes each
+  of the symbols on the stack followed by the number of items pushed.
+\seealso{is_defined, _apropos, _get_namespaces}
+\done
+
+\function{get_doc_files}
+\synopsis{Get the list of documentation files}
+\usage{String_Type = get_doc_files ()}
+\description
+  The \ifun{get_doc_files} function returns the internal list of
+  documentation files as an array of strings.
+\seealso{set_doc_files, add_doc_file, get_doc_string_from_file}
+\done
+
+\function{get_doc_string_from_file}
+\synopsis{Read documentation from a file}
+\usage{String_Type get_doc_string_from_file (String_Type f, String_Type t)}
+\description
+  If called with two arguments, \ifun{get_doc_string_from_file} opens
+  the documentation file \exmp{f} and searches it for topic \exmp{t}.
+  Otherwise, it will search an internal list of documentation files
+  looking for the documentation associated with the topic \exmp{t}.  If
+  found, the documentation for \exmp{t} will be returned, otherwise the
+  function will return \NULL.
+
+  Files may be added to the internal list via the \ifun{add_doc_file}
+  or \ifun{set_doc_files} functions.
+\seealso{add_doc_file, set_doc_files, get_doc_files, _slang_doc_dir}
+\done
+
+\function{_get_namespaces}
+\synopsis{Returns a list of namespace names}
+\usage{String_Type _get_namespaces ()}
+\description
+  This function returns a string array containing the names of the
+  currently defined namespaces.
+\seealso{_apropos, use_namespace, implements, __get_defined_symbols}
+\done
+
+\function{is_defined}
+\synopsis{Determine if a variable or function is defined}
+\usage{Integer_Type is_defined (String_Type name)}
+\description
+   This function is used to determine whether or not a function or
+   variable of the given name has been defined.  If the specified name
+   has not been defined, the function returns 0.  Otherwise, it
+   returns a non-zero value that depends on the type of object
+   attached to the name. Specifically, it returns one of the following
+   values:
+#v+
+     +1     intrinsic function
+     +2     slang function
+     -1     intrinsic variable
+     -2     slang variable
+      0     undefined
+#v-
+\example
+    Consider the function:
+#v+
+    define runhooks (hook)
+    {
+       if (2 == is_defined(hook)) eval(hook);
+    }
+#v-
+    This function could be called from another \slang function to
+    allow customization of that function, e.g., if the function
+    represents a mode, the hook could be called to setup keybindings
+    for the mode.
+\seealso{typeof, eval, autoload, __get_reference, __is_initialized}
+\done
+
+\function{__is_initialized}
+\synopsis{Determine whether or not a variable has a value}
+\usage{Integer_Type __is_initialized (Ref_Type r)}
+\description
+   This function returns non-zero of the object referenced by \exmp{r}
+   is initialized, i.e., whether it has a value.  It returns 0 if the
+   referenced object has not been initialized.
+\example
+   The function:
+#v+
+    define zero ()
+    {
+       variable f;
+       return __is_initialized (&f);
+    }
+#v-
+  will always return zero, but
+#v+
+    define one ()
+    {
+       variable f = 0;
+       return __is_initialized (&f);
+    }
+#v-
+  will return one.
+\seealso{__get_reference, __uninitialize, is_defined, typeof, eval}
+\done
+
+\variable{_NARGS}
+\synopsis{The number of parameters passed to a function}
+\usage{Integer_Type _NARGS}
+   The value of the \ivar{_NARGS} variable represents the number of
+   arguments passed to the function.  This variable is local to each
+   function.
+\example
+   This example uses the \ivar{_NARGS} variable to print the list of
+   values passed to the function:
+#v+
+     define print_values ()
+     {
+        variable arg;
+
+        if (_NARGS == 0)
+          {
+             message ("Nothing to print");
+             return;
+          }
+        foreach arg (__pop_args (_NARGS))
+          vmessage ("Argument value is: %S", arg.value);
+     }
+#v-
+\seealso{__pop_args, __push_args, typeof}
+\done
+
+\function{set_doc_files}
+\synopsis{Set the internal list of documentation files}
+\usage{set_doc_files (String_Type list)}
+\description
+  The \ifun{set_doc_files} function may be used to set the internal
+  list of documentation files.  It takes a single parameter, which is
+  required to be an array of strings.  The internal file list is set
+  to the files specified by the elements of the array.
+\example
+  The following example shows how to add all the files in a specified
+  directory to the internal list.  It makes use of the \ifun{glob}
+  function that is distributed as part of \slsh.
+#v+
+     files = glob ("/path/to/doc/files/*.sld");
+     set_doc_files (files, get_doc_files ());
+#v-
+\seealso{get_doc_files, add_doc_file, get_doc_string_from_file}
+\done
+
+\variable{_slang_doc_dir}
+\synopsis{Installed documentation directory}
+\usage{String_Type _slang_doc_dir}
+\description
+   The \ifun{_slang_doc_dir} variable is a read-only variable that
+   specifies the compile-time installation location of the \slang
+   documentation.
+\seealso{get_doc_string_from_file}
+\done
+
+\variable{_slang_version}
+\synopsis{The S-Lang library version number}
+\usage{Integer_Type _slang_version}
+\description
+   \ifun{_slang_version} is a read-only variable that gives the version
+   number of the \slang library.
+\seealso{_slang_version_string}
+\done
+
+\variable{_slang_version_string}
+\synopsis{The S-Lang library version number as a string}
+\usage{String_Type _slang_version_string}
+\description
+  \ifun{_slang_version_string} is a read-only variable that gives a
+  string representation of the version number of the \slang library.
+\seealso{_slang_version}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/list.tm Added

@@ -0,0 +1,125 @@
+\function{list_append}
+\synopsis{Append an object to a list}
+\usage{list_append (List_Type list, object ,Int_Type nth)}
+\description
+  The \ifun{list_append} function is like \ifun{list_insert} except
+  this function appends the object to the list.  The optional
+  argument \exmp{nth} may be used to specify where the object is to be
+  appended.  See the documentation on \ifun{list_insert} for more details.
+\seealso{list_concat, list_insert, list_join, list_delete, list_pop, list_new, list_reverse}
+\done
+
+\function{list_concat}
+\synopsis{Concatenate two lists to form a third}
+\usage{List_Type = list_concat (List_Type a, List_Type b)}
+\description
+  This function creates a new list that is formed by concatenating the
+  two lists \exmp{a} and \exmp{b} together.  Neither of the input
+  lists are modified by this operation.
+\seealso{list_join, list_append, list_insert}
+\done
+
+\function{list_delete}
+\synopsis{Remove an item from a list}
+\usage{list_delete (List_Type list, Int_Type nth)}
+\description
+  This function removes the \exmp{nth} item in the specified list.
+  The first item in the list corresponds to a value of \exmp{nth}
+  equal to zero.  If \exmp{nth} is negative, then the indexing is with
+  respect to the end of the list with the last item corresponding to
+  \exmp{nth} equal to -1.
+\seealso{list_insert, list_append, list_pop, list_new, list_reverse}
+\done
+
+\function{list_insert}
+\synopsis{Insert an item into a list}
+\usage{list_insert (List_Type list, object ,Int_Type nth)}
+\description
+  This function may be used to insert an object into the specified
+  list.  With just two arguments, the object will be inserted at the
+  beginning of the list.  The optional third argument, \exmp{nth}, may
+  be used to specify the insertion point.  The first item in the list
+  corresponds to a value of \exmp{nth} equal to zero.  If \exmp{nth}
+  is negative, then the indexing is with respect to the end of the
+  list with the last item given by a value of \exmp{nth} equal to -1.
+\notes
+  It is important to note that
+#v+
+    list_insert (list, object, 0);
+#v-
+  is not the same as
+#v+
+    list = {object, list}
+#v-
+  since the latter creates a new list with two items, \exmp{object}
+  and the old list.
+\seealso{list_append, list_pop, list_delete, list_new, list_reverse}
+\done
+
+\function{list_join}
+\synopsis{Join the elements of a second list onto the end of the first}
+\usage{list_join (List_Type a, List_Type b)}
+\description
+  This function modifies the list \exmp{a} by appending the elements
+  of \exmp{b} to it.
+\seealso{list_concat, list_append, list_insert}
+\done
+
+\function{list_new}
+\synopsis{Create a new list}
+\usage{List_Type list_new ()}
+\description
+  This function creates a new empty \dtype{List_Type} object.  Such a
+  list may also be created using the syntax
+#v+
+     list = {};
+#v-
+\seealso{list_delete, list_insert, list_append, list_reverse, list_pop}
+\done
+
+\function{list_pop}
+\synopsis{Extract an item from a list}
+\usage{object = list_pop (List_Type list , Int_Type nth)}
+\description
+  The \ifun{list_pop} function returns a object from a list deleting
+  the item from the list in the process.  If the second argument is
+  present, then it may be used to specify the position in the list
+  where the item is to be obtained.  If called with a single argument,
+  the first item in the list will be used.
+\seealso{list_delete, list_insert, list_append, list_reverse, list_new}
+\done
+
+\function{list_reverse}
+\synopsis{Reverse a list}
+\usage{list_reverse (List_Type list)}
+\description
+  This function may be used to reverse the items in list.
+\notes
+  This function does not create a new list.  The list passed to the
+  function will be reversed upon return from the function.  If it is
+  desired to create a separate reversed list, then a separate copy
+  should be made, e.g.,
+#v+
+     rev_list = @list;
+     list_reverse (rev_list);
+#v-
+\seealso{list_new, list_insert, list_append, list_delete, list_pop}
+\done
+
+\function{list_to_array}
+\synopsis{Convert a list into an array}
+\usage{Array_Type list_to_array (List_Type list ,DataType_Type type)}
+\description
+ The \ifun{list_to_array} function converts a list of objects into an
+ array of the same length and returns the result.  The optional
+ argument may be used to specify the array's data type.  If no
+ \exmp{type} is given, \ifun{list_to_array} tries to find the common
+ data type of all list elements. This function will generate an
+ exception if the list is empty and no type has been specified, or the
+ objects in the list cannot be converted to a common type.
+\notes
+ A future version of this function may produce an \dtype{Any_Type}
+ array for an empty or heterogeneous list.
+\seealso{length, typecast, __pop_list, typeof, array_sort}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/math.tm Added

@@ -0,0 +1,643 @@
+\function{abs}
+\synopsis{Compute the absolute value of a number}
+\usage{y = abs(x)}
+\description
+ The \ifun{abs} function returns the absolute value of an arithmetic
+ type. If its argument is a complex number (\dtype{Complex_Type}),
+ then it returns the modulus. If the argument is an array, a new
+ array will be created whose elements are obtained from the original
+ array by using the \ifun{abs} function.
+\seealso{sign, sqr}
+\done
+
+\function{acos}
+\synopsis{Compute the arc-cosine of a number}
+\usage{y = acos (x)}
+\description
+ The \ifun{acos} function computes the arc-cosine of a number and
+ returns the result. If its argument is an array, the
+ \ifun{acos} function will be applied to each element and the result returned
+ as an array.
+\seealso{cos, atan, acosh, cosh}
+\done
+
+\function{acosh}
+\synopsis{Compute the inverse cosh of a number}
+\usage{y = acosh (x)}
+\description
+ The \ifun{acosh} function computes the inverse hyperbolic cosine of a number and
+ returns the result. If its argument is an array, the
+ \ifun{acosh} function will be applied to each element and the result returned
+ as an array.
+\seealso{cos, atan, acosh, cosh}
+\done
+
+\function{asin}
+\synopsis{Compute the arc-sine of a number}
+\usage{y = asin (x)}
+\description
+ The \ifun{asin} function computes the arc-sine of a number and
+ returns the result. If its argument is an array, the
+ \ifun{asin} function will be applied to each element and the result returned
+ as an array.
+\seealso{cos, atan, acosh, cosh}
+\done
+
+\function{asinh}
+\synopsis{Compute the inverse-sinh of a number}
+\usage{y = asinh (x)}
+\description
+ The \ifun{asinh} function computes the inverse hyperbolic sine of a number and
+ returns the result. If its argument is an array, the
+ \ifun{asinh} function will be applied to each element and the result returned
+ as an array.
+\seealso{cos, atan, acosh, cosh}
+\done
+
+\function{atan}
+\synopsis{Compute the arc-tangent of a number}
+\usage{y = atan (x)}
+\description
+ The \ifun{atan} function computes the arc-tangent of a number and
+ returns the result. If its argument is an array, the
+ \ifun{atan} function will be applied to each element and the result returned
+ as an array.
+\seealso{atan2, cos, acosh, cosh}
+\done
+
+\function{atan2}
+\synopsis{Compute the arc-tangent of the ratio of two variables}
+\usage{z = atan2 (y, x)}
+\description
+ The \ifun{atan2} function computes the arc-tangent of the ratio
+ \exmp{y/x} and returns the result as a value that has the
+ proper sign for the quadrant where the point (x,y) is located. The
+ returned value \exmp{z} will satisfy (-PI < z <= PI). If either of the
+ arguments is an array, an array of the corresponding values will be returned.
+\seealso{hypot, cos, atan, acosh, cosh}
+\done
+
+\function{atanh}
+\synopsis{Compute the inverse-tanh of a number}
+\usage{y = atanh (x)}
+\description
+ The \ifun{atanh} function computes the inverse hyperbolic tangent of a number and
+ returns the result. If its argument is an array, the
+ \ifun{atanh} function will be applied to each element and the result returned
+ as an array.
+\seealso{cos, atan, acosh, cosh}
+\done
+
+\function{ceil}
+\synopsis{Round x up to the nearest integral value}
+\usage{y = ceil (x)}
+\description
+ This function rounds its numeric argument up to the nearest integral
+ value. If the argument is an array, the corresponding array will be
+ returned.
+\seealso{floor, round}
+\done
+
+\function{Conj}
+\synopsis{Compute the complex conjugate of a number}
+\usage{z1 = Conj (z)}
+\description
+ The \ifun{Conj} function returns the complex conjugate of a number.
+ If its argument is an array, the \ifun{Conj} function will be applied to each
+ element and the result returned as an array.
+\seealso{Real, Imag, abs}
+\done
+
+\function{cos}
+\synopsis{Compute the cosine of a number}
+\usage{y = cos (x)}
+\description
+ The \ifun{cos} function computes the cosine of a number and
+ returns the result. If its argument is an array, the
+ \ifun{cos} function will be applied to each element and the result returned
+ as an array.
+\seealso{sin, atan, acosh, cosh, sincos}
+\done
+
+\function{cosh}
+\synopsis{Compute the hyperbolic cosine of a number}
+\usage{y = cosh (x)}
+\description
+ The \ifun{cosh} function computes the hyperbolic cosine of a number and
+ returns the result. If its argument is an array, the
+ \ifun{cosh} function will be applied to each element and the result returned
+ as an array.
+\seealso{cos, atan, acosh, cosh}
+\done
+
+\function{_diff}
+\synopsis{Compute the absolute difference of two values}
+\usage{y = _diff (x, y)}
+\description
+ The \ifun{_diff} function returns a floating point number equal to
+ the absolute value of the difference of its two arguments.
+ If either argument is an array, an array of the corresponding values
+ will be returned.
+\seealso{abs}
+\done
+
+\function{exp}
+\synopsis{Compute the exponential of a number}
+\usage{y = exp (x)}
+\description
+ The \ifun{exp} function computes the exponential of a number and
+ returns the result. If its argument is an array, the
+ \ifun{exp} function will be applied to each element and the result returned
+ as an array.
+\seealso{expm1, cos, atan, acosh, cosh}
+\done
+
+\function{expm1}
+\synopsis{Compute exp(x)-1}
+\usage{y = expm1(x)}
+\description
+ The \ifun{expm1} function computes \exmp{exp(x)-1} and returns the
+ result. If its argument is an array, the \ifun{expm1} function will
+ be applied to each element and the results returned as an array.
+
+ This function should be called whenever \exmp{x} is close to 0 to
+ avoid the numerical error that would arise in a naive computation of
+ \exmp{exp(x)-1}.
+\seealso{expm1, log1p, cos, atan, acosh, cosh}
+\done
+
+\function{feqs}
+\synopsis{Test the approximate equality of two numbers}
+\usage{Char_Type feqs (a, b ,reldiff ,absdiff)}
+\description
+ This function compares two floating point numbers \exmp{a} and
+ \exmp{b}, and returns a non-zero value if they are equal to within a
+ specified tolerance; otherwise 0 will be returned. If either is an
+ array, a corresponding boolean array will be returned.
+
+ The tolerances are specified as relative and absolute differences via
+ the optional third and fourth arguments. If no optional arguments
+ are present, the tolerances default to \exmp{reldiff=0.01} and
+ \exmp{absdiff=1e-6}. If only the relative difference has been
+ specified, the absolute difference (\exmp{absdiff}) will be taken to
+ be 0.0.
+
+ For the case when \exmp{|b|>=|a|}, \exmp{a} and \exmp{b} are
+ considered to be equal to within the specified tolerances if either
+ \exmp{|b-a|<=absdiff} or \exmp{|b-a|/|b|<=reldiff} is true.
+\seealso{fneqs, fgteqs, flteqs}
+\done
+
+\function{fgteqs}
+\synopsis{Compare two numbers using specified tolerances}.
+\usage{Char_Type fgteqs (a, b ,reldiff ,absdiff)}
+\description
+ This function is functionally equivalent to:
+#v+
+ (a >= b) or feqs(a,b,...)
+#v-
+ See the documentation of \ifun{feqs} for more information.
+\seealso{feqs, fneqs, flteqs}
+\done
+
+\function{floor}
+\synopsis{Round x down to the nearest integer}
+\usage{y = floor (x)}
+\description
+ This function rounds its numeric argument down to the nearest
+ integral value. If the argument is an array, the corresponding array
+ will be returned.
+\seealso{ceil, round, nint}
+\done
+
+\function{flteqs}
+\synopsis{Compare two numbers using specified tolerances}.
+\usage{Char_Type flteqs (a, b ,reldiff ,absdiff)}
+\description
+ This function is functionally equivalent to:
+#v+
+ (a <= b) or feqs(a,b,...)
+#v-
+ See the documentation of \ifun{feqs} for more information.
+\seealso{feqs, fneqs, fgteqs}
+\done
+
+\function{fneqs}
+\synopsis{Test the approximate inequality of two numbers}
+\usage{Char_Type fneqs (a, b ,reldiff ,absdiff)}
+\description
+ This function is functionally equivalent to:
+#v+
+ not fneqs(a,b,...)
+#v-
+ See the documentation of \ifun{feqs} for more information.
+\seealso{feqs, fgteqs, flteqs}
+\done
+
+
+\function{frexp}
+\synopsis{Obtain the integral and fractional parts of a floating point number}
+\usage{(b,e) = frexp(x)}
+\description
+ This function breaks a floating point number \exmp{x} into two values
+ \exmp{b} and \exmp{e} such that \exmp{x=b*2^x}, where
+#v+
+ 0.5 <= abs(b) < 1 for x != 0,
+ b = 0, e = 0 for x = 0
+ b = _NaN for x = _NaN
+ b = +/-_Inf for x = +/-Inf
+#v-
+ For the latter two cases, the value is \exmp{e} is implementation
+ dependent.
+
+ If \exmp{x} is an array, the \ifun{frexp} function will be applied
+ to each element and corresponding arrays will be returned.
+\seealso{ldexp, pow, log}
+\done
+
+\function{get_float_format}
+\synopsis{Get the format for printing floating point values.}
+\usage{String_Type get_float_format ()}
+\description
+ The \ifun{get_float_format} retrieves the format string used for
+ printing single and double precision floating point numbers. See the
+ documentation for the \ifun{set_float_format} function for more
+ information about the format.
+\seealso{set_float_format}
+\done
+
+\function{hypot}
+\synopsis{Compute sqrt(x1^2+x2^2+...+xN^2)}
+\usage{r = hypot (x1 ,x2,..,xN)}
+\description
+ If given two or more arguments, \exmp{x1,...,xN}, the \ifun{hypot}
+ function computes the quantity \exmp{sqrt(x1^2+...+xN^2)} using an
+ algorithm that tries to avoid arithmetic overflow. If any of the
+ arguments is an array, an array of the corresponding values will be
+ returned.
+
+ If given a single array argument \exmp{x}, the \ifun{hypot} function
+ computes \exmp{sqrt(sumsq(x))}, where \exmp{sumsq(x)} computes
+ the sum of the squares of the elements of \exmp{x}.
+\example
+ A vector in Euclidean 3 dimensional space may be represented by an
+ array of three values representing the components of the vector in
+ some orthogonal Cartesian coordinate system. Then the length of the
+ vector may be computed using the \ifun{hypot} function, e.g.,
+#v+
+ A = 2,3,4;
+ len_A = hypot (A);
+#v-
+ The dot-product or scalar-product between two such vectors \exmp{A}
+ and \exmp{B} may be computed using the \exmp{sum(A*B)}. It is well
+ known that this is also equal to the product of the lengths of the
+ two vectors and the cosine of the angle between them. Hence, the
+ angle between the vectors \exmp{A} and \exmp{B} may be computed using
+#v+
+ ahat = A/hypot(A);
+ bhat = B/hypot(B);
+ theta = acos(\sum(ahat*bhat));
+#v-
+ Here, \exmp{ahat} and \exmp{bhat} are the unit vectors associated
+ with the vectors \exmp{A} and \exmp{B}, respectively.
+ Unfortunately, the above method for computing the angle between the
+ vectors is numerically unstable when \exmp{A} and \exmp{B} are
+ nearly parallel. An alternative method is to use:
+#v+
+ ahat = A/hypot(A);
+ bhat = B/hypot(B);
+ ab = sum(ahat*bhat);
+ theta = atan2 (hypot(bhat - ab*ahat), ab);
+#v-
+\seealso{atan2, cos, atan, acosh, cosh, sum, sumsq}
+\done
+
+\function{Imag}
+\synopsis{Compute the imaginary part of a number}
+\usage{i = Imag (z)}
+\description
+ The \ifun{Imag} function returns the imaginary part of a number.
+ If its argument is an array, the \ifun{Imag} function will be applied to each
+ element and the result returned as an array.
+\seealso{Real, Conj, abs}
+\done
+
+\function{isinf}
+\synopsis{Test for infinity}
+\usage{y = isinf (x)}
+\description
+ This function returns 1 if x corresponds to an IEEE infinity, or 0
+ otherwise. If the argument is an array, an array of the
+ corresponding values will be returned.
+\seealso{isnan, _Inf}
+\done
+
+\function{isnan}
+\synopsis{isnan}
+\usage{y = isnan (x)}
+\description
+ This function returns 1 if x corresponds to an IEEE NaN (Not a Number),
+ or 0 otherwise. If the argument is an array, an array of
+ the corresponding values will be returned.
+\seealso{isinf, _NaN}
+\done
+
+\function{_isneg}
+\synopsis{Test if a number is less than 0}
+\usage{Char_Type _isneg(x)}
+\description
+ This function returns 1 if a number is less than 0, and zero
+ otherwise. If the argument is an array, then the corresponding
+ array of boolean (\dtype{Char_Type}) values will be returned.
+\seealso{_ispos, _isnonneg}
+\done
+
+\function{_isnonneg}
+\synopsis{Test if a number is greater than or equal to 0}
+\usage{Char_Type _isnonneg(x)}
+\description
+ This function returns 1 if a number is greater than or equal to 0,
+ and zero otherwise. If the argument is an array, then the
+ corresponding array of boolean (\dtype{Char_Type}) values will be
+ returned.
+\seealso{_isneg, _ispos}
+\done
+
+\function{_ispos}
+\synopsis{Test if a number is greater than 0}
+\usage{Char_Type _ispos(x)}
+\description
+ This function returns 1 if a number is greater than 0, and zero
+ otherwise. If the argument is an array, then the corresponding
+ array of boolean (\dtype{Char_Type}) values will be returned.
+\seealso{_isneg, _isnonneg}
+\done
+
+\function{ldexp}
+\synopsis{Multiply a number by a power of 2}
+\usage{x = ldexp(b, e)}
+\description
+ This function computes the value of \exmp{b*2^e} and returns the
+ result. If either \exmp{b} or \exmp{e} is an array, a corresponding
+ array of values will be returned.
+\notes
+ This function is the inverse of \exmp{frexp}.
+\seealso{frexp}
+\done
+
+\function{log}
+\synopsis{Compute the logarithm of a number}
+\usage{y = log (x)}
+\description
+ The \ifun{log} function computes the natural logarithm of a number and
+ returns the result. If its argument is an array, the
+ \ifun{log} function will be applied to each element and the result returned
+ as an array.
+\seealso{cos, atan, acosh, cosh, log1p}
+\done
+
+\function{log10}
+\synopsis{Compute the base-10 logarithm of a number}
+\usage{y = log10 (x)}
+\description
+ The \ifun{log10} function computes the base-10 logarithm of a number and
+ returns the result. If its argument is an array, the
+ \ifun{log10} function will be applied to each element and the result returned
+ as an array.
+\seealso{cos, atan, acosh, cosh}
+\done
+
+\function{log1p}
+\synopsis{Compute the logarithm of 1 plus a number}
+\usage{y = log1p (x)}
+\description
+ The \ifun{log1p} function computes the natural logarithm of 1.0 plus
+ \exmp{x} returns the result. If its argument is an array, the
+ \ifun{log1p} function will be applied to each element and the results
+ returned as an array.
+
+ This function should be used instead of \exmp{log(1+x)} to avoid
+ numerical errors whenever \exmp{x} is close to 0.
+\seealso{log, expm1, cos, atan, acosh, cosh}
+\done
+
+\function{_max}
+\synopsis{Compute the maximum of two or more numeric values}
+\usage{z = _max (x1,...,xN)}
+\description
+ The \ifun{_max} function returns a floating point number equal to
+ the maximum value of its arguments. If any of the arguments are
+ arrays (of equal length), an array of the corresponding values will
+ be returned.
+\notes
+ This function returns a floating point result even when the
+ arguments are integers.
+\seealso{_min, min, max}
+\done
+
+\function{_min}
+\synopsis{Compute the minimum of two or more numeric values}
+\usage{z = _min (x1,...,xN)}
+\description
+ The \ifun{_min} function returns a floating point number equal to
+ the minimum value of its arguments. If any of the arguments are
+ arrays (of equal length), an array of the corresponding values will
+ be returned.
+\notes
+ This function returns a floating point result even when the
+ arguments are integers.
+\seealso{min, _max, max}
+\done
+
+\function{mul2}
+\synopsis{Multiply a number by 2}
+\usage{y = mul2(x)}
+\description
+ The \ifun{mul2} function multiplies an arithmetic type by two and
+ returns the result. If its argument is an array, a new array will
+ be created whose elements are obtained from the original array by
+ using the \ifun{mul2} function.
+\seealso{sqr, abs}
+\done
+
+\function{nint}
+\synopsis{Round to the nearest integer}
+\usage{i = nint(x)}
+\description
+ The \ifun{nint} rounds its argument to the nearest integer and
+ returns the result. If its argument is an array, a new array will
+ be created whose elements are obtained from the original array
+ elements by using the \ifun{nint} function.
+\seealso{round, floor, ceil}
+\done
+
+\function{polynom}
+\synopsis{Evaluate a polynomial}
+\usage{Double_Type polynom(a0,a1,...aN, x ,use_factorial)}
+\description
+ The \ifun{polynom} function returns the value of the polynomial expression
+#v+
+ a0 + a1*x + a2*x^2 + ... + aN*x^N
+#v-
+ where the coefficients are given by an array of values
+ \exmp{a0,...,aN}. If \exmp{x} is an array, the function will
+ return a corresponding array. If the value of the optional
+ \exmp{use_factorial} parameter is non-zero, then each term in the sum
+ will be normalized by the corresponding factorial, i.e.,
+#v+
+ a0/0! + a1*x/1! + a2*x^2/2! + ... + aN*x^N/N!
+#v-
+\notes
+ Prior to version 2.2, this function had a different calling syntax
+ and and was less useful.
+
+ The \ifun{polynom} function does not yet support complex-valued
+ coefficients.
+
+ For the case of a scalar value of \exmp{x} and a small degree
+ polynomial, it is more efficient to use an explicit expression.
+\seealso{exp}
+\done
+
+\function{Real}
+\synopsis{Compute the real part of a number}
+\usage{r = Real (z)}
+\description
+ The \ifun{Real} function returns the real part of a number. If its
+ argument is an array, the \ifun{Real} function will be applied to
+ each element and the result returned as an array.
+\seealso{Imag, Conj, abs}
+\done
+
+\function{round}
+\synopsis{Round to the nearest integral value}
+\usage{y = round (x)}
+\description
+ This function rounds its argument to the nearest integral value and
+ returns it as a floating point result. If the argument is an array,
+ an array of the corresponding values will be returned.
+\seealso{floor, ceil, nint}
+\done
+
+\function{set_float_format}
+\synopsis{Set the format for printing floating point values.}
+\usage{set_float_format (String_Type fmt)}
+\description
+ The \ifun{set_float_format} function is used to set the floating
+ point format to be used when floating point numbers are printed.
+ The routines that use this are the traceback routines and the
+ \ifun{string} function, any anything based upon the \ifun{string}
+ function. The default value is \exmp{"%S"}, which causes the number
+ to be displayed with enough significant digits such that
+ \exmp{x==atof(string(x))}.
+\example
+#v+
+ set_float_format ("%S"); % default
+ s = string (PI); % --> s = "3.141592653589793"
+ set_float_format ("%16.10f");
+ s = string (PI); % --> s = "3.1415926536"
+ set_float_format ("%10.6e");
+ s = string (PI); % --> s = "3.141593e+00"
+#v-
+\seealso{get_float_format, string, sprintf, atof, double}
+\done
+
+\function{sign}
+\synopsis{Compute the sign of a number}
+\usage{y = sign(x)}
+\description
+ The \ifun{sign} function returns the sign of an arithmetic type. If
+ its argument is a complex number (\dtype{Complex_Type}), the
+ \ifun{sign} will be applied to the imaginary part of the number. If
+ the argument is an array, a new array will be created whose elements
+ are obtained from the original array by using the \ifun{sign}
+ function.
+
+ When applied to a real number or an integer, the \ifun{sign} function
+ returns \-1, \0, or \exmp{+1} according to whether the number is
+ less than zero, equal to zero, or greater than zero, respectively.
+\seealso{abs}
+\done
+
+\function{sin}
+\synopsis{Compute the sine of a number}
+\usage{y = sin (x)}
+\description
+ The \ifun{sin} function computes the sine of a number and
+ returns the result. If its argument is an array, the
+ \ifun{sin} function will be applied to each element and the result returned
+ as an array.
+\seealso{cos, atan, acosh, cosh, sincos}
+\done
+
+\function{sincos}
+\synopsis{Compute the sine and cosine of a number}
+\usage{(s, c) = sincos (x)}
+\description
+ The \ifun{sincos} function computes the sine and cosine of a
+ number and returns the result. If its argument is an array,
+ the \ifun{sincos} function will be applied to each element
+ and the result returned as an array.
+\seealso{sin, cos}
+\done
+
+\function{sinh}
+\synopsis{Compute the hyperbolic sine of a number}
+\usage{y = sinh (x)}
+\description
+ The \ifun{sinh} function computes the hyperbolic sine of a number and
+ returns the result. If its argument is an array, the
+ \ifun{sinh} function will be applied to each element and the result returned
+ as an array.
+\seealso{cos, atan, acosh, cosh}
+\done
+
+\function{sqr}
+\synopsis{Compute the square of a number}
+\usage{y = sqr(x)}
+\description
+ The \ifun{sqr} function returns the square of an arithmetic type. If its
+ argument is a complex number (\dtype{Complex_Type}), then it returns
+ the square of the modulus. If the argument is an array, a new array
+ will be created whose elements are obtained from the original array
+ by using the \ifun{sqr} function.
+\notes
+ For real scalar numbers, using \exmp{x*x} instead of \exmp{sqr(x)}
+ will result in faster executing code. However, if \exmp{x} is an
+ array, then \exmp{sqr(x)} will execute faster.
+\seealso{abs, mul2}
+\done
+
+\function{sqrt}
+\synopsis{Compute the square root of a number}
+\usage{y = sqrt (x)}
+\description
+ The \ifun{sqrt} function computes the square root of a number and
+ returns the result. If its argument is an array, the
+ \ifun{sqrt} function will be applied to each element and the result returned
+ as an array.
+\seealso{sqr, cos, atan, acosh, cosh}
+\done
+
+\function{tan}
+\synopsis{Compute the tangent of a number}
+\usage{y = tan (x)}
+\description
+ The \ifun{tan} function computes the tangent of a number and
+ returns the result. If its argument is an array, the
+ \ifun{tan} function will be applied to each element and the result returned
+ as an array.
+\seealso{cos, atan, acosh, cosh}
+\done
+
+\function{tanh}
+\synopsis{Compute the hyperbolic tangent of a number}
+\usage{y = tanh (x)}
+\description
+ The \ifun{tanh} function computes the hyperbolic tangent of a number and
+ returns the result. If its argument is an array, the
+ \ifun{tanh} function will be applied to each element and the result returned
+ as an array.
+\seealso{cos, atan, acosh, cosh}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/message.tm Added

@@ -0,0 +1,259 @@
+\variable{errno}
+\synopsis{Error code set by system functions}
+\usage{Int_Type errno}
+\description
+  A system function can fail for a variety of reasons.  For example, a
+  file operation may fail because lack of disk space, or the process
+  does not have permission to perform the operation.  Such functions
+  will return -1 and set the variable \ivar{errno} to an error
+  code describing the reason for failure.
+
+  Particular values of \ivar{errno} may be specified by the following
+  symbolic constants (read-only variables) and the corresponding
+  \ifun{errno_string} value:
+#v+
+     E2BIG            "Arg list too long"
+     EACCES           "Permission denied"
+     EBADF            "Bad file number"
+     EBUSY            "Mount device busy"
+     ECHILD           "No children"
+     EEXIST           "File exists"
+     EFAULT           "Bad address"
+     EFBIG            "File too large"
+     EINTR            "Interrupted system call"
+     EINVAL           "Invalid argument"
+     EIO              "I/O error"
+     EISDIR           "Is a directory"
+     ELOOP            "Too many levels of symbolic links"
+     EMFILE           "Too many open files"
+     EMLINK           "Too many links"
+     ENAMETOOLONG     "File name too long"
+     ENFILE           "File table overflow"
+     ENODEV           "No such device"
+     ENOENT           "No such file or directory"
+     ENOEXEC          "Exec format error"
+     ENOMEM           "Not enough core"
+     ENOSPC           "No space left on device"
+     ENOTBLK          "Block device required"
+     ENOTDIR          "Not a directory"
+     ENOTEMPTY        "Directory not empty"
+     ENOTTY           "Not a typewriter"
+     ENXIO            "No such device or address"
+     EPERM            "Operation not permitted"
+     EPIPE            "Broken pipe"
+     EROFS            "Read-only file system"
+     ESPIPE           "Illegal seek"
+     ESRCH            "No such process"
+     ETXTBSY          "Text file busy"
+     EXDEV            "Cross-device link"
+#v-
+\example
+  The \ifun{mkdir} function will attempt to create a directory.  If it
+  fails, the function will throw an IOError exception with a message
+  containing the string representation of the \ivar{errno} value.
+#v+
+    if (-1 == mkdir (dir))
+       throw IOError, sprintf ("mkdir %s failed: %s",
+                               dir, errno_string (errno));
+#v-
+\seealso{errno_string, error, mkdir}
+\done
+
+\function{errno_string}
+\synopsis{Return a string describing an errno.}
+\usage{String_Type errno_string ( Int_Type err )}
+\description
+  The \ifun{errno_string} function returns a string describing the
+  integer errno code \exmp{err}.  If the \exmp{err} parameter is
+  omitted, the current value of \ivar{errno} will be used. See the
+  description for \ivar{errno} for more information.
+\example
+  The \ifun{errno_string} function may be used as follows:
+#v+
+    define sizeof_file (file)
+    {
+       variable st = stat_file (file);
+       if (st == NULL)
+         throw IOError, sprintf ("%s: %s", file, errno_string (errno));
+       return st.st_size;
+    }
+#v-
+\seealso{errno, stat_file}
+\done
+
+\function{error}
+\synopsis{Generate an error condition (deprecated)}
+\usage{error (String_Type msg)}
+\description
+  This function has been deprecated in favor of \kw{throw}.
+
+  The \ifun{error} function generates a \slang \exc{RunTimeError}
+  exception. It takes a single string parameter which is displayed on
+  the stderr output device.
+\example
+#v+
+    define add_txt_extension (file)
+    {
+       if (typeof (file) != String_Type)
+         error ("add_extension: parameter must be a string");
+       file += ".txt";
+       return file;
+    }
+#v-
+\seealso{verror, message}
+\done
+
+\function{__get_exception_info}
+\synopsis{Get information about the current exception}
+\usage{Struct_Type __get_exception_info ()}
+\description
+ This function returns information about the currently active
+ exception in the form as a structure with the
+ following fields:
+#v+
+    error            The current exception, e.g., RunTimeError
+    descr            A description of the exception
+    file             Name of the file generating the exception
+    line             Line number where the exception originated
+    function         Function where the exception originated
+    object           A user-defined object thrown by the exception
+    message          A user-defined message
+    traceback        Traceback messages
+#v-
+ If no exception is active, \NULL will be returned.
+
+ This same information may also be obtained via the optional argument
+ to the \kw{try} statement:
+#v+
+     variable e = NULL;
+     try (e)
+       {
+          do_something ();
+       }
+     finally
+       {
+          if (e != NULL)
+            vmessage ("An error occurred: %s", e.message);
+       }
+#v-
+\seealso{error}
+\done
+
+\function{message}
+\synopsis{Print a string onto the message device}
+\usage{message (String_Type s)}
+\description
+  The \ifun{message} function will print the string specified by
+  \exmp{s} onto the message device.
+\example
+#v+
+     define print_current_time ()
+     {
+       message (time ());
+     }
+#v-
+\notes
+  The message device will depend upon the application.  For example,
+  the output message device for the \jed editor corresponds to the
+  line at the bottom of the display window.  The default message
+  device is the standard output device.
+\seealso{vmessage, sprintf, error}
+\done
+
+\function{new_exception}
+\synopsis{Create a new exception}
+\usage{new_exception (String_Type name, Int_Type baseclass, String_Type descr)}
+\description
+  This function creates a new exception called \exmp{name} subclassed
+  upon \exmp{baseclass}.  The description of the exception is
+  specified by \exmp{descr}.
+\example
+#v+
+  new_exception ("MyError", RunTimeError, "My very own error");
+  try
+    {
+       if (something_is_wrong ())
+         throw MyError;
+    }
+  catch RunTimeError;
+#v-
+  In this case, catching \exc{RunTimeError} will also catch
+  \exmp{MyError} since it is a subclass of \exc{RunTimeError}.
+\seealso{error, verror}
+\done
+
+\function{usage}
+\synopsis{Generate a usage error}
+\usage{usage (String_Type msg)}
+\description
+  The \ifun{usage} function generates a \exc{UsageError} exception and
+  displays \exmp{msg} to the message device.
+\example
+  Suppose that a function called \exmp{plot} plots an array of \exmp{x} and
+  \exmp{y} values.  Then such a function could be written to issue a
+  usage message if the wrong number of arguments was passed:
+#v+
+    define plot ()
+    {
+       variable x, y;
+
+       if (_NARGS != 2)
+         usage ("plot (x, y)");
+
+       (x, y) = ();
+       % Now do the hard part
+          .
+          .
+    }
+#v-
+\seealso{error, message}
+\done
+
+\function{verror}
+\synopsis{Generate an error condition (deprecated)}
+\usage{verror (String_Type fmt, ...)}
+\description
+  This function has been deprecated in favor or \kw{throw}.
+
+  The \ifun{verror} function performs the same role as the \ifun{error}
+  function.  The only difference is that instead of a single string
+  argument, \ifun{verror} takes a sprintf style argument list.
+\example
+#v+
+    define open_file (file)
+    {
+       variable fp;
+
+       fp = fopen (file, "r");
+       if (fp == NULL) verror ("Unable to open %s", file);
+       return fp;
+    }
+#v-
+\notes
+  In the current implementation, the \ifun{verror} function is not an
+  intrinsic function.  Rather it is a predefined \slang function using
+  a combination of \ifun{sprintf} and \ifun{error}.
+
+  To generate a specific exception, a \kw{throw} statement should be
+  used.  In fact, a \kw{throw} statement such as:
+#v+
+     if (fp == NULL)
+       throw OpenError, "Unable to open $file"$;
+#v-
+  is preferable to the use of \ifun{verror} in the above example.
+\seealso{error, Sprintf, vmessage}
+\done
+
+\function{vmessage}
+\synopsis{Print a formatted string onto the message device}
+\usage{vmessage (String_Type fmt, ...)}
+\description
+  The \ifun{vmessage} function formats a sprintf style argument list
+  and displays the resulting string onto the message device.
+\notes
+  In the current implementation, the \ifun{vmessage} function is not an
+  intrinsic function.  Rather it is a predefined \slang function using
+  a combination of \ifun{Sprintf} and \ifun{message}.
+\seealso{message, sprintf, Sprintf, verror}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/misc.tm Added

@@ -0,0 +1,384 @@
+\variable{_auto_declare}
+\synopsis{Set automatic variable declaration mode}
+\usage{Integer_Type _auto_declare}
+\description
+  The \ivar{_auto_declare} variable may be used to have undefined
+  variable implicitly declared.  If set to zero, any
+  variable must be declared with a \kw{variable} declaration before it
+  can be used.  If set to one, then any undeclared variable will be
+  declared as a \kw{static} variable.
+
+  The \ivar{_auto_declare} variable is local to each compilation unit and
+  setting its value in one unit has no effect upon its value in other
+  units.   The value of this variable has no effect upon the variables
+  in a function.
+\example
+  The following code will not compile if \exmp{X} not been
+  declared:
+#v+
+    X = 1;
+#v-
+  However,
+#v+
+    _auto_declare = 1;   % declare variables as static.
+    X = 1;
+#v-
+  is equivalent to
+#v+
+    static variable X = 1;
+#v-
+\notes
+  This variable should be used sparingly and is intended primarily for
+  interactive applications where one types \slang commands at a
+  prompt.
+\done
+
+\function{__class_id}
+\synopsis{Return the class-id of a specified type}
+\usage{Int_Type __class_id (DataType_Type type)}
+\description
+  This function returns the internal class-id of a specified data type.
+\seealso{typeof, _typeof, __class_type, __datatype}
+\done
+
+\function{__class_type}
+\synopsis{Return the class-type of a specified type}
+\usage{Int_Type __class_type (DataType_Type type))}
+\description
+  Internally \slang objects are classified according to four types:
+  scalar, vector, pointer, and memory managed types.  For example, an
+  integer is implemented as a scalar, a complex number as a vector,
+  and a string is represented as a pointer.  The \ifun{__class_type}
+  function returns an integer representing the class-type associated
+  with the specified data type. Specifically, it returns:
+#v+
+       0    memory-managed
+       1    scalar
+       2    vector
+       3    pointer
+#v-
+\seealso{typeof, _typeof, __class_id, __datatype}
+\done
+
+\function{current_namespace}
+\synopsis{Get the name of the current namespace}
+\usage{String_Type current_namespace ()}
+\description
+   The \ifun{current_namespace} function returns the name of the
+   static namespace associated with the compilation unit.  If there is
+   no such namespace associated with the compilation unit, then the
+   empty string \exmp{""} will be returned.
+\seealso{implements, use_namespace, import, evalfile}
+\done
+
+\function{__datatype}
+\synopsis{Get the DataType_Type for a specified internal class-id}
+\usage{DataType_Type __datatype (Int_Type id)}
+\description
+ This function is the inverse of __class_type in the sense that it
+ returns the \dtype{DataType_Type} for the specified class-id.  If no
+ such class exists, the function will return \NULL.
+\notes
+ One should not expect distinct interpreter instances to always return
+ the same value for a dynamically assigned class-id such as one
+ defined by a module or one stemming from a \kw{typedef} statement.
+\seealso{__class_id, __class_type, typeof}
+\done
+
+\function{_eqs}
+\synopsis{Test for equality of two objects}
+\usage{Int_Type _eqs (a, b)}
+\description
+  This function tests its two arguments for equality and returns 1 if
+  they are equal or 0 otherwise. What it means to be equal depends
+  upon the data types of the objects being compared.  If the types are
+  numeric, they are regarded as equal if their numerical values are
+  equal.  If they are arrays, then they are equal if they have the
+  same shape with equal elements. If they are structures, then they
+  are equal if they contain identical fields, and the corresponding
+  values are equal.
+\example
+#v+
+   _eqs (1, 1)             ===> 1
+   _eqs (1, 1.0)           ===> 1
+   _eqs ("a", 1)           ===> 0
+   _eqs (1,2, 1.0,2.0) ===> 1
+#v-
+\notes
+   For testing sameness, use \ifun{__is_same}.
+\seealso{typeof, __is_same, __get_reference, __is_callable}
+\done
+
+\function{get_environ}
+\synopsis{Get all environment variables}
+\usage{String_Type = get_environ()}
+\description
+   The \ifun{get_environ} function returns an array of strings
+   representing the environment variables defined for the current
+   process.  Each element of the array will be of the form
+   \exmp{NAME=VALUE}.
+
+   This function will return \NULL if the system does not support this
+   feature.
+\seealso{getenv, putenv, is_defined}
+\done
+
+\function{getenv}
+\synopsis{Get the value of an environment variable}
+\usage{String_Type getenv(String_Type var)}
+\description
+   The \ifun{getenv} function returns a string that represents the
+   value of an environment variable \exmp{var}.  It will return
+   \NULL if there is no environment variable whose name is given
+   by \exmp{var}.
+\example
+#v+
+    if (NULL != getenv ("USE_COLOR"))
+      {
+        set_color ("normal", "white", "blue");
+        set_color ("status", "black", "gray");
+        USE_ANSI_COLORS = 1;
+      }
+#v-
+\seealso{get_environ, putenv, strlen, is_defined}
+\done
+
+\function{__get_reference}
+\synopsis{Get a reference to a global object}
+\usage{Ref_Type __get_reference (String_Type nm)}
+\description
+  This function returns a reference to a global variable or function
+  whose name is specified by \exmp{nm}.  If no such object exists, it
+  returns \NULL, otherwise it returns a reference.
+\example
+   Consider the function:
+#v+
+    define runhooks (hook)
+    {
+       variable f;
+       f = __get_reference (hook);
+       if (f != NULL)
+         @f ();
+    }
+#v-
+   This function could be called from another \slang function to allow
+   customization of that function, e.g., if the function represents a
+   \jed editor mode, the hook could be called to setup keybindings for
+   the mode.
+\seealso{is_defined, typeof, eval, autoload, __is_initialized, __uninitialize}
+\done
+
+\function{implements}
+\synopsis{Create a new static namespace}
+\usage{implements (String_Type name)}
+\description
+  The \ifun{implements} function may be used to create a new static
+  namespace and have it associated with the current compilation unit.
+  If a namespace with the specified name already exists, a
+  \exc{NamespaceError} exception will be thrown.
+
+  In addition to creating a new static namespace and associating it
+  with the compilation unit, the function will also create a new
+  private namespace.  As a result, any symbols in the previous private
+  namespace will be no longer be accessible.  For this reason, it is
+  recommended that this function should be used before any private
+  symbols have been created.
+\example
+  Suppose that some file \exmp{t.sl} contains:
+#v+
+     implements ("My");
+     define message (x)
+     {
+        Global->message ("My's message: $x"$);
+     }
+     message ("hello");
+#v-
+  will produce \exmp{"My's message: hello"}.  This \exmp{message}
+  function may be accessed from outside the namespace via:
+#v+
+    My->message ("hi");
+#v-
+\notes
+  Since \ifun{message} is an intrinsic function, it is public and may
+  not be redefined in the public namespace.
+
+  The \ifun{implements} function should rarely be used.  It is
+  preferable to allow a static namespace to be associated with a
+  compilation unit using, e.g., \exmp{evalfile}.
+\seealso{use_namespace, current_namespace, import}
+\done
+
+\function{__is_callable}
+\synopsis{Determine whether or not an object is callable}
+\usage{Int_Type __is_callable (obj)}
+\description
+  This function may be used to determine if an object is callable by
+  dereferencing the object.  It returns 1 if the argument is callable,
+  or zero otherwise.
+\example
+#v+
+   __is_callable (7)      ==> 0
+   __is_callable (&sin)   ==> 1
+   a = &sin;
+   __is_callable (a0)   ==> 1
+   __is_callable (&a0)  ==> 0
+#v-
+\seealso{__is_numeric, is_defined}
+\done
+
+\function{__is_datatype_numeric}
+\synopsis{Determine whether or not a type is a numeric type}
+\usage{Int_Type __is_datatype_numeric (DataType_Type type)}
+\description
+  This function may be used to determine if the specified datatype
+  represents a numeric type.  It returns \0 if the datatype does not
+  represents a numeric type; otherwise it returns 1 for an
+  integer type, 2 for a floating point type, and 3 for a complex type.
+\seealso{typeof, __is_numeric, __is_callable}
+\done
+
+\function{__is_numeric}
+\synopsis{Determine whether or not an object is a numeric type}
+\usage{Int_Type __is_numeric (obj)}
+\description
+  This function may be used to determine if an object represents a
+  numeric type.  It returns 0 if the argument is non-numeric, 1 if it
+  is an integer, 2 if a floating point number, and 3 if it is complex.
+  If the argument is an array, then the array type will be used for
+  the test.
+\example
+#v+
+   __is_numeric ("foo");  ==> 0
+   __is_numeric ("0");    ==> 0
+   __is_numeric (0);      ==> 1
+   __is_numeric (PI);     ==> 2
+   __is_numeric (2j);     ==> 3
+   __is_numeric (1,2);  ==> 1
+   __is_numeric ({1,2});  ==> 0
+#v-
+\seealso{typeof, __is_datatype_numeric}
+\done
+
+\function{__is_same}
+\synopsis{Test for sameness of two objects}
+\usage{Int_Type __is_same (a, b)}
+\description
+  This function tests its two arguments for sameness and returns 1
+  if they are the same, or 0 otherwise.  To be the same, the data type of
+  the arguments must match and the values of the objects must
+  reference the same underlying object.
+\example
+#v+
+   __is_same (1, 1)         ===> 1
+   __is_same (1, 1.0)       ===> 0
+   __is_same ("a", 1)       ===> 0
+   __is_same (1,2, 1,2) ===> 0
+#v-
+\notes
+   For testing equality, use \ifun{_eqs}.
+\seealso{typeof, _eqs, __get_reference, __is_callable}
+\done
+
+\function{putenv}
+\synopsis{Add or change an environment variable}
+\usage{putenv (String_Type s)}
+\description
+    This functions adds string \exmp{s} to the environment.  Typically,
+    \exmp{s} should have the form \exmp{"name=value"}.  The function
+    throws an \exc{OSError} upon failure.
+\notes
+    This function may not be available on all systems.
+\seealso{getenv, sprintf}
+\done
+
+\function{__set_argc_argv}
+\synopsis{Set the argument list}
+\usage{__set_argc_argv (Array_Type a)}
+\description
+  This function sets the \ivar{__argc} and \ivar{__argv} intrinsic variables.
+\done
+
+\variable{_slang_install_prefix}
+\synopsis{S-Lang's installation prefix}
+\usage{String_Type _slang_install_prefix}
+\description
+  The value of this variable is set at the S-Lang library's
+  compilation time.  On Unix systems, the value corresponds to the
+  value of the \exmp{prefix} variable in the Makefile.  For normal
+  installations, the library itself will be located in the \exmp{lib}
+  subdirectory of the \exmp{prefix} directory.
+\notes
+  The value of this variable may or may not have anything to do with
+  where the slang library is located.  As such, it should be regarded
+  as a hint.  A standard installation will have the \exmp{slsh}
+  library files located in the \exmp{share/slsh} subdirectory of the
+  installation prefix.
+\seealso{_slang_doc_dir}
+\done
+
+\variable{_slang_utf8_ok}
+\synopsis{Test if the interpreter running in UTF-8 mode}
+\usage{Int_Type _slang_utf8_ok}
+\description
+  If the value of this variable is non-zero, then the interpreter is
+  running in UTF-8 mode.  In this mode, characters in strings are
+  interpreted as variable length byte sequences according to the
+  semantics of the UTF-8 encoding.
+\notes
+  When running in UTF-8 mode, one must be careful not to confuse a
+  character with a byte.  For example, in this mode the \ifun{strlen}
+  function returns the number of characters in a string which may be
+  different than the number of bytes.  The latter information may be
+  obtained by the \ifun{strbytelen} function.
+\seealso{strbytelen, strlen, strcharlen}
+\done
+
+\function{__tmp}
+\synopsis{Returns the value of a variable and uninitialize the variable}
+\usage{__tmp (x)}
+\description
+  The \ifun{__tmp} function takes a single argument, a variable,
+  returns the value of the variable, and then undefines the variable.
+  The purpose of this pseudo-function is to free any memory
+  associated with a variable if that variable is going to be
+  re-assigned.
+\example
+#v+
+     x = 3;
+     y = __tmp(x);
+#v-
+  will result in `y' having a value of `3' and `x' will be undefined.
+\notes
+  This function is a pseudo-function because a syntax error results if
+  used like
+#v+
+      __tmp(sin(x));
+#v-
+\seealso{__uninitialize, __is_initialized}
+\done
+
+\function{__uninitialize}
+\synopsis{Uninitialize a variable}
+\usage{__uninitialize (Ref_Type x)}
+\description
+  The \ifun{__uninitialize} function may be used to uninitialize the
+  variable referenced by the parameter \exmp{x}.
+\example
+  The following two lines are equivalent:
+#v+
+     () = __tmp(z);
+     __uninitialize (&z);
+#v-
+\seealso{__tmp, __is_initialized}
+\done
+
+\function{use_namespace}
+\synopsis{Change to another namespace}
+\usage{use_namespace (String_Type name)}
+\description
+   The \ifun{use_namespace} function changes the current static namespace to
+   the one specified by the parameter.  If the specified namespace
+   does not exist, a \exc{NamespaceError} exception will be generated.
+\seealso{implements, current_namespace, import}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/ospath.tm Added

@@ -0,0 +1,89 @@
+\function{path_basename}
+\synopsis{Get the basename part of a filename}
+\usage{String_Type path_basename (String_Type filename)}
+\description
+   The \ifun{path_basename} function returns the basename associated
+   with the \exmp{filename} parameter.  The basename is the non-directory
+   part of the filename, e.g., on unix \exmp{c} is the basename of
+   \exmp{/a/b/c}.
+\seealso{path_dirname, path_extname, path_concat, path_is_absolute}
+\done
+
+\function{path_basename_sans_extname}
+\synopsis{Get the basename part of a filename but without the extension}
+\usage{String_Type path_basename_sans_extname (String_Type path)}
+\description
+   The \ifun{path_basename_sans_extname} function returns the basename
+   associated with the \exmp{filename} parameter, omitting the
+   extension if present.  The basename is the non-directory part of
+   the filename, e.g., on unix \exmp{c} is the basename of
+   \exmp{/a/b/c}.
+\seealso{path_dirname, path_basename, path_extname, path_concat, path_is_absolute}
+\done
+
+\function{path_concat}
+\synopsis{Combine elements of a filename}
+\usage{String_Type path_concat (String_Type dir, String_Type basename)}
+\description
+   The \ifun{path_concat} function combines the arguments \exmp{dir} and
+   \exmp{basename} to produce a filename.  For example, on Unix if
+   \exmp{dir} is \exmp{x/y} and \exmp{basename} is \exmp{z}, then the
+   function will return \exmp{x/y/z}.
+\seealso{path_dirname, path_basename, path_extname, path_is_absolute}
+\done
+
+\function{path_dirname}
+\synopsis{Get the directory name part of a filename}
+\usage{String_Type path_dirname (String_Type filename)}
+\description
+   The \ifun{path_dirname} function returns the directory name
+   associated with a specified filename.
+\notes
+   On systems that include a drive specifier as part of the filename,
+   the value returned by this function will also include the drive
+   specifier.
+\seealso{path_basename, path_extname, path_concat, path_is_absolute}
+\done
+
+\function{path_extname}
+\synopsis{Return the extension part of a filename}
+\usage{String_Type path_extname (String_Type filename)}
+\description
+   The \ifun{path_extname} function returns the extension portion of the
+   specified filename.  If an extension is present, this function will
+   also include the dot as part of the extension, e.g., if \exmp{filename}
+   is \exmp{"file.c"}, then this function will return \exmp{".c"}.  If no
+   extension is present, the function returns an empty string \exmp{""}.
+\notes
+   Under VMS, the file version number is not returned as part of the
+   extension.
+\seealso{path_sans_extname, path_dirname, path_basename, path_concat, path_is_absolute}
+\done
+
+\function{path_get_delimiter}
+\synopsis{Get the value of a search-path delimiter}
+\usage{Char_Type path_get_delimiter ()}
+\description
+  This function returns the value of the character used to delimit
+  fields of a search-path.
+\seealso{set_slang_load_path, get_slang_load_path}
+\done
+
+\function{path_is_absolute}
+\synopsis{Determine whether or not a filename is absolute}
+\usage{Int_Type path_is_absolute (String_Type filename)}
+\description
+   The \ifun{path_is_absolute} function will return non-zero if
+   \exmp{filename} refers to an absolute filename, otherwise it returns zero.
+\seealso{path_dirname, path_basename, path_extname, path_concat}
+\done
+
+\function{path_sans_extname}
+\synopsis{Strip the extension from a filename}
+\usage{String_Type path_sans_extname (String_Type filename)}
+\description
+  The \ifun{path_sans_extname} function removes the file name extension
+  (including the dot) from the filename and returns the result.
+\seealso{path_basename_sans_extname, path_extname, path_basename, path_dirname, path_concat}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/posio.tm Added

@@ -0,0 +1,201 @@
+\function{close}
+\synopsis{Close an open file descriptor}
+\usage{Int_Type close (FD_Type fd)}
+\description
+  The \ifun{close} function is used to close an open file descriptor
+  created by the \ifun{open} function.  Upon success \0 is returned,
+  otherwise the function returns \-1 and sets \ivar{errno} accordingly.
+\seealso{open, _close, fclose, read, write}
+\done
+
+\function{_close}
+\synopsis{Close an open file descriptor}
+\usage{Int_Type _close (Int_Type fd)}
+\description
+  The \ifun{_close} function is used to close the underlying integer
+  open file descriptor.  Upon success \0 is returned, otherwise the
+  function returns \-1 and sets \ivar{errno} accordingly.
+\seealso{open, _fileno, close, fclose, read, write}
+\done
+
+\function{dup_fd}
+\synopsis{Duplicate a file descriptor}
+\usage{FD_Type dup_fd (FD_Type fd)}
+\description
+  The \ifun{dup_fd} function duplicates a specified file descriptor and
+  returns the duplicate.  If the function fails, \NULL will be
+  returned and \ivar{errno} set accordingly.
+\notes
+  This function is essentially a wrapper around the POSIX \cfun{dup}
+  function.
+\seealso{open, close}
+\done
+
+\function{dup2_fd}
+\synopsis{Duplicate a file descriptor}
+\usage{Int_Type dup2_fd (FD_Type fd, int newfd)}
+\description
+  The \ifun{dup2_fd} function makes \exmp{newfd} a copy of the
+  specified file descriptor \exmp{fd}. Upon success returns \exmp{newfd},
+  otherwise it returns \-1 and sets \ivar{errno} accordingly.
+\seealso{dup, open, close, _close, _fileno, read}
+\done
+ 
+\function{_fileno}
+\synopsis{Get the underlying integer file descriptor}
+\usage{Int_Type _fileno (File_Type|FD_Type fp)}
+\description
+  The \ifun{_fileno} function returns the underlying integer
+  descriptor for a specified stdio \dtype{File_Type} or
+  \dtype{FD_Type} object.  Upon failure it returns -1 and sets
+  \ivar{errno} accordingly.
+\seealso{fileno, fopen, open, fclose, close, dup_fd}
+\done
+
+\function{fileno}
+\synopsis{Convert a stdio File_Type object to a FD_Type descriptor}
+\usage{FD_Type fileno (File_Type fp)}
+\description
+  The \ifun{fileno} function returns the \dtype{FD_Type} descriptor
+  associated with the stdio \dtype{File_Type} file pointer.  Upon failure,
+  \NULL is returned.
+\notes
+  Closing the resulting file descriptor will have no effect.
+\seealso{fopen, open, fclose, close, dup_fd, _fileno}
+\done
+
+\function{isatty}
+\synopsis{Determine if an open file descriptor refers to a terminal}
+\usage{Int_Type isatty (FD_Type or File_Type fd)}
+\description
+  This function returns \1 if the file descriptor \exmp{fd} refers to a
+  terminal; otherwise it returns \0.  The object \exmp{fd} may either
+  be a \dtype{File_Type} stdio descriptor or a lower-level \dtype{FD_Type}
+  object.
+\seealso{fopen, fclose, fileno, ttyname}
+\done
+
+\function{lseek}
+\synopsis{Reposition a file descriptor's file pointer}
+\usage{Long_Type lseek (FD_Type fd, LLong_Type ofs, int mode)}
+   The \ifun{lseek} function repositions the file pointer associated
+   with the open file descriptor \exmp{fd} to the offset \exmp{ofs}
+   according to the mode parameter.  Specifically, \exmp{mode} must be
+   one of the values:
+#v+
+     SEEK_SET   Set the offset to ofs from the beginning of the file
+     SEEK_CUR   Add ofs to the current offset
+     SEEK_END   Add ofs to the current file size
+#v-
+   Upon error, \ifun{lseek} returns \-1 and sets \ivar{errno}.  If
+   successful, it returns the new filepointer offset.
+\notes
+   Not all file descriptors are capable of supporting the seek
+   operation, e.g., a descriptor associated with a pipe.
+
+   By using \icon{SEEK_END} with a positive value of the \exmp{ofs}
+   parameter, it is possible to position the file pointer beyond the
+   current size of the file.
+\seealso{fseek, ftell, open, close}
+\done
+
+\function{open}
+\synopsis{Open a file}
+\usage{FD_Type open (String_Type filename, Int_Type flags ,Int_Type mode)}
+\description
+  The \ifun{open} function attempts to open a file specified by the
+  \exmp{filename} parameter according to the \exmp{flags} parameter,
+  which must be one of the following values:
+#v+
+     O_RDONLY   (read-only)
+     O_WRONLY   (write-only)
+     O_RDWR     (read/write)
+#v-
+  In addition, \exmp{flags} may also be bitwise-or'd with any of the
+  following:
+#v+
+     O_BINARY   (open the file in binary mode)
+     O_TEXT     (open the file in text mode)
+     O_CREAT    (create the file if it does not exist)
+     O_EXCL     (fail if the file already exists)
+     O_NOCTTY   (do not make the device the controlling terminal)
+     O_TRUNC    (truncate the file if it exists)
+     O_APPEND   (open the file in append mode)
+     O_NONBLOCK (open the file in non-blocking mode)
+#v-
+   Some of these flags make sense only when combined with other flags.
+   For example, if O_EXCL is used, then O_CREAT must also be
+   specified, otherwise unpredictable behavior may result.
+
+   If \icon{O_CREAT} is used for the \exmp{flags} parameter then the
+   \exmp{mode} parameter must be present. \exmp{mode} specifies the
+   permissions to use if a new file is created. The actual file
+   permissions will be affected by the process's \exmp{umask} via
+   \exmp{mode&~umask}.  The \exmp{mode} parameter's value is
+   constructed via bitwise-or of the following values:
+#v+
+     S_IRWXU    (Owner has read/write/execute permission)
+     S_IRUSR    (Owner has read permission)
+     S_IWUSR    (Owner has write permission)
+     S_IXUSR    (Owner has execute permission)
+     S_IRWXG    (Group has read/write/execute permission)
+     S_IRGRP    (Group has read permission)
+     S_IWGRP    (Group has write permission)
+     S_IXGRP    (Group has execute permission)
+     S_IRWXO    (Others have read/write/execute permission)
+     S_IROTH    (Others have read permission)
+     S_IWOTH    (Others have write permission)
+     S_IXOTH    (Others have execute permission)
+#v-
+   Upon success \ifun{open} returns a file descriptor object
+   (\dtype{FD_Type}), otherwise \NULL is returned and \ivar{errno}
+   is set.
+\notes
+   If you are not familiar with the \ifun{open} system call, then it
+   is recommended that you use \ifun{fopen} instead and use the higher
+   level stdio interface.
+\seealso{fopen, close, read, write, stat_file}
+\done
+
+\function{read}
+\synopsis{Read from an open file descriptor}
+\usage{UInt_Type read (FD_Type fd, Ref_Type buf, UInt_Type num)}
+\description
+  The \ifun{read} function attempts to read at most \exmp{num} bytes
+  into the variable indicated by \exmp{buf} from the open file
+  descriptor \exmp{fd}.  It returns the number of bytes read, or \-1
+  upon failure and sets \ivar{errno}.  The number of bytes
+  read may be less than \exmp{num}, and will be zero if an attempt is
+  made to read past the end of the file.
+\notes
+  \ifun{read} is a low-level function and may return \-1 for a variety
+  of reasons.  For example, if non-blocking I/O has been specified for
+  the open file descriptor and no data is available for reading then
+  the function will return \-1 and set \ivar{errno} to \icon{EAGAIN}.
+\seealso{fread, open, close, write}
+\done
+
+\function{ttyname}
+\synopsis{Get the pathname of the terminal}
+\usage{String_Type ttyname (FD_Type fd)}
+\description
+  This function returns the pathname of the terminal associated with
+  the file descriptor \exmp{fd} or \NULL if \exmp{fd} does not refer
+  to a terminal.
+\notes
+  This function is not available in all systems.
+\seealso{isatty}
+\done
+
+\function{write}
+\synopsis{Write to an open file descriptor}
+\usage{UInt_Type write (FD_Type fd, BString_Type buf)}
+\description
+   The \ifun{write} function attempts to write the bytes specified by
+   the \exmp{buf} parameter to the open file descriptor \exmp{fd}.  It
+   returns the number of bytes successfully written, or \-1 and sets
+   \ivar{errno} upon failure.  The number of bytes written may be less
+   than \exmp{length(buf)}.
+\seealso{read, fwrite, open, close}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/posix.tm Added

@@ -0,0 +1,441 @@
+\function{getegid}
+\synopsis{Get the effective group id of the current process}
+\usage{Int_Type getegid ()}
+\description
+  The \ifun{getegid} function returns the effective group ID of the
+  current process.
+\notes
+  This function is not supported by all systems.
+\seealso{getgid, geteuid, setgid}
+\done
+
+\function{geteuid}
+\synopsis{Get the effective user-id of the current process}
+\usage{Int_Type geteuid ()}
+\description
+  The \ifun{geteuid} function returns the effective user-id of the
+  current process.
+\notes
+  This function is not supported by all systems.
+\seealso{getuid, setuid, setgid}
+\done
+
+\function{getgid}
+\synopsis{Get the group id of the current process}
+\usage{Integer_Type getgid ()}
+\description
+  The \ifun{getgid} function returns the real group id of the current
+  process.
+\notes
+  This function is not supported by all systems.
+\seealso{getpid, getppid}
+\done
+
+\function{getpgid}
+\synopsis{Get the process group id}
+\usage{Int_Type getpgid (Int_Type pid)}
+\description
+  The \ifun{getpgid} function returns the process group id of the
+  process whose process is \exmp{pid}.  If \exmp{pid} is 0, then the
+  current process will be used.
+\notes
+  This function is not supported by all systems.
+\seealso{getpgrp, getpid, getppid}
+\done
+
+\function{getpgrp}
+\synopsis{Get the process group id of the calling process}
+\usage{Int_Type getpgrp ()}
+\description
+  The \ifun{getpgrp} function returns the process group id of the
+  current process.
+\notes
+  This function is not supported by all systems.
+\seealso{getpgid, getpid, getppid}
+\done
+
+\function{getpid}
+\synopsis{Get the current process id}
+\usage{Integer_Type getpid ()}
+\description
+  The \ifun{getpid} function returns the current process identification
+  number.
+\seealso{getppid, getgid}
+\done
+
+\function{getppid}
+\synopsis{Get the parent process id}
+\usage{Integer_Type getppid ()}
+\description
+  The \ifun{getpid} function returns the process identification
+  number of the parent process.
+\notes
+  This function is not supported by all systems.
+\seealso{getpid, getgid}
+\done
+
+\function{getpriority}
+\synopsis{Get a process's scheduling priority}
+\usage{result = getpriority (which, who)}
+\description
+ The \ifun{setpriority} function may be used to obtain the kernel's
+ scheduling priority for a process, process group, or a user depending
+ upon the values of the \exmp{which} and \exmp{who} parameters.
+ Specifically, if the value of \exmp{which} is \exmp{PRIO_PROCESS},
+ then the value of \exmp{who} specifies the process id of the affected
+ process. If \exmp{which} is \exmp{PRIO_PGRP}, then \exmp{who}
+ specifies a process group id.  If \exmp{which} is \exmp{PRIO_USER},
+ then the value of \exmp{who} is interpreted as a user id.  For the
+ latter two cases, where \exmp{which} refers to a set of processes,
+ the value returned corresponds to the highest priority of a process
+ in the set.  A value of 0 may be used for who to denote the process
+ id, process group id, or real user ID of the current process.
+
+ Upon success, the function returns the specified priority value.  If
+ an error occurs, the function will return \NULL with \ivar{errno} set
+ accordingly.
+\seealso{setpriority, getpid, getppid}
+\done
+
+\function{getrusage}
+\synopsis{Get process resource usage}
+\usage{Struct_Type getrusage (Int_Type who)}
+\description
+  This function returns a structure whose fields contain information
+  about the resource usage of calling process, summed over all threads
+  of the process.  The optional integer argument \exmp{who} may be
+  used to obtain resource usage of child processes, or of the calling
+  thread itself. Specifically, the optional integer argument
+  \exmp{who} may take on one of the following values:
+#v+
+    RUSAGE_SELF (default)
+    RUSAGE_CHILDREN
+#v-
+  If \ivar{RUSAGE_CHILDREN} is specified, then the process information
+  will be the sum of all descendents of the calling process that have
+  terminated and have been waited for (via, e.g., \ifun{waitpid}).  It
+  will not contain any information about child processes that have not
+  terminated.
+
+  The structure that is returned will contain the following fields:
+#v+
+   ru_utimesecs       user CPU time used (Double_Type secs)
+   ru_stimesecs       system CPU time used (Double_Type secs)
+   ru_maxrss          maximum resident_set_size
+   ru_minflt          page reclaims (soft page faults)
+   ru_majflt          page faults (hard page faults)
+   ru_inblock         block input operations
+   ru_oublock         block output operations
+   ru_nvcsw           voluntary context switches
+   ru_nivcsw          involuntary context switches
+   ru_ixrss           integral shared memory size
+   ru_idrss           integral unshared data size
+   ru_isrss           integral unshared stack size
+   ru_nswap           swaps
+   ru_msgsnd          IPC messages sent
+   ru_msgrcv          IPC messages received
+   ru_nsignals        signals received
+#v-
+  Some of the fields may not be supported for a particular OS or
+  kernel version.  For example, on Linux the 2.6.32 kernel supports
+  only the following fields:
+#v+
+    ru_utimesecs
+    ru_stimesecs
+    ru_maxrss (since Linux 2.6.32)
+    ru_minflt
+    ru_majflt
+    ru_inblock (since Linux 2.6.22)
+    ru_oublock (since Linux 2.6.22)
+    ru_nvcsw (since Linux 2.6)
+    ru_nivcsw (since Linux 2.6)
+#v-
+\notes
+  The underlying system call returns the CPU user and system times
+  as C \exmp{struct timeval} objects.  For convenience, the interpreter
+  interface represents these objects as double precision floating point
+  values.
+\seealso{times}
+\done
+
+\function{getsid}
+\synopsis{get the session id of a process}
+\usage{Int_Type getsid (Int_Type pid)}
+\description
+  The \ifun{getsid} function returns the session id of the current
+  process.  If the optional integer \exmp{pid} argument is given, then
+  the function returns the session id of the specified process id.
+\seealso{setsid, getpid, getpid}
+\done
+
+\function{getuid}
+\synopsis{Get the user-id of the current process}
+\usage{Int_Type getuid ()}
+\description
+  The \ifun{getuid} function returns the user-id of the current
+  process.
+\notes
+  This function is not supported by all systems.
+\seealso{getuid, getegid}
+\done
+
+\function{kill}
+\synopsis{Send a signal to a process}
+\usage{Integer_Type kill (Integer_Type pid, Integer_Type sig)}
+\description
+  This function may be used to send a signal given by the integer \exmp{sig}
+  to the process specified by \exmp{pid}.  The function returns zero upon
+  success or \exmp{-1} upon failure setting \ivar{errno} accordingly.
+\example
+  The \ifun{kill} function may be used to determine whether or not
+  a specific process exists:
+#v+
+    define process_exists (pid)
+    {
+       if (-1 == kill (pid, 0))
+         return 0;     % Process does not exist
+       return 1;
+    }
+#v-
+\notes
+  This function is not supported by all systems.
+\seealso{killpg, getpid}
+\done
+
+\function{killpg}
+\synopsis{Send a signal to a process group}
+\usage{Integer_Type killpg (Integer_Type pgrppid, Integer_Type sig)}
+\description
+  This function may be used to send a signal given by the integer \exmp{sig}
+  to the process group specified by \exmp{pgrppid}.  The function returns zero upon
+  success or \exmp{-1} upon failure setting \ivar{errno} accordingly.
+\notes
+  This function is not supported by all systems.
+\seealso{kill, getpid}
+\done
+
+\function{mkfifo}
+\synopsis{Create a named pipe}
+\usage{Int_Type mkfifo (String_Type name, Int_Type mode)}
+\description
+  The \ifun{mkfifo} attempts to create a named pipe with the specified
+  name and mode (modified by the process's umask).  The function
+  returns 0 upon success, or -1 and sets \ivar{errno} upon failure.
+\notes
+  Not all systems support the \ifun{mkfifo} function and even on
+  systems that do implement the \ifun{mkfifo} system call, the
+  underlying file system may not support the concept of a named pipe,
+  e.g, an NFS filesystem.
+\seealso{stat_file}
+\done
+
+\function{setgid}
+\synopsis{Set the group-id of the current process}
+\usage{Int_Type setgid (Int_Type gid)}
+\description
+  The \ifun{setgid} function sets the effective group-id of the current
+  process.  It returns zero upon success, or -1 upon error and sets
+  \ivar{errno} appropriately.
+\notes
+  This function is not supported by all systems.
+\seealso{getgid, setuid}
+\done
+
+\function{setpgid}
+\synopsis{Set the process group-id}
+\usage{Int_Type setpgid (Int_Type pid, Int_Type gid)}
+\description
+  The \ifun{setpgid} function sets the group-id \exmp{gid} of the
+  process whose process-id is \exmp{pid}.  If \exmp{pid} is \0, then the
+  current process-id will be used.  If \exmp{pgid} is \0, then the pid
+  of the affected process will be used.
+
+  If successful 0 will be returned, otherwise the function will
+  return \-1 and set \ivar{errno} accordingly.
+\notes
+  This function is not supported by all systems.
+\seealso{setgid, setuid}
+\done
+
+\function{setpriority}
+\synopsis{Set the scheduling priority for a process}
+\usage{Int_Type setpriority (which, who, prio)}
+\description
+ The \ifun{setpriority} function may be used to set the kernel's
+ scheduling priority for a process, process group, or a user depending
+ upon the values of the \exmp{which} and \exmp{who} parameters.
+ Specifically, if the value of \exmp{which} is \exmp{PRIO_PROCESS}, then the
+ value of \exmp{who} specifies the process id of the affected process.
+ If \exmp{which} is \exmp{PRIO_PGRP}, then \exmp{who} specifies a process
+ group id.  If \exmp{which} is \exmp{PRIO_USER},  then the value of
+ \exmp{who} is interpreted as a user id.  A value of 0 may be used for
+ who to denote the process id, process group id, or real user ID of
+ the current process.
+
+ Upon sucess, the \ifun{setpriority} function returns 0.  If an error occurs,
+ -1 is returned and errno will be set accordingly.
+\example
+  The \ifun{getpriority} and \ifun{setpriority} functions may be used
+  to implement a \exmp{nice} function for incrementing the priority of
+  the current process as follows:
+#v+
+   define nice (dp)
+   {
+      variable p = getpriority (PRIO_PROCESS, 0);
+      if (p == NULL)
+        return -1;
+      variable s = setpriority (PRIO_PROCESS, 0, p + dp);
+      if (s == -1)
+        return -1;
+      return getpriority (PRIO_PROCESS, 0);
+   }
+#v-
+\notes
+ Priority values are sometimes called "nice" values.  The actual
+ range of priority values is system dependent but commonly range from
+ -20 to 20, with -20 being the highest scheduling priority, and +20
+ the lowest.
+\seealso{getpriority, getpid}
+\done
+
+
+\function{setsid}
+\synopsis{Create a new session for the current process}
+\usage{Int_Type setsid ()}
+\description
+  If the current process is not a session leader, the \ifun{setsid}
+  function will create a new session and make the process the session
+  leader for the new session.  It returns the the process group id of
+  the new session.
+
+  Upon failure, -1 will be returned and \ivar{errno} set accordingly.
+\seealso{getsid, setpgid}
+\done
+
+\function{setuid}
+\synopsis{Set the user-id of the current process}
+\usage{Int_Type setuid (Int_Type id)}
+\description
+  The \ifun{setuid} function sets the effective user-id of the current
+  process.  It returns zero upon success, or \-1 upon error and sets
+  \ivar{errno} appropriately.
+\notes
+  This function is not supported by all systems.
+\seealso{setgid, setpgid, getuid, geteuid}
+\done
+
+\function{sleep}
+\synopsis{Pause for a specified number of seconds}
+\usage{sleep (Double_Type n)}
+\description
+  The \ifun{sleep} function delays the current process for the
+  specified number of seconds.  If it is interrupted by a signal, it
+  will return prematurely.
+\notes
+  Not all system support sleeping for a fractional part of a second.
+\done
+
+\function{statvfs}
+\synopsis{Get file system statistics}
+\usage{Struct_Type statvfs (fsobj)}
+\description
+  This function is a wrapper around the corresponding POSIX function.
+  It returns a structure whose fields provide information about the
+  filesystem object \exmp{fsobj}.  This object can be either a path
+  name within the file system, or an open file descriptor represented
+  by an integer, \dtype{File_Type}, or \dtype{FD_Type} object.
+
+  The fields of the structure are defined as follows:
+#v+
+    f_bsize  :  file system block size
+    f_frsize :  fragment size
+    f_blocks :  size of fs in f_frsize units
+    f_bfree  :  number of free blocks
+    f_bavail :  number of free blocks for unprivileged users
+    f_files  :  number of inodes
+    f_ffree  :  number of free inodes
+    f_favail :  number of free inodes for unprivileged users
+    f_fsid   :  file system ID
+    f_flag   :  mount flags
+    f_namemax:  maximum filename length
+#v-
+  The value of the \exmp{f_flag} field is a bitmapped integer composed
+  of the following bits:
+#v+
+    ST_RDONLY : Read-only file system.
+    ST_NOSUID : Set-user-ID/set-group-ID bits are ignored by the exec
+                functions.
+#v-
+
+  Upon error, the function returns \NULL and sets \ivar{errno}
+  accordingly.
+\notes
+  This function is not supported by all systems.
+\seealso{stat_file}
+\done
+
+\function{system}
+\synopsis{Execute a shell command}
+\usage{Integer_Type system (String_Type cmd)}
+\description
+  The \ifun{system} function may be used to execute the string
+  expression \exmp{cmd} in an inferior shell.  This function is an
+  interface to the C \ifun{system} function which returns an
+  implementation-defined result.   On Linux, it returns 127 if the
+  inferior shell could not be invoked, -1 if there was some other
+  error, otherwise it returns the return code for \exmp{cmd}.
+\example
+#v+
+    define dir ()
+    {
+       () = system ("DIR");
+    }
+#v-
+  displays a directory listing of the current directory under MSDOS or
+  VMS.
+\seealso{system_intr, new_process, popen}
+\done
+
+\function{system_intr}
+\synopsis{Execute a shell command}
+\usage{Integer_Type system_intr (String_Type cmd)}
+\description
+ The \ifun{system_intr} function performs the same task as the
+ \ifun{system} function, except that the \var{SIGINT} signal will not
+ be ignored by the calling process.  This means that if a \slang script
+ calls \ifun{system_intr} function, and Ctrl-C is pressed, both the
+ command invoked by the \ifun{system_intr} function and the script
+ will be interrupted.  In contrast, if the command were invoked using
+ the \ifun{system} function, only the command called by it would be
+ interrupted, but the script would continue executing.
+\seealso{system, new_process, popen}
+\done
+
+\function{umask}
+\synopsis{Set the file creation mask}
+\usage{Int_Type umask (Int_Type m)}
+\description
+  The \ifun{umask} function sets the file creation mask to the value of
+  \exmp{m} and returns the previous mask.
+\seealso{stat_file}
+\done
+
+\function{uname}
+\synopsis{Get the system name}
+\usage{Struct_Type uname ()}
+\description
+  The \ifun{uname} function returns a structure containing information
+  about the operating system.  The structure contains the following
+  fields:
+#v+
+       sysname  (Name of the operating system)
+       nodename (Name of the node within the network)
+       release  (Release level of the OS)
+       version  (Current version of the release)
+       machine  (Name of the hardware)
+#v-
+\notes
+  Not all systems support this function.
+\seealso{getenv}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/qualif.tm Added

@@ -0,0 +1,104 @@
+\function{qualifier}
+\synopsis{Get the value of a qualifier}
+\usage{value = qualifier (String_Type name ,default_value)}
+\description
+ This function may be used to get the value of a qualifier.  If the
+ specified qualifier does not exist, \NULL will be returned,
+ unless a default value has been provided.
+\example
+#v+
+    define echo (text)
+    {
+       variable fp = qualifier ("out", stdout);
+       () = fputs (text, fp);
+    }
+    echo ("hello");              % writes hello to stdout
+    echo ("hello"; out=stderr);  % writes hello to stderr
+#v-
+\notes
+ Since \NULL is a valid value for a qualifier, this function is
+ unable to distinguish between a non-existent qualifier and one whose
+ value is \NULL.  If such a distinction is important, the
+ \ifun{qualifier_exists} function can be used.  For example,
+#v+
+    define echo (text)
+    {
+       variable fp = stdout;
+       if (qualifier_exists ("use_stderr"))
+         fp = stderr;
+       () = fputs (text, fp);
+    }
+    echo ("hello"; use_stderr);  % writes hello to stderr
+#v-
+ In this case, no value was provided for the \exmp{use_stderr}
+ qualifier: it exists but has a value of \NULL.
+\seealso{qualifier_exists, __qualifiers}
+\done
+
+\function{__qualifiers}
+\synopsis{Get the active set of qualifiers}
+\usage{Struct_Type __qualifiers ()}
+\description
+ This function returns the set of qualifiers associated with the
+ current execution context.  If qualifiers are active, then the result
+ is a structure representing the names of the qualifiers and their
+ corresponding values.  Otherwise \NULL will be returned.
+
+ One of the main uses of this function is to pass the current set of
+ qualifiers to another another function.  For example, consider a
+ plotting application with a function called called \exmp{lineto} that
+ sets the pen-color before drawing the line to the specified point:
+#v+
+    define lineto (x, y)
+    {
+       % The color may be specified by a qualifier, defaulting to black
+       variable color = qualifier ("color", "black");
+       set_pen_color (color);
+           .
+           .
+    }
+#v-
+ The \exmp{lineto} function permits the color to be specified by a
+ qualifier.  Now consider a function that make use of lineto to draw a
+ line segment between two points:
+#v+
+    define line_segment (x0, y0, x1, y1)
+    {
+       moveto (x0, y0);
+       lineto (x1, y1 ; color=qualifier("color", "black"));
+    }
+    line_segment (1,1, 10,10; color="blue");
+#v-
+ Note that in this implementation of \exmp{line_segment}, the
+ \exmp{color} qualifier was explicitly passed to the \exmp{lineto}
+ function.  However, this technique does not scale well.  For example, the
+ \exmp{lineto} function might also take a qualifier that specifies the
+ line-style, to be used as
+#v+
+    line_segment (1,1, 10,10; color="blue", linestyle="solid");
+#v-
+ But the above implementation of \exmp{line_segment} does not pass the
+ \exmp{linestyle} qualifier.  In such a case, it is preferable to pass
+ all the qualifiers, e.g.,
+#v+
+    define line_segment (x0, y0, x1, y1)
+    {
+       moveto (x0, y0);
+       lineto (x1, y1 ;; __qualifiers());
+    }
+#v-
+ Note the use of the double-semi colon in the \exmp{lineto}
+ statement.  This tells the parser that the qualifiers are specified
+ by a structure-valued argument and not a set of name-value pairs.
+\seealso{qualifier, qualifier_exists}
+\done
+
+\function{qualifier_exists}
+\synopsis{Check for the existence of a qualifier}
+\usage{Int_Type qualifier_exists (String_Type name)}
+\description
+ This function will return 1 if a qualifier of the specified name
+ exists, or 0 otherwise.
+\seealso{qualifier, __qualifiers}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/rline.tm Added

@@ -0,0 +1,253 @@
+#d notes_comment This function is part of the S-Lang readline interface.
+
+\function{rline_bolp}
+\synopsis{Test of the editing point is at the beginning of the line}
+\usage{Int_Type rline_bolp()}
+\description
+  The \ifun{rline_bolp} function returns a non-zero value if the
+  current editing position is at the beginning of the line.
+\notes
+ \notes_comment
+\seealso{rline_eolp, rline_get_point, rline_get_line}
+\done
+
+\function{rline_call}
+\synopsis{Invoke an internal readline function}
+\usage{rline_call (String_Type func)}
+\description
+ Not all of the readline functions are available directly from the
+ \slang interpreter.  For example, the "deleol" function, which
+ deletes through the end of the line may be executed using
+#v+
+    rline_call("deleol");
+#v-
+  See the documentation for the \ifun{rline_setkey} function for a
+  list of internal functions that may be invoked by \ifun{rline_call}.
+\notes
+ \notes_comment
+\seealso{rline_setkey, rline_del, rline_ins}
+\done
+
+\function{rline_del}
+\synopsis{Delete a specified number of characters at the current position}
+\usage{rline_del(Int_Type n)}
+\description
+ This function delete a specified number of characters at the current
+ editing position.  If the number \exmp{n} is less than zero, then the
+ previous \exmp{n} characters will be deleted.  Otherwise, the next
+ \exmp{n} characters will be deleted.
+\notes
+ \notes_comment
+\seealso{rline_ins, rline_setkey}
+\done
+
+\function{rline_eolp}
+\synopsis{Test of the editing point is at the end of the line}
+\usage{Int_Type rline_eolp()}
+\description
+  The \ifun{rline_bolp} function returns a non-zero value if the
+  current editing position is at the end of the line.
+\notes
+ \notes_comment
+\seealso{rline_bolp, rline_get_point, rline_get_line}
+\done
+
+\function{rline_getkey}
+\synopsis{Obtain the next byte in the readline input stream}
+\usage{Int_Type rline_getkey ()}
+\description
+  This function returns the next byte in the readline input stream.
+  If no byte is available, the function will wait until one is.
+\notes
+ \notes_comment
+\seealso{rline_input_pending, rline_setkey}
+\done
+
+\function{rline_get_edit_width}
+\synopsis{Get the width of the readline edit window}
+\usage{Int_Type rline_get_edit_width ()}
+\description
+  This function returns the width of the edit window.  For \slsh, this
+  number corresponds to the width of the terminal window.
+\notes
+ \notes_comment
+\seealso{rline_ins}
+\done
+
+\function{rline_get_history}
+\synopsis{Retrieve the readline history}
+\usage{Array_Type rline_get_history ()}
+\description
+  This function returns the readline edit history as an array of
+  strings.
+\notes
+ \notes_comment
+\seealso{rline_set_line}
+\done
+
+\function{rline_get_line}
+\synopsis{Get a copy of the line being edited}
+\usage{String_Type rline_get_line ()}
+\description
+  This function returns the current edit line.
+\notes
+ \notes_comment
+\seealso{rline_set_line, rline_get_history}
+\done
+
+\function{rline_get_point}
+\synopsis{Get the current editing position}
+\usage{Int_Type rline_get_point ()}
+\description
+ The \ifun{rline_get_point} function returns the byte-offset of the
+ current editing position.
+\notes
+ \notes_comment
+\seealso{rline_set_point}
+\done
+
+\function{rline_input_pending}
+\synopsis{Test to see if readline input is available for reading}
+\usage{Int_Type rline_input_pending (Int_Type tsecs)}
+\description
+  This function returns a non-zero value if readline input is
+  available to be read.  If none is immediately available, it will
+  wait for up to \exmp{tsecs} tenths of a second for input before
+  returning.
+\notes
+ \notes_comment
+\seealso{rline_getkey}
+\done
+
+\function{rline_ins}
+\synopsis{Insert a string at the current editing point}
+\usage{rline_ins (String_Type text)}
+\description
+  This function inserts the specified string into the line being edited.
+\notes
+ \notes_comment
+\seealso{rline_set_line, rline_del}
+\done
+
+\function{rline_setkey}
+\synopsis{Bind a key in the readline keymap to a function}
+\usage{rline_setkey (func, keyseq)}
+\description
+  The \ifun{rline_setkey} function binds the function \exmp{func} to
+  the specified key sequence \exmp{keyseq}.  The value of \exmp{func}
+  may be either a reference to a \slang function, or a string giving
+  the name of an internal readline function.
+
+  Functions that are internal to the readline interface include:
+#v+
+   bdel             Delete the previous character
+   bol              Move to the beginning of the line
+   complete         The command line completion function
+   del              Delete the character at the current position
+   delbol           Delete to the beginning of the line
+   deleol           Delete through the end of the line
+   down             Goto the next line in the history
+   enter            Return to the caller of the readline function
+   eol              Move to the end of the line
+   kbd_quit         Abort editing of the current line
+   left             Move left one character
+   quoted_insert    Insert the next byte into the line
+   redraw           Redraw the line
+   right            Move right one character
+   self_insert      Insert the byte that invoked the function
+   trim             Remove whitespace about the current position
+   up               Goto the previous line in the history
+#v-
+\notes
+ \notes_comment
+\seealso{rline_unsetkey}
+\done
+
+\function{rline_set_completion_callback}
+\synopsis{Set the function to be used for completion at the readline prompt}
+\usage{rline_set_completion_callback (Ref_Type func)}
+\description
+  This function sets the callback function to be used for completion at the
+  readline prompt.  The callback function must be defined to accept
+  two values, the first being a string containing the text of the line
+  being edited, and an integer giving the position of the byte-offset
+  into the string where completion was requested.
+
+  The callback function must return two values: an array giving the
+  list of possible completion strings, and an integer giving the byte
+  offset into the string of the start of the text to be completed.
+\example
+  See completion-callback function defined in the \slsh library file
+  \exmp{rline/complete.sl}.
+\notes
+ \notes_comment
+\seealso{rline_set_list_completions_callback}
+\done
+
+\function{rline_set_history}
+\synopsis{Replace the current history list with a new one}
+\usage{rline_set_history (Array_Type lines)}
+\description
+  The \ifun{rline_set_history} function replaces the current history
+  by the specified array of strings.
+\notes
+ \notes_comment
+\seealso{rline_get_history}
+\done
+
+\function{rline_set_line}
+\synopsis{Replace the current line with a new one}
+\usage{rline_set_line (String_Type line)}
+\description
+  The \ifun{rline_set_line} function replaces the line being edited by
+  the specified one.
+\notes
+ \notes_comment
+\seealso{rline_get_line}
+\done
+
+\function{rline_set_list_completions_callback}
+\synopsis{Set a callback function to display the list of completions}
+\usage{rline_set_list_completions_callback (Ref_Type func)}
+\description
+  This function sets the \slang function that is to be used to display the
+  list of possible completions for current word at the readline prompt.
+  The callback function must be defined to accept a single parameter
+  representing an array of completion strings.
+\example
+  This callback function writes the completions using the message
+  functions:
+#v+
+     private define display_completions (strings)
+     {
+        variable str;
+        vmessage ("There are %d completions:\n", length(strings));
+        foreach str (strings) vmessage ("%s\n", str);
+     }
+     rline_set_list_completions_callback (&display_completions);
+#v-
+\seealso{rline_set_completion_callback}
+\done
+
+\function{rline_set_point}
+\synopsis{Move the current editing position to another}
+\usage{rline_set_point (Int_Type ofs)}
+\description
+ The \ifun{rline_set_point} function sets the editing point to the
+ specified byte-offset from the beginning of the line.
+\notes
+ \notes_comment
+\seealso{rline_get_point}
+\done
+
+\function{rline_unsetkey}
+\synopsis{Unset a key binding from the readline keymap}
+\usage{rline_unsetkey (String_Type keyseq)}
+\description
+  The \ifun{rline_unsetkey} function unbinds the specified key sequence
+  from the readline keymap.
+\notes
+ \notes_comment
+\seealso{rline_setkey}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/signal.tm Added

@@ -0,0 +1,210 @@
+\function{alarm}
+\synopsis{Schedule an alarm signal}
+\usage{alarm (UInt_Type secs , Ref_Type secs_remaining)}
+\description
+  The \ifun{alarm} function schedules the delivery of a \icon{SIGALRM}
+  signal in \exmp{secs} seconds.  Any previously scheduled alarm will
+  be canceled.  If \exmp{secs} is zero, then no new alarm will be
+  scheduled.  If the second argument is present, then it must be a
+  reference to a variable whose value will be set upon return to the
+  number of seconds remaining for a previously scheduled alarm to take
+  place.
+\example
+  This example demonstrates how the \ifun{alarm} function may be
+  used to read from \ivar{stdin} within a specified amount of time:
+#v+
+    define sigalrm_handler (sig)
+    {
+       throw ReadError, "Read timed out";
+    }
+    define read_or_timeout (secs)
+    {
+       variable line, err;
+       signal (SIGALRM, &sigalrm_handler);
+       () = fputs ("Enter some text> ", stdout); () = fflush (stdout);
+       alarm (secs);
+       try (err)
+         {
+            if (-1 == fgets (&line, stdin))
+              throw ReadError, "Failed to read from stdin";
+         }
+       catch IOError:
+         {
+            message (err.message);
+            return NULL;
+         }
+       return line;
+    }
+#v-
+\notes
+  Some operating systems may implement the \ifun{sleep} function using
+  \ifun{alarm}.  As a result, it is not a good idea to mix calls to
+  \ifun{alarm} and \ifun{sleep}.
+
+  The default action for \icon{SIGALRM} is to terminate the process.
+  Hence, if \ifun{alarm} is called it is wise to establish a signal
+  handler for \ifun{SIGALRM}.
+\seealso{signal, sleep, setitimer, getitimer}
+\done
+
+\function{getitimer}
+\synopsis{Get the value of an interval timer}
+\usage{(secs, period) = getitimer (Int_Type timer)}
+\description
+  This function returns the value of the specified interval timer as a
+  pair of double precision values: \exmp{period} and \exmp{secs}.
+
+  The value of \exmp{secs} indicates the number of seconds
+  remaining before the timer expires.  A value of 0 for
+  \exmp{secs} indicates that the timer is inactive.
+  The value of \exmp{period} indicates the periodicity of the timer.
+  That is, when the timer goes off, it will automatically be reset to
+  go off again after \exmp{period} seconds.
+
+  There are 3 interval timers available: \icon{ITIMER_REAL},
+  \icon{ITIMER_VIRTUAL}, and \icon{ITIMER_PROF}.
+
+  The \icon{ITIMER_REAL} timer operates in real time and when the time
+  elapses, a \icon{SIGALRM} will be sent to the process.
+
+  The \icon{ITIMER_VIRTUAL} timer operates in the virtual time of the
+  process; that is, when process is actively running.  When it
+  elapses, \icon{SIGVTALRM} will be sent to the process.
+
+  The \icon{ITIMER_PROF} operates when the process is actively
+  running, or when the kernel is performing a task on behalf of the
+  process.  It sends a \icon{SIGPROF} signal to the process.
+\notes
+  The interaction between these timers and the \ifun{sleep} and
+  \ifun{alarm} functions is OS dependent.
+
+  The resolution of a timer is system dependent; typical values are on
+  the order of milliseconds.
+\seealso{setitimer, alarm, signal}
+\done
+
+\function{setitimer}
+\synopsis{Set the value of an interval timer}
+\usage{setitimer (Int_Type timer, secs , period ,&old_secs, &old_period)}
+\description
+  This function sets the value of a specified interval timer, and
+  optionally returns the previous value.  The value of the
+  \exmp{timer} argument must be one of the 3 interval timers
+  \icon{ITIMER_REAL}, \icon{ITIMER_VIRTUAL}, or \icon{ITIMER_PROF}.
+  See the documentation for the \ifun{getitimer} function for
+  information about the semantics of these timers.
+
+  The value of the \exmp{secs} parameter specifies the expiration time
+  for the timer.  If this value is 0, the timer will be disabled.
+  Unless a non-zero value for the optional \exmp{period} parameter is
+  given, the timer will be disabled after it expires.  Otherwise,
+  the timer will reset to go off with a period of \exmp{period} seconds.
+
+  The final two optional arguments are references to variables that
+  will be set to the previous values associated with the timer.
+\seealso{getitimer, alarm, signal}
+\done
+
+\function{signal}
+\synopsis{Establish a signal handler}
+\usage{signal (Int_Type sig, Ref_Type func ,Ref_Type old_func)}
+\description
+  The \ifun{signal} function assigns the signal handler represented by
+  \exmp{func} to the signal \exmp{sig}.  Here \exmp{func} is usually
+  reference to a function that takes an integer argument (the signal)
+  and returns nothing, e.g.,
+#v+
+    define signal_handler (sig)
+    {
+       return;
+    }
+#v-
+  Alternatively, \exmp{func} may be given by one of the symbolic
+  constants \icon{SIG_IGN} or \icon{SIG_DFL} to indicate that the
+  signal is to be ignored or given its default action, respectively.
+
+  The first parameter, \exmp{sig}, specifies the signal to be handled.
+  The actual supported values vary with the OS.  Common values on Unix
+  include \exmp{SIGHUP}, \exmp{SIGINT}, and \exmp{SIGTERM}.
+
+  If a third argument is present, then it must be a reference to a
+  variable whose value will be set to the value of the previously
+  installed handler.
+\example
+  This example establishes a handler for \exmp{SIGTSTP}.
+#v+
+    static define sig_suspend ();  % forward declaration
+    static define sig_suspend (sig)
+    {
+       message ("SIGTSTP received-- stopping");
+       signal (sig, SIG_DFL);
+       () = kill (getpid(), SIGSTOP);
+       message ("Resuming");
+       signal (sig, &sig_suspend);
+    }
+    signal (SIGTSTP, &sig_suspend);
+#v-
+\notes
+  Currently the signal interface is supported only on systems that
+  implement signals according to the POSIX standard.
+
+  Once a signal has been received, it will remain blocked until after
+  the signal handler has completed.  This is the reason \icon{SIGSTOP}
+  was used in the above signal handler instead of \icon{SIGTSTP}.
+\seealso{alarm, sigsuspend, sigprocmask}
+\done
+
+\function{sigprocmask}
+\synopsis{Change the list of currently blocked signals}
+\usage{sigprocmask (Int_Type how, Array_Type mask ,Ref_Type old_mask)}
+\description
+  The \ifun{sigprocmask} function may be used to change the list of
+  signals that are currently blocked.  The first parameter indicates
+  how this is accomplished.  Specifically, \exmp{how} must be one of
+  the following values: \icon{SIG_BLOCK}, \icon{SIG_UNBLOCK}, or
+  \icon{SIG_SETMASK}.
+
+  If \exmp{how} is \icon{SIG_BLOCK}, then the set of blocked signals
+  will be the union the current set with the values specified in the
+  \exmp{mask} argument.
+
+  If \exmp{how} is \icon{SIG_UNBLOCK}, then the signals specified by
+  the \exmp{mask} parameter will be removed from the currently blocked
+  set.
+
+  If \exmp{how} is \icon{SIG_SETMASK}, then the set of blocked signals
+  will be set to those given by the \exmp{mask}.
+
+  If a third argument is present, then it must be a reference to a
+  variable whose value will be set to the previous signal mask.
+\seealso{signal, sigsuspend, alarm}
+\done
+
+\function{sigsuspend}
+\synopsis{Suspend the process until a signal is delivered}
+\usage{sigsuspend (Array_Type signal_mask)}
+\description
+  The \ifun{sigsuspend} function suspends the current process
+  until a signal is received.  An optional array argument may be
+  passed to the function to specify a list of signals that should be
+  temporarily blocked while waiting for a signal.
+\example
+  The following example pauses the current process for 10 seconds
+  while blocking the \icon{SIGHUP} and \icon{SIGINT} signals.
+#v+
+     static variable Tripped;
+     define sigalrm_handler (sig)
+     {
+        Tripped = 1;
+     }
+     signal (SIGALRM, &sigalrm_handler);
+     Tripped = 0;
+     alarm (10);
+     while (Tripped == 0) sigsuspend (SIGHUP, SIGINT);
+#v-
+  Note that in this example the call to \ifun{sigsuspend} was wrapped in
+  a while-loop.  This was necessary because there is no guarantee that
+  another signal would not cause \ifun{sigsuspend} to return.
+\seealso{signal, alarm, sigprocmask}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/stack.tm Added

@@ -0,0 +1,197 @@
+\function{dup}
+\synopsis{Duplicate the value at the top of the stack}
+\usage{dup ()}
+\description
+ This function returns an exact duplicate of the object on top of the
+ stack. For some objects such as arrays or structures, it creates a
+ new reference to the object. However, for simple scalar \slang types such
+ as strings, integers, and doubles, it creates a new copy of the
+ object.
+\seealso{pop, typeof}
+\done
+
+\function{exch}
+\synopsis{Exchange two items on the stack}
+\usage{exch ()}
+\description
+ The \ifun{exch} swaps the two top items on the stack.
+\seealso{pop, _stk_reverse, _stk_roll}
+\done
+
+\function{pop}
+\synopsis{Discard an item from the stack}
+\usage{pop ()}
+\description
+ The \ifun{pop} function removes the top item from the stack.
+\seealso{_pop_n, __pop_args}
+\done
+
+\function{__pop_args}
+\synopsis{Remove n function arguments from the stack}
+\usage{args = __pop_args(Integer_Type n)}
+\description
+ This function, together with the companion function
+ \ifun{__push_args}, is useful for creating a function that takes a
+ variable number of arguments, as well as passing the arguments of
+ one function to another function.
+
+ \ifun{__pop_args} removes the specified number of values from the
+ stack and returns them as an array of structures of the corresponding
+ length. Each structure in the array consists of a single
+ field called \exmp{value}, which represents the value of the
+ argument.
+\example
+ Consider the following function. It prints all its arguments to
+ \ivar{stdout} separated by spaces:
+#v+
+ define print_args ()
+ {
+ variable i;
+ variable args = __pop_args (_NARGS);
+
+ for (i = 0; i < _NARGS; i++)
+ {
+ () = fputs (string (argsi.value), stdout);
+ () = fputs (" ", stdout);
+ }
+ () = fputs ("\n", stdout);
+ () = fflush (stdout);
+ }
+#v-
+ Now consider the problem of defining a function called \exmp{ones}
+ that returns a multi-dimensional array with all the elements set to
+ 1. For example, \exmp{ones(10)} should return a 1-d array of 10
+ ones, whereas \exmp{ones(10,20)} should return a 10x20 array.
+#v+
+ define ones ()
+ {
+ !if (_NARGS) return 1;
+ variable a;
+
+ a = __pop_args (_NARGS);
+ return @Array_Type (Integer_Type, __push_args (a)) + 1;
+ }
+#v-
+ Here, \ifun{__push_args} was used to push the arguments passed to
+ the \exmp{ones} function onto the stack to be used when dereferencing
+ \dtype{Array_Type}.
+\notes
+ This function has been superseded by the \ifun{__pop_list} function,
+ which returns the objects as a list instead of an array of structures.
+\seealso{__push_args, __pop_list, __push_list, typeof, _pop_n}
+\done
+
+\function{__pop_list}
+\synopsis{Convert items on the stack to a List_Type}
+\usage{List_Type = __pop_list (Int_Type n)}
+\description
+ This function removes a specified number of items from the stack and
+ converts returns them in the form of a list.
+\example
+#v+
+ define print_args ()
+ {
+ variable list = __pop_list (_NARGS);
+ variable i;
+ _for i (0, length(list)-1, 1)
+ {
+ vmessage ("arg%d: %S", i, listi);
+ }
+ }
+#v-
+\seealso{__push_list}
+\done
+
+\function{_pop_n}
+\synopsis{Remove objects from the stack}
+\usage{_pop_n (Integer_Type n);}
+\description
+ The \ifun{_pop_n} function removes the specified number of objects
+ from the top of the stack.
+\seealso{_stkdepth, pop}
+\done
+
+\function{_print_stack}
+\synopsis{Print the values on the stack.}
+\usage{_print_stack ()}
+\description
+ This function dumps out what is currently on the \slang stack. It does not
+ alter the stack and it is usually used for debugging purposes.
+\seealso{_stkdepth, string, message}
+\done
+
+\function{__push_args}
+\synopsis{Move n function arguments onto the stack}
+\usage{__push_args (Struct_Type args);}
+\description
+ This function together with the companion function \ifun{__pop_args}
+ is useful for the creation of functions that take a variable number
+ of arguments. See the description of \ifun{__pop_args} for more
+ information.
+\notes
+ This function has been superseded by the \ifun{__push_list} function.
+\seealso{__pop_args, __push_list, __pop_list, typeof, _pop_n}
+\done
+
+\function{__push_list}
+\synopsis{Push the elements of a list to the stack}
+\usage{__push_list (List_Type list)}
+\description
+ This function pushes the elements of a list to the stack.
+\example
+#v+
+ private define list_to_array (list)
+ {
+ return __push_list (list);
+ }
+#v-
+\seealso{__pop_list}
+\done
+
+\function{_stkdepth}
+\usage{Get the number of objects currently on the stack}
+\synopsis{Integer_Type _stkdepth ()}
+\description
+ The \ifun{_stkdepth} function returns number of items on the stack.
+\seealso{_print_stack, _stk_reverse, _stk_roll}
+\done
+
+\function{_stk_reverse}
+\synopsis{Reverse the order of the objects on the stack}
+\usage{_stk_reverse (Integer_Type n)}
+\description
+ The \ifun{_stk_reverse} function reverses the order of the top
+ \exmp{n} items on the stack.
+\seealso{_stkdepth, _stk_roll}
+\done
+
+\function{_stk_roll}
+\synopsis{Roll items on the stack}
+\usage{_stk_roll (Integer_Type n)}
+\description
+ This function may be used to alter the arrangement of objects on the
+ stack. Specifically, if the integer \exmp{n} is positive, the top
+ \exmp{n} items on the stack are rotated up. If
+ \exmp{n} is negative, the top \exmp{abs(n)} items on the stack are
+ rotated down.
+\example
+ If the stack looks like:
+#v+
+ item-0
+ item-1
+ item-2
+ item-3
+#v-
+ where \exmp{item-0} is at the top of the stack, then
+ \exmp{_stk_roll(-3)} will change the stack to:
+#v+
+ item-2
+ item-0
+ item-1
+ item-3
+#v-
+\notes
+ This function only has an effect if \exmp{abs(n) > 1}.
+\seealso{_stkdepth, _stk_reverse, _pop_n, _print_stack}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/stdio.tm Added

@@ -0,0 +1,511 @@
+\function{clearerr}
+\synopsis{Clear the error of a file stream}
+\usage{clearerr (File_Type fp)}
+\description
+  The \ifun{clearerr} function clears the error and end-of-file flags
+  associated with the open file stream \exmp{fp}.
+\seealso{ferror, feof, fopen}
+\done
+
+\function{fclose}
+\synopsis{Close a file}
+\usage{Integer_Type fclose (File_Type fp)}
+\description
+  The \ifun{fclose} function may be used to close an open file pointer
+  \exmp{fp}.  Upon success it returns zero, and upon failure it sets
+  \ivar{errno} and returns \exmp{-1}.  Failure usually indicates a that
+  the file system is full or that \exmp{fp} does not refer to an open file.
+\notes
+  Many C programmers call \ifun{fclose} without checking the return
+  value.  The \slang language requires the programmer to explicitly
+  handle any value returned by a function.  The simplest way to
+  handle the return value from \ifun{fclose} is to call it via:
+#v+
+     () = fclose (fp);
+#v-
+\seealso{fopen, fgets, fflush, pclose, errno}
+\done
+
+\function{fdopen}
+\synopsis{Convert a FD_Type file descriptor to a stdio File_Type object}
+\usage{File_Type fdopen (FD_Type, String_Type mode)}
+\description
+   The \ifun{fdopen} function creates and returns a stdio
+   \dtype{File_Type} object from the open \dtype{FD_Type}
+   descriptor \exmp{fd}.  The \exmp{mode} parameter corresponds to the
+   \exmp{mode} parameter of the \ifun{fopen} function and must be
+   consistent with the mode of the descriptor \exmp{fd}.  The function
+   returns \NULL upon failure and sets \ivar{errno}.
+\notes
+   Since the stdio \dtype{File_Type} object created by this function
+   is derived from the \dtype{FD_Type} descriptor, the \dtype{FD_Type}
+   is regarded as more fundamental than the \dtype{File_Type} object.
+   This means that the descriptor must be in scope while the
+   \dtype{File_Type} object is used.  In particular, if the descriptor
+   goes out of scope, the descriptor will get closed causing I/O to the
+   \dtype{File_Type} object to fail, e.g.,
+#v+
+     fd = open ("/path/to/file", O_RDONLY);
+     fp = fdopen (fd);
+     fd = 0;     % This will cause the FD_Type descriptor to go out of
+                 % scope.  Any I/O on fp will now fail.
+#v-
+
+   Calling the \ifun{fclose} function on the \dtype{File_Type} object
+   will cause the underlying descriptor to close.
+
+   Any stdio \dtype{File_Type} object created by the \ifun{fdopen}
+   function will remain associated with the \dtype{FD_Type} descriptor,
+   unless the object is explicitly removed via \ifun{fclose}.  This
+   means that code such as
+#v+
+      fd = open (...);
+      loop (50)
+        {
+           fp = fdopen (fd, ...);
+              .
+              .
+        }
+#v-
+   will result in 50 \dtype{File_Type} objects attached to \exmp{fd}
+   after the loop has terminated.
+\seealso{fileno, fopen, open, close, fclose, dup_fd}
+\done
+
+\function{feof}
+\synopsis{Get the end-of-file status}
+\usage{Integer_Type feof (File_Type fp)}
+\description
+  This function may be used to determine the state of the end-of-file
+  indicator of the open file descriptor \exmp{fp}.  It returns zero
+  if the indicator is not set, or non-zero if it is.  The end-of-file
+  indicator may be cleared by the \ifun{clearerr} function.
+\seealso{ferror, clearerr, fopen}
+\done
+
+\function{ferror}
+\synopsis{Determine the error status of an open file descriptor}
+\usage{Integer_Type ferror (File_Type fp)}
+\description
+  This function may be used to determine the state of the error
+  indicator of the open file descriptor \exmp{fp}.  It returns zero
+  if the indicator is not set, or non-zero if it is.  The error
+  indicator may be cleared by the \ifun{clearerr} function.
+\seealso{feof, clearerr, fopen}
+\done
+
+\function{fflush}
+\synopsis{Flush an output stream}
+\usage{Integer_Type fflush (File_Type fp)}
+\description
+  The \ifun{fflush} function may be used to update the stdio \em{output}
+  stream specified by \exmp{fp}.  It returns 0 upon success, or
+  -1 upon failure and sets \ivar{errno} accordingly.  In
+  particular, this function will fail if \exmp{fp} does not represent
+  an open output stream, or if \exmp{fp} is associated with a disk file and
+  there is insufficient disk space.
+\example
+  This example illustrates how to use the \ifun{fflush} function
+  without regard to the return value:
+#v+
+    () = fputs ("Enter value> ", stdout);
+    () = fflush (stdout);
+#v-
+\seealso{fopen, fclose}
+\done
+
+\function{fgets}
+\synopsis{Read a line from a file}
+\usage{Integer_Type fgets (SLang_Ref_Type ref, File_Type fp)}
+\description
+  \ifun{fgets} reads a line from the open file specified by \exmp{fp}
+  and places the characters in the variable whose reference is
+  specified by \exmp{ref}.
+  It returns -1 if \exmp{fp} is not associated with an open file
+  or an attempt was made to read at the end the file; otherwise, it
+  returns the number of characters read.
+\example
+  The following example returns the lines of a file via a linked list:
+#v+
+    define read_file (file)
+    {
+       variable buf, fp, root, tail;
+       variable list_type = struct { text, next };
+
+       root = NULL;
+
+       fp = fopen(file, "r");
+       if (fp == NULL)
+         throw OpenError, "fopen failed to open $file for reading"$;
+       while (-1 != fgets (&buf, fp))
+         {
+            if (root == NULL)
+              {
+                 root = @list_type;
+                 tail = root;
+              }
+            else
+              {
+                 tail.next = @list_type;
+                 tail = tail.next;
+              }
+            tail.text = buf;
+            tail.next = NULL;
+         }
+       () = fclose (fp);
+       return root;
+    }
+#v-
+\seealso{fgetslines, fopen, fclose, fputs, fread, error}
+\done
+
+\function{fgetslines}
+\synopsis{Read lines as an array from an open file}
+\usage{String_Type fgetslines (File_Type fp ,Int_Type num)}
+\description
+  The \ifun{fgetslines} function reads a specified number of
+  lines as an array of strings from the file associated with the
+  file pointer \exmp{fp}.  If the number of lines to be read is left
+  unspecified, the function will return the rest of the lines in the
+  file.  If the file is empty, an empty string array will be returned.
+  The function returns \NULL upon error.
+\example
+  The following function returns the number of lines in a file:
+#v+
+    define count_lines_in_file (file)
+    {
+       variable fp, lines;
+
+       fp = fopen (file, "r");
+       if (fp == NULL)
+         return -1;
+
+       lines = fgetslines (fp);
+       if (lines == NULL)
+         return -1;
+
+       return length (lines);
+    }
+#v-
+  Note that the file was implicitly closed when the variable \exmp{fp}
+  goes out of scope (in the case, when the function returns).
+\seealso{fgets, fread, fopen, fputslines}
+\done
+
+\function{fopen}
+\synopsis{Open a file}
+\usage{File_Type fopen (String_Type f, String_Type m)}
+\description
+  The \ifun{fopen} function opens a file \exmp{f} according to the mode
+  string \exmp{m}.  Allowed values for \exmp{m} are:
+#v+
+     "r"    Read only
+     "w"    Write only
+     "a"    Append
+     "r+"   Reading and writing at the beginning of the file.
+     "w+"   Reading and writing.  The file is created if it does not
+              exist; otherwise, it is truncated.
+     "a+"   Reading and writing at the end of the file.  The file is created
+              if it does not already exist.
+#v-
+  In addition, the mode string can also include the letter \exmp{'b'}
+  as the last character to indicate that the file is to be opened in
+  binary mode.
+
+  Upon success, \ifun{fopen} returns a \dtype{File_Type} object which is
+  meant to be used by other operations that require an open file
+  pointer.  Upon failure, the function returns \NULL.
+\example
+  The following function opens a file in append mode and writes a
+  string to it:
+#v+
+    define append_string_to_file (str, file)
+    {
+       variable fp = fopen (file, "a");
+       if (fp == NULL)
+         throw OpenError, "$file could not be opened"$;
+       () = fputs (str, fp);
+       () = fclose (fp);
+    }
+#v-
+  Note that the return values from \ifun{fputs} and \ifun{fclose} were
+  ignored.
+\notes
+  There is no need to explicitly close a file opened with \ifun{fopen}.
+  If the returned \dtype{File_Type} object goes out of scope, the
+  interpreter will automatically close the file.  However, explicitly
+  closing a file with \ifun{fclose} and checking its return value is
+  recommended.
+\seealso{fclose, fgets, fputs, popen}
+\done
+
+\function{fprintf}
+\synopsis{Create and write a formatted string to a file}
+\usage{Int_Type fprintf (File_Type fp, String_Type fmt, ...)}
+\description
+  \ifun{fprintf} formats the objects specified by the variable argument
+  list according to the format \exmp{fmt} and write the result to the
+  open file pointer \exmp{fp}.
+
+  The format string obeys the same syntax and semantics as the
+  \ifun{sprintf} format string.  See the description of the
+  \ifun{sprintf} function for more information.
+
+  \ifun{fprintf} returns the number of bytes written to the file,
+  or -1 upon error.
+\seealso{fputs, printf, fwrite, message}
+\done
+
+\function{fputs}
+\synopsis{Write a string to an open stream}
+\usage{Integer_Type fputs (String_Type s, File_Type fp)}
+\description
+  The \ifun{fputs} function writes the string \exmp{s} to the open file
+  pointer \exmp{fp}. It returns -1 upon failure and sets \ivar{errno},
+  otherwise it returns the length of the string.
+\example
+  The following function opens a file in append mode and uses the
+  \ifun{fputs} function to write to it.
+#v+
+    define append_string_to_file (str, file)
+    {
+       variable fp;
+       fp = fopen (file, "a");
+       if (fp == NULL)
+         throw OpenError, "Unable to open $file"$;
+       if ((-1 == fputs (str, fp))
+           || (-1 == fclose (fp)))
+         throw WriteError, "Error writing to $file"$;
+    }
+#v-
+\notes
+  One must not disregard the return value from the \ifun{fputs}
+  function.  Doing so may lead to a stack overflow error.
+
+  To write an object that contains embedded null characters, use the
+  \ifun{fwrite} function.
+\seealso{fclose, fopen, fgets, fwrite}
+\done
+
+\function{fputslines}
+\synopsis{Write an array of strings to an open file}
+\usage{Int_Type fputslines (String_Typea, File_Type fp)}
+\description
+  The \ifun{fputslines} function writes an array of strings to the
+  specified file pointer.  It returns the number of elements
+  successfully written.  Any \NULL elements in the array will be
+  skipped.
+\example
+#v+
+    if (length (lines) != fputslines (lines, fp))
+      throw WriteError;
+#v-
+\seealso{fputs, fgetslines, fopen}
+\done
+
+\function{fread}
+\synopsis{Read binary data from a file}
+\usage{UInt_Type fread (Ref_Type b, DataType_Type t, UInt_Type n, File_Type fp)}
+\description
+  The \ifun{fread} function may be used to read \exmp{n} objects of type
+  \exmp{t} from an open file pointer \exmp{fp}.  Upon success, it
+  returns the number of objects read from the file and places the
+  objects in variable specified by \exmp{b}.  Upon error or
+  end-of-file, it returns -1 and sets \ivar{errno} accordingly.
+
+  If more than one object is read from the file, those objects will be
+  placed in an array of the appropriate size.
+\example
+  The following example illustrates how to read 50 integers from a file:
+#v+
+     define read_50_ints_from_a_file (file)
+     {
+        variable fp, n, buf;
+
+        fp = fopen (file, "rb");
+        if (fp == NULL)
+          throw OpenError;
+        n = fread (&buf, Int_Type, 50, fp);
+        if (n == -1)
+          throw ReadError, "fread failed";
+        () = fclose (fp);
+        return buf;
+     }
+#v-
+\notes
+  Use the \ifun{pack} and \ifun{unpack} functions to read data with a
+  specific byte-ordering.
+
+  The \ifun{fread_bytes} function may be used to read a specified number of
+  bytes in the form of a binary string (\exmp{BString_Type}).
+
+  If an attempt is made to read at the end of a file, the function
+  will return -1.  To distinguish this condition from a system error,
+  the \ifun{feof} function should be used.  This distinction is
+  particularly important when reading from a socket or pipe.
+\seealso{fread_bytes, fwrite, fgets, feof, ferror, fopen, pack, unpack}
+\done
+
+\function{fread_bytes}
+\synopsis{Read bytes from a file as a binary-string}
+\usage{UInt_Type fread_bytes (Ref_Type b, UInt_Type n, File_Type fp)}
+\description
+  The \ifun{fread_bytes} function may be used to read \exmp{n} bytes
+  from from an open file pointer \exmp{fp}.  Upon success, it returns
+  the number of bytes read from the file and assigns to the variable
+  attached to the reference \exmp{b} a binary string formed from the
+  bytes read.  Upon error or end of file, the function returns
+  -1 and sets \ivar{errno} accordingly.
+\notes
+  Use the \ifun{pack} and \ifun{unpack} functions to read data with a
+  specific byte-ordering.
+\seealso{fread, fwrite, fgets, fopen, pack, unpack}
+\done
+
+\function{fseek}
+\synopsis{Reposition a stdio stream}
+\usage{Integer_Type fseek (File_Type fp, LLong_Type ofs, Integer_Type whence)}
+\description
+  The \ifun{fseek} function may be used to reposition the file position
+  pointer associated with the open file stream \exmp{fp}. Specifically,
+  it moves the pointer \exmp{ofs} bytes relative to the position
+  indicated by \exmp{whence}.  If \exmp{whence} is set to one of the symbolic
+  constants \icon{SEEK_SET}, \icon{SEEK_CUR}, or \icon{SEEK_END}, the
+  offset is relative to the start of the file, the current position
+  indicator, or end-of-file, respectively.
+
+  The function returns 0 upon success, or -1 upon failure and sets
+  \ivar{errno} accordingly.
+\example
+    define rewind (fp)
+    {
+       if (0 == fseek (fp, 0, SEEK_SET)) return;
+       vmessage ("rewind failed, reason: %s", errno_string (errno));
+    }
+\seealso{ftell, fopen}
+\done
+
+\function{ftell}
+\synopsis{Obtain the current position in an open stream}
+\usage{LLong_Type ftell (File_Type fp)}
+\description
+  The ftell function may be used to obtain the current position in the
+  stream associated with the open file pointer \exmp{fp}.  It returns
+  the position of the pointer measured in bytes from the beginning of
+  the file.  Upon error, it returns \exmp{-1} and sets \ivar{errno}
+  accordingly.
+\seealso{fseek, fopen}
+\done
+
+\function{fwrite}
+\synopsis{Write binary data to a file}
+\usage{UInt_Type fwrite (b, File_Type fp)}
+\description
+  The \ifun{fwrite} function may be used to write the object represented by
+  \exmp{b} to an open file.  If \exmp{b} is a string or an array, the
+  function will attempt to write all elements of the object to the
+  file.  It returns the number of elements successfully written,
+  otherwise it returns \-1 upon error and sets \ivar{errno}
+  accordingly.
+\example
+  The following example illustrates how to write an integer array to a
+  file.  In this example, \exmp{fp} is an open file descriptor:
+#v+
+     variable a = 1:50;     % 50 element integer array
+     if (50 != fwrite (a, fp))
+       throw WriteError;
+#v-
+  Here is how to write the array one element at a time:
+#v+
+     variable ai, a = 1:50;
+
+     foreach ai (a)
+       {
+          if (1 != fwrite(ai, fp))
+            throw WriteError;
+       }
+#v-
+\notes
+  Not all data types may be supported the \ifun{fwrite} function.  It
+  is supported by all vector, scalar, and string objects.
+\seealso{fread, fputs, fopen, pack, unpack}
+\done
+
+\function{pclose}
+\synopsis{Close a process pipe}
+\usage{Integer_Type pclose (File_Type fp)}
+\description
+  The \ifun{pclose} function waits for the process associated with
+  \exmp{fp} to exit and then returns the exit status of the command.
+\seealso{popen, fclose}
+\done
+
+\function{popen}
+\synopsis{Open a pipe to a process}
+\usage{File_Type popen (String_Type cmd, String_Type mode)}
+\description
+  The \ifun{popen} function executes a process specified by \exmp{cmd}
+  and opens a unidirectional pipe to the newly created process.  The
+  \exmp{mode} indicates whether or not the pipe is open for reading
+  or writing.  Specifically, if \exmp{mode} is \exmp{"r"}, then the
+  pipe is opened for reading, or if \exmp{mode} is \exmp{"w"}, then the
+  pipe will be open for writing.
+
+  Upon success, a \dtype{File_Type} pointer will be returned, otherwise
+  the function failed and \NULL will be returned.
+\notes
+  This function is not available on all systems.
+
+ The \module{process} module's \ifun{new_process} function provides a
+ much more secure and powerful interface to process I/O.
+\seealso{new_process, pclose, fopen}
+\done
+
+\function{printf}
+\synopsis{Create and write a formatted string to stdout}
+\usage{Int_Type printf (String_Type fmt, ...)}
+\description
+  \ifun{printf} formats the objects specified by the variable argument
+  list according to the format \exmp{fmt} and write the result to
+  \ivar{stdout}.  This function is equivalent to \exmp{fprintf} used
+  with the \ivar{stdout} file pointer.  See \exmp{fprintf} for more
+  information.
+
+  \exmp{printf} returns the number of bytes written or -1 upon error.
+\notes
+  Many C programmers do not check the return status of the
+  \exmp{printf} C library function.  Make sure that if you do not care
+  about whether or not the function succeeds, then code it as in the
+  following example:
+#v+
+     () = printf ("%s laid %d eggs\n", chicken_name, num_egg);
+#v-
+\seealso{fputs, fprintf, fwrite, message}
+\done
+
+
+\function{setvbuf}
+\synopsis{}
+\usage{Int_Type setvbuf (File_Type fp, Int_Type mode, Int_Type size)}
+\description
+  The \ifun{setvbuf} function may be used to control how the stdio
+  stream specified by the open \dtype{File_Type} object is buffered.
+
+  The \ifun{mode} argument must be one of the following values:
+#v+
+   _IONBF   : unbuffered
+   _IOFBF   : fully buffered
+   _IOLBF   : line buffered
+#v-
+  The \exmp{size} argument controls the size of the buffer.  If
+  \exmp{size} is 0, then the function will not change the size of the
+  buffer, only the mode.  Otherwise, \exmp{size} is expected to be
+  larger than 0 and a buffer of the requested size will be allocated
+  for the stream.
+  are buffered.
+\notes
+  This function must be used only after the stream has been opened and
+  before any other operations have been performed on the stream.
+\seealso{fopen, fclose, fflush}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/strops.tm Added

@@ -0,0 +1,1242 @@
+#d n \__newline__
+#d notearray_int_f_str2 \
+ This function has been vectorized in the sense that if an array of strings\n\
+ is passed for either of the string-valued arguments, then a\n\
+ corresponding array of integers will be returned. If two arrays\n\
+ are passed then the arrays must have the same length.
+#d notearray_int_f_str \
+ This function has been vectorized in the sense that if an array of strings\n\
+ is passed to the function, then a corresponding array of integers\n\
+ will be returned.
+#d notearray_str_f_str \
+ This function has been vectorized in the sense that if an array of strings\n\
+ is passed to the function, then a corresponding array of strings\n\
+ will be returned.
+#d notearray_str_f_str_arg1 \
+ This function has been vectorized in the sense that if an array of strings\n\
+ is passed as the first argument then a corresponding array of strings\n\
+ will be returned. Array values are not supported for the remaining\n\
+ arguments.
+#d notearray_strtrim \
+ This function has been vectorized in the sense that if the first argument\n\
+ is an array of strings, then a corresponding array of strings\n\
+ will be returned. An array value for the optional whitespace\n\
+ argument is not supported.
+
+\function{count_char_occurrences}
+\synopsis{Count the number of occurrences of a character in a string}
+\usage{UInt_Type count_char_occurrences (str, ch)}
+\description
+ This function returns the number of times the specified character
+ \exmp{ch} occurs in the string \exmp{str}.
+\notes
+ If UTF-8 mode is in effect, then the character may correspond to
+ more than one byte. In such a case, the function returns the number
+ of such byte-sequences in the string. To count actual bytes, use
+ the \ifun{count_byte_occurrences} function.
+\seealso{count_byte_occurrences}
+\done
+
+\function{create_delimited_string}
+\synopsis{Concatenate strings using a delimiter}
+\usage{String_Type create_delimited_string (delim, s_1, s_2, ..., s_n, n)}
+#v+
+ String_Type delim, s_1, ..., s_n
+ Int_Type n
+#v-
+\description
+ \ifun{create_delimited_string} performs a concatenation operation on
+ the \exmp{n} strings \exmp{s_1}, ...,\exmp{s_n}, using the string
+ \exmp{delim} as a delimiter. The resulting string is equivalent to
+ one obtained via
+#v+
+ s_1 + delim + s_2 + delim + ... + s_n
+#v-
+\example
+#v+
+ create_delimited_string ("/", "user", "local", "bin", 3);
+#v-
+ will produce \exmp{"usr/local/bin"}.
+\notes
+ New code should use the \exmp{strjoin} function, which performs a
+ similar task.
+\seealso{strjoin, is_list_element, extract_element, strchop, strcat}
+\done
+
+\function{extract_element}
+\synopsis{Extract the nth element of a string with delimiters}
+\usage{String_Type extract_element (String_Type list, Int_Type nth, Int_Type delim)}
+\description
+ The \ifun{extract_element} function may be used to extract the
+ \exmp{nth} substring of a string delimited by the character given by
+ the \exmp{delim} parameter. If the string contains fewer than the
+ requested substring, the function will return \NULL. Substring
+ elements are numbered from 0.
+\example
+ The expression
+#v+
+ extract_element ("element 0, element 1, element 2", 1, ',')
+#v-
+ returns the string \exmp{" element 1"}, whereas
+#v+
+ extract_element ("element 0, element 1, element 2", 1, ' ')
+#v-
+ returns \exmp{"0,"}.
+
+ The following function may be used to compute the number of elements
+ in the list:
+#v+
+ define num_elements (list, delim)
+ {
+ variable nth = 0;
+ while (NULL != extract_element (list, nth, delim))
+ nth++;
+ return nth;
+ }
+#v-
+ Alternatively, the \ifun{strchop} function may be more useful. In
+ fact, \ifun{extract_element} may be expressed in terms of the
+ function \ifun{strchop} as
+#v+
+ define extract_element (list, nth, delim)
+ {
+ list = strchop(list, delim, 0);
+ if (nth >= length (list))
+ return NULL;
+ else
+ return listnth;
+ }
+#v-
+ and the \exmp{num_elements} function used above may be recoded more
+ simply as:
+#v+
+ define num_elements (list, delim)
+ {
+ return length (strchop (length, delim, 0));
+ }
+#v-
+\notes
+ New code should make use of the \exmp{List_Type} object for lists.
+\seealso{is_list_element, is_substr, strtok, strchop, create_delimited_string}
+\done
+
+\function{glob_to_regexp}
+\synopsis{Convert a globbing expression to a regular expression}
+\usage{String_Type glob_to_regexp (String_Type g)}
+\description
+ This function may be used to convert a so-called globbing expression
+ to a regular expression. A globbing expression is frequently used
+ for matching filenames where '?' represents a single character and
+ '*' represents 0 or more characters.
+\notes
+ The \slsh program that is distributed with the \slang library
+ includes a function called \sfun{glob} that is a wrapper around
+ \ifun{glob_to_regexp} and \ifun{listdir}. It returns a list of
+ filenames matching a globbing expression.
+\seealso{string_match, listdir}
+\done
+
+\function{is_list_element}
+\synopsis{Test whether a delimited string contains a specific element}
+\usage{Int_Type is_list_element (String_Type list, String_Type elem, Int_Type delim)}
+\description
+ The \ifun{is_list_element} function may be used to determine whether
+ or not a delimited list of substring, \exmp{list}, contains the element
+ \exmp{elem}. If \exmp{elem} is not an element of \exmp{list}, the function
+ will return zero, otherwise, it returns 1 plus the matching element
+ number.
+\example
+ The expression
+#v+
+ is_list_element ("element 0, element 1, element 2", "0,", ' ');
+#v-
+ returns \exmp{2} since \exmp{"0,"} is element number one of the list
+ (numbered from zero).
+\seealso{extract_element, is_substr, create_delimited_string}
+\done
+
+\function{is_substr}
+\synopsis{Test for a specified substring within a string}
+\usage{Int_Type is_substr (String_Type a, String_Type b)}
+\description
+ This function may be used to determine if \exmp{a} contains the
+ string \exmp{b}. If it does not, the function returns 0; otherwise it
+ returns the position of the first occurrence of \exmp{b} in \exmp{a}
+ expressed in terms of characters, not bytes.
+\notes
+ This function regards the first character of a string to be given by
+ a position value of 1.
+
+ The distinction between characters and bytes is significant in UTF-8
+ mode.
+
+ \notearray_int_f_str2
+\seealso{substr, string_match, strreplace}
+\done
+
+\function{make_printable_string}
+\synopsis{Format a string suitable for parsing}
+\usage{String_Type make_printable_string(String_Type str)}
+\description
+ This function formats a string in such a way that it may be used as
+ an argument to the \ifun{eval} function. The resulting string is
+ identical to \exmp{str} except that it is enclosed in double quotes
+ and the backslash, newline, control, and double quote characters are
+ expanded.
+\seealso{eval, str_quote_string}
+\done
+
+\function{Sprintf}
+\synopsis{Format objects into a string (deprecated)}
+\usage{String_Type Sprintf (String_Type format, ..., Int_Type n)}
+\description
+ This function performs a similar task as the \exmp{sprintf}
+ function but requires an additional argument that specifies the
+ number of items to format. For this reason, the \exmp{sprintf}
+ function should be used.
+\seealso{sprintf, string, sscanf, vmessage}
+\done
+
+\function{strbskipchar}
+\synopsis{Get an index to the previous character in a UTF-8 encoded string}
+\usage{(p1, wch) = strbskipchar (str, p0 ,skip_combining)}
+\description
+ This function moves backward from the 0-based byte-offset \exmp{p0}
+ in the string \exmp{str} to the previous character in the string.
+ It returns the byte-offset (\exmp{p1} of the previous character and
+ the decoded character value at that byte-offset.
+
+ The optional third argument specifies the handling of
+ combining characters. If it is non-zero, combining characters will
+ be ignored, otherwise a combining character will not be treated
+ differently from other characters. The default is to ignore such
+ characters.
+
+ If the byte-offset \exmp{p0} corresponds to the end of the string
+ (\exmp{p0=0}), then \exmp{(p0,0)} will be returned. Otherwise if
+ the byte-offset specifies a value that lies outside the string, an
+ \exc{IndexError} exception will be thrown. Finally, if the
+ byte-offset corresponds to an illegally coded character, the
+ character returned will be the negative byte-value at the position.
+\seealso{strskipchar, strskipbytes}
+\done
+
+\function{sprintf}
+\synopsis{Format objects into a string}
+\usage{String_Type sprintf (String fmt, ...)}
+\description
+ The \ifun{sprintf} function formats a string from a variable number
+ of arguments according to according to the format specification
+ string \exmp{fmt}.
+
+ The format string is a C library \cfun{sprintf} style format
+ descriptor. Briefly, the format string may consist of ordinary
+ characters (not including the \exmp{%} character), which are copied
+ into the output string as-is, and conversion specification sequences
+ introduced by the \exmp{%} character. The number of additional
+ arguments passed to the \ifun{sprintf} function must be consistent
+ with the number required by the format string.
+
+ The \exmp{%} character in the format string starts a conversion
+ specification that indicates how an object is to be formatted.
+ Usually the percent character is followed immediately by a
+ conversion specification character. However, it may optionally be
+ followed by flag characters, field width characters, and precision
+ modifiers, as described below.
+
+ The character immediately following the \exmp{%} character may be
+ one or more of the following flag characters:
+#v+
+ - Use left-justification
+ # Use alternate form for formatting.
+ 0 Use 0 padding
+ + Precede a number by a plus or minus sign.
+ (space) Use a blank instead of a plus sign.
+#v-
+
+ The flag characters (if any) may be followed by an optional field
+ width specification string represented by one or more digit
+ characters. If the size of the formatted object is less than the
+ field width, it will be right-justified in the specified field
+ width, unless the \exmp{-} flag was given, in which case it will be
+ left justified.
+
+ If the next character in the control sequence is a period, then it
+ introduces a precision specification sequence. The precision is
+ given by the digit characters following the period. If none are
+ given the precision is taken to be 0. The meaning of the precision
+ specifier depends upon the type of conversion: For integer
+ conversions, it gives the minimum number digits to appear in the
+ output. For \exmp{e} and \exmp{f} floating point conversions, it
+ gives the number of digits to appear after the decimal point. For
+ the \exmp{g} floating point conversion, it gives the maximum number
+ of significant digits to appear. Finally for the \exmp{s} and
+ \exmp{S} conversions it specifies the maximum number of characters
+ to be copied to the output string.
+
+ The next character in the sequence may be a modifier that controls
+ the size of object to be formatted. It may consist of the following
+ characters:
+#v+
+ h This character is ignored in the current implementation.
+ l The integer is be formatted as a long integer, or a
+ character as a wide character.
+#v-
+
+ Finally the conversion specification sequence ends with the
+ conversion specification character that describes how the object is
+ to be
+ formatted:
+#v+
+ s as a string
+ f as a floating point number
+ e as a float using exponential form, e.g., 2.345e08
+ g format as e or f, depending upon its value
+ c as a character
+ b as a byte
+ % a literal percent character
+ d as a signed decimal integer
+ u as an unsigned decimal integer
+ o as an octal integer
+ X,x as hexadecimal
+ B as a binary integer
+ S convert object to a string and format accordingly
+#v-
+ The \exmp{S} conversion specifier is a \slang extension which will
+ cause the corresponding object to be converted to a string using the
+ \ifun{string} function, and then converted as \exmp{s}. formatted as
+ string. In fact, \exmp{sprintf("%S",x)} is equivalent to
+ \exmp{sprintf("%s",string(x))}.
+\example
+#v+
+ sprintf("%s","hello") ===> "hello"
+ sprintf("%s %s","hello", "world") ===> "hello world"
+ sprintf("Agent %.3d",7) ===> "Agent 007"
+ sprintf("%S",PI) ===> "3.141592653589793"
+ sprintf("%g",PI) ===> "3.14159"
+ sprintf("%.2g",PI) ===> "3.1"
+ sprintf("%.2e",PI) ===> "3.14e+00"
+ sprintf("%.2f",PI) ===> "3.14"
+ sprintf("|% 8.2f|",PI) ===> "| 3.14|"
+ sprintf("|%-8.2f|",PI) ===> "|3.14 |"
+ sprintf("|%+8.2f|",PI) ===> "| +3.14|"
+ sprintf("|%8B|", 21) ===> "| 10101|"
+ sprintf("|%.8B|", 21) ===> "|00010101|"
+ sprintf("|%#.8B|", 21) ===> "|0b00010101|"
+ sprintf("%S",{1,2,3}) ===> "List_Type with 3 elements"
+ sprintf("%S",1+2i) ===> "(1 + 2i)"
+#v-
+\notes
+ The \ifun{set_float_format} function controls the format for the
+ \exmp{S} conversion of floating point numbers.
+\seealso{string, sscanf, message, pack, set_float_format}
+\done
+
+\function{sscanf}
+\synopsis{Parse a formatted string}
+\usage{Int_Type sscanf (s, fmt, r1, ... rN)}
+#v+
+ String_Type s, fmt;
+ Ref_Type r1, ..., rN
+#v-
+\description
+ The \ifun{sscanf} function parses the string \exmp{s} according to the
+ format \exmp{fmt} and sets the variables whose references are given by
+ \exmp{r1}, ..., \exmp{rN}. The function returns the number of
+ references assigned, or throws an exception upon error.
+
+ The format string \exmp{fmt} consists of ordinary characters and
+ conversion specifiers. A conversion specifier begins with the
+ special character \exmp{%} and is described more fully below. A white
+ space character in the format string matches any amount of whitespace
+ in the input string. Parsing of the format string stops whenever a
+ match fails.
+
+ The \exmp{%} character is used to denote a conversion specifier whose
+ general form is given by \exmp{%*widthtypeformat} where the
+ brackets indicate optional items. If \exmp{*} is present, then the
+ conversion will be performed but no assignment to a reference will be
+ made. The \exmp{width} specifier specifies the maximum field width to
+ use for the conversion. The \exmp{type} modifier is used to indicate
+ the size of the object, e.g., a short integer, as follows.
+
+ If \em{type} is given as the character \exmp{h}, then if the format
+ conversion is for an integer (\exmp{dioux}), the object assigned will
+ be a short integer. If \em{type} is \exmp{l}, then the conversion
+ will be to a long integer for integer conversions, or to a double
+ precision floating point number for floating point conversions.
+
+ The format specifier is a character that specifies the conversion:
+#v+
+ % Matches a literal percent character. No assignment is
+ performed.
+ d Matches a signed decimal integer.
+ D Matches a long decimal integer (equiv to `ld')
+ u Matches an unsigned decimal integer
+ U Matches an unsigned long decimal integer (equiv to `lu')
+ i Matches either a hexadecimal integer, decimal integer, or
+ octal integer.
+ I Equivalent to `li'.
+ o Matches an unsigned octal integer.
+ O Matches an unsigned long octal integer.
+ x Matches an unsigned hexadecimal integer.
+ X Matches a long unsigned hexadecimal integer (same as `lx').
+ e,f,g Matches a decimal floating point number (Float_Type).
+ E,F,G Matches a double precision floating point number, same as `lf'.
+ s Matches a string of non-whitespace characters (String_Type).
+ c Matches one character. If width is given, width
+ characters are matched.
+ n Assigns the number of characters scanned so far.
+ ... Matches zero or more characters from the set of characters
+ enclosed by the square brackets. If '^' is given as the
+ first character, then the complement set is matched.
+#v-
+\example
+ Suppose that \exmp{s} is \exmp{"Coffee: (3,4,12.4)"}. Then
+#v+
+ n = sscanf (s, "%a-zA-Z: (%d,%d,%lf)", &item, &x, &y, &z);
+#v-
+ will set \exmp{n} to \4, \exmp{item} to \exmp{"Coffee"}, \exmp{x} to \3,
+ \exmp{y} to \4, and \exmp{z} to the double precision number
+ \exmp{12.4}. However,
+#v+
+ n = sscanf (s, "%s: (%d,%d,%lf)", &item, &x, &y, &z);
+#v-
+ will set \exmp{n} to \1, \exmp{item} to \exmp{"Coffee:"} and the
+ remaining variables will not be assigned.
+\seealso{sprintf, unpack, string, atof, int, integer, string_matches}
+\done
+
+\function{strbytelen}
+\synopsis{Get the number of bytes in a string}
+\usage{Int_Type strbytelen (String_Type s)}
+\description
+ This function returns the number of bytes in a string. In UTF-8
+ mode, this value is generally different from the number of
+ characters in a string. For the latter information, the
+ \ifun{strlen} or \ifun{strcharlen} functions should be used.
+\notes
+ \notearray_int_f_str
+\seealso{strlen, strcharlen, length}
+\done
+
+\function{strbytesub}
+\synopsis{Replace a byte with another in a string.}
+\usage{String_Type strsub (String_Type s, Int_Type pos, UChar_Type b)}
+\description
+ The \ifun{strbytesub} function may be be used to substitute the byte
+ \exmp{b} for the byte at byte position \exmp{pos} of the string
+ \exmp{s}. The resulting string is returned.
+\notes
+ The first byte in the string \exmp{s} is specified by \exmp{pos}
+ equal to 1. This function uses byte semantics, not character
+ semantics.
+\seealso{strsub, is_substr, strreplace, strbytelen}
+\done
+
+\function{strcat}
+\synopsis{Concatenate strings}
+\usage{String_Type strcat (String_Type a_1, ..., String_Type a_N)}
+\description
+ The \ifun{strcat} function concatenates its N string
+ arguments \exmp{a_1}, ... \exmp{a_N} together and returns the result.
+\example
+#v+
+ strcat ("Hello", " ", "World");
+#v-
+ produces the string \exmp{"Hello World"}.
+\notes
+ This function is equivalent to the binary operation \exmp{a_1+...+a_N}.
+ However, \ifun{strcat} is much faster making it the preferred method
+ to concatenate strings.
+\seealso{sprintf, strjoin}
+\done
+
+\function{strcharlen}
+\synopsis{Get the number of characters in a string including combining characters}
+\usage{Int_Type strcharlen (String_Type s)}
+\description
+ The \ifun{strcharlen} function returns the number of characters in a
+ string. If the string contains combining characters, then they are
+ also counted. Use the \ifun{strlen} function to obtain the
+ character count ignoring combining characters.
+\notes
+ \notearray_int_f_str
+\seealso{strlen, strbytelen}
+\done
+
+\function{strchop}
+\synopsis{Chop or split a string into substrings.}
+\usage{String_Type strchop (String_Type str, Int_Type delim, Int_Type quote)}
+\description
+ The \ifun{strchop} function may be used to split-up a string
+ \exmp{str} that consists of substrings delimited by the character
+ specified by \exmp{delim}. If the integer \exmp{quote} is non-zero,
+ it will be taken as a quote character for the delimiter. The
+ function returns the substrings as an array.
+\example
+ The following function illustrates how to sort a comma separated
+ list of strings:
+#v+
+ define sort_string_list (a)
+ {
+ variable i, b, c;
+ b = strchop (a, ',', 0);
+
+ i = array_sort (b);
+ b = bi; % rearrange
+
+ % Convert array back into comma separated form
+ return strjoin (b, ",");
+ }
+#v-
+\seealso{strchopr, strjoin, strtok}
+\done
+
+\function{strchopr}
+\synopsis{Chop or split a string into substrings.}
+\usage{String_Type strchopr (String_Type str, String_Type delim, String_Type quote)}
+\description
+ This routine performs exactly the same function as \ifun{strchop} except
+ that it returns the substrings in the reverse order. See the
+ documentation for \ifun{strchop} for more information.
+\seealso{strchop, strtok, strjoin}
+\done
+
+\function{strcmp}
+\synopsis{Compare two strings}
+\usage{Int_Type strcmp (String_Type a, String_Type b)}
+\description
+ The \ifun{strcmp} function may be used to perform a case-sensitive
+ string comparison, in the lexicographic sense, on strings \exmp{a}
+ and \exmp{b}. It returns 0 if the strings are identical, a negative
+ integer if \exmp{a} is less than \exmp{b}, or a positive integer if
+ \exmp{a} is greater than \exmp{b}.
+\example
+ The \ifun{strup} function may be used to perform a case-insensitive
+ string comparison:
+#v+
+ define case_insensitive_strcmp (a, b)
+ {
+ return strcmp (strup(a), strup(b));
+ }
+#v-
+\notes
+ One may also use one of the binary comparison operators, e.g.,
+ \exmp{a > b}.
+
+ \notearray_int_f_str
+\seealso{strup, strncmp}
+\done
+
+\function{strcompress}
+\synopsis{Remove excess whitespace characters from a string}
+\usage{String_Type strcompress (String_Type s, String_Type white)}
+\description
+ The \ifun{strcompress} function compresses the string \exmp{s} by
+ replacing a sequence of one or more characters from the set
+ \exmp{white} by the first character of \exmp{white}. In addition, it
+ also removes all leading and trailing characters from \exmp{s} that
+ are part of \exmp{white}.
+\example
+ The expression
+#v+
+ strcompress (",;apple,,cherry;,banana", ",;");
+#v-
+ returns the string \exmp{"apple,cherry,banana"}.
+\notes
+ \notearray_str_f_str_arg1
+\seealso{strtrim, strtrans, str_delete_chars}
+\done
+
+\function{string_match}
+\synopsis{Match a string against a regular expression}
+\usage{Int_Type string_match(String_Type str, String_Type pat ,Int_Type pos)}
+\description
+ The \ifun{string_match} function returns zero if \exmp{str} does not
+ match the regular expression specified by \exmp{pat}. This function
+ performs the match starting at the first byte of the string. The
+ optional \exmp{pos} argument may be used to specify a different byte
+ offset (numbered from 1). This function returns the position in
+ bytes (numbered from 1) of the start of the match in \exmp{str}.
+ The exact substring matched may be found using
+ \ifun{string_match_nth}.
+\notes
+ Positions in the string are specified using byte-offsets not
+ character offsets. The value returned by this function is measured
+ from the beginning of the string \exmp{str}.
+
+ The function is not yet UTF-8 aware. If possible, consider using
+ the \module{pcre} module for better, more sophisticated regular
+ expressions.
+
+ The \exmp{pos} argument was made optional in version 2.2.3.
+\seealso{string_matches, string_match_nth, strcmp, strncmp}
+\done
+
+\function{string_match_nth}
+\synopsis{Get the result of the last call to string_match}
+\usage{(Int_Type pos, Int_Type len) = string_match_nth(Int_Type nth)}
+\description
+ The \ifun{string_match_nth} function returns two integers describing
+ the result of the last call to \ifun{string_match}. It returns both
+ the zero-based byte-position of the \exmp{nth} submatch and
+ the length of the match.
+
+ By convention, \exmp{nth} equal to zero means the entire match.
+ Otherwise, \exmp{nth} must be an integer with a value 1 through 9,
+ and refers to the set of characters matched by the \exmp{nth} regular
+ expression enclosed by the pairs \exmp{\$, \$}.
+\example
+ Consider:
+#v+
+ variable matched, pos, len;
+ matched = string_match("hello world", "$a-z+$ $a-z+$"R, 1);
+ if (matched)
+ (pos, len) = string_match_nth(2);
+#v-
+ This will set \exmp{matched} to 1 since a match will be found at the
+ first byte position, \exmp{pos} to 6 since \exmp{w} is offset 6 bytes
+ from the beginning of the string, and \exmp{len} to 5 since
+ \exmp{"world"} is 5 bytes long.
+\notes
+ The position offset is \em{not} affected by the value of the offset
+ parameter to the \ifun{string_match} function. For example, if the
+ value of the last parameter to the \ifun{string_match} function had
+ been 3, \exmp{pos} would still have been set to 6.
+
+ The \sfun{string_matches} function may be used as an alternative to
+ \sfun{string_match_nth}.
+\seealso{string_match, string_matches}
+\done
+
+\function{string_matches}
+\synopsis{Match a string against a regular expression and return the matches}
+\usage{String_Type string_matches(String_Type str, String_Type pat ,Int_Type pos)}
+\description
+ The \ifun{string_matches} function combines the functionality of
+ \ifun{string_match} and \ifun{string_match_nth}. Like
+ \ifun{string_match}, it matches the string \exmp{str} against
+ the regular expression \exmp{pat}. If the string does not match the
+ pattern the function will return \NULL. Otherwise, the function
+ will return an array of strings whose \exmp{ith} element is the string that
+ corresponds to the return value of the \ifun{string_match_nth}
+ function.
+\example
+#v+
+ strs = string_matches ("p0.5keV_27deg.dat",
+ "p$0-9.+$keV_$0-9.+$deg\.dat"R, 1);
+ % ==> strs0 = "p0.5keV_27deg.dat"
+ % strs1 = "0.5"
+ % strs2 = "27"
+
+ strs = string_matches ("q0.5keV_27deg.dat",
+ "p$0-9.+$keV_$0-9.+$deg\.dat"R);
+ % ==> strs = NULL
+#v-
+\notes
+ The function is not yet UTF-8 aware. If possible, consider using
+ the \module{pcre} module for better, more sophisticated regular
+ expressions.
+
+ The \exmp{pos} argument was made optional in version 2.2.3.
+\seealso{string_match, string_match_nth, strcmp, strncmp}
+\done
+
+\function{strjoin}
+\synopsis{Concatenate elements of a string array}
+\usage{String_Type strjoin (Array_Type a , String_Type delim)}
+\description
+ The \ifun{strjoin} function operates on an array of strings by joining
+ successive elements together separated with the optional delimiter
+ \exmp{delim}. If \exmp{delim} is not specified, then empty string
+ \exmp{""} will be used resulting in a concatenation of the elements.
+\example
+ Suppose that
+#v+
+ days = "Sun","Mon","Tue","Wed","Thu","Fri","Sat","Sun";
+#v-
+ Then \exmp{strjoin (days,"+")} will produce
+ \exmp{"Sun+Mon+Tue+Wed+Thu+Fri+Sat+Sun"}. Similarly,
+ \exmp{strjoin ("","","", "X")} will produce \exmp{"XX"}.
+\seealso{strchop, strcat}
+\done
+
+\function{strlen}
+\synopsis{Compute the length of a string}
+\usage{Int_Type strlen (String_Type a)}
+\description
+ The \ifun{strlen} function may be used to compute the character
+ length of a string ignoring the presence of combining characters.
+ The \ifun{strcharlen} function may be used to count combining
+ characters as distinct characters. For byte-semantics, use the
+ \ifun{strbytelen} function.
+\example
+ After execution of
+#v+
+ variable len = strlen ("hello");
+#v-
+ \exmp{len} will have a value of \exmp{5}.
+\notes
+ \notearray_int_f_str
+\seealso{strbytelen, strcharlen, bstrlen, length, substr}
+\done
+
+\function{strlow}
+\synopsis{Convert a string to lowercase}
+\usage{String_Type strlow (String_Type s)}
+\description
+ The \ifun{strlow} function takes a string \exmp{s} and returns another
+ string identical to \exmp{s} except that all upper case characters
+ that are contained in \exmp{s} are converted converted to lower case.
+\example
+ The function
+#v+
+ define Strcmp (a, b)
+ {
+ return strcmp (strlow (a), strlow (b));
+ }
+#v-
+ performs a case-insensitive comparison operation of two strings by
+ converting them to lower case first.
+\notes
+ \notearray_str_f_str
+\seealso{strup, tolower, strcmp, strtrim, define_case}
+\done
+
+\function{strnbytecmp}
+\synopsis{Compare the first n bytes of two strings}
+\usage{Int_Type strnbytecmp (String_Type a, String_Type b, Int_Type n)}
+\description
+ This function compares the first \exmp{n} bytes of the strings
+ \exmp{a} and \exmp{b}. See the documentation for \ifun{strcmp} for
+ information about the return value.
+\notes
+ \notearray_int_f_str2
+\seealso{strncmp, strncharcmp, strcmp}
+\done
+
+\function{strncharcmp}
+\synopsis{Compare the first n characters of two strings}
+\usage{Int_Type strncharcmp (String_Type a, String_Type b, Int_Type n)}
+\description
+ This function compares the first \exmp{n} characters of the strings
+ \exmp{a} and \exmp{b} counting combining characters as distinct
+ characters. See the documentation for \ifun{strcmp} for information
+ about the return value.
+\notes
+ \notearray_int_f_str2
+\seealso{strncmp, strnbytecmp, strcmp}
+\done
+
+\function{strncmp}
+\synopsis{Compare the first few characters of two strings}
+\usage{Int_Type strncmp (String_Type a, String_Type b, Int_Type n)}
+\description
+ This function behaves like \ifun{strcmp} except that it compares only the
+ first \exmp{n} characters in the strings \exmp{a} and \exmp{b}.
+ See the documentation for \ifun{strcmp} for information about the return
+ value.
+
+ In counting characters, combining characters are not counted,
+ although they are used in the comparison. Use the
+ \ifun{strncharcmp} function if you want combining characters to be
+ included in the character count. The \ifun{strnbytecmp} function
+ should be used to compare bytes.
+\example
+ The expression
+#v+
+ strncmp ("apple", "appliance", 3);
+#v-
+ will return zero since the first three characters match.
+\notes
+ This function uses character semantics.
+
+ \notearray_int_f_str2
+\seealso{strcmp, strlen, strncharcmp, strnbytecmp}
+\done
+
+\function{strreplace}
+\synopsis{Replace one or more substrings}
+\usage{(new,n) = strreplace(a, b, c, max_n)}
+\altusage{new = strreplace(a, b, c)}
+\description
+ The \ifun{strreplace} function may be used to replace one or more
+ occurrences of \exmp{b} in \exmp{a} with \exmp{c}. This function
+ supports two calling interfaces.
+
+ The first form may be used to replace a specified number of
+ substrings. If \exmp{max_n} is positive, then the first
+ \exmp{max_n} occurrences of \exmp{b} in \exmp{a} will be replaced.
+ Otherwise, if \exmp{max_n} is negative, then the last
+ \exmp{abs(max_n)} occurrences will be replaced. The function returns
+ the resulting string and an integer indicating how many replacements
+ were made.
+
+ The second calling form may be used to replace all occurrences of
+ \exmp{b} in \exmp{a} with \exmp{c}. In this case, only the
+ resulting string will be returned.
+
+\example
+ The following function illustrates how \ifun{strreplace} may be used
+ to remove all occurrences of a specified substring:
+#v+
+ define delete_substrings (a, b)
+ {
+ return strreplace (a, b, "");
+ }
+#v-
+\seealso{is_substr, strsub, strtrim, strtrans, str_delete_chars}
+\done
+
+\function{strskipbytes}
+\synopsis{Skip a range of bytes in a byte string}
+\usage{Int_Type strskipbytes (str, range n0 ,nmax)}
+#v+
+ String_Type s;
+ String_Type range;
+ Int_Type n0, nmax;
+#v-
+\description
+ This function skips over a range of bytes in a string \exmp{str}.
+ The byte range to be skipped is specified by the \exmp{range}
+ parameter. Optional start (\exmp{n0}) and stop (\exmp{nmax})
+ (0-based) parameters may be used to specify the part of the input
+ string to be processed. The function returns a 0-based offset from
+ the beginning of the string where processing stopped.
+
+ See the documentation for the \ifun{strtrans} function for the
+ format of the range parameter.
+\seealso{strskipchar, strbskipchar, strtrans}
+\done
+
+\function{strskipchar}
+\synopsis{Get an index to the next character in a UTF-8 encoded string}
+\usage{(p1, wch) = strskipchar (str, p0 ,skip_combining)}
+\description
+ This function decodes the character at the 0-based byte-offset \exmp{p0} in
+ the string \exmp{str}. It returns the byte-offset (\exmp{p1} of the next
+ character in the string and the decoded character at byte-offset
+ \exmp{p0}.
+
+ The optional third argument specifies the handling of
+ combining characters. If it is non-zero, combining characters will
+ be ignored, otherwise a combining character will not be treated
+ differently from other characters. The default is to ignore such
+ characters.
+
+ If the byte-offset \exmp{p0} corresponds to the end of the string,
+ then \exmp{(p0,0)} will be returned. Otherwise if the byte-offset
+ specifies a value that lies outside the string, an \exc{IndexError}
+ exception will be thrown. Finally, if the byte-offset corresponds
+ to an illegally coded character, the character returned will be the
+ negative byte-value at the position.
+\example
+ The following is an example of a function that skips alphanumeric
+ characters and returns the new byte-offset.
+#v+
+ private define skip_word_chars (line, p)
+ {
+ variable p1 = p, ch;
+ do
+ {
+ p = p1;
+ (p1, ch) = strskipchar (line, p, 1);
+ }
+ while (isalnum(ch));
+ return p;
+ }
+#v-
+\notes
+ In non-UTF-8 mode (\exmp{_slang_utf8_ok=0}), this function is
+ equivalent to:
+#v+
+ define strskipchar (s, p)
+ {
+ if ((p < 0) || (p > strlen(s)))
+ throw IndexError;
+ if (p == strlen(s))
+ return (p, sp)
+ return (p+1, sp);
+ }
+#v-
+ It is important to understand that the above code relies upon
+ byte-semantics, which are invalid for multi-byte characters.
+\seealso{strbskipchar, strskipbytes}
+\done
+
+\function{strsub}
+\synopsis{Replace a character with another in a string.}
+\usage{String_Type strsub (String_Type s, Int_Type pos, Int_Type ch)}
+\description
+ The \ifun{strsub} function may be used to substitute the character
+ \exmp{ch} for the character at character position \exmp{pos} of the string
+ \exmp{s}. The resulting string is returned.
+\example
+#v+
+ define replace_spaces_with_comma (s)
+ {
+ variable n;
+ while (n = is_substr (s, " "), n) s = strsub (s, n, ',');
+ return s;
+ }
+#v-
+ For uses such as this, the \ifun{strtrans} function is a better choice.
+\notes
+ The first character in the string \exmp{s} is specified by \exmp{pos}
+ equal to 1. This function uses character semantics, not byte
+ semantics.
+\seealso{is_substr, strreplace, strlen}
+\done
+
+\function{strtok}
+\synopsis{Extract tokens from a string}
+\usage{String_Type strtok (String_Type str ,String_Type white)}
+\description
+ \ifun{strtok} breaks the string \exmp{str} into a series of tokens
+ and returns them as an array of strings. If the second parameter
+ \exmp{white} is present, then it specifies the set of characters
+ that are to be regarded as whitespace when extracting the tokens,
+ and may consist of the whitespace characters or a range of such
+ characters. If the first character of \exmp{white} is \exmp{'^'},
+ then the whitespace characters consist of all characters except
+ those in \exmp{white}. For example, if \exmp{white} is \exmp{"
+ \\t\\n,;."}, then those characters specify the whitespace
+ characters. However, if \exmp{white} is given by
+ \exmp{"^a-zA-Z0-9_"}, then any character is a whitespace character
+ except those in the ranges \exmp{a-z}, \exmp{A-Z}, \exmp{0-9}, and
+ the underscore character. To specify the hyphen character as a
+ whitespace character, then it should be the first character of the
+ whitespace string. In addition to ranges, the whitespace specifier
+ may also include character classes:
+#v+
+ \w matches a unicode "word" character, taken to be alphanumeric.
+ \a alphabetic character, excluding digits
+ \s matches whitespace
+ \l matches lowercase
+ \u matches uppercase
+ \d matches a digit
+ \\ matches a backslash
+ \^ matches a ^ character
+#v-
+
+ If the second parameter is not present, then it defaults to
+ \exmp{"\\s"}.
+\example
+ The following example may be used to count the words in a text file:
+#v+
+ define count_words (file)
+ {
+ variable fp, line, count;
+
+ fp = fopen (file, "r");
+ if (fp == NULL) return -1;
+
+ count = 0;
+ while (-1 != fgets (&line, fp))
+ {
+ line = strtok (line, "^\\a");
+ count += length (line);
+ }
+ () = fclose (fp);
+ return count;
+ }
+#v-
+ Here a word was assumed to consist only of alphabetic characters.
+\seealso{strchop, strcompress, strjoin}
+\done
+
+\function{strtrans}
+\synopsis{Replace characters in a string}
+\usage{String_Type strtrans (str, old_set, new_set)}
+#v+
+ String_Type str, old_set, new_set;
+#v-
+\description
+ The \ifun{strtrans} function may be used to replace all the characters
+ from the set \exmp{old_set} with the corresponding characters from
+ \exmp{new_set} in the string \exmp{str}. If \exmp{new_set} is empty,
+ then the characters in \exmp{old_set} will be removed from \exmp{str}.
+
+ If \exmp{new_set} is not empty, then \exmp{old_set} and
+ \exmp{new_set} must be commensurate. Each set may consist of
+ character ranges such as \exmp{A-Z} and character classes:
+#v+
+ \, matches a punctuation character
+ \7 matches any 7bit ascii character
+ \\ matches a backslash
+ \^ matches the ^ character
+ \a matches an alphabetic character, excluding digits
+ \c matches a control character
+ \d matches a digit
+ \g matches a graphic character
+ \l matches lowercase
+ \p matches a printable character
+ \s matches whitespace
+ \u matches uppercase
+ \w matches a unicode "word" character, taken to be alphanumeric.
+ \x matches hex digit (a-fA-F0-9)
+#v-
+ If the first character of a set is \exmp{^} then the set is taken to
+ be the complement set.
+\example
+#v+
+ str = strtrans (str, "\\u", "\\l"); % lower-case str
+ str = strtrans (str, "^0-9", " "); % Replace anything but 0-9 by space
+ str = strtrans (str, "\\^0-9", " "); % Replace '^' and 0-9 by a space
+#v-
+\notes
+ \notearray_str_f_str_arg1
+\seealso{strreplace, strtrim, strup, strlow}
+\done
+
+\function{strtrim}
+\synopsis{Remove whitespace from the ends of a string}
+\usage{String_Type strtrim (String_Type s ,String_Type w)}
+\description
+ The \ifun{strtrim} function removes all leading and trailing whitespace
+ characters from the string \exmp{s} and returns the result. The
+ optional second parameter specifies the set of whitespace
+ characters. If the argument is not present, then the set defaults
+ to \exmp{"\\s"}. The whitespace specification may consist of
+ character ranges such as \exmp{A-Z} and character classes:
+#v+
+ \w matches a unicode "word" character, taken to be alphanumeric.
+ \a alphabetic character, excluding digits
+ \s matches whitespace
+ \l matches lowercase
+ \u matches uppercase
+ \d matches a digit
+ \\ matches a backslash
+ \^ matches a ^ character
+#v-
+ If the first character of a set is \exmp{^} then the set is taken to
+ be the complement set.
+\notes
+ \notearray_strtrim
+\seealso{strtrim_beg, strtrim_end, strcompress}
+\done
+
+\function{strtrim_beg}
+\synopsis{Remove leading whitespace from a string}
+\usage{String_Type strtrim_beg (String_Type s ,String_Type w)}
+\description
+ The \ifun{strtrim_beg} function removes all leading whitespace
+ characters from the string \exmp{s} and returns the result.
+ The optional second parameter specifies the set of whitespace
+ characters. See the documentation for the \ifun{strtrim} function
+ form more information about the whitespace parameter.
+\notes
+ \notearray_strtrim
+\seealso{strtrim, strtrim_end, strcompress}
+\done
+
+\function{strtrim_end}
+\synopsis{Remove trailing whitespace from a string}
+\usage{String_Type strtrim_end (String_Type s ,String_Type w)}
+\description
+ The \ifun{strtrim_end} function removes all trailing whitespace
+ characters from the string \exmp{s} and returns the result. The
+ optional second parameter specifies the set of whitespace
+ characters. See the documentation for the \ifun{strtrim} function
+ form more information about the whitespace parameter.
+\notes
+ \notearray_strtrim
+\seealso{strtrim, strtrim_beg, strcompress}
+\done
+
+\function{strup}
+\synopsis{Convert a string to uppercase}
+\usage{String_Type strup (String_Type s)}
+\description
+ The \ifun{strup} function takes a string \exmp{s} and returns another
+ string identical to \exmp{s} except that all lower case characters
+ that contained in \exmp{s} are converted to upper case.
+\example
+ The function
+#v+
+ define Strcmp (a, b)
+ {
+ return strcmp (strup (a), strup (b));
+ }
+#v-
+ performs a case-insensitive comparison operation of two strings by
+ converting them to upper case first.
+\notes
+ \notearray_str_f_str
+\seealso{strlow, toupper, strcmp, strtrim, define_case, strtrans}
+\done
+
+\function{str_delete_chars}
+\synopsis{Delete characters from a string}
+\usage{String_Type str_delete_chars (String_Type str , String_Type del_set)}
+\description
+ This function may be used to delete the set of characters specified
+ by the optional argument \exmp{del_set} from the string \exmp{str}.
+ If \exmp{del_set} is not given, \exmp{"\\s"} will be used.
+ The modified string is returned.
+
+ The set of characters to be deleted may include ranges such as
+ \exmp{A-Z} and characters classes:
+#v+
+ \w matches a unicode "word" character, taken to be alphanumeric.
+ \a alphabetic character, excluding digits
+ \s matches whitespace
+ \l matches lowercase
+ \u matches uppercase
+ \d matches a digit
+ \\ matches a backslash
+ \^ matches a ^ character
+#v-
+ If the first character of \exmp{del_set} is \exmp{^}, then the set
+ is taken to be the complement of the remaining string.
+\example
+#v+
+ str = str_delete_chars (str, "^A-Za-z");
+#v-
+ will remove all characters except \exmp{A-Z} and \exmp{a-z} from
+ \exmp{str}. Similarly,
+#v+
+ str = str_delete_chars (str, "^\\a");
+#v-
+ will remove all but the alphabetic characters.
+\notes
+ \notearray_str_f_str_arg1
+\seealso{strtrans, strreplace, strcompress}
+\done
+
+\function{str_quote_string}
+\synopsis{Escape characters in a string.}
+\usage{String_Type str_quote_string(String_Type str, String_Type qlis, Int_Type quote)}
+\description
+ The \ifun{str_quote_string} returns a string identical to \exmp{str}
+ except that all characters contained in the string \exmp{qlis} are
+ escaped with the \exmp{quote} character, including the quote
+ character itself. This function is useful for making a string that
+ can be used in a regular expression.
+\example
+ Execution of the statements
+#v+
+ node = "Is it the coat really worth $100?";
+ tag = str_quote_string (node, "\\^$*.+?", '\\');
+#v-
+ will result in \exmp{tag} having the value:
+#v+
+ Is it \the coat\ really worth \$100\?
+#v-
+\seealso{str_uncomment_string, make_printable_string}
+\done
+
+\function{str_replace}
+\synopsis{Replace a substring of a string (deprecated)}
+\usage{Int_Type str_replace (String_Type a, String_Type b, String_Type c)}
+\description
+ The \ifun{str_replace} function replaces the first occurrence of \exmp{b} in
+ \exmp{a} with \exmp{c} and returns an integer that indicates whether a
+ replacement was made. If \exmp{b} does not occur in \exmp{a}, zero is
+ returned. However, if \exmp{b} occurs in \exmp{a}, a non-zero integer is
+ returned as well as the new string resulting from the replacement.
+\notes
+ This function has been superseded by \ifun{strreplace}. It should no
+ longer be used.
+\seealso{strreplace}
+\done
+
+\function{str_uncomment_string}
+\synopsis{Remove comments from a string}
+\usage{String_Type str_uncomment_string(String_Type s, String_Type beg, String_Type end)}
+\description
+ This function may be used to remove simple forms of comments from a
+ string \exmp{s}. The parameters, \exmp{beg} and \exmp{end}, are strings
+ of equal length whose corresponding characters specify the begin and
+ end comment characters, respectively. It returns the uncommented
+ string.
+\example
+ The expression
+#v+
+ str_uncomment_string ("Hello (testing) 'example' World", "'(", "')")
+#v-
+ returns the string \exmp{"Hello World"}.
+\notes
+ This routine does not handle multi-character comment delimiters and it
+ assumes that comments are not nested.
+\seealso{str_quote_string, str_delete_chars, strtrans}
+\done
+
+\function{substr}
+\synopsis{Extract a substring from a string}
+\usage{String_Type substr (String_Type s, Int_Type n, Int_Type len)}
+\description
+ The \ifun{substr} function returns a substring with character length
+ \exmp{len} of the string \exmp{s} beginning at the character position
+ \exmp{n}. If \exmp{len} is \exmp{-1}, the entire length of the string
+ \exmp{s} will be used for \exmp{len}. The first character of \exmp{s}
+ is given by \exmp{n} equal to 1.
+\example
+#v+
+ substr ("To be or not to be", 7, 5);
+#v-
+ returns \exmp{"or no"}
+\notes
+ This function assumes character semantics and not byte semantics.
+ Use the \ifun{substrbytes} function to extract bytes from a string.
+\seealso{is_substr, substrbytes, strlen}
+\done
+
+\function{substrbytes}
+\synopsis{Extract a byte sequence from a string}
+\usage{String_Type substrbytes (String_Type s, Int_Type n, Int_Type len)}
+\description
+ The \ifun{substrbytes} function returns a substring with byte length
+ \exmp{len} of the string \exmp{s} beginning at the byte position
+ \exmp{n}, counting from 1. If \exmp{len} is \exmp{-1}, the entire
+ byte-length of the string \exmp{s} will be used for \exmp{len}. The first
+ byte of \exmp{s} is given by \exmp{n} equal to 1.
+\example
+#v+
+ substrbytes ("To be or not to be", 7, 5);
+#v-
+ returns \exmp{"or no"}
+\notes
+ In many cases it is more convenient to use array indexing rather
+ than the \ifun{substrbytes} function. In fact
+ \exmp{substrbytes(s,i+1,-1)} is equivalent to
+ \exmp{si:}.
+
+ The function \ifun{substr} may be used if character semantics are
+ desired.
+\seealso{substr, strbytelen}
+\done
+
+
+\function{wchars_to_string,string_to_wchars}
+\synopsis{Convert a UTF-8 encoded string to and from character codes}
+\usage{Int_Type string_to_wchars(String_Type str)
+ String_Type wchars_to_string(Int_Type array)
+}
+\description
+The \ifun{string_to_wchars} function decodes a UTF-8 encoded string
+and returns the Unicode characters as an array of integer values. The
+\ifun{wchars_to_string} performs the opposite conversion to produce a
+UTF-8 encoded string from an array of Unicode characters.
+\notes
+A malformed UTF-8 encoded string will result in negative byte-values in the
+output array at the positions corresponding to the malformed sequence.
+For example, the following function will substitute a '?' character
+for each byte in the malformed sequence to produce a valid string:
+#v+
+ define handle_malformed_bytes (str)
+ {
+ variable codes = string_to_wchars (str);
+ variable is_bad = (codes < 0);
+ if (any(is_bad))
+ {
+ codeswhere(is_bad) = '?';
+ str = wchars_to_string (codes);
+ }
+ return str;
+ }
+#v-
+\seealso{char, substr, array_to_bstring, bstring_to_array}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/struct.tm Added

@@ -0,0 +1,275 @@
+\function{__add_binary}
+\synopsis{Extend a binary operation to a user defined type}
+\usage{__add_binary(op, return_type, binary_funct, lhs_type, rhs_type)}
+#v+
+ String_Type op;
+ Ref_Type binary_funct;
+ DataType_Type return_type, lhs_type, rhs_type;
+#v-
+\description
+ The \ifun{__add_binary} function is used to specify a function to be
+ called when a binary operation takes place between specified data
+ types. The first parameter indicates the binary operator and must
+ be one of the following:
+#v+
+ "+", "-", "*", "/", "==", "!=", ">", ">=", "<", "<=", "^",
+ "or", "and", "&", "|", "xor", "shl", "shr", "mod"
+#v-
+ The second parameter (\exmp{binary_funct}) specifies the function to
+ be called when the binary function takes place between the
+ types \exmp{lhs_type} and \exmp{rhs_type}. The \exmp{return_type}
+ parameter stipulates the return values of the function and the data
+ type of the result of the binary operation.
+
+ The data type for \exmp{lhs_type} or \exmp{rhs_type} may be left
+ unspecified by using \dtype{Any_Type} for either of these values.
+ However, at least one of the parameters must correspond to a
+ user-defined datatype.
+\example
+ This example defines a vector data type and extends the "*" operator
+ to the new type:
+#v+
+ typedef struct { x, y, z } Vector_Type;
+ define vector (x, y, z)
+ {
+ variable v = @Vector_Type;
+ v.x = x;
+ v.y = y;
+ v.z = z;
+ return v;
+ }
+ static define vector_scalar_mul (v, a)
+ {
+ return vector (a*v.x, a*v.y, a*v.z);
+ }
+ static define scalar_vector_mul (a, v)
+ {
+ return vector_scalar_mul (v, a);
+ }
+ static define dotprod (v1,v2)
+ {
+ return v1.x*v2.x + v1.y*v2.y + v1.z*v2.z;
+ }
+ __add_binary ("*", Vector_Type, &scalar_vector_mul, Any_Type, Vector_Type);
+ __add_binary ("*", Vector_Type, &scalar_vector_mul, Any_Type, Vector_Type);
+ __add_binary ("*", Double_Type, &dotprod, Vector_Type, Vector_Type);
+#v-
+\seealso{__add_unary, __add_string, __add_destroy}
+\done
+
+\function{__add_string}
+\synopsis{Specify a string representation for a user-defined type}
+\usage{__add_string (DataType_Type user_type, Ref_Type func)}
+\description
+ The \ifun{__add_string} function specifies a function to be called
+ when a string representation is required for the specified
+ user-defined datatype.
+\example
+ Consider the \exmp{Vector_Type} object defined in the example
+ for the \ifun{__add_binary} function.
+#v+
+ static define vector_string (v)
+ {
+ return sprintf ("%S,%S,%S", v.x, v.y, v.z);
+ }
+ __add_string (Vector_Type, &vector_string);
+#v-
+ Then
+#v+
+ v = vector (3, 4, 5);
+ vmessage ("v=%S", v);
+#v-
+ will generate the message:
+#v+
+ v=3,4,5
+#v-
+\seealso{__add_unary, __add_binary, __add_destroy, __add_typecast}
+\done
+
+\function{__add_typecast}
+\synopsis{Add a typecast-function for a user-defined type}
+\usage{__add_typecast (DataType_Type user_type, DataType_Type totype, Ref_Type func)}
+\description
+ The \ifun{__add_typecast} function specifies a function to be called
+ to typecast the user-defined type to an object of type
+ \exmp{totype}. The function must be defined to take a single
+ argument (the user-type to be converted) and must return an object
+ of type \exmp{totype}.
+\seealso{__add_unary, __add_binary, __add_destroy, __add_string}
+\done
+
+\function{__add_unary}
+\synopsis{Extend a unary operator to a user-defined type}
+\usage{__add_unary (op, return_type, unary_func, user_type)}
+#v+
+ String_Type op;
+ Ref_Type unary_func;
+ DataType_Type return_type, user_type;
+#v-
+\description
+ The \ifun{__add_unary} function is used to define the action of an
+ unary operation on a user-defined type. The first parameter
+ \exmp{op} must be a valid unary operator
+#v+
+ "-", "not", "~"
+#v-
+ or one of the following:
+#v+
+ "++", "--",
+ "abs", "sign", "sqr", "mul2", "_ispos", "_isneg", "_isnonneg",
+#v-
+ The third parameter, \exmp{unary_func} specifies the function to be
+ called to carry out the specified unary operation on the data type
+ \exmp{user_type}. The result of the operation is indicated by the
+ value of the \exmp{return_type} parameter and must also be the
+ return type of the unary function.
+\example
+ The example for the \exmp{__add_binary} function defined a
+ \exmp{Vector_Type} object. Here, the unary \exmp{"-"} and
+ \exmp{"abs"} operators are
+ extended to this type:
+#v+
+ static define vector_chs (v)
+ {
+ variable v1 = @Vector_Type;
+ v1.x = -v.x;
+ v1.y = -v.y;
+ v1.z = -v.z;
+ return v1;
+ }
+ static define vector_abs (v)
+ {
+ return sqrt (v.x*v.x + v.y*v.y + v.z*v.z);
+ }
+ __add_unary ("-", Vector_Type, &vector_chs, Vector_Type);
+ __add_unary ("abs", Double_Type, &vector_abs, Vector_Type);
+#v-
+\seealso{__add_binary, __add_string, __add_destroy}
+\done
+
+\function{get_struct_field}
+\synopsis{Get the value associated with a structure field}
+\usage{x = get_struct_field (Struct_Type s, String field_name)}
+\description
+ The \ifun{get_struct_field} function gets the value of the field
+ whose name is specified by \exmp{field_name} of the structure
+ \exmp{s}. If the specified name is not a field of the structure, the
+ function will throw an \exc{InvalidParmError} exception.
+\seealso{set_struct_field, get_struct_field_names, array_info}
+\done
+
+\function{get_struct_field_names}
+\synopsis{Retrieve the field names associated with a structure}
+\usage{String_Type = get_struct_field_names (Struct_Type s)}
+\description
+ The \ifun{get_struct_field_names} function returns an array of
+ strings whose elements specify the names of the fields of the
+ struct \exmp{s}.
+\example
+ The following example illustrates how the
+ \ifun{get_struct_field_names} function may be used in conjunction
+ with the \ifun{get_struct_field} function to print the
+ value of a structure.
+#v+
+ define print_struct (s)
+ {
+ variable name, value;
+
+ foreach (get_struct_field_names (s))
+ {
+ name = ();
+ value = get_struct_field (s, name);
+ vmessage ("s.%s = %s\n", name, string (value));
+ }
+ }
+#v-
+\seealso{_push_struct_field_values, get_struct_field}
+\done
+
+\function{_is_struct_type}
+\synopsis{Determine whether or not an object is a structure}
+\usage{Integer_Type _is_struct_type (X)}
+\description
+ The \ifun{_is_struct_type} function returns 1 if the parameter
+ refers to a structure or a user-defined type, or to an array of
+ structures or user-defined types. If the object is neither, 0 will
+ be returned.
+\seealso{typeof, _typeof, is_struct_type}
+\done
+
+\function{is_struct_type}
+\synopsis{Determine whether or not an object is a structure}
+\usage{Integer_Type is_struct_type (X)}
+\description
+ The \ifun{is_struct_type} function returns 1 if the parameter
+ refers to a structure or a user-defined type. If the object is
+ neither, 0 will be returned.
+\seealso{typeof, _typeof, _is_struct_type}
+\done
+
+\function{_push_struct_field_values}
+\synopsis{Push the values of a structure's fields onto the stack}
+\usage{Integer_Type num = _push_struct_field_values (Struct_Type s)}
+\altusage{(v1,v2,...,vN) = _push_struct_field_values (Struct_Type s, Array_Type names)}
+\description
+ The \ifun{_push_struct_field_values} function may be used to obtain
+ the values of one of more fields of a structure. This function has
+ two usage forms.
+
+ The first form pushes the values of all the fields of a structure
+ onto the stack, returning the number of items pushed. The fields are
+ pushed such that the last field of the structure is pushed first.
+
+ The second form has an additional array argument that specifies the
+ names of the fields to process. It returns the values in the order
+ specified by the array. Unlike the first form, it does not return
+ the number of items pushed.
+\example
+#v+
+ s = struct {foo=1, bar="seven", z = "zz"};
+
+ % Form 1
+ n = _push_struct_field_values (s); % ==> n = 3
+ list = __pop_list (n); % ==> list = {"zz", "seven", 1};
+
+ % Form 2
+ list = {_push_struct_field_values (s, "foo", "bar", "z")};
+ % ==> list = {1, "seven", "zz"};
+
+ % Form 2
+ list = {_push_struct_field_values (s, "z", "foo")};
+ % ==> list = {"zz", 1};
+#v-
+\seealso{get_struct_field_names, get_struct_field}
+\done
+
+\function{set_struct_field}
+\synopsis{Set the value associated with a structure field}
+\usage{set_struct_field (s, field_name, field_value)}
+#v+
+ Struct_Type s;
+ String_Type field_name;
+ Generic_Type field_value;
+#v-
+\description
+ The \ifun{set_struct_field} function sets the value of the field
+ whose name is specified by \exmp{field_name} of the structure
+ \exmp{s} to \exmp{field_value}.
+\seealso{get_struct_field, get_struct_field_names, set_struct_fields, array_info}
+\done
+
+\function{set_struct_fields}
+\synopsis{Set the fields of a structure}
+\usage{set_struct_fields (Struct_Type s, ...)}
+\description
+ The \ifun{set_struct_fields} function may be used to set zero or more
+ fields of a structure. The fields are set in the order in which
+ they were created when the structure was defined.
+\example
+#v+
+ variable s = struct { name, age, height };
+ set_struct_fields (s, "Bill", 13, 64);
+#v-
+\seealso{set_struct_field, get_struct_field_names}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/time.tm Added

@@ -0,0 +1,240 @@
+\function{ctime}
+\synopsis{Convert a calendar time to a string}
+\usage{String_Type ctime(Long_Type secs)}
+\description
+  This function returns a string representation of the time as given
+  by \exmp{secs} seconds since 00:00:00 UTC, Jan 1, 1970.
+\seealso{time, strftime, _time, localtime, gmtime}
+\done
+
+\function{gmtime}
+\synopsis{Break down a time in seconds to the GMT timezone}
+\usage{Struct_Type gmtime (Long_Type secs)}
+\description
+  The \ifun{gmtime} function is exactly like \ifun{localtime} except
+  that the values in the structure it returns are with respect to GMT
+  instead of the local timezone.  See the documentation for
+  \ifun{localtime} for more information.
+\notes
+  On systems that do not support the \ifun{gmtime} C library function,
+  this function is the same as \ifun{localtime}.
+\seealso{localtime, _time, mktime}
+\done
+
+\function{localtime}
+\synopsis{Break down a time in seconds to the local timezone}
+\usage{Struct_Type localtime (Long_Type secs)}
+\description
+  The \ifun{localtime} function takes a parameter \exmp{secs}
+  representing the number of seconds since 00:00:00, January 1 1970
+  UTC and returns a structure containing information about \exmp{secs}
+  in the local timezone.  The structure contains the following
+  \dtype{Int_Type} fields:
+
+  \var{tm_sec} The number of seconds after the minute, normally
+     in the range 0 to 59, but can be up to 61 to allow for
+     leap seconds.
+
+  \var{tm_min} The number of minutes after the hour, in the
+     range 0 to 59.
+
+  \var{tm_hour} The number of hours past midnight, in the range
+     0 to 23.
+
+  \var{tm_mday} The day of the month, in the range 1 to 31.
+
+  \var{tm_mon} The number of months since January, in the range
+     0 to 11.
+
+  \var{tm_year} The number of years since 1900.
+
+  \var{tm_wday} The number of days since Sunday, in the range 0
+     to 6.
+
+  \var{tm_yday} The number of days since January 1, in the
+     range 0 to 365.
+
+  \var{tm_isdst} A flag that indicates whether daylight saving
+     time is in effect at the time described.  The value is
+     positive if daylight saving time is in effect, zero if it
+     is not, and negative if the information is not available.
+\seealso{gmtime, _time, ctime, mktime}
+\done
+
+\function{mktime}
+\synopsis{Convert a time-structure to seconds}
+\usage{secs = mktime (Struct_Type tm)}
+\description
+  The \ifun{mktime} function is essentially the inverse of the
+  \ifun{localtime} function.  See the documentation for that function
+  for more details.
+\seealso{localtime, gmtime, _time}
+\done
+
+\function{strftime}
+\synopsis{Format a date and time string}
+\usage{str = strftime (String_Type format ,Struct_Type tm)}
+\description
+  The \ifun{strftime} creates a date and time string according to a
+  specified format.  If called with a single argument, the current
+  local time will be used as the reference time.  If called with two
+  arguments, the second argument specifies the reference time, and
+  must be a structure with the same fields as the structure returned
+  by the \ifun{localtime} function.
+
+  The format string may be composed of one or more of the following
+  format descriptors:
+#v+
+       %A      full weekday name (Monday)
+       %a      abbreviated weekday name (Mon)
+       %B      full month name (January)
+       %b      abbreviated month name (Jan)
+       %c      standard date and time representation
+       %d      day-of-month (01-31)
+       %H      hour (24 hour clock) (00-23)
+       %I      hour (12 hour clock) (01-12)
+       %j      day-of-year (001-366)
+       %M      minute (00-59)
+       %m      month (01-12)
+       %p      local equivalent of AM or PM
+       %S      second (00-59)
+       %U      week-of-year, first day Sunday (00-53)
+       %W      week-of-year, first day Monday (00-53)
+       %w      weekday (0-6, Sunday is 0)
+       %X      standard time representation
+       %x      standard date representation
+       %Y      year with century
+       %y      year without century (00-99)
+       %Z      timezone name
+       %%      percent sign
+#v-
+ as well as any others provided by the C library.  The actual values
+ represented by the format descriptors are locale-dependent.
+\example
+#v+
+    message (strftime ("Today is %A, day %j of the year"));
+    tm = localtime (0);
+    message (strftime ("Unix time 0 was on a %A", tm));
+#v-
+\seealso{localtime, time}
+\done
+
+\function{_tic}
+\synopsis{Reset the CPU timer}
+\usage{_tic ()}
+\description
+  The \ifun{_tic} function resets the internal CPU timer.  The
+ \ifun{_toc} may be used to read this timer.  See the documentation
+ for the \ifun{_toc} function for more information.
+\seealso{_toc, times, tic, toc}
+\done
+
+\function{tic}
+\synopsis{Reset the interval timer}
+\usage{void tic ()}
+\description
+  The \ifun{tic} function resets the internal interval timer.  The
+ \ifun{toc} may be used to read the interval timer.
+\example
+  The tic/toc functions may be used to measure execution times.  For
+ example, at the \slsh prompt, they may be used to measure the speed
+ of a loop:
+#v+
+   slsh> tic; loop (500000); toc;
+   0.06558
+#v-
+\notes
+  On Unix, this timer makes use of the C library \cfun{gettimeofday}
+  function.
+\seealso{toc, _toc, _tic, times}
+\done
+
+\function{_time}
+\synopsis{Get the current calendar time in seconds}
+\usage{Long_Type _time ()}
+\description
+  The \ifun{_time} function returns the number of elapsed seconds since
+  00:00:00 UTC, January 1, 1970.  A number of functions (\ifun{ctime},
+  \ifun{gmtime}, \ifun{localtime}, etc.) are able to convert such a
+  value to other representations.
+\notes
+  This function is a wrapper around the C library \exmp{time}
+  function, and as such, probably does not account for leap seconds.
+\seealso{_ftime, ctime, time, localtime, gmtime}
+\done
+
+\function{_ftime}
+\synopsis{Get the current calendar time in seconds}
+\usage{Double_Type _ftime ( Double_Type opt_epoch )}
+\description
+  The \ifun{_ftime} function returns the number seconds since the Unix
+  epoch, 00:00:00 UTC, January 1, 1970 as a double precision number.
+  If the optional argument \exmp{opt_epoch} is passed, the function
+  will return a value relative to that epoch, which is defined as the
+  number of seconds since the Unix epoch.
+\seealso{_time, ctime, time, localtime, gmtime}
+\done
+
+\function{time}
+\synopsis{Return the current date and time as a string}
+\usage{String_Type time ()}
+\description
+  This function returns the current time as a string of the form:
+#v+
+    Sun Apr 21 13:34:17 1996
+#v-
+\seealso{strftime, ctime, message, substr}
+\done
+
+\function{timegm}
+\synopsis{Convert a time structure for the GMT timezone to seconds}
+\usage{Long_Type secs = timegm(Struct_Type tm)}
+\description
+  \ifun{timegm} is the inverse of the \ifun{gmtime} function.
+\seealso{gmtime, mktime, localtime}
+\done
+
+\function{times}
+\synopsis{Get process times}
+\usage{Struct_Type times ()}
+\description
+  The \ifun{times} function returns a structure containing the
+  following fields:
+#v+
+    tms_utime     (user time)
+    tms_stime     (system time)
+    tms_cutime    (user time of child processes)
+    tms_cstime    (system time of child processes)
+#v-
+\notes
+  Not all systems support this function.
+\seealso{_tic, _toc, _time}
+\done
+
+\function{_toc}
+\synopsis{Get the elapsed CPU time for the current process}
+\usage{Double_Type _toc ()}
+\description
+  The \ifun{_toc} function returns the elapsed CPU time in seconds since
+  the last call to \ifun{_tic}.  The CPU time is the amount of time the
+  CPU spent running the code of the current process.
+\notes
+  This function may not be available on all systems.
+
+  The implementation of this function is based upon the \ifun{times}
+  system call.  The precision of the clock is system dependent and may
+  not be very accurate for small time intervals.  For this reason, the
+  tic/toc functions may be more useful for small time-intervals.
+\seealso{_tic, tic, toc, times, _time}
+\done
+
+\function{toc}
+\synopsis{Read the interval timer}
+\usage{Double_Type toc ()}
+\description
+  The \ifun{toc} function returns the elapsed time in seconds since
+  the last call to \ifun{tic}.  See the documentation for the
+ \ifun{tic} function for more information.
+\seealso{tic, _tic, _toc, times, _time}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/tm-sort.sl Added

@@ -0,0 +1,171 @@
+#! /usr/bin/env slsh
+
+private variable Data;
+
+private define init ()
+{
+ Data = Assoc_TypeString_Type;
+}
+
+private define warning ()
+{
+ variable args = __pop_args (_NARGS);
+ () = fprintf (stderr, "***WARNING: %s\n", sprintf (__push_args (args)));
+}
+
+private define process_function (line, fp)
+{
+ variable fname;
+ variable lines;
+
+ fname = strtrim (strtok (line, "{}")1);
+
+ lines = line;
+#iftrue
+ foreach (fp)
+ {
+	line = ();
+	lines = strcat (lines, line);
+	if (0 == strncmp ("\\done", line, 5))
+	 break;
+ }
+#else
+ while (-1 != fgets (&line, fp))
+ {
+	lines += line;
+	if (0 == strncmp ("\\done", line, 5))
+	 break;
+ }
+#endif
+ if (assoc_key_exists (Data, fname))
+ {
+	warning ("Key %s already exists", fname);
+	return -1;
+ }
+
+ Datafname = lines;
+ return 0;
+}
+
+private define process_variable (line, fp)
+{
+ process_function (line, fp);
+}
+private define process_datatype (line, fp)
+{
+ process_function (line, fp);
+}
+
+private define read_file_contents (file)
+{
+ variable fp = fopen (file, "r");
+ variable n = 0;
+ variable line;
+
+ if (fp == NULL)
+ {
+	() = fprintf (stderr, "Unable to open %s\n", file);
+	return -1;
+ }
+
+ %while (-1 != fgets (&line, fp))
+ foreach (fp)
+ {
+	line = ();
+	if (0 == strncmp (line, "\\function{", 10))
+	 {
+	 if (-1 == process_function (line, fp))
+	 return -1;
+
+	 continue;
+	 }
+
+	if (0 == strncmp (line, "\\variable{", 10))
+	 {
+	 if (-1 == process_variable (line, fp))
+	 return -1;
+
+	 continue;
+	 }
+
+	if (0 == strncmp (line, "\\datatype{", 10))
+	 {
+	 if (-1 == process_datatype (line, fp))
+	 return -1;
+
+	 continue;
+	 }
+ }
+
+ () = fclose (fp);
+ return 0;
+}
+
+private define sort_keys (a, b)
+{
+ variable a1 = strup (strtrim_beg (a, "_"));
+ variable b1 = strup (strtrim_beg (b, "_"));
+ variable ret = strcmp (a1, b1);
+ if (ret == 0)
+ ret = strcmp (a, b);
+ return ret;
+}
+
+private define sort_and_write_file_elements (file)
+{
+ variable fp;
+ variable i, keys;
+ variable backup_file;
+
+ backup_file = file + ".BAK";
+ () = remove (backup_file);
+ () = rename (file, backup_file);
+
+ fp = fopen (file, "w");
+ if (fp == NULL)
+ return -1;
+
+ keys = assoc_get_keys (Data);
+ i = array_sort (keys, &sort_keys);
+
+ foreach (keysi)
+ {
+	variable k = ();
+
+	() = fputs (Datak, fp);
+	() = fputs ("\n", fp);
+ }
+
+ () = fclose (fp);
+
+ return 0;
+}
+
+private define process_file (file)
+{
+ init ();
+
+ () = fprintf (stdout, "Processing %s ...", file);
+ () = fflush (stdout);
+
+ if (-1 == read_file_contents (file))
+ return -1;
+
+ if (-1 == sort_and_write_file_elements (file))
+ return -1;
+
+ () = fputs ("done.\n", stdout);
+ return 0;
+}
+
+define slsh_main ()
+{
+ if (__argc < 2)
+ {
+	() = fprintf (stderr, "Usage: %s files....\n", __argv0);
+	exit (1);
+ }
+
+ foreach (__argv1:)
+ process_file ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/type.tm Added

@@ -0,0 +1,330 @@
+\function{_array_byteswap}
+\synopsis{Convert an array from one endianness to another}
+\usage{b = _array_byteswap (Array_Type a, Int_Type from, Int_Type to)}
+\description
+The \ifun{_array_byteswap} function converts the elements of an array
+from one endianess to another via a byte-swapping operation. The
+parameters \exmp{from} and \exmp{to} indicate the endianesss of the
+input and output arrays, respectively. The values for \exmp{from} and
+\exmp{to} parameters must be one of the following:
+#v+
+ 'B', 'b', '>' : Big Endian (network order)
+ 'L', 'l', '<' : Little Endian
+ 'N', 'n', '=' : Native (host order)
+#v-
+The function returns an array of the corresponding byte-swapped
+elements.
+\notes
+If the parameter \exmp{a} is a scalar, a corresponding byte-swapped
+scalar will be returned.
+
+If the object represented by the parameter \exmp{a} cannot be
+byteswapped, an exception will be thrown. For example, an error will
+be thrown if \exmp{a} is a \dtype{String_Type} object.
+\seealso{pack, unpack, typecast}
+\done
+
+\function{atof}
+\synopsis{Convert a string to a double precision number}
+\usage{Double_Type atof (String_Type s)}
+\description
+ This function converts a string \exmp{s} to a double precision value
+ and returns the result. It performs no error checking on the format
+ of the string. The function \ifun{_slang_guess_type} may be used to
+ check the syntax of the string.
+\example
+#v+
+ define error_checked_atof (s)
+ {
+ if (__is_datatype_numeric (_slang_guess_type (s)))
+ return atof (s);
+ throw InvalidParmError, "$s is not a double"$;
+ }
+#v-
+\seealso{typecast, double, _slang_guess_type}
+\done
+
+\function{atoi}
+\synopsis{Convert a string to an integer}
+\usage{Int_Type atoi (String_Type str)}
+\description
+ The \ifun{atoi} function converts a string to an \exmp{Int_Type}
+ using the standard C library function of the corresponding name.
+\notes
+ This function performs no syntax checking upon its argument.
+\seealso{integer, atol, atoll, atof, sscanf}
+\done
+
+\function{atol}
+\synopsis{Convert a string to an long integer}
+\usage{Long_Type atol (String_Type str)}
+\description
+ The \ifun{atol} function converts a string to a \exmp{Long_Type}
+ using the standard C library function of the corresponding name.
+\notes
+ This function performs no syntax checking upon its argument.
+\seealso{integer, atoi, atoll, atof, sscanf}
+\done
+
+\function{atoll}
+\synopsis{Convert a string to a long long}
+\usage{LLong_Type atoll (String_Type str)}
+\description
+ The \ifun{atoll} function converts a string to a \exmp{LLong_Type}
+ using the standard C library function of the corresponding name.
+\notes
+ This function performs no syntax checking upon its argument. Not
+ all platforms provide support for the long long data type.
+\seealso{integer, atoi, atol, atof, sscanf}
+\done
+
+\function{char}
+\synopsis{Convert a character code to a string}
+\usage{String_Type char (Integer_Type c)}
+\description
+ The \ifun{char} function converts an integer character code (ascii)
+ value \exmp{c} to a string of unit character length such that the
+ first character of the string is \exmp{c}. For example,
+ \exmp{char('a')} returns the string \exmp{"a"}.
+
+ If UTF-8 mode is in effect (\ivar{_slang_utf8_ok} is non-zero), the
+ resulting single character may be represented by several bytes.
+
+ If the character code \exmp{c} is less than 0, then byte-semantics
+ will be used with the resulting string consisting of a single byte
+ whose value is that of \exmp{-c&0xFF}.
+\notes
+ A better name should have been chosen for this function.
+\seealso{integer, string, typedef, sprintf, pack}
+\done
+
+\function{define_case}
+\synopsis{Define upper-lower case conversion}
+\usage{define_case (Integer_Type ch_up, Integer_Type ch_low)}
+\description
+ This function defines an upper and lowercase relationship between two
+ characters specified by the arguments. This relationship is used by
+ routines which perform uppercase and lowercase conversions.
+ The first integer \exmp{ch_up} is the ascii value of the uppercase character
+ and the second parameter \exmp{ch_low} is the ascii value of its
+ lowercase counterpart.
+\notes
+ This function has no effect in UTF-8 mode.
+\seealso{strlow, strup}
+\done
+
+\function{double}
+\synopsis{Convert an object to double precision}
+\usage{Double_Type double (x)}
+\description
+ The \ifun{double} function typecasts an object \exmp{x} to double
+ precision. For example, if \exmp{x} is an array of integers, an
+ array of double types will be returned. If an object cannot be
+ converted to \ifun{Double_Type}, a type-mismatch error will result.
+\notes
+ The \ifun{double} function is equivalent to the typecast operation
+#v+
+ typecast (x, Double_Type)
+#v-
+ To convert a string to a double precision number, use the \ifun{atof}
+ function.
+\seealso{typecast, atof, int}
+\done
+
+\function{int}
+\synopsis{Typecast an object to an integer}
+\usage{Int_Type int (s)}
+\description
+ This function performs a typecast of an object \exmp{s} to
+ an object of \dtype{Integer_Type}. If \exmp{s} is a string, it returns
+ returns the ascii value of the first bytes of the string
+ \exmp{s}. If \exmp{s} is \dtype{Double_Type}, \ifun{int} truncates the
+ number to an integer and returns it.
+\example
+ \ifun{int} can be used to convert single byte strings to
+ integers. As an example, the intrinsic function \ifun{isdigit} may
+ be defined as
+#v+
+ define isdigit (s)
+ {
+ if ((int (s) >= '0') and (int (s) <= '9')) return 1;
+ return 0;
+ }
+#v-
+\notes
+ This function is equivalent to \exmp{typecast (s, Integer_Type)};
+\seealso{typecast, double, integer, char, isdigit, isxdigit}
+\done
+
+\function{integer}
+\synopsis{Convert a string to an integer}
+\usage{Integer_Type integer (String_Type s)}
+\description
+ The \ifun{integer} function converts a string representation of an
+ integer back to an integer. If the string does not form a valid
+ integer, a SyntaxError will be thrown.
+\example
+ \exmp{integer ("1234")} returns the integer value \exmp{1234}.
+\notes
+ This function operates only on strings and is not the same as the
+ more general \ifun{typecast} operator.
+\seealso{typecast, _slang_guess_type, string, sprintf, char}
+\done
+
+\function{isalnum, isalpha, isascii, isblank, iscntrl, isdigit, isgraph,
+islower, isprint, ispunct, isspace, isupper, isxdigit
+}
+\synopsis{Character classification functions}
+\usage{Char_Type isalnum(wch)
+ Char_Type isalpha(wch)
+ Char_Type isascii(wch)
+ Char_Type isblank(wch)
+ Char_Type iscntrl(wch)
+ Char_Type isdigit(wch)
+ Char_Type isgraph(wch)
+ Char_Type islower(wch)
+ Char_Type isprint(wch)
+ Char_Type ispunct(wch)
+ Char_Type isspace(wch)
+ Char_Type isupper(wch)
+ Char_Type isxdigit(wch)
+}
+\description
+ These functions return a non-zero value if the character given by
+ \exmp{wch} is a member of the character class represented by the
+ function, according to the table below. Otherwise, 0 will be
+ returned to indicate that the character is not a member of the
+ class. If the parameter \exmp{wch} is a string, then the first
+ character (not necessarily a byte) of the string will be used.
+#v+
+ isalnum : alphanumeric character, equivalent to isalpha or isdigit
+ isalpha : alphabetic character
+ isascii : 7-bit unsigned ascii character
+ isblank : space or a tab
+ iscntrl : control character
+ isdigit : digit 0-9
+ isgraph : non-space printable character
+ islower : lower-case character
+ isprint : printable character, including a space
+ ispunct : non-alphanumeric graphic character
+ isspace : whitespace character (space, newline, tab, etc)
+ isupper : uppercase case character
+ isxdigit: hexadecimal digit character 0-9, a-f, A-F
+#v-
+\seealso{strtrans}
+\done
+
+\function{_slang_guess_type}
+\synopsis{Guess the data type that a string represents}
+\usage{DataType_Type _slang_guess_type (String_Type s)}
+\description
+ This function tries to determine whether its argument \exmp{s}
+ represents an integer (short, int, long), floating point (float,
+ double), or a complex number. If it appears to be none of these,
+ then a string is assumed. It returns one of the following values
+ depending on the format of the string \exmp{s}:
+#v+
+ Short_Type : short integer (e.g., "2h")
+ UShort_Type : unsigned short integer (e.g., "2hu")
+ Integer_Type : integer (e.g., "2")
+ UInteger_Type : unsigned integer (e.g., "2")
+ Long_Type : long integer (e.g., "2l")
+ ULong_Type : unsigned long integer (e.g., "2l")
+ Float_Type : float (e.g., "2.0f")
+ Double_Type : double (e.g., "2.0")
+ Complex_Type : imaginary (e.g., "2i")
+ String_Type : Anything else. (e.g., "2foo")
+#v-
+ For example, \exmp{_slang_guess_type("1e2")} returns
+ \dtype{Double_Type} but \exmp{_slang_guess_type("e12")} returns
+ \dtype{String_Type}.
+\seealso{integer, string, double, atof, __is_datatype_numeric}
+\done
+
+\function{string}
+\synopsis{Convert an object to a string representation.}
+\usage{String_Type string (obj)}
+\description
+ The \ifun{string} function may be used to convert an object
+ \exmp{obj} of any type to its string representation.
+ For example, \exmp{string(12.34)} returns \exmp{"12.34"}.
+\example
+#v+
+ define print_anything (anything)
+ {
+ message (string (anything));
+ }
+#v-
+\notes
+ This function is \em{not} the same as typecasting to a \dtype{String_Type}
+ using the \ifun{typecast} function.
+\seealso{typecast, sprintf, integer, char}
+\done
+
+\function{tolower}
+\synopsis{Convert a character to lowercase.}
+\usage{Integer_Type lower (Integer_Type ch)}
+\description
+ This function takes an integer \exmp{ch} and returns its lowercase
+ equivalent.
+\seealso{toupper, strup, strlow, int, char, define_case}
+\done
+
+\function{toupper}
+\synopsis{Convert a character to uppercase.}
+\usage{Integer_Type toupper (Integer_Type ch)}
+\description
+ This function takes an integer \exmp{ch} and returns its uppercase
+ equivalent.
+\seealso{tolower, strup, strlow, int, char, define_case}
+\done
+
+\function{typecast}
+\synopsis{Convert an object from one data type to another.}
+\usage{typecast (x, new_type)}
+\description
+ The \ifun{typecast} function performs a generic typecast operation on
+ \exmp{x} to convert it to \exmp{new_type}. If \exmp{x} represents an
+ array, the function will attempt to convert all elements of \exmp{x}
+ to \exmp{new_type}. Not all objects can be converted and a
+ type-mismatch error will result upon failure.
+\example
+#v+
+ define to_complex (x)
+ {
+ return typecast (x, Complex_Type);
+ }
+#v-
+ defines a function that converts its argument, \exmp{x} to a complex
+ number.
+\seealso{int, double, typeof, _array_byteswap}
+\done
+
+\function{_typeof}
+\synopsis{Get the data type of an object}
+\usage{DataType_Type _typeof (x)}
+\description
+ This function is similar to the \ifun{typeof} function except in the
+ case of arrays. If the object \exmp{x} is an array, then the data
+ type of the array will be returned. Otherwise \ifun{_typeof} returns
+ the data type of \exmp{x}.
+\example
+#v+
+ if (Integer_Type == _typeof (x))
+ message ("x is an integer or an integer array");
+#v-
+\seealso{typeof, array_info, _slang_guess_type, typecast}
+\done
+
+\function{typeof}
+\synopsis{Get the data type of an object}
+\usage{DataType_Type typeof (x)}
+\description
+ This function returns the data type of \exmp{x}.
+\example
+#v+
+ if (Integer_Type == typeof (x)) message ("x is an integer");
+#v-
+\seealso{_typeof, is_struct_type, array_info, _slang_guess_type, typecast}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/rtl/whatelse.sl Added

@@ -0,0 +1,140 @@
+#!/usr/bin/env slsh
+% -*- slang -*-
+
+% This file is used to determine what functions still need documenting.
+% I think that it provides a good example of the use of associative arrays.
+
+_debug_info = 1;
+
+variable Src_Files = "../../../src/*.c";
+variable TM_Files = "*.tm";
+variable Unwanted_Files = "../../../src/calc.c";
+
+define grep (pat, files)
+{
+   if (strlen (files) == 0)
+     return String_Type0;
+
+   variable fp = popen ("rgrep '$pat' $files"$, "r");
+   variable matches;
+
+   matches = fgetslines (fp);
+   () = pclose (fp);
+
+   return matches;
+}
+
+static define prune_array (a, b)
+{
+   foreach (b) using ("keys")
+     {
+	variable k = ();
+	if (0 == assoc_key_exists (a, k))
+	  continue;
+	assoc_delete_key (a, k);
+	bk = 0;
+     }
+}
+
+define get_with_pattern (a, pat, white)
+{
+   variable f;
+
+   foreach (grep (pat, Src_Files))
+     {
+	f = ();
+
+	f = strtok (f, white)1;
+	a f = 1;
+     }
+
+   if (Unwanted_Files != NULL) foreach (grep (pat, Unwanted_Files))
+     {
+	f = ();
+	f = strtok (f, white)1;
+	assoc_delete_key (a, f);
+     }
+}
+
+define get_src_intrinsics ()
+{
+   variable f;
+   variable src = Assoc_TypeInt_Type;
+
+   get_with_pattern (src, "^ \t+MAKE_INTRINSIC.*(\".*\"", "\"");
+   get_with_pattern (src, "^ \t+MAKE_MATH_UNARY.*(\".*\"", "\"");
+   get_with_pattern (src, "^ \t+MAKE_APP_UNARY.*(\".*\"", "\"");
+   get_with_pattern (src, "^ \t+MAKE_ARITH_UNARY.*(\".*\"", "\"");
+   get_with_pattern (src, "^ \t+MAKE_ARITH_BINARY.*(\".*\"", "\"");
+   get_with_pattern (src, "^ \t+MAKE_VARIABLE.*(\".*\"", "\"");
+   get_with_pattern (src, "^ \t+MAKE_DCONSTANT.*(\".*\"", "\"");
+   get_with_pattern (src, "^ \t+MAKE_FCONSTANT.*(\".*\"", "\"");
+   get_with_pattern (src, "^ \t+MAKE_ICONSTANT.*(\".*\"", "\"");
+   get_with_pattern (src, "^ \t+MAKE_LLCONSTANT.*(\".*\"", "\"");
+
+   get_with_pattern (src, "SLclass_allocate_class \t+(\"", "\"");
+   get_with_pattern (src, "SLadd_intrinsic^(+(\"", "\"");
+
+   return src;
+}
+
+define get_doc_intrinsics ()
+{
+   variable funs;
+   variable doc = Assoc_TypeInt_Type;
+
+   funs = grep ("^\\\\function{", TM_Files);
+   foreach (funs)
+     {
+	variable f;
+	f = ();
+	f = strtok (f, "{}")1;
+	foreach f (strtok (f, ","))
+	  doc f = 1;
+     }
+   funs = grep ("^\\\\variable{", TM_Files);
+   foreach (funs)
+     {
+	f = ();
+	f = strtok (f, "{}")1;
+	doc f = 1;
+     }
+   funs = grep ("^\\\\datatype{", TM_Files);
+   foreach (funs)
+     {
+	f = ();
+	f = strtok (f, "{}")1;
+	doc f = 1;
+     }
+   return doc;
+}
+
+define slsh_main ()
+{
+   variable k;
+   variable src, doc;
+
+   doc = get_doc_intrinsics ();
+   src = get_src_intrinsics ();
+
+   prune_array (src, doc);
+
+   k = assoc_get_keys (src);
+   k = karray_sort(k);
+
+   foreach (k)
+     {
+	message ();
+     }
+
+   k = assoc_get_keys (doc);
+   variable v = assoc_get_values (doc);
+   variable i = where (v);
+   if (length (i))
+     {
+	message ("\n***The following are documented but unknown***");
+	foreach (ki)
+	  message ();
+     }
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/slang.tm Added

@@ -0,0 +1,6142 @@
+#% -*- mode: tm; mode: fold -*-
+
+#% text-macro definitions #%{{{
+#i linuxdoc.tm
+#i local.tm
+
+#d labeled_sect#1 \sect{$1 \label{$1}}
+#d labeled_sect1#1 \sect1{$1 \label{$1}}
+#d labeled_chapter#1 \chapter{$1 \label{$1}}
+#d sectref#1 the section on \ref{$1}
+#d chapterref#1 the chapter on \ref{$1}
+
+#d documentstyle book
+
+#%}}}
+
+\linuxdoc
+
+\begin{\documentstyle}
+
+#d DocTitle A Guide to the S-Lang Language
+\title \DocTitle (\docversion)
+\author John E. Davis <www.jedsoft.org>
+\date \__today__
+
+\toc
+
+#i preface.tm
+
+#%+
+ "Slang is a language that rolls up its sleeves, spits on its hands and
+ goes to work."
+ -- Carl Sandburg (1878-1967), U.S. poet. New York Times (Feb. 13, 1959).
+#%-
+
+\labeled_chapter{Introduction} #%{{{
+
+ \slang is a powerful interpreted language that may be embedded into
+ an application to make the application extensible. This enables the
+ application to be used in ways not envisioned by the programmer, thus
+ providing the application with much more flexibility and power.
+ Examples of applications that take advantage of the interpreter in
+ this way include the \jed editor and the \slrn newsreader.
+
+\sect{slsh -- The \slang shell}
+
+ The \slang distribution contains a standalone application called
+ \slsh that may be used for writing \slang scripts and full-blown
+ \slang based applications. For example, the author has used \slsh to
+ create a mediacenter for his home entertainment system that
+ integrates internet radio and tv, podcasts, digital pictures and
+ video, CDs, and so forth. The use of \slsh in such non-interactive
+ modes is discussed in \chapterref{slsh}.
+
+ \slsh also may be used interactively and has full access to all
+ components of the \slang interpreter. With features such as
+ customizable command-line editing, history recall and completion,
+ \slsh is a convenient environment for learning and using the
+ language. In fact, as you are reading this manual, it is recommended
+ that you use \slsh in its interactive mode as an aid to understanding
+ the language.
+
+ While a standard \slang installation includes \slsh,
+ some some binary distributions package \slsh separately from the
+ \slang library, and as such must be installed separately. For
+ example, on Debian Linux it can be installed via
+#v+
+ apt-get install slsh
+#v-
+
+ When called without arguments, \slsh will start in interactive mode
+ by issuing a (customizable) \tt{slsh>} prompt and waits for input.
+ While most of the time one would enter \slang statements at the
+ prompt, \slsh also accepts some other commands, most notably
+ \exmp{help}:
+#v+
+ slsh> help
+ Most commands must end in a semi-colon.
+ If a command begins with '!', then the command is passed to the shell.
+ Examples: !ls, !pwd, !cd foo, ...
+ Special commands:
+ help <help-topic>
+ apropos <something>
+ start_log( <optional-log-file> );
+ start logging input to a file (default is slsh.log)
+ stop_log();
+ stop logging input
+ save_input (<optional-file>);
+ save all previous input to a file (default: slsh.log)
+ quit;
+#v-
+
+ Although the language normally requires variables to be declared
+ before use, it is not necessary to do so when using \slsh
+ interactively. For example, in this document you will see examples
+ such as
+#v+
+ variable x = 1:10;
+ variable y = sin (x^2);
+#v-
+ At the \slsh command line, the use of the \kw{variable} keyword in such
+ statements is optional:
+#v+
+ slsh> x = 1:10; y = sin(x^2);
+#v-
+
+ As the above example suggests, one use of \slsh is as a sophisticated
+ calculator. For example,
+#v+
+ slsh> sin (1.24) + 3*cos (1.3*PI);
+ -0.817572
+#v-
+ This is especially true when combined with modules, e.g.,
+#v+
+ slsh> require ("fits");
+ slsh> require ("histogram");
+ slsh> tbl = fit_read_table ("evt1a.fits");
+ slsh> engrid = min(tbl.energy):max(energy):#1024;
+ slsh> spectrum = hist1d (tbl.energywhere(tbl.status==0), engrid);
+#v-
+ In this example, the \module{fits} module was used to read data
+ from a binary file called \exmp{evt1a.fits}, and the
+ \module{histogram} module was used to bin the data in the energy
+ column into a histogram to create a spectrum. The expression
+ involving \exmp{where} filters the data by accepting only those
+ energy values whose status is set to 0. The \module{fits} and
+ \module{histogram} modules are not distributed with \slang but may be
+ obtained separately-- see \url{http://www.jedsoft.org/slang/modules/}
+ for links to them. For more information about modules, see the
+ \ref{Modules} chapter in this document.
+
+ For more information about using \slsh, see \chapterref{slsh}.
+
+\sect{Language Features}
+
+ The language features both global and local variables, branching
+ and looping constructs, user-defined functions, structures,
+ datatypes, and arrays. In addition, there is limited support for
+ pointer types. The concise array syntax rivals that of commercial
+ array-based numerical computing environments.
+
+\sect{Data Types and Operators} #%{{{
+
+ The language provides built-in support for string, integer (signed
+ and unsigned long and short), double precision floating point, and
+ double precision complex numbers. In addition, it supports user
+ defined structure types, multi-dimensional array types, lists, and
+ associative arrays. To facilitate the construction of
+ sophisticated data structures such as linked lists and trees, the
+ language also includes a ``reference'' type. The reference type
+ provides much of the same flexibility as pointers in other
+ languages. Finally, applications embedding the interpreter may
+ also provide special application specific types, such as the
+ \var{Mark_Type} that the \jed editor provides.
+
+ The language provides standard arithmetic operations such as
+ addition, subtraction, multiplication, and division. It also
+ provides support for modulo arithmetic as well as operations at the
+ bit level, e.g., exclusive-or. Any binary or unary operator may be
+ extended to work with any data type, including user-defined types.
+ For example, the addition operator (\var{+}) has been extended to
+ work between string types to permit string concatenation.
+
+ The binary and unary operators work transparently with array types.
+ For example, if \var{a} and \var{b} are arrays, then \exmp{a + b}
+ produces an array whose elements are the result of element by
+ element addition of \var{a} and \var{b}. This permits one to do
+ vector operations without explicitly looping over the array
+ indices.
+
+#%}}}
+
+\sect{Statements and Functions} #%{{{
+
+ The \slang language supports several types of looping constructs and
+ conditional statements. The looping constructs include \kw{while},
+ \kw{do...while}, \kw{for}, \kw{forever}, \kw{loop}, \kw{foreach},
+ and \kw{_for}. The conditional statements include \kw{if},
+ \kw{if-then-else}, and \kw{ifnot}.
+
+ User defined functions may be defined to return zero, one, or more
+ values. Functions that return zero values are similar to
+ ``procedures'' in languages such as PASCAL. The local variables of a
+ function are always created on a stack allowing one to create
+ recursive functions. Parameters to a function are always passed by
+ value and never by reference. However, the language supports a
+ \em{reference} data type that allows one to simulate pass by
+ reference.
+
+ Unlike many interpreted languages, \slang allows functions to be
+ dynamically loaded (function autoloading). It also provides
+ constructs specifically designed for error handling and recovery as
+ well as debugging aids (e.g., function tracebacks).
+
+ Functions and variables may be declared as private belonging to a
+ namespace associated with the compilation unit that defines the
+ function or variable. The ideas behind the namespace implementation
+ stem from the C language and should be quite familiar to any one
+ familiar with C.
+
+#%}}}
+
+\sect{Error Handling} #%{{{
+
+ The \slang language has a try/throw/catch/finally exception model
+ whose semantics are similar to that of other languages. Users may
+ also extend the exception class hierarchy with user-defined
+ exceptions. The \exmp{ERROR_BLOCK} based exception model of \slang
+ 1.x is still supported but deprecated.
+
+#%}}}
+
+\sect{Run-Time Library} #%{{{
+
+ Functions that compose the \slang run-time library are called
+ \em{intrinsics}. Examples of \slang intrinsic functions available
+ to every \slang application include string manipulation functions
+ such as \var{strcat}, \var{strchop}, and \var{strcmp}. The \slang
+ library also provides mathematical functions such as \var{sin},
+ \var{cos}, and \var{tan}; however, not all applications enable the
+ use of these intrinsics. For example, to conserve memory, the 16
+ bit version of the \jed editor does not provide support for any
+ mathematics other than simple integer arithmetic, whereas other
+ versions of the editor do support these functions.
+
+ Most applications embedding the languages will also provide a set of
+ application specific intrinsic functions. For example, the \jed
+ editor adds over 100 application specific intrinsic functions to
+ the language. Consult your application specific documentation to
+ see what additional intrinsics are supported.
+
+ Operating systems that support dynamic linking allow a slang
+ interpreter to dynamically link additional libraries of intrinsic
+ functions and variables into the interpreter. Such loadable
+ objects are called \bf{modules}. A separate chapter of this manual
+ is devoted to this important feature.
+
+#%}}}
+
+\sect{Input/Output}
+
+ The language supports C-like stdio input/output functions such as
+ \var{fopen}, \var{fgets}, \var{fputs}, and \var{fclose}. In
+ addition it provides two functions, \var{message} and \var{error},
+ for writing to the standard output device and standard error.
+ Specific applications may provide other I/O mechanisms, e.g.,
+ the \jed editor supports I/O to files via the editor's
+ buffers.
+
+\sect{Obtaining more information about \slang} #%{{{
+
+ Comprehensive information about the library may be obtained via the
+ World Wide Web from \url{http://www.jedsoft.org/slang/}. In
+ particular see \url{http://www.jedsoft.org/slang/download.html} for
+ downloading the latest version of the library.
+
+ Users with generic questions about the interpreter are encouraged to
+ post questions to the Usenet newsgroup \var{alt.lang.s-lang}. More
+ specific questions relating to the use of \slang within some
+ application may be better answered in an application-specific forum.
+ For example, users with questions about using \slang as embedded in
+ the \jed editor are more likely to be answered in the
+ \var{comp.editors} newsgroup or on the \jed mailing list. Similarly
+ users with questions concerning \slrn will find
+ \var{news.software.readers} to be a valuable source of information.
+
+ Developers who have embedded the interpreter are encouraged to join
+ the \slang mailing list. To subscribe to the list or just browse
+ the archives, visit
+ \url{http://www.jedsoft.org/slang/mailinglists.html}.
+
+#%}}}
+
+#%}}}
+
+\chapter{Overview of the Language} #%{{{
+
+ This purpose of this section is to give the reader a feel for the
+ \slang language, its syntax, and its capabilities. The information
+ and examples presented in this section should be sufficient to
+ provide the reader with the necessary background to understand the
+ rest of the document.
+
+\sect{Variables and Functions} #%{{{
+
+ \slang is different from many other interpreted languages in the
+ sense that all variables and functions must be declared before they
+ can be used.
+
+ Variables are declared using the \kw{variable} keyword, e.g.,
+#v+
+ variable x, y, z;
+#v-
+ declares three variables, \exmp{x}, \exmp{y}, and \exmp{z}. Note the
+ semicolon at the end of the statement. \em{All \slang statements must
+ end in a semicolon.}
+
+ Unlike compiled languages such as C, it is not necessary to specify
+ the data type of a \slang variable. The data type of a \slang
+ variable is determined upon assignment. For example, after
+ execution of the statements
+#v+
+ x = 3;
+ y = sin (5.6);
+ z = "I think, therefore I am.";
+#v-
+ \exmp{x} will be an integer, \exmp{y} will be a
+ double, and \exmp{z} will be a string. In fact, it is even possible
+ to re-assign \exmp{x} to a string:
+#v+
+ x = "x was an integer, but now is a string";
+#v-
+ Finally, one can combine variable declarations and assignments in
+ the same statement:
+#v+
+ variable x = 3, y = sin(5.6), z = "I think, therefore I am.";
+#v-
+
+ Most functions are declared using the \kw{define} keyword. A
+ simple example is
+#v+
+ define compute_average (x, y)
+ {
+ variable s = x + y;
+ return s / 2.0;
+ }
+#v-
+ which defines a function that simply computes the average of two
+ numbers and returns the result. This example shows that a function
+ consists of three parts: the function name, a parameter list, and
+ the function body.
+
+ The parameter list consists of a comma separated list of variable
+ names. It is not necessary to declare variables within a parameter
+ list; they are implicitly declared. However, all other \em{local}
+ variables used in the function must be declared. If the function
+ takes no parameters, then the parameter list must still be present,
+ but empty:
+#v+
+ define go_left_5 ()
+ {
+ go_left (5);
+ }
+#v-
+ The last example is a function that takes no arguments and returns
+ no value. Some languages such as PASCAL distinguish such objects
+ from functions that return values by calling these objects
+ \em{procedures}. However, \slang, like C, does not make such a
+ distinction.
+
+ The language permits \em{recursive} functions, i.e., functions that
+ call themselves. The way to do this in \slang is to first declare
+ the function using the form:
+\begin{tscreen}
+ define \em{function-name} ();
+\end{tscreen}
+ It is not necessary to declare a list of parameters when declaring a
+ function in this way.
+
+ Perhaps the most famous example of a recursive function is the factorial
+ function. Here is how to implement it using \slang:
+#v+
+ define factorial (); % declare it for recursion
+
+ define factorial (n)
+ {
+ if (n < 2) return 1;
+ return n * factorial (n - 1);
+ }
+#v-
+ This example also shows how to mix comments with code. \slang uses
+ the `\exmp{%}' character to start a comment and all characters from
+ the comment character to the end of the line are ignored.
+
+#%}}}
+
+\sect{Qualifiers}
+ \slang 2.1 introduced support for function qualifiers as a mechanism
+ for passing additional information to a function. For example,
+ consider a plotting application with a function
+#v+
+ define plot (x, y)
+ {
+ variable linestyle = qualifier ("linestyle", "solid");
+ variable color = qualifier ("color", "black");
+
+ sys_set_color (color);
+ sys_set_linestyle (linestyle);
+ sys_plot (x,y);
+ }
+#v-
+ Here the functions \exmp{sys_set_linestyle}, \exmp{sys_set_color},
+ and \exmp{sys_plot} are hypothetical low-level functions that
+ perform the actual work. This function may be called simply as
+#v+
+ x = 0:10:0.1;
+ plot (x, sin(x));
+#v-
+ to produce a solid black line connecting the points. Through the
+ use of qualifiers, the color or linestyle may be specified, e.g,,
+#v+
+ plot (x, sin(x); linestyle="dashed");
+#v-
+ would produce a ``dashed'' black curve, whereas
+#v+
+ plot (x, sin(x); linestyle="dotted", color="blue");
+#v-
+ would produce a blue ``dotted'' one.
+
+\sect{Strings} #%{{{
+
+ Perhaps the most appealing feature of any interpreted language is
+ that it frees the user from the responsibility of memory
+ management. This is particularly evident when contrasting how
+ \slang handles string variables with a lower level language such as
+ C. Consider a function that concatenates three strings. An
+ example in \slang is:
+#v+
+ define concat_3_strings (a, b, c)
+ {
+ return strcat (a, b, c);
+ }
+#v-
+ This function uses the built-in
+ \ifun{strcat} function for concatenating two or more strings. In C, the
+ simplest such function would look like:
+#v+
+ char *concat_3_strings (char *a, char *b, char *c)
+ {
+ unsigned int len;
+ char *result;
+ len = strlen (a) + strlen (b) + strlen (c);
+ if (NULL == (result = (char *) malloc (len + 1)))
+ exit (1);
+ strcpy (result, a);
+ strcat (result, b);
+ strcat (result, c);
+ return result;
+ }
+#v-
+ Even this C example is misleading since none of the issues of memory
+ management of the strings has been dealt with. The \slang language
+ hides all these issues from the user.
+
+ Binary operators have been defined to work with the string data
+ type. In particular the \var{+} operator may be used to perform
+ string concatenation. That is, one can use the
+ \var{+} operator as an alternative to \ifun{strcat}:
+#v+
+ define concat_3_strings (a, b, c)
+ {
+ return a + b + c;
+ }
+#v-
+ See \sectref{Strings} for more information about string variables.
+
+#%}}}
+
+\sect{Referencing and Dereferencing} #%{{{
+ The unary prefix operator, \var{&}, may be used to create a
+ \em{reference} to an object, which is similar to a pointer
+ in other languages. References are commonly used as a mechanism to
+ pass a function as an argument to another function as the following
+ example illustrates:
+#v+
+ define compute_functional_sum (funct)
+ {
+ variable i, s;
+
+ s = 0;
+ for (i = 0; i < 10; i++)
+ {
+ s += (@funct)(i);
+ }
+ return s;
+ }
+
+ variable sin_sum = compute_functional_sum (&sin);
+ variable cos_sum = compute_functional_sum (&cos);
+#v-
+ Here, the function \exmp{compute_functional_sum} applies the
+ function specified by the parameter \exmp{funct} to the first
+ 10 integers and returns the sum. The two statements
+ following the function definition show how the \var{sin} and
+ \var{cos} functions may be used.
+
+ Note the \var{@} operator in the definition of
+ \exmp{compute_functional_sum}. It is known as the \em{dereference}
+ operator and is the inverse of the reference operator.
+
+ Another use of the reference operator is in the context of the
+ \var{fgets} function. For example,
+#v+
+ define read_nth_line (file, n)
+ {
+ variable fp, line;
+ fp = fopen (file, "r");
+
+ while (n > 0)
+ {
+ if (-1 == fgets (&line, fp))
+ return NULL;
+ n--;
+ }
+ return line;
+ }
+#v-
+ uses the \var{fgets} function to read the nth line of a file.
+ In particular, a reference to the local variable \exmp{line} is
+ passed to \var{fgets}, and upon return \exmp{line} will be set to
+ the character string read by \var{fgets}.
+
+ Finally, references may be used as an alternative to multiple
+ return values by passing information back via the parameter list.
+ The example involving \var{fgets} presented above provided an
+ illustration of this. Another example is
+#v+
+ define set_xyz (x, y, z)
+ {
+ @x = 1;
+ @y = 2;
+ @z = 3;
+ }
+ variable X, Y, Z;
+ set_xyz (&X, &Y, &Z);
+#v-
+ which, after execution, results in \exmp{X} set to 1, \exmp{Y}
+ set to 2, and \exmp{Z} set to 3. A C programmer will
+ note the similarity of \exmp{set_xyz} to the following C
+ implementation:
+#v+
+ void set_xyz (int *x, int *y, int *z)
+ {
+ *x = 1;
+ *y = 2;
+ *z = 3;
+ }
+#v-
+#%}}}
+
+\sect{Arrays} #%{{{
+ The \slang language supports multi-dimensional arrays of all
+ datatypes. For example, one can define arrays of references to
+ functions as well as arrays of arrays. Here are a few examples of
+ creating arrays:
+#v+
+ variable A = Int_Type 10;
+ variable B = Int_Type 10, 3;
+ variable C = 1, 3, 5, 7, 9;
+#v-
+ The first example creates an array of 10 integers and assigns
+ it to the variable \exmp{A}. The second example creates a 2-d array
+ of 30 integers arranged in 10 rows and 3 columns
+ and assigns the result to \exmp{B}. In the last example, an array
+ of 5 integers is assigned to the variable \exmp{C}. However,
+ in this case the elements of the array are initialized to the
+ values specified. This is known as an \em{inline-array}.
+
+ \slang also supports something called a \em{range-array}. An
+ example of such an array is
+#v+
+ variable C = 1:9:2;
+#v-
+ This will produce an array of 5 integers running from 1 through 9
+ in increments of 2. Similarly \exmp{0:1:#1000} represents a 1000
+ element floating point array of numbers running from 0 to 1
+ (inclusive).
+
+ Arrays are passed by reference to functions and never by value.
+ This permits one to write functions that can initialize arrays.
+ For example,
+#v+
+ define init_array (a)
+ {
+ variable i, imax;
+
+ imax = length (a);
+ for (i = 0; i < imax; i++)
+ {
+ ai = 7;
+ }
+ }
+
+ variable A = Int_Type 10;
+ init_array (A);
+#v-
+ creates an array of 10 integers and initializes all its
+ elements to 7.
+
+ There are more concise ways of accomplishing the result of the
+ previous example. These include:
+#v+
+ A = 7, 7, 7, 7, 7, 7, 7, 7, 7, 7;
+ A = Int_Type 10; A0:9 = 7;
+ A = Int_Type 10; A* = 7;
+#v-
+ The second and third methods use an array of indices to index the array
+ \exmp{A}. In the second, the range of indices has been explicitly
+ specified, whereas the third example uses a wildcard form. See
+ chapter \ref{Arrays} for more information about array indexing.
+
+ Although the examples have pertained to integer arrays, the fact is
+ that \slang arrays can be of any type, e.g.,
+#v+
+ A = Double_Type 10;
+ B = Complex_Type 10;
+ C = String_Type 10;
+ D = Ref_Type 10;
+#v-
+ create 10 element arrays of double, complex, string, and
+ reference types, respectively. The last example may be used to
+ create an array of functions, e.g.,
+#v+
+ D0 = &sin;
+ D1 = &cos;
+#v-
+
+ \slang arrays also can be of \dtype{Any_Type}. An array of such a
+ type is capable of holding any object, e.g.,
+#v+
+ A = Any_Type 3;
+ A0 = 1; A1 = "string"; A2 = (1 + 2i);
+#v-
+ Dereferencing an \dtype{Any_Type} object returns the actual object. That
+ is, \exmp{@A1} produces \exmp{"string"}.
+
+ The language also defines unary, binary, and mathematical
+ operations on arrays. For example, if \exmp{A} and \exmp{B} are
+ integer arrays, then \exmp{A + B} is an array whose elements are
+ the sum of the elements of \exmp{A} and \exmp{B}. A trivial example
+ that illustrates the power of this capability is
+#v+
+ variable X, Y;
+ X = 0:2*PI:0.01;
+ Y = 20 * sin (X);
+#v-
+ which is equivalent to the highly simplified C code:
+#v+
+ double *X, *Y;
+ unsigned int i, n;
+
+ n = (2 * PI) / 0.01 + 1;
+ X = (double *) malloc (n * sizeof (double));
+ Y = (double *) malloc (n * sizeof (double));
+ for (i = 0; i < n; i++)
+ {
+ Xi = i * 0.01;
+ Yi = 20 * sin (Xi);
+ }
+#v-
+
+#%}}}
+
+\sect{Lists}
+
+ A \slang list is like an array except that it may contain a
+ heterogeneous collection of data, e.g.,
+#v+
+ my_list = { 3, 2.9, "foo", &sin };
+#v-
+ is a list of four objects, each with a different type. Like an
+ array, the elements of a list may be accessed via an index, e.g.,
+ \exmp{x=my_list2} will result in the assignment of \exmp{"foo"}
+ to \exmp{x}. The most important difference between an array and a
+ list is that an array's size is fixed whereas a list may grow or
+ shrink. Algorithms that require such a data structure may execute
+ many times faster when a list is used instead of an array.
+
+\sect{Structures and User-Defined Types} #%{{{
+
+ A \em{structure} is similar to an array in the sense that it is a
+ container object. However, the elements of an array must all be of
+ the same type (or of \dtype{Any_Type}), whereas a structure is
+ heterogeneous. As an example, consider
+#v+
+ variable person = struct
+ {
+ first_name, last_name, age
+ };
+ variable bill = @person;
+ bill.first_name = "Bill";
+ bill.last_name = "Clinton";
+ bill.age = 51;
+#v-
+ In this example a structure consisting of the three fields has been
+ created and assigned to the variable \exmp{person}. Then an
+ \em{instance} of this structure has been created using the
+ dereference operator and assigned to \exmp{bill}. Finally, the
+ individual fields of \exmp{bill} were initialized. This is an
+ example of an \em{anonymous} structure.
+
+ Note: \slang versions 2.1 and higher permit assignment statements
+ within the structure definition, e.g.,
+#v+
+ variable bill = struct
+ {
+ first_name = "Bill",
+ last_name = "Clinton",
+ age = 51
+ };
+#v-
+
+ A \em{named} structure is really a new data type and may be created
+ using the \kw{typedef} keyword:
+#v+
+ typedef struct
+ {
+ first_name, last_name, age
+ }
+ Person_Type;
+
+ variable bill = @Person_Type;
+ bill.first_name = "Bill";
+ bill.last_name = "Clinton";
+ bill.age = 51;
+#v-
+ One advantage of creating a new type is that array elements of such
+ types are automatically initialized to instances of the type. For
+ example,
+#v+
+ People = Person_Type 100;
+ People0.first_name = "Bill";
+ People1.first_name = "Hillary";
+#v-
+ may be used to create an array of 100 such objects and initialize
+ the \exmp{first_name} fields of the first two elements. In
+ contrast, the form using an anonymous would require a separate step
+ to instantiate the array elements:
+#v+
+ People = Struct_Type 100;
+ People0 = @person;
+ People0.first_name = "Bill";
+ People1 = @person;
+ People1.first_name = "Hillary";
+#v-
+
+ Another big advantage of a user-defined type is that the binary and
+ unary operators may be overloaded onto such types. This is
+ explained in more detail below.
+
+ The creation and initialization of a structure may be facilitated
+ by a function such as
+#v+
+ define create_person (first, last, age)
+ {
+ variable person = @Person_Type;
+ person.first_name = first;
+ person.last_name = last;
+ person.age = age;
+ return person;
+ }
+ variable Bill = create_person ("Bill", "Clinton", 51);
+#v-
+
+ Other common uses of structures is the creation of linked lists,
+ binary trees, etc. For more information about these and other
+ features of structures, see \sectref{Linked Lists}.
+
+#%}}}
+
+\sect{Namespaces}
+
+ The language supports namespaces that may be used to control the
+ scope and visibility of variables and functions. In addition to the
+ global or public namespace, each \slang source file or compilation
+ unit has a private or anonymous namespace associated with it. The
+ private namespace may be used to define symbols that are local to
+ the compilation unit and inaccessible from the outside. The
+ language also allows the creation of named (non-anonymous or static)
+ namespaces that permit access via the namespace operator. See
+ \chapterref{Namespaces} for more information.
+
+#%}}}
+
+\chapter{Data Types and Literal Constants} #%{{{
+
+ The current implementation of the \slang language permits up to 65535
+ distinct data types, including predefined data types such as integer and
+ floating point, as well as specialized application-specific data
+ types. It is also possible to create new data types in the
+ language using the \kw{typedef} mechanism.
+
+ Literal constants are objects such as the integer 3 or the
+ string \exmp{"hello"}. The actual data type given to a literal
+ constant depends upon the syntax of the constant. The following
+ sections describe the syntax of literals of specific data types.
+
+\sect{Predefined Data Types} #%{{{
+
+ The current version of \slang defines integer, floating point,
+ complex, and string types. It also defines special purpose data
+ types such as \dtype{Null_Type}, \dtype{DataType_Type}, and
+ \dtype{Ref_Type}. These types are discussed below.
+
+\sect1{Integers} #%{{{
+
+ The \slang language supports both signed and unsigned characters,
+ short integer, long integer, and long long integer types. On most 32
+ bit systems, there is no difference between an integer and a long
+ integer; however, they may differ on 16 and 64 bit systems.
+ Generally speaking, on a 16 bit system, plain integers are 16 bit
+ quantities with a range of -32767 to 32767. On a 32 bit system,
+ plain integers range from -2147483648 to 2147483647.
+
+ An plain integer \em{literal} can be specified in one of several ways:
+\begin{itemize}
+\item As a decimal (base 10) integer consisting of the characters
+ 0 through 9, e.g., 127. An integer specified
+ this way cannot begin with a leading 0. That is,
+ 0127 is \em{not} the same as 127.
+
+\item Using hexadecimal (base 16) notation consisting of the characters
+ 0 to 9 and \exmp{A} through \exmp{F}. The hexadecimal
+ number must be preceded by the characters \exmp{0x}. For example,
+ \exmp{0x7F} specifies an integer using hexadecimal notation and has
+ the same value as decimal 127.
+
+\item In Octal notation using characters 0 through 7. The Octal
+ number must begin with a leading 0. For example,
+ 0177 and 127 represent the same integer.
+
+\item In Binary notation using characters 0 and 1 with the \exmp{0b}
+ prefix. For example, 21 may be expressed in binary using
+ \exmp{0b10101}.
+\end{itemize}
+
+ Short, long, long long, and unsigned types may be specified by
+ using the proper suffixes: \exmp{L} indicates that the integer is a
+ long integer, \exmp{LL} indicates a long long integer, \exmp{h}
+ indicates that the integer is a short integer, and \exmp{U}
+ indicates that it is unsigned. For example, \exmp{1UL} specifies
+ an unsigned long integer.
+
+ Finally, a character literal may be specified using a notation
+ containing a character enclosed in single quotes as \exmp{'a'}.
+ The value of the character specified this way will lie in the
+ range 0 to 256 and will be determined by the ASCII value of the
+ character in quotes. For example,
+#v+
+ i = '0';
+#v-
+ assigns to \exmp{i} the character 48 since the \exmp{'0'} character
+ has an ASCII value of 48.
+
+ A ``wide'' character (unicode) may be specified using the form
+ '\\x{y...y}' where \exmp{y...y} are hexadecimal digits. For example,
+#v+
+ '\x{12F}' % Latin Small Letter I With Ogonek;
+ '\x{1D7BC}' % Mathematical Sans-Serif Bold Italic Small Sigma
+#v-
+
+ Any integer may be preceded by a minus sign to indicate that it is a
+ negative integer.
+
+#%}}}
+
+\sect1{Floating Point Numbers} #%{{{
+
+ Single and double precision floating point literals must contain either a
+ decimal point or an exponent (or both). Here are examples of
+ specifying the same double precision point number:
+#v+
+ 12. 12.0 12e0 1.2e1 120e-1 .12e2 0.12e2
+#v-
+ Note that 12 is \em{not} a floating point number since it
+ contains neither a decimal point nor an exponent. In fact,
+ 12 is an integer.
+
+ One may append the \exmp{f} character to the end of the number to
+ indicate that the number is a single precision literal. The
+ following are all single precision values:
+#v+
+ 12.f 12.0f 12e0f 1.2e1f 120e-1f .12e2f 0.12e2f
+#v-
+
+#%}}}
+
+\sect1{Complex Numbers} #%{{{
+
+ The language implements complex numbers as a pair of double
+ precision floating point numbers. The first number in the pair
+ forms the \em{real} part, while the second number forms the
+ \em{imaginary} part. That is, a complex number may be regarded as the
+ sum of a real number and an imaginary number.
+
+ Strictly speaking, the current implementation of the \slang does
+ not support generic complex literals. However, it does support
+ imaginary literals permitting a more generic complex number with a
+ non-zero real part to be constructed from the imaginary literal
+ via addition of a real number.
+
+ An imaginary literal is specified in the same way as a floating
+ point literal except that \exmp{i} or \exmp{j} is appended. For
+ example,
+#v+
+ 12i 12.0i 12e0j
+#v-
+ all represent the same imaginary number.
+
+ A more generic complex number may be constructed from an imaginary
+ literal via addition, e.g.,
+#v+
+ 3.0 + 4.0i
+#v-
+ produces a complex number whose real part is \exmp{3.0} and whose
+ imaginary part is \exmp{4.0}.
+
+ The intrinsic functions \var{Real} and \var{Imag} may be used to
+ retrieve the real and imaginary parts of a complex number,
+ respectively.
+
+#%}}}
+
+\labeled_sect1{Strings} #%{{{
+
+ A string literal must be enclosed in double quotes as in:
+#v+
+ "This is a string".
+#v-
+ As described below, the string literal may contain a suffix that
+ specifies how the string is to be interpreted, e.g., a string
+ literal such as
+#v+
+ "$HOME/.jedrc"$
+#v-
+ with the '$' suffix will be subject to variable name expansion.
+
+ Although there is no imposed limit on the length of a string,
+ single-line string literals must be less than 256 characters in
+ length. It is possible to construct strings longer than this by
+ string concatenation, e.g.,
+#v+
+ "This is the first part of a long string"
+ + " and this is the second part"
+#v-
+
+ \slang version 2.2 introduced support for multi-line string
+ literals. There are basic variants supported. The first makes
+ use of the backslash at the end of a line to indicate that the
+ string is continued onto the next line:
+#v+
+ "This is a \
+ multi-line string. \
+ Note the presence of the \
+ backslash character at the end \
+ of each of the lines."
+#v-
+ The second form of multiline string is delimited by the backquote
+ character (`) and does not require backslashes:
+#v+
+ `This form does not
+ require backslash characters.
+ In fact, here the backslash
+ character \ has no special
+ meaning (unless given the ``Q' suffix`
+#v-
+ Note that if a backquote is to appear in such a string, then it
+ must be doubled, as illustrated in the above example.
+
+ Any character except a newline (ASCII 10) or the null character
+ (ASCII 0) may appear explicitly in a string literal. However,
+ these characters may embedded implicitly using the mechanism
+ described below.
+
+ The backslash character is a special character and is used to
+ include other special characters (such as a newline character) in
+ the string. The special characters recognized are:
+#v+
+ \" -- double quote
+ \' -- single quote
+ \\ -- backslash
+ \a -- bell character (ASCII 7)
+ \t -- tab character (ASCII 9)
+ \n -- newline character (ASCII 10)
+ \e -- escape character (ASCII 27)
+ \xhh -- byte expressed in HEXADECIMAL notation
+ \ooo -- byte expressed in OCTAL notation
+ \dnnn -- byte expressed in DECIMAL
+ \u{h..h} -- the Unicode character U+h..h
+ \x{h..h} -- the Unicode character U+h..h modal
+#v-
+ In the above table, \tt{h} represents one of the HEXADECIMAL
+ characters from the set \em{0-9A-Fa-f}. It is important to
+ understand the distinction between the \exmp{\\x\{h..h\}} and
+ \exmp{\\u\{h..h\}} forms. When used in a string, the \exmp{\\u}
+ form always expands to the corresponding UTF-8 sequence regardless
+ of the UTF-8 mode. In contrast, when in non-UTF-8 mode, the
+ \exmp{\\x} form expands to a byte when given two hex characters,
+ or to the corresponding UTF-8 sequence when used with three or
+ more hex characters.
+
+ For example, to include the double quote character as part of the
+ string, it must be preceded by a backslash character, e.g.,
+#v+
+ "This is a \"quote\"."
+#v-
+ Similarly, the next example illustrates how a newline character
+ may be included:
+#v+
+ "This is the first line\nand this is the second."
+#v-
+ Alternatively, slang-2.2 or newer permits
+#v+
+ `This is a "quote".`
+ `This is the first line
+ and this is the second.`
+#v-
+
+\sect2{Suffixes}
+ A string literal may be contain a suffix that specifies how the
+ string is to be interpreted. The suffix may consist of one or
+ more of the following characters:
+\begin{descrip}
+ \tag{R}
+ Backslash substitution will not be performed on the string.
+ This is the default when using back-quoted strings.
+ \tag{Q}
+ Backslash substitution will be performed on the string. This
+ is the default when using strings using the double-quote
+ character.
+ \tag{B}
+ If this suffix is present, the string will be interpreted as a
+ binary string (BString_Type).
+ \tag{$}
+ Variable name substitution will be performed on the string.
+\end{descrip}
+
+ Not all combinations of the above controls characters are
+ supported, nor make sense. For example, a string with the suffix
+ \exmp{QR} will cause a parse-error because \exmp{Q} and \exmp{R}
+ have opposing meanings.
+
+\sect3{The Q and R suffixes}
+ These suffixes turn on and off backslash expansion. Unless the
+ \exmp{R} suffix is present, all double-quoted string literals will
+ have backslash substitution performed. By default, backslash
+ expansion is turned off for backquoted strings.
+
+ Sometimes it is desirable to turn off backslash expansion for
+ double-quoted strings. For example, pathnames on an MSDOS or
+ Windows system use the backslash character as a path separator. The
+ \exmp{R} prefix turns off backslash expansion, and as a result the
+ following statements are equivalent:
+#v+
+ file = "C:\\windows\\apps\\slrn.rc";
+ file = "C:\\windows\\apps\\slrn.rc"Q;
+ file = "C:\windows\apps\slrn.rc"R;
+ file = `C:\windows\apps\slrn.rc`; % slang-2.2 and above
+#v-
+ The only exception is that a backslash character is not permitted
+ as the last character of a string with the \exmp{R} suffix. That is,
+#v+
+ string = "This is illegal\"R;
+#v-
+ is not permitted. Without this exception, a string such as
+#v+
+ string = "Some characters: \"R, S, T\"";
+#v-
+ would not be parsed properly.
+
+\sect3{The $ suffix}
+ If the string contains the \exmp{$} suffix, then variable name
+ expansion will be performed upon names prefixed by a \exmp{$}
+ character occurring within the string, e.g.,
+#v+
+ "The value of X is $X and the value of Y is $Y"$.
+#v-
+ with variable name substitution to be performed on the
+ names \exmp{X} and \exmp{Y}. Such strings may be used as a
+ convenient alternative to the \ifun{sprintf} function.
+
+ Name expansion is carried out according to the following rules: If
+ the string literal occurs in a function, and the name corresponds
+ to a variable local to the function, then the string representation
+ of the value of that variable will be substituted. Otherwise, if
+ the name corresponds to a variable that is local to the compilation
+ unit (i.e., is declared as static or private), then its value's
+ string representation will be used. Otherwise, if the name
+ corresponds to a variable that exists as a global (public) then its
+ value's string representation will be substituted. If the above
+ searches fail and the name exists in the environment, then the
+ value of the corresponding environment variable will be used.
+ Otherwise, the variable will expand to the empty string.
+
+ Consider the following example:
+#v+
+ private variable bar = "two";
+ putenv ("MYHOME=/home/baz");
+ define funct (foo)
+ {
+ variable bar = 1;
+ message ("file: $MYHOME/foo: garage=$MYGARAGE,bar=$bar"$);
+ }
+#v-
+ When executed, this will produce the message:
+#v+
+ file: /home/baz/foo: garage=,bar=1
+#v-
+ assuming that \exmp{MYGARAGE} is not defined anywhere.
+
+ A name may be enclosed in braces. For example,
+#v+
+ "${MYHOME}/foo: bar=${bar}"$
+#v-
+ This is useful in cases when the name is followed immediately by
+ other characters that may be interpreted as part of the name, e.g.,
+#v+
+ variable HELLO="Hello ";
+ message ("${HELLO}World"$);
+#v-
+ will produce the message "Hello World".
+
+#%}}}
+
+\sect1{Null_Type}
+
+ Objects of type \dtype{Null_Type} can have only one value:
+ \NULL. About the only thing that you can do with this data
+ type is to assign it to variables and test for equality with
+ other objects. Nevertheless, \var{Null_Type} is an important and
+ extremely useful data type. Its main use stems from the fact that
+ since it can be compared for equality with any other data type, it
+ is ideal to represent the value of an object which does not yet
+ have a value, or has an illegal value.
+
+ As a trivial example of its use, consider
+#v+
+ define add_numbers (a, b)
+ {
+ if (a == NULL) a = 0;
+ if (b == NULL) b = 0;
+ return a + b;
+ }
+ variable c = add_numbers (1, 2);
+ variable d = add_numbers (1, NULL);
+ variable e = add_numbers (1,);
+ variable f = add_numbers (,);
+#v-
+ It should be clear that after these statements have been executed,
+ \exmp{c} will have a value of 3. It should also be clear
+ that \exmp{d} will have a value of 1 because \NULL has
+ been passed as the second parameter. One feature of the language
+ is that if a parameter has been omitted from a function call, the
+ variable associated with that parameter will be set to \NULL.
+ Hence, \exmp{e} and \exmp{f} will be set to 1 and 0,
+ respectively.
+
+ The \dtype{Null_Type} data type also plays an important role in the
+ context of \em{structures}.
+
+\sect1{Ref_Type}
+ Objects of \dtype{Ref_Type} are created using the unary
+ \em{reference} operator \var{&}. Such objects may be
+ \em{dereferenced} using the dereference operator \var{@}. For
+ example,
+#v+
+ sin_ref = &sin;
+ y = (@sin_ref) (1.0);
+#v-
+ creates a reference to the \ifun{sin} function and assigns it to
+ \exmp{sin_ref}. The second statement uses the dereference operator
+ to call the function that \exmp{sin_ref} references.
+
+ The \dtype{Ref_Type} is useful for passing functions as arguments to
+ other functions, or for returning information from a function via
+ its parameter list. The dereference operator may also used to create
+ an instance of a structure. For these reasons, further discussion
+ of this important type can be found in \sectref{Referencing Variables}.
+
+\sect1{Array_Type, Assoc_Type, List_Type, and Struct_Type}
+
+ Variables of type \dtype{Array_Type}, \dtype{Assoc_Type},
+ \dtype{List_Type}, and \dtype{Struct_Type} are known as
+ \em{container objects}. They are more complicated than the
+ simple data types discussed so far and each obeys a special syntax.
+ For these reasons they are discussed in a separate chapters.
+
+\sect1{DataType_Type Type} #%{{{
+
+ \slang defines a type called \dtype{DataType_Type}. Objects of
+ this type have values that are type names. For example, an integer
+ is an object of type \dtype{Integer_Type}. The literals of
+ \dtype{DataType_Type} include:
+#v+
+ Char_Type (signed character)
+ UChar_Type (unsigned character)
+ Short_Type (short integer)
+ UShort_Type (unsigned short integer)
+ Integer_Type (plain integer)
+ UInteger_Type (plain unsigned integer)
+ Long_Type (long integer)
+ ULong_Type (unsigned long integer)
+ LLong_Type (long long integer)
+ ULLong_Type (unsigned long long integer)
+ Float_Type (single precision real)
+ Double_Type (double precision real)
+ Complex_Type (complex numbers)
+ String_Type (strings, C strings)
+ BString_Type (binary strings)
+ Struct_Type (structures)
+ Ref_Type (references)
+ Null_Type (NULL)
+ Array_Type (arrays)
+ Assoc_Type (associative arrays/hashes)
+ List_Type (lists)
+ DataType_Type (data types)
+#v-
+ as well as the names of any other types that an application
+ defines.
+
+ The built-in function \var{typeof} returns the data type of
+ its argument, i.e., a \dtype{DataType_Type}. For instance
+ \exmp{typeof(7)} returns \dtype{Integer_Type} and
+ \var{typeof(Integer_Type)} returns \dtype{DataType_Type}. One can use this
+ function as in the following example:
+#v+
+ if (Integer_Type == typeof (x)) message ("x is an integer");
+#v-
+ The literals of \dtype{DataType_Type} have other uses as well. One
+ of the most common uses of these literals is to create arrays, e.g.,
+#v+
+ x = Complex_Type 100;
+#v-
+ creates an array of 100 complex numbers and assigns it to
+ \exmp{x}.
+#%}}}
+
+\sect1{Boolean Type}
+
+ Strictly speaking, \slang has no separate boolean type; rather it
+ represents boolean values as \dtype{Char_Type} objects. In
+ particular, boolean FALSE is equivalent to \dtype{Char_Type} 0,
+ and TRUE as any non-zero \dtype{Char_Type} value. Since the
+ exact value of TRUE is unspecified, it is unnecessary and even
+ pointless to define TRUE and FALSE literals in \slang.
+
+#%}}}
+
+\sect{Typecasting: Converting from one Type to Another}
+
+ Occasionally, it is necessary to convert from one data type to
+ another. For example, if you need to print an object as a string,
+ it may be necessary to convert it to a \dtype{String_Type}. The
+ \var{typecast} function may be used to perform such conversions.
+ For example, consider
+#v+
+ variable x = 10, y;
+ y = typecast (x, Double_Type);
+#v-
+ After execution of these statements, \exmp{x} will have the integer
+ value 10 and \exmp{y} will have the double precision floating
+ point value \exmp{10.0}. If the object to be converted is an
+ array, the \var{typecast} function will act upon all elements of
+ the array. For example,
+#v+
+ x = 1:10; % Array of integers
+ y = typecast (x, Double_Type);
+#v-
+ will create an array of 10 double precision values and assign it to
+ \exmp{y}. One should also realize that it is not always possible
+ to perform a typecast. For example, any attempt to convert an
+ \dtype{Integer_Type} to a \dtype{Null_Type} will result in a
+ run-time error. Typecasting works only when datatypes are similar.
+
+ Often the interpreter will perform implicit type conversions as necessary
+ to complete calculations. For example, when multiplying an
+ \var{Integer_Type} with a \var{Double_Type}, it will convert the
+ \var{Integer_Type} to a \var{Double_Type} for the purpose of the
+ calculation. Thus, the example involving the conversion of an
+ array of integers to an array of doubles could have been performed
+ by multiplication by \exmp{1.0}, i.e.,
+#v+
+ x = 1:10; % Array of integers
+ y = 1.0 * x;
+#v-
+
+ The \ifun{string} intrinsic function should be used whenever a
+ string representation is needed. Using the \ifun{typecast} function
+ for this purpose will usually fail unless the object to be
+ converted is similar to a string--- most are not. Moreover, when
+ typecasting an array to \dtype{String_Type}, the \ifun{typecast}
+ function acts on each element of the array to produce another
+ array, whereas the \ifun{string} function will produce a string.
+
+ One use of \ifun{string} function is to print the value of an
+ object. This use is illustrated in the following simple example:
+#v+
+ define print_object (x)
+ {
+ message (string (x));
+ }
+#v-
+ Here, the \ifun{message} function has been used because it writes a
+ string to the display. If the \ifun{string} function was not used
+ and the \ifun{message} function was passed an integer, a
+ type-mismatch error would have resulted.
+
+#%}}}
+
+\labeled_chapter{Identifiers} #%{{{
+
+ The names given to variables, functions, and data types are called
+ \em{identifiers}. There are some restrictions upon the actual
+ characters that make up an identifier. An identifier name must
+ start with an alphabetic character (\exmp{A-Za-z}), an underscore
+ character, or a dollar sign. The rest of the characters in the
+ name can be any combination of letters, digits, dollar signs, or
+ underscore characters. However, all identifiers whose name begins
+ with two underscore characters are reserved for internal use by the
+ interpreter and declarations of objects with such names should be
+ avoided.
+
+ Examples of valid identifiers include:
+#v+
+ mary _3 _this_is_ok
+ a7e1 $44 _44$_Three
+#v-
+ However, the following are not legal:
+#v+
+ 7abc 2e0 #xx
+#v-
+ In fact, \exmp{2e0} actually specifies the double precision number
+ \exmp{2.0}.
+
+ There is no limit to the maximum length of an identifier. For
+ practical usage it is wise to limit the length of identifiers to a
+ reasonable value.
+
+ The following identifiers are reserved by the language for use as
+ keywords:
+#v+
+ and andelse break case catch
+ continue define do else ERROR_BLOCK
+ exch EXIT_BLOCK finally _for for
+ foreach forever !if if ifnot
+ loop mod not or orelse
+ pop private public return shl
+ shr static struct switch __tmp
+ then throw try typedef USER_BLOCK0
+ USER_BLOCK1 USER_BLOCK2 USER_BLOCK3 USER_BLOCK4 using
+ variable while xor
+#v-
+
+#%}}}
+
+\labeled_chapter{Variables} #%{{{
+
+ As many of the preceding examples have shown, a variable must be
+ declared before it can be used, otherwise an undefined name error
+ will be generated. A variable is declared using the \kw{variable}
+ keyword, e.g,
+#v+
+ variable x, y, z;
+#v-
+ declares three variables, \exmp{x}, \exmp{y}, and \exmp{z}. This
+ is an example of a variable declaration statement, and like all
+ statements, it must end in a semicolon.
+
+ Variables declared this way are untyped and inherit a type upon
+ assignment. As such, type-checking of function arguments, etc is
+ performed at run-time. For example,
+#v+
+ x = "This is a string";
+ x = 1.2;
+ x = 3;
+ x = 2i;
+#v-
+ results in x being set successively to a string, a float, an
+ integer, and to a complex number (\exmp{0+2i}). Any attempt to use
+ a variable before it has acquired a type will result in an
+ uninitialized variable error.
+
+ It is legal to put executable code in a variable declaration list.
+ That is,
+#v+
+ variable x = 1, y = sin (x);
+#v-
+ are legal variable declarations. This also provides a convenient way
+ of initializing a variable.
+
+ Variables are classified as either \em{global} or \em{local}. A
+ variable declared inside a function is said to be local and has no
+ meaning outside the function. A variable is said to be global if
+ it was declared outside a function. Global variables are further
+ classified as being \var{public}, \var{static}, or \var{private},
+ according to the namespace where they were defined. See
+ \chapterref{Namespaces} for more information about namespaces.
+
+ The following global variables are predefined by the language and
+ live in the \var{public} namespace. They are mainly used as
+ convenience variables:
+#v+
+ $0 $1 $2 $3 $4 $5 $6 $7 $8 $9
+#v-
+
+ An \em{intrinsic} variable is another type of global variable.
+ Such variables have a definite type which cannot be altered.
+ Variables of this type may also be defined to be read-only, or
+ constant variables. An example of an intrinsic variable is
+ \var{PI} which is a read-only double precision variable with a value
+ of approximately \exmp{3.14159265358979323846}.
+
+#%}}}
+
+\chapter{Operators} #%{{{
+
+ \slang supports a variety of operators that are grouped into three
+ classes: assignment operators, binary operators, and unary operators.
+
+ An assignment operator is used to assign a value to a variable.
+ They will be discussed more fully in the context of the assignment
+ statement in \sectref{Assignment Statements}.
+
+ An unary operator acts only upon a single quantity while a binary
+ operation is an operation between two quantities. The boolean
+ operator \kw{not} is an example of an unary operator. Examples of
+ binary operators include the usual arithmetic operators
+ \var{+}, \var{-}, \var{*}, and \var{/}. The operator given by
+ \var{-} can be either an unary operator (negation) or a binary operator
+ (subtraction); the actual operation is determined from the context
+ in which it is used.
+
+ Binary operators are used in algebraic forms, e.g., \exmp{a + b}.
+ Unary operators fall into one of two classes: postfix-unary or
+ prefix-unary. For example, in the expression \exmp{-x}, the minus
+ sign is a prefix-unary operator.
+
+ All binary and unary operators may be defined for any supported
+ data type. For example, the arithmetic plus operator has been
+ extended to the \dtype{String_Type} data type to permit
+ concatenation between strings. But just because it is possible to
+ define the action of an operator upon a data type, it does not mean
+ that all data types support all the binary and unary operators.
+ For example, while \dtype{String_Type} supports the \var{+}
+ operator, it does not admit the \var{*} operator.
+
+\sect{Unary Operators} #%{{{
+
+ The \bf{unary} operators operate only upon a single operand. They
+ include: \kw{not}, \var{~}, \var{-}, \var{@}, \var{&}, as well as the
+ increment and decrement operators \var{++} and \var{--},
+ respectively.
+
+ The boolean operator \kw{not} acts only upon integers and produces
+ \var{0} if its operand is non-zero, otherwise it produces 1.
+
+ The bit-level not operator \var{~} performs a similar function,
+ except that it operates on the individual bits of its integer
+ operand.
+
+ The arithmetic negation operator \var{-} is perhaps the most
+ well-known unary operator. It simply reverses the sign of its
+ operand.
+
+ The reference (\var{&}) and dereference (\var{@}) operators will be
+ discussed in greater detail in \sectref{Referencing Variables}.
+ Similarly, the increment (\var{++}) and decrement (\var{--})
+ operators will be discussed in the context of the assignment
+ operator.
+
+#%}}}
+
+\sect{Binary Operators} #%{{{
+
+ The binary operators may be grouped according to several classes:
+ arithmetic operators, relational operators, boolean operators, and
+ bitwise operators.
+
+\sect1{Arithmetic Operators} #%{{{
+
+ The arithmetic operators include \var{+}, \var{-}, \var{*}, and \var{/},
+ which perform addition, subtraction, multiplication, and division,
+ respectively. In addition to these, \slang supports the \var{mod}
+ operator, which divides two numbers and produces the remainder, as
+ as well as the power operator \var{^}.
+
+ The data type of the result produced by the use of one of these
+ operators depends upon the data types of the binary participants.
+ If they are both integers, the result will be an integer. However,
+ if the operands are not of the same type, they will be converted to
+ a common type before the operation is performed. For example, if
+ one is a floating point type and the other is an integer, the
+ integer will be converted to a float. In general, the promotion
+ from one type to another is such that no information is lost, if
+ possible. As an example, consider the expression \exmp{8/5} which
+ indicates division of the integer 8 by the integer 5.
+ The result will be the integer 1 and \em{not} the floating
+ point value \exmp{1.6}. However, \exmp{8/5.0} will produce
+ \exmp{1.6} because \exmp{5.0} is a floating point number.
+
+#% TODO: Add something about precedence. Also explain that some
+#% types are always promoted to ints for arithmetic, e.g., Char+Char
+#% != Char
+
+#%}}}
+
+\sect1{Relational Operators} #%{{{
+
+ The relational operators are \var{>}, \var{>=}, \var{<}, \var{<=},
+ \var{==}, and \var{!=}. These perform the comparisons greater
+ than, greater than or equal, less than, less than or equal, equal,
+ and not equal, respectively. For most data types, the result of
+ the comparison will be a boolean value; however, for arrays the
+ result will be an array of boolean values. The section on arrays
+ will explain this is greater detail.
+
+ Note: For \slang versions 2.1 and higher, relational expressions
+ such as \exmp{a<b<=c} are defined in the mathematical sense, i.e.,
+#v+
+ ((a < b) and (b <= c))
+#v-
+ Simarily, \exmp{(a < b <= c < d)} is the same as
+#v+
+ ((a < b) and (b <= c) and (c < d))
+#v-
+ and so on. In previous versions of \slang, \exmp{(a<b<c)} meant
+ \exmp{(a<b)<c}; however this interpretation was not very useful.
+
+#%}}}
+
+\sect1{Boolean Operators} #%{{{
+
+ \slang supports four boolean binary operators: \exmp{or},
+ \exmp{and}, \exmp{||}, and \exmp{&&}, which for most data types,
+ return a boolean result. In particular, the \exmp{or} and
+ \exmp{||} operators return a non-zero value (boolean TRUE) if
+ either of their operands are non-zero, otherwise they produce zero
+ (boolean FALSE). The \exmp{and} and \exmp{&&} operators produce a
+ non-zero value if and only if both their operands are non-zero,
+ otherwise they produce zero.
+
+ Unlike the operators \exmp{&&} and \exmp{||}, the \exmp{and} and
+ \exmp{or} operators do not perform the so-called boolean
+ short-circuit evaluation. For example, consider the expression:
+#v+
+ (x != 0) and (1/x > 10)
+#v-
+ Here, if \exmp{x} were to have a value of zero, a division by zero error
+ would occur because even though \exmp{x!=0} evaluates to zero, the
+ \var{and} operator is not short-circuited and the \exmp{1/x} expression
+ would still be evaluated. This problem can be avoided using the
+ short-circuiting \exmp{&&} operator:
+#v+
+ (x != 0) && (1/x > 10)
+#v-
+ Another difference between the short-circuiting (\exmp{&&,||}) and
+ the non-short-circuiting operators (\exmp{and,or}) is that the
+ short-circuiting forms work only with integer or boolean types. In
+ contrast, if either of the operands of the \exmp{and} or \exmp{or}
+ operators is an array then a corresponding array of boolean values
+ will result. This is explained in more detail in the section on
+ arrays.
+
+ Note: the short-circuiting operators \exmp{&&} and \exmp{||} were
+ first introduced in \slang 2.1; they are not available in older
+ versions.
+
+#%}}}
+
+\sect1{Bitwise Operators} #%{{{
+
+ The bitwise binary operators are currently defined for integer operands
+ and are used for bit-level operations. Operators that fall in this
+ class include \var{&}, \var{|}, \var{shl}, \var{shr}, and
+ \var{xor}. The \var{&} operator performs a boolean AND operation
+ between the corresponding bits of the operands. Similarly, the
+ \var{|} operator performs the boolean OR operation on the bits.
+ The bit-shifting operators \var{shl} and \var{shr} shift the bits
+ of the first operand by the number given by the second operand to
+ the left or right, respectively. Finally, the \var{xor} performs
+ an EXCLUSIVE-OR operation.
+
+ These operators are commonly used to manipulate variables whose
+ individual bits have distinct meanings. In particular, \var{&} is
+ usually used to test bits, \var{|} can be used to set bits, and
+ \var{xor} may be used to flip a bit.
+
+ As an example of using \var{&} to perform tests on bits, consider
+ the following: The \jed text editor stores some of the information
+ about a buffer in a bitmapped integer variable. The value of this
+ variable may be retrieved using the \jed intrinsic function
+ \exmp{getbuf_info}, which actually returns four quantities: the
+ buffer flags, the name of the buffer, directory name, and file
+ name. For the purposes of this section, only the buffer flags are
+ of interest and can be retrieved via a function such as
+#v+
+ define get_buffer_flags ()
+ {
+ variable flags;
+ (,,,flags) = getbuf_info ();
+ return flags;
+ }
+#v-
+ The buffer flags object is a bitmapped quantity where the 0th bit
+ indicates whether or not the buffer has been modified, the first
+ bit indicates whether or not autosave has been enabled for the
+ buffer, and so on. Consider for the moment the task of determining
+ if the buffer has been modified. This can be determined by looking
+ at the zeroth bit: if it is 0 the buffer has not been
+ modified, otherwise it has been modified. Thus we can create the
+ function,
+#v+
+ define is_buffer_modified ()
+ {
+ variable flags = get_buffer_flags ();
+ return (flags & 1);
+ }
+#v-
+ where the integer 1 has been used since it is represented as
+ an object with all bits unset, except for the zeroth one, which is
+ set. (At this point, it should also be apparent that bits are
+ numbered from zero, thus an 8 bit integer consists of bits
+ 0 to 7, where 0 is the least significant bit
+ and 7 is the most significant one.) Similarly, we can create
+ another function
+#v+
+ define is_autosave_on ()
+ {
+ variable flags = get_buffer_flags ();
+ return (flags & 2);
+ }
+#v-
+ to determine whether or not autosave has been turned on for the
+ buffer.
+
+ The \var{shl} operator may be used to form the integer with only
+ the \em{nth} bit set. For example, \exmp{1 shl 6} produces an
+ integer with all bits set to zero except the sixth bit, which is
+ set to one. The following example exploits this fact:
+#v+
+ define test_nth_bit (flags, nth)
+ {
+ return flags & (1 shl nth);
+ }
+#v-
+
+#%}}}
+
+\sect1{The Namespace Operator}
+
+ The operator \var{->} is used to in conjunction with a
+ namespace to access an object within the namespace. For example,
+ if \exmp{A} is the name of a namespace containing the variable
+ \exmp{v}, then \exmp{A->v} refers to that variable. Namespaces are
+ discussed more fully in \chapterref{Namespaces}.
+
+\sect1{Operator Precedence}
+
+\sect1{Binary Operators and Functions Returning Multiple Values} #%{{{
+
+ Care must be exercised when using binary operators with an operand
+ that returns multiple values. In fact, the current implementation
+ of the \slang language will produce incorrect results if both
+ operands of a binary expression return multiple values. \em{At
+ most, only one of operands of a binary expression can return
+ multiple values, and that operand must be the first one, not the
+ second.} For example,
+#v+
+ define read_line (fp)
+ {
+ variable line, status;
+
+ status = fgets (&line, fp);
+ if (status == -1)
+ return -1;
+ return (line, status);
+ }
+#v-
+ defines a function, \exmp{read_line} that takes a single argument
+ specifying a handle to an open file, and returns one or two values,
+ depending upon the return value of \var{fgets}. Now consider
+#v+
+ while (read_line (fp) > 0)
+ {
+ text = ();
+ % Do something with text
+ .
+ .
+ }
+#v-
+ Here the relational binary operator \var{>} forms a comparison
+ between one of the return values (the one at the top of the stack)
+ and 0. In accordance with the above rule, since \exmp{read_line}
+ returns multiple values, it must occur as the left binary operand.
+ Putting it on the right as in
+#v+
+ while (0 < read_line (fp)) % Incorrect
+ {
+ text = ();
+ % Do something with text
+ .
+ .
+ }
+#v-
+ violates the rule and will result in the wrong answer. For this
+ reason, one should avoid using a function that returns muliple
+ return values as a binary operand.
+
+#%}}}
+
+#%}}}
+
+\sect{Mixing Integer and Floating Point Arithmetic}
+
+ If a binary operation (\var{+}, \var{-}, \var{*} , \var{/}) is
+ performed on two integers, the result is an integer. If at least
+ one of the operands is a floating point value, the other will be
+ converted to a floating point value, and a floating point result
+ be produced. For example:
+#v+
+ 11 / 2 --> 5 (integer)
+ 11 / 2.0 --> 5.5 (double)
+ 11.0 / 2 --> 5.5 (double)
+ 11.0 / 2.0 --> 5.5 (double)
+#v-
+
+ Sometimes to achive the desired result, it is necessary to
+ explicitly convert from one data type to another. For example,
+ suppose that \exmp{a} and \exmp{b} are integers, and that one wants
+ to compute \exmp{a/b} using floating point arithmetic. In such a
+ case, it is necessary to convert at least one of the operands to a
+ floating point value using, e.g., the \ifun{double} function:
+#v+
+ x = a/double(b);
+#v-
+
+\sect{Short Circuit Boolean Evaluation}
+
+ \bf{
+ As of \slang version 2.1, use of the \exmp{andelse} and
+ \exmp{orelse} have been deprecated in favor of the \exmp{&&} and
+ \exmp{||} short-circuiting operators.
+ }
+
+ The boolean operators \var{or} and \var{and} \em{are not short
+ circuited} as they are in some languages. \slang uses \var{orelse}
+ and \var{andelse} expressions for short circuit boolean evaluation.
+ However, these are not binary operators. Expressions of the form:
+\begin{tscreen}
+ \em{expr-1} and \em{expr-2} and ... \em{expr-n}
+\end{tscreen}
+ can be replaced by the short circuited version using \var{andelse}:
+\begin{tscreen}
+ andelse {\em{expr-1}} {\em{expr-2}} ... {\em{expr-n}}
+\end{tscreen}
+ A similar syntax holds for the \var{orelse} operator. For example, consider
+ the statement:
+#v+
+ if ((x != 0) and (1/x > 10)) do_something ();
+#v-
+ Here, if \exmp{x} were to have a value of zero, a division by zero error
+ would occur because even though \exmp{x!=0} evaluates to zero, the
+ \var{and} operator is not short circuited and the \exmp{1/x} expression
+ would be evaluated causing division by zero. For this case, the
+ \var{andelse} expression could be used to avoid the problem:
+#v+
+ if (andelse
+ {x != 0}
+ {1 / x > 10}) do_something ();
+#v-
+
+#%}}}
+
+\chapter{Statements} #%{{{
+
+ Loosely speaking, a \em{statement} is composed of \em{expressions}
+ that are grouped according to the syntax or grammar of the language
+ to express a complete computation. A semicolon is used to denote
+ the end of a statement.
+
+ A statement that occurs within a function is executed only during
+ execution of the function. However, statements that occur outside
+ the context of a function are evaluated immediately.
+
+ The language supports several different types of statements such as
+ assignment statements, conditional statements, and so forth. These
+ are described in detail in the following sections.
+
+\sect{Variable Declaration Statements}
+ Variable declarations were already discussed in
+ \chapterref{Variables}. For the sake of completeness, a variable
+ declaration is a statement of the form
+\begin{tscreen}
+ variable \em{variable-declaration-list} ;
+\end{tscreen}
+ where the \em{variable-declaration-list} is a comma separated list
+ of one or more variable names with optional initializations, e.g.,
+#v+
+ variable x, y = 2, z;
+#v-
+\labeled_sect{Assignment Statements} #%{{{
+
+ Perhaps the most well known form of statement is the \em{assignment
+ statement}. Statements of this type consist of a left-hand side,
+ an assignment operator, and a right-hand side. The left-hand side
+ must be something to which an assignment can be performed. Such
+ an object is called an \em{lvalue}.
+
+ The most common assignment operator is the simple assignment
+ operator \var{=}. Examples of its use include
+#v+
+ x = 3;
+ x = some_function (10);
+ x = 34 + 27/y + some_function (z);
+ x = x + 3;
+#v-
+ In addition to the simple assignment operator, \slang
+ also supports the binary assignment operators:
+#v+
+ += -= *= /= &= |=
+#v-
+ Internally, \slang transforms
+#v+
+ a += b;
+#v-
+ to
+#v+
+ a = a + b;
+#v-
+ Likewise \exmp{a-=b} is transformed to \exmp{a=a-b}, \exmp{a*=b} is
+ transformed to \exmp{a=a*b}, and so on.
+
+ It is extremely important to realize that, in general, \exmp{a+b}
+ is not equal to \exmp{b+a}. For example if \exmp{a} and \exmp{b}
+ are strings, then \exmp{a+b} will be the string resulting from the
+ concatenation of \exmp{a} and \exmp{b}, which generally is not he
+ same as the concatenation of \exmp{b} with \exmp{a}. This means
+ that \exmp{a+=b} may not be the same as \exmp{a=b+a}, as the
+ following example illustrates:
+#v+
+ a = "hello"; b = "world";
+ a += b; % a will become "helloworld"
+ c = b + a; % c will become "worldhelloworld"
+#v-
+
+ Since adding or subtracting 1 from a variable is quite
+ common, \slang also supports the unary increment and decrement
+ operators \exmp{++}, and \exmp{--}, respectively. That is, for
+ numeric data types,
+#v+
+ x = x + 1;
+ x += 1;
+ x++;
+#v-
+ are all equivalent. Similarly,
+#v+
+ x = x - 1;
+ x -= 1;
+ x--;
+#v-
+ are also equivalent.
+
+ Strictly speaking, \var{++} and \var{--} are unary operators. When
+ used as \var{x++}, the \var{++} operator is said to be a
+ \em{postfix-unary} operator. However, when used as \var{++x} it is
+ said to be a \em{prefix-unary} operator. The current
+ implementation does not distinguish between the two forms, thus
+ \exmp{x++} and \exmp{++x} are equivalent. The reason for this
+ equivalence is \em{that assignment expressions do not return a value in
+ the \slang language} as they do in C. Thus one should exercise care
+ and not try to write C-like code such as
+#v+
+ x = 10;
+ while (--x) do_something (x); % Ok in C, but not in S-Lang
+#v-
+ The closest valid \slang form involves a \em{comma-expression}:
+#v+
+ x = 10;
+ while (x--, x) do_something (x); % Ok in S-Lang and in C
+#v-
+
+ \slang also supports a \em{multiple-assignment} statement. It is
+ discussed in detail in \sectref{Multiple Assignment Statement}.
+
+#%}}}
+
+\sect{Conditional and Looping Statements} #%{{{
+
+ \slang supports a wide variety of conditional and looping
+ statements. These constructs operate on statements grouped together
+ in \em{blocks}. A block is a sequence of \slang statements enclosed
+ in braces and may contain other blocks. However, a block cannot
+ include function declarations. In the following,
+ \em{statement-or-block} refers to either a single \slang statement
+ or to a block of statements, and \em{integer-expression} is an
+ integer-valued or boolean expression. \em{next-statement} represents
+ the statement following the form under discussion.
+
+\sect1{Conditional Forms} #%{{{
+\sect2{if}
+ The simplest condition statement is the \kw{if} statement. It
+ follows the syntax
+\begin{tscreen}
+ if (\em{integer-expression}) \em{statement-or-block}
+ \em{next-statement}
+\end{tscreen}
+ If \em{integer-expression} evaluates to a non-zero (boolean TRUE)
+ result, then the statement or group of statements implied
+ \em{statement-or-block} will get executed. Otherwise, control will
+ proceed to \em{next-statement}.
+
+ An example of the use of this type of conditional statement is
+#v+
+ if (x != 0)
+ {
+ y = 1.0 / x;
+ if (x > 0) z = log (x);
+ }
+#v-
+ This example illustrates two \kw{if} statements where the second
+ \kw{if} statement is part of the block of statements that belong to
+ the first.
+
+\sect2{if-else}
+ Another form of \kw{if} statement is the \em{if-else} statement.
+ It follows the syntax:
+\begin{tscreen}
+ if (\em{integer-expression}) \em{statement-or-block-1}
+ else \em{statement-or-block-2}
+ \em{next-statement}
+\end{tscreen}
+ Here, if \em{expression} evaluates to a non-zero integer,
+ \em{statement-or-block-1} will get executed and control will pass
+ on to \em{next-statement}. However, if \em{expression} evaluates to zero,
+ \em{statement-or-block-2} will get executed before continuing on to
+ \em{next-statement}. A simple example of this form is
+#v+
+ if (x > 0)
+ z = log (x);
+ else
+ throw DomainError, "x must be positive";
+#v-
+ Consider the more complex example:
+#v+
+ if (city == "Boston")
+ if (street == "Beacon") found = 1;
+ else if (city == "Madrid")
+ if (street == "Calle Mayor") found = 1;
+ else found = 0;
+#v-
+ This example illustrates a problem that beginners have with
+ \em{if-else} statements. Syntactically, this example is equivalent to
+#v+
+ if (city == "Boston")
+ {
+ if (street == "Beacon") found = 1;
+ else if (city == "Madrid")
+ {
+ if (street == "Calle Mayor") found = 1;
+ else found = 0;
+ }
+ }
+#v-
+ although the indentation indicates otherwise. It is important to
+ understand the grammar and not be seduced by the indentation!
+
+\sect2{ifnot}
+
+ One often encounters \kw{if} statements similar to
+\begin{tscreen}
+ if (\em{integer-expression} == 0) \em{statement-or-block}
+\end{tscreen}
+ or equivalently,
+\begin{tscreen}
+ if (not(\em{integer-expression})) \em{statement-or-block}
+\end{tscreen}
+ The \kw{ifnot} statement was added to the language to simplify the
+ handling of such statements. It obeys the syntax
+\begin{tscreen}
+ ifnot (\em{integer-expression}) \em{statement-or-block}
+\end{tscreen}
+ and is functionally equivalent to
+\begin{tscreen}
+ if (not (\em{expression})) \em{statement-or-block}
+\end{tscreen}
+
+ Note: The \kw{ifnot} keyword was added in version 2.1 and is not
+ supported by earlier versions. For compatibility with older code,
+ the \kw{!if} keyword can be used, although its use is deprecated in
+ favor of \kw{ifnot}.
+
+\sect2{orelse, andelse}
+
+ \bf{
+ As of \slang version 2.1, use of the \exmp{andelse} and
+ \exmp{orelse} have been deprecated in favor of the \exmp{&&} and
+ \exmp{||} short-circuiting operators.
+ }
+
+ The syntax for the \kw{orelse} statement is:
+\begin{tscreen}
+ orelse {\em{integer-expression-1}} ... {\em{integer-expression-n}}
+\end{tscreen}
+ This causes each of the blocks to be executed in turn until one of
+ them returns a non-zero integer value. The result of this statement
+ is the integer value returned by the last block executed. For
+ example,
+#v+
+ orelse { 0 } { 6 } { 2 } { 3 }
+#v-
+ returns 6 since the second block is the first to return a
+ non-zero result. The last two block will not get executed.
+
+ The syntax for the \kw{andelse} statement is:
+\begin{tscreen}
+ andelse {\em{integer-expression-1}} ... {\em{integer-expression-n}}
+\end{tscreen}
+ Each of the blocks will be executed in turn until one of
+ them returns a zero value. The result of this statement is the
+ integer value returned by the last block executed. For example,
+#v+
+ andelse { 6 } { 2 } { 0 } { 4 }
+#v-
+ evaluates to 0 since the third block will be the last to execute.
+
+\sect2{switch}
+ The switch statement deviates from its C counterpart. The syntax
+ is:
+#v+
+ switch (x)
+ { ... : ...}
+ .
+ .
+ { ... : ...}
+#v-
+ The `\var{:}' operator is a special symbol that in the context of
+ the switch statement, causes the top item on the stack to be
+ tested, and if it is non-zero, the rest of the block
+ will get executed and control will pass out of the switch statement.
+ Otherwise, the execution of the block will be terminated and the process
+ will be repeated for the next block. If a block contains no
+ \var{:} operator, the entire block is executed and control will
+ pass onto the next statement following the \kw{switch} statement.
+ Such a block is known as the \em{default} case.
+
+ As a simple example, consider the following:
+#v+
+ switch (x)
+ { x == 1 : message("Number is one.");}
+ { x == 2 : message("Number is two.");}
+ { x == 3 : message("Number is three.");}
+ { x == 4 : message("Number is four.");}
+ { x == 5 : message("Number is five.");}
+ { message ("Number is greater than five.");}
+#v-
+ Suppose \exmp{x} has an integer value of 3. The first two
+ blocks will terminate at the `\var{:}' character because each of the
+ comparisons with \exmp{x} will produce zero. However, the third
+ block will execute to completion. Similarly, if \exmp{x} is
+ 7, only the last block will execute in full.
+
+ A more familiar way to write the previous example is to make use of
+ the \kw{case} keyword:
+#v+
+ switch (x)
+ { case 1 : message("Number is one.");}
+ { case 2 : message("Number is two.");}
+ { case 3 : message("Number is three.");}
+ { case 4 : message("Number is four.");}
+ { case 5 : message("Number is five.");}
+ { message ("Number is greater than five.");}
+#v-
+ The \var{case} keyword is a more useful comparison operator because
+ it can perform a comparison between different data types while
+ using \var{==} may result in a type-mismatch error. For example,
+#v+
+ switch (x)
+ { (x == 1) or (x == "one") : message("Number is one.");}
+ { (x == 2) or (x == "two") : message("Number is two.");}
+ { (x == 3) or (x == "three") : message("Number is three.");}
+ { (x == 4) or (x == "four") : message("Number is four.");}
+ { (x == 5) or (x == "five") : message("Number is five.");}
+ { message ("Number is greater than five.");}
+#v-
+ will fail because the \var{==} operation is not defined between
+ strings and integers. The correct way to write this is to use the
+ \var{case} keyword:
+#v+
+ switch (x)
+ { case 1 or case "one" : message("Number is one.");}
+ { case 2 or case "two" : message("Number is two.");}
+ { case 3 or case "three" : message("Number is three.");}
+ { case 4 or case "four" : message("Number is four.");}
+ { case 5 or case "five" : message("Number is five.");}
+ { message ("Number is greater than five.");}
+#v-
+
+#%}}}
+
+\sect1{Looping Forms} #%{{{
+
+ In this section, the various looping statements are discussed. Each
+ of these statements support an optional \kw{then} clause, which is
+ discussed in a separate section below.
+
+\sect2{while}
+ The \kw{while} statement follows the syntax
+\begin{tscreen}
+ while (\em{integer-expression}) \em{statement-or-block}
+ then \em{statement-or-block} 
+ \em{next-statement}
+\end{tscreen}
+ It simply causes \em{statement-or-block} to get executed as long as
+ \em{integer-expression} evaluates to a non-zero result. For
+ example,
+#v+
+ i = 10;
+ while (i)
+ {
+ i--;
+ newline ();
+ }
+#v-
+ will cause the \exmp{newline} function to get called 10 times.
+ However,
+#v+
+ i = -10;
+ while (i)
+ {
+ i--;
+ newline ();
+ }
+#v-
+ would loop forever (or until \exmp{i} wraps from the most negative
+ integer value to the most positive and then decrements to zero).
+
+ If you are a C programmer, do not let the syntax of the language
+ seduce you into writing this example as you would in C:
+#v+
+ i = 10;
+ while (i--) newline ();
+#v-
+ Keep in mind that expressions such as \exmp{i--} do not return a
+ value in \slang as they do in C. The same effect can be achieved
+ to use a comma to separate the expressions as in
+#v+
+ i = 10;
+ while (i, i--) newline ();
+#v-
+
+\sect2{do...while}
+ The \kw{do...while} statement follows the syntax
+\begin{tscreen}
+ do
+ \em{statement-or-block}
+ while (\em{integer-expression});
+ then \em{statement-or-block} 
+\end{tscreen}
+ The main difference between this statement and the \var{while}
+ statement is that the \kw{do...while} form performs the test
+ involving \em{integer-expression} after each execution
+ of \em{statement-or-block} rather than before. This guarantees that
+ \em{statement-or-block} will get executed at least once.
+
+ A simple example from the \jed editor follows:
+#v+
+ bob (); % Move to beginning of buffer
+ do
+ {
+ indent_line ();
+ }
+ while (down (1));
+#v-
+ This will cause all lines in the buffer to get indented via the
+ \jed intrinsic function \exmp{indent_line}.
+
+\sect2{for}
+ Perhaps the most complex looping statement is the \kw{for}
+ statement; nevertheless, it is a favorite of many C programmers.
+ This statement obeys the syntax
+\begin{tscreen}
+ for (\em{init-expression}; \em{integer-expression}; \em{end-expression})
+ \em{statement-or-block}
+ then \em{statement-or-block} 
+ \em{next-statement}
+\end{tscreen}
+ In addition to \em{statement-or-block}, its specification requires
+ three other expressions. When executed, the \kw{for} statement
+ evaluates \em{init-expression}, then it tests
+ \em{integer-expression}. If \em{integer-expression} evaluates to zero,
+ control passes to \em{next-statement}. Otherwise, it executes
+ \em{statement-or-block} as long as \em{integer-expression}
+ evaluates to a non-zero result. After every execution of
+ \em{statement-or-block}, \em{end-expression} will get evaluated.
+
+ This statement is \em{almost} equivalent to
+\begin{tscreen}
+ \em{init-expression};
+ while (\em{integer-expression})
+ {
+ \em{statement-or-block}
+ \em{end-expression};
+ }
+\end{tscreen}
+ The reason that they are not fully equivalent involves what happens
+ when \em{statement-or-block} contains a \kw{continue} statement.
+
+ Despite the apparent complexity of the \kw{for} statement, it is
+ very easy to use. As an example, consider
+#v+
+ s = 0;
+ for (i = 1; i <= 10; i++) s += i;
+#v-
+ which computes the sum of the first 10 integers.
+
+\sect2{loop}
+ The \kw{loop} statement simply executes a block of code a fixed
+ number of times. It follows the syntax
+\begin{tscreen}
+ loop (\em{integer-expression}) \em{statement-or-block}
+ then \em{statement-or-block} 
+ \em{next-statement}
+\end{tscreen}
+ If the \em{integer-expression} evaluates to a positive integer,
+ \em{statement-or-block} will get executed that many times.
+ Otherwise, control will pass to \em{next-statement}.
+
+ For example,
+#v+
+ loop (10) newline ();
+#v-
+ will execute the \exmp{newline} function 10 times.
+
+\sect2{_for}
+ Like \kw{loop}, the \kw{_for} statement simply executes a block of
+ code a fixed number times. Unlike the \kw{loop} statement, the
+ \kw{_for} loop is useful in situations where the loop index is
+ needed. It obeys the syntax
+\begin{tscreen}
+ _for \em{loop-variable} (\em{first-value}, \em{last-value}, \em{increment})
+ \em{block}
+ then \em{statement-or-block} 
+ \em{next-statement}
+\end{tscreen}
+ Each time through the loop, the loop-variable will take on the
+ successive values dictated by the other parameters. The first time
+ through, the loop-variable will have the value of \em{first-value}.
+ The second time its value will be \em{first-value} +
+ \em{increment}, and so on. The loop will terminate when the value
+ of the loop index exceeds \em{last-value}. The current
+ implementation requires the control parameters \em{first-value},
+ \em{last-value}, and \em{increment} to be integer-valued
+ expressions.
+
+ For example, the \kw{_for} statement may be used to compute the sum
+ of the first ten integers:
+#v+
+ s = 0;
+ _for i (1, 10, 1)
+ s += i;
+#v-
+
+ The execution speed of the \kw{_for} loop is more than twice as fast as
+ the more powerful \kw{for} loop making it a better choice for many
+ situations.
+
+\sect2{forever}
+ The \kw{forever} statement is similar to the \kw{loop} statement
+ except that it loops forever, or until a \kw{break} or a
+ \kw{return} statement is executed. It obeys the syntax
+\begin{tscreen}
+ forever \em{statement-or-block}
+ then \em{statement-or-block} 
+\end{tscreen}
+ A trivial example of this statement is
+#v+
+ n = 10;
+ forever
+ {
+ if (n == 0) break;
+ newline ();
+ n--;
+ }
+#v-
+
+\sect2{foreach}
+ The \kw{foreach} statement is used to loop over one or more
+ statements for every element of an object. Most often the object
+ will be a container object such as an array, structure, or
+ associative arrays, but it need not be.
+
+ The simple type of \kw{foreach} statement obeys the syntax
+\begin{tscreen}
+ foreach \em{var} (\em{object}) \em{statement-or-block}
+ then \em{statement-or-block} 
+\end{tscreen}
+ Here \em{object} can be an expression that evaluates to a value.
+ Each time through the loop the variable \em{var} will take on a
+ value that depends upon the data type of the object being
+ processed. For container objects, \em{var} will take on values of
+ successive members of the object.
+
+ A simple example is
+#v+
+ foreach fruit ("apple", "peach", "pear")
+ process_fruit (fruit);
+#v-
+ This example shows that if the container object is an array, then
+ successive elements of the array are assigned to \exmp{fruit} prior to
+ each execution cycle. If the container object is a string, then
+ successive characters of the string are assigned to the variable.
+
+ What actually gets assigned to the variable may be controlled via the
+ \kw{using} form of the \kw{foreach} statement. This more complex
+ type of \kw{foreach} statement follows the syntax
+\begin{tscreen}
+ foreach \em{var} ( \em{container-object} ) using ( \em{control-list} )
+ \em{statement-or-block}
+\end{tscreen}
+ The allowed values of \em{control-list} will depend upon the type
+ of container object. For associative arrays (\var{Assoc_Type}),
+ \em{control-list} specifies whether \em{keys}, \em{values}, or both
+ are used. For example,
+#v+
+ foreach k (a) using ("keys")
+ {
+ .
+ .
+ }
+#v-
+ results in the keys of the associative array \exmp{a} being
+ successively assigned to \exmp{k}. Similarly,
+#v+
+ foreach v (a) using ("values")
+ {
+ .
+ .
+ }
+#v-
+ will cause the values to be used. The form
+#v+
+ foreach k,v (a) using ("keys", "values")
+ {
+ .
+ .
+ }
+#v-
+ may be used when both keys and values are desired.
+
+ Similarly, for linked-lists of structures, one may walk the list via
+ code like
+#v+
+ foreach s (linked_list) using ("next")
+ {
+ .
+ .
+ }
+#v-
+ This \kw{foreach} statement is equivalent
+#v+
+ s = linked_list;
+ while (s != NULL)
+ {
+ .
+ .
+ s = s.next;
+ }
+#v-
+ Consult the type-specific documentation for a discussion of the
+ \kw{using} control words, if any, appropriate for a given type.
+
+#%}}}
+
+\sect1{break, return, and continue} #%{{{
+
+ \slang also includes the non-local transfer statements
+ \var{return}, \var{break}, and \var{continue}. The \var{return}
+ statement causes control to return to the calling function while
+ the \var{break} and \var{continue} statements are used in the
+ context of loop structures. Consider:
+#v+
+ define fun ()
+ {
+ forever
+ {
+ s1;
+ s2;
+ ..
+ if (condition_1) break;
+ if (condition_2) return;
+ if (condition_3) continue;
+ ..
+ s3;
+ }
+ s4;
+ ..
+ }
+#v-
+ Here, a function \exmp{fun} has been defined that contains a \kw{forever}
+ loop consisting of statements \exmp{s1}, \exmp{s2},\ldots,\exmp{s3}, and
+ three \kw{if} statements. As long as the expressions \exmp{condition_1},
+ \exmp{condition_2}, and \exmp{condition_3} evaluate to zero, the statements
+ \exmp{s1}, \exmp{s2},\ldots,\exmp{s3} will be repeatedly executed. However,
+ if \exmp{condition_1} returns a non-zero value, the \kw{break} statement
+ will get executed, and control will pass out of the \kw{forever} loop to
+ the statement immediately following the loop, which in this case is
+ \exmp{s4}. Similarly, if \exmp{condition_2} returns a non-zero number,
+ the \kw{return} statement will cause control to pass back to the
+ caller of \exmp{fun}. Finally, the \kw{continue} statement will
+ cause control to pass back to the start of the loop, skipping the
+ statement \exmp{s3} altogether.
+
+#%}}}
+
+\sect1{The looping then clause} #%{{{
+
+ As mentioned above, all the looping statements support an optional
+ \kw{then} clause. The statements that comprise this clause get
+ executed only when the loop has run to completion and was not
+ prematurely terminated via a \kw{break} statement. As an example,
+ consider the following:
+#v+
+ count = 0;
+ max_tries = 20;
+ while (count < max_tries)
+ {
+ if (try_something ())
+ break;
+
+ count++;
+ % Failed -- try again
+ }
+ if (count == 20)
+ throw RunTimeError, "try_something failed 20 times";
+#v-
+ Here, the code makes 20 attempts to perform some task (via the
+ \exmp{try_something} function) and if not successful it will throw
+ an exception. Compare the above to an equivalent form that makes
+ use of a \kw{then}-clause for the \kw{loop} statement:
+#v+
+ max_tries = 20;
+ loop (max_tries)
+ {
+ if (try_something ())
+ break;
+ % Failed -- try again
+ }
+ then throw RunTimeError, "try_something failed 20 times";
+#v-
+ Here, the \kw{then} statement would get executed only if the loop
+ statement has run to completion, i.e., loops 20 times in this case.
+ This only happens if the \exmp{try_something} function fails each
+ time through the loop. However, if the \exmp{try_something}
+ function succeeds, then the \kw{break} statement will get executed
+ causing the loop to abort prematurely, which would result in the
+ \kw{then} clause \em{not} getting executed.
+
+ The use of such a construct can also simplify code such as:
+#v+
+ if (some_condition)
+ {
+ foo_statements;
+ if (another_condition)
+ bar_statements;
+ else
+ fizzle_statements;
+ }
+ else fizzle_statements;
+#v-
+ In this case the \exmp{fizzle_statements} are duplicated making the
+ code ugly and less maintainable. Ideally one would wrap the
+ \exmp{fizzle_statements} in a separate function and call it twice.
+ However, this is not always possible or convenient. The duplication
+ can be eliminated by using the \key{then} form of the \kw{loop}
+ statement:
+#v+
+ loop (some_condition != 0)
+ {
+ foo_statements;
+ if (another_condition)
+ {
+ bar_statements;
+ break;
+ }
+ }
+ then fizzle_statements;
+#v-
+ Here, the expression \exmp{some_condition != 0} is going to result
+ in either 0 or 1, causing the code to execute 0 or 1 loops. Since
+ the \exmp{fizzle_statements} are contained in the \kw{then} clause,
+ they will get executed only when the requested number of loops
+ executes to completion. Executing 0 loops is regarded as successful
+ completion of the loop statement. Hence, when \exmp{some_condition}
+ is 0, the \exmp{fizzle_statements} will get executed. The
+ \exmp{fizzle_statements} will not get executed only when the loop is
+ prematurely terminated, and that will occur when both
+ \exmp{some_condition} and \exmp{another_condition} are non-zero.
+
+#%}}}
+
+#%}}}
+
+#%}}}
+
+\chapter{Functions} #%{{{
+
+ There are essentially two classes of functions that may be called
+ from the interpreter: intrinsic functions and slang functions.
+
+ An intrinsic function is one that is implemented in C or some other
+ compiled language and is callable from the interpreter. Nearly all
+ of the built-in functions are of this variety. At the moment the
+ basic interpreter provides nearly 300 intrinsic functions. Examples
+ include the trigonometric functions \ifun{sin} and \ifun{cos}, string
+ functions such as \ifun{strcat}, etc. Dynamically loaded modules
+ such as the \module{png} and \module{pcre} modules add additional
+ intrinsic functions.
+
+ The other type of function is written in \slang and is known simply
+ as a ``\slang function''. Such a function may be thought of as a
+ group of statements that work together to perform a computation.
+ The specification of such functions is the main subject of this
+ chapter.
+
+\sect{Declaring Functions} #%{{{
+
+ Like variables, functions must be declared before they can be used. The
+ \kw{define} keyword is used for this purpose. For example,
+#v+
+ define factorial ();
+#v-
+ is sufficient to declare a function named \exmp{factorial}. Unlike
+ the \kw{variable} keyword used for declaring variables, the
+ \kw{define} keyword does not accept a list of names.
+
+ Usually, the above form is used only for recursive functions. In
+ most cases, the function name is almost always followed by a
+ parameter list and the body of the function:
+\begin{tscreen}
+ define \em{function-name} (\em{parameter-list})
+ {
+ \em{statement-list}
+ }
+\end{tscreen}
+ The \em{function-name} is an identifier and must conform to the
+ naming scheme for identifiers discussed in \chapterref{Identifiers}. The
+ \em{parameter-list} is a comma-separated list of variable names
+ that represent parameters passed to the function, and may be empty
+ if no parameters are to be passed. The variables in the
+ \em{parameter-list} are implicitly declared, thus, there is no need
+ to declare them via a variable declaration statement. In fact any
+ attempt to do so will result in a syntax error.
+
+ The body of the function is enclosed in braces and consists of zero
+ or more statements (\em{statement-list}). While there are no
+ imposed limits upon the number statements that may occur within a
+ \slang function, it is considered poor programming practice if a
+ function contains many statements. This notion stems from the
+ belief that a function should have a simple, well-defined purpose.
+
+#%}}}
+
+\sect{Parameter Passing Mechanism} #%{{{
+
+ Parameters to a function are always passed by value and never by
+ reference. To see what this means, consider
+#v+
+ define add_10 (a)
+ {
+ a = a + 10;
+ }
+ variable b = 0;
+ add_10 (b);
+#v-
+ Here a function \exmp{add_10} has been defined, which when
+ executed, adds 10 to its parameter. A variable \exmp{b} has
+ also been declared and initialized to zero before being passed to
+ \exmp{add_10}. What will be the value of \exmp{b} after the call
+ to \exmp{add_10}? If \slang were a language that passed parameters
+ by reference, the value of \exmp{b} would be changed to 10.
+ However, \slang always passes by value, which means that \exmp{b}
+ will retain its value during and after after the function call.
+
+ \slang does provide a mechanism for simulating pass by reference
+ via the reference operator. This is described in greater detail in
+ the next section.
+
+ If a function is called with a parameter in the parameter list
+ omitted, the corresponding variable in the function will be set to
+ \NULL. To make this clear, consider the function
+#v+
+ define add_two_numbers (a, b)
+ {
+ if (a == NULL) a = 0;
+ if (b == NULL) b = 0;
+ return a + b;
+ }
+#v-
+ This function must be called with two parameters. However, either
+ of them may omitted by calling the function in one of the following
+ ways:
+#v+
+ variable s = add_two_numbers (2,3);
+ variable s = add_two_numbers (2,);
+ variable s = add_two_numbers (,3);
+ variable s = add_two_numbers (,);
+#v-
+ The first example calls the function using both parameters, but
+ at least one of the parameters was omitted in the other
+ examples. If the parser recognizes that a parameter has been
+ omitted by finding a comma or right-parenthesis where a value is
+ expected, it will substitute \NULL for missing value. This means
+ that the parser will convert the latter three statements in the
+ above example to:
+#v+
+ variable s = add_two_numbers (2, NULL);
+ variable s = add_two_numbers (NULL, 3);
+ variable s = add_two_numbers (NULL, NULL);
+#v-
+ It is important to note that this mechanism is available only for
+ function calls that specify more than one parameter. That is,
+#v+
+ variable s = add_10 ();
+#v-
+ is \em{not} equivalent to \exmp{add_10(NULL)}. The reason for this
+ is simple: the parser can only tell whether or not \NULL should
+ be substituted by looking at the position of the comma character in
+ the parameter list, and only function calls that indicate more than
+ one parameter will use a comma. A mechanism for handling single
+ parameter function calls is described later in this chapter.
+
+#%}}}
+
+\sect{Returning Values} #%{{{
+
+ The usual way to return values from a function is via the
+ \kw{return} statement. This statement has the simple syntax
+\begin{tscreen}
+ return \em{expression-list} ;
+\end{tscreen}
+ where \em{expression-list} is a comma separated list of expressions.
+ If a function does not return any values, the expression list
+ will be empty. A simple example of a function that can return
+ multiple values (two in this case) is:
+#v+
+ define sum_and_diff (x, y)
+ {
+ variable sum, diff;
+
+ sum = x + y; diff = x - y;
+ return sum, diff;
+ }
+#v-
+
+#%}}}
+
+\labeled_sect{Multiple Assignment Statement} #%{{{
+
+ In the previous section an example of a function returning two
+ values was given. That function can also be written somewhat
+ simpler as:
+#v+
+ define sum_and_diff (x, y)
+ {
+ return x + y, x - y;
+ }
+#v-
+ This function may be called using
+#v+
+ (s, d) = sum_and_diff (12, 5);
+#v-
+ After the above line is executed, \exmp{s} will have a value of 17
+ and the value of \exmp{d} will be 7.
+
+ The most general form of the multiple assignment statement is
+#v+
+ ( var_1, var_2, ..., var_n ) = expression;
+#v-
+ Here \exmp{expression} is an arbitrary expression that leaves
+ \exmp{n} items on the stack, and \exmp{var_k} represents an l-value
+ object (permits assignment). The assignment statement removes
+ those values and assigns them to the specified variables.
+ Usually, \exmp{expression} is a call to a function that returns
+ multiple values, but it need not be. For example,
+#v+
+ (s,d) = (x+y, x-y);
+#v-
+ produces results that are equivalent to the call to the
+ \exmp{sum_and_diff} function. Another common use of the multiple
+ assignment statement is to swap values:
+#v+
+ (x,y) = (y,x);
+ (ai, aj, ak) = (aj, ak, ai);
+#v-
+
+ If an l-value is omitted from the list, then the corresponding
+ value will be removed fro the stack. For example,
+#v+
+ (s, ) = sum_and_diff (9, 4);
+#v-
+ assigns the sum of 9 and 4 to \exmp{s} and the
+ difference (\exmp{9-4}) is removed from the stack. Similarly,
+#v+
+ () = fputs ("good luck", fp);
+#v-
+ causes the return value of the \ifun{fputs} function to be discarded.
+
+ It is possible to create functions that return a \em{variable
+ number} of values instead of a \em{fixed number}. Although such
+ functions are discouraged, it is easy to cope with them. Usually,
+ the value at the top of the stack will indicate the actual number
+ of return values. For such functions, the multiple assignment
+ statement cannot directly be used. To see how such functions can
+ be dealt with, consider the following function:
+#v+
+ define read_line (fp)
+ {
+ variable line;
+ if (-1 == fgets (&line, fp))
+ return -1;
+ return (line, 0);
+ }
+#v-
+ This function returns either one or two values, depending upon the
+ return value of \ifun{fgets}. Such a function may be handled using:
+#v+
+ status = read_line (fp);
+ if (status != -1)
+ {
+ s = ();
+ .
+ .
+ }
+#v-
+ In this example, the \em{last} value returned by \exmp{read_line} is
+ assigned to \exmp{status} and then tested. If it is non-zero, the
+ second return value is assigned to \exmp{s}. In particular note the
+ empty set of parenthesis in the assignment to \exmp{s}. This simply
+ indicates that whatever is on the top of the stack when the
+ statement is executed will be assigned to \exmp{s}.
+
+#%}}}
+
+\labeled_sect{Referencing Variables} #%{{{
+
+ One can achieve the effect of passing by reference by using the
+ reference (\var{&}) and dereference (\var{@}) operators. Consider
+ again the \exmp{add_10} function presented in the previous section.
+ This time it is written as:
+#v+
+ define add_10 (a)
+ {
+ @a = @a + 10;
+ }
+ variable b = 0;
+ add_10 (&b);
+#v-
+ The expression \exmp{&b} creates a \em{reference} to the variable
+ \exmp{b} and it is the reference that gets passed to \exmp{add_10}.
+ When the function \exmp{add_10} is called, the value of the local
+ variable \exmp{a} will be a reference to the variable \exmp{b}. It
+ is only by \em{dereferencing} this value that \exmp{b} can be
+ accessed and changed. So, the statement \exmp{@a=@a+10} should be
+ read as ``add 10 to the value of the object that \exmp{a}
+ references and assign the result to the object that \exmp{a}
+ references''.
+
+ The reader familiar with C will note the similarity between
+ \em{references} in \slang and \em{pointers} in C.
+
+ References are not limited to variables. A reference to a function
+ may also be created and passed to other functions. As a simple
+ example from elementary calculus, consider the following function
+ which returns an approximation to the derivative of another
+ function at a specified point:
+#v+
+ define derivative (f, x)
+ {
+ variable h = 1e-6;
+ return ((@f)(x+h) - (@f)(x)) / h;
+ }
+ define x_squared (x)
+ {
+ return x^2;
+ }
+ dydx = derivative (&x_squared, 3);
+#v-
+ When the \exmp{derivative} function is called, the local variable
+ \exmp{f} will be a reference to the \exmp{x_squared} function. The
+ \exmp{x_squared} function is called with the specified
+ parameters by dereferencing \exmp{f} with the dereference operator.
+
+#%}}}
+
+\sect{Functions with a Variable Number of Arguments} #%{{{
+
+ \slang functions may be called with a variable number of arguments.
+ A natural example of such functions is the \ifun{strcat} function,
+ which takes one or more string arguments and returns the
+ concatenated result. An example of different sort is the
+ \ifun{strtrim} function which moves both leading and trailing
+ whitespace from a string. In this case, when called with one
+ argument (the string to be ``trimmed''), the characters that are
+ considered to be whitespace are those in the character-set that have
+ the whitespace property (space, tab, newline, ...). However, when
+ called with two arguments, the second argument may be used to
+ specify the characters that are to be considered as whitespace. The
+ \ifun{strtrim} function exemplifies a class of variadic functions
+ where the additional arguments are used to pass optional information to
+ the function. Another more flexible and powerful way of passing
+ optional information is through the use of \em{qualifiers}, which is
+ the subject of the next section.
+
+ When a \slang function is called with parameters, those parameters
+ are placed on the run-time stack. The function accesses those
+ parameters by removing them from the stack and assigning them to the
+ variables in its parameter list. This details of this operation
+ are for the most part hidden from the programmer. But what happens
+ when the number of parameters in the parameter list is not equal to
+ the number of parameters passed to the function? If the number
+ passed to the function is less than what the function expects, a
+ \var{StackUnderflow} error could result as the function tries to
+ remove items from the stack. If the number passed is greater than
+ the number in the parameter list, then the extras will remain on the
+ stack. The latter feature makes it possible to write functions that
+ take a variable number of arguments.
+
+ Consider the \exmp{add_10} example presented earlier. This time it
+ is written
+#v+
+ define add_10 ()
+ {
+ variable x;
+ x = ();
+ return x + 10;
+ }
+ variable s = add_10 (12); % ==> s = 22;
+#v-
+ For the uninitiated, this example looks as if it is destined for
+ disaster. The \exmp{add_10} function appears to accept zero
+ arguments, yet it was called with a single argument. On top of
+ that, the assignment to \exmp{x} might look a bit strange. The
+ truth is, the code presented in this example makes perfect sense,
+ once you realize what is happening.
+
+ First, consider what happens when \exmp{add_10} is called with the
+ parameter 12. Internally, 12 is pushed onto the stack
+ and then the function called. Now, consider the function
+ \exmp{add_10} itself. In it, \exmp{x} is a local variable.
+ The strange looking assignment `\exmp{x=()}' causes whatever is on
+ the top of the stack to be assigned to \exmp{x}. In other words, after
+ this statement, the value of \exmp{x} will be 12, since
+ 12 is at the top of the stack.
+
+ A generic function of the form
+#v+
+ define function_name (x, y, ..., z)
+ {
+ .
+ .
+ }
+#v-
+ is transformed internally by the parser to something akin to
+#v+
+ define function_name ()
+ {
+ variable x, y, ..., z;
+ z = ();
+ .
+ .
+ y = ();
+ x = ();
+ .
+ .
+ }
+#v-
+ before further parsing. (The \exmp{add_10} function, as defined above, is
+ already in this form.) With this knowledge in hand, one can write a
+ function that accepts a variable number of arguments. Consider the
+ function:
+#v+
+ define average_n (n)
+ {
+ variable x, y;
+ variable s;
+
+ if (n == 1)
+ {
+ x = ();
+ s = x;
+ }
+ else if (n == 2)
+ {
+ y = ();
+ x = ();
+ s = x + y;
+ }
+ else throw NotImplementedError;
+
+ return s / n;
+ }
+ variable ave1 = average_n (3.0, 1); % ==> 3.0
+ variable ave2 = average_n (3.0, 5.0, 2); % ==> 4.0
+#v-
+ Here, the last argument passed to \exmp{average_n} is an integer
+ reflecting the number of quantities to be averaged. Although this
+ example works fine, its principal limitation is obvious: it only
+ supports one or two values. Extending it to three or more values
+ by adding more \exmp{else if} constructs is rather straightforward but
+ hardly worth the effort. There must be a better way, and there is:
+#v+
+ define average_n (n)
+ {
+ variable s, x;
+ s = 0;
+ loop (n)
+ {
+ x = (); % get next value from stack
+ s += x;
+ }
+ return s / n;
+ }
+#v-
+ The principal limitation of this approach is that one must still
+ pass an integer that specifies how many values are to be averaged.
+ Fortunately, a special variable exists that is local to every function
+ and contains the number of values that were passed to the function.
+ That variable has the name \var{_NARGS} and may be used as follows:
+#v+
+ define average_n ()
+ {
+ variable x, s = 0;
+
+ if (_NARGS == 0)
+ usage ("ave = average_n (x, ...);");
+
+ loop (_NARGS)
+ {
+ x = ();
+ s += x;
+ }
+ return s / _NARGS;
+ }
+#v-
+ Here, if no arguments are passed to the function, the \ifun{usage}
+ function will generate a \var{UsageError} exception along with a
+ simple message indicating how to use the function.
+
+#%}}}
+
+\sect{Qualifiers} #%{{{
+
+ One way to pass optional information to a function is to do so using
+ the variable arguments mechanism described in the previous section.
+ However, a much more powerful mechanism is through the use of
+ \em{qualifiers}, which were added in version 2.1.
+
+ To illustrate the use of qualifiers, consider a graphics application
+ that defines a function called \exmp{plot} that plots a set of (x,y)
+ values specified as 1-d arrays:
+#v+
+ plot(x,y);
+#v-
+ Suppose that when called in the above manner, the application will
+ plot the data as black points. But instead of black points, one
+ might want to plot the data using a red diamond as the plot symbol.
+ It would be silly to have a separate function such as
+ \exmp{plot_red_diamond} for this purpose. A much better way to
+ achieve this functionality is through the use of qualifiers:
+#v+
+ plot(x,y ; color="red", symbol="diamond");
+#v-
+ Here, a single semicolon is used to separate the argument-list
+ proper (\exmp{x,y}) from the list of qualifiers. In this case, the
+ qualifiers are ``color'' and ``symbol''. The order of the
+ qualifiers in unimportant; the function could just as well have been
+ called with the symbol qualifier listed first.
+
+ Now consider the implementation of the \exmp{plot} function:
+#v+
+ define plot (x, y)
+ {
+ variable color = qualifier ("color", "black");
+ variable symbol = qualifier ("symbol", "point");
+ variable symbol_size = qualifier ("size", 1.0);
+ .
+ .
+ }
+#v-
+ Note that the qualifiers are not handled in the parameter list;
+ rather they are handled in the function body using the
+ \ifun{qualifier} function, which is used to obtain the value of the
+ qualifier. The second argument to the \ifun{qualifier} function
+ specifies the default value to be used if the function was not
+ called with the specified qualifier. Also note that the variable
+ associated with the qualifier need not have the same name as the
+ qualifier.
+
+ A qualifier need not have a value--- its mere presence may be used
+ to enable or disable a feature or trigger some action. For example,
+#v+
+ plot (x, y; connect_points);
+#v-
+ specifies a qualifier called \exmp{connect_points} that indicates
+ that a line should be drawn between the data points. The presence
+ of such a qualifier can be detected using the
+ \ifun{qualifier_exists} function:
+#v+
+ define plot (x,y)
+ {
+ .
+ .
+ variable connect_points = qualifier_exists ("connect_points");
+ .
+ .
+ }
+#v-
+
+ Sometimes it is useful for a function to pass the qualifiers that it
+ has received to other functions. Suppose that the \exmp{plot}
+ function calls \exmp{draw_symbol} to plot the specified symbol at a
+ particular location and that it requires the symbol attibutes to be
+ specified using qualifiers. Then the plot function might look like:
+#v+
+ define plot (x, y)
+ {
+ variable color = qualifier ("color", "black");
+ variable symbol = qualifier ("symbol", "point");
+ variable symbol_size = qualifier ("size", 1.0);
+ .
+ .
+ _for i (0, length(x)-1, 1)
+ draw_symbol (xi,yi
+ ;color=color, size=symbol_size, symbol=symbol);
+ .
+ .
+ }
+#v-
+ The problem with this approach is that it does not scale well: the
+ \exmp{plot} function has to be aware of all the qualifiers that the
+ \exmp{draw_symbol} function takes and explicitly pass them. In
+ many cases this can be quite cumbersome and error prone. Rather it
+ is better to simply pass the qualifiers that were passed to the plot
+ function on to the \exmp{draw_symbol} function. This may be achieved
+ using the \ifun{__qualifiers} function. The \ifun{__qualifiers}
+ function returns the list of qualifiers in the form of a structure
+ whose field names are the same as the qualifier names. In fact, the
+ use of this function can simplify the implementation of the
+ \exmp{plot} function, which may be coded more simply as
+#v+
+ define plot (x, y)
+ {
+ variable i;
+ _for i (0, length(x)-1, 1)
+ draw_symbol (xi,yi ;; __qualifiers());
+ }
+#v-
+ Note the syntax is slightly different. The two semicolons indicate
+ that the qualifiers are specified not as name-value pairs, but as a
+ structure. Using a single semicolon would have created a qualifier
+ called \exmp{__qualifiers}, which is not what was desired.
+
+ As alluded to above an added benefit of this approach is that the
+ \exmp{plot} function does not need to know nor care about the
+ qualifiers supported by \exmp{draw_symbol}. When called as
+#v+
+ plot (x, y; symbol="square", size=2.0, fill=0.8);
+#v-
+ the \exmp{fill} qualifier would get passed to the \exmp{draw_symbol}
+ function to specify the ``fill'' value to be used when creating
+ the symbol.
+
+#%}}}
+
+\sect{Exit-Blocks} #%{{{
+
+ An \em{exit-block} is a set of statements that get executed when a
+ functions returns. They are very useful for cleaning up when a
+ function returns via an explicit call to \var{return} from deep
+ within a function.
+
+ An exit-block is created by using the \kw{EXIT_BLOCK} keyword
+ according to the syntax
+\begin{tscreen}
+ EXIT_BLOCK { \em{statement-list} }
+\end{tscreen}
+ where \em{statement-list} represents the list of statements that
+ comprise the exit-block. The following example illustrates the use
+ of an exit-block:
+#v+
+ define simple_demo ()
+ {
+ variable n = 0;
+
+ EXIT_BLOCK { message ("Exit block called."); }
+
+ forever
+ {
+ if (n == 10) return;
+ n++;
+ }
+ }
+#v-
+ Here, the function contains an exit-block and a \var{forever} loop.
+ The loop will terminate via the \kw{return} statement when \exmp{n}
+ is 10. Before it returns, the exit-block will get executed.
+
+ A function can contain multiple exit-blocks, but only the last
+ one encountered during execution will actually get used. For
+ example,
+#v+
+ define simple_demo (n)
+ {
+ EXIT_BLOCK { return 1; }
+
+ if (n != 1)
+ {
+ EXIT_BLOCK { return 2; }
+ }
+ return;
+ }
+#v-
+ If 1 is passed to this function, the first exit-block will
+ get executed because the second one would not have been encountered
+ during the execution. However, if some other value is passed, the
+ second exit-block would get executed. This example also
+ illustrates that it is possible to explicitly return from an
+ exit-block, but nested exit-blocks are illegal.
+
+#%}}}
+
+\sect{Handling Return Values from a Function} #%{{{
+
+ The most important rule to remember in calling a function is that
+ \em{if the function returns a value, the caller must do something
+ with it}. While this might sound like a trivial statement it is the
+ number one issue that trips-up novice users of the language.
+
+ To elaborate on this point further, consider the \em{fputs}
+ function, which writes a string to a file descriptor. This
+ function can fail when, e.g., a disk is full, or the file is
+ located on a network share and the network goes down, etc.
+
+ \slang supports two mechanisms that a function may use to report a
+ failure: raising an exception, returning a status code. The latter
+ mechanism is used by the \slang fputs function. i.e., it returns a
+ value to indicate whether or not is was successful. Many users
+ familiar with this function either seem to forget this fact, or
+ assume that the function will succeed and not bother handling the
+ return value. While some languages silently remove such values
+ from the stack, \slang regards the stack as a dynamic data
+ structure that programs can utilize. As a result, the value will
+ be left on the \slang stack and can cause problems later on.
+
+ There are a number of correct ways of ``doing something'' with the
+ return value from a function. Of course the recommended procedure
+ is to use the return value as it was meant to be used. In the case
+ of \ifun{fputs}, the proper thing to do is to check the return
+ value, e.g.,
+#v+
+ if (-1 == fputs ("good luck", fp))
+ {
+ % Handle the error
+ }
+#v-
+ Other acceptable ways to ``do something'' with the return value
+ include assigning it to a dummy variable,
+#v+
+ dummy = fputs ("good luck", fp);
+#v-
+ or simply ``popping'' it from the stack:
+#v+
+ fputs ("good luck", fp); pop();
+#v-
+ The latter mechanism can also be written as
+#v+
+ () = fputs ("good luck", fp);
+#v-
+ The last form is a special case of the \em{multiple assignment
+ statement}, which was discussed earlier. Since this
+ form is simpler than assigning the value to a dummy variable or
+ explicitly calling the \ifun{pop} function, it is recommended over
+ the other two mechanisms. Finally, this form has the
+ redeeming feature that it presents a visual reminder that the
+ function is returning a value that is not being used.
+
+#%}}}
+
+#%}}}
+
+\labeled_chapter{Namespaces} #%{{{
+
+#% FIXME: Add some guidelines for the usage of namespaces
+#% FIXME: This chapter needs rewritten.
+
+ By default, all global variables and functions are defined in the
+ global or public namespace. In addition to the global namespace,
+ every compilation unit (e.g., a file containing \slang code) has a
+ private, or anonymous namespace. The private namespace is used when
+ one wants to restrict the usage of one or more functions or
+ variables to the compilation unit that defines them without worrying
+ about objects with the same names defined elsewhere.
+
+ Objects are declared as belonging to the private namespace using
+ the \kw{private} declaration keyword. Similarly if a variable is
+ declared using the \kw{public} qualifier, it will be placed in the
+ public namespace. For example,
+#v+
+ private variable i;
+ public variable j;
+#v-
+ defines a variable called \exmp{i} in the private namespace and one
+ called \exmp{j} in the public namespace.
+
+ The \ifun{implements} function may be used to create a new namespace
+ of a specified name and have it associated with the compilation unit.
+ Objects may be placed into this namespace space using the
+ \exmp{static} keyword, e.g.,
+#v+
+ static variable X;
+ static define foo () {...}
+#v-
+ For this reason, such a namespace will be called the \em{static
+ namespace} associated with the compilation unit. Such objects may be
+ accessed from outside the local compilation unit using the namespace
+ operator \exmp{->} in conjunction with the name of the namespace.
+
+ Since it is possible for three namespaces (private, static, public)
+ to be associated with a compilation unit, it is important to
+ understand how names are resolved by the parser. During the
+ compilation stage, symbols are looked up according to the current
+ scope. If in a function, the local variables of the function are
+ searched first. Then the search proceeds with symbols in the private
+ namespace, followed by those in the \kw{static} namespace associated
+ with the compilation unit (if any), and finally with the public
+ namespace. If after searching the public namespace the symbol has
+ not been resolved, an \exc{UndefinedNameError} exception will result.
+
+ In addition to using the \ifun{implements} function, there are other
+ ways to associate a namespace with a compilation unit. One is via
+ the optional namespace argument of the \exmp{evalfile} function. For
+ example,
+#v+
+ () = evalfile ("foo.sl", "bar");
+#v-
+ will cause \exmp{foo.sl} to be loaded and associated with a namespace
+ called \exmp{bar}. Then any static symbols of \exmp{foo.sl} may
+ accessed using the \exmp{bar->} prefix.
+
+ It is important to note that if a static namespace has been
+ associated with the compilation unit, then any symbols in that unit
+ declared without an namespace qualifier will be placed in the static
+ namespace. Otherwise such symbols will be placed in the public
+ namespace, and any symbols declared as \kw{static} will be placed in
+ the private namespace.
+
+ To illustrate these concepts, consider the following example:
+#v+
+ % foo.sl
+ variable X = 1;
+ static variable Y;
+ private variable Z;
+ public define set_Y (y) { Y = y; }
+ static define set_z (z) { Z = z; }
+#v-
+ If \exmp{foo.sl} is loaded via
+#v+
+ () = evalfile ("foo.sl");
+#v-
+ then no static namespace will be associated with it. As a result,
+ \exmp{X} will be placed in the public namespace since it was declared
+ with no namespace qualifier. Also \exmp{Y} and \exmp{set_z} will be
+ placed in the private namespace since no static namespace has been
+ associated with the file. In this scenario there will be no way to get at
+ the \exmp{Z} variable from outside of \exmp{foo.sl} since both it and
+ the function that accesses it (\exmp{set_z}) are placed in the
+ private namespace.
+
+ On the other hand, suppose that the file is loaded using a namespace
+ argument:
+#v+
+ () = evalfile ("foo.sl", "foo");
+#v-
+ In this case \exmp{X}, \exmp{Y}, and \exmp{set_z} will be placed in the
+ \exmp{foo} namespace. These objects may be accessed from outside
+ \exmp{foo.sl} using the \exmp{foo->} prefix, e.g.,
+#v+
+ foo->set_z (3.0);
+ if (foo->X == 2) foo->Y = 1;
+#v-
+
+ Because a file may be loaded with or without a namespace attached to
+ it, it is a good idea to avoid using the \exmp{static} qualifier. To
+ see this, consider again the above example but this time without the
+ use of the \exmp{static} qualifier:
+#v+
+ % foo.sl
+ variable X = 1;
+ variable Y;
+ private variable Z;
+ public define set_Y (y) { Y = y; }
+ define set_z (z) { Z = z; }
+#v-
+ When loaded without a namespace argument, the variable
+ \exmp{Z} will remain in the private namespace, but the \exmp{set_z}
+ function will be put in the public namespace. Previously
+ \exmp{set_z} was put in the private namespace making both it and
+ \exmp{Z} inaccessible.
+
+#%}}}
+
+\labeled_chapter{Arrays} #%{{{
+
+ An array is a container object that can contain many values of one
+ data type. Arrays are very useful objects and are indispensable
+ for certain types of programming. The purpose of this chapter is
+ to describe how arrays are defined and used in the \slang language.
+
+\sect{Creating Arrays} #%{{{
+
+ The \slang language supports multi-dimensional arrays of all data
+ types. Since the \dtype{Array_Type} is a data type, one can even
+ have arrays of arrays. To create a multi-dimensional array of
+ \em{SomeType} and assign to some variable, use:
+#v+
+ a = SomeType dim0, dim1, ..., dimN;
+#v-
+ Here \em{dim0}, \em{dim1}, ... \em{dimN} specify the size of
+ the individual dimensions of the array. The current implementation
+ permits arrays to contain as many as 7 dimensions. When a
+ numeric array is created, all its elements are initialized to zero.
+ The initialization of other array types depend upon the data type,
+ e.g., the elements in \var{String_Type} and \var{Struct_Type} arrays are
+ initialized to \NULL.
+
+ As a concrete example, consider
+#v+
+ a = Integer_Type 10;
+#v-
+ which creates a one-dimensional array of 10 integers and
+ assigns it to \var{a}.
+ Similarly,
+#v+
+ b = Double_Type 10, 3;
+#v-
+ creates a \var{30} element array of double precision numbers
+ arranged in \var{10} rows and \var{3} columns, and assigns it to
+ \var{b}.
+
+\sect1{Range Arrays}
+
+ There is a more convenient syntax for creating and initializing 1-d
+ arrays. For example, to create an array of ten integers whose
+ elements run from 1 through 10, one may simply use:
+#v+
+ a = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
+#v-
+ Similarly,
+#v+
+ b = 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0;
+#v-
+ specifies an array of ten doubles.
+
+ An even more compact way of specifying a numeric array is to use a
+ \em{range-array}. For example,
+#v+
+ a = 0:9;
+#v-
+ specifies an array of 10 integers whose elements range from 0
+ through 9. The syntax for the most general form of range array is
+ given by
+#v+
+ first-value : last-value : increment
+#v-
+ where the \em{increment} is optional and defaults to 1. This
+ creates an array whose first element is \em{first-value} and whose
+ successive values differ by \em{increment}. \em{last-value} sets
+ an upper limit upon the last value of the array as described below.
+
+ If the range array \exmp{a:b:c} is integer valued, then the
+ interval specified by \exmp{a} and \exmp{b} is closed. That is, the
+ kth element of the array \math{x_k} is given by \math{x_k=a+kc} and
+ satisfies \math{a<=x_k<=b}. Hence, the number of elements in an
+ integer range array is given by the expression \math{1 + (b-a)/c}.
+
+ The situation is somewhat more complicated for floating point range
+ arrays. The interval specified by a floating point range array
+ \exmp{a:b:c} is semi-open such that \exmp{b} is not contained in
+ the interval. In particular, the kth element of \exmp{a:b:c} is
+ given by \math{x_k=a+kc} such that \math{a<=x_k<b} when
+ \math{c>=0}, and \math{b<x_k<=a} otherwise. The number of elements
+ in the array is one greater than the largest \math{k} that
+ satisfies the open interval constraint.
+
+ In contrast, a range-array expressed in the form \exmp{a:b:#n}
+ represents an array of exactly n elements running from \exmp{a} to
+ \exmp{b} inclusive. It is equivalent to
+ \exmp{a+0:n-1*(b-a)/(n-1)}.
+
+ Here are a few examples that illustrate the above comments:
+#v+
+ 1:5:1 ==> 1,2,3,4,5
+ 1.0:5.0:1.0 ==> 1.0, 2.0, 3.0, 4.0
+ 5:1:-1 ==> 5,4,3,2,1
+ 5.0:1.0:-1.0 ==> 5.0, 4.0, 3.0, 2.0;
+ 1:1 ==> 1
+ 1.0:1.0 ==> 
+ 1.0:1.0001 ==> 1.0
+ 1:-3 ==> 
+ 0:1:#5 ==> 0.0, 0.25, 0.50, 0.75, 1.0
+ 0:-1:#3 ==> 0.0, -0.5, -1.0
+#v-
+
+ Currently \dtype{Int_Type} is the only integer type supported
+ by range arrays--- arbitrary integer types will be supported in a
+ future version. This means that \exmp{1h:5h} will not produce
+ an array of \dtype{Short_Type}, rather it will produce an
+ \dtype{Int_Type} array. However, \exmp{1h,2h,3h,4h,5h} will
+ produce an array of \dtype{Short_Type} integers.
+
+\sect1{Creating arrays via the dereference operator}
+
+ Another way to create an array is to apply the dereference operator
+ \var{@} to the \dtype{DataType_Type} literal \dtype{Array_Type}. The
+ actual syntax for this operation resembles a function call
+\begin{tscreen}
+ variable a = @Array_Type (\em{data-type}, \em{integer-array});
+\end{tscreen}
+ where \em{data-type} is of type \dtype{DataType_Type} and
+ \em{integer-array} is a 1-d array of integers that specify the size
+ of each dimension. For example,
+#v+
+ variable a = @Array_Type (Double_Type, 10, 20);
+#v-
+ will create a 10 by 20 array of doubles and assign it
+ to \exmp{a}. This method of creating arrays derives its power from
+ the fact that it is more flexible than the methods discussed in this
+ section. It is particularly useful for creating arrays during
+ run-time in situations where the data-type can vary.
+
+#%}}}
+
+\sect{Reshaping Arrays} #%{{{
+ It is sometimes useful to change the `shape' of an array using
+ the \ifun{reshape} function. For example, a 1-d 10 element array
+ may be reshaped into a 2-d array consisting of 5 rows and 2
+ columns. The only restriction on the operation is that the arrays
+ must be commensurate. The \ifun{reshape} function follows the
+ syntax
+\begin{tscreen}
+ reshape (\em{array-name}, \em{integer-array});
+\end{tscreen}
+ where \em{array-name} specifies the array to be reshaped to
+ the dimensions given by \var{integer-array}, a 1-dimensional array of
+ integers. It is important to note that this does \em{not} create a
+ new array, it simply reshapes the existing array. Thus,
+#v+
+ variable a = Double_Type 100;
+ reshape (a, 10, 10);
+#v-
+ turns \var{a} into a 10 by 10 array, as well as any
+ other variables attached to the array.
+
+ The \ifun{_reshape} function works like \ifun{reshape} except that
+ it creates a new array instead of changing the shape of an existing
+ array:
+#v+
+ new_a = _reshape (a, 10,10);
+#v-
+
+#%}}}
+
+\sect{Simple Array Indexing} #%{{{
+
+ An individual element of an array may be referred to by its
+ \em{index}. For example, \exmp{a0} specifies the zeroth element
+ of the one dimensional array \exmp{a}, and \exmp{b3,2} specifies
+ the element in the third row and second column of the two
+ dimensional array \exmp{b}. As in C, array indices are numbered
+ from 0. Thus if \exmp{a} is a one-dimensional array of ten
+ integers, the last element of the array is given by \exmp{a9}.
+ Using \exmp{a10} would result in an \var{IndexError} exception.
+
+ A negative index may be used to index from the end of the array,
+ with \exmp{a-1} referring to the last element of \exmp{a}.
+ Similarly, \exmp{a-2} refers to the next to the last element, and
+ so on.
+
+ One may use the indexed value like any other variable. For
+ example, to set the third element of an integer array to 6, use
+#v+
+ a2 = 6;
+#v-
+ Similarly, that element may be used in an expression, such as
+#v+
+ y = a2 + 7;
+#v-
+ Unlike other \slang variables which inherit a type upon assignment,
+ array elements already have a type and any attempt to assign a
+ value with an incompatible type will result in a
+ \var{TypeMismatchError} exception. For example, it is illegal to
+ assign a string value to an integer array.
+
+ One may use any integer expression to index an array. A simple
+ example that computes the sum of the elements of a 10 element 1-d
+ array is
+#v+
+ variable i, s;
+ s = 0;
+ for (i = 0; i < 10; i++) s += ai;
+#v-
+ (In practice, do not carry out sums this way--- use the
+ \ifun{sum} function instead, which is much simpler and faster, i.e.,
+ \exmp{s=sum(a)}).
+
+\sect{Indexing Multiple Elements with Ranges}
+
+ Unlike many other languages, \slang permits arrays to be indexed by
+ other integer arrays. Suppose that \exmp{a} is a 1-d array of 10
+ doubles. Now consider:
+#v+
+ i = 6:8;
+ b = ai;
+#v-
+ Here, \exmp{i} is a 1-dimensional range array of three integers with
+ \exmp{i0} equal to 6, \exmp{i1} equal to 7,
+ and \exmp{i2} equal to 8. The statement \var{b = ai;}
+ will create a 1-d array of three doubles and assign it to \var{b}.
+ The zeroth element of \var{b}, \exmp{b0} will be set to the sixth
+ element of \var{a}, or \exmp{a6}, and so on. In fact, these two simple
+ statements are equivalent to
+#v+
+ b = Double_Type 3;
+ b0 = a6;
+ b1 = a7;
+ b2 = a8;
+#v-
+ except that using an array of indices is not only much more
+ convenient, but executes much faster.
+
+ More generally, one may use an index array to specify which
+ elements are to participate in a calculation. For example, consider
+#v+
+ a = Double_Type 1000;
+ i = 0:499;
+ j = 500:999;
+ ai = -1.0;
+ aj = 1.0;
+#v-
+ This creates an array of 1000 doubles and sets the first
+ 500 elements to \exmp{-1.0} and the last 500 to
+ \exmp{1.0}. Actually, one may do away with the \exmp{i} and \exmp{j}
+ variables altogether and use
+#v+
+ a = Double_Type 1000;
+ a0:499 = -1.0;
+ a500:999 = 1.0;
+#v-
+ It is important to note that the syntax requires the use of the
+ double square brackets, and in particular that \exmp{a0:499} is
+ \em{not} the same as \exmp{a0:499}. In fact, the latter will
+ generate a syntax error.
+
+ Index-arrays are not contrained to be one-dimensional arrays. Suppose
+ that \exmp{I} represents a multidimensional index array, and that \exmp{A}
+ is the array to be indexed. Then what does \exmp{AI} represent?
+ Its value will be an array of the same type as \exmp{A}, but with
+ the dimensionality of \em{I}. For example,
+#v+
+ a = 1.0*1:10;
+ i = _reshape (4,5,6,7,8,9, 2,3);
+#v-
+ defines \exmp{a} to be a 10 element array of doubles, and \exmp{i}
+ to be \exmp{2x3} array of integers. Then \exmp{ai} will be a
+ \exmp{2x3} array of doubles with elements:
+#v+
+ a4 a5 a6
+ a7 a8 a9
+#v-
+
+ Often, it is convenient to use a ``rubber'' range to specify
+ indices. For example, \exmp{a500:} specifies all elements of
+ \var{a} whose index is greater than or equal to \var{500}. Similarly,
+ \exmp{a:499} specifies the first 500 elements of \var{a}.
+ Finally, \exmp{a:} specifies all the elements of \var{a}. The
+ latter form may also be written as \exmp{a*}.
+
+ One should be careful when using index arrays with negative
+ elements. As pointed out above, a negative index is used to index
+ from the end of the array. That is, \exmp{a-1} refers to the
+ last element of \exmp{a}. How should \exmp{a0:-1} be
+ interpreted?
+
+ In version 1 of the interpreter, when used in an
+ array indexing context, a construct such as \exmp{0:-1} was taken
+ to mean from the first element through the last. While this might
+ seem like a convenient shorthand, in retrospect it was a bad idea.
+ For this reason, the meaning of a ranges over negative valued
+ indices was changed in version 2 of the interpreter as follows:
+ First the index-range gets expanded to an array of indices
+ according to the rules for range arrays described above. Then if
+ any of the resulting indices are negative, they are interpreted as
+ indices from the end of the array. For example, if \exmp{a}
+ is an array of 10 elements, then \exmp{a-2:3} is first expanded
+ to \exmp{a-2,-1,0,1,2,3}, and then to the 6 element array
+#v+
+ a8, a9, a0, a1, a2, a3 
+#v-
+ So, what does \var{a0:-1} represent in the new interpretation?
+ Since \exmp{0:-1} expands to an empty array, \var{a0:-1} will
+ also produce an empty array.
+
+ Indexing of multidimensional arrays using ranges works similarly.
+ Suppose \var{a} is a 100 by 100 array of doubles. Then
+ the expression \var{a0, *} specifies all elements in the zeroth
+ row. Similarly, \var{a*, 7} specifies all elements in the
+ seventh column. Finally, \var{a3:5,6:12} specifies the
+ 3 by 7 region consisting of rows 3, 4,
+ and 5, and columns 6 through 12 of \var{a}.
+
+ Before leaving this section, a few examples are presented to
+ illustrate some of these points.
+
+ The ``trace'' of a matrix is an important concept that occurs
+ frequently in linear algebra. The trace of a 2d matrix is given by
+ the sum of its diagonal elements. Consider the creation of a
+ function that computes the trace of such a matrix.
+
+ The most straightforward implementation of such a function uses an
+ explicit loop:
+#v+
+ define array_trace (a, n)
+ {
+ variable s = 0, i;
+ for (i = 0; i < n; i++) s += ai, i;
+ return s;
+ }
+#v-
+ Better yet is to recognize that the diagonal elements of an
+ \exmp{n} by \exmp{n} array are given by an index array \exmp{I}
+ with elements 0, \exmp{n+1}, \exmp{2*n+2}, ..., \exmp{n*n-1}, or
+ more precisely as
+#v+
+ 0:n*n-1:n+1
+#v-
+ Hence the above may be written more simply as
+#v+
+ define array_trace (a, n)
+ {
+ return sum (a0:n*n-1:n+1);
+ }
+#v-
+
+ The following example creates a 10 by 10 integer array, sets
+ its diagonal elements to 5, and then computes the trace of
+ the array:
+#v+
+ a = Integer_Type 10, 10;
+ a0:99:11 = 5;
+ the_trace = array_trace(a, 10);
+#v-
+
+ In the previous examples, the size of the array was passed as an
+ additional argument. This is unnecessary because the size may be
+ obtained from array itself by using the \ifun{array_shape}
+ function. For example, the following function may be used to
+ obtain the indices of the diagonal element of an array:
+#v+
+ define diag_indices (a)
+ {
+ variable dims = array_shape (a);
+ if (length (dims) != 2)
+ throw InvalidParmError, "Expecting a 2d array";
+ if (dims0 != dims1)
+ throw InvalidParmError, "Expecting a square array";
+ variable n = dims0;
+ return 0:n*(n-1):n+1;
+ }
+#v-
+ Using this function, the trace function may be written more simply as
+#v+
+ define array_trace (a)
+ {
+ return sum (adiag_indices(a));
+ }
+#v-
+ Another example of this technique is a function that creates an
+ \exmp{n} by \exmp{n} unit matrix:
+#v+
+ define unit_matrix (n)
+ {
+ variable a = Int_Typen, n;
+ adiag_indices(a) = 1;
+ return a;
+ }
+#v-
+
+#%}}}
+
+\sect{Arrays and Variables}
+
+ When an array is created and assigned to a variable, the
+ interpreter allocates the proper amount of space for the array,
+ initializes it, and then assigns to the variable a \em{reference}
+ to the array. So, a variable that represents an array has a value
+ that is really a reference to the array. This has several
+ consequences, most good and some bad. It is believed that the
+ advantages of this representation outweigh the disadvantages.
+ First, we shall look at the positive aspects.
+
+ When a variable is passed to a function, it is always the value of
+ the variable that gets passed. Since the value of a variable
+ representing an array is a reference, a reference to the array gets
+ passed. One major advantage of this is rather obvious: it is a
+ fast and efficient way to pass the array. This also has another
+ consequence that is illustrated by the function
+#v+
+ define init_array (a)
+ {
+ variable i;
+ variable n = length(a);
+ _for i (0, n-1, 1)
+ ai = some_function (i);
+ }
+#v-
+ where \exmp{some_function} is a function that generates a scalar
+ value to initialize the \em{ith} element. This function can be
+ used in the following way:
+#v+
+ variable X = Double_Type 100000;
+ init_array (X);
+#v-
+ Since the array is passed to the function by reference, there is no
+ need to make a separate copy of the \var{100000} element array. As
+ pointed out above, this saves both execution time and memory. The
+ other salient feature to note is that any changes made to the
+ elements of the array within the function will be manifested in the
+ array outside the function. Of course, in this case this is a
+ desirable side-effect.
+
+ To see the downside of this representation, consider:
+#v+
+ a = Double_Type 10;
+ b = a;
+ a0 = 7;
+#v-
+ What will be the value of \exmp{b0}? Since the value of \exmp{a}
+ is really a reference to the array of ten doubles, and that
+ reference was assigned to \exmp{b}, \exmp{b} also refers to the same
+ array. Thus any changes made to the elements of \exmp{a}, will also
+ be made implicitly to \exmp{b}.
+
+ This begs the question: If the assignment of a variable attached to
+ an an array to another variable results in the assignment of the
+ same array, then how does one make separate copies
+ of the array? There are several answers including using an index
+ array, e.g., \exmp{b = a*}; however, the most natural method is
+ to use the dereference operator:
+#v+
+ a = Double_Type 10;
+ b = @a;
+ a0 = 7;
+#v-
+ In this example, a separate copy of \exmp{a} will be created and
+ assigned to \exmp{b}. It is very important to note that \slang
+ never implicitly dereferences an object. So, one must explicitly use
+ the dereference operator. This means that the elements of a
+ dereferenced array are not themselves dereferenced. For example,
+ consider dereferencing an array of arrays, e.g.,
+#v+
+ a = Array_Type 2;
+ a0 = Double_Type 10;
+ a1 = Double_Type 10;
+ b = @a;
+#v-
+ In this example, \exmp{b0} will be a reference to the array that
+ \exmp{a0} references because \exmp{a0} was not explicitly
+ dereferenced.
+
+\sect{Using Arrays in Computations} #%{{{
+
+ Many functions and operations work transparently with arrays.
+ For example, if \exmp{a} and \exmp{b} are arrays, then the sum
+ \exmp{a + b} is an array whose elements are formed from the sum of
+ the corresponding elements of \exmp{a} and \exmp{b}. A similar
+ statement holds for all other binary and unary operations.
+
+ Let's consider a simple example. Suppose, that we wish to solve a
+ set of \exmp{n} quadratic equations whose coefficients are given by
+ the 1-d arrays \exmp{a}, \exmp{b}, and \exmp{c}. In general, the
+ solution of a quadratic equation will be two complex numbers. For
+ simplicity, suppose that all we really want is to know what subset of
+ the coefficients, \exmp{a}, \exmp{b}, \exmp{c}, correspond to
+ real-valued solutions. In terms of \kw{for} loops, we can write:
+#v+
+ index_array = Char_Type n;
+ _for i (0, n-1, 1)
+ {
+ d = bi^2 - 4 * ai * ci;
+ index_array i = (d >= 0.0);
+ }
+#v-
+ In this example, the array \exmp{index_array} will contain a
+ non-zero value if the corresponding set of coefficients has a
+ real-valued solution. This code may be written much more compactly
+ and with more clarity as follows:
+#v+
+ index_array = ((b^2 - 4 * a * c) >= 0.0);
+#v-
+ Moreover, it executes about 20 times faster than the version using
+ an explicit loop.
+
+ \slang has a powerful built-in function called \ifun{where}. This
+ function takes an array of boolean values and returns an array of
+ indices that correspond to where the elements of the input array
+ are non-zero. The utility of this simple operation cannot be
+ overstated. For example, suppose \exmp{a} is a 1-d array of \exmp{n}
+ doubles, and it is desired to set all elements of the array whose
+ value is less than zero to zero. One way is to use a \kw{for}
+ loop:
+#v+
+ _for i (0, n-1, 1)
+ if (ai < 0.0) ai = 0.0;
+#v-
+ If \exmp{n} is a large number, this statement can take some time to
+ execute. The optimal way to achieve the same result is to use the
+ \ifun{where} function:
+#v+
+ awhere (a < 0.0) = 0;
+#v-
+ Here, the expression \exmp{(a < 0.0)} returns a boolean array whose
+ dimensions are the same size as \exmp{a} but whose elements are
+ either 1 or 0, according to whether or not the corresponding
+ element of \exmp{a} is less than zero. This array of zeros and ones
+ is then passed to the \ifun{where} function, which returns a 1-d
+ integer array of indices that indicate where the elements of
+ \exmp{a} are less than zero. Finally, those elements of \exmp{a} are
+ set to zero.
+
+ Consider once more the example involving the set of \exmp{n}
+ quadratic equations presented above. Suppose that we wish to get
+ rid of the coefficients of the previous example that generated
+ non-real solutions. Using an explicit \kw{for} loop requires code
+ such as:
+#v+
+ nn = 0;
+ _for i (0, n-1, 1)
+ if (index_array i) nn++;
+
+ tmp_a = Double_Type nn;
+ tmp_b = Double_Type nn;
+ tmp_c = Double_Type nn;
+
+ j = 0;
+ _for i (0, n-1, 1)
+ {
+ if (index_array i)
+ {
+ tmp_a j = ai;
+ tmp_b j = bi;
+ tmp_c j = ci;
+ j++;
+ }
+ }
+ a = tmp_a;
+ b = tmp_b;
+ c = tmp_c;
+#v-
+ Not only is this a lot of code, making it hard to digest, but it is
+ also clumsy and error-prone. Using the \ifun{where} function, this
+ task is trivial and executes in a fraction of the time:
+#v+
+ i = where (index_array != 0);
+ a = ai;
+ b = bi;
+ c = ci;
+#v-
+
+ Most of the examples up till now assumed that the dimensions of the
+ array were known. Although the intrinsic function \ifun{length}
+ may be used to get the total number of elements of an array, it
+ cannot be used to get the individual dimensions of a
+ multi-dimensional array. The \ifun{array_shape} function may
+ be used to determine the dimensionality of an array. It may be used
+ to determine the number of rows of an array as follows:
+#v+
+ define num_rows (a)
+ {
+ return array_shape (a)0;
+ }
+#v-
+ The number of columns may be obtained in a similar manner:
+#v+
+ define num_cols (a)
+ {
+ variable dims = array_shape (a);
+ if (length(dims) > 1) return dims1;
+ return 1;
+ }
+#v-
+ The \ifun{array_shape} function may also be used to create an array
+ that has the same number of dimensions as another array:
+#v+
+ define make_int_array (a)
+ {
+ return @Array_Type (Int_Type, array_shape (a));
+ }
+#v-
+
+ Finally, the \ifun{array_info} function may be used to get
+ additional information about an array, such as its data type and
+ size.
+
+#%}}}
+
+\sect{Arrays of Arrays: A Cautionary Note}
+ Sometimes it is desirable to create an array of arrays. For example,
+#v+
+ a = Array_Type3;
+ a0 = 1:10;
+ a1 = 1:100;
+ a2 = 1:1000;
+#v-
+ will produce an array of the 3 arrays \exmp{1:10}, \exmp{1:100},
+ and \exmp{1:1000}. Index arrays may be used to access elements of
+ an array of arrays: a1,2 will produce an array of arrays that
+ consists of the elements a1 and a2. However, it is important to
+ note that setting the elements of an array of arrays via an index
+ array does not work as one might naively expect. Consider the
+ following:
+#v+
+ b = Array_Type3;
+ b* = a2,1,0;
+#v-
+ where \exmp{a} is the array of arrays given in the previous example.
+ The reader might expect \exmp{b} to have elements
+ \exmp{b0=a2}, \exmp{b1=a1}, and \exmp{b2=a0}, and be
+ surprised to learn that \exmp{b0=b1=b2=a2,1,0}. The reason
+ for this is that, by definition, \exmp{b} is an array of arrays, and
+ even though \exmp{a2,1,0} is an array of arrays, it is
+ first and foremost an array, and it is that array that is assigned
+ to the elements of \exmp{b}.
+
+#%}}}
+
+\chapter{Associative Arrays} #%{{{
+
+ An associative array differs from an ordinary array in the sense
+ that its size is not fixed and that it is indexed by a string, called
+ the \em{key}. For example, consider:
+#v+
+ A = Assoc_Type Int_Type;
+ A"alpha" = 1;
+ A"beta" = 2;
+ A"gamma" = 3;
+#v-
+ Here, \exmp{A} has been assigned to an associative array of integers
+ (\dtype{Int_Type}) and then three keys were been added to the array.
+
+ As the example suggests, an associative array may be created using
+ one of the following forms:
+\begin{tscreen}
+ Assoc_Type \em{type}
+ Assoc_Type \em{type}, \em{default-value}
+ Assoc_Type 
+\end{tscreen}
+ The last form returns an \em{un-typed} associative array capable of
+ storing values of any type.
+
+ The form involving a \em{default-value} is useful for associating a
+ default value with non-existent array members. This feature is
+ explained in more detail below.
+
+ There are several functions that are specially designed to work
+ with associative arrays. These include:
+\begin{itemize}
+\item \var{assoc_get_keys}, which returns an ordinary array of strings
+ containing the keys of the array.
+
+\item \var{assoc_get_values}, which returns an ordinary array of the
+ values of the associative array. If the associative array is
+ un-typed, then an array of \dtype{Any_Type} objects will be
+ returned.
+
+\item \var{assoc_key_exists}, which can be used to determine whether
+ or not a key exists in the array.
+
+\item \var{assoc_delete_key}, which may be used to remove a key (and
+ its value) from the array.
+\end{itemize}
+
+ To illustrate the use of an associative array, consider the problem
+ of counting the number of repeated occurrences of words in a list.
+ Let the word list be represented as an array of strings given by
+ \exmp{word_list}. The number of occurrences of each word may be
+ stored in an associative array as follows:
+#v+
+ a = Assoc_Type Int_Type;
+ foreach word (word_list)
+ {
+ if (0 == assoc_key_exists (a, word))
+ aword = 0;
+ aword++; % same as aword = aword + 1;
+ }
+#v-
+ Note that \var{assoc_key_exists} was necessary to determine whether
+ or not a word was already added to the array in order to properly
+ initialize it. However, by creating the associative array with a
+ default value of 0, the above code may be simplified to
+#v+
+ variable a, word;
+ a = Assoc_Type Int_Type, 0;
+ foreach word (word_list)
+ aword++;
+#v-
+
+ Associative arrays are extremely useful and have may other
+ applications. Whenever there is a one to one mapping between a
+ string and some object, one should always consider using an
+ associative array to represent the mapping. To illustrate this
+ point, consider the following code fragment:
+#v+
+ define call_function (name, arg)
+ {
+ if (name == "foo") return foo (arg);
+ if (name == "bar") return bar (arg);
+ .
+ .
+ if (name == "baz") return baz (arg);
+ throw InvalidParmError;
+ }
+#v-
+ This represents a mapping between names and functions. Such a
+ mapping may be written in terms of an associative array as follows:
+#v+
+ private define invalid_fun (arg) { throw InvalidParmError; }
+ Fun_Map = Assoc_TypeRef_Type, &invalid_fun;
+ define add_function (name, fun)
+ {
+ Fun_Mapname = fun;
+ }
+ add_function ("foo", &foo);
+ add_function ("bar", &bar);
+ .
+ .
+ add_function ("baz", &baz);
+ define call_function (name, arg)
+ {
+ return (@Fun_Mapname)(arg);
+ }
+#v-
+ The most redeeming feature of the version involving the series of
+ \kw{if} statements is that it is easy to understand. However, the
+ version involving the associative array has two significant
+ advantages over the former. Namely, the function lookup will be
+ much faster with a time that is independent of the item being
+ searched, and it is extensible in the sense that additional
+ functions may be added at run-time, e.g.,
+#v+
+ add_function ("bing", &bing);
+#v-
+
+#%}}}
+
+\chapter{Structures and User-Defined Types} #%{{{
+
+ A \em{structure} is a heterogeneous container object, i.e., it is
+ an object with elements whose values do not have to be of the same
+ data type. The elements or fields of a structure are named, and
+ one accesses a particular field of the structure via the field
+ name. This should be contrasted with an array whose values are of
+ the same type, and whose elements are accessed via array indices.
+
+ A \em{user-defined} data type is a structure with a fixed set of
+ fields defined by the user.
+
+\sect{Defining a Structure} #%{{{
+
+ The \kw{struct} keyword is used to define a structure. The syntax
+ for this operation is:
+\begin{tscreen}
+ struct {\em{field-name-1}, \em{field-name-2}, ... \em{field-name-N}};
+\end{tscreen}
+ This creates and returns a structure with \em{N} fields whose names
+ are specified by \em{field-name-1}, \em{field-name-2}, ...,
+ \em{field-name-N}. When a structure is created, the values of its
+ fields are initialized to \NULL.
+
+ For example,
+#v+
+ variable t = struct { city_name, population, next };
+#v-
+ creates a structure with three fields and assigns it to the
+ variable \exmp{t}.
+
+ Alternatively, a structure may be created by dereferencing
+ \dtype{Struct_Type}. Using this technique, the above structure may
+ be created using one of the two forms:
+#v+
+ t = @Struct_Type ("city_name", "population", "next");
+ t = @Struct_Type ("city_name", "population", "next");
+#v-
+ This approach is useful when creating structures dynamically where
+ one does not know the name of the fields until run-time.
+
+ Like arrays, structures are passed around by reference. Thus,
+ in the above example, the value of \exmp{t} is a reference to the
+ structure. This means that after execution of
+#v+
+ u = t;
+#v-
+ \em{both} \var{t} and \var{u} refer to the \em{same} underlying
+ structure, since only the reference was copied by the assignment. To
+ actually create a new copy of the structure, use the
+ \em{dereference} operator, e.g.,
+#v+
+ variable u = @t;
+#v-
+ It create new structure whose field names are identical to the old
+ and copies the field values to the new structure. If any of the
+ values are objects that are passed by reference, then only the
+ references will be copied. In other words,
+#v+
+ t = struct{a};
+ t.a = 1:10;
+ u = @t;
+#v-
+ will produce a structure \exmp{u} that references the same array as
+ \exmp{t}.
+
+#%}}}
+
+\sect{Accessing the Fields of a Structure} #%{{{
+
+ The dot (\var{.}) operator is used to specify the particular
+ field of structure. If \exmp{s} is a structure and \exmp{field_name}
+ is a field of the structure, then \exmp{s.field_name} specifies
+ that field of \exmp{s}. This specification can be used in
+ expressions just like ordinary variables. Again, consider
+#v+
+ t = struct { city_name, population, next };
+#v-
+ described in the last section. Then,
+#v+
+ t.city_name = "New York";
+ t.population = 13000000;
+ if (t.population > 200) t = t.next;
+#v-
+ are all valid statements involving the fields of \exmp{t}.
+
+#%}}}
+
+\labeled_sect{Linked Lists} #%{{{
+
+ One of the most important uses of structures is the creation of
+ \em{dynamic} data structures such as \em{linked-lists}.
+ A linked-list is simply a chain of structures that are linked
+ together such that one structure in the chain is the value of a
+ field of the previous structure in the chain. To be concrete,
+ consider the structure discussed earlier:
+#v+
+ t = struct { city_name, population, next };
+#v-
+ and suppose that it is desired to create a linked-list of such
+ objects to store population data.
+ The purpose of the \exmp{next} field is to provide the link to the
+ next structure in the chain. Suppose that there exists a function,
+ \exmp{read_next_city}, that reads city names and populations from a
+ file. Then the list may be created using:
+#v+
+ define create_population_list ()
+ {
+ variable city_name, population, list_root, list_tail;
+ variable next;
+
+ list_root = NULL;
+ while (read_next_city (&city_name, &population))
+ {
+ next = struct {city_name, population, next };
+
+ next.city_name = city_name;
+ next.population = population;
+ next.next = NULL;
+
+ if (list_root == NULL)
+ list_root = next;
+ else
+ list_tail.next = next;
+
+ list_tail = next;
+ }
+ return list_root;
+ }
+#v-
+ In this function, the variables \exmp{list_root} and \exmp{list_tail}
+ represent the beginning and end of the list, respectively. As long
+ as \exmp{read_next_city} returns a non-zero value, a new structure is
+ created, initialized, and then appended to the list via the
+ \exmp{next} field of the \exmp{list_tail} structure. On the first
+ time through the loop, the list is created via the assignment to the
+ \exmp{list_root} variable.
+
+ This function may be used as follows:
+#v+
+ Population_List = create_population_list ();
+ if (Population_List == NULL)
+ throw RunTimeError, "List is empty";
+#v-
+ Other functions may be created that manipulate the list. Here is one
+ that finds the city with the largest population:
+#v+
+ define get_largest_city (list)
+ {
+ variable largest;
+
+ largest = list;
+ while (list != NULL)
+ {
+ if (list.population > largest.population)
+ largest = list;
+ list = list.next;
+ }
+ return largest.city_name;
+ }
+
+ vmessage ("%s is the largest city in the list",
+ get_largest_city (Population_List));
+#v-
+ The \exmp{get_largest_city} is a typical example of how one traverses
+ a linear linked-list by starting at the head of the list and
+ successively moves to the next element of the list via the
+ \exmp{next} field.
+
+ In the previous example, a \kw{while} loop was used to traverse the
+ linked list. It is also possible to use a \kw{foreach} loop for this:
+#v+
+ define get_largest_city (list)
+ {
+ variable largest, elem;
+
+ largest = list;
+ foreach elem (list)
+ {
+ if (elem.population > largest.population)
+ largest = elem;
+ }
+ return largest.city_name;
+ }
+#v-
+ Here a \kw{foreach} loop has been used to walk the list via its
+ \exmp{next} field. If the field name linking the elements was not
+ called \exmp{next}, then it would have been necessary to use the
+ \kw{using} form of the \kw{foreach} statement. For example, if the
+ field name implementing the linked list was \exmp{next_item}, then
+#v+
+ foreach item (list) using ("next_item")
+ {
+ .
+ .
+ }
+#v-
+ would have been used. In other words, unless otherwise indicated
+ via the \kw{using} clause, \kw{foreach} walks the list using a field
+ named \exmp{next} by default.
+
+ Now consider a function that sorts the list according to population.
+ To illustrate the technique, a \em{bubble-sort} will be used, not
+ because it is efficient (it is not), but because it is simple,
+ intuitive, and provides another example of structure manipulation:
+#v+
+ define sort_population_list (list)
+ {
+ variable changed;
+ variable node, next_node, last_node;
+ do
+ {
+ changed = 0;
+ node = list;
+ next_node = node.next;
+ last_node = NULL;
+ while (next_node != NULL)
+ {
+ if (node.population < next_node.population)
+ {
+ % swap node and next_node
+ node.next = next_node.next;
+ next_node.next = node;
+ if (last_node != NULL)
+ last_node.next = next_node;
+
+ if (list == node) list = next_node;
+ node = next_node;
+ next_node = node.next;
+ changed++;
+ }
+ last_node = node;
+ node = next_node;
+ next_node = next_node.next;
+ }
+ }
+ while (changed);
+
+ return list;
+ }
+#v-
+ Note the test for equality between \exmp{list} and \exmp{node}, i.e.,
+#v+
+ if (list == node) list = next_node;
+#v-
+ It is important to appreciate the fact that the values of these
+ variables are references to structures, and that the
+ comparison only compares the references and \em{not} the actual
+ structures they reference. If it were not for this, the algorithm
+ would fail.
+
+#%}}}
+
+\sect{Defining New Types} #%{{{
+
+ A user-defined data type may be defined using the \kw{typedef}
+ keyword. In the current implementation, a user-defined data type
+ is essentially a structure with a user-defined set of fields. For
+ example, in the previous section a structure was used to represent
+ a city/population pair. We can define a data type called
+ \var{Population_Type} to represent the same information:
+#v+
+ typedef struct
+ {
+ city_name,
+ population
+ } Population_Type;
+#v-
+ This data type can be used like all other data types. For example,
+ an array of Population_Type types can be created,
+#v+
+ variable a = Population_Type10;
+#v-
+ and `populated' via expressions such as
+#v+
+ a0.city_name = "Boston";
+ a0.population = 2500000;
+#v-
+ The new type \var{Population_Type} may also be used with the
+ \var{typeof} function:
+#v+
+ if (Population_Type == typeof (a))
+ city = a.city_name;
+#v-
+ The dereference \var{@} may be used to create an instance of the
+ new type:
+#v+
+ a = @Population_Type;
+ a.city_name = "Calcutta";
+ a.population = 13000000;
+#v-
+
+ Another feature that user-defined types possess is that the action
+ of the binary and unary operations may be defined for them.
+ This idea is discussed in more detail below.
+
+#%}}}
+
+\sect{Operator Overloading}
+
+ The binary and unary operators may be extended to user-defined types.
+ To illustrate how this works, consider a data type that represents a
+ vector in 3-space:
+#v+
+ typedef struct { x, y, z } Vector_Type;
+#v-
+ and a function that instantiates such an object:
+#v+
+ define vector_new (x, y, z)
+ {
+ variable v = @Vector_Type;
+ v.x = double(x); v.y = double(y); v.z = double(z);
+ return v;
+ }
+#v-
+ This function may be used to define a function that adds two vectors
+ together:
+#v+
+ define vector_add (v1, v2)
+ {
+ return vector_new (v1.x+v2.x, v1.y+v2.y, v1.z+v2.z);
+ }
+#v-
+ Using these functions, three vectors representing the points
+ \exmp{(2,3,4)}, \exmp{(6,2,1)}, and \exmp{(-3,1,-6)} may be created using
+#v+
+ V1 = vector_new (2,3,4);
+ V2 = vector_new (6,2,1);
+ V3 = vector_new (-3,1,-6);
+#v-
+ and then added together via
+#v+
+ V4 = vector_add (V1, vector_add (V2, V3));
+#v-
+ The problem with the last statement is that it is not a very natural
+ way to express the addition of three vectors. It would be far better
+ to extend the action of the binary \exmp{+} operator to the
+ \exmp{Vector_Type} objects and then write the above sum more simply as
+#v+
+ V4 = V1 + V2 + V3;
+#v-
+
+ The \ifun{__add_binary} function defines the result of a binary
+ operation between two data types:
+\begin{tscreen}
+ __add_binary (\em{op}, \em{result-type}, \em{funct}, \em{typeA},\em{typeB});
+\end{tscreen}
+ Here, \em{op} is a string representing any one of the binary operators
+ (\exmp{"+"}, \exmp{"-"}, \exmp{"*"}, \exmp{"/"}, \exmp{"=="},...),
+ and \em{funct} is reference to a function that carries out the binary
+ operation between objects of types \em{typeA} and \em{typeB} to
+ produce an object of type \em{result-type}.
+
+ This function may be used to extend the \exmp{+} operator to
+ \em{Vector_Type} objects:
+#v+
+ __add_binary ("+", Vector_Type, &vector_add, Vector_Type, Vector_Type);
+#v-
+ Similarly the subtraction and equality operators may be extended to
+ \exmp{Vector_Type} via
+#v+
+ define vector_minus (v1, v2)
+ {
+ return vector_new (v1.x-v2.x, v1.y-v2.y, v1.z-v2.z);
+ }
+ __add_binary ("-", Vector_Type, &vector_minus, Vector_Type, Vector_Type);
+
+ define vector_eqs (v1, v2)
+ {
+ return (v1.x==v2.x) and (v1.y==v2.y) and (v1.z==v2.z);
+ }
+ __add_binary ("==", Char_Type, &vector_eqs, Vector_Type, Vector_Type);
+#v-
+ permitting a statement such as
+#v+
+ if (V2 != V1) V3 = V2 - V1;
+#v-
+ The \exmp{-} operator is also an unary operator that is customarily
+ used to change the sign of an object. Unary operations may be
+ extended to \exmp{Vector_Type} objects using the \ifun{__add_unary}
+ function:
+#v+
+ define vector_chs (v)
+ {
+ return vector_new (-v.x, -v.y, -v.z);
+ }
+ __add_unary ("-", Vector_Type, &vector_chs, Vector_Type);
+#v-
+ A trivial example of the use of the unary minus is \exmp{V4 = -V2}.
+
+ It is interesting to consider the extension of the multiplication
+ operator \exmp{*} to \exmp{Vector_Type}. A vector may be multiplied
+ by a scalar to produce another vector. This can happen in two ways as
+ reflected by the following functions:
+#v+
+ define vector_scalar_mul (v, a)
+ {
+ return vector_new (a*v.x, a*v.y, a*v.z);
+ }
+ define scalar_vector_mul (a, v)
+ {
+ return vector_new (a*v.x, a*v.y, a*v.z);
+ }
+#v-
+ Here \exmp{a} represents the scalar, which can be any object that may
+ be multiplied by a \dtype{Double_Type}, e.g., \dtype{Int_Type},
+ \dtype{Float_Type}, etc. Instead of using multiple statements
+ involving \ifun{__add_binary} to define the action of
+ \exmp{Int_Type+Vector_Type}, \exmp{Float_Type+Vector_Type}, etc, a
+ single statement using \var{Any_Type} to represent a ``wildcard''
+ type may be used:
+#v+
+ __add_binary ("*", Vector_Type, &vector_scalar_mul, Vector_Type, Any_Type);
+ __add_binary ("*", Vector_Type, &scalar_vector_mul, Any_Type, Vector_Type);
+#v-
+ There are a couple of natural possibilities for
+ \exmp{Vector_Type*Vector_Type}: The cross-product defined by
+#v+
+ define crossprod (v1, v2)
+ {
+ return vector_new (v1.y*v2.z-v1.z*v2.y,
+ v1.z*v2.x-v1.x*v2.z,
+ v1.x*v2.y-v1.y*v2.x);
+ }
+#v-
+ and the dot-product:
+#v+
+ define dotprod (v1, v2)
+ {
+ return v1.x*v2.x + v1.y*v2.y + v1.z*v2.z;
+ }
+#v-
+ The binary \exmp{*} operator between two vector types may be defined
+ to be just one of these functions--- it cannot be extended to both.
+ If the dot-product is chosen then one would use
+#v+
+ __add_binary ("*", Double_Type, &dotprod, Vector_Type_Type, Vector_Type);
+#v-
+
+ Just because it is possible to define the action of a binary or unary
+ operator on an user-defined type, it is not always wise to do so. A
+ useful rule of thumb is to ask whether defining a particular
+ operation leads to more readable and maintainable code. For example,
+ simply looking at
+#v+
+ c = a + b;
+#v-
+ in isolation one can easily overlook the fact that a function such as
+ \exmp{vector_add} may be getting executed. Moreover, in cases where
+ the action is ambiguous such as \exmp{Vector_Type*Vector_Type} it may
+ not be clear what
+#v+
+ c = a*b;
+#v-
+ means unless one knows exactly what choice was made when extending
+ the \exmp{*} operator to the types. For this reason it may
+ be wise to leave \exmp{Vector_Type*Vector_Type} undefined and use
+ ``old-fashioned'' function calls such as
+#v+
+ c = dotprod (a, b);
+ d = crossprod (a, b);
+#v-
+ to avoid the ambiguity altogether.
+
+ Finally, the \ifun{__add_string} function may be used to define the
+ string representation of an object. Examples involving the string
+ representation include:
+#v+
+ message ("The value is " + string (V));
+ vmessage ("The result of %S+%S is %S", V1, V1, V1+V2);
+ str = "The value of V is $V"$;
+#v-
+ For the \exmp{Vector_Type} one might want to use the string
+ represention generated by
+#v+
+ define vector_string (v)
+ {
+ return sprintf ("(%S,%S,%S)", v.x, v.y, v.z);
+ }
+ __add_string (Vector_Type, &vector_string);
+#v-
+
+#%}}}
+
+\chapter{Lists} #%{{{
+
+ Sometimes it is desirable to utilize an object that has many of the
+ properties of an array, but can also easily grow or shrink upon
+ demand. The \dtype{List_Type} object has such properties.
+
+ An empty list may be created either by the \ifun{list_new} function
+ or more simply using curly braces, e.g.,
+#v+
+ list = {};
+#v-
+ More generally a list of objects may be created by simply enclosing
+ them in braces. For example,
+#v+
+ list = { "hello", 7, 3.14, {&sin, &cos}}
+#v-
+ specifies a list of 4 elements, where the last element is also a list.
+ The number of items in a list may be obtained using the \ifun{length}
+ function. For the above list, \exmp{length(list)} will return 4.
+
+ One may examine the contents of the list using an array index
+ notation. For the above example, \exmp{list0} refers to the zeroth
+ element of the list (\exmp{"hello"} in this case). Similarly,
+#v+
+ list1 = 1,2,3;
+#v-
+ changes the first element of the list (7) to the array \exmp{1,2,3}.
+ Also as the case for arrays one may index from the end of the list
+ using negative indices, e.g., \exmp{list-1} refers to the last
+ element of the list.
+
+ The functions \ifun{list_insert} and \ifun{list_append} may be used
+ to add items to a list. In particular,
+ \exmp{list_insert(list,obj,nth)} will insert the object \exmp{obj}
+ into the list at the \exmp{nth} position. Similarly,
+ \exmp{list_append(list,obj,nth)} will insert the object \exmp{obj}
+ into the list right after \exmp{nth} position. If
+#v+
+ list = { "hello", 7, 3.14, {&sin, &cos}}
+#v-
+ then
+#v+
+ list_insert (list, 0, "hi");
+ list_append (list, 0, "there");
+ list_insert (list, -1, "before");
+ list_append (list, -1, "after");
+#v-
+ will result in the list
+#v+
+ {"hi", "there", "hello", 7, 3.14, "before", {&sin,&cos}, "after"}
+#v-
+
+ One might be tempted to use
+#v+
+ list = {"hi", list};
+#v-
+ to insert \exmp{"hi"} at the head of the list. However, this simply
+ creates a new list of two items: \exmp{hi} and the original list.
+
+ Items may be removed from a list via the \exmp{list_delete} function,
+ which deletes the item from the specified position and shrinks the
+ list. In the context of the above example,
+#v+
+ list_delete (list, 2);
+#v-
+ will shrink the list to
+#v+
+ {"hi", "there", 7, 3.14, "before", {&sin,&cos}, "after"}
+#v-
+
+ Another way of removing items from the list is to use the
+ \ifun{list_pop} function. The main difference between it and
+ \ifun{list_delete} is that \ifun{list_pop} returns the deleted item.
+ For example,
+#v+
+ item = list_pop (list, -2);
+#v-
+ would reduce the list to
+#v+
+ {"hi", "there", 7, 3.14, "before", "after"}
+#v-
+ and assign \exmp{{&sin,&cos}} to \exmp{item}. If the position
+ parameter to \ifun{list_pop} is left unspecified, then the position
+ will default to the zeroth, i.e., \exmp{list_pop(list)} is
+ equaivalent to \exmp{list_pop(list,0)}.
+
+ To copy a list, use the dereference operator \var{@}:
+#v+
+ new_list = @list;
+#v-
+ Keep in mind that this does not perform a so-called deep copy. If
+ any of the elements of the list are objects that are assigned by
+ reference, only the references will be copied.
+
+ The \ifun{list_reverse} function may be used to reverse the
+ elements of a list. Note that this does not create a new list. To
+ create new list that is the reverse of another, copy the original
+ using the dereference operator (@) and reverse that, i.e.,
+#v+
+ new_list = list_reverse (@list);
+#v-
+
+#%}}}
+
+\chapter{Error Handling} #%{{{
+
+ All non-trivial programs or scripts must be deal with the
+ possibility of run-time errors. In fact, one sign of a seasoned
+ programmer is that such a person pays particular attention to error
+ handling. This chapter presents some techniques for handling
+ errors using \slang. First the traditional method of using return
+ values to indicate errors will be discussed. Then attention will
+ turn to \slang's more powerful exception handling mechanisms.
+
+\sect{Traditional Error Handling} #%{{{
+ The simplist and perhaps most common mechanism for signaling a
+ failure or error in a function is for the function to return an
+ error code, e.g.,
+#v+
+ define write_to_file (file, str)
+ {
+ variable fp = fopen (file, "w");
+ if (fp == NULL)
+ return -1;
+ if (-1 == fputs (str, fp))
+ return -1;
+ if (-1 == fclose (fp))
+ return -1;
+ return 0;
+ }
+#v-
+ Here, the \exmp{write_to_file} function returns 0 if successful, or
+ -1 upon failure. It is up to the calling routine to check the
+ return value of \exmp{write_to_file} and act accordingly. For
+ instance:
+#v+
+ if (-1 == write_to_file ("/tmp/foo", "bar"))
+ {
+ () = fprintf (stderr, "Write failed\n");
+ exit (1);
+ }
+#v-
+
+ The main advantage of this technique is in its simplicity. The
+ weakness in this approach is that the return value must be checked
+ for every function that returns information in this way. A more
+ subtle problem is that even minor changes to large programs can
+ become unwieldy. To illustrate the latter aspect, consider the
+ following function which is supposed to be so simple that it cannot
+ fail:
+#v+
+ define simple_function ()
+ {
+ do_something_simple ();
+ more_simple_stuff ();
+ }
+#v-
+ Since the functions called by \exmp{simple_function} are not
+ supposed to fail, \exmp{simple_function} itself cannot fail and
+ there is no return value for its callers to check:
+#v+
+ define simple ()
+ {
+ simple_function ();
+ another_simple_function ();
+ }
+#v-
+ Now suppose that the function \exmp{do_something_simple} is changed
+ in some way that could cause it to fail from time to time. Such a
+ change could be the result of a bug-fix or some feature enhancement.
+ In the traditional error handling approach, the function would need
+ to be modified to return an error code. That error code would have
+ to be checked by the calling routine \exmp{simple_function} and as a
+ result, it can now fail and must return an error code. The obvious
+ effect is that a tiny change in one function can be felt up the
+ entire call chain. While making the appropriate changes for a small
+ program can be a trivial task, for a large program this could be a
+ major undertaking opening the possibility of introducing additional
+ errors along the way. In a nutshell, this is a code maintenance
+ issue. For this reason, a veteran programmer using this approach to
+ error handling will consider such possibilities from the outset and
+ allow for error codes the first time regardless of whether the
+ functions can fail or not, e.g.,
+#v+
+ define simple_function ()
+ {
+ if (-1 == do_something_simple ())
+ return -1;
+ if (-1 == more_simple_stuff ())
+ return -1;
+ return 0;
+ }
+ define simple ()
+ {
+ if (-1 == simple_function ())
+ return -1;
+ if (-1 == another_simple_function ())
+ return -1;
+ return 0;
+ }
+#v-
+
+ Although latter code containing explicit checks for failure is more
+ robust and more easily maintainable than the former, it is also less
+ readable. Moreover, since return values are now checked the code
+ will execute somewhat slower than the code that lacks such checks.
+ There is also no clean separation of the error handling code from
+ the other code. This can make it difficult to maintain if the error
+ handling semantics of a function change. The next section discusses
+ another approach to error handling that tries to address these
+ issues.
+
+#%}}}
+
+\sect{Error Handling through Exceptions}
+
+ This section describes \slang's exception model.
+ The idea is that when a function encounters an error,
+ instead of returning an error code, it simply gives up and
+ \em{throws} an exception. This idea will be fleshed out in
+ what follows.
+
+\sect1{Introduction to Exceptions} #%{{{
+
+ Consider the \exmp{write_to_file} function used in the previous
+ section but adapted to throw an exception:
+#v+
+ define write_to_file (file, str)
+ {
+ variable fp = fopen (file, "w");
+ if (fp == NULL)
+ throw OpenError;
+ if (-1 == fputs (str, fp))
+ throw WriteError;
+ if (-1 == fclose (fp))
+ throw WriteError;
+ }
+#v-
+ Here the \kw{throw} statement has been used to generate the
+ appropriate exception, which in this case is either an
+ \exmp{OpenError} exception or a \var{WriteError} exception. Since
+ the function now returns nothing (no error code), it may be called as
+#v+
+ write_to_file ("/tmp/foo", "bar");
+ next_statement;
+#v-
+ As long as the \exmp{write_to_file} function encounters no errors,
+ control passes from \exmp{write_to_file} to \exmp{next_statement}.
+
+ Now consider what happens when the function encounters an error. For
+ concreteness assume that the \ifun{fopen} function failed causing
+ \exmp{write_to_file} to throw the \var{OpenError} exception. The
+ \exmp{write_to_file} function will stop execution after executing
+ the \exmp{throw} statement and return to its caller. Since no
+ provision has been made to handle the exception,
+ \exmp{next_statement} will not execute and control will pass to the
+ previous caller on the call stack. This process will continue until
+ the exception is either handled or until control reaches the
+ top-level at which point the interpreter will terminate. This
+ process is known as \em{unwinding} of the call stack.
+
+ An simple exception handler may be created through the use of a
+ \em{try-catch} statement, such as
+#v+
+ try
+ {
+ write_to_file ("/tmp/foo", "bar");
+ }
+ catch OpenError:
+ {
+ message ("*** Warning: failed to open /tmp/foo.");
+ }
+ next_statement;
+#v-
+ The above code works as follows: First the statement (or statements)
+ inside the try-block are executed. As long as no exception occurs,
+ once they have executed, control will pass on to \exmp{next_statement},
+ skipping the catch statement(s).
+
+ If an exception occurs while executing the statements in the
+ try-block, any remaining statements in the block will be skipped and
+ control will pass to the ``catch'' portion of the exception handler.
+ This may consist of one or more \kw{catch} statements and an optional
+ \em{finally} statement. Each \kw{catch} statement specifies a list
+ of exceptions it will handle as well as the code that is to be
+ excecuted when a matching exception is caught. If a matching \kw{catch}
+ statement is found for the exception, the exception will be cleared
+ and the code associated with the catch statement will get executed.
+ Control will then pass to \exmp{next_statement} (or first to the
+ code in an optional \kw{finally} block).
+
+ Catch-statements are tested against the exception in the order that
+ they appear. Once a matching \kw{catch} statement is found, the
+ search will terminate. If no matching \kw{catch}-statement is
+ found, an optional \kw{finally} block will be processed, and the
+ call-stack will continue to unwind until either a matching exception
+ handler is found or the interpreter terminates.
+
+ In the above example, an exception handler was established for the
+ \exmp{OpenError} exception. The error handling code for this exception will
+ cause a warning message to be displayed. Execution will resume at
+ \exmp{next_statement}.
+
+ Now suppose that \exmp{write_to_file} successfully opened the file,
+ but that for some reason, e.g., a full disk, the actual write
+ operation failed. In such a case, \exmp{write_to_file} will throw a
+ \exmp{WriteError} exception passing control to the caller. The file
+ will remain on the disk but not fully written. An exception handler can
+ be added for \exmp{WriteError} that removes the file:
+
+#v+
+ try
+ {
+ write_to_file ("/tmp/foo", "bar");
+ }
+ catch OpenError:
+ {
+ message ("*** Warning: failed to open /tmp/foo.");
+ }
+ catch WriteError:
+ {
+ () = remove ("/tmp/foo");
+ message ("*** Warning: failed to write to /tmp/foo");
+ }
+ next_statement;
+#v-
+ Here the exception handler for \exmp{WriteError} uses the
+ \ifun{remove} intrinsic function to delete the file and then issues a warning
+ message. Note that the \ifun{remove} intrinsic uses the traditional
+ error handling mechanism--- in the above example its return status
+ has been discarded.
+
+ Above it was assumed that failure to write to the file was not
+ critical allowing a warning message to suffice upon failure. Now
+ suppose that it is important for the file to be written but that it
+ is still desirable for the file to be removed upon failure. In this
+ scenario, \exmp{next_statement} should not get executed upon
+ failure. This can be achieved as follows:
+#v+
+ try
+ {
+ write_to_file ("/tmp/foo", "bar");
+ }
+ catch WriteError:
+ {
+ () = remove ("/tmp/foo");
+ throw WriteError;
+ }
+ next_statement;
+#v-
+ Here the exception handler for \exmp{WriteError} removes the file
+ and then re-throws the exception.
+
+#%}}}
+
+\sect1{Obtaining information about the exception}
+ When an exception is generated, an exception object is thrown. The
+ object is a structure containing the following fields:
+\begin{descrip}
+ \tag{error}
+ The exception error code (\dtype{Int_Type}).
+ \tag{descr}
+ A brief description of the error (\dtype{String_Type}).
+ \tag{file}
+ The filename containing the code that generated the exception
+ (\dtype{String_Type}).
+ \tag{line}
+ The line number where the exception was thrown
+ (\dtype{Int_Type}).
+ \tag{function}
+ The name of the currently executing function, or \NULL if at top-level
+ (\dtype{String_Type}).
+ \tag{message}
+ A text message that may provide more information about the exception
+ (\dtype{String_Type}).
+ \tag{object}
+ A user-defined object.
+\end{descrip}
+
+ If it is desired to have information about the exception, then
+ an alternative form of the \var{try} statement must be used:
+#v+
+ try (e)
+ {
+ % try-block code
+ }
+ catch SomeException: { code ... }
+#v-
+ If an exception occurs while executing the code in the try-block,
+ then the variable \exmp{e} will be assigned the value of the
+ exception object. As a simple example, suppose that the file
+ \tt{foo.sl} consists of:
+#v+
+ define invert_x (x)
+ {
+ if (x == 0)
+ throw DivideByZeroError;
+ return 1/x;
+ }
+#v-
+ and that the code is called using
+#v+
+ try (e)
+ {
+ y = invert_x (0);
+ }
+ catch DivideByZeroError:
+ {
+ vmessage ("Caught %s, generated by %s:%d\n",
+ e.descr, e.file, e.line);
+ vmessage ("message: %s\nobject: %S\n",
+ e.message, e.object);
+ y = 0;
+ }
+#v-
+ When this code is executed, it will generate the message:
+#v+
+ Caught Divide by Zero, generated by foo.sl:5
+ message: Divide by Zero
+ object: NULL
+#v-
+ In this case, the value of the \exmp{message} field was assigned a
+ default value. The reason that the \exmp{object} field is \NULL is
+ that no object was specified when the exception was generated.
+ In order to throw an object, a more complex form of \kw{throw}
+ statement must be used:
+\begin{tscreen}
+ \kw{throw} \em{exception-name} , \em{message} , \em{object} 
+\end{tscreen}
+ where the square brackets indicate optional parameters
+
+ To illustrate this form, suppose that \exmp{invert_x} is modified to
+ accept an array object:
+#v+
+ private define invert_x(x)
+ {
+ variable i = where (x == 0);
+ if (length (i))
+ throw DivideByZeroError,
+ "Array contains elements that are zero", i;
+ return 1/x;
+ }
+#v-
+ In this case, the message field of the exception will contain
+ the string \exmp{"Array contains elements that are zero"} and the
+ object field will be set to the indices of the zero elements.
+
+\sect1{The finally block}
+ The full form of the try-catch statement obeys the following syntax:
+\begin{tscreen}
+ try \em{(opt-e)}
+ \{
+ \em{try-block-statements}
+ }
+ catch \em{Exception-List-1}: { \em{catch-block-1-statements} }
+ .
+ .
+ catch \em{Exception-List-N}: { \em{catch-block-N-statements} }
+ \em{} finally { \em{finally-block-statements} } \em{}
+\end{tscreen}
+ Here an exception-list is simply a list of exceptions such as:
+#v+
+ catch OSError, RunTimeError:
+#v-
+ The last clause of a try-statement is the \em{finally-block}, which is
+ optional and is introduced using the \kw{finally} keyword. If the
+ try-statement contains no catch-clauses, then it must specify a
+ finally-clause, otherwise a syntax error will result.
+
+ If the finally-clause is present, then its corresponding statements
+ will be executed \bf{regardless of whether an exception occurs}. If
+ an exception occurs while executing the statements in the try-block,
+ then the finally-block will execute after the code in any of the
+ catch-blocks. The finally-clause is useful for freeing any
+ resources (file handles, etc) allocated by the try-block regardless
+ of whether an exception has occurred.
+
+\sect1{Creating new exceptions: the Exception Hierarchy} #%{{{
+
+ The following table gives the class hierarchy for the built-in
+ exceptions.
+#v+
+ AnyError
+ OSError
+ MallocError
+ ImportError
+ ParseError
+ SyntaxError
+ DuplicateDefinitionError
+ UndefinedNameError
+ RunTimeError
+ InvalidParmError
+ TypeMismatchError
+ UserBreakError
+ StackError
+ StackOverflowError
+ StackUnderflowError
+ ReadOnlyError
+ VariableUninitializedError
+ NumArgsError
+ IndexError
+ UsageError
+ ApplicationError
+ InternalError
+ NotImplementedError
+ LimitExceededError
+ MathError
+ DivideByZeroError
+ ArithOverflowError
+ ArithUnderflowError
+ DomainError
+ IOError
+ WriteError
+ ReadError
+ OpenError
+ DataError
+ UnicodeError
+ InvalidUTF8Error
+ UnknownError
+#v-
+
+ The above table shows that the root class of all exceptions is
+ \var{AnyError}. This means that a catch block for \var{AnyError}
+ will catch any exception. The \var{OSError}, \var{ParseError}, and
+ \var{RunTimeError} exceptions are subclasses of the \var{AnyError}
+ class. Subclasses of \var{OSError} include \var{MallocError},
+ and \var{ImportError}. Hence a handler for the
+ \var{OSError} exception will catch \var{MallocError} but not
+ \var{ParseError} since the latter is not a subclass of
+ \var{OSError}.
+
+ The user may extend this tree with new exceptions using the
+ \ifun{new_exception} function. This function takes three arguments:
+\begin{tscreen}
+ new_exception (\em{exception-name}, \em{baseclass}, \em{description});
+\end{tscreen}
+ The \em{exception-name} is the name of the exception, \em{baseclass}
+ represents the node in the exception hierarchy where it is to be
+ placed, and \em{description} is a string that provides a brief
+ description of the exception.
+
+ For example, suppose that you are writing some code that processes
+ numbers stored in a binary format. In particular, assume that the
+ format specifies that data be stored in a specific byte-order, e.g.,
+ in big-endian form. Then it might be useful to extend the
+ \var{DataError} exception with \var{EndianError}. This is easily
+ accomplished via
+#v+
+ new_exception ("EndianError", DataError, "Invalid byte-ordering");
+#v-
+ This will create a new exception object called \var{EndianError}
+ subclassed on \var{DataError}, and code that catches the \var{DataError}
+ exception will additionally catch the \var{EndianError} exception.
+
+#%}}}
+
+#%}}}
+
+\chapter{Loading Files: evalfile, autoload, and require}
+
+\labeled_chapter{Modules} #%{{{
+
+\sect{Introduction}
+ A module is a shared object that may be dynamically linked into the
+ interpreter at run-time to provide the interpreter with additional
+ intrinsic functions and variables. Several modules are distributed
+ with the stock version of the \slang library, including a
+ \module{pcre} module that allows the interpreter to make use of the
+ \em{Perl Compatible Regular Expression library}, a \module{png}
+ module that allows the interpreter to easily read and write PNG
+ files, and a \module{rand} module for producing random numbers.
+ There are also a number of modules for the interpreter that are not
+ distributed with the library. See
+ \url{http://www.jedsoft.org/slang/modules/} for links to some of
+ those.
+
+\sect{Using Modules}
+
+ In order to make use of a module, it must first be ``imported'' into
+ the interpreter. There are two ways to go about this. One is to
+ use the \ifun{import} function to dynamically link-in the specified
+ module, e.g.,
+#v+
+ import ("pcre");
+#v-
+ will dynamically link to the \module{pcre} module and make its
+ symbols available to the interpreter using the active namespace.
+ However, this is not the preferred method for loading a module.
+
+ Module writers are encouraged to distribute a module with a file of
+ \slang code that performs the actual import of the module. Rather
+ than a user making direct use of the \ifun{import} function, the
+ preferred method of loading the modules is to load that file
+ instead. For example the \module{pcre} module is distributed with a
+ file called \file{pcre.sl} that contains little more than the
+ \exmp{import("pcre")} statement. To use the \module{pcre} module,
+ load \file{pcre.sl}, e.g.,
+#v+
+ require ("pcre");
+#v-
+
+ The main advantage of this approach to loading a module is that the
+ functionality provided by the module may be split between intrinsic
+ functions in the module proper, and interpreted functions contained
+ in the \exmp{.sl} file. In such a case, loading the module via
+ \ifun{import} would only provide partial functionality. The
+ \module{png} module provides a simple example of this concept. The
+ current version of the \exmp{png} module consists of a couple intrinsic
+ functions (\ifun{png_read} and \ifun{png_write}) contained in the
+ shared object (\file{png-module.so}), and a number of other
+ interpreted \slang functions defined in \file{png.sl}. Using the
+ \ifun{import} statement to load the module would miss the latter set
+ of functions.
+
+ In some cases, the symbols in a module may conflict with symbols
+ that are currently defined by the interpreter. In order to avoid
+ the conflict, it may be necessary to load the module into its own
+ namespace and access its symbols via the namespace prefix. For
+ example, the GNU Scientific Library Special Function module,
+ \module{gslsf}, defines a couple hundred functions, some with common
+ names such as \exmp{zeta}. In order to avoid any conflict, it is
+ recommended that the symbols from such a module be imported into a
+ separate namespace. This may be accomplished by specifying the
+ namespace as a second argument to the \exmp{require} function, e.g.,
+#v+
+ require ("gslsf", "gsl");
+ .
+ .
+ y = gsl->zeta(x);
+#v-
+ This form requires that the module's symbols be accessed via the
+ namespace qualifier \exmp{"gsl->"}.
+
+#%}}}
+
+\chapter{File Input/Output} #%{{{
+
+ \slang provides built-in support for two different I/O facilities.
+ The simplest interface is modeled upon the C language \em{stdio}
+ interface and consists of functions such as \ifun{fopen},
+ \ifun{fgets}, etc. The other interface is modeled on a lower level
+ POSIX interface consisting of functions such as \ifun{open},
+ \ifun{read}, etc. In addition to permitting more control, the lower
+ level interface permits one to access network objects as well as disk
+ files.
+
+ For reading data formatted in text files, e.g., columns of numbers,
+ then do not overlook the high-level routines in the \slsh library. In
+ particular, the \sfun{readascii} function is quite flexible and can
+ read data from text files that are formatted in a variety of ways.
+ For data stored in a standard binary format such as HDF or FITS, then
+ the corresponding modules should be used.
+
+\sect{Input/Output via stdio}
+\sect1{Stdio Overview}
+ The \em{stdio} interface consists of the following functions:
+\begin{itemize}
+\item \ifun{fopen}: opens a file for reading or writing.
+
+\item \ifun{fclose}: closes a file opened by \ifun{fopen}.
+
+\item \ifun{fgets}: reads a line from a file.
+
+\item \ifun{fputs}: writes text to a file.
+
+\item \var{fprintf}: writes formatted text to a file.
+
+\item \ifun{fwrite}: writes one of more objects to a file.
+
+\item \ifun{fread}: reads a specified number of objects from
+ a file.
+
+\item \ifun{fread_bytes}: reads a specified number of bytes from a
+ file and returns them as a string.
+
+\item \ifun{feof}: tests if a file pointer is at the
+ end of the file.
+
+\item \ifun{ferror}: tests whether or not the stream
+ associated with a file has an error.
+
+\item \ifun{clearerr}: clears the end-of-file and error
+ indicators for a stream.
+
+\item \ifun{fflush}, forces all buffered data associated with
+ a stream to be written out.
+
+\item \ifun{ftell}: queries the file position indicator
+ a the stream.
+
+\item \ifun{fseek}: sets the position of a file
+ position indicator of the stream.
+
+\item \ifun{fgetslines}: reads all the lines from a text file and
+ returns them as an array of strings.
+
+\end{itemize}
+
+ In addition, the interface supports the \ifun{popen} and \ifun{pclose}
+ functions on systems where the corresponding C functions are available.
+
+ Before reading or writing to a file, it must first be opened using
+ the \ifun{fopen} function. The only exceptions to this rule involve
+ use of the pre-opened streams: \ivar{stdin}, \ivar{stdout}, and
+ \ivar{stderr}. \ifun{fopen} accepts two arguments: a file name and a
+ string argument that indicates how the file is to be opened, e.g.,
+ for reading, writing, update, etc. It returns a \var{File_Type}
+ stream object that is used as an argument to all other functions of
+ the \em{stdio} interface. Upon failure, it returns \NULL. See the
+ reference manual for more information about \ifun{fopen}.
+
+\sect1{Stdio Examples}
+
+ In this section, some simple examples of the use of the \em{stdio}
+ interface is presented. It is important to realize that all the
+ functions of the interface return something, and that return value
+ must be handled in some way by the caller.
+
+ The first example involves writing a function to count the number of
+ lines in a text file. To do this, we shall read in the lines, one by
+ one, and count them:
+#v+
+ define count_lines_in_file (file)
+ {
+ variable fp, line, count;
+
+ fp = fopen (file, "r"); % Open the file for reading
+ if (fp == NULL)
+ throw OpenError, "$file failed to open"$;
+
+ count = 0;
+ while (-1 != fgets (&line, fp))
+ count++;
+
+ () = fclose (fp);
+ return count;
+ }
+#v-
+ Note that \exmp{&line} was passed to the \ifun{fgets} function. When
+ \ifun{fgets} returns, \var{line} will contain the line of text read in
+ from the file. Also note how the return value from \ifun{fclose} was
+ handled (discarded in this case).
+
+ Although the preceding example closed the file via \ifun{fclose},
+ there is no need to explicitly close a file because the interpreter will
+ automatically close a file when it is no longer referenced. Since
+ the only variable to reference the file is \var{fp}, it would have
+ automatically been closed when the function returned.
+
+ Suppose that it is desired to count the number of characters in the
+ file instead of the number of lines. To do this, the \var{while}
+ loop could be modified to count the characters as follows:
+#v+
+ while (-1 != fgets (&line, fp))
+ count += strlen (line);
+#v-
+ The main difficulty with this approach is that it will not work for
+ binary files, i.e., files that contain null characters. For such
+ files, the file should be opened in \em{binary} mode via
+#v+
+ fp = fopen (file, "rb");
+#v-
+ and then the data read using the \ifun{fread} function:
+#v+
+ while (-1 != fread (&line, Char_Type, 1024, fp))
+ count += length (line);
+#v-
+ The \ifun{fread} function requires two additional arguments: the type
+ of object to read (\var{Char_Type} in the case), and the number of
+ such objects to be read. The function returns the number of objects
+ actually read in the form of an array of the specified type, or -1
+ upon failure.
+
+ Sometimes it is more convenient to obtain the data from a file in the form
+ of a character string instead of an array of characters. The
+ \exmp{fread_bytes} function may be used in such situations. Using
+ this function, the equivalent of the above loop is
+#v+
+ while (-1 != fread_bytes (&line, 1024, fp))
+ count += bstrlen (line);
+#v-
+
+ The \kw{foreach} construct also works with \var{File_Type} objects.
+ For example, the number of characters in a file may be counted via
+#v+
+ foreach ch (fp) using ("char")
+ count++;
+#v-
+ Similarly, one can count the number of lines using:
+#v+
+ foreach line (fp) using ("line")
+ {
+ num_lines++;
+ count += strlen (line);
+ }
+#v-
+ Often one is not interested in trailing whitespace in the lines of a
+ file. To have trailing whitespace automatically stripped from the
+ lines as they are read in, use the \exmp{"wsline"} form, e.g.,
+#v+
+ foreach line (fp) using ("wsline")
+ {
+ .
+ .
+ }
+#v-
+
+ Finally, it should be mentioned that none of these examples should
+ be used to count the number of bytes in a file when that
+ information is more readily accessible by another means. For
+ example, it is preferable to get this information via the
+ \ifun{stat_file} function:
+#v+
+ define count_chars_in_file (file)
+ {
+ variable st;
+
+ st = stat_file (file);
+ if (st == NULL)
+ throw IOError, "stat_file failed";
+ return st.st_size;
+ }
+#v-
+
+\sect{POSIX I/O}
+
+\sect{Advanced I/O techniques}
+
+ The previous examples illustrate how to read and write objects of a
+ single data-type from a file, e.g.,
+#v+
+ num = fread (&a, Double_Type, 20, fp);
+#v-
+ would result in a \exmp{Double_Typenum} array being assigned to
+ \exmp{a} if successful. However, suppose that the binary data file
+ consists of numbers in a specified byte-order. How can one read
+ such objects with the proper byte swapping? The answer is to use
+ the \ifun{fread_bytes} function to read the objects as a (binary)
+ character string and then \em{unpack} the resulting string into the
+ specified data type, or types. This process is facilitated using
+ the \ifun{pack} and \ifun{unpack} functions.
+
+ The \ifun{pack} function follows the syntax
+\begin{tscreen}
+ BString_Type pack (\em{format-string}, \em{item-list});
+\end{tscreen}
+ and combines the objects in the \em{item-list} according to
+ \em{format-string} into a binary string and returns the result.
+ Likewise, the \ifun{unpack} function may be used to convert a binary
+ string into separate data objects:
+\begin{tscreen}
+ (\em{variable-list}) = unpack (\em{format-string}, \em{binary-string});
+\end{tscreen}
+
+ The format string consists of one or more data-type specification
+ characters, and each may be followed by an optional decimal length
+ specifier. Specifically, the data-types are specified according to
+ the following table:
+#v+
+ c char
+ C unsigned char
+ h short
+ H unsigned short
+ i int
+ I unsigned int
+ l long
+ L unsigned long
+ j 16 bit int
+ J 16 unsigned int
+ k 32 bit int
+ K 32 bit unsigned int
+ f float
+ d double
+ F 32 bit float
+ D 64 bit float
+ s character string, null padded
+ S character string, space padded
+ z character string, null padded
+ x a null pad character
+#v-
+ A decimal length specifier may follow the data-type specifier. With
+ the exception of the \exmp{s} and \exmp{S} specifiers, the length
+ specifier indicates how many objects of that data type are to be
+ packed or unpacked from the string. When used with the \exmp{s} or
+ \exmp{S} specifiers, it indicates the field width to be used. If the
+ length specifier is not present, the length defaults to one.
+
+ With the exception of \exmp{c}, \exmp{C}, \exmp{s}, \exmp{S}, \exmp{z}, and
+ \exmp{x}, each of these may be prefixed by a character that indicates
+ the byte-order of the object:
+#v+
+ > big-endian order (network order)
+ < little-endian order
+ = native byte-order
+#v-
+ The default is to use the native byte order.
+
+ Here are a few examples that should make this more clear:
+#v+
+ a = pack ("cc", 'A', 'B'); % ==> a = "AB";
+ a = pack ("c2", 'A', 'B'); % ==> a = "AB";
+ a = pack ("xxcxxc", 'A', 'B'); % ==> a = "\0\0A\0\0B";
+ a = pack ("h2", 'A', 'B'); % ==> a = "\0A\0B" or "\0B\0A"
+ a = pack (">h2", 'A', 'B'); % ==> a = "\0\xA\0\xB"
+ a = pack ("<h2", 'A', 'B'); % ==> a = "\0B\0A"
+ a = pack ("s4", "AB", "CD"); % ==> a = "AB\0\0"
+ a = pack ("s4s2", "AB", "CD"); % ==> a = "AB\0\0CD"
+ a = pack ("S4", "AB", "CD"); % ==> a = "AB "
+ a = pack ("S4S2", "AB", "CD"); % ==> a = "AB CD"
+#v-
+
+ When unpacking, if the length specifier is greater than one, then an
+ array of that length will be returned. In addition, trailing
+ whitespace and null characters are stripped when unpacking an object
+ given by the \exmp{S} specifier. Here are a few examples:
+#v+
+ (x,y) = unpack ("cc", "AB"); % ==> x = 'A', y = 'B'
+ x = unpack ("c2", "AB"); % ==> x = 'A', 'B'
+ x = unpack ("x<H", "\0\xAB\xCD"); % ==> x = 0xCDABuh
+ x = unpack ("xxs4", "a b c\0d e f"); % ==> x = "b c\0"
+ x = unpack ("xxS4", "a b c\0d e f"); % ==> x = "b c"
+#v-
+
+\sect1{Example: Reading /var/log/wtmp}
+
+ Consider the task of reading the Unix system file
+ \file{/var/log/utmp}, which contains login records about who logged
+ onto the system. This file format is documented in section 5 of the
+ online Unix man pages, and consists of a sequence of entries
+ formatted according to the C structure \exmp{utmp} defined in the
+ \file{utmp.h} C header file. The actual details of the structure
+ may vary from one version of Unix to the other. For the purposes of
+ this example, consider its definition under the Linux operating
+ system running on an Intel 32 bit processor:
+#v+
+ struct utmp {
+ short ut_type; /* type of login */
+ pid_t ut_pid; /* pid of process */
+ char ut_line12; /* device name of tty - "/dev/" */
+ char ut_id2; /* init id or abbrev. ttyname */
+ time_t ut_time; /* login time */
+ char ut_user8; /* user name */
+ char ut_host16; /* host name for remote login */
+ long ut_addr; /* IP addr of remote host */
+ };
+#v-
+ On this system, \exmp{pid_t} is defined to be an \exmp{int} and
+ \exmp{time_t} is a \exmp{long}. Hence, a format specifier for the
+ \var{pack} and \var{unpack} functions is easily constructed to be:
+#v+
+ "h i S12 S2 l S8 S16 l"
+#v-
+ However, this particular definition is naive because it does not
+ allow for structure padding performed by the C compiler in order to
+ align the data types on suitable word boundaries. Fortunately, the
+ intrinsic function \var{pad_pack_format} may be used to modify a
+ format by adding the correct amount of padding in the right places.
+ In fact, \var{pad_pack_format} applied to the above format on an
+ Intel-based Linux system produces the result:
+#v+
+ "h x2 i S12 S2 x2 l S8 S16 l"
+#v-
+ Here we see that 4 bytes of padding were added.
+
+ The other missing piece of information is the size of the structure.
+ This is useful because we would like to read in one structure at a
+ time using the \ifun{fread} function. Knowing the size of the
+ various data types makes this easy; however it is even easier to use
+ the \ifun{sizeof_pack} intrinsic function, which returns the size (in
+ bytes) of the structure described by the pack format.
+
+ So, with all the pieces in place, it is rather straightforward to
+ write the code:
+#v+
+ variable format, size, fp, buf;
+
+ typedef struct
+ {
+ ut_type, ut_pid, ut_line, ut_id,
+ ut_time, ut_user, ut_host, ut_addr
+ } UTMP_Type;
+
+ format = pad_pack_format ("h i S12 S2 l S8 S16 l");
+ size = sizeof_pack (format);
+
+ define print_utmp (u)
+ {
+
+ () = fprintf (stdout, "%-16s %-12s %-16s %s\n",
+ u.ut_user, u.ut_line, u.ut_host, ctime (u.ut_time));
+ }
+
+ fp = fopen ("/var/log/utmp", "rb");
+ if (fp == NULL)
+ throw OpenError, "Unable to open utmp file";
+
+ () = fprintf (stdout, "%-16s %-12s %-16s %s\n",
+ "USER", "TTY", "FROM", "LOGIN@");
+
+ variable U = @UTMP_Type;
+
+ while (-1 != fread (&buf, Char_Type, size, fp))
+ {
+ set_struct_fields (U, unpack (format, buf));
+ print_utmp (U);
+ }
+
+ () = fclose (fp);
+#v-
+ A few comments about this example are in order. First of all, note
+ that a new data type called \exmp{UTMP_Type} was created, although
+ this was not really necessary. The file was opened in binary mode,
+ but this too was optional because, for example, on a Unix system 
+ there is no distinction between binary and text modes. The
+ \exmp{print_utmp} function does not print all of the structure
+ fields. Finally, last but not least, the return values from
+ \sfun{fprintf} and \ifun{fclose} were handled by discarding them.
+
+#%}}}
+
+\labeled_chapter{slsh}
+
+ \slsh, also known as the S-Lang shell, is an application that is
+ included in the stock \slang distribution. As some binary
+ distributions include \slsh as a separate package it must be
+ installed separately, e.g.,
+#v+
+ apt-get install slsh
+#v-
+ on Debian Linux systems. The use of \slsh in its interactive mode
+ was discussed briefly in the \ref{Introduction}. This chapter
+ concentrates on the use of \slsh for writing executable \slang
+ scripts.
+
+\sect{Running slsh}
+ When run the \exmp{--help} command-line argument, \slsh displays a
+ brief usage message:
+#v+
+ # slsh --help
+ Usage: slsh OPTIONS -|file args...
+ --help Print this help
+ --version Show slsh version information
+ -e string Execute 'string' as S-Lang code
+ -g Compile with debugging code, tracebacks, etc
+ -n Don't load personal init file
+ --init file Use this file instead of ~/.slshrc
+ --no-readline Do not use readline
+ -i Force interactive input
+ -t Test mode. If slsh_main exists, do not call it
+ -v Show verbose loading messages
+ -Dname Define "name" as a preprocessor symbol
+
+ Note: - and -i are mutually exclusive
+
+ Default search path: /usr/local/share/slsh
+#v-
+
+ When started with no arguments, \slsh will start in interactive mode
+ and take input from the terminal. As the usage message indicates
+ \slsh loads a personal initialization file called \file{.slshrc} (on
+ non-Unix systems, this file is called \file{slsh.rc}). The contents
+ of this file must be valid \slang code, but are otherwise arbitrary.
+ One use of this file is to define commonly used functions and to
+ setup personal search paths.
+
+ \slsh will run in non-interactive mode when started with a file (also
+ known as a ``script'') as its first (non-option) command-line
+ argument. The rest of the arguments on the command line serve as
+ arguments for the script. The next section deals with the use of the
+ \exmp{cmdopt} routines for parsing those arguments.
+
+ \slsh will read the script and feed it to the \slang interpreter for
+ execution. If the script defines a public function called
+ \sfun{slsh_main}, then \slsh will call it after the script has been
+ loaded. In this sense, \exmp{slsh_main} is analogous to \exmp{main}
+ in \bf{C} or \bf{C++}.
+
+ A typical \slsh script is be structured as
+#v+
+ #!/usr/bin/env slsh
+ .
+ .
+ define slsh_main ()
+ {
+ .
+ .
+ }
+#v-
+ The first line of the script Unix-specific and should be familiar to
+ Unix users. Typically, the code before \sfun{slsh_main} will load
+ any required modules or packages, and define other functions to be
+ used by the script.
+
+ Although the use of \sfun{slsh_main} is not required, its use is
+ strongly urged for several reasons. In addition to lending
+ uniformity to \slang scripts, \sfun{slsh_main} is well supported by
+ the \slang debugger (\sldb) and the \slang profiler (\slprof), which
+ look for \sfun{slsh_main} as a starting point for script execution.
+ Also as scripts necessarily do something (otherwise they have no
+ use), \slsh's \exmp{-t} command-line option may be used to turn off
+ the automatic execution of \exmp{slsh_main}. This allows the syntax
+ of the entire script to be checked for errors instead of running it.
+
+\sect{Command line processing}
+
+ The script's command-line arguments are availble to it via the
+ \ivar{__argc} and \ivar{__argv} intrinsic variables. Any optional
+ arguments represented by these variables may be parsed using \slsh's
+ \bf{cmdopt} routines.
+
+ As a useful illustration, consider the script that the author uses to
+ rip tracks from CDs to OGG encoded files. The name of the script
+ is \exmp{cd2ogg.sl}. Running the script without arguments causes it
+ to issue a usage message:
+#v+
+ Usage: cd2ogg.sl options device
+ Options:
+ --help This help
+ --work DIR Use DIR as working dir /tmp/29848
+ --root DIR Use DIR/GENRE as root for final output /data/CDs
+ --genre GENRE Use GENRE for output dir
+ --no-rip Skip rip stage
+ --no-normalize Skip normalizing stage
+ --no-encode Don't encode to ogg
+ --albuminfo PERFORMER/TITLE
+ Use PERFORMER/TITLE if audio.cddb is absent
+#v-
+ As the message shows, some of the options require an argument while
+ others do not. The cd2ogg.sl script looks like:
+#v+
+ #!/usr/bin/env slsh
+ require ("cmdopt");
+ .
+ .
+ private define exit_usage ()
+ {
+ () = fprintf (stderr, "Usage: %s options device\n",
+ path_basename (__argv0));
+ () = fprintf (stderr, "Options:\n");
+ .
+ .
+ exit (1);
+ }
+
+ private define parse_album_info (albuminfo)
+ {
+ ...
+ }
+
+ define slsh_main ()
+ {
+ variable genre = NULL;
+ variable no_rip = 0;
+ variable no_normalize = 0;
+ variable no_encode = 0;
+
+ variable opts = cmdopt_new ();
+ opts.add ("help", &exit_usage);
+ opts.add ("device", &CD_Device; type="str");
+ opts.add ("work", &Work_Dir; type="str");
+ opts.add ("root", &Root_Dir; type="str");
+ opts.add ("genre", &genre; type="str");
+ opts.add ("albuminfo", &parse_album_info; type="str");
+ opts.add ("no-normalize", &no_normalize);
+ opts.add ("no-encode", &no_encode);
+ variable i = opts.process (__argv, 1);
+ if (i + 1 != __argc)
+ exit_usage ();
+ CD_Device = __argvi;
+ .
+ .
+ }
+#v-
+
+ There are several points that one should take from the above example.
+ First, to use the \exmp{cmdopt} interface it is necessary to load it.
+ This is accomplished using the \sfun{require} statement. Second, the
+ above example uses \exmp{cmdopt}'s object-oriented style interface
+ through the use of the \exmp{add} and \exmp{process} methods of the
+ \exmp{cmdopt} object created by the call to \exmp{cmdopt_new}. Third,
+ two of the command line options make use of callback functions: the
+ \exmp{exit_usage} function will get called when \exmp{--help} appears
+ on the command line, and the \exmp{parse_album_info} function will
+ get called to handle the \exmp{--albuminfo} option. Options such as
+ \exmp{--no-encode} do not take a value and the presence of such an
+ option on the command line causes the variable associated with the
+ option to be set to 1. Other options such as \exmp{--genre} will
+ cause the variable associated with them to be set of the value
+ specified on the command-line. Finally, the \exmp{process} method
+ returns the index of \ivar{__argv} that corresponds to ``non-option''
+ argument. In this case, for proper usage of the script, that
+ argument would correspond to device representing the CD drive.
+
+ For more information about the \exmp{cmdopt} interface, see the
+ documentation for \exmp{cmdopt_add}:
+#v+
+ slsh> help cmdopt_add
+#v-
+
+\chapter{Debugging} #%{{{
+
+ There are several ways to debug a \slang script. When the
+ interpreter encounters an uncaught exception, it can generate a
+ traceback report showing where the error occurred and the values of
+ local variables in the function call stack frames at the time of the
+ error. Often just knowing where the error occurs is all that is
+ required to correct the problem. More subtle bugs may require a
+ deeper analysis to diagnose the problem. While one can insert the
+ appropriate print statements in the code to get some idea about what
+ is going on, it may be simpler to use the interactive debugger.
+
+\sect{Tracebacks}
+
+ When the value of the \ivar{_traceback} variable is non-zero, the
+ interpreter will generate a traceback report when it encounters an
+ error. This variable may be set by putting the line
+#v+
+ _traceback = 1;
+#v-
+ at the top of the suspect file. If the script is running in \slsh,
+ then invoking \slsh using the \exmp{-g} option will enable tracebacks:
+#v+
+ slsh -g myscript.sl
+#v-
+
+ If \ivar{_traceback} is set to a positive value, the values of local
+ variables will be printed in the traceback report. If set to a
+ negative integer, the values of the local variables will be absent.
+
+ Here is an example of a traceback report:
+#v+
+ Traceback: error
+ ***string***:1:verror:Run-Time Error
+ /grandpa/d1/src/jed/lib/search.sl:78:search_generic_search:Run-Time Error
+ Local Variables:
+ String_Type prompt = "Search forward:"
+ Integer_Type dir = 1
+ Ref_Type line_ok_fun = &_function_return_1
+ String_Type str = "ascascascasc"
+ Char_Type not_found = 1
+ Integer_Type cs = 0
+ /grandpa/d1/src/jed/lib/search.sl:85:search_forward:Run-Time Error
+#v-
+ There are several ways to read this report; perhaps the simplest is
+ to read it from the bottom. This report says that on line 85 in
+ \exmp{search.sl} the \exmp{search_forward} function called the
+ \exmp{search_generic_search} function. On line 78 it called the
+ \sfun{verror} function, which in turn called \ifun{error}. The
+ \exmp{search_generic_search} function contains 6 local variables
+ whose values at the time of the error are given by the traceback
+ output. The above example shows that a local variable called
+ \exmp{"not_found"} had a \dtype{Char_Type} value of 1 at the time
+ of the error.
+
+\labeled_sect{Using the sldb debugger}
+
+ The interpreter contains a number of hooks that support a debugger.
+ \sldb consists of a set of functions that use these hooks to implement
+ a simple debugger. Although written for \slsh, the debugger may be
+ used by other \slang interpreters that permit the loading of \slsh
+ library files. The examples presented here are given in the context
+ of \slsh.
+
+ In order to use the debugger, the code to to be debugged must be
+ loaded with debugging info enabled. This can be in done several
+ ways, depending upon the application embedding the interpreter.
+
+ For applications that support a command line, the simplest way to
+ access the debugger is to use the \sfun{sldb} function with the name
+ of the file to be debugged:
+#v+
+ require ("sldb");
+ sldb ("foo.sl");
+#v-
+ When called without an argument, \sfun{sldb} will prompt for input.
+ This can be useful for setting or removing breakpoints.
+
+ Another mechanism to access the debugger is to put
+#v+
+ require ("sldb");
+ sldb_enable ();
+#v-
+ at the top of the suspect file. Any files loaded by the file will
+ also be compiled with debugging support, making it unnecessary to
+ add this to all files.
+
+ If the file contains any top-level executable statements, the
+ debugger will display the line to be executed and prompt for input.
+ If the file does not contain any executable statements, the debugger
+ will not be activated until one of the functions in the file is
+ executed.
+
+ As a concrete example, consider the following contrived \slsh script
+ called \exmp{buggy.sl}:
+#v+
+ define divide (a, b, i)
+ {
+ return ai / b;
+ }
+ define slsh_main ()
+ {
+ variable x = 1:5;
+ variable y = x*x;
+ variable i;
+ _for i (0, length(x), 1)
+ {
+ variable z = divide (x, y, i);
+ () = fprintf (stdout, "%g/%g = %g", xi, yi, z);
+ }
+ }
+#v-
+ Running this via
+#v+
+ slsh buggy.sl
+#v-
+ yields
+#v+
+ Expecting Double_Type, found Array_Type
+ ./buggy.sl:13:slsh_main:Type Mismatch
+#v-
+ More information may be obtained by using \slsh's \exmp{-g} option to
+ cause a traceback report to be printed:
+#v+
+ slsh -g buggy.sl
+ Expecting Double_Type, found Array_Type
+ Traceback: fprintf
+ ./buggy.sl:13:slsh_main:Type Mismatch
+ Local variables for slsh_main:
+ Array_Type x = Integer_Type5
+ Array_Type y = Integer_Type5
+ Integer_Type i = 0
+ Array_Type z = Integer_Type5
+ Error encountered while executing slsh_main
+#v-
+ From this one can see that the problem is that \exmp{z} is an array
+ and not a scalar as expected.
+
+ To run the program under debugger control, startup \slsh and load the
+ file using the \sfun{sldb} function:
+#v+
+ slsh> sldb ("./buggy.sl");
+#v-
+ Note the use of \exmp{"./"} in the filename. This may be necessary
+ if the file is not in the \slsh search path.
+
+ The above command causes execution to stop with the following displayed:
+#v+
+ slsh_main at ./buggy.sl:9
+ 9 variable x = 1:5;
+ (sldb)
+#v-
+ This shows that the debugger has stopped the script at line 9 of
+ buggy.sl and is waiting for input. The \exmp{print} function may be
+ used to print the value of an expression or variable. Using it to
+ display the value of \exmp{x} yields
+#v+
+ (sldb) print x
+ Caught exception:Variable Uninitialized Error
+ (sldb)
+#v-
+ This is because \exmp{x} has not yet been assigned a value and will
+ not be until line 9 has been executed. The \exmp{next} command may
+ be used to execute the current line and stop at the next one:
+#v+
+ (sldb) next
+ 10 variable y = x*x;
+ (sldb)
+#v-
+ The \exmp{step} command functions almost the same as \exmp{next},
+ except when a function call is involved. In such a case, the
+ \exmp{next} command will step over the function call but \exmp{step}
+ will cause the debugger to enter the function and stop there.
+
+ Now the value of \exmp{x} may be displayed using the \exmp{print}
+ command:
+#v+
+ (sldb) print x
+ Integer_Type5
+ (sldb) print x0
+ 1
+ (sldb) print x-1
+ 5
+ (sldb)
+#v-
+
+ The \var{list} command may be used to get a list of the source code
+ around the current line:
+#v+
+ (sldb) list
+ 5 return ai / b;
+ 6 }
+ 7 define slsh_main ()
+ 8 {
+ 9 variable x = 1:5;
+ 10 variable y = x*x;
+ 11 variable i;
+ 12 _for i (0, length(x), 1)
+ 13 {
+ 14 variable z = divide (x, y, i);
+ 15 () = fprintf (stdout, "%g/%g = %g", xi, yi, z);
+#v-
+
+ The \exmp{break} function may be used to set a breakpoint. For
+ example,
+#v+
+ (sldb) break 15
+ breakpoint #1 set at ./buggy.sl:15
+#v-
+ will set a break point at the line 15 of the current file.
+
+ The \exmp{cont} command may be used to continue execution until the
+ next break point:
+#v+
+ (sldb) cont
+ Breakpoint 1, slsh_main
+ at ./buggy.sl:15
+ 15 () = fprintf (stdout, "%g/%g = %g", xi, yi, z);
+ (sldb)
+#v-
+ Using the \exmp{next} command produces:
+#v+
+ Received Type Mismatch error. Entering the debugger
+ 15 () = fprintf (stdout, "%g/%g = %g", xi, yi, z);
+#v-
+ This shows that during the execution of line 15, a
+ \exmp{TypeMismatchError} was generated. Let's see what caused it:
+#v+
+ (sldb) print xi
+ 1
+ (sldb) print yi
+ 1
+ (sldb) print z
+ Integer_Type5
+#v-
+ This shows that the problem was caused by \exmp{z} being an array and not a
+ scalar--- something that was already known from the traceback
+ report. Now let's see why it is not a scalar. Start the program
+ again and set a breakpoint in the \exmp{divide} function:
+#v+
+ slsh_main at ./buggy.sl:9
+ 9 variable x = 1:5;
+ (sldb) break divide
+ breakpoint #1 set at divide
+ (sldb) cont
+ Breakpoint 1, divide
+ at ./buggy.sl:5
+ 5 return ai / b;
+ (sldb)
+#v-
+ The values of \exmp{ai/b} and \exmp{b} may be printed:
+#v+
+ (sldb) print ai/b
+ Integer_Type5
+ (sldb) print b
+ Integer_Type5
+#v-
+ From this it is easy to see that \exmp{z} is an array because
+ \exmp{b} is an array. The fix for this is to change line 5 to
+#v+
+ z = ai/bi;
+#v-
+
+ The debugger supports several other commands. For example, the
+ \exmp{up} and \exmp{down} commands may be used to move up and down
+ the stack-frames, and \exmp{where} command may be used to display
+ the stack-frames. These commands are useful for examining the
+ variables in the other frames:
+#v+
+ (sldb) where
+ #0 ./buggy.sl:5:divide
+ #1 ./buggy.sl:14:slsh_main
+ (sldb) up
+ #1 ./buggy.sl:14:slsh_main
+ 14 variable z = divide (x, y, i);
+ (sldb) print x
+ Integer_Type5
+ (sldb) down
+ #0 ./buggy.sl:5:divide
+ 5 return ai / b;
+ (sldb) print z
+ Integer_Type5
+#v-
+
+ On some operating systems, the debugger's \exmp{watchfpu} command
+ may be used to help isolate floating point exceptions. Consider the
+ following example:
+#v+
+ define solve_quadratic (a, b, c)
+ {
+ variable d = b^2 - 4.0*a*c;
+ variable x = -b + sqrt (d);
+ return x / (2.0*a);
+ }
+ define print_root (a, b, c)
+ {
+ vmessage ("%f %f %f %f\n", a, b, c, solve_quadratic (a,b,c));
+ }
+ print_root (1,2,3);
+#v-
+ Running it via \slsh produces:
+#v+
+ 1.000000 2.000000 3.000000 nan
+#v-
+ Now run it in the debugger:
+#v+
+ <top-level> at ./example.sl:12
+ 11 print_root (1,2,3);
+ (sldb) watchfpu FE_INVALID
+ (sldb) cont
+ *** FPU exception bits set: FE_INVALID
+ Entering the debugger.
+ solve_quadratic at ./t.sl:4
+ 4 variable x = -b + sqrt (d);
+#v-
+ This shows the the \exmp{NaN} was produced on line 4.
+
+ The \exmp{watchfpu} command may be used to watch for the occurrence
+ of any combination of the following exceptions
+#v+
+ FE_DIVBYZERO
+ FE_INEXACT
+ FE_INVALID
+ FE_OVERFLOW
+ FE_UNDERFLOW
+#v-
+ by the bitwise-or operation of the desired combination. For
+ instance, to track both \exmp{FE_INVALID} and \exmp{FE_OVERFLOW},
+ use:
+#v+
+ (sldb) watchfpu FE_INVALID | FE_OVERFLOW
+#v-
+
+#%}}}
+
+\chapter{Profiling}
+\sect{Introduction}
+
+This chapter deals with the subject of writing efficient \slang code,
+and using the \slang profiler to isolate places in the code that could
+benefit from optimization.
+
+The most important consideration in writing efficient code is the
+choice of algorithm. A poorly optimized good algorithm will almost
+always execute faster than a highly optimized poor algorithm. In
+choosing an algorithm, it is also important to choose the right data
+structures for its implementation. As a simple example, consider the
+task of counting words. Any algorithm would involve a some sort of
+table with word/number pairs. Such a table could be implemented using
+a variety of data structures, e.g., as a pair of arrays or lists
+representing the words and corresponding numbers, as an array of
+structures, etc. But in this case, the associative array is ideally
+suited to the task:
+#v+
+ a = Assoc_TypeInt_Type, 0;
+ while (get_word (&word))
+ aword++;
+#v-
+
+Note the conciseness of the above code. It is important to appreciate
+the fact that \slang is a byte-compiled interpreter that executes
+statements much slower than that of a language that compiles to
+machine code. The overhead of the processing of byte-codes by the
+interpreter may be used to roughly justify the rule of thumb that the
+smaller the code is, the faster it will run.
+
+When possible, always take advantage of \slang's powerful array
+facilities. For example, consider the act of clipping an array by
+setting all values greater than 10 to 10. Rather than coding this as
+#v+
+ n = length(a);
+ for (i = 0; i < n; i++)
+ if (ai > 10) ai = 10;
+#v-
+it should be written as
+#v+
+ awhere(a>10) = 10;
+#v-
+
+Finally, do not overlook the specialized modules that are available
+for \slang.
+
+\sect{Using the profiler}
+
+\slprof is an executable \slsh script that implements a standalone
+profiler for \slsh scripts. The script is essentially a front-end for
+a set of interpreter hooks defined in a file called \file{profile.sl},
+which may be used by any application embedding \slang. The use of the
+profiler will first be demonstrated in the context of \slprof, and
+after that follows a discussion of how to use \file{profile.sl} for
+other \slang applications.
+
+(To be completed...)
+
+#i regexp.tm
+
+#%}}}
+
+\appendix
+
+#i intnews.tm
+
+#i copyright.tm
+
+\end{\documentstyle}

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/slangfun.tm Added

@@ -0,0 +1,134 @@
+#% -*- mode: tm; mode: fold; -*-
+#%{{{Macros
+
+#i linuxdoc.tm
+
+#i local.tm
+
+#d function#1 \sect{<bf>$1</bf>\label{$1}}<descrip>
+#d variable#1 \sect{<bf>$1</bf>\label{$1}}<descrip>
+#d datatype#1 \sect{<bf>$1</bf>\label{$1}}<descrip>
+
+#d qualifier#2:3 <tt>$1</tt> : $2\ifarg{$3}{ (Default: <tt>$3</tt>)}
+#d synopsis#1 <tag> Synopsis </tag> $1
+#d keywords#1 <tag> Keywords </tag> $1
+#d usage#1 <tag> Usage </tag> <tt>$1</tt>
+#d altusage#1 <tag> Usage </tag> <tt>$1</tt>
+#d description <tag> Description </tag>
+#d qualifiers <tag> Qualifiers </tag>
+#d example <tag> Example </tag>
+#d notes <tag> Notes </tag>
+#% d seealso#1 <tag> See Also </tag> <tt>$1</tt>
+#d seealso#1 <tag> See Also </tag> \linuxdoc_list_to_ref{$1}
+#d r#1 \ref{$1}{$1}
+#d done </descrip>
+#d -1 <tt>-1</tt>
+#d 0 <tt>0</tt>
+#d 1 <tt>1</tt>
+#d 2 <tt>2</tt>
+#d 3 <tt>3</tt>
+#d 4 <tt>4</tt>
+#d 5 <tt>5</tt>
+#d 6 <tt>6</tt>
+#d 7 <tt>7</tt>
+#d 8 <tt>8</tt>
+#d 9 <tt>9</tt>
+#d NULL <tt>NULL</tt>
+#d documentstyle book
+
+#d user-manual \bf{A Guide to the S-Lang Language}
+
+#%}}}
+
+\linuxdoc
+\begin{\documentstyle}
+
+\title \slang-intrinsic-function-reference (\docversion)
+\author John E. Davis <www.jedsoft.org>
+\date \__today__
+
+\toc
+
+\chapter{Preface}
+This document describes the intrinsic functions that are available to
+any application that embeds the \slang interpreter. In addition,
+\slsh defines a number of useful functions that are also available to
+conforming \slang applications. Those functions are described in
+\href{http://www.jedsoft.org/slang/docs/}{The SLSH Library Reference}.
+
+\chapter{Data Types}
+#i rtl/datatype.tm
+
+\chapter{Array Functions}
+#i rtl/array.tm
+
+\chapter{Associative Array Functions}
+#i rtl/assoc.tm
+
+\chapter{Functions that Operate on Strings}
+#i rtl/strops.tm
+
+\chapter{Functions that Operate on Binary Strings}
+#i rtl/bstr.tm
+
+\chapter{Functions that Manipulate Structures}
+#i rtl/struct.tm
+
+\chapter{Functions that Create and Manipulate Lists}
+#i rtl/list.tm
+
+\chapter{Informational Functions}
+#i rtl/info.tm
+
+\chapter{Mathematical Functions}
+#i rtl/math.tm
+
+\chapter{Message and Error Functions}
+#i rtl/message.tm
+
+\chapter{Time and Date Functions}
+#i rtl/time.tm
+
+\chapter{Data-Type Conversion Functions}
+#i rtl/type.tm
+
+\chapter{Stdio File I/O Functions}
+#i rtl/stdio.tm
+
+\chapter{Low-level POSIX I/O functions}
+#i rtl/posio.tm
+
+\chapter{Signal Functions}
+#i rtl/signal.tm
+
+\chapter{Directory Functions}
+#i rtl/dir.tm
+
+\chapter{Functions that Parse Filenames}
+#i rtl/ospath.tm
+
+\chapter{System Call Functions}
+#i rtl/posix.tm
+
+\chapter{Eval Functions}
+#i rtl/eval.tm
+
+\chapter{Qualifier Functions}
+#i rtl/qualif.tm
+
+\chapter{Module Functions}
+#i rtl/import.tm
+
+\chapter{Debugging Functions}
+#i rtl/debug.tm
+
+\chapter{Stack Functions}
+#i rtl/stack.tm
+
+\chapter{Functions that deal with the S-Lang readline interface}
+#i rtl/rline.tm
+
+\chapter{Miscellaneous Functions}
+#i rtl/misc.tm
+
+\end{\documentstyle}

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/tools Added

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/tools/Makefile Added

@@ -0,0 +1,46 @@
+# -*- sh -*-
+ELF=
+EXECS_TO_BUILD = tm2txt sl2tm
+EXECS_TO_INSTALL = tm2txt sl2tm
+SYMLINK_DIR=$(HOME)/sys/$(ARCH)/objs/slang/doc/tm/tools
+SRCDIR=..
+OBJDIR=$(ARCH)objs#
+
+SLANGDIR=../../../../src
+EXECLIBS = -L$(SLANGDIR)/$(ARCH)$(ELF)objs -lslang -lm
+EXECINC = -I$(SLANGDIR)
+
+COMPILE_CMD=$(CC) -c $(CFLAGS) $(EXECINC)
+LINK_CMD=$(CC) $(LDFLAGS)
+
+all: $(OBJDIR) $(EXECS_TO_BUILD)
+clean:
+	$(RM) $(OBJDIR)/* *~ #*
+
+tm2txt: $(OBJDIR)/tm2txt
+	@echo tm2txt created in $(OBJDIR)
+$(OBJDIR)/tm2txt: $(OBJDIR)/tm2txt.o $(EXEC_EXTRA_OBJS)
+	cd $(OBJDIR); $(LINK_CMD) tm2txt.o -o tm2txt $(EXECLIBS)
+$(OBJDIR)/tm2txt.o: tm2txt.c $(tm2txt_O_DEP)
+	cd $(OBJDIR); $(COMPILE_CMD) $(SRCDIR)/tm2txt.c -o tm2txt.o
+sl2tm: $(OBJDIR)/sl2tm
+	@echo sl2tm created in $(OBJDIR)
+$(OBJDIR)/sl2tm: $(OBJDIR)/sl2tm.o $(EXEC_EXTRA_OBJS)
+	cd $(OBJDIR); $(LINK_CMD) sl2tm.o -o sl2tm $(EXECLIBS)
+$(OBJDIR)/sl2tm.o: sl2tm.c $(sl2tm_O_DEP)
+	cd $(OBJDIR); $(COMPILE_CMD) $(SRCDIR)/sl2tm.c -o sl2tm.o
+
+$(OBJDIR):
+	-mkdir $(OBJDIR)
+
+install: $(EXECS_TO_INSTALL)
+	@for x in $(EXECS_TO_INSTALL); do \
+	  echo Installing $$x in $(BINDIR); \
+	  $(INSTALL_CMD) $(OBJDIR)/$$x $(BINDIR); \
+	done
+
+symlinks:
+	-/bin/rm -f $(ARCH)objs
+	-mkdir -p $(SYMLINK_DIR)
+	ln -s $(SYMLINK_DIR) $(ARCH)objs
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/tools/README Added

@@ -0,0 +1,66 @@
+This directory includes two programs:
+
+tm2txt:
+  This program processes one or more specially formatted .tm
+  source files and writes the result on stdout.  By specially
+  formatted, it is meant that the .tm files are formatted
+  into sections such as:
+
+\function{my_function}
+\synopsis{Short Description}
+\usage{int my_function (void);}
+\description
+   \var{my_function} does something special and returns an integer.
+\example
+  Here is an example of its use:
+#v+
+   if (-1 == my_function ())
+     exit (1);
+#v-
+\seealso{my_other_function, your_function}
+\done
+
+  Run this README file through tm2txt and see the result.
+
+sl2tm:
+  This program strips the specially formatted documentation described
+  above from C files and S-Lang files.  Here is an example of how the
+  documentation would appear in the C source:
+
+/*%+
+ *\function{my_other_function}
+ *\synopsis{Just another function}
+ *\usage{int my_other_function(void)}
+ *\description
+ *  \var{my_other_function} is similar to \var{my_function} except that
+ *  it returns a \em{random} integer.
+ *\example
+ * Here is an example:
+ *#v+
+ *   (void) my_other_function ();
+ *#v-
+ *\notes
+ * This function is obsolete.  Use \var{my_new_function} instead.
+ *\seealso{my_function, my_new_function}
+ *%- Note that \done should not be used.  `*%-' implies \done
+ */
+
+In S-Lang files, the format is similar:
+
+%!%+  Lines that start with this denotes the start of documentation
+%\function{my_other_function}
+%\synopsis{Just another function}
+%\usage{int my_other_function(void)}
+%\description
+%  \var{my_other_function} is similar to \var{my_function} except that
+%  it returns a \em{random} integer.
+%\example
+% Here is an example:
+%#v+
+%   (void) my_other_function ();
+%#v-
+%\notes
+% This function is obsolete.  Use \var{my_new_function} instead.
+%\seealso{my_function, my_new_function}
+%!%- Note that \done should not be used.  `%!%-' implies \done
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/tools/fixtxt Added

@@ -0,0 +1,89 @@
+#!/usr/bin/env jed-script
+
+if (__argc != 2)
+{
+   () = fprintf (stderr, "Usage: %s file.txt\n", __argv0);
+   exit (1);
+}
+
+% The txt file looks ugly and the contents at the beginning are
+% totally misleading.
+
+static define process_file (file)
+{
+   variable txt;
+
+   () = read_file (file);
+   % trim excess blank lines
+   trim_buffer ();
+
+   % fix the underscore chars
+   bob ();
+   while (fsearch ("_.ds h "))
+     {
+	deln (7);
+	insert ("_");
+	% Unfortunately, there are other things associated with this that are
+	% messed up.  See my debian linuxdoc bug report.  In particular, the
+	% table of contents associated with this are hosed and possibly the
+	% rest of the text on this line.  Here is a fix for contents.
+	push_spot ();
+	bol_skip_white ();
+	push_mark ();
+	skip_chars ("0-9.");
+	variable sect = bufsubstr ();
+	skip_white ();
+	push_mark ();
+	eol ();
+	txt = bufsubstr ();
+	eob ();
+	() = bsearch ("Table of Contents");
+	sect = strcat ("  ",sect," ");
+	if (bol_fsearch (sect))
+	  {
+	     go_right(strlen (sect));
+	     del_eol ();
+	     insert (txt);
+	  }
+	pop_spot ();
+     }
+
+   % Delete the contents at the beginning.  They are wrong.
+   bob ();
+   if (fsearch ("Table of Contents"))
+     {
+	bol ();
+	push_mark ();
+	if (fsearch ("____________________________________________"))
+	  {
+	     go_down(1);
+	     del_region ();
+	     % Grab the contents from the bottom
+	     push_spot ();
+	     eob ();
+	     () = bsearch ("Table of Contents");
+	     bol ();
+	     push_mark ();
+	     % Get rid of . . . stufff since the page numbers are meaningless
+	     while (re_fsearch ("\\d$"))
+	       {
+		  eol ();
+		  push_mark ();
+		  bskip_chars ("0-9");
+		  bskip_chars (" .");
+		  del_region ();
+	       }
+	     eob ();
+	     txt = bufsubstr_delete ();
+	     pop_spot ();
+	     insert (txt);
+	  }
+	else pop_mark (0);
+     }
+
+   save_buffer ();
+}
+
+process_file (__argv1);
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/tools/sl2tm.c Added

@@ -0,0 +1,213 @@
+/* This program has a simple purpose: strip the documentation from
+ * one or more slang .sl files or .c files.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <string.h>
+
+typedef struct
+{
+ char *lang;
+ char *doc_start_string;
+ char *doc_end_string;
+ char *doc_prefix_string;
+}
+Doc_File_Type;
+
+Doc_File_Type Doc_Files =
+{
+ { "sl",
+	"%!%+",
+	"%!%-",
+	"%"
+ },
+ {
+	"c",
+	"/*%+",
+	" *%-",
+	" *"
+ },
+ {
+	NULL, NULL, NULL, NULL
+ }
+};
+
+static Doc_File_Type *get_doc_type (char *lang)
+{
+ Doc_File_Type *dt;
+
+ dt = Doc_Files;
+
+ while (dt->lang != NULL)
+ {
+	if (0 == strcmp (dt->lang, lang))
+	 return dt;
+
+	dt++;
+ }
+ return NULL;
+}
+
+static char *Tm_Comment_String = "#c";
+
+static int doc_strip (char *file, FILE *in, FILE *out, Doc_File_Type *df)
+{
+ char line1024;
+ char ch_start, ch_end, ch_prefix;
+ unsigned int start_len, end_len, prefix_len;
+ int level;
+ char *start, *end, *prefix;
+ unsigned int linenum;
+
+ if (df == NULL)
+ return -1;
+
+ start = df->doc_start_string;
+ end = df->doc_end_string;
+ prefix = df->doc_prefix_string;
+
+ ch_start = *start;
+ start_len = strlen (start);
+ ch_end = *end;
+ end_len = strlen (end);
+ ch_prefix = *prefix;
+ prefix_len = strlen (prefix);
+
+ linenum = 0;
+ level = 0;
+ while (NULL != fgets (line, sizeof (line), in))
+ {
+	linenum++;
+	if (level == 0)
+	 {
+	 if ((*line == ch_start)
+		 && (0 == strncmp (line, start, start_len)))
+	 {
+		 level = 1;
+		 fprintf (out, "%s __LINE__: %u\n", Tm_Comment_String, linenum);
+	 }
+	 continue;
+	 }
+
+	if ((*line == ch_end)
+	 && (0 == strncmp (line, end, end_len)))
+	 {
+	 fputs ("\\done\n", out);
+	 level = 0;
+	 continue;
+	 }
+
+	if ((*line == ch_prefix)
+	 && (0 == strncmp (line, prefix, prefix_len)))
+	 fputs (line + prefix_len, out);
+	else
+	 {
+	 fprintf (stderr, "%s:%u: expecting %s\n", file, linenum, prefix);
+	 fputs ("\\done\n", out);
+	 return -1;
+	 /* fputs (line, out); */
+	 }
+ }
+ return 0;
+}
+
+static char *guess_language (char *file)
+{
+ unsigned int len;
+ char *f;
+
+ len = strlen (file);
+ f = file + len;
+
+ while ((f > file) && (*f != '.'))
+ f--;
+
+ if (*f == '.') f++;
+ if (0 == strcmp (f, "c")) return "c";
+ if (0 == strcmp (f, "sl")) return "sl";
+
+ return "sl";			 /* default */
+}
+
+static void usage (char *pgm)
+{
+ fprintf (stderr, "Usage: %s -c -sl file.... > docfile\n", pgm);
+}
+
+int main (int argc, char **argv)
+{
+ FILE *fpin;
+ FILE *fpout;
+ char *pgm;
+ int i;
+ char *language;
+
+ pgm = "sl2tm";
+
+ fpout = stdout;
+
+ language = NULL;
+
+ for (i = 1; i < argc; i++)
+ {
+	if (*argvi != '-')
+	 break;
+
+	if (0 == strcmp (argvi, "-c"))
+	 language = "c";
+	else if (0 == strcmp (argvi, "-sl"))
+	 language = "sl";
+	else
+	 {
+	 usage (pgm);
+	 return 1;
+	 }
+ }
+
+ if (i >= argc)
+ {
+	if (isatty (0))
+	 {
+	 usage (pgm);
+	 return 1;
+	 }
+
+	if (language == NULL) language = "sl";
+	(void) doc_strip ("<stdin>", stdin, fpout, get_doc_type (language));
+	return 0;
+ }
+
+ while (i < argc)
+ {
+	char *file;
+	char *lang;
+	Doc_File_Type *dt;
+
+	file = argvi;
+	i++;
+
+	lang = language;
+
+	if ((lang == NULL)
+	 && (NULL == (lang = guess_language (file))))
+	 lang = "sl";
+
+	if (NULL == (dt = get_doc_type (lang)))
+	 continue;
+
+	if (NULL == (fpin = fopen (file, "r")))
+	 {
+	 fprintf (stderr, "Unable to open %s -- skipping it.\n", file);
+	 continue;
+	 }
+
+	fprintf (stdout, "%s __FILE__: %s\n", Tm_Comment_String, file);
+	(void) doc_strip (file, fpin, fpout, dt);
+	fclose (fpin);
+ }
+
+ if (fpout != stdout) fclose (fpout);
+ return 0;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/doc/tm/tools/tm2txt.c Added

@@ -0,0 +1,722 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <string.h>
+#include <ctype.h>
+
+/* This program is a quick hack to turn the run-time library .tm files into
+ * a decent looking ascii text file. The currently available SGML-tools are
+ * not up to my standards for doing that.
+ */
+
+static int Run_Silent;
+static int Top_Level;
+
+typedef struct
+{
+ char *name;
+ char *value;
+}
+Macro_String_Type;
+
+static Macro_String_Type Macro_Strings =
+{
+ {"slang", "S-Lang"},
+ {"jed", "jed"},
+ {"NULL", "NULL"},
+ {"-1", "-1"},
+ {"0", "0"},
+ {"1", "1"},
+ {"2", "2"},
+ {"3", "3"},
+ {"4", "4"},
+ {"5", "5"},
+ {"6", "6"},
+ {"7", "7"},
+ {"8", "8"},
+ {"9", "9"},
+ {NULL, NULL}
+};
+
+typedef struct Section_Type
+{
+ char *section_name;
+ int (*format_fun) (struct Section_Type *);
+ unsigned int flags;
+}
+Section_Type;
+
+static int format_function (Section_Type *);
+static int format_synopsis (Section_Type *);
+static int format_usage (Section_Type *);
+static int format_description (Section_Type *);
+static int format_example (Section_Type *);
+static int format_notes (Section_Type *);
+static int format_see_also (Section_Type *);
+static int format_done (Section_Type *);
+
+static Section_Type Sections =
+{
+ {
+	"function",
+	format_function,
+	0
+ },
+ {
+	"synopsis",
+	format_synopsis,
+	0
+ },
+ {
+	"usage",
+	format_usage,
+	0
+ },
+ {
+	"description",
+	format_description,
+	0
+ },
+ {
+	"example",
+	format_example,
+	0
+ },
+ {
+	"notes",
+	format_notes,
+	0
+ },
+ {
+	"seealso",
+	format_see_also,
+	0
+ },
+ {
+	"done",
+	format_done,
+	0
+ },
+ {
+	"variable",
+	format_function,
+	0
+ },
+ {
+	"datatype",
+	format_function,
+	0
+ },
+ {
+	NULL, NULL, 0
+ }
+};
+
+static FILE *Input_File_Ptr;
+static FILE *Output_File_Ptr;
+
+#define MAX_BUF_LEN	1024
+static char Input_Buffer MAX_BUF_LEN;
+static unsigned int Line_Number;
+static int Input_Buffer_Pushed;
+static int Line_Type;
+static char *This_Filename;
+
+#define END_OF_FILE 1
+#define SECTION_LINE 2
+#define VERBATUM_LINE 3
+
+static char Source_FileMAX_BUF_LEN;
+
+static int set_source_file (char *s)
+{
+ strncpy (Source_File, s, MAX_BUF_LEN);
+ Source_FileMAX_BUF_LEN-1 = 0;
+ This_Filename = Source_File;
+ return 0;
+}
+
+static int set_source_linenum (char *s)
+{
+ unsigned int n;
+
+ if (1 == sscanf (s, "%u", &n))
+ Line_Number = n;
+
+ return 0;
+}
+
+static int unget_input (char *buf)
+{
+ if (buf != NULL)
+ {
+	char *inp = Input_Buffer;
+	while (*buf != 0)
+	 {
+	 *inp++ = *buf++;
+	 }
+	*inp = 0;
+ }
+ Input_Buffer_Pushed++;
+ return 0;
+}
+
+static int begin_verbatum (void);
+static int end_verbatum (void);
+static int indent (unsigned int);
+
+static int verbatum_mode (void)
+{
+ begin_verbatum ();
+ while (NULL != fgets (Input_Buffer, MAX_BUF_LEN, Input_File_Ptr))
+ {
+	Line_Number++;
+
+	if (Input_Buffer0 == '#')
+	 {
+	 if ((Input_Buffer1 != 'v')
+		 || (Input_Buffer2 != '-'))
+	 {
+		 fprintf (stderr, "%s:%u:Expecting verbatum end\n", This_Filename, Line_Number);
+		 return -1;
+	 }
+	 break;
+	 }
+
+	indent (3);
+	fputs (Input_Buffer, stdout);
+ }
+ end_verbatum ();
+ return 0;
+}
+
+static int get_next_line (void)
+{
+ unsigned int len;
+
+ while (1)
+ {
+	if (Input_Buffer_Pushed == 0)
+	 {
+	 if (NULL == fgets (Input_Buffer, MAX_BUF_LEN, Input_File_Ptr))
+	 {
+		 Line_Type = END_OF_FILE;
+		 return -1;
+	 }
+	 Line_Number++;
+	 }
+
+	Input_Buffer_Pushed = 0;
+	len = strlen (Input_Buffer);
+	if (len && (Input_Bufferlen - 1 == '\n'))
+	 Input_Buffer len - 1 = 0;
+
+	switch (*Input_Buffer)
+	 {
+	 case ';':
+	 case '%':
+	 break;
+
+	 case '#':
+	 if (Input_Buffer1 == 'v')
+	 {
+		 if (Input_Buffer2 == '+')
+		 {
+		 if (-1 == verbatum_mode ())
+			 return -1;
+		 }
+		 else
+		 {
+		 fprintf (stderr, "%s:%u:Expecting verbatum start\n", This_Filename, Line_Number);
+		 return -1;
+		 }
+		 break;
+	 }
+ if (Input_Buffer1 == 'c')
+	 {
+		 if (0 == strncmp (Input_Buffer, "#c __FILE__: ", 13))
+		 {
+		 set_source_file (Input_Buffer + 13);
+		 break;
+		 }
+		 if (0 == strncmp (Input_Buffer, "#c __LINE__: ", 13))
+		 {
+		 set_source_linenum (Input_Buffer + 13);
+		 break;
+		 }
+		 break;
+	 }
+
+	 break;
+
+	 case '\\':
+	 Line_Type = SECTION_LINE;
+	 return 1;
+
+	 default:
+	 Line_Type = 0;
+	 return 0;
+	 }
+ }
+}
+
+static Section_Type *get_section (char *buf)
+{
+ char *name;
+ Section_Type *sec;
+ int has_colon;
+
+ if (*buf == '\\') buf++;
+
+ name = buf;
+ has_colon = 0;
+ while (*buf != 0)
+ {
+	if ((*buf == '\n')
+	 || (*buf == ' ')
+	 || (*buf == '\t'))
+	 {
+	 *buf = 0;
+	 break;
+	 }
+	if (*buf == '{')
+	 {
+	 has_colon = 1;
+	 *buf = 0;
+	 break;
+	 }
+	buf++;
+ }
+
+ sec = Sections;
+ while (1)
+ {
+	if (sec->section_name == NULL)
+	 {
+	 if (Run_Silent == 0)
+	 fprintf (stderr, "%s:%u:Unknown section '%s'\n", This_Filename, Line_Number, name);
+	 return NULL;
+	 }
+
+	if (0 == strcmp (sec->section_name, name))
+	 break;
+
+	sec++;
+ }
+
+ if (has_colon)
+ {
+	unget_input (buf + 1);
+ }
+
+ return sec;
+}
+
+static int process_file (FILE *fp)
+{
+ Section_Type *sec;
+
+ Input_File_Ptr = fp;
+ Output_File_Ptr = stdout;
+ Line_Number = 0;
+ Top_Level = 1;
+ Line_Type = 0;
+
+ while (1)
+ {
+	while ((Line_Type != SECTION_LINE)
+	 && (Line_Type != END_OF_FILE))
+	 get_next_line ();
+
+	if (Line_Type == END_OF_FILE)
+	 break;
+
+	if (NULL == (sec = get_section (Input_Buffer)))
+	 {
+	 if (Run_Silent == 0)
+	 fprintf (stderr, "%s:%u:Error ignored.\n", This_Filename, Line_Number);
+	 get_next_line ();
+	 continue;
+	 }
+
+	if (sec->format_fun == NULL)
+	 {
+	 get_next_line ();
+	 continue;
+	 }
+
+	if (-1 == (*sec->format_fun)(sec))
+	 {
+	 fprintf (stderr, "%s:%u:Fatal error\n", This_Filename, Line_Number);
+	 return -1;
+	 }
+ }
+ return 0;
+}
+
+static void usage (void)
+{
+ char *pgm = "tm2txt";
+
+ fprintf (stderr, "%s usage:\n", pgm);
+ fprintf (stderr, "%s --help --quiet files...\n", pgm);
+}
+
+int main (int argc, char **argv)
+{
+ if ((argc > 1)
+ && ((0 == strcmp (argv1, "--help")) || (0 == strcmp (argv1, "-h"))))
+ {
+	usage ();
+	return 1;
+ }
+
+ if ((argc > 1) && (0 == strcmp (argv1, "--quiet")))
+ {
+	Run_Silent = 1;
+	argc--;
+	argv++;
+ }
+
+ if ((argc == 1) && isatty (fileno(stdin)))
+ {
+	usage ();
+	return 1;
+ }
+
+ if (argc == 1)
+ {
+	This_Filename = "<stdin>";
+	process_file (stdin);
+ }
+ else
+ {
+	int i;
+
+	for (i = 1; i < argc; i++)
+	 {
+	 char *file = argvi;
+	 FILE *fp;
+
+	 if (NULL == (fp = fopen (file, "r")))
+	 {
+		 fprintf (stderr, "Unable to open %s, skipping it.\n", file);
+		 continue;
+	 }
+	 This_Filename = file;
+
+	 if (-1 == process_file (fp))
+	 {
+		 fprintf (stderr, "Fatal error encountered processing %s\n",
+			 file);
+		 fclose (fp);
+		 return 1;
+	 }
+
+	 fclose (fp);
+	 }
+ }
+
+ return 0;
+}
+
+static int write_boldface (char *s)
+{
+ fprintf (Output_File_Ptr, "%s", s);
+ return 0;
+}
+
+#if 0
+static int write_tt (char *s)
+{
+ fprintf (Output_File_Ptr, "`%s'", s);
+ return 0;
+}
+#endif
+static int newline (void)
+{
+ fputs ("\n", Output_File_Ptr);
+ return 0;
+}
+
+static int write_section_name (char *s)
+{
+ newline ();
+ fputs (" ", Output_File_Ptr);
+ write_boldface (s);
+ newline ();
+ return 0;
+}
+
+static char *write_verbatum_output (char *buf)
+{
+ while (*buf && (*buf != '}'))
+ {
+	if (*buf == '\\')
+	 {
+	 buf++;
+	 if (*buf == 0)
+	 break;
+	 }
+
+	putc (*buf, Output_File_Ptr);
+	buf++;
+ }
+ if (*buf == '}') buf++;
+ return buf;
+}
+
+static char *write_macro (char *s)
+{
+ char *s1;
+ char ch;
+ Macro_String_Type *m;
+
+ s1 = s;
+ while ((ch = *s1) != 0)
+ {
+	if ((0 == isalnum (ch))
+	 && (ch != '-')
+	 && (ch != '_'))
+	 break;
+
+	s1++;
+ }
+ *s1 = 0;
+
+ m = Macro_Strings;
+ while (m->name != NULL)
+ {
+	if (0 == strcmp (m->name, s))
+	 {
+	 fputs (m->value, Output_File_Ptr);
+	 *s1 = ch;
+	 return s1;
+	 }
+	m++;
+ }
+ fprintf (Output_File_Ptr, "\\%s", s);
+ if (Run_Silent == 0)
+ fprintf (stderr, "%s:%u:%s not defined\n", This_Filename, Line_Number, s);
+ *s1 = ch;
+ return s1;
+}
+
+static int write_with_escape (char *buf)
+{
+ char ch;
+
+ while (1)
+ {
+	ch = *buf++;
+	switch (ch)
+	 {
+	 case 0:
+	 return 0;
+
+	 case '\\':
+	 if (*buf == '\\')
+	 {
+		 putc (*buf, Output_File_Ptr);
+		 buf++;
+		 break;
+	 }
+
+	 if ((0 == strncmp ("var{", buf, 4))
+		 || (0 == strncmp ("par{", buf, 4))
+		 || (0 == strncmp ("fun{", buf, 4)))
+	 {
+		 putc ('`', Output_File_Ptr);
+		 buf = write_verbatum_output (buf + 4);
+		 putc ('\'', Output_File_Ptr);
+		 break;
+	 }
+
+	 if (0 == strncmp ("url{", buf, 4))
+	 {
+		 putc ('<', Output_File_Ptr);
+		 buf = write_verbatum_output (buf + 4);
+		 putc ('>', Output_File_Ptr);
+		 break;
+	 }
+
+	 if ((0 == strncmp ("exmp{", buf, 5))
+		 || (0 == strncmp ("ifun{", buf, 5))
+		 || (0 == strncmp ("cfun{", buf, 5))
+		 || (0 == strncmp ("sfun{", buf, 5))
+		 || (0 == strncmp ("ivar{", buf, 5))
+		 || (0 == strncmp ("cvar{", buf, 5))
+		 || (0 == strncmp ("svar{", buf, 5)))
+	 {
+		 putc ('`', Output_File_Ptr);
+		 buf = write_verbatum_output (buf + 5);
+		 putc ('\'', Output_File_Ptr);
+		 break;
+	 }
+
+	 if (0 == strncmp ("em{", buf, 3))
+	 {
+		 putc ('_', Output_File_Ptr);
+		 buf = write_verbatum_output (buf + 3);
+		 putc ('_', Output_File_Ptr);
+		 break;
+	 }
+
+	 buf = write_macro (buf);
+	 break;
+
+	 default:
+	 putc (ch, Output_File_Ptr);
+	 break;
+
+	 }
+ }
+}
+
+static int indent (unsigned int n)
+{
+ while (n)
+ {
+	putc (' ', Output_File_Ptr);
+	n--;
+ }
+
+ return 0;
+}
+
+static int write_line (void)
+{
+ char *s = Input_Buffer;
+ unsigned int min_indent = 3;
+
+ while ((*s == ' ') && min_indent)
+ {
+	s++;
+	min_indent--;
+ }
+
+ indent (min_indent);
+ write_with_escape (Input_Buffer);
+ newline ();
+ return 0;
+}
+
+static int format_function (Section_Type *sec)
+{
+ (void) sec;
+ if (Top_Level == 0)
+ {
+	fprintf (stderr, "%s:%u:\\function or \\variable not at top-level\n",
+		 This_Filename, Line_Number);
+	fprintf (stderr, " Input line: %s\n", Input_Buffer);
+	return -1;
+ }
+ Top_Level = 0;
+
+ write_verbatum_output (Input_Buffer);
+ newline ();
+ get_next_line ();
+ return 0;
+}
+
+static int format_usage (Section_Type *sec)
+{
+ (void) sec;
+ write_section_name ("USAGE");
+ indent (3);
+ write_verbatum_output (Input_Buffer);
+ newline ();
+
+ get_next_line ();
+ return 0;
+}
+
+static int format_description (Section_Type *sec)
+{
+ (void) sec;
+ write_section_name ("DESCRIPTION");
+
+ while (0 == get_next_line ())
+ {
+	write_line ();
+ }
+ return 0;
+
+}
+
+static int format_example (Section_Type *sec)
+{
+ (void) sec;
+ write_section_name ("EXAMPLE");
+
+ while (0 == get_next_line ())
+ {
+	write_line ();
+ }
+ return 0;
+}
+
+static int format_notes (Section_Type *sec)
+{
+ (void) sec;
+ write_section_name ("NOTES");
+
+ while (0 == get_next_line ())
+ {
+	write_line ();
+ }
+ return 0;
+}
+
+static int format_see_also (Section_Type *sec)
+{
+ (void) sec;
+ write_section_name ("SEE ALSO");
+ indent (3);
+ write_verbatum_output (Input_Buffer);
+ newline ();
+ get_next_line ();
+ return 0;
+}
+
+int format_synopsis (Section_Type *sec)
+{
+ (void) sec;
+ write_section_name ("SYNOPSIS");
+ indent (3);
+ write_verbatum_output (Input_Buffer);
+ newline ();
+ get_next_line ();
+ return 0;
+}
+
+int format_done (Section_Type *sec)
+{
+ (void) sec;
+ if (Top_Level)
+ {
+	fprintf (stderr, "%s:%u:\\done seen at top-level\n",
+		 This_Filename, Line_Number);
+	return -1;
+ }
+
+ fputs ("--------------------------------------------------------------\n",
+	 Output_File_Ptr);
+ newline ();
+ while (0 == get_next_line ())
+ ;
+ Top_Level = 1;
+ return 0;
+}
+
+static int begin_verbatum (void)
+{
+ newline ();
+ return 0;
+}
+
+static int end_verbatum (void)
+{
+ newline ();
+ return 0;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/examples Added

_service:tar_scm:slang-2.3.2.tar.bz2/examples/assoc.sl Added

@@ -0,0 +1,33 @@
+% This example illustrates the use of associative arrays.
+% The function 'analyse_file' counts the number of occurrences of each word
+% in a specified file.  Once the file has been read in, it writes out
+% the list of words and number of occurrences to the file counts.log
+
+define analyse_file (file)
+{
+   variable fp = fopen (file, "r");
+   if (fp == NULL)
+     throw OpenError, "Unable to open $file"$;
+
+   % Create an Integer_Type assoc array with default value of 0.
+   variable a = Assoc_TypeInteger_Type, 0;
+
+   variable line, word;
+   while (-1 != fgets (&line, fp))
+     {
+	foreach word (strtok (strlow(line), "^\\w"))
+	  aword = aword + 1;    %  default value of 0 assumed!!
+     }
+   () = fclose (fp);
+
+   variable keys = assoc_get_keys (a);
+   variable values = assoc_get_values (a);
+
+   % The default array_sort for Int_Type is an ascending sort.  We want the
+   % opposite.
+   variable i = array_sort (values; dir=-1);
+
+   fp = fopen ("count.log", "w");
+   () = array_map (Int_Type, &fprintf, fp, "%s:\t%d\n", keysi, valuesi);
+   () = fclose (fp);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/examples/colormap.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/examples/life.sl Added

@@ -0,0 +1,122 @@
+% This example provides an implementation of Conway's famous game of life.
+% It uses the SMG module from the modules directory. Make sure you
+% build it first.
+
+require ("slsmg");
+require ("rand");
+
+private define urand (m, n)
+{
+ variable a = rand_uniform (m*n);
+ reshape (a, m, n);
+ return a;
+}
+
+% The algorithm for the game begins here.
+private define make_left (n)
+{
+ variable a;
+
+ a = Int_Type n;
+ a0 = n-1;
+ a1: = 0:n-2;
+
+ return a;
+}
+
+private define make_right(n)
+{
+ variable a;
+
+ a = Int_Type n;
+ a0:n-2 = 1:n-1;
+ a-1 = 0;
+
+ return a;
+}
+
+private define life_init (nr, nc)
+{
+ variable a;
+ variable up, down, left, right;
+ variable i;
+ variable num_neighbors;
+
+ a = typecast (5.0 * urand (nr, nc), Char_Type);
+ awhere (a != 1) = 0;
+
+ up = make_left (nr);
+ down = make_right (nr);
+ left = make_left (nc);
+ right = make_right (nc);
+
+ return (a,up,down,left,right);
+}
+
+private define life_new_generation (a, up, down, left, right)
+{
+ variable b;
+ variable middle = :;
+ variable i;
+
+ % Make sure array contains only 0 and 1
+ awhere(a) = 1;
+
+ b = (aup,left + aup, middle + aup, right
+	+ amiddle,left + amiddle, right
+	+ adown, left + adown, middle + adown, right);
+ b = typecast (b, Char_Type);
+
+ i = where ((b < 2) or (b > 3) or ((b == 2) and (a == 0)));
+ bi = 0;
+ return b;
+}
+
+define life_print (a, old_a)
+{
+ variable dims, i, j;
+ (dims,,) = array_info (a);
+
+ a = @a;
+ awhere (a) = 1;
+ awhere (a and (old_a == 0)) = 2;
+
+ slsmg_set_color (0);
+ slsmg_cls ();
+
+ _for (0, dims0-1, 1)
+ {
+	i = ();
+	foreach (where (ai,*))
+	 {
+	 j = ();
+	 slsmg_gotorc(i,j);
+	 slsmg_set_color (ai,j);
+	 slsmg_write_string ("O");
+	 }
+ }
+ slsmg_set_color (0);
+ slsmg_refresh ();
+ sleep (1);
+}
+
+define life (nr, nc)
+{
+ variable a, left, right, up, down, new_a;
+
+ (new_a, up, down, left, right) = life_init (nr, nc);
+
+ a = new_a;
+ do
+ {
+	life_print (new_a, a);
+	a = new_a;
+	new_a = life_new_generation (a, up, down, left, right);
+ }
+ while (length (where (new_a)));
+}
+
+slsmg_init_smg ();
+
+life (SLsmg_Screen_Rows, SLsmg_Screen_Cols);
+

_service:tar_scm:slang-2.3.2.tar.bz2/examples/prime.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/examples/saveobj.sl Added

@@ -0,0 +1,637 @@
+% This example shows how one can save the values of slang variables to a file
+% and then load those values back in another instance of the program.
+%
+% The following code defines two public functions:
+%
+% save_object (FILE, obj, ...);
+% (obj,...) = load_object (FILE);
+%
+% For example,
+% a = 1:20;
+% b = 2.4;
+% c = struct { d, e }; c.d = 2.7; c.e = "foobar";
+% save_object ("foo.save", a, b, c);
+%
+% saves the values of the variables a, b, c to a file called "foo.save".
+% These values may be retrieved later, e.g., by another program instance
+% via:
+% (a,b,c) = load_object ("foo.save");
+%
+% Caveats:
+%
+% 1. Not all object types are supported. The ones supported include:
+%
+% All integer types (Int_Type, Char_Type, Long_Type, ...)
+% Float_Type, Double_Type
+% String_Type, BString_Type
+% Null_Type
+%
+% as well as the container classes of the above objects:
+% Struct_Type, Array_Type
+%
+% 2. The algorithm for saving Struct_Type is recursive. This allows one to
+% save a linked-list of Struct_Type objects. However, due to the recursive
+% nature of the algorithm and the interpreter's finite stack size, such
+% linked-lists cannot be arbitrarily long.
+%
+% 3. Objects are saved in the native representation. As such, the files are
+% not portable across machine architectures.
+%
+% File Format:
+%
+% Each slang object is written to the file with the following format
+% Data_Type (integer)
+% Length of Data Bytes (unsigned integer)
+% Data Bytes
+%
+% Here, Data Bytes may specify other objects if the parent is a container
+% object.
+
+%_debug_info = 1;
+
+private variable Type_Map = Assoc_TypeInteger_Type, -1;
+private variable Write_Object_Funs = Assoc_TypeRef_Type;
+private variable Read_Object_Funs = Assoc_TypeRef_Type;
+
+!if (is_defined ("_Save_Object_Cache_Type"))
+typedef struct
+{
+ index
+}
+_Save_Object_Cache_Type;
+
+private variable Object_Cache;
+private variable Num_Cached;
+
+private define delete_cache ()
+{
+ Object_Cache = NULL;
+ Num_Cached = 0;
+}
+
+private define create_cache ()
+{
+ delete_cache ();
+}
+
+% If the object does not need cached, return the object.
+% If the object needs cached but does not exist in the cache, cache it and
+% return it.
+% Otherwise, the object is in the cache, to return a _Save_Object_Cache_Type
+% representing the object.
+private define cache_object (obj)
+{
+ variable t = typeof (obj);
+
+ if ((t != Array_Type)
+ and (0 == is_struct_type (obj))
+ and (t != BString_Type))
+ {
+	%vmessage ("not caching %S (type %S)", obj, typeof (obj));
+	return obj;
+ }
+
+ variable n = Num_Cached;
+ variable c = Object_Cache;
+ while (n)
+ {
+	if (__is_same (c.obj, obj))
+	 {
+	 obj = @_Save_Object_Cache_Type;
+	 obj.index = n;
+	 return obj;
+	 }
+
+	c = c.next;
+	n--;
+ }
+
+ c = struct {obj, next};
+ c.obj = obj;
+ c.next = Object_Cache;
+ Object_Cache = c;
+ Num_Cached++;
+ %vmessage ("%S (type %S) added to cache", c.obj, typeof (c.obj));
+
+ return obj;
+}
+
+private define get_object_from_cache (index)
+{
+ variable depth = Num_Cached - index;
+ variable c = Object_Cache;
+ while (depth)
+ {
+	c = c.next;
+	depth--;
+ }
+ return c.obj;
+}
+
+private define get_type_id (type)
+{
+ variable id;
+ id = Type_Mapstring (type);
+ if (id == -1)
+ verror ("Object %S is not supported", type);
+ return id;
+}
+
+private define write_not_implemented (fp, object)
+{
+ () = fprintf (stderr, "write for object %S not implemented\n", typeof (object));
+ return 0;
+}
+
+private define do_fwrite (a, fp)
+{
+ %vmessage ("Writing %S", a);
+ variable n = fwrite (a, fp);
+ if (n == -1)
+ verror ("fwrite failed: %s", errno_string (errno));
+ return n;
+}
+
+private define do_fread (t, n, fp)
+{
+ variable b;
+ if (n != fread (&b, t, n, fp))
+ verror ("fread failed: %s", errno_string (errno));
+ %vmessage ("Read %S", b);
+ return b;
+}
+
+private define do_ftell (fp)
+{
+ variable pos = ftell (fp);
+ if (-1 == pos)
+ verror ("ftell failed: %s", errno_string (errno));
+ return pos;
+}
+
+private define do_fseek (fp, ofs, whence)
+{
+ if (-1 == fseek (fp, ofs, whence))
+ verror ("fseek failed: %s", errno_string (errno));
+}
+
+private define sizeof (t)
+{
+ variable size;
+
+ switch (t)
+ { case Char_Type or case UChar_Type: size = 1; }
+ { case Int16_Type or case UInt16_Type: size = 2; }
+ { case Int32_Type or case UInt32_Type: size = 4; }
+ { case Float_Type: size = 4; }
+ { case Double_Type: size = 8; }
+ {
+	verror ("sizeof (%S) not implemented", t);
+ }
+
+ return size;
+}
+
+private define write_numbers (fp, a)
+{
+ variable size = sizeof (_typeof (a));
+ variable num = do_fwrite (a, fp);
+ return num * size;
+}
+
+private define read_numbers (fp, t, nbytes)
+{
+ variable size = sizeof (t);
+ nbytes /= size;
+ return do_fread (t, nbytes, fp);
+}
+
+private define write_string (fp, a)
+{
+ return do_fwrite (a, fp);
+}
+
+private define read_string (fp, t, nbytes)
+{
+ return do_fread (BString_Type, nbytes, fp);
+}
+
+private define start_header (fp, id)
+{
+ variable len = write_numbers (fp, id);
+ variable pos = do_ftell (fp);
+ len += write_numbers (fp, 0);	 % temporary
+
+ variable h = struct
+ {
+	pos, len
+ };
+ h.pos = pos;
+ h.len = len;
+
+ return h;
+}
+
+private define end_header (fp, h, num)
+{
+ do_fseek (fp, h.pos, SEEK_SET);
+ () = do_fwrite (num, fp);
+ do_fseek (fp, 0, SEEK_END);
+ return h.len + num;
+}
+
+private define id_to_datatype (id)
+{
+ variable keys, values;
+
+ keys = assoc_get_keys (Type_Map);
+ values = assoc_get_values (Type_Map);
+ variable i = where (values == id);
+ !if (length (i))
+ verror ("Corrupt file? Unknown type-id (%d)", id);
+ return eval (keysi0);
+}
+
+private define write_scalars (fp, a)
+{
+ variable id = get_type_id (typeof (a));
+ variable h = start_header (fp, id);
+ variable len = write_numbers (fp, a);
+ return end_header (fp, h, len);
+}
+
+private define read_null (fp, t, nbytes)
+{
+ return NULL;
+}
+
+private define write_null (fp, a)
+{
+ return 0;
+}
+
+private define write_object ();
+private define read_object ();
+
+% Array DataBytes: int num_dims, int dimsnum_dims, type, Data...
+private define write_array (fp, a)
+{
+ variable dims, num_dims, data_type;
+ (dims, num_dims, data_type) = array_info (a);
+ variable len;
+ variable id = get_type_id (data_type);
+
+ len = write_numbers (fp, num_dims) + write_numbers (fp, dims)
+ + write_numbers (fp, id);
+
+ % For now allow numbers or strings
+ if (_typeof(a) == String_Type)
+ {
+	foreach (a)
+	 {
+	 variable elem = ();
+	 len += write_object (fp, elem);
+	 }
+
+	return len;
+ }
+
+ len += write_numbers (fp, a);
+
+ return len;
+}
+
+private define read_array (fp, type, nbytes)
+{
+ variable num_dims = do_fread (Int_Type, 1, fp);
+ variable dims = do_fread (Int_Type, num_dims, fp);
+ type = do_fread (Int_Type, 1, fp);
+ variable len;
+ len = 1;
+ foreach (dims)
+ len *= ();
+
+ type = id_to_datatype (type);
+
+ variable v;
+
+ if (type == String_Type)
+ {
+	v = String_Type len;
+	_for (0,len-1,1)
+	 {
+	 variable i = ();
+	 vi = read_object (fp, NULL);
+	 }
+ }
+ else v = do_fread (type, len, fp);
+
+ reshape (v, dims);
+ return v;
+}
+
+% Data Bytes: int num_fields. String-Object num_fields, Valuesnum_fields
+private define write_struct (fp, a)
+{
+ variable fields = get_struct_field_names (a);
+ variable len = write_numbers (fp, typecast (length (fields), Int_Type));
+ foreach (fields)
+ {
+	variable f = ();
+	len += write_object (fp, f);
+ }
+
+ foreach (fields)
+ {
+	f = ();
+	len += write_object (fp, get_struct_field (a, f));
+ }
+
+ return len;
+}
+
+private define read_struct (fp, type, nbytes)
+{
+ variable num_fields = do_fread (Int_Type, 1, fp);
+ variable fields = String_Typenum_fields;
+ variable i;
+ _for (0, num_fields-1, 1)
+ {
+	i = ();
+	fieldsi = read_object (fp, NULL);
+ }
+
+ variable s = @Struct_Type (fields);
+
+ % make sure it is in the cache in case the fields refer to it.
+ if (type != _Save_Object_Cache_Type)
+ () = cache_object (s);
+
+ _for (0, num_fields-1, 1)
+ {
+	i = ();
+	set_struct_field (s, fieldsi, read_object (fp, NULL));
+ }
+
+ return s;
+}
+
+% Data Bytes: int index
+private define write_cached_object (fp, a)
+{
+ return write_numbers (fp, a.index);
+}
+
+private define read_cached_object (fp, type, nbytes)
+{
+ variable index = read_numbers (fp, Int_Type, nbytes);
+ return get_object_from_cache (index);
+}
+
+private define add_type (t, w, r, id)
+{
+ t = string (t);
+ Type_Mapt = id;
+ Write_Object_Funst = w;
+ Read_Object_Funs t = r;
+}
+
+add_type (Char_Type,	&write_numbers,	&read_numbers,	1);
+add_type (UChar_Type,	&write_numbers,	&read_numbers,	2);
+add_type (Short_Type,	&write_numbers,	&read_numbers,	3);
+add_type (UShort_Type,	&write_numbers,	&read_numbers,	4);
+add_type (Integer_Type,	&write_numbers,	&read_numbers,	5);
+add_type (UInteger_Type,&write_numbers,	&read_numbers,	6);
+add_type (Long_Type,	&write_numbers,	&read_numbers,	7);
+add_type (ULong_Type,	&write_numbers,	&read_numbers,	8);
+add_type (Float_Type,	&write_numbers,	&read_numbers,	9);
+add_type (Double_Type,	&write_numbers,	&read_numbers,	10);
+add_type (String_Type,	&write_string,	&read_string,	11);
+add_type (BString_Type,	&write_string,	&read_string,	12);
+add_type (Struct_Type,	&write_struct,	&read_struct,	13);
+add_type (Array_Type,	&write_array,	&read_array,	14);
+add_type (Null_Type,	&write_null,	&read_null,	15);
+
+add_type (_Save_Object_Cache_Type, &write_cached_object, &read_cached_object, 1000);
+
+private define get_write_function (type)
+{
+ variable key = string (type);
+ if (assoc_key_exists (Write_Object_Funs, key))
+ return Write_Object_Funskey;
+ verror ("No write method defined for %S", key);
+}
+
+private define get_read_function (type)
+{
+ variable key = string (type);
+ if (assoc_key_exists (Read_Object_Funs, key))
+ return Read_Object_Funskey;
+ verror ("No read method defined for %S", key);
+}
+
+private define write_object (fp, a)
+{
+ a = cache_object (a);
+ variable id = get_type_id (typeof (a));
+
+ variable h = start_header (fp, id);
+ variable f = get_write_function (typeof (a));
+ variable num = (@f)(fp, a);
+ %vmessage ("Done Writing %S", a);
+ return end_header (fp, h, num);
+}
+
+private define read_object (fp, statusp)
+{
+ variable type, nbytes;
+ variable status = fread (&type, Integer_Type, 1, fp);
+ if (status == -1)
+ {
+	if (statusp == NULL)
+	 verror ("No more objects in file");
+
+	@statusp = 0;
+	return 0;
+ }
+
+ nbytes = do_fread (Integer_Type, 1, fp);
+ type = id_to_datatype (type);
+
+ variable f = get_read_function (type);
+ variable v = (@f)(fp, type, nbytes);
+
+ % Necessary because String_Type may get written as BString_Type
+ if (type != _Save_Object_Cache_Type)
+ {
+	v = typecast (v, type);
+	() = cache_object (v);
+ }
+
+ %vmessage ("Read %S", v);
+ if (statusp != NULL)
+ @statusp = 1;
+
+ return v;
+}
+
+public define save_object ()
+{
+ if (_NARGS < 2)
+ usage ("save_object (file, obj1, ...)");
+
+ variable objs = __pop_args (_NARGS - 1);
+ variable file = ();
+
+ variable fp = fopen (file, "w+");
+ if (fp == NULL)
+ verror ("Unable to open %s: %s", file, errno_string (errno));
+
+ create_cache ();
+
+ foreach (objs)
+ {
+	variable obj = ().value;
+	() = write_object (fp, obj);
+ }
+
+ delete_cache ();
+}
+
+public define load_object ()
+{
+ if (_NARGS != 1)
+ usage ("(var1,...) = load_object (filename);");
+ variable file = ();
+ variable fp = fopen (file, "r");
+ if (fp == NULL)
+ verror ("Unable to open %s: %s", file, errno_string (errno));
+
+ create_cache ();
+ forever
+ {
+	variable status;
+	variable obj = read_object (fp, &status);
+	if (status == 0)
+	 break;
+	obj;
+ }
+ delete_cache ();
+}
+
+#ifntrue
+% Regression test
+private define failed (s, a, b)
+{
+ vmessage ("Failed: %s: wrote: '%S', read '%S'\n", s, a, b);
+}
+
+private define test_eqs ();
+private define test_eqs (a, b)
+{
+ if ((typeof (a) != typeof (b))
+ or (_typeof (a) != _typeof (b)))
+ {
+	failed ("typeof", typeof(a), typeof(b));
+	verror ("foo");
+	return 0;
+ }
+
+ if (typeof (a) != Struct_Type)
+ {
+	if (length (a) != length (b))
+	 {
+	 failed ("test_eqs length", a, b);
+	 return 0;
+	 }
+
+	if (length (where (a != b)))
+	 {
+	 failed ("test_eqs", a, b);
+	 return 0;
+	 }
+	return 1;
+ }
+
+ variable fa, fb;
+ fa = get_struct_field_names (a);
+ fb = get_struct_field_names (b);
+
+ !if (test_eqs (fa, fb))
+ {
+	failed ("test_eqs: fa, fb");
+	return 0;
+ }
+
+ if (length (fa) != length (fb))
+ return 0;
+
+ foreach (fa)
+ {
+	variable name = ();
+	variable va, vb;
+	va = get_struct_field (a, name);
+	vb = get_struct_field (b, name);
+	if ((typeof (va) == Struct_Type)
+	 and (typeof (vb) == Struct_Type))
+	 {
+	 % void loop
+	 continue;
+	 }
+	!if (test_eqs (va, vb))
+	 return 0;
+ }
+
+ return 1;
+}
+
+private define test_save_object ()
+{
+ variable x0 = 1278;
+ variable x1 = 2.3;
+ variable x2 = "foo";
+ variable x3 = struct
+ {
+	a, b, c, d
+ };
+ variable x4 = 1:10;
+ variable x5 = "a","b","c","d";
+
+ x3.a = "foo";
+ x3.b = PI;
+ x3.c = 1:20;
+ x3.d = x3;
+
+ variable x6 = typecast ("foo", BString_Type);
+ variable x7 = x6;
+ save_object ("foo.sv", x0,x1,x2,x3,x4,x5,x6,x7);
+
+ variable y0,y1,y2,y3,y4,y5,y6,y7;
+
+ (y0,y1,y2,y3,y4,y5,y6,y7) = load_object ("foo.sv");
+
+ !if (test_eqs (x0, y0))
+ failed ("x0", x0, y0);
+ !if (test_eqs (x1, y1))
+ failed ("x1", x1, y1);
+ !if (test_eqs (x2, y2))
+ failed ("x2", x2, y2);
+
+ !if (test_eqs (x3, y3))
+ failed ("x3", x3, y3);
+
+ !if (test_eqs (x4, y4))
+ failed ("x4", x4, y4);
+ !if (test_eqs (x5, y5))
+ failed ("x5", x5, y5);
+
+ !if (test_eqs (x6, y6))
+ failed ("x5", x6, y6);
+ !if (__is_same (y6,y7))
+ failed ("__is_same(y6,y7)",y6,y7);
+
+ vmessage ("Regression Test Done");
+}
+
+test_save_object ();
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/examples/slsmgex2.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/examples/sort.sl Added

@@ -0,0 +1,58 @@
+#! /usr/bin/env slsh
+
+% This program presents the solution to a problem posed by
+% Tom Christiansen <tchrist@mox.perl.com>. The problem reads:
+%
+% Sort an input file that consists of lines like this
+%
+% var1=23 other=14 ditto=23 fred=2
+%
+% such that each output line is sorted WRT to the number. Order
+% of output lines does not change. Resolve collisions using the
+% variable name. e.g.
+%
+% fred=2 other=14 ditto=23 var1=23
+%
+% Lines may be up to several kilobytes in length and contain
+% zillions of variables.
+%---------------------------------------------------------------------------
+%
+% The solution presented below works by breaking up the line into an
+% array of alternating keywords and values with the keywords as the even
+% elements and the values as the odd. It is about 30% faster than the
+% python solution.
+
+private variable Keys, Values;
+private define sort_fun (i, j)
+{
+ variable s, a, b;
+
+ s = Valuesi - Valuesj;
+ !if (s)
+ return strcmp (Keysi, Keysj);
+ return s;
+}
+
+define slsh_main ()
+{
+ variable line, len, i, vals;
+ foreach line (stdin)
+ {
+	line = strtok (line, " \t\n=");
+	len = length(line)/2;
+	if (len == 0)
+	 continue;
+
+	% Even elements are keys, odd are values
+	Keys = line0::2;
+	vals = line1::2;
+
+	Values = atoi (vals);
+
+	i = array_sort (0:len-1, &sort_fun);
+
+	% There are different ways of writing the result. Here is a
+	% fast way that avoids a loop.
+	() = printf ("%s\n", strjoin (Keysi + "=" + valsi, " "));
+ }
+}

_service:tar_scm:slang-2.3.2.tar.bz2/examples/utmp.sl Added

@@ -0,0 +1,67 @@
+% This file illustrates how to read a binary file into a structure.  In this
+% case, the file is the Unix utmp file.
+%
+% Note that the format of the utmp file will vary with the OS.  The format
+% encoded here is for glibc Linux, but even that may be version-dependent.
+
+variable format, size, fp, buf;
+
+variable is_glibc = 1;
+
+#ifeval is_glibc
+typedef struct
+{
+   ut_type, ut_pid, ut_line, ut_id,
+     ut_user, ut_host, ut_exit, ut_session, ut_tv, ut_addr
+} UTMP_Type;
+% The ut_tv is a timeval structure which has the format: l2
+% Also the ut_exit field is a struct of h2
+format = pad_pack_format ("h i S32 S4 S32 S256 h2 l l2 k4 x20");
+#else
+typedef struct
+{
+   ut_type, ut_pid, ut_line, ut_id,
+     ut_time, ut_user, ut_host, ut_addr
+} UTMP_Type;
+format = pad_pack_format ("h i S12 S2 l S8 S16 l");
+#endif
+
+size = sizeof_pack (format);
+vmessage ("Sizeof of utmp line: %d bytes", size);
+
+define print_utmp (u)
+{
+   () = fprintf (stdout, "%-16s %-12s %-16s %s\n",
+		 u.ut_user, u.ut_line, u.ut_host,
+#ifeval is_glibc
+		 ctime (u.ut_tv0)
+#else
+		 ctime (u.ut_time)
+#endif
+		 );
+}
+
+variable Utmp_File;
+foreach ("/var/run/utmp", "/var/log/utmp")
+{
+   Utmp_File = ();
+   fp = fopen (Utmp_File, "rb");
+   if (fp != NULL)
+     break;
+}
+
+if (fp == NULL) error ("Unable to open utmp file");
+
+() = fprintf (stdout, "%-16s %-12s %-16s %s\n",
+	      "USER", "TTY", "FROM", "LOGIN@");
+
+variable U = @UTMP_Type;
+
+while (size == fread_bytes (&buf, size, fp))
+{
+   set_struct_fields (U, unpack (format, buf));
+   print_utmp (U);
+}
+
+() = fclose (fp);
+

_service:tar_scm:slang-2.3.2.tar.bz2/mkfiles Added

_service:tar_scm:slang-2.3.2.tar.bz2/mkfiles/README Added

_service:tar_scm:slang-2.3.2.tar.bz2/mkfiles/build.bat Added

_service:tar_scm:slang-2.3.2.tar.bz2/mkfiles/build.sh Added

_service:tar_scm:slang-2.3.2.tar.bz2/mkfiles/install.sl Added

@@ -0,0 +1,189 @@
+private variable Script_Version_String = "0.1.2";
+
+require ("cmdopt");
+require ("glob");
+
+private define convert_path (path)
+{
+   return strtrans (path, "/", "\\");
+}
+
+private define mkdir_p (dir);
+private define mkdir_p (dir)
+{
+   dir = convert_path (dir);
+
+   if ((-1 == mkdir (dir)) && (errno != EEXIST))
+     {
+	variable parent = path_dirname (dir);
+	if ((-1 == mkdir_p (parent))
+	    || (-1 == mkdir (dir)))
+	  {
+	     () = fprintf (stderr, "Failed to create %s: %s\n",
+			   dir, errno_string ());
+	     exit (1);
+	  }
+     }
+   return 0;
+}
+
+private define run_cmd (cmd)
+{
+   () = system (cmd);
+}
+
+private define install_file (file, dir)
+{
+   () = fprintf (stdout, "Installing %s in %s\n", file, dir);
+   dir = convert_path (dir);
+   file = convert_path (file);
+
+   run_cmd ("copy /y $file $dir"$);
+}
+
+private define install_files (pat, dir)
+{
+   foreach (glob (pat))
+     {
+	variable file = ();
+	install_file (file, dir);
+     }
+}
+
+private define install_libslang (root, objdir)
+{
+   variable libdir = "$root/lib"$;
+   variable bindir = "$root/bin"$;
+   variable incdir = "$root/include"$;
+
+   () = mkdir_p (libdir);
+   () = mkdir_p (incdir);
+   () = mkdir_p (bindir);
+
+   install_file ("src/slang.h", incdir);
+   install_file ("src/$objdir/libslang.a"$, libdir);
+   install_file ("src/$objdir/libslang.dll"$, bindir);
+}
+
+private define install_slang_doc (root)
+{
+   variable dir = "$root/share/doc/slang/v2"$;
+   () = mkdir_p (dir);
+   install_file ("changes.txt", dir);
+   install_file ("COPYING", dir);
+   install_file ("doc/slangdoc.html", dir);
+   install_file ("doc/text/*.txt", dir);
+}
+
+private define install_slsh (prefix, confdir, objdir)
+{
+   variable dir = "$prefix/bin"$;
+   () = mkdir_p (dir);
+   install_file ("slsh/$objdir/slsh.exe"$, dir);
+
+   dir = "$prefix/share/slsh"$;
+   () = mkdir_p (dir);
+   install_files ("slsh/lib/*.sl", dir);
+
+   dir = "$prefix/share/slsh/help"$;
+   () = mkdir_p (dir);
+   install_files ("slsh/lib/help/*.hlp", dir);
+
+   dir = "$prefix/share/slsh/rline"$;
+   () = mkdir_p (dir);
+   install_files ("slsh/lib/rline/*", dir);
+
+   dir = "$prefix/share/slsh/scripts"$;
+   () = mkdir_p (dir);
+   install_files ("slsh/scripts/*", dir);
+
+   dir = "$prefix/share/slsh/local-packages"$;
+   () = mkdir_p (dir);
+   dir = "$prefix/share/slsh/local-packages/help"$;
+   () = mkdir_p (dir);
+
+   dir = "$confdir"$;
+   () = mkdir_p (dir);
+   install_file ("slsh/etc/slsh.rc", dir);
+}
+
+private define install_modules (prefix)
+{
+   variable dir = "$prefix/lib/slang/v2/modules"$;
+   () = mkdir_p (dir);
+   install_files ("modules/*.dll", dir);
+
+   dir = "$prefix/share/slsh"$;
+   () = mkdir_p (dir);
+   install_files ("modules/*.sl", dir);
+
+   dir = "$prefix/share/slsh/statslib"$;
+   () = mkdir_p (dir);
+   install_files ("modules/statslib/*.sl", dir);
+
+   dir = "$prefix/share/slsh/cmaps"$;
+   () = mkdir_p (dir);
+   install_files ("modules/cmaps/*", dir);
+}
+
+private define exit_version ()
+{
+   () = fprintf (stdout, "Version: %S\n", Script_Version_String);
+   exit (0);
+}
+
+private define exit_usage ()
+{
+   variable fp = stderr;
+   () = fprintf (fp, "Usage: %s options install\n", __argv0);
+   variable opts =
+     
+      "Options:\n",
+      " -v|--version               Print version\n",
+      " -h|--help                  This message\n",
+      " --prefix=/install/prefix   Default is /usr\n",
+      " --distdir=/path            Default is blank\n",
+     ;
+   foreach (opts)
+     {
+	variable opt = ();
+	() = fputs (opt, fp);
+     }
+   exit (1);
+}
+
+define slsh_main ()
+{
+   variable c = cmdopt_new ();
+   variable destdir = "";
+   variable prefix = "/usr";
+
+   c.add("h|help", &exit_usage);
+   c.add("v|version", &exit_version);
+   c.add("destdir", &destdir; type="str");
+   c.add("prefix", &prefix; type="str");
+   variable i = c.process (__argv, 1);
+
+   if ((i + 1 != __argc) || (__argvi != "install"))
+     exit_usage ();
+
+   % See the comment in makefile.m32 for the motivation behind the
+   % sillyness involving X-.
+   if (0==strncmp (destdir, "X-", 2))
+     destdir = substr (destdir, 3, -1);
+
+   () = fprintf (stdout, "Using destdir=%s, prefix=%s\n", destdir, prefix);
+
+   variable root = strcat (destdir, prefix);
+
+   variable confdir = "/etc";
+   if (prefix != "/usr")
+     confdir = path_concat (prefix, "etc");
+   confdir = strcat (destdir, confdir);
+
+   variable objdir = "gw32objs";
+   install_libslang (root, objdir);
+   install_slang_doc (root);
+   install_slsh (root, confdir, objdir);
+   install_modules (root);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/mkfiles/m32init.bat Added

_service:tar_scm:slang-2.3.2.tar.bz2/mkfiles/makefile.dos Added

_service:tar_scm:slang-2.3.2.tar.bz2/mkfiles/makefile.m32 Added

@@ -0,0 +1,44 @@
+# -*-sh-*-
+
+# mingw32-make is used for both 32 and 64 bit builds.
+MAKE = mingw32-make
+
+# Note: copy.exe does not exist on windows since it is a cmd.exe built-in
+# The same appears to be true for del.
+MFLAGS = COPY="cmd /c copy /y" RM="cmd /c del"
+
+# DESTDIR is used for building a package for use on another machine.
+DESTDIR =
+
+# PREFIX controls where the library will be installed.
+PREFIX = C:/mingw/local
+CONFDIR = $(PREFIX)/etc
+#
+SLSH_DEFS = SLSH_CONF_DIR=$(CONFDIR) SLSH_LIB_DIR=$(PREFIX)/share/slsh
+SLANG_DEFS = prefix=$(PREFIX)
+
+all:
+	cd src && $(MAKE) $(MFLAGS) $(SLANG_DEFS)
+	cd slsh && $(MAKE) $(MFLAGS) $(SLSH_DEFS)
+	cd modules && $(MAKE) $(MFLAGS)
+	@echo .
+	@echo To install it, run $(MAKE) install.
+	@echo .
+#
+clean:
+	cd src && $(MAKE) $(MFLAGS) clean
+	cd slsh && $(MAKE) $(MFLAGS) clean
+	cd modules && $(MAKE) $(MFLAGS) clean
+#
+# Note the use of X- below.  Windows regards '=' as a commandline whitespace
+# character and needs to be quoted.  However I have not been able to figure
+# out how to do that in the context of the mingw32-make command parser.
+# As a major hack, I added the X- prefix and modified mkfiles/install.sl
+# to remove the X-.
+#
+# If the command below fails with an error message involving /usr/bin/sh, then
+# change "mkfiles\runslsh.bat" to "mkfiles/runslsh.bat"
+install: all
+	mkfiles\runslsh.bat mkfiles/install.sl --destdir="X-$(DESTDIR)" --prefix="$(PREFIX)" install
+#
+.PHONY: all install clean

_service:tar_scm:slang-2.3.2.tar.bz2/mkfiles/makefile.sh Added

_service:tar_scm:slang-2.3.2.tar.bz2/mkfiles/runslsh.bat Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/Makefile.in Added

@@ -0,0 +1,221 @@
+# -*- make -*-
+MODULES = slsmg-module.so termios-module.so select-module.so fcntl-module.so \
+ varray-module.so socket-module.so rand-module.so fork-module.so \
+ csv-module.so base64-module.so chksum-module.so histogram-module.so \
+ stats-module.so json-module.so \
+ @PCRE_MODULE@ @PNG_MODULE@ @ICONV_MODULE@ @ONIG_MODULE@ @ZLIB_MODULE@ @SYSCONF_MODULE@
+SLFILES = slsmg termios select fcntl varray socket rand fork csv \
+ base64 chksum histogram stats json \
+ pcre png iconv onig zlib sysconf
+TEST_SCRIPTS = test_slsmg.sl test_termios.sl test_select.sl test_fcntl.sl \
+ test_varray.sl test_socket.sl test_rand.sl test_fork.sl test_csv.sl \
+ test_base64.sl test_chksum.sl test_hist.sl test_stats.sl test_json.sl
+#
+CHKSUM_OBJS = chksum-module.o chksum_md5.o chksum_sha1.o
+STATS_OBJS = stats-module.o stats_kendall.o
+# ---------------------------------------------------------------------------
+CC		= @CC@
+CFLAGS		= @CFLAGS@ @SLANG_DLL_CFLAGS@
+LDFLAGS		= @LDFLAGS@
+CC_SHARED_FLAGS = @CC_SHARED_FLAGS@
+CC_SHARED 	= $(CC) $(INCS) $(CC_SHARED_FLAGS) $(CFLAGS)
+CONFIG_DIR	= @CONFIG_DIR@
+SRCDIR		= $(CONFIG_DIR)/modules
+CONFIG_H = $(SRCDIR)/config.h
+SLINT_H = $(SRCDIR)/slint.h
+OBJDIR		= $(ARCH)objs
+OBJDIR_TSTAMP	= $(OBJDIR)/tstamp
+# ---------------------------------------------------------------------------
+# Installation location of the slang library
+# ---------------------------------------------------------------------------
+prefix 		= @prefix@
+exec_prefix 	= @exec_prefix@
+SLANG_SRCINC	= -I@SRCDIR@
+DLL_IMPLIB_NAME = @DLL_IMPLIB_NAME@
+# On some systems, the module must be linked to the slang library,
+# but not all do. If you have such system, point SLANG_LIB to the
+# slang library, otherwise leave it blank.
+ELFDIR = @ELFDIR@
+SLANG_LIB	= @SLANG_LIB_FOR_MODULES@
+
+# ---------------------------------------------------------------------------
+# If building the PCRE module, you may need to set these
+# ---------------------------------------------------------------------------
+PCRE_INC	= @PCRE_INC@
+PCRE_LIB	= @PCRE_LIB@ -lpcre
+# ---------------------------------------------------------------------------
+# If building the PNG module, you may need to set these
+# ---------------------------------------------------------------------------
+PNG_INC	= @PNG_INC@
+PNG_LIB	= @PNG_LIB@ -lpng
+# ---------------------------------------------------------------------------
+# If building the ICONV module, you may need to set these
+# ---------------------------------------------------------------------------
+ICONV_INC	= @ICONV_INC@
+ICONV_LIB	= @ICONV_LIB@
+# ---------------------------------------------------------------------------
+# If building the ONIG module, you may need to set these
+# ---------------------------------------------------------------------------
+ONIG_INC	= @ONIG_INC@
+ONIG_LIB	= @ONIG_LIB@ -lonig
+# ---------------------------------------------------------------------------
+# If building the ZLIB module, you may need to set these
+# ---------------------------------------------------------------------------
+ZLIB_INC	= @Z_INC@
+ZLIB_LIB	= @Z_LIB@ -lz
+# ---------------------------------------------------------------------------
+# If building the SOCKET module, you may need to set these
+# ---------------------------------------------------------------------------
+SOCKET_LIBS = @X_EXTRA_LIBS@
+# ---------------------------------------------------------------------------
+# Installation location of the modules
+# ---------------------------------------------------------------------------
+MODULE_INSTALL_DIR = @libdir@/slang/v@slang_major_version@/modules
+INSTALL		= @INSTALL@
+INSTALL_DATA	= @INSTALL_DATA@
+INSTALL_MODULE	= @INSTALL_MODULE@
+MKINSDIR	= $(CONFIG_DIR)/autoconf/mkinsdir.sh
+SLSH_DIR	= $(prefix)/share/slsh
+CMAPS_DIR	= $(SLSH_DIR)/cmaps
+HELP_DIR	= $(SLSH_DIR)/help
+# ---------------------------------------------------------------------------
+# DESTDIR is designed to facilitate making packages. Normally it is empty
+# ---------------------------------------------------------------------------
+#DESTDIR =
+DEST_MODULEDIR	= $(DESTDIR)$(MODULE_INSTALL_DIR)
+DEST_SLSH_DIR	= $(DESTDIR)$(SLSH_DIR)
+DEST_CMAPSDIR	= $(DESTDIR)$(CMAPS_DIR)
+DEST_HELPDIR	= $(DESTDIR)$(HELP_DIR)
+# ---------------------------------------------------------------------------
+RPATH = @RPATH@
+
+LIBS = $(LDFLAGS) $(RPATH) $(SLANG_LIB) $(DL_LIB) @M_LIB@
+INCS = $(SLANG_SRCINC)
+COMPILE_CMD = $(CC_SHARED) $(INCS)
+# ---------------------------------------------------------------------------
+all: $(OBJDIR)/Makefile
+	cd $(OBJDIR) && $(MAKE) $(MODULES)
+$(CONFIG_H): $(CONFIG_DIR)/src/config.h
+	cp $(CONFIG_DIR)/src/config.h $(CONFIG_H)
+$(SLINT_H): $(CONFIG_DIR)/src/_slint.h
+	cp $(CONFIG_DIR)/src/_slint.h $(SLINT_H)
+$(OBJDIR_TSTAMP):
+	-$(MKINSDIR) $(OBJDIR)
+	touch $(OBJDIR_TSTAMP)
+$(OBJDIR)/Makefile: $(OBJDIR_TSTAMP) Makefile
+	cp Makefile $(OBJDIR)
+
+#
+# These (and only these) targets are supposed to be built only in $(OBJDIR):
+#
+slsmg-module.so: $(SRCDIR)/slsmg-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(SRCDIR)/slsmg-module.c -o slsmg-module.so $(LIBS)
+rand-module.so: $(SRCDIR)/rand-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(SRCDIR)/rand-module.c -o rand-module.so $(LIBS)
+newt-module.so: $(SRCDIR)/newt-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(SRCDIR)/newt-module.c -o newt-module.so -lnewt $(LIBS)
+termios-module.so: $(SRCDIR)/termios-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(SRCDIR)/termios-module.c -o termios-module.so $(LIBS)
+select-module.so: $(SRCDIR)/select-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(SRCDIR)/select-module.c -o select-module.so $(LIBS)
+fcntl-module.so: $(SRCDIR)/fcntl-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(SRCDIR)/fcntl-module.c -o fcntl-module.so $(LIBS)
+varray-module.so: $(SRCDIR)/varray-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(SRCDIR)/varray-module.c -o varray-module.so $(LIBS)
+pcre-module.so: $(SRCDIR)/pcre-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(PCRE_INC) $(SRCDIR)/pcre-module.c -o pcre-module.so $(PCRE_LIB) $(LIBS)
+onig-module.so: $(SRCDIR)/onig-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(ONIG_INC) $(SRCDIR)/onig-module.c -o onig-module.so $(ONIG_LIB) $(LIBS)
+png-module.so: $(SRCDIR)/png-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(PNG_INC) $(SRCDIR)/png-module.c -o png-module.so $(PNG_LIB) $(LIBS)
+socket-module.so: $(SRCDIR)/socket-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(SRCDIR)/socket-module.c -o socket-module.so $(SOCKET_LIBS) $(LIBS)
+iconv-module.so: $(SRCDIR)/iconv-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(ICONV_INC) $(SRCDIR)/iconv-module.c -o iconv-module.so $(ICONV_LIB) $(LIBS)
+zlib-module.so: $(SRCDIR)/zlib-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(ZLIB_INC) $(SRCDIR)/zlib-module.c -o zlib-module.so $(ZLIB_LIB) $(LIBS)
+fork-module.so: $(SRCDIR)/fork-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(SRCDIR)/fork-module.c -o fork-module.so $(LIBS)
+sysconf-module.so: $(SRCDIR)/sysconf-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(SRCDIR)/sysconf-module.c -o sysconf-module.so $(LIBS)
+csv-module.so: $(SRCDIR)/csv-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(SRCDIR)/csv-module.c -o csv-module.so $(LIBS)
+base64-module.so: $(SRCDIR)/base64-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(SRCDIR)/base64-module.c -o base64-module.so $(LIBS)
+json-module.so: $(SRCDIR)/json-module.c $(CONFIG_H)
+	$(COMPILE_CMD) $(SRCDIR)/json-module.c -o json-module.so $(LIBS)
+#
+chksum-module.so: $(CHKSUM_OBJS)
+	$(COMPILE_CMD) $(CHKSUM_OBJS) -o chksum-module.so $(LIBS)
+chksum-module.o: $(SRCDIR)/chksum-module.c $(SRCDIR)/chksum.h
+	$(COMPILE_CMD) -c $(SRCDIR)/chksum-module.c
+chksum_md5.o: $(SRCDIR)/chksum_md5.c $(SRCDIR)/chksum.h
+	$(COMPILE_CMD) -c $(SRCDIR)/chksum_md5.c
+chksum_sha1.o: $(SRCDIR)/chksum_sha1.c $(SRCDIR)/chksum.h
+	$(COMPILE_CMD) -c $(SRCDIR)/chksum_sha1.c
+#
+histogram-module.so: $(SRCDIR)/histogram-module.c $(SRCDIR)/histogram-module.inc
+	$(COMPILE_CMD) $(SRCDIR)/histogram-module.c -o histogram-module.so $(LIBS)
+#
+stats-module.so: $(STATS_OBJS)
+	$(COMPILE_CMD) $(STATS_OBJS) -o stats-module.so $(LIBS)
+stats-module.o: $(SRCDIR)/stats-module.c $(SRCDIR)/stats-module.h
+	$(COMPILE_CMD) -c $(SRCDIR)/stats-module.c
+stats_kendall.o: $(SRCDIR)/stats_kendall.c $(SRCDIR)/stats-module.h
+	$(COMPILE_CMD) -c $(SRCDIR)/stats_kendall.c
+#
+# </targets to be built in $(OBJDIR)>
+#
+
+# Note that Windows/Cygwin modules need execute permissions
+install: all
+	-$(MKINSDIR) $(DEST_MODULEDIR)
+	@for i in $(MODULES); \
+	do \
+		echo $(INSTALL_MODULE) $(OBJDIR)/$$i $(DEST_MODULEDIR); \
+		$(INSTALL_MODULE) $(OBJDIR)/$$i $(DEST_MODULEDIR); \
+	done
+	-$(MKINSDIR) $(DEST_SLSH_DIR)
+	@for i in $(SLFILES); \
+	do \
+		echo $(INSTALL_DATA) $$i.sl $(DEST_SLSH_DIR); \
+		$(INSTALL_DATA) $$i.sl $(DEST_SLSH_DIR); \
+	done
+	@for d in statslib; \
+	do \
+	 $(MKINSDIR) $(DEST_SLSH_DIR)/$$d; \
+	 for i in $$d/*.sl; \
+	 do \
+		echo $(INSTALL_DATA) $$i $(DEST_SLSH_DIR)/$$d/; \
+		$(INSTALL_DATA) $$i $(DEST_SLSH_DIR)/$$d/; \
+	 done; \
+ done
+	-$(MKINSDIR) $(DEST_CMAPSDIR)
+	@for i in cmaps/*.map; \
+	do \
+		echo $(INSTALL_DATA) $$i $(DEST_CMAPSDIR); \
+		$(INSTALL_DATA) $$i $(DEST_CMAPSDIR); \
+	done
+	-$(MKINSDIR) $(DEST_HELPDIR)
+	@for i in help/*.hlp; \
+	do \
+		echo $(INSTALL_DATA) $$i $(DEST_HELPDIR); \
+		$(INSTALL_DATA) $$i $(DEST_HELPDIR); \
+	done
+runtests: all
+	@test_scripts="$(TEST_SCRIPTS)"; \
+	test -z "@PNG_MODULE@" || test_scripts="$$test_scripts test_png.sl"; \
+	test -z "@ONIG_MODULE@" || test_scripts="$$test_scripts test_onig.sl"; \
+	test -z "@ZLIB_MODULE@" || test_scripts="$$test_scripts test_zlib.sl"; \
+	test -z "@PCRE_MODULE@" || test_scripts="$$test_scripts test_pcre.sl"; \
+	test -z "@ICONV_MODULE@" || test_scripts="$$test_scripts test_iconv.sl"; \
+	test -z "@SYSCONF_MODULE@" || test_scripts="$$test_scripts test_sysconf.sl"; \
+	cd test; ./runtests.sh $$test_scripts
+clean:
+	-/bin/rm -f $(OBJDIR_TSTAMP)
+	-cd $(OBJDIR) && /bin/rm -f $(MODULES) $(CHKSUM_OBJS)
+	-/bin/rm -f *~ */*~
+distclean: clean
+	-/bin/rm -f Makefile $(OBJDIR)/Makefile $(CONFIG_H)
+
+.PHONY: clean distclean all install runtests

_service:tar_scm:slang-2.3.2.tar.bz2/modules/README Added

@@ -0,0 +1,98 @@
+This directory contains some examples of dynamically loaded modules
+that may be loaded via the `import' intrinsic function:
+
+  import ("NAME");
+
+This intrinsic function is available to applications that enable it
+via a call to the `SLang_init_import' function.  Of course, the OS
+must provide support for dynamic linking.
+
+When a slang script contains a line such as
+
+  import ("NAME");
+
+or
+
+  import ("NAME", "NAMESPACE");
+
+the interpreter will request that the operating system dynamically
+link to a shared object called NAME-module.so.  In order for such
+linking to take place, the OS must be able to find the module.  The
+search for the module takes place as follows:
+
+   First a search takes place along the set of paths returned by the
+   `get_import_module_path' function.  If not found, a search is
+   performed along the paths given by the `SLANG_MODULE_PATH'
+   environment variable.  Then the search will take place in the path
+   defined by the slang/src/Makefile MODULE_INSTALL_DIR variable.  If
+   the module has not been found along any of these paths, a system
+   dependent search will be performed (e.g., using the `LD_LIBRARY_PATH'
+   environment variable).
+
+Hence, if you are writing a module that will work with all slang
+applications, then module should be installed in the path specified by
+the Makefile variable MODULE_INSTALL_DIR, which by default is
+
+   $(exec_prefix)/lib/slang/v2/modules
+
+for this version of the library.
+
+If the module was sucessfully loaded, the slang library will call the
+function `init_NAME_ns' that NAME-module.so must define.  This
+function must have the prototype:
+
+  int init_NAME_module_ns (char *namespace);
+
+and shall return 0 upon success, or -1 if an error occurred.  The
+namespace argument corresponds to the second (optional) parameter of
+the import intrinsic indicating that the module should be imported
+into the specified namespace.  To this end, the module must call one
+of the SLns_* functions to load intrinsics into the namespace.
+
+****NOTE****
+
+  In order to support the inclusion of the module into more than one
+  namespace, this function may be called multiple times.  Hence, the
+  function should be coded in such a way that initialization code
+  that should execute no more than once does so only once.  See, e.g.,
+  the "register_pcre_type" function in pcre-module.c for an explicit
+  example.
+
+  Module writers are encouraged to supply a script called NAME.sl that
+  looks like:
+
+     import ("NAME");
+     % Optional code...
+     provide ("NAME");
+
+  Then a user would be able to load the module by using, e.g.,
+
+     require ("NAME");
+
+*************
+
+Optionally, the module may define a function called `deinit_NAME_module' that
+will be called by the interpreter to deinitialize the module.  This
+function must have the prototype:
+
+   void deinit_NAME_module (void);
+
+To ensure the correct prototypes for these functions, the module
+should include the line:
+
+    SLANG_MODULE(name);
+
+SLANG_MODULE is a macro that expands into function prototypes.
+
+See the examples in this directory for more information.
+
+To run these modules, use the slsh program in ../slsh/.
+slsh.c is a program that embeds the interpreter and may be used to
+test slang scripts.  In fact, it may be used to create unix executable
+scripts via, e.g.,
+
+#! /usr/bin/env slsh
+
+as the first line of the script.  See ../slsh/scripts subdirectory for
+examples of this approach.
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/base64-module.c Added

@@ -0,0 +1,570 @@
+/*
+Copyright (C) 2014-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include <stdio.h>
+#include <string.h>
+#include <ctype.h>
+#include <slang.h>
+
+SLANG_MODULE(base64);
+
+static int Base64_Type_Id = 0;
+typedef struct _Base64_Type Base64_Type;
+struct _Base64_Type
+{
+ int type;
+#define B64_TYPE_ENCODER	1
+#define B64_TYPE_DECODER	2
+ SLang_Name_Type *callback;
+ SLang_Any_Type *callback_data;
+ unsigned char *buffer;		 /* malloced buffer_size + overhead */
+#define B64_ENCODE_BUFFER_SIZE 76 /* multiple of 4 */
+#define B64_DECODE_BUFFER_SIZE 512
+ unsigned int buffer_size;
+ unsigned int num_buffered;
+ unsigned char smallbuf4;
+ unsigned int smallbuf_len;
+#define B64_CLOSED	0x1
+#define B64_INVALID	0x2
+ int flags;
+};
+
+static int check_b64_type (Base64_Type *b64, int type, int err)
+{
+ if (type && (b64->type != type))
+ {
+	if (err)
+	 SLang_verror (SL_InvalidParm_Error, "Expected a base64 %s type",
+			(type == B64_TYPE_ENCODER) ? "encoder" : "decoder");
+	return -1;
+ }
+
+ if (b64->flags & (B64_INVALID|B64_CLOSED))
+ {
+	if (err)
+	 SLang_verror (SL_InvalidParm_Error, "Base64 encoder is invalid or closed");
+	return -1;
+ }
+ return 0;
+}
+
+static void b64_partial_free (Base64_Type *b64)
+{
+ if (b64->callback_data != NULL) SLang_free_anytype (b64->callback_data);
+ b64->callback_data = NULL;
+ if (b64->callback != NULL) SLang_free_function (b64->callback);
+ b64->callback = NULL;
+ if (b64->buffer != NULL) SLfree ((char *)b64->buffer);
+ b64->buffer = NULL;
+ b64->flags |= B64_INVALID;
+}
+
+static int create_b64_buffer (Base64_Type *b64)
+{
+ b64->num_buffered = 0;
+ if (NULL == (b64->buffer = (unsigned char *)SLmalloc (b64->buffer_size + 1)))
+ return -1;
+ return 0;
+}
+
+static int execute_callback (Base64_Type *b64)
+{
+ SLang_BString_Type *b;
+
+ if (NULL == (b = SLbstring_create_malloced (b64->buffer, b64->num_buffered, 0)))
+ return -1;
+
+ if (-1 == create_b64_buffer (b64))
+ {
+	SLbstring_free (b);
+	return -1;
+ }
+
+ if ((-1 == SLang_start_arg_list ())
+ || (-1 == SLang_push_anytype (b64->callback_data))
+ || (-1 == SLang_push_bstring (b))
+ || (-1 == SLang_end_arg_list ())
+ || (-1 == SLexecute_function (b64->callback)))
+ {
+	b64->flags |= B64_INVALID;
+	SLbstring_free (b);
+	return -1;
+ }
+ SLbstring_free (b);
+ return 0;
+}
+
+static void free_b64_type (Base64_Type *b64)
+{
+ if (b64 == NULL)
+ return;
+ b64_partial_free (b64);
+ SLfree ((char *)b64);
+}
+
+/* rfc1521:
+ *
+ * The encoding process represents 24-bit groups of input bits as output
+ * strings of 4 encoded characters. Proceeding from left to right, a
+ * 24-bit input group is formed by concatenating 3 8-bit input groups.
+ * These 24 bits are then treated as 4 concatenated 6-bit groups, each
+ * of which is translated into a single digit in the base64 alphabet.
+ * When encoding a bit stream via the base64 encoding, the bit stream
+ * must be presumed to be ordered with the most-significant-bit first.
+ */
+
+static char Base64_Bit_Mapping64 =
+{
+ 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P',
+ 'Q','R','S','T','U','V','W','X','Y','Z','a','b','c','d','e','f',
+ 'g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v',
+ 'w','x','y','z','0','1','2','3','4','5','6','7','8','9','+','/',
+};
+
+/* The output stream (encoded bytes) must be represented in lines of no
+ * more than 76 characters each. All line breaks or other characters
+ * not found in Table 1 must be ignored by decoding software. In base64
+ * data, characters other than those in Table 1, line breaks, and other
+ * white space probably indicate a transmission error, about which a
+ * warning message or even a message rejection might be appropriate
+ * under some circumstances.
+ */
+
+static int b64_encode_triplet (Base64_Type *b64, unsigned char *str)
+{
+ unsigned char *encode_buf;
+ unsigned char ch0, ch1, ch2;
+
+ encode_buf = b64->buffer + b64->num_buffered;
+
+ ch0 = str0;
+ ch1 = str1;
+ ch2 = str2;
+ encode_buf0 = Base64_Bit_Mappingch0>>2;
+ encode_buf1 = Base64_Bit_Mapping((ch0&0x3)<<4) | (ch1>>4);
+ encode_buf2 = Base64_Bit_Mapping((ch1&0xF)<<2) | (ch2>>6);
+ encode_buf3 = Base64_Bit_Mappingch2&0x3F;
+ b64->num_buffered += 4;
+ if (b64->num_buffered < b64->buffer_size)
+ return 0;
+ encode_buf4 = 0;
+ return execute_callback (b64);
+}
+
+static int b64_encode_accumulate (Base64_Type *b64, unsigned char *line, unsigned int len)
+{
+ unsigned char *linemax;
+ unsigned int i;
+
+ linemax = line + len;
+
+ i = b64->smallbuf_len;
+ if (i && (i < 3))
+ {
+	if (line < linemax)
+	 b64->smallbufi++ = *line++;
+	if ((i < 3) && (line < linemax))
+	 b64->smallbufi++ = *line++;
+
+	if (i < 3)
+	 {
+	 b64->smallbuf_len = i;
+	 return 0;
+	 }
+	if (-1 == b64_encode_triplet (b64, b64->smallbuf))
+	 return -1;
+	b64->smallbuf_len = 0;
+ }
+
+ while (line + 3 <= linemax)
+ {
+	if (-1 == b64_encode_triplet (b64, line))
+	 return -1;
+	line += 3;
+ }
+
+ i = 0;
+ while (line < linemax)
+ b64->smallbufi++ = *line++;
+ b64->smallbuf_len = i;
+ return 0;
+}
+
+static void b64_encoder_accumulate_intrin (Base64_Type *b64, SLang_BString_Type *bstr)
+{
+ unsigned char *data;
+ SLstrlen_Type len;
+
+ if (-1 == check_b64_type (b64, B64_TYPE_ENCODER, 1))
+ return;
+
+ if (NULL == (data = SLbstring_get_pointer (bstr, &len)))
+ return;
+
+ (void) b64_encode_accumulate (b64, data, len);
+}
+
+static void b64_encoder_close_intrin (Base64_Type *b64)
+{
+ if (-1 == check_b64_type (b64, B64_TYPE_ENCODER, 0))
+ goto close_encoder;
+
+ /* Handle the padding */
+ if (b64->smallbuf_len)
+ {
+	unsigned char *encode_buf = b64->buffer + b64->num_buffered;
+	unsigned char ch0;
+
+	ch0 = b64->smallbuf0;
+	encode_buf0 = Base64_Bit_Mappingch0>>2;
+	if (b64->smallbuf_len > 1)
+	 {
+	 unsigned char ch1 = b64->smallbuf1;
+	 encode_buf1 = Base64_Bit_Mapping((ch0&0x3)<<4) | (ch1>>4);
+	 encode_buf2 = Base64_Bit_Mapping((ch1&0xF)<<2);
+	 }
+	else
+	 {
+	 encode_buf1 = Base64_Bit_Mapping((ch0&0x3)<<4);
+	 encode_buf2 = '=';
+	 }
+	encode_buf3 = '=';
+	b64->num_buffered += 4;
+	b64->smallbuf_len = 0;
+	if (b64->num_buffered >= b64->buffer_size)
+	 (void) execute_callback (b64);
+ }
+
+ if (b64->num_buffered)
+ (void) execute_callback (b64);
+
+close_encoder:
+ b64_partial_free (b64);
+ b64->flags |= B64_CLOSED;
+}
+
+static unsigned char Base64_Decode_Map 256 =
+{
+ 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
+ 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
+ 255,255,255,255,255,255,255,255,255,255,255, 62,255,255,255, 63,
+ 52, 53, 54, 55, 56, 57, 58, 59, 60, 61,255,255,255,255,255,255,
+ 255, 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,255,255,255,255,255,
+ 255, 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,255,255,255,255,255,
+ 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
+ 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
+ 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
+ 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
+ 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
+ 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
+ 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
+ 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255
+};
+
+static int b64_decode_quartet (Base64_Type *b64, unsigned char *str4)
+{
+ unsigned char b0, b1, b2, b3;
+ unsigned char bytes_buf3, *bytes;
+ unsigned int bad;
+ unsigned int n;
+
+ if (0xFF == (b0 = Base64_Decode_Mapstr40))
+ {
+	bad = 0;
+	goto return_error;
+ }
+ if (0xFF == (b1 = Base64_Decode_Mapstr41))
+ {
+	bad = 1;
+	goto return_error;
+ }
+
+ n = 3;
+
+ b2 = Base64_Decode_Mapstr42;
+ b3 = Base64_Decode_Mapstr43;
+ if ((b2 == 0xFF) || (b3 == 0xFF))
+ {
+	if (b2 == 0xFF)
+	 {
+	 if ('=' != str42)
+	 {
+		 bad = 2;
+		 goto return_error;
+	 }
+	 n = 1;
+	 }
+	else n = 2;
+
+	if (str43 != '=')
+	 {
+	 SLang_verror (SL_Data_Error, "Illegally padded base64 sequence seen");
+	 return -1;
+	 }
+ }
+
+ if (b64->num_buffered + n < b64->buffer_size)
+ bytes = b64->buffer + b64->num_buffered;
+ else
+ bytes = bytes_buf;
+
+ bytes0 = (b0 << 2) | (b1>>4);
+ if (n > 1)
+ {
+	bytes1 = (b1 << 4) | (b2 >> 2);
+	if (n > 2)
+	 bytes2 = (b2 << 6) | b3;
+ }
+
+ if (bytes != bytes_buf)
+ {
+	b64->num_buffered += n;
+	return 0;
+ }
+
+ while (n && (b64->num_buffered < b64->buffer_size))
+ {
+	b64->bufferb64->num_buffered++ = *bytes++;
+	n--;
+ }
+ if (b64->num_buffered == b64->buffer_size)
+ {
+	if (-1 == execute_callback (b64))
+	 return -1;
+ }
+ while (n)
+ {
+	b64->bufferb64->num_buffered++ = *bytes++;
+	n--;
+ }
+ return 0;
+
+return_error:
+ SLang_verror (SL_Data_Error, "Invalid character (0x%X) found in base64-encoded stream", str4bad);
+ return -1;
+}
+
+static void b64_decoder_accumulate_intrin (Base64_Type *b64, SLFUTURE_CONST char *str)
+{
+ unsigned int i;
+ unsigned char ch;
+ unsigned char *buf4;
+ if (-1 == check_b64_type (b64, B64_TYPE_DECODER, 1))
+ return;
+
+#define NEXT_CHAR \
+ while (isspace ((unsigned char)*str)) str++; ch = *str++
+
+ NEXT_CHAR;
+ if (ch == 0)
+ return;
+
+ i = b64->smallbuf_len;
+ buf4 = b64->smallbuf;
+ if (i && (i < 4))
+ {
+	buf4i++ = ch;
+	NEXT_CHAR;
+
+	if ((i < 4) && (ch != 0))
+	 {
+	 buf4i++ = ch;
+	 NEXT_CHAR;
+	 }
+	if ((i < 4) && (ch != 0))
+	 {
+	 buf4i++ = ch;
+	 NEXT_CHAR;
+	 }
+	if (i < 4)
+	 {
+	 b64->smallbuf_len = i;
+	 return;
+	 }
+	if (-1 == b64_decode_quartet (b64, buf4))
+	 return;
+
+	b64->smallbuf_len = 0;
+ }
+
+ while (1)
+ {
+	if (ch == 0)
+	 {
+	 i = 0;
+	 break;
+	 }
+	buf40 = ch;
+	NEXT_CHAR;
+	if (ch == 0)
+	 {
+	 i = 1;
+	 break;
+	 }
+	buf41 = ch;
+	NEXT_CHAR;
+	if (ch == 0)
+	 {
+	 i = 2;
+	 break;
+	 }
+	buf42 = ch;
+	NEXT_CHAR;
+	if (ch == 0)
+	 {
+	 i = 3;
+	 break;
+	 }
+	buf43 = ch;
+	if (-1 == b64_decode_quartet (b64, buf4))
+	 return;
+	NEXT_CHAR;
+ }
+
+ b64->smallbuf_len = i;
+}
+
+static void b64_decoder_close_intrin (Base64_Type *b64)
+{
+ SLFUTURE_CONST char *pad = "====";
+
+ if (-1 == check_b64_type (b64, B64_TYPE_DECODER, 0))
+ goto close_decoder;
+
+ /* silently add pad characters if necessary */
+ if (b64->smallbuf_len)
+ (void) b64_decoder_accumulate_intrin (b64, pad + b64->smallbuf_len);
+
+ if (b64->num_buffered)
+ (void) execute_callback (b64);
+
+close_decoder:
+ b64_partial_free (b64);
+ b64->flags |= B64_CLOSED;
+}
+
+static void new_b64_type (int type)
+{
+ Base64_Type *b64;
+ SLang_MMT_Type *mmt;
+
+ if (NULL == (b64 = (Base64_Type *)SLmalloc(sizeof(Base64_Type))))
+ return;
+ memset ((char *)b64, 0, sizeof(Base64_Type));
+
+ b64->type = type;
+ if (type == B64_TYPE_ENCODER)
+ b64->buffer_size = B64_ENCODE_BUFFER_SIZE;
+ else
+ b64->buffer_size = B64_DECODE_BUFFER_SIZE;
+
+ if (-1 == create_b64_buffer(b64))
+ {
+	SLfree ((char *)b64);
+	return;
+ }
+
+ if ((-1 == SLang_pop_anytype (&b64->callback_data))
+	|| (NULL == (b64->callback = SLang_pop_function ()))
+	|| (NULL == (mmt = SLang_create_mmt (Base64_Type_Id, (VOID_STAR)b64))))
+ {
+	free_b64_type (b64);
+	return;
+ }
+
+ if (-1 == SLang_push_mmt (mmt))
+ SLang_free_mmt (mmt);
+}
+
+static void new_b64_encoder_intrin (void)
+{
+ new_b64_type (B64_TYPE_ENCODER);
+}
+
+static void new_b64_decoder_intrin (void)
+{
+ new_b64_type (B64_TYPE_DECODER);
+}
+
+#define DUMMY_B64_TYPE ((SLtype)-1)
+static SLang_Intrin_Fun_Type Module_Intrinsics =
+{
+ MAKE_INTRINSIC_0("_base64_encoder_new", new_b64_encoder_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_2("_base64_encoder_accumulate", b64_encoder_accumulate_intrin, SLANG_VOID_TYPE, DUMMY_B64_TYPE, SLANG_BSTRING_TYPE),
+ MAKE_INTRINSIC_1("_base64_encoder_close", b64_encoder_close_intrin, SLANG_VOID_TYPE, DUMMY_B64_TYPE),
+ MAKE_INTRINSIC_0("_base64_decoder_new", new_b64_decoder_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_2("_base64_decoder_accumulate", b64_decoder_accumulate_intrin, SLANG_VOID_TYPE, DUMMY_B64_TYPE, SLANG_STRING_TYPE),
+ MAKE_INTRINSIC_1("_base64_decoder_close", b64_decoder_close_intrin, SLANG_VOID_TYPE, DUMMY_B64_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static void destroy_b64 (SLtype type, VOID_STAR f)
+{
+ (void) type;
+ free_b64_type ((Base64_Type *)f);
+}
+
+static int register_b64_type (void)
+{
+ SLang_Class_Type *cl;
+
+ if (Base64_Type_Id != 0)
+ return 0;
+
+ if (NULL == (cl = SLclass_allocate_class ("Base64_Type")))
+ return -1;
+
+ if (-1 == SLclass_set_destroy_function (cl, destroy_b64))
+ return -1;
+
+ /* By registering as SLANG_VOID_TYPE, slang will dynamically allocate a
+ * type.
+ */
+ if (-1 == SLclass_register_class (cl, SLANG_VOID_TYPE, sizeof (Base64_Type), SLANG_CLASS_TYPE_MMT))
+ return -1;
+
+ Base64_Type_Id = SLclass_get_class_id (cl);
+ if (-1 == SLclass_patch_intrin_fun_table1 (Module_Intrinsics, DUMMY_B64_TYPE, Base64_Type_Id))
+ return -1;
+
+ return 0;
+}
+
+int init_base64_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if (-1 == register_b64_type ())
+ return -1;
+
+ if (-1 == SLns_add_intrin_fun_table (ns, Module_Intrinsics, NULL))
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_base64_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/base64.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/chksum-module.c Added

@@ -0,0 +1,255 @@
+/*
+Copyright (C) 2014-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include "config.h"
+#include <stdio.h>
+#include <string.h>
+#include <slang.h>
+
+#include "chksum.h"
+
+SLANG_MODULE(chksum);
+
+static int Chksum_Type_Id = 0;
+
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ SLChksum_Type *(*create)(char *);
+}
+Chksum_Def_Type;
+
+typedef struct
+{
+ char *name;
+ unsigned int numrefs;
+ SLChksum_Type *c;
+}
+Chksum_Object_Type;
+
+static Chksum_Def_Type Chksum_Table =
+{
+ {"md5", _pSLchksum_md5_new},
+ {"sha1", _pSLchksum_sha1_new},
+ {NULL, NULL}
+};
+
+static Chksum_Def_Type *lookup_chksum (char *name)
+{
+ Chksum_Def_Type *t = Chksum_Table;
+
+ while (t->name != NULL)
+ {
+	if (0 == strcmp (t->name, name))
+	 return t;
+	t++;
+ }
+
+ SLang_verror (SL_RunTime_Error, "Unsupported/Unknown checksum method `%s'", name);
+ return NULL;
+}
+
+static int chksum_push (Chksum_Object_Type *obj)
+{
+ obj->numrefs++;
+
+ if (0 == SLclass_push_ptr_obj (Chksum_Type_Id, (VOID_STAR)obj))
+ return 0;
+
+ obj->numrefs--;
+ return -1;
+}
+
+static void chksum_free (Chksum_Object_Type *obj)
+{
+ if (obj == NULL)
+ return;
+ if (obj->numrefs > 1)
+ {
+	obj->numrefs--;
+	return;
+ }
+ if (obj->c != NULL)
+ (void) obj->c->close (obj->c, NULL);
+ SLfree ((char *)obj);
+}
+
+static void chksum_new (char *name)
+{
+ Chksum_Def_Type *t;
+ Chksum_Object_Type *obj;
+
+ t = lookup_chksum (name);
+ if (t == NULL)
+ return;
+
+ obj = (Chksum_Object_Type *)SLmalloc (sizeof (Chksum_Object_Type));
+ if (obj == NULL)
+ return;
+ memset ((char *)obj, 0, sizeof(SLChksum_Type));
+
+ obj->numrefs = 1;
+ if (NULL == (obj->c = t->create (name)))
+ {
+	SLfree ((char *)obj);
+	return;
+ }
+
+ (void) chksum_push (obj);
+ chksum_free (obj);
+}
+
+/* s is assumed to be at least 2*len+1 bytes. */
+static void hexify_string (unsigned char *s, unsigned int len)
+{
+ unsigned char *s0, *s1;
+
+ s0 = s + len;
+ s1 = s0 + len;
+ *s1-- = 0;
+ while (s0 > s)
+ {
+	unsigned char ch;
+	unsigned char buf3;
+
+	s0--;
+	ch = *s0;
+	sprintf ((char *)buf, "%02x", ch);
+	*s1-- = buf1;
+	*s1-- = buf0;
+ }
+}
+
+static void chksum_close (Chksum_Object_Type *obj)
+{
+ unsigned char *digest;
+ unsigned int digest_len;
+ SLChksum_Type *c;
+
+ if (NULL == (c = obj->c))
+ {
+	(void) SLang_push_null ();
+	return;
+ }
+
+ digest_len = c->digest_len;
+ if (NULL == (digest = (unsigned char *)SLmalloc(2*digest_len+1)))
+ return;
+
+ if (-1 == c->close (c, digest))
+ {
+	SLfree ((char *)digest);
+	return;
+ }
+ obj->c = NULL;
+
+ hexify_string (digest, digest_len);
+
+ (void) SLang_push_malloced_string ((char *)digest);
+}
+
+static void chksum_accumulate (Chksum_Object_Type *obj, SLang_BString_Type *b)
+{
+ SLChksum_Type *c;
+ SLstrlen_Type len;
+ unsigned char *s;
+
+ if (NULL == (c = obj->c))
+ {
+	SLang_verror (SL_InvalidParm_Error, "Checksum object is invalid");
+	return;
+ }
+ if (NULL == (s = SLbstring_get_pointer (b, &len)))
+ return;
+
+ (void) c->accumulate (c, s, len);
+}
+
+#define DUMMY_CHKSUM_TYPE ((unsigned int)-1)
+static SLang_Intrin_Fun_Type Intrinsics =
+{
+ MAKE_INTRINSIC_1 ("_chksum_new", chksum_new, SLANG_VOID_TYPE, SLANG_STRING_TYPE),
+ MAKE_INTRINSIC_2 ("_chksum_accumulate", chksum_accumulate, SLANG_VOID_TYPE, DUMMY_CHKSUM_TYPE, SLANG_BSTRING_TYPE),
+ MAKE_INTRINSIC_1 ("_chksum_close", chksum_close, SLANG_VOID_TYPE, DUMMY_CHKSUM_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static void destroy_chksum_type (SLtype type, VOID_STAR ptr)
+{
+ (void) type;
+ chksum_free (*(Chksum_Object_Type **)ptr);
+}
+
+static int push_chksum_type (SLtype type, VOID_STAR ptr)
+{
+ (void) type;
+ return chksum_push (*(Chksum_Object_Type **)ptr);
+}
+
+static int register_chksum_type (void)
+{
+ SLang_Class_Type *cl;
+
+ if (Chksum_Type_Id != 0)
+ return 0;
+
+ if (NULL == (cl = SLclass_allocate_class ("Chksum_Type")))
+ return -1;
+
+ if (-1 == SLclass_set_destroy_function (cl, destroy_chksum_type))
+ return -1;
+
+ if (-1 == SLclass_set_push_function (cl, push_chksum_type))
+ return -1;
+
+ /* By registering as SLANG_VOID_TYPE, slang will dynamically allocate a
+ * type.
+ */
+ if (-1 == SLclass_register_class (cl, SLANG_VOID_TYPE, sizeof (Chksum_Object_Type *), SLANG_CLASS_TYPE_PTR))
+ return -1;
+
+ Chksum_Type_Id = SLclass_get_class_id (cl);
+
+ if (-1 == SLclass_patch_intrin_fun_table1 (Intrinsics, DUMMY_CHKSUM_TYPE, Chksum_Type_Id))
+ return -1;
+
+ return 0;
+}
+
+int init_chksum_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns;
+
+ ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if (-1 == register_chksum_type ())
+ return -1;
+
+ if (-1 == SLns_add_intrin_fun_table (ns, Intrinsics, NULL))
+ return -1;
+
+ return 0;
+}
+
+void deinit_chksum_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/chksum.h Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/chksum.sl Added

@@ -0,0 +1,87 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License.  See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+import ("chksum");
+
+private define chksum_accumulate (c, str)
+{
+   _chksum_accumulate (c.obj, str);
+}
+
+private define chksum_close (c)
+{
+   variable chksum = _chksum_close (c.obj);
+   c.obj = NULL;
+   return chksum;
+}
+
+define chksum_new (name)
+{
+   return struct
+     {
+	obj = _chksum_new (name),
+	accumulate = &chksum_accumulate,
+	close = &chksum_close,
+	name = name,
+     };
+}
+
+define md5sum_new ()
+{
+   return chksum_new ("md5");
+}
+
+define sha1sum_new ()
+{
+   return chksum_new ("sha1");
+}
+
+define md5sum (str)
+{
+   variable c = _chksum_new ("md5");
+   _chksum_accumulate (c, str);
+   return _chksum_close (c);
+}
+
+define sha1sum (str)
+{
+   variable c = _chksum_new ("sha1");
+   _chksum_accumulate (c, str);
+   return _chksum_close (c);
+}
+
+define chksum_file (fp, type)
+{
+   variable file = NULL;
+   if (typeof (fp) != File_Type)
+     {
+	file = fp;
+	fp = fopen (file, "rb");
+	if (fp == NULL)
+	  throw OpenError, "Error opening $file"$;
+     }
+
+   variable c = _chksum_new (type);
+
+   variable buf;
+   while (-1 != fread_bytes (&buf, 4096, fp))
+     {
+	_chksum_accumulate (c, buf);
+     }
+   % Allow the interpreter to close fp when it goes out of scope
+   return _chksum_close (c);
+}
+
+define md5sum_file (file)
+{
+   return chksum_file (file, "md5");
+}
+
+define sha1sum_file (file)
+{
+   return chksum_file (file, "sha1");
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/chksum_md5.c Added

@@ -0,0 +1,418 @@
+/*
+Copyright (C) 2014-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "config.h"
+#include <string.h>
+#include <slang.h>
+
+#include "_slint.h"
+
+#define MD5_BUFSIZE	64
+#define MD5_DIGEST_LEN	16
+#define CHKSUM_TYPE_PRIVATE_FIELDS \
+ _pSLuint32_Type abcd4; \
+ _pSLuint32_Type num_bits2;		 /* 64 bit representation */ \
+ unsigned int num_buffered; \
+ unsigned char bufMD5_BUFSIZE;
+#include "chksum.h"
+
+/* 8 bit bytes assumed in what follows. The algorithm is based upon
+ * section 3 of RFC 1321.
+ */
+
+/*
+3.1 Step 1. Append Padding Bits
+
+ The message is "padded" (extended) so that its length (in bits) is
+ congruent to 448, modulo 512. That is, the message is extended so
+ that it is just 64 bits shy of being a multiple of 512 bits long.
+ Padding is always performed, even if the length of the message is
+ already congruent to 448, modulo 512.
+*/
+
+static unsigned int compute_pad_length (unsigned int len)
+{
+ unsigned int mod64 = len % 64;
+ unsigned int dlen;
+
+ if (mod64 < 56)
+ dlen = 56 - mod64;
+ else
+ dlen = 120 - mod64;
+
+ return dlen;
+}
+
+/* Padding is performed as follows: a single "1" bit is appended to the */
+/* message, and then "0" bits are appended so that the length in bits of */
+/* the padded message becomes congruent to 448, modulo 512. In all, at */
+/* least one bit and at most 512 bits are appended. */
+static unsigned char Pad_Bytes64 =
+{
+ 0x80, 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, 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
+};
+
+/*
+3.2 Step 2. Append Length
+
+ A 64-bit representation of b (the length of the message before the
+ padding bits were added) is appended to the result of the previous
+ step. In the unlikely event that b is greater than 2^64, then only
+ the low-order 64 bits of b are used. (These bits are appended as two
+ 32-bit words and appended low-order word first in accordance with the
+ previous conventions.)
+
+ At this point the resulting message (after padding with bits and with
+ b) has a length that is an exact multiple of 512 bits. Equivalently,
+ this message has a length that is an exact multiple of 16 (32-bit)
+ words. Let M0 ... N-1 denote the words of the resulting message,
+ where N is a multiple of 16.
+*/
+
+/*
+3.3 Step 3. Initialize MD Buffer
+
+ A four-word buffer (A,B,C,D) is used to compute the message digest.
+ Here each of A, B, C, D is a 32-bit register. These registers are
+ initialized to the following values in hexadecimal, low-order bytes
+ first):
+
+ word A: 01 23 45 67
+ word B: 89 ab cd ef
+ word C: fe dc ba 98
+ word D: 76 54 32 10
+*/
+
+static void init_md5_buffer (_pSLuint32_Type buffer4)
+{
+ buffer0 = 0x67452301;
+ buffer1 = 0xEFCDAB89;
+ buffer2 = 0x98BADCFE;
+ buffer3 = 0x10325476;
+}
+
+/*
+3.4 Step 4. Process Message in 16-Word Blocks
+
+ We first define four auxiliary functions that each take as input
+ three 32-bit words and produce as output one 32-bit word.
+
+ F(X,Y,Z) = XY v not(X) Z
+ G(X,Y,Z) = XZ v Y not(Z)
+ H(X,Y,Z) = X xor Y xor Z
+ I(X,Y,Z) = Y xor (X v not(Z))
+ */
+
+#define MD5_F_OP(X,Y,Z) (((X)&(Y)) | ((~(X))&(Z)))
+#define MD5_G_OP(X,Y,Z) (((X)&(Z)) | ((Y)&(~(Z))))
+#define MD5_H_OP(X,Y,Z) ((X)^(Y)^(Z))
+#define MD5_I_OP(X,Y,Z) ((Y)^((X)|(~(Z))))
+
+/* The algorithm works on blocks that consist of 16 32bit ints */
+static void process_block (_pSLuint32_Type block16, _pSLuint32_Type abcd4)
+{
+ _pSLuint32_Type a = abcd0, b = abcd1, c = abcd2, d = abcd3;
+
+#define MD5_ROTATE(a,n) (((a)<<(n)) | ((a)>>(32-(n))))
+
+#define MD5_ROUND1_OP(A,B,C,D,k,s,t) \
+ A += MD5_F_OP(B,C,D) + blockk + t;\
+ A = B + MD5_ROTATE(A,s);
+
+#define MD5_ROUND2_OP(A,B,C,D,k,s,t) \
+ A += MD5_G_OP(B,C,D) + blockk + t;\
+ A = B + MD5_ROTATE(A,s);
+
+#define MD5_ROUND3_OP(A,B,C,D,k,s,t) \
+ A += MD5_H_OP(B,C,D) + blockk + t;\
+ A = B + MD5_ROTATE(A,s);
+
+#define MD5_ROUND4_OP(A,B,C,D,k,s,t) \
+ A += MD5_I_OP(B,C,D) + blockk + t;\
+ A = B + MD5_ROTATE(A,s);
+
+ MD5_ROUND1_OP(a,b,c,d,0,7,0xD76AA478);
+ MD5_ROUND1_OP(d,a,b,c,1,12,0xE8C7B756);
+ MD5_ROUND1_OP(c,d,a,b,2,17,0x242070DB);
+ MD5_ROUND1_OP(b,c,d,a,3,22,0xC1BDCEEE);
+ MD5_ROUND1_OP(a,b,c,d,4,7,0xF57C0FAF);
+ MD5_ROUND1_OP(d,a,b,c,5,12,0x4787C62A);
+ MD5_ROUND1_OP(c,d,a,b,6,17,0xA8304613);
+ MD5_ROUND1_OP(b,c,d,a,7,22,0xFD469501);
+ MD5_ROUND1_OP(a,b,c,d,8,7,0x698098D8);
+ MD5_ROUND1_OP(d,a,b,c,9,12,0x8B44F7AF);
+ MD5_ROUND1_OP(c,d,a,b,10,17,0xFFFF5BB1);
+ MD5_ROUND1_OP(b,c,d,a,11,22,0x895CD7BE);
+ MD5_ROUND1_OP(a,b,c,d,12,7,0x6B901122);
+ MD5_ROUND1_OP(d,a,b,c,13,12,0xFD987193);
+ MD5_ROUND1_OP(c,d,a,b,14,17,0xA679438E);
+ MD5_ROUND1_OP(b,c,d,a,15,22,0x49B40821);
+
+ MD5_ROUND2_OP(a,b,c,d,1,5,0xF61E2562);
+ MD5_ROUND2_OP(d,a,b,c,6,9,0xC040B340);
+ MD5_ROUND2_OP(c,d,a,b,11,14,0x265E5A51);
+ MD5_ROUND2_OP(b,c,d,a,0,20,0xE9B6C7AA);
+ MD5_ROUND2_OP(a,b,c,d,5,5,0xD62F105D);
+ MD5_ROUND2_OP(d,a,b,c,10,9,0x02441453);
+ MD5_ROUND2_OP(c,d,a,b,15,14,0xD8A1E681);
+ MD5_ROUND2_OP(b,c,d,a,4,20,0xE7D3FBC8);
+ MD5_ROUND2_OP(a,b,c,d,9,5,0x21E1CDE6);
+ MD5_ROUND2_OP(d,a,b,c,14,9,0xC33707D6);
+ MD5_ROUND2_OP(c,d,a,b,3,14,0xF4D50D87);
+ MD5_ROUND2_OP(b,c,d,a,8,20,0x455A14ED);
+ MD5_ROUND2_OP(a,b,c,d,13,5,0xA9E3E905);
+ MD5_ROUND2_OP(d,a,b,c,2,9,0xFCEFA3F8);
+ MD5_ROUND2_OP(c,d,a,b,7,14,0x676F02D9);
+ MD5_ROUND2_OP(b,c,d,a,12,20,0x8D2A4C8A);
+
+ MD5_ROUND3_OP(a,b,c,d,5,4,0xFFFA3942);
+ MD5_ROUND3_OP(d,a,b,c,8,11,0x8771F681);
+ MD5_ROUND3_OP(c,d,a,b,11,16,0x6D9D6122);
+ MD5_ROUND3_OP(b,c,d,a,14,23,0xFDE5380C);
+ MD5_ROUND3_OP(a,b,c,d,1,4,0xA4BEEA44);
+ MD5_ROUND3_OP(d,a,b,c,4,11,0x4BDECFA9);
+ MD5_ROUND3_OP(c,d,a,b,7,16,0xF6BB4B60);
+ MD5_ROUND3_OP(b,c,d,a,10,23,0xBEBFBC70);
+ MD5_ROUND3_OP(a,b,c,d,13,4,0x289B7EC6);
+ MD5_ROUND3_OP(d,a,b,c,0,11,0xEAA127FA);
+ MD5_ROUND3_OP(c,d,a,b,3,16,0xD4EF3085);
+ MD5_ROUND3_OP(b,c,d,a,6,23,0x04881D05);
+ MD5_ROUND3_OP(a,b,c,d,9,4,0xD9D4D039);
+ MD5_ROUND3_OP(d,a,b,c,12,11,0xE6DB99E5);
+ MD5_ROUND3_OP(c,d,a,b,15,16,0x1FA27CF8);
+ MD5_ROUND3_OP(b,c,d,a,2,23,0xC4AC5665);
+
+ MD5_ROUND4_OP(a,b,c,d,0,6,0xF4292244);
+ MD5_ROUND4_OP(d,a,b,c,7,10,0x432AFF97);
+ MD5_ROUND4_OP(c,d,a,b,14,15,0xAB9423A7);
+ MD5_ROUND4_OP(b,c,d,a,5,21,0xFC93A039);
+ MD5_ROUND4_OP(a,b,c,d,12,6,0x655B59C3);
+ MD5_ROUND4_OP(d,a,b,c,3,10,0x8F0CCC92);
+ MD5_ROUND4_OP(c,d,a,b,10,15,0xFFEFF47D);
+ MD5_ROUND4_OP(b,c,d,a,1,21,0x85845DD1);
+ MD5_ROUND4_OP(a,b,c,d,8,6,0x6FA87E4F);
+ MD5_ROUND4_OP(d,a,b,c,15,10,0xFE2CE6E0);
+ MD5_ROUND4_OP(c,d,a,b,6,15,0xA3014314);
+ MD5_ROUND4_OP(b,c,d,a,13,21,0x4E0811A1);
+ MD5_ROUND4_OP(a,b,c,d,4,6,0xF7537E82);
+ MD5_ROUND4_OP(d,a,b,c,11,10,0xBD3AF235);
+ MD5_ROUND4_OP(c,d,a,b,2,15,0x2AD7D2BB);
+ MD5_ROUND4_OP(b,c,d,a,9,21,0xEB86D391);
+
+ abcd0 += a;
+ abcd1 += b;
+ abcd2 += c;
+ abcd3 += d;
+}
+
+/* Note: Little Endian is used */
+static void uint32_to_uchar (_pSLuint32_Type *u, unsigned int num, unsigned char *buf)
+{
+ unsigned short t = 0xFF;
+ unsigned int i;
+
+ if (*(unsigned char *)&t == 0xFF)
+ {
+	memcpy ((char *)buf, (char *)u, num*4);
+	return;
+ }
+
+ for (i = 0; i < num; i++)
+ {
+	_pSLuint32_Type x = ui;
+	buf0 = (unsigned char) (x & 0xFF);
+	buf1 = (unsigned char) ((x>>8) & 0xFF);
+	buf2 = (unsigned char) ((x>>16) & 0xFF);
+	buf3 = (unsigned char) ((x>>24) & 0xFF);
+	buf += 4;
+ }
+}
+
+static void uchar_to_uint32 (unsigned char *buf, unsigned int len, _pSLuint32_Type *u)
+{
+ unsigned short x = 0xFF;
+ unsigned char *bufmax;
+
+ if (*(unsigned char *)&x == 0xFF)
+ {
+	memcpy ((char *)u, buf, len);
+	return;
+ }
+
+ bufmax = buf + len;
+ while (buf < bufmax)
+ {
+	*u++ = (((_pSLuint32_Type)buf0) | ((_pSLuint32_Type)buf1<<8)
+		| ((_pSLuint32_Type)buf2<<16) | ((_pSLuint32_Type)buf3<<24));
+	buf += 4;
+ }
+}
+
+static void process_64_byte_block (unsigned char *buf, _pSLuint32_Type abcd4)
+{
+ _pSLuint32_Type block16;
+
+ uchar_to_uint32 (buf, 64, block);
+ process_block (block, abcd);
+}
+
+static void update_num_bits (SLChksum_Type *md5, unsigned int dnum_bits)
+{
+ _pSLuint32_Type d, lo, hi;
+
+ d = (_pSLuint32_Type)dnum_bits << 3;
+ lo = md5->num_bits0;
+ hi = md5->num_bits1;
+
+ d += lo;
+ if (d < lo)
+ hi++; /* overflow */
+ hi += (_pSLuint32_Type)dnum_bits >> 29;
+ lo = d;
+
+ md5->num_bits0 = lo;
+ md5->num_bits1 = hi;
+}
+
+static int md5_accumulate (SLChksum_Type *md5, unsigned char *buf, unsigned int buflen)
+{
+ unsigned int num_buffered;
+ unsigned char *bufmax;
+
+ if ((md5 == NULL) || (buf == NULL))
+ return -1;
+
+ update_num_bits (md5, buflen);
+
+ num_buffered = md5->num_buffered;
+
+ if (num_buffered)
+ {
+	unsigned int dlen = MD5_BUFSIZE - md5->num_buffered;
+
+	if (buflen < dlen)
+	 dlen = buflen;
+
+	memcpy (md5->buf+num_buffered, buf, dlen);
+	num_buffered += dlen;
+	buflen -= dlen;
+	buf += dlen;
+
+	if (num_buffered < MD5_BUFSIZE)
+	 {
+	 md5->num_buffered = num_buffered;
+	 return 0;
+	 }
+
+	process_64_byte_block (md5->buf, md5->abcd);
+	num_buffered = 0;
+ }
+
+ num_buffered = buflen % MD5_BUFSIZE;
+ bufmax = buf + (buflen - num_buffered);
+ while (buf < bufmax)
+ {
+	process_64_byte_block (buf, md5->abcd);
+	buf += MD5_BUFSIZE;
+ }
+
+ if (num_buffered)
+ memcpy (md5->buf, bufmax, num_buffered);
+
+ md5->num_buffered = num_buffered;
+
+ return 0;
+}
+
+static int md5_close (SLChksum_Type *md5, unsigned char *digest)
+{
+ unsigned char num_bits_buf8;
+
+ if (md5 == NULL)
+ return -1;
+
+ if (digest != NULL)
+ {
+	/* Handle num bits before padding */
+	uint32_to_uchar (md5->num_bits, 2, num_bits_buf);
+
+	/* Add pad and num_bits bytes */
+	(void) md5_accumulate (md5, Pad_Bytes, compute_pad_length (md5->num_buffered));
+	(void) md5_accumulate (md5, num_bits_buf, 8);
+	uint32_to_uchar (md5->abcd, 4, digest);
+ }
+
+ SLfree ((char *)md5);
+ return 0;
+}
+
+SLChksum_Type *_pSLchksum_md5_new (char *name)
+{
+ SLChksum_Type *md5;
+ (void) name;
+
+ if (NULL == (md5 = (SLChksum_Type *) SLmalloc (sizeof(SLChksum_Type))))
+ return NULL;
+ memset ((char *)md5, 0, sizeof (SLChksum_Type));
+ md5->accumulate = md5_accumulate;
+ md5->close = md5_close;
+ md5->digest_len = MD5_DIGEST_LEN;
+ init_md5_buffer (md5->abcd);
+
+ return md5;
+}
+
+#if 0
+int main ()
+{
+ SLChksum_Type *md5;
+ unsigned int i;
+ unsigned char buf1024;
+ unsigned int len;
+ unsigned char *digest;
+
+ if (NULL == (md5 = _pSLchksum_md5_new ("md5")))
+ return 1;
+
+ while (0 != (len = fread (buf, 1, sizeof (buf), stdin)))
+ (void) md5->accumulate (md5, buf, len);
+
+ if (NULL == (digest = (unsigned char *)SLmalloc (md5->digest_len)))
+ return 1;
+
+ md5->close (md5, digest);
+
+ for (i = 0; i < 16; i++)
+ fprintf (stdout, "%02x", digesti);
+ fputs ("\n", stdout);
+ SLfree ((char *)digest);
+
+ return 0;
+}
+#endif
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/chksum_sha1.c Added

@@ -0,0 +1,351 @@
+/*
+Copyright (C) 2014-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include "config.h"
+#include <string.h>
+#include <limits.h>
+#include <slang.h>
+
+#include "_slint.h"
+
+#define SHA1_BUFSIZE	64
+#define SHA1_DIGEST_LEN	20
+#define CHKSUM_TYPE_PRIVATE_FIELDS \
+ _pSLuint32_Type h5; \
+ _pSLuint32_Type num_bits2;		 /* 64 bit representation */ \
+ unsigned int num_buffered; \
+ unsigned char bufSHA1_BUFSIZE;
+
+#include "chksum.h"
+
+/* 8 bit bytes assumed in what follows. The algorithm is based upon
+ * <http://www.itl.nist.gov/fipspubs/fip180-1.htm>
+ *
+ * The algorithm there resembles that of RFC1321, which defines the
+ * MD5 checksum. The notes that follow have been adapted from my
+ * md5sum code.
+ */
+
+/*
+ The message is "padded" (extended) so that its length (in bits) is
+ congruent to 448, modulo 512. That is, the message is extended so
+ that it is just 64 bits shy of being a multiple of 512 bits long.
+ Padding is always performed, even if the length of the message is
+ already congruent to 448, modulo 512.
+*/
+static unsigned int compute_pad_length (unsigned int len)
+{
+ unsigned int mod64 = len % 64;
+ unsigned int dlen;
+
+ if (mod64 < 56)
+ dlen = 56 - mod64;
+ else
+ dlen = 120 - mod64;
+
+ return dlen;
+}
+
+/* Padding is performed as follows: a single "1" bit is appended to the
+ * message, and then "0" bits are appended so that the length in bits
+ * of the padded message becomes congruent to 448, modulo 512. In
+ * all, at least one bit and at most 512 bits are appended.
+ *
+ * A 64-bit representation of b (the length of the message before the
+ * padding bits were added) is appended to the result of the previous
+ * step. In the unlikely event that b is greater than 2^64, then only
+ * the low-order 64 bits of b are used. (These bits are appended as two
+ * 32-bit words and appended low-order word first in accordance with the
+ * previous conventions.)
+ *
+ * At this point the resulting message (after padding with bits and with
+ * b) has a length that is an exact multiple of 512 bits. Equivalently,
+ * this message has a length that is an exact multiple of 16 (32-bit)
+ * words. Let M0 ... N-1 denote the words of the resulting message,
+ * where N is a multiple of 16.
+ */
+static unsigned char Pad_Bytes64 =
+{
+ 0x80, 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, 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
+};
+
+/*
+ * The message digest is computed using the final padded message. The
+ * computation uses two buffers, each consisting of five 32-bit
+ * words, and a sequence of eighty 32-bit words. The words of the
+ * first 5-word buffer are labeled A,B,C,D,E. The words of the second
+ * 5-word buffer are labeled H0, H1, H2, H3, H4. The words of the
+ * 80-word sequence are labeled W0, W1,..., W79. A single word buffer
+ * TEMP is also employed.
+ */
+
+/* Initialization
+ *
+ * A four-word buffer (A,B,C,D) is used to compute the message digest.
+ * Here each of A, B, C, D is a 32-bit register. These registers are
+ * initialized to the following values in hexadecimal.
+ */
+
+static _pSLuint32_Type overflow_add (_pSLuint32_Type a, _pSLuint32_Type b, _pSLuint32_Type *c)
+{
+ _pSLuint32_Type b1 = UINT_MAX - b;
+ if (a <= b1)
+ {
+	*c = 0;
+	return a+b;
+ }
+ *c = 1;
+ return (a - b1) - 1;
+}
+
+static int update_num_bits (SLChksum_Type *sha1, unsigned int dnum_bits)
+{
+ _pSLuint32_Type lo, hi, c, d;
+
+ d = (_pSLuint32_Type)dnum_bits << 3;
+ hi = sha1->num_bits0;
+ lo = sha1->num_bits1;
+
+ lo = overflow_add (lo, d, &c);
+ if (c)
+ {
+	hi = overflow_add (hi, c, &c);
+	if (c)
+	 return -1;
+ }
+ hi = overflow_add (hi, dnum_bits >> 29, &c);
+ if (c)
+ return -1;
+
+ sha1->num_bits0 = hi;
+ sha1->num_bits1 = lo;
+ return 0;
+}
+
+#define F_00_19(B,C,D) (((B) & (C)) | (~(B) & (D)))
+#define F_20_39(B,C,D) ((B)^(C)^(D))
+#define F_40_59(B,C,D) (((B)&(C)) | ((B)&(D)) | ((C)&(D)))
+#define F_60_79(B,C,D) ((B)^(C)^(D))
+#define K_00_19 0x5A827999
+#define K_20_39 0x6ED9EBA1
+#define K_40_59 0x8F1BBCDC
+#define K_60_79 0xCA62C1D6
+#define CSHIFT(n,X) (((X) << (n)) | ((X) >> (32-(n))))
+#define MAKE_WORD(b) \
+ ((((_pSLuint32_Type)(b0))<<24) | (((_pSLuint32_Type)(b1))<<16) \
+ | (((_pSLuint32_Type)(b2))<<8) | ((_pSLuint32_Type)(b3)))
+
+static int sha1_process_block (SLChksum_Type *sha1, unsigned char *buf)
+{
+ _pSLuint32_Type a, b, c, d, e;
+ _pSLuint32_Type w80;
+ unsigned int t;
+
+ for (t = 0; t < 16; t++)
+ {
+	wt = MAKE_WORD(buf);
+	buf += 4;
+ }
+ for (t = 16; t < 80; t++)
+ {
+	_pSLuint32_Type x = wt-3 ^ wt-8 ^ wt-14 ^ wt-16;
+	wt = CSHIFT(1, x);
+ }
+
+ a = sha1->h0; b = sha1->h1; c = sha1->h2; d = sha1->h3; e = sha1->h4;
+
+ for (t = 0; t < 20; t++)
+ {
+	_pSLuint32_Type tmp;
+	tmp = CSHIFT(5,a) + F_00_19(b,c,d) + e + wt + K_00_19;
+	e = d; d = c; c = CSHIFT(30,b); b = a; a = tmp;
+ }
+ for (t = 20; t < 40; t++)
+ {
+	_pSLuint32_Type tmp;
+	tmp = CSHIFT(5,a) + F_20_39(b,c,d) + e + wt + K_20_39;
+	e = d; d = c; c = CSHIFT(30,b); b = a; a = tmp;
+ }
+ for (t = 40; t < 60; t++)
+ {
+	_pSLuint32_Type tmp;
+	tmp = CSHIFT(5,a) + F_40_59(b,c,d) + e + wt + K_40_59;
+	e = d; d = c; c = CSHIFT(30,b); b = a; a = tmp;
+ }
+ for (t = 60; t < 80; t++)
+ {
+	_pSLuint32_Type tmp;
+	tmp = CSHIFT(5,a) + F_60_79(b,c,d) + e + wt + K_60_79;
+	e = d; d = c; c = CSHIFT(30,b); b = a; a = tmp;
+ }
+
+ sha1->h0 += a; sha1->h1 += b; sha1->h2 += c; sha1->h3 += d; sha1->h4 += e;
+
+ return 0;
+}
+
+static int sha1_accumulate (SLChksum_Type *sha1, unsigned char *buf, unsigned int buflen)
+{
+ unsigned int num_buffered;
+ unsigned char *bufmax;
+
+ if ((sha1 == NULL) || (buf == NULL))
+ return -1;
+
+ update_num_bits (sha1, buflen);
+
+ num_buffered = sha1->num_buffered;
+
+ if (num_buffered)
+ {
+	unsigned int dlen = SHA1_BUFSIZE - sha1->num_buffered;
+
+	if (buflen < dlen)
+	 dlen = buflen;
+
+	memcpy (sha1->buf+num_buffered, buf, dlen);
+	num_buffered += dlen;
+	buflen -= dlen;
+	buf += dlen;
+
+	if (num_buffered < SHA1_BUFSIZE)
+	 {
+	 sha1->num_buffered = num_buffered;
+	 return 0;
+	 }
+
+	sha1_process_block (sha1, sha1->buf);
+	num_buffered = 0;
+ }
+
+ num_buffered = buflen % SHA1_BUFSIZE;
+ bufmax = buf + (buflen - num_buffered);
+ while (buf < bufmax)
+ {
+	sha1_process_block (sha1, buf);
+	buf += SHA1_BUFSIZE;
+ }
+
+ if (num_buffered)
+ memcpy (sha1->buf, bufmax, num_buffered);
+
+ sha1->num_buffered = num_buffered;
+
+ return 0;
+}
+
+static void uint32_to_uchar (_pSLuint32_Type *u, unsigned int num, unsigned char *buf)
+{
+ unsigned int i;
+
+ for (i = 0; i < num; i++)
+ {
+	_pSLuint32_Type x = ui;
+	buf3 = (unsigned char) (x & 0xFF);
+	buf2 = (unsigned char) ((x>>8) & 0xFF);
+	buf1 = (unsigned char) ((x>>16) & 0xFF);
+	buf0 = (unsigned char) ((x>>24) & 0xFF);
+	buf += 4;
+ }
+}
+
+static int sha1_close (SLChksum_Type *sha1, unsigned char *digest)
+{
+ unsigned char num_bits_buf8;
+
+ if (sha1 == NULL)
+ return -1;
+
+ if (digest != NULL)
+ {
+	/* Handle num bits before padding */
+	uint32_to_uchar (sha1->num_bits, 2, num_bits_buf);
+
+	/* Add pad and num_bits bytes */
+	(void) sha1_accumulate (sha1, Pad_Bytes, compute_pad_length (sha1->num_buffered));
+	(void) sha1_accumulate (sha1, num_bits_buf, 8);
+	uint32_to_uchar (sha1->h, 5, digest);
+ }
+
+ SLfree ((char *)sha1);
+ return 0;
+}
+
+SLChksum_Type *_pSLchksum_sha1_new (char *name)
+{
+ SLChksum_Type *sha1;
+
+ (void) name;
+ sha1 = (SLChksum_Type *)SLmalloc (sizeof (SLChksum_Type));
+ if (sha1 == NULL)
+ return NULL;
+ memset ((char *)sha1, 0, sizeof (SLChksum_Type));
+
+ sha1->accumulate = sha1_accumulate;
+ sha1->close = sha1_close;
+ sha1->digest_len = SHA1_DIGEST_LEN;
+
+ sha1->h0 = 0x67452301;
+ sha1->h1 = 0xEFCDAB89;
+ sha1->h2 = 0x98BADCFE;
+ sha1->h3 = 0x10325476;
+ sha1->h4 = 0xC3D2E1F0;
+
+ return sha1;
+}
+
+#if 0
+int main (int argc, char **argv)
+{
+ SLChksum_Type *sha1;
+ unsigned int i;
+ unsigned char buf1024;
+ unsigned int len;
+ unsigned char digestSHA1_DIGEST_LEN;
+ char *s;
+
+ if (NULL == (sha1 = sha1_open ()))
+ return 1;
+#if 0
+ while (0 != (len = fread (buf, 1, sizeof (buf), stdin)))
+ (void) sha1_accumulate (sha1, buf, len);
+#else
+ for (i = 0; i < 1000000; i++)
+ {
+	s = "a";
+	(void) sha1_accumulate (sha1, s, strlen(s));
+ }
+#endif
+ sha1_close (sha1, digest);
+
+ for (i = 0; i < 20; i++)
+ fprintf (stdout, "%02x", digesti);
+
+ fputs ("\n", stdout);
+ return 0;
+}
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/cool.map Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/coolwarm.map Added

@@ -0,0 +1,43 @@
+% -*- slang -*-
+% This map was adapted from a Kenneth Moreland's CSV table at
+% <http://www.cs.unm.edu/~kmorel/documents/ColorMaps/index.html>,
+% 
+
+$1 =
+
+ 0x3B4CC0,0x3C4EC2,0x3D50C3,0x3E51C5,0x3F53C6,0x4055C8,0x4257C9,0x4358CB,
+ 0x445ACC,0x455CCE,0x465DCF,0x475FD1,0x4961D2,0x4A63D3,0x4B64D5,0x4C66D6,
+ 0x4D68D7,0x4F69D9,0x506BDA,0x516DDB,0x526EDD,0x5470DE,0x5572DF,0x5673E0,
+ 0x5775E1,0x5977E2,0x5A78E4,0x5B7AE5,0x5D7BE6,0x5E7DE7,0x5F7FE8,0x6080E9,
+ 0x6282EA,0x6383EB,0x6485EC,0x6687ED,0x6788EE,0x688AEF,0x6A8BEF,0x6B8DF0,
+ 0x6C8EF1,0x6E90F2,0x6F91F3,0x7093F3,0x7294F4,0x7396F5,0x7497F6,0x7699F6,
+ 0x779AF7,0x789CF7,0x7A9DF8,0x7B9EF9,0x7CA0F9,0x7EA1FA,0x7FA3FA,0x81A4FB,
+ 0x82A5FB,0x83A7FC,0x85A8FC,0x86A9FC,0x87ABFD,0x89ACFD,0x8AADFD,0x8CAEFE,
+ 0x8DB0FE,0x8EB1FE,0x90B2FE,0x91B3FE,0x93B5FF,0x94B6FF,0x95B7FF,0x97B8FF,
+ 0x98B9FF,0x99BAFF,0x9BBBFF,0x9CBCFF,0x9EBEFF,0x9FBFFF,0xA0C0FF,0xA2C1FF,
+ 0xA3C2FF,0xA4C3FE,0xA6C4FE,0xA7C5FE,0xA8C6FE,0xAAC7FD,0xABC7FD,0xACC8FD,
+ 0xAEC9FD,0xAFCAFC,0xB0CBFC,0xB2CCFB,0xB3CDFB,0xB4CDFB,0xB6CEFA,0xB7CFFA,
+ 0xB8D0F9,0xB9D0F8,0xBBD1F8,0xBCD2F7,0xBDD2F7,0xBED3F6,0xC0D4F5,0xC1D4F5,
+ 0xC2D5F4,0xC3D5F3,0xC5D6F3,0xC6D6F2,0xC7D7F1,0xC8D7F0,0xC9D8EF,0xCBD8EE,
+ 0xCCD9EE,0xCDD9ED,0xCED9EC,0xCFDAEB,0xD0DAEA,0xD1DBE9,0xD2DBE8,0xD3DBE7,
+ 0xD5DBE6,0xD6DCE5,0xD7DCE4,0xD8DCE3,0xD9DCE1,0xDADCE0,0xDBDCDF,0xDCDDDE,
+ 0xDDDDDD,0xDEDCDB,0xDFDCDA,0xE0DBD8,0xE1DBD7,0xE2DAD6,0xE3DAD4,0xE4D9D3,
+ 0xE5D8D1,0xE6D8D0,0xE7D7CE,0xE8D7CD,0xE8D6CB,0xE9D5CA,0xEAD4C8,0xEBD4C7,
+ 0xECD3C5,0xECD2C4,0xEDD1C2,0xEED1C1,0xEED0BF,0xEFCFBE,0xF0CEBC,0xF0CDBB,
+ 0xF1CCB9,0xF1CBB8,0xF2CAB6,0xF2C9B5,0xF3C8B3,0xF3C7B2,0xF4C6B0,0xF4C5AE,
+ 0xF5C4AD,0xF5C3AB,0xF5C2AA,0xF5C1A8,0xF6C0A7,0xF6BFA5,0xF6BEA3,0xF6BCA2,
+ 0xF7BBA0,0xF7BA9F,0xF7B99D,0xF7B89C,0xF7B69A,0xF7B598,0xF7B497,0xF7B295,
+ 0xF7B194,0xF7B092,0xF7AE91,0xF7AD8F,0xF7AC8D,0xF7AA8C,0xF7A98A,0xF7A789,
+ 0xF7A687,0xF6A486,0xF6A384,0xF6A183,0xF6A081,0xF59E7F,0xF59D7E,0xF59B7C,
+ 0xF49A7B,0xF49879,0xF49778,0xF39576,0xF39375,0xF29273,0xF29072,0xF18E70,
+ 0xF18D6F,0xF08B6D,0xF0896C,0xEF886A,0xEE8669,0xEE8467,0xED8266,0xEC8164,
+ 0xEC7F63,0xEB7D61,0xEA7B60,0xE9795F,0xE9785D,0xE8765C,0xE7745A,0xE67259,
+ 0xE57058,0xE46E56,0xE36C55,0xE36A53,0xE26852,0xE16651,0xE0644F,0xDF624E,
+ 0xDE604D,0xDD5E4B,0xDC5C4A,0xDA5A49,0xD95847,0xD85646,0xD75445,0xD65243,
+ 0xD55042,0xD44E41,0xD24B40,0xD1493E,0xD0473D,0xCF453C,0xCD423B,0xCC4039,
+ 0xCB3E38,0xCA3B37,0xC83936,0xC73635,0xC63334,0xC43132,0xC32E31,0xC12B30,
+ 0xC0282F,0xBE252E,0xBD222D,0xBC1E2C,0xBA1A2B,0xB91629,0xB71128,0xB50B27,
+ 0xB40426,
+;
+
+png_add_colormap ("coolwarm", __tmp($1));

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/copper.map Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/cubicl.map Added

@@ -0,0 +1,41 @@
+% -*- slang -*-
+% This map was derived from a table of numbers from maplab code by Matteo
+% Niccoli, distributed under the BSD license.
+
+$1 =
+
+  0x780085,0x790088,0x7A008B,0x7B008E,0x7B0091,0x7C0093,0x7D0196,0x7E0199,
+  0x7E029C,0x7F029F,0x8003A2,0x8004A5,0x8105A7,0x8206AA,0x8208AD,0x8209B0,
+  0x830BB2,0x830DB5,0x830FB8,0x8312BB,0x8314BD,0x8317C0,0x831AC2,0x831DC5,
+  0x8320C8,0x8323CA,0x8227CD,0x822ACF,0x822DD2,0x8130D4,0x8134D7,0x8037D9,
+  0x7F3ADB,0x7F3DDE,0x7E40E0,0x7D42E3,0x7C45E5,0x7C47E7,0x7B4AEA,0x7A4CEC,
+  0x794EEE,0x7850F0,0x7752F2,0x7654F4,0x7556F5,0x7457F7,0x7359F9,0x725BFA,
+  0x715DFB,0x705FFC,0x6E60FD,0x6D62FE,0x6C64FE,0x6C66FE,0x6B68FE,0x6A6AFE,
+  0x696CFE,0x686EFE,0x6770FD,0x6672FC,0x6574FC,0x6476FB,0x6378FA,0x627AF9,
+  0x627CF8,0x617EF6,0x6080F5,0x5F82F4,0x5E84F3,0x5D86F1,0x5C87F0,0x5B89EF,
+  0x5A8BED,0x598CEC,0x588EEA,0x578FE9,0x5691E8,0x5592E6,0x5494E5,0x5395E3,
+  0x5297E2,0x5198E0,0x4F9ADE,0x4E9BDD,0x4D9DDB,0x4B9ED9,0x4A9FD8,0x48A1D6,
+  0x47A2D4,0x46A4D2,0x44A5D1,0x43A7CF,0x41A8CD,0x40AACB,0x3EABC9,0x3DADC7,
+  0x3CAEC5,0x3BAFC3,0x3AB1C1,0x39B2BF,0x39B4BD,0x38B5BB,0x38B6B8,0x38B7B6,
+  0x38B9B4,0x38BAB2,0x38BBB0,0x39BCAE,0x39BDAB,0x3ABEA9,0x3BBFA7,0x3BC0A5,
+  0x3CC1A2,0x3DC2A0,0x3EC39E,0x3FC49C,0x40C599,0x41C697,0x42C795,0x43C893,
+  0x44C991,0x45CA8E,0x46CB8C,0x47CC8A,0x47CC88,0x48CD86,0x49CE84,0x4ACF81,
+  0x4AD07F,0x4BD17D,0x4CD17B,0x4CD278,0x4DD376,0x4DD474,0x4ED571,0x4ED56F,
+  0x4FD66C,0x4FD76A,0x50D867,0x50D965,0x51DA62,0x51DA5F,0x52DB5D,0x52DC5A,
+  0x53DD58,0x53DE56,0x54DF53,0x55DF51,0x56E04F,0x57E14E,0x58E24C,0x59E24B,
+  0x5BE34A,0x5CE449,0x5EE448,0x60E548,0x62E647,0x64E647,0x66E747,0x68E748,
+  0x6BE848,0x6DE849,0x6FE949,0x72E94A,0x75EA4B,0x77EA4C,0x7AEA4C,0x7DEB4D,
+  0x7FEB4E,0x82EB4F,0x85EB50,0x87EB51,0x8AEC51,0x8CEC52,0x8FEC52,0x92EC53,
+  0x94EC53,0x96EC54,0x99EC54,0x9BEC54,0x9EEC55,0xA0EC55,0xA2EC55,0xA5EC55,
+  0xA7EC56,0xA9EC56,0xABEC56,0xAEEC56,0xB0ED56,0xB2ED57,0xB4ED57,0xB6ED57,
+  0xB8ED57,0xBAED58,0xBCEE58,0xBEEE58,0xC0EE58,0xC1EE58,0xC3EE59,0xC5EE59,
+  0xC6EE59,0xC8ED59,0xCAED59,0xCBED5A,0xCCEC5A,0xCEEC5A,0xCFEB5A,0xD0EB5A,
+  0xD1EA5A,0xD2E95B,0xD3E85B,0xD4E75B,0xD5E65B,0xD6E55B,0xD7E45B,0xD8E25B,
+  0xD9E15B,0xDAE05B,0xDBDE5B,0xDCDD5C,0xDDDC5C,0xDEDA5C,0xE0D95C,0xE1D85C,
+  0xE2D65C,0xE3D55C,0xE5D35D,0xE6D25D,0xE7D05D,0xE9CF5D,0xEACD5D,0xEBCB5D,
+  0xEDCA5E,0xEEC85E,0xEFC65E,0xF0C45E,0xF1C35E,0xF2C15E,0xF3BF5E,0xF4BD5E,
+  0xF5BA5E,0xF5B85E,0xF6B65E,0xF6B45D,0xF7B25D,0xF7AF5D,0xF8AD5D,0xF8AA5D,
+  0xF8A85D,0xF9A55C,0xF9A35C,0xF9A05C,0xF99E5C,0xF99B5B,0xF9995B,0xF9965B,
+;
+
+png_add_colormap ("cubicl", __tmp($1));

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/cubicyf.map Added

@@ -0,0 +1,41 @@
+% -*- slang -*-
+% This map was derived from a table of numbers from maplab code by Matteo
+% Niccoli, distributed under the BSD license.
+
+$1 =
+
+  0x830CAB,0x830EAD,0x8410AF,0x8412B1,0x8414B3,0x8415B5,0x8417B7,0x8419BA,
+  0x841BBC,0x841DBE,0x841FC0,0x8421C2,0x8423C4,0x8425C6,0x8427C8,0x8429CA,
+  0x852BCC,0x852DCE,0x842ED0,0x8430D2,0x8332D4,0x8334D5,0x8235D7,0x8237D9,
+  0x8139DB,0x813ADC,0x803CDE,0x803EE0,0x7F40E1,0x7F41E3,0x7E43E5,0x7E45E7,
+  0x7D47E8,0x7D48EA,0x7D4AEC,0x7C4BED,0x7B4DEE,0x7A4EEF,0x7950F0,0x7851F1,
+  0x7753F2,0x7654F3,0x7555F4,0x7557F5,0x7458F6,0x735AF7,0x725BF8,0x715DF9,
+  0x705EFA,0x6F5FFB,0x6E61FC,0x6E62FD,0x6D64FD,0x6C65FD,0x6C66FD,0x6B68FD,
+  0x6A69FC,0x6A6BFC,0x696CFC,0x696DFC,0x686FFB,0x6770FB,0x6772FB,0x6673FB,
+  0x6675FB,0x6576FA,0x6477FA,0x6479FA,0x637AFA,0x627BF9,0x617DF8,0x617EF6,
+  0x607FF5,0x5F81F4,0x5E82F3,0x5D83F2,0x5C85F1,0x5C86F0,0x5B87EF,0x5A88EE,
+  0x598AED,0x588BEC,0x578CEB,0x578EE9,0x568FE8,0x5590E7,0x5491E6,0x5392E5,
+  0x5294E4,0x5295E3,0x5196E2,0x5097E0,0x4F98DF,0x4E99DE,0x4E9BDD,0x4D9CDC,
+  0x4C9DDB,0x4B9ED9,0x4A9FD8,0x4AA0D7,0x49A2D6,0x48A3D5,0x47A4D4,0x46A5D2,
+  0x45A6D1,0x44A7CF,0x44A8CD,0x43A9CC,0x42AACA,0x41ABC9,0x40ACC7,0x3FADC6,
+  0x3EAEC4,0x3DAFC3,0x3CB1C1,0x3CB2C0,0x3BB3BE,0x3AB4BC,0x39B5BB,0x38B6B9,
+  0x38B7B8,0x39B7B6,0x39B8B5,0x3AB9B3,0x3ABAB2,0x3ABAB0,0x3BBBAF,0x3BBCAD,
+  0x3CBCAC,0x3CBDAA,0x3CBEA9,0x3DBFA7,0x3DBFA6,0x3EC0A4,0x3EC1A2,0x3EC2A1,
+  0x3FC29F,0x3FC39E,0x40C49C,0x40C59A,0x41C598,0x41C697,0x42C795,0x43C893,
+  0x43C991,0x44C98F,0x44CA8E,0x45CB8C,0x45CC8A,0x46CC88,0x46CD87,0x47CE85,
+  0x47CF83,0x48CF81,0x49D080,0x49D17E,0x4AD17C,0x4AD27B,0x4BD279,0x4BD377,
+  0x4CD376,0x4CD474,0x4DD472,0x4ED571,0x4ED66F,0x4FD66D,0x4FD76B,0x50D76A,
+  0x50D868,0x51D866,0x51D965,0x52DA63,0x53DA62,0x53DB60,0x54DB5F,0x54DC5D,
+  0x55DD5B,0x56DD5A,0x56DE58,0x57DE57,0x57DF55,0x58E054,0x59E052,0x59E150,
+  0x5AE14F,0x5AE24D,0x5BE34C,0x5CE34A,0x5DE44A,0x5FE44B,0x60E44B,0x62E54B,
+  0x63E54B,0x64E54B,0x66E64B,0x67E64B,0x69E64C,0x6AE74C,0x6CE74C,0x6DE84C,
+  0x6FE84C,0x70E84C,0x72E94C,0x73E94D,0x74E94D,0x77EA4D,0x79EA4E,0x7BEA4E,
+  0x7DEA4E,0x7FEA4F,0x82EA4F,0x84EB50,0x86EB50,0x88EB51,0x8BEB51,0x8DEB51,
+  0x8FEC52,0x91EC52,0x93EC53,0x96EC53,0x98EC53,0x9AEC54,0x9BEC54,0x9DEC54,
+  0x9FEC54,0xA0EC55,0xA2EC55,0xA3EC55,0xA5EC55,0xA6EC55,0xA8EC55,0xA9EC56,
+  0xABEC56,0xADEC56,0xAEEC56,0xB0EC56,0xB1EC57,0xB3EC57,0xB4EC57,0xB6EC57,
+  0xB7EC57,0xB9EC57,0xBAEC58,0xBBEC58,0xBDEC58,0xBEEC58,0xC0EC58,0xC1EC58,
+  0xC2EC59,0xC4EC59,0xC5EC59,0xC7EC59,0xC8EC59,0xC9EC59,0xCBEC5A,0xCCEC5A,
+;
+
+png_add_colormap ("cubicyf", __tmp($1));

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/drywet.map Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/ds9b.map Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/ds9sls.map Added

@@ -0,0 +1,33 @@
+% -*- slang -*-
+% This color map was derived from SAOTNG ds9's SLS color map.
+
+$1 =
+
+  0x000000,0x0B000D,0x16001B,0x210028,0x2C0036,0x370043,0x420051,0x4D005E,
+  0x58006C,0x640079,0x6F0087,0x7A0094,0x8500A2,0x8100A3,0x7D00A5,0x7A00A6,
+  0x7600A8,0x7200A9,0x6F00AB,0x6B00AC,0x6700AD,0x6300AF,0x6000B0,0x5C00B2,
+  0x5800B3,0x5100B6,0x4900B8,0x4200BB,0x3B00BE,0x3300C0,0x2C00C3,0x2400C5,
+  0x1D00C8,0x1600CB,0x0E00CD,0x0700D0,0x0000D3,0x0005D6,0x000ADA,0x000FDE,
+  0x0014E2,0x0019E5,0x001EE9,0x0023ED,0x0028F1,0x002DF4,0x0032F8,0x0037FC,
+  0x003CFF,0x0044FF,0x004CFF,0x0054FF,0x005CFF,0x0064FF,0x006CFF,0x0073FF,
+  0x007BFF,0x0083FF,0x008BFF,0x0093FF,0x009BFF,0x00A1F9,0x00A8F3,0x00AEED,
+  0x00B5E6,0x00BBE0,0x00C1DA,0x00C8D3,0x00CECD,0x00D5C7,0x00DBC0,0x00E2BA,
+  0x00E8B4,0x00E6AD,0x00E5A6,0x00E39F,0x00E298,0x00E091,0x00DE8A,0x00DD83,
+  0x00DB7C,0x00DA76,0x00D86F,0x00D668,0x00D561,0x00D55A,0x00D454,0x00D44D,
+  0x00D447,0x00D440,0x00D43A,0x00D433,0x00D42C,0x00D426,0x00D41F,0x00D419,
+  0x00D312,0x08D511,0x10D70F,0x19D80D,0x21DA0C,0x2ADB0A,0x32DD09,0x3BDF07,
+  0x43E006,0x4CE204,0x54E303,0x5DE501,0x65E600,0x6EE600,0x76E600,0x7FE600,
+  0x87E600,0x90E600,0x98E600,0xA0E600,0xA9E600,0xB1E600,0xBAE600,0xC2E600,
+  0xCBE600,0xCFE501,0xD3E402,0xD8E303,0xDCE104,0xE1E005,0xE5DF06,0xE9DE07,
+  0xEEDC08,0xF2DB09,0xF7DA0A,0xFBD90B,0xFFD70C,0xFED30D,0xFDCE0E,0xFCC90F,
+  0xFBC410,0xFAC011,0xF9BB12,0xF8B613,0xF7B114,0xF6AC14,0xF5A815,0xF3A316,
+  0xF29E17,0xF39915,0xF59413,0xF69011,0xF78B0F,0xF8860D,0xF9810B,0xFA7C09,
+  0xFB7807,0xFC7305,0xFD6E03,0xFE6901,0xFF6500,0xFF5C00,0xFF5400,0xFE4B00,
+  0xFE4300,0xFD3A00,0xFD3200,0xFD2A00,0xFC2100,0xFC1900,0xFB1000,0xFB0800,
+  0xFA0000,0xF40000,0xEE0000,0xE80000,0xE20000,0xDB0000,0xD50000,0xCF0000,
+  0xC90000,0xC30000,0xBD0000,0xB60000,0xB00000,0xB71515,0xBD2A2A,0xC43F3F,
+  0xCB5555,0xD16A6A,0xD87F7F,0xDE9595,0xE5AAAA,0xECBFBF,0xF2D5D5,0xF9EAEA,
+  0xFFFFFF,0xFFFFFF,0xFFFFFF,0xFFFFFF,0xFFFFFF,0xFFFFFF,0xFFFFFF,0xFFFFFF,
+;
+
+png_add_colormap ("ds9sls", __tmp($1));

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/edge.map Added

@@ -0,0 +1,41 @@
+% -*- slang -*-
+% This map was derived from a table of numbers from maplab code by Matteo
+% Niccoli, distributed under the BSD license.
+
+$1 =
+
+  0x000000,0x000006,0x00000C,0x000012,0x000018,0x00001E,0x000024,0x00002A,
+  0x000030,0x000036,0x00003C,0x000042,0x000048,0x00004E,0x000054,0x00005A,
+  0x000060,0x000066,0x00006C,0x000072,0x000078,0x00007E,0x000084,0x00008A,
+  0x000090,0x000096,0x00009C,0x0000A2,0x0000A8,0x0000AE,0x0000B4,0x0000BA,
+  0x0000C0,0x0000C6,0x0000CC,0x0000D2,0x0000D8,0x0000DE,0x0000E4,0x0000EA,
+  0x0000F0,0x0000F6,0x0000FC,0x0003FF,0x0009FF,0x000FFF,0x0015FF,0x001BFF,
+  0x0021FF,0x0027FF,0x002DFF,0x0033FF,0x0039FF,0x003FFF,0x0045FF,0x004BFF,
+  0x0051FF,0x0057FF,0x005DFF,0x0063FF,0x0069FF,0x006FFF,0x0075FF,0x007BFF,
+  0x0081FF,0x0087FF,0x008DFF,0x0093FF,0x0099FF,0x009FFF,0x00A5FF,0x00ABFF,
+  0x00B1FF,0x00B7FF,0x00BDFF,0x00C3FF,0x00C9FF,0x00CFFF,0x00D5FF,0x00DBFF,
+  0x00E1FF,0x00E7FF,0x00EDFF,0x00F3FF,0x00F9FF,0x00FFFF,0x06FFFF,0x0CFFFF,
+  0x12FFFF,0x18FFFF,0x1EFFFF,0x24FFFF,0x2AFFFF,0x30FFFF,0x36FFFF,0x3CFFFF,
+  0x42FFFF,0x48FFFF,0x4EFFFF,0x54FFFF,0x5AFFFF,0x60FFFF,0x66FFFF,0x6CFFFF,
+  0x72FFFF,0x78FFFF,0x7EFFFF,0x84FFFF,0x8AFFFF,0x90FFFF,0x96FFFF,0x9CFFFF,
+  0xA2FFFF,0xA8FFFF,0xAEFFFF,0xB4FFFF,0xBAFFFF,0xC0FFFF,0xC6FFFF,0xCCFFFF,
+  0xD2FFFF,0xD8FFFF,0xDEFFFF,0xE4FFFF,0xEAFFFF,0xF0FFFF,0xF6FFFF,0xFCFFFF,
+  0xFFFFFC,0xFFFFF6,0xFFFFF0,0xFFFFEA,0xFFFFE4,0xFFFFDE,0xFFFFD8,0xFFFFD2,
+  0xFFFFCC,0xFFFFC6,0xFFFFC0,0xFFFFBA,0xFFFFB4,0xFFFFAE,0xFFFFA8,0xFFFFA2,
+  0xFFFF9C,0xFFFF96,0xFFFF90,0xFFFF8A,0xFFFF84,0xFFFF7E,0xFFFF78,0xFFFF72,
+  0xFFFF6C,0xFFFF66,0xFFFF60,0xFFFF5A,0xFFFF54,0xFFFF4E,0xFFFF48,0xFFFF42,
+  0xFFFF3C,0xFFFF36,0xFFFF30,0xFFFF2A,0xFFFF24,0xFFFF1E,0xFFFF18,0xFFFF12,
+  0xFFFF0C,0xFFFF06,0xFFFF00,0xFFF900,0xFFF300,0xFFED00,0xFFE700,0xFFE100,
+  0xFFDB00,0xFFD500,0xFFCF00,0xFFC900,0xFFC300,0xFFBD00,0xFFB700,0xFFB100,
+  0xFFAB00,0xFFA500,0xFF9F00,0xFF9900,0xFF9300,0xFF8D00,0xFF8700,0xFF8100,
+  0xFF7B00,0xFF7500,0xFF6F00,0xFF6900,0xFF6300,0xFF5D00,0xFF5700,0xFF5100,
+  0xFF4B00,0xFF4500,0xFF3F00,0xFF3900,0xFF3300,0xFF2D00,0xFF2700,0xFF2100,
+  0xFF1B00,0xFF1500,0xFF0F00,0xFF0900,0xFF0300,0xFC0000,0xF60000,0xF00000,
+  0xEA0000,0xE40000,0xDE0000,0xD80000,0xD20000,0xCC0000,0xC60000,0xC00000,
+  0xBA0000,0xB40000,0xAE0000,0xA80000,0xA20000,0x9C0000,0x960000,0x900000,
+  0x8A0000,0x840000,0x7E0000,0x780000,0x720000,0x6C0000,0x660000,0x600000,
+  0x5A0000,0x540000,0x4E0000,0x480000,0x420000,0x3C0000,0x360000,0x300000,
+  0x2A0000,0x240000,0x1E0000,0x180000,0x120000,0x0C0000,0x060000,0x000000,
+;
+
+png_add_colormap ("edge", __tmp($1));

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/gebco.map Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/globe.map Added

@@ -0,0 +1,37 @@
+% -*- slang -*-
+% This color map was derived from GMT_globe.cpt
+% Copyright (c) 1991-2004, P. Wessel & W. H. F. Smith
+$1 = 0x00,0x06,0x99,0x99, 0x06,0x0C,0x99,0x99, 0x0C,0x13,0x99,0x99, 0x13,0x19,0x88,0x88,
+      0x19,0x1F,0x77,0x77, 0x1F,0x26,0x66,0x66, 0x26,0x2C,0x55,0x55, 0x2C,0x33,0x44,0x44,
+      0x33,0x39,0x33,0x33, 0x39,0x3F,0x22,0x22, 0x3F,0x46,0x11,0x11, 0x46,0x4C,0x00,0x00,
+      0x4C,0x53,0x1B,0x1B, 0x53,0x59,0x36,0x36, 0x59,0x5F,0x51,0x51, 0x5F,0x66,0x6C,0x6C,
+      0x66,0x6C,0x86,0x86, 0x6C,0x72,0xA1,0xA1, 0x72,0x79,0xBC,0xBC, 0x79,0x7D,0xD7,0xD7,
+      0x7D,0x7F,0xF1,0xF1, 0x7F,0x81,0x33,0x33, 0x81,0x82,0x33,0xBB, 0x82,0x86,0xBB,0xFF,
+      0x86,0x8C,0xFF,0xF3, 0x8C,0x92,0xF3,0xE6, 0x92,0x99,0xE6,0xD9, 0x99,0x9F,0xD9,0xA8,
+      0x9F,0xA6,0xA8,0xA4, 0xA6,0xAC,0xA4,0xA2, 0xAC,0xB2,0xA2,0x9F, 0xB2,0xB9,0x9F,0x9C,
+      0xB9,0xBF,0x9C,0x99, 0xBF,0xC6,0x99,0xA2, 0xC6,0xCC,0xA2,0xB2, 0xCC,0xD2,0xB2,0xB7,
+      0xD2,0xD9,0xB7,0xC2, 0xD9,0xDF,0xC2,0xCC, 0xDF,0xE5,0xCC,0xE5, 0xE5,0xEC,0xE5,0xF2,
+      0xEC,0xF2,0xF2,0xFF, 0xF2,0xF9,0xFF,0xFF, 0xF9,0xFF,0xFF,0xFF;
+$2 = 0x00,0x06,0x00,0x00, 0x06,0x0C,0x00,0x00, 0x0C,0x13,0x00,0x00, 0x13,0x19,0x11,0x11,
+      0x19,0x1F,0x22,0x22, 0x1F,0x26,0x33,0x33, 0x26,0x2C,0x44,0x44, 0x2C,0x33,0x55,0x55,
+      0x33,0x39,0x66,0x66, 0x39,0x3F,0x77,0x77, 0x3F,0x46,0x88,0x88, 0x46,0x4C,0x99,0x99,
+      0x4C,0x53,0xA4,0xA4, 0x53,0x59,0xAF,0xAF, 0x59,0x5F,0xBA,0xBA, 0x5F,0x66,0xC5,0xC5,
+      0x66,0x6C,0xD0,0xD0, 0x6C,0x72,0xDB,0xDB, 0x72,0x79,0xE6,0xE6, 0x79,0x7D,0xF1,0xF1,
+      0x7D,0x7F,0xFC,0xFC, 0x7F,0x81,0x66,0xCC, 0x81,0x82,0xCC,0xE4, 0x82,0x86,0xE4,0xDC,
+      0x86,0x8C,0xDC,0xCA, 0x8C,0x92,0xCA,0xB8, 0x92,0x99,0xB8,0xA6, 0x99,0x9F,0xA6,0x9A,
+      0x9F,0xA6,0x9A,0x90, 0xA6,0xAC,0x90,0x86, 0xAC,0xB2,0x86,0x7B, 0xB2,0xB9,0x7B,0x71,
+      0xB9,0xBF,0x71,0x66, 0xBF,0xC6,0x66,0x59, 0xC6,0xCC,0x59,0x76, 0xCC,0xD2,0x76,0x93,
+      0xD2,0xD9,0x93,0xB0, 0xD9,0xDF,0xB0,0xCC, 0xDF,0xE5,0xCC,0xE5, 0xE5,0xEC,0xE5,0xF2,
+      0xEC,0xF2,0xF2,0xFF, 0xF2,0xF9,0xFF,0xFF, 0xF9,0xFF,0xFF,0xFF;
+$3 = 0x00,0x06,0xFF,0xFF, 0x06,0x0C,0xFF,0xFF, 0x0C,0x13,0xFF,0xFF, 0x13,0x19,0xFF,0xFF,
+      0x19,0x1F,0xFF,0xFF, 0x1F,0x26,0xFF,0xFF, 0x26,0x2C,0xFF,0xFF, 0x2C,0x33,0xFF,0xFF,
+      0x33,0x39,0xFF,0xFF, 0x39,0x3F,0xFF,0xFF, 0x3F,0x46,0xFF,0xFF, 0x46,0x4C,0xFF,0xFF,
+      0x4C,0x53,0xFF,0xFF, 0x53,0x59,0xFF,0xFF, 0x59,0x5F,0xFF,0xFF, 0x5F,0x66,0xFF,0xFF,
+      0x66,0x6C,0xFF,0xFF, 0x6C,0x72,0xFF,0xFF, 0x72,0x79,0xFF,0xFF, 0x79,0x7D,0xFF,0xFF,
+      0x7D,0x7F,0xFF,0xFF, 0x7F,0x81,0x00,0x66, 0x81,0x82,0x66,0x92, 0x82,0x86,0x92,0xB9,
+      0x86,0x8C,0xB9,0x89, 0x8C,0x92,0x89,0x58, 0x92,0x99,0x58,0x27, 0x99,0x9F,0x27,0x1F,
+      0x9F,0xA6,0x1F,0x19, 0xA6,0xAC,0x19,0x13, 0xAC,0xB2,0x13,0x0D, 0xB2,0xB9,0x0D,0x07,
+      0xB9,0xBF,0x07,0x00, 0xBF,0xC6,0x00,0x59, 0xC6,0xCC,0x59,0x76, 0xCC,0xD2,0x76,0x93,
+      0xD2,0xD9,0x93,0xB0, 0xD9,0xDF,0xB0,0xCC, 0xDF,0xE5,0xCC,0xE5, 0xE5,0xEC,0xE5,0xF2,
+      0xEC,0xF2,0xF2,0xFF, 0xF2,0xF9,0xFF,0xFF, 0xF9,0xFF,0xFF,0xFF;
+png_add_colormap ("globe", png_build_colormap (__tmp($1),__tmp($2),__tmp($3)));

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/gray.map Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/haxby.map Added

@@ -0,0 +1,28 @@
+% -*- slang -*-
+% This color map was derived from GMT_haxby.cpt
+% Copyright (c) 1991-2004, P. Wessel & W. H. F. Smith
+$1 = 0x00,0x07,0x0A,0x0A, 0x07,0x0F,0x28,0x28, 0x0F,0x17,0x14,0x14, 0x17,0x1F,0x00,0x00,
+      0x1F,0x27,0x00,0x00, 0x27,0x2F,0x00,0x00, 0x2F,0x37,0x1A,0x1A, 0x37,0x3F,0x0D,0x0D,
+      0x3F,0x47,0x19,0x19, 0x47,0x4F,0x32,0x32, 0x4F,0x57,0x44,0x44, 0x57,0x5F,0x61,0x61,
+      0x5F,0x67,0x6A,0x6A, 0x67,0x6F,0x7C,0x7C, 0x6F,0x77,0x8A,0x8A, 0x77,0x7F,0xAC,0xAC,
+      0x7F,0x87,0xCD,0xCD, 0x87,0x8F,0xDF,0xDF, 0x8F,0x97,0xF0,0xF0, 0x97,0x9F,0xF7,0xF7,
+      0x9F,0xA7,0xFF,0xFF, 0xA7,0xAF,0xFF,0xFF, 0xAF,0xB7,0xF4,0xF4, 0xB7,0xBF,0xEE,0xEE,
+      0xBF,0xC7,0xFF,0xFF, 0xC7,0xCF,0xFF,0xFF, 0xCF,0xD7,0xFF,0xFF, 0xD7,0xDF,0xF5,0xF5,
+      0xDF,0xE7,0xFF,0xFF, 0xE7,0xEF,0xFF,0xFF, 0xEF,0xF7,0xFF,0xFF, 0xF7,0xFF,0xFF,0xFF;
+$2 = 0x00,0x07,0x00,0x00, 0x07,0x0F,0x00,0x00, 0x0F,0x17,0x05,0x05, 0x17,0x1F,0x0A,0x0A,
+      0x1F,0x27,0x19,0x19, 0x27,0x2F,0x28,0x28, 0x2F,0x37,0x66,0x66, 0x37,0x3F,0x81,0x81,
+      0x3F,0x47,0xAF,0xAF, 0x47,0x4F,0xBE,0xBE, 0x4F,0x57,0xCA,0xCA, 0x57,0x5F,0xE1,0xE1,
+      0x5F,0x67,0xEB,0xEB, 0x67,0x6F,0xEB,0xEB, 0x6F,0x77,0xEC,0xEC, 0x77,0x7F,0xF5,0xF5,
+      0x7F,0x87,0xFF,0xFF, 0x87,0x8F,0xF5,0xF5, 0x8F,0x97,0xEC,0xEC, 0x97,0x9F,0xD7,0xD7,
+      0x9F,0xA7,0xBD,0xBD, 0xA7,0xAF,0xA0,0xA0, 0xAF,0xB7,0x75,0x75, 0xB7,0xBF,0x50,0x50,
+      0xBF,0xC7,0x5A,0x5A, 0xC7,0xCF,0x7C,0x7C, 0xCF,0xD7,0x9E,0x9E, 0xD7,0xDF,0xB3,0xB3,
+      0xDF,0xE7,0xC4,0xC4, 0xE7,0xEF,0xD7,0xD7, 0xEF,0xF7,0xEB,0xEB, 0xF7,0xFF,0xFF,0xFF;
+$3 = 0x00,0x07,0x79,0x79, 0x07,0x0F,0x96,0x96, 0x0F,0x17,0xAF,0xAF, 0x17,0x1F,0xC8,0xC8,
+      0x1F,0x27,0xD4,0xD4, 0x27,0x2F,0xE0,0xE0, 0x2F,0x37,0xF0,0xF0, 0x37,0x3F,0xF8,0xF8,
+      0x3F,0x47,0xFF,0xFF, 0x47,0x4F,0xFF,0xFF, 0x4F,0x57,0xFF,0xFF, 0x57,0x5F,0xF0,0xF0,
+      0x5F,0x67,0xE1,0xE1, 0x67,0x6F,0xC8,0xC8, 0x6F,0x77,0xAE,0xAE, 0x77,0x7F,0xA8,0xA8,
+      0x7F,0x87,0xA2,0xA2, 0x87,0x8F,0x8D,0x8D, 0x8F,0x97,0x79,0x79, 0x97,0x9F,0x68,0x68,
+      0x9F,0xA7,0x57,0x57, 0xA7,0xAF,0x45,0x45, 0xAF,0xB7,0x4B,0x4B, 0xB7,0xBF,0x4E,0x4E,
+      0xBF,0xC7,0x5A,0x5A, 0xC7,0xCF,0x7C,0x7C, 0xCF,0xD7,0x9E,0x9E, 0xD7,0xDF,0xAE,0xAE,
+      0xDF,0xE7,0xC4,0xC4, 0xE7,0xEF,0xD7,0xD7, 0xEF,0xF7,0xEB,0xEB, 0xF7,0xFF,0xFF,0xFF;
+png_add_colormap ("haxby", png_build_colormap (__tmp($1),__tmp($2),__tmp($3)));

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/hot.map Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/jet.map Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/mkcmap.sl Added

@@ -0,0 +1,53 @@
+
+define rgb_to_cmap (r, g, b, file)
+{
+ variable rgb = (r << 16)|(g<<8)|b;
+ variable name = path_basename_sans_extname (file);
+ if (NULL != stat_file (file))
+ throw IOError, sprintf ("File %s exists-- delete it if you want to overwrite", file);
+
+ variable fp = fopen (file, "w");
+ () = fputs (`% -*- slang -*-
+%
+
+$1 =
+`,
+	 fp);
+ _for (0, length(rgb)-1, 1)
+ {
+	variable i = ();
+	if ((i mod 8) == 0)
+	 () = fputs ("\n ", fp);
+	() = fprintf (fp, "0x%06X,", rgbi);
+ }
+ () = fprintf (fp, `
+;
+
+png_add_colormap ("%s", __tmp($1));
+`,
+		 name);
+ () = fclose (fp);
+}
+
+#ifnfalse
+require ("gslinterp");
+require ("readascii");
+private define convert_normalized_color (c, n)
+{
+ variable cx = 0:1:#length(c);
+ variable x = 0:1:#n;
+ variable y = interp_linear (x, cx, c);
+ return int (y*255.999);
+}
+
+define slsh_main ()
+{
+ variable r, g, b;
+ variable file = __argv1;
+ () = readascii (file, &r, &g, &b);
+ r = convert_normalized_color (r, 256);
+ g = convert_normalized_color (g, 256);
+ b = convert_normalized_color (b, 256);
+ rgb_to_cmap (r, g, b, path_basename_sans_extname (file) + ".map");
+}
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/no_green.map Added

@@ -0,0 +1,16 @@
+% -*- slang -*-
+% This color map was derived from GMT_no_green.cpt
+% Copyright (c) 1991-2004, P. Wessel & W. H. F. Smith
+$1 = 0x00,0x0F,0x20,0x20, 0x0F,0x1F,0x20,0x20, 0x1F,0x2F,0x20,0x20, 0x2F,0x3F,0x00,0x00,
+      0x3F,0x4F,0x2A,0x2A, 0x4F,0x5F,0x55,0x55, 0x5F,0x6F,0x7F,0x7F, 0x6F,0x7F,0xAA,0xAA,
+      0x7F,0x8F,0xFF,0xFF, 0x8F,0x9F,0xFF,0xFF, 0x9F,0xAF,0xFF,0xFF, 0xAF,0xBF,0xFF,0xFF,
+      0xBF,0xCF,0xFF,0xFF, 0xCF,0xDF,0xFF,0xFF, 0xDF,0xEF,0xFF,0xFF, 0xEF,0xFF,0xFF,0xFF;
+$2 = 0x00,0x0F,0x60,0x60, 0x0F,0x1F,0x9F,0x9F, 0x1F,0x2F,0xBF,0xBF, 0x2F,0x3F,0xCF,0xCF,
+      0x3F,0x4F,0xFF,0xFF, 0x4F,0x5F,0xFF,0xFF, 0x5F,0x6F,0xFF,0xFF, 0x6F,0x7F,0xFF,0xFF,
+      0x7F,0x8F,0xFF,0xFF, 0x8F,0x9F,0xF0,0xF0, 0x9F,0xAF,0xBF,0xBF, 0xAF,0xBF,0xA8,0xA8,
+      0xBF,0xCF,0x8A,0x8A, 0xCF,0xDF,0x70,0x70, 0xDF,0xEF,0x4D,0x4D, 0xEF,0xFF,0x00,0x00;
+$3 = 0x00,0x0F,0xFF,0xFF, 0x0F,0x1F,0xFF,0xFF, 0x1F,0x2F,0xFF,0xFF, 0x2F,0x3F,0xFF,0xFF,
+      0x3F,0x4F,0xFF,0xFF, 0x4F,0x5F,0xFF,0xFF, 0x5F,0x6F,0xFF,0xFF, 0x6F,0x7F,0xFF,0xFF,
+      0x7F,0x8F,0x54,0x54, 0x8F,0x9F,0x00,0x00, 0x9F,0xAF,0x00,0x00, 0xAF,0xBF,0x00,0x00,
+      0xBF,0xCF,0x00,0x00, 0xCF,0xDF,0x00,0x00, 0xDF,0xEF,0x00,0x00, 0xEF,0xFF,0x00,0x00;
+png_add_colormap ("no_green", png_build_colormap (__tmp($1),__tmp($2),__tmp($3)));

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/ocean.map Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/polar.map Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/rainbow.map Added

@@ -0,0 +1,40 @@
+% -*- slang -*-
+% This color map was derived from GMT_rainbow.cpt
+% Copyright (c) 1991-2004, P. Wessel & W. H. F. Smith
+$1 =
+
+  0xFF00FF,0xFA00FF,0xF500FF,0xF000FF,0xEB00FF,0xE600FF,0xE100FF,0xDC00FF,
+  0xD700FF,0xD200FF,0xCD00FF,0xC800FF,0xC300FF,0xBE00FF,0xB900FF,0xB400FF,
+  0xAF00FF,0xAA00FF,0xA500FF,0xA000FF,0x9B00FF,0x9600FF,0x9100FF,0x8C00FF,
+  0x8700FF,0x8200FF,0x7D00FF,0x7800FF,0x7300FF,0x6E00FF,0x6900FF,0x6400FF,
+  0x5F00FF,0x5A00FF,0x5500FF,0x5000FF,0x4B00FF,0x4600FF,0x4100FF,0x3C00FF,
+  0x3700FF,0x3200FF,0x2D00FF,0x2800FF,0x2300FF,0x1E00FF,0x1900FF,0x1400FF,
+  0x0F00FF,0x0A00FF,0x0500FF,0x0000FF,0x0003FF,0x0008FF,0x000DFF,0x0012FF,
+  0x0017FF,0x001CFF,0x0021FF,0x0026FF,0x002BFF,0x0030FF,0x0035FF,0x003AFF,
+  0x003FFF,0x0044FF,0x0049FF,0x004EFF,0x0053FF,0x0058FF,0x005DFF,0x0062FF,
+  0x0067FF,0x006CFF,0x0071FF,0x0076FF,0x007BFF,0x0080FF,0x0085FF,0x008AFF,
+  0x008FFF,0x0094FF,0x0099FF,0x009EFF,0x00A3FF,0x00A8FF,0x00ADFF,0x00B2FF,
+  0x00B7FF,0x00BCFF,0x00C1FF,0x00C6FF,0x00CBFF,0x00D0FF,0x00D5FF,0x00DAFF,
+  0x00DFFF,0x00E4FF,0x00E9FF,0x00EEFF,0x00F3FF,0x00F8FF,0x00FDFF,0x00FFFC,
+  0x00FFF7,0x00FFF2,0x00FFED,0x00FFE8,0x00FFE3,0x00FFDE,0x00FFD9,0x00FFD4,
+  0x00FFCF,0x00FFCA,0x00FFC5,0x00FFC0,0x00FFBB,0x00FFB6,0x00FFB1,0x00FFAC,
+  0x00FFA7,0x00FFA2,0x00FF9D,0x00FF98,0x00FF93,0x00FF8E,0x00FF89,0x00FF84,
+  0x00FF7F,0x00FF7A,0x00FF75,0x00FF70,0x00FF6B,0x00FF66,0x00FF61,0x00FF5C,
+  0x00FF57,0x00FF52,0x00FF4D,0x00FF48,0x00FF43,0x00FF3E,0x00FF39,0x00FF34,
+  0x00FF2F,0x00FF2A,0x00FF25,0x00FF20,0x00FF1B,0x00FF16,0x00FF11,0x00FF0C,
+  0x00FF07,0x00FF02,0x01FF00,0x06FF00,0x0BFF00,0x10FF00,0x15FF00,0x1AFF00,
+  0x1FFF00,0x24FF00,0x29FF00,0x2EFF00,0x33FF00,0x38FF00,0x3DFF00,0x42FF00,
+  0x47FF00,0x4CFF00,0x51FF00,0x56FF00,0x5BFF00,0x60FF00,0x65FF00,0x6AFF00,
+  0x6FFF00,0x74FF00,0x79FF00,0x7EFF00,0x83FF00,0x88FF00,0x8DFF00,0x92FF00,
+  0x97FF00,0x9CFF00,0xA1FF00,0xA6FF00,0xABFF00,0xB0FF00,0xB5FF00,0xBAFF00,
+  0xBFFF00,0xC4FF00,0xC9FF00,0xCEFF00,0xD3FF00,0xD8FF00,0xDDFF00,0xE2FF00,
+  0xE7FF00,0xECFF00,0xF1FF00,0xF6FF00,0xFBFF00,0xFFFE00,0xFFF900,0xFFF400,
+  0xFFEF00,0xFFEA00,0xFFE500,0xFFE000,0xFFDB00,0xFFD600,0xFFD100,0xFFCC00,
+  0xFFC700,0xFFC200,0xFFBD00,0xFFB800,0xFFB300,0xFFAE00,0xFFA900,0xFFA400,
+  0xFF9F00,0xFF9A00,0xFF9500,0xFF9000,0xFF8B00,0xFF8600,0xFF8100,0xFF7C00,
+  0xFF7700,0xFF7200,0xFF6D00,0xFF6800,0xFF6300,0xFF5E00,0xFF5900,0xFF5400,
+  0xFF4F00,0xFF4A00,0xFF4500,0xFF4000,0xFF3B00,0xFF3600,0xFF3100,0xFF2C00,
+  0xFF2700,0xFF2200,0xFF1D00,0xFF1800,0xFF1300,0xFF0E00,0xFF0900,0xFF0400
+;
+
+png_add_colormap ("rainbow", __tmp($1));

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/red2green.map Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/relief.map Added

@@ -0,0 +1,16 @@
+% -*- slang -*-
+% This color map was derived from GMT_relief.cpt
+% Copyright (c) 1991-2004, P. Wessel & W. H. F. Smith
+$1 = 0x00,0x0F,0x00,0x00, 0x0F,0x1F,0x00,0x00, 0x1F,0x2F,0x00,0x00, 0x2F,0x3F,0x00,0x00,
+      0x3F,0x4F,0x00,0x56, 0x4F,0x5F,0x56,0xAC, 0x5F,0x6F,0xAC,0xD3, 0x6F,0x7F,0xD3,0xFA,
+      0x7F,0x87,0x46,0x78, 0x87,0x8F,0x78,0x92, 0x8F,0x9F,0x92,0xC6, 0x9F,0xAF,0xC6,0xFA,
+      0xAF,0xBF,0xFA,0xFA, 0xBF,0xCF,0xFA,0xFC, 0xCF,0xDF,0xFC,0xFC, 0xDF,0xEF,0xFC,0xFD, 0xEF,0xFF,0xFD,0xFF;
+$2 = 0x00,0x0F,0x00,0x05, 0x0F,0x1F,0x05,0x0A, 0x1F,0x2F,0x0A,0x50, 0x2F,0x3F,0x50,0x96,
+      0x3F,0x4F,0x96,0xC5, 0x4F,0x5F,0xC5,0xF5, 0x5F,0x6F,0xF5,0xFA, 0x6F,0x7F,0xFA,0xFF,
+      0x7F,0x87,0x78,0x64, 0x87,0x8F,0x64,0x7E, 0x8F,0x9F,0x7E,0xB2, 0x9F,0xAF,0xB2,0xE6,
+      0xAF,0xBF,0xE6,0xEA, 0xBF,0xCF,0xEA,0xEE, 0xCF,0xDF,0xEE,0xF3, 0xDF,0xEF,0xF3,0xF9, 0xEF,0xFF,0xF9,0xFF;
+$3 = 0x00,0x0F,0x00,0x19, 0x0F,0x1F,0x19,0x32, 0x1F,0x2F,0x32,0x7D, 0x2F,0x3F,0x7D,0xC8,
+      0x3F,0x4F,0xC8,0xB8, 0x4F,0x5F,0xB8,0xA8, 0x5F,0x6F,0xA8,0xD3, 0x6F,0x7F,0xD3,0xFF,
+      0x7F,0x87,0x32,0x32, 0x87,0x8F,0x32,0x3C, 0x8F,0x9F,0x3C,0x50, 0x9F,0xAF,0x50,0x64,
+      0xAF,0xBF,0x64,0x7E, 0xBF,0xCF,0x7E,0x98, 0xCF,0xDF,0x98,0xB1, 0xDF,0xEF,0xB1,0xD8, 0xEF,0xFF,0xD8,0xFF;
+png_add_colormap ("relief", png_build_colormap (__tmp($1),__tmp($2),__tmp($3)));

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/sealand.map Added

@@ -0,0 +1,40 @@
+% -*- slang -*-
+% This color map was derived from GMT_sealand.cpt
+% Copyright (c) 1991-2004, P. Wessel & W. H. F. Smith
+$1 =
+
+  0x8C66FF,0x8A66FF,0x8766FF,0x8466FF,0x8166FF,0x7F66FF,0x7C66FF,0x7966FF,
+  0x7766FF,0x7466FF,0x7166FF,0x6F66FF,0x6C66FF,0x6966FF,0x6666FF,0x6668FF,
+  0x666BFF,0x666DFF,0x6670FF,0x6673FF,0x6675FF,0x6678FF,0x667BFF,0x667EFF,
+  0x6680FF,0x6683FF,0x6686FF,0x6688FF,0x668BFF,0x668EFF,0x6690FF,0x6693FF,
+  0x6696FF,0x6699FF,0x669BFF,0x669EFF,0x66A1FF,0x66A3FF,0x66A6FF,0x66A9FF,
+  0x66ABFF,0x66AEFF,0x66B1FF,0x66B4FF,0x66B6FF,0x66B9FF,0x66BCFF,0x66BEFF,
+  0x66C1FF,0x66C4FF,0x66C6FF,0x66C9FF,0x66CCFF,0x66CFFF,0x66D1FF,0x66D4FF,
+  0x66D7FF,0x66D9FF,0x66DCFF,0x66DFFF,0x66E1FF,0x66E4FF,0x66E7FF,0x66EAFF,
+  0x66ECFF,0x66EFFF,0x66F2FF,0x66F4FF,0x66F7FF,0x66FAFF,0x66FCFF,0x66FFFF,
+  0x66FFFD,0x66FFFA,0x66FFF8,0x66FFF5,0x66FFF2,0x66FFF0,0x66FFED,0x66FFEA,
+  0x66FFE7,0x66FFE5,0x66FFE2,0x66FFDF,0x66FFDD,0x66FFDA,0x66FFD7,0x66FFD5,
+  0x66FFD2,0x66FFCF,0x66FFCC,0x66FFCA,0x66FFC7,0x66FFC4,0x66FFC2,0x66FFBF,
+  0x66FFBC,0x66FFBA,0x66FFB7,0x66FFB4,0x66FFB1,0x66FFAF,0x66FFAC,0x66FFA9,
+  0x66FFA7,0x66FFA4,0x66FFA1,0x66FF9F,0x66FF9C,0x66FF99,0x66FF96,0x66FF94,
+  0x66FF91,0x66FF8E,0x66FF8C,0x66FF89,0x66FF86,0x66FF84,0x66FF81,0x66FF7E,
+  0x66FF7B,0x66FF79,0x66FF76,0x66FF73,0x66FF71,0x66FF6E,0x66FF6B,0x66FF69,
+  0x66FF66,0x69FF66,0x6BFF66,0x6EFF66,0x71FF66,0x73FF66,0x76FF66,0x79FF66,
+  0x7BFF66,0x7EFF66,0x81FF66,0x84FF66,0x86FF66,0x89FF66,0x8CFF66,0x8EFF66,
+  0x91FF66,0x94FF66,0x96FF66,0x99FF66,0x9CFF66,0x9FFF66,0xA1FF66,0xA4FF66,
+  0xA7FF66,0xA9FF66,0xACFF66,0xAFFF66,0xB1FF66,0xB4FF66,0xB7FF66,0xBAFF66,
+  0xBCFF66,0xBFFF66,0xC2FF66,0xC4FF66,0xC7FF66,0xCAFF66,0xCCFF66,0xCFFF66,
+  0xD2FF66,0xD5FF66,0xD7FF66,0xFFFFA6,0xFFFDA6,0xFFFBA6,0xFFF8A6,0xFFF6A6,
+  0xFFF4A6,0xFFF2A6,0xFFF0A6,0xFFEEA6,0xFFECA6,0xFFEAA6,0xFFE8A6,0xFFE6A6,
+  0xFFE3A6,0xFFE1A6,0xFFDFA6,0xFFDDA6,0xFFDBA6,0xFFD9A6,0xFFD7A6,0xFFD5A6,
+  0xFFD3A6,0xFFD1A6,0xFFCEA6,0xFFCCA6,0xFFCAA6,0xFFC8A6,0xFFC6A6,0xFFC4A6,
+  0xFFC2A6,0xFFC0A6,0xFFBEA6,0xFFBCA6,0xFFB9A6,0xFFB7A6,0xFFB5A6,0xFFB3A6,
+  0xFFB1A6,0xFFAFA6,0xFFADA6,0xFFABA6,0xFFA9A6,0xFFA7A6,0xFFBEA6,0xFFE3A7,
+  0xF9FFA8,0xD6FFA9,0xB4FFAA,0xABFFC4,0xACFFE6,0xADF7FF,0xAED6FF,0xAFB6FF,
+  0xC8AFFF,0xE9B0FF,0xFFB1F6,0xFFB2D7,0xFFB3C7,0xFFB4C9,0xFFB5CB,0xFFB6CD,
+  0xFFB7CF,0xFFB8D0,0xFFB8D2,0xFFB9D4,0xFFBAD6,0xFFBBD8,0xFFBCD9,0xFFBDDB,
+  0xFFBEDD,0xFFBFDE,0xFFC0E0,0xFFC1E1,0xFFC1E3,0xFFC2E4,0xFFC3E6,0xFFC4E7,
+  0xFFC5E9,0xFFC6EA,0xFFC7EB,0xFFC8ED,0xFFC9EE,0xFFCAEF,0xFFCAF0,0xFFCBF2
+;
+
+png_add_colormap ("sealand", $1);

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/seis.map Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/split.map Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/topo.map Added

@@ -0,0 +1,40 @@
+% -*- slang -*-
+% This color map was derived from GMT_topo.cpt
+% Copyright (c) 1991-2004, P. Wessel & W. H. F. Smith
+$1 =
+
+  0xC977D9,0xC477D9,0xC077D9,0xBB77D9,0xB777D9,0xB277D9,0xAE77D9,0xAA77D9,
+  0xA577D9,0xA177D9,0xAD8AE6,0xA88AE6,0xA48AE6,0xA08AE6,0x9C8AE6,0x988AE6,
+  0x938AE6,0x8F8AE6,0x8B8AE6,0x8A8CE6,0x8A8FE6,0x8A93E6,0x8A96E6,0x8A9AE6,
+  0x8A9DE6,0x8AA0E6,0x8AA4E6,0x8AA7E6,0x8AAAE6,0x8AAEE6,0x8AB2E6,0x8AB5E6,
+  0x8AB9E6,0x8ABCE6,0x8AC0E6,0x8AC3E6,0x8AC7E6,0x8ACBE6,0x8BD0E8,0x8CD6E9,
+  0x8DDBEB,0x8DE0EC,0x8EE6ED,0x8FECEF,0x90F0EF,0x91F2ED,0x91F3E9,0x90F3E5,
+  0x8EF3E0,0x8DF3DB,0x8CF3D6,0x8AF3D1,0x89F3CC,0x88F3C6,0x86F3C1,0x85F3BB,
+  0x85F3B6,0x85F3B1,0x85F3AC,0x85F3A7,0x85F3A2,0x85F39D,0x85F398,0x85F393,
+  0x85F38E,0x85F389,0x87F385,0x8CF385,0x91F385,0x96F385,0x9BF385,0xA0F385,
+  0xA6F385,0xABF385,0xB0F385,0xB4F385,0xB9F385,0xBEF385,0xC3F385,0xC8F385,
+  0xCCF385,0xD1F385,0xD6F385,0xDBF385,0xE0F385,0xE5F385,0xEAF385,0xEFF385,
+  0xF3F285,0xF3ED85,0xF3E885,0xF3E385,0xF3DE85,0xF3D985,0xF3D485,0xF3CF85,
+  0xF3CA85,0xF3C585,0xF3C085,0xF3BB85,0xF3B685,0xF2B285,0xF1B086,0xEFAF87,
+  0xEEAD87,0xECAC88,0xEBAA88,0xEAA889,0xE8A789,0xE7A689,0xE5A48A,0xE4A38A,
+  0xE3A28B,0xE1A08B,0xE09F8B,0xDE9E8C,0xDD9D8C,0xDC9C8C,0xDA9B8D,0xD9A3A3,
+  0xD7A1A1,0xD6A0A0,0xD59F9F,0xD39E9E,0xD29D9D,0xD09C9C,0xCF9B9B,0xCE9A9A,
+  0xCC9999,0x72ADB3,0x6FB3AE,0x6DB3A3,0x6AB397,0x68B38A,0x65B37C,0x63B36D,
+  0x65B765,0x73BE69,0x81C56C,0x91CC70,0x96CC70,0x9BCC70,0xA0CC70,0xA5CC70,
+  0xAACC70,0xAFCC70,0xB4CC70,0xBACE73,0xC2D177,0xC9D47B,0xD0D77F,0xD6D983,
+  0xDCDB87,0xDFDA8B,0xE2D98F,0xE5D993,0xE6D896,0xE7D998,0xE8D99B,0xE8D99D,
+  0xE9D99F,0xEAD9A1,0xEAD9A3,0xEBD9A5,0xECDAA7,0xEDDAA9,0xEDDAAB,0xEEDBAD,
+  0xEFDBB0,0xEFDCB2,0xF0DCB4,0xF1DDB6,0xF1DDB8,0xF2DEBA,0xF3DEBD,0xF4DFBF,
+  0xF4E0C1,0xF5E0C3,0xF6E1C6,0xF6E2C8,0xF7E3CA,0xF8E4CC,0xF8E5CF,0xF9E6D1,
+  0xFAE7D3,0xFBE8D5,0xFBE9D8,0xFCEADA,0xFDEBDC,0xFDEDDF,0xFEEEE1,0xFFEFE4,
+  0xFFF1E6,0xFFF8F3,0xFFF8F3,0xFFF8F3,0xFFF8F3,0xFFF8F4,0xFFF8F4,0xFFF8F4,
+  0xFFF8F4,0xFFF8F4,0xFFF8F5,0xFFF9F5,0xFFF9F5,0xFFF9F5,0xFFF9F5,0xFFF9F6,
+  0xFFF9F6,0xFFF9F6,0xFFF9F6,0xFFF9F6,0xFFF9F7,0xFFF9F7,0xFFF9F7,0xFFF9F7,
+  0xFFFAF7,0xFFFAF8,0xFFFAF8,0xFFFAF8,0xFFFAF8,0xFFFAF8,0xFFFAF9,0xFFFAF9,
+  0xFFFAF9,0xFFFBF9,0xFFFBF9,0xFFFBFA,0xFFFBFA,0xFFFBFA,0xFFFBFA,0xFFFBFA,
+  0xFFFBFB,0xFFFCFB,0xFFFCFB,0xFFFCFB,0xFFFCFB,0xFFFCFC,0xFFFCFC,0xFFFCFC,
+  0xFFFDFC,0xFFFDFC,0xFFFDFD,0xFFFDFD,0xFFFDFD,0xFFFDFD,0xFFFEFD,0xFFFEFE,
+  0xFFFEFE,0xFFFEFE,0xFFFEFE,0xFFFFFE,0xFFFFFF,0xFFFFFF,0xFFFFFF,0xFFFFFF
+;
+
+png_add_colormap ("topo", __tmp($1));

_service:tar_scm:slang-2.3.2.tar.bz2/modules/cmaps/wysiwyg.map Added

@@ -0,0 +1,19 @@
+% -*- slang -*-
+% This color map was derived from GMT_wysiwyg.cpt
+% Copyright (c) 1991-2004, P. Wessel & W. H. F. Smith
+$1 = 0x00,0x0C,0x40,0x40, 0x0C,0x19,0x40,0x40, 0x19,0x26,0x00,0x00, 0x26,0x33,0x00,0x00,
+      0x33,0x3F,0x00,0x00, 0x3F,0x4C,0x40,0x40, 0x4C,0x59,0x40,0x40, 0x59,0x66,0x40,0x40,
+      0x66,0x72,0x40,0x40, 0x72,0x7F,0x40,0x40, 0x7F,0x8C,0x80,0x80, 0x8C,0x99,0xC0,0xC0,
+      0x99,0xA6,0xFF,0xFF, 0xA6,0xB2,0xFF,0xFF, 0xB2,0xBF,0xFF,0xFF, 0xBF,0xCC,0xFF,0xFF,
+      0xCC,0xD9,0xFF,0xFF, 0xD9,0xE5,0xFF,0xFF, 0xE5,0xF2,0xFF,0xFF, 0xF2,0xFF,0xFF,0xFF;
+$2 = 0x00,0x0C,0x00,0x00, 0x0C,0x19,0x00,0x00, 0x19,0x26,0x40,0x40, 0x26,0x33,0x80,0x80,
+      0x33,0x3F,0xA0,0xA0, 0x3F,0x4C,0xC0,0xC0, 0x4C,0x59,0xE0,0xE0, 0x59,0x66,0xFF,0xFF,
+      0x66,0x72,0xFF,0xFF, 0x72,0x7F,0xFF,0xFF, 0x7F,0x8C,0xFF,0xFF, 0x8C,0x99,0xFF,0xFF,
+      0x99,0xA6,0xFF,0xFF, 0xA6,0xB2,0xE0,0xE0, 0xB2,0xBF,0xA0,0xA0, 0xBF,0xCC,0x60,0x60,
+      0xCC,0xD9,0x20,0x20, 0xD9,0xE5,0x60,0x60, 0xE5,0xF2,0xA0,0xA0, 0xF2,0xFF,0xE0,0xE0;
+$3 = 0x00,0x0C,0x40,0x40, 0x0C,0x19,0xC0,0xC0, 0x19,0x26,0xFF,0xFF, 0x26,0x33,0xFF,0xFF,
+      0x33,0x3F,0xFF,0xFF, 0x3F,0x4C,0xFF,0xFF, 0x4C,0x59,0xFF,0xFF, 0x59,0x66,0xFF,0xFF,
+      0x66,0x72,0xC0,0xC0, 0x72,0x7F,0x40,0x40, 0x7F,0x8C,0x40,0x40, 0x8C,0x99,0x40,0x40,
+      0x99,0xA6,0x40,0x40, 0xA6,0xB2,0x40,0x40, 0xB2,0xBF,0x40,0x40, 0xBF,0xCC,0x40,0x40,
+      0xCC,0xD9,0x40,0x40, 0xD9,0xE5,0xC0,0xC0, 0xE5,0xF2,0xFF,0xFF, 0xF2,0xFF,0xFF,0xE1;
+png_add_colormap ("wysiwyg", png_build_colormap (__tmp($1),__tmp($2),__tmp($3)));

_service:tar_scm:slang-2.3.2.tar.bz2/modules/csv-module.c Added

@@ -0,0 +1,663 @@
+#include <stdio.h>
+#include <string.h>
+#include <slang.h>
+
+SLANG_MODULE(csv);
+
+static int CSV_Type_Id = 0;
+
+typedef struct _CSV_Type CSV_Type;
+struct _CSV_Type
+{
+ char delimchar;
+ char quotechar;
+ SLang_Name_Type *read_callback;
+ SLang_Any_Type *callback_data;
+#define CSV_SKIP_BLANK_ROWS	0x01
+#define CSV_STOP_ON_BLANK_ROWS	0x02
+#define BLANK_ROW_BEHAVIOR	(CSV_SKIP_BLANK_ROWS|CSV_STOP_ON_BLANK_ROWS)
+#define CSV_QUOTE_SOME		0x04
+#define CSV_QUOTE_ALL		0x08
+ int flags;
+};
+
+static int check_special_chars (CSV_Type *csv)
+{
+ if (csv->delimchar == 0) csv->delimchar = ',';
+ if (csv->quotechar == 0) csv->quotechar = '"';
+ return 0;
+}
+
+static int execute_read_callback (CSV_Type *csv, char **sptr)
+{
+ char *s;
+
+ *sptr = NULL;
+
+ if ((-1 == SLang_start_arg_list ())
+ || (-1 == SLang_push_anytype (csv->callback_data))
+ || (-1 == SLang_end_arg_list ())
+ || (-1 == SLexecute_function (csv->read_callback)))
+ return -1;
+
+ if (SLang_peek_at_stack () == SLANG_NULL_TYPE)
+ {
+	(void) SLang_pop_null ();
+	return 0;
+ }
+
+ if (-1 == SLang_pop_slstring (&s))
+ return -1;
+
+ *sptr = s;
+ return 1;
+}
+
+typedef struct
+{
+ char **values;
+ SLindex_Type num_allocated;
+ SLindex_Type num;
+}
+Values_Array_Type;
+
+static int push_values_array (Values_Array_Type *av, int allow_empty_array)
+{
+ SLang_Array_Type *at;
+ char **new_values;
+
+ if (av->num == 0)
+ {
+	if (allow_empty_array == 0)
+	 return SLang_push_null ();
+	SLfree ((char *) av->values);
+	av->values = NULL;
+ }
+ else
+ {
+	if (NULL == (new_values = (char **)SLrealloc ((char *)av->values, av->num*sizeof(char *))))
+	 return -1;
+	av->values = new_values;
+ }
+
+ av->num_allocated = av->num;
+ at = SLang_create_array (SLANG_STRING_TYPE, 0, av->values, &av->num, 1);
+
+ if (at == NULL)
+ return -1;
+
+ av->num_allocated = 0;
+ av->num = 0;
+ av->values = NULL;
+
+ return SLang_push_array (at, 1);
+}
+
+static int init_values_array_type (Values_Array_Type *av)
+{
+ memset ((char *)av, 0, sizeof(Values_Array_Type));
+ return 0;
+}
+
+static void free_values_array (Values_Array_Type *av)
+{
+ SLindex_Type i, num;
+ char **values;
+
+ if (NULL == (values = av->values))
+ return;
+ num = av->num;
+ for (i = 0; i < num; i++)
+ SLang_free_slstring (valuesi);
+ SLfree ((char *)values);
+}
+
+static int store_value (Values_Array_Type *va, char *value)
+{
+ SLindex_Type num_allocated;
+
+ num_allocated = va->num_allocated;
+ if (num_allocated == va->num)
+ {
+	char **values;
+	num_allocated += 256;
+	values = (char **)SLrealloc ((char *)va->values, num_allocated*sizeof(char *));
+	if (values == NULL)
+	 return -1;
+	va->values = values;
+	va->num_allocated = num_allocated;
+ }
+ if (NULL == (va->valuesva->num = SLang_create_slstring (value)))
+ return -1;
+
+ va->num++;
+ return 0;
+}
+
+#define NEXT_CHAR(ch) \
+ while (do_read \
+	 || (0 == (ch = lineline_ofs++)) \
+	 || (ch == '\r')) \
+ { \
+ if ((do_read == 0) && (ch == '\r') && (lineline_ofs == '\n')) \
+	{ \
+	 line_ofs++; \
+	 ch = '\n'; \
+	 break; \
+	} \
+ SLang_free_slstring (line); \
+ line = NULL; \
+ status = execute_read_callback (csv, &line); \
+ do_read = 0; \
+ if (status == -1) \
+	goto return_error; \
+ line_ofs = 0; \
+ if (status == 0) \
+	{ \
+	 ch = 0; \
+	 break; \
+	} \
+ }
+
+static int decode_csv_row (CSV_Type *csv, int flags)
+{
+ char *line;
+ size_t line_ofs;
+ char *value;
+ size_t value_size, value_ofs;
+ char delimchar, quotechar;
+ int return_status;
+ Values_Array_Type av;
+ int do_read, in_quote;
+ int blank_line_seen;
+ int is_quoted;
+
+ if (NULL == csv->read_callback)
+ {
+	SLang_verror (SL_InvalidParm_Error, "CSV decoder object has no read callback function");
+	return -1;
+ }
+
+ if (-1 == init_values_array_type (&av))
+ return -1;
+
+ delimchar = csv->delimchar;
+ quotechar = csv->quotechar;
+ value_ofs = line_ofs = 0;
+ value_size = 0;
+ value = NULL;
+ line = NULL;
+ do_read = 1;
+
+ in_quote = 0;
+ return_status = -1;
+ blank_line_seen = 0;
+ is_quoted = 0;
+ while (1)
+ {
+	int status;
+	char ch;
+
+	if (value_ofs == value_size)
+	 {
+	 char *new_value;
+
+	 if (value_size < 64)
+	 value_size += 32;
+	 else if (value_size < 8192)
+	 value_size *= 2;
+	 else value_size += 8192;
+
+	 new_value = (char *)SLrealloc (value, value_size);
+	 if (new_value == NULL)
+	 goto return_error;
+	 value = new_value;
+	 }
+
+	NEXT_CHAR(ch)
+
+	if ((ch == quotechar) && quotechar)
+	 {
+	 if (in_quote)
+	 {
+		 NEXT_CHAR(ch)
+		 if (ch == quotechar)
+		 {
+		 valuevalue_ofs++ = ch;
+		 continue;
+		 }
+
+		 if ((ch != delimchar) && (ch != 0) && (ch != '\n'))
+		 {
+		 SLang_verror (SL_Data_Error, "Expecting a delimiter after an end-quote character in field #%ld",
+				 (long)av.num+1);
+		 goto return_error;
+		 }
+		 in_quote = 0;
+		 /* drop */
+	 }
+	 else if (value_ofs != 0)
+	 {
+		 SLang_verror (SL_Data_Error, "Misplaced quote character inside csv field #%ld",
+				(long)av.num+1);
+		 goto return_error;
+	 }
+	 else
+	 {
+		 in_quote = 1;
+		 is_quoted = 1;
+		 continue;
+	 }
+	 }
+
+	if (ch == delimchar)
+	 {
+	 if (in_quote)
+	 {
+		 valuevalue_ofs++ = ch;
+		 continue;
+	 }
+	 valuevalue_ofs = 0;
+	 if (-1 == store_value (&av, value))
+	 goto return_error;
+	 value_ofs = 0;
+	 continue;
+	 }
+	if ((ch == 0) || (ch == '\n'))
+	 {
+	 if (in_quote)
+	 {
+		 if (ch == '\n')
+		 {
+		 valuevalue_ofs++ = ch;
+		 do_read = 1;
+		 continue;
+		 }
+		 SLang_verror (SL_Data_Error, "No closing quote seen parsing CSV data field #%ld",
+				(long)av.num+1);
+		 goto return_error;
+	 }
+
+	 if ((ch == '\n') || (av.num != 0) || (value_ofs > 0))
+	 {
+		 if ((is_quoted == 0)
+		 && (ch == '\n') && (av.num == 0) && (value_ofs == 0))
+		 {
+		 /* blank line */
+		 int blank_line_behavior = (flags & BLANK_ROW_BEHAVIOR);
+		 if (blank_line_behavior == CSV_SKIP_BLANK_ROWS)
+			 {
+			 do_read = 1;
+			 continue;
+			 }
+		 if (blank_line_behavior == CSV_STOP_ON_BLANK_ROWS)
+			 {
+			 blank_line_seen = 1;
+			 break;
+			 }
+		 }
+		 valuevalue_ofs = 0;
+		 if (-1 == store_value (&av, value))
+		 goto return_error;
+	 }
+	 break;		 /* done */
+	 }
+
+	valuevalue_ofs++ = ch;
+ }
+
+ /* Get here if at end of line or file */
+ return_status = push_values_array (&av, blank_line_seen);
+ /* drop */
+
+return_error:
+ SLfree (value);
+ free_values_array(&av);
+ if (line != NULL)
+ SLang_free_slstring (line);
+ return return_status;
+}
+
+static void free_csv_type (CSV_Type *csv)
+{
+ if (csv == NULL)
+ return;
+ if (csv->callback_data != NULL) SLang_free_anytype (csv->callback_data);
+ if (csv->read_callback != NULL) SLang_free_function (csv->read_callback);
+ SLfree ((char *)csv);
+}
+
+static CSV_Type *pop_csv_type (SLang_MMT_Type **mmtp)
+{
+ SLang_MMT_Type *mmt;
+
+ if (NULL == (mmt = SLang_pop_mmt (CSV_Type_Id)))
+ {
+	*mmtp = NULL;
+	return NULL;
+ }
+ *mmtp = mmt;
+ return (CSV_Type *)SLang_object_from_mmt (mmt);
+}
+
+/* Usage: obj = cvs_decoder_new (&read_callback, callback_data, delim, quote, flags) */
+static void new_csv_decoder_intrin (void)
+{
+ CSV_Type *csv;
+ SLang_MMT_Type *mmt;
+
+ if (NULL == (csv = (CSV_Type *)SLmalloc(sizeof(CSV_Type))))
+ return;
+ memset ((char *)csv, 0, sizeof(CSV_Type));
+
+ if ((-1 == SLang_pop_int (&csv->flags))
+ ||(-1 == SLang_pop_char (&csv->quotechar))
+ || (-1 == SLang_pop_char (&csv->delimchar))
+ || (-1 == check_special_chars (csv))
+ || (-1 == SLang_pop_anytype (&csv->callback_data))
+ || (NULL == (csv->read_callback = SLang_pop_function ()))
+ || (NULL == (mmt = SLang_create_mmt (CSV_Type_Id, (VOID_STAR)csv))))
+ {
+	free_csv_type (csv);
+	return;
+ }
+
+ if (-1 == SLang_push_mmt (mmt))
+ SLang_free_mmt (mmt);
+}
+
+static void decode_csv_row_intrin (void)
+{
+ CSV_Type *csv;
+ SLang_MMT_Type *mmt;
+ int flags = 0;
+ int has_flags = 0;
+
+ if (SLang_Num_Function_Args == 2)
+ {
+	if (-1 == SLang_pop_int (&flags))
+	 return;
+
+	has_flags = 1;
+ }
+ if (NULL == (csv = pop_csv_type (&mmt)))
+ return;
+
+ if (has_flags == 0)
+ flags = csv->flags;
+
+ (void) decode_csv_row (csv, flags);
+ SLang_free_mmt (mmt);
+}
+
+/* returns a malloced string */
+static char *csv_encode (CSV_Type *csv,
+			 char **fields, SLuindex_Type nfields,
+			 int flags)
+{
+ char *encoded_str, *s;
+ size_t size;
+ SLuindex_Type i;
+ char delimchar, quotechar;
+ int quote_some, quote_all;
+ char *fieldflags;
+
+ delimchar = csv->delimchar;
+ quotechar = csv->quotechar;
+ quote_some = flags & (CSV_QUOTE_SOME|CSV_QUOTE_ALL);
+ quote_all = flags & CSV_QUOTE_ALL;
+
+ size = 0;
+ if (nfields > 1)
+ size += nfields-1;		 /* for delimiters */
+ size += 3;			 /* for CRLF\0 */
+
+ fieldflags = (char *)SLmalloc(nfields+1);
+ if (fieldflags == NULL)
+ return NULL;
+
+ for (i = 0; i < nfields; i++)
+ {
+	char ch, *f, *field = fieldsi;
+	int needs_quote = 0;
+
+	fieldflagsi = 0;
+	if ((field == NULL) || (*field == 0))
+	 {
+	 if (quote_some)
+	 {
+		 fieldflagsi = 1;
+		 size += 2;
+	 }
+	 continue;
+	 }
+	f = field;
+	while ((ch = *f++) != 0)
+	 {
+	 size++;
+	 if (ch == quotechar)
+	 {
+		 needs_quote=1;
+		 size++;
+		 continue;
+	 }
+	 if (ch == delimchar)
+	 {
+		 needs_quote = 1;
+		 continue;
+	 }
+
+	 if ((unsigned char)ch > ' ')
+	 continue;
+
+	 if (ch == '\n')
+	 {
+#if 0
+		 /* Do not insert a \r-- excel cannot deal with \r\n in a field.
+		 * It requires \r\n only at the end of the CSV line
+		 */
+		 size++;	 /* for \r */
+#endif
+		 needs_quote = 1;
+		 continue;
+	 }
+	 if (quote_some)
+	 needs_quote = 1;
+	 }
+
+	if (needs_quote || quote_all)
+	 {
+	 fieldflagsi = 1;
+	 size += 2;
+	 }
+ }
+
+ if (NULL == (encoded_str = (char *)SLmalloc (size)))
+ {
+	SLfree (fieldflags);
+	return NULL;
+ }
+ s = encoded_str;
+
+ i = 0;
+ while (i < nfields)
+ {
+	char ch, *f, *field;
+	int needs_quote;
+
+	needs_quote = fieldflagsi;
+	field = fieldsi;
+	i++;
+
+	if ((i > 1) && (i <= nfields))
+	 *s++ = delimchar;
+
+	if (needs_quote) *s++ = quotechar;
+
+	if ((field == NULL) || (*field == 0))
+	 {
+	 if (needs_quote)
+	 *s++ = quotechar;
+	 continue;
+	 }
+
+	f = field;
+	while ((ch = *f++) != 0)
+	 {
+	 if (ch == quotechar)
+	 {
+		 *s++ = ch;
+		 *s++ = ch;
+		 continue;
+	 }
+
+	 if (ch == '\n')
+	 {
+		 /* *s++ = '\r'; --- See above comment about excel and \r\n in a field*/
+		 *s++ = ch;
+		 continue;
+	 }
+
+	 *s++ = ch;
+	 }
+	if (needs_quote)
+	 *s++ = quotechar;
+ }
+
+ *s++ = '\r';
+ *s++ = '\n';
+ *s = 0;
+
+ SLfree (fieldflags);
+ return encoded_str;
+}
+
+static void encode_csv_row_intrin (void)
+{
+ SLang_Array_Type *at;
+ CSV_Type *csv;
+ SLang_MMT_Type *mmt;
+ int flags;
+ int has_flags;
+ char *str;
+
+ if (SLang_Num_Function_Args == 3)
+ {
+	if (-1 == SLang_pop_int (&flags))
+	 return;
+	has_flags = 1;
+ }
+ else has_flags = 0;
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_STRING_TYPE))
+ return;
+
+ if (NULL == (csv = pop_csv_type (&mmt)))
+ {
+	SLang_free_array (at);
+	return;
+ }
+
+ if (0 == has_flags)
+ flags = csv->flags;
+
+ str = csv_encode (csv, (char **)at->data, at->num_elements, flags);
+ SLang_free_mmt (mmt);
+ SLang_free_array (at);
+ (void) SLang_push_malloced_string (str);
+}
+
+static void new_csv_encoder_intrin (void)
+{
+ CSV_Type *csv;
+ SLang_MMT_Type *mmt;
+
+ if (NULL == (csv = (CSV_Type *)SLmalloc(sizeof(CSV_Type))))
+ return;
+ memset ((char *)csv, 0, sizeof(CSV_Type));
+
+ if ((-1 == SLang_pop_int (&csv->flags))
+ ||(-1 == SLang_pop_char (&csv->quotechar))
+ || (-1 == SLang_pop_char (&csv->delimchar))
+ || (-1 == check_special_chars (csv))
+ || (NULL == (mmt = SLang_create_mmt (CSV_Type_Id, (VOID_STAR)csv))))
+ {
+	free_csv_type (csv);
+	return;
+ }
+
+ if (-1 == SLang_push_mmt (mmt))
+ SLang_free_mmt (mmt);
+}
+
+#define DUMMY_CSV_TYPE ((SLtype)-1)
+static SLang_Intrin_Fun_Type Module_Intrinsics =
+{
+ MAKE_INTRINSIC_0("_csv_decoder_new", new_csv_decoder_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_csv_decode_row", decode_csv_row_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_csv_encoder_new", new_csv_encoder_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_csv_encode_row", encode_csv_row_intrin, SLANG_VOID_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static SLang_IConstant_Type Module_Constants =
+{
+ MAKE_ICONSTANT("CSV_SKIP_BLANK_ROWS", CSV_SKIP_BLANK_ROWS),
+ MAKE_ICONSTANT("CSV_STOP_BLANK_ROWS", CSV_STOP_ON_BLANK_ROWS),
+ MAKE_ICONSTANT("CSV_QUOTE_SOME", CSV_QUOTE_SOME),
+ MAKE_ICONSTANT("CSV_QUOTE_ALL", CSV_QUOTE_ALL),
+ SLANG_END_ICONST_TABLE
+};
+
+static void destroy_csv (SLtype type, VOID_STAR f)
+{
+ (void) type;
+ free_csv_type ((CSV_Type *)f);
+}
+
+static int register_csv_type (void)
+{
+ SLang_Class_Type *cl;
+
+ if (CSV_Type_Id != 0)
+ return 0;
+
+ if (NULL == (cl = SLclass_allocate_class ("CSV_Type")))
+ return -1;
+
+ if (-1 == SLclass_set_destroy_function (cl, destroy_csv))
+ return -1;
+
+ /* By registering as SLANG_VOID_TYPE, slang will dynamically allocate a
+ * type.
+ */
+ if (-1 == SLclass_register_class (cl, SLANG_VOID_TYPE, sizeof (CSV_Type), SLANG_CLASS_TYPE_MMT))
+ return -1;
+
+ CSV_Type_Id = SLclass_get_class_id (cl);
+ if (-1 == SLclass_patch_intrin_fun_table1 (Module_Intrinsics, DUMMY_CSV_TYPE, CSV_Type_Id))
+ return -1;
+
+ return 0;
+}
+
+int init_csv_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if (-1 == register_csv_type ())
+ return -1;
+
+ if ((-1 == SLns_add_intrin_fun_table (ns, Module_Intrinsics, NULL))
+ || (-1 == SLns_add_iconstant_table (ns, Module_Constants, NULL)))
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_csv_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/csv.sl Added

@@ -0,0 +1,691 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+import ("csv");
+
+private define read_fp_callback (info)
+{
+ variable line, comment_char = info.comment_char;
+ forever
+ {
+	if (-1 == fgets (&line, info.fp))
+	 return NULL;
+
+	if ((line0 == comment_char)
+	 && (0 == strnbytecmp (line, info.comment, info.comment_len)))
+	 continue;
+
+	return line;
+ }
+}
+
+private define read_strings_callback (str_info)
+{
+ variable line;
+
+ if (str_info.output_crlf)
+ {
+	str_info.output_crlf = 0;
+	return "\n";
+ }
+ variable i = str_info.i;
+ if (i >= str_info.n)
+ return NULL;
+ line = str_info.stringsi;
+ str_info.i = i+1;
+ if (line-1 != '\n')
+ str_info.output_crlf = 1;
+
+ return line;
+}
+
+private define resize_arrays (list, n)
+{
+ _for (0, length(list)-1, 1)
+ {
+	variable i = ();
+	variable a = listi;
+	variable m = length(a);
+	if (m > n)
+	 {
+	 listi = a:n-1;
+	 continue;
+	 }
+	variable b = _typeof(a)n;
+	b:m-1 = a;
+	listi = b;
+ }
+}
+
+private define atofloat (x)
+{
+ typecast (atof(x), Float_Type);
+}
+
+private define get_blankrows_bits (val)
+{
+ if (val == "skip") return CSV_SKIP_BLANK_ROWS;
+ if (val == "stop") return CSV_STOP_BLANK_ROWS;
+ return 0;
+}
+
+private define read_row (csv)
+{
+ % The blank row handling default is to use that of the csv object.
+ if (qualifier_exists ("blankrows"))
+ {
+	return _csv_decode_row (csv.decoder,
+			 get_blankrows_bits (qualifier("blankrows")));
+ }
+ return _csv_decode_row (csv.decoder);
+}
+
+private define fixup_header_names (names)
+{
+ if (names == NULL) return names;
+ if (typeof (names) == List_Type)
+ names = list_to_array (names);
+ if (_typeof(names) != String_Type)
+ return names;
+
+ variable is_scalar = (typeof (names) != Array_Type);
+ if (is_scalar)
+ names = names;
+
+ names = strlow (names);
+ variable i = where (names == "");
+ namesi = array_map (String_Type, &sprintf, "col%d", i+1);
+
+#iffalse
+ % This code is nolonger necessary since slang now allows arbitrary
+ % structure names.
+ names = strtrans (names, "^\\w", "_");
+ names = strcompress (names, "_");
+
+ _for i (0, length(names)-1, 1)
+ {
+	if ('0' <= namesi0 <= '9')
+	 namesi = "_" + namesi;
+ }
+#endif
+ if (is_scalar) names = names0;
+ return names;
+}
+
+private define pop_columns_as_array (n)
+{
+ if (n == 0)
+ return String_Type0;
+
+ try
+ {
+	% allow a mixture of arrays and scalars
+	variable columns = __pop_list (n);
+	columns = __push_list(columns);
+	return columns;
+ }
+ catch TypeMismatchError:
+ {
+	throw TypeMismatchError, "Column arguments cannot be a mixture of ints and strings";
+ }
+}
+
+
+private define read_cols ()
+{
+ if ((_NARGS == 0) || (qualifier_exists ("help")))
+ {
+	usage("struct = .readcol (columns ; qualifiers)\n\
+where columns is an optional 1-based array of column numbers,\n\
+ or array of column names.\n\
+Qualifiers:\n\
+ header=header, fields=array of field names,\n\
+ type=value|array|string of 's','i','l','f','d' (str,int,long,float,dbl)\n\
+ typeNTH=val (specifiy type for NTH column)\n\
+ snan=\"\", inan=0, lnan=0L, fnan=_NaN, dnan=_NaN (defaults for empty fields),\n\
+ nanNTH=val (value used for an empty field in the NTH column\n\
+"
+	 );
+ }
+
+ variable columns = NULL;
+ if (_NARGS > 1)
+ {
+	columns = pop_columns_as_array (_NARGS-1);
+ }
+ variable csv = ();
+
+ variable fields = qualifier ("fields");
+ variable header = qualifier ("header");
+ variable types = qualifier ("type");
+ variable snan = qualifier ("snan", "");
+ variable dnan = qualifier ("dnan", _NaN);
+ variable fnan = qualifier ("fnan", typecast(_NaN,Float_Type));
+ variable inan = qualifier ("inan", 0);
+ variable lnan = qualifier ("lnan", 0L);
+
+ if ((fields != NULL) && (columns != NULL)
+ && (length(fields) != length(columns)))
+ throw InvalidParmError, "The fields qualifier must be the same size as the number of columns";
+
+ variable flags = get_blankrows_bits (qualifier("blankrows", "skip"));
+
+ header = fixup_header_names (header);
+ columns = fixup_header_names (columns);
+
+ variable columns_are_string = _typeof(columns) == String_Type;
+
+ if ((header == NULL) && columns_are_string)
+ throw InvalidParmError, "No header was supplied to map column names";
+
+ variable column_ints = columns, col, i, j;
+ if (columns_are_string)
+ {
+	column_ints = Int_Typelength(columns);
+	_for i (0, length(columns)-1, 1)
+	 {
+	 col = columnsi;
+	 j = wherefirst (col == header);
+	 if (j == NULL)
+	 throw InvalidParmError, "Unknown (canonical) column name $col";
+	 column_intsi = j+1;
+	 }
+ }
+
+ variable row_data = _csv_decode_row (csv.decoder, flags);
+ if (column_ints == NULL)
+ column_ints = 1:length(row_data);
+
+ if (any(column_ints>length(row_data)))
+ {
+	throw InvalidParmError, "column number is too large for data";
+ }
+ variable ncols = length(column_ints);
+
+ variable datastruct = NULL;
+ if (fields == NULL)
+ {
+	if (columns_are_string)
+	 fields = columns;
+	else if (header != NULL)
+	 fields = headercolumn_ints-1;
+	else
+	 fields = array_map(String_Type, &sprintf, "col%d", column_ints);
+ }
+ datastruct = @Struct_Type(fields);
+
+ column_ints -= 1;		 % make 0-based
+
+ variable convert_funcs = Ref_Typencols, convert_func, val;
+ variable nan_values = {}; loop(ncols) list_append(nan_values, snan);
+
+ if (types == NULL)
+ {
+	types = qualifier_exists ("auto") ? 'A' : 's';
+ }
+
+ if (typeof(types) == List_Type)
+ types = list_to_array (types);
+
+ if (typeof(types) == String_Type)
+ types = bstring_to_array (types);
+
+ if ((typeof(types) == Array_Type) && (length(types) != ncols))
+ throw InvalidParmError, "types array must be equal to the number of columns";
+
+ if (typeof (types) != Array_Type)
+ types = typesInt_Typencols; % single (default) type specified
+
+ variable i1;
+ _for i (1, ncols, 1)
+ {
+	i1 = i-1;
+	typesi1 = qualifier ("type$i"$, typesi1);
+ }
+
+ i = where(types=='i');
+ convert_funcsi = &atoi; nan_valuesi = typecast(inan, Int_Type);
+ i = where(types=='l');
+ convert_funcsi = &atol; nan_valuesi = typecast(lnan, Long_Type);
+ i = where(types=='f');
+ convert_funcsi = &atofloat; nan_valuesi = typecast (fnan, Float_Type);
+ i = where(types=='d');
+ convert_funcsi = &atof; nan_valuesi = typecast(dnan, Double_Type);
+
+ _for i (1, ncols, 1)
+ {
+	i1 = i-1;
+
+	if (typesi1 == 'A')
+	 {
+	 variable type = _slang_guess_type (row_datai1);
+	 if (type == Double_Type)
+	 {
+		 convert_funcsi1 = &atof;
+		 nan_valuesi1 = dnan;
+		 typesi1 = 'd';
+	 }
+	 else if (type == Int_Type)
+	 {
+		 convert_funcsi1 = &atoi;
+		 nan_valuesi1 = inan;
+		 typesi1 = 'i';
+	 }
+	 else typesi1 = 's';
+	 }
+
+	val = nan_valuesi1;
+	nan_valuesi1 = typecast (qualifier ("nan$i"$, val), typeof(val));
+ }
+
+ variable list_of_arrays = {}, array;
+ variable init_size = 0x8000;
+ variable dsize = init_size;
+ variable max_allocated = init_size;
+ _for i (0, ncols-1, 1)
+ {
+	val = row_datacolumn_intsi;
+	array = typeof(nan_valuesi)max_allocated;
+	ifnot (strbytelen(val))
+	 val = nan_valuesi;
+	else
+	 {
+	 convert_func = convert_funcsi;
+	 if (convert_func != NULL)
+	 val = (@convert_func)(val);
+	 }
+	array0 = val;
+	list_append (list_of_arrays, array);
+ }
+
+ variable nread = 1;
+ variable min_row_size = 1+max(column_ints);
+ while (row_data = _csv_decode_row (csv.decoder, flags), row_data != NULL)
+ {
+	if (length (row_data) < min_row_size)
+	 {
+	 % FIXME-- make what to do here configurable
+	 if (length(row_data) == 0)
+	 break;
+
+	 continue;
+	 }
+
+	if (nread >= max_allocated)
+	 {
+	 max_allocated += dsize;
+	 resize_arrays (list_of_arrays, max_allocated);
+	 }
+
+	_for i (0, ncols-1, 1)
+	 {
+	 val = row_datacolumn_intsi;
+	 ifnot (strbytelen(val))
+	 {
+		 list_of_arraysinread = nan_valuesi;
+		 continue;
+	 }
+	 convert_func = convert_funcsi;
+	 if (convert_func == NULL)
+	 {
+		 list_of_arraysinread = val;
+		 continue;
+	 }
+	 list_of_arraysinread = (@convert_func)(val);
+	 }
+	nread++;
+ }
+ resize_arrays (list_of_arrays, nread);
+ set_struct_fields (datastruct, __push_list(list_of_arrays));
+ return datastruct;
+}
+
+define csv_decoder_new ()
+{
+ if (_NARGS != 1)
+ usage ("\
+obj = csv_decoder_new (file|fp|strings ; qualifiers);\n\
+Qualifiers:\n\
+ quote='\"', delim=',', skiplines=0, comment=string");
+
+ variable fp = ();
+ variable type = typeof(fp);
+ variable func = &read_fp_callback;
+ variable func_data;
+
+ variable skiplines = qualifier("skiplines", 0);
+ variable delim = qualifier("delim", ',');
+ variable quote = qualifier("quote", '"');
+ variable comment = qualifier("comment", NULL);
+ variable comment_char = (comment == NULL) ? NULL : comment0;
+ variable flags = get_blankrows_bits (qualifier("blankrows", "skip"));
+
+ if ((type == Array_Type) || (type == List_Type))
+ {
+	func = &read_strings_callback;
+	func_data = struct
+	 {
+	 strings = fp,
+	 i = skiplines, n = length(fp),
+	 output_crlf = 0,
+	 comment_char = comment_char,
+	 comment = comment,
+	 };
+ }
+ else
+ {
+	if (type != File_Type)
+	 {
+	 fp = fopen (fp, "r");
+	 if (fp == NULL)
+	 throw OpenError, "Unable to open CSV file"$;
+	 }
+
+	func_data = struct
+	 {
+	 fp = fp,
+	 comment_char = comment_char,
+	 comment = comment,
+	 comment_len = ((comment == NULL) ? 0 : strbytelen(comment)),
+	 };
+	variable line;
+	loop (skiplines)
+	 () = fgets (&line, fp);
+ }
+
+ variable csv = struct
+ {
+	decoder = _csv_decoder_new (func, func_data, delim, quote, flags),
+	readrow = &read_row,
+	readcol = &read_cols,
+ };
+
+ return csv;
+}
+
+% Encoder
+
+private define writecol ()
+{
+ if ((_NARGS < 3) || qualifier_exists("help"))
+ {
+	usage("\
+writecol (file|fp, list_of_column_data | datastruct | col1,col2,...)\n\
+Qualifiers:\n\
+ names=array-of-column-names, noheader, quoteall, quotesome, rdb\n\
+"
+	 );
+ }
+
+ variable csv, data, file;
+ if (_NARGS == 3)
+ {
+	(csv, file, data) = ();
+ }
+ else
+ {
+	data = __pop_list (_NARGS-2);
+	(csv, file) = ();
+ }
+
+ variable type = typeof (data);
+ if ((type != List_Type) && (type != Array_Type)
+ && not is_struct_type (data))
+ data = {data};
+
+ variable flags = 0;
+ if (qualifier_exists ("quoteall")) flags |= CSV_QUOTE_ALL;
+ if (qualifier_exists ("quotesome")) flags |= CSV_QUOTE_SOME;
+ variable rdb = qualifier_exists ("rdb");
+
+ variable fp = file;
+ if (typeof(file) != File_Type)
+ fp = fopen (file, "wb");
+ if (fp == NULL)
+ throw OpenError, "Error opening $file in write mode"$;
+
+ variable names = NULL;
+ ifnot (qualifier_exists ("noheader"))
+ {
+	names = qualifier ("names");
+	if ((names == NULL) && is_struct_type (data))
+	 names = get_struct_field_names (data);
+ }
+
+ if (is_struct_type (data))
+ {
+	variable tmp = {};
+	data = {(_push_struct_field_values(data), pop())};
+	list_reverse (data);
+ }
+
+ EXIT_BLOCK
+ {
+	ifnot (__is_same(file, fp))
+	 {
+	 if (-1 == fclose (fp))
+	 throw WriteError, "Error closing $file"$;
+	 }
+ }
+
+ variable ncols = length(data);
+ if (length (data) == 0)
+ return;
+ variable nrows = length(data0), i, j;
+ _for i (1, ncols-1, 1)
+ {
+	if (nrows != length(datai))
+	 throw InvalidParmError, "CSV data columns must be the same length";
+ }
+
+ variable str, encoder = csv.encoder;
+
+ if (names != NULL)
+ {
+	if (typeof (names) == List_Type)
+	 names = list_to_array (names);
+	str = _csv_encode_row (encoder, names, flags);
+	if (-1 == fputs (str, fp))
+	 throw WriteError, "Write to CSV file failed";
+	if (rdb)
+	 {
+	 variable types = String_Typencols;
+	 _for i (0, ncols-1, 1)
+	 typesi = __is_datatype_numeric (_typeof(datai)) ? "N" : "S";
+
+	 str = _csv_encode_row (encoder, types, flags);
+	 if (-1 == fputs (str, fp))
+	 throw WriteError, "Write to CSV file failed";
+	 }
+ }
+
+ variable row_data = String_Typencols;
+ _for i (0, nrows-1, 1)
+ {
+	_for j (0, ncols-1, 1)
+	 row_dataj = string (dataji);
+
+	str = _csv_encode_row (encoder, row_data, flags);
+	if (-1 == fputs (str, fp))
+	 throw WriteError, "Write to CSV file failed";
+ }
+}
+
+define csv_encoder_new ()
+{
+ if (qualifier_exists ("help"))
+ {
+	usage ("csv = csv_encoder_new ();\n\
+Qualifiers:\n\
+ delim=','\n\
+ quote='\"'\n\
+ quotesome, quoteall\n\
+ rdb\n\
+"
+	 );
+ }
+
+ variable flags = 0;
+ if (qualifier_exists ("quoteall")) flags |= CSV_QUOTE_ALL;
+ if (qualifier_exists ("quotesome")) flags |= CSV_QUOTE_SOME;
+ variable quotechar = qualifier ("quote", '"');
+ variable delimchar = qualifier ("delim",
+				 qualifier_exists ("rdb") ? '\t' : ',');
+
+ variable csv = struct
+ {
+	encoder = _csv_encoder_new (delimchar, quotechar, flags),
+	writecol = &writecol,
+ };
+
+ return csv;
+}
+
+define csv_writecol ()
+{
+ if ((_NARGS < 2) || qualifier_exists("help"))
+ {
+	usage("\
+csv_writecol (file|fp, list_of_column_data | datastruct | col1,col2,...)\n\
+Qualifiers:\n\
+ names=array-of-column-names, noheader, quote=val, quoteall, quotesome\n\
+"
+	 );
+ }
+
+ variable args = __pop_list (_NARGS);
+ variable csv = csv_encoder_new (;;__qualifiers);
+ csv.writecol (__push_list(args);;__qualifiers);
+}
+
+private define convert_to_numeric (s, name)
+{
+ variable val = get_struct_field (s, name);
+ variable num = length (val);
+ if ((num == 0) || (_typeof (val) != String_Type))
+ return;
+
+ EXIT_BLOCK
+ {
+	set_struct_field (s, name, val);
+ }
+
+ variable types = DataType_Typenum;
+ _for (0, length (val)-1, 1)
+ {
+	variable i = ();
+	variable type = _slang_guess_type (vali);
+	if (type == Double_Type)
+	 {
+	 val = atof (val);
+	 return;
+	 }
+	typesi = type;
+ }
+
+ if (all (types == Int_Type))
+ {
+	val = atoi (val);
+	return;
+ }
+
+ if (any (types == Float_Type))
+ {
+	val = atofloat (val);
+	return;
+ }
+
+ if (any (types == Long_Type))
+ {
+	val = atol (val);
+	return;
+ }
+
+ if (any (types == Int_Type))
+ {
+	val = atoi (val);
+	return;
+ }
+
+ val = atof (val);
+}
+
+define csv_readcol ()
+{
+ if ((_NARGS == 0) || qualifier_exists("help"))
+ {
+	usage ("struct = csvreadcol (file|fp ,columns ;qualifier)\n\
+where columns is an optional 1-based array of column numbers,\n\
+ or array of column names.\n\
+Qualifiers:\n\
+ quote='\"', delim=',', skiplines=0, comment=string, has_header,\n\
+ header=header, fields=array of field names,\n\
+ type=value|array of 's','i','l','f','d' (string,int,long,float,double)\n\
+ typeNTH=val (specifiy type for NTH column)\n\
+ snan=\"\", inan=0, lnan=0L, fnan=_NaN, dnan=_NaN (defaults for empty fields),\n\
+ nanNTH=val (value used for an empty field in the NTH column\n\
+"
+	 );
+ }
+
+ variable file, columns;
+ columns = __pop_list (_NARGS-1);
+ file = ();
+
+ variable q = __qualifiers ();
+ variable rdb = qualifier_exists ("rdb");
+
+ % rdb files are tab-delimited files, # is a comment character,
+ % the first non-comment line contains the field names, the
+ % second line gives the field types.
+ if (rdb)
+ {
+	q = struct { comment = "#", delim = '\t' };
+ }
+ variable types = NULL;
+ variable csv = csv_decoder_new (file ;; q);
+ if (rdb || qualifier_exists ("has_header"))
+ {
+	variable header = csv.readrow ();
+	q = struct { header=header, @q };
+	if (rdb)
+	 {
+	 % The type field consists of an integer, followed by a
+	 % type specifier, and a justification character. The
+	 % integer and justification characters are for display
+	 % purposes. The type specifier is N for numberic, S for
+	 % string, M for month. Here, M and S will be treated the
+	 % same.
+	 types = csv.readrow ();
+	 types = strtrans (types, "0-9<>", "");
+	 }
+ }
+
+ variable s = csv.readcol (__push_list(columns) ;; q);
+ if (rdb)
+ {
+	ifnot (length (columns))
+	 columns = header;
+
+	header = fixup_header_names (header);
+	foreach (columns)
+	 {
+	 variable col = ();
+	 if (typeof (col) == String_Type)
+	 col = fixup_header_names (col);
+	 else
+	 col = headercol-1;
+
+	 variable i = wherefirst (col == header);
+	 if ((i == NULL) || (typesi != "N"))
+	 continue;
+
+	 convert_to_numeric (s, col);
+	 }
+ }
+ return s;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/examples Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/examples/echoclnt.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/examples/echosrv.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/examples/grep Added

@@ -0,0 +1,171 @@
+#!/usr/bin/env slsh
+
+% This is a simple-minded implementation of a highlighting grep program
+% designed to test the pcre module.
+import ("pcre");
+
+static define usage ()
+{
+ ()=fprintf(stderr, "Usage: %s -inl pattern files...\n", __argv0);
+ exit (1);
+}
+
+static variable MATCH = 1;
+static variable LINENUM = 2;
+static variable FILENAME = 4;
+static variable Output_Format = 0;
+
+static define grep (file, p)
+{
+ variable fp;
+
+ if (file == NULL)
+ fp = stdin;
+ else
+ fp = fopen (file, "r");
+
+ if (fp == NULL)
+ {
+	fprintf (stderr, "*** Unable to open %s\n", file);
+	return;
+ }
+
+ variable linenum = 0;
+ foreach (fp) using ("line")
+ {
+	variable str = ();
+	linenum++;
+
+	if (pcre_exec (p, str, 0))
+	 {
+	 variable i0, i1, i;
+
+	 switch (Output_Format)
+	 {
+		case FILENAME:
+		 () = fprintf (stdout, "%s\n", file);
+		 return;
+	 }
+	 {
+		case LINENUM:
+		 () = fprintf (stdout, "%d\n", linenum);
+		 continue;
+	 }
+	 {
+		case (MATCH|LINENUM):
+
+		 () = fprintf (stdout, "%d:", linenum);
+	 }
+	 {
+		case (LINENUM|FILENAME):
+		 () = fprintf (stdout, "%s:%d\n", file, linenum);
+		 continue;
+	 }
+	 {
+		case (LINENUM|FILENAME|MATCH):
+		 () = fprintf (stdout, "%s:%d:", file, linenum);
+	 }
+	 {
+		case (FILENAME|MATCH):
+		 () = fprintf (stdout, "%s:", file);
+	 }
+
+	 do
+	 {
+		 i = pcre_nth_match (p, 0);
+		 i0 = i0;
+		 i1 = i1;
+		 if (i1 <= i0)
+		 break;
+		 if (i0 > 0)
+		 () = fprintf (stdout, "%s", str0:i0-1);
+		 () = fprintf (stdout, "\e7m%s\em", stri0:i1-1);
+		 str = stri1:;
+	 }
+	 while (pcre_exec (p, str, 0));
+	 () = fprintf (stdout, "%s", str);
+	 }
+ }
+}
+
+static define main (argc, argv)
+{
+ variable i;
+ variable files, pattern;
+ variable options;
+
+ i = 1;
+ files = NULL;
+ pattern = NULL;
+ options = 0;
+ Output_Format = MATCH;
+
+ while (i < argc)
+ {
+	variable arg = __argvi;
+	i++;
+
+	if (arg0 == '-')
+	 {
+	 foreach (arg1:)
+	 {
+		 variable ch = ();
+		 switch (ch)
+		 {
+		 case 'i':
+		 options |= PCRE_CASELESS;
+		 }
+		 {
+		 case 'l':
+		 Output_Format &= ~MATCH;
+		 Output_Format |= FILENAME;
+		 }
+		 {
+		 case 'n':
+		 Output_Format |= LINENUM;
+		 }
+		 {
+		 () = fprintf (stderr, "Unsupported option: '%c'\n", ch);
+		 exit (1);
+		 }
+	 }
+	 continue;
+	 }
+
+	pattern = arg;
+	break;
+ }
+
+ if (pattern == NULL)
+ usage ();
+
+ variable p = pcre_compile (pattern, options);
+
+ if (i == __argc)
+ {
+	if (isatty (stdin))
+	 usage ();
+
+	Output_Format &= ~FILENAME;
+	grep (NULL, p);
+	return;
+ }
+
+ files = argvi:;
+
+ if (length(files) > 1)
+ Output_Format |= FILENAME;
+
+ foreach (files)
+ {
+	variable f = ();
+	grep (f, p);
+ }
+}
+
+public define slsh_main ()
+{
+ main (__argc, __argv);
+ exit (0);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/examples/newt_ex.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/examples/oniggrep Added

@@ -0,0 +1,136 @@
+#!/usr/bin/env slsh
+
+% This is a simple-minded implementation of a highlighting grep program
+% designed to test the onig module.
+require ("onig");
+require ("cmdopt");
+
+private define usage ()
+{
+ ()=fprintf(stderr, "Usage: %s -inl --syntax syntax pattern files...\n", __argv0);
+ exit (1);
+}
+
+private variable MATCH = 1;
+private variable LINENUM = 2;
+private variable FILENAME = 4;
+private variable Output_Format = 0;
+
+private define grep (file, p)
+{
+ variable fp;
+
+ if (file == NULL)
+ fp = stdin;
+ else
+ fp = fopen (file, "r");
+
+ if (fp == NULL)
+ {
+	fprintf (stderr, "*** Unable to open %s\n", file);
+	return;
+ }
+
+ variable linenum = 0;
+ foreach (fp) using ("line")
+ {
+	variable str = ();
+	linenum++;
+
+	if (onig_search (p, str))
+	 {
+	 variable i0, i1, i;
+
+	 switch (Output_Format)
+	 {
+		case FILENAME:
+		 () = fprintf (stdout, "%s\n", file);
+		 return;
+	 }
+	 {
+		case LINENUM:
+		 () = fprintf (stdout, "%d\n", linenum);
+		 continue;
+	 }
+	 {
+		case (MATCH|LINENUM):
+
+		 () = fprintf (stdout, "%d:", linenum);
+	 }
+	 {
+		case (LINENUM|FILENAME):
+		 () = fprintf (stdout, "%s:%d\n", file, linenum);
+		 continue;
+	 }
+	 {
+		case (LINENUM|FILENAME|MATCH):
+		 () = fprintf (stdout, "%s:%d:", file, linenum);
+	 }
+	 {
+		case (FILENAME|MATCH):
+		 () = fprintf (stdout, "%s:", file);
+	 }
+
+	 do
+	 {
+		 i = onig_nth_match (p, 0);
+		 i0 = i0;
+		 i1 = i1;
+		 if (i1 <= i0)
+		 break;
+		 if (i0 > 0)
+		 () = fprintf (stdout, "%s", str0:i0-1);
+		 () = fprintf (stdout, "\e7m%s\em", stri0:i1-1);
+		 str = stri1:;
+	 }
+	 while (onig_search (p, str));
+	 () = fprintf (stdout, "%s", str);
+	 }
+ }
+}
+
+define slsh_main ()
+{
+ variable options;
+ options = 0;
+ Output_Format = MATCH;
+ variable syntax = "perl";
+
+ variable opts = cmdopt_new ();
+ opts.add ("i", &options; bor=ONIG_OPTION_IGNORECASE);
+ opts.add ("n", &Output_Format; bor=LINENUM);
+ opts.add ("l", &Output_Format; bor=FILENAME, band=~MATCH);
+ opts.add ("h|help", &usage);
+ opts.add ("s|syntax", &syntax);
+
+ variable i = opts.process (__argv, 1);
+
+ if (i + 1 > __argc)
+ usage ();
+
+ variable pattern = __argvi;
+ i++;
+
+ variable reg = onig_new (pattern, options, "utf8", syntax);
+
+ if (i == __argc)
+ {
+	if (isatty (stdin))
+	 usage ();
+
+	Output_Format &= ~FILENAME;
+	grep (NULL, reg);
+	return;
+ }
+
+ variable files = __argvi:;
+
+ if (length(files) > 1)
+ Output_Format |= FILENAME;
+
+ foreach (files)
+ {
+	variable f = ();
+	grep (f, reg);
+ }
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/examples/slsmg_ex.sl Added

@@ -0,0 +1,68 @@
+require ("slsmg", "Global");	 % Global namespace
+
+private variable Button_Color = 3;
+private variable Box_Color = 2;
+private variable Normal_Color = 1;
+
+slsmg_define_color (Button_Color, "black", "brown");
+slsmg_define_color (Box_Color, "yellow", "cyan");
+slsmg_define_color (Normal_Color, "lightgray", "blue");
+
+private define display_button (name, r, c)
+{
+ slsmg_gotorc (r, c);
+ slsmg_set_color (Button_Color);
+ slsmg_write_string (" " + name + " ");
+ slsmg_set_color (Normal_Color);
+}
+
+private define draw_centered_string (s, r, c, dc)
+{
+ variable len;
+
+ len = strlen (s);
+ slsmg_gotorc (r, c + (dc - len)/2);
+ slsmg_write_string (s);
+}
+
+private define get_yes_no_cancel (question)
+{
+ variable r, c, dr, dc;
+
+ dc = strlen (question) + 5;
+ dr = 7;
+
+ % We also need room for the yes-no-cancel buttons
+ if (dc < 32) dc = 36;
+
+ r = (SLsmg_Screen_Rows - dr)/2;
+ c = (SLsmg_Screen_Cols - dc)/2;
+
+ slsmg_set_color (Box_Color);
+ slsmg_draw_box (r, c, dr, dc);
+ slsmg_set_color (Normal_Color);
+
+ r += 2;
+
+ draw_centered_string (question + "?", r, c, dc);
+
+ r += 2;
+ display_button ("Yes", r, c + 4);
+ display_button ("No", r, c + 14);
+ display_button ("Cancel", r, c + 24);
+}
+
+slsmg_write_to_status_line ("smg-module demo");
+slsmg_init_smg ();
+slsmg_set_color(Normal_Color);
+slsmg_erase_eos ();
+get_yes_no_cancel ("This demo will exit in 5 seconds");
+
+slsmg_refresh ();
+sleep (5);
+
+slsmg_write_to_status_line ("");
+
+%slsmg_reset_smg ();
+
+exit(0);

_service:tar_scm:slang-2.3.2.tar.bz2/modules/examples/varray_ex.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/fcntl-module.c Added

@@ -0,0 +1,147 @@
+/* Copyright (c) 2001-2017,2018 John E. Davis
+ * This file is part of the S-Lang library.
+ *
+ * You may distribute under the terms of either the GNU General Public
+ * License or the Perl Artistic License.
+ */
+
+#include <stdio.h>
+#include <slang.h>
+
+#include <unistd.h>
+#include <string.h>
+#include <fcntl.h>
+#include <errno.h>
+
+SLANG_MODULE(fcntl);
+
+static int check_and_set_errno (int e)
+{
+#ifdef EINTR
+ if (e == EINTR)
+ return 0;
+#endif
+ (void) SLerrno_set_errno (e);
+ return -1;
+}
+
+static int do_fcntl_2 (int fd, int cmd)
+{
+ int ret;
+
+ while ((-1 == (ret = fcntl (fd, cmd)))
+	 && (0 == check_and_set_errno (errno)))
+ ;
+
+ return ret;
+}
+
+static int do_fcntl_3_int (int fd, int cmd, int flags)
+{
+ int ret;
+
+ while ((-1 == (ret = fcntl (fd, cmd, flags)))
+	 && (0 == check_and_set_errno (errno)))
+ ;
+
+ return ret;
+}
+
+static int pop_fd (int *fdp)
+{
+ SLFile_FD_Type *f;
+ int status;
+
+ if (SLang_peek_at_stack () == SLANG_INT_TYPE)
+ return SLang_pop_int (fdp);
+
+ if (-1 == SLfile_pop_fd (&f))
+ return -1;
+
+ status = SLfile_get_fd (f, fdp);
+ SLfile_free_fd (f);
+ return status;
+}
+
+static int fcntl_getfd (void)
+{
+ int fd;
+
+ if (-1 == pop_fd (&fd))
+ return -1;
+
+ return do_fcntl_2 (fd, F_GETFD);
+}
+
+static int fcntl_setfd (int *flags)
+{
+ int fd;
+
+ if (-1 == pop_fd (&fd))
+ return -1;
+ return do_fcntl_3_int (fd, F_SETFD, *flags);
+}
+
+static int fcntl_getfl (void)
+{
+ int fd;
+
+ if (-1 == pop_fd (&fd))
+ return -1;
+
+ return do_fcntl_2 (fd, F_GETFL);
+}
+
+static int fcntl_setfl (int *flags)
+{
+ int fd;
+
+ if (-1 == pop_fd (&fd))
+ return -1;
+
+ return do_fcntl_3_int (fd, F_SETFL, *flags);
+}
+
+#define F SLANG_FILE_FD_TYPE
+#define I SLANG_INT_TYPE
+static SLang_Intrin_Fun_Type Fcntl_Intrinsics =
+{
+ MAKE_INTRINSIC_0("fcntl_getfd", fcntl_getfd, I),
+ MAKE_INTRINSIC_1("fcntl_setfd", fcntl_setfd, I, I),
+ MAKE_INTRINSIC_0("fcntl_getfl", fcntl_getfl, I),
+ MAKE_INTRINSIC_1("fcntl_setfl", fcntl_setfl, I, I),
+
+ SLANG_END_INTRIN_FUN_TABLE
+};
+#undef I
+#undef F
+
+static SLang_IConstant_Type Fcntl_Consts =
+{
+ MAKE_ICONSTANT("FD_CLOEXEC", FD_CLOEXEC),
+#ifndef O_ACCMODE
+# define O_ACCMODE (O_RDONLY | O_WRONLY | O_RDWR)
+#endif
+ MAKE_ICONSTANT("O_ACCMODE", O_ACCMODE),
+ SLANG_END_ICONST_TABLE
+};
+
+int init_fcntl_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns;
+
+ ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if ((-1 == SLns_add_intrin_fun_table (ns, Fcntl_Intrinsics, "__FCNTL__"))
+ || (-1 == SLns_add_iconstant_table (ns, Fcntl_Consts, NULL)))
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_fcntl_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/fcntl.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/fork-module.c Added

@@ -0,0 +1,314 @@
+/* -*- mode: C; mode: fold; -*- */
+/*
+Copyright (C) 2009-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "config.h"
+
+#include <stdio.h>
+#include <errno.h>
+#ifdef HAVE_SYS_TYPES_H
+# include <sys/types.h>
+#endif
+#ifdef HAVE_SYS_WAIT_H
+# include <sys/wait.h>
+#endif
+#include <unistd.h>
+
+#include <string.h>
+#include <slang.h>
+
+/* WCONTINUED is not defined on Hurd, in waitflags.h. */
+#ifndef WCONTINUED
+# define WCONTINUED 0		 /* Debian patch used 8, but 0 is safer */
+#endif
+SLANG_MODULE(fork);
+
+static int fork_intrinsic (void)
+{
+ int ret = fork ();
+ if (ret == -1)
+ (void) SLerrno_set_errno (errno);
+ return ret;
+}
+
+typedef struct
+{
+ int pid;
+ int exited;
+ int exit_status;
+ int signal;
+ int coredump;
+ int stopped;
+ int continued;
+}
+Waitpid_Type;
+
+static SLang_CStruct_Field_Type Waitpid_Struct =
+{
+ MAKE_CSTRUCT_FIELD(Waitpid_Type, pid, "pid", SLANG_INT_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(Waitpid_Type, exited, "exited", SLANG_INT_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(Waitpid_Type, exit_status, "exit_status", SLANG_INT_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(Waitpid_Type, signal, "signal", SLANG_INT_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(Waitpid_Type, coredump, "coredump", SLANG_INT_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(Waitpid_Type, stopped, "stopped", SLANG_INT_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(Waitpid_Type, continued, "continued", SLANG_INT_TYPE, 0),
+ SLANG_END_CSTRUCT_TABLE
+};
+
+static void waitpid_intrinsic (int *pid, int *options)
+{
+ int status, ret;
+ Waitpid_Type s;
+
+ while (-1 == (ret = waitpid ((pid_t)*pid, &status, *options)))
+ {
+	if (errno == EINTR)
+	 {
+	 if (-1 != SLang_handle_interrupt ())
+	 continue;
+	 }
+	(void) SLerrno_set_errno (errno);
+	(void) SLang_push_null ();
+	return;
+ }
+
+ memset ((char *)&s, 0, sizeof(Waitpid_Type));
+ if (WIFEXITED(status))
+ {
+	s.exited = 1;
+	s.exit_status = WEXITSTATUS(status);
+ }
+ if (WIFSIGNALED(status))
+ {
+	s.signal = WTERMSIG(status);
+#ifdef WCOREDUMP
+	s.coredump = WCOREDUMP(status) != 0;
+#endif
+ }
+ if (WIFSTOPPED(status))
+ s.stopped = WSTOPSIG(status);
+#ifdef WIFCONTINUED
+ s.continued = WIFCONTINUED(status);
+#endif
+ s.pid = ret;
+ (void) SLang_push_cstruct ((VOID_STAR)&s, Waitpid_Struct);
+}
+
+static char **pop_argv (SLang_Array_Type **atp)
+{
+ SLang_Array_Type *at;
+ char **argv;
+ SLuindex_Type i, num, argc;
+ char **strp;
+
+ *atp = NULL;
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_STRING_TYPE))
+ return NULL;
+
+ num = at->num_elements;
+ if (NULL == (argv = (char **)SLmalloc ((num+1)*sizeof(char *))))
+ {
+	SLang_free_array (at);
+	return NULL;
+ }
+
+ strp = (char **)at->data;
+ argc = 0;
+ for (i = 0; i < num; i++)
+ {
+	if (strpi != NULL)
+	 argvargc++ = strpi;
+ }
+ argvargc = NULL;
+ *atp = at;
+ return argv;
+}
+
+#define CALL_EXECV	1
+#define CALL_EXECVP	2
+#define CALL_EXECVE	3
+
+static int call_what (int what, char *path, char **argv, char **envp)
+{
+ while (1)
+ {
+	int ret;
+
+	switch (what)
+	 {
+	 case CALL_EXECV:
+	 ret = execv (path, argv);
+	 break;
+
+	 case CALL_EXECVP:
+	 ret = execvp (path, argv);
+	 break;
+
+	 case CALL_EXECVE:
+	 ret = execve (path, argv, envp);
+	 break;
+	 }
+
+	if (ret == 0)
+	 return 0;		 /* should never happen */
+
+	SLerrno_set_errno (errno);
+	if (errno == EINTR)
+	 {
+	 if (-1 != SLang_handle_interrupt ())
+	 continue;
+	 }
+	break;
+ }
+ return -1;
+}
+
+static int exec_what (int what, int has_envp)
+{
+ SLang_Array_Type *at_argv = NULL;
+ SLang_Array_Type *at_envp = NULL;
+ char **argv = NULL, **envp = NULL;
+ char *path = NULL;
+ int status = -1;
+
+ if (has_envp)
+ {
+	if (NULL == (envp = pop_argv (&at_envp)))
+	 goto free_and_return;
+ }
+
+ if (NULL == (argv = pop_argv (&at_argv)))
+ goto free_and_return;
+
+ if (-1 == SLang_pop_slstring (&path))
+ goto free_and_return;
+
+ status = call_what (what, path, argv, envp);
+
+free_and_return:
+
+ if (path != NULL) SLang_free_slstring (path);
+ if (argv != NULL) SLfree ((char *)argv);
+ if (at_argv != NULL) SLang_free_array (at_argv);
+ if (envp != NULL) SLfree ((char *)envp);
+ if (at_envp != NULL) SLang_free_array (at_envp);
+ return status;
+}
+
+static int execv_intrin (void)
+{
+ if (SLang_Num_Function_Args != 2)
+ SLang_verror (SL_Usage_Error, "Usage: ret = execv(path, argv);");
+
+ return exec_what (CALL_EXECV, 0);
+}
+
+static int execvp_intrin (void)
+{
+ if (SLang_Num_Function_Args != 2)
+ SLang_verror (SL_Usage_Error, "Usage: ret = execvp(path, argv);");
+
+ return exec_what (CALL_EXECVP, 0);
+}
+
+static int execve_intrin (void)
+{
+ if (SLang_Num_Function_Args != 3)
+ SLang_verror (SL_Usage_Error, "Usage: ret = execve(path, argv, env);");
+
+ return exec_what (CALL_EXECVE, 1);
+}
+
+static void _exit_intrin (int *s)
+{
+ (void) fflush (stdout);
+ (void) fflush (stderr);
+ _exit (*s);
+}
+
+static void pipe_intrin (void)
+{
+ int fds2;
+ SLFile_FD_Type *f0;
+ SLFile_FD_Type *f1;
+
+ while (-1 == pipe (fds))
+ {
+	if (errno == EINTR)
+	 {
+	 if (-1 != SLang_handle_interrupt ())
+	 continue;
+	 }
+	SLerrno_set_errno (errno);
+	SLang_verror (SL_OS_Error, "pipe failed: %s", SLerrno_strerror(errno));
+	return;
+ }
+
+ f0 = SLfile_create_fd ("*pipe*", fds0);
+ f1 = SLfile_create_fd ("*pipe*", fds1);
+ if ((NULL != f0) && (NULL != f1))
+ {
+	/* Ignore errors and allow the free_fd routines to clean up */
+	(void) SLfile_push_fd (f0);
+	(void) SLfile_push_fd (f1);
+ }
+ SLfile_free_fd (f1);
+ SLfile_free_fd (f0);
+}
+
+static SLang_IConstant_Type Module_IConstants =
+{
+ MAKE_ICONSTANT("WNOHANG", WNOHANG),
+ MAKE_ICONSTANT("WUNTRACED", WUNTRACED),
+ MAKE_ICONSTANT("WCONTINUED", WCONTINUED),
+ SLANG_END_ICONST_TABLE
+};
+
+static SLang_Intrin_Fun_Type Module_Intrinsics =
+{
+ MAKE_INTRINSIC_0("fork", fork_intrinsic, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_2("waitpid", waitpid_intrinsic, SLANG_VOID_TYPE, SLANG_INT_TYPE, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_0("execv", execv_intrin, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_0("execvp", execvp_intrin, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_0("execve", execve_intrin, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_0("pipe", pipe_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_1("_exit", _exit_intrin, SLANG_VOID_TYPE, SLANG_INT_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+int init_fork_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if ((-1 == SLns_add_intrin_fun_table (ns, Module_Intrinsics, NULL))
+ || (-1 == SLns_add_iconstant_table (ns, Module_IConstants, NULL)))
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_fork_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/fork.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/help Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/help/base64funs.hlp Added

@@ -0,0 +1,211 @@
+_base64_decoder_accumulate
+
+ SYNOPSIS
+  Accumulate data to be base64 decoded
+
+ USAGE
+  _base64_decoder_accumulate(Base64_Type b64, String_Type data)
+
+ DESCRIPTION
+  This routine adds a tring to the base64 decoder queue of the
+  specifed Base64_Type object, previously instantiated using the
+  `_base64_decoder_new'.
+
+  See the documentation for `_base64_decoder_new' for more
+  detailed usage.
+
+ SEE ALSO
+  _base64_decoder_new, _base64_decoder_close, _base64_encoder_new
+
+--------------------------------------------------------------
+
+_base64_decoder_new
+
+ SYNOPSIS
+  Intantiate a new base64 decoder
+
+ USAGE
+  Base64_Type _base64_decoder_new (Ref_Type func ,func_data)
+
+ DESCRIPTION
+  This routine returns instantiates a Base64_Type decoder object that
+  may be used to decode base64 data.  It require a single
+  `Ref_Type' parameter that is a reference to a callback function
+  that the decoder will call with with (partially) decoded data.  The second
+  argument, `func_data', is optional.  If present it will also be
+  passed to the callback function.
+
+  The callback function must be defined to accept one or two
+  parameters, depending upon whether the `_base64_decoder_new' function
+  was called with the optional `func_data' argument.  If
+  `func_data' was passed, then it will be passed as the first
+  argument to the callback function.  The (partially) encoded string
+  is passed as the last argument.  The callback function shall return
+  nothing.
+
+ EXAMPLE
+  The following example defines a function that base64-decodes a string.
+
+   private define decode_callback (strp, decoded_str)
+   {
+     @strp = @strp + decoded_str;
+   }
+
+   define b64decode_string (str)
+   {
+     variable b = ""B;     % The decoded string is binary
+     variable b64 = _base64_decoder_new (&decode_callback, &b);
+     _base64_decoder_accumulate (b64, str);
+     _base64_decoder_close (b64);
+     return b;
+   }
+
+
+ EXAMPLE
+  The following example takes data from an input file pointer
+  `fpin' and writes the decoded data to an output file pointer
+  `fpout':
+
+   private define decoder_callback (fpout, data)
+   {
+      () = fwrite (data, fpout);
+   }
+
+   define base64_decode_file (fpin, fpout)
+   {
+      variable b64 = _base64_decoder_new (&encoder_callback, fpout);
+      variable line;
+      while (-1 != fgets (&line, fpin))
+        _base64_decoder_accumulate (b64, line);
+      _base64_decoder_close (b64);
+   }
+
+
+ SEE ALSO
+  _base64_decoder_accumulate, _base64_decoder_close, _base64_encoder_new
+
+--------------------------------------------------------------
+
+_base64_decoder_close
+
+ SYNOPSIS
+  Flush and delete a base64 decoder
+
+ USAGE
+  _base64_decoder_close (Base64_Type b64)
+
+ DESCRIPTION
+  This function must be called when there is no more data for the
+  specified base64 decoder to process.  See the documentation for
+  `_base64_decoder_new' for additional information and usage.
+
+ SEE ALSO
+  _base64_decoder_new, _base64_decoder_accumulate, _base64_encoder_close
+
+--------------------------------------------------------------
+
+_base64_encoder_accumulate
+
+ SYNOPSIS
+  Accumulate data to be base64 encoded
+
+ USAGE
+  _base64_encoder_accumulate(Base64_Type b64, BString_Type data)
+
+ DESCRIPTION
+  This routine adds a binary string to the encoder queue of the
+  specifed Base64_Type object, previously instantiated using the
+  `_base64_encoder_new'.
+
+  See the documentation for `_base64_encoder_new' for more
+  detailed usage.
+
+ SEE ALSO
+  _base64_encoder_new, _base64_encoder_close, _base64_decoder_new
+
+--------------------------------------------------------------
+
+_base64_encoder_new
+
+ SYNOPSIS
+  Intantiate a new base64 encoder
+
+ USAGE
+  Base64_Type _base64_encoder_new (Ref_Type func ,func_data)
+
+ DESCRIPTION
+  This routine returns instantiates a Base64_Type decoder object that
+  may be used to base64-encode data.  It require a single
+  `Ref_Type' parameter that is a reference to a callback function
+  that the encoder will call with the data to be encoded.  The second
+  argument, `func_data', is optional.  If present it will also be
+  passed to the callback function.
+
+  The callback function must be defined to accept one or two
+  parameters, depending upon whether the `_base64_encoder_new' function
+  was called with the optional `func_data' argument.  If
+  `func_data' was passed, then it will be passed as the first
+  argument to the callback function.  The (partially) encoded string
+  is passed as the last argument.  The callback function shall return
+  nothing.
+
+ EXAMPLE
+  The following example defines a function that base64 encodes a string.
+
+   private define encode_callback (strp, encoded_str)
+   {
+     @strp = @strp + encoded_str;
+   }
+
+   define b64encode_string (bstr)
+   {
+     variable s = "";
+     variable b64 = _base64_encoder_new (&encode_callback, &s);
+     _base64_encoder_accumulate (b64, bstr);
+     _base64_encoder_close (b64);
+     return b;
+   }
+
+
+ EXAMPLE
+  The following example takes data from an input file pointer
+  `fpin' and writes the encoded data to an output file pointer
+  `fpout':
+
+   private define encoder_callback (fpout, encoded_data)
+   {
+      () = fputs (encoded_data, fpout);
+   }
+
+   define define base64_encode_file (fpin, fpout)
+   {
+      variable b64 = _base64_encoder_new (&encoder_callback, fpout);
+      variable bytes;
+      while (-1 != fread_bytes (&bytes, 512, fpin))
+        _base64_encoder_accumulate (b64, bytes);
+      _base64_encoder_close (b64);
+   }
+
+
+ SEE ALSO
+  _base64_encoder_accumulate, _base64_encoder_close, _base64_decoder_new
+
+--------------------------------------------------------------
+
+_base64_encoder_close
+
+ SYNOPSIS
+  Flush and delete a base64 encoder
+
+ USAGE
+  _base64_encoder_close (Base64_Type b64)
+
+ DESCRIPTION
+  This function must be called when there is no more data for the
+  specified base64 encoder to process.  See the documentation for
+  `_base64_encoder_new' for additional information and usage.
+
+ SEE ALSO
+  _base64_encoder_new, _base64_encoder_accumulate, _base64_decoder_close
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/modules/help/chksumfuns.hlp Added

@@ -0,0 +1,75 @@
+md5sum
+
+ SYNOPSIS
+  Compute an MD5 sum for a string
+
+ USAGE
+  String_Type md5sum (BString_Type bstr)
+
+ DESCRIPTION
+  The `md5sum' function computes the MD5 checksum for the
+  specified binary string.  The function returns a string representing
+  the hexadecimal representation of the checksum.
+
+ SEE ALSO
+  md5sum_file, sha1sum
+
+--------------------------------------------------------------
+
+md5sum_file
+
+ SYNOPSIS
+  Compute the MD5 sum for the contents of a file
+
+ USAGE
+  String_Type md5sum_file (String_Type|File_Type f)
+
+ DESCRIPTION
+  The `md5sum_file' computes the MD5 sum on the contents of a
+  file.  The file may either be specified as a string giving the name
+  of the file, or as an open stdio File_Type pointer.  The
+  function returns a string representing the hexadecimal
+  representation of the checksum.
+
+ SEE ALSO
+  md5sum, sha1sum_file, sha1sum
+
+--------------------------------------------------------------
+
+sha1sum
+
+ SYNOPSIS
+  Compute the SHA1 sum for a string
+
+ USAGE
+  String_Type sha1sum (BString_Type bstr)
+
+ DESCRIPTION
+  The `sha1sum' function computes the SHA1 checksum for the
+  specified binary string.  The function returns a string representing
+  the hexadecimal representation of the checksum.
+
+ SEE ALSO
+  sha1sum_file, md5sum
+
+--------------------------------------------------------------
+
+sha1sum_file
+
+ SYNOPSIS
+  Compute the SHA1 sum for the contents of a file
+
+ USAGE
+  String_Type sha1sum_file (String_Type|File_Type f)
+
+ DESCRIPTION
+  The `sha1sum_file' computes the SHA1 sum on the contents of a
+  file.  The file may either be specified as a string giving the name
+  of the file, or as an open stdio File_Type pointer.  The
+  function returns a string representing the hexadecimal
+  representation of the checksum.
+
+ SEE ALSO
+  sha1sum, md5sum_file, md5sum
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/modules/help/csvfuns.hlp Added

@@ -0,0 +1,431 @@
+csv_decoder_new
+
+ SYNOPSIS
+  Instantiate a parser for CSV data
+
+ USAGE
+  obj = csv_decoder_new (filename|File_Type|Strings)
+
+ DESCRIPTION
+  This function instantiates an object that may be used to parse and
+  read so-called comma-separated-value (CSV) data.  It requires a
+  single argument, which may be the name of a file, an open file
+  pointer, or an array of strings.
+
+ QUALIFIERS
+  ; delim: character used for the delimiter (default: ',')
+  ; quote: character used for the quoting fields (default: '"')
+  ; skiplines: number of lines to skip before parsing (default: 0)
+  ; comment: lines beginning with this string will be skipped
+  ; blankrows: default for how blank rows should be handled (default: "skip")
+
+ METHODS
+  .readrow : Read and parse a row from the CSV object
+  .readcol : Read one or more columns from the CSV object
+
+ EXAMPLE
+  See the documentation for the `csv.readcol' and
+  `csv.readrow' methods for examples.
+
+ NOTES
+  The current implementation assumes the CSV format specified according
+  to RFC 4180.
+
+  It is important to understand the difference between a ROW and a LINE
+  in a CSV formatted file: a row may span more than one line in a file.
+  The `skiplines' qualifier specifies the number of LINES to be
+  skipped, not ROWS.
+
+  CSV files have no notion of data-types: all field values are strings.
+  For this reason, the `type' qualifier introduces an extra layer
+  that is not part CSV format.
+
+ SEE ALSO
+  csv.readcol, csv.readrow
+
+--------------------------------------------------------------
+
+csv.readcol
+
+ SYNOPSIS
+  Read one or more columns from a CSV file
+
+ USAGE
+  datastruct = csv.readcol(columns)
+
+ DESCRIPTION
+  This function method may be used to read one or more columns from a
+  comma-separated-value file.  If passed with no arguments, all columns
+  of the file will be returned.  Otherwise, only those columns
+  specified by the columns argument will be returned.
+
+  The return value is a structure with fields that correspond to the
+  desired columns.  The default is for the structure to have field
+  names `col1', `col2', etc., where the integer suffix
+  specifies the column number.  The `fields' and `header'
+  qualifiers may be used to specify a different set of names.
+
+ QUALIFIERS
+    ; fields: An array of field names to use for the returned structure
+    ; header: Array of strings that correspond to the header row
+    ; type: An scalar or array type-specifier, see below
+    ; typeN: Type-specifier for column N
+    ; snan: String value to use for an empty string element (default: "")
+    ; inan: Integer value to use for an empty integer element (default: 0)
+    ; lnan: Long int value to use for an empty long int element (default: 0L)
+    ; fnan: Float value to use for an empty float element (default: _NaN)
+    ; dnan: Double value to use for an empty double element (default: _NaN)
+    ; nanN: Value used for an empty element in the column N
+    ; blankrows: How a blank row should be handled (default: "skip")
+
+  The type-specifier is used to specify the type of a field.  It must
+  be one of the following characters:
+
+     's' (String_Type)
+     'i' (Int_Type)
+     'l' (Long_Type)
+     'f' (Float_Type)
+     'd' (Double_Type)
+
+  If the value of the `type' qualifier is scalar, then all
+  columns will default to use the corresponding type.  If different
+  types are desired, then an array of type-specifiers may be used.
+  The length of the array must be the same as the number of columns to
+  be returned.  The `typeN' qualifier may be used to give the
+  type of column N.
+
+  If the `columns' argument is string-valued, then the
+  `header' qualifier must be supplied to provide a mapping
+  from column names to column numbers.  If it is present, it will also
+  be used to give normalized field names to the returned structure.
+  For normalization, the column name is first lower-cased, then all
+  non-alphanumeric values are converted to "_",  and excess underscore
+  characters removed.
+
+  See the documentation for the `csv.readrow' for more
+  information about how blank rows should be handled.
+
+ EXAMPLE
+  Suppose that `data.csv' is a file that contains
+
+    # The data below are from runs 6 and 7
+    x,y,errx,erry,Notes - or - Comments
+    10.2,0.5,,0.1,
+    13.4,0.9,0.1,0.16,
+    20.7,18.2,,0.3,Vacuum leak in beam line
+    29.6,1.3,,0.31,
+    31.2,1.2,0.11,0.33,"This data point
+    taken from run 7"
+
+  This file consists of 8 lines and forms a CSV file with 6 rows.
+  The first row consists of a single column, and the subsequent rows of
+  consist of 5 columns. columns.  Note that the last row is split
+  across two lines.  The row with the single column will be regarded as
+  a comment in what follows.
+
+  The first step is to instantiate a parser object using:
+
+    csv = csv_decoder_new ("data.csv" ;comment="#");
+
+  The use of the `comment' qualifier will cause all lines
+  beginning with `"#"' to be skipped.  Alternatively, the first
+  line could have been skipped using
+
+    csv = csv_decoder_new ("data.csv" ;skiplines=1);
+
+  The second row (also second line) in the file is the header line:
+  it gives the names of the columns.  It may be read using
+
+    header = csv.readrow ();
+
+  The rest of the file consists of the data values.  We want to read
+  the first 4 columns as single precision (Float_Type) values,
+  and the 5th as a string.  One way to do this is
+
+    table = csv.readcol (;type='f','f','f','f','s');
+
+  This will result in `table' set to a structure of the form
+
+   struct { col1 = Float_Type5,
+            col2 = Float_Type5,
+            col3 = Float_Type5,
+            col4 = Float_Type5,
+            col5 = String_Type5
+          }
+
+  The same result could also have been achieved using
+
+    table = csv.readcol (;type='f', type5='s');
+
+  If the `header' qualifier is used, then
+
+    table = csv.readcol (;type='f', type5='s', header=header);
+
+  would produce the structure
+
+   struct {x=Float_Type5,
+           y=Float_Type5,
+           errx=Float_Type5,
+           erry=Float_Type5,
+           notes_or_comments=String_Type5
+          }
+
+  Note how the "Notes -or- Comments" value was normalized.
+
+  To read just the `x' and `y' columns, either of the
+  following may be used:
+
+    table = csv.readcol (1,2 ;type='f');
+    table = csv.readcol ("x","y" ;type='f', header=header);
+
+  The `header' qualifier was required in the last form to map the
+  column names to numbers.
+
+ SEE ALSO
+  csv_decoder_new, csv_readcol, readascii
+
+--------------------------------------------------------------
+
+csv.readrow
+
+ SYNOPSIS
+  Read a row from a CSV file
+
+ USAGE
+  row = csv.readrow ()
+
+ DESCRIPTION
+  The `csv.readrow' function method may be used to read the next
+  row from the underlying CSV (comma-separated-value) parser object.
+  The object must have already been instantiated using the
+  `csv_decoder_new' function.  It returns the row data in the form
+  of an array of strings.  If the end of input it reached, NULL will
+  be returned.
+
+ QUALIFIERS
+  ; blankrows: How a blank row should be handled (default: "skip")
+
+  The `blankrows' qualifier is used to specify how a blank row
+  should be handled.  A blankrow is defined as a row made up of no
+  characters except for the newline or carriage-return sequence.  For
+  example, the following 9 lines has one blank row that occurs on
+  line 8:
+
+     "12.3"
+     "4
+
+     5"
+     "5.1"
+     ""
+     "7.2"
+
+     "6.2"
+
+  If the value of `"blankrow"' is `"skip"', then blank rows
+  will be ignored by the parser.  If the value is `"stop"', then the row
+  will be returned as an empty array of strings (length equal to 0).
+  Otherwise the row will be treated as if it contained the empty
+  string and returned as an array of length 1 with a value of "".
+  The default behavior is to skip such rows.
+
+ SEE ALSO
+  csv_decoder_new, csv.readcol, csv_readcol
+
+--------------------------------------------------------------
+
+csv_readcol
+
+ SYNOPSIS
+  Read one or more columns from a CSV file
+
+ USAGE
+  Struct_Type csv_readcol (file|fp ,columns ;qualifiers)
+
+ DESCRIPTION
+  This function may be used to read one or more of the columns in the specified
+  CSV file.  If the `columns' argument is present, then only those
+  columns will be read; otherwise all columns in the file will be read.
+  The columns will be returned in the form of a structure.
+
+ QUALIFIERS
+  This function supports all of the qualifiers supported by the
+  `csv_decoder_new' function and the `csv.readcol' method.
+  In addition, if the `has_header' qualifier is present, the first
+  line processed (after skipping any lines implied by the
+  `skiplines' and `comment' qualifiers) will be regarded as
+  the header.
+
+  If the `rdb' qualifier is present, then assume that the file is
+  in the so-called RDB file format.  This is a tab-delimited format
+  that consists of a line that contains the names of the fields,
+  followed by a line that specifies the data types of the columns.
+
+ EXAMPLE
+
+   data = csv_readcol ("mirror.csv" ;comment="#", has_header, delim='|');
+   data = csv_readcol ("foo.rdb" ; rdb);
+
+
+ SEE ALSO
+  csv_decoder_new, csv.readcol, csv.readrow, csv.writecol, csv_encoder_new
+
+--------------------------------------------------------------
+
+csv_encoder_new
+
+ SYNOPSIS
+  Create an object for writing CSV files
+
+ USAGE
+  csv = csv_encoder_new ()
+
+ DESCRIPTION
+  The `csv_encoder_new' function returns an object that may
+  be used for creating a CSV file.
+
+ QUALIFIERS
+  ; delim: Character used for the field delimiter (default: ',')
+  ; quote: Character used for quoting fields (default: '"')
+  ; quoteall: Quote all field values
+  ; quotesome: Quote only those fields where quoting is necessary
+
+ METHODS
+  .writecol : write one or more columns to a file.  For more information
+  about this method, see the documentation for `csv.writecol'.
+
+ EXAMPLE
+    x = 0:2*PI:#100;
+    csv = csv_encoder_new (;delim='|');
+    csv.writecol ("sinx.csv", x, sin(x) ; names="x", "sin of x");
+
+ NOTES
+  The `set_float_format' function may be used to specify the
+  format used where writing floating point numbers to the CSV file.
+
+ SEE ALSO
+  csv_writecol, csv_encoder_new, csv_readcol
+
+--------------------------------------------------------------
+
+csv_writecol
+
+ SYNOPSIS
+  Write to a file using a CSV format
+
+ USAGE
+  csv_writecol(file|fp, datalist | datastruct | col1,...,colN)
+
+ DESCRIPTION
+  This function write a one or more data columns to a file or open
+  file descriptor using a comma-separated-value format.  The data
+  values may be expressed in several ways: as a list of a column
+  values (`datalist'), a structure whose fields specify the
+  column values (`datastruct'), or passed explicitly as
+  individual values (`col1',...`colN').
+
+ QUALIFIERS
+  ; delim: character used for the delimiter (default: ',')
+  ; names: An array of strings used to name the columns
+  ; noheader: Do not write a header to the file
+  ; quote: character used for the quoting fields (default: '"')
+  ; quoteall: Quote all field values
+  ; quotesome: Quote only those fields where quoting is necessary
+  ; rdb: Write in an rdb-style TAB delimited format
+
+  Unless the `noheader' qualifier is given, a header containing
+  the names of the columns will be written if either the `names'
+  qualifier is present, or the data values are passed as a structure.
+  In the latter case, the structure field names will be used for the
+  column names.
+
+  The function will throw an `IOError' exception if a write error occurs.
+
+ EXAMPLE
+  For the purposes of this example, assume that three arrays are
+  given: `time', `temp', `humidity', which represent a
+  time series of temperature and humidity.  Here are three equivalent
+  ways of writing the arrays to a CSV file:
+
+     % Via a structure
+     data = struct {time=time, temperature=temp, humidity=humidity};
+     csv_writecol ("weather.dat", data);
+
+     % Via a list
+     data = {time, temp, humidity};
+     csv_writecol ("weather.dat", data
+                   ;names="time","temperature","humidity");
+
+     % Via explicit arguments
+     csv_writecol ("weather.dat", time, temp, humidity
+                   ;names="time","temperature","humidity");
+
+
+ NOTES
+  This function is a simple wrapper around `csv_encoder_new' and
+  `csv.writecol'.
+
+ SEE ALSO
+  csv_encoder_new, csv.writecol, csv_readcol
+
+--------------------------------------------------------------
+
+csv.writecol
+
+ SYNOPSIS
+  Write to a file using a CSV format
+
+ USAGE
+  csv.writecol(file|fp, datalist | datastruct | col1,...,colN)
+
+ DESCRIPTION
+  The `csv.writecol' function method may be used to write one of
+  more data columns to a file or file descriptor via a CSV encoder
+  object instantiated using the `csv_encoder_new' function.
+
+  The data values may be expressed in several ways: as a list of a
+  column values (`datalist'), a structure whose fields specify
+  the column values (`datastruct'), or passed explicitly as
+  individual values (`col1',...`colN').
+
+  An `IOError' exception will be thrown if a write error occurs.
+
+ QUALIFIERS
+  ; delim: character used for the delimiter (default: ',')
+  ; names: An array of strings used for names of the columns
+  ; noheader: Do not write a header to the file
+  ; quoteall: Quote all field values
+  ; quotesome: Quote only those fields where quoting is necessary
+  ; rdb: Write in an rdb-style TAB delimited format
+
+  Unless the `noheader' qualifier is given, a header containing
+  the names of the columns will be written if either the `names'
+  qualifier is present, or the data values are passed as a structure.
+  In the latter case, the structure field names will be used for the
+  column names.
+
+ EXAMPLE
+  For the purposes of this example, assume that three arrays are
+  given: `time', `temp', `humidity', which represent a
+  time series of temperature and humidity.  Here are three equivalent
+  ways of writing the arrays to a TAB delimited file:
+
+     csv = csv_encoder_new (;quote='\t');
+
+     % Via a structure
+     data = struct {time=time, temperature=temp, humidity=humidity};
+     csv.writecol ("weather.dat", data);
+
+     % Via a list
+     data = {time, temp, humidity};
+     csv.writecol ("weather.dat", data
+                   ;names="time","temperature","humidity");
+
+     % Via explicit arguments
+     csv.writecol ("weather.dat", time, temp, humidity
+                   ;names="time","temperature","humidity");
+
+
+ SEE ALSO
+  csv_encoder_new, csv_writecol, csv_readcol
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/modules/help/forkfuns.hlp Added

@@ -0,0 +1,178 @@
+fork
+
+ SYNOPSIS
+  Create a new process via the fork system function
+
+ USAGE
+  Int_Type fork ()
+
+ DESCRIPTION
+ The `fork' function creates a new child process via the
+ `fork' system function.  See the approriate documentation for
+ the actual semantics involved such as what is preserved in the child
+ process.  Upon sucess, the function returns a value that is greater
+ than 0 to the parent process that represents the child process's id.
+ It will return 0 to the child process.  If the fork function fails, a
+ value of -1 will be returned and `errno' set accordingly.
+
+ EXAMPLE
+ The following example creates a child process to invoke the ``ls''
+ command on a Unix system.  It also illustrates the low-level nature
+ of the `fork' and related system calls.
+
+    define ls ()
+    {
+       variable pid = fork ();
+       if (pid == -1)
+         throw OSError, "fork failed: " + errno_string(errno);
+
+       if ((pid == 0)
+            && (-1 == execvp ("ls", "ls", "-l")))
+         {
+           () = fprintf (stderr, "execvp failed: " + errno_string(errno));
+           _exit (1);
+         }
+
+       forever
+         {
+           variable status = waitpid (pid, 0);
+           if (status == NULL)
+             {
+               if (errno == EINTR) continue;
+               throw OSError, "waitpid failed: " + errno_string(errno);
+             }
+           return status.exit_status;
+         }
+     }
+
+
+ SEE ALSO
+  waitpid, execv, execvp, execve, _exit, system
+
+--------------------------------------------------------------
+
+execve, execv, execvp
+
+ SYNOPSIS
+  Execute a new process
+
+ USAGE
+  Int_Type execve(path, argv, envp)
+
+  Int_Type execvp(path, argv)}
+  Int_Type execv(path, argv)}
+
+
+ DESCRIPTION
+  The `execv' family of functions overlay the current process
+  with a new process that corresponds to the program specified by the
+  `path' argument.  If for some reason the function fails, a
+  value of -1 will be returned with `errno' set accordingly.
+  Normally the function will not return.
+
+  The `argv' parameter is an array of strings that will
+  correspond to the argument list used when invoking the program.  For
+  example, if the invoked program is a C program, the `argv'
+  parameter will correspond to the C program's argv-list.
+
+  The `execve' function takes an array of strings that will be
+  used to initialize the environment of the overlayed program.
+
+  The `execvp' function will mimick the actions `/bin/sh' when
+  searching for the executable file.
+
+ NOTES
+  These function are wrappers around the corresponding system library
+  functions.  See the system documentation for more information.
+
+ SEE ALSO
+  execve, execvp, system, fork, _exit
+
+--------------------------------------------------------------
+
+_exit
+
+ SYNOPSIS
+  Exit the current processes
+
+ USAGE
+  _exit(Int_Type status)
+
+ DESCRIPTION
+  Like the related `exit' function, `_exit' may be used to
+  terminate the current process.  One of the differences between the two
+  functions is that the `_exit' will not invoke various ``atexit''
+  handlers that are normally run when a program is terminated.  See
+  the system-specific C runtime library documentation for more
+  information about this function.
+
+  The main use of the `_exit' function is after the failure of
+  one of the `execv' functions in a child process.
+
+ SEE ALSO
+  fork, execv, execvp, execve, waitpid, exit
+
+--------------------------------------------------------------
+
+waitpid
+
+ SYNOPSIS
+  Wait for a specified process
+
+ USAGE
+  Struct_Type waitpid (pid, options)
+
+ DESCRIPTION
+  The `waitpid' function will cause the calling process to wait
+  for the child process whose process id is `pid' to change its
+  state, e.g., exit.  It returns information about the process in the
+  form of a structure with the following fields:
+
+    pid           The process-id of the child process, 0 if the process
+                    has not changed state.
+    exited        Non-zero if the child exited normally.
+    exit_status   The exit status of the child.  This field is
+                    meaninful only if the exited field is non-zero.
+    signal        Non-zero of the child was terminated by a signal.
+                    The value of this field is that of the signal.
+    coredump      Non-zero if the child produced a core-dump as the
+                    result of termination by a signal.
+    stopped       Non-zero if the child was stopped via a signal.  The
+                    value is that of the signal that stopped it.
+    continued     Non-zero if the process was continued.
+
+
+  Upon error, the function will return NULL and set `errno'
+  accordingly.
+
+  The value of the `options' parameter is the bitwise-or of one
+  of the following values:
+
+    WNOHANG      causes waitpid to return immediately if the child has
+                  not terminated.  In this case, the value of the pid
+                  field will be 0 if the child is still running.
+
+    WUNTRACED    (see semantics in the OS documentation)
+    WCONTINUED   (see semantics in the OS documentation)
+
+
+ EXAMPLE
+
+   s = waitpid (pid, WNOHANG);
+   if (s == NULL)
+     throw OSError, "waitpid failed: " + errno_string ();
+   if (s.pid == 0)
+     message ("The child is still running");
+   else if (s.exited)
+     vmessage ("child exited with status %d", s.exit_status);
+   else if (s.signal)
+     {
+        vmessage ("child terminated by signal %d %s",
+                  s.signal, (s.coredump ? "(coredump)" : ""));
+     }
+
+
+ SEE ALSO
+  fork, new_process
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/modules/help/histfuns.hlp Added

@@ -0,0 +1,217 @@
+hist1d
+
+ SYNOPSIS
+ Compute a 1-d histogram
+
+ USAGE
+ h = hist1d (h, pnts, grid , &rev)
+
+ DESCRIPTION
+ The `hist1d' function bins a set of points `pnts' into a
+ 1-d histogram using bin-edges given by the grid argument. The
+ optional last argument `&rev' is a reference to a variable
+ whose value will be assigned the reverse-indices of the histogram.
+
+ The first argument `h' is optional. If present and non-NULL, it
+ will be used as the histogram buffer with new binned values added to
+ it. That is, the following statements are equivalent:
+
+ h = h + hist1d (pnts, grid);
+ h = hist1d (h, pnts, grid);
+
+
+ The value of the ith bin in the histogram is given by the number of
+ values in the `pnts' array that satisfy
+ `gridi<=X<gridi+1' where `X' represents the value of
+ the candidate point. The last bin of the histogram represents an
+ overflow bin with the right bin edge at plus infinity. The grid is
+ required to be sorted into ascending order.
+
+ The reverse-indices array is an array-of-arrays of indices such that
+ `revi' is an array of indices into the `pnts' array that
+ have fallen into the ith bin.
+
+ SEE ALSO
+ hist1d_rebin, hist2d, hist2d_rebin, hist_bsearch
+
+--------------------------------------------------------------
+
+hist2d
+
+ SYNOPSIS
+ Compute a 2-d histogram
+
+ USAGE
+ h = hist2d (h, xpnts, ypnts, xgrid, ygrid , &rev)
+
+ DESCRIPTION
+ The `hist2d' function bins a set of `(x,y)' pairs
+ represented by the `xpnts' and `ypnts' arrays into a 2-d
+ histogram using bin-edges given by the `xgrid' and `ygrid'
+ arguments. The optional last argument `&rev' is a reference to
+ a variable whose value will be assigned the reverse-indices of the
+ histogram. The first argument is also optional and, if present and
+ non-NULL, will be used for the histogram values.
+
+ The value of the bin `i,j' of the histogram is given by the
+ number of (X,Y) pairs that satisfy `xgridi<=X<xgridi+1' and
+ `ygridj<=Y<ygridj+1'. The bins at the extreme edges of the
+ histogram represent overflow bins with the upper bin edge at plus
+ infinity. The grids are required to be sorted into ascending order.
+
+ The reverse-indices array is a 2-d array-of-arrays of indices such that
+ `revi,j' is an array of indices into the `xpnts' and
+ `ypnts' arrays that have fallen into the bin `i,j'.
+
+ SEE ALSO
+ hist1d, whist2d, hist2d_rebin, hist1d_rebin, hist_bsearch
+
+--------------------------------------------------------------
+
+hist1d_rebin
+
+ SYNOPSIS
+ Rebin a 1-d histogram
+
+ USAGE
+ new_h = hist1d_rebin (new_grid, old_grid, old_h)
+
+ DESCRIPTION
+ The `hist1d_rebin' function rebins a histogram `old_h'
+ with bin edges defined by `old_grid' into a histogram with bin
+ edges given by `new_grid'. The rebinning operation preserves
+ the normalization of the histogram where the grids overlap.
+
+ Unlike the `hist1d' function which returns an integer array,
+ the `hist1d_rebin' function returns an array of doubles since
+ the new grid does not have to be commensurate with the old grid.
+
+ SEE ALSO
+ hist1d, hist2d_rebin, hist2d, hist_bsearch
+
+--------------------------------------------------------------
+
+hist2d_rebin
+
+ SYNOPSIS
+ Rebin a 2-d histogram
+
+ USAGE
+ new_h = hist2d_rebin (new_xgrid, new_ygrid, old_xgrid, old_ygrid, old_h)
+
+ DESCRIPTION
+ The `hist2d_rebin' function rebins a 2-d histogram `old_h'
+ with bin edges defined by `old_xgrid' and `old_ygrid' into
+ a 2-d histogram with bin edges given by `new_xgrid' and
+ `new_ygrid'.
+
+ Unlike the `hist2d' function which returns an integer array,
+ the `hist2d_rebin' function returns an array of doubles since
+ the new grids do not have to be commensurate with the old grids.
+
+ SEE ALSO
+ hist1d_rebin, hist2d, whist2d, hist_bsearch
+
+--------------------------------------------------------------
+
+hist_bsearch
+
+ SYNOPSIS
+ Perform a binary search
+
+ USAGE
+ i = hist_bsearch (x, xbins)
+
+ DESCRIPTION
+ The `hist_bsearch' function performs a binary search for the
+ bin `i' satisfying `xbinsi<=x<xbinsi+1'. If the value
+ `x' is greater than or equal to the value of the last bin, the
+ index of the last bin will be returned. If `x' is smaller than
+ the value of the first bin (`xbins0'), then the function will
+ return the index of the first bin, i.e., `0'. The grid is
+ required to be sorted into ascending order.
+
+ If the value of `x' is an array, an array of indices will be
+ returned.
+
+ NOTES
+ As pointed out above, if the value of `x' is less than the value
+ of the first bin, the index of the first bin will be returned even
+ though `x' does not belong to the bin. If this behavior is not
+ desired, then such points should be filtered out before the binary
+ search is performed.
+
+ SEE ALSO
+ hist1d, hist1d_rebin
+
+--------------------------------------------------------------
+
+whist1d
+
+ SYNOPSIS
+ Created a weighted 1-d histogram
+
+ USAGE
+ h = whist1d (pnts, wghts, grid ,&rev ,&weight_func
+
+ DESCRIPTION
+ The `whist1d' function creates a 1-dimensional weighted
+ histogram. The value of the ith bin in the histogram is given by a
+ function applied to values of the `wghts' that correspond to
+ those values in the `pnts' array that satisfy
+ `gridi<=X<gridi+1' where `X' represents the value of
+ the candidate point. The last bin of the histogram represents an
+ overflow bin with the right bin edge at plus infinity. The grid is
+ required to be sorted into ascending order.
+
+ If the optional fourth argument `&rev' is present, upon return
+ it will be set to the array of reverse-indices of the histogram. The
+ optional `&weight_func' argument may be used to specify the
+ function to be applied to the weights array. By default, the
+ `sum' function will be used.
+
+ NOTES
+ The source code to this function may be found in `histogram.sl'.
+ As such, it is available only after this file has been loaded.
+ Simply importing the module will not load this function into the
+ interpreter.
+
+ SEE ALSO
+ hist1d, whist2d, hist1d_rebin
+
+--------------------------------------------------------------
+
+whist2d
+
+ SYNOPSIS
+ Created a weighted 2-d histogram
+
+ USAGE
+ h = whist2d (xpnts, ypnts, wghts, xgrid, ygrid ,&rev ,&weight_func
+
+ DESCRIPTION
+ The `whist2d' function creates a 2-dimensional weighted
+ histogram. The value of the bin `i,j' of the histogram is
+ given by a function applied to those values in the `wghts' array
+ that correspond to the (X,Y) pairs that satisfy
+ `xgridi<=X<xgridi+1' and `ygridi<=Y<ygridi+1'. The
+ bins at the extreme edges of the histogram represent overflow bins
+ with the upper bin edge at plus infinity. The grids are required to
+ be sorted into ascending order.
+
+ If the optional sixth argument `&rev' is present, upon return
+ it will be set to the array of reverse-indices of the histogram. The
+ optional `&weight_func' argument may be used to specify the
+ function to be applied to the weights array. By default, the
+ `sum' function will be used.
+
+ NOTES
+ The source code to this function may be found in `histogram.sl'.
+ As such, it is available only after this file has been loaded.
+ Simply importing the module will not load this function into the
+ interpreter.
+
+ SEE ALSO
+ hist2d, whist1d, hist1d, hist2d_rebin
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/modules/help/jsonfuns.hlp Added

@@ -0,0 +1,101 @@
+json_decode
+
+ SYNOPSIS
+  Parse JSON text into an S-Lang data structure
+
+ USAGE
+  json = json_decode (String_Type text)
+
+ DESCRIPTION
+  The `json_decode' function parses JSON data from the input
+  string, and returns a corresponding S-Lang data structure.
+  JSON values are represented as follows:
+
+    JSON   -> S-Lang
+
+    object    Struct_Type
+    array     List_Type
+    string    String_Type or BString_Type
+    number    (L)Long_Type or Double_Type
+    `true'    UChar_Type ('\1')
+    `false'   UChar_Type ('\0')
+    `null'    Null_Type
+
+  The S-Lang structure corresponding to a JSON object
+  with duplicate keys has no duplicate field names,
+  but the field value is given by the last JSON value.
+
+  If the input string does not contain valid JSON data,
+  or if numeric values cannot be represented within S-Lang,
+  or if JSON objects and/or arrays are too deeply nested,
+  a `Json_Parse_Error' is thrown.
+
+ SEE ALSO
+  json_encode
+
+--------------------------------------------------------------
+
+json_encode
+
+ SYNOPSIS
+  Generate JSON text from an S-Lang data structure
+
+ USAGE
+  String_Type text = json_encode (json)
+
+ DESCRIPTION
+  The `json_encode' function generates the JSON text
+  that corresponds to the S_Lang data structure `json'.
+  Valid input types -- i.e., those that generate text
+  that can be parsed by `json_decode' -- are Struct_Type
+  (for JSON objects) and List_Type or Array_Type (for
+  JSON arrays), provided that these containers contain
+  only the following types:
+
+    S-Lang                         -> JSON
+
+    Struct_Type                       object
+    List_Type or Array_Type           array
+    String_Type or BString_Type       string
+    UChar_Type ('\1')                 `true'
+    UChar_Type ('\0')                 `false'
+    other non-complex numeric types   number
+    Null_Type                         `null'
+
+  Invalid input causes a `Json_Invalid_Json_Error'.
+
+  Optional whitespace in the output text can be configured
+  by the `pre_nsep', `post_nsep', `pre_vsep', and `post_vsep'
+  qualifiers. (Only strings built from ' ', '\t', '\n',
+  or '\r' are allowed. Other characters are ignored.)
+  If present, all whitespace after the final "\n"
+  in `post_vsep' is considered as extra indentation,
+  which accumulates for nested objects and arrays.
+
+ QUALIFIERS
+  ; pre_nsep=str: whitespace before name separator ':'
+                    in objects (default: "")
+  ; post_nsep=str: whitespace after name separator ':'
+                     in objects (default: "")
+  ; pre_vsep=str: whitespace before value separator ','
+                    in objects or arrays (default: "")
+  ; post_vsep=str: whitespace after value separator ',',
+                     after the opening, and before
+                     the closing brackets in objects
+                     or arrays (default: "")
+
+ EXAMPLE
+
+  % some whitespace and indentation after separators:
+  json_encode (json; pre_nsep="", post_nsep=" ",
+                     pre_vsep="", post_vsep="\n  ")
+
+  % yet more whitespace around separators:
+  json_encode (json; pre_nsep=" ", post_nsep="  ",
+                     pre_vsep=" ", post_vsep="\n\t")
+
+
+ SEE ALSO
+  json_decode
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/modules/help/onigfuns.hlp Added

@@ -0,0 +1,174 @@
+onig_new
+
+ SYNOPSIS
+  Create an instance of a regular-expression
+
+ USAGE
+  Onig_Type onig_new (pattern ,options ,encoding ,syntax)
+
+   String_Type pattern;
+   Int_Type options;
+   String_Type encoding;
+   String_Type syntax;
+
+
+ DESCRIPTION
+ The `onig_new' function compiles the specified regular
+ expression (`pattern') and returns the result.  The other
+ parameters are optional and may be used to specify compilation
+ options, the character-set encoding, and the regular expression
+ syntax. Upon success, this function returns an Onig_Type
+ object representing the compiled pattern.  If compilation fails, a
+ `OnigError' exception will be thrown.
+
+ The `options' parameters is a bit mapped value that may be
+ formed from the bitwise-or of zero or more of the following constants:
+
+   ONIG_OPTION_NONE
+   ONIG_OPTION_IGNORECASE
+   ONIG_OPTION_EXTEND
+   ONIG_OPTION_MULTILINE
+   ONIG_OPTION_SINGLELINE
+   ONIG_OPTION_FIND_LONGEST
+   ONIG_OPTION_FIND_NOT_EMPTY
+   ONIG_OPTION_NEGATE_SINGLELINE
+   ONIG_OPTION_DONT_CAPTURE_GROUP
+   ONIG_OPTION_CAPTURE_GROUP
+
+
+ The character-set encoding may be specified using one of the
+ following strings:
+
+  "ascii"         "iso_8859_1"     "iso_8859_2"   "iso_8859_3"
+  "iso_8859_4"    "iso_8859_5"     "iso_8859_6"   "iso_8859_7"
+  "iso_8859_8",   "iso_8859_9"     "iso_8859_10"  "iso_8859_11"
+  "iso_8859_13"   "iso_8859_14"    "iso_8859_15"  "iso_8859_16"
+  "utf8"          "utf16_be"       "utf16_le"     "utf32_be"
+  "utf32_le"      "euc_jp"         "euc_tw"       "euc_kr"
+  "euc_cn"        "sjis"           "koi8_r"       "cp1251"
+  "big5"          "gb18030"
+
+ If not specified, "utf8" will be used if the interpreter is UTF-8
+ mode and "iso_8859_1" if not in UTF-8 mode.
+
+ The regular expression syntax of the pattern may be specified by
+ setting the `syntax' parameter to one of the following:
+
+  "asis"    "posix_basic"  "posix_extended"  "emacs"
+  "grep"    "gnu_regex"    "java"            "perl"
+  "perl_ng" "ruby"
+
+ If unspecified, the syntax defaults to `"perl"'.
+
+ SEE ALSO
+  onig_search, onig_nth_match, onig_nth_substr
+
+--------------------------------------------------------------
+
+onig_search
+
+ SYNOPSIS
+  Search a string using an Onig compiled pattern
+
+ USAGE
+  Int_Type onig_search (p, str ,start_pos, end_pos ,option)
+
+   Onig_Type p;
+   String_Type str;
+   Int_Type start_pos, end_pos;
+
+
+ DESCRIPTION
+ The `onig_search' function applies a pre-compiled pattern `p' to a
+ string `str' and returns the result of the match.  The optional
+ third and fourth arguments may be used to constrain the search region
+ to the specified byte-offsets in the string.  The `option'
+ parameter is also optional and may be used to control how the search
+ is to be performed.  Its value may be specified as a bitwise-or of zero or
+ more of the following flags:
+
+   ONIG_OPTION_NOTBOL
+   ONIG_OPTION_NOTEOL
+   ONIG_OPTION_POSIX_REGION
+
+ See the onig library documentation for more information about the meaning
+ of these flags.
+
+ Upon success, this function returns a positive integer equal to 1 plus the
+ number of so-called captured substrings.  It will return 0 if the pattern
+ failed to match the string.
+
+ SEE ALSO
+  onig_new, onig_nth_match, onig_nth_substr
+
+--------------------------------------------------------------
+
+onig_nth_match
+
+ SYNOPSIS
+  Return the location of the nth match of an onig regular expression
+
+ USAGE
+  Int_Type2 onig_nth_match (Onig_Type p, Int_Type nth)
+
+ DESCRIPTION
+ The `onig_nth_match' function returns an integer array whose
+ values specify the locations as byte-offsets to the beginning and end
+ of the `nth' captured substring of the most recent call to
+ `onig_search' with the compiled pattern.  A value of `nth'
+ equal to 0 represents the substring representing the entire match of
+ the pattern.
+
+ If the `nth' match did not take place, the function returns NULL.
+
+ EXAMPLE
+ After the execution of:
+
+    str = "Error in file foo.c, line 127, column 10";
+    pattern = "file (^,+), line (0-9+)";
+    p = onig_new (pattern);
+    if (onig_search (p, str))
+      {
+         match_pos = onig_nth_match (p, 0);
+         file_pos = onig_nth_match (p, 1);
+         line_pos = onig_nth_match (p, 2);
+      }
+
+ `match_pos' will be set to `9,29', `file_pos' to `14,19,'
+ and `line_pos' to `26,29'.  These integer arrays may be used to
+ extract the substrings matched by the pattern, e.g.,
+
+     file = substr (str, file_pos0+1, file_pos1-file_pos0);
+     line = strline_pos0:line_pos1-1;
+
+ Alternatively, the function `onig_nth_substr' may be used to get the
+ matched substrings:
+
+     file = onig_nth_substr (p, str, 0);
+
+
+ SEE ALSO
+  onig_new, onig_search, onig_nth_substr
+
+--------------------------------------------------------------
+
+onig_nth_substr
+
+ SYNOPSIS
+  Extract the nth matched substring from an Onig regular expression search
+
+ USAGE
+  String_Type onig_nth_substr (Onig_Type p, String_Type str, Int_Type nth)
+
+ DESCRIPTION
+ This function may be used to extract the `nth' captured substring
+ resulting from the most recent use of the compiled pattern `p' by
+ the `onig_search' function.  Unlike `onig_nth_match', this
+ function returns the specified captured substring itself and not the
+ position of the substring. For this reason, the subject string of the
+ pattern is a required argument.
+
+ SEE ALSO
+  onig_new, onig_search, onig_nth_match
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/modules/help/pcrefuns.hlp Added

@@ -0,0 +1,210 @@
+pcre_compile
+
+ SYNOPSIS
+  Compile a PCRE regular expression
+
+ USAGE
+  PCRE_Type pcre_compile (String_Type pattern , Int_Type options)
+
+ DESCRIPTION
+ The `pcre_compile' function compiles a PCRE style regular expression
+ and returns the result.  The optional `options' argument may be used
+ to provide addition information affecting the compilation of the pattern.
+ Specifically, it is a bit-mapped value formed from the logical-or of zero
+ or more of the following symbolic constants:
+
+    PCRE_ANCHORED     Force the match to be at the start of a string
+    PCRE_CASELESS     Matches are to be case-insensitive
+    PCRE_DOLLAR_ENDONLY (See PCRE docs for more information)
+    PCRE_DOTALL       The dot pattern matches all characters
+    PCRE_EXTENDED     Ignore whitespace in the pattern
+    PCRE_EXTRA        (See PCRE docs for features this activates)
+    PCRE_MULTILINE    Treat the subject string as multi-lines
+    PCRE_UNGREEDY     Make the matches not greedy
+    PCRE_UTF8         Regard the pattern and subject strings as UTF-8
+
+ Many of these flags may be set within the pattern itself.   See the PCRE
+ library documentation for more information about the precise details
+ of these flags and the supported regular expressions.
+
+ Upon success, this function returns a PCRE_Type object representing
+ the compiled patterned.  If compilation fails, a `ParseError'
+ exception will be thrown.
+
+ SEE ALSO
+  pcre_exec, pcre_nth_match, pcre_nth_substr, pcre_matches
+
+--------------------------------------------------------------
+
+pcre_exec
+
+ SYNOPSIS
+  Match a string against a compiled PCRE pattern
+
+ USAGE
+  Int_Type pcre_exec(p, str ,pos ,options);
+
+   PCRE_Type p;
+   String_Type str;
+   Int_Type pos, options;
+
+
+ DESCRIPTION
+ The `pcre_exec' function applies a pre-compiled pattern `p' to a
+ string `str' and returns the result of the match.  The optional third
+ argument `pos' may be used to specify the point, as an offset from the
+ start of the string, where matching is to start.  The fourth argument, if
+ present, may be used to provide additional information about how matching
+ is to take place.  Its value may be specified as a logical-or of zero or
+ more of the following flags:
+
+   PCRE_NOTBOL
+        The first character in the string is not at the beginning of a line.
+   PCRE_NOTEOL
+        The last character in the string is not at the end of a line.
+   PCRE_NOTEMPTY
+        An empty string is not a valid match.
+
+ See the PCRE library documentation for more information about the meaning
+ of these flags.
+
+ Upon success, this function returns a positive integer equal to 1 plus the
+ number of so-called captured substrings.  It returns 0 if the pattern
+ fails to match the string.
+
+ SEE ALSO
+  pcre_compile, pcre_nth_match, pcre_nth_substr, pcre_matches
+
+--------------------------------------------------------------
+
+pcre_matches
+
+ SYNOPSIS
+  Match a PCRE to a string and return the matches
+
+ USAGE
+  String_Type = pcre_matches (regexp, str ,pcre_exec_options)
+
+ DESCRIPTION
+  This function combines the `pcre_exec' and
+ `pcre_nth_substr' functions into simple to use function that
+ matches the specified regular expression `regexp' to the string
+ `string' and returns matched substrings as an array.  If
+ `regexp' is a string, the function will first compile the
+ pattern using the `pcre_compile' function.  The third parameter
+ is optional and, if provided, will be passed as the `options'
+ parameter to `pcre_exec'.
+
+ If no match is found, the function will return NULL.
+
+ QUALIFIERS
+ The following qualifiers are supported:
+
+   options=int        Options to pass to pcre_compile
+   offset=int         Start matching offset in bytes for pcre_exec
+
+
+ EXAMPLE
+ After the execution of:
+
+    str = "Error in file foo.c, line 127, column 10";
+    pattern = "file (^,+), line (\\d+)";
+    matches = pcre_matches (pattern, str);
+
+ the value of the matches variable will be the array:
+
+     "file foo.c, line 127",
+      "foo.c",
+      127
+    
+
+
+ SEE ALSO
+  pcre_compile, pcre_exec, pcre_nth_substr, pcre_nth_match
+
+--------------------------------------------------------------
+
+pcre_nth_match
+
+ SYNOPSIS
+  Return the location of the nth match of a PCRE
+
+ USAGE
+  Int_Type2 pcre_nth_match (PCRE_Type p, Int_Type nth)
+
+ DESCRIPTION
+ The `pcre_nth_match' function returns an integer array whose values
+ specify the locations of the beginning and end of the `nth' captured
+ substrings of the most recent call to `pcre_exec' with the compiled
+ pattern.  A value of `nth' equal to 0 represents the substring
+ representing the entire match of the pattern.
+
+ If the `nth' match did not take place, the function returns NULL.
+
+ EXAMPLE
+ After the execution of:
+
+    str = "Error in file foo.c, line 127, column 10";
+    pattern = "file (^,+), line (\\d+)";
+    p = pcre_compile (pattern);
+    if (pcre_exec (p, str))
+      {
+         match_pos = pcre_nth_match (p, 0);
+         file_pos = pcre_nth_match (p, 1);
+         line_pos = pcre_nth_match (p, 2);
+      }
+
+ `match_pos' will be set to `9,29', `file_pos' to `14,19,'
+ and `line_pos' to `26,29'.  These integer arrays may be used to
+ extract the substrings matched by the pattern, e.g.,
+
+     file = substr (str, file_pos0+1, file_pos1-file_pos0);
+     line = strline_pos0:line_pos1-1;
+
+ Alternatively, the function `pcre_nth_substr' may be used to get the
+ matched substrings:
+
+     file = pcre_nth_substr (p, str, 0);
+
+
+ SEE ALSO
+  pcre_compile, pcre_exec, pcre_nth_substr, pcre_matches
+
+--------------------------------------------------------------
+
+pcre_nth_substr
+
+ SYNOPSIS
+  Extract the nth substring from a PCRE match
+
+ USAGE
+  String_Type pcre_nth_substr (PCRE_Type p, String_Type str, Int_Type nth)
+
+ DESCRIPTION
+ This function may be used to extract the `nth' captured substring
+ resulting from the most recent use of the compiled pattern `p' by the
+ `pcre_exec' function.  Unlike `pcre_nth_match', this function returns
+ the specified captured substring itself and not the position of the substring.
+ For this reason, the subject string of the pattern is a required argument.
+
+ SEE ALSO
+  pcre_matches, pcre_compile, pcre_exec, pcre_nth_match
+
+--------------------------------------------------------------
+
+slang_to_pcre
+
+ SYNOPSIS
+  Convert a S-Lang regular expression to a PCRE one
+
+ USAGE
+  String_Type slang_to_pcre (String_Type pattern)
+
+ DESCRIPTION
+ This function may be used to convert a slang regular expression to a PCRE
+ compatible one.  The converted pattern is returned.
+
+ SEE ALSO
+  pcre_compile, string_match
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/modules/help/pngfuns.hlp Added

@@ -0,0 +1,320 @@
+png_read
+
+ SYNOPSIS
+  Read an image from a PNG file
+
+ USAGE
+  img = png_read (file ,&image_type)
+
+ DESCRIPTION
+  The `png_read' function reads the image from the specified file
+  and returns it.  If a second argument is present, then it must be a
+  reference to a variable that will be set to an integer representing
+  the type of image read:
+
+    PNG_COLOR_TYPE_RGB               (RGB image)
+    PNG_COLOR_TYPE_RGBA              (RGB image with an alpha channel)
+    PNG_COLOR_TYPE_GRAY              (Grayscale image)
+    PNG_COLOR_TYPE_GRAY_ALPHA        (Grayscale image with an alpha channel)
+
+  The image returned by this function is represented by a 2d array of
+  unsigned integers.  If the image type is `PNG_COLOR_TYPE_RGB'
+  or `PNG_COLOR_TYPE_RGBA', then the integers will be 32 bits
+  wide with the most significant byte corresponding to the alpha
+  channel, followed by bytes for the red, green, and blue channels in
+  that order.  In this way, the color channels may be extracted from
+  the image through simple bit operations, e.g.,
+
+     (img & 0x0000FF00) shr 8
+
+  will pick out the green channel.  Alternatively, the
+  `png_rgb_get_?' functions may be used to extract the various
+  channels.
+
+  If the image type is `PNG_COLOR_TYPE_GRAY_ALPHA' then image
+  will be represented by 16 bit integers with the most significant
+  byte corresponding to the alpha channel and the least significant
+  byte representing the grayscale.  If the image type is
+  `PNG_COLOR_TYPE_GRAY' then the image array will consist of
+  unsigned 8 bit integers (`UChar_Type').
+
+ EXAMPLE
+
+    define read_grayscale_image (file)
+    {
+       variable img_type;
+       img = png_read (file, &img_type);
+       if ((img_type != PNG_COLOR_TYPE_GRAY)
+           or (img_type != PNG_COLOR_TYPE_GRAY_ALPHA))
+         img = png_rgb_to_gray (img);
+       return img;
+    }
+
+
+ SEE ALSO
+  png_read_flipped, png_write, png_rgb_to_r, png_rgb_to_g, png_rgb_to_b
+
+--------------------------------------------------------------
+
+png_read_flipped
+
+ SYNOPSIS
+  Read an image from a PNG file
+
+ USAGE
+  img = png_read_flipped (file ,&image_type)
+
+ DESCRIPTION
+  This function is like the `png_read' function except that it
+  returns an image with the rows flipped.  See the documentation for
+  `png_read' for more information.
+
+ SEE ALSO
+  png_read, png_write_flipped
+
+--------------------------------------------------------------
+
+png_write
+
+ SYNOPSIS
+  Write an image to a PNG file
+
+ USAGE
+  png_write (file, image ,has_alpha)
+
+ DESCRIPTION
+  The `png_write' function writes a 2d image to the specified
+  file as a PNG.  The type of PNG created depends upon the data type
+  of the image array according to the following table:
+
+          data-type           PNG-type
+    -----------------------------------
+    Char_Type   (8 bit)       grayscale
+    UChar_Type  (8 bit)       grayscale
+    Int16_Type  (16 bit)      grayscale
+    UInt16_Type (16 bit)      grayscale
+    Int32_Type  (32 bit)        RGB
+    UInt32_Type (32 bit)        RGB
+
+  If the optional parameter `has_alpha' is present and non-zero,
+  then an alpha channel will also be written to the file.
+
+  See the documentation for the `png_read' function for
+  information about how the various channels are encoded as integers.
+
+ SEE ALSO
+  png_write_flipped, png_read
+
+--------------------------------------------------------------
+
+png_write_flipped
+
+ SYNOPSIS
+  Write an image to a PNG file
+
+ USAGE
+  png_write_flipped (file, image ,has_alpha)
+
+ DESCRIPTION
+  This function is like the `png_write' function except that it
+  writes the image to the file with the rows reversed. See the
+  documentation for `png_write' for more information.
+
+ SEE ALSO
+  png_read, png_write_flipped
+
+--------------------------------------------------------------
+
+png_rgb_to_gray
+
+ SYNOPSIS
+  Convert an RGB image to grayscale
+
+ USAGE
+  gray = png_rgb_to_gray (rgb)
+
+ DESCRIPTION
+  This function converts an RGB image represented by an array
+  (typically 2d) to a corresponding array of 8 bit integers
+  representing the grayscale values. The grayscale values are formed
+  by averaging the R, G, and B channels.
+
+ SEE ALSO
+  png_gray_to_rgb
+
+--------------------------------------------------------------
+
+png_gray_to_rgb
+
+ SYNOPSIS
+  Convert a grayscale image to RGB
+
+ USAGE
+  rgb = png_gray_to_rgb (gray, colormap)
+
+ DESCRIPTION
+  This function creates an RGB image, represented by an array of 32
+  bit integers from a grayscale image using the specified colormap.
+  The shape of the of the RGB array will be that of the input
+  grayscale array.  The values in the input image will be linearly
+  mapped onto the elements of the colormap such that the minimum value
+  in the grayscale image will be assigned the first RGB value in the
+  colormap, and the maximum value will be assigned the last RGB value.
+
+  The colormap argument must either be an array of 32 bit integers
+  encoding the RGB information, or must be the name of a supported
+  color map.  See the documentation for the `png_get_colormap'
+  function for more information about colormaps.
+
+ QUALIFIERS
+  The qualifiers `gmin' and `gmax' may be used to define the
+  minimum and maximum grayscale values used for the mapping onto the
+  colormap.  Grayscale values outside the specified range will be clipped.
+
+ SEE ALSO
+  png_rgb_to_gray, png_get_colormap
+
+--------------------------------------------------------------
+
+png_get_colormap
+
+ SYNOPSIS
+  Retrieve a colormap
+
+ USAGE
+  cmap = png_get_colormap (String_Type name)
+
+ DESCRIPTION
+  This function returns a colormap of the specified name.  Currently
+  recognized names include:
+
+    cool       Linear change from blue to magenta
+    copper     Dark to light copper brown
+    gebco      Colors for GEBCO bathymetric charts
+    globe      Colors for global bathy-topo relief
+    drywet     Goes from dry to wet colors
+    gray       Grayramp from black to white
+    haxby      Bill Haxby's colortable for geoid & gravity
+    hot        Black through red and yellow to white
+    jet        Dark to light blue, white, yellow and red
+    no_green   For those who hate green
+    ocean      white-green-blue bathymetry scale
+    polar      Blue via white to red
+    rainbow    Rainbow colors magenta-blue-cyan-green-yellow-red
+    red2green  Polar scale from red to green via white
+    relief     Wessel/Martinez colortable for bathymetry/topography
+    topo       Sandwell-Anderson colors for topography
+    sealand    Smith bathymetry/topography scale
+    seis       R-O-Y-G-B seismic tomography colors
+    split      Polar scale like polar, but via black instead of white
+    wysiwyg    20 RGB colors for openwin -cubesize large and waxenvy printer
+
+  The above colormaps were derived from the GMT distribution, which is
+  an open source collection of tools for geographic data.  See
+  `http://gmt.soest.hawaii.edu/' for more information about GMT.
+
+  In the current implementation, the colormap is a 256 element array
+  of unsigned 32 bit integers.
+
+ SEE ALSO
+  png_gray_to_rgb, png_add_colormap, png_get_colormap_names
+
+--------------------------------------------------------------
+
+png_add_colormap
+
+ SYNOPSIS
+  Add a color map
+
+ USAGE
+  png_add_colormap (name, cmap)
+
+ DESCRIPTION
+  This function adds a color map of the specified name to the table of
+  internal colormaps.  The colormap is simply a 256 element unsigned
+  32 integer bit array that maps 256 grayscale values to RGB.
+
+ SEE ALSO
+  png_get_colormap
+
+--------------------------------------------------------------
+
+png_get_r
+
+ SYNOPSIS
+  Get the red channel of an RGB image
+
+ USAGE
+  r = png_get_r (rgb)
+
+ DESCRIPTION
+  This function returns the red component of the RGB image encoded as
+  an unsigned 32 bit integer using the algorithm:
+
+    r = typecast ((rgb shr 16) & 0xFF, UChar_Type);
+
+
+ SEE ALSO
+  png_get_g, png_get_b, png_get_a
+
+--------------------------------------------------------------
+
+png_get_g
+
+ SYNOPSIS
+  Get the green channel of an RGB image
+
+ USAGE
+  r = png_get_g (rgb)
+
+ DESCRIPTION
+  This function returns the green component of the RGB image encoded as
+  an unsigned 32 bit integer using the algorithm:
+
+    g = typecast ((rgb shr 8) & 0xFF, UChar_Type);
+
+
+ SEE ALSO
+  png_get_r, png_get_b, png_get_a
+
+--------------------------------------------------------------
+
+png_get_b
+
+ SYNOPSIS
+  Get the blue channel of an RGB image
+
+ USAGE
+  r = png_get_b (rgb)
+
+ DESCRIPTION
+  This function returns the blue component of the RGB image encoded as
+  an unsigned 32 bit integer using the algorithm:
+
+    b = typecast ((rgb & 0xFF), UChar_Type);
+
+
+ SEE ALSO
+  png_get_r, png_get_g, png_get_a
+
+--------------------------------------------------------------
+
+png_get_a
+
+ SYNOPSIS
+  Get the alpha channel of an RGB image
+
+ USAGE
+  r = png_get_a (rgb)
+
+ DESCRIPTION
+  This function returns the alpha channel of the RGB image encoded as
+  an unsigned 32 bit integer using the algorithm:
+
+    a = typecast ((rgb shr 24) & 0xFF, UChar_Type);
+
+
+ SEE ALSO
+  png_get_g, png_get_b, png_get_a
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/modules/help/randfuns.hlp Added

@@ -0,0 +1,548 @@
+rand_exp
+
+ SYNOPSIS
+ Generate exponentially distributed random numbers
+
+ USAGE
+ X = rand_exp(Rand_Type g, beta ,num)
+
+ DESCRIPTION
+ This function generates random numbers that are distributed according
+ to an exponential distribution with parameter beta > 0. The
+ distribution's probability density is given by
+
+ P(x,beta) = (1/beta) exp(-x/beta)
+
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ NOTES
+ The exponential generator is commonly used to simulate waiting times
+ between events.
+
+ SEE ALSO
+ rand_new, rand_uniform
+
+--------------------------------------------------------------
+
+rand_int
+
+ SYNOPSIS
+ Generate random integers
+
+ USAGE
+ X = rand_int (Rand_Type g, imin, imax ,num)
+
+ DESCRIPTION
+ This function may be used to generate a random integer `X' such
+ that `imin <= X <= imax'.
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ SEE ALSO
+ rand_uniform, rand, rand_new
+
+--------------------------------------------------------------
+
+rand_tdist
+
+ SYNOPSIS
+ Generate random numbers from the Student t distribution
+
+ USAGE
+ X = rand_tdist (Rand_Type g, nu ,num)
+
+ DESCRIPTION
+ This function generates random numbers that are distributed according
+ to the Student-t distribution with nu>0.0 degrees of freedom.
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ SEE ALSO
+ rand_uniform, rand_new, rand_chisq, rand_fdist
+
+--------------------------------------------------------------
+
+rand_fdist
+
+ SYNOPSIS
+ Generate random numbers from the F distribution
+
+ USAGE
+ X = rand_fdist (Rand_Type g,, nu1, nu2 ,num)
+
+ DESCRIPTION
+ This function generates random numbers that are distributed according
+ to the F-distribution, which is the ratio of two chi-squared
+ distributed variates whose degrees of freedom are given by
+ `nu1' (numerator) and `nu2' (denominator).
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ SEE ALSO
+ rand_uniform, rand_chisq, rand_tdist, rand_gauss, rand_new
+
+--------------------------------------------------------------
+
+rand_chisq
+
+ SYNOPSIS
+ Generate Chi-Square distributed random numbers
+
+ USAGE
+ X = rand_fdist (Rand_Type g, nu, ,num)
+
+ DESCRIPTION
+ This function generates random numbers that are distributed according
+ to the Chi-squared distribution with `nu > 0' degrees of freedom.
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ SEE ALSO
+ rand_uniform, rand_fdist, rand_tdist, rand_gauss, rand_new
+
+--------------------------------------------------------------
+
+rand_flat
+
+ SYNOPSIS
+ Generate uniformly distributed random numbers
+
+ USAGE
+ X = rand_fdist (Rand_Type g, xmin, xmax ,num)
+
+ DESCRIPTION
+ This function generates random double-precision floating point
+ numbers that are uniformly distributed in the range
+ `xmin<=X<xmax'.
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ SEE ALSO
+ rand_uniform, rand_uniform_pos, rand_int, rand, rand_new
+
+--------------------------------------------------------------
+
+rand_gamma
+
+ SYNOPSIS
+ Generate Gamma distributed random numbers
+
+ USAGE
+ X = rand_gamma (Rand_Type g,, k, theta ,num)
+
+ DESCRIPTION
+ This function returns random deviates that are Gamma-distributed
+ according to the probability density
+
+ P(x; k,theta) = x^(k-1)*exp(-x/theta)/(theta^k * Gamma(k))
+
+ where `k,theta>0.0'.
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ SEE ALSO
+ rand_beta, rand_uniform, rand_binomial, rand_new
+
+--------------------------------------------------------------
+
+rand_binomial
+
+ SYNOPSIS
+ Generate random numbers from the binomial distribution
+
+ USAGE
+ X = rand_binomial (Rand_Type g,, p, n, ,num)
+
+ DESCRIPTION
+ This function generates binomial distributed random numbers
+ according to the probability density
+
+ P(x;p,n) = n!/(k!*(n-k)!) * p^k * (1-p)^(n-k)
+
+ where `n' is a non-negative integer and `0<=p<=1'.
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ SEE ALSO
+ rand_gamma, rand_poisson, rand_uniform, rand_new
+
+--------------------------------------------------------------
+
+rand_poisson
+
+ SYNOPSIS
+ Generate Poisson distributed random numbers
+
+ USAGE
+ k = rand_poisson (Rand_Type g, mu ,num)
+
+ DESCRIPTION
+ This function generates random unsigned integers that are
+ poisson-distributed according to the probability distribution
+
+ P(k;mu) = mu^k/k! * exp(-mu)
+
+ where `mu>0.0'.
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ SEE ALSO
+ rand_gauss, rand_uniform, rand_binomial, rand_new
+
+--------------------------------------------------------------
+
+rand_geometric
+
+ SYNOPSIS
+ Generate random numbers from the geometric distribution
+
+ USAGE
+ k = rand_geometric (Rand_Type g, p ,num)
+
+ DESCRIPTION
+ This function generates random numbers that are distributed
+ according to a geometric distribution with a probability density
+
+ P(k; p) = p*(1-p)^(k-1)
+
+ where `0<=p<=1'
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ SEE ALSO
+ rand_poisson, rand_exp, rand_gauss, rand_uniform, rand_new
+
+--------------------------------------------------------------
+
+rand_cauchy
+
+ SYNOPSIS
+ Generate random numbers from the Cauchy distribution
+
+ USAGE
+ X = rand_cauchy (Rand_Type g, gamma ,num)
+
+ DESCRIPTION
+ This function generates random numbers that are distributed
+ according to a cauchy-distribution with a probability density
+
+ P(x; gamma) = 1/(PI*gamma)/(1+(x/gamma)^2)
+
+ where `gamma>=0.0'.
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ SEE ALSO
+ rand_gauss, rand_poisson, rand_exp, rand_new
+
+--------------------------------------------------------------
+
+rand_beta
+
+ SYNOPSIS
+ Generate random numbers from the beta distribution
+
+ USAGE
+ X = rand_fdist (Rand_Type g, a, b ,num)
+
+ DESCRIPTION
+ This function generates random numbers that are distributed
+ according to a Beta-distribution with a probability density
+
+ P(x; a,b) = x^(a-1)*(1-x)^(b-1)/B(a,b)
+
+ where `a, b > 0'.
+
+ SEE ALSO
+ rand_gamma, rand_binomial, rand_chisq
+
+--------------------------------------------------------------
+
+rand_gauss
+
+ SYNOPSIS
+ Generate gaussian-distributed random numbers
+
+ USAGE
+ X = rand_gauss (Rand_Type g, sigma ,num)
+
+ DESCRIPTION
+ This function generates gaussian random numbers with the specified
+ sigma and mean of 0 according to the probability density
+
+ P(x; sigma) = 1/sqrt(2*PI*sigma^2) * exp(-0.5*x^2/sigma^2)
+
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ NOTES
+ This implementation utilizes the Box-Muller algorithm.
+
+ SEE ALSO
+ rand_uniform, rand_poisson, rand_chisq, rand_gauss, rand_new
+
+--------------------------------------------------------------
+
+rand
+
+ SYNOPSIS
+ Generate random integers numbers
+
+ USAGE
+ X = rand (Rand_Type g, ,num)
+
+ DESCRIPTION
+ This function generates unsigned 32 bit randomly distributed
+ integers on the closed interval 0<=X<=0xFFFFFFFFUL.
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ SEE ALSO
+ rand_new, rand_int, rand_uniform, rand_flat
+
+--------------------------------------------------------------
+
+rand_uniform_pos
+
+ SYNOPSIS
+ Generate uniform positive random numbers
+
+ USAGE
+ X = rand_uniform_pos (Rand_Type num)
+
+ DESCRIPTION
+ This function generates uniformly distributed random numbers in open
+ interval `0<X<1'.
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ SEE ALSO
+ rand_uniform, rand_new
+
+--------------------------------------------------------------
+
+rand_uniform
+
+ SYNOPSIS
+ Generate uniform random numbers
+
+ USAGE
+ X = rand_uniform (Rand_Type g num)
+
+ DESCRIPTION
+ This function generates uniformly distributed double precision
+ numbers on the semi-closed interval `0<=r<1'.
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ SEE ALSO
+ rand_uniform_pos, rand_int, rand_flat, rand_new
+
+--------------------------------------------------------------
+
+srand
+
+ SYNOPSIS
+ Seed the random number generator
+
+ USAGE
+ srand (Rand_Type g, Array_Type seeds)
+
+ DESCRIPTION
+ This function may be used to seed an instance of a rand number
+ generator using the values of an array of an unsigned long integers.
+ If a generator (created by `rand_new') is specified as the first
+ argument, then is will be seeded; otherwise, the seeds will
+ get applied to the default generator.
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+ The `num' parameter indicates that `num' random values are to
+ be generated and returned as an array.
+
+ EXAMPLE
+
+ gen = rand_new ();
+ srand (gen, _time(), _pid(), 0xFF80743);
+
+
+ SEE ALSO
+ rand_new, rand, rand_uniform
+
+--------------------------------------------------------------
+
+rand_new
+
+ SYNOPSIS
+ Instantiate a new random number generator
+
+ USAGE
+ Rand_Type rand_new (array-of-seeds)
+
+ DESCRIPTION
+ This function creates a new instance of the basic random number
+ generator. An optional array of 32 bit unsigned integers may be used
+ to seed the generator. By default, the generator is seeding using
+ the current time and process id. The `srand' function may also
+ be used to seed the generator. The generator created by the
+ `rand_new' function may be passed as the first argument to most
+ of the other functions in the module to indicate that this instance
+ should be used as the basic generator.
+
+ EXAMPLE
+ The following example shows how to create an array of 512 uniform
+ random numbers derived from the default instance of the basic
+ generator:
+
+ x = rand_uniform (512);
+
+ A specific instance of the generator may be created using the
+ `rand_new' function and used by `rand_uniform' as follows:
+
+ g = rand_new (0x1234, 0x5678912, 0xEFAB1234);
+ x = rand_uniform (g, 512);
+
+
+ NOTES
+ The generator is a hybrid one that sums the results of 3 separate
+ generators: George Marsaglia's MZRAN13 generator, a multiply with
+ carry generator (also by Marsaglia), and a product generator. The
+ combined generator has a 192 bit state and a period exceeding 10^46.
+
+ The resulting random sequences were tested using version 2.24.4 of
+ the dieharder random number testing program. The tests showed that
+ this generator performed better than the famous Marsenne
+ Twister (`mt19937') both in terms of randomness and speed. More
+ information about the test results may be found at
+ `http://www.jedsoft.org/slang/modules/rand.html'.
+
+ The `mt19937' generator is separately available via the GSL
+ module.
+
+ SEE ALSO
+ srand, rand_int, rand_uniform
+
+--------------------------------------------------------------
+
+rand_sample
+
+ SYNOPSIS
+ Randomly sample from one or more arrays
+
+ USAGE
+ (b1 ,b2,...) = rand_sample (Rand_Type g, a1 ,a2,..., num);
+
+ DESCRIPTION
+ This function may be used to randomly sample `num' elements from
+ one or more arrays (`a1,...'). The arrays must be consistent in
+ the sense that they must have the same leading dimension, which is
+ the one to be sampled.
+
+ The optional first argument may be used to specify a different
+ instance of a random number generator. Otherwise, the default
+ generator will be used.
+
+ EXAMPLE
+ Suppose A is a 1-d array with 20 elements, and B is a 2d array with
+ dimensions 20,30. Then
+
+ (A1, B1) = rand_sample (A, B, 5);
+
+ will produce a 1d array A1 with 5 elements and a 2d array B1 with
+ dimensions 5,30.
+
+ NOTES
+ The indices used to sample the arrays are created using the first
+ `num' elements of a random permutation of the integers
+ `0:dim0-1' where `dim0' is the size of the leading
+ dimension. The same set of indices are used for all the arrays.
+ Hence any correspondence between `a0i,..' and `a1i,...'
+ will be preserved in the samples.
+
+ SEE ALSO
+ rand_permutation, rand_new
+
+--------------------------------------------------------------
+
+rand_permutation
+
+ SYNOPSIS
+ Generate a random permutation of integers
+
+ USAGE
+ p = rand_permutation (Rand_Type g, Int_Type n)
+
+ DESCRIPTION
+ This function may be used to generate a random permutation of the
+ sequence of integers `0,1,..,n-1'.
+
+ The optional parameter `g' may be used to
+ specify the underlying random number generator. See the
+ documentation for the `rand_new' function for more information.
+
+ SEE ALSO
+ rand_sample
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/modules/help/slsmg.hlp Added

@@ -0,0 +1,523 @@
+slsmg_suspend_smg
+
+ SYNOPSIS
+  Suspend screen management
+
+ USAGE
+  slsmg_suspend_smg ()
+
+ DESCRIPTION
+  The `slsmg_suspend_smg' function can be used to suspend the state of the
+  screen management facility during suspension of the program.  Use of
+  this function will reset the display back to its default state.  The
+  funtion `slsmg_resume_smg' should be called after suspension.
+
+  This function is similar to `slsmg_reset_smg' except that the
+  state of the display prior to calling `slsmg_suspend_smg' is saved.
+
+ SEE ALSO
+  slsmg_resume_smg, slsmg_reset_smg
+
+--------------------------------------------------------------
+
+slsmg_resume_smg
+
+ SYNOPSIS
+  Resume screen management
+
+ USAGE
+  slsmg_resume_smg ()
+
+ DESCRIPTION
+  The `slsmg_resume_smg' function should be called after
+  `slsmg_suspend_smg' to redraw the display exactly like it was
+  before `slsmg_suspend_smg' was called.
+
+ SEE ALSO
+  slsmg_suspend_smg
+
+--------------------------------------------------------------
+
+slsmg_erase_eol
+
+ SYNOPSIS
+  Erase to the end of the row
+
+ USAGE
+  slsmg_erase_eol ()
+
+ DESCRIPTION
+  The `slsmg_erase_eol' function erases all characters from the current
+  position to the end of the line.  The newly created space is given
+  the color of the current color.  This function has no effect on the
+  position of the virtual cursor.
+
+ SEE ALSO
+  slsmg_gotorc, slsmg_erase_eos, slsmg_fill_region
+
+--------------------------------------------------------------
+
+slsmg_gotorc
+
+ SYNOPSIS
+  Move the virtual cursor
+
+ USAGE
+  slsmg_gotorc (Integer_Type r, c)
+
+ DESCRIPTION
+  The `slsmg_gotorc' function moves the virtual cursor to the row
+  `r' and column `c'.  The first row and first column is
+  specified by `r = 0' and `c = 0'.
+
+ SEE ALSO
+  slsmg_refresh
+
+--------------------------------------------------------------
+
+slsmg_erase_eos
+
+ SYNOPSIS
+  Erase to the end of the screen
+
+ USAGE
+  slsmg_erase_eos ()
+
+ DESCRIPTION
+  The `slsmg_erase_eos' function is like `slsmg_erase_eol'
+  except that it erases all text from the current position to the
+  end of the display.  The current color will be used to set the
+  background of the erased area.
+
+ SEE ALSO
+  slsmg_erase_eol
+
+--------------------------------------------------------------
+
+slsmg_reverse_video
+
+ SYNOPSIS
+  Set the current color to 1
+
+ USAGE
+  slsmg_reverse_video ()
+
+ DESCRIPTION
+  This function is nothing more than `slsmg_set_color(1)'.
+
+ SEE ALSO
+  slsmg_set_color
+
+--------------------------------------------------------------
+
+slsmg_set_color
+
+ SYNOPSIS
+  Set the current color
+
+ USAGE
+  slsmg_set_color (Integer_Type c)
+
+ DESCRIPTION
+  The `slsmg_set_color' function is used to set the current
+  color.  The parameter `c' is a color object descriptor.
+  Actual foreground and background colors may be associated with a
+  color descriptor via the `slsmg_define_color' function.
+
+ EXAMPLE
+  This example defines color `7' to be green foreground on black
+  background and then displays some text in this color:
+
+      require ("slsmg");
+      variable
+        ref,
+        row = SLsmg_Screen_Rows / 2,
+        txt = 
+          "This should be displayed in green under a black background",
+          "Press enter to close this window";
+
+      slsmg_init_smg ();
+      slsmg_define_color (7, "green", "black");
+      slsmg_gotorc (row, SLsmg_Screen_Cols / 2 - strlen (txt0) / 2);
+      slsmg_set_color (7);
+      slsmg_write_string (txt0);
+      row++;
+      slsmg_gotorc (row, SLsmg_Screen_Cols / 2 - strlen (txt1) / 2);
+      slsmg_write_string (txt1);
+      slsmg_refresh ();
+
+      ()=fgets(&ref, stdin);
+
+
+--------------------------------------------------------------
+
+slsmg_normal_video
+
+ SYNOPSIS
+  Set the current color to 0
+
+ USAGE
+  slsmg_normal_video ()
+
+ DESCRIPTION
+  The `slsmg_normal_video' function sets the current color descriptor to `0'.
+
+ SEE ALSO
+  slsmg_set_color
+
+--------------------------------------------------------------
+
+slsmg_write_string
+
+ USAGE
+  slsmg_write_string (String_Type s)
+
+--------------------------------------------------------------
+
+slsmg_cls
+
+ SYNOPSIS
+  Clear the virtual display
+
+ USAGE
+  slsmg_cls ()
+
+ DESCRIPTION
+  The `slsmg_cls' function erases the virtual display using
+  the current color.  This will cause the physical display to get
+  cleared the next time `slsmg_refresh' is called.
+
+ NOTES
+  This function is not the same as
+
+     slsmg_gotorc (0,0); slsmg_erase_eos ();
+
+  since these statements do not guarantee that the physical screen
+  will get cleared.
+
+ SEE ALSO
+  slsmg_refresh, slsmg_erase_eos
+
+--------------------------------------------------------------
+
+slsmg_refresh
+
+ SYNOPSIS
+  Update physical screen
+
+ USAGE
+  slsmg_refresh ()
+
+ DESCRIPTION
+  The `slsmg_refresh' function updates the physical display to
+  look like the virtual display.
+
+ SEE ALSO
+  slsmg_suspend_smg, slsmg_init_smg, slsmg_reset_smg
+
+--------------------------------------------------------------
+
+slsmg_reset_smg
+
+ SYNOPSIS
+  Reset the `SLsmg' routines
+
+ USAGE
+  slsmg_reset_smg ()
+
+ DESCRIPTION
+  The `slsmg_reset_smg' function resets the `SLsmg'
+  screen management routines by freeing all memory allocated
+  while it was active and also put the terminal's display in
+  it's default state.
+
+ SEE ALSO
+  slsmg_init_smg
+
+--------------------------------------------------------------
+
+slsmg_init_smg
+
+ SYNOPSIS
+  Initialize the `SLsmg' routines
+
+ USAGE
+  slsmg_init_smg ()
+
+ DESCRIPTION
+  The `slsmg_init_smg' function initializes the `SLsmg' screen
+  management routines.   Specifically, this function allocates space
+  for the virtual display and puts the terminal's physical display in
+  the proper state.
+
+  This function should also be called any time the size of the
+  physical display has changed so that it can reallocate a new virtual
+  display to match the physical display.
+
+ SEE ALSO
+  slsmg_reset_smg
+
+--------------------------------------------------------------
+
+slsmg_write_nstring
+
+ SYNOPSIS
+  Write the first n characters of a string on the display
+
+ USAGE
+  slsmg_write_nstring (String_Type s, Integer_Type len)
+
+ DESCRIPTION
+  The `slsmg_write_nstring' function writes the first `n'
+  characters of `s' to this virtual display.  If the length of
+  the string `s' is less than `n', the spaces will used until
+  `n' characters have been written.  `s' can be `NULL', in
+  which case `n' spaces will be written.
+
+ SEE ALSO
+  slsmg_write_string
+
+--------------------------------------------------------------
+
+slsmg_write_wrapped_string
+
+ SYNOPSIS
+  Write a string to the display with wrapping
+
+ USAGE
+  slsmg_write_wrapped_string (String_Type s, Integer_Type r, c, dr, dc, fill)
+
+ DESCRIPTION
+  The `slsmg_write_wrapped_string' function writes the
+  string `s' to the virtual display.  The string will be confined
+  to the rectangular region whose upper right corner is at row `r'
+  and column `c', and consists of `nr' rows and `dc' columns.
+  The string will be wrapped at the boundaries of the box.  If `fill'
+  is non-zero, the last line to which characters have been written will
+  get padded with spaces.
+
+ NOTES
+  This function does not wrap on word boundaries.  However, it will
+  wrap when a newline charater is encountered.
+
+ SEE ALSO
+  slsmg_write_string
+
+--------------------------------------------------------------
+
+slsmg_char_at
+
+ SYNOPSIS
+  Get the character at the current position on the virtual display
+
+ USAGE
+  Integer_Type slsmg_char_at ()
+
+ DESCRIPTION
+  The `slsmg_char_at' function returns the character and its color
+  at the current position on the virtual display.
+
+--------------------------------------------------------------
+
+slsmg_set_screen_start
+
+ SYNOPSIS
+  Set the origin of the virtual display
+
+ USAGE
+  slsmg_set_screen_start (Integer_Type r, c)
+
+ DESCRIPTION
+  The `slsmg_set_screen_start' function sets the origin of
+  the virtual display to the row `r' and the column `c'.
+
+ SEE ALSO
+  slsmg_init_smg
+
+--------------------------------------------------------------
+
+slsmg_draw_hline
+
+ SYNOPSIS
+  Draw a horizontal line
+
+ USAGE
+  slsmg_draw_hline (Integer_Type len)
+
+ DESCRIPTION
+  The `slsmg_draw_hline' function draws a horizontal line of
+  length `len' on the virtual display.  The position of the
+  virtual cursor is left at the end of the line.
+
+ SEE ALSO
+  slsmg_draw_vline
+
+--------------------------------------------------------------
+
+slsmg_draw_vline
+
+ SYNOPSIS
+  Draw a vertical line
+
+ USAGE
+  slsmg_draw_vline (Integer_Type len)
+
+ DESCRIPTION
+  The `slsmg_draw_vline' function draws a vertical line of
+  length `len' on the virtual display.  The position of the
+  virtual cursor is left at the end of the line.
+
+--------------------------------------------------------------
+
+slsmg_draw_object
+
+ SYNOPSIS
+  Draw an object from the alternate character set
+
+ USAGE
+  slsmg_draw_object (Integer_Type r, c, obj)
+
+ DESCRIPTION
+  The `slsmg_draw_object' function may be used to place the object
+  specified by `obj' at row `r' and column `c'.  The
+  object is really a character from the alternate character set and
+  may be specified using one of the following constants:
+
+    SLSMG_HLINE_CHAR         Horizontal line
+    SLSMG_VLINE_CHAR         Vertical line
+    SLSMG_ULCORN_CHAR        Upper left corner
+    SLSMG_URCORN_CHAR        Upper right corner
+    SLSMG_LLCORN_CHAR        Lower left corner
+    SLSMG_LRCORN_CHAR        Lower right corner
+    SLSMG_CKBRD_CHAR         Checkboard character
+    SLSMG_RTEE_CHAR          Right Tee
+    SLSMG_LTEE_CHAR          Left Tee
+    SLSMG_UTEE_CHAR          Up Tee
+    SLSMG_DTEE_CHAR          Down Tee
+    SLSMG_PLUS_CHAR          Plus or Cross character
+
+
+ SEE ALSO
+  slsmg_draw_vline, slsmg_draw_hline, slsmg_draw_box
+
+--------------------------------------------------------------
+
+slsmg_draw_box
+
+ SYNOPSIS
+  Draw a box on the virtual display
+
+ USAGE
+  slsmg_draw_box (Integer_Type r, c, dr, dc)
+
+ DESCRIPTION
+  The `slsmg_draw_box' function uses the `slsmg_draw_hline' and
+  `slsmg_draw_vline' functions to draw a rectangular box on the
+  virtual display.  The box's upper left corner is placed at row
+  `r' and column `c'.  The length and width of the box is
+  specified by `dr' and `dc', respectively.
+
+ SEE ALSO
+  slsmg_draw_vline, slsmg_draw_hline, slsmg_draw_object
+
+--------------------------------------------------------------
+
+slsmg_get_column
+
+ SYNOPSIS
+  Get the column of the virtual cursor
+
+ USAGE
+  Integer_Type slsmg_get_column ()
+
+ DESCRIPTION
+  The `slsmg_get_column' function returns the current column of
+  the virtual cursor on the virtual display.
+
+ SEE ALSO
+  slsmg_get_row, slsmg_gotorc
+
+--------------------------------------------------------------
+
+slsmg_get_row
+
+ SYNOPSIS
+  Get the row of the virtual cursor
+
+ USAGE
+  Integer_Type slsmg_get_row ()
+
+ DESCRIPTION
+  The `slsmg_get_row' function returns the current row of the
+  virtual cursor on the virtual display.
+
+ SEE ALSO
+  slsmg_get_column, slsmg_gotorc
+
+--------------------------------------------------------------
+
+slsmg_forward
+
+ SYNOPSIS
+  Move the virtual cursor forward n columns
+
+ USAGE
+  slsmg_forward (Integer_Type n)
+
+ DESCRIPTION
+  The `slsmg_forward' function moves the virtual cursor forward
+  `n' columns.
+
+ SEE ALSO
+  slsmg_gotorc
+
+--------------------------------------------------------------
+
+slsmg_set_color_in_region
+
+ SYNOPSIS
+  Change the color of a specifed region
+
+ USAGE
+  slsmg_set_color_in_region (Integer_Type color, r, c, dr, dc)
+
+ DESCRIPTION
+  The `slsmg_set_color_in_region' function may be used to
+  change the color of a rectangular region whose upper left corner
+  is given by (`r',`c'), and whose height and width is given
+  by `dr' and `dc', respectively.  The color of the region
+  is given by the `color' parameter.
+
+ SEE ALSO
+  slsmg_draw_box, slsmg_set_color
+
+--------------------------------------------------------------
+
+slsmg_define_color
+
+ USAGE
+  slsmg_define_color (Integer_Type obj, String_Type fg, bg)
+
+ DESCRIPTION
+  The `slsmg_define_color' function associates the color
+  descriptor `obj' with a foreground and a background color.
+  The `fg' and `bg' colors can be one of the following strings:
+
+  "color0" or "black",      "color8"  or "gray",
+  "color1" or "red",        "color9"  or "brightred",
+  "color2" or "green",      "color10" or "brightgreen",
+  "color3" or "brown",      "color11" or "yellow",
+  "color4" or "blue",       "color12" or "brightblue",
+  "color5" or "magenta",    "color13" or "brightmagenta",
+  "color6" or "cyan",       "color14" or "brightcyan",
+  "color7" or "lightgray",  "color15" or "white"
+
+
+--------------------------------------------------------------
+
+slsmg_write_to_status_line
+
+ USAGE
+  slsmg_write_to_status_line (String_Type s)
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/modules/help/sockfuns.hlp Added

@@ -0,0 +1,235 @@
+socket
+
+ SYNOPSIS
+  Create a communications socket
+
+ USAGE
+  FD_Type socket (domain, type, protocol)
+
+ DESCRIPTION
+  The `socket' function creates a communications socket of the
+  specified domain, type, and protocol.  Currently supported domains
+  include `PF_UNIX' and `PF_INET'.  The various socket types
+  may be specified by the symbolic constants
+
+    SOCK_STREAM
+    SOCK_DGRAM
+    SOCK_SEQPACKET
+    SOCK_RAW
+    SOCK_RDM
+
+  The `protocol' parameter specifies the protocol to be used.
+  Normally only one protocol is support for a particular domain.  For
+  such cases, 0 should be passed for the `protocol' parameter.
+
+  If successful, the `socket' function will return a
+  file-descriptor that may be used with the `read' and
+  `write' function, or passed to other socket related functions.
+  Upon error, a `SocketError' exception will be thrown and
+  `errno' set accordingly.
+
+  When finished with the socket, it should be passed to the
+  `close' function.
+
+ EXAMPLE
+  The following example illustrates the creation of a socket for use
+  in the internet domain:
+
+     try {
+        s = socket (PF_INET, SOCK_STREAM, 0);
+     }
+     catch SocketError: {
+        () = fprintf (stderr, "socket failed: %s", errno_string(errno));
+        exit (1);
+     }
+
+
+ SEE ALSO
+  accept, bind, connect, listen, setsockopt, getsockopt
+
+--------------------------------------------------------------
+
+connect
+
+ SYNOPSIS
+  Make a connection to a socket
+
+ USAGE
+  connect (FD_Type s, address-args)
+
+ DESCRIPTION
+  The `connect' function may be used to connect a socket `s'
+  to the address specified by the address-arguments.  The type and
+  number of the address arguments must be consistent with the domain
+  of the socket.  For example, if the socket is in the Unix domain
+  (PF_UNIX), then a single string giving a filename must be passed as
+  the address-argument.  Sockets in the internet domain (PF_INET) take two
+  address arguments: a hostname and a port.
+
+  Upon failure, the function may throw a `SocketError' exception and set
+  `errno', or throw a `SocketHError' and set `h_error'.
+  It should be noted that `SocketHError' is a subclass of
+  `SocketError'.
+
+ EXAMPLE
+  The following example creates an internet domain socket and connects
+  it to port 32100 of a specified host:
+
+     try {
+        s = socket (PF_INET, SOCK_STREAM, 0);
+        connect (s, "some.host.com", 32100);
+     }
+     catch SocketHError: {...}
+     catch SocketError: {...}
+
+
+ SEE ALSO
+  accept, bind, listen, socket, setsockopt, getsockopt
+
+--------------------------------------------------------------
+
+bind
+
+ SYNOPSIS
+  Bind a local address-name to a socket
+
+ USAGE
+  bind (FD_Type s, address-args)
+
+ DESCRIPTION
+  The `bind' function may be used to assign a name to a specified
+  socket.  The address-args parameters specify the name in a
+  domain-specific manner.  For Unix domain sockets, the address is the
+  name of a file.  For sockets in the internet domain, the address is
+  given by a hostname and port number.
+
+  Upon failure, the function will throw a `SocketError' or
+  `SocketHError' exception.
+
+ EXAMPLE
+  The following example creates a `PF_UNIX' domain socket and
+  binds it to `"/tmp/mysock"':
+
+    s = socket (PF_UNIX, SOCK_STREAM, 0);
+    bind (s, "/tmp/mysock");
+
+
+  The next example creates a `PF_INET' domain socket and binds it
+  to port 32000 of the local host `my.host.com':
+
+    s = socket (PF_INET, SOCK_STREAM, 0);
+    bind (s, "my.host.com", 32000);
+
+
+ SEE ALSO
+  accept, connect, listen, socket, setsockopt, getsockopt
+
+--------------------------------------------------------------
+
+accept
+
+ SYNOPSIS
+  Accept a connection on a socket
+
+ USAGE
+  FD_Type accept (FD_Type s ,&address-args...
+
+ DESCRIPTION
+  The `accept' function accepts a connection on the specified
+  socket and returns a new socket that may be used to communicate with
+  the remote end.  It can optionally return the address of the remote
+  end through reference arguments.
+
+  Upon error, `accept' will throw a `SocketError' exception.
+
+ EXAMPLE
+  The following example accepts a remote connection on `PF_INET'
+  socket and returns the hostname and port used by the connected party:
+
+    s1 = accept (s, &hostip, &port);
+    vmessage ("Accepted connection from %s on port %d", hostip, port);
+
+
+ SEE ALSO
+  bind, connect, listen, socket, setsockopt, getsockopt
+
+--------------------------------------------------------------
+
+listen
+
+ SYNOPSIS
+  Listen for connections on a socket
+
+ USAGE
+  listen (FD_Type s, Int_Type max_pending)
+
+ DESCRIPTION
+  The `listen' function may be used to wait for a connection to a
+  socket `s'.  The second argument specified the maximum number
+  of pending connections to allow before refusing more.  Upon error, a
+  `SocketError' exception will be thrown.
+
+ SEE ALSO
+  accept, bind, connect, socket, setsockopt, getsockopt
+
+ SEE ALSO
+
+--------------------------------------------------------------
+
+getsockopt
+
+ SYNOPSIS
+  Get a socket option
+
+ USAGE
+  option = getsockopt (FD_Type s, Int_Type level, Int_Type optname)
+
+ DESCRIPTION
+  The `getsockopt' function returns the value of the option
+  specified by the integer `optname' residing at the specified
+  level.  The actual object returned depends upon the option
+  requested.  Upon error, a `SocketError' exception will be
+  generated.
+
+ EXAMPLE
+  The following example returns the SO_LINGER option of a socket.  In
+  this case, the value returned will be a structure:
+
+     s = socket (PF_INET, SOCK_STREAM, 0);
+     linger = getsockopt (s, SOL_SOCKET, SO_LINGER);
+
+
+ SEE ALSO
+  accept, bind, connect, listen, socket, getsockopt
+
+--------------------------------------------------------------
+
+setsockopt
+
+ SYNOPSIS
+  Set an option on a socket
+
+ USAGE
+  setsockopt (FD_Type s, Int_Type level, Int_Type optname, value)
+
+ DESCRIPTION
+  The `setsockopt' function sets the value of the option
+  specified by the integer `optname' residing at the specified
+  level.  The value of the last parameter will vary with the option to
+  be set.  Upon error, a `SocketError' exception will be
+  generated.
+
+ EXAMPLE
+  The following example sets the SO_LINGER option of a socket.  In
+  this case, the value is a structure:
+
+     s = socket (PF_INET, SOCK_STREAM, 0);
+     linger = struct { l_onoff, l_linger };
+     linger.l_onoff = 1; linger.l_linger = 10;
+     setsockopt (s, SOL_SOCKET, SO_LINGER, linger);
+
+
+ SEE ALSO
+  accept, bind, connect, listen, socket, getsockopt
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/modules/help/statsfuns.hlp Added

@@ -0,0 +1,880 @@
+ad_ktest
+
+ SYNOPSIS
+ k-sample Anderson-Darling test
+
+ USAGE
+ p = ad_ktest ({X1, X2, ...} ,&statistic ;qualifiers)
+
+ DESCRIPTION
+ The `ad_ktest' function performs a k-sample Anderson-Darling
+ test, which may be used to test the hypothesis that two or more
+ statistical samples come from the same underlying parent population.
+
+ The function returns the p-value representing the probability that
+ the samples are consistent with a common parent distribution. If
+ the last parameter is a reference, then the variable that it
+ references will be set to the value of the statistic upon return.
+
+ The paper that this test is based upon presents two statistical
+ tests: one for continuous data where ties are improbable, and one
+ for data where ties can occur. This function returns the p-value
+ and statistic for the latter case. A qualifier may be used to
+ obtain the p-value and statistic for the continuous case.
+
+ QUALIFIERS
+ ; pval2=&var: Set the variable `var' to the p-value for continuous case
+ ; stat2=&var: Set the variable `var' to the statistic for the continuous case.
+
+ NOTES
+ The k-sample test was implemented from the equations found in
+ Scholz F.W. and Stephens M.A., "K-Sample Anderson-Darling Tests",
+ Journal of the American Statistical Association, Vol 82, 399 (1987).
+
+ SEE ALSO
+ ks_test2, ad_test
+
+--------------------------------------------------------------
+
+ad_test
+
+ SYNOPSIS
+ Anderson-Darling test for normality
+
+ USAGE
+ pval = ad_test (X ,&statistic ;qualifiers)
+
+ DESCRIPTION
+ The `ad_test' function may be used to test the hypothesis that
+ random samples `X' come from a normal distribution. It returns
+ the p-value representing the probability of obtaining such a dataset
+ under the assumption that the data represent random samples of the
+ underlying distribution. If the optional second parameter is
+ present, then it must be a reference to a variable that will be set
+ to the value of the statistic upon return.
+
+ QUALIFIERS
+ ; mu=value: Specifies the known mean of the normal distribution.
+ ; sigma: Specifies the known standard deviation of the normal distribution
+ ; cdf: If present, the data will be interpreted as a CDFs of a known, but unspecified, distribution.
+
+ NOTES
+ For testing the hypothesis that a dataset is sampled from a known,
+ not necessarily normal, distribution, convert the random samples
+ into CDFs and pass those as the value of X to the `ad_test'
+ function. Also use the `cdf' qualifier to let the function
+ know that the values are CDFs and not random samples. When this is
+ done, the values of the CDFs will range from 0 to 1, and the p-value
+ returned by the function will be computed using an algorithm by
+ Marsaglia and Marsaglia: Evaluating the Anderson-Darling
+ Distribution, Journal of Statistical Software, Vol. 9, Issue 2, Feb
+ 2004.
+
+ SEE ALSO
+ ad_ktest, ks_test, t_test, z_test, normal_cdf,
+
+--------------------------------------------------------------
+
+median
+
+ SYNOPSIS
+ Compute the median of an array of values
+
+ USAGE
+ m = median (a ,i)
+
+ DESCRIPTION
+ This function computes the median of an array of values. The median
+ is defined to be the value such that half of the the array values will be
+ less than or equal to the median value and the other half greater than or
+ equal to the median value. If the array has an even number of
+ values, then the median value will be the smallest value that is
+ greater than or equal to half the values in the array.
+
+ If called with a second argument, then the optional argument
+ specifies the dimension of the array over which the median is to be
+ taken. In this case, an array of one less dimension than the input
+ array will be returned.
+
+ NOTES
+ This function makes a copy of the input array and then partially
+ sorts the copy. For large arrays, it may be undesirable to allocate
+ a separate copy. If memory use is to be minimized, the
+ `median_nc' function should be used.
+
+ SEE ALSO
+ median_nc, mean
+
+--------------------------------------------------------------
+
+median_nc
+
+ SYNOPSIS
+ Compute the median of an array
+
+ USAGE
+ m = median_nc (a ,i)
+
+ DESCRIPTION
+ This function computes the median of an array. Unlike the
+ `median' function, it does not make a temporary copy of the
+ array and, as such, is more memory efficient at the expense
+ increased run-time. See the `median' function for more
+ information.
+
+ SEE ALSO
+ median, mean
+
+--------------------------------------------------------------
+
+mean
+
+ SYNOPSIS
+ Compute the mean of the values in an array
+
+ USAGE
+ m = mean (a ,i)
+
+ DESCRIPTION
+ This function computes the arithmetic mean of the values in an
+ array. The optional parameter `i' may be used to specify the
+ dimension over which the mean it to be take. The default is to
+ compute the mean of all the elements.
+
+ EXAMPLE
+ Suppose that `a' is a two-dimensional MxN array. Then
+
+ m = mean (a);
+
+ will assign the mean of all the elements of `a' to `m'.
+ In contrast,
+
+ m0 = mean(a,0);
+ m1 = mean(a,1);
+
+ will assign the N element array to `m0', and an array of
+ M elements to `m1'. Here, the jth element of `m0' is
+ given by `mean(a*,j)', and the jth element of `m1' is
+ given by `mean(aj,*)'.
+
+ SEE ALSO
+ stddev, median, kurtosis, skewness
+
+--------------------------------------------------------------
+
+stddev
+
+ SYNOPSIS
+ Compute the standard deviation of an array of values
+
+ USAGE
+ s = stddev (a ,i)
+
+ DESCRIPTION
+ This function computes the standard deviation of the values in the
+ specified array. The optional parameter `i' may be used to
+ specify the dimension over which the standard-deviation it to be
+ taken. The default is to compute the standard deviation of all the
+ elements.
+
+ NOTES
+ This function returns the unbiased N-1 form of the sample standard
+ deviation.
+
+ SEE ALSO
+ mean, median, kurtosis, skewness
+
+--------------------------------------------------------------
+
+skewness
+
+ SYNOPSIS
+ Compute the skewness of an array of values
+
+ USAGE
+ s = skewness (a)
+
+ DESCRIPTION
+ This function computes the so-called skewness of the array `a'.
+
+ SEE ALSO
+ mean, stddev, kurtosis
+
+--------------------------------------------------------------
+
+kurtosis
+
+ SYNOPSIS
+ Compute the kurtosis of an array of values
+
+ USAGE
+ s = kurtosis (a)
+
+ DESCRIPTION
+ This function computes the so-called kurtosis of the array `a'.
+
+ NOTES
+ This function is defined such that the kurtosis of the normal
+ distribution is 0, and is also known as the ``excess-kurtosis''.
+
+ SEE ALSO
+ mean, stddev, skewness
+
+--------------------------------------------------------------
+
+binomial
+
+ SYNOPSIS
+ Compute binomial coefficients
+
+ USAGE
+ c = binomial (n ,m)
+
+ DESCRIPTION
+ This function computes the binomial coefficients (n m) where (n m)
+ is given by n!/(m!(n-m)!). If `m' is not provided, then an
+ array of coefficients for m=0 to n will be returned.
+
+--------------------------------------------------------------
+
+chisqr_cdf
+
+ SYNOPSIS
+ Compute the Chisqr CDF
+
+ USAGE
+ cdf = chisqr_cdf (Int_Type n, Double_Type d)
+
+ DESCRIPTION
+ This function returns the probability that a random number
+ distributed according to the chi-squared distribution for `n'
+ degrees of freedom will be less than the non-negative value `d'.
+
+ NOTES
+ The importance of this distribution arises from the fact that if
+ `n' independent random variables `X_1,...X_n' are
+ distributed according to a gaussian distribution with a mean of 0 and
+ a variance of 1, then the sum
+
+ X_1^2 + X_2^2 + ... + X_n^2
+
+ follows the chi-squared distribution with `n' degrees of freedom.
+
+ SEE ALSO
+ chisqr_test, poisson_cdf
+
+--------------------------------------------------------------
+
+poisson_cdf
+
+ SYNOPSIS
+ Compute the Poisson CDF
+
+ USAGE
+ cdf = poisson_cdf (Double_Type m, Int_Type k)
+
+ DESCRIPTION
+ This function computes the CDF for the Poisson probability
+ distribution parameterized by the value `m'. For values of
+ `m>100' and `abs(m-k)<sqrt(m)', the Wilson and Hilferty
+ asymptotic approximation is used.
+
+ SEE ALSO
+ chisqr_cdf
+
+--------------------------------------------------------------
+
+smirnov_cdf
+
+ SYNOPSIS
+ Compute the Kolmogorov CDF using Smirnov's asymptotic form
+
+ USAGE
+ cdf = smirnov_cdf (x)
+
+ DESCRIPTION
+ This function computes the CDF for the Kolmogorov distribution using
+ Smirnov's asymptotic form. In particular, the implementation is based
+ upon equation 1.4 from W. Feller, "On the Kolmogorov-Smirnov limit
+ theorems for empirical distributions", Annals of Math. Stat, Vol 19
+ (1948), pp. 177-190.
+
+ SEE ALSO
+ ks_test, ks_test2, normal_cdf
+
+--------------------------------------------------------------
+
+normal_cdf
+
+ SYNOPSIS
+ Compute the CDF for the Normal distribution
+
+ USAGE
+ cdf = normal_cdf (x)
+
+ DESCRIPTION
+ This function computes the CDF (integrated probability) for the
+ normal distribution.
+
+ SEE ALSO
+ smirnov_cdf, mann_whitney_cdf, poisson_cdf
+
+--------------------------------------------------------------
+
+mann_whitney_cdf
+
+ SYNOPSIS
+ Compute the Mann-Whitney CDF
+
+ USAGE
+ cdf = mann_whitney_cdf (Int_Type m, Int_Type n, Int_Type s)
+
+ DESCRIPTION
+ This function computes the exact CDF P(X<=s) for the Mann-Whitney
+ distribution. It is used by the `mw_test' function to compute
+ p-values for small values of `m' and `n'.
+
+ SEE ALSO
+ mw_test, ks_test, normal_cdf
+
+--------------------------------------------------------------
+
+kim_jennrich_cdf
+
+ SYNOPSIS
+ Compute the 2-sample KS CDF using the Kim-Jennrich Algorithm
+
+ USAGE
+ p = kim_jennrich (UInt_Type m, UInt_Type n, UInt_Type c)
+
+ DESCRIPTION
+ This function returns the exact two-sample Kolmogorov-Smirnov
+ probability that that `D_mn <= c/(mn)', where `D_mn' is
+ the two-sample Kolmogorov-Smirnov statistic computed from samples of
+ sizes `m' and `n'.
+
+ The algorithm used is that of Kim and Jennrich. The run-time scales
+ as m*n. As such, it is recommended that asymptotic form given by
+ the `smirnov_cdf' function be used for large values of m*n.
+
+ NOTES
+ For more information about the Kim-Jennrich algorithm, see:
+ Kim, P.J., and R.I. Jennrich (1973), Tables of the exact sampling
+ distribution of the two sample Kolmogorov-Smirnov criterion Dmn(m<n),
+ in Selected Tables in Mathematical Statistics, Volume 1, (edited
+ by H. L. Harter and D.B. Owen), American Mathematical Society,
+ Providence, Rhode Island.
+
+ SEE ALSO
+ smirnov_cdf, ks_test2
+
+--------------------------------------------------------------
+
+f_cdf
+
+ SYNOPSIS
+ Compute the CDF for the F distribution
+
+ USAGE
+ cdf = f_cdf (t, nu1, nu2)
+
+ DESCRIPTION
+ This function computes the CDF for the distribution and returns its
+ value.
+
+ SEE ALSO
+ f_test2
+
+--------------------------------------------------------------
+
+ks_test
+
+ SYNOPSIS
+ One sample Kolmogorov test
+
+ USAGE
+ p = ks_test (CDF ,&D)
+
+ DESCRIPTION
+ This function applies the Kolmogorov test to the data represented by
+ `CDF' and returns the p-value representing the probability that
+ the data values are ``consistent'' with the underlying distribution
+ function. If the optional parameter is passed to the function, then
+ it must be a reference to a variable that, upon return, will be
+ set to the value of the Kolmogorov statistic..
+
+ The `CDF' array that is passed to this function must be computed
+ from the assumed probability distribution function. For example, if
+ the data are constrained to lie between 0 and 1, and the null
+ hypothesis is that they follow a uniform distribution, then the CDF
+ will be equal to the data. In the data are assumed to be normally
+ (Gaussian) distributed, then the `normal_cdf' function can be
+ used to compute the CDF.
+
+ EXAMPLE
+ Suppose that X is an array of values obtained from repeated
+ measurements of some quantity. The values are are assumed to follow
+ a normal distribution with a mean of 20 and a standard deviation of
+ 3. The `ks_test' may be used to test this hypothesis using:
+
+ pval = ks_test (normal_cdf(X, 20, 3));
+
+
+ SEE ALSO
+ ks_test2, ad_test, kuiper_test, t_test, z_test
+
+--------------------------------------------------------------
+
+ks_test2
+
+ SYNOPSIS
+ Two-Sample Kolmogorov-Smirnov test
+
+ USAGE
+ prob = ks_test2 (X, Y ,&d)
+
+ DESCRIPTION
+ This function applies the 2-sample Kolmogorov-Smirnov test to two
+ datasets `X' and `Y' and returns p-value for the null
+ hypothesis that they share the same underlying distribution.
+ If the optional parameter is passed to the function, then
+ it must be a reference to a variable that, upon return, will be
+ set to the value of the statistic.
+
+ NOTES
+ If `length(X)*length(Y)<=10000', the `kim_jennrich_cdf'
+ function will be used to compute the exact probability. Otherwise an
+ asymptotic form will be used.
+
+ SEE ALSO
+ ks_test, ad_ktest, kuiper_test, kim_jennrich_cdf
+
+--------------------------------------------------------------
+
+kuiper_test
+
+ SYNOPSIS
+ Perform a 1-sample Kuiper test
+
+ USAGE
+ pval = kuiper_test (CDF ,&D)
+
+ DESCRIPTION
+ This function applies the Kuiper test to the data represented by
+ `CDF' and returns the p-value representing the probability that
+ the data values are ``consistent'' with the underlying distribution
+ function. If the optional parameter is passed to the function, then
+ it must be a reference to a variable that, upon return, will be
+ set to the value of the Kuiper statistic.
+
+ The `CDF' array that is passed to this function must be computed
+ from the assumed probability distribution function. For example, if
+ the data are constrained to lie between 0 and 1, and the null
+ hypothesis is that they follow a uniform distribution, then the CDF
+ will be equal to the data. In the data are assumed to be normally
+ (Gaussian) distributed, then the `normal_cdf' function can be
+ used to compute the CDF.
+
+ EXAMPLE
+ Suppose that X is an array of values obtained from repeated
+ measurements of some quantity. The values are are assumed to follow
+ a normal distribution with a mean of 20 and a standard deviation of
+ 3. The `ks_test' may be used to test this hypothesis using:
+
+ pval = kuiper_test (normal_cdf(X, 20, 3));
+
+
+ SEE ALSO
+ kuiper_test2, ks_test, t_test
+
+--------------------------------------------------------------
+
+kuiper_test2
+
+ SYNOPSIS
+ Perform a 2-sample Kuiper test
+
+ USAGE
+ pval = kuiper_test2 (X, Y ,&D)
+
+ DESCRIPTION
+ This function applies the 2-sample Kuiper test to two
+ datasets `X' and `Y' and returns p-value for the null
+ hypothesis that they share the same underlying distribution.
+ If the optional parameter is passed to the function, then
+ it must be a reference to a variable that, upon return, will be
+ set to the value of the Kuiper statistic.
+
+ NOTES
+ The p-value is computed from an asymptotic formula suggested by
+ Stephens, M.A., Journal of the American Statistical Association, Vol
+ 69, No 347, 1974, pp 730-737.
+
+ SEE ALSO
+ ks_test2, kuiper_test
+
+--------------------------------------------------------------
+
+chisqr_test
+
+ SYNOPSIS
+ Apply the Chi-square test to a two or more datasets
+
+ USAGE
+ prob = chisqr_test (X_1, X_2, ..., X_N ,&t)
+
+ DESCRIPTION
+ This function applies the Chi-square test to the N datasets
+ `X_1', `X_2', ..., `X_N', and returns the probability
+ that each of the datasets were drawn from the same underlying
+ distribution. Each of the arrays `X_k' must be the same length.
+ If the last parameter is a reference to a variable, then upon return
+ the variable will be set to the value of the statistic.
+
+ SEE ALSO
+ chisqr_cdf, ks_test2, mw_test
+
+--------------------------------------------------------------
+
+mw_test
+
+ SYNOPSIS
+ Apply the Two-sample Wilcoxon-Mann-Whitney test
+
+ USAGE
+ p = mw_test(X, Y ,&w)
+
+ DESCRIPTION
+ This function performs a Wilcoxon-Mann-Whitney test and returns the
+ p-value for the null hypothesis that there is no difference between
+ the distributions represented by the datasets `X' and `Y'.
+
+ If a third argument is given, it must be a reference to a variable
+ whose value upon return will be to to the rank-sum of `X'.
+
+ QUALIFIERS
+ The function makes use of the following qualifiers:
+
+ side=">" : H0: P(X<Y) >= 1/2 (right-tail)
+ side="<" : H0: P(X<Y) <= 1/2 (left-tail)
+
+ The default null hypothesis is that `P(X<Y)=1/2'.
+
+ NOTES
+ There are a number of definitions of this test. While the exact
+ definition of the statistic varies, the p-values are the same.
+
+ If `length(X)<50', `length(Y)' < 50, and ties are not
+ present, then the exact p-value is computed using the
+ `mann_whitney_cdf' function. Otherwise a normal distribution is
+ used.
+
+ This test is often referred to as the non-parametric generalization
+ of the Student t-test.
+
+ SEE ALSO
+ mann_whitney_cdf, ks_test2, chisqr_test, t_test
+
+--------------------------------------------------------------
+
+student_t_cdf
+
+ SYNOPSIS
+ Compute the Student-t CDF
+
+ USAGE
+ cdf = student_t_cdf (t, n)
+
+ DESCRIPTION
+This function computes the CDF for the Student-t distribution for n
+degrees of freedom.
+
+ SEE ALSO
+ t_test, normal_cdf
+
+--------------------------------------------------------------
+
+f_test2
+
+ SYNOPSIS
+ Apply the Two-sample F test
+
+ USAGE
+ p = f_test2 (X, Y ,&F
+
+ DESCRIPTION
+ This function computes the two-sample F statistic and its p-value
+ for the data in the `X' and `Y' arrays. This test is used
+ to compare the variances of two normally-distributed data sets, with
+ the null hypothesis that the variances are equal. The return value
+ is the p-value, which is computed using the module's `f_cdf'
+ function.
+
+ QUALIFIERS
+ The function makes use of the following qualifiers:
+
+ side=">" : H0: VarX >= VarY (right-tail)
+ side="<" : H0: VarX <= VarY (left-tail)
+
+
+ SEE ALSO
+ f_cdf, ks_test2, chisqr_test
+
+--------------------------------------------------------------
+
+t_test
+
+ SYNOPSIS
+ Perform a Student t-test
+
+ USAGE
+ pval = t_test (X, mu ,&t)
+
+ DESCRIPTION
+ The one-sample t-test may be used to test that the population mean has a
+ specified value under the null hypothesis. Here, `X' represents a
+ random sample drawn from the population and `mu' is the
+ specified mean of the population. This function computes Student's
+ t-statistic and returns the p-value
+ that the data X were randomly sampled from a population with the
+ specified mean.
+ If the optional parameter is passed to the function, then
+ it must be a reference to a variable that, upon return, will be
+ set to the value of the statistic.
+
+ QUALIFIERS
+ The following qualifiers may be used to specify a 1-sided test:
+
+ side="<" Perform a left-tailed test
+ side=">" Perform a right-tailed test
+
+
+ NOTES
+ While the parent population need not be normal, the test assumes
+ that random samples drawn from this distribution have means that
+ are normally distributed.
+
+ Strictly speaking, this test should only be used if the variance of
+ the data are equal to that of the assumed parent distribution. Use
+ the Mann-Whitney-Wilcoxon (`mw_test') if the underlying
+ distribution is non-normal.
+
+ SEE ALSO
+ mw_test, t_test2
+
+--------------------------------------------------------------
+
+t_test2
+
+ SYNOPSIS
+ Perform a 2-sample Student t-test
+
+ USAGE
+ pval = t_test2 (X, Y ,&t)
+
+ DESCRIPTION
+ This function compares two data sets `X' and `Y' using the
+ Student t-statistic. It is assumed that the the parent populations
+ are normally distributed with equal variance, but with possibly
+ different means. The test is one that looks for differences in the
+ means.
+
+ NOTES
+ The `welch_t_test2' function may be used if it is not known that
+ the parent populations have the same variance.
+
+ SEE ALSO
+ t_test2, welch_t_test2, mw_test
+
+--------------------------------------------------------------
+
+welch_t_test2
+
+ SYNOPSIS
+ Perform Welch's t-test
+
+ USAGE
+ pval = welch_t_test2 (X, Y ,&t)
+
+ DESCRIPTION
+ This function applies Welch's t-test to the 2 datasets `X' and
+ `Y' and returns the p-value that the underlying populations have
+ the same mean. The parent populations are assumed to be normally
+ distributed, but need not have the same variance.
+ If the optional parameter is passed to the function, then
+ it must be a reference to a variable that, upon return, will be
+ set to the value of the statistic.
+
+ QUALIFIERS
+ The following qualifiers may be used to specify a 1-sided test:
+
+ side="<" Perform a left-tailed test
+ side=">" Perform a right-tailed test
+
+
+ SEE ALSO
+ t_test2
+
+--------------------------------------------------------------
+
+z_test
+
+ SYNOPSIS
+ Perform a Z test
+
+ USAGE
+ pval = z_test (X, mu, sigma ,&z)
+
+ DESCRIPTION
+ This function applies a Z test to the data `X' and returns the
+ p-value that the data are consistent with a normally-distributed
+ parent population with a mean of `mu' and a standard-deviation
+ of `sigma'. If the optional parameter is passed to the function, then
+ it must be a reference to a variable that, upon return, will be
+ set to the value of the Z statistic.
+
+ SEE ALSO
+ t_test, mw_test
+
+--------------------------------------------------------------
+
+kendall_tau
+
+ SYNOPSIS
+ Kendall's tau Correlation Test
+
+ USAGE
+ pval = kendall_tau (x, y ,&tau)
+
+ DESCRIPTION
+ This function computes Kendall's tau statistic for the paired data
+ values (x,y), which may or may not have ties. It returns the
+ double-sided p-value associated with the statistic.
+
+ NOTES
+ The implementation is based upon Knight's O(nlogn) algorithm
+ described in "A computer method for calculating Kendall’s tau with
+ ungrouped data", Journal of the American Statistical Association, 61,
+ 436-439.
+
+ In the case of no ties, the exact p-value is computed when length(x)
+ is less than 30 using algorithm 71 of Applied Statistics (1974) by
+ Best and Gipps. If ties are present, the the p-value is computed
+ based upon the normal distribution and a continuity correction.
+
+ QUALIFIERS
+ The following qualifiers may be used to specify a 1-sided test:
+
+ side="<" Perform a left-tailed test
+ side=">" Perform a right-tailed test
+
+
+ SEE ALSO
+ spearman_r, pearson_r, mann_kendall
+
+--------------------------------------------------------------
+
+mann_kendall
+
+ SYNOPSIS
+ Mann-Kendall trend test
+
+ USAGE
+ pval = mann_kendall (y ,&tau)
+
+ DESCRIPTION
+ The Mann-Kendall test is a non-parametric test that may be used to
+ identify a trend in a set of serial data values. It is closely
+ related to the Kendall's tau correlation test.
+
+ The `mann_kendall' function returns the double-sided p-value
+ that may be used as a basis for rejecting the the null-hypothesis
+ that there is no trend in the data.
+
+ QUALIFIERS
+ The following qualifiers may be used to specify a 1-sided test:
+
+ side="<" Perform a left-tailed test
+ side=">" Perform a right-tailed test
+
+
+ SEE ALSO
+ spearman_r, pearson_r, mann_kendall
+
+--------------------------------------------------------------
+
+pearson_r
+
+ SYNOPSIS
+ Compute Pearson's Correlation Coefficient
+
+ USAGE
+ pval = pearson_r (X, Y ,&r)
+
+ DESCRIPTION
+ This function computes Pearson's r correlation coefficient of the two
+ datasets `X' and `Y'. It returns the the p-value that
+ `x' and `y' are mutually independent.
+ If the optional parameter is passed to the function, then
+ it must be a reference to a variable that, upon return, will be
+ set to the value of the correlation coefficient.
+
+ QUALIFIERS
+ The following qualifiers may be used to specify a 1-sided test:
+
+ side="<" Perform a left-tailed test
+ side=">" Perform a right-tailed test
+
+
+ SEE ALSO
+ kendall_tau, spearman_r
+
+--------------------------------------------------------------
+
+spearman_r
+
+ SYNOPSIS
+ Spearman's Rank Correlation test
+
+ USAGE
+ pval = spearman_r(x, y ,&r)
+
+ DESCRIPTION
+ This function computes the Spearman rank correlation coefficient (r)
+ and returns the p-value that `x' and `y' are mutually
+ independent.
+ If the optional parameter is passed to the function, then
+ it must be a reference to a variable that, upon return, will be
+ set to the value of the correlation coefficient.
+
+ QUALIFIERS
+ The following qualifiers may be used to specify a 1-sided test:
+
+ side="<" Perform a left-tailed test
+ side=">" Perform a right-tailed test
+
+
+ SEE ALSO
+ kendall_tau, pearson_r
+
+--------------------------------------------------------------
+
+correlation
+
+ SYNOPSIS
+ Compute the sample correlation between two datasets
+
+ USAGE
+ c = correlation (x, y)
+
+ DESCRIPTION
+ This function computes Pearson's sample correlation coefficient
+ between 2 arrays. It is assumed that the standard deviation of each
+ array is finite and non-zero. The returned value falls in the
+ range -1 to 1, with -1 indicating that the data are anti-correlated,
+ and +1 indicating that the data are completely correlated.
+
+ SEE ALSO
+ covariance, stddev
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/modules/histogram-module.c Added

@@ -0,0 +1,921 @@
+/* -*- mode: C; mode: fold; -*- */
+
+/*
+ Copyright (c) 2003-2007 Massachusetts Institute of Technology
+ Copyright (c) 2013-2017,2018 John E. Davis <jed@jedsoft.org>
+
+ This software was developed by the MIT Center for Space Research
+ under contract SV1-61010 from the Smithsonian Institution.
+
+ Permission to use, copy, modify, distribute, and sell this software
+ and its documentation for any purpose is hereby granted without fee,
+ provided that the above copyright notice appear in all copies and
+ that both that copyright notice and this permission notice appear in
+ the supporting documentation, and that the name of the Massachusetts
+ Institute of Technology not be used in advertising or publicity
+ pertaining to distribution of the software without specific, written
+ prior permission. The Massachusetts Institute of Technology makes
+ no representations about the suitability of this software for any
+ purpose. It is provided "as is" without express or implied warranty.
+
+ THE MASSACHUSETTS INSTITUTE OF TECHNOLOGY DISCLAIMS ALL WARRANTIES
+ WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF
+ MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE MASSACHUSETTS
+ INSTITUTE OF TECHNOLOGY BE LIABLE FOR ANY SPECIAL, INDIRECT OR
+ CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
+ OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
+ NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
+ WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+
+/* Author: John E. Davis (davis@space.mit.edu) */
+
+#include "config.h"
+
+#include <stdio.h>
+#include <math.h>
+#include <slang.h>
+#include <string.h>
+
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+SLANG_MODULE(histogram);
+#ifdef __cplusplus
+}
+#endif
+
+#define MODULE_VERSION_STRING	"0.4.0"
+#define MODULE_VERSION_NUMBER	400
+
+typedef unsigned int HistData_Type;
+#define HISTDATA_TYPE SLANG_UINT_TYPE
+
+static const char *Module_Version_String = MODULE_VERSION_STRING;
+
+#ifndef HAVE_ISNAN
+# define isnan(x) (x != x)
+#endif
+
+static int check_grid (double *x, SLuindex_Type n)
+{
+ double xlo;
+ SLuindex_Type i;
+
+ if (n == 0)
+ return 0;
+
+ xlo = x0;
+
+ if (isnan(xlo))
+ goto return_error;
+
+ for (i = 0; i < n; i++)
+ {
+	if (isnan(xi))
+	 goto return_error;
+
+	if (xi < xlo)
+	 goto return_error;
+
+	xlo = xi;
+ }
+ return 0;
+
+return_error:
+ SLang_verror (SL_INVALID_PARM, "Invalid grid: Expecting one in increasing order");
+ return -1;
+}
+
+static SLuindex_Type double_binary_search (double x, double *xp, SLuindex_Type n)
+{
+ SLuindex_Type n0, n1, n2;
+ /* SLuindex_Type j; */
+ double xp0, xp1;
+
+ if (n < 2)
+ return 0;
+
+ if (x < (xp0 = xp0))
+ return 0;
+ if (x >= (xp1 = xpn-1))
+ return n-1;
+#if 0
+ j = (SLuindex_Type) (((x - xp0)/(xp1 - xp0))*(n-1));
+ if (j < n)
+ {
+	if (x >= xpj)
+	 {
+	 if ((j == n-1) || (xpj+1 < x))
+	 return j;
+	 n0 = j;
+	 n1 = n;
+	 }
+	else
+	 {
+	 n0 = 0;
+	 n1 = j;
+	 }
+ }
+ else
+ {
+	n0 = 0;
+	n1 = n;
+ }
+#else
+ n0 = 0;
+ n1 = n;
+#endif
+
+ while (n1 > n0 + 1)
+ {
+	/* Note: since n1 > n0+1, then n1 >= n0+2, and n0+n1 >= 2*n0+2
+	 * ==> n2 = (n0+n1)/2 >= n0+1.
+	 * ==> n2 > n0
+	 * Also, n1 >= n0+2 ==> n1-2 >= n0 ==> 2*n1 - 2 >= (n0+n1)
+	 * ==> n2 = (n0+n1)/2 <= n1-1 ==> n2+1 <= n1
+	 * ==> n2 < n1
+	 * Hence, n0 < n1 < n2. This means that the interval determined
+	 * by the following code will become smaller.
+	 */
+	n2 = (n0 + n1) / 2;
+	if (xpn2 > x)
+	 n1 = n2;
+	else
+	 n0 = n2;
+ }
+ return n0;
+}
+
+#define BIN_EDGES_TYPE double
+#define BINARY_SEARCH double_binary_search
+#define PTS_TYPE unsigned char
+#define HISTOGRAM_1D uc_histogram_1d
+#define HISTOGRAM_2D uc_histogram_2d
+#define CHECK_NANS 0
+#include "histogram-module.inc"
+
+#define BIN_EDGES_TYPE double
+#define BINARY_SEARCH double_binary_search
+#define PTS_TYPE int
+#define HISTOGRAM_1D i_histogram_1d
+#define HISTOGRAM_2D i_histogram_2d
+#define CHECK_NANS 0
+#include "histogram-module.inc"
+
+#define BIN_EDGES_TYPE double
+#define BINARY_SEARCH double_binary_search
+#define PTS_TYPE float
+#define HISTOGRAM_1D f_histogram_1d
+#define HISTOGRAM_2D f_histogram_2d
+#define CHECK_NANS 1
+#include "histogram-module.inc"
+
+#define BIN_EDGES_TYPE double
+#define BINARY_SEARCH double_binary_search
+#define PTS_TYPE double
+#define HISTOGRAM_1D d_histogram_1d
+#define HISTOGRAM_2D d_histogram_2d
+#define HISTOGRAM_REBIN d_hist1d_rebin
+#define CHECK_NANS 1
+#include "histogram-module.inc"
+
+static int uc_fast_hist_1d (unsigned char *pts, SLuindex_Type npts,
+			 double *bin_edges, SLuindex_Type nbins,
+			 HistData_Type *histogram)
+{
+ HistData_Type h256;
+ SLuindex_Type i;
+ SLuindex_Type nbins_m1;
+
+ if (nbins == 0)
+ return 0;
+
+ if (-1 == check_grid (bin_edges, nbins))
+ return -1;
+
+ for (i = 0; i < 256; i++)
+ hi = 0.0;
+
+ for (i = 0; i < npts; i++)
+ hptsi++;
+
+ nbins_m1 = nbins - 1;
+ for (i = 0; i < nbins_m1; i++)
+ {
+	double x0, x1;
+	SLuindex_Type ix0;
+
+	x1 = bin_edgesi+1;
+	if (x1 <= 0.0)
+	 continue;
+
+	x0 = bin_edgesi;
+	if (x0 < 0.0)
+	 x0 = 0.0;
+	ix0 = (SLuindex_Type) ceil (x0);
+
+	while (i < nbins_m1)
+	 {
+	 SLuindex_Type ix1;
+	 SLuindex_Type j, jmax;
+
+	 x1 = bin_edgesi+1;
+	 ix1 = (SLuindex_Type) ceil (x1);
+	 jmax = ix1;
+	 if (jmax > 256) jmax = 256;
+
+	 for (j = ix0; j < jmax; j++)
+	 histogrami += hj;
+
+	 ix0 = ix1;
+	 if (ix0 > 255)
+	 break;
+	 i++;
+	 }
+ }
+
+ /* Handle overflow bin */
+
+ if (bin_edgesnbins_m1 < 0)
+ i = 0;
+ else
+ i = (SLuindex_Type) ceil (bin_edgesnbins_m1);
+
+ while (i < 256)
+ {
+	histogramnbins_m1 += hi;
+	i++;
+ }
+ return 0;
+}
+
+static SLang_Array_Type *convert_reverse_indices (SLindex_Type *r, SLuindex_Type num_r, SLang_Array_Type *h)
+{
+ SLang_Array_Type *new_r;
+ SLang_Array_Type **new_r_data;
+ SLuindex_Type i, num_h;
+ SLindex_Type *lens;
+
+ if (NULL == (new_r = SLang_create_array (SLANG_ARRAY_TYPE, 0, NULL, h->dims, h->num_dims)))
+ return NULL;
+
+ num_h = h->num_elements;
+
+ if (NULL == (lens = (SLindex_Type *)SLmalloc (num_h * sizeof (SLindex_Type))))
+ {
+	SLang_free_array (new_r);
+	return NULL;
+ }
+ memset ((char *)lens, 0, num_h*sizeof(SLindex_Type));
+
+ for (i = 0; i < num_r; i++)
+ {
+	SLindex_Type r_i = ri;
+
+	if (r_i >= 0)
+	 lensr_i++;
+ }
+
+ new_r_data = (SLang_Array_Type **) new_r->data;
+ for (i = 0; i < num_h; i++)
+ {
+	if (NULL == (new_r_datai = SLang_create_array (SLANG_ARRAY_INDEX_TYPE, 0, NULL, &lensi, 1)))
+	 goto return_error;
+
+	lensi = 0;
+ }
+
+ for (i = 0; i < num_r; i++)
+ {
+	SLang_Array_Type *at;
+	SLindex_Type r_i = ri;
+
+	if (r_i < 0)
+	 continue;
+
+	at = new_r_datar_i;
+
+	((SLindex_Type *)at->data)lensr_i = i;
+	lensr_i++;
+ }
+
+ SLfree ((char *)lens);
+ return new_r;
+
+ return_error:
+ SLfree ((char *) lens);
+ SLang_free_array (new_r);
+ return NULL;
+}
+
+static int map_to_best_type (int type, int *mtypep)
+{
+ switch (type)
+ {
+ case SLANG_UCHAR_TYPE:
+	*mtypep = SLANG_UCHAR_TYPE;
+	break;
+
+ case SLANG_CHAR_TYPE:
+ case SLANG_SHORT_TYPE:
+ case SLANG_INT_TYPE:
+	*mtypep = SLANG_INT_TYPE;
+	break;
+
+ case SLANG_FLOAT_TYPE:
+	*mtypep = SLANG_FLOAT_TYPE;
+	break;
+
+ default:
+	*mtypep = SLANG_DOUBLE_TYPE;
+	break;
+ }
+ return 0;
+}
+
+static int pop_1d_array_of_type (SLang_Array_Type **atp, int type)
+{
+ SLang_Array_Type *at;
+
+ if (-1 == SLang_pop_array_of_type (&at, type))
+ return -1;
+
+ if (at->num_dims != 1)
+ {
+	SLang_verror (SL_INVALID_PARM, "Expecting a 1-d array");
+	SLang_free_array (at);
+	return -1;
+ }
+ *atp = at;
+ return 0;
+}
+
+static int pop_1d_double_arrays (SLang_Array_Type **ap, SLang_Array_Type **bp)
+{
+ SLang_Array_Type *a, *b;
+
+ *ap = *bp = NULL;
+
+ if (-1 == pop_1d_array_of_type (&b, SLANG_DOUBLE_TYPE))
+ return -1;
+
+ if (-1 == pop_1d_array_of_type (&a, SLANG_DOUBLE_TYPE))
+ {
+	SLang_free_array (b);
+	return -1;
+ }
+
+ if (a->num_elements != b->num_elements)
+ {
+	SLang_verror (SL_INVALID_PARM, "Arrays do not match in size");
+	SLang_free_array (b);
+	SLang_free_array (a);
+	return -1;
+ }
+
+ *ap = a;
+ *bp = b;
+ return 0;
+}
+
+static int pop_hist1d_pts_array (SLang_Array_Type **at)
+{
+ int type;
+
+ if (-1 == map_to_best_type (SLang_peek_at_stack1 (), &type))
+ return -1;
+#if 1
+ if (-1 == SLang_pop_array_of_type (at, type))
+ return -1;
+#else
+ if (-1 == pop_1d_array_of_type (at, type))
+ return -1;
+#endif
+ return 0;
+}
+
+static int pop_hist2d_pts_array (SLang_Array_Type **atxp,
+				 SLang_Array_Type **atyp)
+{
+ int ytype, xtype;
+ SLang_Array_Type *atx, *aty;
+
+ ytype = SLang_peek_at_stack1 ();
+ if (-1 == SLroll_stack (2))
+ return -1;
+ xtype = SLang_peek_at_stack1 ();
+
+ if (-1 == map_to_best_type (ytype, &ytype))
+ return -1;
+ if (-1 == map_to_best_type (xtype, &xtype))
+ return -1;
+
+ if (xtype != ytype)
+ ytype = xtype = SLANG_DOUBLE_TYPE;
+
+ if (-1 == pop_1d_array_of_type (&atx, xtype))
+ return -1;
+
+ if (-1 == pop_1d_array_of_type (&aty, ytype))
+ {
+	SLang_free_array (atx);
+	return -1;
+ }
+
+ if (atx->num_elements != aty->num_elements)
+ {
+	SLang_verror (SL_INVALID_PARM, "hist2d: x and y points arrays must match in size");
+	SLang_free_array (aty);
+	SLang_free_array (atx);
+	return -1;
+ }
+
+ *atxp = atx;
+ *atyp = aty;
+ return 0;
+}
+
+static SLindex_Type *alloc_reverse_indices (SLuindex_Type num)
+{
+ SLuindex_Type i;
+ SLindex_Type *r;
+
+ if (NULL == (r = (SLindex_Type *) SLmalloc ((num + 1) * sizeof(SLindex_Type))))
+ return NULL;
+
+ for (i = 0; i < num; i++)
+ ri = -1;
+
+ return r;
+}
+
+static void hist1d (void)
+{
+ SLang_Array_Type *edges_at, *hist_at, *pts_at, *indices_at;
+ SLang_Ref_Type *ref;
+ SLindex_Type *rev_indices;
+ int status, type, has_hist = 0;
+
+ ref = NULL;
+ switch (SLang_Num_Function_Args)
+ {
+ case 4:
+	has_hist = 1;
+	if (SLang_peek_at_stack () == SLANG_NULL_TYPE)
+	 (void) SLdo_pop ();
+	else if (-1 == SLang_pop_ref (&ref))
+	 return;
+	break;
+
+ case 3:
+	type = SLang_peek_at_stack ();
+	if (type == SLANG_REF_TYPE)
+	 {
+	 if (-1 == SLang_pop_ref (&ref))
+	 return;
+	 }
+	else if (type == SLANG_NULL_TYPE)
+	 (void) SLdo_pop ();
+	else
+	 has_hist = 1;
+	break;
+
+ case 2:
+	break;
+
+ default:
+	SLang_verror (SL_USAGE_ERROR, "h = hist1d (h, points, bins ,&reverse-indices)");
+	return;
+ }
+
+ if (-1 == SLang_pop_array_of_type (&edges_at, SLANG_DOUBLE_TYPE))
+ {
+	SLang_free_ref (ref);
+	return;
+ }
+
+ pts_at = NULL;
+ hist_at = NULL;
+ indices_at = NULL;
+ rev_indices = NULL;
+
+ if (-1 == pop_hist1d_pts_array (&pts_at))
+ goto free_and_return;
+
+ if (has_hist && (SLang_peek_at_stack () == SLANG_NULL_TYPE))
+ {
+	(void) SLdo_pop ();
+	has_hist = 0;
+ }
+
+ if (has_hist)
+ {
+	if (-1 == SLang_pop_array_of_type (&hist_at, HISTDATA_TYPE))
+	 goto free_and_return;
+	if (hist_at->flags & SLARR_DATA_VALUE_IS_READ_ONLY)
+	 {
+	 SLang_verror (SL_InvalidParm_Error, "Input histogram array is read-only");
+	 goto free_and_return;
+	 }
+	if ((hist_at->num_dims != 1)
+	 || (hist_at->dims0 != edges_at->dims0))
+	 {
+	 SLang_verror (SL_InvalidParm_Error, "Input histogram array is not 1d or does not match grid");
+	 goto free_and_return;
+	 }
+ }
+ else
+ {
+	if (NULL == (hist_at = SLang_create_array (HISTDATA_TYPE, 0, NULL, edges_at->dims, 1)))
+	 goto free_and_return;
+	/* hist_at->data is already initialized to 0 */
+ }
+
+ if ((ref != NULL)
+ && (NULL == (rev_indices = alloc_reverse_indices (pts_at->num_elements))))
+ goto free_and_return;
+
+ switch (pts_at->data_type)
+ {
+ case SLANG_UCHAR_TYPE:
+	if (rev_indices == NULL)
+	 status = uc_fast_hist_1d ((unsigned char *)pts_at->data, pts_at->num_elements,
+				 (double *)edges_at->data, edges_at->num_elements,
+				 (HistData_Type *) hist_at->data);
+	else status = uc_histogram_1d ((unsigned char *)pts_at->data, pts_at->num_elements,
+				 (double *)edges_at->data, edges_at->num_elements,
+				 (HistData_Type *) hist_at->data, rev_indices);
+	break;
+
+ case SLANG_INT_TYPE:
+	status = i_histogram_1d ((int *)pts_at->data, pts_at->num_elements,
+				 (double *)edges_at->data, edges_at->num_elements,
+				 (HistData_Type *) hist_at->data, rev_indices);
+	break;
+
+ case SLANG_FLOAT_TYPE:
+	status = f_histogram_1d ((float *)pts_at->data, pts_at->num_elements,
+				 (double *)edges_at->data, edges_at->num_elements,
+				 (HistData_Type *) hist_at->data, rev_indices);
+	break;
+
+ case SLANG_DOUBLE_TYPE:
+	status = d_histogram_1d ((double *)pts_at->data, pts_at->num_elements,
+				 (double *)edges_at->data, edges_at->num_elements,
+				 (HistData_Type *) hist_at->data, rev_indices);
+	break;
+
+ default:
+	SLang_verror (SL_INTERNAL_ERROR, "Error in hist1d: array not supported");
+	status = -1;
+ }
+
+ if (status == -1)
+ goto free_and_return;
+
+ if (ref != NULL)
+ {
+	if (NULL == (indices_at = convert_reverse_indices (rev_indices, pts_at->num_elements, hist_at)))
+	 goto free_and_return;
+
+	if (-1 == SLang_assign_to_ref (ref, SLANG_ARRAY_TYPE, (VOID_STAR) &indices_at))
+	 goto free_and_return;
+ }
+
+ (void) SLang_push_array (hist_at, 0);
+
+ /* NULLs ok below */
+ free_and_return:
+ if (rev_indices != NULL) SLfree ((char *) rev_indices);
+ SLang_free_ref (ref);
+ SLang_free_array (indices_at);
+ SLang_free_array (edges_at);
+ SLang_free_array (pts_at);
+ SLang_free_array (hist_at);
+}
+
+static void hist2d (void)
+{
+ SLang_Array_Type *xedges_at, *yedges_at, *xpts_at, *ypts_at;
+ SLang_Array_Type *hist_at, *indices_at;
+ SLang_Ref_Type *ref;
+ SLindex_Type *rev_indices;
+ int has_hist = 0;
+ int type;
+ SLindex_Type dims2;
+
+ ref = NULL;
+ switch (SLang_Num_Function_Args)
+ {
+ case 6:
+	has_hist = 1;
+	if (SLang_peek_at_stack () == SLANG_NULL_TYPE)
+	 (void) SLdo_pop ();
+	else if (-1 == SLang_pop_ref (&ref))
+	 return;
+	break;
+
+ case 5:
+	type = SLang_peek_at_stack ();
+	if (type == SLANG_REF_TYPE)
+	 {
+	 if (-1 == SLang_pop_ref (&ref))
+	 return;
+	 }
+	else if (type == SLANG_NULL_TYPE)
+	 (void) SLdo_pop ();
+	else
+	 has_hist = 1;
+	break;
+
+ case 4:
+	break;
+
+ default:
+	SLang_verror (SL_USAGE_ERROR, "h = hist2d (h, xpnts, ypnts, xbins, ybins ,&reverse-indices)");
+	return;
+ }
+
+ if (-1 == SLang_pop_array_of_type (&yedges_at, SLANG_DOUBLE_TYPE))
+ {
+	SLang_free_ref (ref);
+	return;
+ }
+
+ if (-1 == SLang_pop_array_of_type (&xedges_at, SLANG_DOUBLE_TYPE))
+ {
+	SLang_free_array (yedges_at);
+	SLang_free_ref (ref);
+	return;
+ }
+
+ xpts_at = ypts_at = NULL;
+ hist_at = NULL;
+ indices_at = NULL;
+ rev_indices = NULL;
+
+ if (-1 == pop_hist2d_pts_array (&xpts_at, &ypts_at))
+ goto free_and_return;
+
+ if (has_hist && (SLang_peek_at_stack () == SLANG_NULL_TYPE))
+ {
+	(void) SLdo_pop ();
+	has_hist = 0;
+ }
+
+ dims0 = xedges_at->num_elements;
+ dims1 = yedges_at->num_elements;
+
+ if (has_hist)
+ {
+	if (-1 == SLang_pop_array_of_type (&hist_at, HISTDATA_TYPE))
+	 goto free_and_return;
+	if (hist_at->flags & SLARR_DATA_VALUE_IS_READ_ONLY)
+	 {
+	 SLang_verror (SL_InvalidParm_Error, "Input histogram array is read-only");
+	 goto free_and_return;
+	 }
+	if ((hist_at->num_dims != 2)
+	 || (hist_at->dims0 != dims0)
+	 || (hist_at->dims1 != dims1))
+	 {
+	 SLang_verror (SL_InvalidParm_Error, "Input histogram array is not 2d or does not match grids");
+	 goto free_and_return;
+	 }
+ }
+ else if (NULL == (hist_at = SLang_create_array (HISTDATA_TYPE, 0, NULL, dims, 2)))
+ goto free_and_return;
+ /* hist_at->data is already initialized to 0 */
+
+ if ((ref != NULL)
+ && (NULL == (rev_indices = alloc_reverse_indices (xpts_at->num_elements))))
+ goto free_and_return;
+
+ switch (xpts_at->data_type)
+ {
+ case SLANG_UCHAR_TYPE:
+	if (-1 == uc_histogram_2d ((unsigned char *)xpts_at->data, (unsigned char *)ypts_at->data, ypts_at->num_elements,
+				 (double *)xedges_at->data, xedges_at->num_elements,
+				 (double *)yedges_at->data, yedges_at->num_elements,
+				 (HistData_Type *) hist_at->data, rev_indices))
+	 goto free_and_return;
+	break;
+
+ case SLANG_INT_TYPE:
+	if (-1 == i_histogram_2d ((int *)xpts_at->data, (int *)ypts_at->data, ypts_at->num_elements,
+				 (double *)xedges_at->data, xedges_at->num_elements,
+				 (double *)yedges_at->data, yedges_at->num_elements,
+				 (HistData_Type *) hist_at->data, rev_indices))
+	 goto free_and_return;
+	break;
+
+ case SLANG_FLOAT_TYPE:
+	if (-1 == f_histogram_2d ((float *)xpts_at->data, (float *)ypts_at->data, ypts_at->num_elements,
+				 (double *)xedges_at->data, xedges_at->num_elements,
+				 (double *)yedges_at->data, yedges_at->num_elements,
+				 (HistData_Type *) hist_at->data, rev_indices))
+	 goto free_and_return;
+	break;
+
+ case SLANG_DOUBLE_TYPE:
+	if (-1 == d_histogram_2d ((double *)xpts_at->data, (double *)ypts_at->data, ypts_at->num_elements,
+				 (double *)xedges_at->data, xedges_at->num_elements,
+				 (double *)yedges_at->data, yedges_at->num_elements,
+				 (HistData_Type *) hist_at->data, rev_indices))
+	 goto free_and_return;
+	break;
+
+ default:
+	SLang_verror (SL_INTERNAL_ERROR, "Error in hist2d: array not supported");
+	goto free_and_return;
+ }
+
+ if (ref != NULL)
+ {
+	if (NULL == (indices_at = convert_reverse_indices (rev_indices, xpts_at->num_elements, hist_at)))
+	 goto free_and_return;
+
+	if (-1 == SLang_assign_to_ref (ref, SLANG_ARRAY_TYPE, (VOID_STAR) &indices_at))
+	 goto free_and_return;
+ }
+
+ (void) SLang_push_array (hist_at, 0);
+
+ /* NULLs ok below */
+free_and_return:
+ if (rev_indices != NULL) SLfree ((char *) rev_indices);
+ SLang_free_ref (ref);
+ SLang_free_array (indices_at);
+ SLang_free_array (yedges_at);
+ SLang_free_array (xedges_at);
+ SLang_free_array (xpts_at);
+ SLang_free_array (ypts_at);
+ SLang_free_array (hist_at);
+}
+
+static void binary_search_intrin (void)
+{
+ SLang_Array_Type *at;
+ SLang_Array_Type *xt;
+ SLang_Array_Type *at_ind;
+ double x, *xp, *yp;
+ SLuindex_Type i, num_indices, num;
+ SLindex_Type ind, *indices;
+
+ if (SLang_Num_Function_Args != 2)
+ {
+	SLang_verror (SL_USAGE_ERROR, "i = hist_bsearch (x, a); %% ai<=x<ai+1");
+	return;
+ }
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_DOUBLE_TYPE))
+ return;
+
+ if (SLang_peek_at_stack () == SLANG_ARRAY_TYPE)
+ {
+	if (-1 == SLang_pop_array_of_type (&xt, SLANG_DOUBLE_TYPE))
+	 {
+	 SLang_free_array (at);
+	 return;
+	 }
+
+	if (NULL == (at_ind = SLang_create_array (SLANG_INT_TYPE, 0, NULL, xt->dims, xt->num_dims)))
+	 {
+	 SLang_free_array (at);
+	 SLang_free_array (xt);
+	 return;
+	 }
+	xp = (double *) xt->data;
+	num_indices = xt->num_elements;
+	indices = (SLindex_Type *)at_ind->data;
+ }
+#if SLANG_VERSION < 20000
+ else if (0 == SLang_pop_double (&x, NULL, NULL))
+#else
+ else if (0 == SLang_pop_double (&x))
+#endif
+ {
+	xt = NULL;
+	at_ind = NULL;
+	xp = &x;
+	num_indices = 1;
+	indices = &ind;
+ }
+ else
+ {
+	SLang_free_array (at);
+	return;
+ }
+
+ num = at->num_elements;
+ yp = (double *)at->data;
+
+ if (-1 == check_grid (yp, num))
+ {
+	SLang_free_array (at);
+	SLang_free_array (xt);
+	return;
+ }
+
+ for (i = 0; i < num_indices; i++)
+ indicesi = double_binary_search (xpi, yp, num);
+
+ SLang_free_array (at);
+ SLang_free_array (xt);
+
+ if (at_ind != NULL)
+ (void) SLang_push_array (at_ind, 1);
+ else
+ (void) SLang_push_array_index (indices0);
+}
+
+/* Usage: h_new = rebin (new_grid, old_grid, h_old); */
+static void hist1d_rebin (void)
+{
+ SLang_Array_Type *grid_old, *h_old, *grid_new, *h_new;
+ SLindex_Type old_num_bins, new_num_bins;
+
+ if (SLang_Num_Function_Args != 3)
+ {
+	SLang_verror (SL_USAGE_ERROR, "h_new = hist1d_rebin (new_grid, old_grid, h_old)");
+	return;
+ }
+
+ if (-1 == pop_1d_double_arrays (&grid_old, &h_old))
+ return;
+
+ if (-1 == pop_1d_array_of_type (&grid_new, SLANG_DOUBLE_TYPE))
+ {
+	SLang_free_array (h_old);
+	SLang_free_array (grid_old);
+	return;
+ }
+
+ old_num_bins = grid_old->num_elements;
+ new_num_bins = grid_new->num_elements;
+
+ if (NULL == (h_new = SLang_create_array (SLANG_DOUBLE_TYPE, 0, NULL, &new_num_bins, 1)))
+ {
+	SLang_free_array (grid_new);
+	SLang_free_array (grid_old);
+	SLang_free_array (h_old);
+	return;
+ }
+
+ if (0 == d_hist1d_rebin ((double *)grid_new->data, (SLuindex_Type) new_num_bins,
+			 (double *)grid_old->data, (double *)h_old->data, (SLuindex_Type) old_num_bins,
+			 (double *)h_new->data))
+ (void) SLang_push_array (h_new, 0);
+
+ SLang_free_array (h_new);
+ SLang_free_array (grid_new);
+ SLang_free_array (grid_old);
+ SLang_free_array (h_old);
+}
+
+#define A SLANG_ARRAY_TYPE
+#define V SLANG_VOID_TYPE
+
+static SLang_Intrin_Fun_Type Module_Intrinsics =
+{
+ MAKE_INTRINSIC_0("hist1d", hist1d, V),
+ MAKE_INTRINSIC_0("hist2d", hist2d, V),
+ MAKE_INTRINSIC_0("hist_bsearch", binary_search_intrin, V),
+ MAKE_INTRINSIC_0("hist1d_rebin", hist1d_rebin, V),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static SLang_Intrin_Var_Type Module_Variables =
+{
+ MAKE_VARIABLE("_histogram_module_version_string", &Module_Version_String, SLANG_STRING_TYPE, 1),
+ SLANG_END_INTRIN_VAR_TABLE
+};
+
+static SLang_IConstant_Type Module_IConstants =
+{
+ MAKE_ICONSTANT("_histogram_module_version", MODULE_VERSION_NUMBER),
+ SLANG_END_ICONST_TABLE
+};
+
+int init_histogram_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if (
+ (-1 == SLns_add_intrin_var_table (ns, Module_Variables, NULL))
+ || (-1 == SLns_add_intrin_fun_table (ns, Module_Intrinsics, NULL))
+ || (-1 == SLns_add_iconstant_table (ns, Module_IConstants, NULL))
+ )
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_histogram_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/histogram-module.inc Added

@@ -0,0 +1,254 @@
+/* -*- C -*- */
+/*
+ * A 1-d histogram is specified by a set of N grid points X_k and some set
+ * of values y_i to be grouped into the histogram. The bin size of the
+ * nth bin is given by x_{i+1} - x_i, except for the last bin, which is
+ * assumed to be of infinite width.
+ */
+
+/* If reverse_indices is NON-NULL, it is assumed to point to an array of 
+ * size npts.
+ * 
+ * This routines assumes that the caller has initialized the histogram
+ * array to 0, and the reverse_indices array to -1.
+ */
+
+#ifdef HISTOGRAM_1D
+static int HISTOGRAM_1D (PTS_TYPE *pts, SLuindex_Type npts,
+			 BIN_EDGES_TYPE *bin_edges, SLuindex_Type nbins,
+			 HistData_Type *histogram,
+			 SLindex_Type *reverse_indices)
+{
+ SLuindex_Type i, nbins_m1;
+ double xlo, xhi, dx;
+
+ if (nbins == 0)
+ return 0;
+
+ if (-1 == check_grid (bin_edges, nbins))
+ return -1;
+
+ nbins_m1 = nbins - 1;
+ xlo = (double) bin_edges0;
+ xhi = (double) bin_edgesnbins_m1;
+ dx = xhi - xlo;
+
+ if (dx < 0.0)
+ {
+	SLang_verror (SL_INVALID_PARM, "hist1d: bin edges array is not in increasing order");
+	return -1;
+ }
+
+ for (i = 0; i < npts; i++)
+ {
+	PTS_TYPE val = ptsi;
+	SLuindex_Type j;
+
+	if (
+#if CHECK_NANS
+	 isnan(val) ||
+#endif
+	 (val < xlo))
+	 continue;
+
+	if (val >= xhi)
+	 j = nbins_m1;
+	else
+	 {
+	 /* Try linear interpolation since many grids will be linear */
+	 j = (SLuindex_Type) (((val - xlo)/dx)*nbins_m1);
+	 if (j == nbins_m1) j--;
+	 if ((bin_edgesj > val) || (val >= bin_edgesj+1))
+	 j = BINARY_SEARCH (val, bin_edges, nbins);
+	 }
+	histogramj += 1;
+	if (reverse_indices != NULL)
+	 reverse_indicesi = (SLindex_Type) j;
+ }
+ return 0;
+}
+#undef HISTOGRAM_1D
+#endif				 /* HISTOGRAM_1D */
+
+#ifdef HISTOGRAM_2D
+static int HISTOGRAM_2D (PTS_TYPE *xpts, PTS_TYPE *ypts, SLuindex_Type npts,
+			 BIN_EDGES_TYPE *xbin_edges, SLuindex_Type nxbins, 
+			 BIN_EDGES_TYPE *ybin_edges, SLuindex_Type nybins,
+			 HistData_Type *histogram,
+			 SLindex_Type *reverse_indices)
+{
+ SLuindex_Type i, nxbins_m1, nybins_m1;
+ double xlo, xhi, dx;
+ double ylo, yhi, dy;
+
+ if ((nxbins == 0) || (nybins == 0))
+ return 0;
+
+ if (-1 == check_grid (xbin_edges, nxbins))
+ return -1;
+
+ if (-1 == check_grid (ybin_edges, nybins))
+ return -1;
+
+ nxbins_m1 = nxbins - 1;
+ xlo = (double) xbin_edges0;
+ xhi = (double) xbin_edgesnxbins_m1;
+ dx = xhi - xlo;
+
+ nybins_m1 = nybins - 1;
+ ylo = (double) ybin_edges0;
+ yhi = (double) ybin_edgesnybins_m1;
+ dy = yhi - ylo;
+ 
+ if ((dx < 0.0) || (dy < 0.0))
+ {
+	SLang_verror (SL_INVALID_PARM, "hist2d: bin edges array is not in increasing order");
+	return -1;
+ }
+
+ for (i = 0; i < npts; i++)
+ {
+	PTS_TYPE xval = xptsi;
+	PTS_TYPE yval = yptsi;
+	SLuindex_Type jx, jy, j;
+
+	if (
+#if CHECK_NANS
+	 isnan(xval) || isnan(xval) ||
+#endif
+	 (xval < xlo) || (yval < ylo))
+	 continue;
+
+	if (xval >= xhi)
+	 jx = nxbins_m1;
+	else
+	 {
+	 /* Try linear interpolation since many grids will be linear */
+	 jx = (SLuindex_Type) (((xval - xlo)/dx)*nxbins_m1);
+	 if (jx == nxbins_m1) jx--;
+	 if ((xbin_edgesjx > xval) || (xval >= xbin_edgesjx+1))
+	 jx = BINARY_SEARCH (xval, xbin_edges, nxbins);
+	 }
+
+	if (yval >= yhi)
+	 jy = nybins_m1;
+	else
+	 {
+	 /* Try linear interpolation since many grids will be linear */
+	 jy = (SLuindex_Type) (((yval - ylo)/dy)*nybins_m1);
+	 if (jy == nybins_m1) jy--;
+	 if ((ybin_edgesjy > yval) || (yval >= ybin_edgesjy+1))
+	 jy = BINARY_SEARCH (yval, ybin_edges, nybins);
+	 }
+
+	j = jx*nybins + jy;
+	histogramj += 1;
+	if (reverse_indices != NULL)
+	 reverse_indicesi = (int) j;
+ }
+ return 0;
+}
+#undef HISTOGRAM_2D
+#endif
+
+#ifdef HISTOGRAM_REBIN
+static int HISTOGRAM_REBIN (double *new_grid, SLuindex_Type new_n,
+			 double *old_grid, PTS_TYPE *old_h, SLuindex_Type old_n,
+			 PTS_TYPE *new_h)
+{
+ SLuindex_Type i, imax;
+ SLuindex_Type j, jmax;
+ double *old_left, *old_right, *new_left, *new_right;
+
+ if ((new_n == 0) || (old_n == 0))
+ return 0;
+ 
+ for (i = 0; i < new_n; i++)
+ new_hi = 0;
+
+ old_left = old_grid;
+ old_right = old_grid + 1;
+ new_left = new_grid;
+ new_right = new_grid + 1;
+
+ imax = new_n - 1;
+ jmax = old_n - 1;
+ 
+ if (-1 == check_grid (old_grid, old_n))
+ return -1;
+
+ if (-1 == check_grid (new_grid, new_n))
+ return -1;
+
+ i = j = 0;
+ if (j < jmax)
+ {
+	double r_new, l_new, r_old, l_old;
+	double h_rho;
+
+	r_old = old_right0;
+	l_old = old_left 0;
+	l_new = new_left 0;
+	if (i == imax)
+	 r_new = old_leftjmax;
+	else
+	 r_new = new_right0;
+	
+	if (r_old > l_old)
+	 h_rho = old_hj / (r_old - l_old);
+	else
+	 h_rho = 0.0;
+
+	while (1)
+	 {
+	 if (r_new < r_old)
+	 {
+		 if (l_new >= l_old) 
+		 new_hi += h_rho * (r_new - l_new);
+		 else if (r_new > l_old)
+		 new_hi += h_rho * (r_new - l_old);
+		 
+		 if (i != imax)
+		 {
+		 i++;
+		 l_new = r_new;
+		 if (i == imax)
+			 r_new = old_leftjmax;
+		 else
+			 r_new = new_righti;
+		 }
+	 }
+	 else
+	 {
+		 if (l_new < l_old) 
+		 new_hi += old_h j;
+		 else if (l_new < r_old) 
+		 new_hi += h_rho * (r_old - l_new);
+
+		 j++;
+		 if (j == jmax)
+		 break;
+		 l_old = r_old;
+		 r_old = old_rightj;
+		 if (r_old > l_old)
+		 h_rho = old_hj / (r_old - l_old);
+		 else
+		 h_rho = 0.0;
+	 }
+	 }
+ }
+	
+ /* Now take care of the last bin, which is of infinite length. Because of
+ * its infinite length, it gets all of the stuff in the input histograms
+ * last bin.
+ */
+ new_h imax += old_h jmax;
+ return 0;
+}
+#undef HISTOGRAM_REBIN
+#endif
+
+#undef PTS_TYPE
+#undef BIN_EDGES_TYPE
+#undef BINARY_SEARCH
+#undef CHECK_NANS

_service:tar_scm:slang-2.3.2.tar.bz2/modules/histogram.sl Added

@@ -0,0 +1,150 @@
+% This file not only provides access to the module, it also provides several
+% other functions that are easier to implement in slang. These include:
+%
+% whist1d : weighted 1-d histogram
+% whist2d : weighted 2-d histogram
+% hist2d_rebin: Rebins a 2-d histogram
+%
+#ifeval _slang_version < 20000
+if (current_namespace () != "")
+ import ("histogram", current_namespace ());
+else
+#endif
+ import ("histogram");
+
+define whist1d ()
+{
+ variable func = NULL;
+ variable rev = NULL;
+
+ switch (_NARGS)
+ {
+ case 4:
+	rev = ();
+ }
+ {
+ case 5:
+	(rev, func) = ();
+ }
+ {
+	if (_NARGS != 3)
+	 usage ("h = %s (pnts, weights, bin-edges ,rev-indices ,func)", 
+		 _function_name);
+ }
+ 
+ variable pnts, w, edges;
+ (pnts, w, edges) = ();
+ 
+ if (func == NULL)
+ func = &sum;
+
+ variable r;
+ () = hist1d (pnts, edges, &r);
+ 
+ variable n = length (edges);
+ variable h = Double_Type n;
+
+ _for (0, n-1, 1)
+ {
+	variable i = ();
+	hi = (@func) (wri);
+ }
+
+ if (rev != NULL)
+ @rev = r;
+ 
+ return h;
+}
+
+define whist2d ()
+{
+ variable rev = NULL, func = NULL;
+ switch (_NARGS)
+ {
+ case 6:
+	rev = ();
+ }
+ {
+ case 7:
+	(rev, func) = ();
+ }
+ {
+	if (_NARGS != 5)
+	 usage ("img=%s(xpnts, ypnts, weights, xgrid, ygrid ,rev ,func)",
+		 _function_name ());
+ }
+
+ variable x, y, w, xgrid, ygrid;
+ (x, y, w, xgrid, ygrid) = ();
+
+ if (func == NULL)
+ func = &sum;
+
+ variable r; 
+ () = hist2d (x, y, xgrid, ygrid, &r);
+
+ variable nx = length (xgrid);
+ variable ny = length (ygrid);
+ variable img = Double_Typenx, ny;
+ _for (0, nx-1, 1)
+ {
+	variable i = ();
+	_for (0, ny-1, 1)
+	 {
+	 variable j = ();
+	 imgi,j = (@func)(wri,j);
+	 }
+ }
+
+ if (rev != NULL)
+ @rev = r;
+
+ return img;
+}
+
+define hist2d_rebin ()
+{
+ if (_NARGS != 5)
+ usage ("new_ijhist=%s(new_igrid,new_jgrid,old_igrid,old_jgrid,old_ijhist)",
+	 _function_name);
+
+ variable new_igrid, new_jgrid, old_igrid, old_jgrid, old_hist;
+ (new_igrid, new_jgrid, old_igrid, old_jgrid, old_hist) = ();
+ 
+ variable new_ilen = length (new_igrid);
+ variable new_jlen = length (new_jgrid);
+ variable old_ilen = length (old_igrid);
+ variable old_jlen = length (old_jgrid);
+ 
+ variable h_i = hist1d_rebin (new_jgrid, old_jgrid, old_hist0,*);
+ variable type = _typeof (h_i);
+ 
+ variable new_hist = @Array_Type (type, old_ilen, new_jlen);
+ 
+ new_hist0,* = h_i;
+ _for (1, old_ilen-1, 1)
+ {
+	variable i = ();
+	new_histi,* = hist1d_rebin (new_jgrid, old_jgrid, old_histi,*);
+ }
+ old_hist = new_hist;
+ new_hist = @Array_Type (type, new_ilen, new_jlen);
+ 
+ _for (0, new_jlen-1, 1)
+ {
+	variable j = ();
+	new_hist*,j = hist1d_rebin (new_igrid, old_igrid, old_hist*,j);
+ }
+ 
+ return new_hist;
+}
+
+
+#ifexists add_doc_file
+$1 = path_concat (path_concat (path_dirname (__FILE__), "help"),
+		 "histogram.hlp");
+if (NULL != stat_file ($1))
+ add_doc_file ($1);
+#endif
+
+provide ("histogram");

_service:tar_scm:slang-2.3.2.tar.bz2/modules/iconv-module.c Added

@@ -0,0 +1,266 @@
+/* This code was written by Dino Leonardo Sangoi <SANGOID@lloydadriatico.it> */
+
+#include "config.h"
+
+#include <stdio.h>
+#include <slang.h>
+#include <string.h>
+#include <iconv.h>
+#include <errno.h>
+
+SLANG_MODULE(iconv);
+
+#ifndef ICONV_CONST
+# define ICONV_CONST
+#endif
+
+static int ICONV_Type_Id = 0;
+
+typedef struct
+{
+ iconv_t cd;
+}
+ICONV_Type;
+
+static void free_iconv_type (ICONV_Type *it)
+{
+ SLfree ((char *) it);
+}
+
+static SLang_MMT_Type *allocate_iconv_type (iconv_t cd)
+{
+ ICONV_Type *it;
+ SLang_MMT_Type *mmt;
+
+ it = (ICONV_Type *) SLmalloc (sizeof (ICONV_Type));
+ if (it == NULL)
+ return NULL;
+
+ it->cd = cd;
+
+ if (NULL == (mmt = SLang_create_mmt (ICONV_Type_Id, (VOID_STAR) it)))
+ {
+	free_iconv_type (it);
+	return NULL;
+ }
+ return mmt;
+}
+
+static void _iconv_open(char *tocode, char *fromcode)
+{
+ iconv_t cd;
+ SLang_MMT_Type *mmt;
+
+ cd = iconv_open(tocode, fromcode);
+ if (cd == (iconv_t)(-1))
+ {
+	SLang_verror (SL_INTRINSIC_ERROR, "Error preparing iconv to convert from '%s' to '%s'.", fromcode, tocode);
+	return;
+ }
+
+ if (NULL == (mmt = allocate_iconv_type (cd)))
+ {
+	iconv_close(cd);
+	return;
+ }
+
+ if (-1 == SLang_push_mmt (mmt))
+ {
+	SLang_free_mmt (mmt);
+	return;
+ }
+ return;
+}
+
+static void _iconv_close(ICONV_Type *it)
+{
+ if (it->cd != (iconv_t)-1)
+ {
+	iconv_close(it->cd);
+	it->cd = (iconv_t)-1;
+ }
+}
+
+static void destroy_iconv (SLtype type, VOID_STAR f)
+{
+ ICONV_Type *it;
+ (void) type;
+
+ it = (ICONV_Type *) f;
+ _iconv_close(it);
+ free_iconv_type (it);
+}
+
+static void _iconv_reset(ICONV_Type *it)
+{
+ iconv(it->cd, NULL, NULL, NULL, NULL);
+}
+
+#define SHIFT_BUF_LEN 64U
+static void _iconv_reset_shift(ICONV_Type *it)
+{
+ size_t n = SHIFT_BUF_LEN;
+ char bufSHIFT_BUF_LEN, *p = buf;
+ SLang_BString_Type *bstr;
+ size_t rc;
+
+ rc = iconv(it->cd, NULL, NULL, &p, &n);
+ if (rc == (size_t)(-1))
+ {
+	/* Since no input was provided, errno must be E2BIG */
+	SLang_verror (SL_Internal_Error, "Internal error: shift buffer too small in iconv_reset_shift!");
+	return;
+ }
+ bufSHIFT_BUF_LEN-n = '\0';
+ bstr = SLbstring_create((unsigned char *)buf, SHIFT_BUF_LEN-n);
+ if (bstr == NULL)
+ return;
+
+ (void) SLang_push_bstring(bstr);
+ SLbstring_free (bstr);
+}
+
+static void _iconv(ICONV_Type *it, SLang_BString_Type *bstr)
+{
+ char *buf = NULL;
+ size_t rc;
+ char ICONV_CONST *instr;
+ char *outstr;
+ size_t inn, outn, bufn;
+ size_t fail = (size_t)-1;
+ SLstrlen_Type bstrlen;
+
+ if (NULL == (instr = (char ICONV_CONST *)SLbstring_get_pointer(bstr, &bstrlen)))
+ return;
+ inn = (size_t) bstrlen;
+
+ bufn = outn = 2*inn + 2;
+ if (NULL == (buf = (char *)SLmalloc(bufn)))
+ return;
+
+ outstr = buf;
+
+ while (1)
+ {
+	errno = 0;
+	rc = iconv(it->cd, &instr, &inn, &outstr, &outn);
+	if (rc != (size_t)-1)
+	 break; /* ok! */
+
+	if (fail == inn)
+	 {
+	 SLang_verror (SL_Unknown_Error, "Unknown error in iconv");
+	 goto error;
+	 }
+
+	fail = inn;
+	switch (errno)
+	 {
+	 case EILSEQ:
+	 SLang_verror (SL_InvalidUTF8_Error, "Invalid multibyte sequence or unable to convert to the target encoding");
+	 goto error;
+	 case EINVAL:
+	 SLang_verror (SL_InvalidUTF8_Error, "Incomplete multibyte sequence");
+	 goto error;
+	 case 0:
+	 /* drop */
+	 /* grrrr
+	 * At least on windows, libiconv returns with errno = 0
+	 * (or unmodified?) when there's no more room on outstr
+	 * if so, fallback
+	 */
+	 case E2BIG:
+	 {
+		 char *p;
+		 long outdelta;
+
+		 outdelta = outstr - buf;
+		 outn += bufn;
+		 bufn += bufn;
+		 p = (char *)SLrealloc(buf, bufn);
+		 if (p == NULL)
+		 goto error;
+		 buf = p;
+		 outstr = buf + outdelta;
+	 }
+	 break;
+	 default:
+	 SLang_verror (SL_Unknown_Error, "Unknown iconv error");
+	 goto error;
+	 }
+ }
+
+ bstr = SLbstring_create((unsigned char *) buf, outstr - buf);
+ if (bstr != NULL)
+ (void) SLang_push_bstring(bstr);
+ SLbstring_free (bstr);
+ /* drop */
+error:
+ SLfree(buf);
+}
+
+#define DUMMY_ICONV_TYPE 255
+#define P DUMMY_ICONV_TYPE
+#define V SLANG_VOID_TYPE
+#define S SLANG_STRING_TYPE
+#define B SLANG_BSTRING_TYPE
+static SLang_Intrin_Fun_Type ICONV_Intrinsics =
+{
+ MAKE_INTRINSIC_2("iconv_open", _iconv_open, V, S, S),
+ MAKE_INTRINSIC_1("iconv_close", _iconv_close, V, P),
+ MAKE_INTRINSIC_1("iconv_reset", _iconv_reset, V, P),
+ MAKE_INTRINSIC_1("iconv_reset_shift", _iconv_reset_shift, V, P),
+ MAKE_INTRINSIC_2("iconv", _iconv, V, P, B),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+#undef B
+#undef S
+#undef V
+#undef P
+
+static int register_iconv_type (void)
+{
+ SLang_Class_Type *cl;
+
+ if (ICONV_Type_Id != 0)
+ return 0;
+
+ if (NULL == (cl = SLclass_allocate_class ("ICONV_Type")))
+ return -1;
+
+ if (-1 == SLclass_set_destroy_function (cl, destroy_iconv))
+ return -1;
+
+ /* By registering as SLANG_VOID_TYPE, slang will dynamically allocate a
+ * type.
+ */
+ if (-1 == SLclass_register_class (cl, SLANG_VOID_TYPE, sizeof (ICONV_Type), SLANG_CLASS_TYPE_MMT))
+ return -1;
+
+ ICONV_Type_Id = SLclass_get_class_id (cl);
+ if (-1 == SLclass_patch_intrin_fun_table1 (ICONV_Intrinsics, DUMMY_ICONV_TYPE, ICONV_Type_Id))
+ return -1;
+
+ return 0;
+}
+
+int init_iconv_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if (-1 == register_iconv_type ())
+ return -1;
+
+ if (-1 == SLns_add_intrin_fun_table (ns, ICONV_Intrinsics, "__ICONV__"))
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_iconv_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/iconv.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/json-module.c Added

@@ -0,0 +1,1141 @@
+/* -*- mode: C; mode: fold -*- */
+/*
+Copyright (C) 2013-2017,2018 John E. Davis, Manfred Hanke
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#define _BSD_SOURCE 1		 /* to get strtoll */
+#define _DEFAULT_SOURCE 1
+#include "config.h"
+
+#include <stdlib.h>
+#include <string.h>
+#include <errno.h>
+#include <slang.h>
+
+SLANG_MODULE(json);
+
+#define JSON_MODULE_VERSION_NUMBER 300
+static char* json_module_version_string = "pre-0.3.0";
+
+/*{{{ JSON grammar based upon json.org & ietf.org/rfc/rfc4627.txt
+ *
+ * object:
+ * { }
+ * { members }
+ * members:
+ * pair
+ * pair , members
+ * pair:
+ * string : value
+ *
+ * array:
+ * 
+ * elements 
+ * elements:
+ * value
+ * value , elements
+ *
+ * value:
+ * string
+ * number
+ * object
+ * array
+ * true
+ * false
+ * null
+ *
+ * Since a pair consists of a (arbitrary string) keyword and a value,
+ * a JSON object maps onto a structure (Struct_Type) in S-Lang.
+ *
+ * Since a JSON array is a heterogenous collection of elements,
+ * these map onto a list (List_Type) in S-Lang.
+ *
+ * Since S-Lang has no separate boolean type,
+ * true|false are represented as 1|0 of UChar_Type.
+ */
+
+#define BEGIN_ARRAY	 ''
+#define BEGIN_OBJECT	 '{'
+#define END_ARRAY	 ''
+#define END_OBJECT	 '}'
+#define VALUE_SEPARATOR	 ','
+#define NAME_SEPARATOR	 ':'
+#define STRING_DELIMITER '"'
+#define ESCAPE_CHARACTER '\\'
+
+/*}}}*/
+
+static int Json_Parse_Error = -1;
+static int Json_Invalid_Json_Error = -1;
+
+#define DESCRIBE_CHAR_FMT "'%c' = 0x%02X"
+#define DESCRIBE_CHAR(ch) ch, (unsigned int)(unsigned char)ch
+
+static int Max_Recursion_Depth = 100;
+typedef struct
+{
+ char *ptr;	/* points into input string */
+ int depth;
+}
+Parse_Type;
+
+static void skip_white (Parse_Type *p) /*{{{*/
+{
+ unsigned char *s = (unsigned char *)p->ptr;
+
+ while ((*s == ' ') || (*s == '\t') || (*s == '\n') || (*s == '\r'))
+ s++;
+
+ p->ptr = (char *)s;
+}
+/*}}}*/
+
+static int looking_at (Parse_Type *p, char ch) /*{{{*/
+{
+ return *p->ptr == ch;
+}
+/*}}}*/
+
+static int skip_char (Parse_Type *p, char ch) /*{{{*/
+{
+ if (! looking_at (p, ch))
+ return 0;
+
+ p->ptr++;
+ return 1;
+}
+/*}}}*/
+
+static int parse_hex_digit (char ch) /*{{{*/
+{
+ if ('0' <= ch && ch <= '9') return ch - '0';
+ if ('A' <= ch && ch <= 'F') return 10 + ch - 'A';
+ if ('a' <= ch && ch <= 'f') return 10 + ch - 'a';
+ else return -1;
+}
+/*}}}*/
+
+static char *parse_4_hex_digits (char *s, unsigned int *new_string_len, char *new_string, int *is_binary_stringp) /*{{{*/
+{
+ int d1, d2, d3, d4;
+ SLwchar_Type wchar;
+#define BUFLEN 6
+ SLuchar_Type bufBUFLEN, *u;
+
+ if ( (-1 == (d1 = parse_hex_digit (s0)))
+ || (-1 == (d2 = parse_hex_digit (s1)))
+ || (-1 == (d3 = parse_hex_digit (s2)))
+ || (-1 == (d4 = parse_hex_digit (s3))))
+ {
+	SLang_verror (Json_Parse_Error, "Illegal Unicode escape sequence in JSON string: \\u%c%c%c%c", s0, s1, s2, s3);	 /* may contain '\000' */
+	return NULL;
+ }
+
+ wchar = (d1 << 12) + (d2 << 8) + (d3 << 4) + d4;
+ if (is_binary_stringp != NULL)
+ *is_binary_stringp = (wchar == 0);
+
+ u = new_string ? (SLuchar_Type*)new_string : buf;
+ *new_string_len += SLutf8_encode (wchar, u, BUFLEN) - u;
+#undef BUFLEN
+
+ return s+4;
+}
+/*}}}*/
+
+static int parse_string_length_and_move_ptr (Parse_Type *p, unsigned int *lenp, int *is_binary_stringp) /*{{{*/
+{
+ unsigned int new_string_len = 0;
+ char *s = p->ptr;
+
+ *lenp = 0; *is_binary_stringp = 0;
+
+ while (1)
+ {
+	char ch = *s++;
+
+	/* STRING_DELIMITER = 34, SPACE = 32 */
+	if ((unsigned char)ch <= STRING_DELIMITER)
+	 {
+	 if (ch == STRING_DELIMITER)
+	 break;
+
+	 if (ch == 0)
+	 {
+		 SLang_verror (Json_Parse_Error, "Unexpected end of input seen while parsing a JSON string");
+		 return -1;
+	 }
+	 if (ch < 32)
+	 {
+		 SLang_verror (Json_Parse_Error, "Control character 0x%02X in JSON string must be escaped", (unsigned int)ch);
+		 return -1;
+	 }
+	 /* drop */
+	 }
+
+	if (ch == ESCAPE_CHARACTER)
+	 {
+	 ch = *s++;
+	 switch (ch)
+	 {
+		case STRING_DELIMITER:
+		case ESCAPE_CHARACTER:
+		case '/':
+		case 'b': case 'f': case 'n': case 'r': case 't':
+		 new_string_len++;
+		 break;
+		case 'u':
+		 {
+		 int isbin;
+		 if (NULL == (s = parse_4_hex_digits (s, &new_string_len, NULL, &isbin)))
+			 return -1;
+		 *is_binary_stringp |= isbin;
+		 break;
+		 }
+		default:
+		 SLang_verror (Json_Parse_Error, "Illegal escaped character " DESCRIBE_CHAR_FMT " in JSON string", DESCRIBE_CHAR(ch));
+		 return -1;
+	 }
+	 }
+	else
+	 new_string_len++;
+ }
+
+ p->ptr = s;
+ *lenp = new_string_len;
+ return 0;
+}
+/*}}}*/
+
+/* try to use string_buffer
+ * if there is enough space and the string is not a binary string.
+ */
+static char *parse_string (Parse_Type *p,
+			 char *string_buffer, unsigned int buflen,
+			 unsigned int *bstring_lenp) /*{{{*/
+{
+ char *s, *new_string;
+ unsigned int new_string_pos, new_string_len;
+ int is_binary_string = 0;
+
+ s = p->ptr;
+
+ if (-1 == parse_string_length_and_move_ptr (p, &new_string_len, &is_binary_string))
+ return NULL;
+
+ new_string = string_buffer;
+ if (((new_string_len >= buflen) || is_binary_string)
+ && (NULL == (new_string = SLmalloc (new_string_len + 1))))
+ return NULL;
+
+ new_string_pos = 0;
+
+ while (new_string_pos < new_string_len)
+ {
+	char ch = *s++;
+
+	if ((ch == STRING_DELIMITER) || ((unsigned char)ch < 32))
+	 goto return_application_error;
+
+	if (ch != ESCAPE_CHARACTER)
+	 {
+	 new_stringnew_string_pos++ = ch;
+	 continue;
+	 }
+
+	ch = *s++;
+	switch (ch)
+	 {
+	 case STRING_DELIMITER:
+	 case ESCAPE_CHARACTER:
+	 case '/':
+	 new_stringnew_string_pos++ = ch; break;
+	 case 'b':
+	 new_stringnew_string_pos++ = '\b'; break;
+	 case 'f':
+	 new_stringnew_string_pos++ = '\f'; break;
+	 case 'n':
+	 new_stringnew_string_pos++ = '\n'; break;
+	 case 'r':
+	 new_stringnew_string_pos++ = '\r'; break;
+	 case 't':
+	 new_stringnew_string_pos++ = '\t'; break;
+	 case 'u':
+	 if (NULL != (s = parse_4_hex_digits (s, &new_string_pos, new_string + new_string_pos, NULL)))
+	 break; /* else drop */
+	 default:
+	 goto return_application_error;
+	 }
+ }
+
+ if (bstring_lenp != NULL)
+ *bstring_lenp = (is_binary_string ? new_string_len : 0);
+
+ new_stringnew_string_pos = 0;
+ return new_string;
+
+return_application_error:
+ /* Since any JSon_Parse_Error should already have been recognized
+ * (by parse_string_length_and_move_ptr), something must be wrong here.
+ */
+ SLang_verror (SL_Application_Error, "JSON string being parsed appears to be changing");
+ if (new_string != string_buffer) SLfree (new_string);
+ return NULL;
+}
+/*}}}*/
+
+static int parse_and_push_string (Parse_Type *p) /*{{{*/
+{
+ unsigned int bstring_len;
+ char *s;
+ char buf512;
+
+ if (NULL == (s = parse_string (p, buf, sizeof (buf), &bstring_len)))
+ return -1;
+
+ if (bstring_len)
+ {
+	SLang_BString_Type *bstr;
+	int status;
+
+	/* NOTE: parse_string will not use buf for a binary string */
+	if (NULL == (bstr = SLbstring_create_malloced ((unsigned char *)s, bstring_len, 1)))
+	 return -1;
+	/* s now belongs to bstr */
+
+	status = SLang_push_bstring (bstr);
+	SLbstring_free (bstr);
+	return status;
+ }
+
+ if (s != buf)
+ return SLang_push_malloced_string (s); /* frees s upon return */
+
+ return SLang_push_string (buf);
+}
+/*}}}*/
+
+static int parse_and_push_number (Parse_Type *p) /*{{{*/
+{
+ char *s = p->ptr, ch;
+ int is_int = 1, result;
+
+ if (*s == '-')
+ s++;
+ while ('0' <= *s && *s <= '9')
+ s++;
+ if (*s == '.')
+ {
+	is_int = 0;
+	s++;
+	while ('0' <= *s && *s <= '9')
+	 s++;
+ }
+ if (*s == 'e' || *s == 'E')
+ {
+	is_int = 0;
+	s++;
+	if (*s == '+' || *s == '-')
+	 s++;
+	while ('0' <= *s && *s <= '9')
+	 s++;
+ }
+
+ ch = *s;
+ *s = 0;
+ errno = 0;
+ result = is_int ?
+#ifdef HAVE_LONG_LONG
+	 SLang_push_long_long (strtoll (p->ptr, NULL, 10))
+#else
+	 SLang_push_long (strtol (p->ptr, NULL, 10))
+#endif
+	 : SLang_push_double (strtod (p->ptr, NULL));
+ if (errno == ERANGE)
+ {
+	SLang_verror (Json_Parse_Error,
+		 is_int
+			? "Integer value is too large (%s)"
+			: "Numeric value is too large (%s)",
+		 p->ptr);
+ }
+
+ *s = ch;
+ p->ptr = s;
+ return result;
+}
+/*}}}*/
+
+static int parse_and_push_literal (Parse_Type *p) /*{{{*/
+{
+ char *s = p->ptr;
+
+ if (0 == strncmp (s, "true", 4))
+ {
+	p->ptr += 4;
+	return SLang_push_uchar (1);
+ }
+
+ if (0 == strncmp (s, "false", 5))
+ {
+	p->ptr += 5;
+	return SLang_push_uchar (0);
+ }
+
+ if (0 == strncmp (s, "null", 4))
+ {
+	p->ptr += 4;
+	return SLang_push_null ();
+ }
+
+ SLang_verror (Json_Parse_Error, "Unexpected character " DESCRIBE_CHAR_FMT " seen while parsing a JSON value", DESCRIBE_CHAR(*s));
+ return -1;
+}
+/*}}}*/
+
+static int parse_and_push_object_as_struct (Parse_Type *, int);
+#if 0
+static int parse_and_push_object_as_assoc (Parse_Type *, int);
+#endif
+static int parse_and_push_array (Parse_Type *, int);
+static int parse_and_push_value (Parse_Type *p, int only_toplevel_values) /*{{{*/
+{
+ int ret;
+
+ skip_white (p);
+
+ if (! only_toplevel_values)
+ {
+	if (skip_char (p, STRING_DELIMITER))
+	 return parse_and_push_string (p);
+	switch (*p->ptr)
+	 {
+	 case '-':
+	 case '0': case '1': case '2': case '3': case '4':
+	 case '5': case '6': case '7': case '8': case '9':
+	 return parse_and_push_number (p);
+	 case 'f':
+	 case 't':
+	 case 'n':
+	 return parse_and_push_literal (p);
+	 }
+ }
+ if (p->depth > Max_Recursion_Depth)
+ {
+	SLang_verror (Json_Parse_Error, "json text exceeds maximum nesting level of %d", Max_Recursion_Depth);
+	return -1;
+ }
+
+ if (skip_char (p, BEGIN_OBJECT))
+ {
+	p->depth++;
+	ret = parse_and_push_object_as_struct (p, only_toplevel_values);
+	p->depth--;
+	return ret;
+ }
+
+ if (skip_char (p, BEGIN_ARRAY))
+ {
+	p->depth++;
+	ret = parse_and_push_array (p, only_toplevel_values);
+	p->depth--;
+	return ret;
+ }
+
+ SLang_verror (Json_Parse_Error, (only_toplevel_values
+				 ? "Unexpected character " DESCRIBE_CHAR_FMT " seen while parsing JSON data (must be an object or an array)"
+				 : "Unexpected character " DESCRIBE_CHAR_FMT " seen while parsing a JSON value"
+				 ), DESCRIBE_CHAR(*p->ptr));
+ return -1;
+}
+/*}}}*/
+
+#if 0
+static int parse_and_push_object_as_assoc (Parse_Type *p, int toplevel) /*{{{*/
+{
+ SLang_Assoc_Array_Type *assoc;
+ char buf512;
+
+ if (NULL == (assoc = SLang_create_assoc (SLANG_ANY_TYPE, 0)))
+ return -1;
+
+ skip_white (p);
+ if (! looking_at (p, END_OBJECT)) do
+ {
+	char *keyword;
+	char *str;
+
+	skip_white (p);
+	if (! skip_char (p, STRING_DELIMITER))
+	 {
+	 SLang_verror (Json_Parse_Error, "Expected a string while parsing a JSON object, found " DESCRIBE_CHAR_FMT, DESCRIBE_CHAR(*p->ptr));
+	 goto return_error;
+	 }
+
+	str = parse_string (p, buf, sizeof (buf), NULL); /* ignoring binary strings */
+	if (str == NULL)
+	 goto return_error;
+
+	keyword = SLang_create_slstring (str);
+	if (str != buf)
+	 SLfree (str);
+
+	if (keyword == NULL)
+	 goto return_error;
+
+	skip_white (p);
+	if (! skip_char (p, NAME_SEPARATOR))
+	 {
+	 SLang_verror (Json_Parse_Error, "Expected a '%c' while parsing a JSON object, found " DESCRIBE_CHAR_FMT,
+			 NAME_SEPARATOR, DESCRIBE_CHAR(*p->ptr));
+	 SLang_free_slstring (keyword);
+	 goto return_error;
+	 }
+
+	if ((-1 == parse_and_push_value (p, 0))
+	 || (-1 == SLang_assoc_put (assoc, keyword)))
+	 {
+	 SLang_free_slstring (keyword);
+	 goto return_error;
+	 }
+
+	SLang_free_slstring (keyword);
+	skip_white (p);
+ }
+ while (skip_char (p, VALUE_SEPARATOR));
+
+ if (skip_char (p, END_OBJECT))
+ {
+	skip_white (p);
+	if (! toplevel || looking_at (p, 0))
+	 return SLang_push_assoc (assoc, 1);
+
+	SLang_verror (Json_Parse_Error, "Expected end of input after parsing JSON object, found " DESCRIBE_CHAR_FMT, DESCRIBE_CHAR(*p->ptr));
+ }
+ else
+ {
+	if (looking_at (p, 0))
+	 SLang_verror (Json_Parse_Error, "Unexpected end of input seen while parsing a JSON object");
+	else
+	 SLang_verror (Json_Parse_Error, "Expected '%c' or '%c' while parsing a JSON object, found " DESCRIBE_CHAR_FMT,
+			VALUE_SEPARATOR, END_OBJECT, DESCRIBE_CHAR(*p->ptr));
+ }
+
+return_error:
+ SLang_free_assoc (assoc);
+ return -1;
+}
+/*}}}*/
+#endif
+
+static void free_string_array (char **sp, unsigned int n)
+{
+ if (sp == NULL)
+ return;
+
+ while (n > 0)
+ {
+	n--;
+	SLang_free_slstring (spn);
+ }
+ SLfree ((char *)sp);
+}
+
+/* This has table implementation does not copy the strings */
+#define HASH_TABLE_SIZE 601
+typedef struct String_Hash_Elem_Type
+{
+ SLstr_Type *string;		 /* not copied! */
+ unsigned int val;
+ struct String_Hash_Elem_Type *next;
+}
+String_Hash_Elem_Type;
+
+typedef struct
+{
+ String_Hash_Elem_Type hash_tableHASH_TABLE_SIZE;
+ unsigned int num_strings;
+ unsigned int num_collisions;
+}
+String_Hash_Type;
+
+static String_Hash_Type *create_string_hash (void)
+{
+ String_Hash_Type *h;
+ if (NULL == (h = (String_Hash_Type *)SLmalloc(sizeof(String_Hash_Type))))
+ return NULL;
+ memset ((char *)h, 0, sizeof(String_Hash_Type));
+ return h;
+}
+
+/* returns -1 upon failure, 0 if string added, 1 if already there */
+static int add_string_to_hash (String_Hash_Type *h, char *s, unsigned int val, unsigned int *valp)
+{
+ SLstr_Hash_Type hash;
+ String_Hash_Elem_Type *e, *e1;
+
+ hash = SLcompute_string_hash (s);
+ e = &h->hash_tablehash % HASH_TABLE_SIZE;
+ if (e->string == NULL)
+ {
+	e->string = s;
+	*valp = e->val = val;
+	h->num_strings++;
+	return 0;
+ }
+
+ while (1)
+ {
+	if (e->string == s)
+	 {
+	 *valp = e->val;
+	 return 1;
+	 }
+	if (e->next == NULL)
+	 break;
+	e = e->next;
+ }
+
+ e1 = (String_Hash_Elem_Type *)SLmalloc (sizeof (String_Hash_Elem_Type));
+ if (e1 == NULL)
+ return -1;
+
+ e1->string = s;
+ *valp = e1->val = val;
+ e1->next = NULL;
+ e->next = e1;
+ h->num_strings++;
+ h->num_collisions++;
+ return 0;
+}
+
+static void free_string_hash (String_Hash_Type *h)
+{
+ String_Hash_Elem_Type *e, *emax;
+ unsigned int num_collisions;
+
+ if (h == NULL)
+ return;
+
+ e = h->hash_table;
+ emax = e + HASH_TABLE_SIZE;
+ num_collisions = h->num_collisions;
+ while (num_collisions && (e < emax))
+ {
+	String_Hash_Elem_Type *e1;
+	if (e->next == NULL)
+	 {
+	 e++;
+	 continue;
+	 }
+	e1 = e->next;
+	while (e1 != NULL)
+	 {
+	 String_Hash_Elem_Type *e2 = e1->next;
+	 SLfree ((char *)e1);
+	 num_collisions--;
+	 e1 = e2;
+	 }
+	e++;
+ }
+ SLfree ((char *)h);
+}
+
+static int parse_and_push_object_as_struct (Parse_Type *p, int toplevel) /*{{{*/
+{
+ char buf512;
+ unsigned int num_fields, max_fields;
+ char **fields;
+ String_Hash_Type *h = NULL;
+
+ max_fields = 16;
+ num_fields = 0;
+ if ((NULL == (fields = (char **)SLmalloc (max_fields * sizeof (char *))))
+ || (NULL == (h = create_string_hash ())))
+ goto return_error;
+
+ skip_white (p);
+ if (! looking_at (p, END_OBJECT)) do
+ {
+	char *keyword;
+	char *str;
+	int status;
+	unsigned int idx;
+
+	skip_white (p);
+	if (! skip_char (p, STRING_DELIMITER))
+	 {
+	 SLang_verror (Json_Parse_Error, "Expected a string while parsing a JSON object, found " DESCRIBE_CHAR_FMT, DESCRIBE_CHAR(*p->ptr));
+	 goto return_error;
+	 }
+
+	str = parse_string (p, buf, sizeof (buf), NULL); /* ignoring binary strings */
+	if (str == NULL)
+	 goto return_error;
+
+	keyword = SLang_create_slstring (str);
+	if (str != buf)
+	 SLfree (str);
+
+	if (keyword == NULL)
+	 goto return_error;
+
+	if (-1 == (status = add_string_to_hash (h, keyword, num_fields, &idx)))
+	 goto return_error;
+
+	if (status == 0)
+	 {
+	 if (num_fields == max_fields)
+	 {
+		 char **new_fields;
+		 unsigned int new_max_fields = max_fields + 32;
+
+		 if (NULL == (new_fields = (char **) SLrealloc ((char *)fields, new_max_fields*sizeof(char *))))
+		 {
+		 SLang_free_slstring (keyword);
+		 goto return_error;
+		 }
+		 fields = new_fields;
+		 max_fields = new_max_fields;
+	 }
+	 fieldsnum_fields++ = keyword;
+	 }
+
+	skip_white (p);
+	if (! skip_char (p, NAME_SEPARATOR))
+	 {
+	 SLang_verror (Json_Parse_Error, "Expected a '%c' while parsing a JSON object, found " DESCRIBE_CHAR_FMT,
+			 NAME_SEPARATOR, DESCRIBE_CHAR(*p->ptr));
+	 goto return_error;
+	 }
+
+
+	if (-1 == parse_and_push_value (p, 0))
+	 goto return_error;
+
+	if (status == 1)
+	 {
+	 /* keyword already exists -- update value */
+	 if ((-1 == SLstack_exch (0, num_fields - idx))
+		 || (-1 == SLdo_pop ()))
+	 goto return_error;
+
+	 }
+	skip_white (p);
+ }
+ while (skip_char (p, VALUE_SEPARATOR));
+
+ if (skip_char (p, END_OBJECT))
+ {
+	skip_white (p);
+	if (! toplevel || looking_at (p, 0))
+	 {
+	 SLang_Struct_Type *s;
+
+	 if (NULL == (s = SLang_create_struct (fields, num_fields)))
+	 goto return_error;
+
+	 if ((-1 == SLang_pop_struct_fields (s, num_fields))
+		 || (-1 == SLang_push_struct (s)))
+	 {
+		 SLang_free_struct (s);
+		 goto return_error;
+	 }
+	 SLang_free_struct (s);
+	 free_string_hash (h);
+	 free_string_array (fields, num_fields);
+	 return 0;
+	 }
+
+	SLang_verror (Json_Parse_Error, "Expected end of input after parsing JSON object, found " DESCRIBE_CHAR_FMT, DESCRIBE_CHAR(*p->ptr));
+ }
+ else
+ {
+	if (looking_at (p, 0))
+	 SLang_verror (Json_Parse_Error, "Unexpected end of input seen while parsing a JSON object");
+	else
+	 SLang_verror (Json_Parse_Error, "Expected '%c' or '%c' while parsing a JSON object, found " DESCRIBE_CHAR_FMT,
+			VALUE_SEPARATOR, END_OBJECT, DESCRIBE_CHAR(*p->ptr));
+ }
+
+return_error:
+ free_string_array (fields, num_fields);
+ free_string_hash (h);
+ return -1;
+}
+/*}}}*/
+
+static int parse_and_push_array (Parse_Type *p, int toplevel) /*{{{*/
+{
+ SLang_List_Type *list = SLang_create_list (8); /* let's start with 8 elements */
+
+ if (list == NULL)
+ return -1;
+
+ skip_white (p);
+ if (! looking_at (p, END_ARRAY)) do
+ {
+	if ((-1 == parse_and_push_value (p, 0))
+	 || (-1 == SLang_list_append (list, -1)))
+	 goto return_error;
+	skip_white (p);
+ }
+ while (skip_char (p, VALUE_SEPARATOR));
+
+ if (skip_char (p, END_ARRAY))
+ {
+	skip_white (p);
+	if (! toplevel || looking_at (p, 0))
+	 return SLang_push_list (list, 1);
+
+	SLang_verror (Json_Parse_Error, "Expected end of input after parsing JSON array, found " DESCRIBE_CHAR_FMT, DESCRIBE_CHAR(*p->ptr));
+ }
+ else
+ {
+	if (looking_at (p, 0))
+	 SLang_verror (Json_Parse_Error, "Unexpected end of input seen while parsing a JSON array");
+	else
+	 SLang_verror (Json_Parse_Error, "Expected '%c' or '%c' while parsing a JSON array, found " DESCRIBE_CHAR_FMT,
+			VALUE_SEPARATOR, END_ARRAY, DESCRIBE_CHAR(*p->ptr));
+ }
+
+return_error:
+ SLang_free_list (list);
+ return -1;
+}
+/*}}}*/
+
+static void parse_start (char *input_string) /*{{{*/
+{
+ Parse_Type pbuf, *p = &pbuf;
+ memset ((char *)p, 0, sizeof (Parse_Type));
+ p->ptr = input_string;
+
+ if ((NULL == input_string)
+ || (0 == *input_string))
+ SLang_verror (Json_Parse_Error, "Unexpected empty input string");
+ else
+ parse_and_push_value (p, 1);
+}
+/*}}}*/
+
+static void json_decode (void) /*{{{*/
+{
+ char *buffer;
+
+ if ((SLang_Num_Function_Args != 1)
+ || (-1 == SLpop_string (&buffer)))
+ {
+	SLang_verror (SL_Usage_Error, "Usage: json_decode (String_Type json_text)");
+	return;
+ }
+ parse_start (buffer);
+ SLfree (buffer);
+}
+/*}}}*/
+
+/*{{{ json_generate_string implementation and support functions */
+
+static unsigned int Len_Map128 = /*{{{*/
+{
+ 6,6,6,6,6,6,6,6,
+ 2,2,2,6,2,2,6,6,
+ 6,6,6,6,6,6,6,6,
+ 6,6,6,6,6,6,6,6,
+ 1,1,2,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,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,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,1,1,6
+};
+/*}}}*/
+
+static char *String_Map128 = /*{{{*/
+{
+ "\\u0000", "\\u0001", "\\u0002", "\\u0003", "\\u0004", "\\u0005", "\\u0006", "\\u0007",
+ "\\b", "\\t", "\\n", "\\u000B", "\\f", "\\r", "\\u000E", "\\u000F",
+ "\\u0010", "\\u0011", "\\u0012", "\\u0013", "\\u0014", "\\u0015", "\\u0016", "\\u0017",
+ "\\u0018", "\\u0019", "\\u001A", "\\u001B", "\\u001C", "\\u001D", "\\u001E", "\\u001F",
+ " ", "!", "\\\"", "#", "$", "%", "&", "'",
+ "(", ")", "*", "+", ",", "-", ".", "/",
+ "0", "1", "2", "3", "4", "5", "6", "7",
+ "8", "9", ":", ";", "<", "=", ">", "?",
+ "@", "A", "B", "C", "D", "E", "F", "G",
+ "H", "I", "J", "K", "L", "M", "N", "O",
+ "P", "Q", "R", "S", "T", "U", "V", "W",
+ "X", "Y", "Z", "", "\\\\", "", "^", "_",
+ "`", "a", "b", "c", "d", "e", "f", "g",
+ "h", "i", "j", "k", "l", "m", "n", "o",
+ "p", "q", "r", "s", "t", "u", "v", "w",
+ "x", "y", "z", "{", "|", "}", "~", "\\u007F"
+};
+/*}}}*/
+
+/* Adapted from SLutf8.c */
+static int is_invalid_or_overlong_utf8 (SLuchar_Type *u, unsigned int len)
+{
+ unsigned int i;
+ unsigned char ch, ch1;
+
+ /* Check for invalid sequences */
+ for (i = 1; i < len; i++)
+ {
+	if ((ui & 0xC0) != 0x80)
+	 return 1;
+ }
+
+ /* Illegal (overlong) sequences */
+ /* 1100000x (10xxxxxx) */
+ /* 11100000 100xxxxx (10xxxxxx) */
+ /* 11110000 1000xxxx (10xxxxxx 10xxxxxx) */
+ /* 11111000 10000xxx (10xxxxxx 10xxxxxx 10xxxxxx) */
+ /* 11111100 100000xx (10xxxxxx 10xxxxxx 10xxxxxx 10xxxxxx) */
+ ch = *u;
+ if ((ch == 0xC0) || (ch == 0xC1))
+ return 1;
+
+ ch1 = u1;
+ if (((ch1 & ch) == 0x80)
+ && ((ch == 0xE0)
+	 || (ch == 0xF0)
+	 || (ch == 0xF8)
+	 || (ch == 0xFC)))
+ return 1;
+
+ return 0;
+}
+
+static SLstrlen_Type compute_multibyte_char_len (char *p, char *pmax) /*{{{*/
+{
+ SLstrlen_Type len;
+ unsigned char ch;
+
+ ch = (unsigned char)*p;
+ len = ((ch & 0xE0) == 0xC0) ? 2 /* (ch & 0b11100000) == 0b11000000 */
+ : ((ch & 0xF0) == 0xE0) ? 3 /* (ch & 0b11110000) == 0b11100000 */
+ : ((ch & 0xF8) == 0xF0) ? 4 /* (ch & 0b11111000) == 0b11110000 */
+ : ((ch & 0xFC) == 0xF8) ? 5 /* (ch & 0b11111100) == 0b11111000 */
+ : 6;
+
+ if (p + len > pmax)
+ return 1;
+
+ if (is_invalid_or_overlong_utf8 ((SLuchar_Type *)p, len))
+ return 1;
+
+ return len;
+}
+
+/*}}}*/
+
+static char *alloc_encoded_json_string (char *ptr, char *end_of_input_string, SLstrlen_Type *lenp) /*{{{*/
+{
+ SLstrlen_Type len = 2;			 /* first '"' and last '"' */
+
+ while (ptr < end_of_input_string)
+ {
+	unsigned char ch = (unsigned char) *ptr;
+	if (ch < 0x80)
+	 {
+	 len += Len_Mapch;
+	 ptr++;
+	 continue;
+	 }
+
+	len += 6;		 /* FIXME: Does not handle 0x1UUUU */
+	ptr += compute_multibyte_char_len (ptr, end_of_input_string);
+
+	if (ptr > end_of_input_string)
+	 {
+	 SLang_verror (Json_Invalid_Json_Error, "Invalid UTF-8 at end of string");
+	 return NULL;
+	 }
+ }
+
+ *lenp = len;
+ return SLmalloc (len + 1);
+}
+/*}}}*/
+
+static char *fill_encoded_json_string (char *ptr, char *end_of_input_string,
+				 char *dest_ptr) /*{{{*/
+{
+ *dest_ptr++ = STRING_DELIMITER;
+
+ while (ptr < end_of_input_string)
+ {
+	unsigned char ch = *ptr;
+	unsigned int len;
+
+	if (ch < 0x80)
+	 {
+	 if (1 == (len = Len_Mapch))
+	 *dest_ptr++ = ch;
+	 else
+	 {
+		 char *str = String_Mapch;
+		 while (len--)
+		 *dest_ptr++ = *str++;
+	 }
+	 ptr++;
+	 continue;
+	 }
+
+	/* We cannot use SLutf8_decode, since we need to handle invalid_or_overlong_utf8 or ILLEGAL_UNICODE as well. */
+	len = compute_multibyte_char_len (ptr, end_of_input_string);
+	if (len == 1)
+	 {
+	 /* Malformed or overlong */
+	 sprintf (dest_ptr, "<%02X>", (unsigned char)*ptr);
+	 dest_ptr += 4;
+	 }
+	else
+	 { /* stolen from slutf8.c : fast_utf8_decode */
+	 static unsigned char masks7 = { 0, 0, 0x1F, 0xF, 0x7, 0x3, 0x1 };
+	 SLwchar_Type w = (ch & maskslen);
+	 SLstrlen_Type i;
+	 for (i = 1; i < len; i++)
+	 w = (w << 6) | (ptri & 0x3F);
+
+	 if (w > 0xFFFF)
+	 {
+		 /* FIXME: Must be encoded as a pair of UTF-16 surrogates */
+		 memcpy (dest_ptr, ptr, len);
+		 dest_ptr += len;
+	 }
+	 else
+	 {
+		 sprintf (dest_ptr, "\\u%04X", w);
+		 dest_ptr += 6;
+	 }
+	 }
+	ptr += len;
+ }
+ *dest_ptr++ = STRING_DELIMITER;
+ *dest_ptr = 0;
+ return dest_ptr;
+}
+/*}}}*/
+
+static void json_encode_string (void) /*{{{*/
+{
+ SLang_BString_Type *bstring = NULL;
+ char *string, *encoded_json_string;
+ SLstrlen_Type len, new_len;
+
+ if (SLang_peek_at_stack () == SLANG_BSTRING_TYPE)
+ {
+	if (-1 == SLang_pop_bstring (&bstring))
+	 return;
+
+	string = (char *)SLbstring_get_pointer (bstring, &len);
+ }
+ else
+ {
+	if (-1 == SLang_pop_slstring (&string))
+	 {
+	 SLang_verror (SL_Usage_Error, "usage: _json_generate_string (String_Type json_string)");
+	 return;
+	 }
+	len = strlen (string);
+ }
+
+ if ((encoded_json_string = alloc_encoded_json_string (string, string + len, &new_len)) != NULL)
+ {
+	SLang_BString_Type *b;
+	char *enc_end;
+
+	enc_end = fill_encoded_json_string (string, string + len, encoded_json_string);
+	new_len = enc_end - encoded_json_string;
+
+	b = SLbstring_create_malloced ((unsigned char *)encoded_json_string, new_len, 1);
+	if (b != NULL)
+	 {
+	 (void) SLang_push_bstring (b);
+	 SLbstring_free (b);
+	 }
+ }
+
+ if (bstring != NULL)
+ SLbstring_free (bstring);
+ else
+ SLang_free_slstring (string);
+}
+/*}}}*/
+
+/*}}}*/
+
+static SLang_Intrin_Fun_Type Module_Intrinsics = /*{{{*/
+{
+ MAKE_INTRINSIC_0("json_decode", json_decode, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_json_encode_string", json_encode_string, SLANG_VOID_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+/*}}}*/
+
+static SLang_Intrin_Var_Type Module_Variables = /*{{{*/
+{
+ MAKE_VARIABLE("_json_module_version_string", &json_module_version_string, SLANG_STRING_TYPE, 1),
+ SLANG_END_INTRIN_VAR_TABLE
+};
+/*}}}*/
+
+static SLang_IConstant_Type Module_Constants = /*{{{*/
+{
+ MAKE_ICONSTANT("_json_module_version", JSON_MODULE_VERSION_NUMBER),
+ SLANG_END_ICONST_TABLE
+};
+/*}}}*/
+
+int init_json_module_ns (char *ns_name) /*{{{*/
+{
+ SLang_NameSpace_Type *ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if ((Json_Parse_Error == -1)
+ && (-1 == (Json_Parse_Error = SLerr_new_exception (SL_RunTime_Error, "Json_Parse_Error", "JSON Parse Error"))))
+ return -1;
+
+ if ((Json_Invalid_Json_Error == -1)
+ && (-1 == (Json_Invalid_Json_Error = SLerr_new_exception (SL_RunTime_Error, "Json_Invalid_Json_Error", "Invalid JSON Error"))))
+ return -1;
+
+ if ((-1 == SLns_add_intrin_fun_table (ns, Module_Intrinsics, NULL))
+ || (-1 == SLns_add_intrin_var_table (ns, Module_Variables, NULL))
+ || (-1 == SLns_add_iconstant_table (ns, Module_Constants, NULL)))
+ return -1;
+
+ return 0;
+}
+/*}}}*/
+
+void deinit_json_module (void) /*{{{*/
+{
+ /* This function is optional */
+}
+/*}}}*/

_service:tar_scm:slang-2.3.2.tar.bz2/modules/json.sl Added

@@ -0,0 +1,234 @@
+% -*- mode: slang; mode: fold -*-
+
+import("json");
+
+%{{{ Type Handlers for json_encode
+
+private variable Type_Map = Ref_Type0;
+
+private define add_type_handler ()
+{
+ variable func = ();
+ loop (_NARGS-1)
+ {
+	variable type = ();
+	variable idx = __class_id (type);
+	variable n = length (Type_Map);
+	if (idx >= n)
+	 {
+	 variable new_map = Ref_Typeidx+1;
+	 new_map0:n-1 = Type_Map;
+	 Type_Map = new_map;
+	 }
+	Type_Mapidx = func;
+ }
+}
+
+private define get_encode_func (type)
+{
+ try
+ {
+	variable func = Type_Map__class_id (type);
+	if (func == NULL) throw IndexError;
+	return func;
+ }
+ catch IndexError:
+ throw Json_Invalid_Json_Error, "$type does not represent a JSON data structure"$;
+}
+%}}}
+
+private define json_encode_string (indent, q, data) %{{{
+{
+ return _json_encode_string (data);
+}
+add_type_handler (String_Type, BString_Type, &json_encode_string);
+%}}}
+
+private define json_encode_boolean (indent, q, data) %{{{
+{
+ if (data == 1) return "true"B;
+ if (data == 0) return "false"B;
+ throw Json_Invalid_Json_Error, sprintf (`invalid boolean value '\%03o'; only '\000' and '\001' are allowed`, data);
+}
+add_type_handler (UChar_Type, &json_encode_boolean);
+%}}}
+
+private define json_encode_null (indent, q, data) %{{{
+{
+ return "null"B;
+}
+add_type_handler (Null_Type, &json_encode_null);
+%}}}
+
+private define json_encode_number (indent, q, data) %{{{
+{
+ return string (data);
+}
+add_type_handler (
+	Char_Type, % UChar_Type,
+	Short_Type, UShort_Type,
+	Int_Type, UInt_Type,
+	Long_Type, ULong_Type,
+#ifexists LLong_Type
+	LLong_Type, ULLong_Type,
+#endif
+	Float_Type, Double_Type,
+	&json_encode_number);
+%}}}
+
+private define json_encode_object (indent, q, object) %{{{
+{
+ variable json = "{"B;
+ variable keys = get_struct_field_names (object);
+ variable n_values = length (keys);
+ if (n_values)
+ {
+	% pvs indent KEY nsep VAL vsep pvs indent KEY nsep VAL vsep
+	% ... pvs indent KEY nsep VAL pvs
+
+	variable new_indent = bstrcat (indent, q.indent);
+	variable sep = bstrcat (q.vsep, q.post_vsep, new_indent);
+	variable nsep = q.nsep;
+
+	variable key = keys0;
+	variable val = get_struct_field(object, key);
+	variable type = typeof (val);
+	variable func = get_encode_func (type);
+	json = bstrcat (__tmp(json), q.post_vsep, new_indent,
+			_json_encode_string (key), nsep, (@func)(new_indent, q, val));
+
+	variable i;
+	_for i (1, n_values-1)
+	 {
+	 key = keysi;
+	 val = get_struct_field(object, key);
+	 variable next_type = typeof (val);
+	 if (next_type == String_Type)
+	 {
+		 json = bstrcat (__tmp(json), sep, _json_encode_string (key),
+				 nsep, _json_encode_string (val));
+		 continue;
+	 }
+
+	 if (next_type != type)
+	 (type, func) = (next_type, get_encode_func (next_type));
+	 json = bstrcat (__tmp(json), sep, _json_encode_string (key),
+			 nsep, (@func)(new_indent, q, val));
+ }
+	json = bstrcat (__tmp(json), q.post_vsep);
+ }
+ return bstrcat (__tmp(json), indent, "}");
+}
+add_type_handler (Struct_Type, &json_encode_object);
+%}}}
+
+private define json_encode_array (indent, q, array) %{{{
+{
+ variable json = ""B;
+ variable n_values = length (array);
+ if (n_values)
+ {
+	% pvs, new_indent, VALUE, vsep, pvs, new_indent, VALUE, vsep, pvs, ..., new_indent, VALUE, pvs
+
+	variable new_indent = bstrcat (indent, q.indent);
+	variable sep = bstrcat (q.vsep, q.post_vsep, new_indent);
+
+	variable i = 0;
+	variable a = arrayi;
+	variable type = typeof (a);
+	variable func = get_encode_func (type);
+	json = bstrcat (__tmp(json), q.post_vsep,
+			new_indent, (@func)(new_indent, q, a));
+
+	if ((typeof (array) == Array_Type) && not any (_isnull (array)))
+	 {
+	 if (type == String_Type)
+	 _for i (1, n_values-1)
+		 json = bstrcat (__tmp(json), sep, _json_encode_string (arrayi));
+	 else
+	 _for i (1, n_values-1)
+		 json = bstrcat (__tmp(json), sep, (@func)(new_indent, q, arrayi));
+	 }
+	else _for i (1, n_values-1)
+	 {
+	 a = arrayi;
+	 variable next_type = typeof (a);
+	 if (next_type == String_Type)
+	 {
+		 json = bstrcat (__tmp(json), sep, _json_encode_string (a));
+		 continue;
+	 }
+
+	 if (next_type != type)
+	 (type, func) = (next_type, get_encode_func (next_type));
+	 json = bstrcat (__tmp(json), sep, (@func)(new_indent, q, a));
+	 }
+
+	json = bstrcat (__tmp(json), q.post_vsep);
+ }
+ return bstrcat (__tmp(json), indent, "");
+}
+add_type_handler (List_Type, Array_Type, &json_encode_array);
+%}}}
+
+private define default_handler (indent, q, data) %{{{
+{
+ if (0 < __is_numeric (data) < 3)
+ return json_encode_number (data);
+
+ if (is_struct_type (data))
+ return json_encode_object (data);
+
+ variable type = _typeof (data);
+ throw Json_Invalid_Json_Error, "$type does not represent a JSON data structure"$;
+}
+Type_Mapwhere (_isnull (Type_Map)) = &default_handler;
+%}}}
+
+% process_qualifiers %{{{
+
+private define split_post_vsep (post_vsep) %{{{
+{
+ variable indent = "";
+ variable parts = strchop (post_vsep, '\n', 0);
+ if (length (parts) > 1)
+ {
+	indent = parts-1;
+	parts-1 = "";
+	post_vsep = strjoin (parts, "\n");
+ }
+ return (indent, post_vsep);
+}
+%}}}
+
+private define only_whitespace (s)
+{
+ return ""B + str_delete_chars (s, "^ \t\n\r");
+}
+
+private define process_qualifiers ()
+{
+ variable post_vsep = split_post_vsep (qualifier ("post_vsep", ""));
+ variable indent = (); % other return value from split_post_vsep
+ variable q = struct {
+ pre_nsep = only_whitespace (qualifier ("pre_nsep", "")),
+ post_nsep = only_whitespace (qualifier ("post_nsep", "")),
+ pre_vsep = only_whitespace (qualifier ("pre_vsep", "")),
+ post_vsep = only_whitespace (post_vsep),
+ indent = only_whitespace (indent),
+ };
+ return struct {
+ nsep = q.pre_nsep + ":" + q.post_nsep,
+ vsep = q.pre_vsep + ",",
+ @q
+ };
+}
+%}}}
+
+define json_encode (data)
+{
+ variable q = process_qualifiers (;; __qualifiers);
+ variable func = get_encode_func (typeof (data));
+ variable json = (@func)(""B, q, data);
+ return typecast (json, String_Type);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/mkfiles Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/mkfiles/README Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/mkfiles/makefile.all Added

@@ -0,0 +1,208 @@
+!ifndef MSDOS WIN16 WIN32 OS2
+# -*- mode: sh; mode: fold -*-
+# This file has been folded. It is far more comprehensible when viewed with
+# an editor that supports folding.
+
+#{{{ MACRO descriptions
+
+This is a master makefile that from which DOS/Windows/OS2 makefiles
+may be derived. A makefile for a particular system may be derived by
+passing this through the standalone DOS executable 'mkmake' which
+should be present in this directory. For example, to produce a makefile
+suitable for OS2 using the EMX compiler use:
+
+ mkmake OS2 EMX < makefile.all > Makefile
+
+Similarly,
+
+ mkmake MSDOS BCC < makefile.all > Makefile
+
+will produce a makefile for MSDOS and the Borland C compiler.
+
+Currently supported environments in this file include:
+
+ WIN32
+
+Currently supported compilers include:
+
+ WIN32 - VC, CYGWIN32, MINGW32
+
+Each section must define the following macros:
+
+ CC : The C compiler
+ CFLAGS		: Compiler flags
+ P		: Path separator used by make/compiler
+ O		: Object file extension
+ OBJDIR		: Subdirectory where lib slang objects were placed
+ COMPILE_TARGET	: Command used to produce object from .c file
+ LINK_TARGET : Command used to produce the dll
+ SLANGDIR : Location of slang library
+ SLANGINC : Location of slang.h
+ COPY		: Copy command
+ RM		: Delete command
+
+Other macros include:
+
+ RSPFILE	: Name of response file
+ RSP_PREFIX	: Prefix for response file line (See its usage)
+ RSP_POSTFIX	: Postfix for response file line (See its usage)
+ DEF_FILE	: *.def file
+
+Special notes:
+
+ The P macro could be problematic when its value is a backslash (\). Some
+ make programs may require it to be doubled, i.e., \\. Whatever its value is,
+ it should expand to something that does not include whitespace. Usually
+ this requires that it be followed by a '#' character; however, this may
+ result in the '#' character being quoted, or, escaped if the value of P is
+ a backslash.
+
+#}}}
+!else #rest of file
+# Note:
+# This makefile was automatically generated from the master makefile.all.
+# The actual build is performed by a sub-make process. See the rules below.
+TOOL_PREFIX =
+!ifdef WIN32 #{{{
+! ifdef VC #{{{
+# Makefile for slang as Win32 GUI using nmake under Visual C.
+CC = cl
+CFLAGS = /nologo /W3 /O2 /D "NDEBUG" /D $(CPU) /D "__WIN32__" /DSLANG_DLL=1
+P = \\
+O = obj # Object extension
+OBJDIR = mw32objs# Location of objects
+RM = del
+COPY = copy /y
+TARGET_C = $(TARGET).c
+TARGET_DLL = $(TARGET).dll
+TARGET_OBJ = $(TARGET).$(O)
+TARGET_OBJS = $(TARGET_OBJ) $(TARGET_XOBJS)
+LINK_TARGET = link /DLL /SUBSYSTEM:console /LIBPATH:$(SLANGDIR) wslang32.lib -out:$(TARGET_DLL) $(TARGET_OBJS)#
+COMPILE_TARGET = $(CC) /c $(CFLAGS) /I "." /I $(SLANGINC) $(TARGETINCS) /Fo $(TARGET_OBJ) $(TARGET_C)
+#
+ICONVDIR=..$(P)..$(P)iconv
+ICONVINCS = /I$(ICONVDIR)$(P)include
+ICONVLIBS = /LIBPATH:$(ICONVDIR)$(P)lib
+#
+ONIGDIR=..$(P)..$(P)onig
+ONIGINCS = /I$(ONIGDIR)$(P)include
+ONIGLIBS = /LIBPATH:$(ONIGDIR)$(P)lib
+#
+PNGDIR=..$(P)..$(P)png
+PNGINCS = /I$(PNGDIR)$(P)include
+PNGLIBS = /LIBPATH:$(PNGDIR)$(P)lib
+#
+ZLIBDIR=..$(P)..$(P)zlib
+ZLIBINCS = /I$(ZLIBDIR)$(P)include
+ZLIBLIBS = /LIBPATH:$(ZLIBDIR)$(P)lib
+
+# This needs changing for Windows NT on non-Intel processors
+CPU = _X86_
+#}}}
+! elifdef CYGWIN32 MINGW32 #{{{
+CC = $(TOOL_PREFIX)gcc
+P = /
+O = o
+OBJDIR = gw32objs
+! ifdef DLL
+DLL_FLAGS = -DSLANG_DLL=1
+! endif
+WFLAGS = -W -Wall
+! ifdef CYGWIN32
+CFLAGS = -DWIN32 -O2 $(WFLAGS) -mno-cygwin $(DLL_FLAGS)
+RM = rm
+COPY = cp
+! else
+CFLAGS = -DWIN32 -O2 $(WFLAGS) $(DLL_FLAGS)
+RM = del
+COPY = copy /y
+! endif
+TARGET_C = $(TARGET).c
+TARGET_DLL = $(TARGET).dll
+TARGET_OBJ = $(TARGET).$(O)
+TARGET_OBJS = $(TARGET_OBJ) $(TARGET_XOBJS)
+LINK_TARGET = $(CC) -s -shared -o $(TARGET_DLL) $(TARGET_OBJS) \
+ -L$(SLANGDIR) -lslang $(TARGETLIBS) -luser32
+COMPILE_TARGET = $(CC) -c $(CFLAGS) -I$(SLANGINC) $(TARGETINCS) $(TARGET_C)
+INCFLAGS =
+LIBFLAGS =
+ICONVINCS = $(INCFLAGS)
+ICONVLIBS = $(LIBFLAGS) -liconv
+PNGINCS = $(INCFLAGS)
+PNGLIBS = $(LIBFLAGS) -lpng
+ZLIBINCS = $(INCFLAGS)
+ZLIBLIBS = $(LIBFLAGS) -lz
+ONIGINCS = $(INCFLAGS)
+ONIGLIBS = $(LIBFLAGS) -lonig
+#}}}
+! endif
+SLANGINC = ..$(P)src
+SLANGDIR = ..$(P)src$(P)$(OBJDIR)
+#}}}
+!endif
+# End of compiler specific section
+# ---------------------------------------------------------------------------
+# List of modules to compile. Some/Most require additional libraries to be
+# installed.
+MODULES = chksum stats slsmg rand csv base64 histogram json
+CHKSUM_XOBJS = chksum_md5.$(O) chksum_sha1.$(O)
+STATS_XOBJS = stats_kendall.$(O)
+# slsmg, rand, csv base64 histogram stats: no external dependencies
+# iconv: iconv library
+# png: png library
+# pcre: Ported to Win32 by GnuWin32 group.
+# onig: onig RE library
+# varray-module.c: No external libs but requires porting to windows.
+# zlib: z compression/decompression library
+# select, fcntl, socket, termios, fork, sysconf: requires POSIX support
+
+all: $(MODULES)
+
+#iconv-module.c
+iconv:
+	$(MAKE) TARGET=iconv-module TARGETLIBS=$(ICONVLIBS) TARGETINCS=$(ICONVINCS) build-target
+onig:
+	$(MAKE) TARGET=onig-module TARGETLIBS=$(ONIGLIBS) TARGETINCS=$(ONIGINCS) build-target
+slsmg:
+	$(MAKE) TARGET=slsmg-module TARGETLIBS=$(SLSMGLIBS) TARGETINCS=$(SLSMGINCS) build-target
+rand:
+	$(MAKE) TARGET=rand-module TARGETLIBS=$(RANDLIBS) TARGETINCS=$(RANDINCS) build-target
+csv:
+	$(MAKE) TARGET=csv-module TARGETLIBS=$(CSVLIBS) TARGETINCS=$(CSVINCS) build-target
+base64:
+	$(MAKE) TARGET=base64-module TARGETLIBS=$(BASE64LIBS) TARGETINCS=$(BASE64INCS) build-target
+pcre:
+	$(MAKE) TARGET=pcre-module TARGETLIBS=$(PCRELIBS) TARGETINCS=$(PCREINCS) build-target
+png:
+	$(MAKE) TARGET=png-module TARGETLIBS=$(PNGLIBS) TARGETINCS=$(PNGINCS) build-target
+zlib:
+	$(MAKE) TARGET=zlib-module TARGETLIBS=$(ZLIBLIBS) TARGETINCS=$(ZLIBINCS) build-target
+varray:
+	$(MAKE) TARGET=varray-module TARGETLIBS=$(VARRAYLIBS) TARGETINCS=$(VARRAYINCS) build-target
+histogram:
+	$(MAKE) TARGET=histogram-module TARGETLIBS=$(HISTOGRAMLIBS) TARGETINCS=$(HISTOGRAMINCS) build-target
+json:
+	$(MAKE) TARGET=json-module TARGETLIBS=$(JSONLIBS) TARGETINCS=$(JSONINCS) build-target
+chksum:
+	$(MAKE) TARGET=chksum_md5 TARGETINCS=$(CHKSUMINCS) compile-target
+	$(MAKE) TARGET=chksum_sha1 TARGETINCS=$(CHKSUMINCS) compile-target
+	$(MAKE) TARGET=chksum-module TARGETLIBS=$(CHKSUMLIBS) TARGETINCS=$(CHKSUMINCS) "TARGET_XOBJS=$(CHKSUM_XOBJS)" build-target
+stats:
+	$(MAKE) TARGET=stats_kendall TARGETINCS=$(STATSINCS) compile-target
+	$(MAKE) TARGET=stats-module TARGETLIBS=$(STATSLIBS) TARGETINCS=$(STATSINCS) "TARGET_XOBJS=$(STATS_XOBJS)" build-target
+#
+#
+build-target: $(TARGET_DLL)
+$(TARGET_DLL): $(TARGET_OBJS)
+	$(LINK_TARGET)
+compile-target: $(TARGET_OBJ)
+$(TARGET_OBJ): $(TARGET_C)
+	$(COMPILE_TARGET)
+#
+$(OBJDIR) :
+	-mkdir $(OBJDIR)
+clean:
+	-$(RM) *.$(O)
+#
+.PHONY: $(MODULES) build-target
+!endif #NOT HELP

_service:tar_scm:slang-2.3.2.tar.bz2/modules/newt-module.c Added

@@ -0,0 +1,90 @@
+/* This module implements and interface to the Newt library */
+#include <stdio.h>
+#include <slang.h>
+#include <newt.h>
+
+SLANG_MODULE(newt);
+
+static int Ok_To_Draw;
+
+static void init (void)
+{
+ newtInit ();
+ Ok_To_Draw = 1;
+}
+
+static void cls (void)
+{
+ if (Ok_To_Draw)
+ newtCls ();
+}
+
+static void draw_root_text (int *c, int *r, char *s)
+{
+ if (Ok_To_Draw)
+ newtDrawRootText (*c, *r, s);
+}
+
+static void open_window (int *c, int *r, int *dc, int *dr, char *title)
+{
+ if (Ok_To_Draw)
+ newtOpenWindow (*c, *r, *dc, *dr, title);
+}
+
+static void refresh (void)
+{
+ if (Ok_To_Draw)
+ newtRefresh ();
+}
+
+static void finished (void)
+{
+ if (Ok_To_Draw)
+ newtFinished ();
+ Ok_To_Draw = 0;
+}
+
+#define I SLANG_INT_TYPE
+#define S SLANG_STRING_TYPE
+
+static SLang_Intrin_Fun_Type Module_Funs =
+{
+ MAKE_INTRINSIC_0("newtInit", init, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("newtCls", cls, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_IIS("newtDrawRootText", draw_root_text, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_5("newtOpenWindow", open_window, SLANG_VOID_TYPE, I,I,I,I,S),
+ MAKE_INTRINSIC_0("newtRefresh", refresh, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("NewtFinished", finished, SLANG_VOID_TYPE),
+
+ SLANG_END_TABLE
+};
+
+static SLang_Intrin_Var_Type Module_Variables =
+{
+ SLANG_END_TABLE
+};
+
+static SLang_IConstant_Type Module_Constants =
+{
+ SLANG_END_TABLE
+};
+
+int init_newt_module_ns (char *ns)
+{
+ if ((-1 == SLns_add_intrin_fun_table (ns, Module_Funs, "__NEWT__"))
+ || (-1 == SLns_add_intrin_var_table (ns, Module_Variables, NULL))
+ || (-1 == SLns_add_iconstant_table (ns, Module_Constants, NULL)))
+ return -1;
+
+ Ok_To_Draw = 0;
+
+ (void) SLang_add_cleanup_function (finished);
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_newt_module (void)
+{
+ finished ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/onig-module.c Added

@@ -0,0 +1,848 @@
+/*
+Copyright (C) 2007-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "config.h"
+#include <stdio.h>
+#include <slang.h>
+#include <string.h>
+
+#include <oniguruma.h>
+
+SLANG_MODULE(onig);
+
+#if 0
+/* This function converts a slang RE to a pcre expression. It performs the
+ * following transformations:
+ * ( --> $
+ * ) --> $
+ * # --> \#
+ * | --> \|
+ * { --> \{
+ * } --> \}
+ * \< --> \b
+ * \> --> \b
+ * \C --> (?i)
+ * \c --> (?-i)
+ * $ --> (
+ * $ --> )
+ * \{ --> {
+ * \} --> }
+ * Anything else?
+ */
+static char *_slang_to_pcre (char *slpattern)
+{
+ char *pattern, *p, *s;
+ unsigned int len;
+ int in_bracket;
+ char ch;
+
+ len = strlen (slpattern);
+ pattern = SLmalloc (3*len + 1);
+ if (pattern == NULL)
+ return NULL;
+
+ p = pattern;
+ s = slpattern;
+ in_bracket = 0;
+ while ((ch = *s++) != 0)
+ {
+	switch (ch)
+	 {
+	 case '{':
+	 case '}':
+	 case '(':
+	 case ')':
+	 case '#':
+	 case '|':
+	 if (0 == in_bracket) *p++ = '\\';
+	 *p++ = ch;
+	 break;
+
+	 case '':
+	 in_bracket = 1;
+	 *p++ = ch;
+	 break;
+
+	 case '':
+	 in_bracket = 0;
+	 *p++ = ch;
+	 break;
+
+	 case '\\':
+	 ch = *s++;
+	 switch (ch)
+	 {
+		case 0:
+		 s--;
+		 break;
+
+		case '<':
+		case '>':
+		 *p++ = '\\'; *p++ = 'b';
+		 break;
+
+		case '(':
+		case ')':
+		case '{':
+		case '}':
+		 *p++ = ch;
+		 break;
+
+		case 'C':
+		 *p++ = '('; *p++ = '?'; *p++ = 'i'; *p++ = ')';
+		 break;
+		case 'c':
+		 *p++ = '('; *p++ = '?'; *p++ = '-'; *p++ = 'i'; *p++ = ')';
+		 break;
+
+		default:
+		 *p++ = '\\';
+		 *p++ = ch;
+	 }
+	 break;
+
+	 default:
+	 *p++ = ch;
+	 break;
+	 }
+ }
+ *p = 0;
+
+ s = SLang_create_slstring (pattern);
+ SLfree (pattern);
+ return s;
+}
+
+static void slang_to_pcre (char *pattern)
+{
+ /* NULL ok in code below */
+ pattern = _slang_to_pcre (pattern);
+ (void) SLang_push_string (pattern);
+ SLang_free_slstring (pattern);
+}
+#endif
+
+static int slOnig_Error = -1;
+static int Onig_Type_Id = 0;
+
+static void throw_onig_error (int err_code, OnigErrorInfo *einfo)
+{
+ UChar err_bufONIG_MAX_ERROR_MESSAGE_LEN;
+
+ (void) onig_error_code_to_str (err_buf, err_code, einfo);
+ SLang_verror (slOnig_Error, "%s", err_buf);
+}
+
+/* These 3 typedefs should be merged into a union, but C does not support
+ * initializing a union.
+ */
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ /* VOID_STAR ptr; */
+ void *ptr;
+}
+Name_Map_Type;
+
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ OnigSyntaxType *syn;
+}
+Syntax_Table_Map_Type;
+
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ OnigEncodingType *encoding;
+}
+Encoding_Table_Map_Type;
+
+static VOID_STAR pop_onig_name_ptr (Name_Map_Type *map, SLFUTURE_CONST char *onig_object)
+{
+ char *str;
+
+ if (-1 == SLang_pop_slstring (&str))
+ return NULL;
+
+ while (map->name != NULL)
+ {
+	if (0 == strcmp (str, map->name))
+	 {
+	 SLang_free_slstring (str);
+	 return map->ptr;
+	 }
+	map++;
+ }
+
+ SLang_verror (SL_InvalidParm_Error, "Unsupported or unknown onig %s: %s", onig_object, str);
+ SLang_free_slstring (str);
+ return NULL;
+}
+
+static void get_onig_names (Name_Map_Type *map)
+{
+ SLindex_Type i, num;
+ SLang_Array_Type *at;
+ char **names;
+ Name_Map_Type *table;
+
+ table = map;
+ while (table->name != NULL)
+ table++;
+ num = (SLindex_Type) (table - map);
+
+ if (NULL == (at = SLang_create_array (SLANG_STRING_TYPE, 0, NULL, &num, 1)))
+ return;
+
+ table = map;
+ names = (char **)at->data;
+ for (i = 0; i < num; i++)
+ {
+	if (NULL == (namesi = SLang_create_slstring (table->name)))
+	 {
+	 SLang_free_array (at);
+	 return;
+	 }
+	table++;
+ }
+ (void) SLang_push_array (at, 1);
+}
+
+Syntax_Table_Map_Type Syntax_Table_Map =
+{
+ { "asis", ONIG_SYNTAX_ASIS },
+ { "posix_basic", ONIG_SYNTAX_POSIX_BASIC },
+ { "posix_extended", ONIG_SYNTAX_POSIX_EXTENDED },
+ { "emacs", ONIG_SYNTAX_EMACS },
+ { "grep", ONIG_SYNTAX_GREP },
+ { "gnu_regex", ONIG_SYNTAX_GNU_REGEX },
+ { "java", ONIG_SYNTAX_JAVA },
+ { "perl", ONIG_SYNTAX_PERL },
+ { "perl_ng", ONIG_SYNTAX_PERL_NG },
+ { "ruby", ONIG_SYNTAX_RUBY },
+ { NULL, NULL}
+};
+
+static OnigSyntaxType *pop_onig_syntax (void)
+{
+ return (OnigSyntaxType *) pop_onig_name_ptr ((Name_Map_Type *)Syntax_Table_Map, "syntax");
+}
+
+static Encoding_Table_Map_Type Encoding_Table_Map =
+{
+#ifdef ONIG_ENCODING_ASCII
+ {"ascii", ONIG_ENCODING_ASCII},
+#endif
+#ifdef ONIG_ENCODING_ISO_8859_1
+ {"iso_8859_1", ONIG_ENCODING_ISO_8859_1},
+#endif
+#ifdef ONIG_ENCODING_ISO_8859_2
+ {"iso_8859_2", ONIG_ENCODING_ISO_8859_2},
+#endif
+#ifdef ONIG_ENCODING_ISO_8859_3
+ {"iso_8859_3", ONIG_ENCODING_ISO_8859_3},
+#endif
+#ifdef ONIG_ENCODING_ISO_8859_4
+ {"iso_8859_4", ONIG_ENCODING_ISO_8859_4},
+#endif
+#ifdef ONIG_ENCODING_ISO_8859_5
+ {"iso_8859_5", ONIG_ENCODING_ISO_8859_5},
+#endif
+#ifdef ONIG_ENCODING_ISO_8859_6
+ {"iso_8859_6", ONIG_ENCODING_ISO_8859_6},
+#endif
+#ifdef ONIG_ENCODING_ISO_8859_7
+ {"iso_8859_7", ONIG_ENCODING_ISO_8859_7},
+#endif
+#ifdef ONIG_ENCODING_ISO_8859_8
+ {"iso_8859_8", ONIG_ENCODING_ISO_8859_8},
+#endif
+#ifdef ONIG_ENCODING_ISO_8859_9
+ {"iso_8859_9", ONIG_ENCODING_ISO_8859_9},
+#endif
+#ifdef ONIG_ENCODING_ISO_8859_10
+ {"iso_8859_10", ONIG_ENCODING_ISO_8859_10},
+#endif
+#ifdef ONIG_ENCODING_ISO_8859_11
+ {"iso_8859_11", ONIG_ENCODING_ISO_8859_11},
+#endif
+#ifdef ONIG_ENCODING_ISO_8859_13
+ {"iso_8859_13", ONIG_ENCODING_ISO_8859_13},
+#endif
+#ifdef ONIG_ENCODING_ISO_8859_14
+ {"iso_8859_14", ONIG_ENCODING_ISO_8859_14},
+#endif
+#ifdef ONIG_ENCODING_ISO_8859_15
+ {"iso_8859_15", ONIG_ENCODING_ISO_8859_15},
+#endif
+#ifdef ONIG_ENCODING_ISO_8859_16
+ {"iso_8859_16", ONIG_ENCODING_ISO_8859_16},
+#endif
+#ifdef ONIG_ENCODING_UTF8
+ {"utf8", ONIG_ENCODING_UTF8},
+#endif
+#ifdef ONIG_ENCODING_UTF16_BE
+ {"utf16_be", ONIG_ENCODING_UTF16_BE},
+#endif
+#ifdef ONIG_ENCODING_UTF16_LE
+ {"utf16_le", ONIG_ENCODING_UTF16_LE},
+#endif
+#ifdef ONIG_ENCODING_UTF32_BE
+ {"utf32_be", ONIG_ENCODING_UTF32_BE},
+#endif
+#ifdef ONIG_ENCODING_UTF32_LE
+ {"utf32_le", ONIG_ENCODING_UTF32_LE},
+#endif
+#ifdef ONIG_ENCODING_EUC_JP
+ {"euc_jp", ONIG_ENCODING_EUC_JP},
+#endif
+#ifdef ONIG_ENCODING_EUC_TW
+ {"euc_tw", ONIG_ENCODING_EUC_TW},
+#endif
+#ifdef ONIG_ENCODING_EUC_KR
+ {"euc_kr", ONIG_ENCODING_EUC_KR},
+#endif
+#ifdef ONIG_ENCODING_EUC_CN
+ {"euc_cn", ONIG_ENCODING_EUC_CN},
+#endif
+#ifdef ONIG_ENCODING_SJIS
+ {"sjis", ONIG_ENCODING_SJIS},
+#endif
+#ifdef ONIG_ENCODING_KOI8
+ /* {"koi8", ONIG_ENCODING_KOI8}, */
+#endif
+#ifdef ONIG_ENCODING_KOI8_R
+ {"koi8_r", ONIG_ENCODING_KOI8_R},
+#endif
+#ifdef ONIG_ENCODING_CP1251
+ {"cp1251", ONIG_ENCODING_CP1251},
+#endif
+#ifdef ONIG_ENCODING_BIG5
+ {"big5", ONIG_ENCODING_BIG5},
+#endif
+#ifdef ONIG_ENCODING_GB18030
+ {"gb18030", ONIG_ENCODING_GB18030},
+#endif
+ {NULL, NULL}
+};
+
+static OnigEncodingType *pop_onig_encoding (void)
+{
+ return (OnigEncodingType *) pop_onig_name_ptr ((Name_Map_Type *)Encoding_Table_Map, "encoding");
+}
+
+typedef struct
+{
+ regex_t *re;
+ OnigRegion *region;
+ int match_pos;		 /* >= 0 if ok */
+}
+Onig_Type;
+
+static void free_onig_type (Onig_Type *o)
+{
+ if (o == NULL)
+ return;
+ if (o->region != NULL)
+ onig_region_free (o->region, 1);
+ if (o->re != NULL)
+ onig_free (o->re);
+ SLfree ((char *) o);
+}
+
+static int push_onig_type (Onig_Type *o)
+{
+ SLang_MMT_Type *mmt;
+
+ if (NULL == (mmt = SLang_create_mmt (Onig_Type_Id, (VOID_STAR) o)))
+ {
+	free_onig_type (o);
+	return -1;
+ }
+ if (-1 == SLang_push_mmt (mmt))
+ {
+	SLang_free_mmt (mmt);
+	return -1;
+ }
+ return 0;
+}
+
+static int pop_onig_option (OnigOptionType *optp)
+{
+ int iopt;
+
+ if (-1 == SLang_pop_int (&iopt))
+ return -1;
+ *optp = (OnigOptionType) iopt;
+ return 0;
+}
+
+/* Usage: reg = onig_new (pattern, options, enc, syntax) */
+static void do_onig_new (void)
+{
+ const UChar* pattern;
+ const UChar* pattern_end;
+ OnigOptionType option;
+ OnigEncoding enc;
+ OnigSyntaxType *syntax;
+ OnigErrorInfo err_info;
+ Onig_Type *o;
+ int status;
+
+ syntax = ONIG_SYNTAX_PERL;
+ if (SLinterp_is_utf8_mode ())
+ enc = ONIG_ENCODING_UTF8;
+ else
+ enc = ONIG_ENCODING_ISO_8859_1;
+ option = ONIG_OPTION_DEFAULT;
+
+ switch (SLang_Num_Function_Args)
+ {
+ default:
+	SLang_verror (SL_Usage_Error, "Usage: r = onig_new (pattern ,options ,encoding ,syntax)");
+	return;
+
+ case 4:
+	if (NULL == (syntax = pop_onig_syntax ()))
+	 return;
+ case 3:
+	if (NULL == (enc = pop_onig_encoding ()))
+	 return;
+ case 2:
+	if (-1 == pop_onig_option (&option))
+	 return;
+ case 1:
+	if (-1 == SLang_pop_slstring ((char **)&pattern))
+	 return;
+ }
+
+ if (NULL == (o = (Onig_Type *) SLcalloc (1, sizeof (Onig_Type))))
+ {
+	SLang_free_slstring ((char *)pattern);
+	return;
+ }
+
+ pattern_end = pattern + strlen ((char *)pattern);
+
+ status = onig_new (&o->re, pattern, pattern_end,
+		 option, enc, syntax, &err_info);
+
+ if (status != ONIG_NORMAL)
+ {
+	throw_onig_error (status, &err_info);
+	SLang_free_slstring ((char *)pattern);
+	free_onig_type (o);
+	return;
+ }
+
+ if (NULL == (o->region = onig_region_new ()))
+ {
+	SLang_verror (slOnig_Error, "failed to allocate a region");
+	SLang_free_slstring ((char *)pattern);
+	free_onig_type (o);
+	return;
+ }
+
+ SLang_free_slstring ((char *)pattern);
+ (void) push_onig_type (o);	 /* frees it */
+}
+
+static int do_onig_search_internal (Onig_Type *o, OnigOptionType option, UChar *str, UChar *str_end, int start_pos, int end_pos)
+{
+ UChar *start, *range;
+ int status;
+
+ onig_region_clear (o->region);
+
+ start = str + start_pos;
+ range = str + end_pos;
+ /* fwd search: (start <= search string < range)
+ * bkw search: (range <= search string <= start)
+ */
+ if ((start < str) || (start > str_end)
+ || (range < str) || (range > str_end))
+ {
+	SLang_verror (SL_InvalidParm_Error, "Invalid string offsets");
+	return -1;
+ }
+ status = onig_search (o->re, str, str_end, start, range, o->region, option);
+
+ if (status >= 0)
+ return status;
+
+ if (status == ONIG_MISMATCH)
+ return -1;
+
+ throw_onig_error (status, NULL);
+ return -2;
+}
+
+/* Usage: onig_search (o, str start, end ,option) */
+static int do_onig_search (void)
+{
+ int start_pos = 0, end_pos = -1;
+ char *str, *str_end;
+ SLang_BString_Type *bstr = NULL;
+ Onig_Type *o;
+ SLang_MMT_Type *mmt;
+ int status = -1;
+ OnigOptionType option = ONIG_OPTION_NONE;
+
+ switch (SLang_Num_Function_Args)
+ {
+ default:
+	SLang_verror (SL_Usage_Error, "Usage: n = onig_search (compiled_pattern, str ,start_ofs, end_ofs ,option)");
+	return -1;
+
+ case 5:
+	if (-1 == pop_onig_option (&option))
+	 return -1;
+	/* drop */
+ case 4:
+	if (-1 == SLang_pop_int (&end_pos))
+	 return -1;
+	if (-1 == SLang_pop_int (&start_pos))
+	 return -1;
+	break;
+ case 3:
+	if (-1 == pop_onig_option (&option))
+	 return -1;
+	if (option & ~(ONIG_OPTION_NOTBOL|ONIG_OPTION_NOTEOL))
+	 {
+	 SLang_verror (SL_InvalidParm_Error, "onig_search: invalid option flags");
+	 return -1;
+	 }
+	break;
+ case 2:
+	 break;
+ }
+
+ switch(SLang_peek_at_stack())
+ {
+ case SLANG_STRING_TYPE:
+	if (-1 == SLang_pop_slstring (&str))
+	 return -1;
+	str_end = str + strlen (str);
+	break;
+
+ case SLANG_BSTRING_TYPE:
+ default:
+	 {
+	 SLstrlen_Type len;
+
+	 if (-1 == SLang_pop_bstring(&bstr))
+	 return -1;
+
+	 str = (char *)SLbstring_get_pointer(bstr, &len);
+	 if (str == NULL)
+	 {
+		 SLbstring_free (bstr);
+		 return -1;
+	 }
+	 str_end = str + len;
+	 }
+	break;
+ }
+
+ if (end_pos < 0)
+ end_pos = (int) (str_end - str);
+
+ if (NULL == (mmt = SLang_pop_mmt (Onig_Type_Id)))
+ goto free_and_return;
+ o = (Onig_Type *)SLang_object_from_mmt (mmt);
+
+ status = do_onig_search_internal (o, option, (UChar *)str, (UChar *)str_end, start_pos, end_pos);
+ if (status >= 0)
+ {
+	o->match_pos = status;
+	status = o->region->num_regs;
+	goto free_and_return;
+ }
+ o->match_pos = -1;
+
+ if (status == -1)
+ {				 /* no match */
+	status = 0;
+	goto free_and_return;
+ }
+
+ /* Else an error occurred */
+ /* drop */
+
+free_and_return:
+
+ SLang_free_mmt (mmt);
+ if (bstr != NULL)
+ SLbstring_free (bstr);
+ else
+ SLang_free_slstring (str);
+
+ return status;
+}
+
+static int get_nth_start_stop (Onig_Type *o, unsigned int n,
+			 SLstrlen_Type *a, SLstrlen_Type *b)
+{
+ if (o->match_pos < 0)
+ {
+	SLang_verror (SL_InvalidParm_Error, "The last match was unsuccessful");
+	return -1;
+ }
+ if (n >= (unsigned int) o->region->num_regs)
+ return -1;
+
+ *a = (SLstrlen_Type) o->region->begn;
+ *b = (SLstrlen_Type) o->region->endn;
+ return 0;
+}
+
+static void nth_match (Onig_Type *o, int *np)
+{
+ SLstrlen_Type start, stop;
+ SLang_Array_Type *at;
+ SLindex_Type two = 2;
+ int *data;
+
+ if (-1 == get_nth_start_stop (o, (unsigned int) *np, &start, &stop))
+ {
+	SLang_push_null ();
+	return;
+ }
+
+ if (NULL == (at = SLang_create_array (SLANG_INT_TYPE, 0, NULL, &two, 1)))
+ return;
+
+ data = (int *)at->data;
+ data0 = (int)start;
+ data1 = (int)stop;
+ (void) SLang_push_array (at, 1);
+}
+
+static void nth_substr (Onig_Type *o, char *str, int *np)
+{
+ SLstrlen_Type start, stop;
+ SLstrlen_Type len;
+
+ len = strlen (str);
+
+ if ((-1 == get_nth_start_stop (o, (unsigned int) *np, &start, &stop))
+ || (start > len) || (stop > len))
+ {
+	SLang_push_null ();
+	return;
+ }
+
+ str = SLang_create_nslstring (str + start, stop - start);
+ (void) SLang_push_string (str);
+ SLang_free_slstring (str);
+}
+
+static SLang_Name_Type *Warn_Func;
+static SLang_Name_Type *Verb_Warn_Func;
+
+static void warn_func (const char *msg)
+{
+ if (Warn_Func != NULL)
+ {
+	if (0 == SLang_push_string ((char *) msg))
+	 SLexecute_function (Warn_Func);
+ }
+}
+
+static void verb_warn_func (const char *msg)
+{
+ if (Verb_Warn_Func != NULL)
+ {
+	if (0 == SLang_push_string ((char *) msg))
+	 SLexecute_function (Verb_Warn_Func);
+ }
+}
+
+static void set_warn_func (void)
+{
+ SLang_Name_Type *sf;
+
+ if (NULL == (sf = SLang_pop_function ()))
+ return;
+
+ if (Warn_Func != NULL)
+ SLang_free_function (Warn_Func);
+
+ Warn_Func = sf;
+}
+
+static void set_verb_warn_func (void)
+{
+ SLang_Name_Type *sf;
+
+ if (NULL == (sf = SLang_pop_function ()))
+ return;
+
+ if (Verb_Warn_Func != NULL)
+ SLang_free_function (Verb_Warn_Func);
+
+ Verb_Warn_Func = sf;
+}
+
+static char *do_onig_version (void)
+{
+ return (char *)onig_version ();
+}
+
+static void get_encodings (void)
+{
+ get_onig_names ((Name_Map_Type *)Encoding_Table_Map);
+}
+
+static void get_syntaxes (void)
+{
+ get_onig_names ((Name_Map_Type *) Syntax_Table_Map);
+}
+
+static SLang_IConstant_Type Onig_Consts =
+{
+ MAKE_ICONSTANT ("ONIG_OPTION_DEFAULT", ONIG_OPTION_DEFAULT),
+ MAKE_ICONSTANT ("ONIG_OPTION_NONE", ONIG_OPTION_NONE),
+ MAKE_ICONSTANT ("ONIG_OPTION_SINGLELINE", ONIG_OPTION_SINGLELINE),
+ MAKE_ICONSTANT ("ONIG_OPTION_MULTILINE", ONIG_OPTION_MULTILINE),
+ MAKE_ICONSTANT ("ONIG_OPTION_IGNORECASE", ONIG_OPTION_IGNORECASE),
+ MAKE_ICONSTANT ("ONIG_OPTION_EXTEND", ONIG_OPTION_EXTEND),
+ MAKE_ICONSTANT ("ONIG_OPTION_FIND_LONGEST", ONIG_OPTION_FIND_LONGEST),
+ MAKE_ICONSTANT ("ONIG_OPTION_FIND_NOT_EMPTY", ONIG_OPTION_FIND_NOT_EMPTY),
+ MAKE_ICONSTANT ("ONIG_OPTION_NEGATE_SINGLELINE", ONIG_OPTION_NEGATE_SINGLELINE),
+ MAKE_ICONSTANT ("ONIG_OPTION_DONT_CAPTURE_GROUP", ONIG_OPTION_DONT_CAPTURE_GROUP),
+ MAKE_ICONSTANT ("ONIG_OPTION_CAPTURE_GROUP", ONIG_OPTION_CAPTURE_GROUP),
+
+ MAKE_ICONSTANT ("ONIG_OPTION_NOTBOL", ONIG_OPTION_NOTBOL),
+ MAKE_ICONSTANT ("ONIG_OPTION_NOTEOL", ONIG_OPTION_NOTEOL),
+
+ SLANG_END_ICONST_TABLE
+};
+
+#define DUMMY_ONIG_TYPE 0
+#define O DUMMY_ONIG_TYPE
+#define I SLANG_INT_TYPE
+#define V SLANG_VOID_TYPE
+#define S SLANG_STRING_TYPE
+static SLang_Intrin_Fun_Type Onig_Intrinsics =
+{
+ MAKE_INTRINSIC_0("onig_version", do_onig_version, S),
+ MAKE_INTRINSIC_0("onig_new", do_onig_new, V),
+ MAKE_INTRINSIC_0("onig_search", do_onig_search, I),
+ MAKE_INTRINSIC_2("onig_nth_match", nth_match, V, O, I),
+ MAKE_INTRINSIC_3("onig_nth_substr", nth_substr, V, O, S, I),
+ MAKE_INTRINSIC_0("onig_set_warn_func", set_warn_func, V),
+ MAKE_INTRINSIC_0("onig_set_verb_warn_func", set_verb_warn_func, V),
+ MAKE_INTRINSIC_0("onig_get_encodings", get_encodings, V),
+ MAKE_INTRINSIC_0("onig_get_syntaxes", get_syntaxes, V),
+ /* MAKE_INTRINSIC_1("slang_to_pcre", slang_to_pcre, V, S), */
+ SLANG_END_INTRIN_FUN_TABLE
+};
+#undef V
+#undef S
+#undef I
+#undef O
+
+static void destroy_onig (SLtype type, VOID_STAR f)
+{
+ (void) type;
+
+ free_onig_type ((Onig_Type *)f);
+}
+
+static int register_onig_type (void)
+{
+ SLang_Class_Type *cl;
+
+ if (Onig_Type_Id != 0)
+ return 0;
+
+ if (NULL == (cl = SLclass_allocate_class ("Onig_Type")))
+ return -1;
+
+ if (-1 == SLclass_set_destroy_function (cl, destroy_onig))
+ return -1;
+
+ /* By registering as SLANG_VOID_TYPE, slang will dynamically allocate a
+ * type.
+ */
+ if (-1 == SLclass_register_class (cl, SLANG_VOID_TYPE, sizeof (Onig_Type), SLANG_CLASS_TYPE_MMT))
+ return -1;
+
+ Onig_Type_Id = SLclass_get_class_id (cl);
+
+ if (-1 == SLclass_patch_intrin_fun_table1 (Onig_Intrinsics, DUMMY_ONIG_TYPE, Onig_Type_Id))
+ return -1;
+
+ return 0;
+}
+
+static int setup_onig (void)
+{
+ static int inited = 0;
+
+ if (inited)
+ return 0;
+
+ if ((-1 == slOnig_Error)
+ && (-1 == (slOnig_Error = SLerr_new_exception (SL_RunTime_Error, "OnigError", "Onig Error"))))
+ return -1;
+
+ if (-1 == onig_init ())
+ {
+	SLang_verror (slOnig_Error, "onig_init failed");
+	return -1;
+ }
+
+ onig_set_warn_func (&warn_func);
+ onig_set_verb_warn_func (&verb_warn_func);
+ onig_set_default_syntax (ONIG_SYNTAX_PERL);
+
+ inited = 1;
+
+ return 0;
+}
+
+int init_onig_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if (-1 == setup_onig ())
+ return -1;
+ if (-1 == register_onig_type ())
+ return -1;
+
+ if ((-1 == SLns_add_intrin_fun_table (ns, Onig_Intrinsics, "__ONIG__"))
+ || (-1 == SLns_add_iconstant_table (ns, Onig_Consts, NULL)))
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_onig_module (void)
+{
+ (void) onig_end ();
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/onig.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/pcre-module.c Added

@@ -0,0 +1,645 @@
+/* -*- mode: C; mode: fold -*-
+Copyright (C) 2010-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include "config.h"
+
+#include <stdio.h>
+#include <slang.h>
+#include <string.h>
+#include <pcre.h>
+
+SLANG_MODULE(pcre);
+
+static int PCRE_Type_Id = 0;
+
+typedef struct
+{
+ pcre *p;
+ pcre_extra *extra;
+ int *ovector;
+ unsigned int ovector_len;	 /* must be a multiple of 3 */
+ unsigned int num_matches;	 /* return value of pcre_exec (>= 1)*/
+}
+PCRE_Type;
+
+static void free_pcre_type (PCRE_Type *pt)
+{
+ if (pt->ovector != NULL)
+ SLfree ((char *) pt->ovector);
+
+ SLfree ((char *) pt);
+}
+
+static SLang_MMT_Type *allocate_pcre_type (pcre *p, pcre_extra *extra)
+{
+ PCRE_Type *pt;
+ SLang_MMT_Type *mmt;
+ int ovector_len;
+
+ pt = (PCRE_Type *) SLmalloc (sizeof (PCRE_Type));
+ if (pt == NULL)
+ return NULL;
+ memset ((char *) pt, 0, sizeof (PCRE_Type));
+
+ pt->p = p;
+ pt->extra = extra;
+
+ if (0 != pcre_fullinfo (p, extra, PCRE_INFO_CAPTURECOUNT, &ovector_len))
+ {
+	free_pcre_type (pt);
+	SLang_verror (SL_INTRINSIC_ERROR, "pcre_fullinfo failed");
+	return NULL;
+ }
+
+ ovector_len += 1;		 /* allow for pattern matched */
+ ovector_len *= 3;		 /* required to be multiple of 3 */
+ if (NULL == (pt->ovector = (int *)SLmalloc (ovector_len * sizeof (int))))
+ {
+	free_pcre_type (pt);
+	return NULL;
+ }
+ pt->ovector_len = ovector_len;
+
+ if (NULL == (mmt = SLang_create_mmt (PCRE_Type_Id, (VOID_STAR) pt)))
+ {
+	free_pcre_type (pt);
+	return NULL;
+ }
+ return mmt;
+}
+
+static int _pcre_compile_1 (char *pattern, int options)
+{
+ pcre *p;
+ pcre_extra *extra;
+ SLCONST char *err;
+ int erroffset;
+ unsigned char *table;
+ SLang_MMT_Type *mmt;
+
+ table = NULL;
+ p = pcre_compile (pattern, options, &err, &erroffset, table);
+ if (NULL == p)
+ {
+	SLang_verror (SL_Parse_Error, "Error compiling pattern '%s' at offset %d: %s",
+		 pattern, erroffset, err);
+	return -1;
+ }
+
+ extra = pcre_study (p, 0, &err);
+ /* apparantly, a NULL return is ok */
+ if (err != NULL)
+ {
+	SLang_verror (SL_INTRINSIC_ERROR, "pcre_study failed: %s", err);
+	pcre_free (p);
+	return -1;
+ }
+
+ if (NULL == (mmt = allocate_pcre_type (p, extra)))
+ {
+	pcre_free ((char *) p);
+	pcre_free ((char *) extra);
+	return -1;
+ }
+
+ if (-1 == SLang_push_mmt (mmt))
+ {
+	SLang_free_mmt (mmt);
+	return -1;
+ }
+ return 0;
+}
+
+static void _pcre_compile (void)
+{
+ char *pattern;
+ int options = 0;
+
+ switch (SLang_Num_Function_Args)
+ {
+ case 2:
+	if (-1 == SLang_pop_integer (&options))
+	 return;
+	/* drop */
+ case 1:
+ default:
+	if (-1 == SLang_pop_slstring (&pattern))
+	 return;
+ }
+ (void) _pcre_compile_1 (pattern, options);
+ SLang_free_slstring (pattern);
+}
+
+/* returns number of matches */
+static int _pcre_exec_1 (PCRE_Type *pt, char *str, unsigned int len, int pos, int options)
+{
+ int rc;
+
+ pt->num_matches = 0;
+ if ((unsigned int) pos > len)
+ return 0;
+
+ rc = pcre_exec (pt->p, pt->extra, str, len, pos,
+		 options, pt->ovector, pt->ovector_len);
+
+ if (rc == PCRE_ERROR_NOMATCH)
+ return 0;
+
+ if (rc <= 0)
+ {
+	SLang_verror (SL_INTRINSIC_ERROR, "pcre_exec returned %d", rc);
+	return -1;
+ }
+ pt->num_matches = (unsigned int) rc;
+ return rc;
+}
+
+static int _pcre_exec (void)
+{
+ PCRE_Type *p;
+ SLang_MMT_Type *mmt;
+ char *str;
+ SLang_BString_Type *bstr = NULL;
+ SLstrlen_Type len;
+ int pos = 0;
+ int options = 0;
+ int ret = -1;
+
+ switch (SLang_Num_Function_Args)
+ {
+ case 4:
+	if (-1 == SLang_pop_integer (&options))
+	 return -1;
+	/* drop */
+ case 3:
+	/* drop */
+	if (-1 == SLang_pop_integer (&pos))
+	 return -1;
+	/* drop */
+ default:
+	switch (SLang_peek_at_stack())
+	 {
+	 case SLANG_STRING_TYPE:
+	 if (-1 == SLang_pop_slstring (&str))
+	 return -1;
+	 len = strlen (str);
+	 break;
+
+	 case SLANG_BSTRING_TYPE:
+	 default:
+	 if (-1 == SLang_pop_bstring(&bstr))
+	 return -1;
+	 str = (char *)SLbstring_get_pointer(bstr, &len);
+	 if (str == NULL)
+	 {
+		 SLbstring_free (bstr);
+		 return -1;
+	 }
+	 break;
+	 }
+ }
+
+ if (NULL == (mmt = SLang_pop_mmt (PCRE_Type_Id)))
+ goto free_and_return;
+ p = (PCRE_Type *)SLang_object_from_mmt (mmt);
+
+ ret = _pcre_exec_1 (p, str, len, pos, options);
+
+free_and_return:
+
+ SLang_free_mmt (mmt);
+ if (bstr != NULL)
+ SLbstring_free (bstr);
+ else
+ SLang_free_slstring (str);
+ return ret;
+}
+
+static int get_nth_start_stop (PCRE_Type *pt, unsigned int n,
+			 SLstrlen_Type *a, SLstrlen_Type *b)
+{
+ int start, stop;
+
+ if (n >= pt->num_matches)
+ return -1;
+
+ start = pt->ovector2*n;
+ stop = pt->ovector2*n+1;
+ if ((start < 0) || (stop < start))
+ return -1;
+
+ *a = (unsigned int) start;
+ *b = (unsigned int) stop;
+ return 0;
+}
+
+static void _pcre_nth_match (PCRE_Type *pt, int *np)
+{
+ SLuindex_Type start, stop;
+ SLang_Array_Type *at;
+ SLindex_Type two = 2;
+ int *data;
+
+ if (-1 == get_nth_start_stop (pt, (unsigned int) *np, &start, &stop))
+ {
+	SLang_push_null ();
+	return;
+ }
+
+ if (NULL == (at = SLang_create_array (SLANG_INT_TYPE, 0, NULL, &two, 1)))
+ return;
+
+ data = (int *)at->data;
+ data0 = (int)start;
+ data1 = (int)stop;
+ (void) SLang_push_array (at, 1);
+}
+
+static void _pcre_nth_substr (PCRE_Type *pt, char *str, int *np)
+{
+ SLstrlen_Type start, stop;
+ SLstrlen_Type len;
+
+ len = strlen (str);
+
+ if ((-1 == get_nth_start_stop (pt, (unsigned int) *np, &start, &stop))
+ || (start > len) || (stop > len))
+ {
+	SLang_push_null ();
+	return;
+ }
+
+ str = SLang_create_nslstring (str + start, stop - start);
+ (void) SLang_push_string (str);
+ SLang_free_slstring (str);
+}
+
+/* This function converts a slang RE to a pcre expression. It performs the
+ * following transformations:
+ * ( --> $
+ * ) --> $
+ * # --> \#
+ * | --> \|
+ * { --> \{
+ * } --> \}
+ * \< --> \b
+ * \> --> \b
+ * \C --> (?i)
+ * \c --> (?-i)
+ * $ --> (
+ * $ --> )
+ * \{ --> {
+ * \} --> }
+ * Anything else?
+ */
+static char *_slang_to_pcre (char *slpattern)
+{
+ char *pattern, *p, *s;
+ SLstrlen_Type len;
+ int in_bracket;
+ char ch;
+
+ len = strlen (slpattern);
+ pattern = (char *)SLmalloc (3*len + 1);
+ if (pattern == NULL)
+ return NULL;
+
+ p = pattern;
+ s = slpattern;
+ in_bracket = 0;
+ while ((ch = *s++) != 0)
+ {
+	switch (ch)
+	 {
+	 case '{':
+	 case '}':
+	 case '(':
+	 case ')':
+	 case '#':
+	 case '|':
+	 if (0 == in_bracket) *p++ = '\\';
+	 *p++ = ch;
+	 break;
+
+	 case '':
+	 in_bracket = 1;
+	 *p++ = ch;
+	 break;
+
+	 case '':
+	 in_bracket = 0;
+	 *p++ = ch;
+	 break;
+
+	 case '\\':
+	 ch = *s++;
+	 switch (ch)
+	 {
+		case 0:
+		 s--;
+		 break;
+
+		case '<':
+		case '>':
+		 *p++ = '\\'; *p++ = 'b';
+		 break;
+
+		case '(':
+		case ')':
+		case '{':
+		case '}':
+		 *p++ = ch;
+		 break;
+
+		case 'C':
+		 *p++ = '('; *p++ = '?'; *p++ = 'i'; *p++ = ')';
+		 break;
+		case 'c':
+		 *p++ = '('; *p++ = '?'; *p++ = '-'; *p++ = 'i'; *p++ = ')';
+		 break;
+
+		default:
+		 *p++ = '\\';
+		 *p++ = ch;
+	 }
+	 break;
+
+	 default:
+	 *p++ = ch;
+	 break;
+	 }
+ }
+ *p = 0;
+
+ s = SLang_create_slstring (pattern);
+ SLfree (pattern);
+ return s;
+}
+
+static void slang_to_pcre (char *pattern)
+{
+ /* NULL ok in code below */
+ pattern = _slang_to_pcre (pattern);
+ (void) SLang_push_string (pattern);
+ SLang_free_slstring (pattern);
+}
+
+static void destroy_pcre (SLtype type, VOID_STAR f)
+{
+ PCRE_Type *pt;
+ (void) type;
+
+ pt = (PCRE_Type *) f;
+ if (pt->extra != NULL)
+ pcre_free ((char *) pt->extra);
+ if (pt->p != NULL)
+ pcre_free ((char *) pt->p);
+ free_pcre_type (pt);
+}
+
+#define DUMMY_PCRE_TYPE ((SLtype)-1)
+#define P DUMMY_PCRE_TYPE
+#define I SLANG_INT_TYPE
+#define V SLANG_VOID_TYPE
+#define S SLANG_STRING_TYPE
+static SLang_Intrin_Fun_Type PCRE_Intrinsics =
+{
+ MAKE_INTRINSIC_0("pcre_exec", _pcre_exec, I),
+ MAKE_INTRINSIC_0("pcre_compile", _pcre_compile, V),
+ MAKE_INTRINSIC_2("pcre_nth_match", _pcre_nth_match, V, P, I),
+ MAKE_INTRINSIC_3("pcre_nth_substr", _pcre_nth_substr, V, P, S, I),
+ MAKE_INTRINSIC_1("slang_to_pcre", slang_to_pcre, V, S),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static SLang_IConstant_Type PCRE_Consts =
+{
+ /* compile options */
+#ifndef PCRE_ANCHORED
+# define PCRE_ANCHORED 0
+#endif
+ MAKE_ICONSTANT("PCRE_ANCHORED", PCRE_ANCHORED),
+#ifndef PCRE_AUTO_CALLOUT
+# define PCRE_AUTO_CALLOUT 0
+#endif
+ MAKE_ICONSTANT("PCRE_AUTO_CALLOUT", PCRE_AUTO_CALLOUT),
+#ifndef PCRE_BSR_ANYCRLF
+# define PCRE_BSR_ANYCRLF 0
+#endif
+ MAKE_ICONSTANT("PCRE_BSR_ANYCRLF", PCRE_BSR_ANYCRLF),
+#ifndef PCRE_BSR_UNICODE
+# define PCRE_BSR_UNICODE 0
+#endif
+ MAKE_ICONSTANT("PCRE_BSR_UNICODE", PCRE_BSR_UNICODE),
+#ifndef PCRE_CASELESS
+# define PCRE_CASELESS 0
+#endif
+ MAKE_ICONSTANT("PCRE_CASELESS", PCRE_CASELESS),
+#ifndef PCRE_DUPNAMES
+# define PCRE_DUPNAMES 0
+#endif
+ MAKE_ICONSTANT("PCRE_DUPNAMES", PCRE_DUPNAMES),
+#ifndef PCRE_DOLLAR_ENDONLY
+# define PCRE_DOLLAR_ENDONLY 0
+#endif
+ MAKE_ICONSTANT("PCRE_DOLLAR_ENDONLY", PCRE_DOLLAR_ENDONLY),
+#ifndef PCRE_DOTALL
+# define PCRE_DOTALL 0
+#endif
+ MAKE_ICONSTANT("PCRE_DOTALL", PCRE_DOTALL),
+#ifndef PCRE_EXTENDED
+# define PCRE_EXTENDED 0
+#endif
+ MAKE_ICONSTANT("PCRE_EXTENDED", PCRE_EXTENDED),
+#ifndef PCRE_EXTRA
+# define PCRE_EXTRA 0
+#endif
+ MAKE_ICONSTANT("PCRE_EXTRA", PCRE_EXTRA),
+#ifndef PCRE_FIRSTLINE
+# define PCRE_FIRSTLINE 0
+#endif
+ MAKE_ICONSTANT("PCRE_FIRSTLINE", PCRE_FIRSTLINE),
+#ifndef PCRE_JAVASCRIPT_COMPAT
+# define PCRE_JAVASCRIPT_COMPAT 0
+#endif
+ MAKE_ICONSTANT("PCRE_JAVASCRIPT_COMPAT", PCRE_JAVASCRIPT_COMPAT),
+#ifndef PCRE_MULTILINE
+# define PCRE_MULTILINE 0
+#endif
+ MAKE_ICONSTANT("PCRE_MULTILINE", PCRE_MULTILINE),
+#ifndef PCRE_NEVER_UTF
+# define PCRE_NEVER_UTF 0
+#endif
+ MAKE_ICONSTANT("PCRE_NEVER_UTF", PCRE_NEVER_UTF),
+#ifndef PCRE_NEWLINE_ANY
+# define PCRE_NEWLINE_ANY 0
+#endif
+ MAKE_ICONSTANT("PCRE_NEWLINE_ANY", PCRE_NEWLINE_ANY),
+#ifndef PCRE_NEWLINE_ANYCRLF
+# define PCRE_NEWLINE_ANYCRLF 0
+#endif
+ MAKE_ICONSTANT("PCRE_NEWLINE_ANYCRLF", PCRE_NEWLINE_ANYCRLF),
+#ifndef PCRE_NEWLINE_CR
+# define PCRE_NEWLINE_CR 0
+#endif
+ MAKE_ICONSTANT("PCRE_NEWLINE_CR", PCRE_NEWLINE_CR),
+#ifndef PCRE_NEWLINE_CRLF
+# define PCRE_NEWLINE_CRLF 0
+#endif
+ MAKE_ICONSTANT("PCRE_NEWLINE_CRLF", PCRE_NEWLINE_CRLF),
+#ifndef PCRE_NEWLINE_LF
+# define PCRE_NEWLINE_LF 0
+#endif
+ MAKE_ICONSTANT("PCRE_NEWLINE_LF", PCRE_NEWLINE_LF),
+#ifndef PCRE_NO_START_OPTIMIZE
+# define PCRE_NO_START_OPTIMIZE 0
+#endif
+ MAKE_ICONSTANT("PCRE_NO_START_OPTIMIZE", PCRE_NO_START_OPTIMIZE),
+#ifndef PCRE_NOTEMPTY
+# define PCRE_NOTEMPTY 0
+#endif
+ MAKE_ICONSTANT("PCRE_NOTEMPTY", PCRE_NOTEMPTY),
+#ifndef PCRE_NO_AUTO_CAPTURE
+# define PCRE_NO_AUTO_CAPTURE 0
+#endif
+ MAKE_ICONSTANT("PCRE_NO_AUTO_CAPTURE", PCRE_NO_AUTO_CAPTURE),
+#ifndef PCRE_NO_AUTO_POSSESS
+# define PCRE_NO_AUTO_POSSESS 0
+#endif
+ MAKE_ICONSTANT("PCRE_NO_AUTO_POSSESS", PCRE_NO_AUTO_POSSESS),
+#ifndef PCRE_NO_UTF8_CHECK
+# define PCRE_NO_UTF8_CHECK 0
+#endif
+ MAKE_ICONSTANT("PCRE_NO_UTF8_CHECK", PCRE_NO_UTF8_CHECK),
+#ifndef PCRE_UCP
+# define PCRE_UCP 0
+#endif
+ MAKE_ICONSTANT("PCRE_UCP", PCRE_UCP),
+#ifndef PCRE_UNGREEDY
+# define PCRE_UNGREEDY 0
+#endif
+ MAKE_ICONSTANT("PCRE_UNGREEDY", PCRE_UNGREEDY),
+#ifndef PCRE_UTF8
+# define PCRE_UTF8 0
+#endif
+ MAKE_ICONSTANT("PCRE_UTF8", PCRE_UTF8),
+
+ /* exec options */
+#ifndef PCRE_NOTBOL
+# define PCRE_NOTBOL 0
+#endif
+ MAKE_ICONSTANT("PCRE_NOTBOL", PCRE_NOTBOL),
+#ifndef PCRE_NOTEOL
+# define PCRE_NOTEOL 0
+#endif
+ MAKE_ICONSTANT("PCRE_NOTEOL", PCRE_NOTEOL),
+#ifndef PCRE_NOTEMPTY
+# define PCRE_NOTEMPTY 0
+#endif
+ MAKE_ICONSTANT("PCRE_NOTEMPTY", PCRE_NOTEMPTY),
+#ifndef PCRE_PARTIAL_SOFT
+# define PCRE_PARTIAL_SOFT 0
+#endif
+ MAKE_ICONSTANT("PCRE_PARTIAL_SOFT", PCRE_PARTIAL_SOFT),
+#ifndef PCRE_DFA_SHORTEST
+# define PCRE_DFA_SHORTEST 0
+#endif
+ MAKE_ICONSTANT("PCRE_DFA_SHORTEST", PCRE_DFA_SHORTEST),
+#ifndef PCRE_DFA_RESTART
+# define PCRE_DFA_RESTART 0
+#endif
+ MAKE_ICONSTANT("PCRE_DFA_RESTART", PCRE_DFA_RESTART),
+#ifndef PCRE_PARTIAL_HARD
+# define PCRE_PARTIAL_HARD 0
+#endif
+ MAKE_ICONSTANT("PCRE_PARTIAL_HARD", PCRE_PARTIAL_HARD),
+#ifndef PCRE_NOTEMPTY_ATSTART
+# define PCRE_NOTEMPTY_ATSTART 0
+#endif
+ MAKE_ICONSTANT("PCRE_NOTEMPTY_ATSTART", PCRE_NOTEMPTY_ATSTART),
+
+ SLANG_END_ICONST_TABLE
+};
+
+#undef P
+#undef I
+#undef V
+#undef S
+
+static int register_pcre_type (void)
+{
+ SLang_Class_Type *cl;
+
+ if (PCRE_Type_Id != 0)
+ return 0;
+
+ if (NULL == (cl = SLclass_allocate_class ("PCRE_Type")))
+ return -1;
+
+ if (-1 == SLclass_set_destroy_function (cl, destroy_pcre))
+ return -1;
+
+ /* By registering as SLANG_VOID_TYPE, slang will dynamically allocate a
+ * type.
+ */
+ if (-1 == SLclass_register_class (cl, SLANG_VOID_TYPE, sizeof (PCRE_Type), SLANG_CLASS_TYPE_MMT))
+ return -1;
+
+ PCRE_Type_Id = SLclass_get_class_id (cl);
+ if (-1 == SLclass_patch_intrin_fun_table1 (PCRE_Intrinsics, DUMMY_PCRE_TYPE, PCRE_Type_Id))
+ return -1;
+
+ return 0;
+}
+
+static void *do_malloc (size_t n)
+{
+ return (void *) SLmalloc (n);
+}
+
+static void do_free (void *x)
+{
+ SLfree ((char *) x);
+}
+
+int init_pcre_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if (-1 == register_pcre_type ())
+ return -1;
+
+ pcre_malloc = do_malloc;
+ pcre_free = do_free;
+
+ if ((-1 == SLns_add_intrin_fun_table (ns, PCRE_Intrinsics, "__PCRE__"))
+ || (-1 == SLns_add_iconstant_table (ns, PCRE_Consts, NULL)))
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_pcre_module (void)
+{
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/pcre.sl Added

@@ -0,0 +1,48 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+import("pcre");
+
+define pcre_matches ()
+{
+ variable nargs = _NARGS;
+ if (nargs < 2)
+ usage ("\
+strings = pcre_matches (regexp, str ,pcre_exec_options)\n\
+Qualifiers:\n\
+ options=0 pcre_compile options if regexp is a string\n\
+ offset=0 pcre_exec start matching offset in bytes\n\
+";
+	 );
+ variable re, str, options;
+ if (nargs == 2)
+ 0;
+ (re, str, options) = ();
+ variable pos = qualifier ("offset", 0);
+ if (typeof (re) != PCRE_Type)
+ {
+	variable compile_options = qualifier ("options", 0);
+	re = pcre_compile (re, options);
+ }
+
+ variable n = pcre_exec (re, str, pos, options);
+ if (n == 0)
+ return NULL;
+
+ variable matches = String_Typen;
+ _for (0, n-1, 1)
+ {
+	variable i = ();
+	matchesi = pcre_nth_substr (re, str, i);
+ }
+ return matches;
+}
+
+$1 = path_concat (path_dirname (__FILE__), "help/pcrefuns.hlp");
+if (NULL != stat_file ($1))
+ add_doc_file ($1);
+
+provide("pcre");

_service:tar_scm:slang-2.3.2.tar.bz2/modules/png-module.c Added

@@ -0,0 +1,798 @@
+/* -*- mode: C; mode: fold; -*- */
+/*
+Copyright (C) 2005-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "config.h"
+
+#include <stdio.h>
+#include <string.h>
+#include <errno.h>
+#include <slang.h>
+
+#include <png.h>
+
+SLANG_MODULE(png);
+
+static SLFUTURE_CONST char *Module_Version_String = "0.2.0";
+#define MODULE_VERSION_NUMBER (0*10000 + 2*100 + 0)
+
+/*{{{ Byte-swapping routines */
+
+static int Is_Little_Endian;
+
+static void byte_swap32 (unsigned char *p, unsigned char *t, SLuindex_Type n)
+{
+ unsigned char *pmax;
+
+ /* t and p could point to the same buffer */
+ pmax = p + 4 * n;
+ while (p < pmax)
+ {
+	unsigned char ch = *p;
+	*t = *(p + 3);
+	*(t + 3) = ch;
+
+	ch = *(p + 1);
+	*(t + 1) = *(p + 2);
+	*(t + 2) = ch;
+	p += 4;
+	t += 4;
+ }
+}
+
+static void byte_swap16 (unsigned char *p, unsigned char *t, SLuindex_Type n)
+{
+ unsigned char *pmax;
+
+ pmax = p + 2 * n;
+ while (p < pmax)
+ {
+	unsigned char ch = *p;
+	*t = *(p + 1);
+	*(t + 1) = ch;
+	p += 2;
+	t += 2;
+ }
+}
+
+/*}}}*/
+
+/*{{{ Png_Type */
+
+typedef struct
+{
+ FILE *fp;
+ int mode;			 /* 'r' or 'w' */
+ png_struct *png;
+ png_info *info;
+}
+Png_Type;
+
+static void free_png_type (Png_Type *p)
+{
+ if (p == NULL)
+ return;
+ if (p->png != NULL)
+ {
+	if (p->mode == 'r')
+	 {
+	 if (p->info != NULL)
+	 png_destroy_read_struct (&p->png, &p->info, NULL);
+	 else
+	 png_destroy_read_struct (&p->png, NULL, NULL);
+	 }
+	else
+	 {
+	 if (p->info != NULL)
+	 png_destroy_write_struct (&p->png, &p->info);
+	 else
+	 png_destroy_write_struct (&p->png, NULL);
+	 }
+ }
+
+ if (p->fp != NULL)
+ fclose (p->fp);
+
+ SLfree ((char *) p);
+}
+
+static Png_Type *alloc_png_type (int mode)
+{
+ Png_Type *p;
+
+ if (NULL != (p = (Png_Type *)SLmalloc (sizeof (Png_Type))))
+ {
+	memset ((char *) p, 0, sizeof (Png_Type));
+	p->mode = mode;
+ }
+ return p;
+}
+
+/*}}}*/
+
+static png_byte **allocate_image_pointers (png_uint_32 height, png_byte *data, png_uint_32 rowbytes, int flip)
+{
+ png_byte **image_pointers;
+ png_uint_32 i;
+
+ if (NULL == (image_pointers = (png_byte **) SLmalloc (height * sizeof (png_byte *))))
+ return NULL;
+
+ if (flip)
+ {
+	i = height;
+	while (i != 0)
+	 {
+	 i--;
+	 image_pointersi = data;
+	 data += rowbytes;
+	 }
+	return image_pointers;
+ }
+ for (i = 0; i < height; i++)
+ {
+	image_pointersi = data;
+	data += rowbytes;
+ }
+ return image_pointers;
+}
+
+static void free_image_pointers (png_byte **image_pointers)
+{
+ if (image_pointers == NULL)
+ return;
+
+ SLfree ((char *) image_pointers);
+}
+
+/*{{{ png read functions */
+
+static Png_Type *open_png_file (char *file)
+{
+ png_byte header8;
+ Png_Type *p;
+
+ if (NULL == (p = alloc_png_type ('r')))
+ return NULL;
+
+ if ((NULL == (p->fp = fopen (file, "rb")))
+ || (8 != fread (header, 1, 8, p->fp))
+ || (0 != png_sig_cmp(header, 0, 8)))
+ {
+	SLang_verror (SL_Open_Error, "Unable to open %s as a png file", file);
+	free_png_type (p);
+	return NULL;
+ }
+
+ if (NULL == (p->png = png_create_read_struct (PNG_LIBPNG_VER_STRING, NULL, NULL, NULL)))
+ {
+	SLang_verror (SL_Open_Error, "Unable to read png structure from %s", file);
+	free_png_type (p);
+	return NULL;
+ }
+
+ if (NULL == (p->info = png_create_info_struct (p->png)))
+ {
+	SLang_verror (SL_Read_Error, "Unable to create info struct for %s", file);
+	free_png_type (p);
+	return NULL;
+ }
+
+ return p;
+}
+
+static void fixup_array_rgb (SLang_Array_Type *at)
+{
+ SLindex_Type num_rows, num_cols, row;
+ unsigned char *data;
+
+ num_rows = at->dims0;
+ num_cols = at->dims1;
+ data = (unsigned char *) at->data;
+
+ /* Convert RGBRGBRGB.... to 0RGB0RGB0RGB ... */
+ for (row = 0; row < num_rows; row++)
+ {
+	unsigned char *p = data + 3*num_cols;
+	unsigned char *q = p + num_cols;
+	while (p != data)
+	 {
+	 *(--q) = *(--p);
+	 *(--q) = *(--p);
+	 *(--q) = *(--p);
+	 *(--q) = 0;	 /* or 0xFF */
+	 }
+	data += 4*num_cols;
+ }
+
+ if (Is_Little_Endian)
+ byte_swap32 ((unsigned char *)at->data, (unsigned char *)at->data, at->num_elements);
+}
+
+static void fixup_array_rgba (SLang_Array_Type *at)
+{
+ unsigned char *data, *data_max;
+
+ data = (unsigned char *) at->data;
+ data_max = data + 4*at->num_elements;
+
+ /* RGBARGBA -> ARGBARGB */
+ while (data < data_max)
+ {
+	unsigned char a = data3;
+	data3 = data2;
+	data2 = data1;
+	data1 = data0;
+	data0 = a;
+	data += 4;
+ }
+ if (Is_Little_Endian)
+ byte_swap32 ((unsigned char *)at->data, (unsigned char *)at->data, at->num_elements);
+}
+
+static void fixup_array_ga (SLang_Array_Type *at)
+{
+ if (Is_Little_Endian)
+ byte_swap16 ((unsigned char *)at->data, (unsigned char *) at->data, at->num_elements);
+}
+
+/* For little endian systems, ARGB is equivalent to the int32 BGRA.
+ * So, to read the image as RGB
+ */
+static SLang_Array_Type *read_image_internal (char *file, int flip, int *color_typep)
+{
+ Png_Type *p;
+ png_uint_32 width, height, rowbytes;
+ png_struct *png;
+ png_info *info;
+ int bit_depth;
+ /* int interlace_type; */
+ int color_type;
+ unsigned int sizeof_type;
+ SLindex_Type dims2;
+ SLtype data_type;
+ png_byte **image_pointers = NULL;
+ png_byte *data = NULL;
+ SLang_Array_Type *at;
+ void (*fixup_array_fun) (SLang_Array_Type *);
+
+ if (NULL == (p = open_png_file (file)))
+ return NULL;
+
+ png = p->png;
+ if (setjmp (png_jmpbuf (png)))
+ {
+	free_png_type (p);
+	if (data != NULL) SLfree ((char *) data);
+	free_image_pointers (image_pointers);
+	SLang_verror (SL_Read_Error, "Error encountered during I/O to %s", file);
+	return NULL;
+ }
+
+ png_init_io (png, p->fp);
+ png_set_sig_bytes (png, 8);
+ info = p->info;
+ png_read_info(png, info);
+
+ width = png_get_image_width (png, info);
+ height = png_get_image_height (png, info);
+ /* interlace_type = png_get_interlace_type (png, info); */
+ bit_depth = png_get_bit_depth (png, info);
+
+ if (bit_depth == 16)
+ png_set_strip_16 (png);
+
+ switch (png_get_color_type (png, info))
+ {
+ case PNG_COLOR_TYPE_GRAY:
+#if defined(PNG_LIBPNG_VER) && (PNG_LIBPNG_VER >= 10209)
+	if (bit_depth < 8) png_set_expand_gray_1_2_4_to_8 (png);
+#else				 /* deprecated */
+	if (bit_depth < 8) png_set_gray_1_2_4_to_8 (png);
+#endif
+	break;
+ case PNG_COLOR_TYPE_GRAY_ALPHA:
+	/* png_set_gray_to_rgb (png); */
+	break;
+
+ case PNG_COLOR_TYPE_PALETTE:
+	png_set_palette_to_rgb (png);
+	break;
+ }
+
+ if (png_get_valid(png, info, PNG_INFO_tRNS))
+ png_set_tRNS_to_alpha(png);
+
+ png_read_update_info (png, info);
+
+ color_type = png_get_color_type (png, info);
+ switch (color_type)
+ {
+ case PNG_COLOR_TYPE_RGBA:
+	sizeof_type = 4;
+	fixup_array_fun = fixup_array_rgba;
+	data_type = SLang_get_int_type (32);
+	break;
+
+ case PNG_COLOR_TYPE_RGB:
+	sizeof_type = 4;
+	fixup_array_fun = fixup_array_rgb;
+	data_type = SLang_get_int_type (32);
+	break;
+
+ case PNG_COLOR_TYPE_GRAY_ALPHA:
+	sizeof_type = 2;
+	fixup_array_fun = fixup_array_ga;
+	data_type = SLang_get_int_type (16);
+	break;
+
+ case PNG_COLOR_TYPE_GRAY:
+	sizeof_type = 1;
+	fixup_array_fun = NULL;
+	data_type = SLANG_UCHAR_TYPE;
+	break;
+
+ default:
+	SLang_verror (SL_Read_Error, "Unsupported PNG color-type");
+	free_png_type (p);
+	return NULL;
+ }
+ *color_typep = color_type;
+
+ /* Use the high-level interface */
+ rowbytes = png_get_rowbytes (png, info);
+ if (rowbytes > width * sizeof_type)
+ {
+	SLang_verror (SL_INTERNAL_ERROR, "Unexpected value returned from png_get_rowbytes");
+	free_png_type (p);
+	return NULL;
+ }
+
+ if (NULL == (data = (png_byte *) SLmalloc (height * width * sizeof_type)))
+ {
+	free_png_type (p);
+	return NULL;
+ }
+
+ if (NULL == (image_pointers = allocate_image_pointers (height, data, width * sizeof_type, flip)))
+ {
+	SLfree ((char *) data);
+	free_png_type (p);
+	return NULL;
+ }
+ png_read_image(png, image_pointers);
+
+ dims0 = height;
+ dims1 = width;
+
+ if (NULL == (at = SLang_create_array (data_type, 0, (VOID_STAR) data, dims, 2)))
+ {
+	SLfree ((char *) data);
+	free_image_pointers (image_pointers);
+	free_png_type (p);
+	return NULL;
+ }
+ free_png_type (p);
+ free_image_pointers (image_pointers);
+ if (fixup_array_fun != NULL)
+ (*fixup_array_fun) (at);
+ return at;
+}
+
+static void read_image (int flipped)
+{
+ int color_type;
+ char *file;
+ SLang_Ref_Type *ref = NULL;
+ SLang_Array_Type *at;
+
+ if ((SLang_Num_Function_Args == 2)
+ && (-1 == SLang_pop_ref (&ref)))
+ return;
+
+ if (-1 == SLang_pop_slstring (&file))
+ {
+	file = NULL;
+	goto free_return;
+ }
+
+ if (NULL == (at = read_image_internal (file, flipped, &color_type)))
+ goto free_return;
+
+ if ((ref != NULL)
+ && (-1 == SLang_assign_to_ref (ref, SLANG_INT_TYPE, &color_type)))
+ {
+	SLang_free_array (at);
+	goto free_return;
+ }
+
+ (void) SLang_push_array (at, 1);
+
+ free_return:
+ SLang_free_slstring (file);
+ if (ref != NULL)
+ SLang_free_ref (ref);
+}
+
+/*}}}*/
+
+static void write_gray_to_gray (png_struct *png, png_byte *data, SLindex_Type num_cols, png_byte *tmpbuf)
+{
+ (void) num_cols;
+ (void) tmpbuf;
+ png_write_row (png, data);
+}
+
+static void write_gray_to_gray_alpha (png_struct *png, png_byte *data, SLindex_Type num_cols, png_byte *tmpbuf)
+{
+ SLindex_Type i, j;
+
+ j = 0;
+ for (i = 0; i < num_cols; i++)
+ {
+	tmpbufj = datai;
+	tmpbufj+1 = 0xFF;
+	j += 2;
+ }
+ png_write_row (png, tmpbuf);
+}
+
+static void write_gray_alpha_to_gray (png_struct *png, png_byte *data, SLindex_Type num_cols, png_byte *tmpbuf)
+{
+ SLindex_Type i;
+
+ if (Is_Little_Endian == 0)
+ data++; /* AGAGAG... -> GAGAGA... */
+
+ for (i = 0; i < num_cols; i++)
+ {
+	tmpbufi = *data;
+	data += 2;
+ }
+ png_write_row (png, tmpbuf);
+}
+
+static void write_gray_alpha_to_gray_alpha (png_struct *png, png_byte *data, SLindex_Type num_cols, png_byte *tmpbuf)
+{
+ if (Is_Little_Endian == 0)
+ {
+	png_write_row (png, data);
+	return;
+ }
+
+ byte_swap16 ((unsigned char *) data, (unsigned char *) tmpbuf, num_cols);
+ png_write_row (png, tmpbuf);
+}
+
+static void write_rgb_alpha_to_rgb_alpha (png_struct *png, png_byte *data, SLindex_Type num_cols, png_byte *tmpbuf)
+{
+ unsigned char *data_max;
+ unsigned char *p;
+
+ if (Is_Little_Endian)
+ {
+	byte_swap32 ((unsigned char *) data, (unsigned char *) tmpbuf, num_cols);
+	data = tmpbuf;
+ }
+ data_max = data + 4 * num_cols;
+ p = tmpbuf;
+ /* Change ARGBARGB... to RGBARGBA... */
+ while (data < data_max)
+ {
+	unsigned char a = data0;
+	p0 = data1;
+	p1 = data2;
+	p2 = data3;
+	p3 = a;
+	data += 4;
+	p += 4;
+ }
+ png_write_row (png, tmpbuf);
+}
+
+static void write_rgb_to_rgb (png_struct *png, png_byte *data, SLindex_Type num_cols, png_byte *tmpbuf)
+{
+ SLindex_Type i;
+ png_byte *p, *q;
+
+ if (Is_Little_Endian)
+ {
+	byte_swap32 ((unsigned char *) data, (unsigned char *) tmpbuf, num_cols);
+	p = tmpbuf;
+ }
+ else p = data;
+
+ /* ARGBARGB... -> RGBRGBRGB */
+ q = tmpbuf;
+ for (i = 0; i < num_cols; i++)
+ {
+	p++;
+	*q++ = *p++;
+	*q++ = *p++;
+	*q++ = *p++;
+ }
+ png_write_row (png, tmpbuf);
+}
+
+static int write_array (png_struct *png, png_byte **image_pointers, SLindex_Type num_rows, SLindex_Type num_cols,
+			void (*write_row_func) (png_struct *, png_byte *, SLindex_Type, png_byte *),
+			png_byte *tmpbuf)
+{
+ int num_pass;
+ SLindex_Type i;
+
+ num_pass = png_set_interlace_handling(png);
+ while (num_pass > 0)
+ {
+	num_pass--;
+	for (i = 0; i < num_rows; i++)
+	 (*write_row_func) (png, image_pointersi, num_cols, tmpbuf);
+ }
+ return 0;
+}
+
+static int write_image_internal (char *file, SLang_Array_Type *at,
+				 int color_type,
+				 void (*write_fun)(png_struct *, png_byte *p, SLindex_Type, png_byte *),
+				 int flip, int compress_level)
+{
+ FILE *fp;
+ Png_Type *p = NULL;
+ png_struct *png;
+ png_info *info;
+ SLindex_Type width, height;
+ png_byte **image_pointers;
+ int bit_depth;
+ int status = -1;
+ png_byte *tmpbuf;
+
+ bit_depth = 8;
+
+ height = at->dims0;
+ width = at->dims1;
+
+ if (NULL == (image_pointers = allocate_image_pointers (height, (png_byte *)at->data, width * at->sizeof_type, flip)))
+ return -1;
+
+ if (NULL == (tmpbuf = (png_byte *)SLmalloc (4*width)))
+ {
+	free_image_pointers (image_pointers);
+	return -1;
+ }
+
+ if (NULL == (fp = fopen (file, "wb")))
+ {
+	(void)SLerrno_set_errno (errno);
+	SLang_verror (SL_Open_Error, "Unable to open %s", file);
+	goto return_error;
+ }
+
+ if (NULL == (p = alloc_png_type ('w')))
+ goto return_error;
+
+ p->fp = fp;
+
+ if (NULL == (p->png = png_create_write_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL)))
+ {
+	SLang_verror (SL_Open_Error, "png_create_write_struct failed");
+	goto return_error;
+ }
+ png = p->png;
+ if (NULL == (p->info = png_create_info_struct (png)))
+ {
+	SLang_verror (SL_Open_Error, "png_create_info_struct failed");
+	goto return_error;
+ }
+ info = p->info;
+ if (setjmp(png_jmpbuf(png)))
+ {
+	SLang_verror (SL_Write_Error, "PNG I/O error");
+	goto return_error;
+ }
+ png_init_io(png, fp);
+
+ if ((compress_level >= 0) && (compress_level <= 9))
+ png_set_compression_level (png, compress_level);
+
+ png_set_IHDR (png, info, width, height,
+		 bit_depth, color_type, PNG_INTERLACE_NONE,
+		 PNG_COMPRESSION_TYPE_BASE, PNG_FILTER_TYPE_BASE);
+ png_write_info(png, info);
+
+ if (-1 == write_array (png, image_pointers, height, width, write_fun, tmpbuf))
+ goto return_error;
+
+ png_write_end(png, NULL);
+ if (EOF == fclose (p->fp))
+ {
+	SLang_verror (SL_Write_Error, "Error closing %s", file);
+	SLerrno_set_errno (errno);
+ }
+ else status = 0;
+
+ p->fp = NULL;
+ /* drop */
+ return_error:
+ if (tmpbuf != NULL)
+ SLfree ((char *) tmpbuf);
+ free_image_pointers (image_pointers);
+ if (p != NULL)
+ free_png_type (p);
+
+ return status;
+}
+
+static void write_image (int flip)
+{
+ char *file;
+ SLang_Array_Type *at;
+ int with_alpha = 0;
+ int has_with_alpha = 0;
+ int compress_level;
+ int color_type;
+ void (*write_fun) (png_struct *, png_byte *, SLindex_Type, png_byte *);
+
+ if (SLang_Num_Function_Args == 3)
+ {
+	if (-1 == SLang_pop_int (&with_alpha))
+	 return;
+	has_with_alpha = 1;
+ }
+
+ if (-1 == SLang_get_int_qualifier ("compress", &compress_level, -1))
+ return;
+
+ if (-1 == SLang_pop_array (&at, 0))
+ return;
+
+ if (at->num_dims != 2)
+ {
+	SLang_verror (SL_InvalidParm_Error, "Expecting a 2-d array");
+	SLang_free_array (at);
+	return;
+ }
+
+ switch (SLang_get_int_size (at->data_type))
+ {
+ case -8:
+ case 8:
+	if (with_alpha)
+	 {
+	 write_fun = write_gray_to_gray_alpha;
+	 color_type = PNG_COLOR_TYPE_GRAY_ALPHA;
+	 }
+	else
+	 {
+	 write_fun = write_gray_to_gray;
+	 color_type = PNG_COLOR_TYPE_GRAY;
+	 }
+	break;
+ case -16:
+ case 16:
+	if (has_with_alpha && (with_alpha == 0))
+	 {
+	 write_fun = write_gray_alpha_to_gray;
+	 color_type = PNG_COLOR_TYPE_GRAY;
+	 }
+	else
+	 {
+	 write_fun = write_gray_alpha_to_gray_alpha;
+	 color_type = PNG_COLOR_TYPE_GRAY_ALPHA;
+	 }
+	break;
+ case -32:
+ case 32:
+	if (with_alpha)
+	 {
+	 write_fun = write_rgb_alpha_to_rgb_alpha;
+	 color_type = PNG_COLOR_TYPE_RGBA;
+	 }
+	else
+	 {
+	 write_fun = write_rgb_to_rgb;
+	 color_type = PNG_COLOR_TYPE_RGB;
+	 }
+	break;
+ default:
+	SLang_verror (SL_InvalidParm_Error, "Expecting an 8, 16, or 32 bit integer array");
+	SLang_free_array (at);
+	return;
+ }
+
+ if (-1 == SLang_pop_slstring (&file))
+ {
+	SLang_free_array (at);
+	return;
+ }
+ (void) write_image_internal (file, at, color_type, write_fun, flip, compress_level);
+ SLang_free_slstring (file);
+ SLang_free_array (at);
+}
+
+static void read_intrin (void)
+{
+ read_image (0);
+}
+static void read_flipped_intrin (void)
+{
+ read_image (1);
+}
+
+static void write_intrin (void)
+{
+ write_image (0);
+}
+static void write_flipped_intrin (void)
+{
+ write_image (1);
+}
+
+static SLang_Intrin_Fun_Type Module_Intrinsics =
+{
+ MAKE_INTRINSIC_0("png_read", read_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("png_read_flipped", read_flipped_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("png_write", write_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("png_write_flipped", write_flipped_intrin, SLANG_VOID_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static SLang_Intrin_Var_Type Module_Variables =
+{
+ MAKE_VARIABLE("_png_module_version_string", &Module_Version_String, SLANG_STRING_TYPE, 1),
+ SLANG_END_INTRIN_VAR_TABLE
+};
+
+static SLang_IConstant_Type Module_IConstants =
+{
+ MAKE_ICONSTANT("PNG_COLOR_TYPE_GRAY", PNG_COLOR_TYPE_GRAY),
+ MAKE_ICONSTANT("PNG_COLOR_TYPE_GRAY_ALPHA", PNG_COLOR_TYPE_GRAY_ALPHA),
+ MAKE_ICONSTANT("PNG_COLOR_TYPE_RGB", PNG_COLOR_TYPE_RGB),
+ MAKE_ICONSTANT("PNG_COLOR_TYPE_RGBA", PNG_COLOR_TYPE_RGBA),
+
+ MAKE_ICONSTANT("_png_module_version", MODULE_VERSION_NUMBER),
+ SLANG_END_ICONST_TABLE
+};
+
+int init_png_module_ns (char *ns_name)
+{
+ unsigned short x;
+
+ SLang_NameSpace_Type *ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ x = 0xFF;
+ Is_Little_Endian = (*(unsigned char *)&x == 0xFF);
+
+ if (
+ (-1 == SLns_add_intrin_var_table (ns, Module_Variables, NULL))
+ || (-1 == SLns_add_intrin_fun_table (ns, Module_Intrinsics, NULL))
+ || (-1 == SLns_add_iconstant_table (ns, Module_IConstants, NULL))
+ )
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_png_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/png.sl Added

@@ -0,0 +1,167 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+autoload ("glob", "glob");
+import ("png");
+
+% Colormap functions
+
+private define linear_range (a, b, xa, xb)
+{
+ return typecast (xa + (0:b-a * (xb-xa)/double(b-a)), UChar_Type);
+}
+
+private define build_colormap_channel (ranges)
+{
+ variable r = UChar_Type256;
+ variable i = 0;
+ loop (length(ranges)/4)
+ {
+	variable a = rangesi;
+	variable b = rangesi+1;
+	variable xa = rangesi+2;
+	variable xb = rangesi+3;
+	ra:b = linear_range (a, b, xa, xb);
+	i += 4;
+ }
+ return r;
+}
+
+define png_build_colormap (r_ranges, g_ranges, b_ranges)
+{
+ return ((build_colormap_channel (r_ranges) shl 16)
+	 + (build_colormap_channel (g_ranges) shl 8)
+	 + (build_colormap_channel (b_ranges)));
+}
+
+private variable Color_Maps = Assoc_TypeArray_Type;
+private variable Color_Map_Dir = path_concat (path_dirname (__FILE__), "cmaps");
+private variable Png_Namespace = current_namespace ();
+
+define png_add_colormap (name, map)
+{
+ Color_Mapsname = map;
+}
+
+define png_get_colormap (name)
+{
+ if (assoc_key_exists (Color_Maps, name))
+ return Color_Mapsname;
+
+ variable mapfile = strcat (name, ".map");
+ variable file = path_concat (Color_Map_Dir, mapfile);
+ if (stat_file (file) == NULL)
+ throw OpenError, "Unable to load colormap $mapfile"$;
+
+ () = evalfile (file, Png_Namespace);
+
+ if (assoc_key_exists (Color_Maps, name))
+ return Color_Mapsname;
+
+ throw DataError, "$file does not contain the $name color map"$;
+}
+
+define png_get_colormap_names ()
+{
+ variable maps = glob (path_concat (Color_Map_Dir, "*.map"));
+ maps = array_map (String_Type, &path_basename_sans_extname, maps);
+ variable n = length (maps);
+ variable idx = Char_Typen;
+ _for (0, n-1, 1)
+ {
+	variable i = ();
+	!if (assoc_key_exists (Color_Maps, mapsi))
+	 idxi = 1;
+ }
+ return mapswhere(idx), assoc_get_keys (Color_Maps);
+
+}
+
+define png_rgb_to_gray (rgb)
+{
+ variable gray = ((rgb&0xFF) + ((rgb&0xFF00)shr 8) + ((rgb&0xFF0000)shr 16));
+ return typecast ((__tmp(gray)/3.0), UChar_Type);
+}
+
+private define normalize_gray (gray, nlevels)
+{
+ variable g0 = qualifier ("gmin");
+ variable g1 = qualifier ("gmax");
+
+ if ((typeof (gray) == UChar_Type) && (nlevels == 256)
+ && (g0 == NULL) && (g1 == NULL))
+ return gray;
+
+ variable is_bad = isnan(gray) or isinf(gray);
+ variable any_is_bad = any(is_bad);
+ if (any_is_bad)
+ {
+	variable good_gray = gray where(is_bad == 0);
+	if (g0 == NULL) g0 = min (good_gray);
+	if (g1 == NULL) g1 = max (good_gray);
+ }
+ else
+ {
+	if (g0 == NULL) g0 = min(gray);
+	if (g1 == NULL) g1 = max(gray);
+ }
+ if (g0 > g1) (g0, g1) = (g1, g0);
+
+ if (g0 != g1)
+ {
+	variable factor = nlevels/double(g1-g0);
+	gray = typecast ((gray-g0)*factor, Int_Type);
+	graywhere (gray<0) = 0;
+	graywhere (gray>=nlevels) = (nlevels-1);
+ }
+ else
+ gray = typecast (gray * 0 + 127, Int_Type);
+
+ variable bad_level = 0;
+ if (any_is_bad)
+ graywhere(is_bad) = bad_level;
+
+ return gray;
+}
+
+private define gray_to_rgb_with_cmap (gray, cmap)
+{
+ if (typeof (cmap) == String_Type)
+ cmap = png_get_colormap (cmap);
+
+ gray = normalize_gray (gray, length(cmap);;__qualifiers());
+ return cmapgray;
+}
+
+define png_gray_to_rgb ()
+{
+ variable gray;
+ if (_NARGS == 2)
+ return gray_to_rgb_with_cmap (;;__qualifiers ());
+
+ gray = ();
+ gray = normalize_gray (gray, 256;;__qualifiers ());
+ return gray + (gray shl 8) + (gray shl 16);
+}
+
+define png_rgb_get_r (rgb)
+{
+ return typecast ((rgb shr 16) & 0xFF, UChar_Type);
+}
+define png_rgb_get_g (rgb)
+{
+ return typecast ((rgb shr 8) & 0xFF, UChar_Type);
+}
+define png_rgb_get_b (rgb)
+{
+ return typecast (rgb & 0xFF, UChar_Type);
+}
+
+$1 = path_concat (path_dirname (__FILE__), "help/pngfuns.hlp");
+if (NULL != stat_file ($1))
+ add_doc_file ($1);
+
+provide("png");

_service:tar_scm:slang-2.3.2.tar.bz2/modules/rand-module.c Added

@@ -0,0 +1,1466 @@
+/* -*- mode: C; mode: fold -*-
+Copyright (C) 2007-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include "config.h"
+
+#include <stdio.h>
+#include <math.h>
+#include <slang.h>
+
+#ifdef HAVE_PROCESS_H
+# include <process.h>			/* for getpid */
+#endif
+
+#include <sys/types.h>
+
+#ifdef HAVE_UNISTD_H
+# include <unistd.h>
+#endif
+
+#include <time.h>
+
+/* The random number generator used here uses a combination of 3 generators.
+ * One of the generators was derived from mzran13 published in
+ *
+ * G. Marsaglia and A. Zaman, ``Some portable very-long-period
+ * 	random number generators'', Computers in Physics, Vol. 8,
+ * 	No. 1, Jan/Feb 1994
+ *
+ * However, the algorithm (mzran13) published there contained a few
+ * typos and as written was not very good. The subtract-with-carry
+ * component of mzran13 adopted for the purposes of the generator in
+ * this file has a period of 4x10^28.
+ *
+ * The other two generators are described at
+ * <http://www.helsbreth.org/random/rng_combo.html>. Briefly, one is
+ * a simple product generator, r_{k+2} = r_{k+1} r_k, and the other
+ * is is a multiply with carry generator. The period of this
+ * combination exceeds 10^18.
+ *
+ * The total period of the combined generators exceeds 10^46.
+ *
+ * The generator was tested using dieharder-2.24.4, and the testing
+ * indicates that it may perform a bit better than the Mersenne
+ * twister mt19937_1999, which is thought to be a high-quality
+ * generator. The speed is about the same.
+ *
+ * Note: mt19937_1999 is available to S-Lang users via the GSL module.
+ */
+
+SLANG_MODULE(rand);
+
+#ifdef PI
+# undef PI
+#endif
+#define PI 3.14159265358979323846264338327950288
+#define LOG_SQRT_2PI 0.9189385332046727417803297364
+
+/*{{{ The basic generator */
+
+#define SEED_X	521288629U
+#define SEED_Y	362436069U
+#define SEED_Z	16163801U
+#define SEED_C 1 /* (SEED_Y > SEED_Z) */
+
+#if (SIZEOF_INT == 4)
+typedef unsigned int uint32;
+# define UINT32_TYPE SLANG_UINT_TYPE
+# define PUSH_UINT32 SLang_push_uint
+#else
+typedef unsigned long uint32
+# define UINT32_TYPE SLANG_ULONG_TYPE
+# define PUSH_UINT32 SLang_push_ulong
+#endif
+
+#define CACHE_SIZE 4		 /* do not change this */
+
+typedef struct
+{
+ int cache_index;
+ uint32 cacheCACHE_SIZE;
+ uint32 x, y, z;
+ uint32 cx, cy, cz;
+
+ /* Gaussian Random fields */
+ int one_available;
+ double g2;
+}
+Rand_Type;
+
+static uint32 generate_uint32_random (Rand_Type *);
+
+#define NUM_SEEDS 3
+static void seed_random (Rand_Type *rt, unsigned long seedsNUM_SEEDS)
+{
+ int count;
+ unsigned long s1 = seeds0;
+ unsigned long s2 = seeds1;
+ unsigned long s3 = seeds2;
+
+ rt->x = (uint32) (s1 + SEED_X);
+ rt->y = (uint32) (s1/2 + SEED_Y);
+ rt->z = (uint32) (2*s1+SEED_Z);
+ rt->x += (rt->y > rt->z);
+
+ rt->cache_index = CACHE_SIZE;
+
+ rt->cx = s2 * 8 + 3;
+ rt->cy = s2 * 2 + 1;
+ rt->cz = s3 | 1;
+ count = 32;
+ while (count)
+ {
+	count--;
+	(void) generate_uint32_random (rt);
+ }
+
+ rt->one_available = 0;
+ rt->g2 = 0.0;
+}
+
+static uint32 generate_uint32_random (Rand_Type *rt)
+{
+ uint32 s0, s1, s2, s3, r;
+ uint32 *cache;
+
+ cache = rt->cache;
+ if (rt->cache_index < CACHE_SIZE)
+ return cachert->cache_index++;
+
+ s1 = rt->x;
+ s2 = rt->y;
+ s3 = rt->z;
+
+ r = s0 = (s2-s1) - 18*(s2<=s1); s2 += (s2 <= s1);
+ rt->x = s1 = (s3-s2) - 18*(s3<=s2); s3 += (s3 <= s2);
+ rt->y = s2 = (s0-s3) - 18*(s0<=s3); s0 += (s0 <= s3);
+ rt->z = s3 = (s1-s0) - 18*(s1<=s0); s1 += (s1 <= s0);
+
+#define COMBINE(y,x,a,b) y = ((x)+(a)+(b))
+ s1 = rt->cx;
+ s2 = rt->cy;
+ s3 = rt->cz;
+
+ s0 = s1*s2;
+ s3 = 30903U*(s3 & 0xFFFFU) + (s3 >> 16);
+ COMBINE(r,r,s0,s3);
+
+ s1 = s2*s0;
+ s3 = 30903U*(s3 & 0xFFFFU) + (s3 >> 16);
+ COMBINE(cache1,rt->x,s1,s3);
+
+ rt->cx = s2 = s0*s1;
+ s3 = 30903U*(s3 & 0xFFFFU) + (s3 >> 16);
+ COMBINE(cache2,rt->y,s2,s3);
+
+ rt->cy = s0 = s1*s2;
+ rt->cz = s3 = 30903U*(s3 & 0xFFFFU) + (s3 >> 16);
+ COMBINE(cache3,rt->z,s0,s3);
+
+ rt->cache_index = 1;
+ return r;
+}
+
+static void free_random (Rand_Type *r)
+{
+ SLfree ((char *) r);
+}
+
+static Rand_Type *create_random (unsigned long seedsNUM_SEEDS)
+{
+ Rand_Type *rt;
+
+ if (NULL != (rt = (Rand_Type *) SLmalloc (sizeof (Rand_Type))))
+ seed_random (rt, seeds);
+ return rt;
+}
+
+/*}}}*/
+
+/*{{{ Flat distribution */
+
+static void generate_random_doubles (Rand_Type *rt, VOID_STAR ap,
+				 SLuindex_Type num, VOID_STAR parms)
+{
+ double *a = (double *)ap;
+ double *amax = a + num;
+ uint32 *cache = rt->cache;
+
+ (void) parms;
+
+ while (a < amax)
+ {
+	uint32 u;
+
+	if (rt->cache_index < CACHE_SIZE)
+	 u = cachert->cache_index++;
+	else
+	 u = generate_uint32_random (rt);
+
+	*a++ = u / 4294967296.0;
+ }
+}
+
+static void generate_random_open_doubles (Rand_Type *rt, VOID_STAR ap,
+					 SLuindex_Type num, VOID_STAR parms)
+{
+ double *a = (double *)ap;
+ double *amax = a + num;
+ uint32 *cache = rt->cache;
+
+ (void) parms;
+
+ while (a < amax)
+ {
+	uint32 u;
+
+	if (rt->cache_index < CACHE_SIZE)
+	 u = cachert->cache_index++;
+	else
+	 u = generate_uint32_random (rt);
+
+	if (u == 0)
+	 continue;
+
+	*a++ = u / 4294967296.0;
+ }
+}
+
+static void generate_random_uints (Rand_Type *rt, VOID_STAR ap,
+				 SLuindex_Type num, VOID_STAR parms)
+{
+ uint32 *a = (uint32 *)ap;
+ uint32 *amax = a + num;
+ uint32 *cache = rt->cache;
+
+ (void) parms;
+
+ while (a < amax)
+ {
+	if (rt->cache_index < CACHE_SIZE)
+	 *a++ = cachert->cache_index++;
+	else
+	 *a++ = generate_uint32_random (rt);
+ }
+}
+
+/* produces a random number in the open interval (0,1) */
+static double open_interval_random (Rand_Type *rt)
+{
+ uint32 u;
+
+ do
+ {
+	if (rt->cache_index < CACHE_SIZE)
+	 u = rt->cachert->cache_index++;
+	else
+	 u = generate_uint32_random (rt);
+ }
+ while (u == 0);
+
+ return u / 4294967296.0;
+}
+
+static double uniform_random (Rand_Type *rt)
+{
+ uint32 u;
+
+ if (rt->cache_index < CACHE_SIZE)
+ u = rt->cachert->cache_index++;
+ else
+ u = generate_uint32_random (rt);
+
+ return u / 4294967296.0;
+}
+
+/*}}}*/
+
+/*{{{ Gaussian Distribution */
+
+static double gaussian_box_muller (Rand_Type *rt)
+{
+ double s, g1, g2, g;
+
+ if (rt->one_available)
+ {
+	rt->one_available = 0;
+	return rt->g2;
+ }
+
+ do
+ {
+	uint32 u;
+	if (rt->cache_index < CACHE_SIZE)
+	 u = rt->cachert->cache_index++;
+	else
+	 u = generate_uint32_random (rt);
+
+	g1 = 2.0*(u/4294967296.0) - 1.0;
+
+	if (rt->cache_index < CACHE_SIZE)
+	 u = rt->cachert->cache_index++;
+	else
+	 u = generate_uint32_random (rt);
+	g2 = 2.0*(u/4294967296.0) - 1.0;
+	g = g1*g1 + g2*g2;
+ }
+ while ((g >= 1.0) || (g == 0.0));
+
+ s = sqrt (-2.0 * log (g) / g);
+ rt->g2 = g2 * s;
+ rt->one_available = 1;
+ return g1*s;
+}
+
+static void generate_gaussian_randoms (Rand_Type *rt, VOID_STAR ap,
+				 SLuindex_Type num, VOID_STAR parms)
+{
+ double *a = (double *)ap;
+ double *amax = a + num;
+ double sigma = *(double *)parms;
+
+ if ((a < amax) && (rt->one_available))
+ {
+	*a++ = sigma*rt->g2;
+	rt->one_available = 0;
+ }
+
+ while (a < amax)
+ {
+	*a++ = sigma*gaussian_box_muller (rt);
+	if (a == amax)
+	 break;
+
+	*a++ = sigma*rt->g2;
+	rt->one_available = 0;
+ }
+}
+
+/*}}}*/
+
+/*{{{ Poisson Distribution */
+
+/*
+ * The algorithm used is described in:
+ * W. Hörmann "The Transformed Rejection Method for Generating
+ * Poisson Random Variables", which is available from
+ * <http://statistik.wu-wien.ac.at/papers/92-04-13.wh.ps.gz>.
+ */
+#define FACTORIAL_TABLE_SIZE 10
+static double Log_Factorial_Table FACTORIAL_TABLE_SIZE+1;
+
+static void init_poisson (void)
+{
+ unsigned int i;
+ double x = 1.0;
+ Log_Factorial_Table0 = 0.0;
+ for (i = 1; i <= FACTORIAL_TABLE_SIZE; i++)
+ {
+	x *= i;
+	Log_Factorial_Tablei = log(x);
+ }
+}
+
+/* Assumes x >= 0 */
+static double log_factorial (double x)
+{
+ double x2;
+
+ if (x <= FACTORIAL_TABLE_SIZE)
+ return Log_Factorial_Table(unsigned int) x;
+
+ x2 = x*x;
+
+ return LOG_SQRT_2PI + (x+0.5)*log(x) - x
+ + (13860.0 - (462.0 - (132.0 - (99.0 - 140.0/x2)/x2)/x2)/x2)/x/166320.0;
+}
+
+static unsigned int hoermann_ptrd_poisson
+ (Rand_Type *rt, double mu, double a, double b, double vr,
+ double alphainv, double lnmu, double smu)
+{
+ while (1)
+ {
+	double u, v, fk, us;
+	unsigned int k;
+
+	v = open_interval_random (rt);
+	if (v <= 0.86*vr)
+	 {
+	 u = v/vr - 0.43;
+	 fk = floor((2.0*a/(0.5-fabs(u))+b)*u + mu + 0.445);
+	 return (unsigned int)fk;
+	 }
+	if (v >= vr)
+	 u = open_interval_random (rt) - 0.5;
+	else
+	 {
+	 u = v/vr - 0.93; u = ((u < 0.0) ? -0.5 : 0.5) - u;
+	 v = vr*open_interval_random (rt);
+	 }
+	us = 0.5 - fabs(u);
+	if ((us < 0.013) && (v > us))
+	 continue;
+
+	fk = floor((2.0*a/us + b)*u + mu + 0.445);
+	if (fk < 0.0)
+	 continue;
+
+	k = (unsigned int) fk;
+
+	v = v * alphainv/(a/(us*us) + b);
+	if ((k >= 10)
+	 && (log(v*smu) <= (fk+0.5)*log(mu/fk)-mu-LOG_SQRT_2PI+fk
+		- (1.0/12-1.0/(360.0*fk*fk))/fk))
+	 return (unsigned int)fk;
+
+	if ((k <= 9)
+	 && (log(v)<=fk*lnmu-mu-Log_Factorial_Tablek))
+	 return k;
+ }
+}
+
+static unsigned int knuth_poisson (Rand_Type *rt, double cutoff)
+{
+ double x = 1.0;
+ unsigned int n = 0;
+
+ do
+ {
+	if (rt->cache_index < CACHE_SIZE)
+	 x *= rt->cachert->cache_index++ / 4294967296.0;
+	else
+	 x *= generate_uint32_random (rt) / 4294967296.0;
+	n++;
+ }
+ while (x >= cutoff);
+
+ return n - 1;
+}
+
+static void generate_poisson_randoms (Rand_Type *rt, VOID_STAR ap,
+				 SLuindex_Type num, VOID_STAR parms)
+{
+ unsigned int *x = (unsigned int *)ap;
+ unsigned int *xmax = x + num;
+ double mu = *(double *)parms;
+ double cutoff;
+
+ if (mu > 10.0)
+ {
+	double smu = sqrt(mu);
+	double b = 0.931 + 2.53*smu;
+	double a = -0.059 + 0.02483*b;
+	double vr = 0.9277 - 3.6224/(b-2.0);
+	double alphainv = 1.1239 + 1.1328/(b-3.4);
+	double lnmu = log(mu);
+
+	while (x < xmax)
+	 {
+	 *x++ = hoermann_ptrd_poisson (rt, mu, a, b, vr, alphainv, lnmu, smu);
+	 }
+	return;
+ }
+
+ cutoff = exp(-mu);
+ while (x < xmax)
+ {
+	*x++ = knuth_poisson (rt, cutoff);
+ }
+}
+
+/*}}}*/
+
+/*{{{ Gamma Distribution */
+
+/* The gamma distribution is:
+ *
+ * f(x; k,theta)dx = x^{k-1} \frac{e^{-x/theta}}{\theta^k \Gamma(k)} dx
+ * where x>0, k,theta>0.
+ * The marsaglia_tsang_gamma algorithm is for x>0, k>=1, theta=1:
+ * f(y;k) = y^{k-1}\frac{e^{-y}}{\Gamma(k)}
+ * Let x = theta*y. dy = dx/theta
+ *
+ * Then:
+ *
+ * f(y;k)dy = (x/theta)^{k-1}\frac{e^{-x/theta}}{\Gamma(k)} dx / \theta
+ * = x^{k-1}\frac{e^{-x/theta}}{\theta^k\Gamma(k)} dx
+ * = f(x; k,theta)
+ *
+ * Also the final note in the Marsaglia paper says that values for
+ * k<1 may be obtained using X_k = X_{k+1}U^{1/k} where X is a random
+ * value produced by the algorithm, and U is a uniform random number
+ * on (0,1).
+ *
+ * Marsaglia, G. and Tsang, W. W. 2000a. A simple method for generating
+ * gamma variables. ACM Transactions on Mathematical Software 26, 363–372.
+ * <http://oldmill.uchicago.edu/~wilder/Code/random/Papers/Marsaglia_00_SMGGV.pdf>
+ *
+ */
+static double marsaglia_tsang_gamma_internal (Rand_Type *rt, double c, double d)
+{
+ while (1)
+ {
+	double x, u, v;
+ do
+ {
+	 if (rt->one_available)
+	 {
+		 x = rt->g2;
+		 rt->one_available = 0;
+	 }
+	 else x = gaussian_box_muller (rt);
+	 v = 1.0 + c*x;
+ }
+ while (v <= 0.0);
+
+ v = v*v*v;
+ u = open_interval_random (rt);
+	x = x*x;
+
+ if ((u < 1.0 - 0.0331*(x*x))
+	 || (log (u) < 0.5*x + d*(1.0 - v + log (v))))
+ return d*v;
+ }
+}
+
+/* k > 0. theta > 0 */
+static double rand_gamma (Rand_Type *rt, double k, double theta)
+{
+ double c, d;
+
+#ifdef HAVE_ISNAN
+ if (isnan(k) || isnan(theta))
+ return k*theta;
+#endif
+
+ if (k < 1.0)
+ {
+	d = k + 2.0/3.0;
+	c = (1.0/3.0)/sqrt(d);
+	return theta * marsaglia_tsang_gamma_internal (rt, c, d)
+	 * pow (open_interval_random(rt), 1.0/k);
+ }
+
+ d = k - 1.0/3.0;
+ c = (1.0/3.0)/sqrt(d);
+ return theta * marsaglia_tsang_gamma_internal (rt, c, d);
+}
+
+static void generate_gamma_randoms (Rand_Type *rt, VOID_STAR ap,
+				 SLuindex_Type num, VOID_STAR parms)
+{
+ double *x = (double *)ap;
+ double *xmax = x + num;
+ double k, theta;
+ double c, d;
+
+ k = ((double *)parms)0;
+ theta = ((double *)parms)1;
+
+#ifdef HAVE_ISNAN
+ if (isnan(k) || isnan(theta))
+ {
+	while (x < xmax)
+	 *x++ = k*theta;
+	return;
+ }
+#endif
+
+ if (k < 1.0)
+ {
+	double kinv = 1.0/k;
+	d = k + 2.0/3.0;
+	c = (1.0/3.0)/sqrt(d);
+
+	while (x < xmax)
+	 {
+	 *x++ = theta * marsaglia_tsang_gamma_internal (rt, c, d)
+	 * pow (open_interval_random(rt), kinv);
+	 }
+	return;
+ }
+
+ d = k - 1.0/3.0;
+ c = (1.0/3.0)/sqrt(d);
+ while (x < xmax)
+ *x++ = theta * marsaglia_tsang_gamma_internal (rt, c, d);
+}
+
+/*}}}*/
+
+/*{{{ Beta Distribution */
+
+static double knuth_beta (Rand_Type *rt, double alpha, double beta)
+{
+ if (0.0 == (alpha = rand_gamma (rt, alpha, 1.0)))
+ return 0.0;
+
+ beta = rand_gamma (rt, beta, 1.0);
+
+ return alpha/(alpha+beta);
+}
+
+static void generate_beta_randoms (Rand_Type *rt, VOID_STAR ap,
+				 SLuindex_Type num, VOID_STAR parms)
+{
+ double *x = (double *)ap;
+ double *xmax = x + num;
+ double alpha, beta;
+
+ alpha = ((double *)parms)0;
+ beta = ((double *)parms)1;
+
+ while (x < xmax)
+ *x++ = knuth_beta (rt, alpha, beta);
+}
+
+/*}}}*/
+
+/*{{{ Binomial Distribution */
+
+/* This algorithm is from:
+ * Hormann, W. (1993), The generation of binomial random variates,
+ * Journal of Statistical Computation and Simulation 46, 101-110.
+ * I obtained it from the preprint, but not the actual journal article.
+ * The preprint contains a typo in the algorithm that I managed to
+ * find and correct. It pays to read the paper.
+ */
+
+typedef struct
+{
+ double a, b, c, vr, alpha, lpq, fm, h, p;
+ unsigned int n;
+}
+BTRS_Type;
+
+static void init_btrs (BTRS_Type *btrs, double p, unsigned int n)
+{
+ double spq = sqrt (n*p*(1.0-p));
+
+ btrs->p = p;
+ btrs->n = n;
+
+ btrs->b = 1.15 + 2.53*spq;
+ btrs->a = -0.0873 + 0.0248*btrs->b + 0.01*p;
+ btrs->c = n*p+0.5;
+ btrs->vr = 0.92 - 4.2/btrs->b;
+ btrs->alpha = (2.83+5.1/btrs->b) * spq;
+ btrs->lpq = log (p/(1.0-p));
+ btrs->fm = floor ((n+1)*p);
+ btrs->h = log_factorial (btrs->fm) + log_factorial(n-btrs->fm);
+}
+
+/* This algorithm assumes that p <= 0.5 and p*n >= 10.0 */
+static double binomial_btrs (Rand_Type *rt, BTRS_Type *btrs)
+{
+ double a = btrs->a;
+ double b = btrs->b;
+ double c = btrs->c;
+ double vr = btrs->vr;
+ double h = btrs->h;
+ double lpq = btrs->lpq;
+ double fm = btrs->fm;
+ double alpha = btrs->alpha;
+ unsigned int n = btrs->n;
+
+ while (1)
+ {
+	double u = open_interval_random (rt) - 0.5;
+	double v = open_interval_random (rt);
+	double us = 0.5 - fabs(u);
+	double fk = floor ((2.0*a/us + b)*u + c);
+
+	if ((fk < 0.0) || ((unsigned int) fk > n))
+	 continue;
+
+	if ((us >= 0.07) && (v <= vr))
+	 return (unsigned int) fk;
+
+	v = log (v*alpha/(a/(us*us) + b));
+	if (v <= (h - log_factorial(fk) - log_factorial(n-fk)
+		 + (fk-fm)*lpq))
+	 return (unsigned int) fk;
+ }
+}
+
+typedef struct
+{
+ unsigned int n;
+ double p;
+}
+Binomial_Parms_Type;
+
+static void generate_binomial_randoms (Rand_Type *rt, VOID_STAR ap,
+				 SLuindex_Type num, VOID_STAR parms)
+{
+ unsigned int *x = (unsigned int *)ap;
+ unsigned *xmax = x + num;
+ Binomial_Parms_Type *s = (Binomial_Parms_Type *)parms;
+ double p, qn, r, q, g;
+ unsigned int n;
+ int swapped = 0;
+
+ n = s->n;
+ p = s->p;
+
+ if (p > 0.5)
+ {
+	p = 1.0 - p;
+	swapped = 1;
+ }
+
+ if (n*p > 10.0)
+ {
+	BTRS_Type btrs;
+	init_btrs (&btrs, p, n);
+	if (swapped)
+	 {
+	 while (x < xmax)
+	 *x++ = n - binomial_btrs (rt, &btrs);
+	 }
+	else
+	 {
+	 while (x < xmax)
+	 *x++ = binomial_btrs (rt, &btrs);
+	 }
+	return;
+ }
+
+ /* Inverse CDF method (Adapted from RANLIB) */
+ q = 1.0 - p;
+ qn = pow (q, n);
+ r = p/q;
+ g = r*(n+1);
+ while (x < xmax)
+ {
+#define MAX_INV_BINOMIAL_CDF_LOOPS 110
+	double f = qn;
+	double u = uniform_random (rt);
+	unsigned int k = 0;
+	unsigned kmax = (n > MAX_INV_BINOMIAL_CDF_LOOPS
+			 ? MAX_INV_BINOMIAL_CDF_LOOPS : n);
+
+	while (k <= kmax)
+	 {
+	 if (u < f)
+	 {
+		 if (swapped)
+		 k = n - k;
+		 *x++ = k;
+		 break;
+	 }
+	 u -= f;
+	 k++;
+	 f *= (g/k - r);
+	 }
+ }
+}
+
+/*}}}*/
+
+static void generate_cauchy_randoms (Rand_Type *rt, VOID_STAR ap,
+				 SLuindex_Type num, VOID_STAR parms)
+{
+ double *x = (double *)ap;
+ double *xmax = x + num;
+ double a = *(double *)parms;
+
+ while (x < xmax)
+ {
+	double u;
+	do
+	 {
+	 u = uniform_random (rt);
+	 }
+	while (u == 0.5);
+	*x++ = a * tan (PI*u);
+ }
+}
+
+static void generate_geometric_randoms (Rand_Type *rt, VOID_STAR ap,
+					SLuindex_Type num, VOID_STAR parms)
+{
+ unsigned int *x = (unsigned int *)ap;
+ unsigned int *xmax = x + num;
+ double a = *(double *)parms;
+
+ if (a == 1.0)
+ {
+	while (x < xmax)
+	 *x++ = 1;
+	return;
+ }
+
+ a = 1.0 / log (1.0-a);	 /* is negative */
+
+ while (x < xmax)
+ *x++ = (unsigned int) (1.0 + a*log(open_interval_random (rt)));
+}
+
+/* Interpreter Interface */
+
+static Rand_Type *Default_Rand;
+static int Rand_Type_Id = -1;
+
+static int pop_seeds (unsigned long seedsNUM_SEEDS)
+{
+ SLang_Array_Type *at;
+ unsigned long *s;
+ SLuindex_Type i;
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_ULONG_TYPE))
+ return -1;
+
+ if (at->num_elements == 0)
+ {
+	SLang_verror (SL_InvalidParm_Error, "The seed array has no elements");
+	SLang_free_array (at);
+	return -1;
+ }
+
+ s = (unsigned long *)at->data;
+ i = 0;
+ while (i < NUM_SEEDS)
+ {
+	seedsi = *s;
+	i++;
+	if (i < at->num_elements)
+	 s++;
+ }
+ SLang_free_array (at);
+ return 0;
+}
+
+static void generate_seeds (unsigned long seedsNUM_SEEDS)
+{
+ unsigned int i;
+ unsigned long s = (unsigned long) time(NULL)*(unsigned long) getpid ();
+ for (i = 0; i < NUM_SEEDS; i++)
+ {
+	s = s*69069UL + 1013904243UL;
+	seedsi = s;
+ }
+}
+
+static void new_rand_intrin (void) /*{{{*/
+{
+ unsigned long seedsNUM_SEEDS;
+ Rand_Type *r;
+ SLang_MMT_Type *mmt;
+
+ if (SLang_Num_Function_Args == 1)
+ {
+	if (-1 == pop_seeds (seeds))
+	 return;
+ }
+ else generate_seeds (seeds);
+
+ if (NULL == (r = create_random (seeds)))
+ return;
+
+ if (NULL == (mmt = SLang_create_mmt (Rand_Type_Id, (VOID_STAR) r)))
+ {
+	free_random (r);
+	return;
+ }
+
+ if (0 == SLang_push_mmt (mmt))
+ return;
+
+ SLang_free_mmt (mmt);
+}
+
+/*}}}*/
+
+/*{{{ Utility Functions */
+
+static void destroy_rand_type (SLtype type, VOID_STAR vr)
+{
+ (void) type;
+ free_random ((Rand_Type *) vr);
+}
+
+static int pop_rand_type_and_dims (int argc, SLang_MMT_Type **mmtp,
+				 SLindex_Type *dims, unsigned int *ndims,
+				 int *is_scalarp)
+{
+ int type;
+ SLang_MMT_Type *mmt;
+
+ *mmtp = NULL;
+
+ switch (argc)
+ {
+ default:
+	SLang_verror (SL_NumArgs_Error, "Expecting 0, 1, or 2 arguments");
+	return -1;
+
+ case 0:
+	*is_scalarp = 1;
+	return 0;
+
+ case 1:
+	type = SLang_peek_at_stack ();
+	if (type == Rand_Type_Id)
+	 {
+	 if (NULL == (mmt = SLang_pop_mmt (Rand_Type_Id)))
+	 return -1;
+	 *is_scalarp = 1;
+	 *mmtp = mmt;
+	 return 0;
+ 	 }
+	break;
+
+ case 2:
+	type = SLang_peek_at_stack ();
+	break;
+ }
+
+ *is_scalarp = 0;
+
+ if (type != SLANG_ARRAY_TYPE)
+ {
+	if (-1 == SLang_pop_array_index (dims))
+	 return -1;
+
+	*ndims = 1;
+ }
+ else
+ {
+	SLang_Array_Type *at;
+	unsigned int i, imax;
+
+	if (-1 == SLang_pop_array (&at, 1))
+	 return -1;
+
+	*ndims = imax = at->num_dims;
+	for (i = 0; i < imax; i++)
+	 dimsi = at->dimsi;
+	SLang_free_array (at);
+ }
+
+ if (argc == 2)
+ {
+	if (NULL == (mmt = SLang_pop_mmt (Rand_Type_Id)))
+	 return -1;
+
+	*mmtp = mmt;
+ }
+ return 0;
+}
+
+static int do_xxxrand (int argc, SLtype type,
+		 void (*func)(Rand_Type *, VOID_STAR, SLuindex_Type, VOID_STAR),
+		 VOID_STAR parms,
+		 int *is_scalar_p, VOID_STAR scalar_addr)
+{
+ SLang_Array_Type *at;
+ SLindex_Type dims SLARRAY_MAX_DIMS;
+ unsigned int ndims;
+ SLang_MMT_Type *mmt;
+ Rand_Type *rt;
+ int is_scalar;
+ int status = -1;
+
+ if (-1 == pop_rand_type_and_dims (argc, &mmt, dims, &ndims, &is_scalar))
+ return -1;
+
+ if (mmt != NULL)
+ {
+	if (NULL == (rt = (Rand_Type *) SLang_object_from_mmt (mmt)))
+	 goto free_return;
+ }
+ else
+ rt = Default_Rand;
+
+ *is_scalar_p = is_scalar;
+
+ if (is_scalar)
+ {
+	(*func) (rt, scalar_addr, 1, parms);
+	status = 0;
+	goto free_return;
+ }
+
+ if (NULL == (at = SLang_create_array (type, 0, NULL, dims, ndims)))
+ goto free_return;
+
+ (*func) (rt, at->data, at->num_elements, parms);
+ status = SLang_push_array (at, 0);
+ SLang_free_array (at);
+ /* drop */
+
+ free_return:
+ if (mmt != NULL)
+ SLang_free_mmt (mmt);
+
+ return status;
+}
+
+/* The calling syntax for the generators is:
+ * rand_foo (Rand_Type, args... ,num);
+ */
+static int check_stack_args (int num_args, int num_parms, SLFUTURE_CONST char *usage, int *nargsp)
+{
+ if ((num_args < num_parms) || (num_args > num_parms + 2))
+ goto usage_error;
+
+ *nargsp = num_args - num_parms;
+
+ if ((num_args == num_parms) || (num_parms == 0))
+ return 0;			 /* rand_foo (parms...) */
+
+ if (num_args == num_parms + 2)
+ {
+	if (Rand_Type_Id != SLang_peek_at_stack_n (num_args-1))
+	 goto usage_error;
+
+	/* rand_foo (r, parms..., num) */
+ }
+ else if (Rand_Type_Id == SLang_peek_at_stack_n (num_args-1))
+ return 0;		 /* rand_foo (r, parms...) */
+
+ return SLroll_stack (num_parms + 1);
+
+usage_error:
+ SLang_verror (SL_Usage_Error, "Usage: %s", usage);
+ return -1;
+}
+
+/*}}}*/
+
+static void urand_intrin (void) /*{{{*/
+{
+ SLFUTURE_CONST char *usage = "r = rand_uniform (Rand_Type num)";
+ int is_scalar;
+ int nargs;
+ double d;
+
+ if (-1 == check_stack_args (SLang_Num_Function_Args, 0, usage, &nargs))
+ return;
+
+ if (-1 == do_xxxrand (nargs, SLANG_DOUBLE_TYPE,
+			 generate_random_doubles, NULL, &is_scalar, &d))
+ return;
+
+ if (is_scalar)
+ (void) SLang_push_double (d);
+}
+
+/*}}}*/
+
+static void urand_pos_intrin (void) /*{{{*/
+{
+ SLFUTURE_CONST char *usage = "r = rand_uniform_pos (Rand_Type num)";
+ int is_scalar;
+ int nargs;
+ double d;
+
+ if (-1 == check_stack_args (SLang_Num_Function_Args, 0, usage, &nargs))
+ return;
+
+ if (-1 == do_xxxrand (nargs, SLANG_DOUBLE_TYPE,
+			 generate_random_open_doubles, NULL, &is_scalar, &d))
+ return;
+
+ if (is_scalar)
+ (void) SLang_push_double (d);
+}
+
+/*}}}*/
+
+static void rand_intrin (void) /*{{{*/
+{
+ SLFUTURE_CONST char *usage = "r = rand (Rand_Type num)";
+ int is_scalar;
+ int nargs;
+ uint32 u;
+
+ if (-1 == check_stack_args (SLang_Num_Function_Args, 0, usage, &nargs))
+ return;
+
+ if (-1 == do_xxxrand (nargs, UINT32_TYPE,
+			 generate_random_uints, NULL, &is_scalar, &u))
+ return;
+ if (is_scalar)
+ (void) PUSH_UINT32 (u);
+}
+
+/*}}}*/
+
+static void rand_gauss_intrin (void) /*{{{*/
+{
+ SLFUTURE_CONST char *usage = "r = rand_gauss (Rand_Type, sigma ,num)";
+ int is_scalar;
+ double d, sigma;
+ int nargs;
+
+ if (-1 == check_stack_args (SLang_Num_Function_Args, 1, usage, &nargs))
+ return;
+
+ if (-1 == SLang_pop_double (&sigma))
+ return;
+ sigma = fabs(sigma);
+
+ if (-1 == do_xxxrand (nargs, SLANG_DOUBLE_TYPE,
+			 generate_gaussian_randoms, (VOID_STAR) &sigma,
+			 &is_scalar, &d))
+ return;
+ if (is_scalar)
+ (void) SLang_push_double (d);
+}
+
+/*}}}*/
+
+static void rand_beta_intrin (void) /*{{{*/
+{
+ SLFUTURE_CONST char *usage = "r = rand_beta (Rand_Type, a, b ,num)";
+ int is_scalar;
+ double d;
+ double parms2;
+ int nargs;
+
+ if (-1 == check_stack_args (SLang_Num_Function_Args, 2, usage, &nargs))
+ return;
+
+ if ((-1 == SLang_pop_double (parms+1))
+ || (-1 == SLang_pop_double (parms)))
+ return;
+
+ if ((parms0 <= 0.0) || (parms1 <= 0.0))
+ {
+	SLang_verror (SL_Domain_Error, "rand_beta parameters must be > 0");
+	return;
+ }
+
+ if (-1 == do_xxxrand (nargs, SLANG_DOUBLE_TYPE,
+			 generate_beta_randoms, (VOID_STAR) parms,
+			 &is_scalar, &d))
+ return;
+ if (is_scalar)
+ (void) SLang_push_double (d);
+}
+
+/*}}}*/
+
+static void rand_cauchy_intrin (void) /*{{{*/
+{
+ SLFUTURE_CONST char *usage = "r = rand_cauchy (Rand_Type, gamma, ,num)";
+ int is_scalar;
+ double d;
+ double a;
+ int nargs;
+
+ if (-1 == check_stack_args (SLang_Num_Function_Args, 1, usage, &nargs))
+ return;
+
+ if (-1 == SLang_pop_double (&a))
+ return;
+
+ a = fabs(a);
+
+ if (-1 == do_xxxrand (nargs, SLANG_DOUBLE_TYPE,
+			 generate_cauchy_randoms, (VOID_STAR) &a,
+			 &is_scalar, &d))
+ return;
+ if (is_scalar)
+ (void) SLang_push_double (d);
+}
+
+/*}}}*/
+
+static void rand_geometric_intrin (void) /*{{{*/
+{
+ SLFUTURE_CONST char *usage = "r = rand_geometric (Rand_Type, p, ,num)";
+ int is_scalar;
+ double p;
+ unsigned int d;
+ int nargs;
+
+ if (-1 == check_stack_args (SLang_Num_Function_Args, 1, usage, &nargs))
+ return;
+
+ if (-1 == SLang_pop_double (&p))
+ return;
+
+ if ((p < 0.0) || (p > 1.0))
+ {
+	SLang_verror (SL_Domain_Error, "rand_geometric parameter must be beteen 0 and 1");
+	return;
+ }
+
+ if (-1 == do_xxxrand (nargs, SLANG_UINT_TYPE,
+			 generate_geometric_randoms, (VOID_STAR) &p,
+			 &is_scalar, &d))
+ return;
+ if (is_scalar)
+ (void) SLang_push_uint (d);
+}
+
+/*}}}*/
+
+static void rand_poisson_intrin (void) /*{{{*/
+{
+ SLFUTURE_CONST char *usage = "r = rand_poisson (Rand_Type, mu ,num)";
+ unsigned int p;
+ int is_scalar;
+ int nargs;
+ double mu;
+
+ if (-1 == check_stack_args (SLang_Num_Function_Args, 1, usage, &nargs))
+ return;
+
+ if (-1 == SLang_pop_double (&mu))
+ return;
+
+ if (mu < 0.0)
+ SLang_verror (SL_InvalidParm_Error, "The poisson rate must be non-negative");
+
+ if (-1 == do_xxxrand (nargs, SLANG_UINT_TYPE,
+			 generate_poisson_randoms, (VOID_STAR) &mu,
+			 &is_scalar, &p))
+ return;
+
+ if (is_scalar)
+ (void) SLang_push_uint (p);
+}
+
+/*}}}*/
+
+static void rand_gamma_intrin (void) /*{{{*/
+{
+ SLFUTURE_CONST char *usage = "r = rand_gamma(Rand_Type, k, theta ,num)";
+ int is_scalar, nargs;
+ double parms2;
+ double p, k, theta;
+
+ if (-1 == check_stack_args (SLang_Num_Function_Args, 2, usage, &nargs))
+ return;
+
+ if ((-1 == SLang_pop_double (&theta))
+ || (-1 == SLang_pop_double (&k)))
+ return;
+
+ if ((theta <= 0) || (k <= 0))
+ {
+	SLang_verror (SL_InvalidParm_Error, "rand_gamma assumes k,theta>0");
+	return;
+ }
+ parms0 = k;
+ parms1 = theta;
+
+ if (-1 == do_xxxrand (nargs, SLANG_DOUBLE_TYPE,
+			 generate_gamma_randoms, (VOID_STAR) parms,
+			 &is_scalar, &p))
+ return;
+
+ if (is_scalar)
+ (void) SLang_push_double (p);
+}
+
+/*}}}*/
+
+static void rand_binomial_intrin (void) /*{{{*/
+{
+ SLFUTURE_CONST char *usage = "r = rand_binomial (Rand_Type, p, n ,num)";
+ int is_scalar, nargs;
+ Binomial_Parms_Type bp;
+ unsigned int u;
+ int n;
+
+ if (-1 == check_stack_args (SLang_Num_Function_Args, 2, usage, &nargs))
+ return;
+
+ if ((-1 == SLang_pop_int (&n))
+ || (-1 == SLang_pop_double (&bp.p)))
+ return;
+
+ if ((n < 0) || (bp.p < 0.0) || (bp.p > 1.0))
+ {
+	SLang_verror (SL_InvalidParm_Error, "rand_binomial assumes 0<=p<=1 and n>=0");
+	return;
+ }
+ bp.n = (unsigned int)n;
+
+ if (-1 == do_xxxrand (nargs, SLANG_UINT_TYPE,
+			 generate_binomial_randoms, (VOID_STAR) &bp,
+			 &is_scalar, &u))
+ return;
+
+ if (is_scalar)
+ (void) SLang_push_uint (u);
+}
+
+/*}}}*/
+
+static void srand_intrin (void) /*{{{*/
+{
+ SLang_MMT_Type *mmt = NULL;
+ Rand_Type *r = Default_Rand;
+ unsigned long seedsNUM_SEEDS;
+ int nargs = SLang_Num_Function_Args;
+
+ if (-1 == pop_seeds (seeds))
+ return;
+
+ if (nargs == 2)
+ {
+	if (NULL == (mmt = SLang_pop_mmt (Rand_Type_Id)))
+	 return;
+	r = (Rand_Type *)SLang_object_from_mmt (mmt);
+ }
+
+ if (r != NULL)
+ seed_random (r, seeds);
+
+ if (mmt != NULL)
+ SLang_free_mmt (mmt);
+}
+
+/*}}}*/
+
+static void rand_permutation_intrin (void)
+{
+ int nargs = SLang_Num_Function_Args;
+ Rand_Type *rt = Default_Rand;
+ SLang_MMT_Type *mmt = NULL;
+ SLang_Array_Type *at = NULL;
+ int *data;
+ SLindex_Type i, n;
+
+ switch (nargs)
+ {
+ default:
+	SLang_verror (SL_Usage_Error, "Usage: p = rand_permutation(Rand_Type,, n)");
+	return;
+
+ case 2:
+ case 1:
+	if (-1 == SLang_pop_array_index (&n))
+	 return;
+	if (nargs == 2)
+	 {
+	 if (NULL == (mmt = SLang_pop_mmt (Rand_Type_Id)))
+	 return;
+
+	 if (NULL == (rt = (Rand_Type *) SLang_object_from_mmt (mmt)))
+	 goto free_return;
+	 }
+ }
+
+ if (n < 0)
+ {
+	SLang_verror (SL_InvalidParm_Error, "rand_permutation: expected n>=0");
+	goto free_return;
+ }
+
+ if (NULL == (at = SLang_create_array (SLANG_INT_TYPE, 0, NULL, &n, 1)))
+ goto free_return;
+
+ data = (int *) at->data;
+ for (i = 0; i < n; i++)
+ datai = i;
+
+ /* Fisher-Yates */
+ while (n > 1)
+ {
+	int k, p;
+
+	k = (int) (n*uniform_random (rt)); /* 0 <= k < n */
+	n--;
+	p = datan;
+	datan = datak;
+	datak = p;
+ }
+
+ (void) SLang_push_array (at, 0);
+
+free_return:
+ if (at != NULL)
+ SLang_free_array (at);
+ if (mmt != NULL)
+ SLang_free_mmt (mmt);
+}
+
+static SLang_Intrin_Fun_Type Module_Intrinsics =
+{
+ MAKE_INTRINSIC_0("rand", rand_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("srand", srand_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("rand_uniform", urand_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("rand_uniform_pos", urand_pos_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("rand_gauss", rand_gauss_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("rand_poisson", rand_poisson_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("rand_gamma", rand_gamma_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("rand_binomial", rand_binomial_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("rand_beta", rand_beta_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("rand_cauchy", rand_cauchy_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("rand_geometric", rand_geometric_intrin, SLANG_VOID_TYPE),
+
+ MAKE_INTRINSIC_0("rand_permutation", rand_permutation_intrin, SLANG_VOID_TYPE),
+
+ MAKE_INTRINSIC_0("rand_new", new_rand_intrin, SLANG_VOID_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+int init_rand_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if (Default_Rand == NULL)
+ {
+	unsigned long seedsNUM_SEEDS;
+	generate_seeds (seeds);
+	Default_Rand = create_random (seeds);
+	if (Default_Rand == NULL)
+	 return -1;
+
+	init_poisson ();
+ }
+
+ if (Rand_Type_Id == -1)
+ {
+	SLang_Class_Type *cl;
+
+	if (NULL == (cl = SLclass_allocate_class ("Rand_Type")))
+	 return -1;
+
+	(void) SLclass_set_destroy_function (cl, destroy_rand_type);
+
+	if (-1 == SLclass_register_class (cl, SLANG_VOID_TYPE,
+					 sizeof (Rand_Type),
+					 SLANG_CLASS_TYPE_MMT))
+	 return -1;
+
+	Rand_Type_Id = SLclass_get_class_id (cl);
+ }
+
+ if (-1 == SLns_add_intrin_fun_table (ns, Module_Intrinsics, NULL))
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_rand_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/rand.sl Added

@@ -0,0 +1,204 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+import ("rand");
+
+private define get_generator_args (nargs, num_parms, parmsp, rtp, nump,
+				 usage_str)
+{
+ @rtp = NULL;
+ @nump = NULL;
+ if (nargs == num_parms)
+ {
+	@parmsp = __pop_list (num_parms);
+	return;
+ }
+
+ if (nargs == num_parms + 1)
+ {
+	@nump = ();
+	variable parms = __pop_list (num_parms);
+	if (typeof (parms0) == Rand_Type)
+	 {
+	 @rtp = list_pop (parms);
+	 list_append (parms, @nump);
+	 @nump = NULL;
+	 }
+	@parmsp = parms;
+	return;
+ }
+
+ if (nargs == num_parms + 2)
+ {
+	@nump = ();
+	@parmsp = __pop_list (num_parms);
+	variable rt = ();
+	if (typeof (rt) == Rand_Type)
+	 {
+	 @rtp = rt;
+	 return;
+	 }
+ }
+ else _pop_n (nargs);
+
+ usage (usage_str);
+}
+
+private define call_rand_func ()
+{
+ variable num = ();
+ variable args = __pop_list (_NARGS-3);
+ variable rt, func;
+ (func, rt) = ();
+
+ if (rt == NULL)
+ {
+	if (num == NULL)
+	 return (@func) (__push_list(args));
+
+	return (@func) (__push_list(args), num);
+ }
+
+ if (num == NULL)
+ return (@func)(rt, __push_list(args));
+
+ return (@func)(rt, __push_list(args), num);
+}
+
+define rand_flat ()
+{
+ variable parms, rt, num;
+
+ get_generator_args (_NARGS, 2, &parms, &rt, &num,
+		 "r = rand_flat (Rand_Type, xmin, xmax ,num)");
+
+ variable r = call_rand_func (&rand_uniform, rt, num);
+
+ return parms0 + (parms1 - parms0)*__tmp(r);
+}
+
+define rand_chisq ()
+{
+ variable parms, rt, num;
+
+ get_generator_args (_NARGS, 1, &parms, &rt, &num,
+		 "r = rand_chisq (Rand_Type, nu ,num)");
+ return 2.0 * call_rand_func (&rand_gamma, rt, 0.5*parms0, 1.0, num);
+}
+
+define rand_fdist ()
+{
+ variable parms, rt, num;
+
+ get_generator_args (_NARGS, 2, &parms, &rt, &num,
+		 "r = rand_fdist (Rand_Type, nu1, nu2 ,num)");
+ variable nu1 = parms0, nu2 = parms1;
+
+ return (call_rand_func (&rand_gamma, rt, 0.5*nu1, 1.0, num)/nu1)
+ / (call_rand_func(&rand_gamma, rt, 0.5*nu2, 1.0, num)/nu2);
+}
+
+define rand_tdist ()
+{
+ variable parms, rt, num;
+
+ get_generator_args (_NARGS, 1, &parms, &rt, &num,
+		 "r = rand_tdist (Rand_Type, nu, ,num)");
+ variable nu = parms0;
+ return call_rand_func (&rand_gauss, rt, 1.0, num)
+ / sqrt(call_rand_func(&rand_chisq, rt, nu, num)/nu);
+}
+
+define rand_int ()
+{
+ variable parms, rt, num;
+
+ get_generator_args (_NARGS, 2, &parms, &rt, &num,
+		 "r = rand_int (Rand_Type, imin, imax ,num)");
+
+ variable
+ imin = typecast (parms0, Int32_Type),
+ imax = typecast (parms1, Int32_Type), di;
+
+ if (imin > imax)
+ throw InvalidParmError, "rand_int: imax < imin";
+
+ di = typecast (imax - imin, UInt32_Type);
+
+ variable r = call_rand_func (&rand, rt, num);
+
+ if (di + 1 != 0)		 % UINT32_MAX does not exist
+ r = __tmp(r) mod (di + 1);
+
+ return typecast (imin + r, Int32_Type);
+}
+
+define rand_exp ()
+{
+ variable parms, rt, num;
+
+ get_generator_args (_NARGS, 1, &parms, &rt, &num,
+		 "r = rand_exp (Rand_Type, beta ,num)");
+
+ return (-parms0) * log (call_rand_func (&rand_uniform_pos, rt, num));
+}
+
+private define make_indices (a, d, i)
+{
+ _for (0, length(array_shape(a))-1, 1)
+ {
+	variable j = ();
+	if (j == d)
+	 i;
+	else
+	 :;
+ }
+}
+
+define rand_sample ()
+{
+ if (_NARGS < 2)
+ {
+	_pop_n (_NARGS);
+	usage ("(B1 ,B2,...) = rand_sample (Rand_Type, A1 A2,..., num)");
+ }
+
+ variable num = ();
+ variable arrays = __pop_list (_NARGS-1);
+ variable rt = NULL;
+
+ if (typeof (arrays0) == Rand_Type)
+ rt = list_pop (arrays);
+
+ variable n0 = NULL, dim0;
+ variable a, indices;
+
+ foreach a (arrays)
+ {
+	dim0 = array_shape (a)0;
+	if (n0 == NULL)
+	 {
+	 n0 = dim0;
+	 continue;
+	 }
+	if (n0 != dim0)
+	 throw TypeMismatchError, "The arrays passed to rand_sample must have the same leading dimension";
+ }
+
+ if (num > n0)
+ num = n0;
+
+ if (rt == NULL)
+ indices = rand_permutation (n0);
+ else
+ indices = rand_permutation (rt, n0);
+ if (num < n0)
+ indices = indices0:num-1;
+
+ foreach a (arrays)
+ amake_indices(a, 0, indices);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/select-module.c Added

@@ -0,0 +1,243 @@
+/* Copyright (c) 2010-2017,2018 John E. Davis
+ * This file is part of the S-Lang library.
+ *
+ * You may distribute under the terms of the GNU General Public
+ * License.
+ */
+#include <stdio.h>
+#include <slang.h>
+
+#include <sys/time.h>
+#include <sys/types.h>
+#include <unistd.h>
+#include <string.h>
+#include <errno.h>
+
+SLANG_MODULE(select);
+
+static int pop_fd_set (SLang_Array_Type **ats,
+		 fd_set **fd_set_p, fd_set *fd_set_buf,
+		 int *max_n)
+{
+ SLuindex_Type num, i;
+ SLang_Array_Type *at;
+ SLFile_FD_Type **f;
+
+ *ats = NULL;
+ *fd_set_p = NULL;
+
+ if (SLang_peek_at_stack () == SLANG_NULL_TYPE)
+ return SLang_pop_null ();
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_FILE_FD_TYPE))
+ return -1;
+
+ FD_ZERO(fd_set_buf);
+ *fd_set_p = fd_set_buf;
+
+ *ats = at;
+ num = at->num_elements;
+ f = (SLFile_FD_Type **) at->data;
+
+ for (i = 0; i < num; i++)
+ {
+	int fd;
+
+	if (-1 == SLfile_get_fd (fi, &fd))
+	 continue;
+
+	if (fd > *max_n)
+	 *max_n = fd;
+
+	FD_SET(fd, fd_set_buf);
+ }
+
+ return 0;
+}
+
+static SLang_Array_Type *do_fdisset (int nready, SLang_Array_Type *fds, fd_set *fdset)
+{
+ SLang_Array_Type *at;
+ int i, num;
+ SLFile_FD_Type **f;
+ SLindex_Type ind_nready;
+
+ if (fds == NULL)
+ nready = 0;
+
+ if (nready)
+ {
+	nready = 0;
+	num = fds->num_elements;
+	f = (SLFile_FD_Type **) fds->data;
+	for (i = 0; i < num; i++)
+	 {
+	 int fd;
+
+	 if (-1 == SLfile_get_fd (fi, &fd))
+	 continue;
+
+	 if (FD_ISSET(fd, fdset))
+	 nready++;
+	 }
+ }
+
+ ind_nready = (SLindex_Type) nready;
+ at = SLang_create_array (SLANG_INT_TYPE, 0, NULL, &ind_nready, 1);
+ if (at == NULL)
+ return NULL;
+
+ if (nready)
+ {
+	int *indx = (int *) at->data;
+	f = (SLFile_FD_Type **) fds->data;
+	num = fds->num_elements;
+	for (i = 0; i < num; i++)
+	 {
+	 int fd;
+
+	 if (-1 == SLfile_get_fd (fi, &fd))
+	 continue;
+
+	 if (FD_ISSET(fd, fdset))
+	 *indx++ = (int) i;
+	 }
+ }
+
+ return at;
+}
+
+static int push_select_struct (int num,
+			 SLang_Array_Type *at_read,
+			 SLang_Array_Type *at_write,
+			 SLang_Array_Type *at_except,
+			 fd_set *readfs, fd_set *writefds, fd_set *exceptfds)
+{
+ SLFUTURE_CONST char *field_names 4;
+ SLtype field_types4;
+ VOID_STAR field_values 4;
+ SLang_Array_Type *iread, *iwrite, *iexcept;
+ int status;
+
+ iread = iwrite = iexcept = NULL;
+
+ field_names0 = "nready";
+ field_names1 = "iread";
+ field_names2 = "iwrite";
+ field_names3 = "iexcept";
+ field_types0 = SLANG_INT_TYPE;
+ field_types1 = SLANG_ARRAY_TYPE;
+ field_types2 = SLANG_ARRAY_TYPE;
+ field_types3 = SLANG_ARRAY_TYPE;
+ field_values0 = &num;
+
+ if ((NULL == (iread = do_fdisset (num, at_read, readfs)))
+ || (NULL == (iwrite = do_fdisset (num, at_write, writefds)))
+ || (NULL == (iexcept = do_fdisset (num, at_except, exceptfds))))
+ {
+	SLang_free_array (iread);
+	SLang_free_array (iwrite);
+	return -1;
+ }
+
+ field_values1 = &iread;
+ field_values2 = &iwrite;
+ field_values3 = &iexcept;
+
+ /* Note: This function call pushes the struct and frees it upon error. */
+ status = SLstruct_create_struct (4, field_names, field_types, field_values);
+ SLang_free_array (iexcept);
+ SLang_free_array (iwrite);
+ SLang_free_array (iread);
+ return status;
+}
+
+/* Usage: Struct_Type select (R,W,E,TIME) */
+
+static void select_intrin (double *secsp)
+{
+ SLang_Array_Type *at_read, *at_write, *at_except;
+ fd_set readfs_buf, writefds_buf, exceptfds_buf;
+ fd_set readfs_save_buf, writefds_save_buf, exceptfds_save_buf;
+ fd_set *readfs, *writefds, *exceptfds;
+ struct timeval tv, *tv_ptr;
+ double secs;
+ int ret, n;
+
+ secs = *secsp;
+ if (secs < 0.0) tv_ptr = NULL;
+ else
+ {
+	tv.tv_sec = (unsigned long) secs;
+	tv.tv_usec = (unsigned long) ((secs - tv.tv_sec) * 1e6);
+	tv_ptr = &tv;
+ }
+
+ n = 0;
+ if (-1 == pop_fd_set (&at_except, &exceptfds, &exceptfds_buf, &n))
+ return;
+ if (-1 == pop_fd_set (&at_write, &writefds, &writefds_buf, &n))
+ {
+	SLang_free_array (at_except);
+	return;
+ }
+ if (-1 == pop_fd_set (&at_read, &readfs, &readfs_buf, &n))
+ goto free_return;
+
+ readfs_save_buf = readfs_buf;
+ writefds_save_buf = writefds_buf;
+ exceptfds_save_buf = exceptfds_buf;
+
+ n += 1;
+ while (-1 == (ret = select (n, readfs, writefds, exceptfds, tv_ptr)))
+ {
+#ifdef EINTR
+	if (errno == EINTR)
+	 {
+	 readfs_buf = readfs_save_buf;
+	 writefds_buf = writefds_save_buf;
+	 exceptfds_buf = exceptfds_save_buf;
+	 if (0 == SLang_handle_interrupt ())
+	 continue;
+	 }
+#endif
+	(void) SLerrno_set_errno (errno);
+	break;
+ }
+
+ if (ret == -1)
+ (void) SLang_push_null ();
+ else
+ (void) push_select_struct (ret, at_read, at_write, at_except,
+				readfs, writefds, exceptfds);
+
+ free_return:
+ SLang_free_array (at_read);
+ SLang_free_array (at_write);
+ SLang_free_array (at_except);
+}
+
+static SLang_Intrin_Fun_Type Select_Intrinsics =
+{
+ MAKE_INTRINSIC_1("select", select_intrin, SLANG_VOID_TYPE, SLANG_DOUBLE_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+int init_select_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns;
+
+ ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if (-1 == SLns_add_intrin_fun_table (ns, Select_Intrinsics, "__SELECT__"))
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_select_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/select.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/slsmg-module.c Added

@@ -0,0 +1,367 @@
+/* This module implements an interface to the SLang SMG routines */
+/* -*- mode: C; mode: fold -*-
+Copyright (C) 2010-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include <stdio.h>
+#include <stdlib.h>
+#include <slang.h>
+
+SLANG_MODULE(slsmg);
+
+/* If this is +1, the then it is ok to call the SLsmg routines. If it is
+ * 0, then only SLsmg_init_smg may be called. If it is -1, then SLsmg is
+ * suspended and one must call SLsmg_resume_smg.
+ */
+
+static int Smg_Initialized;
+
+#ifndef IBMPC_SYSTEM
+static void smg_write_to_status_line (char *s)
+{
+ if (Smg_Initialized <= 0)
+ return;
+
+ (void) SLtt_write_to_status_line (s, 0);
+}
+#endif
+
+static void smg_suspend_smg (void)
+{
+ if (Smg_Initialized <= 0)
+ return;
+
+ (void) SLsmg_suspend_smg ();
+ Smg_Initialized = -1;
+}
+
+static void smg_resume_smg (void)
+{
+ if (Smg_Initialized != -1)
+ return;
+
+ (void) SLsmg_resume_smg ();
+ Smg_Initialized = 1;
+}
+
+static void smg_erase_eol (void)
+{
+ if (Smg_Initialized <= 0)
+ return;
+ SLsmg_erase_eol ();
+}
+
+static void smg_gotorc (int *r, int *c)
+{
+ if (Smg_Initialized <= 0)
+ return;
+ SLsmg_gotorc (*r, *c);
+}
+
+static void smg_erase_eos (void)
+{
+ if (Smg_Initialized <= 0)
+ return;
+ SLsmg_erase_eos ();
+}
+
+static void smg_reverse_video (void)
+{
+ if (Smg_Initialized <= 0)
+ return;
+ SLsmg_reverse_video ();
+}
+
+static void smg_set_color (int *c)
+{
+ if (Smg_Initialized <= 0)
+ return;
+ SLsmg_set_color (*c);
+}
+
+static void smg_normal_video (void)
+{
+ if (Smg_Initialized <= 0)
+ return;
+ SLsmg_normal_video ();
+}
+
+static void smg_write_string (char *s)
+{
+ if (Smg_Initialized <= 0)
+ return;
+ SLsmg_write_string (s);
+}
+
+static void smg_write_nstring (char *s, int *len)
+{
+ if ((Smg_Initialized <= 0)
+ || (*len < 0))
+ return;
+
+ SLsmg_write_nstring (s, (unsigned int) *len);
+}
+
+static void smg_write_wrapped_string (char *s, int *r, int *c, int *dr, int *dc,
+				 int *fill)
+{
+ if (Smg_Initialized <= 0)
+ return;
+
+ SLsmg_write_wrapped_string ((SLuchar_Type *)s, *r, *c, *dr, *dc, *fill);
+}
+
+static int smg_char_at (void)
+{
+ SLsmg_Char_Type c;
+ if (Smg_Initialized <= 0) return -1;
+
+ if (-1 == SLsmg_char_at (&c))
+ return 0;
+
+ if (c.nchars == 0)
+ return 0;
+
+ return (int) c.wchars0;
+}
+
+static void smg_set_screen_start (int *rp, int *cp)
+{
+ int r, c;
+
+ if (Smg_Initialized <= 0) return;
+ r = *rp;
+ c = *cp;
+ SLsmg_set_screen_start (&r, &c);
+}
+
+static void smg_draw_hline (int *dn)
+{
+ if (Smg_Initialized <= 0)
+ return;
+
+ SLsmg_draw_hline (*dn);
+}
+
+static void smg_draw_vline (int *dn)
+{
+ if (Smg_Initialized <= 0)
+ return;
+
+ SLsmg_draw_vline (*dn);
+}
+
+static void smg_draw_object (int *r, int *c, int *obj)
+{
+ if (Smg_Initialized <= 0) return;
+ SLsmg_draw_object (*r, *c, *obj);
+}
+
+static void smg_draw_box (int *r, int *c,int *dr, int *dc)
+{
+ if (Smg_Initialized <= 0) return;
+ SLsmg_draw_box (*r, *c, *dr, *dc);
+}
+
+static int smg_get_column (void)
+{
+ if (Smg_Initialized <= 0) return -1;
+ return SLsmg_get_column();
+}
+
+static int smg_get_row (void)
+{
+ if (Smg_Initialized <= 0) return -1;
+ return SLsmg_get_row();
+}
+
+static void smg_forward (int *n)
+{
+ if (Smg_Initialized <= 0) return;
+ SLsmg_forward (*n);
+}
+
+static void smg_set_color_in_region (int *color, int *r, int *c, int *dr, int *dc)
+{
+ if (Smg_Initialized <= 0) return;
+ SLsmg_set_color_in_region (*color, *r, *c, *dr, *dc);
+}
+
+static void smg_cls (void)
+{
+ if (Smg_Initialized <= 0)
+ return;
+ SLsmg_cls ();
+}
+
+static void smg_refresh (void)
+{
+ if (Smg_Initialized <= 0)
+ return;
+ SLsig_block_signals ();
+ SLsmg_refresh ();
+ SLsig_unblock_signals ();
+}
+
+static void smg_reset_smg (void)
+{
+ if (Smg_Initialized <= 0)
+ return;
+ SLsig_block_signals ();
+ SLsmg_reset_smg ();
+ SLsig_unblock_signals ();
+ Smg_Initialized = 0;
+}
+
+static void smg_init_smg (void)
+{
+ if (Smg_Initialized != 0)
+ return;
+ SLsig_block_signals ();
+ (void) SLsmg_init_smg ();
+ SLsig_unblock_signals ();
+ Smg_Initialized = 1;
+}
+
+static void smg_define_color (int *obj, char *fg, char *bg)
+{
+ SLtt_set_color (*obj, NULL, fg, bg);
+}
+
+#define I SLANG_INT_TYPE
+#define S SLANG_STRING_TYPE
+static SLang_Intrin_Fun_Type Smg_Intrinsics =
+{
+ MAKE_INTRINSIC_0("slsmg_suspend_smg", smg_suspend_smg, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("slsmg_resume_smg", smg_resume_smg, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("slsmg_erase_eol", smg_erase_eol, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_II("slsmg_gotorc", smg_gotorc, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("slsmg_erase_eos", smg_erase_eos, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("slsmg_reverse_video", smg_reverse_video, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_I("slsmg_set_color", smg_set_color, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("slsmg_normal_video", smg_normal_video, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("slsmg_write_string", smg_write_string, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("slsmg_cls", smg_cls, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("slsmg_refresh", smg_refresh, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("slsmg_reset_smg", smg_reset_smg, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("slsmg_init_smg", smg_init_smg, SLANG_VOID_TYPE),
+
+ MAKE_INTRINSIC_SI("slsmg_write_nstring", smg_write_nstring, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_6("slsmg_write_wrapped_string", smg_write_wrapped_string, SLANG_VOID_TYPE, S,I,I,I,I,I),
+ MAKE_INTRINSIC_0("slsmg_char_at", smg_char_at, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_II("slsmg_set_screen_start", smg_set_screen_start, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_I("slsmg_draw_hline", smg_draw_hline, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_I("slsmg_draw_vline", smg_draw_vline, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_III("slsmg_draw_object", smg_draw_object, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_4("slsmg_draw_box", smg_draw_box, SLANG_VOID_TYPE,I,I,I,I),
+ MAKE_INTRINSIC_0("slsmg_get_column", smg_get_column, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_0("slsmg_get_row", smg_get_row, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_I("slsmg_forward", smg_forward, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_5("slsmg_set_color_in_region", smg_set_color_in_region, SLANG_VOID_TYPE, I, I, I, I, I),
+
+ MAKE_INTRINSIC_ISS("slsmg_define_color", smg_define_color, SLANG_VOID_TYPE),
+#ifndef IBMPC_SYSTEM
+ MAKE_INTRINSIC_S("slsmg_write_to_status_line", smg_write_to_status_line, SLANG_VOID_TYPE),
+#endif
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static SLang_IConstant_Type Smg_Constants =
+{
+ MAKE_ICONSTANT("SLSMG_NEWLINE_IGNORED", SLSMG_NEWLINE_IGNORED),
+ MAKE_ICONSTANT("SLSMG_NEWLINE_MOVES", SLSMG_NEWLINE_MOVES),
+ MAKE_ICONSTANT("SLSMG_NEWLINE_SCROLLS", SLSMG_NEWLINE_SCROLLS),
+ MAKE_ICONSTANT("SLSMG_NEWLINE_PRINTABLE", SLSMG_NEWLINE_PRINTABLE),
+
+ MAKE_ICONSTANT("SLSMG_HLINE_CHAR", SLSMG_HLINE_CHAR),
+ MAKE_ICONSTANT("SLSMG_VLINE_CHAR", SLSMG_VLINE_CHAR),
+ MAKE_ICONSTANT("SLSMG_ULCORN_CHAR", SLSMG_ULCORN_CHAR),
+ MAKE_ICONSTANT("SLSMG_URCORN_CHAR", SLSMG_URCORN_CHAR),
+ MAKE_ICONSTANT("SLSMG_LLCORN_CHAR", SLSMG_LLCORN_CHAR),
+ MAKE_ICONSTANT("SLSMG_LRCORN_CHAR", SLSMG_LRCORN_CHAR),
+ MAKE_ICONSTANT("SLSMG_CKBRD_CHAR", SLSMG_CKBRD_CHAR),
+ MAKE_ICONSTANT("SLSMG_RTEE_CHAR", SLSMG_RTEE_CHAR),
+ MAKE_ICONSTANT("SLSMG_LTEE_CHAR", SLSMG_LTEE_CHAR),
+ MAKE_ICONSTANT("SLSMG_UTEE_CHAR", SLSMG_UTEE_CHAR),
+ MAKE_ICONSTANT("SLSMG_DTEE_CHAR", SLSMG_DTEE_CHAR),
+ MAKE_ICONSTANT("SLSMG_PLUS_CHAR", SLSMG_PLUS_CHAR),
+
+ SLANG_END_ICONST_TABLE
+};
+#undef I
+#undef S
+
+int init_slsmg_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns;
+ static int inited = 0;
+
+ if (inited == 0)
+ {
+#if defined(VMS) || defined(REAL_UNIX_SYSTEM)
+	int status;
+	char *term = getenv ("TERM");
+
+	if (term == NULL)
+	 {
+	 SLang_verror (SL_Application_Error, "The TERM environment variable is not set");
+	 return -1;
+	 }
+	status = SLtt_initialize (term);
+	if (status == -1)
+	 {
+	 SLang_verror (SL_RunTime_Error, "Cannot deduce properties for '%s' terminal", term);
+	 return -1;
+	 }
+	if (status < 0)
+	 {
+	 SLang_verror (SL_RunTime_Error, "The terminal '%s' lacks sufficient capabilities for controlling it", term);
+	 return -1;
+	 }
+#else
+	SLtt_get_terminfo ();
+#endif
+	inited = 1;
+ }
+
+ ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if ((-1 == SLns_add_intrin_fun_table (ns, Smg_Intrinsics, "__SLSMG__"))
+ || (-1 == SLns_add_iconstant_table (ns, Smg_Constants, NULL)))
+ return -1;
+
+ if ((-1 == SLns_add_intrinsic_variable(ns, "SLsmg_Display_Eight_Bit", (VOID_STAR)&SLsmg_Display_Eight_Bit, SLANG_INT_TYPE, 0))
+ || (-1 == SLns_add_intrinsic_variable(ns, "SLsmg_Tab_Width", (VOID_STAR)&SLsmg_Tab_Width, SLANG_INT_TYPE, 0))
+ || (-1 == SLns_add_intrinsic_variable(ns, "SLsmg_Newline_Behavior", (VOID_STAR)&SLsmg_Newline_Behavior, SLANG_INT_TYPE, 0))
+ || (-1 == SLns_add_intrinsic_variable(ns, "SLsmg_Backspace_Moves", (VOID_STAR)&SLsmg_Backspace_Moves, SLANG_INT_TYPE, 0))
+ || (-1 == SLns_add_intrinsic_variable(ns, "SLsmg_Screen_Rows", (VOID_STAR)&SLtt_Screen_Rows, SLANG_INT_TYPE, 0))
+ || (-1 == SLns_add_intrinsic_variable(ns, "SLsmg_Screen_Cols", (VOID_STAR)&SLtt_Screen_Cols, SLANG_INT_TYPE, 0)))
+ return -1;
+
+ Smg_Initialized = 0;
+ return 0;
+}
+
+/* This function is optional */
+void deinit_slsmg_module (void)
+{
+ smg_reset_smg ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/slsmg.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/socket-module.c Added

@@ -0,0 +1,1600 @@
+/* -*- mode: C; mode: fold; -*- */
+/*
+ Copyright (C) 2006-2017,2018 John E. Davis
+ *
+ This file is part of the S-Lang Library.
+ *
+ The S-Lang Library 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 2 of the
+ License, or (at your option) any later version.
+ *
+ The S-Lang Library 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 library; if not, write to the Free Software
+ Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+ USA.
+ */
+
+/* This file was derived from the code in SLtcp.c distributed with slsh */
+
+/*{{{ Include Files */
+
+#define _BSD_SOURCE 1		 /* to get struct ip_mreq */
+#define _DEFAULT_SOURCE 1
+#include "config.h"
+#include <stdio.h>
+#include <string.h>
+
+#include <stdlib.h>
+#include <unistd.h>
+
+#include <errno.h>
+#include <ctype.h>
+#include <stdarg.h>
+
+#include <setjmp.h>
+#include <signal.h>
+
+#include <sys/types.h>
+
+#include <time.h>
+#ifdef HAVE_SYS_TIME_H
+# include <sys/time.h>
+#endif
+
+#ifdef HAVE_SOCKET_H
+# include <socket.h>
+#endif
+
+#ifdef HAVE_SYS_SOCKET_H
+# include <sys/socket.h>
+#endif
+
+#if defined(__NT__)
+# include <winsock.h>
+# define USE_WINSOCK_SLTCP	1
+#else
+# if defined(__MINGW32__)
+# define Win32_Winsock
+# include <windows.h>
+# define USE_WINSOCK_SLTCP	1
+# endif
+#endif
+
+#ifdef USE_WINSOCK_SLTCP
+# define USE_WINSOCK_SLTCP	1
+#else
+# include <netdb.h>
+#endif
+
+#ifdef HAVE_SYS_UN_H
+# include <sys/un.h>		 /* for AF_UNIX sockets */
+#endif
+
+#ifdef HAVE_NETINET_IN_H
+# include <netinet/in.h>
+#endif
+
+#ifdef HAVE_ARPA_INET_H
+# include <arpa/inet.h>
+#endif
+
+#include <slang.h>
+SLANG_MODULE(socket);
+
+#ifndef h_errno
+extern int h_errno;
+#endif
+
+/*}}}*/
+
+static int SocketError = -1;
+static int SocketHerrnoError = -1;
+static int Socket_Type_Id = -1;
+
+typedef struct Socket_Type Socket_Type;
+typedef struct
+{
+ int domain;
+ int (*connect)(Socket_Type *, int);
+ int (*bind)(Socket_Type *, int);
+#define MAX_ACCEPT_REF_ARGS 4
+ Socket_Type *(*accept)(Socket_Type *, unsigned int, SLang_Ref_Type **);
+ void (*free_socket_data)(Socket_Type *);
+}
+Domain_Methods_Type;
+
+struct Socket_Type
+{
+ int fd;			 /* socket descriptor */
+ Domain_Methods_Type *methods;
+ VOID_STAR socket_data;
+ int domain;
+ int type;
+ int protocol;
+};
+
+static Socket_Type *create_socket (int, int, int, int);
+static void free_socket (Socket_Type *);
+static int close_socket (int);
+
+/*{{{ Generic Routines */
+
+static int Module_H_Errno = 0;
+
+static SLFUTURE_CONST char *herror_to_string (int h)
+{
+#ifdef HOST_NOT_FOUND
+ if (h == HOST_NOT_FOUND)
+ return "The specified host is unknown";
+#endif
+
+#ifdef NO_ADDRESS
+ if (h == NO_ADDRESS)
+ return "The requested name is valid but does not have an IP address";
+#endif
+
+#ifdef NO_DATA
+ if (h == NO_DATA)
+ return "The requested name is valid but does not have an IP address";
+#endif
+
+#ifdef NO_RECOVERY
+ if (h == NO_RECOVERY)
+ return "A non-recoverable name server error occurred";
+#endif
+
+#ifdef TRY_AGAIN
+ if (h == TRY_AGAIN)
+ return "A temporary error occurred on an authoritative name server. Try again later";
+#endif
+
+ return "Unknown h_error";
+}
+
+static void throw_herror (SLFUTURE_CONST char *what, int h)
+{
+ Module_H_Errno = h;
+ SLang_verror (SocketHerrnoError, "%s: %s", what, herror_to_string(h));
+}
+
+static void throw_errno_error (SLFUTURE_CONST char *what, int e)
+{
+ SLerrno_set_errno (e);
+ SLang_verror (SocketError, "%s: %s", what, SLerrno_strerror (e));
+}
+
+static int perform_connect (int fd, struct sockaddr *addr, unsigned int len, int throw_err)
+{
+ while (-1 == connect (fd, addr, len))
+ {
+#ifdef EINTR
+	if (errno == EINTR)
+	 {
+	 if (-1 == SLang_handle_interrupt ())
+	 return -1;
+	 continue;
+	 }
+#endif
+	/* The manpage indicates EAGAIN will be returned if no free ports exist.
+	 * So allow the caller to handle that.
+	 */
+	if (throw_err)
+	 throw_errno_error ("connect", errno);
+	return -1;
+ }
+ return 0;
+}
+
+static int perform_bind (int fd, struct sockaddr *addr, unsigned int len)
+{
+ while (-1 == bind (fd, addr, len))
+ {
+#ifdef EINTR
+	if (errno == EINTR)
+	 {
+	 if (-1 == SLang_handle_interrupt ())
+	 return -1;
+	 continue;
+	 }
+#endif
+	/* The manpage indicates EAGAIN will be returned if no free ports exist.
+	 * So allow the caller to handle that.
+	 */
+	throw_errno_error ("bind", errno);
+	return -1;
+ }
+ return 0;
+}
+
+static Socket_Type *perform_accept (Socket_Type *s, struct sockaddr *addr, unsigned int *lenp)
+{
+ socklen_t addr_len;
+ Socket_Type *s1;
+ int fd1;
+
+ addr_len = *lenp;
+ while (-1 == (fd1 = accept (s->fd, addr, &addr_len)))
+ {
+#ifdef EINTR
+	if (errno == EINTR)
+	 {
+	 if (-1 == SLang_handle_interrupt ())
+	 return NULL;
+	 continue;
+	 }
+#endif
+	throw_errno_error ("accept", errno);
+	return NULL;
+ }
+ *lenp = (unsigned int) addr_len;
+ if (NULL == (s1 = create_socket (fd1, s->domain, s->type, s->protocol)))
+ (void) close_socket (fd1);
+
+ return s1;
+}
+
+/*}}}*/
+
+/* Domain Methods */
+#if defined(PF_UNIX) && defined(AF_UNIX) /*{{{ */
+
+static void free_af_unix (Socket_Type *s)
+{
+ char *file = (char *) s->socket_data;
+ if (file == NULL)
+ return;
+
+ (void) unlink (file);
+ SLang_free_slstring (file);
+ s->socket_data = NULL;
+}
+
+static int connect_af_unix (Socket_Type *s, int nargs)
+{
+ struct sockaddr_un addr;
+ char *file;
+
+ if (nargs != 1)
+ {
+	SLang_verror (SL_NumArgs_Error, "This socket expects a filename");
+	return -1;
+ }
+ if (-1 == SLang_pop_slstring (&file))
+ return -1;
+
+ if (strlen (file) >= sizeof(addr.sun_path))
+ {
+	SLang_verror (SL_InvalidParm_Error, "filename too long for PF_UNIX socket");
+	SLang_free_slstring (file);
+	return -1;
+ }
+
+ memset ((char *)&addr, 0, sizeof (struct sockaddr_un));
+ addr.sun_family = AF_UNIX;
+ strcpy (addr.sun_path, file); /* \0 terminated */
+
+ SLang_free_slstring (file);
+ return perform_connect (s->fd, (struct sockaddr *)&addr, sizeof (addr), 1);
+}
+
+static int bind_af_unix (Socket_Type *s, int nargs)
+{
+ struct sockaddr_un addr;
+ char *file;
+
+ if (nargs != 1)
+ {
+	SLang_verror (SL_NumArgs_Error, "This socket expects a filename");
+	return -1;
+ }
+ if (-1 == SLang_pop_slstring (&file))
+ return -1;
+
+ if (strlen (file) >= sizeof(addr.sun_path))
+ {
+	SLang_verror (SL_InvalidParm_Error, "filename too long for PF_UNIX socket");
+	SLang_free_slstring (file);
+	return -1;
+ }
+
+ memset ((char *)&addr, 0, sizeof (struct sockaddr_un));
+ addr.sun_family = AF_UNIX;
+ strcpy (addr.sun_path, file); /* \0 terminated */
+
+ (void) unlink (file);
+ s->socket_data = (VOID_STAR) file;
+ return perform_bind (s->fd, (struct sockaddr *)&addr, sizeof (addr));
+}
+
+static Socket_Type *accept_af_unix (Socket_Type *s, unsigned int nrefs, SLang_Ref_Type **refs)
+{
+ struct sockaddr_un addr;
+ Socket_Type *s1;
+ unsigned int addr_len;
+
+ (void) refs;
+ if (nrefs != 0)
+ {
+	SLang_verror (SL_NotImplemented_Error, "accept: reference args not supported for PF_UNIX sockets");
+	return NULL;
+ }
+ addr_len = sizeof (struct sockaddr_un);
+ s1 = perform_accept (s, (struct sockaddr *)&addr, &addr_len);
+ return s1;
+}
+
+#endif
+/*}}}*/
+
+#if defined(PF_INET) && defined(AF_INET) /*{{{*/
+static int pop_host_port (SLFUTURE_CONST char *what, int nargs, char **hostp, int *portp)
+{
+ char *host;
+ int port;
+
+ if (nargs != 2)
+ {
+	SLang_verror (SL_NumArgs_Error, "%s on an PF_INET socket requires a hostname and portnumber", what);
+	return -1;
+ }
+
+ *hostp = NULL;
+ if ((-1 == SLang_pop_int (&port))
+ || (-1 == SLang_pop_slstring (&host)))
+ return -1;
+
+ *hostp = host;
+ *portp = port;
+ return 0;
+}
+
+typedef struct
+{
+ int h_addrtype;		 /* AF_INET or AF_INET6 */
+ int h_length;		 /* length of address */
+ unsigned int num;		 /* num elements of h_addr_list */
+ char **h_addr_list;		 /* Array of num of these */
+}
+Host_Addr_Info_Type;
+
+static void free_host_addr_info (Host_Addr_Info_Type *hinfo)
+{
+ if (hinfo == NULL)
+ return;
+ if (hinfo->h_addr_list != NULL)
+ SLfree ((char *)hinfo->h_addr_list);
+ SLfree ((char *) hinfo);
+}
+
+static Host_Addr_Info_Type *alloc_host_addr_info (unsigned int num, int h_length)
+{
+ Host_Addr_Info_Type *hinfo;
+ size_t nbytes;
+ char *buf;
+ unsigned int i;
+
+ hinfo = (Host_Addr_Info_Type *) SLcalloc (1, sizeof (Host_Addr_Info_Type));
+ if (hinfo == NULL)
+ return NULL;
+
+ /* We need memory to hold num (char *) addresses + num*h_length bytes */
+ nbytes = num * sizeof(char *) + num * h_length;
+ if (NULL == (buf = (char *)SLmalloc (nbytes)))
+ {
+	SLfree ((char *)hinfo);
+	return NULL;
+ }
+ hinfo->h_addr_list = (char **)buf;
+ buf += num*sizeof(char *);
+ for (i = 0; i < num; i++)
+ {
+	hinfo->h_addr_listi = buf;
+	buf += h_length;
+ }
+ hinfo->num = num;
+ hinfo->h_length = h_length;
+
+ return hinfo;
+}
+
+/* glibc removed the h_addr compat macro, which messes up the logic below. */
+# ifndef h_addr
+# ifdef __GNUC_PREREQ
+# if __GNUC_PREREQ(2,8)
+# define h_addr "unused"	 /* define it, but do not use it */
+# endif
+# endif
+# endif
+
+static Host_Addr_Info_Type *get_host_addr_info (char *host)
+{
+ in_addr_t addr;
+ Host_Addr_Info_Type *hinfo;
+ struct hostent *hp;
+ unsigned int max_retries;
+# ifndef h_addr
+ char *fake_h_addr_list2;
+# endif
+ char **h_addr_list;
+ unsigned int i, num;
+
+# ifndef INADDR_NONE
+# define INADDR_NONE ((in_addr_t)(-1))
+# endif
+ if ((isdigit ((unsigned char)*host))
+ && (INADDR_NONE != (addr = inet_addr (host))))
+ {
+	/* Numerical address */
+	if (NULL == (hinfo = alloc_host_addr_info (1, sizeof(in_addr_t))))
+	 return NULL;
+	hinfo->h_addrtype = AF_INET;
+	memcpy (hinfo->h_addr_list0, (char *)&addr, sizeof(in_addr_t));
+	return hinfo;
+ }
+
+ max_retries = 3;
+ while (NULL == (hp = gethostbyname (host)))
+ {
+# ifdef TRY_AGAIN
+	max_retries--;
+	if (max_retries && (h_errno == TRY_AGAIN))
+	 {
+	 sleep (1);
+	 continue;
+	 }
+# endif
+	throw_herror ("gethostbyname", h_errno);
+	return NULL;
+ }
+# ifndef h_addr
+ /* Older interface. There is only one address, so fake a list */
+ h_addr_list = fake_h_addr_list;
+ h_addr_list 0 = hp->h_addr;
+ h_addr_list 1 = NULL;
+# else
+ h_addr_list = hp->h_addr_list;
+# endif
+
+ /* Now count the number of addresses */
+ num = 0;
+ while (h_addr_listnum != NULL)
+ num++;
+
+ if (num == 0)
+ {
+# ifdef NO_DATA
+	throw_herror ("gethostbyname", NO_DATA);
+# else
+	throw_herror ("gethostbyname", NO_ADDRESS);
+# endif
+	return NULL;
+ }
+
+ if (NULL == (hinfo = alloc_host_addr_info (num, hp->h_length)))
+ return NULL;
+
+ hinfo->h_addrtype = hp->h_addrtype;
+
+ for (i = 0; i < num; i++)
+ memcpy (hinfo->h_addr_listi, h_addr_listi, hp->h_length);
+
+ return hinfo;
+}
+
+static int connect_af_inet (Socket_Type *s, int nargs)
+{
+ struct sockaddr_in s_in;
+ int port;
+ char *host;
+ Host_Addr_Info_Type *hinfo;
+ unsigned int i;
+
+ if (-1 == pop_host_port ("connect", nargs, &host, &port))
+ return -1;
+
+ if (NULL == (hinfo = get_host_addr_info (host)))
+ {
+	SLang_free_slstring (host);
+	return -1;
+ }
+
+ if (hinfo->h_addrtype != AF_INET)
+ {
+# ifdef AF_INET6
+	if (hinfo->h_addrtype == AF_INET6)
+	 SLang_verror (SL_NOT_IMPLEMENTED, "AF_INET6 not implemented");
+	else
+# endif
+	 SLang_verror (SocketError, "Unknown socket family for host %s", host);
+	SLang_free_slstring (host);
+	free_host_addr_info (hinfo);
+	return -1;
+ }
+
+ memset ((char *) &s_in, 0, sizeof(s_in));
+ s_in.sin_family = hinfo->h_addrtype;
+ s_in.sin_port = htons((unsigned short) port);
+
+ for (i = 0; i < hinfo->num; i++)
+ {
+	memcpy ((char *) &s_in.sin_addr, hinfo->h_addr_listi, hinfo->h_length);
+	if (-1 == perform_connect (s->fd, (struct sockaddr *)&s_in, sizeof (s_in), 0))
+	 continue;
+
+	free_host_addr_info (hinfo);
+	SLang_free_slstring (host);
+	return 0;
+ }
+ throw_errno_error ("connect", errno);
+ free_host_addr_info (hinfo);
+ SLang_free_slstring (host);
+ return -1;
+}
+
+static int bind_af_inet (Socket_Type *s, int nargs)
+{
+ struct sockaddr_in s_in;
+ char *host;
+ int port;
+ int status;
+ Host_Addr_Info_Type *hinfo;
+
+ if (-1 == pop_host_port ("connect", nargs, &host, &port))
+ return -1;
+
+ if (NULL == (hinfo = get_host_addr_info (host)))
+ {
+	SLang_free_slstring (host);
+	return -1;
+ }
+
+ if (hinfo->h_addrtype != AF_INET)
+ {
+# ifdef AF_INET6
+	if (hinfo->h_addrtype == AF_INET6)
+	 SLang_verror (SL_NOT_IMPLEMENTED, "AF_INET6 not implemented");
+	else
+# endif
+	 SLang_verror (SocketError, "Unknown socket family for host %s", host);
+	SLang_free_slstring (host);
+	free_host_addr_info (hinfo);
+	return -1;
+ }
+
+ memset ((char *) &s_in, 0, sizeof(s_in));
+ s_in.sin_family = hinfo->h_addrtype;
+ s_in.sin_port = htons((unsigned short) port);
+
+ memcpy ((char *) &s_in.sin_addr, hinfo->h_addr_list0, hinfo->h_length);
+
+ status = perform_bind (s->fd, (struct sockaddr *)&s_in, sizeof (s_in));
+
+ free_host_addr_info (hinfo);
+ SLang_free_slstring (host);
+ return status;
+}
+
+/* Usage: s1 = accept (s ,&host,&port); */
+static Socket_Type *accept_af_inet (Socket_Type *s, unsigned int nrefs, SLang_Ref_Type **refs)
+{
+ struct sockaddr_in s_in;
+ Socket_Type *s1;
+ unsigned int addr_len;
+
+ if ((nrefs != 0) && (nrefs != 2))
+ {
+	SLang_verror (SL_NumArgs_Error, "accept (sock ,&host,&port)");
+	return NULL;
+ }
+
+ addr_len = sizeof (struct sockaddr_in);
+ s1 = perform_accept (s, (struct sockaddr *)&s_in, &addr_len);
+
+ if ((s1 == NULL) || (nrefs == 0))
+ return s1;
+
+ if (nrefs == 2)
+ {
+	char *host;
+	char host_ip32; /* aaa.bbb.ccc.ddd */
+	unsigned char *bytes = (unsigned char *)&s_in.sin_addr;
+	int port = ntohs (s_in.sin_port);
+	sprintf (host_ip, "%d.%d.%d.%d",
+		 (int)bytes0,(int)bytes1,(int)bytes2,(int)bytes3);
+
+	if (NULL == (host = SLang_create_slstring (host_ip)))
+	 {
+	 free_socket (s1);
+	 return NULL;
+	 }
+	if (-1 == SLang_assign_to_ref (refs0, SLANG_STRING_TYPE, (VOID_STAR)&host))
+	 {
+	 SLang_free_slstring (host);
+	 free_socket (s1);
+	 return NULL;
+	 }
+	SLang_free_slstring (host);
+	if (-1 == SLang_assign_to_ref (refs1, SLANG_INT_TYPE, &port))
+	 {
+	 free_socket (s1);
+	 return NULL;
+	 }
+ }
+ return s1;
+}
+
+#endif
+
+/*}}}*/
+
+static Domain_Methods_Type Domain_Methods_Table =
+{
+#if defined(PF_UNIX) && defined(AF_UNIX)
+ {PF_UNIX, connect_af_unix, bind_af_unix, accept_af_unix, free_af_unix},
+#endif
+#if defined(PF_INET) && defined(AF_INET)
+ {PF_INET, connect_af_inet, bind_af_inet, accept_af_inet, NULL},
+#endif
+ {0, NULL, NULL, NULL, NULL}
+};
+
+static Domain_Methods_Type *lookup_domain_methods (int domain)
+{
+ Domain_Methods_Type *a = Domain_Methods_Table;
+ unsigned int i, n;
+
+ n = sizeof (Domain_Methods_Table)/sizeof(Domain_Methods_Type);
+ for (i = 0; i < n; i++)
+ {
+	if (a->domain == domain)
+	 return a;
+	a++;
+ }
+
+ SLang_verror (SocketError, "Unsupported socket domain: %d", domain);
+ return NULL;
+}
+
+static int close_socket (int fd)
+{
+ /* Do not call close again to avoid undefined behavior */
+ if (-1 == close (fd))
+ {
+#ifdef EINTR
+	if (errno == EINTR)
+	 {
+	 if (-1 == SLang_handle_interrupt ())
+	 return -1;
+	 }
+#endif
+	return -1;
+ }
+ return 0;
+}
+
+static void free_socket (Socket_Type *s)
+{
+ if (s == NULL)
+ return;
+
+ if ((s->methods != NULL) && (s->methods->free_socket_data != NULL))
+ (*s->methods->free_socket_data)(s);
+
+ if (s->fd != -1)
+ close_socket (s->fd);
+
+ SLfree ((char *) s);
+}
+
+static Socket_Type *create_socket (int fd, int domain, int type, int protocol)
+{
+ Socket_Type *s;
+ Domain_Methods_Type *methods;
+
+ if (NULL == (methods = lookup_domain_methods (domain)))
+ return NULL;
+
+ s = (Socket_Type *)SLmalloc (sizeof (Socket_Type));
+ if (s == NULL)
+ return s;
+ memset ((char *)s, 0, sizeof (Socket_Type));
+
+ s->fd = fd;
+ s->domain = domain;
+ s->protocol = protocol;
+ s->type = type;
+ s->methods = methods;
+
+ return s;
+}
+
+static int close_socket_callback (VOID_STAR cd)
+{
+ Socket_Type *s;
+
+ s = (Socket_Type *) cd;
+ if (s->fd == -1)
+ {
+#ifdef EBADF
+	errno = EBADF;
+#endif
+	return -1;
+ }
+ if (-1 == close (s->fd))
+ return -1;
+
+ s->fd = -1;
+ return 0;
+}
+
+static void free_socket_callback (VOID_STAR cd)
+{
+ free_socket ((Socket_Type *)cd);
+}
+
+static SLFile_FD_Type *socket_to_fd (Socket_Type *s)
+{
+ SLFile_FD_Type *f;
+ if (NULL == (f = SLfile_create_fd ("*socket*", s->fd)))
+ return NULL;
+
+ (void) SLfile_set_clientdata (f, free_socket_callback, (VOID_STAR)s, Socket_Type_Id);
+ (void) SLfile_set_close_method (f, close_socket_callback);
+ return f;
+}
+
+static Socket_Type *socket_from_fd (SLFile_FD_Type *f)
+{
+ Socket_Type *s;
+ if (-1 == SLfile_get_clientdata (f, Socket_Type_Id, (VOID_STAR *)&s))
+ {
+	SLang_verror (SL_TypeMismatch_Error, "File descriptor does not represent a socket");
+	return NULL;
+ }
+ return s;
+}
+
+/* This function frees the socket before returning */
+static int push_socket (Socket_Type *s)
+{
+ SLFile_FD_Type *f;
+ int status;
+
+ if (s == NULL)
+ return SLang_push_null ();
+
+ if (NULL == (f = socket_to_fd (s)))
+ {
+	free_socket (s);
+	return -1;
+ }
+
+ status = SLfile_push_fd (f);
+ SLfile_free_fd (f);
+ return status;
+}
+
+static Socket_Type *pop_socket (SLFile_FD_Type **fp)
+{
+ SLFile_FD_Type *f;
+ Socket_Type *s;
+
+ if (-1 == SLfile_pop_fd (&f))
+ {
+	*fp = NULL;
+	return NULL;
+ }
+ if (NULL == (s = socket_from_fd (f)))
+ {
+	SLfile_free_fd (f);
+	return NULL;
+ }
+ *fp = f;
+ return s;
+}
+
+static void socket_intrin (int *domain, int *type, int *protocol)
+{
+ Socket_Type *s;
+ int fd;
+
+ if (NULL == lookup_domain_methods (*domain))
+ return;
+
+ fd = socket (*domain, *type, *protocol);
+ if (fd == -1)
+ {
+	throw_errno_error ("socket", errno);
+	return;
+ }
+
+ if (NULL == (s = create_socket (fd, *domain, *type, *protocol)))
+ {
+	close_socket (fd);
+	return;
+ }
+
+ (void) push_socket (s);	 /* frees it upon error */
+ return;
+}
+
+#ifdef HAVE_SOCKETPAIR
+static void socketpair_intrin (int *domain, int *type, int *protocol)
+{
+ Socket_Type *s;
+ int fds2;
+
+ if (NULL == lookup_domain_methods (*domain))
+ return;
+
+ if (-1 == socketpair (*domain, *type, *protocol, fds))
+ {
+	throw_errno_error ("socketpair", errno);
+	return;
+ }
+
+ if (NULL == (s = create_socket (fds0, *domain, *type, *protocol)))
+ {
+	close_socket (fds0);
+	close_socket (fds1);
+	return;
+ }
+ if (-1 == push_socket (s))	 /* frees upon error */
+ {
+	close_socket (fds1);
+	return;
+ }
+ if (NULL == (s = create_socket (fds1, *domain, *type, *protocol)))
+ {
+	close_socket (fds1);
+	return;
+ }
+ (void) push_socket (s);	 /* frees it upon error */
+ return;
+}
+#endif
+
+static void connect_intrin (void)
+{
+ Socket_Type *s;
+ SLFile_FD_Type *f;
+ int nargs = SLang_Num_Function_Args;
+ Domain_Methods_Type *methods;
+
+ if (-1 == SLroll_stack (-nargs))
+ return;
+
+ if (NULL == (s = pop_socket (&f)))
+ return;
+ nargs--;
+
+ methods = s->methods;
+ (void) (*methods->connect)(s, nargs);
+ SLfile_free_fd (f);
+}
+
+static void bind_intrin (void)
+{
+ Socket_Type *s;
+ SLFile_FD_Type *f;
+ int nargs = SLang_Num_Function_Args;
+ Domain_Methods_Type *methods;
+
+ if (-1 == SLroll_stack (-nargs))
+ return;
+
+ if (NULL == (s = pop_socket (&f)))
+ return;
+ nargs--;
+
+ methods = s->methods;
+ (void)(*methods->bind)(s, nargs);
+ SLfile_free_fd (f);
+}
+
+static void listen_intrin (SLFile_FD_Type *f, int *np)
+{
+ Socket_Type *s;
+
+ if (NULL == (s = socket_from_fd (f)))
+ return;
+
+ if (0 == listen (s->fd, *np))
+ return;
+
+ throw_errno_error ("listen", errno);
+}
+
+static void accept_intrin (void)
+{
+ SLFile_FD_Type *f;
+ Socket_Type *s, *s1;
+ Domain_Methods_Type *methods;
+ int nargs = SLang_Num_Function_Args;
+ SLang_Ref_Type *refsMAX_ACCEPT_REF_ARGS;
+ int i;
+
+ if (nargs <= 0)
+ {
+	SLang_verror (SL_Usage_Error, "s1 = accept (s ,&v...)");
+	return;
+ }
+
+ if (-1 == SLroll_stack (-nargs))
+ return;
+
+ if (NULL == (s = pop_socket (&f)))
+ return;
+ nargs--;
+
+ if (nargs > MAX_ACCEPT_REF_ARGS)
+ {
+	SLang_verror (SL_NumArgs_Error, "accept: too many reference args");
+	SLfile_free_fd (f);
+ }
+ memset ((char *)refs, 0, sizeof (refs));
+
+ i = nargs;
+ while (i != 0)
+ {
+	i--;
+	if (-1 == SLang_pop_ref (refs+i))
+	 goto free_return;
+ }
+
+ methods = s->methods;
+ if (NULL != (s1 = (*methods->accept)(s, nargs, refs)))
+ (void) push_socket (s1);	 /* frees it upon error */
+
+ /* drop */
+
+free_return:
+ for (i = 0; i < nargs; i++)
+ {
+	if (refsi != NULL)
+	 SLang_free_ref (refsi);
+ }
+ SLfile_free_fd (f);
+}
+
+typedef struct
+{
+ int optname;
+ int (*setopt)(Socket_Type *, int, int);
+ int (*getopt)(Socket_Type *, int, int);
+}
+SockOpt_Type;
+
+static int do_setsockopt (int fd, int level, int optname, void *val, socklen_t len)
+{
+ if (-1 == setsockopt (fd, level, optname, val, len))
+ {
+	throw_errno_error ("setsockopt", errno);
+	return -1;
+ }
+ return 0;
+}
+
+static int do_getsockopt (int fd, int level, int optname, void *val, socklen_t *lenp)
+{
+ if (-1 == getsockopt (fd, level, optname, val, lenp))
+ {
+	throw_errno_error ("getsockopt", errno);
+	return -1;
+ }
+ return 0;
+}
+
+static int set_int_sockopt (Socket_Type *s, int level, int optname)
+{
+ int val;
+
+ if (-1 == SLang_pop_int (&val))
+ return -1;
+
+ return do_setsockopt (s->fd, level, optname, (void *)&val, sizeof(int));
+}
+
+static int get_int_sockopt (Socket_Type *s, int level, int optname)
+{
+ int val;
+ socklen_t len;
+
+ len = sizeof (int);
+ if (-1 == do_getsockopt (s->fd, level, optname, (void *)&val, &len))
+ return -1;
+
+ return SLang_push_int (val);
+}
+
+static int set_str_sockopt (Socket_Type *s, int level, int optname)
+{
+ char *val;
+ socklen_t len;
+ int ret;
+
+ if (-1 == SLang_pop_slstring (&val))
+ return -1;
+ len = strlen (val); len++;
+ ret = do_setsockopt (s->fd, level, optname, (void *)val, len);
+ SLang_free_slstring (val);
+ return ret;
+}
+static int get_str_sockopt (Socket_Type *s, int level, int optname)
+{
+ char buf1024;
+ socklen_t len = sizeof (buf)-1;
+
+ if (-1 == do_getsockopt (s->fd, level, optname, (void *)buf, &len))
+ return -1;
+
+ buflen = 0;
+ return SLang_push_string (buf);
+}
+
+static int set_struct_sockopt (Socket_Type *s, int level, int optname,
+			 SLang_CStruct_Field_Type *cs, VOID_STAR v,
+			 socklen_t len)
+{
+ int ret;
+
+ if (-1 == SLang_pop_cstruct (v, cs))
+ return -1;
+
+ ret = do_setsockopt (s->fd, level, optname, v, len);
+ SLang_free_cstruct (v, cs);
+ return ret;
+}
+
+static int get_struct_sockopt (Socket_Type *s, int level, int optname,
+			 SLang_CStruct_Field_Type *cs, VOID_STAR v,
+			 socklen_t len)
+{
+ if (-1 == do_getsockopt (s->fd, level, optname, v, &len))
+ return -1;
+
+ return SLang_push_cstruct (v, cs);
+}
+
+static SLang_CStruct_Field_Type TV_Struct =
+{
+ MAKE_CSTRUCT_INT_FIELD(struct timeval, tv_sec, "tv_sec", 0),
+ MAKE_CSTRUCT_INT_FIELD(struct timeval, tv_sec, "tv_usec", 0),
+ SLANG_END_CSTRUCT_TABLE
+};
+
+static int set_timeval_sockopt (Socket_Type *s, int level, int optname)
+{
+ struct timeval tv;
+ return set_struct_sockopt (s, level, optname, TV_Struct, (VOID_STAR)&tv, sizeof(struct timeval));
+}
+
+static int get_timeval_sockopt (Socket_Type *s, int level, int optname)
+{
+ struct timeval tv;
+ return get_struct_sockopt (s, level, optname, TV_Struct, (VOID_STAR)&tv, sizeof(struct timeval));
+}
+
+#if defined(SO_LINGER)
+static SLang_CStruct_Field_Type Linger_Struct =
+{
+ MAKE_CSTRUCT_INT_FIELD(struct linger, l_onoff, "l_onoff", 0),
+ MAKE_CSTRUCT_INT_FIELD(struct linger, l_linger, "l_linger", 0),
+ SLANG_END_CSTRUCT_TABLE
+};
+
+static int set_linger_sockopt (Socket_Type *s, int level, int optname)
+{
+ struct linger lg;
+ return set_struct_sockopt (s, level, optname, Linger_Struct, (VOID_STAR)&lg, sizeof(struct linger));
+}
+
+static int get_linger_sockopt (Socket_Type *s, int level, int optname)
+{
+ struct linger lg;
+ return get_struct_sockopt (s, level, optname, Linger_Struct, (VOID_STAR)&lg, sizeof(struct linger));
+}
+#endif
+
+#ifdef SOL_SOCKET
+static SockOpt_Type SO_Option_Table =
+{
+# ifdef SO_KEEPALIVE
+ {SO_KEEPALIVE, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef SO_OOBINLINE
+ {SO_OOBINLINE, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef SO_RCVLOWAT
+ {SO_RCVLOWAT, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef SO_SNDLOWAT
+ {SO_SNDLOWAT, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef SO_BSDCOMPAT
+ {SO_BSDCOMPAT, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef SO_PASSCRED
+ {SO_PASSCRED, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef SO_BINDTODEVICE
+ {SO_BINDTODEVICE, set_str_sockopt, get_str_sockopt},
+# endif
+# ifdef SO_DEBUG
+ {SO_DEBUG, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef SO_REUSEADDR
+ {SO_REUSEADDR, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef SO_TYPE
+ {SO_TYPE, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef SO_ACCEPTCONN
+ {SO_ACCEPTCONN, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef SO_DONTROUTE
+ {SO_DONTROUTE, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef SO_BROADCAST
+ {SO_BROADCAST, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef SO_SNDBUF
+ {SO_SNDBUF, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef SO_RCVBUF
+ {SO_RCVBUF, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef SO_PRIORITY
+ {SO_PRIORITY, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef SO_ERROR
+ {SO_ERROR, NULL, get_int_sockopt},
+# endif
+# ifdef SO_PEERCRED
+ /* {SO_PEERCRED, NULL, get_peercred_sockopt}, */
+# endif
+# ifdef SO_RCVTIMEO
+ {SO_RCVTIMEO, set_timeval_sockopt, get_timeval_sockopt},
+# endif
+# ifdef SO_SNDTIMEO
+ {SO_SNDTIMEO, set_timeval_sockopt, get_timeval_sockopt},
+# endif
+# ifdef SO_LINGER
+ {SO_LINGER, set_linger_sockopt, get_linger_sockopt},
+# endif
+
+ {-1, NULL, NULL}
+};
+#endif				 /* SOL_SOCKET */
+
+#if defined(IP_ADD_MEMBERSHIP) /* either add or drop same args */
+static int set_multicast_sockopt (Socket_Type *s, int level, int option)
+{
+ struct ip_mreq group;
+ char *multi;
+ char *local = NULL;
+ Host_Addr_Info_Type *multi_info = NULL;
+ Host_Addr_Info_Type *local_info = NULL;
+ int ret = -1;
+
+ if (-1 == SLang_pop_slstring(&multi))
+ return -1;
+
+ if (5 == SLang_Num_Function_Args)
+ {
+	if (-1 == SLang_pop_slstring(&local))
+	 {
+	 SLang_free_slstring (multi);
+	 return -1;
+	 }
+ }
+
+ if (NULL == (multi_info = get_host_addr_info (multi)))
+ goto free_and_return;
+
+ if (local != NULL)
+ {
+	if (NULL == (local_info = get_host_addr_info (local)))
+	 goto free_and_return;
+
+	memcpy ((char *) &group.imr_interface.s_addr, local_info->h_addr_list0, local_info->h_length);
+ }
+ else
+ {
+	group.imr_interface.s_addr = INADDR_ANY;
+ }
+ memcpy ((char *) &group.imr_multiaddr.s_addr, multi_info->h_addr_list0, multi_info->h_length);
+
+ ret = do_setsockopt (s->fd, level, option, (void *)&group, sizeof(group));
+
+free_and_return:
+
+ SLang_free_slstring(multi);
+ if (NULL != local)
+ SLang_free_slstring(local);
+ free_host_addr_info (multi_info);
+ if (NULL != local_info)
+ free_host_addr_info (local_info);
+
+ return ret;
+}
+#endif
+
+#if defined(IP_MULTICAST_IF)
+static int set_multicast_if_sockopt (Socket_Type *s, int level, int option)
+{
+ struct in_addr iface;
+ char *local;
+ Host_Addr_Info_Type *local_info;
+
+ if (-1 == SLang_pop_slstring(&local))
+ return -1;
+
+ if (NULL == (local_info = get_host_addr_info (local)))
+ {
+	SLang_free_slstring (local);
+	return -1;
+ }
+ memcpy ((char *) &iface.s_addr, local_info->h_addr_list0, local_info->h_length);
+
+ SLang_free_slstring(local);
+ free_host_addr_info (local_info);
+
+ return do_setsockopt (s->fd, level, option, (void *)&iface, sizeof(iface));
+}
+#endif
+
+#ifdef SOL_IP
+static SockOpt_Type IP_Option_Table =
+{
+# ifdef IP_OPTIONS
+ /* {IP_OPTIONS, NULL, NULL}, */
+# endif
+# ifdef IP_PKTINFO
+ /* {IP_PKTINFO, NULL, NULL}, */
+# endif
+# ifdef IP_RECVTOS
+ /* {IP_RECVTOS, NULL, NULL}, */
+# endif
+# ifdef IP_RECVTTL
+ /* {IP_RECVTTL, NULL, NULL}, */
+# endif
+# ifdef IP_RECVOPTS
+ /* {IP_RECVOPTS, NULL, NULL}, */
+# endif
+# ifdef IP_TOS
+ /* {IP_TOS, set_int_sockopt, get_int_sockopt}, */
+# endif
+# ifdef IP_TTL
+ {IP_TTL, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef IP_HDRINCL
+ {IP_HDRINCL, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef IP_RECVERR
+ /* {IP_RECVERR, set_int_sockopt, get_int_sockopt}, */
+# endif
+# ifdef IP_MTU_DISCOVER
+ /* {IP_MTU_DISCOVER, set_int_sockopt, get_int_sockopt}, */
+# endif
+# ifdef IP_MTU
+ {IP_MTU_DISCOVER, NULL, get_int_sockopt},
+# endif
+# ifdef IP_ROUTER_ALERT
+ {IP_ROUTER_ALERT, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef IP_MULTICAST_TTL
+ {IP_MULTICAST_TTL, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef IP_MULTICAST_LOOP
+ {IP_MULTICAST_LOOP, set_int_sockopt, get_int_sockopt},
+# endif
+# ifdef IP_ADD_MEMBERSHIP
+ {IP_ADD_MEMBERSHIP, set_multicast_sockopt, NULL},
+# endif
+# ifdef IP_DROP_MEMBERSHIP
+ {IP_DROP_MEMBERSHIP, set_multicast_sockopt, NULL},
+# endif
+# ifdef IP_MULTICAST_IF
+ {IP_MULTICAST_IF, set_multicast_if_sockopt, NULL},
+# endif
+
+ {-1, NULL, NULL}
+};
+#endif				 /* SOL_IP */
+/* Usage: get/setsockopt (socket, level, optname, value) */
+static void getset_sockopt (int set)
+{
+ Socket_Type *s;
+ SLFile_FD_Type *f;
+ int level, optname;
+ SockOpt_Type *table;
+
+ if (-1 == SLreverse_stack (SLang_Num_Function_Args))
+ return;
+
+ if (NULL == (s = pop_socket (&f)))
+ return;
+
+ if ((-1 == SLang_pop_int (&level))
+ || (-1 == SLang_pop_int (&optname)))
+ {
+	SLfile_free_fd (f);
+	return;
+ }
+
+ switch (level)
+ {
+#ifdef SOL_SOCKET
+ case SOL_SOCKET: table = SO_Option_Table; break;
+#endif
+#ifdef SOL_IP
+ case SOL_IP: table = IP_Option_Table; break;
+#endif
+ default:
+	SLang_verror (SL_NotImplemented_Error, "get/setsockopt level %d is not supported", level);
+	goto free_return;
+ }
+
+ while (1)
+ {
+	if (table->optname == optname)
+	 {
+	 int (*func)(Socket_Type *, int, int);
+	 if (set)
+	 func = table->setopt;
+	 else
+	 func = table->getopt;
+	 if (func == NULL)
+	 goto not_implemented_error;
+
+	 (void)(*func)(s, level, optname);
+	 break;
+	 }
+	if (table->optname == -1)
+	 goto free_return;
+
+	table++;
+ }
+
+ /* drop */
+free_return:
+ SLfile_free_fd (f);
+ return;
+
+not_implemented_error:
+ SLang_verror (SL_NotImplemented_Error, "get/setsockopt option %d is not supported at level %d", optname, level);
+ SLfile_free_fd (f);
+}
+
+static void setsockopt_intrin (void)
+{
+ getset_sockopt (1);
+}
+static void getsockopt_intrin (void)
+{
+ getset_sockopt (0);
+}
+
+#define I SLANG_INT_TYPE
+#define V SLANG_VOID_TYPE
+#define F SLANG_FILE_FD_TYPE
+static SLang_Intrin_Fun_Type Module_Intrinsics =
+{
+ MAKE_INTRINSIC_3("socket", socket_intrin, V, I, I, I),
+#ifdef HAVE_SOCKETPAIR
+ MAKE_INTRINSIC_3("socketpair", socketpair_intrin, V, I, I, I),
+#endif
+ MAKE_INTRINSIC_0("connect", connect_intrin, V),
+ MAKE_INTRINSIC_0("bind", bind_intrin, V),
+ MAKE_INTRINSIC_2("listen", listen_intrin, V, F, I),
+ MAKE_INTRINSIC_0("accept", accept_intrin, V),
+ MAKE_INTRINSIC_0("getsockopt", getsockopt_intrin, V),
+ MAKE_INTRINSIC_0("setsockopt", setsockopt_intrin, V),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+#undef F
+#undef V
+#undef I
+
+static SLang_IConstant_Type Module_IConstants =
+{
+#ifdef SOCK_STREAM
+ MAKE_ICONSTANT("SOCK_STREAM", SOCK_STREAM),
+#endif
+#ifdef SOCK_DGRAM
+ MAKE_ICONSTANT("SOCK_DGRAM", SOCK_DGRAM),
+#endif
+#ifdef SOCK_RAW
+ MAKE_ICONSTANT("SOCK_RAW", SOCK_RAW),
+#endif
+#ifdef SOCK_RDM
+ MAKE_ICONSTANT("SOCK_RDM", SOCK_RDM),
+#endif
+#ifdef SOCK_SEQPACKET
+ MAKE_ICONSTANT("SOCK_SEQPACKET", SOCK_SEQPACKET),
+#endif
+#ifdef SOCK_PACKET
+ MAKE_ICONSTANT("SOCK_PACKET", SOCK_PACKET),
+#endif
+
+ /* Domains */
+#ifdef PF_UNIX
+ MAKE_ICONSTANT("PF_UNIX", PF_UNIX),
+#endif
+#ifdef PF_INET
+ MAKE_ICONSTANT("PF_INET", PF_INET),
+#endif
+#ifdef AF_UNIX
+ MAKE_ICONSTANT("AF_UNIX", AF_UNIX),
+#endif
+#ifdef AF_INET
+ MAKE_ICONSTANT("AF_INET", AF_INET),
+#endif
+
+#ifdef SOL_SOCKET
+ MAKE_ICONSTANT("SOL_SOCKET", SOL_SOCKET),
+# ifdef SO_KEEPALIVE
+ MAKE_ICONSTANT("SO_KEEPALIVE", SO_KEEPALIVE),
+# endif
+# ifdef SO_OOBINLINE
+ MAKE_ICONSTANT("SO_OOBINLINE", SO_OOBINLINE),
+# endif
+# ifdef SO_RCVLOWAT
+ MAKE_ICONSTANT("SO_RCVLOWAT", SO_RCVLOWAT),
+# endif
+# ifdef SO_SNDLOWAT
+ MAKE_ICONSTANT("SO_SNDLOWAT", SO_SNDLOWAT),
+# endif
+# ifdef SO_BSDCOMPAT
+ MAKE_ICONSTANT("SO_BSDCOMPAT", SO_BSDCOMPAT),
+# endif
+# ifdef SO_PASSCRED
+ MAKE_ICONSTANT("SO_PASSCRED", SO_PASSCRED),
+# endif
+# ifdef SO_BINDTODEVICE
+ MAKE_ICONSTANT("SO_BINDTODEVICE", SO_BINDTODEVICE),
+# endif
+# ifdef SO_DEBUG
+ MAKE_ICONSTANT("SO_DEBUG", SO_DEBUG),
+# endif
+# ifdef SO_REUSEADDR
+ MAKE_ICONSTANT("SO_REUSEADDR", SO_REUSEADDR),
+# endif
+# ifdef SO_TYPE
+ MAKE_ICONSTANT("SO_TYPE", SO_TYPE),
+# endif
+# ifdef SO_ACCEPTCONN
+ MAKE_ICONSTANT("SO_ACCEPTCONN", SO_ACCEPTCONN),
+# endif
+# ifdef SO_DONTROUTE
+ MAKE_ICONSTANT("SO_DONTROUTE", SO_DONTROUTE),
+# endif
+# ifdef SO_BROADCAST
+ MAKE_ICONSTANT("SO_BROADCAST", SO_BROADCAST),
+# endif
+# ifdef SO_SNDBUF
+ MAKE_ICONSTANT("SO_SNDBUF", SO_SNDBUF),
+# endif
+# ifdef SO_RCVBUF
+ MAKE_ICONSTANT("SO_RCVBUF", SO_RCVBUF),
+# endif
+# ifdef SO_PRIORITY
+ MAKE_ICONSTANT("SO_PRIORITY", SO_PRIORITY),
+# endif
+# ifdef SO_ERROR
+ MAKE_ICONSTANT("SO_ERROR", SO_ERROR),
+# endif
+# ifdef SO_PEERCRED
+ MAKE_ICONSTANT("SO_PEERCRED", SO_PEERCRED),
+# endif
+# ifdef SO_RCVTIMEO
+ MAKE_ICONSTANT("SO_RCVTIMEO", SO_RCVTIMEO),
+# endif
+# ifdef SO_SNDTIMEO
+ MAKE_ICONSTANT("SO_SNDTIMEO", SO_SNDTIMEO),
+# endif
+# ifdef SO_LINGER
+ MAKE_ICONSTANT("SO_LINGER", SO_LINGER),
+# endif
+#endif 			 /* SOL_SOCKET */
+
+#ifdef SOL_IP
+ MAKE_ICONSTANT("SOL_IP", SOL_IP),
+# ifdef IP_RECVTTL
+ MAKE_ICONSTANT("IP_RECVTTL", IP_RECVTTL),
+# endif
+# ifdef IP_RECVOPTS
+ MAKE_ICONSTANT("IP_RECVOPTS", IP_RECVOPTS),
+# endif
+# ifdef IP_RECVOPTS
+ MAKE_ICONSTANT("IP_RECVOPTS", IP_RECVOPTS),
+# endif
+# ifdef IP_TOS
+ MAKE_ICONSTANT("IP_TOS", IP_TOS),
+# endif
+# ifdef IP_TTL
+ MAKE_ICONSTANT("IP_TTL", IP_TTL),
+# endif
+# ifdef IP_HDRINCL
+ MAKE_ICONSTANT("IP_HDRINCL", IP_HDRINCL),
+# endif
+# ifdef IP_RECVERR
+ MAKE_ICONSTANT("IP_RECVERR", IP_RECVERR),
+# endif
+# ifdef IP_MTU_DISCOVER
+ MAKE_ICONSTANT("IP_MTU_DISCOVER", IP_MTU_DISCOVER),
+# endif
+# ifdef IP_ROUTER_ALERT
+ MAKE_ICONSTANT("IP_ROUTER_ALERT", IP_ROUTER_ALERT),
+# endif
+# ifdef IP_MULTICAST_TTL
+ MAKE_ICONSTANT("IP_MULTICAST_TTL", IP_MULTICAST_TTL),
+# endif
+# ifdef IP_MULTICAST_LOOP
+ MAKE_ICONSTANT("IP_MULTICAST_LOOP", IP_MULTICAST_LOOP),
+# endif
+# ifdef IP_ADD_MEMBERSHIP
+ MAKE_ICONSTANT("IP_ADD_MEMBERSHIP", IP_ADD_MEMBERSHIP),
+# endif
+# ifdef IP_DROP_MEMBERSHIP
+ MAKE_ICONSTANT("IP_DROP_MEMBERSHIP", IP_DROP_MEMBERSHIP),
+# endif
+# ifdef IP_MULTICAST_IF
+ MAKE_ICONSTANT("IP_MULTICAST_IF", IP_MULTICAST_IF),
+# endif
+# ifdef IP_OPTIONS
+ MAKE_ICONSTANT("IP_OPTIONS", IP_OPTIONS),
+# endif
+# ifdef IP_PKTINFO
+ MAKE_ICONSTANT("IP_PKTINFO", IP_PKTINFO),
+# endif
+# ifdef IP_RECVTOS
+ MAKE_ICONSTANT("IP_RECVTOS", IP_RECVTOS),
+# endif
+# ifdef IPPROTO_IP
+ MAKE_ICONSTANT("IPPROTO_IP", IPPROTO_IP),
+# endif
+#endif				 /* SOL_IP */
+
+ SLANG_END_ICONST_TABLE
+};
+
+int init_socket_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns;
+
+ if (SocketError == -1)
+ {
+	if (-1 == (SocketError = SLerr_new_exception (SL_RunTime_Error, "SocketError", "Socket Error")))
+	 return -1;
+	if (-1 == (SocketHerrnoError = SLerr_new_exception (SocketError, "SocketHError", "Socket h_errno Error")))
+	 return -1;
+ }
+ if (Socket_Type_Id == -1)
+ {
+	(void) SLfile_create_clientdata_id (&Socket_Type_Id);
+ }
+
+ if (NULL == (ns = SLns_create_namespace (ns_name)))
+ return -1;
+
+ if ((-1 == SLns_add_intrin_fun_table (ns, Module_Intrinsics, NULL))
+ || (-1 == SLns_add_iconstant_table (ns, Module_IConstants, NULL)))
+ return -1;
+
+ if (-1 == SLns_add_intrinsic_variable(ns, "h_errno", (VOID_STAR)&Module_H_Errno, SLANG_INT_TYPE, 1))
+ return -1;
+
+ return 0;
+}
+
+void deinit_socket_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/socket.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/stats-module.c Added

@@ -0,0 +1,1100 @@
+/* -*- mode: C; mode: fold; -*- */
+
+/*
+ Copyright (c) 2007 Massachusetts Institute of Technology
+
+ This software was developed by the MIT Center for Space Research
+ under contract SV1-61010 from the Smithsonian Institution.
+
+ Permission to use, copy, modify, distribute, and sell this software
+ and its documentation for any purpose is hereby granted without fee,
+ provided that the above copyright notice appear in all copies and
+ that both that copyright notice and this permission notice appear in
+ the supporting documentation, and that the name of the Massachusetts
+ Institute of Technology not be used in advertising or publicity
+ pertaining to distribution of the software without specific, written
+ prior permission. The Massachusetts Institute of Technology makes
+ no representations about the suitability of this software for any
+ purpose. It is provided "as is" without express or implied warranty.
+
+ THE MASSACHUSETTS INSTITUTE OF TECHNOLOGY DISCLAIMS ALL WARRANTIES
+ WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF
+ MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE MASSACHUSETTS
+ INSTITUTE OF TECHNOLOGY BE LIABLE FOR ANY SPECIAL, INDIRECT OR
+ CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
+ OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
+ NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
+ WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+
+/* Author: John E. Davis <jed@jedsoft.org> */
+
+#include "config.h"
+#include <stdio.h>
+#include <slang.h>
+#include <math.h>
+#include <string.h>
+
+#include "stats-module.h"
+
+#ifndef PI
+#define PI 3.14159265358979323846264338327950288
+#endif
+/* <MODULE_INCLUDES> */
+
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+SLANG_MODULE(stats);
+#ifdef __cplusplus
+}
+#endif
+
+/* typedef unsigned long long uint64_t;
+ * typedef long long int64_t;
+ */
+
+#define MODULE_VERSION_STRING "1.1.0"
+#define MODULE_VERSION_NUMBER 10100
+
+#if 0
+double anderson_darling_statistic (double *f, unsigned int num)
+{
+ double s;
+ double n;
+
+ n = (double)num;
+ for (i = 0; i < n; i++)
+ {
+	((2*i+1)/n)* (log(fi) + log(fn-i));
+ }
+
+}
+#endif
+
+/* Computes (n k) = n!/(k! (n-k)!) */
+static double compute_binomial_coeff (unsigned int n, unsigned int k) /*{{{*/
+{
+ double f;
+ unsigned int i;
+
+ if (k > n)
+ return 0.0;
+ if ((k == 0) || (k == n))
+ return 1.0;
+
+ if (n-k < k)
+ k = n-k;
+
+ f = n;
+ for (i = 2; i <= k; i++)
+ {
+	n--;
+	f = (f/i)*n;
+ }
+ return f;
+}
+
+/*}}}*/
+
+/* This function implements the _asymptotic_ form of the kolmogorov distribution
+ * for large N. Asymptotically, this is given by the series expansion:
+ *
+ * S(x) = 1 + 2\sum_{j=1}^{\infty} (-1)^j \exp(-2j^2 x^2)
+ *
+ * This is equivalent to
+ *
+ * S(x) = \sqrt{2\pi}/x \sum_{j=1}^\infty \exp-(2j-1)^2\pi^2/(8x^2)
+ *
+ * See eq. 1.4 of W. Feller, "On the Kolmogorov-Smirnov limit theorems for
+ * empirical distributions", Annals of Math. Stat, Vol 19 (1948), pp. 177-190.
+ *
+ * S(x) represents the prob of obtaining a (normalized) statistic <= x.
+ *
+ * I chose the value of 1.09 was chosen based upon some emperical testing. Of
+ * course this value will most likely vary with compiler.
+ */
+static double smirnov_cdf (double x) /*{{{*/
+{
+ int j;
+ unsigned int max_loops;
+ double a, b, sum;
+ max_loops = 5000;
+
+ if (x <= 0.15)
+ {
+	if (x < 0.0)
+	 {
+	 SLang_set_error (SL_INVALID_PARM);
+	 return -1.0;
+	 }
+	return 0.0;
+ }
+
+ if (x > 1.09)
+ {
+ int j3;
+
+	if (x > 19.4)
+	 return 1.0;
+
+	x = 2*x*x;
+	sum = 0.0;
+	j = 1;
+	j3 = 3;
+	while (max_loops)
+	 {
+	 double dsum = exp(-j*j*x) * (1.0 - exp (-j3*x));
+	 sum += dsum;
+	 if (dsum == 0)
+	 return 1-2*sum;
+
+	 j += 2;
+	 j3 += 4;
+	 max_loops--;
+	 }
+	return 1.0;
+ }
+
+ /* Use sqrt(X) = 0.5*log(X) */
+ b = log(sqrt(2*PI)/x);
+ a = (PI*PI/(8.0*x*x));
+
+ sum = 0.0;
+ j = 1;
+ while (max_loops)
+ {
+	double dsum = exp (-a*j*j + b);
+	sum += dsum;
+	if (dsum == 0.0)
+	 return sum;
+	j += 2;
+	max_loops--;
+ }
+ return 0.0;
+}
+
+/*}}}*/
+
+/* This gives the probability that an observed value of D_mn <= c/(mn).
+ */
+static double kim_jennrich_cdf (unsigned int m, unsigned int n, unsigned int c) /*{{{*/
+{
+ unsigned int i, j;
+ double p;
+ double *u;
+
+ if (m > n)
+ {
+	unsigned int tmp = m;
+	m = n;
+	n = tmp;
+ }
+
+ u = (double *)SLmalloc (sizeof (double)*(n+1));
+ if (u == NULL)
+ return -1.0;
+
+ u0 = 1.0;
+ for (j = 1; j <= n; j++)
+ {
+	uj = 1.0;
+	if (m*j > c)
+	 uj = 0.0;
+ }
+
+ for (i = 1; i <= m; i++)
+ {
+	double w = i/(i + (double)n);
+	unsigned int ni = n*i;
+
+	u0 = w*u0;
+	if (ni > c) u0 = 0;
+	for (j = 1; j <= n; j++)
+	 {
+	 unsigned int mj = m*j;
+	 unsigned int diff;
+
+	 diff = (ni >= mj) ? (ni-mj) : (mj-ni);
+	 uj = (diff > c) ? 0.0 : uj-1+uj*w;
+	 }
+ }
+ p = un;
+ if (p > 1.0) p = 1.0;
+ else if (p < 0.0) p = 0.0;
+
+ SLfree ((char *)u);
+ return p;
+}
+
+/*}}}*/
+
+/* P(X<=s) */
+static double mann_whitney_cdf (unsigned int m, unsigned int n, unsigned int s) /*{{{*/
+{
+ unsigned int M, p;
+ unsigned int m_plus_n, t, u;
+ double *f, c, cf;
+
+ /* min allowed s: 1+2+...m = m(m+1)/2 = min
+ * max allowed s: (n+1)+(n+2)+ .. (n+m) = n*m + min
+ * avg = (min+max)/2 = nm/2 + m(m+1)/2 = (m/2)n+ m+1
+ */
+ M = m*(m+1)/2;
+ if (s < M)
+ return 0.0;
+ M += m*n;
+ if (M <= s)
+ return 1.0;
+
+ M = m*n/2;
+
+ f = (double *)SLmalloc ((M+1)*sizeof(double));
+ if (f == NULL)
+ return -1.0;
+ f0 = 1.0;
+ for (p = 1; p <= M; p++)
+ fp = 0.0;
+
+ m_plus_n = m + n;
+ if (n + 1 < M)
+ {
+	p = m_plus_n;
+	if (p > M) p = M;
+	for (t = n + 1; t <= p; t++)
+	 {
+	 for (u = M; u >= t; u--)
+	 fu -= fu-t;
+	 }
+ }
+ p = m;
+ if (M < p) p = M;
+ for (t = 1; t <= p; t++)
+ {
+	for (u = t; u <= M; u++)
+	 fu += fu-t;
+ }
+
+ c = compute_binomial_coeff (m+n, m);
+ cf = 0.0;
+ for (t = 0; t <= M; t++)
+ {
+	cf += ft/c;
+	ft = cf;
+ }
+
+ s -= m*(m+1)/2;
+ if (s > M)
+ {
+	s = m*n - s;
+	c = 1.0 - fs;
+ }
+ else c = fs;
+ SLfree ((char *) f);
+ return c;
+}
+
+/*}}}*/
+
+/*{{{ Gamma Function */
+
+#ifdef HAVE_LGAMMA
+# define JDMlog_gamma lgamma
+#else
+/* The following code is adapted from my JDMath library */
+
+/* This implementation is derived from
+ * Spouge JL. Computation of the gamma, digamma, and trigamma
+ * functions. SIAM J Numerical Anal 1994;31:931-44.
+ * as pointed out by Glynne Casteel <glynnec@ix.netcom.com> in the
+ * sci.math.num-analysis article <6potip$l56@sjx-ixn4.ix.netcom.com>.
+ */
+
+#define NUM_COEFFS 18		 /* make this even */
+static double Param = NUM_COEFFS + 1; /* 0.840 */
+/* determined empirically using the driver in main at end of the file. */
+
+static double CoeffsNUM_COEFFS+1;
+
+static int Coeffs_Initialized = 0;
+
+static void init_coefficients (void)
+{
+ int i;
+ double e = 2.718281828459045235360287471352;
+ double f = 2.506628274631000502415765284809; /* sqrt(2pi) */
+
+ Coeffs0 = exp (-Param)*f;
+ Coeffs1 = sqrt (Param-1)/e;
+ for (i = 1; i < NUM_COEFFS; i++)
+ {
+	register double x = Param - i;
+
+	Coeffsi+1 = Coeffsi
+	 * ((x - 1)*pow (1-1/x,i-0.5)/(i*e));
+ }
+ Coeffs_Initialized = 1;
+}
+
+static double JDMlog_gamma (double x)
+{
+ register double sum;
+ unsigned int i;
+
+ if (Coeffs_Initialized == 0)
+ init_coefficients ();
+
+ x -= 1.0;
+
+ sum = Coeffs0;
+ i = 1;
+ while (i < NUM_COEFFS)
+ {
+	register double dsum;
+
+	dsum = Coeffsi/(x+i);
+	i++;
+	sum += (dsum - Coeffsi/(x+i));
+	i++;
+ }
+
+ return log(sum) + ((x+0.5)*log(x+Param) - x);
+}
+#endif				 /* HAVE_LGAMMA */
+
+/* See A&S 6.5.4 for a definition. Here, the series expansion given by
+ * A&S 6.5.29 is used:
+ *
+ * gamma_star(a,x) = exp(-x) \sum_n x^n/Gamma(a+n+1)
+ *
+ * Here, Gamma(a+1)=a*Gamma(a), Gamma(a+2)=(a+1)*a*Gamma(a), ....
+ * Thus,
+ *
+ * gamma_star(a,x) = exp(-x)/Gamma(a) \sum_n x^n c_n
+ *
+ * where c_n = 1/(a(a+1)...(a+n)). For a > 0, c_n --> 0, hence based upon
+ * this c_n, the sum will terminate. However, x^n may overflow before this
+ * happens. However, as long as |x| < a, this should not happen. So avoid
+ * this function if |x| > a.
+ */
+static double JDMlog_gamma_star (double a, double x)
+{
+ double sum;
+ int n;
+ double cnxn;
+ double eps = 2.220446049250313e-16;
+
+ if (a == 0.0)
+ return 0.0;
+
+ if (a < 0.0)
+ {
+	/* FIXME!!! Handle a < 0 */
+ }
+
+ cnxn = 1.0 / a;
+ sum = cnxn;
+ n = 0;
+ while (n < 5000)
+ {
+	n++;
+	cnxn *= x/(a+n);
+	if (cnxn < sum*eps)
+	 break;
+	sum += cnxn;
+ }
+
+ return log (sum) - x - JDMlog_gamma (a);
+}
+
+/* This incomplete gamma function has a continued fraction approximation
+ * given by A&S 6.5.31. This expansion may be used to compute the incomplete
+ * Gamma function (A&S 6.5.1) via A&S 6.5.2,3:
+ * Gamma(a,x) = Gamma(a) - P(a,x) Gamma(a)
+ * = Gamma(a) - gamma(a,x)
+ * or
+ * P(a,x) = 1 - Gamma(a,x)/Gamma(a).
+ *
+ * The continued fraction expansion (A&S 6.5.31) is given by:
+ *
+ * Gamma(a,x) = exp(-x)x^a (1/x+ (1-a)/1+ 1/x+ (2-a)/1+ 2/x+ ...)
+ *
+ * Use the recursion relations in theorem 2 of A&S 3.10.1 to evaluate this.
+ * That is, let f_n be defined as
+ *
+ * f_n = b_0 + a_1/b_1+ a_2/b_2+...a_n/b_n := A_n/B_n
+ *
+ * Then:
+ *
+ * A_n = b_n A_{n-1} + a_n A_{n-2}
+ * B_n = b_n B_{n-1} + a_n B_{n-2}
+ *
+ * where A_{-1}=1, A_0=b_0, B_{-1}=0, B_0=1
+ */
+static double JDMlog_CapGamma (double a, double x)
+{
+ double a1, a0, b0, b1;
+ double f;
+ double renorm_factor;
+ double eps = 2.220446049250313e-16;
+ int n;
+
+ if (x <= 0.0)
+ return log(x);		 /* NaN/-Inf */
+
+ /* Set up the recursion at the initial 1/x+ piece */
+ a1 = 1;
+ b1 = x;
+ a0 = 0;
+ b0 = 1;
+
+ renorm_factor = 1.0/b1;
+ f = a1 * renorm_factor;
+ n = 1;
+
+ if (renorm_factor != 0.0) while (n < 5000)
+ {
+	double f1, aa;
+
+	/* Note that the renormalization factor is 1/b1.
+	 * So, replace renorm_factor*b1 combinations by 1 */
+
+	aa = n - a;
+	/* Now the (n-a)/(1+??) piece */
+	a0 = (a1 + aa * a0) * renorm_factor;
+	b0 = (b1 + aa * b0) * renorm_factor;
+
+	/* Since a0,b0 now have the renorm_factor applied, omit it below */
+	/* Handle {1,2,3...}/(x+??) piece */
+	a1 = x * a0 + n * a1 * renorm_factor;
+	/* b1 = x * b0 + n * b1 * renorm_factor;*/
+	b1 = x * b0 + n;
+
+	n++;
+
+	if (b1 == 0.0)
+	 continue;
+
+	renorm_factor = 1.0 / b1;
+	f1 = a1 * renorm_factor;
+
+	if (fabs (f - f1) < eps * fabs(f1))
+	 {
+	 f = f1;
+	 break;
+	 }
+	f = f1;
+ }
+
+ return a * log(x) - x + log (f);
+}
+
+/* See A&S 6.5.1
+ * This is P(a,x) = gamma(a,x)/Gamma(a)
+ */
+static double JDMincomplete_gamma (double a, double x)
+{
+ if (a <= 0.0)
+ return log(a);
+
+ if (x >= a)
+ return 1.0 - exp (JDMlog_CapGamma (a,x) - JDMlog_gamma (a));
+
+ return exp (a * log(x) + JDMlog_gamma_star (a, x));
+}
+
+/*}}}*/
+
+/*{{{ Incomplete Beta */
+
+static int incbeta_cfe (double x, double a, double b, double *result)
+{
+ unsigned int m, maxm = 1024;
+ double c = a+b;
+ double alpha_neg2, alpha_neg1, beta_neg2, beta_neg1;
+ double eps = 1e-14;
+ double last_f;
+ double factor;
+
+ /* factor = a*log(x)+b*log(1.0-x); */
+ factor = a*log(x)+b*log1p(-x);
+ factor += JDMlog_gamma(a+b)-JDMlog_gamma(a) - JDMlog_gamma(b);
+ factor = exp (factor)/a;
+
+ /* F = 1/(1+(d1/(1+(d2/(1+....)))))
+ * F0 = 1/1
+ * F1 = 1/1+ d1
+ * F2 = 1/1+ d1/1+ d2
+ * F_n = alpha_n/beta_n
+ * alpha_n = alpha_{n-1} + d_n*alpha_{n-2}
+ * beta_n = beta_{n-1} + d_n*beta_{n-2}
+ * (d0 = 1)
+ * alpha_{-2} = 1, alpha{-1} = 0, alpha_{0} = 1, alpha_1 = 1,
+ * beta_{-2} = 0, beta_{-1} = 1, beta_{0} = 1, beta_1 = (1+d1),
+ * alpha_2 = 1+d2
+ * beta_2 = (1+d1+d2)
+ * alpha_2/beta_2 = 1/(1+d1/(1+d2)) ok
+ */
+
+ /* This loop computes results for d2, d3, ... So initialize for d1 term */
+ alpha_neg2 = 1.0; alpha_neg1 = 1.0;
+ beta_neg2 = 1.0; beta_neg1 = 1.0-c/(a+1)*x;
+ last_f = alpha_neg1/beta_neg1;
+
+ m = 1;
+ while (m < maxm)
+ {
+	double d,g;
+	unsigned int m2 = 2*m;
+
+	g = a+m2;
+
+	/* even d_2m */
+	d = (m*(b-m)/((g-1.0)*g))*x;
+	alpha_neg2 = alpha_neg1 + d*alpha_neg2;
+	beta_neg2 = beta_neg1 + d*beta_neg2;
+
+	/* odd d_{2m+1} */
+	d = -(((a+m)*(c+m))/(g*(g+1.0)))*x;
+	alpha_neg1 = alpha_neg2 + d*alpha_neg1;
+	beta_neg1 = beta_neg2 + d*beta_neg1;
+
+	/* Renormalize to prevent large alpha/beta */
+	alpha_neg1 /= beta_neg1;
+	alpha_neg2 /= beta_neg1;
+	beta_neg2 /= beta_neg1;
+	beta_neg1 = 1.0;
+
+	if (fabs(alpha_neg1 - last_f) < eps * fabs(alpha_neg1))
+	 {
+	 *result = alpha_neg1*factor;
+	 return 0;
+	 }
+	last_f = alpha_neg1;
+	m++;
+ }
+
+ *result = last_f*factor;
+ return -1;
+}
+
+static int incbeta (double x, double a, double b, double *result)
+{
+ double cfe;
+ int status;
+
+ if ((x < 0.0) || (x > 1.0))
+ {
+	SLang_verror (SL_INVALID_PARM, "Domain error for x in incbeta");
+	*result = -1;
+	return -1;
+ }
+
+ if ((x == 0.0) || (x == 1.0))
+ {
+	*result = x;
+	return 0;
+ }
+
+ /* Use 26.5.8 of A&S --- Note that this condition is different from that
+ * of A&S --- GSL uses this one and it seems to work better.
+ */
+ if (x * (a+b+2.0) < (a+1.0))
+ {
+	status = incbeta_cfe (x, a, b, &cfe);
+ }
+ else
+ {
+	/* Use I_x(a,b) = 1.0 - I_{1-x}(b,a) */
+	status = incbeta_cfe (1.0-x, b, a, &cfe);
+	cfe = 1.0 - cfe;
+ }
+
+ *result = cfe;
+ return status;
+}
+
+/*}}}*/
+
+/*{{{ Intrinsics */
+
+/* See A&S 6.5.13
+ *
+ * This computes: \sum_{0<=k<=n} lambda^k/k! exp(-lambda)
+ * From A&S 6.5.13, this is just 1-P(n+1,lambda)
+ */
+static double poisson_cdf_intrin (double *lambdap, int *np)
+{
+ int n = *np;
+ double lambda = *lambdap;
+
+ if (n < 0)
+ return 0.0;
+
+ n = n+1;
+ if (lambda > 1000.0)
+ {
+	double dn = sqrt(n);
+	if (fabs(lambda - n) < dn)
+	 {
+	 /* Wilson and Hilferty, 1951 */
+	 double c = pow (lambda/n, 1.0/3.0);
+	 double mu = 1.0-1.0/(9.0*n);
+	 double s = 1.0/(3*dn);
+
+	 return 0.5 * (1 - erf((c-mu)/s/sqrt(2.0)));
+	 }
+	/* drop */
+ }
+
+
+ return 1.0 - JDMincomplete_gamma ((double)n, lambda);
+}
+
+/* P(X^2 < chisqr)
+ * A&S 26.4.19
+ */
+static double chisqr_cdf_intrin (int *dofp, double *chisqrp)
+{
+ int dof = *dofp;
+ double chisqr = *chisqrp;
+
+ if (dof <= 0)
+ {
+	SLang_verror (SL_INVALID_PARM, "The number of degrees of freedom should be positive");
+	return -1.0;
+ }
+ if (chisqr < 0)
+ {
+	SLang_verror (SL_INVALID_PARM, "Expecting a non-negative value for the chi-square statistic");
+	return -1.0;
+ }
+ return JDMincomplete_gamma (0.5*dof, 0.5*chisqr);
+}
+
+static double smirnov_cdf_intrin (double *x)
+{
+ return smirnov_cdf (*x);
+}
+
+static double kim_jennrich_cdf_intrin (unsigned int *m, unsigned int *n, unsigned int *c)
+{
+ return kim_jennrich_cdf (*m, *n, *c);
+}
+
+static double mann_whitney_cdf_intrin (unsigned int *m, unsigned int *n, double *s)
+{
+ unsigned int sn = (unsigned int) (*s + 0.5);
+ return mann_whitney_cdf (*m, *n, sn);
+}
+
+/* df needs to be real valued for the welch test */
+static double student_t_cdf_intrin (double *t, double *dfp)
+{
+ double x = *t;
+ double n = *dfp;
+ double cdf;
+
+ (void) incbeta (n/(n+x*x), 0.5*n, 0.5, &cdf);
+ cdf *= 0.5;
+ if (x > 0)
+ cdf = 1.0 - cdf;
+ return cdf;
+}
+
+static double f_cdf_intrin (double *t, double *nu1p, double *nu2p)
+{
+ double x = *t;
+ double cdf;
+ double nu1 = *nu1p, nu2 = *nu2p;
+
+ if (x < 0.0)
+ return 0.0;
+
+ (void) incbeta (nu2/(nu2+nu1*x), 0.5*nu2, 0.5*nu1, &cdf);
+ return 1.0-cdf;
+}
+
+/*}}}*/
+
+/* Mean, Stdev, etc... */
+#define GENERIC_TYPE double
+#define MEAN_FUNCTION mean_doubles
+#define MEAN_RESULT_TYPE double
+#define STDDEV_FUNCTION stddev_doubles
+#define STDDEV_RESULT_TYPE double
+#define MEDIAN_FUNCTION median_doubles
+#define NC_MEDIAN_FUNCTION nc_median_doubles
+#include "stats-module.inc"
+
+#define GENERIC_TYPE float
+#define MEAN_FUNCTION mean_floats
+#define MEAN_RESULT_TYPE float
+#define STDDEV_FUNCTION stddev_floats
+#define STDDEV_RESULT_TYPE float
+#define MEDIAN_FUNCTION median_floats
+#define NC_MEDIAN_FUNCTION nc_median_floats
+#include "stats-module.inc"
+
+#define GENERIC_TYPE int
+#define MEAN_FUNCTION mean_ints
+#define MEAN_RESULT_TYPE double
+#define STDDEV_FUNCTION stddev_ints
+#define STDDEV_RESULT_TYPE double
+#define MEDIAN_FUNCTION median_ints
+#define NC_MEDIAN_FUNCTION nc_median_ints
+#include "stats-module.inc"
+
+#define GENERIC_TYPE unsigned int
+#define MEAN_FUNCTION mean_uints
+#define MEAN_RESULT_TYPE double
+#define STDDEV_FUNCTION stddev_uints
+#define STDDEV_RESULT_TYPE double
+#define MEDIAN_FUNCTION median_uints
+#define NC_MEDIAN_FUNCTION nc_median_uints
+#include "stats-module.inc"
+
+#if SIZEOF_LONG != SIZEOF_INT
+# define GENERIC_TYPE long
+# define MEAN_FUNCTION mean_longs
+# define MEAN_RESULT_TYPE double
+# define STDDEV_FUNCTION stddev_longs
+# define STDDEV_RESULT_TYPE double
+# define MEDIAN_FUNCTION median_longs
+# define NC_MEDIAN_FUNCTION nc_median_longs
+# include "stats-module.inc"
+
+# define GENERIC_TYPE unsigned long
+# define MEAN_FUNCTION mean_ulongs
+# define MEAN_RESULT_TYPE double
+# define STDDEV_FUNCTION stddev_ulongs
+# define STDDEV_RESULT_TYPE double
+# define MEDIAN_FUNCTION median_ulongs
+# define NC_MEDIAN_FUNCTION nc_median_ulongs
+# include "stats-module.inc"
+#else
+# define mean_longs mean_ints
+# define stddev_longs stddev_ints
+# define median_longs median_ints
+# define nc_median_longs nc_median_ints
+# define mean_ulongs mean_uints
+# define stddev_ulongs stddev_uints
+# define median_ulongs median_uints
+# define nc_median_ulongs nc_median_uints
+#endif
+
+#if SIZEOF_SHORT != SIZEOF_INT
+# define GENERIC_TYPE short
+# define MEAN_FUNCTION mean_shorts
+# define MEAN_RESULT_TYPE float
+# define STDDEV_FUNCTION stddev_shorts
+# define STDDEV_RESULT_TYPE float
+# define MEDIAN_FUNCTION median_shorts
+# define NC_MEDIAN_FUNCTION nc_median_shorts
+# include "stats-module.inc"
+
+# define GENERIC_TYPE unsigned short
+# define MEAN_FUNCTION mean_ushorts
+# define MEAN_RESULT_TYPE float
+# define STDDEV_FUNCTION stddev_ushorts
+# define STDDEV_RESULT_TYPE float
+# define MEDIAN_FUNCTION median_ushorts
+# define NC_MEDIAN_FUNCTION nc_median_ushorts
+# include "stats-module.inc"
+#else
+# define mean_shorts mean_ints
+# define stddev_shorts stddev_ints
+# define median_shorts median_ints
+# define nc_median_shorts nc_median_ints
+# define mean_ushorts mean_uints
+# define stddev_ushorts stddev_uints
+# define median_ushorts median_uints
+# define nc_median_ushorts nc_median_uints
+#endif
+
+#define GENERIC_TYPE signed char
+#define MEAN_FUNCTION mean_chars
+#define MEAN_RESULT_TYPE float
+#define STDDEV_FUNCTION stddev_chars
+#define STDDEV_RESULT_TYPE float
+#define MEDIAN_FUNCTION median_chars
+#define NC_MEDIAN_FUNCTION nc_median_chars
+#include "stats-module.inc"
+
+#define GENERIC_TYPE unsigned char
+#define MEAN_FUNCTION mean_uchars
+#define MEAN_RESULT_TYPE float
+#define STDDEV_FUNCTION stddev_uchars
+#define STDDEV_RESULT_TYPE float
+#define MEDIAN_FUNCTION median_uchars
+#define NC_MEDIAN_FUNCTION nc_median_uchars
+#include "stats-module.inc"
+
+static SLarray_Contract_Type Stddev_Functions =
+{
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) stddev_chars},
+ {SLANG_UCHAR_TYPE,SLANG_UCHAR_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) stddev_uchars},
+ {SLANG_SHORT_TYPE,SLANG_SHORT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) stddev_shorts},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) stddev_ushorts},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) stddev_ints},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) stddev_uints},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) stddev_longs},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) stddev_ulongs},
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) stddev_floats},
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) stddev_doubles},
+ {0, 0, 0, NULL}
+};
+
+static void stddev_intrin (void)
+{
+ if (SLang_Num_Function_Args == 0)
+ {
+	SLang_verror (SL_Usage_Error, "x = stddev(X ,dim)");
+	return;
+ }
+ (void) SLarray_contract_array (Stddev_Functions);
+}
+
+static SLCONST SLarray_Contract_Type Mean_Functions =
+{
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) mean_chars},
+ {SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) mean_uchars},
+ {SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) mean_shorts},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) mean_ushorts},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) mean_uints},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) mean_ints},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) mean_longs},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) mean_ulongs},
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) mean_floats},
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) mean_doubles},
+ {0, 0, 0, NULL}
+};
+
+static void mean_intrin (void)
+{
+ if (SLang_Num_Function_Args == 0)
+ {
+	SLang_verror (SL_Usage_Error, "x = mean(X ,dim)");
+	return;
+ }
+ (void) SLarray_contract_array (Mean_Functions);
+}
+
+static SLarray_Contract_Type Median_Functions =
+{
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) median_chars},
+ {SLANG_UCHAR_TYPE,SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, (SLarray_Contract_Fun_Type *) median_uchars},
+ {SLANG_SHORT_TYPE,SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, (SLarray_Contract_Fun_Type *) median_shorts},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, (SLarray_Contract_Fun_Type *) median_ushorts},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_INT_TYPE, (SLarray_Contract_Fun_Type *) median_ints},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_UINT_TYPE, (SLarray_Contract_Fun_Type *) median_uints},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_LONG_TYPE, (SLarray_Contract_Fun_Type *) median_longs},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, (SLarray_Contract_Fun_Type *) median_ulongs},
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) median_floats},
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) median_doubles},
+ {0, 0, 0, NULL}
+};
+
+static SLarray_Contract_Type NC_Median_Functions =
+{
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) nc_median_chars},
+ {SLANG_UCHAR_TYPE,SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, (SLarray_Contract_Fun_Type *) nc_median_uchars},
+ {SLANG_SHORT_TYPE,SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, (SLarray_Contract_Fun_Type *) nc_median_shorts},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, (SLarray_Contract_Fun_Type *) nc_median_ushorts},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_INT_TYPE, (SLarray_Contract_Fun_Type *) nc_median_ints},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_UINT_TYPE, (SLarray_Contract_Fun_Type *) nc_median_uints},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_LONG_TYPE, (SLarray_Contract_Fun_Type *) nc_median_longs},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, (SLarray_Contract_Fun_Type *) nc_median_ulongs},
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) nc_median_floats},
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) nc_median_doubles},
+ {0, 0, 0, NULL}
+};
+
+static void median_nc_intrin (void)
+{
+ if (SLang_Num_Function_Args == 0)
+ {
+	SLang_verror (SL_Usage_Error, "x = median_nc (X ,dim)");
+	return;
+ }
+ (void) SLarray_contract_array (NC_Median_Functions);
+}
+static void median_intrin (void)
+{
+ if (SLang_Num_Function_Args == 0)
+ {
+	SLang_verror (SL_Usage_Error, "x = median (X ,dim)");
+	return;
+ }
+ (void) SLarray_contract_array (Median_Functions);
+}
+
+static void binomial_intrin (void)
+{
+ unsigned int n, k, i;
+ double f;
+ SLindex_Type dims;
+ SLang_Array_Type *at;
+ double *data;
+
+ if (SLang_Num_Function_Args == 2)
+ {
+	if ((-1 == SLang_pop_uint (&k)) || (-1 == (SLang_pop_uint (&n))))
+	 return;
+
+	(void) SLang_push_double (compute_binomial_coeff (n, k));
+	return;
+ }
+
+ if (-1 == SLang_pop_uint (&n))
+ return;
+
+ dims = (SLindex_Type) (n+1);
+ if (NULL == (at = SLang_create_array (SLANG_DOUBLE_TYPE, 0, NULL, &dims, 1)))
+ return;
+
+ data = (double *)at->data;
+ k = n;
+
+ data0 = 1.0;
+ datak = 1.0;
+ f = 1.0;
+ for (i = 1; i <= k; i++)
+ {
+	f = (f/i)*k;
+	k--;
+	datai = datak = f;
+ }
+ (void) SLang_push_array (at, 1);
+}
+
+#if 0
+static void erf_intrin (void)
+{
+ int is_float;
+ SLang_Array_Type *at;
+
+ is_float == (SLang_peek_at_stack1 () == SLANG_FLOAT_TYPE);
+ if (SLang_peek_at_stack () != SLANG_ARRAY_TYPE)
+ {
+	double x;
+	if (is_float)
+	 {
+	 float xf;
+	 if (-1 == SLang_pop_float (&xf))
+	 return;
+	 (void) SLang_push_float ((float) erf((double) xf));
+	 }
+	if (0 == POP_DOUBLE (&x))
+	 (void) SLang_push_double (x);
+	return;
+ }
+ if (is_float)
+ {
+	float *f,
+	if (-1 == SLang_pop_array_of_type (&at, SLANG_FLOAT_TYPE))
+	 return;
+ }
+ xxxxxxxxxx
+}
+#endif
+
+static double normal_cdf_intrin (double *xp)
+{
+ double x = *xp;
+ return 0.5 * (1.0 + erf (x/sqrt(2.0)));
+}
+
+static double kendall_tau_intrin (void)
+{
+ double val, z;
+ size_t n;
+ SLang_Array_Type *at, *bt;
+
+ if (-1 == SLang_pop_array_of_type (&bt, SLANG_ARRAY_INDEX_TYPE))
+ return -1.0;
+ n = bt->num_elements;
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_ARRAY_INDEX_TYPE))
+ {
+	SLang_free_array (bt);
+	return -1.0;
+ }
+ if (at->num_elements != n)
+ {
+	SLang_verror (SL_TYPE_MISMATCH, "kendall_tau: arrays must have the same size");
+	val = -1.0;
+	goto free_and_return;
+ }
+
+ val = _pSLstats_kendall_tau ((SLindex_Type *)at->data, (SLindex_Type *)bt->data, n, &z);
+
+ /* drop */
+
+free_and_return:
+
+ SLang_free_array (at);
+ SLang_free_array (bt);
+ (void) SLang_push_double (z);
+ return val;
+}
+
+static SLang_Intrin_Fun_Type Module_Intrinsics =
+{
+ MAKE_INTRINSIC_1("smirnov_cdf", smirnov_cdf_intrin, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE),
+ MAKE_INTRINSIC_2("chisqr_cdf", chisqr_cdf_intrin, SLANG_DOUBLE_TYPE, SLANG_INT_TYPE, SLANG_DOUBLE_TYPE),
+ MAKE_INTRINSIC_1("_normal_cdf", normal_cdf_intrin, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE),
+ MAKE_INTRINSIC_2("student_t_cdf", student_t_cdf_intrin, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE),
+ MAKE_INTRINSIC_2("_poisson_cdf", poisson_cdf_intrin, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_3("kim_jennrich_cdf", kim_jennrich_cdf_intrin, SLANG_DOUBLE_TYPE, SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_UINT_TYPE),
+ MAKE_INTRINSIC_3("mann_whitney_cdf", mann_whitney_cdf_intrin, SLANG_DOUBLE_TYPE, SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_DOUBLE_TYPE),
+ MAKE_INTRINSIC_3("f_cdf", f_cdf_intrin, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE),
+ MAKE_INTRINSIC_0("mean", mean_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("stddev", stddev_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("median", median_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("median_nc", median_nc_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("binomial", binomial_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_kendall_tau", kendall_tau_intrin, SLANG_DOUBLE_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static SLFUTURE_CONST char *Module_Version_String = MODULE_VERSION_STRING;
+static SLang_Intrin_Var_Type Module_Variables =
+{
+ MAKE_VARIABLE("_stats_module_version_string", &Module_Version_String, SLANG_STRING_TYPE, 1),
+ SLANG_END_INTRIN_VAR_TABLE
+};
+
+static SLang_IConstant_Type Module_IConstants =
+{
+ MAKE_ICONSTANT("_stats_module_version", MODULE_VERSION_NUMBER),
+ SLANG_END_ICONST_TABLE
+};
+
+static SLang_DConstant_Type Module_DConstants =
+{
+ SLANG_END_DCONST_TABLE
+};
+
+int init_stats_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if (
+ (-1 == SLns_add_intrin_var_table (ns, Module_Variables, NULL))
+ || (-1 == SLns_add_intrin_fun_table (ns, Module_Intrinsics, NULL))
+ || (-1 == SLns_add_iconstant_table (ns, Module_IConstants, NULL))
+ || (-1 == SLns_add_dconstant_table (ns, Module_DConstants, NULL))
+ )
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_stats_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/stats-module.h Added

@@ -0,0 +1,29 @@
+#ifndef SLSTATS_MODULE_H_
+# define SLSTATS_MODULE_H_ 1
+/*
+Copyright (C) 2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+/* It is assumed that the array a has already been sorted in ascending or and that b
+ * has been rearranged accordingly
+ */
+extern double _pSLstats_kendall_tau (SLindex_Type *a, SLindex_Type *b, size_t n, double *taup);
+
+#endif				       /* SLSTATS_MODULE_H_ */

_service:tar_scm:slang-2.3.2.tar.bz2/modules/stats-module.inc Added

@@ -0,0 +1,230 @@
+/*-*-C-*-*/
+
+#ifdef MEAN_FUNCTION
+static int MEAN_FUNCTION (VOID_STAR xp, unsigned int inc, unsigned int num, VOID_STAR yp)
+{
+ GENERIC_TYPE *x, *xmax;
+ double c, m, err;
+
+ x = (GENERIC_TYPE *) xp;
+ xmax = x + num;
+
+ num = num/inc;
+ if (num == 0)
+ return 0;
+
+ c = (double) *x;
+ if (num == 1)
+ {
+	*(MEAN_RESULT_TYPE *)yp = (MEAN_RESULT_TYPE) c;
+	return 0;
+ }
+
+ err = 0.0;
+ m = c;
+
+ while (x < xmax)
+ {
+	double v = *x;
+	double dm = (v - c)/num;
+	double m1 = m + dm;
+	err += dm - (m1 - m);
+	m = m1;
+	x += inc;
+ }
+ *(MEAN_RESULT_TYPE *)yp = (MEAN_RESULT_TYPE) (m + err);
+ return 0;
+}
+# undef MEAN_FUNCTION
+# undef MEAN_RESULT_TYPE
+#endif
+
+#ifdef STDDEV_FUNCTION
+static int
+STDDEV_FUNCTION (VOID_STAR xp, unsigned int inc, unsigned int num, VOID_STAR s)
+{
+ unsigned int i, n;
+ double mean_i, variance_i;
+ GENERIC_TYPE *x = (GENERIC_TYPE *) xp;
+ double err;
+
+ err = mean_i = variance_i = 0.0;
+ n = 1;
+ for (i = 0; i < num; i += inc)
+ {
+	double diff, x_i;
+	double dv, v1;
+
+	x_i = xi;
+	diff = x_i - mean_i;
+	mean_i += diff / n;
+	dv = diff * (x_i - mean_i);
+	v1 = variance_i + dv;
+	err += dv - (v1 - variance_i);
+	variance_i = v1;
+	n++;
+ }
+ variance_i += err;
+ n--;
+ if (n > 1)
+ variance_i = sqrt (variance_i / (n - 1));
+ else
+ variance_i = 0.0;
+
+ *(STDDEV_RESULT_TYPE *)s = (STDDEV_RESULT_TYPE) variance_i;
+
+ return 0;
+}
+#undef STDDEV_RESULT_TYPE
+#undef STDDEV_FUNCTION
+#endif
+
+/*
+ * The following code is public domain.
+ * Algorithm by Torben Mogensen, implementation by N. Devillard.
+ * This code in public domain.
+ */
+#ifdef NC_MEDIAN_FUNCTION
+static int NC_MEDIAN_FUNCTION (VOID_STAR ap, unsigned int inc, unsigned int num, VOID_STAR y)
+{
+ unsigned int i, n, m;
+ GENERIC_TYPE *a;
+ GENERIC_TYPE min, max, guess, maxltguess, mingtguess;
+ unsigned int less, greater, equal;
+
+ n = num/inc;
+ if (n == 0)
+ {
+	SLang_set_error (SL_INVALID_PARM);
+	return -1;
+ }
+ a = (GENERIC_TYPE *)ap;
+ m = (n + 1)/2;
+
+ min = max = a0;
+ for (i = 0; i < num; i += inc)
+ {
+	GENERIC_TYPE ai = ai;
+ if (ai < min) min = ai;
+ if (ai > max) max = ai;
+ }
+
+ while (1)
+ {
+	less = 0; greater = 0; equal = 0;
+	/* We want guess=(min+max)/2. But min+max could overflow. So use
+	 * (min+(max-min)+min)/2 = min + (max-min)/2
+	 */
+	guess = min + (max-min)/2;
+ maxltguess = min;
+ mingtguess = max;
+
+ for (i=0; i < num; i += inc)
+	 {
+	 GENERIC_TYPE ai = ai;
+	 if (ai<guess)
+	 {
+		 less++;
+		 if (ai>maxltguess) maxltguess = ai;
+		 continue;
+	 }
+	 if (ai > guess)
+	 {
+		 greater++;
+		 if (ai < mingtguess) mingtguess = ai;
+		 continue;
+	 }
+	 equal++;
+	 }
+ if ((less <= m) && (greater <= m))
+	 break;
+
+ if (less > greater)
+	 max = maxltguess;
+ else
+	 min = mingtguess;
+ }
+ if (less >= m)
+ guess = maxltguess;
+ else if (less + equal < m)
+ guess = mingtguess;
+
+ *(GENERIC_TYPE *)y = guess;
+ return 0;
+}
+#undef NC_MEDIAN_FUNCTION
+#endif
+
+#ifdef MEDIAN_FUNCTION
+static int
+MEDIAN_FUNCTION (VOID_STAR ap, unsigned int inc, unsigned int num, VOID_STAR y)
+{
+ GENERIC_TYPE *aa = (GENERIC_TYPE *) ap;
+ GENERIC_TYPE *a;
+ unsigned int i, j, k, l, m, n;
+
+ n = num/inc;
+ if (n < 3)
+ {
+	if (n == 0)
+	 {
+	 SLang_set_error (SL_INVALID_PARM);
+	 return -1;
+	 }
+	if ((n == 1)
+	 || (*aa < *(aa + inc)))
+	 {
+	 *(GENERIC_TYPE *)y = *aa;
+	 return 0;
+	 }
+	*(GENERIC_TYPE *)y = *(aa + inc);
+	return 0;
+ }
+
+ if (NULL == (a = (GENERIC_TYPE *) SLmalloc (sizeof (GENERIC_TYPE)*n)))
+ return -1;
+
+ for (i = 0; i < n; i++)
+ {
+	ai = *aa;
+	aa += inc;
+ }
+
+ if (n & 1)
+ k = n/2;
+ else
+ k = n/2 - 1;
+
+ l = 0;
+ m = n - 1;
+
+ while (l < m)
+ {
+ GENERIC_TYPE x = ak;
+ i = l;
+ j = m ;
+ do
+	 {
+	 while (ai < x) i++;
+	 while (x < aj) j--;
+	 if (i <= j)
+	 {
+		 GENERIC_TYPE tmp = ai;
+		 ai = aj;
+		 aj = tmp;
+		 i++;
+		 j--;
+	 }
+	 }
+	while (i<=j);
+
+ if (j < k) l=i;
+ if (k < i) m=j;
+ }
+ *(GENERIC_TYPE *) y = ak;
+ SLfree ((char *) a);
+ return 0;
+}
+#undef MEDIAN_FUNCTION
+#endif
+#undef GENERIC_TYPE

_service:tar_scm:slang-2.3.2.tar.bz2/modules/stats.sl Added

@@ -0,0 +1,700 @@
+import ("stats");
+
+% This file contains the following public functions:
+%
+% ks_test One sample Kolmogorov test
+% ad_test Anderson-Darling test
+% ks_test2 Two sample Smirnov test
+% mw_test	 Two sample Mann-Whitney-Wilcoxon test
+% chisqr_test	 Chisqr-test
+% t_test Student t test
+% t_test2 Two-sample Student t test
+% welch_t_test
+% spearman_r Two-sample Spearman rank test
+% kendall_tau Kendall tau correlation test
+% mann_kendall Mann-Kendall trend test
+% pearson_r Pearson's r correlation test
+% correlation 2 sample correlation
+% z_test
+% f_test2 2 sample F test
+% skewness
+% kurtosis
+%
+autoload ("ad_ktest", "statslib/ad_test");
+autoload ("ad_test", "statslib/ad_test");
+autoload ("ks_test", "statslib/ks_test");
+autoload ("ks_test2", "statslib/ks_test");
+autoload ("kuiper_test", "statslib/kuiper");
+autoload ("kuiper_test2", "statslib/kuiper");
+
+define normal_cdf ()
+{
+ variable m, s, a;
+ variable nargs = _NARGS;
+
+ switch (nargs)
+ {
+ case 1:
+	m = NULL, s = NULL;
+ }
+ {
+ case 3:
+	(m, s) = ();
+ }
+ {
+	_pop_n (nargs);
+	usage ("cdf = normal_cdf (A , mean, stddev)");
+ }
+ a = ();
+
+ if (nargs != 1)
+ a = (a-m)/double(s);
+
+ if (typeof (a) == Array_Type)
+ return array_map (Double_Type, &_normal_cdf, a);
+
+ return _normal_cdf (a);
+}
+
+define poisson_cdf ()
+{
+ variable lam, n;
+ if (_NARGS != 2)
+ {
+	_pop_n (_NARGS);
+	usage ("cdf = poisson_cdf (lambda, n)");
+ }
+ (lam, n) = ();
+
+ if ((typeof (n) == Array_Type) or (typeof (lam) == Array_Type))
+ return array_map (Double_Type, &_poisson_cdf, lam, n);
+
+ return _poisson_cdf (lam, n);
+}
+
+define sample_mean ()
+{
+ variable args = __pop_args (_NARGS);
+ return mean (__push_args(args));
+}
+
+% These functions return the biased stddev
+define sample_stddev ()
+{
+ variable x = ();
+ variable n = 1.0*length (x);
+ return stddev(x) * sqrt((n-1.0)/n);
+}
+
+private define get_mean_stddev (x)
+{
+ variable m = mean(x);
+ variable n = 1.0*length (x);
+ variable s = stddev(x) * sqrt((n-1.0)/n);
+ return m, s, n;
+}
+
+define skewness ()
+{
+ if (_NARGS != 1)
+ usage ("s = %s(A);", _function_name ());
+ variable x = ();
+ variable m, s, n;
+ (m, s, n) = get_mean_stddev (x);
+
+ x = sum (((x - m)/s)^3)/n;
+
+ if ((s == 0.0) && isnan (x))
+ x = 0.0;
+
+ return x;
+}
+
+define kurtosis ()
+{
+ if (_NARGS != 1)
+ usage ("s = %s(A);", _function_name ());
+ variable x = ();
+ variable m, s, n;
+ (m, s, n) = get_mean_stddev (x);
+
+ x = sum (((x - m)/s)^4)/n - 3.0;
+
+ if ((s == 0.0) && isnan (x))
+ x = 0.0;
+
+ return x;
+}
+
+define covariance ()
+{
+ variable n = _NARGS;
+ if (n == 0)
+ usage ("Sigma = covariance (X1, X2, ..., Xn ;qualifiers)\n" +
+	 "Qualifiers:\n" +
+	 " mu=mu1,mu2,..,muN (expected values E(Xi))"
+	 );
+
+ variable Xs = __pop_list (n);
+ variable i, m = length (Xs0);
+ _for i (0, n-1, 1)
+ {
+	if (length (Xsi) != m)
+	 throw InvalidParmError, "Arrays must be of the same size";
+ }
+ variable mus = qualifier ("mu");
+ variable norm = 1.0;
+ if (mus == NULL)
+ {
+	mus = Double_Typen;
+	_for i (0, n-1, 1)
+	 musi = mean (Xsi);
+	norm = m/(m-1.0);
+ }
+ if (length (mus) != n)
+ throw InvalidParmError, "The value mu qualifier has the wrong length";
+
+ variable cov = Double_Typen,n;
+ _for i (0, n-1, 1)
+ {
+	variable j;
+	variable dx_i = Xsi-musi;
+	_for j (i, n-1, 1)
+	 {
+	 variable c = norm * mean (dx_i*(Xsj - musj));
+	 covi,j = c;
+	 covj,i = c;
+	 }
+ }
+ return cov;
+}
+
+% This function assumes the distribution is symmetric
+private define map_cdf_to_pval (cdf)
+{
+ variable side = qualifier ("side", NULL);
+
+ variable pval = cdf;		 % side="<"
+ if (side == ">")
+ pval = 1.0 - cdf;
+ else if (side != "<")	 % double-sided
+ pval = 2.0 * _min (1.0-pval, pval);
+
+ return pval;
+}
+
+define chisqr_test ()
+{
+ variable t_ref = NULL;
+ variable nr = _NARGS;
+ if (nr > 1)
+ {
+	t_ref = ();
+	if (typeof (t_ref) == Ref_Type)
+	 nr--;
+	else
+	 {
+	 t_ref;		 % push it back
+	 t_ref = NULL;
+	 }
+ }
+
+ if (nr < 2)
+ {
+	usage ("p=%s(X,Y,...,Z ,&T)", _function_name);
+ }
+ variable args = __pop_args (nr);
+ variable datasets = Array_Typenr;
+ variable nc = length (args0.value);
+ variable c = Double_Typenc;
+
+ _for (0, nr-1, 1)
+ {
+	variable i = ();
+	variable d = argsi.value;
+	if (length (d) != nc)
+	 verror ("The chisqr test requires datasets to be of the same length");
+	datasetsi = d;
+	c += d;
+ }
+ variable N = sum (c);
+ variable t = 0.0;
+ _for (0, nr-1, 1)
+ {
+ i = ();
+	d = datasetsi;
+	variable e = sum (d)/N * c;
+	t += sum((d-e)^2/e);
+ }
+
+ if (t_ref != NULL)
+ @t_ref = t;
+
+ return 1.0 - chisqr_cdf ((nr-1)*(nc-1), t);
+}
+
+% Usage: r = compute_rank (X, &tie_fun ,&tied_groups)
+% Here, if tied_groups is non-NULL, it will be an array whose length
+% represents the number of tied groups, and each element being the number
+% within the kth group.
+private define compute_rank ()
+{
+ variable x, tie_fun = &mean, group_ties_ref = NULL;
+ if (_NARGS == 3)
+ group_ties_ref = ();
+ if (_NARGS >= 2)
+ tie_fun = ();
+ x = ();
+ if (tie_fun == NULL)
+ tie_fun = &mean;
+
+ variable indx = array_sort (x);
+ x = xindx;
+ variable n = length (x);
+ variable r = double(1:n);
+
+ % Worry about ties
+ variable ties;
+ () = wherediff (x, &ties);
+ % Here, ties is an array of indices {j} where xj-1==xj.
+ % We want those where xj == xj+1.
+ ties -= 1;
+
+ variable m = length (ties);
+ variable group_ties = Int_Type0;
+ if (m)
+ {
+	variable i = 0;
+	variable g = 0;
+	group_ties = Int_Typem;
+	while (i < m)
+	 {
+	 variable ties_i = tiesi;
+	 variable j = i;
+	 j++;
+	 variable dties = ties_i - i;
+	 while ((j < m) && (dties + j == tiesj))
+	 j++;
+
+	 variable dn = j - i;
+	 i = ties_i:ties_i+dn;
+	 ri = (@tie_fun)(ri);
+	 group_tiesg = dn+1;
+	 i = j;
+	 g++;
+	 }
+	group_ties = group_ties0:g-1;
+ }
+
+ if (group_ties_ref != NULL)
+ @group_ties_ref = group_ties;
+
+ % Now put r back in the order of x before it was sorted.
+ return rarray_sort(indx);
+}
+
+% Min sum: 1+2+...+n = n*(n+1)/2
+% Max sum: (m+1) + (m+2) + ... (m+n) = n*m + n*(n+1)/2
+% Average: (n*(n+1) + n*m)/2 = n*(n+m+1)/2
+define mw_test ()
+{
+ variable w_ref = NULL;
+ if (_NARGS == 3)
+ w_ref = ();
+ else if (_NARGS != 2)
+ {
+	usage ("p = %s (X1, Y1 ,&w); %% Two-Sample Mann-Whitney",
+	 _function_name ());
+ }
+ variable x, y;
+ (x, y) = ();
+ variable side = qualifier ("side", NULL);
+
+ variable n = length (x), m = length (y);
+ variable N = m+n;
+ variable mn = m*n;
+
+ variable gties;
+ variable r = compute_rank (x,y, &mean, &gties);
+ variable w = sum (r0:n-1);
+
+ variable has_ties = length (gties);
+#iffalse
+ if (has_ties)
+ vmessage ("*** Warning: mw_test: ties found--- using asymptotic cdf");
+#endif
+
+ variable p;
+
+ if (has_ties || ((m > 50) && (n > 50)))
+ {
+	% Asymptotic
+	variable wstar = w - 0.5*n*(N+1);
+	variable vw = (mn/12.0)*(N+1 - sum((gties-1)*gties*(gties+1))/(N*(N-1)));
+
+	p = normal_cdf (wstar/sqrt(vw));
+
+	if (side == ">")
+	 p = 1.0 - p;
+	else if (side != "<")
+	 p = 2 * _min (p, 1.0-p);
+ }
+ else
+ {
+	% exact
+	if (side == ">")
+	 p = 1.0 - mann_whitney_cdf (n, m, w);
+	else if (side == "<")
+	 p = mann_whitney_cdf (n, m, w);
+	else
+	 {
+	 p = mann_whitney_cdf (n, m, w);
+	 p = 2 * _min (p, 1-p);
+	 }
+ }
+
+ if (w_ref != NULL)
+ @w_ref = w;
+
+ return p;
+}
+
+define t_test ()
+{
+ variable x, mu;
+ variable tref = NULL;
+
+ if (_NARGS == 2)
+ (x,mu) = ();
+ else if (_NARGS == 3)
+ (x,mu,tref) = ();
+ else
+ {
+	usage ("p = t_test (X, mu ,&t ; qualifiers); %% Student's t-test\n"
+	 + "Qualifiers:\n"
+	 + " side=\"<\" | \">\""
+	 );
+ }
+
+ variable n = length (x);
+ variable stat = sqrt(n)*((mean(x) - mu)/stddev(x));
+ if (tref != NULL) @tref = stat;
+
+ return map_cdf_to_pval (student_t_cdf(stat, n-1) ;; __qualifiers);
+}
+
+define t_test2 ()
+{
+ variable x, y;
+ variable tref = NULL;
+
+ if (_NARGS == 2)
+ (x,y) = ();
+ else if (_NARGS == 3)
+ (x,y,tref) = ();
+ else
+ {
+	usage ("p = t_test2 (X, Y ,&t ; qualifiers); %% Student's 2 sample (unpaired) t-test\n"
+	 + "Qualifiers:\n"
+	 + " side=\"<\" | \">\""
+	 );
+ }
+ variable side = qualifier ("side", NULL);
+
+ variable nx = length (x), mx = mean(x), sx = stddev (x);
+ variable ny = length (y), my = mean(y), sy = stddev (y);
+ variable df = nx+ny-2;
+ variable stat
+ = (mx-my)/sqrt((((nx-1)*sx*sx+(ny-1)*sy*sy)*(nx+ny))/(nx*ny*df));
+
+ if (tref != NULL) @tref = stat;
+
+ return map_cdf_to_pval (student_t_cdf(stat, df) ;; __qualifiers);
+}
+
+define welch_t_test ()
+{
+ variable x, y;
+ variable tref = NULL;
+
+ if (_NARGS == 2)
+ (x,y) = ();
+ else if (_NARGS == 3)
+ (x,y,tref) = ();
+ else
+ {
+	usage ("p = welch_t_test2 (X, Y ,&t ; qualifiers); %% Welch's 2 sample t-test\n"
+	 + "Qualifiers:\n"
+	 + " side=\"<\" | \">\""
+	 );
+ }
+ variable side = qualifier ("side", NULL);
+
+ variable nx = length (x), mx = mean(x), sx = stddev (x), vx = sx*sx/nx;
+ variable ny = length (y), my = mean(y), sy = stddev (y), vy = sy*sy/ny;
+ variable vxvy = vx+vy;
+ variable stat = (mx-my)/sqrt(vxvy);
+ variable df = (vxvy*vxvy)/((vx*vx)/(nx-1) + (vy*vy)/(ny-1));
+
+ if (tref != NULL) @tref = stat;
+
+ return map_cdf_to_pval (student_t_cdf(stat, df) ;; __qualifiers);
+}
+
+define z_test ()
+{
+ variable x, mu, sigma;
+ variable tref = NULL;
+
+ if (_NARGS == 4)
+ tref = ();
+ else if (_NARGS != 3)
+ {
+	usage ("p = z_test (X, mu, sigma ,&stat ; qualifiers);\n"
+	 + "Qualifiers:\n"
+	 + " side=\"<\" | \">\""
+	 );
+ }
+ (x, mu, sigma) = ();
+ variable side = qualifier ("side", NULL);
+
+ variable n = length (x);
+ variable stat = (mean(x)-mu)/(sigma/sqrt(n));
+ if (tref != NULL) @tref = stat;
+
+ return map_cdf_to_pval (normal_cdf(stat) ;; __qualifiers);
+}
+
+define f_test2 ()
+{
+ variable x, y;
+ variable tref = NULL;
+
+ if (_NARGS == 2)
+ (x,y) = ();
+ else if (_NARGS == 3)
+ (x,y,tref) = ();
+ else
+ {
+	usage ("p = f_test2 (X, Y ,&t ; qualifiers); %% 2 sample F-test\n"
+	 + "Qualifiers:\n"
+	 + " side=\"<\" | \">\""
+	 );
+ }
+ variable side = qualifier ("side", NULL);
+
+ variable v1 = stddev(x)^2;
+ variable v2 = stddev(y)^2;
+ variable n1 = length(x)-1;
+ variable n2 = length(y)-1;
+ variable swap = 0;
+ if (v1 < v2)
+ {
+	swap = 1;
+	(v1, v2) = (v2, v1);
+	(n1, n2) = (n2, n1);
+ }
+ variable stat = (v1/v2);
+
+ variable pval = f_cdf (stat, n1, n2);
+ if (side == ">")
+ {
+	if (swap)
+	 pval = 1.0 - pval;
+ }
+ else if (side == "<")
+ {
+	ifnot (swap)
+	 pval = 1.0 - pval;
+ }
+ else
+ pval = 2.0 * _min (1.0-pval, pval);
+
+ if (tref != NULL) @tref = stat;
+ return pval;
+}
+
+define spearman_r ()
+{
+ variable w_ref = NULL;
+ if (_NARGS == 3)
+ w_ref = ();
+ else if (_NARGS != 2)
+ {
+	usage ("p = %s (X1, Y1 ,&r); %% Spearman's rank correlation",
+	 _function_name ());
+ }
+ variable x, y;
+ (x, y) = ();
+ variable n = length (y), m = length (x);
+
+ variable gties_x, gties_y;
+ variable rx = compute_rank (x, &mean, &gties_x);
+ variable ry = compute_rank (y, &mean, &gties_y);
+
+ variable d = sum ((rx-ry)^2);
+ variable cx = sum(gties_x*(gties_x*gties_x-1.0));
+ variable cy = sum(gties_y*(gties_y*gties_y-1.0));
+
+ variable den = double(n) * (n+1.0) * (n-1.0);
+
+ variable r = (1.0 - 6.0*(d+(cx+cy)/12.0)/den)
+ / sqrt((1.0-cx/den)*(1.0-cy/den));
+ if (w_ref != NULL)
+ @w_ref = r;
+
+ variable t = r * sqrt ((n-2)/(1-r*r));
+
+ return map_cdf_to_pval (student_t_cdf(t,n-2) ;; __qualifiers);
+}
+
+% This function is assumed to always pass back a new array.
+private define compute_integer_rank (x, is_sorted)
+{
+ variable n = length (x);
+ variable indx = NULL, rev_indx = NULL;
+ ifnot (is_sorted)
+ {
+	indx = array_sort (x);
+	x = xindx;
+	% Create a reverse-permutation to restore the array order
+	% upon return.
+	rev_indx = 0:n-1;
+	rev_indxindx = @rev_indx;
+ }
+
+ variable r = 1:n;
+
+ % Account for ties
+ variable ties;
+ () = wherediff (x, &ties);
+ % Here, ties is an array of indices {j} where xj-1==xj.
+ % We want those where xj == xj+1.
+ ties -= 1;
+
+ variable m = length (ties);
+ variable i = 0, j;
+ while (i < m)
+ {
+	variable ties_i = tiesi;
+	j = i;
+	j++;
+	variable dties = ties_i - i;
+	while ((j < m) && (dties + j == tiesj))
+	 j++;
+
+	variable dn = j - i;
+	i = ties_i:ties_i+dn;
+	ri = rties_i;
+	i = j;
+ }
+
+ if (indx == NULL)
+ return r;
+
+ return rrev_indx;
+}
+
+define kendall_tau ()
+{
+ variable w_ref = NULL;
+ if (_NARGS == 3)
+ w_ref = ();
+ else if (_NARGS != 2)
+ {
+	usage ("p = %s (X1, Y1 ,&r); %% Kendall's tau correlation",
+	 _function_name ());
+ }
+
+ variable x, y;
+ (x, y) = ();
+ variable n = length (x);
+ if (n != length (y))
+ throw InvalidParmError, "Arrays must be the same length for kendall_tau";
+
+ % _kendall_tau will modify the contents of the arrays. Be sure to
+ % pass new instances to it. The sort operation below will achieve
+ % that.
+ variable i = array_sort (x);
+ x = compute_integer_rank (xi, 1);
+ y = compute_integer_rank (yi, 0);
+
+ variable tau, z;
+
+ (tau, z) = _kendall_tau (x, y);
+
+ if (w_ref != NULL)
+ @w_ref = tau;
+
+ return map_cdf_to_pval (z ;; __qualifiers);
+}
+
+define mann_kendall ()
+{
+ variable w_ref = NULL;
+ if (_NARGS == 2)
+ w_ref = ();
+ else if (_NARGS != 1)
+ {
+	usage ("p = %s (X ,&r); %% Mann-Kendall trend test",
+	 _function_name ());
+ }
+
+ variable x;
+ x = ();
+ variable n = length (x);
+ variable i = 0:n-1;
+
+ % _kendall_tau will modify the contents of the arrays. Be sure to
+ % pass new instances to it. compute_integer_rank will create a new
+ % instance.
+ x = compute_integer_rank (x, 0);
+ variable tau, z;
+ (tau, z) = _kendall_tau (i, x);
+
+ if (w_ref != NULL)
+ @w_ref = tau;
+
+ return map_cdf_to_pval (z ;; __qualifiers);
+}
+
+define pearson_r ()
+{
+ variable w_ref = NULL;
+ if (_NARGS == 3)
+ w_ref = ();
+ else if (_NARGS != 2)
+ {
+	usage ("p = %s (X1, Y1 ,&r ; qualifiers); %% Pearson's r correlation\n", +
+	 "Qualifiers:\n" +
+	 " side=\"<\" | \">\"",
+	 _function_name ());
+ }
+
+ variable x, y;
+ (x, y) = ();
+ variable n = length(x);
+ % Note: covariance handles the 1/(N-1) normalization factor
+ variable r = covariance (x, y)0,1/(stddev(x)*stddev(y));
+ if (w_ref != NULL)
+ @w_ref = r;
+
+ % This is meaningful only for gaussian distributions
+ variable df = length(x)-2;
+ r = sqrt(df)*r/sqrt(1-r*r);
+ return map_cdf_to_pval (student_t_cdf (r, df) ;; __qualifiers);
+}
+
+define correlation ()
+{
+ if (_NARGS != 2)
+ usage ("c = correlation (X, Y);");
+ variable x, y; (x,y) = ();
+ variable n = length(x);
+ if (n != length(y))
+ throw InvalidParmError, "Arrays must be the same length";
+ variable mx = mean(x), sx = stddev(x), my = mean(y), sy = stddev(y);
+ return sum ((x-mx)*(y-my))/((n-1)*sx*sy);
+}
+
+provide ("stats");

_service:tar_scm:slang-2.3.2.tar.bz2/modules/stats_kendall.c Added

@@ -0,0 +1,383 @@
+/*
+Copyright (C) 2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include "config.h"
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <math.h>
+#include <slang.h>
+
+#include "_slint.h"
+#include "stats-module.h"
+
+static double alnorm (double x, int use_upper)
+{
+ double cdf;
+ cdf = 0.5 * (1.0 + erf (x/sqrt(2.0)));
+ if (use_upper) return 1.0 - cdf;
+ return cdf;
+}
+
+static int prtaus_large_n (_pSLint64_Type is, _pSLint64_Type n, double *probp)
+{
+ double h15;
+ double x, r, sc, p;
+ int i;
+
+ /* PROBABILITIES CALCULATED BY MODIFIED EDGEWORTH SERIES FOR N GREATER THAN 8 */
+ /* CALCULATION OF TCHEBYCHEFF-HERMITE POLYNOMIALS */
+ x = (is-1.0) / sqrt((6.0 + n*(5.0-n*(3.0+2*n)))/(-18.0));
+ h0 = x;
+ h1 = x*x - 1.0;
+ for (i = 2; i < 15; i++)
+ {
+	hi = x * hi-1 - (i-1.0)*hi-2;
+ }
+
+ r = 1.0 / n;
+ sc = r*(h2*(r*(r*(r*0.506f - 0.5325f) + 0.045f) - 0.09f)
+	 + r*(h4*(r*(r*0.3214f - 0.036735f) + 0.036735f)
+		+ h6*(r*(r*0.07787f - 0.023336f) + 0.00405f)
+		+ r*(h8*(-.0033061f - r*0.0065166f)
+		 + h10*(r*0.0025927f - 1.215e-4f)
+		 + r*(h12*1.4878e-4f + h14*2.7338e-6f))));
+
+ p = alnorm (x,1) + sc*0.398942*exp(-0.5*x*x);
+ if (p < 0.0) p = 0.0;
+ if (p > 1.0) p = 1.0;
+ *probp = p;
+
+ return 0;
+}
+
+
+/*
+ * ALGORITHM AS 71 APPL. STATIST. (1974) VOL.23, NO.1
+ *
+ * GIVEN A VALUE OF IS CALCULATED FROM TWO RANKINGS (WITHOUT TIES)
+ * OF N OBJECTS, THE FUNCTION COMPUTES THE PROBABILITY OF
+ * OBTAINING A VALUE GREATER THAN, OR EQUAL TO, IS.
+ *
+ */
+static int prtaus (_pSLint64_Type is, _pSLint64_Type n, double *probp)
+{
+#define MAX_N_EXACT 30
+#define MAX_L_COLS ((MAX_N_EXACT)*(MAX_N_EXACT-1)/4 + 2)
+ _pSLint64_Type row0MAX_L_COLS; /* allow 1-based indexing */
+ _pSLint64_Type row1MAX_L_COLS; /* allow 1-based indexing */
+ _pSLint64_Type *curr, *prev;
+ _pSLint64_Type i, il, k, m, im;
+
+ if (n > MAX_N_EXACT)
+ return prtaus_large_n (is, n, probp);
+
+ /* Use recurrence relation for n <= MAX_N_EXACT */
+
+ *probp = 1.0;
+
+ m = n*(n-1)/2;
+ if (is >= 0) m -= is; else m += is;
+ if ((m == 0) && (is <= 0)) return 0;
+
+ if (is < 0) m = m - 2;
+ im = m/2;
+
+ memset (row0, 0, (im+1)*sizeof(_pSLint64_Type));
+ memset (row1, 0, (im+1)*sizeof(_pSLint64_Type));
+ prev = row0; prev0 = 1;
+ curr = row1; curr0 = 1;
+
+ il = 0;
+ i = 1;
+ m = 1;
+ while (i < n)
+ {
+	_pSLint64_Type *tmp;
+	_pSLint64_Type in, io;
+
+	tmp = curr; curr = prev; prev = tmp;
+ il += i;
+ i++;
+ m = m*i;
+	k = (im < il) ? im : il;
+
+	k++;
+	in = 1;
+	io = (i <= k) ? i : k;
+	while (in < io)
+	 {
+	 currin = currin-1 + previn;
+	 in++;
+	 }
+	io = 0;
+	while (in < k)
+	 {
+	 currin = currin-1 + previn - previo;
+	 io++;
+	 in++;
+	 }
+ }
+
+ k = 0;
+ for (i = 0; i <= im; i++)
+ k += curri;
+
+ *probp = ((double) k)/m;
+ if (is < 0) *probp = 1.0 - *probp;
+
+ return 0;
+}
+
+static _pSLuint64_Type kendall_insertion_sort (SLindex_Type *arr, size_t num)
+{
+ size_t maxj, i;
+ _pSLuint64_Type nexch;
+
+ if (num < 2) return 0;
+
+ nexch = 0;
+ i = maxj = num - 1;
+ while (i--)
+ {
+ size_t j = i;
+ SLindex_Type val = arri;
+
+	while ((j < maxj) && (arrj+1 < val))
+	 {
+	 arrj = arrj+1;
+	 j++;
+	 }
+ arrj = val;
+	nexch += (j - i);
+ }
+ return nexch;
+}
+
+static _pSLuint64_Type kendall_merge (SLindex_Type *left, size_t left_num,
+			 SLindex_Type *right, size_t right_num,
+			 SLindex_Type *work)
+{
+ _pSLuint64_Type nexch = 0;
+
+ while (left_num && right_num)
+ {
+ if (*right < *left)
+	 {
+	 *work++ = *right++;
+	 right_num--;
+	 nexch += left_num;
+	 continue;
+	 }
+
+	*work++ = *left++;
+	left_num--;
+ }
+
+ if (left_num)
+ memcpy(work, left, left_num * sizeof(SLindex_Type));
+ else if (right_num)
+ memcpy(work, right, right_num * sizeof(SLindex_Type));
+
+ return nexch;
+}
+
+static _pSLuint64_Type kendall_merge_sort(SLindex_Type *a, size_t num, SLindex_Type *work)
+{
+ _pSLuint64_Type nexch;
+ size_t left_num, right_num;
+ SLindex_Type *left, *right;
+
+ if (num < 8)
+ return kendall_insertion_sort (a, num);
+
+ left = a;
+ left_num = num/2;
+ right = a + left_num;
+ right_num = num - left_num;
+
+ nexch = kendall_merge_sort(left, left_num, work);
+ nexch += kendall_merge_sort(right, right_num, work);
+ nexch += kendall_merge(left, left_num, right, right_num, work);
+
+ memcpy(a, work, num * sizeof(SLindex_Type));
+ return nexch;
+}
+
+/* This also computes the quantities needed for the p-value. From wikipedia:
+ * v = sum(x*(x-1)*(2*x+5))
+ * v1 = sum (x*(x-1))
+ * v2 = sum(x*(x-1)*(x-2))
+ * where x is the number of tied values in a group.
+ */
+static _pSLuint64_Type
+kendall_count_tied_pairs (SLindex_Type *a, size_t num,
+			 _pSLuint64_Type *v, _pSLuint64_Type *v1, _pSLuint64_Type *v2)
+{
+ _pSLuint64_Type n = 0;
+ size_t i;
+
+ i = 1;
+ while (i < num)
+ {
+	_pSLuint64_Type di, dn;
+	size_t i0;
+
+	if (ai != ai-1)
+	 {
+	 i++;
+	 continue;
+	 }
+
+	/* In a group with ties */
+	i0 = i-1;
+	i++;
+	while ((i < num) && (ai == ai-1))
+	 i++;
+
+	di = i-i0;
+	dn = di*(di-1);
+	*v1 += dn;
+	*v2 += dn*(di-2);
+	*v += dn * (2*di+5);
+	n += dn/2;
+
+	i++;
+ }
+
+ return n;
+}
+
+/*
+ * This function assumes that the input arrays are sorted on the first array.
+ * That is, the slang code that wraps this will have to do:
+ *
+ * i = array_sort (a);
+ * a = ai; b = i;
+ *
+ * The basic idea is the following:
+ * 
+ * The total number of pairs formed from an array of size N is
+ * n0 = N*(N-1)/2. Consider 2 such arrays A and B. Then consider the ith and
+ * jth elemnts of the arrays, where j>i. One of the following will be true:
+ *
+ * Ai>Aj and Bi>Bj "concordent"
+ * Ai<Aj and Bi<Bj "concordent"
+ * Ai>Aj and Bi<Bj "disconcordent"
+ * Ai<Aj and Bi>Bj "disconcordent"
+ * Ai=Aj and Bi!=Bj "A is tied"
+ * Ai!=Aj and Bi=Bj "B is tied"
+ * Ai=Aj and Bi=Bj "joint tie"
+ *
+ * Then: n0 = nc + nd + (t + v) + u
+ * n0 = nc + nd + (u + v) + t
+ * where nc=num concordent, nd = num disconcordent, t=A ties, u=B ties, v=joint ties
+ *
+ * Let t+v = nA = total number of ties in A (includes joint)
+ * u+v = nB = total number of ties in B (includes joint)
+ * Then: n0 = nc + nd + nA + u
+ * 
+ * nc + nd = n0 - nA - u
+ * = n0 - nA - (nB - v)
+ * = n0 + v - (nA + nB)
+ * Knight indicates that nd is equal to the number of exchanges (ne) in sorting B.
+ * Hence:
+ *
+ * nc - nd = (nc + nd) - 2*ne
+ * = (n0 + v) - (nA + nB + 2*ne)
+ */
+double _pSLstats_kendall_tau (SLindex_Type *a, SLindex_Type *b, size_t num, double *taup)
+{
+ double tau, sigma, prob;
+ _pSLuint64_Type n0, na, nb, ne, v;
+ _pSLuint64_Type va, va1, va2, vb, vb1, vb2;
+ size_t i;
+
+ n0 = num;
+ n0 = n0*(n0-1)/2;
+
+ na = v = 0;
+ va = va1 = va2 = 0;
+ vb = vb1 = vb2 = 0;
+
+ i = 1;
+ while (i < num)
+ {
+	_pSLuint64_Type di;
+	size_t i0;
+
+	if (ai-1 != ai)
+	 {
+	 i++;
+	 continue;
+	 }
+
+	i0 = i - 1;
+	i++;
+	while ((i < num) && (ai-1 == ai))
+	 i++;
+
+	di = i-i0;
+	na += di*(di-1)/2;
+
+	(void) kendall_insertion_sort (b+i0, di);
+	v += kendall_count_tied_pairs(b+i0, di, &va, &va1, &va2);
+	i++;			 /* ok to do since if i<num, the ai-1!=ai */
+ }
+
+ /* Sort b, using a as workspace */
+ ne = kendall_merge_sort (b, num, a);
+ nb = kendall_count_tied_pairs (b, num, &vb, &vb1, &vb2);
+
+ /* Of no ties, use exact probability distribution */
+ if ((na == 0) && (nb == 0))
+ {
+	_pSLint64_Type is;
+
+	if (n0 < 2*ne)
+	 is = -(_pSLint64_Type)(2*ne - n0);
+	else
+	 is = (_pSLint64_Type)(n0 - 2*ne);
+
+	*taup = ((double)is)/n0;
+
+	/* prob is probability of getting a statistic >= is. */
+	(void) prtaus (is, num, &prob);
+	prob = 1.0 - prob;	 /* prob of statistic < is */
+	/* fprintf (stdout, "prtaus: num=%lu, is=%lu, prob=%g\n", num, is, prob); */
+	return prob;
+ }
+
+ /* Otherwise, use normal distributuon */
+ tau = (n0 + v - na - nb - ne); /* This should be >= 0 */
+ tau -= ne;			 /* may be < 0 */
+
+ /* From wikipedia */
+ sigma = (n0*(4.0*num+10.0) - va - vb)/18.0;
+ sigma += va1*(double)vb1/(4.0*n0);
+ sigma += va2*(double)vb2/(18.0*n0*(num-2));
+ sigma = sqrt (sigma);
+
+ *taup = tau/sqrt(n0-na)/sqrt(n0-nb); /* avoid overflow */
+
+ /* To compute the probability use the continuity correction recommended by Kendall */
+ if (tau > 0) tau -= 1; else if (tau < 0) tau += 1;
+ return 0.5 * (1.0 + erf (tau/sigma/sqrt(2.0)));
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/statslib Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/statslib/ad_test.sl Added

@@ -0,0 +1,372 @@
+% Anderson-Darling Tests
+% 
+% The k-sample test was implemented from the equations found in
+% Scholz F.W. and Stephens M.A., "K-Sample Anderson-Darling Tests",
+% Journal of the American Statistical Association, Vol 82, 399 (1987)
+%
+private define get_unique_and_tied (a)
+{
+ variable n = length (a);
+ variable i = array_sort (a);
+ variable z = a__tmp(i);
+
+ if (z0 == z-1)
+ return z0, n;
+
+ variable j, k;
+ % Algorithm examples:
+ % z = 1, 2, 2, 3, 4, 4, 4; 1,2
+ % shift(z,-1) = 4, 1, 2, 2, 3, 4, 4; 2,1
+ % z!=sh(z) = 1, 1, 0, 1, 1, 0, 0; 1,1
+ % j=where(&k) = 0,1,3,4; 0,1
+ % k = 2,5,6; 
+ % k-1 = 1,4,5; 
+ j = where (shift (z,-1) != z, &k);
+
+ variable multiplicity = Int_Typen + 1;
+ variable nk = length(k);
+ i = 0;
+ while (i < nk)
+ {
+	variable count = 0;
+	variable k0 = ki, k1 = k0;
+	while ((i < nk) && (ki == k1))
+	 {
+	 k1++;
+	 i++;
+	 }
+	multiplicityk0-1 += k1-k0;
+ }
+ return zj, multiplicityj;
+}
+
+define ad_ktest_pval (t, m)
+{
+ variable alphas = 0.25, 0.1, 0.05, 0.025, 0.01;
+ % S&S suggests the parametrization
+ % t_m(alpha) = b0(alpha) + b1(alpha)/sqrt(m) + b2(alpha)/m
+ variable b0_alpha = 0.675, 1.281, 1.645, 1.960, 2.326;
+ variable b1_alpha = -0.245, 0.250, 0.678, 1.149, 1.822;
+ variable b2_alpha = -0.105, -0.305, -0.362, -0.391, -0.396;
+
+ % The algorithm:
+ % 1. Use bk_alpha to compute tm_alpha for given m.
+ % 2. Use linear interpolation of log(alpha/(1-alpha) vs tm_alpha.
+ % 3. ==> exp(v) = alpha/(1-alpha)
+ % ==> alpha = exp(v)/(1+exp(v)), where v is interpolated value.
+
+ variable i, n = length (alphas);
+ variable logodd = log (alphas/(1-alphas));
+ variable tm_alpha = b0_alpha + b1_alpha/sqrt(m) + b2_alpha/m;
+ i = wherelast (t >= tm_alpha);
+ if (i == NULL)
+ i = 0;
+ else if (i == n - 1)
+ i = n - 2;
+
+ % v = p0*(1-s) + s*p1 ==> v = p0 + s*(p1-p0)
+ % v0 = p0 + (t-t0)/(t1-t0)*(p1-p0)
+ variable v0 = logoddi, v1 = logoddi+1, t0 = tm_alphai, t1 = tm_alphai+1;
+ variable v = v0 + (v1-v0)*((t-t0)/(t1-t0));
+
+ variable alpha = exp(v)/(1+exp(v));
+ if (alpha < 0) alpha = 0.0;
+ else if (alpha > 1.0) alpha = 1.0;
+ return alpha;
+}
+
+define ad_ktest ()
+{
+ variable tref = NULL;
+ variable arg, nargs = _NARGS;
+ if (nargs > 1)
+ {
+	arg = ();
+	if (_typeof (arg) == Ref_Type)
+	 {
+	 tref = arg;
+	 nargs--;
+	 }
+	else arg;		 % leave it on stack
+ }
+
+ if (nargs == 0)
+ usage ("\
+pval = ad_ktest ({X1,X2,...Xn} ,&statistic; qualifiers);\n\
+Qualifiers:\n\
+ pval2=&pval2 P-value corresponding to continuous case (no ties)\n\
+ stat2=&stat2 Statistic for the continuous case\n\
+"
+	 );
+
+ variable datasets;
+ if (nargs == 1)
+ datasets = ();
+ else
+ datasets = __pop_list (nargs);
+
+ if ((_typeof (datasets) != Array_Type)
+ && (typeof (datasets) != List_Type))
+ throw InvalidParmError, "Expecting a list of arrays or an array of arrays";
+
+ variable i, j, k;
+ variable z_i, zstar, n;
+
+ k = length (datasets);
+ if (k < 2)
+ throw InvalidParmError, "ad_ktest requires at least 2 datasets";
+
+ zstar = datasets0;
+
+ _for i (1, k-1, 1)
+ zstar = zstar, datasetsi;
+
+ n = length (zstar);
+
+ variable multiplicity;
+ (zstar, multiplicity) = get_unique_and_tied (zstar);
+
+ variable cap_l = length(zstar);
+
+ variable s = 0.0, s_a = 0.0;
+ variable mj = Double_Typek;
+ variable cap_Bj = 0.0, cap_Bj_a = 0.0;
+
+ variable kmult = Int_Typecap_l, k;
+ variable zstar_j;
+ cap_l--;
+#ifexists wherefirst_ge
+ _for i (0, k-1, 1)
+ {
+	z_i = datasetsi;
+	z_i = z_iarray_sort (z_i);
+	% exploit the fact that both z_i and zstar are sorted.
+	variable i0 = 0;
+	_for j (0, cap_l, 1)
+	 {
+	 variable i1;
+	 i1 = wherefirst_ge (z_i, zstarj, i0);
+	 if (i1 == NULL)
+	 continue;
+	 % This point is reached about a quarter of the time.
+	 i0 = i1;
+	 i1 = wherefirst_ne (z_i, zstarj, i0);
+	 if (i1 == NULL)
+	 {
+		 % end of array
+		 if (zstarj == z_ii0)
+		 kmultj,i = length(z_i)-i0;
+		 break;
+	 }
+
+	 kmultj,i = i1-i0;
+	 i0 = i1;
+	 }
+ }
+#endif
+ _for j (0, cap_l, 1)
+ {
+	zstar_j = zstarj;
+	variable l_j = multiplicityj;
+	cap_Bj += l_j;
+	cap_Bj_a += 0.5*l_j;
+	variable ds = 0.0, ds_a = 0.0;
+	_for i (0, k-1, 1)
+	 {
+	 z_i = datasetsi;
+	 variable n_i = length (z_i);
+#ifexists wherefirst_ne
+	 variable dmij = 0.5*kmultj,i;
+#else
+	 variable dmij = 0.5*length (where (z_i == zstar_j));
+#endif
+	 variable mij = mji + dmij;
+	 variable top = (n*mij - n_i*cap_Bj_a);
+	 ds_a += top*top/n_i;
+
+	 mij += dmij;
+	 top = (n*mij - n_i*cap_Bj);
+	 ds += top*top/n_i;
+	 mji = mij;
+	 }
+	s_a += l_j*ds_a/(cap_Bj_a*(n-cap_Bj_a) - 0.25*l_j*n)/n;
+	if (j != cap_l)
+	 s += l_j*ds/(cap_Bj * (n-cap_Bj))/n;
+	cap_Bj_a = cap_Bj;
+ }
+ s_a *= (n-1.0)/n;
+
+ variable h = sum (1.0/1:n-1);
+ variable g = sum (cumsum (1.0/(n-1:2:-1))/2:n-1);
+ variable cap_h = 0.0;
+
+ _for i (0, k-1, 1)
+ cap_h += 1.0/length(datasetsi);
+
+ variable
+ k2 = k*k, hk = h*k, g4m6 = 4*g-6,
+ a = g4m6*(k-1)+(10-6*g)*cap_h,
+ b = (2*g-4)*k2 + 8*hk + (2*g-14*h-4)*cap_h - 8*h + g4m6,
+ c = (6*h+2*g-2)*k2 + (4*h-g4m6)*k + (2*h-6)*cap_h + 4*h,
+ d = (2*h+6)*k2 - 4*hk;
+
+ variable sig = d + n*(c + n*(b + n*a));
+ sig = sqrt(sig/(n-1)/(n-2)/(n-3));
+ variable t = (s - (k-1))/sig;
+ variable t_a = (s_a - (k-1))/sig;
+ %vmessage ("s = %g, s_a = %g", s, s_a);
+
+ variable pval = ad_ktest_pval (t_a, k-1);
+ if (tref != NULL) @tref = t_a;
+
+ variable pval2_ref = qualifier ("pval2");
+ variable stat2_ref = qualifier ("stat2");
+
+ if (typeof (pval2_ref) == Ref_Type) @pval2_ref = ad_ktest_pval (t, k-1);
+ if (typeof (stat2_ref) == Ref_Type) @stat2_ref = t;
+
+ return pval;
+}
+
+% This function was derived from
+% Marsaglia and Marsaglia, Evaluating the Anderson-Darling
+% Distribution, Journal of Statistical Software, Vol. 9, Issue 2, Feb
+% 2004.
+define anderson_darling_cdf ()
+{
+ if (_NARGS != 2)
+ {
+	usage ("\
+cdf = anderson_darling_cdf (A2, nsamp)\n\
+%% Computes the Anderson-Darling CDF at the points A2 for sample-sizes nsamp.\n\
+"
+	 );
+ }
+ variable z, ndata; (z, ndata) = ();
+ variable nz = length (z);
+
+ if (typeof (ndata) != Array_Type)
+ ndata = ndata + Int_Typenz;
+
+ if (length (ndata) != nz)
+ throw InvalidParmError, "the length of A2 and nsamp do not match";
+
+ variable x = Double_Typenz;
+
+ variable i, j, a, zz;
+
+ i = where (0.0 < z < 2.0, &j);
+ if (length (i))
+ {
+	zz = zi;
+	a = 2.00012, 0.247105, -0.0649821, 0.0347962, -0.0116720, 0.00168691;
+	xi = exp(-1.2337141/zz)*polynom(a, zz)/sqrt(zz);
+ }
+ if (length (j))
+ {
+	zz = zj;
+	a = 1.0776, -2.30695, 0.43424, -0.082433, 0.008056, -0.0003146;
+	xj = exp(-exp(polynom (a, zz)));
+ }
+
+ % Now compute the correction for finite n (sec 3 of Marsaglia's paper)
+ variable ndatainv = 1.0/ndata;
+ variable c = 0.01265 + 0.1757*ndatainv;
+ variable dx = Double_Typenz;
+
+ i = where (x < c);
+ if (length (i))
+ {
+	zz = xi/ci;
+	dxi = ((0.0037*ndatainv + 0.00078)*ndatainv + 0.00006)*ndatainv
+	 * sqrt(zz)*(1.0-zz)*(49.0*zz-102.0);
+ }
+
+ i = where (c <= x < 0.8);
+ if (length (i))
+ {
+	variable ci = ci;
+	zz = xi;
+	a = -.00022633, 6.54034, -14.6538, 14.458, -8.259, 1.91864;
+	dxi = ndatainv*(0.04213 + ndatainv*0.01365)
+	 * polynom (a, (zz-ci)/(0.8-ci));
+ }
+
+ i = where (x >= 0.8);
+ if (length (i))
+ {
+	a = -130.2137, 745.2337, -1705.091, 1950.646, -1116.360, 255.7844;
+	dxi = polynom (a, xi)*ndatainv;
+ }
+
+ x = __tmp(x) + dx;
+ ifnot (Array_Type == typeof(z))
+ x = x0;
+
+ return x;
+}
+
+define ad_test ()
+{
+ variable s_ref = NULL;
+ if (_NARGS == 2)
+ s_ref = ();
+ else if (_NARGS != 1)
+ usage ("\
+p = ad_test (X ,&Asquared);\n\ %% 1-sample Anderson-Darling test\n\
+Qualifiers:\n\
+ ;cdf %% The X values are the CDFs of the underlying distribution\n\
+ %% and 0 <= X <= 1\n\
+"
+	 );
+
+ variable cdf = ();
+ variable is_cdf = qualifier_exists ("cdf");
+
+ variable n = length (cdf);
+ variable factor = 1.0;
+
+ ifnot (is_cdf)
+ {
+	variable mu = qualifier ("mean");
+	variable sd = qualifier ("stddev");
+
+	if (sd == NULL)
+	 {
+	 if (mu == NULL)
+	 {
+		 factor = (1.0 + (0.75 + 2.25/n)/n);
+		 sd = stddev (cdf);
+	 }
+	 else sd = sample_stddev (cdf);
+	 }
+	if (mu == NULL) mu = mean (cdf);
+	%vmessage ("mean=%g, stddev=%g, factor=%g", mu, sd, factor);
+	cdf = normal_cdf (cdf, mu, sd);
+ }
+
+ cdf = __tmp(cdf)array_sort(cdf);
+
+ variable ii = 1:2*n:2;
+ variable a2 = -n - (sum(ii*log(cdf) + (2*n-ii)*log(1.0-cdf)))/n;
+
+ a2 = factor * a2;
+
+ if (s_ref != NULL)
+ @s_ref = a2;
+
+ if (is_cdf)
+ {
+	return 1.0 - anderson_darling_cdf (a2, n);
+ }
+
+ % Augostino & Stephens, 1986
+ if (a2 >= 0.6)
+ return exp(1.2937 + (-5.709 + 0.0186*a2)*a2);
+ if (a2 >= 0.34)
+ return exp(0.9177 + (-4.279 - 1.38*a2)*a2);
+ if (a2 >= 0.2)
+ return 1.0 - exp(-8.318 + (42.796 - 59.938*a2)*a2);
+ return 1.0 - exp(-13.436 + (101.14 - 223.73*a2)*a2);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/statslib/ks_test.sl Added

@@ -0,0 +1,91 @@
+% Kolmogorov–Smirnov test
+
+% Asymptotically correct. Stephens 1974
+private define ks_test_prob (n, d)
+{
+ variable sn = sqrt(n);
+ variable factor = sn + 0.12 + 0.11/sn;
+ return 1-smirnov_cdf (sn * d);
+}
+
+define ks_test ()
+{
+ variable d_ref = NULL;
+ if (_NARGS == 2)
+ d_ref = ();
+ else if (_NARGS != 1)
+ usage ("p = ks_test (CDF ,&D); %% 1-sample KS test\n",
+	 + " Here CDF are the expected CDFs at the corresponding random points.");
+ variable cdf = ();
+
+ cdf = __tmp(cdf)array_sort(cdf);
+ variable n = length (cdf);
+ variable nn = 1.0*n;
+ variable dplus = max (1:n/nn - cdf);
+ variable dminus = max (cdf-0:n-1/nn);
+ variable d = max (dplus, dminus);
+ if (d_ref != NULL)
+ @d_ref = d;
+
+ return ks_test_prob (n, d);
+}
+
+% We want ks_test2_prob to return P(D_mn >= d), where d is the observed value.
+% It is known that d can only take on values c/mn where c, m, and n are integers.
+% So set d=c/mn.
+% kim_jennrich_cdf returns P(D_mn <= c/mn)
+% But we want P(D_mn >= c/mn) = 1-P(D_mn < c/mn)
+% P(D_mn <= (c-1)/mn) <= P(D_mn < c/mn) <= P(D_mn <= c/mn)
+% P(D_mn <= (c-1)/mn) <= P(D_mn < c/mn) <= P(D_mn < c/mn) + P(D_mn==c/mn)
+% P(D_mn <= (c-1)/mn) <= P(D_mn < c/mn) + P(D_mn==c/mn)
+%
+% Since D_mn can only take on values c/mn, it follows that
+% P(D_mn < c/mn) = P(D_mn <= (c-1)/mn)
+%
+private define ks_test2_prob ()
+{
+ if (_NARGS != 3)
+ usage ("p = %s(m, n, d); %% P(D_mn >= d)", _function_name ());
+ variable d, m, n; (m, n, d) = ();
+
+ % See the above note for why 1 is subtracted for the first argument of
+ % kim_jennrich.
+ variable fm = double (m);
+ if (fm * n <= 10000.0)
+ return 1.0 - kim_jennrich_cdf (m, n, int (d*m*n + 0.5) - 1);
+
+ % Use asymptotic forms.
+ return ks_test_prob ((fm*n)/(fm+n), d);
+}
+
+define ks_test2 ()
+{
+ variable d_ref = NULL;
+ if (_NARGS == 3)
+ d_ref = ();
+ else if (_NARGS != 2)
+ usage ("p = %s(X1, X2 ,&D); %% Two-sample KS test", _function_name ());
+
+ variable xm, xn; (xm, xn) = ();
+ variable x = xn, xm;
+ variable n = length (xn);
+ variable m = length (xm);
+ variable mn = m + n;
+ variable c = Int_Typemn;
+ c0:n-1 = 1;
+
+ variable i = array_sort (x);
+ x = xi;
+ c = ci; c = cumsum (__tmp(c));
+ variable dmn = (c/n - 1:mn/(mn*1.0));
+ variable factor = mn/(m*1.0);
+ variable dplus = factor * max(dmn);
+ variable dminus = factor * min(dmn);
+ variable d = max(dplus, -dminus);
+
+ if (d_ref != NULL)
+ @d_ref = d;
+
+ return ks_test2_prob (m, n, d);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/statslib/kuiper.sl Added

@@ -0,0 +1,74 @@
+% Kuiper Tests
+%
+% This is asymptotically correct
+private define kuiper_test_prob (n, d)
+{
+ variable sn = sqrt(n);
+ variable factor = sn + 0.155 + 0.24/sn;
+ d = factor * d;
+ if (d < 0.4)
+ return 1.0;
+ if (d > 20.0)
+ return 0.0;
+
+ variable x = (1:100*d)^2;
+ variable p = 2.0*sum ((4.0*x - 1.0) * exp (-2.0*x));
+ if (p < 0.0)
+ p = 0.0;
+ if (p > 1.0)
+ p = 1.0;
+ return p;
+}
+
+define kuiper_test ()
+{
+ variable d_ref = NULL;
+ if (_NARGS == 2)
+ d_ref = ();
+ else if (_NARGS != 1)
+ usage ("p = kuiper_test (CDF ,&D); %% 1-sample Kuiper test\n",
+	 + " Here CDF are the expected CDFs at the corresponding random points.");
+ variable cdf = ();
+
+ cdf = __tmp(cdf)array_sort(cdf);
+ variable n = length (cdf);
+ variable nn = 1.0*n;
+ variable dplus = max (1:n/nn - cdf);
+ variable dminus = max (cdf-0:n-1/nn);
+ variable d = dplus + dminus;
+ if (d_ref != NULL)
+ @d_ref = d;
+
+ return kuiper_test_prob (n, d);
+}
+
+define kuiper_test2 ()
+{
+ variable d_ref = NULL;
+ if (_NARGS == 3)
+ d_ref = ();
+ else if (_NARGS != 2)
+ usage ("p = %s(X1, X2 ,&D); %% Two-sample Kuiper test", _function_name ());
+
+ variable xm, xn; (xm, xn) = ();
+ variable x = xn, xm;
+ variable n = length (xn);
+ variable m = length (xm);
+ variable mn = m + n;
+ variable c = Int_Typemn;
+ c0:n-1 = 1;
+
+ variable i = array_sort (x);
+ x = xi;
+ c = ci; c = cumsum (__tmp(c));
+ variable dmn = (c/n - 1:mn/(mn*1.0));
+ variable factor = mn/(m*1.0);
+ variable dplus = factor * max(dmn);
+ variable dminus = factor * min(dmn);
+ variable d = dplus - dminus;
+
+ if (d_ref != NULL)
+ @d_ref = d;
+
+ return kuiper_test_prob (double(m)*double(n)/double(mn), d);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/sysconf-module.c Added

@@ -0,0 +1,1207 @@
+/* -*- mode: C; mode: fold; -*- */
+/*
+Copyright (C) 2009-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "config.h"
+
+#ifndef __EXTENSIONS__
+# define __EXTENSIONS__ 1
+#endif
+
+#include <stdio.h>
+#include <unistd.h>
+#include <string.h>
+#include <errno.h>
+#include <slang.h>
+
+SLANG_MODULE(sysconf);
+
+typedef struct
+{
+ const char *name;
+ const unsigned int namelen;
+ const int iname;
+}
+Name_Map_Type;
+
+static const Name_Map_Type *lookup_name (const Name_Map_Type *map, char *name)
+{
+ SLstrlen_Type len = strlen (name);
+ while (map->namelen != 0)
+ {
+	if ((map->namelen == len)
+	 && (0 == strcmp (name, map->name)))
+	 return map;
+
+	map++;
+ }
+ return NULL;
+}
+
+static const Name_Map_Type SC_Name_Map_Table = /*{{{*/
+{
+#ifdef _SC_ARG_MAX
+ {"_SC_ARG_MAX",	11,	_SC_ARG_MAX},
+#endif
+#ifdef _SC_CHILD_MAX
+ {"_SC_CHILD_MAX",	13,	_SC_CHILD_MAX},
+#endif
+#ifdef _SC_CLK_TCK
+ {"_SC_CLK_TCK",	11,	_SC_CLK_TCK},
+#endif
+#ifdef _SC_NGROUPS_MAX
+ {"_SC_NGROUPS_MAX",	15,	_SC_NGROUPS_MAX},
+#endif
+#ifdef _SC_OPEN_MAX
+ {"_SC_OPEN_MAX",	12,	_SC_OPEN_MAX},
+#endif
+#ifdef _SC_STREAM_MAX
+ {"_SC_STREAM_MAX",	14,	_SC_STREAM_MAX},
+#endif
+#ifdef _SC_TZNAME_MAX
+ {"_SC_TZNAME_MAX",	14,	_SC_TZNAME_MAX},
+#endif
+#ifdef _SC_JOB_CONTROL
+ {"_SC_JOB_CONTROL",	15,	_SC_JOB_CONTROL},
+#endif
+#ifdef _SC_SAVED_IDS
+ {"_SC_SAVED_IDS",	13,	_SC_SAVED_IDS},
+#endif
+#ifdef _SC_REALTIME_SIGNALS
+ {"_SC_REALTIME_SIGNALS",	20,	_SC_REALTIME_SIGNALS},
+#endif
+#ifdef _SC_PRIORITY_SCHEDULING
+ {"_SC_PRIORITY_SCHEDULING",	23,	_SC_PRIORITY_SCHEDULING},
+#endif
+#ifdef _SC_TIMERS
+ {"_SC_TIMERS",	10,	_SC_TIMERS},
+#endif
+#ifdef _SC_ASYNCHRONOUS_IO
+ {"_SC_ASYNCHRONOUS_IO",	19,	_SC_ASYNCHRONOUS_IO},
+#endif
+#ifdef _SC_PRIORITIZED_IO
+ {"_SC_PRIORITIZED_IO",	18,	_SC_PRIORITIZED_IO},
+#endif
+#ifdef _SC_SYNCHRONIZED_IO
+ {"_SC_SYNCHRONIZED_IO",	19,	_SC_SYNCHRONIZED_IO},
+#endif
+#ifdef _SC_FSYNC
+ {"_SC_FSYNC",	9,	_SC_FSYNC},
+#endif
+#ifdef _SC_MAPPED_FILES
+ {"_SC_MAPPED_FILES",	16,	_SC_MAPPED_FILES},
+#endif
+#ifdef _SC_MEMLOCK
+ {"_SC_MEMLOCK",	11,	_SC_MEMLOCK},
+#endif
+#ifdef _SC_MEMLOCK_RANGE
+ {"_SC_MEMLOCK_RANGE",	17,	_SC_MEMLOCK_RANGE},
+#endif
+#ifdef _SC_MEMORY_PROTECTION
+ {"_SC_MEMORY_PROTECTION",	21,	_SC_MEMORY_PROTECTION},
+#endif
+#ifdef _SC_MESSAGE_PASSING
+ {"_SC_MESSAGE_PASSING",	19,	_SC_MESSAGE_PASSING},
+#endif
+#ifdef _SC_SEMAPHORES
+ {"_SC_SEMAPHORES",	14,	_SC_SEMAPHORES},
+#endif
+#ifdef _SC_SHARED_MEMORY_OBJECTS
+ {"_SC_SHARED_MEMORY_OBJECTS",	25,	_SC_SHARED_MEMORY_OBJECTS},
+#endif
+#ifdef _SC_AIO_LISTIO_MAX
+ {"_SC_AIO_LISTIO_MAX",	18,	_SC_AIO_LISTIO_MAX},
+#endif
+#ifdef _SC_AIO_MAX
+ {"_SC_AIO_MAX",	11,	_SC_AIO_MAX},
+#endif
+#ifdef _SC_AIO_PRIO_DELTA_MAX
+ {"_SC_AIO_PRIO_DELTA_MAX",	22,	_SC_AIO_PRIO_DELTA_MAX},
+#endif
+#ifdef _SC_DELAYTIMER_MAX
+ {"_SC_DELAYTIMER_MAX",	18,	_SC_DELAYTIMER_MAX},
+#endif
+#ifdef _SC_MQ_OPEN_MAX
+ {"_SC_MQ_OPEN_MAX",	15,	_SC_MQ_OPEN_MAX},
+#endif
+#ifdef _SC_MQ_PRIO_MAX
+ {"_SC_MQ_PRIO_MAX",	15,	_SC_MQ_PRIO_MAX},
+#endif
+#ifdef _SC_VERSION
+ {"_SC_VERSION",	11,	_SC_VERSION},
+#endif
+#ifdef _SC_PAGESIZE
+ {"_SC_PAGESIZE",	12,	_SC_PAGESIZE},
+#endif
+#ifdef _SC_PAGE_SIZE
+ {"_SC_PAGE_SIZE",	13,	_SC_PAGE_SIZE},
+#endif
+#ifdef _SC_RTSIG_MAX
+ {"_SC_RTSIG_MAX",	13,	_SC_RTSIG_MAX},
+#endif
+#ifdef _SC_SEM_NSEMS_MAX
+ {"_SC_SEM_NSEMS_MAX",	17,	_SC_SEM_NSEMS_MAX},
+#endif
+#ifdef _SC_SEM_VALUE_MAX
+ {"_SC_SEM_VALUE_MAX",	17,	_SC_SEM_VALUE_MAX},
+#endif
+#ifdef _SC_SIGQUEUE_MAX
+ {"_SC_SIGQUEUE_MAX",	16,	_SC_SIGQUEUE_MAX},
+#endif
+#ifdef _SC_TIMER_MAX
+ {"_SC_TIMER_MAX",	13,	_SC_TIMER_MAX},
+#endif
+#ifdef _SC_BC_BASE_MAX
+ {"_SC_BC_BASE_MAX",	15,	_SC_BC_BASE_MAX},
+#endif
+#ifdef _SC_BC_DIM_MAX
+ {"_SC_BC_DIM_MAX",	14,	_SC_BC_DIM_MAX},
+#endif
+#ifdef _SC_BC_SCALE_MAX
+ {"_SC_BC_SCALE_MAX",	16,	_SC_BC_SCALE_MAX},
+#endif
+#ifdef _SC_BC_STRING_MAX
+ {"_SC_BC_STRING_MAX",	17,	_SC_BC_STRING_MAX},
+#endif
+#ifdef _SC_COLL_WEIGHTS_MAX
+ {"_SC_COLL_WEIGHTS_MAX",	20,	_SC_COLL_WEIGHTS_MAX},
+#endif
+#ifdef _SC_EQUIV_CLASS_MAX
+ {"_SC_EQUIV_CLASS_MAX",	19,	_SC_EQUIV_CLASS_MAX},
+#endif
+#ifdef _SC_EXPR_NEST_MAX
+ {"_SC_EXPR_NEST_MAX",	17,	_SC_EXPR_NEST_MAX},
+#endif
+#ifdef _SC_LINE_MAX
+ {"_SC_LINE_MAX",	12,	_SC_LINE_MAX},
+#endif
+#ifdef _SC_RE_DUP_MAX
+ {"_SC_RE_DUP_MAX",	14,	_SC_RE_DUP_MAX},
+#endif
+#ifdef _SC_CHARCLASS_NAME_MAX
+ {"_SC_CHARCLASS_NAME_MAX",	22,	_SC_CHARCLASS_NAME_MAX},
+#endif
+#ifdef _SC_2_VERSION
+ {"_SC_2_VERSION",	13,	_SC_2_VERSION},
+#endif
+#ifdef _SC_2_C_BIND
+ {"_SC_2_C_BIND",	12,	_SC_2_C_BIND},
+#endif
+#ifdef _SC_2_C_DEV
+ {"_SC_2_C_DEV",	11,	_SC_2_C_DEV},
+#endif
+#ifdef _SC_2_FORT_DEV
+ {"_SC_2_FORT_DEV",	14,	_SC_2_FORT_DEV},
+#endif
+#ifdef _SC_2_FORT_RUN
+ {"_SC_2_FORT_RUN",	14,	_SC_2_FORT_RUN},
+#endif
+#ifdef _SC_2_SW_DEV
+ {"_SC_2_SW_DEV",	12,	_SC_2_SW_DEV},
+#endif
+#ifdef _SC_2_LOCALEDEF
+ {"_SC_2_LOCALEDEF",	15,	_SC_2_LOCALEDEF},
+#endif
+#ifdef _SC_PII
+ {"_SC_PII",	7,	_SC_PII},
+#endif
+#ifdef _SC_PII_XTI
+ {"_SC_PII_XTI",	11,	_SC_PII_XTI},
+#endif
+#ifdef _SC_PII_SOCKET
+ {"_SC_PII_SOCKET",	14,	_SC_PII_SOCKET},
+#endif
+#ifdef _SC_PII_INTERNET
+ {"_SC_PII_INTERNET",	16,	_SC_PII_INTERNET},
+#endif
+#ifdef _SC_PII_OSI
+ {"_SC_PII_OSI",	11,	_SC_PII_OSI},
+#endif
+#ifdef _SC_POLL
+ {"_SC_POLL",	8,	_SC_POLL},
+#endif
+#ifdef _SC_SELECT
+ {"_SC_SELECT",	10,	_SC_SELECT},
+#endif
+#ifdef _SC_UIO_MAXIOV
+ {"_SC_UIO_MAXIOV",	14,	_SC_UIO_MAXIOV},
+#endif
+#ifdef _SC_IOV_MAX
+ {"_SC_IOV_MAX",	11,	_SC_IOV_MAX},
+#endif
+#ifdef _SC_PII_INTERNET_STREAM
+ {"_SC_PII_INTERNET_STREAM",	23,	_SC_PII_INTERNET_STREAM},
+#endif
+#ifdef _SC_PII_INTERNET_DGRAM
+ {"_SC_PII_INTERNET_DGRAM",	22,	_SC_PII_INTERNET_DGRAM},
+#endif
+#ifdef _SC_PII_OSI_COTS
+ {"_SC_PII_OSI_COTS",	16,	_SC_PII_OSI_COTS},
+#endif
+#ifdef _SC_PII_OSI_CLTS
+ {"_SC_PII_OSI_CLTS",	16,	_SC_PII_OSI_CLTS},
+#endif
+#ifdef _SC_PII_OSI_M
+ {"_SC_PII_OSI_M",	13,	_SC_PII_OSI_M},
+#endif
+#ifdef _SC_T_IOV_MAX
+ {"_SC_T_IOV_MAX",	13,	_SC_T_IOV_MAX},
+#endif
+#ifdef _SC_THREADS
+ {"_SC_THREADS",	11,	_SC_THREADS},
+#endif
+#ifdef _SC_THREAD_SAFE_FUNCTIONS
+ {"_SC_THREAD_SAFE_FUNCTIONS",	25,	_SC_THREAD_SAFE_FUNCTIONS},
+#endif
+#ifdef _SC_GETGR_R_SIZE_MAX
+ {"_SC_GETGR_R_SIZE_MAX",	20,	_SC_GETGR_R_SIZE_MAX},
+#endif
+#ifdef _SC_GETPW_R_SIZE_MAX
+ {"_SC_GETPW_R_SIZE_MAX",	20,	_SC_GETPW_R_SIZE_MAX},
+#endif
+#ifdef _SC_LOGIN_NAME_MAX
+ {"_SC_LOGIN_NAME_MAX",	18,	_SC_LOGIN_NAME_MAX},
+#endif
+#ifdef _SC_TTY_NAME_MAX
+ {"_SC_TTY_NAME_MAX",	16,	_SC_TTY_NAME_MAX},
+#endif
+#ifdef _SC_THREAD_DESTRUCTOR_ITERATIONS
+ {"_SC_THREAD_DESTRUCTOR_ITERATIONS",	32,	_SC_THREAD_DESTRUCTOR_ITERATIONS},
+#endif
+#ifdef _SC_THREAD_KEYS_MAX
+ {"_SC_THREAD_KEYS_MAX",	19,	_SC_THREAD_KEYS_MAX},
+#endif
+#ifdef _SC_THREAD_STACK_MIN
+ {"_SC_THREAD_STACK_MIN",	20,	_SC_THREAD_STACK_MIN},
+#endif
+#ifdef _SC_THREAD_THREADS_MAX
+ {"_SC_THREAD_THREADS_MAX",	22,	_SC_THREAD_THREADS_MAX},
+#endif
+#ifdef _SC_THREAD_ATTR_STACKADDR
+ {"_SC_THREAD_ATTR_STACKADDR",	25,	_SC_THREAD_ATTR_STACKADDR},
+#endif
+#ifdef _SC_THREAD_ATTR_STACKSIZE
+ {"_SC_THREAD_ATTR_STACKSIZE",	25,	_SC_THREAD_ATTR_STACKSIZE},
+#endif
+#ifdef _SC_THREAD_PRIORITY_SCHEDULING
+ {"_SC_THREAD_PRIORITY_SCHEDULING",	30,	_SC_THREAD_PRIORITY_SCHEDULING},
+#endif
+#ifdef _SC_THREAD_PRIO_INHERIT
+ {"_SC_THREAD_PRIO_INHERIT",	23,	_SC_THREAD_PRIO_INHERIT},
+#endif
+#ifdef _SC_THREAD_PRIO_PROTECT
+ {"_SC_THREAD_PRIO_PROTECT",	23,	_SC_THREAD_PRIO_PROTECT},
+#endif
+#ifdef _SC_THREAD_PROCESS_SHARED
+ {"_SC_THREAD_PROCESS_SHARED",	25,	_SC_THREAD_PROCESS_SHARED},
+#endif
+#ifdef _SC_NPROCESSORS_CONF
+ {"_SC_NPROCESSORS_CONF",	20,	_SC_NPROCESSORS_CONF},
+#endif
+#ifdef _SC_NPROCESSORS_ONLN
+ {"_SC_NPROCESSORS_ONLN",	20,	_SC_NPROCESSORS_ONLN},
+#endif
+#ifdef _SC_PHYS_PAGES
+ {"_SC_PHYS_PAGES",	14,	_SC_PHYS_PAGES},
+#endif
+#ifdef _SC_AVPHYS_PAGES
+ {"_SC_AVPHYS_PAGES",	16,	_SC_AVPHYS_PAGES},
+#endif
+#ifdef _SC_ATEXIT_MAX
+ {"_SC_ATEXIT_MAX",	14,	_SC_ATEXIT_MAX},
+#endif
+#ifdef _SC_PASS_MAX
+ {"_SC_PASS_MAX",	12,	_SC_PASS_MAX},
+#endif
+#ifdef _SC_XOPEN_VERSION
+ {"_SC_XOPEN_VERSION",	17,	_SC_XOPEN_VERSION},
+#endif
+#ifdef _SC_XOPEN_XCU_VERSION
+ {"_SC_XOPEN_XCU_VERSION",	21,	_SC_XOPEN_XCU_VERSION},
+#endif
+#ifdef _SC_XOPEN_UNIX
+ {"_SC_XOPEN_UNIX",	14,	_SC_XOPEN_UNIX},
+#endif
+#ifdef _SC_XOPEN_CRYPT
+ {"_SC_XOPEN_CRYPT",	15,	_SC_XOPEN_CRYPT},
+#endif
+#ifdef _SC_XOPEN_ENH_I18N
+ {"_SC_XOPEN_ENH_I18N",	18,	_SC_XOPEN_ENH_I18N},
+#endif
+#ifdef _SC_XOPEN_SHM
+ {"_SC_XOPEN_SHM",	13,	_SC_XOPEN_SHM},
+#endif
+#ifdef _SC_2_CHAR_TERM
+ {"_SC_2_CHAR_TERM",	15,	_SC_2_CHAR_TERM},
+#endif
+#ifdef _SC_2_C_VERSION
+ {"_SC_2_C_VERSION",	15,	_SC_2_C_VERSION},
+#endif
+#ifdef _SC_2_UPE
+ {"_SC_2_UPE",	9,	_SC_2_UPE},
+#endif
+#ifdef _SC_XOPEN_XPG2
+ {"_SC_XOPEN_XPG2",	14,	_SC_XOPEN_XPG2},
+#endif
+#ifdef _SC_XOPEN_XPG3
+ {"_SC_XOPEN_XPG3",	14,	_SC_XOPEN_XPG3},
+#endif
+#ifdef _SC_XOPEN_XPG4
+ {"_SC_XOPEN_XPG4",	14,	_SC_XOPEN_XPG4},
+#endif
+#ifdef _SC_CHAR_BIT
+ {"_SC_CHAR_BIT",	12,	_SC_CHAR_BIT},
+#endif
+#ifdef _SC_CHAR_MAX
+ {"_SC_CHAR_MAX",	12,	_SC_CHAR_MAX},
+#endif
+#ifdef _SC_CHAR_MIN
+ {"_SC_CHAR_MIN",	12,	_SC_CHAR_MIN},
+#endif
+#ifdef _SC_INT_MAX
+ {"_SC_INT_MAX",	11,	_SC_INT_MAX},
+#endif
+#ifdef _SC_INT_MIN
+ {"_SC_INT_MIN",	11,	_SC_INT_MIN},
+#endif
+#ifdef _SC_LONG_BIT
+ {"_SC_LONG_BIT",	12,	_SC_LONG_BIT},
+#endif
+#ifdef _SC_WORD_BIT
+ {"_SC_WORD_BIT",	12,	_SC_WORD_BIT},
+#endif
+#ifdef _SC_MB_LEN_MAX
+ {"_SC_MB_LEN_MAX",	14,	_SC_MB_LEN_MAX},
+#endif
+#ifdef _SC_NZERO
+ {"_SC_NZERO",	9,	_SC_NZERO},
+#endif
+#ifdef _SC_SSIZE_MAX
+ {"_SC_SSIZE_MAX",	13,	_SC_SSIZE_MAX},
+#endif
+#ifdef _SC_SCHAR_MAX
+ {"_SC_SCHAR_MAX",	13,	_SC_SCHAR_MAX},
+#endif
+#ifdef _SC_SCHAR_MIN
+ {"_SC_SCHAR_MIN",	13,	_SC_SCHAR_MIN},
+#endif
+#ifdef _SC_SHRT_MAX
+ {"_SC_SHRT_MAX",	12,	_SC_SHRT_MAX},
+#endif
+#ifdef _SC_SHRT_MIN
+ {"_SC_SHRT_MIN",	12,	_SC_SHRT_MIN},
+#endif
+#ifdef _SC_UCHAR_MAX
+ {"_SC_UCHAR_MAX",	13,	_SC_UCHAR_MAX},
+#endif
+#ifdef _SC_UINT_MAX
+ {"_SC_UINT_MAX",	12,	_SC_UINT_MAX},
+#endif
+#ifdef _SC_ULONG_MAX
+ {"_SC_ULONG_MAX",	13,	_SC_ULONG_MAX},
+#endif
+#ifdef _SC_USHRT_MAX
+ {"_SC_USHRT_MAX",	13,	_SC_USHRT_MAX},
+#endif
+#ifdef _SC_NL_ARGMAX
+ {"_SC_NL_ARGMAX",	13,	_SC_NL_ARGMAX},
+#endif
+#ifdef _SC_NL_LANGMAX
+ {"_SC_NL_LANGMAX",	14,	_SC_NL_LANGMAX},
+#endif
+#ifdef _SC_NL_MSGMAX
+ {"_SC_NL_MSGMAX",	13,	_SC_NL_MSGMAX},
+#endif
+#ifdef _SC_NL_NMAX
+ {"_SC_NL_NMAX",	11,	_SC_NL_NMAX},
+#endif
+#ifdef _SC_NL_SETMAX
+ {"_SC_NL_SETMAX",	13,	_SC_NL_SETMAX},
+#endif
+#ifdef _SC_NL_TEXTMAX
+ {"_SC_NL_TEXTMAX",	14,	_SC_NL_TEXTMAX},
+#endif
+#ifdef _SC_XBS5_ILP32_OFF32
+ {"_SC_XBS5_ILP32_OFF32",	20,	_SC_XBS5_ILP32_OFF32},
+#endif
+#ifdef _SC_XBS5_ILP32_OFFBIG
+ {"_SC_XBS5_ILP32_OFFBIG",	21,	_SC_XBS5_ILP32_OFFBIG},
+#endif
+#ifdef _SC_XBS5_LP64_OFF64
+ {"_SC_XBS5_LP64_OFF64",	19,	_SC_XBS5_LP64_OFF64},
+#endif
+#ifdef _SC_XBS5_LPBIG_OFFBIG
+ {"_SC_XBS5_LPBIG_OFFBIG",	21,	_SC_XBS5_LPBIG_OFFBIG},
+#endif
+#ifdef _SC_XOPEN_LEGACY
+ {"_SC_XOPEN_LEGACY",	16,	_SC_XOPEN_LEGACY},
+#endif
+#ifdef _SC_XOPEN_REALTIME
+ {"_SC_XOPEN_REALTIME",	18,	_SC_XOPEN_REALTIME},
+#endif
+#ifdef _SC_XOPEN_REALTIME_THREADS
+ {"_SC_XOPEN_REALTIME_THREADS",	26,	_SC_XOPEN_REALTIME_THREADS},
+#endif
+#ifdef _SC_ADVISORY_INFO
+ {"_SC_ADVISORY_INFO",	17,	_SC_ADVISORY_INFO},
+#endif
+#ifdef _SC_BARRIERS
+ {"_SC_BARRIERS",	12,	_SC_BARRIERS},
+#endif
+#ifdef _SC_BASE
+ {"_SC_BASE",	8,	_SC_BASE},
+#endif
+#ifdef _SC_C_LANG_SUPPORT
+ {"_SC_C_LANG_SUPPORT",	18,	_SC_C_LANG_SUPPORT},
+#endif
+#ifdef _SC_C_LANG_SUPPORT_R
+ {"_SC_C_LANG_SUPPORT_R",	20,	_SC_C_LANG_SUPPORT_R},
+#endif
+#ifdef _SC_CLOCK_SELECTION
+ {"_SC_CLOCK_SELECTION",	19,	_SC_CLOCK_SELECTION},
+#endif
+#ifdef _SC_CPUTIME
+ {"_SC_CPUTIME",	11,	_SC_CPUTIME},
+#endif
+#ifdef _SC_THREAD_CPUTIME
+ {"_SC_THREAD_CPUTIME",	18,	_SC_THREAD_CPUTIME},
+#endif
+#ifdef _SC_DEVICE_IO
+ {"_SC_DEVICE_IO",	13,	_SC_DEVICE_IO},
+#endif
+#ifdef _SC_DEVICE_SPECIFIC
+ {"_SC_DEVICE_SPECIFIC",	19,	_SC_DEVICE_SPECIFIC},
+#endif
+#ifdef _SC_DEVICE_SPECIFIC_R
+ {"_SC_DEVICE_SPECIFIC_R",	21,	_SC_DEVICE_SPECIFIC_R},
+#endif
+#ifdef _SC_FD_MGMT
+ {"_SC_FD_MGMT",	11,	_SC_FD_MGMT},
+#endif
+#ifdef _SC_FIFO
+ {"_SC_FIFO",	8,	_SC_FIFO},
+#endif
+#ifdef _SC_PIPE
+ {"_SC_PIPE",	8,	_SC_PIPE},
+#endif
+#ifdef _SC_FILE_ATTRIBUTES
+ {"_SC_FILE_ATTRIBUTES",	19,	_SC_FILE_ATTRIBUTES},
+#endif
+#ifdef _SC_FILE_LOCKING
+ {"_SC_FILE_LOCKING",	16,	_SC_FILE_LOCKING},
+#endif
+#ifdef _SC_FILE_SYSTEM
+ {"_SC_FILE_SYSTEM",	15,	_SC_FILE_SYSTEM},
+#endif
+#ifdef _SC_MONOTONIC_CLOCK
+ {"_SC_MONOTONIC_CLOCK",	19,	_SC_MONOTONIC_CLOCK},
+#endif
+#ifdef _SC_MULTI_PROCESS
+ {"_SC_MULTI_PROCESS",	17,	_SC_MULTI_PROCESS},
+#endif
+#ifdef _SC_SINGLE_PROCESS
+ {"_SC_SINGLE_PROCESS",	18,	_SC_SINGLE_PROCESS},
+#endif
+#ifdef _SC_NETWORKING
+ {"_SC_NETWORKING",	14,	_SC_NETWORKING},
+#endif
+#ifdef _SC_READER_WRITER_LOCKS
+ {"_SC_READER_WRITER_LOCKS",	23,	_SC_READER_WRITER_LOCKS},
+#endif
+#ifdef _SC_SPIN_LOCKS
+ {"_SC_SPIN_LOCKS",	14,	_SC_SPIN_LOCKS},
+#endif
+#ifdef _SC_REGEXP
+ {"_SC_REGEXP",	10,	_SC_REGEXP},
+#endif
+#ifdef _SC_REGEX_VERSION
+ {"_SC_REGEX_VERSION",	17,	_SC_REGEX_VERSION},
+#endif
+#ifdef _SC_SHELL
+ {"_SC_SHELL",	9,	_SC_SHELL},
+#endif
+#ifdef _SC_SIGNALS
+ {"_SC_SIGNALS",	11,	_SC_SIGNALS},
+#endif
+#ifdef _SC_SPAWN
+ {"_SC_SPAWN",	9,	_SC_SPAWN},
+#endif
+#ifdef _SC_SPORADIC_SERVER
+ {"_SC_SPORADIC_SERVER",	19,	_SC_SPORADIC_SERVER},
+#endif
+#ifdef _SC_THREAD_SPORADIC_SERVER
+ {"_SC_THREAD_SPORADIC_SERVER",	26,	_SC_THREAD_SPORADIC_SERVER},
+#endif
+#ifdef _SC_SYSTEM_DATABASE
+ {"_SC_SYSTEM_DATABASE",	19,	_SC_SYSTEM_DATABASE},
+#endif
+#ifdef _SC_SYSTEM_DATABASE_R
+ {"_SC_SYSTEM_DATABASE_R",	21,	_SC_SYSTEM_DATABASE_R},
+#endif
+#ifdef _SC_TIMEOUTS
+ {"_SC_TIMEOUTS",	12,	_SC_TIMEOUTS},
+#endif
+#ifdef _SC_TYPED_MEMORY_OBJECTS
+ {"_SC_TYPED_MEMORY_OBJECTS",	24,	_SC_TYPED_MEMORY_OBJECTS},
+#endif
+#ifdef _SC_USER_GROUPS
+ {"_SC_USER_GROUPS",	15,	_SC_USER_GROUPS},
+#endif
+#ifdef _SC_USER_GROUPS_R
+ {"_SC_USER_GROUPS_R",	17,	_SC_USER_GROUPS_R},
+#endif
+#ifdef _SC_2_PBS
+ {"_SC_2_PBS",	9,	_SC_2_PBS},
+#endif
+#ifdef _SC_2_PBS_ACCOUNTING
+ {"_SC_2_PBS_ACCOUNTING",	20,	_SC_2_PBS_ACCOUNTING},
+#endif
+#ifdef _SC_2_PBS_LOCATE
+ {"_SC_2_PBS_LOCATE",	16,	_SC_2_PBS_LOCATE},
+#endif
+#ifdef _SC_2_PBS_MESSAGE
+ {"_SC_2_PBS_MESSAGE",	17,	_SC_2_PBS_MESSAGE},
+#endif
+#ifdef _SC_2_PBS_TRACK
+ {"_SC_2_PBS_TRACK",	15,	_SC_2_PBS_TRACK},
+#endif
+#ifdef _SC_SYMLOOP_MAX
+ {"_SC_SYMLOOP_MAX",	15,	_SC_SYMLOOP_MAX},
+#endif
+#ifdef _SC_STREAMS
+ {"_SC_STREAMS",	11,	_SC_STREAMS},
+#endif
+#ifdef _SC_2_PBS_CHECKPOINT
+ {"_SC_2_PBS_CHECKPOINT",	20,	_SC_2_PBS_CHECKPOINT},
+#endif
+#ifdef _SC_V6_ILP32_OFF32
+ {"_SC_V6_ILP32_OFF32",	18,	_SC_V6_ILP32_OFF32},
+#endif
+#ifdef _SC_V6_ILP32_OFFBIG
+ {"_SC_V6_ILP32_OFFBIG",	19,	_SC_V6_ILP32_OFFBIG},
+#endif
+#ifdef _SC_V6_LP64_OFF64
+ {"_SC_V6_LP64_OFF64",	17,	_SC_V6_LP64_OFF64},
+#endif
+#ifdef _SC_V6_LPBIG_OFFBIG
+ {"_SC_V6_LPBIG_OFFBIG",	19,	_SC_V6_LPBIG_OFFBIG},
+#endif
+#ifdef _SC_HOST_NAME_MAX
+ {"_SC_HOST_NAME_MAX",	17,	_SC_HOST_NAME_MAX},
+#endif
+#ifdef _SC_TRACE
+ {"_SC_TRACE",	9,	_SC_TRACE},
+#endif
+#ifdef _SC_TRACE_EVENT_FILTER
+ {"_SC_TRACE_EVENT_FILTER",	22,	_SC_TRACE_EVENT_FILTER},
+#endif
+#ifdef _SC_TRACE_INHERIT
+ {"_SC_TRACE_INHERIT",	17,	_SC_TRACE_INHERIT},
+#endif
+#ifdef _SC_TRACE_LOG
+ {"_SC_TRACE_LOG",	13,	_SC_TRACE_LOG},
+#endif
+#ifdef _SC_LEVEL1_ICACHE_SIZE
+ {"_SC_LEVEL1_ICACHE_SIZE",	22,	_SC_LEVEL1_ICACHE_SIZE},
+#endif
+#ifdef _SC_LEVEL1_ICACHE_ASSOC
+ {"_SC_LEVEL1_ICACHE_ASSOC",	23,	_SC_LEVEL1_ICACHE_ASSOC},
+#endif
+#ifdef _SC_LEVEL1_ICACHE_LINESIZE
+ {"_SC_LEVEL1_ICACHE_LINESIZE",	26,	_SC_LEVEL1_ICACHE_LINESIZE},
+#endif
+#ifdef _SC_LEVEL1_DCACHE_SIZE
+ {"_SC_LEVEL1_DCACHE_SIZE",	22,	_SC_LEVEL1_DCACHE_SIZE},
+#endif
+#ifdef _SC_LEVEL1_DCACHE_ASSOC
+ {"_SC_LEVEL1_DCACHE_ASSOC",	23,	_SC_LEVEL1_DCACHE_ASSOC},
+#endif
+#ifdef _SC_LEVEL1_DCACHE_LINESIZE
+ {"_SC_LEVEL1_DCACHE_LINESIZE",	26,	_SC_LEVEL1_DCACHE_LINESIZE},
+#endif
+#ifdef _SC_LEVEL2_CACHE_SIZE
+ {"_SC_LEVEL2_CACHE_SIZE",	21,	_SC_LEVEL2_CACHE_SIZE},
+#endif
+#ifdef _SC_LEVEL2_CACHE_ASSOC
+ {"_SC_LEVEL2_CACHE_ASSOC",	22,	_SC_LEVEL2_CACHE_ASSOC},
+#endif
+#ifdef _SC_LEVEL2_CACHE_LINESIZE
+ {"_SC_LEVEL2_CACHE_LINESIZE",	25,	_SC_LEVEL2_CACHE_LINESIZE},
+#endif
+#ifdef _SC_LEVEL3_CACHE_SIZE
+ {"_SC_LEVEL3_CACHE_SIZE",	21,	_SC_LEVEL3_CACHE_SIZE},
+#endif
+#ifdef _SC_LEVEL3_CACHE_ASSOC
+ {"_SC_LEVEL3_CACHE_ASSOC",	22,	_SC_LEVEL3_CACHE_ASSOC},
+#endif
+#ifdef _SC_LEVEL3_CACHE_LINESIZE
+ {"_SC_LEVEL3_CACHE_LINESIZE",	25,	_SC_LEVEL3_CACHE_LINESIZE},
+#endif
+#ifdef _SC_LEVEL4_CACHE_SIZE
+ {"_SC_LEVEL4_CACHE_SIZE",	21,	_SC_LEVEL4_CACHE_SIZE},
+#endif
+#ifdef _SC_LEVEL4_CACHE_ASSOC
+ {"_SC_LEVEL4_CACHE_ASSOC",	22,	_SC_LEVEL4_CACHE_ASSOC},
+#endif
+#ifdef _SC_LEVEL4_CACHE_LINESIZE
+ {"_SC_LEVEL4_CACHE_LINESIZE",	25,	_SC_LEVEL4_CACHE_LINESIZE},
+#endif
+#ifdef _SC_IPV6
+ {"_SC_IPV6",	8,	_SC_IPV6},
+#endif
+#ifdef _SC_RAW_SOCKETS
+ {"_SC_RAW_SOCKETS",	15,	_SC_RAW_SOCKETS},
+#endif
+ {NULL, 0, -1}
+};
+
+/*}}}*/
+
+#ifdef HAVE_CONFSTR
+static const Name_Map_Type CS_Name_Map_Table = /*{{{*/
+{
+#ifdef _CS_PATH
+ {"_CS_PATH",	8,	_CS_PATH},
+#endif
+#ifdef _CS_V6_WIDTH_RESTRICTED_ENVS
+ {"_CS_V6_WIDTH_RESTRICTED_ENVS",	28,	_CS_V6_WIDTH_RESTRICTED_ENVS},
+#endif
+#ifdef _CS_GNU_LIBC_VERSION
+ {"_CS_GNU_LIBC_VERSION",	20,	_CS_GNU_LIBC_VERSION},
+#endif
+#ifdef _CS_GNU_LIBPTHREAD_VERSION
+ {"_CS_GNU_LIBPTHREAD_VERSION",	26,	_CS_GNU_LIBPTHREAD_VERSION},
+#endif
+#ifdef _CS_LFS_CFLAGS
+ {"_CS_LFS_CFLAGS",	14,	_CS_LFS_CFLAGS},
+#endif
+#ifdef _CS_LFS_LDFLAGS
+ {"_CS_LFS_LDFLAGS",	15,	_CS_LFS_LDFLAGS},
+#endif
+#ifdef _CS_LFS_LIBS
+ {"_CS_LFS_LIBS",	12,	_CS_LFS_LIBS},
+#endif
+#ifdef _CS_LFS_LINTFLAGS
+ {"_CS_LFS_LINTFLAGS",	17,	_CS_LFS_LINTFLAGS},
+#endif
+#ifdef _CS_LFS64_CFLAGS
+ {"_CS_LFS64_CFLAGS",	16,	_CS_LFS64_CFLAGS},
+#endif
+#ifdef _CS_LFS64_LDFLAGS
+ {"_CS_LFS64_LDFLAGS",	17,	_CS_LFS64_LDFLAGS},
+#endif
+#ifdef _CS_LFS64_LIBS
+ {"_CS_LFS64_LIBS",	14,	_CS_LFS64_LIBS},
+#endif
+#ifdef _CS_LFS64_LINTFLAGS
+ {"_CS_LFS64_LINTFLAGS",	19,	_CS_LFS64_LINTFLAGS},
+#endif
+#ifdef _CS_XBS5_ILP32_OFF32_CFLAGS
+ {"_CS_XBS5_ILP32_OFF32_CFLAGS",	27,	_CS_XBS5_ILP32_OFF32_CFLAGS},
+#endif
+#ifdef _CS_XBS5_ILP32_OFF32_LDFLAGS
+ {"_CS_XBS5_ILP32_OFF32_LDFLAGS",	28,	_CS_XBS5_ILP32_OFF32_LDFLAGS},
+#endif
+#ifdef _CS_XBS5_ILP32_OFF32_LIBS
+ {"_CS_XBS5_ILP32_OFF32_LIBS",	25,	_CS_XBS5_ILP32_OFF32_LIBS},
+#endif
+#ifdef _CS_XBS5_ILP32_OFF32_LINTFLAGS
+ {"_CS_XBS5_ILP32_OFF32_LINTFLAGS",	30,	_CS_XBS5_ILP32_OFF32_LINTFLAGS},
+#endif
+#ifdef _CS_XBS5_ILP32_OFFBIG_CFLAGS
+ {"_CS_XBS5_ILP32_OFFBIG_CFLAGS",	28,	_CS_XBS5_ILP32_OFFBIG_CFLAGS},
+#endif
+#ifdef _CS_XBS5_ILP32_OFFBIG_LDFLAGS
+ {"_CS_XBS5_ILP32_OFFBIG_LDFLAGS",	29,	_CS_XBS5_ILP32_OFFBIG_LDFLAGS},
+#endif
+#ifdef _CS_XBS5_ILP32_OFFBIG_LIBS
+ {"_CS_XBS5_ILP32_OFFBIG_LIBS",	26,	_CS_XBS5_ILP32_OFFBIG_LIBS},
+#endif
+#ifdef _CS_XBS5_ILP32_OFFBIG_LINTFLAGS
+ {"_CS_XBS5_ILP32_OFFBIG_LINTFLAGS",	31,	_CS_XBS5_ILP32_OFFBIG_LINTFLAGS},
+#endif
+#ifdef _CS_XBS5_LP64_OFF64_CFLAGS
+ {"_CS_XBS5_LP64_OFF64_CFLAGS",	26,	_CS_XBS5_LP64_OFF64_CFLAGS},
+#endif
+#ifdef _CS_XBS5_LP64_OFF64_LDFLAGS
+ {"_CS_XBS5_LP64_OFF64_LDFLAGS",	27,	_CS_XBS5_LP64_OFF64_LDFLAGS},
+#endif
+#ifdef _CS_XBS5_LP64_OFF64_LIBS
+ {"_CS_XBS5_LP64_OFF64_LIBS",	24,	_CS_XBS5_LP64_OFF64_LIBS},
+#endif
+#ifdef _CS_XBS5_LP64_OFF64_LINTFLAGS
+ {"_CS_XBS5_LP64_OFF64_LINTFLAGS",	29,	_CS_XBS5_LP64_OFF64_LINTFLAGS},
+#endif
+#ifdef _CS_XBS5_LPBIG_OFFBIG_CFLAGS
+ {"_CS_XBS5_LPBIG_OFFBIG_CFLAGS",	28,	_CS_XBS5_LPBIG_OFFBIG_CFLAGS},
+#endif
+#ifdef _CS_XBS5_LPBIG_OFFBIG_LDFLAGS
+ {"_CS_XBS5_LPBIG_OFFBIG_LDFLAGS",	29,	_CS_XBS5_LPBIG_OFFBIG_LDFLAGS},
+#endif
+#ifdef _CS_XBS5_LPBIG_OFFBIG_LIBS
+ {"_CS_XBS5_LPBIG_OFFBIG_LIBS",	26,	_CS_XBS5_LPBIG_OFFBIG_LIBS},
+#endif
+#ifdef _CS_XBS5_LPBIG_OFFBIG_LINTFLAGS
+ {"_CS_XBS5_LPBIG_OFFBIG_LINTFLAGS",	31,	_CS_XBS5_LPBIG_OFFBIG_LINTFLAGS},
+#endif
+#ifdef _CS_POSIX_V6_ILP32_OFF32_CFLAGS
+ {"_CS_POSIX_V6_ILP32_OFF32_CFLAGS",	31,	_CS_POSIX_V6_ILP32_OFF32_CFLAGS},
+#endif
+#ifdef _CS_POSIX_V6_ILP32_OFF32_LDFLAGS
+ {"_CS_POSIX_V6_ILP32_OFF32_LDFLAGS",	32,	_CS_POSIX_V6_ILP32_OFF32_LDFLAGS},
+#endif
+#ifdef _CS_POSIX_V6_ILP32_OFF32_LIBS
+ {"_CS_POSIX_V6_ILP32_OFF32_LIBS",	29,	_CS_POSIX_V6_ILP32_OFF32_LIBS},
+#endif
+#ifdef _CS_POSIX_V6_ILP32_OFF32_LINTFLAGS
+ {"_CS_POSIX_V6_ILP32_OFF32_LINTFLAGS",	34,	_CS_POSIX_V6_ILP32_OFF32_LINTFLAGS},
+#endif
+#ifdef _CS_POSIX_V6_ILP32_OFFBIG_CFLAGS
+ {"_CS_POSIX_V6_ILP32_OFFBIG_CFLAGS",	32,	_CS_POSIX_V6_ILP32_OFFBIG_CFLAGS},
+#endif
+#ifdef _CS_POSIX_V6_ILP32_OFFBIG_LDFLAGS
+ {"_CS_POSIX_V6_ILP32_OFFBIG_LDFLAGS",	33,	_CS_POSIX_V6_ILP32_OFFBIG_LDFLAGS},
+#endif
+#ifdef _CS_POSIX_V6_ILP32_OFFBIG_LIBS
+ {"_CS_POSIX_V6_ILP32_OFFBIG_LIBS",	30,	_CS_POSIX_V6_ILP32_OFFBIG_LIBS},
+#endif
+#ifdef _CS_POSIX_V6_ILP32_OFFBIG_LINTFLAGS
+ {"_CS_POSIX_V6_ILP32_OFFBIG_LINTFLAGS",	35,	_CS_POSIX_V6_ILP32_OFFBIG_LINTFLAGS},
+#endif
+#ifdef _CS_POSIX_V6_LP64_OFF64_CFLAGS
+ {"_CS_POSIX_V6_LP64_OFF64_CFLAGS",	30,	_CS_POSIX_V6_LP64_OFF64_CFLAGS},
+#endif
+#ifdef _CS_POSIX_V6_LP64_OFF64_LDFLAGS
+ {"_CS_POSIX_V6_LP64_OFF64_LDFLAGS",	31,	_CS_POSIX_V6_LP64_OFF64_LDFLAGS},
+#endif
+#ifdef _CS_POSIX_V6_LP64_OFF64_LIBS
+ {"_CS_POSIX_V6_LP64_OFF64_LIBS",	28,	_CS_POSIX_V6_LP64_OFF64_LIBS},
+#endif
+#ifdef _CS_POSIX_V6_LP64_OFF64_LINTFLAGS
+ {"_CS_POSIX_V6_LP64_OFF64_LINTFLAGS",	33,	_CS_POSIX_V6_LP64_OFF64_LINTFLAGS},
+#endif
+#ifdef _CS_POSIX_V6_LPBIG_OFFBIG_CFLAGS
+ {"_CS_POSIX_V6_LPBIG_OFFBIG_CFLAGS",	32,	_CS_POSIX_V6_LPBIG_OFFBIG_CFLAGS},
+#endif
+#ifdef _CS_POSIX_V6_LPBIG_OFFBIG_LDFLAGS
+ {"_CS_POSIX_V6_LPBIG_OFFBIG_LDFLAGS",	33,	_CS_POSIX_V6_LPBIG_OFFBIG_LDFLAGS},
+#endif
+#ifdef _CS_POSIX_V6_LPBIG_OFFBIG_LIBS
+ {"_CS_POSIX_V6_LPBIG_OFFBIG_LIBS",	30,	_CS_POSIX_V6_LPBIG_OFFBIG_LIBS},
+#endif
+#ifdef _CS_POSIX_V6_LPBIG_OFFBIG_LINTFLAGS
+ {"_CS_POSIX_V6_LPBIG_OFFBIG_LINTFLAGS",	35,	_CS_POSIX_V6_LPBIG_OFFBIG_LINTFLAGS},
+#endif
+ {NULL, 0, -1}
+};
+
+/*}}}*/
+#endif
+
+#ifdef HAVE_PATHCONF
+static const Name_Map_Type PC_Name_Map_Table = /*{{{*/
+{
+#ifdef _PC_LINK_MAX
+ {"_PC_LINK_MAX",	12,	_PC_LINK_MAX},
+#endif
+#ifdef _PC_MAX_CANON
+ {"_PC_MAX_CANON",	13,	_PC_MAX_CANON},
+#endif
+#ifdef _PC_MAX_INPUT
+ {"_PC_MAX_INPUT",	13,	_PC_MAX_INPUT},
+#endif
+#ifdef _PC_NAME_MAX
+ {"_PC_NAME_MAX",	12,	_PC_NAME_MAX},
+#endif
+#ifdef _PC_PATH_MAX
+ {"_PC_PATH_MAX",	12,	_PC_PATH_MAX},
+#endif
+#ifdef _PC_PIPE_BUF
+ {"_PC_PIPE_BUF",	12,	_PC_PIPE_BUF},
+#endif
+#ifdef _PC_CHOWN_RESTRICTED
+ {"_PC_CHOWN_RESTRICTED",	20,	_PC_CHOWN_RESTRICTED},
+#endif
+#ifdef _PC_NO_TRUNC
+ {"_PC_NO_TRUNC",	12,	_PC_NO_TRUNC},
+#endif
+#ifdef _PC_VDISABLE
+ {"_PC_VDISABLE",	12,	_PC_VDISABLE},
+#endif
+#ifdef _PC_SYNC_IO
+ {"_PC_SYNC_IO",	11,	_PC_SYNC_IO},
+#endif
+#ifdef _PC_ASYNC_IO
+ {"_PC_ASYNC_IO",	12,	_PC_ASYNC_IO},
+#endif
+#ifdef _PC_PRIO_IO
+ {"_PC_PRIO_IO",	11,	_PC_PRIO_IO},
+#endif
+#ifdef _PC_SOCK_MAXBUF
+ {"_PC_SOCK_MAXBUF",	15,	_PC_SOCK_MAXBUF},
+#endif
+#ifdef _PC_FILESIZEBITS
+ {"_PC_FILESIZEBITS",	16,	_PC_FILESIZEBITS},
+#endif
+#ifdef _PC_REC_INCR_XFER_SIZE
+ {"_PC_REC_INCR_XFER_SIZE",	22,	_PC_REC_INCR_XFER_SIZE},
+#endif
+#ifdef _PC_REC_MAX_XFER_SIZE
+ {"_PC_REC_MAX_XFER_SIZE",	21,	_PC_REC_MAX_XFER_SIZE},
+#endif
+#ifdef _PC_REC_MIN_XFER_SIZE
+ {"_PC_REC_MIN_XFER_SIZE",	21,	_PC_REC_MIN_XFER_SIZE},
+#endif
+#ifdef _PC_REC_XFER_ALIGN
+ {"_PC_REC_XFER_ALIGN",	18,	_PC_REC_XFER_ALIGN},
+#endif
+#ifdef _PC_ALLOC_SIZE_MIN
+ {"_PC_ALLOC_SIZE_MIN",	18,	_PC_ALLOC_SIZE_MIN},
+#endif
+#ifdef _PC_SYMLINK_MAX
+ {"_PC_SYMLINK_MAX",	15,	_PC_SYMLINK_MAX},
+#endif
+#ifdef _PC_2_SYMLINKS
+ {"_PC_2_SYMLINKS",	14,	_PC_2_SYMLINKS},
+#endif
+ {NULL, 0, -1},
+};
+
+/*}}}*/
+#endif
+
+/* return -1 upon error, 0 if name not found, 1 if found or specified. */
+static int pop_iname (const Name_Map_Type *map, int *inamep)
+{
+ if (SLang_peek_at_stack () == SLANG_STRING_TYPE)
+ {
+	char *name;
+	if (-1 == SLang_pop_slstring (&name))
+	 return -1;
+	map = lookup_name (map, name);
+	SLang_free_slstring (name);
+	if (map == NULL)
+	 return 0;
+
+	*inamep = map->iname;
+ }
+ else if (-1 == SLang_pop_int (inamep))
+ return -1;
+
+ return 1;
+}
+
+/* Usage: val = sysconf (name|iname ,defval) */
+static void sysconf_intrinsic (void)
+{
+ int has_def_val = 0;
+ long defval = -1;
+ long val;
+ int iname;
+ int status;
+
+ if (SLang_Num_Function_Args == 2)
+ {
+	if (-1 == SLang_pop_long (&defval))
+	 return;
+	has_def_val = 1;
+ }
+
+ status = pop_iname (SC_Name_Map_Table, &iname);
+ if (status == -1)
+ return;
+
+ if (status == 0)
+ goto return_default;
+
+ errno = 0;
+ val = sysconf (iname);
+ if (val == -1)
+ {
+	if (errno)
+	 goto return_default;
+
+	if (has_def_val)
+	 val = defval;
+ }
+
+ (void) SLang_push_long (val);
+ return;
+
+return_default:
+ if (has_def_val)
+ (void) SLang_push_long (defval);
+ else
+ (void) SLang_push_null ();
+}
+
+#ifdef HAVE_PATHCONF
+static void pathconf_intrinsic (void)
+{
+ int has_def_val = 0;
+ long defval = -1;
+ long val;
+ int iname;
+ int status;
+ char *path = NULL;
+ int fd = -1, e;
+
+ if (SLang_Num_Function_Args == 3)
+ {
+	if (-1 == SLang_pop_long (&defval))
+	 return;
+	has_def_val = 1;
+ }
+
+ status = pop_iname (PC_Name_Map_Table, &iname);
+ if (status == -1)
+ return;
+
+ switch (SLang_peek_at_stack ())
+ {
+ case SLANG_STRING_TYPE:
+	if (-1 == SLang_pop_slstring (&path))
+	 return;
+	break;
+
+ case SLANG_FILE_PTR_TYPE:
+	 {
+	 FILE *fp;
+	 SLang_MMT_Type *mmt;
+
+	 if (-1 == SLang_pop_fileptr (&mmt, &fp))
+	 return;
+	 fd = fileno (fp);
+	 SLang_free_mmt (mmt);
+	 }
+	break;
+
+ default:
+	 {
+	 SLFile_FD_Type *f;
+	 if (-1 == SLfile_pop_fd (&f))
+	 return;
+	 if (-1 == SLfile_get_fd (f, &fd))
+	 {
+		 SLfile_free_fd (f);
+		 return;
+	 }
+	 SLfile_free_fd (f);
+	 }
+ }
+
+ if (status == 0)
+ {
+	e = EINVAL;
+	if (path != NULL)
+	 SLang_free_slstring (path);
+	goto return_default;
+ }
+
+ errno = 0;
+ if (path != NULL)
+ {
+	val = pathconf (path, iname);
+	e = errno;
+	SLang_free_slstring (path);
+ }
+ else
+ {
+	val = fpathconf (fd, iname);
+	e = errno;
+ }
+
+ if (val == -1)
+ {
+	if (e)
+	 goto return_default;
+
+	if (has_def_val)
+	 val = defval;
+ }
+
+ (void) SLang_push_long (val);
+ return;
+
+return_default:
+ if (has_def_val && (e == EINVAL))
+ (void) SLang_push_long (defval);
+ else
+ {
+	SLerrno_set_errno (e);
+	(void) SLang_push_null ();
+ }
+}
+#endif
+
+#ifdef HAVE_CONFSTR
+/* Usage: val = sysconf (name|iname ,defval) */
+static void confstr_intrinsic (void)
+{
+ char *defstr = NULL;
+ int use_def_val = 0;
+ int iname;
+ int status;
+ char buf10;
+ char *bufstr;
+ size_t len;
+
+ if (SLang_Num_Function_Args == 2)
+ {
+	if (-1 == SLang_pop_slstring (&defstr))
+	 return;
+	use_def_val = 1;
+ }
+
+ status = pop_iname (CS_Name_Map_Table, &iname);
+ if (status == -1)
+ {
+	SLang_free_slstring (defstr); /* NULL ok */
+	return;
+ }
+
+ errno = 0;
+ if ((status == 0)
+ || (0 == (len = confstr (iname, buf, sizeof(buf)))))
+ {
+	if ((errno != EINVAL) && (errno != 0))
+	 {
+	 SLerrno_set_errno (errno);
+	 use_def_val = 0;
+	 }
+
+	if (use_def_val)
+	 (void) SLang_push_string(defstr);
+	else
+	 (void) SLang_push_null ();
+
+	SLang_free_slstring (defstr);
+	return;
+ }
+
+ SLang_free_slstring (defstr);
+ defstr = NULL;
+
+ if (len <= sizeof(buf))
+ {
+	SLang_push_string (buf);
+	return;
+ }
+
+ if (NULL == (bufstr = (char *)SLmalloc (len)))
+ return;
+
+ errno = 0;
+ len = confstr (iname, bufstr, len);
+ if (len == 0)
+ {
+	SLerrno_set_errno (errno);
+	SLfree (bufstr);
+	(void) SLang_push_null ();
+	return;
+ }
+ (void) SLang_push_malloced_string (bufstr); /* frees bufstr */
+}
+#endif
+
+static int push_map (const Name_Map_Type *map)
+{
+ SLindex_Type num = 0;
+ const Name_Map_Type *m;
+ SLang_Array_Type *at;
+ char **names;
+
+ m = map;
+ while (m->name != NULL)
+ {
+	num++;
+	m++;
+ }
+
+ if (NULL == (at = SLang_create_array (SLANG_STRING_TYPE, 1, NULL, &num, 1)))
+ return -1;
+
+ names = (char **) at->data;
+ m = map;
+ while (m->name != NULL)
+ {
+	if (NULL == (*names = SLang_create_slstring ((char *) m->name)))
+	 {
+	 SLang_free_array (at);
+	 return -1;
+	 }
+	names++;
+	m++;
+ }
+
+ return SLang_push_array (at, 1);
+}
+
+static void sysconf_names_intrinsic (void)
+{
+ (void) push_map (SC_Name_Map_Table);
+}
+
+#ifdef HAVE_PATHCONF
+static void pathconf_names_intrinsic (void)
+{
+ (void) push_map (PC_Name_Map_Table);
+}
+#endif
+
+#ifdef HAVE_CONFSTR
+static void confstr_names_intrinsic (void)
+{
+ (void) push_map (CS_Name_Map_Table);
+}
+#endif
+
+static SLang_Intrin_Fun_Type Module_Intrinsics =
+{
+ MAKE_INTRINSIC_0("sysconf", sysconf_intrinsic, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("sysconf_names", sysconf_names_intrinsic, SLANG_VOID_TYPE),
+#ifdef HAVE_PATHCONF
+ MAKE_INTRINSIC_0("pathconf", pathconf_intrinsic, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("pathconf_names", pathconf_names_intrinsic, SLANG_VOID_TYPE),
+#endif
+#ifdef HAVE_CONFSTR
+ MAKE_INTRINSIC_0("confstr", confstr_intrinsic, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("confstr_names", confstr_names_intrinsic, SLANG_VOID_TYPE),
+#endif
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+int init_sysconf_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if (-1 == SLns_add_intrin_fun_table (ns, Module_Intrinsics, NULL))
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_sysconf_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/sysconf.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/template.c Added

@@ -0,0 +1,49 @@
+#include <stdio.h>
+#include <slang.h>
+
+SLANG_MODULE(<MODULE-NAME>);
+
+#define MODULE_MAJOR_VERSION	0
+#define MODULE_MINOR_VERSION	0
+#define MODULE_PATCH_LEVEL	0
+static char *Module_Version_String = "0.0.0";
+#define MODULE_VERSION_NUMBER	\
+ (MODULE_MAJOR_VERSION*10000+MODULE_MINOR_VERSION*100+MODULE_PATCH_LEVEL)
+
+/* Define intrinsics here */
+
+static SLang_Intrin_Fun_Type Module_Intrinsics =
+{
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static SLang_Intrin_Var_Type Module_Variables =
+{
+ MAKE_VARIABLE("_<MODULE-NAME>_module_version_string", &Module_Version_String, SLANG_STRING_TYPE, 1),
+ SLANG_END_INTRIN_VAR_TABLE
+};
+
+static SLang_IConstant_Type Module_Constants =
+{
+ MAKE_ICONSTANT("_<MODULE-NAME>_module_version", MODULE_VERSION_NUMBER),
+ SLANG_END_ICONST_TABLE
+};
+
+int init_<MODULE-NAME>_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if ((-1 == SLns_add_intrin_fun_table (ns, Module_Intrinsics, NULL))
+ || (-1 == SLns_add_intrin_var_table (ns, Module_Variables, NULL))
+ || (-1 == SLns_add_iconstant_table (ns, Module_Constants, NULL)))
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_<MODULE-NAME>_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/termios-module.c Added

@@ -0,0 +1,749 @@
+/*
+Copyright (C) 2010-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include <stdio.h>
+#include <slang.h>
+
+#include <unistd.h>
+#include <string.h>
+#include <termios.h>
+#include <errno.h>
+
+SLANG_MODULE(termios);
+
+static int Termios_Type_Id = 0;
+
+static int check_and_set_errno (int e)
+{
+#ifdef EINTR
+ if (e == EINTR)
+ return 0;
+#endif
+ (void) SLerrno_set_errno (e);
+ return -1;
+}
+
+static int do_syscall_0 (int (*fun)(int), SLFile_FD_Type *f)
+{
+ int fd;
+ int ret;
+
+ if (-1 == SLfile_get_fd (f, &fd))
+ return -1;
+
+ while ((-1 == (ret = (*fun) (fd)))
+	 && (0 == check_and_set_errno (errno)))
+ ;
+
+ return ret;
+}
+
+static int do_syscall_1 (int (*fun)(int, int), SLFile_FD_Type *f, int arg)
+{
+ int fd;
+ int ret;
+
+ if (-1 == SLfile_get_fd (f, &fd))
+ return -1;
+
+ while ((-1 == (ret = (*fun) (fd, arg)))
+	 && (0 == check_and_set_errno (errno)))
+ ;
+
+ return ret;
+}
+
+static int do_syscall_struct_1 (int (*fun)(int, void *), SLFile_FD_Type *f, void *v)
+{
+ int fd;
+ int ret;
+
+ if (-1 == SLfile_get_fd (f, &fd))
+ return -1;
+
+ while ((-1 == (ret = (*fun) (fd, v)))
+	 && (0 == check_and_set_errno (errno)))
+ ;
+
+ return ret;
+}
+
+static int do_syscall_struct_2 (int (*fun)(int, int, void *), SLFile_FD_Type *f, int i, void *v)
+{
+ int fd;
+ int ret;
+
+ if (-1 == SLfile_get_fd (f, &fd))
+ return -1;
+
+ while ((-1 == (ret = (*fun) (fd, i, v)))
+	 && (0 == check_and_set_errno (errno)))
+ ;
+
+ return ret;
+}
+
+#define DO_SYSCALL_0(fun, f) do_syscall_0((int(*)(int))(fun),(f))
+#define DO_SYSCALL_1(fun, f, i) do_syscall_1((int(*)(int,int))(fun),(f),(i))
+#define DO_SYSCALL_STRUCT_1(fun, f, s) \
+ do_syscall_struct_1((int(*)(int, void*))(fun), (f), (void*)(s))
+#define DO_SYSCALL_STRUCT_2(fun, f, i, s) \
+ do_syscall_struct_2((int(*)(int, int, void*))(fun), (f), (i), (void*)(s))
+
+static int tcdrain_intrin (SLFile_FD_Type *f)
+{
+ return DO_SYSCALL_0 (tcdrain, f);
+}
+
+static int tcflow_intrin (SLFile_FD_Type *f, int *action)
+{
+ return DO_SYSCALL_1 (tcflow, f, *action);
+}
+
+static int tcflush_intrin (SLFile_FD_Type *f, int *action)
+{
+ return DO_SYSCALL_1 (tcflush, f, *action);
+}
+
+static int tcgetpgrp_intrin (SLFile_FD_Type *f)
+{
+ return DO_SYSCALL_0 (tcgetpgrp, f);
+}
+
+static int tcsetpgrp_intrin (SLFile_FD_Type *f, int *id)
+{
+ return DO_SYSCALL_1 (tcgetpgrp, f, *id);
+}
+
+static int tcsendbreak_intrin (SLFile_FD_Type *f, int *action)
+{
+ return DO_SYSCALL_1 (tcsendbreak, f, *action);
+}
+
+static void destroy_termios (SLtype type, VOID_STAR f)
+{
+ (void) type;
+ SLfree ((char *) f);
+}
+
+static SLang_MMT_Type *allocate_termios (struct termios *s)
+{
+ struct termios *s1;
+ SLang_MMT_Type *mmt;
+
+ s1 = (struct termios *) SLmalloc (sizeof (struct termios));
+ if (s1 == NULL)
+ return NULL;
+
+ memcpy (s1, s, sizeof (struct termios));
+ if (NULL == (mmt = SLang_create_mmt (Termios_Type_Id, (VOID_STAR) s1)))
+ SLfree ((char *) s1);
+ return mmt;
+}
+
+static void tcgetattr_intrin (SLFile_FD_Type *f)
+{
+ struct termios s;
+ SLang_MMT_Type *mmt;
+
+ if (-1 == DO_SYSCALL_STRUCT_1(tcgetattr,f,&s))
+ {
+	SLang_push_null ();
+	return;
+ }
+
+ mmt = allocate_termios (&s);	 /* NULL ok */
+ if (-1 == SLang_push_mmt (mmt))
+ SLang_free_mmt (mmt);
+}
+
+static int tcsetattr_intrin (SLFile_FD_Type *f, int *when, struct termios *s)
+{
+ return DO_SYSCALL_STRUCT_2(tcsetattr,f,*when,s);
+}
+
+static int termios_get_oflag (struct termios *s)
+{
+ return s->c_oflag;
+}
+static int termios_get_iflag (struct termios *s)
+{
+ return s->c_iflag;
+}
+static int termios_get_cflag (struct termios *s)
+{
+ return s->c_cflag;
+}
+static int termios_get_lflag (struct termios *s)
+{
+ return s->c_lflag;
+}
+
+static void termios_get_cc (struct termios *s)
+{
+ SLang_Array_Type *at;
+ SLindex_Type dims = NCCS;
+ int i;
+ unsigned char *at_data;
+
+ at = SLang_create_array (SLANG_UCHAR_TYPE, 0, NULL, &dims, 1);
+ if (at == NULL)
+ return;
+ at_data = (unsigned char *) at->data;
+
+ for (i = 0; i < NCCS; i++)
+ at_datai = (unsigned char) s->c_cci;
+
+ (void) SLang_push_array (at, 1);
+}
+
+static void termios_set_oflag (struct termios *s, int *flag)
+{
+ s->c_oflag = *flag;
+}
+static void termios_set_iflag (struct termios *s, int *flag)
+{
+ s->c_iflag = *flag;
+}
+static void termios_set_cflag (struct termios *s, int *flag)
+{
+ s->c_cflag = *flag;
+}
+static void termios_set_lflag (struct termios *s, int *flag)
+{
+ s->c_lflag = *flag;
+}
+
+static void termios_set_cc (void)
+{
+ SLang_Array_Type *at;
+ SLang_MMT_Type *mmt;
+ struct termios *s;
+ unsigned char *at_data;
+ int i;
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_UCHAR_TYPE))
+ return;
+ if (NULL == (mmt = SLang_pop_mmt (Termios_Type_Id)))
+ goto free_and_return;
+
+ s = (struct termios *) SLang_object_from_mmt (mmt);
+ if (at->num_elements != NCCS)
+ {
+	SLang_verror (SL_TYPE_MISMATCH,
+		 "Expecting UChar_Type%d", NCCS);
+	goto free_and_return;
+ }
+
+ at_data = (unsigned char *) at->data;
+ for (i = 0; i < NCCS; i++)
+ s->c_cci = at_datai;
+
+ /* drop */
+
+ free_and_return:
+ SLang_free_array (at);
+ SLang_free_mmt (mmt);
+}
+
+typedef struct
+{
+ unsigned int bspeed;
+ unsigned int speed;
+}
+Baudrate_Map_Type;
+
+Baudrate_Map_Type Baudrate_Map =
+{
+#ifdef B0
+ {B0, 0},
+#endif
+#ifdef B50
+ {B50, 50},
+#endif
+#ifdef B75
+ {B75, 75},
+#endif
+#ifdef B110
+ {B110, 110},
+#endif
+#ifdef B134
+ {B134, 134},
+#endif
+#ifdef B150
+ {B150, 150},
+#endif
+#ifdef B200
+ {B200, 200},
+#endif
+#ifdef B300
+ {B300, 300},
+#endif
+#ifdef B600
+ {B600, 600},
+#endif
+#ifdef B1200
+ {B1200, 1200},
+#endif
+#ifdef B1800
+ {B1800, 1800},
+#endif
+#ifdef B2400
+ {B2400, 2400},
+#endif
+#ifdef B4800
+ {B4800, 4800},
+#endif
+#ifdef B9600
+ {B9600, 9600},
+#endif
+#ifdef B19200
+ {B19200, 19200},
+#endif
+#ifdef B38400
+ {B38400, 38400},
+#endif
+#ifdef B57600
+ {B57600, 57600},
+#endif
+#ifdef B115200
+ {B115200, 115200},
+#endif
+#ifdef B230400
+ {B230400, 230400},
+#endif
+#ifdef B460800
+ {B460800, 460800},
+#endif
+#ifdef B500000
+ {B500000, 500000},
+#endif
+#ifdef B576000
+ {B576000, 576000},
+#endif
+#ifdef B921600
+ {B921600, 921600},
+#endif
+#ifdef B1000000
+ {B1000000, 1000000},
+#endif
+#ifdef B1152000
+ {B1152000, 1152000},
+#endif
+#ifdef B1500000
+ {B1500000, 1500000},
+#endif
+#ifdef B2000000
+ {B2000000, 2000000},
+#endif
+#ifdef B2500000
+ {B2500000, 2500000},
+#endif
+#ifdef B3000000
+ {B3000000, 3000000},
+#endif
+#ifdef B3500000
+ {B3500000, 3500000},
+#endif
+#ifdef B4000000
+ {B4000000, 4000000},
+#endif
+ {0, 0}
+};
+
+static int map_speed_to_bspeed (unsigned int speed, unsigned int *bspeed)
+{
+ Baudrate_Map_Type *b, *bmax;
+
+ b = Baudrate_Map;
+ bmax = Baudrate_Map + (sizeof(Baudrate_Map)/sizeof(Baudrate_Map_Type)-1);
+
+ while (b < bmax)
+ {
+	if (b->speed == speed)
+	 {
+	 *bspeed = b->bspeed;
+	 return 0;
+	 }
+	b++;
+ }
+ SLang_verror (SL_InvalidParm_Error, "Invalid or Unsupported baudrate %u", speed);
+ return -1;
+}
+
+static int map_bspeed_to_speed (unsigned int bspeed, unsigned int *speed)
+{
+ Baudrate_Map_Type *b, *bmax;
+
+ b = Baudrate_Map;
+ bmax = Baudrate_Map + (sizeof(Baudrate_Map)/sizeof(Baudrate_Map_Type)-1);
+
+ while (b < bmax)
+ {
+	if (b->bspeed == bspeed)
+	 {
+	 *speed = b->speed;
+	 return 0;
+	 }
+	b++;
+ }
+ SLang_verror (SL_InvalidParm_Error, "Invalid or Unsupported baudrate %u", bspeed);
+ return -1;
+}
+
+static void cfgetispeed_intrin (struct termios *t)
+{
+ unsigned int speed, bspeed;
+
+ bspeed = cfgetispeed (t);
+ if (0 == map_bspeed_to_speed (bspeed, &speed))
+ (void) SLang_push_uint (speed);
+}
+
+static void cfgetospeed_intrin (struct termios *t)
+{
+ unsigned int speed, bspeed;
+
+ bspeed = cfgetospeed (t);
+ if (0 == map_bspeed_to_speed (bspeed, &speed))
+ (void) SLang_push_uint (speed);
+}
+
+static int cfsetispeed_intrin (struct termios *t, unsigned int *speed)
+{
+ unsigned int bspeed;
+
+ if (-1 == map_speed_to_bspeed (*speed, &bspeed))
+ return -1;
+
+ if (-1 == cfsetispeed (t, bspeed))
+ {
+	(void) SLerrno_set_errno (errno);
+	return -1;
+ }
+ return 0;
+}
+
+static int cfsetospeed_intrin (struct termios *t, unsigned int *speed)
+{
+ unsigned int bspeed;
+
+ if (-1 == map_speed_to_bspeed (*speed, &bspeed))
+ return -1;
+
+ if (-1 == cfsetospeed (t, bspeed))
+ {
+	(void) SLerrno_set_errno (errno);
+	return -1;
+ }
+ return 0;
+}
+
+static int termios_dereference (SLtype type, VOID_STAR addr)
+{
+ struct termios *s;
+ SLang_MMT_Type *mmt;
+
+ (void) type;
+ mmt = *(SLang_MMT_Type **) addr;
+ if (NULL == (s = (struct termios *)SLang_object_from_mmt (mmt)))
+ return -1;
+
+ mmt = allocate_termios (s);
+ if (-1 == SLang_push_mmt (mmt))
+ {
+	SLang_free_mmt (mmt);
+	return -1;
+ }
+
+ return 0;
+}
+
+#define DUMMY_TERMIOS_TYPE ((unsigned int)-1)
+#define T DUMMY_TERMIOS_TYPE
+#define F SLANG_FILE_FD_TYPE
+#define I SLANG_INT_TYPE
+#define V SLANG_VOID_TYPE
+#define U SLANG_UINT_TYPE
+static SLang_Intrin_Fun_Type Termios_Intrinsics =
+{
+ MAKE_INTRINSIC_1("tcdrain", tcdrain_intrin, I, F),
+ MAKE_INTRINSIC_2("tcflow", tcflow_intrin, I, F, I),
+ MAKE_INTRINSIC_2("tcflush", tcflush_intrin, I, F, I),
+ MAKE_INTRINSIC_1("tcgetpgrp", tcgetpgrp_intrin, I, F),
+ MAKE_INTRINSIC_2("tcsetpgrp", tcsetpgrp_intrin, I, F, I),
+ MAKE_INTRINSIC_2("tcsendbreak", tcsendbreak_intrin, I, F, I),
+ MAKE_INTRINSIC_1("tcgetattr", tcgetattr_intrin, V, F),
+ MAKE_INTRINSIC_3("tcsetattr", tcsetattr_intrin, I, F, I, T),
+ MAKE_INTRINSIC_1("cfgetispeed", cfgetispeed_intrin, V, T),
+ MAKE_INTRINSIC_1("cfgetospeed", cfgetospeed_intrin, V, T),
+ MAKE_INTRINSIC_2("cfsetispeed", cfsetispeed_intrin, I, T, U),
+ MAKE_INTRINSIC_2("cfsetospeed", cfsetospeed_intrin, I, T, U),
+ MAKE_INTRINSIC_1("termios_get_oflag", termios_get_oflag, I, T),
+ MAKE_INTRINSIC_1("termios_get_iflag", termios_get_iflag, I, T),
+ MAKE_INTRINSIC_1("termios_get_cflag", termios_get_cflag, I, T),
+ MAKE_INTRINSIC_1("termios_get_lflag", termios_get_lflag, I, T),
+ MAKE_INTRINSIC_1("termios_get_cc", termios_get_cc, V, T),
+ MAKE_INTRINSIC_2("termios_set_oflag", termios_set_oflag, V, T, I),
+ MAKE_INTRINSIC_2("termios_set_iflag", termios_set_iflag, V, T, I),
+ MAKE_INTRINSIC_2("termios_set_cflag", termios_set_cflag, V, T, I),
+ MAKE_INTRINSIC_2("termios_set_lflag", termios_set_lflag, V, T, I),
+ MAKE_INTRINSIC_0("termios_set_cc", termios_set_cc, V),
+
+ SLANG_END_INTRIN_FUN_TABLE
+};
+#undef T
+#undef I
+#undef F
+#undef V
+#undef U
+
+static SLang_IConstant_Type Termios_Consts =
+{
+#ifdef BRKINT
+ MAKE_ICONSTANT("BRKINT", BRKINT),
+#endif
+#ifdef CLOCAL
+ MAKE_ICONSTANT("CLOCAL", CLOCAL),
+#endif
+#ifdef CREAD
+ MAKE_ICONSTANT("CREAD", CREAD),
+#endif
+#ifdef CS5
+ MAKE_ICONSTANT("CS5", CS5),
+#endif
+#ifdef CS6
+ MAKE_ICONSTANT("CS6", CS6),
+#endif
+#ifdef CS7
+ MAKE_ICONSTANT("CS7", CS7),
+#endif
+#ifdef CS8
+ MAKE_ICONSTANT("CS8", CS8),
+#endif
+#ifdef CSIZE
+ MAKE_ICONSTANT("CSIZE", CSIZE),
+#endif
+#ifdef CSTOPB
+ MAKE_ICONSTANT("CSTOPB", CSTOPB),
+#endif
+#ifdef ECHO
+ MAKE_ICONSTANT("ECHO", ECHO),
+#endif
+#ifdef ECHOE
+ MAKE_ICONSTANT("ECHOE", ECHOE),
+#endif
+#ifdef ECHOK
+ MAKE_ICONSTANT("ECHOK", ECHOK),
+#endif
+#ifdef ECHONL
+ MAKE_ICONSTANT("ECHONL", ECHONL),
+#endif
+#ifdef HUPCL
+ MAKE_ICONSTANT("HUPCL", HUPCL),
+#endif
+#ifdef ICANON
+ MAKE_ICONSTANT("ICANON", ICANON),
+#endif
+#ifdef ICRNL
+ MAKE_ICONSTANT("ICRNL", ICRNL),
+#endif
+#ifdef IEXTEN
+ MAKE_ICONSTANT("IEXTEN", IEXTEN),
+#endif
+#ifdef IGNBRK
+ MAKE_ICONSTANT("IGNBRK", IGNBRK),
+#endif
+#ifdef IGNCR
+ MAKE_ICONSTANT("IGNCR", IGNCR),
+#endif
+#ifdef IGNPAR
+ MAKE_ICONSTANT("IGNPAR", IGNPAR),
+#endif
+#ifdef INLCR
+ MAKE_ICONSTANT("INLCR", INLCR),
+#endif
+#ifdef INPCK
+ MAKE_ICONSTANT("INPCK", INPCK),
+#endif
+#ifdef ISIG
+ MAKE_ICONSTANT("ISIG", ISIG),
+#endif
+#ifdef ISTRIP
+ MAKE_ICONSTANT("ISTRIP", ISTRIP),
+#endif
+#ifdef IXOFF
+ MAKE_ICONSTANT("IXOFF", IXOFF),
+#endif
+#ifdef IXON
+ MAKE_ICONSTANT("IXON", IXON),
+#endif
+#ifdef NOFLSH
+ MAKE_ICONSTANT("NOFLSH", NOFLSH),
+#endif
+#ifdef OPOST
+ MAKE_ICONSTANT("OPOST", OPOST),
+#endif
+#ifdef PARENB
+ MAKE_ICONSTANT("PARENB", PARENB),
+#endif
+#ifdef PARMRK
+ MAKE_ICONSTANT("PARMRK", PARMRK),
+#endif
+#ifdef PARODD
+ MAKE_ICONSTANT("PARODD", PARODD),
+#endif
+#ifdef TCIFLUSH
+ MAKE_ICONSTANT("TCIFLUSH", TCIFLUSH),
+#endif
+#ifdef TCIOFF
+ MAKE_ICONSTANT("TCIOFF", TCIOFF),
+#endif
+#ifdef TCIOFLUSH
+ MAKE_ICONSTANT("TCIOFLUSH", TCIOFLUSH),
+#endif
+#ifdef TCION
+ MAKE_ICONSTANT("TCION", TCION),
+#endif
+#ifdef TCOFLUSH
+ MAKE_ICONSTANT("TCOFLUSH", TCOFLUSH),
+#endif
+#ifdef TCOOFF
+ MAKE_ICONSTANT("TCOOFF", TCOOFF),
+#endif
+#ifdef TCOON
+ MAKE_ICONSTANT("TCOON", TCOON),
+#endif
+#ifdef TCSADRAIN
+ MAKE_ICONSTANT("TCSADRAIN", TCSADRAIN),
+#endif
+#ifdef TCSAFLUSH
+ MAKE_ICONSTANT("TCSAFLUSH", TCSAFLUSH),
+#endif
+#ifdef TCSANOW
+ MAKE_ICONSTANT("TCSANOW", TCSANOW),
+#endif
+#ifdef TOSTOP
+ MAKE_ICONSTANT("TOSTOP", TOSTOP),
+#endif
+#ifdef VEOF
+ MAKE_ICONSTANT("VEOF", VEOF),
+#endif
+#ifdef VEOL
+ MAKE_ICONSTANT("VEOL", VEOL),
+#endif
+#ifdef VERASE
+ MAKE_ICONSTANT("VERASE", VERASE),
+#endif
+#ifdef VINTR
+ MAKE_ICONSTANT("VINTR", VINTR),
+#endif
+#ifdef VKILL
+ MAKE_ICONSTANT("VKILL", VKILL),
+#endif
+#ifdef VMIN
+ MAKE_ICONSTANT("VMIN", VMIN),
+#endif
+ #ifdef VQUIT
+ MAKE_ICONSTANT("VQUIT", VQUIT),
+#endif
+#ifdef VSTART
+ MAKE_ICONSTANT("VSTART", VSTART),
+#endif
+#ifdef VSTOP
+ MAKE_ICONSTANT("VSTOP", VSTOP),
+#endif
+#ifdef VSUSP
+ MAKE_ICONSTANT("VSUSP", VSUSP),
+#endif
+#ifdef VTIME
+ MAKE_ICONSTANT("VTIME", VTIME),
+#endif
+#ifdef CRTSCTS			 /* not POSIX */
+ MAKE_ICONSTANT("CRTSCTS", CRTSCTS),
+#endif
+#ifdef IXANY
+ MAKE_ICONSTANT("IXANY", IXANY),
+#endif
+#ifdef ultrix /* Ultrix gets _POSIX_VDISABLE wrong! */
+# define NULL_VALUE -1
+#else
+# ifdef _POSIX_VDISABLE
+# define NULL_VALUE _POSIX_VDISABLE
+# else
+# define NULL_VALUE 255
+# endif
+#endif
+ MAKE_ICONSTANT("VDISABLE", NULL_VALUE),
+
+ SLANG_END_ICONST_TABLE
+};
+
+static int register_termios_type (void)
+{
+ SLang_Class_Type *cl;
+
+ if (Termios_Type_Id != 0)
+ return 0;
+
+ if (NULL == (cl = SLclass_allocate_class ("Termios_Type")))
+ return -1;
+
+ if (-1 == SLclass_set_destroy_function (cl, destroy_termios))
+ return -1;
+
+ if (-1 == SLclass_set_deref_function (cl, termios_dereference))
+ return -1;
+
+ /* By registering as SLANG_VOID_TYPE, slang will dynamically allocate a
+ * type.
+ */
+ if (-1 == SLclass_register_class (cl, SLANG_VOID_TYPE, sizeof (struct termios), SLANG_CLASS_TYPE_MMT))
+ return -1;
+
+ Termios_Type_Id = SLclass_get_class_id (cl);
+ if (-1 == SLclass_patch_intrin_fun_table1 (Termios_Intrinsics, DUMMY_TERMIOS_TYPE, Termios_Type_Id))
+ return -1;
+
+ return 0;
+}
+
+int init_termios_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns;
+
+ ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if (-1 == register_termios_type ())
+ return -1;
+
+ if ((-1 == SLns_add_intrin_fun_table (ns, Termios_Intrinsics, "__TERMIOS__"))
+ || (-1 == SLns_add_iconstant_table (ns, Termios_Consts, NULL)))
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_termios_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/termios.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/runtests.sh Added

@@ -0,0 +1,52 @@
+#!/bin/sh
+
+ROOT="`pwd`/../.."
+SLSHROOT="$ROOT/slsh"
+export SLSH_CONF_DIR="$SLSHROOT/etc"
+export SLSH_PATH="$SLSHROOT/lib:$ROOT/modules"
+export SLANG_MODULE_PATH="`pwd`/../${ARCH}objs"
+export LD_LIBRARY_PATH="$ROOT/src/${ARCH}elfobjs"
+export DYLD_LIBRARY_PATH="$ROOT/src/${ARCH}elfobjs"
+
+run_test_pgm="$SLSHROOT/${ARCH}objs/slsh_exe -n -g"
+#run_test_pgm="$SLSHROOT/${ARCH}objs/slsh_exe -n -g $SLSHROOT/scripts/sldb"
+runprefix="$SLTEST_RUN_PREFIX"
+#runprefix="valgrind --tool=memcheck --leak-check=yes --error-limit=no --num-callers=25"
+#runprefix="gdb --args"
+
+
+########################################################################
+
+if  $# -eq 0 
+then
+    echo "Usage: $0 test1.sl test2.sl ..."
+    exit 64
+fi
+
+echo
+echo "Running module tests:"
+echo
+
+n_failed=0
+tests_failed=""
+for testxxx in $@
+do
+    $runprefix $run_test_pgm $testxxx
+
+    if  $? -ne 0 
+    then
+	n_failed=`expr $n_failed + 1`
+	tests_failed="$tests_failed $testxxx"
+    fi
+done
+
+echo
+if  $n_failed -eq 0 
+then
+    echo "All tests passed."
+else
+    echo "$n_failed tests failed: $tests_failed"
+fi
+echo
+
+exit $n_failed

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test.sl Added

@@ -0,0 +1,164 @@
+% These tests load the uninstalled version of slsh.rc.  The
+% installation script appends code for SLSH_PATH processing.  Since
+% the uninstalled version of slsh.rc lacks this code, it is added here.
+prepend_to_slang_load_path(getenv("SLSH_PATH"));
+
+define testing_module (m)
+{
+   () = fprintf (stdout, "Testing %s module...", m);
+   () = fflush (stdout);
+}
+
+private variable tests_failed = 0;
+
+define failed ()
+{
+   variable s = __pop_args (_NARGS);
+   s = sprintf (__push_args(s));
+   () = fprintf (stderr, "Failed: %s\n", s);
+   tests_failed++;
+   throw RunTimeError;
+}
+
+define end_test ()
+{
+   if (tests_failed)
+     exit (tests_failed);
+
+   () = fprintf(stdout, "OK\n");
+   () = fflush (stdout);
+}
+
+
+define expect_type (var, expected_type)
+{
+   if (typeof (var) != expected_type)
+     failed ("expected type %S, but was %S", expected_type, typeof (var));
+}
+
+define expect_value (var, expected_value)
+{
+   if (var != expected_value)
+     failed ("expected value `%S', but was `%S'", expected_value, var);
+}
+
+define expect_size (var, expected_size)
+{
+   if (typeof (var) == Assoc_Type)
+     var = assoc_get_keys (var);
+   if (typeof (var) == Struct_Type)
+     var = get_struct_field_names (var);
+   variable len = length (var);
+   if (len != expected_size)
+     failed ("expected size %d, but was %d", expected_size, len);
+}
+
+define expect_assoc_key (assoc, key)
+{
+   expect_type (assoc, Assoc_Type);
+   ifnot (assoc_key_exists (assoc, key))
+     failed (`expected assoc key "$key"`$);
+}
+
+define expect_assoc_key_value (assoc, key, expected_value)
+{
+   expect_type (assoc, Assoc_Type);
+   ifnot (assoc_key_exists (assoc, key))
+     failed (`expected assoc key "$key"`$);
+   else
+     expect_value (assockey, expected_value);
+}
+
+define expect_struct_key (s, key)
+{
+   ifnot (is_struct_type (s))
+     failed ("expected struct, but was %S", typeof (s));
+   ifnot (any (get_struct_field_names(s) == key))
+     failed (`expected struct key "$key"`$);
+}
+
+define expect_struct_field_names (s, expected_field_names)
+{
+   ifnot (is_struct_type (s))
+     failed ("expected struct, but was %S", typeof (s));
+   variable struct_field_names = get_struct_field_names (s);
+   if (any (struct_field_names != expected_field_names))
+     failed ("expected struct field names %s, but got %s",
+	     strjoin (expected_field_names, ", "),
+	     strjoin (struct_field_names, ", "));
+}
+
+define expect_struct_key_value (s, key, expected_value)
+{
+   ifnot (any (get_struct_field_names(s) == key))
+     failed (`expected struct key "$key"`$);
+   else
+     expect_value (get_struct_field (s, key), expected_value);
+}
+
+private define descr (error)
+{
+   try
+     throw error;
+   catch error:
+     return __get_exception_info().descr;
+}
+
+define expect_error();
+define expect_error(%expected_error, expected_message, function, args...
+		                                                          )
+{
+   variable args = __pop_list (_NARGS-3);
+   variable function = ();
+   variable expected_message = ();
+   variable expected_error = ();
+
+   if (typeof (function) == Array_Type)
+     return array_map (&expect_error, expected_error, expected_message, function, __push_list (args));
+
+   variable expected_error_descr = sprintf ("`%s'", descr (expected_error));
+
+   variable e;
+   try (e)
+     {
+	@function(__push_list (args));
+	failed ("expected %S to throw %s, but did not occur", function, expected_error_descr);
+     }
+   catch expected_error:
+     ifnot (string_match (e.message, expected_message))
+       failed (`expected %S to throw %s with message matching "%s", but got "%s"`, function, expected_error_descr, expected_message, e.message);
+   catch AnyError:
+     failed (`expected %S to throw %s, but got %s "%s"`, function, expected_error_descr, e.descr, e.message);
+}
+
+private variable Random_Number = _time ();
+$1 = getenv ("SLSYSWRAP_RANDSEED");
+if ($1 != NULL) Random_Number = typecast (atol($1), ULong_Type);
+
+define urand_1 (x)
+{
+   Random_Number = typecast (Random_Number * 69069UL + 1013904243UL, UInt32_Type);
+   return Random_Number/4294967296.0;
+}
+define urand (n)
+{
+   if (n == 0)
+     return Double_Type0;
+
+   return array_map (Double_Type, &urand_1, 1:n);
+}
+
+$1 = path_concat (path_dirname(__FILE__), "../objs");
+set_import_module_path ($1);
+if ($1 != get_import_module_path ())
+{
+   () = fprintf (stderr, "\n\n***WARNING: get_import_module_path ==> %S, expected %S\n\n",
+		 get_import_module_path(), $1);
+}
+
+
+try
+{
+   import ("fofofof", "foobar");
+}
+catch ImportError;

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_base64.sl Added

@@ -0,0 +1,158 @@
+() = evalfile ("./test.sl");
+require ("base64");
+
+private define decode_callback (strp, buf)
+{
+ @strp = @strp + buf;
+}
+
+private define b64encode_string (str, chunk)
+{
+ variable b = ""B;
+
+ variable b64 = _base64_encoder_new (&decode_callback, &b);
+ variable len = strbytelen (str);
+ variable i = 0;
+
+ if (chunk) while (i + chunk < len)
+ {
+	_base64_encoder_accumulate (b64, stri:i+chunk-1);
+	i += chunk;
+ }
+ _base64_encoder_accumulate (b64, stri:);
+ _base64_encoder_close (b64);
+
+ return b;
+}
+
+private define b64decode_string (str, chunk, do_close)
+{
+ variable b = ""B;
+
+ variable b64 = _base64_decoder_new (&decode_callback, &b);
+ variable len = strbytelen (str);
+ variable i = 0;
+ if (chunk) while (i + chunk < len)
+ {
+	_base64_decoder_accumulate (b64, stri:i+chunk-1);
+	i += chunk;
+ }
+ _base64_decoder_accumulate (b64, stri:);
+ if (do_close) _base64_decoder_close (b64);
+
+ return b;
+}
+
+private variable Encode_Decode_Map =
+{
+ "1", "MQ==",
+ "12","MTI=",
+ "123", "MTIz",
+ "1234", "MTIzNA==",
+
+ "Four score and seven years ago",
+ "Rm91ciBzY29yZSBhbmQgc2V2ZW4geWVhcnMgYWdv",
+
+ "Four score and seven years ago our fathers brought forth on this continent a new nation, conceived in liberty, and dedicated to the proposition that all men are created equal.",
+ "Rm91ciBzY29yZSBhbmQgc2V2ZW4geWVhcnMgYWdvIG91ciBmYXRoZXJzIGJyb3VnaHQgZm9ydGggb24gdGhpcyBjb250aW5lbnQgYSBuZXcgbmF0aW9uLCBjb25jZWl2ZWQgaW4gbGliZXJ0eSwgYW5kIGRlZGljYXRlZCB0byB0aGUgcHJvcG9zaXRpb24gdGhhdCBhbGwgbWVuIGFyZSBjcmVhdGVkIGVxdWFsLg==",
+};
+
+private variable Random_Words = "\
+weaselsnout phocomelus taiga recomposer grammarian bipeltate vicinage\r\n\
+stoichiometry tufaceous resubstitute unparaphrased gey crystalloid\r\n\
+Bretonian Caesareanize schlemiel floriform proximo uterus cloisonless\r\n\
+proboscideous coacervate enthronize bitterhearted sorcerer cineraceous\r\n\
+historically civilizatory nondispersal guipure hemiparaplegia uninodal\r\n\
+symphilous overcuriously nieve scunder laparocolotomy subproblem\r\n\
+encarpium macrochemistry unadornable encollar Cimmerian\r\n\
+septendecennial delictum housecoat nudicaul nonbursting oysterroot\r\n\
+stunningly Synentognathi prediscontented onofrite acapnial\r\n\
+superspinous fibrinoplastin serrated Sabbatean lovely Hunkerism witful\r\n\
+inflict yerk proreformist wheyness rouvillite swishy twigger\r\n\
+onychonosus coterell nonabstract gonorrhea morglay turriform\r\n\
+reforfeiture grailer kick profaneness pyrophorus reeshle\r\n\
+coelomesoblast fordone posteroinferior haploscopic thig Catalaunian\r\n\
+arkosic holometer ineptitude silverwork diphenylquinomethane bod\r\n\
+untaintedly epifolliculitis basifugal geldant gymnocarpic gateado\r\n\
+scumbling jetware\r\n\
+";
+
+private variable Encoded_Random_Words = "\
+d2Vhc2Vsc25vdXQgcGhvY29tZWx1cyB0YWlnYSByZWNvbXBvc2VyIGdyYW1t\
+YXJpYW4gYmlwZWx0YXRlIHZpY2luYWdlDQpzdG9pY2hpb21ldHJ5IHR1ZmFj\
+ZW91cyByZXN1YnN0aXR1dGUgdW5wYXJhcGhyYXNlZCBnZXkgY3J5c3RhbGxv\
+aWQNCkJyZXRvbmlhbiBDYWVzYXJlYW5pemUgc2NobGVtaWVsIGZsb3JpZm9y\
+bSBwcm94aW1vIHV0ZXJ1cyBjbG9pc29ubGVzcw0KcHJvYm9zY2lkZW91cyBj\
+b2FjZXJ2YXRlIGVudGhyb25pemUgYml0dGVyaGVhcnRlZCBzb3JjZXJlciBj\
+aW5lcmFjZW91cw0KaGlzdG9yaWNhbGx5IGNpdmlsaXphdG9yeSBub25kaXNw\
+ZXJzYWwgZ3VpcHVyZSBoZW1pcGFyYXBsZWdpYSB1bmlub2RhbA0Kc3ltcGhp\
+bG91cyBvdmVyY3VyaW91c2x5IG5pZXZlIHNjdW5kZXIgbGFwYXJvY29sb3Rv\
+bXkgc3VicHJvYmxlbQ0KZW5jYXJwaXVtIG1hY3JvY2hlbWlzdHJ5IHVuYWRv\
+cm5hYmxlIGVuY29sbGFyIENpbW1lcmlhbg0Kc2VwdGVuZGVjZW5uaWFsIGRl\
+bGljdHVtIGhvdXNlY29hdCBudWRpY2F1bCBub25idXJzdGluZyBveXN0ZXJy\
+b290DQpzdHVubmluZ2x5IFN5bmVudG9nbmF0aGkgcHJlZGlzY29udGVudGVk\
+IG9ub2ZyaXRlIGFjYXBuaWFsDQpzdXBlcnNwaW5vdXMgZmlicmlub3BsYXN0\
+aW4gc2VycmF0ZWQgU2FiYmF0ZWFuIGxvdmVseSBIdW5rZXJpc20gd2l0ZnVs\
+DQppbmZsaWN0IHllcmsgcHJvcmVmb3JtaXN0IHdoZXluZXNzIHJvdXZpbGxp\
+dGUgc3dpc2h5IHR3aWdnZXINCm9ueWNob25vc3VzIGNvdGVyZWxsIG5vbmFi\
+c3RyYWN0IGdvbm9ycmhlYSBtb3JnbGF5IHR1cnJpZm9ybQ0KcmVmb3JmZWl0\
+dXJlIGdyYWlsZXIga2ljayBwcm9mYW5lbmVzcyBweXJvcGhvcnVzIHJlZXNo\
+bGUNCmNvZWxvbWVzb2JsYXN0IGZvcmRvbmUgcG9zdGVyb2luZmVyaW9yIGhh\
+cGxvc2NvcGljIHRoaWcgQ2F0YWxhdW5pYW4NCmFya29zaWMgaG9sb21ldGVy\
+IGluZXB0aXR1ZGUgc2lsdmVyd29yayBkaXBoZW55bHF1aW5vbWV0aGFuZSBi\
+b2QNCnVudGFpbnRlZGx5IGVwaWZvbGxpY3VsaXRpcyBiYXNpZnVnYWwgZ2Vs\
+ZGFudCBneW1ub2NhcnBpYyBnYXRlYWRvDQpzY3VtYmxpbmcgamV0d2FyZQ0K";
+
+list_append (Encode_Decode_Map, Random_Words);
+list_append (Encode_Decode_Map, Encoded_Random_Words);
+
+define slsh_main ()
+{
+ testing_module ("base64");
+
+ variable i, n = length (Encode_Decode_Map)/2;
+ variable chunk, in, out, testout;
+ variable chunks = 0, 1, 2, 3, 4, 5, 23, 47, 71, 103;
+ foreach chunk (chunks)
+ {
+	_for i (0, n-1, 1)
+	 {
+	 in = Encode_Decode_Map2*i;
+	 out = Encode_Decode_Map2*i+1;
+	 testout = b64encode_string (in, chunk);
+
+	 if (out != testout)
+	 failed ("to encode %s, got %s instead of %s", in, testout, out);
+	 }
+ }
+
+ foreach chunk (chunks)
+ {
+	_for i (0, n-1, 1)
+	 {
+	 out = Encode_Decode_Map2*i;
+	 in = Encode_Decode_Map2*i+1;
+	 testout = b64decode_string (in, chunk, 1);
+
+	 if (out == testout)
+	 {
+		 % test again, without the pad chars
+		 in = strtrans (in, "=", "");
+		 testout = b64decode_string (in, chunk, 1);
+		 if (out == testout)
+		 continue;
+	 }
+	 failed ("to decode %s, chunk=%d", in, chunk);
+	 }
+ }
+
+ % don't close -- test for leaks
+ _for i (0, n-1, 1)
+ {
+	out = Encode_Decode_Map2*i;
+	in = Encode_Decode_Map2*i+1;
+	testout = b64decode_string (in, 7, 0);
+ }
+
+ end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_chksum.sl Added

@@ -0,0 +1,109 @@
+() = evalfile ("./test.sl");
+require ("chksum");
+
+private variable Chksum_Map = Assoc_Type;
+
+private define add_entry (str, md5, sha1)
+{
+   Chksum_Mapstr = struct
+     {
+	md5 = md5,
+	sha1 = sha1,
+     };
+}
+
+add_entry ("",
+	   "d41d8cd98f00b204e9800998ecf8427e",
+	   "da39a3ee5e6b4b0d3255bfef95601890afd80709"
+	  );
+
+add_entry ("1",
+	   "c4ca4238a0b923820dcc509a6f75849b",
+	   "356a192b7913b04c54574d18c28d46e6395428ab"
+	  );
+
+add_entry ("Four score and seven years ago",
+	   "8bc88284b17081c54df4daa4576251f7",
+	   "0e6089220e01abfc69188c555f1a37201d2fa37f"
+	  );
+
+add_entry ("Four score and seven years ago our fathers brought forth on this continent a new nation, conceived in liberty, and dedicated to the proposition that all men are created equal.",
+	   "73168f4191456bc526791a83c064997b",
+	   "3eabb94199e5347c55ae914ef75803ff0970d9e4"
+	  );
+
+private define test_accumulate (name, str, chksum)
+{
+   str = typecast (str, BString_Type); %  test bstrings too
+   variable n = bstrlen (str);
+   _for (1, n, 1)
+     {
+	variable i0 = ();
+	variable s0 = str0:i0-1;
+	variable s1 = stri0:;
+	variable m = bstrlen (s1);
+	_for (1, m, 1)
+	  {
+	     variable i1 = ();
+	     variable s10 = s10:i1-1;
+	     variable s11 = s1i1:;
+	     variable c = chksum_new (name);
+	     c.accumulate (s0);
+	     c.accumulate (s10);
+	     c.accumulate (s11);
+	     if (chksum != c.close ())
+	       failed ("Failed to compute %s for the partition '%s', '%s', '%s'", name, s0, s10, s11);
+	  }
+     }
+}
+
+private define test_chksum_file (func, data)
+{
+   variable tmpfile = sprintf ("/tmp/test_chksum_%d_%d", getpid(), _time());
+   variable fp = fopen (tmpfile, "wb");
+   if (fp == NULL)
+     return;
+   () = fwrite (data, fp);
+   () = fclose (fp);
+   variable s = (@func)(tmpfile);
+   () = remove (tmpfile);
+   return s;
+}
+
+private define test_module (module_name)
+{
+   testing_module (module_name);
+
+   foreach (assoc_get_keys (Chksum_Map))
+     {
+	variable key = ();
+	variable s = Chksum_Mapkey;
+
+	variable md5 = md5sum (key);
+	if (md5 != s.md5)
+	  failed ("MD5 failure for %s, got %s instead of %s", key, md5, s.md5);
+
+	test_accumulate ("md5", key, md5);
+
+	md5 = test_chksum_file (&md5sum_file, key);
+	if (md5 != s.md5)
+	  failed ("md5sum_file failed: got %s, expected %s", md5, s.md5);
+
+	variable sha1 = sha1sum (key);
+	if (sha1 != s.sha1)
+	  failed ("SHA1 failure for %s, got %s instead of %s", key, sha1, s.sha1);
+
+	test_accumulate ("sha1", key, sha1);
+
+	sha1 = test_chksum_file (&sha1sum_file, key);
+	if (sha1 != s.sha1)
+	  failed ("sha1sum_file failed: got %s, expected %s", sha1, s.sha1);
+     }
+}
+
+define slsh_main ()
+{
+   test_module ("chksum");
+   end_test ();
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_csv.sl Added

@@ -0,0 +1,83 @@
+() = evalfile ("./test.sl");
+require ("csv");
+
+private variable Table = struct {author = {}, title = {}, sample = {}};
+
+private define add_entry (author, title, sample)
+{
+   list_append (Table.author, author);
+   list_append (Table.title, title);
+   list_append (Table.sample, sample);
+}
+
+add_entry ("Poe, Edgar Allan", "The Raven", "\
+Once upon a midnight dreary, while I pondered weak and weary,\n\
+Over many a quaint and curious volume of forgotten lore,\n\
+While I nodded, nearly napping, suddenly there came a tapping,\n\
+As of some one gently rapping, rapping at my chamber door.\n\
+\"Tis some visitor,\" I muttered, tapping at my chamber door -\n\
+Only this, and nothing more.");
+
+add_entry ("Frost, Robert", "Mending Wall", "\
+He moves in darkness as it seems to me,\n\
+Not of woods only and the shade of trees.\n\
+He will not go behind his father's saying,\n\
+And he likes having thought of it so well\n\
+He says again, \"Good fences make good neighbors.\"");
+
+private define test_csv (file)
+{
+   variable names = get_struct_field_names (Table);
+
+   variable table = csv_readcol (file;has_header);
+
+   if (any(names != get_struct_field_names (table)))
+     {
+	failed ("csv_read/write failed to produce a table with the expected column names");
+	return;
+     }
+
+   foreach (names)
+     {
+	variable name = ();
+	ifnot (_eqs(get_struct_field (table, name), get_struct_field (table, name)))
+	  {
+	     failed ("column %S entries are not equal", name);
+	     return;
+	  }
+     }
+
+   if (typeof(file) == File_Type)
+     {
+	clearerr (file);
+	() = fseek (file, 0, SEEK_SET);
+     }
+
+   table = csv_readcol (file, 1, 3; has_header);
+   if (any(names1,3-1 != get_struct_field_names (table)))
+     {
+	failed ("csv_read/write failed to produce a table with the expected column names");
+	return;
+     }
+   foreach (get_struct_field_names (table))
+     {
+	name = ();
+	ifnot (_eqs(get_struct_field (table, name), get_struct_field (table, name)))
+	  {
+	     failed ("column %S entries are not equal", name);
+	     return;
+	  }
+     }
+}
+
+define slsh_main ()
+{
+   testing_module ("csv");
+
+   variable file = sprintf ("/tmp/testcsv-%ld.csv", _time() mod getpid());
+   csv_writecol (file, Table);
+   test_csv (file);
+   test_csv (fopen (file, "r"));
+   () = remove (file);
+   end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_fcntl.sl Added

@@ -0,0 +1,39 @@
+% -*- mode: slang; mode: fold -*-
+
+() = evalfile ("./test.sl");
+
+require ("fcntl");
+
+private define test_fcntl (fd)
+{
+   variable flags = fcntl_getfd (fd);
+   if (flags == -1)
+     failed ("fcntl_getfd failed: %S", errno_string());
+
+   if (-1 == fcntl_setfd (fd, flags | FD_CLOEXEC))
+     failed ("fcntl_setfd failed: %S", errno_string());
+
+   flags = fcntl_getfd (fd);
+   if (flags == -1)
+     failed ("fcntl_getfd failed: %S", errno_string());
+
+   ifnot (flags & FD_CLOEXEC)
+     failed ("FD_CLOEXEC not set");
+
+   if (-1 == fcntl_setfd (fd, flags & ~FD_CLOEXEC))
+     failed ("fcntl_setfd failed: %S", errno_string());
+
+   flags = fcntl_getfl (fd);
+   if (flags == -1)
+     failed ("fcntl_getfl failed: %S", errno_string());
+   if (-1 == fcntl_setfl (fd, flags))
+     failed ("fcntl_setfl failed: %S", errno_string());
+}
+
+define slsh_main ()
+{
+   testing_module ("fcntl");
+   test_fcntl (fileno(stderr));
+   test_fcntl (_fileno(stderr));
+   end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_fork.sl Added

@@ -0,0 +1,64 @@
+% -*- mode: slang; mode: fold -*-
+
+() = evalfile ("./test.sl");
+
+require ("fork");
+
+private define test_fork ()
+{
+   variable _ppid = getpid ();
+   variable pid = fork ();
+
+   if (pid == 0)
+     {
+	% child
+	if (_ppid == getpid ())
+	  {
+	     () = fprintf (stderr, "fork did not change pid\n");
+	     _exit (1);
+	  }
+
+#ifexists getppid
+	if (_ppid != getppid ())
+	  {
+	     () = fprintf (stderr, "getppid failed in child\n");
+	     _exit (1);
+	  }
+#endif
+	_exit(123);
+     }
+
+   variable w = waitpid (pid, 0);
+   if (w.exited)
+     {
+	if (w.exit_status != 123)
+	  failed ("child exited with unexpected status of %d", w.exit_status);
+     }
+}
+
+private define test_pipe ()
+{
+   variable fdr, fdw, buf, n;
+   (fdr, fdw) = pipe ();
+
+   while (-1 == write (fdw, "hello"))
+     {
+	if (errno == EINTR)
+	  continue;
+	failed ("write to pipe failed: %S", errno_string);
+     }
+   n = read (fdr, &buf, 10);
+   if ((buf != "hello") || (n != 5))
+     {
+	failed ("pipe failed");
+     }
+}
+
+define slsh_main ()
+{
+   testing_module ("fork");
+   test_fork ();
+   test_pipe ();
+   %test_exec ();
+   end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_hist.sl Added

@@ -0,0 +1,372 @@
+() = evalfile ("./test.sl");
+require ("histogram");
+
+private define test_alternate_forms (pts, edges, rev_indices, expected_h)
+{
+ variable h = hist1d (pts, edges);
+ ifnot (_eqs (h, expected_h))
+ failed ("alternate form hist1d(pts, edges)");
+
+ h = hist1d (pts, edges, NULL);
+ ifnot (_eqs (h, expected_h))
+ failed ("alternate form hist1d(pts, edges, NULL)");
+
+ h = hist1d (pts, edges, NULL);
+ ifnot (_eqs (h, expected_h))
+ failed ("alternate form hist1d(pts, edges, NULL)");
+
+ h = hist1d (NULL, pts, edges, NULL);
+ ifnot (_eqs (h, expected_h))
+ failed ("alternate form hist1d(pts, edges, NULL)");
+
+ variable h1 = h;
+ h1* = 1;
+ h = hist1d (h1, pts, edges, NULL);
+ ifnot (__is_same (h, h1))
+ failed ("alternate form hist1d h1 not same as h");
+}
+
+define test_hist1d (n, m)
+{
+ variable pts = urand (n); pts = ptsarray_sort(pts);
+ variable edges = 1:m/(1.1*m);
+ variable max_edges;
+ variable rev_indices;
+
+ variable h = hist1d (pts, edges, &rev_indices);
+
+ if (length (edges) == 0)
+ {
+	if (length (h) != 0)
+	 failed ("hist1d(%S,%S): hist1d returned wrong size histogram");
+
+	if (length (rev_indices) != 0)
+	 failed ("hist1d(%S,%S): hist1d returned wrong size rev-ind array");
+
+	return;
+ }
+
+ max_edges = max(edges);
+ variable len = length (where (pts >= max_edges));
+ if (len != h-1)
+ failed ("hist1d(%S,%S); last bin: expect %d, found %d",
+	 n, m, len, h-1);
+
+ len = length (where (pts < edges0));
+ if (len + sum (h) != length (pts))
+ failed ("hist1d: total number expect is wrong");
+
+ _for (0, m-1, 1)
+ {
+	variable i = ();
+	variable j = rev_indicesi;
+
+	!if (length (j))
+	 continue;
+
+	if (length (where ((j < 0) or (j >= n))))
+	 failed ("hist1d: reverse index out of range");
+
+	variable p = ptsj;
+
+	if (length (where (p < edgesi)))
+	 failed ("hist1d: reverse index problem 2");
+
+	if (i != m-1)
+	 {
+	 if (length (where (p >= edgesi+1)))
+	 failed ("hist1d: reverse index problem 2");
+	 }
+ }
+
+ test_alternate_forms (pts, edges, rev_indices, h);
+}
+
+define test_hist1d_uc (n, edges)
+{
+ foreach (UChar_Type, Short_Type, Int_Type, Float_Type, Long_Type)
+ {
+	variable type = ();
+	variable pts = typecast (256 * urand (n), type);
+	variable rev_indices;
+
+	variable h1 = hist1d (pts, edges, &rev_indices);
+	variable h2 = hist1d (pts, edges);
+
+	if (length (where (h1 != h2)))
+	 failed ("hist1d on %S", type);
+ }
+}
+
+define do_test_hist1d (n, m)
+{
+ test_hist1d (n, m);
+ test_hist1d_uc (n, -3:0);
+ test_hist1d_uc (n*10, -3,0.01);
+ test_hist1d_uc (n*10, -3:10);
+ test_hist1d_uc (n*10, -3:10:0.1);
+ test_hist1d_uc (n*10, 0:254);
+ test_hist1d_uc (n*10, 0:254:0.1);
+ test_hist1d_uc (n*10, 0:255);
+ test_hist1d_uc (n*10, 0:256);
+ test_hist1d_uc (n*10, -1,256);
+ test_hist1d_uc (n*10, 255,256);
+ test_hist1d_uc (n*10, 255:256:0.1);
+ test_hist1d_uc (n*10, 255.1:270);
+ test_hist1d_uc (n*10, 256:270);
+ test_hist1d_uc (n*10, 254.9,255.0);
+ test_hist1d_uc (n*10, 254.9,255.01);
+}
+
+private define test_alternate_forms2d (xpts, ypts, xedges, yedges, rev_indices, expected_h)
+{
+ variable h = hist2d (xpts, ypts, xedges, yedges);
+ ifnot (_eqs (h, expected_h))
+ failed ("alternate form hist2d(xpts, ypts, xedges, yedges)");
+
+ h = hist2d (xpts, ypts, xedges, yedges, NULL);
+ ifnot (_eqs (h, expected_h))
+ failed ("alternate form hist2d(xpts, ypts, xedges, yedges, NULL)");
+
+ h = hist2d (NULL, xpts, ypts, xedges, yedges, NULL);
+ ifnot (_eqs (h, expected_h))
+ failed ("alternate form hist2d(NULL, xpts, ypts, xedges, yedges, NULL)");
+
+ h = hist2d (NULL, xpts, ypts, xedges, yedges);
+ ifnot (_eqs (h, expected_h))
+ failed ("alternate form hist2d(NULL, xpts, ypts, xedges, yedges)");
+
+ variable h1 = h;
+ h = hist2d (h1, xpts, ypts, xedges, yedges);
+ ifnot (__is_same (h, h1))
+ failed ("alternate form hist2d h1 not same as h");
+}
+
+define test_hist2d (num, nr, nc, type) %{{{
+{
+ variable r = typecast (256*urand(num), type);
+ variable c = typecast (256*urand(num), type);
+
+ variable gr, gc;
+ gr = 256*(1:nr/(1.1*nr));
+ gc = 256*(1:nc/(1.1*nc));
+
+ variable rev, img;
+ img = hist2d (r, c, gr, gc, &rev);
+
+ % all data points got binned
+ variable i = where ((r >= gr0) and (c >= gc0));
+ if (sum(img) != length(i))
+ failed ("histogram sum");
+
+ % the reverse indices include every point
+ _for (0, nr-1, 1)
+ {
+	variable ir = ();
+	variable rlo, rhi;
+	rlo = grir;
+	if (ir == nr-1)
+	 rhi = _Inf;
+	else
+	 rhi = grir+1;
+
+	_for (0, nc-1, 1)
+	 {
+	 variable ic = ();
+	 variable clo, chi;
+
+	 i = revir, ic;
+	 if (0 == length (i))
+	 continue;
+
+	 clo = gcic;
+	 if (ic == nc-1)
+	 chi = _Inf;
+	 else
+	 chi = gcic+1;
+
+	 if (length (where ((rlo > ri) or (ri >= rhi)
+				or (clo > ci) or (ci >= chi))))
+	 failed ("hist2d: Reverse index problem");
+	 }
+ }
+
+ test_alternate_forms2d (r, c, gr, gc, rev, img);
+}
+
+do_test_hist1d (20, 5);
+do_test_hist1d (20, 4);
+do_test_hist1d (20, 3);
+do_test_hist1d (20, 2);
+do_test_hist1d (20, 1);
+
+do_test_hist1d (20, 500);
+do_test_hist1d (20, 400);
+do_test_hist1d (20, 300);
+do_test_hist1d (20, 200);
+do_test_hist1d (20, 100);
+
+% Now test oddball cases
+
+do_test_hist1d (0, 5);
+do_test_hist1d (1, 5);
+do_test_hist1d (0, 1);
+do_test_hist1d (0, 0);
+
+foreach $1 (UChar_Type, Short_Type, Int_Type, Float_Type, Long_Type)
+{
+ test_hist2d (20, 1, 1, $1);
+ test_hist2d (200, 1, 3, $1);
+ test_hist2d (20, 10, 20, $1);
+ test_hist2d (20, 10, 30, $1);
+ test_hist2d (20000, 10, 30, $1);
+}
+
+private variable Test_Number = 0;
+private define test_rebin (new_grid, old_grid, input_h, sum_ok, expected)
+{
+ variable new_h = hist1d_rebin (new_grid, old_grid, input_h);
+
+ Test_Number++;
+
+ if (sum_ok)
+ {
+	if (sum (new_h) != sum (input_h))
+	 failed ("hist1d_rebin%d: sum: %S != %S",
+		 Test_Number, sum(new_h), sum(input_h));
+ }
+ if (expected != NULL)
+ {
+	variable i = where (expected != new_h);
+	if (length (i))
+	 {
+	 i = i0;
+	 failed ("hist1d_rebin%d: expected %S in bin %d, found %S (diff=%S)",
+		 Test_Number, expectedi, i, new_hi, expectedi - new_hi);
+	 }
+ }
+}
+
+private define test_bsearch ()
+{
+ variable xbins = 1:10:0.5;
+ variable nbins = length (xbins);
+ variable data = (11*urand (100)) - 1;
+
+ variable i, indices = hist_bsearch (data, xbins);
+ _for i (0, length (data)-1, 1)
+ {
+	variable x = datai;
+	variable j = indicesi;
+	if (x < xbinsj)
+	 {
+	 if (j != 0)
+	 failed ("hist_bsearch: x=%S < bin edge %S", x, xbinsj);
+	 }
+
+	if (j + 1 < nbins)
+	 {
+	 if (x >= xbinsj+1)
+	 failed ("hist_bsearch: x=%S >= right bin edge %S", x, xbinsj+1);
+	 }
+
+	if (j != hist_bsearch (x, xbins))
+	 failed ("hist_bsearch on scalar");
+ }
+}
+
+private define test_module (module_name)
+{
+ testing_module (module_name);
+
+ variable g0 = 0,1,2,3,4,5,6;
+ variable h0 = 1,2,3,4,5,6,7;
+
+%test_rebin (0,1, 0, 1, 1, 0.5, 0.5);
+
+ test_rebin (0,2,4,6, g0, h0, 1, 3,7,11,7);
+ test_rebin (0,2,4, g0, h0, 1, 3,7,18);
+ test_rebin (0, g0, h0, 1, 28);
+ test_rebin (-1, g0, h0, 1, 28);
+ test_rebin (-1,0, g0, h0, 1, 0,28);
+ test_rebin (-1,0,6,7,8, g0, h0, 1, 0,21,0,0,7);
+ test_rebin (-1,0,0.5,7,8, g0, h0, 1, 0,0.5, 20.5,0,7);
+ test_rebin (1.5,2.5, g0, h0, 0, 2.5,23.5);
+ test_rebin (8, g0, h0, 0, 7);
+ test_rebin (-1,9, g0, h0, 1, 21, 7);
+ test_rebin (1,10, -4, 12, 1, 0, 12);
+ test_rebin (Double_Type0, g0, h0, 0, Double_Type0);
+ test_rebin (1:10, 1,5,10, 1,2,3, 1,
+	 0.25,0.25,0.25,0.25,0.4,0.4,0.4,0.4,0.4,3);
+
+ test_bsearch ();
+}
+
+private define test_badgrids ()
+{
+ variable xgrid, ygrid;
+ variable pts = urand (100);
+
+ xgrid = Double_Type0;
+ if (length (hist1d (pts, xgrid)))
+ failed ("hist1d with empty grid");
+ foreach xgrid ({_NaN, 0,_NaN, _NaN,0, 2,1, 1,2,-1})
+ {
+	try
+	 {
+	 () = hist1d (pts, xgrid);
+	 failed ("Expecting hist1d to fail with invalid grid");
+	 }
+	catch InvalidParmError: continue;
+ }
+
+ reshape (pts, length(pts)/2, 2);
+ try
+ {
+	() = hist1d (pts, xgrid);
+	failed ("Expecting hist1d to fail with invalid grid");
+ }
+ catch InvalidParmError:;
+
+ reshape (pts, length(pts));
+ variable ypts = urand (100);
+ xgrid = 0,0.5;
+
+ foreach ygrid ({_NaN, 0,_NaN, _NaN,0, 2,1, 1,2,-1})
+ {
+	try
+	 {
+	 () = hist2d (pts, ypts, xgrid, ygrid);
+	 failed ("Expecting hist2d to fail with invalid y grid");
+	 }
+	catch InvalidParmError:;
+ }
+
+ ygrid = xgrid;
+ foreach xgrid ({_NaN, 0,_NaN, _NaN,0, 2,1, 1,2,-1})
+ {
+	try
+	 {
+	 () = hist2d (pts, ypts, xgrid, ygrid);
+	 failed ("Expecting hist2d to fail with invalid x grid");
+	 }
+	catch InvalidParmError: continue;
+ }
+
+ xgrid = 0, 0.5;
+ ygrid = 0, 0.5;
+ ypts = urand (length(pts)-1);
+ try
+ {
+	() = hist2d (pts, ypts, xgrid, ygrid);
+	failed ("Expecting hist2d to fail with mismatched x and y data arrays");
+ }
+ catch InvalidParmError:;
+}
+
+define slsh_main ()
+{
+ test_module ("hist");
+ test_badgrids ();
+ end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_iconv.sl Added

@@ -0,0 +1,40 @@
+% -*- mode: slang; mode: fold -*-
+
+() = evalfile ("./test.sl");
+
+require ("iconv");
+
+% FIXME: Add additional tests and charsets.
+private define test_iconv ()
+{
+   variable ustr = "áéíóúüþëé", ucs = "utf-8";
+   variable istr = "\xE1\xE9\xED\xF3\xFA\xFC\xFE\xEB\xE9", ics = "iso-8859-1";
+
+   variable s = iconv_open (ics, ucs);
+   variable str = iconv (s, ustr);
+   iconv_close (s);
+   if (str != istr)
+     failed ("conversion from %s->%s failed", ucs, ics);
+
+   % The iconv_reset functions are not necessary for simple tests.
+   % They are there just to exercise the interface
+   s = iconv_open (ucs, ics);
+   iconv_reset (s);
+   str = iconv (s, istr);
+   () = iconv_reset_shift (s);
+   iconv_close (s);
+
+   if (str != ustr)
+     failed ("conversion from %s->%s failed", ics, ucs);
+
+   () = iconv_open (ucs, ics);
+   %iconv_reset ();
+   %iconv_reset_shift ();
+}
+
+define slsh_main ()
+{
+   testing_module ("iconv");
+   test_iconv ();
+   end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_json.sl Added

@@ -0,0 +1,597 @@
+% -*- mode: slang; mode: fold -*-
+
+() = evalfile ("./test.sl");
+require ("json");
+
+private variable json;
+
+% test_decode %{{{
+
+private define expect_json_object_with_key (key, expected_value, expected_type)
+{
+   expect_struct_key_value (json, key, expected_value);
+   variable v = get_struct_field (json, key);
+   expect_type (v, expected_type);
+}
+
+private define test_decode_empty_array () %{{{
+{
+   foreach json ({ "", "  \n\t  \n\t \t\n \t\n " })
+     {
+	json = json_decode (json);
+	expect_type (json, List_Type);
+	expect_size (json, 0);
+     }
+}
+%}}}
+
+private define test_decode_empty_object () %{{{
+{
+   foreach json ({ "{}", "  \n\t{  \n\t \t\n }\t\n " })
+     {
+	json = json_decode (json);
+	expect_type (json, Struct_Type);
+	expect_size (json, 0);
+     }
+}
+%}}}
+
+private define test_decode_simple_array () %{{{
+{
+   json = json_decode ("1, 2 ,\t\r\n 3");
+   expect_type (json, List_Type);
+   expect_value (json0, 1);
+   expect_value (json1, 2);
+   expect_value (json2, 3);
+}
+%}}}
+
+private define test_decode_simple_object () %{{{
+{
+   json = json_decode (`
+     {
+       "string" : "stringvalue",
+       "long"   : 2147483647,
+       "llong"  : 9223372036854775807,
+       "double" : 6.022e+22,
+       "true"   : true,
+       "false"  : false,
+       "null"   : null
+     }
+   `);
+
+   expect_struct_field_names (json,
+			      
+				"string",
+				"long",
+#ifeval is_defined("LLONG_MAX")
+				"llong",
+#endif
+				"double",
+				"true",
+				"false",
+				"null"
+			      );
+
+   expect_json_object_with_key ("string", "stringvalue", String_Type);
+   expect_json_object_with_key ("long", 2147483647, LLong_Type);
+#ifeval is_defined("LLONG_MAX")
+   expect_json_object_with_key ("llong", 9223372036854775807LL, LLong_Type);
+#endif
+   expect_json_object_with_key ("double", 6.022e+22, Double_Type);
+   expect_json_object_with_key ("true", 1, UChar_Type);
+   expect_json_object_with_key ("false", 0, UChar_Type);
+   expect_json_object_with_key ("null", NULL, Null_Type);
+}
+%}}}
+
+private define test_decode_heterogenous_array () %{{{
+{
+   json = json_decode (`
+     
+       "stringvalue",
+       42,
+       6.022e+22,
+       true,
+       false,
+       null,
+       1,2,3,
+       { "i":1, "v":5, "x":10, "L":50, "C":100, "D":500, "M":1000 }
+     
+   `);
+
+   expect_type (json, List_Type);
+   expect_size (json, 8);
+   expect_value (json0, "stringvalue");
+   expect_value (json1, 42);
+   expect_value (json2, 6.022e+22);
+   expect_value (json3, 1);
+   expect_value (json4, 0);
+   expect_value (json5, NULL);
+   expect_type (json6, List_Type); %{{{
+     expect_size (json6, 3);
+     expect_value (json60, 1);
+     expect_value (json61, 2);
+     expect_value (json62, 3);
+  %}}}
+   expect_type (json7, Struct_Type); %{{{
+     expect_size (json7, 7);
+  %}}}
+}
+%}}}
+
+private define test_decode_nested_object () %{{{
+{
+   json = json_decode (`
+     {
+       "k1" : {
+                "k11" : {
+                          "k111" : "v111",
+                          "k112" : "v112"
+                        },
+                "k12" : {
+                          "k121" : "v121",
+                          "k122" : "v122"
+                        }
+              },
+       "k2" : {
+                "k21" : {
+                          "k211" : "v211",
+                          "k212" : "v212"
+                        },
+                "k22" : {
+                          "k221" : "v221",
+                          "k222" : "v222"
+                        }
+              },
+       "k3" :  "v31", "v32" ,
+       "k4" :  41, 42 
+     }
+   `);
+
+   expect_type (json, Struct_Type);
+   expect_size (json, 4);
+   expect_struct_key (json, "k1"); %{{{
+     expect_type (json."k1", Struct_Type);
+     expect_struct_key (json."k1", "k11"); %{{{
+       expect_type (json."k1"."k11", Struct_Type);
+       expect_struct_key_value (json."k1"."k11", "k111", "v111");
+       expect_struct_key_value (json."k1"."k11", "k112", "v112");
+    %}}}
+     expect_struct_key (json."k1", "k12"); %{{{
+       expect_type (json."k1"."k12", Struct_Type);
+       expect_struct_key_value (json."k1"."k12", "k121", "v121");
+       expect_struct_key_value (json."k1"."k12", "k122", "v122");
+    %}}}
+  %}}}
+   expect_struct_key (json, "k2"); %{{{
+     expect_type (json."k2", Struct_Type);
+     expect_struct_key (json."k2", "k21"); %{{{
+       expect_type (json."k2"."k21", Struct_Type);
+       expect_struct_key_value (json."k2"."k21", "k211", "v211");
+       expect_struct_key_value (json."k2"."k21", "k212", "v212");
+    %}}}
+     expect_struct_key (json."k2", "k22"); %{{{
+       expect_type (json."k2"."k22", Struct_Type);
+       expect_struct_key_value (json."k2"."k22", "k221", "v221");
+       expect_struct_key_value (json."k2"."k22", "k222", "v222");
+    %}}}
+  %}}}
+   expect_struct_key (json, "k3"); %{{{
+     expect_type (json."k3", List_Type);
+     expect_size (json."k3", 2);
+       expect_value (json."k3"0, "v31");
+       expect_value (json."k3"1, "v32");
+  %}}}
+   expect_struct_key (json, "k4"); %{{{
+     expect_type (json."k4", List_Type);
+     expect_size (json."k4", 2);
+       expect_value (json."k4"0, 41);
+       expect_value (json."k4"1, 42);
+  %}}}
+}
+%}}}
+
+private variable maximally_nested_array = `
+
+"(depth = 100 below the toplevel array)"
+
+`;
+
+private define test_decode_maximally_nested_array () %{{{
+{
+   json = json_decode (maximally_nested_array);
+   loop (1+100)
+     {
+	expect_type (json, List_Type);
+	json = json0;
+     }
+   expect_type (json, String_Type);
+}
+%}}}
+
+private define test_decode_object_with_duplicate_key () %{{{
+{
+   json = json_decode (`{"a":null, "b":"B", "a":"A"}`);
+   expect_type (json, Struct_Type);
+   expect_struct_field_names (json, "a", "b");
+   expect_json_object_with_key ("a", "A", String_Type);
+   expect_json_object_with_key ("b", "B", String_Type);
+}
+%}}}
+
+% test_decode_escaped_strings %{{{
+
+% The test below puts the strings into an object:
+
+private define expect_string (key, expected_value)
+{
+   expect_json_object_with_key (key, expected_value, String_Type);
+}
+
+private define expect_bstring (key, expected_value)
+{
+   expect_json_object_with_key (key, expected_value, BString_Type);
+}
+
+private define test_decode_escaped_strings ()
+{
+   json = json_decode (`
+     {
+       "quotation mark"  : "\"",
+       "reverse solidus" : "\\",
+       "solidus"         : "\/",
+       "backspace"       : "\b",
+       "form feed"       : "\f",
+       "line feed"       : "\n",
+       "carriage return" : "\r",
+       "tab"             : "\t",
+       "Unicode example" : "\u0040",
+       "Kaizen"          : "\u6539\u5584",
+       "Schr\u00f6dinger": "\u0131\u0127 \u2202\u2044\u2202t = \u0124",
+       "Unicode range"   : "\u0001 - \uFFFF = \uffff",
+       "bstring with 0"  : "binary strings may even contain \u0000 characters"
+     }
+   `);
+
+   expect_type (json, Struct_Type);
+   expect_string ("quotation mark"  , `"`);
+   expect_string ("reverse solidus" , "\\");
+   expect_string ("solidus"         , "/");
+   expect_string ("backspace"       , "\b");
+   expect_string ("form feed"       , "\f");
+   expect_string ("line feed"       , "\n");
+   expect_string ("carriage return" , "\r");
+   expect_string ("tab"             , "\t");
+   expect_string ("Unicode example" , "@");
+   expect_string ("Kaizen"          , "改善");  % == "\u{6539}\u{5584}"
+   expect_string ("Schrödinger"     , "ıħ ∂⁄∂t = Ĥ");  % == "\u{0131}\u{0127} \u{2202}\u{2044}\u{2202}t = \u{0124}"
+   expect_string ("Unicode range"   , "\x01 - \u{FFFF} = \u{FFFF}");
+   expect_bstring ("bstring with 0" , "binary strings may even contain \x00 characters"B);
+}
+%}}}
+
+% test_decode_errors %{{{
+
+private variable describe_char_regex = "'.' = 0x0-9A-F0-9A-F";
+
+private define expect_Json_Parse_Error_while_decoding_method (obj, json_text)
+{
+   expect_error (Json_Parse_Error, obj.expected_error_message, &json_decode, json_text);
+   return obj;  % for method chaining
+}
+
+private define expect_Json_Parse_Error (expected_error_message)
+{
+   return struct {  % syntactic sugar...
+      expected_error_message = expected_error_message,
+      while_decoding = &expect_Json_Parse_Error_while_decoding_method
+   };
+}
+
+private define test_parse_errors_due_to_structure () %{{{
+{
+   ()=expect_Json_Parse_Error ("empty input string")
+     .while_decoding ("");
+
+   ()=expect_Json_Parse_Error ("Unexpected character $describe_char_regex seen while parsing JSON data"$)
+     .while_decoding (` "top-level string" `)
+     .while_decoding (" 42 ")
+     .while_decoding (" 6.022e+22 ")
+     .while_decoding (" true ")
+     .while_decoding (" false ")
+     .while_decoding (" null ")
+     .while_decoding (" ö ");
+
+   ()=expect_Json_Parse_Error ("Unexpected character $describe_char_regex seen while parsing a JSON value"$)
+     .while_decoding (` { "this is not a value" : | } `)
+     .while_decoding ("  this_is_not_a_value_either  ");
+}
+%}}}
+
+private define test_parse_errors_with_strings () %{{{
+{
+   ()=expect_Json_Parse_Error ("Unexpected end of input seen while parsing a JSON string")
+     .while_decoding (` "missing quotation mark `);
+
+   ()=expect_Json_Parse_Error ("Control character 0x0A in JSON string must be escaped")
+     .while_decoding (` "literal newline \n is not allowed", "(must be \\n instead)" `Q);
+
+   ()=expect_Json_Parse_Error ("Illegal escaped character 'a' = 0x61 in JSON string")
+     .while_decoding (` "\a" `);
+
+   ()=expect_Json_Parse_Error (`Illegal Unicode escape sequence in JSON string: \\u`)
+     .while_decoding (` "\undef" `)
+     .while_decoding (` "\u123`);
+}
+%}}}
+
+private define test_parse_errors_with_arrays () %{{{
+{
+   ()=expect_Json_Parse_Error ("Expected ',' or '' while parsing a JSON array, found $describe_char_regex"$)
+     .while_decoding (" 1 2 ")
+     .while_decoding (" 1 : 2 ");
+
+   ()=expect_Json_Parse_Error ("Unexpected end of input seen while parsing a JSON array")
+     .while_decoding (" 1, 2 ");
+
+   ()=expect_Json_Parse_Error ("Expected end of input after parsing JSON array, found $describe_char_regex"$)
+     .while_decoding ("1 2");
+}
+%}}}
+
+private define test_parse_errors_with_objects () %{{{
+{
+   ()=expect_Json_Parse_Error ("Expected a string while parsing a JSON object, found $describe_char_regex"$)
+     .while_decoding (`{ 1 }`)
+     .while_decoding (`{ "one" : 1, , "two" : 2 }`);
+
+   ()=expect_Json_Parse_Error ("Expected a ':' while parsing a JSON object, found $describe_char_regex"$)
+     .while_decoding (`{ "one" = 1 }`);
+
+   ()=expect_Json_Parse_Error ("Expected ',' or '}' while parsing a JSON object, found $describe_char_regex"$)
+     .while_decoding (`{ "one" : 1 "two" : 2 }`)
+     .while_decoding (`{ "one" : 1 : "two" : 2 }`);
+
+   ()=expect_Json_Parse_Error ("Unexpected end of input seen while parsing a JSON object")
+     .while_decoding (`{ "one" : 1 `);
+
+   ()=expect_Json_Parse_Error ("Expected end of input after parsing JSON object, found $describe_char_regex"$)
+     .while_decoding (`{ "one" : 1 } 2`);
+}
+%}}}
+
+private define test_parse_errors_due_to_too_large_numbers () %{{{
+{
+   variable large_int = "18446744073709551616";  % cannot even be represented by (U)Int64_Type
+   ()=expect_Json_Parse_Error ("Integer value is too large ($large_int)"$)
+     .while_decoding (" $large_int "$);
+
+   variable large_num = "2e4932";  % cannot even be represented by binary128/quadruple-precision floating-point format
+   ()=expect_Json_Parse_Error ("Numeric value is too large ($large_num)"$)
+     .while_decoding (" $large_num "$);
+}
+%}}}
+
+private define test_parse_error_due_to_recursion_depth () %{{{
+{
+  ()=expect_Json_Parse_Error ("json text exceeds maximum nesting level")
+    .while_decoding (" $maximally_nested_array "$);
+}
+
+private define test_decode_errors ()
+{
+   test_parse_errors_due_to_structure ();
+   test_parse_errors_with_strings ();
+   test_parse_errors_with_arrays ();
+   test_parse_errors_with_objects ();
+   test_parse_errors_due_to_too_large_numbers ();
+   test_parse_error_due_to_recursion_depth ();
+}
+%}}}
+
+private define test_decode ()
+{
+   test_decode_empty_array ();
+   test_decode_empty_object ();
+   test_decode_simple_array ();
+   test_decode_simple_object ();
+   test_decode_heterogenous_array ();
+   test_decode_nested_object ();
+   test_decode_maximally_nested_array ();
+   test_decode_object_with_duplicate_key ();
+   test_decode_escaped_strings ();
+   test_decode_errors ();
+}
+%}}}
+
+%}}}
+
+% test_encode %{{{
+
+% explicit whitespace-qualifiers:
+variable no_whitespaces = struct { pre_nsep="", post_nsep="", pre_vsep="", post_vsep="" };
+variable some_whitespaces = struct { @no_whitespaces, post_nsep=" ", post_vsep="\n  " };
+
+private define test_encode_empty_array () %{{{
+{
+   expect_value (json_encode ({}), ``);
+   expect_value (json_encode (String_Type0), ``);
+   expect_value (json_encode (Integer_Type0), ``);
+}
+%}}}
+
+private define test_encode_empty_object () %{{{
+{
+   json = @Struct_Type (String_Type0);
+   expect_value (json_encode (json), `{}`);
+}
+%}}}
+
+private define test_encode_simple_array_from_list () %{{{
+{
+   json = json_encode ({ 1L, 2L, 3L, "Hello", "World!" };; no_whitespaces);
+   expect_value (json, `1,2,3,"Hello","World!"`);
+}
+%}}}
+
+private define test_encode_simple_array_from_string_array () %{{{
+{
+   json = json_encode ( "Hello", "World!" ;; no_whitespaces);
+   expect_value (json, `"Hello","World!"`);
+
+   json = json_encode ( "Hello", "World!", NULL ;; no_whitespaces);
+   expect_value (json, `"Hello","World!",null`);
+}
+%}}}
+
+private define test_encode_simple_array_from_int_array () %{{{
+{
+   json = json_encode ( 1, 2, 3 ;; no_whitespaces);
+   expect_value (json, `1,2,3`);
+}
+%}}}
+
+private define test_encode_simple_object () %{{{
+{
+   json = struct
+     {
+	"object" = struct { "i" = 1L, "x" = 10L },
+	"array"  =  1, 2, 3 ,
+	"string" = "stringvalue",
+	"long"   = 2147483647,
+#ifeval is_defined("LLONG_MAX")
+	"llong"  = 9223372036854775807LL,
+#endif
+	"double" = 6.022e+22,
+	"true"   = '\1',
+	"false"  = '\0',
+	"null"   = NULL,
+     };
+
+   expect_value (json_encode (json;; some_whitespaces), `{
+  "object": {
+    "i": 1,
+    "x": 10
+  },
+  "array": 
+    1,
+    2,
+    3
+  ,
+  "string": "stringvalue",
+  "long": 2147483647,`
+#ifeval is_defined("LLONG_MAX")
++`
+  "llong": 9223372036854775807,`
+#endif
++`
+  "double": 6.022e+22,
+  "true": true,
+  "false": false,
+  "null": null
+}`);
+}
+%}}}
+
+private define test_encode_escaped_strings () %{{{
+{
+   json = {
+     `" \ /`,
+     "\b \f \n \r \t",
+     "\u{1234}",
+     "Oh, la, la\u{0300}",
+     "\x00 \x01 ... \x1F \x20 \x21 ... \u{0080} \u{0081} ... \u{D7FF}"B,
+     "\u{D800} ... \u{DFFF}, \u{FFFE} & \u{FFFF}",  % illegal in normal UTF-8
+     "\u{D834}\u{DD1E}"  % example from ietf.org/rfc/rfc4627.txt
+   };
+   expect_value (json_encode (json;; some_whitespaces), `
+  "\" \\ /",
+  "\b \f \n \r \t",
+  "\u1234",
+  "Oh, la, la\u0300",
+  "\u0000 \u0001 ... \u001F   ! ... \u0080 \u0081 ... \uD7FF",
+  "\uD800 ... \uDFFF, \uFFFE & \uFFFF",
+  "\uD834\uDD1E"
+`);
+}
+%}}}
+
+private define test_encode_optional_whitespace () %{{{
+{
+   json = { 1, { 2, struct { three = 3 }, 4 } };
+
+   variable expected_json_text = `1,2,{"three":3},4`;
+   expect_value (json_encode (json), expected_json_text);
+   expect_value (json_encode (json;; no_whitespaces), expected_json_text);
+
+   expected_json_text =
+`
+  1,
+  
+    2,
+    {
+      "three": 3
+    },
+    4
+  
+`;
+  expect_value (json_encode (json; pre_vsep="", post_vsep="\n  ", pre_nsep="", post_nsep=" "),
+		expected_json_text);
+  % non-whitespace is ignored:
+  expect_value (json_encode (json; pre_vsep="none", post_vsep="newline\n two blanks", pre_nsep="none", post_nsep="non-whitespace ignored"),
+		expected_json_text);
+
+  expect_value (json_encode (json; pre_vsep=" ", post_vsep="\n\n    ", pre_nsep="\t", post_nsep="  "),
+`
+
+    1 ,
+
+    
+
+        2 ,
+
+        {
+
+            "three"\t:  3
+
+        } ,
+
+        4
+
+    
+
+`Q);
+}
+%}}}
+
+private define test_encode_errors () %{{{
+{
+   expect_error (Json_Invalid_Json_Error, `invalid boolean value '\\123'; only '\\000' and '\\001' are allowed`,
+		 &json_encode, { '\123' });
+   expect_error (Json_Invalid_Json_Error, "DataType_Type does not represent a JSON data structure",
+		 &json_encode, typeof(Int_Type));
+}
+%}}}
+
+private define test_encode ()
+{
+   test_encode_empty_array ();
+   test_encode_empty_object ();
+   test_encode_simple_array_from_list ();
+   test_encode_simple_array_from_string_array ();
+   test_encode_simple_array_from_int_array ();
+   test_encode_simple_object ();
+   test_encode_escaped_strings ();
+   test_encode_optional_whitespace ();
+   test_encode_errors ();
+}
+%}}}
+
+define slsh_main ()
+{
+   testing_module ("json");
+   test_decode ();
+   test_encode ();
+   end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_onig.sl Added

@@ -0,0 +1,46 @@
+() = evalfile ("./test.sl");
+require("onig.sl");
+
+private define exec (syntax, pattern, astr)
+{
+ variable reg = onig_new (pattern, ONIG_OPTION_DEFAULT, "ascii", syntax);
+ variable r = onig_search (reg, astr);
+ if (r)
+ {
+	variable i;
+	for (i = 0; i < r; i++)
+	 {
+	 variable nth = onig_nth_match (reg, i);
+#ifdef DEBUG
+	 () = fprintf(stderr, "%d: (%d-%d)\n", i, nth0, nth1);
+#endif
+	 }
+ }
+ else
+ failed ("search fail");
+}
+
+define slsh_main ()
+{
+ testing_module ("onig");
+
+ exec("perl",
+	"\\p{XDigit}\\P{XDigit}\\p{^XDigit}\\P{^XDigit}\\p{XDigit}",
+	"bgh3a");
+
+ exec("java",
+	"\\p{XDigit}\\P{XDigit}a-c&&b-g", "xbgc");
+
+ exec("asis",
+	"abc def* e+ g?ddda-rvvv (vv){3,7}hv\\dvv(?:aczui ss)\\W\\w$",
+	"abc def* e+ g?ddda-rvvv (vv){3,7}hv\\dvv(?:aczui ss)\\W\\w$");
+
+#ifdef DEBUG
+ message ("Supported syntaxes:");
+ array_map (Void_Type, &message, onig_get_syntaxes());
+ message ("Supported encodings:");
+ array_map (Void_Type, &message, onig_get_encodings());
+#endif
+
+ end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_pcre.sl Added

@@ -0,0 +1,44 @@
+() = evalfile ("./test.sl");
+require("pcre.sl");
+
+static define test_regexp_match (slpat, str, eret, eans, opts)
+{
+   variable pat = slang_to_pcre (slpat);
+   variable p = pcre_compile (pat, opts);
+
+   variable ret = pcre_exec (p, str);
+   if (eret != ret)
+     failed ("pcre_exec using '%s' failed: expected %d, got %d",
+	     slpat, eret, ret);
+
+   if (eans == NULL)
+     return;
+
+   variable ans = pcre_nth_substr (p, str, 0);
+   if (ans != eans)
+     failed ("pcre_exec(%s) matched '%s, expected '%s'",
+	     slpat, ans, eans);
+}
+
+define slsh_main ()
+{
+   testing_module ("pcre");
+
+   test_regexp_match ("B.*1-5", "0xAB123G", 1, "B123", 0);
+   test_regexp_match ("$1-5+$G\1"R, "0xAB123G12F", 0, NULL, 0);
+   test_regexp_match ("$1-5+$G\1"R, "0xAB123G123F", 2, "123G123", 0);
+   test_regexp_match ("1-5", "0xAB123G", 1, "1", 0);
+   test_regexp_match ("$1-52$"R, "0xAB123G", 2, "12", 0);
+   test_regexp_match ("G", "0xAB123G", 1, "G", 0);
+   test_regexp_match ("$G$"R, "0xAB123G", 2, "G", 0);
+
+   test_regexp_match (`=$\d$`, "L=1X", 2, "=1", 0);
+   test_regexp_match (`=$\d?$`, "L=1X", 2, "=1", 0);
+   test_regexp_match (`=$\d?$`, "L=12X", 2, "=1", 0);
+   test_regexp_match (`=$\d+$`, "L=1X", 2, "=1", 0);
+   test_regexp_match (`=$\d+$`, "L=12X", 2, "=12", 0);
+   test_regexp_match (`=$\d*$`, "L=1X", 2, "=1", 0);
+   test_regexp_match (`=$\d*$`, "L=X", 2, "=", 0);
+
+   end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_png.sl Added

@@ -0,0 +1,50 @@
+() = evalfile ("./test.sl");
+try
+{
+   require ("png");
+}
+catch ImportError:
+{
+   () = fprintf (stderr, "png-module not available.  Test not performed\n");
+   exit (1);
+}
+require ("rand");
+
+private define test_png ()
+{
+   variable nrows = 61, ncols = 83;
+   variable img = typecast (rand (nrows*ncols), UInt32_Type);
+   reshape (img, nrows, ncols);
+
+   variable file = sprintf ("/tmp/testpng-%ld.png", _time() mod getpid());
+   try
+     {
+	png_write (file, img, 1);
+	variable img1 = png_read (file);
+	ifnot (_eqs (img1, img))
+	  {
+	     failed ("png_read failed to read the ARGB image png_write created\n");
+	     return;
+	  }
+	png_write (file, img, 0);
+	img1 = png_read (file);
+	ifnot (_eqs (img&0x00FFFFFFU, img1))
+	  {
+	     failed ("png_read failed to read the RGB image png_write created\n");
+	     return;
+	  }
+     }
+   finally
+     {
+	() = remove (file);
+     }
+}
+
+define slsh_main ()
+{
+   testing_module ("png");
+   test_png ();
+   end_test ();
+}
+
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_rand.sl Added

@@ -0,0 +1,373 @@
+() = evalfile("./test.sl");
+require("rand.sl");
+
+private variable CLOSED_UPPER = 1;
+private variable CLOSED_LOWER = 2;
+
+define test_generic (func, ret_type, parms, exp_mean, exp_variance,
+		 min_r, max_r, interval_flags)
+{
+ variable a, b, r;
+
+ if (typeof ((@func) (__push_list(parms))) != ret_type)
+ failed ("${func} did not produce a ${ret_type}"$);
+ variable num = 10000;
+
+ a = (@func) (__push_list(parms), num);
+ if ((length (a) != num)
+ || (_typeof (a) != ret_type))
+ failed ("${func}(${num}) did not produce a ${num} ${ret_type}"$);
+
+ if (any(isnan (a)))
+ {
+	failed ("${func} produced NaN values"$);
+ }
+
+ if ((min_r != NULL) && (max_r != NULL))
+ {
+	variable range_error = 0;
+	range_error += ((interval_flags & CLOSED_LOWER) && any (a < min_r));
+	range_error += (((interval_flags & CLOSED_LOWER) == 0) && any (a <= min_r));
+	range_error += ((interval_flags & CLOSED_UPPER) && any (a > max_r));
+	range_error += (((interval_flags & CLOSED_UPPER) == 0) && any (a >= max_r));
+
+	if (range_error)
+	 failed ("${func} produced values outside the ${min_r}-${max_r} range"$);
+ }
+
+ if (exp_variance != NULL)
+ {
+	variable mean = sum (a)/num;
+	variable w = 1.0/sqrt(num);
+	variable exp_stddev = sqrt(exp_variance);
+	variable mean_lo = exp_mean - 3*exp_stddev*w;
+	variable mean_hi = exp_mean + 3*exp_stddev*w;
+
+	ifnot (mean_lo <= mean <= mean_hi)
+	 failed ("${func}'s mean ${mean} outside the expected range: ${mean_lo} - ${mean_hi}"$);
+
+	variable stddev = sqrt(sum((a-mean)^2)/num);
+	ifnot (feqs (stddev, exp_stddev, 0.1, 1e-4))
+	 failed ("${func}'s stddev ${stddev} differs from expected value ${exp_stddev} (var=${exp_variance})"$);
+ }
+
+ b = Int_Type3,2,1;
+ a = (@func) (__push_list(parms), b);
+ ifnot (all (array_shape (a) == array_shape(b)))
+ failed ("${func}(a) failed to produce an array with the dimensions of a");
+}
+
+define test_rand_uniform ()
+{
+ test_generic (&rand_uniform, Double_Type, {}, 0.5, 1.0/12, 0, 1, CLOSED_LOWER);
+}
+
+define test_rand_uniform_pos ()
+{
+ test_generic (&rand_uniform_pos, Double_Type, {}, 0.5, 1.0/12, 0, 1, 0);
+}
+
+define test_rand_gauss ()
+{
+ foreach (0, 0.5, 1.0, 10.0)
+ {
+	variable sigma = ();
+	test_generic (&rand_gauss, Double_Type, {sigma}, 0, sigma^2, NULL, NULL, CLOSED_LOWER);
+ }
+}
+
+define test_rand_poisson ()
+{
+ foreach (0.1, 1, 10, 100)
+ {
+	variable lam = ();
+	test_generic (&rand_poisson, UInt_Type, {lam}, lam, lam,
+		 0, _Inf, CLOSED_LOWER);
+ }
+}
+
+define test_rand_gamma ()
+{
+ foreach (0.1, 0.5, 10, 20)
+ {
+	variable theta = ();
+	foreach (1, 2, 4, 16)
+	 {
+	 variable k = ();
+	 test_generic (&rand_gamma, Double_Type, {k, theta},
+			 k*theta, k*theta^2,
+			 0, _Inf, CLOSED_LOWER);
+	 }
+ }
+}
+
+define test_rand_binomial()
+{
+ variable p, n;
+ foreach p (0, 0.25, 0.75, 1.0)
+ {
+	foreach n (1, 2, 10, 20, 50) % make sure n*MIN(p,1-p) > 10 for one case
+	 {
+	 test_generic (&rand_binomial, UInt_Type, {p, n},
+			 n*p, n*p*(1-p),
+			 0, n, CLOSED_LOWER|CLOSED_UPPER);
+	 }
+ }
+}
+
+define test_rand_beta()
+{
+ variable a, b;
+ foreach a (0.1, 0.5, 1, 2, 8)
+ {
+	foreach b (0.1, 0.5, 1, 4, 16)
+	 {
+	 test_generic (&rand_beta, Double_Type, {a, b},
+			 a/(a+b), (a*b)/(a+b)^2/(a+b+1),
+			 0, 1, CLOSED_LOWER|CLOSED_UPPER);
+	 }
+ }
+}
+
+define test_rand_cauchy ()
+{
+ variable gamma;
+ foreach gamma (0.01, 0.1, 1, 10, 100)
+ {
+	test_generic (&rand_cauchy, Double_Type, {gamma},
+		 0.0, NULL,
+		 -_Inf, _Inf, 0);
+ }
+}
+
+define test_rand_geometric ()
+{
+ variable p;
+ foreach p (0.01, 0.2, 0.6, 1.0)
+ {
+	test_generic (&rand_geometric, UInt_Type, {p},
+		 1/p, (1-p)/p^2, 1, _Inf, CLOSED_LOWER);
+ }
+}
+
+define test_rand_flat ()
+{
+ variable x0 = 2-0.5, x1 = 2+0.5;
+ test_generic (&rand_flat, Double_Type, {x0, x1},
+		 0.5*(x0+x1), (x1-x0)^2/12.0,
+		 x0, x1, CLOSED_LOWER);
+}
+
+define test_rand_fdist ()
+{
+ variable nu1, nu2;
+ foreach nu1 (1,2,5,20)
+ {
+	foreach nu2 (1,3,12,20)
+	 {
+	 variable mean = NULL, variance = NULL;
+	 if (nu2 > 4)
+	 {
+		 mean = nu2/(nu2-2.0);
+		 variance = 2.0*mean^2*(nu1+nu2-2.0)/nu1/(nu2-4.0);
+	 }
+	 test_generic (&rand_fdist, Double_Type, {nu1, nu2},
+			 mean, variance, 0, _Inf, CLOSED_LOWER);
+	 }
+ }
+}
+
+define test_rand_chisq ()
+{
+ variable nu;
+ foreach nu (1,2,5,20)
+ {
+	test_generic (&rand_chisq, Double_Type, {nu},
+		 nu, 2.0*nu, 0, _Inf, CLOSED_LOWER);
+ }
+}
+
+define test_rand_tdist ()
+{
+ variable nu;
+ foreach nu (0.5,1,2,5,20)
+ {
+	variable mean = 0.0, variance = NULL;
+	if (nu > 2)
+	 variance = nu/(nu-2.0);
+
+	test_generic (&rand_tdist, Double_Type, {nu},
+		 mean, variance, -_Inf, _Inf, 0);
+ }
+}
+
+define test_rand_int ()
+{
+ variable x0 = 1, x1 = 10;
+ test_generic (&rand_int, Int_Type, {x0, x1},
+		 0.5*(x0+x1), ((x1-x0+1)^2-1)/12.0, x0, x1,
+		 CLOSED_LOWER|CLOSED_UPPER);
+ variable n = 10000, s = sqrt(n);
+ x0 = -2, x1 = 2;
+ variable r = rand_int (x0, x1, (x1-x0+1)*n);
+ variable failed = 0;
+ _for (x0, x1, 1)
+ {
+	variable x = ();
+	variable i = where (x == r);
+	if (n-3*s < length(i) < n+3*s)
+	 continue;
+	failed++;
+ }
+
+ x0 = INT_MIN; x1 = INT_MAX;
+ variable nbins = 10, binsize = typecast (x1 - x0, UInt_Type);
+ binsize = typecast (binsize/nbins, Int_Type);
+
+ r = rand_int (x0, x1, nbins * n);
+ loop (nbins)
+ {
+	x1 = x0 + binsize;
+	if (x1 < x0)
+	 break;
+
+	i = where (x0 <= r < x1);
+	ifnot (n - 3*s < length(i) < n + 3*s)
+	 failed++;
+
+	x0 = x1;
+ }
+
+ if (failed)
+ {
+	() = fputs ("\
+***WARNING: rand_int produced random numbers outside the 3 sigma range.\n\
+ Run the test again, and if it fails with this warning then\n\
+ file a possible bug report. This is a statistical test and can\n\
+ produce false positives a small fraction of the time.\n",
+		 stderr);
+ }
+}
+
+define test_rand_exp ()
+{
+ variable beta;
+ foreach beta (0.1, 0.5, 1, 2, 10, 20)
+ {
+	test_generic (&rand_exp, Double_Type, {beta},
+		 beta, beta^2, 0, _Inf, CLOSED_LOWER);
+ }
+}
+
+private define test_rand ()
+{
+ variable r = rand_new ();
+ srand (r, 12345);
+ srand (12345);
+
+ variable expected_values =
+ 746892674U, 935820662U, 3317285904U, 3160065947U, 888929593U, 316432806U,
+ 3891177748U, 66504584U, 827237220U, 2731412032U, 105892519U, 1105593792U,
+ 4257164826U, 2953826281U, 477842505U, 3161051103U, 654741546U, 2422625584U,
+ 3232900523U, 2360188805U, 70104872U, 2440288176U, 1468162482U, 3428658486U,
+ 1893960569U, 3842583023U, 4119673423U, 2214061288U, 1769001282U, 3996933411U,
+ 3342430755U, 201679192U, 431385446U, 2648942401U, 2718561501U, 1689889009U,
+ 403183793U, 662574206U, 2167963286U, 2166423399U, 112978312U, 3881586706U,
+ 2111007051U, 2589350153U, 3519959692U, 838415425U, 1148338613U, 1576844827U,
+ 1939688263U, 1896225294U, 2843247453U, 179614524U, 594767376U, 4056452573U,
+ 2301108737U, 844660562U, 1079103954U, 3239244907U, 3213734172U, 3924276547U
+ ;
+ variable a = rand (expected_values);
+ variable b = rand (r, a);
+
+ if (any (a != expected_values))
+ failed ("The generator failed to produce the expected values");
+
+ if (any (a != b))
+ failed ("Seeding of the new generator failed");
+}
+
+define test_rand_permutation ()
+{
+ loop (20)
+ {
+	variable p = 1+rand_permutation (10);
+	if ((prod(p) != 3628800) || (sum(p) != (10*11)/2))
+	 {
+	 failed ("rand_permutation failed");
+	 }
+ }
+}
+
+private define check_sampled_array (rt, a, b, n)
+{
+ variable dims = array_shape (a);
+ dims0 = n;
+ ifnot (_eqs (dims, array_shape(b)))
+ failed ("rand_sample failed for %S array using rt=%S, n=%S: found %S", a, rt, n,b);
+}
+
+private define sample_and_check_array (rt, a, n)
+{
+ variable b;
+ if (rt == NULL)
+ b = rand_sample (a, n);
+ else
+ b = rand_sample (rt, a, n);
+
+ check_sampled_array (rt, a, b, n);
+}
+
+define test_rand_sample ()
+{
+ variable a0 = 1:20;
+ variable a1 = _reshape (1:20*30, 20, 30);
+ variable a2 = _reshape (1:20*30*4, 20, 30, 4);
+
+ variable dims, a, b, n, b0, b1, b2;
+ variable rt = rand_new ();
+ foreach n (5, 1, 20, 0)
+ {
+	foreach a ({a0,a1,a2})
+	 {
+	 sample_and_check_array (NULL, a, n);
+	 sample_and_check_array (rt, a, n);
+	 }
+	(b0, b1, b2) = rand_sample (a0, a1, a2, n);
+	check_sampled_array (NULL, a0, b0, n);
+	check_sampled_array (NULL, a1, b1, n);
+	check_sampled_array (NULL, a2, b2, n);
+
+	(b0, b1, b2) = rand_sample (rt, a0, a1, a2, n);
+	check_sampled_array (rt, a0, b0, n);
+	check_sampled_array (rt, a1, b1, n);
+	check_sampled_array (rt, a2, b2, n);
+ }
+}
+
+define slsh_main ()
+{
+ testing_module ("rand");
+
+ test_rand ();
+ test_rand_permutation ();
+ test_rand_sample ();
+
+ test_rand_uniform ();
+ test_rand_uniform_pos ();
+ test_rand_gauss ();
+ test_rand_poisson ();
+ test_rand_gamma ();
+ test_rand_binomial ();
+ test_rand_beta ();
+ test_rand_cauchy ();
+ test_rand_geometric ();
+ test_rand_flat ();
+ test_rand_fdist ();
+ test_rand_chisq ();
+ test_rand_tdist ();
+ test_rand_int ();
+ test_rand_exp ();
+
+ end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_select.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_slsmg.sl Added

@@ -0,0 +1,42 @@
+() = evalfile ("./test.sl");
+
+% TODO:
+% The test plan is to write output to a file and compare that output to a
+% validated output file.  Such a test cannot rely upon using a system
+% provided terminfo database, which could vary from system to system.
+% As such, a TERMCAP environment variable will be used.
+
+try
+{
+   if (NULL == getenv("TERM"))
+     {
+	() = fprintf (stderr, "TERM environment variable not set--- slsmg-module test not performed\n");
+	exit (0);
+     }
+#if$TERM unknown
+   () = fprintf (stderr, "TERM is unknown-- slsmg-module not tested\n");
+   exit (0);
+#endif
+   require ("slsmg");
+}
+catch ImportError:
+{
+   () = fprintf (stderr, "slsmg-module not available.  Test not performed\n");
+   exit (1);
+}
+
+private define test_smg ()
+{
+   slsmg_init_smg ();
+   slsmg_refresh ();
+   variable line;
+   () = fgets (&line, stdin);
+   slsmg_reset_smg ();
+}
+
+define slsh_main ()
+{
+   testing_module ("slsmg"); ()=fputs("(module loaded)...", stdout);
+   %test_smg ();
+   end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_socket.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_stats.sl Added

@@ -0,0 +1,568 @@
+() = evalfile("./test.sl");
+require ("stats.sl");
+
+private define test_chisqr_test ()
+{
+ % This example comes from Conover, 1980, section 4.2
+ variable x = 6, 14, 17, 9;
+ variable y = 30, 32, 17, 3;
+ variable t, p;
+ p = chisqr_test (x, y, &t);
+ if (abs(t - 17.3) > 0.1)
+ failed ("chisqr_test: Expected 17.3, got t=%S", t);
+ x = 13, 73;
+ y = 17, 57;
+ p = chisqr_test (x, y, &t);
+ if (abs(t - 1.61) > 0.01)
+ failed ("chisqr_test: Expected 1.61, got t=%S", t);
+ % Conover 1980, example 2, pg 159. EXCEPT: Conover has 1.55 for the
+ % statistic, but an explicit calculation yields 1.524... Is this a
+ % misprint?
+ p = chisqr_test (16,14., 14,6., 13,10., 13,8., &t);
+ if (abs(t - 1.524) > 0.01)
+ failed ("chisqr_test: Expected 1.524, got t=%S", t);
+}
+
+private define test_f ()
+{
+ variable x, y, s, p;
+ variable s0, p0;
+ %variable x = 41, 34, 33, 36, 40, 25, 31, 37, 34, 30, 38;
+ %variable y = 52, 57, 62, 55, 64, 57, 56, 55;
+
+ % This test comes from the Gnumeric documentation for the f-test
+ x = 68.5, 83, 83, 66.5, 58.1, 82.4;
+ y = 81.5, 85.2, 87.1, 69.3, 73.5, 65.5, 73.4, 56.1;
+
+ %vmessage("stddev x/y = %g", stddev(x)/stddev(y));
+ p = f_test2 (x, y, &s);
+ p0 = 0.920666, s0 = 1.039706;
+ ifnot (feqs (p,p0) || feqs (s,s0))
+ failed ("f_test2 test 1 failed");
+
+ p = f_test2 (x, y, &s; side=">");
+ p0 = 0.53667;
+ ifnot (feqs (p,p0))
+ failed ("f_test2 size=> failed: expected %g, got %g", p0, p);
+
+ p = f_test2 (x, y, &s; side="<");
+ p0 = 0.46333;
+ ifnot (feqs (p,p0))
+ failed ("f_test2 side=< failed: expected %g, got %g", p0, p);
+}
+
+private define map_cdf_to_pval (cdf)
+{
+ variable side = qualifier ("side", NULL);
+
+ variable pval = cdf;		 % side="<"
+ if (side == ">")
+ pval = 1.0 - cdf;
+ else if (side != "<")	 % double-sided
+ pval = 2.0 * _min (1.0-pval, pval);
+
+ return pval;
+}
+
+private define nsqr_kendall_tau (x, y, w_ref)
+{
+ variable n = length (x);
+ if (n != length (y))
+ throw InvalidParmError, "Arrays must be the same length for nsqr_kendall_tau";
+
+ variable i;
+ variable nx = 0.0, ny = 0.0, diff=0.0;
+ _for i (0, n-2, 1)
+ {
+	variable j = i+1:n-1;
+	variable dx = sign(xi - xj);
+	variable dy = sign(yi - yj);
+	nx += sum(abs(dx));
+	ny += sum(abs(dy));
+	diff += sum (dx*dy);	 % concordant - discordant
+ }
+
+ variable tau = diff/(sqrt(nx)*sqrt(ny));
+
+ @w_ref = tau;
+
+ variable sigma = sqrt((4.0*n+10.0)/(9.0*n*(n-1)));
+ return map_cdf_to_pval (normal_cdf(tau/sigma) ;; __qualifiers);
+}
+
+private define run_kendall_test (x, y, ep, es)
+{
+ variable p, s;
+
+ p = kendall_tau (x, y, &s);
+ ifnot (feqs (s, es, 0, 0.01))
+ failed ("*** kendall_tau statistic: %g, expected %g", s, es);
+ ifnot (feqs (p, ep, 0, 0.02))
+ failed ("*** kendall_tau pvalue: %g, expected %g", p, ep);
+ %vmessage ("s=%S, expected_s=%S", s, es);
+ %vmessage ("p=%S, expected_p=%S", p, ep);
+}
+
+private define test_kendall_tau ()
+{
+ variable x, y, p, s, cdf;
+ variable expected_s, expected_p;
+
+ % IDL R_CORRELATE example
+ x = 257, 208, 296, 324, 240, 246, 267, 311, 324, 323, 263,
+	305, 270, 260, 251, 275, 288, 242, 304, 267;
+ y = 201, 56, 185, 221, 165, 161, 182, 239, 278, 243, 197,
+	271, 214, 216, 175, 192, 208, 150, 281, 196;
+ expected_p = 0.000118729;
+ expected_s = 0.624347;
+ run_kendall_test (x, y, expected_p, expected_s);
+
+ % From Armitage and Berry (1994, p. 466) via statsdirect.com 
+ x = 4,10,3,1,9,2,6,7,8,5;
+ y = 5,8,6,2,10,3,9,4,7,1;
+ expected_p = 0.0466;
+ expected_s = 0.5111;
+ run_kendall_test (x, y, expected_p, expected_s);
+
+ % Wine example from Herve Abdi in Encyclopedia of Measurement and
+ % Statistics (2007)
+ x = 1,3,2,4;
+ y = 1,4,2,3;
+ expected_p = 2*(1.0/6);
+ expected_s = 2.0/3.0;
+ run_kendall_test (x, y, expected_p, expected_s);
+
+ % Example from Higgins 2004 based upon table 5.3.1
+ x = 68, 70, 71, 72;
+ y = 153, 155, 140, 180;
+ expected_p = 2 * 0.375;	 % 2-sided
+ expected_s = 0.33;
+ run_kendall_test (x, y, expected_p, expected_s);
+
+ % Problem 4.3 from Higgins
+ x = 3,7,15,24,85,180,360;
+ y = 2500,3200,4300,5300,5900,6700,6900;
+ expected_p = 2.0/5040.0;
+ expected_s = 1;
+ run_kendall_test (x, y, expected_p, expected_s);
+
+ % Higgins 2004 example 5.3.1
+ % Rabbit data (table 5.2.1)
+ x = 6,16,8,18,17,4,3,1,5,7,15,2,13,12,10,11,14,9;
+ y = 5,17,6,18,14,8,2,1,7,3,15,4,16,13,12,10,9,11;
+ expected_p = 0.0;
+ expected_s = 0.73;
+ run_kendall_test (x, y, expected_p, expected_s);
+
+ % Example 6.1 Gibbons & Chakraborti, 2003
+ x = 1,5,9,7,4,6,8,2,3;
+ y = 4,3,6,8,2,7,9,1,5;
+ expected_p = 0.022 * 2;	 % 2-tailed
+ expected_s = 40.0/72.0;
+ run_kendall_test (x, y, expected_p, expected_s);
+
+ % Data tested against www.wessa.net/rwasp_kendall.wasp
+ x = 1,1,1,1,2,2,2,2,3,4,5,6,7,7,7,7;
+ y = 1,1,1,2,1,2,2,2,3,5,4,7,6,7,7,7;
+ expected_p = 4.49419021606445e-05;
+ expected_s = 0.8529412150383;
+ run_kendall_test (x, y, expected_p, expected_s);
+
+ % scipy example (its p-value is wrong, so
+ % www.wessa.net/rwasp_kendall.wasp value is used below)
+ x = 12, 2, 1, 12, 2;
+ y = 1, 4, 7, 1, 0;
+ expected_p = 0.420456647872925; % scipy: 0.24821309157521476;
+ expected_s = -0.47140452079103173;
+ run_kendall_test (x, y, expected_p, expected_s);
+
+ % Data tested against www.wessa.net/rwasp_kendall.wasp
+ x = 12,14,14,17,19,19,19,19,19,20,21,21,21,21,21,22,23,24,24,24,26,26,27;
+ y = 11,4,4,2,0,0,0,0,0,0,4,0,4,0,0,0,0,4,0,0,0,0,0;
+ expected_p = 0.0389842391014099;
+ expected_s = -0.376201540231705;
+ run_kendall_test (x, y, expected_p, expected_s);
+}
+
+private define test_ks ()
+{
+ variable x, y, p, s, cdf;
+ variable expected_s, expected_p;
+
+ % Example 6.1-1 from Conover 1980
+ x = 0.621, 0.503, 0.203, 0.477, 0.710,
+	0.581, 0.329, 0.480, 0.554, 0.382;
+ cdf = x;			 % uniform distribtion
+ p = ks_test (x, &s);
+ expected_s = 0.29;
+ ifnot (feqs (s, expected_s))
+ failed ("*** ks_test statistic: %g, expected %g", s, expected_s);
+
+ % Example 5.4 in Hollander-Wolfe 1999
+ x = -0.15, 8.6, 5, 3.71, 4.29, 7.74, 2.48, 3.25, -1.15, 8.38;
+ y = 2.55, 12.07, 0.46, 0.35, 2.69, -0.94, 1.73, 0.73, -0.35, -0.37;
+ expected_p = 0.0524;
+ p = ks_test2 (x,y, &s);
+ ifnot (feqs (p, expected_p))
+ failed ("*** ks_test2 pval=: %g, expected %g", p, expected_p);
+}
+
+private define test_mw_cdf (N)
+{
+ variable n;
+ _for n (1, N-1, 1)
+ {
+	variable m = N-n;
+	variable rmin = (n*(n+1))/2, rmax = m*n + rmin;
+	variable r, lastp = 0, p;
+	_for r (rmin, rmax, 1)
+	 {
+	 p = mann_whitney_cdf (n, m, r);
+	 if (lastp > p)
+	 failed ("mann_whitney_cdf(%d,%d,%g) to be increasing", n, m, r);
+	 }
+	ifnot (feqs (p, 1.0, 0.0001))
+	 failed ("mann_whitney_cdf (%d, %d, %d:%d) failed: s=%g", n, m, rmin, rmax,p);
+ }
+}
+
+private define test_mw_test ()
+{
+ variable w, ew;
+ variable x, y, p, ep;
+
+ % Example 4.1 from Hollander and Wolfe (2nd Edition)
+ x = 0.8, 0.83, 1.89, 1.04, 1.45, 1.38, 1.91, 1.64, 0.73, 1.46;
+ y = 1.15, 0.88, 0.9, 0.74, 1.21;
+
+ p = mw_test (y, x, &w);
+ ifnot (feqs(w, 30))
+ failed ("mw_test 1 returned %S, expected 30", w);
+
+ % Example 2.4.2 Higgins 2004 (Strawberry plants)
+ x = 0.55, 0.67, 0.63, 0.79, 0.81, 0.85, 0.68; % treated
+ y = 0.65, 0.59, 0.44, 0.60, 0.47, 0.58, 0.66, 0.52, 0.51; % untreated
+ % H0: E(x)<=E(y)
+ ew = 84;
+ ep = 0.0039;
+ p = mw_test (x, y, &w; side=">");
+ if (w != ew)
+ failed ("mw_test 2 returned %S, expected %S", w, ew);
+ ifnot (feqs (p, ep))
+ failed ("mw_test 2 returned pval=%g, expected %g", p, ep);
+
+ % Example 2.4.1 (Higgins 2004)
+ x = 37,49,55,57;		 % new
+ y = 23,31,46;		 % traditional
+ % H0: E(x)<=E(y)
+ p = mw_test (x,y, &w; side=">");
+ ew = 21;
+ ep = 0.0571;
+ if (w != ew)
+ failed ("mw_test 3 returned %S, expected %S", w, ew);
+ ifnot (feqs (p, ep))
+ failed ("mw_test 3 returned pval=%g, expected %g", p, ep);
+
+ % Example 2.6.1 Higgins
+ x = 3.6, 3.9, 4.0, 4.3;	 % brand1
+ y = 3.8, 4.1, 4.5, 4.8;	 % brand2
+ p = mw_test (x, y, &w);
+ ew = 1+3+4+6;
+ ep = 0.1714*2;
+ if (w != ew)
+ failed ("mw_test 4 returned %S, expected %S", w, ew);
+ ifnot (feqs (p, ep))
+ failed ("mw_test 4 returned pval=%g, expected %g", p, ep);
+
+ % Conover 1980, section 5.1 example 1
+ x = 14.8,7.3,5.6,6.3,9.0,4.2,10.6,12.5,12.9,16.1,11.4,2.7;
+ y = 12.7,14.2,12.6,2.1,17.7,11.8,16.9,7.9,16.0,10.6,5.6,5.6,7.6,11.3,8.3,
+	6.7,3.6,1.0,2.4,6.4,9.1,6.7,18.6,3.2,6.2,6.1,15.3,10.6,1.8,5.9,9.9,
+	10.6,14.8,5.0,2.6,4.0;
+ ew = 321; ep = 0.26;
+ p = mw_test (x, y, &w; side=">");
+ if (w != ew)
+ failed ("mw_test 5 returned %S, expected %S", w, ew);
+ ifnot (feqs (p, ep))
+ failed ("mw_test 5 returned pval=%g, expected %g", p, ep);
+}
+
+private define test_spearman ()
+{
+ variable x, y, p, s, cdf;
+ variable expected_s, expected_p;
+
+ % Higgins 2004 example 5.2.1
+ % Rabbit data (table 5.2.1)
+ x = 6,16,8,18,17,4,3,1,5,7,15,2,13,12,10,11,14,9;
+ y = 5,17,6,18,14,8,2,1,7,3,15,4,16,13,12,10,9,11;
+
+ p = spearman_r (x, y, &s);
+ expected_p = 0;
+ expected_s = 0.897;
+ ifnot (feqs (s, expected_s))
+ failed ("*** spearman_r statistic: %g, expected %g", s, expected_s);
+ ifnot (feqs (p, expected_p))
+ failed ("*** spearman_r pval= %g, expected %g", p, expected_p);
+
+ % Higgins 2004 example 5.2.3
+ x = 8,8,7,8,5,6,6,9,8,7;
+ y = 7,8,8,5,6,4,5,8,6,9;
+ p = spearman_r (x, y, &s);
+ expected_p = 0.2832;
+ expected_s = 0.375;
+ ifnot (feqs (s, expected_s))
+ failed ("*** spearman_r statistic: %g, expected %g", s, expected_s);
+ ifnot (feqs (p, expected_p))
+ failed ("*** spearman_r pval= %g, expected %g", p, expected_p);
+}
+
+private define check_pval_and_t (name, pv, t, pv_exp, t_exp)
+{
+ if (feqs (pv, pv_exp) && feqs (t, t_exp))
+ return;
+
+ failed ("%s: pv=%S!=%S, t=%S!=%S", name, pv, pv_exp, t, t_exp);
+}
+
+private define test_ad_ktest ()
+{
+ % This test is from Scholz & Stephens
+ variable datasets =
+ {
+	38.7, 41.5, 43.8, 44.5, 45.5, 46.0, 47.7, 58.0,
+	39.2, 39.3, 39.7, 41.4, 41.8, 42.9, 43.3, 45.8,
+	34.0, 35.0, 39.0, 40.0, 43.0, 43.0, 44.0, 45.0,
+	34.0, 34.8, 34.8, 35.4, 37.2, 37.8, 41.2, 42.8,
+ };
+
+ variable pval, t, pval2, t2;
+ pval = ad_ktest (datasets, &t; pval2=&pval2, stat2=&t2);
+ check_pval_and_t ("ad_ktest1", pval, t, 0.00219, 4.480);
+ check_pval_and_t ("ad_ktest1", pval2, t2, 0.00227, 4.449);
+
+ % This examples comes from
+ % <http://tools.ietf.org/html/draft-ietf-ippm-testplan-rfc2680-02>
+ datasets =
+ {
+	114, 175, 138, 142, 181, 105,
+	115, 128, 136, 127, 139, 138,
+ };
+ pval = ad_ktest (datasets, &t; pval2=&pval2, stat2=&t2);
+ check_pval_and_t ("ad_ktest2", pval, t, 0.18607, 0.62679);
+ check_pval_and_t ("ad_ktest2", pval2, t2, 0.20604, 0.52043);
+
+ % This example comes from kSamples.R package
+ datasets =
+ {
+	0.824, 0.216, 0.538, 0.685,
+	0.448, 0.348, 0.443, 0.722,
+	0.403, 0.268, 0.440, 0.087,
+ };
+ pval = ad_ktest (__push_list(datasets), &t; pval2=&pval2, stat2=&t2);
+ check_pval_and_t ("ad_ktest3", pval, t, 0.193, 0.70807);
+ check_pval_and_t ("ad_ktest3", pval2, t2, 0.190135, 0.72238);
+}
+
+private variable XData = 
+-0.15, %1
+ 8.60, %9
+ 5.00, %6
+ 3.71, %4
+ 4.29, %5
+ 7.74, %7
+ 2.48, %2
+ 3.25, %3
+-1.15, %0
+ 8.38 %8
+;
+private variable YData = 
+ 2.55,
+12.07,
+ 0.46,
+ 0.35,
+ 2.69,
+-0.94,
+ 1.73,
+ 0.73,
+-0.35,
+-0.37
+;
+
+private define test_mean_stddev (xdata)
+{
+ variable m0 = sum(1.0*xdata)/length(xdata);
+ variable m1 = mean(xdata);
+ ifnot (feqs (m0, m1, 1e-6, 1e-7))
+ failed ("test_mean_stddev: mean failed: got %S, expected %S", m0, m1);
+
+ variable n = length(xdata);
+ if (0 == (n & 0x1))
+ n--;
+
+ variable x1 = xdataarray_sort(xdata)n/2;
+ variable x2 = median (xdata);
+ if (x1 != x2)
+ failed ("median %S: found %g, expected %g", xdata, x2, x1);
+ x2 = median_nc (xdata);
+ if (x1 != x2)
+ failed ("median_nc %S: found %g, expected %g", xdata, x2, x1);
+
+ x1 = stddev (xdata);
+ x2 = sqrt(sum((xdata-mean(xdata))^2)/(length(xdata)-1));
+ ifnot (feqs (x1, x2, 1e-6, 1e-7))
+ failed ("stddev, found %g, expected %g", x1, x2);
+
+ variable a = Double_Type length(xdata), 3;
+ a*,0 = xdata; a*,1 = xdata; a*,2 = xdata;
+ x2 = stddev (a, 0);
+ if (length (x2) != 3)
+ failed ("stddev(a,0): expected an array of 3, got %d", length (x2));
+ ifnot (all (feqs(x2, x1, 1e-6, 1e-7)))
+ {
+	failed ("stddev(%S,0) produced incorrect values", a);
+ }
+}
+
+private define wikipedia_sample_skewness (x)
+{
+ variable n = length(x)*1.0;
+ variable xbar = sum(x)/n;
+ variable dx = x-xbar;
+ return sqrt(n)*sum(dx*dx*dx)/sum(dx*dx)^1.5;
+}
+
+private define wikipedia_sample_kurtosis (x)
+{
+ variable n = length(x)*1.0;
+ variable xbar = sum(x)/n;
+ variable dx = x-xbar;
+ return (n*sum(dx^4))/sum(dx*dx)^2 - 3;
+}
+
+define test_skewness_kurtosis ()
+{
+ variable w = wikipedia_sample_skewness (XData);
+ variable s = skewness (XData);
+ ifnot (feqs (w,s,1e-6, 1e-7))
+ failed ("Expected skewness = %g, found %g", w, s);
+
+ w = wikipedia_sample_kurtosis (XData);
+ s = kurtosis (XData);
+ ifnot (feqs (w,s,1e-6, 1e-7))
+ failed ("Expected kurtosis = %g, found %g", w, s);
+}
+
+private define test_binomial ()
+{
+ variable expected = 1, 4, 6, 4, 1;
+ variable m, n = 4;
+ variable ans = binomial (n);
+ ifnot (_eqs (expected, ans))
+ failed ("binomial(4) produced an incorrect result");
+ _for m (0, n, 1)
+ {
+	if (binomial(n,m) != expectedm)
+	 failed ("Incorrect value for binomial(%d,%d)", n, m);
+ }
+}
+
+private define test_student_t ()
+{
+ variable x, y, p, t, p0, t0;
+
+ x = 35,40,12,15,21,14,46,10,28,48,
+	16,30,32,48,31,22,12,39,19,25;
+ y = 2,27,38,31, 1,19, 1,34, 3, 1,
+	 2, 3, 2, 1, 2, 1, 3,29,37, 2;
+ t0 = 3.54;
+ p0 = 0.0011;	 % computed by http://www.graphpad.com/quickcalcs/ttest2.cfm
+
+ p = t_test2 (x, y, &t);
+ ifnot ((feqs (p,p0)) || feqs (t,t0))
+ failed ("t_test2 failed:\n p = %S, p0 = %S, t = %g, t0 = %g", p, p0, t, t0);
+
+ x = 10,20,50,57,32,12,6,17,9,11;
+ t0 = 1.3328;
+ p0 = 0.2153;	 % computed by http://www.graphpad.com/quickcalcs/
+ p = t_test (x, 30, &t);
+ ifnot ((feqs (p,p0)) || feqs (t,t0))
+ failed ("t_test 1 failed:\n p = %S, p0 = %S, t = %g, t0 = %g", p, p0, t, t0);
+
+ t0 = 1.3328;
+ p0 = 0.0033;	 % computed by http://www.graphpad.com/quickcalcs/
+ p = t_test (x, 45, &t);
+ ifnot ((feqs (p,p0)) || feqs (t,t0))
+ failed ("t_test 2 failed:\n p = %S, p0 = %S, t = %g, t0 = %g", p, p0, t, t0);
+}
+
+private define check_poisson_cdf (m, k, p)
+{
+ variable p1 = poisson_cdf (m, k);
+ if (fneqs (p, p1, 1e-6))
+ failed ("poisson_cdf(%S,%S) returned %S, expected %S, diff=%S", m, k, p1, p, abs(p-p1));
+}
+
+private define test_poisson_cdf ()
+{
+ % The CDFs were computed from http://www.xuru.org/
+ check_poisson_cdf (6, 12, 0.991172516482);
+ check_poisson_cdf (245, 300, 0.999702001313651);
+ check_poisson_cdf (245, 345, 0.9999999993);
+ check_poisson_cdf (345, 245, 8.407230482e-9);
+ check_poisson_cdf (500.0, 500, 0.5118911217);
+ check_poisson_cdf (500.0, 450, 0.01240835055);
+ check_poisson_cdf (50000.0, 50000, 0.501189413);
+ check_poisson_cdf (50000.0, 49900, 0.3283840695);
+ check_poisson_cdf (50000.0, 50500, 0.9873021349);
+}
+
+private define test_mean_stddev_with_datatypes (xdata)
+{
+ variable type;
+
+ foreach type (Char_Type, UChar_Type, Int16_Type, UInt16_Type,
+		 Int_Type, UInt_Type, Long_Type, ULong_Type,
+		 Float_Type, Double_Type,
+		 )
+ {
+	test_mean_stddev (typecast (xdata, type));
+ }
+}
+
+define slsh_main ()
+{
+ testing_module ("stats");
+
+ variable xdata = 256*urand(10);
+ test_mean_stddev_with_datatypes (xdata);
+ xdata = 256*urand(11);
+ test_mean_stddev_with_datatypes (xdata);
+
+ % The following array caused problems for median_nc in the previous
+ % implmentation
+ xdata = 221, 125, 163, 230, 13, 67, 125, 215, 122, 108;
+ test_mean_stddev_with_datatypes (xdata);
+
+ xdata = 1,1,1;
+ test_mean_stddev_with_datatypes (xdata);
+ xdata = 1,1;
+ test_mean_stddev_with_datatypes (xdata);
+
+ test_chisqr_test ();
+ test_f ();
+ test_kendall_tau ();
+ test_ks ();
+ test_mw_cdf (2);
+ test_mw_cdf (3);
+ test_mw_cdf (10);
+ test_mw_cdf (21);
+ test_mw_test ();
+ test_ad_ktest ();
+ test_spearman ();
+ test_binomial ();
+ test_student_t ();
+ test_poisson_cdf ();
+
+ end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_sysconf.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_termios.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_varray.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/test/test_zlib.sl Added

@@ -0,0 +1,71 @@
+() = evalfile("./test.sl");
+require ("zlib");
+
+private define silly_deflate (str)
+{
+   variable z = zlib_deflate_new ();
+   variable x = "";
+   foreach (str)
+     {
+	variable ch = ();
+	x = x + _zlib_deflate (z.zobj, pack("C", ch), 0);
+     }
+   x = x + z.flush ();
+   return x;
+}
+
+private define silly_inflate (zstr)
+{
+   variable z = zlib_inflate_new ();
+   variable x = "";
+   foreach (zstr)
+     {
+	variable ch = ();
+	x = x + _zlib_inflate (z.zobj, pack("C", ch), 0);
+     }
+   x = x + z.flush ();
+   return x;
+}
+
+define test_zlib (str0)
+{
+   variable zstr = zlib_deflate (str0);
+   variable str1 = zlib_inflate (zstr);
+   if (str1 != str0)
+     {
+	failed ("to deflate/inflate %s", str0);
+	return;
+     }
+   variable zstr1 = silly_deflate (str0);
+   if (zstr1 != zstr)
+     {
+	failed ("to deflate %s via multiple calls", str0);
+	return;
+     }
+   str1 = silly_inflate (zstr1);
+   if (str1 != str0)
+     {
+	failed ("to inflate %s via multiple calls", str0);
+	return;
+     }
+}
+
+define slsh_main ()
+{
+   testing_module ("zlib");
+
+   test_zlib ("");
+   test_zlib ("\0");
+   test_zlib ("\0\0\0");
+   test_zlib ("A");
+   test_zlib ("AA");
+   test_zlib ("AAA");
+   test_zlib ("AAAAAAAA");
+   test_zlib ("AAAAAAAABBBBBBB");
+   test_zlib ("AAAAAAAABBBBBBBAAAAAAA");
+   test_zlib ("ABCDEFGHIJKLMNOPQRSTUVWXYZ");
+   test_zlib ("ABCDEFGHIJKLMNOPQRSTUVWXYZ\0");
+   test_zlib ("\0ABCDEFGHIJKLMNOPQRSTUVWXYZ\0");
+
+   end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm/Makefile Added

@@ -0,0 +1,41 @@
+# -*- sh -*-
+#
+# To create the SGML files, you will need to install the tm-utils
+# package. See http://www.jedsoft.org/ for more information.
+#
+#TMEXPAND = $(HOME)/lib/tmexpand/bin/tmexpand
+TMEXPAND=tmexpand
+MACRODIR = # -I$(HOME)/lib/tmexpand/macros
+TM2SGML = tmexpand
+SGML2HTML = sgml2html
+
+HLP_FILES = pngfuns.hlp pcrefuns.hlp sockfuns.hlp onigfuns.hlp \
+ randfuns.hlp forkfuns.hlp csvfuns.hlp slsmg.hlp histfuns.hlp \
+ statsfuns.hlp jsonfuns.hlp base64funs.hlp chksumfuns.hlp
+
+all: help-files
+help-files: $(HLP_FILES)
+html: modfuns.html
+
+.SUFFIXES: .tm .hlp
+.tm.hlp:
+	$(TMEXPAND) $(MACRODIR) -Mslhlp $< $@
+#----------------------------------------------------------------------------
+modfuns.sgml : modfuns.tm $(HLP_FILES)
+	$(TM2SGML) modfuns.tm modfuns.sgml
+modfuns.html : modfuns.sgml
+	$(SGML2HTML) modfuns.sgml
+#----------------------------------------------------------------------------
+clean:
+	-rm -f *~ *.dvi *.log *.aux *.toc *.bak *.sgml
+distclean: clean
+	-rm -f *.html *.ps $(HLP_FILES)
+install: install-help
+install-help: $(HLP_FILES)
+	-mv $(HLP_FILES) ../help
+	@echo
+	@echo To install the html files, use make install-html
+	@echo
+install-html: html
+	-mv *.html ../../doc/html/
+.PHONY: clean distclean install install-help install-html

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm/base64funs.tm Added

@@ -0,0 +1,160 @@
+\function{_base64_decoder_accumulate}
+\synopsis{Accumulate data to be base64 decoded}
+\usage{_base64_decoder_accumulate(Base64_Type b64, String_Type data)}
+\description
+  This routine adds a tring to the base64 decoder queue of the
+  specifed Base64_Type object, previously instantiated using the
+  \ifun{_base64_decoder_new}.
+
+  See the documentation for \ifun{_base64_decoder_new} for more
+  detailed usage.
+\seealso{_base64_decoder_new, _base64_decoder_close, _base64_encoder_new}
+\done
+
+\function{_base64_decoder_new}
+\synopsis{Intantiate a new base64 decoder}
+\usage{Base64_Type _base64_decoder_new (Ref_Type func ,func_data)}
+\description
+  This routine returns instantiates a Base64_Type decoder object that
+  may be used to decode base64 data.  It require a single
+  \exmp{Ref_Type} parameter that is a reference to a callback function
+  that the decoder will call with with (partially) decoded data.  The second
+  argument, \exmp{func_data}, is optional.  If present it will also be
+  passed to the callback function.
+
+  The callback function must be defined to accept one or two
+  parameters, depending upon whether the \ifun{_base64_decoder_new} function
+  was called with the optional \exmp{func_data} argument.  If
+  \exmp{func_data} was passed, then it will be passed as the first
+  argument to the callback function.  The (partially) encoded string
+  is passed as the last argument.  The callback function shall return
+  nothing.
+\example
+  The following example defines a function that base64-decodes a string.
+#v+
+   private define decode_callback (strp, decoded_str)
+   {
+     @strp = @strp + decoded_str;
+   }
+
+   define b64decode_string (str)
+   {
+     variable b = ""B;     % The decoded string is binary
+     variable b64 = _base64_decoder_new (&decode_callback, &b);
+     _base64_decoder_accumulate (b64, str);
+     _base64_decoder_close (b64);
+     return b;
+   }
+#v-
+\example
+  The following example takes data from an input file pointer
+  \exmp{fpin} and writes the decoded data to an output file pointer
+  \exmp{fpout}:
+#v+
+   private define decoder_callback (fpout, data)
+   {
+      () = fwrite (data, fpout);
+   }
+
+   define base64_decode_file (fpin, fpout)
+   {
+      variable b64 = _base64_decoder_new (&encoder_callback, fpout);
+      variable line;
+      while (-1 != fgets (&line, fpin))
+        _base64_decoder_accumulate (b64, line);
+      _base64_decoder_close (b64);
+   }
+#v-
+\seealso{_base64_decoder_accumulate, _base64_decoder_close, _base64_encoder_new}
+\done
+
+\function{_base64_decoder_close}
+\synopsis{Flush and delete a base64 decoder}
+\usage{_base64_decoder_close (Base64_Type b64)}
+\description
+  This function must be called when there is no more data for the
+  specified base64 decoder to process.  See the documentation for
+  \ifun{_base64_decoder_new} for additional information and usage.
+\seealso{_base64_decoder_new, _base64_decoder_accumulate, _base64_encoder_close}
+\done
+
+\function{_base64_encoder_accumulate}
+\synopsis{Accumulate data to be base64 encoded}
+\usage{_base64_encoder_accumulate(Base64_Type b64, BString_Type data)}
+\description
+  This routine adds a binary string to the encoder queue of the
+  specifed Base64_Type object, previously instantiated using the
+  \ifun{_base64_encoder_new}.
+
+  See the documentation for \ifun{_base64_encoder_new} for more
+  detailed usage.
+\seealso{_base64_encoder_new, _base64_encoder_close, _base64_decoder_new}
+\done
+
+\function{_base64_encoder_new}
+\synopsis{Intantiate a new base64 encoder}
+\usage{Base64_Type _base64_encoder_new (Ref_Type func ,func_data)}
+\description
+  This routine returns instantiates a Base64_Type decoder object that
+  may be used to base64-encode data.  It require a single
+  \exmp{Ref_Type} parameter that is a reference to a callback function
+  that the encoder will call with the data to be encoded.  The second
+  argument, \exmp{func_data}, is optional.  If present it will also be
+  passed to the callback function.
+
+  The callback function must be defined to accept one or two
+  parameters, depending upon whether the \ifun{_base64_encoder_new} function
+  was called with the optional \exmp{func_data} argument.  If
+  \exmp{func_data} was passed, then it will be passed as the first
+  argument to the callback function.  The (partially) encoded string
+  is passed as the last argument.  The callback function shall return
+  nothing.
+\example
+  The following example defines a function that base64 encodes a string.
+#v+
+   private define encode_callback (strp, encoded_str)
+   {
+     @strp = @strp + encoded_str;
+   }
+
+   define b64encode_string (bstr)
+   {
+     variable s = "";
+     variable b64 = _base64_encoder_new (&encode_callback, &s);
+     _base64_encoder_accumulate (b64, bstr);
+     _base64_encoder_close (b64);
+     return b;
+   }
+#v-
+\example
+  The following example takes data from an input file pointer
+  \exmp{fpin} and writes the encoded data to an output file pointer
+  \exmp{fpout}:
+#v+
+   private define encoder_callback (fpout, encoded_data)
+   {
+      () = fputs (encoded_data, fpout);
+   }
+
+   define define base64_encode_file (fpin, fpout)
+   {
+      variable b64 = _base64_encoder_new (&encoder_callback, fpout);
+      variable bytes;
+      while (-1 != fread_bytes (&bytes, 512, fpin))
+        _base64_encoder_accumulate (b64, bytes);
+      _base64_encoder_close (b64);
+   }
+#v-
+\seealso{_base64_encoder_accumulate, _base64_encoder_close, _base64_decoder_new}
+\done
+
+\function{_base64_encoder_close}
+\synopsis{Flush and delete a base64 encoder}
+\usage{_base64_encoder_close (Base64_Type b64)}
+\description
+  This function must be called when there is no more data for the
+  specified base64 encoder to process.  See the documentation for
+  \ifun{_base64_encoder_new} for additional information and usage.
+\seealso{_base64_encoder_new, _base64_encoder_accumulate, _base64_decoder_close}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm/chksumfuns.tm Added

@@ -0,0 +1,43 @@
+\function{md5sum}
+\synopsis{Compute an MD5 sum for a string}
+\usage{String_Type md5sum (BString_Type bstr)}
+\description
+  The \ifun{md5sum} function computes the MD5 checksum for the
+  specified binary string.  The function returns a string representing
+  the hexadecimal representation of the checksum.
+\seealso{md5sum_file, sha1sum}
+\done
+
+\function{md5sum_file}
+\synopsis{Compute the MD5 sum for the contents of a file}
+\usage{String_Type md5sum_file (String_Type|File_Type f)}
+\description
+  The \ifun{md5sum_file} computes the MD5 sum on the contents of a
+  file.  The file may either be specified as a string giving the name
+  of the file, or as an open stdio \dtype{File_Type} pointer.  The
+  function returns a string representing the hexadecimal
+  representation of the checksum.
+\seealso{md5sum, sha1sum_file, sha1sum}
+\done
+
+\function{sha1sum}
+\synopsis{Compute the SHA1 sum for a string}
+\usage{String_Type sha1sum (BString_Type bstr)}
+\description
+  The \ifun{sha1sum} function computes the SHA1 checksum for the
+  specified binary string.  The function returns a string representing
+  the hexadecimal representation of the checksum.
+\seealso{sha1sum_file, md5sum}
+\done
+
+\function{sha1sum_file}
+\synopsis{Compute the SHA1 sum for the contents of a file}
+\usage{String_Type sha1sum_file (String_Type|File_Type f)}
+\description
+  The \ifun{sha1sum_file} computes the SHA1 sum on the contents of a
+  file.  The file may either be specified as a string giving the name
+  of the file, or as an open stdio \dtype{File_Type} pointer.  The
+  function returns a string representing the hexadecimal
+  representation of the checksum.
+\seealso{sha1sum, md5sum_file, md5sum}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm/csvfuns.tm Added

@@ -0,0 +1,358 @@
+\function{csv_decoder_new}
+\synopsis{Instantiate a parser for CSV data}
+\usage{obj = csv_decoder_new (filename|File_Type|Strings)}
+\description
+  This function instantiates an object that may be used to parse and
+  read so-called comma-separated-value (CSV) data.  It requires a
+  single argument, which may be the name of a file, an open file
+  pointer, or an array of strings.
+\qualifiers
+\qualifier{delim}{character used for the delimiter}{','}
+\qualifier{quote}{character used for the quoting fields}{'"'}
+\qualifier{skiplines}{number of lines to skip before parsing}{0}
+\qualifier{comment}{lines beginning with this string will be skipped}
+\qualifier{blankrows}{default for how blank rows should be handled}{"skip"}
+\methods
+\method{readrow}{Read and parse a row from the CSV object}
+\method{readcol}{Read one or more columns from the CSV object}
+\example
+  See the documentation for the \sfun{csv.readcol} and
+  \sfun{csv.readrow} methods for examples.
+\notes
+  The current implementation assumes the CSV format specified according
+  to RFC 4180.
+
+  It is important to understand the difference between a ROW and a LINE
+  in a CSV formatted file: a row may span more than one line in a file.
+  The \exmp{skiplines} qualifier specifies the number of LINES to be
+  skipped, not ROWS.
+
+  CSV files have no notion of data-types: all field values are strings.
+  For this reason, the \exmp{type} qualifier introduces an extra layer
+  that is not part CSV format.
+\seealso{csv.readcol, csv.readrow}
+\done
+
+\function{csv.readcol}
+\synopsis{Read one or more columns from a CSV file}
+\usage{datastruct = csv.readcol(columns)}
+\description
+  This function method may be used to read one or more columns from a
+  comma-separated-value file.  If passed with no arguments, all columns
+  of the file will be returned.  Otherwise, only those columns
+  specified by the columns argument will be returned.
+
+  The return value is a structure with fields that correspond to the
+  desired columns.  The default is for the structure to have field
+  names \exmp{col1}, \exmp{col2}, etc., where the integer suffix
+  specifies the column number.  The \exmp{fields} and \exmp{header}
+  qualifiers may be used to specify a different set of names.
+\qualifiers
+  \qualifier{fields}{An array of field names to use for the returned structure}
+  \qualifier{header}{Array of strings that correspond to the header row}
+  \qualifier{type}{An scalar or array type-specifier, see below}
+  \qualifier{typeN}{Type-specifier for column N}
+  \qualifier{snan}{String value to use for an empty string element}{""}
+  \qualifier{inan}{Integer value to use for an empty integer element}{0}
+  \qualifier{lnan}{Long int value to use for an empty long int element}{0L}
+  \qualifier{fnan}{Float value to use for an empty float element}{_NaN}
+  \qualifier{dnan}{Double value to use for an empty double element}{_NaN}
+  \qualifier{nanN}{Value used for an empty element in the column N}
+  \qualifier{blankrows}{How a blank row should be handled}{"skip"}
+
+  The type-specifier is used to specify the type of a field.  It must
+  be one of the following characters:
+#v+
+     's' (String_Type)
+     'i' (Int_Type)
+     'l' (Long_Type)
+     'f' (Float_Type)
+     'd' (Double_Type)
+#v-
+  If the value of the \exmp{type} qualifier is scalar, then all
+  columns will default to use the corresponding type.  If different
+  types are desired, then an array of type-specifiers may be used.
+  The length of the array must be the same as the number of columns to
+  be returned.  The \exmp{typeN} qualifier may be used to give the
+  type of column N.
+
+  If the \exmp{columns} argument is string-valued, then the
+  \exmp{header} qualifier must be supplied to provide a mapping
+  from column names to column numbers.  If it is present, it will also
+  be used to give normalized field names to the returned structure.
+  For normalization, the column name is first lower-cased, then all
+  non-alphanumeric values are converted to "_",  and excess underscore
+  characters removed.
+
+  See the documentation for the \sfun{csv.readrow} for more
+  information about how blank rows should be handled.
+\example
+  Suppose that \file{data.csv} is a file that contains
+#v+
+    # The data below are from runs 6 and 7
+    x,y,errx,erry,Notes - or - Comments
+    10.2,0.5,,0.1,
+    13.4,0.9,0.1,0.16,
+    20.7,18.2,,0.3,Vacuum leak in beam line
+    29.6,1.3,,0.31,
+    31.2,1.2,0.11,0.33,"This data point
+    taken from run 7"
+#v-
+  This file consists of 8 lines and forms a CSV file with 6 rows.
+  The first row consists of a single column, and the subsequent rows of
+  consist of 5 columns. columns.  Note that the last row is split
+  across two lines.  The row with the single column will be regarded as
+  a comment in what follows.
+
+  The first step is to instantiate a parser object using:
+#v+
+    csv = csv_decoder_new ("data.csv" ;comment="#");
+#v-
+  The use of the \exmp{comment} qualifier will cause all lines
+  beginning with \exmp{"#"} to be skipped.  Alternatively, the first
+  line could have been skipped using
+#v+
+    csv = csv_decoder_new ("data.csv" ;skiplines=1);
+#v-
+  The second row (also second line) in the file is the header line:
+  it gives the names of the columns.  It may be read using
+#v+
+    header = csv.readrow ();
+#v-
+  The rest of the file consists of the data values.  We want to read
+  the first 4 columns as single precision (\dtype{Float_Type}) values,
+  and the 5th as a string.  One way to do this is
+#v+
+    table = csv.readcol (;type='f','f','f','f','s');
+#v-
+  This will result in \exmp{table} set to a structure of the form
+#v+
+   struct { col1 = Float_Type5,
+            col2 = Float_Type5,
+            col3 = Float_Type5,
+            col4 = Float_Type5,
+            col5 = String_Type5
+          }
+#v-
+  The same result could also have been achieved using
+#v+
+    table = csv.readcol (;type='f', type5='s');
+#v-
+  If the \exmp{header} qualifier is used, then
+#v+
+    table = csv.readcol (;type='f', type5='s', header=header);
+#v-
+  would produce the structure
+#v+
+   struct {x=Float_Type5,
+           y=Float_Type5,
+           errx=Float_Type5,
+           erry=Float_Type5,
+           notes_or_comments=String_Type5
+          }
+#v-
+  Note how the "Notes -or- Comments" value was normalized.
+
+  To read just the \exmp{x} and \exmp{y} columns, either of the
+  following may be used:
+#v+
+    table = csv.readcol (1,2 ;type='f');
+    table = csv.readcol ("x","y" ;type='f', header=header);
+#v-
+  The \exmp{header} qualifier was required in the last form to map the
+  column names to numbers.
+\seealso{csv_decoder_new, csv_readcol, readascii}
+\done
+
+\function{csv.readrow}
+\synopsis{Read a row from a CSV file}
+\usage{row = csv.readrow ()}
+\description
+  The \exmp{csv.readrow} function method may be used to read the next
+  row from the underlying CSV (comma-separated-value) parser object.
+  The object must have already been instantiated using the
+  \sfun{csv_decoder_new} function.  It returns the row data in the form
+  of an array of strings.  If the end of input it reached, \NULL will
+  be returned.
+\qualifiers
+\qualifier{blankrows}{How a blank row should be handled}{"skip"}
+
+  The \exmp{blankrows} qualifier is used to specify how a blank row
+  should be handled.  A blankrow is defined as a row made up of no
+  characters except for the newline or carriage-return sequence.  For
+  example, the following 9 lines has one blank row that occurs on
+  line 8:
+#v+
+     "12.3"
+     "4
+
+     5"
+     "5.1"
+     ""
+     "7.2"
+
+     "6.2"
+#v-
+  If the value of \exmp{"blankrow"} is \exmp{"skip"}, then blank rows
+  will be ignored by the parser.  If the value is \exmp{"stop"}, then the row
+  will be returned as an empty array of strings (length equal to 0).
+  Otherwise the row will be treated as if it contained the empty
+  string and returned as an array of length 1 with a value of "".
+  The default behavior is to skip such rows.
+\seealso{csv_decoder_new, csv.readcol, csv_readcol}
+\done
+
+\function{csv_readcol}
+\synopsis{Read one or more columns from a CSV file}
+\usage{Struct_Type csv_readcol (file|fp ,columns ;qualifiers)}
+\description
+  This function may be used to read one or more of the columns in the specified
+  CSV file.  If the \exmp{columns} argument is present, then only those
+  columns will be read; otherwise all columns in the file will be read.
+  The columns will be returned in the form of a structure.
+\qualifiers
+  This function supports all of the qualifiers supported by the
+  \sfun{csv_decoder_new} function and the \sfun{csv.readcol} method.
+  In addition, if the \exmp{has_header} qualifier is present, the first
+  line processed (after skipping any lines implied by the
+  \exmp{skiplines} and \exmp{comment} qualifiers) will be regarded as
+  the header.
+
+  If the \exmp{rdb} qualifier is present, then assume that the file is
+  in the so-called RDB file format.  This is a tab-delimited format
+  that consists of a line that contains the names of the fields,
+  followed by a line that specifies the data types of the columns.
+\example
+#v+
+   data = csv_readcol ("mirror.csv" ;comment="#", has_header, delim='|');
+   data = csv_readcol ("foo.rdb" ; rdb);
+#v-
+\seealso{csv_decoder_new, csv.readcol, csv.readrow, csv.writecol, csv_encoder_new}
+\done
+
+\function{csv_encoder_new}
+\synopsis{Create an object for writing CSV files}
+\usage{csv = csv_encoder_new ()}
+\description
+  The \sfun{csv_encoder_new} function returns an object that may
+  be used for creating a CSV file.
+\qualifiers
+\qualifier{delim}{Character used for the field delimiter}{','}
+\qualifier{quote}{Character used for quoting fields}{'"'}
+\qualifier{quoteall}{Quote all field values}
+\qualifier{quotesome}{Quote only those fields where quoting is necessary}
+\methods
+\method{writecol}{write one or more columns to a file.  For more information
+  about this method, see the documentation for \sfun{csv.writecol}}.
+\example
+    x = 0:2*PI:#100;
+    csv = csv_encoder_new (;delim='|');
+    csv.writecol ("sinx.csv", x, sin(x) ; names="x", "sin of x");
+\notes
+  The \ifun{set_float_format} function may be used to specify the
+  format used where writing floating point numbers to the CSV file.
+\seealso{csv_writecol, csv_encoder_new, csv_readcol}
+\done
+
+\function{csv_writecol}
+\synopsis{Write to a file using a CSV format}
+\usage{csv_writecol(file|fp, datalist | datastruct | col1,...,colN)}
+\description
+  This function write a one or more data columns to a file or open
+  file descriptor using a comma-separated-value format.  The data
+  values may be expressed in several ways: as a list of a column
+  values (\exmp{datalist}), a structure whose fields specify the
+  column values (\exmp{datastruct}), or passed explicitly as
+  individual values (\exmp{col1},...\exmp{colN}).
+\qualifiers
+\qualifier{delim}{character used for the delimiter}{','}
+\qualifier{names}{An array of strings used to name the columns}
+\qualifier{noheader}{Do not write a header to the file}
+\qualifier{quote}{character used for the quoting fields}{'"'}
+\qualifier{quoteall}{Quote all field values}
+\qualifier{quotesome}{Quote only those fields where quoting is necessary}
+\qualifier{rdb}{Write in an rdb-style TAB delimited format}
+
+  Unless the \exmp{noheader} qualifier is given, a header containing
+  the names of the columns will be written if either the \exmp{names}
+  qualifier is present, or the data values are passed as a structure.
+  In the latter case, the structure field names will be used for the
+  column names.
+
+  The function will throw an \exc{IOError} exception if a write error occurs.
+\example
+  For the purposes of this example, assume that three arrays are
+  given: \exmp{time}, \exmp{temp}, \exmp{humidity}, which represent a
+  time series of temperature and humidity.  Here are three equivalent
+  ways of writing the arrays to a CSV file:
+#v+
+     % Via a structure
+     data = struct {time=time, temperature=temp, humidity=humidity};
+     csv_writecol ("weather.dat", data);
+
+     % Via a list
+     data = {time, temp, humidity};
+     csv_writecol ("weather.dat", data
+                   ;names="time","temperature","humidity");
+
+     % Via explicit arguments
+     csv_writecol ("weather.dat", time, temp, humidity
+                   ;names="time","temperature","humidity");
+#v-
+\notes
+  This function is a simple wrapper around \sfun{csv_encoder_new} and
+  \exmp{csv.writecol}.
+\seealso{csv_encoder_new, csv.writecol, csv_readcol}
+\done
+
+\function{csv.writecol}
+\synopsis{Write to a file using a CSV format}
+\usage{csv.writecol(file|fp, datalist | datastruct | col1,...,colN)}
+\description
+  The \exmp{csv.writecol} function method may be used to write one of
+  more data columns to a file or file descriptor via a CSV encoder
+  object instantiated using the \sfun{csv_encoder_new} function.
+
+  The data values may be expressed in several ways: as a list of a
+  column values (\exmp{datalist}), a structure whose fields specify
+  the column values (\exmp{datastruct}), or passed explicitly as
+  individual values (\exmp{col1},...\exmp{colN}).
+
+  An \exc{IOError} exception will be thrown if a write error occurs.
+
+\qualifiers
+\qualifier{delim}{character used for the delimiter}{','}
+\qualifier{names}{An array of strings used for names of the columns}
+\qualifier{noheader}{Do not write a header to the file}
+\qualifier{quoteall}{Quote all field values}
+\qualifier{quotesome}{Quote only those fields where quoting is necessary}
+\qualifier{rdb}{Write in an rdb-style TAB delimited format}
+
+  Unless the \exmp{noheader} qualifier is given, a header containing
+  the names of the columns will be written if either the \exmp{names}
+  qualifier is present, or the data values are passed as a structure.
+  In the latter case, the structure field names will be used for the
+  column names.
+\example
+  For the purposes of this example, assume that three arrays are
+  given: \exmp{time}, \exmp{temp}, \exmp{humidity}, which represent a
+  time series of temperature and humidity.  Here are three equivalent
+  ways of writing the arrays to a TAB delimited file:
+#v+
+     csv = csv_encoder_new (;quote='\t');
+
+     % Via a structure
+     data = struct {time=time, temperature=temp, humidity=humidity};
+     csv.writecol ("weather.dat", data);
+
+     % Via a list
+     data = {time, temp, humidity};
+     csv.writecol ("weather.dat", data
+                   ;names="time","temperature","humidity");
+
+     % Via explicit arguments
+     csv.writecol ("weather.dat", time, temp, humidity
+                   ;names="time","temperature","humidity");
+#v-
+\seealso{csv_encoder_new, csv_writecol, csv_readcol}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm/forkfuns.tm Added

@@ -0,0 +1,143 @@
+\function{fork}
+\synopsis{Create a new process via the fork system function}
+\usage{Int_Type fork ()}
+\description
+ The \ifun{fork} function creates a new child process via the
+ \exmp{fork} system function.  See the approriate documentation for
+ the actual semantics involved such as what is preserved in the child
+ process.  Upon sucess, the function returns a value that is greater
+ than 0 to the parent process that represents the child process's id.
+ It will return 0 to the child process.  If the fork function fails, a
+ value of -1 will be returned and \ivar{errno} set accordingly.
+\example
+ The following example creates a child process to invoke the ``ls''
+ command on a Unix system.  It also illustrates the low-level nature
+ of the \ifun{fork} and related system calls.
+#v+
+    define ls ()
+    {
+       variable pid = fork ();
+       if (pid == -1)
+         throw OSError, "fork failed: " + errno_string(errno);
+
+       if ((pid == 0)
+            && (-1 == execvp ("ls", "ls", "-l")))
+         {
+           () = fprintf (stderr, "execvp failed: " + errno_string(errno));
+           _exit (1);
+         }
+
+       forever
+         {
+           variable status = waitpid (pid, 0);
+           if (status == NULL)
+             {
+               if (errno == EINTR) continue;
+               throw OSError, "waitpid failed: " + errno_string(errno);
+             }
+           return status.exit_status;
+         }
+     }
+#v-
+\seealso{waitpid, execv, execvp, execve, _exit, system}
+\done
+
+\function{execve, execv, execvp}
+\synopsis{Execute a new process}
+\usage{Int_Type execve(path, argv, envp)}
+#v+
+  Int_Type execvp(path, argv)}
+  Int_Type execv(path, argv)}
+#v-
+\description
+  The \ifun{execv} family of functions overlay the current process
+  with a new process that corresponds to the program specified by the
+  \exmp{path} argument.  If for some reason the function fails, a
+  value of -1 will be returned with \ivar{errno} set accordingly.
+  Normally the function will not return.
+
+  The \exmp{argv} parameter is an array of strings that will
+  correspond to the argument list used when invoking the program.  For
+  example, if the invoked program is a C program, the \exmp{argv}
+  parameter will correspond to the C program's argv-list.
+
+  The \ifun{execve} function takes an array of strings that will be
+  used to initialize the environment of the overlayed program.
+
+  The \ifun{execvp} function will mimick the actions \exmp{/bin/sh} when
+  searching for the executable file.
+\notes
+  These function are wrappers around the corresponding system library
+  functions.  See the system documentation for more information.
+\seealso{execve, execvp, system, fork, _exit}
+\done
+
+\function{_exit}
+\synopsis{Exit the current processes}
+\usage{_exit(Int_Type status)}
+\description
+  Like the related \ifun{exit} function, \ifun{_exit} may be used to
+  terminate the current process.  One of the differences between the two
+  functions is that the \ifun{_exit} will not invoke various ``atexit''
+  handlers that are normally run when a program is terminated.  See
+  the system-specific C runtime library documentation for more
+  information about this function.
+
+  The main use of the \ifun{_exit} function is after the failure of
+  one of the \ifun{execv} functions in a child process.
+\seealso{fork, execv, execvp, execve, waitpid, exit}
+\done
+
+\function{waitpid}
+\synopsis{Wait for a specified process}
+\usage{Struct_Type waitpid (pid, options)}
+\description
+  The \exmp{waitpid} function will cause the calling process to wait
+  for the child process whose process id is \exmp{pid} to change its
+  state, e.g., exit.  It returns information about the process in the
+  form of a structure with the following fields:
+#v+
+    pid           The process-id of the child process, 0 if the process
+                    has not changed state.
+    exited        Non-zero if the child exited normally.
+    exit_status   The exit status of the child.  This field is
+                    meaninful only if the exited field is non-zero.
+    signal        Non-zero of the child was terminated by a signal.
+                    The value of this field is that of the signal.
+    coredump      Non-zero if the child produced a core-dump as the
+                    result of termination by a signal.
+    stopped       Non-zero if the child was stopped via a signal.  The
+                    value is that of the signal that stopped it.
+    continued     Non-zero if the process was continued.
+#v-
+
+  Upon error, the function will return \NULL and set \ifun{errno}
+  accordingly.
+
+  The value of the \exmp{options} parameter is the bitwise-or of one
+  of the following values:
+#v+
+    WNOHANG      causes waitpid to return immediately if the child has
+                  not terminated.  In this case, the value of the pid
+                  field will be 0 if the child is still running.
+
+    WUNTRACED    (see semantics in the OS documentation)
+    WCONTINUED   (see semantics in the OS documentation)
+#v-
+\example
+#v+
+   s = waitpid (pid, WNOHANG);
+   if (s == NULL)
+     throw OSError, "waitpid failed: " + errno_string ();
+   if (s.pid == 0)
+     message ("The child is still running");
+   else if (s.exited)
+     vmessage ("child exited with status %d", s.exit_status);
+   else if (s.signal)
+     {
+        vmessage ("child terminated by signal %d %s",
+                  s.signal, (s.coredump ? "(coredump)" : ""));
+     }
+#v-
+\seealso{fork, new_process}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm/histfuns.tm Added

@@ -0,0 +1,162 @@
+\function{hist1d}
+\synopsis{Compute a 1-d histogram}
+\usage{h = hist1d (h, pnts, grid , &rev)}
+\description
+ The \ifun{hist1d} function bins a set of points \exmp{pnts} into a
+ 1-d histogram using bin-edges given by the grid argument. The
+ optional last argument \exmp{&rev} is a reference to a variable
+ whose value will be assigned the reverse-indices of the histogram. 
+ 
+ The first argument \exmp{h} is optional. If present and non-NULL, it
+ will be used as the histogram buffer with new binned values added to
+ it. That is, the following statements are equivalent:
+#v+
+ h = h + hist1d (pnts, grid);
+ h = hist1d (h, pnts, grid);
+#v-
+
+ The value of the ith bin in the histogram is given by the number of
+ values in the \exmp{pnts} array that satisfy
+ \exmp{gridi<=X<gridi+1} where \exmp{X} represents the value of
+ the candidate point. The last bin of the histogram represents an
+ overflow bin with the right bin edge at plus infinity. The grid is
+ required to be sorted into ascending order.
+
+ The reverse-indices array is an array-of-arrays of indices such that
+ \exmp{revi} is an array of indices into the \exmp{pnts} array that
+ have fallen into the ith bin.
+\seealso{hist1d_rebin, hist2d, hist2d_rebin, hist_bsearch}
+\done
+
+\function{hist2d}
+\synopsis{Compute a 2-d histogram}
+\usage{h = hist2d (h, xpnts, ypnts, xgrid, ygrid , &rev)}
+\description
+ The \ifun{hist2d} function bins a set of \exmp{(x,y)} pairs
+ represented by the \exmp{xpnts} and \exmp{ypnts} arrays into a 2-d
+ histogram using bin-edges given by the \exmp{xgrid} and \exmp{ygrid}
+ arguments. The optional last argument \exmp{&rev} is a reference to
+ a variable whose value will be assigned the reverse-indices of the
+ histogram. The first argument is also optional and, if present and
+ non-NULL, will be used for the histogram values.
+
+ The value of the bin \exmp{i,j} of the histogram is given by the
+ number of (X,Y) pairs that satisfy \exmp{xgridi<=X<xgridi+1} and
+ \exmp{ygridj<=Y<ygridj+1}. The bins at the extreme edges of the
+ histogram represent overflow bins with the upper bin edge at plus
+ infinity. The grids are required to be sorted into ascending order.
+
+ The reverse-indices array is a 2-d array-of-arrays of indices such that
+ \exmp{revi,j} is an array of indices into the \exmp{xpnts} and
+ \exmp{ypnts} arrays that have fallen into the bin \exmp{i,j}.
+
+\seealso{hist1d, whist2d, hist2d_rebin, hist1d_rebin, hist_bsearch}
+\done
+
+
+\function{hist1d_rebin}
+\synopsis{Rebin a 1-d histogram}
+\usage{new_h = hist1d_rebin (new_grid, old_grid, old_h)}
+\description
+ The \ifun{hist1d_rebin} function rebins a histogram \exmp{old_h}
+ with bin edges defined by \exmp{old_grid} into a histogram with bin
+ edges given by \exmp{new_grid}. The rebinning operation preserves
+ the normalization of the histogram where the grids overlap.
+
+ Unlike the \exmp{hist1d} function which returns an integer array,
+ the \exmp{hist1d_rebin} function returns an array of doubles since
+ the new grid does not have to be commensurate with the old grid.
+\seealso{hist1d, hist2d_rebin, hist2d, hist_bsearch}
+\done
+
+\function{hist2d_rebin}
+\synopsis{Rebin a 2-d histogram}
+\usage{new_h = hist2d_rebin (new_xgrid, new_ygrid, old_xgrid, old_ygrid, old_h)}
+\description
+ The \ifun{hist2d_rebin} function rebins a 2-d histogram \exmp{old_h}
+ with bin edges defined by \exmp{old_xgrid} and \exmp{old_ygrid} into
+ a 2-d histogram with bin edges given by \exmp{new_xgrid} and
+ \exmp{new_ygrid}.
+ 
+ Unlike the \exmp{hist2d} function which returns an integer array,
+ the \exmp{hist2d_rebin} function returns an array of doubles since
+ the new grids do not have to be commensurate with the old grids.
+\seealso{hist1d_rebin, hist2d, whist2d, hist_bsearch}
+\done
+
+\function{hist_bsearch}
+\synopsis{Perform a binary search}
+\usage{i = hist_bsearch (x, xbins)}
+\description
+ The \ifun{hist_bsearch} function performs a binary search for the
+ bin \exmp{i} satisfying \exmp{xbinsi<=x<xbinsi+1}. If the value
+ \exmp{x} is greater than or equal to the value of the last bin, the
+ index of the last bin will be returned. If \var{x} is smaller than
+ the value of the first bin (\exmp{xbins0}), then the function will
+ return the index of the first bin, i.e., \exmp{0}. The grid is
+ required to be sorted into ascending order.
+
+ If the value of \exmp{x} is an array, an array of indices will be
+ returned.
+\notes
+ As pointed out above, if the value of \exmp{x} is less than the value
+ of the first bin, the index of the first bin will be returned even
+ though \exmp{x} does not belong to the bin. If this behavior is not
+ desired, then such points should be filtered out before the binary
+ search is performed.
+\seealso{hist1d, hist1d_rebin}
+\done
+
+
+\function{whist1d}
+\synopsis{Created a weighted 1-d histogram}
+\usage{h = whist1d (pnts, wghts, grid ,&rev ,&weight_func}
+\description
+ The \ifun{whist1d} function creates a 1-dimensional weighted
+ histogram. The value of the ith bin in the histogram is given by a
+ function applied to values of the \exmp{wghts} that correspond to
+ those values in the \exmp{pnts} array that satisfy
+ \exmp{gridi<=X<gridi+1} where \exmp{X} represents the value of
+ the candidate point. The last bin of the histogram represents an
+ overflow bin with the right bin edge at plus infinity. The grid is
+ required to be sorted into ascending order.
+ 
+ If the optional fourth argument \exmp{&rev} is present, upon return
+ it will be set to the array of reverse-indices of the histogram. The
+ optional \exmp{&weight_func} argument may be used to specify the
+ function to be applied to the weights array. By default, the
+ \ifun{sum} function will be used.
+\notes
+ The source code to this function may be found in \file{histogram.sl}.
+ As such, it is available only after this file has been loaded.
+ Simply importing the module will not load this function into the
+ interpreter.
+\seealso{hist1d, whist2d, hist1d_rebin}
+\done
+
+\function{whist2d}
+\synopsis{Created a weighted 2-d histogram}
+\usage{h = whist2d (xpnts, ypnts, wghts, xgrid, ygrid ,&rev ,&weight_func}
+\description
+ The \ifun{whist2d} function creates a 2-dimensional weighted
+ histogram. The value of the bin \exmp{i,j} of the histogram is
+ given by a function applied to those values in the \exmp{wghts} array
+ that correspond to the (X,Y) pairs that satisfy
+ \exmp{xgridi<=X<xgridi+1} and \exmp{ygridi<=Y<ygridi+1}. The
+ bins at the extreme edges of the histogram represent overflow bins
+ with the upper bin edge at plus infinity. The grids are required to
+ be sorted into ascending order.
+ 
+ If the optional sixth argument \exmp{&rev} is present, upon return
+ it will be set to the array of reverse-indices of the histogram. The
+ optional \exmp{&weight_func} argument may be used to specify the
+ function to be applied to the weights array. By default, the
+ \ifun{sum} function will be used.
+\notes
+ The source code to this function may be found in \file{histogram.sl}.
+ As such, it is available only after this file has been loaded.
+ Simply importing the module will not load this function into the
+ interpreter.
+\seealso{hist2d, whist1d, hist1d, hist2d_rebin}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm/jsonfuns.tm Added

@@ -0,0 +1,85 @@
+\function{json_decode}
+\synopsis{Parse JSON text into an S-Lang data structure}
+\usage{json = json_decode (String_Type text)}
+\description
+  The \ifun{json_decode} function parses JSON data from the input
+  string, and returns a corresponding S-Lang data structure.
+  JSON values are represented as follows:
+#v+
+    JSON   -> S-Lang
+
+    object    Struct_Type
+    array     List_Type
+    string    String_Type or BString_Type
+    number    (L)Long_Type or Double_Type
+    `true'    UChar_Type ('\1')
+    `false'   UChar_Type ('\0')
+    `null'    Null_Type
+#v-
+  The S-Lang structure corresponding to a JSON object
+  with duplicate keys has no duplicate field names,
+  but the field value is given by the last JSON value.
+
+  If the input string does not contain valid JSON data,
+  or if numeric values cannot be represented within \slang,
+  or if JSON objects and/or arrays are too deeply nested,
+  a \exmp{Json_Parse_Error} is thrown.
+\seealso{json_encode}
+\done
+
+\function{json_encode}
+\synopsis{Generate JSON text from an S-Lang data structure}
+\usage{String_Type text = json_encode (json)}
+\description
+  The \ifun{json_encode} function generates the JSON text
+  that corresponds to the S_Lang data structure \exmp{json}.
+  Valid input types -- i.e., those that generate text
+  that can be parsed by \ifun{json_decode} -- are \dtype{Struct_Type}
+  (for JSON objects) and \dtype{List_Type} or \dtype{Array_Type} (for
+  JSON arrays), provided that these containers contain
+  only the following types:
+#v+
+    S-Lang                         -> JSON
+
+    Struct_Type                       object
+    List_Type or Array_Type           array
+    String_Type or BString_Type       string
+    UChar_Type ('\1')                 `true'
+    UChar_Type ('\0')                 `false'
+    other non-complex numeric types   number
+    Null_Type                         `null'
+#v-
+  Invalid input causes a \exmp{Json_Invalid_Json_Error}.
+
+  Optional whitespace in the output text can be configured
+  by the \exmp{pre_nsep}, \exmp{post_nsep}, \exmp{pre_vsep}, and \exmp{post_vsep}
+  qualifiers. (Only strings built from ' ', '\\t', '\\n',
+  or '\\r' are allowed. Other characters are ignored.)
+  If present, all whitespace after the final "\\n"
+  in \exmp{post_vsep} is considered as extra indentation,
+  which accumulates for nested objects and arrays.
+
+\qualifiers
+\qualifier{pre_nsep=str}{whitespace before name separator ':'
+                    in objects}{""}
+\qualifier{post_nsep=str}{whitespace after name separator ':'
+                     in objects}{""}
+\qualifier{pre_vsep=str}{whitespace before value separator ','
+                    in objects or arrays}{""}
+\qualifier{post_vsep=str}{whitespace after value separator ',',
+                     after the opening, and before
+                     the closing brackets in objects
+                     or arrays}{""}
+
+\example
+#v+
+  % some whitespace and indentation after separators:
+  json_encode (json; pre_nsep="", post_nsep=" ",
+                     pre_vsep="", post_vsep="\n  ")
+
+  % yet more whitespace around separators:
+  json_encode (json; pre_nsep=" ", post_nsep="  ",
+                     pre_vsep=" ", post_vsep="\n\t")
+#v-
+\seealso{json_decode}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm/modfuns.tm Added

@@ -0,0 +1,160 @@
+#% -*- mode: tm; mode: fold; -*-
+#%{{{Macros
+
+#i linuxdoc.tm
+
+#d function#1 \sect{<bf>$1</bf>\label{$1}}<descrip>
+#d variable#1 \sect{<bf>$1</bf>\label{$1}}<descrip>
+#d datatype#1 \sect{<bf>$1</bf>\label{$1}}<descrip>
+
+#d qualifier#2:3 <tt>$1</tt> : $2\ifarg{$3}{ (Default: <tt>$3</tt>)}
+#d method#2 <tt>$1</tt> : $2
+#d synopsis#1 <tag> Synopsis </tag> $1
+#d keywords#1 <tag> Keywords </tag> $1
+#d usage#1 <tag> Usage </tag> <tt>$1</tt>
+#d methods <tag> Methods </tag>
+#d description <tag> Description </tag>
+#d qualifiers <tag> Qualifiers </tag>
+#d example <tag> Example </tag>
+#d notes <tag> Notes </tag>
+#d seealso#1 <tag> See Also </tag> <tt>$1</tt>
+#d r#1 \ref{$1}{$1}
+#d done </descrip>
+#d -1 <tt>-1</tt>
+#d 0 <tt>0</tt>
+#d 1 <tt>1</tt>
+#d 2 <tt>2</tt>
+#d 3 <tt>3</tt>
+#d 4 <tt>4</tt>
+#d 5 <tt>5</tt>
+#d 6 <tt>6</tt>
+#d 7 <tt>7</tt>
+#d 8 <tt>8</tt>
+#d 9 <tt>9</tt>
+#d NULL <tt>NULL</tt>
+#d documentstyle book
+
+#d slang \bf{S-Lang}
+
+#d exc#1 \tt{$1}
+#d kw#1 \tt{$1}
+#d exmp#1 \tt{$1}
+#d var#1 \tt{$1}
+#d ctype#1 \tt{$1}
+#d cfun#1 \tt{$1}
+#d ivar#1 \tt{$1}
+#d ifun#1 \tt{$1}
+#d icon#1 \tt{$1}
+#d sfun#1 \tt{$1}
+#d exfile#1 \tt{$1}
+#d exns#1 \tt{$1}
+#d exstr#1 \tt{"$1"}
+#d module#1 \tt{$1}
+#d dtype#1 \tt{$1}
+#d file#1 \tt{$1}
+
+#%}}}
+
+\linuxdoc
+\begin{\documentstyle}
+
+\title S-Lang Module Reference (version 2.3)
+\author John E. Davis <www.jedsoft.org>
+\date \__today__
+
+\toc
+
+\chapter{Introduction}
+
+#d doc_root_url http://www.jedsoft.org/slang/doc
+#d ifun_doc_url \doc_root_url/html/slangfun.html
+#d moduleurl http://www.jedsoft.org/slang/modules/
+
+This document describes the functions that are available via the
+modules that are distributed with the \slang library. A more complete
+list of modules may be found at \href{\moduleurl}{\moduleurl}.
+
+To utilize the functions in a model, the module must be loaded into
+the interpreter. This is most easily accomplished via the
+\sfun{require} function. For example, the \module{png} module may be
+loaded using:
+#v+
+ require ("png");
+#v-
+Sometimes it is desireable to load the module's functions into a
+separate namespace to avoid collisions, e.g.,
+#v+
+ require ("png", "PNG");
+#v-
+Then the \exmp{png_read} function may be called using
+\exmp{PNG->png_read}.
+
+\chapter{Base64 Module}
+This module provides a base64 encodear and decoder. Use
+\exmp{require("base64")} to load it.
+#i base64funs.tm
+
+\chapter{Checksum Module}
+This module provides a various routines for computing checksums.
+\exmp{require("chksum")} to load it.
+#i chksumfuns.tm
+
+\chapter{CSV Module}
+This module allows a \slang script to read and write
+comma-separated-value, tab-delimited files, etc. Use
+\exmp{require("csv")} to load it.
+#i csvfuns.tm
+
+\chapter{Fork Module}
+The \module{fork} module contains several low-level functions that may
+be used for subprocess creation. Use \exmp{require("fork")} to load it.
+#i forkfuns.tm
+
+\chapter{Histogram Module}
+This module has several functions for creating and manipulating
+histograms (binned data). Use \exmp{require("histogram")} to load it.
+#i histfuns.tm
+
+\chapter{JSON Module}
+This module encodes and decodes JSON (JavaScript Object Notation)
+formatted data. Use \exmp{require("json")} to load it.
+#i jsonfuns.tm
+
+\chapter{Oniguruma Regular Expression Module}
+This module provides an interface to the Oniguruma regular expression
+library. Use \exmp{require("onig")} to load it.
+#i onigfuns.tm
+
+\chapter{Perl Compatible Regular Expression Module}
+This module provides an interface to the PCRE library. It may be
+loaded using \exmp{require("pcre")}.
+#i pcrefuns.tm
+
+\chapter{Portable Network Graphics Module}
+The \module{png} module includes a number of functions for dealing
+with PNG images and colormaps. Use \exmp{require("png")} to load it.
+#i pngfuns.tm
+
+\chapter{Random Number Module}
+The \module{rand} module provides a number of random number functions.
+It may be loaded using \exmp{require("rand")}.
+#i randfuns.tm
+
+\chapter{Screen Management Module}
+The \module{slsmg} module provides access to SLsmg routines, which is
+an interface to platform indepented routines for manipulating the display
+on a terminal.
+It may be loaded using \exmp{require("slsmg")}.
+#i slsmg.tm
+
+\chapter{Socket Module}
+This module provides an interface to the POSIX socket functions. Use
+\exmp{require("socket")} to load it.
+#i sockfuns.tm
+
+\chapter{Statistics Module}
+This module has has a number of statistics functions. Use
+\exmp{require("stats")} to load it.
+#i statsfuns.tm
+
+\end{\documentstyle}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm/onigfuns.tm Added

@@ -0,0 +1,141 @@
+\function{onig_new}
+\synopsis{Create an instance of a regular-expression}
+\usage{Onig_Type onig_new (pattern ,options ,encoding ,syntax)}
+#v+
+   String_Type pattern;
+   Int_Type options;
+   String_Type encoding;
+   String_Type syntax;
+#v-
+\description
+ The \ifun{onig_new} function compiles the specified regular
+ expression (\exmp{pattern}) and returns the result.  The other
+ parameters are optional and may be used to specify compilation
+ options, the character-set encoding, and the regular expression
+ syntax. Upon success, this function returns an \dtype{Onig_Type}
+ object representing the compiled pattern.  If compilation fails, a
+ \exc{OnigError} exception will be thrown.
+
+ The \exmp{options} parameters is a bit mapped value that may be
+ formed from the bitwise-or of zero or more of the following constants:
+#v+
+   ONIG_OPTION_NONE
+   ONIG_OPTION_IGNORECASE
+   ONIG_OPTION_EXTEND
+   ONIG_OPTION_MULTILINE
+   ONIG_OPTION_SINGLELINE
+   ONIG_OPTION_FIND_LONGEST
+   ONIG_OPTION_FIND_NOT_EMPTY
+   ONIG_OPTION_NEGATE_SINGLELINE
+   ONIG_OPTION_DONT_CAPTURE_GROUP
+   ONIG_OPTION_CAPTURE_GROUP
+#v-
+
+ The character-set encoding may be specified using one of the
+ following strings:
+#v+
+  "ascii"         "iso_8859_1"     "iso_8859_2"   "iso_8859_3"
+  "iso_8859_4"    "iso_8859_5"     "iso_8859_6"   "iso_8859_7"
+  "iso_8859_8",   "iso_8859_9"     "iso_8859_10"  "iso_8859_11"
+  "iso_8859_13"   "iso_8859_14"    "iso_8859_15"  "iso_8859_16"
+  "utf8"          "utf16_be"       "utf16_le"     "utf32_be"
+  "utf32_le"      "euc_jp"         "euc_tw"       "euc_kr"
+  "euc_cn"        "sjis"           "koi8_r"       "cp1251"
+  "big5"          "gb18030"
+#v-
+ If not specified, "utf8" will be used if the interpreter is UTF-8
+ mode and "iso_8859_1" if not in UTF-8 mode.
+
+ The regular expression syntax of the pattern may be specified by
+ setting the \exmp{syntax} parameter to one of the following:
+#v+
+  "asis"    "posix_basic"  "posix_extended"  "emacs"
+  "grep"    "gnu_regex"    "java"            "perl"
+  "perl_ng" "ruby"
+#v-
+ If unspecified, the syntax defaults to \exmp{"perl"}.
+\seealso{onig_search, onig_nth_match, onig_nth_substr}
+\done
+
+\function{onig_search}
+\synopsis{Search a string using an Onig compiled pattern}
+\usage{Int_Type onig_search (p, str ,start_pos, end_pos ,option)}
+#v+
+   Onig_Type p;
+   String_Type str;
+   Int_Type start_pos, end_pos;
+#v-
+\description
+ The \ifun{onig_search} function applies a pre-compiled pattern \var{p} to a
+ string \ifun{str} and returns the result of the match.  The optional
+ third and fourth arguments may be used to constrain the search region
+ to the specified byte-offsets in the string.  The \exmp{option}
+ parameter is also optional and may be used to control how the search
+ is to be performed.  Its value may be specified as a bitwise-or of zero or
+ more of the following flags:
+#v+
+   ONIG_OPTION_NOTBOL
+   ONIG_OPTION_NOTEOL
+   ONIG_OPTION_POSIX_REGION
+#v-
+ See the onig library documentation for more information about the meaning
+ of these flags.
+
+ Upon success, this function returns a positive integer equal to 1 plus the
+ number of so-called captured substrings.  It will return 0 if the pattern
+ failed to match the string.
+\seealso{onig_new, onig_nth_match, onig_nth_substr}
+\done
+
+\function{onig_nth_match}
+\synopsis{Return the location of the nth match of an onig regular expression}
+\usage{Int_Type2 onig_nth_match (Onig_Type p, Int_Type nth)}
+\description
+ The \ifun{onig_nth_match} function returns an integer array whose
+ values specify the locations as byte-offsets to the beginning and end
+ of the \var{nth} captured substring of the most recent call to
+ \ifun{onig_search} with the compiled pattern.  A value of \var{nth}
+ equal to 0 represents the substring representing the entire match of
+ the pattern.
+
+ If the \var{nth} match did not take place, the function returns \NULL.
+\example
+ After the execution of:
+#v+
+    str = "Error in file foo.c, line 127, column 10";
+    pattern = "file (^,+), line (0-9+)";
+    p = onig_new (pattern);
+    if (onig_search (p, str))
+      {
+         match_pos = onig_nth_match (p, 0);
+         file_pos = onig_nth_match (p, 1);
+         line_pos = onig_nth_match (p, 2);
+      }
+#v-
+ \exmp{match_pos} will be set to \exmp{9,29}, \exmp{file_pos} to \exmp{14,19,}
+ and \exmp{line_pos} to \exmp{26,29}.  These integer arrays may be used to
+ extract the substrings matched by the pattern, e.g.,
+#v+
+     file = substr (str, file_pos0+1, file_pos1-file_pos0);
+     line = strline_pos0:line_pos1-1;
+#v-
+ Alternatively, the function \ifun{onig_nth_substr} may be used to get the
+ matched substrings:
+#v+
+     file = onig_nth_substr (p, str, 0);
+#v-
+\seealso{onig_new, onig_search, onig_nth_substr}
+\done
+
+\function{onig_nth_substr}
+\synopsis{Extract the nth matched substring from an Onig regular expression search}
+\usage{String_Type onig_nth_substr (Onig_Type p, String_Type str, Int_Type nth)}
+\description
+ This function may be used to extract the \var{nth} captured substring
+ resulting from the most recent use of the compiled pattern \var{p} by
+ the \ifun{onig_search} function.  Unlike \ifun{onig_nth_match}, this
+ function returns the specified captured substring itself and not the
+ position of the substring. For this reason, the subject string of the
+ pattern is a required argument.
+\seealso{onig_new, onig_search, onig_nth_match}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm/pcrefuns.tm Added

@@ -0,0 +1,159 @@
+\function{pcre_compile}
+\synopsis{Compile a PCRE regular expression}
+\usage{PCRE_Type pcre_compile (String_Type pattern , Int_Type options)}
+\description
+ The \ifun{pcre_compile} function compiles a PCRE style regular expression
+ and returns the result.  The optional \var{options} argument may be used
+ to provide addition information affecting the compilation of the pattern.
+ Specifically, it is a bit-mapped value formed from the logical-or of zero
+ or more of the following symbolic constants:
+#v+
+    PCRE_ANCHORED     Force the match to be at the start of a string
+    PCRE_CASELESS     Matches are to be case-insensitive
+    PCRE_DOLLAR_ENDONLY (See PCRE docs for more information)
+    PCRE_DOTALL       The dot pattern matches all characters
+    PCRE_EXTENDED     Ignore whitespace in the pattern
+    PCRE_EXTRA        (See PCRE docs for features this activates)
+    PCRE_MULTILINE    Treat the subject string as multi-lines
+    PCRE_UNGREEDY     Make the matches not greedy
+    PCRE_UTF8         Regard the pattern and subject strings as UTF-8
+#v-
+ Many of these flags may be set within the pattern itself.   See the PCRE
+ library documentation for more information about the precise details
+ of these flags and the supported regular expressions.
+
+ Upon success, this function returns a \dtype{PCRE_Type} object representing
+ the compiled patterned.  If compilation fails, a \exc{ParseError}
+ exception will be thrown.
+\seealso{pcre_exec, pcre_nth_match, pcre_nth_substr, pcre_matches}
+\done
+
+\function{pcre_exec}
+\synopsis{Match a string against a compiled PCRE pattern}
+\usage{Int_Type pcre_exec(p, str ,pos ,options)};
+#v+
+   PCRE_Type p;
+   String_Type str;
+   Int_Type pos, options;
+#v-
+\description
+ The \ifun{pcre_exec} function applies a pre-compiled pattern \var{p} to a
+ string \ifun{str} and returns the result of the match.  The optional third
+ argument \ifun{pos} may be used to specify the point, as an offset from the
+ start of the string, where matching is to start.  The fourth argument, if
+ present, may be used to provide additional information about how matching
+ is to take place.  Its value may be specified as a logical-or of zero or
+ more of the following flags:
+#v+
+   PCRE_NOTBOL
+        The first character in the string is not at the beginning of a line.
+   PCRE_NOTEOL
+        The last character in the string is not at the end of a line.
+   PCRE_NOTEMPTY
+        An empty string is not a valid match.
+#v-
+ See the PCRE library documentation for more information about the meaning
+ of these flags.
+
+ Upon success, this function returns a positive integer equal to 1 plus the
+ number of so-called captured substrings.  It returns 0 if the pattern
+ fails to match the string.
+\seealso{pcre_compile, pcre_nth_match, pcre_nth_substr, pcre_matches}
+\done
+
+\function{pcre_matches}
+\synopsis{Match a PCRE to a string and return the matches}
+\usage{String_Type = pcre_matches (regexp, str ,pcre_exec_options)}
+\description
+  This function combines the \ifun{pcre_exec} and
+ \ifun{pcre_nth_substr} functions into simple to use function that
+ matches the specified regular expression \exmp{regexp} to the string
+ \exmp{string} and returns matched substrings as an array.  If
+ \exmp{regexp} is a string, the function will first compile the
+ pattern using the \ifun{pcre_compile} function.  The third parameter
+ is optional and, if provided, will be passed as the \exmp{options}
+ parameter to \ifun{pcre_exec}.
+
+ If no match is found, the function will return NULL.
+\qualifiers
+ The following qualifiers are supported:
+#v+
+   options=int        Options to pass to pcre_compile
+   offset=int         Start matching offset in bytes for pcre_exec
+#v-
+\example
+ After the execution of:
+#v+
+    str = "Error in file foo.c, line 127, column 10";
+    pattern = "file (^,+), line (\\d+)";
+    matches = pcre_matches (pattern, str);
+#v-
+ the value of the matches variable will be the array:
+#v+
+     "file foo.c, line 127",
+      "foo.c",
+      127
+    
+#v-
+\seealso{pcre_compile, pcre_exec, pcre_nth_substr, pcre_nth_match}
+\done
+
+\function{pcre_nth_match}
+\synopsis{Return the location of the nth match of a PCRE}
+\usage{Int_Type2 pcre_nth_match (PCRE_Type p, Int_Type nth)}
+\description
+ The \ifun{pcre_nth_match} function returns an integer array whose values
+ specify the locations of the beginning and end of the \var{nth} captured
+ substrings of the most recent call to \ifun{pcre_exec} with the compiled
+ pattern.  A value of \var{nth} equal to 0 represents the substring
+ representing the entire match of the pattern.
+
+ If the \var{nth} match did not take place, the function returns \NULL.
+\example
+ After the execution of:
+#v+
+    str = "Error in file foo.c, line 127, column 10";
+    pattern = "file (^,+), line (\\d+)";
+    p = pcre_compile (pattern);
+    if (pcre_exec (p, str))
+      {
+         match_pos = pcre_nth_match (p, 0);
+         file_pos = pcre_nth_match (p, 1);
+         line_pos = pcre_nth_match (p, 2);
+      }
+#v-
+ \exmp{match_pos} will be set to \exmp{9,29}, \exmp{file_pos} to \exmp{14,19,}
+ and \exmp{line_pos} to \exmp{26,29}.  These integer arrays may be used to
+ extract the substrings matched by the pattern, e.g.,
+#v+
+     file = substr (str, file_pos0+1, file_pos1-file_pos0);
+     line = strline_pos0:line_pos1-1;
+#v-
+ Alternatively, the function \ifun{pcre_nth_substr} may be used to get the
+ matched substrings:
+#v+
+     file = pcre_nth_substr (p, str, 0);
+#v-
+\seealso{pcre_compile, pcre_exec, pcre_nth_substr, pcre_matches}
+\done
+
+\function{pcre_nth_substr}
+\synopsis{Extract the nth substring from a PCRE match}
+\usage{String_Type pcre_nth_substr (PCRE_Type p, String_Type str, Int_Type nth)}
+\description
+ This function may be used to extract the \var{nth} captured substring
+ resulting from the most recent use of the compiled pattern \var{p} by the
+ \ifun{pcre_exec} function.  Unlike \ifun{pcre_nth_match}, this function returns
+ the specified captured substring itself and not the position of the substring.
+ For this reason, the subject string of the pattern is a required argument.
+\seealso{pcre_matches, pcre_compile, pcre_exec, pcre_nth_match}
+\done
+
+\function{slang_to_pcre}
+\synopsis{Convert a S-Lang regular expression to a PCRE one}
+\usage{String_Type slang_to_pcre (String_Type pattern)}
+\description
+ This function may be used to convert a slang regular expression to a PCRE
+ compatible one.  The converted pattern is returned.
+\seealso{pcre_compile, string_match}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm/pngfuns.tm Added

@@ -0,0 +1,223 @@
+\function{png_read}
+\synopsis{Read an image from a PNG file}
+\usage{img = png_read (file ,&image_type)}
+\description
+  The \ifun{png_read} function reads the image from the specified file
+  and returns it.  If a second argument is present, then it must be a
+  reference to a variable that will be set to an integer representing
+  the type of image read:
+#v+
+    PNG_COLOR_TYPE_RGB               (RGB image)
+    PNG_COLOR_TYPE_RGBA              (RGB image with an alpha channel)
+    PNG_COLOR_TYPE_GRAY              (Grayscale image)
+    PNG_COLOR_TYPE_GRAY_ALPHA        (Grayscale image with an alpha channel)
+#v-
+  The image returned by this function is represented by a 2d array of
+  unsigned integers.  If the image type is \ivar{PNG_COLOR_TYPE_RGB}
+  or \ivar{PNG_COLOR_TYPE_RGBA}, then the integers will be 32 bits
+  wide with the most significant byte corresponding to the alpha
+  channel, followed by bytes for the red, green, and blue channels in
+  that order.  In this way, the color channels may be extracted from
+  the image through simple bit operations, e.g.,
+#v+
+     (img & 0x0000FF00) shr 8
+#v-
+  will pick out the green channel.  Alternatively, the
+  \exmp{png_rgb_get_?} functions may be used to extract the various
+  channels.
+
+  If the image type is \ivar{PNG_COLOR_TYPE_GRAY_ALPHA} then image
+  will be represented by 16 bit integers with the most significant
+  byte corresponding to the alpha channel and the least significant
+  byte representing the grayscale.  If the image type is
+  \ivar{PNG_COLOR_TYPE_GRAY} then the image array will consist of
+  unsigned 8 bit integers (\exmp{UChar_Type}).
+\example
+#v+
+    define read_grayscale_image (file)
+    {
+       variable img_type;
+       img = png_read (file, &img_type);
+       if ((img_type != PNG_COLOR_TYPE_GRAY)
+           or (img_type != PNG_COLOR_TYPE_GRAY_ALPHA))
+         img = png_rgb_to_gray (img);
+       return img;
+    }
+#v-
+\seealso{png_read_flipped, png_write, png_rgb_to_r, png_rgb_to_g, png_rgb_to_b}
+\done
+
+\function{png_read_flipped}
+\synopsis{Read an image from a PNG file}
+\usage{img = png_read_flipped (file ,&image_type)}
+\description
+  This function is like the \ifun{png_read} function except that it
+  returns an image with the rows flipped.  See the documentation for
+  \ifun{png_read} for more information.
+\seealso{png_read, png_write_flipped}
+\done
+
+\function{png_write}
+\synopsis{Write an image to a PNG file}
+\usage{png_write (file, image ,has_alpha)}
+\description
+  The \ifun{png_write} function writes a 2d image to the specified
+  file as a PNG.  The type of PNG created depends upon the data type
+  of the image array according to the following table:
+#v+
+          data-type           PNG-type
+    -----------------------------------
+    Char_Type   (8 bit)       grayscale
+    UChar_Type  (8 bit)       grayscale
+    Int16_Type  (16 bit)      grayscale
+    UInt16_Type (16 bit)      grayscale
+    Int32_Type  (32 bit)        RGB
+    UInt32_Type (32 bit)        RGB
+#v-
+  If the optional parameter \exmp{has_alpha} is present and non-zero,
+  then an alpha channel will also be written to the file.
+
+  See the documentation for the \ifun{png_read} function for
+  information about how the various channels are encoded as integers.
+\seealso{png_write_flipped, png_read}
+\done
+
+\function{png_write_flipped}
+\synopsis{Write an image to a PNG file}
+\usage{png_write_flipped (file, image ,has_alpha)}
+\description
+  This function is like the \ifun{png_write} function except that it
+  writes the image to the file with the rows reversed. See the
+  documentation for \ifun{png_write} for more information.
+\seealso{png_read, png_write_flipped}
+\done
+
+\function{png_rgb_to_gray}
+\synopsis{Convert an RGB image to grayscale}
+\usage{gray = png_rgb_to_gray (rgb)}
+\description
+  This function converts an RGB image represented by an array
+  (typically 2d) to a corresponding array of 8 bit integers
+  representing the grayscale values. The grayscale values are formed
+  by averaging the R, G, and B channels.
+\seealso{png_gray_to_rgb}
+\done
+
+\function{png_gray_to_rgb}
+\synopsis{Convert a grayscale image to RGB}
+\usage{rgb = png_gray_to_rgb (gray, colormap)}
+\description
+  This function creates an RGB image, represented by an array of 32
+  bit integers from a grayscale image using the specified colormap.
+  The shape of the of the RGB array will be that of the input
+  grayscale array.  The values in the input image will be linearly
+  mapped onto the elements of the colormap such that the minimum value
+  in the grayscale image will be assigned the first RGB value in the
+  colormap, and the maximum value will be assigned the last RGB value.
+
+  The colormap argument must either be an array of 32 bit integers
+  encoding the RGB information, or must be the name of a supported
+  color map.  See the documentation for the \sfun{png_get_colormap}
+  function for more information about colormaps.
+\qualifiers
+  The qualifiers \exmp{gmin} and \exmp{gmax} may be used to define the
+  minimum and maximum grayscale values used for the mapping onto the
+  colormap.  Grayscale values outside the specified range will be clipped.
+
+\seealso{png_rgb_to_gray, png_get_colormap}
+\done
+
+\function{png_get_colormap}
+\synopsis{Retrieve a colormap}
+\usage{cmap = png_get_colormap (String_Type name)}
+\description
+  This function returns a colormap of the specified name.  Currently
+  recognized names include:
+#v+
+    cool       Linear change from blue to magenta
+    copper     Dark to light copper brown
+    gebco      Colors for GEBCO bathymetric charts
+    globe      Colors for global bathy-topo relief
+    drywet     Goes from dry to wet colors
+    gray       Grayramp from black to white
+    haxby      Bill Haxby's colortable for geoid & gravity
+    hot        Black through red and yellow to white
+    jet        Dark to light blue, white, yellow and red
+    no_green   For those who hate green
+    ocean      white-green-blue bathymetry scale
+    polar      Blue via white to red
+    rainbow    Rainbow colors magenta-blue-cyan-green-yellow-red
+    red2green  Polar scale from red to green via white
+    relief     Wessel/Martinez colortable for bathymetry/topography
+    topo       Sandwell-Anderson colors for topography
+    sealand    Smith bathymetry/topography scale
+    seis       R-O-Y-G-B seismic tomography colors
+    split      Polar scale like polar, but via black instead of white
+    wysiwyg    20 RGB colors for openwin -cubesize large and waxenvy printer
+#v-
+  The above colormaps were derived from the GMT distribution, which is
+  an open source collection of tools for geographic data.  See
+  \exmp{http://gmt.soest.hawaii.edu/} for more information about GMT.
+
+  In the current implementation, the colormap is a 256 element array
+  of unsigned 32 bit integers.
+\seealso{png_gray_to_rgb, png_add_colormap, png_get_colormap_names}
+\done
+
+\function{png_add_colormap}
+\synopsis{Add a color map}
+\usage{png_add_colormap (name, cmap)}
+\description
+  This function adds a color map of the specified name to the table of
+  internal colormaps.  The colormap is simply a 256 element unsigned
+  32 integer bit array that maps 256 grayscale values to RGB.
+\seealso{png_get_colormap}
+\done
+
+\function{png_get_r}
+\synopsis{Get the red channel of an RGB image}
+\usage{r = png_get_r (rgb)}
+\description
+  This function returns the red component of the RGB image encoded as
+  an unsigned 32 bit integer using the algorithm:
+#v+
+    r = typecast ((rgb shr 16) & 0xFF, UChar_Type);
+#v-
+\seealso{png_get_g, png_get_b, png_get_a}
+\done
+
+\function{png_get_g}
+\synopsis{Get the green channel of an RGB image}
+\usage{r = png_get_g (rgb)}
+\description
+  This function returns the green component of the RGB image encoded as
+  an unsigned 32 bit integer using the algorithm:
+#v+
+    g = typecast ((rgb shr 8) & 0xFF, UChar_Type);
+#v-
+\seealso{png_get_r, png_get_b, png_get_a}
+\done
+
+\function{png_get_b}
+\synopsis{Get the blue channel of an RGB image}
+\usage{r = png_get_b (rgb)}
+\description
+  This function returns the blue component of the RGB image encoded as
+  an unsigned 32 bit integer using the algorithm:
+#v+
+    b = typecast ((rgb & 0xFF), UChar_Type);
+#v-
+\seealso{png_get_r, png_get_g, png_get_a}
+\done
+
+\function{png_get_a}
+\synopsis{Get the alpha channel of an RGB image}
+\usage{r = png_get_a (rgb)}
+\description
+  This function returns the alpha channel of the RGB image encoded as
+  an unsigned 32 bit integer using the algorithm:
+#v+
+    a = typecast ((rgb shr 24) & 0xFF, UChar_Type);
+#v-
+\seealso{png_get_g, png_get_b, png_get_a}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm/randfuns.tm Added

@@ -0,0 +1,305 @@
+#d optgen_text \__newline__ The optional parameter \exmp{g} may be used to \
+ \__newline__ specify the underlying random number generator. See the \
+ \__newline__ documentation for the \sfun{rand_new} function for more information.
+#d optparm_text \optgen_text \
+ \__newline__ The \exmp{num} parameter indicates that \exmp{num} random values are to \
+ \__newline__ be generated and returned as an array.
+
+\function{rand_exp}
+\synopsis{Generate exponentially distributed random numbers}
+\usage{X = rand_exp(Rand_Type g, beta ,num)}
+\description
+ This function generates random numbers that are distributed according
+ to an exponential distribution with parameter beta > 0. The
+ distribution's probability density is given by
+#v+
+ P(x,beta) = (1/beta) exp(-x/beta)
+#v-
+ \optparm_text
+\notes
+ The exponential generator is commonly used to simulate waiting times
+ between events.
+\seealso{rand_new, rand_uniform}
+\done
+
+\function{rand_int}
+\synopsis{Generate random integers}
+\usage{X = rand_int (Rand_Type g, imin, imax ,num)}
+\description
+ This function may be used to generate a random integer \exmp{X} such
+ that \exmp{imin <= X <= imax}.
+ \optparm_text
+\seealso{rand_uniform, rand, rand_new}
+\done
+
+\function{rand_tdist}
+\synopsis{Generate random numbers from the Student t distribution}
+\usage{X = rand_tdist (Rand_Type g, nu ,num)}
+\description
+ This function generates random numbers that are distributed according
+ to the Student-t distribution with nu>0.0 degrees of freedom.
+ \optparm_text
+\seealso{rand_uniform, rand_new, rand_chisq, rand_fdist}
+\done
+
+\function{rand_fdist}
+\synopsis{Generate random numbers from the F distribution}
+\usage{X = rand_fdist (Rand_Type g,, nu1, nu2 ,num)}
+\description
+ This function generates random numbers that are distributed according
+ to the F-distribution, which is the ratio of two chi-squared
+ distributed variates whose degrees of freedom are given by
+ \exmp{nu1} (numerator) and \exmp{nu2} (denominator).
+ \optparm_text
+\seealso{rand_uniform, rand_chisq, rand_tdist, rand_gauss, rand_new}
+\done
+
+\function{rand_chisq}
+\synopsis{Generate Chi-Square distributed random numbers}
+\usage{X = rand_fdist (Rand_Type g, nu, ,num)}
+\description
+ This function generates random numbers that are distributed according
+ to the Chi-squared distribution with \exmp{nu > 0} degrees of freedom.
+ \optparm_text
+\seealso{rand_uniform, rand_fdist, rand_tdist, rand_gauss, rand_new}
+\done
+
+\function{rand_flat}
+\synopsis{Generate uniformly distributed random numbers}
+\usage{X = rand_fdist (Rand_Type g, xmin, xmax ,num)}
+\description
+ This function generates random double-precision floating point
+ numbers that are uniformly distributed in the range
+ \exmp{xmin<=X<xmax}.
+ \optparm_text
+\seealso{rand_uniform, rand_uniform_pos, rand_int, rand, rand_new}
+\done
+
+\function{rand_gamma}
+\synopsis{Generate Gamma distributed random numbers}
+\usage{X = rand_gamma (Rand_Type g,, k, theta ,num)}
+\description
+ This function returns random deviates that are Gamma-distributed
+ according to the probability density
+#v+
+ P(x; k,theta) = x^(k-1)*exp(-x/theta)/(theta^k * Gamma(k))
+#v-
+ where \exmp{k,theta>0.0}.
+ \optparm_text
+\seealso{rand_beta, rand_uniform, rand_binomial, rand_new}
+\done
+
+\function{rand_binomial}
+\synopsis{Generate random numbers from the binomial distribution}
+\usage{X = rand_binomial (Rand_Type g,, p, n, ,num)}
+\description
+ This function generates binomial distributed random numbers
+ according to the probability density
+#v+
+ P(x;p,n) = n!/(k!*(n-k)!) * p^k * (1-p)^(n-k)
+#v-
+ where \exmp{n} is a non-negative integer and \exmp{0<=p<=1}.
+ \optparm_text
+\seealso{rand_gamma, rand_poisson, rand_uniform, rand_new}
+\done
+
+\function{rand_poisson}
+\synopsis{Generate Poisson distributed random numbers}
+\usage{k = rand_poisson (Rand_Type g, mu ,num)}
+\description
+ This function generates random unsigned integers that are
+ poisson-distributed according to the probability distribution
+#v+
+ P(k;mu) = mu^k/k! * exp(-mu)
+#v-
+ where \exmp{mu>0.0}.
+ \optparm_text
+\seealso{rand_gauss, rand_uniform, rand_binomial, rand_new}
+\done
+
+\function{rand_geometric}
+\synopsis{Generate random numbers from the geometric distribution}
+\usage{k = rand_geometric (Rand_Type g, p ,num)}
+\description
+ This function generates random numbers that are distributed
+ according to a geometric distribution with a probability density
+#v+
+ P(k; p) = p*(1-p)^(k-1)
+#v-
+ where \exmp{0<=p<=1}
+ \optparm_text
+\seealso{rand_poisson, rand_exp, rand_gauss, rand_uniform, rand_new}
+\done
+
+\function{rand_cauchy}
+\synopsis{Generate random numbers from the Cauchy distribution}
+\usage{X = rand_cauchy (Rand_Type g, gamma ,num)}
+\description
+ This function generates random numbers that are distributed
+ according to a cauchy-distribution with a probability density
+#v+
+ P(x; gamma) = 1/(PI*gamma)/(1+(x/gamma)^2)
+#v-
+ where \exmp{gamma>=0.0}.
+ \optparm_text
+\seealso{rand_gauss, rand_poisson, rand_exp, rand_new}
+\done
+
+\function{rand_beta}
+\synopsis{Generate random numbers from the beta distribution}
+\usage{X = rand_fdist (Rand_Type g, a, b ,num)}
+\description
+ This function generates random numbers that are distributed
+ according to a Beta-distribution with a probability density
+#v+
+ P(x; a,b) = x^(a-1)*(1-x)^(b-1)/B(a,b)
+#v-
+ where \exmp{a, b > 0}.
+\seealso{rand_gamma, rand_binomial, rand_chisq}
+\done
+
+\function{rand_gauss}
+\synopsis{Generate gaussian-distributed random numbers}
+\usage{X = rand_gauss (Rand_Type g, sigma ,num)}
+\description
+ This function generates gaussian random numbers with the specified
+ sigma and mean of 0 according to the probability density
+#v+
+ P(x; sigma) = 1/sqrt(2*PI*sigma^2) * exp(-0.5*x^2/sigma^2)
+#v-
+ \optparm_text
+\notes
+ This implementation utilizes the Box-Muller algorithm.
+\seealso{rand_uniform, rand_poisson, rand_chisq, rand_gauss, rand_new}
+\done
+
+\function{rand}
+\synopsis{Generate random integers numbers}
+\usage{X = rand (Rand_Type g, ,num)}
+\description
+ This function generates unsigned 32 bit randomly distributed
+ integers on the closed interval 0<=X<=0xFFFFFFFFUL.
+ \optparm_text
+\seealso{rand_new, rand_int, rand_uniform, rand_flat}
+\done
+
+\function{rand_uniform_pos}
+\synopsis{Generate uniform positive random numbers}
+\usage{X = rand_uniform_pos (Rand_Type num)}
+\description
+ This function generates uniformly distributed random numbers in open
+ interval \exmp{0<X<1}.
+ \optparm_text
+\seealso{rand_uniform, rand_new}
+\done
+
+\function{rand_uniform}
+\synopsis{Generate uniform random numbers}
+\usage{X = rand_uniform (Rand_Type g num)}
+\description
+ This function generates uniformly distributed double precision
+ numbers on the semi-closed interval \exmp{0<=r<1}.
+ \optparm_text
+\seealso{rand_uniform_pos, rand_int, rand_flat, rand_new}
+\done
+
+\function{srand}
+\synopsis{Seed the random number generator}
+\usage{srand (Rand_Type g, Array_Type seeds)}
+\description
+ This function may be used to seed an instance of a rand number
+ generator using the values of an array of an unsigned long integers.
+ If a generator (created by \ifun{rand_new}) is specified as the first
+ argument, then is will be seeded; otherwise, the seeds will
+ get applied to the default generator.
+ \optparm_text
+\example
+#v+
+ gen = rand_new ();
+ srand (gen, _time(), _pid(), 0xFF80743);
+#v-
+\seealso{rand_new, rand, rand_uniform}
+\done
+
+\function{rand_new}
+\synopsis{Instantiate a new random number generator}
+\usage{Rand_Type rand_new (array-of-seeds)}
+\description
+ This function creates a new instance of the basic random number
+ generator. An optional array of 32 bit unsigned integers may be used
+ to seed the generator. By default, the generator is seeding using
+ the current time and process id. The \ifun{srand} function may also
+ be used to seed the generator. The generator created by the
+ \ifun{rand_new} function may be passed as the first argument to most
+ of the other functions in the module to indicate that this instance
+ should be used as the basic generator.
+\example
+ The following example shows how to create an array of 512 uniform
+ random numbers derived from the default instance of the basic
+ generator:
+#v+
+ x = rand_uniform (512);
+#v-
+ A specific instance of the generator may be created using the
+ \ifun{rand_new} function and used by \ifun{rand_uniform} as follows:
+#v+
+ g = rand_new (0x1234, 0x5678912, 0xEFAB1234);
+ x = rand_uniform (g, 512);
+#v-
+\notes
+ The generator is a hybrid one that sums the results of 3 separate
+ generators: George Marsaglia's MZRAN13 generator, a multiply with
+ carry generator (also by Marsaglia), and a product generator. The
+ combined generator has a 192 bit state and a period exceeding 10^46.
+
+ The resulting random sequences were tested using version 2.24.4 of
+ the dieharder random number testing program. The tests showed that
+ this generator performed better than the famous Marsenne
+ Twister (\exmp{mt19937}) both in terms of randomness and speed. More
+ information about the test results may be found at
+ \url{http://www.jedsoft.org/slang/modules/rand.html}.
+
+ The \exmp{mt19937} generator is separately available via the GSL
+ module.
+\seealso{srand, rand_int, rand_uniform}
+\done
+
+\function{rand_sample}
+\synopsis{Randomly sample from one or more arrays}
+\usage{(b1 ,b2,...) = rand_sample (Rand_Type g, a1 ,a2,..., num);}
+\description
+ This function may be used to randomly sample \exmp{num} elements from
+ one or more arrays (\exmp{a1,...}). The arrays must be consistent in
+ the sense that they must have the same leading dimension, which is
+ the one to be sampled.
+
+ The optional first argument may be used to specify a different
+ instance of a random number generator. Otherwise, the default
+ generator will be used.
+\example
+ Suppose A is a 1-d array with 20 elements, and B is a 2d array with
+ dimensions 20,30. Then
+#v+
+ (A1, B1) = rand_sample (A, B, 5);
+#v-
+ will produce a 1d array A1 with 5 elements and a 2d array B1 with
+ dimensions 5,30.
+\notes
+ The indices used to sample the arrays are created using the first
+ \exmp{num} elements of a random permutation of the integers
+ \exmp{0:dim0-1} where \exmp{dim0} is the size of the leading
+ dimension. The same set of indices are used for all the arrays.
+ Hence any correspondence between \exmp{a0i,..} and \exmp{a1i,...}
+ will be preserved in the samples.
+\seealso{rand_permutation, rand_new}
+\done
+
+\function{rand_permutation}
+\synopsis{Generate a random permutation of integers}
+\usage{p = rand_permutation (Rand_Type g, Int_Type n)}
+\description
+ This function may be used to generate a random permutation of the
+ sequence of integers \exmp{0,1,..,n-1}.
+ \optgen_text
+\seealso{rand_sample}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm/slsmg.tm Added

@@ -0,0 +1,325 @@
+\function{slsmg_suspend_smg}
+\synopsis{Suspend screen management}
+\usage{slsmg_suspend_smg ()}
+\description
+  The \ifun{slsmg_suspend_smg} function can be used to suspend the state of the
+  screen management facility during suspension of the program.  Use of
+  this function will reset the display back to its default state.  The
+  funtion \ifun{slsmg_resume_smg} should be called after suspension.
+
+  This function is similar to \ifun{slsmg_reset_smg} except that the
+  state of the display prior to calling \ifun{slsmg_suspend_smg} is saved.
+\seealso{slsmg_resume_smg, slsmg_reset_smg}
+\done
+
+\function{slsmg_resume_smg}
+\synopsis{Resume screen management}
+\usage{slsmg_resume_smg ()}
+\description
+  The \ifun{slsmg_resume_smg} function should be called after
+  \ifun{slsmg_suspend_smg} to redraw the display exactly like it was
+  before \ifun{slsmg_suspend_smg} was called.
+\seealso{slsmg_suspend_smg}
+\done
+
+\function{slsmg_erase_eol}
+\synopsis{Erase to the end of the row}
+\usage{slsmg_erase_eol ()}
+\description
+  The \ifun{slsmg_erase_eol} function erases all characters from the current
+  position to the end of the line.  The newly created space is given
+  the color of the current color.  This function has no effect on the
+  position of the virtual cursor.
+\seealso{slsmg_gotorc, slsmg_erase_eos, slsmg_fill_region}
+\done
+
+\function{slsmg_gotorc}
+\synopsis{Move the virtual cursor}
+\usage{slsmg_gotorc (Integer_Type r, c)}
+\description
+  The \ifun{slsmg_gotorc} function moves the virtual cursor to the row
+  \var{r} and column \var{c}.  The first row and first column is
+  specified by \exmp{r = 0} and \exmp{c = 0}.
+\seealso{slsmg_refresh}
+\done
+
+\function{slsmg_erase_eos}
+\synopsis{Erase to the end of the screen}
+\usage{slsmg_erase_eos ()}
+\description
+  The \ifun{slsmg_erase_eos} function is like \ifun{slsmg_erase_eol}
+  except that it erases all text from the current position to the
+  end of the display.  The current color will be used to set the
+  background of the erased area.
+\seealso{slsmg_erase_eol}
+\done
+
+\function{slsmg_reverse_video}
+\synopsis{Set the current color to 1}
+\usage{slsmg_reverse_video ()}
+\description
+  This function is nothing more than \exmp{slsmg_set_color(1)}.
+\seealso{slsmg_set_color}
+\done
+
+\function{slsmg_set_color}
+\synopsis{Set the current color}
+\usage{slsmg_set_color (Integer_Type c)}
+\description
+  The \ifun{slsmg_set_color} function is used to set the current
+  color.  The parameter \var{c} is a color object descriptor.
+  Actual foreground and background colors may be associated with a
+  color descriptor via the \ifun{slsmg_define_color} function.
+\example
+  This example defines color \exmp{7} to be green foreground on black
+  background and then displays some text in this color:
+#v+
+      require ("slsmg");
+      variable
+        ref,
+        row = SLsmg_Screen_Rows / 2,
+        txt = 
+          "This should be displayed in green under a black background",
+          "Press enter to close this window";
+
+      slsmg_init_smg ();
+      slsmg_define_color (7, "green", "black");
+      slsmg_gotorc (row, SLsmg_Screen_Cols / 2 - strlen (txt0) / 2);
+      slsmg_set_color (7);
+      slsmg_write_string (txt0);
+      row++;
+      slsmg_gotorc (row, SLsmg_Screen_Cols / 2 - strlen (txt1) / 2);
+      slsmg_write_string (txt1);
+      slsmg_refresh ();
+
+      ()=fgets(&ref, stdin);
+#v-
+\done
+
+\function{slsmg_normal_video}
+\synopsis{Set the current color to 0}
+\usage{slsmg_normal_video ()}
+\description
+  The \ifun{slsmg_normal_video} function sets the current color descriptor to \var{0}.
+\seealso{slsmg_set_color}
+\done
+
+\function{slsmg_write_string}
+\usage{slsmg_write_string (String_Type s)}
+\done
+
+\function{slsmg_cls}
+\synopsis{Clear the virtual display}
+\usage{slsmg_cls ()}
+\description
+  The \ifun{slsmg_cls} function erases the virtual display using
+  the current color.  This will cause the physical display to get
+  cleared the next time \ifun{slsmg_refresh} is called.
+\notes
+  This function is not the same as
+#v+
+     slsmg_gotorc (0,0); slsmg_erase_eos ();
+#v-
+  since these statements do not guarantee that the physical screen
+  will get cleared.
+\seealso{slsmg_refresh, slsmg_erase_eos}
+\done
+
+\function{slsmg_refresh}
+\synopsis{Update physical screen}
+\usage{slsmg_refresh ()}
+\description
+  The \ifun{slsmg_refresh} function updates the physical display to
+  look like the virtual display.
+\seealso{slsmg_suspend_smg, slsmg_init_smg, slsmg_reset_smg}
+\done
+
+\function{slsmg_reset_smg}
+\synopsis{Reset the \var{SLsmg} routines}
+\usage{slsmg_reset_smg ()}
+\description
+  The \ifun{slsmg_reset_smg} function resets the \var{SLsmg}
+  screen management routines by freeing all memory allocated
+  while it was active and also put the terminal's display in
+  it's default state.
+\seealso{slsmg_init_smg}
+\done
+
+\function{slsmg_init_smg}
+\synopsis{Initialize the \var{SLsmg} routines}
+\usage{slsmg_init_smg ()}
+\description
+  The \ifun{slsmg_init_smg} function initializes the \var{SLsmg} screen
+  management routines.   Specifically, this function allocates space
+  for the virtual display and puts the terminal's physical display in
+  the proper state.
+
+  This function should also be called any time the size of the
+  physical display has changed so that it can reallocate a new virtual
+  display to match the physical display.
+
+\seealso{slsmg_reset_smg}
+\done
+
+\function{slsmg_write_nstring}
+\synopsis{Write the first n characters of a string on the display}
+\usage{slsmg_write_nstring (String_Type s, Integer_Type len)}
+\description
+  The \ifun{slsmg_write_nstring} function writes the first \var{n}
+  characters of \var{s} to this virtual display.  If the length of
+  the string \var{s} is less than \var{n}, the spaces will used until
+  \var{n} characters have been written.  \var{s} can be \var{NULL}, in
+  which case \var{n} spaces will be written.
+\seealso{slsmg_write_string}
+\done
+
+\function{slsmg_write_wrapped_string}
+\synopsis{Write a string to the display with wrapping}
+\usage{slsmg_write_wrapped_string (String_Type s, Integer_Type r, c, dr, dc, fill)}
+\description
+  The \ifun{slsmg_write_wrapped_string} function writes the
+  string \var{s} to the virtual display.  The string will be confined
+  to the rectangular region whose upper right corner is at row \var{r}
+  and column \var{c}, and consists of \var{nr} rows and \var{dc} columns.
+  The string will be wrapped at the boundaries of the box.  If \var{fill}
+  is non-zero, the last line to which characters have been written will
+  get padded with spaces.
+\notes
+  This function does not wrap on word boundaries.  However, it will
+  wrap when a newline charater is encountered.
+\seealso{slsmg_write_string}
+\done
+
+\function{slsmg_char_at}
+\synopsis{Get the character at the current position on the virtual display}
+\usage{Integer_Type slsmg_char_at ()}
+\description
+  The \ifun{slsmg_char_at} function returns the character and its color
+  at the current position on the virtual display.
+\done
+
+\function{slsmg_set_screen_start}
+\synopsis{Set the origin of the virtual display}
+\usage{slsmg_set_screen_start (Integer_Type r, c)}
+\description
+  The \ifun{slsmg_set_screen_start} function sets the origin of
+  the virtual display to the row \var{r} and the column \var{c}.
+\seealso{slsmg_init_smg}
+\done
+
+\function{slsmg_draw_hline}
+\synopsis{Draw a horizontal line}
+\usage{slsmg_draw_hline (Integer_Type len)}
+\description
+  The \ifun{slsmg_draw_hline} function draws a horizontal line of
+  length \var{len} on the virtual display.  The position of the
+  virtual cursor is left at the end of the line.
+\seealso{slsmg_draw_vline}
+\done
+
+\function{slsmg_draw_vline}
+\synopsis{Draw a vertical line}
+\usage{slsmg_draw_vline (Integer_Type len)}
+\description
+  The \ifun{slsmg_draw_vline} function draws a vertical line of
+  length \var{len} on the virtual display.  The position of the
+  virtual cursor is left at the end of the line.
+\done
+
+\function{slsmg_draw_object}
+\synopsis{Draw an object from the alternate character set}
+\usage{slsmg_draw_object (Integer_Type r, c, obj)}
+\description
+  The \ifun{slsmg_draw_object} function may be used to place the object
+  specified by \var{obj} at row \var{r} and column \var{c}.  The
+  object is really a character from the alternate character set and
+  may be specified using one of the following constants:
+#v+
+    SLSMG_HLINE_CHAR         Horizontal line
+    SLSMG_VLINE_CHAR         Vertical line
+    SLSMG_ULCORN_CHAR        Upper left corner
+    SLSMG_URCORN_CHAR        Upper right corner
+    SLSMG_LLCORN_CHAR        Lower left corner
+    SLSMG_LRCORN_CHAR        Lower right corner
+    SLSMG_CKBRD_CHAR         Checkboard character
+    SLSMG_RTEE_CHAR          Right Tee
+    SLSMG_LTEE_CHAR          Left Tee
+    SLSMG_UTEE_CHAR          Up Tee
+    SLSMG_DTEE_CHAR          Down Tee
+    SLSMG_PLUS_CHAR          Plus or Cross character
+#v-
+\seealso{slsmg_draw_vline, slsmg_draw_hline, slsmg_draw_box}
+\done
+
+\function{slsmg_draw_box}
+\synopsis{Draw a box on the virtual display}
+\usage{slsmg_draw_box (Integer_Type r, c, dr, dc)}
+\description
+  The \ifun{slsmg_draw_box} function uses the \ifun{slsmg_draw_hline} and
+  \ifun{slsmg_draw_vline} functions to draw a rectangular box on the
+  virtual display.  The box's upper left corner is placed at row
+  \var{r} and column \var{c}.  The length and width of the box is
+  specified by \var{dr} and \var{dc}, respectively.
+\seealso{slsmg_draw_vline, slsmg_draw_hline, slsmg_draw_object}
+\done
+
+\function{slsmg_get_column}
+\synopsis{Get the column of the virtual cursor}
+\usage{Integer_Type slsmg_get_column ()}
+\description
+  The \ifun{slsmg_get_column} function returns the current column of
+  the virtual cursor on the virtual display.
+\seealso{slsmg_get_row, slsmg_gotorc}
+\done
+
+\function{slsmg_get_row}
+\synopsis{Get the row of the virtual cursor}
+\usage{Integer_Type slsmg_get_row ()}
+\description
+  The \ifun{slsmg_get_row} function returns the current row of the
+  virtual cursor on the virtual display.
+\seealso{slsmg_get_column, slsmg_gotorc}
+\done
+
+\function{slsmg_forward}
+\synopsis{Move the virtual cursor forward n columns}
+\usage{slsmg_forward (Integer_Type n)}
+\description
+  The \ifun{slsmg_forward} function moves the virtual cursor forward
+  \var{n} columns.
+\seealso{slsmg_gotorc}
+\done
+
+\function{slsmg_set_color_in_region}
+\synopsis{Change the color of a specifed region}
+\usage{slsmg_set_color_in_region (Integer_Type color, r, c, dr, dc)}
+\description
+  The \ifun{slsmg_set_color_in_region} function may be used to
+  change the color of a rectangular region whose upper left corner
+  is given by (\var{r},\var{c}), and whose height and width is given
+  by \var{dr} and \var{dc}, respectively.  The color of the region
+  is given by the \var{color} parameter.
+\seealso{slsmg_draw_box, slsmg_set_color}
+\done
+
+\function{slsmg_define_color}
+\usage{slsmg_define_color (Integer_Type obj, String_Type fg, bg)}
+\description
+  The \ifun{slsmg_define_color} function associates the color
+  descriptor \exmp{obj} with a foreground and a background color.
+  The \exmp{fg} and \exmp{bg} colors can be one of the following strings:
+#v+
+  "color0" or "black",      "color8"  or "gray",
+  "color1" or "red",        "color9"  or "brightred",
+  "color2" or "green",      "color10" or "brightgreen",
+  "color3" or "brown",      "color11" or "yellow",
+  "color4" or "blue",       "color12" or "brightblue",
+  "color5" or "magenta",    "color13" or "brightmagenta",
+  "color6" or "cyan",       "color14" or "brightcyan",
+  "color7" or "lightgray",  "color15" or "white"
+#v-
+\done
+
+\function{slsmg_write_to_status_line}
+\usage{slsmg_write_to_status_line (String_Type s)}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm/sockfuns.tm Added

@@ -0,0 +1,172 @@
+\function{socket}
+\synopsis{Create a communications socket}
+\usage{FD_Type socket (domain, type, protocol)}
+\description
+  The \ifun{socket} function creates a communications socket of the
+  specified domain, type, and protocol.  Currently supported domains
+  include \ivar{PF_UNIX} and \ivar{PF_INET}.  The various socket types
+  may be specified by the symbolic constants
+#v+
+    SOCK_STREAM
+    SOCK_DGRAM
+    SOCK_SEQPACKET
+    SOCK_RAW
+    SOCK_RDM
+#v-
+  The \exmp{protocol} parameter specifies the protocol to be used.
+  Normally only one protocol is support for a particular domain.  For
+  such cases, 0 should be passed for the \exmp{protocol} parameter.
+
+  If successful, the \ifun{socket} function will return a
+  file-descriptor that may be used with the \ifun{read} and
+  \ifun{write} function, or passed to other socket related functions.
+  Upon error, a \ivar{SocketError} exception will be thrown and
+  \ivar{errno} set accordingly.
+
+  When finished with the socket, it should be passed to the
+  \ifun{close} function.
+\example
+  The following example illustrates the creation of a socket for use
+  in the internet domain:
+#v+
+     try {
+        s = socket (PF_INET, SOCK_STREAM, 0);
+     }
+     catch SocketError: {
+        () = fprintf (stderr, "socket failed: %s", errno_string(errno));
+        exit (1);
+     }
+#v-
+\seealso{accept, bind, connect, listen, setsockopt, getsockopt}
+\done
+
+\function{connect}
+\synopsis{Make a connection to a socket}
+\usage{connect (FD_Type s, address-args)}
+\description
+  The \ifun{connect} function may be used to connect a socket \exmp{s}
+  to the address specified by the address-arguments.  The type and
+  number of the address arguments must be consistent with the domain
+  of the socket.  For example, if the socket is in the Unix domain
+  (PF_UNIX), then a single string giving a filename must be passed as
+  the address-argument.  Sockets in the internet domain (PF_INET) take two
+  address arguments: a hostname and a port.
+
+  Upon failure, the function may throw a \ivar{SocketError} exception and set
+  \ivar{errno}, or throw a \ivar{SocketHError} and set \ivar{h_error}.
+  It should be noted that \ivar{SocketHError} is a subclass of
+  \ivar{SocketError}.
+\example
+  The following example creates an internet domain socket and connects
+  it to port 32100 of a specified host:
+#v+
+     try {
+        s = socket (PF_INET, SOCK_STREAM, 0);
+        connect (s, "some.host.com", 32100);
+     }
+     catch SocketHError: {...}
+     catch SocketError: {...}
+#v-
+\seealso{accept, bind, listen, socket, setsockopt, getsockopt}
+\done
+
+\function{bind}
+\synopsis{Bind a local address-name to a socket}
+\usage{bind (FD_Type s, address-args)}
+\description
+  The \ivar{bind} function may be used to assign a name to a specified
+  socket.  The address-args parameters specify the name in a
+  domain-specific manner.  For Unix domain sockets, the address is the
+  name of a file.  For sockets in the internet domain, the address is
+  given by a hostname and port number.
+
+  Upon failure, the function will throw a \ivar{SocketError} or
+  \ivar{SocketHError} exception.
+\example
+  The following example creates a \ivar{PF_UNIX} domain socket and
+  binds it to \exmp{"/tmp/mysock"}:
+#v+
+    s = socket (PF_UNIX, SOCK_STREAM, 0);
+    bind (s, "/tmp/mysock");
+#v-
+
+  The next example creates a \ivar{PF_INET} domain socket and binds it
+  to port 32000 of the local host \exmp{my.host.com}:
+#v+
+    s = socket (PF_INET, SOCK_STREAM, 0);
+    bind (s, "my.host.com", 32000);
+#v-
+\seealso{accept, connect, listen, socket, setsockopt, getsockopt}
+\done
+
+\function{accept}
+\synopsis{Accept a connection on a socket}
+\usage{FD_Type accept (FD_Type s ,&address-args...}
+\description
+  The \ifun{accept} function accepts a connection on the specified
+  socket and returns a new socket that may be used to communicate with
+  the remote end.  It can optionally return the address of the remote
+  end through reference arguments.
+
+  Upon error, \ifun{accept} will throw a \ivar{SocketError} exception.
+\example
+  The following example accepts a remote connection on \ivar{PF_INET}
+  socket and returns the hostname and port used by the connected party:
+#v+
+    s1 = accept (s, &hostip, &port);
+    vmessage ("Accepted connection from %s on port %d", hostip, port);
+#v-
+\seealso{bind, connect, listen, socket, setsockopt, getsockopt}
+\done
+
+\function{listen}
+\synopsis{Listen for connections on a socket}
+\usage{listen (FD_Type s, Int_Type max_pending)}
+\description
+  The \ifun{listen} function may be used to wait for a connection to a
+  socket \exmp{s}.  The second argument specified the maximum number
+  of pending connections to allow before refusing more.  Upon error, a
+  \ivar{SocketError} exception will be thrown.
+\seealso{accept, bind, connect, socket, setsockopt, getsockopt}
+\seealso{}
+\done
+
+\function{getsockopt}
+\synopsis{Get a socket option}
+\usage{option = getsockopt (FD_Type s, Int_Type level, Int_Type optname)}
+\description
+  The \ifun{getsockopt} function returns the value of the option
+  specified by the integer \exmp{optname} residing at the specified
+  level.  The actual object returned depends upon the option
+  requested.  Upon error, a \ivar{SocketError} exception will be
+  generated.
+\example
+  The following example returns the SO_LINGER option of a socket.  In
+  this case, the value returned will be a structure:
+#v+
+     s = socket (PF_INET, SOCK_STREAM, 0);
+     linger = getsockopt (s, SOL_SOCKET, SO_LINGER);
+#v-
+\seealso{accept, bind, connect, listen, socket, getsockopt}
+\done
+
+\function{setsockopt}
+\synopsis{Set an option on a socket}
+\usage{setsockopt (FD_Type s, Int_Type level, Int_Type optname, value)}
+\description
+  The \ifun{setsockopt} function sets the value of the option
+  specified by the integer \exmp{optname} residing at the specified
+  level.  The value of the last parameter will vary with the option to
+  be set.  Upon error, a \ivar{SocketError} exception will be
+  generated.
+\example
+  The following example sets the SO_LINGER option of a socket.  In
+  this case, the value is a structure:
+#v+
+     s = socket (PF_INET, SOCK_STREAM, 0);
+     linger = struct { l_onoff, l_linger };
+     linger.l_onoff = 1; linger.l_linger = 10;
+     setsockopt (s, SOL_SOCKET, SO_LINGER, linger);
+#v-
+\seealso{accept, bind, connect, listen, socket, getsockopt}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/modules/tm/statsfuns.tm Added

@@ -0,0 +1,581 @@
+\function{ad_ktest}
+\synopsis{k-sample Anderson-Darling test}
+\usage{p = ad_ktest ({X1, X2, ...} ,&statistic ;qualifiers)}
+\description
+ The \sfun{ad_ktest} function performs a k-sample Anderson-Darling
+ test, which may be used to test the hypothesis that two or more
+ statistical samples come from the same underlying parent population.
+
+ The function returns the p-value representing the probability that
+ the samples are consistent with a common parent distribution. If
+ the last parameter is a reference, then the variable that it
+ references will be set to the value of the statistic upon return.
+
+ The paper that this test is based upon presents two statistical
+ tests: one for continuous data where ties are improbable, and one
+ for data where ties can occur. This function returns the p-value
+ and statistic for the latter case. A qualifier may be used to
+ obtain the p-value and statistic for the continuous case.
+\qualifiers
+\qualifier{pval2=&var}{Set the variable \exmp{var} to the p-value for continuous case}
+\qualifier{stat2=&var}{Set the variable \exmp{var} to the statistic for the continuous case.}
+\notes
+ The k-sample test was implemented from the equations found in
+ Scholz F.W. and Stephens M.A., "K-Sample Anderson-Darling Tests",
+ Journal of the American Statistical Association, Vol 82, 399 (1987).
+\seealso{ks_test2, ad_test}
+\done
+
+
+\function{ad_test}
+\synopsis{Anderson-Darling test for normality}
+\usage{pval = ad_test (X ,&statistic ;qualifiers)}
+\description
+ The \sfun{ad_test} function may be used to test the hypothesis that
+ random samples \exmp{X} come from a normal distribution. It returns
+ the p-value representing the probability of obtaining such a dataset
+ under the assumption that the data represent random samples of the
+ underlying distribution. If the optional second parameter is
+ present, then it must be a reference to a variable that will be set
+ to the value of the statistic upon return.
+\qualifiers
+\qualifier{mu=value}{Specifies the known mean of the normal distribution}.
+\qualifier{sigma}{Specifies the known standard deviation of the normal distribution}
+\qualifier{cdf}{If present, the data will be interpreted as a CDFs of a known, but unspecified, distribution.}
+\notes
+ For testing the hypothesis that a dataset is sampled from a known,
+ not necessarily normal, distribution, convert the random samples
+ into CDFs and pass those as the value of X to the \sfun{ad_test}
+ function. Also use the \exmp{cdf} qualifier to let the function
+ know that the values are CDFs and not random samples. When this is
+ done, the values of the CDFs will range from 0 to 1, and the p-value
+ returned by the function will be computed using an algorithm by
+ Marsaglia and Marsaglia: Evaluating the Anderson-Darling
+ Distribution, Journal of Statistical Software, Vol. 9, Issue 2, Feb
+ 2004.
+\seealso{ad_ktest, ks_test, t_test, z_test, normal_cdf, }
+\done
+
+\function{median}
+\synopsis{Compute the median of an array of values}
+\usage{m = median (a ,i)}
+\description
+ This function computes the median of an array of values. The median
+ is defined to be the value such that half of the the array values will be
+ less than or equal to the median value and the other half greater than or
+ equal to the median value. If the array has an even number of
+ values, then the median value will be the smallest value that is
+ greater than or equal to half the values in the array.
+
+ If called with a second argument, then the optional argument
+ specifies the dimension of the array over which the median is to be
+ taken. In this case, an array of one less dimension than the input
+ array will be returned.
+\notes
+ This function makes a copy of the input array and then partially
+ sorts the copy. For large arrays, it may be undesirable to allocate
+ a separate copy. If memory use is to be minimized, the
+ \ifun{median_nc} function should be used.
+\seealso{median_nc, mean}
+\done
+
+\function{median_nc}
+\synopsis{Compute the median of an array}
+\usage{m = median_nc (a ,i)}
+\description
+ This function computes the median of an array. Unlike the
+ \ifun{median} function, it does not make a temporary copy of the
+ array and, as such, is more memory efficient at the expense
+ increased run-time. See the \ifun{median} function for more
+ information.
+\seealso{median, mean}
+\done
+
+\function{mean}
+\synopsis{Compute the mean of the values in an array}
+\usage{m = mean (a ,i)}
+\description
+ This function computes the arithmetic mean of the values in an
+ array. The optional parameter \exmp{i} may be used to specify the
+ dimension over which the mean it to be take. The default is to
+ compute the mean of all the elements.
+\example
+ Suppose that \exmp{a} is a two-dimensional MxN array. Then
+#v+
+ m = mean (a);
+#v-
+ will assign the mean of all the elements of \exmp{a} to \exmp{m}.
+ In contrast,
+#v+
+ m0 = mean(a,0);
+ m1 = mean(a,1);
+#v-
+ will assign the N element array to \exmp{m0}, and an array of
+ M elements to \exmp{m1}. Here, the jth element of \exmp{m0} is
+ given by \exmp{mean(a*,j)}, and the jth element of \exmp{m1} is
+ given by \exmp{mean(aj,*)}.
+\seealso{stddev, median, kurtosis, skewness}
+\done
+
+\function{stddev}
+\synopsis{Compute the standard deviation of an array of values}
+\usage{s = stddev (a ,i)}
+\description
+ This function computes the standard deviation of the values in the
+ specified array. The optional parameter \exmp{i} may be used to
+ specify the dimension over which the standard-deviation it to be
+ taken. The default is to compute the standard deviation of all the
+ elements.
+\notes
+ This function returns the unbiased N-1 form of the sample standard
+ deviation.
+\seealso{mean, median, kurtosis, skewness}
+\done
+
+\function{skewness}
+\synopsis{Compute the skewness of an array of values}
+\usage{s = skewness (a)}
+\description
+ This function computes the so-called skewness of the array \exmp{a}.
+\seealso{mean, stddev, kurtosis}
+\done
+
+\function{kurtosis}
+\synopsis{Compute the kurtosis of an array of values}
+\usage{s = kurtosis (a)}
+\description
+ This function computes the so-called kurtosis of the array \exmp{a}.
+\notes
+ This function is defined such that the kurtosis of the normal
+ distribution is 0, and is also known as the ``excess-kurtosis''.
+\seealso{mean, stddev, skewness}
+\done
+
+\function{binomial}
+\synopsis{Compute binomial coefficients}
+\usage{c = binomial (n ,m)}
+\description
+ This function computes the binomial coefficients (n m) where (n m)
+ is given by n!/(m!(n-m)!). If \exmp{m} is not provided, then an
+ array of coefficients for m=0 to n will be returned.
+\done
+
+\function{chisqr_cdf}
+\synopsis{Compute the Chisqr CDF}
+\usage{cdf = chisqr_cdf (Int_Type n, Double_Type d)}
+\description
+ This function returns the probability that a random number
+ distributed according to the chi-squared distribution for \exmp{n}
+ degrees of freedom will be less than the non-negative value \exmp{d}.
+\notes
+ The importance of this distribution arises from the fact that if
+ \exmp{n} independent random variables \exmp{X_1,...X_n} are
+ distributed according to a gaussian distribution with a mean of 0 and
+ a variance of 1, then the sum
+#v+
+ X_1^2 + X_2^2 + ... + X_n^2
+#v-
+ follows the chi-squared distribution with \exmp{n} degrees of freedom.
+\seealso{chisqr_test, poisson_cdf}
+\done
+
+\function{poisson_cdf}
+\synopsis{Compute the Poisson CDF}
+\usage{cdf = poisson_cdf (Double_Type m, Int_Type k)}
+\description
+ This function computes the CDF for the Poisson probability
+ distribution parameterized by the value \exmp{m}. For values of
+ \exmp{m>100} and \exmp{abs(m-k)<sqrt(m)}, the Wilson and Hilferty
+ asymptotic approximation is used.
+\seealso{chisqr_cdf}
+\done
+
+\function{smirnov_cdf}
+\synopsis{Compute the Kolmogorov CDF using Smirnov's asymptotic form}
+\usage{cdf = smirnov_cdf (x)}
+\description
+ This function computes the CDF for the Kolmogorov distribution using
+ Smirnov's asymptotic form. In particular, the implementation is based
+ upon equation 1.4 from W. Feller, "On the Kolmogorov-Smirnov limit
+ theorems for empirical distributions", Annals of Math. Stat, Vol 19
+ (1948), pp. 177-190.
+\seealso{ks_test, ks_test2, normal_cdf}
+\done
+
+\function{normal_cdf}
+\synopsis{Compute the CDF for the Normal distribution}
+\usage{cdf = normal_cdf (x)}
+\description
+ This function computes the CDF (integrated probability) for the
+ normal distribution.
+\seealso{smirnov_cdf, mann_whitney_cdf, poisson_cdf}
+\done
+
+\function{mann_whitney_cdf}
+\synopsis{Compute the Mann-Whitney CDF}
+\usage{cdf = mann_whitney_cdf (Int_Type m, Int_Type n, Int_Type s)}
+\description
+ This function computes the exact CDF P(X<=s) for the Mann-Whitney
+ distribution. It is used by the \exmp{mw_test} function to compute
+ p-values for small values of \exmp{m} and \exmp{n}.
+\seealso{mw_test, ks_test, normal_cdf}
+\done
+
+\function{kim_jennrich_cdf}
+\synopsis{Compute the 2-sample KS CDF using the Kim-Jennrich Algorithm}
+\usage{p = kim_jennrich (UInt_Type m, UInt_Type n, UInt_Type c)}
+\description
+ This function returns the exact two-sample Kolmogorov-Smirnov
+ probability that that \exmp{D_mn <= c/(mn)}, where \exmp{D_mn} is
+ the two-sample Kolmogorov-Smirnov statistic computed from samples of
+ sizes \exmp{m} and \exmp{n}.
+
+ The algorithm used is that of Kim and Jennrich. The run-time scales
+ as m*n. As such, it is recommended that asymptotic form given by
+ the \ifun{smirnov_cdf} function be used for large values of m*n.
+\notes
+ For more information about the Kim-Jennrich algorithm, see:
+ Kim, P.J., and R.I. Jennrich (1973), Tables of the exact sampling
+ distribution of the two sample Kolmogorov-Smirnov criterion Dmn(m<n),
+ in Selected Tables in Mathematical Statistics, Volume 1, (edited
+ by H. L. Harter and D.B. Owen), American Mathematical Society,
+ Providence, Rhode Island.
+\seealso{smirnov_cdf, ks_test2}
+\done
+
+\function{f_cdf}
+\synopsis{Compute the CDF for the F distribution}
+\usage{cdf = f_cdf (t, nu1, nu2)}
+\description
+ This function computes the CDF for the distribution and returns its
+ value.
+\seealso{f_test2}
+\done
+#d opt-3-parm#1 If the optional parameter is passed to the function, then \
+ \__newline__ it must be a reference to a variable that, upon return, will be \
+ \__newline__ set to the value of the $1.
+
+\function{ks_test}
+\synopsis{One sample Kolmogorov test}
+\usage{p = ks_test (CDF ,&D)}
+\description
+ This function applies the Kolmogorov test to the data represented by
+ \exmp{CDF} and returns the p-value representing the probability that
+ the data values are ``consistent'' with the underlying distribution
+ function. \opt-3-parm{Kolmogorov statistic}.
+
+ The \exmp{CDF} array that is passed to this function must be computed
+ from the assumed probability distribution function. For example, if
+ the data are constrained to lie between 0 and 1, and the null
+ hypothesis is that they follow a uniform distribution, then the CDF
+ will be equal to the data. In the data are assumed to be normally
+ (Gaussian) distributed, then the \ifun{normal_cdf} function can be
+ used to compute the CDF.
+\example
+ Suppose that X is an array of values obtained from repeated
+ measurements of some quantity. The values are are assumed to follow
+ a normal distribution with a mean of 20 and a standard deviation of
+ 3. The \sfun{ks_test} may be used to test this hypothesis using:
+#v+
+ pval = ks_test (normal_cdf(X, 20, 3));
+#v-
+\seealso{ks_test2, ad_test, kuiper_test, t_test, z_test}
+\done
+
+\function{ks_test2}
+\synopsis{Two-Sample Kolmogorov-Smirnov test}
+\usage{prob = ks_test2 (X, Y ,&d)}
+\description
+ This function applies the 2-sample Kolmogorov-Smirnov test to two
+ datasets \exmp{X} and \exmp{Y} and returns p-value for the null
+ hypothesis that they share the same underlying distribution.
+ \opt-3-parm{statistic}
+\notes
+ If \exmp{length(X)*length(Y)<=10000}, the \ifun{kim_jennrich_cdf}
+ function will be used to compute the exact probability. Otherwise an
+ asymptotic form will be used.
+\seealso{ks_test, ad_ktest, kuiper_test, kim_jennrich_cdf}
+\done
+
+\function{kuiper_test}
+\synopsis{Perform a 1-sample Kuiper test}
+\usage{pval = kuiper_test (CDF ,&D)}
+\description
+ This function applies the Kuiper test to the data represented by
+ \exmp{CDF} and returns the p-value representing the probability that
+ the data values are ``consistent'' with the underlying distribution
+ function. \opt-3-parm{Kuiper statistic}
+
+ The \exmp{CDF} array that is passed to this function must be computed
+ from the assumed probability distribution function. For example, if
+ the data are constrained to lie between 0 and 1, and the null
+ hypothesis is that they follow a uniform distribution, then the CDF
+ will be equal to the data. In the data are assumed to be normally
+ (Gaussian) distributed, then the \ifun{normal_cdf} function can be
+ used to compute the CDF.
+\example
+ Suppose that X is an array of values obtained from repeated
+ measurements of some quantity. The values are are assumed to follow
+ a normal distribution with a mean of 20 and a standard deviation of
+ 3. The \sfun{ks_test} may be used to test this hypothesis using:
+#v+
+ pval = kuiper_test (normal_cdf(X, 20, 3));
+#v-
+\seealso{kuiper_test2, ks_test, t_test}
+\done
+
+\function{kuiper_test2}
+\synopsis{Perform a 2-sample Kuiper test}
+\usage{pval = kuiper_test2 (X, Y ,&D)}
+\description
+ This function applies the 2-sample Kuiper test to two
+ datasets \exmp{X} and \exmp{Y} and returns p-value for the null
+ hypothesis that they share the same underlying distribution.
+ \opt-3-parm{Kuiper statistic}
+\notes
+ The p-value is computed from an asymptotic formula suggested by
+ Stephens, M.A., Journal of the American Statistical Association, Vol
+ 69, No 347, 1974, pp 730-737.
+\seealso{ks_test2, kuiper_test}
+\done
+
+\function{chisqr_test}
+\synopsis{Apply the Chi-square test to a two or more datasets}
+\usage{prob = chisqr_test (X_1, X_2, ..., X_N ,&t)}
+\description
+ This function applies the Chi-square test to the N datasets
+ \exmp{X_1}, \exmp{X_2}, ..., \exmp{X_N}, and returns the probability
+ that each of the datasets were drawn from the same underlying
+ distribution. Each of the arrays \exmp{X_k} must be the same length.
+ If the last parameter is a reference to a variable, then upon return
+ the variable will be set to the value of the statistic.
+\seealso{chisqr_cdf, ks_test2, mw_test}
+\done
+
+\function{mw_test}
+\synopsis{Apply the Two-sample Wilcoxon-Mann-Whitney test}
+\usage{p = mw_test(X, Y ,&w)}
+\description
+ This function performs a Wilcoxon-Mann-Whitney test and returns the
+ p-value for the null hypothesis that there is no difference between
+ the distributions represented by the datasets \exmp{X} and \exmp{Y}.
+
+ If a third argument is given, it must be a reference to a variable
+ whose value upon return will be to to the rank-sum of \exmp{X}.
+\qualifiers
+ The function makes use of the following qualifiers:
+#v+
+ side=">" : H0: P(X<Y) >= 1/2 (right-tail)
+ side="<" : H0: P(X<Y) <= 1/2 (left-tail)
+#v-
+ The default null hypothesis is that \exmp{P(X<Y)=1/2}.
+\notes
+ There are a number of definitions of this test. While the exact
+ definition of the statistic varies, the p-values are the same.
+
+ If \exmp{length(X)<50}, \exmp{length(Y)} < 50, and ties are not
+ present, then the exact p-value is computed using the
+ \ifun{mann_whitney_cdf} function. Otherwise a normal distribution is
+ used.
+
+ This test is often referred to as the non-parametric generalization
+ of the Student t-test.
+\seealso{mann_whitney_cdf, ks_test2, chisqr_test, t_test}
+\done
+
+
+\function{student_t_cdf}
+\synopsis{Compute the Student-t CDF}
+\usage{cdf = student_t_cdf (t, n)}
+\description
+This function computes the CDF for the Student-t distribution for n
+degrees of freedom.
+\seealso{t_test, normal_cdf}
+\done
+
+\function{f_test2}
+\synopsis{Apply the Two-sample F test}
+\usage{p = f_test2 (X, Y ,&F}
+\description
+ This function computes the two-sample F statistic and its p-value
+ for the data in the \exmp{X} and \exmp{Y} arrays. This test is used
+ to compare the variances of two normally-distributed data sets, with
+ the null hypothesis that the variances are equal. The return value
+ is the p-value, which is computed using the module's \ifun{f_cdf}
+ function.
+\qualifiers
+ The function makes use of the following qualifiers:
+#v+
+ side=">" : H0: VarX >= VarY (right-tail)
+ side="<" : H0: VarX <= VarY (left-tail)
+#v-
+\seealso{f_cdf, ks_test2, chisqr_test}
+\done
+
+\function{t_test}
+\synopsis{Perform a Student t-test}
+\usage{pval = t_test (X, mu ,&t)}
+\description
+ The one-sample t-test may be used to test that the population mean has a
+ specified value under the null hypothesis. Here, \exmp{X} represents a
+ random sample drawn from the population and \exmp{mu} is the
+ specified mean of the population. This function computes Student's
+ t-statistic and returns the p-value
+ that the data X were randomly sampled from a population with the
+ specified mean.
+ \opt-3-parm{statistic}
+\qualifiers
+ The following qualifiers may be used to specify a 1-sided test:
+#v+
+ side="<" Perform a left-tailed test
+ side=">" Perform a right-tailed test
+#v-
+\notes
+ While the parent population need not be normal, the test assumes
+ that random samples drawn from this distribution have means that
+ are normally distributed.
+
+ Strictly speaking, this test should only be used if the variance of
+ the data are equal to that of the assumed parent distribution. Use
+ the Mann-Whitney-Wilcoxon (\exmp{mw_test}) if the underlying
+ distribution is non-normal.
+\seealso{mw_test, t_test2}
+\done
+
+\function{t_test2}
+\synopsis{Perform a 2-sample Student t-test}
+\usage{pval = t_test2 (X, Y ,&t)}
+\description
+ This function compares two data sets \exmp{X} and \exmp{Y} using the
+ Student t-statistic. It is assumed that the the parent populations
+ are normally distributed with equal variance, but with possibly
+ different means. The test is one that looks for differences in the
+ means.
+\notes
+ The \exmp{welch_t_test2} function may be used if it is not known that
+ the parent populations have the same variance.
+\seealso{t_test2, welch_t_test2, mw_test}
+\done
+
+\function{welch_t_test2}
+\synopsis{Perform Welch's t-test}
+\usage{pval = welch_t_test2 (X, Y ,&t)}
+\description
+ This function applies Welch's t-test to the 2 datasets \exmp{X} and
+ \exmp{Y} and returns the p-value that the underlying populations have
+ the same mean. The parent populations are assumed to be normally
+ distributed, but need not have the same variance.
+ \opt-3-parm{statistic}
+\qualifiers
+ The following qualifiers may be used to specify a 1-sided test:
+#v+
+ side="<" Perform a left-tailed test
+ side=">" Perform a right-tailed test
+#v-
+\seealso{t_test2}
+\done
+
+\function{z_test}
+\synopsis{Perform a Z test}
+\usage{pval = z_test (X, mu, sigma ,&z)}
+\description
+ This function applies a Z test to the data \exmp{X} and returns the
+ p-value that the data are consistent with a normally-distributed
+ parent population with a mean of \exmp{mu} and a standard-deviation
+ of \exmp{sigma}. \opt-3-parm{Z statistic}
+\seealso{t_test, mw_test}
+\done
+
+\function{kendall_tau}
+\synopsis{Kendall's tau Correlation Test}
+\usage{pval = kendall_tau (x, y ,&tau)}
+\description
+ This function computes Kendall's tau statistic for the paired data
+ values (x,y), which may or may not have ties. It returns the
+ double-sided p-value associated with the statistic.
+\notes
+ The implementation is based upon Knight's O(nlogn) algorithm
+ described in "A computer method for calculating Kendall’s tau with
+ ungrouped data", Journal of the American Statistical Association, 61,
+ 436-439.
+
+ In the case of no ties, the exact p-value is computed when length(x)
+ is less than 30 using algorithm 71 of Applied Statistics (1974) by
+ Best and Gipps. If ties are present, the the p-value is computed
+ based upon the normal distribution and a continuity correction.
+\qualifiers
+ The following qualifiers may be used to specify a 1-sided test:
+#v+
+ side="<" Perform a left-tailed test
+ side=">" Perform a right-tailed test
+#v-
+\seealso{spearman_r, pearson_r, mann_kendall}
+\done
+
+\function{mann_kendall}
+\synopsis{Mann-Kendall trend test}
+\usage{pval = mann_kendall (y ,&tau)}
+\description
+ The Mann-Kendall test is a non-parametric test that may be used to
+ identify a trend in a set of serial data values. It is closely
+ related to the Kendall's tau correlation test.
+
+ The \ifun{mann_kendall} function returns the double-sided p-value
+ that may be used as a basis for rejecting the the null-hypothesis
+ that there is no trend in the data.
+
+\qualifiers
+ The following qualifiers may be used to specify a 1-sided test:
+#v+
+ side="<" Perform a left-tailed test
+ side=">" Perform a right-tailed test
+#v-
+\seealso{spearman_r, pearson_r, mann_kendall}
+\done
+
+\function{pearson_r}
+\synopsis{Compute Pearson's Correlation Coefficient}
+\usage{pval = pearson_r (X, Y ,&r)}
+\description
+ This function computes Pearson's r correlation coefficient of the two
+ datasets \exmp{X} and \exmp{Y}. It returns the the p-value that
+ \exmp{x} and \exmp{y} are mutually independent.
+ \opt-3-parm{correlation coefficient}
+\qualifiers
+ The following qualifiers may be used to specify a 1-sided test:
+#v+
+ side="<" Perform a left-tailed test
+ side=">" Perform a right-tailed test
+#v-
+\seealso{kendall_tau, spearman_r}
+\done
+
+\function{spearman_r}
+\synopsis{Spearman's Rank Correlation test}
+\usage{pval = spearman_r(x, y ,&r)}
+\description
+ This function computes the Spearman rank correlation coefficient (r)
+ and returns the p-value that \exmp{x} and \exmp{y} are mutually
+ independent.
+ \opt-3-parm{correlation coefficient}
+\qualifiers
+ The following qualifiers may be used to specify a 1-sided test:
+#v+
+ side="<" Perform a left-tailed test
+ side=">" Perform a right-tailed test
+#v-
+\seealso{kendall_tau, pearson_r}
+\done
+
+\function{correlation}
+\synopsis{Compute the sample correlation between two datasets}
+\usage{c = correlation (x, y)}
+\description
+ This function computes Pearson's sample correlation coefficient
+ between 2 arrays. It is assumed that the standard deviation of each
+ array is finite and non-zero. The returned value falls in the
+ range -1 to 1, with -1 indicating that the data are anti-correlated,
+ and +1 indicating that the data are completely correlated.
+\seealso{covariance, stddev}
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/varray-module.c Added

@@ -0,0 +1,277 @@
+/* -*- mode: C; mode: fold -*-
+Copyright (C) 2010-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include "config.h"
+
+#include <stdio.h>
+#include <string.h>
+#include <slang.h>
+
+SLANG_MODULE(varray);
+
+#ifdef HAVE_MMAP
+
+# include <sys/types.h>
+# include <sys/stat.h>
+# ifdef HAVE_SYS_MMAN_H
+# include <sys/mman.h>
+# endif
+
+# ifndef MAP_FAILED
+# define MAP_FAILED	-1
+# endif
+
+typedef struct
+{
+ size_t size_mmapped;
+ VOID_STAR addr;
+ VOID_STAR data;
+}
+MMap_Type;
+
+static void free_mmap_type (MMap_Type *m)
+{
+ if (m == NULL)
+ return;
+ if (m->addr != NULL)
+ (void) munmap ((char *) m->addr, m->size_mmapped);
+ SLfree ((char *)m);
+}
+
+static void unmmap_array (SLang_Array_Type *at)
+{
+ if (at->client_data != NULL)
+ free_mmap_type ((MMap_Type *) at->client_data);
+
+ at->data = NULL;
+ at->client_data = NULL;
+}
+
+static MMap_Type *mmap_file (char *file, size_t offset, size_t num_bytes)
+{
+ FILE *fp;
+ int fd;
+ struct stat st;
+ VOID_STAR addr;
+ MMap_Type *m;
+
+ fp = fopen (file, "rb");
+ if (fp == NULL)
+ {
+	SLang_verror (SL_OBJ_NOPEN, "mmap_array: unable to open %s for reading", file);
+	return NULL;
+ }
+ fd = fileno (fp);
+
+ if (-1 == fstat (fd, &st))
+ {
+	SLang_verror (SL_INTRINSIC_ERROR, "mmap_array: stat %s failed", file);
+	fclose (fp);
+	return NULL;
+ }
+
+ if (NULL == (m = (MMap_Type *) SLmalloc (sizeof (MMap_Type))))
+ {
+	fclose (fp);
+	return NULL;
+ }
+
+ m->size_mmapped = num_bytes + offset;
+ addr = (VOID_STAR)mmap (NULL, m->size_mmapped, PROT_READ, MAP_SHARED, fd, 0);
+ if (addr == (VOID_STAR)MAP_FAILED)
+ {
+	SLang_verror (SL_INTRINSIC_ERROR, "mmap_array: mmap %s failed", file);
+	SLfree ((char *) m);
+	fclose (fp);
+	return NULL;
+ }
+ m->addr = addr;
+ m->data = (VOID_STAR) ((char *)addr + offset);
+
+ fclose (fp);
+
+ return m;
+}
+
+#if 0
+static int pop_off_t (off_t *op)
+{
+#if defined(HAVE_LONG_LONG) && (SIZEOF_OFF_T == SIZEOF_LONG_LONG) && (SIZEOF_LONG_LONG > SIZEOF_LONG)
+ return SLang_pop_long_long (op);
+#else
+ long ofs;
+ if (-1 == SLang_pop_long (&ofs))
+ return -1;
+ *op = (off_t) ofs;
+ return 0;
+#endif
+}
+#endif
+
+static int pop_size_t (size_t *sp)
+{
+#if defined(HAVE_LONG_LONG) && (SIZEOF_SIZE_T == SIZEOF_LONG_LONG) && (SIZEOF_LONG_LONG > SIZEOF_LONG)
+ return SLang_pop_ulong_long (sp);
+#else
+ unsigned long s;
+ if (-1 == SLang_pop_ulong (&s))
+ return -1;
+ *sp = (size_t) s;
+ return 0;
+#endif
+}
+
+/* usage:
+ * a = mmap_array (file, offset, type, dims);
+ */
+static void mmap_array (void)
+{
+ SLang_Array_Type *a, *a_dims;
+ char *file;
+ SLtype type;
+ SLindex_Type *dims;
+ unsigned int num_dims;
+ unsigned int i;
+ SLuindex_Type num_elements;
+ size_t offset;
+ size_t sizeof_type;
+ size_t num_bytes;
+ MMap_Type *m;
+
+ m = NULL;
+ a_dims = NULL;
+ file = NULL;
+
+ if (-1 == SLang_pop_array_of_type (&a_dims, SLANG_ARRAY_INDEX_TYPE))
+ return;
+
+ num_dims = a_dims->num_elements;
+ dims = (SLindex_Type *)a_dims->data;
+
+ if (-1 == SLang_pop_datatype (&type))
+ goto return_error;
+
+ switch (type)
+ {
+ case SLANG_CHAR_TYPE:
+ case SLANG_UCHAR_TYPE:
+	sizeof_type = 1;
+	break;
+
+ case SLANG_SHORT_TYPE:
+ case SLANG_USHORT_TYPE:
+	sizeof_type = sizeof(short);
+	break;
+
+ case SLANG_INT_TYPE:
+ case SLANG_UINT_TYPE:
+	sizeof_type = sizeof (int);
+	break;
+
+ case SLANG_LONG_TYPE:
+ case SLANG_ULONG_TYPE:
+	sizeof_type = sizeof (long);
+	break;
+
+ case SLANG_FLOAT_TYPE:
+	sizeof_type = sizeof (float);
+	break;
+
+ case SLANG_DOUBLE_TYPE:
+	sizeof_type = sizeof (double);
+	break;
+
+ case SLANG_COMPLEX_TYPE:
+	sizeof_type = 2 * sizeof (double);
+	break;
+
+ default:
+	SLang_verror (SL_NOT_IMPLEMENTED, "mmap_array: unsupported data type");
+	goto return_error;
+ }
+
+ num_elements = 1;
+ for (i = 0; i < num_dims; i++)
+ {
+	if (dimsi < 0)
+	 {
+	 SLang_verror (SL_INVALID_PARM, "mmap_array: dims array must be positive");
+	 goto return_error;
+	 }
+
+	num_elements *= dimsi;
+ }
+ if (num_dims == 0)
+ num_elements = 0;
+
+ num_bytes = sizeof_type * num_elements;
+
+ if (-1 == pop_size_t (&offset))
+ goto return_error;
+
+ if (-1 == SLang_pop_slstring (&file))
+ goto return_error;
+
+ if (NULL == (m = mmap_file (file, offset, num_bytes)))
+ goto return_error;
+
+ if (NULL == (a = SLang_create_array (type, 1, m->data, dims, num_dims)))
+ goto return_error;
+
+ a->free_fun = unmmap_array;
+ a->client_data = (VOID_STAR) m;
+
+ m = NULL;			 /* done with this */
+
+ (void) SLang_push_array (a, 1);
+
+ /* drop */
+
+ return_error:
+ if (m != NULL)
+ free_mmap_type (m);
+ if (a_dims != NULL)
+ SLang_free_array (a_dims);
+ if (file != NULL)
+ SLang_free_slstring (file);
+}
+#endif				 /* HAVE_MMAP */
+
+static SLang_Intrin_Fun_Type Module_Intrinsics =
+{
+#ifdef HAVE_MMAP
+ MAKE_INTRINSIC_0("mmap_array", mmap_array, SLANG_VOID_TYPE),
+#endif
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+int init_varray_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns;
+
+ if (NULL == (ns = SLns_create_namespace (ns_name)))
+ return -1;
+
+ if (-1 == SLns_add_intrin_fun_table (ns, Module_Intrinsics, NULL))
+ return -1;
+
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/modules/varray.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/modules/zlib-module.c Added

@@ -0,0 +1,637 @@
+/* -*- mode: C; mode: fold; -*- */
+/*
+Copyright (C) 2008-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "config.h"
+
+#include <stdio.h>
+#include <errno.h>
+#include <slang.h>
+
+#include <string.h>
+#include <zlib.h>
+
+SLANG_MODULE(zlib);
+
+static SLFUTURE_CONST char *Module_Version_String = "0.1.0";
+#define MODULE_VERSION_NUMBER (0*10000 + 1*100 + 0)
+
+typedef struct
+{
+ int type;
+#define DEFLATE_TYPE 1
+#define INFLATE_TYPE 2
+
+ int initialized;
+ z_stream zs;
+
+#define DEFAULT_START_BUFLEN 0x4000
+ SLstrlen_Type start_buflen;
+#define DEFAULT_BUFLEN_INC 0x4000
+ SLstrlen_Type dbuflen;
+ int windowbits;
+}
+ZLib_Type;
+
+static int ZLib_Type_Id = -1;
+int ZLib_Error = -1;
+
+static int check_zerror (int e)
+{
+ switch (e)
+ {
+ case Z_ERRNO:
+	e = errno;
+	(void) SLerrno_set_errno (e);
+	SLang_verror (ZLib_Error, "Z library errno error: %s", SLerrno_strerror(e));
+	break;
+
+ case Z_STREAM_ERROR:
+	SLang_verror (ZLib_Error, "Z library stream error");
+	break;
+
+ case Z_DATA_ERROR:
+	SLang_verror (ZLib_Error, "Z library data error");
+	break;
+
+ case Z_MEM_ERROR:
+	SLang_verror (SL_Malloc_Error, "Z library memory allocation error");
+	break;
+
+ case Z_BUF_ERROR:
+	SLang_verror (ZLib_Error, "Z library buffer error");
+	break;
+
+ case Z_VERSION_ERROR:
+	SLang_verror (ZLib_Error, "Z library version mismatch error");
+	break;
+
+ case Z_NEED_DICT:		 /* not handled by this module */
+	SLang_verror (ZLib_Error, "Z library dictionary error");
+	break;
+
+ default:
+	if (e >= 0)
+	 return 0;
+
+	SLang_verror (ZLib_Error, "Unknown Error Code");
+ }
+ return -1;
+}
+
+static int check_deflate_object (ZLib_Type *zp)
+{
+ if (zp->type != DEFLATE_TYPE)
+ {
+	SLang_verror (SL_TypeMismatch_Error, "Expecting a Zlib_Type deflate object");
+	return -1;
+ }
+ return 0;
+}
+
+static int check_inflate_object (ZLib_Type *zp)
+{
+ if (zp->type != INFLATE_TYPE)
+ {
+	SLang_verror (SL_TypeMismatch_Error, "Expecting a Zlib_Type inflate object");
+	return -1;
+ }
+ return 0;
+}
+
+static int init_deflate_object (ZLib_Type *z,
+				int level, int method, int windowbits,
+				int memlevel, int strategy)
+{
+ z_stream *zs;
+ int ret;
+
+ memset ((char *) z, 0, sizeof(ZLib_Type));
+ z->type = DEFLATE_TYPE;
+ z->start_buflen = DEFAULT_START_BUFLEN;
+ z->dbuflen = DEFAULT_BUFLEN_INC;
+
+ zs = &z->zs;
+
+ zs->zalloc = Z_NULL;
+ zs->zfree = Z_NULL;
+ zs->opaque = Z_NULL;
+
+ ret = deflateInit2 (zs, level, method, windowbits, memlevel, strategy);
+ if (ret == Z_STREAM_ERROR)
+ {
+	SLang_verror (ZLib_Error, "One of more deflate parameters are invalid.");
+	deflateEnd (zs);
+ }
+
+ if (-1 == check_zerror (ret))
+ {
+	deflateEnd (zs);
+	return -1;
+ }
+
+ z->initialized = 1;
+ return 0;
+}
+
+static int run_deflate (ZLib_Type *z, int flush,
+			unsigned char *str, SLstrlen_Type len,
+			unsigned char **bufp, SLstrlen_Type *totalp)
+{
+ z_stream *zs;
+ unsigned char *buf;
+ SLstrlen_Type buflen;
+
+ zs = &z->zs;
+
+ buflen = z->start_buflen;
+ if (NULL == (buf = (unsigned char *) SLmalloc (buflen+1)))
+ {
+	*bufp = NULL;
+	*totalp = 0;
+	return -1;
+ }
+
+ zs->next_in = str;
+ zs->avail_in = len;
+ zs->next_out = buf;
+ zs->avail_out = buflen;
+
+ while (1)
+ {
+	SLstrlen_Type total;
+	int ret;
+
+	ret = deflate (zs, flush);
+
+	if (ret != Z_BUF_ERROR)
+	 {
+	 if (-1 == check_zerror (ret))
+	 goto return_error;
+	 }
+
+	total = buflen - zs->avail_out;
+
+	if (/* done -- flush == Z_FINISH */
+	 (ret == Z_STREAM_END)
+	 /* Done with current input */
+	 || ((zs->avail_in == 0) && (zs->avail_out != 0))
+	 )
+	 {
+	 if (total != buflen)
+	 {
+		 unsigned char *new_buf;
+
+		 new_buf = (unsigned char *) SLrealloc ((char *)buf, total+1);
+		 if (new_buf == NULL)
+		 goto return_error;
+
+		 buf = new_buf;
+	 }
+	 buftotal = 0;	 /* ok, because of +1 in malloc calls */
+	 *bufp = buf;
+	 *totalp = total;
+	 return 0;
+	 }
+
+	if (zs->avail_out == 0)
+	 {
+	 unsigned char *new_buf;
+	 SLstrlen_Type dbuflen = z->dbuflen;
+	 buflen += dbuflen;
+	 new_buf = (unsigned char *)SLrealloc ((char *) buf, buflen+1);
+	 if (new_buf == NULL)
+	 goto return_error;
+
+	 buf = new_buf;
+	 zs->avail_out = dbuflen;
+	 zs->next_out = buf + total;
+	 }
+ }
+
+return_error:
+ SLfree ((char *) buf);
+ *bufp = NULL;
+ *totalp = 0;
+ return -1;
+}
+
+static void deflate_intrin (ZLib_Type *zp, SLang_BString_Type *inbstr, int *flush)
+{
+ SLang_BString_Type *outbstr;
+ unsigned char *inbuf, *outbuf;
+ SLstrlen_Type inlen, outlen;
+
+ if (-1 == check_deflate_object (zp))
+ return;
+
+ if (NULL == (inbuf = SLbstring_get_pointer (inbstr, &inlen)))
+ return;
+
+ if (zp->start_buflen < inlen)
+ zp->start_buflen = inlen;
+
+ if (-1 == run_deflate (zp, *flush, inbuf, inlen, &outbuf, &outlen))
+ return;
+
+ if (NULL == (outbstr = SLbstring_create_malloced (outbuf, outlen, 1)))
+ return;
+
+ (void) SLang_push_bstring (outbstr);
+ SLbstring_free (outbstr);
+}
+
+static void deflate_reset_intrin (ZLib_Type *z)
+{
+ if (-1 == check_deflate_object (z))
+ return;
+
+ check_zerror (deflateReset (&z->zs));
+}
+
+static void deflate_flush_intrin (ZLib_Type *z, int *flush)
+{
+ unsigned char *buf;
+ SLstrlen_Type len;
+ SLang_BString_Type *bstr;
+
+ if (-1 == check_deflate_object (z))
+ return;
+
+ if (-1 == run_deflate (z, *flush, (unsigned char *)"", 0, &buf, &len))
+ return;
+
+ if (NULL == (bstr = SLbstring_create_malloced (buf, len, 1)))
+ return;
+
+ (void) SLang_push_bstring (bstr);
+ SLbstring_free (bstr);
+}
+
+static void free_deflate_object (ZLib_Type *z)
+{
+ if (z->initialized)
+ deflateEnd (&z->zs);
+ SLfree ((char *) z);
+}
+
+static void deflate_new_intrin (int *level, int *method, int *wbits,
+				int *memlevel, int *strategy)
+{
+ /* According to the docs, the parameters are checked by deflateInit2 */
+ ZLib_Type *z;
+ SLang_MMT_Type *mmt;
+
+ if (NULL == (z = (ZLib_Type *) SLmalloc (sizeof (ZLib_Type))))
+ return;
+
+ if (-1 == init_deflate_object (z, *level, *method, *wbits, *memlevel, *strategy))
+ {
+	SLfree ((char *) z);
+	return;
+ }
+
+ if (NULL == (mmt = SLang_create_mmt (ZLib_Type_Id, (VOID_STAR) z)))
+ {
+	free_deflate_object (z);
+	return;
+ }
+
+ if (0 == SLang_push_mmt (mmt))
+ return;
+
+ SLang_free_mmt (mmt);
+}
+
+static int run_inflate (ZLib_Type *z, int flush,
+			unsigned char *str, SLstrlen_Type len,
+			unsigned char **bufp, SLstrlen_Type *totalp)
+{
+ z_stream *zs;
+ unsigned char *buf;
+ SLstrlen_Type buflen;
+
+ zs = &z->zs;
+ zs->next_in = str;
+ zs->avail_in = len;
+
+ if (z->initialized == 0)
+ {
+	zs = &z->zs;
+	zs->zalloc = Z_NULL;
+	zs->zfree = Z_NULL;
+	zs->opaque = Z_NULL;
+
+	if (-1 == check_zerror (inflateInit2 (zs, z->windowbits)))
+	 {
+	 inflateEnd (zs);
+	 return -1;
+	 }
+	z->initialized = 1;
+ }
+
+ buflen = z->start_buflen;
+ if (NULL == (buf = (unsigned char *) SLmalloc (buflen+1)))
+ {
+	*bufp = NULL;
+	*totalp = 0;
+	return -1;
+ }
+ zs->next_out = buf;
+ zs->avail_out = buflen;
+
+ while (1)
+ {
+	SLstrlen_Type total;
+	int ret;
+
+	ret = inflate (zs, flush);
+
+	if (ret != Z_BUF_ERROR)
+	 {
+	 if (-1 == check_zerror (ret))
+	 goto return_error;
+	 }
+
+	total = buflen - zs->avail_out;
+
+	if (/* done -- flush == Z_FINISH */
+	 (ret == Z_STREAM_END)
+	 /* Done with current input */
+	 || ((zs->avail_in == 0) && (zs->avail_out != 0))
+	 )
+	 {
+	 if (total != buflen)
+	 {
+		 unsigned char *new_buf;
+
+		 new_buf = (unsigned char *) SLrealloc ((char *)buf, total+1);
+		 if (new_buf == NULL)
+		 goto return_error;
+
+		 buf = new_buf;
+	 }
+	 buftotal = 0;	 /* ok, because of +1 in malloc calls */
+	 *bufp = buf;
+	 *totalp = total;
+	 return 0;
+	 }
+
+	if (zs->avail_out == 0)
+	 {
+	 unsigned char *new_buf;
+	 SLstrlen_Type dbuflen = z->dbuflen;
+	 buflen += dbuflen;
+	 new_buf = (unsigned char *)SLrealloc ((char *) buf, buflen+1);
+	 if (new_buf == NULL)
+	 goto return_error;
+
+	 buf = new_buf;
+	 zs->avail_out = dbuflen;
+	 zs->next_out = buf + total;
+	 }
+ }
+
+return_error:
+ SLfree ((char *) buf);
+ *bufp = NULL;
+ *totalp = 0;
+ return -1;
+}
+
+static void inflate_intrin (ZLib_Type *zp, SLang_BString_Type *inbstr, int *flush)
+{
+ SLang_BString_Type *outbstr;
+ unsigned char *inbuf, *outbuf;
+ SLstrlen_Type inlen, outlen;
+
+ if (-1 == check_inflate_object (zp))
+ return;
+
+ if (NULL == (inbuf = SLbstring_get_pointer (inbstr, &inlen)))
+ return;
+
+ if (zp->start_buflen < inlen)
+ zp->start_buflen = inlen;
+
+ if (-1 == run_inflate (zp, *flush, inbuf, inlen, &outbuf, &outlen))
+ return;
+
+ if (NULL == (outbstr = SLbstring_create_malloced (outbuf, outlen, 1)))
+ return;
+
+ (void) SLang_push_bstring (outbstr);
+ SLbstring_free (outbstr);
+}
+
+static int init_inflate_object (ZLib_Type *z, int windowbits)
+{
+ memset ((char *) z, 0, sizeof(ZLib_Type));
+ z->type = INFLATE_TYPE;
+ z->windowbits = windowbits;
+ z->initialized = 0;
+ z->start_buflen = DEFAULT_START_BUFLEN;
+ z->dbuflen = DEFAULT_BUFLEN_INC;
+ return 0;
+}
+
+static void inflate_new_intrin (int *windowbits)
+{
+ ZLib_Type *z;
+ SLang_MMT_Type *mmt;
+
+ if (NULL == (z = (ZLib_Type *) SLmalloc (sizeof (ZLib_Type))))
+ return;
+
+ if (-1 == init_inflate_object (z, *windowbits))
+ {
+	SLfree ((char *) z);
+	return;
+ }
+
+ if (NULL == (mmt = SLang_create_mmt (ZLib_Type_Id, (VOID_STAR) z)))
+ {
+	free_deflate_object (z);
+	return;
+ }
+
+ if (0 == SLang_push_mmt (mmt))
+ return;
+
+ SLang_free_mmt (mmt);
+}
+
+static void inflate_reset_intrin (ZLib_Type *z)
+{
+ if (-1 == check_inflate_object (z))
+ return;
+
+ if (z->initialized)
+ check_zerror (deflateReset (&z->zs));
+}
+
+static void inflate_flush_intrin (ZLib_Type *z, int *flush)
+{
+ unsigned char *buf;
+ SLstrlen_Type len;
+ SLang_BString_Type *bstr;
+
+ if (-1 == check_inflate_object (z))
+ return;
+
+ if (-1 == run_inflate (z, *flush, (unsigned char *)"", 0, &buf, &len))
+ return;
+
+ if (NULL == (bstr = SLbstring_create_malloced (buf, len, 1)))
+ return;
+
+ (void) SLang_push_bstring (bstr);
+ SLbstring_free (bstr);
+}
+
+static void free_inflate_object (ZLib_Type *z)
+{
+ if (z->initialized)
+ inflateEnd (&z->zs);
+ SLfree ((char *) z);
+}
+
+static void destroy_zlib_type (SLtype type, VOID_STAR f)
+{
+ ZLib_Type *z;
+ (void) type;
+
+ z = (ZLib_Type *) f;
+ if (z->type == DEFLATE_TYPE)
+ free_deflate_object (z);
+ else
+ free_inflate_object (z);
+}
+
+static const char *zlib_version_intrin (void)
+{
+ return zlibVersion ();
+}
+
+#define DUMMY_ZLIB_TYPE ((SLtype)-1)
+#define I SLANG_INT_TYPE
+#define B SLANG_BSTRING_TYPE
+static SLang_Intrin_Fun_Type Module_Intrinsics =
+{
+ MAKE_INTRINSIC_0("zlib_version", zlib_version_intrin, SLANG_STRING_TYPE),
+ MAKE_INTRINSIC_5("_zlib_deflate_new", deflate_new_intrin, SLANG_VOID_TYPE, I, I, I, I, I),
+ MAKE_INTRINSIC_3("_zlib_deflate", deflate_intrin, SLANG_VOID_TYPE, DUMMY_ZLIB_TYPE, B, I),
+ MAKE_INTRINSIC_2("_zlib_deflate_flush", deflate_flush_intrin, SLANG_VOID_TYPE, DUMMY_ZLIB_TYPE, I),
+ MAKE_INTRINSIC_1("_zlib_deflate_reset", deflate_reset_intrin, SLANG_VOID_TYPE, DUMMY_ZLIB_TYPE),
+
+ MAKE_INTRINSIC_1("_zlib_inflate_new", inflate_new_intrin, SLANG_VOID_TYPE, I),
+ MAKE_INTRINSIC_3("_zlib_inflate", inflate_intrin, SLANG_VOID_TYPE, DUMMY_ZLIB_TYPE, B, I),
+ MAKE_INTRINSIC_2("_zlib_inflate_flush", inflate_flush_intrin, SLANG_VOID_TYPE, DUMMY_ZLIB_TYPE, I),
+ MAKE_INTRINSIC_1("_zlib_inflate_reset", inflate_reset_intrin, SLANG_VOID_TYPE, DUMMY_ZLIB_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+#undef I
+
+static SLang_Intrin_Var_Type Module_Variables =
+{
+ MAKE_VARIABLE("_zlib_module_version_string", &Module_Version_String, SLANG_STRING_TYPE, 1),
+ SLANG_END_INTRIN_VAR_TABLE
+};
+
+static SLang_IConstant_Type Module_IConstants =
+{
+ MAKE_ICONSTANT("_zlib_module_version", MODULE_VERSION_NUMBER),
+
+ MAKE_ICONSTANT("ZLIB_NO_COMPRESSION", Z_NO_COMPRESSION),
+ MAKE_ICONSTANT("ZLIB_BEST_SPEED", Z_BEST_SPEED),
+ MAKE_ICONSTANT("ZLIB_BEST_COMPRESSION", Z_BEST_COMPRESSION),
+ MAKE_ICONSTANT("ZLIB_DEFAULT_COMPRESSION", Z_DEFAULT_COMPRESSION),
+
+ MAKE_ICONSTANT("ZLIB_NO_FLUSH", Z_NO_FLUSH),
+ MAKE_ICONSTANT("ZLIB_SYNC_FLUSH", Z_SYNC_FLUSH),
+ MAKE_ICONSTANT("ZLIB_FULL_FLUSH", Z_FULL_FLUSH),
+ MAKE_ICONSTANT("ZLIB_FINISH", Z_FINISH),
+
+ MAKE_ICONSTANT("ZLIB_FILTERED", Z_FILTERED),
+ MAKE_ICONSTANT("ZLIB_HUFFMAN_ONLY", Z_HUFFMAN_ONLY),
+#ifdef Z_RLE
+ MAKE_ICONSTANT("ZLIB_RLE", Z_RLE),
+#endif
+#ifdef Z_FIXED
+ MAKE_ICONSTANT("ZLIB_FIXED", Z_FIXED),
+#endif
+ MAKE_ICONSTANT("ZLIB_DEFAULT_STRATEGY", Z_DEFAULT_STRATEGY),
+
+ MAKE_ICONSTANT("ZLIB_DEFLATED", Z_DEFLATED),
+ SLANG_END_ICONST_TABLE
+};
+
+static int register_classes (void)
+{
+ SLang_Class_Type *cl;
+
+ if (ZLib_Type_Id != -1)
+ return 0;
+
+ if (NULL == (cl = SLclass_allocate_class ("ZLib_Type")))
+ return -1;
+
+ (void) SLclass_set_destroy_function (cl, destroy_zlib_type);
+
+ if (-1 == SLclass_register_class (cl, SLANG_VOID_TYPE,
+				 sizeof (ZLib_Type),
+				 SLANG_CLASS_TYPE_MMT))
+ return -1;
+
+ ZLib_Type_Id = SLclass_get_class_id (cl);
+ if (-1 == SLclass_patch_intrin_fun_table1 (Module_Intrinsics, DUMMY_ZLIB_TYPE, ZLib_Type_Id))
+ return -1;
+
+ return 0;
+}
+
+int init_zlib_module_ns (char *ns_name)
+{
+ SLang_NameSpace_Type *ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return -1;
+
+ if (-1 == register_classes ())
+ return -1;
+
+ if ((-1 == ZLib_Error)
+ && (-1 == (ZLib_Error = SLerr_new_exception (SL_RunTime_Error, "ZLibError", "ZLib Error"))))
+ return -1;
+
+ if (
+ (-1 == SLns_add_intrin_var_table (ns, Module_Variables, NULL))
+ || (-1 == SLns_add_intrin_fun_table (ns, Module_Intrinsics, NULL))
+ || (-1 == SLns_add_iconstant_table (ns, Module_IConstants, NULL))
+ )
+ return -1;
+
+ return 0;
+}
+
+/* This function is optional */
+void deinit_zlib_module (void)
+{
+}

_service:tar_scm:slang-2.3.2.tar.bz2/modules/zlib.sl Added

@@ -0,0 +1,149 @@
+% -*- mode: slang; mode: fold -*-
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License.  See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+import ("zlib");
+
+%{{{ Deflate Object and methods
+private define deflate_method ()
+{
+   if (_NARGS != 2)
+     {
+	_pop_n (_NARGS);
+	usage (".deflate(str ;flush=val)");
+     }
+   variable z, b;
+   (z, b) = ();
+   return _zlib_deflate (z.zobj, b, qualifier("flush", ZLIB_NO_FLUSH));
+}
+
+private define def_reset_method (z)
+{
+   _zlib_deflate_reset (z.zobj);
+}
+
+private define def_flush_method ()
+{
+   variable z, flush = ZLIB_FINISH;
+   switch (_NARGS)
+     {
+      case 2:
+	(z, flush) = ();
+     }
+     {
+      case 1:
+	z = ();
+     }
+     {
+	_pop_n (_NARGS);
+	usage (".flush (val);  Default is ZLIB_FINISH");
+     }
+
+   return _zlib_deflate_flush (z.zobj, flush);
+}
+
+private variable Deflate_Object = struct
+{
+   zobj,
+   deflate = &deflate_method,
+   reset = &def_reset_method,
+   flush = &def_flush_method,
+};
+
+define zlib_deflate_new ()
+{
+   variable z = @Deflate_Object;
+   z.zobj = _zlib_deflate_new (qualifier ("level", ZLIB_DEFAULT_COMPRESSION),
+			       qualifier ("method", ZLIB_DEFLATED),
+			       qualifier ("wbits", 15),
+			       qualifier ("memlevel", 8),
+			       qualifier ("strategy", ZLIB_DEFAULT_STRATEGY));
+   return z;
+}
+
+%}}}
+
+%{{{ Inflate Object and methods
+
+private define inflate_method ()
+{
+   if (_NARGS != 2)
+     {
+	_pop_n (_NARGS);
+	usage (".inflate(str ;flush=val)");
+     }
+   variable z, b;
+   (z, b) = ();
+   return _zlib_inflate (z.zobj, b, qualifier("flush", ZLIB_NO_FLUSH));
+}
+
+private define inf_reset_method (z)
+{
+   _zlib_inflate_reset (z.zobj);
+}
+
+private define inf_flush_method ()
+{
+   variable z, flush = ZLIB_FINISH;
+   switch (_NARGS)
+     {
+      case 2:
+	(z, flush) = ();
+     }
+     {
+      case 1:
+	z = ();
+     }
+     {
+	_pop_n (_NARGS);
+	usage (".flush (val);  Default is ZLIB_FINISH");
+     }
+
+   return _zlib_inflate_flush (z.zobj, flush);
+}
+
+private variable Inflate_Object = struct
+{
+   zobj,
+   inflate = &inflate_method,
+   reset = &inf_reset_method,
+   flush = &inf_flush_method,
+};
+
+define zlib_inflate_new ()
+{
+   variable z = @Inflate_Object;
+   z.zobj = _zlib_inflate_new (qualifier ("wbits", 15));
+   return z;
+}
+
+%}}}
+
+define zlib_deflate ()
+{
+   if (_NARGS != 1)
+     {
+	usage ("zstr = zlib_deflate (str ;qualifiers)\n"
+	       + " qualifiers:\n"
+	       + "  level=val, method=val, wbits=val, memlevel=val, strategy=val");
+     }
+   variable bstr = ();
+   variable z = zlib_deflate_new (;; __qualifiers);
+
+   return _zlib_deflate (z.zobj, bstr, ZLIB_FINISH);
+}
+
+define zlib_inflate ()
+{
+   if (_NARGS != 1)
+     {
+	usage ("str = zlib_inflate (zstr ;wbits=val)");
+     }
+
+   variable zstr = ();
+   variable z = zlib_inflate_new (;; __qualifiers);
+   return _zlib_inflate (z.zobj, zstr, ZLIB_FINISH);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slang.lis Added

@@ -0,0 +1,596 @@
+@COPYING
+@INSTALL.pc
+@INSTALL.unx
+@INSTALL.vms
+@NEWS
+@README
+@UPGRADE.txt
+
+@mkfiles/build.bat
+@mkfiles/build.sh 0755
+@mkfiles/makefile.dos
+@mkfiles/makefile.sh
+@mkfiles/install.sl
+@mkfiles/m32init.bat
+@mkfiles/README
+@mkfiles/runslsh.bat
+@mkfiles/makefile.m32
+
+@autoconf/Makefile
+@autoconf/Makefile.in
+@autoconf/aclocal.m4
+@autoconf/config.guess 0755
+@autoconf/config.sub 0755
+@autoconf/configure.ac
+@autoconf/install.sh 0755
+@autoconf/mkinsdir.sh 0755
+@autoconf/iconv.m4
+@autoconf/slangpc.in
+@autoconf/scripts/getsyslibs.sh 0755
+
+@changes.txt
+@configure 0755
+@demo/Makefile.in
+@demo/Makefile.w32
+@demo/README
+#@demo/configure 0755
+#@demo/configure.in
+@demo/demolib.c
+@demo/keypad.c
+#@demo/modules.unx
+@demo/pager.c
+@demo/smgtest.c
+@demo/useropen.c
+@demo/rline.c
+
+@doc/OLD/help/README
+@doc/OLD/help/makefile.djg
+@doc/OLD/help/makefile.os2
+@doc/OLD/help/makefile.unx
+@doc/OLD/help/slang.hlp
+@doc/OLD/help/slhelp.c
+@doc/README
+@doc/grammar.txt
+@doc/internal/rpn.txt
+@doc/slangdoc.html
+@doc/text/cref.txt
+@doc/text/cslang.txt
+@doc/text/slang.txt
+@doc/text/slangfun.txt
+@doc/tm/Makefile
+@doc/tm/local.tm
+@doc/tm/hlpdefs.tm
+@doc/tm/copyright.tm
+@doc/tm/cref.tm
+@doc/tm/crtl/slalloc.tm
+@doc/tm/crtl/slinterp.tm
+@doc/tm/crtl/slsearch.tm
+@doc/tm/crtl/slutf8.tm
+@doc/tm/crtl/slerr.tm
+@doc/tm/crtl/slkeymap.tm
+@doc/tm/crtl/slsmg.tm
+@doc/tm/crtl/slwchar.tm
+@doc/tm/crtl/slinit.tm
+@doc/tm/crtl/slmisc.tm
+@doc/tm/crtl/sltty.tm
+@doc/tm/crtl/undoc.tm
+@doc/tm/cslang.tm
+@doc/tm/fixtex.sl
+@doc/tm/intnews.tm
+@doc/tm/apinews.tm
+@doc/tm/preface.tm
+@doc/tm/regexp.tm
+@doc/tm/rtl/array.tm
+@doc/tm/rtl/assoc.tm
+@doc/tm/rtl/bstr.tm
+@doc/tm/rtl/datatype.tm
+@doc/tm/rtl/debug.tm
+@doc/tm/rtl/dir.tm
+@doc/tm/rtl/eval.tm
+@doc/tm/rtl/import.tm
+@doc/tm/rtl/info.tm
+@doc/tm/rtl/list.tm
+@doc/tm/rtl/math.tm
+@doc/tm/rtl/message.tm
+@doc/tm/rtl/misc.tm
+@doc/tm/rtl/ospath.tm
+@doc/tm/rtl/posio.tm
+@doc/tm/rtl/posix.tm
+@doc/tm/rtl/qualif.tm
+@doc/tm/rtl/rline.tm
+@doc/tm/rtl/signal.tm
+@doc/tm/rtl/stack.tm
+@doc/tm/rtl/stdio.tm
+@doc/tm/rtl/strops.tm
+@doc/tm/rtl/struct.tm
+@doc/tm/rtl/time.tm
+@doc/tm/rtl/checktm.sl 0755
+@doc/tm/rtl/tm-sort.sl 0755
+@doc/tm/rtl/whatelse.sl 0755
+@doc/tm/rtl/type.tm
+@doc/tm/slang.tm
+@doc/tm/slangfun.tm
+@doc/tm/tools/Makefile
+@doc/tm/tools/README
+@doc/tm/tools/sl2tm.c
+@doc/tm/tools/tm2txt.c
+@doc/tm/tools/fixtxt 0755
+@examples/assoc.sl
+@examples/colormap.sl
+@examples/life.sl
+@examples/prime.sl 0755
+@examples/saveobj.sl
+@examples/sort.sl 0755
+@examples/utmp.sl
+@examples/slsmgex2.sl
+
+@modules/mkfiles/makefile.all
+@modules/mkfiles/README
+@modules/Makefile.in
+@modules/README
+@modules/base64-module.c
+@modules/base64.sl
+@modules/chksum-module.c
+@modules/chksum_sha1.c
+@modules/chksum_md5.c
+@modules/chksum.h
+@modules/chksum.sl
+@modules/csv-module.c
+@modules/csv.sl
+@modules/fcntl-module.c
+@modules/fcntl.sl
+@modules/fork.sl
+@modules/fork-module.c
+@modules/histogram.sl
+@modules/histogram-module.inc
+@modules/histogram-module.c
+@modules/json-module.c
+@modules/json.sl
+@modules/onig-module.c
+@modules/onig.sl
+@modules/pcre-module.c
+@modules/pcre.sl
+@modules/png-module.c
+@modules/png.sl
+@modules/rand-module.c
+@modules/rand.sl
+@modules/select-module.c
+@modules/select.sl
+@modules/slsmg-module.c
+@modules/slsmg.sl
+@modules/stats.sl
+@modules/stats-module.c
+@modules/stats-module.h
+@modules/stats-module.inc
+@modules/stats_kendall.c
+@modules/statslib/kuiper.sl
+@modules/statslib/ad_test.sl
+@modules/statslib/ks_test.sl
+@modules/sysconf-module.c
+@modules/sysconf.sl
+@modules/termios-module.c
+@modules/termios.sl
+@modules/template.c
+@modules/varray-module.c
+@modules/varray.sl
+@modules/newt-module.c
+@modules/socket-module.c
+@modules/socket.sl
+@modules/iconv-module.c
+@modules/iconv.sl
+@modules/zlib-module.c
+@modules/zlib.sl
+
+@modules/test/runtests.sh 0755
+@modules/test/test.sl
+@modules/test/test_base64.sl
+@modules/test/test_chksum.sl
+@modules/test/test_csv.sl
+@modules/test/test_fcntl.sl
+@modules/test/test_fork.sl
+@modules/test/test_hist.sl
+@modules/test/test_iconv.sl
+@modules/test/test_json.sl
+@modules/test/test_onig.sl
+@modules/test/test_pcre.sl
+@modules/test/test_png.sl
+@modules/test/test_rand.sl
+@modules/test/test_select.sl
+@modules/test/test_slsmg.sl
+@modules/test/test_socket.sl
+@modules/test/test_stats.sl
+@modules/test/test_sysconf.sl
+@modules/test/test_sysconf.sl
+@modules/test/test_termios.sl
+@modules/test/test_varray.sl
+@modules/test/test_zlib.sl
+
+@modules/tm/Makefile
+@modules/tm/base64funs.tm
+@modules/tm/chksumfuns.tm
+@modules/tm/csvfuns.tm
+@modules/tm/forkfuns.tm
+@modules/tm/histfuns.tm
+@modules/tm/jsonfuns.tm
+@modules/tm/modfuns.tm
+@modules/tm/onigfuns.tm
+@modules/tm/pcrefuns.tm
+@modules/tm/pngfuns.tm
+@modules/tm/randfuns.tm
+@modules/tm/slsmg.tm
+@modules/tm/sockfuns.tm
+@modules/tm/statsfuns.tm
+
+@modules/help/base64funs.hlp
+@modules/help/chksumfuns.hlp
+@modules/help/csvfuns.hlp
+@modules/help/forkfuns.hlp
+@modules/help/histfuns.hlp
+@modules/help/jsonfuns.hlp
+@modules/help/onigfuns.hlp
+@modules/help/pcrefuns.hlp
+@modules/help/pngfuns.hlp
+@modules/help/randfuns.hlp
+@modules/help/slsmg.hlp
+@modules/help/sockfuns.hlp
+@modules/help/statsfuns.hlp
+
+@modules/examples/newt_ex.sl
+@modules/examples/slsmg_ex.sl
+@modules/examples/grep 0755
+@modules/examples/varray_ex.sl
+@modules/examples/echosrv.sl
+@modules/examples/oniggrep
+@modules/examples/echoclnt.sl
+
+@modules/cmaps/mkcmap.sl
+@modules/cmaps/cool.map
+@modules/cmaps/globe.map
+@modules/cmaps/jet.map
+@modules/cmaps/rainbow.map
+@modules/cmaps/seis.map
+@modules/cmaps/copper.map
+@modules/cmaps/gray.map
+@modules/cmaps/no_green.map
+@modules/cmaps/red2green.map
+@modules/cmaps/split.map
+@modules/cmaps/drywet.map
+@modules/cmaps/haxby.map
+@modules/cmaps/ocean.map
+@modules/cmaps/relief.map
+@modules/cmaps/topo.map
+@modules/cmaps/gebco.map
+@modules/cmaps/hot.map
+@modules/cmaps/polar.map
+@modules/cmaps/sealand.map
+@modules/cmaps/wysiwyg.map
+@modules/cmaps/ds9b.map
+@modules/cmaps/ds9sls.map
+@modules/cmaps/coolwarm.map
+@modules/cmaps/cubicl.map
+@modules/cmaps/cubicyf.map
+@modules/cmaps/edge.map
+#
+
+@slang.lis
+@slsh/INSTALL
+@slsh/Makefile.g32
+@slsh/mkfiles/makefile.all
+@slsh/mkfiles/README
+@slsh/mkfiles/slsh.rc
+*slsh/mkfiles/sldoc.ico
+*slsh/mkfiles/slsh.ico
+@slsh/Makefile.in
+@slsh/README
+
+@slsh/etc/slsh.rc
+
+@slsh/lib/arrayfuns.sl
+@slsh/lib/structfuns.sl
+@slsh/lib/autoload.sl
+@slsh/lib/require.sl
+@slsh/lib/glob.sl
+@slsh/lib/fswalk.sl
+@slsh/lib/stkcheck.sl
+@slsh/lib/slshrl.sl
+@slsh/lib/sldb.sl
+@slsh/lib/sldbcore.sl
+@slsh/lib/sldbsock.sl
+@slsh/lib/profile.sl
+@slsh/lib/print.sl
+@slsh/lib/slshhelp.sl
+@slsh/lib/cmdopt.sl
+@slsh/lib/readascii.sl
+@slsh/lib/process.sl
+@slsh/lib/setfuns.sl
+@slsh/lib/listfuns.sl
+#
+@slsh/lib/rline/editfuns.sl
+@slsh/lib/rline/emacskeys.sl
+@slsh/lib/rline/history.sl
+@slsh/lib/rline/vikeys.sl
+@slsh/lib/rline/complete.sl
+@slsh/lib/rline/slrline.rc
+@slsh/lib/rline/editor.sl
+@slsh/lib/rline/histsrch.sl
+
+@slsh/lib/help/arrayfuns.hlp
+@slsh/lib/help/glob.hlp
+@slsh/lib/help/fswalk.hlp
+@slsh/lib/help/require.hlp
+@slsh/lib/help/structfuns.hlp
+@slsh/lib/help/cmdopt.hlp
+@slsh/lib/help/readascii.hlp
+@slsh/lib/help/profile.hlp
+@slsh/lib/help/print.hlp
+@slsh/lib/help/process.hlp
+@slsh/lib/help/setfuns.hlp
+@slsh/lib/help/listfuns.hlp
+
+@slsh/lib/tm/Makefile
+@slsh/lib/tm/arrayfuns.tm
+@slsh/lib/tm/glob.tm
+@slsh/lib/tm/fswalk.tm
+@slsh/lib/tm/require.tm
+@slsh/lib/tm/structfuns.tm
+@slsh/lib/tm/cmdopt.tm
+@slsh/lib/tm/readascii.tm
+@slsh/lib/tm/profile.tm
+@slsh/lib/tm/print.tm
+@slsh/lib/tm/process.tm
+@slsh/lib/tm/setfuns.tm
+@slsh/lib/tm/listfuns.tm
+
+@slsh/lib/test/runtests.sh 0755
+@slsh/lib/test/common.sl
+@slsh/lib/test/test_cmdopt.sl
+@slsh/lib/test/test_structfuns.sl
+@slsh/lib/test/test_readascii.sl
+@slsh/lib/test/test_print.sl
+@slsh/lib/test/test_process.sl
+@slsh/lib/test/test_setfuns.sl
+@slsh/lib/test/test_listfuns.sl
+
+@slsh/doc/tm/slsh.tm
+@slsh/doc/tm/Makefile
+@slsh/doc/tm/slshfun.tm
+@slsh/doc/tm/local.tm
+@slsh/doc/man/slsh.1
+@slsh/doc/html/slshfun.html
+@slsh/doc/html/slshfun-1.html
+@slsh/doc/html/slshfun-2.html
+@slsh/doc/html/slshfun-3.html
+@slsh/doc/html/slshfun-4.html
+@slsh/doc/html/slshfun-5.html
+@slsh/doc/html/slshfun-6.html
+@slsh/doc/html/slshfun-7.html
+@slsh/doc/html/slshfun-8.html
+@slsh/doc/html/slshfun-9.html
+@slsh/doc/html/slshfun-10.html
+@slsh/doc/html/slshfun-11.html
+@slsh/doc/html/slshfun-12.html
+@slsh/doc/html/slshfun-13.html
+@slsh/scripts/badlinks 0755
+@slsh/scripts/htmlstrip 0755
+@slsh/scripts/ls 0755
+@slsh/scripts/lsrpm 0755
+@slsh/scripts/mv 0755
+@slsh/scripts/purge 0755
+@slsh/scripts/jpegsize 0755
+@slsh/scripts/svnsh 0755
+@slsh/scripts/sldb 0755
+@slsh/scripts/slprof 0755
+@slsh/scripts/slstkchk 0755
+@slsh/slsh.c
+@slsh/slsh.h
+@slsh/readline.c
+@src/DESCRIP.MMS
+@src/Makefile.in
+@src/VMSMAKE.COM
+@src/_slang.h
+@src/_slint.h
+@src/calc.c
+@src/calc.sl
+@src/config.hin
+@src/curses/Makefile
+@src/curses/README
+@src/curses/battle.c
+@src/curses/blue.c
+@src/curses/bs.c
+@src/curses/firework.c
+@src/curses/gdc.c
+@src/curses/hanoi.c
+@src/curses/knight.c
+@src/curses/rain.c
+@src/curses/tclock.c
+@src/curses/view.c
+@src/curses/worm.c
+@src/jdmacros.h
+@src/keywhash.c
+@src/mkfiles/README
+@src/mkfiles/makefile.all
+@src/mkfiles/mkmake.c
+*src/mkfiles/mkmake.exe
+*src/mkfiles/mkmake16.exe
+@src/mkfiles/mk_mkmake.bat
+@src/modules.unx
+@src/pcconf.c
+@src/sl-feat.h
+@src/slang.c
+@src/slang.h
+@src/slarith.c
+@src/slarith.inc
+@src/slarith2.inc
+@src/slarray.c
+@src/slagetput.inc
+@src/slarrfun.c
+@src/slarrfun.inc
+@src/slarrmis.c
+@src/slassoc.c
+@src/slboseos.c
+@src/slbstr.c
+@src/slclass.c
+@src/slcmd.c
+@src/slcmplex.c
+@src/slcombin.h
+@src/slcommon.c
+@src/slcompat.c
+@src/slconfig.h
+@src/slcurses.c
+@src/slcurses.h
+@src/sldisply.c
+@src/sldostty.c
+@src/slerr.c
+@src/slerrno.c
+@src/slexcept.c
+@src/slfile.c
+@src/slfpu.c
+@src/slgetkey.c
+@src/slimport.c
+@src/slinclud.h
+@src/slintall.c
+@src/slischar.c
+@src/slischar.h
+@src/slistruc.c
+@src/slkeymap.c
+@src/slkeypad.c
+@src/sllimits.h
+@src/sllist.c
+@src/sllower.c
+@src/sllower.h
+@src/slmalloc.c
+@src/slmath.c
+@src/slmemchr.c
+@src/slmemcmp.c
+@src/slmemcpy.c
+@src/slmemset.c
+@src/slmisc.c
+@src/slnspace.c
+@src/slos2tty.c
+@src/slospath.c
+@src/slpack.c
+@src/slparse.c
+@src/slpath.c
+@src/slposdir.c
+@src/slposio.c
+@src/slprepr.c
+@src/slproc.c
+@src/slregexp.c
+@src/slrline.c
+@src/slscanf.c
+@src/slscroll.c
+@src/slsearch.c
+@src/slsignal.c
+@src/slsig.c
+@src/slsmg.c
+@src/slstd.c
+@src/slstdio.c
+@src/slstring.c
+@src/slstrops.c
+@src/slstruct.c
+@src/sltermin.c
+@src/sltime.c
+@src/sltoken.c
+@src/sltypes.c
+@src/slupper.c
+@src/slupper.h
+@src/slutf8.c
+@src/slutty.c
+@src/slvideo.c
+@src/slvmstty.c
+@src/slw32tty.c
+@src/slwclut.c
+@src/slwcwidth.c
+@src/slwcwidth.h
+@src/slxstrng.c
+
+@src/test/runtests.sh 0755
+@src/test/w32test.bat
+@src/test/Makefile
+@src/test/README
+@src/test/sltest.c
+@src/test/assoc.c
+@src/test/list.c
+@src/test/anytype.sl
+@src/test/arith.sl
+@src/test/argv.sl
+@src/test/array.sl
+@src/test/arrmult.sl
+@src/test/assoc.sl
+@src/test/autoload.sl
+@src/test/break.sl
+@src/test/bstring.sl
+@src/test/bugs.sl
+@src/test/compare.sl
+@src/test/deref.sl
+@src/test/debug.sl
+@src/test/dollar.sl
+@src/test/docfun.sl
+@src/test/eqs.sl
+@src/test/except.sl
+@src/test/ifeval.sl
+@src/test/inc.sl
+@src/test/leak.sl
+@src/test/list.sl
+@src/test/longline.inc
+@src/test/loops.sl
+@src/test/math.sl
+@src/test/method.sl
+@src/test/misc.sl
+@src/test/multline.sl
+@src/test/naninf.sl
+@src/test/ns1.inc
+@src/test/ns2.inc
+@src/test/nspace.sl
+@src/test/nspace2.sl
+@src/test/ospath.sl
+@src/test/overflow.sl
+@src/test/pack.sl
+@src/test/path.sl
+@src/test/posdir.sl
+@src/test/posixio.sl
+@src/test/proc.sl
+@src/test/prep.sl
+@src/test/qualif.sl
+@src/test/regexp.sl
+@src/test/req.sl
+@src/test/reqfoo.sl
+@src/test/selfload.sl
+@src/test/scircuit.sl
+@src/test/signal.sl
+@src/test/sort.sl
+@src/test/sscanf.sl
+@src/test/stack.sl
+@src/test/stdio.sl
+@src/test/strops.sl
+@src/test/struct.sl
+@src/test/syntax.sl
+@src/test/template.sl
+@src/test/time.sl
+@src/test/utf8.sl
+@src/test/longlong.sl
+
+@src/untic.c
+@src/slang.ver
+@src/terminfo/aix4.inc
+@src/terminfo/Makefile
+@src/terminfo/README
+@src/terminfo/default.inc
+@src/terminfo/osf1r5.inc
+@src/terminfo/uwin.inc
+@src/terminfo/hpux11.inc
+@src/terminfo/parsecaps.sl
+@src/util/Makefile
+@src/util/bcdump.c
+@src/util/chkproto.c
+@src/util/keywords.lis
+@src/util/perfhash.c
+@src/util/mkslarith2.sl 0755
+@utf8/test_isxxx.c
+@utf8/Makefile
+@utf8/testfiles/UTF-8-demo.txt
+@utf8/testfiles/UTF-8-test.txt
+@utf8/tools/EastAsianWidth.txt
+@utf8/tools/UnicodeData.txt
+@utf8/tools/Makefile
+*utf8/tools/mktables 0755

_service:tar_scm:slang-2.3.2.tar.bz2/slsh Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/INSTALL Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/Makefile.g32 Added

@@ -0,0 +1,38 @@
+# This is a makefile for mingw32.  See mkfiles/README for other compilers.
+#
+CC		= gcc
+CFLAGS		= -W -Wall -O2
+COPY		= cp
+SLCONFIG_H	= ../src/slconfig.h
+#---------------------------------------------------------------------------
+# Installation location of the slang library
+#---------------------------------------------------------------------------
+SLANG_INC	= -I../src
+SLANG_LIB	= -L../src/gw32objs -lslang
+#----------------------------------------------------------------------------
+# Installation location of lib/slsh.rc and lib/*.sl
+#----------------------------------------------------------------------------
+COPY = cp
+MKDIR = mkdir
+SLSH_CONF_DIR	= C:/slsh
+SLSH_LIB_DIR	= C:/slsh
+#----------------------------------------------------------------------------
+# End of user configuration
+#----------------------------------------------------------------------------
+LIBS = $(RPATH) $(SLANG_LIB) $(DL_LIB) -lm
+#DEFS = -DSLSH_CONF_DIR='"$(SLSH_CONF_DIR)"' -DSLSH_PATH='"$(SLSH_LIB_DIR)"'
+
+all: slsh.exe
+slsh.exe: slsh.o readline.o
+	$(CC) slsh.o readline.o -o slsh.exe $(LIBS)
+slsh.o: slsh.c slsh.h config.h
+	$(CC) -c $(CFLAGS) $(SLANG_INC) $(DEFS) slsh.c
+readline.o: readline.c slsh.h config.h
+	$(CC) -c $(CFLAGS) $(SLANG_INC) $(DEFS) readline.c
+config.h: ../src/config.h
+	$(COPY) $(SLCONFIG_H) config.h
+install: slsh
+	-$(MKDIR) $(SLSH_CONF_DIR)
+	-$(MKDIR) $(SLSH_LIB_DIR)
+	$(COPY) lib/*.sl $(SLSH_LIB_DIR)
+	$(COPY) lib/slsh.rc $(SLSH_CONF_DIR)

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/Makefile.in Added

@@ -0,0 +1,202 @@
+#-*-sh-*-
+CC		= @CC@
+CFLAGS		= @CFLAGS@ @SLANG_DLL_CFLAGS@
+LDFLAGS		= @LDFLAGS@
+DLINK_FLAGS	= @DYNAMIC_LINK_FLAGS@
+CONFIG_DIR	= @CONFIG_DIR@
+OBJDIR		= $(ARCH)objs
+SOBJDIR		= static_objs
+SRCDIR		= $(CONFIG_DIR)/slsh
+#---------------------------------------------------------------------------
+# Installation location of the slang library
+#---------------------------------------------------------------------------
+prefix 		= @prefix@
+exec_prefix 	= @exec_prefix@
+datarootdir	= @datarootdir@
+INST_LIB_DIR	= @libdir@
+SLANG_INST_INC	= -I@includedir@
+SLANG_INST_LIB	= -L$(INST_LIB_DIR)
+#---------------------------------------------------------------------------
+SLANG_SRCINC	= -I@SRCDIR@
+SLANG_ELFLIB	= -L@ELFDIR@#  for dynamically linked
+SLANG_OBJLIB	= -L@OBJDIR@#  for statically linked
+#---------------------------------------------------------------------------
+DYNAMIC_LIBS	= @TERMCAP@ @DYNAMIC_LINK_LIB@ @LIBS@ @M_LIB@
+STATIC_LIBS	= @TERMCAP@ @LIBS@ @M_LIB@
+RPATH		= @RPATH@
+#----------------------------------------------------------------------------
+INSTALL		= @INSTALL@
+INSTALL_DATA	= @INSTALL_DATA@
+MKINSDIR	= $(CONFIG_DIR)/autoconf/mkinsdir.sh
+#----------------------------------------------------------------------------
+# Where system-wide slsh.rc, scripts, and library files reside
+#----------------------------------------------------------------------------
+SLSH_CONF_DIR	= @sysconfdir@
+SLSH_LIB_DIR	= $(datarootdir)/slsh
+SLSH_HELP_DIR	= $(SLSH_LIB_DIR)/help
+SLSH_DOC_DIR	= $(datarootdir)/doc/slsh
+SLSH_LOCALLIB_DIR = $(SLSH_LIB_DIR)/local-packages
+SLSH_SCRIPT_DIR	= $(SLSH_LIB_DIR)/scripts
+SCRIPTS		= jpegsize lsrpm sldb svnsh slprof slstkchk
+#---------------------------------------------------------------------------
+# Hard-coded paths may be configured during run-time via the SLSH_CONF_DIR
+# and SLSH_PATH env variables.  The names of those variables may be
+# changed here.  The SLSH_LIB_DIR variable has been deprecated.
+#
+SLSH_CONF_DIR_ENV = "SLSH_CONF_DIR"
+SLSH_PATH_ENV	  = "SLSH_PATH"
+SLSH_LIB_DIR_ENV  = "SLSH_LIB_DIR"
+#---------------------------------------------------------------------------
+# If you want GNU readline instead of slang's readline, then enable it here
+#---------------------------------------------------------------------------
+GNU_READLINE	= @GNU_READLINE@
+READLINE_LIB	= @LIB_READLINE@
+#---------------------------------------------------------------------------
+# DESTDIR is designed to facilitate making packages.  Normally it is empty
+#---------------------------------------------------------------------------
+#DESTDIR		=
+BIN_DIR		= @bindir@
+MAN_DIR		= @mandir@/man1
+DEST_LIB_DIR	= -L$(DESTDIR)@libdir@
+DEST_BIN_DIR	= $(DESTDIR)$(BIN_DIR)
+DEST_MAN_DIR	= $(DESTDIR)$(MAN_DIR)
+DEST_SLSH_CONF_DIR = $(DESTDIR)$(SLSH_CONF_DIR)
+DEST_SLSH_LIB_DIR  = $(DESTDIR)$(SLSH_LIB_DIR)
+DEST_SLSH_HELP_DIR = $(DESTDIR)$(SLSH_HELP_DIR)
+DEST_SLSH_LOCALLIB_DIR = $(DESTDIR)$(SLSH_LOCALLIB_DIR)
+DEST_SLSH_SCRIPT_DIR = $(DESTDIR)$(SLSH_SCRIPT_DIR)
+DEST_SLSH_DOC_DIR= $(DESTDIR)$(SLSH_DOC_DIR)
+
+#----------------------------------------------------------------------------
+# These should be empty for production code
+#----------------------------------------------------------------------------
+SLSYSWRAP_DEF = @DSLSYSWRAP@
+SLSYSWRAP_LIB = @LIB_SLSYSWRAP@
+#----------------------------------------------------------------------------
+# End of user configuration
+#----------------------------------------------------------------------------
+@SET_MAKE@
+SHELL = /bin/sh
+INST_LIBS = $(DEST_LIB_DIR) $(RPATH) $(SLANG_INST_LIB) -lslang $(READLINE_LIB) $(DYNAMIC_LIBS)
+DEFS = -DSLSH_CONF_DIR='"$(SLSH_CONF_DIR)"' -DSLSH_PATH='"$(SLSH_LIB_DIR)"' \
+ -DSLSH_CONF_DIR_ENV='$(SLSH_CONF_DIR_ENV)' -DSLSH_LIB_DIR_ENV='$(SLSH_LIB_DIR_ENV)' \
+ -DSLSH_PATH_ENV='$(SLSH_PATH_ENV)' $(SLSYSWRAP_DEF)
+SDEFS = $(DEFS) -DSLSH_STATIC
+SRC_LIBS = $(SLANG_ELFLIB) -lslang $(SLSYSWRAP_LIB) $(READLINE_LIB) $(DYNAMIC_LIBS)
+STATIC_SRC_LIBS = $(SLANG_OBJLIB) -lslang $(SLSYSWRAP_LIB) $(READLINE_LIB) $(STATIC_LIBS)
+OBJDIR_TSTAMP = $(OBJDIR)/tstamp
+SOBJDIR_TSTAMP = $(SOBJDIR)/tstamp
+#
+all: $(OBJDIR)/slsh_exe
+slsh: $(OBJDIR)/slsh
+$(OBJDIR)/slsh_exe: $(OBJDIR)/slsh.o $(OBJDIR)/readline.o
+	$(CC) $(CFLAGS) $(OBJDIR)/slsh.o $(OBJDIR)/readline.o -o $(OBJDIR)/slsh_exe $(LDFLAGS) $(DLINK_FLAGS) $(SRC_LIBS)
+$(OBJDIR)/slsh: $(OBJDIR)/slsh.o $(OBJDIR)/readline.o
+	$(CC) $(CFLAGS) $(OBJDIR)/slsh.o $(OBJDIR)/readline.o -o $(OBJDIR)/slsh $(LDFLAGS) $(DLINK_FLAGS) $(INST_LIBS)
+$(OBJDIR)/slsh.o: $(OBJDIR_TSTAMP) slsh.c slsh.h config.h Makefile
+	cd $(OBJDIR) && $(CC) $(SLANG_SRCINC) $(CFLAGS) -c $(DEFS) $(SRCDIR)/slsh.c
+$(OBJDIR)/readline.o: $(OBJDIR_TSTAMP) readline.c slsh.h config.h Makefile
+	cd $(OBJDIR) && $(CC) $(SLANG_SRCINC) $(CFLAGS) -c $(DEFS) -DUSE_GNU_READLINE=$(GNU_READLINE) $(SRCDIR)/readline.c
+$(OBJDIR_TSTAMP):
+	-$(MKINSDIR) $(OBJDIR)
+	touch $(OBJDIR_TSTAMP)
+#
+static: $(SOBJDIR)/slsh
+$(SOBJDIR)/slsh: $(SOBJDIR)/slsh.o $(SOBJDIR)/readline.o
+	$(CC) $(CFLAGS) $(SOBJDIR)/slsh.o $(SOBJDIR)/readline.o -o $(SOBJDIR)/slsh $(LDFLAGS) $(STATIC_SRC_LIBS)
+$(SOBJDIR)/slsh.o: $(SOBJDIR_TSTAMP) slsh.c slsh.h config.h Makefile
+	cd $(SOBJDIR) && $(CC) $(SLANG_SRCINC) $(CFLAGS) -c $(SDEFS) $(SRCDIR)/slsh.c
+$(SOBJDIR)/readline.o: $(SOBJDIR_TSTAMP) readline.c slsh.h config.h Makefile
+	cd $(SOBJDIR) && $(CC) $(SLANG_SRCINC) $(CFLAGS) -c $(SDEFS) -DUSE_GNU_READLINE=$(GNU_READLINE) $(SRCDIR)/readline.c
+$(SOBJDIR_TSTAMP):
+	-$(MKINSDIR) $(SOBJDIR)
+	touch $(SOBJDIR_TSTAMP)
+#
+config.h: ../src/config.h
+	cp ../src/config.h .
+install_directories:
+	$(MKINSDIR) $(DEST_BIN_DIR)
+	$(MKINSDIR) $(DEST_MAN_DIR)
+	$(MKINSDIR) $(DEST_SLSH_CONF_DIR)
+	$(MKINSDIR) $(DEST_SLSH_LIB_DIR)
+	$(MKINSDIR) $(DEST_SLSH_LIB_DIR)/rline
+	$(MKINSDIR) $(DEST_SLSH_HELP_DIR)
+	$(MKINSDIR) $(DEST_SLSH_LOCALLIB_DIR)
+	$(MKINSDIR) $(DEST_SLSH_SCRIPT_DIR)
+	$(MKINSDIR) $(DEST_SLSH_DOC_DIR)/html
+install_lib_files:
+	@for X in lib/*.sl; \
+	do \
+		echo $(INSTALL_DATA) $$X $(DEST_SLSH_LIB_DIR); \
+		$(INSTALL_DATA) $$X $(DEST_SLSH_LIB_DIR); \
+		if  "$$?" != "0" ; then \
+		  exit 1; \
+		fi; \
+	done
+install_rline_files:
+	@for X in lib/rline/*.sl lib/rline/slrline.rc; \
+	do \
+		echo $(INSTALL_DATA) $$X $(DEST_SLSH_LIB_DIR)/rline/; \
+		$(INSTALL_DATA) $$X $(DEST_SLSH_LIB_DIR)/rline/; \
+		if  "$$?" != "0" ; then \
+		  exit 1; \
+		fi; \
+	done
+install_scripts:
+	@for X in $(SCRIPTS); \
+	do \
+		echo $(INSTALL) scripts/$$X $(DEST_SLSH_SCRIPT_DIR); \
+		$(INSTALL) scripts/$$X $(DEST_SLSH_SCRIPT_DIR); \
+		if  "$$?" != "0" ; then \
+		  exit 1; \
+		fi; \
+	done
+install_help:
+	@for X in lib/help/*.hlp; \
+	do \
+		echo $(INSTALL_DATA) $$X $(DEST_SLSH_HELP_DIR); \
+		$(INSTALL_DATA) $$X $(DEST_SLSH_HELP_DIR); \
+		if  "$$?" != "0" ; then \
+		  exit 1; \
+		fi; \
+	done
+install_docs:
+	@for X in doc/html/*.html; \
+	do \
+		echo $(INSTALL_DATA) $$X $(DEST_SLSH_DOC_DIR)/html/; \
+		$(INSTALL_DATA) $$X $(DEST_SLSH_DOC_DIR)/html/; \
+		if  "$$?" != "0" ; then \
+		  exit 1; \
+		fi; \
+	done
+	$(INSTALL_DATA) doc/man/slsh.1 $(DEST_MAN_DIR)/
+#
+install_slsh:
+	$(INSTALL) $(OBJDIR)/slsh $(DEST_BIN_DIR)/
+install_static_slsh:
+	$(INSTALL) $(SOBJDIR)/slsh $(DEST_BIN_DIR)/
+install_slshrc:
+	$(INSTALL_DATA) etc/slsh.rc $(DEST_SLSH_CONF_DIR)/
+	echo 'prepend_to_slang_load_path("$(SLSH_LOCALLIB_DIR)");' >> $(DEST_SLSH_CONF_DIR)/slsh.rc
+install_common: install_directories install_lib_files install_rline_files install_scripts install_help install_docs
+#
+install: slsh install_common install_slsh install_slshrc
+install-static: static install_common install_static_slsh install_slshrc
+#---------------------------------------------------------------------------
+runtests:
+	cd lib/test && ./runtests.sh test_*.sl
+#---------------------------------------------------------------------------
+# Housekeeping
+#---------------------------------------------------------------------------
+clean:
+	-/bin/rm -f $(OBJDIR_TSTAMP) $(SOBJDIR_TSTAMP)
+	-/bin/rm -f *~ $(OBJDIR)/slsh.o $(OBJDIR)/readline.o $(OBJDIR)/slsh $(OBJDIR)/slsh_exe scripts/*~ lib/*~
+	-/bin/rm -f $(SOBJDIR)/slsh.o $(SOBJDIR)/readline.o $(SOBJDIR)/slsh $(SOBJDIR)/slsh_exe
+distclean: clean
+	-/bin/rm -f Makefile config.h
+#
+.PHONY: all clean distclean symlinks slsh install install_directories \
+  install_lib_files install_rline_files install_scripts install_help \
+  install_docs install-static static install_common \
+  install_slsh install_static_slsh install_slshrc
+

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/README Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/html Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/html/slshfun-1.html Added

@@ -0,0 +1,47 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+<HTML>
+<HEAD>
+ <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.69">
+ <TITLE> SLSH Library Reference (version 2.3.0): Introduction</TITLE>
+ <LINK HREF="slshfun-2.html" REL=next>
+
+ <LINK HREF="slshfun.html#toc1" REL=contents>
+</HEAD>
+<BODY>
+<A HREF="slshfun-2.html">Next</A>
+Previous
+<A HREF="slshfun.html#toc1">Contents</A>
+<HR>
+<H2><A NAME="s1">1.</A> <A HREF="slshfun.html#toc1">Introduction</A></H2>
+
+
+
+This document describes both the slsh intrinsic functions and the
+slsh library functions. The latter functions are written in S-Lang
+and make use of lower-level intrinsic functions that are described in
+the 
+<A HREF="http://www.jedsoft.org/slang/doc/html/slangfun.html">Intrinsic Function Reference Manual</A>.
+As the slsh library functions make no use of slsh intrinsics, they
+may be used by any conforming S-Lang application. The slsh intrinsic
+functions are specific to slsh.
+Before a particular slsh library function may be used, the file that
+defines the function must first be loaded. The recommended mechanism
+for loading a file is through the use of the
+<CODE>require</CODE> function, e.g.,
+<BLOCKQUOTE><CODE>
+<PRE>
+ require ("structfuns");
+</PRE>
+</CODE></BLOCKQUOTE>
+
+will make the functions defined in the file <CODE>structfuns.sl</CODE>
+available to the interpreter. The <CODE>require</CODE> function itself is
+defined in the file <CODE>require.sl</CODE>, which a conforming application
+will automatically load.
+
+<HR>
+<A HREF="slshfun-2.html">Next</A>
+Previous
+<A HREF="slshfun.html#toc1">Contents</A>
+</BODY>
+</HTML>

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/html/slshfun-10.html Added

@@ -0,0 +1,152 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+<HTML>
+<HEAD>
+ <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.69">
+ <TITLE> SLSH Library Reference (version 2.3.0): Profiling Functions</TITLE>
+ <LINK HREF="slshfun-11.html" REL=next>
+ <LINK HREF="slshfun-9.html" REL=previous>
+ <LINK HREF="slshfun.html#toc10" REL=contents>
+</HEAD>
+<BODY>
+<A HREF="slshfun-11.html">Next</A>
+<A HREF="slshfun-9.html">Previous</A>
+<A HREF="slshfun.html#toc10">Contents</A>
+<HR>
+<H2><A NAME="s10">10.</A> <A HREF="slshfun.html#toc10">Profiling Functions</A></H2>
+
+These functions are used by slprof for profiling slsh
+applications.
+<H2><A NAME="profile_on"></A> <A NAME="ss10.1">10.1</A> <A HREF="slshfun.html#toc10.1">profile_on</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Enable code generation to support profiling hooks
+<DT> Usage <DD>
+<CODE>profile_on ( line_by_line )</CODE>
+<DT> Description <DD>
+This function will turn cause the interpreter to generate code to
+call hooks that are used to profile code. The <CODE>profile_on</CODE>
+function does not establish those hooks, rather it causes code to be
+generated to support such hooks.
+With no optional argument, only code to support function call hooks
+will be generated. To enable support for line-by-line profile
+hooks, a value of 1 should be passed to this function.
+<DT> See Also <DD>
+<CODE>profile_off, profile_begin, profile_end, profile_calibrate, profile_report</CODE>}
+</DL>
+
+
+
+<H2><A NAME="profile_off"></A> <A NAME="ss10.2">10.2</A> <A HREF="slshfun.html#toc10.2">profile_off</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Turn off code generation for profiling hooks
+<DT> Usage <DD>
+<CODE>profile_off ()</CODE>
+<DT> Description <DD>
+This function turns off the generation of code to support profiling
+hooks.
+<DT> See Also <DD>
+<CODE>profile_on, profile_begin, profile_end, profile_calibrate, profile_report</CODE>}
+</DL>
+
+
+
+<H2><A NAME="profile_begin"></A> <A NAME="ss10.3">10.3</A> <A HREF="slshfun.html#toc10.3">profile_begin</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Establish profiling hooks and reset the profiler
+<DT> Usage <DD>
+<CODE>profile_begin ( line_by_line )</CODE>
+<DT> Description <DD>
+This function establishes the profiling hooks and resets or
+initializes the profiler state. By default, only hooks to gather
+function call information are created. To enable the gathering of
+line-by-line information, a value of 1 should be passed to this
+function.
+<DT> See Also <DD>
+<CODE>profile_end, profile_on, profile_off, profile_calibrate, profile_report</CODE>}
+</DL>
+
+
+
+<H2><A NAME="profile_end"></A> <A NAME="ss10.4">10.4</A> <A HREF="slshfun.html#toc10.4">profile_end</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Remove profiling hooks and turn off profiler code generation
+<DT> Usage <DD>
+<CODE>profile_end ()</CODE>
+<DT> Description <DD>
+The <CODE>profile_end</CODE> function turns off the code generation to
+support profiling hooks and removes any profiling hooks that are in
+place.
+<DT> See Also <DD>
+<CODE>profile_begin, profile_on, profile_off, profile_calibrate, profile_report</CODE>
+</DL>
+
+
+
+<H2><A NAME="profile_calibrate"></A> <A NAME="ss10.5">10.5</A> <A HREF="slshfun.html#toc10.5">profile_calibrate</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Calibrate the profiler
+<DT> Usage <DD>
+<CODE>profile_calibrate ( N )</CODE>
+<DT> Description <DD>
+This function may be used to ``calibrate'' the profiler. As the
+performance of the profiler and the interpreter varies with a
+platform and load-dependent manner, this function should be called
+prior to enabling the profiler. It tries to determine the average
+amount of overhead per statement executed and function call by
+executing a series of statements and functions many times to
+determine statistically accurate values. The optional parameter
+<CODE>N</CODE> may be used to control the amount of code executed
+for the calibration process. If no value is provided, the <CODE>N</CODE>
+will default to 1000. The higher the value, the more accurate the
+calibration will be and the longer the calibration process will take.
+<DT> See Also <DD>
+<CODE>profile_begin, profile_end, profile_on, profile_off, profile_report</CODE>
+</DL>
+
+
+
+<H2><A NAME="profile_report"></A> <A NAME="ss10.6">10.6</A> <A HREF="slshfun.html#toc10.6">profile_report</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Generate the profile report
+<DT> Usage <DD>
+<CODE>profile_report (file)</CODE>
+<DT> Description <DD>
+The function may be used to format the profile report and write it
+to the specified file. If the <CODE>file</CODE> parameter represents a
+<CODE>File_Type</CODE> file descriptor, then the report will be written
+the the descriptor.
+<DT> See Also <DD>
+<CODE>profile_begin, profile_end, profile_on, profile_off, profile_calibrate</CODE>
+</DL>
+
+
+
+<HR>
+<A HREF="slshfun-11.html">Next</A>
+<A HREF="slshfun-9.html">Previous</A>
+<A HREF="slshfun.html#toc10">Contents</A>
+</BODY>
+</HTML>

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/html/slshfun-11.html Added

@@ -0,0 +1,165 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+<HTML>
+<HEAD>
+ <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.69">
+ <TITLE> SLSH Library Reference (version 2.3.0): Set Functions</TITLE>
+ <LINK HREF="slshfun-12.html" REL=next>
+ <LINK HREF="slshfun-10.html" REL=previous>
+ <LINK HREF="slshfun.html#toc11" REL=contents>
+</HEAD>
+<BODY>
+<A HREF="slshfun-12.html">Next</A>
+<A HREF="slshfun-10.html">Previous</A>
+<A HREF="slshfun.html#toc11">Contents</A>
+<HR>
+<H2><A NAME="s11">11.</A> <A HREF="slshfun.html#toc11">Set Functions</A></H2>
+
+These functions manipulate arrays and lists as sets.
+
+
+<H2><A NAME="complement"></A> <A NAME="ss11.1">11.1</A> <A HREF="slshfun.html#toc11.1">complement</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Extract the elements of a set that are not contained in other sets.
+<DT> Usage <DD>
+<CODE>indices = complement (a, b, ..., c)</CODE>
+<DT> Description <DD>
+This function computes the elements of the first argument (<CODE>a</CODE>)
+that are not contained in the sets given by the other arguments
+(<CODE>b,...,c</CODE>) and returns them in the form of indices into the
+first argument.
+<DT> Example <DD>
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ a = {"foo", PI, 7};
+ b = 1,2,3,PI;
+ indices = complement (a, b);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Upon return, <CODE>indices</CODE> will have the value <CODE>0, 2</CODE> since
+<CODE>a0</CODE> and <CODE>a2</CODE> are not contained in <CODE>b</CODE>.
+<DT> Notes <DD>
+A set may either be an Array_Type or a List_Type object.
+For a homogeneous collection of objects, it is better to
+use an Array_Type. i.e., <CODE>1,2,3</CODE> instead of <CODE>{1,2,3}</CODE>.
+<DT> See Also <DD>
+<CODE>intersection, ismember, union, unique</CODE>
+</DL>
+
+
+
+<H2><A NAME="intersection"></A> <A NAME="ss11.2">11.2</A> <A HREF="slshfun.html#toc11.2">intersection</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Extract the common elements of two or more sets
+<DT> Usage <DD>
+<CODE>indices = complement (a, b, ..., c)</CODE>
+<DT> Description <DD>
+This function computes the common elements of two or more sets and
+returns them in the form of indices into the first argument.
+<DT> Example <DD>
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ a = {"foo", 7, PI};
+ b = {PI, "bar", "foo"};
+ indices = intersection (a, b);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Upon return, <CODE>indices</CODE> will have the value <CODE>0, 2</CODE> since
+<CODE>a0</CODE> and <CODE>a2</CODE> are the common elements of the sets.
+<DT> Notes <DD>
+A set may either be an Array_Type or a List_Type object.
+For a homogeneous collection of objects, it is better to
+use an Array_Type. i.e., <CODE>1,2,3</CODE> instead of <CODE>{1,2,3}</CODE>.
+<DT> See Also <DD>
+<CODE>complement, ismember, union, unique</CODE>
+</DL>
+
+
+
+<H2><A NAME="ismember"></A> <A NAME="ss11.3">11.3</A> <A HREF="slshfun.html#toc11.3">ismember</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+test to see if the elements of one set are members of another
+<DT> Usage <DD>
+<CODE>val = ismember (a, b)</CODE>
+<DT> Description <DD>
+This function may be used to see which of the elements of the set
+<CODE>a</CODE> are members of the set <CODE>b</CODE>. It returns a boolean
+array indicating whether or not the corresponding element of
+<CODE>a</CODE> is a member of <CODE>b</CODE>.
+<DT> Notes <DD>
+A set may either be an Array_Type or a List_Type object.
+For a homogeneous collection of objects, it is better to
+use an Array_Type. i.e., <CODE>1,2,3</CODE> instead of <CODE>{1,2,3}</CODE>.
+<DT> See Also <DD>
+<CODE>complement, intersection, union, unique</CODE>
+</DL>
+
+
+
+<H2><A NAME="union"></A> <A NAME="ss11.4">11.4</A> <A HREF="slshfun.html#toc11.4">union</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Form a set of the unique elements of one ore more subsets
+<DT> Usage <DD>
+<CODE>abc = union (a, b,..., c)</CODE>
+<DT> Description <DD>
+This function interprets each of its arguments as a set, then merges
+them together and returns only the unique elements. The returned
+value may either be an <CODE>Array_Type</CODE> or a <CODE>List_Type</CODE>
+object.
+<DT> Notes <DD>
+A set may either be an Array_Type or a List_Type object.
+For a homogeneous collection of objects, it is better to
+use an Array_Type. i.e., <CODE>1,2,3</CODE> instead of <CODE>{1,2,3}</CODE>.
+<DT> See Also <DD>
+<CODE>complement, intersection, ismember, unique</CODE>
+</DL>
+
+
+
+<H2><A NAME="unique"></A> <A NAME="ss11.5">11.5</A> <A HREF="slshfun.html#toc11.5">unique</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Get the indices of the unique elements of a set
+<DT> Usage <DD>
+<CODE>indices = unique (A)</CODE>
+<DT> Description <DD>
+This function returns an array of the indices of the unique elements
+of a set.
+<DT> Notes <DD>
+A set may either be an Array_Type or a List_Type object.
+For a homogeneous collection of objects, it is better to
+use an Array_Type. i.e., <CODE>1,2,3</CODE> instead of <CODE>{1,2,3}</CODE>.
+<DT> See Also <DD>
+<CODE>complement, intersection, ismember, union</CODE>
+</DL>
+
+
+
+<HR>
+<A HREF="slshfun-12.html">Next</A>
+<A HREF="slshfun-10.html">Previous</A>
+<A HREF="slshfun.html#toc11">Contents</A>
+</BODY>
+</HTML>

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/html/slshfun-12.html Added

@@ -0,0 +1,111 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+<HTML>
+<HEAD>
+ <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.69">
+ <TITLE> SLSH Library Reference (version 2.3.0): Miscellaneous Functions</TITLE>
+ <LINK HREF="slshfun-13.html" REL=next>
+ <LINK HREF="slshfun-11.html" REL=previous>
+ <LINK HREF="slshfun.html#toc12" REL=contents>
+</HEAD>
+<BODY>
+<A HREF="slshfun-13.html">Next</A>
+<A HREF="slshfun-11.html">Previous</A>
+<A HREF="slshfun.html#toc12">Contents</A>
+<HR>
+<H2><A NAME="s12">12.</A> <A HREF="slshfun.html#toc12">Miscellaneous Functions</A></H2>
+
+
+<H2><A NAME="print"></A> <A NAME="ss12.1">12.1</A> <A HREF="slshfun.html#toc12.1">print</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Display a string representation of an object or value
+<DT> Usage <DD>
+<CODE>print (value ,&amp;var|file-pointer|filename)</CODE>
+<DT> Description <DD>
+The <CODE>print</CODE> function displays the string representation of a
+value to the display. An optional second argument may be provided to
+specify where to write the resulting string: a variable, an open file
+pointer, or to a file.
+If the string representation of the object appears to contain more
+lines than are available on the screen, then the output will be piped
+to the program given by the <CODE>PAGER</CODE> environment variable.
+Alternatively the pager program may be specified via the <CODE>pager</CODE>
+qualifier.
+<DT> Qualifiers <DD>
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ pager=string Force the use of the pager. If a value is
+ specified, then use it for the pager command.
+ nopager Do not use a pager.
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> Example <DD>
+Print the string representation of an array to a file called
+<CODE>array.dat</CODE>:
+<BLOCKQUOTE><CODE>
+<PRE>
+ print (1:20:0.1, "array.dat");
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Print the string represent of an array to a string <CODE>str</CODE>:
+<BLOCKQUOTE><CODE>
+<PRE>
+ print (1:20:0.1, &amp;str);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> See Also <DD>
+<CODE>print_set_pager, print_set_pager_lines</CODE>
+</DL>
+
+
+
+<H2><A NAME="print_set_pager"></A> <A NAME="ss12.2">12.2</A> <A HREF="slshfun.html#toc12.2">print_set_pager</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Set the name of the pager program used by the print program
+<DT> Usage <DD>
+<CODE>print_set_pager (String_Type cmd)</CODE>
+<DT> Description <DD>
+This function may be used to specify the name of the default pager to be
+used by the <CODE>print</CODE> function.
+<DT> See Also <DD>
+<CODE>print, print_set_pager_lines</CODE>
+</DL>
+
+
+
+<H2><A NAME="print_set_pager_lines"></A> <A NAME="ss12.3">12.3</A> <A HREF="slshfun.html#toc12.3">print_set_pager_lines</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Set the maximum number of lines to print before using a pager
+<DT> Usage <DD>
+<CODE>print_set_pager_lines (Int_Type num)</CODE>
+<DT> Description <DD>
+The <CODE>print_set_pager_lines</CODE> function sets the maximum number of
+lines that the string representation of an object can be before the
+<CODE>print</CODE> function will use a pager.
+<DT> See Also <DD>
+<CODE>print, print_set_pager</CODE>
+</DL>
+
+
+
+<HR>
+<A HREF="slshfun-13.html">Next</A>
+<A HREF="slshfun-11.html">Previous</A>
+<A HREF="slshfun.html#toc12">Contents</A>
+</BODY>
+</HTML>

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/html/slshfun-13.html Added

@@ -0,0 +1,231 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+<HTML>
+<HEAD>
+ <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.69">
+ <TITLE> SLSH Library Reference (version 2.3.0): SLSH intrinsic functions</TITLE>
+ <LINK HREF="slshfun-12.html" REL=previous>
+ <LINK HREF="slshfun.html#toc13" REL=contents>
+</HEAD>
+<BODY>
+Next
+<A HREF="slshfun-12.html">Previous</A>
+<A HREF="slshfun.html#toc13">Contents</A>
+<HR>
+<H2><A NAME="s13">13.</A> <A HREF="slshfun.html#toc13">SLSH intrinsic functions</A></H2>
+
+
+<H2><A NAME="slsh_readline_init"></A> <A NAME="ss13.1">13.1</A> <A HREF="slshfun.html#toc13.1">slsh_readline_init</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Initialize the S-Lang readline routines
+<DT> Usage <DD>
+<CODE>slsh_readline_init (String_Type appname)</CODE>
+<DT> Description <DD>
+The <CODE>slsh_readline_init</CODE> function is used to initialize the
+S-Lang readline interface for use by an slsh-based application with
+name <CODE>appname</CODE>. If defines an intrinsic variable called
+<CODE>__RL_APP__</CODE> whose value is given by <CODE>appname</CODE>. If the
+file <CODE>$HOME/.slrlinerc</CODE> file exists, it will be loaded into the
+interpreter. This file together with the <CODE>__RL_APP__</CODE> variable
+may be used by the user to customize the interface by, e.g., reading
+previous history files, etc.
+<DT> See Also <DD>
+<CODE>slsh_readline_new, rline_set_history</CODE>
+</DL>
+
+
+
+<H2><A NAME="slsh_readline_new"></A> <A NAME="ss13.2">13.2</A> <A HREF="slshfun.html#toc13.2">slsh_readline_new</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Instantiate a readline object
+<DT> Usage <DD>
+<CODE>RLine_Type slsh_readline_new (String_Type name)</CODE>
+<DT> Description <DD>
+This function instantiates a new readline object with the specified
+name and returns it.
+If a function called <CODE>name</CODE>_rline_open_hook exists, it will be
+called with no arguments.
+<DT> See Also <DD>
+<CODE>slsh_readline_init</CODE>
+</DL>
+
+
+
+<H2><A NAME="slsh_readline"></A> <A NAME="ss13.3">13.3</A> <A HREF="slshfun.html#toc13.3">slsh_readline</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Get input from the user with command line editing
+<DT> Usage <DD>
+<CODE>String_Type slsh_readline (RLine_Type r, String_Type prompt)</CODE>
+<DT> Description <DD>
+The <CODE>slsh_readline</CODE> function utilizes the S-Lang readline
+interface to read input from the terminal using the specified prompt.
+If two parameters are given, the value of the first one must be a
+<CODE>RLine_Type</CODE> object obtained previously from the
+<CODE>slsh_readline_new</CODE> function.
+<DT> See Also <DD>
+<CODE>slsh_readline_new, slsh_readline_init</CODE>
+</DL>
+
+
+
+<H2><A NAME="slsh_readline_noecho"></A> <A NAME="ss13.4">13.4</A> <A HREF="slshfun.html#toc13.4">slsh_readline_noecho</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Get input from the user with command line editing without echo
+<DT> Usage <DD>
+<CODE>String_Type slsh_readline (RLine_Type r, String_Type prompt)</CODE>
+<DT> Description <DD>
+This function is like <CODE>slsh_readline</CODE> except that the input is
+not echoed to the display. This makes it useful for reading
+passwords, etc.
+<DT> See Also <DD>
+<CODE>slsh_readline, slsh_readline_new, slsh_readline_init</CODE>
+</DL>
+
+
+
+
+<H2><A NAME="slsh_set_readline_update_hook"></A> <A NAME="ss13.5">13.5</A> <A HREF="slshfun.html#toc13.5">slsh_set_readline_update_hook</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Specify an alternate display update function for a readline object
+<DT> Usage <DD>
+<CODE>slsh_set_readline_update_hook(RLine_Type rl ,&amp;func ,funcdata)</CODE>
+<DT> Description <DD>
+This function may be used to implement an alternative update hook
+for the specified readline object. The hook must have one of the
+following signatures, depending upon whether or not the optional
+<CODE>funcdata</CODE> was given:
+<BLOCKQUOTE><CODE>
+<PRE>
+ define func (rl, prompt, editbuf, editpoint) {...}
+ define func (rl, prompt, editbuf, editpoint, funcdata) {...}
+</PRE>
+</CODE></BLOCKQUOTE>
+
+The hook function is not expected to return anything.
+If <CODE>slsh_set_readline_update_hook</CODE> is called with a single
+argument, then any update hook associated with it will be set to the
+default value.
+<DT> See Also <DD>
+<CODE>slsh_readline_init, slsh_readline_new, slsh_readline</CODE>
+</DL>
+
+
+
+<H2><A NAME="slsh_set_update_preread_cb"></A> <A NAME="ss13.6">13.6</A> <A HREF="slshfun.html#toc13.6">slsh_set_update_preread_cb</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Specify a function to be called prior to reading via readline
+<DT> Usage <DD>
+<CODE>slsh_set_update_preread_cb (RLine_Type rl, Ref_Type func)</CODE>
+<DT> Description <DD>
+This function may be used to specify a function to be called by
+<CODE>slsh_readline</CODE> prior to the editing loop. It must have one of
+the following signatures:
+<BLOCKQUOTE><CODE>
+<PRE>
+ define func (rl) {...}
+ define func (rl, funcdata);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+The second form must be used if a <CODE>funcdata</CODE> argument was
+passed to the <CODE>slsh_set_readline_update_hook</CODE> function.
+If the <CODE>func</CODE> argument is <CODE>NULL</CODE>, then the callback function
+will be cleared.
+<DT> See Also <DD>
+<CODE>slsh_set_readline_update_hook, slsh_set_update_postread_cb</CODE>
+</DL>
+
+
+
+<H2><A NAME="slsh_set_update_postread_cb"></A> <A NAME="ss13.7">13.7</A> <A HREF="slshfun.html#toc13.7">slsh_set_update_postread_cb</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Specify a function to be called after reading via readline
+<DT> Usage <DD>
+<CODE>slsh_set_update_postread_cb (RLine_Type rl ,Ref_Type func)</CODE>
+<DT> Description <DD>
+This function may be used to specify a function to be called by
+<CODE>slsh_readline</CODE> after to the editing loop before returning to
+the caller. It must have one of
+the following signatures:
+<BLOCKQUOTE><CODE>
+<PRE>
+ define func (rl) {...}
+ define func (rl, funcdata);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+The second form must be used if a <CODE>funcdata</CODE> argument was
+passed to the <CODE>slsh_set_readline_update_hook</CODE> function.
+If the <CODE>func</CODE> argument is <CODE>NULL</CODE>, then the callback function
+will be cleared.
+<DT> See Also <DD>
+<CODE>slsh_set_readline_update_hook, slsh_set_update_postread_cb</CODE>
+</DL>
+
+
+
+<H2><A NAME="slsh_set_update_width_cb"></A> <A NAME="ss13.8">13.8</A> <A HREF="slshfun.html#toc13.8">slsh_set_update_width_cb</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Specify a callback function to be called when the display width changes
+<DT> Usage <DD>
+<CODE>slsh_set_update_width_cb (RLine_Type rl, Ref_Type func)</CODE>
+<DT> Description <DD>
+This function is used to set a callback function that will get
+called when the readline routines sense that the display width has
+changed. It must have one of the following signatures:
+<BLOCKQUOTE><CODE>
+<PRE>
+ define func (rl, width) {...}
+ define func (rl, width, funcdata);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+The second form must be used if a <CODE>funcdata</CODE> argument was
+passed to the <CODE>slsh_set_readline_update_hook</CODE> function. The
+<CODE>width</CODE> argument to the callback function in an integer that
+specifies the new width.
+If the <CODE>func</CODE> argument is <CODE>NULL</CODE>, then the callback function
+will be cleared.
+<DT> See Also <DD>
+<CODE>slsh_set_readline_update_hook, slsh_readline</CODE>
+</DL>
+
+
+
+<HR>
+Next
+<A HREF="slshfun-12.html">Previous</A>
+<A HREF="slshfun.html#toc13">Contents</A>
+</BODY>
+</HTML>

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/html/slshfun-2.html Added

@@ -0,0 +1,114 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+<HTML>
+<HEAD>
+ <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.69">
+ <TITLE> SLSH Library Reference (version 2.3.0): The require Function</TITLE>
+ <LINK HREF="slshfun-3.html" REL=next>
+ <LINK HREF="slshfun-1.html" REL=previous>
+ <LINK HREF="slshfun.html#toc2" REL=contents>
+</HEAD>
+<BODY>
+<A HREF="slshfun-3.html">Next</A>
+<A HREF="slshfun-1.html">Previous</A>
+<A HREF="slshfun.html#toc2">Contents</A>
+<HR>
+<H2><A NAME="s2">2.</A> <A HREF="slshfun.html#toc2">The <CODE>require</CODE> Function</A></H2>
+
+The functions in <CODE>require.sl</CODE> facilitate the loading of S-Lang
+code.
+<H2><A NAME="_featurep"></A> <A NAME="ss2.1">2.1</A> <A HREF="slshfun.html#toc2.1">_featurep</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Test whether or not a feature is present
+<DT> Usage <DD>
+<CODE>Int_Type _featurep (String_Type feature ,String_Type namespace)</CODE>
+<DT> Description <DD>
+The <CODE>_featurep</CODE> function returns a non-zero value if the specified
+feature is present. Otherwise, it returns 0 to indicate that the feature
+has not been loaded.
+<DT> See Also <DD>
+<CODE>require, provide</CODE>
+</DL>
+
+
+
+<H2><A NAME="provide"></A> <A NAME="ss2.2">2.2</A> <A HREF="slshfun.html#toc2.2">provide</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Declare that a specified feature is available
+<DT> Usage <DD>
+<CODE>provide (String_Type feature ,String_Type namespace)</CODE>
+<DT> Description <DD>
+The <CODE>provide</CODE> function may be used to declare that a "feature" has
+been loaded into the specified namespace. If the namespace argument is not
+present, the current namespace will be used.
+See the documentation for <CODE>require</CODE> for more information.
+<DT> See Also <DD>
+<CODE>require, _featurep</CODE>
+</DL>
+
+
+
+<H2><A NAME="require"></A> <A NAME="ss2.3">2.3</A> <A HREF="slshfun.html#toc2.3">require</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Make sure a feature is present, and load it if not
+<DT> Usage <DD>
+<CODE>require (feature ,namespace ,file)</CODE>
+<BLOCKQUOTE><CODE>
+<PRE>
+ String_Type feature, namespace, file;
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> Description <DD>
+The <CODE>require</CODE> function ensures that a specified "feature" is present.
+If the feature is not present, the <CODE>require</CODE> function will attempt to
+load the feature from a file. If the <CODE>namespace</CODE> argument is present
+and non-NULL, the specified namespace will be used. The default is to use
+the current non-anonymous namespace. If called with three arguments, the
+feature will be loaded from the file specified by the third argument
+if it does not already exist in the namespace. Otherwise, the feature
+will be loaded from a file given by the name of the feature, with
+".sl" appended.
+If after loading the file, if the feature is not present,
+a warning message will be issued.
+<DT> Example <DD>
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ require ("histogram");
+ require ("histogram", "foo");
+ require ("histogram", "foo", "/home/bob/hist.sl");
+ require ("histogram", ,"/home/bob/hist.sl");
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> Notes <DD>
+"feature" is an abstract quantity that is undefined here.
+A popular use of the <CODE>require</CODE> function is to ensure that a specified
+file has already been loaded. In this case, the feature is the
+filename itself. The advantage of using this mechanism over using
+<CODE>evalfile</CODE> is that if the file has already been loaded, <CODE>require</CODE>
+will not re-load it.
+<DT> See Also <DD>
+<CODE>provide, _featurep, evalfile</CODE>
+</DL>
+
+
+
+<HR>
+<A HREF="slshfun-3.html">Next</A>
+<A HREF="slshfun-1.html">Previous</A>
+<A HREF="slshfun.html#toc2">Contents</A>
+</BODY>
+</HTML>

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/html/slshfun-3.html Added

@@ -0,0 +1,317 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+<HTML>
+<HEAD>
+ <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.69">
+ <TITLE> SLSH Library Reference (version 2.3.0): Command Line Parsing Functions</TITLE>
+ <LINK HREF="slshfun-4.html" REL=next>
+ <LINK HREF="slshfun-2.html" REL=previous>
+ <LINK HREF="slshfun.html#toc3" REL=contents>
+</HEAD>
+<BODY>
+<A HREF="slshfun-4.html">Next</A>
+<A HREF="slshfun-2.html">Previous</A>
+<A HREF="slshfun.html#toc3">Contents</A>
+<HR>
+<H2><A NAME="s3">3.</A> <A HREF="slshfun.html#toc3">Command Line Parsing Functions</A></H2>
+
+These functions are defined in the <CODE>cmdopt.sl</CODE> file.
+<H2><A NAME="cmdopt_new"></A> <A NAME="ss3.1">3.1</A> <A HREF="slshfun.html#toc3.1">cmdopt_new</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Create a cmdopt object for parsing command-line options
+<DT> Usage <DD>
+<CODE>obj = cmdopt_new (Ref_Type error_routine)</CODE>
+<DT> Description <DD>
+This function creates an returns an object that may be used by the
+<CODE>cmdopt_process</CODE> function to parse command line arguments. The
+<CODE>cmdopt_new</CODE> function takes a reference to an error handling
+function that will get called upon error. In most cases, this
+function should print out the error message, display a usage
+message, and then call <CODE>exit</CODE>. If the error handler is <CODE>NULL</CODE>,
+or it returns instead of calling exit, then an exception will be thrown.
+The error handler must be defined to take a single string argument
+(the error message) and must return nothing.
+<DT> Example <DD>
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ require ("cmdopt");
+ private define help_callback ()
+ {
+ () = fputs ("Usage: pgm options infile\n", stderr);
+ () = fputs ("Options:\n", stderr);
+ () = fputs (" -h|--help Show this help\n", stderr);
+ () = fputs (" -v|--verbose Increase verbosity level\n", stderr);
+ () = fputs (" -o|--output Output filename stdout\n", stderr);
+ exit (1);
+ }
+ private define error_handler (text)
+ {
+ () = fprintf (stderr, "%s\n", text);
+ help_callback ();
+ }
+ define slsh_main ()
+ {
+ variable verbose = 0;
+ outfile = "-"; % stdout
+ variable c = cmdopt_new (&amp;error_handler);
+ cmdopt_add (c, "v|verbose", &amp;verbose; inc);
+ cmdopt_add (c, "h|help", &amp;help_callback);
+ cmdopt_add (c, "s:o|output", &amp;outfile; type="str");
+ variable iend = cmdopt_process (c, __argv, 1);
+
+ if (verbose) message ("some informative message");
+ variable fp = stdout;
+ if (outfile != "-") fp = fopen (outfile, "w");
+ .
+ .
+ }
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> See Also <DD>
+<CODE>cmdopt_add, cmdopt_process</CODE>
+</DL>
+
+
+
+<H2><A NAME="cmdopt_process"></A> <A NAME="ss3.2">3.2</A> <A HREF="slshfun.html#toc3.2">cmdopt_process</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Process the command-line options
+<DT> Usage <DD>
+<CODE>Int_Type cmdopt_process (optobj, argv, istart)</CODE>
+<BLOCKQUOTE><CODE>
+<PRE>
+ Struct_Type optobj;
+ Array_Type argv;
+ Int_Type istart
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> Description <DD>
+This function parses the command line arguments in the string array
+<CODE>argv</CODE> according to the rules specified by the <CODE>optobj</CODE>
+object, previously allocated by <CODE>cmdopt_new</CODE>. The array of
+strings is processed starting at the index specified by
+<CODE>istart</CODE>. The function returns the index of the array element
+where parsing stopped. Upon error, the function will call the error
+handler established by the prior call to <CODE>cmdopt_new</CODE>.
+<DT> Example <DD>
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ define slsh_main ()
+ {
+ .
+ .
+ optobj = cmdopt_new (...);
+ cmdopt_add (optobj, ...);
+ .
+ .
+ variable iend = cmdopt_process (optobj, __argv, 1);
+ .
+ .
+ }
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> Notes <DD>
+This function may also be called in an object-oriented style using the
+<CODE>process</CODE> method:
+<BLOCKQUOTE><CODE>
+<PRE>
+ optobj = cmdopt_new (...);
+ optobj.add (...)
+ iend = optobj.process (__argv, 1);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> See Also <DD>
+<CODE>cmdopt_add, cmdopt_new</CODE>
+</DL>
+
+
+
+<H2><A NAME="cmdopt_add"></A> <A NAME="ss3.3">3.3</A> <A HREF="slshfun.html#toc3.3">cmdopt_add</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Add support for a command-line option
+<DT> Usage <DD>
+<CODE>cmdopt_add (optobj, optname, addr ,... ;qualifiers)</CODE>
+<BLOCKQUOTE><CODE>
+<PRE>
+ Struct_Type optobj;
+ String_Type optname;
+ Ref_Type addr;
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> Description <DD>
+This function adds support for a command-line option to
+<CODE>optobj</CODE> and specifies how that option should be handled.
+Handling an option involves setting the value of a variable
+associated with the option, or by calling a function upon its
+behalf.
+For clarity, assume a command-line option can be specified using the
+single character <CODE>f</CODE> or by the longer name <CODE>foo</CODE>. Then the
+rules for calling <CODE>cmdopt_add</CODE> for the various flavors options
+supported by this interface and how the option may be specified on
+the command line are as follows:
+Options that set a variable <CODE>v</CODE> to a value <CODE>val</CODE>:
+<BLOCKQUOTE><CODE>
+<PRE>
+ cmdopt_add (optobj, "f|foo", &amp;v; default=val);
+ cmdline: pgm -f ...
+ cmdline: pgm --foo ...
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Options that increment an integer variable <CODE>v</CODE>:
+<BLOCKQUOTE><CODE>
+<PRE>
+ cmdopt_add (optobj, "f|foo", &amp;v; inc);
+ cmdline: pgm -f -f ... % In these examples, v
+ cmdline: pgm --foo --foo ... % gets incremented twice
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Options that bitwise-or an integer variable <CODE>v</CODE> with <CODE>FLAG</CODE>:
+<BLOCKQUOTE><CODE>
+<PRE>
+ cmdopt_add (optobj, "f|foo", &amp;v; bor=FLAG);
+ cmdline: pgm -f ... % v = v | FLAG
+ cmdline: pgm --foo ... % v = v | FLAG
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Options that bitwise-and an integer variable <CODE>v</CODE> with <CODE>MASK</CODE>:
+<BLOCKQUOTE><CODE>
+<PRE>
+ cmdopt_add (optobj, "f|foo", &amp;v; band=MASK);
+ cmdline: pgm -f ... % v = v &amp; MASK;
+ cmdline: pgm --foo ... % v = v &amp; MASK;
+</PRE>
+</CODE></BLOCKQUOTE>
+
+The above two options may be combined:
+<BLOCKQUOTE><CODE>
+<PRE>
+ cmdopt_add (optobj, "f|foo", &amp;v; bor=FLAG1, band=~FLAG2);
+ cmdline: pgm -f ... % v &amp;= ~FLAG2; v |= FLAG1;
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Options that require a value and set <CODE>v</CODE> to the value VAL.
+<BLOCKQUOTE><CODE>
+<PRE>
+ cmdopt_add (optobj, "f|foo", &amp;v; type="int");
+ cmdline: pgm -f VAL ...
+ cmdline: pgm -fVAL ...
+ cmdline: pgm --foo VAL ...
+ cmdline: pgm --foo=VAL ...
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Options whose value is optional:
+<BLOCKQUOTE><CODE>
+<PRE>
+ cmdopt_add (optobj, "f|foo", &amp;v; type="string", optional=DFLT);
+ cmdline: pgm -f ... % set v to DFLT
+ cmdline: pgm -fVAL ... % set v to VAL
+ cmdline: pgm --foo ... % set v to DFLT
+ cmdline: pgm --foo=VAL ... % set v to VAL
+</PRE>
+</CODE></BLOCKQUOTE>
+
+For the latter two cases, if the <CODE>append</CODE> qualifier is used,
+then instead of assigning the value to the specified variable, the
+value will be appended to a list assigned to the variable, e.g.,
+<BLOCKQUOTE><CODE>
+<PRE>
+ cmdopt_add (optobj, "f|foo", &amp;v; type="float", append);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Then the command line <CODE>pgm --foo=VAL1 -fVAL2 -f VAL3 ...</CODE> will
+result in the assignment to <CODE>v</CODE> or the 3 element list
+<CODE>{VAL1, VAL2, VAL3}</CODE>.
+An option can also be associated with a callback function that get
+called when the option is handled.
+Options that cause a function to be called with arguments
+<CODE>a0,...</CODE>:
+<BLOCKQUOTE><CODE>
+<PRE>
+ cmdopt_add (optobj, "f|foo", &amp;func, a0...);
+ cmdline: pgm --foo
+ cmdline: pgm -f
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Here <CODE>func</CODE> should be written with the signature:
+<BLOCKQUOTE><CODE>
+<PRE>
+ define func (a0, ...) {...}
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Options that take a value and cause a function to be called with
+additional arguments <CODE>a0,...</CODE>:
+<BLOCKQUOTE><CODE>
+<PRE>
+ cmdopt_add (optobj, "f|foo", &amp;func, a0,...; type="int");
+ cmdline: pgm --foo=VAL
+ cmdline: pgm -f VAL
+ cmdline: pgm -fVAL
+</PRE>
+</CODE></BLOCKQUOTE>
+
+In this case, <CODE>func</CODE> should be written as
+<BLOCKQUOTE><CODE>
+<PRE>
+ define func (value, a0, ...) {...}
+</PRE>
+</CODE></BLOCKQUOTE>
+
+As the above examples illustrate, the data-type of the value assigned
+to a variable must be specified using the <CODE>type</CODE> qualifier.
+Currently the <CODE>type</CODE> must be set to one of the following values:
+<BLOCKQUOTE><CODE>
+<PRE>
+ "str" (String_Type)
+ "int" (Int_Type)
+ "float" (Double_Type)
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> Notes <DD>
+This function may also be called in an object-oriented style using the
+<CODE>add</CODE> method:
+<BLOCKQUOTE><CODE>
+<PRE>
+ optobj = cmdopt_new (...);
+ optobj.add ("f|foo", &amp;func, a0,...; type="int");
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> See Also <DD>
+<CODE>cmdopt_new, cmdopt_process</CODE>
+</DL>
+
+
+
+<HR>
+<A HREF="slshfun-4.html">Next</A>
+<A HREF="slshfun-2.html">Previous</A>
+<A HREF="slshfun.html#toc3">Contents</A>
+</BODY>
+</HTML>

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/html/slshfun-4.html Added

@@ -0,0 +1,205 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+<HTML>
+<HEAD>
+ <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.69">
+ <TITLE> SLSH Library Reference (version 2.3.0): Filename Globbing and Related Functions</TITLE>
+ <LINK HREF="slshfun-5.html" REL=next>
+ <LINK HREF="slshfun-3.html" REL=previous>
+ <LINK HREF="slshfun.html#toc4" REL=contents>
+</HEAD>
+<BODY>
+<A HREF="slshfun-5.html">Next</A>
+<A HREF="slshfun-3.html">Previous</A>
+<A HREF="slshfun.html#toc4">Contents</A>
+<HR>
+<H2><A NAME="s4">4.</A> <A HREF="slshfun.html#toc4">Filename Globbing and Related Functions</A></H2>
+
+The <CODE>glob</CODE> function is defined <CODE>glob.sl</CODE>. The
+<CODE>fswalk_new</CODE> may be used for more generic filesystem processing.
+It is defined in <CODE>fswalk.sl</CODE>.
+<H2><A NAME="glob"></A> <A NAME="ss4.1">4.1</A> <A HREF="slshfun.html#toc4.1">glob</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Find files using wildcards
+<DT> Usage <DD>
+<CODE>files = glob (pattern1, ..., patternN)</CODE>;
+<DT> Description <DD>
+This function returns a list of files whose names match the specified
+globbing patterns. A globbing pattern is one in which '?' matches a
+single character, and '*' matches 0 or more characters.
+<DT> Example <DD>
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ files = glob ("*.c", "*.h");
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> See Also <DD>
+<CODE>glob_to_regexp, fswalk_new</CODE>
+</DL>
+
+
+<H2><A NAME="fswalk_new"></A> <A NAME="ss4.2">4.2</A> <A HREF="slshfun.html#toc4.2">fswalk_new</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Create an object to walk the filesystem tree
+<DT> Usage <DD>
+<CODE>obj = fswalk_new (Ref_Type dirfunc, Ref_Type filefunc; qualifiers)</CODE>
+<DT> Description <DD>
+The <CODE>fswalk_new</CODE> function creates an object that is useful
+for exploring a filesystem tree. It requires two arguments that
+are references to functions to be called when a directory or file is
+encountered. Each of these functions is passed at least two
+arguments: the name of the file or directory (including leading path
+elements relative to the directory where processing started), and
+the stat structure of the of the file or directory. Qualifiers may
+be used to specify additional arguments.
+The object's <CODE>walk</CODE> method is the one that actually walks the
+filesystem.
+The directory callback function must return an integer value that
+indicates how it should be processed. If the function returns 0,
+then the directory will be skipped (pruned). A positive value
+indicates that the directory will processed. If the function
+returns a negative value, then no further processing by the walk
+function will take place and control will pass to the user.
+The file callback function must also return an integer that
+indicates how processing should continue. If it returns a positive
+value, then additional files in the corresponding directory will be
+processed. If it returns 0, then no further files or subdirectories
+of the directory will be processed, and processing will continue to
+take place in the parent directory. Otherwise, the return value is
+negative, which indicates that processing should be stopped and
+control will pass back to the caller.
+
+<DT> Qualifiers <DD>
+The following qualifiers are supported:
+<BLOCKQUOTE><CODE>
+<PRE>
+ dargs={args...}
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<CODE>dargs</CODE> is a list of additional arguments that will be added when
+calling the directory callback function.
+<BLOCKQUOTE><CODE>
+<PRE>
+ fargs={args...}
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<CODE>fargs</CODE> is a list of additional arguments that will be added when
+calling the file callback function.
+<BLOCKQUOTE><CODE>
+<PRE>
+ followlinks=val
+</PRE>
+</CODE></BLOCKQUOTE>
+
+The <CODE>followlinks</CODE> qualifier may be used to indicate whether
+or not directories that are symbolic links are to be followed. By
+default, they are not. If <CODE>followlinks</CODE> is present with no
+value, or has a non-zero value, then symbolic links will be
+followed. Otherwise, if <CODE>followlinks</CODE> is not present, or is
+set to 0, then directories that are symbolic links will be skipped.
+
+<DT> Methods <DD>
+<CODE></CODE>
+<BLOCKQUOTE><CODE>
+<PRE>
+ .walk (String_Type top_dir)
+</PRE>
+</CODE></BLOCKQUOTE>
+
+The <CODE>.walk</CODE> function walks the filesystem starting at the
+specified top-level directory calling the directory and file
+callback functions as it goes.
+
+<DT> Example <DD>
+Print a list of all files containing a <CODE>.png</CODE> extension under
+the current directory:
+<BLOCKQUOTE><CODE>
+<PRE>
+ private define file_callback (name, st)
+ {
+ if (".png" == path_extname (name))
+ message (name);
+ return 1;
+ }
+ variable w = fswalk_new (NULL, &amp;file_callback);
+ w.walk (".");
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Get a list of all directories that are symbolic links under /usr.
+<BLOCKQUOTE><CODE>
+<PRE>
+ private define dir_callback (name, st, list)
+ {
+ st = lstat_file (name);
+ if (stat_is ("lnk", st.st_mode))
+ {
+ list_append (list, name);
+ return 0;
+ }
+ return 1;
+ }
+
+ define get_symdir_list (top)
+ {
+ variable list = {};
+ variable w = fswalk_new (&amp;dir_callback, NULL
+ ;dargs={list}, followlinks);
+ w.walk (top);
+ return list;
+ }
+ symdirlist = get_symdir_list ("/usr");
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Note that in this example, the dir_callback function returns 0 if
+the directory corresponds to a symbolic link. This causes the link
+to not be followed.
+Get a list of dangling symbolic links:
+<BLOCKQUOTE><CODE>
+<PRE>
+ private define file_callback (name, st, list)
+ {
+ if (stat_is ("lnk", st.st_mode))
+ {
+ if ((NULL == stat_file (name))
+ &amp;&amp; (errno == ENOENT))
+ list_append (list, name);
+ }
+ return 1;
+ }
+
+ define get_badlinks (top)
+ {
+ variable list = {};
+ variable w = fswalk_new (NULL, &amp;file_callback ;fargs={list});
+ w.walk (top);
+ return list;
+ }
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> See Also <DD>
+<CODE>glob, stat_file, lstat_file, listdir</CODE>;
+</DL>
+
+
+
+
+<HR>
+<A HREF="slshfun-5.html">Next</A>
+<A HREF="slshfun-3.html">Previous</A>
+<A HREF="slshfun.html#toc4">Contents</A>
+</BODY>
+</HTML>

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/html/slshfun-5.html Added

@@ -0,0 +1,174 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+<HTML>
+<HEAD>
+ <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.69">
+ <TITLE> SLSH Library Reference (version 2.3.0): Reading Text-formated Data Files</TITLE>
+ <LINK HREF="slshfun-6.html" REL=next>
+ <LINK HREF="slshfun-4.html" REL=previous>
+ <LINK HREF="slshfun.html#toc5" REL=contents>
+</HEAD>
+<BODY>
+<A HREF="slshfun-6.html">Next</A>
+<A HREF="slshfun-4.html">Previous</A>
+<A HREF="slshfun.html#toc5">Contents</A>
+<HR>
+<H2><A NAME="s5">5.</A> <A HREF="slshfun.html#toc5">Reading Text-formated Data Files</A></H2>
+
+These functions are defined in <CODE>readascii.sl</CODE>. For comma or
+tab-delimited files, consider useing the CSV module.
+<H2><A NAME="readascii"></A> <A NAME="ss5.1">5.1</A> <A HREF="slshfun.html#toc5.1">readascii</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Read data from a text file
+<DT> Usage <DD>
+<CODE>Int_Type readascii (file, &amp;v1,...&amp;vN ; qualifiers)</CODE>
+<DT> Description <DD>
+This function may be used to read formatted data from a text (as
+opposed to binary) file and stores the values as arrays in the
+specified variables <CODE>v1,..., vN</CODE> (passed as references). It
+returns the number of lines read from the file that matched the
+format (implicit or specified by a qualifier).
+The file parameter may be a string that gives the filename to read,
+a <CODE>File_Type</CODE> object representing an open file pointer, or an
+array of lines to be scanned.
+<DT> Qualifiers <DD>
+The following qualifiers are supported by the function
+<BLOCKQUOTE><CODE>
+<PRE>
+ format=string The sscanf format string to be used when
+ parsing lines.
+ nrows=integer The maximum number of matching rows to handle.
+ ncols=integer If a single reference is passed, it will be
+ assigned an array of ncols arrays of data values.
+ skip=integer Skip the specified number of lines before
+ scanning
+ maxlines=integer Read no more than this many lines.
+ cols=Array_Type Read only the specified (1-based) columns.
+ Used with an implict format
+ delim=string For an implicit format, use this as a field
+ separator. The default is whitespace.
+ type=string For an implicit format, use this sscanf type
+ specifier. Default is %lf (Double_Type).
+ size=integer Use this value as the initial size for the
+ arrays.
+ dsize=integer Use this value as an increment when
+ reallocating the arrays.
+ stop_on_mismatch Stop reading input when a line does not match
+ the format
+ lastline=&amp;v Assign the last line read to the variable v.
+ lastlinenum=&amp;v Assign the last line number (1-based to v)
+ comment=string Lines beginning with this string are ignored.
+ as_list If present, then return data in lists rather
+ than arrays.
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> Example <DD>
+As a simple example, consider a file called <CODE>imped.dat</CODE> containing
+<BLOCKQUOTE><CODE>
+<PRE>
+ # Distance Zr Zi
+ 0.0 50.2 0.1
+ 1.0 47.3 -12.2
+ 2.0 43.9 -15.8
+</PRE>
+</CODE></BLOCKQUOTE>
+
+The 3 columns may be read and stored in the variables <CODE>x</CODE>, <CODE>zr</CODE>,
+<CODE>zi</CODE> using
+<BLOCKQUOTE><CODE>
+<PRE>
+ n = readascii ("imped.dat", &amp;x, &amp;zr, &amp;zi);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+After return, The value of <CODE>x</CODE> will be set to
+<CODE>0.0,1.0,2.0</CODE>, <CODE>zr</CODE> to <CODE>50.2,47.3,43.9</CODE>,
+<CODE>zi</CODE> to <CODE>0.1,-12.2,-15.8</CODE>, and <CODE>n</CODE> to 3.
+Another way to read the same data is to use
+<BLOCKQUOTE><CODE>
+<PRE>
+ n = readascii ("imped.dat", &amp;data; ncols=3);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+In this case, <CODE>data</CODE> will be <CODE>Array_Type3</CODE>, with each
+element of the array containing the array of data values for the
+corresponding column. As before, <CODE>n</CODE> will be 3.
+As a more complex example, Consider a file called <CODE>score.dat</CODE>
+that contains:
+<BLOCKQUOTE><CODE>
+<PRE>
+ Name Score Date Flags
+ Bill 73.2 03-Nov-2046 1
+ James 22.9 03-Nov-2046 1
+ Lucy 89.1 04-Nov-2046 3
+</PRE>
+</CODE></BLOCKQUOTE>
+
+This file may be read using
+<BLOCKQUOTE><CODE>
+<PRE>
+ n = readascii ("score.dat", &amp;name, &amp;score, &amp;date, &amp;flags;
+ format="%s %lf %s %d");
+</PRE>
+</CODE></BLOCKQUOTE>
+
+In this case, <CODE>n</CODE> will be 3, <CODE>name</CODE> and <CODE>date</CODE> will
+be <CODE>String_Type</CODE> arrays, <CODE>score</CODE> will be a
+<CODE>Double_Type</CODE> array, and <CODE>flags</CODE> will be an
+<CODE>Int_Type</CODE> array.
+Now suppose that only the score and flags column are of interest.
+The <CODE>name</CODE> and <CODE>date</CODE> fields may be ignored using
+<BLOCKQUOTE><CODE>
+<PRE>
+ n = readascii ("score.dat", &amp;score, &amp;flags";
+ format="%*s %lf %*s %d");
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Here, <CODE>%*s</CODE> indicates that the field is to be parsed as a
+string, but not assigned to a variable.
+Consider the task of reading columns from a file called
+<CODE>books.dat</CODE> that contain quoted strings such as:
+<BLOCKQUOTE><CODE>
+<PRE>
+ # Year Author Title
+ "1605" "Miguel de Cervantes" "Don Quixote de la Mancha"
+ "1885" "Mark Twain" "The Adventures of Huckleberry Finn"
+ "1955" "Vladimir Nabokov" "Lolita"
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Such a file may be read using
+<BLOCKQUOTE><CODE>
+<PRE>
+ n = readascii ("books.dat", &amp;year, &amp;author, &amp;title;
+ format="\"%^\"\" \"%^\"\" \"%^\"\"");
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> Notes <DD>
+This current version of this function does not handle missing data.
+For such files, the <CODE>csv_readcol</CODE> function might be a better
+choice.
+By default, lines not matching the expected format are assumed to
+be comments and are skipped. So normally the <CODE>comment</CODE>
+qualifier is not needed. However, it is useful in conjunction with
+the <CODE>stop_on_mismatch</CODE> qualifier to force the parser to skip
+lines beginning with the comment string and continue scanning.
+<DT> See Also <DD>
+<CODE>sscanf, atof, fopen, fgets, fgetslines, csv_readcol</CODE>
+</DL>
+
+
+
+<HR>
+<A HREF="slshfun-6.html">Next</A>
+<A HREF="slshfun-4.html">Previous</A>
+<A HREF="slshfun.html#toc5">Contents</A>
+</BODY>
+</HTML>

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/html/slshfun-6.html Added

@@ -0,0 +1,142 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+<HTML>
+<HEAD>
+ <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.69">
+ <TITLE> SLSH Library Reference (version 2.3.0): Structure Functions</TITLE>
+ <LINK HREF="slshfun-7.html" REL=next>
+ <LINK HREF="slshfun-5.html" REL=previous>
+ <LINK HREF="slshfun.html#toc6" REL=contents>
+</HEAD>
+<BODY>
+<A HREF="slshfun-7.html">Next</A>
+<A HREF="slshfun-5.html">Previous</A>
+<A HREF="slshfun.html#toc6">Contents</A>
+<HR>
+<H2><A NAME="s6">6.</A> <A HREF="slshfun.html#toc6">Structure Functions</A></H2>
+
+These functions are defined in <CODE>structfuns.sl</CODE>.
+<H2><A NAME="struct_filter"></A> <A NAME="ss6.1">6.1</A> <A HREF="slshfun.html#toc6.1">struct_filter</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Apply a filter to a struct
+<DT> Usage <DD>
+<CODE>struct_filter(Struct_Type s, Int_Type i)</CODE>
+<DT> Description <DD>
+This function applies the filter <CODE>i</CODE> to the fields of a structure
+by performing the operation
+<BLOCKQUOTE><CODE>
+<PRE>
+ s.field = s.fieldi;
+</PRE>
+</CODE></BLOCKQUOTE>
+
+on each array field of the structure. Scalar fields will not be modified.
+The <CODE>dim</CODE> qualifier may be used to filter on a specific array
+dimension. For example, consider the structure
+<BLOCKQUOTE><CODE>
+<PRE>
+ s = struct { a = Int_Type10, b = Int_Type10,20 };
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Then
+<BLOCKQUOTE><CODE>
+<PRE>
+ struct_filter (s, i; dim=0);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+would produce the same result as
+<BLOCKQUOTE><CODE>
+<PRE>
+ s.a = s.ai;
+ s.b = s.bi,*;
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> Notes <DD>
+By default this function modifies the fields of the structure passed
+to it. Sometimes it is desirable to create a new structure and
+leave the old one untouched. This may be achieved using the
+<CODE>copy</CODE> qualifier, e.g.,
+<BLOCKQUOTE><CODE>
+<PRE>
+ filtered_s = struct_filter (s, i; copy);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> See Also <DD>
+<CODE>where</CODE>
+</DL>
+
+
+
+<H2><A NAME="struct_combine"></A> <A NAME="ss6.2">6.2</A> <A HREF="slshfun.html#toc6.2">struct_combine</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Combine two or more structures
+<DT> Usage <DD>
+<CODE>new_s = struct_combine (s1, s2, ...)</CODE>
+<DT> Description <DD>
+This function creates a new structure from two or more structures
+<CODE>s1</CODE>, <CODE>s2</CODE>,.... The new structure will have fields formed by the
+union of the fields of the input structures. The new structure fields will
+be given values that correspond to the fields of the input structures. If
+more than one structure has the same field name, the value of the field will
+be given by the last structure.
+If any of the input values is a string, or an array of strings, then
+it will be interpreted as a representing a structure with the
+corresponding field names. This is a useful feature when one wants
+to expand a structure with new field names, e.g.,
+<BLOCKQUOTE><CODE>
+<PRE>
+ s = struct { foo, bar };
+ t = struct_combine (s, "baz"); % t = struct {foo, bar, baz};
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> Notes <DD>
+The same effect can be achieved by using the dereference operator, e.g.,
+<BLOCKQUOTE><CODE>
+<PRE>
+ t = struct { @s, "baz" };
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> See Also <DD>
+<CODE>get_struct_field_names</CODE>
+</DL>
+
+
+
+<H2><A NAME="struct_field_exists"></A> <A NAME="ss6.3">6.3</A> <A HREF="slshfun.html#toc6.3">struct_field_exists</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Determine whether or not a structure contains a specified field
+<DT> Usage <DD>
+<CODE>Int_Type struct_field_exists (Struct_Type s, String_Type f)</CODE>
+<DT> Description <DD>
+This function may be used to determine if a structure contains a field with
+a specfied name. It returns 0 if the structure does not contain the field,
+or non-zero if it does.
+<DT> See Also <DD>
+<CODE>get_struct_field_names</CODE>
+</DL>
+
+
+
+<HR>
+<A HREF="slshfun-7.html">Next</A>
+<A HREF="slshfun-5.html">Previous</A>
+<A HREF="slshfun.html#toc6">Contents</A>
+</BODY>
+</HTML>

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/html/slshfun-7.html Added

@@ -0,0 +1,104 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+<HTML>
+<HEAD>
+ <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.69">
+ <TITLE> SLSH Library Reference (version 2.3.0): Array Functions</TITLE>
+ <LINK HREF="slshfun-8.html" REL=next>
+ <LINK HREF="slshfun-6.html" REL=previous>
+ <LINK HREF="slshfun.html#toc7" REL=contents>
+</HEAD>
+<BODY>
+<A HREF="slshfun-8.html">Next</A>
+<A HREF="slshfun-6.html">Previous</A>
+<A HREF="slshfun.html#toc7">Contents</A>
+<HR>
+<H2><A NAME="s7">7.</A> <A HREF="slshfun.html#toc7">Array Functions</A></H2>
+
+S-Lang includes many intrinsic functions that operate on arrays. The
+additional functions described here are defined in
+<CODE>arrayfuns.sl</CODE>.
+
+
+<H2><A NAME="rearrange"></A> <A NAME="ss7.1">7.1</A> <A HREF="slshfun.html#toc7.1">rearrange</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Rearrange the elements of a 1-d array or list.
+<DT> Usage <DD>
+<CODE>rearrange (A, indices)</CODE>
+<DT> Description <DD>
+This function performs an in-place rearrangment of the the elements
+of an array according to the specified permutation, represented by
+the <CODE>indices</CODE> argument. The <CODE>indices</CODE> array is assumed to
+contain unique integers in the range <CODE>0,length(A)-1</CODE>.
+<DT> Notes <DD>
+The function modifies the elements of the <CODE>indices</CODE> array while
+it performs the rearrangement. The values will get restored upon
+return from function.
+The algorithm used was derived from the DPPERM function, which is
+part of the SLATEC package. See
+<A HREF="http://gams.nist.gov/cgi-bin/serve.cgi/Package/SLATEC">http://gams.nist.gov/cgi-bin/serve.cgi/Package/SLATEC</A>.
+<DT> See Also <DD>
+<CODE>array_reverse, array_swap</CODE>
+</DL>
+
+
+
+<H2><A NAME="reverse"></A> <A NAME="ss7.2">7.2</A> <A HREF="slshfun.html#toc7.2">reverse</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Reverse the elements of a 1-d array
+<DT> Usage <DD>
+<CODE>Array_Type reverse (Array_Type A)</CODE>
+<DT> Description <DD>
+The <CODE>reverse</CODE> function reverses the elements of a 1-d array and
+returns the result.
+<DT> See Also <DD>
+<CODE>shift</CODE>
+</DL>
+
+
+
+<H2><A NAME="shift"></A> <A NAME="ss7.3">7.3</A> <A HREF="slshfun.html#toc7.3">shift</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Shift the elements of a 1-d array
+<DT> Usage <DD>
+<CODE>Array_Type shift (Array_Type A, Int_Type n)</CODE>
+<DT> Description <DD>
+The <CODE>shift</CODE> function shifts the elements of an array by a specified amount
+and returns the result. If <CODE>n</CODE> is positive, the ith element of the array
+will be shifted to the position <CODE>i-n</CODE> of the array. Elements for
+which <CODE>i-n</CODE> is less than 0 will be moved to the end of the array.
+<DT> Example <DD>
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ A = 1,2,3,4,5,6,7,8,9;
+ B = shift (A, 3); % ==&gt; B = 4,5,6,7,8,9,1,2,3;
+ C = shift (A, -1); % ==&gt; C = 9,1,2,3,4,5,6,7,8;
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> Notes <DD>
+It many ways <CODE>rotate</CODE> would be a better name for this function.
+<DT> See Also <DD>
+<CODE>reverse, transpose</CODE>
+</DL>
+
+
+
+<HR>
+<A HREF="slshfun-8.html">Next</A>
+<A HREF="slshfun-6.html">Previous</A>
+<A HREF="slshfun.html#toc7">Contents</A>
+</BODY>
+</HTML>

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/html/slshfun-8.html Added

@@ -0,0 +1,243 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+<HTML>
+<HEAD>
+ <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.69">
+ <TITLE> SLSH Library Reference (version 2.3.0): List Functions and List-based Data Structures</TITLE>
+ <LINK HREF="slshfun-9.html" REL=next>
+ <LINK HREF="slshfun-7.html" REL=previous>
+ <LINK HREF="slshfun.html#toc8" REL=contents>
+</HEAD>
+<BODY>
+<A HREF="slshfun-9.html">Next</A>
+<A HREF="slshfun-7.html">Previous</A>
+<A HREF="slshfun.html#toc8">Contents</A>
+<HR>
+<H2><A NAME="s8">8.</A> <A HREF="slshfun.html#toc8">List Functions and List-based Data Structures</A></H2>
+
+The file <CODE>arrayfuns.sl</CODE> includes functions for manipulating
+lists. It also includes some list-based data structures such as heaps.
+<H2><A NAME="list_sort"></A> <A NAME="ss8.1">8.1</A> <A HREF="slshfun.html#toc8.1">list_sort</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Sort a list of item
+<DT> Usage <DD>
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ Int_Type indices = list_sort (List_Type list); % Form 1
+ list_sort (List_Type list; inplace); % Form 2
+</PRE>
+</CODE></BLOCKQUOTE>
+
+
+<DT> Description <DD>
+The <CODE>list_sort</CODE> may be used to sort a list. By default, it
+returns a permutation index array for the desired sort. If the
+<CODE>inplace</CODE> qualifier is given, the sort will be in-place and no
+index array will be returned.
+<DT> Qualifiers <DD>
+The following qualifiers may be used to modify the behavior of the
+function:
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ dir=1
+</PRE>
+</CODE></BLOCKQUOTE>
+
+If the value of the <CODE>dir</CODE> qualifier is non-negative, the sort will
+take place in an increasing order. If negative, the list will be
+sorted in decreasing order.
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ cmp=&amp;cmpfunc
+</PRE>
+</CODE></BLOCKQUOTE>
+
+The <CODE>cmp</CODE> qualifier specifies the function used to comparison
+operation for two elements of an array. Its value must be a
+reference to a function that accepts two arguments representing the
+objects to be compared. It must return a positive integer, 0, or
+a negative integer if the value of the first argument is greater
+than, equal to, or less than the value of the second, respectively.
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ inplace=1
+</PRE>
+</CODE></BLOCKQUOTE>
+
+The inplace qualifier may be used to indicate if the list is to be
+sorted in place. If the qualifier is present with no-value or a
+non-zero value, the list will be sorted in place and no index array
+will be returned. If not present, or present with a value of 0, the
+list will not be modified, and an index array will be returned.
+<DT> Example <DD>
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ list = {1, 9, 3, 7};
+ i = list_sort (list);
+ sorted_list = listi;
+</PRE>
+</CODE></BLOCKQUOTE>
+
+The above example creates a second list (<CODE>sorted_list</CODE>) by
+using the permutation index array to rearrange the objects in the
+unsorted list.
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ list = {1, 9, 3, 7};
+ list_sort (list; inplace);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+In this example, the list is sorted in-place.
+Consider a list of strings that are to be sorted in increasing
+order of the number of bytes used by each string. For this, a custom
+sort function is required:
+<BLOCKQUOTE><CODE>
+<PRE>
+ private define cmpfunc (a, b)
+ {
+ return strbytelen(a) - strbytelen(b);
+ }
+ list = {"Here", "is", "a", "list", "of", "strings"};
+ list_sort (list; inplace);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> Notes <DD>
+Keep in mind that a list can contain a heterogeneous collection of
+object where there is no predefined comparison operation. For
+example, there may be no natural way to compare an integer to a
+string. For a heterogeneous list, a comparison function must be
+provided.
+<DT> See Also <DD>
+<CODE>array_sort, rearrange</CODE>
+</DL>
+
+
+
+<H2><A NAME="heap_new"></A> <A NAME="ss8.2">8.2</A> <A HREF="slshfun.html#toc8.2">heap_new</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Instantiate a heap data object
+<DT> Usage <DD>
+<CODE>Struct_Type h = new_heap (List_Type list)</CODE>
+<DT> Description <DD>
+The <CODE>new_heap</CODE> function takes a <CODE>List_Type</CODE> object and
+rearranges its elements to form a heap. A list rearranged to form a
+heap has the property that <CODE>listi &gt;= list2*i+j</CODE>, where j=1 or 2,
+and i is the list index (from 0).
+Upon return, the elements of the list will be rearranged to have the
+heap property and a new container object (the heap) will be
+returned. It may be manipulated using the method calls described
+below.
+<DT> Qualifiers <DD>
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ dir=-1
+</PRE>
+</CODE></BLOCKQUOTE>
+
+The <CODE>dir</CODE> qualifier may be used to specify the direction of the
+heap. The default (dir=-1) specifies a top-down ordering. A
+bottom-up ordering corresponds to dir=1.
+
+<BLOCKQUOTE><CODE>
+<PRE>
+ cmp=&amp;cmpfunc
+</PRE>
+</CODE></BLOCKQUOTE>
+
+The <CODE>cmp</CODE> may be used to specify the function to be used when
+comparing elements of the list. Its value must be a reference to a
+function that takes two parameters and returns a positive integer if
+the value of the first parameter is greater than the second, 0 if
+they are equal, or a negative integer if the first is less than
+the second. For example, if the list consists of structures with
+fields called <CODE>lastname</CODE> and <CODE>firstname</CODE> that are to be
+used for ordering, then the desired function would look something
+like:
+<BLOCKQUOTE><CODE>
+<PRE>
+ define cmpfunc (a, b)
+ {
+ variable c = strcmp (a.lastname, b.lastname);
+ if (c == 0) c = strcmp (a.firstname, b.firstname);
+ return c;
+ }
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> Methods <DD>
+<CODE></CODE>
+<DT> length() <DD>
+Get the length to the heap
+<DT> add(obj) <DD>
+Add a new object to the heap
+<DT> remove() <DD>
+Remove the largest (for top-down) or smallest (for
+bottom-up) item from the heap and return its value.
+<DT> peek() <DD>
+Get the largest (top-down) or smallest(bottom-up) item
+from the heap, but do not remove it.
+Note that attempting to peek at or remove an item from an empty list
+will result in an <CODE>IndexError</CODE> exception.
+<DT> Example <DD>
+Suppose that merging two objects requires a time equal to the
+combined length of the objects. For example, if the length of first
+is A and that of the second is B, then the time to merge the two
+will be A + B. What is the minimum amount of time it takes to merge
+a list of N objects with lengths <CODE>{L_k}, k=0...N-1</CODE>? The
+answer to this is very simple if a bottom-up heap is used. The idea
+is to remove the two smallest objects from the heap, combine them
+and then add the result back to the heap. Repeat this process until
+the heap is empty. In the following, <CODE>list</CODE> is a list of the
+lengths of the objects to be merged.
+<BLOCKQUOTE><CODE>
+<PRE>
+ define compute_merge_time (list)
+ {
+ variable h = heap_new (list; dir=1); % bottom-up heap
+ variable a, b, c, t;
+ a = h.remove (); t = 0;
+ while (h.length())
+ {
+ b = h.remove ();
+ c = a + b;
+ t += c;
+ h.add (c);
+ a = h.remove ();
+ }
+ return t;
+ }
+</PRE>
+</CODE></BLOCKQUOTE>
+
+<DT> Notes <DD>
+Generally speaking, a list will require the specification of a
+comparison function unless the list consists solely of elements that
+may be compared using the <CODE>&gt;</CODE>, <CODE>&lt;</CODE>, and <CODE>==</CODE> operators.
+<DT> See Also <DD>
+<CODE>list_sort, list_new</CODE>
+</DL>
+
+
+
+<HR>
+<A HREF="slshfun-9.html">Next</A>
+<A HREF="slshfun-7.html">Previous</A>
+<A HREF="slshfun.html#toc8">Contents</A>
+</BODY>
+</HTML>

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/html/slshfun-9.html Added

@@ -0,0 +1,306 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+<HTML>
+<HEAD>
+ <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.69">
+ <TITLE> SLSH Library Reference (version 2.3.0): Subprocess Functions</TITLE>
+ <LINK HREF="slshfun-10.html" REL=next>
+ <LINK HREF="slshfun-8.html" REL=previous>
+ <LINK HREF="slshfun.html#toc9" REL=contents>
+</HEAD>
+<BODY>
+<A HREF="slshfun-10.html">Next</A>
+<A HREF="slshfun-8.html">Previous</A>
+<A HREF="slshfun.html#toc9">Contents</A>
+<HR>
+<H2><A NAME="s9">9.</A> <A HREF="slshfun.html#toc9">Subprocess Functions</A></H2>
+
+These functions in <CODE>process.sl</CODE> facilitate the creation of
+subprocesses and pipelines.
+<H2><A NAME="new_process"></A> <A NAME="ss9.1">9.1</A> <A HREF="slshfun.html#toc9.1">new_process</A>
+</H2>
+
+
+<DL>
+<DT> Synopsis <DD>
+Create a subprocess object
+<DT> Usage <DD>
+<CODE>Struct_Type new_process (String_Type argv; qualifiers)</CODE>
+<DT> Description <DD>
+This function executes the program specified by the <CODE>argv</CODE>
+parameter in a subprocess. If <CODE>argv</CODE> is an array, the first
+element (<CODE>argv0</CODE>) of the array gives the name of the program
+to be executed, and the remaining elements serve as arguments passed
+to the program. The program returns a structure that may be used to
+interact with the process. Upon error, an exception will be thrown.
+The calling program may interact with the subprocess by reading from
+or writing to the file descriptor fields of the structure returned
+by the <CODE>new_process</CODE> function. The specific file descriptors
+are dictated via the <CODE>read</CODE>, <CODE>write</CODE>, and <CODE>dupN</CODE>
+qualifiers, as described in detail below.
+The function returns a structure containing zero or more fields of the form
+<CODE>fdN</CODE> where <CODE>N</CODE> is an integer derived from the qualifiers,
+e.g., <CODE>fd0</CODE> and <CODE>fd1</CODE> correspond to the child's stdin and
+stdout, respectively. The structure also contains fields of the
+form <CODE>fpN</CODE> whose values are stdio <CODE>File_Type</CODE> objects
+obtained using <CODE>fdopen</CODE> with the corresponding <CODE>fdN</CODE> value.
+Other important fields include <CODE>pid</CODE> whose value is
+the process-id of the newly created process.
+The status of the process may be checked or collected using the
+<CODE>wait</CODE> method. It is very important to call this method to
+avoid the creation of zombie processes.
+
+<DT> Qualifiers <DD>
+The following qualifiers are supported:
+<BLOCKQUOTE><CODE>
+<PRE>
+ read=fds
+</PRE>
+</CODE></BLOCKQUOTE>
+
+fds is a list of integer file descriptors that are open for read
+access in the subprocess, and may be written to by the calling
+process using the fdN or fpN fields of the structure.
+<BLOCKQUOTE><CODE>
+<PRE>
+ write=fds
+</PRE>
+</CODE></BLOCKQUOTE>
+
+fds is a list of integer file descriptors that are open for write
+access in the subprocess, and may be read to by the calling
+process using the fdN or fpN fields of the structure.
+<BLOCKQUOTE><CODE>
+<PRE>
+ stdin=filename
+ stdout=filename
+ stderr=filename
+</PRE>
+</CODE></BLOCKQUOTE>
+
+These qualifiers allow the stdin, stdout, and stderr file
+descriptors in the subprocess to be redirected to a file. Note:
+The filenames are interpreted relative to the value of the
+<CODE>dir</CODE> qualifier.
+<BLOCKQUOTE><CODE>
+<PRE>
+ fdN=string
+</PRE>
+</CODE></BLOCKQUOTE>
+
+This qualifier will cause the integer file descriptor N to be open
+in the subprocess and redirected to the filename represented by
+the string, which is interpreted relative to the value of the <CODE>dir</CODE>
+qualifier. The access mode is dictated by the first few
+characters of the string as described in more detail below.
+<BLOCKQUOTE><CODE>
+<PRE>
+ stdin=File_Type|FD_Type
+ stdout=File_Type|FD_Type
+ stderr=File_Type|FD_Type
+ fdN=FD_Type|FD_Type
+</PRE>
+</CODE></BLOCKQUOTE>
+
+If the stdin, stdout, stderr, or fdN qualifiers have File_Type or
+FD_Type values, then corresponding file descriptors in the
+subprocess will be dup'd to FD_Type or FP_Type file descriptor.
+This form of the qualifier may be used to setup pipelines.
+<BLOCKQUOTE><CODE>
+<PRE>
+ dupN=int
+</PRE>
+</CODE></BLOCKQUOTE>
+
+The file descriptor corresponding to the integer N in the
+subprocess is created by duping the descriptor given by the
+integer value of the qualifier. For example, dup2=1 would cause
+stderr (fd=2) in the subprocess to be redirected to stdout (fd=1).
+<BLOCKQUOTE><CODE>
+<PRE>
+ dir=string
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Change to the specified directory in the child process. This
+will happen after the child process is started, but before any
+files have been opened. Hence, files attached to <CODE>stdin</CODE>,
+<CODE>stdout</CODE>, etc will be opened relative to this directory.
+<BLOCKQUOTE><CODE>
+<PRE>
+ pre_exec_hook=&amp;func
+</PRE>
+</CODE></BLOCKQUOTE>
+
+This qualifier will cause the function corresponding to <CODE>func</CODE> to
+be called prior to closing unused file descriptors and invoking
+the executable. The function will be passed a list of integer
+valued file descriptors that will be kept open. Additional
+integers may be added to the list by the function. If the
+qualifier <CODE>pre_exec_hook_optarg</CODE> exists, it will also be
+passed as an addtional argument.
+<BLOCKQUOTE><CODE>
+<PRE>
+ pre_exec_hook_optarg=VALUE
+</PRE>
+</CODE></BLOCKQUOTE>
+
+If this qualifier exists, its value will be passed as the second
+argument to the <CODE>pre_exec_hook</CODE> callback function.
+Note that the read and write qualifiers specify the nature of the
+file descriptors from the child process's view. That is, those
+opened in the child process using the read qualifier, may be written
+to by the parent. Similarly, those opened using the write qualifier
+may be read by the parent.
+
+<DT> Methods <DD>
+<CODE></CODE>
+<BLOCKQUOTE><CODE>
+<PRE>
+ Struct_Type .wait ( options )
+</PRE>
+</CODE></BLOCKQUOTE>
+
+The <CODE>.wait</CODE> method may be used to collect the exist status of
+the process. When called without arguments, it will cause the
+parent process to wait for the subprocess to exit and return its
+exit status in the form of a <CODE>waitpid</CODE> structure. The optional
+<CODE>options</CODE> argument corresponds to the options argument of the
+<CODE>waitpid</CODE> function. The most common is the WNOHANG option,
+which will cause the <CODE>.wait</CODE> method to return immediately if
+the process has not exited.
+If an error occurs, the function will return NULL and set
+<CODE>errno</CODE> accordingly. Otherwise it will return a <CODE>waitpid</CODE>
+structure. See the documentation for <CODE>waitpid</CODE> for more
+information.
+
+<DT> Example <DD>
+In the following examples, <CODE>pgm</CODE> represents the program to be
+invoked in the subprocess. For simplicity, no addition arguments are
+shown
+Create subprocess that inherits stdin, stdout, stderr from the caller:
+<BLOCKQUOTE><CODE>
+<PRE>
+ obj = new_process (pgm);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Create a subprocess that inherits stdin, stdout, and writes stderr
+to a file:
+<BLOCKQUOTE><CODE>
+<PRE>
+ obj = new_process (pgm; stderr="/tmp/file"); % form 1
+ obj = new_process (pgm; fd2="&gt;/tmp/file"); % form 2
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Mimic popen(pgm, "r"):
+<BLOCKQUOTE><CODE>
+<PRE>
+ obj = new_process (pgm; write=1); % Read from obj.fp1
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Mimic popen(pgm, "w"):
+<BLOCKQUOTE><CODE>
+<PRE>
+ obj = new_process (pgm; read=0); % Write to obj.fp0
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Mimic popen("pgm 2&gt;&amp;1", "r"):
+<BLOCKQUOTE><CODE>
+<PRE>
+ obj = new_process (pgm; write=1, dup2=1); % Read from fp1
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Send stdout to a file, read from the subprocess's stderr:
+<BLOCKQUOTE><CODE>
+<PRE>
+ obj = new_process (pgm; stdout="/tmp/file", write=2);
+ % Read from obj.fp2
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Create a process with handles to its stdin, stdout, stderr
+<BLOCKQUOTE><CODE>
+<PRE>
+ obj = new_process (pgm; write={1,2}, read=0);
+ % Use obj.fp0 for stdin, obj.fp1 for stdout, and obj.fp2 for stderr
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Create a process with a write handle to the process's fd=27 and a
+read handle to the process's stdout.
+<BLOCKQUOTE><CODE>
+<PRE>
+ obj = new_process (pgm; read=27, write=1);
+ % write to fp27, read from fp1
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Create a pipeline: pgm1 | pgm2 &gt; /tmp/log :
+<BLOCKQUOTE><CODE>
+<PRE>
+ obj1 = new_process (pgm1; write=1);
+ obj2 = new_process (pgm2; stdin=obj1.fp1, stdout="/tmp/log");
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Create a pipeline with fd=27 from pgm1 redirected to stdin of pgm2:
+<BLOCKQUOTE><CODE>
+<PRE>
+ obj1 = new_process (pgm1; write=27);
+ obj2 = new_process (pgm2; stdin=obj1.fp27);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Create a pipeline with fd=27 from pgm1 redirected to fd=9 of pgm2:
+<BLOCKQUOTE><CODE>
+<PRE>
+ obj1 = new_process (pgm1; write=27);
+ obj2 = new_process (pgm2; fp9=obj1.fp27);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Mimic: pgm 2&gt;&amp;1 1&gt;/dev/null
+<BLOCKQUOTE><CODE>
+<PRE>
+ obj = new_process (pgm; fp2=1, stdout="/dev/null");
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Mimic: pgm &gt;/dev/null 2&gt;&amp;1
+<BLOCKQUOTE><CODE>
+<PRE>
+ obj = new_process (pgm; stdout="/dev/null", dup2=1);
+</PRE>
+</CODE></BLOCKQUOTE>
+
+Append the output of pgm to /tmp/file.log:
+<BLOCKQUOTE><CODE>
+<PRE>
+ obj = new_process (pgm; stdout="&gt;&gt;/tmp/file.log");
+</PRE>
+</CODE></BLOCKQUOTE>
+
+
+<DT> Notes <DD>
+Care must be exercised when reading or writing to multiple file
+descriptors of a subprocess to avoid deadlock. In such cases, the
+select module should be used, or the file descriptors could be put in
+non-blocking mode via the fcntl module.
+It is important to call the <CODE>.wait</CODE> method prevent the process
+from becoming a zombie and clogging the process table.
+<DT> See Also <DD>
+<CODE>popen, system</CODE>
+</DL>
+
+
+
+<HR>
+<A HREF="slshfun-10.html">Next</A>
+<A HREF="slshfun-8.html">Previous</A>
+<A HREF="slshfun.html#toc9">Contents</A>
+</BODY>
+</HTML>

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/html/slshfun.html Added

@@ -0,0 +1,126 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+<HTML>
+<HEAD>
+ <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.69">
+ <TITLE> SLSH Library Reference (version 2.3.0)</TITLE>
+ <LINK HREF="slshfun-1.html" REL=next>
+
+
+</HEAD>
+<BODY>
+<A HREF="slshfun-1.html">Next</A>
+Previous
+Contents
+<HR>
+<H1> SLSH Library Reference (version 2.3.0)</H1>
+
+<H2>John E. Davis &lt;www.jedsoft.org&gt;</H2> Sep 14, 2014
+
+<H2><A NAME="toc1">1.</A> <A HREF="slshfun-1.html">Introduction</A></H2>
+
+
+<H2><A NAME="toc2">2.</A> <A HREF="slshfun-2.html">The <CODE>require</CODE> Function</A></H2>
+
+<UL>
+<LI><A NAME="toc2.1">2.1</A> <A HREF="slshfun-2.html#ss2.1">_featurep</A>
+<LI><A NAME="toc2.2">2.2</A> <A HREF="slshfun-2.html#ss2.2">provide</A>
+<LI><A NAME="toc2.3">2.3</A> <A HREF="slshfun-2.html#ss2.3">require</A>
+</UL>
+
+<H2><A NAME="toc3">3.</A> <A HREF="slshfun-3.html">Command Line Parsing Functions</A></H2>
+
+<UL>
+<LI><A NAME="toc3.1">3.1</A> <A HREF="slshfun-3.html#ss3.1">cmdopt_new</A>
+<LI><A NAME="toc3.2">3.2</A> <A HREF="slshfun-3.html#ss3.2">cmdopt_process</A>
+<LI><A NAME="toc3.3">3.3</A> <A HREF="slshfun-3.html#ss3.3">cmdopt_add</A>
+</UL>
+
+<H2><A NAME="toc4">4.</A> <A HREF="slshfun-4.html">Filename Globbing and Related Functions</A></H2>
+
+<UL>
+<LI><A NAME="toc4.1">4.1</A> <A HREF="slshfun-4.html#ss4.1">glob</A>
+<LI><A NAME="toc4.2">4.2</A> <A HREF="slshfun-4.html#ss4.2">fswalk_new</A>
+</UL>
+
+<H2><A NAME="toc5">5.</A> <A HREF="slshfun-5.html">Reading Text-formated Data Files</A></H2>
+
+<UL>
+<LI><A NAME="toc5.1">5.1</A> <A HREF="slshfun-5.html#ss5.1">readascii</A>
+</UL>
+
+<H2><A NAME="toc6">6.</A> <A HREF="slshfun-6.html">Structure Functions</A></H2>
+
+<UL>
+<LI><A NAME="toc6.1">6.1</A> <A HREF="slshfun-6.html#ss6.1">struct_filter</A>
+<LI><A NAME="toc6.2">6.2</A> <A HREF="slshfun-6.html#ss6.2">struct_combine</A>
+<LI><A NAME="toc6.3">6.3</A> <A HREF="slshfun-6.html#ss6.3">struct_field_exists</A>
+</UL>
+
+<H2><A NAME="toc7">7.</A> <A HREF="slshfun-7.html">Array Functions</A></H2>
+
+<UL>
+<LI><A NAME="toc7.1">7.1</A> <A HREF="slshfun-7.html#ss7.1">rearrange</A>
+<LI><A NAME="toc7.2">7.2</A> <A HREF="slshfun-7.html#ss7.2">reverse</A>
+<LI><A NAME="toc7.3">7.3</A> <A HREF="slshfun-7.html#ss7.3">shift</A>
+</UL>
+
+<H2><A NAME="toc8">8.</A> <A HREF="slshfun-8.html">List Functions and List-based Data Structures</A></H2>
+
+<UL>
+<LI><A NAME="toc8.1">8.1</A> <A HREF="slshfun-8.html#ss8.1">list_sort</A>
+<LI><A NAME="toc8.2">8.2</A> <A HREF="slshfun-8.html#ss8.2">heap_new</A>
+</UL>
+
+<H2><A NAME="toc9">9.</A> <A HREF="slshfun-9.html">Subprocess Functions</A></H2>
+
+<UL>
+<LI><A NAME="toc9.1">9.1</A> <A HREF="slshfun-9.html#ss9.1">new_process</A>
+</UL>
+
+<H2><A NAME="toc10">10.</A> <A HREF="slshfun-10.html">Profiling Functions</A></H2>
+
+<UL>
+<LI><A NAME="toc10.1">10.1</A> <A HREF="slshfun-10.html#ss10.1">profile_on</A>
+<LI><A NAME="toc10.2">10.2</A> <A HREF="slshfun-10.html#ss10.2">profile_off</A>
+<LI><A NAME="toc10.3">10.3</A> <A HREF="slshfun-10.html#ss10.3">profile_begin</A>
+<LI><A NAME="toc10.4">10.4</A> <A HREF="slshfun-10.html#ss10.4">profile_end</A>
+<LI><A NAME="toc10.5">10.5</A> <A HREF="slshfun-10.html#ss10.5">profile_calibrate</A>
+<LI><A NAME="toc10.6">10.6</A> <A HREF="slshfun-10.html#ss10.6">profile_report</A>
+</UL>
+
+<H2><A NAME="toc11">11.</A> <A HREF="slshfun-11.html">Set Functions</A></H2>
+
+<UL>
+<LI><A NAME="toc11.1">11.1</A> <A HREF="slshfun-11.html#ss11.1">complement</A>
+<LI><A NAME="toc11.2">11.2</A> <A HREF="slshfun-11.html#ss11.2">intersection</A>
+<LI><A NAME="toc11.3">11.3</A> <A HREF="slshfun-11.html#ss11.3">ismember</A>
+<LI><A NAME="toc11.4">11.4</A> <A HREF="slshfun-11.html#ss11.4">union</A>
+<LI><A NAME="toc11.5">11.5</A> <A HREF="slshfun-11.html#ss11.5">unique</A>
+</UL>
+
+<H2><A NAME="toc12">12.</A> <A HREF="slshfun-12.html">Miscellaneous Functions</A></H2>
+
+<UL>
+<LI><A NAME="toc12.1">12.1</A> <A HREF="slshfun-12.html#ss12.1">print</A>
+<LI><A NAME="toc12.2">12.2</A> <A HREF="slshfun-12.html#ss12.2">print_set_pager</A>
+<LI><A NAME="toc12.3">12.3</A> <A HREF="slshfun-12.html#ss12.3">print_set_pager_lines</A>
+</UL>
+
+<H2><A NAME="toc13">13.</A> <A HREF="slshfun-13.html">SLSH intrinsic functions</A></H2>
+
+<UL>
+<LI><A NAME="toc13.1">13.1</A> <A HREF="slshfun-13.html#ss13.1">slsh_readline_init</A>
+<LI><A NAME="toc13.2">13.2</A> <A HREF="slshfun-13.html#ss13.2">slsh_readline_new</A>
+<LI><A NAME="toc13.3">13.3</A> <A HREF="slshfun-13.html#ss13.3">slsh_readline</A>
+<LI><A NAME="toc13.4">13.4</A> <A HREF="slshfun-13.html#ss13.4">slsh_readline_noecho</A>
+<LI><A NAME="toc13.5">13.5</A> <A HREF="slshfun-13.html#ss13.5">slsh_set_readline_update_hook</A>
+<LI><A NAME="toc13.6">13.6</A> <A HREF="slshfun-13.html#ss13.6">slsh_set_update_preread_cb</A>
+<LI><A NAME="toc13.7">13.7</A> <A HREF="slshfun-13.html#ss13.7">slsh_set_update_postread_cb</A>
+<LI><A NAME="toc13.8">13.8</A> <A HREF="slshfun-13.html#ss13.8">slsh_set_update_width_cb</A>
+</UL>
+<HR>
+<A HREF="slshfun-1.html">Next</A>
+Previous
+Contents
+</BODY>
+</HTML>

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/man Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/man/slsh.1 Added

@@ -0,0 +1,299 @@
+.\" This manpage has been automatically generated by docbook2man 
+.\" from a DocBook document. This tool can be found at:
+.\" <http://shell.ipoline.com/~elmert/comp/docbook2X/> 
+.\" Please send any bug reports, improvements, comments, patches, 
+.\" etc. to Steve Cheng <steve@ggi-project.org>.
+.TH "SLSH" "1" "04 March 2018" "" ""
+
+.SH NAME
+slsh \- Interpreter for S-Lang scripts
+.SH SYNOPSIS
+
+\fBslsh\fR \fB--help\fR \fB--version\fR \fB-g\fR \fB-n\fR \fB--init \fIfile\fB\fR \fB--no-readline\fR \fB-e \fIstring\fB\fR \fB-i\fR \fB-q, --quiet\fR \fB-t\fR \fB-v\fR \fB-|\fIscript-file args...\fB\fR 
+
+.SH "DESCRIPTION"
+.PP
+\fBslsh\fR is a simple program for interpreting S-Lang scripts. It
+supports dynamic loading of S-Lang modules and includes a readline
+interface for interactive use.
+.SH "OPTIONS"
+.TP
+\fB--help\fR
+Show a summary of options
+.TP
+\fB--version\fR
+Show \fBslsh\fR version information
+.TP
+\fB-g\fR
+Compile with debugging code, tracebacks, etc
+.TP
+\fB-n\fR
+Don't load the personal initialization file
+.TP
+\fB--init \fIfile\fB\fR
+Use this file instead of ~/.slshrc
+.TP
+\fB--no-readline\fR
+Do not use a readline interface for the interactive mode
+.TP
+\fB-e \fIstring\fB\fR
+Execute ``string'' as S-Lang code.
+.TP
+\fB-i\fR
+Force interactive mode. Normally \fBslsh\fR will go into
+interactive mode if both stdin and stdout are attached to a
+terminal.
+.TP
+\fB-q, --quiet\fR
+Startup quietly by not printing the version and copyright
+information.
+.TP
+\fB-t\fR
+Normally, \fBslsh\fR will call slsh_main if it is defined. This
+option prevents that from happening making it useful for
+checking for syntax error.
+.TP
+\fB-v\fR
+Show verbose loading messages. This is useful for seeing what
+files are being loaded.
+.SH "INITIALIZATION"
+.PP
+Upon startup, the program will try to load \fIslsh.rc\fR as
+follows. If either SLSH_CONF_DIR or
+SLSH_LIB_DIR environment variables exist, then \fBslsh\fR will
+look look in the corresponding directories for \fIslsh.rc\fR\&.
+Otherwise it will look in:
+
+\fI$(prefix)/etc/\fR (as specified in the Makefile)
+
+\fI/usr/local/etc/\fR
+
+\fI/usr/local/etc/slsh/\fR
+
+\fI/etc/\fR
+
+\fI/etc/slsh/\fR
+.PP
+The \fIslsh.rc\fR file may load other files from slsh's library
+directory in the manner described below.
+.PP
+Once \fIslsh.rc\fR has been loaded, \fBslsh\fR will load
+$HOME/.slshrc if present. Finally, it will load the
+script specified on the command line. If the name of the script is
+-, then it will be read from stdin. If the script name is
+not present, or a string to execute was not specified using the -e
+option, then \fBslsh\fR will go into interactive mode and read input from
+the terminal. If the script is present and defines a function
+called slsh_main, that function will be called.
+.SH "LOADING FILES"
+.PP
+When a script loads a file via the built-in evalfile function
+or the require function (autoloaded by slsh.rc), the file is
+searched for along the SLSH_PATH as specified in the Makefile. An
+alternate path may be specified by the SLSH_PATH environment
+variable.
+.PP
+The search path may be queried and set during run time via the
+get_slang_load_path and set_slang_load_path functions, e.g.,
+
+.nf
+ set_slang_load_path ("/home/bill/lib/slsh:/usr/share/slsh");
+.fi
+.SH "INTERACTIVE MODE"
+.PP
+When \fBslsh\fR is invoked without a script or is given the \fB-i\fR
+command line argument, it will go into into interactive mode. In
+this mode, the user will be prompted for input. The program will
+leave this mode and exit if it sees an EOF (Ctrl-D) or the user
+exits by issuing the quit command.
+.PP
+If an uncaught exception occurs during execution of a command, the
+error message will be shown and the user will be prompted for more
+input.
+.PP
+Any objects left on the stack after a command will be printed and
+the stack cleared. This makes interactive mode useful as a
+calculator, e.g.,
+
+.nf
+ slsh> 3*10;
+ 30
+ slsh> x = 1:20;
+ slsh> sum (sin(x)-cos(x));
+ 0.458613
+ slsh> quit;
+.fi
+Note that in this mode, variables are automatically declared.
+.PP
+The interactive mode also supports command logging. Logging is
+enabled by the start_log function. The stop_log
+function will turn off logging. The default file where logging
+information will be written is \fIslsh.log\fR\&. An alternative
+may be specified as an optional argument to the start_log
+function:
+
+.nf
+ slsh> start_log;
+ Logging input to slsh.log
+ \&.
+ \&.
+ slsh> stop_log;
+ slsh> start_log("foo.log");
+ Logging input to foo.log
+ \&.
+ \&.
+ slsh> stop_log;
+ slsh> start_log;
+ Logging input to foo.log
+.fi
+.PP
+Similarly, the save_input function may be used to save the
+previous input to a specified file:
+
+.nf
+ slsh> save_input;
+ Input saved to slsh.log
+ slsh> save_input ("foo.log");
+ Input saved to foo.log
+.fi
+.PP
+As the above examples indicate, lines must end in a semicolon. This
+is a basic feature of the language and permits commands to span
+multiple lines, e.g.,
+
+.nf
+ slsh> x = 
+ 1,2,3,
+ 4,5,6;
+ slsh> sum(x);
+.fi
+For convenience some users prefer that commands be automatically
+terminated with a semicolon. To have a semicolon silently appended
+to the end of an input line, put the following in
+\fI$HOME/.slshrc\fR file:
+
+.nf
+ #ifdef __INTERACTIVE__
+ slsh_append_semicolon (1);
+ #endif
+.fi
+.PP
+The interactive mode also supports shell escapes. To pass a command
+to the shell, prefix it with !, e.g.,
+
+.nf
+ slsh> !pwd
+ /grandpa/d1/src/slang2/slsh
+ slsh> !cd doc/tm
+ slsh> !pwd
+ /grandpa/d1/src/slang2/slsh/doc/tm
+.fi
+.PP
+Finally, the interactive mode supports a help and
+apropos function:
+
+.nf
+ slsh> apropos list
+ apropos list ==>
+ List_Type
+ list_append
+ list_delete
+ \&.
+ \&.
+ slsh> help list_append
+ list_append
+
+ SYNOPSIS
+ Append an object to a list
+
+ USAGE
+ list_append (List_Type, object, Int_Type nth)
+ \&.
+ \&.
+.fi
+For convenience, the help and apropos functions
+do not require the syntactic constraints of the other functions.
+.SH "READLINE HISTORY MECHANISM"
+.PP
+By default, \fBslsh\fR is built to use the S-Lang readline interface,
+which includes a customizable command completion and a history mechanism.
+When \fBslsh\fR (or any S-Lang application that makes use of this
+feature) starts in interactive mode, it will look for a file in the
+user's home directory called \fI\&.slrlinerc\fR and load it if
+present. This file allows the user to customize the readline
+interface and enable the history to be saved between sessions. As
+an example, here is a version of the author's
+\fI\&.slrlinerc\fR file:
+
+.nf
+ % Load some basic functions that implement the history mechanism
+ () = evalfile ("rline/slrline.rc");
+ % The name of the history file -- expands to .slsh_hist for slsh
+ RLine_History_File = "$HOME/.${name}_hist";
+
+ % Some addition keybindings. Some of these functions are defined
+ % in rline/editfuns.sl, loaded by rline/slrline.rc
+ rline_unsetkey ("^K");
+ rline_setkey ("bol", "^B");
+ rline_setkey ("eol", "^E");
+ rline_setkey (&rline_kill_eol, "^L");
+ rline_setkey (&rline_set_mark, "^K^B");
+ rline_setkey (&rline_copy_region, "^Kk");
+ rline_setkey (&rline_kill_region, "^K^V");
+ rline_setkey (&rline_yank, "^K^P");
+ rline_setkey ("redraw", "^R");
+
+ #ifexists rline_up_hist_search
+ % Map the up/down arrow to the history search mechanism
+ rline_setkey (&rline_up_hist_search, "\\eA");
+ rline_setkey (&rline_down_hist_search, "\\eB");
+ #endif
+
+ #ifexists rline_edit_history
+ rline_setkey (&rline_edit_history, "^Kj");
+ #endif
+
+ % Add a new function
+ private define double_line ()
+ {
+ variable p = rline_get_point ();
+ variable line = rline_get_line ();
+ rline_eol ();
+ variable pend = rline_get_point ();
+ rline_ins (line);
+ rline_set_point (pend + p);
+ }
+ rline_setkey (&double_line, "^K^L");
+.fi
+.SH "MISCELLANEOUS SCRIPTS"
+.PP
+Several useful example scripts are located in
+\fI$prefix/share/slsh/scripts/\fR, where $prefix represents the
+\fBslsh\fR installation prefix (\fI/usr\fR,
+\fI/usr/local\fR,...). These scripts include:
+.TP
+\fBsldb\fR
+A script that runs the S-Lang debugger. 
+.TP
+\fBjpegsize\fR
+Reports the size of a jpeg file. 
+.TP
+\fBsvnsh\fR
+A shell for browsing an SVN repository. 
+.SH "AUTHOR"
+.PP
+The principal author of \fBslsh\fR is John E. Davis <www.jedsoft.org>\&.
+The interactive mode was provided by Mike Noble. The S-Lang library
+upon which \fBslsh\fR is based is primarily the work of John E. Davis
+with help from many others.
+.PP
+This manual page was originally written by Rafael Laboissiere for
+the Debian system (but may be used by others).
+.PP
+Permission is granted to copy, distribute and/or modify
+this document under the terms of the GNU General Public License,
+Version 2 any later version published by the Free Software
+Foundation.
+.PP
+On Debian systems, the complete text of the GNU General Public
+License can be found in \fI/usr/share/common-licenses/GPL\fR

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/tm Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/tm/Makefile Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/tm/local.tm Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/tm/slsh.tm Added

@@ -0,0 +1,323 @@
+#i docbook_man.tm
+
+#d arg#1 <arg>$1</arg>\__newline__
+
+#d slsh \command{slsh}
+#d sldb \command{sldb}
+#d slang \literal{S-Lang}
+#d ifun#1 \literal{$1}
+#d sfun#1 \literal{$1}
+
+\manpage{slsh}{1}{Interpreter for S-Lang scripts}
+\mansynopsis{slsh}{
+ \arg{\option{--help}}
+ \arg{\option{--version}}
+ \arg{\option{-g}}
+ \arg{\option{-n}}
+ \arg{\option{--init}{file}}
+ \arg{\option{--no-readline}}
+ \arg{\option{-e}{string}}
+ \arg{\option{-i}}
+ \arg{\option{-q, --quiet}}
+ \arg{\option{-t}}
+ \arg{\option{-v}}
+ \arg{\option{-|\replaceable{script-file args...}}}
+}
+
+\refsect1{DESCRIPTION}
+ \p
+ \slsh is a simple program for interpreting \slang scripts. It
+ supports dynamic loading of \slang modules and includes a readline
+ interface for interactive use.
+ \p-end
+
+\refsect1-end
+
+#d man_options_entry#2 \varlistentry{\term{$1}}{\p $2 \p-end}\__newline__
+
+\refsect1{OPTIONS}
+ \variablelist
+ \man_options_entry{\option{--help}}{
+ Show a summary of options
+ }
+ \man_options_entry{\option{--version}}{
+ Show \slsh version information
+ }
+ \man_options_entry{\option{-g}}{
+ Compile with debugging code, tracebacks, etc
+ }
+ \man_options_entry{\option{-n}}{
+ Don't load the personal initialization file
+ }
+ \man_options_entry{\option{--init}{file}}{
+ Use this file instead of ~/.slshrc
+ }
+ \man_options_entry{\option{--no-readline}}{
+ Do not use a readline interface for the interactive mode
+ }
+ \man_options_entry{\option{-e}{string}}{
+ Execute ``string'' as \slang code.
+ }
+ \man_options_entry{\option{-i}}{
+ Force interactive mode. Normally \slsh will go into
+ interactive mode if both stdin and stdout are attached to a
+ terminal.
+ }
+ \man_options_entry{\option{-q, --quiet}}{
+ Startup quietly by not printing the version and copyright
+ information.
+ }
+ \man_options_entry{\option{-t}}{
+ Normally, \slsh will call \sfun{slsh_main} if it is defined. This
+ option prevents that from happening making it useful for
+ checking for syntax error.
+ }
+ \man_options_entry{\option{-v}}{
+ Show verbose loading messages. This is useful for seeing what
+ files are being loaded.
+ }
+ \variablelist-end
+\refsect1-end
+
+\refsect1{INITIALIZATION}
+\p
+ Upon startup, the program will try to load \filename{slsh.rc} as
+ follows. If either \literal{SLSH_CONF_DIR} or
+ \literal{SLSH_LIB_DIR} environment variables exist, then \slsh will
+ look look in the corresponding directories for \filename{slsh.rc}.
+ Otherwise it will look in:
+\simplelist
+ \member{\filename{$(prefix)/etc/} (as specified in the Makefile)}
+ \member{\filename{/usr/local/etc/}}
+ \member{\filename{/usr/local/etc/slsh/}}
+ \member{\filename{/etc/}}
+ \member{\filename{/etc/slsh/}}
+\simplelist-end
+\pp
+ The \filename{slsh.rc} file may load other files from slsh's library
+ directory in the manner described below.
+\pp
+ Once \filename{slsh.rc} has been loaded, \slsh will load
+ \literal{$HOME/.slshrc} if present. Finally, it will load the
+ script specified on the command line. If the name of the script is
+ \literal{-}, then it will be read from stdin. If the script name is
+ not present, or a string to execute was not specified using the -e
+ option, then \slsh will go into interactive mode and read input from
+ the terminal. If the script is present and defines a function
+ called \sfun{slsh_main}, that function will be called.
+\p-end
+\refsect1-end
+
+\refsect1{LOADING FILES}
+\p
+ When a script loads a file via the built-in \ifun{evalfile} function
+ or the \sfun{require} function (autoloaded by slsh.rc), the file is
+ searched for along the \literal{SLSH_PATH} as specified in the Makefile. An
+ alternate path may be specified by the \literal{SLSH_PATH} environment
+ variable.
+\pp
+ The search path may be queried and set during run time via the
+ \sfun{get_slang_load_path} and \sfun{set_slang_load_path} functions, e.g.,
+#v+
+ set_slang_load_path ("/home/bill/lib/slsh:/usr/share/slsh");
+#v-
+\p-end
+\refsect1-end
+
+\refsect1{INTERACTIVE MODE}
+\p
+ When \slsh is invoked without a script or is given the \option{-i}
+ command line argument, it will go into into interactive mode. In
+ this mode, the user will be prompted for input. The program will
+ leave this mode and exit if it sees an EOF (Ctrl-D) or the user
+ exits by issuing the \literal{quit} command.
+\pp
+ If an uncaught exception occurs during execution of a command, the
+ error message will be shown and the user will be prompted for more
+ input.
+\pp
+ Any objects left on the stack after a command will be printed and
+ the stack cleared. This makes interactive mode useful as a
+ calculator, e.g.,
+#v+
+ slsh> 3*10;
+ 30
+ slsh> x = 1:20;
+ slsh> sum (sin(x)-cos(x));
+ 0.458613
+ slsh> quit;
+#v-
+ Note that in this mode, variables are automatically declared.
+\pp
+ The interactive mode also supports command logging. Logging is
+ enabled by the \literal{start_log} function. The \literal{stop_log}
+ function will turn off logging. The default file where logging
+ information will be written is \filename{slsh.log}. An alternative
+ may be specified as an optional argument to the \literal{start_log}
+ function:
+#v+
+ slsh> start_log;
+ Logging input to slsh.log
+ .
+ .
+ slsh> stop_log;
+ slsh> start_log("foo.log");
+ Logging input to foo.log
+ .
+ .
+ slsh> stop_log;
+ slsh> start_log;
+ Logging input to foo.log
+#v-
+\pp
+ Similarly, the \literal{save_input} function may be used to save the
+ previous input to a specified file:
+#v+
+ slsh> save_input;
+ Input saved to slsh.log
+ slsh> save_input ("foo.log");
+ Input saved to foo.log
+#v-
+\pp
+ As the above examples indicate, lines must end in a semicolon. This
+ is a basic feature of the language and permits commands to span
+ multiple lines, e.g.,
+#v+
+ slsh> x = 
+ 1,2,3,
+ 4,5,6;
+ slsh> sum(x);
+#v-
+ For convenience some users prefer that commands be automatically
+ terminated with a semicolon. To have a semicolon silently appended
+ to the end of an input line, put the following in
+ \filename{$HOME/.slshrc} file:
+#v+
+ #ifdef __INTERACTIVE__
+ slsh_append_semicolon (1);
+ #endif
+#v-
+\pp
+ The interactive mode also supports shell escapes. To pass a command
+ to the shell, prefix it with \literal{!}, e.g.,
+#v+
+ slsh> !pwd
+ /grandpa/d1/src/slang2/slsh
+ slsh> !cd doc/tm
+ slsh> !pwd
+ /grandpa/d1/src/slang2/slsh/doc/tm
+#v-
+\pp
+ Finally, the interactive mode supports a \literal{help} and
+ \literal{apropos} function:
+#v+
+ slsh> apropos list
+ apropos list ==>
+ List_Type
+ list_append
+ list_delete
+ .
+ .
+ slsh> help list_append
+ list_append
+
+ SYNOPSIS
+ Append an object to a list
+
+ USAGE
+ list_append (List_Type, object, Int_Type nth)
+ .
+ .
+#v-
+ For convenience, the \literal{help} and \literal{apropos} functions
+ do not require the syntactic constraints of the other functions.
+\p-end
+\refsect1-end
+
+\refsect1{READLINE HISTORY MECHANISM}
+\p
+ By default, \slsh is built to use the \slang readline interface,
+ which includes a customizable command completion and a history mechanism.
+ When \slsh (or any \slang application that makes use of this
+ feature) starts in interactive mode, it will look for a file in the
+ user's home directory called \filename{.slrlinerc} and load it if
+ present. This file allows the user to customize the readline
+ interface and enable the history to be saved between sessions. As
+ an example, here is a version of the author's
+ \filename{.slrlinerc} file:
+#v+
+ % Load some basic functions that implement the history mechanism
+ () = evalfile ("rline/slrline.rc");
+ % The name of the history file -- expands to .slsh_hist for slsh
+ RLine_History_File = "$HOME/.${name}_hist";
+
+ % Some addition keybindings. Some of these functions are defined
+ % in rline/editfuns.sl, loaded by rline/slrline.rc
+ rline_unsetkey ("^K");
+ rline_setkey ("bol", "^B");
+ rline_setkey ("eol", "^E");
+ rline_setkey (&rline_kill_eol, "^L");
+ rline_setkey (&rline_set_mark, "^K^B");
+ rline_setkey (&rline_copy_region, "^Kk");
+ rline_setkey (&rline_kill_region, "^K^V");
+ rline_setkey (&rline_yank, "^K^P");
+ rline_setkey ("redraw", "^R");
+
+ #ifexists rline_up_hist_search
+ % Map the up/down arrow to the history search mechanism
+ rline_setkey (&rline_up_hist_search, "\eA");
+ rline_setkey (&rline_down_hist_search, "\eB");
+ #endif
+
+ #ifexists rline_edit_history
+ rline_setkey (&rline_edit_history, "^Kj");
+ #endif
+
+ % Add a new function
+ private define double_line ()
+ {
+ variable p = rline_get_point ();
+ variable line = rline_get_line ();
+ rline_eol ();
+ variable pend = rline_get_point ();
+ rline_ins (line);
+ rline_set_point (pend + p);
+ }
+ rline_setkey (&double_line, "^K^L");
+#v-
+\p-end
+\refsect1-end
+
+\refsect1{MISCELLANEOUS SCRIPTS}
+\p
+ Several useful example scripts are located in
+ \filename{$prefix/share/slsh/scripts/}, where $prefix represents the
+ \slsh installation prefix (\filename{/usr},
+ \filename{/usr/local},...). These scripts include:
+\variablelist
+ \man_options_entry{\sldb}{A script that runs the \slang debugger.}
+ \man_options_entry{\command{jpegsize}}{Reports the size of a jpeg file.}
+ \man_options_entry{\command{svnsh}}{A shell for browsing an SVN repository.}
+\variablelist-end
+\p-end
+\refsect1{AUTHOR}
+\p
+ The principal author of \slsh is John E. Davis <www.jedsoft.org>.
+ The interactive mode was provided by Mike Noble. The \slang library
+ upon which \slsh is based is primarily the work of John E. Davis
+ with help from many others.
+\pp
+ This manual page was originally written by Rafael Laboissiere for
+ the Debian system (but may be used by others).
+\pp
+ Permission is granted to copy, distribute and/or modify
+ this document under the terms of the GNU General Public License,
+ Version 2 any later version published by the Free Software
+ Foundation.
+\pp
+ On Debian systems, the complete text of the GNU General Public
+ License can be found in \filename{/usr/share/common-licenses/GPL}
+\p-end
+\refsect1-end
+
+\manpage-end

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/tm/slshfun.tm Added

@@ -0,0 +1,142 @@
+#% -*- mode: tm; mode: fold; -*-
+#%{{{Macros
+
+#i linuxdoc.tm
+#i local.tm
+
+#d function#1 \sect{<bf>$1</bf>\label{$1}}<descrip>
+#d variable#1 \sect{<bf>$1</bf>\label{$1}}<descrip>
+#d datatype#1 \sect{<bf>$1</bf>\label{$1}}<descrip>
+
+#s+
+static define issubstr_function (str, sstr)
+{
+ vinsert ("%d", is_substr(str, sstr));
+}
+tm_add_macro ("issubstr", &issubstr_function, 2, 2);
+#s-
+
+#d synopsis#1 <tag> Synopsis </tag> $1
+#d keywords#1 <tag> Keywords </tag> $1
+#% avoid putting a tscreen env (generated by #v+...#v-) inside
+#% <tt></tt>, which the DTD does not permit.
+#d usage#1 <tag> Usage </tag> \
+ \if{\issubstr{$1}{\__newline__}}{$1}{<tt>$1</tt>}
+
+#d description <tag> Description </tag>
+#d qualifiers <tag> Qualifiers </tag>
+#d methods <tag> Methods </tag> <tt></tt>
+#d method#2 <tag> $1 </tag> $2
+#d example <tag> Example </tag>
+#d notes <tag> Notes </tag>
+#d seealso#1 <tag> See Also </tag> <tt>$1</tt>
+#d r#1 \ref{$1}{$1}
+#d done </descrip>
+#d -1 <tt>-1</tt>
+#d 0 <tt>0</tt>
+#d 1 <tt>1</tt>
+#d 2 <tt>2</tt>
+#d 3 <tt>3</tt>
+#d 4 <tt>4</tt>
+#d 5 <tt>5</tt>
+#d 6 <tt>6</tt>
+#d 7 <tt>7</tt>
+#d 8 <tt>8</tt>
+#d 9 <tt>9</tt>
+#d NULL <tt>NULL</tt>
+#d documentstyle book
+
+#%}}}
+
+\linuxdoc
+\begin{\documentstyle}
+
+\title SLSH Library Reference (version 2.3.0)
+\author John E. Davis <www.jedsoft.org>
+\date \__today__
+
+\toc
+
+\chapter{Introduction}
+
+#d doc_root_url http://www.jedsoft.org/slang/doc
+#d ifun_doc_url \doc_root_url/html/slangfun.html
+
+This document describes both the \slsh intrinsic functions and the
+\slsh library functions. The latter functions are written in \slang
+and make use of lower-level intrinsic functions that are described in
+the \href{\ifun_doc_url}{Intrinsic Function Reference Manual}.
+As the \slsh library functions make no use of \slsh intrinsics, they
+may be used by any conforming \slang application. The \slsh intrinsic
+functions are specific to \slsh.
+
+Before a particular \slsh library function may be used, the file that
+defines the function must first be loaded. The recommended mechanism
+for loading a file is through the use of the
+\sfun{require} function, e.g.,
+#v+
+ require ("structfuns");
+#v-
+will make the functions defined in the file \file{structfuns.sl}
+available to the interpreter. The \sfun{require} function itself is
+defined in the file \file{require.sl}, which a conforming application
+will automatically load.
+
+\chapter{The \tt{require} Function}
+The functions in \file{require.sl} facilitate the loading of \slang
+code.
+#i ../../lib/tm/require.tm
+
+\chapter{Command Line Parsing Functions}
+These functions are defined in the \file{cmdopt.sl} file.
+#i ../../lib/tm/cmdopt.tm
+
+\chapter{Filename Globbing and Related Functions}
+The \sfun{glob} function is defined \file{glob.sl}. The
+\sfun{fswalk_new} may be used for more generic filesystem processing.
+It is defined in \file{fswalk.sl}.
+#i ../../lib/tm/glob.tm
+#i ../../lib/tm/fswalk.tm
+
+\chapter{Reading Text-formated Data Files}
+These functions are defined in \file{readascii.sl}. For comma or
+tab-delimited files, consider useing the CSV module.
+#i ../../lib/tm/readascii.tm
+
+\chapter{Structure Functions}
+These functions are defined in \file{structfuns.sl}.
+#i ../../lib/tm/structfuns.tm
+
+\chapter{Array Functions}
+\slang includes many intrinsic functions that operate on arrays. The
+additional functions described here are defined in
+\file{arrayfuns.sl}.
+
+#i ../../lib/tm/arrayfuns.tm
+
+\chapter{List Functions and List-based Data Structures}
+The file \file{arrayfuns.sl} includes functions for manipulating
+lists. It also includes some list-based data structures such as heaps.
+#i ../../lib/tm/listfuns.tm
+
+\chapter{Subprocess Functions}
+These functions in \file{process.sl} facilitate the creation of
+subprocesses and pipelines.
+#i ../../lib/tm/process.tm
+
+\chapter{Profiling Functions}
+These functions are used by \bf{slprof} for profiling \slsh
+applications.
+#i ../../lib/tm/profile.tm
+
+\chapter{Set Functions}
+These functions manipulate arrays and lists as sets.
+#i ../../lib/tm/setfuns.tm
+
+\chapter{Miscellaneous Functions}
+#i ../../lib/tm/print.tm
+
+\chapter{SLSH intrinsic functions}
+#i slshifun.tm
+
+\end{\documentstyle}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/doc/tm/slshifun.tm Added

@@ -0,0 +1,129 @@
+\function{slsh_readline_init}
+\synopsis{Initialize the S-Lang readline routines}
+\usage{slsh_readline_init (String_Type appname)}
+\description
+ The \ifun{slsh_readline_init} function is used to initialize the
+ \slang readline interface for use by an slsh-based application with
+ name \exmp{appname}.  If defines an intrinsic variable called
+ \ivar{__RL_APP__} whose value is given by \exmp{appname}.  If the
+ file \exmp{$HOME/.slrlinerc} file exists, it will be loaded into the
+ interpreter.  This file together with the \ivar{__RL_APP__} variable
+ may be used by the user to customize the interface by, e.g., reading
+ previous history files, etc.
+\seealso{slsh_readline_new, rline_set_history}
+\done
+
+\function{slsh_readline_new}
+\synopsis{Instantiate a readline object}
+\usage{RLine_Type slsh_readline_new (String_Type name)}
+\description
+ This function instantiates a new readline object with the specified
+ name and returns it.
+
+ If a function called \exmp{name}_rline_open_hook exists, it will be
+ called with no arguments.
+\seealso{slsh_readline_init}
+\done
+
+\function{slsh_readline}
+\synopsis{Get input from the user with command line editing}
+\usage{String_Type slsh_readline (RLine_Type r, String_Type prompt)}
+\description
+ The \ifun{slsh_readline} function utilizes the \slang readline
+ interface to read input from the terminal using the specified prompt.
+ If two parameters are given, the value of the first one must be a
+ \dtype{RLine_Type} object obtained previously from the
+ \ifun{slsh_readline_new} function.
+\seealso{slsh_readline_new, slsh_readline_init}
+\done
+
+\function{slsh_readline_noecho}
+\synopsis{Get input from the user with command line editing without echo}
+\usage{String_Type slsh_readline (RLine_Type r, String_Type prompt)}
+\description
+ This function is like \ifun{slsh_readline} except that the input is
+ not echoed to the display.  This makes it useful for reading
+ passwords, etc.
+\seealso{slsh_readline, slsh_readline_new, slsh_readline_init}
+\done
+
+
+\function{slsh_set_readline_update_hook}
+\synopsis{Specify an alternate display update function for a readline object}
+\usage{slsh_set_readline_update_hook(RLine_Type rl ,&func ,funcdata)}
+\description
+  This function may be used to implement an alternative update hook
+  for the specified readline object.  The hook must have one of the
+  following signatures, depending upon whether or not the optional
+  \exmp{funcdata} was given:
+#v+
+   define func (rl, prompt, editbuf, editpoint) {...}
+   define func (rl, prompt, editbuf, editpoint, funcdata) {...}
+#v-
+  The hook function is not expected to return anything.
+
+  If \ifun{slsh_set_readline_update_hook} is called with a single
+  argument, then any update hook associated with it will be set to the
+  default value.
+\seealso{slsh_readline_init, slsh_readline_new, slsh_readline}
+\done
+
+\function{slsh_set_update_preread_cb}
+\synopsis{Specify a function to be called prior to reading via readline}
+\usage{slsh_set_update_preread_cb (RLine_Type rl, Ref_Type func)}
+\description
+  This function may be used to specify a function to be called by
+  \ifun{slsh_readline} prior to the editing loop.  It must have one of
+  the following signatures:
+#v+
+    define func (rl) {...}
+    define func (rl, funcdata);
+#v-
+  The second form must be used if a \exmp{funcdata} argument was
+  passed to the \ifun{slsh_set_readline_update_hook} function.
+
+  If the \exmp{func} argument is \NULL, then the callback function
+  will be cleared.
+\seealso{slsh_set_readline_update_hook, slsh_set_update_postread_cb}
+\done
+
+\function{slsh_set_update_postread_cb}
+\synopsis{Specify a function to be called after reading via readline}
+\usage{slsh_set_update_postread_cb (RLine_Type rl ,Ref_Type func)}
+\description
+  This function may be used to specify a function to be called by
+  \ifun{slsh_readline} after to the editing loop before returning to
+  the caller.  It must have one of
+  the following signatures:
+#v+
+    define func (rl) {...}
+    define func (rl, funcdata);
+#v-
+  The second form must be used if a \exmp{funcdata} argument was
+  passed to the \ifun{slsh_set_readline_update_hook} function.
+
+  If the \exmp{func} argument is \NULL, then the callback function
+  will be cleared.
+\seealso{slsh_set_readline_update_hook, slsh_set_update_postread_cb}
+\done
+
+\function{slsh_set_update_width_cb}
+\synopsis{Specify a callback function to be called when the display width changes}
+\usage{slsh_set_update_width_cb (RLine_Type rl, Ref_Type func)}
+\description
+  This function is used to set a callback function that will get
+  called when the readline routines sense that the display width has
+  changed.  It must have one of the following signatures:
+#v+
+    define func (rl, width) {...}
+    define func (rl, width, funcdata);
+#v-
+  The second form must be used if a \exmp{funcdata} argument was
+  passed to the \ifun{slsh_set_readline_update_hook} function.  The
+  \exmp{width} argument to the callback function in an integer that
+  specifies the new width.
+
+  If the \exmp{func} argument is \NULL, then the callback function
+  will be cleared.
+\seealso{slsh_set_readline_update_hook, slsh_readline}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/etc Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/etc/slsh.rc Added

@@ -0,0 +1,74 @@
+% -*- slang -*-
+
+% This file gets loaded whenever slsh runs.  Its primary purpose is to define
+% some functions that are useful in scripts, and to set up some local paths
+
+private define dir_exists (dir)
+{
+   if (dir == NULL) return 0;
+   variable s = stat_file (dir);
+   if (s == NULL) return 0;
+   return stat_is ("dir", s.st_mode);
+}
+
+private define check_dirs (dirs)
+{
+   if (dirs == NULL)
+     return NULL;
+
+   variable new_dirs = String_Type0;
+   foreach (strchop (dirs, path_get_delimiter(), 0))
+     {
+	variable dir = ();
+	if (dir_exists (dir))
+	  new_dirs = new_dirs, dir;
+     }
+   if (length (new_dirs) == 0)
+     return NULL;
+   return strjoin (new_dirs, char (path_get_delimiter()));
+}
+
+%!%+
+%\function{prepend_to_slang_load_path}
+%\synopsis{Prepend a directory to the load-path}
+%\usage{prepend_to_slang_load_path (String_Type dir)}
+%\description
+% This function adds a directory to the beginning of the interpreter's
+% load-path.
+%\seealso{append_to_slang_load_path, set_slang_load_path}
+%!%-
+public define prepend_to_slang_load_path (p)
+{
+   p = check_dirs (p);
+   if (p != NULL)
+     set_slang_load_path (sprintf ("%s%c%s", p, path_get_delimiter (), get_slang_load_path ()));
+}
+
+%!%+
+%\function{append_to_slang_load_path}
+%\synopsis{Append a directory to the load-path}
+%\usage{append_to_slang_load_path (String_Type dir)}
+%\description
+% This function adds a directory to the end of the interpreter's
+% load-path.
+%\seealso{prepend_to_slang_load_path, set_slang_load_path}
+%!%-
+public define append_to_slang_load_path (p)
+{
+   p = check_dirs (p);
+   if (p != NULL)
+     set_slang_load_path (sprintf ("%s%c%s", get_slang_load_path (), path_get_delimiter (), p));
+}
+
+% This function gets called from slsh after loading this file
+public define __slsh_startup_hook ()
+{
+   () = evalfile ("autoload.sl");
+#ifdef __INTERACTIVE__
+   () = evalfile ("slshrl.sl");
+#endif
+}
+prepend_to_slang_load_path (getenv (SLSH_PATH_ENV));
+
+% Add local additions here
+

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/arrayfuns.sl Added

@@ -0,0 +1,84 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+define reverse (a)
+{
+#ifexists array_reverse
+ a = @a;
+ array_reverse (a);
+ return a;
+#else
+ variable i = length (a);
+ if (i <= 1)
+ return a;
+
+ i--;
+ __tmp(a)i:0:-1;
+#endif
+}
+
+define shift (x, n)
+{
+ variable len = length(x);
+ ifnot (len) return x;
+
+ % allow n to be negative and large
+ n = len + n mod len;
+ return xn:n+len-1 mod len;
+}
+
+% This routine rearranges an array according to a permutation. It
+% modifies the indices of the permutation array while running, but
+% preserves it upon return. This code is based upon
+% <http://gams.nist.gov/serve.cgi/ModuleComponent/11449/Source/ITL/DPPERM.f>.
+define rearrange (a, indices)
+{
+ variable i, j, n = length (indices);
+
+ if (__is_same (a, indices))
+ throw InvalidParmError, "The array to be rearranged must not be the same as the permutation.";
+
+ % Check the permutation and make it 1-based
+ _for i (0, n-1, 1)
+ {
+	j = indicesi;
+	if (j < 0) j = -(j+1);
+	if ((0 <= j < n)
+	 && (indicesj >= 0))
+	 indicesj = -indicesj-1;
+	else
+	 throw InvalidParmError, "Invalid permutation.";
+ }
+
+ _for i (0, n-1, 1)
+ {
+	if (indicesi >= 0)
+	 continue;
+
+	j = i;
+	variable j0 = j;
+	variable tmp = aj0;
+
+	variable indices_j = indicesj;
+	forever
+	 {
+	 j0 = j;
+	 j = -indices_j-1;	 % back to 0-based
+	 indicesj0 = j;
+	 indices_j = indicesj;
+	 if (indices_j >= 0)
+	 break;
+	 aj0 = aj;
+	 }
+	aj0 = tmp;
+ }
+}
+
+$1 = path_concat (path_dirname (__FILE__), "help/arrayfuns.hlp");
+if (NULL != stat_file ($1))
+ add_doc_file ($1);
+
+provide ("arrayfuns");

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/autoload.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/cmdopt.sl Added

@@ -0,0 +1,358 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+% Command-line option parsing.
+%
+% Examples:
+% (a,b,c values)
+% -i -ja3 -b 4 ==> -i -j -a 3 -b 4
+% -q 3 -sli --foo=3
+%
+private variable CMDOPT_REQ_VALUE =	0x1; % value required
+private variable CMDOPT_OPT_VALUE =	0x2; % value optional
+private variable CMDOPT_INC_VALUE =	0x4; % increment value by 1
+private variable CMDOPT_APPEND_VALUE =	0x8; % append to list
+private variable CMDOPT_BOR_VALUE = 0x10; % bitwise-or
+private variable CMDOPT_BAND_VALUE = 0x20; % bitwise-and
+
+private variable CmdOpt_Type = struct
+{
+ names, flags, convert_method, valuep, bor_value, band_value, default_value, callback_args
+};
+
+private define usage_error (opts, name, str)
+{
+ variable msg = sprintf ("Option %s: %s", name, str);
+ if (opts.usage_error != NULL)
+ (@opts.usage_error) (msg);
+ throw UsageError, msg;
+}
+
+private define convert_to_string (opts, opt, name, value)
+{
+ return value;
+}
+
+private define convert_to_int (opts, opt, name, value)
+{
+ try
+ {
+	if (1 != __is_datatype_numeric (_slang_guess_type (value)))
+	 throw SyntaxError;
+
+	return integer (value);
+ }
+ catch SyntaxError: usage_error (opts, name, "error parsing '$value' as an integer"$);
+}
+
+private define convert_to_double (opts, opt, name, value)
+{
+ try
+ {
+	if (0 == __is_datatype_numeric (_slang_guess_type (value)))
+	 throw SyntaxError;
+
+	return atof (value);
+ }
+ catch SyntaxError: usage_error (opts, name, "error parsing value '$value' as a number"$);
+}
+
+define cmdopt_add ()
+{
+ variable opts, name, valuep;
+ variable s = @CmdOpt_Type;
+ s.callback_args = __pop_args (_NARGS-3);
+ (opts, name, valuep) = ();
+
+ s.flags = 0;
+ if (qualifier_exists ("append")) s.flags |= CMDOPT_APPEND_VALUE;
+ if (qualifier_exists ("inc")) s.flags |= CMDOPT_INC_VALUE;
+
+ variable type = qualifier ("type");
+ switch (type)
+ {
+ case "string" or case "str":
+	s.convert_method = &convert_to_string;
+ }
+ {
+ case "int":
+	s.convert_method = &convert_to_int;
+ }
+ {
+ case "float" or case "double":
+	s.convert_method = &convert_to_double;
+ }
+ {
+ case NULL:
+	s.convert_method = &convert_to_string;
+ }
+ {
+	throw InvalidParmError, sprintf ("type=%s is not supported", type);
+ }
+
+ variable default_value = 1;
+ if (qualifier_exists ("optional"))
+ {
+	if (type == NULL)
+	 throw InvalidParmError, sprintf ("option %s requires the 'type' qualifier", name);
+
+	s.flags |= CMDOPT_OPT_VALUE;
+	default_value = qualifier ("optional");
+ }
+ else if (type != NULL)
+ s.flags |= CMDOPT_REQ_VALUE;
+
+ if (qualifier_exists ("bor"))
+ {
+	s.bor_value = qualifier ("bor");
+	s.flags |= CMDOPT_BOR_VALUE;
+ }
+ if (qualifier_exists ("band"))
+ {
+	s.band_value = qualifier ("band");
+	s.flags |= CMDOPT_BAND_VALUE;
+ }
+
+ s.names = strchop (name, '|', 0);
+ s.valuep = valuep;
+ s.default_value = qualifier ("default", default_value);
+
+ list_append (opts.opt_list, s);
+}
+
+private define set_opt_value (opt, value)
+{
+ variable opt_value;
+ ifnot (opt.flags & CMDOPT_APPEND_VALUE)
+ {
+	@opt.valuep = value;
+	return;
+ }
+ if ((0 == __is_initialized (opt.valuep))
+ || (@opt.valuep == NULL))
+ @opt.valuep = {};
+
+ if (typeof (@opt.valuep) != List_Type)
+ {
+	@opt.valuep = {@opt.valuep};
+ }
+ list_append (@opt.valuep, value);
+}
+
+private define process_value (opts, opt, name, value)
+{
+ set_opt_value (opt, (@opt.convert_method) (opts, opt, name, value));
+}
+
+private define process_option (opts, opt, name, value)
+{
+ if (opt.flags & CMDOPT_REQ_VALUE)
+ {
+	if (value == NULL)
+	 usage_error (opts, name, "value required");
+
+	if (__is_callable (opt.valuep))
+	 {
+	 value = (@opt.convert_method) (opts, opt, name, value);
+	 (@opt.valuep)(value, __push_args(opt.callback_args));
+	 return;
+	 }
+	process_value (opts, opt, name, value);
+	return;
+ }
+
+ if (opt.flags & CMDOPT_OPT_VALUE)
+ {
+	if (__is_callable (opt.valuep))
+	 {
+	 if (value != NULL)
+	 value = (@opt.convert_method) (opts, opt, name, value);
+
+	 (@opt.valuep)(value, __push_args(opt.callback_args));
+	 return;
+	 }
+	if (value != NULL)
+	 {
+	 process_value (opts, opt, name, value);
+	 return;
+	 }
+	set_opt_value (opt, opt.default_value);
+	return;
+ }
+
+ if (value != NULL)
+ usage_error (opts, name, "value not supported");
+
+ if (__is_callable (opt.valuep))
+ {
+	(@opt.valuep)(__push_args(opt.callback_args));
+	return;
+ }
+
+ if (opt.flags & CMDOPT_INC_VALUE)
+ {
+	@opt.valuep += 1;
+	return;
+ }
+
+ ifnot (opt.flags & (CMDOPT_BAND_VALUE|CMDOPT_BOR_VALUE))
+ {
+	set_opt_value (opt, opt.default_value);
+	return;
+ }
+
+ if (opt.flags & CMDOPT_BAND_VALUE)
+ @opt.valuep &= opt.band_value;
+
+ if (opt.flags & CMDOPT_BOR_VALUE)
+ @opt.valuep |= opt.bor_value;
+
+}
+
+private define find_opt (opts, name)
+{
+ foreach (opts.opt_list)
+ {
+	variable opt = ();
+	if (any (opt.names == name))
+	 return opt;
+ }
+ usage_error (opts, name, "not supported/unknown");
+}
+
+private define find_short_opt (opts, name)
+{
+ return find_opt (opts, name);
+}
+
+private define find_long_opt (opts, name)
+{
+ return find_opt (opts, name);
+}
+
+private define process_short_args (opts, letters)
+{
+ variable i = 0, n = strlen (letters);
+ while (i < n)
+ {
+	i++;
+	variable name = substr (letters, i, 1);
+	variable opt = find_short_opt (opts, name);
+	variable value = NULL;
+	if (opt.flags & CMDOPT_REQ_VALUE)
+	 {
+	 if (i < n)
+	 value = substr (letters, i+1, n);
+	 i = n;
+	 }
+	process_option (opts, opt, name, NULL);
+ }
+}
+
+private define parse_arg (arg)
+{
+ variable pos = is_substr (arg, "=");
+ if (pos == 0)
+ return (arg, NULL);
+ variable value = substr (arg, pos+1, -1);
+ arg = substr (arg, 1, pos-1);
+
+ return arg, value;
+}
+
+define cmdopt_process (opts, argv, istart)
+{
+ variable iend = length (argv);
+ variable i = istart;
+ while (i < iend)
+ {
+	variable arg = argvi;
+	variable opt, value;
+
+	if (arg == "--")
+	 return i+1;
+
+	if (arg0 != '-')
+	 return i;
+
+	if (arg == "-")
+	 return i;
+
+	if (arg1 == '-')
+	 {
+	 % --long-opt
+	 (arg, value) = parse_arg (arg);
+	 arg = substr(arg, 3, -1);
+	 opt = find_long_opt (opts, arg);
+	 }
+	else
+	 {
+	 % short arg: -a -ab -abc value
+	 % -abc value is equiv to -ab -c value
+	 arg = substr (arg, 2, -1);
+	 value = NULL;
+	 variable j = 0, n = strlen(arg);
+	 while (j < n)
+	 {
+		 j++;
+		 variable name = substr (arg, j, 1);
+		 opt = find_short_opt (opts, name);
+		 if (opt.flags & CMDOPT_REQ_VALUE)
+		 {
+		 if (j < n)
+			 value = substr (arg, j+1, n);
+		 arg = name;
+		 break;
+		 }
+		 % -aVALUE
+		 if ((j < n) && (opt.flags & CMDOPT_OPT_VALUE))
+		 {
+		 value = substr (arg, j+1, n);
+		 arg = name;
+		 break;
+		 }
+		 process_option (opts, opt, name, NULL);
+	 }
+	 then
+	 {
+		 i++;
+		 continue;
+	 }
+	 }
+
+	if (opt == NULL)
+	 return -1;
+
+	if ((opt.flags & CMDOPT_REQ_VALUE) && (value == NULL))
+	 {
+	 i++;
+	 if (i == iend)
+	 usage_error (opts, opt, "value expected");
+	 value = argvi;
+	 }
+
+	process_option (opts, opt, arg, value);
+	i++;
+ }
+
+ return i;
+}
+
+define cmdopt_new ()
+{
+ variable error_routine = NULL;
+ if (_NARGS == 1)
+ error_routine = ();
+
+ variable s = struct
+ {
+	usage_error = error_routine,
+	opt_list = {},
+	add = &cmdopt_add,
+	process = &cmdopt_process
+ };
+ return s;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/fswalk.sl Added

@@ -0,0 +1,92 @@
+% Functions to walk the file system
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+
+private define process_dir (w, dir, dir_st);
+private define process_dir (w, dir, dir_st)
+{
+ variable status;
+ if (w.dir_method != NULL)
+ {
+	status = (@w.dir_method) (dir, dir_st, __push_list (w.dir_method_args));
+	if (status <= 0)
+	 return status;
+ }
+
+ foreach (listdir (dir))
+ {
+	variable file = ();
+	file = path_concat (dir, file);
+	variable st = (@w.stat_func)(file);
+	if (st == NULL)
+	 {
+	 () = fprintf (stderr, "Unable to stat %s: %s\n", file, errno_string (errno));
+	 continue;
+	 }
+	if (stat_is ("dir", st.st_mode))
+	 {
+	 status = process_dir (w, file, dir_st);
+	 if (status < 0)
+	 return status;
+
+	 continue;
+	 }
+
+	if (w.file_method == NULL)
+	 continue;
+	status = (@w.file_method) (file, st, __push_list(w.file_method_args));
+	if (status <= 0)
+	 return status;
+ }
+ return 1;
+}
+
+private define fswalk (w, start)
+{
+ variable st = (@w.stat_func)(start);
+ ifnot (stat_is ("dir", st.st_mode))
+ {
+	throw InvalidParmError, "fs_walk: $start is not a directory"$;
+ }
+ () = process_dir (w, start, st);
+}
+
+define fswalk_new ()
+{
+ if (_NARGS != 2)
+ usage ("\
+w = fswalk_new (dirfunc, filefunc ; qualifiers);\n\
+w.walk (topdir);\n\
+\n\
+Qualifiers:\n\
+ dargs={args,...} Additional arguments to be passed to dirfunc\n\
+ fargs={args,...} Additional arguments to be passed to dirfunc\n\
+ followlinks=0|1 Indicates whethe or not symbolic links will be followed\n\
+");
+
+ variable dir_method, file_method;
+ (dir_method, file_method) = ();
+
+ variable dir_method_args = qualifier ("dargs", {});
+ variable file_method_args = qualifier ("fargs", {});
+ if (typeof (dir_method_args) != List_Type)
+ dir_method_args = {dir_method_args};
+ if (typeof (file_method_args) != List_Type)
+ file_method_args = {file_method_args};
+ variable followlinks
+ = (qualifier_exists ("followlinks") && (0 != qualifier ("followlinks")));
+
+ variable w = struct
+ {
+	walk = &fswalk,
+	file_method = file_method,
+	file_method_args = file_method_args,
+	dir_method = dir_method,
+	dir_method_args = dir_method_args,
+	stat_func = (followlinks ? &stat_file : &lstat_file),
+ };
+ return w;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/glob.sl Added

@@ -0,0 +1,125 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License.  See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+private define needs_globbing (path)
+{
+   return (path != str_delete_chars (path, "*?"));
+}
+
+private define do_the_glob (dir, pat)
+{
+   variable files;
+
+   if (dir == "")
+     files = listdir (".");
+   else
+     files = listdir (dir);
+
+   if (files == NULL)
+     return String_Type0;
+
+   files = files, ".", "..";
+
+   if ((pat0 == '?') || (pat0 == '*'))
+     {
+	files = files where (strncmp (files, ".", 1));
+     }
+
+   if (length (files) == 0)
+     return files;
+
+   pat = glob_to_regexp (pat);
+
+   variable i = where (array_map (Int_Type, &string_match, files, pat, 1));
+   if (length (i) == 0)
+     return String_Type0;
+
+   files = filesi;
+   if (dir == "")
+     return files;
+
+   return array_map (String_Type, &path_concat, dir, files);
+}
+
+private define is_dir (dirs)
+{
+   variable n = length(dirs);
+   variable ok = Char_Typen;
+   _for (0, n-1, 1)
+     {
+	variable i = ();
+	variable st = stat_file (dirsi);
+	if (st == NULL)
+	  continue;
+	oki = stat_is ("dir", st.st_mode);
+     }
+   return ok;
+}
+
+define glob ();		       %  recursion
+define glob ()
+{
+   variable patterns = __pop_args (_NARGS);
+   if (length (patterns) == 0)
+     throw UsageError, "files = glob (patterns...)";
+
+   patterns = __push_args (patterns);
+
+   variable list = String_Type0;
+   foreach (patterns)
+     {
+	variable pat = ();
+
+	!if (needs_globbing (pat))
+	  {
+	     if (NULL != stat_file (pat))
+	       list = list, pat;
+
+	     continue;
+	  }
+
+	variable base = path_basename (pat);
+	variable dir = "";
+	if (base != pat)
+	  dir = path_dirname (pat);
+
+	if (needs_globbing (dir))
+	  {
+	     variable dirs = glob (dir);
+	     !if (strlen (base))
+	       {
+		  list = list, dirswhere(is_dir (dirs));
+		  continue;
+	       }
+
+	     foreach dir (glob (dir))
+	       list = list, do_the_glob (dir, base);
+
+	     continue;
+	  }
+
+	list = list, do_the_glob (dir, base);
+     }
+   return list;
+}
+
+#ifntrue
+define slsh_main ()
+{
+   variable files = glob (__argv1:);
+   foreach (files)
+     {
+	variable f = ();
+	fprintf (stdout, "%s\n", f);
+     }
+}
+#endif
+
+$1 = path_concat (path_dirname (__FILE__), "help/glob.hlp");
+if (NULL != stat_file ($1))
+  add_doc_file ($1);
+
+provide ("glob");

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/help Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/help/arrayfuns.hlp Added

@@ -0,0 +1,73 @@
+rearrange
+
+ SYNOPSIS
+  Rearrange the elements of a 1-d array or list.
+
+ USAGE
+  rearrange (A, indices)
+
+ DESCRIPTION
+  This function performs an in-place rearrangment of the the elements
+  of an array according to the specified permutation, represented by
+  the `indices' argument.  The `indices' array is assumed to
+  contain unique integers in the range `0,length(A)-1'.
+
+ NOTES
+  The function modifies the elements of the `indices' array while
+  it performs the rearrangement.  The values will get restored upon
+  return from function.
+
+  The algorithm used was derived from the DPPERM function, which is
+  part of the SLATEC package.  See
+  `http://gams.nist.gov/cgi-bin/serve.cgi/Package/SLATEC'.
+
+ SEE ALSO
+  array_reverse, array_swap
+
+--------------------------------------------------------------
+
+reverse
+
+ SYNOPSIS
+  Reverse the elements of a 1-d array
+
+ USAGE
+  Array_Type reverse (Array_Type A)
+
+ DESCRIPTION
+ The `reverse' function reverses the elements of a 1-d array and
+ returns the result.
+
+ SEE ALSO
+  shift
+
+--------------------------------------------------------------
+
+shift
+
+ SYNOPSIS
+  Shift the elements of a 1-d array
+
+ USAGE
+  Array_Type shift (Array_Type A, Int_Type n)
+
+ DESCRIPTION
+ The `shift' function shifts the elements of an array by a specified amount
+ and returns the result.  If `n' is positive, the ith element of the array
+ will be shifted to the position `i-n' of the array.  Elements for
+ which `i-n' is less than 0 will be moved to the end of the array.
+
+ EXAMPLE
+
+   A = 1,2,3,4,5,6,7,8,9;
+   B = shift (A, 3);          % ==> B = 4,5,6,7,8,9,1,2,3;
+   C = shift (A, -1);         % ==> C = 9,1,2,3,4,5,6,7,8;
+
+
+ NOTES
+ It many ways `rotate' would be a better name for this function.
+
+ SEE ALSO
+  reverse, transpose
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/help/cmdopt.hlp Added

@@ -0,0 +1,246 @@
+cmdopt_new
+
+ SYNOPSIS
+  Create a cmdopt object for parsing command-line options
+
+ USAGE
+  obj = cmdopt_new (Ref_Type error_routine)
+
+ DESCRIPTION
+  This function creates an returns an object that may be used by the
+  `cmdopt_process' function to parse command line arguments.  The
+  `cmdopt_new' function takes a reference to an error handling
+  function that will get called upon error.  In most cases, this
+  function should print out the error message, display a usage
+  message, and then call `exit'.  If the error handler is NULL,
+  or it returns instead of calling exit, then an exception will be thrown.
+
+  The error handler must be defined to take a single string argument
+  (the error message) and must return nothing.
+
+ EXAMPLE
+
+   require ("cmdopt");
+   private define help_callback ()
+   {
+     () = fputs ("Usage: pgm options infile\n", stderr);
+     () = fputs ("Options:\n", stderr);
+     () = fputs (" -h|--help           Show this help\n", stderr);
+     () = fputs (" -v|--verbose        Increase verbosity level\n", stderr);
+     () = fputs (" -o|--output         Output filename stdout\n", stderr);
+     exit (1);
+   }
+   private define error_handler (text)
+   {
+      () = fprintf (stderr, "%s\n", text);
+      help_callback ();
+   }
+   define slsh_main ()
+   {
+      variable verbose = 0;
+      outfile = "-";   % stdout
+      variable c = cmdopt_new (&error_handler);
+      cmdopt_add (c, "v|verbose", &verbose; inc);
+      cmdopt_add (c, "h|help", &help_callback);
+      cmdopt_add (c, "s:o|output", &outfile; type="str");
+      variable iend = cmdopt_process (c, __argv, 1);
+
+      if (verbose) message ("some informative message");
+      variable fp = stdout;
+      if (outfile != "-") fp = fopen (outfile, "w");
+        .
+        .
+    }
+
+
+ SEE ALSO
+  cmdopt_add, cmdopt_process
+
+--------------------------------------------------------------
+
+cmdopt_process
+
+ SYNOPSIS
+  Process the command-line options
+
+ USAGE
+  Int_Type cmdopt_process (optobj, argv, istart)
+
+   Struct_Type optobj;
+   Array_Type argv;
+   Int_Type istart
+
+
+ DESCRIPTION
+  This function parses the command line arguments in the string array
+  `argv' according to the rules specified by the `optobj'
+  object, previously allocated by `cmdopt_new'.  The array of
+  strings is processed starting at the index specified by
+  `istart'.  The function returns the index of the array element
+  where parsing stopped.  Upon error, the function will call the error
+  handler established  by the prior call to `cmdopt_new'.
+
+ EXAMPLE
+
+    define slsh_main ()
+    {
+          .
+          .
+       optobj = cmdopt_new (...);
+       cmdopt_add (optobj, ...);
+          .
+          .
+       variable iend = cmdopt_process (optobj, __argv, 1);
+          .
+          .
+    }
+
+
+ NOTES
+  This function may also be called in an object-oriented style using the
+  `process' method:
+
+       optobj = cmdopt_new (...);
+       optobj.add (...)
+       iend = optobj.process (__argv, 1);
+
+
+ SEE ALSO
+  cmdopt_add, cmdopt_new
+
+--------------------------------------------------------------
+
+cmdopt_add
+
+ SYNOPSIS
+  Add support for a command-line option
+
+ USAGE
+  cmdopt_add (optobj, optname, addr ,... ;qualifiers)
+
+   Struct_Type optobj;
+   String_Type optname;
+   Ref_Type addr;
+
+
+ DESCRIPTION
+  This function adds support for a command-line option to
+  `optobj' and specifies how that option should be handled.
+  Handling an option involves setting the value of a variable
+  associated with the option, or by calling a function upon its
+  behalf.
+
+  For clarity, assume a command-line option can be specified using the
+  single character `f' or by the longer name `foo'. Then the
+  rules for calling `cmdopt_add' for the various flavors options
+  supported by this interface and how the option may be specified on
+  the command line are as follows:
+
+  Options that set a variable `v' to a value `val':
+
+    cmdopt_add (optobj, "f|foo", &v; default=val);
+    cmdline: pgm -f ...
+    cmdline: pgm --foo ...
+
+
+  Options that increment an integer variable `v':
+
+    cmdopt_add (optobj, "f|foo", &v; inc);
+    cmdline: pgm -f -f ...       % In these examples, v
+    cmdline: pgm --foo --foo ... % gets incremented twice
+
+
+  Options that bitwise-or an integer variable `v' with `FLAG':
+
+    cmdopt_add (optobj, "f|foo", &v; bor=FLAG);
+    cmdline: pgm -f ...       % v = v | FLAG
+    cmdline: pgm --foo ...    % v = v | FLAG
+
+  Options that bitwise-and an integer variable `v' with `MASK':
+
+    cmdopt_add (optobj, "f|foo", &v; band=MASK);
+    cmdline: pgm -f ...       % v = v & MASK;
+    cmdline: pgm --foo ...    % v = v & MASK;
+
+  The above two options may be combined:
+
+    cmdopt_add (optobj, "f|foo", &v; bor=FLAG1, band=~FLAG2);
+    cmdline: pgm -f ...       % v &= ~FLAG2; v |= FLAG1;
+
+
+  Options that require a value and set `v' to the value VAL.
+
+    cmdopt_add (optobj, "f|foo", &v; type="int");
+    cmdline: pgm -f VAL ...
+    cmdline: pgm -fVAL ...
+    cmdline: pgm --foo VAL ...
+    cmdline: pgm --foo=VAL ...
+
+
+  Options whose value is optional:
+
+    cmdopt_add (optobj, "f|foo", &v; type="string", optional=DFLT);
+    cmdline: pgm -f ...            % set v to DFLT
+    cmdline: pgm -fVAL ...         % set v to VAL
+    cmdline: pgm --foo ...         % set v to DFLT
+    cmdline: pgm --foo=VAL ...     % set v to VAL
+
+
+  For the latter two cases, if the `append' qualifier is used,
+  then instead of assigning the value to the specified variable, the
+  value will be appended to a list assigned to the variable, e.g.,
+
+    cmdopt_add (optobj, "f|foo", &v; type="float", append);
+
+  Then the command line `pgm --foo=VAL1 -fVAL2 -f VAL3 ...' will
+  result in the assignment to `v' or the 3 element list
+  `{VAL1, VAL2, VAL3}'.
+
+  An option can also be associated with a callback function that get
+  called when the option is handled.
+
+  Options that cause a function to be called with arguments
+  `a0,...':
+
+    cmdopt_add (optobj, "f|foo", &func, a0...);
+    cmdline: pgm --foo
+    cmdline: pgm -f
+
+  Here `func' should be written with the signature:
+
+    define func (a0, ...) {...}
+
+  Options that take a value and cause a function to be called with
+  additional arguments `a0,...':
+
+    cmdopt_add (optobj, "f|foo", &func, a0,...; type="int");
+    cmdline: pgm --foo=VAL
+    cmdline: pgm -f VAL
+    cmdline: pgm -fVAL
+
+  In this case, `func' should be written as
+
+    define func (value, a0, ...) {...}
+
+
+  As the above examples illustrate, the data-type of the value assigned
+  to a variable must be specified using the `type' qualifier.
+  Currently the `type' must be set to one of the following values:
+
+     "str"          (String_Type)
+     "int"          (Int_Type)
+     "float"        (Double_Type)
+
+
+ NOTES
+  This function may also be called in an object-oriented style using the
+  `add' method:
+
+       optobj = cmdopt_new (...);
+       optobj.add ("f|foo", &func, a0,...; type="int");
+
+
+ SEE ALSO
+  cmdopt_new, cmdopt_process
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/help/fswalk.hlp Added

@@ -0,0 +1,134 @@
+fswalk_new
+
+ SYNOPSIS
+  Create an object to walk the filesystem tree
+
+ USAGE
+  obj = fswalk_new (Ref_Type dirfunc, Ref_Type filefunc; qualifiers)
+
+ DESCRIPTION
+  The `fswalk_new' function creates an object that is useful
+  for exploring a filesystem tree.  It requires two arguments that
+  are references to functions to be called when a directory or file is
+  encountered.  Each of these functions is passed at least two
+  arguments: the name of the file or directory (including leading path
+  elements relative to the directory where processing started), and
+  the stat structure of the of the file or directory.  Qualifiers may
+  be used to specify additional arguments.
+
+  The object's `walk' method is the one that actually walks the
+  filesystem.
+
+  The directory callback function must return an integer value that
+  indicates how it should be processed.  If the function returns 0,
+  then the directory will be skipped (pruned).  A positive value
+  indicates that the directory will processed.  If the function
+  returns a negative value, then no further processing by the walk
+  function will take place and control will pass to the user.
+
+  The file callback function must also return an integer that
+  indicates how processing should continue.  If it returns a positive
+  value, then additional files in the corresponding directory will be
+  processed.  If it returns 0, then no further files or subdirectories
+  of the directory will be processed, and processing will continue to
+  take place in the parent directory.  Otherwise, the return value is
+  negative, which indicates that processing should be stopped and
+  control will pass back to the caller.
+
+ QUALIFIERS
+  The following qualifiers are supported:
+
+   dargs={args...}
+
+    `dargs' is a list of additional arguments that will be added when
+    calling the directory callback function.
+
+   fargs={args...}
+
+    `fargs' is a list of additional arguments that will be added when
+    calling the file callback function.
+
+   followlinks=val
+
+    The `followlinks' qualifier may be used to indicate whether
+    or not directories that are symbolic links are to be followed.  By
+    default, they are not.  If `followlinks' is present with no
+    value, or has a non-zero value, then symbolic links will be
+    followed.  Otherwise, if `followlinks' is not present, or is
+    set to 0, then directories that are symbolic links will be skipped.
+
+ METHODS
+
+   .walk (String_Type top_dir)
+
+    The `.walk' function walks the filesystem starting at the
+    specified top-level directory calling the directory and file
+    callback functions as it goes.
+
+ EXAMPLE
+  Print a list of all files containing a `.png' extension under
+  the current directory:
+
+     private define file_callback (name, st)
+     {
+        if (".png" == path_extname (name))
+          message (name);
+        return 1;
+     }
+     variable w = fswalk_new (NULL, &file_callback);
+     w.walk (".");
+
+
+  Get a list of all directories that are symbolic links under /usr.
+
+     private define dir_callback (name, st, list)
+     {
+        st = lstat_file (name);
+        if (stat_is ("lnk", st.st_mode))
+          {
+            list_append (list, name);
+            return 0;
+          }
+        return 1;
+     }
+
+     define get_symdir_list (top)
+     {
+        variable list = {};
+        variable w = fswalk_new (&dir_callback, NULL
+                                 ;dargs={list}, followlinks);
+        w.walk (top);
+        return list;
+     }
+     symdirlist = get_symdir_list ("/usr");
+
+  Note that in this example, the dir_callback function returns 0 if
+  the directory corresponds to a symbolic link.  This causes the link
+  to not be followed.
+
+  Get a list of dangling symbolic links:
+
+     private define file_callback (name, st, list)
+     {
+        if (stat_is ("lnk", st.st_mode))
+          {
+             if ((NULL == stat_file (name))
+                 && (errno == ENOENT))
+               list_append (list, name);
+          }
+        return 1;
+     }
+
+     define get_badlinks (top)
+     {
+        variable list = {};
+        variable w = fswalk_new (NULL, &file_callback ;fargs={list});
+        w.walk (top);
+        return list;
+     }
+
+
+ SEE ALSO
+  glob, stat_file, lstat_file, listdir;
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/help/glob.hlp Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/help/listfuns.hlp Added

@@ -0,0 +1,185 @@
+list_sort
+
+ SYNOPSIS
+ Sort a list of item
+
+ USAGE
+
+
+ Int_Type indices = list_sort (List_Type list); % Form 1
+ list_sort (List_Type list; inplace); % Form 2
+
+
+ DESCRIPTION
+ The `list_sort' may be used to sort a list. By default, it
+ returns a permutation index array for the desired sort. If the
+ `inplace' qualifier is given, the sort will be in-place and no
+ index array will be returned.
+
+ QUALIFIERS
+ The following qualifiers may be used to modify the behavior of the
+ function:
+
+
+ dir=1
+
+ If the value of the `dir' qualifier is non-negative, the sort will
+ take place in an increasing order. If negative, the list will be
+ sorted in decreasing order.
+
+
+ cmp=&cmpfunc
+
+ The `cmp' qualifier specifies the function used to comparison
+ operation for two elements of an array. Its value must be a
+ reference to a function that accepts two arguments representing the
+ objects to be compared. It must return a positive integer, 0, or
+ a negative integer if the value of the first argument is greater
+ than, equal to, or less than the value of the second, respectively.
+
+
+ inplace=1
+
+ The inplace qualifier may be used to indicate if the list is to be
+ sorted in place. If the qualifier is present with no-value or a
+ non-zero value, the list will be sorted in place and no index array
+ will be returned. If not present, or present with a value of 0, the
+ list will not be modified, and an index array will be returned.
+
+ EXAMPLE
+
+ list = {1, 9, 3, 7};
+ i = list_sort (list);
+ sorted_list = listi;
+
+ The above example creates a second list (`sorted_list') by
+ using the permutation index array to rearrange the objects in the
+ unsorted list.
+
+
+ list = {1, 9, 3, 7};
+ list_sort (list; inplace);
+
+ In this example, the list is sorted in-place.
+
+ Consider a list of strings that are to be sorted in increasing
+ order of the number of bytes used by each string. For this, a custom
+ sort function is required:
+
+ private define cmpfunc (a, b)
+ {
+ return strbytelen(a) - strbytelen(b);
+ }
+ list = {"Here", "is", "a", "list", "of", "strings"};
+ list_sort (list; inplace);
+
+
+ NOTES
+ Keep in mind that a list can contain a heterogeneous collection of
+ object where there is no predefined comparison operation. For
+ example, there may be no natural way to compare an integer to a
+ string. For a heterogeneous list, a comparison function must be
+ provided.
+
+ SEE ALSO
+ array_sort, rearrange
+
+--------------------------------------------------------------
+
+heap_new
+
+ SYNOPSIS
+ Instantiate a heap data object
+
+ USAGE
+ Struct_Type h = new_heap (List_Type list)
+
+ DESCRIPTION
+ The `new_heap' function takes a List_Type object and
+ rearranges its elements to form a heap. A list rearranged to form a
+ heap has the property that `listi >= list2*i+j', where j=1 or 2,
+ and i is the list index (from 0).
+
+ Upon return, the elements of the list will be rearranged to have the
+ heap property and a new container object (the heap) will be
+ returned. It may be manipulated using the method calls described
+ below.
+
+ QUALIFIERS
+
+ dir=-1
+
+ The `dir' qualifier may be used to specify the direction of the
+ heap. The default (dir=-1) specifies a top-down ordering. A
+ bottom-up ordering corresponds to dir=1.
+
+
+ cmp=&cmpfunc
+
+ The `cmp' may be used to specify the function to be used when
+ comparing elements of the list. Its value must be a reference to a
+ function that takes two parameters and returns a positive integer if
+ the value of the first parameter is greater than the second, 0 if
+ they are equal, or a negative integer if the first is less than
+ the second. For example, if the list consists of structures with
+ fields called `lastname' and `firstname' that are to be
+ used for ordering, then the desired function would look something
+ like:
+
+ define cmpfunc (a, b)
+ {
+ variable c = strcmp (a.lastname, b.lastname);
+ if (c == 0) c = strcmp (a.firstname, b.firstname);
+ return c;
+ }
+
+
+ METHODS
+ .length() : Get the length to the heap
+ .add(obj) : Add a new object to the heap
+ .remove() : Remove the largest (for top-down) or smallest (for
+ bottom-up) item from the heap and return its value.
+ .peek() : Get the largest (top-down) or smallest(bottom-up) item
+ from the heap, but do not remove it.
+
+ Note that attempting to peek at or remove an item from an empty list
+ will result in an `IndexError' exception.
+
+ EXAMPLE
+ Suppose that merging two objects requires a time equal to the
+ combined length of the objects. For example, if the length of first
+ is A and that of the second is B, then the time to merge the two
+ will be A + B. What is the minimum amount of time it takes to merge
+ a list of N objects with lengths `{L_k}, k=0...N-1'? The
+ answer to this is very simple if a bottom-up heap is used. The idea
+ is to remove the two smallest objects from the heap, combine them
+ and then add the result back to the heap. Repeat this process until
+ the heap is empty. In the following, `list' is a list of the
+ lengths of the objects to be merged.
+
+ define compute_merge_time (list)
+ {
+ variable h = heap_new (list; dir=1); % bottom-up heap
+ variable a, b, c, t;
+ a = h.remove (); t = 0;
+ while (h.length())
+ {
+ b = h.remove ();
+ c = a + b;
+ t += c;
+ h.add (c);
+ a = h.remove ();
+ }
+ return t;
+ }
+
+
+ NOTES
+ Generally speaking, a list will require the specification of a
+ comparison function unless the list consists solely of elements that
+ may be compared using the `>', `<', and `==' operators.
+
+ SEE ALSO
+ list_sort, list_new
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/help/print.hlp Added

@@ -0,0 +1,78 @@
+print
+
+ SYNOPSIS
+  Display a string representation of an object or value
+
+ USAGE
+  print (value ,&var|file-pointer|filename)
+
+ DESCRIPTION
+ The `print' function displays the string representation of a
+ value to the display.  An optional second argument may be provided to
+ specify where to write the resulting string: a variable, an open file
+ pointer, or to a file.
+
+ If the string representation of the object appears to contain more
+ lines than are available on the screen, then the output will be piped
+ to the program given by the `PAGER' environment variable.
+ Alternatively the pager program may be specified via the `pager'
+ qualifier.
+
+ QUALIFIERS
+
+   pager=string       Force the use of the pager.  If a value is
+                         specified, then use it for the pager command.
+   nopager              Do not use a pager.
+
+
+ EXAMPLE
+  Print the string representation of an array to a file called
+  `array.dat':
+
+   print (1:20:0.1, "array.dat");
+
+
+  Print the string represent of an array to a string `str':
+
+   print (1:20:0.1, &str);
+
+
+ SEE ALSO
+  print_set_pager, print_set_pager_lines
+
+--------------------------------------------------------------
+
+print_set_pager
+
+ SYNOPSIS
+  Set the name of the pager program used by the print program
+
+ USAGE
+  print_set_pager (String_Type cmd)
+
+ DESCRIPTION
+  This function may be used to specify the name of the default pager to be
+  used by the `print' function.
+
+ SEE ALSO
+  print, print_set_pager_lines
+
+--------------------------------------------------------------
+
+print_set_pager_lines
+
+ SYNOPSIS
+  Set the maximum number of lines to print before using a pager
+
+ USAGE
+  print_set_pager_lines (Int_Type num)
+
+ DESCRIPTION
+  The `print_set_pager_lines' function sets the maximum number of
+  lines that the string representation of an object can be before the
+  `print' function will use a pager.
+
+ SEE ALSO
+  print, print_set_pager
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/help/process.hlp Added

@@ -0,0 +1,228 @@
+new_process
+
+ SYNOPSIS
+  Create a subprocess object
+
+ USAGE
+  Struct_Type new_process (String_Type argv; qualifiers)
+
+ DESCRIPTION
+  This function executes the program specified by the `argv'
+  parameter in a subprocess.  If `argv' is an array, the first
+  element (`argv0') of the array gives the name of the program
+  to be executed, and the remaining elements serve as arguments passed
+  to the program.  The program returns a structure that may be used to
+  interact with the process.  Upon error, an exception will be thrown.
+
+  The calling program may interact with the subprocess by reading from
+  or writing to the file descriptor fields of the structure returned
+  by the `new_process' function.  The specific file descriptors
+  are dictated via the `read', `write', and `dupN'
+  qualifiers, as described in detail below.
+
+  The function returns a structure containing zero or more fields of the form
+  `fdN' where `N' is an integer derived from the qualifiers,
+  e.g., `fd0' and `fd1' correspond to the child's stdin and
+  stdout, respectively.  The structure also contains fields of the
+  form `fpN' whose values are stdio File_Type objects
+  obtained using `fdopen' with the corresponding `fdN' value.
+
+  Other important fields include `pid' whose value is
+  the process-id of the newly created process.
+
+  The status of the process may be checked or collected using the
+  `wait' method.  It is very important to call this method to
+  avoid the creation of zombie processes.
+
+ QUALIFIERS
+  The following qualifiers are supported:
+
+   read=fds
+
+    fds is a list of integer file descriptors that are open for read
+    access in the subprocess, and may be written to by the calling
+    process using the fdN or fpN fields of the structure.
+
+   write=fds
+
+    fds is a list of integer file descriptors that are open for write
+    access in the subprocess, and may be read to by the calling
+    process using the fdN or fpN fields of the structure.
+
+   stdin=filename
+   stdout=filename
+   stderr=filename
+
+    These qualifiers allow the stdin, stdout, and stderr file
+    descriptors in the subprocess to be redirected to a file.  Note:
+    The filenames are interpreted relative to the value of the
+    `dir' qualifier.
+
+   fdN=string
+
+    This qualifier will cause the integer file descriptor N to be open
+    in the subprocess and redirected to the filename represented by
+    the string, which is interpreted relative to the value of the `dir'
+    qualifier.  The access mode is dictated by the first few
+    characters of the string as described in more detail below.
+
+   stdin=File_Type|FD_Type
+   stdout=File_Type|FD_Type
+   stderr=File_Type|FD_Type
+   fdN=FD_Type|FD_Type
+
+     If the stdin, stdout, stderr, or fdN qualifiers have File_Type or
+     FD_Type values, then corresponding file descriptors in the
+     subprocess will be dup'd to FD_Type or FP_Type file descriptor.
+     This form of the qualifier may be used to setup pipelines.
+
+   dupN=int
+
+     The file descriptor corresponding to the integer N in the
+     subprocess is created by duping the descriptor given by the
+     integer value of the qualifier.  For example, dup2=1 would cause
+     stderr (fd=2) in the subprocess to be redirected to stdout (fd=1).
+
+   dir=string
+
+     Change to the specified directory in the child process.  This
+     will happen after the child process is started, but before any
+     files have been opened.  Hence, files attached to `stdin',
+     `stdout', etc will be opened relative to this directory.
+
+   pre_exec_hook=&func
+
+     This qualifier will cause the function corresponding to `func' to
+     be called prior to closing unused file descriptors and invoking
+     the executable.  The function will be passed a list of integer
+     valued file descriptors that will be kept open.  Additional
+     integers may be added to the list by the function.  If the
+     qualifier `pre_exec_hook_optarg' exists, it will also be
+     passed as an addtional argument.
+
+   pre_exec_hook_optarg=VALUE
+
+     If this qualifier exists, its value will be passed as the second
+     argument to the `pre_exec_hook' callback function.
+
+  Note that the read and write qualifiers specify the nature of the
+  file descriptors from the child process's view.  That is, those
+  opened in the child process using the read qualifier, may be written
+  to by the parent.  Similarly, those opened using the write qualifier
+  may be read by the parent.
+
+ METHODS
+
+    Struct_Type .wait (  options  )
+
+  The `.wait' method may be used to collect the exist status of
+  the process.  When called without arguments, it will cause the
+  parent process to wait for the subprocess to exit and return its
+  exit status in the form of a `waitpid' structure.  The optional
+  `options' argument corresponds to the options argument of the
+  `waitpid' function.  The most common is the WNOHANG option,
+  which will cause the `.wait' method to return immediately if
+  the process has not exited.
+
+  If an error occurs, the function will return NULL and set
+  `errno' accordingly.  Otherwise it will return a `waitpid'
+  structure.  See the documentation for `waitpid' for more
+  information.
+
+ EXAMPLE
+  In the following examples, `pgm' represents the program to be
+  invoked in the subprocess.  For simplicity, no addition arguments are
+  shown
+
+  Create subprocess that inherits stdin, stdout, stderr from the caller:
+
+   obj = new_process (pgm);
+
+
+  Create a subprocess that inherits stdin, stdout, and writes stderr
+  to a file:
+
+   obj = new_process (pgm; stderr="/tmp/file");   % form 1
+   obj = new_process (pgm; fd2=">/tmp/file");     % form 2
+
+
+  Mimic popen(pgm, "r"):
+
+   obj = new_process (pgm; write=1);   % Read from obj.fp1
+
+
+  Mimic popen(pgm, "w"):
+
+   obj = new_process (pgm; read=0);  % Write to obj.fp0
+
+
+  Mimic popen("pgm 2>&1", "r"):
+
+   obj = new_process (pgm; write=1, dup2=1);  % Read from fp1
+
+
+  Send stdout to a file, read from the subprocess's stderr:
+
+   obj = new_process (pgm; stdout="/tmp/file", write=2);
+   % Read from obj.fp2
+
+
+  Create a process with handles to its stdin, stdout, stderr
+
+   obj = new_process (pgm; write={1,2}, read=0);
+   % Use obj.fp0 for stdin, obj.fp1 for stdout, and obj.fp2 for stderr
+
+
+  Create a process with a write handle to the process's fd=27 and a
+  read handle to the process's stdout.
+
+   obj = new_process (pgm; read=27, write=1);
+   % write to fp27, read from fp1
+
+
+  Create a pipeline: pgm1 | pgm2 > /tmp/log :
+
+  obj1 = new_process (pgm1; write=1);
+  obj2 = new_process (pgm2; stdin=obj1.fp1, stdout="/tmp/log");
+
+
+  Create a pipeline with fd=27 from pgm1 redirected to stdin of pgm2:
+
+  obj1 = new_process (pgm1; write=27);
+  obj2 = new_process (pgm2; stdin=obj1.fp27);
+
+
+  Create a pipeline with fd=27 from pgm1 redirected to fd=9 of pgm2:
+
+  obj1 = new_process (pgm1; write=27);
+  obj2 = new_process (pgm2; fp9=obj1.fp27);
+
+
+  Mimic: pgm 2>&1 1>/dev/null
+
+  obj = new_process (pgm; fp2=1, stdout="/dev/null");
+
+
+  Mimic: pgm >/dev/null 2>&1
+
+  obj = new_process (pgm; stdout="/dev/null", dup2=1);
+
+
+  Append the output of pgm to /tmp/file.log:
+
+   obj = new_process (pgm; stdout=">>/tmp/file.log");
+
+
+ NOTES
+  Care must be exercised when reading or writing to multiple file
+  descriptors of a subprocess to avoid deadlock.  In such cases, the
+  select module should be used, or the file descriptors could be put in
+  non-blocking mode via the fcntl module.
+
+  It is important to call the `.wait' method prevent the process
+  from becoming a zombie and clogging the process table.
+
+ SEE ALSO
+  popen, system
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/help/profile.hlp Added

@@ -0,0 +1,122 @@
+profile_on
+
+ SYNOPSIS
+  Enable code generation to support profiling hooks
+
+ USAGE
+  profile_on ( line_by_line )
+
+ DESCRIPTION
+  This function will turn cause the interpreter to generate code to
+  call hooks that are used to profile code.  The `profile_on'
+  function does not establish those hooks, rather it causes code to be
+  generated to support such hooks.
+
+  With no optional argument, only code to support function call hooks
+  will be generated.  To enable support for line-by-line profile
+  hooks, a value of 1 should be passed to this function.
+
+ SEE ALSO
+  profile_off, profile_begin, profile_end, profile_calibrate, profile_report}
+
+--------------------------------------------------------------
+
+profile_off
+
+ SYNOPSIS
+  Turn off code generation for profiling hooks
+
+ USAGE
+  profile_off ()
+
+ DESCRIPTION
+  This function turns off the generation of code to support profiling
+  hooks.
+
+ SEE ALSO
+  profile_on, profile_begin, profile_end, profile_calibrate, profile_report}
+
+--------------------------------------------------------------
+
+profile_begin
+
+ SYNOPSIS
+  Establish profiling hooks and reset the profiler
+
+ USAGE
+  profile_begin ( line_by_line )
+
+ DESCRIPTION
+  This function establishes the profiling hooks and resets or
+  initializes the profiler state.  By default, only hooks to gather
+  function call information are created.  To enable the gathering of
+  line-by-line information, a value of 1 should be passed to this
+  function.
+
+ SEE ALSO
+  profile_end, profile_on, profile_off, profile_calibrate, profile_report}
+
+--------------------------------------------------------------
+
+profile_end
+
+ SYNOPSIS
+  Remove profiling hooks and turn off profiler code generation
+
+ USAGE
+  profile_end ()
+
+ DESCRIPTION
+  The `profile_end' function turns off the code generation to
+  support profiling hooks and removes any profiling hooks that are in
+  place.
+
+ SEE ALSO
+  profile_begin, profile_on, profile_off, profile_calibrate, profile_report
+
+--------------------------------------------------------------
+
+profile_calibrate
+
+ SYNOPSIS
+  Calibrate the profiler
+
+ USAGE
+  profile_calibrate ( N )
+
+ DESCRIPTION
+ This function may be used to ``calibrate'' the profiler.  As the
+ performance of the profiler and the interpreter varies with a
+ platform and load-dependent manner, this function should be called
+ prior to enabling the profiler.  It tries to determine the average
+ amount of overhead per statement executed and function call by
+ executing a series of statements and functions many times to
+ determine statistically accurate values.  The optional parameter
+ `N' may be used to control the amount of code executed
+ for the calibration process.  If no value is provided, the `N'
+ will default to 1000.  The higher the value, the more accurate the
+ calibration will be and the longer the calibration process will take.
+
+ SEE ALSO
+  profile_begin, profile_end, profile_on, profile_off, profile_report
+
+--------------------------------------------------------------
+
+profile_report
+
+ SYNOPSIS
+  Generate the profile report
+
+ USAGE
+  profile_report (file)
+
+ DESCRIPTION
+  The function may be used to format the profile report and write it
+  to the specified file.  If the `file' parameter represents a
+  File_Type file descriptor, then the report will be written
+  the the descriptor.
+
+ SEE ALSO
+  profile_begin, profile_end, profile_on, profile_off, profile_calibrate
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/help/readascii.hlp Added

@@ -0,0 +1,131 @@
+readascii
+
+ SYNOPSIS
+  Read data from a text file
+
+ USAGE
+  Int_Type readascii (file, &v1,...&vN ; qualifiers)
+
+ DESCRIPTION
+ This function may be used to read formatted data from a text (as
+ opposed to binary) file and stores the values as arrays in the
+ specified variables `v1,..., vN' (passed as references).  It
+ returns the number of lines read from the file that matched the
+ format (implicit or specified by a qualifier).
+
+ The file parameter may be a string that gives the filename to read,
+ a `File_Type' object representing an open file pointer, or an
+ array of lines to be scanned.
+
+ QUALIFIERS
+ The following qualifiers are supported by the function
+
+   format=string        The sscanf format string to be used when
+                          parsing lines.
+   nrows=integer        The maximum number of matching rows to handle.
+   ncols=integer        If a single reference is passed, it will be
+                          assigned an array of ncols arrays of data values.
+   skip=integer         Skip the specified number of lines before
+                          scanning
+   maxlines=integer     Read no more than this many lines.
+   cols=Array_Type      Read only the specified (1-based) columns.
+                          Used with an implict format
+   delim=string         For an implicit format, use this as a field
+                          separator.  The default is whitespace.
+   type=string          For an implicit format, use this sscanf type
+                          specifier.  Default is %lf (Double_Type).
+   size=integer         Use this value as the initial size for the
+                          arrays.
+   dsize=integer        Use this value as an increment when
+                          reallocating the arrays.
+   stop_on_mismatch     Stop reading input when a line does not match
+                          the format
+   lastline=&v          Assign the last line read to the variable v.
+   lastlinenum=&v       Assign the last line number (1-based to v)
+   comment=string       Lines beginning with this string are ignored.
+   as_list              If present, then return data in lists rather
+                          than arrays.
+
+
+ EXAMPLE
+ As a simple example, consider a file called `imped.dat' containing
+
+    # Distance    Zr   Zi
+    0.0          50.2    0.1
+    1.0          47.3  -12.2
+    2.0          43.9  -15.8
+
+  The 3 columns may be read and stored in the variables `x', `zr',
+  `zi' using
+
+     n = readascii ("imped.dat", &x, &zr, &zi);
+
+ After return, The value of `x' will be set to
+ `0.0,1.0,2.0', `zr' to `50.2,47.3,43.9',
+ `zi' to `0.1,-12.2,-15.8', and `n' to 3.
+
+ Another way to read the same data is to use
+
+    n = readascii ("imped.dat", &data; ncols=3);
+
+ In this case, `data' will be `Array_Type3', with each
+ element of the array containing the array of data values for the
+ corresponding column.  As before, `n' will be 3.
+
+ As a more complex example, Consider a file called `score.dat'
+ that contains:
+
+    Name      Score     Date          Flags
+    Bill       73.2     03-Nov-2046    1
+    James      22.9     03-Nov-2046    1
+    Lucy       89.1     04-Nov-2046    3
+
+ This file may be read using
+
+     n = readascii ("score.dat", &name, &score, &date, &flags;
+                    format="%s %lf %s %d");
+
+ In this case, `n' will be 3, `name' and `date' will
+ be String_Type arrays, `score' will be a
+ Double_Type array, and `flags' will be an
+ `Int_Type' array.
+
+ Now suppose that only the score and flags column are of interest.
+ The `name' and `date' fields may be ignored using
+
+     n = readascii ("score.dat", &score, &flags";
+                    format="%*s %lf %*s %d");
+
+ Here, `%*s' indicates that the field is to be parsed as a
+ string, but not assigned to a variable.
+
+ Consider the task of reading columns from a file called
+ `books.dat' that contain quoted strings such as:
+
+     # Year  Author Title
+     "1605" "Miguel de Cervantes"  "Don Quixote de la Mancha"
+     "1885" "Mark Twain" "The Adventures of Huckleberry Finn"
+     "1955" "Vladimir Nabokov" "Lolita"
+
+ Such a file may be read using
+
+     n = readascii ("books.dat", &year, &author, &title;
+                    format="\"%^\"\" \"%^\"\" \"%^\"\"");
+
+
+
+ NOTES
+ This current version of this function does not handle missing data.
+ For such files, the `csv_readcol' function might be a better
+ choice.
+
+ By default, lines not matching the expected format are assumed to
+ be comments and are skipped.  So normally the `comment'
+ qualifier is not needed.  However, it is useful in conjunction with
+ the `stop_on_mismatch' qualifier to force the parser to skip
+ lines beginning with the comment string and continue scanning.
+
+ SEE ALSO
+  sscanf, atof, fopen, fgets, fgetslines, csv_readcol
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/help/require.hlp Added

@@ -0,0 +1,83 @@
+_featurep
+
+ SYNOPSIS
+  Test whether or not a feature is present
+
+ USAGE
+  Int_Type _featurep (String_Type feature ,String_Type namespace)
+
+ DESCRIPTION
+  The `_featurep' function returns a non-zero value if the specified
+  feature is present.  Otherwise, it returns 0 to indicate that the feature
+  has not been loaded.
+
+ SEE ALSO
+  require, provide
+
+--------------------------------------------------------------
+
+provide
+
+ SYNOPSIS
+  Declare that a specified feature is available
+
+ USAGE
+  provide (String_Type feature ,String_Type namespace)
+
+ DESCRIPTION
+ The `provide' function may be used to declare that a "feature" has
+ been loaded into the specified namespace.  If the namespace argument is not
+ present, the current namespace will be used.
+ See the documentation for `require' for more information.
+
+ SEE ALSO
+  require, _featurep
+
+--------------------------------------------------------------
+
+require
+
+ SYNOPSIS
+  Make sure a feature is present, and load it if not
+
+ USAGE
+  require (feature ,namespace ,file)
+
+   String_Type feature, namespace, file;
+
+
+ DESCRIPTION
+  The `require' function ensures that a specified "feature" is present.
+  If the feature is not present, the `require' function will attempt to
+  load the feature from a file.  If the `namespace' argument is present
+  and non-NULL, the specified namespace will be used.  The default is to use
+  the current non-anonymous namespace. If called with three arguments, the
+  feature will be loaded from the file specified by the third argument
+  if it does not already exist in the namespace.  Otherwise, the feature
+  will be loaded from a file given by the name of the feature, with
+  ".sl" appended.
+
+  If after loading the file, if the feature is not present,
+  a warning message will be issued.
+
+ EXAMPLE
+
+    require ("histogram");
+    require ("histogram", "foo");
+    require ("histogram", "foo", "/home/bob/hist.sl");
+    require ("histogram", ,"/home/bob/hist.sl");
+
+
+ NOTES
+  "feature" is an abstract quantity that is undefined here.
+
+  A popular use of the `require' function is to ensure that a specified
+  file has already been loaded.  In this case, the feature is the
+  filename itself.  The advantage of using this mechanism over using
+  `evalfile' is that if the file has already been loaded, `require'
+  will not re-load it.
+
+ SEE ALSO
+  provide, _featurep, evalfile
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/help/setfuns.hlp Added

@@ -0,0 +1,133 @@
+complement
+
+ SYNOPSIS
+  Extract the elements of a set that are not contained in other sets.
+
+ USAGE
+  indices = complement (a, b, ..., c)
+
+ DESCRIPTION
+  This function computes the elements of the first argument (`a')
+  that are not contained in the sets given by the other arguments
+  (`b,...,c') and returns them in the form of indices into the
+  first argument.
+
+ EXAMPLE
+
+   a = {"foo", PI, 7};
+   b = 1,2,3,PI;
+   indices = complement (a, b);
+
+  Upon return, `indices' will have the value `0, 2' since
+  `a0' and `a2' are not contained in `b'.
+
+ NOTES
+  A set may either be an Array_Type or a List_Type object.
+  For a homogeneous collection of objects, it is better to
+  use an Array_Type. i.e., `1,2,3' instead of `{1,2,3}'.
+
+ SEE ALSO
+  intersection, ismember, union, unique
+
+--------------------------------------------------------------
+
+intersection
+
+ SYNOPSIS
+  Extract the common elements of two or more sets
+
+ USAGE
+  indices = complement (a, b, ..., c)
+
+ DESCRIPTION
+  This function computes the common elements of two or more sets and
+  returns them in the form of indices into the first argument.
+
+ EXAMPLE
+
+   a = {"foo", 7, PI};
+   b = {PI, "bar", "foo"};
+   indices = intersection (a, b);
+
+  Upon return, `indices' will have the value `0, 2' since
+  `a0' and `a2' are the common elements of the sets.
+
+ NOTES
+  A set may either be an Array_Type or a List_Type object.
+  For a homogeneous collection of objects, it is better to
+  use an Array_Type. i.e., `1,2,3' instead of `{1,2,3}'.
+
+ SEE ALSO
+  complement, ismember, union, unique
+
+--------------------------------------------------------------
+
+ismember
+
+ SYNOPSIS
+  test to see if the elements of one set are members of another
+
+ USAGE
+  val = ismember (a, b)
+
+ DESCRIPTION
+  This function may be used to see which of the elements of the set
+  `a' are members of the set `b'.  It returns a boolean
+  array indicating whether or not the corresponding element of
+  `a' is a member of `b'.
+
+ NOTES
+  A set may either be an Array_Type or a List_Type object.
+  For a homogeneous collection of objects, it is better to
+  use an Array_Type. i.e., `1,2,3' instead of `{1,2,3}'.
+
+ SEE ALSO
+  complement, intersection, union, unique
+
+--------------------------------------------------------------
+
+union
+
+ SYNOPSIS
+  Form a set of the unique elements of one ore more subsets
+
+ USAGE
+  abc = union (a, b,..., c)
+
+ DESCRIPTION
+  This function interprets each of its arguments as a set, then merges
+  them together and returns only the unique elements.  The returned
+  value may either be an Array_Type or a List_Type
+  object.
+
+ NOTES
+  A set may either be an Array_Type or a List_Type object.
+  For a homogeneous collection of objects, it is better to
+  use an Array_Type. i.e., `1,2,3' instead of `{1,2,3}'.
+
+ SEE ALSO
+  complement, intersection, ismember, unique
+
+--------------------------------------------------------------
+
+unique
+
+ SYNOPSIS
+  Get the indices of the unique elements of a set
+
+ USAGE
+  indices = unique (A)
+
+ DESCRIPTION
+  This function returns an array of the indices of the unique elements
+  of a set.
+
+ NOTES
+  A set may either be an Array_Type or a List_Type object.
+  For a homogeneous collection of objects, it is better to
+  use an Array_Type. i.e., `1,2,3' instead of `{1,2,3}'.
+
+ SEE ALSO
+  complement, intersection, ismember, union
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/help/structfuns.hlp Added

@@ -0,0 +1,98 @@
+struct_filter
+
+ SYNOPSIS
+  Apply a filter to a struct
+
+ USAGE
+  struct_filter(Struct_Type s, Int_Type i)
+
+ DESCRIPTION
+  This function applies the filter `i' to the fields of a structure
+  by performing the operation
+
+    s.field = s.fieldi;
+
+  on each array field of the structure.  Scalar fields will not be modified.
+
+  The `dim' qualifier may be used to filter on a specific array
+  dimension.  For example, consider the structure
+
+    s = struct { a = Int_Type10, b = Int_Type10,20 };
+
+  Then
+
+    struct_filter (s, i; dim=0);
+
+  would produce the same result as
+
+    s.a = s.ai;
+    s.b = s.bi,*;
+
+
+ NOTES
+  By default this function modifies the fields of the structure passed
+  to it.  Sometimes it is desirable to create a new structure and
+  leave the old one untouched.  This may be achieved using the
+  `copy' qualifier, e.g.,
+
+     filtered_s = struct_filter (s, i; copy);
+
+
+ SEE ALSO
+  where
+
+--------------------------------------------------------------
+
+struct_combine
+
+ SYNOPSIS
+  Combine two or more structures
+
+ USAGE
+  new_s = struct_combine (s1, s2, ...)
+
+ DESCRIPTION
+  This function creates a new structure from two or more structures
+  `s1', `s2',....  The new structure will have fields formed by the
+  union of the fields of the input structures.  The new structure fields will
+  be given values that correspond to the fields of the input structures.  If
+  more than one structure has the same field name, the value of the field will
+  be given by the last structure.
+
+  If any of the input values is a string, or an array of strings, then
+  it will be interpreted as a representing a structure with the
+  corresponding field names.  This is a useful feature when one wants
+  to expand a structure with new field names, e.g.,
+
+    s = struct { foo, bar };
+    t = struct_combine (s, "baz");   % t = struct {foo, bar, baz};
+
+
+ NOTES
+  The same effect can be achieved by using the dereference operator, e.g.,
+
+    t = struct { @s, "baz" };
+
+
+ SEE ALSO
+  get_struct_field_names
+
+--------------------------------------------------------------
+
+struct_field_exists
+
+ SYNOPSIS
+  Determine whether or not a structure contains a specified field
+
+ USAGE
+  Int_Type struct_field_exists (Struct_Type s, String_Type f)
+
+ DESCRIPTION
+ This function may be used to determine if a structure contains a field with
+ a specfied name.  It returns 0 if the structure does not contain the field,
+ or non-zero if it does.
+
+ SEE ALSO
+  get_struct_field_names
+
+--------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/listfuns.sl Added

@@ -0,0 +1,162 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+require ("arrayfuns");
+
+private define user_sort_cmp (cd, i, j)
+{
+ variable list = cd.list;
+ return (@cd.cmp) (listi, listj);
+}
+
+private define default_sort_cmp (list, i, j)
+{
+ if (listi > listj) return 1;
+ if (listi == listj) return 0;
+ return -1;
+}
+
+
+define list_sort (list)
+{
+ variable dir = qualifier ("dir", 1);
+ variable cmp = qualifier ("cmp");
+
+ variable n = length (list);
+ variable i;
+ if (cmp == NULL)
+ i = array_sort (list, &default_sort_cmp, n; dir=dir);
+ else
+ i = array_sort (struct {list=list, cmp=cmp}, &user_sort_cmp, n; dir=dir);
+
+ variable inplace = qualifier ("inplace", 0);
+ if (inplace == 0)
+ return i;
+
+ rearrange (list, i);
+}
+
+% Heap Implementation
+
+private define heap_length (h)
+{
+ return length (h.list);
+}
+
+private define upheap (list, k, cmp)
+{
+ variable obj = listk;
+ variable k2 = (k-1)/2;
+ while (k && (@cmp)(obj,listk2) > 0)
+ {
+	listk = listk2;
+	k = k2;
+	k2 = (k-1)/2;
+ }
+ listk = obj;
+}
+
+private define downheap (list, k, cmp)
+{
+ variable obj = listk;
+ variable n = length(list), n2 = n/2;
+ n--;
+% 0
+% 1 2
+% 3 4 5 6
+% 7 8 9 10 11 12 13 14 
+ while (k < n2)
+ {
+	variable j = 2*k + 1;
+	if ((j < n)
+	 && ((@cmp)(listj, listj+1) < 0))
+	 j++;
+	if ((@cmp)(obj, listj) >= 0)
+	 break;
+	listk = listj;
+	k = j;
+ }
+ listk = obj;
+}
+
+
+private define heap_add (h, obj)
+{
+ variable list = h.list;
+ list_append (list, obj);
+ upheap (list, length(list)-1, h.cmp);
+}
+
+private define heap_pop (h)
+{
+ variable list = h.list;
+ variable obj = list0;
+ variable last = list_pop(list, -1);
+ if (length (list))
+ {
+	list0 = last;
+	downheap (list, 0, h.cmp);
+ }
+ return obj;
+}
+
+private define heap_peek (h)
+{
+ return h.list0;
+}
+
+private define default_heap_cmp (a, b)
+{
+ if (a > b) return 1;
+ if (a < b) return -1;
+ return 0;
+}
+
+private define default_heap_cmp_rev (a, b)
+{
+ if (a > b) return -1;
+ if (a < b) return 1;
+ return 0;
+}
+
+
+define heap_new ()
+{
+ if (_NARGS == 0)
+ usage (`
+h = new_heap (list; cmp=&cmpfun, dir=val);
+len = h.length();
+h.add (item);
+top = h.remove();
+top = h.peek ();
+`
+	 );
+
+ variable list = ();
+ variable cmp = qualifier ("cmp");
+ variable dir = qualifier ("dir", -1);
+
+ % The conventional interpretation of a heap is that the largest
+ % element is at the root, and smaller ones below. For this reason,
+ % dir=-1 (ascending order) is the default for sorting.
+ list_sort (list; cmp=cmp, dir=dir, inplace);
+
+ if (cmp == NULL)
+ {
+	cmp = (dir <= 0) ? &default_heap_cmp : &default_heap_cmp_rev;
+ }
+
+ variable h = struct
+ {
+	list = list,
+	cmp = cmp,
+	length = &heap_length,
+	add = &heap_add,
+	remove = &heap_pop,
+	peek = &heap_peek,
+ };
+ return h;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/print.sl Added

@@ -0,0 +1,415 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License.  See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+private variable Pager_Rows = NULL;
+private variable Pager = getenv ("PAGER");
+if (Pager == NULL)
+  Pager = "more";
+
+% Print Methods
+private variable Print_Device_Type = struct
+{
+   fp,
+   printf,
+   puts,
+   close,
+   clientdata
+};
+
+% Print to file-pointer method
+private define fp_puts_method (p, str)
+{
+   variable n = fputs (str, p.fp);
+   if (n != strbytelen (str))
+     return -1;
+   return n;
+}
+
+private define fp_printf_method ()
+{
+   variable args = __pop_args (_NARGS-1);
+   variable p = ();
+   return fp_puts_method (p, sprintf (__push_args(args)));
+}
+private define fp_close_method (p)
+{
+   return fclose (p.fp);
+}
+private define new_fp_print (fp)
+{
+   variable p = @Print_Device_Type;
+   p.fp = fp;
+   p.puts = &fp_puts_method;
+   p.printf = &fp_printf_method;
+   return p;
+}
+
+% Print to a pager
+
+#ifexists SIGPIPE
+private variable Sigpipe_Handler;
+#endif
+
+private define close_pager (fp)
+{
+   if (fp != NULL)
+     () = pclose (fp);
+#ifexists SIGPIPE
+   signal (SIGPIPE, Sigpipe_Handler);
+#endif
+}
+private define pager_close_method (p)
+{
+   close_pager (p.fp);
+   return 0;
+}
+
+private define new_pager_print (cmd)
+{
+#ifnexists popen
+   return NULL;
+#else
+# ifexists SIGPIPE
+   signal (SIGPIPE, SIG_IGN, &Sigpipe_Handler);
+# endif
+   variable fp = popen (cmd, "w");
+
+   try
+     {
+	if (fp == NULL)
+	  throw OpenError, "Unable to open the pager ($cmd)"$;
+
+# ifexists setvbuf
+	() = setvbuf (fp, _IONBF, 0);
+# endif
+	variable p = new_fp_print (fp);
+	p.close = &pager_close_method;
+	return p;
+     }
+   catch AnyError:
+     {
+	close_pager (fp);
+	throw;
+     }
+#endif
+}
+
+% Print to a filename
+private define new_file_print (filename)
+{
+   variable fp = fopen (filename, "w");
+   if (fp == NULL)
+     throw OpenError, "Unable to open $filename for writing."$;
+
+   variable p = new_fp_print (fp);
+   p.close = &fp_close_method;
+   p.clientdata = filename;
+   return p;
+}
+
+% Print to a reference
+private define ref_printf_method ()
+{
+   variable args = __pop_args (_NARGS-1);
+   variable p = ();
+   p.fp = strcat (p.fp, sprintf (__push_args(args)));
+   return 1;
+}
+private define ref_puts_method (p, str)
+{
+   p.fp = strcat (p.fp, str);
+   return 1;
+}
+private define ref_close_method (p)
+{
+   @p.clientdata = p.fp;
+   return 0;
+}
+private define new_ref_print (ref)
+{
+   variable p = @Print_Device_Type;
+   p.fp = "";
+   p.printf = &ref_printf_method;
+   p.puts = &ref_puts_method;
+   p.close = &ref_close_method;
+   p.clientdata = ref;
+   return p;
+}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+private define generic_to_string (x)
+{
+   switch (typeof (x))
+     {
+      case String_Type:
+	return make_printable_string (x);
+     }
+     {
+      case BString_Type:
+	return sprintf ("\"%S\"", x);
+     }
+
+   return string (x);
+}
+
+private define struct_to_string (s, single_line)
+{
+   if (s == NULL)
+     return "NULL";
+
+   variable names = get_struct_field_names (s);
+   variable comma = "";
+   variable str = "{";
+   variable comma_str = ", ";
+   if (single_line == 0)
+     comma_str = ",\n ";
+   foreach (names)
+     {
+	variable name = ();
+	str = strcat (str, comma, name, "=", generic_to_string(get_struct_field (s, name)));
+	comma = comma_str;
+     }
+   return strcat (str, "}");
+}
+
+private define struct_to_single_line_string (s)
+{
+   return struct_to_string (s, 1);
+}
+
+private define print_list (a, device)
+{
+   if (-1 != device.puts ("{\n"))
+     {
+	variable s;
+	foreach s (a)
+	  {
+	     if (-1 == device.printf ("%s\n", generic_to_string (s)))
+	       break;
+	  }
+	then
+	  () = device.puts ("}\n");
+     }
+}
+
+private define write_2d_array (device, a, to_str)
+{
+   variable dims = array_shape (a);
+   variable nrows = dims0;
+   variable ncols = dims1;
+
+   _for (0, nrows-1, 1)
+     {
+	variable i = ();
+	_for (0, ncols-1, 1)
+	  {
+	     variable j = ();
+	     if (-1 == device.printf ("%s ", (@to_str)(ai,j)))
+	       return -1;
+	  }
+	if (-1 == device.puts ("\n"))
+	  return -1;
+     }
+   return 0;
+}
+
+private define print_array (a, device)
+{
+   variable dims, ndims;
+
+   (dims, ndims, ) = array_info (a);
+   variable nrows = dims0;
+
+   try
+     {
+	variable i, j;
+	variable to_str;
+	if (_is_struct_type (a))
+	  to_str = &struct_to_single_line_string;
+	else if (__is_numeric (a))
+	  to_str = &string;
+	else
+	  to_str = &generic_to_string;
+
+	if (ndims == 1)
+	  {
+	     _for i (0, nrows-1, 1)
+	       {
+		  if (-1 == device.printf ("%s\n", (@to_str)(ai)))
+		    return;
+	       }
+	     return;
+	  }
+
+	if (ndims == 2)
+	  {
+	     () = write_2d_array (device, a, to_str);
+	     return;
+	  }
+
+	nrows = nint(prod(dims0:ndims-3));
+	variable new_dims = nrows, dimsndims-2, dimsndims-1;
+	reshape (a, new_dims);
+	_for i (0, nrows-1, 1)
+	  {
+	     if ((-1 == write_2d_array (device, ai,*,*, to_str))
+		 || (-1 == device.puts ("\n")))
+	       return;
+	  }
+     }
+   finally
+     {
+	reshape (a, dims);
+     }
+}
+
+private define get_pager_rows ()
+{
+   if (Pager_Rows != NULL)
+     return Pager_Rows;
+
+   variable rows;
+#ifexists slsh_get_screen_size
+   (rows,) = slsh_get_screen_size ();
+#else
+   rows = 24;
+#endif
+   return rows - 2;		       %  leave room for the prompt
+}
+
+
+define print ()
+{
+   variable usage_string
+     =  ("print (OBJ ,&str|File_Type|Filename);\n"
+	 + "Qualifiers: pager=pgm, nopager\n");
+
+   if (_NARGS == 0)
+     usage (usage_string);
+
+   variable pager_pgm = Pager;
+   variable use_pager = -1;	       %  auto
+
+   if (qualifier_exists("nopager"))
+     use_pager = 0;
+   else if (qualifier_exists ("pager"))
+     {
+	use_pager = 1;
+	pager_pgm = qualifier ("pager");
+	if (pager_pgm == NULL)
+	  pager_pgm = Pager;
+     }
+   variable noescape = qualifier_exists ("noescape");
+
+   variable device = NULL;
+   if (_NARGS == 2)
+     {
+	device = ();
+	switch (typeof (device))
+	  {
+	   case File_Type:
+	     device = new_fp_print (device);
+	  }
+	  {
+	   case String_Type:
+	     device = new_file_print (device);
+	  }
+	  {
+	   case Ref_Type:
+	     device = new_ref_print (device);
+	  }
+	  {
+	     usage (usage_string);
+	  }
+	use_pager = 0;
+     }
+
+   variable x = ();
+   variable t = typeof (x);
+   variable str_x = NULL;
+
+   if (use_pager == -1)
+     {
+	variable pager_rows = get_pager_rows ();
+
+	switch (t)
+	  {
+	   case Array_Type:
+	     variable dims = array_shape (x);
+	     use_pager = ((dims0 > pager_rows)
+			  || (prod(dims) > 10*pager_rows));
+	  }
+	  {
+	   case List_Type:
+	     use_pager = length (x) > pager_rows;
+	  }
+	  {
+	   case String_Type:
+	     use_pager = count_byte_occurrences (x, '\n') > pager_rows;
+	     if (noescape)
+	       str_x = x;
+	  }
+	  {
+	     if (is_struct_type (x))
+	       str_x = struct_to_string (x, 0);
+	     else
+	       str_x = generic_to_string (x);
+
+	     use_pager = (count_byte_occurrences (str_x, '\n') > pager_rows);
+	  }
+     }
+
+   if (use_pager)
+     device = new_pager_print (pager_pgm);
+
+   if (device == NULL)
+     device = new_fp_print (stdout);
+
+   try
+     {
+	if (t == Array_Type)
+	  return print_array (x, device);
+
+	if (t == List_Type)
+	  return print_list (x, device);
+
+	if ((t == String_Type) && use_pager)
+	  {
+	     () = device.puts (x);
+	     return;
+	  }
+
+	if (str_x != NULL)
+	  x = str_x;
+	else if (is_struct_type (x))
+	  x = struct_to_string (x, 0);
+	else
+	  x = generic_to_string (x);
+
+	if (-1 != device.puts (x))
+	  {
+	     if (x-1 != '\n')
+	       () = device.puts ("\n");
+	  }
+     }
+   finally
+     {
+	if (device.close != NULL)
+	  () = device.close ();
+     }
+}
+
+define print_set_pager (pager)
+{
+   Pager = pager;
+}
+
+define print_set_pager_lines (n)
+{
+   Pager_Rows = n;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/process.sl Added

@@ -0,0 +1,372 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+require ("fork");
+require ("fcntl");
+
+private variable OPEN_MAX = 512;
+try
+{
+ require ("sysconf");
+ OPEN_MAX = (@__get_reference ("sysconf"))("_SC_OPEN_MAX", 512);
+}
+catch ImportError;
+
+#ifexists signal
+signal (SIGPIPE, SIG_IGN);
+#endif
+
+private define parse_redir (redir)
+{
+ variable redir_info =
+ {"^>> ?$.*$"R, O_WRONLY|O_CREAT|O_APPEND},
+ {"^> ?$.*$"R, O_WRONLY|O_TRUNC|O_CREAT},
+ {"^<> ?$.*$"R, O_RDWR|O_CREAT},
+ {"^< ?$.*$"R, O_RDONLY}
+ ;
+ variable other_flags = O_NOCTTY;
+
+ foreach (redir_info)
+ {
+	variable ri = ();
+	variable re = ri0;
+	ifnot (string_match (redir, re, 1))
+	 continue;
+	variable pos, len;
+	(pos, len) = string_match_nth (1);
+	return ri1 | other_flags, redirpos:pos+len-1;
+ }
+ return 0, redir;
+}
+
+private variable S_RWUGO = S_IRUSR|S_IWUSR|S_IRGRP|S_IWGRP|S_IROTH|S_IWOTH;
+
+% Look for structure fields of the form fpN and open the corresponding
+% files.
+private define open_redirect_files (q)
+{
+ variable redir_fds = FD_Type0, redir_ifds = Int_Type0;
+ if (q == NULL)
+ return redir_fds, redir_ifds;
+
+ foreach (get_struct_field_names (q))
+ {
+	variable name = ();
+	variable fd, ifd, value, defflags = 0, flags, file;
+	if (1 != sscanf (name, "fd%d", &ifd))
+	 {
+	 if (name == "stdin") ifd = 0;
+	 else if (name == "stdout") ifd = 1;
+	 else if (name == "stderr") ifd = 2;
+	 else continue;
+	 }
+	if (ifd == 0) defflags = O_RDONLY|O_NOCTTY;
+	if ((ifd == 1) || (ifd == 2)) defflags = O_WRONLY|O_TRUNC|O_CREAT|O_NOCTTY;
+
+	value = get_struct_field (q, name);
+	if (typeof(value) == String_Type)
+	 {
+	 (flags, file) = parse_redir (value);
+	 if (file == "")
+	 throw InvalidParmError, "Invalid redirection: $value";
+
+	 if (flags == 0) flags = defflags;
+
+	 if (flags & O_CREAT)
+	 fd = open (file, flags, S_RWUGO);
+	 else
+	 fd = open (file, flags);
+
+	 if (fd == NULL)
+	 throw OpenError, sprintf ("%s: %s", file, errno_string ());
+	 }
+	else if (typeof(value) == FD_Type)
+	 {
+	 fd = value;
+	 }
+	else if (typeof(value) == File_Type)
+	 {
+	 fd = fileno (value);
+	 }
+	else
+	 {
+	 fd = @FD_Type(value);
+	 }
+
+	if (fd == NULL)
+	 throw OSError, "fd$ifd: "$ + errno_string();
+
+	redir_fds = redir_fds, fd;
+	redir_ifds = redir_ifds, ifd;
+ }
+
+ return (redir_fds, redir_ifds);
+}
+
+% parse dipN=M qualifiers
+private define parse_dup_qualifiers (q)
+{
+ variable open_fds = FD_Type0, wanted_ifds = Int_Type0;
+
+ if (q == NULL)
+ return open_fds, wanted_ifds;
+
+ foreach (get_struct_field_names (q))
+ {
+	variable name = ();
+	variable fd, ifd, value;
+	if ((1 != sscanf (name, "dup%d", &ifd))
+	 || (name != sprintf ("dup%d", ifd)))
+	 continue;
+
+	value = get_struct_field (q, name);
+	if (typeof (value) == File_Type)
+	 fd = fileno (value);
+	else if (typeof (value) == FD_Type)
+	 fd = value;
+	else
+	 fd = @FD_Type(value);
+	if (fd == NULL)
+	 throw OSError, "fd$ifd: "$ + errno_string();
+
+	open_fds = open_fds, fd;
+	wanted_ifds = wanted_ifds, ifd;
+ }
+ return open_fds, wanted_ifds;
+}
+
+% Here, open_fds is an array of all (known) open FD_Type objects, and open_ifds
+% is the corresponding array of integer descriptors. Starting at the
+% index idx_offset, dup2 the FD_Type objects onto the array of
+% wanted_ifds. If a wanted_ifd is associated with an open descriptor,
+% then that will be duped to a new integer descriptor.
+private define dup2_open_fds (wanted_ifds, open_ifds, open_fds, idx_offset)
+{
+ variable i, ifd, fd;
+ _for i (0, length(wanted_ifds)-1, 1)
+ {
+	ifd = wanted_ifdsi;
+
+	i += idx_offset;
+	variable j = wherefirst (open_ifds == ifd);
+	if (j != NULL)
+	 {
+	 if (j == i)
+	 continue;
+	 fd = dup_fd (open_fdsj);
+	 if (fd == NULL)
+	 throw OSError, "dup_fd failed: " + errno_string ();
+	 open_ifdsj = _fileno(fd);
+	 open_fdsj = fd;
+	 }
+
+	if (-1 == dup2_fd (open_fdsi, ifd))
+	 throw OSError, "dup2_fd failed: " + errno_string ();
+
+	open_fdsi = @FD_Type(ifd);
+	open_ifdsi = ifd;
+ }
+}
+
+private define exec_child (argv, child_fds, required_child_ifds)
+{
+ variable i, j, fd, ifd;
+
+ % The child pipe ends will need to be dup2'd to the corresponding
+ % integers. Care must be exercised to not stomp on pipe descriptors
+ % that have the same values.
+ % Note: The first on in the list is the traceback fd
+ variable child_open_ifds = array_map (Int_Type, &_fileno, child_fds);
+ dup2_open_fds (required_child_ifds, child_open_ifds, child_fds, 1);
+
+ if (__qualifiers != NULL)
+ {
+	% Handle the fdN=foo qualifiers, e.g., fd0="file", fd1=3
+	variable redir_fds, wanted_redir_ifds;
+	(redir_fds, wanted_redir_ifds) = open_redirect_files (__qualifiers);
+
+	variable ofs = length (child_open_ifds);
+	child_fds = child_fds, redir_fds;
+	child_open_ifds = child_open_ifds,
+			 array_map (Int_Type, &_fileno, redir_fds);
+	redir_fds = NULL;	 % decrement ref-counts
+	dup2_open_fds (wanted_redir_ifds, child_open_ifds, child_fds, ofs);
+
+	% Now handle the dupN=M qualifiers. Here, M must already be
+	% open in the child, and N will be duped from it. Note: M
+	% could be inherited from the parent, and as such may not be
+	% in the child_open_ifds list.
+	variable fdMs, ifdMs, ifdNs;
+	(fdMs, ifdNs) = parse_dup_qualifiers (__qualifiers);
+	variable num_aliased = length (ifdNs);
+	if (num_aliased)
+	 {
+	 ifdMs = array_map (Int_Type, &_fileno, fdMs);
+	 % Note the padding. This is because there are not yet open
+	 % descriptors that correspond to the ifdNs
+	 child_fds = child_fds, fdMs, fdMs;
+	 child_open_ifds = child_open_ifds, ifdMs, Int_Typenum_aliased-1;
+	 dup2_open_fds (ifdNs, child_open_ifds, child_fds, length(child_fds)-num_aliased);
+	 }
+ }
+
+ variable hook = qualifier ("pre_exec_hook");
+ if (hook != NULL)
+ {
+	variable hook_arg = qualifier ("pre_exec_hook_optarg");
+	% Call the hook. Pass it the list of open descriptors. All others
+	% will be closed.
+	variable list = {};
+	foreach ifd (child_open_ifds) list_append (list, ifd);
+	if (hook_arg == NULL)
+	 (@hook)(list);
+	else
+	 (@hook)(list, hook_arg);
+
+	child_open_ifds = list_to_array (list);
+ }
+
+ variable close_mask = Char_TypeOPEN_MAX+1;
+ close_mask 3: = 1;
+ foreach ifd (child_open_ifds) close_maskifd = 0;
+ _for ifd (0, length(close_mask)-1, 1)
+ {
+	if (close_maskifd) () = _close (ifd);
+ }
+
+ () = execvp (argv0, argv);
+ throw OSError, "exec failed: " + argv0 + " : " + errno_string ();
+}
+
+private define wait_method ()
+{
+ variable options = 0, s;
+
+ if (_NARGS == 2)
+ options = ();
+ s = ();
+
+ if (s.pid == -1)
+ return NULL;
+
+ return waitpid (s.pid, options);
+}
+
+define new_process ()
+{
+ if (_NARGS != 1)
+ {
+	usage ("obj = new_process(pgm, args... ;qualifiers)");
+ }
+
+ variable argv = ();
+ if (typeof (argv) == List_Type)
+ argv = list_to_array (argv);
+ if (typeof (argv) != Array_Type)
+ argv = argv;
+
+ variable read_ifds = qualifier("read", Int_Type0);
+ variable write_ifds = qualifier("write", Int_Type0);
+
+ if (typeof (read_ifds) == List_Type)
+ read_ifds = list_to_array (read_ifds);
+ if (typeof (write_ifds) == List_Type)
+ write_ifds = list_to_array (write_ifds);
+
+ variable numfds = length(read_ifds) + length(write_ifds);
+ variable parent_fds = FD_Typenumfds+1; % +1 for traceback fd
+ variable child_fds = FD_Typenumfds+1;
+ variable modes = String_Typenumfds+1;
+
+ variable ifd, r, w;
+
+ % The read and write fds become pipes to the child and are returned
+ % as structure fields.
+ variable i = 0;
+
+ % The 0th one is used to commmunicate error messages
+ (parent_fdsi, child_fdsi) = pipe (); i++;
+ variable fd = child_fds0;
+ () = fcntl_setfd (fd, fcntl_getfd (fd) | FD_CLOEXEC);
+ fd = NULL;			 % remove reference to it.
+
+ variable child_ifds = read_ifds, write_ifds;
+ variable struct_fields = {};
+ foreach ifd (read_ifds)
+ {
+	list_append (struct_fields,"fd$ifd"$);
+	list_append (struct_fields,"fp$ifd"$);
+	modesi = "w";
+	(child_fdsi, parent_fdsi) = pipe (); i++;
+ }
+
+ foreach ifd (write_ifds)
+ {
+	list_append (struct_fields,"fd$ifd"$);
+	list_append (struct_fields,"fp$ifd"$);
+	modesi = "r";
+	(parent_fdsi, child_fdsi) = pipe (); i++;
+ }
+
+ variable pid = fork ();
+ if (pid == 0)
+ {
+	variable e;
+	try (e)
+	 {
+	 variable dir = qualifier ("dir");
+	 if (dir != NULL)
+	 {
+		 if (-1 == chdir (dir))
+		 throw OSError, "chdir: " + errno_string ();
+	 }
+
+	 % We do not need the parent descriptors, so close them.
+	 parent_fds = NULL;
+	 exec_child (argv, child_fds, child_ifds;; __qualifiers);
+	 }
+	catch AnyError:
+	 {
+	 fd = child_fds0;
+	 () = write (fd, sprintf ("%S:%S:%S\n", e.file, e.line, e.message));
+	 () = write (fd, sprintf ("Traceback:\n%S\n", e.traceback));
+	 fd = NULL;
+	 }
+	_exit (1);
+ }
+ variable other_struct_fields = "pid", "wait";
+ child_fds = NULL;
+
+ if (length (struct_fields) == 0)
+ struct_fields = String_Type0;
+ else
+ struct_fields = list_to_array (struct_fields);
+ variable s = @Struct_Type(struct_fields, other_struct_fields);
+
+ _for i (0, length (child_ifds)-1, 1)
+ {
+	ifd = child_ifdsi;
+	fd = parent_fdsi+1;	 % parent_fds0 used for errors
+	set_struct_field (s, "fd$ifd"$, fd);
+	variable fp = fdopen (fd, modesi+1);
+	if (fp == NULL)
+	 throw OpenError, "fdopen failed on child descriptor $ifd"$;
+	set_struct_field (s, "fp$ifd"$, fp);
+ }
+ s.pid = pid;
+ s.wait = &wait_method;
+ variable errmsg = "";
+ variable derrmsg;
+ while (read (parent_fds0, &derrmsg, 512) > 0)
+ {
+	errmsg += derrmsg;
+ }
+ if (errmsg != "")
+ throw OSError, errmsg;
+
+ return s;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/profile.sl Added

@@ -0,0 +1,753 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+% See the slprof script for an example of using the profiler.
+%
+_boseos_info=0;
+_bofeof_info=0;
+
+%public variable __DEBUG_PROFILE_;
+
+% For lines
+private variable Profile_Info_Type = struct
+{
+ name,			 % (bos/eof)
+ num_called,			 % (bos/bof) num times line called
+ num_s_triggered,		 % (eof/eof) num child statements
+ num_f_triggered,		 % (eof/eof) num functions triggered
+ num_self_f,			 % (eos/) num functions directly called
+ num_self_s,			 % num statements directly called
+ self_time,			 % (eos/eof)
+ cum_time,			 % (eos/eof)
+};
+Profile_Info_Type.num_called = 0;
+Profile_Info_Type.num_s_triggered = 0;
+Profile_Info_Type.num_f_triggered = 0;
+Profile_Info_Type.num_self_f = 0;
+Profile_Info_Type.num_self_s = 0;
+Profile_Info_Type.self_time = 0.0;
+Profile_Info_Type.cum_time = 0.0;
+
+private variable L_Info_Table;
+private variable F_Info_Table;
+
+private define convert_profile_info_to_array (p)
+{
+ variable keys = assoc_get_keys (p);
+ variable i, n = length (p);
+
+ % Filter out the bad entries
+ _for i (0, n-1, 1)
+ {
+	if (keysi == "")	 % Dummy
+	 assoc_delete_key (p, keysi);
+ }
+ n = length (p);
+ keys = assoc_get_keys (p);
+
+ variable s = @Profile_Info_Type;
+ s.num_called = Int_Typen;
+ s.num_s_triggered = Int_Typen;
+ s.num_f_triggered = Int_Typen;
+ s.num_self_f = Int_Typen;
+ s.num_self_s = Int_Typen;
+ s.self_time = Double_Typen;
+ s.cum_time = Double_Typen;
+ s.name = keys;
+
+ variable vals = assoc_get_values (p);
+ _for i (0, n-1, 1)
+ {
+	variable v = valsi;
+	s.num_calledi = v.num_called;
+	s.num_s_triggeredi = v.num_s_triggered;
+	s.num_f_triggeredi = v.num_f_triggered;
+	s.num_self_fi = v.num_self_f;
+	s.num_self_si = v.num_self_s;
+	s.self_timei = v.self_time;
+	s.cum_timei = v.cum_time;
+ }
+ return s;
+}
+
+private define new_l_info (name)
+{
+ variable l = @Profile_Info_Type;
+ L_Info_Tablename = l;
+ l.name = name;
+ return l;
+}
+
+private define new_f_info (name)
+{
+ variable finfo = @Profile_Info_Type;
+ F_Info_Tablename = finfo;
+ finfo.name = name;
+ return finfo;
+}
+
+private variable Function_Stack_Type = struct
+{
+ f_info,
+ s_counter,
+ f_counter,
+ self_s_counter,
+ self_time,
+ cum_time,
+};
+private variable Function_Stack;
+
+private variable Line_Stack_Type = struct
+{
+ l_info,
+ s_counter,
+ f_counter,
+ self_f_counter,
+ self_time,
+ cum_time,
+};
+private variable Line_Stack;
+
+private variable L_Info;
+private variable L_S_Counter;	 % bos/eof
+private variable L_F_Counter;	 % bos/eof
+private variable L_Self_Time;	 % bof/eof
+private variable L_Cum_Time;	 % bof/eof
+
+private variable F_Info;
+private variable F_S_Counter;	 % bof
+private variable F_F_Counter;	 % bof
+private variable F_Self_S;	 % bos
+private variable F_Self_Time;	 % bos/eos
+private variable F_Cum_Time;	 % bos/eos
+
+private variable Num_Statement_Counts;
+private variable Num_Fun_Calls;
+private variable Tstart;
+
+private variable Null_Struct = struct {dummy};
+
+private variable BOS_Depth;
+private variable BOS_Stack_Depth;
+private define push_line_info ()
+{
+ variable s = @Line_Stack_Type;
+ s.l_info = L_Info;
+ s.s_counter = L_S_Counter;
+ s.f_counter = L_F_Counter;
+ s.self_time = L_Self_Time;
+ s.cum_time = L_Cum_Time;
+ list_append (Line_Stack, s);
+ BOS_Stack_Depth++;
+}
+
+private define pop_line_info ()
+{
+ variable s = list_pop (Line_Stack, -1);
+ L_Info = s.l_info;
+ L_Self_Time = s.self_time;
+ L_Cum_Time = s.cum_time;
+
+ L_Info.num_self_f++;
+ L_Info.num_s_triggered += (Num_Statement_Counts - s.s_counter);
+ L_Info.num_f_triggered += (Num_Fun_Calls - s.f_counter);
+ L_F_Counter = Num_Fun_Calls;
+ L_S_Counter = Num_Statement_Counts;
+ BOS_Stack_Depth--;
+}
+
+% This variable tracks sequential calls to the BOS and EOS handlers
+% This can happen when profiled code calls non-profiled, which calls
+% profiled.
+private variable Last_Was_BOS_EOS = 0;
+private variable Dummy_L_Info;
+
+private define bos_handler (file, line)
+{
+ variable dt = toc() - Tstart;
+
+ F_Cum_Time += dt;
+ F_Self_Time += dt;
+ F_Self_S++;
+ if (BOS_Depth >= BOS_Stack_Depth)
+ {
+#ifexists __DEBUG_PROFILE_
+	%vmessage ("# bos pushing (%d,%d)", BOS_Depth,BOS_Stack_Depth);
+#endif
+	L_Cum_Time += dt;
+	L_Self_Time += dt;
+	push_line_info ();
+ }
+ BOS_Depth = BOS_Stack_Depth;
+
+ Num_Statement_Counts++;
+
+ file = sprintf ("%s:%d", file, line);
+ variable l = L_Info_Tablefile;
+ if (l == Null_Struct)
+ l = new_l_info (file);
+
+ l.num_called++;
+
+ L_Info = l;
+ L_S_Counter = Num_Statement_Counts;
+ L_F_Counter = Num_Fun_Calls;
+ L_Self_Time = 0.0;
+ L_Cum_Time = 0.0;
+
+#ifexists __DEBUG_PROFILE_
+ vmessage ("BOS: (%d, %d) %S", BOS_Depth, BOS_Stack_Depth, file);
+#endif
+ Tstart = toc ();
+}
+
+private define eos_handler ()
+{
+ variable dt = toc()-Tstart;
+
+ if (BOS_Depth < BOS_Stack_Depth)
+ {
+#ifexists __DEBUG_PROFILE_
+	%vmessage ("# eos popping (%d,%d)", BOS_Depth,BOS_Stack_Depth);
+#endif
+	pop_line_info ();
+ }
+ BOS_Depth--;
+
+ L_Self_Time += dt;
+ L_Cum_Time += dt;
+ F_Cum_Time += L_Cum_Time;
+ F_Self_Time += L_Self_Time;
+
+ L_Info.self_time += L_Self_Time;
+ L_Info.cum_time += L_Cum_Time;
+
+#ifexists __DEBUG_PROFILE_
+ vmessage ("EOS: (%d,%d) %S", BOS_Depth, BOS_Stack_Depth, L_Info.name);
+#endif
+
+ % This is necessary if a BOF/EOF sequence follows to avoid another
+ % push/pop of this object since
+ if (Last_Was_BOS_EOS == -1)
+ L_Info = Dummy_L_Info;
+
+ Last_Was_BOS_EOS = -1;
+ Tstart = toc();
+}
+
+private define bof_handler (fun, file)
+{
+ variable dt = toc () - Tstart;
+ Num_Fun_Calls++;
+
+#ifexists __DEBUG_PROFILE_
+ %vmessage ("# bof pushing (%d,%d)", BOS_Depth,BOS_Stack_Depth);
+#endif
+ L_Self_Time += dt;
+ L_Cum_Time += dt;
+ push_line_info ();
+ %BOS_Stack_Depth++;
+
+ variable f = @Function_Stack_Type;
+ f.f_info = F_Info;
+ f.s_counter = F_S_Counter;
+ f.f_counter = F_F_Counter;
+ f.self_time = F_Self_Time;
+ f.self_s_counter = F_Self_S;
+ f.cum_time = F_Cum_Time;
+ list_append (Function_Stack, f);
+
+ file = sprintf ("%S:%S", fun, file);
+ variable f_info = F_Info_Tablefile;
+ if (f_info == Null_Struct)
+ f_info = new_f_info (file);
+ f_info.num_called++;
+
+ F_Info = f_info;
+ F_S_Counter = Num_Statement_Counts;
+ F_F_Counter = Num_Fun_Calls;
+ F_Cum_Time = 0.0;
+ F_Self_Time = 0.0;
+ F_Self_S = 0;
+
+#ifexists __DEBUG_PROFILE_
+ vmessage ("BOF: (%d,%d) %S", BOS_Depth, BOS_Stack_Depth, file);
+#endif
+ Tstart = toc ();
+}
+
+private define eof_handler ()
+{
+ variable dt = toc() - Tstart;
+
+#ifexists __DEBUG_PROFILE_
+ %vmessage ("# eof popping (%d,%d)", BOS_Depth,BOS_Stack_Depth);
+#endif
+ F_Cum_Time += dt;
+ F_Self_Time += dt;
+ F_Info.cum_time += F_Cum_Time;
+ F_Info.self_time += F_Self_Time;
+ F_Info.num_s_triggered += (Num_Statement_Counts - F_S_Counter);
+ F_Info.num_f_triggered += (Num_Fun_Calls - F_F_Counter);
+ F_Info.num_self_s += F_Self_S;
+
+ pop_line_info ();
+ % Add on time spent in the function to this line's value
+ L_Cum_Time += F_Cum_Time;
+
+#ifexists __DEBUG_PROFILE_
+ vmessage ("EOF: (%d,%d) %S", BOS_Depth, BOS_Stack_Depth, F_Info.name);
+#endif
+
+ variable f = list_pop (Function_Stack, -1);
+ F_Info = f.f_info;
+ F_Info.num_self_f++;
+ F_S_Counter = f.s_counter;
+ F_F_Counter = f.f_counter;
+ F_Self_Time = f.self_time;
+ F_Self_S = f.self_s_counter;
+ F_Cum_Time = f.cum_time;
+
+ %F_Cum_Time += dt;
+ %F_Self_Time += dt;
+
+ Tstart = toc();
+}
+
+% In function-only mode, lines are not profiled. The self-time of the
+% function is its cumulative time minus the cumulative times of the
+% functions that it directly calls. The F_Self_Time variable will
+% track those.
+private define f_bof_handler (fun, file)
+{
+ variable dt = toc () - Tstart;
+ Num_Fun_Calls++;
+
+ variable f = @Function_Stack_Type;
+ f.f_info = F_Info;
+ f.f_counter = F_F_Counter;
+ f.self_time = F_Self_Time;
+ f.cum_time = F_Cum_Time + dt;
+ list_append (Function_Stack, f);
+
+ file = sprintf ("%S:%S", fun, file);
+ variable f_info = F_Info_Tablefile;
+ if (f_info == Null_Struct)
+ f_info = new_f_info (file);
+ f_info.num_called++;
+
+ F_Info = f_info;
+ F_F_Counter = Num_Fun_Calls;
+ F_Cum_Time = 0.0;
+ F_Self_Time = 0.0;
+
+ Tstart = toc ();
+}
+
+private define f_eof_handler ()
+{
+ variable dt = toc() - Tstart;
+
+ F_Cum_Time += dt;
+ F_Info.cum_time += F_Cum_Time;
+ F_Info.self_time += (F_Cum_Time - F_Self_Time);
+ F_Info.num_f_triggered += (Num_Fun_Calls - F_F_Counter);
+
+ variable f = list_pop (Function_Stack, -1);
+ F_Info = f.f_info;
+ F_Info.num_self_f++;
+ F_F_Counter = f.f_counter;
+ F_Self_Time = f.self_time + F_Cum_Time;
+ F_Cum_Time += f.cum_time;
+
+ Tstart = toc();
+}
+
+% Usage: profile_on (do_line_profile)
+define profile_on ()
+{
+ _boseos_info = 0;
+ _bofeof_info = 1;
+ if (_NARGS)
+ {
+	variable arg = ();
+	if (arg)
+	 _boseos_info = 3;
+ }
+}
+
+define profile_off ()
+{
+ _boseos_info = 0;
+ _bofeof_info = 0;
+}
+
+private define setup_profiler_variables ()
+{
+ L_Info_Table = Assoc_TypeStruct_Type, Null_Struct;
+ F_Info_Table = Assoc_TypeStruct_Type, Null_Struct;
+ Line_Stack = {};
+ Function_Stack = {};
+
+ Dummy_L_Info = new_l_info ("");
+ L_Info = Dummy_L_Info;
+ L_S_Counter = 0;
+ L_F_Counter = 0;
+ L_Self_Time = 0;
+ L_Cum_Time = 0;
+
+ F_Info = new_f_info ("");
+ F_S_Counter = 0;
+ F_F_Counter = 0;
+ F_Self_Time = 0;
+ F_Self_S = 0;
+ F_Cum_Time = 0;
+
+ Tstart = 0;
+ Num_Statement_Counts = 0;
+ Num_Fun_Calls = 0;
+ BOS_Stack_Depth=0;
+ BOS_Depth=0;
+}
+
+define profile_begin ()
+{
+ variable arg = 0;
+ if (_NARGS)
+ arg = ();
+ if (arg)
+ {
+	()=_set_bos_handler (&bos_handler);
+	()=_set_eos_handler (&eos_handler);
+	()=_set_bof_handler (&bof_handler);
+	()=_set_eof_handler (&eof_handler);
+ }
+ else
+ {
+	()=_set_bos_handler (NULL);
+	()=_set_eos_handler (NULL);
+	()=_set_bof_handler (&f_bof_handler);
+	()=_set_eof_handler (&f_eof_handler);
+ }
+ setup_profiler_variables ();
+ profile_on (arg);
+ tic ();
+}
+
+define profile_end ()
+{
+ ()=_set_bos_handler (NULL);
+ ()=_set_eos_handler (NULL);
+ ()=_set_bof_handler (NULL);
+ ()=_set_eof_handler (NULL);
+ profile_off ();
+}
+
+% Calibration Notes:
+%
+% If the execution of a statememt causes M other statements to
+% execute and N function calls, then the amount of profiler overhead
+% is given by
+%
+% N*dF + M*dS
+%
+% where dF is the amount of overhead per function call for running
+% the bof/eof-handlers, and dS is the overhead per statement in
+% running the bos/eos-handlers.
+%
+% The timers used to measure the amount of time spent in a function
+% or statement are stopped when a handler is called, and started
+% again when the handler returns. This introduces systematic error
+% in the measurements. Call dt_S the systematic error introduced by
+% bos/eos handlers and dt_F systematic error from the bof/eof handlers.
+% Then the observed time as given by the interval times is related to
+% the "true" time t via
+%
+% t_obs = t + N*dt_F + M*dt_S + dt_S
+%
+% The self-time of the statement t_self is determined through an
+% interval timer that stops when a function is called, and starts
+% again after the function returns. If the statement makes N_self
+% direct function calls, then t_self is related to its observed
+% self-time t_self_obs by
+%
+% t_self_obs = t_self + N_self*dt_F + dt_S
+%
+% The self-time of a function is the sum of the self-times of the
+% individual statements that were executed directly by the function.
+% Suppose the function executes M_self statements that in turn
+% directly call a total of N_self functions. Then, for functions it
+% follows that:
+%
+% t_self_obs_f = t_self_f + N_self*dt_F + M_self*dt_S + dt_F
+%
+% where the last term accounts for the overhead of the bof/eof
+% handler for the function itself.
+%
+% ----------------------------------------------------------------
+%
+% The values dF, dS, dt_S, and dt_F can be determined as follows:
+%
+% With no handlers in place, t can be accurately measured and can be
+% considered t be a known quantity. Suppose the statement has no
+% function calls and let that statement be executed a very large
+% number of times B with handlers in place. Then the elapsed time
+% t_elapsed as given by the wallclock will be given by
+%
+% t_elapsed = B*(t+dS) ===> dS = (t_elapsed - B*t)/B
+%
+% The total measured or observed time t_obs, as given by the
+% profiler's starting and stopping of the clock upon each execution
+% will be given by
+%
+% t_obs = B*(t+dt_S) ===> dt_S = (t_obs - B*t)/B
+%
+% If the statement is just a function call to a function that does
+% nothing, then
+%
+% t_elapsed = B*(t + dS + dF)
+%
+% Using the prior determination of dS, we obtain
+%
+% dF = t_elapsed/B - t - dS
+%
+% For just a single function call with no arguments, the self-time is
+% defined to be 0. So:
+%
+% t_self_obs = 0 + 1*dt_F + dt_S ==> dt_F = t_self_obs-dt_S
+%
+private variable Overhead_Per_Statement = 0.0; % dS
+private variable Error_Per_Statement = 0.0; % dt_S
+private variable Overhead_Per_Function = 0.0; % dF
+private variable Error_Per_Function = 0.0; % dt_F
+
+profile_off ();
+
+private define cal_nop_0 ();
+private define cal_f_0 (n)
+{
+ loop (n)
+ {
+	cal_nop_0(); cal_nop_0(); cal_nop_0(); cal_nop_0(); cal_nop_0();
+	cal_nop_0(); cal_nop_0(); cal_nop_0(); cal_nop_0(); cal_nop_0();
+	cal_nop_0(); cal_nop_0(); cal_nop_0(); cal_nop_0(); cal_nop_0();
+	cal_nop_0(); cal_nop_0(); cal_nop_0(); cal_nop_0(); cal_nop_0();
+ }
+}
+
+private define cal_s_0 (n)
+{
+ loop (n)
+ {
+	() = 1;	() = 1;	() = 1;	() = 1; () = 1;
+	() = 1;	() = 1;	() = 1;	() = 1; () = 1;
+	() = 1;	() = 1;	() = 1;	() = 1; () = 1;
+	() = 1;	() = 1;	() = 1;	() = 1; () = 1;
+ }
+}
+
+profile_on (1);
+
+private define cal_nop_1 ();
+private define cal_f_1 (n)
+{
+ loop (n)
+ {
+	cal_nop_1(); cal_nop_1(); cal_nop_1(); cal_nop_1(); cal_nop_1();
+	cal_nop_1(); cal_nop_1(); cal_nop_1(); cal_nop_1(); cal_nop_1();
+	cal_nop_1(); cal_nop_1(); cal_nop_1(); cal_nop_1(); cal_nop_1();
+	cal_nop_1(); cal_nop_1(); cal_nop_1(); cal_nop_1(); cal_nop_1();
+ }
+}
+private define cal_s_1 (n)
+{
+ loop (n)
+ {
+	() = 1;	() = 1;	() = 1;	() = 1; () = 1;
+	() = 1;	() = 1;	() = 1;	() = 1; () = 1;
+	() = 1;	() = 1;	() = 1;	() = 1; () = 1;
+	() = 1;	() = 1;	() = 1;	() = 1; () = 1;
+ }
+}
+profile_off ();
+
+#ifnexists sum
+private define sum (x)
+{
+ variable s = 0.0;
+ foreach (x) s += ();
+ return s;
+}
+#endif
+
+define profile_calibrate ()
+{
+#ifexists __DEBUG_PROFILE_
+ return;
+#endif
+ if (_NARGS == 0) 1000;
+ variable n1 = ();
+ variable n0 = 100*n1;
+
+ tic();
+ cal_s_0 (n0);
+ variable t0 = toc;
+ variable t_expected = ((t0*n1)/n0); % when done n1 times
+
+ profile_begin (1);
+ tic ();
+ cal_s_1 (n1);
+ variable t_elapsed = toc ();
+ profile_end ();
+
+ variable s = convert_profile_info_to_array (L_Info_Table);
+ variable num = sum (s.num_called);
+ variable t_obs = sum(s.cum_time);
+ Error_Per_Statement = (t_obs - t_expected)/num;
+ Overhead_Per_Statement = (t_elapsed-t_expected)/num;
+
+ % Now calibrate the function call overhead
+ tic();
+ cal_f_0(n0);
+ t0 = toc;
+ t_expected = ((t0*n1)/n0); % when done n1 times
+
+ profile_begin (1);
+ tic ();
+ cal_f_1 (n1);
+ t_elapsed = toc ();
+ profile_end ();
+
+ %variable f = convert_func_info_to_array ();
+ s = convert_profile_info_to_array (L_Info_Table);
+ num = sum (s.num_called);
+ Overhead_Per_Function = (t_elapsed - t_expected)/num - Overhead_Per_Statement;
+ t_obs = sum(s.self_time);
+ Error_Per_Function = t_obs/num - Error_Per_Statement;
+ if (Error_Per_Function < 0)
+ Error_Per_Function = 0.0;
+}
+
+private define profile_report_lines (fp, s)
+{
+ s.cum_time -= (Error_Per_Statement * (s.num_called + s.num_s_triggered)
+		 + s.num_f_triggered * Error_Per_Function);
+ s.self_time -= (Error_Per_Statement * s.num_called
+		 + s.num_self_f * Error_Per_Function);
+
+ variable rates = s.cum_time/s.num_called;
+ variable i = array_sort (s.self_time);
+ %variable i = array_sort (s.cum_time);
+ array_reverse (i);
+ rates = ratesi;
+ variable num_called = s.num_calledi;
+ variable self_time = s.self_timei;
+ variable cum_time = s.cum_timei;
+ variable num_self_f = s.num_self_fi;
+ variable num_s_triggered = s.num_s_triggeredi;
+ variable num_f_triggered = s.num_f_triggeredi;
+ variable name = s.namei;
+
+#iffalse
+ variable total_counts = sum(num_called);
+ variable total_calls = sum(num_self_f);
+ () = fprintf (fp, "#Number of profiled statements executed: %g\n", total_counts);
+ () = fprintf (fp, "#Number of profiled function calls: %g\n", total_calls);
+ () = fprintf (fp, "#Profiler Overhead per statement: %g ms\n", Overhead_Per_Statement*1e3);
+ () = fprintf (fp, "#Profiler Overhead per function : %g ms\n", Overhead_Per_Function*1e3);
+ () = fprintf (fp, "#Profiler Error per statement : %g ms\n", Error_Per_Statement*1e3);
+ () = fprintf (fp, "#Profiler Error per function : %g ms\n", Error_Per_Function*1e3);
+ () = fprintf (fp, "#Total Profiler Overhead: %g secs\n",
+		 total_counts * Overhead_Per_Statement + total_calls*Overhead_Per_Function);
+ () = fprintf (fp, "\n\n");
+#endif
+
+ () = fprintf (fp, "#ncalls ms/call totalselfms totalsecs Fcalls Scalls File:line\n");
+ % 1234567 1234567890AB 1234567890AB 1234567890AB 1234567 1234567
+ _for i (0, length(rates)-1, 1)
+ {
+	() = fprintf (fp, "%7d %12.5f %12.5f %12.5f %7d %7d %s\n",
+		 num_calledi, ratesi*1e3, self_timei*1e3,
+		 cum_timei, num_f_triggeredi, num_s_triggeredi, namei);
+ }
+}
+
+private define profile_report_funcs (fp, s)
+{
+#ifnfalse
+ s.cum_time -= (Error_Per_Statement * s.num_s_triggered
+		 + s.num_f_triggered * Error_Per_Function);
+ s.self_time -= (Error_Per_Statement * s.num_self_s
+		 + s.num_self_f * Error_Per_Function);
+#endif
+ variable rates = s.cum_time/s.num_called;
+ variable i = array_sort (s.self_time);
+ %variable i = array_sort (s.cum_time);
+ array_reverse (i);
+ rates = ratesi;
+ variable num_called = s.num_calledi;
+ variable self_time = s.self_timei;
+ variable cum_time = s.cum_timei;
+ variable num_self_f = s.num_self_fi;
+ variable num_self_s = s.num_self_si;
+ variable num_s_triggered = s.num_s_triggeredi;
+ variable num_f_triggered = s.num_f_triggeredi;
+ variable name = s.namei;
+
+ () = fprintf (fp, "#function ncalls ms/call totalselfms totalsecs Function File\n");
+ % 123456789012345678901234 1234567 1234567890AB 1234567890AB 1234567890AB
+ _for i (0, length(rates)-1, 1)
+ {
+	variable func_file = namei;
+	variable j = is_substr (func_file, ":");
+	variable func = substr (func_file, 1, j-1);
+	variable file = substr (func_file, j+1, -1);
+	() = fprintf (fp, "%-24s %7d %12.4f %12.4f %12.4f %7d %7d %s\n",
+		 func,
+		 num_calledi, ratesi*1e3, self_timei*1e3,
+		 cum_timei, num_self_fi, num_self_si,
+		 file
+		 );
+ }
+}
+
+private define output_title (fp, title)
+{
+ variable s = "----------------------------------------------------------------";
+ variable spaces = "";
+ loop ((strlen(s) - strlen(title))/2)
+ spaces = strcat (spaces, " ");
+ () = fprintf (fp, "\n#%s\n#%s%s\n#%s\n\n", s, spaces, title, s);;
+}
+
+define profile_report (file)
+{
+ if (0 == __is_initialized (&L_Info_Table))
+ return;
+
+ variable fp = file;
+ if (typeof (file) == String_Type)
+ fp = fopen (fp, "w");
+
+ variable f = convert_profile_info_to_array (F_Info_Table);
+ if (length (f.cum_time))
+ {
+	output_title (fp, "Function Call Profile Report");
+	profile_report_funcs (fp, f);
+ }
+
+ variable s = convert_profile_info_to_array (L_Info_Table);
+ if (length (s.cum_time))
+ {
+	output_title (fp, "Line by Line Profile Report");
+	profile_report_lines (fp, s);
+ }
+
+ ifnot (_eqs (fp,file))
+ () = fclose (fp);
+}
+
+provide ("profile");

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/readascii.sl Added

@@ -0,0 +1,233 @@
+% Simple ascii file reader
+% Copyright (C) 2007-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+
+private define allocate_array_of_arrays (list, num)
+{
+ variable n = length (list);
+ variable array_list = Array_Typen;
+ _for (0, n-1, 1)
+ {
+	variable j = ();
+	array_listj = typeof(listj)num;
+ }
+ return array_list;
+}
+
+define readascii ()
+{
+ if (_NARGS < 2)
+ {
+	usage ("nrows = %s (file, &a1,...; qualifiers);\nQualifiers:\n"
+	 + "nrows=int, ncols=int, format=string, skip=int, maxlines=int, delim=string\n"
+	 + "size=int, dsize=int, stop_on_mismatch, lastline=&var lastlinenum=&var\n"
+	 + "type=string, cols=array, comment=string, as_list\n",
+	 _function_name);
+ }
+
+ variable nrows = qualifier ("nrows", NULL);
+ variable ncols = qualifier ("ncols", NULL);
+ variable fmt = qualifier ("format", NULL);
+ variable skip = qualifier ("skip", 0);
+ variable maxlines = qualifier ("maxlines", NULL);
+ variable delim = qualifier ("delim", " ");
+ variable init_size = qualifier("size", NULL);
+ variable dsize = qualifier ("dsize", NULL);
+ variable stop_on_mismatch = qualifier_exists ("stop_on_mismatch");
+ variable linep = qualifier ("lastline", NULL);
+ variable linenump = qualifier ("lastlinenum", NULL);
+ variable comment = qualifier ("comment", NULL);
+ variable want_columns = qualifier("cols", NULL);
+ variable type=qualifier("type", "lf"); % Double_Type
+ variable is_list = qualifier_exists ("as_list");
+
+ if (comment != NULL)
+ variable comment_len = strbytelen (comment);
+
+ if (skip < 0)
+ skip = 0;
+
+ variable has_ncols_qualifier = 0;
+ variable arg_refs;
+
+ if (ncols != NULL)
+ {
+	has_ncols_qualifier = 1;
+	if (_NARGS != 2)
+	 throw UsageError, "The ncols qualifier is incompatible with more than one reference arg";
+	arg_refs = ();
+ }
+ else
+ {
+	arg_refs = __pop_list (_NARGS-1);
+	ncols = length (arg_refs);
+ }
+ variable fp = ();
+
+ if (want_columns != NULL)
+ ncols = length (want_columns);
+
+ if (fmt == NULL)
+ {
+	type = strtrim_beg (type, "%");
+	if (want_columns != NULL)
+	 {
+	 fmt = String_Typemax(want_columns);
+	 fmt* = strcat ("%*", type);
+	 fmtwant_columns-1 = strcat ("%", type);
+	 }
+	else
+	 {
+	 fmt = String_Typencols;
+	 fmt* = strcat ("%", type);
+	 }
+
+	fmt = strjoin (fmt, delim);
+ }
+
+ variable fp_is_array = 0;
+ switch (typeof (fp))
+ {
+ case Array_Type or case List_Type:
+	if ((maxlines == NULL) || (maxlines > length (fp)))
+	 maxlines = length (fp);
+	fp_is_array = 1;
+ }
+ {
+ case File_Type:
+ }
+ {
+	% default:
+	variable file = fp;
+	fp = fopen (file, "r");
+	if (fp == NULL)
+	 throw IOError, "Unable to open $file"$;
+ }
+
+ if (nrows == NULL)
+ nrows = -1;
+ else if (nrows < 0)
+ nrows = 0;
+
+ if (init_size == NULL)
+ {
+	if ((nrows != NULL) && (nrows > 0))
+	 init_size = nrows;
+	else if (fp_is_array)
+	 init_size = maxlines;
+	else
+	 init_size = 0x8000;
+ }
+
+ if (dsize == NULL)
+ dsize = init_size;
+
+ variable array_list = NULL;
+ variable max_allocated = 0;
+ variable i, k, nitems = 0;
+
+ % Create a list of references that can be passed to sscanf
+ variable ref_list = {}, ref_buf = {};
+ _for i (0, ncols-1, 1)
+ {
+	list_append (ref_buf, 1);
+	list_append (ref_list, &ref_bufi);
+ }
+
+ % If arrays are to be returned, the array_list is an array of arrays
+ % Otherwise, is_list is non-zero, and array_list is a list of lists.
+ if (is_list)
+ {
+	array_list = {};
+	_for i (0, ncols-1, 1)
+	 list_append (array_list, {});
+ }
+
+ variable nlines = 0;
+ variable line = NULL;
+ variable comment_char = (comment != NULL) ? comment0 : 0;
+
+ while ((nitems != nrows) && (nlines != maxlines))
+ {
+	if (fp_is_array)
+	 line = fpnlines;
+	else if (-1 == fgets (&line, fp))
+	 break;
+
+	nlines++;
+
+	if (skip)
+	 {
+	 skip--;
+	 continue;
+	 }
+
+	if ((comment_char == line0)
+	 && (0 == strnbytecmp (comment, line, comment_len)))
+	 continue;
+
+	if (ncols != sscanf (line, fmt, __push_list(ref_list)))
+	 {
+	 if (stop_on_mismatch)
+	 break;
+
+	 continue;
+	 }
+
+	if (is_list)
+	 {
+	 _for i (0, ncols-1, 1)
+	 {
+		 list_append (array_listi, ref_bufi);
+	 }
+	 nitems++;
+	 continue;
+	 }
+
+	ifnot (max_allocated)
+	 {
+	 max_allocated = init_size;
+	 array_list = allocate_array_of_arrays (ref_buf, max_allocated);
+	 }
+
+	if (nitems == max_allocated)
+	 {
+	 max_allocated += dsize;
+	 variable new_array_list = allocate_array_of_arrays (ref_buf, max_allocated);
+	 k = 0:nitems-1;
+	 _for i (0, ncols-1, 1)
+	 new_array_listik = array_listi;
+	 array_list = new_array_list;
+	 }
+
+	_for i (0, ncols-1, 1)
+	 array_listinitems = ref_bufi;
+
+	nitems++;
+ }
+
+ if (nitems)
+ {
+	if ((is_list == 0) && (max_allocated != nitems))
+	 {
+	 k = 0:nitems-1;
+	 _for i (0, ncols-1, 1)
+	 array_listi = array_listik;
+	 }
+
+	if (has_ncols_qualifier)
+	 @arg_refs = array_list;
+	else _for i (0, ncols-1, 1)
+	 @arg_refsi = array_listi;
+ }
+
+ if (linep != NULL)
+ @linep = line;
+ if (linenump != NULL)
+ @linenump = nlines;
+
+ return nitems;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/require.sl Added

@@ -0,0 +1,71 @@
+% These functions were taken from the jed editor
+
+private variable Features;
+if (0 == __is_initialized (&Features))
+  Features = Assoc_Type Int_Type,0;
+
+private define pop_feature_namespace (nargs)
+{
+   variable f, ns = current_namespace ();
+   if (nargs == 2)
+     ns = ();
+   f = ();
+   if ((ns == NULL) or (ns == ""))
+     ns = "Global";
+   return strcat (ns, ".", f);
+}
+
+define _featurep ()
+{
+   variable f;
+   f = pop_feature_namespace (_NARGS);
+   return Featuresf;
+}
+
+define provide ()
+{
+   variable f = pop_feature_namespace (_NARGS);
+   Featuresf = 1;
+}
+
+define require ()
+{
+   variable feat, file;
+   variable ns = current_namespace ();
+   switch (_NARGS)
+     {
+      case 1:
+	feat = ();
+	file = feat;
+     }
+     {
+      case 2:
+	(feat, ns) = ();
+	file = feat;
+     }
+     {
+      case 3:
+	(feat, ns, file) = ();
+     }
+     {
+	usage ("require (feature ,namespace ,file)");
+     }
+
+   if (_featurep (feat, ns))
+     return;
+
+   if (ns == NULL)
+     () = evalfile (file);
+   else
+     () = evalfile (file, ns);
+
+   if (feat == file)
+     provide (file, ns);
+   else if (_featurep (feat, ns))
+     vmessage ("***Warning: feature %s not provided by %s", feat, file);
+}
+
+$1 = path_concat (path_dirname (__FILE__), "help/require.hlp");
+if (NULL != stat_file ($1))
+  add_doc_file ($1);
+

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/rline Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/rline/complete.sl Added

@@ -0,0 +1,193 @@
+% The code in this file implements completion callbacks for the slang
+% reaadline code. It may also be used by other slang applications.
+%
+% Version 0.1.0
+require ("glob");
+
+private variable Word_Bytes = Char_Type256;
+Word_Bytes'0':'9', 'A':'Z', 'a':'z', '_', 128:255 = 1;
+Word_Bytes'.' = 1;
+
+private variable File_Bytes = @Word_Bytes;
+File_Bytes'-', '/', '.', '+', '#', '~' = 1;
+
+private define filename_completions (partial_word)
+{
+ variable completions = glob(partial_word+"*");
+ if ((partial_word == "..") || (partial_word == "."))
+ completions = "..", completions;
+
+ variable n = length (completions);
+ _for (0, n-1, 1)
+ {
+	variable i = ();
+	variable file = completionsi;
+	variable st = stat_file (file);
+	if ((st != NULL) && (stat_is ("dir", st.st_mode)))
+	 completionsi = path_concat (file, "");
+ }
+ return completions;
+}
+
+private define struct_completion (partial_word)
+{
+ variable
+ words = strchop (partial_word, '.', 0),
+ completion = words0,
+ completions = String_Type0,
+ s = __get_reference (completion),
+ i, fields, word;
+
+ if ((s == NULL) || (0 == __is_initialized(s)))
+ return completions;
+
+ s = @s;
+ if (0 == is_struct_type (s))
+ return completions;
+
+ _for i (1, length(words)-2, 1)
+ {
+	fields = get_struct_field_names (s);
+	word = wordsi;
+	ifnot (any (fields == word))
+	 return completions;
+	s = get_struct_field (s, word);
+	if (0 == is_struct_type (s))
+	 return completions;
+
+	completion = strcat (completion, ".", word);
+ }
+ fields = get_struct_field_names (s);
+ word = words-1;
+ i = where (0 == strnbytecmp(fields, word, strbytelen(word)));
+ fields = fieldsi;
+ if (length (fields) == 0)
+ return completions;
+ return completion + "." + fields;
+}
+
+private define compute_completions (line, point, partial_wordp, posp)
+{
+ variable i = 0;
+ variable instr = 0, inchar = 0;
+ variable istart = NULL;
+ variable word_bytes = Word_Bytes;
+
+ if (line0 == '!')
+ {
+	word_bytes = File_Bytes;
+ }
+
+ while (i < point)
+ {
+	variable ch = linei; i++;
+
+	if (word_bytesch)
+	 {
+	 if (istart == NULL)
+	 istart = i-1;
+	 continue;
+	 }
+
+	if (ch == '"')
+	 {
+	 if (inchar)
+	 continue;
+	 istart = i;
+	 instr = not instr;
+	 continue;
+	 }
+	if (ch == '\'')
+	 {
+	 if (instr)
+	 continue;
+	 inchar = not (inchar);
+	 continue;
+	 }
+	if (ch == '\\')
+	 {
+	 i++;
+	 continue;
+	 }
+	if (inchar || instr)
+	 continue;
+	istart = NULL;
+ }
+
+ if (istart == NULL)
+ istart = point;
+
+ if (istart > point)
+ return NULL;
+
+ variable partial_word = lineistart:point-1;
+
+ % It would be useful here to allow this to be customized via, e.g.,
+ % return completion_hook (line, partial_word, istart, in_string)
+
+ variable completions;
+ if (instr || (line0 == '!')) % !shell-escape
+ completions = filename_completions (partial_word);
+ else if (is_substr (partial_word, "."))
+ completions = struct_completion (partial_word);
+ else
+ {
+	variable c1 = _apropos ("Global", "^"+partial_word, 0xFF);
+	variable c2 = _apropos ("", "^"+partial_word, 0xFF);
+	if (c1 == NULL)
+	 completions = c2;
+	else if (c2 == NULL)
+	 completions = c1;
+	else
+	 completions = c1, c2;
+ }
+
+ @posp = istart;
+ @partial_wordp = partial_word;
+
+ return completionsarray_sort(completions);
+}
+
+private define completion_callback (line, point)
+{
+ variable completions, partial_word, pos;
+ completions = compute_completions (line, point, &partial_word, &pos);
+
+ if (completions == NULL)
+ return String_Type0, 0;
+
+ return completions, pos;
+}
+
+private define list_completions (completions)
+{
+ variable max_len = 1 + max (strlen(completions));
+ variable max_cols = rline_get_edit_width ();
+
+ if (max_cols < 1)
+ max_cols = 80;
+
+ if (max_len > max_cols)
+ max_len = max_cols;
+
+ variable ncols = max_cols/max_len;
+ variable fmt = sprintf ("%%-%ds", max_len);
+ variable col = 0;
+ () = fputs ("\r\n", stdout);
+ foreach (completions)
+ {
+	variable word = ();
+	() = fprintf (stdout, fmt, word);
+	col++;
+	if (col == ncols)
+	 {
+	 () = fputs ("\r\n", stdout);
+	 col = 0;
+	 }
+ }
+ if (col)
+ () = fputs ("\r\n", stdout);
+}
+
+rline_set_list_completions_callback (&list_completions);
+rline_set_completion_callback (&completion_callback);

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/rline/editfuns.sl Added

@@ -0,0 +1,178 @@
+define rline_beep ()
+{
+ () = fputs ("\007", stdout);
+ () = fflush (stdout);
+}
+
+define rline_bol ()
+{
+ rline_call ("bol");
+}
+
+define rline_eol ()
+{
+ rline_call ("eol");
+}
+
+define rline_delete_line ()
+{
+ rline_set_line ("");
+}
+
+define rline_deleol ()
+{
+ rline_call ("deleol");
+}
+
+define rline_left ()
+{
+ rline_call ("left");
+}
+
+define rline_right ()
+{
+ rline_call ("right");
+}
+
+define rline_bdel ()
+{
+ rline_call ("bdel");
+}
+
+private define skip_non_word_chars (line, p)
+{
+ variable p1 = p, ch;
+ do
+ {
+	p = p1;
+	(p1, ch) = strskipchar (line, p, 1);
+ }
+ while (ch && not isalnum(ch));
+ return p;
+}
+
+private define skip_word_chars (line, p)
+{
+ variable p1 = p, ch;
+ do
+ {
+	p = p1;
+	(p1, ch) = strskipchar (line, p, 1);
+ }
+ while (isalnum(ch));
+ return p;
+}
+
+private define bskip_non_word_chars (line, p)
+{
+ variable p1 = p, ch;
+ do
+ {
+	p = p1;
+	(p1, ch) = strbskipchar (line, p, 1);
+ }
+ while (ch && not isalnum(ch));
+ return p;
+}
+
+private define bskip_word_chars (line, p)
+{
+ variable p1 = p, ch;
+ do
+ {
+	p = p1;
+	(p1, ch) = strbskipchar (line, p, 1);
+ }
+ while (isalnum(ch));
+ return p;
+}
+
+define rline_bskip_word ()
+{
+ variable line = rline_get_line (), p = rline_get_point ();
+ rline_set_point (bskip_word_chars (line, bskip_non_word_chars(line, p)));
+}
+
+define rline_skip_word ()
+{
+ variable line = rline_get_line (), p = rline_get_point ();
+ rline_set_point (skip_word_chars (line, skip_non_word_chars(line, p)));
+}
+
+private variable Mark = NULL;
+private variable Paste_Buffer = "";
+
+define rline_set_mark ()
+{
+ Mark = rline_get_point ();
+}
+
+private define get_mark (mp)
+{
+ if (Mark == NULL)
+ {
+	rline_beep ();
+	return -1;
+ }
+ @mp = Mark;
+ Mark = NULL;
+ return 0;
+}
+
+private define get_region (mp, pp)
+{
+ variable m;
+ if (-1 == get_mark (&m))
+ return -1;
+
+ variable p = rline_get_point ();
+ if (p < m)
+ (p, m) = (m, p);
+ @mp = m;
+ @pp = p;
+ return 0;
+}
+
+private define copy_region_to_pastebuffer (m, p)
+{
+ variable line = rline_get_line ();
+ Paste_Buffer = substrbytes (line, m+1, (p-m));
+}
+
+define rline_copy_region ()
+{
+ variable m, p;
+ if (-1 == get_region (&m, &p))
+ return;
+ copy_region_to_pastebuffer (m, p);
+}
+
+define rline_kill_region ()
+{
+ variable m, p;
+ if (-1 == get_region (&m, &p))
+ return;
+
+ copy_region_to_pastebuffer (m, p);
+ rline_set_point (m);
+ rline_del (p-m);
+}
+
+define rline_kill_eol ()
+{
+ rline_set_mark ();
+ rline_eol ();
+ rline_kill_region ();
+}
+
+define rline_kill_bol ()
+{
+ rline_set_mark ();
+ rline_bol ();
+ rline_kill_region ();
+}
+
+define rline_yank ()
+{
+ rline_ins (Paste_Buffer);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/rline/editor.sl Added

@@ -0,0 +1,111 @@
+% Public functions:
+%   rline_edit_line
+%      Binding this will allow the current line to be
+%      edited in an external editor.
+%   rline_call_editor
+%      A utility function to call the editor
+%
+autoload ("new_process", "process");
+
+variable RLine_Tmp_Dir;
+private define open_tmp_file (prefix, ext)
+{
+   variable dir, dirs = "/tmp", "$HOME"$;
+   if (__is_initialized (&RLine_Tmp_Dir))
+     dirs = RLine_Tmp_Dir, dirs;
+
+   foreach dir (dirs)
+     {
+	variable st = stat_file (dir);
+	if (st == NULL)
+	  continue;
+	if (stat_is ("dir", st.st_mode))
+	  break;
+     }
+   then dir = "";
+
+   variable fmt = path_concat (dir, "%s%X%d.%s");
+   variable pid = getpid ();
+   variable n = 0;
+   variable file, fp;
+
+   loop (100)
+     {
+	n++;
+	file = sprintf (fmt, prefix, pid*_time(), n, ext);
+
+	variable fd = open (file, O_WRONLY|O_CREAT|O_TRUNC|O_TEXT, S_IRUSR|S_IWUSR);
+	if (fd == NULL)
+	  return;
+
+	fp = fdopen (fd, "w");
+	if (fp != NULL)
+	  return fp, fd, file;
+     }
+   throw OpenError, "Unable to open a temporary file";
+}
+
+private define get_editor ()
+{
+   variable editor = getenv("VISUAL");
+   if (editor == NULL) editor = getenv ("EDITOR");
+   if (editor == NULL) editor = "vi";
+   return editor;
+}
+
+define rline_call_editor (lines, prefix, ext)
+{
+   variable editor = get_editor ();
+   variable file, fp, fd;
+   (fp, fd, file) = open_tmp_file (prefix, ext);
+
+   EXIT_BLOCK
+     {
+	() = remove (file);
+     }
+
+   () = array_map (Int_Type, &fputs, lines+"\n", fp);
+   () = fclose (fp);
+
+   variable st = stat_file (file);
+   if (st == NULL)
+     return NULL;
+
+   variable mtime = st.st_mtime;
+
+#ifexists __rline_reset_tty
+   __rline_reset_tty ();
+#endif
+   variable p = new_process (editor, file).wait();
+#ifexists __rline_init_tty
+   __rline_init_tty ();
+#endif
+   rline_call ("redraw");
+
+   if ((p.exited == 0) || (p.exit_status != 0))
+     return NULL;
+
+   st = stat_file (file);
+   if ((st == NULL) || (st.st_mtime == mtime))
+     return NULL;
+
+   fp = fopen (file, "r");
+   if (fp == NULL)
+     return NULL;
+
+   lines = fgetslines (fp);
+   () = fclose (fp);
+
+   return lines;
+}
+
+define rline_edit_line ()
+{
+   variable lines = rline_get_line ();
+   lines = rline_call_editor (lines, "rline", "sl");
+   if ((lines == NULL) || (length (lines) == 0))
+     return;
+   lines = strtrim_end (lines, "\n");
+   rline_set_line (strjoin (lines, ""));
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/rline/emacskeys.sl Added

@@ -0,0 +1,67 @@
+% A simple emacs-emulation for SLrline
+
+require ("rline/complete");
+require ("rline/editfuns");
+
+rline_unsetkey ("^@");
+foreach $1 (1:255)
+{
+   $2 = char (-$1);		       %  byte-semantics
+   rline_unsetkey ($2);
+   rline_setkey ("self_insert", $2);
+}
+
+rline_setkey ("bdel",			"^?");
+rline_setkey ("bol",			"^A");
+rline_setkey ("left",			"^B");
+rline_setkey ("kbd_quit",		"^C");
+rline_setkey ("del",			"^D");
+rline_setkey ("eol",			"^E");
+rline_setkey ("right",			"^F");
+rline_setkey ("kbd_quit",		"^G");
+rline_setkey ("bdel",			"^H");
+rline_setkey ("enter",			"\n");
+rline_setkey (&rline_kill_eol,		"^K");
+rline_setkey ("redraw",			"^L");
+rline_setkey ("enter",			"\r");
+rline_setkey ("down",			"^N");
+rline_setkey ("up",			"^P");
+rline_setkey ("quoted_insert",		"^Q");
+rline_setkey (&rline_kill_bol,		"^U");
+rline_setkey (&rline_kill_region,	"^W");
+rline_setkey (&rline_yank,		"^Y");
+rline_setkey ("trim",			"\e\\");
+rline_setkey (&rline_bskip_word,	"\eb");
+rline_setkey (&rline_skip_word,		"\ef");
+rline_setkey (&rline_copy_region,	"\ew");
+rline_setkey ("complete",		"\t");
+
+#ifdef UNIX VMS
+rline_setkey (&rline_set_mark,		"^@");
+rline_setkey ("up",			"\eA");
+rline_setkey ("down",			"\eB");
+rline_setkey ("right",			"\eC");
+rline_setkey ("left",			"\eD");
+rline_setkey ("up",			"\eOA");
+rline_setkey ("down",			"\eOB");
+rline_setkey ("right",			"\eOC");
+rline_setkey ("left",			"\eOD");
+#else
+rline_setkey (&rline_set_mark,		"^@^C");
+rline_setkey ("up",			"^@H");
+rline_setkey ("down",			"^@P");
+rline_setkey ("right",			"^@M");
+rline_setkey ("left",			"^@K");
+rline_setkey ("del",			"^@S");
+rline_setkey ("eol",			"^@O");
+rline_setkey ("bol",			"^@G");
+
+rline_setkey ("up",			"\xE0H");
+rline_setkey ("down",			"\xE0P");
+rline_setkey ("right",			"\xE0M");
+rline_setkey ("left",			"\xE0K");
+rline_setkey ("del",			"\xE0S");
+rline_setkey ("eol",			"\xE0O");
+rline_setkey ("bol",			"\xE0G");
+#endif
+

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/rline/history.sl Added

@@ -0,0 +1,74 @@
+% Public functions:
+%
+%   rline_load_history (file);
+%   rline_save_history (file);
+%
+
+variable RLine_Hist_Max_Lines = 50;
+variable RLine_History_File = NULL;
+#ifdef UNIX
+%if (getenv ("HOME") != NULL) RLine_History_File = "$HOME/.${name}_slhist";
+#endif
+
+autoload ("rline_up_hist_search", "rline/histsrch.sl");
+autoload ("rline_down_hist_search", "rline/histsrch.sl");
+define rline_load_history ()
+{
+   variable file = RLine_History_File;
+   if (_NARGS == 1)
+     file = ();
+   if (file == NULL)
+     return;
+
+   variable fp = fopen (file, "r");
+   if (fp == NULL)
+     return;
+
+   variable lines = fgetslines (fp);
+   () = fclose (fp);
+   lines = strtrim_end (lines, "\n");
+   rline_set_history (lines);
+}
+
+define rline_save_history ()
+{
+   variable file = RLine_History_File;
+   if (_NARGS == 1)
+     file = ();
+   if (file == NULL)
+     return;
+
+   variable max_lines = qualifier ("max", RLine_Hist_Max_Lines);
+   variable h = rline_get_history ();
+   variable n = length (h);
+   if (n > max_lines)
+     h = hn-max_lines:;
+
+   variable fd = open (file, O_WRONLY|O_CREAT|O_TRUNC|O_TEXT, S_IRUSR|S_IWUSR);
+   if (fd == NULL)
+     return;
+
+   variable fp = fdopen (fd, "w");
+   if (fp == NULL)
+     return;
+
+   foreach (h)
+     {
+	variable line = ();
+	() = fputs (line, fp);
+	() = fputs ("\n", fp);
+     }
+   () = fflush (fp);
+   () = close (fd);
+}
+
+define rline_edit_history ()
+{
+   variable lines = rline_get_history ();
+   lines = rline_call_editor (lines, "histedit", "tmp");
+   if ((lines == NULL)
+       || (length (lines) == 0))
+     return;
+
+   rline_set_history (strtrim_end(lines, "\n"));
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/rline/histsrch.sl Added

@@ -0,0 +1,90 @@
+% Public functions:
+% rline_up_hist_search
+% rline_down_hist_search
+%
+% These functions search up/down the history list displaying history
+% lines that match the starting line. The idea behind this was inspired
+% by the zsh up/down-line-or-search functions.
+%
+
+define rline_up_hist_search();
+define rline_down_hist_search ();
+private variable History_Search = struct
+{
+ history,
+ prefix,
+ current_index,
+ point,
+};
+
+private define get_unique_history (prefix)
+{
+ variable h = rline_get_history ();
+
+ if (prefix == "")
+ return h, prefix;
+
+ variable i = strncmp (h, prefix, strlen(prefix));
+ h = hwherenot(i);
+
+ variable new_h = String_Type0;
+
+ % build the list using most recent history first
+ array_reverse (h);
+ foreach (h)
+ {
+	variable name = ();
+	if (any (name == new_h))
+	 continue;
+	new_h = new_h, name;
+ }
+ array_reverse (new_h);
+ return new_h, prefix;
+}
+
+private define get_history_search (dir)
+{
+ variable func = rline_get_last_key_function();
+
+ if ((History_Search.history == NULL)
+ || (typeof (func) != Ref_Type)
+ || ((func != &rline_up_hist_search) && (func != &rline_down_hist_search)))
+ {
+	variable point = rline_get_point ();
+	History_Search.point = point;
+	variable prefix = rline_get_line()0:point-1;
+	History_Search.history = get_unique_history (prefix);
+	History_Search.current_index = 0;
+	if (dir < 0)
+	 History_Search.current_index = length(History_Search.history)-1;
+	History_Search.prefix = prefix;
+ }
+ return History_Search;
+}
+
+private define up_down_hist_search (dir)
+{
+ variable h = get_history_search (dir);
+ variable num = length (h.history);
+ if (num == 0)
+ return;
+
+ variable index = h.current_index + dir;
+
+ ifnot (0 <= index < num)
+ return;
+
+ rline_delete_line ();
+ rline_ins (h.historyindex);
+ h.current_index = index;
+}
+
+define rline_up_hist_search ()
+{
+ up_down_hist_search (-1);
+}
+
+define rline_down_hist_search ()
+{
+ up_down_hist_search (1);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/rline/slrline.rc Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/rline/vikeys.sl Added

@@ -0,0 +1,249 @@
+% A simple vi-emulation for SLrline
+
+require ("rline/complete");
+require ("rline/editfuns");
+
+private variable Is_Command_Mode = 0;
+private variable Last_Command = &rline_beep;
+
+private define vi_enter_command_mode ()
+{
+   Is_Command_Mode = 1;
+}
+
+private define vi_enter_insert_mode ()
+{
+   Is_Command_Mode = 0;
+}
+
+private define self_insert_unless_command_mode ()
+{
+   Last_Command = &rline_beep;
+   if (Is_Command_Mode)
+     return 0;
+
+   rline_call ("self_insert");
+   return 1;
+}
+
+private define vi_insert_mode ()
+{
+   if (self_insert_unless_command_mode ())
+     return;
+
+   vi_enter_insert_mode ();
+}
+
+private define vi_append_mode ()
+{
+   if (self_insert_unless_command_mode ())
+     return;
+
+   rline_call("right");
+   vi_enter_insert_mode ();
+}
+
+private define vi_delete_line ()
+{
+   if (self_insert_unless_command_mode ())
+     return;
+
+   rline_delete_line ();
+}
+
+private define vi_left ();
+private define vi_left ()
+{
+   if (self_insert_unless_command_mode ())
+     return;
+
+   Last_Command = &vi_left;
+   rline_call ("left");
+}
+
+private define vi_right ();
+private define vi_right ()
+{
+   if (self_insert_unless_command_mode ())
+     return;
+
+   Last_Command = &vi_right;
+   rline_call ("right");
+}
+
+private define vi_up ();
+private define vi_up ()
+{
+   if (self_insert_unless_command_mode ())
+     return;
+
+   Last_Command = &vi_up;
+   rline_call ("up");
+}
+
+private define vi_down ();
+private define vi_down ()
+{
+   if (self_insert_unless_command_mode ())
+     return;
+
+   Last_Command = &vi_down;
+   rline_call ("down");
+}
+
+private define vi_bol ();
+private define vi_bol ()
+{
+   if (self_insert_unless_command_mode ())
+     return;
+
+   Last_Command = &vi_bol;
+   rline_bol ();
+}
+
+private define vi_eol ();
+private define vi_eol ()
+{
+   if (self_insert_unless_command_mode ())
+     return;
+
+   Last_Command = &vi_eol;
+   rline_eol ();
+   rline_left ();
+}
+
+private define vi_del ();
+private define vi_del ()
+{
+   if (self_insert_unless_command_mode ())
+     return;
+
+   Last_Command = &vi_del;
+   if (rline_eolp ())
+     rline_bdel ();
+   else
+     rline_del (1);
+}
+
+private define vi_replace_char ()
+{
+   if (self_insert_unless_command_mode ())
+     return;
+
+   rline_del (1);
+   rline_ins (char (-rline_getkey ()));
+}
+
+private define vi_bskip_word ();
+private define vi_bskip_word ()
+{
+   if (self_insert_unless_command_mode ())
+     return;
+
+   Last_Command = &vi_bskip_word;
+   rline_bskip_word ();
+}
+
+private define vi_skip_word ();
+private define vi_skip_word ()
+{
+   if (self_insert_unless_command_mode ())
+     return;
+
+   Last_Command = &vi_skip_word;
+   rline_skip_word ();
+}
+
+private define vi_self_insert ()
+{
+   if (self_insert_unless_command_mode ())
+     return;
+
+   rline_beep ();
+}
+
+private define vi_backspace ();
+private define vi_backspace ()
+{
+   if (Is_Command_Mode)
+     {
+	rline_beep ();
+	return;
+     }
+   Last_Command = &vi_backspace;
+   rline_bdel ();
+}
+
+private define vi_enter ()
+{
+   vi_enter_insert_mode ();
+   rline_call ("enter");
+}
+
+private define vi_repeat_last_command ()
+{
+   (@Last_Command)();
+}
+
+private variable Command_Map = Ref_Type256;
+
+private define vi_escape ()
+{
+   vi_enter_command_mode ();
+   if (0 == rline_input_pending (1))
+     {
+	vi_left ();
+	return;
+     }
+   variable ch = rline_getkey ();
+   if ((ch == '') || (ch == 'O'))
+     {
+	switch (rline_getkey ())
+	  { case 'A': vi_up (); return; }
+	  { case 'B': vi_down (); return; }
+	  { case 'C': vi_right (); return; }
+	  { case 'D': vi_left (); return; }
+
+	while (rline_input_pending (1))
+	  () = rline_getkey ();
+
+	return;
+     }
+   if (Command_Mapch != NULL)
+     (@Command_Mapch)();
+}
+
+foreach (32:255)
+{
+   $1 = ();
+   rline_setkey (&vi_self_insert, char(-$1));
+}
+
+rline_unsetkey ("\e");
+rline_setkey (&vi_escape, "\e");
+
+private define set_command_key (ch, f)
+{
+   Command_Mapch = f;
+   rline_setkey (f, char(ch));
+}
+
+set_command_key ('\x08', &vi_backspace);
+set_command_key ('\x7F', &vi_backspace);
+set_command_key ('\r', &vi_enter);
+set_command_key ('\n', &vi_enter);
+set_command_key ('.', &vi_repeat_last_command);
+set_command_key ('a', &vi_append_mode);
+set_command_key ('i', &vi_insert_mode);
+set_command_key ('d', &vi_delete_line);
+set_command_key ('h', &vi_left);
+set_command_key ('l', &vi_right);
+set_command_key ('k', &vi_up);
+set_command_key ('j', &vi_down);
+set_command_key ('^', &vi_bol);
+set_command_key ('$', &vi_eol);
+set_command_key ('r', &vi_replace_char);
+set_command_key ('x', &vi_del);
+set_command_key ('b', &vi_bskip_word);
+set_command_key ('w', &vi_skip_word);
+

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/setfuns.sl Added

@@ -0,0 +1,263 @@
+% Functions that operate on sets in the form of arrays and lists:
+% Copyright (C) 2010-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+%
+% Functions: unique, union, complement, intersection, ismember
+private define pop_set_object ()
+{
+ variable a = ();
+ if ((typeof(a) != Array_Type) && (typeof(a) != List_Type))
+ a = a;
+ return a;
+}
+
+private define list_unique (a)
+{
+ variable len = length(a);
+ variable indices = Int_Typelen;
+ variable i, j, k;
+
+ k = 0;
+ _for i (0, len-1, 1)
+ {
+	variable a_i = ai;
+	_for j (0, i-1, 1)
+	 {
+	 if (_eqs(a_i, aj))
+	 break;
+	 }
+	then
+	 {
+	 indicesk = i;
+	 k++;
+	 }
+ }
+ return indices0:k-1;
+}
+
+
+define unique ()
+{
+ variable i, j, len;
+ variable a;
+
+ if (_NARGS != 1)
+ {
+	_pop_n (_NARGS);
+	usage ("i = unique (a); %% i = indices of unique elements of a");
+ }
+
+ a = pop_set_object ();
+ if (typeof(a) == List_Type)
+ {
+	try
+	 {
+	 a = list_to_array (a);
+	 }
+	catch AnyError: return list_unique (a);
+ }
+
+ len = length(a);
+ if (len <= 1)
+ return 0:len-1;
+
+ if (length(array_shape(a)) != 1)
+ a = _reshape (__tmp(a),len);
+
+ try
+ {
+	i = array_sort(a);
+ }
+ catch AnyError: return list_unique (a);
+
+ a = ai;
+ if (a0 == a-1)		 % all equal
+ return 0;
+ j = where (shift(a,-1)!=a);
+ % Now, i contains the sorted indices, and j contains the indices into the
+ % sorted array. So, the unique elements are given by aij where a is
+ % the original input array. It seems amusing that the indices given by
+ % ij are also given by ij.
+ return i__tmp(j);
+}
+
+define union ()
+{
+ !if (_NARGS)
+ usage ("U = union (A, B, ..., C);");
+
+ variable args = {}, obj;
+ variable has_list = 0;
+ loop (_NARGS)
+ {
+	has_list += (typeof (obj) == List_Type);
+	obj = pop_set_object ();
+	list_insert (args, obj);
+ }
+
+ variable a = NULL;
+ if (has_list == 0)
+ {
+	try
+	 {
+	 a = __push_list (args);
+	 }
+	catch AnyError:;
+ }
+
+ if (a == NULL)
+ {
+	a = {};
+	foreach obj (args)
+	 {
+	 if (typeof(obj) == List_Type)
+	 {
+		 list_join (a, obj);
+		 continue;
+	 }
+	 foreach (obj)
+	 {
+		 variable x = ();
+		 list_append (a, x);
+	 }
+	 }
+ }
+ return aunique (a);
+}
+
+% return indices of a that are not in b
+private define list_complement (a, b)
+{
+ variable lena = length(a), lenb = length(b);
+ variable indices = Int_Typelena;
+ variable i, j, k;
+
+ k = 0;
+ _for i (0, lena-1, 1)
+ {
+	variable a_i = ai;
+	_for j (0, lenb-1, 1)
+	 {
+	 if (_eqs(a_i, bj))
+	 break;
+	 }
+	then
+	 {
+	 indicesk = i;
+	 k++;
+	 }
+ }
+ return indices0:k-1;
+}
+
+define complement ()
+{
+ variable a, b;
+ if (_NARGS != 2)
+ usage ("\
+i = complement (a, b);\n\
+%% Returns the indices of the elements of `a' that are not in `b'");
+
+ b = pop_set_object ();
+ a = pop_set_object ();
+
+ variable
+ lena = length(a),
+ lenb = length(b);
+
+ if ((lena == 0) || (lenb == 0))
+ return 0:lena-1;
+
+ variable sia, sib;
+ try
+ {
+	if (typeof (a) == List_Type)
+	 a = list_to_array (a);
+	if (typeof (b) == List_Type)
+	 b = list_to_array (b);
+	sia = array_sort (a);
+	sib = array_sort (b);
+ }
+ catch AnyError:
+ return list_complement (a, b);
+
+ variable
+ c = Int_Type lena, j = 0,
+ ia, ib, xa, xb, k;
+
+ ia = 0; ib = 0;
+ xb = bsibib;
+ while (ia < lena)
+ {
+	k = siaia;
+	xa = ak;
+	if (xa < xb)
+	 {
+	 cj = k;
+	 j++;
+	 ia++;
+	 continue;
+	 }
+	if (xb == xa)
+	 {
+	 ia++;
+	 continue;
+	 }
+
+	while (ib++, (ib < lenb) && (xa > bsibib))
+	 ;
+	if (ib == lenb)
+	 {
+	 variable n = lena-ia;
+	 cj:j+n-1 = siaia:lena-1;
+	 j += n;
+	 break;
+	 }
+	xb = bsibib;
+	if (xa == xb)
+	 ia++;
+ }
+ return c0:j-1;
+}
+
+% Return the indices into a of the common elements of both a and b
+define intersection ()
+{
+ if (_NARGS < 2)
+ usage ("\
+i = intersection (a, b, .., c);\n\
+%% Returns the indices of 'a' of the common elements of b,.., c");
+
+ variable b = pop_set_object ();
+ loop (_NARGS-1)
+ {
+	variable a = pop_set_object ();
+	variable i = complement (a, __tmp(b));
+	i = complement (a, ai);
+	b = ai;
+ }
+ return i;
+}
+
+% Returns whether or not a is a member of b.
+define ismember ()
+{
+ if (_NARGS != 2)
+ usage ("I = ismember (a, b);\n\
+Returns a boolean array indicated whether the corresponding elements of 'a'\n\
+are members of 'b'");
+
+ variable a, b;
+ (a, b) = ();
+ if ((typeof(a) == Array_Type) || (typeof(a) == List_Type))
+ {
+	variable lena = length (a);
+	variable result = Char_Typelena;
+	resultintersection(a,b) = 1;
+	return result;
+ }
+ return 0 != length (intersection (a, b));
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/sldb.sl Added

@@ -0,0 +1,105 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License.  See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+require ("sldbcore");
+
+private define vmessage_method ()
+{
+   variable args = __pop_args (_NARGS);
+   () = fprintf (stdout, __push_args (args));
+   () = fflush (stdout);
+}
+
+private define open_file_at_linenum (file, linenum)
+{
+   if (path_extname (file) == ".slc")
+     file = path_sans_extname (file) + ".sl";
+
+   variable fp = fopen (file, "r");
+   if (fp == NULL)
+     {
+	vmessage_method ("Unable to open %s\n", file);
+	return NULL;
+     }
+   if (linenum == 1)
+     return fp;
+
+   foreach (fp) using ("line")
+     {
+	variable line = ();
+	linenum--;
+	if (linenum == 1)
+	  break;
+     }
+   return fp;
+}
+
+private define list_method (file, linemin, linemax)
+{
+   variable n = linemax - linemin + 1;
+   foreach (open_file_at_linenum (file, linemin))
+     {
+	variable line = ();
+	vmessage_method ("%d\t%s", linemin, line);
+	%vmessage_method ("> %s:%d %s", file, linemin, line);
+	linemin++;
+	if (linemin > linemax)
+	  break;
+     }
+}
+
+#ifexists slsh_readline
+slsh_readline_init ("SLDB");
+private variable Rline = NULL;
+private define close_readline ()
+{
+   Rline = NULL;
+}
+Rline = slsh_readline_new ("sldb");
+atexit (&close_readline);
+#endif
+
+private define read_input_method (prompt, default_cmd)
+{
+   variable line;
+   forever
+     {
+	try
+	  {
+#ifexists slsh_readline
+	     line = slsh_readline (Rline, prompt);
+#else
+	     () = fputs (prompt, stdout); () = fflush(stdout);
+	     if (-1 == fgets (&line, stdin))
+	       line = NULL;
+#endif
+	  }
+	catch UserBreakError: continue;
+	if (line == NULL)
+	  break;
+
+	line = strtrim (line, "\t \n");
+	if (line == "")
+	  {
+	     if (default_cmd != NULL)
+	       return default_cmd;
+	     continue;
+	  }
+	break;
+     }
+   return line;
+}
+
+define sldb_initialize ()
+{
+   variable m = sldb_methods ();
+   m.list = &list_method;
+   m.vmessage = &vmessage_method;
+   m.read_input = &read_input_method;
+   m.pprint = &print;
+}
+
+provide ("sldb");

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/sldbcore.sl Added

@@ -0,0 +1,809 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+%
+% This file implements the core a simple debugger. It needs to be wrapped
+% by routines that implement the Debugger_Methods.
+%
+% Public functions:
+% sldb_methods()
+% sldb_stop ();
+% sldb_start ();
+% sldb_set_breakpoint ();
+%
+%
+% Notes:
+%
+% If a file was not compiled with bos/eos hooks, then debugging of
+% it may be limited due to the lack of line number information.
+%
+%
+require ("print");
+
+private variable Debugger_Methods = struct
+{
+ list, % list (file, linemin, linemax)
+ vmessage, % vmessage (fmt, args...)
+ read_input, % input = read_input (prompt, default)
+ pprint, % pprint(obj) % pprint the value of an object
+ quit, % quit (and kill) the program
+ exit		 % exit the debugger but not the program
+};
+
+private define output ()
+{
+ variable args = __pop_args (_NARGS);
+ (@Debugger_Methods.vmessage)(__push_args(args));
+}
+
+private define quit_method ()
+{
+ output ("Program exiting\n");
+ exit (0);
+}
+Debugger_Methods.quit = &quit_method;
+
+private define exit_method ()
+{
+ output ("Leaving the debugger\n");
+}
+Debugger_Methods.exit = &exit_method;
+
+define sldb_methods ()
+{
+ return Debugger_Methods;
+}
+define sldb_initialize ();	 % This should be overridden
+
+define sldb_stop();
+
+private variable Depth = 0;
+private variable Stop_Depth	= 0;
+private variable Debugger_Step	= 0;
+private variable STEP_NEXT	= 1;
+private variable STEP_STEP	= 2;
+private variable STEP_FINISH	= 3;
+private variable STEP_EXIT	= 4;
+private variable Breakpoints = NULL;
+private variable Breakpoint_Number = 1;
+private variable Current_Frame;
+private variable Max_Current_Frame;
+private variable Last_List_Line = 0;
+private variable Last_Cmd_Line = NULL;
+private variable Last_Cmd = NULL;
+private variable Prompt = "(SLdb) ";
+private variable Startup_PID = NULL;
+
+private define new_breakpoints ()
+{
+ Breakpoints = Assoc_TypeInt_Type, 0;
+ Breakpoint_Number = 1;
+}
+
+private define check_breakpoints ()
+{
+ if (Breakpoints == NULL)
+ new_breakpoints ();
+}
+
+define sldb_set_breakpoint (pos)
+{
+ variable bp;
+
+ check_breakpoints ();
+ bp = Breakpoint_Number;
+ Breakpointspos = bp;
+ Breakpoint_Number++;
+
+ output ("breakpoint #%d set at %s\n", bp, pos);
+ return bp;
+}
+
+private define make_breakpoint_name (file, line)
+{
+ return sprintf ("%S:%d", file, line);
+}
+
+private define eval_in_frame (frame, expr, num_on_stack, print_fun)
+{
+ variable boseos = _boseos_info;
+ variable bofeof = _bofeof_info;
+ expr = sprintf ("_boseos_info=0; _bofeof_info=0; _use_frame_namespace(%d); %s; _bofeof_info=%d; _boseos_info=%d;",
+		 frame, expr, bofeof, boseos);
+ variable depth = _stkdepth () - num_on_stack;
+ eval (expr);
+
+ variable n = _stkdepth () - depth;
+ if (print_fun == NULL)
+ return n;
+
+ loop (n)
+ {
+	variable val = ();
+	(@print_fun) (val);
+ }
+ return n;
+}
+
+private define break_cmd (cmd, args, file, line)
+{
+ variable bp;
+ if (strlen (args) == 0)
+ bp = make_breakpoint_name (file, line);
+ else if (_slang_guess_type (args) == Int_Type)
+ bp = make_breakpoint_name (file, integer (args));
+ else
+ {
+	bp = args;
+	if (0 == is_substr (args, ":"))
+	 {
+	 }
+ }
+
+ () = sldb_set_breakpoint (bp);
+ return 0;
+}
+
+private define display_file_and_line (file, linemin, linemax)
+{
+ if (file == "***string***")
+ return;
+
+ if (linemin < 1)
+ linemin = 1;
+ if (linemax < linemin)
+ linemax = linemin;
+
+ (@Debugger_Methods.list)(file, linemin, linemax);
+}
+
+private define finish_cmd (cmd, args, file, line)
+{
+ %variable fun = _get_frame_info (Max_Current_Frame).function;
+ variable fun = _get_frame_info (Current_Frame).function;
+ if (fun == NULL) fun = "<top-level>";
+ output ("Run until exit from %s\n", fun);
+ Debugger_Step = STEP_FINISH;
+ Stop_Depth = Depth-1;
+ return 1;
+}
+
+private define next_cmd (cmd, args, file, line)
+{
+ Debugger_Step = STEP_NEXT;
+ Stop_Depth = Depth;
+ return 1;
+}
+
+private define step_cmd (cmd, args, file, line)
+{
+ Debugger_Step = STEP_STEP;
+ Stop_Depth = Depth + 1;
+ return 1;
+}
+
+private define delete_cmd (cmd, args, file, line)
+{
+ variable bp = make_breakpoint_name (file, line);
+ variable n = Breakpointsbp;
+ if (n)
+ {
+	Breakpointsbp = 0;
+	output ("Deleted breakpoint #%d\n", n);
+	return 0;
+ }
+ if (args == "")
+ {
+	new_breakpoints ();
+	output ("Deleted all breakpoints\n");
+	return 0;
+ }
+
+ variable keys = assoc_get_keys (Breakpoints);
+ variable vals = assoc_get_values (Breakpoints);
+
+ foreach (eval (sprintf ("%s", args)))
+ {
+	bp = ();
+	variable i = wherefirst (vals == bp);
+	if (i == NULL)
+	 continue;
+	assoc_delete_key (Breakpoints, keysi);
+	output ("Deleted breakpoint %d\n", bp);
+ }
+ return 0;
+}
+
+private define continue_cmd (cmd, args, file, line)
+{
+ Debugger_Step = 0;
+ return 1;
+}
+
+private define watch_cmd (cmd, args, file, line)
+{
+ output ("%s is not implemented\n", cmd);
+ return 0;
+}
+
+private define exit_cmd (cmd, args, file, line)
+{
+ sldb_stop ();
+ (@Debugger_Methods.exit) ();
+ return 1;
+}
+
+private define quit_cmd (cmd, args, file, line)
+{
+ variable prompt = "Are you sure you want to quit (and kill) the program? (y/n) ";
+ variable y = (@Debugger_Methods.read_input)(prompt, NULL);
+ y = strup (y);
+ !if (strlen (y))
+ return 0;
+ if (y0 != 'Y')
+ {
+	output ("Try using 'exit' to leave the debugger");
+	return 0;
+ }
+ sldb_stop ();
+ (@Debugger_Methods.quit)();
+ return 1;
+}
+
+private define simple_print (v)
+{
+ if (length (v) <= 1)
+ print (v, &v);
+ output ("%S\n", v);
+}
+
+private define pretty_print (v)
+{
+ variable p = Debugger_Methods.pprint;
+ if (p == NULL)
+ {
+	simple_print (v);
+	return;
+ }
+ (@p)(v);
+}
+
+private define print_expr (print_fun, expr)
+{
+ variable info = _get_frame_info (Current_Frame);
+ variable localvars = info.locals;
+
+ if (localvars == NULL)
+ {
+	() = eval_in_frame (Current_Frame, expr, 0, print_fun);
+	return;
+ }
+
+ % Create a dummy function and call it with the values of the local-vars
+ % The idea is that variables that are initialized will be arguments, and
+ % others will just be locals
+ variable a = Assoc_Type;
+ foreach (localvars)
+ {
+	variable lvar = ();
+	try
+	 {
+	 alvar = _get_frame_variable (Current_Frame, lvar);
+	 }
+	catch VariableUninitializedError;
+ }
+ variable inited_vars = assoc_get_keys (a);
+ variable uninited_vars = String_Type0;
+ foreach (localvars)
+ {
+	lvar = ();
+	if (assoc_key_exists (a, lvar))
+	 continue;
+	uninited_vars = uninited_vars, lvar;
+ }
+ if (length (uninited_vars))
+ uninited_vars = strcat ("variable ", strjoin (uninited_vars, ","), ";");
+ else
+ uninited_vars = "";
+
+ variable fmt = "private define %s (%s) { %s %s; }";
+ variable dummy = "__debugger_print_function";
+ variable fun = sprintf (fmt, dummy, strjoin (inited_vars, ","),
+			 uninited_vars, expr);
+ () = eval_in_frame (Current_Frame, fun, 0, print_fun);
+
+ % push values to the stack and call the dummy function
+ foreach lvar (inited_vars)
+ {
+	alvar;
+ }
+ () = eval_in_frame (Current_Frame, dummy, length (inited_vars), print_fun);
+}
+
+private define print_cmd (cmd, args, file, line)
+{
+ print_expr (&simple_print, args);
+ return 0;
+}
+
+private define pprint_cmd (cmd, args, file, line)
+{
+ print_expr (&pretty_print, args);
+ return 0;
+}
+
+private define list_cmd (cmd, args, file, line)
+{
+ variable dline = 5;
+ line = int (line);
+
+ if (Last_Cmd == cmd)
+ line = Last_List_Line + 1 + dline;
+
+ variable line_min = line - dline;
+ variable line_max = line + dline;
+
+ if (strlen (args))
+ {
+	line_min = integer (args);
+	line_max = line_min + 10;
+ }
+
+ display_file_and_line (file, line_min, line_max);
+ Last_List_Line = line_max;
+ return 0;
+}
+
+private define print_frame_info (f, print_line)
+{
+ variable info = _get_frame_info (f);
+ variable file = info.file;
+ variable function = info.function;
+ variable line = info.line;
+
+ if (function == NULL)
+ function = "<top-level frame>";
+
+ output("#%d %S:%d:%s\n", Max_Current_Frame-f, file, line, function);
+ if (print_line)
+ display_file_and_line (file, line, line);
+}
+
+private define up_cmd (cmd, args, file, line)
+{
+ if (Current_Frame == 1)
+ {
+	output ("Can't go up\n");
+	return 0;
+ }
+ Current_Frame--;
+ print_frame_info (Current_Frame, 1);
+ return 0;
+}
+
+private define down_cmd (cmd, args, file, line)
+{
+ if (Current_Frame == Max_Current_Frame)
+ {
+	output ("At inner-most frame\n");
+	return 0;
+ }
+ Current_Frame++;
+ print_frame_info (Current_Frame, 1);
+ return 0;
+}
+
+private define where_cmd (cmd, args, file, line)
+{
+ variable i = Current_Frame;
+ while (i > 0)
+ {
+	print_frame_info (i, 0);
+	i--;
+ }
+ return 0;
+}
+
+#ifexists fpu_clear_except_bits
+private variable WatchFPU_Flags = 0;
+#endif
+
+private define watchfpu_cmd (cmd, args, file, line)
+{
+#ifexists fpu_clear_except_bits
+ fpu_clear_except_bits ();
+ if (args == "")
+ {
+	WatchFPU_Flags = FE_ALL_EXCEPT;
+	output ("Watching all FPU exceptions:\n");
+	output (" FE_DIVBYZERO | FE_INEXACT | FE_INVALID | FE_OVERFLOW | FE_UNDERFLOW\n");
+	return 0;
+ }
+ WatchFPU_Flags = eval (args);
+ if (WatchFPU_Flags == 0)
+ {
+	output ("Watching FPU exceptions disabled\n");
+ }
+ return 0;
+#else
+ output ("watchfpu is not supported on this OS\n");
+ return 0;
+#endif
+}
+
+private variable Cmd_Table = Assoc_Type Ref_Type;
+Cmd_Table"finish" = &finish_cmd;
+Cmd_Table"next" = &next_cmd;
+Cmd_Table"step" = &step_cmd;
+Cmd_Table"break" = &break_cmd;
+Cmd_Table"delete" = &delete_cmd;
+Cmd_Table"cont" = &continue_cmd;
+Cmd_Table"continue" = &continue_cmd;
+Cmd_Table"watch" = &watch_cmd;
+Cmd_Table"list" = &list_cmd;
+Cmd_Table"pprint" = &pprint_cmd;
+Cmd_Table"print" = &print_cmd;
+Cmd_Table"exit" = &exit_cmd;
+Cmd_Table"quit" = &quit_cmd;
+Cmd_Table"up" = &up_cmd;
+Cmd_Table"down" = &down_cmd;
+Cmd_Table"where" = &where_cmd;
+Cmd_Table"watchfpu" = &watchfpu_cmd;
+
+% Aliases
+define sldb_add_alias (alias, cmd)
+{
+ if (0 == assoc_key_exists (Cmd_Table, cmd))
+ return;
+ Cmd_Tablealias = Cmd_Tablecmd;
+}
+sldb_add_alias ("b", "break");
+sldb_add_alias ("c", "continue");
+sldb_add_alias ("d", "delete");
+sldb_add_alias ("h", "help");
+sldb_add_alias ("l", "list");
+sldb_add_alias ("n", "next");
+sldb_add_alias ("p", "print");
+sldb_add_alias ("pp", "pprint");
+sldb_add_alias ("q", "quit");
+sldb_add_alias ("s", "step");
+
+private define help_cmd (cmd, args, file, line)
+{
+ output ("Commands:\n");
+ variable cmds = assoc_get_keys (Cmd_Table);
+ cmds = cmdsarray_sort(cmds);
+ foreach cmd (cmds)
+ output (" %s\n", cmd);
+ return 0;
+}
+Cmd_Table"help" = &help_cmd;
+
+private define sigint_handler (sig)
+{
+ Debugger_Step = STEP_STEP;
+ Stop_Depth = INT_MAX;
+ if (Depth == 0)
+ throw UserBreakError;
+}
+
+private variable Old_Sigint_Handler;
+private define deinit_sigint_handler ()
+{
+#ifexists SIGINT
+ signal (SIGINT, Old_Sigint_Handler);
+#endif
+}
+
+private define init_sigint_handler ()
+{
+#ifexists SIGINT
+ variable old;
+ signal (SIGINT, &sigint_handler, &old);
+ ifnot (_eqs(old, &sigint_handler))
+ Old_Sigint_Handler = old;
+#endif
+}
+
+private variable Last_Frame = -1;
+private variable Last_Function = NULL;
+
+private define debugger_input_loop ()
+{
+ variable max_frame = Max_Current_Frame;
+ %Last_Cmd_Line = NULL;
+ %Last_Cmd = NULL;
+ forever
+ {
+	variable e;
+	try (e)
+	 {
+	 %deinit_sigint_handler ();
+	 init_sigint_handler ();
+	 Debugger_Step = 0;
+
+	 if (Current_Frame > max_frame)
+	 {
+		 Max_Current_Frame = max_frame;
+		 Current_Frame = max_frame;
+	 }
+	 variable info = _get_frame_info (Current_Frame);
+	 variable file = info.file;
+	 variable line = info.line;
+
+	 variable cmdline, cmd, cmd_parm;
+	 forever
+	 {
+		 variable prompt = Prompt;
+#iffalse
+		 prompt = "Depth=${Depth},Stop_Depth=${Stop_Depth} $prompt"$;
+#endif
+		 cmdline = (@Debugger_Methods.read_input)(prompt, Last_Cmd_Line);
+		 if (cmdline == NULL)
+		 throw ReadError, "NULL input returned";
+
+		 cmdline = strtrim (cmdline);
+		 variable tokens = strtok (cmdline, " \t");
+		 if (length (tokens))
+		 {
+		 cmd = tokens0;
+		 break;
+		 }
+	 }
+	 cmd_parm = substr (cmdline, 1+strlen(cmd), -1);
+	 cmd_parm = strtrim (cmd_parm, "\t ");
+
+	 if (0 == assoc_key_exists (Cmd_Table, cmd))
+	 {
+		 output("%s is unknown. Try help.\n", cmd);
+		 Last_Cmd_Line = NULL;
+		 Last_Cmd = NULL;
+		 continue;
+	 }
+	 variable ret = (@Cmd_Tablecmd)(cmd, cmd_parm, file, line);
+	 Last_Cmd_Line = cmdline;
+	 Last_Cmd = cmd;
+	 if (ret) return;
+	 }
+	catch IOError:
+	 {
+	 sldb_stop ();
+	 vmessage ("Caught IOError exception -- stopping the debugger: %S",e.message);
+	 return;
+	 }
+	catch AnyError:
+	 {
+	 output("Caught exception:%S:%S:%S:%S\n", e.file, e.line, e.function, e.message);
+	 }
+ }
+}
+
+private define do_debug (file, line, bp_num)
+{
+ %output ("do_debug: file=%S, line=%S, fun=%S\n", file, line, bp_num);
+ Current_Frame = _get_frame_depth ()-2;
+ Max_Current_Frame = Current_Frame;
+ %vmessage ("Current_Frame=%d\n", Current_Frame);
+ % We do not want the debug_hook catching errors here
+ variable debug_hook = _set_debug_hook (NULL);
+ EXIT_BLOCK
+ {
+	if (Debugger_Step != STEP_EXIT)
+	 {
+	 () = _set_debug_hook (debug_hook);
+	 init_sigint_handler ();
+	 }
+ }
+
+ variable info = _get_frame_info (Current_Frame);
+ if (file == NULL)
+ {
+	file = info.file;
+	if (file == NULL)
+	 file = "???";
+ }
+ if (line == NULL)
+ line = info.line;
+
+ variable fun = info.function;
+ if (fun == NULL) fun = "<top-level>";
+
+ if ((file == "<stdin>"))% or (file == "***string***"))
+ {
+	Last_Frame = Current_Frame;
+	Last_Function = fun;
+	Debugger_Step = STEP_NEXT;
+	Stop_Depth = Depth-1;
+	return;
+ }
+ if (bp_num)
+ {
+	output ("Breakpoint %d, %s\n at %s:%d\n", abs(bp_num), fun, file, line);
+ }
+ else if ((Last_Frame != Current_Frame) or (Last_Function != fun))
+ {
+	output ("%s at %s:%d\n", fun, file, line);
+ }
+ display_file_and_line (file, line, line);
+ Last_Frame = Current_Frame;
+ Last_Function = fun;
+
+ debugger_input_loop ();
+}
+
+private define bos_handler (file, line)
+{
+ %output ("bos: depth=%d, stop_depth=%d, fun=%S\n", Depth,Stop_Depth,_get_frame_info(-1).function);
+ variable pos = make_breakpoint_name (file, line);
+ variable bp = Breakpointspos;
+
+ if (bp)
+ {
+	if (bp < 0) Breakpointspos = 0; % clear temporary breakpoint
+	do_debug (file, line, bp);
+	return;
+ }
+
+ if (Depth > Stop_Depth)
+ return;
+
+ if (Debugger_Step == 0)
+ return;
+
+#iffalse
+ if (Debugger_Step == STEP_FINISH)
+ return;
+
+ if (Debugger_Step == STEP_NEXT)
+ {
+	if (Depth > Stop_Depth)
+	 return;
+ }
+#endif
+ do_debug (file, line, bp);
+}
+
+% end of statement handler: tracks the recursion depth,
+% to be able to step over function calls (using 'Next' Command)
+private define eos_handler()
+{
+#ifexists fpu_clear_except_bits
+ if (WatchFPU_Flags)
+ {
+	variable bits = fpu_test_except_bits (WatchFPU_Flags);
+	if (bits)
+	 {
+	 variable info = _get_frame_info (-1);
+	 variable str = String_Type0;
+	 if (bits & FE_DIVBYZERO) str = str,"FE_DIVBYZERO";
+	 if (bits & FE_INEXACT) str = str,"FE_INEXACT";
+	 if (bits & FE_INVALID) str = str,"FE_INVALID";
+	 if (bits & FE_OVERFLOW) str = str,"FE_OVERFLOW";
+	 if (bits & FE_UNDERFLOW) str = str,"FE_UNDERFLOW";
+	 output ("*** FPU exception bits set: %s\n", strjoin(str, ","));
+	 output ("Entering the debugger.\n");
+	 fpu_clear_except_bits ();
+	 do_debug (info.file, info.line, 0);
+	 }
+ }
+#endif
+ %output ("eos: depth=%d\n", Depth);
+}
+
+private define bof_handler (fun, file)
+{
+ %output ("Entering BOF: %S, %S, %S", fun, file, line);
+ Depth++;
+
+ variable bp = Breakpointsfun;
+ if (bp)
+ {
+	output ("Breakpoint %d, %s\n", abs(bp), fun);
+	if (bp < 0) Breakpointsfun = 0; % clear temporary breakpoint
+	Debugger_Step = STEP_NEXT;
+	Stop_Depth = Depth;
+ }
+}
+
+private define eof_handler ()
+{
+ %output ("Leaving EOF");
+ Depth--;
+ if (Debugger_Step)
+ {
+	if (Debugger_Step == STEP_FINISH)
+	 {
+	 if (Depth == Stop_Depth)
+	 {
+		 Debugger_Step = 0;
+		 %variable info = _get_frame_info (_get_frame_depth ()-2);
+		 %do_debug (info.file, info.line, 0);
+		 do_debug (NULL, NULL, 0);
+	 }
+	 }
+	if ((Debugger_Step == STEP_NEXT) and (Stop_Depth > Depth))
+	 Stop_Depth = Depth;
+ }
+}
+
+private define debug_hook (file, line)
+{
+ if (Startup_PID != getpid())
+ return;
+
+ %variable file = e.file, line = e.line;
+ variable e = __get_exception_info ();
+ output ("Received %s error. Entering the debugger\n", e.descr);
+ check_breakpoints ();
+ do_debug (file, line, 0);
+}
+
+define sldb_enable ()
+{
+ ()=_set_bos_handler (&bos_handler);
+ ()=_set_eos_handler (&eos_handler);
+ ()=_set_bof_handler (&bof_handler);
+ ()=_set_eof_handler (&eof_handler);
+ ()=_set_debug_hook (&debug_hook);
+
+ check_breakpoints ();
+ Depth = 0;
+ Debugger_Step = STEP_STEP;
+ init_sigint_handler ();
+ _traceback = 1;
+ _bofeof_info = 1;
+ _boseos_info = 3;
+}
+
+% Usage Forms:
+% sldb ();
+% sldb (file);
+% sldb (file, ns);
+% The namespace semantics are the same as that of require.
+define sldb ()
+{
+ Startup_PID = getpid ();
+ sldb_initialize ();
+
+ sldb_enable ();
+ if (_NARGS == 0)
+ {
+	Current_Frame = _get_frame_depth ()-1;
+	Max_Current_Frame = Current_Frame;
+	debugger_input_loop ();
+	return;
+ }
+ variable args = __pop_args (_NARGS);
+ require (__push_args (args));
+#iffalse
+ variable ns = current_namespace ();
+ if (_NARGS == 2)
+
+ ns = ();
+ variable file = ();
+
+ if (ns == NULL)
+ () = evalfile (file);
+ else
+ () = evalfile (file, ns);
+#endif
+}
+
+% remove bos and eos handlers.
+define sldb_stop ()
+{
+ ()=_set_bos_handler (NULL);
+ ()=_set_eos_handler (NULL);
+ ()=_set_bof_handler (NULL);
+ ()=_set_eof_handler (NULL);
+ ()=_set_debug_hook (NULL);
+ deinit_sigint_handler ();
+ _bofeof_info = 0;
+ _boseos_info = 0;
+ Debugger_Step = STEP_EXIT;
+}
+
+provide ("sldbcore");

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/sldbsock.sl Added

@@ -0,0 +1,354 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+% This file implements a socket-based wrapper around sldbcore for
+% debugging a separate process. Programs that wish to use this for
+% debugging should something like
+%
+% autoload ("sldb", "sldbcore");
+%
+% in a startup file. Then instead of using `require` or `evalfile` to
+% load a file, use sldb("name-of-file") to load the file to be
+% debugged. Then in another window, run
+%
+% sldb --pid <pid-of-process-to-be-debugged>
+%
+% Do not byte-compile this file. It contains both the client and
+% server code.
+require ("sldbcore");
+require ("socket");
+
+% Simple line-based protocol:
+
+private variable SLDB_SOCKET_PREFIX	= "/tmp/.sldb_";
+
+private variable OK_CMD_RECEIVED	= 200;
+private variable OK_CONT_XFER		= 201;
+private variable OK_XFER_RECEIVED	= 202;
+private variable ERR_UNKNOWN_CMD	= 301;
+
+private variable Debug_Mode = 0;
+
+private define debug_output ()
+{
+ variable args = __pop_args (_NARGS);
+ if (Debug_Mode)
+ {
+	variable fp = stderr;
+	() = fprintf (fp, __push_args (args));
+	() = fflush (fp);
+ }
+}
+
+private define make_socket_name (pid)
+{
+ return "$SLDB_SOCKET_PREFIX$pid"$;
+}
+
+private define do_write (fp, data)
+{
+ variable nbytes = fwrite (data, fp);
+ if ((bstrlen (data) != nbytes)
+ or (-1 == fflush (fp)))
+ throw WriteError;
+
+ debug_output ("** WROTE: %s\n", data);
+}
+
+private define do_fgets (fp)
+{
+ variable buf;
+ if (-1 == fgets (&buf, fp))
+ throw ReadError;
+
+ debug_output ("** READ: %s\n", buf);
+ return buf;
+}
+
+private define receive_response (fp)
+{
+ variable line = do_fgets (fp);
+ return atoi (line);
+}
+
+private define send_response (fp, rsp, txt)
+{
+ rsp = sprintf ("%03d %s\n", rsp, txt);
+ debug_output ("Sending Response:<%s>\n", rsp);
+ do_write (fp, rsp);
+}
+
+private define send_cmd (fp, cmd)
+{
+ debug_output ("Sending CMD:<%s>\n", cmd);
+ do_write (fp, cmd);
+ return receive_response (fp);
+}
+
+private define receive_data (fp)
+{
+ variable data = "";
+ forever
+ {
+	variable line = do_fgets (fp);
+	if (line0 == '.')
+	 {
+	 if (line == ".\n")
+	 break;
+
+	 line = substr (line, 2, -1);
+	 }
+	data = strcat (data, line);
+ }
+ debug_output ("** Received:<%s>\n", data);
+
+ send_response (fp, OK_XFER_RECEIVED, "Ok transfer received");
+ return data;
+}
+
+private define send_data (fp, data)
+{
+ debug_output ("** Sending:<%s>\n", data);
+
+ variable lines = strchop (data, '\n', 0);
+ variable num = length (lines);
+ if (data-1 == '\n')
+ num--;
+
+ _for (0, num-1, 1)
+ {
+	variable i = ();
+	variable line = linesi;
+	if (line0 == '.')
+	 line = strcat (".", line, "\n");
+	else
+	 line = strcat (line, "\n");
+
+	do_write (fp, line);
+ }
+ do_write (fp, ".\n");
+ return receive_response (fp);
+}
+
+%
+
+#ifnexists __SLDB_CLIENT__
+% Server Routines
+
+private variable Server_Socket_fd = NULL;
+private variable Server_Socket_fp = NULL;
+
+private define vmessage_method ()
+{
+ variable args = __pop_args (_NARGS);
+ variable buf = sprintf (__push_args (args));
+ debug_output ("Entering vmessage_method to send <%s>\r\n", buf);
+ variable fp = Server_Socket_fp;
+
+ variable status = send_cmd (fp, "MESSAGE\n");
+ if (status != OK_CONT_XFER)
+ throw IOError, "Client returned $status to MESSAGE command";
+
+ status = send_data (fp, buf);
+ if (status != OK_XFER_RECEIVED)
+ throw IOError, "Expected OK_XFER_RECEIVED, got $status"$;
+
+ debug_output ("Leaving vmessage_method\r\n");
+}
+
+private define open_file_at_linenum (file, linenum)
+{
+ if (path_extname (file) == ".slc")
+ file = path_sans_extname (file) + ".sl";
+
+ variable fp = fopen (file, "r");
+ if (fp == NULL)
+ {
+	vmessage_method ("Unable to open %s\n", file);
+	return NULL;
+ }
+ if (linenum == 1)
+ return fp;
+
+ foreach (fp) using ("line")
+ {
+	variable line = ();
+	linenum--;
+	if (linenum == 1)
+	 break;
+ }
+ return fp;
+}
+
+private define list_method (file, linemin, linemax)
+{
+ variable n = linemax - linemin + 1;
+ foreach (open_file_at_linenum (file, linemin))
+ {
+	variable line = ();
+	vmessage_method ("%d\t%s", linemin, line);
+	linemin++;
+	if (linemin > linemax)
+	 break;
+ }
+}
+
+private define read_input_method (prompt, default_cmd)
+{
+ variable fp = Server_Socket_fp;
+
+ do
+ {
+	variable status = send_cmd (fp, "INPUT\n");
+	if (status != OK_CONT_XFER)
+	 throw IOError, "Expected OK_CONT_XFER, got $status"$;
+
+	status = send_data (fp, prompt);
+
+	if (status != OK_XFER_RECEIVED)
+	 throw IOError, "Expected OK_XFER_RECEIVED, got $status"$;
+
+	variable input = receive_data (fp);
+	if (input == "\n")
+	 input = default_cmd;
+ }
+ while ((input == "") or (input == NULL));
+ return input;
+}
+
+private define quit_method ()
+{
+ variable fp = Server_Socket_fp;
+ () = send_cmd (fp, "QUIT\n");
+ exit (0);
+}
+
+private define exit_method ()
+{
+ variable fp = Server_Socket_fp;
+ () = send_cmd (fp, "EXIT\n");
+}
+
+private define initialize_server ()
+{
+ if (Server_Socket_fd != NULL)
+ return;
+
+ variable s = socket (PF_UNIX, SOCK_STREAM, 0);
+ variable name = make_socket_name (getpid ());
+ bind (s, name);
+ () = chmod (name, S_IRUSR|S_IWUSR);
+ listen (s, 1);
+ Server_Socket_fd = accept (s);
+ Server_Socket_fp = fdopen (Server_Socket_fd, "r+");
+ if (Server_Socket_fd == NULL)
+ throw OpenError, errno_string (errno);
+
+ vmessage_method ("Welcome to sldb");
+}
+
+define sldb_initialize ()
+{
+ initialize_server ();
+ variable m = sldb_methods ();
+ m.list = &list_method;
+ m.vmessage = &vmessage_method;
+ m.read_input = &read_input_method;
+ m.quit = &quit_method;
+ m.pprint = NULL;
+ m.exit = &exit_method;
+}
+#endif				 % ! __SLDB_CLIENT__
+
+#ifexists __SLDB_CLIENT__
+% Client Routines
+
+private define read_command (s)
+{
+ variable line = strtrim (do_fgets (s));
+ return line;
+}
+
+private define handle_message_cmd (s)
+{
+ send_response (s, OK_CONT_XFER, "Ok continue transfer");
+ variable msg = receive_data (s);
+
+ () = fputs (msg, stdout);
+ () = fflush (stdout);
+}
+
+private define handle_input_cmd (s)
+{
+ send_response (s, OK_CONT_XFER, "Ok continue transfer");
+ variable prompt = receive_data (s);
+
+ prompt = strtrim (prompt, "\n");
+ forever
+ {
+	try
+	 {
+	 variable line = slsh_readline (prompt);
+	 }
+	catch UserBreakError: continue;
+	if (line != NULL)
+	 break;
+ }
+ send_data (s, line);
+}
+
+private define handle_unknown_cmd (s)
+{
+ send_response (s, ERR_UNKNOWN_CMD, "Error Unknown Command");
+}
+
+define sldbsock_attach (pid)
+{
+ variable name = make_socket_name (pid);
+ variable s = socket (PF_UNIX, SOCK_STREAM, 0);
+ variable e;
+ try (e)
+ {
+	connect (s, name);
+ }
+ catch SocketError:
+ {
+	() = fprintf (stderr, "Unable to connect to socket %s\n", name);
+	() = fprintf (stderr, "Is the remote process ready to be debugged?\n");
+	return -1;
+ }
+
+ variable fp = fdopen (s, "r+");
+ forever
+ {
+	variable cmd = read_command (fp);
+	if (cmd == "MESSAGE")
+	 {
+	 handle_message_cmd (fp);
+	 continue;
+	 }
+	if (cmd == "INPUT")
+	 {
+	 handle_input_cmd (fp);
+	 continue;
+	 }
+	if (cmd == "QUIT")
+	 {
+	 send_response (fp, OK_CMD_RECEIVED, "Ok Cmd Received");
+	 return 0;
+	 }
+	if (cmd == "EXIT")
+	 {
+	 send_response (fp, OK_CMD_RECEIVED, "Ok Cmd Received");
+	 return 0;
+	 }
+	handle_unknown_cmd (fp, cmd);
+ }
+}
+
+#endif
+
+provide ("sldbsock");

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/slshhelp.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/slshrl.sl Added

@@ -0,0 +1,446 @@
+% -*- mode: SLang; mode: fold -*-
+
+% This file was written with the help of Mike Noble and John Houck.
+require ("slshhelp");
+
+if (is_defined ("slsh_help"))
+ use_namespace ("slsh_interactive");
+else
+ implements ("slsh_interactive");
+
+#ifnexists quit
+public define quit () { exit (0); }
+#endif
+
+public define slsh_apropos ()
+{
+ if (_NARGS == 0)
+ {
+	vmessage ("apropos what?");
+	return;
+ }
+ variable name = ();
+ variable help = _apropos ("Global", "\\C"+name, 0xF);
+ variable ns = current_namespace ();
+ if (strlen (ns)
+ and (ns != "Global"))
+ {
+	variable help1 = _apropos (ns, "\\C"+name, 0xF);
+	help1 = (ns + "->") + help1;
+	help = help, help1;
+ }
+
+ if (0 == length (help))
+ {
+	() = fprintf (stdout, "No matches for %S\n", name);
+	return;
+ }
+
+ () = fprintf (stdout, " apropos %s ==>\n", name);
+ help = helparray_sort(help);
+ foreach (help)
+ {
+	help = ();
+	() = fprintf (stdout, " %s\n", help);
+ }
+}
+
+private define generic_help ()
+{
+ variable help =
+ 
+ "Most commands must end in a semi-colon.",
+ "If a command begins with '!', then the command is passed to the shell.",
+ " Examples: !ls, !pwd, !cd foo, ...",
+ "Parenthesis are automatically added if the first word is a function and",
+ "is followed by a ','. For example:",
+ " plot, 1, 2;color=\"red\" ==> plot(1,2;color=\"red\");",
+ "Special commands:",
+ " help <help-topic>",
+ " apropos <something>",
+ " start_log( <optional-log-file> );",
+ " start logging input to a file (default is slsh.log)",
+ " stop_log();",
+ " stop logging input",
+ " save_input (<optional-file>);",
+ " save all previous input to a file (default: slsh.log)",
+ " who;",
+ " show a list of locally defined variables and functions",
+ " quit;"
+ ;
+
+ foreach (help)
+ {
+	variable h = ();
+	() = fprintf (stdout, "%s\n", h);
+ }
+}
+
+public define slsh_help ()
+{
+ if (_NARGS == 0)
+ {
+	generic_help ();
+	return;
+ }
+
+ variable name = ();
+ variable help = slsh_get_doc_string (name);
+ if (help != NULL)
+ {
+	print (help; noescape);
+	return;
+ }
+ () = fprintf (stdout, "*** No help on %s\n", name);
+ slsh_apropos (name);
+}
+
+public define slsh_who ()
+{
+ variable a, name, obj;
+ variable pat;
+
+ if (_NARGS == 0)
+ "";
+
+ pat = ();
+
+ variable names = _apropos ("", pat, 8); % user defined variable
+ foreach (namesarray_sort (names)) % user defined variable
+ {
+	name = ();
+	variable type;
+	obj = __get_reference (name);
+	if (__is_initialized (obj))
+	 {
+	 obj = @obj;
+	 type = typeof (obj);
+	 }
+	else
+	 {
+	 type = Undefined_Type;
+	 obj = "";
+	 }
+
+	if ((type == String_Type) || (type == BString_Type))
+	 print (obj, &obj);
+
+	variable txt = sprintf ("%S %S=%S", type, name, obj);
+	if (strlen(txt) > 79)
+	 txt = substr (txt, 1, 76) + "...";
+	message (txt);
+ }
+
+ names = _apropos ("", pat, 2); % user defined function
+ foreach (namesarray_sort(names))
+ {
+	name = ();
+	vmessage ("function %s()", name);
+ }
+}
+
+private variable Append_Semicolon = 0;
+public define slsh_append_semicolon (val)
+{
+ Append_Semicolon = val;
+}
+
+static define sys_shell_cmd (cmd)
+{
+ variable status;
+
+ status = system (cmd);
+ !if (status)
+ return;
+
+ () = fprintf (stdout, "shell command returned %d\n", status);
+}
+
+static define sys_chdir_cmd (dir) %{{{
+{
+ if (-1 == chdir (dir))
+ () = fprintf (stderr, "chdir(%s) failed: %s\n", dir, errno_string (errno));
+}
+
+%}}}
+
+% Support interactive mode which doesn't require the ';' EOL mark.
+% Note that this no-semicolon-required mode causes surprising
+% behavior in the '.source' intrinsic. I'm taking the view
+% that that's the price users must pay for the convenience of
+% not typing the semicolons.
+private define maybe_append_semicolon (input)
+{
+ !if (Append_Semicolon)
+ return input;
+
+ if (input-1 != ';')
+ input = strcat (input, ";");
+ return input;
+}
+
+% This function is called after input has been read.
+% It should be rewritten and made cleaner.
+public define slsh_interactive_massage_hook (input)
+{
+ variable s, n;
+ variable s0;
+ variable ch;
+
+ input = strtrim (input);
+ !if (strlen (input))
+ return input;
+
+ ch = input0;
+
+ if (ch == '!')
+ {
+	% shell command, unlesss !if
+	if (string_match (input, "^!if \t*(", 1))
+	 return input;
+
+	input = strtrim (input1:);
+ input = str_quote_string (input, "\"", '\\');
+
+	% cd is special. On unix systems we do not want to execute it in
+	% a shell.
+	if (strtok (input)0 == "cd")
+	 {
+	 return sprintf ("slsh_interactive->sys_chdir_cmd(\"%s\");",
+			 strtrim (input2:));
+	 }
+
+	return sprintf ("slsh_interactive->sys_shell_cmd(\"%s\");", input);
+ }
+
+ if (ch != '.')
+ {
+	% If the first non-word character is a comma, and the first
+	% word is callable, then wrap the rest of the arguments in
+	% parenthesis.
+	s = strtrim (strtrans (input, "\\w", ""));
+	if (s0 == ',')
+	 {
+	 s0 = strtok (input, ", \t")0;
+	 if (__is_callable(__get_reference(s0)))
+	 {
+		 (s,) = strreplace (input, ",", "(", 1);
+		 return strcat (s, ");");
+	 }
+	 }
+
+	s = strtok (input, " \t");
+	s = strtok (input, " \t()\";");
+	if (length (s) == 0)
+	 return input;
+	s0 = s0;
+	if ((s0 == "exit") && (length (s)==1))
+	 usage ("Try 'quit' to exit");
+
+	if (all (s0 != "help", "apropos", "quit", "who"))
+	 return maybe_append_semicolon (input);
+ }
+ else % line begins with "."
+ {
+	if (input1 == ' ')
+	 {
+	 % RPN
+	 return input;
+	 }
+
+	% The only thing that is syntactically valid here that begins
+	% with a '.' is a floating point number.
+	if (isdigit(input1))
+	 {
+	 % Do not allow the line to be parsed as RPN. So prefix
+	 % with a space.
+	 return strcat (" ", maybe_append_semicolon (input));
+	 }
+	%return sprintf ("eval(\" %s\");", input);
+
+	input = input1:;
+
+	s = strtok (input);
+	s0 = s0;
+ }
+
+ if (length (s) < 2)
+ {
+	if (s0 == "help")
+	 return "slsh_help();";
+
+	if (s0 == "quit")
+	 return "exit(0);";
+
+	if (s0 == "who")
+	 return "slsh_who();";
+
+	return input;
+ }
+
+ if (length (s) == 2)
+ {
+	% Here the input consists of 2 words such as:
+	% cd foo
+	% load bar
+	% help goo
+	% apropos boo
+	variable s1 = s1;
+
+	if (s10 != '(')
+	 {
+	 if ((s0 == "apropos") or (s0 == "help"))
+	 {
+		 s0 = strcat ("slsh_", s0);
+
+		 if (0 == is_substr (s1, "\""))
+		 return sprintf ("%s(\"%s\");", s0, s1);
+		 else
+		 return sprintf ("%s(%s);", s0, s1);
+	 }
+
+	 if (s0 == "cd")
+	 return sprintf ("slsh_interactive->sys_chdir_cmd(\"%s\");", s1);
+
+	 % Assume the next arg is a slang script.
+
+	 if ((strlen(path_extname (s1)) == 0)
+		 and (NULL != stat_file (s1 + ".sl")))
+	 s1 = s1 + ".sl";
+
+	 if (s0 == "load")
+	 return sprintf ("()=evalfile(\"%s\");", s1);
+
+#iffalse
+	 if (s0 == "source")
+	 return sprintf ("%s(\"%s\");", s0, s1);
+#endif
+	 }
+ }
+
+ % Anything else that does not look like a slang command will be converted
+ % to a function call
+ input = sprintf ("%s(%s);", s0, inputstrlen (s0):);
+
+ return input;
+}
+
+%}}}
+
+%---------------------------------------------------------------------------
+% Logging Functions
+%---------------------------------------------------------------------------
+private variable Log_File = "slsh.log";
+
+public define slsh_set_log_file (logfile)
+{
+ Log_File = logfile;
+}
+
+private variable Log_File_Fp = NULL;
+private variable Input_Line_List = NULL;
+private variable Last_Input_Line = NULL;
+
+private define open_log_file (file)
+{
+ variable fp = fopen (file, "w");
+ if (fp == NULL)
+ vmessage ("***Warning: Unable to log to %s\n", file);
+ return fp;
+}
+
+private define log_this ()
+{
+ variable args = __pop_args (_NARGS);
+ if (Log_File_Fp == NULL)
+ return;
+
+ if (-1 == fprintf (Log_File_Fp, __push_args(args)))
+ {
+	vmessage ("Failed to write to log file-- logging stopped\n");
+	Log_File_Fp = NULL;
+ }
+}
+
+public define start_log ()
+{
+ if (_NARGS)
+ Log_File = ();
+
+ Log_File_Fp = open_log_file (Log_File);
+ if (Log_File_Fp == NULL)
+ return;
+
+ log_this ("%% Logging started on %s\n", time ());
+ log_this ("_auto_declare=%d;\n\n", _auto_declare);
+ vmessage ("Logging input to %s\n", Log_File);
+}
+
+public define stop_log ()
+{
+ log_this ("%% Logging stopped on %s\n", time ());
+ Log_File_Fp = NULL;
+}
+
+public define save_input ()
+{
+ variable file;
+
+ !if (_NARGS)
+ Log_File;
+
+ file = ();
+
+ if (Input_Line_List == NULL)
+ return;
+
+ variable fp = open_log_file (file);
+ if (fp == NULL)
+ return;
+
+ variable l = Input_Line_List;
+ while (l != NULL)
+ {
+	() = fprintf (fp, "%s\n", l.line);
+	l = l.next;
+ }
+ vmessage ("Input saved to %s", file);
+}
+
+private define log_input (buf)
+{
+ buf = strtrim (buf);
+ !if (strlen (buf))
+ return;
+
+ variable l = struct
+ {
+	line, next
+ };
+ l.line = buf;
+ if (Input_Line_List == NULL)
+ {
+	Input_Line_List = l;
+ }
+ else Last_Input_Line.next = l;
+ Last_Input_Line = l;
+
+ if (Log_File_Fp != NULL)
+ log_this ("%s\n", buf);
+}
+
+public define slsh_interactive_after_hook (line)
+{
+ log_input (line);
+}
+
+public define slsh_interactive_before_hook ()
+{
+ variable n = _stkdepth ();
+ _stk_reverse (n);
+ loop (n)
+ {
+	variable v = ();
+	() = fprintf (stdout, "%S\n", v);
+ }
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/stkcheck.sl Added

@@ -0,0 +1,118 @@
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+%---------------------------------------------------------------------------
+% This file adds BOS/EOS hooks to the interpreter to help debug stack problems.
+% To use it, put the following at the top of a problematic file:
+%
+% require ("stkcheck");
+% enable_stack_check ();
+%
+% To check only portions of a file, surround the suspect functions by:
+%
+% enable_stack_check ();
+% .
+% .
+% disable_stack_check ();
+%
+_boseos_info = 0;
+private variable Stack = Struct_Type512;
+private variable Stack_Depth = 0;
+
+private variable Output_Hook = NULL;
+private variable Output_Hook_Args = NULL;
+
+define stkcheck_set_output_hook ()
+{
+ if (_NARGS == 0)
+ {
+	Output_Hook = NULL;
+	Output_Hook_Args = NULL;
+	return;
+ }
+
+ Output_Hook_Args = __pop_list (_NARGS-1);
+ Output_Hook = ();
+}
+
+private define output ()
+{
+ variable args = __pop_list (_NARGS);
+ variable str = sprintf (__push_list (args));
+
+ if (Output_Hook != NULL)
+ return (@Output_Hook)(__push_list (Output_Hook_Args), str);
+
+ () = fprintf (stderr, __push_list (args));
+}
+
+private define bos_handler (file, line)
+{
+ if (Stack_Depth >= length (Stack))
+ throw StackOverflowError, "BOS stack overflow";
+
+ variable s = struct
+ {
+	file, line, depth
+ };
+ s.file = file;
+ s.line = line;
+ s.depth = _stkdepth ();
+ StackStack_Depth = s;
+ Stack_Depth++;
+}
+
+private define eos_handler ()
+{
+ if (Stack_Depth <= 0)
+ return;
+ %throw StackUnderflowError, "BOS stack depth underflow";
+ Stack_Depth--;
+ variable s = StackStack_Depth;
+ variable depth = _stkdepth ();
+ if (depth != s.depth)
+ {
+	if (depth < s.depth)
+	 ;
+	else
+	 {
+	 output ("%s:%d: %d object(s) left on the stack\n", s.file, s.line, depth-s.depth);
+	 if ((s.file == "***string***") && (Stack_Depth > 0))
+	 {
+		 s = StackStack_Depth-1;
+		 output (" called from %s:%d\n", s.file, s.line);
+	 }
+	 }
+ }
+}
+
+define enable_stack_check ()
+{
+ ()=_set_bos_handler (&bos_handler);
+ ()=_set_eos_handler (&eos_handler);
+ Stack_Depth = 0;
+ _boseos_info = 1;
+}
+
+define disable_stack_check ()
+{
+ ()=_set_bos_handler (NULL);
+ ()=_set_eos_handler (NULL);
+ Stack_Depth = 0;
+ _boseos_info = 0;
+}
+
+#ifexists _jed_version
+private define output_to_buffer (buf, str)
+{
+ variable cbuf = whatbuf ();
+ setbuf (buf);
+ insert (str);
+ setbuf (cbuf);
+}
+if (BATCH == 0) stkcheck_set_output_hook (&output_to_buffer, "*traceback*");
+#endif
+
+provide ("stkcheck");

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/structfuns.sl Added

@@ -0,0 +1,98 @@
+% Struct functions
+% Copyright (C) 2012-2017,2018 John E. Davis
+%
+% This file is part of the S-Lang Library and may be distributed under the
+% terms of the GNU General Public License. See the file COPYING for
+% more information.
+private define make_indices (num_dims, d, i)
+{
+ _for (0, num_dims-1, 1)
+ {
+	variable j = ();
+	if (j == d)
+	 i;
+	else
+	 :;
+ }
+}
+
+define struct_filter (s, i)
+{
+ variable dim = qualifier ("dim");
+ variable copy = qualifier_exists ("copy");
+ if (copy)
+ s = @s;
+
+ variable field;
+ foreach field (get_struct_field_names (s))
+ {
+	variable value = get_struct_field (s, field);
+	if (typeof (value) != Array_Type)
+	 continue;
+	if (dim == NULL)
+	 {
+	 set_struct_field (s, field, valuei);
+	 continue;
+	 }
+	variable dims = array_shape (value);
+	variable num_dims = length (dims);
+	variable d = dim;
+	if (d < 0)
+	 d += num_dims;
+
+	if ((d < 0) || (d >= num_dims))
+	 continue;
+
+	set_struct_field (s, field, valuemake_indices(num_dims, d, i));
+ }
+ if (copy)
+ return s;
+}
+
+define struct_combine ()
+{
+ variable args = __pop_list (_NARGS);
+ variable fields = String_Type0;
+ variable arg;
+ foreach arg (args)
+ {
+	if (arg == NULL)
+	 continue;
+	if (is_struct_type (arg))
+	 arg = get_struct_field_names (arg);
+	fields = fields, arg;
+ }
+
+ % Get just the unique names
+ variable i, a = Assoc_TypeInt_Type;
+ ifnot (length (fields))
+ return NULL;
+ _for i (0, length (fields)-1, 1)
+ afieldsi = i;
+ i = assoc_get_values (a);
+ fields = fieldsiarray_sort (i);
+
+ variable s = @Struct_Type (fields);
+ foreach arg (args)
+ {
+	if (0 == is_struct_type (arg))
+	 continue;
+	foreach (get_struct_field_names (arg))
+	 {
+	 variable field = ();
+	 set_struct_field (s, field, get_struct_field (arg, field));
+	 }
+ }
+ return s;
+}
+
+define struct_field_exists (s, field)
+{
+ return length (where (field == get_struct_field_names (s)));
+}
+
+$1 = path_concat (path_dirname (__FILE__), "help/structfuns.hlp");
+if (NULL != stat_file ($1))
+ add_doc_file ($1);
+
+provide ("structfuns");

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/test Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/test/common.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/test/runtests.sh Added

@@ -0,0 +1,52 @@
+#!/bin/sh
+
+ROOT="`pwd`/../../.."
+SLSHROOT="$ROOT/slsh"
+export SLSH_CONF_DIR="$SLSHROOT/etc"
+export SLSH_PATH="$SLSHROOT/lib:$ROOT/modules"
+export SLANG_MODULE_PATH="$ROOT/modules/${ARCH}objs"
+export LD_LIBRARY_PATH="$ROOT/src/${ARCH}elfobjs"
+export DYLD_LIBRARY_PATH="$ROOT/src/${ARCH}elfobjs"
+
+run_test_pgm="$SLSHROOT/${ARCH}objs/slsh_exe -n -g"
+#run_test_pgm="$SLSHROOT/${ARCH}objs/slsh_exe -n -g $SLSHROOT/scripts/sldb"
+runprefix="$SLTEST_RUN_PREFIX"
+#runprefix="valgrind --tool=memcheck --leak-check=yes --error-limit=no --num-callers=25"
+#runprefix="gdb --args"
+
+
+########################################################################
+
+if  $# -eq 0 
+then
+    echo "Usage: $0 test1.sl test2.sl ..."
+    exit 64
+fi
+
+echo
+echo "Running slsh lib tests:"
+echo
+
+n_failed=0
+tests_failed=""
+for testxxx in $@
+do
+    $runprefix $run_test_pgm $testxxx
+
+    if  $? -ne 0 
+    then
+	n_failed=`expr $n_failed + 1`
+	tests_failed="$tests_failed $testxxx"
+    fi
+done
+
+echo
+if  $n_failed -eq 0 
+then
+    echo "All tests passed."
+else
+    echo "$n_failed tests failed: $tests_failed"
+fi
+echo
+
+exit $n_failed

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/test/test_cmdopt.sl Added

@@ -0,0 +1,149 @@
+() = evalfile ("./common.sl");
+
+require("cmdopt.sl");
+
+private define test_args (opts, args, expected_iend, s, val_list, should_error)
+{
+   try
+     {
+	variable iend = cmdopt_process (opts, args, 0);
+	if (should_error)
+	  throw RunTimeError;
+
+	variable names = get_struct_field_names (s);
+	_for (0, length(val_list)-1, 1)
+	  {
+	     variable i = ();
+	     variable name = namesi;
+	     variable val0 = get_struct_field (s, name);
+	     variable val1 = val_listi;
+
+	     ifnot (_eqs (val0, val1))
+	       throw RunTimeError, "Expecteding $name=$val1, found $val0"$;
+	     i++;
+	  }
+	if (iend != expected_iend)
+	  throw RunTimeError, "iend=${expected_iend}, found $iend"$;
+     }
+   catch AnyError:
+     {
+	if (should_error == 0)
+	  throw;
+     }
+}
+
+private define test_list_args (opts, args, expected_iend, listp, val_list, should_error)
+{
+   try
+     {
+	variable iend = opts.process (args, 0);
+	if (should_error)
+	  throw RunTimeError;
+
+	variable list = @listp;
+	if (iend != expected_iend)
+	  throw RunTimeError, "iend=${expected_iend}, found $iend"$;
+
+	if (length (list) != length (val_list))
+	  throw RunTimeError, "list not of expected size";
+	ifnot (_eqs (list, val_list))
+	  throw RunTimeError, "list does not have expected items";
+     }
+   catch AnyError:
+     {
+	if (should_error == 0)
+	  throw;
+     }
+}
+
+private define callback_opt (value, ref)
+{
+   @ref = value;
+}
+
+private define callback_inc (ref)
+{
+   @ref += 1;
+}
+
+private define test_cmdopt ()
+{
+   variable opts = cmdopt_new (NULL);
+   variable s = struct
+     {
+	foo = 1,
+	verb = 0,
+	opt = NULL,
+	a = 0,
+	f = 1.0,
+	l = 0,
+	g, h,
+	list,
+	b = 0,
+     };
+   cmdopt_add (opts, "f|foo", &s.foo; type="int");
+   cmdopt_add (opts, "v|verb", &s.verb; inc);
+   cmdopt_add (opts, "opt", &s.opt; optional="opt-default", type="string");
+   cmdopt_add (opts, "a|al", &s.a);
+   cmdopt_add (opts, "float", &s.f; type="float");
+   cmdopt_add (opts, "l|lil", &s.l; type="int", optional=3);
+
+   variable args;
+
+   set_struct_fields (s, 1,0,NULL,0,1.0,0);
+   args = "--foo", "7", "-vvv", "-al", "-l4", "foo";
+   test_args (opts, args, 5, s, {7, 3, NULL, 1, 1.0, 4}, 0);
+
+   set_struct_fields (s, 1,0,NULL,0,1.0,0);
+   args = "--foo=2", "-v", "-al", "--opt", "foo";
+   test_args (opts, args, 4, s, {2, 1, "opt-default", 1, 1.0, 3}, 0);
+
+   set_struct_fields (s, 1,0,NULL,0,1.0,0);
+   args = "-vvl", "-af", "-1", "foo";
+   test_args (opts, args, 3, s, {-1, 2, NULL, 1, 1.0, 3}, 0);
+
+   set_struct_fields (s, 1, 0, "opt", -1, PI, -1);
+   args = "-vv", "-f24", "-al", "--float", "-1", "-v", "--", "foo";
+   test_args (opts, args, 7, s, {24, 3, "opt", 1, -1.0, 3}, 0);
+
+   set_struct_fields (s, 1, 0, "opt", -1, PI, -1);
+   args = "-vv", "-f-24", "-al", "--float", "-1", "-v", "-", "foo";
+   test_args (opts, args, 6, s, {-24, 3, "opt", 1, -1.0, 3}, 0);
+
+   set_struct_fields (s, 1, 0, "opt", -1, PI, -1);
+   args = "-vv", "-f36", "-al", "--float", "-1", "-v";
+   test_args (opts, args, 6, s, {36, 3, "opt", 1, -1.0, 3}, 0);
+
+   cmdopt_add (opts, "g|ginc", &callback_inc, &s.g; inc);
+   cmdopt_add (opts, "h|hfun", &callback_opt, &s.h; type="int");
+
+   set_struct_fields (s, 1, 0, "opt", -1, PI, -1, 0, 1);
+   args = "-vv", "-f35", "-g", "-al", "--float", "-1", "-h3", "-v";
+   test_args (opts, args, 8, s, {35, 3, "opt", 1, -1.0, 3, 1, 3}, 0);
+
+   opts.add ("list", &s.list; type="string", optional="foo", append);
+   args = "--list", "--list=3", "--list=bar";
+   test_list_args (opts, args, 3, &s.list, {"foo", "3", "bar"}, 0);
+
+   s = struct {bitmap = 1, flags=0x4|0x2};
+   opts = cmdopt_new (NULL);
+   opts.add ("a|b8000", &s.bitmap; bor=0x8000);
+   opts.add ("b|b4000", &s.bitmap; bor=0x4000);
+   opts.add ("f", &s.flags; bor=1, band=~0x2);
+   args = "-a", "-f", "--b4000";
+   test_args (opts, args, 3, s, {0x8000|0x4000|1, 0x4|0x1}, 0);
+}
+
+define slsh_main ()
+{
+   start_test ("cmdopt");
+   variable e;
+   try(e)
+     {
+	test_cmdopt ();
+     }
+   catch AnyError:
+     failed ("%S", e.message);
+
+   end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/test/test_listfuns.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/test/test_print.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/test/test_process.sl Added

@@ -0,0 +1,42 @@
+() = evalfile ("./common.sl");
+
+require ("process");
+
+private define pre_exec_hook (fdlist, optarg)
+{
+   putenv ("TEST_OPTARG=$optarg");
+}
+
+private define test_process ()
+{
+   % This is a silly example.  echo write to fd=12, which has stdout
+   % dup'd to it.  wc reads from echo via fd=16, which has stdin dup'd
+   % to it.
+   variable echo = new_process ("echo", "foo bar"; write=12, dup1=12,
+				pre_exec_hook=&pre_exec_hook,
+				pre_exec_hook_optarg="FOOBAR");
+
+   variable wc = new_process ("wc"; write=10, dup1=10, fd16=echo.fd12, dup0=16);
+
+   variable line;
+   if (-1 == fgets (&line, wc.fp10))
+     failed ("Failed to read from wc process: " + errno_string ());
+   line = strcompress (line, " \t\n");
+   if (line != "1 2 8")
+     {
+	failed ("Expected 1 2 8, got %s\n", line);
+     }
+   variable status = echo.wait ();
+   if (status == NULL)
+     failed ("wait method failed for echo");
+   status = wc.wait ();
+   if (status == NULL)
+     failed ("wait method failed for echo");
+}
+
+define slsh_main ()
+{
+   start_test ("process");
+   test_process ();
+   end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/test/test_readascii.sl Added

@@ -0,0 +1,144 @@
+() = evalfile ("./common.sl");
+require("readascii");
+
+private define make_xyz_data (xmin, xmax, n)
+{
+   variable x = xmin:xmax:#n;
+   variable y = cos (x);
+   variable z = sin (x);
+
+   return x, y, z;
+}
+
+private define make_lines_array (x, y, z, delim)
+{
+   variable n = length (x);
+   variable fmt = strcat (strjoin ("%S", "%S", "%S", delim), "\n");
+   return array_map (String_Type, &sprintf, fmt, x, y, z);
+}
+
+private define make_lines_list (x, y, z, delim)
+{
+   variable list = {};
+   foreach (make_lines_array (x, y, z, delim))
+     {
+	variable line = ();
+	list_append (list, line);
+     }
+   return list;
+}
+
+private define concat_lines ()
+{
+   variable args = __pop_list (_NARGS);
+   if (typeof (args0) == Array_Type)
+     return __push_list(args);
+
+   variable list = args0;
+   _for (1, _NARGS-1, 1)
+     {
+	variable i = ();
+	variable item = argsi;
+	if (typeof (item) != List_Type)
+	  {
+	     list_append (list, item);
+	     continue;
+	  }
+	while (length (item))
+	  list_append (list, list_pop (item));
+     }
+   return list;
+}
+
+private define run_test (make_lines_func)
+{
+   variable xmin = 1.0, xmax = 5.0, n = 20;
+
+   variable x, y, z;
+   (x, y, z) = make_xyz_data (xmin, xmax, n);
+   variable delim = ",";
+
+   variable lines = (@make_lines_func) (x, y, z, ",");
+   variable xa, ya, za, na;
+   variable lastline, lastlinenum;
+
+   na = readascii (lines, &xa, &ya, &za; delim=",", lastlinenum=&lastlinenum);
+   if (n != na)
+     failed ("readascii returned $na, not $n as expected"$);
+   if (lastlinenum != n)
+     failed ("lastlinenum=$lastlinenum instead of $n"$);
+   if (any (fneqs(x, xa) or fneqs(y, ya) or fneqs(z, za)))
+     failed ("Arrays have unequal values");
+
+   variable x1, y1, z1, n1 = 2;
+   (x1, y1, z1) = make_xyz_data (xmax, 2*xmax, n1);
+   lines = concat_lines (lines, "@\n", (@make_lines_func)(x1, y1, z1, delim));
+
+   na = readascii (lines, &xa, &ya, &za; delim=",", lastlinenum=&lastlinenum);
+   if (n+n1 != na)
+     failed ("readascii returned $na, not $n1 + $n2 as expected"$);
+   if (lastlinenum != length (lines))
+     failed ("lastlinenum=$lastlinenum instead of $n"$);
+   if (any (fneqs(x,x1, xa) or fneqs(y,y1, ya) or fneqs(z,z1, za)))
+     failed ("Arrays have unequal values");
+
+   na = readascii (lines, &xa, &ya, &za; delim=",", lastlinenum=&lastlinenum,
+		   lastline=&lastline, stop_on_mismatch);
+   if (n != na)
+     failed ("readascii returned $na, not $n as expected"$);
+   if (lastlinenum != n+1)
+     failed ("lastlinenum=$lastlinenum instead of $n+1"$);
+   if (any (fneqs(x, xa) or fneqs(y, ya) or fneqs(z, za)))
+     failed ("Arrays have unequal values");
+   if (lastline != "@\n")
+     failed ("lastline=$lastline instead of @\n");
+
+   lines = concat_lines (lines, "%%%%%%\n");
+
+   na = readascii (lines, &xa, &ya, &za; delim=",",
+		   lastlinenum=&lastlinenum, lastline=&lastline,
+		   comment="@", stop_on_mismatch);
+   if (n+n1 != na)
+     failed ("readascii returned $na, not return $n+$n1 as expected"$);
+   if (lastlinenum != length (lines))
+     failed ("lastlinenum=$lastlinenum instead of $n"$);
+   if (any (fneqs(x,x1, xa) or fneqs(y,y1, ya) or fneqs(z,z1, za)))
+     failed ("Arrays have unequal values");
+   if (lastline != lines-1)
+     failed ("lastline=$lastline instead of lines-1");
+
+   na = readascii (lines, &za, &xa; delim=",", cols=1,3,
+		   lastlinenum=&lastlinenum, lastline=&lastline,
+		   comment="@", stop_on_mismatch);
+   if (n+n1 != na)
+     failed ("readascii returned $na, not return $n+$n1 as expected"$);
+   if (lastlinenum != length (lines))
+     failed ("lastlinenum=$lastlinenum instead of $n"$);
+   if (any (fneqs(x,x1, za) or fneqs(z,z1, xa)))
+     failed ("Arrays have unequal values");
+   if (lastline != lines-1)
+     failed ("lastline=$lastline instead of lines-1");
+
+   na = readascii (lines, &za, &xa; delim=",", as_list, cols=1,3,
+		   lastlinenum=&lastlinenum, lastline=&lastline,
+		   comment="@", stop_on_mismatch);
+   if (n+n1 != na)
+     failed ("readascii returned $na, not return $n+$n1 as expected"$);
+   if (lastlinenum != length (lines))
+     failed ("lastlinenum=$lastlinenum instead of $n"$);
+   if ((typeof (za) != List_Type) || (typeof (xa) != List_Type))
+     failed ("Used as_list qualifier but did not get a list, got $za,$xa"$);
+   if (any (fneqs(x,x1, __push_list(za))
+	    or fneqs(z,z1, __push_list(xa) )))
+     failed ("Arrays have unequal values");
+   if (lastline != lines-1)
+     failed ("lastline=$lastline instead of lines-1");
+}
+
+define slsh_main ()
+{
+   start_test ("readascii");
+   run_test (&make_lines_array);
+   run_test (&make_lines_list);
+   end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/test/test_setfuns.sl Added

@@ -0,0 +1,72 @@
+() = evalfile ("./common.sl");
+require ("setfuns");
+
+private define test_func (func, arglist, ans)
+{
+   variable ans1 = (@func)(__push_list(arglist));
+   ifnot (_eqs (ans1, ans))
+     {
+	print (ans1, &ans1);
+	print (ans, &ans);
+	failed ("$func failed: got $ans1 instead of $ans"$);
+     }
+}
+
+private define unique1 (a)
+{
+   variable i = unique (a);
+   return aiarray_sort(i);
+}
+
+private define test_setfuns ()
+{
+test_func (&unique1, {1,2,2,3,5,-1}, 1,2,3,5,-1);
+test_func (&unique1, {1}, 1);
+test_func (&unique1, {1,1}, 1);
+test_func (&unique1, {0:-1}, Int_Type0);
+test_func (&unique1, {{1,2,2,3,5,-1}}, {1,2,3,5,-1});
+test_func (&unique1, {{1}}, {1});
+test_func (&unique1, {{1,1}}, {1});
+test_func (&unique1, {{}}, {});
+
+test_func (&intersection, {1:5, 3:7}, 2:4);
+test_func (&intersection, {1:5, 5:7}, 4);
+test_func (&intersection, {1:5, 0:1}, 0);
+test_func (&intersection, {1:5, 5}, 4);
+test_func (&intersection, {1:5, 6}, Int_Type0);
+
+test_func (&intersection, {{1,2,3,4,5}, 3:7}, 2:4);
+test_func (&intersection, {{1,2,3,4,5}, 5:7}, 4);
+test_func (&intersection, {{1,2,3,4,5}, 0:1}, 0);
+test_func (&intersection, {{1,2,3,4,5}, 5}, 4);
+test_func (&intersection, {{1,2,3,4,5}, 6}, Int_Type0);
+
+test_func (&intersection, {{"foo", 2i, 3i}, {"foo", 3i}}, 0,2);
+test_func (&intersection, {{1, "foo", 2i, 3i}, {"foo", 3i}}, 1,3);
+test_func (&intersection, {{}, {"foo", 3i}}, Int_Type0);
+test_func (&intersection, {{"foo", 3i},{}}, Int_Type0);
+test_func (&intersection, {{"foo","foo"}, {"foo"}}, 0,1);
+test_func (&intersection, {{"foo"}, {"foo","bar"}}, 0);
+
+test_func (&complement, {{1,2,3,4,5}, 3:7}, 0,1);
+test_func (&complement, {{1,2,3,4,5}, 5:7}, 0:3);
+test_func (&complement, {{1,2,3,4,5}, 0:1}, 1:4);
+test_func (&complement, {{1,2,3,4,5}, 5}, 0:3);
+test_func (&complement, {{1,2,3,4,5}, 6}, 0:4);
+test_func (&complement, {{"foo", 2i, 3i}, {"foo", 3i}}, 1);
+test_func (&complement, {{1, "foo", 2i, 3i}, {"foo", 3i}}, 0,2);
+test_func (&complement, {{}, {"foo", 3i}}, Int_Type0);
+test_func (&complement, {{"foo", 3i}, {}}, 0,1);
+test_func (&complement, {{"foo","foo"}, {"foo"}}, Int_Type0);
+
+test_func (&union, {{"foo", 1, 2}, {"bar", 1, 3}}, {"foo", 1, 2, "bar", 3});
+test_func (&union, {1:10, 3:5, 9:12}, 1:12);
+test_func (&union, {1:10, 3:5, 2i}, 1:10, 2i);
+}
+
+define slsh_main ()
+{
+   start_test ("setfuns");
+   test_setfuns ();
+   end_test ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/test/test_structfuns.sl Added

@@ -0,0 +1,47 @@
+() = evalfile ("./common.sl");
+
+require ("structfuns");
+
+private define test_structfuns ()
+{
+   variable s = struct
+     {
+	str = "foo",
+	a1 = 1:3,
+	a2 = _reshape (1:3*4*5, 3,4*5),
+	a3 = _reshape (1:3*4*5, 3,4,5),
+     };
+   variable i = 1,2;
+   variable s1 = struct_filter (s, i; dim=0, copy);
+   if ((s1.str != s.str)
+       || not _eqs (s1.a1, s.a1i)
+       || not _eqs (s1.a2, s.a2i,*)
+       || not _eqs (s1.a3, s.a3i,*,*))
+     failed ("filtering on dim=0 failed");
+
+   i = 1,2;
+   s1 = struct_filter (s, i; dim=1, copy);
+   if ((s1.str != s.str)
+       || not _eqs (s1.a1, s.a1)
+       || not _eqs (s1.a2, s.a2*,i)
+       || not _eqs (s1.a3, s.a3*,i,*))
+     failed ("filtering on dim=1 failed");
+
+   i = 1,2;
+   s1 = struct_filter (s, i; dim=2, copy);
+   if ((s1.str != s.str)
+       || not _eqs (s1.a1, s.a1)
+       || not _eqs (s1.a2, s.a2)
+       || not _eqs (s1.a3, s.a3*,*,i))
+     failed ("filtering on dim=1 failed");
+}
+
+define slsh_main ()
+{
+   start_test ("structfuns");
+
+   test_structfuns ();
+
+   end_test ();
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/tm Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/tm/Makefile Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/tm/arrayfuns.tm Added

@@ -0,0 +1,47 @@
+
+\function{rearrange}
+\synopsis{Rearrange the elements of a 1-d array or list.}
+\usage{rearrange (A, indices)}
+\description
+  This function performs an in-place rearrangment of the the elements
+  of an array according to the specified permutation, represented by
+  the \exmp{indices} argument.  The \exmp{indices} array is assumed to
+  contain unique integers in the range \exmp{0,length(A)-1}.
+\notes
+  The function modifies the elements of the \exmp{indices} array while
+  it performs the rearrangement.  The values will get restored upon
+  return from function.
+
+  The algorithm used was derived from the DPPERM function, which is
+  part of the SLATEC package.  See
+  \url{http://gams.nist.gov/cgi-bin/serve.cgi/Package/SLATEC}.
+\seealso{array_reverse, array_swap}
+\done
+
+\function{reverse}
+\synopsis{Reverse the elements of a 1-d array}
+\usage{Array_Type reverse (Array_Type A)}
+\description
+ The \sfun{reverse} function reverses the elements of a 1-d array and
+ returns the result.
+\seealso{shift}
+\done
+
+\function{shift}
+\synopsis{Shift the elements of a 1-d array}
+\usage{Array_Type shift (Array_Type A, Int_Type n)}
+\description
+ The \sfun{shift} function shifts the elements of an array by a specified amount
+ and returns the result.  If \exmp{n} is positive, the ith element of the array
+ will be shifted to the position \exmp{i-n} of the array.  Elements for
+ which \exmp{i-n} is less than 0 will be moved to the end of the array.
+\example
+#v+
+   A = 1,2,3,4,5,6,7,8,9;
+   B = shift (A, 3);          % ==> B = 4,5,6,7,8,9,1,2,3;
+   C = shift (A, -1);         % ==> C = 9,1,2,3,4,5,6,7,8;
+#v-
+\notes
+ It many ways \exmp{rotate} would be a better name for this function.
+\seealso{reverse, transpose}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/tm/cmdopt.tm Added

@@ -0,0 +1,218 @@
+\function{cmdopt_new}
+\synopsis{Create a cmdopt object for parsing command-line options}
+\usage{obj = cmdopt_new (Ref_Type error_routine)}
+\description
+  This function creates an returns an object that may be used by the
+  \sfun{cmdopt_process} function to parse command line arguments.  The
+  \sfun{cmdopt_new} function takes a reference to an error handling
+  function that will get called upon error.  In most cases, this
+  function should print out the error message, display a usage
+  message, and then call \ifun{exit}.  If the error handler is \NULL,
+  or it returns instead of calling exit, then an exception will be thrown.
+
+  The error handler must be defined to take a single string argument
+  (the error message) and must return nothing.
+\example
+#v+
+   require ("cmdopt");
+   private define help_callback ()
+   {
+     () = fputs ("Usage: pgm options infile\n", stderr);
+     () = fputs ("Options:\n", stderr);
+     () = fputs (" -h|--help           Show this help\n", stderr);
+     () = fputs (" -v|--verbose        Increase verbosity level\n", stderr);
+     () = fputs (" -o|--output         Output filename stdout\n", stderr);
+     exit (1);
+   }
+   private define error_handler (text)
+   {
+      () = fprintf (stderr, "%s\n", text);
+      help_callback ();
+   }
+   define slsh_main ()
+   {
+      variable verbose = 0;
+      outfile = "-";   % stdout
+      variable c = cmdopt_new (&error_handler);
+      cmdopt_add (c, "v|verbose", &verbose; inc);
+      cmdopt_add (c, "h|help", &help_callback);
+      cmdopt_add (c, "s:o|output", &outfile; type="str");
+      variable iend = cmdopt_process (c, __argv, 1);
+
+      if (verbose) message ("some informative message");
+      variable fp = stdout;
+      if (outfile != "-") fp = fopen (outfile, "w");
+        .
+        .
+    }
+#v-
+\seealso{cmdopt_add, cmdopt_process}
+\done
+
+\function{cmdopt_process}
+\synopsis{Process the command-line options}
+\usage{Int_Type cmdopt_process (optobj, argv, istart)}
+#v+
+   Struct_Type optobj;
+   Array_Type argv;
+   Int_Type istart
+#v-
+\description
+  This function parses the command line arguments in the string array
+  \exmp{argv} according to the rules specified by the \exmp{optobj}
+  object, previously allocated by \sfun{cmdopt_new}.  The array of
+  strings is processed starting at the index specified by
+  \exmp{istart}.  The function returns the index of the array element
+  where parsing stopped.  Upon error, the function will call the error
+  handler established  by the prior call to \exmp{cmdopt_new}.
+\example
+#v+
+    define slsh_main ()
+    {
+          .
+          .
+       optobj = cmdopt_new (...);
+       cmdopt_add (optobj, ...);
+          .
+          .
+       variable iend = cmdopt_process (optobj, __argv, 1);
+          .
+          .
+    }
+#v-
+\notes
+  This function may also be called in an object-oriented style using the
+  \exmp{process} method:
+#v+
+       optobj = cmdopt_new (...);
+       optobj.add (...)
+       iend = optobj.process (__argv, 1);
+#v-
+\seealso{cmdopt_add, cmdopt_new}
+\done
+
+\function{cmdopt_add}
+\synopsis{Add support for a command-line option}
+\usage{cmdopt_add (optobj, optname, addr ,... ;qualifiers)}
+#v+
+   Struct_Type optobj;
+   String_Type optname;
+   Ref_Type addr;
+#v-
+\description
+  This function adds support for a command-line option to
+  \exmp{optobj} and specifies how that option should be handled.
+  Handling an option involves setting the value of a variable
+  associated with the option, or by calling a function upon its
+  behalf.
+
+  For clarity, assume a command-line option can be specified using the
+  single character \exmp{f} or by the longer name \exmp{foo}. Then the
+  rules for calling \sfun{cmdopt_add} for the various flavors options
+  supported by this interface and how the option may be specified on
+  the command line are as follows:
+
+  Options that set a variable \exmp{v} to a value \exmp{val}:
+#v+
+    cmdopt_add (optobj, "f|foo", &v; default=val);
+    cmdline: pgm -f ...
+    cmdline: pgm --foo ...
+#v-
+
+  Options that increment an integer variable \exmp{v}:
+#v+
+    cmdopt_add (optobj, "f|foo", &v; inc);
+    cmdline: pgm -f -f ...       % In these examples, v
+    cmdline: pgm --foo --foo ... % gets incremented twice
+#v-
+
+  Options that bitwise-or an integer variable \exmp{v} with \exmp{FLAG}:
+#v+
+    cmdopt_add (optobj, "f|foo", &v; bor=FLAG);
+    cmdline: pgm -f ...       % v = v | FLAG
+    cmdline: pgm --foo ...    % v = v | FLAG
+#v-
+  Options that bitwise-and an integer variable \exmp{v} with \exmp{MASK}:
+#v+
+    cmdopt_add (optobj, "f|foo", &v; band=MASK);
+    cmdline: pgm -f ...       % v = v & MASK;
+    cmdline: pgm --foo ...    % v = v & MASK;
+#v-
+  The above two options may be combined:
+#v+
+    cmdopt_add (optobj, "f|foo", &v; bor=FLAG1, band=~FLAG2);
+    cmdline: pgm -f ...       % v &= ~FLAG2; v |= FLAG1;
+#v-
+
+  Options that require a value and set \exmp{v} to the value VAL.
+#v+
+    cmdopt_add (optobj, "f|foo", &v; type="int");
+    cmdline: pgm -f VAL ...
+    cmdline: pgm -fVAL ...
+    cmdline: pgm --foo VAL ...
+    cmdline: pgm --foo=VAL ...
+#v-
+
+  Options whose value is optional:
+#v+
+    cmdopt_add (optobj, "f|foo", &v; type="string", optional=DFLT);
+    cmdline: pgm -f ...            % set v to DFLT
+    cmdline: pgm -fVAL ...         % set v to VAL
+    cmdline: pgm --foo ...         % set v to DFLT
+    cmdline: pgm --foo=VAL ...     % set v to VAL
+#v-
+
+  For the latter two cases, if the \exmp{append} qualifier is used,
+  then instead of assigning the value to the specified variable, the
+  value will be appended to a list assigned to the variable, e.g.,
+#v+
+    cmdopt_add (optobj, "f|foo", &v; type="float", append);
+#v-
+  Then the command line \exmp{pgm --foo=VAL1 -fVAL2 -f VAL3 ...} will
+  result in the assignment to \exmp{v} or the 3 element list
+  \exmp{\{VAL1, VAL2, VAL3\}}.
+
+  An option can also be associated with a callback function that get
+  called when the option is handled.
+
+  Options that cause a function to be called with arguments
+  \exmp{a0,...}:
+#v+
+    cmdopt_add (optobj, "f|foo", &func, a0...);
+    cmdline: pgm --foo
+    cmdline: pgm -f
+#v-
+  Here \exmp{func} should be written with the signature:
+#v+
+    define func (a0, ...) {...}
+#v-
+  Options that take a value and cause a function to be called with
+  additional arguments \exmp{a0,...}:
+#v+
+    cmdopt_add (optobj, "f|foo", &func, a0,...; type="int");
+    cmdline: pgm --foo=VAL
+    cmdline: pgm -f VAL
+    cmdline: pgm -fVAL
+#v-
+  In this case, \exmp{func} should be written as
+#v+
+    define func (value, a0, ...) {...}
+#v-
+
+  As the above examples illustrate, the data-type of the value assigned
+  to a variable must be specified using the \exmp{type} qualifier.
+  Currently the \exmp{type} must be set to one of the following values:
+#v+
+     "str"          (String_Type)
+     "int"          (Int_Type)
+     "float"        (Double_Type)
+#v-
+\notes
+  This function may also be called in an object-oriented style using the
+  \exmp{add} method:
+#v+
+       optobj = cmdopt_new (...);
+       optobj.add ("f|foo", &func, a0,...; type="int");
+#v-
+\seealso{cmdopt_new, cmdopt_process}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/tm/fswalk.tm Added

@@ -0,0 +1,127 @@
+\function{fswalk_new}
+\synopsis{Create an object to walk the filesystem tree}
+\usage{obj = fswalk_new (Ref_Type dirfunc, Ref_Type filefunc; qualifiers)}
+\description
+  The \sfun{fswalk_new} function creates an object that is useful
+  for exploring a filesystem tree.  It requires two arguments that
+  are references to functions to be called when a directory or file is
+  encountered.  Each of these functions is passed at least two
+  arguments: the name of the file or directory (including leading path
+  elements relative to the directory where processing started), and
+  the stat structure of the of the file or directory.  Qualifiers may
+  be used to specify additional arguments.
+
+  The object's \exmp{walk} method is the one that actually walks the
+  filesystem.
+
+  The directory callback function must return an integer value that
+  indicates how it should be processed.  If the function returns 0,
+  then the directory will be skipped (pruned).  A positive value
+  indicates that the directory will processed.  If the function
+  returns a negative value, then no further processing by the walk
+  function will take place and control will pass to the user.
+
+  The file callback function must also return an integer that
+  indicates how processing should continue.  If it returns a positive
+  value, then additional files in the corresponding directory will be
+  processed.  If it returns 0, then no further files or subdirectories
+  of the directory will be processed, and processing will continue to
+  take place in the parent directory.  Otherwise, the return value is
+  negative, which indicates that processing should be stopped and
+  control will pass back to the caller.
+
+\qualifiers
+  The following qualifiers are supported:
+#v+
+   dargs={args...}
+#v-
+    \exmp{dargs} is a list of additional arguments that will be added when
+    calling the directory callback function.
+#v+
+   fargs={args...}
+#v-
+    \exmp{fargs} is a list of additional arguments that will be added when
+    calling the file callback function.
+#v+
+   followlinks=val
+#v-
+    The \exmp{followlinks} qualifier may be used to indicate whether
+    or not directories that are symbolic links are to be followed.  By
+    default, they are not.  If \exmp{followlinks} is present with no
+    value, or has a non-zero value, then symbolic links will be
+    followed.  Otherwise, if \exmp{followlinks} is not present, or is
+    set to 0, then directories that are symbolic links will be skipped.
+
+\methods
+#v+
+   .walk (String_Type top_dir)
+#v-
+    The \exmp{.walk} function walks the filesystem starting at the
+    specified top-level directory calling the directory and file
+    callback functions as it goes.
+
+\example
+  Print a list of all files containing a \exmp{.png} extension under
+  the current directory:
+#v+
+     private define file_callback (name, st)
+     {
+        if (".png" == path_extname (name))
+          message (name);
+        return 1;
+     }
+     variable w = fswalk_new (NULL, &file_callback);
+     w.walk (".");
+#v-
+
+  Get a list of all directories that are symbolic links under /usr.
+#v+
+     private define dir_callback (name, st, list)
+     {
+        st = lstat_file (name);
+        if (stat_is ("lnk", st.st_mode))
+          {
+            list_append (list, name);
+            return 0;
+          }
+        return 1;
+     }
+
+     define get_symdir_list (top)
+     {
+        variable list = {};
+        variable w = fswalk_new (&dir_callback, NULL
+                                 ;dargs={list}, followlinks);
+        w.walk (top);
+        return list;
+     }
+     symdirlist = get_symdir_list ("/usr");
+#v-
+  Note that in this example, the dir_callback function returns 0 if
+  the directory corresponds to a symbolic link.  This causes the link
+  to not be followed.
+
+  Get a list of dangling symbolic links:
+#v+
+     private define file_callback (name, st, list)
+     {
+        if (stat_is ("lnk", st.st_mode))
+          {
+             if ((NULL == stat_file (name))
+                 && (errno == ENOENT))
+               list_append (list, name);
+          }
+        return 1;
+     }
+
+     define get_badlinks (top)
+     {
+        variable list = {};
+        variable w = fswalk_new (NULL, &file_callback ;fargs={list});
+        w.walk (top);
+        return list;
+     }
+#v-
+\seealso{glob, stat_file, lstat_file, listdir};
+\done
+

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/tm/glob.tm Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/tm/listfuns.tm Added

@@ -0,0 +1,163 @@
+\function{list_sort}
+\synopsis{Sort a list of item}
+\usage{
+#v+
+ Int_Type indices = list_sort (List_Type list); % Form 1
+ list_sort (List_Type list; inplace); % Form 2
+#v-
+}
+\description
+ The \sfun{list_sort} may be used to sort a list. By default, it
+ returns a permutation index array for the desired sort. If the
+ \exmp{inplace} qualifier is given, the sort will be in-place and no
+ index array will be returned.
+\qualifiers
+ The following qualifiers may be used to modify the behavior of the
+ function:
+
+#v+
+ dir=1
+#v-
+ If the value of the \exmp{dir} qualifier is non-negative, the sort will
+ take place in an increasing order. If negative, the list will be
+ sorted in decreasing order.
+
+#v+
+ cmp=&cmpfunc
+#v-
+ The \exmp{cmp} qualifier specifies the function used to comparison
+ operation for two elements of an array. Its value must be a
+ reference to a function that accepts two arguments representing the
+ objects to be compared. It must return a positive integer, 0, or
+ a negative integer if the value of the first argument is greater
+ than, equal to, or less than the value of the second, respectively.
+
+#v+
+ inplace=1
+#v-
+ The inplace qualifier may be used to indicate if the list is to be
+ sorted in place. If the qualifier is present with no-value or a
+ non-zero value, the list will be sorted in place and no index array
+ will be returned. If not present, or present with a value of 0, the
+ list will not be modified, and an index array will be returned.
+\example
+#v+
+ list = {1, 9, 3, 7};
+ i = list_sort (list);
+ sorted_list = listi;
+#v-
+ The above example creates a second list (\exmp{sorted_list}) by
+ using the permutation index array to rearrange the objects in the
+ unsorted list.
+
+#v+
+ list = {1, 9, 3, 7};
+ list_sort (list; inplace);
+#v-
+ In this example, the list is sorted in-place.
+
+ Consider a list of strings that are to be sorted in increasing
+ order of the number of bytes used by each string. For this, a custom
+ sort function is required:
+#v+
+ private define cmpfunc (a, b)
+ {
+ return strbytelen(a) - strbytelen(b);
+ }
+ list = {"Here", "is", "a", "list", "of", "strings"};
+ list_sort (list; inplace);
+#v-
+\notes
+ Keep in mind that a list can contain a heterogeneous collection of
+ object where there is no predefined comparison operation. For
+ example, there may be no natural way to compare an integer to a
+ string. For a heterogeneous list, a comparison function must be
+ provided.
+\seealso{array_sort, rearrange}
+\done
+
+\function{heap_new}
+\synopsis{Instantiate a heap data object}
+\usage{Struct_Type h = new_heap (List_Type list)}
+\description
+ The \sfun{new_heap} function takes a \dtype{List_Type} object and
+ rearranges its elements to form a heap. A list rearranged to form a
+ heap has the property that \exmp{listi >= list2*i+j}, where j=1 or 2,
+ and i is the list index (from 0).
+
+ Upon return, the elements of the list will be rearranged to have the
+ heap property and a new container object (the heap) will be
+ returned. It may be manipulated using the method calls described
+ below.
+\qualifiers
+#v+
+ dir=-1
+#v-
+ The \exmp{dir} qualifier may be used to specify the direction of the
+ heap. The default (dir=-1) specifies a top-down ordering. A
+ bottom-up ordering corresponds to dir=1.
+
+#v+
+ cmp=&cmpfunc
+#v-
+ The \exmp{cmp} may be used to specify the function to be used when
+ comparing elements of the list. Its value must be a reference to a
+ function that takes two parameters and returns a positive integer if
+ the value of the first parameter is greater than the second, 0 if
+ they are equal, or a negative integer if the first is less than
+ the second. For example, if the list consists of structures with
+ fields called \exmp{lastname} and \exmp{firstname} that are to be
+ used for ordering, then the desired function would look something
+ like:
+#v+
+ define cmpfunc (a, b)
+ {
+ variable c = strcmp (a.lastname, b.lastname);
+ if (c == 0) c = strcmp (a.firstname, b.firstname);
+ return c;
+ }
+#v-
+\methods
+\method{length()}{Get the length to the heap}
+\method{add(obj)}{Add a new object to the heap}
+\method{remove()}{Remove the largest (for top-down) or smallest (for
+ bottom-up) item from the heap and return its value.}
+\method{peek()}{Get the largest (top-down) or smallest(bottom-up) item
+ from the heap, but do not remove it.}
+
+ Note that attempting to peek at or remove an item from an empty list
+ will result in an \exc{IndexError} exception.
+\example
+ Suppose that merging two objects requires a time equal to the
+ combined length of the objects. For example, if the length of first
+ is A and that of the second is B, then the time to merge the two
+ will be A + B. What is the minimum amount of time it takes to merge
+ a list of N objects with lengths \exmp{\{L_k\}, k=0...N-1}? The
+ answer to this is very simple if a bottom-up heap is used. The idea
+ is to remove the two smallest objects from the heap, combine them
+ and then add the result back to the heap. Repeat this process until
+ the heap is empty. In the following, \exmp{list} is a list of the
+ lengths of the objects to be merged.
+#v+
+ define compute_merge_time (list)
+ {
+ variable h = heap_new (list; dir=1); % bottom-up heap
+ variable a, b, c, t;
+ a = h.remove (); t = 0;
+ while (h.length())
+ {
+ b = h.remove ();
+ c = a + b;
+ t += c;
+ h.add (c);
+ a = h.remove ();
+ }
+ return t;
+ }
+#v-
+\notes
+ Generally speaking, a list will require the specification of a
+ comparison function unless the list consists solely of elements that
+ may be compared using the \exmp{>}, \exmp{<}, and \exmp{==} operators.
+\seealso{list_sort, list_new}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/tm/print.tm Added

@@ -0,0 +1,52 @@
+\function{print}
+\synopsis{Display a string representation of an object or value}
+\usage{print (value ,&var|file-pointer|filename)}
+\description
+ The \sfun{print} function displays the string representation of a
+ value to the display.  An optional second argument may be provided to
+ specify where to write the resulting string: a variable, an open file
+ pointer, or to a file.
+
+ If the string representation of the object appears to contain more
+ lines than are available on the screen, then the output will be piped
+ to the program given by the \var{PAGER} environment variable.
+ Alternatively the pager program may be specified via the \exmp{pager}
+ qualifier.
+\qualifiers
+#v+
+   pager=string       Force the use of the pager.  If a value is
+                         specified, then use it for the pager command.
+   nopager              Do not use a pager.
+#v-
+\example
+  Print the string representation of an array to a file called
+  \file{array.dat}:
+#v+
+   print (1:20:0.1, "array.dat");
+#v-
+
+  Print the string represent of an array to a string \exmp{str}:
+#v+
+   print (1:20:0.1, &str);
+#v-
+\seealso{print_set_pager, print_set_pager_lines}
+\done
+
+\function{print_set_pager}
+\synopsis{Set the name of the pager program used by the print program}
+\usage{print_set_pager (String_Type cmd)}
+\description
+  This function may be used to specify the name of the default pager to be
+  used by the \sfun{print} function.
+\seealso{print, print_set_pager_lines}
+\done
+
+\function{print_set_pager_lines}
+\synopsis{Set the maximum number of lines to print before using a pager}
+\usage{print_set_pager_lines (Int_Type num)}
+\description
+  The \sfun{print_set_pager_lines} function sets the maximum number of
+  lines that the string representation of an object can be before the
+  \sfun{print} function will use a pager.
+\seealso{print, print_set_pager}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/tm/process.tm Added

@@ -0,0 +1,220 @@
+\function{new_process}
+\synopsis{Create a subprocess object}
+\usage{Struct_Type new_process (String_Type argv; qualifiers)}
+\description
+  This function executes the program specified by the \exmp{argv}
+  parameter in a subprocess.  If \exmp{argv} is an array, the first
+  element (\exmp{argv0}) of the array gives the name of the program
+  to be executed, and the remaining elements serve as arguments passed
+  to the program.  The program returns a structure that may be used to
+  interact with the process.  Upon error, an exception will be thrown.
+
+  The calling program may interact with the subprocess by reading from
+  or writing to the file descriptor fields of the structure returned
+  by the \sfun{new_process} function.  The specific file descriptors
+  are dictated via the \exmp{read}, \exmp{write}, and \exmp{dupN}
+  qualifiers, as described in detail below.
+
+  The function returns a structure containing zero or more fields of the form
+  \exmp{fdN} where \exmp{N} is an integer derived from the qualifiers,
+  e.g., \exmp{fd0} and \exmp{fd1} correspond to the child's stdin and
+  stdout, respectively.  The structure also contains fields of the
+  form \exmp{fpN} whose values are stdio \dtype{File_Type} objects
+  obtained using \exmp{fdopen} with the corresponding \exmp{fdN} value.
+
+  Other important fields include \exmp{pid} whose value is
+  the process-id of the newly created process.
+
+  The status of the process may be checked or collected using the
+  \sfun{wait} method.  It is very important to call this method to
+  avoid the creation of zombie processes.
+
+\qualifiers
+  The following qualifiers are supported:
+#v+
+   read=fds
+#v-
+    fds is a list of integer file descriptors that are open for read
+    access in the subprocess, and may be written to by the calling
+    process using the fdN or fpN fields of the structure.
+#v+
+   write=fds
+#v-
+    fds is a list of integer file descriptors that are open for write
+    access in the subprocess, and may be read to by the calling
+    process using the fdN or fpN fields of the structure.
+#v+
+   stdin=filename
+   stdout=filename
+   stderr=filename
+#v-
+    These qualifiers allow the stdin, stdout, and stderr file
+    descriptors in the subprocess to be redirected to a file.  Note:
+    The filenames are interpreted relative to the value of the
+    \exmp{dir} qualifier.
+#v+
+   fdN=string
+#v-
+    This qualifier will cause the integer file descriptor N to be open
+    in the subprocess and redirected to the filename represented by
+    the string, which is interpreted relative to the value of the \exmp{dir}
+    qualifier.  The access mode is dictated by the first few
+    characters of the string as described in more detail below.
+#v+
+   stdin=File_Type|FD_Type
+   stdout=File_Type|FD_Type
+   stderr=File_Type|FD_Type
+   fdN=FD_Type|FD_Type
+#v-
+     If the stdin, stdout, stderr, or fdN qualifiers have File_Type or
+     FD_Type values, then corresponding file descriptors in the
+     subprocess will be dup'd to FD_Type or FP_Type file descriptor.
+     This form of the qualifier may be used to setup pipelines.
+#v+
+   dupN=int
+#v-
+     The file descriptor corresponding to the integer N in the
+     subprocess is created by duping the descriptor given by the
+     integer value of the qualifier.  For example, dup2=1 would cause
+     stderr (fd=2) in the subprocess to be redirected to stdout (fd=1).
+#v+
+   dir=string
+#v-
+     Change to the specified directory in the child process.  This
+     will happen after the child process is started, but before any
+     files have been opened.  Hence, files attached to \ivar{stdin},
+     \ivar{stdout}, etc will be opened relative to this directory.
+#v+
+   pre_exec_hook=&func
+#v-
+     This qualifier will cause the function corresponding to \exmp{func} to
+     be called prior to closing unused file descriptors and invoking
+     the executable.  The function will be passed a list of integer
+     valued file descriptors that will be kept open.  Additional
+     integers may be added to the list by the function.  If the
+     qualifier \exmp{pre_exec_hook_optarg} exists, it will also be
+     passed as an addtional argument.
+#v+
+   pre_exec_hook_optarg=VALUE
+#v-
+     If this qualifier exists, its value will be passed as the second
+     argument to the \exmp{pre_exec_hook} callback function.
+
+  Note that the read and write qualifiers specify the nature of the
+  file descriptors from the child process's view.  That is, those
+  opened in the child process using the read qualifier, may be written
+  to by the parent.  Similarly, those opened using the write qualifier
+  may be read by the parent.
+
+\methods
+#v+
+    Struct_Type .wait (  options  )
+#v-
+  The \exmp{.wait} method may be used to collect the exist status of
+  the process.  When called without arguments, it will cause the
+  parent process to wait for the subprocess to exit and return its
+  exit status in the form of a \ifun{waitpid} structure.  The optional
+  \exmp{options} argument corresponds to the options argument of the
+  \ifun{waitpid} function.  The most common is the WNOHANG option,
+  which will cause the \exmp{.wait} method to return immediately if
+  the process has not exited.
+
+  If an error occurs, the function will return NULL and set
+  \ivar{errno} accordingly.  Otherwise it will return a \exmp{waitpid}
+  structure.  See the documentation for \exmp{waitpid} for more
+  information.
+
+\example
+  In the following examples, \exmp{pgm} represents the program to be
+  invoked in the subprocess.  For simplicity, no addition arguments are
+  shown
+
+  Create subprocess that inherits stdin, stdout, stderr from the caller:
+#v+
+   obj = new_process (pgm);
+#v-
+
+  Create a subprocess that inherits stdin, stdout, and writes stderr
+  to a file:
+#v+
+   obj = new_process (pgm; stderr="/tmp/file");   % form 1
+   obj = new_process (pgm; fd2=">/tmp/file");     % form 2
+#v-
+
+  Mimic popen(pgm, "r"):
+#v+
+   obj = new_process (pgm; write=1);   % Read from obj.fp1
+#v-
+
+  Mimic popen(pgm, "w"):
+#v+
+   obj = new_process (pgm; read=0);  % Write to obj.fp0
+#v-
+
+  Mimic popen("pgm 2>&1", "r"):
+#v+
+   obj = new_process (pgm; write=1, dup2=1);  % Read from fp1
+#v-
+
+  Send stdout to a file, read from the subprocess's stderr:
+#v+
+   obj = new_process (pgm; stdout="/tmp/file", write=2);
+   % Read from obj.fp2
+#v-
+
+  Create a process with handles to its stdin, stdout, stderr
+#v+
+   obj = new_process (pgm; write={1,2}, read=0);
+   % Use obj.fp0 for stdin, obj.fp1 for stdout, and obj.fp2 for stderr
+#v-
+
+  Create a process with a write handle to the process's fd=27 and a
+  read handle to the process's stdout.
+#v+
+   obj = new_process (pgm; read=27, write=1);
+   % write to fp27, read from fp1
+#v-
+
+  Create a pipeline: pgm1 | pgm2 > /tmp/log :
+#v+
+  obj1 = new_process (pgm1; write=1);
+  obj2 = new_process (pgm2; stdin=obj1.fp1, stdout="/tmp/log");
+#v-
+
+  Create a pipeline with fd=27 from pgm1 redirected to stdin of pgm2:
+#v+
+  obj1 = new_process (pgm1; write=27);
+  obj2 = new_process (pgm2; stdin=obj1.fp27);
+#v-
+
+  Create a pipeline with fd=27 from pgm1 redirected to fd=9 of pgm2:
+#v+
+  obj1 = new_process (pgm1; write=27);
+  obj2 = new_process (pgm2; fp9=obj1.fp27);
+#v-
+
+  Mimic: pgm 2>&1 1>/dev/null
+#v+
+  obj = new_process (pgm; fp2=1, stdout="/dev/null");
+#v-
+
+  Mimic: pgm >/dev/null 2>&1
+#v+
+  obj = new_process (pgm; stdout="/dev/null", dup2=1);
+#v-
+
+  Append the output of pgm to /tmp/file.log:
+#v+
+   obj = new_process (pgm; stdout=">>/tmp/file.log");
+#v-
+
+\notes
+  Care must be exercised when reading or writing to multiple file
+  descriptors of a subprocess to avoid deadlock.  In such cases, the
+  select module should be used, or the file descriptors could be put in
+  non-blocking mode via the fcntl module.
+
+  It is important to call the \exmp{.wait} method prevent the process
+  from becoming a zombie and clogging the process table.
+\seealso{popen, system}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/tm/profile.tm Added

@@ -0,0 +1,74 @@
+\function{profile_on}
+\synopsis{Enable code generation to support profiling hooks}
+\usage{profile_on ( line_by_line )}
+\description
+  This function will turn cause the interpreter to generate code to
+  call hooks that are used to profile code.  The \exmp{profile_on}
+  function does not establish those hooks, rather it causes code to be
+  generated to support such hooks.
+
+  With no optional argument, only code to support function call hooks
+  will be generated.  To enable support for line-by-line profile
+  hooks, a value of 1 should be passed to this function.
+\seealso{profile_off, profile_begin, profile_end, profile_calibrate, profile_report}}
+\done
+
+\function{profile_off}
+\synopsis{Turn off code generation for profiling hooks}
+\usage{profile_off ()}
+\description
+  This function turns off the generation of code to support profiling
+  hooks.
+\seealso{profile_on, profile_begin, profile_end, profile_calibrate, profile_report}}
+\done
+
+\function{profile_begin}
+\synopsis{Establish profiling hooks and reset the profiler}
+\usage{profile_begin ( line_by_line )}
+\description
+  This function establishes the profiling hooks and resets or
+  initializes the profiler state.  By default, only hooks to gather
+  function call information are created.  To enable the gathering of
+  line-by-line information, a value of 1 should be passed to this
+  function.
+\seealso{profile_end, profile_on, profile_off, profile_calibrate, profile_report}}
+\done
+
+\function{profile_end}
+\synopsis{Remove profiling hooks and turn off profiler code generation}
+\usage{profile_end ()}
+\description
+  The \sfun{profile_end} function turns off the code generation to
+  support profiling hooks and removes any profiling hooks that are in
+  place.
+\seealso{profile_begin, profile_on, profile_off, profile_calibrate, profile_report}
+\done
+
+\function{profile_calibrate}
+\synopsis{Calibrate the profiler}
+\usage{profile_calibrate ( N )}
+\description
+ This function may be used to ``calibrate'' the profiler.  As the
+ performance of the profiler and the interpreter varies with a
+ platform and load-dependent manner, this function should be called
+ prior to enabling the profiler.  It tries to determine the average
+ amount of overhead per statement executed and function call by
+ executing a series of statements and functions many times to
+ determine statistically accurate values.  The optional parameter
+ \exmp{N} may be used to control the amount of code executed
+ for the calibration process.  If no value is provided, the \exmp{N}
+ will default to 1000.  The higher the value, the more accurate the
+ calibration will be and the longer the calibration process will take.
+\seealso{profile_begin, profile_end, profile_on, profile_off, profile_report}
+\done
+
+\function{profile_report}
+\synopsis{Generate the profile report}
+\usage{profile_report (file)}
+\description
+  The function may be used to format the profile report and write it
+  to the specified file.  If the \exmp{file} parameter represents a
+  \dtype{File_Type} file descriptor, then the report will be written
+  the the descriptor.
+\seealso{profile_begin, profile_end, profile_on, profile_off, profile_calibrate}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/tm/readascii.tm Added

@@ -0,0 +1,120 @@
+\function{readascii}
+\synopsis{Read data from a text file}
+\usage{Int_Type readascii (file, &v1,...&vN ; qualifiers)}
+\description
+ This function may be used to read formatted data from a text (as
+ opposed to binary) file and stores the values as arrays in the
+ specified variables \exmp{v1,..., vN} (passed as references).  It
+ returns the number of lines read from the file that matched the
+ format (implicit or specified by a qualifier).
+
+ The file parameter may be a string that gives the filename to read,
+ a \exmp{File_Type} object representing an open file pointer, or an
+ array of lines to be scanned.
+\qualifiers
+ The following qualifiers are supported by the function
+#v+
+   format=string        The sscanf format string to be used when
+                          parsing lines.
+   nrows=integer        The maximum number of matching rows to handle.
+   ncols=integer        If a single reference is passed, it will be
+                          assigned an array of ncols arrays of data values.
+   skip=integer         Skip the specified number of lines before
+                          scanning
+   maxlines=integer     Read no more than this many lines.
+   cols=Array_Type      Read only the specified (1-based) columns.
+                          Used with an implict format
+   delim=string         For an implicit format, use this as a field
+                          separator.  The default is whitespace.
+   type=string          For an implicit format, use this sscanf type
+                          specifier.  Default is %lf (Double_Type).
+   size=integer         Use this value as the initial size for the
+                          arrays.
+   dsize=integer        Use this value as an increment when
+                          reallocating the arrays.
+   stop_on_mismatch     Stop reading input when a line does not match
+                          the format
+   lastline=&v          Assign the last line read to the variable v.
+   lastlinenum=&v       Assign the last line number (1-based to v)
+   comment=string       Lines beginning with this string are ignored.
+   as_list              If present, then return data in lists rather
+                          than arrays.
+#v-
+\example
+ As a simple example, consider a file called \exmp{imped.dat} containing
+#v+
+    # Distance    Zr   Zi
+    0.0          50.2    0.1
+    1.0          47.3  -12.2
+    2.0          43.9  -15.8
+#v-
+  The 3 columns may be read and stored in the variables \exmp{x}, \exmp{zr},
+  \exmp{zi} using
+#v+
+     n = readascii ("imped.dat", &x, &zr, &zi);
+#v-
+ After return, The value of \exmp{x} will be set to
+ \exmp{0.0,1.0,2.0}, \exmp{zr} to \exmp{50.2,47.3,43.9},
+ \exmp{zi} to \exmp{0.1,-12.2,-15.8}, and \exmp{n} to 3.
+
+ Another way to read the same data is to use
+#v+
+    n = readascii ("imped.dat", &data; ncols=3);
+#v-
+ In this case, \exmp{data} will be \exmp{Array_Type3}, with each
+ element of the array containing the array of data values for the
+ corresponding column.  As before, \exmp{n} will be 3.
+
+ As a more complex example, Consider a file called \exmp{score.dat}
+ that contains:
+#v+
+    Name      Score     Date          Flags
+    Bill       73.2     03-Nov-2046    1
+    James      22.9     03-Nov-2046    1
+    Lucy       89.1     04-Nov-2046    3
+#v-
+ This file may be read using
+#v+
+     n = readascii ("score.dat", &name, &score, &date, &flags;
+                    format="%s %lf %s %d");
+#v-
+ In this case, \exmp{n} will be 3, \exmp{name} and \exmp{date} will
+ be \dtype{String_Type} arrays, \exmp{score} will be a
+ \dtype{Double_Type} array, and \exmp{flags} will be an
+ \exmp{Int_Type} array.
+
+ Now suppose that only the score and flags column are of interest.
+ The \exmp{name} and \exmp{date} fields may be ignored using
+#v+
+     n = readascii ("score.dat", &score, &flags";
+                    format="%*s %lf %*s %d");
+#v-
+ Here, \exmp{%*s} indicates that the field is to be parsed as a
+ string, but not assigned to a variable.
+
+ Consider the task of reading columns from a file called
+ \exmp{books.dat} that contain quoted strings such as:
+#v+
+     # Year  Author Title
+     "1605" "Miguel de Cervantes"  "Don Quixote de la Mancha"
+     "1885" "Mark Twain" "The Adventures of Huckleberry Finn"
+     "1955" "Vladimir Nabokov" "Lolita"
+#v-
+ Such a file may be read using
+#v+
+     n = readascii ("books.dat", &year, &author, &title;
+                    format="\"%^\"\" \"%^\"\" \"%^\"\"");
+
+#v-
+\notes
+ This current version of this function does not handle missing data.
+ For such files, the \sfun{csv_readcol} function might be a better
+ choice.
+
+ By default, lines not matching the expected format are assumed to
+ be comments and are skipped.  So normally the \exmp{comment}
+ qualifier is not needed.  However, it is useful in conjunction with
+ the \exmp{stop_on_mismatch} qualifier to force the parser to skip
+ lines beginning with the comment string and continue scanning.
+\seealso{sscanf, atof, fopen, fgets, fgetslines, csv_readcol}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/tm/require.tm Added

@@ -0,0 +1,57 @@
+\function{_featurep}
+\synopsis{Test whether or not a feature is present}
+\usage{Int_Type _featurep (String_Type feature ,String_Type namespace)}
+\description
+  The \sfun{_featurep} function returns a non-zero value if the specified
+  feature is present.  Otherwise, it returns 0 to indicate that the feature
+  has not been loaded.
+\seealso{require, provide}
+\done
+
+\function{provide}
+\synopsis{Declare that a specified feature is available}
+\usage{provide (String_Type feature ,String_Type namespace)}
+\description
+ The \sfun{provide} function may be used to declare that a "feature" has
+ been loaded into the specified namespace.  If the namespace argument is not
+ present, the current namespace will be used.
+ See the documentation for \sfun{require} for more information.
+\seealso{require, _featurep}
+\done
+
+\function{require}
+\synopsis{Make sure a feature is present, and load it if not}
+\usage{require (feature ,namespace ,file)}
+#v+
+   String_Type feature, namespace, file;
+#v-
+\description
+  The \sfun{require} function ensures that a specified "feature" is present.
+  If the feature is not present, the \sfun{require} function will attempt to
+  load the feature from a file.  If the \exmp{namespace} argument is present
+  and non-NULL, the specified namespace will be used.  The default is to use
+  the current non-anonymous namespace. If called with three arguments, the
+  feature will be loaded from the file specified by the third argument
+  if it does not already exist in the namespace.  Otherwise, the feature
+  will be loaded from a file given by the name of the feature, with
+  ".sl" appended.
+
+  If after loading the file, if the feature is not present,
+  a warning message will be issued.
+\example
+#v+
+    require ("histogram");
+    require ("histogram", "foo");
+    require ("histogram", "foo", "/home/bob/hist.sl");
+    require ("histogram", ,"/home/bob/hist.sl");
+#v-
+\notes
+  "feature" is an abstract quantity that is undefined here.
+
+  A popular use of the \sfun{require} function is to ensure that a specified
+  file has already been loaded.  In this case, the feature is the
+  filename itself.  The advantage of using this mechanism over using
+  \ifun{evalfile} is that if the file has already been loaded, \sfun{require}
+  will not re-load it.
+\seealso{provide, _featurep, evalfile}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/tm/setfuns.tm Added

@@ -0,0 +1,81 @@
+#d note1 A set may either be an Array_Type or a List_Type object.\__newline__\
+  For a homogeneous collection of objects, it is better to\__newline__\
+  use an Array_Type. i.e., \exmp{1,2,3} instead of \exmp{\{1,2,3\}}.
+
+
+\function{complement}
+\synopsis{Extract the elements of a set that are not contained in other sets.}
+\usage{indices = complement (a, b, ..., c)}
+\description
+  This function computes the elements of the first argument (\exmp{a})
+  that are not contained in the sets given by the other arguments
+  (\exmp{b,...,c}) and returns them in the form of indices into the
+  first argument.
+\example
+#v+
+   a = {"foo", PI, 7};
+   b = 1,2,3,PI;
+   indices = complement (a, b);
+#v-
+  Upon return, \exmp{indices} will have the value \exmp{0, 2} since
+  \exmp{a0} and \exmp{a2} are not contained in \exmp{b}.
+\notes
+  \note1
+\seealso{intersection, ismember, union, unique}
+\done
+
+\function{intersection}
+\synopsis{Extract the common elements of two or more sets}
+\usage{indices = complement (a, b, ..., c)}
+\description
+  This function computes the common elements of two or more sets and
+  returns them in the form of indices into the first argument.
+\example
+#v+
+   a = {"foo", 7, PI};
+   b = {PI, "bar", "foo"};
+   indices = intersection (a, b);
+#v-
+  Upon return, \exmp{indices} will have the value \exmp{0, 2} since
+  \exmp{a0} and \exmp{a2} are the common elements of the sets.
+\notes
+  \note1
+\seealso{complement, ismember, union, unique}
+\done
+
+\function{ismember}
+\synopsis{test to see if the elements of one set are members of another}
+\usage{val = ismember (a, b)}
+\description
+  This function may be used to see which of the elements of the set
+  \exmp{a} are members of the set \exmp{b}.  It returns a boolean
+  array indicating whether or not the corresponding element of
+  \exmp{a} is a member of \exmp{b}.
+\notes
+  \note1
+\seealso{complement, intersection, union, unique}
+\done
+
+\function{union}
+\synopsis{Form a set of the unique elements of one ore more subsets}
+\usage{abc = union (a, b,..., c)}
+\description
+  This function interprets each of its arguments as a set, then merges
+  them together and returns only the unique elements.  The returned
+  value may either be an \dtype{Array_Type} or a \dtype{List_Type}
+  object.
+\notes
+  \note1
+\seealso{complement, intersection, ismember, unique}
+\done
+
+\function{unique}
+\synopsis{Get the indices of the unique elements of a set}
+\usage{indices = unique (A)}
+\description
+  This function returns an array of the indices of the unique elements
+  of a set.
+\notes
+  \note1
+\seealso{complement, intersection, ismember, union}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/lib/tm/structfuns.tm Added

@@ -0,0 +1,72 @@
+\function{struct_filter}
+\synopsis{Apply a filter to a struct}
+\usage{struct_filter(Struct_Type s, Int_Type i)}
+\description
+  This function applies the filter \exmp{i} to the fields of a structure
+  by performing the operation
+#v+
+    s.field = s.fieldi;
+#v-
+  on each array field of the structure.  Scalar fields will not be modified.
+
+  The \exmp{dim} qualifier may be used to filter on a specific array
+  dimension.  For example, consider the structure
+#v+
+    s = struct { a = Int_Type10, b = Int_Type10,20 };
+#v-
+  Then
+#v+
+    struct_filter (s, i; dim=0);
+#v-
+  would produce the same result as
+#v+
+    s.a = s.ai;
+    s.b = s.bi,*;
+#v-
+\notes
+  By default this function modifies the fields of the structure passed
+  to it.  Sometimes it is desirable to create a new structure and
+  leave the old one untouched.  This may be achieved using the
+  \exmp{copy} qualifier, e.g.,
+#v+
+     filtered_s = struct_filter (s, i; copy);
+#v-
+\seealso{where}
+\done
+
+\function{struct_combine}
+\synopsis{Combine two or more structures}
+\usage{new_s = struct_combine (s1, s2, ...)}
+\description
+  This function creates a new structure from two or more structures
+  \exmp{s1}, \exmp{s2},....  The new structure will have fields formed by the
+  union of the fields of the input structures.  The new structure fields will
+  be given values that correspond to the fields of the input structures.  If
+  more than one structure has the same field name, the value of the field will
+  be given by the last structure.
+
+  If any of the input values is a string, or an array of strings, then
+  it will be interpreted as a representing a structure with the
+  corresponding field names.  This is a useful feature when one wants
+  to expand a structure with new field names, e.g.,
+#v+
+    s = struct { foo, bar };
+    t = struct_combine (s, "baz");   % t = struct {foo, bar, baz};
+#v-
+\notes
+  The same effect can be achieved by using the dereference operator, e.g.,
+#v+
+    t = struct { @s, "baz" };
+#v-
+\seealso{get_struct_field_names}
+\done
+
+\function{struct_field_exists}
+\synopsis{Determine whether or not a structure contains a specified field}
+\usage{Int_Type struct_field_exists (Struct_Type s, String_Type f)}
+\description
+ This function may be used to determine if a structure contains a field with
+ a specfied name.  It returns 0 if the structure does not contain the field,
+ or non-zero if it does.
+\seealso{get_struct_field_names}
+\done

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/mkfiles Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/mkfiles/README Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/mkfiles/makefile.all Added

@@ -0,0 +1,401 @@
+!ifndef MSDOS WIN16 WIN32 OS2
+# -*- mode: sh; mode: fold -*-
+# This file has been folded. It is far more comprehensible when viewed with
+# an editor that supports folding.
+
+#{{{ MACRO descriptions
+
+This is a master makefile that from which DOS/Windows/OS2 makefiles
+may be derived. A makefile for a particular system may be derived by
+passing this through the standalone DOS executable 'mkmake' which
+should be present in this directory. For example, to produce a makefile
+suitable for OS2 using the EMX compiler use:
+
+ mkmake OS2 EMX < makefile.all > Makefile
+
+Similarly,
+
+ mkmake MSDOS BCC < makefile.all > Makefile
+
+will produce a makefile for MSDOS and the Borland C compiler.
+
+Currently supported environments include:
+
+ MSDOS WIN16 WIN32 OS2
+
+Currently supported compilers include:
+
+ MSDOS - BCC, DJGPP, DJGPP_V1
+ WIN16 - BCC
+ WIN32 - BCC, VC, CYGWIN32, MINGW32
+ OS2 - EMX, ICC
+
+If are linking against a dll version of slang,
+add a 'DLL' parameter to mkmake:
+
+ mkmake WIN32 VC DLL < makefile.all > Makefile
+
+(right now this is known to work only with Visual Studio).
+
+Each section must define the following macros:
+
+ CC : The C compiler
+ CFLAGS		: Compiler flags
+ P		: Path separator used by make/compiler
+ O		: Object file extension
+ SRCDIR		: SRC location (.)
+ OBJDIR		: Directory where objects are placed
+ COMPILE_CMD	: Command used to produce object from .c file
+ LINK_CMD : Command used to produce executable
+ LIBDEPS	: Other dependencies library depends upon
+ TARGET		: Primary target name
+ SLANGLIB : Location of slang library
+ SLANGINC : Location of slang.h
+ TARGET_DEPS : Misc stuff to build
+ COMPILE_DEPS : Dependencies associated with COMPILE_CMD
+ COPY		: Copy command
+ RM		: What to use to delete a file
+
+Other macros include:
+
+ RSPFILE	: Name of response file
+ RSP_PREFIX	: Prefix for response file line (See its usage)
+ RSP_POSTFIX	: Postfix for response file line (See its usage)
+ DEF_FILE : *.def file
+ RC		: resource compiler
+ RC_FILE	: resource compiler base name (e.g. wjed)
+
+Special notes:
+
+ The P macro could be problematic when its value is a backslash (\). Some
+ make programs may require it to be doubled, i.e., \\. Whatever its value is,
+ it should expand to something that does not include whitespace. Usually
+ this requires that it be followed by a '#' character; however, this may
+ result in the '#' character being quoted, or, escaped if the value of P is
+ a backslash.
+
+#}}}
+!else #rest of file
+# Note:
+# This makefile was automatically generated from the master makefile.all.
+TOOL_PREFIX =
+!ifdef MSDOS #{{{
+! ifdef DJGPP DJGPP_V1 #{{{
+CC = gcc
+CFLAGS = -O2 -fno-strength-reduce -Wall
+P = /# path sep
+O = o # Object extension
+SRCDIR = .# Location of sources
+OBJDIR = djgobjs# Location of objects
+TARGET = $(OBJDIR)/slsh.exe
+RSPFILE = $(OBJDIR)/link.rsp
+RSP_PREFIX =
+RSP_POSTFIX =
+SLANGINC = ../src
+SLANGLIB = $(SLANGINC)/$(OBJDIR)
+COMPILE_CMD = $(CC) -c $(CFLAGS) -I$(SLANGINC) -o #
+! ifndef DJGPP_V1
+LINK_CMD = $(CC) -s -L$(SLANGLIB) -o $(TARGET) @$(RSPFILE) -lslang
+! else
+GO32 = G:/djgpp/bin/go32.exe
+! endif
+COMPILE_DEPS =
+TARGET_DEPS =
+RM = rm
+COPY = cp
+#}}}
+! elifdef BCC #{{{
+CC = bcc
+CFLAGS = -G- -H -N -O1 -w -ml -Dmsdos
+P = \\
+O = obj
+SRCDIR = .
+OBJDIR = bccobjs
+TARGET = $(OBJDIR)\slsh.exe
+RSPFILE = $(OBJDR)\bcc.rsp
+RSP_PREFIX =
+RSP_POSTFIX =
+SLANGINC = ..\src
+SLANGLIB = $(SLANGINC)\$(OBJDIR)
+COMPILE_CMD = $(CC) -c $(CFLAGS) -I$(SLANGINC) -o# <-- no tailing space
+LINK_CMD = $(CC) -ml -L$(SLANGLIB) -e$(TARGET) /P=4096 @$(RSPFILE) slang.lib
+COMPILE_DEPS =
+TARGET_DEPS =
+RM = del
+COPY = copy /y
+#}}}
+! endif
+#}}}
+!endif
+!ifdef WIN16 #{{{
+! ifdef BCC #{{{
+CC = bcc
+CFLAGS = -G- -H -N -w -ml -Dmsdos -D__WIN16__ -W
+#CFLAGS = -N -v -H -w -ml -Dmsdos -DMSWINDOWS -WS
+OBJDIR = mswobjs# Location of objects
+TARGET = $(OBJDIR)\slsh.exe
+BCCLIB = C:\BCC31\LIB
+O = obj # Object extension
+P = \\
+SRCDIR = .# Location of sources
+SLANGINC = ..\src
+SLANGLIB = $(SLANGINC)\$(OBJDIR)
+RSPFILE = $(OBJDIR)\mswin.rsp
+RSP_PREFIX =
+RSP_POSTFIX = +
+COMPILE_CMD = $(CC) -c $(CFLAGS) -I$(SLANGINC) -o#
+LINK_CMD = tlink /Twe/m/v/c/P/i/s $(BCCLIB)\c0wl @$(RSPFILE)
+MSWSHELL_EXE = ..\bin\mswshell.exe
+DEF_FILE = $(OBJDIR)\slsh.def
+TARGET_DEPS = $(MSWSHELL_EXE) $(DEF_FILE)
+COMPILE_DEPS =
+RM = del
+COPY = copy /y
+#}}}
+! endif
+#}}}
+!endif
+!ifdef WIN32 #{{{
+! ifdef BCC #{{{
+CC = bcc32
+#CFLAGS = -G- -H -N -w -D__WIN32__ -W
+CFLAGS = -G- -H -N -w -W -w-sig -w-stu
+# Location of objects
+OBJDIR = bw32objs
+TARGET = $(OBJDIR)\slsh.exe
+BCCLIB = C:\BC5\LIB
+# Object extension
+O = obj
+P = \\ # Comment to prevent continuation marker confusion with Borland Make
+SRCDIR = .
+RSPFILE = $(OBJDIR)\link.rsp
+RSPFILE2 = $(OBJDIR)\link2.rsp
+RSP_PREFIX =
+RSP_POSTFIX = +
+COMPILE_CMD = $(CC) -c $(CFLAGS) -I$(SLANGINC) -o
+LINK_CMD = tlink32 /Tpe /ap /c /x $(BCCLIB)\c0x32 @$(RSPFILE), $(OBJDIR)$(P)slsh.exe, @$(RSPFILE2)
+DEF_FILE =
+TARGET_DEPS = $(RSPFILE2)
+COMPILE_DEPS =
+RM = del
+COPY = copy /y
+#}}}
+! elifdef VC #{{{
+# Makefile for slang as Win32 GUI using nmake under Visual C.
+CC = cl
+CFLAGS = /nologo /W3 /O2 /D "NDEBUG" /D $(CPU) /D "__WIN32__" /D "_CRT_SECURE_NO_WARNINGS" /D "_CRT_NONSTDC_NO_DEPRECATE" /I "." /I $(SLANGINC)
+P = \\
+O = obj # Object extension
+SRCDIR = .# Location of sources
+OBJDIR = mw32objs# Location of objects
+RSPFILE = $(OBJDIR)\link.rsp
+RSP_PREFIX =
+RSP_POSTFIX =
+COMPILE_RSP = $(OBJDIR)\comp.rsp
+COMPILE_CMD = $(CC) /c $(CFLAGS) @$(COMPILE_RSP) /Fo # /Fo specifies object file name
+RC = rc
+RC_FILE = mkfiles\slsh
+RES_FILE = $(OBJDIR)\slsh.res
+TARGET_DEPS = $(RES_FILE)
+COMPILE_DEPS = $(COMPILE_RSP)
+RM = del
+COPY = copy /y
+LINK_CMD = link -out:$(OBJDIR)$(P)slsh.exe /SUBSYSTEM:console @$(RSPFILE) $(RES_FILE)
+# This needs changing for Windows NT on non-Intel processors
+CPU = _X86_
+#}}}
+! elifdef CYGWIN32 MINGW32 #{{{
+CC = $(TOOL_PREFIX)gcc
+P = /
+WFLAGS = -W -Wall
+! ifdef CYGWIN32
+CFLAGS = -DWIN32 -O2 -fno-strength-reduce $(WFLAGS) -mno-cygwin
+! else
+! ifdef DLL
+DLL_FLAGS = -DSLANG_DLL=1
+! endif
+CFLAGS = -DWIN32 -O2 -fno-strength-reduce $(WFLAGS) $(DLL_FLAGS)
+! endif
+LINK_CMD = $(CC) -s -L$(SLANGLIB) -o $(OBJDIR)$(P)slsh.exe $(OBJS) -lslang -luser32
+OBJDIR = gw32objs# Location of objects
+O = o # Object extension
+SRCDIR = .# Location of sources
+RSPFILE =
+RSP_PREFIX =
+RSP_POSTFIX =
+DEFS = -DSLSH_CONF_DIR='"$(SLSH_CONF_DIR)"' -DSLSH_PATH='"$(SLSH_LIB_DIR)"'
+COMPILE_CMD = $(CC) -c $(CFLAGS) $(DEFS) -I$(SLANGINC) -o #
+SLSH_CONF_DIR = /etc
+SLSH_LIB_DIR = /usr/share/slsh
+COMPILE_DEPS =
+RM = rm
+COPY = cp
+#}}}
+! endif
+TARGET = $(OBJDIR)$(P)slsh.exe
+SLANGINC = ..$(P)src
+SLANGLIB = ..$(P)src$(P)$(OBJDIR)
+#}}}
+!endif
+!ifdef OS2 #{{{
+! ifdef EMX #{{{
+CC = gcc -Zmtd
+CFLAGS = -DOS2 -D__os2__
+P = /
+O = o # Object extension
+SRCDIR = .# Location of sources
+OBJDIR = emxobjs# Location of objects
+SLANGINC = ../src
+SLANGLIB = ../src/$(OBJDIR)
+TARGET = $(OBJDIR)/slsh.exe
+COMPILE_CMD = $(CC) -c $(CFLAGS) -I$(SLANGINC) -o #
+DEF_FILE = $(OBJDIR)/slsh.def
+LINK_CMD = $(CC) -o $(TARGET) $(OBJS) -L$(SLANGLIB) $(DEF_FILE) -lslang -lvideo
+TARGET_DEPS = $(DEF_FILE)
+COMPILE_DEPS =
+RM = rm
+COPY = cp
+#}}}
+! elifdef WCC #{{{
+CC = wcc386
+CFLAGS = -DOS2 -D__os2__ -bm -bt=os2 #
+P = \#
+O = obj # Object extension
+SRCDIR = .# Location of sources
+OBJDIR = wccobjs# Location of objects
+SLANGINC = ..\src
+SLANGLIB = ..\src\$(OBJDIR)\slang.lib
+TARGET = $(OBJDIR)\slsh.exe
+COMPILE_CMD = $(CC) $(CFLAGS) -I=$(SLANGINC) -fo=#
+DEF_FILE =
+LINK_CMD = wcl386 -fe=$(TARGET) $(OBJS) $(SLANGLIB) -k150000 # -lvideo
+TARGET_DEPS =
+COMPILE_DEPS =
+RM = del
+COPY = copy /y
+#}}}
+! elifdef ICC #{{{
+CC = icc
+CFLAGS = -Q+ -W3 -DOS2 -D__os2__ -Gm+ -Wcnd-
+P = \#
+O = obj
+SRCDIR = .
+OBJDIR = iccobjs
+SLANGINC = ..\src
+SLANGLIB = ..\src\$(OBJDIR)\slang.lib
+TARGET = $(OBJDIR)\slsh.exe
+COMPILE_CMD = $(CC) -c $(CFLAGS) -I$(SLANGINC) -Fo# <-- no trailing space
+DEF_FILE =
+LINK_CMD = $(CC) -Fe$(TARGET) $(OBJS) $(SLANGLIB)
+TARGET_DEPS =
+COMPILE_DEPS =
+RM = del
+COPY = copy /y
+#}}}
+! endif
+#}}}
+!endif
+#-------------------------------------------------------------------------------
+
+# End of compiler specific section
+
+#{{{ OBJS =
+OBJS = $(OBJDIR)$(P)slsh.$(O) $(OBJDIR)$(P)readline.$(O)
+#}}}
+
+! ifdef WIN32
+slsh: $(TARGET)
+	@echo slsh created in $(OBJDIR)
+$(TARGET): $(OBJDIR) $(RSPFILE) $(OBJS) $(TARGET_DEPS)
+	$(LINK_CMD)
+! ifdef VC
+$(RES_FILE): $(RC_FILE).rc
+	$(RC) /fo $(RES_FILE) $(RC_FILE).rc
+$(COMPILE_RSP) :
+	echo $(CFLAGS) > $(COMPILE_RSP)
+! ifdef DLL
+	echo /DSLANG_DLL=1 >> $(COMPILE_RSP)
+! endif
+! elifdef BCC
+$(RSPFILE2) : makefile
+	@echo $(OBJDIR)$(P)slsh.map > $(RSPFILE2)
+	@echo $(SLANGLIB)$(P)wslang+ >> $(RSPFILE2)
+	@echo $(BCCLIB)$(P)import32+ >> $(RSPFILE2)
+	@echo $(BCCLIB)$(P)cw32 >> $(RSPFILE2)
+! ifdef WIN16 EMX
+	@echo $(DEF_FILE) >> $(RSPFILE2)
+! endif
+! endif
+! else
+$(TARGET): $(OBJDIR) $(RSPFILE) $(OBJS) $(TARGET_DEPS)
+! ifndef DJGPP_V1
+	$(LINK_CMD)
+! else
+	$(CC) -s @$(RSPFILE) -L$(SLANGLIB) -lslang -lpc -o $(OBJDIR)/slsh.386
+	strip $(OBJDIR)/slsh.386
+	coff2exe -s $(GO32) $(OBJDIR)/slsh.386
+! endif
+! endif # WIN32
+
+! ifndef EMX CYGWIN32 MINGW32 ICC
+#{{{ $(RSPFILE)
+$(RSPFILE) : makefile
+	echo Creating response file $(RSPFILE)
+! ifdef VC
+	@echo /NOLOGO user32.lib gdi32.lib > $(RSPFILE)
+	@echo winspool.lib comdlg32.lib advapi32.lib shell32.lib >> $(RSPFILE)
+! endif
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slsh.$(O) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)readline.$(O) >> $(RSPFILE)
+! ifdef WIN16
+	@echo $(TARGET) >> $(RSPFILE)
+	@echo slsh.map >> $(RSPFILE)
+	@echo $(SLANGLIB)\wslang+ >> $(RSPFILE)
+	@echo $(BCCLIB)\import+ >> $(RSPFILE)
+	@echo $(BCCLIB)\mathwl+ >> $(RSPFILE)
+	@echo $(BCCLIB)\cwl >> $(RSPFILE)
+	@echo $(DEF_FILE) >> $(RSPFILE)
+!endif
+!ifdef WIN32
+!ifdef VC
+	@echo $(SLANGLIB)\WSLANG32.LIB >> $(RSPFILE)
+!endif
+!endif
+#}}}
+!endif #NOT EMX
+
+$(OBJDIR) :
+	-mkdir $(OBJDIR)
+
+! ifdef WIN16 EMX
+#{{{ $(DEF_FILE)
+
+$(DEF_FILE) :
+	@echo creating $(DEF_FILE)
+! ifdef WIN16
+	@echo NAME SLSH > $(DEF_FILE)
+	@echo EXETYPE WINDOWS >> $(DEF_FILE)
+	@echo CODE PRELOAD MOVEABLE DISCARDABLE >> $(DEF_FILE)
+	@echo DATA PRELOAD MOVEABLE >> $(DEF_FILE)
+	@echo HEAPSIZE 100 >> $(DEF_FILE)
+	@echo STACKSIZE 16384 >> $(DEF_FILE)
+! endif
+! ifdef EMX
+	@echo NAME SLSH WINDOWCOMPAT > $(DEF_FILE)
+	@echo DESCRIPTION 'SLSH for OS/2' >> $(DEF_FILE)
+	@echo STACKSIZE 150000 >> $(DEF_FILE)
+! endif
+
+#}}}
+!endif
+
+$(OBJDIR)$(P)slsh.$(O) : $(SRCDIR)$(P)slsh.c $(COMPILE_DEPS)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slsh.$(O) $(SRCDIR)$(P)slsh.c
+$(OBJDIR)$(P)readline.$(O) : $(SRCDIR)$(P)readline.c $(COMPILE_DEPS)
+	$(COMPILE_CMD)$(OBJDIR)$(P)readline.$(O) $(SRCDIR)$(P)readline.c
+
+clean:
+	-cd $(OBJDIR) && $(RM) *.$(O) *.exe
+
+!endif #NOT HELP
+

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/mkfiles/sldoc.ico Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/mkfiles/slsh.ico Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/mkfiles/slsh.rc Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/readline.c Added

@@ -0,0 +1,1102 @@
+/*
+Copyright (C) 2005-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+/* The code in this file was adapted from jdl. The GNU readline support
+ * was provided by Mike Noble.
+ */
+
+#include "config.h"
+
+#include <stdio.h>
+#include <stdlib.h>
+#ifdef __WIN32__
+# include <windows.h>
+#endif
+
+#ifdef HAVE_UNISTD_H
+# include <unistd.h>
+#endif
+#include <string.h>
+#include <slang.h>
+#include "slsh.h"
+
+#include <signal.h>
+#include <errno.h>
+
+#ifndef USE_GNU_READLINE
+# define USE_GNU_READLINE 0
+#endif
+
+#define USE_SLANG_READLINE (!USE_GNU_READLINE)
+
+#ifdef REAL_UNIX_SYSTEM
+# define SYSTEM_SUPPORTS_SIGNALS 1
+#else
+# define SYSTEM_SUPPORTS_SIGNALS 0
+#endif
+
+#if USE_GNU_READLINE
+# include <readline/readline.h>
+# include <readline/history.h>
+#endif
+
+static int Use_Readline;
+static int Slsh_Quit = 0;
+static SLang_Load_Type *Readline_Load_Object;
+
+typedef struct
+{
+#if USE_SLANG_READLINE
+ SLrline_Type *rli;
+#endif
+ int output_newline;
+}
+Slsh_Readline_Type;
+
+static Slsh_Readline_Type *Default_Readline_Info;
+
+static void init_tty (void);
+static void reset_tty (void);
+
+#if USE_GNU_READLINE
+static void gnu_rl_sigint_handler (int sig)
+{
+ (void) sig;
+ rl_delete_text (0, rl_end);
+ rl_point = rl_end = 0;
+ fprintf (stdout, "\n");
+ rl_forced_update_display ();
+}
+
+static void (*last_sig_sigint) (int);
+static void init_tty (void)
+{
+ last_sig_sigint = SLsignal (SIGINT, gnu_rl_sigint_handler);
+}
+
+static void reset_tty (void)
+{
+ SLsignal (SIGINT, last_sig_sigint);
+}
+
+#else				 /* ifdef USE_GNU_READLINE */
+
+static Slsh_Readline_Type *Active_Rline_Info;
+
+# if SYSTEM_SUPPORTS_SIGNALS
+static void (*last_sig_sigtstp) (int);
+
+# define USE_SIGTSTP_INTERRUPT 1
+# if USE_SIGTSTP_INTERRUPT
+static int Want_Suspension = 0;
+# endif
+
+static void suspend_slsh (void)
+{
+ reset_tty ();
+ (void) SLang_run_hooks ("slsh_readline_suspend_before_hook", 0);
+ kill (0, SIGSTOP);
+ (void) SLang_run_hooks ("slsh_readline_suspend_after_hook", 0);
+ init_tty ();
+ if (Active_Rline_Info != NULL)
+ {
+	SLsig_block_signals ();
+	SLrline_set_display_width (Active_Rline_Info->rli, SLtt_Screen_Cols);
+	SLrline_redraw (Active_Rline_Info->rli);
+	SLsig_unblock_signals ();
+ }
+}
+
+static int sigtstp_interrupt_hook (VOID_STAR unused)
+{
+ (void) unused;
+ if (Want_Suspension)
+ {
+	Want_Suspension = 0;
+	suspend_slsh ();
+ }
+ return 0;
+}
+
+static void sig_sigtstp (int sig)
+{
+ sig = errno;
+# if USE_SIGTSTP_INTERRUPT
+ Want_Suspension = 1;
+# else
+ suspend_slsh ();
+# endif
+ (void) SLsignal (sig, sig_sigtstp);
+ errno = sig;
+}
+
+static void init_sigtstp (void)
+{
+ (void) SLang_add_interrupt_hook (sigtstp_interrupt_hook, NULL);
+ last_sig_sigtstp = SLsignal (SIGTSTP, sig_sigtstp);
+}
+static void deinit_sigtstp (void)
+{
+ SLsignal (SIGTSTP, last_sig_sigtstp);
+ (void) SLang_remove_interrupt_hook (sigtstp_interrupt_hook, NULL);
+}
+
+# endif				 /* SYSTEM_SUPPORTS_SIGNALS */
+
+# ifdef SIGWINCH
+static int Want_Window_Size_Change = 0;
+static void sig_winch_handler (int sig)
+{
+ sig = errno;
+ Want_Window_Size_Change = 1;
+ SLsignal_intr (SIGWINCH, sig_winch_handler);
+ errno = sig;
+}
+
+static int screen_size_changed_hook (VOID_STAR cd_unused)
+{
+ (void) cd_unused;
+ if (Want_Window_Size_Change)
+ {
+	Want_Window_Size_Change = 0;
+	if (Active_Rline_Info != NULL)
+	 {
+	 SLtt_get_screen_size ();
+	 SLrline_set_display_width (Active_Rline_Info->rli, SLtt_Screen_Cols);
+	 }
+ }
+ return 0;
+}
+# endif
+
+static int add_sigwinch_handlers (void)
+{
+# ifdef SIGWINCH
+ (void) SLang_add_interrupt_hook (screen_size_changed_hook, NULL);
+ (void) SLsignal_intr (SIGWINCH, sig_winch_handler);
+# endif
+ return 0;
+}
+
+# ifdef REAL_UNIX_SYSTEM
+/* This hook if a signal occurs while waiting for input. */
+static int getkey_intr_hook (void)
+{
+ return SLang_handle_interrupt ();
+}
+# endif
+
+static int TTY_Inited = 0;
+static void init_tty (void)
+{
+ int abort_char = 3;
+
+ TTY_Inited++;
+ if (TTY_Inited > 1)
+ return;
+
+# if SYSTEM_SUPPORTS_SIGNALS
+ SLsig_block_signals ();
+ SLang_TT_Read_FD = fileno (stdin);
+ init_sigtstp ();
+# endif
+# ifdef REAL_UNIX_SYSTEM
+ abort_char = -1;		 /* determine from tty */
+# endif
+
+ if (-1 == SLang_init_tty (abort_char, 1, 1)) /* opost was 0 */
+ {
+# if SYSTEM_SUPPORTS_SIGNALS
+	deinit_sigtstp ();
+	SLsig_unblock_signals ();
+# endif
+	SLang_exit_error ("Error initializing terminal.");
+ }
+
+# ifdef REAL_UNIX_SYSTEM
+ SLang_getkey_intr_hook = getkey_intr_hook;
+# endif
+ (void) add_sigwinch_handlers ();
+
+ SLtt_get_screen_size ();
+
+# if SYSTEM_SUPPORTS_SIGNALS
+ SLtty_set_suspend_state (1);
+ SLsig_unblock_signals ();
+# endif
+}
+
+static void reset_tty (void)
+{
+ if (TTY_Inited == 0)
+ return;
+
+ TTY_Inited--;
+
+ if (TTY_Inited)
+ return;
+
+# if SYSTEM_SUPPORTS_SIGNALS
+ SLsig_block_signals ();
+ deinit_sigtstp ();
+# endif
+ SLang_reset_tty ();
+# if SYSTEM_SUPPORTS_SIGNALS
+ SLsig_unblock_signals ();
+# endif
+}
+#endif				 /* ifdef USE_GNU_READLINE else */
+
+static void close_readline (void)
+{
+ if (Default_Readline_Info != NULL)
+ {
+#if USE_SLANG_READLINE
+	SLrline_close (Default_Readline_Info->rli);
+#endif
+	SLfree ((char *) Default_Readline_Info);
+	Default_Readline_Info = NULL;
+ }
+}
+
+static void close_slsh_readline (Slsh_Readline_Type *sri)
+{
+ if (sri == NULL)
+ return;
+#if USE_SLANG_READLINE
+ if (sri->rli != NULL)
+ SLrline_close (sri->rli);
+#endif
+ SLfree ((char *) sri);
+}
+
+static Slsh_Readline_Type *open_slsh_readline (SLFUTURE_CONST char *name, unsigned int flags)
+{
+ Slsh_Readline_Type *sri;
+
+ if (NULL == (sri = (Slsh_Readline_Type *)SLmalloc (sizeof (Slsh_Readline_Type))))
+ return NULL;
+ memset ((char *)sri, 0, sizeof (Slsh_Readline_Type));
+
+#if USE_SLANG_READLINE
+ if (name == NULL)
+ sri->rli = SLrline_open (SLtt_Screen_Cols, flags);
+ else
+ sri->rli = SLrline_open2 (name, SLtt_Screen_Cols, flags);
+
+ if (sri->rli == NULL)
+ {
+	SLfree ((char *)sri);
+	return NULL;
+ }
+ sri->output_newline = 1;
+#endif
+ return sri;
+}
+
+
+static int open_readline (SLFUTURE_CONST char *name)
+{
+ unsigned int flags = SL_RLINE_BLINK_MATCH|SL_RLINE_USE_MULTILINE;
+ close_readline ();
+ Default_Readline_Info = open_slsh_readline (name, flags);
+ if (Default_Readline_Info == NULL)
+ return -1;
+ return 0;
+}
+
+#if USE_GNU_READLINE
+static void redisplay_dummy (void)
+{
+}
+#endif
+
+static char *read_with_no_readline (char *prompt, int noecho)
+{
+ char *line;
+#ifdef REAL_UNIX_SYSTEM
+ int stdin_is_noecho = 0;
+#endif
+ char buf1024;
+ char *b;
+
+ fprintf (stdout, "%s", prompt); fflush (stdout);
+ if (noecho)
+ {
+#ifdef REAL_UNIX_SYSTEM
+	if (isatty (fileno(stdin)))
+	 {
+	 (void) SLsystem ("stty -echo"); /* yuk */
+	 stdin_is_noecho = 1;
+	 }
+#endif
+ }
+
+ line = buf;
+ while (NULL == fgets (buf, sizeof (buf), stdin))
+ {
+#ifdef EINTR
+	if (errno == EINTR)
+	 {
+	 if (-1 == SLang_handle_interrupt ())
+	 {
+		 line = NULL;
+		 break;
+	 }
+	 continue;
+	 }
+#endif
+	line = NULL;
+	break;
+ }
+#ifdef REAL_UNIX_SYSTEM
+ if (stdin_is_noecho)
+ (void) SLsystem ("stty echo");
+#endif
+ if (line == NULL)
+ return NULL;
+
+ /* Remove the final newline */
+ b = line;
+ while (*b && (*b != '\n'))
+ b++;
+ *b = 0;
+
+ return SLmake_string (line);
+}
+
+static char *read_input_line (Slsh_Readline_Type *sri, char *prompt, int noecho)
+{
+ char *line;
+
+ if (Use_Readline == 0)
+ return read_with_no_readline (prompt, noecho);
+
+#if SYSTEM_SUPPORTS_SIGNALS
+ init_tty ();
+#endif
+#if USE_GNU_READLINE
+ (void) sri;
+ if (noecho == 0)
+ rl_redisplay_function = rl_redisplay;
+ else
+ {
+	/* FIXME: What is the proper way to implement this in GNU readline? */
+	(void) fputs (prompt, stdout); (void) fflush (stdout);
+	rl_redisplay_function = redisplay_dummy;
+ }
+ line = readline (prompt);
+ rl_redisplay_function = rl_redisplay;
+#else
+ SLtt_get_screen_size ();
+ SLrline_set_display_width (sri->rli, SLtt_Screen_Cols);
+ (void) add_sigwinch_handlers ();
+ Active_Rline_Info = sri;
+ (void) SLrline_set_echo (sri->rli, (noecho == 0));
+ line = SLrline_read_line (sri->rli, prompt, NULL);
+ Active_Rline_Info = NULL;
+#endif
+#if SYSTEM_SUPPORTS_SIGNALS
+ reset_tty ();
+#endif
+ if (sri->output_newline)
+ fputs ("\r\n", stdout);
+ fflush (stdout);
+ return line;
+}
+
+static int save_input_line (Slsh_Readline_Type *rline, char *line)
+{
+ char *p;
+
+ if (Use_Readline == 0)
+ return 0;
+
+ if (line == NULL)
+ return 0;
+
+ p = line;
+ while ((*p == ' ') || (*p == '\t') || (*p == '\n'))
+ p++;
+ if (*p == 0)
+ return 0;
+
+#if USE_GNU_READLINE
+ (void) rline;
+ add_history(line);
+ return 0;
+#else
+ return SLrline_save_line (rline->rli);
+#endif
+}
+
+static SLang_Name_Type *Prompt_Hook = NULL;
+static void set_prompt_hook (void)
+{
+ SLang_Name_Type *h;
+
+ if (SLang_peek_at_stack () == SLANG_NULL_TYPE)
+ {
+	SLang_pop_null ();
+	h = NULL;
+ }
+ else if (NULL == (h = SLang_pop_function ()))
+ return;
+
+ if (Prompt_Hook != NULL)
+ SLang_free_function (Prompt_Hook);
+
+ Prompt_Hook = h;
+}
+
+static void get_prompt_hook (void)
+{
+ if (Prompt_Hook == NULL)
+ (void) SLang_push_null ();
+ else
+ (void) SLang_push_function (Prompt_Hook);
+}
+
+/* Returns a malloced value */
+static char *get_input_line (SLang_Load_Type *x)
+{
+ char *line;
+ int parse_level;
+ int free_prompt = 0;
+ char *prompt;
+
+ parse_level = x->parse_level;
+ if (Prompt_Hook != NULL)
+ {
+	if ((-1 == SLang_start_arg_list ())
+	 || (-1 == SLang_push_int (parse_level))
+	 || (-1 == SLang_end_arg_list ())
+	 || (-1 == SLexecute_function (Prompt_Hook))
+	 || (-1 == SLang_pop_slstring (&prompt)))
+	 {
+	 SLang_verror (SL_RunTime_Error, "Disabling prompt hook");
+	 SLang_free_function (Prompt_Hook);
+	 Prompt_Hook = NULL;
+	 return NULL;
+	 }
+	free_prompt = 1;
+ }
+ else if (parse_level == 0)
+ prompt = (char *) "slsh> ";
+ else
+ prompt = (char *) " ";
+
+ if (parse_level == 0)
+ {
+	if (-1 == SLang_run_hooks ("slsh_interactive_before_hook", 0))
+	 {
+	 if (free_prompt)
+	 SLang_free_slstring (prompt);
+	 return NULL;
+	 }
+ }
+
+ line = read_input_line (Default_Readline_Info, prompt, 0);
+
+ if (free_prompt)
+ SLang_free_slstring (prompt);
+
+ if ((line == NULL)
+ && (parse_level == 0)
+ && (SLang_get_error() == 0))
+ {
+	Slsh_Quit = 1;
+	return NULL;
+ }
+
+ if (line == NULL)
+ {
+	return NULL;
+ }
+
+ /* This hook is used mainly for logging input */
+ (void) SLang_run_hooks ("slsh_interactive_after_hook", 1, line);
+
+ (void) save_input_line (Default_Readline_Info, line);
+
+ return line;
+}
+
+static char *read_using_readline (SLang_Load_Type *x)
+{
+ char *s;
+ static char *last_s;
+
+ if (last_s != NULL)
+ {
+	SLfree (last_s);
+	last_s = NULL;
+ }
+
+ if (SLang_get_error ())
+ return NULL;
+
+ SLKeyBoard_Quit = 0;
+
+ s = get_input_line (x);
+
+ if (s == NULL)
+ return NULL;
+
+ if ((x->parse_level == 0)
+ && (1 == SLang_run_hooks ("slsh_interactive_massage_hook", 1, s)))
+ {
+	SLfree (s);
+	if (-1 == SLpop_string (&s))
+	 return NULL;
+ }
+
+ if (SLang_get_error ())
+ {
+	SLfree (s);
+	return NULL;
+ }
+
+ last_s = s;
+ return s;
+}
+
+static void enable_keyboard_interrupt (void)
+{
+ static int is_enabled = 0;
+
+ if (is_enabled == 0)
+ {
+	(void) SLang_set_abort_signal (NULL);
+	is_enabled = 1;
+ }
+}
+
+static void close_interactive (void)
+{
+ close_readline ();
+
+ if (Readline_Load_Object == NULL)
+ return;
+
+ SLdeallocate_load_type (Readline_Load_Object);
+ Readline_Load_Object = NULL;
+#if !SYSTEM_SUPPORTS_SIGNALS
+ reset_tty ();
+ fputs ("\r\n", stdout);
+ fflush (stdout);
+#endif
+}
+
+static int open_interactive (void)
+{
+ if (Use_Readline
+ && (-1 == open_readline ("slsh")))
+ return -1;
+
+ if (NULL == (Readline_Load_Object = SLallocate_load_type ("<stdin>")))
+ {
+	if (Use_Readline)
+	 close_readline ();
+	return -1;
+ }
+
+ Readline_Load_Object->read = read_using_readline;
+ Readline_Load_Object->auto_declare_globals = 1;
+
+#if !SYSTEM_SUPPORTS_SIGNALS
+ /* If the system does not support asynchronouse signals, then it may install
+ * a SLang_Interrupt hook that checks for ^C, etc. For that reason, the
+ * tty must be initialized the whole time.
+ */
+ init_tty ();
+#endif
+ enable_keyboard_interrupt ();
+
+ return 0;
+}
+
+static int init_readline (char *appname)
+{
+ static int inited = 0;
+
+ if (inited)
+ return 0;
+
+#if USE_SLANG_READLINE
+ if (Use_Readline == 0)
+ {
+	inited = 1;
+	return 0;
+ }
+ if (-1 == SLrline_init (appname, NULL, NULL))
+ return -1;
+#endif
+
+ inited = 1;
+ return 0;
+}
+
+int slsh_use_readline (char *app_name, int use_readline, int is_interactive)
+{
+ Use_Readline = use_readline;
+
+#if USE_SLANG_READLINE
+ if (is_interactive)
+ {
+	if (-1 == init_readline (app_name))
+	 return -1;
+ }
+#endif
+
+ return 0;
+}
+
+int slsh_interactive (void)
+{
+ Slsh_Quit = 0;
+
+ (void) SLang_add_cleanup_function (close_interactive);
+
+ if (-1 == open_interactive ())
+ return -1;
+
+ (void) SLang_run_hooks ("slsh_interactive_hook", 0);
+
+ while (Slsh_Quit == 0)
+ {
+	if (SLang_get_error ())
+	 {
+	 SLang_restart(1);
+	 /* SLang_set_error (0); */
+	 }
+
+	SLKeyBoard_Quit = 0;
+	SLang_load_object (Readline_Load_Object);
+ }
+ close_interactive ();
+
+ return 0;
+}
+
+static Slsh_Readline_Type *Intrinsic_Rline_Info;
+
+#if USE_SLANG_READLINE
+static void close_intrinsic_readline (void)
+{
+ if (Intrinsic_Rline_Info != NULL)
+ {
+	SLrline_close (Intrinsic_Rline_Info->rli);
+	SLfree ((char *) Intrinsic_Rline_Info);
+	Intrinsic_Rline_Info = NULL;
+ }
+}
+#endif
+
+static int readline_intrinsic_internal (Slsh_Readline_Type *sri, char *prompt, int noecho)
+{
+ char *line;
+
+ if (sri == NULL)
+ sri = Intrinsic_Rline_Info;
+
+#if USE_SLANG_READLINE
+ if ((sri == NULL) && Use_Readline)
+ {
+	Intrinsic_Rline_Info = open_slsh_readline (NULL, SL_RLINE_BLINK_MATCH);
+	if (Intrinsic_Rline_Info == NULL)
+	 return -1;
+	(void) SLang_add_cleanup_function (close_intrinsic_readline);
+	sri = Intrinsic_Rline_Info;
+ }
+#endif
+ enable_keyboard_interrupt ();
+
+ line = read_input_line (sri, prompt, noecho);
+ if (noecho == 0)
+ (void) save_input_line (sri, line);
+ (void) SLang_push_malloced_string (line);
+ return 0;
+}
+
+static int Rline_Type_Id = 0;
+
+static SLang_MMT_Type *pop_sri_type (Slsh_Readline_Type **srip)
+{
+ SLang_MMT_Type *mmt;
+
+ if (NULL == (mmt = SLang_pop_mmt (Rline_Type_Id)))
+ return NULL;
+ if (NULL == (*srip = (Slsh_Readline_Type *)SLang_object_from_mmt (mmt)))
+ {
+	SLang_free_mmt (mmt);
+	return NULL;
+ }
+ return mmt;
+}
+
+static void readline_intrinsic (char *prompt)
+{
+ Slsh_Readline_Type *sri = NULL;
+ SLang_MMT_Type *mmt = NULL;
+
+ if (SLang_Num_Function_Args == 2)
+ {
+	if (NULL == (mmt = pop_sri_type (&sri)))
+	 return;
+ }
+ (void) readline_intrinsic_internal (sri, prompt, 0);
+
+ if (mmt != NULL)
+ SLang_free_mmt (mmt);
+}
+
+static void readline_noecho_intrinsic (char *prompt)
+{
+ Slsh_Readline_Type *sri = NULL;
+ SLang_MMT_Type *mmt = NULL;
+
+ if (SLang_Num_Function_Args == 2)
+ {
+	if (NULL == (mmt = pop_sri_type (&sri)))
+	 return;
+ }
+ (void) readline_intrinsic_internal (sri, prompt, 1);
+ if (mmt != NULL)
+ SLang_free_mmt (mmt);
+}
+
+static void new_slrline_intrinsic (char *name)
+{
+ Slsh_Readline_Type *sri;
+ SLang_MMT_Type *mmt;
+
+ if (NULL == (sri = open_slsh_readline (name, SL_RLINE_BLINK_MATCH)))
+ return;
+
+ if (NULL == (mmt = SLang_create_mmt (Rline_Type_Id, (VOID_STAR) sri)))
+ {
+	close_slsh_readline (sri);
+	return;
+ }
+
+ if (-1 == SLang_push_mmt (mmt))
+ SLang_free_mmt (mmt);
+}
+
+static void init_readline_intrinsic (char *appname)
+{
+ (void) init_readline (appname);
+}
+
+/* The values returned by this function are meaningful only after readline
+ * has been used once.
+ */
+static void get_screen_size (void)
+{
+ int rows, cols;
+
+#if USE_SLANG_READLINE
+ rows = SLtt_Screen_Rows;
+ cols = SLtt_Screen_Cols;
+#else
+ rl_get_screen_size (&rows, &cols);
+#endif
+
+ (void) SLang_push_int (rows);
+ (void) SLang_push_int (cols);
+}
+
+#if USE_SLANG_READLINE
+typedef struct
+{
+ SLang_MMT_Type *mmt;
+ Slsh_Readline_Type *sri;
+ SLang_Name_Type *update_hook;
+ SLang_Any_Type *cd;
+ SLang_Name_Type *clear_cb;
+ SLang_Name_Type *preread_cb;
+ SLang_Name_Type *postread_cb;
+ SLang_Name_Type *width_cb;
+}
+Rline_CB_Type;
+
+static int call_simple_update_cb (SLang_Name_Type *f, Rline_CB_Type *cb, int *opt)
+{
+ if (f == NULL)
+ return 0;
+
+ if (-1 == SLang_start_arg_list ())
+ return -1;
+ if ((-1 == SLang_push_mmt (cb->mmt))
+ || ((opt != NULL) && (-1 == SLang_push_int (*opt)))
+ || ((cb->cd != NULL) && (-1 == SLang_push_anytype (cb->cd))))
+ {
+	(void) SLang_end_arg_list ();
+	return -1;
+ }
+ return SLexecute_function (f);
+}
+
+static void rline_update_clear_cb (SLrline_Type *rli, VOID_STAR cd)
+{
+ Rline_CB_Type *cb = (Rline_CB_Type *)cd;
+ (void) rli;
+ (void) call_simple_update_cb (cb->clear_cb, cb, NULL);
+}
+
+static void rline_update_preread_cb (SLrline_Type *rli, VOID_STAR cd)
+{
+ Rline_CB_Type *cb = (Rline_CB_Type *)cd;
+ (void) rli;
+ (void) call_simple_update_cb (cb->preread_cb, cb, NULL);
+}
+
+static void rline_update_postread_cb (SLrline_Type *rli, VOID_STAR cd)
+{
+ Rline_CB_Type *cb = (Rline_CB_Type *)cd;
+ (void) rli;
+ (void) call_simple_update_cb (cb->postread_cb, cb, NULL);
+}
+
+static void rline_update_width_cb (SLrline_Type *rli, int w, VOID_STAR cd)
+{
+ Rline_CB_Type *cb = (Rline_CB_Type *)cd;
+ (void) rli;
+ (void) call_simple_update_cb (cb->width_cb, cb, &w);
+}
+
+static void free_cb_info (Rline_CB_Type *cb)
+{
+ if (cb == NULL)
+ return;
+ if (cb->mmt != NULL) SLang_free_mmt (cb->mmt);
+ if (cb->update_hook != NULL) SLang_free_function (cb->update_hook);
+ if (cb->clear_cb != NULL) SLang_free_function (cb->clear_cb);
+ if (cb->preread_cb != NULL) SLang_free_function (cb->preread_cb);
+ if (cb->postread_cb != NULL) SLang_free_function (cb->postread_cb);
+ if (cb->width_cb != NULL) SLang_free_function (cb->width_cb);
+ if (cb->cd != NULL) SLang_free_anytype (cb->cd);
+ SLfree ((char *)cb);
+}
+
+static void rline_call_update_hook (SLrline_Type *rli,
+				 SLFUTURE_CONST char *prompt,
+				 SLFUTURE_CONST char *buf,
+				 unsigned int len,
+				 unsigned int point, VOID_STAR cd)
+{
+ Rline_CB_Type *cb;
+
+ (void) rli; (void) len;
+ cb = (Rline_CB_Type *)cd;
+
+ if (-1 == SLang_start_arg_list ())
+ return;
+
+ if ((-1 == SLang_push_mmt (cb->mmt))
+ || (-1 == SLang_push_string (prompt))
+ || (-1 == SLang_push_string (buf))
+ || (-1 == SLang_push_int ((int) point))
+ || ((cb->cd != NULL) && (-1 == SLang_push_anytype (cb->cd))))
+ {
+	(void) SLang_end_arg_list ();
+	return;
+ }
+
+ (void) SLexecute_function (cb->update_hook);
+}
+
+static void free_rli_update_data_cb (SLrline_Type *rli, VOID_STAR cd)
+{
+ (void) rli;
+ if (cd != NULL)
+ free_cb_info ((Rline_CB_Type *)cd);
+}
+
+static void set_rline_update_hook (void)
+{
+ Rline_CB_Type *cb;
+ SLrline_Type *rli;
+
+ if (NULL == (cb = (Rline_CB_Type *)SLmalloc(sizeof(Rline_CB_Type))))
+ return;
+ memset ((char *)cb, 0, sizeof(Rline_CB_Type));
+
+ switch (SLang_Num_Function_Args)
+ {
+ default:
+	SLang_verror (SL_Usage_Error, "Usage: rline_set_update_hook (rli ,&hook ,clientdata);");
+	return;
+
+ case 3:
+	if (-1 == SLang_pop_anytype (&cb->cd))
+	 return;
+	/* drop */
+ case 2:
+	if (NULL == (cb->update_hook = SLang_pop_function ()))
+	 goto free_and_return;
+	/* drop */
+ case 1:
+	if (NULL == (cb->mmt = pop_sri_type (&cb->sri)))
+	 goto free_and_return;
+ }
+
+ cb->sri->output_newline = 0;
+ rli = cb->sri->rli;
+
+ SLrline_set_update_clear_cb (rli, rline_update_clear_cb);
+ SLrline_set_update_preread_cb (rli, rline_update_preread_cb);
+ SLrline_set_update_postread_cb (rli, rline_update_postread_cb);
+ SLrline_set_update_width_cb (rli, rline_update_width_cb);
+
+ if (0 == SLrline_set_update_hook (rli, rline_call_update_hook, (VOID_STAR)cb))
+ {
+	SLrline_set_free_update_cb (rli, free_rli_update_data_cb);
+	return;
+ }
+
+ /* drop */
+free_and_return:
+ free_cb_info (cb);
+}
+
+/* On stack: (rli, callback) */
+static int pop_set_rline_cb_args (SLang_MMT_Type **mmtp,
+				 Rline_CB_Type **cbp, SLang_Name_Type **ntp)
+{
+ SLang_Name_Type *nt;
+ Slsh_Readline_Type *sri;
+ SLang_MMT_Type *mmt;
+
+ if (SLang_peek_at_stack () == SLANG_NULL_TYPE)
+ nt = NULL;
+ else if (NULL == (nt = SLang_pop_function ()))
+ return -1;
+
+ if (NULL == (mmt = pop_sri_type (&sri)))
+ {
+	if (nt != NULL)
+	 SLang_free_function (nt);
+	return -1;
+ }
+ if (-1 == SLrline_get_update_client_data (sri->rli, (VOID_STAR *)cbp))
+ goto return_error;
+
+ if (*cbp == NULL)
+ {
+	SLang_verror (SL_Application_Error, "\
+Attempt to define an rline update callback without first creating a readline_update_hook");
+	goto return_error;
+ }
+
+ *mmtp = mmt;
+ *ntp = nt;
+ return 0;
+
+return_error:
+ SLang_free_mmt (mmt);
+ if (nt == NULL) SLang_free_function (nt);
+ return -1;
+}
+
+#define SET_RLINE_UPDATE_XXX_CB(fun, _xxx) \
+ static void fun (void) \
+ { \
+ SLang_MMT_Type *mmt; \
+ SLang_Name_Type *nt; \
+ Rline_CB_Type *cb; \
+ \
+ if (-1 == pop_set_rline_cb_args (&mmt, &cb, &nt)) \
+	return; \
+ SLang_free_function (cb->_xxx); \
+ cb->_xxx = nt; \
+ SLang_free_mmt (mmt); \
+ }
+
+SET_RLINE_UPDATE_XXX_CB (set_rline_update_clear_cb, clear_cb)
+SET_RLINE_UPDATE_XXX_CB (set_rline_update_preread_cb, preread_cb)
+SET_RLINE_UPDATE_XXX_CB (set_rline_update_postread_cb, postread_cb)
+SET_RLINE_UPDATE_XXX_CB (set_rline_update_width_cb, width_cb)
+#endif				 /* USE_SLANG_READLINE */
+
+static SLang_Intrin_Fun_Type Intrinsics =
+{
+ MAKE_INTRINSIC_0("__rline_init_tty", init_tty, VOID_TYPE),
+ MAKE_INTRINSIC_0("__rline_reset_tty", reset_tty, VOID_TYPE),
+ MAKE_INTRINSIC_S("slsh_readline_init", init_readline_intrinsic, VOID_TYPE),
+ MAKE_INTRINSIC_S("slsh_readline_new", new_slrline_intrinsic, VOID_TYPE),
+ MAKE_INTRINSIC_S("slsh_readline", readline_intrinsic, VOID_TYPE),
+ MAKE_INTRINSIC_S("slsh_readline_noecho", readline_noecho_intrinsic, VOID_TYPE),
+ MAKE_INTRINSIC_0("slsh_set_prompt_hook", set_prompt_hook, VOID_TYPE),
+ MAKE_INTRINSIC_0("slsh_get_prompt_hook", get_prompt_hook, VOID_TYPE),
+ MAKE_INTRINSIC_0("slsh_get_screen_size", get_screen_size, VOID_TYPE),
+#if USE_SLANG_READLINE
+ MAKE_INTRINSIC_0("slsh_set_readline_update_hook", set_rline_update_hook, VOID_TYPE),
+ MAKE_INTRINSIC_0("slsh_set_update_clear_cb", set_rline_update_clear_cb, VOID_TYPE),
+ MAKE_INTRINSIC_0("slsh_set_update_preread_cb", set_rline_update_preread_cb, VOID_TYPE),
+ MAKE_INTRINSIC_0("slsh_set_update_postread_cb", set_rline_update_postread_cb, VOID_TYPE),
+ MAKE_INTRINSIC_0("slsh_set_update_width_cb", set_rline_update_width_cb, VOID_TYPE),
+#endif
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static void destroy_rline (SLtype type, VOID_STAR f)
+{
+ (void) type;
+ close_slsh_readline ((Slsh_Readline_Type *) f);
+}
+
+static int register_rline_type (void)
+{
+ SLang_Class_Type *cl;
+
+ if (Rline_Type_Id != 0)
+ return 0;
+
+ if (NULL == (cl = SLclass_allocate_class ("RLine_Type")))
+ return -1;
+
+ if (-1 == SLclass_set_destroy_function (cl, destroy_rline))
+ return -1;
+
+ /* By registering as SLANG_VOID_TYPE, slang will dynamically allocate a
+ * type.
+ */
+ if (-1 == SLclass_register_class (cl, SLANG_VOID_TYPE, sizeof (Slsh_Readline_Type*), SLANG_CLASS_TYPE_MMT))
+ return -1;
+
+ Rline_Type_Id = SLclass_get_class_id (cl);
+
+ return 0;
+}
+
+int slsh_init_readline_intrinsics ()
+{
+ if (-1 == register_rline_type ())
+ return -1;
+
+ if (-1 == SLadd_intrin_fun_table (Intrinsics, NULL))
+ return -1;
+
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/scripts Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/scripts/badlinks Added

@@ -0,0 +1,110 @@
+#!/usr/bin/env slsh
+
+try
+{
+ require ("cmdopt");
+ require ("fswalk");
+}
+catch AnyError:
+{
+ () = fprintf (stderr, "error while evaluating\n%s\n", __get_exception_info.message);
+ exit (1);
+}
+
+private variable
+MAXDEPTH = NULL,
+ DIR_SEPARATOR = "/",
+ VERSION = "0.2",
+ LICENSE = "GNU GPL version 2 or later";
+
+#ifdef WIN32
+DIR_SEPARATOR = "\\";
+#endif
+
+private define print_version ()
+{
+ () = fprintf (stdout, "%s (version %s)\nLicense: %s\n", path_basename (__argv0),
+		 VERSION, LICENSE);
+ exit (0);
+}
+
+private define print_usage ()
+{
+ variable
+ if_opt_err = _NARGS ? () : "",
+ msg = 
+	 _NARGS ? sprintf (" OPTION ERROR\n%s\n", if_opt_err) : "",
+	 "Description:",
+	 " Search for dangling symbolic links in the filesystem",
+	 "",
+	 sprintf ("Usage:\n %s options dir dir...\n", path_basename (__argv0)),
+	 "Options:",
+	 " --maxdepth=depth descend to 'depth' level into the directory hierarchy",
+	 " -h, --help print this message",
+	 " --version print version and license",
+	 "",
+	 "If no `dir' is specified in the command line arguments `dir' defaults to the",
+	 "current directory.",
+	 "",
+	 "If no `--maxdepth' is specified then the script \"walks\" into the directory",
+	 "hierarchy, untill no other directories have to be proceed.",
+	 "",
+	 "If `--maxdepth=0' is specified then the search for dangling links is done",
+	 "only to the top level directory.",
+	 ;
+
+ () = array_map (Integer_Type, &fprintf, _NARGS ? stderr : stdout, "%s\n",
+		 _NARGS ? msg : msg1:);
+
+ exit (_NARGS);
+}
+
+private define file_callback (file, st)
+{
+ if (stat_is ("lnk", st.st_mode))
+ if ((NULL == stat_file (file)) && (errno == ENOENT))
+ {
+	 () = fprintf (stdout, "\e31mBroken link found: %s %s\em\n", file,
+			errno_string (errno));
+#ifexists readlink
+	 () = fprintf (stdout, "\e33m%s: points to %s\em\n", file, readlink (file));
+#endif
+ }
+ return 1;
+}
+
+private define dir_callback (dir, st)
+{
+ if (length (strtok (dir, DIR_SEPARATOR)) > MAXDEPTH)
+ return 0;
+
+ return 1;
+}
+
+private define get_badlinks (dir, maxdepth)
+{
+ ifnot (NULL == maxdepth)
+ MAXDEPTH = length (strtok (dir, DIR_SEPARATOR)) + maxdepth;
+ variable w = fswalk_new (NULL == MAXDEPTH ? NULL : &dir_callback, &file_callback);
+ w.walk (dir);
+}
+
+define slsh_main ()
+{
+ variable
+ i,
+ dir,
+ maxdepth = NULL,
+ c = cmdopt_new (&print_usage);
+
+ c.add("maxdepth", &maxdepth;type = "int");
+ c.add("h|help", &print_usage);
+ c.add("version", &print_version);
+
+ i = c.process (__argv, 1);
+
+ dir = (i < __argc) ? __argvi: : ".";
+ array_map (Void_Type, &get_badlinks, dir, maxdepth);
+
+ exit (0);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/scripts/htmlstrip Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/scripts/jpegsize Added

@@ -0,0 +1,133 @@
+#!/usr/bin/env slsh
+
+% This script prints the width and height of one or more jpeg image files.
+if (__argc < 2)
+{
+ () = fprintf (stderr, "Usage: %s files....\n", path_basename (__argv0));
+ exit (1);
+}
+
+private variable M_SOF0	= 0xC0;	 %/* Start Of Frame N */
+private variable M_SOF1	= 0xC1;	 %/* N indicates which compression process */
+private variable M_SOF2	= 0xC2;	 %/* Only SOF0-SOF2 are now in common use */
+private variable M_SOF3	= 0xC3;	 %
+private variable M_SOF5	= 0xC5;	 %/* NB: codes C4 and CC are NOT SOF markers */
+private variable M_SOF6	= 0xC6;	 %
+private variable M_SOF7	= 0xC7;	 %
+private variable M_SOF9	= 0xC9;	 %
+private variable M_SOF10	= 0xCA;	 %
+private variable M_SOF11	= 0xCB;	 %
+private variable M_SOF13	= 0xCD;	 %
+private variable M_SOF14	= 0xCE;	 %
+private variable M_SOF15	= 0xCF;	 %
+private variable M_SOI	= 0xD8;	 %/* Start Of Image (beginning of datastream) */
+private variable M_EOI	= 0xD9;	 %/* End Of Image (end of datastream) */
+private variable M_SOI	= 0xD8;	 % Start Of Image (beginning of datastream)
+
+private define read_nbytes (fp, n)
+{
+ variable b;
+ if (n != fread_bytes (&b, n, fp))
+ throw ReadError, "Failed to read $n bytes"$;
+ return b;
+}
+
+private define read_ushort (fp)
+{
+ return unpack (">H", read_nbytes (fp, 2));
+}
+
+private define open_jpg_file_for_read (file)
+{
+ variable fp = fopen (file, "rb");
+ variable b = read_nbytes (fp, 2);
+ if ((b0 != 0xFF) or (b1 != M_SOI))
+ return NULL;
+ return fp;
+}
+
+private define next_marker (fp)
+{
+ variable c = read_nbytes (fp, 1);
+ while (c != 0xFF)
+ c = read_nbytes (fp, 1);
+
+ % Remove pad bytes
+ do
+ c = read_nbytes (fp, 1);
+ while (c == 0xFF);
+
+ return c;
+}
+
+private define skip_variable (fp)
+{
+ variable len = read_ushort (fp);
+ if (len < 2)
+ throw DataError, "Erroneous JPEG marker length";
+ len -= 2;
+
+ while (len > 512)
+ {
+	() = read_nbytes (fp, 512);
+	len -= 512;
+ }
+ () = read_nbytes (fp, len);
+}
+
+public define jpeg_size (file, width, height)
+{
+ variable fp = open_jpg_file_for_read (file);
+ if (fp == NULL)
+ return -1;
+
+ variable is_sof = UChar_Type256;
+ is_sofM_SOF0 = 1;
+ is_sofM_SOF1 = 1;
+ is_sofM_SOF2 = 1;
+ is_sofM_SOF3 = 1;
+ is_sofM_SOF5 = 1;
+ is_sofM_SOF6 = 1;
+ is_sofM_SOF7 = 1;
+ is_sofM_SOF9 = 1;
+ is_sofM_SOF10 = 1;
+ is_sofM_SOF11 = 1;
+ is_sofM_SOF13 = 1;
+ is_sofM_SOF15 = 1;
+
+ while (0 == is_sofnext_marker(fp))
+ {
+	skip_variable (fp);
+ }
+
+ variable len = read_ushort (fp);
+ variable data_precision = read_nbytes (fp, 1);
+ variable h = read_ushort (fp);
+ variable w = read_ushort (fp);
+
+ @width = w;
+ @height = h;
+ return 0;
+}
+
+private define main ()
+{
+ variable file;
+ foreach file (__argv1:)
+ {
+	try
+	 {
+	 variable width, height;
+	 if (-1 == jpeg_size (file, &width, &height))
+	 {
+		 () = fprintf (stderr, "%s is not a jpeg file\n", file);
+		 continue;
+	 }
+	 () = fprintf (stdout, "%s: %ux%u\n", file, width, height);
+	 }
+	catch ReadError, DataError:
+	() = fprintf (stderr, "Caught error processing %s ...skipped\n", file);
+ }
+ exit (0);
+}
+main ();

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/scripts/ls Added

@@ -0,0 +1,322 @@
+#!/usr/bin/env slsh
+%_debug_info = 1;
+% A simple ls designed primarily for windows.
+
+private variable Months =
+ "Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep",
+ "Oct", "Nov", "Dec";
+
+private variable Six_Months_Ago = _time () - 3600*24*30*6;
+
+private define ls_long (this_dir, file_list, st_list)
+{
+ _for (0, length(file_list)-1, 1)
+ {
+	variable i = ();
+	variable file = file_listi;
+	variable st = st_listi;
+
+	variable size, mode, owner, group, symlink, mtime;
+	variable mstring;
+	variable tm;
+
+	size = st.st_size;
+	mtime = st.st_mtime;
+	mode = st.st_mode;
+	owner = st.st_uid;
+	group = st.st_gid;
+#ifdef WIN32
+	variable attrs = st.st_opt_attrs;
+#endif
+	tm = localtime (mtime);
+#ifdef WIN32
+	if (tm == NULL)
+	 mtime = "Jan 01 1980";
+	else
+#endif
+	if (mtime < Six_Months_Ago)
+	 mtime = sprintf ("%s %2d %4d",
+			 Monthstm.tm_mon,
+			 tm.tm_mday,
+			 1900 + tm.tm_year);
+	else
+	 mtime = sprintf ("%s %2d %2d:%02d",
+			 Monthstm.tm_mon,
+			 tm.tm_mday,
+			 tm.tm_hour,
+			 tm.tm_min);
+
+	symlink = "";
+#ifexists readlink
+	if (stat_is ("lnk", mode))
+	 {
+	 symlink = readlink (path_concat (this_dir, file));
+	 if (symlink == NULL)
+	 symlink = "??";
+
+	 symlink = " -> " + symlink;
+	 }
+#endif
+#ifdef WIN32
+	mstring = stat_mode_to_string (mode, attrs);
+#else
+	mstring = stat_mode_to_string (mode);
+#endif
+	() = fprintf (stdout,
+		 "%8s %8S %8S %10S %s %s%s\n",
+		 mstring, owner, group, size, mtime, file, symlink);
+ }
+}
+
+private variable
+ Use_Long_Form = 0,
+ Use_atime = 0,
+ Sort_By_Time = 0,
+ Sort_By_Size = 0,
+ Use_a_Option = 0,
+ Use_F_Option = 1,
+ Use_R_Option = 0,
+ Use_d_Option = 0;
+
+private define parse_args (args)
+{
+ variable ch;
+
+ foreach (args)
+ {
+	ch = ();
+	switch (ch)
+	 { case 'l': Use_Long_Form = 1; }
+	 { case 'u': Use_atime = 1; }
+	 { case 't': Sort_By_Time = 1; }
+	 { case 'S': Sort_By_Size = 1; }
+	 { case 'd': Use_d_Option = 1; }
+	 { case 'a': Use_a_Option = 1; }
+	 { case 'R': Use_R_Option = 1; }
+	 { case '-':}		 % ignore it
+	 {
+	 () = fprintf (stderr, "Option '%c' not supported.\n", ch);
+	 }
+ }
+}
+
+define ls_short (dirs)
+{
+ variable max_len;
+ variable ncols;
+ variable num, num_per_row, num_rows;
+ variable stride;
+
+ num = length (dirs);
+ max_len = 0;
+ foreach (dirs)
+ {
+	variable dir;
+
+	dir = ();
+	if (strlen (dir) > max_len)
+	 max_len = strlen (dir);
+ }
+
+ max_len += 2;
+
+ variable format = "%-" + string (max_len) + "s";
+
+ ncols = 80;
+ num_per_row = ncols / max_len;
+ if (num_per_row == 0)
+ num_per_row = 1;
+
+ num_rows = (num + num_per_row - 1) / num_per_row;
+ _for (0, num_rows-1, 1)
+ {
+	variable r = ();
+	_for (0, num_per_row-1, 1)
+	 {
+	 variable c = ();
+	 variable i = r + num_rows * c;
+
+	 if (i < num)
+	 {
+		 if (c + 1 < num_per_row)
+		 () = fprintf (stdout, format, dirsi);
+		 else
+		 () = fputs (dirsi, stdout);
+	 }
+	 }
+	() = fputs ("\n", stdout);
+ }
+}
+
+private define size_sort (a, b)
+{
+ b.st_size - a.st_size;
+}
+
+private define time_sort (a, b)
+{
+ b.st_mtime - a.st_mtime;
+}
+
+private define is_non_null_fun (a)
+{
+ a != NULL;
+}
+
+define sort_files (dirs, sts)
+{
+ variable st, i, non_null;
+
+ % Some of the sts structs may be NULL. Get rid of those
+ non_null = array_map (Char_Type, &is_non_null_fun, sts);
+
+ i = where (non_null);
+ dirs = dirs i;
+ sts = sts i;
+
+ if (Use_atime)
+ {
+	foreach (sts)
+	 {
+	 st = ();
+	 st.st_mtime = st.st_atime;
+	 }
+ }
+
+ if (Sort_By_Time)
+ i = array_sort (sts, &time_sort);
+ else if (Sort_By_Size)
+ i = array_sort (sts, &size_sort);
+ else
+ i = array_sort (dirs);
+
+ return dirsi, stsi;
+}
+
+private define isdir_fun (st)
+{
+ stat_is ("dir", st.st_mode);
+}
+
+private define list_dir (dir)
+{
+#ifndef UNIX
+ if (Use_a_Option)
+ listdir (dir, "");
+ else
+#endif
+ listdir (dir);
+}
+
+define do_ls ();
+define do_ls (dirs, this_dir, recurse, prune_hidden)
+{
+ variable i, len, st, sts, dir;
+
+ if (dirs == NULL)
+ return;
+
+ len = length(dirs);
+ sts = Struct_Type len;
+
+ _for (0, len-1, 1)
+ {
+	i = ();
+	dir = dirsi;
+
+	if (prune_hidden)
+	 {
+	 if ((dir0 == '.') and (Use_a_Option == 0))
+	 {
+		 !if (is_substr (dir, "\\"))
+		 continue;
+	 }
+	 }
+
+	st = lstat_file (path_concat (this_dir, dir));
+	if (st == NULL)
+	 () = fprintf (stderr, "%s: %s: %s\n",
+			__argv0,
+			path_concat (this_dir, dir),
+			errno_string (errno));
+	else
+	 stsi = st;
+ }
+
+ (dirs, sts) = sort_files (dirs, sts);
+
+ variable isdir;
+
+ if (length (sts)) isdir = array_map (Char_Type, &isdir_fun, sts);
+ else isdir = Int_Type0;
+
+ variable i_reg = where (isdir == 0);
+ variable i_dir = where (isdir);
+ variable dont_recurse;
+
+ if (Use_F_Option and length (i_dir))
+ dirsi_dir = array_map (String_Type, &path_concat, dirsi_dir, "");
+
+ dont_recurse = (Use_d_Option or not recurse);
+
+ if (dont_recurse)
+ {
+	if (Use_Long_Form)
+	 ls_long (this_dir, dirs, sts);
+	else
+	 ls_short (dirs);
+	return;
+ }
+
+ if (Use_Long_Form)
+ ls_long (this_dir, dirsi_reg, stsi_reg);
+ else
+ ls_short (dirsi_reg);
+
+ if (length(i_dir) == 1)
+ {
+	if (length (i_reg) == 0)
+	 {
+	 dir = dirsi_dir0;
+
+	 do_ls (list_dir (dir), dir, Use_R_Option, 1);
+	 return;
+	 }
+	() = fputs ("\n", stdout);
+ }
+
+ foreach (dirsi_dir)
+ {
+	dir = ();
+	dir = path_concat (this_dir, dir);
+	() = fprintf (stdout, "%s:\n", dir);
+	do_ls (list_dir (dir), dir, Use_R_Option, 1);
+	() = fprintf (stdout, "\n");
+ }
+}
+
+define main (argc, argv)
+{
+ variable dirs;
+
+ if (argc == 1)
+ return do_ls (list_dir("."), ".", 0, 1);
+ else if (__argv10 == '-')
+ {
+	parse_args (__argv1);
+
+	if (Use_d_Option and Use_R_Option)
+	 Use_R_Option = 0;
+
+	if (__argc > 2)
+	 dirs = __argv2:;
+	else
+	 return do_ls (list_dir("."), ".", Use_R_Option, 1);
+ }
+ else
+ dirs = __argv1:;
+
+ do_ls (dirs, ".", 1, 0);
+}
+
+main (__argc, __argv);

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/scripts/lsrpm Added

@@ -0,0 +1,83 @@
+#! /usr/bin/env slsh
+% Generate a listing of an RPM file
+
+private define pgm_usage ()
+{
+ vmessage ("Usage: lsrpm FILENAME");
+ exit (1);
+}
+
+private variable RPM_Command = "rpm -q -l --dump -p ";
+
+private define exit_error (msg)
+{
+ () = fprintf (stderr, "%s\n", msg);
+ exit (1);
+}
+
+private define run_rpm (file)
+{
+ variable fp;
+ variable lines;
+ variable months =
+ "Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep",
+ "Oct", "Nov", "Dec";
+ variable s;
+
+ fp = popen (RPM_Command + file, "r");
+ if (fp == NULL)
+ exit_error ("Failed to open RPM process");
+
+ % each line contains:
+ % path size mtime md5sum mode owner group isconfig isdoc rdev symlink
+
+ variable six_months_ago = _time () - 3600*24*30*6;
+
+ foreach (fp)
+ {
+	variable path, size, mode, owner, group, symlink, mtime;
+	variable mstring;
+	variable tm;
+
+	s = ();
+	s = strchop (strtrim_end (s, "\n"), ' ', 0);
+
+	path = s0;
+	size = s1;
+	mtime = integer (s2);
+	mode = integer (s4);
+	owner = s5;
+	group = s6;
+
+	tm = localtime (mtime);
+	if (mtime < six_months_ago)
+	 mtime = sprintf ("%s %2d %4d",
+			 monthstm.tm_mon,
+			 tm.tm_mday,
+			 1900 + tm.tm_year);
+	else
+	 mtime = sprintf ("%s %2d % 2d:%02d",
+			 monthstm.tm_mon,
+			 tm.tm_mday,
+			 tm.tm_hour,
+			 tm.tm_min);
+
+	symlink = "";
+	if (stat_is ("lnk", mode))
+	 symlink = " -> " + s10;
+
+	mstring = stat_mode_to_string (mode);
+
+	if (-1 == fprintf (stdout,
+			 "%8s %8s %8s %10s %s %s%s\n",
+			 mstring, owner, group, size, mtime, path, symlink))
+	 exit_error (sprintf ("Write failed: %s", errno_string (errno)));
+ }
+ () = pclose (fp);
+}
+
+if (__argc != 2)
+ pgm_usage ();
+
+run_rpm (__argv1);
+exit (0);

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/scripts/mv Added

@@ -0,0 +1,157 @@
+#!/usr/bin/env slsh
+% -*- slang -*-
+
+require ("cmdopt");
+private variable Script_Version_String = "0.1.0";
+
+private variable
+ Confirm_Move = 0,
+ Verbose = 0,
+ Force = 0,
+ NoClobber = 0;
+
+private define exit_version ()
+{
+ () = fprintf (stdout, "Version: %S\n", Script_Version_String);
+ exit (0);
+}
+
+private define exit_usage ()
+{
+ variable fp = stderr;
+ () = fprintf (fp, "Usage: %s options files... dir\n", __argv0);
+ () = fprintf (fp, "Usage: %s options file1 file2\n", __argv0);
+ variable opts =
+ 
+ "Options:\n",
+ " -i Prompt before overwrite\n",
+ " -f Do not prompt before overwriting \n",
+ " -n Do not clobber\n",
+ " -v Be verbose \n",
+ " --version Show version\n",
+ " -h|--help Show this message\n",
+ ;
+ foreach (opts)
+ {
+	variable opt = ();
+	() = fputs (opt, fp);
+ }
+ exit (1);
+}
+
+private define print_error ()
+{
+ variable args = __pop_list (_NARGS);
+ () = fprintf (stderr, "%s: ", __argv0);
+ () = fprintf (stderr, __push_list (args));
+}
+
+private define get_yn ()
+{
+ variable args = __pop_list (_NARGS);
+ () = fprintf (stdout, __push_list (args));
+ () = fflush (stdout);
+
+ variable yn;
+ if (fgets (&yn, stdin) <= 0)
+ return -1;
+
+ "y" == strlow (strtrim (yn));
+}
+
+private define move_file (from, to, st_to)
+{
+ variable st_from = stat_file (from);
+
+ if (st_from == NULL)
+ {
+	() = fprintf (stderr, "Unable to access %s\n", from);
+	return -1;
+ }
+
+ if ((from == to)
+ || ((st_to != NULL)
+	 && (st_from.st_ino == st_to.st_ino)
+	 && (st_from.st_dev == st_to.st_dev)))
+ {
+	print_error ("Cannot move a file to itself\n");
+	return -1;
+ }
+
+ if (st_to != NULL)
+ {
+	if (NoClobber)
+	 {
+	 ()= fprintf(stderr, "Move %s to %s aborted because of noclobber\n",
+			 from, to);
+	 return -1;
+	 }
+
+	if (Confirm_Move
+	 && (1 != get_yn ("%s exists. Overwrite? y/n", to)))
+	 {
+	 () = fputs ("Not Confirmed\n", stdout);
+	 return -1;
+	 }
+ }
+
+ if (0 == rename (from, to))
+ {
+	if (Verbose)
+	 ()= fprintf (stdout, "`%s' -> `%s'\n", from, to);
+	return 0;
+ }
+
+ ()=fprintf (stderr, "Failed to rename %s to %s: %s\n",
+	 from, to, errno_string (errno));
+
+ return -1;
+}
+
+private define move_files (from_files, to)
+{
+ variable num_from = length (from_files);
+ variable st = stat_file (to);
+
+ if ((st == NULL) || (0 == stat_is ("dir", st.st_mode)))
+ {
+	if (num_from != 1)
+	 {
+	 () = fprintf (stderr, "target `%s' is not a directory\n", to);
+	 exit (1);
+	 }
+
+	if (-1 == move_file (from_files0, to, st))
+	 exit (1);
+
+	exit (0);
+ }
+
+ foreach (from_files)
+ {
+	variable old = ();
+	variable new = path_concat (to, path_basename (old));
+	() = move_file (old, new, stat_file (new));
+ }
+}
+
+define slsh_main ()
+{
+ variable c = cmdopt_new ();
+ c.add("h|help", &exit_usage);
+ c.add("version", &exit_version);
+ c.add("i", &Confirm_Move);
+ c.add("f", &Force);
+ c.add("n", &NoClobber);
+ c.add("v", &Verbose);
+ variable i = c.process (__argv, 1);
+
+ if (i + 2 > __argc)
+ exit_usage ();
+
+ if (Confirm_Move && Force)
+ Confirm_Move = 0;
+
+ move_files (__argvi:__argc-2, __argv-1);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/scripts/purge Added

@@ -0,0 +1,65 @@
+#! /usr/bin/env slsh
+% -*- mode: slang -*-
+_debug_info = 1;
+
+private define purge_file (file, age, print_option)
+{
+ variable st = stat_file (file);
+ if (st == NULL)
+ {
+	() = fprintf (stderr, "stat %s failed: %s\n", file, errno_string (errno));
+	return;
+ }
+
+ if (st.st_ctime >= age)
+ return;
+
+ if (print_option)
+ {
+	() = fprintf (stdout, "%s\n", file);
+	return;
+ }
+
+ if (-1 == remove (file))
+ () = fprintf (stderr, "remove %s failed: %s\n", file, errno_string (errno));
+}
+
+private define purge_usage ()
+{
+ () = fprintf (stderr, "Usage: %s -n NUM-DAYS-OLD files...\n", __argv0);
+ () = fprintf (stderr, " Files older than NUM-DAYS-OLD be deleted.\n");
+ () = fprintf (stderr, " -n ==> Just print the files to be removed but do not remove them.\n");
+ exit (1);
+}
+
+private define main (argc, argv)
+{
+ variable age, i, print_option, file;
+
+ if (argc < 3) purge_usage ();
+
+ i = 2;
+ print_option = 0;
+ if (argv1 == "-n")
+ {
+	i++;
+	print_option = 1;
+	if (argc < 4)
+	 purge_usage ();
+ }
+
+ age = __argvi-1;
+ if (String_Type == _slang_guess_type (age))
+ purge_usage ();
+
+ age = _time() - atof(age) * 24 * 3600;
+
+ foreach (argvi:)
+ {
+	file = ();
+	purge_file (file, age, print_option);
+ }
+ exit (0);
+}
+
+main (__argc, __argv);

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/scripts/sldb Added

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/scripts/slprof Added

@@ -0,0 +1,148 @@
+#!/usr/bin/env slsh
+require ("profile");
+require ("cmdopt");
+
+private variable Version = "0.2.2-0";
+private variable Profile_Fp;
+
+private define _slprof_version ()
+{
+ () = fprintf (stderr, "slprof version %s; S-Lang version: %s\n",
+		 Version, _slang_version_string);
+}
+
+private define _slprof_usage ()
+{
+ variable fp = stderr;
+ () = fprintf (fp, "Usage: %s options script args...\n", path_basename (__argv0));
+ () = fprintf (fp, "Options:\n");
+ variable opts =
+ 
+ " -c|--calibrate <N> Calibrate using N repetitions default:1000, 0=off\n",
+ " -f|--func <function> Name of Function to call default: slsh_main\n",
+ " -l|--lines Profile lines, not just functions\n",
+ " -o|--output <file> Name of output file default: <script>.slprof\n",
+ " -v|--version Print version information\n",
+ " -h|--help Print this message\n"
+ ;
+ variable opt;
+ foreach opt (opts)
+ () = fputs (opt, fp);
+ exit (1);
+}
+
+private define _slprof_cmdopt_error (msg)
+{
+ () = fprintf (stderr, "%s\n", msg);
+ _slprof_usage ();
+}
+
+private define _slprof_write_profile ()
+{
+ profile_report (Profile_Fp);
+ () = fclose (Profile_Fp);
+}
+
+private define _slprof_calibrate (n)
+{
+ if (n == 0)
+ return;
+ () = fprintf (stdout, "Calibrating profiler..."); ()=fflush (stdout);
+ profile_calibrate (n);
+ () = fprintf (stdout, "Done\n");
+}
+
+private define _slprof_main ()
+{
+ variable output = NULL;
+ variable func = "slsh_main";
+ variable line_by_line = 0;
+ variable cal_n = 1000;
+
+ variable opts = cmdopt_new (&_slprof_cmdopt_error);
+ opts.add("c|calibrate", &cal_n; type="int");
+ opts.add("f|funct", &func; type="string");
+ opts.add("l|lines", &line_by_line);
+ opts.add("o|output",&output; type="string");
+ opts.add("v|version", &_slprof_version),
+ opts.add("h|help", &_slprof_usage);
+ variable i = opts.process (__argv, 1);
+
+ if (cal_n < 0) cal_n = 0;
+ if (func == "")
+ _slprof_usage ();
+
+ if (i >= __argc)
+ _slprof_usage ();
+
+ variable main = strtok (func, " \t(;")0;
+ variable main_args = strtrim (substrbytes (func, 1+strlen(main), -1));
+
+ variable depth = _stkdepth();
+ try
+ {
+	if (strlen (main)) eval (main_args);
+ }
+ catch AnyError:
+ {
+	() = fprintf (stderr, "Error parsing args of %s\n", func);
+	exit (1);
+ }
+ main_args = __pop_args (_stkdepth ()-depth);
+
+ variable script = __argvi;
+
+ if (not path_is_absolute (script))
+ script = path_concat (getcwd (), script);
+
+ variable st = stat_file (script);
+ if (st == NULL)
+ {
+	() = fprintf (stderr, "Unable to stat %s -- did you specify its path?\n", script);
+	exit (1);
+ }
+
+ if (not stat_is ("reg", st.st_mode))
+ () = fprintf (stderr, "*** Warning %s is not a regular file\n", script);
+
+ if (output == NULL)
+ output = strcat (path_basename_sans_extname (script), ".slprof");
+
+ variable fp = fopen (output, "w");
+ if (fp == NULL)
+ {
+	() = fprintf (stderr, "Unable to profiler output file %s\n");
+	exit (1);
+ }
+ () = fprintf (fp, "# slprof profile report for:\n");
+ () = fprintf (fp, "# %S\n\n", strjoin (__argv, " "));
+ Profile_Fp = fp;
+
+ variable has_at_exit = 0;
+#ifexists atexit
+ atexit (&_slprof_write_profile);
+ has_at_exit = 1;
+#endif
+
+ __set_argc_argv (__argvi:);
+
+ % Actual profiling starts here
+
+ _slprof_calibrate (cal_n);
+ profile_begin (line_by_line);
+ () = evalfile (script);
+
+ variable ref = __get_reference (main);
+ if (ref != NULL)
+ (@ref) (__push_args (main_args));
+ else if (main != "slsh_main")
+ () = fprintf (stderr, "*** Warning: %s is not defined\n", main);
+
+ profile_end ();
+
+ if (has_at_exit == 0)
+ _slprof_write_profile ();
+}
+
+_slprof_main ();
+exit (0);

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/scripts/slstkchk Added

@@ -0,0 +1,119 @@
+#!/usr/bin/env slsh
+require ("cmdopt");
+require ("stkcheck");
+
+private variable Version = "0.1.0-0";
+private variable Output_Fp;
+
+private define _slstkchk_version ()
+{
+ () = fprintf (stderr, "slstkchk version %s; S-Lang version: %s\n",
+		 Version, _slang_version_string);
+}
+
+private define _slstkchk_usage ()
+{
+ variable fp = stderr;
+ () = fprintf (fp, "Usage: %s options script args...\n", path_basename (__argv0));
+ () = fprintf (fp, "Options:\n");
+ variable opts =
+ 
+ " -f|--func <function> Name of Function to call default: slsh_main\n",
+ " -o|--output <file> Name of output file default: write to stderr\n",
+ " -v|--version Print version information\n",
+ " -h|--help Print this message\n"
+ ;
+ variable opt;
+ foreach opt (opts)
+ () = fputs (opt, fp);
+ exit (1);
+}
+
+private define _slstkchk_cmdopt_error (msg)
+{
+ () = fprintf (stderr, "%s\n", msg);
+ _slstkchk_usage ();
+}
+
+private define _slstkchk_output_hook (fp, str)
+{
+ () = fputs (str, fp);
+}
+
+private define _slstkchk_main ()
+{
+ variable output = NULL;
+ variable func = "slsh_main";
+
+ variable opts = cmdopt_new (&_slstkchk_cmdopt_error);
+ opts.add("f|funct", &func; type="string");
+ opts.add("o|output",&output; type="string");
+ opts.add("v|version", &_slstkchk_version),
+ opts.add("h|help", &_slstkchk_usage);
+ variable i = opts.process (__argv, 1);
+
+ if (func == "")
+ _slstkchk_usage ();
+
+ if (i >= __argc)
+ _slstkchk_usage ();
+
+ variable main = strtok (func, " \t(;")0;
+ variable main_args = strtrim (substrbytes (func, 1+strlen(main), -1));
+
+ variable depth = _stkdepth();
+ try
+ {
+	if (strlen (main)) eval (main_args);
+ }
+ catch AnyError:
+ {
+	() = fprintf (stderr, "Error parsing args of %s\n", func);
+	exit (1);
+ }
+ main_args = __pop_list (_stkdepth ()-depth);
+
+ variable script = __argvi;
+
+ if (not path_is_absolute (script))
+ script = path_concat (getcwd (), script);
+
+ variable st = stat_file (script);
+ if (st == NULL)
+ {
+	() = fprintf (stderr, "Unable to stat %s -- did you specify its path?\n", script);
+	exit (1);
+ }
+
+ if (not stat_is ("reg", st.st_mode))
+ () = fprintf (stderr, "*** Warning %s is not a regular file\n", script);
+
+ variable fp = NULL;
+ if (output != NULL)
+ {
+	fp = fopen (output, "w");
+	if (fp == NULL)
+	 {
+	 () = fprintf (stderr, "Unable to open output file %s\n");
+	 exit (1);
+	 }
+	stkcheck_set_output_hook (&_slstkchk_output_hook, fp);
+ }
+
+ __set_argc_argv (__argvi:);
+
+ enable_stack_check ();
+ () = evalfile (script);
+
+ variable ref = __get_reference (main);
+ if (ref != NULL)
+ (@ref) (__push_list (main_args));
+ else if (main != "slsh_main")
+ () = fprintf (stderr, "*** Warning: %s is not defined\n", main);
+
+ if (fp != NULL)
+ () = fclose (fp);
+}
+
+_slstkchk_main ();
+exit (0);

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/scripts/svnsh Added

@@ -0,0 +1,337 @@
+#!/usr/bin/env slsh
+% This is a simple shell that allows one to interact with an SVN repository
+% in a shell-like manner.
+%
+% The location of the repository may be specified either on the
+% command line or via the SVN_REPOS environment variable, e.g.,
+%
+% svnsh $HOME/var/svn/repos
+%
+% Use it at your own risk!
+%
+
+private variable SVNSH_VERSION = "0.1.0-1";
+
+private variable Repository;
+private variable Repository_CWD;
+private variable Echo_Commands = 0;
+
+private variable Rline;
+
+new_exception ("SVNError", AnyError, "svn error");
+
+private define expand_path (path)
+{
+ variable dir = Repository_CWD;
+
+ if (path0 == '/')
+ dir = Repository;
+
+ foreach (strtok (path, "/"))
+ {
+	variable sdir = ();
+	if (sdir == "..")
+	 {
+	 if (dir == Repository)
+	 {
+		 vmessage ("Can't go up");
+		 return NULL;
+	 }
+	 dir = path_dirname (dir);
+	 continue;
+	 }
+	if (sdir == ".")
+	 continue;
+
+	dir = strcat (dir, "/", sdir);
+ }
+ return dir;
+}
+
+private define _svn_execute ()
+{
+ variable args = __pop_args (_NARGS);
+ variable cmd = "svn " + sprintf (__push_args(args));
+ if (Echo_Commands)
+ () = fprintf (stdout, "%s\n", cmd);
+ variable status = system (cmd);
+ if (status != 0)
+ throw SVNError, sprintf ("%s returned %d", cmd, status);
+}
+
+private define _svn_path_exists (path)
+{
+ if (path == NULL)
+ return 0;
+ try
+ {
+	_svn_execute ("ls %s >/dev/null 2>&1", path);
+ }
+ catch SVNError: return 0;
+ return 1;
+}
+
+private define _svn_cd (argv)
+{
+ variable dir = expand_path (argv0);
+ if (0 == _svn_path_exists (dir))
+ {
+	vmessage ("%s does not exist", dir);
+	return;
+ }
+ Repository_CWD = dir;
+}
+
+private define get_opts (argv)
+{
+ variable i;
+ variable opts = "";
+ variable args = String_Type0;
+ variable n = length (argv);
+ i = 0;
+ while (i < n)
+ {
+	variable arg = argvi;
+	if (arg0 == '-')
+	 {
+	 if (arg == "-nc")
+	 {
+		 arg = "-m \"\"";
+	 }
+	 opts = strcat (opts, " ", arg);
+	 i++;
+	 continue;
+	 }
+	args = argvi:;
+	break;
+ }
+
+ return opts, args;
+}
+
+private define _svn_cp (argv)
+{
+ variable opts, files;
+
+ (opts, files) = get_opts (argv);
+ if (length (files) != 2)
+ {
+	() = fprintf (stderr, "Usage: cp dir dir\n");
+	return;
+ }
+ variable from = expand_path (files0);
+ variable to = expand_path (files1);
+ if ((from == NULL) or (to == NULL))
+ return;
+ _svn_execute ("cp %s %s %s", opts, from, to);
+}
+
+private define _svn_ls (argv)
+{
+ variable opts, files;
+ (opts, files) = get_opts (argv);
+
+ if (opts == "-l")
+ opts = "-v";
+
+ if (length (files) == 0)
+ {
+	_svn_execute ("ls %s %s", opts, Repository_CWD);
+	return;
+ }
+
+ foreach (files)
+ {
+	variable file = ();
+	file = expand_path (file);
+	if (file == NULL)
+	 continue;
+
+	_svn_execute ("ls %s %s", opts, file);
+ }
+}
+
+private define _svn_mv (argv)
+{
+ variable opts, files;
+ (opts, files) = get_opts (argv);
+
+ if (length (files) != 2)
+ {
+	() = fprintf (stderr, "Usage: mv FROM TO\n");
+	return;
+ }
+
+ variable from = expand_path (files0);
+ variable to = expand_path (files1);
+
+ if ((from == NULL) or (to == NULL))
+ {
+	() = fprintf (stderr, "*** mv failed\n");
+	return;
+ }
+
+ _svn_execute ("mv %s %s %s", opts, from, to);
+}
+
+private define _svn_mkdir (argv)
+{
+ variable opts, files;
+
+ (opts, files) = get_opts (argv);
+ if (length (files) != 1)
+ {
+	() = fprintf (stderr, "Usage: mkdir DIR\n");
+	return;
+ }
+ variable dir = expand_path (files0);
+ if (dir == NULL)
+ return;
+ _svn_execute ("mkdir %s %s", opts, dir);
+}
+
+private define _svn_rm (argv)
+{
+ variable opts, files;
+
+ (opts, files) = get_opts (argv);
+ if (length (files) != 1)
+ {
+	() = fprintf (stderr, "Usage: rm file\n");
+	return;
+ }
+ variable dir = expand_path (files0);
+ if (dir == NULL)
+ return;
+ _svn_execute ("rm %s %s", opts, dir);
+}
+
+private define _svn_most (argv)
+{
+ if (length (argv) != 1)
+ {
+	() = fprintf (stderr, "Usage: most FILE\n");
+	return;
+ }
+ variable file = expand_path (argv0);
+ if (file == NULL)
+ return;
+ _svn_execute ("cat %s | most", file);
+}
+
+private define _svn_help (argv)
+{
+ _svn_execute ("help %s", strjoin (argv, " "));
+ () = fprintf (stdout, "\nAlso use ? for a list of interractive commands\n");
+}
+
+private define _svn_quit (argv)
+{
+ Rline = NULL;
+ exit (0);
+}
+
+private variable Cmd_Table = Assoc_Type Ref_Type;
+private define _svn_local_help (argv)
+{
+ () = fprintf (stdout, "Local commands:\n");
+ foreach (assoc_get_keys (Cmd_Table))
+ {
+	variable key = ();
+	() = fprintf (stdout, "%s\n", key);
+ }
+}
+
+Cmd_Table"ls" = &_svn_ls;
+Cmd_Table"cd" = &_svn_cd;
+Cmd_Table"cp" = &_svn_cp;
+Cmd_Table"help" = &_svn_help;
+Cmd_Table"mv" = &_svn_mv;
+Cmd_Table"mkdir" = &_svn_mkdir;
+Cmd_Table"rmdir" = &_svn_rm;
+Cmd_Table"rm" = &_svn_rm;
+Cmd_Table"most" = &_svn_most;
+Cmd_Table"quit" = &_svn_quit;
+Cmd_Table"?" = &_svn_local_help;
+
+private define take_input ()
+{
+ variable line;
+ forever
+ {
+	try
+	 {
+	 line = slsh_readline (Rline, sprintf ("%s> ", Repository_CWD));
+	 }
+	catch UserBreakError: continue;
+	if (line == NULL)
+	 break;
+
+	variable argv = strtok (line, " \t;\n");
+	if (length (argv) == 0)
+	 continue;
+
+	variable cmd = argv0;
+	if (length (argv) == 1)
+	 argv = String_Type0;
+	else
+	 argv = argv1:;
+
+	variable e;
+
+	try (e)
+	 {
+	 if (0 == assoc_key_exists (Cmd_Table, cmd))
+	 {
+		 () = fprintf (stderr, "%s not supported\n", cmd);
+		 continue;
+	 }
+	 (@Cmd_Tablecmd)(argv);
+	 }
+	catch AnyError:
+	 {
+	 () = fprintf (stderr, "%S:%d:%s *** Caught exception: %S\n",
+			 e.file, e.line, e.descr, e.message);
+	 }
+ }
+}
+
+public define svn_set_repository (repos)
+{
+ !if (_svn_path_exists (repos))
+ {
+	() = fprintf (stderr, "*** Repository %s does not exist\n", repos);
+	exit (1);
+ }
+ Repository = repos;
+ Repository_CWD = repos;
+}
+
+public define slsh_main ()
+{
+ variable repos;
+ if (__argc == 2)
+ repos = __argv1;
+ else
+ {
+	repos = getenv ("SVN_REPOS");
+	if (repos == NULL)
+	 {
+	 () = fprintf (stderr, "Usage: %s file://repository\n", __argv0);
+	 exit (1);
+	 }
+ }
+
+ () = fprintf (stdout, "svnsh version %s.\nUse this at your own risk!\n", SVNSH_VERSION);
+ () = fprintf (stdout, "Enter ? for a list of commands.\n");
+
+ !if (is_substr (repos, "://"))
+ repos = strcat ("file://", repos);
+
+ svn_set_repository (repos);
+
+ slsh_readline_init ("SVNSH");
+ Rline = slsh_readline_new ("svnsh");
+
+ take_input ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/slsh.c Added

@@ -0,0 +1,759 @@
+/*
+Copyright (C) 2005-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "config.h"
+#include <stdio.h>
+#include <stdlib.h>
+#ifdef __WIN32__
+# include <windows.h>
+# include <io.h>
+#endif
+
+#include <sys/stat.h>
+
+#ifdef HAVE_UNISTD_H
+# include <unistd.h>
+#endif
+#include <string.h>
+#include <signal.h>
+#include <slang.h>
+
+#ifdef SLSYSWRAP
+# include <slsyswrap.h>
+#endif
+
+static SLFUTURE_CONST char *Slsh_Version = "0.9.4-0";
+#define SLSHRC_FILE "slsh.rc"
+#include "slsh.h"
+
+#ifndef SLSH_CONF_DIR_ENV
+# define SLSH_CONF_DIR_ENV "SLSH_CONF_DIR"
+#endif
+
+#ifndef SLSH_PATH_ENV
+# define SLSH_PATH_ENV "SLSH_PATH"
+#endif
+
+#ifndef SLSH_LIB_DIR_ENV
+# define SLSH_LIB_DIR_ENV "SLSH_LIB_DIR"
+#endif
+
+#if defined(REAL_UNIX_SYSTEM) || defined(__APPLE__)
+/* # define DEFAULT_LIBRARY_PATH "/usr/local/share/slsh:/usr/local/lib/slsh:/usr/share/slsh:/usr/lib/slsh"; */
+/* # define DEFAULT_CONF_PATH "/usr/local/etc:/usr/local/etc/slsh:/etc:/etc/slsh"; */
+# define DEFAULT_CONF_PATH NULL
+# define USER_SLSHRC ".slshrc"
+#else
+# define DEFAULT_CONF_PATH NULL
+# define USER_SLSHRC "slsh.rc"
+#endif
+
+#ifdef __os2__
+# ifdef __IBMC__
+/* IBM VA3 doesn't declare S_IFMT */
+# define	S_IFMT	(S_IFDIR | S_IFCHR | S_IFREG)
+# endif
+#endif
+
+#ifndef S_ISLNK
+# ifdef S_IFLNK
+# define S_ISLNK(m) (((m) & S_IFMT) == S_IFLNK)
+# else
+# define S_ISLNK(m) 0
+# endif
+#endif
+
+#ifndef S_ISREG
+# ifdef S_IFREG
+# define S_ISREG(m) (((m) & S_IFMT) == S_IFREG)
+# else
+# define S_ISREG(m) 0
+# endif
+#endif
+
+#ifndef S_ISDIR
+# ifdef S_IFDIR
+# define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR)
+# else
+# define S_ISDIR(m) 0
+# endif
+#endif
+
+#ifndef S_ISCHR
+# ifdef S_IFCHR
+# define S_ISCHR(m) (((m) & S_IFMT) == S_IFCHR)
+# else
+# define S_ISCHR(m) 0
+# endif
+#endif
+
+#ifndef S_ISBLK
+# ifdef S_IFBLK
+# define S_ISBLK(m) (((m) & S_IFMT) == S_IFBLK)
+# else
+# define S_ISBLK(m) 0
+# endif
+#endif
+
+#ifndef S_ISFIFO
+# ifdef S_IFIFO
+# define S_ISFIFO(m) (((m) & S_IFMT) == S_IFIFO)
+# else
+# define S_ISFIFO(m) 0
+# endif
+#endif
+
+#ifndef S_ISSOCK
+# ifdef S_IFSOCK
+# define S_ISSOCK(m) (((m) & S_IFMT) == S_IFSOCK)
+# else
+# define S_ISSOCK(m) 0
+# endif
+#endif
+
+#ifndef S_IRUSR
+# define S_IRUSR	0400
+#endif
+#ifndef S_IWUSR
+# define S_IWUSR	0200
+#endif
+#ifndef S_IXUSR
+# define S_IXUSR	0100
+#endif
+#ifndef S_IRGRP
+# define S_IRGRP	0040
+#endif
+#ifndef S_IWGRP
+# define S_IWGRP	0020
+#endif
+#ifndef S_IXGRP
+# define S_IXGRP	0010
+#endif
+#ifndef S_IROTH
+# define S_IROTH	0004
+#endif
+#ifndef S_IWOTH
+# define S_IWOTH	0002
+#endif
+#ifndef S_IXOTH
+# define S_IXOTH	0001
+#endif
+#ifndef S_ISUID
+# define S_ISUID	04000
+#endif
+#ifndef S_ISGID
+# define S_ISGID	02000
+#endif
+#ifndef S_ISVTX
+# define S_ISVTX	01000
+#endif
+
+typedef struct _AtExit_Type
+{
+ SLang_Name_Type *nt;
+ struct _AtExit_Type *next;
+}
+AtExit_Type;
+
+static AtExit_Type *AtExit_Hooks;
+
+static void at_exit (SLang_Ref_Type *ref)
+{
+ SLang_Name_Type *nt;
+ AtExit_Type *a;
+
+ if (NULL == (nt = SLang_get_fun_from_ref (ref)))
+ return;
+
+ a = (AtExit_Type *) SLmalloc (sizeof (AtExit_Type));
+ if (a == NULL)
+ return;
+
+ a->nt = nt;
+ a->next = AtExit_Hooks;
+ AtExit_Hooks = a;
+}
+
+static void c_exit (int status)
+{
+ /* Clear the error to allow exit hooks to run */
+ if (SLang_get_error ())
+ SLang_restart (1);
+
+ while (AtExit_Hooks != NULL)
+ {
+	AtExit_Type *next = AtExit_Hooks->next;
+	if (SLang_get_error () == 0)
+	 (void) SLexecute_function (AtExit_Hooks->nt);
+
+	SLfree ((char *) AtExit_Hooks);
+	AtExit_Hooks = next;
+ }
+
+ SLang_restart (1);
+ exit (status);
+}
+
+static void exit_intrin (void)
+{
+ int status;
+
+ if (SLang_Num_Function_Args == 0)
+ status = 0;
+ else if (-1 == SLang_pop_int (&status))
+ return;
+
+ c_exit (status);
+}
+
+static void stat_mode_to_string (void)
+{
+ int mode, opts;
+ char mode_string12;
+
+ opts = 0;
+ if (SLang_Num_Function_Args == 2)
+ {
+	if (-1 == SLang_pop_integer (&opts))
+	 return;
+ }
+
+ if (-1 == SLang_pop_integer (&mode))
+ return;
+
+ if (S_ISREG(mode)) mode_string0 = '-';
+ else if (S_ISDIR(mode)) mode_string0 = 'd';
+ else if (S_ISLNK(mode)) mode_string0 = 'l';
+ else if (S_ISCHR(mode)) mode_string0 = 'c';
+ else if (S_ISFIFO(mode)) mode_string0 = 'p';
+ else if (S_ISSOCK(mode)) mode_string0 = 's';
+ else if (S_ISBLK(mode)) mode_string0 = 'b';
+
+ if (mode & S_IRUSR) mode_string1 = 'r'; else mode_string1 = '-';
+ if (mode & S_IWUSR) mode_string2 = 'w'; else mode_string2 = '-';
+ if (mode & S_IXUSR) mode_string3 = 'x'; else mode_string3 = '-';
+ if (mode & S_ISUID) mode_string3 = 's';
+
+#ifdef __WIN32__
+ mode_string4 = '-';
+ mode_string5 = '-';
+ mode_string6 = '-';
+
+ if (opts & FILE_ATTRIBUTE_ARCHIVE) mode_string7 = 'A'; else mode_string7 = '-';
+ if (opts & FILE_ATTRIBUTE_SYSTEM) mode_string8 = 'S'; else mode_string8 = '-';
+ if (opts & FILE_ATTRIBUTE_HIDDEN) mode_string9 = 'H'; else mode_string9 = '-';
+#else
+ if (mode & S_IRGRP) mode_string4 = 'r'; else mode_string4 = '-';
+ if (mode & S_IWGRP) mode_string5 = 'w'; else mode_string5 = '-';
+ if (mode & S_IXGRP) mode_string6 = 'x'; else mode_string6 = '-';
+ if (mode & S_ISGID) mode_string6 = 'g';
+
+ if (mode & S_IROTH) mode_string7 = 'r'; else mode_string7 = '-';
+ if (mode & S_IWOTH) mode_string8 = 'w'; else mode_string8 = '-';
+ if (mode & S_IXOTH) mode_string9 = 'x'; else mode_string9 = '-';
+ if (mode & S_ISVTX) mode_string9 = 't';
+#endif
+
+ mode_string10 = 0;
+ (void) SLang_push_string (mode_string);
+}
+
+/* Root/
+ * 	bin/
+ * 		slsh.exe
+ * 	slsh/
+ * 		slsh.rc
+ * 		autoload.sl
+ * 		( ... )
+ */
+static char *prepend_exec_root (const char *pgm, const char *suffix,
+				char *pathbuf, size_t size)
+{
+ char *p;
+ unsigned int len;
+ char pathsep;
+
+ len = strlen (suffix);
+ if (len >= size)
+ return (char *)suffix;
+
+#ifdef __WIN32__
+ if (0 == GetModuleFileName(NULL, pathbuf, size-len))
+ return suffix;
+ pathsep = '\\';
+#else
+ if (pgm == NULL)
+ return (char *)suffix;
+
+ strncpy (pathbuf, pgm, size);
+ pathbufsize-1 = 0;
+ pathsep = '/';
+#endif
+
+ /* drop file name */
+ p = strrchr(pathbuf, pathsep);
+ if (p == NULL)
+ p = pathbuf;
+ *p = 0;
+
+ /* drop also 'bin' */
+ p = strrchr(pathbuf, pathsep);
+ if (p == NULL)
+ p = pathbuf;
+
+ strcpy(p, suffix);
+
+ return pathbuf;
+}
+
+static int Verbose_Loading;
+
+static int try_to_load_file (SLFUTURE_CONST char *path, char *file, char *ns)
+{
+ int status;
+
+ if (file != NULL)
+ {
+	int free_path = 0;
+	if (path == NULL)
+	 {
+	 free_path = 1;
+	 path = SLpath_getcwd ();
+	 if (path == NULL)
+	 {
+		 path = ".";
+		 free_path = 0;
+	 }
+	 }
+
+	file = SLpath_find_file_in_path (path, file);
+	if (free_path) SLfree (path);
+
+	if (file == NULL)
+	 return 0;
+ }
+ /* otherwise use stdin */
+
+ status = SLns_load_file (file, ns);
+ SLfree (file);
+ if (status == 0)
+ return 1;
+ return -1;
+}
+
+static int load_startup_file (const char *pgm, int is_interactive)
+{
+ char pathbuf2048;
+ SLFUTURE_CONST char *dir;
+ int status;
+
+ dir = getenv (SLSH_CONF_DIR_ENV);
+ if (dir == NULL)
+ dir = getenv (SLSH_LIB_DIR_ENV);
+
+ if (NULL == dir)
+ {
+#ifdef SLSH_CONF_DIR
+	dir = SLSH_CONF_DIR;
+	if (dir != NULL)
+	 {
+	 status = try_to_load_file (dir, (char *)SLSHRC_FILE, NULL);
+	 if (status == -1)
+	 return -1;
+	 if (status == 1)
+	 return 0;
+	 }
+#endif
+
+#ifdef __WIN32__
+	dir = prepend_exec_root (pgm, "\\etc", pathbuf, sizeof(pathbuf));
+#else
+	dir = prepend_exec_root (pgm, "/etc", pathbuf, sizeof(pathbuf));
+#endif
+ }
+
+ if (-1 == (status = try_to_load_file (dir, (char *)SLSHRC_FILE, NULL)))
+ return -1;
+
+ if ((status == 0)
+ && (Verbose_Loading || is_interactive))
+ {
+	SLang_vmessage ("*** Installation Problem? Unable to find the %s config file.",
+			SLSHRC_FILE);
+ }
+
+ return 0;
+}
+
+static int setup_paths (const char *pgm)
+{
+ SLFUTURE_CONST char *libpath = NULL;
+ char pathbuf2048;
+
+#ifdef SLSH_PATH
+ libpath = SLSH_PATH;
+#endif
+
+ if (libpath != NULL)
+ {
+	if (2 != SLpath_file_exists (libpath))
+	 libpath = NULL;
+ }
+
+ if (libpath == NULL)
+ {
+#ifdef __WIN32__
+	libpath = prepend_exec_root (pgm, "\\share\\slsh", pathbuf, sizeof(pathbuf));
+#else
+	libpath = prepend_exec_root (pgm, "/share/slsh", pathbuf, sizeof(pathbuf));
+#endif
+ }
+
+ if (-1 == SLpath_set_load_path (libpath))
+ return -1;
+
+#ifdef __WIN32__
+ /* hack a directory for modules */
+ {
+	char *dir;
+	dir = prepend_exec_root (pgm, "\\lib\\slang\\v2\\modules", pathbuf, sizeof(pathbuf));
+	if (-1 == SLang_set_module_load_path (dir))
+	 return -1;
+ }
+#endif
+
+ return 0;
+}
+
+static int set_verbose_loading (int *val)
+{
+ return SLang_load_file_verbose (*val);
+}
+
+/* Create the Table that S-Lang requires */
+static SLang_Intrin_Fun_Type Intrinsics =
+{
+ MAKE_INTRINSIC_0("exit", exit_intrin, VOID_TYPE),
+ MAKE_INTRINSIC_1("atexit", at_exit, VOID_TYPE, SLANG_REF_TYPE),
+ MAKE_INTRINSIC_0("stat_mode_to_string", stat_mode_to_string, VOID_TYPE),
+ MAKE_INTRINSIC_1("set_verbose_loading", set_verbose_loading, SLANG_INT_TYPE, SLANG_INT_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static char *Slsh_Path_Env = SLSH_PATH_ENV;
+static char *Slsh_Conf_Dir_Env = SLSH_CONF_DIR_ENV;
+static SLang_Intrin_Var_Type Intrinsic_Variables =
+{
+ MAKE_VARIABLE("SLSH_PATH_ENV", &Slsh_Path_Env, SLANG_STRING_TYPE, 1),
+ MAKE_VARIABLE("SLSH_CONF_DIR_ENV", &Slsh_Conf_Dir_Env, SLANG_STRING_TYPE, 1),
+ SLANG_END_INTRIN_VAR_TABLE
+};
+
+static void usage (void)
+{
+ char *libpath;
+ fprintf (stderr, "\
+Usage: slsh OPTIONS -|file args...\n\
+ --help Print this help\n\
+ --version Show slsh version information\n\
+ -e string Execute 'string' as S-Lang code\n\
+ -g Compile with debugging code, tracebacks, etc\n\
+ -n Don't load personal init file\n\
+ --init file Use this file instead of ~/%s\n",
+	 USER_SLSHRC);
+ fprintf (stderr, "\
+ --no-readline Do not use readline\n\
+ -i Force interactive input\n\
+ -q, --quiet Do not print startup messages\n\
+ -t Test mode. If slsh_main exists, do not call it\n\
+ -v Show verbose loading messages\n\
+ -Dname Define \"name\" as a preprocessor symbol\n\
+\n\
+ Note: - and -i are mutually exclusive\n\
+\n\
+"
+	 );
+ libpath = SLpath_get_load_path ();
+ fprintf (stderr, "Default search path: %s\n", (libpath == NULL) ? "" : libpath);
+ SLang_free_slstring (libpath);
+
+ exit (1);
+}
+
+static void output_version (void)
+{
+ fprintf (stdout, "slsh version %s; ", Slsh_Version);
+ fprintf (stdout, "S-Lang version: %s\n", SLang_Version_String);
+ if (SLANG_VERSION != SLang_Version)
+ {
+	fprintf (stdout, "\t** Note: This program was compiled against version %s.\n",
+		 SLANG_VERSION_STRING);
+ }
+}
+
+static int output_copyright (void)
+{
+ output_version ();
+ fprintf (stdout, "Copyright (C) 2005-2017,2018 John E. Davis <jed@jedsoft.org>\r\n");
+ fprintf (stdout, "This is free software with ABSOLUTELY NO WARRANTY.\r\n");
+ fprintf (stdout, "\n");
+
+ return 0;
+}
+
+static void version (void)
+{
+ output_version ();
+ exit (0);
+}
+
+int main (int argc, char **argv)
+{
+ char *file = NULL, *pgm;
+ SLFUTURE_CONST char *init_file = USER_SLSHRC;
+ char *init_file_dir;
+ int exit_val;
+ int is_interactive = 0;
+ int use_readline = 1;
+ int test_mode = 0;
+ char *exec_string = NULL;
+ int quiet = 0;
+
+#ifdef SLSYSWRAP
+ (void) SLsyswrap_set_syscall_failure (0);
+#endif
+
+ (void) SLutf8_enable (-1);
+
+ if ((-1 == SLang_init_all ())
+ || (-1 == SLang_init_array_extra ())
+#ifndef SLSH_STATIC
+ || (-1 == SLang_init_import ()) /* dynamic linking */
+#endif
+ || (-1 == SLadd_intrin_fun_table (Intrinsics, NULL))
+ || (-1 == SLadd_intrin_var_table (Intrinsic_Variables, NULL))
+ || (-1 == slsh_init_readline_intrinsics ()))
+ {
+	fprintf(stderr, "Unable to initialize S-Lang.\n");
+	return 1;
+ }
+
+#ifdef SIGPIPE
+ (void) SLsignal (SIGPIPE, SIG_IGN);
+#endif
+
+#ifdef SLSYSWRAP
+ (void) SLsyswrap_set_syscall_failure (1);
+#endif
+
+ /* FIXME for other systems */
+#ifdef __WIN32__
+ init_file_dir = getenv ("USERPROFILE");
+#else
+ init_file_dir = getenv ("HOME");
+#endif
+
+ pgm = argv0;
+ if (-1 == setup_paths (pgm))
+ return -1;
+
+ while (argc > 1)
+ {
+	char *arg = argv1;
+
+	if (0 == strcmp (arg, "--version"))
+	 version ();
+
+	if (0 == strcmp (arg, "--help"))
+	 usage ();
+
+	if (0 == strcmp (arg, "-i"))
+	 {
+	 argc--;
+	 argv++;
+	 is_interactive = 1;
+	 continue;
+	 }
+
+	if ((0 == strcmp (arg, "-e"))
+	 && (argc > 2))
+	 {
+	 argc -= 2;
+	 argv += 2;
+	 exec_string = *argv;
+	 continue;
+	 }
+
+	if (0 == strcmp (arg, "-g"))
+	 {
+	 SLang_generate_debug_info (1);
+	 SLang_Traceback = SL_TB_FULL;
+	 argc--;
+	 argv++;
+	 continue;
+	 }
+
+	if (0 == strcmp (arg, "-n"))
+	 {
+	 init_file = NULL;
+	 argc--;
+	 argv++;
+	 continue;
+	 }
+
+	if ((0 == strcmp (arg, "-q")) || (0 == strcmp (arg, "--quiet")))
+	 {
+	 quiet = 1;
+	 argc--;
+	 argv++;
+	 continue;
+	 }
+
+	if (0 == strcmp (arg, "-t"))
+	 {
+	 test_mode = 1;
+	 argc--;
+	 argv++;
+	 continue;
+	 }
+
+	if (0 == strcmp (arg, "-v"))
+	 {
+	 (void) SLang_load_file_verbose (3);
+	 Verbose_Loading = 1;
+	 argc--;
+	 argv++;
+	 continue;
+	 }
+
+	if (0 == strcmp (arg, "--no-readline"))
+	 {
+	 use_readline = 0;
+	 argc--;
+	 argv++;
+	 continue;
+	 }
+
+	if ((0 == strcmp (arg, "--init"))
+	 && (argc > 2))
+	 {
+	 init_file = argv2;
+	 init_file_dir = NULL;
+	 argc -= 2;
+	 argv += 2;
+	 continue;
+	 }
+
+	if (0 == strncmp (arg, "-D", 2))
+	 {
+	 char *prep = arg + 2;
+	 if (*prep != 0)
+	 (void) SLdefine_for_ifdef (prep);
+	 argc--;
+	 argv++;
+	 continue;
+	 }
+
+	break;
+ }
+
+ if (argc == 1)
+ {
+	if ((exec_string == NULL) && (is_interactive == 0))
+	 is_interactive = (isatty (fileno(stdin)) && isatty (fileno(stdout)));
+	file = NULL;
+ }
+ else
+ {
+	file = argv1;
+	if (0 == strcmp (file, "-"))
+	 {
+	 if (is_interactive)
+	 usage ();
+	 file = NULL;
+	 }
+
+	argc--;
+	argv++;
+ }
+
+ if ((is_interactive == 0)
+ && (SLang_Version < SLANG_VERSION))
+ {
+	fprintf (stderr, "***Warning: Executable compiled against S-Lang %s but linked to %s\n",
+		 SLANG_VERSION_STRING, SLang_Version_String);
+	fflush (stderr);
+ }
+
+ /* fprintf (stdout, "slsh: argv0=%s\n", argv0); */
+ if (-1 == SLang_set_argc_argv (argc, argv))
+ return 1;
+
+ if (is_interactive)
+ (void) SLdefine_for_ifdef ("__INTERACTIVE__");
+
+ if (-1 == load_startup_file (pgm, is_interactive))
+ return SLang_get_error ();
+
+ if (-1 == SLang_run_hooks ("__slsh_startup_hook", 0))
+ return SLang_get_error ();
+
+ /* Initializing the readline interface causes the .slrlinerc file
+ * to be loaded. It is put here after the startup files have been loaded.
+ */
+ if (-1 == slsh_use_readline (SLpath_basename (argv0), use_readline, is_interactive))
+ return 1;
+
+ if ((init_file != NULL)
+ && (-1 == try_to_load_file (init_file_dir, (char *)init_file, NULL)))
+ return SLang_get_error ();
+
+ if ((file != NULL)
+ || ((is_interactive == 0) && (exec_string == NULL)))
+ {
+	if (0 == try_to_load_file (NULL, file, NULL))
+	 {
+	 fprintf (stderr, "%s: file not found\n", file);
+	 exit (1);
+	 }
+	if (test_mode == 0)
+	 (void) SLang_run_hooks ("slsh_main", 0);
+ }
+
+ if (exec_string != NULL)
+ {
+	(void) SLang_load_string (exec_string);
+ }
+
+ if (is_interactive)
+ {
+	if (quiet == 0)
+	 output_copyright ();
+	if (SLang_Traceback != SL_TB_FULL)
+	 SLang_Traceback = SL_TB_NONE;
+
+	(void) slsh_interactive ();
+ }
+
+ exit_val = SLang_get_error ();
+ c_exit (exit_val);
+ return SLang_get_error ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/slsh/slsh.h Added

@@ -0,0 +1,27 @@
+/* -*- mode: C; mode: fold -*-
+Copyright (C) 2010-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#ifndef SLANG_SLSH_H
+#define SLANG_SLSH_H
+
+extern int slsh_interactive (void);
+extern int slsh_use_readline (char *, int, int);
+extern int slsh_init_readline_intrinsics (void);
+#endif				       /* SLANG_SLSH_H */

_service:tar_scm:slang-2.3.2.tar.bz2/src Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/DESCRIP.MMS Added

@@ -0,0 +1,44 @@
+# Do not run mms/mmk directly.  Do @vmsmake which will call mms/mmk.
+#
+#  MMS file to build S-Lang (Thanks to Hunter Goatley)
+#  Modified by zinser@axp602.gsi.de
+#
+.IFDEF __MMK__
+.ELSE
+EXE = .EXE
+OBJ = .OBJ
+OLB = .OLB
+.ENDIF
+
+OBJS =	SLANG$(OBJ),SLPARSE$(OBJ),SLMATH$(OBJ),-
+	SLSTD$(OBJ),SLARRAY$(OBJ),SLREGEXP$(OBJ),SLERR$(OBJ),-
+	SLKEYMAP$(OBJ),SLRLINE$(OBJ),SLTOKEN$(OBJ),SLGETKEY$(OBJ),-
+	SLVMSTTY$(OBJ),SLMEMCMP$(OBJ),SLMEMCHR$(OBJ),SLMEMCPY$(OBJ)-
+	SLDISPLY$(OBJ),SLSMG$(OBJ),SLSEARCH$(OBJ),SLCMD$(OBJ)-
+	SLMALLOC$(OBJ),SLMEMSET$(OBJ),SLMISC$(OBJ),SLPREPR$(OBJ),-
+	SLCLASS$(OBJ),SLTYPES$(OBJ),SLSCROLL$(OBJ),SLSIGNAL$(OBJ), -
+	SLKEYPAD$(OBJ),SLERRNO$(OBJ),SLCURSES$(OBJ),SLSTRING$(OBJ),-
+	SLSTRUCT$(OBJ),SLCMPLEX$(OBJ),SLARRFUN$(OBJ),SLIMPORT$(OBJ),-
+	SLPATH$(OBJ),SLARITH$(OBJ),SLASSOC$(OBJ),SLCOMPAT$(OBJ),-
+	SLPOSDIR$(OBJ),SLSTDIO$(OBJ),SLPROC$(OBJ),SLTIME$(OBJ),-
+	SLSTROPS$(OBJ),SLBSTR$(OBJ),SLPACK$(OBJ),SLINTALL$(OBJ),-
+	SLISTRUC$(OBJ),SLPOSIO$(OBJ),SLNSPACE$(OBJ),SLARRMIS$(OBJ),-
+	SLOSPATH$(OBJ),SLSCANF$(OBJ),SLLOWER$(OBJ),SLUPPER$(OBJ),-
+	SLISCHAR$(OBJ),SLUTF8$(OBJ),SLWCWIDTH$(OBJ),SLWCLUT$(OBJ),-
+	SLCOMMON$(OBJ),SLLIST$(OBJ),SLEXCEPT$(OBJ),SLFPU$(OBJ),-
+	SLSIG$(OBJ),SLBOSEOS$(OBJ)
+
+HFILES = SLANG.H,_SLANG.H
+
+ALL : calc$(exe)
+        write sys$output "Complete."
+CALC$(EXE) : CALC$(OBJ),SLANG$(OLB)($(OBJS))
+        $(LINK)$(LINKFLAGS)/NOTRACE CALC$(OBJ),client.opt/opt
+
+CALC$(OBJ) :	CALC.C CONFIG.H
+
+#
+#  Most modules depend on most of the .H files, so I'm going to be lazy
+#  and just make them all depend on all of them.
+#
+$(OBJS) : $(HFILES) CONFIG.H

_service:tar_scm:slang-2.3.2.tar.bz2/src/Makefile.in Added

@@ -0,0 +1,262 @@
+# -*- sh -*-
+#---------------------------------------------------------------------------
+# ANSI C compiler
+#---------------------------------------------------------------------------
+CC              = @CC@
+CFLAGS 		= @CFLAGS@
+LDFLAGS		= @LDFLAGS@
+#-----------------------------------------------------------------------------
+# System library that contains functions for dynamic linking (-ldl)
+#-----------------------------------------------------------------------------
+DL_LIB		= @DYNAMIC_LINK_LIB@
+
+#---------------------------------------------------------------------------
+# Compiler for producing a shared library (ELF)
+#---------------------------------------------------------------------------
+ELF_CC 		= @ELF_CC@
+ELF_CFLAGS	= @ELF_CFLAGS@
+ELF_LINK        = @ELF_LINK@
+ELF_DEP_LIBS	= @ELF_DEP_LIBS@
+
+#---------------------------------------------------------------------------
+# Set these values to ABSOLUTE path names
+#---------------------------------------------------------------------------
+SRCDIR = @SRCDIR@# Location of sources
+OBJDIR = @OBJDIR@# Location of objects
+ELFDIR = @ELFDIR@# Location of elf objects
+VERSION_SCRIPT	= $(SRCDIR)/slang.ver
+ELFDIR_TSTAMP = $(ELFDIR)/tstamp
+OBJDIR_TSTAMP = $(OBJDIR)/tstamp
+#---------------------------------------------------------------------------
+# When searching for modules, slang will search the paths specified by the
+# value of the SLANG_MODULE_PATH environment variable.  The name of this
+# variable may be changed here.
+#---------------------------------------------------------------------------
+MODULE_PATH_ENV_NAME = "SLANG_MODULE_PATH"
+
+#---------------------------------------------------------------------------
+# Misc Libraries
+MISC_TERMINFO_DIRS = @MISC_TERMINFO_DIRS@
+OTHER_CFLAGS = @DSLSYSWRAP@
+OTHER_LIBS = @LIB_SLSYSWRAP@ @TERMCAP@ @LIBS@ @M_LIB@
+#---------------------------------------------------------------------------
+# Directory where library is going to go when installed
+#---------------------------------------------------------------------------
+prefix = @prefix@
+exec_prefix = @exec_prefix@
+install_lib_dir = @libdir@
+install_bin_dir = @bindir@
+install_include_dir = @includedir@
+install_doc_dir = $(prefix)/share/doc/slang/v@slang_major_version@
+DOC_FILES = ../changes.txt ../COPY* ../doc/slangdoc.html ../doc/text/*.txt
+MODULE_INSTALL_DIR = @libdir@/slang/v@slang_major_version@/modules
+#---------------------------------------------------------------------------
+# DESTDIR is designed to facilitate making packages.  Normally it is empty
+#---------------------------------------------------------------------------
+#DESTDIR =
+DEST_LIBDIR = $(DESTDIR)$(install_lib_dir)
+DEST_DOCDIR = $(DESTDIR)$(install_doc_dir)
+DEST_INCDIR = $(DESTDIR)$(install_include_dir)
+DEST_BINDIR = $(DESTDIR)$(install_bin_dir)
+
+#----------------------------------------------------------------------------
+# These should be empty for production code
+#----------------------------------------------------------------------------
+SLSYSWRAP_DEF = @DSLSYSWRAP@
+SLSYSWRAP_LIB = @LIB_SLSYSWRAP@
+#---------------------------------------------------------------------------
+# Misc commands (safe to leave these untouched)
+#---------------------------------------------------------------------------
+RANLIB 		= @RANLIB@
+INSTALL		= @INSTALL@
+INSTALL_DATA	= @INSTALL_DATA@
+MKINSDIR	= @CONFIG_DIR@/autoconf/mkinsdir.sh
+RM 		= rm -f
+RM_R		= rm -rf
+AR_CR 		= ar cr
+RMDIR 		= rmdir
+LN 		= /bin/ln -sf
+CP 		= cp
+@SET_MAKE@
+#---------------------------------------------------------------------------
+# There should be no need to change anything below here.
+#---------------------------------------------------------------------------
+THIS_LIB		= slang#
+DLL_IMPLIB_NAME		= @DLL_IMPLIB_NAME@
+OTHERSTUFF 		=
+THIS_LIB_DEFINES	= -DSLANG
+ELF_MAJOR_VERSION	= @slang_major_version@#
+ELF_MINOR_VERSION	= @slang_minor_version@#
+ELF_MICRO_VERSION	= @slang_micro_version@#
+INSTALL_ELFLIB_TARGET	= @INSTALL_ELFLIB_TARGET@
+
+CONFIG_H		= config.h
+TERMINFO_INC		= terminfo/@TERMINFO_LAYOUT@.inc
+ALL_CFLAGS		= $(CFLAGS) -Dunix $(THIS_LIB_DEFINES) $(OTHER_CFLAGS)
+ALL_ELF_CFLAGS		= $(ELF_CFLAGS) -Dunix $(THIS_LIB_DEFINES) $(OTHER_CFLAGS)
+COMPILE_CMD		= $(CC) -c $(ALL_CFLAGS)
+ELFCOMPILE_CMD		= $(ELF_CC) -c $(ALL_ELF_CFLAGS)
+ELF_LINK_CMD		= $(ELF_LINK)
+
+NORMAL_LIB = lib$(THIS_LIB).a
+OBJDIR_NORMAL_LIB = $(OBJDIR)/$(NORMAL_LIB)
+
+# On most systems, these variables have values of the form:
+#   libslang.so, libslang.so.X, libslang.so.X.Y, libslang.so.X.Y.Z
+ELFLIB = @ELFLIB@
+ELFLIB_MAJOR = @ELFLIB_MAJOR@
+ELFLIB_MAJOR_MINOR = @ELFLIB_MAJOR_MINOR@
+ELFLIB_MAJOR_MINOR_MICRO = @ELFLIB_MAJOR_MINOR_MICRO@
+
+# Set this to one of the above ELFLIB_MAJOR_* values
+ELFLIB_BUILD_NAME       = @ELFLIB_BUILD_NAME@
+
+ELFDIR_ELF_LIB = $(ELFDIR)/$(ELFLIB_BUILD_NAME)#
+ELFDIR_DLL_LIB = $(ELFDIR)/$(DLL_IMPLIB_NAME)#
+
+EXECLIBS = -L$(OBJDIR) -lslang $(OTHER_LIBS) $(DL_LIB)
+EXECDEPS = $(OBJDIR_NORMAL_LIB)
+
+OFILES = @PROGRAM_OFILES@
+OBJS = @PROGRAM_OBJECTS@
+ELFOBJS = @PROGRAM_ELFOBJECTS@
+
+SHELL = /bin/sh
+
+DOT_O_DEPS = sllimits.h _slang.h _slint.h $(CONFIG_H)
+OBJ_O_DEPS = $(OBJDIR_TSTAMP)
+ELF_O_DEPS = $(ELFDIR_TSTAMP)
+sltoken_O_DEP = keywhash.c
+slarith_O_DEP = slarith.inc slarith2.inc
+slarrfun_O_DEP = slarrfun.inc
+slarray_O_DEP = slagetput.inc
+slischar_O_DEP = slischar.h
+slwclut_O_DEP = slischar.h
+sllower_O_DEP = sllower.h
+slupper_O_DEP = slupper.h
+slwcwidth_O_DEP = slwcwidth.h
+slcommon_O_DEP = slang.h
+slstd_O_DEP = Makefile
+slimport_O_DEP = Makefile
+sltermin_O_DEP = Makefile terminfo.inc
+slcurses_O_DEP = slcurses.h
+slstd_C_FLAGS = -DSLANG_DOC_DIR='"$(install_doc_dir)"' -DSLANG_INSTALL_PREFIX='"$(prefix)"'
+slimport_C_FLAGS = -DMODULE_INSTALL_DIR='"$(MODULE_INSTALL_DIR)"' -DMODULE_PATH_ENV_NAME='$(MODULE_PATH_ENV_NAME)'
+sltermin_C_FLAGS = -DMISC_TERMINFO_DIRS='"$(MISC_TERMINFO_DIRS)"'
+UPDATE_VERSION_SCRIPT = $(HOME)/bin/update_changes_version
+
+#---------------------------------------------------------------------------
+# Rules
+#---------------------------------------------------------------------------
+all: static elf
+static: $(OBJDIR_TSTAMP) $(CONFIG_H) $(OBJDIR_NORMAL_LIB) $(OTHERSTUFF)
+elf: $(ELFDIR_TSTAMP) $(CONFIG_H) $(ELFDIR_ELF_LIB)
+
+$(OBJDIR_NORMAL_LIB): $(OBJDIR_TSTAMP) $(CONFIG_H) $(OBJS)
+	-$(RM) $(OBJDIR_NORMAL_LIB)
+	cd $(OBJDIR) && $(AR_CR) $(NORMAL_LIB) $(OFILES)
+	$(RANLIB) $(OBJDIR_NORMAL_LIB)
+	@echo ""
+	@echo $(NORMAL_LIB) created in $(OBJDIR)
+
+$(ELFDIR_ELF_LIB): $(ELFDIR) $(CONFIG_H) $(ELFOBJS) $(VERSION_SCRIPT)
+	-$(RM) $(ELFDIR_ELF_LIB)
+	cd $(ELFDIR) && $(ELF_LINK_CMD) -o $(ELFLIB_BUILD_NAME) $(OFILES) $(LDFLAGS) $(ELF_DEP_LIBS)
+	if  $(ELFLIB_MAJOR) != $(ELFLIB_BUILD_NAME) ; then \
+	  cd $(ELFDIR) && $(RM) $(ELFLIB_MAJOR) && $(LN) $(ELFLIB_BUILD_NAME) $(ELFLIB_MAJOR); \
+	fi
+	cd $(ELFDIR) && $(RM) $(ELFLIB) && $(LN) $(ELFLIB_BUILD_NAME) $(ELFLIB)
+	@echo ""
+	@echo $(ELFLIB_BUILD_NAME) created in $(ELFDIR).
+	@echo The link $(ELFLIB) to $(ELFLIB_BUILD_NAME) was also created.
+	@echo ""
+$(OBJDIR_TSTAMP) :
+	-$(MKINSDIR) $(OBJDIR)
+	touch $(OBJDIR_TSTAMP)
+$(ELFDIR_TSTAMP) :
+	-$(MKINSDIR) $(ELFDIR)
+	touch $(ELFDIR_TSTAMP)
+$(CONFIG_H) : sysconf.h Makefile
+	-$(CP) sysconf.h $(CONFIG_H)
+terminfo.inc: $(TERMINFO_INC) Makefile
+	-$(CP) $(TERMINFO_INC) terminfo.inc
+#---------------------------------------------------------------------------
+# Intallation rules
+#---------------------------------------------------------------------------
+$(DEST_DOCDIR):
+	$(MKINSDIR) $(DEST_DOCDIR)
+$(DEST_INCDIR):
+	$(MKINSDIR) $(DEST_INCDIR)
+$(DEST_LIBDIR):
+	$(MKINSDIR) $(DEST_LIBDIR)
+install-headers: $(DEST_INCDIR)
+	@echo installing slang.h and slcurses.h in $(DEST_INCDIR)/
+	$(INSTALL_DATA) $(SRCDIR)/slang.h $(DEST_INCDIR)/
+	$(INSTALL_DATA) $(SRCDIR)/slcurses.h $(DEST_INCDIR)/
+install-docs: $(DEST_DOCDIR)
+	@for i in $(DOC_FILES); \
+	do \
+		echo $(INSTALL_DATA) $$i $(DEST_DOCDIR)/; \
+		$(INSTALL_DATA) $$i $(DEST_DOCDIR)/; \
+	done
+install-static: static install-headers install-docs $(DEST_LIBDIR)
+	@echo installing $(OBJDIR_NORMAL_LIB) in $(DEST_LIBDIR)/
+	$(INSTALL_DATA) $(OBJDIR_NORMAL_LIB) $(DEST_LIBDIR)/
+	$(RANLIB) $(DEST_LIBDIR)/$(NORMAL_LIB)
+install-elf-and-links:
+	-$(RM) $(DEST_LIBDIR)/$(ELFLIB)
+	-$(RM) $(DEST_LIBDIR)/$(ELFLIB_MAJOR)
+	@echo installing $(ELFLIB_BUILD_NAME) in $(DEST_LIBDIR)
+	$(INSTALL) $(ELFDIR_ELF_LIB) $(DEST_LIBDIR)/
+	-cd $(DEST_LIBDIR) && $(LN) $(ELFLIB_BUILD_NAME) $(ELFLIB_MAJOR)
+	-cd $(DEST_LIBDIR) && $(LN) $(ELFLIB_MAJOR) $(ELFLIB)
+	@echo ""
+	@echo $(ELFLIB_BUILD_NAME) created in $(DEST_LIBDIR).
+	@echo The links $(ELFLIB) and $(ELFLIB_MAJOR) to $(ELFLIB_BUILD_NAME) were also created.
+	@echo ""
+# On cygwin, the DLL must be installed in the bin directory and the import-lib
+# goes in the lib directory
+install-elf-cygwin:
+	$(INSTALL_DATA) $(ELFDIR_DLL_LIB) $(DEST_LIBDIR)/
+	$(MKINSDIR) $(DEST_BINDIR)
+	$(INSTALL) $(ELFDIR_ELF_LIB) $(DEST_BINDIR)/
+install-elf: elf install-headers install-docs $(DEST_LIBDIR) $(INSTALL_ELFLIB_TARGET)
+install-all: install-elf install-static
+install: install-all
+#---------------------------------------------------------------------------
+# Tests
+#---------------------------------------------------------------------------
+runtests: $(OBJDIR_NORMAL_LIB) static
+	cd test; $(MAKE) CC="$(CC)" CFLAGS="$(CFLAGS)" OTHER_CFLAGS="$(OTHER_CFLAGS)" OTHER_LIBS="$(OTHER_LIBS)" SLANGLIB="$(OBJDIR)"
+#---------------------------------------------------------------------------
+# Housekeeping
+#---------------------------------------------------------------------------
+elf-clean:
+	-$(RM) $(ELFDIR)/*
+clean: elf-clean
+	-$(RM) *~ "#"*
+	-$(RM) $(OBJDIR)/*
+	-$(RM) $(ELFDIR)/*
+	@cd test; $(MAKE) clean
+distclean: clean
+	-$(RM_R) $(OBJDIR) $(ELFDIR) Makefile sysconf.h $(CONFIG_H) terminfo.inc
+
+# The symlinks target is for my own private use.  It simply creates the object
+# directory as a symbolic link to a local disk instead of an NFS mounted one.
+symlinks:
+	-/bin/rm -f $(ARCH)objs
+	mkdir -p $(HOME)/sys/$(ARCH)/objs/slang/src
+	ln -s $(HOME)/sys/$(ARCH)/objs/slang/src $(ARCH)objs
+	@echo "Also try: make elfsymlinks"
+elfsymlinks: symlinks
+	-/bin/rm -f elf$(ARCH)objs
+	mkdir -p $(HOME)/sys/$(ARCH)/objs/slang/src/elf
+	ln -s $(HOME)/sys/$(ARCH)/objs/slang/src/elf elf$(ARCH)objs
+slang.h: $(SRCDIR)/../changes.txt
+	if  -x $(UPDATE_VERSION_SCRIPT) ; then \
+	  $(UPDATE_VERSION_SCRIPT) $(SRCDIR)/../changes.txt $(SRCDIR)/slang.h; \
+	fi
+#
+#---------------------------------------------------------------------------
+# Object Rules : These are created from the configure script (hopefully)
+#---------------------------------------------------------------------------

_service:tar_scm:slang-2.3.2.tar.bz2/src/VMSMAKE.COM Added

@@ -0,0 +1,121 @@
+$ ver = f$verify(0)
+$!  Makefile for VMS
+$ Make = ""
+$ ccopt="/include="
+$ cc = "CC"
+$!
+$! Check for MMK/MMS
+$!
+$ If F$Search ("Sys$System:MMS.EXE") .nes. "" Then Make = "MMS"
+$ If F$Type (MMK) .eqs. "STRING" Then Make = "MMK"
+$!
+$! Look for the compiler used
+$!
+$ if p1.nes.""
+$   then
+$     if f$locate("G",p1).ne.f$length(p1) then goto gnuc
+$     if f$locate("V",p1).ne.f$length(p1) then goto vaxc
+$     if f$locate("D",p1).ne.f$length(p1) then goto decc
+$ endif
+$!
+$!  Option file for test applications
+$!
+$ open/write optf client.opt
+$ write optf "slang/library"
+$!
+$DECC:
+$ if f$search("SYS$SYSTEM:DECC$COMPILER.EXE").nes.""
+$ then
+$   write sys$output "DECC compiler found"
+$   defs = "VMS"
+$   ccopt = "/decc/prefix=all/float=ieee/name=(as_is,short)/ieee=denorm"+ccopt
+$!   ccopt = "/decc/prefix=all/float=ieee/name=(as_is,short)"+ccopt
+$   goto compile
+$ endif
+$!
+$VAXC:
+$ if f$search("SYS$SYSTEM:VAXC.EXE").nes.""
+$ then
+$   write sys$output "VAXC compiler found"
+$   defs = "FLOAT_TYPE"
+$   write optf "sys$library:vaxcrtl.exe/share"
+$   goto compile
+$ endif
+$!
+$GNUC:
+$ if f$trnlnm("GNU_CC").nes.""
+$ then
+$   write sys$output "GNUC compiler found"
+$   defs = "FLOAT_TYPE"
+$   cc="GCC"
+$   ccopt = "/warnings/nocase_hack/nolist/optimize=4"+ccopt
+$   write optf "gnu_cc:000000gcclib.olb/lib"
+$   goto compile
+$ endif
+$!
+$! No compiler found - Warning and Exit
+$!
+$ close optf
+$ type sys$input
+FATAL: No C-compiler found - Can't build Slang on this system.
+
+$ goto The_exit
+$!
+$COMPILE:
+$!
+$ close optf
+$ files = "slang,slparse,slmath,slstd,slarray,slregexp,slerr"
+$ files = files + ",slrline,slgetkey,slvmstty,slkeymap,sltoken,slcurses"
+$ files = files + ",slmemcpy,slmemcmp,slmemset,slmemchr,slmisc,slsig"
+$ files = files + ",sldisply,slsmg,slsearch,slcmd,slmalloc,slclass"
+$ files = files + ",slprepr,sltypes,slscroll,slsignal,slkeypad,slerrno"
+$ files = files + ",slstruct,slcmplex,slarrfun,slimport,slpath,slarith,slassoc"
+$ files = files + ",slcompat,slposdir,slstdio,slproc,sltime,slstrops"
+$ files = files + ",slbstr,slpack,slintall,slistruc,slposio,slnspace,slarrmis"
+$ files = files + ",slospath,slscanf,slstring,sllist,slexcept,slfpu,slboseos"
+$ files = files + ",sllower,slupper,slischar,slutf8,slwcwidth,slwclut,slcommon"
+$!
+$!  simple make
+$!
+$  copy slconfig.h config.h
+$  purge config.h
+$  if (Make .nes. "")
+$   then
+$    'Make'/Macro = (cc="''CC'", cflags="''CCOPt'/define=(''defs')")
+$  else
+$    count = 0
+$    olbf = f$search("slang.olb")
+$    if (olbf .eqs. "") then library/object/create slang.olb
+$    next_file:
+$      f = f$element(count, ",", files)
+$      count = count + 1
+$      if (f .eqs. ",") then goto testfiles
+$      objf = f$search("''f'.obj")
+$      if (objf .eqs. "") then goto compile_it
+$      tobj = f$file_attr(objf, "RDT")
+$      tc  = f$file_attr("''f'.c", "RDT")
+$      if (f .eqs. "sysdep")
+$      then
+$  	 if ( f$cvtime(tobj) .lts. f$cvtime(f$file_attr("vms.c","RDT"))) -
+   	   then goto compile_it
+$      endif
+$      if (f$cvtime(tc) .lts. f$cvtime(tobj)) then goto next_file
+$    compile_it:
+$      write sys$output "''CC' ''CCOPT'/define=(''defs') ''f'.c"
+$      'CC' 'CCOPT'/define=('defs') 'f'.c
+$      library/replace slang.olb 'f'
+$      goto next_file
+$  testfiles:
+$    purge slang.olb
+$    write sys$output "''CC' ''CCOPT'/define=(''defs') calc.c"
+$      'CC' 'CCOPT'/define=('defs') calc.c
+$      write sys$output "link/exec=calc calc client.opt/opt"
+$      link/exec=calc calc, client.opt/opt
+$!    write sys$output "''CC' ''CCOPT'/define=(''defs') worm.c"
+$!      'CC' 'CCOPT'/define=('defs') worm.c
+$!      write sys$output "link/exec=worm worm client.opt/opt"
+$!      link/exec=worm worm, client.opt/opt
+$  endif
+$The_exit:
+$ x = f$verify(ver)
+$ exit $status

_service:tar_scm:slang-2.3.2.tar.bz2/src/_slang.h Added

@@ -0,0 +1,1531 @@
+#ifndef PRIVATE_SLANG_H_
+#define PRIVATE_SLANG_H_
+/* header file for S-Lang internal structures that users do not (should not)
+ need. Use slang.h for that purpose. */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+/* #include "config.h" */
+#include "jdmacros.h"
+#include "sllimits.h"
+#include "_slint.h"
+
+#ifdef VMS
+# define SLANG_SYSTEM_NAME "_VMS"
+#else
+# if defined (IBMPC_SYSTEM)
+# define SLANG_SYSTEM_NAME "_IBMPC"
+# else
+# define SLANG_SYSTEM_NAME "_UNIX"
+# endif
+#endif /* VMS */
+
+/* These quantities are main_types for byte-compiled code. They are used
+ * by the inner_interp routine. The _BC_ means byte-code.
+ */
+
+/* Nametype byte-codes --- these must correspond to those in slang.h */
+typedef enum
+{
+ SLANG_BC_LAST_BLOCK		= 0,
+ SLANG_BC_LVARIABLE		= SLANG_LVARIABLE, /* 0x01 */
+ SLANG_BC_GVARIABLE		= SLANG_GVARIABLE, /* 0x02 */
+ SLANG_BC_IVARIABLE		= SLANG_IVARIABLE, /* 0x03 */
+ SLANG_BC_RVARIABLE		= SLANG_RVARIABLE, /* 0x04 */
+ SLANG_BC_INTRINSIC		= SLANG_INTRINSIC, /* 0x05 */
+ SLANG_BC_FUNCTION		= SLANG_FUNCTION, /* 0x06 */
+ SLANG_BC_MATH_UNARY		= SLANG_MATH_UNARY, /* 0x07 */
+ SLANG_BC_APP_UNARY		= SLANG_APP_UNARY, /* 0x08 */
+ SLANG_BC_ARITH_UNARY		= SLANG_ARITH_UNARY, /* 0x09 */
+ SLANG_BC_ARITH_BINARY	= SLANG_ARITH_BINARY, /* 0x0A */
+ SLANG_BC_ICONST		= SLANG_ICONSTANT, /* 0x0B */
+ SLANG_BC_DCONST		= SLANG_DCONSTANT, /* 0x0C */
+ SLANG_BC_FCONST		= SLANG_FCONSTANT, /* 0x0D */
+ SLANG_BC_LLCONST		= SLANG_LLCONSTANT, /* 0x0E */
+ SLANG_BC_PVARIABLE		= SLANG_PVARIABLE, /* 0x0F */
+ SLANG_BC_PFUNCTION		= SLANG_PFUNCTION, /* 0x10 */
+ SLANG_BC_HCONST		= SLANG_HCONSTANT, /* 0x11 */
+ SLANG_BC_LCONST		= SLANG_LCONSTANT, /* 0x12 */
+ SLANG_BC_UNUSED_0x12		= 0x12,
+ SLANG_BC_UNUSED_0x13		= 0x13,
+ SLANG_BC_UNUSED_0x14		= 0x14,
+ SLANG_BC_UNUSED_0x15		= 0x15,
+ SLANG_BC_UNUSED_0x16		= 0x16,
+ SLANG_BC_UNUSED_0x17		= 0x17,
+ SLANG_BC_UNUSED_0x18		= 0x18,
+ SLANG_BC_UNUSED_0x19		= 0x19,
+ SLANG_BC_UNUSED_0x1A		= 0x1A,
+ SLANG_BC_UNUSED_0x1B		= 0x1B,
+ SLANG_BC_UNUSED_0x1C		= 0x1C,
+ SLANG_BC_UNUSED_0x1D		= 0x1D,
+ SLANG_BC_UNUSED_0x1E		= 0x1E,
+ SLANG_BC_UNUSED_0x1F		= 0x1F,
+
+ /* bytes codes for setting/assigning variables/arrays/structures/refs */
+ SLANG_BC_SET_LOCAL_LVALUE	= 0x20,
+ SLANG_BC_SET_GLOBAL_LVALUE	= 0x21,
+ SLANG_BC_SET_INTRIN_LVALUE	= 0x22,
+ SLANG_BC_SET_STRUCT_LVALUE	= 0x23,
+ SLANG_BC_SET_ARRAY_LVALUE	= 0x24,
+ SLANG_BC_SET_DEREF_LVALUE	= 0x25,
+ SLANG_BC_FIELD		= 0x26,
+ SLANG_BC_METHOD		= 0x27,
+ SLANG_BC_LVARIABLE_AGET	= 0x28,
+ SLANG_BC_LVARIABLE_APUT	= 0x29,
+ SLANG_BC_LOBJPTR		= 0x2A,
+ SLANG_BC_GOBJPTR		= 0x2B,
+ SLANG_BC_FIELD_REF		= 0x2C,
+ SLANG_BC_OBSOLETE_DEREF_FUN_CALL	= 0x2D,
+ SLANG_BC_DEREF_FUN_CALL	= 0x2E,
+ SLANG_BC_UNUSED_0x2F		= 0x2F,
+ SLANG_BC_UNUSED_0x30		= 0x30,
+ SLANG_BC_UNUSED_0x31		= 0x31,
+ SLANG_BC_UNUSED_0x32		= 0x32,
+ SLANG_BC_UNUSED_0x33		= 0x33,
+ SLANG_BC_UNUSED_0x34		= 0x34,
+ SLANG_BC_UNUSED_0x35		= 0x35,
+ SLANG_BC_UNUSED_0x36		= 0x36,
+ SLANG_BC_UNUSED_0x37		= 0x37,
+ SLANG_BC_UNUSED_0x38		= 0x38,
+ SLANG_BC_UNUSED_0x39		= 0x39,
+ SLANG_BC_UNUSED_0x3A		= 0x3A,
+ SLANG_BC_UNUSED_0x3B		= 0x3B,
+ SLANG_BC_UNUSED_0x3C		= 0x3C,
+ SLANG_BC_UNUSED_0x3D		= 0x3D,
+ SLANG_BC_UNUSED_0x3E		= 0x3E,
+ SLANG_BC_UNUSED_0x3F		= 0x3F,
+
+ /* byte codes for literals */
+ SLANG_BC_LITERAL		= 0x40, /* constant objects */
+ SLANG_BC_LITERAL_INT		= 0x41,
+ SLANG_BC_LITERAL_DBL		= 0x42,
+ SLANG_BC_LITERAL_STR		= 0x43,
+ SLANG_BC_DOLLAR_STR		= 0x44,
+ SLANG_BC_LITERAL_SHORT	= 0x45,
+ SLANG_BC_LITERAL_LONG	= 0x46,
+ SLANG_BC_UNUSED_0x45		= 0x45,
+ SLANG_BC_UNUSED_0x46		= 0x46,
+ SLANG_BC_UNUSED_0x47		= 0x47,
+ SLANG_BC_UNUSED_0x48		= 0x48,
+ SLANG_BC_UNUSED_0x49		= 0x49,
+ SLANG_BC_UNUSED_0x4A		= 0x4A,
+ SLANG_BC_UNUSED_0x4B		= 0x4B,
+ SLANG_BC_UNUSED_0x4C		= 0x4C,
+ SLANG_BC_UNUSED_0x4D		= 0x4D,
+ SLANG_BC_UNUSED_0x4E		= 0x4E,
+ SLANG_BC_UNUSED_0x4F		= 0x4F,
+
+ /* Unary/Binary operation codes */
+ SLANG_BC_UNARY		= 0x50,
+ SLANG_BC_BINARY		= 0x51,
+ SLANG_BC_INTEGER_PLUS	= 0x52,
+ SLANG_BC_INTEGER_MINUS	= 0x53,
+ SLANG_BC_UNUSED_0x54		= 0x54,
+ SLANG_BC_UNUSED_0x55		= 0x55,
+ SLANG_BC_UNUSED_0x56		= 0x56,
+ SLANG_BC_UNUSED_0x57		= 0x57,
+ SLANG_BC_UNUSED_0x58		= 0x58,
+ SLANG_BC_UNUSED_0x59		= 0x59,
+ SLANG_BC_UNUSED_0x5A		= 0x5A,
+ SLANG_BC_UNUSED_0x5B		= 0x5B,
+ SLANG_BC_UNUSED_0x5C		= 0x5C,
+ SLANG_BC_UNUSED_0x5D		= 0x5D,
+ SLANG_BC_UNUSED_0x5E		= 0x5E,
+ SLANG_BC_UNUSED_0x5F		= 0x5F,
+
+ /* byte codes associated with keywords and blocks */
+ SLANG_BC_TMP			= 0x60,
+ SLANG_BC_EXCH		= 0x61,
+ SLANG_BC_LABEL		= 0x62,
+ SLANG_BC_BLOCK		= 0x63,
+ SLANG_BC_RETURN		= 0x64,
+ SLANG_BC_BREAK		= 0x65,
+ SLANG_BC_CONTINUE		= 0x66,
+ SLANG_BC_UNUSED_0x67		= 0x67,
+ SLANG_BC_CONTINUE_N		= 0x68,
+ SLANG_BC_BREAK_N		= 0x69,
+ SLANG_BC_X_ERROR		= 0x6A,
+ SLANG_BC_X_USER0		= 0x6B,
+ SLANG_BC_X_USER1		= 0x6C,
+ SLANG_BC_X_USER2		= 0x6D,
+ SLANG_BC_X_USER3		= 0x6E,
+ SLANG_BC_X_USER4		= 0x6F,
+
+ /* byte codes for dealing with the frame pointer and arg list */
+ SLANG_BC_CALL_DIRECT		= 0x70,
+ SLANG_BC_CALL_DIRECT_FRAME	= 0x71,
+ SLANG_BC_CALL_DIRECT_NARGS	= 0x72,
+ SLANG_BC_EARG_LVARIABLE	= 0x73,
+#define USE_BC_LINE_NUM	0	 /* used in slang.c */
+ /* SLANG_BC_LINE_NUM		= 0x74, */
+ SLANG_BC_UNUSED_0x74		= 0x74,
+ SLANG_BC_BOS			= 0x75,
+ SLANG_BC_EOS			= 0x76,
+ SLANG_BC_UNUSED_0x77		= 0x77,
+ SLANG_BC_UNUSED_0x78		= 0x78,
+ SLANG_BC_UNUSED_0x79		= 0x79,
+ SLANG_BC_UNUSED_0x7A		= 0x7A,
+ SLANG_BC_UNUSED_0x7B		= 0x7B,
+ SLANG_BC_UNUSED_0x7C		= 0x7C,
+ SLANG_BC_UNUSED_0x7D		= 0x7D,
+ SLANG_BC_UNUSED_0x7E		= 0x7E,
+ SLANG_BC_UNUSED_0x7F		= 0x7F,
+
+ /* These are used only when compiled with USE_COMBINED_BYTECODES */
+ SLANG_BC_CALL_DIRECT_INTRINSIC= 0x80,
+ SLANG_BC_INTRINSIC_CALL_DIRECT= 0x81,
+ SLANG_BC_CALL_DIRECT_LSTR	= 0x82,
+ SLANG_BC_CALL_DIRECT_SLFUN	= 0x83,
+ SLANG_BC_CALL_DIRECT_RETINTR	= 0x84,
+ SLANG_BC_RET_INTRINSIC	= 0x85,
+ SLANG_BC_CALL_DIRECT_EARG_LVAR= 0x86,
+ SLANG_BC_CALL_DIRECT_LINT	= 0x87,
+ SLANG_BC_CALL_DIRECT_LVAR	= 0x88,
+ SLANG_BC_LLVARIABLE_BINARY	= 0x89,
+ SLANG_BC_LGVARIABLE_BINARY	= 0x8A,
+ SLANG_BC_GLVARIABLE_BINARY	= 0x8B,
+ SLANG_BC_GGVARIABLE_BINARY	= 0x8C,
+ SLANG_BC_LIVARIABLE_BINARY	= 0x8D,
+ SLANG_BC_LDVARIABLE_BINARY	= 0x8E,
+ SLANG_BC_ILVARIABLE_BINARY	= 0x8F,
+ SLANG_BC_DLVARIABLE_BINARY	= 0x90,
+ SLANG_BC_LVARIABLE_BINARY	= 0x91,
+ SLANG_BC_GVARIABLE_BINARY	= 0x92,
+ SLANG_BC_LITERAL_INT_BINARY	= 0x93,
+ SLANG_BC_LITERAL_DBL_BINARY	= 0x94,
+ SLANG_BC_LASSIGN_LLBINARY	= 0x95,
+ SLANG_BC_LASSIGN_LIBINARY	= 0x96,
+ SLANG_BC_LASSIGN_ILBINARY	= 0x97,
+ SLANG_BC_LASSIGN_LDBINARY	= 0x98,
+ SLANG_BC_LASSIGN_DLBINARY	= 0x99,
+ SLANG_BC_RET_LVARIABLE	= 0x9A,
+ SLANG_BC_RET_LITERAL_INT	= 0x9B,
+ SLANG_BC_MANY_LVARIABLE	= 0x9C,
+ SLANG_BC_MANY_LVARIABLE_DIR	= 0x9D,
+ SLANG_BC_LVARIABLE_AGET1	= 0x9E,
+ SLANG_BC_LITERAL_AGET1	= 0x9F,
+ SLANG_BC_LVAR_LVAR_APUT1	= 0xA0,
+ SLANG_BC_LVARIABLE_APUT1	= 0xA1,
+ SLANG_BC_LITERAL_APUT1	= 0xA2,
+ SLANG_BC_LLVARIABLE_BINARY2	= 0xA3,
+ SLANG_BC_SET_LOCLV_LIT_INT	= 0xA4,
+ SLANG_BC_SET_LOCLV_LIT_AGET1	= 0xA5,
+ SLANG_BC_SET_LOCLV_LVAR	= 0xA6,
+ SLANG_BC_SET_LOCLV_LASTBLOCK	= 0xA7,
+ SLANG_BC_LVAR_EARG_LVAR	= 0xA8,
+ SLANG_BC_LVAR_FIELD		= 0xA9,
+ SLANG_BC_BINARY_LASTBLOCK	= 0xAA,
+ SLANG_BC_EARG_LVARIABLE_INTRINSIC	= 0xAB,
+ SLANG_BC_LVAR_LITERAL_INT	= 0xAC,
+ SLANG_BC_BINARY_SET_LOCLVAL	= 0xAD,
+ SLANG_BC_LVAR_AGET_SET_LOCLVAL	= 0xAE,
+ SLANG_BC_LLVAR_BINARY_IF	= 0xAF,
+
+ SLANG_BC_IF_BLOCK		= 0xB0,
+ SLANG_BC_LVAR_SET_FIELD	= 0xB1,
+ SLANG_BC_PVAR_SET_GLOB_LVAL	= 0xB2,
+ SLANG_BC_LVAR_SET_GLOB_LVAL	= 0xB3,
+ SLANG_BC_LIT_AGET1_INT_BINARY= 0xB4,
+ SLANG_BC_BINARY2		= 0xB5,
+ SLANG_BC_LVAR_LIT_AGET1	= 0xB6,
+ SLANG_BC_UNUSED_0xB7		= 0xB7,
+ SLANG_BC_UNUSED_0xB8		= 0xB8,
+ SLANG_BC_UNUSED_0xB9		= 0xB9,
+ SLANG_BC_UNUSED_0xBA		= 0xBA,
+ SLANG_BC_UNUSED_0xBB		= 0xBB,
+ SLANG_BC_UNUSED_0xBC		= 0xBC,
+ SLANG_BC_UNUSED_0xBD		= 0xBD,
+ SLANG_BC_UNUSED_0xBE		= 0xBE,
+ SLANG_BC_UNUSED_0xBF		= 0xBF,
+
+ /* The following do not actually occur in inner_interp. They used
+ * to signify the bytecode has been combined with another.
+ */
+ SLANG_BC_LVARIABLE_COMBINED	= 0xC0,
+ SLANG_BC_GVARIABLE_COMBINED	= 0xC1,
+ SLANG_BC_LITERAL_COMBINED	= 0xC2,
+ SLANG_BC_CALL_DIRECT_COMB	= 0xC3,
+ SLANG_BC_COMBINED		= 0xC4,
+ SLANG_BC_BLOCK_COMBINED	= 0xC5,
+#define SLANG_IS_BC_COMBINED(b) ((0xC0 <= (b)) && ((b) <= 0xC5))
+ SLANG_BC_UNUSED_0xC6		= 0xC6,
+ SLANG_BC_UNUSED_0xC7		= 0xC7,
+ SLANG_BC_UNUSED_0xC8		= 0xC8,
+ SLANG_BC_UNUSED_0xC9		= 0xC9,
+ SLANG_BC_UNUSED_0xCA		= 0xCA,
+ SLANG_BC_UNUSED_0xCB		= 0xCB,
+ SLANG_BC_UNUSED_0xCC		= 0xCC,
+ SLANG_BC_UNUSED_0xCD		= 0xCD,
+ SLANG_BC_UNUSED_0xCE		= 0xCE,
+ SLANG_BC_UNUSED_0xCF		= 0xCF,
+ SLANG_BC_UNUSED_0xD0		= 0xD0,
+ SLANG_BC_UNUSED_0xD1		= 0xD1,
+ SLANG_BC_UNUSED_0xD2		= 0xD2,
+ SLANG_BC_UNUSED_0xD3		= 0xD3,
+ SLANG_BC_UNUSED_0xD4		= 0xD4,
+ SLANG_BC_UNUSED_0xD5		= 0xD5,
+ SLANG_BC_UNUSED_0xD6		= 0xD6,
+ SLANG_BC_UNUSED_0xD7		= 0xD7,
+ SLANG_BC_UNUSED_0xD8		= 0xD8,
+ SLANG_BC_UNUSED_0xD9		= 0xD9,
+ SLANG_BC_UNUSED_0xDA		= 0xDA,
+ SLANG_BC_UNUSED_0xDB		= 0xDB,
+ SLANG_BC_UNUSED_0xDC		= 0xDC,
+ SLANG_BC_UNUSED_0xDD		= 0xDD,
+ SLANG_BC_UNUSED_0xDE		= 0xDE,
+ SLANG_BC_UNUSED_0xDF		= 0xDF,
+ SLANG_BC_UNUSED_0xE0		= 0xE0,
+ SLANG_BC_UNUSED_0xE1		= 0xE1,
+ SLANG_BC_UNUSED_0xE2		= 0xE2,
+ SLANG_BC_UNUSED_0xE3		= 0xE3,
+ SLANG_BC_UNUSED_0xE4		= 0xE4,
+ SLANG_BC_UNUSED_0xE5		= 0xE5,
+ SLANG_BC_UNUSED_0xE6		= 0xE6,
+ SLANG_BC_UNUSED_0xE7		= 0xE7,
+ SLANG_BC_UNUSED_0xE8		= 0xE8,
+ SLANG_BC_UNUSED_0xE9		= 0xE9,
+ SLANG_BC_UNUSED_0xEA		= 0xEA,
+ SLANG_BC_UNUSED_0xEB		= 0xEB,
+ SLANG_BC_UNUSED_0xEC		= 0xEC,
+ SLANG_BC_UNUSED_0xED		= 0xED,
+ SLANG_BC_UNUSED_0xEE		= 0xEE,
+ SLANG_BC_UNUSED_0xEF		= 0xEF,
+ SLANG_BC_UNUSED_0xF0		= 0xF0,
+ SLANG_BC_UNUSED_0xF1		= 0xF1,
+ SLANG_BC_UNUSED_0xF2		= 0xF2,
+ SLANG_BC_UNUSED_0xF3		= 0xF3,
+ SLANG_BC_UNUSED_0xF4		= 0xF4,
+ SLANG_BC_UNUSED_0xF5		= 0xF5,
+ SLANG_BC_UNUSED_0xF6		= 0xF6,
+ SLANG_BC_UNUSED_0xF7		= 0xF7,
+ SLANG_BC_UNUSED_0xF8		= 0xF8,
+ SLANG_BC_UNUSED_0xF9		= 0xF9,
+ SLANG_BC_UNUSED_0xFA		= 0xFA,
+ SLANG_BC_UNUSED_0xFB		= 0xFB,
+ SLANG_BC_UNUSED_0xFC		= 0xFC,
+ SLANG_BC_UNUSED_0xFD		= 0xFD,
+ SLANG_BC_UNUSED_0xFE		= 0xFE,
+ SLANG_BC_UNUSED_0xFF		= 0xFF
+}
+_pSLang_BC_Type;
+
+/* Byte-Code Sub Types (_BCST_) */
+
+/* These are sub_types of SLANG_BC_BLOCK */
+#define SLANG_BCST_ERROR_BLOCK	0x01
+#define SLANG_BCST_EXIT_BLOCK	0x02
+#define SLANG_BCST_USER_BLOCK0	0x03
+#define SLANG_BCST_USER_BLOCK1	0x04
+#define SLANG_BCST_USER_BLOCK2	0x05
+#define SLANG_BCST_USER_BLOCK3	0x06
+#define SLANG_BCST_USER_BLOCK4	0x07
+/* The user blocks MUST be in the above order */
+#define SLANG_BCST_LOOP	0x10
+#define SLANG_BCST_WHILE	0x11
+#define SLANG_BCST_FOR		0x12
+#define SLANG_BCST_FOREVER	0x13
+#define SLANG_BCST_CFOR	0x14
+#define SLANG_BCST_DOWHILE	0x15
+#define SLANG_BCST_FOREACH	0x16 /* obsolete */
+#define SLANG_BCST_TRY		0x17
+#define SLANG_BCST_FOREACH_EARGS	0x18
+
+#define SLANG_BCST_IF		0x20
+#define SLANG_BCST_IFNOT	0x21
+#define SLANG_BCST_ELSE		0x22
+#define SLANG_BCST_ANDELSE	0x23
+#define SLANG_BCST_ORELSE	0x24
+#define SLANG_BCST_SWITCH	0x25
+#define SLANG_BCST_NOTELSE	0x26
+#define SLANG_BCST_SC_OR	0x27
+#define SLANG_BCST_SC_AND	0x28
+
+#define SLANG_BCST_LOOP_ELSE	0x29
+#define SLANG_BCST_LOOP_THEN	0x30
+#define SLANG_BCST_COMPARE 0x31
+
+/* assignment (SLANG_BC_SET_*_LVALUE) subtypes. The order MUST correspond
+ * to the assignment token order with the ASSIGN_TOKEN as the first!
+ */
+#define SLANG_BCST_ASSIGN		0x01
+#define SLANG_BCST_PLUSEQS		0x02
+#define SLANG_BCST_MINUSEQS		0x03
+#define SLANG_BCST_TIMESEQS		0x04
+#define SLANG_BCST_DIVEQS		0x05
+#define SLANG_BCST_BOREQS		0x06
+#define SLANG_BCST_BANDEQS		0x07
+#define SLANG_BCST_PLUSPLUS		0x08
+#define SLANG_BCST_POST_PLUSPLUS	0x09
+#define SLANG_BCST_MINUSMINUS		0x0A
+#define SLANG_BCST_POST_MINUSMINUS	0x0B
+
+typedef union
+{
+#if SLANG_HAS_FLOAT
+ double double_val;
+ float float_val;
+#endif
+#ifdef HAVE_LONG_LONG
+ long long llong_val;
+ unsigned long long ullong_val;
+#endif
+ long long_val;
+ unsigned long ulong_val;
+ VOID_STAR ptr_val;
+ char *s_val;
+ int int_val;
+ unsigned int uint_val;
+ SLang_MMT_Type *ref;
+ SLang_Name_Type *n_val;
+ struct _pSLang_Struct_Type *struct_val;
+ struct _pSLang_Array_Type *array_val;
+ short short_val;
+ unsigned short ushort_val;
+ signed char char_val;
+ unsigned char uchar_val;
+ SLindex_Type index_val;
+ _pSLint16_Type int16_val;
+ _pSLuint16_Type uint16_val;
+ _pSLint32_Type int32_val;
+ _pSLuint32_Type uint32_val;
+#if _pSLANG_INT64_TYPE
+ _pSLint64_Type int64_val;
+ _pSLuint64_Type uint64_val;
+#endif
+}
+_pSL_Object_Union_Type;
+
+typedef struct _pSLang_Object_Type
+{
+ SLtype o_data_type;	 /* SLANG_INT_TYPE, ... */
+ _pSL_Object_Union_Type v;
+}
+SLang_Object_Type;
+
+typedef struct
+{
+ char *name;
+ SLang_Name_Type *next;
+ char name_type;
+
+ SLang_Object_Type obj;
+}
+SLang_Global_Var_Type;
+
+struct _pSLang_MMT_Type
+{
+ SLtype data_type;	 /* int, string, etc... */
+ VOID_STAR user_data;	 /* address of user structure */
+ unsigned int count;		 /* number of references */
+};
+
+extern int _pSLang_pop_object_of_type (SLtype, SLang_Object_Type *, int);
+
+typedef struct
+{
+ SLFUTURE_CONST char *name;			 /* slstring */
+ SLang_Object_Type obj;
+}
+_pSLstruct_Field_Type;
+
+typedef struct _pSLang_Struct_Type
+{
+ _pSLstruct_Field_Type *fields;
+ unsigned int nfields;	 /* number used */
+ unsigned int num_refs;
+ /* user-defined methods */
+ SLang_Name_Type *destroy_method;
+}
+_pSLang_Struct_Type;
+
+extern int _pSLstruct_init (void);
+extern int _pSLstruct_define_struct (void);
+extern int _pSLstruct_define_struct2 (void);
+extern int _pSLstruct_define_typedef (void);
+
+extern SLang_Object_Type *_pSLstruct_get_field_value (SLang_Struct_Type *, SLCONST char *);
+extern int _pSLstruct_push_field_ref (SLFUTURE_CONST char *);
+extern int _pSLstruct_push_field (SLang_Struct_Type *s, SLFUTURE_CONST char *name, int do_free);
+extern int _pSLstruct_pop_field (SLang_Struct_Type *s, SLFUTURE_CONST char *name, int do_free);
+
+extern int _pSLang_get_qualifiers_intrin (SLang_Struct_Type **);
+
+struct _pSLang_Ref_Type
+{
+ int num_refs;
+ VOID_STAR data;
+ unsigned int sizeof_data;
+ int data_is_nametype;	 /* used for optimization */
+ int (*deref_assign)(VOID_STAR);
+ int (*deref) (VOID_STAR);
+ char *(*string)(VOID_STAR);		 /* returns a malloced string */
+ void (*destroy) (VOID_STAR);
+ int (*is_initialized) (VOID_STAR);
+ int (*uninitialize) (VOID_STAR);
+};
+
+extern int _pSLang_dereference_ref (SLang_Ref_Type *);
+extern int _pSLang_deref_assign (SLang_Ref_Type *);
+extern int SLang_push_ref (SLang_Ref_Type *);
+extern int _pSLang_push_nt_as_ref (SLang_Name_Type *);
+extern SLang_Ref_Type *_pSLang_new_ref (unsigned int);
+
+extern int _pSL_increment_frame_pointer (void);
+extern int _pSL_decrement_frame_pointer (void);
+
+extern int SLang_pop(SLang_Object_Type *);
+extern void SLang_free_object (SLang_Object_Type *);
+extern int _pSLanytype_typecast (SLtype, VOID_STAR, SLuindex_Type,
+				 SLtype, VOID_STAR);
+extern void _pSLstring_intrinsic (void);
+extern int _pSLformat_as_binary (unsigned int min_num_bits, int use_binary_prefix);
+
+#if 0
+/* NULL not allowed here */
+extern char *_pSLmalloced_to_slstring (char *, unsigned int);
+/* But here it is ok */
+extern int _pSLpush_malloced_string (char *, unsigned int);
+#endif
+
+/* These functions are used to create slstrings of a fixed length. Be
+ * very careful how they are used. In particular, if len bytes are allocated,
+ * then the string must be len characters long, no more and no less.
+ */
+extern char *_pSLallocate_slstring (size_t);
+extern char *_pSLcreate_via_alloced_slstring (char *, size_t);
+extern void _pSLunallocate_slstring (char *, size_t);
+extern int _pSLpush_alloced_slstring (char *, size_t);
+
+extern size_t _pSLstring_bytelen (SLCONST SLstr_Type *);
+extern void _pSLang_free_slstring (SLstr_Type *); /* slstring required and assumed */
+extern SLstr_Hash_Type _pSLstring_get_hash (SLstr_Type *s); /* slstring required */
+
+typedef struct
+{
+ char **buf;
+ unsigned int max_num;
+ unsigned int num;
+ unsigned int delta_num;
+ int is_malloced;		 /* non-zero if object was malloced */
+}
+_pSLString_List_Type;
+
+/* Note that _pSLstring_list_append makes no copy of the object-- it steals it.
+ * For a copy, use _pSLstring_list_append_copy */
+extern int _pSLstring_list_append (_pSLString_List_Type *, char *);
+extern int _pSLstring_list_append_copy (_pSLString_List_Type *, char *);
+extern int _pSLstring_list_init (_pSLString_List_Type *, unsigned int, unsigned int);
+extern _pSLString_List_Type *_pSLstring_list_new (unsigned int, unsigned int);
+extern void _pSLstring_list_delete (_pSLString_List_Type *);
+extern int _pSLstring_list_push (_pSLString_List_Type *, int);
+extern SLang_Array_Type *_pSLstrings_to_array (char **strs, unsigned int n);
+
+/* This function assumes that s is an slstring. */
+extern SLCONST char *_pSLstring_dup_slstring (SLCONST char *);
+extern int _pSLang_dup_and_push_slstring (SLCONST char *);
+
+extern int _pSLang_init_import (void);
+extern int _pSLinit_exceptions (void);
+
+/* This function checks to see if the referenced object is initialized */
+extern int _pSLang_is_ref_initialized (SLang_Ref_Type *);
+extern int _pSLcheck_identifier_syntax (SLCONST char *);
+extern int _pSLang_uninitialize_ref (SLang_Ref_Type *);
+
+extern int _pSLpush_slang_obj (SLang_Object_Type *);
+extern int _pSLslang_copy_obj (SLang_Object_Type *obja, SLang_Object_Type *objb);
+
+extern char *_pSLexpand_escaped_char(char *, char *, SLwchar_Type *, int *);
+extern void _pSLexpand_escaped_string (char *, char *, char *);
+
+extern int _pSLpush_dollar_string (SLFUTURE_CONST char *);
+
+/* returns a pointer to an SLstring string-- use SLang_free_slstring */
+extern char *_pSLstringize_object (SLang_Object_Type *);
+extern int _pSLdump_objects (char *, SLang_Object_Type *, unsigned int, int);
+
+extern SLang_Object_Type *_pSLang_get_run_stack_pointer (void);
+extern SLang_Object_Type *_pSLang_get_run_stack_base (void);
+extern int _pSLang_dump_stack (void);
+extern int _pSLang_peek_at_stack2 (SLtype *);
+extern int _pSLang_restart_arg_list (int nargs);
+
+struct _pSLang_NameSpace_Type
+{
+ struct _pSLang_NameSpace_Type *next;
+ SLFUTURE_CONST char *name;	 /* this is the load_type name */
+ SLFUTURE_CONST char *namespace_name;/* this name is assigned by implements */
+ SLFUTURE_CONST char *private_name;
+ unsigned int table_size;
+ SLang_Name_Type **table;
+};
+
+extern int _pSLns_check_name (SLFUTURE_CONST char *);
+extern SLang_NameSpace_Type *_pSLns_new_namespace (SLFUTURE_CONST char *, unsigned int);
+extern SLang_NameSpace_Type *_pSLns_allocate_namespace (SLFUTURE_CONST char *, unsigned int);
+extern void _pSLns_deallocate_namespace (SLang_NameSpace_Type *);
+extern SLang_NameSpace_Type *_pSLns_find_namespace (SLCONST char *);
+extern int _pSLns_set_namespace_name (SLang_NameSpace_Type *, SLFUTURE_CONST char *);
+extern SLang_Array_Type *_pSLnspace_apropos (SLang_NameSpace_Type *, SLFUTURE_CONST char *, unsigned int);
+extern void _pSLang_use_namespace_intrinsic (char *name);
+extern SLFUTURE_CONST char *_pSLang_cur_namespace_intrinsic (void);
+extern SLang_Array_Type *_pSLang_apropos (SLFUTURE_CONST char *, SLFUTURE_CONST char *, unsigned int);
+extern void _pSLang_implements_intrinsic (SLFUTURE_CONST char *);
+extern SLang_Array_Type *_pSLns_list_namespaces (void);
+extern SLang_Name_Type *_pSLns_locate_hashed_name (SLang_NameSpace_Type *, SLCONST char *, SLstr_Hash_Type);
+extern int _pSLns_add_hashed_name (SLang_NameSpace_Type *, SLang_Name_Type *, SLstr_Hash_Type);
+extern SLang_NameSpace_Type *_pSLns_find_object_namespace (SLang_Name_Type *nt);
+extern SLang_Name_Type *_pSLns_locate_name (SLang_NameSpace_Type *, SLCONST char *);
+extern SLang_NameSpace_Type *_pSLns_get_private_namespace (SLFUTURE_CONST char *name, SLFUTURE_CONST char *nsname);
+extern SLang_NameSpace_Type *_pSLns_create_namespace2 (SLFUTURE_CONST char *name, SLFUTURE_CONST char *nsname);
+extern void _pSLns_delete_namespaces (void);
+
+/* The long-long constants functions need to be fixed in slang.h. This will
+ * have to wait for a major version change.
+ */
+#ifdef HAVE_LONG_LONG
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ SLang_Name_Type *next;
+ char name_type;
+
+ SLtype data_type;
+ long long value;
+}
+_pSLang_LLConstant_Type;
+SL_EXTERN int _pSLns_add_llconstant_table (SLang_NameSpace_Type *, _pSLang_LLConstant_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int _pSLadd_llconstant_table (_pSLang_LLConstant_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int _pSLns_add_llconstant (SLang_NameSpace_Type *, SLFUTURE_CONST char *, SLtype, long long);
+# define _pMAKE_LLCONSTANT_T(n,val,T) \
+ {(n),NULL, SLANG_LLCONSTANT, T, (long long)(val)}
+# define _pSLANG_END_LLCONST_TABLE _pMAKE_LLCONSTANT_T(NULL,0,0)
+#endif
+
+extern int _pSLang_Trace;
+extern char SLCONST *_pSLang_current_function_name (void);
+
+extern int _pSLang_trace_fun(SLFUTURE_CONST char *);
+
+/* This is a bitmapped variable */
+/* extern int _pSLang_Compile_Line_Num_Info; */
+#if SLANG_HAS_BOSEOS
+extern int _pSLang_Compile_BOSEOS;
+#define SLANG_BOSEOS_VALUE_BITS		0x0FF
+#define SLANG_BOSEOS_PREPROC		0x100
+extern int _pSLang_Compile_BOFEOF;
+extern int _pSLang_init_boseos (void);
+extern int _pSLcall_bos_handler (SLFUTURE_CONST char *, int);
+extern int _pSLcall_eos_handler (void);
+extern int _pSLcall_bof_handler (SLFUTURE_CONST char *, SLFUTURE_CONST char *);
+extern int _pSLcall_eof_handler (void);
+extern int _pSLcall_debug_hook (SLFUTURE_CONST char *file, int linenum);
+/* extern int _pSLcall_debug_hook (char *file, int linenum, char *funct); */
+#endif
+
+extern char *_pSLstring_dup_hashed_string (SLCONST char *, SLstr_Hash_Type);
+extern char *_pSLstring_make_hashed_string (SLCONST char *, SLstrlen_Type, SLstr_Hash_Type *);
+extern void _pSLfree_hashed_string (SLCONST char *, size_t, SLstr_Hash_Type);
+SLstr_Hash_Type _pSLstring_hash (SLCONST unsigned char *, SLCONST unsigned char *);
+extern int _pSLinit_slcomplex (void);
+
+extern int _pSLang_init_slstrops (void);
+extern int _pSLstrops_do_sprintf_n (int);
+extern int _pSLang_sscanf (void);
+extern double _pSLang_atof (SLFUTURE_CONST char *);
+
+extern int _pSLang_init_bstring (void);
+extern SLang_Foreach_Context_Type *_pSLbstring_foreach_open (SLtype type, unsigned int num);
+extern void _pSLbstring_foreach_close (SLtype type, SLang_Foreach_Context_Type *c);
+extern int _pSLbstring_foreach (SLtype type, SLang_Foreach_Context_Type *c);
+
+extern int _pSLang_init_sltime (void);
+extern int _pSLusleep (unsigned long);
+
+#define _pSLANG_BYTEORDER_NATIVE	0
+#define _pSLANG_BYTEORDER_BIGE		1
+#define _pSLANG_BYTEORDER_LILE		2
+extern void _pSLpack (void);
+extern void _pSLunpack (char *, SLang_BString_Type *);
+extern void _pSLpack_pad_format (char *);
+extern SLstrlen_Type _pSLpack_compute_size (char *);
+extern SLang_Array_Type *_pSLpack_byteswap_array (SLang_Array_Type *at, int from, int to);
+
+/* frees upon error. NULL __NOT__ ok. */
+extern int _pSLang_push_slstring (char *);
+
+extern SLtype _pSLarith_promote_type (SLtype);
+extern int _pSLarith_get_precedence (SLtype);
+extern int _pSLarith_typecast (SLtype, VOID_STAR, SLuindex_Type,
+			 SLtype, VOID_STAR);
+
+extern int SLang_push(SLang_Object_Type *);
+extern int SLadd_global_variable (SLCONST char *);
+
+extern int _pSLdo_pop (void);
+extern unsigned int _pSLsys_getkey (void);
+extern int _pSLsys_input_pending (int);
+#ifdef IBMPC_SYSTEM
+extern unsigned int _pSLpc_convert_scancode (unsigned int, unsigned int, int);
+#define _pSLTT_KEY_SHIFT	1
+#define _pSLTT_KEY_CTRL		2
+#define _pSLTT_KEY_ALT		4
+#endif
+
+typedef struct _pSLterminfo_Type SLterminfo_Type;
+extern SLterminfo_Type *_pSLtt_tigetent (SLCONST char *);
+extern void _pSLtt_tifreeent (SLterminfo_Type *);
+extern char *_pSLtt_tigetstr (SLterminfo_Type *, SLCONST char *);
+extern int _pSLtt_tigetnum (SLterminfo_Type *, SLCONST char *);
+extern int _pSLtt_tigetflag (SLterminfo_Type *, SLCONST char *);
+
+#if defined(REAL_UNIX_SYSTEM) || defined(VMS)
+extern void SLtt_init_keypad (void);
+extern void SLtt_deinit_keypad (void);
+#endif
+
+#if SLTT_HAS_NON_BCE_SUPPORT
+extern int _pSLtt_get_bce_color_offset (void);
+#endif
+extern void (*_pSLtt_color_changed_hook)(void);
+extern int _pSLtt_init_cmdline_mode (void);
+extern void _pSLtt_cmdline_mode_reset (void);
+
+extern int _pSLsmg_init_smg_cmdline (void);
+
+extern unsigned char SLang_Input_Buffer SL_MAX_INPUT_BUFFER_LEN;
+
+typedef struct SL_OOBinary_Type
+{
+ SLtype data_type;	 /* partner type for binary op */
+
+ int (*binary_function)_PROTO((int,
+				 SLtype, VOID_STAR, SLuindex_Type,
+				 SLtype, VOID_STAR, SLuindex_Type,
+				 VOID_STAR));
+
+ int (*binary_result) _PROTO((int, SLtype, SLtype, SLtype *));
+ struct SL_OOBinary_Type *next;
+}
+SL_OOBinary_Type;
+
+typedef struct _pSL_Typecast_Type
+{
+ SLtype data_type;	 /* to_type */
+ int allow_implicit;
+
+ int (*typecast)_PROTO((SLtype, VOID_STAR, SLuindex_Type,
+			 SLtype, VOID_STAR));
+ struct _pSL_Typecast_Type *next;
+}
+SL_Typecast_Type;
+
+struct _pSLang_Class_Type
+{
+ SLclass_Type cl_class_type;	 /* vector, scalar, mmt, pointer */
+
+ unsigned int cl_data_type;	 /* SLANG_INTEGER_TYPE, etc... */
+ char *cl_name;			 /* slstring type */
+
+ size_t cl_sizeof_type;
+ VOID_STAR cl_transfer_buf;	 /* cl_sizeof_type bytes*/
+
+ /* Methods */
+
+ /* Most of the method functions are prototyped:
+ * int method (SLtype type, VOID_STAR addr);
+ * Here, @type@ represents the type of object that the method is asked
+ * to deal with. The second parameter @addr@ will contain the ADDRESS of
+ * the object. For example, if type is SLANG_INT_TYPE, then @addr@ will
+ * actually be int *. Similary, if type is SLANG_STRING_TYPE,
+ * then @addr@ will contain the address of the string, i.e., char **.
+ */
+
+ void (*cl_destroy)_PROTO((SLtype, VOID_STAR));
+ /* Prototype: void destroy(unsigned type, VOID_STAR val)
+ * Called to delete/free the object */
+
+ char *(*cl_string)_PROTO((SLtype, VOID_STAR));
+ /* Prototype: char *to_string (SLtype t, VOID_STAR p);
+ * Here p is a pointer to the object for which a string representation
+ * is to be returned. The returned pointer is to be a MALLOCED string.
+ */
+
+ /* Prototype: void push(SLtype type, VOID_STAR v);
+ * Push a copy of the object of type @type@ at address @v@ onto the
+ * stack.
+ */
+ int (*cl_push)_PROTO((SLtype, VOID_STAR));
+
+ /* Prototype: int pop(SLtype type, VOID_STAR v);
+ * Pops value from stack and assign it to object, whose address is @v@.
+ */
+ int (*cl_pop)_PROTO((SLtype, VOID_STAR));
+
+ /* mul2, sign, etc... */
+ int (*cl_unary_op_result_type)_PROTO((int, SLtype, SLtype *));
+ int (*cl_unary_op)_PROTO((int, SLtype, VOID_STAR, SLuindex_Type, VOID_STAR));
+
+#if 0
+ int (*cl_arith_unary_op_result_type)_PROTO((int, SLtype, SLtype *));
+ int (*cl_arith_unary_op)_PROTO((int, SLtype, VOID_STAR, SLuindex_Type, VOID_STAR));
+#endif
+ int (*cl_app_unary_op_result_type)_PROTO((int, SLtype, SLtype *));
+ int (*cl_app_unary_op)_PROTO((int, SLtype, VOID_STAR, SLuindex_Type, VOID_STAR));
+
+ /* If this function is non-NULL, it will be called for sin, cos, etc... */
+
+ int (*cl_math_op)_PROTO((int, SLtype, VOID_STAR, SLuindex_Type, VOID_STAR));
+ int (*cl_math_op_result_type)_PROTO((int, SLtype, SLtype *));
+
+ SL_OOBinary_Type *cl_binary_ops;
+ SL_Typecast_Type *cl_typecast_funs;
+
+ void (*cl_byte_code_destroy)_PROTO((SLtype, VOID_STAR));
+ void (*cl_user_destroy_fun)_PROTO((SLtype, VOID_STAR));
+ int (*cl_init_array_object)_PROTO((SLtype, VOID_STAR));
+ int (*cl_datatype_deref)_PROTO((SLtype));
+ SLang_Struct_Type *cl_struct_def;
+ int (*cl_dereference) _PROTO((SLtype, VOID_STAR));
+
+ /* cl_a* functions deal with functions that have array addresses. For
+ * scalar and vector types, there is no difference. However, for vector
+ * types such as Complex, which is stored as double2, the address is
+ * the address of the first byte, and not the object itself.
+ */
+ int (*cl_acopy) (SLtype, VOID_STAR, VOID_STAR);
+ int (*cl_apop) _PROTO((SLtype, VOID_STAR));
+ int (*cl_apush) _PROTO((SLtype, VOID_STAR));
+ int (*cl_push_literal) _PROTO((SLtype, VOID_STAR));
+ void (*cl_adestroy)_PROTO((SLtype, VOID_STAR));
+ int (*cl_push_intrinsic)_PROTO((SLtype, VOID_STAR));
+ int (*cl_void_typecast)_PROTO((SLtype, VOID_STAR, SLuindex_Type, SLtype, VOID_STAR));
+
+ int (*cl_anytype_typecast)_PROTO((SLtype, VOID_STAR, SLuindex_Type, SLtype, VOID_STAR));
+
+ /* Array access functions */
+ int (*cl_aput) (SLtype, unsigned int);
+ int (*cl_aget) (SLtype, unsigned int);
+ int (*cl_anew) (SLtype, unsigned int);
+
+ /* length method */
+ int (*cl_length) (SLtype, VOID_STAR, SLuindex_Type *);
+
+ /* foreach */
+ SLang_Foreach_Context_Type *(*cl_foreach_open) (SLtype, unsigned int);
+ void (*cl_foreach_close) (SLtype, SLang_Foreach_Context_Type *);
+ int (*cl_foreach) (SLtype, SLang_Foreach_Context_Type *);
+
+ /* Structure access: get and put (assign to) fields */
+ int (*cl_sput) (SLtype, SLFUTURE_CONST char *);
+ int (*cl_sget) (SLtype, SLFUTURE_CONST char *);
+
+ /* File I/O */
+ int (*cl_fread) (SLtype, FILE *, VOID_STAR, SLstrlen_Type, SLstrlen_Type *);
+ int (*cl_fwrite) (SLtype, FILE *, VOID_STAR, SLstrlen_Type, SLstrlen_Type *);
+ int (*cl_fdread) (SLtype, int, VOID_STAR, SLstrlen_Type, SLstrlen_Type *);
+ int (*cl_fdwrite) (SLtype, int, VOID_STAR, SLstrlen_Type, SLstrlen_Type *);
+
+ int (*cl_to_bool) (SLtype, int *);
+
+ int (*cl_cmp)(SLtype, VOID_STAR, VOID_STAR, int *);
+ int (*cl_eqs)(SLtype, VOID_STAR, SLtype, VOID_STAR);
+
+ /* required for any object that takes advantage of __tmp optimization */
+ void (*cl_inc_ref)(SLtype, VOID_STAR, int);
+
+ SL_OOBinary_Type *cl_void_binary_this;
+ SL_OOBinary_Type *cl_this_binary_void;
+
+ int is_container;
+ int is_struct;
+};
+#define SLANG_CLASS_IS_SLSTRUCT(cl) ((cl)->is_struct != 0)
+
+extern int _pSLregister_types (void);
+extern SLang_Class_Type *_pSLclass_get_class (SLtype);
+extern VOID_STAR _pSLclass_get_ptr_to_value (SLang_Class_Type *, SLang_Object_Type *);
+extern void _pSLclass_type_mismatch_error (SLtype, SLtype);
+extern int _pSLclass_init (void);
+extern int _pSLclass_copy_class (SLtype, SLtype);
+
+extern int (*_pSLclass_get_typecast (SLtype, SLtype, int))
+(SLtype, VOID_STAR, SLuindex_Type,
+ SLtype, VOID_STAR);
+
+extern int (*_pSLclass_get_binary_fun (int, SLang_Class_Type *, SLang_Class_Type *, SLang_Class_Type **, int))
+(int,
+ SLtype, VOID_STAR, SLuindex_Type,
+ SLtype, VOID_STAR, SLuindex_Type,
+ VOID_STAR);
+
+extern int (*_pSLclass_get_unary_fun (int, SLang_Class_Type *, SLang_Class_Type **, int))
+(int, SLtype, VOID_STAR, SLuindex_Type, VOID_STAR);
+
+#if 0
+extern int _pSLclass_add_arith_unary_op (SLtype type,
+					int (*f)(int,
+						 SLtype, VOID_STAR, unsigned int,
+						 VOID_STAR),
+					int (*r)(int, SLtype, SLtype *));
+#endif
+
+extern int _pSLclass_get_unary_opcode (SLCONST char *name);
+extern int _pSLclass_get_binary_opcode (SLCONST char *name);
+extern int _pSLclass_is_same_obj (SLang_Object_Type *a, SLang_Object_Type *b);
+extern int _pSLclass_obj_eqs (SLang_Object_Type *a, SLang_Object_Type *b);
+
+extern int _pSLarith_register_types (void);
+extern SLtype _pSLarith_Arith_Types ;
+
+extern int _pSLang_ref_is_callable (SLang_Ref_Type *);
+extern int _pSLang_is_arith_type (SLtype);
+extern void _pSLang_set_arith_type (SLtype, unsigned char);
+#if SLANG_OPTIMIZE_FOR_SPEED
+extern SLclass_Type _pSLang_get_class_type (SLtype);
+extern void _pSLang_set_class_info (SLtype, SLang_Class_Type *);
+extern int _pSLarray_bin_op (SLang_Object_Type *, SLang_Object_Type *, int);
+extern int _pSLarray1d_push_elem (SLang_Array_Type *at, SLindex_Type idx);
+#endif
+extern int _pSLarith_bin_op (SLang_Object_Type *, SLang_Object_Type *, int);
+
+/* Does not perform any range checking. It is up to the caller.
+ * If *atp!=NULL, then it is an array of indices.
+ */
+extern int _pSLarray_pop_index (unsigned int num_elements, SLang_Array_Type **ind_atp, SLindex_Type *ind);
+
+/* Special treatment for signed chars */
+extern int _pSLang_pop_wchar (SLwchar_Type *wcp);
+
+extern int _pSLarray_add_bin_op (SLtype);
+extern int _pSLarray_push_elem_ref (void);
+extern int _pSLang_push_array (SLang_Array_Type *, int); /* NULL not allowed */
+
+typedef struct
+{
+ SLCONST char *name;
+ SLang_Name_Type *next;
+ char name_type;
+
+ int unary_op;
+}
+SLang_Arith_Unary_Type;
+extern int _pSLadd_arith_unary_table (SLang_Arith_Unary_Type *tbl, SLFUTURE_CONST char *);
+
+typedef struct
+{
+ SLCONST char *name;
+ SLang_Name_Type *next;
+ char name_type;
+
+ int binary_op;
+}
+SLang_Arith_Binary_Type;
+extern int _pSLadd_arith_binary_table (SLang_Arith_Binary_Type *tbl, SLFUTURE_CONST char *);
+
+extern int _pSLang_do_binary_ab (int op, SLang_Object_Type *obja, SLang_Object_Type *objb);
+
+extern int _pSLang_call_funptr (SLang_Name_Type *);
+extern void _pSLset_double_format (SLCONST char *);
+extern SLCONST char *_pSLget_double_format (void);
+extern SLang_Name_Type *_pSLlocate_global_name (SLCONST char *);
+extern SLang_Name_Type *_pSLlocate_name (SLCONST char *);
+
+extern SLFUTURE_CONST char *_pSLdefines;
+
+#define SL_ERRNO_NOT_IMPLEMENTED	0x7FFF
+extern int _pSLerrno_errno;
+extern int _pSLerrno_init (void);
+extern SLFUTURE_VOID *_SLcalloc (SLstrlen_Type, SLstrlen_Type);
+extern SLFUTURE_VOID *_SLrecalloc (SLFUTURE_VOID *, SLstrlen_Type, SLstrlen_Type);
+
+extern int _pSLstdio_fdopen (char *, int, char *);
+extern void _pSLfclose_fdopen_fp (SLang_MMT_Type *);
+
+extern void _pSLstruct_pop_args (int *);
+extern void _pSLstruct_push_args (SLang_Array_Type *);
+
+extern int _pSLang_init_sllist (void);
+extern int _pSLlist_inline_list (void);
+
+extern int _pSLarray_aput1 (unsigned int);
+extern int _pSLarray_aput (void);
+extern int _pSLarray_aget (void);
+extern int _pSLarray_aget1 (unsigned int);
+extern int _pSLarray_inline_implicit_array (void);
+extern int _pSLarray_inline_implicit_arrayn (void);
+extern int _pSLarray_inline_array (void);
+extern int _pSLarray_wildcard_array (void);
+
+extern int
+_pSLarray_typecast (SLtype, VOID_STAR, SLuindex_Type,
+		 SLtype, VOID_STAR, int);
+
+extern int _pSLarray_aput_transfer_elem (SLang_Array_Type *, SLindex_Type *,
+					VOID_STAR, size_t, int);
+extern int _pSLarray_aget_transfer_elem (SLang_Array_Type *, SLindex_Type *,
+					VOID_STAR, size_t, int);
+extern void _pSLarray_free_array_elements (SLang_Class_Type *, VOID_STAR, SLuindex_Type);
+
+extern SLang_Foreach_Context_Type *
+_pSLarray_cl_foreach_open (SLtype, unsigned int);
+extern void _pSLarray_cl_foreach_close (SLtype, SLang_Foreach_Context_Type *);
+extern int _pSLarray_cl_foreach (SLtype, SLang_Foreach_Context_Type *);
+
+extern int _pSLarray_matrix_multiply (void);
+extern void (*_pSLang_Matrix_Multiply)(void);
+
+extern int _pSLarray_next_index (SLindex_Type *, SLindex_Type *, unsigned int);
+
+extern int _pSLarray_init_slarray (void);
+
+extern int _pSLassoc_aput (SLtype, unsigned int);
+extern int _pSLassoc_aget (SLtype, unsigned int);
+extern int _pSLassoc_inc_value (unsigned int, int val);
+
+extern int _pSLcompile_push_context (SLang_Load_Type *);
+extern int _pSLcompile_pop_context (void);
+extern int _pSLang_Auto_Declare_Globals;
+extern int _pSLang_Load_File_Verbose;
+
+typedef struct _pSLtoken_String_List_Type
+{
+ struct _pSLtoken_String_List_Type *next;
+ unsigned int len;
+ char buf1;			 /* rest of bytes follow */
+}
+_pSLtoken_String_List_Type;
+
+typedef unsigned char _pSLtok_Type;
+typedef struct
+{
+ _pSLtok_Type type;			 /* bstring_token */
+ unsigned int num;
+
+ _pSLtoken_String_List_Type *list;
+ union
+ {
+	SLFUTURE_CONST char *s_val;		 /* (SLstring) concatenated strings */
+	SLang_BString_Type *b_val; /* concatenated bstrings */
+ } v;
+ SLstr_Hash_Type hash;		 /* for v.s_val */
+ unsigned int len;		 /* length of v.?_val */
+}
+_pSLang_Multiline_String_Type;
+
+typedef struct _pSLang_Token_Type
+{
+ union
+ {
+	long long_val;
+	unsigned long ulong_val;
+#ifdef HAVE_LONG_LONG
+	long long llong_val;
+	unsigned long long ullong_val;
+#endif
+	/* Note that it is not wise to put a double field in the union because
+	 * when reading a preparsed file, I want to keep the user-specified
+	 * form to preserve the precision. Using a union member would mean
+	 * converting the double to a string when creating a preparsed file.
+	 * We can avoid the issues associated with this by just storing
+	 * floating point values as strings.
+	 */
+	SLFUTURE_CONST char *s_val;		 /* Used for IDENT_TOKEN, DOUBLE_TOKEN, etc... */
+
+	SLang_BString_Type *b_val;
+	_pSLang_Multiline_String_Type *multistring_val;
+ } v;
+ void (*free_val_func)(struct _pSLang_Token_Type *);
+ unsigned int num_refs;
+ unsigned long hash;		 /* hash for slstring, and length for _BSTRING */
+#define SLTOKEN_IS_NEGATIVE		0x001
+#define SLTOKEN_OVERFLOW_CHECKED	0x002
+#define SLTOKEN_IS_HEX			0x004
+#define SLTOKEN_IS_BINARY		0x008
+#define SLTOKEN_TYPE_INTEGER		0x100
+#define SLTOKEN_TYPE_FLOAT		0x200
+#define SLTOKEN_TYPE_NUMBER		(SLTOKEN_TYPE_INTEGER|SLTOKEN_TYPE_FLOAT)
+#define SLTOKEN_VALUE_IS_RESERVED	0x400
+ int flags;
+
+#if SLANG_HAS_DEBUG_CODE
+ int line_number;
+#endif
+ struct _pSLang_Token_Type *next; /* used for token lists */
+ _pSLtok_Type type;
+}
+_pSLang_Token_Type;
+
+/* return token type or EOF_TOKEN upon error */
+extern _pSLtok_Type _pSLtoken_init_slstring_token (_pSLang_Token_Type *, _pSLtok_Type,
+						 SLCONST char *, SLstrlen_Type);
+
+extern void _pSLcompile (_pSLang_Token_Type *);
+extern void (*_pSLcompile_ptr)(_pSLang_Token_Type *);
+
+/* slmisc.c */
+extern char *_pSLskip_whitespace (SLCONST char *s);
+
+/* slospath.c */
+extern char *_pSLpath_find_file (SLFUTURE_CONST char *, int); /* slstring returned */
+
+/* Read but do not set this variable. */
+extern volatile int _pSLang_Error;
+
+extern int _pSLutf8_mode;
+extern int _pSLinterp_UTF8_Mode;	 /* non-zero for interpreter */
+extern int _pSLtt_UTF8_Mode;
+
+extern SLuchar_Type *_pSLinterp_decode_wchar (SLuchar_Type *u,
+					 SLuchar_Type *umax,
+					 SLwchar_Type *chp);
+
+extern SLuchar_Type *_pSLinterp_encode_wchar (SLwchar_Type wch,
+					 SLuchar_Type *buf,
+					 unsigned int *encoded_lenp);
+
+/* *** TOKENS *** */
+
+/* Note that that tokens corresponding to ^J, ^M, and ^Z should not be used.
+ * This is because a file that contains any of these characters will
+ * have an OS dependent interpretation, e.g., ^Z is EOF on MSDOS.
+ */
+
+/* Special tokens */
+#define ILLEGAL_TOKEN	0x00	 /* no token has this value */
+#define EOF_TOKEN	0x01
+#define RPN_TOKEN	0x02
+#define NL_TOKEN	0x03
+#define NOP_TOKEN	0x05
+#define FARG_TOKEN	0x06
+#define TMP_TOKEN	0x07
+#define QUALIFIER_TOKEN	0x08
+
+#define RESERVED1_TOKEN	0x0A	 /* \n */
+#define RESERVED2_TOKEN	0x0D	 /* \r */
+
+/* Literal tokens */
+#define CHAR_TOKEN	0x10
+#define UCHAR_TOKEN	0x11
+#define SHORT_TOKEN	0x12
+#define USHORT_TOKEN	0x13
+#define INT_TOKEN	0x14
+#define UINT_TOKEN	0x15
+#define LONG_TOKEN	0x16
+#define ULONG_TOKEN	0x17
+#define IS_INTEGER_TOKEN(x) ((x >= CHAR_TOKEN) && (x <= ULONG_TOKEN))
+#define FLOAT_TOKEN	0x18
+#define DOUBLE_TOKEN	0x19
+#define RESERVED3_TOKEN	0x1A	 /* ^Z */
+#define COMPLEX_TOKEN	0x1B
+#define STRING_TOKEN 0x1C
+#define BSTRING_TOKEN	0x1D
+#define _BSTRING_TOKEN	0x1E	 /* byte-compiled BSTRING */
+#define STRING_DOLLAR_TOKEN	0x1F
+
+/* Tokens that can be LVALUES */
+#define IDENT_TOKEN	0x20
+#define ARRAY_TOKEN	0x21
+#define DOT_TOKEN	0x22
+#define IS_LVALUE_TOKEN (((t) <= DOT_TOKEN) && ((t) >= IDENT_TOKEN))
+#define DOT_METHOD_CALL_TOKEN		0x23
+
+#define ESC_STRING_TOKEN	0x24 /* only appears in slc file */
+#define ESC_BSTRING_TOKEN	0x25 /* only appears in slc file */
+
+/* Flags for struct fields */
+#define STATIC_TOKEN	0x26
+#define READONLY_TOKEN	0x27
+#define PRIVATE_TOKEN	0x28
+#define PUBLIC_TOKEN	0x29
+
+/* Punctuation tokens */
+#define OBRACKET_TOKEN	0x2a
+#define CBRACKET_TOKEN	0x2b
+#define OPAREN_TOKEN	0x2c
+#define CPAREN_TOKEN	0x2d
+#define OBRACE_TOKEN	0x2e
+#define CBRACE_TOKEN	0x2f
+
+#define COMMA_TOKEN	0x31
+#define SEMICOLON_TOKEN	0x32
+#define COLON_TOKEN	0x33
+#define NAMESPACE_TOKEN	0x34
+#define QUESTION_TOKEN	0x35
+
+/* Operators */
+/* The order here must match the order in the Binop_Level table in slparse.c */
+#define FIRST_BINARY_OP	0x36
+#define SC_AND_TOKEN	0x36
+#define SC_OR_TOKEN	0x37
+#define POW_TOKEN	0x38
+#define ADD_TOKEN	0x39
+#define SUB_TOKEN	0x3a
+#define TIMES_TOKEN	0x3b
+#define DIV_TOKEN	0x3c
+
+#define LT_TOKEN	0x3d
+#define LE_TOKEN	0x3e
+#define GT_TOKEN	0x3f
+#define GE_TOKEN	0x40
+#define EQ_TOKEN	0x41
+#define NE_TOKEN	0x42
+#define IS_COMPARE_OP(x) (((x) >= LT_TOKEN) && ((x) <= NE_TOKEN))
+
+#define AND_TOKEN	0x43
+#define OR_TOKEN	0x44
+#define MOD_TOKEN	0x45
+#define BAND_TOKEN	0x46
+#define SHL_TOKEN	0x47
+#define SHR_TOKEN	0x48
+#define BXOR_TOKEN	0x49
+#define BOR_TOKEN	0x4a
+#define POUND_TOKEN	0x4b	 /* matrix multiplication */
+#define LAST_BINARY_OP	 0x4b
+#define IS_BINARY_OP(t)	 ((t >= FIRST_BINARY_OP) && (t <= LAST_BINARY_OP))
+
+/* unary tokens -- but not all of them (see grammar) */
+#define DEREF_TOKEN	 0x4d
+#define NOT_TOKEN	 0x4e
+#define BNOT_TOKEN	 0x4f
+
+#define IS_INTERNAL_FUNC(t)	((t >= 0x50) && (t <= 0x52))
+#define POP_TOKEN	 0x50
+#define CHS_TOKEN	 0x51
+#define EXCH_TOKEN	 0x52
+
+#define LLONG_TOKEN	0x53
+#define ULLONG_TOKEN	0x54
+#define LDOUBLE_TOKEN	0x55
+
+/* Assignment tokens. Note: these must appear with sequential values.
+ * The order here must match the specific lvalue assignments below.
+ * These tokens are used by rpn routines in slang.c. slparse.c maps them
+ * onto the specific lvalue tokens while parsing infix.
+ * Also the assignment SLANG_BCST_ assumes this order
+ */
+#define ASSIGN_TOKEN		0x57
+#define PLUSEQS_TOKEN	 	0x58
+#define MINUSEQS_TOKEN		0x59
+#define TIMESEQS_TOKEN		0x5A
+#define DIVEQS_TOKEN		0x5B
+#define BOREQS_TOKEN		0x5C
+#define BANDEQS_TOKEN		0x5D
+#define PLUSPLUS_TOKEN		0x5E
+#define POST_PLUSPLUS_TOKEN	0x5F
+#define MINUSMINUS_TOKEN	0x60
+#define POST_MINUSMINUS_TOKEN	0x61
+
+/* Directives */
+#define IFNOT_TOKEN	0x62
+#define IF_TOKEN	0x63
+#define ELSE_TOKEN	0x64
+#define FOREVER_TOKEN	0x65
+#define WHILE_TOKEN	0x66
+#define FOR_TOKEN	0x67
+#define _FOR_TOKEN	0x68
+#define LOOP_TOKEN	0x69
+#define SWITCH_TOKEN	0x6A
+#define DOWHILE_TOKEN	0x6B
+#define ANDELSE_TOKEN	0x6C
+#define ORELSE_TOKEN	0x6D
+#define ERRBLK_TOKEN	0x6E
+#define EXITBLK_TOKEN	0x6F
+/* These must be sequential */
+#define USRBLK0_TOKEN	0x70
+#define USRBLK1_TOKEN	0x71
+#define USRBLK2_TOKEN	0x72
+#define USRBLK3_TOKEN	0x73
+#define USRBLK4_TOKEN	0x74
+
+#define CONT_TOKEN	0x75
+#define BREAK_TOKEN	0x76
+#define RETURN_TOKEN	0x77
+
+#define CASE_TOKEN	0x78
+#define DEFINE_TOKEN	0x79
+#define DO_TOKEN	0x7a
+#define VARIABLE_TOKEN	0x7b
+#define GVARIABLE_TOKEN	0x7c
+#define _REF_TOKEN	0x7d
+#define PUSH_TOKEN	0x7e
+#define STRUCT_TOKEN	0x7f
+#define TYPEDEF_TOKEN	0x80
+#define NOTELSE_TOKEN	0x81
+#define DEFINE_STATIC_TOKEN	0x82
+#define FOREACH_TOKEN	0x83
+#define USING_TOKEN	0x84
+#define DEFINE_PRIVATE_TOKEN	0x85
+#define DEFINE_PUBLIC_TOKEN	0x86
+
+#define TRY_TOKEN	0x87
+#define CATCH_TOKEN	0x88
+#define THROW_TOKEN	0x89
+#define FINALLY_TOKEN	0x8a
+
+#define BREAK_N_TOKEN	0x8b
+#define CONT_N_TOKEN	0x8c
+#define THEN_TOKEN	0x8d
+#define STRUCT_WITH_ASSIGN_TOKEN	0x8e
+#define FOREACH_EARGS_TOKEN	0x8f
+
+/* Note: the order here must match the order of the generic assignment tokens.
+ * Also, the first token of each group must be the ?_ASSIGN_TOKEN.
+ * slparse.c exploits this order, as well as slang.h.
+ */
+#define FIRST_ASSIGN_TOKEN		0x90
+#define _STRUCT_ASSIGN_TOKEN		0x90
+#define _STRUCT_PLUSEQS_TOKEN		0x91
+#define _STRUCT_MINUSEQS_TOKEN		0x92
+#define _STRUCT_TIMESEQS_TOKEN		0x93
+#define _STRUCT_DIVEQS_TOKEN		0x94
+#define _STRUCT_BOREQS_TOKEN		0x95
+#define _STRUCT_BANDEQS_TOKEN		0x96
+#define _STRUCT_PLUSPLUS_TOKEN		0x97
+#define _STRUCT_POST_PLUSPLUS_TOKEN	0x98
+#define _STRUCT_MINUSMINUS_TOKEN	0x99
+#define _STRUCT_POST_MINUSMINUS_TOKEN	0x9A
+
+#define _ARRAY_ASSIGN_TOKEN		0xA0
+#define _ARRAY_PLUSEQS_TOKEN		0xA1
+#define _ARRAY_MINUSEQS_TOKEN		0xA2
+#define _ARRAY_TIMESEQS_TOKEN		0xA3
+#define _ARRAY_DIVEQS_TOKEN		0xA4
+#define _ARRAY_BOREQS_TOKEN		0xA5
+#define _ARRAY_BANDEQS_TOKEN		0xA6
+#define _ARRAY_PLUSPLUS_TOKEN		0xA7
+#define _ARRAY_POST_PLUSPLUS_TOKEN	0xA8
+#define _ARRAY_MINUSMINUS_TOKEN		0xA9
+#define _ARRAY_POST_MINUSMINUS_TOKEN	0xAA
+
+#define _SCALAR_ASSIGN_TOKEN		0xB0
+#define _SCALAR_PLUSEQS_TOKEN		0xB1
+#define _SCALAR_MINUSEQS_TOKEN		0xB2
+#define _SCALAR_TIMESEQS_TOKEN		0xB3
+#define _SCALAR_DIVEQS_TOKEN		0xB4
+#define _SCALAR_BOREQS_TOKEN		0xB5
+#define _SCALAR_BANDEQS_TOKEN		0xB6
+#define _SCALAR_PLUSPLUS_TOKEN		0xB7
+#define _SCALAR_POST_PLUSPLUS_TOKEN	0xB8
+#define _SCALAR_MINUSMINUS_TOKEN	0xB9
+#define _SCALAR_POST_MINUSMINUS_TOKEN	0xBA
+
+#define _DEREF_ASSIGN_TOKEN		0xC0
+#define _DEREF_PLUSEQS_TOKEN		0xC1
+#define _DEREF_MINUSEQS_TOKEN		0xC2
+#define _DEREF_TIMESEQS_TOKEN		0xC3
+#define _DEREF_DIVEQS_TOKEN		0xC4
+#define _DEREF_BOREQS_TOKEN		0xC5
+#define _DEREF_BANDEQS_TOKEN		0xC6
+#define _DEREF_PLUSPLUS_TOKEN		0xC7
+#define _DEREF_POST_PLUSPLUS_TOKEN	0xC8
+#define _DEREF_MINUSMINUS_TOKEN		0xC9
+#define _DEREF_POST_MINUSMINUS_TOKEN	0xCA
+
+#define LAST_ASSIGN_TOKEN		0xCA
+#define IS_ASSIGN_TOKEN(t) (((t)>=FIRST_ASSIGN_TOKEN)&&((t)<=LAST_ASSIGN_TOKEN))
+
+#define _DEREF_OBSOLETE_FUNCALL_TOKEN	0xCE
+#define _DEREF_FUNCALL_TOKEN		0xCF
+
+#define LOOP_THEN_TOKEN			0xD0
+/* #define LOOP_ELSE_TOKEN			0xD1 */
+
+#define _COMPARE_TOKEN			0xD8 /* (a < b < c ...) */
+#define _ARRAY_ELEM_REF_TOKEN		0xD9 /* &Xi */
+#define _STRUCT_FIELD_REF_TOKEN		0xDA /* &S.a */
+
+#define _INLINE_ARRAY_TOKEN		0xE0
+#define _INLINE_IMPLICIT_ARRAY_TOKEN	0xE1 /* a:b:c */
+#define _NULL_TOKEN			0xE2
+#define _INLINE_WILDCARD_ARRAY_TOKEN	0xE3
+#define _INLINE_LIST_TOKEN		0xE4
+#define _INLINE_IMPLICIT_ARRAYN_TOKEN	0xE5 /* a:b:#n */
+
+#define ESC_STRING_DOLLAR_TOKEN		0xF0 /* appears only in .slc files */
+#define MULTI_STRING_TOKEN		0xF1
+
+#define BOS_TOKEN			0xFA
+#define EOS_TOKEN			0xFB
+#define LINE_NUM_TOKEN			0xFC
+#define ARG_TOKEN	 		0xFD
+#define EARG_TOKEN	 		0xFE
+#define NO_OP_LITERAL			0xFF
+
+typedef struct
+{
+ /* sltoken.c */
+ /* SLang_eval_object */
+ SLang_Load_Type *llt;
+ SLprep_Type *this_slpp;
+ /* prep_get_char() */
+ char *input_line;
+ char cchar;
+ /* get_token() */
+ int want_nl_token;
+
+ /* slparse.c */
+ _pSLang_Token_Type ctok;
+ int block_depth;
+ int assignment_expression;
+
+ /* slang.c : SLcompile() */
+ _pSLang_Token_Type save_token;
+ _pSLang_Token_Type next_token;
+ void (*slcompile_ptr)(_pSLang_Token_Type *);
+}
+_pSLEval_Context;
+
+extern int _pSLget_token (_pSLang_Token_Type *);
+extern void _pSLparse_error (int, SLCONST char *, _pSLang_Token_Type *, int);
+extern void _pSLparse_start (SLang_Load_Type *);
+extern int _pSLget_rpn_token (_pSLang_Token_Type *);
+extern void _pSLcompile_byte_compiled (void);
+
+extern int (*_pSLprep_eval_hook) (SLFUTURE_CONST char *);
+
+extern int _pSLsecure_issetugid (void);
+extern char *_pSLsecure_getenv (SLCONST char *);
+
+/* Error Handling */
+extern int _pSLang_init_exceptions (void);
+extern int _pSLerr_init (void);
+extern void _pSLerr_deinit (void);
+extern int _pSLerr_suspend_messages (void);
+extern int _pSLerr_resume_messages (void);
+extern int _pSLerr_traceback_msg (SLFUTURE_CONST char *, ...) SLATTRIBUTE_PRINTF(1,2);
+extern void _pSLerr_dump_msg (SLFUTURE_CONST char *, ...) SLATTRIBUTE_PRINTF(1,2);
+extern void _pSLerr_clear_error (int);
+extern void _pSLang_verror (int, SLCONST char *, ...) SLATTRIBUTE_PRINTF(2,3);
+extern int _pSLsnprintf (char *, unsigned int, SLFUTURE_CONST char *, ...) SLATTRIBUTE_PRINTF(3,4);
+
+typedef struct _pSLerr_Error_Queue_Type _pSLerr_Error_Queue_Type;
+extern _pSLerr_Error_Queue_Type *_pSLerr_new_error_queue (int);
+extern int _pSLerr_set_error_queue (_pSLerr_Error_Queue_Type *);
+extern void _pSLerr_delete_error_queue (_pSLerr_Error_Queue_Type *);
+
+extern void _pSLerr_print_message_queue (void);
+
+extern int _pSLerr_set_line_info (SLFUTURE_CONST char *, int, SLFUTURE_CONST char *);
+extern int _pSLang_pop_error_context (int);
+extern int _pSLang_push_error_context (void);
+extern void (*_pSLinterpreter_Error_Hook)(int);
+extern int _pSLerr_init_interp_exceptions (void);
+extern int _pSLerr_get_last_error (void);
+extern int _pSLerr_pop_exception (int *);
+extern void _pSLerr_free_queued_messages (void);
+
+#define _SLERR_MSG_ERROR	1
+#define _SLERR_MSG_WARNING	2
+#define _SLERR_MSG_TRACEBACK	3
+extern char *_pSLerr_get_error_from_queue (_pSLerr_Error_Queue_Type *, int);
+
+extern int _pSLerr_throw (void);
+extern int (*_pSLerr_New_Exception_Hook)(SLFUTURE_CONST char *name, SLFUTURE_CONST char *desc, int error_code);
+
+#if SLANG_HAS_DEBUGGER_SUPPORT
+typedef struct
+{
+ char **locals;
+ unsigned int nlocals;
+ SLCONST char *file;
+ unsigned int line;
+ SLCONST char *function;
+ SLCONST char *ns;
+}
+_pSLang_Frame_Info_Type;
+
+extern int _pSLang_get_frame_fun_info (int depth, _pSLang_Frame_Info_Type *info);
+extern int _pSLang_set_frame_variable (int depth, char *name);
+extern int _pSLang_get_frame_variable (int depth, char *name);
+extern void _pSLang_use_frame_namespace (int depth);
+extern int _pSLang_get_frame_depth (void);
+#endif
+
+#if SLANG_HAS_FLOAT
+extern int _pSLmath_isnan (double x);
+extern int _pSLmath_isinf (double x);
+extern double _pSLang_NaN;
+extern double _pSLang_Inf;
+
+# ifdef HAVE_LOG1P
+# define LOG1P_FUNC log1p
+# else
+extern double _pSLmath_log1p (double);
+# define LOG1P_FUNC _pSLmath_log1p
+# endif
+
+# ifdef HAVE_EXPM1
+# define EXPM1_FUNC expm1
+# else
+extern double _pSLmath_expm1 (double);
+# define EXPM1_FUNC _pSLmath_expm1
+# endif
+
+# if SLANG_HAS_COMPLEX
+extern double *_pSLcomplex_expm1 (double *f, double *z);
+extern double *_pSLcomplex_log1p (double *f, double *z);
+# endif
+#endif
+
+#if SLANG_HAS_SIGNALS
+extern void _pSLang_signal_interrupt (void);
+extern int _pSLsig_block_and_call (int (*)(VOID_STAR), VOID_STAR);
+extern int _pSLsig_handle_signals (void);
+extern int _pSLang_check_signals_hook (VOID_STAR);
+#else
+#define _pSLsig_block_and_call(f,v) f(v)
+#endif
+
+#undef _INLINE_
+/* clang defines GNUC on the mac, but used c99 sematics for extern inline. This implementation
+ * assume GNU semantics.
+ */
+#if defined (SLANG_USE_INLINE_CODE) && defined(__GNUC__) && !defined(__clang__)
+# if !defined __GNUC_STDC_INLINE__ && !defined __GNUC_GNU_INLINE__
+# define _INLINE_ __inline__ /* older compilers */
+# else
+# define _INLINE_ __inline__ __attribute__((gnu_inline)) /* newer ones */
+# endif
+#else
+# define _INLINE_
+#endif
+
+#if SLANG_OPTIMIZE_FOR_SPEED && defined(__GNUC__) && (__GNUC__ >= 3)
+# define IF_LIKELY(x) if (__builtin_expect((x),1))
+# define IF_UNLIKELY(x) if (__builtin_expect ((x), 0))
+#else
+# define IF_LIKELY(x) if (x)
+# define IF_UNLIKELY(x) if (x)
+#endif
+
+/* This is a macro that permits:
+ *
+ * extern fun (void **addr);
+ * double x;
+ * fun ((void **) &x); <--- warning
+ * fun (VOID_STAR_STAR(&x));
+ *
+ * Otherwise a type-punning warning could result due to strict-aliasing.
+ */
+#define VOID_STAR_STAR(addr) (VOID_STAR *)(VOID_STAR)(addr)
+
+#endif				 /* PRIVATE_SLANG_H_ */

_service:tar_scm:slang-2.3.2.tar.bz2/src/_slint.h Added

@@ -0,0 +1,164 @@
+#ifndef PRIVATE_SLINT_H_
+# define PRIVATE_SLINT_H_
+
+/* This file defines macros and types for ints of various types.
+ * Eventually it will make use of stdint.h.
+ */
+
+/* If long or short are ints, then map the slang types to ints.  This is
+ * done because slang has some optimizations for ints.
+ */
+#define LONG_IS_INT (SIZEOF_INT == SIZEOF_LONG)
+#define LONG_IS_NOT_INT (SIZEOF_INT != SIZEOF_LONG)
+#define SHORT_IS_INT (SIZEOF_INT == SIZEOF_SHORT)
+#define SHORT_IS_NOT_INT (SIZEOF_INT != SIZEOF_SHORT)
+#define LLONG_IS_LONG (SIZEOF_LONG == SIZEOF_LONG_LONG)
+#define LLONG_IS_NOT_LONG (SIZEOF_LONG != SIZEOF_LONG_LONG)
+
+#if LONG_IS_INT
+# define _pSLANG_LONG_TYPE SLANG_INT_TYPE
+# define _pSLANG_ULONG_TYPE SLANG_UINT_TYPE
+#else
+# define _pSLANG_LONG_TYPE SLANG_LONG_TYPE
+# define _pSLANG_ULONG_TYPE SLANG_ULONG_TYPE
+#endif
+#if SHORT_IS_INT
+# define _pSLANG_SHORT_TYPE SLANG_INT_TYPE
+# define _pSLANG_USHORT_TYPE SLANG_UINT_TYPE
+#else
+# define _pSLANG_SHORT_TYPE SLANG_SHORT_TYPE
+# define _pSLANG_USHORT_TYPE SLANG_USHORT_TYPE
+#endif
+#if LLONG_IS_LONG
+# define _pSLANG_LLONG_TYPE _pSLANG_LONG_TYPE
+# define _pSLANG_ULLONG_TYPE _pSLANG_ULONG_TYPE
+#else
+# define _pSLANG_LLONG_TYPE SLANG_LLONG_TYPE
+# define _pSLANG_ULLONG_TYPE SLANG_ULLONG_TYPE
+#endif
+
+/* Map off_t to a slang type */
+#if defined(HAVE_LONG_LONG) && (SIZEOF_OFF_T == SIZEOF_LONG_LONG) && (SIZEOF_LONG_LONG > SIZEOF_LONG)
+# define SLANG_C_OFF_T_TYPE _pSLANG_LLONG_TYPE
+typedef long long _pSLc_off_t_Type;
+# define SLANG_PUSH_OFF_T SLang_push_long_long
+#else
+# if (SIZEOF_OFF_T == SIZEOF_INT)
+#  define SLANG_C_OFF_T_TYPE SLANG_INT_TYPE
+#  define SLANG_PUSH_OFF_T SLang_push_int
+typedef int _pSLc_off_t_Type;
+# else
+#  define SLANG_C_OFF_T_TYPE _pSLANG_LONG_TYPE
+#  define SLANG_PUSH_OFF_T SLang_push_long
+typedef long _pSLc_off_t_Type;
+# endif
+#endif
+
+#if SIZEOF_INT == 2
+# define _pSLANG_INT16_TYPE	SLANG_INT_TYPE
+# define _pSLANG_UINT16_TYPE	SLANG_UINT_TYPE
+typedef int _pSLint16_Type;
+typedef unsigned int _pSLuint16_Type;
+#else
+# if SIZEOF_SHORT == 2
+#  define _pSLANG_INT16_TYPE	SLANG_SHORT_TYPE
+#  define _pSLANG_UINT16_TYPE	SLANG_USHORT_TYPE
+typedef short _pSLint16_Type;
+typedef unsigned short _pSLuint16_Type;
+# else
+#  if SIZEOF_LONG == 2
+#   define _pSLANG_INT16_TYPE	SLANG_LONG_TYPE
+#   define _pSLANG_UINT16_TYPE	SLANG_ULONG_TYPE
+typedef long _pSLInt16_Type;
+typedef unsigned long _pSLuint16_Type;
+#  else
+#   define _pSLANG_INT16_TYPE	0
+#   define _pSLANG_UINT16_TYPE	0
+#  endif
+# endif
+#endif
+
+#if SIZEOF_INT == 4
+# define _pSLANG_INT32_TYPE	SLANG_INT_TYPE
+# define _pSLANG_UINT32_TYPE	SLANG_UINT_TYPE
+typedef int _pSLint32_Type;
+typedef unsigned int _pSLuint32_Type;
+#else
+# if SIZEOF_SHORT == 4
+#  define _pSLANG_INT32_TYPE	SLANG_SHORT_TYPE
+#  define _pSLANG_UINT32_TYPE	SLANG_USHORT_TYPE
+typedef short _pSLInt32_Type;
+typedef unsigned short _pSLuint32_Type;
+# else
+#  if SIZEOF_LONG == 4
+#   define _pSLANG_INT32_TYPE	SLANG_LONG_TYPE
+#   define _pSLANG_UINT32_TYPE	SLANG_ULONG_TYPE
+typedef long _pSLInt32_Type;
+typedef unsigned long _pSLuint32_Type;
+#  else
+#   define _pSLANG_INT32_TYPE	0
+#   define _pSLANG_UINT32_TYPE	0
+#  endif
+# endif
+#endif
+
+#if SIZEOF_INT == 8
+# define _pSLANG_INT64_TYPE	SLANG_INT_TYPE
+# define _pSLANG_UINT64_TYPE	SLANG_UINT_TYPE
+typedef int _pSLint64_Type;
+typedef unsigned int _pSLuint64_Type;
+#else
+# if SIZEOF_SHORT == 8
+#  define _pSLANG_INT64_TYPE	SLANG_SHORT_TYPE
+#  define _pSLANG_UINT64_TYPE	SLANG_USHORT_TYPE
+typedef int _pSLint64_Type;
+typedef unsigned int _pSLuint64_Type;
+# else
+#  if SIZEOF_LONG == 8
+#   define _pSLANG_INT64_TYPE	SLANG_LONG_TYPE
+#   define _pSLANG_UINT64_TYPE	SLANG_ULONG_TYPE
+typedef long _pSLint64_Type;
+typedef unsigned long _pSLuint64_Type;
+#  else
+#   if SIZEOF_LONG_LONG == 8
+#    define _pSLANG_INT64_TYPE	SLANG_LLONG_TYPE
+#    define _pSLANG_UINT64_TYPE	SLANG_ULLONG_TYPE
+typedef long long _pSLint64_Type;
+typedef unsigned long long _pSLuint64_Type;
+#   else
+#    define _pSLANG_INT64_TYPE	0
+#    define _pSLANG_UINT64_TYPE	0
+#   endif
+#  endif
+# endif
+#endif
+
+/* The following are commented out because they are not used by the library */
+/* extern int _pSLang_pop_int16 (_pSLint16_Type *); */
+/* extern int _pSLang_pop_uint16 (_pSLuint16_Type *); */
+/* extern int _pSLang_pop_int32 (_pSLint32_Type *); */
+/* extern int _pSLang_pop_uint32 (_pSLuint32_Type *); */
+#if _pSLANG_INT64_TYPE
+extern int _pSLang_pop_int64(_pSLint64_Type *);
+extern int _pSLang_pop_uint64 (_pSLuint64_Type *);
+#endif
+/* extern int _pSLang_push_int16 (_pSLint16_Type); */
+/* extern int _pSLang_push_uint16 (_pSLuint16_Type); */
+/* extern int _pSLang_push_int32 (_pSLint32_Type); */
+/* extern int _pSLang_push_uint32 (_pSLuint32_Type); */
+#if _pSLANG_INT64_TYPE
+/* extern int _pSLang_push_int64(_pSLint64_Type); */
+/* extern int _pSLang_push_uint64 (_pSLuint64_Type); */
+#endif
+
+#ifdef HAVE_LONG_LONG
+# ifdef __WIN32__
+#  define SLFMT_LLD  "%I64d"
+#  define SLFMT_LLU  "%I64u"
+# else
+#  define SLFMT_LLD  "%lld"
+#  define SLFMT_LLU  "%llu"
+# endif
+#endif
+
+#endif				       /* PRIVATE_SLINT_H_ */

_service:tar_scm:slang-2.3.2.tar.bz2/src/calc.c Added

@@ -0,0 +1,204 @@
+/* This is a simple demo program for the S-Lang interpreter. */
+
+#include "config.h"
+#include <stdio.h>
+#include <math.h>
+#ifdef HAVE_STDLIB_H
+# include <stdlib.h>
+#endif
+
+#define BENCHMARK_TESTING	0
+
+#if BENCHMARK_TESTING
+# include <sys/time.h>
+# include <sys/resource.h>
+# include <unistd.h>
+#endif
+
+#include "slang.h"
+
+static int open_readline (void);
+static void close_readline (void);
+
+static void help (void)
+{
+ puts("ALL statements MUST be terminated with a ';' character, e.g., quit();\n");
+ puts("Available functions:");
+ puts(" cos, sin, tan, atan, acos, asin, exp, log, sqrt, fabs, log10, pow, PI, E");
+ puts("\nas well as other intrinsic S-Lang functions.");
+ puts("See S-Lang language documentation for further details.\n");
+ SLang_run_hooks ("calc_help", 0);
+}
+
+/* The following three functions will be callable from the interpreter */
+static void quit_calc (void)
+{
+ close_readline ();
+ exit (1);
+}
+
+static void exit_calc (int *status)
+{
+ close_readline ();
+ exit (*status);
+}
+
+/* Now here is a table that provides the link between the above functions and
+ the S-Lang interpreter */
+static SLang_Intrin_Fun_Type Calc_Intrinsics =
+{
+ MAKE_INTRINSIC("quit", quit_calc, SLANG_VOID_TYPE, 0),
+ MAKE_INTRINSIC_I("exit", exit_calc, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC("help", help, SLANG_VOID_TYPE, 0),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+typedef struct
+{
+ int i_value;
+ char *s_value;
+ double d_value;
+}
+My_Struct_Type;
+
+static My_Struct_Type My_Struct =
+{
+ -41,
+ NULL,
+ 7.18
+};
+
+static My_Struct_Type *My_Struct_Ptr = &My_Struct;
+
+static SLang_IStruct_Field_Type My_Struct_Field_Table =
+{
+ MAKE_ISTRUCT_FIELD(My_Struct_Type, i_value, "i", SLANG_INT_TYPE, 0),
+ MAKE_ISTRUCT_FIELD(My_Struct_Type, s_value, "s", SLANG_STRING_TYPE, 0),
+ MAKE_ISTRUCT_FIELD(My_Struct_Type, d_value, "d", SLANG_DOUBLE_TYPE, 0),
+ SLANG_END_ISTRUCT_TABLE
+};
+
+static int add_my_struct_type (void)
+{
+ return SLadd_istruct_table (My_Struct_Field_Table,
+			 (VOID_STAR) &My_Struct_Ptr,
+			 "MyS");
+}
+
+static int take_input (void);
+
+int main (int argc, char **argv)
+{
+ if ((-1 == SLang_init_all ())
+ /* || (-1 == SLang_init_import ()) / * dynamic linking */
+ || (-1 == add_my_struct_type ())
+ || (-1 == SLadd_intrin_fun_table (Calc_Intrinsics, NULL)))
+ {
+	fprintf(stderr, "Unable to initialize S-Lang.\n");
+	exit (1);
+ }
+
+ SLang_Traceback = 1;
+
+ if (argc == 1)
+ SLang_load_file("calc.sl");
+
+ while (--argc && !SLang_get_error ())
+ {
+	argv++;
+	SLang_load_file (*argv);
+ }
+
+ fputs("Type 'help();' for help and a list of available functions.\n", stdout);
+ fputs("All statements must end with a ';' character, e.g, 2*7+3;\n", stdout);
+ fputs("\nType `quit;' to exit this program.\n", stdout);
+
+ if (-1 == open_readline ())
+ return 1;
+
+ while (1)
+ {
+	if (SLang_get_error ())
+	 {
+	 SLang_restart (1);
+	 /* SLang_set_error (0); */
+	 }
+	SLKeyBoard_Quit = 0;
+	take_input ();
+ }
+}
+
+/* For a detailed explanation of all of this, see slang/demo/useropen.c */
+
+static SLrline_Type *Calc_RLI;
+SLang_Load_Type *Readline_Load_Object;
+
+static char *read_using_readline (SLang_Load_Type *x)
+{
+ static char *input_hook = "calc_take_input_hook";
+ char *prompt, *line;
+
+ if (x->parse_level == 0)
+ {
+	if ((input_hook != NULL)
+	 && (-1 == SLang_run_hooks (input_hook, 0)))
+	 {
+	 input_hook = NULL;
+	 return NULL;
+	 }
+	prompt = "Calc> ";
+ }
+ else
+ prompt = " ";
+
+ if (NULL == (line = SLrline_read_line (Calc_RLI, prompt, NULL)))
+ return SLmake_string ("quit();");
+
+ putc ('\n', stdout); fflush (stdout);
+
+ SLrline_save_line (Calc_RLI);
+ return line;
+}
+
+static int open_readline (void)
+{
+ if (SLang_init_tty (-1, 0, 1))
+ {
+	fprintf(stderr, "Unable to initialize tty.\n");
+	return -1;
+ }
+ SLang_set_abort_signal (NULL);
+
+ if (Calc_RLI == NULL)
+ {
+	Calc_RLI = SLrline_open (80, SL_RLINE_BLINK_MATCH);
+	if (Calc_RLI == NULL)
+	 return -1;
+ }
+
+ if (NULL == (Readline_Load_Object = SLallocate_load_type ("<stdin>")))
+ {
+	close_readline ();
+	return -1;
+ }
+
+ Readline_Load_Object->read = read_using_readline;
+ return 0;
+}
+
+static void close_readline (void)
+{
+ if (Readline_Load_Object != NULL)
+ {
+	SLdeallocate_load_type (Readline_Load_Object);
+	Readline_Load_Object = NULL;
+ }
+ SLrline_close (Calc_RLI);
+ Calc_RLI = NULL;
+ SLang_reset_tty ();
+}
+
+static int take_input (void)
+{
+ return SLang_load_object (Readline_Load_Object);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/calc.sl Added

@@ -0,0 +1,355 @@
+variable X = Any_Type1;
+X0 = "foo";
+
+% a print function
+set_float_format ("%.32e");
+define p(obj)
+{
+ () = fprintf (stdout, "%S\n", obj);
+ () = fflush (stdout);
+}
+
+define print_struct (s)
+{
+ variable name, value;
+
+ foreach (get_struct_field_names (s))
+ {
+	name = ();
+	value = get_struct_field (s, name);
+
+	() = printf ("s.%s = %S\n", name, value);
+ }
+}
+
+static variable Static_Variable;
+
+static define test1 ()
+{
+ loop (_NARGS) p;
+}
+
+define test ()
+{
+ usage ("silly silly silly");
+ variable args = __pop_args (_NARGS);
+ test1 (__push_args (args));
+}
+
+define calc_take_input_hook ()
+{
+ while (_stkdepth ())
+ p ();
+}
+
+define print_array (a)
+{
+ variable num_dims, dims;
+ variable nr, nc;
+ variable i, j;
+
+ (dims ,num_dims,) = array_info (a);
+ if (num_dims > 2)
+ {
+	p (a);
+	return;
+ }
+
+ nr = dims 0;
+ nc = 0;
+ if (num_dims == 2)
+ nc = dims1;
+
+ _for (0, nr - 1, 1)
+ {
+	i = ();
+	!if (nc)
+	 {
+	 () = printf ("Array%d = %S\n", i, ai);
+	 continue;
+	 }
+	_for (0, nc - 1, 1)
+	 {
+	 j = ();
+	 () = printf ("\t%S", ai, j);
+	 }
+	() = fputs ("\n", stdout);
+ }
+}
+
+define read_file (file)
+{
+ variable line, len;
+ variable root, tail, s;
+ variable fp;
+
+ fp = fopen (file, "r");
+ if (fp == NULL)
+ error ("unable to open file");
+
+ root = NULL;
+ tail = NULL;
+ while (-1 != fgets (&line, fp))
+ {
+	s = struct { next, value };
+	s.value = line;
+	s.next = NULL;
+
+	if (root == NULL)
+	 root = s;
+	else
+	 tail.next = s;
+
+	tail = s;
+ }
+ () = fclose (fp);
+ return root;
+}
+
+define list_len (list)
+{
+ variable len = 0;
+
+ foreach (list) using ("next")
+ {
+	() = ();
+	len++;
+ }
+ return len;
+}
+
+% calc.sl--- Init file for calc. This file must be placed in the default
+% directory for calc and is automatically loaded when calc runs.
+%
+% This file contains S-Lang code for Newton's method, etc...
+%
+% Here is a function which computes the root of the equation y = f(x) using
+% Newtons method. The usage is:
+%
+% root = newton(s, &f);
+%
+% where s is a seed value and f is the function whose root is sought.
+%
+% For example, consider the function my_fun(x) = x^2 - 2 with solution
+% x = sqrt(2). This function may be expressed in S-Lang as:
+%
+% define my_func(x)
+% {
+% return (x * x - 2);
+% }
+%
+% To solve the equation my_fun(x) = 0 using the newton routine below, use
+%
+% newton(5.0, &myfun);
+%
+% Here, I have randomly chosen 5.0 as an initial guess. In addition,
+% I have used the '&' operator to pass the function 'myfun' to the routine.
+
+% Newton's method requires the derivative of a function. Here is such a
+% function called by newton. Given f(x), it returns df/dx at the point x.
+%
+% Its usage is:
+%
+% derivative(x, &f);
+
+define derivative(x, f)
+{
+ variable dx;
+ dx = 1.0e-4; % small number
+
+ return ((@f(x + dx) - @f(x - dx))/(2 * dx));
+}
+
+% And now the Newton's method:
+
+define newton(x, f)
+{
+ variable err, max, dx;
+
+ err = 1.0e-6;
+ max = 1000;
+
+ while (max)
+ {
+	--max;
+	dx = @f(x) / derivative(x, f);
+	if (abs(dx) < err)
+	 {
+	 return(x);
+	 }
+
+	x -= dx;
+ }
+
+ message ("\7Root not found. Try another seed!");
+ return(x);
+}
+
+%% This is a standard benchmark for interpreters. It is a heavily
+%% recursive routine that returns the nth Fibonacci number.
+%% It is defined recursively as:
+%%
+%% f_0 = 0, f_1 = 1, .... , f_{n+1} = f_n + f_{n-1}, ...
+%%
+%% or {0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...}
+%%
+
+define fib(); % required for recursion
+
+define fib(n)
+{
+ !if (n) return(0);
+ n--;
+ !if (n) return(1);
+
+ return fib(n) + fib(n-1);
+}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+% Two routines which illustrate the how to deal with files
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+% type out a file to terminal
+define type_file(file)
+{
+ variable fp, n, line;
+
+ fp = fopen(file, "r");
+ if (fp == NULL)
+ verror ("%s failed to open.", file);
+
+ while (-1 != fgets (&line, fp))
+ {
+	() = fputs (line, stdout);
+ }
+
+ if (-1 == fclose(fp))
+ verror ("Error closing %s", file);
+}
+
+%
+% Here is a function that prints the number of lines in a file
+%
+
+define count_lines1 (file)
+{
+ variable fp, lines, nchars, num_lines, st;
+
+ fp = fopen (file, "r");
+ if (fp == NULL)
+ verror ("count_lines1: unable to open %s", file);
+
+ st = stat_file (file);
+ if (st == NULL)
+ verror ("stat_file failed");
+
+ lines = fgetslines (fp);
+ nchars = st.st_size;
+
+ num_lines = length (lines);
+
+ () = fclose (fp);
+ vmessage ("%s consists of %d characters and %d lines.\n",
+	 file, nchars, num_lines);
+}
+
+define count_lines(f)
+{
+ variable fp, n, nchars, dn, line;
+
+ fp = fopen(f, "r");
+ if (fp == NULL) error("Unable to open file!");
+ n = 0; nchars = 0;
+
+ while (dn = fgets (&line, fp), dn != -1)
+ {
+	++n;
+	nchars += dn;
+ }
+ () = fclose(fp);		 %/* ignore return value */
+
+ vmessage ("%s consists of %d characters and %d lines.\n",
+	 f, nchars, n);
+}
+
+define count_lines2(f)
+{
+ variable fp, n, nchars, dn, line;
+
+ fp = fopen(f, "r");
+ if (fp == NULL) error("Unable to open file!");
+ n = 0; nchars = 0;
+
+ foreach (fp)
+ {
+	nchars += strlen ();
+	++n;
+ }
+ () = fclose(fp);		 %/* ignore return value */
+
+ vmessage ("%s consists of %d characters and %d lines.\n",
+	 f, nchars, n);
+}
+
+define count_lines3(f)
+{
+ variable fp, n, nchars, dn, line;
+
+ fp = fopen(f, "r");
+ if (fp == NULL) error("Unable to open file!");
+ n = 0; nchars = 0;
+
+ n = 1;
+ foreach (fp) using ("char")
+ {
+	variable ch = ();
+	if (ch == '\n')
+	 n++;
+	nchars++;
+ }
+ () = fclose(fp);		 %/* ignore return value */
+
+ vmessage ("%s consists of %d characters and %d lines.\n",
+	 f, nchars, n);
+}
+
+% an apropos function
+define apropos (what)
+{
+ variable n = _apropos(what, 0xF);
+ variable i, f1, f2, f3;
+
+ if (n) () = printf ("Found %d matches:\n", n);
+ else
+ {
+	() = printf ("No matches.\n");
+	return;
+ }
+
+ loop (n / 3)
+ {
+	f1 = (); f2 = (); f3 = ();
+	() = printf ("%-26s %-26s %s\n", f1, f2, f3);
+ }
+ n = n mod 3;
+ loop (n)
+ {
+	f1 = ();
+	() = printf ("%-26s ", f1);
+ }
+ if (n) () = printf("\n");
+}
+
+%%% more help (called from calc.c)
+define calc_help ()
+{
+ p("Additional functions:");
+ p(" p(); -- displays top element of the stack (discarding it).");
+ p(" quit(); -- quit calculator");
+ p(" apropos(\"STRING\"); -- lists all objects containing \"STRING\"");
+ p("\nExample: p (2.4 * E); yields 6.52388.\n");
+}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+% end of calc.sl
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

_service:tar_scm:slang-2.3.2.tar.bz2/src/config.hin Added

@@ -0,0 +1,295 @@
+/* -*- c -*- */
+/* Note: this is for unix only. */
+
+#ifndef SL_CONFIG_H
+#define SL_CONFIG_H
+
+/* Files used by the slang-readline interface.  The interface first tries
+ * to read SLRLINE_USER_INIT_FILE from $HOME, and if that does not exist, it
+ * will read SLRLINE_SYS_INIT_FILE from the interpreter's load path.
+ */
+#define SLRLINE_USER_INIT_FILE	".slrlinerc"
+#define SLRLINE_SYS_INIT_FILE	"rline/slrline.rc"
+
+/* define if you have long long type */
+#undef HAVE_LONG_LONG
+
+/* The following set defines may be necessary to activate long file support */
+#undef _FILE_OFFSET_BITS
+#undef _LARGE_FILES
+#undef _LARGEFILE_SOURCE
+
+/* define if you have stdlib.h */
+#undef HAVE_STDLIB_H
+
+/* define if you have unistd.h */
+#undef HAVE_UNISTD_H
+
+/* define if you have termios.h */
+#undef HAVE_TERMIOS_H
+
+/* define if you have memory.h */
+#undef HAVE_MEMORY_H
+
+/* define if you have malloc.h */
+#undef HAVE_MALLOC_H
+
+/* define if you have memset */
+#undef HAVE_MEMSET
+
+/* define if you have memcpy */
+#undef HAVE_MEMCPY
+
+#undef HAVE_SETLOCALE
+#undef HAVE_NEWLOCALE
+#undef HAVE_LOCALECONV
+#undef HAVE_LOCALE_H
+#undef HAVE_XLOCALE_H
+#undef HAVE_LANGINFO_H
+#undef HAVE_NL_LANGINFO_CODESET
+
+#undef HAVE_FLOATINGPOINT_H
+#undef HAVE_NAN_H
+#undef HAVE_IEEEFP_H
+#undef HAVE_FENV_H
+
+#undef HAVE_FECLEAREXCEPT
+#undef HAVE_FPSETSTICKY
+
+#undef HAVE_VFSCANF
+#undef HAVE_STRTOD
+#undef HAVE_ATOLL
+#undef HAVE_STRTOLL
+#undef HAVE_STRTOD_L
+
+/* define if you have fcntl.h */
+#undef HAVE_FCNTL_H
+
+/* Define if you have the vsnprintf, snprintf functions and they return
+ * EOF upon failure.
+ */
+#undef HAVE_VSNPRINTF
+#undef HAVE_SNPRINTF
+
+/* define if you have sys/fcntl.h */
+#undef HAVE_SYS_FCNTL_H
+
+#undef HAVE_SYS_STATVFS_H
+
+#undef HAVE_SYS_TYPES_H
+#undef HAVE_SYS_WAIT_H
+#undef HAVE_SYS_TIMES_H
+#undef HAVE_SYS_TIME_H
+
+#undef HAVE_UTIME_H
+#undef HAVE_UTIME
+#undef HAVE_UTIMES
+
+#undef HAVE_GETITIMER
+#undef HAVE_SETITIMER
+#undef HAVE_SYS_MMAN_H
+
+#undef HAVE_SYS_RESOURCE_H
+#undef HAVE_GETRUSAGE
+
+
+/* Set these to the appropriate values */
+#undef SIZEOF_SHORT
+#undef SIZEOF_INT
+#undef SIZEOF_LONG
+#undef SIZEOF_FLOAT
+#undef SIZEOF_DOUBLE
+#undef SIZEOF_LONG_LONG
+
+#undef off_t
+#undef SIZEOF_OFF_T
+#undef size_t
+#undef SIZEOF_SIZE_T
+
+/* define if you have these. */
+#undef HAVE_ATEXIT
+#undef HAVE_ON_EXIT
+#undef HAVE_PUTENV
+#undef HAVE_GETCWD
+#undef HAVE_TCGETATTR
+#undef HAVE_TCSETATTR
+#undef HAVE_CFGETOSPEED
+#undef HAVE_LSTAT
+#undef HAVE_KILL
+#undef HAVE_KILLPG
+#undef HAVE_CHOWN
+#undef HAVE_LCHOWN
+#undef HAVE_VSNPRINTF
+#undef HAVE_POPEN
+#undef HAVE_UMASK
+#undef HAVE_READLINK
+#undef HAVE_SYMLINK
+#undef HAVE_LINK
+#undef HAVE_TIMES
+#undef HAVE_GMTIME
+#undef HAVE_GMTIME_R
+#undef HAVE_LOCALTIME_R
+#undef HAVE_CTIME_R
+#undef HAVE_GETTIMEOFDAY
+#undef HAVE_MKTIME
+#undef HAVE_MKFIFO
+#undef HAVE_MMAP
+#undef HAVE_TTYNAME_R
+#undef HAVE_TTYNAME
+#undef HAVE_STATVFS
+#undef HAVE_GETPPID
+#undef HAVE_GETGID
+#undef HAVE_GETEGID
+#undef HAVE_GETEUID
+#undef HAVE_GETUID
+
+#undef HAVE_SETGID
+#undef HAVE_SETUID
+
+#undef HAVE_GETPGID
+#undef HAVE_GETPGRP
+#undef HAVE_SETPGID
+#undef HAVE_SETPGRP
+#undef HAVE_GETSID
+#undef HAVE_SETSID
+
+#undef HAVE_GETPRIORITY
+#undef HAVE_SETPRIORITY
+
+#undef HAVE_ISSETUGID
+
+#undef HAVE_ACOSH
+#undef HAVE_ASINH
+#undef HAVE_ATANH
+
+#undef HAVE_ROUND
+#undef HAVE_FINITE
+#undef HAVE_ISINF
+#undef HAVE_ISNAN
+#undef HAVE_HYPOT
+#undef HAVE_ATAN2
+#undef HAVE_FREXP
+#undef HAVE_FREXPF
+#undef HAVE_LDEXP
+#undef HAVE_LDEXPF
+#undef HAVE_SINCOS
+#undef HAVE_SINCOSF
+
+#undef HAVE_DIRENT_H
+#undef HAVE_SYS_NDIR_H
+#undef HAVE_SYS_DIR_H
+#undef HAVE_NDIR_H
+
+#undef HAVE_FSEEKO
+#undef HAVE_SETVBUF
+
+#undef HAVE_DLFCN_H
+
+#undef HAVE_SYS_UTSNAME_H
+#undef HAVE_UNAME
+
+#undef HAVE_ALARM
+#undef HAVE_PAUSE
+
+/* These are used by the socket module */
+#undef HAVE_SOCKET
+#undef HAVE_SOCKETPAIR
+#undef HAVE_SYS_SOCKET_H
+#undef HAVE_SOCKET_H
+#undef HAVE_NETINET_IN_H
+#undef HAVE_ARPA_INET_H
+#undef HAVE_SYS_UN_H
+#undef socklen_t
+
+#undef HAVE_CONFSTR
+#undef HAVE_SYSCONF
+#undef HAVE_PATHCONF
+
+#undef HAVE_ENVIRON
+
+/* These two are needed on DOS-like systems.  Unix does not require them.
+ * They are included here for consistency.
+ *
+#define HAVE_IO_H
+#define HAVE_PROCESS_H
+ */
+
+#undef HAVE_PCRE_H
+
+#undef USE_TERMCAP
+
+#undef mode_t
+#undef uid_t
+#undef pid_t
+#undef gid_t
+#undef ptrdiff_t
+
+#undef HAVE_SIGLONGJMP
+
+/* Do we have posix signals? */
+#undef HAVE_SIGACTION
+#undef HAVE_SIGPROCMASK
+#undef HAVE_SIGEMPTYSET
+#undef HAVE_SIGADDSET
+
+#undef HAVE_ICONV
+#undef ICONV_CONST
+
+#undef HAVE_FORK
+#undef HAVE_WAITPID
+
+#if defined(HAVE_SIGADDSET) && defined(HAVE_SIGEMPTYSET)
+# if defined(HAVE_SIGACTION) && defined(HAVE_SIGPROCMASK)
+#  define SLANG_POSIX_SIGNALS
+# endif
+#endif
+
+/* Define if you need to in order for stat and other things to work.  */
+#undef _POSIX_SOURCE
+
+#ifdef _AIX
+# ifndef _POSIX_SOURCE
+#  define _POSIX_SOURCE 1
+# endif
+# ifndef _ALL_SOURCE
+#  define _ALL_SOURCE
+# endif
+/* This may generate warnings but the fact is that without it, xlc will
+ * INCORRECTLY inline many str* functions. */
+# undef __STR__
+#endif
+
+/* define USE_TERMCAP if you want to use it instead of terminfo. */
+#if defined(sequent) || defined(NeXT)
+# ifndef USE_TERMCAP
+#  define USE_TERMCAP
+# endif
+#endif
+
+#if defined(ultrix) && !defined(__GNUC__)
+# ifndef NO_PROTOTYPES
+#  define NO_PROTOTYPES
+# endif
+#endif
+
+#ifndef unix
+# define unix 1
+#endif
+
+#ifndef __unix__
+# define __unix__ 1
+#endif
+
+#ifndef HAVE_LONG_LONG
+# undef SIZEOF_LONG_LONG
+# define SIZEOF_LONG_LONG 0
+#endif
+
+#if defined(BUILD_DLL) && BUILD_DLL
+# ifdef __CYGWIN32__
+#  undef SLANG_DLL
+#  define SLANG_DLL 1
+# endif
+#endif
+
+#endif /* SL_CONFIG_H */

_service:tar_scm:slang-2.3.2.tar.bz2/src/curses Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/curses/Makefile Added

@@ -0,0 +1,52 @@
+COMPILE = $(CC) $(CFLAGS) -g -DSLANG -I..
+LFLAGS = -L../$(ARCH)objs -lslang
+M_LIB = -lm
+
+CURSES_H = ../curses.h
+
+EXECS = rain blue hanoi firework \
+ bs battle gdc tclock worm view
+#knight newdemo testcurs xmas
+
+all: $(CURSES_H) $(EXECS)
+
+$(CURSES_H):
+	echo '#include <slcurses.h>' > $(CURSES_H)
+
+view: view.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS)
+bs: $(CURSES_H) bs.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS)
+gdc: $(CURSES_H) gdc.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS)
+battle: $(CURSES_H) battle.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS)
+hanoi: $(CURSES_H) hanoi.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS)
+blue: $(CURSES_H) blue.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS)
+rain: $(CURSES_H) rain.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS)
+firework: $(CURSES_H) firework.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS)
+tclock: $(CURSES_H) tclock.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS) $(M_LIB)
+worm: worm.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS) $(M_LIB)
+knight: knight.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS) $(M_LIB)
+xmas: xmas.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS) $(M_LIB)
+newdemo: newdemo.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS) $(M_LIB)
+testcurs: testcurs.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS) $(M_LIB)
+lrtest: lrtest.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS) $(M_LIB)
+t: t.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS) $(M_LIB)
+key: key.c
+	$(COMPILE) $@.c -o $@ $(LFLAGS) $(M_LIB)
+
+clean:
+	/bin/rm $(EXECS)

_service:tar_scm:slang-2.3.2.tar.bz2/src/curses/README Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/curses/battle.c Added

@@ -0,0 +1,710 @@
+/*
+ * battle.c - original author: Bruce Holloway
+ *		mods by: Chuck A DeGaul
+ */
+
+#include <unistd.h>
+#include <stdlib.h>
+#include <ctype.h>
+#include <time.h>
+#include <signal.h>
+#ifdef SLANG
+# include <slcurses.h>
+#else
+# include <curses.h>
+#endif
+
+#define	OTHER	1-turn
+
+char numbers = " 0 1 2 3 4 5 6 7 8 9";
+
+char carrier = "Aircraft Carrier";
+char battle = "Battleship";
+char sub = "Submarine";
+char destroy = "Destroyer";
+char ptboat = "PT Boat";
+
+char name40;
+char dftname = "Stranger";
+
+struct _ships {
+ char *name;
+ char symbol;
+ char length;
+ char start;		/* Coordinates - 0,0=0; 10,10=100. */
+ char dir;		/* Direction - 0 = right; 1 = down. */
+ char hits;		/* How many times has this ship been hit? (-1==sunk) */
+};
+
+struct _ships plyship = {
+ { carrier,'A',5,0,0,0 },
+ { battle,'B',4,0,0,0 },
+ { destroy,'D',3,0,0,0 },
+ { sub,'S',3,0,0,0 },
+ { ptboat,'P',2,0,0,0 },
+};
+
+struct _ships cpuship = {
+ { carrier,'A',5,0,0,0 },
+ { battle,'B',4,0,0,0 },
+ { destroy,'D',3,0,0,0 },
+ { sub,'S',3,0,0,0 },
+ { ptboat,'P',2,0,0,0 },
+};
+
+char hits2100, board2100;	/* "Hits" board, and main board. */
+
+int srchstep;
+int cpuhits;
+int cstart, cdir;
+int plywon=0, cpuwon=0;			/* How many games has each won? */
+int turn;				/* 0=player, 1=computer */
+int huntoffs;				/* Offset on search strategy */
+
+int salvo, blitz, ask, seemiss;		/* options */
+
+void intro(void);
+void initgame(void);
+int rnd(int);
+void plyplace(struct _ships *);
+int getdir(void);
+void placeship(struct _ships *, int, int);
+int checkplace(struct _ships *, int, int);
+void error(char *);
+void prompt(void);
+char getcoord(void);
+void cpuplace(struct _ships *);
+int awinna(void);
+int plyturn(void);
+int hitship(int);
+int cputurn(void);
+int playagain(void);
+void uninitgame();
+int sgetc(char *);
+int do_options(int, char *);
+int scount(int);
+
+int
+main(int argc, char **argv)
+{
+ do_options(argc, argv);
+
+ intro();
+ do {
+		initgame();
+		while(awinna() == -1) {
+		 if (!blitz) {
+				if (!salvo) {
+		 	 if (turn)
+		 	 	cputurn();
+		 	 else plyturn();
+				} else {
+				 register int i;
+
+				 i = scount(turn);
+				 while (i--) {
+					 	if (turn)
+					 	 if (cputurn())
+							 	if (awinna() != -1)
+							 	i = 0;
+					 	else
+					 	 if(plyturn())
+							 	if (awinna() != -1)
+							 	i = 0;
+				 	}
+			 }
+		 } else {
+		 	while((turn) ? cputurn() : plyturn());
+		 }
+		 turn = OTHER;
+		}
+ } while(playagain());
+ uninitgame();
+ exit(0);
+}
+
+#define	PR	addstr
+
+void
+intro()
+{
+char *tmpname;
+
+ srand(time(0L));			/* Kick the random number generator */
+
+ signal(SIGINT,uninitgame);
+ if(signal(SIGQUIT,SIG_IGN) != SIG_IGN) signal(SIGQUIT,uninitgame);
+#if 1
+	/* for some bizzare reason, getlogin or cuserid cause havoc with the terminal */
+	if ((tmpname = getlogin()) != NULL) {
+		strcpy(name, tmpname);
+	} else
+#endif
+	strcpy(name,dftname);
+ name0 = toupper(name0);
+
+ initscr();
+ savetty();
+ nonl();
+ cbreak();
+ noecho();
+ clear();
+ mvaddstr(4,29,"Welcome to Battleship!");
+ move(8,0);
+PR(" \\\n");
+PR(" \\ \\ \\\n");
+PR(" \\ \\ \\ \\ \\_____________\n");
+PR(" \\ \\ \\_____________ \\ \\/ |\n");
+PR(" \\ \\/ \\ \\/ |\n");
+PR(" \\/ \\_____/ |__\n");
+PR(" ________________/ |\n");
+PR(" \\ S.S. Penguin |\n");
+PR(" \\ /\n");
+PR(" \\___________________________________________________/\n");
+ mvaddstr(20,27,"Hit any key to continue..."); refresh();
+ getch();
+}
+
+void
+initgame()
+{
+int i;
+
+ clear();
+ mvaddstr(0,35,"BATTLESHIP");
+ mvaddstr(4,12,"Main Board");
+ mvaddstr(6,0,numbers);
+ move(7,0);
+ for(i=0; i<10; ++i){
+		printw("%c . . . . . . . . . . %c\n",i+'A',i+'A');
+	}
+ mvaddstr(17,0,numbers);
+ mvaddstr(4,55,"Hit/Miss Board");
+ mvaddstr(6,45,numbers);
+ for(i=0; i<10; ++i){
+		mvprintw(7+i,45,"%c . . . . . . . . . . %c",i+'A',i+'A');
+	}
+ mvaddstr(17,45,numbers);
+ for(turn=0; turn<2; ++turn)
+	for(i=0; i<100; ++i){
+	 hitsturni = boardturni = 0;
+ }
+ for(turn=0; turn<2; ++turn){
+	for(i=0; i<5; ++i)
+	 if (!turn)
+	 	plyplace(&plyshipi);
+	 else
+	 	cpuplace(&cpushipi);
+	}
+ turn = rnd(2);
+ cstart = cdir = -1;
+ cpuhits = 0;
+ srchstep = 3;
+ huntoffs = rnd(srchstep);
+}
+
+int
+rnd(int n)
+{
+ return(((rand() & 0x7FFF) % n));
+}
+
+void
+plyplace(ss)
+struct _ships *ss;
+{
+int c, d;
+
+ do {
+		prompt();
+		printw("Place your %s (ex.%c%d) ? ",ss->name,rnd(10)+'A',rnd(10));
+		c = getcoord();
+		d = getdir();
+	} while(!checkplace(ss,c,d));
+ placeship(ss,c,d);
+}
+
+int
+getdir()
+{
+
+ prompt();
+ addstr("What direction (0=right, 1=down) ? ");
+ return(sgetc("01")-'0');
+}
+
+void
+placeship(ss,c,d)
+struct _ships *ss;
+int c, d;
+{
+int x, y, l, i;
+
+ for(l=0; l<ss->length; ++l){
+		i = c + l * ((d) ? 10 : 1);
+		boardturni = ss->symbol;
+		x = (i % 10) * 3 + 3;
+		y = (i / 10) + 7;
+		if(!turn) mvaddch(y,x,ss->symbol);
+	}
+ ss->start = c;
+ ss->dir = d;
+ ss->hits = 0;
+}
+
+int
+checkplace(ss,c,d)
+struct _ships *ss;
+int c, d;
+{
+int x, y, l;
+
+ x = c%10; y = c/10;
+ if(((x+ss->length) > 10 && !d) || ((y+ss->length) > 10 && d==1)){
+	if(!turn)
+	 switch(rnd(3)){
+		case 0:
+		 error("Ship is hanging from the edge of the world");
+		 break;
+		case 1:
+		 error("Try fitting it on the board");
+		 break;
+		case 2:
+		 error("Figure I won't find it if you put it there?");
+		 break;
+		}
+	return(0);
+	}
+ for(l=0; l<ss->length; ++l){
+	x = c + l * ((d) ? 10 : 1);
+	if(boardturnx){
+	 if(!turn)
+		switch(rnd(3)){
+		 case 0:
+			error("There's already a ship there");
+			break;
+		 case 1:
+			error("Collision alert! Aaaaaagh!");
+			break;
+		 case 2:
+			error("Er, Admiral, what about the other ship?");
+			break;
+		 }
+	 return(0);
+	 }
+	}
+ return(1);
+}
+
+void
+error(s)
+char *s;
+{
+ prompt();
+ beep();
+ printw("%s -- hit any key to continue --",s);
+ refresh();
+ getch();
+}
+
+void
+prompt(){
+ move(22,0);
+ clrtoeol();
+}
+
+char
+getcoord()
+{
+int ch, x, y;
+
+redo:
+ y = sgetc("ABCDEFGHIJ");
+ do {
+		ch = getch();
+		if (ch == 0x7F || ch == 8) {
+	 	addstr("\b \b");
+	 	refresh();
+	 	goto redo;
+	 }
+	} while(ch < '0' || ch > '9');
+ addch(x = ch);
+ refresh();
+ return((y-'A')*10+x-'0');
+}
+
+void
+cpuplace(ss)
+struct _ships *ss;
+{
+int c, d;
+
+ do{
+		c = rnd(100);
+		d = rnd(2);
+	} while(!checkplace(ss,c,d));
+ placeship(ss,c,d);
+}
+
+int
+awinna()
+{
+int i, j;
+struct _ships *ss;
+
+ for (i = 0; i < 2; ++i) {
+		ss = (i) ? cpuship : plyship;
+		for(j=0; j<5; ++j, ++ss)
+		 if(ss->length != ss->hits)
+				break;
+		if(j == 5) return(OTHER);
+	}
+ return(-1);
+}
+
+int
+plyturn()
+{
+int c, res;
+char *m;
+
+ prompt();
+ addstr("Where do you want to shoot? ");
+ c = getcoord();
+ if(!(res = hitsturnc)){
+	hitsturnc = res = (boardOTHERc) ? 'H' : 'M';
+	mvaddch(7+c/10,48+3*(c%10),(res=='H') ? 'H' : 'o');
+	if(0 != (c = hitship(c))){
+	 prompt();
+	 switch(rnd(3)){
+		case 0:
+		 m = "You sank my %s!";
+		 break;
+		case 1:
+		 m = "I have this sinking feeling about my %s....";
+		 break;
+		case 2:
+		 m = "Have some mercy for my %s!";
+		 break;
+		}
+	 move(23,0);
+	 clrtoeol();
+	 beep();
+	 printw(m,cpushipc-1.name); refresh();
+	 return(awinna() == -1);
+	 }
+	}
+ prompt();
+ move(23,0); clrtoeol();
+ printw("You %s.",(res=='M')?"missed":"scored a hit"); refresh();
+ return(res == 'H');
+}
+
+int
+hitship(c)
+int c;
+{
+struct _ships *ss;
+int sym, i, j;
+
+ ss = (turn) ? plyship : cpuship;
+ if (!(sym = boardOTHERc)) return(0);
+ for (i = 0; i < 5; ++i, ++ss)
+	if (ss->symbol == sym) {
+	 j = ss->hits;
+	 ++j;
+	 ss->hits = j;
+	 if (j == ss->length)
+	 	return(i+1);
+	 return(0);
+	 }
+ return 0;
+}
+
+int
+cputurn()
+{
+int c, res, x, y, i, d;
+
+redo:
+ if (cstart == -1){
+		if (cpuhits){
+		 for(i=0, c=rnd(100); i<100; ++i, c = (c+1) % 100)
+			if(hitsturnc == 'H')
+			 break;
+		 if(i != 100){
+				cstart = c;
+				cdir = -1;
+				goto fndir;
+			}
+	 }
+		do {
+		 i = 0;
+		 do{
+				while(hitsturnc=rnd(100));
+				x = c % 10; y = c / 10;
+				if(++i == 1000) break;
+			} while(((x+huntoffs) % srchstep) != (y % srchstep));
+		 if(i == 1000) --srchstep;
+	 } while(i == 1000);
+	}
+ else if(cdir == -1){
+fndir:	for(i=0, d=rnd(4); i++ < 4; d = (d+1) % 4){
+		 x = cstart%10; y = cstart/10;
+		 switch(d){
+				case 0: ++x; break;
+				case 1: ++y; break;
+				case 2: --x; break;
+				case 3: --y; break;
+			}
+		 if(x<0 || x>9 || y<0 || y>9) continue;
+		 if(hitsturnc=y*10+x) continue;
+		 cdir = -2;
+		 break;
+	 }
+		if(i == 4){
+		 cstart = -1;
+		 goto redo;
+	 }
+	}
+ else{
+		x = cstart%10; y = cstart/10;
+		switch(cdir){
+		 case 0: ++x; break;
+		 case 1: ++y; break;
+		 case 2: --x; break;
+		 case 3: --y; break;
+	 }
+		if(x<0 || x>9 || y<0 || y>9 || hitsturny*10+x){
+		 cdir = (cdir+2) % 4;
+		 for(;;){
+				switch(cdir){
+				 case 0: ++x; break;
+				 case 1: ++y; break;
+				 case 2: --x; break;
+				 case 3: --y; break;
+			 }
+				if(x<0 || x>9 || y<0 || y>9){ cstart = -1;
+				goto redo;
+			}
+			if(!hitsturny*10+x) break;
+		}
+ }
+	c = y*10 + x;
+	}
+
+ if (!ask) {
+ res = (boardOTHERc) ? 'H' : 'M';
+ move(21,0); clrtoeol();
+ printw("I shoot at %c%d. I %s!",c/10+'A',c%10,(res=='H')?"hit":"miss");
+ } else {
+ for(;;){
+	 prompt();
+	 printw("I shoot at %c%d. Do I (H)it or (M)iss? ",c/10+'A',c%10);
+	 res = sgetc("HM");
+	 if((res=='H' && !boardOTHERc) || (res=='M' && boardOTHERc)){
+	 error("You lie!");
+	 continue;
+	 }
+	 break;
+	 }
+ addch(res);
+ }
+ hitsturnc = res;
+ if(res == 'H') {
+	++cpuhits;
+	if(cstart == -1) cdir = -1;
+	cstart = c;
+	if(cdir == -2) cdir = d;
+	mvaddch(7+(c/10),3+3*(c%10),'*');
+	if (blitz && !ask) {
+	 refresh();
+	 sleep(1);
+	}
+ }
+ else {
+	if (seemiss) {
+	 mvaddch(7+(c/10),3+3*(c%10),' ');
+	} else {
+	 if(cdir == -2) cdir = -1;
+	}
+ }
+ if(0 != (c=hitship(c))){
+	cstart = -1;
+	cpuhits -= plyshipc-1.length;
+	x = plyshipc-1.start;
+	d = plyshipc-1.dir;
+	y = plyshipc-1.length;
+	for(i=0; i<y; ++i){
+	 hitsturnx = '*';
+	 x += (d) ? 10 : 1;
+	 }
+	}
+ if (salvo && !ask) {
+	refresh();
+	sleep(1);
+ }
+ if(awinna() != -1) return(0);
+ return(res == 'H');
+}
+
+int
+playagain()
+{
+int i, x, y, dx, dy, j;
+
+ for(i=0; i<5; ++i){
+	x = cpushipi.start; y = x/10+7; x = (x % 10) * 3 + 48;
+	dx = (cpushipi.dir) ? 0 : 3;
+	dy = (cpushipi.dir) ? 1 : 0;
+	for(j=0; j < cpushipi.length; ++j){
+	 mvaddch(y,x,cpushipi.symbol);
+	 x += dx; y += dy;
+	 }
+	}
+
+ if(awinna()) ++cpuwon; else ++plywon;
+ i = 18 + strlen(name);
+ if(plywon >= 10) ++i;
+ if(cpuwon >= 10) ++i;
+ mvprintw(2,(80-i)/2,"%s: %d Computer: %d",name,plywon,cpuwon);
+
+ prompt();
+ printw((awinna()) ? "Want to be humiliated again, %s? "
+		 : "Going to give me a chance for revenge, %s? ",name);
+ return(sgetc("YN") == 'Y');
+}
+
+void
+uninitgame(int sig)
+{
+ refresh();
+ endwin();
+ exit(0);
+}
+
+int
+sgetc(s)
+char *s;
+{
+char *s1;
+int ch;
+
+ refresh();
+ for (;;) {
+		ch = toupper(getch());
+		for (s1 = s; *s1 && ch != *s1; ++s1);
+		if (*s1) {
+	 	addch(ch);
+	 	refresh();
+	 	return(ch);
+	 }
+	}
+}
+
+/*
+ * I should use getopts() from libc.a, but I'm leary that other UNIX
+ * systems might not have it, although I'd love to use it.
+ */
+
+int
+do_options(c,op)
+int c;
+char *op;
+{
+register int i;
+
+ if (c > 1) {
+		for (i=1; i<c; i++) {
+		 switch(opi0) {
+		 default:
+		 case '?':
+			fprintf(stderr, "Usage: battle -s | -b -a -m \n");
+			fprintf(stderr, "\tWhere the options are:\n");
+			fprintf(stderr, "\t-s : play a salvo game (mutex with -b)\n");
+			fprintf(stderr, "\t-b : play a blitz game (mutex with -s)\n");
+			fprintf(stderr, "\t-a : computer asks you for hit/miss\n");
+			fprintf(stderr, "\t-m : computer misses are displayed\n");
+			exit(1);
+			break;
+		 case '-':
+			switch(opi1) {
+			case 'b':
+			 blitz = 1;
+			 if (salvo == 1) {
+				fprintf(stderr,
+				 "Bad Arg: -b and -s are mutually exclusive\n");
+				exit(1);
+			 }
+			 break;
+			case 's':
+			 salvo = 1;
+			 if (blitz == 1) {
+				fprintf(stderr,
+				 "Bad Arg: -s and -b are mutually exclusive\n");
+				exit(1);
+			 }
+			 break;
+			case 'a':
+			 ask = 1;
+			 break;
+			case 'm':
+			 seemiss = 1;
+			 break;
+			default:
+			 fprintf(stderr,
+				"Bad Arg: type \"%s ?\" for usage message\n", op0);
+			 exit(1);
+			}
+ 		 }
+		}
+		fprintf(stdout, "Playing optional game (");
+		if (salvo)
+		 fprintf(stdout, "salvo, noblitz, ");
+		else if (blitz)
+			 fprintf(stdout, "blitz, nosalvo, ");
+			else
+			 fprintf(stdout, "noblitz, nosalvo, ");
+
+		if (ask)
+		 fprintf(stdout, "ask, ");
+		else
+		 fprintf(stdout, "noask, ");
+
+		if (seemiss)
+		 fprintf(stdout, "seemiss)\n");
+		else
+		 fprintf(stdout, "noseemiss)\n");
+	}
+ else
+	fprintf(stdout,
+	 "Playing standard game (no blitz, no slavo, no ask, no seemiss)\n");
+ sleep(2);
+ return(0);
+}
+
+int
+scount(who)
+int who;
+{
+int i, shots;
+struct _ships *sp;
+
+ if (who) {
+	/* count cpu shots */
+	sp = cpuship;
+ } else {
+	/* count player shots */
+	sp = plyship;
+ }
+ for (i=0, shots = 0; i<5; i++, sp++) {
+	/* extra test for machines with unsigned chars! */
+	if (sp->hits == (char) -1 || sp->hits >= sp->length) {
+	 continue;	/* dead ship */
+	} else {
+	 shots++;
+	}
+ }
+ return(shots);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/curses/blue.c Added

@@ -0,0 +1,415 @@
+/*****************************************************************************
+ * *
+ * B l u e M o o n *
+ * ================= *
+ * V2.2 *
+ * A patience game by T.A.Lister *
+ * Integral screen support by Eric S. Raymond *
+ * *
+ *****************************************************************************/
+
+/*
+ * Compile this with the command `cc -O blue.c -lcurses -o blue'. For best
+ * results, use the portable freeware ncurses(3) library. On non-Intel
+ * machines, SVr4 curses is just as good.
+ */
+
+#include <stdlib.h>
+#include <string.h>
+#include <unistd.h>
+#include <signal.h>
+#include <time.h>
+
+#if HAVE_TERMIOS_H
+#include <sys/termios.h>
+#endif
+
+#include <curses.h>
+#ifndef SLANG
+#include <term.h>
+#endif
+
+#define NOCARD		(-1)
+
+#define ACE		0
+#define KING		12
+#define SUIT_LENGTH	13
+
+#define HEARTS		0
+#define SPADES		1
+#define DIAMONDS	2
+#define CLUBS		3
+#define NSUITS		4
+
+#define GRID_WIDTH	14	/* 13+1 */
+#define GRID_LENGTH	56	/* 4*(13+1) */
+#define PACK_SIZE	52
+
+#define BASEROW		1
+#define PROMPTROW	11
+
+static int deck_size = PACK_SIZE;	/* initial deck */
+static int deckPACK_SIZE;
+
+static int gridGRID_LENGTH;	/* card layout grid */
+static int freeptr4;		/* free card space pointers */
+
+static int deal_number=0;
+
+static chtype ranksSUIT_LENGTH2 =
+{
+ {' ', 'A'},
+ {' ', '2'},
+ {' ', '3'},
+ {' ', '4'},
+ {' ', '5'},
+ {' ', '6'},
+ {' ', '7'},
+ {' ', '8'},
+ {' ', '9'},
+ {'1', '0'},
+ {' ', 'J'},
+ {' ', 'Q'},
+ {' ', 'K'}
+};
+
+static chtype letters =
+{
+ 'h' | COLOR_PAIR(COLOR_RED),	/* hearts */
+ 's' | COLOR_PAIR(COLOR_GREEN),	/* spades */
+ 'd' | COLOR_PAIR(COLOR_RED),	/* diamonds */
+ 'c' | COLOR_PAIR(COLOR_GREEN),	/* clubs */
+};
+
+#if defined(__i386__)
+static chtype glyphs =
+{
+ '\003' | A_ALTCHARSET | COLOR_PAIR(COLOR_RED),	/* hearts */
+ '\006' | A_ALTCHARSET | COLOR_PAIR(COLOR_GREEN),	/* spades */
+ '\004' | A_ALTCHARSET | COLOR_PAIR(COLOR_RED),	/* diamonds */
+ '\005' | A_ALTCHARSET | COLOR_PAIR(COLOR_GREEN),	/* clubs */
+};
+#endif /* __i386__ */
+
+static chtype *suits = letters;	/* this may change to glyphs below */
+
+static void die(int onsig)
+{
+ signal(onsig, SIG_IGN);
+ endwin();
+ exit(0);
+}
+
+static void init_vars(void)
+{
+ int i;
+
+ deck_size = PACK_SIZE;
+ for (i=0; i < PACK_SIZE; i++)
+	decki=i;
+ for (i = 0; i < 4; i++)
+	freeptri=i * GRID_WIDTH;
+}
+
+static void shuffle(int size)
+{
+ int i,j,numswaps,swapnum,temp;
+
+ numswaps=size*10;		/* an arbitrary figure */
+
+ for (swapnum=0;swapnum<numswaps;swapnum++)
+ {
+	i=rand() % size;
+	j=rand() % size;
+	temp=decki;
+	decki=deckj;
+	deckj=temp;
+ }
+}
+
+static void deal_cards(void)
+{
+ int ptr, card=0, value, csuit, crank, suit, aces4;
+
+ for (suit=HEARTS;suit<=CLUBS;suit++)
+ {
+	ptr=freeptrsuit;
+	gridptr++=NOCARD;	/* 1st card space is blank */
+	while ((ptr % GRID_WIDTH) != 0)
+	{
+	 value=deckcard++;
+	 crank=value % SUIT_LENGTH;
+	 csuit=value / SUIT_LENGTH;
+	 if (crank==ACE)
+		acescsuit=ptr;
+	 gridptr++=value;
+	}
+ }
+
+ if (deal_number==1)		/* shift the aces down to the 1st column */
+	for (suit=HEARTS;suit<=CLUBS;suit++)
+	{
+	 gridsuit * GRID_WIDTH = suit * SUIT_LENGTH;
+	 gridacessuit=NOCARD;
+	 freeptrsuit=acessuit;
+	}
+}
+
+static void printcard(int value)
+{
+ (void) addch(' ');
+ if (value == NOCARD)
+	(void) addstr(" ");
+ else
+ {
+	addch(ranksvalue % SUIT_LENGTH0 | COLOR_PAIR(COLOR_BLUE));
+	addch(ranksvalue % SUIT_LENGTH1 | COLOR_PAIR(COLOR_BLUE));
+	addch(suitsvalue / SUIT_LENGTH);
+ }
+ (void) addch(' ');
+}
+
+static void display_cards(int deal)
+{
+ int row, card;
+
+ clear();
+ (void)printw(
+		 "Blue Moon 2.1 - by Tim Lister & Eric Raymond - Deal %d.\n",
+		 deal);
+ for(row=HEARTS;row<=CLUBS;row++)
+ {
+	move(BASEROW + row + row + 2, 1);
+	for(card=0;card<GRID_WIDTH;card++)
+	 printcard(gridrow * GRID_WIDTH + card);
+ }
+
+ move(PROMPTROW + 2, 0); refresh();
+#define P(x)	(void)printw("%s\n", x)
+P(" This 52-card solitaire starts with the entire deck shuffled and dealt");
+P("out in four rows. The aces are then moved to the left end of the layout,");
+P("making 4 initial free spaces. You may move to a space only the card that");
+P("matches the left neighbor in suit, and is one greater in rank. Kings are");
+P("high, so no cards may be placed to their right (they create dead spaces).");
+P(" When no moves can be made, cards still out of sequence are reshuffled");
+P("and dealt face up after the ends of the partial sequences, leaving a card");
+P("space after each sequence, so that each row looks like a partial sequence");
+P("followed by a space, followed by enough cards to make a row of 14. ");
+P(" A moment's reflection will show that this game cannot take more than 13");
+P("deals. A good score is 1-3 deals, 4-7 is average, 8 or more is poor. ");
+#undef P
+ refresh();
+}
+
+static int find(int card)
+{
+ int i;
+
+ if ((card<0) || (card>=PACK_SIZE))
+	return(NOCARD);
+ for(i = 0; i < GRID_LENGTH; i++)
+	if (gridi == card)
+	 return i;
+ return(NOCARD);
+}
+
+static void movecard(int src, int dst)
+{
+ griddst=gridsrc;
+ gridsrc=NOCARD;
+
+ move( BASEROW + (dst / GRID_WIDTH)*2+2, (dst % GRID_WIDTH)*5 + 1);
+ printcard(griddst);
+
+ move( BASEROW + (src / GRID_WIDTH)*2+2, (src % GRID_WIDTH)*5 + 1);
+ printcard(gridsrc);
+
+ refresh();
+}
+
+static void play_game(void)
+{
+ int dead=0, i, j;
+ char c;
+ int select4, card;
+
+ while (dead<4)
+ {
+	dead=0;
+	for (i=0;i<4;i++)
+	{
+	 card=gridfreeptri-1;
+
+	 if (	((card % SUIT_LENGTH)==KING)
+		||
+		(card==NOCARD)	)
+		selecti=NOCARD;
+	 else
+		selecti=find(card+1);
+
+	 if (selecti==NOCARD)
+		dead++;
+	};
+
+	if (dead < 4)
+	{
+	 char	liveNSUITS+1, *lp = live;
+
+	 for (i=0;i<4;i++)
+	 {
+		if (selecti != NOCARD)
+		{
+		 move(BASEROW + (selecti / GRID_WIDTH)*2+3,
+			 (selecti % GRID_WIDTH)*5);
+		 (void)printw(" %c ", *lp++ = 'a' + i);
+		}
+	 };
+	 *lp = '\0';
+
+	 if (strlen(live) == 1)
+	 {
+		move(PROMPTROW,0);
+		(void)printw(
+		 "Making forced moves... ");
+		refresh();
+		(void) sleep(1);
+		c = live0;
+	 }
+	 else
+	 {
+		char	bufBUFSIZ;
+
+		(void)sprintf(buf,
+			"Type %s to move, r to redraw, q or INTR to quit: ",
+			live);
+
+		do {
+		 move(PROMPTROW,0);
+		 (void) addstr(buf);
+		 move(PROMPTROW, (int)strlen(buf));
+		 clrtoeol();
+		 (void) addch(' ');
+		} while
+		 (((c = getch())<'a' || c>'d') && (c!='r') && (c!='q'));
+	 }
+
+	 for (j = 0; j < 4; j++)
+		if (selectj!=NOCARD)
+		{
+		 move(BASEROW + (selectj / GRID_WIDTH)*2+3,
+			 (selectj % GRID_WIDTH)*5);
+		 (void)printw(" ");
+		}
+
+	 if (c == 'r')
+		display_cards(deal_number);
+	 else if (c == 'q')
+		die(SIGINT);
+	 else
+	 {
+		i = c-'a';
+		if (selecti == NOCARD)
+		 beep();
+		else
+		{
+		 movecard(selecti, freeptri);
+		 freeptri=selecti;
+		}
+	 }
+	}
+ }
+
+ move(PROMPTROW, 0);
+ standout();
+ (void)printw("Finished deal %d - type any character to continue...", deal_number);
+ standend();
+ (void) getch();
+}
+
+static int collect_discards(void)
+{
+ int row, col, cardno=0, finish, gridno;
+
+ for (row=HEARTS;row<=CLUBS;row++)
+ {
+	finish=0;
+	for (col=1;col<GRID_WIDTH;col++)
+	{
+	 gridno=row * GRID_WIDTH + col;
+
+	 if ((gridgridno!=(gridgridno-1+1))&&(finish==0))
+	 {
+		finish=1;
+		freeptrrow=gridno;
+	 };
+
+	 if ((finish!=0)&&(gridgridno!=NOCARD))
+		deckcardno++=gridgridno;
+	}
+ }
+ return cardno;
+}
+
+static void game_finished(int deal)
+{
+ clear();
+ (void)printw("You finished the game in %d deals. This is ",deal);
+ standout();
+ if (deal<2)
+	(void)addstr("excellent");
+ else if (deal<4)
+	(void)addstr("good");
+ else if (deal<8)
+	(void)addstr("average");
+ else
+	(void)addstr("poor");
+ standend();
+ (void) addstr(". ");
+ refresh();
+}
+
+int main(int argc, char *argv)
+{
+ (void) signal(SIGINT, die);
+ initscr();
+
+ /*
+ * We use COLOR_GREEN because COLOR_BLACK is wired to the wrong thing.
+ */
+ start_color();
+ init_pair(COLOR_RED, COLOR_RED, COLOR_WHITE);
+ init_pair(COLOR_BLUE, COLOR_BLUE, COLOR_WHITE);
+ init_pair(COLOR_GREEN, COLOR_BLACK, COLOR_WHITE);
+
+#if defined(__i386__) && defined(A_ALTCHARSET)
+ if (tigetstr("smpch"))
+	suits = glyphs;
+#endif /* __i386__ && A_ALTCHARSET */
+
+ cbreak();
+
+ if (argc == 2)
+	srand((unsigned)atoi(argv1));
+ else
+	srand((unsigned)time((time_t *)0));
+
+ init_vars();
+
+ do{
+	deal_number++;
+	shuffle(deck_size);
+	deal_cards();
+	display_cards(deal_number);
+	play_game();
+ }
+ while
+	((deck_size=collect_discards()) != 0);
+
+ game_finished(deal_number);
+
+ die(SIGINT);
+ /*NOTREACHED*/
+ return 1;
+}
+
+/* blue.c ends here */

_service:tar_scm:slang-2.3.2.tar.bz2/src/curses/bs.c Added

@@ -0,0 +1,1252 @@
+/*
+ * bs.c - original author: Bruce Holloway
+ *		salvo option by: Chuck A DeGaul
+ * with improved user interface, autoconfiguration and code cleanup
+ *		by Eric S. Raymond <esr@snark.thyrsus.com>
+ * v1.2 with color support and minor portability fixes, November 1990
+ * v2.0 featuring strict ANSI/POSIX conformance, November 1993.
+ * v2.1 with ncurses mouse support, September 1995
+ */
+/* #define _POSIX_SOURCE -- incompatible with solaris termios.h */
+
+#include <signal.h>
+#include <ctype.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <string.h>
+#include <assert.h>
+#include <time.h>
+
+#if HAVE_TERMIOS_H
+#include <sys/termios.h>	/* required before solaris curses.h */
+#endif
+
+#include <curses.h>
+
+#ifndef SIGIOT
+#define SIGIOT SIGABRT
+#endif
+
+#ifndef A_UNDERLINE	/* BSD curses */
+#define	beep()	write(1,"\007",1);
+#define	cbreak	crmode
+#define	saveterm savetty
+#define	resetterm resetty
+#define	nocbreak nocrmode
+#define strchr	index
+#endif /* !A_UNDERLINE */
+
+static int getcoord(int);
+
+/*
+ * Constants for tuning the random-fire algorithm. It prefers moves that
+ * diagonal-stripe the board with a stripe separation of srchstep. If
+ * no such preferred moves are found, srchstep is decremented.
+ */
+#define BEGINSTEP	3	/* initial value of srchstep */
+
+/* miscellaneous constants */
+#define SHIPTYPES	5
+#define	OTHER		(1-turn)
+#define PLAYER		0
+#define COMPUTER	1
+#define MARK_HIT	'H'
+#define MARK_MISS	'o'
+#define CTRLC		'\003'	/* used as terminate command */
+#define FF		'\014'	/* used as redraw command */
+
+/* coordinate handling */
+#define BWIDTH		10
+#define BDEPTH		10
+
+/* display symbols */
+#define SHOWHIT		'*'
+#define SHOWSPLASH	' '
+#define IS_SHIP(c)	isupper(c)
+
+/* how to position us on player board */
+#define PYBASE	3
+#define PXBASE	3
+#define PY(y)	(PYBASE + (y))
+#define PX(x)	(PXBASE + (x)*3)
+#define pgoto(y, x)	(void)move(PY(y), PX(x))
+
+/* how to position us on cpu board */
+#define CYBASE	3
+#define CXBASE	48
+#define CY(y)	(CYBASE + (y))
+#define CX(x)	(CXBASE + (x)*3)
+#define CYINV(y)	((y) - CYBASE)
+#define CXINV(x)	(((x) - CXBASE) / 3)
+#define cgoto(y, x)	(void)move(CY(y), CX(x))
+
+#define ONBOARD(x, y)	(x >= 0 && x < BWIDTH && y >= 0 && y < BDEPTH)
+
+/* other board locations */
+#define COLWIDTH	80
+#define PROMPTLINE	21			/* prompt line */
+#define SYBASE		CYBASE + BDEPTH + 3	/* move key diagram */
+#define SXBASE		63
+#define MYBASE		SYBASE - 1		/* diagram caption */
+#define MXBASE		64
+#define HYBASE		SYBASE - 1		/* help area */
+#define HXBASE		0
+
+/* this will need to be changed if BWIDTH changes */
+static char numbers = " 0 1 2 3 4 5 6 7 8 9";
+
+static char carrier = "Aircraft Carrier";
+static char battle = "Battleship";
+static char sub = "Submarine";
+static char destroy = "Destroyer";
+static char ptboat = "PT Boat";
+
+static char name40;
+static char dftname = "stranger";
+
+/* direction constants */
+#define E	0
+#define SE	1
+#define S	2
+#define SW	3
+#define W	4
+#define NW	5
+#define N	6
+#define NE	7
+static int xincr8 = {1, 1, 0, -1, -1, -1, 0, 1};
+static int yincr8 = {0, 1, 1, 1, 0, -1, -1, -1};
+
+/* current ship position and direction */
+static int curx = (BWIDTH / 2);
+static int cury = (BDEPTH / 2);
+
+typedef struct
+{
+ char *name;		/* name of the ship type */
+ unsigned hits;	/* how many times has this ship been hit? */
+ char symbol;	/* symbol for game purposes */
+ char length;	/* length of ship */
+ char x, y;		/* coordinates of ship start point */
+ unsigned char dir;	/* direction of `bow' */
+ bool placed;	/* has it been placed on the board? */
+}
+ship_t;
+
+static bool checkplace(int b, ship_t *ss, int vis);
+
+ship_t plyshipSHIPTYPES =
+{
+ { carrier,	0, 'A', 5},
+ { battle,	0, 'B', 4},
+ { destroy,	0, 'D', 3},
+ { sub,	0, 'S', 3},
+ { ptboat,	0, 'P', 2},
+};
+
+ship_t cpushipSHIPTYPES =
+{
+ { carrier,	0, 'A', 5},
+ { battle,	0, 'B', 4},
+ { destroy,	0, 'D', 3},
+ { sub,	0, 'S', 3},
+ { ptboat,	0, 'P', 2},
+};
+
+/* "Hits" board, and main board. */
+static char hits2BWIDTHBDEPTH, board2BWIDTHBDEPTH;
+
+static int turn;			/* 0=player, 1=computer */
+static int plywon=0, cpuwon=0;		/* How many games has each won? */
+
+static int salvo, blitz, closepack;
+
+#define	PR	(void)addstr
+
+static void uninitgame(int sig)
+/* end the game, either normally or due to signal */
+{
+ clear();
+ (void)refresh();
+ (void)resetterm();
+ (void)echo();
+ (void)endwin();
+ exit(sig);
+}
+
+static void announceopts(void)
+/* announce which game options are enabled */
+{
+ if (salvo || blitz || closepack)
+ {
+	(void) printw("Playing optional game (");
+	if (salvo)
+	 (void) printw("salvo, ");
+	else
+	 (void) printw("nosalvo, ");
+	if (blitz)
+	 (void) printw("blitz ");
+	else
+	 (void) printw("noblitz, ");
+	if (closepack)
+	 (void) printw("closepack)");
+	else
+	 (void) printw("noclosepack)");
+ }
+ else
+	(void) printw(
+	"Playing standard game (noblitz, nosalvo, noclosepack)");
+}
+
+static void intro(void)
+{
+ extern char *getlogin(void);
+ char *tmpname;
+
+ srand((unsigned)(time(0L)+getpid()));	/* Kick the random number generator */
+
+ (void) signal(SIGINT,uninitgame);
+ (void) signal(SIGINT,uninitgame);
+ (void) signal(SIGIOT,uninitgame);		/* for assert(3) */
+ if(signal(SIGQUIT,SIG_IGN) != SIG_IGN)
+	(void)signal(SIGQUIT,uninitgame);
+
+ if((tmpname = getlogin()) != 0)
+ {
+	(void)strcpy(name,tmpname);
+	name0 = toupper(name0);
+ }
+ else
+	(void)strcpy(name,dftname);
+
+ (void)initscr();
+#ifdef KEY_MIN
+ keypad(stdscr, TRUE);
+#endif /* KEY_MIN */
+ (void)saveterm();
+ (void)nonl();
+ (void)cbreak();
+ (void)noecho();
+
+#ifdef PENGUIN
+ (void)clear();
+ (void)mvaddstr(4,29,"Welcome to Battleship!");
+ (void)move(8,0);
+ PR(" \\\n");
+ PR(" \\ \\ \\\n");
+ PR(" \\ \\ \\ \\ \\_____________\n");
+ PR(" \\ \\ \\_____________ \\ \\/ |\n");
+ PR(" \\ \\/ \\ \\/ |\n");
+ PR(" \\/ \\_____/ |__\n");
+ PR(" ________________/ |\n");
+ PR(" \\ S.S. Penguin |\n");
+ PR(" \\ /\n");
+ PR(" \\___________________________________________________/\n");
+
+ (void) mvaddstr(22,27,"Hit any key to continue..."); (void)refresh();
+ (void) getch();
+#endif /* PENGUIN */
+
+#ifdef A_COLOR
+ start_color();
+
+ init_pair(COLOR_BLACK, COLOR_BLACK, COLOR_BLACK);
+ init_pair(COLOR_GREEN, COLOR_GREEN, COLOR_BLACK);
+ init_pair(COLOR_RED, COLOR_RED, COLOR_BLACK);
+ init_pair(COLOR_CYAN, COLOR_CYAN, COLOR_BLACK);
+ init_pair(COLOR_WHITE, COLOR_WHITE, COLOR_BLACK);
+ init_pair(COLOR_MAGENTA, COLOR_MAGENTA, COLOR_BLACK);
+ init_pair(COLOR_BLUE, COLOR_BLUE, COLOR_BLACK);
+ init_pair(COLOR_YELLOW, COLOR_YELLOW, COLOR_BLACK);
+#endif /* A_COLOR */
+
+#ifdef NCURSES_MOUSE_VERSION
+ (void) mousemask(BUTTON1_CLICKED, (mmask_t *)NULL);
+#endif /* NCURSES_MOUSE_VERSION*/
+}
+
+/* VARARGS1 */
+static void prompt(int n, char *f, char *s)
+/* print a message at the prompt line */
+{
+ (void) move(PROMPTLINE + n, 0);
+ (void) clrtoeol();
+ (void) printw(f, s);
+ (void) refresh();
+}
+
+static void error(char *s)
+{
+ (void) move(PROMPTLINE + 2, 0);
+ (void) clrtoeol();
+ if (s)
+ {
+	(void) addstr(s);
+	(void) beep();
+ }
+}
+
+static void placeship(int b, ship_t *ss, int vis)
+{
+ int l;
+
+ for(l = 0; l < ss->length; ++l)
+ {
+	int newx = ss->x + l * xincrss->dir;
+	int newy = ss->y + l * yincrss->dir;
+
+	boardbnewxnewy = ss->symbol;
+	if (vis)
+	{
+	 pgoto(newy, newx);
+	 (void) addch((chtype)ss->symbol);
+	}
+ }
+ ss->hits = 0;
+}
+
+static int rnd(int n)
+{
+ return(((rand() & 0x7FFF) % n));
+}
+
+static void randomplace(int b, ship_t *ss)
+/* generate a valid random ship placement into px,py */
+{
+ register int bwidth = BWIDTH - ss->length;
+ register int bdepth = BDEPTH - ss->length;
+
+ do {
+	ss->y = rnd(bdepth);
+	ss->x = rnd(bwidth);
+	ss->dir = rnd(2) ? E : S;
+ } while
+	(!checkplace(b, ss, FALSE));
+}
+
+static void initgame(void)
+{
+ int i, j, unplaced;
+ ship_t *ss;
+
+ (void) clear();
+ (void) mvaddstr(0,35,"BATTLESHIPS");
+ (void) move(PROMPTLINE + 2, 0);
+ announceopts();
+
+ memset(board, 0, sizeof(char) * BWIDTH * BDEPTH * 2);
+ memset(hits, 0, sizeof(char) * BWIDTH * BDEPTH * 2);
+ for (i = 0; i < SHIPTYPES; i++)
+ {
+	ss = cpuship + i;
+	ss->x = ss->y = ss->dir = ss->hits = ss->placed = 0;
+	ss = plyship + i;
+	ss->x = ss->y = ss->dir = ss->hits = ss->placed = 0;
+ }
+
+ /* draw empty boards */
+ (void) mvaddstr(PYBASE - 2, PXBASE + 5, "Main Board");
+ (void) mvaddstr(PYBASE - 1, PXBASE - 3,numbers);
+ for(i=0; i < BDEPTH; ++i)
+ {
+	(void) mvaddch(PYBASE + i, PXBASE - 3, (chtype)(i + 'A'));
+#ifdef A_COLOR
+	if (has_colors())
+	 attron(COLOR_PAIR(COLOR_BLUE));
+#endif /* A_COLOR */
+	(void) addch(' ');
+	for (j = 0; j < BWIDTH; j++)
+	 (void) addstr(" . ");
+#ifdef A_COLOR
+	attrset(0);
+#endif /* A_COLOR */
+	(void) addch(' ');
+	(void) addch((chtype)(i + 'A'));
+ }
+ (void) mvaddstr(PYBASE + BDEPTH, PXBASE - 3,numbers);
+ (void) mvaddstr(CYBASE - 2, CXBASE + 7,"Hit/Miss Board");
+ (void) mvaddstr(CYBASE - 1, CXBASE - 3, numbers);
+ for(i=0; i < BDEPTH; ++i)
+ {
+	(void) mvaddch(CYBASE + i, CXBASE - 3, (chtype)(i + 'A'));
+#ifdef A_COLOR
+	if (has_colors())
+	 attron(COLOR_PAIR(COLOR_BLUE));
+#endif /* A_COLOR */
+	(void) addch(' ');
+	for (j = 0; j < BWIDTH; j++)
+	 (void) addstr(" . ");
+#ifdef A_COLOR
+	attrset(0);
+#endif /* A_COLOR */
+	(void) addch(' ');
+	(void) addch((chtype)(i + 'A'));
+ }
+
+ (void) mvaddstr(CYBASE + BDEPTH,CXBASE - 3,numbers);
+
+ (void) mvprintw(HYBASE, HXBASE,
+		 "To position your ships: move the cursor to a spot, then");
+ (void) mvprintw(HYBASE+1,HXBASE,
+		 "type the first letter of a ship type to select it, then");
+ (void) mvprintw(HYBASE+2,HXBASE,
+		 "type a direction (hjkl or 4862), indicating how the");
+ (void) mvprintw(HYBASE+3,HXBASE,
+		 "ship should be pointed. You may also type a ship letter");
+ (void) mvprintw(HYBASE+4,HXBASE,
+		 "followed by `r' to position it randomly, or type `R' to");
+ (void) mvprintw(HYBASE+5,HXBASE,
+		 "place all remaining ships randomly.");
+
+ (void) mvaddstr(MYBASE, MXBASE, "Aiming keys:");
+ (void) mvaddstr(SYBASE, SXBASE, "y k u 7 8 9");
+ (void) mvaddstr(SYBASE+1, SXBASE, " \\|/ \\|/ ");
+ (void) mvaddstr(SYBASE+2, SXBASE, "h-+-l 4-+-6");
+ (void) mvaddstr(SYBASE+3, SXBASE, " /|\\ /|\\ ");
+ (void) mvaddstr(SYBASE+4, SXBASE, "b j n 1 2 3");
+
+ /* have the computer place ships */
+ for(ss = cpuship; ss < cpuship + SHIPTYPES; ss++)
+ {
+	randomplace(COMPUTER, ss);
+	placeship(COMPUTER, ss, FALSE);
+ }
+
+ ss = (ship_t *)NULL;
+ do {
+	char c, dockedSHIPTYPES + 2, *cp = docked;
+
+	/* figure which ships still wait to be placed */
+	*cp++ = 'R';
+	for (i = 0; i < SHIPTYPES; i++)
+	 if (!plyshipi.placed)
+		*cp++ = plyshipi.symbol;
+	*cp = '\0';
+
+	/* get a command letter */
+	prompt(1, "Type one of %s to pick a ship.", docked+1);
+	do {
+	 c = getcoord(PLAYER);
+	} while
+	 (!strchr(docked, c));
+
+	if (c == 'R')
+	 (void) ungetch('R');
+	else
+	{
+	 /* map that into the corresponding symbol */
+	 for (ss = plyship; ss < plyship + SHIPTYPES; ss++)
+		if (ss->symbol == c)
+		 break;
+
+	 prompt(1, "Type one of hjklrR to place your %s.", ss->name);
+	 pgoto(cury, curx);
+	}
+
+	do {
+	 c = getch();
+	} while
+	 (!strchr("hjklrR", c) || c == FF);
+
+	if (c == FF)
+	{
+	 (void)clearok(stdscr, TRUE);
+	 (void)refresh();
+	}
+	else if (c == 'r')
+	{
+	 prompt(1, "Random-placing your %s", ss->name);
+	 randomplace(PLAYER, ss);
+	 placeship(PLAYER, ss, TRUE);
+	 error((char *)NULL);
+	 ss->placed = TRUE;
+	}
+	else if (c == 'R')
+	{
+	 prompt(1, "Placing the rest of your fleet at random...", "");
+	 for (ss = plyship; ss < plyship + SHIPTYPES; ss++)
+		if (!ss->placed)
+		{
+		 randomplace(PLAYER, ss);
+		 placeship(PLAYER, ss, TRUE);
+		 ss->placed = TRUE;
+		}
+	 error((char *)NULL);
+	}
+	else if (strchr("hjkl8462", c))
+	{
+	 ss->x = curx;
+	 ss->y = cury;
+
+	 switch(c)
+	 {
+	 case 'k': case '8': ss->dir = N; break;
+	 case 'j': case '2': ss->dir = S; break;
+	 case 'h': case '4': ss->dir = W; break;
+	 case 'l': case '6': ss->dir = E; break;
+	 }
+
+	 if (checkplace(PLAYER, ss, TRUE))
+	 {
+		placeship(PLAYER, ss, TRUE);
+		error((char *)NULL);
+		ss->placed = TRUE;
+	 }
+	}
+
+	for (unplaced = i = 0; i < SHIPTYPES; i++)
+	 unplaced += !plyshipi.placed;
+ } while
+	(unplaced);
+
+ turn = rnd(2);
+
+ (void) mvprintw(HYBASE, HXBASE,
+		 "To fire, move the cursor to your chosen aiming point ");
+ (void) mvprintw(HYBASE+1, HXBASE,
+		 "and strike any key other than a motion key. ");
+ (void) mvprintw(HYBASE+2, HXBASE,
+		 " ");
+ (void) mvprintw(HYBASE+3, HXBASE,
+		 " ");
+ (void) mvprintw(HYBASE+4, HXBASE,
+		 " ");
+ (void) mvprintw(HYBASE+5, HXBASE,
+		 " ");
+
+ (void) prompt(0, "Press any key to start...", "");
+ (void) getch();
+}
+
+static int getcoord(int atcpu)
+{
+ int ny, nx, c;
+
+ if (atcpu)
+	cgoto(cury,curx);
+ else
+	pgoto(cury, curx);
+ (void)refresh();
+ for (;;)
+ {
+	if (atcpu)
+	{
+	 (void) mvprintw(CYBASE + BDEPTH+1, CXBASE+11, "(%d, %c)", curx, 'A'+cury);
+	 cgoto(cury, curx);
+	}
+	else
+	{
+	 (void) mvprintw(PYBASE + BDEPTH+1, PXBASE+11, "(%d, %c)", curx, 'A'+cury);
+	 pgoto(cury, curx);
+	}
+
+	switch(c = getch())
+	{
+	case 'k': case '8':
+#ifdef KEY_MIN
+	case KEY_UP:
+#endif /* KEY_MIN */
+	 ny = cury+BDEPTH-1; nx = curx;
+	 break;
+	case 'j': case '2':
+#ifdef KEY_MIN
+	case KEY_DOWN:
+#endif /* KEY_MIN */
+	 ny = cury+1; nx = curx;
+	 break;
+	case 'h': case '4':
+#ifdef KEY_MIN
+	case KEY_LEFT:
+#endif /* KEY_MIN */
+	 ny = cury; nx = curx+BWIDTH-1;
+	 break;
+	case 'l': case '6':
+#ifdef KEY_MIN
+	case KEY_RIGHT:
+#endif /* KEY_MIN */
+	 ny = cury; nx = curx+1;
+	 break;
+	case 'y': case '7':
+#ifdef KEY_MIN
+	case KEY_A1:
+#endif /* KEY_MIN */
+	 ny = cury+BDEPTH-1; nx = curx+BWIDTH-1;
+	 break;
+	case 'b': case '1':
+#ifdef KEY_MIN
+	case KEY_C1:
+#endif /* KEY_MIN */
+	 ny = cury+1; nx = curx+BWIDTH-1;
+	 break;
+	case 'u': case '9':
+#ifdef KEY_MIN
+	case KEY_A3:
+#endif /* KEY_MIN */
+	 ny = cury+BDEPTH-1; nx = curx+1;
+	 break;
+	case 'n': case '3':
+#ifdef KEY_MIN
+	case KEY_C3:
+#endif /* KEY_MIN */
+	 ny = cury+1; nx = curx+1;
+	 break;
+	case FF:
+	 nx = curx; ny = cury;
+	 (void)clearok(stdscr, TRUE);
+	 (void)refresh();
+	 break;
+#ifdef NCURSES_MOUSE_VERSION
+	case KEY_MOUSE:
+	 {
+		MEVENT	myevent;
+
+		getmouse(&myevent);
+		if (atcpu
+			&& myevent.y >= CY(0) && myevent.y <= CY(BDEPTH)
+			&& myevent.x >= CX(0) && myevent.x <= CX(BDEPTH))
+		{
+		 curx = CXINV(myevent.x);
+		 cury = CYINV(myevent.y);
+		 return(' ');
+		}
+		else
+		{
+		 beep();
+		 continue;
+		}
+	 }
+	 /* no fall through */
+#endif /* NCURSES_MOUSE_VERSION */
+
+	default:
+	 if (atcpu)
+		(void) mvaddstr(CYBASE + BDEPTH + 1, CXBASE + 11, " ");
+	 else
+		(void) mvaddstr(PYBASE + BDEPTH + 1, PXBASE + 11, " ");
+	 return(c);
+	}
+
+	curx = nx % BWIDTH;
+	cury = ny % BDEPTH;
+ }
+}
+
+static int collidecheck(int b, int y, int x)
+/* is this location on the selected zboard adjacent to a ship? */
+{
+ int	collide;
+
+ /* anything on the square */
+ if ((collide = IS_SHIP(boardbxy)) != 0)
+	return(collide);
+
+ /* anything on the neighbors */
+ if (!closepack)
+ {
+	int i;
+
+	for (i = 0; i < 8; i++)
+	{
+	 int xend, yend;
+
+	 yend = y + yincri;
+	 xend = x + xincri;
+	 if (ONBOARD(xend, yend))
+		collide += IS_SHIP(boardbxendyend);
+	}
+ }
+ return(collide);
+}
+
+static bool checkplace(int b, ship_t *ss, int vis)
+{
+ int l, xend, yend;
+
+ /* first, check for board edges */
+ xend = ss->x + ss->length * xincrss->dir;
+ yend = ss->y + ss->length * yincrss->dir;
+ if (!ONBOARD(xend, yend))
+ {
+	if (vis)
+	 switch(rnd(3))
+	 {
+	 case 0:
+		error("Ship is hanging from the edge of the world");
+		break;
+	 case 1:
+		error("Try fitting it on the board");
+		break;
+	 case 2:
+		error("Figure I won't find it if you put it there?");
+		break;
+	 }
+	return(0);
+ }
+
+ for(l = 0; l < ss->length; ++l)
+ {
+	if(collidecheck(b, ss->y+l*yincrss->dir, ss->x+l*xincrss->dir))
+	{
+	 if (vis)
+		switch(rnd(3))
+		{
+		 case 0:
+			error("There's already a ship there");
+			break;
+		 case 1:
+			error("Collision alert! Aaaaaagh!");
+			break;
+		 case 2:
+			error("Er, Admiral, what about the other ship?");
+			break;
+		 }
+	 return(FALSE);
+	 }
+	}
+ return(TRUE);
+}
+
+static int awinna(void)
+{
+ int i, j;
+ ship_t *ss;
+
+ for(i=0; i<2; ++i)
+ {
+	ss = (i) ? cpuship : plyship;
+	for(j=0; j < SHIPTYPES; ++j, ++ss)
+	 if(ss->length > ss->hits)
+		break;
+	if (j == SHIPTYPES)
+	 return(OTHER);
+ }
+ return(-1);
+}
+
+static ship_t *hitship(int x, int y)
+/* register a hit on the targeted ship */
+{
+ ship_t *sb, *ss;
+ char sym;
+ int oldx, oldy;
+
+ getyx(stdscr, oldy, oldx);
+ sb = (turn) ? plyship : cpuship;
+ if(!(sym = boardOTHERxy))
+	return((ship_t *)NULL);
+ for(ss = sb; ss < sb + SHIPTYPES; ++ss)
+	if(ss->symbol == sym)
+	{
+	 if (++ss->hits < ss->length)	/* still afloat? */
+		return((ship_t *)NULL);
+	 else				/* sunk! */
+	 {
+		int i, j;
+
+		if (!closepack)
+		 for (j = -1; j <= 1; j++)
+		 {
+			int bx = ss->x + j * xincr(ss->dir + 2) % 8;
+			int by = ss->y + j * yincr(ss->dir + 2) % 8;
+
+			for (i = -1; i <= ss->length; ++i)
+			{
+			 int x1, y1;
+
+			 x1 = bx + i * xincrss->dir;
+			 y1 = by + i * yincrss->dir;
+			 if (ONBOARD(x1, y1))
+			 {
+				hitsturnx1y1 = MARK_MISS;
+				if (turn % 2 == PLAYER)
+				{
+				 cgoto(y1, x1);
+#ifdef A_COLOR
+				 if (has_colors())
+					attron(COLOR_PAIR(COLOR_GREEN));
+#endif /* A_COLOR */
+				 (void)addch(MARK_MISS);
+#ifdef A_COLOR
+				 attrset(0);
+#endif /* A_COLOR */
+				}
+			 }
+			}
+		 }
+
+		for (i = 0; i < ss->length; ++i)
+		{
+		 int x1 = ss->x + i * xincrss->dir;
+		 int y1 = ss->y + i * yincrss->dir;
+
+		 hitsturnx1y1 = ss->symbol;
+		 if (turn % 2 == PLAYER)
+		 {
+			cgoto(y1, x1);
+			(void) addch((chtype)(ss->symbol));
+		 }
+		}
+
+		(void) move(oldy, oldx);
+		return(ss);
+	 }
+	}
+ (void) move(oldy, oldx);
+ return((ship_t *)NULL);
+}
+
+static int plyturn(void)
+{
+ ship_t *ss;
+ bool hit;
+ char *m = NULL;
+
+ prompt(1, "Where do you want to shoot? ", "");
+ for (;;)
+ {
+	(void) getcoord(COMPUTER);
+	if (hitsPLAYERcurxcury)
+	{
+	 prompt(1, "You shelled this spot already! Try again.", "");
+	 beep();
+	}
+	else
+	 break;
+ }
+ hit = IS_SHIP(boardCOMPUTERcurxcury);
+ hitsPLAYERcurxcury = hit ? MARK_HIT : MARK_MISS;
+ cgoto(cury, curx);
+#ifdef A_COLOR
+ if (has_colors())
+	if (hit)
+	 attron(COLOR_PAIR(COLOR_RED));
+	else
+	 attron(COLOR_PAIR(COLOR_GREEN));
+#endif /* A_COLOR */
+ (void) addch((chtype)hitsPLAYERcurxcury);
+#ifdef A_COLOR
+ attrset(0);
+#endif /* A_COLOR */
+
+ prompt(1, "You %s.", hit ? "scored a hit" : "missed");
+ if(hit && (ss = hitship(curx, cury)))
+ {
+	switch(rnd(5))
+	{
+	case 0:
+	 m = " You sank my %s!";
+	 break;
+	case 1:
+	 m = " I have this sinking feeling about my %s....";
+	 break;
+	case 2:
+	 m = " My %s has gone to Davy Jones's locker!";
+	 break;
+	case 3:
+	 m = " Glub, glub -- my %s is headed for the bottom!";
+	 break;
+	case 4:
+	 m = " You'll pick up survivors from my my %s, I hope...!";
+	 break;
+	}
+	(void)printw(m, ss->name);
+	(void)beep();
+	return(awinna() == -1);
+ }
+ return(hit);
+}
+
+static int sgetc(char *s)
+{
+ char *s1;
+ int ch;
+
+ (void)refresh();
+ for(;;)
+ {
+	ch = getch();
+	if (islower(ch))
+	 ch = toupper(ch);
+	if (ch == CTRLC)
+	 uninitgame(0);
+	for (s1=s; *s1 && ch != *s1; ++s1)
+	 continue;
+	if (*s1)
+	{
+	 (void) addch((chtype)ch);
+	 (void)refresh();
+	 return(ch);
+	 }
+	}
+}
+
+static void randomfire(int *px, int *py)
+/* random-fire routine -- implements simple diagonal-striping strategy */
+{
+ static int turncount = 0;
+ static int srchstep = BEGINSTEP;
+ static int huntoffs;		/* Offset on search strategy */
+ int ypossibleBWIDTH * BDEPTH, xpossibleBWIDTH * BDEPTH, nposs;
+ int ypreferredBWIDTH * BDEPTH, xpreferredBWIDTH * BDEPTH, npref;
+ int x, y, i;
+
+ if (turncount++ == 0)
+	huntoffs = rnd(srchstep);
+
+ /* first, list all possible moves */
+ nposs = npref = 0;
+ for (x = 0; x < BWIDTH; x++)
+	for (y = 0; y < BDEPTH; y++)
+	 if (!hitsCOMPUTERxy)
+	 {
+		xpossiblenposs = x;
+		ypossiblenposs = y;
+		nposs++;
+		if (((x+huntoffs) % srchstep) != (y % srchstep))
+		{
+		 xpreferrednpref = x;
+		 ypreferrednpref = y;
+		 npref++;
+		}
+	 }
+
+ if (npref)
+ {
+	i = rnd(npref);
+
+	*px = xpreferredi;
+	*py = ypreferredi;
+ }
+ else if (nposs)
+ {
+	i = rnd(nposs);
+
+	*px = xpossiblei;
+	*py = ypossiblei;
+
+	if (srchstep > 1)
+	 --srchstep;
+ }
+ else
+ {
+	error("No moves possible?? Help!");
+	exit(1);
+	/*NOTREACHED*/
+ }
+}
+
+#define S_MISS	0
+#define S_HIT	1
+#define S_SUNK	-1
+
+static bool cpufire(int x, int y)
+/* fire away at given location */
+{
+ bool hit, sunk;
+ ship_t *ss = NULL;
+
+ hitsCOMPUTERxy = (hit = (boardPLAYERxy)) ? MARK_HIT : MARK_MISS;
+ (void) mvprintw(PROMPTLINE, 0,
+	"I shoot at %c%d. I %s!", y + 'A', x, hit ? "hit" : "miss");
+ if ((sunk = (hit && (ss = hitship(x, y)))))
+	(void) printw(" I've sunk your %s", ss->name);
+ (void)clrtoeol();
+
+ pgoto(y, x);
+#ifdef A_COLOR
+ if (has_colors())
+	if (hit)
+	 attron(COLOR_PAIR(COLOR_RED));
+	else
+	 attron(COLOR_PAIR(COLOR_GREEN));
+#endif /* A_COLOR */
+ (void)addch((chtype)(hit ? SHOWHIT : SHOWSPLASH));
+#ifdef A_COLOR
+ attrset(0);
+#endif /* A_COLOR */
+
+ return(hit ? (sunk ? S_SUNK : S_HIT) : S_MISS);
+}
+
+/*
+ * This code implements a fairly irregular FSM, so please forgive the rampant
+ * unstructuredness below. The five labels are states which need to be held
+ * between computer turns.
+ */
+static bool cputurn(void)
+{
+#define POSSIBLE(x, y)	(ONBOARD(x, y) && !hitsCOMPUTERxy)
+#define RANDOM_FIRE	0
+#define RANDOM_HIT	1
+#define HUNT_DIRECT	2
+#define FIRST_PASS	3
+#define REVERSE_JUMP	4
+#define SECOND_PASS	5
+ static int next = RANDOM_FIRE;
+ static bool used4;
+ static ship_t ts;
+ int navail, x, y, d, n, hit = S_MISS;
+
+ switch(next)
+ {
+ case RANDOM_FIRE:	/* last shot was random and missed */
+ refire:
+	randomfire(&x, &y);
+	if (!(hit = cpufire(x, y)))
+	 next = RANDOM_FIRE;
+	else
+	{
+	 ts.x = x; ts.y = y;
+	 ts.hits = 1;
+	 next = (hit == S_SUNK) ? RANDOM_FIRE : RANDOM_HIT;
+	}
+	break;
+
+ case RANDOM_HIT:	/* last shot was random and hit */
+	usedE/2 = usedS/2 = usedW/2 = usedN/2 = FALSE;
+	/* FALLTHROUGH */
+
+ case HUNT_DIRECT:	/* last shot hit, we're looking for ship's long axis */
+	for (d = navail = 0; d < 4; d++)
+	{
+	 x = ts.x + xincrd*2; y = ts.y + yincrd*2;
+	 if (!usedd && POSSIBLE(x, y))
+		navail++;
+	 else
+		usedd = TRUE;
+	}
+	if (navail == 0)	/* no valid places for shots adjacent... */
+	 goto refire;	/* ...so we must random-fire */
+	else
+	{
+	 for (d = 0, n = rnd(navail) + 1; n; n--)
+		while (usedd)
+		 d++;
+
+	 assert(d <= 4);
+
+	 usedd = FALSE;
+	 x = ts.x + xincrd*2;
+	 y = ts.y + yincrd*2;
+
+	 assert(POSSIBLE(x, y));
+
+	 if (!(hit = cpufire(x, y)))
+		next = HUNT_DIRECT;
+	 else
+	 {
+		ts.x = x; ts.y = y; ts.dir = d*2; ts.hits++;
+		next = (hit == S_SUNK) ? RANDOM_FIRE : FIRST_PASS;
+	 }
+	}
+	break;
+
+ case FIRST_PASS:	/* we have a start and a direction now */
+	x = ts.x + xincrts.dir;
+	y = ts.y + yincrts.dir;
+	if (POSSIBLE(x, y) && (hit = cpufire(x, y)))
+	{
+	 ts.x = x; ts.y = y; ts.hits++;
+	 next = (hit == S_SUNK) ? RANDOM_FIRE : FIRST_PASS;
+	}
+	else
+	 next = REVERSE_JUMP;
+	break;
+
+ case REVERSE_JUMP:	/* nail down the ship's other end */
+	d = ts.dir + 4;
+	x = ts.x + ts.hits * xincrd;
+	y = ts.y + ts.hits * yincrd;
+	if (POSSIBLE(x, y) && (hit = cpufire(x, y)))
+	{
+	 ts.x = x; ts.y = y; ts.dir = d; ts.hits++;
+	 next = (hit == S_SUNK) ? RANDOM_FIRE : SECOND_PASS;
+	}
+	else
+	 next = RANDOM_FIRE;
+	break;
+
+ case SECOND_PASS:	/* kill squares not caught on first pass */
+	x = ts.x + xincrts.dir;
+	y = ts.y + yincrts.dir;
+	if (POSSIBLE(x, y) && (hit = cpufire(x, y)))
+	{
+	 ts.x = x; ts.y = y; ts.hits++;
+	 next = (hit == S_SUNK) ? RANDOM_FIRE: SECOND_PASS;
+	 break;
+	}
+	else
+	 next = RANDOM_FIRE;
+	break;
+ }
+
+ /* check for continuation and/or winner */
+ if (salvo)
+ {
+	(void)refresh();
+	(void)sleep(1);
+ }
+ if (awinna() != -1)
+	return(FALSE);
+
+#ifdef DEBUG
+ (void) mvprintw(PROMPTLINE + 2, 0,
+		 "New state %d, x=%d, y=%d, d=%d",
+		 next, x, y, d);
+#endif /* DEBUG */
+ return(hit);
+}
+
+static
+int playagain(void)
+{
+ int j;
+ ship_t *ss;
+
+ for (ss = cpuship; ss < cpuship + SHIPTYPES; ss++)
+	for(j = 0; j < ss->length; j++)
+	{
+	 cgoto(ss->y + j * yincrss->dir, ss->x + j * xincrss->dir);
+	 (void)addch((chtype)ss->symbol);
+	}
+
+ if(awinna())
+	++cpuwon;
+ else
+	++plywon;
+ j = 18 + strlen(name);
+ if(plywon >= 10)
+	++j;
+ if(cpuwon >= 10)
+	++j;
+ (void) mvprintw(1,(COLWIDTH-j)/2,
+		 "%s: %d Computer: %d",name,plywon,cpuwon);
+
+ prompt(2, (awinna()) ? "Want to be humiliated again, %s yn? "
+	 : "Going to give me a chance for revenge, %s yn? ",name);
+ return(sgetc("YN") == 'Y');
+}
+
+static void do_options(int c, char *op)
+{
+ register int i;
+
+ if (c > 1)
+ {
+	for (i=1; i<c; i++)
+	{
+	 switch(opi0)
+	 {
+	 default:
+	 case '?':
+		(void) fprintf(stderr, "Usage: battle -s | -b -c\n");
+		(void) fprintf(stderr, "\tWhere the options are:\n");
+		(void) fprintf(stderr, "\t-s : play a salvo game\n");
+		(void) fprintf(stderr, "\t-b : play a blitz game\n");
+		(void) fprintf(stderr, "\t-c : ships may be adjacent\n");
+		exit(1);
+		break;
+	 case '-':
+		switch(opi1)
+		{
+		case 'b':
+		 blitz = 1;
+		 if (salvo == 1)
+		 {
+			(void) fprintf(stderr,
+				"Bad Arg: -b and -s are mutually exclusive\n");
+			exit(1);
+		 }
+		 break;
+		case 's':
+		 salvo = 1;
+		 if (blitz == 1)
+		 {
+			(void) fprintf(stderr,
+				"Bad Arg: -s and -b are mutually exclusive\n");
+			exit(1);
+		 }
+		 break;
+		case 'c':
+		 closepack = 1;
+		 break;
+		default:
+		 (void) fprintf(stderr,
+			 "Bad arg: type \"%s ?\" for usage message\n", op0);
+		 exit(1);
+		}
+	 }
+	}
+ }
+}
+
+static int scount(int who)
+{
+ register int i, shots;
+ register ship_t *sp;
+
+ if (who)
+	sp = cpuship;	/* count cpu shots */
+ else
+	sp = plyship;	/* count player shots */
+
+ for (i=0, shots = 0; i < SHIPTYPES; i++, sp++)
+ {
+	if (sp->hits >= sp->length)
+	 continue;		/* dead ship */
+	else
+	 shots++;
+ }
+ return(shots);
+}
+
+int main(int argc, char *argv)
+{
+ do_options(argc, argv);
+
+ intro();
+ do {
+	initgame();
+	while(awinna() == -1)
+	{
+	 if (!blitz)
+	 {
+		if (!salvo)
+		{
+	 	 if(turn)
+			(void) cputurn();
+		 else
+			(void) plyturn();
+		}
+		else
+		{
+		 register int i;
+
+		 i = scount(turn);
+		 while (i--)
+		 {
+			if (turn)
+			{
+			 if (cputurn() && awinna() != -1)
+				i = 0;
+			}
+			else
+			{
+			 if (plyturn() && awinna() != -1)
+				i = 0;
+			}
+		 }
+		}
+	 }
+	 else
+	 	while(turn ? cputurn() : plyturn())
+		 continue;
+	 turn = OTHER;
+	}
+ } while
+	(playagain());
+ uninitgame(0);
+ /*NOTREACHED*/
+ return 1;
+}
+
+/* bs.c ends here */

_service:tar_scm:slang-2.3.2.tar.bz2/src/curses/firework.c Added

@@ -0,0 +1,125 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <sys/types.h>
+#include <signal.h>
+#include <curses.h>
+#include <ctype.h>
+#include <time.h>
+
+static int get_colour(void);
+static void explode(int row, int col);
+static void showit(int);
+
+int main(int argc, char *argv)
+{
+int start,end,row,diff,flag = 0,direction;
+unsigned seed;
+
+ initscr();
+ if (has_colors())
+ start_color();
+ seed = time((time_t *)0);
+ srand(seed);
+ cbreak();
+ for (;;) {
+ do {
+ start = rand() % (COLS -3);
+ end = rand() % (COLS - 3);
+ start = (start < 2) ? 2 : start;
+ end = (end < 2) ? 2 : end;
+ direction = (start > end) ? -1 : 1;
+ diff = abs(start-end);
+ } while (diff<2 || diff>=LINES-2);
+ attrset(A_NORMAL);
+ for (row=1;row<diff;row++) {
+ mvprintw(LINES - row,start + (row * direction),
+ (direction < 0) ? "\\" : "/");
+ if (flag++) {
+ showit(120);
+ erase();
+ flag = 0;
+ }
+ }
+ if (flag++) {
+ showit(120);
+ flag = 0;
+ }
+ seed = time((time_t *)0);
+ srand(seed);
+ explode(LINES-row,start+(diff*direction));
+ erase();
+ showit(120);
+ }
+}
+
+static
+void explode(int row, int col)
+{
+ init_pair(1,get_colour(),COLOR_WHITE);
+ attrset(COLOR_PAIR(1));
+ erase();
+ mvprintw(row,col,"-");
+ showit(200);
+
+ init_pair(1,get_colour(),COLOR_BLACK);
+ attrset(COLOR_PAIR(1));
+ mvprintw(row-1,col-1," - ");
+ mvprintw(row,col-1,"-+-");
+ mvprintw(row+1,col-1," - ");
+ showit(200);
+
+ init_pair(1,get_colour(),COLOR_BLACK);
+ attrset(COLOR_PAIR(1));
+ mvprintw(row-2,col-2," --- ");
+ mvprintw(row-1,col-2,"-+++-");
+ mvprintw(row, col-2,"-+#+-");
+ mvprintw(row+1,col-2,"-+++-");
+ mvprintw(row+2,col-2," --- ");
+ showit(200);
+
+ init_pair(1,get_colour(),COLOR_BLACK);
+ attrset(COLOR_PAIR(1));
+ mvprintw(row-2,col-2," +++ ");
+ mvprintw(row-1,col-2,"++#++");
+ mvprintw(row, col-2,"+# #+");
+ mvprintw(row+1,col-2,"++#++");
+ mvprintw(row+2,col-2," +++ ");
+ showit(200);
+
+ init_pair(1,get_colour(),COLOR_BLACK);
+ attrset(COLOR_PAIR(1));
+ mvprintw(row-2,col-2," # ");
+ mvprintw(row-1,col-2,"## ##");
+ mvprintw(row, col-2,"# #");
+ mvprintw(row+1,col-2,"## ##");
+ mvprintw(row+2,col-2," # ");
+ showit(200);
+
+ init_pair(1,get_colour(),COLOR_BLACK);
+ attrset(COLOR_PAIR(1));
+ mvprintw(row-2,col-2," # # ");
+ mvprintw(row-1,col-2,"# #");
+ mvprintw(row, col-2," ");
+ mvprintw(row+1,col-2,"# #");
+ mvprintw(row+2,col-2," # # ");
+ showit(200);
+}
+
+static
+int get_colour(void)
+{
+ int attr;
+ attr = (rand() % 16)+1;
+ if (attr == 1 || attr == 9)
+ attr = COLOR_RED;
+ if (attr > 8)
+ attr |= A_BOLD;
+ return(attr);
+}
+
+static void
+showit(int s)
+{
+	refresh();
+	napms(s);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/curses/gdc.c Added

@@ -0,0 +1,212 @@
+/*
+ * Grand digital clock for curses compatible terminals
+ * Usage: gdc -s n -- run for n seconds (default infinity)
+ * Flags: -s: scroll
+ *
+ * modified 10-18-89 for curses (jrl)
+ * 10-18-89 added signal handling
+ */
+
+#include <time.h>
+#include <signal.h>
+#include <curses.h>
+#include <stdlib.h>
+#include <string.h>
+#ifndef NONPOSIX
+#include <unistd.h>
+#endif
+
+#define YBASE	10
+#define XBASE	10
+#define XLENGTH	54
+#define YDEPTH	5
+
+/* it won't be */
+time_t now; /* yeah! */
+struct tm *tm;
+
+short disp11 = {
+	075557, 011111, 071747, 071717, 055711,
+	074717, 074757, 071111, 075757, 075717, 002020
+};
+long old6, next6, new6, mask;
+char scrol;
+
+int sigtermed=0;
+
+int hascolor = 0;
+
+void set(int, int);
+void standt(int);
+void movto(int, int);
+
+static
+void sighndl(int signo)
+{
+	signal(signo, sighndl);
+	sigtermed=signo;
+}
+
+int
+main(int argc, char *argv)
+{
+long t, a;
+int i, j, s, k;
+int n = 0;
+
+	signal(SIGINT,sighndl);
+	signal(SIGTERM,sighndl);
+	signal(SIGKILL,sighndl);
+
+	initscr();
+	cbreak();
+	noecho();
+	nodelay(stdscr, 1);
+
+	hascolor = has_colors();
+
+	if(hascolor) {
+		start_color();
+		init_pair(1, COLOR_BLACK, COLOR_RED);
+		init_pair(2, COLOR_RED, COLOR_BLACK);
+		init_pair(3, COLOR_WHITE, COLOR_BLACK);
+		attrset(COLOR_PAIR(2));
+	}
+
+	clear();
+	refresh();
+	while(--argc > 0) {
+		if(**++argv == '-')
+			scrol = 1;
+		else
+			n = atoi(*argv);
+	}
+
+	if(hascolor) {
+		attrset(COLOR_PAIR(3));
+
+		mvaddch(YBASE - 1, XBASE - 1, ACS_ULCORNER);
+		hline(ACS_HLINE, XLENGTH);
+		mvaddch(YBASE - 1, XBASE + XLENGTH, ACS_URCORNER);
+
+		mvaddch(YBASE + YDEPTH, XBASE - 1, ACS_LLCORNER);
+		hline(ACS_HLINE, XLENGTH);
+		mvaddch(YBASE + YDEPTH, XBASE + XLENGTH, ACS_LRCORNER);
+
+		move(YBASE, XBASE - 1);
+		vline(ACS_VLINE, YDEPTH);
+
+		move(YBASE, XBASE + XLENGTH);
+		vline(ACS_VLINE, YDEPTH);
+
+		attrset(COLOR_PAIR(2));
+	}
+	do {
+		char	buf30;
+
+		mask = 0;
+		time(&now);
+		tm = localtime(&now);
+		set(tm->tm_sec%10, 0);
+		set(tm->tm_sec/10, 4);
+		set(tm->tm_min%10, 10);
+		set(tm->tm_min/10, 14);
+		set(tm->tm_hour%10, 20);
+		set(tm->tm_hour/10, 24);
+		set(10, 7);
+		set(10, 17);
+		for(k=0; k<6; k++) {
+			if(scrol) {
+				for(i=0; i<5; i++)
+					newi = (newi&~mask) | (newi+1&mask);
+				new5 = (new5&~mask) | (nextk&mask);
+			} else
+				newk = (newk&~mask) | (nextk&mask);
+			nextk = 0;
+			for(s=1; s>=0; s--) {
+				standt(s);
+				for(i=0; i<6; i++) {
+					if((a = (newi^oldi)&(s ? new : old)i) != 0) {
+						for(j=0,t=1<<26; t; t>>=1,j++) {
+							if(a&t) {
+								if(!(a&(t<<1))) {
+									movto(YBASE + i, XBASE + 2*j);
+								}
+								addstr(" ");
+							}
+						}
+					}
+					if(!s) {
+						oldi = newi;
+					}
+				}
+				if(!s) {
+					refresh();
+				}
+			}
+		}
+
+		/* this depends on the detailed format of ctime(3) */
+		(void) strcpy(buf, ctime(&now));
+		(void) strcpy(buf + 10, buf + 19);
+		mvaddstr(16, 30, buf);
+
+		movto(6, 0);
+		refresh();
+		sleep(1);
+		while(wgetch(stdscr) != ERR)
+			continue;
+		if (sigtermed) {
+			standend();
+			clear();
+			refresh();
+			endwin();
+			fprintf(stderr, "gdc terminated by signal %d\n", sigtermed);
+			exit(1);
+		}
+	} while(--n);
+	standend();
+	clear();
+	refresh();
+	endwin();
+	return(0);
+}
+
+void
+set(int t, int n)
+{
+int i, m;
+
+	m = 7<<n;
+	for(i=0; i<5; i++) {
+		nexti |= ((dispt>>(4-i)*3)&07)<<n;
+		mask |= (nexti^oldi)&m;
+	}
+	if(mask&m)
+		mask |= m;
+}
+
+void
+standt(int on)
+{
+	if (on) {
+		if(hascolor) {
+			attron(COLOR_PAIR(1));
+		} else {
+			attron(A_STANDOUT);
+		}
+	} else {
+		if(hascolor) {
+			attron(COLOR_PAIR(2));
+		} else {
+			attroff(A_STANDOUT);
+		}
+	}
+}
+
+void
+movto(int line, int col)
+{
+	move(line, col);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/curses/hanoi.c Added

@@ -0,0 +1,292 @@
+/*
+ *	Name: Towers of Hanoi.
+ *
+ *	Desc:
+ *		This is a playable copy of towers of hanoi.
+ *		Its sole purpose is to demonstrate my Amiga Curses package.
+ *		This program should compile on any system that has Curses.
+ *		'hanoi'		will give a manual game with 7 playing pieces.
+ *		'hanoi n'	will give a manual game with n playing pieces.
+ *		'hanoi n a' will give an auto solved game with n playing pieces.
+ *
+ *	Author: Simon J Raybould	(sie@fulcrum.bt.co.uk).
+ * 	(This version has been slightly modified by the ncurses maintainers.)
+ *
+ *	Date: 05.Nov.90
+ *
+ */
+
+#include <curses.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <string.h>
+
+#define NPEGS			3	/* This is not configurable !! */
+#define MINTILES		3
+#define MAXTILES		9
+#define DEFAULTTILES	7
+#define TOPLINE			6
+#define BASELINE		16
+#define STATUSLINE		(LINES-3)
+#define LEFTPEG			19
+#define MIDPEG			39
+#define RIGHTPEG		59
+
+#define LENTOIND(x)		(((x)-1)/2)
+#define OTHER(a,b)		(3-((a)+(b)))
+
+struct Peg {
+	size_t LengthMAXTILES;
+	int Count;
+};
+
+struct Peg PegsNPEGS;
+int PegPos = { LEFTPEG, MIDPEG, RIGHTPEG };
+int TileColour = {
+	COLOR_GREEN,	/* Length 3 */
+	COLOR_MAGENTA,	/* Length 5 */
+	COLOR_RED,	/* Length 7 */
+	COLOR_BLUE,	/* Length 9 */
+	COLOR_CYAN,	/* Length 11 */
+	COLOR_YELLOW, 	/* Length 13 */
+	COLOR_GREEN, 	/* Length 15 */
+	COLOR_MAGENTA,	/* Length 17 */
+	COLOR_RED,	/* Length 19 */
+};
+int NMoves = 0;
+
+void InitTiles(int NTiles);
+void DisplayTiles(void);
+void MakeMove(int From, int To);
+void AutoMove(int From, int To, int Num);
+void Usage(void);
+int Solved(int NumTiles);
+int GetMove(int *From, int *To);
+int InvalidMove(int From, int To);
+
+int
+main(int argc, char **argv)
+{
+int NTiles, FromCol, ToCol;
+unsigned char AutoFlag = 0;
+
+	switch(argc) {
+	case 1:
+		NTiles = DEFAULTTILES;
+		break;
+	case 2:
+		NTiles = atoi(argv1);
+		if (NTiles > MAXTILES || NTiles < MINTILES) {
+			fprintf(stderr, "Range %d to %d\n", MINTILES, MAXTILES);
+			exit(1);
+		}
+		break;
+	case 3:
+		if (strcmp(argv2, "a")) {
+			Usage();
+			exit(1);
+		}
+		NTiles = atoi(argv1);
+		if (NTiles > MAXTILES || NTiles < MINTILES) {
+			fprintf(stderr, "Range %d to %d\n", MINTILES, MAXTILES);
+			exit(1);
+		}
+		AutoFlag = TRUE;
+		break;
+	default:
+		Usage();
+		exit(1);
+	}
+#ifdef NCURSES_VERSION
+	trace(TRACE_MAXIMUM);
+#endif
+	initscr();
+	if (!has_colors()) {
+		endwin();
+		puts("terminal doesn't support color.");
+		exit(1);
+	}
+	start_color();
+	{
+	int i;
+	for (i = 0; i < 9; i++)
+		init_pair(i+1, COLOR_BLACK, TileColouri);
+	}
+	cbreak();
+	if (LINES < 24) {
+		endwin();
+		fprintf(stderr, "Min screen length 24 lines\n");
+		exit(1);
+	}
+	if(AutoFlag)
+		leaveok(stdscr, TRUE);	/* Attempt to remove cursor */
+	InitTiles(NTiles);
+	DisplayTiles();
+	if(AutoFlag) {
+		do {
+			noecho();
+			AutoMove(0, 2, NTiles);
+		} while(!Solved(NTiles));
+		sleep(2);
+	} else {
+		for(;;) {
+			if(GetMove(&FromCol, &ToCol))
+				break;
+			if(InvalidMove(FromCol, ToCol)) {
+				mvaddstr(STATUSLINE, 0, "Invalid Move !!");
+				refresh();
+				beep();
+				continue;
+			}
+			MakeMove(FromCol, ToCol);
+			if(Solved(NTiles)) {
+				mvprintw(STATUSLINE, 0, "Well Done !! You did it in %d moves", NMoves);
+				refresh();
+				sleep(5);
+				break;
+			}
+		}
+	}
+	curs_set(1);
+	endwin();
+	exit(0);
+}
+
+int
+InvalidMove(int From, int To)
+{
+	if(From >= NPEGS)
+		return TRUE;
+	if(From < 0)
+		return TRUE;
+	if(To >= NPEGS)
+		return TRUE;
+	if(To < 0)
+		return TRUE;
+	if(From == To)
+		return TRUE;
+	if(!PegsFrom.Count)
+		return TRUE;
+	if(PegsTo.Count &&
+			PegsFrom.LengthPegsFrom.Count-1 >
+			PegsTo.LengthPegsTo.Count-1)
+		return TRUE;
+	return FALSE;
+}
+
+void
+InitTiles(int NTiles)
+{
+int Size, SlotNo;
+
+	for(Size=NTiles*2+1, SlotNo=0; Size>=3; Size-=2)
+		Pegs0.LengthSlotNo++ = Size;
+
+	Pegs0.Count = NTiles;
+	Pegs1.Count = 0;
+	Pegs2.Count = 0;
+}
+
+void
+DisplayTiles()
+{
+	int Line, Peg, SlotNo;
+	char TileBufBUFSIZ;
+
+	erase();
+	mvaddstr(1, 24, "T O W E R S O F H A N O I");
+	mvaddstr(3, 34, "SJR 1990");
+	mvprintw(19, 5, "Moves : %d", NMoves);
+	attrset(A_REVERSE);
+	mvaddstr(BASELINE, 8, " ");
+
+	for(Line=TOPLINE; Line<BASELINE; Line++) {
+		mvaddch(Line, LEFTPEG, ' ');
+		mvaddch(Line, MIDPEG, ' ');
+		mvaddch(Line, RIGHTPEG, ' ');
+	}
+	mvaddch(BASELINE, LEFTPEG, '1');
+	mvaddch(BASELINE, MIDPEG, '2');
+	mvaddch(BASELINE, RIGHTPEG, '3');
+	attrset(A_NORMAL);
+
+	/* Draw tiles */
+	for(Peg=0; Peg<NPEGS; Peg++) {
+		for(SlotNo=0; SlotNo<PegsPeg.Count; SlotNo++) {
+			memset(TileBuf, ' ', PegsPeg.LengthSlotNo);
+			TileBufPegsPeg.LengthSlotNo = '\0';
+			attrset(COLOR_PAIR(LENTOIND(PegsPeg.LengthSlotNo)));
+			mvaddstr(BASELINE-(SlotNo+1),
+				(int)(PegPosPeg - PegsPeg.LengthSlotNo/2),
+				TileBuf);
+		}
+	}
+	attrset(A_NORMAL);
+	refresh();
+}
+
+int
+GetMove(int *From, int *To)
+{
+	mvaddstr(STATUSLINE, 0, "Next move ('q' to quit) from ");
+	clrtoeol();
+	refresh();
+	if((*From = getch()) == 'q')
+		return TRUE;
+	addch(*From);
+	*From -= ('0'+1);
+	addstr(" to ");
+	clrtoeol();
+	refresh();
+	if((*To = getch()) == 'q')
+		return TRUE;
+	addch(*To);
+	*To -= ('0'+1);
+	move(STATUSLINE, 0);
+	clrtoeol();
+	refresh();
+	return FALSE;
+}
+
+void
+MakeMove(int From, int To)
+{
+
+	PegsFrom.Count--;
+	PegsTo.LengthPegsTo.Count = PegsFrom.LengthPegsFrom.Count;
+	PegsTo.Count++;
+	NMoves++;
+	DisplayTiles();
+}
+
+void
+AutoMove(int From, int To, int Num)
+{
+
+	if(Num == 1) {
+		MakeMove(From, To);
+		return;
+	}
+	AutoMove(From, OTHER(From, To), Num-1);
+	MakeMove(From, To);
+	AutoMove(OTHER(From, To), To, Num-1);
+}
+
+int
+Solved(int NumTiles)
+{
+int i;
+
+	for(i = 1; i < NPEGS; i++)
+		if (Pegsi.Count == NumTiles)
+			return TRUE;
+	return FALSE;
+}
+
+void
+Usage()
+{
+	fprintf(stderr, "Usage: hanoi <No Of Tiles> a\n");
+	fprintf(stderr, "The 'a' option causes the tower to be solved automatically\n");
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/curses/knight.c Added

@@ -0,0 +1,555 @@
+/*
+ * Knight's Tour - a brain game
+ *
+ * The original of this game was anonymous. It had an unbelievably bogus
+ * interface, you actually had to enter square coordinates! Redesign by
+ * Eric S. Raymond <esr@snark.thyrsus.com> July 22 1995. Mouse support
+ * added September 20th 1995.
+ */
+
+#include <curses.h>
+#include <ctype.h>
+#include <signal.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <string.h>
+
+/* board size */
+#define BDEPTH	8
+#define BWIDTH	8
+
+/* where to start the instructions */
+#define INSTRY	2
+#define INSTRX	35
+
+/* corner of board */
+#define BOARDY	2
+#define BOARDX	0
+
+/* notification line */
+#define NOTIFYY	21
+
+/* virtual color values */
+#define TRAIL_COLOR	1
+#define PLUS_COLOR	2
+#define MINUS_COLOR	3
+
+#define CX(x)	(2 + 4 * (x))
+#define CY(y)	(1 + 2 * (y))
+#define cellmove(y, x)	wmove(boardwin, CY(y), CX(x))
+#define CXINV(x)	(((x) - 1) / 4)
+#define CYINV(y)	(((y) - 2) / 2)
+
+typedef struct
+{
+ short	x, y;
+}
+cell;
+
+static short	boardBDEPTHBWIDTH;	/* the squares */
+static int	rw,col;			/* current row and column */
+static int	lastrow,lastcol; 	/* last location visited */
+static cell	historyBDEPTH*BWIDTH;	/* choice history */
+static int	movecount;		/* count of moves so far */
+static WINDOW	*boardwin;		/* the board window */
+static WINDOW	*helpwin;		/* the help window */
+static WINDOW	*msgwin;		/* the message window */
+static chtype	trail = '#';		/* trail character */
+static chtype	plus = '+';		/* cursor hot-spot character */
+static chtype	minus = '-';		/* possible-move character */
+static chtype	oldch;
+
+static void init(void);
+static void play(void);
+static void dosquares(void);
+static void drawmove(char, int, int, int, int);
+static bool evalmove(int, int);
+static bool chkmoves(void);
+static bool chksqr(int, int);
+static int iabs(int);
+
+int main(int argc, char *argv)
+{
+ init();
+
+ play();
+
+ endwin();
+ exit(0);
+}
+
+static void init (void)
+{
+ srand ((unsigned)getpid());
+ initscr ();
+ cbreak ();			/* immediate char return */
+ noecho ();			/* no immediate echo */
+ boardwin = newwin(BDEPTH * 2 + 1, BWIDTH * 4 + 1, BOARDY, BOARDX);
+ helpwin = newwin(0, 0, INSTRY, INSTRX);
+ msgwin = newwin(1, INSTRX-1, NOTIFYY, 0);
+ keypad(boardwin, TRUE);
+
+ if (has_colors())
+ {
+	start_color();
+
+	(void) init_pair(TRAIL_COLOR, COLOR_CYAN, COLOR_BLACK);
+	(void) init_pair(PLUS_COLOR, COLOR_RED, COLOR_BLACK);
+	(void) init_pair(MINUS_COLOR, COLOR_GREEN, COLOR_BLACK);
+
+	trail |= COLOR_PAIR(TRAIL_COLOR);
+	plus |= COLOR_PAIR(PLUS_COLOR);
+	minus |= COLOR_PAIR(MINUS_COLOR);
+ }
+
+#ifdef NCURSES_MOUSE_VERSION
+ (void) mousemask(BUTTON1_CLICKED, (mmask_t *)NULL);
+#endif /* NCURSES_MOUSE_VERSION*/
+
+ oldch = minus;
+}
+
+static void help1(void)
+/* game explanation -- initial help screen */
+{
+ (void)waddstr(helpwin, "Knight's move is a solitaire puzzle. Your\n");
+ (void)waddstr(helpwin, "objective is to visit each square of the \n");
+ (void)waddstr(helpwin, "chessboard exactly once by making knight's\n");
+ (void)waddstr(helpwin, "moves (one square right or left followed \n");
+ (void)waddstr(helpwin, "by two squares up or down, or two squares \n");
+ (void)waddstr(helpwin, "right or left followed by one square up or\n");
+ (void)waddstr(helpwin, "down). You may start anywhere.\n\n");
+
+ (void)waddstr(helpwin, "Use arrow keys to move the cursor around.\n");
+ (void)waddstr(helpwin, "When you want to move your knight to the \n");
+ (void)waddstr(helpwin, "cursor location, press <space> or Enter.\n");
+ (void)waddstr(helpwin, "Illegal moves will be rejected with an \n");
+ (void)waddstr(helpwin, "audible beep.\n\n");
+ (void)waddstr(helpwin, "The program will detect if you solve the\n");
+ (void)waddstr(helpwin, "puzzle; also inform you when you run out\n");
+ (void)waddstr(helpwin, "of legal moves.\n\n");
+
+ (void)mvwaddstr(helpwin, NOTIFYY-INSTRY, 0,
+		 "Press `?' to go to keystroke help.");
+}
+
+static void help2(void)
+/* keystroke help screen */
+{
+ (void)waddstr(helpwin, "Possible moves are shown with `-'.\n\n");
+
+ (void)waddstr(helpwin, "You can move around with the arrow keys or\n");
+ (void)waddstr(helpwin, "with the rogue/hack movement keys. Other\n");
+ (void)waddstr(helpwin, "commands allow you to undo moves or redraw.\n");
+ (void)waddstr(helpwin, "Your mouse may work; try left-button to\n");
+ (void)waddstr(helpwin, "move to the square under the pointer.\n\n");
+
+ (void)waddstr(helpwin, "x,q -- exit y k u 7 8 9\n");
+ (void)waddstr(helpwin, "r -- redraw screen \\|/ \\|/ \n");
+ (void)waddstr(helpwin, "u -- undo move h-+-l 4-+-6\n");
+ (void)waddstr(helpwin, " /|\\ /|\\ \n");
+ (void)waddstr(helpwin, " b j n 1 2 3\n");
+
+ (void)waddstr(helpwin,"\nYou can place your knight on the selected\n");
+ (void)waddstr(helpwin, "square with spacebar, Enter, or the keypad\n");
+ (void)waddstr(helpwin, "center key. You can quit with `x' or `q'.\n");
+
+ (void)mvwaddstr(helpwin, NOTIFYY-INSTRY, 0,
+		 "Press `?' to go to game explanation");
+}
+
+static void play (void)
+/* play the game */
+{
+ bool		keyhelp; /* TRUE if keystroke help is up */
+ int	c, ny = 0, nx = 0;
+ int i, j, count;
+
+ do {
+	 /* clear screen and draw board */
+	 werase(boardwin);
+	 werase(helpwin);
+	 werase(msgwin);
+	 dosquares();
+	 help1();
+	 wnoutrefresh(stdscr);
+	 wnoutrefresh(helpwin);
+	 wnoutrefresh(msgwin);
+	 wnoutrefresh(boardwin);
+	 doupdate();
+
+	 for (i = 0; i < BDEPTH; i++)
+	 for (j = 0; j < BWIDTH; j++)
+	 {
+		 boardij = FALSE;
+		 cellmove(i, j);
+		 waddch(boardwin, minus);
+	 }
+	 memset(history, '\0', sizeof(history));
+	 history0.y = history0.x = -1;
+	 lastrow = lastcol = -2;
+	 movecount = 1;
+	 keyhelp = FALSE;
+
+	 for (;;)
+	 {
+	 if (rw != lastrow || col != lastcol)
+	 {
+		 if (lastrow >= 0 && lastcol >= 0)
+		 {
+		 cellmove(lastrow, lastcol);
+		 if (boardlastrowlastcol)
+			 waddch(boardwin, trail);
+		 else
+			 waddch(boardwin, oldch);
+		 }
+
+		 cellmove(rw, col);
+		 oldch = winch(boardwin);
+
+		 lastrow = rw;
+		 lastcol= col;
+	 }
+	 cellmove(rw, col);
+	 waddch(boardwin, plus);
+	 cellmove(rw, col);
+
+	 wrefresh(msgwin);
+
+	 c = wgetch(boardwin);
+
+	 werase(msgwin);
+
+	 switch (c)
+	 {
+	 case 'k': case '8':
+	 case KEY_UP:
+		 ny = rw+BDEPTH-1; nx = col;
+		 break;
+	 case 'j': case '2':
+	 case KEY_DOWN:
+		 ny = rw+1; nx = col;
+		 break;
+	 case 'h': case '4':
+	 case KEY_LEFT:
+		 ny = rw; nx = col+BWIDTH-1;
+		 break;
+	 case 'l': case '6':
+	 case KEY_RIGHT:
+		 ny = rw; nx = col+1;
+		 break;
+	 case 'y': case '7':
+	 case KEY_A1:
+		 ny = rw+BDEPTH-1; nx = col+BWIDTH-1;
+		 break;
+	 case 'b': case '1':
+	 case KEY_C1:
+		 ny = rw+1; nx = col+BWIDTH-1;
+		 break;
+	 case 'u': case '9':
+	 case KEY_A3:
+		 ny = rw+BDEPTH-1; nx = col+1;
+		 break;
+	 case 'n': case '3':
+	 case KEY_C3:
+		 ny = rw+1; nx = col+1;
+		 break;
+
+#ifdef NCURSES_MOUSE_VERSION
+	 case KEY_MOUSE:
+		 {
+		 MEVENT	myevent;
+
+		 getmouse(&myevent);
+		 if (myevent.y >= CY(0) && myevent.y <= CY(BDEPTH)
+			 && myevent.x >= CX(0) && myevent.x <= CX(BWIDTH))
+		 {
+			 nx = CXINV(myevent.x);
+			 ny = CYINV(myevent.y);
+			 ungetch('\n');
+			 break;
+		 }
+		 else
+		 {
+			 beep();
+			 continue;
+		 }
+		 }
+#endif /* NCURSES_MOUSE_VERSION */
+
+	 case KEY_B2:
+	 case '\n':
+	 case ' ':
+		 if (evalmove(rw, col))
+		 {
+		 drawmove(trail,
+				historymovecount-1.y, historymovecount-1.x,
+				rw, col);
+		 historymovecount.y = rw;
+		 historymovecount.x = col;
+		 movecount++;
+
+		 if (!chkmoves())
+			 goto dropout;
+		 }
+		 else
+		 beep();
+		 break;
+
+	 case KEY_REDO:
+	 case '\f':
+	 case 'r':
+		 clearok(curscr, TRUE);
+		 wnoutrefresh(stdscr);
+		 wnoutrefresh(boardwin);
+		 wnoutrefresh(msgwin);
+		 wnoutrefresh(helpwin);
+		 doupdate();
+		 break;
+
+	 case KEY_UNDO:
+	 case KEY_BACKSPACE:
+	 case '\b':
+		 if (movecount == 1)
+		 {
+		 ny = lastrow;
+		 nx = lastcol;
+		 waddstr(msgwin, "\nNo previous move.");
+		 beep();
+		 }
+		 else
+		 {
+		 int oldy = historymovecount-1.y;
+		 int oldx = historymovecount-1.x;
+
+		 boardoldyoldx = FALSE;
+		 --movecount;
+		 ny = historymovecount-1.y;
+		 nx = historymovecount-1.x;
+		 drawmove(' ', oldy, oldx, ny, nx);
+
+		 /* avoid problems if we just changed the current cell */
+		 cellmove(lastrow, lastcol);
+		 oldch = winch(boardwin);
+		 }
+		 break;
+
+	 case 'q':
+	 case 'x':
+		 goto dropout;
+
+	 case '?':
+		 werase(helpwin);
+		 if (keyhelp)
+		 {
+		 help1();
+		 keyhelp = FALSE;
+		 }
+		 else
+		 {
+		 help2();
+		 keyhelp = TRUE;
+		 }
+		 wrefresh(helpwin);
+		 break;
+
+	 default:
+		 beep();
+		 break;
+	 }
+
+	 col = nx % BWIDTH;
+	 rw = ny % BDEPTH;
+	 }
+
+ dropout:
+	 count = 0;
+	 for (i = 0; i < BDEPTH; i++)
+	 for (j = 0; j < BWIDTH; j++)
+		 if (boardij != 0)
+		 count += 1;
+	 if (count == (BWIDTH * BDEPTH))
+	 wprintw(msgwin, "\nYou won. Care to try again? ");
+	 else
+	 wprintw(msgwin, "\n%d squares filled. Try again? ", count);
+ } while
+	 (tolower(wgetch(msgwin)) == 'y');
+}
+
+static void dosquares (void)
+{
+ int i, j;
+
+ mvaddstr(0, 20, "KNIGHT'S MOVE -- a logical solitaire");
+
+ move(BOARDY,BOARDX);
+ waddch(boardwin, ACS_ULCORNER);
+ for (j = 0; j < 7; j++)
+ {
+	waddch(boardwin, ACS_HLINE);
+	waddch(boardwin, ACS_HLINE);
+	waddch(boardwin, ACS_HLINE);
+	waddch(boardwin, ACS_TTEE);
+ }
+ waddch(boardwin, ACS_HLINE);
+ waddch(boardwin, ACS_HLINE);
+ waddch(boardwin, ACS_HLINE);
+ waddch(boardwin, ACS_URCORNER);
+
+ for (i = 1; i < BDEPTH; i++)
+ {
+	move(BOARDY + i * 2 - 1, BOARDX);
+	waddch(boardwin, ACS_VLINE);
+	for (j = 0; j < BWIDTH; j++)
+	{
+	 waddch(boardwin, ' ');
+	 waddch(boardwin, ' ');
+	 waddch(boardwin, ' ');
+	 waddch(boardwin, ACS_VLINE);
+	}
+	move(BOARDY + i * 2, BOARDX);
+	waddch(boardwin, ACS_LTEE);
+	for (j = 0; j < BWIDTH - 1; j++)
+	{
+	 waddch(boardwin, ACS_HLINE);
+	 waddch(boardwin, ACS_HLINE);
+	 waddch(boardwin, ACS_HLINE);
+	 waddch(boardwin, ACS_PLUS);
+	}
+	waddch(boardwin, ACS_HLINE);
+	waddch(boardwin, ACS_HLINE);
+	waddch(boardwin, ACS_HLINE);
+	waddch(boardwin, ACS_RTEE);
+ }
+
+ move(BOARDY + i * 2 - 1, BOARDX);
+ waddch(boardwin, ACS_VLINE);
+ for (j = 0; j < BWIDTH; j++)
+ {
+	waddch(boardwin, ' ');
+	waddch(boardwin, ' ');
+	waddch(boardwin, ' ');
+	waddch(boardwin, ACS_VLINE);
+ }
+
+ move(BOARDY + i * 2, BOARDX);
+ waddch(boardwin, ACS_LLCORNER);
+ for (j = 0; j < BWIDTH - 1; j++)
+ {
+	waddch(boardwin, ACS_HLINE);
+	waddch(boardwin, ACS_HLINE);
+	waddch(boardwin, ACS_HLINE);
+	waddch(boardwin, ACS_BTEE);
+ }
+ waddch(boardwin, ACS_HLINE);
+ waddch(boardwin, ACS_HLINE);
+ waddch(boardwin, ACS_HLINE);
+ waddch(boardwin, ACS_LRCORNER);
+}
+
+static void mark_possibles(int prow, int pcol, chtype mark)
+{
+ if (chksqr(prow+2,pcol+1)){cellmove(prow+2,pcol+1);waddch(boardwin,mark);};
+ if (chksqr(prow+2,pcol-1)){cellmove(prow+2,pcol-1);waddch(boardwin,mark);};
+ if (chksqr(prow-2,pcol+1)){cellmove(prow-2,pcol+1);waddch(boardwin,mark);};
+ if (chksqr(prow-2,pcol-1)){cellmove(prow-2,pcol-1);waddch(boardwin,mark);};
+ if (chksqr(prow+1,pcol+2)){cellmove(prow+1,pcol+2);waddch(boardwin,mark);};
+ if (chksqr(prow+1,pcol-2)){cellmove(prow+1,pcol-2);waddch(boardwin,mark);};
+ if (chksqr(prow-1,pcol+2)){cellmove(prow-1,pcol+2);waddch(boardwin,mark);};
+ if (chksqr(prow-1,pcol-2)){cellmove(prow-1,pcol-2);waddch(boardwin,mark);};
+}
+
+static void drawmove(char tchar, int oldy, int oldx, int row, int column)
+/* place the stars, update board & currents */
+{
+ if (movecount <= 1)
+ {
+	int i, j;
+
+	for (i = 0; i < BDEPTH; i++)
+	 for (j = 0; j < BWIDTH; j++)
+	 {
+		cellmove(i, j);
+		if (winch(boardwin) == minus)
+		 waddch(boardwin, movecount ? ' ' : minus);
+	 }
+ }
+ else
+ {
+	cellmove(oldy, oldx);
+	waddch(boardwin, '\b');
+	waddch(boardwin, tchar);
+	waddch(boardwin, tchar);
+	waddch(boardwin, tchar);
+	mark_possibles(oldy, oldx, ' ');
+ }
+
+ if (row != -1 && column != -1)
+ {
+	cellmove(row, column);
+	waddch(boardwin, '\b');
+	waddch(boardwin, trail);
+	waddch(boardwin, trail);
+	waddch(boardwin, trail);
+	mark_possibles(row, column, minus);
+	boardrowcolumn = TRUE;
+ }
+
+ wprintw(msgwin, "\nMove %d", movecount);
+}
+
+static bool evalmove(int row, int column)
+/* evaluate move */
+{
+ if (movecount == 1)
+	return(TRUE);
+ else if (boardrowcolumn == TRUE)
+ {
+	waddstr(msgwin, "\nYou've already been there.");
+	return(FALSE);
+ }
+ else
+ {
+	int	rdif = iabs(row - historymovecount-1.y);
+	int	cdif = iabs(column - historymovecount-1.x);
+
+	if (!((rdif == 1) && (cdif == 2)) && !((rdif == 2) && (cdif == 1)))
+	{
+	 waddstr(msgwin, "\nThat's not a legal knight's move.");
+	 return(FALSE);
+	}
+ }
+
+ return(TRUE);
+}
+
+static bool chkmoves (void)
+/* check to see if valid moves are available */
+{
+ if (chksqr(rw+2,col+1)) return(TRUE);
+ if (chksqr(rw+2,col-1)) return(TRUE);
+ if (chksqr(rw-2,col+1)) return(TRUE);
+ if (chksqr(rw-2,col-1)) return(TRUE);
+ if (chksqr(rw+1,col+2)) return(TRUE);
+ if (chksqr(rw+1,col-2)) return(TRUE);
+ if (chksqr(rw-1,col+2)) return(TRUE);
+ if (chksqr(rw-1,col-2)) return(TRUE);
+ return (FALSE);
+}
+
+static int iabs(int num)
+{
+	if (num < 0) return (-num);
+		else return (num);
+}
+
+static bool chksqr (int r1, int c1)
+{
+ if ((r1 < 0) || (r1 > BDEPTH - 1))
+	return(FALSE);
+ if ((c1 < 0) || (c1 > BWIDTH - 1))
+	return(FALSE);
+ return (!boardr1c1);
+}
+
+/* knight.c ends here */

_service:tar_scm:slang-2.3.2.tar.bz2/src/curses/rain.c Added

@@ -0,0 +1,97 @@
+#include <curses.h>
+#include <signal.h>
+#include <stdlib.h>
+
+/* rain 11/3/1980 EPS/CITHEP */
+
+#define cursor(col,row) move(row,col)
+
+float ranf(void);
+void onsig(int sig);
+
+int
+main(int argc, char *argv)
+{
+int x, y, j;
+static int xpos5, ypos5;
+float r;
+float c;
+
+ for (j=SIGHUP;j<=SIGTERM;j++)
+	if (signal(j,SIG_IGN)!=SIG_IGN) signal(j,onsig);
+
+ initscr();
+ nl();
+ noecho();
+ r = (float)(LINES - 4);
+ c = (float)(COLS - 4);
+ for (j=5;--j>=0;) {
+		xposj=(int)(c* ranf())+2;
+		yposj=(int)(r* ranf())+2;
+ }
+ for (j=0;;) {
+		x=(int)(c*ranf())+2;
+		y=(int)(r*ranf())+2;
+
+		cursor(x,y); addch('.');
+
+		cursor(xposj,yposj); addch('o');
+
+		if (j==0) j=4; else --j;
+		cursor(xposj,yposj); addch('O');
+
+		if (j==0) j=4; else --j;
+		cursor(xposj,yposj-1);
+		addch('-');
+		cursor(xposj-1,yposj);
+		addstr("|.|");
+		cursor(xposj,yposj+1);
+		addch('-');
+
+		if (j==0) j=4; else --j;
+		cursor(xposj,yposj-2);
+		addch('-');
+		cursor(xposj-1,yposj-1);
+		addstr("/ \\");
+		cursor(xposj-2,yposj);
+		addstr("| O |");
+		cursor(xposj-1,yposj+1);
+		addstr("\\ /");
+		cursor(xposj,yposj+2);
+		addch('-');
+
+		if (j==0) j=4; else --j;
+		cursor(xposj,yposj-2);
+		addch(' ');
+		cursor(xposj-1,yposj-1);
+		addstr(" ");
+		cursor(xposj-2,yposj);
+		addstr(" ");
+		cursor(xposj-1,yposj+1);
+		addstr(" ");
+		cursor(xposj,yposj+2);
+		addch(' ');
+		xposj=x; yposj=y;
+		refresh();
+		napms(50);
+ }
+}
+
+void
+onsig(int n)
+{
+ endwin();
+ exit(n);
+}
+
+float
+ranf(void)
+{
+ float rv;
+ long r = rand();
+
+ r &= 077777;
+ rv =((float)r/32767.);
+ return rv;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/curses/tclock.c Added

@@ -0,0 +1,176 @@
+#include <stdio.h>
+#include <float.h>
+#include <math.h>
+#include <time.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <curses.h>
+
+/*
+ tclock - analog/digital clock for curses.
+ If it gives you joy, then
+ (a) I'm glad
+ (b) you need to get out more :-)
+
+ This program is copyright Howard Jones, September 1994
+ (ha.jones@ic.ac.uk). It may be freely distributed as
+ long as this copyright message remains intact, and any
+ modifications are clearly marked as such. In fact, if
+ you modify it, I wouldn't mind the modifications back,
+ especially if they add any nice features. A good one
+ would be a precalc table for the 60 hand positions, so
+ that the floating point stuff can be ditched. As I said,
+ it was a 20 hackup minute job.
+
+ COMING SOON: tfishtank. Be the envy of your mac-owning
+ colleagues.
+*/
+
+/* To compile: cc -o tclock tclock.c -lcurses -lm */
+
+#ifndef PI
+#define PI 3.141592654
+#endif
+
+#define sign(_x) (_x<0?-1:1)
+
+/* Plot a point */
+static void
+plot(int x,int y,char col)
+{
+ mvaddch(y,x,(chtype)col);
+}
+
+/* Draw a diagonal(arbitrary) line using Bresenham's alogrithm. */
+static void
+dline(int from_x, int from_y, int x2, int y2, char ch)
+{
+	int dx,dy;
+	int ax,ay;
+	int sx,sy;
+	int x,y;
+	int d;
+
+	dx=x2-from_x;
+	dy=y2-from_y;
+
+	ax=abs(dx*2);
+	ay=abs(dy*2);
+
+	sx=sign(dx);
+	sy=sign(dy);
+
+	x=from_x;
+	y=from_y;
+
+	if(ax>ay)
+	{
+		d=ay-(ax/2);
+
+		while(1)
+		{
+			plot(x,y,ch);
+			if(x==x2) return;
+
+			if(d>=0)
+			{
+				y+=sy;
+				d-=ax;
+			}
+			x+=sx;
+			d+=ay;
+		}
+	}
+	else
+	{
+		d=ax-(ay/2);
+
+		while(1)
+		{
+			plot(x,y,ch);
+			if(y==y2) return;
+
+			if(d>=0)
+			{
+				x+=sx;
+				d-=ay;
+			}
+			y+=sy;
+			d+=ax;
+		}
+	}
+}
+
+int
+main(int argc, char **argv)
+{
+	int i,cx,cy;
+	double mradius, hradius, mangle, hangle;
+	double sangle, sradius, hours;
+	int hdx, hdy;
+	int mdx, mdy;
+	int sdx, sdy;
+	time_t tim;
+	struct tm *t;
+	char szChar10;
+
+	initscr();
+	noecho();
+
+	cx=39;
+	cy=12;
+	mradius=9;
+	hradius=6;
+	sradius=8;
+
+	for(i=0;i<12;i++)
+	 {
+	 sangle=(i+1)*(2.0*PI)/12.0;
+	 sradius=10;
+	 sdx=2.0*sradius*sin(sangle);
+	 sdy=sradius*cos(sangle);
+	 sprintf(szChar,"%d",i+1);
+
+	 mvaddstr((int)(cy-sdy),(int)(cx+sdx),szChar);
+	 }
+
+	mvaddstr(0,0,"ASCII Clock by Howard Jones (ha.jones@ic.ac.uk),1994");
+
+	sradius=8;
+	while(1)
+	 {
+	 sleep(1);
+
+	 tim=time(0);
+	 t=localtime(&tim);
+
+	 hours=(t->tm_hour + (t->tm_min/60.0));
+	 if(hours>12.0) hours-=12.0;
+
+	 mangle=(t->tm_min)*(2*PI)/60.0;
+	 mdx=2.0*mradius*sin(mangle);
+	 mdy=mradius*cos(mangle);
+
+	 hangle=(hours)*(2.0*PI)/12.0;
+	 hdx=2.0*hradius*sin(hangle);
+	 hdy=hradius*cos(hangle);
+
+	 sangle=(t->tm_sec%60)*(2.0*PI)/60.0;
+	 sdx=2.0*sradius*sin(sangle);
+	 sdy=sradius*cos(sangle);
+
+	 plot(cx+sdx,cy-sdy,'O');
+	 dline(cx,cy,cx+hdx,cy-hdy,'.');
+	 dline(cx,cy,cx+mdx,cy-mdy,'#');
+
+	 mvaddstr(23,0,ctime(&tim));
+
+	 refresh();
+	 plot(cx+sdx,cy-sdy,' ');
+	 dline(cx,cy,cx+hdx,cy-hdy,' ');
+	 dline(cx,cy,cx+mdx,cy-mdy,' ');
+
+	 }
+
+	return 0;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/curses/view.c Added

@@ -0,0 +1,143 @@
+/*
+ * view.c -- a silly little viewer program
+ *
+ * written by Eric S. Raymond <esr@snark.thyrsus.com> December 1994
+ * to test the scrolling code in ncurses.
+ *
+ * Takes a filename argument. It's a simple file-viewer with various
+ * scroll-up and scroll-down commands.
+ *
+ * n	-- scroll one line forward
+ * p	-- scroll one line back
+ *
+ * Either command accepts a numeric prefix interpreted as a repeat count.
+ * Thus, typing `5n' should scroll forward 5 lines in the file.
+ *
+ * The way you can tell this is working OK is that, in the trace file,
+ * there should be one scroll operation plus a small number of line
+ * updates, as opposed to a whole-page update. This means the physical
+ * scroll operation worked, and the refresh() code only had to do a
+ * partial repaint.
+ */
+#include <curses.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+#include <signal.h>
+
+#define MAXLINES 256 /* most lines we can handle */
+
+static void finish(int sig);
+
+static char *linesMAXLINES;
+
+int main(int argc, char *argv)
+{
+FILE *fp;
+char bufBUFSIZ;
+int i;
+char **lptr, **olptr;
+
+#ifdef TRACE
+ trace(TRACE_UPDATE);
+#endif
+
+ if (argc != 2) {
+ fprintf(stderr, "usage: view file\n");
+ exit(1);
+ } else if ((fp = fopen(argv1, "r")) == (FILE *)NULL) {
+ perror(argv1);
+ exit(1);
+ }
+
+ (void) signal(SIGINT, finish); /* arrange interrupts to terminate */
+
+ (void) initscr(); /* initialize the curses library */
+ keypad(stdscr, TRUE); /* enable keyboard mapping */
+ (void) nonl(); /* tell curses not to do NL->CR/NL on output */
+ (void) cbreak(); /* take input chars one at a time, no wait for \n */
+ (void) noecho(); /* don't echo input */
+ scrollok(stdscr, TRUE);
+
+ /* slurp the file */
+ for (lptr = &lines0; fgets(buf, BUFSIZ, fp) != (char *)NULL; lptr++) {
+ if (lptr - lines >= MAXLINES) {
+ endwin();
+ (void) fprintf(stderr, "%s: %s is too large\n", argv0, argv1);
+ exit(1);
+ }
+
+ bufstrlen(buf) - 1 = '\0';
+ *lptr = (char *)malloc((size_t)(COLS + 1));
+ (void) strncpy(*lptr, buf, (size_t)COLS);
+	(*lptr)COLS = '\0';
+ }
+ (void) fclose(fp);
+
+ lptr = lines;
+ for (;;) {
+ int n, c;
+	bool explicit;
+
+ for (i = 0; i < LINES; i++) {
+ move(i, 0);
+ clrtoeol();
+ if (lptri)
+ addstr(lptri);
+ }
+
+	explicit = FALSE;
+	n = 0;
+ for (;;) {
+	 c = getch();
+	 if (isdigit(c))
+		n = 10 * n + (c - '0');
+	 else
+		break;
+	}
+	if (!explicit && n == 0)
+	 n = 1;
+
+ switch(c) {
+ case KEY_DOWN:
+	case 'n':
+	 olptr = lptr;
+	 for (i = 0; i < n; i++)
+		if (lptr + LINES < lines + MAXLINES && lptrLINES + 1)
+		 lptr++;
+	 else
+		 break;
+	 wscrl(stdscr, lptr - olptr);
+ break;
+
+ case KEY_UP:
+	case 'p':
+	 olptr = lptr;
+	 for (i = 0; i < n; i++)
+		if (lptr > lines)
+		 lptr--;
+	 else
+		 break;
+	 wscrl(stdscr, lptr - olptr);
+ break;
+
+	 default:
+	 move (0,0);
+	 clrtoeol ();
+	 printw ("Invalid input: %c", c);
+	 refresh ();
+	 sleep (1);
+	}
+ }
+
+ finish(0); /* we're done */
+}
+
+static void finish(int sig)
+{
+ endwin();
+ exit(sig != 0);
+}
+
+/* view.c ends here */
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/curses/worm.c Added

@@ -0,0 +1,361 @@
+/*
+
+	 @@@ @@@ @@@@@@@@@@ @@@@@@@@@@@ @@@@@@@@@@@@
+	 @@@ @@@ @@@@@@@@@@@@ @@@@@@@@@@@@ @@@@@@@@@@@@@
+	 @@@ @@@ @@@@ @@@@ @@@@ @@@@ @@@ @@@@
+	 @@@ @@ @@@ @@@ @@@ @@@ @@@ @@@ @@@
+	 @@@ @@@@ @@@ @@@ @@@ @@@ @@@ @@@ @@@
+	 @@@@ @@@@ @@@@ @@@ @@@ @@@ @@@ @@@ @@@
+	 @@@@@@@@@@@@ @@@@ @@@@ @@@ @@@ @@@ @@@
+	 @@@@ @@@@ @@@@@@@@@@@@ @@@ @@@ @@@ @@@
+	 @@ @@ @@@@@@@@@@ @@@ @@@ @@@ @@@
+
+				 Eric P. Scott
+			 Caltech High Energy Physics
+				 October, 1980
+
+		Hacks to turn this into a test frame for cursor movement:
+			Eric S. Raymond <esr@snark.thyrsus.com>
+				January, 1995
+
+		July 1995 (esr): worms is now in living color! :-)
+
+Options:
+	-f			fill screen with copies of 'WORM' at start.
+	-l <n>			set worm length
+	-n <n>			set number of worms
+	-t			make worms leave droppings
+	-T <start> <end>	set trace interval
+	-S			set single-stepping during trace interval
+	-N			suppress cursor-movement optimization
+
+ This program makes a good torture-test for the ncurses cursor-optimization
+ code. You can use -T to set the worm move interval over which movement
+ traces will be dumped. The program stops and waits for one character of
+ input at the beginning and end of the interval.
+*/
+
+#include <curses.h>
+#include <stdlib.h>
+#include <signal.h>
+
+#define cursor(col,row) move(row,col)
+
+short *ref128;
+static chtype flavor={
+ 'O' , '*', '#', '$', '%', '0', '@',
+};
+#define MAXWORMS	(sizeof(flavor)/sizeof(chtype))
+static short xinc={
+ 1, 1, 1, 0, -1, -1, -1, 0
+}, yinc={
+ -1, 0, 1, 1, 1, 0, -1, -1
+};
+static struct worm {
+ int orientation, head;
+ short *xpos, *ypos;
+} worm40;
+
+static char *field;
+static int length=16, number=3;
+static chtype trail=' ';
+
+#ifdef TRACE
+int generation, trace_start, trace_end, singlestep;
+#endif /* TRACE */
+static struct options {
+ int nopts;
+ int opts3;
+} normal8={
+ { 3, { 7, 0, 1 } },
+ { 3, { 0, 1, 2 } },
+ { 3, { 1, 2, 3 } },
+ { 3, { 2, 3, 4 } },
+ { 3, { 3, 4, 5 } },
+ { 3, { 4, 5, 6 } },
+ { 3, { 5, 6, 7 } },
+ { 3, { 6, 7, 0 } }
+}, upper8={
+ { 1, { 1, 0, 0 } },
+ { 2, { 1, 2, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 2, { 4, 5, 0 } },
+ { 1, { 5, 0, 0 } },
+ { 2, { 1, 5, 0 } }
+}, left8={
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 2, { 2, 3, 0 } },
+ { 1, { 3, 0, 0 } },
+ { 2, { 3, 7, 0 } },
+ { 1, { 7, 0, 0 } },
+ { 2, { 7, 0, 0 } }
+}, right8={
+ { 1, { 7, 0, 0 } },
+ { 2, { 3, 7, 0 } },
+ { 1, { 3, 0, 0 } },
+ { 2, { 3, 4, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 2, { 6, 7, 0 } }
+}, lower8={
+ { 0, { 0, 0, 0 } },
+ { 2, { 0, 1, 0 } },
+ { 1, { 1, 0, 0 } },
+ { 2, { 1, 5, 0 } },
+ { 1, { 5, 0, 0 } },
+ { 2, { 5, 6, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } }
+}, upleft8={
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 1, { 3, 0, 0 } },
+ { 2, { 1, 3, 0 } },
+ { 1, { 1, 0, 0 } }
+}, upright8={
+ { 2, { 3, 5, 0 } },
+ { 1, { 3, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 1, { 5, 0, 0 } }
+}, lowleft8={
+ { 3, { 7, 0, 1 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 1, { 1, 0, 0 } },
+ { 2, { 1, 7, 0 } },
+ { 1, { 7, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } }
+}, lowright8={
+ { 0, { 0, 0, 0 } },
+ { 1, { 7, 0, 0 } },
+ { 2, { 5, 7, 0 } },
+ { 1, { 5, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } },
+ { 0, { 0, 0, 0 } }
+};
+
+void onsig(int sig);
+float ranf(void);
+
+int
+main(int argc, char *argv)
+{
+int x, y;
+int n;
+struct worm *w;
+struct options *op;
+int h;
+short *ip;
+int last, bottom;
+
+ for (x=1;x<argc;x++) {
+		register char *p;
+		p=argvx;
+		if (*p=='-') p++;
+		switch (*p) {
+		case 'f':
+		 field="WORM";
+		 break;
+		case 'l':
+		 if (++x==argc) goto usage;
+		 if ((length=atoi(argvx))<2||length>1024) {
+				fprintf(stderr,"%s: Invalid length\n",*argv);
+				exit(1);
+		 }
+		 break;
+		case 'n':
+		 if (++x==argc) goto usage;
+		 if ((number=atoi(argvx))<1||number>40) {
+				fprintf(stderr,"%s: Invalid number of worms\n",*argv);
+				exit(1);
+		 }
+		 break;
+		case 't':
+		 trail='.';
+		 break;
+#ifdef TRACE
+		case 'S':
+		 singlestep = TRUE;
+		 break;
+		case 'T':
+		 trace_start = atoi(argv++x);
+		 trace_end = atoi(argv++x);
+		 break;
+		case 'N':
+		 no_optimize = TRUE;		/* declared by ncurses */
+		 break;
+#endif /* TRACE */
+		default:
+		usage:
+		 fprintf(stderr, "usage: %s -field -length # -number # -trail\n",*argv);
+		 exit(1);
+		 break;
+		}
+ }
+
+ signal(SIGINT, onsig);
+ initscr();
+#ifdef TRACE
+ noecho();
+ cbreak();
+#endif /* TRACE */
+ nonl();
+ bottom = LINES-1;
+ last = COLS-1;
+
+#ifdef A_COLOR
+ if (has_colors())
+ {
+	start_color();
+
+	init_pair(COLOR_GREEN, COLOR_GREEN, COLOR_BLACK);
+	init_pair(COLOR_RED, COLOR_RED, COLOR_BLACK);
+	init_pair(COLOR_CYAN, COLOR_CYAN, COLOR_BLACK);
+	init_pair(COLOR_WHITE, COLOR_WHITE, COLOR_BLACK);
+	init_pair(COLOR_MAGENTA, COLOR_MAGENTA, COLOR_BLACK);
+	init_pair(COLOR_BLUE, COLOR_BLUE, COLOR_BLACK);
+	init_pair(COLOR_YELLOW, COLOR_YELLOW, COLOR_BLACK);
+
+	flavor0 |= COLOR_PAIR(COLOR_GREEN) | A_BOLD;
+	flavor1 |= COLOR_PAIR(COLOR_RED) | A_BOLD;
+	flavor2 |= COLOR_PAIR(COLOR_CYAN) | A_BOLD;
+	flavor3 |= COLOR_PAIR(COLOR_WHITE) | A_BOLD;
+	flavor4 |= COLOR_PAIR(COLOR_MAGENTA) | A_BOLD;
+	flavor5 |= COLOR_PAIR(COLOR_BLUE) | A_BOLD;
+	flavor6 |= COLOR_PAIR(COLOR_YELLOW) | A_BOLD;
+ }
+#endif /* A_COLOR */
+
+ ip=(short *)malloc(LINES*COLS*sizeof (short));
+
+ for (n=0;n<LINES;) {
+		refn++=ip; ip+=COLS;
+ }
+ for (ip=ref0,n=LINES*COLS;--n>=0;) *ip++=0;
+
+#ifdef BADCORNER
+ /* if addressing the lower right corner doesn't work in your curses */
+ refbottomlast=1;
+#endif /* BADCORNER */
+
+ for (n=number, w= &worm0;--n>=0;w++) {
+		w->orientation=w->head=0;
+		if (!(ip=(short *)malloc((length+1)*sizeof (short)))) {
+		 fprintf(stderr,"%s: out of memory\n",*argv);
+		 exit(1);
+		}
+		w->xpos=ip;
+		for (x=length;--x>=0;) *ip++ = -1;
+		if (!(ip=(short *)malloc((length+1)*sizeof (short)))) {
+		 fprintf(stderr,"%s: out of memory\n",*argv);
+		 exit(1);
+		}
+		w->ypos=ip;
+		for (y=length;--y>=0;) *ip++ = -1;
+ }
+ if (field) {
+		register char *p;
+		p=field;
+		for (y=bottom;--y>=0;) {
+		 for (x=COLS;--x>=0;) {
+				addch((chtype)(*p++));
+				if (!*p) p=field;
+		 }
+ addch('\n');
+ }
+ }
+ refresh();
+ napms(100);
+
+ for (;;) {
+#ifdef TRACE
+		if (trace_start || trace_end) {
+		 if (generation == trace_start) {
+			trace(TRACE_CALLS);
+			getch();
+		 } else if (generation == trace_end) {
+			trace(0);
+			getch();
+		 }
+
+		 if (singlestep && generation > trace_start && generation < trace_end)
+			getch();
+
+		 generation++;
+		}
+#endif /* TRACE */
+
+		for (n=0,w= &worm0;n<number;n++,w++) {
+		 if ((x=w->xposh=w->head)<0) {
+				cursor(x=w->xposh=0,y=w->yposh=bottom);
+				addch(flavorn % MAXWORMS);
+				refyx++;
+		 }
+		 else y=w->yposh;
+		 if (++h==length) h=0;
+		 if (w->xposw->head=h>=0) {
+				register int x1, y1;
+				x1=w->xposh; y1=w->yposh;
+				if (--refy1x1==0) {
+				 cursor(x1,y1); addch(trail);
+				}
+		 }
+ op= &(x==0 ? (y==0 ? upleft : (y==bottom ? lowleft : left)) :
+ (x==last ? (y==0 ? upright : (y==bottom ? lowright : right)) :
+			(y==0 ? upper : (y==bottom ? lower : normal))))w->orientation;
+		 switch (op->nopts) {
+		 case 0:
+				refresh();
+				endwin();
+				exit(0);
+		 case 1:
+				w->orientation=op->opts0;
+				break;
+		 default:
+				w->orientation=op->opts(int)(ranf()*(float)op->nopts);
+		 }
+		 cursor(x+=xincw->orientation, y+=yincw->orientation);
+
+		 if (y < 0 ) y = 0;
+		 addch(flavorn % MAXWORMS);
+		 refw->yposh=yw->xposh=x++;
+		}
+ napms(100);
+		refresh();
+ }
+}
+
+void
+onsig(int sig)
+{
+	standend();
+	refresh();
+	endwin();
+	exit(sig);
+}
+
+float
+ranf(void)
+{
+float rv;
+long r = rand();
+
+ r &= 077777;
+ rv =((float)r/32767.);
+ return rv;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/jdmacros.h Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/keywhash.c Added

@@ -0,0 +1,208 @@
+/* Perfect hash generated by command line:
+ * ./perfhash 11
+ */
+#ifndef SLCONST
+#define SLCONST const
+#endif
+#define MIN_HASH_VALUE	2
+#define MAX_HASH_VALUE	133
+#define MIN_KEYWORD_LEN 2
+#define MAX_KEYWORD_LEN 11
+
+static SLCONST unsigned char Keyword_Hash_Table 256 =
+{
+ 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134,
+ 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134,
+ 134, 55, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134,
+ 11, 22, 33, 44, 55, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134,
+ 134, 134, 0, 0, 134, 0, 134, 134, 134, 0, 134, 0, 0, 134, 134, 0,
+ 134, 134, 0, 0, 0, 0, 134, 134, 0, 134, 134, 134, 134, 134, 134, 0,
+ 134, 11, 0, 0, 55, 0, 17, 0, 46, 13, 134, 0, 22, 11, 11, 0,
+ 37, 134, 0, 22, 0, 55, 0, 0, 44, 0, 134, 134, 134, 134, 134, 134,
+ 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134,
+ 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134,
+ 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134,
+ 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134,
+ 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134,
+ 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134,
+ 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134,
+ 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134
+};
+
+static unsigned char keyword_hash (char *s, unsigned int len)
+{
+ unsigned int sum;
+
+ sum = len;
+ while (len)
+ {
+	len--;
+	sum += (unsigned int) Keyword_Hash_Table (unsigned char)slen;
+ }
+ return sum;
+}
+
+typedef SLCONST struct
+{
+ SLFUTURE_CONST char *name;
+ unsigned int type;
+}
+Keyword_Table_Type;
+
+static Keyword_Table_Type Keyword_Table /* 132 */ =
+{
+ {"or",	OR_TOKEN},
+ {"try",	TRY_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {"EXIT_BLOCK",	EXITBLK_TOKEN},
+ {"ERROR_BLOCK",	ERRBLK_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {"not",	NOT_TOKEN},
+ {NULL,0},
+ {"break",	BREAK_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {"for",	FOR_TOKEN},
+ {"_for",	_FOR_TOKEN},
+ {"USER_BLOCK0",	USRBLK0_TOKEN},
+ {NULL,0},
+ {"forever",	FOREVER_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {"if",	IF_TOKEN},
+ {"USER_BLOCK1",	USRBLK1_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {"case",	CASE_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {"USER_BLOCK2",	USRBLK2_TOKEN},
+ {NULL,0},
+ {"ifnot",	IFNOT_TOKEN},
+ {"xor",	BXOR_TOKEN},
+ {"else",	ELSE_TOKEN},
+ {NULL,0},
+ {"orelse",	ORELSE_TOKEN},
+ {"throw",	THROW_TOKEN},
+ {"static",	STATIC_TOKEN},
+ {"__tmp",	TMP_TOKEN},
+ {NULL,0},
+ {"USER_BLOCK3",	USRBLK3_TOKEN},
+ {NULL,0},
+ {"do",	DO_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {"then",	THEN_TOKEN},
+ {"catch",	CATCH_TOKEN},
+ {"loop",	LOOP_TOKEN},
+ {NULL,0},
+ {"variable",	VARIABLE_TOKEN},
+ {"USER_BLOCK4",	USRBLK4_TOKEN},
+ {NULL,0},
+ {"private",	PRIVATE_TOKEN},
+ {"mod",	MOD_TOKEN},
+ {NULL,0},
+ {"shr",	SHR_TOKEN},
+ {"return",	RETURN_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {"pop",	POP_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {"and",	AND_TOKEN},
+ {"foreach",	FOREACH_TOKEN},
+ {NULL,0},
+ {"struct",	STRUCT_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {"while",	WHILE_TOKEN},
+ {"switch",	SWITCH_TOKEN},
+ {"!if",	IFNOT_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {"shl",	SHL_TOKEN},
+ {"exch",	EXCH_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {"continue",	CONT_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {"define",	DEFINE_TOKEN},
+ {"finally",	FINALLY_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {"using",	USING_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {"typedef",	TYPEDEF_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {"andelse",	ANDELSE_TOKEN},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {NULL,0},
+ {"public",	PUBLIC_TOKEN},
+};
+
+static Keyword_Table_Type *is_keyword (char *str, unsigned int len)
+{
+ unsigned int hash;
+ SLCONST char *name;
+ Keyword_Table_Type *kw;
+
+ if ((len < MIN_KEYWORD_LEN)
+ || (len > MAX_KEYWORD_LEN))
+ return NULL;
+
+ hash = keyword_hash (str, len);
+ if ((hash > MAX_HASH_VALUE) || (hash < MIN_HASH_VALUE))
+ return NULL;
+
+ kw = &Keyword_Tablehash - MIN_HASH_VALUE;
+ if ((NULL != (name = kw->name))
+ && (*str == *name)
+ && (0 == strcmp (str, name)))
+ return kw;
+ return NULL;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/mkfiles Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/mkfiles/README Added

@@ -0,0 +1,35 @@
+-*- text -*-
+
+*** UPDATE: 2012-23-11: The mkmake.exe program described here used to
+ be an MSDOS 16 bit executable. It has now been updated to a WIN32
+ executable. The old 16 bit executable has been renamed to
+ mkmake16.exe. The mk_mkmake.bat file may be used to build the
+ executable.
+
+Due to various incompatibilities between various make programs for PC
+systems as well as differing notions of what the path separator should
+be, I have decided that the best and most maintainable approach is to
+create a master makefile that that consists of system/compiler/make
+sections from which the approriate makefile is constructed. The
+easiest way to do this is to run the master makefile through a
+preprocessor. To this end, I have created a master makefile for
+DOS/OS2 systems called makefile.all. This makefile is processed by
+the DOS executable mkmake.exe to produce various makefiles. For
+example,
+
+ mkmake BCC < makefile.all > makefile
+
+produces a makefile suitable for BCC, whereas
+
+ mkmake OS2 EMX < makefile.all > makefile
+
+produces a makefile for OS2 assuming that EMX is the compiler.
+
+Use
+
+ mkmake < makefile.all | more
+
+for more information. (Better yet, look at makefile.all; it is best
+viewed with a folding editor).
+
+Note that the resulting makefile should be copied to the src directory.

_service:tar_scm:slang-2.3.2.tar.bz2/src/mkfiles/makefile.all Added

@@ -0,0 +1,754 @@
+!ifndef MSDOS WIN16 WIN32 OS2
+# -*- mode: sh; mode: fold -*-
+# This file has been folded.
+
+#{{{ MACRO descriptions
+
+This is a master makefile that from which DOS/Windows/OS2 makefiles
+may be derived. A makefile for a particular system may be derived by
+passing this through the standalone DOS executable 'mkmake' which
+should be present in this directory. For example, to produce a makefile
+suitable for OS2 using the EMX compiler use:
+
+ mkmake OS2 EMX < makefile.all > Makefile
+
+Currently supported platforms include:
+
+ MSDOS WIN16 WIN32 OS2
+
+Currently supported compilers include:
+
+ MSDOS - BCC, DJGPP
+ WIN16 - BCC
+ WIN32 - BCC, VC, CYGWIN32, MINGW32, WCC
+ OS2 - EMX, WCC, ICC
+
+More will be added in the future.
+
+For example to produce makefile for compiling for Win32 using
+Visual C++ use:
+
+ mkmake WIN32 VC < makefile.all > Makefile
+
+Similarly,
+
+ mkmake WIN32 MINGW32 < makefile.all > Makefile
+
+will produce a makefile for the MINGW32 compiler.
+
+If you want to create a dynamic link library (instead of static),
+add a 'DLL' parameter to mkmake:
+
+ mkmake WIN32 VC DLL < makefile.all > Makefile
+
+(right now this is known to work only with Visual Studio).
+
+Each compiler-dependent section of this master makefile must define
+the following macros:
+
+ CC : The C compiler
+ CFLAGS		: Compiler flags
+ P		: Path separator used by make/compiler
+ O		: Object file extension
+ SRCDIR		: SRC location (.)
+ OBJDIR		: Directory where objects are placed
+ COMPILE_CMD	: Command used to produce object from .c file
+ LIBDEPS	: Other dependencies library depends upon
+ TARGET		: Primary target name
+ COPY		: copy command
+
+Other macros include:
+
+ RSPFILE	: Name of response file
+ RSP_PREFIX	: Prefix for response file line (See its usage)
+ RSP_POSTFIX	: Postfix for response file line (See its usage)
+ RM : What to use to delete a file
+ TOUCH		: Touch program
+
+Special notes:
+
+ The P macro could be problematic when its value is a backslash (\). Some
+ make programs may require it to be doubled, i.e., \\. Whatever its value is,
+ it should expand to something that does not include whitespace. Usually
+ this requires that it be followed by a '#' character; however, this may
+ result in the '#' character being quoted, or, escaped if the value of P is
+ a backslash.
+
+#}}}
+!else #rest of file
+# Note:
+# This makefile was automatically generated from the master makefile.all.
+# If you have problems with this file, edit the mkfiles/makefile.all.
+# Also check slconfig.h to make sure that what is defined there is
+# appropriate to your system.
+#
+TOOL_PREFIX =
+! ifdef MSDOS
+! ifdef DJGPP #{{{
+CC = $(TOOL_PREFIX)gcc
+CFLAGS = -O2 -fno-strength-reduce -Wall -W
+RANLIB = $(TOOL_PREFIX)ranlib
+AR_CR = $(TOOL_PREFIX)ar -cr
+P = /# path sep
+O = o # Object extension
+SRCDIR = .# Location of sources
+OBJDIR = djgobjs# Location of objects
+TARGET = $(OBJDIR)/libslang.a
+RSPFILE = $(OBJDIR)/link.rsp
+RSP_PREFIX =
+RSP_POSTFIX =
+COMPILE_CMD = $(CC) -c $(CFLAGS) -o #
+LIBDEPS = $(RSPFILE)
+RM = rm
+TOUCH = touch
+COPY = cp
+#}}}
+! elifdef BCC #{{{
+CC = bcc
+CFLAGS = -G- -H -N -O1 -w -ml -Dmsdos
+P = \\
+O = obj
+SRCDIR = .
+OBJDIR = bccobjs
+TARGET = $(OBJDIR)\slang.lib
+RSPFILE = $(OBJDIR)\link.rsp
+RSP_PREFIX = +-
+RSP_POSTFIX = &
+COMPILE_CMD = $(CC) -c $(CFLAGS) -o# <-- no tailing space
+LIBDEPS = $(RSPFILE)
+TOUCH = touch
+COPY = copy /y
+#}}} BCC
+! endif #ifdef BCC elifdef DJGPP
+! endif #MSDOS
+! ifdef WIN16 #{{{
+! ifdef WCC
+CC = wcl
+DEFINES = -Dmsdos -DMSWINDOWS
+CFLAGS = /bt=win16 /ort /I. $(DEFINES)
+P = \#
+O = obj # Object extension
+
+.c.obj: .AUTODEPEND
+	$(CC) $(CFLAGS) /c $< /fo=$@
+
+SRCDIR = .# Location of sources
+OBJDIR = wccobjs# Location of objects
+TARGET = $(OBJDIR)\slang.lib
+RSPFILE = $(OBJDIR)\link.rsp
+RSP_PREFIX = -+
+RSP_POSTFIX =
+COMPILE_CMD = $(CC) $(CFLAGS) /c /fo=
+LIBDEPS = $(RSPFILE)
+# This needs changing for Windows NT on non-Intel processors
+TOUCH = wtouch
+RM = del
+COPY = copy /y
+! else
+CC = bcc
+CFLAGS = -G- -H -N -w -ml -Dmsdos -DMSWINDOWS -W
+#CFLAGS = -N -v -H -w -ml -Dmsdos -DMSWINDOWS -WS
+OBJDIR = mswobjs# Location of objects
+O = obj # Object extension
+P = \\
+SRCDIR = .# Location of sources
+TARGET = $(OBJDIR)$(P)wslang.lib
+RSPFILE = $(OBJDIR)$(P)mswin.rsp
+RSP_PREFIX = +-#
+RSP_POSTFIX = &#
+COMPILE_CMD = $(CC) -c $(CFLAGS) -o#
+LIBDEPS = $(RSPFILE)
+TOUCH = touch
+COPY = copy /y
+! endif #}}}
+! endif #WIN16
+! ifdef OS2
+! ifdef EMX #{{{
+CC = gcc -Zmtd -DEMX_VIDEO
+CFLAGS = -DOS2 -D__os2__
+P = /
+O = o # Object extension
+SRCDIR = .# Location of sources
+OBJDIR = emxobjs# Location of objects
+TARGET = $(OBJDIR)/slang.a
+COMPILE_CMD = $(CC) -c $(CFLAGS) -o #
+LIBDEPS =
+TOUCH = touch
+COPY = cp
+AR_CR = ar crv
+RANLIB = ranlib
+
+#}}}
+! elifdef WCC #{{{
+CC = wcc386
+CFLAGS = -DOS2 -D__os2__ -bm -bt=os2 #
+P = \#
+O = obj # Object extension
+SRCDIR = .# Location of sources
+OBJDIR = wccobjs# Location of objects
+TARGET = $(OBJDIR)\slang.lib
+COMPILE_CMD = $(CC) $(CFLAGS) -fo=#
+RSPFILE =
+RSP_PREFIX = +-
+RSP_POSTFIX =
+LIBDEPS = $(RSPFILE)
+TOUCH = wtouch
+COPY = copy /y
+RM = del
+#}}}
+! elifdef ICC #{{{
+CC = icc
+CFLAGS = -Q+ -W3 -DOS2 -D__os2__ -Gm+ -Wcnd-
+P = \#
+O = obj
+SRCDIR = .
+OBJDIR = iccobjs
+TARGET = $(OBJDIR)\slang.lib
+COMPILE_CMD = $(CC) -c $(CFLAGS) -Fo# <-- no trailing space
+LIBDEPS = $(RSPFILE)
+RSPFILE = $(OBJDIR)\link.rsp
+RSP_PREFIX =
+TMP1=A
+# Hack to get ^&
+RSP_POSTFIX = $(TMP1:A=^^)&
+COPY = copy /y
+RM=del
+TOUCH=echo
+#}}}
+! endif # ifdef EMX elifdef WCC
+! endif #OS2
+! ifdef WIN32
+! ifdef VC #{{{
+# Makefile for slang as Win32 GUI using nmake under Visual C.
+CC = cl
+CFLAGS =
+P = \\
+O = obj # Object extension
+SRCDIR = .# Location of sources
+OBJDIR = mw32objs# Location of objects
+TGTBASE=$(OBJDIR)\wslang32
+TARGET = $(TGTBASE).lib
+RSPFILE = $(OBJDIR)\link.rsp
+RSP_PREFIX =
+RSP_POSTFIX =
+COMPILE_CMD = $(CC) /c @$(OBJDIR)\comp.rsp /Fo # /Fo specifies object file name
+LIBDEPS = $(RSPFILE) $(OBJDIR)\comp.rsp
+# This needs changing for Windows NT on non-Intel processors
+CPU = _X86_
+RM = del
+TOUCH = touch
+COPY = copy /y
+#}}}
+! elifdef BCC #{{{
+CC = bcc32
+CFLAGS = -N -w -w-sig -w-stu -v -DWIN32
+# Location of sources
+SRCDIR = .
+# Location of objects
+OBJDIR = bw32objs
+# Object extension
+O = obj
+P = \\
+TARGET = $(OBJDIR)\wslang.lib
+RSPFILE = $(OBJDIR)\link.rsp
+RSP_PREFIX = +-
+! if$OS Windows_NT
+RSP_POSTFIX = ^^&
+! else
+RSP_POSTFIX = &
+! endif
+COMPILE_CMD = $(CC) -c $(CFLAGS) -o
+LIBDEPS = $(RSPFILE)
+TOUCH = touch
+COPY = copy /y
+
+#}}}
+! elifdef CYGWIN32 #{{{
+# This Makefile is for the CYGWIN32 environment
+CC = gcc
+CFLAGS = -DWIN32 -W -Wall -O2 -fno-strength-reduce
+P = /#
+O = o # Object extension
+SRCDIR = .# Location of sources
+OBJDIR = gw32objs# Location of objects
+TARGET = $(OBJDIR)/libslang.a
+COMPILE_CMD = $(CC) -c $(CFLAGS) -o #
+LIBDEPS =
+RM = rm
+TOUCH = touch
+COPY = cp
+AR_CR = ar crv
+RANLIB = ranlib
+
+#}}}
+! elifdef MINGW32 #{{{
+# This Makefile is for the MINGW32 environment
+CC = $(TOOL_PREFIX)gcc
+WFLAGS = -W -Wall
+! ifdef DLL
+CFLAGS = -DWIN32 -DSLANG_DLL=1 -O2 $(WFLAGS)
+! else
+CFLAGS = -DWIN32 -O2 $(WFLAGS)
+! endif
+P = /#
+O = o # Object extension
+SRCDIR = .# Location of sources
+OBJDIR = gw32objs# Location of objects
+TGTBASE=$(OBJDIR)/libslang
+prefix=/mingw/local
+module_install_dir = $(prefix)/lib/slang/v2/modules#
+install_doc_dir = $(prefix)/share/doc/slang/v2
+slstd_C_FLAGS = -DSLANG_DOC_DIR='"$(install_doc_dir)"' -DSLANG_INSTALL_PREFIX='"$(prefix)"'
+slimport_C_FLAGS = -DMODULE_INSTALL_DIR='"$(module_install_dir)"'
+
+TARGET = $(TGTBASE).a
+COMPILE_CMD = $(CC) -c $(CFLAGS) -o #
+LIBDEPS =
+RM = rm
+TOUCH = touch
+COPY = cp
+AR_CR = $(TOOL_PREFIX)ar crv
+RANLIB = $(TOOL_PREFIX)ranlib
+
+#COPY = copy /y
+#}}}
+! elifdef WCC #{{{
+# Watcom makefile for slang
+
+CC = wcl386
+DEFINES = /DWIN32 /D__WIN32__
+CFLAGS = /bt=nt /ort /I. $(DEFINES)
+P = \#
+O = obj # Object extension
+
+.c.obj: .AUTODEPEND
+	$(CC) $(CFLAGS) /c $< /fo=$@
+
+SRCDIR = .# Location of sources
+OBJDIR = w32objs# Location of objects
+TARGET = $(OBJDIR)\wslang32.lib
+RSPFILE = $(OBJDIR)\link.rsp
+RSP_PREFIX = -+
+RSP_POSTFIX =
+COMPILE_CMD = $(CC) $(CFLAGS) /c /fo=
+LIBDEPS = $(RSPFILE)
+# This needs changing for Windows NT on non-Intel processors
+CPU = _X86_
+TOUCH = wtouch
+RM = del
+COPY = copy /y
+#}}}
+! endif #ifdef VC elifdef BCC ... elifdef MINGW32
+! endif #WIN32
+
+# End of compiler specific section
+
+CONFIG_H = config.h
+#{{{ OBJS =
+
+OBJS = $(OBJDIR)$(P)slang.$(O) \
+ $(OBJDIR)$(P)slarray.$(O) \
+ $(OBJDIR)$(P)slclass.$(O) \
+ $(OBJDIR)$(P)slcmd.$(O) \
+ $(OBJDIR)$(P)slerr.$(O) \
+ $(OBJDIR)$(P)slgetkey.$(O) \
+ $(OBJDIR)$(P)slkeymap.$(O) \
+ $(OBJDIR)$(P)slmalloc.$(O) \
+ $(OBJDIR)$(P)slmath.$(O) \
+ $(OBJDIR)$(P)slarith.$(O) \
+ $(OBJDIR)$(P)slassoc.$(O) \
+ $(OBJDIR)$(P)slmemchr.$(O) \
+ $(OBJDIR)$(P)slmemcmp.$(O) \
+ $(OBJDIR)$(P)slmemcpy.$(O) \
+ $(OBJDIR)$(P)slmemset.$(O) \
+ $(OBJDIR)$(P)slmisc.$(O) \
+ $(OBJDIR)$(P)slparse.$(O) \
+ $(OBJDIR)$(P)slprepr.$(O) \
+ $(OBJDIR)$(P)slregexp.$(O) \
+ $(OBJDIR)$(P)slrline.$(O) \
+ $(OBJDIR)$(P)slsearch.$(O) \
+ $(OBJDIR)$(P)slsmg.$(O) \
+ $(OBJDIR)$(P)slstd.$(O) \
+ $(OBJDIR)$(P)sltoken.$(O) \
+ $(OBJDIR)$(P)sltypes.$(O) \
+ $(OBJDIR)$(P)slscroll.$(O) \
+ $(OBJDIR)$(P)slsignal.$(O) \
+ $(OBJDIR)$(P)slsig.$(O) \
+ $(OBJDIR)$(P)slkeypad.$(O) \
+ $(OBJDIR)$(P)slerrno.$(O) \
+ $(OBJDIR)$(P)slstring.$(O) \
+ $(OBJDIR)$(P)slstruct.$(O) \
+ $(OBJDIR)$(P)slcmplex.$(O) \
+ $(OBJDIR)$(P)slarrfun.$(O) \
+ $(OBJDIR)$(P)slimport.$(O) \
+ $(OBJDIR)$(P)slpath.$(O) \
+ $(OBJDIR)$(P)slcompat.$(O) \
+ $(OBJDIR)$(P)slposdir.$(O) \
+ $(OBJDIR)$(P)slstdio.$(O) \
+ $(OBJDIR)$(P)slproc.$(O) \
+ $(OBJDIR)$(P)sltime.$(O) \
+ $(OBJDIR)$(P)slstrops.$(O) \
+ $(OBJDIR)$(P)slbstr.$(O) \
+ $(OBJDIR)$(P)slpack.$(O) \
+ $(OBJDIR)$(P)slintall.$(O) \
+ $(OBJDIR)$(P)slistruc.$(O) \
+ $(OBJDIR)$(P)slposio.$(O) \
+ $(OBJDIR)$(P)slnspace.$(O) \
+ $(OBJDIR)$(P)slarrmis.$(O) \
+ $(OBJDIR)$(P)slospath.$(O) \
+ $(OBJDIR)$(P)slscanf.$(O) \
+! ifndef WIN16
+ $(OBJDIR)$(P)slvideo.$(O) \
+! endif
+! ifdef MSDOS
+ $(OBJDIR)$(P)sldostty.$(O) \
+! endif
+! ifdef WIN32
+ $(OBJDIR)$(P)slw32tty.$(O) \
+! endif
+! ifdef OS2
+ $(OBJDIR)$(P)slos2tty.$(O) \
+! endif
+ $(OBJDIR)$(P)sllower.$(O) \
+ $(OBJDIR)$(P)slupper.$(O) \
+ $(OBJDIR)$(P)slischar.$(O) \
+ $(OBJDIR)$(P)slutf8.$(O) \
+ $(OBJDIR)$(P)slwcwidth.$(O) \
+ $(OBJDIR)$(P)slwclut.$(O) \
+ $(OBJDIR)$(P)slcommon.$(O) \
+ $(OBJDIR)$(P)sllist.$(O) \
+ $(OBJDIR)$(P)slexcept.$(O) \
+ $(OBJDIR)$(P)slfpu.$(O) \
+ $(OBJDIR)$(P)slboseos.$(O) \
+ $(OBJDIR)$(P)slxstrng.$(O)
+#---------------------------------------------------------------------------
+
+#}}}
+
+$(TARGET): $(OBJDIR) $(CONFIG_H) $(LIBDEPS) $(OBJS)
+! ifdef DJGPP CYGWIN32 MINGW32 ICC
+	-$(RM) $(TARGET)
+! endif
+! ifdef DJGPP
+	$(AR_CR) $(TARGET) @$(RSPFILE)
+	$(RANLIB) $(TARGET)
+! elifdef BCC
+	tlib $(TARGET) /P32 /C @$(RSPFILE)
+! elifdef EMX CYGWIN32
+	$(AR_CR) $(TARGET) $(OBJS)
+	$(RANLIB) $(TARGET)
+! elifdef MINGW32
+! ifdef DLL
+	$(CC) -shared -o $(TGTBASE).dll $(OBJS) -Wl,--out-implib,$(TARGET)
+! else
+	$(AR_CR) $(TARGET) $(OBJS)
+	$(RANLIB) $(TARGET)
+! endif
+! elifdef VC
+# dll support
+! ifdef DLL
+	link /dll /machine:I386 /out:$(TGTBASE).dll /implib:$(TGTBASE).lib @$(RSPFILE)
+! else
+ 	link -lib -out:$(TARGET) @$(RSPFILE)
+! endif
+! elifdef WCC
+	wlib $(TARGET) @$(RSPFILE)
+#	wlib $(TARGET) -+ $(OBJS)
+! elifdef ICC
+	ilib $(TARGET) @$(RSPFILE);
+#	ilib $(TARGET) $(OBJS);
+! endif
+
+$(OBJDIR) :
+	-mkdir $(OBJDIR)
+$(CONFIG_H): slconfig.h
+	$(COPY) slconfig.h config.h
+	-$(TOUCH) config.h
+
+!ifndef EMX CYGWIN32 MINGW32 #ICC WCC
+#{{{ Create Response File
+
+$(RSPFILE) :
+	@echo Creating response file $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slxstrng.$(O) $(RSP_POSTFIX) > $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)sllower.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slupper.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slischar.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slutf8.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slwcwidth.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slwclut.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slcommon.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)sllist.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slexcept.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slfpu.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slboseos.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)sltypes.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)sltoken.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slstd.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slsmg.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slsearch.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slrline.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slregexp.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slprepr.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slparse.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slmisc.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slmemset.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slmemcpy.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slmemcmp.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slmemchr.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slmath.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slarith.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slassoc.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slmalloc.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slkeymap.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slgetkey.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slerr.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slcmd.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slclass.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slarray.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slscroll.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slsignal.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slsig.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slkeypad.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slerrno.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slstring.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slstruct.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slistruc.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slcmplex.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slarrfun.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slimport.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slpath.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slcompat.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slposdir.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slstdio.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slproc.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)sltime.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slstrops.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slbstr.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slpack.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slintall.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slposio.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slnspace.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slarrmis.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slospath.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slscanf.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+! ifndef WIN16
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slvideo.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+! endif
+! ifdef MSDOS
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)sldostty.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+! endif
+! ifdef WIN32
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slw32tty.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+! endif
+! ifdef OS2
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slos2tty.$(O) $(RSP_POSTFIX) >> $(RSPFILE)
+! endif
+	@echo $(RSP_PREFIX)$(OBJDIR)$(P)slang.$(O) >> $(RSPFILE)
+
+#}}}
+!endif # NOT EMX, WCC, CYGWIN32, MINGW32
+
+!ifdef VC
+$(OBJDIR)\comp.rsp:
+	echo /nologo /W3 /O2 /D "NDEBUG" /D $(CPU) > $(OBJDIR)\comp.rsp
+	echo /D "WIN32" /I "." /MT >> $(OBJDIR)\comp.rsp
+	echo /D "_CRT_SECURE_NO_WARNINGS " >> $(OBJDIR)\comp.rsp
+	echo /D "_CRT_NONSTDC_NO_DEPRECATE" >> $(OBJDIR)\comp.rsp
+! ifdef DLL
+	echo /D SLANG_DLL >> $(OBJDIR)\comp.rsp
+! endif
+!endif
+
+#---------------------------------------------------------------------------
+
+# explicit rules follow below
+$(OBJDIR)$(P)slxstrng.$(O) : $(SRCDIR)$(P)slxstrng.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slxstrng.$(O) $(SRCDIR)$(P)slxstrng.c
+$(OBJDIR)$(P)sllower.$(O) : $(SRCDIR)$(P)sllower.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)sllower.$(O) $(SRCDIR)$(P)sllower.c
+
+$(OBJDIR)$(P)slupper.$(O) : $(SRCDIR)$(P)slupper.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slupper.$(O) $(SRCDIR)$(P)slupper.c
+
+$(OBJDIR)$(P)slischar.$(O) : $(SRCDIR)$(P)slischar.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slischar.$(O) $(SRCDIR)$(P)slischar.c
+
+$(OBJDIR)$(P)slutf8.$(O) : $(SRCDIR)$(P)slutf8.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slutf8.$(O) $(SRCDIR)$(P)slutf8.c
+
+$(OBJDIR)$(P)slwcwidth.$(O) : $(SRCDIR)$(P)slwcwidth.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slwcwidth.$(O) $(SRCDIR)$(P)slwcwidth.c
+
+$(OBJDIR)$(P)slwclut.$(O) : $(SRCDIR)$(P)slwclut.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slwclut.$(O) $(SRCDIR)$(P)slwclut.c
+
+$(OBJDIR)$(P)slcommon.$(O) : $(SRCDIR)$(P)slcommon.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slcommon.$(O) $(SRCDIR)$(P)slcommon.c
+
+$(OBJDIR)$(P)sllist.$(O) : $(SRCDIR)$(P)sllist.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)sllist.$(O) $(SRCDIR)$(P)sllist.c
+
+$(OBJDIR)$(P)slexcept.$(O) : $(SRCDIR)$(P)slexcept.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slexcept.$(O) $(SRCDIR)$(P)slexcept.c
+
+$(OBJDIR)$(P)slfpu.$(O) : $(SRCDIR)$(P)slfpu.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slfpu.$(O) $(SRCDIR)$(P)slfpu.c
+
+$(OBJDIR)$(P)slboseos.$(O) : $(SRCDIR)$(P)slboseos.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slboseos.$(O) $(SRCDIR)$(P)slboseos.c
+
+$(OBJDIR)$(P)sltypes.$(O) : $(SRCDIR)$(P)sltypes.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)sltypes.$(O) $(SRCDIR)$(P)sltypes.c
+
+$(OBJDIR)$(P)sltoken.$(O) : $(SRCDIR)$(P)sltoken.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)sltoken.$(O) $(SRCDIR)$(P)sltoken.c
+
+$(OBJDIR)$(P)slstd.$(O) : $(SRCDIR)$(P)slstd.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slstd.$(O) $(slstd_C_FLAGS) $(SRCDIR)$(P)slstd.c
+
+$(OBJDIR)$(P)slsmg.$(O) : $(SRCDIR)$(P)slsmg.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slsmg.$(O) $(SRCDIR)$(P)slsmg.c
+
+$(OBJDIR)$(P)slsearch.$(O) : $(SRCDIR)$(P)slsearch.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slsearch.$(O) $(SRCDIR)$(P)slsearch.c
+
+$(OBJDIR)$(P)slrline.$(O) : $(SRCDIR)$(P)slrline.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slrline.$(O) $(SRCDIR)$(P)slrline.c
+
+$(OBJDIR)$(P)slregexp.$(O) : $(SRCDIR)$(P)slregexp.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slregexp.$(O) $(SRCDIR)$(P)slregexp.c
+
+$(OBJDIR)$(P)slprepr.$(O) : $(SRCDIR)$(P)slprepr.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slprepr.$(O) $(SRCDIR)$(P)slprepr.c
+
+$(OBJDIR)$(P)slparse.$(O) : $(SRCDIR)$(P)slparse.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slparse.$(O) $(SRCDIR)$(P)slparse.c
+
+$(OBJDIR)$(P)slmisc.$(O) : $(SRCDIR)$(P)slmisc.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slmisc.$(O) $(SRCDIR)$(P)slmisc.c
+
+$(OBJDIR)$(P)slmemset.$(O) : $(SRCDIR)$(P)slmemset.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slmemset.$(O) $(SRCDIR)$(P)slmemset.c
+
+$(OBJDIR)$(P)slmemcpy.$(O) : $(SRCDIR)$(P)slmemcpy.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slmemcpy.$(O) $(SRCDIR)$(P)slmemcpy.c
+
+$(OBJDIR)$(P)slmemcmp.$(O) : $(SRCDIR)$(P)slmemcmp.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slmemcmp.$(O) $(SRCDIR)$(P)slmemcmp.c
+
+$(OBJDIR)$(P)slmemchr.$(O) : $(SRCDIR)$(P)slmemchr.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slmemchr.$(O) $(SRCDIR)$(P)slmemchr.c
+
+$(OBJDIR)$(P)slmath.$(O) : $(SRCDIR)$(P)slmath.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slmath.$(O) $(SRCDIR)$(P)slmath.c
+
+$(OBJDIR)$(P)slarith.$(O) : $(SRCDIR)$(P)slarith.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slarith.$(O) $(SRCDIR)$(P)slarith.c
+
+$(OBJDIR)$(P)slassoc.$(O) : $(SRCDIR)$(P)slassoc.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slassoc.$(O) $(SRCDIR)$(P)slassoc.c
+
+$(OBJDIR)$(P)slmalloc.$(O) : $(SRCDIR)$(P)slmalloc.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slmalloc.$(O) $(SRCDIR)$(P)slmalloc.c
+
+$(OBJDIR)$(P)slkeymap.$(O) : $(SRCDIR)$(P)slkeymap.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slkeymap.$(O) $(SRCDIR)$(P)slkeymap.c
+
+$(OBJDIR)$(P)slgetkey.$(O) : $(SRCDIR)$(P)slgetkey.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slgetkey.$(O) $(SRCDIR)$(P)slgetkey.c
+
+$(OBJDIR)$(P)slerr.$(O) : $(SRCDIR)$(P)slerr.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slerr.$(O) $(SRCDIR)$(P)slerr.c
+
+$(OBJDIR)$(P)slcmd.$(O) : $(SRCDIR)$(P)slcmd.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slcmd.$(O) $(SRCDIR)$(P)slcmd.c
+
+$(OBJDIR)$(P)slclass.$(O) : $(SRCDIR)$(P)slclass.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slclass.$(O) $(SRCDIR)$(P)slclass.c
+
+$(OBJDIR)$(P)slarray.$(O) : $(SRCDIR)$(P)slarray.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slarray.$(O) $(SRCDIR)$(P)slarray.c
+
+$(OBJDIR)$(P)slscroll.$(O) : $(SRCDIR)$(P)slscroll.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slscroll.$(O) $(SRCDIR)$(P)slscroll.c
+
+$(OBJDIR)$(P)slsignal.$(O) : $(SRCDIR)$(P)slsignal.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slsignal.$(O) $(SRCDIR)$(P)slsignal.c
+
+$(OBJDIR)$(P)slsig.$(O) : $(SRCDIR)$(P)slsig.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slsig.$(O) $(SRCDIR)$(P)slsig.c
+
+$(OBJDIR)$(P)slkeypad.$(O) : $(SRCDIR)$(P)slkeypad.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slkeypad.$(O) $(SRCDIR)$(P)slkeypad.c
+
+$(OBJDIR)$(P)slerrno.$(O) : $(SRCDIR)$(P)slerrno.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slerrno.$(O) $(SRCDIR)$(P)slerrno.c
+
+$(OBJDIR)$(P)slang.$(O) : $(SRCDIR)$(P)slang.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slang.$(O) $(SRCDIR)$(P)slang.c
+
+$(OBJDIR)$(P)slstring.$(O) : $(SRCDIR)$(P)slstring.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slstring.$(O) $(SRCDIR)$(P)slstring.c
+$(OBJDIR)$(P)slstruct.$(O) : $(SRCDIR)$(P)slstruct.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slstruct.$(O) $(SRCDIR)$(P)slstruct.c
+$(OBJDIR)$(P)slistruc.$(O) : $(SRCDIR)$(P)slistruc.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slistruc.$(O) $(SRCDIR)$(P)slistruc.c
+$(OBJDIR)$(P)slcmplex.$(O) : $(SRCDIR)$(P)slcmplex.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slcmplex.$(O) $(SRCDIR)$(P)slcmplex.c
+$(OBJDIR)$(P)slarrfun.$(O) : $(SRCDIR)$(P)slarrfun.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slarrfun.$(O) $(SRCDIR)$(P)slarrfun.c
+$(OBJDIR)$(P)slimport.$(O) : $(SRCDIR)$(P)slimport.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slimport.$(O) $(slimport_C_FLAGS) $(SRCDIR)$(P)slimport.c
+$(OBJDIR)$(P)slpath.$(O) : $(SRCDIR)$(P)slpath.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slpath.$(O) $(SRCDIR)$(P)slpath.c
+$(OBJDIR)$(P)slcompat.$(O) : $(SRCDIR)$(P)slcompat.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slcompat.$(O) $(SRCDIR)$(P)slcompat.c
+$(OBJDIR)$(P)slposdir.$(O) : $(SRCDIR)$(P)slposdir.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slposdir.$(O) $(SRCDIR)$(P)slposdir.c
+$(OBJDIR)$(P)slstdio.$(O) : $(SRCDIR)$(P)slstdio.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slstdio.$(O) $(SRCDIR)$(P)slstdio.c
+$(OBJDIR)$(P)slproc.$(O) : $(SRCDIR)$(P)slproc.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slproc.$(O) $(SRCDIR)$(P)slproc.c
+$(OBJDIR)$(P)sltime.$(O) : $(SRCDIR)$(P)sltime.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)sltime.$(O) $(SRCDIR)$(P)sltime.c
+$(OBJDIR)$(P)slstrops.$(O) : $(SRCDIR)$(P)slstrops.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slstrops.$(O) $(SRCDIR)$(P)slstrops.c
+$(OBJDIR)$(P)slbstr.$(O) : $(SRCDIR)$(P)slbstr.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slbstr.$(O) $(SRCDIR)$(P)slbstr.c
+$(OBJDIR)$(P)slpack.$(O) : $(SRCDIR)$(P)slpack.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slpack.$(O) $(SRCDIR)$(P)slpack.c
+$(OBJDIR)$(P)slintall.$(O) : $(SRCDIR)$(P)slintall.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slintall.$(O) $(SRCDIR)$(P)slintall.c
+$(OBJDIR)$(P)slposio.$(O) : $(SRCDIR)$(P)slposio.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slposio.$(O) $(SRCDIR)$(P)slposio.c
+$(OBJDIR)$(P)slnspace.$(O) : $(SRCDIR)$(P)slnspace.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slnspace.$(O) $(SRCDIR)$(P)slnspace.c
+$(OBJDIR)$(P)slarrmis.$(O) : $(SRCDIR)$(P)slarrmis.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slarrmis.$(O) $(SRCDIR)$(P)slarrmis.c
+$(OBJDIR)$(P)slospath.$(O) : $(SRCDIR)$(P)slospath.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slospath.$(O) $(SRCDIR)$(P)slospath.c
+$(OBJDIR)$(P)slscanf.$(O) : $(SRCDIR)$(P)slscanf.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slscanf.$(O) $(SRCDIR)$(P)slscanf.c
+#
+!ifndef WIN16
+$(OBJDIR)$(P)slvideo.$(O) : $(SRCDIR)$(P)slvideo.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slvideo.$(O) $(SRCDIR)$(P)slvideo.c
+!endif
+!ifdef MSDOS
+$(OBJDIR)$(P)sldostty.$(O) : $(SRCDIR)$(P)sldostty.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)sldostty.$(O) $(SRCDIR)$(P)sldostty.c
+!endif
+!ifdef OS2
+$(OBJDIR)$(P)slos2tty.$(O) : $(SRCDIR)$(P)slos2tty.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slos2tty.$(O) $(SRCDIR)$(P)slos2tty.c
+!endif
+!ifdef WIN32
+$(OBJDIR)$(P)slw32tty.$(O) : $(SRCDIR)$(P)slw32tty.c $(CONFIG_H)
+	$(COMPILE_CMD)$(OBJDIR)$(P)slw32tty.$(O) $(SRCDIR)$(P)slw32tty.c
+!endif
+
+clean:
+	-cd $(OBJDIR) && $(RM) *.$(O) *.dll *.a
+#
+!endif #NOT HELP

_service:tar_scm:slang-2.3.2.tar.bz2/src/mkfiles/mk_mkmake.bat Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/mkfiles/mkmake.c Added

@@ -0,0 +1,85 @@
+#include <stdio.h>
+#include <slang.h>
+#include <stdlib.h>
+#include <string.h>
+
+char *SLmalloc (SLstrlen_Type len)
+{
+ char *m = malloc (len);
+ if (m == NULL)
+ (void) fprintf (stderr, "Out of memory\n");
+ return m;
+}
+
+SLFUTURE_VOID *SLcalloc (SLstrlen_Type n, SLstrlen_Type len)
+{
+ SLFUTURE_VOID *p = SLmalloc (n*len);
+ if (p != NULL)
+ memset (p, 0, n*len);
+ return p;
+}
+
+void SLfree (SLFUTURE_VOID *s)
+{
+ if (s != NULL) free (s);
+}
+
+void SLang_free_slstring (SLCONST SLstr_Type *s)
+{
+ if (s != NULL) free ((void *)s);
+}
+
+char *SLang_create_slstring (char *s)
+{
+ char *t;
+
+ t = SLmalloc (strlen (s) + 1);
+ if (t == NULL)
+ return t;
+
+ strcpy (t, s);
+ return t;
+}
+
+
+static void usage (void)
+{
+ fprintf (stderr, "Usage: mkmake DEF1 DEF2 ...\n");
+ exit (1);
+}
+
+int main (int argc, char **argv)
+{
+ char buf1024;
+ int i;
+ SLprep_Type *pt;
+
+ if (isatty (0))
+ usage ();
+
+ if (NULL == (pt = SLprep_new ()))
+ return 1;
+
+ if ((-1 == SLprep_set_prefix (pt, "!"))
+ || (-1 == SLprep_set_comment (pt, "#", ""))
+ || (-1 == SLprep_set_flags (pt, SLPREP_BLANK_LINES_OK | SLPREP_COMMENT_LINES_OK)))
+ {
+	SLprep_delete (pt);
+	return 1;
+ }
+
+ for (i = 1; i < argc; i++)
+ SLdefine_for_ifdef (argvi);
+
+ while (NULL != fgets (buf, sizeof (buf) - 1, stdin))
+ {
+	if (SLprep_line_ok (buf, pt))
+	 {
+	 fputs (buf, stdout);
+	 }
+ }
+
+ SLprep_delete (pt);
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/mkfiles/mkmake.exe Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/mkfiles/mkmake16.exe Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/modules.unx Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/pcconf.c Added

@@ -0,0 +1,107 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+static void print (char *symbol, int is_defined)
+{
+   if (is_defined)
+     fprintf (stdout, "%s is defined\n", symbol);
+   else
+     fprintf (stdout, "%s is NOT defined\n", symbol);
+}
+
+int main (int argc, char **argv)
+{
+   print ("__MSDOS__",
+#ifdef __MSDOS__
+	  1
+#else
+	  0
+#endif
+	  );
+
+   print ("IBMPC_SYSTEM",
+#ifdef IBMPC_SYSTEM
+	  1
+#else
+	  0
+#endif
+	  );
+
+   print ("REAL_UNIX_SYSTEM",
+#ifdef REAL_UNIX_SYSTEM
+	  1
+#else
+	  0
+#endif
+	  );
+
+   print ("__os2__",
+#ifdef __os2__
+	  1
+#else
+	  0
+#endif
+	  );
+
+   print ("__WIN32__",
+#ifdef __WIN32__
+	  1
+#else
+	  0
+#endif
+	  );
+
+   print ("__unix__",
+#ifdef __unix__
+	  1
+#else
+	  0
+#endif
+	  );
+
+   print ("__GO32__",
+#ifdef __GO32__
+	  1
+#else
+	  0
+#endif
+	  );
+
+   print ("__DJGPP__",
+#ifdef __DJGPP__
+	  1
+#else
+	  0
+#endif
+	  );
+
+   print ("__MSDOS_16BIT__",
+#ifdef __MSDOS_16BIT__
+	  1
+#else
+	  0
+#endif
+	  );
+
+   return 0;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/sl-feat.h Added

@@ -0,0 +1,91 @@
+/* Setting this to one permits strings with embedded color changing commands.
+ * This is experimental.
+ */
+#define SLSMG_HAS_EMBEDDED_ESCAPE	1
+
+/* Setting this to 1 enables automatic support for associative arrays.
+ * If this is set to 0, an application must explicitly enable associative
+ * array support via SLang_init_slassoc.
+ */
+#define SLANG_HAS_ASSOC_ARRAYS		1
+
+#define SLANG_HAS_COMPLEX		1
+#define SLANG_HAS_FLOAT			1
+
+/* This is the old space-speed trade off.  To reduce memory usage and code
+ * size, set this to zero.
+ */
+#define SLANG_OPTIMIZE_FOR_SPEED	2
+
+#define SLANG_USE_INLINE_CODE		1
+
+/* Add extra information for tracking down errors. */
+#define SLANG_HAS_DEBUG_CODE		1
+
+/* Experimental: Support for examining call frames */
+#define SLANG_HAS_DEBUGGER_SUPPORT	1
+
+/* Allow optimizations based upon the __tmp operator. */
+#define SLANG_USE_TMP_OPTIMIZATION	1
+
+/* Setting this to one will map 8 bit vtxxx terminals to 7 bit.  Terminals
+ * such as the vt320 can be set up to output the two-character escape sequence
+ * encoded as 'ESC ' as single character.  Setting this variable to 1 will
+ * insert code to map such characters to the 7 bit equivalent.
+ * This affects just input characters in the range 128-160 on non PC
+ * systems.
+ */
+#if defined(VMS) || defined(AMIGA)
+# define SLANG_MAP_VTXXX_8BIT	1
+#else
+# define SLANG_MAP_VTXXX_8BIT	0
+#endif
+
+/* Add support for color terminals that cannot do background color erases
+ * Such terminals are poorly designed and are slowly disappearing but they
+ * are still quite common.  For example, screen is one of them!
+ *
+ * This is experimental.  In particular, it is not known to work if
+ * KANJI suupport is enabled.
+ */
+#if !defined(IBMPC_SYSTEM)
+# define SLTT_HAS_NON_BCE_SUPPORT	1
+#else
+# define SLTT_HAS_NON_BCE_SUPPORT	0
+#endif
+
+/* Enable support for 24 bit colors.  (ignored on 32 bit systems) */
+#define SLTT_HAS_TRUECOLOR_SUPPORT	1
+
+
+/* If you want slang to assume that an xterm always has the background color
+ * erase feature, then set this to 1.  Otherwise, it will check the terminfo
+ * database.  This may or may not be a good idea since most good color xterms
+ * support bce but many terminfo systems do not support it.
+ */
+#define SLTT_XTERM_ALWAYS_BCE		0
+
+/*
+ * NOTE: Kanji is not supported by slang-2.  Consider using a UTF-8 aware
+ * terminal.  Setting this variable will have no effect.
+ */
+#define SLANG_HAS_KANJI_SUPPORT		0
+
+#define SLANG_HAS_SIGNALS		1
+
+/* Enable this if you want beginning-of-statement and end-of-statement
+ * callbacks.  This allows the creation of profilers, stack-checkers, etc.
+ * SLANG_HAS_DEBUG_CODE must be enabled for this to work.
+ */
+#define SLANG_HAS_BOSEOS	SLANG_HAS_DEBUG_CODE
+
+/* Define this if you want the language to support qualifiers */
+#define SLANG_HAS_QUALIFIERS	1
+
+#define SLANG_HAS_IEEE_FP	1
+
+#if !defined(IBMPC_SYSTEM)
+# define SLANG_HAS_MULTILINE_RLINE	1
+#else
+# define SLANG_HAS_MULTILINE_RLINE	0
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/slagetput.inc Added

@@ -0,0 +1,155 @@
+/* -*- mode: C -*- */
+#ifdef AGET_FROM_INDEX_ARRAY_FUN
+static int AGET_FROM_INDEX_ARRAY_FUN (GENERIC_TYPE *src_data, SLindex_Type num_elements,
+				 SLang_Array_Type *ind_at, int is_range,
+				 GENERIC_TYPE *dest_data)
+{
+ SLindex_Type *indices, *indices_max;
+
+ if (is_range)
+ {
+	SLarray_Range_Array_Type *r = (SLarray_Range_Array_Type *)ind_at->data;
+	SLindex_Type idx = r->first_index, delta = r->delta;
+	SLindex_Type j, jmax = (SLindex_Type) ind_at->num_elements;
+
+	if (jmax == 0)
+	 return 0;
+
+	if ((idx >= 0)
+	 && ((idx + delta * (jmax-1)) >= 0)
+	 && ((idx + delta * (jmax-1)) < num_elements))
+	 {
+	 for (j = 0; j < jmax; j++)
+	 {
+		 dest_dataj = src_dataidx;
+		 idx += delta;
+	 }
+	 return 0;
+	 }
+
+	for (j = 0; j < jmax; j++)
+	 {
+	 SLindex_Type i = idx;
+	 if (i < 0)
+	 {
+		 i += num_elements;
+		 if (i < 0)
+		 i = num_elements;
+	 }
+	 if (i >= num_elements)
+	 {
+		 SLang_set_error (SL_Index_Error);
+		 return -1;
+	 }
+	 dest_dataj = src_datai;
+	 idx += delta;
+	 }
+	return 0;
+ }
+
+ /* Since the index array is linear, I can address it directly */
+ indices = (SLindex_Type *) ind_at->data;
+ indices_max = indices + ind_at->num_elements;
+
+ while (indices < indices_max)
+ {
+	SLindex_Type i = *indices;
+
+	if (i < 0)
+	 {
+	 i += num_elements;
+	 if (i < 0)
+	 i = num_elements;
+	 }
+	if (i >= num_elements)
+	 {
+	 SLang_set_error (SL_Index_Error);
+	 return -1;
+	 }
+	*dest_data++ = src_datai;
+	indices++;
+ }
+ return 0;
+}
+# undef AGET_FROM_INDEX_ARRAY_FUN
+#endif
+
+#ifdef APUT_FROM_INDEX_ARRAY_FUN
+static int APUT_FROM_INDEX_ARRAY_FUN (char *src_data, SLuindex_Type data_increment,
+				 SLang_Array_Type *ind_at, int is_range,
+				 GENERIC_TYPE *dest_data, SLindex_Type num_elements)
+{
+ SLindex_Type *indices, *indices_max;
+
+ if (is_range)
+ {
+	SLarray_Range_Array_Type *r = (SLarray_Range_Array_Type *)ind_at->data;
+	SLindex_Type idx = r->first_index, delta = r->delta;
+	SLindex_Type j, jmax = (SLindex_Type) ind_at->num_elements;
+
+	if (jmax == 0)
+	 return 0;
+
+	if ((idx >= 0)
+	 && ((idx + delta * (jmax-1)) >= 0)
+	 && ((idx + delta * (jmax-1)) < num_elements))
+	 {
+	 for (j = 0; j < jmax; j++)
+	 {
+		 dest_dataidx = *(GENERIC_TYPE *)src_data;
+		 idx += delta;
+		 src_data += data_increment;
+	 }
+	 return 0;
+	 }
+
+	for (j = 0; j < jmax; j++)
+	 {
+	 SLindex_Type i = idx;
+	 if (i < 0)
+	 {
+		 i += num_elements;
+		 if (i < 0)
+		 i = num_elements;
+	 }
+	 if (i >= num_elements)
+	 {
+		 SLang_set_error (SL_Index_Error);
+		 return -1;
+	 }
+	 dest_datai = *(GENERIC_TYPE *)src_data;
+	 idx += delta;
+	 src_data += data_increment;
+	 }
+	return 0;
+ }
+
+ /* Since the index array is linear, I can address it directly */
+ indices = (SLindex_Type *) ind_at->data;
+ indices_max = indices + ind_at->num_elements;
+
+ while (indices < indices_max)
+ {
+	SLindex_Type i = *indices;
+
+	if (i < 0)
+	 {
+	 i += num_elements;
+	 if (i < 0)
+	 i = num_elements;
+	 }
+	if (i >= num_elements)
+	 {
+	 SLang_set_error (SL_Index_Error);
+	 return -1;
+	 }
+	dest_datai = *(GENERIC_TYPE *)src_data;
+	src_data += data_increment;
+	indices++;
+ }
+ return 0;
+}
+# undef APUT_FROM_INDEX_ARRAY_FUN
+#endif
+
+#undef GENERIC_TYPE

_service:tar_scm:slang-2.3.2.tar.bz2/src/slang.c Added

@@ -0,0 +1,10976 @@
+/* -*- mode: C; mode: fold; -*- */
+/* slang.c --- guts of S-Lang interpreter */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#if SLANG_HAS_FLOAT
+# include <math.h>
+#endif
+
+#include "slang.h"
+#include "_slang.h"
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+# define USE_COMBINED_BYTECODES		1
+#else
+# define USE_COMBINED_BYTECODES		0
+#endif
+
+#define USE_UNUSED_BYCODES_IN_SWITCH	1
+
+struct _pSLBlock_Type;
+
+typedef struct
+{
+ struct _pSLBlock_Type *body;
+ unsigned int num_refs;
+
+ SLFUTURE_CONST char *file;
+#define SLANG_MAX_LOCAL_VARIABLES 255
+ unsigned char nlocals;	 /* number of local variables */
+ unsigned char nargs;		 /* number of arguments */
+ char **local_variables;
+ SLang_NameSpace_Type *static_ns; /* namespace containing this function */
+ SLang_NameSpace_Type *private_ns; /* private namespace where this function was declared */
+#if SLANG_HAS_BOSEOS
+ int issue_bofeof_info;
+#endif
+}
+Function_Header_Type;
+
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ SLang_Name_Type *next;
+ char name_type;
+
+ /* If header is NULL, then the autoload_file field will be used. The file
+ * is to be loaded into the ns namespace.
+ */
+ Function_Header_Type *header; /* body of function */
+ SLFUTURE_CONST char *autoload_file;
+ SLang_NameSpace_Type *autoload_ns;
+}
+_pSLang_Function_Type;
+static char *Local_Variable_NamesSLANG_MAX_LOCAL_VARIABLES;
+
+typedef struct
+{
+ char *name;
+ SLang_Name_Type *next;
+ char name_type;
+
+ int local_var_number;
+}
+SLang_Local_Var_Type;
+
+#if SLANG_HAS_DEBUG_CODE
+typedef struct
+{
+ int linenum;
+ char *filename;
+}
+Linenum_Info_Type;
+#endif
+
+typedef struct _pSLBlock_Type
+{
+ _pSLang_BC_Type bc_main_type;
+ unsigned char bc_sub_type;	 /* no types greater than 255 allowed here */
+ unsigned char bc_flags;
+#define BC_LITERAL_MASK 0x1	 /* if object is a literal */
+
+ unsigned short linenum;
+ union
+ {
+	struct _pSLBlock_Type *blk;
+	int i_blk;
+
+	SLang_Name_Type *nt_blk;
+	SLang_App_Unary_Type *nt_unary_blk;
+	SLang_Arith_Binary_Type *nt_binary_blk;
+	SLang_Intrin_Var_Type *nt_ivar_blk;
+	SLang_Intrin_Fun_Type *nt_ifun_blk;
+	SLang_Global_Var_Type *nt_gvar_blk;
+	SLang_HConstant_Type *hconst_blk;
+	SLang_IConstant_Type *iconst_blk;
+	SLang_LConstant_Type *lconst_blk;
+	SLang_FConstant_Type *fconst_blk;
+	SLang_DConstant_Type *dconst_blk;
+#ifdef HAVE_LONG_LONG
+	_pSLang_LLConstant_Type *llconst_blk;
+#endif
+	_pSLang_Function_Type *nt_fun_blk;
+
+	VOID_STAR ptr_blk;
+	SLFUTURE_CONST char *s_blk;
+	SLang_BString_Type *bs_blk;
+
+#if SLANG_HAS_FLOAT
+	double *double_blk;		 /*literal double is a pointer */
+#endif
+#ifdef HAVE_LONG_LONG
+	long long *llong_blk;
+#endif
+	float float_blk;
+	long l_blk;
+	struct _pSLang_Struct_Type *struct_blk;
+	int (*call_function)(void);
+#if SLANG_HAS_DEBUG_CODE
+	Linenum_Info_Type *line_info;
+#endif
+ }
+ b;
+}
+SLBlock_Type;
+
+/* Debugging and tracing variables */
+
+void (*SLang_Enter_Function)(SLFUTURE_CONST char *) = NULL;
+void (*SLang_Exit_Function)(SLFUTURE_CONST char *) = NULL;
+/* If non null, these call C functions before and after a slang function. */
+
+int _pSLang_Trace = 0;
+/* If _pSLang_Trace = -1, do not trace intrinsics */
+static int Trace_Mode = 0;
+
+static SLFUTURE_CONST char *Trace_Function;	 /* function to be traced */
+
+int SLang_Traceback = SL_TB_PARTIAL;
+
+#if SLANG_HAS_BOSEOS
+static int BOS_Stack_Depth;
+#endif
+
+static SLFUTURE_CONST char *This_Compile_Filename;
+static unsigned int This_Compile_Linenum;
+
+/* These variables handle _NARGS processing by the parser */
+int SLang_Num_Function_Args = 0;
+static int *Num_Args_Stack;
+static unsigned int Recursion_Depth;
+static SLang_Object_Type *Frame_Pointer;
+static int Next_Function_Num_Args;
+
+static unsigned int Frame_Pointer_Depth;
+static unsigned int *Frame_Pointer_Stack;
+
+#if SLANG_HAS_QUALIFIERS
+static SLang_Struct_Type *Next_Function_Qualifiers;
+static SLang_Struct_Type *Function_Qualifiers;
+static SLang_Struct_Type **Function_Qualifiers_Stack;
+#endif
+
+static _pSLang_Function_Type *Current_Function = NULL;
+static Function_Header_Type *Current_Function_Header;
+
+typedef struct
+{
+ _pSLang_Function_Type *function;
+ Function_Header_Type *header; /* could be different from function->header */
+ SLang_Object_Type *local_variable_frame;
+ SLang_NameSpace_Type *static_ns;
+ SLang_NameSpace_Type *private_ns;
+ /* file and line where function call occurs, 0 if no-info */
+ SLCONST char *file;
+ unsigned int line;
+}
+Function_Stack_Type;
+static Function_Stack_Type *Function_Stack;
+static Function_Stack_Type *Function_Stack_Ptr;
+/* static Function_Stack_Type *Function_Stack_Ptr_Max; */
+
+static SLang_NameSpace_Type *This_Private_NameSpace;
+static SLang_NameSpace_Type *This_Static_NameSpace;
+static SLang_NameSpace_Type *Global_NameSpace;
+static SLang_NameSpace_Type *Locals_NameSpace;
+
+static SLang_Name_Type *
+ find_global_hashed_name (SLCONST char *, unsigned long,
+			 SLang_NameSpace_Type *, SLang_NameSpace_Type *,
+			 SLang_NameSpace_Type *, int);
+
+static int Lang_Break_Condition = 0;
+/* true if any one below is true. This keeps us from testing 3 variables.
+ * I know this can be perfomed with a bitmapped variable, but...
+ *
+ * Note that Lang_Break is positive when handling the break statements,
+ * and is negative when handling continue-N forms. The reason this variable
+ * is involved is that continue-N is equivalent to break, break,...,continue.
+ */
+static int Lang_Break = 0;
+static int Lang_Return = 0;
+/* static int Lang_Continue = 0; */
+
+static SLang_Object_Type *Run_Stack;
+static SLang_Object_Type *Stack_Pointer;
+static SLang_Object_Type *Stack_Pointer_Max;
+
+static SLang_Object_Type *Local_Variable_Stack;
+static SLang_Object_Type *Local_Variable_Stack_Max;
+static SLang_Object_Type *Local_Variable_Frame; /* points into Local_Variable_Stack */
+
+#define INTERRUPT_ERROR		0x01
+#define INTERRUPT_SIGNAL	0x02
+static volatile int Handle_Interrupt;	 /* bitmapped value */
+#define IS_SLANG_ERROR	(Handle_Interrupt & INTERRUPT_ERROR)
+
+static void free_function_header (Function_Header_Type *);
+
+#if SLANG_HAS_SIGNALS
+static int check_signals (void);
+#endif
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+# define NUM_CLASSES 512		 /* must be large enough for built-ins */
+static SLclass_Type The_Class_Types NUM_CLASSES;
+static SLang_Class_Type *The_ClassesNUM_CLASSES;
+
+# define GET_CLASS_TYPE(x) \
+ (((x) < NUM_CLASSES) ? The_Class_Types(x) : _pSLang_get_class_type(x))
+
+void _pSLang_set_class_info (SLtype t, SLang_Class_Type *cl)
+{
+ if (t < NUM_CLASSES)
+ {
+	The_Class_Typest = cl->cl_class_type;
+	The_Classes t = cl;
+ }
+}
+# define GET_CLASS(cl,t) \
+ if (((t)>=NUM_CLASSES) || (NULL == (cl = The_Classes(t)))) \
+ cl = _pSLclass_get_class(t)
+# define GET_BUILTIN_CLASS(cl,t) \
+ if (NULL == (cl = The_Classes(t))) \
+ cl = _pSLclass_get_class(t)
+#else
+# define GET_CLASS(cl,t) cl = _pSLclass_get_class(t)
+# define GET_BUILTIN_CLASS(cl,t) cl = _pSLclass_get_class(t)
+# define GET_CLASS_TYPE(t) _pSLclass_get_class(t)->cl_class_type
+#endif
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+SLclass_Type _pSLang_get_class_type (SLtype t)
+{
+ SLang_Class_Type *cl;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (t < NUM_CLASSES)
+ return The_Class_Typest;
+#endif
+ cl = _pSLclass_get_class (t);
+ return cl->cl_class_type;
+}
+#endif
+
+/* If 0, not an arith type. Otherwise it is. Also, value implies precedence
+ * See slarith.c for how this is used.
+ */
+static int Is_Arith_Type_Array 256;
+#define IS_ARITH_TYPE(t) \
+ (((t) < 256) ? Is_Arith_Type_Arrayt : 0)
+
+static void do_traceback (SLCONST char *);
+static void do_function_traceback (Function_Header_Type *, unsigned int);
+
+static int init_interpreter (void);
+
+/*{{{ push/pop/etc stack manipulation functions */
+
+/* These routines are assumed to work even in the presence of a SLang_Error. */
+
+_INLINE_ static int pop_object (SLang_Object_Type *x)
+{
+ register SLang_Object_Type *y;
+
+ y = Stack_Pointer;
+ IF_UNLIKELY(y == Run_Stack)
+ {
+	(void) SLang_set_error (SL_STACK_UNDERFLOW);
+	x->o_data_type = 0;
+	return -1;
+ }
+ y--;
+ *x = *y;
+
+ Stack_Pointer = y;
+ return 0;
+}
+
+int SLang_pop (SLang_Object_Type *x)
+{
+ return pop_object (x);
+}
+
+#if 0
+static int pop_2_objs (SLang_Object_Type *a, SLang_Object_Type *b)
+{
+ register SLang_Object_Type *y;
+
+ y = Stack_Pointer;
+
+ if (Run_Stack + 2 > y)
+ {
+	(void) SLang_set_error (SL_STACK_UNDERFLOW);
+	a->o_data_type = 0;
+	b->o_data_type = 0;
+	SLdo_pop_n (y - Run_Stack);
+	return -1;
+ }
+ *b = *(--y);
+ *a = *(--y);
+ Stack_Pointer = y;
+ return 0;
+}
+#endif
+
+/* This function pops the top of the stack to x0, next to x1, etc... This is
+ * backwards from what might be expected but this corresponds to the order of the local
+ * variable stack.
+ */
+_INLINE_
+static int pop_n_objs_reverse (SLang_Object_Type *x, unsigned int n)
+{
+ register SLang_Object_Type *y;
+ unsigned int i;
+
+ y = Stack_Pointer;
+
+ if (Run_Stack + n > y)
+ {
+	(void) SLang_set_error (SL_STACK_UNDERFLOW);
+	for (i = 0; i < n; i++)
+	 xi.o_data_type = 0;
+	(void) SLdo_pop_n ((unsigned int) (y - Run_Stack));
+	return -1;
+ }
+
+ for (i = 0; i < n; i++)
+ {
+	y--;
+	xi = *y;
+ }
+ Stack_Pointer = y;
+ return 0;
+}
+
+_INLINE_
+static int peek_at_stack (void)
+{
+ IF_UNLIKELY(Stack_Pointer == Run_Stack)
+ {
+	(void) SLang_set_error (SL_STACK_UNDERFLOW);
+	return -1;
+ }
+
+ return (int) (Stack_Pointer - 1)->o_data_type;
+}
+
+int SLang_peek_at_stack (void)
+{
+ return peek_at_stack ();
+}
+
+int _pSLang_peek_at_stack2 (SLtype *_typep)
+{
+ SLtype type;
+ if (Stack_Pointer == Run_Stack)
+ {
+	(void) SLang_set_error (SL_STACK_UNDERFLOW);
+	return -1;
+ }
+
+ type = (Stack_Pointer - 1)->o_data_type;
+ if (type == SLANG_ARRAY_TYPE)
+ *_typep = (Stack_Pointer - 1)->v.array_val->data_type;
+ else
+ *_typep = type;
+ return (int) type;
+}
+
+int SLang_peek_at_stack_n (unsigned int n)
+{
+ unsigned int stklen = (unsigned int)(Stack_Pointer - Run_Stack);
+
+ if (n >= stklen)
+ {
+	(void) SLang_set_error (SL_STACK_UNDERFLOW);
+	return -1;
+ }
+ return (int) (Stack_Pointer - (n+1))->o_data_type;
+}
+
+static int pop_ctrl_integer (int *i)
+{
+ int type;
+ SLang_Class_Type *cl;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ register SLang_Object_Type *y;
+
+ /* Most of the time, either an integer or a char will be on the stack.
+ * Optimize these cases.
+ */
+ y = Stack_Pointer;
+ IF_UNLIKELY(y == Run_Stack)
+ {
+	(void) SLang_set_error (SL_STACK_UNDERFLOW);
+	return -1;
+ }
+ y--;
+
+ type = (int) y->o_data_type;
+ if (type == SLANG_INT_TYPE)
+ {
+	Stack_Pointer = y;
+	*i = y->v.int_val;
+	return 0;
+ }
+ if (type == SLANG_CHAR_TYPE)
+ {
+	Stack_Pointer = y;
+	*i = y->v.char_val;
+	return 0;
+ }
+#else
+ if (-1 == (type = peek_at_stack ()))
+ return -1;
+#endif
+
+ GET_CLASS(cl,type);
+ if (cl->cl_to_bool == NULL)
+ {
+	_pSLang_verror (SL_TYPE_MISMATCH,
+		 "%s cannot be used in a boolean context",
+		 cl->cl_name);
+	return -1;
+ }
+ return cl->cl_to_bool ((unsigned char) type, i);
+}
+
+int SLang_peek_at_stack1_n (unsigned int n)
+{
+ int type;
+
+ type = SLang_peek_at_stack_n (n);
+ if (type == SLANG_ARRAY_TYPE)
+ type = (Stack_Pointer - (n+1))->v.array_val->data_type;
+
+ return type;
+}
+
+int SLang_peek_at_stack1 (void)
+{
+ return SLang_peek_at_stack1_n (0);
+}
+
+/* _INLINE_ */
+static void free_object (SLang_Object_Type *obj, SLang_Class_Type *cl)
+{
+ if ((obj == NULL)
+ || (cl->cl_class_type == SLANG_CLASS_TYPE_SCALAR))
+ return;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (obj->o_data_type == SLANG_STRING_TYPE)
+ {
+	_pSLang_free_slstring (obj->v.s_val);
+	return;
+ }
+#endif
+ (*cl->cl_destroy) (obj->o_data_type, (VOID_STAR) &obj->v);
+}
+
+void SLang_free_object (SLang_Object_Type *obj)
+{
+ SLtype data_type;
+ SLang_Class_Type *cl;
+
+ if (obj == NULL) return;
+ data_type = obj->o_data_type;
+ GET_CLASS(cl,data_type);
+ free_object (obj, cl);
+}
+
+_INLINE_ static int push_object (SLang_Object_Type *x)
+{
+ register SLang_Object_Type *y;
+ y = Stack_Pointer;
+
+ /* if there is a SLang_Error, probably not much harm will be done
+ if it is ignored here */
+ /* if (SLang_Error) return; */
+
+ /* flag it now */
+ IF_UNLIKELY(y >= Stack_Pointer_Max)
+ {
+	(void) SLang_set_error (SL_STACK_OVERFLOW);
+	return -1;
+ }
+
+ *y = *x;
+ Stack_Pointer = y + 1;
+ return 0;
+}
+
+int SLang_push (SLang_Object_Type *x)
+{
+ return push_object (x);
+}
+
+/* _INLINE_ */
+int SLclass_push_ptr_obj (SLtype type, VOID_STAR pval)
+{
+ register SLang_Object_Type *y;
+ y = Stack_Pointer;
+
+ IF_UNLIKELY(y >= Stack_Pointer_Max)
+ {
+	(void) SLang_set_error (SL_STACK_OVERFLOW);
+	return -1;
+ }
+
+ y->o_data_type = type;
+ y->v.ptr_val = pval;
+
+ Stack_Pointer = y + 1;
+ return 0;
+}
+
+_INLINE_ static int push_int_object (SLtype type, int x)
+{
+ register SLang_Object_Type *y;
+ y = Stack_Pointer;
+
+ IF_UNLIKELY(y >= Stack_Pointer_Max)
+ {
+	(void) SLang_set_error (SL_STACK_OVERFLOW);
+	return -1;
+ }
+
+ y->o_data_type = type;
+ y->v.int_val = x;
+
+ Stack_Pointer = y + 1;
+ return 0;
+}
+
+#if (SLANG_ARRAY_INDEX_TYPE == SLANG_INT_TYPE)
+# define push_array_index push_int_object
+#else
+_INLINE_ static int push_array_index (SLtype type, SLindex_Type x)
+{
+ register SLang_Object_Type *y;
+ y = Stack_Pointer;
+
+ IF_UNLIKELY(y >= Stack_Pointer_Max)
+ {
+	(void) SLang_set_error (SL_STACK_OVERFLOW);
+	return -1;
+ }
+
+ y->o_data_type = type;
+ y->v.index_val = x;
+
+ Stack_Pointer = y + 1;
+ return 0;
+}
+#endif
+
+int SLclass_push_int_obj (SLtype type, int x)
+{
+ return push_int_object (type, x);
+}
+
+int _pSLang_push_array (SLang_Array_Type *at, int free_array)
+{
+ register SLang_Object_Type *y;
+
+ y = Stack_Pointer;
+
+ IF_UNLIKELY(y >= Stack_Pointer_Max)
+ {
+	(void) SLang_set_error (SL_STACK_OVERFLOW);
+	if (free_array) SLang_free_array (at);
+	return -1;
+ }
+
+ if (free_array == 0) at->num_refs++;
+ y->o_data_type = SLANG_ARRAY_TYPE;
+ y->v.ptr_val = (VOID_STAR)at;
+
+ Stack_Pointer = y + 1;
+ return 0;
+}
+
+#if SLANG_HAS_FLOAT
+_INLINE_ static int push_double_object (SLtype type, double x)
+{
+ register SLang_Object_Type *y;
+ y = Stack_Pointer;
+
+ IF_UNLIKELY(y >= Stack_Pointer_Max)
+ {
+	(void) SLang_set_error (SL_STACK_OVERFLOW);
+	return -1;
+ }
+
+ y->o_data_type = type;
+ y->v.double_val = x;
+
+ Stack_Pointer = y + 1;
+ return 0;
+}
+
+int SLclass_push_double_obj (SLtype type, double x)
+{
+ return push_double_object (type, x);
+}
+#endif
+
+_INLINE_ static int push_char_object (SLtype type, char x)
+{
+ register SLang_Object_Type *y;
+ y = Stack_Pointer;
+
+ IF_UNLIKELY(y >= Stack_Pointer_Max)
+ {
+	(void) SLang_set_error (SL_STACK_OVERFLOW);
+	return -1;
+ }
+
+ y->o_data_type = type;
+ y->v.char_val = x;
+
+ Stack_Pointer = y + 1;
+ return 0;
+}
+
+int SLclass_push_char_obj (SLtype type, char x)
+{
+ return push_char_object (type, x);
+}
+
+/* This function is "fragile". It is a helper routine and assumes that y is on the stack */
+static int _typecast_object_to_type (SLang_Object_Type *y, SLang_Object_Type *obj, SLtype type, int allow_arrays)
+{
+#if SLANG_OPTIMIZE_FOR_SPEED
+ /* This is an implicit typecast. We do not want to typecast
+ * floats to ints implicitly.
+ */
+ if (IS_ARITH_TYPE(type)
+ && IS_ARITH_TYPE(y->o_data_type)
+ && (type >= y->o_data_type))
+ {
+	/* This should not fail */
+	(void) _pSLarith_typecast (y->o_data_type, (VOID_STAR)&y->v, 1,
+				 type, (VOID_STAR)&obj->v);
+	obj->o_data_type = type;
+	return 0;
+ }
+#endif
+ if ((allow_arrays == 0)
+ || (y->o_data_type != SLANG_ARRAY_TYPE)
+ || (y->v.array_val->data_type != type))
+ {
+	if (-1 == SLclass_typecast (type, 1, 0))
+	 return -1;
+ }
+
+ /* Here, *y has been replaced by the object of the specified type */
+ *obj = *y;
+ return 0;
+}
+
+_INLINE_
+ static int pop_int (int *i)
+{
+ SLang_Object_Type *y;
+ SLang_Object_Type obj;
+
+ y = Stack_Pointer;
+ IF_UNLIKELY(y == Run_Stack)
+ return SLang_pop(&obj);	 /* let it fail */
+ y--;
+ if (y->o_data_type == SLANG_INT_TYPE)
+ {
+	*i = y->v.int_val;
+	Stack_Pointer = y;
+	return 0;
+ }
+ if (-1 == _typecast_object_to_type (y, &obj, SLANG_INT_TYPE, 0))
+ {
+	/* Stack_Pointer = y; */
+	return -1;
+ }
+ *i = obj.v.int_val;
+ Stack_Pointer = y;
+ return 0;
+}
+
+int SLang_pop_int (int *i)
+{
+ return pop_int (i);
+}
+
+int SLang_pop_array_index (SLindex_Type *i)
+{
+ SLang_Object_Type *y;
+ SLang_Object_Type obj;
+
+ y = Stack_Pointer;
+ if (y == Run_Stack)
+ return SLang_pop (&obj);	 /* let it fail */
+ y--;
+ if (y->o_data_type == SLANG_ARRAY_INDEX_TYPE)
+ {
+	*i = y->v.index_val;
+	Stack_Pointer = y;
+	return 0;
+ }
+ if (-1 == _typecast_object_to_type (y, &obj, SLANG_ARRAY_INDEX_TYPE, 0))
+ {
+	/* Stack_Pointer = y; */
+	return -1;
+ }
+ *i = obj.v.index_val;
+ Stack_Pointer = y;
+ return 0;
+}
+
+int SLang_push_array_index (SLindex_Type i)
+{
+ return push_array_index (SLANG_ARRAY_INDEX_TYPE, i);
+}
+
+_INLINE_ static int pop_object_of_type (SLtype type, SLang_Object_Type *obj,
+					int allow_arrays)
+{
+ register SLang_Object_Type *y;
+
+ y = Stack_Pointer;
+ IF_UNLIKELY(y == Run_Stack)
+ return SLang_pop(obj);	 /* let it fail */
+ y--;
+ if (y->o_data_type == type)
+ {
+	*obj = *y;
+	Stack_Pointer = y;
+	return 0;
+ }
+ if (-1 == _typecast_object_to_type (y, obj, type, allow_arrays))
+ {
+	/* Stack_Pointer = y; */
+	return -1;
+ }
+ Stack_Pointer = y;
+ return 0;
+}
+
+int SLclass_pop_ptr_obj (SLtype type, VOID_STAR *s)
+{
+ SLang_Object_Type obj;
+
+ if (-1 == pop_object_of_type (type, &obj, 0))
+ {
+	*s = (VOID_STAR) NULL;
+	return -1;
+ }
+ *s = obj.v.ptr_val;
+ return 0;
+}
+
+int _pSLang_pop_object_of_type (SLtype type, SLang_Object_Type *obj,
+			 int allow_arrays)
+{
+ return pop_object_of_type (type, obj, allow_arrays);
+}
+
+/* This function reverses the top n items on the stack and returns a
+ * an offset from the start of the stack to the last item.
+ */
+int SLreverse_stack (int n)
+{
+ SLang_Object_Type *otop, *obot, tmp;
+
+ otop = Stack_Pointer;
+ if ((n > otop - Run_Stack) || (n < 0))
+ {
+	(void) SLang_set_error (SL_STACK_UNDERFLOW);
+	return -1;
+ }
+ obot = otop - n;
+ otop--;
+ while (otop > obot)
+ {
+	tmp = *obot;
+	*obot = *otop;
+	*otop = tmp;
+	otop--;
+	obot++;
+ }
+ return (int) ((Stack_Pointer - n) - Run_Stack);
+}
+
+/* _INLINE_ */
+static int roll_stack (int np)
+{
+ int n, i;
+ SLang_Object_Type *otop, *obot, tmp;
+
+ if ((n = abs(np)) <= 1) return 0; /* identity */
+
+ obot = otop = Stack_Pointer;
+ i = n;
+ while (i != 0)
+ {
+	if (obot <= Run_Stack)
+	 {
+	 (void) SLang_set_error (SL_STACK_UNDERFLOW);
+	 return -1;
+	 }
+	obot--;
+	i--;
+ }
+ otop--;
+
+ if (np > 0)
+ {
+	/* Put top on bottom and roll rest up. */
+	tmp = *otop;
+	while (otop > obot)
+	 {
+	 *otop = *(otop - 1);
+	 otop--;
+	 }
+	*otop = tmp;
+ }
+ else
+ {
+	/* Put bottom on top and roll rest down. */
+	tmp = *obot;
+	while (obot < otop)
+	 {
+	 *obot = *(obot + 1);
+	 obot++;
+	 }
+	*obot = tmp;
+ }
+ return 0;
+}
+
+int SLroll_stack (int np)
+{
+ return roll_stack (np);
+}
+
+int SLstack_exch (unsigned int a, unsigned int b)
+{
+ SLang_Object_Type *ap, *bp;
+ SLang_Object_Type tmp;
+ unsigned int stklen = (unsigned int)(Stack_Pointer - Run_Stack);
+
+ if ((a >= stklen) || (b >= stklen))
+ {
+	(void) SLang_set_error (SL_STACK_UNDERFLOW);
+	return -1;
+ }
+ ap = Stack_Pointer - (a+1);
+ bp = Stack_Pointer - (b+1);
+
+ tmp = *ap;
+ *ap = *bp;
+ *bp = tmp;
+
+ return 0;
+}
+
+int SLstack_depth (void)
+{
+ return (int) (Stack_Pointer - Run_Stack);
+}
+
+int SLdup_n (int n)
+{
+ SLang_Object_Type *bot, *top;
+
+ if (n <= 0)
+ return 0;
+
+ top = Stack_Pointer;
+ if (top < Run_Stack + n)
+ {
+	(void) SLang_set_error (SL_STACK_UNDERFLOW);
+	return -1;
+ }
+ if (top + n > Stack_Pointer_Max)
+ {
+	(void) SLang_set_error (SL_STACK_OVERFLOW);
+	return -1;
+ }
+ bot = top - n;
+
+ while (bot < top)
+ {
+	SLang_Class_Type *cl;
+	SLtype data_type = bot->o_data_type;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+	if (SLANG_CLASS_TYPE_SCALAR == GET_CLASS_TYPE(data_type))
+	 {
+	 *Stack_Pointer++ = *bot++;
+	 continue;
+	 }
+#endif
+	GET_CLASS(cl,data_type);
+	if (-1 == (*cl->cl_push) (data_type, (VOID_STAR) &bot->v))
+	 return -1;
+	bot++;
+ }
+ return 0;
+}
+
+/*}}}*/
+
+/*{{{ inner interpreter and support functions */
+
+_INLINE_
+int _pSL_increment_frame_pointer (void)
+{
+ IF_UNLIKELY(Recursion_Depth >= SLANG_MAX_RECURSIVE_DEPTH)
+ {
+#if SLANG_HAS_QUALIFIERS
+	if (Next_Function_Qualifiers != NULL)
+	 {
+	 SLang_free_struct (Next_Function_Qualifiers);
+	 Next_Function_Qualifiers = NULL;
+	 }
+#endif
+	_pSLang_verror (SL_STACK_OVERFLOW, "Num Args Stack Overflow");
+	return -1;
+ }
+ Num_Args_Stack Recursion_Depth = SLang_Num_Function_Args;
+ SLang_Num_Function_Args = Next_Function_Num_Args;
+ Next_Function_Num_Args = 0;
+#if SLANG_HAS_QUALIFIERS
+ Function_Qualifiers_StackRecursion_Depth = Function_Qualifiers;
+ Function_Qualifiers = Next_Function_Qualifiers;
+ Next_Function_Qualifiers = NULL;
+#endif
+ Recursion_Depth++;
+ return 0;
+}
+
+_INLINE_
+int _pSL_decrement_frame_pointer (void)
+{
+#if SLANG_HAS_QUALIFIERS
+ if (Function_Qualifiers != NULL)
+ {
+	SLang_free_struct (Function_Qualifiers);
+	Function_Qualifiers = NULL;
+ }
+#endif
+ IF_UNLIKELY(Recursion_Depth == 0)
+ {
+	_pSLang_verror (SL_STACK_UNDERFLOW, "Num Args Stack Underflow");
+	return -1;
+ }
+
+ Recursion_Depth--;
+ if (Recursion_Depth < SLANG_MAX_RECURSIVE_DEPTH)
+ {
+	SLang_Num_Function_Args = Num_Args_Stack Recursion_Depth;
+#if SLANG_HAS_QUALIFIERS
+	Function_Qualifiers = Function_Qualifiers_StackRecursion_Depth;
+#endif
+ }
+ return 0;
+}
+
+static int decrement_slang_frame_pointer (void)
+{
+ Function_Stack_Type *s;
+
+ if (-1 == _pSL_decrement_frame_pointer ())
+ return -1;
+
+ Function_Stack_Ptr--;
+ s = Function_Stack_Ptr;
+ Current_Function = s->function;
+ Current_Function_Header = s->header;
+ This_Compile_Linenum = s->line;
+ return 0;
+}
+
+static int increment_slang_frame_pointer (_pSLang_Function_Type *fun, unsigned int linenum)
+{
+ Function_Stack_Type *s;
+
+ if (-1 == _pSL_increment_frame_pointer ())
+ return -1;
+
+ /* No need to check for stack underflow/overflow errors here since
+ * this stack is the same size as the "frame pointer stack".
+ */
+ s = Function_Stack_Ptr++;
+ s->function = Current_Function;
+ s->header = Current_Function_Header;
+ s->local_variable_frame = Local_Variable_Frame;
+ s->line = linenum;
+ if (Current_Function_Header != NULL)
+ {
+	s->file = Current_Function_Header->file;
+	s->static_ns = Current_Function_Header->static_ns;
+	s->private_ns = Current_Function_Header->private_ns;
+ }
+ else
+ {
+	s->file = This_Compile_Filename;
+	s->static_ns = This_Static_NameSpace;
+	s->private_ns = This_Private_NameSpace;
+ }
+ if (fun == NULL)
+ return 0;			 /* called from SLexecute_function */
+
+ if (fun->header == NULL)
+ {
+	if (fun->autoload_ns == NULL)
+	 {
+	 if (-1 == SLang_load_file(fun->autoload_file))
+	 {
+		 (void) decrement_slang_frame_pointer ();
+		 return -1;
+	 }
+	 }
+	else if (-1 == SLns_load_file (fun->autoload_file, fun->autoload_ns->namespace_name))
+	 {
+	 (void) decrement_slang_frame_pointer ();
+	 return -1;
+	 }
+
+	if (NULL == fun->header)
+	 {
+	 _pSLang_verror (SL_UNDEFINED_NAME, "%s: Function did not autoload",
+			 fun->name);
+ (void) decrement_slang_frame_pointer ();
+	 return -1;
+	 }
+ }
+ Current_Function = fun;
+ Current_Function_Header = fun->header;
+ return 0;
+}
+
+#if SLANG_HAS_QUALIFIERS
+static int set_qualifier (void)
+{
+ if (SLANG_NULL_TYPE == peek_at_stack ())
+ {
+	Next_Function_Qualifiers = NULL;
+	return SLang_pop_null ();
+ }
+ return SLang_pop_struct (&Next_Function_Qualifiers);
+}
+
+/* This function is called from slang code */
+int _pSLang_get_qualifiers_intrin (SLang_Struct_Type **qp)
+{
+ /* The assumption is that this is being called from a function one level up.
+ * Grab the qualifiers from the previous frame stack.
+ */
+ if (Recursion_Depth > 1)
+ *qp = Function_Qualifiers_StackRecursion_Depth-1;
+ else
+ *qp = NULL;
+
+ return 0;
+}
+
+/* This may be called from intrinsic functions */
+int SLang_qualifier_exists (SLCONST char *name)
+{
+ if (Function_Qualifiers == NULL)
+ return 0;
+
+ return (NULL != _pSLstruct_get_field_value (Function_Qualifiers, name));
+}
+
+/* returns -1 upon error, 0 if qualifier does not exist,
+ * 1 if qualifier exists and has correct type,
+ * 2 if qualifier had to be converted to requested type.
+ * If 1, then use the first object pointer but do not free it.
+ * If 2, then use the second object pointer and free it.
+ */
+static int check_qualifier (SLCONST char *name, SLtype t,
+			 SLang_Object_Type **op, SLang_Object_Type *o)
+{
+ SLang_Object_Type *objp;
+
+ if ((Function_Qualifiers == NULL)
+ || (NULL == (objp = _pSLstruct_get_field_value (Function_Qualifiers, name)))
+ || (objp->o_data_type == SLANG_NULL_TYPE)
+ )
+ {
+	*op = NULL;
+	return 0;
+ }
+
+ if (objp->o_data_type == t)
+ {
+	*op = objp;
+	return 1;
+ }
+
+ if (-1 == _pSLpush_slang_obj (objp))
+ return -1;
+
+ if (-1 == pop_object_of_type (t, o, 0))
+ {
+	SLang_verror (0, "Expecting '%s' qualifier to be %s",
+		 name, SLclass_get_datatype_name (t));
+	return -1;
+ }
+ return 2;
+}
+
+int SLang_get_int_qualifier (SLCONST char *name, int *p, int def)
+{
+ SLang_Object_Type *objp;
+ SLang_Object_Type obj;
+ int status;
+
+ status = check_qualifier (name, SLANG_INT_TYPE, &objp, &obj);
+ if (status <= 0)
+ {
+	*p = def;
+	return status;
+ }
+ if (status == 1)
+ {
+	*p = objp->v.int_val;
+	return 0;
+ }
+ *p = obj.v.int_val;
+ /* SLang_free_object (&obj); not necessary for scalars */
+ return 0;
+}
+
+int SLang_get_long_qualifier (SLCONST char *name, long *p, long def)
+{
+ SLang_Object_Type *objp;
+ SLang_Object_Type obj;
+ int status;
+
+ status = check_qualifier (name, SLANG_LONG_TYPE, &objp, &obj);
+ if (status <= 0)
+ {
+	*p = def;
+	return status;
+ }
+ if (status == 1)
+ {
+	*p = objp->v.long_val;
+	return 0;
+ }
+ *p = obj.v.long_val;
+ /* SLang_free_object (&obj); not necessary for scalars */
+ return 0;
+}
+
+#if SLANG_HAS_FLOAT
+int SLang_get_double_qualifier (SLCONST char *name, double *p, double def)
+{
+ SLang_Object_Type *objp;
+ SLang_Object_Type obj;
+ int status;
+
+ status = check_qualifier (name, SLANG_DOUBLE_TYPE, &objp, &obj);
+ if (status <= 0)
+ {
+	*p = def;
+	return status;
+ }
+ if (status == 1)
+ {
+	*p = objp->v.double_val;
+	return 0;
+ }
+ *p = obj.v.double_val;
+ /* SLang_free_object (&obj); not necessary for scalars */
+ return 0;
+}
+#endif
+
+int SLang_get_string_qualifier (SLCONST char *name, char **p, SLFUTURE_CONST char *def)
+{
+ SLang_Object_Type *objp;
+ SLang_Object_Type obj;
+ int status;
+
+ status = check_qualifier (name, SLANG_STRING_TYPE, &objp, &obj);
+ if (status <= 0)
+ {
+	if (status == 0)
+	 {
+	 if ((def != NULL)
+		 && (NULL == (def = SLang_create_slstring (def))))
+	 status = -1;
+	 else *p = (char *)def;
+	 }
+	return status;
+ }
+
+ if (status == 1)
+ {
+	if (NULL == (*p = SLang_create_slstring (objp->v.s_val)))
+	 return -1;
+	return 0;
+ }
+
+ *p = obj.v.s_val;
+ /* SLang_free_object (&obj); not necessary, since we own v.s_val */
+ return 0;
+}
+#endif
+
+_INLINE_
+static int start_arg_list (void)
+{
+ IF_LIKELY(Frame_Pointer_Depth < SLANG_MAX_RECURSIVE_DEPTH)
+ {
+	Frame_Pointer_Stack Frame_Pointer_Depth = (unsigned int) (Frame_Pointer - Run_Stack);
+	Frame_Pointer = Stack_Pointer;
+	Frame_Pointer_Depth++;
+	Next_Function_Num_Args = 0;
+	return 0;
+ }
+
+ _pSLang_verror (SL_STACK_OVERFLOW, "Frame Stack Overflow");
+ return -1;
+}
+
+int SLang_start_arg_list (void)
+{
+ return start_arg_list ();
+}
+
+int _pSLang_restart_arg_list (int nargs)
+{
+ if (Frame_Pointer_Depth < SLANG_MAX_RECURSIVE_DEPTH)
+ {
+	if ((nargs < 0) || (Run_Stack + nargs > Stack_Pointer))
+	 {
+	 _pSLang_verror (SL_Internal_Error, "restart_arg_list: stack underflow");
+	 return -1;
+	 }
+	Frame_Pointer_Stack Frame_Pointer_Depth = (unsigned int) (Frame_Pointer - Run_Stack);
+	Frame_Pointer = Stack_Pointer - nargs;
+	Frame_Pointer_Depth++;
+	Next_Function_Num_Args = 0;
+	return 0;
+ }
+
+ _pSLang_verror (SL_STACK_OVERFLOW, "Frame Stack Overflow");
+ return -1;
+}
+
+_INLINE_ static int end_arg_list (void)
+{
+ IF_UNLIKELY(Frame_Pointer_Depth == 0)
+ {
+	_pSLang_verror (SL_STACK_UNDERFLOW, "Frame Stack Underflow");
+	return -1;
+ }
+ Frame_Pointer_Depth--;
+ if (Frame_Pointer_Depth < SLANG_MAX_RECURSIVE_DEPTH)
+ {
+	Next_Function_Num_Args = (int) (Stack_Pointer - Frame_Pointer);
+	Frame_Pointer = Run_Stack + Frame_Pointer_Stack Frame_Pointer_Depth;
+ }
+ return 0;
+}
+
+int SLang_end_arg_list (void)
+{
+ return end_arg_list ();
+}
+
+_INLINE_
+static int do_bc_call_direct_frame (int (*f)(void))
+{
+ if ((0 == end_arg_list ())
+ && (0 == _pSL_increment_frame_pointer ()))
+ {
+	(void) (*f) ();
+	_pSL_decrement_frame_pointer ();
+ }
+ if (IS_SLANG_ERROR)
+ return -1;
+ return 0;
+}
+
+_INLINE_
+static int do_bc_call_direct_nargs (int (*f)(void))
+{
+ if (0 == end_arg_list ())
+ {
+	int nargs = SLang_Num_Function_Args;
+
+	SLang_Num_Function_Args = Next_Function_Num_Args;
+	Next_Function_Num_Args = 0;
+	(void) (*f) ();
+	SLang_Num_Function_Args = nargs;
+ }
+ if (IS_SLANG_ERROR)
+ return -1;
+ return 0;
+}
+
+static int do_name_type_error (SLang_Name_Type *nt)
+{
+ if (nt != NULL)
+ {
+	char buf256;
+	(void) _pSLsnprintf (buf, sizeof (buf), "(Error occurred processing %s)", nt->name);
+	do_traceback (buf);
+ }
+ return -1;
+}
+
+/* local and global variable assignments */
+
+static int do_binary_ab (int op, SLang_Object_Type *obja, SLang_Object_Type *objb)
+{
+ SLang_Class_Type *a_cl, *b_cl, *c_cl;
+ SLtype b_data_type, a_data_type, c_data_type;
+ int (*binary_fun) (int,
+		 SLtype, VOID_STAR, SLuindex_Type,
+		 SLtype, VOID_STAR, SLuindex_Type,
+		 VOID_STAR);
+ VOID_STAR pa;
+ VOID_STAR pb;
+ VOID_STAR pc;
+ int ret;
+
+ b_data_type = objb->o_data_type;
+ a_data_type = obja->o_data_type;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (IS_ARITH_TYPE(a_data_type)
+ && IS_ARITH_TYPE(b_data_type))
+ {
+	int status;
+	status = _pSLarith_bin_op (obja, objb, op);
+	if (status != 1)
+	 return status;
+	/* drop and try it the hard way */
+ }
+
+ if (a_data_type == b_data_type)
+ {
+	if (a_data_type == SLANG_ARRAY_TYPE)
+	 return _pSLarray_bin_op (obja, objb, op);
+
+	if ((a_data_type == SLANG_STRING_TYPE)
+	 && (op == SLANG_PLUS))
+	 {
+	 char *stra = obja->v.s_val, *strb = objb->v.s_val, *strc;
+
+	 strc = SLang_concat_slstrings (stra, strb);
+	 if (strc == NULL)
+	 return -1;
+
+	 return _pSLang_push_slstring (strc); /* frees strc */
+	 }
+ }
+#endif
+
+ GET_CLASS(a_cl,a_data_type);
+ if (a_data_type == b_data_type)
+ b_cl = a_cl;
+ else
+ GET_CLASS(b_cl, b_data_type);
+
+ if (NULL == (binary_fun = _pSLclass_get_binary_fun (op, a_cl, b_cl, &c_cl, 1)))
+ return -1;
+
+ c_data_type = c_cl->cl_data_type;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (SLANG_CLASS_TYPE_VECTOR == a_cl->cl_class_type)
+ pa = (VOID_STAR) obja->v.ptr_val;
+ else
+ pa = (VOID_STAR) &obja->v;
+#else
+ pa = _pSLclass_get_ptr_to_value (a_cl, obja);
+#endif
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (SLANG_CLASS_TYPE_VECTOR == b_cl->cl_class_type)
+ pb = (VOID_STAR) objb->v.ptr_val;
+ else
+ pb = (VOID_STAR) &objb->v;
+#else
+ pb = _pSLclass_get_ptr_to_value (b_cl, objb);
+#endif
+
+ pc = c_cl->cl_transfer_buf;
+
+ if (1 != (*binary_fun) (op,
+			 a_data_type, pa, 1,
+			 b_data_type, pb, 1,
+			 pc))
+ {
+	_pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "Binary operation between %s and %s failed",
+		 a_cl->cl_name, b_cl->cl_name);
+
+	return -1;
+ }
+
+ /* apush will create a copy, so make sure we free after the push */
+ ret = (*c_cl->cl_apush)(c_data_type, pc);
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if ((SLANG_CLASS_TYPE_SCALAR != c_cl->cl_class_type)
+ && (SLANG_CLASS_TYPE_VECTOR != c_cl->cl_class_type))
+#endif
+ (*c_cl->cl_adestroy)(c_data_type, pc);
+
+ return ret;
+}
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+static int int_int_binary_result (int op, SLang_Object_Type *obja, SLang_Object_Type *objb, SLang_Object_Type *objc)
+{
+ int a, b;
+
+ a = obja->v.int_val; b = objb->v.int_val;
+ switch (op)
+ {
+ case SLANG_PLUS:
+	objc->v.int_val = a + b; objc->o_data_type = SLANG_INT_TYPE;
+	return 0;
+ case SLANG_MINUS:
+	objc->v.int_val = a - b; objc->o_data_type = SLANG_INT_TYPE;
+	return 0;
+ case SLANG_TIMES:
+	objc->v.int_val = a * b; objc->o_data_type = SLANG_INT_TYPE;
+	return 0;
+ case SLANG_DIVIDE:
+	if (b == 0)
+	 {
+	 SLang_set_error (SL_DIVIDE_ERROR);
+	 return -1;
+	 }
+	objc->v.int_val = a/b; objc->o_data_type = SLANG_INT_TYPE;
+	return 0;
+ case SLANG_MOD:
+	if (b == 0)
+	 {
+	 SLang_set_error (SL_DIVIDE_ERROR);
+	 return -1;
+	 }
+	objc->v.int_val = a % b; objc->o_data_type = SLANG_INT_TYPE;
+	return 0;
+
+ case SLANG_BAND:
+	objc->v.int_val = (a & b); objc->o_data_type = SLANG_INT_TYPE;
+	return 0;
+ case SLANG_BXOR:
+	objc->v.int_val = (a ^ b); objc->o_data_type = SLANG_INT_TYPE;
+	return 0;
+ case SLANG_BOR:
+	objc->v.int_val = (a | b); objc->o_data_type = SLANG_INT_TYPE;
+	return 0;
+ case SLANG_SHL:
+	objc->v.int_val = (a << b); objc->o_data_type = SLANG_INT_TYPE;
+	return 0;
+ case SLANG_SHR:
+	objc->v.int_val = (a >> b); objc->o_data_type = SLANG_INT_TYPE;
+	return 0;
+
+ case SLANG_EQ:
+	objc->v.char_val = (a == b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_NE:
+	objc->v.char_val = (a != b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_GT:
+	objc->v.char_val = (a > b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_GE:
+	objc->v.char_val = (a >= b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_LT:
+	objc->v.char_val = (a < b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_LE:
+	objc->v.char_val = (a <= b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ }
+ if (-1 == do_binary_ab (op, obja, objb))
+ return -1;
+
+ return pop_object (objc);
+}
+
+static int int_int_binary (int op, SLang_Object_Type *obja, SLang_Object_Type *objb)
+{
+ int a = obja->v.int_val;
+ int b = objb->v.int_val;
+
+ switch (op)
+ {
+ case SLANG_PLUS:
+	return push_int_object (SLANG_INT_TYPE, a + b);
+ case SLANG_MINUS:
+	return push_int_object (SLANG_INT_TYPE, a - b);
+ case SLANG_TIMES:
+	return push_int_object (SLANG_INT_TYPE, a * b);
+ case SLANG_DIVIDE:
+	if (b == 0)
+	 {
+	 SLang_set_error (SL_DIVIDE_ERROR);
+	 return -1;
+	 }
+	return push_int_object (SLANG_INT_TYPE, a/b);
+ case SLANG_MOD:
+	if (b == 0)
+	 {
+	 SLang_set_error (SL_DIVIDE_ERROR);
+	 return -1;
+	 }
+	return push_int_object (SLANG_INT_TYPE, a%b);
+
+ case SLANG_BAND:
+	return push_int_object (SLANG_INT_TYPE, a&b);
+ case SLANG_BXOR:
+	return push_int_object (SLANG_INT_TYPE, a^b);
+ case SLANG_BOR:
+	return push_int_object (SLANG_INT_TYPE, a|b);
+ case SLANG_SHL:
+	return push_int_object (SLANG_INT_TYPE, a<<b);
+ case SLANG_SHR:
+	return push_int_object (SLANG_INT_TYPE, a>>b);
+
+ case SLANG_EQ:
+	return push_char_object (SLANG_CHAR_TYPE, a == b);
+ case SLANG_NE:
+	return push_char_object (SLANG_CHAR_TYPE, a != b);
+ case SLANG_GT:
+	return push_char_object (SLANG_CHAR_TYPE, a > b);
+ case SLANG_GE:
+	return push_char_object (SLANG_CHAR_TYPE, a >= b);
+ case SLANG_LT:
+	return push_char_object (SLANG_CHAR_TYPE, a < b);
+ case SLANG_LE:
+	return push_char_object (SLANG_CHAR_TYPE, a <= b);
+ }
+ return do_binary_ab (op, obja, objb);
+}
+
+#if SLANG_HAS_FLOAT
+static int dbl_dbl_binary (int op, SLang_Object_Type *obja, SLang_Object_Type *objb)
+{
+ switch (op)
+ {
+ case SLANG_PLUS:
+	return push_double_object (SLANG_DOUBLE_TYPE, obja->v.double_val + objb->v.double_val);
+ case SLANG_MINUS:
+	return push_double_object (SLANG_DOUBLE_TYPE, obja->v.double_val - objb->v.double_val);
+ case SLANG_TIMES:
+	return push_double_object (SLANG_DOUBLE_TYPE, obja->v.double_val * objb->v.double_val);
+ case SLANG_DIVIDE:
+	return push_double_object (SLANG_DOUBLE_TYPE, obja->v.double_val / objb->v.double_val);
+ case SLANG_EQ:
+	return push_char_object (SLANG_CHAR_TYPE, obja->v.double_val == objb->v.double_val);
+ case SLANG_NE:
+	return push_char_object (SLANG_CHAR_TYPE, obja->v.double_val != objb->v.double_val);
+ case SLANG_GT:
+	return push_char_object (SLANG_CHAR_TYPE, obja->v.double_val > objb->v.double_val);
+ case SLANG_GE:
+	return push_char_object (SLANG_CHAR_TYPE, obja->v.double_val >= objb->v.double_val);
+ case SLANG_LT:
+	return push_char_object (SLANG_CHAR_TYPE, obja->v.double_val < objb->v.double_val);
+ case SLANG_LE:
+	return push_char_object (SLANG_CHAR_TYPE, obja->v.double_val <= objb->v.double_val);
+ case SLANG_POW:
+	return push_double_object (SLANG_DOUBLE_TYPE, pow(obja->v.double_val, objb->v.double_val));
+ }
+ return do_binary_ab (op, obja, objb);
+}
+
+static int int_dbl_binary_result (int op, SLang_Object_Type *obja, SLang_Object_Type *objb, SLang_Object_Type *objc)
+{
+ int a = obja->v.int_val;
+ double b = objb->v.double_val;
+
+ switch (op)
+ {
+ case SLANG_PLUS:
+	objc->v.double_val = a + b; objc->o_data_type = SLANG_DOUBLE_TYPE;
+	return 0;
+ case SLANG_MINUS:
+	objc->v.double_val = a - b; objc->o_data_type = SLANG_DOUBLE_TYPE;
+	return 0;
+ case SLANG_TIMES:
+	objc->v.double_val = a * b; objc->o_data_type = SLANG_DOUBLE_TYPE;
+	return 0;
+ case SLANG_DIVIDE:
+	objc->v.double_val = a / b; objc->o_data_type = SLANG_DOUBLE_TYPE;
+	return 0;
+ case SLANG_EQ:
+	objc->v.char_val = (a == b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_NE:
+	objc->v.char_val = (a != b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_GT:
+	objc->v.char_val = (a > b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_GE:
+	objc->v.char_val = (a >= b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_LT:
+	objc->v.char_val = (a < b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_LE:
+	objc->v.char_val = (a <= b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_POW:
+	objc->v.double_val = pow(a,b); objc->o_data_type = SLANG_DOUBLE_TYPE;
+	return 0;
+ }
+ if (-1 == do_binary_ab (op, obja, objb))
+ return -1;
+
+ return pop_object (objc);
+}
+
+static int dbl_int_binary_result (int op, SLang_Object_Type *obja, SLang_Object_Type *objb, SLang_Object_Type *objc)
+{
+ double a = obja->v.double_val;
+ int b = objb->v.int_val;
+
+ switch (op)
+ {
+ case SLANG_PLUS:
+	objc->v.double_val = a + b; objc->o_data_type = SLANG_DOUBLE_TYPE;
+	return 0;
+ case SLANG_MINUS:
+	objc->v.double_val = a - b; objc->o_data_type = SLANG_DOUBLE_TYPE;
+	return 0;
+ case SLANG_TIMES:
+	objc->v.double_val = a * b; objc->o_data_type = SLANG_DOUBLE_TYPE;
+	return 0;
+ case SLANG_DIVIDE:
+	objc->v.double_val = a / b; objc->o_data_type = SLANG_DOUBLE_TYPE;
+	return 0;
+ case SLANG_EQ:
+	objc->v.char_val = (a == b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_NE:
+	objc->v.char_val = (a != b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_GT:
+	objc->v.char_val = (a > b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_GE:
+	objc->v.char_val = (a >= b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_LT:
+	objc->v.char_val = (a < b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_LE:
+	objc->v.char_val = (a <= b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_POW:
+	objc->v.double_val = pow(a,b); objc->o_data_type = SLANG_DOUBLE_TYPE;
+	return 0;
+ }
+ if (-1 == do_binary_ab (op, obja, objb))
+ return -1;
+
+ return pop_object (objc);
+}
+
+static int dbl_dbl_binary_result (int op, SLang_Object_Type *obja, SLang_Object_Type *objb, SLang_Object_Type *objc)
+{
+ double a = obja->v.double_val;
+ double b = objb->v.double_val;
+
+ switch (op)
+ {
+ case SLANG_PLUS:
+	objc->v.double_val = a + b; objc->o_data_type = SLANG_DOUBLE_TYPE;
+	return 0;
+ case SLANG_MINUS:
+	objc->v.double_val = a - b; objc->o_data_type = SLANG_DOUBLE_TYPE;
+	return 0;
+ case SLANG_TIMES:
+	objc->v.double_val = a * b; objc->o_data_type = SLANG_DOUBLE_TYPE;
+	return 0;
+ case SLANG_DIVIDE:
+	objc->v.double_val = a / b; objc->o_data_type = SLANG_DOUBLE_TYPE;
+	return 0;
+ case SLANG_EQ:
+	objc->v.char_val = (a == b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_NE:
+	objc->v.char_val = (a != b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_GT:
+	objc->v.char_val = (a > b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_GE:
+	objc->v.char_val = (a >= b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_LT:
+	objc->v.char_val = (a < b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_LE:
+	objc->v.char_val = (a <= b); objc->o_data_type = SLANG_CHAR_TYPE;
+	return 0;
+ case SLANG_POW:
+	objc->v.double_val = pow(a,b); objc->o_data_type = SLANG_DOUBLE_TYPE;
+	return 0;
+ }
+ if (-1 == do_binary_ab (op, obja, objb))
+ return -1;
+
+ return pop_object (objc);
+}
+#endif				 /* SLANG_HAS_FLOAT */
+#endif				 /* SLANG_OPTIMIZE_FOR_SPEED */
+
+int _pSLang_do_binary_ab (int op, SLang_Object_Type *obja, SLang_Object_Type *objb)
+{
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (obja->o_data_type == objb->o_data_type)
+ {
+	if (obja->o_data_type == SLANG_INT_TYPE)
+	 return int_int_binary (op, obja, objb);
+#if SLANG_HAS_FLOAT
+	if (obja->o_data_type == SLANG_DOUBLE_TYPE)
+	 return dbl_dbl_binary (op, obja, objb);
+#endif
+ }
+#endif
+ return do_binary_ab (op, obja, objb);
+}
+
+#define INC_REF(cl,type,addr,dr) \
+ if (cl->cl_inc_ref != NULL) (*cl->cl_inc_ref)(type,addr,dr)
+
+/* _INLINE_ */
+static int do_binary_ab_inc_ref (int op, SLang_Object_Type *obja, SLang_Object_Type *objb)
+{
+ int ret;
+ SLang_Class_Type *cl_a, *cl_b;
+ SLtype atype = obja->o_data_type;
+ SLtype btype = objb->o_data_type;
+
+ if (atype == SLANG_INT_TYPE)
+ {
+	if (btype == SLANG_INT_TYPE)
+	 {
+	 int a, b;
+
+	 a = obja->v.int_val; b = objb->v.int_val;
+	 switch (op)
+	 {
+		case SLANG_PLUS:
+		 return push_int_object (SLANG_INT_TYPE, a+b);
+		case SLANG_MINUS:
+		 return push_int_object (SLANG_INT_TYPE, a-b);
+		case SLANG_TIMES:
+		 return push_int_object (SLANG_INT_TYPE, a*b);
+		case SLANG_DIVIDE:
+		 if (b == 0)
+		 {
+		 SLang_set_error (SL_DIVIDE_ERROR);
+		 return -1;
+		 }
+		 return push_int_object (SLANG_INT_TYPE, a/b);
+		case SLANG_MOD:
+		 if (b == 0)
+		 {
+		 SLang_set_error (SL_DIVIDE_ERROR);
+		 return -1;
+		 }
+		 return push_int_object (SLANG_INT_TYPE, a%b);
+
+		case SLANG_BAND:
+		 return push_int_object (SLANG_INT_TYPE, a&b);
+		case SLANG_BXOR:
+		 return push_int_object (SLANG_INT_TYPE, a^b);
+		case SLANG_BOR:
+		 return push_int_object (SLANG_INT_TYPE, a|b);
+		case SLANG_SHL:
+		 return push_int_object (SLANG_INT_TYPE, a<<b);
+		case SLANG_SHR:
+		 return push_int_object (SLANG_INT_TYPE, a>>b);
+
+		case SLANG_EQ:
+		 return push_char_object (SLANG_CHAR_TYPE, a==b);
+		case SLANG_NE:
+		 return push_char_object (SLANG_CHAR_TYPE, a!=b);
+		case SLANG_GT:
+		 return push_char_object (SLANG_CHAR_TYPE, a>b);
+		case SLANG_GE:
+		 return push_char_object (SLANG_CHAR_TYPE, a>=b);
+		case SLANG_LT:
+		 return push_char_object (SLANG_CHAR_TYPE, a<b);
+		case SLANG_LE:
+		 return push_char_object (SLANG_CHAR_TYPE, a<=b);
+	 }
+	 return do_binary_ab (op, obja, objb);
+	 }
+#if SLANG_HAS_FLOAT
+	if (btype == SLANG_DOUBLE_TYPE)
+	 {
+	 int a;
+	 double b;
+
+	 a = obja->v.int_val; b = objb->v.double_val;
+	 switch (op)
+	 {
+		case SLANG_PLUS:
+		 return push_double_object (SLANG_DOUBLE_TYPE, a+b);
+		case SLANG_MINUS:
+		 return push_double_object (SLANG_DOUBLE_TYPE, a-b);
+		case SLANG_TIMES:
+		 return push_double_object (SLANG_DOUBLE_TYPE, a*b);
+		case SLANG_DIVIDE:
+		 return push_double_object (SLANG_DOUBLE_TYPE, a/b);
+		case SLANG_EQ:
+		 return push_char_object (SLANG_CHAR_TYPE, a==b);
+		case SLANG_NE:
+		 return push_char_object (SLANG_CHAR_TYPE, a!=b);
+		case SLANG_GT:
+		 return push_char_object (SLANG_CHAR_TYPE, a>b);
+		case SLANG_GE:
+		 return push_char_object (SLANG_CHAR_TYPE, a>=b);
+		case SLANG_LT:
+		 return push_char_object (SLANG_CHAR_TYPE, a<b);
+		case SLANG_LE:
+		 return push_char_object (SLANG_CHAR_TYPE, a<=b);
+		case SLANG_POW:
+		 return push_double_object (SLANG_DOUBLE_TYPE, pow(a, b));
+	 }
+	 return do_binary_ab (op, obja, objb);
+	 }
+#endif				 /* SLANG_HAS_FLOAT */
+ }
+#if SLANG_HAS_FLOAT
+ else if (atype == SLANG_DOUBLE_TYPE)
+ {
+	double a, b;
+
+	if (btype == SLANG_DOUBLE_TYPE)
+	 b = objb->v.double_val;
+	else if (btype == SLANG_INT_TYPE)
+	 b = (double) objb->v.int_val;
+	else
+	 goto the_hard_way;
+
+	a = obja->v.double_val;
+	switch (op)
+	 {
+	 case SLANG_PLUS:
+	 return push_double_object (SLANG_DOUBLE_TYPE, a+b);
+	 case SLANG_MINUS:
+	 return push_double_object (SLANG_DOUBLE_TYPE, a-b);
+	 case SLANG_TIMES:
+	 return push_double_object (SLANG_DOUBLE_TYPE, a*b);
+	 case SLANG_DIVIDE:
+	 return push_double_object (SLANG_DOUBLE_TYPE, a/b);
+	 case SLANG_EQ:
+	 return push_char_object (SLANG_CHAR_TYPE, a==b);
+	 case SLANG_NE:
+	 return push_char_object (SLANG_CHAR_TYPE, a!=b);
+	 case SLANG_GT:
+	 return push_char_object (SLANG_CHAR_TYPE, a>b);
+	 case SLANG_GE:
+	 return push_char_object (SLANG_CHAR_TYPE, a>=b);
+	 case SLANG_LT:
+	 return push_char_object (SLANG_CHAR_TYPE, a<b);
+	 case SLANG_LE:
+	 return push_char_object (SLANG_CHAR_TYPE, a<=b);
+	 case SLANG_POW:
+	 return push_double_object (SLANG_DOUBLE_TYPE, pow(a, b));
+	 }
+	return do_binary_ab (op, obja, objb);
+ }
+#endif				 /* SLANG_HAS_FLOAT */
+
+the_hard_way:
+
+ GET_CLASS(cl_a, atype);
+ GET_CLASS(cl_b, btype);
+ INC_REF(cl_a, atype, &obja->v, 1);
+ INC_REF(cl_b, btype, &objb->v, 1);
+ ret = do_binary_ab (op, obja, objb);
+ INC_REF(cl_a, atype, &obja->v, -1);
+ INC_REF(cl_b, btype, &objb->v, -1);
+
+ return ret;
+}
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+/* Only for SLANG_BCST_ASSIGN */
+/* _INLINE_ */
+static int do_binary_ab_inc_ref_assign (int op, SLang_Object_Type *obja, SLang_Object_Type *objb, SLang_Object_Type *objc)
+{
+ int ret;
+ SLang_Class_Type *cl, *cl_a, *cl_b;
+ int c_needs_freed;
+ SLtype atype, btype;
+
+ GET_CLASS(cl, objc->o_data_type);
+ c_needs_freed = (SLANG_CLASS_TYPE_SCALAR != cl->cl_class_type);
+
+ atype = obja->o_data_type;
+ btype = objb->o_data_type;
+
+ if (atype == SLANG_INT_TYPE)
+ {
+	if (btype == SLANG_INT_TYPE)
+	 {
+	 if (c_needs_freed)
+	 {
+		 ret = int_int_binary (op, obja, objb);
+		 goto the_return;
+	 }
+	 return int_int_binary_result (op, obja, objb, objc);
+	 }
+#if SLANG_HAS_FLOAT
+	if (btype == SLANG_DOUBLE_TYPE)
+	 {
+	 if (c_needs_freed)
+	 {
+		 ret = do_binary_ab (op, obja, objb);
+		 goto the_return;
+	 }
+	 return int_dbl_binary_result (op, obja, objb, objc);
+	 }
+#endif				 /* SLANG_HAS_FLOAT */
+ }
+#if SLANG_HAS_FLOAT
+ else if (atype == SLANG_DOUBLE_TYPE)
+ {
+	if (btype == SLANG_DOUBLE_TYPE)
+	 {
+	 if (c_needs_freed)
+	 {
+		 ret = dbl_dbl_binary (op, obja, objb);
+		 goto the_return;
+	 }
+	 return dbl_dbl_binary_result (op, obja, objb, objc);
+	 }
+
+	if (btype == SLANG_INT_TYPE)
+	 {
+	 if (c_needs_freed)
+	 {
+		 ret = do_binary_ab (op, obja, objb);
+		 goto the_return;
+	 }
+
+	 return dbl_int_binary_result (op, obja, objb, objc);
+	 }
+ }
+#endif				 /* SLANG_HAS_FLOAT */
+
+ GET_CLASS(cl_a, atype);
+ GET_CLASS(cl_b, btype);
+ INC_REF(cl_a, atype, &obja->v, 1);
+ INC_REF(cl_b, btype, &objb->v, 1);
+ ret = do_binary_ab (op, obja, objb);
+ INC_REF(cl_b, btype, &objb->v, -1);
+ INC_REF(cl_a, atype, &obja->v, -1);
+
+ the_return:
+
+ if (ret != 0)
+ return ret;
+
+ if (c_needs_freed)
+ free_object (objc, cl);
+
+ return pop_object(objc);
+}
+#endif
+
+/* _INLINE_ */
+static int do_binary (int op)
+{
+ SLang_Object_Type obja, objb, *objap, *objbp;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ SLang_Class_Type *cl;
+#endif
+ int ret;
+
+ objbp = Stack_Pointer;
+ if (Run_Stack + 2 > objbp)
+ {
+	(void) SLang_set_error (SL_STACK_UNDERFLOW);
+	SLdo_pop_n (objbp - Run_Stack);
+	return -1;
+ }
+ objbp--;
+ objap = objbp-1;
+
+ Stack_Pointer = objap;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (objbp->o_data_type == objap->o_data_type)
+ {
+	if (objbp->o_data_type == SLANG_INT_TYPE)
+	 return int_int_binary (op, objap, objbp);
+#if SLANG_HAS_FLOAT
+	if (objbp->o_data_type == SLANG_DOUBLE_TYPE)
+	 return dbl_dbl_binary (op, objap, objbp);
+#endif
+ }
+#endif
+
+ obja = *objap;
+ objb = *objbp;
+
+ ret = do_binary_ab (op, &obja, &objb);
+#if SLANG_OPTIMIZE_FOR_SPEED
+ GET_CLASS(cl, obja.o_data_type);
+ if (SLANG_CLASS_TYPE_SCALAR != cl->cl_class_type)
+ free_object (&obja, cl);
+#else
+ SLang_free_object (&obja);
+#endif
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (obja.o_data_type != objb.o_data_type)
+ {
+	GET_CLASS(cl, objb.o_data_type);
+ }
+ if (SLANG_CLASS_TYPE_SCALAR != cl->cl_class_type)
+ free_object (&objb, cl);
+#else
+ SLang_free_object (&objb);
+#endif
+
+ return ret;
+}
+
+_INLINE_
+static int do_binary_b (int op, SLang_Object_Type *bp)
+{
+ SLang_Object_Type a;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ SLang_Class_Type *cl;
+#endif
+ int ret;
+
+ if (pop_object(&a)) return -1;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (a.o_data_type == bp->o_data_type)
+ {
+	if (a.o_data_type == SLANG_INT_TYPE)
+	 return int_int_binary (op, &a, bp);
+
+#if SLANG_HAS_FLOAT
+	if (a.o_data_type == SLANG_DOUBLE_TYPE)
+	 return dbl_dbl_binary (op, &a, bp);
+#endif
+ }
+#endif
+ ret = do_binary_ab (op, &a, bp);
+#if SLANG_OPTIMIZE_FOR_SPEED
+ GET_CLASS(cl, a.o_data_type);
+ if (SLANG_CLASS_TYPE_SCALAR != cl->cl_class_type)
+ free_object (&a, cl);
+#else
+ SLang_free_object (&a);
+#endif
+ return ret;
+}
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+/* _INLINE_ */
+static void do_binary_b_inc_ref (int op, SLang_Object_Type *objbp)
+{
+ SLang_Object_Type obja;
+ SLang_Class_Type *cl_a, *cl_b;
+ SLang_Object_Type *objap;
+ SLtype atype, btype;
+
+ btype = objbp->o_data_type;
+
+ if (btype == SLANG_INT_TYPE)
+ {
+	if (Stack_Pointer == Run_Stack)
+	 {
+	 (void) SLang_set_error (SL_STACK_UNDERFLOW);
+	 return;
+	 }
+	objap = (Stack_Pointer-1);
+	atype = objap->o_data_type;
+
+	if (atype == SLANG_INT_TYPE)
+	 {
+	 int a, b;
+
+	 a = objap->v.int_val; b = objbp->v.int_val;
+	 switch (op)
+	 {
+		case SLANG_PLUS:
+		 objap->v.int_val = a + b; return;
+		case SLANG_MINUS:
+		 objap->v.int_val = a - b; return;
+		case SLANG_TIMES:
+		 objap->v.int_val = a * b; return;
+		case SLANG_EQ:
+		 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a == b); return;
+		case SLANG_NE:
+		 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a != b); return;
+		case SLANG_GT:
+		 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a > b); return;
+		case SLANG_GE:
+		 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a >= b); return;
+		case SLANG_LT:
+		 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a < b); return;
+		case SLANG_LE:
+		 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a <= b); return;
+	 }
+	 (void) pop_object (&obja);
+	 do_binary_ab (op, &obja, objbp);
+	 return;
+	 }
+#if SLANG_HAS_FLOAT
+	if (atype == SLANG_DOUBLE_TYPE)
+	 {
+	 double a;
+	 int b;
+
+	 a = objap->v.double_val; b = objbp->v.int_val;
+	 switch (op)
+	 {
+		case SLANG_PLUS:
+		 objap->v.double_val = a + b; return;
+		case SLANG_MINUS:
+		 objap->v.double_val = a - b; return;
+		case SLANG_TIMES:
+		 objap->v.double_val = a * b; return;
+		case SLANG_DIVIDE:
+		 objap->v.double_val = a / b; return;
+		case SLANG_EQ:
+		 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a == b); return;
+		case SLANG_NE:
+		 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a != b); return;
+		case SLANG_GT:
+		 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a > b); return;
+		case SLANG_GE:
+		 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a >= b); return;
+		case SLANG_LT:
+		 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a < b); return;
+		case SLANG_LE:
+		 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a <= b); return;
+		case SLANG_POW:
+		 objap->v.double_val = pow(a,b); return;
+	 }
+	 (void) pop_object (&obja);
+	 do_binary_ab (op, &obja, objbp);
+	 return;
+	 }
+#endif				 /* SLANG_HAS_FLOAT */
+ }
+#if SLANG_HAS_FLOAT
+ else if (btype == SLANG_DOUBLE_TYPE)
+ {
+	double a, b;
+
+	if (Stack_Pointer == Run_Stack)
+	 {
+	 (void) SLang_set_error (SL_STACK_UNDERFLOW);
+	 return;
+	 }
+	objap = (Stack_Pointer-1);
+	atype = objap->o_data_type;
+
+	if (atype == SLANG_DOUBLE_TYPE)
+	 a = objap->v.double_val;
+	else if (atype == SLANG_INT_TYPE)
+	 a = (double) objap->v.int_val;
+	else
+	 goto the_hard_way;
+
+	b = objbp->v.double_val;
+	switch (op)
+	 {
+	 case SLANG_PLUS:
+	 objap->o_data_type = SLANG_DOUBLE_TYPE; objap->v.double_val = a + b; return;
+	 case SLANG_MINUS:
+	 objap->o_data_type = SLANG_DOUBLE_TYPE; objap->v.double_val = a - b; return;
+	 case SLANG_TIMES:
+	 objap->o_data_type = SLANG_DOUBLE_TYPE; objap->v.double_val = a * b; return;
+	 case SLANG_DIVIDE:
+	 objap->o_data_type = SLANG_DOUBLE_TYPE; objap->v.double_val = a / b; return;
+	 case SLANG_EQ:
+	 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a == b); return;
+	 case SLANG_NE:
+	 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a != b); return;
+	 case SLANG_GT:
+	 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a > b); return;
+	 case SLANG_GE:
+	 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a >= b); return;
+	 case SLANG_LT:
+	 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a < b); return;
+	 case SLANG_LE:
+	 objap->o_data_type = SLANG_CHAR_TYPE; objap->v.char_val = (a <= b); return;
+	 case SLANG_POW:
+	 objap->o_data_type = SLANG_DOUBLE_TYPE; objap->v.double_val = pow(a,b); return;
+	 }
+	(void) pop_object (&obja);
+	do_binary_ab (op, &obja, objbp);
+	return;
+ }
+#endif				 /* SLANG_HAS_FLOAT */
+
+the_hard_way:
+
+ if (-1 == pop_object (&obja))
+ return;
+
+ GET_CLASS(cl_a, obja.o_data_type);
+ GET_CLASS(cl_b, btype);
+
+ INC_REF(cl_b, btype, &objbp->v, 1);
+ (void) do_binary_ab (op, &obja, objbp);
+ INC_REF(cl_b, btype, &objbp->v, -1);
+
+ if (SLANG_CLASS_TYPE_SCALAR != cl_a->cl_class_type)
+ free_object (&obja, cl_a);
+}
+#endif
+
+static int do_unary_op (int op, SLang_Object_Type *obj, int unary_type)
+{
+ int (*f) (int, SLtype, VOID_STAR, SLuindex_Type, VOID_STAR);
+ VOID_STAR pa;
+ VOID_STAR pb;
+ SLang_Class_Type *a_cl, *b_cl;
+ SLtype a_type, b_type;
+ int ret;
+
+ a_type = obj->o_data_type;
+ GET_CLASS (a_cl, a_type);
+
+ if (NULL == (f = _pSLclass_get_unary_fun (op, a_cl, &b_cl, unary_type)))
+ return -1;
+
+ b_type = b_cl->cl_data_type;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (SLANG_CLASS_TYPE_VECTOR == a_cl->cl_class_type)
+ pa = (VOID_STAR) obj->v.ptr_val;
+ else
+ pa = (VOID_STAR) &obj->v;
+#else
+ pa = _pSLclass_get_ptr_to_value (a_cl, obj);
+#endif
+ pb = b_cl->cl_transfer_buf;
+
+ if (1 != (*f) (op, a_type, pa, 1, pb))
+ {
+	_pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "Unary operation/function for %s failed", a_cl->cl_name);
+	return -1;
+ }
+
+ ret = (*b_cl->cl_apush)(b_type, pb);
+ /* cl_apush creates a copy, so make sure we call cl_adestroy */
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if ((SLANG_CLASS_TYPE_SCALAR != b_cl->cl_class_type)
+ && (SLANG_CLASS_TYPE_VECTOR != b_cl->cl_class_type))
+#endif
+ (*b_cl->cl_adestroy)(b_type, pb);
+
+ return ret;
+}
+
+_INLINE_
+static int do_unary (int op, int unary_type)
+{
+ SLang_Object_Type obj;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ SLang_Class_Type *cl;
+#endif
+ int ret;
+
+ if (-1 == pop_object(&obj)) return -1;
+ ret = do_unary_op (op, &obj, unary_type);
+#if SLANG_OPTIMIZE_FOR_SPEED
+ GET_CLASS(cl, obj.o_data_type);
+ if (SLANG_CLASS_TYPE_SCALAR != cl->cl_data_type)
+ free_object (&obj, cl);
+#else
+ SLang_free_object (&obj);
+#endif
+ return ret;
+}
+
+static int do_assignment_binary (int op, SLang_Object_Type *obja_ptr)
+{
+ SLang_Object_Type objb;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ SLtype btype;
+ SLang_Class_Type *cl;
+#endif
+ int ret;
+
+ if (pop_object(&objb))
+ return -1;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ btype = objb.o_data_type;
+#endif
+
+#if 0 && SLANG_OPTIMIZE_FOR_SPEED
+ if (op == SLANG_PLUS)
+ {
+	if (obja_ptr->o_data_type == SLANG_BSTRING_TYPE)
+	 {
+	 if (btype == SLANG_BSTRING_TYPE)
+	 {
+		 ret = _pSLbstring_concat_bstr (obja_ptr, (SLang_BString_Type*)objb.v.ptr_val);
+		 SLbstring_free ((SLang_BString_Type *) objb.v.ptr_val);
+		 return ret;
+	 }
+	 if (btype == SLANG_STRING_TYPE)
+	 {
+		 ret = _pSLbstring_concat_str (obja_ptr, objb.v.s_val);
+		 _pSLang_free_slstring (objb.v.s_val);
+		 return ret;
+	 }
+	 }
+ }
+#endif
+
+ ret = do_binary_ab (op, obja_ptr, &objb);
+#if SLANG_OPTIMIZE_FOR_SPEED
+ GET_CLASS(cl, btype);
+ if (SLANG_CLASS_TYPE_SCALAR != cl->cl_class_type)
+ free_object (&objb, cl);
+#else
+ SLang_free_object (&objb);
+#endif
+ return ret;
+}
+
+/* The order of these is assumed to match the binary operators
+ * defined in slang.h
+ */
+static int
+map_assignment_op_to_binary (int op_type, int *op, int *is_unary)
+{
+ *is_unary = 0;
+ switch (op_type)
+ {
+ case SLANG_BCST_PLUSEQS:
+ case SLANG_BCST_MINUSEQS:
+ case SLANG_BCST_TIMESEQS:
+ case SLANG_BCST_DIVEQS:
+	*op = SLANG_PLUS + (op_type - SLANG_BCST_PLUSEQS);
+	break;
+
+ case SLANG_BCST_BOREQS:
+	*op = SLANG_BOR;
+	break;
+
+ case SLANG_BCST_BANDEQS:
+	*op = SLANG_BAND;
+	break;
+
+ case SLANG_BCST_POST_MINUSMINUS:
+ case SLANG_BCST_MINUSMINUS:
+	*op = SLANG_MINUS;
+	*is_unary = 1;
+	break;
+
+ case SLANG_BCST_PLUSPLUS:
+ case SLANG_BCST_POST_PLUSPLUS:
+	*op = SLANG_PLUS;
+	*is_unary = 1;
+	break;
+
+ default:
+	_pSLang_verror (SL_NOT_IMPLEMENTED, "Assignment operator not implemented");
+	return -1;
+ }
+ return 0;
+}
+
+static int
+perform_lvalue_operation (int op_type, SLang_Object_Type *obja_ptr)
+{
+ switch (op_type)
+ {
+ case SLANG_BCST_ASSIGN:
+	break;
+
+	/* The order of these is assumed to match the binary operators
+	 * defined in slang.h
+	 */
+ case SLANG_BCST_PLUSEQS:
+ case SLANG_BCST_MINUSEQS:
+ case SLANG_BCST_TIMESEQS:
+ case SLANG_BCST_DIVEQS:
+	if (-1 == do_assignment_binary (SLANG_PLUS + (op_type - SLANG_BCST_PLUSEQS), obja_ptr))
+	 return -1;
+	break;
+
+ case SLANG_BCST_BOREQS:
+	if (-1 == do_assignment_binary (SLANG_BOR, obja_ptr))
+	 return -1;
+	break;
+
+ case SLANG_BCST_BANDEQS:
+	if (-1 == do_assignment_binary (SLANG_BAND, obja_ptr))
+	 return -1;
+	break;
+
+ case SLANG_BCST_PLUSPLUS:
+ case SLANG_BCST_POST_PLUSPLUS:
+#if SLANG_OPTIMIZE_FOR_SPEED
+	if (obja_ptr->o_data_type == SLANG_INT_TYPE)
+	 return push_int_object (SLANG_INT_TYPE, obja_ptr->v.int_val + 1);
+#endif
+	if (-1 == do_unary_op (SLANG_PLUSPLUS, obja_ptr, SLANG_BC_UNARY))
+	 return -1;
+	break;
+
+ case SLANG_BCST_MINUSMINUS:
+ case SLANG_BCST_POST_MINUSMINUS:
+#if SLANG_OPTIMIZE_FOR_SPEED
+	if (obja_ptr->o_data_type == SLANG_INT_TYPE)
+	 return push_int_object (SLANG_INT_TYPE, obja_ptr->v.int_val - 1);
+#endif
+	if (-1 == do_unary_op (SLANG_MINUSMINUS, obja_ptr, SLANG_BC_UNARY))
+	 return -1;
+	break;
+
+ default:
+	(void) SLang_set_error (SL_INTERNAL_ERROR);
+	return -1;
+ }
+ return 0;
+}
+
+_INLINE_
+static int
+set_lvalue_obj (int op_type, SLang_Object_Type *obja_ptr)
+{
+#if SLANG_OPTIMIZE_FOR_SPEED
+ SLang_Class_Type *cl;
+#endif
+ if (op_type != SLANG_BCST_ASSIGN)
+ {
+	if (-1 == perform_lvalue_operation (op_type, obja_ptr))
+	 return -1;
+ }
+#if SLANG_OPTIMIZE_FOR_SPEED
+ GET_CLASS(cl, obja_ptr->o_data_type);
+ if (SLANG_CLASS_TYPE_SCALAR != cl->cl_class_type)
+ free_object (obja_ptr, cl);
+#else
+ SLang_free_object (obja_ptr);
+#endif
+
+ return pop_object(obja_ptr);
+}
+
+/* a = b; a += b; ... */
+_INLINE_
+static int
+set_lvalue_obj_with_obj (int op_type, SLang_Object_Type *obja_ptr, SLang_Object_Type *objb_ptr)
+{
+ SLang_Class_Type *cl;
+
+ if (op_type != SLANG_BCST_ASSIGN)
+ {
+	if (-1 == _pSLpush_slang_obj (objb_ptr))
+	 return -1;
+	if (-1 == perform_lvalue_operation (op_type, obja_ptr))
+	 return -1;
+
+	goto pop_method;
+ }
+
+ if (SLANG_CLASS_TYPE_SCALAR == GET_CLASS_TYPE(objb_ptr->o_data_type))
+ {
+	/* We can copy b to a */
+#if SLANG_OPTIMIZE_FOR_SPEED
+	GET_CLASS(cl, obja_ptr->o_data_type);
+	if (SLANG_CLASS_TYPE_SCALAR != cl->cl_class_type)
+	 free_object (obja_ptr, cl);
+#else
+	SLang_free_object (obja_ptr);
+#endif
+	*obja_ptr = *objb_ptr;
+	return 0;
+ }
+
+ /* a and b could refer to the same object. So push b first before freeing a */
+
+ GET_CLASS(cl, objb_ptr->o_data_type);
+ if (-1 == (*cl->cl_push)(objb_ptr->o_data_type, (VOID_STAR)&objb_ptr->v))
+ return -1;
+
+pop_method:
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ GET_CLASS(cl, obja_ptr->o_data_type);
+ if (SLANG_CLASS_TYPE_SCALAR != cl->cl_class_type)
+ free_object (obja_ptr, cl);
+#else
+ SLang_free_object (obja_ptr);
+#endif
+
+ return pop_object(obja_ptr);
+}
+
+/* A.x = stackobj; A.x += stackobj, etc... */
+static int
+set_struct_obj_lvalue (SLBlock_Type *bc_blk, SLang_Object_Type *objA, int do_free)
+{
+ SLtype type;
+ SLang_Class_Type *cl;
+ SLFUTURE_CONST char *name;
+ int op, ret;
+
+ type = objA->o_data_type;
+
+ GET_CLASS(cl,type);
+ if ((cl->cl_sput == NULL)
+ || (cl->cl_sget == NULL))
+ {
+	_pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "%s does not support structure access",
+		 cl->cl_name);
+	if (do_free)
+	 free_object (objA, cl);
+	return -1;
+ }
+ name = bc_blk->b.s_blk;
+ op = bc_blk->bc_sub_type;
+
+ if (op != SLANG_BCST_ASSIGN)
+ {
+	/* We have something like (A.x += b) or (A.x++). In either case,
+	 * we need A.x.
+	 */
+	SLang_Object_Type obj;
+#if SLANG_USE_TMP_OPTIMIZATION
+	SLang_Class_Type *cl_obj;
+#endif
+	if (cl->is_struct)
+	 {
+	 if ((-1 == _pSLstruct_push_field (objA->v.struct_val, name, 0))
+		 || (-1 == pop_object(&obj)))
+	 {
+		 if (do_free) free_object (objA, cl);
+		 return -1;
+	 }
+	 }
+	else if ((-1 == _pSLpush_slang_obj (objA))
+		 || (-1 == cl->cl_sget ((SLtype) type, name))
+		 || (-1 == pop_object(&obj)))
+	 {
+	 if (do_free) free_object (objA, cl);
+	 return -1;
+	 }
+
+	/* Now the value of A.x is in obj. */
+#if SLANG_USE_TMP_OPTIMIZATION
+	/*
+	 * It has at least 2 references: A.x and obj. Decrement its reference
+	 * to allow for the possibility of __tmp optimization.
+	 */
+	GET_CLASS(cl_obj,obj.o_data_type);
+	INC_REF(cl_obj, obj.o_data_type, &obj.v, -1);
+#endif
+	ret = perform_lvalue_operation (op, &obj);
+#if SLANG_USE_TMP_OPTIMIZATION
+	INC_REF(cl_obj, obj.o_data_type, &obj.v, 1);
+#endif
+	if (ret == -1)
+	 {
+	 SLang_free_object (&obj);
+	 if (do_free) free_object (objA, cl);
+	 return -1;
+	 }
+#if SLANG_USE_TMP_OPTIMIZATION
+	free_object (&obj, cl_obj);
+#endif
+ }
+
+ /* The result of the operation is now on the stack.
+ * Perform assignment
+ */
+ if (cl->is_struct)
+ {
+	ret = _pSLstruct_pop_field (objA->v.struct_val, name, 0);
+	if (do_free) free_object (objA, cl);
+	return ret;
+ }
+
+ if (-1 == _pSLpush_slang_obj (objA))
+ {
+	if (do_free) free_object (objA, cl);
+	return -1;
+ }
+
+ ret = (*cl->cl_sput) ((SLtype) type, name);
+ if (do_free) free_object (objA, cl);
+ return ret;
+}
+
+/* A.x = stack, A.x += stack, ... A is also on the stack. */
+static int set_struct_lvalue (SLBlock_Type *bc_blk)
+{
+ SLang_Object_Type objA;
+
+ if (-1 == pop_object (&objA))
+ return -1;
+
+ return set_struct_obj_lvalue (bc_blk, &objA, 1);
+}
+
+/* handle: @x op y
+ * @x++, @x--
+ */
+static int set_deref_lvalue (int op)
+{
+ int ret;
+ SLang_Object_Type x;
+ SLang_Ref_Type *ref;
+
+ if (-1 == SLang_pop_ref (&ref))
+ return -1;
+
+ if (op == SLANG_BCST_ASSIGN)
+ {
+	ret = _pSLang_deref_assign (ref);
+	SLang_free_ref (ref);
+	return ret;
+ }
+
+ ret = -1;
+ if ((0 == _pSLang_dereference_ref (ref))
+ && (0 == pop_object(&x)))
+ {
+	if (0 == perform_lvalue_operation (op, &x))
+	 ret = _pSLang_deref_assign (ref);
+
+	SLang_free_object (&x);
+ }
+
+ SLang_free_ref (ref);
+ return ret;
+}
+
+static int make_unit_object (SLang_Object_Type *a, SLang_Object_Type *u)
+{
+ SLtype type;
+
+ type = a->o_data_type;
+ if (type == SLANG_ARRAY_TYPE)
+ type = a->v.array_val->data_type;
+
+ u->o_data_type = type;
+ switch (type)
+ {
+ case SLANG_UCHAR_TYPE:
+ case SLANG_CHAR_TYPE:
+	u->v.char_val = 1;
+	break;
+
+ case SLANG_SHORT_TYPE:
+ case SLANG_USHORT_TYPE:
+	u->v.short_val = 1;
+	break;
+
+ case SLANG_LONG_TYPE:
+ case SLANG_ULONG_TYPE:
+	u->v.long_val = 1;
+	break;
+
+#if SLANG_HAS_FLOAT
+ case SLANG_FLOAT_TYPE:
+	u->v.float_val = 1;
+	break;
+
+ case SLANG_COMPLEX_TYPE:
+	u->o_data_type = SLANG_DOUBLE_TYPE;
+ case SLANG_DOUBLE_TYPE:
+	u->v.double_val = 1;
+	break;
+#endif
+ default:
+	u->o_data_type = SLANG_INT_TYPE;
+	u->v.int_val = 1;
+ }
+ return 0;
+}
+
+/* We want to convert 'Ai op X' to 'Ai = Ai op X'. The code that
+ * has been generated is: X __args i A __aput-op
+ * where __aput-op represents this function. We need to generate:
+ * __args i A __eargs __aget X op __args i A __eargs __aput
+ * Here, __eargs implies a call to do_bc_call_direct_nargs with either
+ * the aput or aget function. In addition, __args represents a call to
+ * start_arg_list. Of course, i represents a set of indices.
+ *
+ * Note: If op is an unary operation (e.g., ++ or --), then X will not
+ * be present an will have to be taken to be 1.
+ *
+ * Implementation note: For efficiency, calls to setup the frame, start
+ * arg list will be omitted and SLang_Num_Function_Args will be set.
+ * This is ugly but the alternative is much less efficient rendering these
+ * assignment operators useless. So, the plan is to roll the stack to get X,
+ * then duplicate the next N values, call __aget followed by op X, finally
+ * calling __aput. Hence, the sequence is:
+ *
+ * start: X i .. j A
+ * dupN: X i .. j A i .. j A
+ * __aget: X i .. j A Y
+ * roll: i .. j A Y X
+ * op: i .. j A Z
+ * roll: Z i .. j A
+ * __aput:
+ */
+static int
+set_array_lvalue (int op)
+{
+ SLang_Object_Type x, y;
+ int is_unary;
+ int status;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ int class_type;
+ SLang_Class_Type *cl;
+#endif
+ int num_args;
+
+ if (-1 == map_assignment_op_to_binary (op, &op, &is_unary))
+ return -1;
+
+ /* Grab the indices and the array. Do not start a new frame. */
+ if (-1 == end_arg_list ())
+ return -1;
+ if ((num_args = Next_Function_Num_Args) <= 0)
+ {
+	SLang_verror (SL_INTERNAL_ERROR, "set_array_lvalue: Next_Function_Num_Args<=0");
+	return -1;
+ }
+ Next_Function_Num_Args = 0;
+
+ if (is_unary)		 /* PLUSPLUS, MINUSMINUS */
+ {
+	int type = peek_at_stack ();
+	if (type == SLANG_ASSOC_TYPE)
+	 {
+	 return _pSLassoc_inc_value (num_args-1,
+					 (op == SLANG_PLUS) ? +1 : -1);
+	 }
+ }
+
+ if (-1 == SLdup_n (num_args))
+ return -1;
+
+ if (-1 == _pSLarray_aget1 (num_args-1))
+ return -1;
+
+ if (-1 == pop_object(&y))
+ return -1;
+
+ if (is_unary == 0)
+ {
+	if ((-1 == roll_stack (-(num_args + 1)))
+	 || (-1 == pop_object(&x)))
+	 {
+	 SLang_free_object (&y);
+	 return -1;
+	 }
+ }
+ else if (-1 == make_unit_object (&y, &x))
+ {
+	SLang_free_object (&y);
+	return -1;
+ }
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (x.o_data_type == y.o_data_type)
+ {
+	if (x.o_data_type == SLANG_INT_TYPE)
+	 status = int_int_binary (op, &y, &x);
+#if SLANG_HAS_FLOAT
+	else if (x.o_data_type == SLANG_DOUBLE_TYPE)
+	 status = dbl_dbl_binary (op, &y, &x);
+#endif
+	else status = do_binary_ab (op, &y, &x);
+ }
+ else
+#endif
+ status = do_binary_ab (op, &y, &x);
+
+ if (status != 0)
+ {
+	SLang_free_object (&y);
+	SLang_free_object (&x);
+	return -1;
+ }
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ GET_CLASS(cl, y.o_data_type);
+ class_type = cl->cl_class_type;
+ if (SLANG_CLASS_TYPE_SCALAR != class_type)
+ free_object (&y, cl);
+#else
+ SLang_free_object (&y);
+#endif
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (cl->cl_data_type != x.o_data_type)
+ {
+	GET_CLASS(cl, x.o_data_type);
+	class_type = cl->cl_class_type;
+ }
+ if (SLANG_CLASS_TYPE_SCALAR != class_type)
+ free_object (&x, cl);
+#else
+ SLang_free_object (&x);
+#endif
+
+ if (-1 == roll_stack (num_args + 1))
+ return -1;
+
+ return _pSLarray_aput1 (num_args-1);
+}
+
+static int
+set_intrin_lvalue (SLBlock_Type *bc_blk)
+{
+ int op_type;
+ SLang_Object_Type obja;
+ SLang_Class_Type *cl;
+ SLang_Intrin_Var_Type *ivar;
+ VOID_STAR intrinsic_addr;
+ SLtype intrinsic_type;
+
+ ivar = bc_blk->b.nt_ivar_blk;
+
+ intrinsic_type = ivar->type;
+ intrinsic_addr = ivar->addr;
+
+ op_type = bc_blk->bc_sub_type;
+
+ GET_CLASS(cl, intrinsic_type);
+
+ if (op_type != SLANG_BCST_ASSIGN)
+ {
+	/* We want to get the current value into obja. This is the
+	 * easiest way.
+	 */
+	if ((-1 == (*cl->cl_push) (intrinsic_type, intrinsic_addr))
+	 || (-1 == pop_object(&obja)))
+	 return -1;
+
+	(void) perform_lvalue_operation (op_type, &obja);
+	SLang_free_object (&obja);
+
+	if (IS_SLANG_ERROR)
+	 return -1;
+ }
+
+ return (*cl->cl_pop) (intrinsic_type, intrinsic_addr);
+}
+
+static int push_intrinsic_variable (SLang_Intrin_Var_Type *ivar)
+{
+ SLang_Class_Type *cl;
+ SLtype stype;
+
+ stype = ivar->type;
+ GET_CLASS(cl,stype);
+
+ if (-1 == (*cl->cl_push_intrinsic) (stype, ivar->addr))
+ {
+	do_name_type_error ((SLang_Name_Type *) ivar);
+	return -1;
+ }
+ return 0;
+}
+
+static int push_nametype_variable (SLang_Name_Type *nt)
+{
+ switch (nt->name_type)
+ {
+ case SLANG_PVARIABLE:
+ case SLANG_GVARIABLE:
+	return _pSLpush_slang_obj (&((SLang_Global_Var_Type *)nt)->obj);
+
+ case SLANG_IVARIABLE:
+ case SLANG_RVARIABLE:
+	return push_intrinsic_variable ((SLang_Intrin_Var_Type *)nt);
+
+ case SLANG_HCONSTANT:
+	return SLclass_push_short_obj (((SLang_HConstant_Type *)nt)->data_type, ((SLang_HConstant_Type*)nt)->value);
+ case SLANG_ICONSTANT:
+	return push_int_object (((SLang_IConstant_Type *)nt)->data_type, ((SLang_IConstant_Type*)nt)->value);
+ case SLANG_LCONSTANT:
+	return SLclass_push_long_obj (((SLang_LConstant_Type *)nt)->data_type, ((SLang_LConstant_Type*)nt)->value);
+
+#if SLANG_HAS_FLOAT
+ case SLANG_DCONSTANT:
+	return push_double_object (SLANG_DOUBLE_TYPE, ((SLang_DConstant_Type*)nt)->d);
+ case SLANG_FCONSTANT:
+	return SLclass_push_float_obj (SLANG_FLOAT_TYPE, ((SLang_FConstant_Type*)nt)->f);
+#endif
+#ifdef HAVE_LONG_LONG
+ case SLANG_LLCONSTANT:
+	return SLclass_push_llong_obj (SLANG_LLONG_TYPE, ((SLang_LLConstant_Type*)nt)->ll);
+#endif
+ }
+ _pSLang_verror (SL_TYPE_MISMATCH, "Symbol %s is not a variable", nt->name);
+ return -1;
+}
+
+static int set_nametype_variable (SLang_Name_Type *nt)
+{
+ SLBlock_Type blk;
+
+ switch (nt->name_type)
+ {
+ case SLANG_GVARIABLE:
+ case SLANG_PVARIABLE:
+	if (-1 == set_lvalue_obj (SLANG_BCST_ASSIGN,
+				 &((SLang_Global_Var_Type *)nt)->obj))
+	 {
+	 do_name_type_error (nt);
+	 return -1;
+	 }
+	break;
+
+ case SLANG_IVARIABLE:
+	blk.b.nt_blk = nt;
+	blk.bc_sub_type = SLANG_BCST_ASSIGN;
+	if (-1 == set_intrin_lvalue (&blk))
+	 {
+	 do_name_type_error (nt);
+	 return -1;
+	 }
+	break;
+
+ case SLANG_LVARIABLE:
+	(void) SLang_set_error (SL_INTERNAL_ERROR);
+	return -1;
+
+ case SLANG_RVARIABLE:
+ default:
+	_pSLang_verror (SL_READONLY_ERROR, "%s is read-only", nt->name);
+	return -1;
+ }
+
+ return 0;
+}
+
+/* References to Nametype objects */
+static char *nt_ref_string (VOID_STAR vdata)
+{
+ SLang_NameSpace_Type *ns;
+ SLang_Name_Type *nt = *(SLang_Name_Type **)vdata;
+ SLCONST char *name;
+ SLstrlen_Type len;
+ char *s;
+
+ ns = _pSLns_find_object_namespace (nt);
+ if (ns == NULL)
+ return NULL;
+
+ name = nt->name;
+ len = strlen (name);
+
+ if ((ns->namespace_name != NULL)
+ && (0 != strcmp (ns->namespace_name, "Global")))
+ {
+	SLstrlen_Type dlen = strlen (ns->namespace_name);
+	s = (char *)SLmalloc (len + dlen + 4);
+	if (s == NULL)
+	 return NULL;
+	(void) sprintf (s, "&%s->%s", ns->namespace_name, name);
+	return s;
+ }
+
+ if (NULL == (s = (char *)SLmalloc (len + 2)))
+ return NULL;
+
+ *s = '&';
+ strcpy (s + 1, name);
+ return s;
+}
+
+static void nt_ref_destroy (VOID_STAR vdata)
+{
+ /* SLang_free_function ((SLang_Name_Type *)nt) -- someday */
+ (void) vdata;
+}
+
+static int nt_ref_deref_assign (VOID_STAR vdata)
+{
+ return set_nametype_variable (*(SLang_Name_Type **) vdata);
+}
+
+static int inner_interp_nametype (SLang_Name_Type *, int);
+static int nt_ref_deref (VOID_STAR vdata)
+{
+ (void) inner_interp_nametype (*(SLang_Name_Type **)vdata, 0);
+ return 0;
+}
+
+static int nt_ref_is_initialized (VOID_STAR v)
+{
+ SLang_Name_Type *nt = *(SLang_Name_Type **)v;
+
+ if ((nt->name_type != SLANG_GVARIABLE)
+ && (nt->name_type != SLANG_PVARIABLE))
+ return 1;
+
+ return ((SLang_Global_Var_Type *)nt)->obj.o_data_type != SLANG_UNDEFINED_TYPE;
+}
+
+static int nt_ref_uninitialize (VOID_STAR v)
+{
+ SLang_Name_Type *nt = *(SLang_Name_Type **)v;
+ SLang_Object_Type *obj;
+
+ if ((nt->name_type != SLANG_GVARIABLE)
+ && (nt->name_type != SLANG_PVARIABLE))
+ return -1;
+
+ obj = &((SLang_Global_Var_Type *)nt)->obj;
+ SLang_free_object (obj);
+ obj->o_data_type = SLANG_UNDEFINED_TYPE;
+ obj->v.ptr_val = NULL;
+ return 0;
+}
+
+static SLang_Ref_Type *create_ref_to_nametype (SLang_Name_Type *nt)
+{
+ SLang_Ref_Type *ref;
+
+ if (NULL == (ref = _pSLang_new_ref (sizeof (SLang_Name_Type *))))
+ return NULL;
+
+ ref->data_is_nametype = 1;
+ *(SLang_Name_Type **)ref->data = nt;
+ ref->destroy = nt_ref_destroy;
+ ref->string = nt_ref_string;
+ ref->deref = nt_ref_deref;
+ ref->deref_assign = nt_ref_deref_assign;
+ ref->is_initialized = nt_ref_is_initialized;
+ ref->uninitialize = nt_ref_uninitialize;
+ return ref;
+}
+
+int SLang_assign_nametype_to_ref (SLang_Ref_Type *ref, SLang_Name_Type *nt)
+{
+ SLang_Ref_Type *r;
+
+ if ((nt == NULL) || (ref == NULL))
+ return -1;
+
+ if (NULL == (r = create_ref_to_nametype (nt)))
+ return -1;
+
+ if (-1 == SLang_assign_to_ref (ref, SLANG_REF_TYPE, (VOID_STAR) &r))
+ {
+	SLang_free_ref (r);
+	return -1;
+ }
+ SLang_free_ref (r);
+ return 0;
+}
+
+/* Note: This is ok if nt is NULL. Some routines rely on this behavior */
+int _pSLang_push_nt_as_ref (SLang_Name_Type *nt)
+{
+ SLang_Ref_Type *r;
+ int ret;
+
+ if (nt == NULL)
+ return SLang_push_null ();
+
+ r = create_ref_to_nametype (nt);
+ if (r == NULL) return -1;
+
+ ret = SLang_push_ref (r);
+ SLang_free_ref (r);
+ return ret;
+}
+
+/* Local variable references */
+static SLang_Object_Type *lv_ref_check_object (VOID_STAR vdata)
+{
+ SLang_Object_Type *obj = *(SLang_Object_Type **)vdata;
+
+ if (obj > Local_Variable_Frame)
+ {
+	_pSLang_verror (SL_UNDEFINED_NAME, "Local variable reference is out of scope");
+	return NULL;
+ }
+ return obj;
+}
+
+static int lv_ref_deref (VOID_STAR vdata)
+{
+ SLang_Object_Type *obj = lv_ref_check_object (vdata);
+ if (obj == NULL)
+ return -1;
+ return _pSLpush_slang_obj (obj);
+}
+
+static int lv_ref_deref_assign (VOID_STAR vdata)
+{
+ SLang_Object_Type *objp = lv_ref_check_object (vdata);
+ if (objp == NULL)
+ return -1;
+ return set_lvalue_obj (SLANG_BCST_ASSIGN, objp);
+}
+
+static void lv_ref_destroy (VOID_STAR vdata)
+{
+ (void)vdata;
+}
+
+static char *lv_ref_string (VOID_STAR vdata)
+{
+ (void) vdata;
+ return SLmake_string ("Local variable reference");
+}
+
+static int lv_ref_is_initialized (VOID_STAR v)
+{
+ SLang_Object_Type *objp = lv_ref_check_object (v);
+ if (objp == NULL)
+ return -1;
+
+ return objp->o_data_type != SLANG_UNDEFINED_TYPE;
+}
+
+static int lv_ref_uninitialize (VOID_STAR v)
+{
+ SLang_Object_Type *obj = lv_ref_check_object (v);
+ if (obj == NULL)
+ return -1;
+
+ SLang_free_object (obj);
+ obj->o_data_type = SLANG_UNDEFINED_TYPE;
+ obj->v.ptr_val = NULL;
+ return 0;
+}
+
+static SLang_Ref_Type *lv_new_ref (SLang_Object_Type *objp)
+{
+ SLang_Ref_Type *ref;
+
+ if (NULL == (ref = _pSLang_new_ref (sizeof (SLang_Object_Type *))))
+ return NULL;
+ *(SLang_Object_Type **)ref->data = objp;
+ ref->destroy = lv_ref_destroy;
+ ref->string = lv_ref_string;
+ ref->deref = lv_ref_deref;
+ ref->deref_assign = lv_ref_deref_assign;
+ ref->is_initialized = lv_ref_is_initialized;
+ ref->uninitialize = lv_ref_uninitialize;
+ return ref;
+}
+
+static int push_lv_as_ref (SLang_Object_Type *objp)
+{
+ int ret;
+ SLang_Ref_Type *ref = lv_new_ref (objp);
+
+ if (ref == NULL)
+ return -1;
+
+ ret = SLang_push_ref (ref);
+ SLang_free_ref (ref);
+ return ret;
+}
+
+#if 0
+static void set_deref_lvalue (SLBlock_Type *bc_blk)
+{
+ SLang_Object_Type *objp;
+ SLang_Ref_Type *ref;
+
+ switch (bc_blk->bc_sub_type)
+ {
+ case SLANG_LVARIABLE:
+	objp = (Local_Variable_Frame - bc_blk->b.i_blk);
+	break;
+ case SLANG_GVARIABLE:
+ case SLANG_PVARIABLE:
+	objp = &bc_blk->b.nt_gvar_blk->obj;
+	break;
+ default:
+	(void) SLang_set_error (SL_INTERNAL_ERROR);
+	return;
+ }
+
+ if (-1 == _pSLpush_slang_obj (objp))
+ return;
+
+ if (-1 == SLang_pop_ref (&ref))
+ return;
+ (void) _pSLang_deref_assign (ref);
+ SLang_free_ref (ref);
+}
+#endif
+
+static int push_struct_field (SLFUTURE_CONST char *name)
+{
+ SLang_Class_Type *cl;
+ SLang_Object_Type obj;
+ SLtype type;
+
+ if (-1 == pop_object (&obj))
+ return -1;
+
+ if (SLANG_STRUCT_TYPE == (type = obj.o_data_type))
+ return _pSLstruct_push_field (obj.v.struct_val, name, 1);
+
+ GET_CLASS(cl, (SLtype) type);
+
+ if (cl->is_struct)
+ return _pSLstruct_push_field (obj.v.struct_val, name, 1);
+
+ if (cl->cl_sget == NULL)
+ {
+	_pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "%s does not permit structure access",
+		 cl->cl_name);
+	free_object (&obj, cl);
+	return -1;
+ }
+ if (-1 == push_object (&obj))
+ {
+	free_object (&obj, cl);
+	return -1;
+ }
+ return (*cl->cl_sget) ((SLtype) type, name);
+}
+
+static int is_nametype_callable (SLang_Name_Type *nt)
+{
+ switch (nt->name_type)
+ {
+ case SLANG_PFUNCTION:
+ case SLANG_FUNCTION:
+ case SLANG_INTRINSIC:
+ case SLANG_ARITH_UNARY:
+ case SLANG_MATH_UNARY:
+ case SLANG_APP_UNARY:
+ case SLANG_ARITH_BINARY:
+	return 1;
+ }
+ return 0;
+}
+
+int _pSLang_ref_is_callable (SLang_Ref_Type *ref)
+{
+ if (ref->data_is_nametype == 0)
+ return 0;
+
+ return is_nametype_callable (*(SLang_Name_Type **)ref->data);
+}
+
+static int inner_interp(register SLBlock_Type *);
+static int inner_interp_nametype (SLang_Name_Type *nt, int linenum)
+{
+ SLBlock_Type bc_blks2;
+
+ bc_blks0.b.nt_blk = nt;
+ bc_blks0.bc_main_type = (_pSLang_BC_Type)nt->name_type;
+ bc_blks0.bc_sub_type = 0;
+ bc_blks0.linenum = linenum;
+ bc_blks1.bc_main_type = SLANG_BC_LAST_BLOCK;
+
+ return inner_interp(bc_blks);
+}
+
+/* This function also frees the object */
+static int deref_call_object (SLang_Object_Type *obj, int linenum)
+{
+ if (obj->o_data_type == SLANG_REF_TYPE)
+ {
+	SLang_Ref_Type *ref = (SLang_Ref_Type *)obj->v.ref;
+	if ((ref != NULL) && ref->data_is_nametype
+	 && is_nametype_callable (*(SLang_Name_Type **)ref->data))
+	 {
+	 int ret = inner_interp_nametype (*(SLang_Name_Type**)ref->data, linenum);
+	 SLang_free_ref (ref);
+	 return ret;
+	 }
+ }
+ _pSLang_verror (SL_TYPE_MISMATCH, "Expected a reference to a function");
+ SLang_free_object (obj);
+ return -1;
+}
+
+/* This arises from code such as a.f(x,y) with the following on the stack:
+ *
+ * __args x y a
+ *
+ * This function turns this into
+ *
+ * __args a x y _eargs (@a.field)
+ *
+ */
+static int do_struct_method (SLFUTURE_CONST char *name, int linenum)
+{
+ SLang_Object_Type obj;
+
+ if (-1 == SLdup_n (1))
+ return -1;			 /* stack: __args x y a a */
+
+ if (-1 == push_struct_field (name))
+ return -1;			 /* stack: __args x y a a.name */
+
+ if (-1 == pop_object(&obj))
+ return -1;
+
+ if (-1 == end_arg_list ())
+ {
+	SLang_free_object (&obj);
+	return -1;
+ }
+ /* stack: __args x y a __eargs */
+ if (-1 == roll_stack (Next_Function_Num_Args))
+ {
+	SLang_free_object (&obj);
+	return -1;
+ }
+ return deref_call_object (&obj, linenum); /* frees obj */
+}
+
+#if defined(__GNUC__)
+# pragma GCC diagnostic ignored "-Wformat-nonliteral"
+#endif
+static void trace_dump (SLFUTURE_CONST char *format, char *name, SLang_Object_Type *objs, int n, int dir)
+{
+ unsigned int len;
+ char prefix 52;
+
+ len = Trace_Mode - 1;
+ if (len + 2 >= sizeof (prefix))
+ len = sizeof (prefix) - 2;
+
+ SLMEMSET (prefix, ' ', len);
+ prefixlen = 0;
+
+ _pSLerr_dump_msg ("%s", prefix);
+ _pSLerr_dump_msg (format, name, n);
+
+ if (n > 0)
+ {
+	prefixlen = ' ';
+	len++;
+	prefixlen = 0;
+
+	_pSLerr_dump_msg (prefix, objs, n, dir);
+ }
+}
+#if defined(__GNUC__)
+# pragma GCC diagnostic warning "-Wformat-nonliteral"
+#endif
+
+/* Pop a data item from the stack and return a pointer to it.
+ * Strings are not freed from stack so use another routine to do it.
+ */
+static VOID_STAR pop_pointer (SLang_Object_Type *obj, SLtype type)
+{
+#ifndef SLANG_OPTIMIZE_FOR_SPEED
+ SLang_Class_Type *cl;
+#endif
+
+ SLang_Array_Type *at;
+
+ /* Arrays are special. Allow scalars to automatically convert to arrays.
+ */
+ if (type == SLANG_ARRAY_TYPE)
+ {
+	if (-1 == SLang_pop_array (&at, 1))
+	 return NULL;
+	obj->o_data_type = SLANG_ARRAY_TYPE;
+	return obj->v.ptr_val = (VOID_STAR) at;
+ }
+
+ if (type == 0)
+ {
+	/* This happens when an intrinsic is declared without any information
+	 * regarding parameter types.
+	 */
+	if (-1 == pop_object(obj))
+	 return NULL;
+	type = obj->o_data_type;
+ }
+ else if (-1 == pop_object_of_type (type, obj, 0))
+ return NULL;
+
+ type = GET_CLASS_TYPE(type);
+
+ if (type == SLANG_CLASS_TYPE_SCALAR)
+ return (VOID_STAR) &obj->v;
+ else if (type == SLANG_CLASS_TYPE_MMT)
+ return SLang_object_from_mmt (obj->v.ref);
+ else
+ return obj->v.ptr_val;
+}
+
+/* This is ugly. Does anyone have a advice for a cleaner way of doing
+ * this??
+ */
+typedef void (*VF0_Type)(void);
+typedef void (*VF1_Type)(VOID_STAR);
+typedef void (*VF2_Type)(VOID_STAR, VOID_STAR);
+typedef void (*VF3_Type)(VOID_STAR, VOID_STAR, VOID_STAR);
+typedef void (*VF4_Type)(VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR);
+typedef void (*VF5_Type)(VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR);
+typedef void (*VF6_Type)(VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR);
+typedef void (*VF7_Type)(VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR);
+typedef long (*LF0_Type)(void);
+typedef long (*LF1_Type)(VOID_STAR);
+typedef long (*LF2_Type)(VOID_STAR, VOID_STAR);
+typedef long (*LF3_Type)(VOID_STAR, VOID_STAR, VOID_STAR);
+typedef long (*LF4_Type)(VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR);
+typedef long (*LF5_Type)(VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR);
+typedef long (*LF6_Type)(VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR);
+typedef long (*LF7_Type)(VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR);
+#if SLANG_HAS_FLOAT
+typedef double (*FF0_Type)(void);
+typedef double (*FF1_Type)(VOID_STAR);
+typedef double (*FF2_Type)(VOID_STAR, VOID_STAR);
+typedef double (*FF3_Type)(VOID_STAR, VOID_STAR, VOID_STAR);
+typedef double (*FF4_Type)(VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR);
+typedef double (*FF5_Type)(VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR);
+typedef double (*FF6_Type)(VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR);
+typedef double (*FF7_Type)(VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR, VOID_STAR);
+#endif
+
+static int execute_intrinsic_fun (SLang_Intrin_Fun_Type *objf)
+{
+#if SLANG_HAS_FLOAT
+ double xf;
+#endif
+ VOID_STAR pSLANG_MAX_INTRIN_ARGS;
+ SLang_Object_Type objsSLANG_MAX_INTRIN_ARGS;
+ ptrdiff_t ret;
+ SLtype ret_type;
+ unsigned int argc;
+ unsigned int i;
+ FVOID_STAR fptr;
+ SLtype *arg_types;
+ int stk_depth;
+ int num_args;
+
+ fptr = objf->i_fun;
+ argc = objf->num_args;
+ ret_type = objf->return_type;
+ arg_types = objf->arg_types;
+
+ if (argc > SLANG_MAX_INTRIN_ARGS)
+ {
+	_pSLang_verror(SL_APPLICATION_ERROR,
+		 "Intrinsic function %s requires too many parameters", objf->name);
+	return -1;
+ }
+
+ if (-1 == _pSL_increment_frame_pointer ())
+ return -1;
+ num_args = SLang_Num_Function_Args;
+
+ stk_depth = -1;
+ if (Trace_Mode && (_pSLang_Trace > 0))
+ {
+	int nargs;
+
+	stk_depth = SLstack_depth ();
+
+	nargs = SLang_Num_Function_Args;
+	if (nargs == 0)
+	 nargs = (int)argc;
+
+	stk_depth -= nargs;
+
+	if (stk_depth >= 0)
+	 trace_dump (">>%s (%d args)\n",
+		 (char *) objf->name,
+		 Stack_Pointer - nargs,
+		 nargs,
+		 1);
+ }
+
+ i = argc;
+ while (i != 0)
+ {
+	i--;
+	if (NULL == (pi = pop_pointer (objs + i, arg_typesi)))
+	 {
+	 i++;
+	 goto free_and_return;
+	 }
+ }
+
+ ret = 0;
+#if SLANG_HAS_FLOAT
+ xf = 0.0;
+#endif
+
+ switch (argc)
+ {
+ case 0:
+	if (ret_type == SLANG_VOID_TYPE) ((VF0_Type) fptr) ();
+#if SLANG_HAS_FLOAT
+	else if (ret_type == SLANG_DOUBLE_TYPE) xf = ((FF0_Type) fptr)();
+#endif
+	else ret = ((LF0_Type) fptr)();
+	break;
+
+ case 1:
+	if (ret_type == SLANG_VOID_TYPE) ((VF1_Type) fptr)(p0);
+#if SLANG_HAS_FLOAT
+	else if (ret_type == SLANG_DOUBLE_TYPE) xf = ((FF1_Type) fptr)(p0);
+#endif
+	else ret = ((LF1_Type) fptr)(p0);
+	break;
+
+ case 2:
+	if (ret_type == SLANG_VOID_TYPE) ((VF2_Type) fptr)(p0, p1);
+#if SLANG_HAS_FLOAT
+	else if (ret_type == SLANG_DOUBLE_TYPE) xf = ((FF2_Type) fptr)(p0, p1);
+#endif
+	else ret = ((LF2_Type) fptr)(p0, p1);
+	break;
+
+ case 3:
+	if (ret_type == SLANG_VOID_TYPE) ((VF3_Type) fptr)(p0, p1, p2);
+#if SLANG_HAS_FLOAT
+	else if (ret_type == SLANG_DOUBLE_TYPE) xf = ((FF3_Type) fptr)(p0, p1, p2);
+#endif
+	else ret = ((LF3_Type) fptr)(p0, p1, p2);
+	break;
+
+ case 4:
+	if (ret_type == SLANG_VOID_TYPE) ((VF4_Type) fptr)(p0, p1, p2, p3);
+#if SLANG_HAS_FLOAT
+	else if (ret_type == SLANG_DOUBLE_TYPE) xf = ((FF4_Type) fptr)(p0, p1, p2, p3);
+#endif
+	else ret = ((LF4_Type) fptr)(p0, p1, p2, p3);
+	break;
+
+ case 5:
+	if (ret_type == SLANG_VOID_TYPE) ((VF5_Type) fptr)(p0, p1, p2, p3, p4);
+#if SLANG_HAS_FLOAT
+	else if (ret_type == SLANG_DOUBLE_TYPE) xf = ((FF5_Type) fptr)(p0, p1, p2, p3, p4);
+#endif
+	else ret = ((LF5_Type) fptr)(p0, p1, p2, p3, p4);
+	break;
+
+ case 6:
+	if (ret_type == SLANG_VOID_TYPE) ((VF6_Type) fptr)(p0, p1, p2, p3, p4, p5);
+#if SLANG_HAS_FLOAT
+	else if (ret_type == SLANG_DOUBLE_TYPE) xf = ((FF6_Type) fptr)(p0, p1, p2, p3, p4, p5);
+#endif
+	else ret = ((LF6_Type) fptr)(p0, p1, p2, p3, p4, p5);
+	break;
+
+ case 7:
+	if (ret_type == SLANG_VOID_TYPE) ((VF7_Type) fptr)(p0, p1, p2, p3, p4, p5, p6);
+#if SLANG_HAS_FLOAT
+	else if (ret_type == SLANG_DOUBLE_TYPE) xf = ((FF7_Type) fptr)(p0, p1, p2, p3, p4, p5, p6);
+#endif
+	else ret = ((LF7_Type) fptr)(p0, p1, p2, p3, p4, p5, p6);
+	break;
+ }
+
+ switch (ret_type)
+ {
+ case SLANG_VOID_TYPE:
+	break;
+
+#if SLANG_HAS_FLOAT
+ case SLANG_DOUBLE_TYPE:
+	(void) push_double_object (SLANG_DOUBLE_TYPE, xf);
+	break;
+#endif
+ case SLANG_UINT_TYPE:
+ case SLANG_INT_TYPE: (void) push_int_object (ret_type, (int) ret);
+	break;
+
+ case SLANG_CHAR_TYPE:
+ case SLANG_UCHAR_TYPE: (void) push_char_object (ret_type, (char) ret);
+	break;
+
+ case SLANG_SHORT_TYPE:
+	(void) SLclass_push_short_obj (_pSLANG_SHORT_TYPE, (short) ret);
+	break;
+ case SLANG_USHORT_TYPE:
+	(void) SLclass_push_short_obj (_pSLANG_USHORT_TYPE, (short) ret);
+	break;
+
+ case SLANG_LONG_TYPE:
+	(void) SLclass_push_long_obj (_pSLANG_LONG_TYPE, ret);
+	break;
+ case SLANG_ULONG_TYPE:
+	(void) SLclass_push_long_obj (_pSLANG_ULONG_TYPE, ret);
+	break;
+
+ case SLANG_STRING_TYPE:
+	if (NULL == (char *)ret)
+	 (void) SLang_set_error (SL_INTRINSIC_ERROR);
+	else (void) SLang_push_string ((char *)ret);
+	break;
+
+ default:
+	_pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "Support for intrinsic functions returning %s is not provided. Use the appropriate push function.",
+		 SLclass_get_datatype_name (ret_type));
+ }
+
+ if (stk_depth >= 0)
+ {
+	stk_depth = SLstack_depth () - stk_depth;
+
+	trace_dump ("<<%s (returning %d values)\n",
+		 (char *) objf->name,
+		 Stack_Pointer - stk_depth,
+		 stk_depth,
+		 1);
+ }
+
+ free_and_return:
+ while (i < argc)
+ {
+#if SLANG_OPTIMIZE_FOR_SPEED
+	SLang_Class_Type *cl;
+	SLtype type = objsi.o_data_type;
+	GET_CLASS(cl, type);
+	if (SLANG_CLASS_TYPE_SCALAR != cl->cl_class_type)
+	 free_object (objs+i, cl);
+#else
+	SLang_free_object (objs + i);
+#endif
+	i++;
+ }
+
+ if (num_args != SLang_Num_Function_Args)
+ SLang_verror (SL_INTERNAL_ERROR, "execute_intrinsic_fun: SLang_Num_Function_Args changed");
+
+ return _pSL_decrement_frame_pointer ();
+}
+
+/* Switch_Obj_Ptr points to the NEXT available free switch object */
+static SLang_Object_Type Switch_ObjectsSLANG_MAX_NESTED_SWITCH;
+static SLang_Object_Type *Switch_Obj_Ptr = Switch_Objects;
+static SLang_Object_Type *Switch_Obj_Max = Switch_Objects + SLANG_MAX_NESTED_SWITCH;
+
+/* Returns 0 if the loops were completed, 1 if they were terminated via break,
+ * or -1 if an error occured.
+ */
+static int
+lang_do_loops (int stype, SLBlock_Type *block, unsigned int num_blocks)
+{
+ int i, ctrl;
+ int first, last;
+ SLBlock_Type *blks4;
+ SLCONST char *loop_name;
+ SLang_Foreach_Context_Type *foreach_context;
+ SLang_Class_Type *cl;
+ int type;
+ unsigned int j;
+
+ j = 0;
+ for (i = 0; i < (int) num_blocks; i++)
+ {
+	if (blocki.bc_main_type != SLANG_BC_BLOCK)
+	 {
+#if USE_BC_LINE_NUM
+	 if (blocki.bc_main_type == SLANG_BC_LINE_NUM)
+	 continue;
+#endif
+	 _pSLang_verror (SL_SYNTAX_ERROR, "Bytecode is not a looping block");
+	 return -1;
+	 }
+	blksj = blocki.b.blk;
+	j++;
+ }
+
+ num_blocks = j;
+ block = blks0;
+
+ switch (stype)
+ {
+	int next_fn_args;
+
+ case SLANG_BCST_FOREACH_EARGS:
+	if (-1 == end_arg_list ())
+	 goto return_error;
+	/* drop */
+ case SLANG_BCST_FOREACH:	 /* obsolete */
+	loop_name = "foreach";
+	if (num_blocks != 1)
+	 goto wrong_num_blocks_error;
+
+	/* We should find Next_Function_Num_Args + 1 items on the stack.
+	 * The first Next_Function_Num_Args items represent the arguments to
+	 * to USING. The last item (deepest in stack) is the object to loop
+	 * over. So, roll the stack up and grab it.
+	 */
+	next_fn_args = Next_Function_Num_Args;
+	Next_Function_Num_Args = 0;
+	if ((-1 == roll_stack (-(next_fn_args + 1)))
+	 || (-1 == (type = peek_at_stack ())))
+	 goto return_error;
+
+	GET_CLASS(cl, (SLtype)type);
+	if ((cl->cl_foreach == NULL)
+	 || (cl->cl_foreach_open == NULL)
+	 || (cl->cl_foreach_close == NULL))
+	 {
+	 _pSLang_verror (SL_NOT_IMPLEMENTED, "%s does not permit foreach", cl->cl_name);
+	 SLdo_pop_n (next_fn_args + 1);
+	 goto return_error;
+	 }
+
+	if (NULL == (foreach_context = (*cl->cl_foreach_open) ((SLtype)type, next_fn_args)))
+	 goto return_error;
+
+	while (1)
+	 {
+	 int status;
+
+	 if (IS_SLANG_ERROR)
+	 {
+		 (*cl->cl_foreach_close) ((SLtype) type, foreach_context);
+		 goto return_error;
+	 }
+
+	 status = (*cl->cl_foreach) ((SLtype) type, foreach_context);
+	 if (status <= 0)
+	 {
+		 if (status == 0)
+		 break;
+
+		 (*cl->cl_foreach_close) ((SLtype) type, foreach_context);
+		 goto return_error;
+	 }
+
+	 inner_interp (block);
+	 if (Lang_Break) break;
+	 Lang_Break_Condition = /* Lang_Continue = */ 0;
+	 }
+	(*cl->cl_foreach_close) ((SLtype) type, foreach_context);
+	break;
+
+ case SLANG_BCST_WHILE:
+	loop_name = "while";
+
+	if (num_blocks != 2)
+	 goto wrong_num_blocks_error;
+
+	type = blks1->bc_main_type;
+	while (1)
+	 {
+	 if (IS_SLANG_ERROR)
+	 goto return_error;
+
+	 inner_interp (block);
+	 if (Lang_Break) break;
+
+	 if (-1 == pop_ctrl_integer (&ctrl))
+	 goto return_error;
+
+	 if (ctrl == 0) break;
+
+	 if (type)
+	 {
+		 inner_interp (blks1);
+		 if (Lang_Break) break;
+		 Lang_Break_Condition = /* Lang_Continue = */ 0;
+	 }
+	 }
+	break;
+
+ case SLANG_BCST_DOWHILE:
+	loop_name = "do...while";
+
+	if (num_blocks != 2)
+	 goto wrong_num_blocks_error;
+
+	while (1)
+	 {
+	 if (IS_SLANG_ERROR)
+	 goto return_error;
+
+	 Lang_Break_Condition = /* Lang_Continue = */ 0;
+	 inner_interp (block);
+	 if (Lang_Break) break;
+	 Lang_Break_Condition = /* Lang_Continue = */ 0;
+	 inner_interp (blks1);
+	 if (-1 == pop_ctrl_integer (&ctrl))
+	 goto return_error;
+
+	 if (ctrl == 0) break;
+	 }
+	break;
+
+ case SLANG_BCST_CFOR:
+	loop_name = "for";
+
+	/* we need 4 blocks: first 3 control, the last is code */
+	if (num_blocks != 4) goto wrong_num_blocks_error;
+
+	inner_interp (block);
+	while (1)
+	 {
+	 if (IS_SLANG_ERROR)
+	 goto return_error;
+
+	 inner_interp(blks1); /* test */
+	 if (-1 == pop_ctrl_integer (&ctrl))
+	 goto return_error;
+
+	 if (ctrl == 0) break;
+	 inner_interp(blks3); /* code */
+	 if (Lang_Break) break;
+	 inner_interp(blks2); /* bump */
+	 Lang_Break_Condition = /* Lang_Continue = */ 0;
+	 }
+	break;
+
+ case SLANG_BCST_FOR:
+	 {
+#if SLANG_OPTIMIZE_FOR_SPEED
+	 SLang_Object_Type *objp;
+#endif
+	 loop_name = "_for";
+
+	 if (num_blocks != 1)
+	 goto wrong_num_blocks_error;
+
+	 /* 3 elements: first, last, step */
+	 if ((-1 == pop_int (&ctrl))
+		 || (-1 == pop_int (&last))
+		 || (-1 == pop_int (&first)))
+	 goto return_error;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+	 objp = NULL;
+	 if ((block->bc_main_type == SLANG_BC_SET_LOCAL_LVALUE)
+		 && (block->bc_sub_type == SLANG_BCST_ASSIGN))
+	 {
+		 objp = Local_Variable_Frame - block->b.i_blk;
+		 block++;
+	 }
+#endif
+	 i = first;
+	 while (1)
+	 {
+		 /* It is ugly to have this test here but I do not know of a
+		 * simple way to do this without using two while loops.
+		 */
+		 if (ctrl >= 0)
+		 {
+		 if (i > last) break;
+		 }
+		 else if (i < last) break;
+
+		 if (IS_SLANG_ERROR) goto return_error;
+#if SLANG_OPTIMIZE_FOR_SPEED
+		 if (objp != NULL)
+		 {
+		 if (objp->o_data_type != SLANG_INT_TYPE)
+			 {
+			 if (SLANG_CLASS_TYPE_SCALAR != GET_CLASS_TYPE(objp->o_data_type))
+			 SLang_free_object (objp);
+			 objp->o_data_type = SLANG_INT_TYPE;
+			 }
+		 objp->v.int_val = i;
+		 }
+		 else
+#endif
+		 push_int_object (SLANG_INT_TYPE, i);
+
+		 inner_interp (block);
+		 if (Lang_Break) break;
+		 Lang_Break_Condition = /* Lang_Continue = */ 0;
+
+		 i += ctrl;
+	 }
+	 }
+	break;
+
+ case SLANG_BCST_LOOP:
+	loop_name = "loop";
+	if (num_blocks != 1)
+	 goto wrong_num_blocks_error;
+
+	if (-1 == pop_int (&ctrl))
+	 goto return_error;
+	while (ctrl > 0)
+	 {
+	 ctrl--;
+
+	 if (IS_SLANG_ERROR)
+	 goto return_error;
+
+	 inner_interp (block);
+	 if (Lang_Break) break;
+	 Lang_Break_Condition = /* Lang_Continue = */ 0;
+	 }
+	break;
+
+ case SLANG_BCST_FOREVER:
+	loop_name = "forever";
+
+	if (num_blocks != 1)
+	 goto wrong_num_blocks_error;
+
+	while (1)
+	 {
+	 if (IS_SLANG_ERROR)
+	 goto return_error;
+
+	 inner_interp (block);
+	 if (Lang_Break) break;
+	 Lang_Break_Condition = /* Lang_Continue = */ 0;
+	 }
+	break;
+
+ default: _pSLang_verror(SL_INTERNAL_ERROR, "Unknown loop type");
+	return -1;
+ }
+ if (Lang_Break == 0)
+ {
+	Lang_Break_Condition = Lang_Return;
+	return 0;
+ }
+
+ if (Lang_Break < 0)
+ {
+	Lang_Break++;
+	Lang_Break_Condition = 1;
+ }
+ else
+ {
+	Lang_Break--;
+	Lang_Break_Condition = (Lang_Return || Lang_Break);
+ }
+ return 1;
+
+ wrong_num_blocks_error:
+ _pSLang_verror (SL_SYNTAX_ERROR, "Wrong number of blocks for '%s' construct", loop_name);
+
+ /* drop */
+ return_error:
+ return -1;
+ /* do_traceback (loop_name, NULL, -1); */
+}
+
+static void lang_do_and_orelse (int is_or, SLBlock_Type *addr, SLBlock_Type *addr_max)
+{
+ int test = 0;
+
+ while (addr <= addr_max)
+ {
+#if USE_BC_LINE_NUM
+	if (addr->bc_main_type == SLANG_BC_LINE_NUM)
+	 {
+	 addr++;
+	 continue;
+	 }
+#endif
+	inner_interp (addr->b.blk);
+	if (IS_SLANG_ERROR
+	 || Lang_Break_Condition
+	 || (-1 == pop_ctrl_integer (&test)))
+	 return;
+
+	test = (test != 0);
+	if (is_or == test)
+	 break;
+
+	/* if (((stype == SLANG_BCST_ANDELSE) && (test == 0))
+	 * || ((stype == SLANG_BCST_ORELSE) && test))
+	 * break;
+	 */
+
+	addr++;
+ }
+ push_char_object (SLANG_CHAR_TYPE, (char) test);
+}
+
+/* Executes the block in error-free context. If execution goes wrong, returns -1 */
+static int try_interp_block (SLBlock_Type **bp)
+{
+ SLBlock_Type *b = *bp;
+
+#if USE_BC_LINE_NUM
+ while (b->bc_main_type == SLANG_BC_LINE_NUM)
+ b++;
+ *bp = b;
+#endif
+
+ b = b->b.blk;
+ if (b->bc_main_type == 0)
+ return 0;
+
+ (void) inner_interp (b);
+
+ if (IS_SLANG_ERROR)
+ return -1;
+
+ return 0;
+}
+
+static int do_try_internal (SLBlock_Type *ev_block, SLBlock_Type *final)
+{
+ SLBlock_Type *b;
+ int stack_depth, num;
+ unsigned int frame_depth, recurs_depth;
+#if SLANG_HAS_BOSEOS
+ int bos_stack_depth;
+#endif
+ int e1;
+ int status;
+
+ /* Try blocks have the form:
+ * {ev_block} {try-statements} {exception-list}{catch-block}...{final}
+ *
+ * The parser guarantees that the first, second, and final blocks will be
+ * present. Line number blocks may also be present.
+ */
+ stack_depth = SLstack_depth ();
+ frame_depth = Frame_Pointer_Depth;
+ recurs_depth = Recursion_Depth;
+
+#if SLANG_HAS_BOSEOS
+ bos_stack_depth = BOS_Stack_Depth;
+#endif
+ b = ev_block + 1;
+#if USE_BC_LINE_NUM
+ while (b->bc_main_type == SLANG_BC_LINE_NUM)
+ b++;
+#endif
+ (void) inner_interp (b->b.blk); /* try-block */
+
+ if (0 == (e1 = SLang_get_error ()))
+ return 0;
+
+ num = SLstack_depth () - stack_depth;
+ if (num > 0)
+ SLdo_pop_n (num);
+
+#if SLANG_HAS_BOSEOS
+ while (bos_stack_depth < BOS_Stack_Depth)
+ {
+	(void) _pSLcall_eos_handler ();
+	BOS_Stack_Depth--;
+ }
+#endif
+ while (Recursion_Depth > recurs_depth)
+ {
+	(void) _pSL_decrement_frame_pointer ();
+ }
+ while (frame_depth < Frame_Pointer_Depth)
+ {
+	end_arg_list ();
+ }
+
+ if (-1 == _pSLang_push_error_context ())
+ return -1;
+
+ status = -1;
+
+ if (-1 == try_interp_block (&ev_block)) /* evaluate the exception */
+ goto return_error;
+
+ b++;				 /* skip try-block */
+
+ while (b < final)
+ {
+	stack_depth = SLstack_depth ();
+
+	if (-1 == try_interp_block (&b))/* exception-list */
+	 goto return_error;
+
+	num = SLstack_depth () - stack_depth;
+	if (num < 0)
+	 {
+	 _pSLang_verror (SL_StackUnderflow_Error, "Exception list is invalid");
+	 goto return_error;
+	 }
+
+	if (num > 0)
+	 {
+	 while (num)
+	 {
+		 int e;
+		 if (-1 == _pSLerr_pop_exception (&e))
+		 goto return_error;
+
+		 if (SLerr_exception_eqs (e1, e))
+		 break;
+
+		 num--;
+	 }
+	 if (num == 0)
+	 {
+		 /* No match, skip the exception-list */
+		 b++;
+#if USE_BC_LINE_NUM
+		 while (b->bc_main_type == SLANG_BC_LINE_NUM)
+		 b++;
+#endif
+		 /* And the block associated with it */
+		 b++;
+		 continue;
+	 }
+	 if (num > 1)
+	 SLdo_pop_n (num-1);
+	 }
+
+	/* Found a match--- move on to the code to be executed */
+	b++;
+	/* _pSLerr_clear_error (); */
+#if USE_BC_LINE_NUM
+	while (b->bc_main_type == SLANG_BC_LINE_NUM)
+	 b++;
+#endif
+	status = try_interp_block (&b);
+	_pSLang_pop_error_context (status);
+	if (status == 0)
+	 _pSLerr_clear_error (0);
+	return status;
+ }
+
+ if (b == final)
+ {
+	/* No matching catch block */
+	status = 0;
+ }
+
+ return_error:
+ _pSLang_pop_error_context (status);
+
+ return -1;
+}
+
+static void do_try (SLBlock_Type *ev_block, SLBlock_Type *final)
+{
+ (void) do_try_internal (ev_block, final);
+
+ if (final->b.blk->bc_main_type)
+ {
+	int bc = Lang_Break_Condition, r = Lang_Return, br = Lang_Break;
+	/* Need to reset these so that loops work in the finally block */
+	Lang_Break_Condition = Lang_Break = Lang_Return = 0;
+	if (-1 == _pSLang_push_error_context ())
+	 return;
+
+	if (-1 == try_interp_block (&final))
+	 _pSLang_pop_error_context (1);
+	else
+	 _pSLang_pop_error_context (0);
+
+	Lang_Break = br; Lang_Return = r; Lang_Break_Condition = bc;
+ }
+}
+
+/* This evaluates:
+ * (x0 op1 x1) and (x1 op2 x2) ... and (x{N-1} opN xN)
+ * On stack: x0 x1 ... xN
+ * Need to perform:
+ * x0 x1 op1 x1 x2 op2 and x2 x3 op3 and ... x{N-1} xN opN and
+ * -------- -------- -------- ....... -------------
+ * y1 y2 y3 yN
+ * y1 y2 and y3 and ... yN and
+ */
+static int do_compare (SLBlock_Type *ops1)
+{
+ SLang_Object_Type a, b, c;
+ SLang_Object_Type *ap, *bp, *cp;
+ SLBlock_Type *ops = ops1;
+ int ret = -1;
+
+ /* skip to opN */
+ while ((ops->bc_main_type == SLANG_BC_BINARY)
+	 || (ops->bc_main_type == SLANG_BC_BINARY2)
+	 || (ops->bc_main_type == SLANG_BC_COMBINED)
+	 || (ops->bc_main_type == SLANG_BC_BINARY_LASTBLOCK)
+	 || (ops->bc_main_type == SLANG_BC_BINARY_SET_LOCLVAL))
+ ops++;
+
+ bp = &b;
+ if (-1 == SLang_pop (bp))
+ return -1;
+
+ ap = &a;
+ cp = NULL;
+ while (1)
+ {
+	SLang_Object_Type *tmp;
+	ops--;
+	if (-1 == SLang_pop (ap))
+	 goto return_error;
+
+	if (-1 == do_binary_ab_inc_ref (ops->b.i_blk, ap, bp))
+	 {
+	 SLang_free_object (ap);
+	 goto return_error;
+	 }
+	SLang_free_object (bp);
+	tmp = bp; bp = ap; ap = tmp;
+
+	if (cp == NULL)
+	 {
+	 if (-1 == SLang_pop (&c))
+	 goto return_error;
+	 cp = &c;
+	 continue;
+	 }
+
+	if (-1 == do_binary_b (SLANG_AND, cp))
+	 goto return_error;
+	SLang_free_object (cp);
+
+	if (ops == ops1)
+	 {
+	 cp = NULL;
+	 break;
+	 }
+
+	if (-1 == SLang_pop (cp))
+	 {
+	 cp = NULL;
+	 goto return_error;
+	 }
+ }
+ ret = 0;
+ /* drop */
+ return_error:
+ if (cp != NULL)
+ SLang_free_object (cp);
+ SLang_free_object (bp);
+ return ret;
+}
+
+static void do_else_if (SLBlock_Type *zero_block, SLBlock_Type *non_zero_block)
+{
+ int test;
+
+ if (-1 == pop_ctrl_integer (&test))
+ return;
+
+ if (test == 0)
+ non_zero_block = zero_block;
+
+ if (non_zero_block != NULL)
+ inner_interp (non_zero_block->b.blk);
+}
+
+int _pSLang_trace_fun (SLFUTURE_CONST char *f)
+{
+ if (NULL == (f = SLang_create_slstring (f)))
+ return -1;
+
+ SLang_free_slstring ((char *) Trace_Function);
+ Trace_Function = f;
+ _pSLang_Trace = 1;
+ return 0;
+}
+
+int _pSLdump_objects (char *prefix, SLang_Object_Type *x, unsigned int n, int dir)
+{
+ while (n)
+ {
+	SLang_Class_Type *cl;
+	char *s;
+
+	GET_CLASS(cl,x->o_data_type);
+
+	s = _pSLstringize_object (x);
+
+	_pSLerr_dump_msg ("%s%s:%s\n", prefix, cl->cl_name,
+			 ((s != NULL) ? s : "??"));
+	SLang_free_slstring (s);
+
+	x += dir;
+	n--;
+ }
+ return 0;
+}
+
+/* Do NOT change this-- it corresponds to USRBLK0-4_TOKEN */
+#define MAX_USER_BLOCKS	5
+static SLBlock_Type *Exit_Block_Ptr;
+static SLBlock_Type *Global_User_BlockMAX_USER_BLOCKS;
+static SLBlock_Type **User_Block_Ptr = Global_User_Block;
+
+static int find_local_variable_index (Function_Header_Type *header, char *name)
+{
+ char **local_variables;
+ unsigned int nlocals;
+ unsigned int i;
+
+ if (header == NULL)
+ return -1;
+ local_variables = header->local_variables;
+ nlocals = header->nlocals;
+
+ for (i = 0; i < nlocals; i++)
+ {
+	if ((*name == local_variablesi0)
+	 && (0 == strcmp (name, local_variablesi)))
+	 return (int)i;
+ }
+ return -1;
+}
+
+static SLang_Name_Type *
+ find_global_name (char *name,
+		 SLang_NameSpace_Type *pns, SLang_NameSpace_Type *sns,
+		 SLang_NameSpace_Type *gns,
+		 int do_error)
+{
+ return find_global_hashed_name (name, SLcompute_string_hash (name), pns, sns, gns, do_error);
+}
+
+#if SLANG_HAS_DEBUGGER_SUPPORT
+/* frame depth numbered two ways:
+ *
+ * positive: 12345..N
+ * negative: ..543210
+ */
+int _pSLang_get_frame_depth (void)
+{
+ return (int) (Function_Stack_Ptr - Function_Stack);
+}
+static int get_function_stack_info (int depth, Function_Stack_Type *sp)
+{
+ int current_depth = _pSLang_get_frame_depth ();
+
+ if (depth <= 0)
+ depth += current_depth;
+
+ if (depth == current_depth)
+ {
+	sp->function = Current_Function;
+	sp->header = Current_Function_Header;
+	sp->local_variable_frame = Local_Variable_Frame;
+	sp->line = This_Compile_Linenum;
+	sp->file = This_Compile_Filename;
+	sp->static_ns = This_Static_NameSpace;
+	sp->private_ns = This_Private_NameSpace;
+	return 0;
+ }
+
+ if ((depth >= current_depth) || (depth <= 0))
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Invalid Frame Depth");
+	return -1;
+ }
+ *sp = *(Function_Stack + depth);
+ return 0;
+}
+
+int _pSLang_get_frame_fun_info (int depth, _pSLang_Frame_Info_Type *f)
+{
+ Function_Stack_Type s;
+
+ if (-1 == get_function_stack_info (depth, &s))
+ return -1;
+
+ f->locals = NULL;
+ f->nlocals = 0;
+ f->function = NULL;
+
+ f->line = s.line;
+ f->file = s.file;
+ f->ns = s.static_ns->namespace_name;
+
+ if (s.header != NULL)
+ {
+	f->locals = s.header->local_variables;
+	f->nlocals = s.header->nlocals;
+ }
+
+ if (s.function != NULL)
+ f->function = s.function->name;
+
+ return 0;
+}
+
+int _pSLang_set_frame_variable (int depth, char *name)
+{
+ Function_Stack_Type s;
+ SLang_Name_Type *nt;
+ int i;
+
+ if (-1 == get_function_stack_info (depth, &s))
+ return -1;
+
+ if (-1 != (i = find_local_variable_index (s.header, name)))
+ {
+	SLang_Object_Type *obj = s.local_variable_frame - i;
+	return set_lvalue_obj (SLANG_BCST_ASSIGN, obj);
+ }
+
+ if (NULL == (nt = find_global_name (name, s.private_ns, s.static_ns, Global_NameSpace, 1)))
+ return -1;
+
+ return set_nametype_variable (nt);
+}
+
+int _pSLang_get_frame_variable (int depth, char *name)
+{
+ Function_Stack_Type s;
+ SLang_Name_Type *nt;
+ int i;
+
+ if (-1 == get_function_stack_info (depth, &s))
+ return -1;
+
+ if (-1 != (i = find_local_variable_index (s.header, name)))
+ {
+	SLang_Class_Type *cl;
+	SLang_Object_Type *obj = s.local_variable_frame - i;
+	GET_CLASS(cl,obj->o_data_type);
+	return (*cl->cl_push) (obj->o_data_type, (VOID_STAR) &obj->v);
+ }
+
+ if (NULL == (nt = find_global_name (name, s.private_ns, s.static_ns, Global_NameSpace, 1)))
+ return -1;
+
+ return push_nametype_variable (nt);
+}
+
+#endif
+
+static void execute_slang_fun (_pSLang_Function_Type *fun, unsigned int linenum)
+{
+ register unsigned int i;
+ register SLang_Object_Type *frame, *lvf;
+ register unsigned int n_locals;
+ Function_Header_Type *header;
+ /* SLBlock_Type *val; */
+ SLBlock_Type *exit_block_save;
+ SLBlock_Type **user_block_save;
+ SLBlock_Type *user_blocksMAX_USER_BLOCKS;
+ int issue_bofeof_info = 0;
+ int nargs;
+
+ exit_block_save = Exit_Block_Ptr;
+ user_block_save = User_Block_Ptr;
+ User_Block_Ptr = user_blocks;
+ memset ((char *)user_blocks, 0, MAX_USER_BLOCKS*sizeof (SLBlock_Type *));
+ Exit_Block_Ptr = NULL;
+
+ if (-1 == increment_slang_frame_pointer (fun, linenum))
+ return;
+ nargs = SLang_Num_Function_Args;
+
+ header = fun->header;
+ /* Make sure we do not allow this header to get destroyed by something
+ * like: define crash () { eval ("define crash ();") }
+ */
+ header->num_refs++;
+ n_locals = header->nlocals;
+
+ /* let the error propagate through since it will do no harm
+ and allow us to restore stack. */
+
+ /* set new stack frame */
+ lvf = frame = Local_Variable_Frame;
+ i = n_locals;
+ if ((lvf + i) >= Local_Variable_Stack_Max)
+ {
+	_pSLang_verror(SL_STACK_OVERFLOW, "%s: Local Variable Stack Overflow",
+		 fun->name);
+	goto the_return;
+ }
+
+ while (i--)
+ {
+	lvf++;
+	lvf->o_data_type = SLANG_UNDEFINED_TYPE;
+ }
+ Local_Variable_Frame = lvf;
+
+ /* read values of function arguments */
+ if (header->nargs)
+ (void) pop_n_objs_reverse (Local_Variable_Frame - (header->nargs-1), header->nargs);
+
+#if SLANG_HAS_BOSEOS
+ if (header->issue_bofeof_info)
+ {
+	issue_bofeof_info = 1;
+	(void) _pSLcall_bof_handler (fun->name, header->file);
+ }
+#endif
+ if (SLang_Enter_Function != NULL)
+ (*SLang_Enter_Function) (fun->name);
+
+ if (_pSLang_Trace)
+ {
+	int stack_depth;
+
+	stack_depth = SLstack_depth ();
+
+	if ((Trace_Function != NULL)
+	 && (0 == strcmp (Trace_Function, fun->name))
+	 && (Trace_Mode == 0))
+	 Trace_Mode = 1;
+
+	if (Trace_Mode)
+	 {
+	 /* The local variable frame grows backwards */
+	 trace_dump (">>%s (%d args)\n",
+			 (char *) fun->name,
+			 Local_Variable_Frame,
+			 (int) header->nargs,
+			 -1);
+	 Trace_Mode++;
+	 }
+
+	inner_interp (header->body);
+	Lang_Break_Condition = Lang_Return = Lang_Break = 0;
+	if (Exit_Block_Ptr != NULL) inner_interp(Exit_Block_Ptr);
+
+	if (Trace_Mode)
+	 {
+	 Trace_Mode--;
+	 stack_depth = SLstack_depth () - stack_depth;
+
+	 trace_dump ("<<%s (returning %d values)\n", (char *) fun->name,
+			 Stack_Pointer - stack_depth,
+			 stack_depth,
+			 1);
+
+	 if (Trace_Mode == 1)
+	 Trace_Mode = 0;
+	 }
+ }
+ else
+ {
+	inner_interp (header->body);
+	Lang_Break_Condition = Lang_Return = Lang_Break = 0;
+	if (Exit_Block_Ptr != NULL) inner_interp(Exit_Block_Ptr);
+ }
+
+ if (SLang_Exit_Function != NULL)
+ (*SLang_Exit_Function)(fun->name);
+
+ if (IS_SLANG_ERROR)
+ {
+	do_function_traceback (header, linenum);
+#if SLANG_HAS_BOSEOS && SLANG_HAS_DEBUGGER_SUPPORT
+	/* (void) _pSLcall_debug_hook (); */
+#endif
+ }
+
+ /* free local variables.... */
+ lvf = Local_Variable_Frame;
+ while (lvf > frame)
+ {
+#if SLANG_OPTIMIZE_FOR_SPEED
+	SLang_Class_Type *cl;
+	GET_CLASS(cl, lvf->o_data_type);
+	if (SLANG_CLASS_TYPE_SCALAR != cl->cl_class_type)
+	 free_object (lvf, cl);
+#else
+	SLang_free_object (lvf);
+#endif
+	lvf--;
+ }
+ Local_Variable_Frame = lvf;
+
+ the_return:
+
+ if (header->num_refs == 1)
+ free_function_header (header);
+ else
+ header->num_refs--;
+
+ Lang_Break_Condition = Lang_Return = Lang_Break = 0;
+ Exit_Block_Ptr = exit_block_save;
+ User_Block_Ptr = user_block_save;
+
+ if (nargs != SLang_Num_Function_Args)
+ SLang_verror (SL_INTERNAL_ERROR, "execute_slang_fun: SLang_Num_Function_Args changed");
+
+ (void) decrement_slang_frame_pointer ();
+#if SLANG_HAS_BOSEOS
+ if (issue_bofeof_info)
+ (void) _pSLcall_eof_handler ();
+#endif
+}
+
+static void do_traceback (SLCONST char *message)
+{
+ if (SLang_Traceback == SL_TB_NONE)
+ return;
+
+ if (message != NULL)
+ _pSLerr_traceback_msg ("Traceback: %s\n", message);
+}
+
+static void do_function_traceback (Function_Header_Type *header, unsigned int linenum)
+{
+ unsigned int nlocals;
+ unsigned int i;
+ SLang_Object_Type *objp;
+
+ if (SLang_Traceback == SL_TB_NONE)
+ return;
+
+ /* Doing this will allow line number errors in recursive functions to be reported */
+ _pSLerr_set_line_info (header->file, (int)linenum, "");
+
+ if ((0 == (SLang_Traceback & SL_TB_FULL))
+ || (SLang_Traceback & SL_TB_OMIT_LOCALS)
+ || (0 == (nlocals = header->nlocals))
+ || (header->local_variables == NULL))
+ return;
+
+ _pSLerr_traceback_msg (" Local variables for %s:\n", Current_Function->name);
+
+ for (i = 0; i < nlocals; i++)
+ {
+	SLang_Class_Type *cl;
+	char *class_name;
+	char *s;
+	SLtype stype;
+
+	objp = Local_Variable_Frame - i;
+	stype = objp->o_data_type;
+
+	s = _pSLstringize_object (objp);
+	GET_CLASS(cl,stype);
+	class_name = cl->cl_name;
+
+	_pSLerr_traceback_msg ("\t%s %s = ", class_name, header->local_variablesi);
+
+	if (s == NULL) _pSLerr_traceback_msg ("??\n");
+	else
+	 {
+	 SLCONST char *q = "";
+#ifndef HAVE_VSNPRINTF
+	 char buf256;
+	 if (strlen (s) >= sizeof (buf))
+	 {
+		 strncpy (buf, s, sizeof(buf));
+		 s = buf;
+		 ssizeof(buf) - 1 = 0;
+	 }
+#endif
+	 if (SLANG_STRING_TYPE == stype) q = "\"";
+	 _pSLerr_traceback_msg ("%s%s%s\n", q, s, q);
+	 }
+ }
+}
+
+static void do_app_unary (SLang_App_Unary_Type *nt)
+{
+ if (-1 == do_unary (nt->unary_op, nt->name_type))
+ do_traceback (nt->name);
+}
+
+static void do_arith_binary (SLang_Arith_Binary_Type *nt)
+{
+ if (-1 == do_binary (nt->binary_op))
+ do_traceback (nt->name);
+}
+
+int _pSLang_dereference_ref (SLang_Ref_Type *ref)
+{
+ return ref->deref (ref->data);
+}
+
+int _pSLang_is_ref_initialized (SLang_Ref_Type *ref)
+{
+ if (ref->is_initialized != NULL)
+ return ref->is_initialized (ref->data);
+
+ return 1;			 /* punt */
+}
+
+int _pSLang_uninitialize_ref (SLang_Ref_Type *ref)
+{
+ if (ref->uninitialize != NULL)
+ return (*ref->uninitialize) (ref->data);
+
+ return 0;
+}
+
+void (*SLang_Interrupt)(void) = NULL;
+
+int _pSLpush_slang_obj (SLang_Object_Type *obj)
+{
+ SLtype subtype;
+ SLang_Class_Type *cl;
+
+ if (obj == NULL) return SLang_push_null ();
+
+ subtype = obj->o_data_type;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (SLANG_CLASS_TYPE_SCALAR == GET_CLASS_TYPE(subtype))
+ return push_object (obj);
+#endif
+
+ GET_CLASS(cl,subtype);
+ return (*cl->cl_push) (subtype, (VOID_STAR) &obj->v);
+}
+
+_INLINE_
+static int carefully_push_object (SLang_Object_Type *obj)
+{
+ SLang_Class_Type *cl;
+ SLtype subtype;
+
+ subtype = obj->o_data_type;
+
+ GET_CLASS(cl,subtype);
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (SLANG_CLASS_TYPE_SCALAR == cl->cl_class_type)
+ return push_object (obj);
+ if (subtype == SLANG_STRING_TYPE)
+ return _pSLang_dup_and_push_slstring (obj->v.s_val);
+ if (subtype == SLANG_ARRAY_TYPE)
+ return _pSLang_push_array (obj->v.array_val, 0);
+#endif
+
+ return (*cl->cl_push) (subtype, (VOID_STAR) &obj->v);
+}
+
+int _pSLslang_copy_obj (SLang_Object_Type *obja, SLang_Object_Type *objb)
+{
+ SLtype type;
+
+ type = obja->o_data_type;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (SLANG_CLASS_TYPE_SCALAR == GET_CLASS_TYPE(type))
+ {
+	*objb = *obja;
+	return 0;
+ }
+#endif
+
+ if (-1 == carefully_push_object (obja))
+ return -1;
+
+ return pop_object (objb);
+}
+
+#define PUSH_LOCAL_VARIABLE(_indx) \
+ { \
+ SLang_Object_Type *_obj = Local_Variable_Frame - (_indx); \
+ (void) carefully_push_object (_obj); \
+ }
+
+static int push_local_variable (int i)
+{
+ SLang_Object_Type *obj = Local_Variable_Frame - i;
+ SLang_Class_Type *cl;
+ SLtype subtype;
+
+ subtype = obj->o_data_type;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (SLANG_CLASS_TYPE_SCALAR == GET_CLASS_TYPE(subtype))
+ return push_object (obj);
+ if (subtype == SLANG_STRING_TYPE)
+ return _pSLang_dup_and_push_slstring (obj->v.s_val);
+ if (subtype == SLANG_ARRAY_TYPE)
+ return _pSLang_push_array (obj->v.array_val, 0);
+#endif
+
+ GET_CLASS(cl,subtype);
+ return (*cl->cl_push) (subtype, (VOID_STAR) &obj->v);
+}
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+static int push_array_element (int lvaridx, SLindex_Type idx)
+{
+ SLang_Object_Type *obj = Local_Variable_Frame - lvaridx;
+
+ if (obj->o_data_type == SLANG_ARRAY_TYPE)
+ {
+	SLang_Array_Type *at = obj->v.array_val;
+
+	if (at->num_dims == 1)
+	 {
+	 if (at->data_type == SLANG_INT_TYPE)
+	 {
+		 int *ptr = (int *)at->index_fun (at, &idx);
+		 if (ptr == NULL)
+		 return -1;
+		 return push_int_object (SLANG_INT_TYPE, *ptr);
+	 }
+# if SLANG_HAS_FLOAT
+	 else if (at->data_type == SLANG_DOUBLE_TYPE)
+	 {
+		 double *ptr = (double *)at->index_fun (at, &idx);
+		 if (ptr == NULL)
+		 return -1;
+		 return push_double_object (SLANG_DOUBLE_TYPE, *ptr);
+	 }
+# endif
+	 return _pSLarray1d_push_elem (at, idx);
+	 }
+	/* drop and fail */
+ }
+
+ /* Do it the hard way */
+ if ((0 == push_array_index (SLANG_ARRAY_INDEX_TYPE, idx))
+ && (0 == push_local_variable (lvaridx)))
+ return _pSLarray_aget1 (1);
+
+ return -1;
+}
+#endif
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+static int pop_to_lvar_array_element (int lvaridx, SLindex_Type idx)
+{
+ SLang_Object_Type *obj = Local_Variable_Frame - lvaridx;
+
+ if ((obj->o_data_type == SLANG_ARRAY_TYPE)
+ && (idx >= 0))
+ {
+	SLang_Array_Type *at = obj->v.array_val;
+
+	if ((at->num_dims == 1)
+	 && (at->flags == 0)
+	 && (idx < (SLindex_Type) at->num_elements))
+	 {
+	 if (at->data_type == SLANG_INT_TYPE)
+	 return pop_int ((int *)at->data + idx);
+#if SLANG_HAS_FLOAT
+	 else if (at->data_type == SLANG_DOUBLE_TYPE)
+	 {
+		 SLang_Object_Type dobj;
+		 if (-1 == pop_object_of_type (SLANG_DOUBLE_TYPE, &dobj, 0))
+		 return -1;
+		 *((double *)at->data + idx) = dobj.v.double_val;
+		 return 0;
+	 }
+#endif
+	 }
+ }
+ /* Do it the hard way */
+ if ((0 == push_array_index (SLANG_ARRAY_INDEX_TYPE, idx))
+ && (0 == push_local_variable (lvaridx)))
+ return _pSLarray_aput1 (1);
+
+ return -1;
+}
+#endif
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+static int aget1_from_lvar_binary (int lvaridx, SLindex_Type idx, int op,
+				 SLang_Object_Type *objb)
+{
+ SLang_Object_Type *obj;
+
+ obj = Local_Variable_Frame - lvaridx;
+
+ if (obj->o_data_type == SLANG_ARRAY_TYPE)
+ {
+	SLang_Array_Type *at = obj->v.array_val;
+
+	if (at->num_dims == 1)
+	 {
+	 SLang_Object_Type a, c;
+	 if (at->data_type == SLANG_INT_TYPE)
+	 {
+		 int *ptr = (int *)at->index_fun (at, &idx);
+		 if (ptr == NULL)
+		 return -1;
+		 a.o_data_type = SLANG_INT_TYPE;
+		 a.v.int_val = *ptr;
+		 if (objb->o_data_type == SLANG_INT_TYPE)
+		 return int_int_binary (op, &a, objb);
+#if SLANG_HAS_FLOAT
+		 else if (objb->o_data_type == SLANG_DOUBLE_TYPE)
+		 {
+		 if (-1 == int_dbl_binary_result (op, &a, objb, &c))
+			 return -1;
+		 return push_object (&c);
+		 }
+#endif
+		 /* else handled below */
+	 }
+# if SLANG_HAS_FLOAT
+	 else if (at->data_type == SLANG_DOUBLE_TYPE)
+	 {
+		 double *ptr;
+
+		 ptr = (double *)at->index_fun (at, &idx);
+		 if (ptr == NULL)
+		 return -1;
+
+		 a.o_data_type = SLANG_DOUBLE_TYPE;
+		 a.v.double_val = *ptr;
+
+		 if (objb->o_data_type == SLANG_DOUBLE_TYPE)
+		 return dbl_dbl_binary (op, &a, objb);
+		 else if (objb->o_data_type == SLANG_INT_TYPE)
+		 {
+		 if (-1 == dbl_int_binary_result (op, &a, objb, &c))
+			 return -1;
+		 return push_object (&c);
+		 }
+		 /* else handled below */
+	 }
+# endif
+	 if (-1 == _pSLarray1d_push_elem (at, idx))
+	 return -1;
+	 return do_binary_b (op, objb);
+	 }
+ }
+
+ if (-1 == push_array_element (lvaridx, idx))
+ return -1;
+
+ return do_binary_b (op, objb);
+}
+#endif
+
+static int dereference_object (void)
+{
+ SLang_Object_Type obj;
+ SLang_Class_Type *cl;
+ SLtype type;
+ int ret;
+
+ if (-1 == pop_object(&obj))
+ return -1;
+
+ type = obj.o_data_type;
+
+ GET_CLASS(cl,type);
+ ret = (*cl->cl_dereference)(type, (VOID_STAR) &obj.v);
+
+ free_object (&obj, cl);
+ return ret;
+}
+
+/* This function gets called with the stack of the form:
+ * ... func __args ...
+ * We need to pop func from within the stack.
+ */
+/* End the argument list, and make the function call */
+static int deref_fun_call (int linenum)
+{
+ SLang_Object_Type obj;
+
+ if (-1 == end_arg_list ())
+ return -1;
+
+ if (-1 == roll_stack (-(Next_Function_Num_Args + 1)))
+ return -1;
+
+ if (-1 == pop_object(&obj))
+ return -1;
+
+ return deref_call_object (&obj, linenum);
+}
+
+static int obsolete_deref_fun_call (int linenum)
+{
+ SLang_Object_Type obj;
+
+ if (-1 == end_arg_list ())
+ return -1;
+
+ Next_Function_Num_Args--; /* do not include function to be derefed. */
+
+ if (-1 == pop_object(&obj))
+ return -1;
+
+ return deref_call_object (&obj, linenum);
+}
+
+static int case_function (void)
+{
+ SLang_Object_Type a_obj;
+ SLang_Object_Type *swobjptr;
+ int eqs;
+
+ swobjptr = Switch_Obj_Ptr - 1;
+
+ if ((swobjptr < Switch_Objects)
+ || (0 == swobjptr->o_data_type))
+ {
+	_pSLang_verror (SL_SYNTAX_ERROR, "Misplaced 'case' keyword");
+	return -1;
+ }
+
+ if (-1 == pop_object(&a_obj))
+ return -1;
+
+ eqs = _pSLclass_obj_eqs (&a_obj, swobjptr);
+ SLang_free_object (&a_obj);
+
+ if (eqs == -1)
+ return -1;
+
+ return push_int_object (SLANG_INT_TYPE, eqs);
+}
+
+static void tmp_variable_function (SLBlock_Type *addr)
+{
+ SLang_Object_Type *obj;
+
+ switch (addr->bc_sub_type)
+ {
+ case SLANG_GVARIABLE:
+ case SLANG_PVARIABLE:
+	obj = &addr->b.nt_gvar_blk->obj;
+	break;
+
+ case SLANG_LVARIABLE:
+	obj = Local_Variable_Frame - addr->b.i_blk;
+	break;
+
+ default:
+	(void) SLang_set_error (SL_INTERNAL_ERROR);
+	return;
+ }
+
+ /* There is no need to go through higher level routines since we are
+ * not creating or destroying extra copies.
+ */
+ if (-1 == push_object (obj))
+ return;
+
+ obj->o_data_type = SLANG_UNDEFINED_TYPE;
+ obj->v.ptr_val = NULL;
+}
+
+static
+int _pSLang_parse_dollar_string (SLFUTURE_CONST char *str, char ***argvp, unsigned int *argcp)
+{
+ unsigned int len;
+ SLFUTURE_CONST char *s;
+ char *fmt;
+ char **argv;
+ char ch;
+ unsigned int num_dollars;
+ unsigned int i, argc;
+
+ len = 0;
+ num_dollars = 1;		 /* allow for argv0=fmt */
+ s = str;
+ while ((ch = *s++) != 0)
+ {
+	len++;
+	if (ch == '%')
+	 {
+	 len++;
+	 continue;
+	 }
+	if (ch == '$')
+	 {
+	 num_dollars++;
+	 continue;
+	 }
+ }
+ fmt = (char *)SLmalloc (len+1);
+ if (fmt == NULL)
+ return -1;
+
+ argv = (char **)SLcalloc (sizeof (char *), num_dollars);
+ if (argv == NULL)
+ {
+	SLfree (fmt);
+	return -1;
+ }
+
+ argc = 0;
+ argvargc = fmt;
+ argc++;
+
+ s = str;
+ while ((ch = *s++) != 0)
+ {
+	SLFUTURE_CONST char *s0, *s1;
+	char *arg;
+
+	if (ch != '$')
+	 {
+	 *fmt++ = ch;
+	 if (ch == '%')
+	 *fmt++ = ch;
+	 continue;
+	 }
+	ch = *s++;
+	if (ch == '$')
+	 {
+	 *fmt++ = '$';
+	 continue;
+	 }
+	if (ch == 0)
+	 {
+	 *fmt++ = '$';
+	 break;
+	 }
+
+	if ((ch != '_')
+	 && (0 == SLwchar_isalnum (ch)))
+	 {
+	 if (ch != '{')
+	 {
+		 *fmt++ = '$';
+		 *fmt++ = ch;
+		 continue;
+	 }
+	 s0 = s;
+	 while (*s && (*s != '}'))
+	 s++;
+	 if (*s == 0)
+	 {
+		 _pSLang_verror (SL_SYNTAX_ERROR, "Unable to find matching }");
+		 goto return_error;
+	 }
+	 s1 = s + 1;
+	 }
+	else
+	 {
+	 s0 = s-1;
+	 if (SLwchar_isdigit (ch)) /* e.g., $1 */
+	 s0--;
+
+	 while ((*s == '_')
+		 || SLwchar_isalnum (*s))
+	 s++;
+	 s1 = s;
+	 }
+
+	if (NULL == (arg = SLmake_nstring (s0, s-s0)))
+	 goto return_error;
+
+	argvargc = arg;
+	argc++;
+
+	*fmt++ = '%';
+	*fmt++ = 'S';
+
+	s = s1;
+ }
+ *fmt = 0;
+
+ *argvp = argv;
+ *argcp = argc;
+ return 0;
+
+ return_error:
+ for (i = 0; i < argc; i++)
+ SLfree (argvi);
+ SLfree ((char *)argv);
+ return -1;
+}
+
+/* Convert "bla bla $foo bla" to sprintf ("bla bla %S bla", foo)
+ */
+int _pSLpush_dollar_string (SLFUTURE_CONST char *str)
+{
+ /* return SLang_push_string (str); */
+ char **argv;
+ unsigned int argc;
+ unsigned int i;
+ SLang_NameSpace_Type *private_ns, *static_ns;
+ int status = -1;
+
+ if (-1 == _pSLang_parse_dollar_string (str, &argv, &argc))
+ return -1;
+
+ if (-1 == SLang_push_string (argv0))
+ goto free_return;
+
+ if (Current_Function_Header == NULL)
+ {
+	private_ns = This_Private_NameSpace;
+	static_ns = This_Static_NameSpace;
+ }
+ else
+ {
+	private_ns = Current_Function_Header->private_ns;
+	static_ns = Current_Function_Header->static_ns;
+ }
+
+ for (i = 1; i < argc; i++)
+ {
+	char *name = argvi;
+	SLang_Name_Type *nt;
+	SLFUTURE_CONST char *env;
+	int j;
+
+	if (*name == 0)
+	 {
+	 if (-1 == SLang_push_string (name))
+	 goto free_return;
+
+	 continue;
+	 }
+
+	j = find_local_variable_index (Current_Function_Header, name);
+	if (j != -1)
+	 {
+	 if (-1 == push_local_variable (j))
+	 goto free_return;
+
+	 continue;
+	 }
+	if (NULL != (nt = find_global_name (name, private_ns, static_ns, Global_NameSpace, 0)))
+	 {
+	 if (-1 == push_nametype_variable (nt))
+	 goto free_return;
+	 continue;
+	 }
+
+	/* Assume it is an environment variable */
+	env = getenv (name);
+	if (env == NULL)
+	 env = "";
+	if (-1 == SLang_push_string (env))
+	 goto free_return;
+ }
+
+ status = _pSLstrops_do_sprintf_n (argc-1);
+ /* drop */
+
+ free_return:
+ for (i = 0; i < argc; i++)
+ SLfree (argvi);
+
+ SLfree ((char *) argv);
+ return status;
+}
+
+static int
+do_inner_interp_error (SLBlock_Type *err_block,
+		 SLBlock_Type *addr_start,
+		 SLBlock_Type *addr)
+{
+ SLFUTURE_CONST char *file = NULL, *funname = NULL;
+ int line;
+
+ /* Someday I can use the theses variable to provide extra information
+ * about what went wrong.
+ */
+ (void) addr_start;
+ (void) addr;
+
+ if (Current_Function_Header != NULL)
+ {
+	file = Current_Function_Header->file;
+	funname = Current_Function->name;
+ }
+ else file = This_Compile_Filename;
+
+ line = addr->linenum;
+
+/* #if SLANG_HAS_BOSEOS && SLANG_HAS_DEBUGGER_SUPPORT */
+/* if (SLang_get_error () == SL_USER_BREAK) */
+/* (void) _pSLcall_debug_hook (file, linenum); */
+/* #endif */
+
+ if (err_block == NULL)
+ goto return_error;
+
+ if (-1 == _pSLang_push_error_context ())
+ goto return_error;
+
+ inner_interp (err_block->b.blk);
+
+ (void) _pSLang_pop_error_context (0);
+ if (SLang_get_error () == 0)
+ return 0;
+
+ return_error:
+#if SLANG_HAS_DEBUG_CODE
+ if ((_pSLang_Error == SL_USAGE_ERROR)
+ && (SLang_Traceback == SL_TB_NONE))
+ return -1;
+
+ if (file != NULL)
+ (void) _pSLerr_set_line_info (file, line, funname);
+#endif
+ return -1;
+}
+
+#define GATHER_STATISTICS 0
+#if GATHER_STATISTICS
+static unsigned int Bytecodes0xFFFF;
+
+static void print_stats (void)
+{
+ unsigned int i;
+ unsigned long total;
+ FILE *fp = fopen ("stats.txt", "w");
+ if (fp == NULL)
+ return;
+
+ total = 0;
+ for (i = 0; i < 0xFFFF; i++)
+ total += Bytecodesi;
+
+ if (total == 0)
+ total = 1;
+
+ for (i = 0; i < 0xFFFF; i++)
+ {
+	if (Bytecodesi)
+	 fprintf (fp, "0x%04X %9u %e\n", i, Bytecodesi, Bytecodesi/(double) total);
+ }
+ fclose (fp);
+}
+
+static void add_to_statistics (SLBlock_Type *b)
+{
+ unsigned short x, y;
+
+ while (1)
+ {
+	x = b->bc_main_type;
+	if (x == 0)
+	 {
+	 Bytecodes0 += 1;
+	 return;
+	 }
+	b++;
+
+	while (SLANG_IS_BC_COMBINED(b->bc_main_type))
+	 b++;
+
+	y = b->bc_main_type;
+
+	Bytecodes(x << 8) | y += 1;
+ }
+}
+
+#endif
+
+#define EXECUTE_INTRINSIC(addr) \
+ { \
+ SLang_Intrin_Fun_Type *f = (addr)->b.nt_ifun_blk; \
+ if ((f->num_args == 0) && (f->return_type == SLANG_VOID_TYPE) && (Trace_Mode == 0)) \
+	{ \
+	 if (0 == _pSL_increment_frame_pointer ()) \
+	 { \
+		((VF0_Type) f->i_fun)(); \
+		(void) _pSL_decrement_frame_pointer (); \
+	 } \
+	} \
+ else execute_intrinsic_fun (f); \
+ }
+
+/* inner interpreter */
+/* The return value from this function is only meaningful when it is used
+ * to process blocks for the switch statement. If it returns 0, the calling
+ * routine should pass the next block to it. Otherwise it will
+ * return non-zero, with or without error.
+ */
+static int inner_interp (SLBlock_Type *addr_start)
+{
+ SLBlock_Type *block, *err_block, *addr;
+#if GATHER_STATISTICS
+ static int inited = 0;
+
+ if (inited == 0)
+ {
+	(void) SLang_add_cleanup_function (print_stats);
+	inited = 1;
+ }
+#endif
+
+ /* for systems that have no real interrupt facility (e.g. go32 on dos) */
+ if (SLang_Interrupt != NULL) (*SLang_Interrupt)();
+
+ block = err_block = NULL;
+ addr = addr_start;
+
+ if (IS_SLANG_ERROR)
+ {
+	(void) do_inner_interp_error (err_block, addr_start, addr);
+	return 0;
+ }
+
+#if GATHER_STATISTICS
+ add_to_statistics (addr);
+#endif
+ /* Moving addr++ to top of switch instead of bottom was suggested by
+ * Paul Boekholt to improve branch-prediction.
+ */
+ addr--;
+
+ while (1)
+ {
+	addr++;
+	switch (addr->bc_main_type)
+	 {
+	 case SLANG_BC_LAST_BLOCK:
+	 goto return_1;
+	 case SLANG_BC_LVARIABLE:
+	 PUSH_LOCAL_VARIABLE (addr->b.i_blk)
+	 break;
+	 case SLANG_BC_GVARIABLE:
+	 if (-1 == _pSLpush_slang_obj (&addr->b.nt_gvar_blk->obj))
+	 do_name_type_error (addr->b.nt_blk);
+	 break;
+
+	 case SLANG_BC_IVARIABLE:
+	 case SLANG_BC_RVARIABLE:
+	 push_intrinsic_variable (addr->b.nt_ivar_blk);
+	 break;
+
+	 case SLANG_BC_INTRINSIC:
+	 EXECUTE_INTRINSIC(addr)
+	 if (IS_SLANG_ERROR)
+	 do_traceback(addr->b.nt_ifun_blk->name);
+	 break;
+
+	 case SLANG_BC_FUNCTION:
+	 execute_slang_fun (addr->b.nt_fun_blk, addr->linenum);
+	 if (Lang_Break_Condition) goto handle_break_condition;
+	 break;
+
+	 case SLANG_BC_MATH_UNARY:
+	 case SLANG_BC_APP_UNARY:
+	 case SLANG_BC_ARITH_UNARY:
+	 /* Make sure we treat these like function calls since the
+	 * parser took abs(x), sin(x), etc to be a function call.
+	 */
+	 if (0 == _pSL_increment_frame_pointer ())
+	 {
+		 do_app_unary (addr->b.nt_unary_blk);
+		 (void) _pSL_decrement_frame_pointer ();
+	 }
+	 break;
+
+	 case SLANG_BC_ARITH_BINARY:
+	 /* Make sure we treat these like function calls since the
+	 * parser took _op_eqs, etc as function calls.
+	 */
+	 if (0 == _pSL_increment_frame_pointer ())
+	 {
+		 do_arith_binary (addr->b.nt_binary_blk);
+		 (void) _pSL_decrement_frame_pointer ();
+	 }
+	 break;
+
+	 case SLANG_BC_ICONST:
+	 push_int_object (addr->b.iconst_blk->data_type, addr->b.iconst_blk->value);
+	 break;
+
+#if SLANG_HAS_FLOAT
+	 case SLANG_BC_DCONST:
+	 push_double_object (SLANG_DOUBLE_TYPE, addr->b.dconst_blk->d);
+	 break;
+	 case SLANG_BC_FCONST:
+	 SLclass_push_float_obj (SLANG_FLOAT_TYPE, addr->b.fconst_blk->f);
+	 break;
+#endif
+#ifdef HAVE_LONG_LONG
+	 case SLANG_BC_LLCONST:
+	 SLclass_push_llong_obj (addr->b.llconst_blk->data_type, addr->b.llconst_blk->value);
+	 break;
+#endif
+	 case SLANG_BC_PVARIABLE:
+	 if (-1 == _pSLpush_slang_obj (&addr->b.nt_gvar_blk->obj))
+	 do_name_type_error (addr->b.nt_blk);
+	 break;
+
+	 case SLANG_BC_PFUNCTION:
+	 execute_slang_fun (addr->b.nt_fun_blk, addr->linenum);
+	 if (Lang_Break_Condition) goto handle_break_condition;
+	 break;
+	 case SLANG_BC_HCONST:
+	 SLclass_push_short_obj (addr->b.iconst_blk->data_type, addr->b.hconst_blk->value);
+	 break;
+	 case SLANG_BC_LCONST:
+	 SLclass_push_long_obj (addr->b.iconst_blk->data_type, addr->b.lconst_blk->value);
+	 break;
+
+#if USE_UNUSED_BYCODES_IN_SWITCH
+# ifndef HAVE_LONG_LONG
+	 case SLANG_BC_LLCONST:
+# endif
+	 case SLANG_BC_UNUSED_0x13:
+	 case SLANG_BC_UNUSED_0x14:
+	 case SLANG_BC_UNUSED_0x15:
+	 case SLANG_BC_UNUSED_0x16:
+	 case SLANG_BC_UNUSED_0x17:
+	 case SLANG_BC_UNUSED_0x18:
+	 case SLANG_BC_UNUSED_0x19:
+	 case SLANG_BC_UNUSED_0x1A:
+	 case SLANG_BC_UNUSED_0x1B:
+	 case SLANG_BC_UNUSED_0x1C:
+	 case SLANG_BC_UNUSED_0x1D:
+	 case SLANG_BC_UNUSED_0x1E:
+	 case SLANG_BC_UNUSED_0x1F:
+	 _pSLang_verror (SL_INTERNAL_ERROR, "Byte-Code 0x%X is not valid", addr->bc_main_type);
+	 break;
+#endif
+	 case SLANG_BC_SET_LOCAL_LVALUE:
+	 set_lvalue_obj (addr->bc_sub_type, Local_Variable_Frame - addr->b.i_blk);
+	 break;
+	 case SLANG_BC_SET_GLOBAL_LVALUE:
+	 if (-1 == set_lvalue_obj (addr->bc_sub_type, &addr->b.nt_gvar_blk->obj))
+	 do_name_type_error (addr->b.nt_blk);
+	 break;
+	 case SLANG_BC_SET_INTRIN_LVALUE:
+	 set_intrin_lvalue (addr);
+	 break;
+	 case SLANG_BC_SET_STRUCT_LVALUE:
+	 set_struct_lvalue (addr);
+	 break;
+	 case SLANG_BC_SET_ARRAY_LVALUE:
+	 set_array_lvalue (addr->bc_sub_type);
+	 break;
+	 case SLANG_BC_SET_DEREF_LVALUE:
+	 set_deref_lvalue (addr->bc_sub_type);
+	 break;
+
+	 case SLANG_BC_FIELD:
+	 (void) push_struct_field (addr->b.s_blk);
+	 break;
+	 case SLANG_BC_METHOD:
+	 do_struct_method (addr->b.s_blk, addr->linenum);
+	 break;
+#if SLANG_OPTIMIZE_FOR_SPEED
+	 case SLANG_BC_LVARIABLE_AGET:
+	 {
+		 SLang_Object_Type *obj = Local_Variable_Frame - addr->b.i_blk;
+		 if (0 == carefully_push_object (obj))
+		 do_bc_call_direct_nargs (_pSLarray_aget);
+	 }
+	 break;
+
+	 case SLANG_BC_LVARIABLE_APUT:
+	 {
+		 SLang_Object_Type *obj = Local_Variable_Frame - addr->b.i_blk;
+		 if (0 == carefully_push_object (obj))
+		 do_bc_call_direct_nargs (_pSLarray_aput);
+	 }
+	 break;
+#else
+	 case SLANG_BC_LVARIABLE_AGET:
+	 case SLANG_BC_LVARIABLE_APUT:
+	 _pSLang_verror (SL_INTERNAL_ERROR, "Byte-Code 0x%X is not valid", addr->bc_main_type);
+	 break;
+#endif
+	 case SLANG_BC_LOBJPTR:
+	 (void)push_lv_as_ref (Local_Variable_Frame - addr->b.i_blk);
+	 break;
+
+	 case SLANG_BC_GOBJPTR:
+	 (void)_pSLang_push_nt_as_ref (addr->b.nt_blk);
+	 break;
+
+	 case SLANG_BC_FIELD_REF:
+	 (void) _pSLstruct_push_field_ref (addr->b.s_blk);
+	 break;
+
+	 case SLANG_BC_OBSOLETE_DEREF_FUN_CALL:
+	 (void) obsolete_deref_fun_call (addr->linenum);
+	 break;
+
+	 case SLANG_BC_DEREF_FUN_CALL:
+	 (void) deref_fun_call (addr->linenum);
+	 break;
+
+#if USE_UNUSED_BYCODES_IN_SWITCH
+	 case SLANG_BC_UNUSED_0x2F:
+	 case SLANG_BC_UNUSED_0x30:
+	 case SLANG_BC_UNUSED_0x31:
+	 case SLANG_BC_UNUSED_0x32:
+	 case SLANG_BC_UNUSED_0x33:
+	 case SLANG_BC_UNUSED_0x34:
+	 case SLANG_BC_UNUSED_0x35:
+	 case SLANG_BC_UNUSED_0x36:
+	 case SLANG_BC_UNUSED_0x37:
+	 case SLANG_BC_UNUSED_0x38:
+	 case SLANG_BC_UNUSED_0x39:
+	 case SLANG_BC_UNUSED_0x3A:
+	 case SLANG_BC_UNUSED_0x3B:
+	 case SLANG_BC_UNUSED_0x3C:
+	 case SLANG_BC_UNUSED_0x3D:
+	 case SLANG_BC_UNUSED_0x3E:
+	 case SLANG_BC_UNUSED_0x3F:
+	 _pSLang_verror (SL_INTERNAL_ERROR, "Byte-Code 0x%X is not valid", addr->bc_main_type);
+	 break;
+#endif
+	 case SLANG_BC_LITERAL:
+#if !SLANG_OPTIMIZE_FOR_SPEED
+	 case SLANG_BC_LITERAL_INT:
+# if SLANG_HAS_FLOAT
+	 case SLANG_BC_LITERAL_DBL:
+# endif
+	 case SLANG_BC_LITERAL_STR:
+#endif
+	 {
+		 SLang_Class_Type *cl;
+
+		 /* No user types should be here */
+		 GET_BUILTIN_CLASS(cl, addr->bc_sub_type);
+		 (*cl->cl_push_literal) (addr->bc_sub_type, (VOID_STAR) &addr->b.ptr_blk);
+	 }
+	 break;
+#if SLANG_OPTIMIZE_FOR_SPEED
+	 case SLANG_BC_LITERAL_INT:
+	 push_int_object (addr->bc_sub_type, (int) addr->b.l_blk);
+	 break;
+#if SLANG_HAS_FLOAT
+	 case SLANG_BC_LITERAL_DBL:
+	 push_double_object (addr->bc_sub_type, *addr->b.double_blk);
+	 break;
+#endif
+	 case SLANG_BC_LITERAL_STR:
+	 _pSLang_dup_and_push_slstring (addr->b.s_blk);
+	 break;
+#endif
+	 case SLANG_BC_DOLLAR_STR:
+	 (void) _pSLpush_dollar_string (addr->b.s_blk);
+	 break;
+
+#if USE_UNUSED_BYCODES_IN_SWITCH
+	 case SLANG_BC_UNUSED_0x45:
+	 case SLANG_BC_UNUSED_0x46:
+	 case SLANG_BC_UNUSED_0x47:
+	 case SLANG_BC_UNUSED_0x48:
+	 case SLANG_BC_UNUSED_0x49:
+	 case SLANG_BC_UNUSED_0x4A:
+	 case SLANG_BC_UNUSED_0x4B:
+	 case SLANG_BC_UNUSED_0x4C:
+	 case SLANG_BC_UNUSED_0x4D:
+	 case SLANG_BC_UNUSED_0x4E:
+	 case SLANG_BC_UNUSED_0x4F:
+	 _pSLang_verror (SL_INTERNAL_ERROR, "Byte-Code 0x%X is not valid", addr->bc_main_type);
+	 break;
+#endif
+	 case SLANG_BC_UNARY:
+	 do_unary (addr->b.i_blk, SLANG_BC_UNARY);
+	 break;
+
+	 case SLANG_BC_BINARY:
+	 (void) do_binary (addr->b.i_blk);
+	 break;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+	 case SLANG_BC_INTEGER_PLUS:
+	 if (0 == push_int_object (addr->bc_sub_type, (int) addr->b.l_blk))
+	 (void) do_binary (SLANG_PLUS);
+	 break;
+
+	 case SLANG_BC_INTEGER_MINUS:
+	 if (0 == push_int_object (addr->bc_sub_type, (int) addr->b.l_blk))
+	 (void) do_binary (SLANG_MINUS);
+	 break;
+#endif
+#if USE_UNUSED_BYCODES_IN_SWITCH
+# if !SLANG_OPTIMIZE_FOR_SPEED
+	 case SLANG_BC_INTEGER_PLUS:
+	 case SLANG_BC_INTEGER_MINUS:
+	 break;
+# endif
+	 case SLANG_BC_UNUSED_0x54:
+	 case SLANG_BC_UNUSED_0x55:
+	 case SLANG_BC_UNUSED_0x56:
+	 case SLANG_BC_UNUSED_0x57:
+	 case SLANG_BC_UNUSED_0x58:
+	 case SLANG_BC_UNUSED_0x59:
+	 case SLANG_BC_UNUSED_0x5A:
+	 case SLANG_BC_UNUSED_0x5B:
+	 case SLANG_BC_UNUSED_0x5C:
+	 case SLANG_BC_UNUSED_0x5D:
+	 case SLANG_BC_UNUSED_0x5E:
+	 case SLANG_BC_UNUSED_0x5F:
+	 _pSLang_verror (SL_INTERNAL_ERROR, "Byte-Code 0x%X is not valid", addr->bc_main_type);
+	 break;
+#endif
+	 case SLANG_BC_TMP:
+	 tmp_variable_function (addr);
+	 break;
+	 case SLANG_BC_EXCH:
+	 (void) SLreverse_stack (2);
+	 break;
+	 case SLANG_BC_LABEL:
+	 {
+		 int test;
+		 if ((0 == pop_int (&test))
+		 && (test == 0))
+		 goto return_0;
+	 }
+	 break;
+
+	 case SLANG_BC_BLOCK:
+#if SLANG_OPTIMIZE_FOR_SPEED
+	 while ((addr->bc_main_type == SLANG_BC_BLOCK)
+		 && (addr->bc_sub_type == 0))
+	 {
+		 if (block == NULL)
+		 block = addr;
+
+		 addr++;
+	 }
+	 if (addr->bc_main_type != SLANG_BC_BLOCK)
+	 {
+		 addr--;
+		 break;
+	 }
+#endif
+	 switch (addr->bc_sub_type) /*{{{*/
+	 {
+		case SLANG_BCST_ERROR_BLOCK:
+		 err_block = addr;
+		 break;
+
+		case SLANG_BCST_EXIT_BLOCK:
+		 Exit_Block_Ptr = addr->b.blk;
+		 break;
+
+		case SLANG_BCST_USER_BLOCK0:
+		case SLANG_BCST_USER_BLOCK1:
+		case SLANG_BCST_USER_BLOCK2:
+		case SLANG_BCST_USER_BLOCK3:
+		case SLANG_BCST_USER_BLOCK4:
+		 User_Block_Ptraddr->bc_sub_type - SLANG_BCST_USER_BLOCK0 = addr->b.blk;
+		 break;
+
+		case SLANG_BCST_LOOP:
+		case SLANG_BCST_WHILE:
+		case SLANG_BCST_FOR:
+		case SLANG_BCST_FOREVER:
+		case SLANG_BCST_CFOR:
+		case SLANG_BCST_DOWHILE:
+		case SLANG_BCST_FOREACH:
+		case SLANG_BCST_FOREACH_EARGS:
+		 {
+		 int status;
+		 SLBlock_Type *addr1 = addr + 1;
+		 if (block == NULL) block = addr;
+
+		 status = lang_do_loops(addr->bc_sub_type, block, 1 + (unsigned int) (addr - block));
+		 block = NULL;
+		 while (addr1->bc_main_type == SLANG_BC_BLOCK)
+			 {
+			 if (addr1->bc_sub_type == SLANG_BCST_LOOP_THEN)
+			 {
+				 addr = addr1;
+				 if (status == 0)
+				 inner_interp (addr->b.blk);
+				 addr1++;
+				 continue;
+			 }
+#ifdef LOOP_ELSE_TOKEN
+			 if (addr1->bc_sub_type == SLANG_BCST_LOOP_ELSE)
+			 {
+				 addr = addr1;
+				 if (status == 1)
+				 inner_interp (addr->b.blk);
+				 addr1++;
+				 continue;
+			 }
+#endif
+			 break;
+			 }
+		 }
+		 break;
+
+		case SLANG_BCST_IFNOT:
+#if SLANG_OPTIMIZE_FOR_SPEED
+		 {
+		 int i;
+
+		 if ((0 == pop_ctrl_integer (&i)) && (i == 0))
+			 inner_interp (addr->b.blk);
+		 }
+#else
+		 do_else_if (addr, NULL);
+#endif
+		 break;
+
+		case SLANG_BCST_IF:
+#if SLANG_OPTIMIZE_FOR_SPEED
+		 {
+		 int i;
+
+		 if ((0 == pop_ctrl_integer (&i)) && i)
+			 inner_interp (addr->b.blk);
+		 }
+#else
+		 do_else_if (NULL, addr);
+#endif
+		 break;
+
+		case SLANG_BCST_NOTELSE:
+		 do_else_if (block, addr);
+		 block = NULL;
+		 break;
+
+		case SLANG_BCST_ELSE:
+		 do_else_if (addr, block);
+		 block = NULL;
+		 break;
+
+		case SLANG_BCST_SWITCH:
+		 if (Switch_Obj_Ptr == Switch_Obj_Max)
+		 {
+		 _pSLang_verror (SL_BUILTIN_LIMIT_EXCEEDED, "switch nesting too deep");
+		 break;
+		 }
+		 (void) pop_object(Switch_Obj_Ptr);
+		 Switch_Obj_Ptr++;
+
+		 if (block == NULL) block = addr;
+		 while ((0 == IS_SLANG_ERROR)
+			 && (block <= addr)
+			 && (Lang_Break_Condition == 0)
+			 && (0 == inner_interp (block->b.blk)))
+		 block++;
+		 Switch_Obj_Ptr--;
+		 SLang_free_object (Switch_Obj_Ptr);
+		 Switch_Obj_Ptr->o_data_type = 0;
+		 block = NULL;
+		 break;
+
+		case SLANG_BCST_SC_AND:
+		 {
+		 int i;
+		 if ((0 == pop_ctrl_integer (&i)) && (i == 0))
+			 {
+			 (void) push_char_object (SLANG_CHAR_TYPE, 0);
+			 block = NULL;
+			 break;
+			 }
+		 }
+		 /* drop */
+		case SLANG_BCST_ANDELSE:
+		 if (block == NULL) block = addr;
+		 lang_do_and_orelse (0, block, addr);
+		 block = NULL;
+		 break;
+
+		case SLANG_BCST_SC_OR:
+		 {
+		 int i;
+		 if ((0 == pop_ctrl_integer (&i)) && i)
+			 {
+			 i = (i != 0);
+			 (void) push_char_object (SLANG_CHAR_TYPE, (char)i);
+			 block = NULL;
+			 break;
+			 }
+		 }
+		 /* drop */
+		case SLANG_BCST_ORELSE:
+		 if (block == NULL) block = addr;
+		 lang_do_and_orelse (1, block, addr);
+		 block = NULL;
+		 break;
+
+		case SLANG_BCST_TRY:
+		 do_try (block, addr);
+		 block = NULL;
+		 break;
+
+		case SLANG_BCST_COMPARE:
+		 do_compare (addr->b.blk);
+		 block = NULL;
+		 break;
+
+		default:
+		 if (block == NULL) block = addr;
+		 break;
+	 }
+
+/*}}}*/
+
+	 if (Lang_Break_Condition) goto handle_break_condition;
+	 break;
+	 /* End of SLANG_BC_BLOCK */
+
+	 case SLANG_BC_RETURN:
+	 Lang_Break_Condition = Lang_Return = Lang_Break = 1; goto return_1;
+	 case SLANG_BC_BREAK:
+	 Lang_Break_Condition = Lang_Break = 1; goto return_1;
+	 case SLANG_BC_CONTINUE:
+	 Lang_Break_Condition = /* Lang_Continue = */ 1; goto return_1;
+
+#if USE_UNUSED_BYCODES_IN_SWITCH
+	 case SLANG_BC_UNUSED_0x67:
+	 _pSLang_verror (SL_INTERNAL_ERROR, "Byte-Code 0x%X is not valid", addr->bc_main_type);
+	 break;
+#endif
+	 case SLANG_BC_BREAK_N:
+	 Lang_Break_Condition = Lang_Break = addr->b.i_blk;
+	 goto return_1;
+
+	 case SLANG_BC_CONTINUE_N:
+	 Lang_Break = -(addr->b.i_blk - 1);
+	 Lang_Break_Condition = 1;
+	 goto return_1;
+
+	 case SLANG_BC_X_ERROR:
+	 if (err_block != NULL)
+	 {
+		 inner_interp(err_block->b.blk);
+		 if (SLang_get_error ()) err_block = NULL;
+	 }
+	 else _pSLang_verror(SL_SYNTAX_ERROR, "No ERROR_BLOCK");
+	 if (Lang_Break_Condition) goto handle_break_condition;
+	 break;
+
+	 case SLANG_BC_X_USER0:
+	 case SLANG_BC_X_USER1:
+	 case SLANG_BC_X_USER2:
+	 case SLANG_BC_X_USER3:
+	 case SLANG_BC_X_USER4:
+	 if (User_Block_Ptraddr->bc_main_type - SLANG_BC_X_USER0 != NULL)
+	 {
+		 inner_interp(User_Block_Ptraddr->bc_main_type - SLANG_BC_X_USER0);
+	 }
+	 else _pSLang_verror(SL_SYNTAX_ERROR, "No block for X_USERBLOCK");
+	 if (Lang_Break_Condition) goto handle_break_condition;
+	 break;
+
+	 case SLANG_BC_CALL_DIRECT:
+	 (*addr->b.call_function) ();
+	 break;
+
+	 case SLANG_BC_CALL_DIRECT_FRAME:
+	 do_bc_call_direct_frame (addr->b.call_function);
+	 break;
+
+	 case SLANG_BC_CALL_DIRECT_NARGS:
+	 do_bc_call_direct_nargs (addr->b.call_function);
+	 break;
+
+	 case SLANG_BC_EARG_LVARIABLE:
+	 PUSH_LOCAL_VARIABLE(addr->b.i_blk)
+	 (void) end_arg_list ();
+	 break;
+#if USE_BC_LINE_NUM
+	 case SLANG_BC_LINE_NUM:
+	 break;
+#else
+# if USE_UNUSED_BYCODES_IN_SWITCH
+	 case SLANG_BC_UNUSED_0x74:
+	 _pSLang_verror (SL_INTERNAL_ERROR, "Byte-Code 0x%X is not valid", addr->bc_main_type);
+	 break;
+# endif
+#endif
+	 case SLANG_BC_BOS:
+#if SLANG_HAS_BOSEOS
+	 BOS_Stack_Depth++;
+	 This_Compile_Linenum = addr->b.line_info->linenum;
+	 (void) _pSLcall_bos_handler (addr->b.line_info->filename, addr->b.line_info->linenum);
+#endif
+	 break;
+	 case SLANG_BC_EOS:
+#if SLANG_HAS_BOSEOS
+	 This_Compile_Linenum = addr->linenum;
+	 (void) _pSLcall_eos_handler ();
+	 BOS_Stack_Depth--;
+#endif
+	 break;
+
+#if USE_UNUSED_BYCODES_IN_SWITCH
+	 case SLANG_BC_UNUSED_0x77:
+	 case SLANG_BC_UNUSED_0x78:
+	 case SLANG_BC_UNUSED_0x79:
+	 case SLANG_BC_UNUSED_0x7A:
+	 case SLANG_BC_UNUSED_0x7B:
+	 case SLANG_BC_UNUSED_0x7C:
+	 case SLANG_BC_UNUSED_0x7D:
+	 case SLANG_BC_UNUSED_0x7E:
+	 case SLANG_BC_UNUSED_0x7F:
+	 _pSLang_verror (SL_INTERNAL_ERROR, "Byte-Code 0x%X is not valid", addr->bc_main_type);
+	 break;
+#endif
+
+#if USE_COMBINED_BYTECODES
+	 case SLANG_BC_CALL_DIRECT_INTRINSIC:
+	 (*addr->b.call_function) ();
+	 addr++;
+	 EXECUTE_INTRINSIC(addr)
+	 if (IS_SLANG_ERROR)
+	 do_traceback(addr->b.nt_ifun_blk->name);
+	 break;
+
+	 case SLANG_BC_INTRINSIC_CALL_DIRECT:
+	 EXECUTE_INTRINSIC(addr)
+	 if (IS_SLANG_ERROR)
+	 {
+		 do_traceback(addr->b.nt_ifun_blk->name);
+		 break;
+	 }
+	 addr++;
+	 (*addr->b.call_function) ();
+	 break;
+
+	 case SLANG_BC_CALL_DIRECT_LSTR:
+	 (*addr->b.call_function) ();
+	 addr++;
+	 _pSLang_dup_and_push_slstring (addr->b.s_blk);
+	 break;
+
+	 case SLANG_BC_CALL_DIRECT_SLFUN:
+	 (*addr->b.call_function) ();
+	 addr++;
+	 execute_slang_fun (addr->b.nt_fun_blk, addr->linenum);
+	 if (Lang_Break_Condition) goto handle_break_condition;
+	 break;
+
+	 case SLANG_BC_CALL_DIRECT_RETINTR:
+	 (*addr->b.call_function) ();
+	 addr++;
+	 /* drop */
+	 case SLANG_BC_RET_INTRINSIC:
+	 EXECUTE_INTRINSIC (addr)
+	 if (0 == Handle_Interrupt)
+	 return 1;
+	 if (IS_SLANG_ERROR)
+	 do_traceback(addr->b.nt_ifun_blk->name);
+	 break;
+
+	 case SLANG_BC_CALL_DIRECT_EARG_LVAR:
+	 (*addr->b.call_function) ();
+	 addr++;
+	 PUSH_LOCAL_VARIABLE (addr->b.i_blk)
+	 (void) end_arg_list ();
+	 break;
+
+	 case SLANG_BC_CALL_DIRECT_LINT:
+	 (*addr->b.call_function) ();
+	 addr++;
+	 push_int_object (addr->bc_sub_type, (int) addr->b.l_blk);
+	 break;
+
+	 case SLANG_BC_CALL_DIRECT_LVAR:
+	 (*addr->b.call_function) ();
+	 addr++;
+	 PUSH_LOCAL_VARIABLE (addr->b.i_blk)
+	 break;
+
+	 case SLANG_BC_LLVARIABLE_BINARY:
+	 {
+		 SLang_Object_Type *obj1 = Local_Variable_Frame - (addr+1)->b.i_blk;
+		 SLang_Object_Type *obj2 = Local_Variable_Frame - (addr+2)->b.i_blk;
+		 if (obj1->o_data_type == obj2->o_data_type)
+		 {
+		 if (obj1->o_data_type == SLANG_INT_TYPE)
+			 (void) int_int_binary (addr->b.i_blk, obj1, obj2);
+# if SLANG_HAS_FLOAT
+		 else if (obj1->o_data_type == SLANG_DOUBLE_TYPE)
+			 (void) dbl_dbl_binary (addr->b.i_blk, obj1, obj2);
+# endif
+		 else
+			 (void) do_binary_ab_inc_ref (addr->b.i_blk, obj1, obj2);
+		 }
+		 else do_binary_ab_inc_ref (addr->b.i_blk, obj1, obj2);
+		 addr += 2;
+	 }
+	 break;
+
+	 case SLANG_BC_LGVARIABLE_BINARY:
+	 do_binary_ab_inc_ref (addr->b.i_blk,
+			 Local_Variable_Frame - (addr+1)->b.i_blk,
+			 &(addr+2)->b.nt_gvar_blk->obj);
+	 addr += 2;
+	 break;
+
+	 case SLANG_BC_GLVARIABLE_BINARY:
+	 do_binary_ab_inc_ref (addr->b.i_blk,
+			 &(addr+1)->b.nt_gvar_blk->obj,
+			 Local_Variable_Frame - (addr+2)->b.i_blk);
+	 addr += 2;
+	 break;
+	 case SLANG_BC_GGVARIABLE_BINARY:
+	 do_binary_ab_inc_ref (addr->b.i_blk,
+			 &(addr+1)->b.nt_gvar_blk->obj,
+			 &(addr+2)->b.nt_gvar_blk->obj);
+	 addr += 2;
+	 break;
+
+	 case SLANG_BC_LIVARIABLE_BINARY:
+	 {
+		 SLang_Object_Type o, *obj1;
+		 o.o_data_type = SLANG_INT_TYPE;
+		 o.v.int_val = (int) (addr+2)->b.l_blk;
+		 obj1 = Local_Variable_Frame - (addr+1)->b.i_blk;
+		 if (obj1->o_data_type == SLANG_INT_TYPE)
+		 (void) int_int_binary (addr->b.i_blk, obj1, &o);
+		 else
+		 do_binary_ab_inc_ref (addr->b.i_blk, obj1, &o);
+	 }
+	 addr += 2;
+	 break;
+# if SLANG_HAS_FLOAT
+	 case SLANG_BC_LDVARIABLE_BINARY:
+	 {
+		 SLang_Object_Type o, *obj1;
+		 o.o_data_type = SLANG_DOUBLE_TYPE;
+		 o.v.double_val = *(addr+2)->b.double_blk;
+		 obj1 = Local_Variable_Frame - (addr+1)->b.i_blk;
+		 if (obj1->o_data_type == SLANG_DOUBLE_TYPE)
+		 (void) dbl_dbl_binary (addr->b.i_blk, obj1, &o);
+		 else
+		 do_binary_ab_inc_ref (addr->b.i_blk, obj1, &o);
+	 }
+	 addr += 2;
+	 break;
+# endif
+	 case SLANG_BC_ILVARIABLE_BINARY:
+	 {
+		 SLang_Object_Type o, *obj1;
+		 o.o_data_type = SLANG_INT_TYPE;
+		 o.v.int_val = (int) (addr+1)->b.l_blk;
+		 obj1 = Local_Variable_Frame - (addr+2)->b.i_blk;
+		 if (obj1->o_data_type == SLANG_INT_TYPE)
+		 (void) int_int_binary (addr->b.i_blk, &o, obj1);
+		 else
+		 (void) do_binary_ab_inc_ref (addr->b.i_blk, &o, obj1);
+	 }
+	 addr += 2;
+	 break;
+# if SLANG_HAS_FLOAT
+	 case SLANG_BC_DLVARIABLE_BINARY:
+	 {
+		 SLang_Object_Type o, *obj1;
+		 o.o_data_type = SLANG_DOUBLE_TYPE;
+		 o.v.double_val = *(addr+1)->b.double_blk;
+		 obj1 = Local_Variable_Frame - (addr+2)->b.i_blk;
+		 if (obj1->o_data_type == SLANG_DOUBLE_TYPE)
+		 (void) dbl_dbl_binary (addr->b.i_blk, &o, obj1);
+		 else
+		 (void) do_binary_ab_inc_ref (addr->b.i_blk, &o, obj1);
+
+	 }
+	 addr += 2;
+	 break;
+# endif
+	 case SLANG_BC_LVARIABLE_BINARY:
+	 do_binary_b_inc_ref (addr->b.i_blk,
+			 Local_Variable_Frame - (addr+1)->b.i_blk);
+	 addr++;
+	 break;
+
+	 case SLANG_BC_GVARIABLE_BINARY:
+	 do_binary_b_inc_ref (addr->b.i_blk,
+			 &(addr+1)->b.nt_gvar_blk->obj);
+	 addr++;
+	 break;
+
+	 case SLANG_BC_LITERAL_INT_BINARY:
+	 {
+		 SLang_Object_Type o;
+		 o.o_data_type = SLANG_INT_TYPE;
+		 o.v.int_val = (int) (addr+1)->b.l_blk;
+		 (void) do_binary_b (addr->b.i_blk, &o);
+	 }
+	 addr++;
+	 break;
+# if SLANG_HAS_FLOAT
+	 case SLANG_BC_LITERAL_DBL_BINARY:
+	 {
+		 SLang_Object_Type o;
+		 o.o_data_type = SLANG_DOUBLE_TYPE;
+		 o.v.double_val = *(addr+1)->b.double_blk;
+		 (void) do_binary_b (addr->b.i_blk, &o);
+	 }
+	 addr++;
+	 break;
+# endif
+	 case SLANG_BC_LASSIGN_LLBINARY:
+	 (void) do_binary_ab_inc_ref_assign ((addr+1)->b.i_blk,
+						 Local_Variable_Frame - (addr+2)->b.i_blk,
+						 Local_Variable_Frame - (addr+3)->b.i_blk,
+						 Local_Variable_Frame - addr->b.i_blk);
+	 addr += 3;
+	 break;
+
+	 case SLANG_BC_LASSIGN_LIBINARY:
+	 {
+		 SLang_Object_Type o;
+		 o.o_data_type = SLANG_INT_TYPE;
+		 o.v.int_val = (int) (addr+3)->b.l_blk;
+
+		 (void) do_binary_ab_inc_ref_assign ((addr+1)->b.i_blk,
+						 Local_Variable_Frame - (addr+2)->b.i_blk,
+						 &o,
+						 Local_Variable_Frame - addr->b.i_blk);
+	 }
+	 addr += 3;
+	 break;
+	 case SLANG_BC_LASSIGN_ILBINARY:
+	 {
+		 SLang_Object_Type o;
+		 o.o_data_type = SLANG_INT_TYPE;
+		 o.v.int_val = (int) (addr+2)->b.l_blk;
+
+		 (void) do_binary_ab_inc_ref_assign ((addr+1)->b.i_blk,
+						 &o,
+						 Local_Variable_Frame - (addr+3)->b.i_blk,
+						 Local_Variable_Frame - addr->b.i_blk);
+	 }
+	 addr += 3;
+	 break;
+# if SLANG_HAS_FLOAT
+	 case SLANG_BC_LASSIGN_LDBINARY:
+	 {
+		 SLang_Object_Type o;
+		 o.o_data_type = SLANG_DOUBLE_TYPE;
+		 o.v.double_val = *(addr+3)->b.double_blk;
+
+		 (void) do_binary_ab_inc_ref_assign ((addr+1)->b.i_blk,
+						 Local_Variable_Frame - (addr+2)->b.i_blk,
+						 &o,
+						 Local_Variable_Frame - addr->b.i_blk);
+	 }
+	 addr += 3;
+	 break;
+	 case SLANG_BC_LASSIGN_DLBINARY:
+	 {
+		 SLang_Object_Type o;
+		 o.o_data_type = SLANG_DOUBLE_TYPE;
+		 o.v.double_val = *(addr+2)->b.double_blk;
+
+		 (void) do_binary_ab_inc_ref_assign ((addr+1)->b.i_blk,
+						 &o,
+						 Local_Variable_Frame - (addr+3)->b.i_blk,
+						 Local_Variable_Frame - addr->b.i_blk);
+	 }
+	 addr += 3;
+	 break;
+# endif
+	 case SLANG_BC_RET_LVARIABLE:
+	 if (0 != push_local_variable (addr->b.i_blk))
+	 break;
+	 Lang_Break_Condition = Lang_Return = Lang_Break = 1;
+	 goto return_1;
+
+	 case SLANG_BC_RET_LITERAL_INT:
+	 if (-1 == push_int_object (addr->bc_sub_type, (int) addr->b.l_blk))
+	 break;
+	 Lang_Break_Condition = Lang_Return = Lang_Break = 1;
+	 goto return_1;
+
+	 case SLANG_BC_MANY_LVARIABLE:
+	 (void) push_local_variable (addr->b.i_blk);
+	 addr++;
+	 (void) push_local_variable (addr->b.i_blk);
+	 addr++;
+	 while (addr->bc_main_type == SLANG_BC_LVARIABLE_COMBINED)
+	 {
+		 (void) push_local_variable (addr->b.i_blk);
+		 addr++;
+	 }
+	 addr--;
+	 break;
+
+	 case SLANG_BC_MANY_LVARIABLE_DIR:
+	 (void) push_local_variable (addr->b.i_blk);
+	 addr++;
+	 (void) push_local_variable (addr->b.i_blk);
+	 addr++;
+	 while (addr->bc_main_type == SLANG_BC_LVARIABLE_COMBINED)
+	 {
+		 (void) push_local_variable (addr->b.i_blk);
+		 addr++;
+	 }
+	 (*addr->b.call_function) ();
+	 break;
+
+	 case SLANG_BC_LVARIABLE_AGET1:
+	 {
+		 SLang_Object_Type *o;
+
+		 addr++;		 /* not used */
+		 o = (Local_Variable_Frame - addr->b.i_blk);
+		 if (o->o_data_type == SLANG_INT_TYPE)
+		 {
+		 addr++;
+		 (void) push_array_element (addr->b.i_blk, o->v.int_val);
+		 break;
+		 }
+		 if (-1 == push_local_variable (addr->b.i_blk))
+		 break;
+		 addr++;
+		 if (-1 == push_local_variable (addr->b.i_blk))
+		 break;
+		 (void) _pSLarray_aget1 (1);
+		 break;
+	 }
+
+	 case SLANG_BC_LITERAL_AGET1:
+	 addr++;		 /* not used */
+	 push_array_element ((addr+1)->b.i_blk, (int) addr->b.l_blk);
+	 addr++;
+	 break;
+
+	 case SLANG_BC_LVAR_LVAR_APUT1:
+	 if (-1 == push_local_variable (addr->b.i_blk))
+	 break;
+	 addr++;
+	 /* drop */
+	 case SLANG_BC_LVARIABLE_APUT1:
+	 {
+		 SLang_Object_Type *o;
+
+		 addr++;		 /* not used */
+		 o = (Local_Variable_Frame - addr->b.i_blk);
+		 if (o->o_data_type == SLANG_INT_TYPE)
+		 {
+		 addr++;
+		 (void) pop_to_lvar_array_element (addr->b.i_blk, o->v.int_val);
+		 break;
+		 }
+		 if (-1 == push_local_variable (addr->b.i_blk))
+		 break;
+		 addr++;
+		 if (-1 == push_local_variable (addr->b.i_blk))
+		 break;
+		 (void) _pSLarray_aput1 (1);
+	 }
+	 break;
+
+	 case SLANG_BC_LITERAL_APUT1:
+	 (void) pop_to_lvar_array_element ((addr+2)->b.i_blk, (SLindex_Type)((addr+1)->b.l_blk));
+	 addr += 2;
+	 break;
+
+	 case SLANG_BC_LLVARIABLE_BINARY2:
+	 {
+		 SLang_Object_Type *obj1 = Local_Variable_Frame - (addr+1)->b.i_blk;
+		 SLang_Object_Type *obj2 = Local_Variable_Frame - (addr+2)->b.i_blk;
+		 SLang_Object_Type obj3;
+
+		 if (obj1->o_data_type == obj2->o_data_type)
+		 {
+		 if (obj1->o_data_type == SLANG_INT_TYPE)
+			 {
+			 if (-1 == int_int_binary_result (addr->b.i_blk, obj1, obj2, &obj3))
+			 break;
+			 addr += 3;
+			 (void) do_binary_b (addr->b.i_blk, &obj3);
+			 break;
+			 }
+# if SLANG_HAS_FLOAT
+		 else if (obj1->o_data_type == SLANG_DOUBLE_TYPE)
+			 {
+			 if (-1 == dbl_dbl_binary_result (addr->b.i_blk, obj1, obj2, &obj3))
+			 break;
+			 addr += 3;
+			 (void) do_binary_b (addr->b.i_blk, &obj3);
+			 break;
+			 }
+# endif
+		 }
+
+		 obj3.o_data_type = SLANG_UNDEFINED_TYPE;
+		 if (-1 == do_binary_ab_inc_ref_assign (addr->b.i_blk, obj1, obj2, &obj3))
+		 break;
+		 addr += 3;
+		 (void) do_binary_b (addr->b.i_blk, &obj3);
+		 SLang_free_object (&obj3);
+	 }
+	 break;
+
+	 case SLANG_BC_SET_LOCLV_LIT_INT:
+	 set_lvalue_obj (addr->bc_sub_type, Local_Variable_Frame - addr->b.i_blk);
+	 addr++;
+	 push_int_object (addr->bc_sub_type, (int) addr->b.l_blk);
+	 break;
+
+	 case SLANG_BC_SET_LOCLV_LIT_AGET1:
+	 set_lvalue_obj (addr->bc_sub_type, Local_Variable_Frame - addr->b.i_blk);
+	 addr += 3;
+	 push_array_element (addr->b.i_blk, (int) (addr-1)->b.l_blk);
+	 break;
+
+	 case SLANG_BC_SET_LOCLV_LVAR:
+	 set_lvalue_obj (addr->bc_sub_type, Local_Variable_Frame - addr->b.i_blk);
+	 addr++;
+	 PUSH_LOCAL_VARIABLE (addr->b.i_blk)
+	 break;
+
+	 case SLANG_BC_SET_LOCLV_LASTBLOCK:
+	 if (0 == set_lvalue_obj (addr->bc_sub_type, Local_Variable_Frame - addr->b.i_blk))
+	 goto return_1;
+	 break;
+
+	 case SLANG_BC_LVAR_EARG_LVAR:
+	 PUSH_LOCAL_VARIABLE (addr->b.i_blk);
+	 addr++;
+	 PUSH_LOCAL_VARIABLE(addr->b.i_blk);
+	 (void) end_arg_list ();
+	 break;
+
+	 case SLANG_BC_LVAR_FIELD:
+	 PUSH_LOCAL_VARIABLE (addr->b.i_blk);
+	 addr++;
+	 (void) push_struct_field (addr->b.s_blk);
+	 break;
+
+	 case SLANG_BC_BINARY_LASTBLOCK:
+	 if (-1 == do_binary (addr->b.i_blk))
+	 break;
+	 goto return_1;
+
+	 case SLANG_BC_EARG_LVARIABLE_INTRINSIC:
+	 PUSH_LOCAL_VARIABLE(addr->b.i_blk);
+	 if (0 == end_arg_list ())
+	 {
+		 addr++;
+		 EXECUTE_INTRINSIC(addr)
+		 if (IS_SLANG_ERROR)
+		 do_traceback(addr->b.nt_ifun_blk->name);
+	 }
+	 break;
+
+	 case SLANG_BC_LVAR_LITERAL_INT:
+	 PUSH_LOCAL_VARIABLE (addr->b.i_blk);
+	 addr++;
+	 push_int_object (addr->bc_sub_type, (int) addr->b.l_blk);
+	 break;
+
+	 case SLANG_BC_BINARY_SET_LOCLVAL:
+	 if (-1 == do_binary (addr->b.i_blk))
+	 break;
+	 addr++;
+	 (void) set_lvalue_obj (addr->bc_sub_type, Local_Variable_Frame - addr->b.i_blk);
+	 break;
+
+	 case SLANG_BC_LVAR_AGET_SET_LOCLVAL:
+	 {
+		 SLang_Object_Type *obj = Local_Variable_Frame - addr->b.i_blk;
+		 if ((0 == carefully_push_object (obj))
+		 && (0 == do_bc_call_direct_nargs (_pSLarray_aget)))
+		 {
+		 addr++;
+		 (void) set_lvalue_obj (addr->bc_sub_type, Local_Variable_Frame - addr->b.i_blk);
+		 }
+	 }
+	 break;
+
+	 case SLANG_BC_LLVAR_BINARY_IF:
+	 {
+		 SLang_Object_Type *obj1 = Local_Variable_Frame - (addr+1)->b.i_blk;
+		 SLang_Object_Type *obj2 = Local_Variable_Frame - (addr+2)->b.i_blk;
+		 SLang_Object_Type obj3;
+
+		 if (obj1->o_data_type == obj2->o_data_type)
+		 {
+		 if (obj1->o_data_type == SLANG_INT_TYPE)
+			 {
+			 if (-1 == int_int_binary_result (addr->b.i_blk, obj1, obj2, &obj3))
+			 break;
+			 }
+# if SLANG_HAS_FLOAT
+		 else if (obj1->o_data_type == SLANG_DOUBLE_TYPE)
+			 {
+			 if (-1 == dbl_dbl_binary_result (addr->b.i_blk, obj1, obj2, &obj3))
+			 break;
+			 }
+# endif
+		 else
+			 {
+			 obj3.o_data_type = SLANG_UNDEFINED_TYPE;
+			 if (-1 == do_binary_ab_inc_ref_assign (addr->b.i_blk, obj1, obj2, &obj3))
+			 break;
+			 }
+		 }
+		 else
+		 {
+		 obj3.o_data_type = SLANG_UNDEFINED_TYPE;
+		 if (-1 == do_binary_ab_inc_ref_assign (addr->b.i_blk, obj1, obj2, &obj3))
+			 break;
+		 }
+		 addr += 3;
+		 if (obj3.o_data_type == SLANG_CHAR_TYPE)
+		 {
+		 if (obj3.v.char_val)
+			 goto execute_BC_IF_BLOCK;
+		 break;
+		 }
+		 if (obj3.o_data_type == SLANG_INT_TYPE)
+		 {
+		 if (obj3.v.int_val)
+			 goto execute_BC_IF_BLOCK;
+		 break;
+		 }
+
+		 /* Otherwise let pop_ctrl_integer do the dirty work */
+		 if (-1 == push_object (&obj3))
+		 break;
+	 }
+	 /* drop */
+	 case SLANG_BC_IF_BLOCK:
+	 {
+		 int i;
+
+		 if ((-1 == pop_ctrl_integer (&i)) || (i == 0))
+		 break;
+	 }
+
+execute_BC_IF_BLOCK:
+	 {
+		 SLBlock_Type *addr1 = addr->b.blk;
+		 if (addr1->bc_main_type == SLANG_BC_RETURN)
+		 {
+		 Lang_Break_Condition = Lang_Return = Lang_Break = 1;
+		 goto return_1;
+		 }
+		 if (addr1->bc_main_type == SLANG_BC_RET_LVARIABLE)
+		 {
+		 if (0 != push_local_variable (addr1->b.i_blk))
+			 break;
+		 Lang_Break_Condition = Lang_Return = Lang_Break = 1;
+		 goto return_1;
+		 }
+		 inner_interp (addr1);
+		 if (Lang_Break_Condition) goto handle_break_condition;
+	 }
+	 break;
+
+	 case SLANG_BC_LVAR_SET_FIELD:
+	 (void) set_struct_obj_lvalue (addr+1, Local_Variable_Frame - addr->b.i_blk, 0);
+	 addr++;
+	 break;
+
+	 case SLANG_BC_PVAR_SET_GLOB_LVAL:
+	 addr++;
+	 if (-1 == set_lvalue_obj_with_obj (addr->bc_sub_type,
+						&addr->b.nt_gvar_blk->obj,
+						&(addr-1)->b.nt_gvar_blk->obj))
+	 do_name_type_error (addr->b.nt_blk);
+	 break;
+	 case SLANG_BC_LVAR_SET_GLOB_LVAL:
+	 addr++;
+	 if (-1 == set_lvalue_obj_with_obj (addr->bc_sub_type,
+						&addr->b.nt_gvar_blk->obj,
+						Local_Variable_Frame - (addr-1)->b.i_blk))
+	 do_name_type_error (addr->b.nt_blk);
+	 break;
+
+	 case SLANG_BC_LIT_AGET1_INT_BINARY:
+	 {
+		 SLang_Object_Type o;
+		 o.o_data_type = SLANG_INT_TYPE;
+		 o.v.int_val = (int)(addr+4)->b.l_blk;
+		 (void) aget1_from_lvar_binary ((addr+2)->b.i_blk, (SLindex_Type) (addr+1)->b.l_blk,
+						 (addr+3)->b.i_blk, &o);
+	 }
+	 addr += 4;
+	 break;
+	 case SLANG_BC_BINARY2:
+	 if (0 == do_binary (addr->b.i_blk))
+	 {
+		 addr++;
+		 (void) do_binary (addr->b.i_blk);
+	 }
+	 break;
+
+	 case SLANG_BC_LVAR_LIT_AGET1:
+	 PUSH_LOCAL_VARIABLE(addr->b.i_blk);
+	 (void) push_array_element ((addr+3)->b.i_blk, (int)((addr+2)->b.l_blk));
+	 addr += 3;
+	 break;
+#endif				 /* USE_COMBINED_BYTECODES */
+
+#if USE_UNUSED_BYCODES_IN_SWITCH
+# if !USE_COMBINED_BYTECODES
+	 case SLANG_BC_CALL_DIRECT_INTRINSIC:
+	 case SLANG_BC_INTRINSIC_CALL_DIRECT:
+	 case SLANG_BC_CALL_DIRECT_LSTR:
+	 case SLANG_BC_CALL_DIRECT_SLFUN:
+	 case SLANG_BC_CALL_DIRECT_RETINTR:
+	 case SLANG_BC_RET_INTRINSIC:
+	 case SLANG_BC_CALL_DIRECT_EARG_LVAR:
+	 case SLANG_BC_CALL_DIRECT_LINT:
+	 case SLANG_BC_CALL_DIRECT_LVAR:
+	 case SLANG_BC_LLVARIABLE_BINARY:
+	 case SLANG_BC_LGVARIABLE_BINARY:
+	 case SLANG_BC_GLVARIABLE_BINARY:
+	 case SLANG_BC_GGVARIABLE_BINARY:
+	 case SLANG_BC_LIVARIABLE_BINARY:
+	 case SLANG_BC_LDVARIABLE_BINARY:
+	 case SLANG_BC_ILVARIABLE_BINARY:
+	 case SLANG_BC_DLVARIABLE_BINARY:
+	 case SLANG_BC_LVARIABLE_BINARY:
+	 case SLANG_BC_GVARIABLE_BINARY:
+	 case SLANG_BC_LITERAL_INT_BINARY:
+	 case SLANG_BC_LITERAL_DBL_BINARY:
+	 case SLANG_BC_LASSIGN_LLBINARY:
+	 case SLANG_BC_LASSIGN_LIBINARY:
+	 case SLANG_BC_LASSIGN_ILBINARY:
+	 case SLANG_BC_LASSIGN_LDBINARY:
+	 case SLANG_BC_LASSIGN_DLBINARY:
+	 case SLANG_BC_RET_LVARIABLE:
+	 case SLANG_BC_RET_LITERAL_INT:
+	 case SLANG_BC_MANY_LVARIABLE:
+	 case SLANG_BC_MANY_LVARIABLE_DIR:
+	 case SLANG_BC_LVARIABLE_AGET1:
+	 case SLANG_BC_LITERAL_AGET1:
+	 case SLANG_BC_LVAR_LVAR_APUT1:
+	 case SLANG_BC_LVARIABLE_APUT1:
+	 case SLANG_BC_LITERAL_APUT1:
+	 case SLANG_BC_LLVARIABLE_BINARY2:
+	 case SLANG_BC_SET_LOCLV_LIT_INT:
+	 case SLANG_BC_SET_LOCLV_LIT_AGET1:
+	 case SLANG_BC_SET_LOCLV_LVAR:
+	 case SLANG_BC_SET_LOCLV_LASTBLOCK:
+	 case SLANG_BC_LVAR_EARG_LVAR:
+	 case SLANG_BC_LVAR_FIELD:
+	 case SLANG_BC_BINARY_LASTBLOCK:
+	 case SLANG_BC_EARG_LVARIABLE_INTRINSIC:
+	 case SLANG_BC_LVAR_LITERAL_INT:
+	 case SLANG_BC_BINARY_SET_LOCLVAL:
+	 case SLANG_BC_LVAR_AGET_SET_LOCLVAL:
+	 case SLANG_BC_LLVAR_BINARY_IF:
+	 case SLANG_BC_IF_BLOCK:
+	 case SLANG_BC_LVAR_SET_FIELD:
+	 case SLANG_BC_PVAR_SET_GLOB_LVAL:
+	 case SLANG_BC_LVAR_SET_GLOB_LVAL:
+	 case SLANG_BC_LIT_AGET1_INT_BINARY:
+	 case SLANG_BC_BINARY2:
+	 case SLANG_BC_LVAR_LIT_AGET1:
+# endif
+	 case SLANG_BC_UNUSED_0xB7:
+	 case SLANG_BC_UNUSED_0xB8:
+	 case SLANG_BC_UNUSED_0xB9:
+	 case SLANG_BC_UNUSED_0xBA:
+	 case SLANG_BC_UNUSED_0xBB:
+	 case SLANG_BC_UNUSED_0xBC:
+	 case SLANG_BC_UNUSED_0xBD:
+	 case SLANG_BC_UNUSED_0xBE:
+	 case SLANG_BC_UNUSED_0xBF:
+	 case SLANG_BC_LVARIABLE_COMBINED:
+	 case SLANG_BC_GVARIABLE_COMBINED:
+	 case SLANG_BC_LITERAL_COMBINED:
+	 case SLANG_BC_CALL_DIRECT_COMB:
+	 case SLANG_BC_COMBINED:
+	 case SLANG_BC_BLOCK_COMBINED:
+	 case SLANG_BC_UNUSED_0xC6:
+	 case SLANG_BC_UNUSED_0xC7:
+	 case SLANG_BC_UNUSED_0xC8:
+	 case SLANG_BC_UNUSED_0xC9:
+	 case SLANG_BC_UNUSED_0xCA:
+	 case SLANG_BC_UNUSED_0xCB:
+	 case SLANG_BC_UNUSED_0xCC:
+	 case SLANG_BC_UNUSED_0xCD:
+	 case SLANG_BC_UNUSED_0xCE:
+	 case SLANG_BC_UNUSED_0xCF:
+	 case SLANG_BC_UNUSED_0xD0:
+	 case SLANG_BC_UNUSED_0xD1:
+	 case SLANG_BC_UNUSED_0xD2:
+	 case SLANG_BC_UNUSED_0xD3:
+	 case SLANG_BC_UNUSED_0xD4:
+	 case SLANG_BC_UNUSED_0xD5:
+	 case SLANG_BC_UNUSED_0xD6:
+	 case SLANG_BC_UNUSED_0xD7:
+	 case SLANG_BC_UNUSED_0xD8:
+	 case SLANG_BC_UNUSED_0xD9:
+	 case SLANG_BC_UNUSED_0xDA:
+	 case SLANG_BC_UNUSED_0xDB:
+	 case SLANG_BC_UNUSED_0xDC:
+	 case SLANG_BC_UNUSED_0xDD:
+	 case SLANG_BC_UNUSED_0xDE:
+	 case SLANG_BC_UNUSED_0xDF:
+	 case SLANG_BC_UNUSED_0xE0:
+	 case SLANG_BC_UNUSED_0xE1:
+	 case SLANG_BC_UNUSED_0xE2:
+	 case SLANG_BC_UNUSED_0xE3:
+	 case SLANG_BC_UNUSED_0xE4:
+	 case SLANG_BC_UNUSED_0xE5:
+	 case SLANG_BC_UNUSED_0xE6:
+	 case SLANG_BC_UNUSED_0xE7:
+	 case SLANG_BC_UNUSED_0xE8:
+	 case SLANG_BC_UNUSED_0xE9:
+	 case SLANG_BC_UNUSED_0xEA:
+	 case SLANG_BC_UNUSED_0xEB:
+	 case SLANG_BC_UNUSED_0xEC:
+	 case SLANG_BC_UNUSED_0xED:
+	 case SLANG_BC_UNUSED_0xEE:
+	 case SLANG_BC_UNUSED_0xEF:
+	 case SLANG_BC_UNUSED_0xF0:
+	 case SLANG_BC_UNUSED_0xF1:
+	 case SLANG_BC_UNUSED_0xF2:
+	 case SLANG_BC_UNUSED_0xF3:
+	 case SLANG_BC_UNUSED_0xF4:
+	 case SLANG_BC_UNUSED_0xF5:
+	 case SLANG_BC_UNUSED_0xF6:
+	 case SLANG_BC_UNUSED_0xF7:
+	 case SLANG_BC_UNUSED_0xF8:
+	 case SLANG_BC_UNUSED_0xF9:
+	 case SLANG_BC_UNUSED_0xFA:
+	 case SLANG_BC_UNUSED_0xFB:
+	 case SLANG_BC_UNUSED_0xFC:
+	 case SLANG_BC_UNUSED_0xFD:
+	 case SLANG_BC_UNUSED_0xFE:
+	 case SLANG_BC_UNUSED_0xFF:
+#else
+	 default:
+#endif
+	 _pSLang_verror (SL_INTERNAL_ERROR, "Byte-Code 0x%X is not valid", addr->bc_main_type);
+	 }
+
+	IF_UNLIKELY(Handle_Interrupt != 0)
+	 {
+	 if (SLang_get_error ())
+	 {
+		 if (-1 == do_inner_interp_error (err_block, addr_start, addr))
+		 return 1;
+		 if (SLang_get_error ())
+		 return 1;
+		 /* Otherwise, error cleared. Continue onto next bytecode */
+	 }
+#if SLANG_HAS_SIGNALS
+	 (void) check_signals ();
+#endif
+	 if (Lang_Break_Condition) goto handle_break_condition;
+	 }
+ }
+
+ handle_break_condition:
+ /* Get here if Lang_Break_Condition != 0, which implies that either
+ * Lang_Return, Lang_Break, or Lang_Continue is non zero
+ */
+ if (Lang_Return)
+ Lang_Break = 1;
+
+return_1:
+#if SLANG_HAS_SIGNALS
+ if (Handle_Interrupt)
+ check_signals ();
+#endif
+ return 1;
+
+return_0:
+#if SLANG_HAS_SIGNALS
+ if (Handle_Interrupt)
+ check_signals ();
+#endif
+ return 0;
+}
+
+/*}}}*/
+
+/* The functions below this point are used to implement the parsed token
+ * to byte-compiled code.
+ */
+/* static SLang_Name_Type **Static_Hash_Table; */
+
+/* static SLang_Name_Type **Locals_Hash_Table; */
+int _pSLang_Auto_Declare_Globals = 0;
+int (*SLang_Auto_Declare_Var_Hook) (SLFUTURE_CONST char *);
+
+static int Local_Variable_Number;
+static unsigned int Function_Args_Number;
+
+static int Lang_Defining_Function;
+static void (*Default_Variable_Mode) (_pSLang_Token_Type *);
+static void (*Default_Define_Function) (SLFUTURE_CONST char *, unsigned long);
+static int setup_default_compile_linkage (int);
+
+static int push_compile_context (SLFUTURE_CONST char *);
+static int pop_compile_context (void);
+
+typedef struct
+{
+ int block_type;
+ SLBlock_Type *block;		 /* beginning of block definition */
+ SLBlock_Type *block_ptr;	 /* current location */
+ SLBlock_Type *block_max;	 /* end of definition */
+ SLang_NameSpace_Type *static_namespace;
+}
+Block_Context_Type;
+
+static Block_Context_Type Block_Context_Stack SLANG_MAX_BLOCK_STACK_LEN;
+static unsigned int Block_Context_Stack_Len;
+
+static SLBlock_Type *Compile_ByteCode_Ptr;
+static SLBlock_Type *This_Compile_Block;
+static SLBlock_Type *This_Compile_Block_Max;
+
+#define COMPILE_BLOCK_TYPE_NONE		0
+#define COMPILE_BLOCK_TYPE_FUNCTION	1
+#define COMPILE_BLOCK_TYPE_BLOCK	2
+#define COMPILE_BLOCK_TYPE_TOP_LEVEL	3
+static int This_Compile_Block_Type = COMPILE_BLOCK_TYPE_NONE;
+
+/* If it returns 0, DO NOT FREE p */
+static int lang_free_branch (SLBlock_Type *p)
+{
+ while (1)
+ {
+	SLang_Class_Type *cl;
+
+ switch (p->bc_main_type)
+	 {
+	 case SLANG_BC_BLOCK:
+	 case SLANG_BC_IF_BLOCK:
+	 case SLANG_BC_BLOCK_COMBINED:
+	 if (lang_free_branch(p->b.blk))
+	 SLfree((char *)p->b.blk);
+	 break;
+
+	 case SLANG_BC_COMBINED:
+	 if (0 == (p->bc_flags & BC_LITERAL_MASK))
+	 break;
+	 /* drop */
+	 case SLANG_BC_LITERAL:
+	 case SLANG_BC_LITERAL_STR:
+	 case SLANG_BC_LITERAL_DBL:
+	 case SLANG_BC_LITERAL_COMBINED:
+	 /* No user types should be here. */
+	 GET_BUILTIN_CLASS(cl, p->bc_sub_type);
+	 (*cl->cl_byte_code_destroy) (p->bc_sub_type, (VOID_STAR) &p->b.ptr_blk);
+	 break;
+
+	 case SLANG_BC_FIELD:
+	 case SLANG_BC_FIELD_REF:
+	 case SLANG_BC_SET_STRUCT_LVALUE:
+	 SLang_free_slstring ((char *) p->b.s_blk);
+	 break;
+	 case SLANG_BC_BOS:
+#if USE_BC_LINE_NUM
+	 case SLANG_BC_LINE_NUM:
+#endif
+#if SLANG_HAS_DEBUG_CODE
+	 if (p->b.line_info != NULL)
+	 {
+		 SLang_free_slstring (p->b.line_info->filename);
+		 SLfree ((char *) p->b.line_info);
+	 }
+#endif
+	 break;
+	 default:
+	 break;
+
+	 case 0:
+	 return 1;
+	 }
+	p++;
+ }
+}
+
+static void free_local_variable_names (char **list, unsigned int num)
+{
+ unsigned int i;
+
+ if (list == NULL)
+ return;
+
+ for (i = 0; i < num; i++)
+ SLang_free_slstring (listi);
+
+ SLfree ((char *) list);
+}
+
+static void free_function_header (Function_Header_Type *h)
+{
+ if (h->num_refs > 1)
+ {
+	h->num_refs--;
+	return;
+ }
+
+ if (h->body != NULL)
+ {
+	if (lang_free_branch (h->body))
+	 SLfree ((char *) h->body);
+ }
+
+ if (h->file != NULL) SLang_free_slstring ((char *) h->file);
+
+ if (h->local_variables != NULL)
+ free_local_variable_names (h->local_variables, h->nlocals);
+
+ SLfree ((char *) h);
+}
+
+static Function_Header_Type *
+ allocate_function_header (unsigned int nargs, unsigned int nlocals, SLFUTURE_CONST char *file)
+{
+ Function_Header_Type *h;
+ char **local_variables;
+ unsigned int i;
+
+ if (NULL == (h = (Function_Header_Type *)SLcalloc (sizeof (Function_Header_Type), 1)))
+ return h;
+
+ h->num_refs = 1;
+ /* h->body = NULL; */		 /* body added later */
+ h->nlocals = nlocals;
+ h->nargs = nargs;
+ if (NULL == (h->file = SLang_create_slstring (file)))
+ {
+	free_function_header (h);
+	return NULL;
+ }
+
+#if SLANG_HAS_BOSEOS
+ h->issue_bofeof_info = (_pSLang_Compile_BOFEOF != 0);
+#endif
+
+ if (nlocals == 0)
+ return h;
+
+ if (NULL == (local_variables = (char **)SLcalloc (nlocals, sizeof (char *))))
+ {
+	free_function_header (h);
+	return NULL;
+ }
+ h->local_variables = local_variables;
+
+ for (i = 0; i < nlocals; i++)
+ {
+	if (NULL == (local_variablesi = SLang_create_slstring (Local_Variable_Namesi)))
+	 {
+	 free_function_header (h);
+	 return NULL;
+	 }
+ }
+ return h;
+}
+
+static int push_block_context (int type)
+{
+ Block_Context_Type *c;
+ unsigned int num;
+ SLBlock_Type *b;
+
+ if (Block_Context_Stack_Len == SLANG_MAX_BLOCK_STACK_LEN)
+ {
+	_pSLang_verror (SL_STACK_OVERFLOW, "Block stack overflow");
+	return -1;
+ }
+
+ num = 20;
+ if (NULL == (b = (SLBlock_Type *) _SLcalloc (num, sizeof (SLBlock_Type))))
+ return -1;
+ memset ((char *)b, 0, num*sizeof(SLBlock_Type)); /* not done by _SLcalloc */
+
+ c = Block_Context_Stack + Block_Context_Stack_Len;
+ c->block = This_Compile_Block;
+ c->block_ptr = Compile_ByteCode_Ptr;
+ c->block_max = This_Compile_Block_Max;
+ c->block_type = This_Compile_Block_Type;
+ c->static_namespace = This_Static_NameSpace;
+
+ Compile_ByteCode_Ptr = This_Compile_Block = b;
+ This_Compile_Block_Max = b + num;
+ This_Compile_Block_Type = type;
+
+ Block_Context_Stack_Len += 1;
+ return 0;
+}
+
+static int pop_block_context (void)
+{
+ Block_Context_Type *c;
+
+ if (Block_Context_Stack_Len == 0)
+ {
+	if (_pSLang_Error == 0)
+	 SLang_verror (SL_StackUnderflow_Error, "block context stack underflow");
+	return -1;
+ }
+
+ Block_Context_Stack_Len -= 1;
+ c = Block_Context_Stack + Block_Context_Stack_Len;
+
+ if (This_Compile_Block != NULL)
+ {
+	SLang_verror (SL_Internal_Error, "pop_block_context: block is not NULL");
+ }
+
+ This_Compile_Block = c->block;
+ This_Compile_Block_Max = c->block_max;
+ This_Compile_Block_Type = c->block_type;
+ Compile_ByteCode_Ptr = c->block_ptr;
+ This_Static_NameSpace = c->static_namespace;
+
+ return 0;
+}
+
+static int setup_compile_namespaces (SLFUTURE_CONST char *name, SLFUTURE_CONST char *namespace_name)
+{
+ SLang_NameSpace_Type *static_ns = NULL, *private_ns = NULL;
+
+ if (NULL == (private_ns = _pSLns_get_private_namespace (name, namespace_name)))
+ return -1;
+
+ /* The Global namespace is special. It does not have the same semantics as
+ * the static namespace since the Global namespace is _always_ available.
+ */
+ if ((namespace_name != NULL)
+ && (*namespace_name)
+ && (0 != strcmp (namespace_name, "Global")))
+ {
+	if (NULL == (static_ns = _pSLns_create_namespace2 (name, namespace_name)))
+	 return -1;
+ }
+ else static_ns = private_ns;
+
+ setup_default_compile_linkage (static_ns == private_ns);
+
+ This_Static_NameSpace = static_ns;
+ This_Private_NameSpace = private_ns;
+ return 0;
+}
+
+int _pSLcompile_push_context (SLang_Load_Type *load_object)
+{
+ SLFUTURE_CONST char *name = load_object->name;
+ char *ext;
+ int status = -1;
+ int free_name = 0;
+
+ ext = SLpath_extname (name);
+ if (((0 == strncmp (ext, ".slc", 4)) || (0 == strncmp (ext, ".SLC", 4)))
+ && ((ext4 == 0)
+#ifdef VMS
+	 || (ext4 == ';')
+#endif
+	 ))
+ {
+	unsigned int len = (unsigned int) (ext - name) + 3;
+
+	if (NULL == (name = SLang_create_nslstring (name, len)))
+	 return -1;
+	free_name = 1;
+ }
+
+ if (-1 == push_compile_context (name))
+ goto free_return;
+
+ if (-1 == setup_compile_namespaces (name, load_object->namespace_name))
+ {
+	pop_compile_context ();
+	goto free_return;
+ }
+
+ if (-1 == push_block_context (COMPILE_BLOCK_TYPE_TOP_LEVEL))
+ {
+	pop_compile_context ();
+	goto free_return;
+ }
+
+ (void) _pSLerr_suspend_messages ();
+ status = 0;
+ /* drop */
+
+ free_return:
+ if (free_name)
+ SLang_free_slstring ((char *) name);
+
+ return status;
+}
+
+static void reset_compiler_state (void);
+int _pSLcompile_pop_context (void)
+{
+ (void) _pSLerr_resume_messages ();
+
+ if (_pSLang_Error) reset_compiler_state ();
+
+ if (This_Compile_Block_Type == COMPILE_BLOCK_TYPE_TOP_LEVEL)
+ {
+	Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_LAST_BLOCK;
+	if (lang_free_branch (This_Compile_Block))
+	 {
+	 SLfree ((char *) This_Compile_Block);
+	 This_Compile_Block = NULL;
+	 }
+ }
+
+ (void) pop_block_context ();
+ (void) pop_compile_context ();
+
+ if (This_Compile_Block == NULL)
+ return 0;
+
+#if 0
+ if (This_Compile_Block_Type != COMPILE_BLOCK_TYPE_TOP_LEVEL)
+ {
+	_pSLang_verror (SL_INTERNAL_ERROR, "Not at top-level");
+	return -1;
+ }
+#endif
+
+ return 0;
+}
+
+/*{{{ Hash and Name Table Functions */
+
+/* Returns a pointer to the first character past "->" in name. If "->" does
+ * not exist, then it returns a pointer to the beginning of name.
+ */
+_INLINE_
+static char *parse_namespace_encoded_name (SLCONST char *name)
+{
+ char *ns;
+
+ ns = (char *)name;
+ name = strchr (name, '-');
+ if ((name == NULL) || (name 1 != '>'))
+ return ns;
+
+ return (char*)name + 2;
+}
+
+static SLang_Name_Type *locate_namespace_encoded_name (SLCONST char *name, int err_on_bad_ns)
+{
+ char *ns;
+ SLang_NameSpace_Type *table;
+ SLang_Name_Type *nt;
+
+ ns = (char *) name;
+ name = parse_namespace_encoded_name (ns);
+
+ if (name == ns)
+ {
+	/* Use Global Namespace */
+	return _pSLns_locate_hashed_name (Global_NameSpace, name, SLcompute_string_hash (name));
+ }
+
+ ns = SLang_create_nslstring (ns, (unsigned int) ((name-2) - ns));
+ if (ns == NULL)
+ return NULL;
+ if (NULL == (table = _pSLns_find_namespace (ns)))
+ {
+	if (err_on_bad_ns)
+	 _pSLang_verror (SL_SYNTAX_ERROR, "Unable to find namespace called %s", ns);
+	SLang_free_slstring (ns);
+	return NULL;
+ }
+ SLang_free_slstring (ns);
+
+ nt = _pSLns_locate_hashed_name (table, name, SLcompute_string_hash (name));
+ if (nt == NULL)
+ return NULL;
+
+ switch (nt->name_type)
+ {
+	/* These are private and cannot be accessed through the namespace. */
+ case SLANG_PVARIABLE:
+ case SLANG_PFUNCTION:
+	return NULL;
+ }
+ return nt;
+}
+
+static SLang_Name_Type *
+ find_global_hashed_name (SLCONST char *name, unsigned long hash,
+			 SLang_NameSpace_Type *pns, SLang_NameSpace_Type *sns,
+			 SLang_NameSpace_Type *gns,
+			 int do_error)
+{
+ SLang_Name_Type *nt;
+
+ if ((pns != NULL) && (pns != sns))
+ {
+	if (NULL != (nt = _pSLns_locate_hashed_name (pns, name, hash)))
+	 return nt;
+ }
+ if ((sns != NULL) && (sns != gns))
+ {
+	if (NULL != (nt = _pSLns_locate_hashed_name (sns, name, hash)))
+	 return nt;
+ }
+
+ if (gns != NULL)
+ {
+	if (NULL != (nt = _pSLns_locate_hashed_name (gns, name, hash)))
+	 return nt;
+ }
+
+ if (do_error)
+ _pSLang_verror (SL_UNDEFINED_NAME, "Unable to locate '%s'", name);
+
+ return NULL;
+}
+
+static SLang_Name_Type *locate_hashed_name (SLCONST char *name, unsigned long hash, int err_on_bad_ns)
+{
+ SLang_Name_Type *t;
+
+ if (Locals_NameSpace != NULL)
+ {
+	t = _pSLns_locate_hashed_name (Locals_NameSpace, name, hash);
+	if (t != NULL)
+	 return t;
+ }
+
+ t = find_global_hashed_name (name, hash, This_Private_NameSpace, This_Static_NameSpace, Global_NameSpace, 0);
+ if (t == NULL)
+ t = locate_namespace_encoded_name (name, err_on_bad_ns);
+ return t;
+}
+
+SLang_Name_Type *_pSLlocate_name (SLCONST char *name)
+{
+ return locate_hashed_name (name, SLcompute_string_hash (name), 0);
+}
+
+SLang_Name_Type *_pSLlocate_global_name (SLCONST char *name)
+{
+ return _pSLns_locate_name (Global_NameSpace, name);
+}
+
+static SLang_Name_Type *
+ add_name_to_namespace (SLCONST char *name, unsigned long hash,
+			 unsigned int sizeof_obj, unsigned char name_type,
+			 SLang_NameSpace_Type *ns)
+{
+ SLang_Name_Type *t;
+
+ if (-1 == _pSLcheck_identifier_syntax (name))
+ return NULL;
+
+ t = (SLang_Name_Type *) SLcalloc (sizeof_obj, 1);
+ if (t == NULL)
+ return t;
+
+ t->name_type = name_type;
+
+ if ((NULL == (t->name = _pSLstring_dup_hashed_string (name, hash)))
+ || (-1 == _pSLns_add_hashed_name (ns, t, hash)))
+ {
+	SLfree ((char *) t);
+	return NULL;
+ }
+ return t;
+}
+
+static SLang_Name_Type *
+add_global_name (SLCONST char *name, unsigned long hash,
+		 unsigned char name_type, unsigned int sizeof_obj,
+		 SLang_NameSpace_Type *ns)
+{
+ SLang_Name_Type *nt;
+
+ nt = _pSLns_locate_hashed_name (ns, name, hash);
+ if (nt != NULL)
+ {
+	if (nt->name_type == name_type)
+	 return nt;
+
+	_pSLang_verror (SL_DUPLICATE_DEFINITION, "%s cannot be re-defined", name);
+	return NULL;
+ }
+
+ return add_name_to_namespace (name, hash, sizeof_obj, name_type, ns);
+}
+
+static int add_intrinsic_function (SLang_NameSpace_Type *ns,
+				 SLCONST char *name, FVOID_STAR addr, SLtype ret_type,
+				 unsigned int nargs, SLtype *arg_types)
+{
+ SLang_Intrin_Fun_Type *f;
+ unsigned int i;
+
+ if (-1 == init_interpreter ())
+ return -1;
+
+ if (ns == NULL) ns = Global_NameSpace;
+
+ if (ret_type == SLANG_FLOAT_TYPE)
+ {
+	_pSLang_verror (SL_NOT_IMPLEMENTED, "Function %s is not permitted to return float", name);
+	return -1;
+ }
+
+ f = (SLang_Intrin_Fun_Type *) add_global_name (name, SLcompute_string_hash (name),
+						 SLANG_INTRINSIC, sizeof (SLang_Intrin_Fun_Type),
+						 ns);
+
+ if (f == NULL)
+ return -1;
+
+ f->i_fun = addr;
+ f->num_args = nargs;
+ f->return_type = ret_type;
+
+ for (i = 0; i < nargs; i++)
+ f->arg_types i = arg_typesi;
+
+ return 0;
+}
+
+static int va_add_intrinsic_function (SLang_NameSpace_Type *ns,
+				 SLCONST char *name, FVOID_STAR addr, SLtype ret_type,
+				 unsigned int nargs, va_list ap)
+{
+ SLtype arg_types SLANG_MAX_INTRIN_ARGS;
+ unsigned int i;
+
+ if (nargs > SLANG_MAX_INTRIN_ARGS)
+ {
+	_pSLang_verror (SL_APPLICATION_ERROR, "Function %s requires too many arguments", name);
+	return -1;
+ }
+
+ for (i = 0; i < nargs; i++)
+ arg_types i = va_arg (ap, unsigned int);
+
+ return add_intrinsic_function (ns, name, addr, ret_type, nargs, arg_types);
+}
+
+int SLadd_intrinsic_function (SLFUTURE_CONST char *name, FVOID_STAR addr, SLtype ret_type,
+			 unsigned int nargs, ...)
+{
+ va_list ap;
+ int status;
+
+ va_start (ap, nargs);
+ status = va_add_intrinsic_function (NULL, name, addr, ret_type, nargs, ap);
+ va_end (ap);
+
+ return status;
+}
+
+int SLns_add_intrinsic_function (SLang_NameSpace_Type *ns,
+				 SLFUTURE_CONST char *name, FVOID_STAR addr, SLtype ret_type,
+				 unsigned int nargs, ...)
+{
+ va_list ap;
+ int status;
+
+ va_start (ap, nargs);
+ status = va_add_intrinsic_function (ns, name, addr, ret_type, nargs, ap);
+ va_end (ap);
+
+ return status;
+}
+
+static SLang_Name_Type *add_xxx_helper (SLang_NameSpace_Type *ns, SLCONST char *name,
+					int what, unsigned int sizeof_what)
+{
+ if (-1 == init_interpreter ())
+ return NULL;
+
+ if (ns == NULL) ns = Global_NameSpace;
+
+ return add_global_name (name,
+			 SLcompute_string_hash (name),
+			 what, sizeof_what, ns);
+}
+
+int SLns_add_hconstant (SLang_NameSpace_Type *ns, SLFUTURE_CONST char *name, SLtype type, short value)
+{
+ SLang_HConstant_Type *v;
+
+ v = (SLang_HConstant_Type *)add_xxx_helper (ns, name, SLANG_HCONSTANT, sizeof (SLang_HConstant_Type));
+ if (v == NULL)
+ return -1;
+ v->value = value;
+ v->data_type = type;
+ return 0;
+}
+
+int SLns_add_iconstant (SLang_NameSpace_Type *ns, SLFUTURE_CONST char *name, SLtype type, int value)
+{
+ SLang_IConstant_Type *v;
+
+ v = (SLang_IConstant_Type *)add_xxx_helper (ns, name, SLANG_ICONSTANT, sizeof (SLang_IConstant_Type));
+ if (v == NULL)
+ return -1;
+ v->value = value;
+ v->data_type = type;
+ return 0;
+}
+
+int SLns_add_lconstant (SLang_NameSpace_Type *ns, SLFUTURE_CONST char *name, SLtype type, long value)
+{
+ SLang_LConstant_Type *v;
+
+ v = (SLang_LConstant_Type *)add_xxx_helper (ns, name, SLANG_LCONSTANT, sizeof (SLang_LConstant_Type));
+ if (v == NULL)
+ return -1;
+ v->value = value;
+ v->data_type = type;
+ return 0;
+}
+
+#ifdef HAVE_LONG_LONG
+int _pSLns_add_llconstant (SLang_NameSpace_Type *ns, SLFUTURE_CONST char *name, SLtype type, long long value)
+{
+ _pSLang_LLConstant_Type *v;
+
+ v = (_pSLang_LLConstant_Type *)add_xxx_helper (ns, name, SLANG_LLCONSTANT, sizeof (_pSLang_LLConstant_Type));
+ if (v == NULL)
+ return -1;
+ v->value = value;
+ v->data_type = type;
+ return 0;
+}
+#endif
+
+#if SLANG_HAS_FLOAT
+int SLns_add_dconstant (SLang_NameSpace_Type *ns, SLFUTURE_CONST char *name, double value)
+{
+ SLang_DConstant_Type *v;
+
+ v = (SLang_DConstant_Type *)add_xxx_helper (ns, name, SLANG_DCONSTANT, sizeof (SLang_DConstant_Type));
+ if (v == NULL)
+ return -1;
+ v->d = value;
+ return 0;
+}
+
+int SLns_add_fconstant (SLang_NameSpace_Type *ns, SLFUTURE_CONST char *name, float value)
+{
+ SLang_FConstant_Type *v;
+
+ v = (SLang_FConstant_Type *)add_xxx_helper (ns, name, SLANG_FCONSTANT, sizeof (SLang_FConstant_Type));
+ if (v == NULL)
+ return -1;
+ v->f = value;
+ return 0;
+}
+#endif
+
+#ifdef HAVE_LONG_LONG
+int SLns_add_llconstant (SLang_NameSpace_Type *ns, SLFUTURE_CONST char *name, long long value)
+{
+ SLang_LLConstant_Type *v;
+
+ v = (SLang_LLConstant_Type *)add_xxx_helper (ns, name, SLANG_LLCONSTANT, sizeof (SLang_LLConstant_Type));
+ if (v == NULL)
+ return -1;
+ v->ll = value;
+ return 0;
+}
+
+#endif
+int SLns_add_intrinsic_variable (SLang_NameSpace_Type *ns,
+				 SLFUTURE_CONST char *name, VOID_STAR addr, SLtype data_type, int ro)
+{
+ SLang_Intrin_Var_Type *v;
+
+ v = (SLang_Intrin_Var_Type *)add_xxx_helper (ns, name,
+						(ro ? SLANG_RVARIABLE : SLANG_IVARIABLE),
+						 sizeof (SLang_Intrin_Var_Type));
+ if (v == NULL)
+ return -1;
+
+ v->addr = addr;
+ v->type = data_type;
+ return 0;
+}
+
+int SLadd_intrinsic_variable (SLFUTURE_CONST char *name, VOID_STAR addr, SLtype data_type, int ro)
+{
+ return SLns_add_intrinsic_variable (NULL, name, addr, data_type, ro);
+}
+
+static int
+add_slang_function (SLFUTURE_CONST char *name, unsigned char type, unsigned long hash,
+		 Function_Header_Type *h, SLFUTURE_CONST char *file,
+		 SLang_NameSpace_Type *ns)
+{
+ _pSLang_Function_Type *f;
+
+ if (file != NULL)
+ {
+	if (NULL == (file = SLang_create_slstring (file)))
+	 return -1;
+ }
+
+ f = (_pSLang_Function_Type *)add_global_name (name, hash,
+						 type,
+						 sizeof (_pSLang_Function_Type),
+						 ns);
+ if (f == NULL)
+ {
+	SLang_free_slstring ((char *) file);
+	return -1;
+ }
+
+ if (f->header != NULL)
+ {
+	free_function_header (f->header);
+	/* free_namespace (f->v.ns); */
+ }
+ else if (f->autoload_file != NULL)
+ {
+	SLang_free_slstring ((char *) f->autoload_file);
+	f->autoload_file = NULL;
+ }
+
+ f->header = h;
+
+ if (h != NULL)
+ {
+	h->private_ns = This_Private_NameSpace;
+	h->static_ns = This_Static_NameSpace;
+ }
+ else
+ {
+	f->autoload_ns = ns;
+	f->autoload_file = file;
+ }
+
+ return 0;
+}
+
+static int SLns_autoload (SLFUTURE_CONST char *name, SLFUTURE_CONST char *file, SLFUTURE_CONST char *nsname)
+{
+ unsigned long hash;
+ SLang_NameSpace_Type *ns;
+ SLFUTURE_CONST char *cnsname = nsname;
+
+ if (cnsname == NULL)
+ cnsname = _pSLang_cur_namespace_intrinsic ();
+
+ if (*cnsname == 0)
+ cnsname = "Global";
+
+ hash = SLcompute_string_hash (name);
+ if (NULL != (ns = _pSLns_find_namespace (cnsname)))
+ {
+	_pSLang_Function_Type *f;
+
+	f = (_pSLang_Function_Type *)_pSLns_locate_hashed_name (ns, name, hash);
+
+	if ((f != NULL)
+	 && (f->name_type == SLANG_FUNCTION)
+	 && (f->header != NULL))
+	 {
+	 /* already loaded */
+	 return 0;
+	 }
+ }
+ else if (NULL == (ns = SLns_create_namespace (cnsname)))
+ return -1;
+
+ if (-1 == add_slang_function (name, SLANG_FUNCTION, hash,
+				 NULL, file, ns))
+ return -1;
+
+ return 0;
+}
+
+int SLang_autoload (SLFUTURE_CONST char *name, SLFUTURE_CONST char *file)
+{
+ SLFUTURE_CONST char *ns;
+ int status;
+
+ ns = name;
+ name = parse_namespace_encoded_name (ns);
+ if (ns == name)
+ return SLns_autoload (name, file, NULL);
+
+ /* At this point, name points past "->" in ns. */
+ if (NULL == (ns = SLmake_nstring (ns, ((name-2) - ns))))
+ return -1;
+
+ status = SLns_autoload (name, file, ns);
+ SLfree ((char *) ns);
+ return status;
+}
+
+/*}}}*/
+
+/* call inner interpreter or return for more */
+static void lang_try_now(void)
+{
+/* #if SLANG_HAS_DEBUG_CODE */
+ Compile_ByteCode_Ptr->linenum = (unsigned short) This_Compile_Linenum;
+/* #endif */
+ Compile_ByteCode_Ptr++;
+ if (This_Compile_Block_Type != COMPILE_BLOCK_TYPE_TOP_LEVEL)
+ return;
+
+/* #if SLANG_HAS_DEBUG_CODE */
+ Compile_ByteCode_Ptr->linenum = (unsigned short) This_Compile_Linenum;
+/* #endif */
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_LAST_BLOCK;
+
+ /* now do it */
+ inner_interp (This_Compile_Block);
+ (void) lang_free_branch (This_Compile_Block);
+ Compile_ByteCode_Ptr = This_Compile_Block;
+ Lang_Break = Lang_Break_Condition = Lang_Return = 0;
+}
+
+static void interp_pending_blocks (void)
+{
+ if ((This_Compile_Block_Type != COMPILE_BLOCK_TYPE_TOP_LEVEL)
+ || (Compile_ByteCode_Ptr == This_Compile_Block))
+ return;
+
+ Compile_ByteCode_Ptr->linenum = (unsigned short) This_Compile_Linenum;
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_LAST_BLOCK;
+
+ inner_interp (This_Compile_Block);
+ (void) lang_free_branch (This_Compile_Block);
+ Compile_ByteCode_Ptr = This_Compile_Block;
+ Lang_Break = Lang_Break_Condition = Lang_Return = 0;
+}
+
+/* returns positive number if name is a function or negative number if it
+ is a variable. If it is intrinsic, it returns magnitude of 1, else 2 */
+int SLang_is_defined(SLFUTURE_CONST char *name)
+{
+ SLang_Name_Type *t;
+
+ if (-1 == init_interpreter ())
+ return -1;
+
+ t = locate_namespace_encoded_name (name, 0);
+ if (t == NULL)
+ return 0;
+
+ switch (t->name_type)
+ {
+ case SLANG_FUNCTION:
+ /* case SLANG_PFUNCTION: */
+	return 2;
+ case SLANG_GVARIABLE:
+ /* case SLANG_PVARIABLE: */
+	return -2;
+
+ case SLANG_HCONSTANT:
+ case SLANG_ICONSTANT:
+ case SLANG_LCONSTANT:
+ case SLANG_LLCONSTANT:
+ case SLANG_FCONSTANT:
+ case SLANG_DCONSTANT:
+ case SLANG_RVARIABLE:
+ case SLANG_IVARIABLE:
+	return -1;
+
+ case SLANG_INTRINSIC:
+ case SLANG_MATH_UNARY:
+ case SLANG_APP_UNARY:
+ case SLANG_ARITH_UNARY:
+ case SLANG_ARITH_BINARY:
+ default:
+	return 1;
+ }
+}
+
+SLang_Name_Type *SLang_get_fun_from_ref (SLang_Ref_Type *ref)
+{
+ if (ref->data_is_nametype)
+ {
+	SLang_Name_Type *nt = *(SLang_Name_Type **)ref->data;
+
+	if (_pSLang_ref_is_callable (ref))
+	 return nt;
+
+	_pSLang_verror (SL_TYPE_MISMATCH,
+		 "Reference to a function expected. Found &%s",
+		 nt->name);
+ }
+ else
+ _pSLang_verror (SL_TYPE_MISMATCH,
+		 "Reference to a function expected");
+ return NULL;
+}
+
+/* This function shall never run if there is an error */
+int SLexecute_function (SLang_Name_Type *nt)
+{
+ unsigned char type;
+ SLCONST char *name;
+ int status = 1;
+
+ if (nt == NULL)
+ return -1;
+
+ if (IS_SLANG_ERROR)
+ return -1;
+
+ (void) _pSLerr_suspend_messages ();
+
+ type = nt->name_type;
+ name = nt->name;
+
+ switch (type)
+ {
+ case SLANG_PFUNCTION:
+ case SLANG_FUNCTION:
+	execute_slang_fun ((_pSLang_Function_Type *) nt, This_Compile_Linenum);
+	break;
+
+ case SLANG_INTRINSIC:
+	execute_intrinsic_fun ((SLang_Intrin_Fun_Type *) nt);
+	break;
+
+ case SLANG_MATH_UNARY:
+ case SLANG_APP_UNARY:
+ case SLANG_ARITH_UNARY:
+ case SLANG_ARITH_BINARY:
+	inner_interp_nametype (nt, 0);
+	break;
+
+ default:
+	_pSLang_verror (SL_TYPE_MISMATCH, "%s is not a function", name);
+ }
+
+ if (IS_SLANG_ERROR)
+ {
+	if (SLang_Traceback & SL_TB_FULL)
+	 _pSLang_verror (0, "Error encountered while executing %s", name);
+	status = -1;
+ }
+
+ (void) _pSLerr_resume_messages ();
+ return status;
+}
+
+int SLang_execute_function (SLFUTURE_CONST char *name)
+{
+ SLang_Name_Type *entry;
+
+ if (NULL == (entry = SLang_get_function (name)))
+ return 0;
+
+ return SLexecute_function (entry);
+}
+
+/* return S-Lang function or NULL */
+SLang_Name_Type *SLang_get_function (SLFUTURE_CONST char *name)
+{
+ SLang_Name_Type *entry;
+
+ if (NULL == (entry = locate_namespace_encoded_name (name, 0)))
+ return NULL;
+
+ if (is_nametype_callable (entry))
+ return entry;
+
+ return NULL;
+}
+
+static void lang_begin_function (void)
+{
+ if (This_Compile_Block_Type != COMPILE_BLOCK_TYPE_TOP_LEVEL)
+ {
+	_pSLang_verror (SL_SYNTAX_ERROR, "Function nesting is illegal");
+	return;
+ }
+ Lang_Defining_Function = 1;
+ (void) push_block_context (COMPILE_BLOCK_TYPE_FUNCTION);
+}
+
+#if USE_COMBINED_BYTECODES
+static void rearrange_optimized_binary (SLBlock_Type *b, _pSLang_BC_Type t1, _pSLang_BC_Type t2, _pSLang_BC_Type t3)
+{
+ SLBlock_Type tmp;
+
+ b->bc_main_type = t1;
+ (b-1)->bc_main_type = t3;
+ (b-2)->bc_main_type = t2;
+
+ tmp = *b;
+ *b = *(b-1);
+ *(b-1) = *(b-2);
+ *(b-2) = tmp;
+}
+
+static void rearrange_optimized_optimized (SLBlock_Type *b, _pSLang_BC_Type t1)
+{
+ SLBlock_Type tmp;
+ b->bc_main_type = t1;
+
+ tmp = *b;
+ *b = *(b-1);
+ *(b-1) = *(b-2);
+ *(b-2) = *(b-3);
+ *(b-3) = tmp;
+# if 1
+ (b)->bc_main_type = SLANG_BC_COMBINED;
+ (b-1)->bc_main_type = SLANG_BC_COMBINED;
+ (b-2)->bc_main_type = SLANG_BC_COMBINED;
+# endif
+}
+
+static void rearrange_optimized_unary (SLBlock_Type *b, _pSLang_BC_Type t1, _pSLang_BC_Type t2)
+{
+ SLBlock_Type tmp;
+
+ b->bc_main_type = t1;
+ (b-1)->bc_main_type = t2;
+
+ tmp = *b;
+ *b = *(b-1);
+ *(b-1) = tmp;
+}
+
+#define COMPILE_COMBINE_STATS 0
+#if COMPILE_COMBINE_STATS
+static unsigned int Combine_Statistics 0x10000U;
+static void write_combine_stats (void)
+{
+ unsigned int i;
+ FILE *fp = fopen ("combine_stats.dat", "w");
+ if (fp == NULL)
+ return;
+
+ for (i = 0; i < 0x10000U; i++)
+ {
+	if (Combine_Statisticsi)
+	 fprintf (fp, "%5d\t0x%04X\n", Combine_Statisticsi, i);
+ }
+ (void) fclose (fp);
+}
+
+static void gather_statistics (SLBlock_Type *b)
+{
+ static int inited = 0;
+ unsigned char last, next;
+
+ if (inited == 0)
+ SLang_add_cleanup_function (write_combine_stats);
+
+ last = 0;
+ while ((next = b->bc_main_type) != 0)
+ {
+	Combine_Statisticslast*256 + next += 1;
+	last = next;
+	b++;
+ }
+}
+
+#endif
+
+static void optimize_block4 (SLBlock_Type *b)
+{
+ while (1)
+ {
+	switch (b->bc_main_type)
+	 {
+	 case SLANG_BC_LAST_BLOCK:
+	 return;
+
+	 default:
+	 b++;
+	 break;
+
+ 	 case SLANG_BC_LVARIABLE:
+	 b++;
+	 if (b->bc_main_type == SLANG_BC_LVARIABLE)
+	 {
+		 SLBlock_Type *b0 = b - 1;
+		 b0->bc_main_type = SLANG_BC_MANY_LVARIABLE;
+		 do
+		 {
+		 b->bc_main_type = SLANG_BC_LVARIABLE_COMBINED;
+		 b++;
+		 }
+		 while (b->bc_main_type == SLANG_BC_LVARIABLE);
+		 if (b->bc_main_type == SLANG_BC_CALL_DIRECT)
+		 {
+		 b0->bc_main_type = SLANG_BC_MANY_LVARIABLE_DIR;
+		 b->bc_main_type = SLANG_BC_CALL_DIRECT_COMB;
+		 b++;
+		 }
+		 break;
+	 }
+	 if (b->bc_main_type == SLANG_BC_LITERAL_AGET1)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_LVAR_LIT_AGET1;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b += 3;
+		 break;
+	 }
+	 break;
+	 }
+ }
+}
+
+static void optimize_block3 (SLBlock_Type *b)
+{
+ while (1)
+ {
+	switch (b->bc_main_type)
+	 {
+	 case SLANG_BC_LAST_BLOCK:
+	 return;
+
+	 default:
+	 b++;
+	 break;
+
+	 case SLANG_BC_SET_LOCAL_LVALUE:
+	 b++;
+	 if (b->bc_main_type == SLANG_BC_LITERAL_INT)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_SET_LOCLV_LIT_INT;
+		 b->bc_main_type = SLANG_BC_LITERAL_COMBINED;
+		 b++;
+		 break;
+	 }
+	 if (b->bc_main_type == SLANG_BC_LITERAL_AGET1)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_SET_LOCLV_LIT_AGET1;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+	 }
+	 if (b->bc_main_type == SLANG_BC_LVARIABLE)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_SET_LOCLV_LVAR;
+		 b->bc_main_type = SLANG_BC_LVARIABLE_COMBINED;
+		 b++;
+		 break;
+	 }
+	 if (b->bc_main_type == SLANG_BC_LAST_BLOCK)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_SET_LOCLV_LASTBLOCK;
+		 return;
+	 }
+	 break;
+
+	 case SLANG_BC_LVARIABLE:
+	 b++;
+	 if (b->bc_main_type == SLANG_BC_EARG_LVARIABLE)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_LVAR_EARG_LVAR;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+	 }
+	 if (b->bc_main_type == SLANG_BC_FIELD)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_LVAR_FIELD;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+	 }
+	 if (b->bc_main_type == SLANG_BC_LITERAL_INT)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_LVAR_LITERAL_INT;
+		 b->bc_main_type = SLANG_BC_LITERAL_COMBINED;
+		 b++;
+		 break;
+	 }
+	 if (b->bc_main_type == SLANG_BC_LVARIABLE_APUT1)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_LVAR_LVAR_APUT1;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+	 }
+	 if (b->bc_main_type == SLANG_BC_SET_STRUCT_LVALUE)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_LVAR_SET_FIELD;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+	 }
+	 if (b->bc_main_type == SLANG_BC_SET_GLOBAL_LVALUE)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_LVAR_SET_GLOB_LVAL;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+	 }
+	 break;
+
+	 case SLANG_BC_PVARIABLE:
+	 b++;
+	 if (b->bc_main_type == SLANG_BC_SET_GLOBAL_LVALUE)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_PVAR_SET_GLOB_LVAL;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+	 }
+	 break;
+
+	 case SLANG_BC_BINARY:
+	 /* Anything added here may need to be accounted for in do_compare() */
+	 b++;
+	 if (b->bc_main_type == SLANG_BC_LAST_BLOCK)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_BINARY_LASTBLOCK;
+		 return;
+	 }
+	 if (b->bc_main_type == SLANG_BC_SET_LOCAL_LVALUE)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_BINARY_SET_LOCLVAL;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+	 }
+	 if (b->bc_main_type == SLANG_BC_BINARY)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_BINARY2;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+	 }
+	 break;
+
+	 case SLANG_BC_EARG_LVARIABLE:
+	 b++;
+	 if (b->bc_main_type == SLANG_BC_INTRINSIC)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_EARG_LVARIABLE_INTRINSIC;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+	 }
+	 break;
+
+	 case SLANG_BC_LVARIABLE_AGET:
+	 b++;
+	 if (b->bc_main_type == SLANG_BC_SET_LOCAL_LVALUE)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_LVAR_AGET_SET_LOCLVAL;
+		 b->bc_main_type= SLANG_BC_COMBINED;
+		 b++;
+		 break;
+	 }
+	 break;
+
+	 case SLANG_BC_LLVARIABLE_BINARY:
+	 b += 3;
+	 if (b->bc_main_type == SLANG_BC_BINARY)
+	 {
+		 (b-3)->bc_main_type = SLANG_BC_LLVARIABLE_BINARY2;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+	 }
+	 if (b->bc_main_type == SLANG_BC_IF_BLOCK)
+	 {
+		 (b-3)->bc_main_type = SLANG_BC_LLVAR_BINARY_IF;
+		 b->bc_main_type = SLANG_BC_BLOCK_COMBINED;
+		 b++;
+		 break;
+	 }
+	 break;
+
+	 case SLANG_BC_LITERAL_AGET1:
+	 b += 3;
+	 if (b->bc_main_type == SLANG_BC_LITERAL_INT_BINARY)
+	 {
+		 (b-3)->bc_main_type = SLANG_BC_LIT_AGET1_INT_BINARY;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b += 2;
+		 break;
+	 }
+	 break;
+	 }
+ }
+}
+
+static void optimize_block2 (SLBlock_Type *b)
+{
+ while (1)
+ {
+	switch (b->bc_main_type)
+	 {
+	 default:
+	 b++;
+	 break;
+
+	 case SLANG_BC_LAST_BLOCK:
+	 return;
+
+	 case SLANG_BC_CALL_DIRECT_LVAR:
+	 if (b->b.call_function != start_arg_list)
+	 {
+		 b += 2;	 /* combined code, add 2 */
+		 break;
+	 }
+	 b += 2;		 /* combined code */
+	 if (((b-1)->bc_main_type == SLANG_BC_LVARIABLE_COMBINED)
+		 && (b->bc_main_type == SLANG_BC_LVARIABLE_AGET))
+	 {
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 (b-2)->bc_main_type = SLANG_BC_LVARIABLE_AGET1;
+		 b++;
+		 break;
+	 }
+	 if (((b-1)->bc_main_type == SLANG_BC_LVARIABLE_COMBINED)
+		 && (b->bc_main_type == SLANG_BC_LVARIABLE_APUT))
+	 {
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 (b-2)->bc_main_type = SLANG_BC_LVARIABLE_APUT1;
+		 b++;
+		 break;
+	 }
+	 break;
+
+	 case SLANG_BC_CALL_DIRECT_LINT:
+	 if (b->b.call_function != start_arg_list)
+	 {
+		 b += 2;	 /* combined code, add 2 */
+		 break;
+	 }
+	 b += 2;		 /* combined code */
+	 if (((b-1)->bc_main_type == SLANG_BC_LITERAL_COMBINED)
+		 && (b->bc_main_type == SLANG_BC_LVARIABLE_AGET))
+	 {
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 (b-2)->bc_main_type = SLANG_BC_LITERAL_AGET1;
+		 b++;
+		 break;
+	 }
+	 if (((b-1)->bc_main_type == SLANG_BC_LITERAL_COMBINED)
+		 && (b->bc_main_type == SLANG_BC_LVARIABLE_APUT))
+	 {
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 (b-2)->bc_main_type = SLANG_BC_LITERAL_APUT1;
+		 b++;
+		 break;
+	 }
+	 break;
+	 }
+ }
+}
+
+/* Note: Make sure lang_free_branch is suitably modified to account for
+ * changes here.
+ */
+static void optimize_block1 (SLBlock_Type *b)
+{
+ SLBlock_Type *bstart, *b1, *b2;
+ SLtype b2_main_type;
+
+ bstart = b;
+
+ while (1)
+ {
+	switch (b->bc_main_type)
+	 {
+	 case 0:
+	 return;
+
+	 default:
+	 b++;
+	 break;
+
+	 case SLANG_BC_SET_LOCAL_LVALUE:
+	 if ((b->bc_sub_type != SLANG_BCST_ASSIGN)
+		 || (bstart + 3 > b))
+	 {
+		 b++;
+		 continue;
+	 }
+	 b2 = b - 3;
+	 b2_main_type = b2->bc_main_type;
+
+	 switch (b2_main_type)
+	 {
+		case SLANG_BC_LLVARIABLE_BINARY:
+		 rearrange_optimized_optimized (b, SLANG_BC_LASSIGN_LLBINARY);
+		 break;
+		case SLANG_BC_LIVARIABLE_BINARY:
+		 rearrange_optimized_optimized (b, SLANG_BC_LASSIGN_LIBINARY);
+		 break;
+		case SLANG_BC_ILVARIABLE_BINARY:
+		 rearrange_optimized_optimized (b, SLANG_BC_LASSIGN_ILBINARY);
+		 break;
+		case SLANG_BC_LDVARIABLE_BINARY:
+		 rearrange_optimized_optimized (b, SLANG_BC_LASSIGN_LDBINARY);
+		 break;
+		case SLANG_BC_DLVARIABLE_BINARY:
+		 rearrange_optimized_optimized (b, SLANG_BC_LASSIGN_DLBINARY);
+		 break;
+	 }
+	 b++;
+	 break;
+
+	 case SLANG_BC_BINARY:
+	 if (bstart + 2 > b)
+	 {
+		 b++;
+		 break;
+	 }
+	 b2 = b-1;
+	 b1 = b2-1;
+	 b2_main_type = b2->bc_main_type;
+
+	 switch (b1->bc_main_type)
+	 {
+		case SLANG_LVARIABLE:
+		 if (b2_main_type == SLANG_LVARIABLE)
+		 rearrange_optimized_binary (b,
+						SLANG_BC_LLVARIABLE_BINARY,
+						SLANG_BC_LVARIABLE_COMBINED,
+						SLANG_BC_LVARIABLE_COMBINED);
+		 else if (b2_main_type == SLANG_GVARIABLE)
+		 rearrange_optimized_binary (b,
+						SLANG_BC_LGVARIABLE_BINARY,
+						SLANG_BC_LVARIABLE_COMBINED,
+						SLANG_BC_GVARIABLE_COMBINED);
+		 else if (b2_main_type == SLANG_BC_LITERAL_INT)
+		 rearrange_optimized_binary (b,
+						SLANG_BC_LIVARIABLE_BINARY,
+						SLANG_BC_LVARIABLE_COMBINED,
+						SLANG_BC_LITERAL_COMBINED);
+		 else if (b2_main_type == SLANG_BC_LITERAL_DBL)
+		 rearrange_optimized_binary (b,
+						SLANG_BC_LDVARIABLE_BINARY,
+						SLANG_BC_LVARIABLE_COMBINED,
+						SLANG_BC_LITERAL_COMBINED);
+		 break;
+
+		case SLANG_GVARIABLE:
+		 if (b2_main_type == SLANG_LVARIABLE)
+		 rearrange_optimized_binary (b,
+						SLANG_BC_GLVARIABLE_BINARY,
+						SLANG_BC_GVARIABLE_COMBINED,
+						SLANG_BC_LVARIABLE_COMBINED);
+		 else if (b2_main_type == SLANG_GVARIABLE)
+		 rearrange_optimized_binary (b,
+						SLANG_BC_GGVARIABLE_BINARY,
+						SLANG_BC_GVARIABLE_COMBINED,
+						SLANG_BC_GVARIABLE_COMBINED);
+		 break;
+
+		case SLANG_BC_LITERAL_INT:
+		 if (b2_main_type == SLANG_LVARIABLE)
+		 rearrange_optimized_binary (b,
+						SLANG_BC_ILVARIABLE_BINARY,
+						SLANG_BC_LITERAL_COMBINED,
+						SLANG_BC_LVARIABLE_COMBINED);
+		 break;
+
+		case SLANG_BC_LITERAL_DBL:
+		 if (b2_main_type == SLANG_LVARIABLE)
+		 rearrange_optimized_binary (b,
+						SLANG_BC_DLVARIABLE_BINARY,
+						SLANG_BC_LITERAL_COMBINED,
+						SLANG_BC_LVARIABLE_COMBINED);
+		 break;
+
+		default:
+		 if (b2_main_type == SLANG_LVARIABLE)
+		 rearrange_optimized_unary (b,
+					 SLANG_BC_LVARIABLE_BINARY,
+					 SLANG_BC_LVARIABLE_COMBINED);
+		 else if (b2_main_type == SLANG_GVARIABLE)
+		 rearrange_optimized_unary (b,
+					 SLANG_BC_GVARIABLE_BINARY,
+					 SLANG_BC_GVARIABLE_COMBINED);
+		 else if (b2_main_type == SLANG_BC_LITERAL_INT)
+		 rearrange_optimized_unary (b,
+					 SLANG_BC_LITERAL_INT_BINARY,
+					 SLANG_BC_LITERAL_COMBINED);
+		 else if (b2_main_type == SLANG_BC_LITERAL_DBL)
+		 rearrange_optimized_unary (b,
+					 SLANG_BC_LITERAL_DBL_BINARY,
+					 SLANG_BC_LITERAL_COMBINED);
+	 }
+	 b++;
+	 break;
+
+	 case SLANG_BC_CALL_DIRECT:
+	 b++;
+	 switch (b->bc_main_type)
+	 {
+		default:
+		 break;
+
+		case 0:
+		 return;
+
+		case SLANG_BC_INTRINSIC:
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 if ((b+1)->bc_main_type == 0)
+		 {
+		 (b-1)->bc_main_type = SLANG_BC_CALL_DIRECT_RETINTR;
+		 return;
+		 }
+		 (b-1)->bc_main_type = SLANG_BC_CALL_DIRECT_INTRINSIC;
+		 b++;
+		 break;
+		case SLANG_BC_LITERAL_STR:
+		 (b-1)->bc_main_type = SLANG_BC_CALL_DIRECT_LSTR;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+		case SLANG_BC_FUNCTION:
+		case SLANG_BC_PFUNCTION:
+		 (b-1)->bc_main_type = SLANG_BC_CALL_DIRECT_SLFUN;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+		case SLANG_BC_EARG_LVARIABLE:
+		 (b-1)->bc_main_type = SLANG_BC_CALL_DIRECT_EARG_LVAR;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+		case SLANG_BC_LITERAL_INT:
+		 b->bc_main_type = SLANG_BC_LITERAL_COMBINED;
+		 (b-1)->bc_main_type = SLANG_BC_CALL_DIRECT_LINT;
+		 b++;
+		 break;
+		case SLANG_BC_LVARIABLE:
+		 b->bc_main_type = SLANG_BC_LVARIABLE_COMBINED;
+		 (b-1)->bc_main_type = SLANG_BC_CALL_DIRECT_LVAR;
+		 b++;
+		 break;
+	 }
+	 break;
+
+	 case SLANG_BC_INTRINSIC:
+	 b++;
+	 switch (b->bc_main_type)
+	 {
+		case SLANG_BC_CALL_DIRECT:
+		 (b-1)->bc_main_type = SLANG_BC_INTRINSIC_CALL_DIRECT;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+#if 0
+		case SLANG_BC_BLOCK:
+		 (b-1)->bc_main_type = SLANG_BC_INTRINSIC_BLOCK;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+		 break;
+#endif
+
+		case 0:
+		 (b-1)->bc_main_type = SLANG_BC_RET_INTRINSIC;
+		 return;
+
+		default:
+		 break;
+	 }
+	 break;
+
+	 case SLANG_BC_BLOCK:
+	 if (b->bc_sub_type == SLANG_BCST_IF)
+	 {
+		 b->bc_main_type = SLANG_BC_IF_BLOCK;
+		 b++;
+		 break;
+	 }
+	 b++;
+	 break;
+	 case SLANG_BC_LITERAL_INT:
+	 b++;
+	 if (b->bc_main_type == SLANG_BC_RETURN)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_RET_LITERAL_INT;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+	 }
+	 break;
+
+	 case SLANG_BC_LVARIABLE:
+	 b++;
+	 if (b->bc_main_type == SLANG_BC_RETURN)
+	 {
+		 (b-1)->bc_main_type = SLANG_BC_RET_LVARIABLE;
+		 b->bc_main_type = SLANG_BC_COMBINED;
+		 b++;
+	 }
+	 break;
+	 }
+ }
+}
+
+static void optimize_block (SLBlock_Type *b)
+{
+ optimize_block1 (b);
+ optimize_block2 (b);
+ optimize_block3 (b);
+ optimize_block4 (b);
+}
+
+#endif
+
+static void end_define_function (void)
+{
+ /* free_local_variable_table (); */
+ _pSLns_deallocate_namespace (Locals_NameSpace);
+ Locals_NameSpace = NULL;
+ Local_Variable_Number = 0;
+ Function_Args_Number = 0;
+ Lang_Defining_Function = 0;
+}
+
+/* name will be NULL if the object is to simply terminate the function
+ * definition. See SLang_restart.
+ */
+static int lang_define_function (SLFUTURE_CONST char *name, unsigned char type, unsigned long hash,
+				 SLang_NameSpace_Type *ns)
+{
+ Function_Header_Type *h;
+
+ if (This_Compile_Block_Type != COMPILE_BLOCK_TYPE_FUNCTION)
+ {
+	_pSLang_verror (SL_SYNTAX_ERROR, "Premature end of function");
+	return -1;
+ }
+
+ /* terminate function */
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_LAST_BLOCK;
+ if (name == NULL)
+ {
+	end_define_function ();
+	return -1;
+ }
+
+ h = allocate_function_header (Function_Args_Number,
+				 Local_Variable_Number,
+				 This_Compile_Filename);
+ if (h == NULL)
+ {
+	end_define_function ();
+	return -1;
+ }
+
+ if (-1 == add_slang_function (name, type, hash, h, NULL, ns))
+ {
+	free_function_header (h);
+	end_define_function ();
+	return -1;
+ }
+
+ h->body = This_Compile_Block;
+ This_Compile_Block = NULL;
+#if USE_COMBINED_BYTECODES
+ optimize_block (h->body);
+#endif
+ end_define_function ();
+ pop_block_context ();
+
+ /* A function is only defined at top-level */
+ if (This_Compile_Block_Type != COMPILE_BLOCK_TYPE_TOP_LEVEL)
+ {
+	_pSLang_verror (SL_INTERNAL_ERROR, "Not at top-level");
+	return -1;
+ }
+ Compile_ByteCode_Ptr = This_Compile_Block;
+ return 0;
+}
+
+static int check_linkage (SLCONST char *name, unsigned long hash, int check_static)
+{
+ SLang_NameSpace_Type *ns;
+ int found = 0;
+
+ /* If the variable is already defined in the static hash table,
+ * generate an error.
+ */
+ ns = This_Private_NameSpace;
+ if ((ns != NULL) && (This_Static_NameSpace != ns))
+ found = (NULL != _pSLns_locate_hashed_name (ns, name, hash));
+
+ if ((found == 0) && (check_static))
+ {
+	ns = This_Static_NameSpace;
+	if ((ns != NULL) && (Global_NameSpace != ns))
+	 found = (NULL != _pSLns_locate_hashed_name (ns, name, hash));
+ }
+
+ if (found == 0)
+ return 0;
+
+ _pSLang_verror (SL_DUPLICATE_DEFINITION,
+		 "%s already has static or private linkage in this unit",
+		 name);
+ return -1;
+}
+
+static void define_private_function (SLFUTURE_CONST char *name, unsigned long hash)
+{
+ (void) lang_define_function (name, SLANG_PFUNCTION, hash, This_Private_NameSpace);
+}
+
+static void define_static_function (SLFUTURE_CONST char *name, unsigned long hash)
+{
+ if (0 == check_linkage (name, hash, 0))
+ (void) lang_define_function (name, SLANG_FUNCTION, hash, This_Static_NameSpace);
+}
+
+static void define_public_function (SLFUTURE_CONST char *name, unsigned long hash)
+{
+ if (0 == check_linkage (name, hash, 1))
+ (void) lang_define_function (name, SLANG_FUNCTION, hash, Global_NameSpace);
+}
+
+static void lang_end_block (void)
+{
+ SLBlock_Type *node, *branch;
+
+ if (This_Compile_Block_Type != COMPILE_BLOCK_TYPE_BLOCK)
+ {
+	_pSLang_verror (SL_SYNTAX_ERROR, "Not defining a block");
+	return;
+ }
+
+ /* terminate the block */
+/* #if SLANG_HAS_DEBUG_CODE */
+ Compile_ByteCode_Ptr->linenum = (unsigned short) This_Compile_Linenum;
+/* #endif */
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_LAST_BLOCK;
+ branch = This_Compile_Block; This_Compile_Block = NULL;
+
+#if USE_COMBINED_BYTECODES
+ optimize_block (branch);
+#endif
+
+ pop_block_context ();
+ node = Compile_ByteCode_Ptr++;
+
+ node->bc_main_type = SLANG_BC_BLOCK;
+ node->bc_sub_type = 0;
+ node->b.blk = branch;
+}
+
+static int lang_begin_block (void)
+{
+ return push_block_context (COMPILE_BLOCK_TYPE_BLOCK);
+}
+
+static int lang_check_space (void)
+{
+ size_t dn, n;
+ SLBlock_Type *p;
+
+ if (NULL == (p = This_Compile_Block))
+ {
+	_pSLang_verror (SL_INTERNAL_ERROR, "Top-level block not present");
+	return -1;
+ }
+
+ /* Allow 1 extra for terminator */
+ if (Compile_ByteCode_Ptr + 1 < This_Compile_Block_Max)
+ return 0;
+
+ n = (This_Compile_Block_Max - p);
+
+ /* enlarge the space by 20 objects */
+ dn = 20;
+
+ if (NULL == (p = (SLBlock_Type *) _SLrecalloc((char *)p, n+dn, sizeof(SLBlock_Type))))
+ return -1;
+ memset ((char *)(p+n), 0, dn*sizeof(SLBlock_Type));
+
+ n = Compile_ByteCode_Ptr - This_Compile_Block;
+ This_Compile_Block = p;
+ Compile_ByteCode_Ptr = p + n;
+ This_Compile_Block_Max = Compile_ByteCode_Ptr + dn;
+
+ return 0;
+}
+
+static int add_global_variable (SLCONST char *name, char name_type, unsigned long hash,
+				SLang_NameSpace_Type *ns)
+{
+ SLang_Name_Type *g;
+
+ /* Note the importance of checking if it is already defined or not. For example,
+ * suppose X is defined as an intrinsic variable. Then S-Lang code like:
+ * !if (is_defined("X")) { variable X; }
+ * will not result in a global variable X. On the other hand, this would
+ * not be an issue if 'variable' statements always were not processed
+ * immediately. That is, as it is now, 'if (0) {variable ZZZZ;}' will result
+ * in the variable ZZZZ being defined because of the immediate processing.
+ * The current solution is to do: if (0) { eval("variable ZZZZ;"); }
+ */
+ /* hash = SLcompute_string_hash (name); */
+ g = _pSLns_locate_hashed_name (ns, name, hash);
+
+ if (g != NULL)
+ {
+	if (g->name_type == name_type)
+	 return 0;
+ }
+
+ if (NULL == add_global_name (name, hash, name_type,
+				sizeof (SLang_Global_Var_Type), ns))
+ return -1;
+
+ return 0;
+}
+
+int SLadd_global_variable (SLCONST char *name)
+{
+ if (-1 == init_interpreter ())
+ return -1;
+
+ return add_global_variable (name, SLANG_GVARIABLE,
+			 SLcompute_string_hash (name),
+			 Global_NameSpace);
+}
+
+static int add_local_variable (SLCONST char *name, unsigned long hash)
+{
+ SLang_Local_Var_Type *t;
+
+ /* local variable */
+ if (Local_Variable_Number >= SLANG_MAX_LOCAL_VARIABLES)
+ {
+	_pSLang_verror (SL_SYNTAX_ERROR, "Too many local variables");
+	return -1;
+ }
+
+ if (NULL != _pSLns_locate_hashed_name (Locals_NameSpace, name, hash))
+ {
+	_pSLang_verror (SL_SYNTAX_ERROR, "Local variable %s has already been defined", name);
+	return -1;
+ }
+
+ t = (SLang_Local_Var_Type *)
+ add_name_to_namespace (name, hash,
+			 sizeof (SLang_Local_Var_Type), SLANG_LVARIABLE,
+			 Locals_NameSpace);
+ if (t == NULL)
+ return -1;
+
+ t->local_var_number = Local_Variable_Number;
+ Local_Variable_NamesLocal_Variable_Number = t->name;
+ /* we will copy this later -- it is an slstring and will persist as long
+ * as the Locals_NameSpace persists
+ */
+
+ Local_Variable_Number++;
+ return 0;
+}
+
+static void (*Compile_Mode_Function) (_pSLang_Token_Type *);
+static void compile_basic_token_mode (_pSLang_Token_Type *);
+
+/* This function could be called when an error has occured during parsing.
+ * Its purpose is to "close" any currently opened blocks and functions.
+ */
+void reset_compiler_state (void)
+{
+ _pSLcompile_ptr = _pSLcompile;
+ Compile_Mode_Function = compile_basic_token_mode;
+
+ while (This_Compile_Block_Type == COMPILE_BLOCK_TYPE_BLOCK)
+ lang_end_block();
+
+ if (This_Compile_Block_Type == COMPILE_BLOCK_TYPE_FUNCTION)
+ {
+	/* Terminate function definition and free variables */
+	lang_define_function (NULL, SLANG_FUNCTION, 0, Global_NameSpace);
+	if (lang_free_branch (This_Compile_Block))
+	 {
+	 SLfree((char *)This_Compile_Block);
+	 This_Compile_Block = NULL;
+	 }
+ }
+ Lang_Defining_Function = 0;
+
+ while ((This_Compile_Block_Type != COMPILE_BLOCK_TYPE_TOP_LEVEL)
+	 && (This_Compile_Block_Type != COMPILE_BLOCK_TYPE_NONE)
+	 && (0 == pop_block_context ()))
+ ;
+}
+
+/* The active interpreter is the one that is currently executing. We may
+ * have a situation where: slang -> C -> slang
+ * Each "slang" is an interpreter and only one is active.
+ */
+static void reset_active_interpreter (void)
+{
+ reset_compiler_state ();
+
+ Trace_Mode = 0;
+ Lang_Break = Lang_Return = 0;
+}
+
+static void free_local_variables (void)
+{
+ while (Local_Variable_Frame > Local_Variable_Stack)
+ {
+	SLang_free_object (Local_Variable_Frame);
+	Local_Variable_Frame--;
+ }
+}
+
+static void clear_switch_objects (void)
+{
+ SLang_Object_Type *p;
+
+ p = Switch_Objects;
+ while (p < Switch_Obj_Max)
+ {
+	if (p->o_data_type != 0)
+	 {
+	 SLang_free_object (p);
+	 p->o_data_type = 0;
+	 }
+	p++;
+ }
+ Switch_Obj_Ptr = Switch_Objects;
+}
+
+void SLang_restart (int localv)
+{
+ reset_active_interpreter ();
+
+ if (SLang_get_error () == SL_STACK_OVERFLOW)
+ {
+	/* This loop guarantees that the stack is properly cleaned. */
+	/* The validity of this step needs to be reexamined in the context
+	 * of the new exception handling for slang 2
+	 */
+	while (Stack_Pointer != Run_Stack)
+	 {
+	 SLdo_pop ();
+	 }
+ }
+
+ if (localv)
+ {
+	free_local_variables ();
+	clear_switch_objects ();
+	while (0 == pop_compile_context ())
+	 ;
+ }
+ _pSLerr_print_message_queue ();
+ _pSLerr_clear_error (0);
+}
+
+#if SLANG_HAS_DEBUG_CODE
+static void compile_line_info (_pSLang_BC_Type bc_main_type, SLFUTURE_CONST char *file, long linenum)
+{
+ Linenum_Info_Type *info;
+
+ if (NULL == (info = (Linenum_Info_Type *) SLmalloc (sizeof (Linenum_Info_Type))))
+ return;
+
+ info->linenum = (int) linenum;
+ if (file == NULL)
+ file = "";
+
+ if (NULL == (info->filename = SLang_create_slstring (file)))
+ {
+	SLfree ((char *) info);
+	return;
+ }
+ Compile_ByteCode_Ptr->bc_main_type = bc_main_type;
+ Compile_ByteCode_Ptr->b.line_info = info;
+ lang_try_now ();
+}
+
+static void set_line_number_info (long val)
+{
+ This_Compile_Linenum = (unsigned int) val;
+}
+#endif
+
+static void compile_directive (unsigned char sub_type, int delay_inner_interp)
+{
+ /* This function is called only from compile_directive_mode which is
+ * only possible when a block is available.
+ */
+
+ /* use BLOCK */
+ Compile_ByteCode_Ptr--;
+ Compile_ByteCode_Ptr->bc_sub_type = sub_type;
+
+ if (delay_inner_interp)
+ {
+	Compile_ByteCode_Ptr->linenum = (unsigned short) This_Compile_Linenum;
+	Compile_ByteCode_Ptr++;
+	return;
+ }
+ lang_try_now ();
+}
+
+static void compile_unary (int op, _pSLang_BC_Type mt)
+{
+ Compile_ByteCode_Ptr->bc_main_type = mt;
+ Compile_ByteCode_Ptr->b.i_blk = op;
+ Compile_ByteCode_Ptr->bc_sub_type = 0;
+
+ lang_try_now ();
+}
+
+static void compile_binary (int op)
+{
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_BINARY;
+ Compile_ByteCode_Ptr->b.i_blk = op;
+ Compile_ByteCode_Ptr->bc_sub_type = 0;
+
+ lang_try_now ();
+}
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+static int try_compressed_bytecode (_pSLang_BC_Type last_bc, _pSLang_BC_Type bc)
+{
+ if (Compile_ByteCode_Ptr != This_Compile_Block)
+ {
+	SLBlock_Type *b;
+	b = Compile_ByteCode_Ptr - 1;
+	if (b->bc_main_type == last_bc)
+	 {
+	 Compile_ByteCode_Ptr = b;
+	 b->bc_main_type = bc;
+	 lang_try_now ();
+	 return 0;
+	 }
+ }
+ return -1;
+}
+#endif
+
+/* This is a hack */
+typedef struct _Special_NameTable_Type
+{
+ SLCONST char *name;
+ int (*fun) (struct _Special_NameTable_Type *, _pSLang_Token_Type *);
+ VOID_STAR blk_data;
+ _pSLang_BC_Type main_type;
+}
+Special_NameTable_Type;
+
+static int handle_special (Special_NameTable_Type *nt, _pSLang_Token_Type *tok)
+{
+ (void) tok;
+ Compile_ByteCode_Ptr->bc_main_type = nt->main_type;
+ Compile_ByteCode_Ptr->b.ptr_blk = nt->blk_data;
+ return 0;
+}
+
+static int handle_special_file (Special_NameTable_Type *nt, _pSLang_Token_Type *tok)
+{
+ SLFUTURE_CONST char *name;
+
+ (void) nt; (void) tok;
+
+ if (This_Private_NameSpace == NULL) name = "***Unknown***";
+ else
+ name = This_Private_NameSpace->name;
+
+ name = SLang_create_slstring (name);
+ if (name == NULL)
+ return -1;
+
+ Compile_ByteCode_Ptr->b.s_blk = name;
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_LITERAL_STR;
+ Compile_ByteCode_Ptr->bc_sub_type = SLANG_STRING_TYPE;
+ Compile_ByteCode_Ptr->bc_flags |= BC_LITERAL_MASK;
+ return 0;
+}
+
+static int handle_special_line (Special_NameTable_Type *nt, _pSLang_Token_Type *tok)
+{
+ (void) nt;
+#if SLANG_HAS_DEBUG_CODE
+ if ((Compile_ByteCode_Ptr->b.l_blk = (long) tok->line_number) <= 0)
+ Compile_ByteCode_Ptr->b.l_blk = This_Compile_Linenum;
+#else
+ (void) tok;
+#endif
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_LITERAL;
+ Compile_ByteCode_Ptr->bc_sub_type = SLANG_UINT_TYPE;
+ Compile_ByteCode_Ptr->bc_flags |= BC_LITERAL_MASK;
+
+ return 0;
+}
+
+static Special_NameTable_Type Special_Name_Table =
+{
+ {"EXECUTE_ERROR_BLOCK", handle_special, NULL, SLANG_BC_X_ERROR},
+ {"X_USER_BLOCK0", handle_special, NULL, SLANG_BC_X_USER0},
+ {"X_USER_BLOCK1", handle_special, NULL, SLANG_BC_X_USER1},
+ {"X_USER_BLOCK2", handle_special, NULL, SLANG_BC_X_USER2},
+ {"X_USER_BLOCK3", handle_special, NULL, SLANG_BC_X_USER3},
+ {"X_USER_BLOCK4", handle_special, NULL, SLANG_BC_X_USER4},
+ {"__FILE__", handle_special_file, NULL, SLANG_BC_LAST_BLOCK},
+ {"__LINE__", handle_special_line, NULL, SLANG_BC_LAST_BLOCK},
+#if 0
+ {"__NAMESPACE__", handle_special_namespace, NULL, SLANG_BC_LAST_BLOCK},
+#endif
+ {NULL, NULL, NULL, SLANG_BC_LAST_BLOCK}
+};
+
+static void compile_hashed_identifier (SLCONST char *name, unsigned long hash, _pSLang_Token_Type *tok)
+{
+ SLang_Name_Type *entry;
+ _pSLang_BC_Type name_type;
+
+ entry = locate_hashed_name (name, hash, 1);
+
+ if (entry == NULL)
+ {
+	Special_NameTable_Type *nt = Special_Name_Table;
+
+	while (nt->name != NULL)
+	 {
+	 if (strcmp (name, nt->name))
+	 {
+		 nt++;
+		 continue;
+	 }
+
+	 if (0 == (*nt->fun)(nt, tok))
+	 lang_try_now ();
+	 return;
+	 }
+
+	_pSLang_verror (SL_UNDEFINED_NAME, "%s is undefined", name);
+	return;
+ }
+
+ name_type = (_pSLang_BC_Type)entry->name_type;
+ Compile_ByteCode_Ptr->bc_main_type = name_type;
+
+ if (name_type == SLANG_LVARIABLE) /* == SLANG_BC_LVARIABLE */
+ Compile_ByteCode_Ptr->b.i_blk = ((SLang_Local_Var_Type *) entry)->local_var_number;
+ else
+ Compile_ByteCode_Ptr->b.nt_blk = entry;
+
+ lang_try_now ();
+}
+
+static void compile_tmp_variable (SLCONST char *name, unsigned long hash)
+{
+ SLang_Name_Type *entry;
+ unsigned char name_type;
+
+ if (NULL == (entry = locate_hashed_name (name, hash, 1)))
+ {
+	_pSLang_verror (SL_UNDEFINED_NAME, "%s is undefined", name);
+	return;
+ }
+
+ name_type = entry->name_type;
+ switch (name_type)
+ {
+ case SLANG_LVARIABLE:
+	Compile_ByteCode_Ptr->b.i_blk = ((SLang_Local_Var_Type *) entry)->local_var_number;
+	break;
+
+ case SLANG_GVARIABLE:
+ case SLANG_PVARIABLE:
+	Compile_ByteCode_Ptr->b.nt_blk = entry;
+	break;
+
+ default:
+	_pSLang_verror (SL_SYNTAX_ERROR, "__tmp(%s) does not specifiy a variable", name);
+	return;
+ }
+
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_TMP;
+ Compile_ByteCode_Ptr->bc_sub_type = name_type;
+
+ lang_try_now ();
+}
+
+static void compile_simple (_pSLang_BC_Type main_type)
+{
+ Compile_ByteCode_Ptr->bc_main_type = main_type;
+ Compile_ByteCode_Ptr->bc_sub_type = 0;
+ Compile_ByteCode_Ptr->b.blk = NULL;
+ lang_try_now ();
+}
+
+static void compile_identifier (SLCONST char *name, _pSLang_Token_Type *tok)
+{
+ compile_hashed_identifier (name, SLcompute_string_hash (name), tok);
+}
+
+static void compile_call_direct (int (*f) (void), _pSLang_BC_Type byte_code)
+{
+ Compile_ByteCode_Ptr->b.call_function = f;
+ Compile_ByteCode_Ptr->bc_main_type = byte_code;
+ Compile_ByteCode_Ptr->bc_sub_type = 0;
+ lang_try_now ();
+}
+
+static void compile_lvar_call_direct (int (*f)(void), _pSLang_BC_Type bc,
+				 _pSLang_BC_Type frame_op)
+{
+#if 1 && SLANG_OPTIMIZE_FOR_SPEED
+ if (0 == try_compressed_bytecode (SLANG_BC_LVARIABLE, bc))
+ return;
+#else
+ (void) bc;
+#endif
+
+ compile_call_direct (f, frame_op);
+}
+
+static void compile_integer (long i, _pSLang_BC_Type bc_main_type, SLtype bc_sub_type)
+{
+ Compile_ByteCode_Ptr->b.l_blk = i;
+ Compile_ByteCode_Ptr->bc_main_type = bc_main_type;
+ Compile_ByteCode_Ptr->bc_sub_type = bc_sub_type;
+ Compile_ByteCode_Ptr->bc_flags |= BC_LITERAL_MASK;
+
+ lang_try_now ();
+}
+
+#ifdef HAVE_LONG_LONG
+static void compile_llong (long long i, _pSLang_BC_Type bc_main_type, SLtype bc_sub_type)
+{
+# if LLONG_IS_NOT_LONG
+ long long *ptr;
+
+ if (NULL == (ptr = (long long *) SLmalloc (sizeof(long long))))
+ return;
+ *ptr = i;
+
+ Compile_ByteCode_Ptr->b.llong_blk = ptr;
+# else
+ Compile_ByteCode_Ptr->b.l_blk = i;
+# endif
+ Compile_ByteCode_Ptr->bc_main_type = bc_main_type;
+ Compile_ByteCode_Ptr->bc_sub_type = bc_sub_type;
+ Compile_ByteCode_Ptr->bc_flags |= BC_LITERAL_MASK;
+
+ lang_try_now ();
+}
+#endif
+
+#if SLANG_HAS_FLOAT
+static void compile_double (_pSLang_Token_Type *t, _pSLang_BC_Type main_type, SLtype type)
+{
+ unsigned int factor = 1;
+ double *ptr;
+ double d;
+
+ d = _pSLang_atof (t->v.s_val);
+
+#if SLANG_HAS_COMPLEX
+ if (type == SLANG_COMPLEX_TYPE) factor = 2;
+#endif
+ if (NULL == (ptr = (double *) SLmalloc(factor * sizeof(double))))
+ return;
+
+ Compile_ByteCode_Ptr->b.double_blk = ptr;
+#if SLANG_HAS_COMPLEX
+ if (type == SLANG_COMPLEX_TYPE)
+ *ptr++ = 0;
+#endif
+ *ptr = d;
+
+ Compile_ByteCode_Ptr->bc_main_type = main_type;
+ Compile_ByteCode_Ptr->bc_sub_type = type;
+ Compile_ByteCode_Ptr->bc_flags |= BC_LITERAL_MASK;
+ lang_try_now ();
+}
+
+static void compile_float (_pSLang_Token_Type *t)
+{
+ float f = (float) _pSLang_atof (t->v.s_val);
+
+ Compile_ByteCode_Ptr->b.float_blk = f;
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_LITERAL;
+ Compile_ByteCode_Ptr->bc_sub_type = SLANG_FLOAT_TYPE;
+ Compile_ByteCode_Ptr->bc_flags |= BC_LITERAL_MASK;
+ lang_try_now ();
+}
+
+#endif
+
+static void compile_string (SLCONST char *s, unsigned long hash)
+{
+ if (NULL == (Compile_ByteCode_Ptr->b.s_blk = _pSLstring_dup_hashed_string (s, hash)))
+ return;
+
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_LITERAL_STR;
+ Compile_ByteCode_Ptr->bc_sub_type = SLANG_STRING_TYPE;
+ Compile_ByteCode_Ptr->bc_flags |= BC_LITERAL_MASK;
+
+ lang_try_now ();
+}
+
+static void compile_string_dollar (SLCONST char *s, unsigned long hash)
+{
+ if (NULL == (Compile_ByteCode_Ptr->b.s_blk = _pSLstring_dup_hashed_string (s, hash)))
+ return;
+
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_DOLLAR_STR;
+ Compile_ByteCode_Ptr->bc_sub_type = SLANG_STRING_TYPE;
+ Compile_ByteCode_Ptr->bc_flags |= BC_LITERAL_MASK;
+
+ lang_try_now ();
+}
+
+static void compile_bstring (SLang_BString_Type *s)
+{
+ if (NULL == (Compile_ByteCode_Ptr->b.bs_blk = SLbstring_dup (s)))
+ return;
+
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_LITERAL;
+ Compile_ByteCode_Ptr->bc_sub_type = SLANG_BSTRING_TYPE;
+ Compile_ByteCode_Ptr->bc_flags |= BC_LITERAL_MASK;
+
+ lang_try_now ();
+}
+
+static SLang_Name_Type *locate_hashed_name_autodeclare (SLFUTURE_CONST char *name, unsigned long hash,
+							unsigned char assign_type)
+{
+ SLang_Name_Type *v;
+
+ v = locate_hashed_name (name, hash, 1);
+
+ if (v != NULL)
+ return v;
+
+ if ((_pSLang_Auto_Declare_Globals == 0)
+ || Lang_Defining_Function
+ || (NULL != strchr (name, '-')) /* namespace->name form */
+ || (assign_type != SLANG_BCST_ASSIGN)
+ || (This_Static_NameSpace == NULL))
+ {
+	_pSLang_verror (SL_UNDEFINED_NAME, "%s is undefined", name);
+	return NULL;
+ }
+ /* Note that function local variables are not at top level */
+
+ /* Variables that are automatically declared are given static
+ * scope.
+ */
+ if ((NULL != SLang_Auto_Declare_Var_Hook)
+ && (-1 == (*SLang_Auto_Declare_Var_Hook) (name)))
+ return NULL;
+
+ if ((-1 == add_global_variable (name, SLANG_GVARIABLE, hash, This_Static_NameSpace))
+ || (NULL == (v = locate_hashed_name (name, hash, 1))))
+ return NULL;
+
+ return v;
+}
+
+/* assign_type is one of SLANG_BCST_ASSIGN, ... values */
+static void compile_assign (unsigned char assign_type,
+			 SLFUTURE_CONST char *name, unsigned long hash)
+{
+ SLang_Name_Type *v;
+ _pSLang_BC_Type main_type;
+ SLang_Class_Type *cl;
+
+ if (NULL == (v = locate_hashed_name_autodeclare (name, hash, assign_type)))
+ return;
+
+ switch (v->name_type)
+ {
+ case SLANG_LVARIABLE:
+	main_type = SLANG_BC_SET_LOCAL_LVALUE;
+	Compile_ByteCode_Ptr->b.i_blk = ((SLang_Local_Var_Type *) v)->local_var_number;
+	break;
+
+ case SLANG_GVARIABLE:
+ case SLANG_PVARIABLE:
+	main_type = SLANG_BC_SET_GLOBAL_LVALUE;
+	Compile_ByteCode_Ptr->b.nt_blk = v;
+	break;
+
+ case SLANG_IVARIABLE:
+	GET_CLASS(cl, ((SLang_Intrin_Var_Type *)v)->type);
+	if (cl->cl_class_type != SLANG_CLASS_TYPE_SCALAR)
+	 {
+	 _pSLang_verror (SL_Forbidden_Error, "Assignment to %s is not allowed", name);
+	 return;
+	 }
+	main_type = SLANG_BC_SET_INTRIN_LVALUE;
+	Compile_ByteCode_Ptr->b.nt_blk = v;
+	break;
+
+ case SLANG_RVARIABLE:
+	_pSLang_verror (SL_READONLY_ERROR, "%s is read-only", name);
+	return;
+
+ default:
+	_pSLang_verror (SL_Forbidden_Error, "%s may not be used as an lvalue", name);
+	return;
+ }
+
+ Compile_ByteCode_Ptr->bc_sub_type = assign_type;
+ Compile_ByteCode_Ptr->bc_main_type = main_type;
+
+ lang_try_now ();
+}
+
+#if 0
+static void compile_deref_assign (char *name, unsigned long hash)
+{
+ SLang_Name_Type *v;
+
+ v = locate_hashed_name (name, hash, 1);
+
+ if (v == NULL)
+ {
+	_pSLang_verror (SL_UNDEFINED_NAME, "%s is undefined", name);
+	return;
+ }
+
+ switch (v->name_type)
+ {
+ case SLANG_LVARIABLE:
+	Compile_ByteCode_Ptr->b.i_blk = ((SLang_Local_Var_Type *) v)->local_var_number;
+	break;
+
+ case SLANG_GVARIABLE:
+ case SLANG_PVARIABLE:
+	Compile_ByteCode_Ptr->b.nt_blk = v;
+	break;
+
+ default:
+	/* FIXME: Priority=low
+	 * This could be made to work. It is not a priority because
+	 * I cannot imagine application intrinsics which are references.
+	 */
+	_pSLang_verror (SL_NOT_IMPLEMENTED, "Deref assignment to %s is not allowed", name);
+	return;
+ }
+
+ Compile_ByteCode_Ptr->bc_sub_type = v->name_type;
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_DEREF_ASSIGN;
+
+ lang_try_now ();
+}
+#endif
+static void
+compile_struct_assign (_pSLang_Token_Type *t)
+{
+ Compile_ByteCode_Ptr->bc_sub_type = SLANG_BCST_ASSIGN + (t->type - _STRUCT_ASSIGN_TOKEN);
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_SET_STRUCT_LVALUE;
+ Compile_ByteCode_Ptr->b.s_blk = _pSLstring_dup_hashed_string (t->v.s_val, t->hash);
+ lang_try_now ();
+}
+
+static void
+compile_array_assign (_pSLang_Token_Type *t)
+{
+ Compile_ByteCode_Ptr->bc_sub_type = SLANG_BCST_ASSIGN + (t->type - _ARRAY_ASSIGN_TOKEN);
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_SET_ARRAY_LVALUE;
+ Compile_ByteCode_Ptr->b.s_blk = NULL;
+ lang_try_now ();
+}
+
+static void
+compile_deref_assign (_pSLang_Token_Type *t)
+{
+ Compile_ByteCode_Ptr->bc_sub_type = SLANG_BCST_ASSIGN + (t->type - _DEREF_ASSIGN_TOKEN);
+ Compile_ByteCode_Ptr->bc_main_type = SLANG_BC_SET_DEREF_LVALUE;
+ Compile_ByteCode_Ptr->b.s_blk = NULL;
+ lang_try_now ();
+}
+
+static void compile_dot (_pSLang_Token_Type *t, _pSLang_BC_Type bc_main_type)
+{
+ Compile_ByteCode_Ptr->bc_main_type = bc_main_type;
+ Compile_ByteCode_Ptr->b.s_blk = _pSLstring_dup_hashed_string(t->v.s_val, t->hash);
+ lang_try_now ();
+}
+
+static void compile_ref (SLFUTURE_CONST char *name, unsigned long hash)
+{
+ SLang_Name_Type *entry;
+ _pSLang_BC_Type main_type;
+
+ if (NULL == (entry = locate_hashed_name_autodeclare (name, hash, SLANG_BCST_ASSIGN)))
+ return;
+
+ main_type = (_pSLang_BC_Type) entry->name_type;
+
+ if (main_type == SLANG_LVARIABLE)
+ {
+	main_type = SLANG_BC_LOBJPTR;
+	Compile_ByteCode_Ptr->b.i_blk = ((SLang_Local_Var_Type *)entry)->local_var_number;
+ }
+ else
+ {
+	main_type = SLANG_BC_GOBJPTR;
+	Compile_ByteCode_Ptr->b.nt_blk = entry;
+ }
+
+ Compile_ByteCode_Ptr->bc_main_type = main_type;
+ lang_try_now ();
+}
+
+static void compile_break (_pSLang_BC_Type break_type,
+			 int requires_block, int requires_fun,
+			 SLCONST char *str, int opt_val)
+{
+ if ((requires_fun
+	&& (Lang_Defining_Function == 0))
+ || (requires_block
+	 && (This_Compile_Block_Type != COMPILE_BLOCK_TYPE_BLOCK)))
+ {
+	_pSLang_verror (SL_SYNTAX_ERROR, "misplaced %s", str);
+	return;
+ }
+
+ Compile_ByteCode_Ptr->bc_main_type = break_type;
+ Compile_ByteCode_Ptr->bc_sub_type = 0;
+ Compile_ByteCode_Ptr->b.i_blk = opt_val;
+
+ lang_try_now ();
+}
+
+static void compile_public_variable_mode (_pSLang_Token_Type *t)
+{
+ if (t->type == IDENT_TOKEN)
+ {
+	if (-1 == check_linkage (t->v.s_val, t->hash, 1))
+	 return;
+	add_global_variable (t->v.s_val, SLANG_GVARIABLE, t->hash, Global_NameSpace);
+ }
+ else if (t->type == CBRACKET_TOKEN)
+ Compile_Mode_Function = compile_basic_token_mode;
+ else
+ _pSLang_verror (SL_SYNTAX_ERROR, "Misplaced token in variable list");
+}
+
+static void compile_local_variable_mode (_pSLang_Token_Type *t)
+{
+ if (Locals_NameSpace == NULL)
+ {
+	Locals_NameSpace = _pSLns_allocate_namespace ("**locals**", SLLOCALS_HASH_TABLE_SIZE);
+	if (Locals_NameSpace == NULL)
+	 return;
+ }
+
+ if (t->type == IDENT_TOKEN)
+ add_local_variable (t->v.s_val, t->hash);
+ else if (t->type == CBRACKET_TOKEN)
+ Compile_Mode_Function = compile_basic_token_mode;
+ else
+ _pSLang_verror (SL_SYNTAX_ERROR, "Misplaced token in variable list");
+}
+
+static void compile_static_variable_mode (_pSLang_Token_Type *t)
+{
+ if (t->type == IDENT_TOKEN)
+ {
+	if (-1 == check_linkage (t->v.s_val, t->hash, 0))
+	 return;
+	add_global_variable (t->v.s_val, SLANG_GVARIABLE, t->hash, This_Static_NameSpace);
+ }
+ else if (t->type == CBRACKET_TOKEN)
+ Compile_Mode_Function = compile_basic_token_mode;
+ else
+ _pSLang_verror (SL_SYNTAX_ERROR, "Misplaced token in variable list");
+}
+
+static void compile_private_variable_mode (_pSLang_Token_Type *t)
+{
+ if (t->type == IDENT_TOKEN)
+ add_global_variable (t->v.s_val, SLANG_PVARIABLE, t->hash, This_Private_NameSpace);
+ else if (t->type == CBRACKET_TOKEN)
+ Compile_Mode_Function = compile_basic_token_mode;
+ else
+ _pSLang_verror (SL_SYNTAX_ERROR, "Misplaced token in variable list");
+}
+
+static void compile_function_mode (_pSLang_Token_Type *t)
+{
+ if (-1 == lang_check_space ())
+ return;
+
+ if (t->type != IDENT_TOKEN)
+ _pSLang_verror (SL_SYNTAX_ERROR, "Expecting a function name");
+ else
+ lang_define_function (t->v.s_val, SLANG_FUNCTION, t->hash, Global_NameSpace);
+
+ Compile_Mode_Function = compile_basic_token_mode;
+}
+
+/* An error block is not permitted to contain continue or break statements.
+ * This restriction may be removed later but for now reject them.
+ */
+static int check_error_block (void)
+{
+ SLBlock_Type *p;
+ _pSLang_BC_Type t;
+
+ /* Back up to the block and then scan it. */
+ p = (Compile_ByteCode_Ptr - 1)->b.blk;
+
+ while (0 != (t = p->bc_main_type))
+ {
+	if ((t == SLANG_BC_BREAK)
+	 || (t == SLANG_BC_CONTINUE))
+	 {
+	 _pSLang_verror (SL_SYNTAX_ERROR,
+			 "An ERROR_BLOCK is not permitted to contain continue or break statements");
+	 return -1;
+	 }
+	p++;
+ }
+ return 0;
+}
+
+/* The only allowed tokens are the directives and another block start.
+ * The mode is only active if a block is available. The inner_interp routine
+ * expects such safety checks.
+ */
+static void compile_directive_mode (_pSLang_Token_Type *t)
+{
+ int bc_sub_type;
+ int delay;
+
+ if (-1 == lang_check_space ())
+ return;
+
+ bc_sub_type = -1;
+ delay = 0;
+ switch (t->type)
+ {
+ case FOREVER_TOKEN:
+	bc_sub_type = SLANG_BCST_FOREVER;
+	delay = 1;
+	break;
+
+ case IFNOT_TOKEN:
+	bc_sub_type = SLANG_BCST_IFNOT;
+	break;
+
+ case IF_TOKEN:
+	bc_sub_type = SLANG_BCST_IF;
+	break;
+
+ case ANDELSE_TOKEN:
+	bc_sub_type = SLANG_BCST_ANDELSE;
+	break;
+
+ case SWITCH_TOKEN:
+	bc_sub_type = SLANG_BCST_SWITCH;
+	break;
+
+ case EXITBLK_TOKEN:
+	if (Lang_Defining_Function == 0)
+	 {
+	 _pSLang_verror (SL_SYNTAX_ERROR, "misplaced EXIT_BLOCK");
+	 break;
+	 }
+	bc_sub_type = SLANG_BCST_EXIT_BLOCK;
+	break;
+
+ case ERRBLK_TOKEN:
+	if (This_Compile_Block_Type == COMPILE_BLOCK_TYPE_TOP_LEVEL)
+	 {
+	 _pSLang_verror (SL_SYNTAX_ERROR, "misplaced ERROR_BLOCK");
+	 break;
+	 }
+	if (0 == check_error_block ())
+	 bc_sub_type = SLANG_BCST_ERROR_BLOCK;
+	break;
+
+ case USRBLK0_TOKEN:
+ case USRBLK1_TOKEN:
+ case USRBLK2_TOKEN:
+ case USRBLK3_TOKEN:
+ case USRBLK4_TOKEN:
+	/* if (This_Compile_Block_Type == COMPILE_BLOCK_TYPE_TOP_LEVEL) */
+	if (Lang_Defining_Function == 0)
+	 {
+	 _pSLang_verror (SL_SYNTAX_ERROR, "misplaced USER_BLOCK");
+	 break;
+	 }
+	bc_sub_type = SLANG_BCST_USER_BLOCK0 + (t->type - USRBLK0_TOKEN);
+	break;
+
+ case NOTELSE_TOKEN:
+	bc_sub_type = SLANG_BCST_NOTELSE;
+	break;
+
+ case ELSE_TOKEN:
+	bc_sub_type = SLANG_BCST_ELSE;
+	break;
+#ifdef LOOP_ELSE_TOKEN
+ case LOOP_ELSE_TOKEN:
+	bc_sub_type = SLANG_BCST_LOOP_ELSE;
+	break;
+#endif
+ case LOOP_THEN_TOKEN:
+	bc_sub_type = SLANG_BCST_LOOP_THEN;
+	break;
+
+ case LOOP_TOKEN:
+	bc_sub_type = SLANG_BCST_LOOP;
+	delay = 1;
+	break;
+
+ case DOWHILE_TOKEN:
+	bc_sub_type = SLANG_BCST_DOWHILE;
+	delay = 1;
+	break;
+
+ case WHILE_TOKEN:
+	bc_sub_type = SLANG_BCST_WHILE;
+	delay = 1;
+	break;
+
+ case ORELSE_TOKEN:
+	bc_sub_type = SLANG_BCST_ORELSE;
+	break;
+
+ case _FOR_TOKEN:
+	bc_sub_type = SLANG_BCST_FOR;
+	delay = 1;
+	break;
+
+ case FOR_TOKEN:
+	bc_sub_type = SLANG_BCST_CFOR;
+	delay = 1;
+	break;
+
+ case FOREACH_TOKEN:
+	delay = 1;
+	bc_sub_type = SLANG_BCST_FOREACH;
+	break;
+
+ case FOREACH_EARGS_TOKEN:
+	delay = 1;
+	bc_sub_type = SLANG_BCST_FOREACH_EARGS;
+	break;
+
+ case OBRACE_TOKEN:
+	lang_begin_block ();
+	break;
+
+ case TRY_TOKEN:
+	bc_sub_type = SLANG_BCST_TRY;
+	break;
+
+ case SC_OR_TOKEN:
+	bc_sub_type = SLANG_BCST_SC_OR;
+	break;
+
+ case SC_AND_TOKEN:
+	bc_sub_type = SLANG_BCST_SC_AND;
+	break;
+
+ case _COMPARE_TOKEN:
+	bc_sub_type = SLANG_BCST_COMPARE;
+	break;
+
+ default:
+	_pSLang_verror (SL_SYNTAX_ERROR, "Expecting directive token. Found 0x%X", t->type);
+	break;
+ }
+
+ /* Reset this pointer first because compile_directive may cause a
+ * file to be loaded.
+ */
+ Compile_Mode_Function = compile_basic_token_mode;
+
+ if (bc_sub_type != -1)
+ compile_directive (bc_sub_type, delay);
+}
+
+static unsigned int Assign_Mode_Type;
+static void compile_assign_mode (_pSLang_Token_Type *t)
+{
+ if (t->type != IDENT_TOKEN)
+ {
+	_pSLang_verror (SL_SYNTAX_ERROR, "Expecting identifier for assignment");
+	return;
+ }
+
+ compile_assign (Assign_Mode_Type, t->v.s_val, t->hash);
+ Compile_Mode_Function = compile_basic_token_mode;
+}
+
+static void compile_basic_token_mode (_pSLang_Token_Type *t)
+{
+ if (-1 == lang_check_space ())
+ return;
+
+ switch (t->type)
+ {
+ case EOF_TOKEN:
+ case NOP_TOKEN:
+	interp_pending_blocks ();
+	break;
+
+ case PUSH_TOKEN:
+ case READONLY_TOKEN:
+ case DO_TOKEN:
+ case VARIABLE_TOKEN:
+ case SEMICOLON_TOKEN:
+ default:
+	_pSLang_verror (SL_SYNTAX_ERROR, "Unknown or unsupported token type 0x%X", t->type);
+	break;
+
+ case DEREF_TOKEN:
+	compile_call_direct (dereference_object, SLANG_BC_CALL_DIRECT);
+	break;
+
+ case _DEREF_OBSOLETE_FUNCALL_TOKEN:
+	compile_simple (SLANG_BC_OBSOLETE_DEREF_FUN_CALL);
+	break;
+
+ case _DEREF_FUNCALL_TOKEN:
+	compile_simple (SLANG_BC_DEREF_FUN_CALL);
+	break;
+
+ case STRUCT_TOKEN:
+	compile_call_direct (_pSLstruct_define_struct, SLANG_BC_CALL_DIRECT);
+	break;
+
+ case STRUCT_WITH_ASSIGN_TOKEN:
+	compile_call_direct (_pSLstruct_define_struct2, SLANG_BC_CALL_DIRECT);
+	break;
+
+ case TYPEDEF_TOKEN:
+	compile_call_direct (_pSLstruct_define_typedef, SLANG_BC_CALL_DIRECT);
+	break;
+
+ case DOT_TOKEN:		 /* X . field */
+	compile_dot (t, SLANG_BC_FIELD);
+	break;
+
+ case DOT_METHOD_CALL_TOKEN: /* X . field (args) */
+	compile_dot (t, SLANG_BC_METHOD);
+	break;
+
+ case COMMA_TOKEN:
+	break;			 /* do nothing */
+
+ case IDENT_TOKEN:
+	compile_hashed_identifier (t->v.s_val, t->hash, t);
+	break;
+
+ case _REF_TOKEN:
+	compile_ref (t->v.s_val, t->hash);
+	break;
+
+ case ARG_TOKEN:
+	compile_call_direct (start_arg_list, SLANG_BC_CALL_DIRECT);
+	break;
+
+ case EARG_TOKEN:
+	compile_lvar_call_direct (end_arg_list, SLANG_BC_EARG_LVARIABLE, SLANG_BC_CALL_DIRECT);
+	break;
+
+ case COLON_TOKEN:
+	if (This_Compile_Block_Type == COMPILE_BLOCK_TYPE_BLOCK)
+	 compile_simple (SLANG_BC_LABEL);
+	else (void) SLang_set_error (SL_SYNTAX_ERROR);
+	break;
+
+ case POP_TOKEN:
+	compile_call_direct (SLdo_pop, SLANG_BC_CALL_DIRECT);
+	break;
+
+ case CASE_TOKEN:
+	if (This_Compile_Block_Type != COMPILE_BLOCK_TYPE_BLOCK)
+	 _pSLang_verror (SL_SYNTAX_ERROR, "Misplaced 'case'");
+	else
+	 compile_call_direct (case_function, SLANG_BC_CALL_DIRECT);
+	break;
+
+ case CHAR_TOKEN:
+	compile_integer (t->v.long_val, SLANG_BC_LITERAL, SLANG_CHAR_TYPE);
+	break;
+ case UCHAR_TOKEN:
+	compile_integer (t->v.long_val, SLANG_BC_LITERAL, SLANG_UCHAR_TYPE);
+	break;
+#if SHORT_IS_NOT_INT
+ case SHORT_TOKEN:
+	compile_integer (t->v.long_val, SLANG_BC_LITERAL, SLANG_SHORT_TYPE);
+	break;
+ case USHORT_TOKEN:
+	compile_integer (t->v.long_val, SLANG_BC_LITERAL, SLANG_USHORT_TYPE);
+	break;
+#endif
+#if SHORT_IS_INT
+ case SHORT_TOKEN:
+#endif
+#if LONG_IS_INT
+ case LONG_TOKEN:
+#endif
+ case INT_TOKEN:
+	compile_integer (t->v.long_val, SLANG_BC_LITERAL_INT, SLANG_INT_TYPE);
+	break;
+#if SHORT_IS_INT
+ case USHORT_TOKEN:
+#endif
+#if LONG_IS_INT
+ case ULONG_TOKEN:
+#endif
+ case UINT_TOKEN:
+	compile_integer (t->v.long_val, SLANG_BC_LITERAL, SLANG_UINT_TYPE);
+	break;
+#if LONG_IS_NOT_INT
+ case LONG_TOKEN:
+	compile_integer (t->v.long_val, SLANG_BC_LITERAL, SLANG_LONG_TYPE);
+	break;
+ case ULONG_TOKEN:
+	compile_integer (t->v.long_val, SLANG_BC_LITERAL, SLANG_ULONG_TYPE);
+	break;
+#endif
+
+#if SLANG_HAS_FLOAT
+ case FLOAT_TOKEN:
+	compile_float (t);
+	break;
+
+ case DOUBLE_TOKEN:
+	compile_double (t, SLANG_BC_LITERAL_DBL, SLANG_DOUBLE_TYPE);
+	break;
+#endif
+#if SLANG_HAS_COMPLEX
+ case COMPLEX_TOKEN:
+	compile_double (t, SLANG_BC_LITERAL, SLANG_COMPLEX_TYPE);
+	break;
+#endif
+#ifdef HAVE_LONG_LONG
+ case LLONG_TOKEN:
+	compile_llong (t->v.llong_val, SLANG_BC_LITERAL, _pSLANG_LLONG_TYPE);
+	break;
+ case ULLONG_TOKEN:
+	compile_llong (t->v.ullong_val, SLANG_BC_LITERAL, _pSLANG_ULLONG_TYPE);
+	break;
+#endif
+ case STRING_TOKEN:
+	compile_string (t->v.s_val, t->hash);
+	break;
+
+ case STRING_DOLLAR_TOKEN:
+	compile_string_dollar (t->v.s_val, t->hash);
+	break;
+
+ case _BSTRING_TOKEN:
+	 {
+	 SLang_BString_Type *b = SLbstring_create ((unsigned char *)t->v.s_val, (unsigned int) t->hash);
+	 if (b != NULL)
+	 {
+		 compile_bstring (b);
+		 SLbstring_free (b);
+	 }
+	 }
+	break;
+
+ case BSTRING_TOKEN:
+	compile_bstring (t->v.b_val);
+	break;
+
+ case MULTI_STRING_TOKEN:
+	 {
+	 _pSLang_Multiline_String_Type *m = t->v.multistring_val;
+	 if (m->type == STRING_TOKEN)
+	 compile_string (m->v.s_val, m->hash);
+	 else if (m->type == STRING_DOLLAR_TOKEN)
+	 compile_string_dollar (m->v.s_val, m->hash);
+	 else if (m->type == BSTRING_TOKEN)
+	 compile_bstring (m->v.b_val);
+	 }
+	break;
+
+ case _NULL_TOKEN:
+	compile_identifier ("NULL", t);
+	break;
+
+ case _INLINE_WILDCARD_ARRAY_TOKEN:
+	compile_call_direct (_pSLarray_wildcard_array, SLANG_BC_CALL_DIRECT);
+	break;
+
+ case _INLINE_ARRAY_TOKEN:
+	compile_call_direct (_pSLarray_inline_array, SLANG_BC_CALL_DIRECT_NARGS);
+	break;
+
+ case _INLINE_IMPLICIT_ARRAY_TOKEN:
+	compile_call_direct (_pSLarray_inline_implicit_array, SLANG_BC_CALL_DIRECT_NARGS);
+	break;
+
+ case _INLINE_LIST_TOKEN:
+	compile_call_direct (_pSLlist_inline_list, SLANG_BC_CALL_DIRECT_NARGS);
+	break;
+
+ case ARRAY_TOKEN:
+	compile_lvar_call_direct (_pSLarray_aget, SLANG_BC_LVARIABLE_AGET, SLANG_BC_CALL_DIRECT_NARGS);
+	break;
+
+ case _INLINE_IMPLICIT_ARRAYN_TOKEN:
+	compile_call_direct (_pSLarray_inline_implicit_arrayn, SLANG_BC_CALL_DIRECT_NARGS);
+	break;
+
+	/* Note: I need to add the other _ARRAY assign tokens. */
+ case _ARRAY_PLUSEQS_TOKEN:
+ case _ARRAY_MINUSEQS_TOKEN:
+ case _ARRAY_TIMESEQS_TOKEN:
+ case _ARRAY_DIVEQS_TOKEN:
+ case _ARRAY_BOREQS_TOKEN:
+ case _ARRAY_BANDEQS_TOKEN:
+ case _ARRAY_POST_MINUSMINUS_TOKEN:
+ case _ARRAY_MINUSMINUS_TOKEN:
+ case _ARRAY_POST_PLUSPLUS_TOKEN:
+ case _ARRAY_PLUSPLUS_TOKEN:
+	compile_array_assign (t);
+	break;
+
+ case _ARRAY_ASSIGN_TOKEN:
+	compile_lvar_call_direct (_pSLarray_aput, SLANG_BC_LVARIABLE_APUT, SLANG_BC_CALL_DIRECT_NARGS);
+	break;
+
+ case _STRUCT_ASSIGN_TOKEN:
+ case _STRUCT_PLUSEQS_TOKEN:
+ case _STRUCT_MINUSEQS_TOKEN:
+ case _STRUCT_TIMESEQS_TOKEN:
+ case _STRUCT_DIVEQS_TOKEN:
+ case _STRUCT_BOREQS_TOKEN:
+ case _STRUCT_BANDEQS_TOKEN:
+ case _STRUCT_POST_MINUSMINUS_TOKEN:
+ case _STRUCT_MINUSMINUS_TOKEN:
+ case _STRUCT_POST_PLUSPLUS_TOKEN:
+ case _STRUCT_PLUSPLUS_TOKEN:
+	compile_struct_assign (t);
+	break;
+
+ case _SCALAR_ASSIGN_TOKEN:
+ case _SCALAR_PLUSEQS_TOKEN:
+ case _SCALAR_MINUSEQS_TOKEN:
+ case _SCALAR_TIMESEQS_TOKEN:
+ case _SCALAR_DIVEQS_TOKEN:
+ case _SCALAR_BOREQS_TOKEN:
+ case _SCALAR_BANDEQS_TOKEN:
+ case _SCALAR_POST_MINUSMINUS_TOKEN:
+ case _SCALAR_MINUSMINUS_TOKEN:
+ case _SCALAR_POST_PLUSPLUS_TOKEN:
+ case _SCALAR_PLUSPLUS_TOKEN:
+	compile_assign (SLANG_BCST_ASSIGN + (t->type - _SCALAR_ASSIGN_TOKEN),
+			t->v.s_val, t->hash);
+	break;
+
+ case _DEREF_ASSIGN_TOKEN:
+ case _DEREF_PLUSEQS_TOKEN:
+ case _DEREF_MINUSEQS_TOKEN:
+ case _DEREF_TIMESEQS_TOKEN:
+ case _DEREF_DIVEQS_TOKEN:
+ case _DEREF_BOREQS_TOKEN:
+ case _DEREF_BANDEQS_TOKEN:
+ case _DEREF_PLUSPLUS_TOKEN:
+ case _DEREF_POST_PLUSPLUS_TOKEN:
+ case _DEREF_MINUSMINUS_TOKEN:
+ case _DEREF_POST_MINUSMINUS_TOKEN:
+	compile_deref_assign (t);
+	break;
+
+ 	/* For processing RPN tokens */
+ case ASSIGN_TOKEN:
+ case PLUSEQS_TOKEN:
+ case MINUSEQS_TOKEN:
+ case TIMESEQS_TOKEN:
+ case DIVEQS_TOKEN:
+ case BOREQS_TOKEN:
+ case BANDEQS_TOKEN:
+ case POST_MINUSMINUS_TOKEN:
+ case MINUSMINUS_TOKEN:
+ case POST_PLUSPLUS_TOKEN:
+ case PLUSPLUS_TOKEN:
+	Compile_Mode_Function = compile_assign_mode;
+	Assign_Mode_Type = SLANG_BCST_ASSIGN + (t->type - ASSIGN_TOKEN);
+	break;
+
+ case LT_TOKEN:
+	compile_binary (SLANG_LT);
+	break;
+
+ case LE_TOKEN:
+	compile_binary (SLANG_LE);
+	break;
+
+ case GT_TOKEN:
+	compile_binary (SLANG_GT);
+	break;
+
+ case GE_TOKEN:
+	compile_binary (SLANG_GE);
+	break;
+
+ case EQ_TOKEN:
+	compile_binary (SLANG_EQ);
+	break;
+
+ case NE_TOKEN:
+	compile_binary (SLANG_NE);
+	break;
+
+ case AND_TOKEN:
+	compile_binary (SLANG_AND);
+	break;
+
+ case ADD_TOKEN:
+	compile_binary (SLANG_PLUS);
+	break;
+
+ case SUB_TOKEN:
+	compile_binary (SLANG_MINUS);
+	break;
+
+ case TIMES_TOKEN:
+	compile_binary (SLANG_TIMES);
+	break;
+
+ case DIV_TOKEN:
+	compile_binary (SLANG_DIVIDE);
+	break;
+
+ case POW_TOKEN:
+	compile_binary (SLANG_POW);
+	break;
+
+ case BXOR_TOKEN:
+	compile_binary (SLANG_BXOR);
+	break;
+
+ case BAND_TOKEN:
+	compile_binary (SLANG_BAND);
+	break;
+
+ case BOR_TOKEN:
+	compile_binary (SLANG_BOR);
+	break;
+
+ case SHR_TOKEN:
+	compile_binary (SLANG_SHR);
+	break;
+
+ case SHL_TOKEN:
+	compile_binary (SLANG_SHL);
+	break;
+
+ case MOD_TOKEN:
+	compile_binary (SLANG_MOD);
+	break;
+
+ case OR_TOKEN:
+	compile_binary (SLANG_OR);
+	break;
+
+ case NOT_TOKEN:
+	compile_unary (SLANG_NOT, SLANG_BC_UNARY);
+	break;
+
+ case BNOT_TOKEN:
+	compile_unary (SLANG_BNOT, SLANG_BC_UNARY);
+	break;
+ case CHS_TOKEN:
+	compile_unary (SLANG_CHS, SLANG_BC_UNARY);
+	break;
+#if 0
+ case MUL2_TOKEN:
+	compile_unary (SLANG_MUL2, SLANG_BC_ARITH_UNARY);
+	break;
+ case ABS_TOKEN:
+	compile_unary (SLANG_ABS, SLANG_BC_ARITH_UNARY);
+	break;
+ case SQR_TOKEN:
+	compile_unary (SLANG_SQR, SLANG_BC_ARITH_UNARY);
+	break;
+ case SIGN_TOKEN:
+	compile_unary (SLANG_SIGN, SLANG_BC_ARITH_UNARY);
+	break;
+#endif
+ case BREAK_TOKEN:
+	compile_break (SLANG_BC_BREAK, 1, 0, "break", 1);
+	break;
+
+ case BREAK_N_TOKEN:
+	compile_break (SLANG_BC_BREAK_N, 1, 0, "break", abs((int)t->v.long_val));
+	break;
+
+ case RETURN_TOKEN:
+	compile_break (SLANG_BC_RETURN, 0, 1, "return", 1);
+	break;
+
+ case CONT_TOKEN:
+	compile_break (SLANG_BC_CONTINUE, 1, 0, "continue", 1);
+	break;
+ case CONT_N_TOKEN:
+	compile_break (SLANG_BC_CONTINUE_N, 1, 0, "continue", abs((int)t->v.long_val));
+	break;
+ case EXCH_TOKEN:
+	compile_break (SLANG_BC_EXCH, 0, 0, "", 0); /* FIXME: Priority=low */
+	break;
+
+ case STATIC_TOKEN:
+	interp_pending_blocks ();
+	if (Lang_Defining_Function == 0)
+	 Compile_Mode_Function = compile_static_variable_mode;
+	else
+	 _pSLang_verror (SL_NOT_IMPLEMENTED, "static variables not permitted in functions");
+	break;
+
+ case PRIVATE_TOKEN:
+	interp_pending_blocks ();
+	if (Lang_Defining_Function == 0)
+	 Compile_Mode_Function = compile_private_variable_mode;
+	else
+	 _pSLang_verror (SL_NOT_IMPLEMENTED, "private variables not permitted in functions");
+	break;
+
+ case PUBLIC_TOKEN:
+	interp_pending_blocks ();
+	if (Lang_Defining_Function == 0)
+	 Compile_Mode_Function = compile_public_variable_mode;
+	else
+	 _pSLang_verror (SL_NOT_IMPLEMENTED, "public variables not permitted in functions");
+	break;
+
+ case OBRACKET_TOKEN:
+	interp_pending_blocks ();
+	if (Lang_Defining_Function == 0)
+	 Compile_Mode_Function = Default_Variable_Mode;
+	else
+	 Compile_Mode_Function = compile_local_variable_mode;
+	break;
+
+ case OPAREN_TOKEN:
+	interp_pending_blocks ();
+	lang_begin_function ();
+	break;
+
+ case DEFINE_STATIC_TOKEN:
+	if (Lang_Defining_Function)
+	 define_static_function (t->v.s_val, t->hash);
+	else (void) SLang_set_error (SL_SYNTAX_ERROR);
+	break;
+
+ case DEFINE_PRIVATE_TOKEN:
+	interp_pending_blocks ();
+	if (Lang_Defining_Function)
+	 define_private_function (t->v.s_val, t->hash);
+	else (void) SLang_set_error (SL_SYNTAX_ERROR);
+	break;
+
+ case DEFINE_PUBLIC_TOKEN:
+	if (Lang_Defining_Function)
+	 define_public_function (t->v.s_val, t->hash);
+	else (void) SLang_set_error (SL_SYNTAX_ERROR);
+	break;
+
+ case THROW_TOKEN:
+	compile_call_direct (_pSLerr_throw, SLANG_BC_CALL_DIRECT_NARGS);
+	break;
+
+ case DEFINE_TOKEN:
+	if (Lang_Defining_Function)
+	 (*Default_Define_Function) (t->v.s_val, t->hash);
+	else
+	 (void) SLang_set_error (SL_SYNTAX_ERROR);
+	break;
+
+ case CPAREN_TOKEN:
+	if (Lang_Defining_Function)
+	 Compile_Mode_Function = compile_function_mode;
+	else (void) SLang_set_error (SL_SYNTAX_ERROR);
+	break;
+
+ case CBRACE_TOKEN:
+	lang_end_block ();
+	Compile_Mode_Function = compile_directive_mode;
+	break;
+
+ case OBRACE_TOKEN:
+	lang_begin_block ();
+	break;
+
+ case FARG_TOKEN:
+	Function_Args_Number = Local_Variable_Number;
+	break;
+
+ case TMP_TOKEN:
+	compile_tmp_variable (t->v.s_val, t->hash);
+	break;
+#if SLANG_HAS_QUALIFIERS
+ case QUALIFIER_TOKEN:
+	compile_call_direct (set_qualifier, SLANG_BC_CALL_DIRECT);
+	break;
+#endif
+ case BOS_TOKEN:
+#if SLANG_HAS_DEBUG_CODE && SLANG_HAS_BOSEOS
+	compile_line_info (SLANG_BC_BOS, This_Compile_Filename, t->v.long_val);
+#endif
+	break;
+ case EOS_TOKEN:
+#if SLANG_HAS_DEBUG_CODE && SLANG_HAS_BOSEOS
+	compile_simple (SLANG_BC_EOS);
+#endif
+	break;
+
+ case LINE_NUM_TOKEN:
+#if SLANG_HAS_DEBUG_CODE
+	set_line_number_info (t->v.long_val);
+#endif
+	break;
+
+ case _ARRAY_ELEM_REF_TOKEN:
+	compile_call_direct (_pSLarray_push_elem_ref, SLANG_BC_CALL_DIRECT_NARGS);
+	break;
+
+ case _STRUCT_FIELD_REF_TOKEN:
+	compile_dot (t, SLANG_BC_FIELD_REF);
+	break;
+
+ case POUND_TOKEN:
+	compile_call_direct (_pSLarray_matrix_multiply, SLANG_BC_CALL_DIRECT);
+	break;
+ }
+}
+
+void _pSLcompile (_pSLang_Token_Type *t)
+{
+ if (SLang_get_error () == 0)
+ {
+	if (Compile_Mode_Function != compile_basic_token_mode)
+	 {
+	 if (Compile_Mode_Function == NULL)
+	 Compile_Mode_Function = compile_basic_token_mode;
+	 if (t->type == LINE_NUM_TOKEN)
+	 {
+		 compile_basic_token_mode (t);
+		 return;
+	 }
+	 }
+
+	(*Compile_Mode_Function) (t);
+ }
+
+ if (SLang_get_error ())
+ {
+	Compile_Mode_Function = compile_basic_token_mode;
+	reset_active_interpreter ();
+ }
+}
+
+void (*_pSLcompile_ptr)(_pSLang_Token_Type *) = _pSLcompile;
+
+typedef struct _Compile_Context_Type
+{
+ struct _Compile_Context_Type *next;
+ SLang_NameSpace_Type *static_namespace;
+ SLang_NameSpace_Type *private_namespace;
+ SLang_NameSpace_Type *locals_namespace;
+ void (*compile_variable_mode) (_pSLang_Token_Type *);
+ void (*define_function) (SLFUTURE_CONST char *, unsigned long);
+ int lang_defining_function;
+ int local_variable_number;
+ char *local_variable_namesSLANG_MAX_LOCAL_VARIABLES;
+ unsigned int function_args_number;
+ void (*compile_mode_function)(_pSLang_Token_Type *);
+ SLFUTURE_CONST char *compile_filename;
+ unsigned int compile_linenum;
+ _pSLang_Function_Type *current_function;
+ Function_Header_Type *current_function_header;
+}
+Compile_Context_Type;
+
+static Compile_Context_Type *Compile_Context_Stack;
+
+/* The only way the push/pop_context functions can get called is via
+ * an eval type function. That can only happen when executed from a
+ * top level block. This means that Compile_ByteCode_Ptr can always be
+ * reset back to the beginning of a block.
+ */
+
+static int pop_compile_context (void)
+{
+ Compile_Context_Type *cc;
+
+ if (NULL == (cc = Compile_Context_Stack))
+ return -1;
+
+ This_Static_NameSpace = cc->static_namespace;
+ This_Private_NameSpace = cc->private_namespace;
+ Compile_Context_Stack = cc->next;
+ Default_Variable_Mode = cc->compile_variable_mode;
+ Default_Define_Function = cc->define_function;
+ Compile_Mode_Function = cc->compile_mode_function;
+
+ Lang_Defining_Function = cc->lang_defining_function;
+ Local_Variable_Number = cc->local_variable_number;
+ memcpy ((char *)Local_Variable_Names, (char *)cc->local_variable_names, sizeof(Local_Variable_Names));
+
+ Function_Args_Number = cc->function_args_number;
+
+ SLang_free_slstring ((char *) This_Compile_Filename);
+ This_Compile_Filename = cc->compile_filename;
+ This_Compile_Linenum = cc->compile_linenum;
+
+ Current_Function_Header = cc->current_function_header;
+ Current_Function = cc->current_function;
+
+ Locals_NameSpace = cc->locals_namespace;
+
+ /* These should be when returning from a compile context */
+ Lang_Return = 0;
+ Lang_Break = 0;
+ Lang_Break_Condition = 0;
+
+ SLfree ((char *) cc);
+
+ return decrement_slang_frame_pointer ();
+}
+
+static int push_compile_context (SLFUTURE_CONST char *name)
+{
+ Compile_Context_Type *cc;
+
+ cc = (Compile_Context_Type *)SLmalloc (sizeof (Compile_Context_Type));
+ if (cc == NULL)
+ return -1;
+ memset ((char *) cc, 0, sizeof (Compile_Context_Type));
+
+ if ((name != NULL)
+ && (NULL == (name = SLang_create_slstring (name))))
+ {
+	SLfree ((char *) cc);
+	return -1;
+ }
+
+ /* This is necessary since Current_Function and Current_Function_Header
+ * will be set to NULL. Otherwise, top-level blocks would not get
+ * properly counted by the _get_frame_depth function. It is also probably
+ * not necessary to add the current_function and current_function_header
+ * to the compile context structure.
+ */
+ if (-1 == increment_slang_frame_pointer (NULL, This_Compile_Linenum))
+ {
+	SLfree ((char *)cc);
+	SLang_free_slstring ((char *) name); /* NULL ok */
+	return -1;
+ }
+
+ cc->compile_filename = This_Compile_Filename;
+ This_Compile_Filename = name;
+ cc->compile_linenum = This_Compile_Linenum;
+ This_Compile_Linenum = 0;
+
+ cc->static_namespace = This_Static_NameSpace;
+ cc->private_namespace = This_Private_NameSpace;
+ cc->compile_variable_mode = Default_Variable_Mode;
+ cc->define_function = Default_Define_Function;
+ cc->locals_namespace = Locals_NameSpace;
+
+ cc->lang_defining_function = Lang_Defining_Function;
+ cc->local_variable_number = Local_Variable_Number;
+ memcpy ((char *)cc->local_variable_names, (char *)Local_Variable_Names, sizeof(Local_Variable_Names));
+
+ cc->function_args_number = Function_Args_Number;
+ cc->compile_mode_function = Compile_Mode_Function;
+
+ cc->current_function_header = Current_Function_Header;
+ cc->current_function = Current_Function;
+
+ cc->next = Compile_Context_Stack;
+ Compile_Context_Stack = cc;
+
+ Compile_Mode_Function = compile_basic_token_mode;
+ Default_Variable_Mode = compile_public_variable_mode;
+ Default_Define_Function = define_public_function;
+ Lang_Defining_Function = 0;
+ Function_Args_Number = 0;
+ Local_Variable_Number = 0;
+ Locals_NameSpace = NULL;
+ Current_Function = NULL;
+ Current_Function_Header = NULL;
+
+ This_Static_NameSpace = NULL; /* allocated by caller-- here for completeness */
+ This_Private_NameSpace = NULL; /* allocated by caller-- here for completeness */
+ return 0;
+}
+
+/* Error handling */
+static int unset_interrupt_state (VOID_STAR maskp)
+{
+ Handle_Interrupt &= ~(*(int *)maskp);
+ return 0;
+}
+
+static int set_interrupt_state (VOID_STAR maskp)
+{
+ Handle_Interrupt |= *(int *)maskp;
+ return 0;
+}
+
+static void interpreter_error_hook (int set)
+{
+ int mask = INTERRUPT_ERROR;
+ if (set)
+ (void) _pSLsig_block_and_call (set_interrupt_state, (VOID_STAR) &mask);
+ else
+ (void) _pSLsig_block_and_call (unset_interrupt_state, (VOID_STAR) &mask);
+}
+
+#if SLANG_HAS_SIGNALS
+void _pSLang_signal_interrupt (void)
+{
+ int mask = INTERRUPT_SIGNAL;
+ (void) _pSLsig_block_and_call (set_interrupt_state, (VOID_STAR)&mask);
+}
+
+#define CHECK_SIGNALS_NOT_REENTRANT 0
+static int check_signals (void)
+{
+#if CHECK_SIGNALS_NOT_REENTRANT
+ static volatile int inprogress = 0;
+#endif
+ int nargs = SLang_Num_Function_Args;
+ int nnargs = Next_Function_Num_Args;
+ int bc, r, br;
+ int status;
+
+ if (0 == (Handle_Interrupt & INTERRUPT_SIGNAL))
+ return 0;
+#if CHECK_SIGNALS_NOT_REENTRANT
+ if (inprogress)
+ return 0;
+ inprogress = 1;
+#endif
+ bc = Lang_Break_Condition; r = Lang_Return; br = Lang_Break;
+ status = 0;
+ /* The race condition that may be here can be ignored as long
+ * as the Handle_Interrupt variable is modified before the
+ * call to _pSLinterp_handle_signals.
+ */
+ Handle_Interrupt &= ~INTERRUPT_SIGNAL;
+ if (-1 == _pSLsig_handle_signals ())
+ status = -1;
+
+ SLang_Num_Function_Args = nargs;
+ Next_Function_Num_Args = nnargs;
+ Lang_Break = br; Lang_Return = r; Lang_Break_Condition = bc;
+#if CHECK_SIGNALS_NOT_REENTRANT
+ inprogress = 0;
+#endif
+ return status;
+}
+
+int _pSLang_check_signals_hook (VOID_STAR unused)
+{
+ (void) unused;
+ (void) check_signals ();
+ if (_pSLang_Error)
+ return -1;
+ return 0;
+}
+
+#endif				 /* SLANG_HAS_SIGNALS */
+
+static void free_stacks (void)
+{
+ /* SLfree can grok NULLs */
+ SLfree ((char *)Num_Args_Stack); Num_Args_Stack = NULL;
+ SLfree ((char *)Run_Stack); Run_Stack = NULL;
+ SLfree ((char *)Num_Args_Stack); Num_Args_Stack = NULL;
+ SLfree ((char *)Frame_Pointer_Stack); Frame_Pointer_Stack = NULL;
+#if SLANG_HAS_QUALIFIERS
+ SLfree ((char *)Function_Qualifiers_Stack); Function_Qualifiers_Stack = NULL;
+#endif
+ SLfree ((char *)Local_Variable_Stack); Local_Variable_Stack = NULL;
+}
+
+static void delete_interpreter (void)
+{
+ if (Run_Stack != NULL)
+ {
+	/* Allow any object destructors to run */
+	while (Stack_Pointer != Run_Stack)
+	 {
+	 SLdo_pop ();
+	 }
+ }
+
+ SLang_restart (0);
+
+ while ((This_Compile_Block_Type != COMPILE_BLOCK_TYPE_NONE)
+	 && (0 == _pSLcompile_pop_context ()))
+ ;
+
+ _pSLns_delete_namespaces ();
+ free_stacks ();
+}
+
+static int init_interpreter (void)
+{
+ SLang_NameSpace_Type *ns;
+
+ if (Global_NameSpace != NULL)
+ return 0;
+
+ free_stacks ();
+
+ _pSLinterpreter_Error_Hook = interpreter_error_hook;
+
+ if (NULL == (ns = _pSLns_new_namespace (NULL, SLGLOBALS_HASH_TABLE_SIZE)))
+ return -1;
+ if (-1 == _pSLns_set_namespace_name (ns, "Global"))
+ return -1;
+ Global_NameSpace = ns;
+
+ Run_Stack = (SLang_Object_Type *) SLcalloc (SLANG_MAX_STACK_LEN,
+						 sizeof (SLang_Object_Type));
+ if (Run_Stack == NULL)
+ goto return_error;
+
+ Stack_Pointer = Run_Stack;
+ Stack_Pointer_Max = Run_Stack + SLANG_MAX_STACK_LEN;
+
+ Num_Args_Stack = (int *) _SLcalloc (SLANG_MAX_RECURSIVE_DEPTH, sizeof(int));
+ if (Num_Args_Stack == NULL)
+ goto return_error;
+
+ Recursion_Depth = 0;
+ Frame_Pointer_Stack = (unsigned int *) _SLcalloc (SLANG_MAX_RECURSIVE_DEPTH, sizeof(unsigned int));
+ if (Frame_Pointer_Stack == NULL)
+ goto return_error;
+ Frame_Pointer_Depth = 0;
+ Frame_Pointer = Run_Stack;
+
+ Local_Variable_Stack = (SLang_Object_Type *) _SLcalloc (SLANG_MAX_LOCAL_STACK, sizeof(SLang_Object_Type));
+ if (Local_Variable_Stack == NULL)
+ goto return_error;
+ Local_Variable_Frame = Local_Variable_Stack;
+ Local_Variable_Stack_Max = Local_Variable_Stack + SLANG_MAX_LOCAL_STACK;
+
+#if SLANG_HAS_QUALIFIERS
+ Function_Qualifiers_Stack = (SLang_Struct_Type **) SLcalloc (SLANG_MAX_RECURSIVE_DEPTH, sizeof (SLang_Struct_Type *));
+ if (Function_Qualifiers_Stack == NULL)
+ goto return_error;
+#endif
+
+ Function_Stack = (Function_Stack_Type *) _SLcalloc (SLANG_MAX_RECURSIVE_DEPTH, sizeof (Function_Stack_Type));
+ if (Function_Stack == NULL)
+ goto return_error;
+
+ Function_Stack_Ptr = Function_Stack;
+ /* Function_Stack_Ptr_Max = Function_Stack_Ptr + SLANG_MAX_RECURSIVE_DEPTH; */
+
+ (void) setup_default_compile_linkage (1);
+ if (-1 == SLang_add_cleanup_function (delete_interpreter))
+ goto return_error;
+
+ return 0;
+
+return_error:
+ free_stacks ();
+ return -1;
+}
+
+static int add_generic_table (SLang_NameSpace_Type *ns,
+			 SLang_Name_Type *table, SLFUTURE_CONST char *pp_name,
+			 unsigned int entry_len)
+{
+ SLang_Name_Type *t, **ns_table;
+ SLFUTURE_CONST char *name;
+ unsigned int table_size;
+
+ if (-1 == init_interpreter ())
+ return -1;
+
+ if (ns == NULL)
+ ns = Global_NameSpace;
+
+ if ((pp_name != NULL)
+ && (-1 == SLdefine_for_ifdef (pp_name)))
+ return -1;
+
+ ns_table = ns->table;
+ table_size = ns->table_size;
+
+ t = table;
+ while (NULL != (name = t->name))
+ {
+	unsigned long hash;
+
+	/* Backward compatibility: '.' WAS used as hash marker */
+	if (*name == '.')
+	 {
+	 name++;
+	 t->name = name;
+	 }
+
+	if (-1 == _pSLcheck_identifier_syntax (name))
+	 return -1;
+
+	if (NULL == (name = SLang_create_slstring (name)))
+	 return -1;
+
+	t->name = name;
+
+	hash = SLcompute_string_hash (name);
+	hash = hash % table_size;
+
+	/* First time. Make sure this has not already been added */
+	if (t == table)
+	 {
+	 SLang_Name_Type *tt = ns_table(unsigned int) hash;
+	 while (tt != NULL)
+	 {
+		 if (tt == t)
+		 {
+		 _pSLang_verror (SL_APPLICATION_ERROR,
+				 "An intrinsic symbol table may not be added twice. %s",
+				 pp_name == NULL ? "" : pp_name);
+		 return -1;
+		 }
+		 tt = tt->next;
+	 }
+	 }
+
+	t->next = ns_table (unsigned int) hash;
+	ns_table (unsigned int) hash = t;
+
+	t = (SLang_Name_Type *) ((char *)t + entry_len);
+ }
+
+ return 0;
+}
+
+/* FIXME: I should add code to make sure that the objects in, e.g., an iconstant table
+ * have sizeof(int).
+ */
+int SLadd_intrin_fun_table (SLang_Intrin_Fun_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ return add_generic_table (NULL, (SLang_Name_Type *) tbl, pp, sizeof (SLang_Intrin_Fun_Type));
+}
+
+int SLadd_intrin_var_table (SLang_Intrin_Var_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ return add_generic_table (NULL, (SLang_Name_Type *) tbl, pp, sizeof (SLang_Intrin_Var_Type));
+}
+
+int SLadd_app_unary_table (SLang_App_Unary_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ return add_generic_table (NULL, (SLang_Name_Type *) tbl, pp, sizeof (SLang_App_Unary_Type));
+}
+
+int _pSLadd_arith_unary_table (SLang_Arith_Unary_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ return add_generic_table (NULL, (SLang_Name_Type *) tbl, pp, sizeof (SLang_Arith_Unary_Type));
+}
+
+int _pSLadd_arith_binary_table (SLang_Arith_Binary_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ return add_generic_table (NULL, (SLang_Name_Type *) tbl, pp, sizeof (SLang_Arith_Binary_Type));
+}
+
+int SLadd_math_unary_table (SLang_Math_Unary_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ return add_generic_table (NULL, (SLang_Name_Type *) tbl, pp, sizeof (SLang_Math_Unary_Type));
+}
+
+int SLadd_iconstant_table (SLang_IConstant_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ return add_generic_table (NULL, (SLang_Name_Type *) tbl, pp, sizeof (SLang_IConstant_Type));
+}
+
+int SLadd_lconstant_table (SLang_LConstant_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ return add_generic_table (NULL, (SLang_Name_Type *) tbl, pp, sizeof (SLang_LConstant_Type));
+}
+
+#if SLANG_HAS_FLOAT
+int SLadd_dconstant_table (SLang_DConstant_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ return add_generic_table (NULL, (SLang_Name_Type *) tbl, pp, sizeof (SLang_DConstant_Type));
+}
+int SLadd_fconstant_table (SLang_FConstant_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ return add_generic_table (NULL, (SLang_Name_Type *) tbl, pp, sizeof (SLang_FConstant_Type));
+}
+#endif
+#ifdef HAVE_LONG_LONG
+int SLadd_llconstant_table (SLang_LLConstant_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ return add_generic_table (NULL, (SLang_Name_Type *) tbl, pp, sizeof (SLang_LLConstant_Type));
+}
+int _pSLadd_llconstant_table (_pSLang_LLConstant_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ return add_generic_table (NULL, (SLang_Name_Type *) tbl, pp, sizeof (_pSLang_LLConstant_Type));
+}
+#endif
+
+/* ----------- */
+int SLns_add_intrin_fun_table (SLang_NameSpace_Type *ns, SLang_Intrin_Fun_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ if ((ns == NULL) || (ns == (Global_NameSpace)))
+ return add_generic_table (ns, (SLang_Name_Type *) tbl, pp, sizeof (SLang_Intrin_Fun_Type));
+
+ if ((pp != NULL)
+ && (-1 == SLdefine_for_ifdef (pp)))
+ return -1;
+
+ while (tbl->name != NULL)
+ {
+	if (-1 == add_intrinsic_function (ns, tbl->name, tbl->i_fun,
+					 tbl->return_type, tbl->num_args,
+					 tbl->arg_types))
+	 return -1;
+	tbl++;
+ }
+ return 0;
+}
+
+int SLns_add_intrin_var_table (SLang_NameSpace_Type *ns, SLang_Intrin_Var_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ if ((ns == NULL) || (ns == Global_NameSpace))
+ return add_generic_table (ns, (SLang_Name_Type *) tbl, pp, sizeof (SLang_Intrin_Var_Type));
+
+ if ((pp != NULL)
+ && (-1 == SLdefine_for_ifdef (pp)))
+ return -1;
+
+ while (tbl->name != NULL)
+ {
+	if (-1 == SLns_add_intrinsic_variable (ns, tbl->name, tbl->addr, tbl->type, tbl->name_type == SLANG_RVARIABLE))
+	 return -1;
+
+	tbl++;
+ }
+ return 0;
+}
+
+int SLns_add_app_unary_table (SLang_NameSpace_Type *ns, SLang_App_Unary_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ if ((ns == NULL) || (ns == (Global_NameSpace)))
+ return add_generic_table (ns, (SLang_Name_Type *) tbl, pp, sizeof (SLang_App_Unary_Type));
+
+ if ((pp != NULL)
+ && (-1 == SLdefine_for_ifdef (pp)))
+ return -1;
+
+ while (tbl->name != NULL)
+ {
+	SLang_App_Unary_Type *a;
+
+	a = (SLang_App_Unary_Type *)add_xxx_helper (ns, tbl->name, SLANG_APP_UNARY, sizeof(SLang_App_Unary_Type));
+	if (a == NULL)
+	 return -1;
+	a->unary_op = tbl->unary_op;
+	tbl++;
+ }
+ return 0;
+}
+
+int SLns_add_math_unary_table (SLang_NameSpace_Type *ns, SLang_Math_Unary_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ if ((ns == NULL) || (ns == (Global_NameSpace)))
+ return add_generic_table (ns, (SLang_Name_Type *) tbl, pp, sizeof (SLang_Math_Unary_Type));
+
+ if ((pp != NULL)
+ && (-1 == SLdefine_for_ifdef (pp)))
+ return -1;
+
+ while (tbl->name != NULL)
+ {
+	SLang_Math_Unary_Type *a;
+
+	a = (SLang_Math_Unary_Type *)add_xxx_helper (ns, tbl->name, SLANG_MATH_UNARY, sizeof(SLang_Math_Unary_Type));
+	if (a == NULL)
+	 return -1;
+	a->unary_op = tbl->unary_op;
+	tbl++;
+ }
+ return 0;
+}
+
+int SLns_add_hconstant_table (SLang_NameSpace_Type *ns, SLang_HConstant_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ if ((ns == NULL) || (ns == (Global_NameSpace)))
+ return add_generic_table (ns, (SLang_Name_Type *) tbl, pp, sizeof (SLang_HConstant_Type));
+
+ if ((pp != NULL)
+ && (-1 == SLdefine_for_ifdef (pp)))
+ return -1;
+
+ while (tbl->name != NULL)
+ {
+	if (-1 == SLns_add_hconstant (ns, tbl->name, tbl->data_type, tbl->value))
+	 return -1;
+	tbl++;
+ }
+ return 0;
+}
+
+int SLns_add_iconstant_table (SLang_NameSpace_Type *ns, SLang_IConstant_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ if ((ns == NULL) || (ns == (Global_NameSpace)))
+ return add_generic_table (ns, (SLang_Name_Type *) tbl, pp, sizeof (SLang_IConstant_Type));
+
+ if ((pp != NULL)
+ && (-1 == SLdefine_for_ifdef (pp)))
+ return -1;
+
+ while (tbl->name != NULL)
+ {
+	if (-1 == SLns_add_iconstant (ns, tbl->name, tbl->data_type, tbl->value))
+	 return -1;
+	tbl++;
+ }
+ return 0;
+}
+
+int SLns_add_lconstant_table (SLang_NameSpace_Type *ns, SLang_LConstant_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ if ((ns == NULL) || (ns == (Global_NameSpace)))
+ return add_generic_table (ns, (SLang_Name_Type *) tbl, pp, sizeof (SLang_LConstant_Type));
+
+ if ((pp != NULL)
+ && (-1 == SLdefine_for_ifdef (pp)))
+ return -1;
+
+ while (tbl->name != NULL)
+ {
+	if (-1 == SLns_add_lconstant (ns, tbl->name, tbl->data_type, tbl->value))
+	 return -1;
+	tbl++;
+ }
+ return 0;
+}
+
+#ifdef HAVE_LONG_LONG
+int _pSLns_add_llconstant_table (SLang_NameSpace_Type *ns, _pSLang_LLConstant_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ if ((ns == NULL) || (ns == (Global_NameSpace)))
+ return add_generic_table (ns, (SLang_Name_Type *) tbl, pp, sizeof (_pSLang_LLConstant_Type));
+
+ if ((pp != NULL)
+ && (-1 == SLdefine_for_ifdef (pp)))
+ return -1;
+
+ while (tbl->name != NULL)
+ {
+	if (-1 == _pSLns_add_llconstant (ns, tbl->name, tbl->data_type, tbl->value))
+	 return -1;
+	tbl++;
+ }
+ return 0;
+}
+#endif
+
+#if SLANG_HAS_FLOAT
+int SLns_add_dconstant_table (SLang_NameSpace_Type *ns, SLang_DConstant_Type *tbl, SLFUTURE_CONST char *pp)
+{
+ if ((ns == NULL) || (ns == (Global_NameSpace)))
+ return add_generic_table (ns, (SLang_Name_Type *) tbl, pp, sizeof (SLang_DConstant_Type));
+
+ if ((pp != NULL)
+ && (-1 == SLdefine_for_ifdef (pp)))
+ return -1;
+
+ while (tbl->name != NULL)
+ {
+	if (-1 == SLns_add_dconstant (ns, tbl->name, tbl->d))
+	 return -1;
+	tbl++;
+ }
+ return 0;
+}
+#endif
+
+static int setup_default_compile_linkage (int is_public)
+{
+ if (is_public)
+ {
+	Default_Define_Function = define_public_function;
+	Default_Variable_Mode = compile_public_variable_mode;
+ }
+ else
+ {
+	Default_Define_Function = define_static_function;
+	Default_Variable_Mode = compile_static_variable_mode;
+ }
+
+ return 0;
+}
+
+/* what is a bitmapped value:
+ * 1 intrin fun
+ * 2 user fun
+ * 4 intrin var
+ * 8 user defined var
+ */
+SLang_Array_Type *_pSLang_apropos (SLFUTURE_CONST char *namespace_name, SLFUTURE_CONST char *pat, unsigned int what)
+{
+ SLang_NameSpace_Type *ns;
+
+ if (namespace_name == NULL)
+ namespace_name = "Global";
+
+ if (*namespace_name == 0)
+ ns = This_Static_NameSpace;
+ else ns = _pSLns_find_namespace (namespace_name);
+
+ return _pSLnspace_apropos (ns, pat, what);
+}
+
+/* An anonymous namespace in one in which the private and static objects share
+ * the same namespace. This function causes a new namespace to be created or
+ * an existing one used, and where the static objects will be placed. The
+ * private objects will continue using the private namespace.
+ */
+static int implements_ns (SLFUTURE_CONST char *namespace_name)
+{
+ SLang_NameSpace_Type *ns;
+ SLFUTURE_CONST char *name;
+
+ if (-1 == _pSLns_check_name (namespace_name))
+ return -1;
+
+ if ((This_Private_NameSpace == NULL) || (This_Static_NameSpace == NULL))
+ {
+	/* This error should never happen */
+	_pSLang_verror (SL_INTERNAL_ERROR, "No namespace available");
+	return -1;
+ }
+ name = This_Private_NameSpace->name;
+
+ if (NULL != (ns = _pSLns_find_namespace (namespace_name)))
+ {
+	/* If it exists but is associated with the private namespace, the it is ok */
+	if (ns->name != name)
+	 {
+	 _pSLang_verror (SL_Namespace_Error, "Namespace %s already exists", namespace_name);
+	 return -1;
+	 }
+ }
+ return setup_compile_namespaces (name, namespace_name);
+}
+
+void _pSLang_implements_intrinsic (SLFUTURE_CONST char *name)
+{
+ (void) implements_ns (name);
+}
+
+void _pSLang_use_namespace_intrinsic (char *name)
+{
+ SLang_NameSpace_Type *ns;
+
+ if (NULL == (ns = _pSLns_find_namespace (name)))
+ {
+	_pSLang_verror (SL_Namespace_Error, "Namespace %s does not exist", name);
+	return;
+ }
+ This_Static_NameSpace = ns;
+ (void) setup_default_compile_linkage (ns == Global_NameSpace);
+}
+
+static SLang_NameSpace_Type *_pSLang_cur_namespace (void)
+{
+ if (This_Static_NameSpace == NULL)
+ return Global_NameSpace;
+
+ if (This_Static_NameSpace->namespace_name == NULL)
+ return NULL;
+
+ return This_Static_NameSpace;
+}
+
+SLFUTURE_CONST char *_pSLang_cur_namespace_intrinsic (void)
+{
+ SLang_NameSpace_Type *ns = _pSLang_cur_namespace ();
+ if (ns == NULL)
+ return "";
+ return ns->namespace_name;
+}
+
+SLCONST char *_pSLang_current_function_name (void)
+{
+ if (Current_Function == NULL)
+ return NULL;
+
+ return Current_Function->name;
+}
+
+SLang_Object_Type *_pSLang_get_run_stack_pointer (void)
+{
+ return Stack_Pointer;
+}
+
+SLang_Object_Type *_pSLang_get_run_stack_base (void)
+{
+ return Run_Stack;
+}
+
+int _pSLang_dump_stack (void) /*{{{*/
+{
+ char buf32;
+ unsigned int n;
+
+ n = (unsigned int) (Stack_Pointer - Run_Stack);
+ while (n)
+ {
+	n--;
+	sprintf (buf, "(%u)", n);
+	_pSLdump_objects (buf, Run_Stack + n, 1, 1);
+ }
+ return 0;
+}
+
+/*}}}*/
+
+int _pSLang_is_arith_type (SLtype t)
+{
+ return (int) IS_ARITH_TYPE(t);
+}
+void _pSLang_set_arith_type (SLtype t, unsigned char v)
+{
+ if (t < 256)
+ Is_Arith_Type_Arrayt = v;
+}
+
+#if SLANG_HAS_DEBUGGER_SUPPORT
+void _pSLang_use_frame_namespace (int depth)
+{
+ Function_Stack_Type s;
+ if (-1 == get_function_stack_info (depth, &s))
+ return;
+
+ This_Static_NameSpace = s.static_ns;
+ This_Private_NameSpace = s.private_ns;
+ (void) setup_default_compile_linkage (s.static_ns == Global_NameSpace);
+}
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/slang.h Added

@@ -0,0 +1,2507 @@
+#ifndef DAVIS_SLANG_H_
+#define DAVIS_SLANG_H_
+/* -*- mode: C; mode: fold; -*- */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#define SLANG_VERSION 20302
+#define SLANG_VERSION_STRING "2.3.2"
+/* #ifdef __DATE__ */
+/* # define SLANG_VERSION_STRING SLANG_VERSION_STRING0 " " __DATE__ */
+/* #else */
+/* # define SLANG_VERSION_STRING SLANG_VERSION_STRING0 */
+/* #endif */
+/*{{{ System Dependent Macros and Typedefs */
+
+#if defined(__WATCOMC__) && defined(DOS)
+# ifndef __MSDOS__
+# define __MSDOS__
+# endif
+# ifndef DOS386
+# define DOS386
+# endif
+# ifndef IBMPC_SYSTEM
+# define IBMPC_SYSTEM
+# endif
+#endif /* __watcomc__ */
+
+#if defined(unix) || defined(__unix)
+# ifndef __unix__
+# define __unix__ 1
+# endif
+#endif
+
+#if defined(__APPLE__)
+# ifndef __unix__
+# define __unix__ 1		 /* cough */
+# endif
+#endif
+
+#if !defined(__GO32__)
+# ifdef __unix__
+# define REAL_UNIX_SYSTEM
+# endif
+#endif
+
+/* Set of the various defines for pc systems. This includes OS/2 */
+#ifdef __GO32__
+# ifndef __DJGPP__
+# define __DJGPP__ 1
+# endif
+# ifndef IBMPC_SYSTEM
+# define IBMPC_SYSTEM
+# endif
+#endif
+
+#ifdef __BORLANDC__
+# ifndef IBMPC_SYSTEM
+# define IBMPC_SYSTEM
+# endif
+#endif
+
+#ifdef __MSDOS__
+# ifndef IBMPC_SYSTEM
+# define IBMPC_SYSTEM
+# endif
+#endif
+
+#if defined(OS2) || defined(__os2__)
+# ifndef IBMPC_SYSTEM
+# define IBMPC_SYSTEM
+# endif
+# ifndef __os2__
+# define __os2__
+# endif
+#endif
+
+#if defined(__NT__) || defined(__MINGW32__) /* || defined(__CYGWIN32__) */
+# ifndef IBMPC_SYSTEM
+# define IBMPC_SYSTEM
+# endif
+#endif
+
+#if defined(WIN32) || defined(__WIN32__)
+# ifndef IBMPC_SYSTEM
+# define IBMPC_SYSTEM
+# endif
+# ifndef __WIN32__
+# define __WIN32__
+# endif
+#endif
+
+#if defined(IBMPC_SYSTEM) || defined(VMS)
+# ifdef REAL_UNIX_SYSTEM
+# undef REAL_UNIX_SYSTEM
+# endif
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#if 0
+}
+#endif
+
+#include <stdio.h>
+#include <stdarg.h>
+#if defined(__STDC__) || defined(__BORLANDC__) || defined(__cplusplus)
+# include <stddef.h>		 /* for offsetof */
+#endif
+
+#ifdef SIZEOF_SHORT
+# define SLANG_SIZEOF_SHORT SIZEOF_SHORT
+#endif
+#ifdef SIZEOF_INT
+# define SLANG_SIZEOF_INT SIZEOF_INT
+#endif
+#ifdef SIZEOF_FLOAT
+# define SLANG_SIZEOF_FLOAT SIZEOF_FLOAT
+#endif
+#ifdef SIZEOF_DOUBLE
+# define SLANG_SIZEOF_DOUBLE SIZEOF_DOUBLE
+#endif
+
+#if !defined(SIZEOF_SHORT) || !defined(SIZEOF_INT) || !defined(SIZEOF_LONG) || !defined(SIZEOF_FLOAT) || !defined(SIZEOF_DOUBLE)
+# include <limits.h>
+# if !defined(SIZEOF_SHORT) && defined(SHRT_MAX)
+# if SHRT_MAX == 32767
+# define SLANG_SIZEOF_SHORT 2
+# else
+# if SHRT_MAX == 2147483647L
+# define SLANG_SIZEOF_SHORT 4
+# endif
+# endif
+# endif
+# if !defined(SIZEOF_INT) && defined(INT_MAX)
+# if INT_MAX == 32767
+# define SLANG_SIZEOF_INT 2
+# else
+# if INT_MAX == 2147483647L
+# define SLANG_SIZEOF_INT 4
+# endif
+# endif
+# endif
+# if !defined(SIZEOF_LONG) && defined(LONG_MAX)
+# if LONG_MAX == 32767
+# define SLANG_SIZEOF_LONG 2
+# else
+# if LONG_MAX == 2147483647L
+# define SLANG_SIZEOF_LONG 4
+# else
+# define SLANG_SIZEOF_LONG 8
+# endif
+# endif
+# endif
+#endif
+
+#ifndef SLANG_SIZEOF_SHORT
+# define SLANG_SIZEOF_SHORT 2
+#endif
+#ifndef SLANG_SIZEOF_INT
+# define SLANG_SIZEOF_INT 4
+#endif
+#ifndef SLANG_SIZEOF_LONG
+# define SLANG_SIZEOF_LONG 4
+#endif
+#ifndef SLANG_SIZEOF_FLOAT
+# define SLANG_SIZEOF_FLOAT 4
+#endif
+#ifndef SLANG_SIZEOF_DOUBLE
+# define SLANG_SIZEOF_DOUBLE 8
+#endif
+
+/* ---------------------------- Generic Macros ----------------------------- */
+
+/* __SC__ is defined for Symantec C++
+ DOS386 is defined for -mx memory model, 32 bit DOS extender. */
+
+#if defined(__SC__) && !defined(DOS386)
+# include <dos.h>
+#endif
+
+#if defined(__BORLANDC__)
+# include <alloc.h>
+#endif
+
+#ifdef __GNUC__
+# define SLATTRIBUTE_(x) __attribute__ (x)
+#else
+# define SLATTRIBUTE_(x)
+#endif
+#define SLATTRIBUTE_PRINTF(a,b) SLATTRIBUTE_((format(printf,a,b)))
+
+#if defined (__cplusplus) || defined(__STDC__) || defined(IBMPC_SYSTEM)
+typedef void *VOID_STAR;
+#define SLCONST const
+#else
+typedef unsigned char *VOID_STAR;
+#define SLCONST
+#endif
+
+#ifdef ENABLE_SLFUTURE_CONST
+# define SLFUTURE_CONST SLCONST
+#else
+# define SLFUTURE_CONST
+#endif
+
+#ifdef ENABLE_SLFUTURE_VOID
+# define SLFUTURE_VOID void
+#else
+# define SLFUTURE_VOID char
+#endif
+
+typedef int (*FVOID_STAR)(void);
+
+#if defined(__MSDOS__) && defined(__BORLANDC__)
+# define SLFREE(buf) farfree((void far *)(buf))
+# define SLMALLOC(x) farmalloc((unsigned long) (x))
+# define SLREALLOC(buf, n) farrealloc((void far *) (buf), (unsigned long) (n))
+# define SLCALLOC(n, m) farcalloc((unsigned long) (n), (unsigned long) (m))
+#else
+# if defined(VMS) && !defined(__DECC)
+# define SLFREE VAXC$FREE_OPT
+# define SLMALLOC VAXC$MALLOC_OPT
+# define SLREALLOC VAXC$REALLOC_OPT
+# define SLCALLOC VAXC$CALLOC_OPT
+# else
+# define SLFREE(x) free((char *)(x))
+# define SLMALLOC malloc
+# define SLREALLOC realloc
+# define SLCALLOC calloc
+# endif
+#endif
+
+#if (defined(__WIN32__) || defined(__CYGWIN32__)) && defined(SLANG_DLL) && SLANG_DLL
+# define SL_EXPORT __declspec(dllexport)
+# define SL_IMPORT __declspec(dllimport)
+#else
+# define SL_EXPORT
+# define SL_IMPORT
+#endif
+#ifdef SLANG_SOURCE_
+# define SL_EXTERN extern SL_EXPORT
+#else
+# define SL_EXTERN extern SL_IMPORT
+#endif
+
+SL_EXTERN SLFUTURE_VOID *SLdebug_malloc (unsigned long);
+SL_EXTERN SLFUTURE_VOID *SLdebug_calloc (unsigned long, unsigned long);
+SL_EXTERN SLFUTURE_VOID *SLdebug_realloc (SLFUTURE_VOID *, unsigned long);
+SL_EXTERN void SLdebug_free (SLFUTURE_VOID *);
+SL_EXTERN void SLmalloc_dump_statistics (void);
+SL_EXTERN char *SLstrcpy(register char *, register char *);
+SL_EXTERN int SLstrcmp(register char *, register char *);
+SL_EXTERN char *SLstrncpy(char *, register char *, register int);
+
+SL_EXTERN void SLmemset (char *, char, int);
+SL_EXTERN char *SLmemchr (register char *, register char, register int);
+SL_EXTERN char *SLmemcpy (char *, char *, int);
+SL_EXTERN int SLmemcmp (char *, char *, int);
+
+/*}}}*/
+
+typedef unsigned int SLstrlen_Type; /* Eventually this will become size_t */
+#define SLANG_STRLEN_TYPE SLANG_UINT_TYPE
+typedef int SLindex_Type;
+typedef unsigned int SLuindex_Type;
+#define SLANG_ARRAY_INDEX_TYPE SLANG_INT_TYPE
+
+/* SLstrings */
+typedef char SLstr_Type;
+SL_EXTERN int SLang_pop_strlen_type (SLstrlen_Type *);
+SL_EXTERN int SLang_push_strlen_type (SLstrlen_Type);
+
+/* An SLstr_Type object must be treated as a constant and may only be freed
+ * by the SLang_free_slstring function and nothing else.
+ */
+SL_EXTERN SLstr_Type *SLang_create_nslstring (SLFUTURE_CONST char *, SLstrlen_Type);
+SL_EXTERN SLstr_Type *SLang_create_slstring (SLFUTURE_CONST char *);
+SL_EXTERN void SLang_free_slstring (SLCONST SLstr_Type *); /* handles NULL */
+SL_EXTERN int SLang_pop_slstring (SLstr_Type **); /* free with SLang_free_slstring */
+SL_EXTERN SLstr_Type *SLang_concat_slstrings (SLstr_Type *a, SLstr_Type *b);
+typedef unsigned long SLstr_Hash_Type;
+SL_EXTERN SLstr_Hash_Type SLcompute_string_hash (SLCONST SLstr_Type *);
+
+
+/* SL_EXTERN void SLstring_dump_stats (void); // is not (yet?) defined by S-Lang library */
+
+/*{{{ UTF-8 and Wide Char support */
+
+#if SLANG_SIZEOF_INT == 4
+typedef unsigned int SLwchar_Type;
+# define SLANG_WCHAR_TYPE SLANG_UINT_TYPE
+# define SLang_push_wchar SLang_push_uint
+# define SLang_pop_wchar SLang_pop_uint
+#else
+typedef unsigned long SLwchar_Type;
+# define SLANG_WCHAR_TYPE SLANG_ULONG_TYPE
+# define SLang_push_wchar SLang_push_ulong
+# define SLang_pop_wchar SLang_pop_ulong
+#endif
+typedef unsigned char SLuchar_Type;
+
+/* Maximum multi-byte len for a unicode wchar */
+#define SLUTF8_MAX_MBLEN	6
+
+/* If argument is 1, force UTF-8 mode on. If argument is 0, force mode off.
+ * If -1, determine mode from the locale.
+ * Returns 1 if enabled, 0 if not.
+ */
+SL_EXTERN int SLutf8_enable (int);
+SL_EXTERN int SLutf8_is_utf8_mode (void);
+SL_EXTERN int SLtt_utf8_enable (int);
+SL_EXTERN int SLtt_is_utf8_mode (void);
+SL_EXTERN int SLsmg_utf8_enable (int);
+SL_EXTERN int SLsmg_is_utf8_mode (void);
+SL_EXTERN int SLinterp_utf8_enable (int);
+SL_EXTERN int SLinterp_is_utf8_mode (void);
+
+SL_EXTERN SLwchar_Type SLwchar_toupper (SLwchar_Type);
+SL_EXTERN SLwchar_Type SLwchar_tolower (SLwchar_Type);
+
+SL_EXTERN int SLwchar_wcwidth (SLwchar_Type);
+SL_EXTERN int SLwchar_isalnum (SLwchar_Type);
+SL_EXTERN int SLwchar_isalpha (SLwchar_Type);
+SL_EXTERN int SLwchar_isblank (SLwchar_Type);
+SL_EXTERN int SLwchar_iscntrl (SLwchar_Type);
+SL_EXTERN int SLwchar_isdigit (SLwchar_Type);
+SL_EXTERN int SLwchar_isgraph (SLwchar_Type);
+SL_EXTERN int SLwchar_islower (SLwchar_Type);
+SL_EXTERN int SLwchar_isprint (SLwchar_Type);
+SL_EXTERN int SLwchar_ispunct (SLwchar_Type);
+SL_EXTERN int SLwchar_isspace (SLwchar_Type);
+SL_EXTERN int SLwchar_isupper (SLwchar_Type);
+SL_EXTERN int SLwchar_isxdigit (SLwchar_Type);
+
+#define SLWCWIDTH_SINGLE_WIDTH	0x0001 /* all double width characters given as single width */
+#define SLWCWIDTH_CJK_LEGACY	0x0002 /* Ambiguous characters given width of 2 */
+SL_EXTERN int SLwchar_set_wcwidth_flags (int flags);
+
+/* The skip_char functions also skip over malformed strings counting each byte
+ * in the malformed sequence.
+ */
+SL_EXTERN SLuchar_Type *SLutf8_skip_char (SLuchar_Type *u, SLuchar_Type *umax);
+SL_EXTERN SLuchar_Type *SLutf8_bskip_char (SLuchar_Type *umin, SLuchar_Type *u);
+SL_EXTERN SLuchar_Type *SLutf8_skip_chars (SLuchar_Type *u, SLuchar_Type *umax,
+					SLstrlen_Type num, SLstrlen_Type *dnum,
+					int ignore_combining );
+SL_EXTERN SLuchar_Type *SLutf8_bskip_chars (SLuchar_Type *umin, SLuchar_Type *u,
+					 SLstrlen_Type num, SLstrlen_Type *dnum,
+					 int ignore_combining);
+
+/* The SLutf8_strup/lo functions return slstrings -- free with SLang_free_slstring */
+SL_EXTERN SLuchar_Type *SLutf8_strup (SLuchar_Type *u, SLuchar_Type *umax);
+SL_EXTERN SLuchar_Type *SLutf8_strlo (SLuchar_Type *u, SLuchar_Type *umax);
+
+SL_EXTERN SLstr_Type *SLutf8_subst_wchar (SLuchar_Type *u, SLuchar_Type *umax,
+				 SLwchar_Type wch, SLstrlen_Type pos,
+				 int ignore_combining);
+
+SL_EXTERN SLstrlen_Type SLutf8_strlen (SLuchar_Type *s, int ignore_combining);
+SL_EXTERN SLuchar_Type *SLutf8_decode (SLuchar_Type *u, SLuchar_Type *umax,
+				 SLwchar_Type *w, SLstrlen_Type *nconsumedp);
+SL_EXTERN SLuchar_Type *SLutf8_encode (SLwchar_Type w, SLuchar_Type *u, SLstrlen_Type ulen);
+
+SL_EXTERN int SLutf8_compare (SLuchar_Type *a, SLuchar_Type *amax,
+			 SLuchar_Type *b, SLuchar_Type *bmax,
+			 SLstrlen_Type nchars, int case_sensitive);
+
+/* In these functions, buf is assumed to contain at least SLUTF8_MAX_MBLEN+1
+ * bytes
+ */
+SL_EXTERN SLuchar_Type *SLutf8_extract_utf8_char (SLuchar_Type *u, SLuchar_Type *umax, SLuchar_Type *buf);
+SL_EXTERN SLuchar_Type *SLutf8_encode_null_terminate (SLwchar_Type w, SLuchar_Type *buf);
+
+typedef struct SLwchar_Lut_Type SLwchar_Lut_Type;
+SL_EXTERN SLwchar_Lut_Type *SLwchar_create_lut (unsigned int num_entries);
+SL_EXTERN int SLwchar_add_range_to_lut (SLwchar_Lut_Type *r, SLwchar_Type a, SLwchar_Type b);
+SL_EXTERN SLuchar_Type *SLwchar_skip_range (SLwchar_Lut_Type *r, SLuchar_Type *p,
+					 SLuchar_Type *pmax, int ignore_combining,
+					 int invert);
+SL_EXTERN SLwchar_Lut_Type *SLwchar_strtolut (SLuchar_Type *u,
+					 int allow_range, int allow_charclass);
+SL_EXTERN void SLwchar_free_lut (SLwchar_Lut_Type *r);
+SL_EXTERN SLuchar_Type *SLwchar_bskip_range (SLwchar_Lut_Type *r, SLuchar_Type *pmin,
+					 SLuchar_Type *p,
+					 int ignore_combining,
+					 int invert);
+SL_EXTERN int SLwchar_in_lut (SLwchar_Lut_Type *r, SLwchar_Type wch);
+
+typedef struct SLwchar_Map_Type SLwchar_Map_Type;
+SL_EXTERN void SLwchar_free_char_map (SLwchar_Map_Type *map);
+SL_EXTERN SLwchar_Map_Type *SLwchar_allocate_char_map (SLuchar_Type *from, SLuchar_Type *to);
+SL_EXTERN int SLwchar_apply_char_map (SLwchar_Map_Type *map, SLwchar_Type *input, SLwchar_Type *output, unsigned int num);
+
+/* This function returns a malloced string */
+SLuchar_Type *SLuchar_apply_char_map (SLwchar_Map_Type *map, SLuchar_Type *str);
+
+/*}}}*/
+
+/*{{{ Interpreter Typedefs */
+
+typedef unsigned int SLtype;
+#define SLANG_SLTYPE_INT_TYPE SLANG_UINT_TYPE
+
+typedef struct _pSLang_Name_Type
+{
+ SLFUTURE_CONST char *name;
+ struct _pSLang_Name_Type *next;
+ unsigned char name_type;
+ /* These values here map directly to byte codes. See _slang.h.
+ */
+#define SLANG_LVARIABLE		0x01
+#define SLANG_GVARIABLE 	0x02
+#define SLANG_IVARIABLE 	0x03 /* intrinsic variables */
+ /* Note!!! For Macro MAKE_VARIABLE below to work, SLANG_IVARIABLE Must
+ be 1 less than SLANG_RVARIABLE!!! */
+#define SLANG_RVARIABLE		0x04	 /* read only variable */
+#define SLANG_INTRINSIC 	0x05
+#define SLANG_FUNCTION 	0x06
+#define SLANG_MATH_UNARY 	0x07
+#define SLANG_APP_UNARY 	0x08
+#define SLANG_ARITH_UNARY	0x09 /* private */
+#define SLANG_ARITH_BINARY	0x0A
+#define SLANG_ICONSTANT		0x0B
+#define SLANG_DCONSTANT		0x0C
+#define SLANG_FCONSTANT		0x0D
+#define SLANG_LLCONSTANT	0x0E
+#define SLANG_PVARIABLE		0x0F /* private */
+#define SLANG_PFUNCTION		0x10 /* private */
+#define SLANG_HCONSTANT		0x11
+#define SLANG_LCONSTANT		0x12
+ /* Rest of fields depend on name type */
+}
+SLang_Name_Type;
+
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ struct _pSLang_Name_Type *next; /* this is for the hash table */
+ char name_type;
+
+ FVOID_STAR i_fun;		 /* address of object */
+
+ /* Do not change this without modifying slang.c:execute_intrinsic_fun */
+#define SLANG_MAX_INTRIN_ARGS	7
+ SLtype arg_types SLANG_MAX_INTRIN_ARGS;
+ unsigned char num_args;
+ SLtype return_type;
+}
+SLang_Intrin_Fun_Type;
+
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ SLang_Name_Type *next;
+ char name_type;
+
+ VOID_STAR addr;
+ SLtype type;
+}
+SLang_Intrin_Var_Type;
+
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ SLang_Name_Type *next;
+ char name_type;
+
+ int unary_op;
+}
+SLang_App_Unary_Type;
+
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ SLang_Name_Type *next;
+ char name_type;
+
+ int unary_op;
+}
+SLang_Math_Unary_Type;
+
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ SLang_Name_Type *next;
+ char name_type;
+
+ SLtype data_type;
+ short value;
+}
+SLang_HConstant_Type;
+
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ SLang_Name_Type *next;
+ char name_type;
+
+ SLtype data_type;
+ int value;
+}
+SLang_IConstant_Type;
+
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ SLang_Name_Type *next;
+ char name_type;
+
+ SLtype data_type;
+ long value;
+}
+SLang_LConstant_Type;
+
+#ifdef HAVE_LONG_LONG
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ SLang_Name_Type *next;
+ char name_type;
+
+ long long ll;
+}
+SLang_LLConstant_Type;
+#endif
+
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ SLang_Name_Type *next;
+ char name_type;
+ double d;
+}
+SLang_DConstant_Type;
+
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ SLang_Name_Type *next;
+ char name_type;
+ float f;
+}
+SLang_FConstant_Type;
+
+typedef struct
+{
+ SLFUTURE_CONST char *field_name;		 /* gets replaced by slstring at run-time */
+ unsigned int offset;
+ SLtype type;
+ unsigned char read_only;
+}
+SLang_IStruct_Field_Type;
+
+typedef SLCONST struct _pSLang_CStruct_Field_Type /* a g++ bug?? yuk*/
+{
+ SLFUTURE_CONST char *field_name;
+ unsigned int offset;
+ SLtype type;
+ unsigned char read_only;
+}
+SLang_CStruct_Field_Type;
+
+SL_EXTERN int SLadd_intrin_fun_table (SLang_Intrin_Fun_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int SLadd_intrin_var_table (SLang_Intrin_Var_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int SLadd_app_unary_table (SLang_App_Unary_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int SLadd_math_unary_table (SLang_Math_Unary_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int SLadd_iconstant_table (SLang_IConstant_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int SLadd_lconstant_table (SLang_LConstant_Type *, SLFUTURE_CONST char *pp);
+SL_EXTERN int SLadd_dconstant_table (SLang_DConstant_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int SLadd_fconstant_table (SLang_FConstant_Type *, SLFUTURE_CONST char *);
+#ifdef HAVE_LONG_LONG
+SL_EXTERN int SLadd_llconstant_table (SLang_LLConstant_Type *, SLFUTURE_CONST char *);
+#endif
+SL_EXTERN int SLadd_istruct_table (SLang_IStruct_Field_Type *, VOID_STAR, SLFUTURE_CONST char *);
+
+typedef struct _pSLang_NameSpace_Type SLang_NameSpace_Type;
+
+SL_EXTERN int SLns_add_intrin_fun_table (SLang_NameSpace_Type *, SLang_Intrin_Fun_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int SLns_add_intrin_var_table (SLang_NameSpace_Type *, SLang_Intrin_Var_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int SLns_add_app_unary_table (SLang_NameSpace_Type *, SLang_App_Unary_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int SLns_add_math_unary_table (SLang_NameSpace_Type *, SLang_Math_Unary_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int SLns_add_hconstant_table (SLang_NameSpace_Type *, SLang_HConstant_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int SLns_add_iconstant_table (SLang_NameSpace_Type *, SLang_IConstant_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int SLns_add_lconstant_table (SLang_NameSpace_Type *, SLang_LConstant_Type *, SLFUTURE_CONST char *);
+/* SL_EXTERN int SLns_add_fconstant_table (SLang_NameSpace_Type *, SLang_FConstant_Type *, SLFUTURE_CONST char *); // is not (yet?) defined by S-Lang library */
+SL_EXTERN int SLns_add_dconstant_table (SLang_NameSpace_Type *, SLang_DConstant_Type *, SLFUTURE_CONST char *);
+#ifdef HAVE_LONG_LONG
+/* SL_EXTERN int SLns_add_llconstant_table (SLang_NameSpace_Type *, SLang_LLConstant_Type *, SLFUTURE_CONST char *); // is not (yet?) defined by S-Lang library */
+#endif
+SL_EXTERN int SLns_add_istruct_table (SLang_NameSpace_Type *, SLang_IStruct_Field_Type *, VOID_STAR, SLFUTURE_CONST char *);
+
+SL_EXTERN int SLns_add_hconstant (SLang_NameSpace_Type *, SLFUTURE_CONST char *, SLtype, short);
+SL_EXTERN int SLns_add_iconstant (SLang_NameSpace_Type *, SLFUTURE_CONST char *, SLtype, int);
+SL_EXTERN int SLns_add_lconstant (SLang_NameSpace_Type *, SLFUTURE_CONST char *, SLtype, long);
+SL_EXTERN int SLns_add_fconstant (SLang_NameSpace_Type *, SLFUTURE_CONST char *, float);
+SL_EXTERN int SLns_add_dconstant (SLang_NameSpace_Type *, SLFUTURE_CONST char *, double);
+#ifdef HAVE_LONG_LONG
+SL_EXTERN int SLns_add_llconstant (SLang_NameSpace_Type *, SLFUTURE_CONST char *, long long);
+#endif
+SL_EXTERN SLang_NameSpace_Type *SLns_create_namespace (SLFUTURE_CONST char *);
+SL_EXTERN void SLns_delete_namespace (SLang_NameSpace_Type *);
+
+SL_EXTERN int SLns_load_file (SLFUTURE_CONST char *, SLFUTURE_CONST char *);
+SL_EXTERN int SLns_load_string (SLFUTURE_CONST char *, SLFUTURE_CONST char *);
+SL_EXTERN int (*SLns_Load_File_Hook) (SLFUTURE_CONST char *, SLFUTURE_CONST char *);
+
+#define SLANG_LOAD_FILE_VERBOSE		0x1
+#define SLANG_LOAD_MODULE_VERBOSE	0x2
+SL_EXTERN int SLang_load_file_verbose (int);
+/* Bitmapped value that controls loading messages */
+
+typedef struct SLang_Load_Type
+{
+ int type;
+
+ VOID_STAR client_data;
+ /* Pointer to data that client needs for loading */
+
+ int auto_declare_globals;
+ /* if non-zero, undefined global variables are declared as static */
+
+ char *(*read)(struct SLang_Load_Type *);
+ /* function to call to read next line from obj. */
+
+ unsigned int line_num;
+ /* Number of lines read, used for error reporting */
+
+ int parse_level;
+ /* 0 if at top level of parsing */
+
+ SLFUTURE_CONST char *name;
+ /* Name of this object, e.g., filename. This name should be unique because
+ * it alone determines the name space for static objects associated with
+ * the compilable unit.
+ */
+
+ SLFUTURE_CONST char *namespace_name;
+ unsigned long reserved3;
+ /* For future expansion */
+} SLang_Load_Type;
+
+SL_EXTERN SLang_Load_Type *SLallocate_load_type (SLFUTURE_CONST char *);
+SL_EXTERN void SLdeallocate_load_type (SLang_Load_Type *);
+SL_EXTERN SLang_Load_Type *SLns_allocate_load_type (SLFUTURE_CONST char *, SLFUTURE_CONST char *);
+
+/* Returns SLang_Error upon failure */
+SL_EXTERN int SLang_load_object (SLang_Load_Type *);
+SL_EXTERN int (*SLang_Load_File_Hook)(SLFUTURE_CONST char *);
+SL_EXTERN int (*SLang_Auto_Declare_Var_Hook) (SLFUTURE_CONST char *);
+
+SL_EXTERN int SLang_generate_debug_info (int);
+
+#if defined(ultrix) && !defined(__GNUC__)
+# ifndef NO_PROTOTYPES
+# define NO_PROTOTYPES
+# endif
+#endif
+
+#ifndef NO_PROTOTYPES
+# define _PROTO(x) x
+#else
+# define _PROTO(x) ()
+#endif
+
+SL_EXTERN int SLang_pop_array_index (SLindex_Type *);
+SL_EXTERN int SLang_push_array_index (SLindex_Type);
+
+typedef struct _pSLang_Struct_Type SLang_Struct_Type;
+SL_EXTERN void SLang_free_struct (SLang_Struct_Type *);
+SL_EXTERN int SLang_push_struct (SLang_Struct_Type *);
+SL_EXTERN int SLang_pop_struct (SLang_Struct_Type **);
+
+SL_EXTERN SLang_Struct_Type *SLang_create_struct (SLFUTURE_CONST char **field_names, unsigned int nfields);
+/* Push the specified field value onto the stack */
+SL_EXTERN int SLang_push_struct_field (SLang_Struct_Type *s, char *name);
+/* Pop the value from the stack into the specified field */
+SL_EXTERN int SLang_pop_struct_field (SLang_Struct_Type *s, char *name);
+/* Set the first n fields of the struct from the stack. If n < 0, pop all fields. */
+SL_EXTERN int SLang_pop_struct_fields (SLang_Struct_Type *s, int n);
+
+
+typedef struct _pSLang_Assoc_Array_Type SLang_Assoc_Array_Type;
+
+SL_EXTERN SLang_Assoc_Array_Type *SLang_create_assoc (SLtype type, int has_default);
+/* If has_default is non-zero, take the default value from the stack */
+SL_EXTERN void SLang_free_assoc (SLang_Assoc_Array_Type *);
+SL_EXTERN int SLang_push_assoc (SLang_Assoc_Array_Type *, int free_flag);
+SL_EXTERN int SLang_pop_assoc (SLang_Assoc_Array_Type **);
+SL_EXTERN int SLang_assoc_get (SLang_Assoc_Array_Type *, SLstr_Type *, SLtype *);
+/* SLang_assoc_get leaves the object on the stack */
+SL_EXTERN int SLang_assoc_put (SLang_Assoc_Array_Type *, SLstr_Type *);
+/* SLang_assoc_put takes the object from the stack */
+
+SL_EXTERN int SLang_assoc_key_exists (SLang_Assoc_Array_Type *, SLstr_Type *);
+
+typedef struct _pSLang_List_Type SLang_List_Type;
+SL_EXTERN SLang_List_Type *SLang_create_list (int);
+SL_EXTERN int SLang_list_append (SLang_List_Type *, int);
+SL_EXTERN int SLang_list_insert (SLang_List_Type *, int);
+SL_EXTERN int SLang_push_list (SLang_List_Type *, int free_list);
+SL_EXTERN int SLang_pop_list (SLang_List_Type **);
+SL_EXTERN void SLang_free_list (SLang_List_Type *);
+
+typedef struct _pSLang_Foreach_Context_Type SLang_Foreach_Context_Type;
+
+typedef struct _pSLang_Class_Type SLang_Class_Type;
+
+/* These are the low-level functions for building push/pop methods. They
+ * know nothing about memory management. For SLANG_CLASS_TYPE_MMT, use the
+ * MMT push/pop functions instead.
+ */
+SL_EXTERN int SLclass_push_double_obj (SLtype, double);
+SL_EXTERN int SLclass_push_float_obj (SLtype, float);
+SL_EXTERN int SLclass_push_long_obj (SLtype, long);
+SL_EXTERN int SLclass_push_int_obj (SLtype, int);
+SL_EXTERN int SLclass_push_short_obj (SLtype, short);
+SL_EXTERN int SLclass_push_char_obj (SLtype, char);
+SL_EXTERN int SLclass_push_ptr_obj (SLtype, VOID_STAR);
+SL_EXTERN int SLclass_pop_double_obj (SLtype, double *);
+SL_EXTERN int SLclass_pop_float_obj (SLtype, float *);
+SL_EXTERN int SLclass_pop_long_obj (SLtype, long *);
+SL_EXTERN int SLclass_pop_int_obj (SLtype, int *);
+SL_EXTERN int SLclass_pop_short_obj (SLtype, short *);
+SL_EXTERN int SLclass_pop_char_obj (SLtype, char *);
+SL_EXTERN int SLclass_pop_ptr_obj (SLtype, VOID_STAR *);
+
+#ifdef HAVE_LONG_LONG
+SL_EXTERN int SLang_pop_long_long (long long *);
+SL_EXTERN int SLang_push_long_long (long long);
+SL_EXTERN int SLang_pop_ulong_long (unsigned long long *);
+SL_EXTERN int SLang_push_ulong_long (unsigned long long);
+/* SL_EXTERN int SLclass_pop_llong_obj (SLtype, long long *); // is not (yet?) defined by S-Lang library */
+SL_EXTERN int SLclass_push_llong_obj (SLtype, long long);
+#endif
+
+SL_EXTERN SLang_Class_Type *SLclass_allocate_class (SLFUTURE_CONST char *);
+SL_EXTERN int SLclass_get_class_id (SLang_Class_Type *cl);
+SL_EXTERN int SLclass_create_synonym (SLFUTURE_CONST char *, SLtype);
+SL_EXTERN int SLclass_is_class_defined (SLtype);
+SL_EXTERN int SLclass_dup_object (SLtype type, VOID_STAR from, VOID_STAR to);
+
+typedef int SLclass_Type;
+#define SLANG_CLASS_TYPE_MMT		0
+#define SLANG_CLASS_TYPE_SCALAR		1
+#define SLANG_CLASS_TYPE_VECTOR		2
+#define SLANG_CLASS_TYPE_PTR		3
+SL_EXTERN int SLclass_register_class (SLang_Class_Type *, SLtype, unsigned int, SLclass_Type);
+
+SL_EXTERN int SLclass_set_string_function (SLang_Class_Type *, char *(*)(SLtype, VOID_STAR));
+SL_EXTERN int SLclass_set_destroy_function (SLang_Class_Type *, void (*)(SLtype, VOID_STAR));
+SL_EXTERN int SLclass_set_push_function (SLang_Class_Type *, int (*)(SLtype, VOID_STAR));
+SL_EXTERN int SLclass_set_apush_function (SLang_Class_Type *, int (*)(SLtype, VOID_STAR));
+SL_EXTERN int SLclass_set_pop_function (SLang_Class_Type *, int (*)(SLtype, VOID_STAR));
+
+SL_EXTERN int SLclass_set_aget_function (SLang_Class_Type *, int (*)(SLtype, unsigned int));
+SL_EXTERN int SLclass_set_aput_function (SLang_Class_Type *, int (*)(SLtype, unsigned int));
+SL_EXTERN int SLclass_set_anew_function (SLang_Class_Type *, int (*)(SLtype, unsigned int));
+
+SL_EXTERN int SLclass_set_sget_function (SLang_Class_Type *, int (*)(SLtype, SLFUTURE_CONST char *));
+SL_EXTERN int SLclass_set_sput_function (SLang_Class_Type *, int (*)(SLtype, SLFUTURE_CONST char *));
+
+SL_EXTERN int SLclass_set_acopy_function (SLang_Class_Type *, int (*)(SLtype, VOID_STAR, VOID_STAR));
+SL_EXTERN int SLclass_set_deref_function (SLang_Class_Type *, int (*)(SLtype, VOID_STAR));
+SL_EXTERN int SLclass_set_eqs_function (SLang_Class_Type *, int (*)(SLtype, VOID_STAR, SLtype, VOID_STAR));
+
+SL_EXTERN int SLclass_set_length_function (SLang_Class_Type *, int(*)(SLtype, VOID_STAR, SLuindex_Type *));
+
+SL_EXTERN int SLclass_set_is_container (SLang_Class_Type *, int);
+SL_EXTERN int SLclass_set_foreach_functions (
+ SLang_Class_Type *,
+ SLang_Foreach_Context_Type *(*)(SLtype, unsigned int), /* open method */
+ int (*)(SLtype, SLang_Foreach_Context_Type *), /* foreach method */
+ void (*)(SLtype, SLang_Foreach_Context_Type *));/* close method */
+
+/* When an array is created, this callback function is called to initialize the data
+ * at the specified address.
+ */
+SL_EXTERN int SLclass_set_aelem_init_function (SLang_Class_Type *cl, int (*f)(SLtype, VOID_STAR));
+
+/* Typecast object on the stack to type p1. p2 and p3 should be set to 1 */
+SL_EXTERN int SLclass_typecast (SLtype, int, int);
+
+#define SLMATH_SIN	1
+#define SLMATH_COS	2
+#define SLMATH_TAN	3
+#define SLMATH_ATAN	4
+#define SLMATH_ASIN	5
+#define SLMATH_ACOS	6
+#define SLMATH_EXP	7
+#define SLMATH_LOG	8
+#define SLMATH_SQRT	9
+#define SLMATH_LOG10	10
+#define SLMATH_REAL	11
+#define SLMATH_IMAG	12
+#define SLMATH_SINH	13
+#define SLMATH_COSH	14
+#define SLMATH_TANH	15
+#define SLMATH_ATANH	16
+#define SLMATH_ASINH	17
+#define SLMATH_ACOSH	18
+#define SLMATH_TODOUBLE	19
+#define SLMATH_CONJ	20
+#define SLMATH_ISINF	21
+#define SLMATH_ISNAN	22
+#define SLMATH_FLOOR	23
+#define SLMATH_CEIL	24
+#define SLMATH_ROUND	25
+#define SLMATH_EXPM1	26
+#define SLMATH_LOG1P	27
+
+SL_EXTERN int SLclass_add_unary_op (SLtype,
+				 int (*) (int,
+					 SLtype, VOID_STAR, SLuindex_Type,
+					 VOID_STAR),
+				 int (*) (int, SLtype, SLtype *));
+
+SL_EXTERN int
+SLclass_add_app_unary_op (SLtype,
+			 int (*) (int,
+				 SLtype, VOID_STAR, SLuindex_Type,
+				 VOID_STAR),
+			 int (*) (int, SLtype, SLtype *));
+
+SL_EXTERN int
+SLclass_add_binary_op (SLtype, SLtype,
+		 int (*) (int,
+				SLtype, VOID_STAR, SLuindex_Type,
+				SLtype, VOID_STAR, SLuindex_Type,
+				VOID_STAR),
+		 int (*) (int, SLtype, SLtype, SLtype *));
+
+SL_EXTERN int
+SLclass_add_math_op (SLtype,
+		 int (*)(int,
+			 SLtype, VOID_STAR, SLuindex_Type,
+			 VOID_STAR),
+		 int (*)(int, SLtype, SLtype *));
+
+SL_EXTERN int
+SLclass_add_typecast (SLtype /* from */, SLtype /* to */,
+		 int (*)_PROTO((SLtype, VOID_STAR, SLuindex_Type,
+				 SLtype, VOID_STAR)),
+		 int	 /* allow implicit typecasts */
+		 );
+
+SL_EXTERN SLFUTURE_CONST char *SLclass_get_datatype_name (SLtype);
+
+SL_EXTERN double SLcomplex_abs (double *);
+SL_EXTERN double *SLcomplex_times (double *, double *, double *);
+SL_EXTERN double *SLcomplex_divide (double *, double *, double *);
+SL_EXTERN double *SLcomplex_sin (double *, double *);
+SL_EXTERN double *SLcomplex_cos (double *, double *);
+SL_EXTERN double *SLcomplex_tan (double *, double *);
+SL_EXTERN double *SLcomplex_asin (double *, double *);
+SL_EXTERN double *SLcomplex_acos (double *, double *);
+SL_EXTERN double *SLcomplex_atan (double *, double *);
+SL_EXTERN double *SLcomplex_exp (double *, double *);
+SL_EXTERN double *SLcomplex_log (double *, double *);
+SL_EXTERN double *SLcomplex_log10 (double *, double *);
+SL_EXTERN double *SLcomplex_sqrt (double *, double *);
+SL_EXTERN double *SLcomplex_sinh (double *, double *);
+SL_EXTERN double *SLcomplex_cosh (double *, double *);
+SL_EXTERN double *SLcomplex_tanh (double *, double *);
+SL_EXTERN double *SLcomplex_pow (double *, double *, double *);
+SL_EXTERN double SLmath_hypot (double x, double y);
+
+/* Not implemented yet */
+SL_EXTERN double *SLcomplex_asinh (double *, double *);
+SL_EXTERN double *SLcomplex_acosh (double *, double *);
+SL_EXTERN double *SLcomplex_atanh (double *, double *);
+
+#ifdef SLANG_SOURCE_
+typedef struct _pSLang_MMT_Type SLang_MMT_Type;
+#else
+typedef int SLang_MMT_Type;
+#endif
+
+SL_EXTERN void SLang_free_mmt (SLang_MMT_Type *);
+SL_EXTERN VOID_STAR SLang_object_from_mmt (SLang_MMT_Type *);
+SL_EXTERN SLang_MMT_Type *SLang_create_mmt (SLtype, VOID_STAR);
+SL_EXTERN int SLang_push_mmt (SLang_MMT_Type *);
+SL_EXTERN SLang_MMT_Type *SLang_pop_mmt (SLtype);
+SL_EXTERN void SLang_inc_mmt (SLang_MMT_Type *);
+
+/* Maximum number of dimensions of an array. */
+#define SLARRAY_MAX_DIMS		7
+typedef struct _pSLang_Array_Type
+{
+ SLtype data_type;
+ unsigned int sizeof_type;
+ VOID_STAR data;
+ SLuindex_Type num_elements;
+ unsigned int num_dims;
+ SLindex_Type dims SLARRAY_MAX_DIMS;
+ VOID_STAR (*index_fun)_PROTO((struct _pSLang_Array_Type *, SLindex_Type *));
+ /* This function is designed to allow a type to store an array in
+ * any manner it chooses. This function returns the address of the data
+ * value at the specified index location.
+ */
+ unsigned int flags;
+#define SLARR_DATA_VALUE_IS_READ_ONLY		0x0001
+#define SLARR_DATA_VALUE_IS_POINTER		0x0002
+#define SLARR_DATA_VALUE_IS_RANGE		0x0004
+#define SLARR_DATA_VALUE_IS_INTRINSIC		0x0008
+#define SLARR_DERIVED_FROM_SCALAR		0x0100
+ SLang_Class_Type *cl;
+ unsigned int num_refs;
+ void (*free_fun)_PROTO((struct _pSLang_Array_Type *));
+ VOID_STAR client_data;
+}
+SLang_Array_Type;
+
+SL_EXTERN int _pSLarray_convert_to_array (VOID_STAR cd,
+				 int (*get_type)(VOID_STAR, SLuindex_Type, SLtype *),
+				 int (*push)(VOID_STAR, SLuindex_Type),
+				 SLuindex_Type num_objects, SLtype type);
+
+SL_EXTERN int SLang_pop_array_of_type (SLang_Array_Type **atp, SLtype type);
+SL_EXTERN int SLang_pop_array (SLang_Array_Type **atp, int convert_scalar);
+SL_EXTERN int SLang_push_array (SLang_Array_Type *at, int do_free);
+SL_EXTERN void SLang_free_array (SLang_Array_Type *at);
+SL_EXTERN SLang_Array_Type *SLang_create_array (SLtype, int, VOID_STAR, SLindex_Type *, unsigned int);
+SL_EXTERN SLang_Array_Type *SLang_create_array1 (SLtype, int, VOID_STAR, SLindex_Type *, unsigned int, int);
+SL_EXTERN SLang_Array_Type *SLang_duplicate_array (SLang_Array_Type *);
+SL_EXTERN int SLang_get_array_element (SLang_Array_Type *, SLindex_Type *, VOID_STAR);
+SL_EXTERN int SLang_set_array_element (SLang_Array_Type *, SLindex_Type *, VOID_STAR);
+
+typedef int SLarray_Contract_Fun_Type (VOID_STAR xp, unsigned int increment, unsigned int num, VOID_STAR yp);
+typedef struct
+{
+ SLtype from_type;		 /* if array is this type */
+ SLtype typecast_to_type;	 /* typecast it to this */
+ SLtype result_type;		 /* to produce this */
+ SLarray_Contract_Fun_Type *f; /* via this function */
+}
+SLarray_Contract_Type;
+SL_EXTERN int SLarray_contract_array (SLCONST SLarray_Contract_Type *);
+
+typedef int SLarray_Map_Fun_Type (SLtype xtype, VOID_STAR xp,
+				 unsigned int increment, unsigned int num,
+				 SLtype ytype, VOID_STAR yp, VOID_STAR clientdata);
+typedef struct
+{
+ SLtype from_type;		 /* if array is this type */
+ SLtype typecast_to_type;	 /* typecast it to this */
+ SLtype result_type;		 /* to produce this */
+ SLarray_Map_Fun_Type *f;	 /* via this function */
+}
+SLarray_Map_Type;
+
+SL_EXTERN int SLarray_map_array_1 (SLCONST SLarray_Map_Type *,
+				int *use_this_dim,
+				VOID_STAR clientdata);
+SL_EXTERN int SLarray_map_array (SLCONST SLarray_Map_Type *);
+
+/*}}}*/
+
+/*{{{ Interpreter Function Prototypes */
+
+SL_EXTERN int SLerr_throw (int err, SLFUTURE_CONST char *msg, SLtype obj_type, VOID_STAR objptr);
+SL_EXTERN void SLang_verror (int, SLFUTURE_CONST char *, ...) SLATTRIBUTE_PRINTF(2,3);
+SL_EXTERN void SLang_verror_va (int errcode, SLFUTURE_CONST char *fmt, va_list va);
+SL_EXTERN int SLang_get_error (void);
+SL_EXTERN int SLang_set_error (int);
+SL_EXTERN SLFUTURE_CONST char *SLerr_strerror (int errcode);
+SL_EXTERN int SLerr_new_exception (int baseclass, SLFUTURE_CONST char *name, SLFUTURE_CONST char *descript);
+SL_EXTERN int SLerr_exception_eqs (int, int);
+
+SL_EXTERN int SL_Any_Error;
+SL_EXTERN int SL_OS_Error;
+SL_EXTERN int SL_Malloc_Error;
+SL_EXTERN int SL_IO_Error;
+SL_EXTERN int SL_Write_Error;
+SL_EXTERN int SL_Read_Error;
+SL_EXTERN int SL_Open_Error;
+SL_EXTERN int SL_RunTime_Error;
+SL_EXTERN int SL_InvalidParm_Error;
+SL_EXTERN int SL_TypeMismatch_Error;
+SL_EXTERN int SL_UserBreak_Error;
+SL_EXTERN int SL_Stack_Error;
+SL_EXTERN int SL_StackOverflow_Error;
+SL_EXTERN int SL_StackUnderflow_Error;
+SL_EXTERN int SL_ReadOnly_Error;
+SL_EXTERN int SL_VariableUninitialized_Error;
+SL_EXTERN int SL_NumArgs_Error;
+SL_EXTERN int SL_Index_Error;
+SL_EXTERN int SL_Parse_Error;
+SL_EXTERN int SL_Syntax_Error;
+SL_EXTERN int SL_DuplicateDefinition_Error;
+SL_EXTERN int SL_UndefinedName_Error;
+SL_EXTERN int SL_Usage_Error;
+SL_EXTERN int SL_Application_Error;
+SL_EXTERN int SL_Internal_Error;
+SL_EXTERN int SL_NotImplemented_Error;
+SL_EXTERN int SL_LimitExceeded_Error;
+SL_EXTERN int SL_Forbidden_Error;
+SL_EXTERN int SL_Math_Error;
+SL_EXTERN int SL_DivideByZero_Error;
+SL_EXTERN int SL_ArithOverflow_Error;
+SL_EXTERN int SL_ArithUnderflow_Error;
+SL_EXTERN int SL_Domain_Error;
+SL_EXTERN int SL_Data_Error;
+SL_EXTERN int SL_Unicode_Error;
+SL_EXTERN int SL_InvalidUTF8_Error;
+SL_EXTERN int SL_Namespace_Error;
+SL_EXTERN int SL_Unknown_Error;
+SL_EXTERN int SL_Import_Error;
+
+/* Non zero if error occurs. Must be reset to zero to continue. */
+
+/* Compatibility */
+#define USER_BREAK			SL_UserBreak_Error
+#define INTRINSIC_ERROR			SL_RunTime_Error
+#define SL_OBJ_NOPEN			SL_Open_Error
+
+#define SL_UNKNOWN_ERROR	SL_Unknown_Error
+#define SL_APPLICATION_ERROR	SL_Application_Error
+#define SL_INTERNAL_ERROR	SL_Internal_Error
+#define SL_INTRINSIC_ERROR	SL_RunTime_Error
+#define SL_NOT_IMPLEMENTED	SL_NotImplemented_Error
+#define SL_BUILTIN_LIMIT_EXCEEDED	SL_LimitExceeded_Error
+#define SL_MALLOC_ERROR		SL_Malloc_Error
+#define SL_USER_BREAK		SL_UserBreak_Error
+#define SL_IO_WRITE_ERROR	SL_Write_Error
+#define SL_IO_READ_ERROR	SL_Read_Error
+#define SL_IO_OPEN_ERROR	SL_Open_Error
+#define SL_SYNTAX_ERROR		SL_Syntax_Error
+#define SL_STACK_OVERFLOW	SL_StackOverflow_Error
+#define SL_STACK_UNDERFLOW	SL_StackUnderflow_Error
+#define SL_TYPE_MISMATCH	SL_TypeMismatch_Error
+#define SL_READONLY_ERROR	SL_ReadOnly_Error
+#define SL_VARIABLE_UNINITIALIZED	SL_VariableUninitialized_Error
+#define SL_DUPLICATE_DEFINITION		SL_DuplicateDefinition_Error
+#define SL_INVALID_PARM			SL_InvalidParm_Error
+#define SL_UNDEFINED_NAME		SL_UndefinedName_Error
+#define SL_NUM_ARGS_ERROR		SL_NumArgs_Error
+#define SL_INDEX_ERROR			SL_Index_Error
+#define SL_DIVIDE_ERROR			SL_DivideByZero_Error
+#define SL_MATH_ERROR			SL_Math_Error
+#define SL_ARITH_OVERFLOW_ERROR		SL_ArithOverflow_Error
+#define SL_ARITH_UNDERFLOW_ERROR	SL_ArithUnderflow_Error
+#define SL_USAGE_ERROR			SL_Usage_Error
+#define SL_INVALID_DATA_ERROR		SL_Data_Error
+#define SL_UNICODE_ERROR		SL_Unicode_Error
+#define SL_INVALID_UTF8			SL_InvalidUTF8_Error
+
+ SL_EXTERN int SLang_Traceback;
+#define SL_TB_NONE		0x0
+#define SL_TB_FULL		0x1 /* full traceback */
+#define SL_TB_OMIT_LOCALS	0x2 /* full, but omit local vars */
+#define SL_TB_PARTIAL		0x4 /* show just on line of traceback */
+
+ /* If non-zero, dump an S-Lang traceback upon error. Available as
+ _traceback in S-Lang. */
+
+ SL_EXTERN char *SLang_User_Prompt;
+ /* Prompt to use when reading from stdin */
+ SL_EXTERN int SLang_Version;
+ SL_EXTERN SLFUTURE_CONST char *SLang_Version_String;
+SL_EXTERN SLFUTURE_CONST char *SLang_Doc_Dir;
+
+SL_EXTERN void (*SLang_VMessage_Hook) (SLFUTURE_CONST char *, va_list);
+SL_EXTERN void SLang_vmessage (SLFUTURE_CONST char *, ...) SLATTRIBUTE_PRINTF(1,2);
+
+ SL_EXTERN void (*SLang_Error_Hook)(SLFUTURE_CONST char *);
+ /* Pointer to application dependent error messaging routine. By default,
+ messages are displayed on stderr. */
+
+ SL_EXTERN void (*SLang_Exit_Error_Hook)(SLFUTURE_CONST char *, va_list);
+SL_EXTERN void SLang_exit_error (SLFUTURE_CONST char *, ...) SLATTRIBUTE_((format (printf, 1, 2), noreturn));
+ SL_EXTERN void (*SLang_Dump_Routine)(SLFUTURE_CONST char *);
+ /* Called if S-Lang traceback is enabled as well as other debugging
+ routines (e.g., trace). By default, these messages go to stderr. */
+
+ SL_EXTERN void (*SLang_Interrupt)(void);
+ /* function to call whenever inner interpreter is entered. This is
+ a good place to set SLang_Error to USER_BREAK. */
+
+ SL_EXTERN void (*SLang_User_Clear_Error)(void);
+ /* function that gets called when '_clear_error' is called. */
+
+ /* If non null, these call C functions before and after a slang function. */
+ SL_EXTERN void (*SLang_Enter_Function)(SLFUTURE_CONST char *);
+SL_EXTERN void (*SLang_Exit_Function)(SLFUTURE_CONST char *);
+
+SL_EXTERN int SLang_Num_Function_Args;
+
+/* This function should be called when a system call is interrupted. It
+ * runs a set of hooks. If any of the hooks returns -1, then the system call
+ * should not be restarted.
+ */
+SL_EXTERN int SLang_handle_interrupt (void);
+SL_EXTERN int SLang_add_interrupt_hook (int (*)(VOID_STAR), VOID_STAR);
+SL_EXTERN void SLang_remove_interrupt_hook (int (*)(VOID_STAR), VOID_STAR);
+
+/* Functions: */
+
+SL_EXTERN int SLang_init_all (void);
+/* Initializes interpreter and all modules */
+
+SL_EXTERN int SLang_init_slang (void);
+/* This function is mandatory and must be called by all applications that
+ * use the interpreter
+ */
+SL_EXTERN int SLang_init_posix_process (void); /* process specific intrinsics */
+SL_EXTERN int SLang_init_stdio (void); /* fgets, etc. stdio functions */
+SL_EXTERN int SLang_init_posix_dir (void);
+SL_EXTERN int SLang_init_ospath (void);
+
+SL_EXTERN int SLang_init_slmath (void);
+/* called if math functions sin, cos, etc... are needed. */
+
+/* These functions are obsolete. Use init_stdio, posix_process, etc. */
+SL_EXTERN int SLang_init_slfile (void);
+SL_EXTERN int SLang_init_slunix (void);
+
+SL_EXTERN int SLang_init_slassoc (void);
+/* Assoc Arrays (Hashes) */
+
+SL_EXTERN int SLang_init_array (void);
+/* Additional arrays functions: transpose, etc... */
+
+SL_EXTERN int SLang_init_array_extra (void);
+/* Additional arrays functions, if any */
+
+SL_EXTERN int SLang_init_signal (void);
+/* signal handling within the interpreter */
+
+/* Dynamic linking facility */
+SL_EXTERN int SLang_init_import (void);
+
+ SL_EXTERN int SLang_load_file (SLFUTURE_CONST char *);
+ /* Load a file of S-Lang code for interpreting. If the parameter is
+ * NULL, input comes from stdin. */
+
+ SL_EXTERN void SLang_restart(int);
+ /* should be called if an error occurs. If the passed integer is
+ * non-zero, items are popped off the stack; otherwise, the stack is
+ * left intact. Any time the stack is believed to be trashed, this routine
+ * should be called with a non-zero argument (e.g., if setjmp/longjmp is
+ * called). */
+
+ SL_EXTERN int SLang_byte_compile_file(SLFUTURE_CONST char *, int);
+ /* takes a file of S-Lang code and ``byte-compiles'' it for faster
+ * loading. The new filename is equivalent to the old except that a `c' is
+ * appended to the name. (e.g., init.sl --> init.slc). The second
+ * specified the method; currently, it is not used.
+ */
+
+ SL_EXTERN int SLang_autoload(SLFUTURE_CONST char *, SLFUTURE_CONST char *);
+ /* Automatically load S-Lang function p1 from file p2. This function
+ is also available via S-Lang */
+
+ SL_EXTERN int SLang_load_string(SLFUTURE_CONST char *);
+ /* Like SLang_load_file except input is from a null terminated string. */
+
+SL_EXTERN int SLstack_depth(void);
+
+SL_EXTERN int SLdo_pop(void);
+SL_EXTERN int SLdo_pop_n(unsigned int);
+
+SL_EXTERN int SLang_push_char (char);
+SL_EXTERN int SLang_push_uchar (unsigned char);
+SL_EXTERN int SLang_pop_char (char *);
+SL_EXTERN int SLang_pop_uchar (unsigned char *);
+
+#define SLang_push_integer SLang_push_int
+#define SLang_push_uinteger SLang_push_uint
+#define SLang_pop_integer SLang_pop_int
+#define SLang_pop_uinteger SLang_pop_uint
+SL_EXTERN int SLang_push_int(int);
+SL_EXTERN int SLang_push_uint(unsigned int);
+SL_EXTERN int SLang_pop_int(int *);
+SL_EXTERN int SLang_pop_uint(unsigned int *);
+
+SL_EXTERN int SLang_pop_short(short *);
+SL_EXTERN int SLang_pop_ushort(unsigned short *);
+SL_EXTERN int SLang_push_short(short);
+SL_EXTERN int SLang_push_ushort(unsigned short);
+
+SL_EXTERN int SLang_pop_long(long *);
+SL_EXTERN int SLang_pop_ulong(unsigned long *);
+SL_EXTERN int SLang_push_long(long);
+SL_EXTERN int SLang_push_ulong(unsigned long);
+
+SL_EXTERN int SLang_pop_float(float *);
+SL_EXTERN int SLang_push_float(float);
+
+SL_EXTERN int SLang_pop_double(double *);
+SL_EXTERN int SLang_push_double(double);
+
+SL_EXTERN int SLang_push_complex (double, double);
+SL_EXTERN int SLang_pop_complex (double *, double *);
+
+SL_EXTERN int SLang_push_datatype (SLtype);
+SL_EXTERN int SLang_pop_datatype (SLtype *);
+
+SL_EXTERN int SLang_push_malloced_string(char *);
+/* The normal SLang_push_string pushes an slstring. This one converts
+ * a normally malloced string to an slstring, and then frees the
+ * malloced string. So, do NOT use the malloced string after calling
+ * this routine because it will be freed! The routine returns -1 upon
+ * error, but the string will be freed.
+ */
+
+SL_EXTERN int SLang_push_string(SLFUTURE_CONST char *);
+SL_EXTERN int SLpop_string (char **); /* malloced -- free with SLfree */
+
+SL_EXTERN int SLang_push_null (void);
+SL_EXTERN int SLang_pop_null (void);
+
+SL_EXTERN int SLang_push_value (SLtype type, VOID_STAR);
+SL_EXTERN int SLang_pop_value (SLtype type, VOID_STAR);
+SL_EXTERN void SLang_free_value (SLtype type, VOID_STAR);
+
+typedef struct _pSLang_Object_Type SLang_Any_Type;
+SL_EXTERN int SLang_pop_anytype (SLang_Any_Type **);
+SL_EXTERN int SLang_push_anytype (SLang_Any_Type *);
+SL_EXTERN void SLang_free_anytype (SLang_Any_Type *);
+
+#ifdef SLANG_SOURCE_
+typedef struct _pSLang_Ref_Type SLang_Ref_Type;
+#else
+typedef int SLang_Ref_Type;
+#endif
+
+SL_EXTERN int SLang_pop_ref (SLang_Ref_Type **);
+SL_EXTERN void SLang_free_ref (SLang_Ref_Type *);
+SL_EXTERN int SLang_assign_to_ref (SLang_Ref_Type *, SLtype, VOID_STAR);
+SL_EXTERN int SLang_assign_nametype_to_ref (SLang_Ref_Type *, SLang_Name_Type *);
+SL_EXTERN SLang_Name_Type *SLang_pop_function (void);
+SL_EXTERN int SLang_push_function (SLang_Name_Type *);
+SL_EXTERN SLang_Name_Type *SLang_get_fun_from_ref (SLang_Ref_Type *);
+SL_EXTERN void SLang_free_function (SLang_Name_Type *f);
+SL_EXTERN SLang_Name_Type *SLang_copy_function (SLang_Name_Type *);
+
+/* C structure interface */
+SL_EXTERN int SLang_push_cstruct (VOID_STAR, SLang_CStruct_Field_Type *);
+SL_EXTERN int SLang_pop_cstruct (VOID_STAR, SLang_CStruct_Field_Type *);
+SL_EXTERN void SLang_free_cstruct (VOID_STAR, SLang_CStruct_Field_Type *);
+SL_EXTERN int SLang_assign_cstruct_to_ref (SLang_Ref_Type *, VOID_STAR, SLang_CStruct_Field_Type *);
+
+ SL_EXTERN int SLang_is_defined(SLFUTURE_CONST char *);
+ /* Return non-zero is p1 is defined otherwise returns 0. */
+
+ SL_EXTERN int SLang_run_hooks(SLFUTURE_CONST char *, unsigned int, ...);
+ /* calls S-Lang function p1 pushing p2 strings in the variable argument
+ * list onto the stack first.
+ * Returns -1 upon error, 1 if hooks exists and it ran,
+ * or 0 if hook does not exist. Thus it returns non-zero is hook was called.
+ */
+
+/* These functions return 1 if the indicated function exists and the function
+ * runs without error. If the function does not exist, the function returns
+ * 0. Otherwise -1 is returned with SLang_Error set appropriately.
+ */
+SL_EXTERN int SLexecute_function (SLang_Name_Type *);
+SL_EXTERN int SLang_execute_function(SLFUTURE_CONST char *);
+
+SL_EXTERN int SLang_end_arg_list (void);
+SL_EXTERN int SLang_start_arg_list (void);
+
+SL_EXTERN int SLang_add_intrinsic_array (SLFUTURE_CONST char *, /* name */
+				 SLtype, /* type */
+				 int, /* readonly */
+				 VOID_STAR, /* data */
+				 unsigned int, ...); /* num dims */
+
+SL_EXTERN int SLextract_list_element (SLFUTURE_CONST char *, unsigned int, char,
+				 char *, unsigned int);
+
+/* If utf8_encode is >1, then byte values > 127 will be utf8-encoded.
+ * If the string is already in utf8 form, and utf8 is desired, then use with
+ * utf8_encode set to 0. A value of -1 implies use the value appropriate for
+ * the current state of the interpreter.
+ */
+SL_EXTERN int SLexpand_escaped_string (char *dest, char *src, char *src_max,
+				 int utf8_encode);
+
+SL_EXTERN SLang_Name_Type *SLang_get_function (SLFUTURE_CONST char *);
+SL_EXTERN void SLang_release_function (SLang_Name_Type *);
+
+SL_EXTERN int SLreverse_stack (int);
+SL_EXTERN int SLroll_stack (int);
+/* If argument p is positive, the top p objects on the stack are rolled
+ * up. If negative, the stack is rolled down.
+ */
+
+/* exchange two items on the stack. The top item is given by 0 */
+SL_EXTERN int SLstack_exch (unsigned int, unsigned int);
+
+SL_EXTERN int SLdup_n (int n);
+/* Duplicate top n elements of stack */
+
+SL_EXTERN int SLang_peek_at_stack1 (void);
+SL_EXTERN int SLang_peek_at_stack (void);
+SL_EXTERN int SLang_peek_at_stack_n (unsigned int n);
+SL_EXTERN int SLang_peek_at_stack1_n (unsigned int n);
+
+/* Returns type of next object on stack-- -1 upon stack underflow. */
+SL_EXTERN void SLmake_lut (unsigned char *, unsigned char *, unsigned char);
+
+ SL_EXTERN int SLang_guess_type (SLFUTURE_CONST char *);
+
+SL_EXTERN int SLstruct_create_struct (unsigned int,
+				 SLFUTURE_CONST char **,
+				 SLtype *,
+				 VOID_STAR *);
+
+/*}}}*/
+
+/*{{{ Misc Functions */
+
+/* This is an interface to atexit */
+SL_EXTERN int SLang_add_cleanup_function (void (*)(void));
+
+SL_EXTERN char *SLmake_string (SLFUTURE_CONST char *);
+SL_EXTERN char *SLmake_nstring (SLFUTURE_CONST char *, SLstrlen_Type);
+/* Returns a null terminated string made from the first n characters of the
+ * string.
+ */
+
+/* Binary strings */
+/* The binary string is an opaque type. Use the SLbstring_get_pointer function
+ * to get a pointer and length.
+ */
+typedef struct _pSLang_BString_Type SLang_BString_Type;
+SL_EXTERN unsigned char *SLbstring_get_pointer (SLang_BString_Type *, SLstrlen_Type *);
+
+SL_EXTERN SLang_BString_Type *SLbstring_dup (SLang_BString_Type *);
+SL_EXTERN SLang_BString_Type *SLbstring_create (unsigned char *, SLstrlen_Type);
+
+/* The create_malloced function uses the first argument which is assumed
+ * to be a pointer to a len + 1 malloced string. The extra byte is for
+ * \0 termination.
+ */
+SL_EXTERN SLang_BString_Type *SLbstring_create_malloced (unsigned char *s, SLstrlen_Type len, int free_on_error);
+
+/* Create a bstring from an slstring */
+SL_EXTERN SLang_BString_Type *SLbstring_create_slstring (SLFUTURE_CONST char *);
+
+SL_EXTERN void SLbstring_free (SLang_BString_Type *);
+SL_EXTERN int SLang_pop_bstring (SLang_BString_Type **);
+SL_EXTERN int SLang_push_bstring (SLang_BString_Type *);
+
+SL_EXTERN SLFUTURE_VOID *SLmalloc (SLstrlen_Type);
+SL_EXTERN SLFUTURE_VOID *SLcalloc (SLstrlen_Type, SLstrlen_Type);
+SL_EXTERN void SLfree(SLFUTURE_VOID *);	 /* This function handles NULL */
+SL_EXTERN SLFUTURE_VOID *SLrealloc (SLFUTURE_VOID *, SLstrlen_Type);
+
+SL_EXTERN char *SLcurrent_time_string (void);
+
+SL_EXTERN int SLatoi(unsigned char *);
+SL_EXTERN long SLatol (unsigned char *);
+SL_EXTERN unsigned long SLatoul (unsigned char *);
+
+#ifdef HAVE_LONG_LONG
+SL_EXTERN long long SLatoll (unsigned char *s);
+SL_EXTERN unsigned long long SLatoull (unsigned char *s);
+#endif
+SL_EXTERN int SLang_pop_fileptr (SLang_MMT_Type **, FILE **);
+SL_EXTERN SLFUTURE_CONST char *SLang_get_name_from_fileptr (SLang_MMT_Type *);
+
+SL_EXTERN int SLang_get_fileptr (SLang_MMT_Type *, FILE **);
+/* This function may be used to obtain the FILE* object associated with an MMT.
+ * It returns 0 if no-errors were encountered, and -1 otherwise.
+ * If FILE* object has been closed, this function will return 0 and set the FILE*
+ * parameter to NULL.
+ */
+
+typedef struct _pSLFile_FD_Type SLFile_FD_Type;
+SL_EXTERN SLFile_FD_Type *SLfile_create_fd (SLFUTURE_CONST char *, int);
+SL_EXTERN void SLfile_free_fd (SLFile_FD_Type *);
+SL_EXTERN int SLfile_push_fd (SLFile_FD_Type *);
+SL_EXTERN int SLfile_pop_fd (SLFile_FD_Type **);
+SL_EXTERN int SLfile_get_fd (SLFile_FD_Type *, int *);
+SL_EXTERN SLFile_FD_Type *SLfile_dup_fd (SLFile_FD_Type *f0);
+SL_EXTERN int SLang_init_posix_io (void);
+
+/* These routines allow an application to attach an object to a file-descriptor
+ * as well a provide read/write/close/etc methods. To allow the coexistence of
+ * different types of objects, a clientdata-id must be used.
+ */
+SL_EXTERN int SLfile_set_getfd_method (SLFile_FD_Type *f, int (*func)(VOID_STAR, int *));
+SL_EXTERN int SLfile_set_close_method (SLFile_FD_Type *f, int (*func)(VOID_STAR));
+SL_EXTERN int SLfile_set_read_method (SLFile_FD_Type *f, int (*func)(VOID_STAR, char*, unsigned int));
+SL_EXTERN int SLfile_set_write_method (SLFile_FD_Type *f, int (*func)(VOID_STAR, char*, unsigned int));
+SL_EXTERN int SLfile_set_dup_method (SLFile_FD_Type *f, SLFile_FD_Type *(*func)(VOID_STAR));
+SL_EXTERN int SLfile_create_clientdata_id (int *id);
+SL_EXTERN int SLfile_set_clientdata (SLFile_FD_Type *f, void (*free_func)(VOID_STAR), VOID_STAR cd, int id);
+SL_EXTERN int SLfile_get_clientdata (SLFile_FD_Type *f, int id, VOID_STAR *cdp);
+
+typedef double (*SLang_To_Double_Fun_Type)(VOID_STAR);
+SL_EXTERN SLang_To_Double_Fun_Type SLarith_get_to_double_fun (SLtype, unsigned int *);
+
+SL_EXTERN int SLang_set_argc_argv (int, char **);
+
+/*}}}*/
+
+/*{{{ Qualifier Functions */
+
+SL_EXTERN int SLang_qualifier_exists (SLCONST char *name);
+SL_EXTERN int SLang_get_int_qualifier (SLCONST char *name, int *val, int defval);
+SL_EXTERN int SLang_get_long_qualifier (SLCONST char *name, long *val, long defval);
+SL_EXTERN int SLang_get_double_qualifier (SLCONST char *name, double *val, double defval);
+SL_EXTERN int SLang_get_string_qualifier (SLCONST char *name, char **val, SLFUTURE_CONST char *defval);
+
+/*}}}*/
+
+/*{{{ SLang getkey interface Functions */
+
+#ifdef REAL_UNIX_SYSTEM
+SL_EXTERN int SLang_TT_Baud_Rate;
+SL_EXTERN int SLang_TT_Read_FD;
+#else
+# if defined(__WIN32__)
+/* I do not want to include windows.h just to get the typedef for HANDLE.
+ * Make this conditional upon the inclusion of windows.h.
+ */
+# ifdef _WINDOWS_
+SL_EXTERN HANDLE SLw32_Hstdin;
+# endif
+# endif
+#endif
+
+SL_EXTERN int SLang_init_tty (int, int, int);
+/* Initializes the tty for single character input. If the first parameter *p1
+ * is in the range 0-255, it will be used for the abort character;
+ * otherwise, (unix only) if it is -1, the abort character will be the one
+ * used by the terminal. If the second parameter p2 is non-zero, flow
+ * control is enabled. If the last parmeter p3 is zero, output processing
+ * is NOT turned on. A value of zero is required for the screen management
+ * routines. Returns 0 upon success. In addition, if SLang_TT_Baud_Rate ==
+ * 0 when this function is called, SLang will attempt to determine the
+ * terminals baud rate. As far as the SLang library is concerned, if
+ * SLang_TT_Baud_Rate is less than or equal to zero, the baud rate is
+ * effectively infinite.
+ */
+
+SL_EXTERN void SLang_reset_tty (void);
+/* Resets tty to what it was prior to a call to SLang_init_tty */
+#ifdef REAL_UNIX_SYSTEM
+SL_EXTERN void SLtty_set_suspend_state (int);
+ /* If non-zero argument, terminal driver will be told to react to the
+ * suspend character. If 0, it will not.
+ */
+SL_EXTERN int (*SLang_getkey_intr_hook) (void);
+#endif
+
+#define SLANG_GETKEY_ERROR 0xFFFF
+SL_EXTERN unsigned int SLang_getkey (void);
+/* reads a single key from the tty. If the read fails, 0xFFFF is returned. */
+
+#ifdef IBMPC_SYSTEM
+SL_EXTERN int SLgetkey_map_to_ansi (int);
+#endif
+
+SL_EXTERN int SLang_ungetkey_string (unsigned char *, unsigned int);
+SL_EXTERN int SLang_buffer_keystring (unsigned char *, unsigned int);
+SL_EXTERN int SLang_ungetkey (unsigned char);
+SL_EXTERN void SLang_flush_input (void);
+SL_EXTERN int SLang_input_pending (int);
+SL_EXTERN int SLang_Abort_Char;
+/* The value of the character (0-255) used to trigger SIGINT */
+SL_EXTERN int SLang_Ignore_User_Abort;
+/* If non-zero, pressing the abort character will not result in USER_BREAK
+ * SLang_Error. */
+
+SL_EXTERN int SLang_set_abort_signal (void (*)(int));
+/* If SIGINT is generated, the function p1 will be called. If p1 is NULL
+ * the SLang_default signal handler is called. This sets SLang_Error to
+ * USER_BREAK. I suspect most users will simply want to pass NULL.
+ */
+SL_EXTERN unsigned int SLang_Input_Buffer_Len;
+
+SL_EXTERN volatile int SLKeyBoard_Quit;
+
+#ifdef VMS
+/* If this function returns -1, ^Y will be added to input buffer. */
+SL_EXTERN int (*SLtty_VMS_Ctrl_Y_Hook) (void);
+#endif
+/*}}}*/
+
+/*{{{ SLang Keymap routines */
+
+typedef struct SLKeymap_Function_Type
+{
+ SLFUTURE_CONST char *name;
+ int (*f)(void);
+}
+SLKeymap_Function_Type;
+
+#define SLANG_MAX_KEYMAP_KEY_SEQ	14
+typedef struct SLang_Key_Type
+{
+ struct SLang_Key_Type *next;
+ union
+ {
+	char *s;
+	FVOID_STAR f;
+	unsigned int keysym;
+	SLang_Name_Type *slang_fun;
+ }
+ f;
+ unsigned char type;	 /* type of function */
+#define SLKEY_F_INTERPRET	0x01
+#define SLKEY_F_INTRINSIC	0x02
+#define SLKEY_F_KEYSYM		0x03
+#define SLKEY_F_SLANG		0x04
+ unsigned char strSLANG_MAX_KEYMAP_KEY_SEQ + 1;/* key sequence */
+}
+SLang_Key_Type;
+
+int SLkm_set_free_method (int, void (*)(int, VOID_STAR));
+
+typedef struct _pSLkeymap_Type
+{
+ SLFUTURE_CONST char *name;			 /* hashed string */
+ SLang_Key_Type *keymap;
+ SLKeymap_Function_Type *functions; /* intrinsic functions */
+ struct _pSLkeymap_Type *next;
+} SLkeymap_Type;
+
+SL_EXTERN SLkeymap_Type *SLKeyMap_List_Root; /* linked list of keymaps */
+
+/* backward compat */
+typedef SLkeymap_Type SLKeyMap_List_Type;
+
+SL_EXTERN char *SLang_process_keystring(SLFUTURE_CONST char *);
+
+SL_EXTERN int SLkm_define_key (SLFUTURE_CONST char *, FVOID_STAR, SLkeymap_Type *);
+
+SL_EXTERN int SLang_define_key(SLFUTURE_CONST char *, SLFUTURE_CONST char *, SLkeymap_Type *);
+/* Like define_key1 except that p2 is a string that is to be associated with
+ * a function in the functions field of p3.
+ */
+
+SL_EXTERN int SLkm_define_keysym (SLFUTURE_CONST char *, unsigned int, SLkeymap_Type *);
+SL_EXTERN int SLkm_define_slkey (SLFUTURE_CONST char *keysequence, SLang_Name_Type *func, SLkeymap_Type *);
+SL_EXTERN void SLang_undefine_key(SLFUTURE_CONST char *, SLkeymap_Type *);
+
+SL_EXTERN SLkeymap_Type *SLang_create_keymap(SLFUTURE_CONST char *, SLkeymap_Type *);
+/* create and returns a pointer to a new keymap named p1 created by copying
+ * keymap p2. If p2 is NULL, it is up to the calling routine to initialize
+ * the keymap.
+ */
+
+SL_EXTERN char *SLang_make_keystring(unsigned char *);
+
+SL_EXTERN SLang_Key_Type *SLang_do_key(SLkeymap_Type *, int (*)(void));
+/* read a key using keymap p1 with getkey function p2 */
+
+SL_EXTERN FVOID_STAR SLang_find_key_function(SLFUTURE_CONST char *, SLkeymap_Type *);
+
+SL_EXTERN SLkeymap_Type *SLang_find_keymap(SLFUTURE_CONST char *);
+
+SL_EXTERN int SLang_Last_Key_Char;
+/* Despite the name of this variable, its value is the last BYTE of a key-sequence */
+
+SL_EXTERN int SLang_Key_TimeOut_Flag;
+
+/*}}}*/
+
+/*{{{ SLang Readline Interface */
+
+typedef struct _pSLrline_Type SLrline_Type;
+SL_EXTERN SLrline_Type *SLrline_open (unsigned int width, unsigned int flags);
+SL_EXTERN SLrline_Type *SLrline_open2 (SLFUTURE_CONST char *, unsigned int width, unsigned int flags);
+#define SL_RLINE_NO_ECHO	0x0001
+#define SL_RLINE_USE_ANSI	0x0002
+#define SL_RLINE_BLINK_MATCH	0x0004
+#define SL_RLINE_UTF8_MODE	0x0008
+#define SL_RLINE_USE_MULTILINE 0x0010
+
+SL_EXTERN void SLrline_close (SLrline_Type *);
+
+/* This returns a malloced string */
+SL_EXTERN char *SLrline_read_line (SLrline_Type *, SLFUTURE_CONST char *prompt, unsigned int *lenp);
+
+SL_EXTERN int SLrline_bol (SLrline_Type *);
+SL_EXTERN int SLrline_eol (SLrline_Type *);
+SL_EXTERN int SLrline_del (SLrline_Type *, unsigned int len);
+SL_EXTERN int SLrline_ins (SLrline_Type *, SLFUTURE_CONST char *s, unsigned int len);
+SL_EXTERN int SLrline_move (SLrline_Type *, int);
+
+SL_EXTERN int SLrline_set_echo (SLrline_Type *, int);
+SL_EXTERN int SLrline_set_tab (SLrline_Type *, unsigned int tabwidth);
+SL_EXTERN int SLrline_set_point (SLrline_Type *, unsigned int);
+SL_EXTERN int SLrline_set_line (SLrline_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int SLrline_set_hscroll (SLrline_Type *, unsigned int);
+SL_EXTERN int SLrline_set_display_width (SLrline_Type *, unsigned int);
+
+SL_EXTERN int SLrline_get_echo (SLrline_Type *, int *);
+SL_EXTERN int SLrline_get_tab (SLrline_Type *, unsigned int *);
+SL_EXTERN int SLrline_get_point (SLrline_Type *, unsigned int *);
+SL_EXTERN char *SLrline_get_line (SLrline_Type *);
+SL_EXTERN int SLrline_get_hscroll (SLrline_Type *, unsigned int *);
+SL_EXTERN int SLrline_get_display_width (SLrline_Type *, unsigned int *);
+
+SL_EXTERN int SLrline_set_update_hook (SLrline_Type *,
+				 void (*)(SLrline_Type *rli,
+					 SLFUTURE_CONST char *prompt,
+					 SLFUTURE_CONST char *buf, unsigned int len,
+					 unsigned int point, VOID_STAR client_data),
+				 VOID_STAR client_data);
+/* free update_hook client_data */
+SL_EXTERN void SLrline_set_free_update_cb (SLrline_Type *, void (*)(SLrline_Type *, VOID_STAR));
+
+/* These functions are passed a pointer to the update_hook client_data */
+SL_EXTERN void SLrline_set_update_clear_cb(SLrline_Type *, void (*)(SLrline_Type *, VOID_STAR));
+SL_EXTERN void SLrline_set_update_preread_cb (SLrline_Type *, void (*)(SLrline_Type *, VOID_STAR));
+SL_EXTERN void SLrline_set_update_postread_cb (SLrline_Type *, void (*)(SLrline_Type *, VOID_STAR));
+SL_EXTERN void SLrline_set_update_width_cb (SLrline_Type *, void (*)(SLrline_Type *, int, VOID_STAR));
+SL_EXTERN int SLrline_get_update_client_data (SLrline_Type *, VOID_STAR *);
+
+SL_EXTERN SLkeymap_Type *SLrline_get_keymap (SLrline_Type *);
+
+SL_EXTERN void SLrline_redraw (SLrline_Type *);
+SL_EXTERN int SLrline_save_line (SLrline_Type *);
+SL_EXTERN int SLrline_add_to_history (SLrline_Type *, SLFUTURE_CONST char *);
+
+/* Interpreter interface */
+SL_EXTERN int SLrline_init (SLFUTURE_CONST char *appname, SLFUTURE_CONST char *user_initfile, SLFUTURE_CONST char *sys_initfile);
+
+/* Compatibility */
+typedef SLrline_Type SLang_RLine_Info_Type;
+
+/*}}}*/
+
+/*{{{ Low Level Screen Output Interface */
+
+SL_EXTERN unsigned long SLtt_Num_Chars_Output;
+SL_EXTERN int SLtt_Baud_Rate;
+
+typedef unsigned long SLtt_Char_Type;
+
+#define SLTT_BOLD_MASK	0x01000000UL
+#define SLTT_BLINK_MASK	0x02000000UL
+#define SLTT_ULINE_MASK	0x04000000UL
+#define SLTT_REV_MASK	0x08000000UL
+#define SLTT_ALTC_MASK 0x10000000UL
+#define SLTT_ITALIC_MASK 0x20000000UL
+
+SL_EXTERN int SLtt_Screen_Rows;
+SL_EXTERN int SLtt_Screen_Cols;
+SL_EXTERN int SLtt_Term_Cannot_Insert;
+SL_EXTERN int SLtt_Term_Cannot_Scroll;
+SL_EXTERN int SLtt_Use_Ansi_Colors;
+SL_EXTERN int SLtt_Ignore_Beep;
+#if defined(REAL_UNIX_SYSTEM)
+SL_EXTERN int SLtt_Force_Keypad_Init;
+SL_EXTERN int SLang_TT_Write_FD;
+#endif
+
+#ifndef IBMPC_SYSTEM
+SL_EXTERN char *SLtt_Graphics_Char_Pairs;
+#endif
+
+#ifndef __GO32__
+#if defined(VMS) || defined(REAL_UNIX_SYSTEM)
+SL_EXTERN int SLtt_Blink_Mode;
+SL_EXTERN int SLtt_Use_Blink_For_ACS;
+SL_EXTERN int SLtt_Newline_Ok;
+SL_EXTERN int SLtt_Has_Alt_Charset;
+SL_EXTERN int SLtt_Has_Status_Line; /* if 0, NO. If > 0, YES, IF -1, ?? */
+# ifndef VMS
+SL_EXTERN int SLtt_Try_Termcap;
+# endif
+#endif
+#endif
+
+#if defined(IBMPC_SYSTEM)
+SL_EXTERN int SLtt_Msdos_Cheap_Video;
+#endif
+
+typedef unsigned short SLsmg_Color_Type;
+#define SLSMG_MAX_COLORS	0x7FFE /* keep one for BCE */
+#define SLSMG_COLOR_MASK	0x7FFF
+#define SLSMG_ACS_MASK		0x8000
+
+#define SLSMG_MAX_CHARS_PER_CELL 5
+typedef struct
+{
+ unsigned int nchars;
+ SLwchar_Type wcharsSLSMG_MAX_CHARS_PER_CELL;
+ SLsmg_Color_Type color;
+}
+SLsmg_Char_Type;
+
+#define SLSMG_EXTRACT_COLOR(x) ((x).color)
+#define SLSMG_EXTRACT_CHAR(x) ((x).wchars0)
+
+SL_EXTERN int SLtt_flush_output (void);
+SL_EXTERN void SLtt_set_scroll_region(int, int);
+SL_EXTERN void SLtt_reset_scroll_region(void);
+SL_EXTERN void SLtt_reverse_video (int);
+SL_EXTERN void SLtt_bold_video (void);
+SL_EXTERN void SLtt_begin_insert(void);
+SL_EXTERN void SLtt_end_insert(void);
+SL_EXTERN void SLtt_del_eol(void);
+SL_EXTERN void SLtt_goto_rc (int, int);
+SL_EXTERN void SLtt_delete_nlines(int);
+SL_EXTERN void SLtt_delete_char(void);
+SL_EXTERN void SLtt_erase_line(void);
+SL_EXTERN void SLtt_normal_video(void);
+SL_EXTERN void SLtt_cls(void);
+SL_EXTERN void SLtt_beep(void);
+SL_EXTERN void SLtt_reverse_index(int);
+SL_EXTERN void SLtt_smart_puts(SLsmg_Char_Type *, SLsmg_Char_Type *, int, int);
+SL_EXTERN void SLtt_write_string (SLFUTURE_CONST char *);
+SL_EXTERN void SLtt_putchar(char);
+SL_EXTERN int SLtt_init_video (void);
+SL_EXTERN int SLtt_reset_video (void);
+SL_EXTERN void SLtt_get_terminfo(void);
+SL_EXTERN void SLtt_get_screen_size (void);
+SL_EXTERN int SLtt_set_cursor_visibility (int);
+
+SL_EXTERN int SLtt_set_mouse_mode (int, int);
+
+#if defined(VMS) || defined(REAL_UNIX_SYSTEM)
+SL_EXTERN int SLtt_initialize (SLFUTURE_CONST char *);
+SL_EXTERN void SLtt_enable_cursor_keys(void);
+SL_EXTERN void SLtt_set_term_vtxxx(int *);
+SL_EXTERN void SLtt_wide_width(void);
+SL_EXTERN void SLtt_narrow_width(void);
+SL_EXTERN void SLtt_set_alt_char_set (int);
+SL_EXTERN int SLtt_write_to_status_line (SLFUTURE_CONST char *, int);
+SL_EXTERN void SLtt_disable_status_line (void);
+# ifdef REAL_UNIX_SYSTEM
+/* These are termcap/terminfo routines that assume SLtt_initialize has
+ * been called.
+ */
+SL_EXTERN char *SLtt_tgetstr (SLFUTURE_CONST char *);
+SL_EXTERN int SLtt_tgetnum (SLFUTURE_CONST char *);
+SL_EXTERN int SLtt_tgetflag (SLFUTURE_CONST char *);
+SL_EXTERN int SLtt_tgetent(char *name);
+SL_EXTERN char *SLtt_tgoto(char *cap, int col, int row);
+SL_EXTERN int SLtt_tputs(char *str, int affcnt, int (*putcfun)(int));
+
+/* The following are terminfo-only routines -- these prototypes will change
+ * in V2.x.
+ */
+SL_EXTERN char *SLtt_tigetent (SLFUTURE_CONST char *);
+SL_EXTERN char *SLtt_tigetstr (SLFUTURE_CONST char *, char **);
+SL_EXTERN int SLtt_tigetnum (SLFUTURE_CONST char *, char **);
+# endif
+#endif
+
+SL_EXTERN SLtt_Char_Type SLtt_get_color_object (int);
+SL_EXTERN int SLtt_set_color_object (int, SLtt_Char_Type);
+SL_EXTERN int SLtt_set_color (int, SLFUTURE_CONST char *, SLFUTURE_CONST char *, SLFUTURE_CONST char *);
+SL_EXTERN int SLtt_set_mono (int, SLFUTURE_CONST char *, SLtt_Char_Type);
+SL_EXTERN int SLtt_add_color_attribute (int, SLtt_Char_Type);
+SL_EXTERN int SLtt_set_color_fgbg (int, SLtt_Char_Type, SLtt_Char_Type);
+
+/*}}}*/
+
+/*{{{ SLang Preprocessor Interface */
+
+/* #define SLPreprocess_Type SLprep_Type; */
+typedef struct _pSLprep_Type SLprep_Type;
+
+SL_EXTERN SLprep_Type *SLprep_new (void);
+SL_EXTERN void SLprep_delete (SLprep_Type *);
+SL_EXTERN int SLprep_line_ok (SLFUTURE_CONST char *, SLprep_Type *);
+SL_EXTERN int SLprep_set_flags (SLprep_Type *, unsigned int flags);
+#define SLPREP_BLANK_LINES_OK	0x1
+#define SLPREP_COMMENT_LINES_OK	0x2
+
+SL_EXTERN int SLprep_set_comment (SLprep_Type *, SLFUTURE_CONST char *, SLFUTURE_CONST char *);
+SL_EXTERN int SLprep_set_prefix (SLprep_Type *, SLFUTURE_CONST char *);
+SL_EXTERN int SLprep_set_exists_hook (SLprep_Type *,
+				 int (*)(SLprep_Type *, SLFUTURE_CONST char *));
+SL_EXTERN int SLprep_set_eval_hook (SLprep_Type *,
+				 int (*)(SLprep_Type *, SLFUTURE_CONST char *));
+
+SL_EXTERN int SLdefine_for_ifdef (SLFUTURE_CONST char *);
+ /* Adds a string to the SLang #ifdef preparsing defines. SLang already
+ defines MSDOS, UNIX, and VMS on the appropriate system. */
+
+/*}}}*/
+
+/*{{{ SLsmg Screen Management Functions */
+
+SL_EXTERN void SLsmg_fill_region (int, int, unsigned int, unsigned int,
+			 SLwchar_Type);
+SL_EXTERN void SLsmg_set_char_set (int);
+#ifndef IBMPC_SYSTEM
+SL_EXTERN int SLsmg_Scroll_Hash_Border;
+#endif
+SL_EXTERN int SLsmg_suspend_smg (void);
+SL_EXTERN int SLsmg_resume_smg (void);
+SL_EXTERN void SLsmg_erase_eol (void);
+SL_EXTERN void SLsmg_gotorc (int, int);
+SL_EXTERN void SLsmg_erase_eos (void);
+SL_EXTERN void SLsmg_reverse_video (void);
+SL_EXTERN void SLsmg_set_color (SLsmg_Color_Type);
+SL_EXTERN void SLsmg_normal_video (void);
+SL_EXTERN void SLsmg_printf (SLFUTURE_CONST char *, ...) SLATTRIBUTE_PRINTF(1,2);
+/* SL_EXTERN void SLsmg_printf (SLFUTURE_CONST char *, ...) SLATTRIBUTE_PRINTF(1,2); */
+SL_EXTERN void SLsmg_vprintf (SLFUTURE_CONST char *, va_list);
+SL_EXTERN void SLsmg_write_string (SLFUTURE_CONST char *);
+SL_EXTERN void SLsmg_write_nstring (SLFUTURE_CONST char *, unsigned int);
+SL_EXTERN void SLsmg_write_chars (SLuchar_Type *u, SLuchar_Type *umax);
+SL_EXTERN void SLsmg_write_nchars (SLFUTURE_CONST char *str, unsigned int len);
+SL_EXTERN void SLsmg_write_char (SLwchar_Type ch);
+SL_EXTERN void SLsmg_write_wrapped_string (SLuchar_Type *, int, int, unsigned int, unsigned int, int);
+SL_EXTERN void SLsmg_cls (void);
+SL_EXTERN void SLsmg_refresh (void);
+SL_EXTERN void SLsmg_touch_lines (int, unsigned int);
+SL_EXTERN void SLsmg_touch_screen (void);
+SL_EXTERN int SLsmg_init_smg (void);
+SL_EXTERN int SLsmg_reinit_smg (void);
+SL_EXTERN void SLsmg_reset_smg (void);
+SL_EXTERN int SLsmg_char_at (SLsmg_Char_Type *);
+SL_EXTERN void SLsmg_set_screen_start (int *, int *);
+SL_EXTERN void SLsmg_draw_hline (unsigned int);
+SL_EXTERN void SLsmg_draw_vline (int);
+SL_EXTERN void SLsmg_draw_object (int, int, SLwchar_Type);
+SL_EXTERN void SLsmg_draw_box (int, int, unsigned int, unsigned int);
+SL_EXTERN int SLsmg_get_column(void);
+SL_EXTERN int SLsmg_get_row(void);
+SL_EXTERN void SLsmg_forward (int);
+SL_EXTERN void SLsmg_write_color_chars (SLsmg_Char_Type *, unsigned int);
+SL_EXTERN unsigned int SLsmg_read_raw (SLsmg_Char_Type *, unsigned int);
+SL_EXTERN unsigned int SLsmg_write_raw (SLsmg_Char_Type *, unsigned int);
+SL_EXTERN void SLsmg_set_color_in_region (int, int, int, unsigned int, unsigned int);
+
+SL_EXTERN unsigned int SLsmg_strwidth (SLuchar_Type *u, SLuchar_Type *max);
+SL_EXTERN unsigned int SLsmg_strbytes (SLuchar_Type *u, SLuchar_Type *max, unsigned int width);
+SL_EXTERN int SLsmg_embedded_escape_mode (int on_or_off);
+SL_EXTERN int SLsmg_Display_Eight_Bit;
+SL_EXTERN int SLsmg_Tab_Width;
+
+#define SLSMG_NEWLINE_IGNORED	0 /* default */
+#define SLSMG_NEWLINE_MOVES	1 /* moves to next line, column 0 */
+#define SLSMG_NEWLINE_SCROLLS	2 /* moves but scrolls at bottom of screen */
+#define SLSMG_NEWLINE_PRINTABLE	3 /* prints as ^J */
+SL_EXTERN int SLsmg_Newline_Behavior;
+
+SL_EXTERN int SLsmg_Backspace_Moves;
+
+#ifdef IBMPC_SYSTEM
+# define SLSMG_HLINE_CHAR	0xC4
+# define SLSMG_VLINE_CHAR	0xB3
+# define SLSMG_ULCORN_CHAR	0xDA
+# define SLSMG_URCORN_CHAR	0xBF
+# define SLSMG_LLCORN_CHAR	0xC0
+# define SLSMG_LRCORN_CHAR	0xD9
+# define SLSMG_RTEE_CHAR	0xB4
+# define SLSMG_LTEE_CHAR	0xC3
+# define SLSMG_UTEE_CHAR	0xC2
+# define SLSMG_DTEE_CHAR	0xC1
+# define SLSMG_PLUS_CHAR	0xC5
+/* There are several to choose from: 0xB0, 0xB1, and 0xB2 */
+# define SLSMG_CKBRD_CHAR	0xB0
+# define SLSMG_DIAMOND_CHAR	0x04
+# define SLSMG_DEGREE_CHAR	0xF8
+# define SLSMG_PLMINUS_CHAR	0xF1
+# define SLSMG_BULLET_CHAR	0xF9
+# define SLSMG_LARROW_CHAR	0x1B
+# define SLSMG_RARROW_CHAR	0x1A
+# define SLSMG_DARROW_CHAR	0x19
+# define SLSMG_UARROW_CHAR	0x18
+# define SLSMG_BOARD_CHAR	0xB2
+# define SLSMG_BLOCK_CHAR	0xDB
+#else
+# if defined(AMIGA)
+# define SLSMG_HLINE_CHAR	((unsigned char)'-')
+# define SLSMG_VLINE_CHAR	((unsigned char)'|')
+# define SLSMG_ULCORN_CHAR	((unsigned char)'+')
+# define SLSMG_URCORN_CHAR	((unsigned char)'+')
+# define SLSMG_LLCORN_CHAR	((unsigned char)'+')
+# define SLSMG_LRCORN_CHAR	((unsigned char)'+')
+# define SLSMG_CKBRD_CHAR	((unsigned char)'#')
+# define SLSMG_RTEE_CHAR	((unsigned char)'+')
+# define SLSMG_LTEE_CHAR	((unsigned char)'+')
+# define SLSMG_UTEE_CHAR	((unsigned char)'+')
+# define SLSMG_DTEE_CHAR	((unsigned char)'+')
+# define SLSMG_PLUS_CHAR	((unsigned char)'+')
+# define SLSMG_DIAMOND_CHAR	((unsigned char)'+')
+# define SLSMG_DEGREE_CHAR	((unsigned char)'\\')
+# define SLSMG_PLMINUS_CHAR	((unsigned char)'#')
+# define SLSMG_BULLET_CHAR	((unsigned char)'o')
+# define SLSMG_LARROW_CHAR	((unsigned char)'<')
+# define SLSMG_RARROW_CHAR	((unsigned char)'>')
+# define SLSMG_DARROW_CHAR	((unsigned char)'v')
+# define SLSMG_UARROW_CHAR	((unsigned char)'^')
+# define SLSMG_BOARD_CHAR	((unsigned char)'#')
+# define SLSMG_BLOCK_CHAR	((unsigned char)'#')
+# else
+# define SLSMG_HLINE_CHAR	((unsigned char)'q')
+# define SLSMG_VLINE_CHAR	((unsigned char)'x')
+# define SLSMG_ULCORN_CHAR	((unsigned char)'l')
+# define SLSMG_URCORN_CHAR	((unsigned char)'k')
+# define SLSMG_LLCORN_CHAR	((unsigned char)'m')
+# define SLSMG_LRCORN_CHAR	((unsigned char)'j')
+# define SLSMG_CKBRD_CHAR	((unsigned char)'a')
+# define SLSMG_RTEE_CHAR	((unsigned char)'u')
+# define SLSMG_LTEE_CHAR	((unsigned char)'t')
+# define SLSMG_UTEE_CHAR	((unsigned char)'w')
+# define SLSMG_DTEE_CHAR	((unsigned char)'v')
+# define SLSMG_PLUS_CHAR	((unsigned char)'n')
+# define SLSMG_DIAMOND_CHAR	((unsigned char)'`')
+# define SLSMG_DEGREE_CHAR	((unsigned char)'f')
+# define SLSMG_PLMINUS_CHAR	((unsigned char)'g')
+# define SLSMG_BULLET_CHAR	((unsigned char)'~')
+# define SLSMG_LARROW_CHAR	((unsigned char)',')
+# define SLSMG_RARROW_CHAR	((unsigned char)'+')
+# define SLSMG_DARROW_CHAR	((unsigned char)'.')
+# define SLSMG_UARROW_CHAR	((unsigned char)'-')
+# define SLSMG_BOARD_CHAR	((unsigned char)'h')
+# define SLSMG_BLOCK_CHAR	((unsigned char)'0')
+# endif				 /* AMIGA */
+#endif				 /* IBMPC_SYSTEM */
+
+#ifndef IBMPC_SYSTEM
+# define SLSMG_COLOR_BLACK		0x000000
+# define SLSMG_COLOR_RED		0x000001
+# define SLSMG_COLOR_GREEN		0x000002
+# define SLSMG_COLOR_BROWN		0x000003
+# define SLSMG_COLOR_BLUE		0x000004
+# define SLSMG_COLOR_MAGENTA		0x000005
+# define SLSMG_COLOR_CYAN		0x000006
+# define SLSMG_COLOR_LGRAY		0x000007
+# define SLSMG_COLOR_GRAY		0x000008
+# define SLSMG_COLOR_BRIGHT_RED		0x000009
+# define SLSMG_COLOR_BRIGHT_GREEN	0x00000A
+# define SLSMG_COLOR_BRIGHT_BROWN	0x00000B
+# define SLSMG_COLOR_BRIGHT_BLUE	0x00000C
+# define SLSMG_COLOR_BRIGHT_MAGENTA	0x00000D
+# define SLSMG_COLOR_BRIGHT_CYAN	0x00000E
+# define SLSMG_COLOR_BRIGHT_WHITE	0x00000F
+#endif
+
+typedef struct
+{
+ void (*tt_normal_video)(void);
+ void (*tt_set_scroll_region)(int, int);
+ void (*tt_goto_rc)(int, int);
+ void (*tt_reverse_index)(int);
+ void (*tt_reset_scroll_region)(void);
+ void (*tt_delete_nlines)(int);
+ void (*tt_cls) (void);
+ void (*tt_del_eol) (void);
+ void (*tt_smart_puts) (SLsmg_Char_Type *, SLsmg_Char_Type *, int, int);
+ int (*tt_flush_output) (void);
+ int (*tt_reset_video) (void);
+ int (*tt_init_video) (void);
+
+ int *tt_screen_rows;
+ int *tt_screen_cols;
+
+ int *tt_term_cannot_scroll;
+#if 0
+ int *tt_use_blink_for_acs;
+#endif
+ int *tt_has_alt_charset;
+ char **tt_graphic_char_pairs;
+ int *unicode_ok;
+
+ long reserved4;
+}
+SLsmg_Term_Type;
+SL_EXTERN void SLsmg_set_terminal_info (SLsmg_Term_Type *);
+
+/*}}}*/
+
+/*{{{ SLang Keypad Interface */
+
+#define SL_KEY_ERR		0xFFFF
+
+#define SL_KEY_UP		0x101
+#define SL_KEY_DOWN		0x102
+#define SL_KEY_LEFT		0x103
+#define SL_KEY_RIGHT		0x104
+#define SL_KEY_PPAGE		0x105
+#define SL_KEY_NPAGE		0x106
+#define SL_KEY_HOME		0x107
+#define SL_KEY_END		0x108
+#define SL_KEY_A1		0x109
+#define SL_KEY_A3		0x10A
+#define SL_KEY_B2		0x10B
+#define SL_KEY_C1		0x10C
+#define SL_KEY_C3		0x10D
+#define SL_KEY_REDO		0x10E
+#define SL_KEY_UNDO		0x10F
+#define SL_KEY_BACKSPACE	0x110
+#define SL_KEY_ENTER		0x111
+#define SL_KEY_IC		0x112
+#define SL_KEY_DELETE		0x113
+
+#define SL_KEY_F0		0x200
+#define SL_KEY_F(X)		(SL_KEY_F0 + X)
+
+/* I do not intend to use keysymps > 0x1000. Applications can use those. */
+/* Returns 0 upon success or -1 upon error. */
+SL_EXTERN int SLkp_define_keysym (SLFUTURE_CONST char *, unsigned int);
+
+/* This function must be called AFTER SLtt_get_terminfo and not before. */
+SL_EXTERN int SLkp_init (void);
+
+/* By default, SLang_getkey is used as the low-level function. This hook
+ * allows you to specify something else.
+ */
+SL_EXTERN void SLkp_set_getkey_function (int (*)(void));
+
+/* This function uses SLang_getkey and assumes that what ever initialization
+ * is required for SLang_getkey has been performed. If you do not want
+ * SLang_getkey to be used, then specify another function via
+ * SLkp_set_getkey_function.
+ */
+SL_EXTERN int SLkp_getkey (void);
+
+/*}}}*/
+
+/*{{{ SLang Scroll Interface */
+
+typedef struct _pSLscroll_Type
+{
+ struct _pSLscroll_Type *next;
+ struct _pSLscroll_Type *prev;
+ unsigned int flags;
+}
+SLscroll_Type;
+
+typedef struct
+{
+ unsigned int flags;
+ SLscroll_Type *top_window_line; /* list element at top of window */
+ SLscroll_Type *bot_window_line; /* list element at bottom of window */
+ SLscroll_Type *current_line; /* current list element */
+ SLscroll_Type *lines;	 /* first list element */
+ unsigned int nrows;		 /* number of rows in window */
+ unsigned int hidden_mask;	 /* applied to flags in SLscroll_Type */
+ unsigned int line_num;	 /* current line number (visible) */
+ unsigned int num_lines;	 /* total number of lines (visible) */
+ unsigned int window_row;	 /* row of current_line in window */
+ unsigned int border;		 /* number of rows that form scroll border */
+ int cannot_scroll;		 /* should window scroll or recenter */
+}
+SLscroll_Window_Type;
+
+SL_EXTERN int SLscroll_find_top (SLscroll_Window_Type *);
+SL_EXTERN int SLscroll_find_line_num (SLscroll_Window_Type *);
+SL_EXTERN unsigned int SLscroll_next_n (SLscroll_Window_Type *, unsigned int);
+SL_EXTERN unsigned int SLscroll_prev_n (SLscroll_Window_Type *, unsigned int);
+SL_EXTERN int SLscroll_pageup (SLscroll_Window_Type *);
+SL_EXTERN int SLscroll_pagedown (SLscroll_Window_Type *);
+
+/*}}}*/
+
+/*{{{ Signal Routines */
+
+typedef void SLSig_Fun_Type (int);
+SL_EXTERN SLSig_Fun_Type *SLsignal (int, SLSig_Fun_Type *);
+SL_EXTERN SLSig_Fun_Type *SLsignal_intr (int, SLSig_Fun_Type *);
+SL_EXTERN int SLsig_block_signals (void);
+SL_EXTERN int SLsig_unblock_signals (void);
+SL_EXTERN int SLsystem (SLFUTURE_CONST char *);
+SL_EXTERN int SLsystem_intr (SLFUTURE_CONST char *);
+
+/* Make a signal off-limits to the interpreter */
+SL_EXTERN int SLsig_forbid_signal (int);
+
+SL_EXTERN SLFUTURE_CONST char *SLerrno_strerror (int);
+SL_EXTERN int SLerrno_set_errno (int);
+
+/*}}}*/
+
+/* Functions for dealing with the FPU */
+SL_EXTERN void SLfpu_clear_except_bits (void);
+SL_EXTERN unsigned int SLfpu_test_except_bits (unsigned int bits);
+#define SL_FE_DIVBYZERO		0x01
+#define SL_FE_INVALID		0x02
+#define SL_FE_OVERFLOW		0x04
+#define SL_FE_UNDERFLOW		0x08
+#define SL_FE_INEXACT		0x10
+#define SL_FE_ALLEXCEPT		0x1F
+
+SL_EXTERN SLtype SLang_get_int_type (int nbits);
+/* if nbits is negative it gets the signed int type, else unsigned int type */
+SL_EXTERN int SLang_get_int_size (SLtype);
+/* Opposite of SLang_get_int_type */
+
+/*{{{ Interpreter Macro Definitions */
+
+/* The definitions here are for objects that may be on the run-time stack.
+ * They are actually sub_types of literal and data main_types. The actual
+ * numbers are historical.
+ */
+#define SLANG_UNDEFINED_TYPE	0x00 /* MUST be 0 */
+#define SLANG_VOID_TYPE		0x01 /* also matches ANY type */
+#define SLANG_NULL_TYPE		(0x02)
+#define SLANG_ANY_TYPE		(0x03)
+#define SLANG_DATATYPE_TYPE	(0x04)
+/* SLANG_REF_TYPE refers to an object on the stack that is a pointer (reference)
+ * to some other object.
+ */
+#define SLANG_REF_TYPE		(0x05)
+#define SLANG_STRING_TYPE	(0x06)
+#define SLANG_BSTRING_TYPE	(0x07)
+#define SLANG_FILE_PTR_TYPE	(0x08)
+#define SLANG_FILE_FD_TYPE	(0x09)
+#define SLANG_MD5_TYPE		(0x0A)
+#define SLANG_INTP_TYPE		(0x0F)
+
+/* Integer types */
+/* The integer and floating point types are arranged in order of arithmetic
+ * precedence.
+ */
+#define SLANG_CHAR_TYPE		(0x10)
+#define SLANG_UCHAR_TYPE	(0x11)
+#define SLANG_SHORT_TYPE	(0x12)
+#define SLANG_USHORT_TYPE	(0x13)
+#define SLANG_INT_TYPE 		(0x14)
+#define SLANG_UINT_TYPE		(0x15)
+#define SLANG_LONG_TYPE		(0x16)
+#define SLANG_ULONG_TYPE	(0x17)
+#define SLANG_LLONG_TYPE	(0x18)
+#define SLANG_ULLONG_TYPE	(0x19)
+/* floating point types */
+#define SLANG_FLOAT_TYPE	(0x1A)
+#define SLANG_DOUBLE_TYPE	(0x1B)
+#define SLANG_LDOUBLE_TYPE	(0x1C)
+
+#define SLANG_COMPLEX_TYPE	(0x20)
+
+/* An object of SLANG_INTP_TYPE should never really occur on the stack. Rather,
+ * the integer to which it refers will be there instead. It is defined here
+ * because it is a valid type for MAKE_VARIABLE.
+ */
+
+/* Container types */
+#define SLANG_ISTRUCT_TYPE 	(0x2A)
+#define SLANG_STRUCT_TYPE	(0x2B)
+#define SLANG_ASSOC_TYPE	(0x2C)
+#define SLANG_ARRAY_TYPE	(0x2D)
+#define SLANG_LIST_TYPE		(0x2E)
+
+#define SLANG_MIN_UNUSED_TYPE	(0x30)
+
+/* Compatibility */
+#ifdef FLOAT_TYPE
+# undef FLOAT_TYPE
+#endif
+#define VOID_TYPE SLANG_VOID_TYPE
+#define INT_TYPE SLANG_INT_TYPE
+#define INTP_TYPE SLANG_INTP_TYPE
+#define FLOAT_TYPE SLANG_DOUBLE_TYPE
+#define ARRAY_TYPE SLANG_ARRAY_TYPE
+#define CHAR_TYPE SLANG_CHAR_TYPE
+#define STRING_TYPE SLANG_STRING_TYPE
+
+/* I am reserving values greater than or equal to 128 for user applications.
+ * The first 127 are reserved for S-Lang.
+ */
+
+/* Binary and Unary Subtypes */
+/* Since the application can define new types and can overload the binary
+ * and unary operators, these definitions must be present in this file.
+ * The current implementation assumes both unary and binary are distinct.
+ */
+#define SLANG_BINARY_OP_MIN	0x01
+#define SLANG_PLUS		0x01
+#define SLANG_MINUS		0x02
+#define SLANG_TIMES		0x03
+#define SLANG_DIVIDE		0x04
+#define SLANG_EQ		0x05
+#define SLANG_NE		0x06
+#define SLANG_GT		0x07
+#define SLANG_GE		0x08
+#define SLANG_LT		0x09
+#define SLANG_LE		0x0A
+#define SLANG_POW		0x0B
+#define SLANG_OR		0x0C
+#define SLANG_AND		0x0D
+#define SLANG_BAND		0x0E
+#define SLANG_BOR		0x0F
+#define SLANG_BXOR		0x10
+#define SLANG_SHL		0x11
+#define SLANG_SHR		0x12
+#define SLANG_MOD		0x13
+#define SLANG_BINARY_OP_MAX	0x13
+
+/* UNARY subtypes (may be overloaded) */
+#define SLANG_UNARY_OP_MIN	0x20
+
+#define SLANG_PLUSPLUS		0x20
+#define SLANG_MINUSMINUS	0x21
+#define SLANG_CHS		0x22
+#define SLANG_NOT		0x23
+#define SLANG_BNOT		0x24
+/* These are implemented as unary function calls */
+#define SLANG_ABS		0x25
+#define SLANG_SIGN		0x26
+#define SLANG_SQR		0x27
+#define SLANG_MUL2		0x28
+#define SLANG_ISPOS		0x29
+#define SLANG_ISNEG		0x2A
+#define SLANG_ISNONNEG		0x2B
+
+#define SLANG_UNARY_OP_MAX	0x2B
+
+/* SL_EXTERN SLFUTURE_CONST char *SLang_Error_Message; */
+
+SL_EXTERN int SLadd_intrinsic_variable (SLFUTURE_CONST char *, VOID_STAR, SLtype, int);
+SL_EXTERN int SLadd_intrinsic_function (SLFUTURE_CONST char *, FVOID_STAR, SLtype, unsigned int,...);
+
+SL_EXTERN int SLns_add_intrinsic_variable (SLang_NameSpace_Type *, SLFUTURE_CONST char *, VOID_STAR, SLtype, int);
+SL_EXTERN int SLns_add_intrinsic_function (SLang_NameSpace_Type *, SLFUTURE_CONST char *, FVOID_STAR, SLtype, unsigned int,...);
+
+/* These functions are used to patch intrinsic tables that make use of
+ * dynamically allocated types whose type id is determined at
+ * run-time. The second version is useful for the most common case of a
+ * single mapping.
+ */
+SL_EXTERN int SLclass_patch_intrin_fun_table (SLang_Intrin_Fun_Type *table,
+					 SLtype *from_types, SLtype *to_types, unsigned int num);
+SL_EXTERN int SLclass_patch_intrin_fun_table1 (SLang_Intrin_Fun_Type *table,
+					 SLtype from_type, SLtype to_type);
+
+#define MAKE_INTRINSIC_N(n,f,out,in,a1,a2,a3,a4,a5,a6,a7) \
+ {(n), NULL, SLANG_INTRINSIC, (FVOID_STAR) (f), \
+ {a1,a2,a3,a4,a5,a6,a7}, (in), (out)}
+
+#define MAKE_INTRINSIC_7(n,f,out,a1,a2,a3,a4,a5,a6,a7) \
+ MAKE_INTRINSIC_N(n,f,out,7,a1,a2,a3,a4,a5,a6,a7)
+#define MAKE_INTRINSIC_6(n,f,out,a1,a2,a3,a4,a5,a6) \
+ MAKE_INTRINSIC_N(n,f,out,6,a1,a2,a3,a4,a5,a6,0)
+#define MAKE_INTRINSIC_5(n,f,out,a1,a2,a3,a4,a5) \
+ MAKE_INTRINSIC_N(n,f,out,5,a1,a2,a3,a4,a5,0,0)
+#define MAKE_INTRINSIC_4(n,f,out,a1,a2,a3,a4) \
+ MAKE_INTRINSIC_N(n,f,out,4,a1,a2,a3,a4,0,0,0)
+#define MAKE_INTRINSIC_3(n,f,out,a1,a2,a3) \
+ MAKE_INTRINSIC_N(n,f,out,3,a1,a2,a3,0,0,0,0)
+#define MAKE_INTRINSIC_2(n,f,out,a1,a2) \
+ MAKE_INTRINSIC_N(n,f,out,2,a1,a2,0,0,0,0,0)
+#define MAKE_INTRINSIC_1(n,f,out,a1) \
+ MAKE_INTRINSIC_N(n,f,out,1,a1,0,0,0,0,0,0)
+#define MAKE_INTRINSIC_0(n,f,out) \
+ MAKE_INTRINSIC_N(n,f,out,0,0,0,0,0,0,0,0)
+
+#define MAKE_INTRINSIC_S(n,f,r) \
+ MAKE_INTRINSIC_1(n,f,r,SLANG_STRING_TYPE)
+#define MAKE_INTRINSIC_I(n,f,r) \
+ MAKE_INTRINSIC_1(n,f,r,SLANG_INT_TYPE)
+
+#define MAKE_INTRINSIC_SS(n,f,r) \
+ MAKE_INTRINSIC_2(n,f,r,SLANG_STRING_TYPE,SLANG_STRING_TYPE)
+#define MAKE_INTRINSIC_SI(n,f,r) \
+ MAKE_INTRINSIC_2(n,f,r,SLANG_STRING_TYPE,SLANG_INT_TYPE)
+#define MAKE_INTRINSIC_IS(n,f,r) \
+ MAKE_INTRINSIC_2(n,f,r,SLANG_INT_TYPE,SLANG_STRING_TYPE)
+#define MAKE_INTRINSIC_II(n,f,r) \
+ MAKE_INTRINSIC_2(n,f,r,SLANG_INT_TYPE,SLANG_INT_TYPE)
+
+#define MAKE_INTRINSIC_SSS(n,f,r) \
+ MAKE_INTRINSIC_3(n,f,r,SLANG_STRING_TYPE,SLANG_STRING_TYPE,SLANG_STRING_TYPE)
+#define MAKE_INTRINSIC_SSI(n,f,r) \
+ MAKE_INTRINSIC_3(n,f,r,SLANG_STRING_TYPE,SLANG_STRING_TYPE,SLANG_INT_TYPE)
+#define MAKE_INTRINSIC_SIS(n,f,r) \
+ MAKE_INTRINSIC_3(n,f,r,SLANG_STRING_TYPE,SLANG_INT_TYPE,SLANG_STRING_TYPE)
+#define MAKE_INTRINSIC_SII(n,f,r) \
+ MAKE_INTRINSIC_3(n,f,r,SLANG_STRING_TYPE,SLANG_INT_TYPE,SLANG_INT_TYPE)
+#define MAKE_INTRINSIC_ISS(n,f,r) \
+ MAKE_INTRINSIC_3(n,f,r,SLANG_INT_TYPE,SLANG_STRING_TYPE,SLANG_STRING_TYPE)
+#define MAKE_INTRINSIC_ISI(n,f,r) \
+ MAKE_INTRINSIC_3(n,f,r,SLANG_INT_TYPE,SLANG_STRING_TYPE,SLANG_INT_TYPE)
+#define MAKE_INTRINSIC_IIS(n,f,r) \
+ MAKE_INTRINSIC_3(n,f,r,SLANG_INT_TYPE,SLANG_INT_TYPE,SLANG_STRING_TYPE)
+#define MAKE_INTRINSIC_III(n,f,r) \
+ MAKE_INTRINSIC_3(n,f,r,SLANG_INT_TYPE,SLANG_INT_TYPE,SLANG_INT_TYPE)
+
+#define MAKE_INTRINSIC(n, f, out, in) \
+ MAKE_INTRINSIC_N(n,f,out,in,0,0,0,0,0,0,0)
+
+#define MAKE_VARIABLE(n, v, t, r) \
+ {n, NULL, SLANG_IVARIABLE + (r), (VOID_STAR)(v), (t)}
+
+#define MAKE_APP_UNARY(n,op) \
+ {(n), NULL, SLANG_APP_UNARY, (op)}
+
+#define MAKE_ARITH_UNARY(n,op) \
+ {(n), NULL, SLANG_ARITH_UNARY, (op)}
+
+#define MAKE_ARITH_BINARY(n,op) \
+ {(n), NULL, SLANG_ARITH_BINARY, (op)}
+
+#define MAKE_MATH_UNARY(n,op) \
+ {(n), NULL, SLANG_MATH_UNARY, (op)}
+
+#define MAKE_HCONSTANT_T(n,val,T) \
+ {(n),NULL, SLANG_HCONSTANT, T, (short)(val)}
+#define MAKE_HCONSTANT(n,val) MAKE_HCONSTANT_T(n,val,SLANG_SHORT_TYPE)
+
+#define MAKE_ICONSTANT_T(n,val,T) \
+ {(n),NULL, SLANG_ICONSTANT, T, (int)(val)}
+#define MAKE_ICONSTANT(n,val) MAKE_ICONSTANT_T(n,val,SLANG_INT_TYPE)
+
+#define MAKE_LCONSTANT_T(n,val,T) \
+ {(n),NULL, SLANG_LCONSTANT, T, (long)(val)}
+#define MAKE_LCONSTANT(n,val) MAKE_LCONSTANT_T(n,val,SLANG_LONG_TYPE)
+
+#ifdef HAVE_LONG_LONG
+# define MAKE_LLCONSTANT_T(n,val,T) \
+ {(n),NULL, T, (long long)(val)}
+# define MAKE_LLCONSTANT(n,val) MAKE_LLCONSTANT_T(n,val,SLANG_LLONG_TYPE)
+#endif
+
+#define MAKE_FCONSTANT(n,val) \
+ {(n),NULL, SLANG_FCONSTANT, (val)}
+
+#define MAKE_DCONSTANT(n,val) \
+ {(n),NULL, SLANG_DCONSTANT, (val)}
+
+#ifndef offsetof
+# define offsetof(T,F) ((unsigned int)((char *)&((T *)0L)->F - (char *)0L))
+#endif
+
+#define MAKE_ISTRUCT_FIELD(s,f,n,t,r) {(n), offsetof(s,f), (t), (r)}
+#define MAKE_CSTRUCT_FIELD(s,f,n,t,r) {(n), offsetof(s,f), (t), (r)}
+
+#define MAKE_CSTRUCT_INT_FIELD(s,f,n,r) {(n), offsetof(s,f),\
+ (sizeof(((s*)0L)->f)==sizeof(int))?(SLANG_INT_TYPE): \
+ (sizeof(((s*)0L)->f)==sizeof(short))?(SLANG_SHORT_TYPE): \
+ (sizeof(((s*)0L)->f)==sizeof(char))?(SLANG_CHAR_TYPE): \
+ (sizeof(((s*)0L)->f)==sizeof(long))?(SLANG_LONG_TYPE): \
+ SLANG_LLONG_TYPE, (r)\
+}
+#define MAKE_CSTRUCT_UINT_FIELD(s,f,n,r) {(n), offsetof(s,f),\
+ (sizeof(((s*)0L)->f)==sizeof(int))?(SLANG_UINT_TYPE): \
+ (sizeof(((s*)0L)->f)==sizeof(short))?(SLANG_USHORT_TYPE): \
+ (sizeof(((s*)0L)->f)==sizeof(char))?(SLANG_UCHAR_TYPE): \
+ (sizeof(((s*)0L)->f)==sizeof(long))?(SLANG_ULONG_TYPE): \
+ SLANG_ULLONG_TYPE, (r)\
+}
+
+#define MAKE_CSTRUCT_FLOAT_FIELD(s,f,n,r) {(n), offsetof(s,f),\
+ (sizeof(((s*)0L)->f)==sizeof(float))?(SLANG_FLOAT_TYPE): \
+ SLANG_DOUBLE_TYPE, (r)\
+}
+
+#define SLANG_END_TABLE {NULL}
+#define SLANG_END_INTRIN_FUN_TABLE MAKE_INTRINSIC_0(NULL,NULL,0)
+#define SLANG_END_FCONST_TABLE MAKE_DCONSTANT(NULL,0)
+#define SLANG_END_DCONST_TABLE MAKE_DCONSTANT(NULL,0)
+#define SLANG_END_MATH_UNARY_TABLE MAKE_MATH_UNARY(NULL,0)
+#define SLANG_END_ARITH_UNARY_TABLE MAKE_ARITH_UNARY(NULL,0)
+#define SLANG_END_ARITH_BINARY_TABLE MAKE_ARITH_BINARY(NULL,0)
+#define SLANG_END_APP_UNARY_TABLE MAKE_APP_UNARY(NULL,0)
+#define SLANG_END_INTRIN_VAR_TABLE MAKE_VARIABLE(NULL,NULL,0,0)
+#define SLANG_END_ICONST_TABLE MAKE_ICONSTANT(NULL,0)
+#define SLANG_END_LCONST_TABLE MAKE_LCONSTANT(NULL,0)
+#define SLANG_END_LLCONST_TABLE MAKE_LLCONSTANT(NULL,0)
+#define SLANG_END_ISTRUCT_TABLE {NULL, 0, 0, 0}
+#define SLANG_END_CSTRUCT_TABLE {NULL, 0, 0, 0}
+
+/*}}}*/
+
+/*{{{ Upper/Lowercase Functions */
+
+SL_EXTERN void SLang_define_case(int *, int *);
+SL_EXTERN void SLang_init_case_tables (void);
+
+SL_EXTERN unsigned char _pSLChg_UCase_Lut256;
+SL_EXTERN unsigned char _pSLChg_LCase_Lut256;
+#define UPPER_CASE(x) (_pSLChg_UCase_Lut(unsigned char) (x))
+#define LOWER_CASE(x) (_pSLChg_LCase_Lut(unsigned char) (x))
+#define CHANGE_CASE(x) (((x) == _pSLChg_LCase_Lut(unsigned char) (x)) ?\
+			_pSLChg_UCase_Lut(unsigned char) (x) : _pSLChg_LCase_Lut(unsigned char) (x))
+
+/*}}}*/
+
+/*{{{ Regular Expression Interface */
+typedef struct _pSLRegexp_Type SLRegexp_Type;
+SL_EXTERN SLRegexp_Type *SLregexp_compile (SLFUTURE_CONST char *pattern, unsigned int flags);
+#define SLREGEXP_CASELESS	0x01
+#define SLREGEXP_UTF8		0x10
+
+SL_EXTERN void SLregexp_free (SLRegexp_Type *);
+SL_EXTERN char *SLregexp_match (SLRegexp_Type *compiled_regexp, SLFUTURE_CONST char *str, SLstrlen_Type len);
+SL_EXTERN int SLregexp_nth_match (SLRegexp_Type *, unsigned int nth, SLstrlen_Type *ofsp, SLstrlen_Type *lenp);
+
+SL_EXTERN int SLregexp_get_hints (SLRegexp_Type *, unsigned int *flagsp);
+#define SLREGEXP_HINT_BOL		0x01 /* pattern must match bol */
+#define SLREGEXP_HINT_OSEARCH		0x02 /* ordinary search will do */
+
+SL_EXTERN char *SLregexp_quote_string (SLFUTURE_CONST char *pattern, char *buf, unsigned int buflen);
+
+/*}}}*/
+
+/*{{{ SLang Command Interface */
+
+struct _pSLcmd_Cmd_Type; /* Pre-declaration is needed below */
+typedef struct
+{
+ struct _pSLcmd_Cmd_Type *table;
+ int argc;
+ /* Version 2.0 needs to use a union!! */
+ SLFUTURE_CONST char **string_args;
+ int *int_args;
+ double *double_args;
+ SLtype *arg_type;
+ unsigned long reserved4;
+} SLcmd_Cmd_Table_Type;
+
+typedef struct _pSLcmd_Cmd_Type
+{
+ int (*cmdfun)(int, SLcmd_Cmd_Table_Type *);
+ SLFUTURE_CONST char *cmd;
+ SLFUTURE_CONST char *arg_type;
+} SLcmd_Cmd_Type;
+
+SL_EXTERN int SLcmd_execute_string (SLFUTURE_CONST char *, SLcmd_Cmd_Table_Type *);
+
+/*}}}*/
+
+/*{{{ SLang Search Interface */
+
+typedef struct _pSLsearch_Type SLsearch_Type;
+SL_EXTERN SLsearch_Type *SLsearch_new (SLuchar_Type *u, int search_flags);
+#define SLSEARCH_CASELESS	0x1
+#define SLSEARCH_UTF8		0x2
+
+SL_EXTERN void SLsearch_delete (SLsearch_Type *);
+
+SL_EXTERN SLuchar_Type *SLsearch_forward (SLsearch_Type *st,
+ SLuchar_Type *pmin, SLuchar_Type *pmax);
+SL_EXTERN SLuchar_Type *SLsearch_backward (SLsearch_Type *st,
+ SLuchar_Type *pmin, SLuchar_Type *pstart, SLuchar_Type *pmax);
+SL_EXTERN SLstrlen_Type SLsearch_match_len (SLsearch_Type *);
+
+/*}}}*/
+
+/*{{{ SLang Pathname Interface */
+
+/* These function return pointers to the original space */
+SL_EXTERN char *SLpath_basename (SLFUTURE_CONST char *);
+SL_EXTERN char *SLpath_extname (SLFUTURE_CONST char *);
+
+SL_EXTERN int SLpath_is_absolute_path (SLFUTURE_CONST char *);
+
+/* Get and set the character delimiter for search paths */
+SL_EXTERN int SLpath_get_delimiter (void);
+SL_EXTERN int SLpath_set_delimiter (int);
+
+/* search path for loading .sl files */
+SL_EXTERN int SLpath_set_load_path (SLFUTURE_CONST char *);
+/* search path for loading .sl files --- returns slstring */
+SL_EXTERN char *SLpath_get_load_path (void);
+
+/* These return malloced strings--- NOT slstrings */
+SL_EXTERN char *SLpath_dircat (SLFUTURE_CONST char *, SLFUTURE_CONST char *);
+SL_EXTERN char *SLpath_find_file_in_path (SLFUTURE_CONST char *, SLFUTURE_CONST char *);
+SL_EXTERN char *SLpath_dirname (SLFUTURE_CONST char *);
+SL_EXTERN int SLpath_file_exists (SLFUTURE_CONST char *);
+SL_EXTERN char *SLpath_pathname_sans_extname (SLFUTURE_CONST char *);
+SL_EXTERN char *SLpath_getcwd (void); /* return NULL on error, sets errno */
+
+/*}}}*/
+
+SL_EXTERN int SLang_set_module_load_path (SLFUTURE_CONST char *);
+
+#ifdef __cplusplus
+# define SLANG_MODULE(name) \
+ extern SL_EXPORT "C" int init_##name##_module_ns (char *); \
+ extern SL_EXPORT "C" void deinit_##name##_module (void); \
+ extern SL_EXPORT "C" int SLmodule_##name##_api_version; \
+ SL_EXPORT int SLmodule_##name##_api_version = SLANG_VERSION
+#else
+# define SLANG_MODULE(name) \
+ extern SL_EXPORT int init_##name##_module_ns (char *); \
+ extern SL_EXPORT void deinit_##name##_module (void); \
+ SL_EXPORT int SLmodule_##name##_api_version = SLANG_VERSION
+#endif
+
+SL_EXTERN int SLvsnprintf (char *, unsigned int, SLFUTURE_CONST char *, va_list);
+SL_EXTERN int SLsnprintf (char *, unsigned int, SLFUTURE_CONST char *, ...) SLATTRIBUTE_PRINTF(3,4);
+
+#if 0
+{
+#endif
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* DAVIS_SLANG_H_ */

_service:tar_scm:slang-2.3.2.tar.bz2/src/slang.ver Added

@@ -0,0 +1,739 @@
+SLANG2 {
+	global:
+		SLKeyBoard_Quit;
+		SLKeyMap_List_Root;
+		SL_Any_Error;
+		SL_Application_Error;
+		SL_ArithOverflow_Error;
+		SL_ArithUnderflow_Error;
+		SL_Data_Error;
+		SL_DivideByZero_Error;
+		SL_Domain_Error;
+		SL_DuplicateDefinition_Error;
+		SL_Forbidden_Error;
+		SL_IO_Error;
+		SL_Import_Error;
+		SL_Index_Error;
+		SL_Internal_Error;
+		SL_InvalidParm_Error;
+		SL_InvalidUTF8_Error;
+		SL_LimitExceeded_Error;
+		SL_Malloc_Error;
+		SL_Math_Error;
+		SL_Namespace_Error;
+		SL_NotImplemented_Error;
+		SL_NumArgs_Error;
+		SL_OS_Error;
+		SL_Open_Error;
+		SL_Parse_Error;
+		SL_ReadOnly_Error;
+		SL_Read_Error;
+		SL_RunTime_Error;
+		SL_StackOverflow_Error;
+		SL_StackUnderflow_Error;
+		SL_Stack_Error;
+		SL_Syntax_Error;
+		SL_TypeMismatch_Error;
+		SL_UndefinedName_Error;
+		SL_Unicode_Error;
+		SL_Unknown_Error;
+		SL_Usage_Error;
+		SL_UserBreak_Error;
+		SL_VariableUninitialized_Error;
+		SL_Write_Error;
+		SLadd_app_unary_table;
+		SLadd_dconstant_table;
+		SLadd_fconstant_table;
+		SLadd_global_variable;
+		SLadd_iconstant_table;
+		SLadd_intrin_fun_table;
+		SLadd_intrin_var_table;
+		SLadd_intrinsic_function;
+		SLadd_intrinsic_variable;
+		SLadd_istruct_table;
+		SLadd_llconstant_table;
+		SLadd_math_unary_table;
+		SLallocate_load_type;
+		SLang_Abort_Char;
+		SLang_Auto_Declare_Var_Hook;
+		SLang_Doc_Dir;
+		SLang_Dump_Routine;
+		SLang_Enter_Function;
+		SLang_Error_Hook;
+		SLang_Exit_Error_Hook;
+		SLang_Exit_Function;
+		SLang_Ignore_User_Abort;
+		SLang_Input_Buffer;
+		SLang_Input_Buffer_Len;
+		SLang_Interrupt;
+		SLang_Key_TimeOut_Flag;
+		SLang_Last_Key_Char;
+		SLang_Load_File_Hook;
+		SLang_Num_Function_Args;
+		SLang_Rline_Quit;
+		SLang_TT_Baud_Rate;
+		SLang_TT_Read_FD;
+		SLang_TT_Write_FD;
+		SLang_Traceback;
+		SLang_User_Clear_Error;
+		SLang_User_Prompt;
+		SLang_VMessage_Hook;
+		SLang_Version;
+		SLang_Version_String;
+		SLang_add_cleanup_function;
+		SLang_add_interrupt_hook;
+		SLang_add_intrinsic_array;
+		SLang_assign_cstruct_to_ref;
+		SLang_assign_nametype_to_ref;
+		SLang_assign_to_ref;
+		SLang_autoload;
+		SLang_buffer_keystring;
+		SLang_byte_compile_file;
+		SLang_concat_slstrings;
+		SLang_copy_function;
+		SLang_create_array;
+		SLang_create_array1;
+		SLang_create_keymap;
+		SLang_create_mmt;
+		SLang_create_nslstring;
+		SLang_create_slstring;
+		SLang_define_case;
+		SLang_define_key;
+		SLang_do_key;
+		SLang_duplicate_array;
+		SLang_end_arg_list;
+		SLang_execute_function;
+		SLang_exit_error;
+		SLang_find_key_function;
+		SLang_find_keymap;
+		SLang_flush_input;
+		SLang_free_anytype;
+		SLang_free_array;
+		SLang_free_cstruct;
+		SLang_free_function;
+		SLang_free_mmt;
+		SLang_free_object;
+		SLang_free_ref;
+		SLang_free_slstring;
+		SLang_free_struct;
+		SLang_free_value;
+		SLang_generate_debug_info;
+		SLang_get_array_element;
+		SLang_get_error;
+		SLang_get_fileptr;
+		SLang_get_fun_from_ref;
+		SLang_get_function;
+		SLang_get_int_size;
+		SLang_get_int_type;
+		SLang_get_name_from_fileptr;
+		SLang_getkey;
+		SLang_getkey_intr_hook;
+		SLang_guess_type;
+		SLang_handle_interrupt;
+		SLang_inc_mmt;
+		SLang_init_all;
+		SLang_init_array;
+		SLang_init_array_extra;
+		SLang_init_case_tables;
+		SLang_init_import;
+		SLang_init_ospath;
+		SLang_init_posix_dir;
+		SLang_init_posix_io;
+		SLang_init_posix_process;
+		SLang_init_signal;
+		SLang_init_slang;
+		SLang_init_slassoc;
+		SLang_init_slfile;
+		SLang_init_slmath;
+		SLang_init_slunix;
+		SLang_init_stdio;
+		SLang_init_tty;
+		SLang_input_pending;
+		SLang_is_defined;
+		SLang_load_file;
+		SLang_load_file_verbose;
+		SLang_load_object;
+		SLang_load_string;
+		SLang_make_keystring;
+		SLang_object_from_mmt;
+		SLang_peek_at_stack;
+		SLang_peek_at_stack1;
+		SLang_peek_at_stack1_n;
+		SLang_peek_at_stack_n;
+		SLang_pop;
+		SLang_pop_anytype;
+		SLang_pop_array;
+		SLang_pop_array_of_type;
+		SLang_pop_bstring;
+		SLang_pop_char;
+		SLang_pop_complex;
+		SLang_pop_cstruct;
+		SLang_pop_datatype;
+		SLang_pop_double;
+		SLang_pop_fileptr;
+		SLang_pop_float;
+		SLang_pop_function;
+		SLang_pop_int;
+		SLang_pop_long;
+		SLang_pop_long_long;
+		SLang_pop_mmt;
+		SLang_pop_null;
+		SLang_pop_ref;
+		SLang_pop_short;
+		SLang_pop_slstring;
+		SLang_pop_struct;
+		SLang_pop_uchar;
+		SLang_pop_uint;
+		SLang_pop_ulong;
+		SLang_pop_ulong_long;
+		SLang_pop_ushort;
+		SLang_pop_value;
+		SLang_process_keystring;
+		SLang_push;
+		SLang_push_anytype;
+		SLang_push_array;
+		SLang_push_bstring;
+		SLang_push_char;
+		SLang_push_complex;
+		SLang_push_cstruct;
+		SLang_push_datatype;
+		SLang_push_double;
+		SLang_push_float;
+		SLang_push_function;
+		SLang_push_int;
+		SLang_push_long;
+		SLang_push_long_long;
+		SLang_push_malloced_string;
+		SLang_push_mmt;
+		SLang_push_null;
+		SLang_push_short;
+		SLang_push_string;
+		SLang_push_struct;
+		SLang_push_uchar;
+		SLang_push_uint;
+		SLang_push_ulong;
+		SLang_push_ulong_long;
+		SLang_push_ushort;
+		SLang_push_value;
+		SLang_remove_interrupt_hook;
+		SLang_reset_tty;
+		SLang_restart;
+		SLang_run_hooks;
+		SLang_set_abort_signal;
+		SLang_set_argc_argv;
+		SLang_set_array_element;
+		SLang_set_error;
+		SLang_set_module_load_path;
+		SLang_start_arg_list;
+		SLang_undefine_key;
+		SLang_ungetkey;
+		SLang_ungetkey_string;
+		SLang_verror;
+		SLang_vmessage;
+		SLarith_get_to_double_fun;
+		SLarray_contract_array;
+		SLarray_map_array;
+		SLarray_map_array_1;
+		SLatoi;
+		SLatol;
+		SLatoll;
+		SLatoul;
+		SLatoull;
+		SLbstring_create;
+		SLbstring_create_malloced;
+		SLbstring_create_slstring;
+		SLbstring_dup;
+		SLbstring_free;
+		SLbstring_get_pointer;
+		SLcalloc;
+		SLclass_add_app_unary_op;
+		SLclass_add_binary_op;
+		SLclass_add_math_op;
+		SLclass_add_typecast;
+		SLclass_add_unary_op;
+		SLclass_allocate_class;
+		SLclass_create_synonym;
+		SLclass_dup_object;
+		SLclass_get_class_id;
+		SLclass_get_datatype_name;
+		SLclass_is_class_defined;
+		SLclass_pop_char_obj;
+		SLclass_pop_double_obj;
+		SLclass_pop_float_obj;
+		SLclass_pop_int_obj;
+		SLclass_pop_long_obj;
+		SLclass_pop_ptr_obj;
+		SLclass_pop_short_obj;
+		SLclass_push_char_obj;
+		SLclass_push_double_obj;
+		SLclass_push_float_obj;
+		SLclass_push_int_obj;
+		SLclass_push_llong_obj;
+		SLclass_push_long_obj;
+		SLclass_push_ptr_obj;
+		SLclass_push_short_obj;
+		SLclass_register_class;
+		SLclass_set_acopy_function;
+		SLclass_set_aget_function;
+		SLclass_set_anew_function;
+		SLclass_set_apush_function;
+		SLclass_set_aput_function;
+		SLclass_set_deref_function;
+		SLclass_set_destroy_function;
+		SLclass_set_eqs_function;
+		SLclass_set_foreach_functions;
+		SLclass_set_is_container;
+		SLclass_set_length_function;
+		SLclass_set_pop_function;
+		SLclass_set_push_function;
+		SLclass_set_sget_function;
+		SLclass_set_sput_function;
+		SLclass_set_string_function;
+		SLclass_typecast;
+		SLcmd_execute_string;
+		SLcomplex_abs;
+		SLcomplex_acos;
+		SLcomplex_acosh;
+		SLcomplex_asin;
+		SLcomplex_asinh;
+		SLcomplex_atan;
+		SLcomplex_atanh;
+		SLcomplex_cos;
+		SLcomplex_cosh;
+		SLcomplex_divide;
+		SLcomplex_exp;
+		SLcomplex_log;
+		SLcomplex_log10;
+		SLcomplex_pow;
+		SLcomplex_sin;
+		SLcomplex_sinh;
+		SLcomplex_sqrt;
+		SLcomplex_tan;
+		SLcomplex_tanh;
+		SLcomplex_times;
+		SLcurrent_time_string;
+		SLcurses_Acs_Map;
+		SLcurses_Esc_Delay;
+		SLcurses_Is_Endwin;
+		SLcurses_Num_Colors;
+		SLcurses_Stdscr;
+		SLcurses_cbreak;
+		SLcurses_clearok;
+		SLcurses_delwin;
+		SLcurses_endwin;
+		SLcurses_getch;
+		SLcurses_has_colors;
+		SLcurses_initscr;
+		SLcurses_mvprintw;
+		SLcurses_mvwprintw;
+		SLcurses_newwin;
+		SLcurses_nil;
+		SLcurses_nodelay;
+		SLcurses_printw;
+		SLcurses_raw;
+		SLcurses_start_color;
+		SLcurses_subwin;
+		SLcurses_waddch;
+		SLcurses_waddnstr;
+		SLcurses_wattroff;
+		SLcurses_wattron;
+		SLcurses_wattrset;
+		SLcurses_wclear;
+		SLcurses_wclrtobot;
+		SLcurses_wclrtoeol;
+		SLcurses_wdelch;
+		SLcurses_wgetch;
+		SLcurses_winsch;
+		SLcurses_wmove;
+		SLcurses_wnoutrefresh;
+		SLcurses_wprintw;
+		SLcurses_wrefresh;
+		SLcurses_wscrl;
+		SLdeallocate_load_type;
+		SLdebug_calloc;
+		SLdebug_free;
+		SLdebug_malloc;
+		SLdebug_realloc;
+		SLdefine_for_ifdef;
+		SLdo_pop;
+		SLdo_pop_n;
+		SLdup_n;
+		SLerr_exception_eqs;
+		SLerr_new_exception;
+		SLerr_strerror;
+		SLerrno_set_errno;
+		SLerrno_strerror;
+		SLexecute_function;
+		SLexpand_escaped_string;
+		SLextract_list_element;
+		SLfile_create_clientdata_id;
+		SLfile_create_fd;
+		SLfile_dup_fd;
+		SLfile_free_fd;
+		SLfile_get_clientdata;
+		SLfile_get_fd;
+		SLfile_pop_fd;
+		SLfile_push_fd;
+		SLfile_set_clientdata;
+		SLfile_set_close_method;
+		SLfile_set_dup_method;
+		SLfile_set_getfd_method;
+		SLfile_set_read_method;
+		SLfile_set_write_method;
+		SLfpu_clear_except_bits;
+		SLfpu_test_except_bits;
+		SLfree;
+		SLinterp_is_utf8_mode;
+		SLinterp_utf8_enable;
+		SLkm_define_key;
+		SLkm_define_keysym;
+		SLkm_define_slkey;
+		SLkm_set_free_method;
+		SLkp_define_keysym;
+		SLkp_getkey;
+		SLkp_init;
+		SLkp_set_getkey_function;
+		SLmake_lut;
+		SLmake_nstring;
+		SLmake_string;
+		SLmalloc;
+		SLmalloc_dump_statistics;
+		SLmath_hypot;
+		SLmemchr;
+		SLmemcmp;
+		SLmemcpy;
+		SLmemset;
+		SLns_Load_File_Hook;
+		SLns_add_app_unary_table;
+		SLns_add_dconstant;
+		SLns_add_dconstant_table;
+		SLns_add_fconstant;
+		SLns_add_hconstant;
+		SLns_add_hconstant_table;
+		SLns_add_iconstant;
+		SLns_add_iconstant_table;
+		SLns_add_intrin_fun_table;
+		SLns_add_intrin_var_table;
+		SLns_add_intrinsic_function;
+		SLns_add_intrinsic_variable;
+		SLns_add_istruct_table;
+		SLns_add_lconstant;
+		SLns_add_lconstant_table;
+		SLns_add_llconstant;
+		SLns_add_math_unary_table;
+		SLns_allocate_load_type;
+		SLns_create_namespace;
+		SLns_delete_namespace;
+		SLns_load_file;
+		SLns_load_string;
+		SLpath_basename;
+		SLpath_dircat;
+		SLpath_dirname;
+		SLpath_extname;
+		SLpath_file_exists;
+		SLpath_find_file_in_path;
+		SLpath_get_delimiter;
+		SLpath_get_load_path;
+		SLpath_is_absolute_path;
+		SLpath_pathname_sans_extname;
+		SLpath_set_delimiter;
+		SLpath_set_load_path;
+		SLpop_string;
+		SLprep_delete;
+		SLprep_exists_hook;
+		SLprep_line_ok;
+		SLprep_new;
+		SLprep_set_comment;
+		SLprep_set_eval_hook;
+		SLprep_set_exists_hook;
+		SLprep_set_flags;
+		SLprep_set_prefix;
+		SLrealloc;
+		SLregexp_compile;
+		SLregexp_free;
+		SLregexp_get_hints;
+		SLregexp_match;
+		SLregexp_nth_match;
+		SLregexp_quote_string;
+		SLreverse_stack;
+		SLrline_add_to_history;
+		SLrline_close;
+		SLrline_del;
+		SLrline_get_echo;
+		SLrline_get_hscroll;
+		SLrline_get_keymap;
+		SLrline_get_line;
+		SLrline_get_point;
+		SLrline_get_tab;
+		SLrline_ins;
+		SLrline_open;
+		SLrline_read_line;
+		SLrline_redraw;
+		SLrline_save_line;
+		SLrline_set_display_width;
+		SLrline_set_echo;
+		SLrline_set_hscroll;
+		SLrline_set_line;
+		SLrline_set_point;
+		SLrline_set_tab;
+		SLrline_set_update_hook;
+		SLroll_stack;
+		SLscroll_find_line_num;
+		SLscroll_find_top;
+		SLscroll_next_n;
+		SLscroll_pagedown;
+		SLscroll_pageup;
+		SLscroll_prev_n;
+		SLsearch_backward;
+		SLsearch_delete;
+		SLsearch_forward;
+		SLsearch_match_len;
+		SLsearch_new;
+		SLsig_block_signals;
+		SLsig_forbid_signal;
+		SLsig_unblock_signals;
+		SLsignal;
+		SLsignal_intr;
+		SLsmg_Backspace_Moves;
+		SLsmg_Display_Eight_Bit;
+		SLsmg_Newline_Behavior;
+		SLsmg_Scroll_Hash_Border;
+		SLsmg_Tab_Width;
+		SLsmg_char_at;
+		SLsmg_cls;
+		SLsmg_draw_box;
+		SLsmg_draw_hline;
+		SLsmg_draw_object;
+		SLsmg_draw_vline;
+		SLsmg_embedded_escape_mode;
+		SLsmg_erase_eol;
+		SLsmg_erase_eos;
+		SLsmg_fill_region;
+		SLsmg_forward;
+		SLsmg_get_column;
+		SLsmg_get_row;
+		SLsmg_gotorc;
+		SLsmg_init_smg;
+		SLsmg_is_utf8_mode;
+		SLsmg_normal_video;
+		SLsmg_printf;
+		SLsmg_read_raw;
+		SLsmg_refresh;
+		SLsmg_reinit_smg;
+		SLsmg_reset_smg;
+		SLsmg_resume_smg;
+		SLsmg_reverse_video;
+		SLsmg_set_char_set;
+		SLsmg_set_color;
+		SLsmg_set_color_in_region;
+		SLsmg_set_screen_start;
+		SLsmg_set_terminal_info;
+		SLsmg_strbytes;
+		SLsmg_strwidth;
+		SLsmg_suspend_smg;
+		SLsmg_touch_lines;
+		SLsmg_touch_screen;
+		SLsmg_utf8_enable;
+		SLsmg_vprintf;
+		SLsmg_write_char;
+		SLsmg_write_chars;
+		SLsmg_write_color_chars;
+		SLsmg_write_nchars;
+		SLsmg_write_nstring;
+		SLsmg_write_raw;
+		SLsmg_write_string;
+		SLsmg_write_wrapped_string;
+		SLsnprintf;
+		SLstack_depth;
+		SLstrcmp;
+		SLstrcpy;
+		SLstrncpy;
+		SLstruct_create_struct;
+		SLsystem;
+		SLtt_Baud_Rate;
+		SLtt_Blink_Mode;
+		SLtt_Force_Keypad_Init;
+		SLtt_Graphics_Char_Pairs;
+		SLtt_Has_Alt_Charset;
+		SLtt_Has_Status_Line;
+		SLtt_Ignore_Beep;
+		SLtt_Newline_Ok;
+		SLtt_Num_Chars_Output;
+		SLtt_Screen_Cols;
+		SLtt_Screen_Rows;
+		SLtt_Term_Cannot_Insert;
+		SLtt_Term_Cannot_Scroll;
+		SLtt_Try_Termcap;
+		SLtt_Use_Ansi_Colors;
+		SLtt_Use_Blink_For_ACS;
+		SLtt_add_color_attribute;
+		SLtt_beep;
+		SLtt_begin_insert;
+		SLtt_bold_video;
+		SLtt_cls;
+		SLtt_del_eol;
+		SLtt_delete_char;
+		SLtt_delete_nlines;
+		SLtt_disable_status_line;
+		SLtt_enable_cursor_keys;
+		SLtt_end_insert;
+		SLtt_erase_line;
+		SLtt_flush_output;
+		SLtt_get_color_object;
+		SLtt_get_screen_size;
+		SLtt_get_terminfo;
+		SLtt_goto_rc;
+		SLtt_init_video;
+		SLtt_initialize;
+		SLtt_is_utf8_mode;
+		SLtt_narrow_width;
+		SLtt_normal_video;
+		SLtt_putchar;
+		SLtt_reset_scroll_region;
+		SLtt_reset_video;
+		SLtt_reverse_index;
+		SLtt_reverse_video;
+		SLtt_set_alt_char_set;
+		SLtt_set_color;
+		SLtt_set_color_fgbg;
+		SLtt_set_color_object;
+		SLtt_set_cursor_visibility;
+		SLtt_set_mono;
+		SLtt_set_mouse_mode;
+		SLtt_set_scroll_region;
+		SLtt_set_term_vtxxx;
+		SLtt_smart_puts;
+		SLtt_tgetflag;
+		SLtt_tgetnum;
+		SLtt_tgetstr;
+		SLtt_tigetent;
+		SLtt_tigetnum;
+		SLtt_tigetstr;
+		SLtt_utf8_enable;
+		SLtt_wide_width;
+		SLtt_write_string;
+		SLtt_write_to_status_line;
+		SLtty_set_suspend_state;
+		SLuchar_apply_char_map;
+		SLutf8_bskip_char;
+		SLutf8_bskip_chars;
+		SLutf8_compare;
+		SLutf8_decode;
+		SLutf8_enable;
+		SLutf8_encode;
+		SLutf8_encode_null_terminate;
+		SLutf8_extract_utf8_char;
+		SLutf8_is_utf8_mode;
+		SLutf8_skip_char;
+		SLutf8_skip_chars;
+		SLutf8_strlen;
+		SLutf8_strlo;
+		SLutf8_strup;
+		SLutf8_subst_wchar;
+		SLvsnprintf;
+		SLwchar_add_range_to_lut;
+		SLwchar_allocate_char_map;
+		SLwchar_apply_char_map;
+		SLwchar_bskip_range;
+		SLwchar_create_lut;
+		SLwchar_free_char_map;
+		SLwchar_free_lut;
+		SLwchar_in_lut;
+		SLwchar_isalnum;
+		SLwchar_isalpha;
+		SLwchar_isblank;
+		SLwchar_iscntrl;
+		SLwchar_isdigit;
+		SLwchar_isgraph;
+		SLwchar_islower;
+		SLwchar_isprint;
+		SLwchar_ispunct;
+		SLwchar_isspace;
+		SLwchar_isupper;
+		SLwchar_isxdigit;
+		SLwchar_set_wcwidth_flags;
+		SLwchar_skip_range;
+		SLwchar_strtolut;
+		SLwchar_tolower;
+		SLwchar_toupper;
+		SLwchar_wcwidth;
+		_pSLChg_UCase_Lut;
+		_pSLChg_LCase_Lut;
+	local:
+		*;
+};
+
+SLANG2.1.0 {
+        global:
+		SLang_push_ref;
+		SLang_verror_va;
+		SLclass_patch_intrin_fun_table;
+		SLclass_patch_intrin_fun_table1;
+		SLerr_throw;
+		SLrline_bol;
+		SLrline_eol;
+		SLrline_init;
+		SLrline_move;
+		SLrline_open2;
+} SLANG2;
+
+SLANG2.1.1 {
+        global:
+		SLang_pop_array_index;
+} SLANG2.1.0;
+
+SLANG2.2.0 {
+        global:
+		SLsystem_intr;
+} SLANG2.1.1;
+
+SLANG2.2.1 {
+	global:
+		SLclass_set_aelem_init_function;
+} SLANG2.2.0;
+
+SLANG2.2.3 {
+	global:
+		SLang_push_array_index;
+		SLang_push_strlen_type;
+		SLang_pop_strlen_type;
+		SLadd_lconstant_table;
+		SLtt_tgetent;
+		SLtt_tgoto;
+		SLtt_tputs;
+} SLANG2.2.1;
+
+SLANG2.3.0 {
+	global:
+		SLang_qualifier_exists;
+		SLang_get_int_qualifier;
+		SLang_get_long_qualifier;
+		SLang_get_double_qualifier;
+		SLang_get_string_qualifier;
+		SLrline_set_free_update_cb;
+		SLrline_set_update_clear_cb;
+		SLrline_set_update_preread_cb;
+		SLrline_set_update_postread_cb;
+		SLrline_set_update_width_cb;
+		SLrline_get_update_client_data;
+		SLang_create_assoc;
+		SLang_assoc_put;
+		SLang_assoc_get;
+		SLang_push_assoc;
+		SLang_pop_assoc;
+		SLang_free_assoc;
+		SLang_assoc_key_exists;
+		SLang_create_list;
+		SLang_list_append;
+		SLang_list_insert;
+		SLang_push_list;
+		SLang_pop_list;
+		SLang_free_list;
+		SLang_create_struct;
+		SLang_push_struct_field;
+		SLang_pop_struct_field;
+		SLang_pop_struct_fields;
+		SLstack_exch;
+		SLcompute_string_hash;
+		SLpath_getcwd;
+} SLANG2.2.3;

_service:tar_scm:slang-2.3.2.tar.bz2/src/slarith.c Added

@@ -0,0 +1,2002 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include <math.h>
+#include <limits.h>
+
+#ifdef HAVE_LOCALE_H
+# include <locale.h>
+#endif
+
+#if SLANG_HAS_FLOAT
+# include <float.h>
+# ifdef HAVE_FLOATINGPOINT_H
+# include <floatingpoint.h>
+# endif
+
+# ifdef HAVE_IEEEFP_H
+# include <ieeefp.h>
+# endif
+
+# ifdef HAVE_NAN_H
+# include <nan.h>
+# endif
+#endif
+
+#include <ctype.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+#if SLANG_HAS_FLOAT
+double _pSLang_NaN;
+double _pSLang_Inf;
+#endif
+
+/*
+ * This file defines binary and unary operations on all integer types.
+ * Supported types include:
+ *
+ * SLANG_CHAR_TYPE (char)
+ * SLANG_SHORT_TYPE (short)
+ * SLANG_INT_TYPE (int)
+ * SLANG_LONG_TYPE (long)
+ * SLANG_FLOAT_TYPE (float)
+ * SLANG_DOUBLE_TYPE (double)
+ *
+ * as well as unsigned types. The result-type of an arithmentic operation
+ * will depend upon the data types involved. I am going to distinguish
+ * between the boolean operations such as `and' and `or' from the arithmetic
+ * operations such as `plus'. Since the result of a boolean operation is
+ * either 1 or 0, a boolean result will be represented by SLANG_CHAR_TYPE.
+ * Ordinarily I would use an integer but for arrays it makes more sense to
+ * use a character data type.
+ *
+ * So, the following will be assumed (`+' is any arithmetic operator)
+ *
+ * char + char = int
+ * char|short + short = int
+ * char|short|int + int = int
+ * char|short|int|long + long = long
+ * char|short|int|long|float + float = float
+ * char|short|int|long|float|double + double = double
+ *
+ * In the actual implementation, a brute force approach is avoided. Such
+ * an approach would mean defining different functions for all possible
+ * combinations of types. Including the unsigned types, and not including
+ * the complex number type, there are 10 arithmetic types and 10*10=100
+ * different combinations of types. Clearly this would be too much.
+ *
+ * One approach would be to define binary functions only between operands of
+ * the same type and then convert types as appropriate. This would require
+ * just 6 such functions (int, uint, long, ulong, float, double).
+ * However, many conversion functions are going to be required, particularly
+ * since we are going to allow typecasting from one arithmetic to another.
+ * Since the bit pattern of signed and unsigned types are the same, and only
+ * the interpretation differs, there will be no functions to convert between
+ * signed and unsigned forms of a given type.
+ */
+
+#ifdef HAVE_LONG_LONG
+# define MAX_SLARITH_INT_TYPE	SLANG_ULLONG_TYPE
+#else
+# define MAX_SLARITH_INT_TYPE	SLANG_ULONG_TYPE
+#endif
+
+#define MAX_SLARITH_TYPE	SLANG_LDOUBLE_TYPE
+
+#define MAX_ARITHMETIC_TYPES	(MAX_SLARITH_TYPE-SLANG_CHAR_TYPE+1)
+#define TYPE_TO_TABLE_INDEX(t)	((t)-SLANG_CHAR_TYPE)
+#define TABLE_INDEX_TO_TYPE(i) ((i)+SLANG_CHAR_TYPE)
+
+#define IS_INTEGER_TYPE(t) \
+ (((t) >= SLANG_CHAR_TYPE) && ((t) <= MAX_SLARITH_INT_TYPE))
+
+/* This table contains the types that have been implemented here */
+SLtype _pSLarith_Arith_Types MAX_ARITHMETIC_TYPES+1 =
+{
+ SLANG_CHAR_TYPE,
+ SLANG_UCHAR_TYPE,
+ SLANG_SHORT_TYPE,
+ SLANG_USHORT_TYPE,
+ SLANG_INT_TYPE,
+ SLANG_UINT_TYPE,
+ SLANG_LONG_TYPE,
+ SLANG_ULONG_TYPE,
+#ifdef HAVE_LONG_LONG
+ SLANG_LLONG_TYPE, SLANG_ULLONG_TYPE,
+#endif
+#ifdef SLANG_HAS_FLOAT
+ SLANG_FLOAT_TYPE,
+ SLANG_DOUBLE_TYPE,
+# ifdef HAVE_LONG_DOUBLE
+ SLANG_LDOUBLE_TYPE,
+# endif
+#endif
+ 0
+};
+
+static SLtype Alias_Map MAX_ARITHMETIC_TYPES;
+
+/* Here are a bunch of functions to convert from one type to another. To
+ * facilitate the process, macros will be used.
+ */
+
+#define DEFUN_1(f,from_type,to_type) \
+static void f (to_type *y, from_type *x, SLuindex_Type n) \
+{ \
+ SLuindex_Type i; \
+ for (i = 0; i < n; i++) yi = (to_type) xi; \
+}
+
+#define DEFUN_2(f,from_type,to_type,copy_fun) \
+static VOID_STAR f (VOID_STAR xp, SLuindex_Type n) \
+{ \
+ from_type *x; \
+ to_type *y; \
+ x = (from_type *) xp; \
+ if (NULL == (y = (to_type *) _SLcalloc (n, sizeof (to_type)))) return NULL; \
+ copy_fun (y, x, n); \
+ return (VOID_STAR) y; \
+}
+typedef VOID_STAR (*Convert_Fun_Type)(VOID_STAR, SLuindex_Type);
+
+#if SLANG_HAS_FLOAT
+#define TO_DOUBLE_FUN(name,type) \
+ static double name (VOID_STAR x) { return (double) *(type *) x; }
+
+typedef SLCONST struct
+{
+ unsigned int sizeof_type;
+ double (*to_double_fun)(VOID_STAR);
+}
+To_Double_Fun_Table_Type;
+
+#endif
+
+/* Each element of the matrix determines how the row maps onto the column.
+ * That is, let the matrix be B_ij. Where the i,j indices refer to
+ * precedence of the type. Then,
+ * B_ij->copy_function copies type i to type j. Similarly,
+ * B_ij->convert_function mallocs a new array of type j and copies i to it.
+ *
+ * Since types are always converted to higher levels of precedence for binary
+ * operations, many of the elements are NULL.
+ *
+ * Is the idea clear?
+ */
+typedef struct
+{
+ FVOID_STAR copy_function;
+ Convert_Fun_Type convert_function;
+}
+Binary_Matrix_Type;
+
+#include "slarith2.inc"
+
+#if SLANG_HAS_FLOAT
+SLang_To_Double_Fun_Type
+SLarith_get_to_double_fun (SLtype type, unsigned int *sizeof_type)
+{
+ To_Double_Fun_Table_Type *t;
+
+ if ((type < SLANG_CHAR_TYPE) || (type > MAX_SLARITH_TYPE))
+ return NULL;
+
+ t = To_Double_Fun_Table + (type - SLANG_CHAR_TYPE);
+ if ((sizeof_type != NULL)
+ && (t->to_double_fun != NULL))
+ *sizeof_type = t->sizeof_type;
+
+ return t->to_double_fun;
+}
+#endif				 /* SLANG_HAS_FLOAT */
+
+#define GENERIC_BINARY_FUNCTION int_int_bin_op
+#define GENERIC_BIT_OPERATIONS
+#define GENERIC_TYPE int
+#define POW_FUNCTION(a,b) pow((double)(a),(double)(b))
+#define POW_RESULT_TYPE double
+#define ABS_FUNCTION abs
+#define MOD_FUNCTION(a,b) ((a) % (b))
+#define TRAP_DIV_ZERO	1
+#define GENERIC_UNARY_FUNCTION int_unary_op
+#define GENERIC_ARITH_UNARY_FUNCTION int_arith_unary_op
+#define SIGN_FUNCTION(x) (((x) > 0) ? 1 : (((x) < 0) ? -1 : 0))
+#if SLANG_OPTIMIZE_FOR_SPEED
+# define SCALAR_BINARY_FUNCTION int_int_scalar_bin_op
+#endif
+#define PUSH_SCALAR_OBJ_FUN(x) SLclass_push_int_obj(SLANG_INT_TYPE,(x))
+#define PUSH_POW_OBJ_FUN(x) SLclass_push_double_obj(SLANG_DOUBLE_TYPE, (x))
+#define CMP_FUNCTION int_cmp_function
+#include "slarith.inc"
+
+#define GENERIC_BINARY_FUNCTION uint_uint_bin_op
+#define GENERIC_BIT_OPERATIONS
+#define GENERIC_TYPE unsigned int
+#define GENERIC_TYPE_IS_UNSIGNED
+#define POW_FUNCTION(a,b) pow((double)(a),(double)(b))
+#define POW_RESULT_TYPE double
+#define MOD_FUNCTION(a,b) ((a) % (b))
+#define TRAP_DIV_ZERO	1
+#define GENERIC_UNARY_FUNCTION uint_unary_op
+#define GENERIC_ARITH_UNARY_FUNCTION uint_arith_unary_op
+#define ABS_FUNCTION(a) (a)
+#define SIGN_FUNCTION(x) (((x) > 0) ? 1 : 0)
+#if SLANG_OPTIMIZE_FOR_SPEED
+# define SCALAR_BINARY_FUNCTION uint_uint_scalar_bin_op
+#endif
+#define PUSH_SCALAR_OBJ_FUN(x) SLclass_push_int_obj(SLANG_UINT_TYPE,(int)(x))
+#define PUSH_POW_OBJ_FUN(x) SLclass_push_double_obj(SLANG_DOUBLE_TYPE, (x))
+#define CMP_FUNCTION uint_cmp_function
+#define TO_BINARY_FUNCTION uint_to_binary
+#include "slarith.inc"
+
+#if LONG_IS_NOT_INT
+#define GENERIC_BINARY_FUNCTION long_long_bin_op
+#define GENERIC_BIT_OPERATIONS
+#define GENERIC_TYPE long
+#define POW_FUNCTION(a,b) pow((double)(a),(double)(b))
+#define POW_RESULT_TYPE double
+#define MOD_FUNCTION(a,b) ((a) % (b))
+#define TRAP_DIV_ZERO	1
+#define GENERIC_UNARY_FUNCTION long_unary_op
+#define GENERIC_ARITH_UNARY_FUNCTION long_arith_unary_op
+#define ABS_FUNCTION(a) (((a) >= 0) ? (a) : -(a))
+#define SIGN_FUNCTION(x) (((x) > 0) ? 1 : (((x) < 0) ? -1 : 0))
+#if SLANG_OPTIMIZE_FOR_SPEED
+# define SCALAR_BINARY_FUNCTION long_long_scalar_bin_op
+#endif
+#define PUSH_SCALAR_OBJ_FUN(x) SLclass_push_long_obj(SLANG_LONG_TYPE,(x))
+#define PUSH_POW_OBJ_FUN(x) SLclass_push_double_obj(SLANG_DOUBLE_TYPE, (x))
+#define CMP_FUNCTION long_cmp_function
+#include "slarith.inc"
+
+#define GENERIC_BINARY_FUNCTION ulong_ulong_bin_op
+#define GENERIC_BIT_OPERATIONS
+#define GENERIC_TYPE unsigned long
+#define GENERIC_TYPE_IS_UNSIGNED
+#define POW_FUNCTION(a,b) pow((double)(a),(double)(b))
+#define POW_RESULT_TYPE double
+#define MOD_FUNCTION(a,b) ((a) % (b))
+#define TRAP_DIV_ZERO	1
+#define GENERIC_UNARY_FUNCTION ulong_unary_op
+#define GENERIC_ARITH_UNARY_FUNCTION ulong_arith_unary_op
+#define ABS_FUNCTION(a) (a)
+#define SIGN_FUNCTION(x) (((x) > 0) ? 1 : 0)
+#if SLANG_OPTIMIZE_FOR_SPEED
+# define SCALAR_BINARY_FUNCTION ulong_ulong_scalar_bin_op
+#endif
+#define PUSH_SCALAR_OBJ_FUN(x) SLclass_push_long_obj(SLANG_ULONG_TYPE,(long)(x))
+#define PUSH_POW_OBJ_FUN(x) SLclass_push_double_obj(SLANG_DOUBLE_TYPE, (x))
+#define CMP_FUNCTION ulong_cmp_function
+#define TO_BINARY_FUNCTION ulong_to_binary
+#include "slarith.inc"
+#else
+#define long_long_bin_op	int_int_bin_op
+#define ulong_ulong_bin_op	uint_uint_bin_op
+#define long_unary_op		int_unary_op
+#define ulong_unary_op		uint_unary_op
+#define long_cmp_function	int_cmp_function
+#define ulong_cmp_function	uint_cmp_function
+#define ulong_to_binary		uint_to_binary
+#endif				 /* LONG_IS_NOT_INT */
+
+#ifdef HAVE_LONG_LONG
+# if LLONG_IS_NOT_LONG
+# define GENERIC_BINARY_FUNCTION llong_llong_bin_op
+# define GENERIC_BIT_OPERATIONS
+# define GENERIC_TYPE long long
+# define POW_FUNCTION(a,b) pow((double)(a),(double)(b))
+# define POW_RESULT_TYPE double
+# define MOD_FUNCTION(a,b) ((a) % (b))
+# define TRAP_DIV_ZERO	1
+# define GENERIC_UNARY_FUNCTION llong_unary_op
+# define GENERIC_ARITH_UNARY_FUNCTION llong_arith_unary_op
+# define ABS_FUNCTION(a) (((a) >= 0) ? (a) : -(a))
+# define SIGN_FUNCTION(x) (((x) > 0) ? 1 : (((x) < 0) ? -1 : 0))
+# if SLANG_OPTIMIZE_FOR_SPEED
+# define SCALAR_BINARY_FUNCTION llong_llong_scalar_bin_op
+# endif
+# define PUSH_SCALAR_OBJ_FUN(x) SLclass_push_llong_obj(SLANG_LLONG_TYPE,(x))
+# define PUSH_POW_OBJ_FUN(x) SLclass_push_double_obj(SLANG_DOUBLE_TYPE, (x))
+# define CMP_FUNCTION llong_cmp_function
+# include "slarith.inc"
+
+# define GENERIC_BINARY_FUNCTION ullong_ullong_bin_op
+# define GENERIC_BIT_OPERATIONS
+# define GENERIC_TYPE unsigned long long
+# define GENERIC_TYPE_IS_UNSIGNED
+# define POW_FUNCTION(a,b) pow((double)(a),(double)(b))
+# define POW_RESULT_TYPE double
+# define MOD_FUNCTION(a,b) ((a) % (b))
+# define TRAP_DIV_ZERO	1
+# define GENERIC_UNARY_FUNCTION ullong_unary_op
+# define GENERIC_ARITH_UNARY_FUNCTION ullong_arith_unary_op
+# define ABS_FUNCTION(a) (a)
+# define SIGN_FUNCTION(x) (((x) > 0) ? 1 : 0)
+# if SLANG_OPTIMIZE_FOR_SPEED
+# define SCALAR_BINARY_FUNCTION ullong_ullong_scalar_bin_op
+# endif
+# define PUSH_SCALAR_OBJ_FUN(x) SLclass_push_llong_obj(SLANG_ULLONG_TYPE,(long long)(x))
+# define PUSH_POW_OBJ_FUN(x) SLclass_push_double_obj(SLANG_DOUBLE_TYPE, (x))
+# define CMP_FUNCTION ullong_cmp_function
+# define TO_BINARY_FUNCTION ullong_to_binary
+# include "slarith.inc"
+# else
+# define llong_llong_bin_op long_long_bin_op
+# define ullong_ullong_bin_op ulong_ulong_bin_op
+# define llong_llong_scalar_bin_op long_long_scalar_bin_op
+# define ullong_ullong_scalar_bin_op ulong_ulong_scalar_bin_op
+# define ullong_to_binary ulong_to_binary
+# endif				 /* LLONG_IS_NOT_LONG */
+#endif				 /* HAVE_LONG_LONG */
+
+#if SLANG_HAS_FLOAT
+#define GENERIC_BINARY_FUNCTION float_float_bin_op
+#define GENERIC_TYPE float
+#define POW_FUNCTION(a,b) (float)pow((double)(a),(double)(b))
+#define POW_RESULT_TYPE float
+#define MOD_FUNCTION(a,b) (float)fmod((a),(b))
+#define TRAP_DIV_ZERO	0
+#define GENERIC_UNARY_FUNCTION float_unary_op
+#define GENERIC_ARITH_UNARY_FUNCTION float_arith_unary_op
+#define ABS_FUNCTION(a) (float)fabs((double) a)
+#define SIGN_FUNCTION(x) (((x) > 0) ? 1 : (((x) < 0) ? -1 : 0))
+#if SLANG_OPTIMIZE_FOR_SPEED
+# define SCALAR_BINARY_FUNCTION float_float_scalar_bin_op
+#endif
+#define PUSH_SCALAR_OBJ_FUN(x) SLclass_push_float_obj(SLANG_FLOAT_TYPE,(x))
+#define PUSH_POW_OBJ_FUN(x) SLclass_push_float_obj(SLANG_FLOAT_TYPE, (x))
+#define CMP_FUNCTION float_cmp_function
+#include "slarith.inc"
+
+#define GENERIC_BINARY_FUNCTION double_double_bin_op
+#define GENERIC_TYPE double
+#define POW_FUNCTION(a,b) pow((double)(a),(double)(b))
+#define POW_RESULT_TYPE double
+#define MOD_FUNCTION(a,b) fmod((a),(b))
+#define TRAP_DIV_ZERO	0
+#define GENERIC_UNARY_FUNCTION double_unary_op
+#define GENERIC_ARITH_UNARY_FUNCTION double_arith_unary_op
+#define ABS_FUNCTION(a) fabs(a)
+#define SIGN_FUNCTION(x) (((x) > 0) ? 1 : (((x) < 0) ? -1 : 0))
+#if SLANG_OPTIMIZE_FOR_SPEED
+# define SCALAR_BINARY_FUNCTION double_double_scalar_bin_op
+#endif
+#define PUSH_SCALAR_OBJ_FUN(x) SLclass_push_double_obj(SLANG_DOUBLE_TYPE,(x))
+#define PUSH_POW_OBJ_FUN(x) SLclass_push_double_obj(SLANG_DOUBLE_TYPE, (x))
+#define CMP_FUNCTION double_cmp_function
+#include "slarith.inc"
+#endif				 /* SLANG_HAS_FLOAT */
+
+#define GENERIC_UNARY_FUNCTION char_unary_op
+#define GENERIC_ARITH_UNARY_FUNCTION char_arith_unary_op
+#define GENERIC_BINARY_FUNCTION char_char_arith_bin_op
+#define JUST_BOOLEAN_BINARY_OPS
+#define GENERIC_BIT_OPERATIONS
+#define GENERIC_TYPE signed char
+#define ABS_FUNCTION abs
+#define SIGN_FUNCTION(x) (((x) > 0) ? 1 : (((x) < 0) ? -1 : 0))
+#define CMP_FUNCTION char_cmp_function
+#include "slarith.inc"
+
+#define GENERIC_UNARY_FUNCTION uchar_unary_op
+#define GENERIC_ARITH_UNARY_FUNCTION uchar_arith_unary_op
+#define GENERIC_BIT_OPERATIONS
+#define GENERIC_TYPE unsigned char
+#define GENERIC_TYPE_IS_UNSIGNED
+#define ABS_FUNCTION(x) (x)
+#define SIGN_FUNCTION(x) (((x) > 0) ? 1 : 0)
+#define CMP_FUNCTION uchar_cmp_function
+#define TO_BINARY_FUNCTION uchar_to_binary
+#include "slarith.inc"
+
+#if SHORT_IS_NOT_INT
+#define GENERIC_UNARY_FUNCTION short_unary_op
+#define GENERIC_ARITH_UNARY_FUNCTION short_arith_unary_op
+#define GENERIC_BIT_OPERATIONS
+#define GENERIC_TYPE short
+#define ABS_FUNCTION abs
+#define SIGN_FUNCTION(x) (((x) > 0) ? 1 : (((x) < 0) ? -1 : 0))
+#define CMP_FUNCTION short_cmp_function
+#include "slarith.inc"
+
+#define GENERIC_UNARY_FUNCTION ushort_unary_op
+#define GENERIC_ARITH_UNARY_FUNCTION ushort_arith_unary_op
+#define GENERIC_BIT_OPERATIONS
+#define GENERIC_TYPE unsigned short
+#define GENERIC_TYPE_IS_UNSIGNED
+#define ABS_FUNCTION(x) (x)
+#define SIGN_FUNCTION(x) (((x) > 0) ? 1 : 0)
+#define CMP_FUNCTION ushort_cmp_function
+#define TO_BINARY_FUNCTION ushort_to_binary
+#include "slarith.inc"
+#endif				 /* SHORT_IS_NOT_INT */
+
+int _pSLarith_get_precedence (SLtype type)
+{
+ if ((type < SLANG_CHAR_TYPE) || (type > MAX_SLARITH_TYPE))
+ return -1;
+
+ type = Alias_MapTYPE_TO_TABLE_INDEX(type);
+ return type - SLANG_CHAR_TYPE;
+}
+
+SLtype _pSLarith_promote_type (SLtype t)
+{
+ t = Alias_MapTYPE_TO_TABLE_INDEX(t);
+
+ switch (t)
+ {
+ case SLANG_INT_TYPE:
+ case SLANG_UINT_TYPE:
+ case SLANG_LONG_TYPE:
+ case SLANG_ULONG_TYPE:
+#ifdef HAVE_LONG_LONG
+ case SLANG_LLONG_TYPE:
+ case SLANG_ULLONG_TYPE:
+#endif
+ case SLANG_FLOAT_TYPE:
+ case SLANG_DOUBLE_TYPE:
+	break;
+
+ case SLANG_USHORT_TYPE:
+#if SHORT_IS_INT
+	t = SLANG_UINT_TYPE;
+	break;
+#endif
+	/* drop */
+ case SLANG_CHAR_TYPE:
+ case SLANG_UCHAR_TYPE:
+ case SLANG_SHORT_TYPE:
+ default:
+	t = SLANG_INT_TYPE;
+ }
+
+ return t;
+}
+
+static SLtype promote_to_common_type (SLtype a, SLtype b)
+{
+ SLtype a1;
+ a1 = _pSLarith_promote_type (a);
+ if (a == b)
+ return a1;
+ b = _pSLarith_promote_type (b);
+
+ return (a1 > b) ? a1 : b;
+}
+
+static int arith_bin_op_result (int op, SLtype a_type, SLtype b_type,
+				SLtype *c_type)
+{
+ switch (op)
+ {
+ case SLANG_EQ:
+ case SLANG_NE:
+ case SLANG_GT:
+ case SLANG_GE:
+ case SLANG_LT:
+ case SLANG_LE:
+ case SLANG_OR:
+ case SLANG_AND:
+	*c_type = SLANG_CHAR_TYPE;
+	return 1;
+#if SLANG_HAS_FLOAT
+ case SLANG_POW:
+	if (SLANG_FLOAT_TYPE == promote_to_common_type (a_type, b_type))
+	 *c_type = SLANG_FLOAT_TYPE;
+	else
+	 *c_type = SLANG_DOUBLE_TYPE;
+	return 1;
+#endif
+ case SLANG_BAND:
+ case SLANG_BXOR:
+ case SLANG_BOR:
+ case SLANG_SHL:
+ case SLANG_SHR:
+	/* The bit-level operations are defined just for integer types */
+	if ((0 == IS_INTEGER_TYPE (a_type))
+	 || (0 == IS_INTEGER_TYPE(b_type)))
+	 return 0;
+	break;
+
+ default:
+	break;
+ }
+
+ *c_type = promote_to_common_type (a_type, b_type);
+ return 1;
+}
+
+typedef int (*Bin_Fun_Type) (int,
+			 SLtype, VOID_STAR, SLuindex_Type,
+			 SLtype, VOID_STAR, SLuindex_Type,
+			 VOID_STAR);
+
+/* This array of functions must be indexed by precedence after arithmetic
+ * promotions.
+ */
+static Bin_Fun_Type Bin_Fun_Map MAX_ARITHMETIC_TYPES =
+{
+ NULL,			 /* char */
+ NULL,			 /* uchar */
+ NULL,			 /* short */
+ NULL,			 /* ushort */
+ int_int_bin_op,		 /* int */
+ uint_uint_bin_op,		 /* uint */
+ long_long_bin_op,		 /* long */
+ ulong_ulong_bin_op,	 /* ulong */
+#ifdef HAVE_LONG_LONG
+ llong_llong_bin_op,	 /* llong */
+ ullong_ullong_bin_op,	 /* ullong */
+#else
+ NULL, NULL,
+#endif
+ float_float_bin_op,		 /* float */
+ double_double_bin_op		 /* double */
+};
+
+static int arith_bin_op (int op,
+			 SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+			 SLtype b_type, VOID_STAR bp, SLuindex_Type nb,
+			 VOID_STAR cp)
+{
+ Bin_Fun_Type binfun;
+ int c_indx;
+ SLtype c_type;
+
+ if ((a_type == b_type)
+ && ((a_type == SLANG_CHAR_TYPE) || (a_type == SLANG_UCHAR_TYPE)))
+ {
+	switch (op)
+	 {
+	 case SLANG_EQ:
+	 case SLANG_NE:
+	 case SLANG_AND:
+	 case SLANG_OR:
+	 return char_char_arith_bin_op (op, a_type, ap, na, b_type, bp, nb, cp);
+	 }
+ }
+
+ c_type = promote_to_common_type (a_type, b_type);
+ c_indx = TYPE_TO_TABLE_INDEX(c_type);
+ binfun = Bin_Fun_Mapc_indx;
+
+ if ((c_type != a_type) || (c_type != b_type))
+ {
+	int ret;
+	int a_indx = TYPE_TO_TABLE_INDEX(a_type);
+	int b_indx = TYPE_TO_TABLE_INDEX(b_type);
+	Convert_Fun_Type af = Binary_Matrixa_indxc_indx.convert_function;
+	Convert_Fun_Type bf = Binary_Matrixb_indxc_indx.convert_function;
+
+	if ((af != NULL)
+	 && (NULL == (ap = (VOID_STAR) (*af) (ap, na))))
+	 return -1;
+
+	if ((bf != NULL)
+	 && (NULL == (bp = (VOID_STAR) (*bf) (bp, nb))))
+	 {
+	 if (af != NULL) SLfree ((char *) ap);
+	 return -1;
+	 }
+
+	ret = (*binfun) (op, a_type, ap, na, b_type, bp, nb, cp);
+	if (af != NULL) SLfree ((char *) ap);
+	if (bf != NULL) SLfree ((char *) bp);
+	return ret;
+ }
+
+ return (*binfun) (op, a_type, ap, na, b_type, bp, nb, cp);
+}
+
+static int arith_unary_op_result (int op, SLtype a, SLtype *b)
+{
+ (void) a;
+ switch (op)
+ {
+ default:
+	return 0;
+
+ case SLANG_SQR:
+ case SLANG_MUL2:
+ case SLANG_PLUSPLUS:
+ case SLANG_MINUSMINUS:
+ case SLANG_CHS:
+ case SLANG_ABS:
+	*b = a;
+	break;
+
+ case SLANG_BNOT:
+	if (0 == IS_INTEGER_TYPE(a))
+	 return 0;
+	*b = a;
+	break;
+
+ case SLANG_SIGN:
+	*b = SLANG_INT_TYPE;
+	break;
+
+ case SLANG_NOT:
+ case SLANG_ISPOS:
+ case SLANG_ISNEG:
+ case SLANG_ISNONNEG:
+	*b = SLANG_CHAR_TYPE;
+	break;
+ }
+ return 1;
+}
+
+static int integer_pop (SLtype type, VOID_STAR ptr)
+{
+ SLang_Object_Type obj;
+ int i, j;
+ void (*f)(VOID_STAR, VOID_STAR, unsigned int);
+
+ if (-1 == SLang_pop (&obj))
+ return -1;
+
+ if (0 == IS_INTEGER_TYPE(obj.o_data_type))
+ {
+	_pSLclass_type_mismatch_error (type, obj.o_data_type);
+ 	SLang_free_object (&obj);
+	return -1;
+ }
+
+ i = TYPE_TO_TABLE_INDEX(type);
+ j = TYPE_TO_TABLE_INDEX(obj.o_data_type);
+ f = (void (*)(VOID_STAR, VOID_STAR, unsigned int))
+ Binary_Matrixji.copy_function;
+
+ (*f) (ptr, (VOID_STAR)&obj.v, 1);
+
+ return 0;
+}
+
+static int integer_push (SLtype type, VOID_STAR ptr)
+{
+ SLang_Object_Type obj;
+ int i;
+ void (*f)(VOID_STAR, VOID_STAR, unsigned int);
+
+ i = TYPE_TO_TABLE_INDEX(type);
+ f = (void (*)(VOID_STAR, VOID_STAR, unsigned int))
+ Binary_Matrixii.copy_function;
+
+ obj.o_data_type = type;
+
+ (*f) ((VOID_STAR)&obj.v, ptr, 1);
+
+ return SLang_push (&obj);
+}
+
+int SLang_pop_char (char *i)
+{
+ return integer_pop (SLANG_CHAR_TYPE, (VOID_STAR) i);
+}
+
+int SLang_pop_uchar (unsigned char *i)
+{
+ return integer_pop (SLANG_UCHAR_TYPE, (VOID_STAR) i);
+}
+
+int SLang_pop_short (short *i)
+{
+ return integer_pop (_pSLANG_SHORT_TYPE, (VOID_STAR) i);
+}
+
+int SLang_pop_ushort (unsigned short *i)
+{
+ return integer_pop (_pSLANG_USHORT_TYPE, (VOID_STAR) i);
+}
+
+int SLang_pop_long (long *i)
+{
+ return integer_pop (_pSLANG_LONG_TYPE, (VOID_STAR) i);
+}
+
+int SLang_pop_ulong (unsigned long *i)
+{
+ return integer_pop (_pSLANG_ULONG_TYPE, (VOID_STAR) i);
+}
+
+#ifdef HAVE_LONG_LONG
+#if LLONG_IS_NOT_LONG
+static void llong_byte_code_destroy (SLtype unused, VOID_STAR ptr)
+{
+ (void) unused;
+ SLfree (*(char **) ptr);
+}
+#endif
+int SLang_pop_long_long (long long *i)
+{
+ return integer_pop (_pSLANG_LLONG_TYPE, (VOID_STAR) i);
+}
+
+int SLang_pop_ulong_long (unsigned long long *i)
+{
+ return integer_pop (_pSLANG_ULLONG_TYPE, (VOID_STAR) i);
+}
+#endif
+
+int SLang_pop_uint (unsigned int *i)
+{
+ return integer_pop (SLANG_UINT_TYPE, (VOID_STAR) i);
+}
+
+/* int _pSLang_pop_int16 (_pSLint16_Type *i) {return integer_pop (_pSLANG_INT16_TYPE, i);} */
+/* int _pSLang_pop_uint16 (_pSLuint16_Type *i) {return integer_pop (_pSLANG_UINT16_TYPE, i);} */
+/* int _pSLang_pop_int32 (_pSLint32_Type *i) {return integer_pop (_pSLANG_INT32_TYPE, i);} */
+/* int _pSLang_pop_uint32 (_pSLuint32_Type *i) {return integer_pop (_pSLANG_UINT32_TYPE, i);} */
+#if _pSLANG_INT64_TYPE
+int _pSLang_pop_int64(_pSLint64_Type *i) {return integer_pop (_pSLANG_INT64_TYPE, i);}
+int _pSLang_pop_uint64 (_pSLuint64_Type *i) {return integer_pop (_pSLANG_UINT64_TYPE, i);}
+#endif
+
+#define MK_PUSH_INTXX(fname_, ctype_, stype_, field_) \
+ int fname_ (ctype_ i) \
+ { \
+ SLang_Object_Type obj; \
+ obj.o_data_type = stype_; \
+ obj.v.field_ = i; \
+ return SLang_push (&obj); \
+ }
+
+/* MK_PUSH_INTXX(_pSLang_push_int16, _pSLint16_Type, _pSLANG_INT16_TYPE, int16_val) */
+/* MK_PUSH_INTXX(_pSLang_push_uint16, _pSLuint16_Type, _pSLANG_UINT16_TYPE, uint16_val) */
+/* MK_PUSH_INTXX(_pSLang_push_int32, _pSLint32_Type, _pSLANG_INT32_TYPE, int32_val) */
+/* MK_PUSH_INTXX(_pSLang_push_uint32, _pSLuint32_Type, _pSLANG_UINT32_TYPE, uint32_val) */
+#if _pSLANG_INT64_TYPE
+/* MK_PUSH_INTXX(_pSLang_push_int64, _pSLint64_Type, _pSLANG_INT64_TYPE, int64_val) */
+/* MK_PUSH_INTXX(_pSLang_push_uint64, _pSLuint64_Type, _pSLANG_UINT64_TYPE, uint64_val) */
+#endif
+
+int SLang_push_int (int i)
+{
+ return SLclass_push_int_obj (SLANG_INT_TYPE, i);
+}
+int SLang_push_uint (unsigned int i)
+{
+ return SLclass_push_int_obj (SLANG_UINT_TYPE, (int) i);
+}
+int SLang_push_char (char i)
+{
+ return SLclass_push_char_obj (SLANG_CHAR_TYPE, i);
+}
+
+int SLang_push_uchar (unsigned char i)
+{
+ return SLclass_push_char_obj (SLANG_UCHAR_TYPE, (char) i);
+}
+int SLang_push_short (short i)
+{
+ return SLclass_push_short_obj (_pSLANG_SHORT_TYPE, i);
+}
+int SLang_push_ushort (unsigned short i)
+{
+ return SLclass_push_short_obj (_pSLANG_USHORT_TYPE, (unsigned short) i);
+}
+int SLang_push_long (long i)
+{
+ return SLclass_push_long_obj (_pSLANG_LONG_TYPE, i);
+}
+int SLang_push_ulong (unsigned long i)
+{
+ return SLclass_push_long_obj (_pSLANG_ULONG_TYPE, (long) i);
+}
+
+#ifdef HAVE_LONG_LONG
+int SLang_push_long_long (long long i)
+{
+ return SLclass_push_llong_obj (_pSLANG_LLONG_TYPE, i);
+}
+int SLang_push_ulong_long (unsigned long long i)
+{
+ return SLclass_push_llong_obj (_pSLANG_ULLONG_TYPE, (long long) i);
+}
+#endif
+
+int SLang_pop_strlen_type (SLstrlen_Type *ip)
+{
+#if SLANG_STRLEN_TYPE == SLANG_UINT_TYPE
+ return SLang_pop_uint (ip);
+#else
+ return SLang_pop_ulong (ip);
+#endif
+}
+int SLang_push_strlen_type (SLstrlen_Type i)
+{
+#if SLANG_STRLEN_TYPE == SLANG_UINT_TYPE
+ return SLang_push_uint (i);
+#else
+ return SLang_push_ulong (i);
+#endif
+}
+
+_INLINE_
+int _pSLarith_typecast (SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+			SLtype b_type, VOID_STAR bp)
+{
+ int i, j;
+
+ void (*copy)(VOID_STAR, VOID_STAR, SLuindex_Type);
+
+ i = TYPE_TO_TABLE_INDEX (a_type);
+ j = TYPE_TO_TABLE_INDEX (b_type);
+
+ copy = (void (*)(VOID_STAR, VOID_STAR, SLuindex_Type))
+ Binary_Matrixij.copy_function;
+
+ (*copy) (bp, ap, na);
+ return 1;
+}
+
+#if SLANG_HAS_FLOAT
+
+int SLang_pop_double (double *x)
+{
+ SLang_Object_Type obj;
+
+ if (0 != SLang_pop (&obj))
+ return -1;
+
+ switch (obj.o_data_type)
+ {
+ case SLANG_FLOAT_TYPE:
+	*x = (double) obj.v.float_val;
+	break;
+
+ case SLANG_DOUBLE_TYPE:
+	*x = obj.v.double_val;
+	break;
+
+ case SLANG_INT_TYPE:
+	*x = (double) obj.v.int_val;
+	break;
+
+ case SLANG_CHAR_TYPE: *x = (double) obj.v.char_val; break;
+ case SLANG_UCHAR_TYPE: *x = (double) obj.v.uchar_val; break;
+ case SLANG_SHORT_TYPE: *x = (double) obj.v.short_val; break;
+ case SLANG_USHORT_TYPE: *x = (double) obj.v.ushort_val; break;
+ case SLANG_UINT_TYPE: *x = (double) obj.v.uint_val; break;
+ case SLANG_LONG_TYPE: *x = (double) obj.v.long_val; break;
+ case SLANG_ULONG_TYPE: *x = (double) obj.v.ulong_val; break;
+#ifdef HAVE_LONG_LONG
+ case SLANG_LLONG_TYPE: *x = (double) obj.v.llong_val; break;
+ case SLANG_ULLONG_TYPE: *x = (double) obj.v.ullong_val; break;
+#endif
+ default:
+	_pSLclass_type_mismatch_error (SLANG_DOUBLE_TYPE, obj.o_data_type);
+	SLang_free_object (&obj);
+	return -1;
+ }
+ return 0;
+}
+
+int SLang_push_double (double x)
+{
+ return SLclass_push_double_obj (SLANG_DOUBLE_TYPE, x);
+}
+
+int SLang_pop_float (float *x)
+{
+ double d;
+
+ /* Pop it as a double and let the double function do all the typcasting */
+ if (-1 == SLang_pop_double (&d))
+ return -1;
+
+ *x = (float) d;
+ return 0;
+}
+
+int SLang_push_float (float f)
+{
+ return SLclass_push_float_obj (SLANG_FLOAT_TYPE, (double) f);
+}
+
+/* Double */
+static int double_push (SLtype type, VOID_STAR ptr)
+{
+#if SLANG_OPTIMIZE_FOR_SPEED
+ SLang_Object_Type obj;
+ obj.o_data_type = type;
+ obj.v.double_val = *(double *)ptr;
+ return SLang_push (&obj);
+#else
+ return SLclass_push_double_obj (type, *(double *) ptr);
+#endif
+}
+
+static int double_push_literal (SLtype type, VOID_STAR ptr)
+{
+ return SLclass_push_double_obj (type, **(double **)ptr);
+}
+
+static int double_pop (SLtype unused, VOID_STAR ptr)
+{
+ (void) unused;
+ return SLang_pop_double ((double *) ptr);
+}
+
+static void double_byte_code_destroy (SLtype unused, VOID_STAR ptr)
+{
+ (void) unused;
+ SLfree (*(char **) ptr);
+}
+
+static int float_push (SLtype unused, VOID_STAR ptr)
+{
+ (void) unused;
+ SLang_push_float (*(float *) ptr);
+ return 0;
+}
+
+static int float_pop (SLtype unused, VOID_STAR ptr)
+{
+ (void) unused;
+ return SLang_pop_float ((float *) ptr);
+}
+
+#endif				 /* SLANG_HAS_FLOAT */
+
+#if SLANG_HAS_FLOAT
+static char Double_Format16 = "%g";
+static char *Double_Format_Ptr = NULL;
+static unsigned int Double_Format_Expon_Threshold = 6;
+
+void _pSLset_double_format (SLCONST char *fmt)
+{
+ /* The only forms accepted by this function are:
+ * "%+ width.precisionefgS"
+ */
+ SLCONST char *s = fmt;
+ int precision = 6;
+
+ if (*s++ != '%')
+ return;
+
+ /* 0 or more flags */
+ while ((*s == '#') || (*s == '0') || (*s == '-')
+	 || (*s == ' ') || (*s == '+'))
+ s++;
+
+ /* field width */
+ while (isdigit ((unsigned char)*s)) s++;
+
+ /* precision */
+ if (*s == '.')
+ {
+	s++;
+	precision = 0;
+	while (isdigit ((unsigned char)*s))
+	 {
+	 precision = precision * 10 + (*s - '0');
+	 s++;
+	 }
+	if (precision < 0)
+	 precision = 6;
+ }
+
+ if ((*s == 'e') || (*s == 'E')
+ || (*s == 'f') || (*s == 'F')
+ || (*s == 'g') || (*s == 'G'))
+ {
+	s++;
+	if (*s != 0)
+	 return;		 /* more junk-- unacceptable */
+
+	if (strlen (fmt) >= sizeof (Double_Format))
+	 return;
+
+	strcpy (Double_Format, fmt);
+	Double_Format_Ptr = Double_Format;
+	return;
+ }
+
+ if ((*s == 'S') || (*s == 's'))
+ {
+	s++;
+	if (*s != 0)
+	 return;
+
+	Double_Format_Ptr = NULL;
+	Double_Format_Expon_Threshold = precision;
+	return;
+ }
+
+ /* error */
+}
+
+SLCONST char *_pSLget_double_format (void)
+{
+ if (Double_Format_Ptr == NULL)
+ return "%S";
+
+ return Double_Format_Ptr;
+}
+
+static void check_decimal (char *buf, unsigned int buflen, double x)
+{
+ char *b, *bstart = buf, *bufmax = buf + buflen;
+ unsigned int count = 0, expon;
+ int has_point = 0;
+ unsigned int expon_threshold = Double_Format_Expon_Threshold;
+
+ if (*bstart == '-')
+ bstart++;
+
+ b = bstart;
+ while (1)
+ {
+	char ch = *b;
+	if (isdigit ((unsigned char)ch))
+	 {
+	 count++;
+	 b++;
+	 continue;
+	 }
+	if (ch == 0)
+	 break;		 /* all digits */
+
+	if (ch != '.')
+	 return;			 /* something else */
+
+	/* We are at a decimal point. If expon > 1, then buf does not contain
+	 * an exponential formatted quantity.
+	 */
+	if (count <= expon_threshold)
+	 return;
+	/* We have something like: 1234567.123, which we want to
+	 * write as 1.234567123e+6
+	 */
+	b += strlen(b);
+	has_point = 1;
+	break;			 /* handle below */
+ }
+
+ /* We get here only when *b==0. */
+
+ if ((has_point == 0) && (count <= 6))
+ {
+	if (b + 3 >= bufmax)
+	 {
+	 sprintf (buf, "%e", x);
+	 return;
+	 }
+	*b++ = '.';
+	*b++ = '0';
+	*b = 0;
+	return;
+ }
+
+ expon = count-1;
+
+ /* Now add on the exponent. First move the decimal point but drop trailing 0s */
+ while ((count > 1) && (*(b-1) == '0'))
+ {
+	b--;
+	count--;
+ }
+
+ if (count > 1)
+ {
+	while (count > 1)
+	 {
+	 bstartcount = bstartcount-1;
+	 count--;
+	 }
+	bstartcount = '.';
+	if (has_point == 0)
+	 b++;
+ }
+
+ if (EOF == SLsnprintf (b, bufmax-b, "e+%02d", expon))
+ sprintf (buf, "%e", x);
+}
+
+static int massage_decimal_buffer (char *inbuf, char *buf,
+				 unsigned int buflen, unsigned int min_slen)
+{
+ char *s;
+ unsigned int slen, count;
+ char c;
+
+ slen = strlen(inbuf);
+ if ((slen < min_slen) || (slen+1 > buflen))
+ return 0;
+
+ s = inbuf + slen;
+ s -= 2;			 /* skip last digit */
+ c = *s;
+ if ((c != '0') && (c != '9'))
+ return 0;
+ s--;
+
+ count = 0;
+ while ((s > inbuf) && (*s == c))
+ {
+	count++;
+	s--;
+ }
+
+ if ((count < 4) || (0 == isdigit ((unsigned char)*s)))
+ return 0;
+
+ if (c == '9')
+ {
+	/* e.g., 9.699999999999999 */
+	slen = s-inbuf;
+	memcpy (buf, inbuf, slen);
+	bufslen = *s + 1;	 /* assumes ascii */
+	bufslen+1 = 0;
+ }
+ else
+ {
+	/* 9.300000000000001 */
+	slen = (s+1)-inbuf;
+	memcpy (buf, inbuf, slen);
+	bufslen = 0;
+ }
+
+ return 1;
+}
+
+static void massage_double_buffer (char *inbuf, double x)
+{
+ char buf1024;
+
+ if (massage_decimal_buffer (inbuf, buf, sizeof(buf), 16)
+ && (atof(buf) == x))
+ strcpy (inbuf, buf);
+}
+
+static void massage_float_buffer (char *inbuf, float x)
+{
+ char buf1024;
+
+ if (massage_decimal_buffer (inbuf, buf, sizeof(buf), 8)
+ && ((float)atof(buf) == x))
+ strcpy (inbuf, buf);
+}
+
+static void default_format_double (double x, char *buf, unsigned int buflen)
+{
+ if (EOF == SLsnprintf (buf, buflen, "%.16g", x))
+ {
+	sprintf (buf, "%e", x);
+	return;
+ }
+
+ if (atof (buf) != x)
+ {
+	if (EOF == SLsnprintf (buf, buflen, "%.17g", x))
+	 {
+	 sprintf (buf, "%e", x);
+	 return;
+	 }
+ }
+ massage_double_buffer (buf,x);
+ check_decimal (buf, buflen, x);
+}
+
+static void default_format_float (float x, char *buf, unsigned int buflen)
+{
+ if (EOF == SLsnprintf (buf, buflen, "%.8g", x))
+ {
+	sprintf (buf, "%e", x);
+	return;
+ }
+ if ((float) atof (buf) != x)
+ {
+	if (EOF == SLsnprintf (buf, buflen, "%.9g", x))
+	 {
+	 sprintf (buf, "%e", x);
+	 return;
+	 }
+ }
+ massage_float_buffer (buf, x);
+ check_decimal (buf, buflen, x);
+}
+#endif
+
+#if defined(__GNUC__)
+# pragma GCC diagnostic ignored "-Wformat-nonliteral"
+#endif
+static char *arith_string (SLtype type, VOID_STAR v)
+{
+ char buf 1024;
+ char *s;
+
+ s = buf;
+
+ switch (type)
+ {
+ default:
+	s = (char *) SLclass_get_datatype_name (type);
+	break;
+
+ case SLANG_CHAR_TYPE:
+	sprintf (s, "%d", *(signed char *) v);
+	break;
+ case SLANG_UCHAR_TYPE:
+	sprintf (s, "%u", *(unsigned char *) v);
+	break;
+ case SLANG_SHORT_TYPE:
+	sprintf (s, "%d", *(short *) v);
+	break;
+ case SLANG_USHORT_TYPE:
+	sprintf (s, "%u", *(unsigned short *) v);
+	break;
+ case SLANG_INT_TYPE:
+	sprintf (s, "%d", *(int *) v);
+	break;
+ case SLANG_UINT_TYPE:
+	sprintf (s, "%u", *(unsigned int *) v);
+	break;
+ case SLANG_LONG_TYPE:
+	sprintf (s, "%ld", *(long *) v);
+	break;
+ case SLANG_ULONG_TYPE:
+	sprintf (s, "%lu", *(unsigned long *) v);
+	break;
+#ifdef HAVE_LONG_LONG
+ case SLANG_LLONG_TYPE:
+	sprintf (s, SLFMT_LLD, *(long long *) v);
+	break;
+ case SLANG_ULLONG_TYPE:
+	sprintf (s, SLFMT_LLU, *(unsigned long long *) v);
+	break;
+#endif
+#if SLANG_HAS_FLOAT
+ case SLANG_FLOAT_TYPE:
+	if (Double_Format_Ptr == NULL)
+	 default_format_float (*(float *)v, buf, sizeof(buf));
+	else if (EOF == SLsnprintf (buf, sizeof (buf), Double_Format, *(float *) v))
+	 sprintf (s, "%e", *(float *) v);
+	break;
+ case SLANG_DOUBLE_TYPE:
+	if (Double_Format_Ptr == NULL)
+	 default_format_double (*(double *)v, buf, sizeof(buf));
+	else if (EOF == SLsnprintf (buf, sizeof (buf), Double_Format, *(double *) v))
+	 sprintf (s, "%e", *(double *) v);
+	break;
+#endif
+ }
+
+ return SLmake_string (s);
+}
+#if defined(__GNUC__)
+# pragma GCC diagnostic warning "-Wformat-nonliteral"
+#endif
+
+static int integer_to_bool (SLtype type, int *t)
+{
+ (void) type;
+ return SLang_pop_integer (t);
+}
+
+/* Note that integer literals are all stored in the byte-code as longs. This
+ * is why it is necessary to use *(long*).
+ */
+static int push_int_literal (SLtype type, VOID_STAR ptr)
+{
+ return SLclass_push_int_obj (type, (int) *(long *) ptr);
+}
+
+static int push_char_literal (SLtype type, VOID_STAR ptr)
+{
+ return SLclass_push_char_obj (type, (char) *(long *) ptr);
+}
+
+#if SHORT_IS_NOT_INT
+static int push_short_literal (SLtype type, VOID_STAR ptr)
+{
+ return SLclass_push_short_obj (type, (short) *(long *) ptr);
+}
+#endif
+
+#if LONG_IS_NOT_INT
+static int push_long_literal (SLtype type, VOID_STAR ptr)
+{
+ return SLclass_push_long_obj (type, *(long *) ptr);
+}
+#endif
+
+#ifdef HAVE_LONG_LONG
+#if LLONG_IS_NOT_LONG
+static int push_llong_literal (SLtype type, VOID_STAR ptr)
+{
+ return SLclass_push_llong_obj (type, **(long long **)ptr);
+}
+#endif
+#endif
+typedef struct
+{
+ SLFUTURE_CONST char *name;
+ SLtype data_type;
+ unsigned int sizeof_type;
+ int (*unary_fun)(int, SLtype, VOID_STAR, SLuindex_Type, VOID_STAR);
+ int (*push_literal) (SLtype, VOID_STAR);
+ void (*byte_code_destroy)(SLtype, VOID_STAR);
+ int (*cmp_fun) (SLtype, VOID_STAR, VOID_STAR, int *);
+}
+Integer_Info_Type;
+
+#ifdef HAVE_LONG_LONG
+# define NUM_INTEGER_TYPES 10
+#else
+# define NUM_INTEGER_TYPES 8
+#endif
+static Integer_Info_Type Integer_Types NUM_INTEGER_TYPES =
+{
+ {"Char_Type", SLANG_CHAR_TYPE, sizeof (char), char_unary_op, push_char_literal, NULL, char_cmp_function},
+ {"UChar_Type", SLANG_UCHAR_TYPE, sizeof (unsigned char), uchar_unary_op, push_char_literal, NULL, uchar_cmp_function},
+#if SHORT_IS_NOT_INT
+ {"Short_Type", SLANG_SHORT_TYPE, sizeof (short), short_unary_op, push_short_literal, NULL, short_cmp_function},
+ {"UShort_Type", SLANG_USHORT_TYPE, sizeof (unsigned short), ushort_unary_op, push_short_literal, NULL, ushort_cmp_function},
+#else
+ {NULL, SLANG_SHORT_TYPE, 0, NULL, NULL, NULL, NULL},
+ {NULL, SLANG_USHORT_TYPE, 0, NULL, NULL, NULL, NULL},
+#endif
+
+ {"Integer_Type", SLANG_INT_TYPE, sizeof (int), int_unary_op, push_int_literal, NULL, int_cmp_function},
+ {"UInteger_Type", SLANG_UINT_TYPE, sizeof (unsigned int), uint_unary_op, push_int_literal, NULL, uint_cmp_function},
+
+#if LONG_IS_NOT_INT
+ {"Long_Type", SLANG_LONG_TYPE, sizeof (long), long_unary_op, push_long_literal, NULL, long_cmp_function},
+ {"ULong_Type", SLANG_ULONG_TYPE, sizeof (unsigned long), ulong_unary_op, push_long_literal, NULL, ulong_cmp_function},
+#else
+ {NULL, SLANG_LONG_TYPE, 0, NULL, NULL, NULL, NULL},
+ {NULL, SLANG_ULONG_TYPE, 0, NULL, NULL, NULL, NULL},
+#endif
+#ifdef HAVE_LONG_LONG
+# if LLONG_IS_NOT_LONG
+ {"LLong_Type", SLANG_LLONG_TYPE, sizeof (long long), llong_unary_op, push_llong_literal, llong_byte_code_destroy, llong_cmp_function},
+ {"ULLong_Type", SLANG_ULLONG_TYPE, sizeof (unsigned long long), ullong_unary_op, push_llong_literal, llong_byte_code_destroy, ullong_cmp_function},
+# else
+ {NULL, SLANG_LLONG_TYPE, 0, NULL, NULL, NULL, NULL},
+ {NULL, SLANG_ULLONG_TYPE, 0, NULL, NULL, NULL, NULL},
+# endif
+#endif
+};
+
+int _pSLformat_as_binary (unsigned int min_num_bits, int use_binary_prefix)
+{
+#ifdef HAVE_LONG_LONG
+ char buf 2*8*SIZEOF_LONG_LONG;
+#else
+ char buf 2*8*SIZEOF_LONG;
+#endif
+ char *bufp;
+ int ret;
+ unsigned int buflen;
+
+ bufp = buf;
+ buflen = sizeof(buf);
+ if (use_binary_prefix)
+ {
+	*bufp++ = '0';
+	*bufp++ = 'b';
+	buflen -= 2;
+ }
+
+ switch (SLang_peek_at_stack ())
+ {
+ default:
+ case SLANG_INT_TYPE:
+ case SLANG_UINT_TYPE:
+	 {
+	 unsigned int u;
+	 if (-1 == SLang_pop_uint (&u))
+	 return -1;
+	 ret = uint_to_binary (u, bufp, buflen, min_num_bits);
+	 }
+	break;
+
+ case SLANG_CHAR_TYPE:
+ case SLANG_UCHAR_TYPE:
+	 {
+	 unsigned char u;
+	 if (-1 == SLang_pop_uchar (&u))
+	 return -1;
+	 ret = uchar_to_binary (u, bufp, buflen, min_num_bits);
+	 }
+	break;
+
+ case SLANG_SHORT_TYPE:
+ case SLANG_USHORT_TYPE:
+	 {
+	 unsigned short u;
+	 if (-1 == SLang_pop_ushort (&u))
+	 return -1;
+	 ret = ushort_to_binary (u, bufp, buflen, min_num_bits);
+	 }
+	break;
+
+ case SLANG_LONG_TYPE:
+ case SLANG_ULONG_TYPE:
+	 {
+	 unsigned long u;
+	 if (-1 == SLang_pop_ulong (&u))
+	 return -1;
+	 ret = ulong_to_binary (u, bufp, buflen, min_num_bits);
+	 }
+	break;
+
+#ifdef HAVE_LONG_LONG
+ case SLANG_LLONG_TYPE:
+ case SLANG_ULLONG_TYPE:
+	 {
+	 unsigned long long u;
+	 if (-1 == SLang_pop_ulong_long (&u))
+	 return -1;
+	 ret = ullong_to_binary (u, bufp, buflen, min_num_bits);
+	 }
+	break;
+#endif
+ }
+ if (ret == -1)
+ {
+	SLang_verror (SL_INTERNAL_ERROR, "Buffer is not large enough for the binary representations");
+	return -1;
+ }
+
+ (void) SLang_push_string (buf);
+ return 0;
+}
+
+#if 0
+static void to_binary_string_intrin (void)
+{
+ unsigned int min_num_bits = 0;
+
+ if (SLang_Num_Function_Args == 2)
+ {
+	int n;
+	if (-1 == SLang_pop_int (&n))
+	 return;
+	if (n > 0)
+	 min_num_bits = (unsigned int) n;
+ }
+
+ (void) _pSLformat_as_binary (min_num_bits, 0);
+}
+#endif
+static int create_synonyms (void)
+{
+ static SLFUTURE_CONST char *names8 =
+ {
+	"Int16_Type", "UInt16_Type", "Int32_Type", "UInt32_Type",
+	"Int64_Type", "UInt64_Type",
+	"Float32_Type", "Float64_Type"
+ };
+ int types8;
+ unsigned int i;
+
+ memset ((char *) types, 0, sizeof (types));
+ /* The assumption is that sizeof(unsigned X) == sizeof (X) */
+ types0 = _pSLANG_INT16_TYPE;
+ types1 = _pSLANG_UINT16_TYPE;
+ types2 = _pSLANG_INT32_TYPE;
+ types3 = _pSLANG_UINT32_TYPE;
+ types4 = _pSLANG_INT64_TYPE;
+ types5 = _pSLANG_UINT64_TYPE;
+
+#if SLANG_HAS_FLOAT
+
+#if SIZEOF_FLOAT == 4
+ types6 = SLANG_FLOAT_TYPE;
+#else
+# if SIZEOF_DOUBLE == 4
+ types6 = SLANG_DOUBLE_TYPE;
+# endif
+#endif
+#if SIZEOF_FLOAT == 8
+ types7 = SLANG_FLOAT_TYPE;
+#else
+# if SIZEOF_DOUBLE == 8
+ types7 = SLANG_DOUBLE_TYPE;
+# endif
+#endif
+
+#endif
+
+ if ((-1 == SLclass_create_synonym ("Int_Type", SLANG_INT_TYPE))
+ || (-1 == SLclass_create_synonym ("UInt_Type", SLANG_UINT_TYPE)))
+ return -1;
+
+ for (i = 0; i < 8; i++)
+ {
+	if (typesi == 0) continue;
+
+	if (-1 == SLclass_create_synonym (namesi, typesi))
+	 return -1;
+ }
+
+ for (i = 0; i < MAX_ARITHMETIC_TYPES; i++)
+ {
+	Alias_Mapi = TABLE_INDEX_TO_TYPE(i);
+ }
+#if SHORT_IS_INT
+ Alias_Map TYPE_TO_TABLE_INDEX(SLANG_SHORT_TYPE) = SLANG_INT_TYPE;
+ Alias_Map TYPE_TO_TABLE_INDEX(SLANG_USHORT_TYPE) = SLANG_UINT_TYPE;
+ if ((-1 == SLclass_create_synonym ("Short_Type", SLANG_INT_TYPE))
+ || (-1 == SLclass_create_synonym ("UShort_Type", SLANG_UINT_TYPE))
+ || (-1 == _pSLclass_copy_class (SLANG_SHORT_TYPE, SLANG_INT_TYPE))
+ || (-1 == _pSLclass_copy_class (SLANG_USHORT_TYPE, SLANG_UINT_TYPE)))
+ return -1;
+#endif
+#if LONG_IS_INT
+ Alias_Map TYPE_TO_TABLE_INDEX(SLANG_LONG_TYPE) = SLANG_INT_TYPE;
+ Alias_Map TYPE_TO_TABLE_INDEX(SLANG_ULONG_TYPE) = SLANG_UINT_TYPE;
+ if ((-1 == SLclass_create_synonym ("Long_Type", SLANG_INT_TYPE))
+ || (-1 == SLclass_create_synonym ("ULong_Type", SLANG_UINT_TYPE))
+ || (-1 == _pSLclass_copy_class (SLANG_LONG_TYPE, SLANG_INT_TYPE))
+ || (-1 == _pSLclass_copy_class (SLANG_ULONG_TYPE, SLANG_UINT_TYPE)))
+ return -1;
+#endif
+#if LLONG_IS_LONG
+ Alias_Map TYPE_TO_TABLE_INDEX(SLANG_LLONG_TYPE) = _pSLANG_LONG_TYPE;
+ Alias_Map TYPE_TO_TABLE_INDEX(SLANG_ULLONG_TYPE) = _pSLANG_ULONG_TYPE;
+ if ((-1 == SLclass_create_synonym ("LLong_Type", _pSLANG_LONG_TYPE))
+ || (-1 == SLclass_create_synonym ("ULLong_Type", _pSLANG_ULONG_TYPE))
+ || (-1 == _pSLclass_copy_class (SLANG_LLONG_TYPE, _pSLANG_LONG_TYPE))
+ || (-1 == _pSLclass_copy_class (SLANG_ULLONG_TYPE, _pSLANG_ULONG_TYPE)))
+ return -1;
+#endif
+
+ return 0;
+}
+
+static SLang_Arith_Unary_Type Unary_Table =
+{
+ MAKE_ARITH_UNARY("abs", SLANG_ABS),
+ MAKE_ARITH_UNARY("sign", SLANG_SIGN),
+ MAKE_ARITH_UNARY("sqr", SLANG_SQR),
+ MAKE_ARITH_UNARY("mul2", SLANG_MUL2),
+ MAKE_ARITH_UNARY("chs", SLANG_CHS),
+ MAKE_ARITH_UNARY("_ispos", SLANG_ISPOS),
+ MAKE_ARITH_UNARY("_isneg", SLANG_ISNEG),
+ MAKE_ARITH_UNARY("_isnonneg", SLANG_ISNONNEG),
+ SLANG_END_ARITH_UNARY_TABLE
+};
+
+static SLang_Arith_Binary_Type Binary_Table =
+{
+ MAKE_ARITH_BINARY("_op_plus", SLANG_PLUS),
+ MAKE_ARITH_BINARY("_op_minus", SLANG_MINUS),
+ MAKE_ARITH_BINARY("_op_times", SLANG_TIMES),
+ MAKE_ARITH_BINARY("_op_divide", SLANG_DIVIDE),
+ MAKE_ARITH_BINARY("_op_eqs", SLANG_EQ),
+ MAKE_ARITH_BINARY("_op_neqs", SLANG_NE),
+ MAKE_ARITH_BINARY("_op_gt", SLANG_GT),
+ MAKE_ARITH_BINARY("_op_ge", SLANG_GE),
+ MAKE_ARITH_BINARY("_op_lt", SLANG_LT),
+ MAKE_ARITH_BINARY("_op_le", SLANG_LE),
+ MAKE_ARITH_BINARY("_op_pow", SLANG_POW),
+ MAKE_ARITH_BINARY("_op_or", SLANG_OR),
+ MAKE_ARITH_BINARY("_op_and", SLANG_AND),
+ MAKE_ARITH_BINARY("_op_band", SLANG_BAND),
+ MAKE_ARITH_BINARY("_op_bor", SLANG_BOR),
+ MAKE_ARITH_BINARY("_op_xor", SLANG_BXOR),
+ MAKE_ARITH_BINARY("_op_shl", SLANG_SHL),
+ MAKE_ARITH_BINARY("_op_shr", SLANG_SHR),
+ MAKE_ARITH_BINARY("_op_mod", SLANG_MOD),
+ SLANG_END_ARITH_BINARY_TABLE
+};
+
+static SLang_Intrin_Fun_Type Intrinsic_Table =
+{
+#if 0				 /* need to think of a better name */
+ MAKE_INTRINSIC_0("to_binary_string", to_binary_string_intrin, SLANG_VOID_TYPE),
+#endif
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static SLang_IConstant_Type IConst_Table =
+{
+#if defined(SHRT_MIN) && defined(SHRT_MAX)
+ MAKE_HCONSTANT_T("SHORT_MIN", SHRT_MIN, SLANG_SHORT_TYPE),
+ MAKE_HCONSTANT_T("SHORT_MAX", SHRT_MAX, SLANG_SHORT_TYPE),
+#endif
+#if defined(USHRT_MAX)
+ MAKE_HCONSTANT_T("USHORT_MAX", USHRT_MAX, SLANG_USHORT_TYPE),
+#endif
+#if defined(INT_MIN) && defined(INT_MAX)
+ MAKE_ICONSTANT_T("INT_MIN", INT_MIN, SLANG_INT_TYPE),
+ MAKE_ICONSTANT_T("INT_MAX", INT_MAX, SLANG_INT_TYPE),
+#endif
+#if defined(UINT_MAX)
+ MAKE_ICONSTANT_T("UINT_MAX", UINT_MAX, SLANG_UINT_TYPE),
+#endif
+ SLANG_END_ICONST_TABLE
+};
+
+static SLang_LConstant_Type LConst_Table =
+{
+#if defined(LONG_MIN) && defined(LONG_MAX)
+ MAKE_LCONSTANT_T("LONG_MIN", LONG_MIN, _pSLANG_LONG_TYPE),
+ MAKE_LCONSTANT_T("LONG_MAX", LONG_MAX, _pSLANG_LONG_TYPE),
+#endif
+#if defined(ULONG_MAX)
+ MAKE_LCONSTANT_T("ULONG_MAX", ULONG_MAX, _pSLANG_ULONG_TYPE),
+#endif
+ SLANG_END_LCONST_TABLE
+};
+
+#ifdef HAVE_LONG_LONG
+# ifndef LLONG_MAX
+# if (SIZEOF_LONG_LONG == 8)
+# define LLONG_MAX 9223372036854775807LL
+/* C90 does not have positive constants-- only negated negative ones. Hence,
+ * LLONG_MIN is -9223372036854775808LL, but 9223372036854775808LL is too big.
+ */
+# define LLONG_MIN (-LLONG_MAX - 1LL)
+# define ULLONG_MAX 18446744073709551615ULL
+# endif
+# endif
+static _pSLang_LLConstant_Type LLConst_Table =
+{
+#if defined(LLONG_MIN) && defined(LLONG_MAX)
+ _pMAKE_LLCONSTANT_T("LLONG_MIN", LLONG_MIN, SLANG_LLONG_TYPE),
+ _pMAKE_LLCONSTANT_T("LLONG_MAX", LLONG_MAX, SLANG_LLONG_TYPE),
+#endif
+#if defined(ULLONG_MAX)
+ _pMAKE_LLCONSTANT_T("ULLONG_MAX", ULLONG_MAX, SLANG_ULLONG_TYPE),
+#endif
+ _pSLANG_END_LLCONST_TABLE
+};
+#endif
+
+static SLang_FConstant_Type FConst_Table =
+{
+#if defined(FLT_MIN) && defined(FLT_MAX)
+ MAKE_FCONSTANT("FLOAT_MIN", FLT_MIN),
+ MAKE_FCONSTANT("FLOAT_MAX", FLT_MAX),
+#endif
+#if defined(FLT_EPSILON)
+ MAKE_FCONSTANT("FLOAT_EPSILON", FLT_EPSILON),
+#endif
+ SLANG_END_FCONST_TABLE
+};
+
+static SLang_DConstant_Type DConst_Table =
+{
+#if defined(DBL_MIN) && defined(DBL_MAX)
+ MAKE_DCONSTANT("DOUBLE_MIN", DBL_MIN),
+ MAKE_DCONSTANT("DOUBLE_MAX", DBL_MAX),
+#endif
+#if defined(DBL_EPSILON)
+ MAKE_DCONSTANT("DOUBLE_EPSILON", DBL_EPSILON),
+#endif
+ SLANG_END_DCONST_TABLE
+};
+
+static void compute_inf_an_nan (void)
+{
+#if SLANG_HAS_FLOAT
+ volatile double nan_val, inf_val;
+# if SLANG_HAS_IEEE_FP
+ volatile double big;
+ unsigned int max_loops = 256;
+
+ big = 1e16;
+ inf_val = 1.0;
+
+ while (max_loops)
+ {
+	max_loops--;
+	big *= 1e16;
+	if (inf_val == big)
+	 break;
+	inf_val = big;
+ }
+ if (max_loops == 0)
+ {
+	inf_val = DBL_MAX;
+	nan_val = DBL_MAX;
+ }
+ else nan_val = inf_val/inf_val;
+# else
+ inf_val = DBL_MAX;
+ nan_val = DBL_MAX;
+# endif
+ _pSLang_NaN = nan_val;
+ _pSLang_Inf = inf_val;
+#endif
+}
+
+int _pSLarith_register_types (void)
+{
+ SLang_Class_Type *cl;
+ SLtype a_type, b_type;
+ int i, j;
+
+#if defined(HAVE_SETLOCALE) && defined(LC_NUMERIC)
+ /* make sure decimal point it used --- the parser requires it */
+ (void) setlocale (LC_NUMERIC, "C");
+#endif
+
+ for (i = 0; i < NUM_INTEGER_TYPES; i++)
+ {
+	Integer_Info_Type *info;
+
+	info = Integer_Types + i;
+
+	_pSLang_set_arith_type (info->data_type, 1);
+
+	if (info->name == NULL)
+	 {
+	 /* This happens when the object is the same size as an integer
+	 * For this case, we really want to copy the integer class.
+	 * We will handle that when the synonym is created.
+	 */
+	 continue;
+	 }
+
+	if (NULL == (cl = SLclass_allocate_class (info->name)))
+	 return -1;
+
+	(void) SLclass_set_string_function (cl, arith_string);
+	(void) SLclass_set_push_function (cl, integer_push);
+	(void) SLclass_set_pop_function (cl, integer_pop);
+	cl->cl_push_literal = info->push_literal;
+	cl->cl_to_bool = integer_to_bool;
+	cl->cl_byte_code_destroy = info->byte_code_destroy;
+
+	cl->cl_cmp = info->cmp_fun;
+
+	if (-1 == SLclass_register_class (cl, info->data_type, info->sizeof_type,
+					 SLANG_CLASS_TYPE_SCALAR))
+	 return -1;
+	if (-1 == SLclass_add_unary_op (info->data_type, info->unary_fun, arith_unary_op_result))
+	 return -1;
+#if 0
+	if (-1 == _pSLclass_add_arith_unary_op (info->data_type, info->arith_unary_fun, arith_unary_arith_op_result))
+	 return -1;
+#endif
+ }
+
+#if SLANG_HAS_FLOAT
+ if (NULL == (cl = SLclass_allocate_class ("Double_Type")))
+ return -1;
+ (void) SLclass_set_push_function (cl, double_push);
+ (void) SLclass_set_pop_function (cl, double_pop);
+ (void) SLclass_set_string_function (cl, arith_string);
+ cl->cl_byte_code_destroy = double_byte_code_destroy;
+ cl->cl_push_literal = double_push_literal;
+ cl->cl_cmp = double_cmp_function;
+
+ if (-1 == SLclass_register_class (cl, SLANG_DOUBLE_TYPE, sizeof (double),
+				 SLANG_CLASS_TYPE_SCALAR))
+ return -1;
+ if (-1 == SLclass_add_unary_op (SLANG_DOUBLE_TYPE, double_unary_op, arith_unary_op_result))
+ return -1;
+#if 0
+ if (-1 == _pSLclass_add_arith_unary_op (SLANG_DOUBLE_TYPE, double_arith_unary_op, arith_unary_op_result))
+ return -1;
+#endif
+ _pSLang_set_arith_type (SLANG_DOUBLE_TYPE, 2);
+
+ if (NULL == (cl = SLclass_allocate_class ("Float_Type")))
+ return -1;
+ (void) SLclass_set_string_function (cl, arith_string);
+ (void) SLclass_set_push_function (cl, float_push);
+ (void) SLclass_set_pop_function (cl, float_pop);
+ cl->cl_cmp = float_cmp_function;
+
+ if (-1 == SLclass_register_class (cl, SLANG_FLOAT_TYPE, sizeof (float),
+				 SLANG_CLASS_TYPE_SCALAR))
+ return -1;
+ if (-1 == SLclass_add_unary_op (SLANG_FLOAT_TYPE, float_unary_op, arith_unary_op_result))
+ return -1;
+#if 0
+ if (-1 == _pSLclass_add_arith_unary_op (SLANG_FLOAT_TYPE, float_arith_unary_op, arith_unary_op_result))
+ return -1;
+#endif
+ _pSLang_set_arith_type (SLANG_FLOAT_TYPE, 2);
+#endif
+
+ if (-1 == create_synonyms ())
+ return -1;
+
+ for (i = 0; i < MAX_ARITHMETIC_TYPES; i++)
+ {
+	a_type = _pSLarith_Arith_Typesi;
+#if 0
+	if (Alias_MapTYPE_TO_TABLE_INDEX(a_type) != a_type)
+	 continue;
+#endif
+	if (a_type == 0)
+	 continue;
+
+	for (j = 0; j < MAX_ARITHMETIC_TYPES; j++)
+	 {
+	 int implicit_ok;
+
+	 b_type = _pSLarith_Arith_Typesj;
+	 if (b_type == 0)
+	 continue;
+	 /* Allow implicit typecast, except from int to float */
+	 implicit_ok = ((b_type >= SLANG_FLOAT_TYPE)
+			 || (a_type < SLANG_FLOAT_TYPE));
+
+	 if (-1 == SLclass_add_binary_op (a_type, b_type, arith_bin_op, arith_bin_op_result))
+	 return -1;
+
+	 if (a_type != b_type)
+	 if (-1 == SLclass_add_typecast (a_type, b_type, _pSLarith_typecast, implicit_ok))
+		 return -1;
+	 }
+ }
+
+ if (-1 == SLadd_intrin_fun_table (Intrinsic_Table, NULL))
+ return -1;
+ if (-1 == _pSLadd_arith_unary_table (Unary_Table, NULL))
+ return -1;
+ if (-1 == _pSLadd_arith_binary_table (Binary_Table, NULL))
+ return -1;
+
+ if ((-1 == SLadd_iconstant_table (IConst_Table, NULL))
+ || (-1 == SLadd_lconstant_table (LConst_Table, NULL))
+#if SLANG_HAS_FLOAT
+ || (-1 == SLadd_fconstant_table (FConst_Table, NULL))
+ || (-1 == SLadd_dconstant_table (DConst_Table, NULL))
+#endif
+#ifdef HAVE_LONG_LONG
+ || (-1 == _pSLadd_llconstant_table (LLConst_Table, NULL))
+#endif
+ )
+ return -1;
+
+ compute_inf_an_nan ();
+
+ return 0;
+}
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+
+static void promote_objs (SLang_Object_Type *a, SLang_Object_Type *b,
+			 SLang_Object_Type *c, SLang_Object_Type *d)
+{
+ SLtype ia, ib, ic, id;
+ int i, j;
+ void (*copy)(VOID_STAR, VOID_STAR, unsigned int);
+
+ ia = a->o_data_type;
+ ib = b->o_data_type;
+
+ ic = _pSLarith_promote_type (ia);
+
+ if (ic == ib) id = ic;	 /* already promoted */
+ else id = _pSLarith_promote_type (ib);
+
+ i = TYPE_TO_TABLE_INDEX(ic);
+ j = TYPE_TO_TABLE_INDEX(id);
+ if (i > j)
+ {
+	id = ic;
+	j = i;
+ }
+
+ c->o_data_type = d->o_data_type = id;
+
+ i = TYPE_TO_TABLE_INDEX(ia);
+ copy = (void (*)(VOID_STAR, VOID_STAR, unsigned int))
+ Binary_Matrixij.copy_function;
+ (*copy) ((VOID_STAR) &c->v, (VOID_STAR)&a->v, 1);
+
+ i = TYPE_TO_TABLE_INDEX(ib);
+ copy = (void (*)(VOID_STAR, VOID_STAR, unsigned int))
+ Binary_Matrixij.copy_function;
+ (*copy) ((VOID_STAR) &d->v, (VOID_STAR)&b->v, 1);
+}
+
+/* Crazy return value: returns 1 if operation not supported by this function,
+ * 0 if it is and was sucessful, or -1 if something went wrong
+ */
+int _pSLarith_bin_op (SLang_Object_Type *oa, SLang_Object_Type *ob, int op)
+{
+ SLtype a_type, b_type;
+ SLang_Object_Type obj_a, obj_b;
+
+ a_type = oa->o_data_type;
+ b_type = ob->o_data_type;
+
+ if (a_type != b_type)
+ {
+	/* Handle common cases */
+#if SLANG_HAS_FLOAT
+	if ((a_type == SLANG_INT_TYPE)
+	 && (b_type == SLANG_DOUBLE_TYPE))
+	 return double_double_scalar_bin_op (oa->v.int_val, ob->v.double_val, op);
+
+	if ((a_type == SLANG_DOUBLE_TYPE)
+	 && (b_type == SLANG_INT_TYPE))
+	 return double_double_scalar_bin_op (oa->v.double_val, ob->v.int_val, op);
+#endif
+	/* Otherwise do it the hard way */
+	promote_objs (oa, ob, &obj_a, &obj_b);
+	oa = &obj_a;
+	ob = &obj_b;
+
+	a_type = oa->o_data_type;
+	/* b_type = ob->data_type; */
+ }
+
+ switch (a_type)
+ {
+ case SLANG_CHAR_TYPE:
+	return int_int_scalar_bin_op (oa->v.char_val, ob->v.char_val, op);
+
+ case SLANG_UCHAR_TYPE:
+	return int_int_scalar_bin_op (oa->v.uchar_val, ob->v.uchar_val, op);
+
+ case SLANG_SHORT_TYPE:
+	return int_int_scalar_bin_op (oa->v.short_val, ob->v.short_val, op);
+
+ case SLANG_USHORT_TYPE:
+# if SHORT_IS_INT
+	return uint_uint_scalar_bin_op (oa->v.ushort_val, ob->v.ushort_val, op);
+# else
+	return int_int_scalar_bin_op ((int)oa->v.ushort_val, (int)ob->v.ushort_val, op);
+# endif
+
+#if LONG_IS_INT
+ case SLANG_LONG_TYPE:
+#endif
+ case SLANG_INT_TYPE:
+	return int_int_scalar_bin_op (oa->v.int_val, ob->v.int_val, op);
+
+#if LONG_IS_INT
+ case SLANG_ULONG_TYPE:
+#endif
+ case SLANG_UINT_TYPE:
+	return uint_uint_scalar_bin_op (oa->v.uint_val, ob->v.uint_val, op);
+
+#if LONG_IS_NOT_INT
+ case SLANG_LONG_TYPE:
+	return long_long_scalar_bin_op (oa->v.long_val, ob->v.long_val, op);
+ case SLANG_ULONG_TYPE:
+	return ulong_ulong_scalar_bin_op (oa->v.ulong_val, ob->v.ulong_val, op);
+#endif
+#ifdef HAVE_LONG_LONG
+ case SLANG_LLONG_TYPE:
+	return llong_llong_scalar_bin_op (oa->v.llong_val, ob->v.llong_val, op);
+ case SLANG_ULLONG_TYPE:
+	return ullong_ullong_scalar_bin_op (oa->v.ullong_val, ob->v.ullong_val, op);
+#endif
+#if SLANG_HAS_FLOAT
+ case SLANG_FLOAT_TYPE:
+	return float_float_scalar_bin_op (oa->v.float_val, ob->v.float_val, op);
+ case SLANG_DOUBLE_TYPE:
+	return double_double_scalar_bin_op (oa->v.double_val, ob->v.double_val, op);
+#endif
+ }
+
+ return 1;
+}
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/slarith.inc Added

@@ -0,0 +1,879 @@
+/* -*- c -*- */
+
+/* This include file is a template for defining arithmetic binary operations
+ * on arithmetic types. I realize that doing it this way is not very
+ * elegant but it minimizes the number of lines of code and I believe it
+ * promotes clarity.
+ */
+
+/* The following macros should be properly defined before including this file:
+ *
+ * GENERIC_BINARY_FUNCTION: The name of the binary function
+ * GENERIC_TYPE: The class data type
+ * MOD_FUNCTION:	 The function to use for mod
+ * ABS_FUNCTION: Name of the abs function
+ * SIGN_FUNCTION: Name of the sign function
+ * GENERIC_UNARY_FUNCTION Name of the unary function
+ *
+ * If GENERIC_BIT_OPERATIONS is defined, the bit-level binary operators
+ * will get included. If the data type has a power operation (SLANG_POW),
+ * then POW_FUNCTION should be defined to return POW_RESULT_TYPE. The code
+ * below assumes that POW_RESULT_TYPE is a floating point type,
+ * with intermediate computations performed in double precision.
+ *
+ * If division by zero errors should be trapped, the define TRAP_DIV_ZERO to 1
+ */
+#ifdef GENERIC_BINARY_FUNCTION
+
+static int GENERIC_BINARY_FUNCTION
+ (int op,
+ SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+ SLtype b_type, VOID_STAR bp, SLuindex_Type nb,
+ VOID_STAR cp)
+{
+ GENERIC_TYPE *a, *b;
+# ifndef JUST_BOOLEAN_BINARY_OPS
+ GENERIC_TYPE *c;
+# endif
+# ifdef POW_FUNCTION
+ POW_RESULT_TYPE *d;
+# endif
+ SLuindex_Type n;
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+ SLuindex_Type n_max, da, db;
+# endif
+ char *cc;
+
+ (void) a_type;		 /* Both SLANG_INT_TYPE */
+ (void) b_type;
+
+ a = (GENERIC_TYPE *) ap;
+ b = (GENERIC_TYPE *) bp;
+#ifndef JUST_BOOLEAN_BINARY_OPS
+ c = (GENERIC_TYPE *) cp;
+#endif
+ cc = (char *) cp;
+
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+ if (na == 1) da = 0; else da = 1;
+ if (nb == 1) db = 0; else db = 1;
+
+ if (na > nb) n_max = na; else n_max = nb;
+# endif
+
+ switch (op)
+ {
+ default:
+	return 0;
+# if !defined(JUST_BOOLEAN_BINARY_OPS)
+# ifdef POW_FUNCTION
+ case SLANG_POW:
+	d = (POW_RESULT_TYPE *) cp;
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 dn = POW_FUNCTION(*a, *b);
+	 a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 dn = POW_FUNCTION(an,bn);
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 if (xb == 2)
+	 for (n = 0; n < na; n++)
+		 dn = (double)an * (double)an;
+	 else
+	 for (n = 0; n < na; n++)
+		 dn = POW_FUNCTION(an, xb);
+	 }
+	else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 dn = POW_FUNCTION(xa, bn);
+	 }
+# endif
+	break;
+# endif
+ case SLANG_PLUS:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 cn = (*a + *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 cn = an + bn;
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 cn = an + xb;
+	 }
+	else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 cn = xa + bn;
+	 }
+# endif
+	break;
+
+ case SLANG_MINUS:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 cn = (*a - *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 cn = an - bn;
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 cn = an - xb;
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 cn = xa - bn;
+	 }
+# endif
+	break;
+
+ case SLANG_TIMES:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 cn = (*a * *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 cn = an * bn;
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 cn = an * xb;
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 cn = xa * bn;
+	 }
+# endif
+	break;
+
+ case SLANG_DIVIDE:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+# if TRAP_DIV_ZERO
+	 if (*b == 0)
+	 {
+		 SLang_set_error (SL_DIVIDE_ERROR);
+		 return -1;
+	 }
+# endif
+	 cn = (*a / *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 {
+# if TRAP_DIV_ZERO
+		 if (bn == 0)
+		 {
+		 SLang_set_error (SL_DIVIDE_ERROR);
+		 return -1;
+		 }
+# endif
+		 cn = an / bn;
+	 }
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+# if TRAP_DIV_ZERO
+	 if (xb == 0)
+	 {
+		 SLang_set_error (SL_DIVIDE_ERROR);
+		 return -1;
+	 }
+# endif
+	 for (n = 0; n < na; n++)
+	 cn = an / xb;
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 {
+# if TRAP_DIV_ZERO
+		 if (bn == 0)
+		 {
+		 SLang_set_error (SL_DIVIDE_ERROR);
+		 return -1;
+		 }
+# endif
+		 cn = xa / bn;
+	 }
+	 }
+# endif
+	break;
+
+ case SLANG_MOD:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+# if TRAP_DIV_ZERO
+	 if (*b == 0)
+	 {
+		 SLang_set_error (SL_DIVIDE_ERROR);
+		 return -1;
+	 }
+# endif
+	 cn = MOD_FUNCTION(*a, *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 {
+# if TRAP_DIV_ZERO
+		 if (bn == 0)
+		 {
+		 SLang_set_error (SL_DIVIDE_ERROR);
+		 return -1;
+		 }
+# endif
+		 cn = MOD_FUNCTION(an,bn);
+	 }
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+# if TRAP_DIV_ZERO
+	 if (xb == 0)
+	 {
+		 SLang_set_error (SL_DIVIDE_ERROR);
+		 return -1;
+	 }
+# endif
+	 for (n = 0; n < na; n++)
+	 cn = MOD_FUNCTION(an,xb);
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 {
+# if TRAP_DIV_ZERO
+		 if (bn == 0)
+		 {
+		 SLang_set_error (SL_DIVIDE_ERROR);
+		 return -1;
+		 }
+# endif
+		 cn = MOD_FUNCTION(xa,bn);
+	 }
+	 }
+# endif
+	break;
+
+# ifdef GENERIC_BIT_OPERATIONS
+ case SLANG_BAND:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 cn = (*a & *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 cn = an & bn;
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 cn = an & xb;
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 cn = xa & bn;
+	 }
+# endif
+	break;
+
+ case SLANG_BXOR:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 cn = (*a ^ *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 cn = an ^ bn;
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 cn = an ^ xb;
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 cn = xa ^ bn;
+	 }
+# endif
+	break;
+
+ case SLANG_BOR:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 cn = (*a | *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 cn = an | bn;
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 cn = an | xb;
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 cn = xa | bn;
+	 }
+# endif
+	break;
+
+ case SLANG_SHL:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 cn = (*a << *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 cn = an << bn;
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 cn = an << xb;
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 cn = xa << bn;
+	 }
+# endif
+	break;
+
+ case SLANG_SHR:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 cn = (*a >> *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 cn = an >> bn;
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 cn = an >> xb;
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 cn = xa >> bn;
+	 }
+# endif
+	break;
+# endif 			 /* GENERIC_BIT_OPERATIONS */
+ case SLANG_GT:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 ccn = (*a > *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 ccn = (an > bn);
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 ccn = (an > xb);
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 ccn = (xa > bn);
+	 }
+# endif
+	break;
+
+ case SLANG_GE:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 ccn = (*a >= *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 ccn = (an >= bn);
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 ccn = (an >= xb);
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 ccn = (xa >= bn);
+	 }
+# endif
+	break;
+
+ case SLANG_LT:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 ccn = (*a < *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 ccn = (an < bn);
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 ccn = (an < xb);
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 ccn = (xa < bn);
+	 }
+# endif
+	break;
+
+ case SLANG_LE:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 ccn = (*a <= *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 ccn = (an <= bn);
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 ccn = (an <= xb);
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 ccn = (xa <= bn);
+	 }
+# endif
+	break;
+# endif			 /* !defined(JUST_BOOLEAN_BINARY_OPS) */
+
+	/* Boolean operations */
+ case SLANG_EQ:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 ccn = (*a == *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 ccn = (an == bn);
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 ccn = (an == xb);
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 ccn = (xa == bn);
+	 }
+# endif
+	break;
+
+ case SLANG_NE:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 ccn = (*a != *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 ccn = (an != bn);
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 ccn = (an != xb);
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 ccn = (xa != bn);
+	 }
+# endif
+	break;
+
+ case SLANG_OR:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 ccn = (*a || *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 ccn = (an || bn);
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 ccn = (an || xb);
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 ccn = (xa || bn);
+	 }
+# endif
+	break;
+
+ case SLANG_AND:
+# if SLANG_OPTIMIZE_FOR_SPEED < 2
+	for (n = 0; n < n_max; n++)
+	 {
+	 ccn = (*a && *b); a += da; b += db;
+	 }
+# else
+	if (na == nb)
+	 {
+	 for (n = 0; n < na; n++)
+	 ccn = (an && bn);
+	 }
+	else if (nb == 1)
+	 {
+	 GENERIC_TYPE xb = *b;
+	 for (n = 0; n < na; n++)
+	 ccn = (an && xb);
+	 }
+ else /* if (na == 1) */
+	 {
+	 GENERIC_TYPE xa = *a;
+	 for (n = 0; n < nb; n++)
+	 ccn = (xa && bn);
+	 }
+# endif
+	break;
+ }
+ return 1;
+}
+
+#endif				 /* GENERIC_BINARY_FUNCTION */
+
+#ifdef GENERIC_UNARY_FUNCTION
+
+static int GENERIC_UNARY_FUNCTION
+ (int op,
+ SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+ VOID_STAR bp
+ )
+{
+ GENERIC_TYPE *a, *b;
+ SLuindex_Type n;
+ int *ib;
+ char *cb;
+
+ (void) a_type;
+
+ a = (GENERIC_TYPE *) ap;
+ b = (GENERIC_TYPE *) bp;
+
+ switch (op)
+ {
+ default:
+	return 0;
+
+ case SLANG_PLUSPLUS:
+	for (n = 0; n < na; n++) bn = (an + 1);
+	break;
+ case SLANG_MINUSMINUS:
+	for (n = 0; n < na; n++) bn = (an - 1);
+	break;
+ case SLANG_ABS:
+	for (n = 0; n < na; n++) bn = ABS_FUNCTION (an);
+	break;
+ case SLANG_SIGN:
+	ib = (int *) bp;
+	for (n = 0; n < na; n++)
+	 ibn = SIGN_FUNCTION(an);
+	break;
+ case SLANG_SQR:
+	for (n = 0; n < na; n++) bn = (an * an);
+	break;
+ case SLANG_MUL2:
+	for (n = 0; n < na; n++) bn = (2 * an);
+	break;
+ case SLANG_CHS:
+	for (n = 0; n < na; n++) bn = (GENERIC_TYPE) -(an);
+	break;
+
+ case SLANG_NOT:
+	cb = (char *) bp;
+	for (n = 0; n < na; n++) cbn = (an == 0);
+	break;
+
+# ifdef GENERIC_BIT_OPERATIONS
+ case SLANG_BNOT:
+	for (n = 0; n < na; n++) bn = ~(an);
+	break;
+# endif
+ case SLANG_ISPOS:
+	cb = (char *) bp;
+	for (n = 0; n < na; n++) cbn = (an > 0);
+	break;
+ case SLANG_ISNEG:
+	cb = (char *) bp;
+# ifdef GENERIC_TYPE_IS_UNSIGNED
+	for (n = 0; n < na; n++) cbn = 0;
+# else
+	for (n = 0; n < na; n++) cbn = (an < 0);
+# endif
+	break;
+ case SLANG_ISNONNEG:
+	cb = (char *) bp;
+# ifdef GENERIC_TYPE_IS_UNSIGNED
+	for (n = 0; n < na; n++) cbn = 1;
+# else
+	for (n = 0; n < na; n++) cbn = (an >= 0);
+# endif
+	break;
+ }
+
+ return 1;
+}
+#endif				 /* GENERIC_UNARY_FUNCTION */
+
+#ifdef SCALAR_BINARY_FUNCTION
+
+static int SCALAR_BINARY_FUNCTION (GENERIC_TYPE a, GENERIC_TYPE b, int op)
+{
+ switch (op)
+ {
+ default:
+	return 1;
+# if SLANG_HAS_FLOAT
+# ifdef POW_FUNCTION
+ case SLANG_POW:
+	return PUSH_POW_OBJ_FUN(POW_FUNCTION(a, b));
+# endif
+# endif
+ case SLANG_PLUS:
+	return PUSH_SCALAR_OBJ_FUN (a + b);
+ case SLANG_MINUS:
+	return PUSH_SCALAR_OBJ_FUN (a - b);
+ case SLANG_TIMES:
+	return PUSH_SCALAR_OBJ_FUN (a * b);
+ case SLANG_DIVIDE:
+# if TRAP_DIV_ZERO
+	if (b == 0)
+	 {
+	 SLang_set_error (SL_DIVIDE_ERROR);
+	 return -1;
+	 }
+# endif
+	return PUSH_SCALAR_OBJ_FUN (a / b);
+ case SLANG_MOD:
+# if TRAP_DIV_ZERO
+	if (b == 0)
+	 {
+	 SLang_set_error (SL_DIVIDE_ERROR);
+	 return -1;
+	 }
+# endif
+	return PUSH_SCALAR_OBJ_FUN (MOD_FUNCTION(a,b));
+# ifdef GENERIC_BIT_OPERATIONS
+ case SLANG_BAND:
+	return PUSH_SCALAR_OBJ_FUN (a & b);
+ case SLANG_BXOR:
+	return PUSH_SCALAR_OBJ_FUN (a ^ b);
+ case SLANG_BOR:
+	return PUSH_SCALAR_OBJ_FUN (a | b);
+ case SLANG_SHL:
+	return PUSH_SCALAR_OBJ_FUN (a << b);
+ case SLANG_SHR:
+	return PUSH_SCALAR_OBJ_FUN (a >> b);
+# endif
+ case SLANG_GT: return SLclass_push_char_obj (SLANG_CHAR_TYPE, (char)(a > b));
+ case SLANG_LT: return SLclass_push_char_obj (SLANG_CHAR_TYPE, (char)(a < b));
+ case SLANG_GE: return SLclass_push_char_obj (SLANG_CHAR_TYPE, (char)(a >= b));
+ case SLANG_LE: return SLclass_push_char_obj (SLANG_CHAR_TYPE, (char)(a <= b));
+ case SLANG_EQ: return SLclass_push_char_obj (SLANG_CHAR_TYPE, (char)(a == b));
+ case SLANG_NE: return SLclass_push_char_obj (SLANG_CHAR_TYPE, (char)(a != b));
+ case SLANG_OR: return SLclass_push_char_obj (SLANG_CHAR_TYPE, (char)(a || b));
+ case SLANG_AND: return SLclass_push_char_obj (SLANG_CHAR_TYPE, (char)(a && b));
+ }
+}
+
+#endif				 /* SCALAR_BINARY_FUNCTION */
+
+#ifdef CMP_FUNCTION
+static int CMP_FUNCTION (SLtype unused, VOID_STAR a, VOID_STAR b, int *c)
+{
+ GENERIC_TYPE x, y;
+
+ (void) unused;
+ x = *(GENERIC_TYPE *) a;
+ y = *(GENERIC_TYPE *) b;
+
+ if (x > y) *c = 1;
+ else if (x == y) *c = 0;
+ else *c = -1;
+
+ return 0;
+}
+#endif
+
+#ifdef TO_BINARY_FUNCTION
+static int TO_BINARY_FUNCTION (GENERIC_TYPE x, char *buf, unsigned int buflen,
+			 unsigned int min_num_bits)
+{
+ GENERIC_TYPE x1;
+ unsigned int nbits;
+ char *s;
+
+ nbits = 1;
+ x1 = x;
+ while (x1 >> 8) { x1 = x1 >> 8; nbits += 8; }
+ while (x1 >> 4) { x1 = x1 >> 4; nbits += 4; }
+ while (x1 >> 1) { x1 = x1 >> 1; nbits += 1; }
+
+ if (nbits >= buflen)
+ return -1;			 /* calling routine must issue error */
+
+ if (nbits < min_num_bits)
+ {
+	unsigned int dnbits = min_num_bits - nbits;
+	if (nbits + dnbits + 1 > buflen)
+	 dnbits = buflen - (nbits + 1);
+	nbits += dnbits;
+ }
+ s = buf + nbits;
+ *s = 0;
+ while (x)
+ {
+	*(--s) = '0' + (x & 1);
+	x = x >> 1;
+ }
+ while (s > buf)
+ *(--s) = '0';
+
+ return 0;
+}
+#endif
+
+#undef TO_BINARY_FUNCTION
+#undef CMP_FUNCTION
+#undef SCALAR_BINARY_FUNCTION
+#undef PUSH_POW_OBJ_FUN
+#undef PUSH_SCALAR_OBJ_FUN
+#undef GENERIC_BINARY_FUNCTION
+#undef GENERIC_UNARY_FUNCTION
+#undef GENERIC_BIT_OPERATIONS
+#undef GENERIC_TYPE
+#undef POW_FUNCTION
+#undef POW_RESULT_TYPE
+#undef MOD_FUNCTION
+#undef ABS_FUNCTION
+#undef SIGN_FUNCTION
+#undef GENERIC_TYPE_IS_UNSIGNED
+#undef GENERIC_ARITH_UNARY_FUNCTION
+#undef JUST_BOOLEAN_BINARY_OPS
+#undef TRAP_DIV_ZERO

_service:tar_scm:slang-2.3.2.tar.bz2/src/slarith2.inc Added

@@ -0,0 +1,1418 @@
+/* DO NOT EDIT -- this file was generated by src/util/mkslarith2.sl */
+/* ------------ signed char ---------- */
+DEFUN_1(copy_char_to_char,signed char,signed char)
+#define char_to_char	NULL
+#define copy_char_to_uchar	copy_char_to_char
+#define char_to_uchar	NULL
+DEFUN_1(copy_char_to_short,signed char,short)
+#define char_to_short	NULL
+DEFUN_1(copy_char_to_ushort,signed char,unsigned short)
+#define char_to_ushort	NULL
+DEFUN_1(copy_char_to_int,signed char,int)
+DEFUN_2(char_to_int,signed char,int,copy_char_to_int)
+DEFUN_1(copy_char_to_uint,signed char,unsigned int)
+DEFUN_2(char_to_uint,signed char,unsigned int,copy_char_to_uint)
+#if LONG_IS_INT
+# define copy_char_to_long copy_char_to_int
+#else
+DEFUN_1(copy_char_to_long,signed char,long)
+#endif
+#if LONG_IS_INT
+# define char_to_long char_to_int
+#else
+DEFUN_2(char_to_long,signed char,long,copy_char_to_long)
+#endif
+#if LONG_IS_INT
+# define copy_char_to_ulong copy_char_to_uint
+#else
+DEFUN_1(copy_char_to_ulong,signed char,unsigned long)
+#endif
+#if LONG_IS_INT
+# define char_to_ulong char_to_uint
+#else
+DEFUN_2(char_to_ulong,signed char,unsigned long,copy_char_to_ulong)
+#endif
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_char_to_llong,signed char,long long)
+DEFUN_2(char_to_llong,signed char,long long,copy_char_to_llong)
+#endif /* defined(HAVE_LONG_LONG) */
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_char_to_ullong,signed char,unsigned long long)
+DEFUN_2(char_to_ullong,signed char,unsigned long long,copy_char_to_ullong)
+#endif /* defined(HAVE_LONG_LONG) */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_char_to_float,signed char,float)
+DEFUN_2(char_to_float,signed char,float,copy_char_to_float)
+#endif /* SLANG_HAS_FLOAT */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_char_to_double,signed char,double)
+DEFUN_2(char_to_double,signed char,double,copy_char_to_double)
+#endif /* SLANG_HAS_FLOAT */
+#if defined(HAVE_LONG_DOUBLE)
+DEFUN_1(copy_char_to_ldouble,signed char,long double)
+DEFUN_2(char_to_ldouble,signed char,long double,copy_char_to_ldouble)
+#endif /* defined(HAVE_LONG_DOUBLE) */
+#if SLANG_HAS_FLOAT
+TO_DOUBLE_FUN(char_to_one_double,signed char)
+#endif
+
+/* ------------ unsigned char ---------- */
+#define copy_uchar_to_char	copy_char_to_char
+#define uchar_to_char	NULL
+#define copy_uchar_to_uchar	copy_char_to_char
+#define uchar_to_uchar	NULL
+DEFUN_1(copy_uchar_to_short,unsigned char,short)
+#define uchar_to_short	NULL
+DEFUN_1(copy_uchar_to_ushort,unsigned char,unsigned short)
+#define uchar_to_ushort	NULL
+DEFUN_1(copy_uchar_to_int,unsigned char,int)
+DEFUN_2(uchar_to_int,unsigned char,int,copy_uchar_to_int)
+DEFUN_1(copy_uchar_to_uint,unsigned char,unsigned int)
+DEFUN_2(uchar_to_uint,unsigned char,unsigned int,copy_uchar_to_uint)
+#if LONG_IS_INT
+# define copy_uchar_to_long copy_uchar_to_int
+#else
+DEFUN_1(copy_uchar_to_long,unsigned char,long)
+#endif
+#if LONG_IS_INT
+# define uchar_to_long uchar_to_int
+#else
+DEFUN_2(uchar_to_long,unsigned char,long,copy_uchar_to_long)
+#endif
+#if LONG_IS_INT
+# define copy_uchar_to_ulong copy_uchar_to_uint
+#else
+DEFUN_1(copy_uchar_to_ulong,unsigned char,unsigned long)
+#endif
+#if LONG_IS_INT
+# define uchar_to_ulong uchar_to_uint
+#else
+DEFUN_2(uchar_to_ulong,unsigned char,unsigned long,copy_uchar_to_ulong)
+#endif
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_uchar_to_llong,unsigned char,long long)
+DEFUN_2(uchar_to_llong,unsigned char,long long,copy_uchar_to_llong)
+#endif /* defined(HAVE_LONG_LONG) */
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_uchar_to_ullong,unsigned char,unsigned long long)
+DEFUN_2(uchar_to_ullong,unsigned char,unsigned long long,copy_uchar_to_ullong)
+#endif /* defined(HAVE_LONG_LONG) */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_uchar_to_float,unsigned char,float)
+DEFUN_2(uchar_to_float,unsigned char,float,copy_uchar_to_float)
+#endif /* SLANG_HAS_FLOAT */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_uchar_to_double,unsigned char,double)
+DEFUN_2(uchar_to_double,unsigned char,double,copy_uchar_to_double)
+#endif /* SLANG_HAS_FLOAT */
+#if defined(HAVE_LONG_DOUBLE)
+DEFUN_1(copy_uchar_to_ldouble,unsigned char,long double)
+DEFUN_2(uchar_to_ldouble,unsigned char,long double,copy_uchar_to_ldouble)
+#endif /* defined(HAVE_LONG_DOUBLE) */
+#if SLANG_HAS_FLOAT
+TO_DOUBLE_FUN(uchar_to_one_double,unsigned char)
+#endif
+
+/* ------------ short ---------- */
+DEFUN_1(copy_short_to_char,short,signed char)
+#define short_to_char	NULL
+DEFUN_1(copy_short_to_uchar,short,unsigned char)
+#define short_to_uchar	NULL
+DEFUN_1(copy_short_to_short,short,short)
+#define short_to_short	NULL
+#define copy_short_to_ushort	copy_short_to_short
+#define short_to_ushort	NULL
+DEFUN_1(copy_short_to_int,short,int)
+DEFUN_2(short_to_int,short,int,copy_short_to_int)
+DEFUN_1(copy_short_to_uint,short,unsigned int)
+DEFUN_2(short_to_uint,short,unsigned int,copy_short_to_uint)
+#if LONG_IS_INT
+# define copy_short_to_long copy_short_to_int
+#else
+DEFUN_1(copy_short_to_long,short,long)
+#endif
+#if LONG_IS_INT
+# define short_to_long short_to_int
+#else
+DEFUN_2(short_to_long,short,long,copy_short_to_long)
+#endif
+#if LONG_IS_INT
+# define copy_short_to_ulong copy_short_to_uint
+#else
+DEFUN_1(copy_short_to_ulong,short,unsigned long)
+#endif
+#if LONG_IS_INT
+# define short_to_ulong short_to_uint
+#else
+DEFUN_2(short_to_ulong,short,unsigned long,copy_short_to_ulong)
+#endif
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_short_to_llong,short,long long)
+DEFUN_2(short_to_llong,short,long long,copy_short_to_llong)
+#endif /* defined(HAVE_LONG_LONG) */
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_short_to_ullong,short,unsigned long long)
+DEFUN_2(short_to_ullong,short,unsigned long long,copy_short_to_ullong)
+#endif /* defined(HAVE_LONG_LONG) */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_short_to_float,short,float)
+DEFUN_2(short_to_float,short,float,copy_short_to_float)
+#endif /* SLANG_HAS_FLOAT */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_short_to_double,short,double)
+DEFUN_2(short_to_double,short,double,copy_short_to_double)
+#endif /* SLANG_HAS_FLOAT */
+#if defined(HAVE_LONG_DOUBLE)
+DEFUN_1(copy_short_to_ldouble,short,long double)
+DEFUN_2(short_to_ldouble,short,long double,copy_short_to_ldouble)
+#endif /* defined(HAVE_LONG_DOUBLE) */
+#if SLANG_HAS_FLOAT
+TO_DOUBLE_FUN(short_to_one_double,short)
+#endif
+
+/* ------------ unsigned short ---------- */
+DEFUN_1(copy_ushort_to_char,unsigned short,signed char)
+#define ushort_to_char	NULL
+DEFUN_1(copy_ushort_to_uchar,unsigned short,unsigned char)
+#define ushort_to_uchar	NULL
+#define copy_ushort_to_short	copy_short_to_short
+#define ushort_to_short	NULL
+#define copy_ushort_to_ushort	copy_short_to_short
+#define ushort_to_ushort	NULL
+DEFUN_1(copy_ushort_to_int,unsigned short,int)
+DEFUN_2(ushort_to_int,unsigned short,int,copy_ushort_to_int)
+DEFUN_1(copy_ushort_to_uint,unsigned short,unsigned int)
+DEFUN_2(ushort_to_uint,unsigned short,unsigned int,copy_ushort_to_uint)
+#if LONG_IS_INT
+# define copy_ushort_to_long copy_ushort_to_int
+#else
+DEFUN_1(copy_ushort_to_long,unsigned short,long)
+#endif
+#if LONG_IS_INT
+# define ushort_to_long ushort_to_int
+#else
+DEFUN_2(ushort_to_long,unsigned short,long,copy_ushort_to_long)
+#endif
+#if LONG_IS_INT
+# define copy_ushort_to_ulong copy_ushort_to_uint
+#else
+DEFUN_1(copy_ushort_to_ulong,unsigned short,unsigned long)
+#endif
+#if LONG_IS_INT
+# define ushort_to_ulong ushort_to_uint
+#else
+DEFUN_2(ushort_to_ulong,unsigned short,unsigned long,copy_ushort_to_ulong)
+#endif
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_ushort_to_llong,unsigned short,long long)
+DEFUN_2(ushort_to_llong,unsigned short,long long,copy_ushort_to_llong)
+#endif /* defined(HAVE_LONG_LONG) */
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_ushort_to_ullong,unsigned short,unsigned long long)
+DEFUN_2(ushort_to_ullong,unsigned short,unsigned long long,copy_ushort_to_ullong)
+#endif /* defined(HAVE_LONG_LONG) */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_ushort_to_float,unsigned short,float)
+DEFUN_2(ushort_to_float,unsigned short,float,copy_ushort_to_float)
+#endif /* SLANG_HAS_FLOAT */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_ushort_to_double,unsigned short,double)
+DEFUN_2(ushort_to_double,unsigned short,double,copy_ushort_to_double)
+#endif /* SLANG_HAS_FLOAT */
+#if defined(HAVE_LONG_DOUBLE)
+DEFUN_1(copy_ushort_to_ldouble,unsigned short,long double)
+DEFUN_2(ushort_to_ldouble,unsigned short,long double,copy_ushort_to_ldouble)
+#endif /* defined(HAVE_LONG_DOUBLE) */
+#if SLANG_HAS_FLOAT
+TO_DOUBLE_FUN(ushort_to_one_double,unsigned short)
+#endif
+
+/* ------------ int ---------- */
+DEFUN_1(copy_int_to_char,int,signed char)
+#define int_to_char	NULL
+DEFUN_1(copy_int_to_uchar,int,unsigned char)
+#define int_to_uchar	NULL
+DEFUN_1(copy_int_to_short,int,short)
+#define int_to_short	NULL
+DEFUN_1(copy_int_to_ushort,int,unsigned short)
+#define int_to_ushort	NULL
+DEFUN_1(copy_int_to_int,int,int)
+#define int_to_int	NULL
+#define copy_int_to_uint	copy_int_to_int
+#define int_to_uint	NULL
+#if LONG_IS_INT
+# define copy_int_to_long copy_int_to_int
+#else
+DEFUN_1(copy_int_to_long,int,long)
+#endif
+#if LONG_IS_INT
+# define int_to_long int_to_int
+#else
+DEFUN_2(int_to_long,int,long,copy_int_to_long)
+#endif
+#if LONG_IS_INT
+# define copy_int_to_ulong copy_int_to_uint
+#else
+DEFUN_1(copy_int_to_ulong,int,unsigned long)
+#endif
+#if LONG_IS_INT
+# define int_to_ulong int_to_uint
+#else
+DEFUN_2(int_to_ulong,int,unsigned long,copy_int_to_ulong)
+#endif
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_int_to_llong,int,long long)
+DEFUN_2(int_to_llong,int,long long,copy_int_to_llong)
+#endif /* defined(HAVE_LONG_LONG) */
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_int_to_ullong,int,unsigned long long)
+DEFUN_2(int_to_ullong,int,unsigned long long,copy_int_to_ullong)
+#endif /* defined(HAVE_LONG_LONG) */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_int_to_float,int,float)
+DEFUN_2(int_to_float,int,float,copy_int_to_float)
+#endif /* SLANG_HAS_FLOAT */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_int_to_double,int,double)
+DEFUN_2(int_to_double,int,double,copy_int_to_double)
+#endif /* SLANG_HAS_FLOAT */
+#if defined(HAVE_LONG_DOUBLE)
+DEFUN_1(copy_int_to_ldouble,int,long double)
+DEFUN_2(int_to_ldouble,int,long double,copy_int_to_ldouble)
+#endif /* defined(HAVE_LONG_DOUBLE) */
+#if SLANG_HAS_FLOAT
+TO_DOUBLE_FUN(int_to_one_double,int)
+#endif
+
+/* ------------ unsigned int ---------- */
+DEFUN_1(copy_uint_to_char,unsigned int,signed char)
+#define uint_to_char	NULL
+DEFUN_1(copy_uint_to_uchar,unsigned int,unsigned char)
+#define uint_to_uchar	NULL
+DEFUN_1(copy_uint_to_short,unsigned int,short)
+#define uint_to_short	NULL
+DEFUN_1(copy_uint_to_ushort,unsigned int,unsigned short)
+#define uint_to_ushort	NULL
+#define copy_uint_to_int	copy_int_to_int
+#define uint_to_int	NULL
+#define copy_uint_to_uint	copy_int_to_int
+#define uint_to_uint	NULL
+#if LONG_IS_INT
+# define copy_uint_to_long copy_uint_to_int
+#else
+DEFUN_1(copy_uint_to_long,unsigned int,long)
+#endif
+#if LONG_IS_INT
+# define uint_to_long uint_to_int
+#else
+DEFUN_2(uint_to_long,unsigned int,long,copy_uint_to_long)
+#endif
+#if LONG_IS_INT
+# define copy_uint_to_ulong copy_uint_to_uint
+#else
+DEFUN_1(copy_uint_to_ulong,unsigned int,unsigned long)
+#endif
+#if LONG_IS_INT
+# define uint_to_ulong uint_to_uint
+#else
+DEFUN_2(uint_to_ulong,unsigned int,unsigned long,copy_uint_to_ulong)
+#endif
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_uint_to_llong,unsigned int,long long)
+DEFUN_2(uint_to_llong,unsigned int,long long,copy_uint_to_llong)
+#endif /* defined(HAVE_LONG_LONG) */
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_uint_to_ullong,unsigned int,unsigned long long)
+DEFUN_2(uint_to_ullong,unsigned int,unsigned long long,copy_uint_to_ullong)
+#endif /* defined(HAVE_LONG_LONG) */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_uint_to_float,unsigned int,float)
+DEFUN_2(uint_to_float,unsigned int,float,copy_uint_to_float)
+#endif /* SLANG_HAS_FLOAT */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_uint_to_double,unsigned int,double)
+DEFUN_2(uint_to_double,unsigned int,double,copy_uint_to_double)
+#endif /* SLANG_HAS_FLOAT */
+#if defined(HAVE_LONG_DOUBLE)
+DEFUN_1(copy_uint_to_ldouble,unsigned int,long double)
+DEFUN_2(uint_to_ldouble,unsigned int,long double,copy_uint_to_ldouble)
+#endif /* defined(HAVE_LONG_DOUBLE) */
+#if SLANG_HAS_FLOAT
+TO_DOUBLE_FUN(uint_to_one_double,unsigned int)
+#endif
+
+/* ------------ long ---------- */
+#if LONG_IS_INT
+# define copy_long_to_char copy_int_to_char
+#else
+DEFUN_1(copy_long_to_char,long,signed char)
+#endif
+#define long_to_char	NULL
+#if LONG_IS_INT
+# define copy_long_to_uchar copy_int_to_uchar
+#else
+DEFUN_1(copy_long_to_uchar,long,unsigned char)
+#endif
+#define long_to_uchar	NULL
+#if LONG_IS_INT
+# define copy_long_to_short copy_int_to_short
+#else
+DEFUN_1(copy_long_to_short,long,short)
+#endif
+#define long_to_short	NULL
+#if LONG_IS_INT
+# define copy_long_to_ushort copy_int_to_ushort
+#else
+DEFUN_1(copy_long_to_ushort,long,unsigned short)
+#endif
+#define long_to_ushort	NULL
+#if LONG_IS_INT
+# define copy_long_to_int copy_int_to_int
+#else
+DEFUN_1(copy_long_to_int,long,int)
+#endif
+#define long_to_int	NULL
+#if LONG_IS_INT
+# define copy_long_to_uint copy_int_to_uint
+#else
+DEFUN_1(copy_long_to_uint,long,unsigned int)
+#endif
+#define long_to_uint	NULL
+#if LONG_IS_INT
+# define copy_long_to_long copy_long_to_int
+#else
+DEFUN_1(copy_long_to_long,long,long)
+#endif
+#define long_to_long	NULL
+#define copy_long_to_ulong	copy_long_to_long
+#define long_to_ulong	NULL
+#if defined(HAVE_LONG_LONG)
+#if LONG_IS_INT
+# define copy_long_to_llong copy_int_to_llong
+#else
+DEFUN_1(copy_long_to_llong,long,long long)
+#endif
+#if LONG_IS_INT
+# define long_to_llong int_to_llong
+#else
+DEFUN_2(long_to_llong,long,long long,copy_long_to_llong)
+#endif
+#endif /* defined(HAVE_LONG_LONG) */
+#if defined(HAVE_LONG_LONG)
+#if LONG_IS_INT
+# define copy_long_to_ullong copy_int_to_ullong
+#else
+DEFUN_1(copy_long_to_ullong,long,unsigned long long)
+#endif
+#if LONG_IS_INT
+# define long_to_ullong int_to_ullong
+#else
+DEFUN_2(long_to_ullong,long,unsigned long long,copy_long_to_ullong)
+#endif
+#endif /* defined(HAVE_LONG_LONG) */
+#if SLANG_HAS_FLOAT
+#if LONG_IS_INT
+# define copy_long_to_float copy_int_to_float
+#else
+DEFUN_1(copy_long_to_float,long,float)
+#endif
+#if LONG_IS_INT
+# define long_to_float int_to_float
+#else
+DEFUN_2(long_to_float,long,float,copy_long_to_float)
+#endif
+#endif /* SLANG_HAS_FLOAT */
+#if SLANG_HAS_FLOAT
+#if LONG_IS_INT
+# define copy_long_to_double copy_int_to_double
+#else
+DEFUN_1(copy_long_to_double,long,double)
+#endif
+#if LONG_IS_INT
+# define long_to_double int_to_double
+#else
+DEFUN_2(long_to_double,long,double,copy_long_to_double)
+#endif
+#endif /* SLANG_HAS_FLOAT */
+#if defined(HAVE_LONG_DOUBLE)
+#if LONG_IS_INT
+# define copy_long_to_ldouble copy_int_to_ldouble
+#else
+DEFUN_1(copy_long_to_ldouble,long,long double)
+#endif
+#if LONG_IS_INT
+# define long_to_ldouble int_to_ldouble
+#else
+DEFUN_2(long_to_ldouble,long,long double,copy_long_to_ldouble)
+#endif
+#endif /* defined(HAVE_LONG_DOUBLE) */
+#if SLANG_HAS_FLOAT
+TO_DOUBLE_FUN(long_to_one_double,long)
+#endif
+
+/* ------------ unsigned long ---------- */
+#if LONG_IS_INT
+# define copy_ulong_to_char copy_uint_to_char
+#else
+DEFUN_1(copy_ulong_to_char,unsigned long,signed char)
+#endif
+#define ulong_to_char	NULL
+#if LONG_IS_INT
+# define copy_ulong_to_uchar copy_uint_to_uchar
+#else
+DEFUN_1(copy_ulong_to_uchar,unsigned long,unsigned char)
+#endif
+#define ulong_to_uchar	NULL
+#if LONG_IS_INT
+# define copy_ulong_to_short copy_uint_to_short
+#else
+DEFUN_1(copy_ulong_to_short,unsigned long,short)
+#endif
+#define ulong_to_short	NULL
+#if LONG_IS_INT
+# define copy_ulong_to_ushort copy_uint_to_ushort
+#else
+DEFUN_1(copy_ulong_to_ushort,unsigned long,unsigned short)
+#endif
+#define ulong_to_ushort	NULL
+#if LONG_IS_INT
+# define copy_ulong_to_int copy_uint_to_int
+#else
+DEFUN_1(copy_ulong_to_int,unsigned long,int)
+#endif
+#define ulong_to_int	NULL
+#if LONG_IS_INT
+# define copy_ulong_to_uint copy_uint_to_uint
+#else
+DEFUN_1(copy_ulong_to_uint,unsigned long,unsigned int)
+#endif
+#define ulong_to_uint	NULL
+#define copy_ulong_to_long	copy_long_to_long
+#define ulong_to_long	NULL
+#define copy_ulong_to_ulong	copy_long_to_long
+#define ulong_to_ulong	NULL
+#if defined(HAVE_LONG_LONG)
+#if LONG_IS_INT
+# define copy_ulong_to_llong copy_uint_to_llong
+#else
+DEFUN_1(copy_ulong_to_llong,unsigned long,long long)
+#endif
+#if LONG_IS_INT
+# define ulong_to_llong uint_to_llong
+#else
+DEFUN_2(ulong_to_llong,unsigned long,long long,copy_ulong_to_llong)
+#endif
+#endif /* defined(HAVE_LONG_LONG) */
+#if defined(HAVE_LONG_LONG)
+#if LONG_IS_INT
+# define copy_ulong_to_ullong copy_uint_to_ullong
+#else
+DEFUN_1(copy_ulong_to_ullong,unsigned long,unsigned long long)
+#endif
+#if LONG_IS_INT
+# define ulong_to_ullong uint_to_ullong
+#else
+DEFUN_2(ulong_to_ullong,unsigned long,unsigned long long,copy_ulong_to_ullong)
+#endif
+#endif /* defined(HAVE_LONG_LONG) */
+#if SLANG_HAS_FLOAT
+#if LONG_IS_INT
+# define copy_ulong_to_float copy_uint_to_float
+#else
+DEFUN_1(copy_ulong_to_float,unsigned long,float)
+#endif
+#if LONG_IS_INT
+# define ulong_to_float uint_to_float
+#else
+DEFUN_2(ulong_to_float,unsigned long,float,copy_ulong_to_float)
+#endif
+#endif /* SLANG_HAS_FLOAT */
+#if SLANG_HAS_FLOAT
+#if LONG_IS_INT
+# define copy_ulong_to_double copy_uint_to_double
+#else
+DEFUN_1(copy_ulong_to_double,unsigned long,double)
+#endif
+#if LONG_IS_INT
+# define ulong_to_double uint_to_double
+#else
+DEFUN_2(ulong_to_double,unsigned long,double,copy_ulong_to_double)
+#endif
+#endif /* SLANG_HAS_FLOAT */
+#if defined(HAVE_LONG_DOUBLE)
+#if LONG_IS_INT
+# define copy_ulong_to_ldouble copy_uint_to_ldouble
+#else
+DEFUN_1(copy_ulong_to_ldouble,unsigned long,long double)
+#endif
+#if LONG_IS_INT
+# define ulong_to_ldouble uint_to_ldouble
+#else
+DEFUN_2(ulong_to_ldouble,unsigned long,long double,copy_ulong_to_ldouble)
+#endif
+#endif /* defined(HAVE_LONG_DOUBLE) */
+#if SLANG_HAS_FLOAT
+TO_DOUBLE_FUN(ulong_to_one_double,unsigned long)
+#endif
+
+/* ------------ long long ---------- */
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_llong_to_char,long long,signed char)
+#define llong_to_char	NULL
+DEFUN_1(copy_llong_to_uchar,long long,unsigned char)
+#define llong_to_uchar	NULL
+DEFUN_1(copy_llong_to_short,long long,short)
+#define llong_to_short	NULL
+DEFUN_1(copy_llong_to_ushort,long long,unsigned short)
+#define llong_to_ushort	NULL
+DEFUN_1(copy_llong_to_int,long long,int)
+#define llong_to_int	NULL
+DEFUN_1(copy_llong_to_uint,long long,unsigned int)
+#define llong_to_uint	NULL
+#if LONG_IS_INT
+# define copy_llong_to_long copy_llong_to_int
+#else
+DEFUN_1(copy_llong_to_long,long long,long)
+#endif
+#define llong_to_long	NULL
+#if LONG_IS_INT
+# define copy_llong_to_ulong copy_llong_to_uint
+#else
+DEFUN_1(copy_llong_to_ulong,long long,unsigned long)
+#endif
+#define llong_to_ulong	NULL
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_llong_to_llong,long long,long long)
+#define llong_to_llong	NULL
+#endif /* defined(HAVE_LONG_LONG) */
+#if defined(HAVE_LONG_LONG)
+#define copy_llong_to_ullong	copy_llong_to_llong
+#define llong_to_ullong	NULL
+#endif /* defined(HAVE_LONG_LONG) */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_llong_to_float,long long,float)
+DEFUN_2(llong_to_float,long long,float,copy_llong_to_float)
+#endif /* SLANG_HAS_FLOAT */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_llong_to_double,long long,double)
+DEFUN_2(llong_to_double,long long,double,copy_llong_to_double)
+#endif /* SLANG_HAS_FLOAT */
+#if defined(HAVE_LONG_DOUBLE)
+DEFUN_1(copy_llong_to_ldouble,long long,long double)
+DEFUN_2(llong_to_ldouble,long long,long double,copy_llong_to_ldouble)
+#endif /* defined(HAVE_LONG_DOUBLE) */
+#if SLANG_HAS_FLOAT
+TO_DOUBLE_FUN(llong_to_one_double,long long)
+#endif
+#endif /* defined(HAVE_LONG_LONG) */
+
+/* ------------ unsigned long long ---------- */
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_ullong_to_char,unsigned long long,signed char)
+#define ullong_to_char	NULL
+DEFUN_1(copy_ullong_to_uchar,unsigned long long,unsigned char)
+#define ullong_to_uchar	NULL
+DEFUN_1(copy_ullong_to_short,unsigned long long,short)
+#define ullong_to_short	NULL
+DEFUN_1(copy_ullong_to_ushort,unsigned long long,unsigned short)
+#define ullong_to_ushort	NULL
+DEFUN_1(copy_ullong_to_int,unsigned long long,int)
+#define ullong_to_int	NULL
+DEFUN_1(copy_ullong_to_uint,unsigned long long,unsigned int)
+#define ullong_to_uint	NULL
+#if LONG_IS_INT
+# define copy_ullong_to_long copy_ullong_to_int
+#else
+DEFUN_1(copy_ullong_to_long,unsigned long long,long)
+#endif
+#define ullong_to_long	NULL
+#if LONG_IS_INT
+# define copy_ullong_to_ulong copy_ullong_to_uint
+#else
+DEFUN_1(copy_ullong_to_ulong,unsigned long long,unsigned long)
+#endif
+#define ullong_to_ulong	NULL
+#if defined(HAVE_LONG_LONG)
+#define copy_ullong_to_llong	copy_llong_to_llong
+#define ullong_to_llong	NULL
+#endif /* defined(HAVE_LONG_LONG) */
+#if defined(HAVE_LONG_LONG)
+#define copy_ullong_to_ullong	copy_llong_to_llong
+#define ullong_to_ullong	NULL
+#endif /* defined(HAVE_LONG_LONG) */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_ullong_to_float,unsigned long long,float)
+DEFUN_2(ullong_to_float,unsigned long long,float,copy_ullong_to_float)
+#endif /* SLANG_HAS_FLOAT */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_ullong_to_double,unsigned long long,double)
+DEFUN_2(ullong_to_double,unsigned long long,double,copy_ullong_to_double)
+#endif /* SLANG_HAS_FLOAT */
+#if defined(HAVE_LONG_DOUBLE)
+DEFUN_1(copy_ullong_to_ldouble,unsigned long long,long double)
+DEFUN_2(ullong_to_ldouble,unsigned long long,long double,copy_ullong_to_ldouble)
+#endif /* defined(HAVE_LONG_DOUBLE) */
+#if SLANG_HAS_FLOAT
+TO_DOUBLE_FUN(ullong_to_one_double,unsigned long long)
+#endif
+#endif /* defined(HAVE_LONG_LONG) */
+
+/* ------------ float ---------- */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_float_to_char,float,signed char)
+#define float_to_char	NULL
+DEFUN_1(copy_float_to_uchar,float,unsigned char)
+#define float_to_uchar	NULL
+DEFUN_1(copy_float_to_short,float,short)
+#define float_to_short	NULL
+DEFUN_1(copy_float_to_ushort,float,unsigned short)
+#define float_to_ushort	NULL
+DEFUN_1(copy_float_to_int,float,int)
+#define float_to_int	NULL
+DEFUN_1(copy_float_to_uint,float,unsigned int)
+#define float_to_uint	NULL
+#if LONG_IS_INT
+# define copy_float_to_long copy_float_to_int
+#else
+DEFUN_1(copy_float_to_long,float,long)
+#endif
+#define float_to_long	NULL
+#if LONG_IS_INT
+# define copy_float_to_ulong copy_float_to_uint
+#else
+DEFUN_1(copy_float_to_ulong,float,unsigned long)
+#endif
+#define float_to_ulong	NULL
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_float_to_llong,float,long long)
+#define float_to_llong	NULL
+#endif /* defined(HAVE_LONG_LONG) */
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_float_to_ullong,float,unsigned long long)
+#define float_to_ullong	NULL
+#endif /* defined(HAVE_LONG_LONG) */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_float_to_float,float,float)
+#define float_to_float	NULL
+#endif /* SLANG_HAS_FLOAT */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_float_to_double,float,double)
+DEFUN_2(float_to_double,float,double,copy_float_to_double)
+#endif /* SLANG_HAS_FLOAT */
+#if defined(HAVE_LONG_DOUBLE)
+DEFUN_1(copy_float_to_ldouble,float,long double)
+DEFUN_2(float_to_ldouble,float,long double,copy_float_to_ldouble)
+#endif /* defined(HAVE_LONG_DOUBLE) */
+#if SLANG_HAS_FLOAT
+TO_DOUBLE_FUN(float_to_one_double,float)
+#endif
+#endif /* SLANG_HAS_FLOAT */
+
+/* ------------ double ---------- */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_double_to_char,double,signed char)
+#define double_to_char	NULL
+DEFUN_1(copy_double_to_uchar,double,unsigned char)
+#define double_to_uchar	NULL
+DEFUN_1(copy_double_to_short,double,short)
+#define double_to_short	NULL
+DEFUN_1(copy_double_to_ushort,double,unsigned short)
+#define double_to_ushort	NULL
+DEFUN_1(copy_double_to_int,double,int)
+#define double_to_int	NULL
+DEFUN_1(copy_double_to_uint,double,unsigned int)
+#define double_to_uint	NULL
+#if LONG_IS_INT
+# define copy_double_to_long copy_double_to_int
+#else
+DEFUN_1(copy_double_to_long,double,long)
+#endif
+#define double_to_long	NULL
+#if LONG_IS_INT
+# define copy_double_to_ulong copy_double_to_uint
+#else
+DEFUN_1(copy_double_to_ulong,double,unsigned long)
+#endif
+#define double_to_ulong	NULL
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_double_to_llong,double,long long)
+#define double_to_llong	NULL
+#endif /* defined(HAVE_LONG_LONG) */
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_double_to_ullong,double,unsigned long long)
+#define double_to_ullong	NULL
+#endif /* defined(HAVE_LONG_LONG) */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_double_to_float,double,float)
+#define double_to_float	NULL
+#endif /* SLANG_HAS_FLOAT */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_double_to_double,double,double)
+#define double_to_double	NULL
+#endif /* SLANG_HAS_FLOAT */
+#if defined(HAVE_LONG_DOUBLE)
+DEFUN_1(copy_double_to_ldouble,double,long double)
+DEFUN_2(double_to_ldouble,double,long double,copy_double_to_ldouble)
+#endif /* defined(HAVE_LONG_DOUBLE) */
+#if SLANG_HAS_FLOAT
+TO_DOUBLE_FUN(double_to_one_double,double)
+#endif
+#endif /* SLANG_HAS_FLOAT */
+
+/* ------------ long double ---------- */
+#if defined(HAVE_LONG_DOUBLE)
+DEFUN_1(copy_ldouble_to_char,long double,signed char)
+#define ldouble_to_char	NULL
+DEFUN_1(copy_ldouble_to_uchar,long double,unsigned char)
+#define ldouble_to_uchar	NULL
+DEFUN_1(copy_ldouble_to_short,long double,short)
+#define ldouble_to_short	NULL
+DEFUN_1(copy_ldouble_to_ushort,long double,unsigned short)
+#define ldouble_to_ushort	NULL
+DEFUN_1(copy_ldouble_to_int,long double,int)
+#define ldouble_to_int	NULL
+DEFUN_1(copy_ldouble_to_uint,long double,unsigned int)
+#define ldouble_to_uint	NULL
+#if LONG_IS_INT
+# define copy_ldouble_to_long copy_ldouble_to_int
+#else
+DEFUN_1(copy_ldouble_to_long,long double,long)
+#endif
+#define ldouble_to_long	NULL
+#if LONG_IS_INT
+# define copy_ldouble_to_ulong copy_ldouble_to_uint
+#else
+DEFUN_1(copy_ldouble_to_ulong,long double,unsigned long)
+#endif
+#define ldouble_to_ulong	NULL
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_ldouble_to_llong,long double,long long)
+#define ldouble_to_llong	NULL
+#endif /* defined(HAVE_LONG_LONG) */
+#if defined(HAVE_LONG_LONG)
+DEFUN_1(copy_ldouble_to_ullong,long double,unsigned long long)
+#define ldouble_to_ullong	NULL
+#endif /* defined(HAVE_LONG_LONG) */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_ldouble_to_float,long double,float)
+#define ldouble_to_float	NULL
+#endif /* SLANG_HAS_FLOAT */
+#if SLANG_HAS_FLOAT
+DEFUN_1(copy_ldouble_to_double,long double,double)
+#define ldouble_to_double	NULL
+#endif /* SLANG_HAS_FLOAT */
+#if defined(HAVE_LONG_DOUBLE)
+DEFUN_1(copy_ldouble_to_ldouble,long double,long double)
+#define ldouble_to_ldouble	NULL
+#endif /* defined(HAVE_LONG_DOUBLE) */
+#if SLANG_HAS_FLOAT
+TO_DOUBLE_FUN(ldouble_to_one_double,long double)
+#endif
+#endif /* defined(HAVE_LONG_DOUBLE) */
+
+#if SLANG_HAS_FLOAT
+static To_Double_Fun_Table_Type To_Double_Fun_Table MAX_ARITHMETIC_TYPES =
+{
+   {sizeof(signed char), char_to_one_double},
+   {sizeof(unsigned char), uchar_to_one_double},
+   {sizeof(short), short_to_one_double},
+   {sizeof(unsigned short), ushort_to_one_double},
+   {sizeof(int), int_to_one_double},
+   {sizeof(unsigned int), uint_to_one_double},
+   {sizeof(long), long_to_one_double},
+   {sizeof(unsigned long), ulong_to_one_double},
+#if defined(HAVE_LONG_LONG)
+   {sizeof(long long), llong_to_one_double},
+#else
+   {0, NULL},
+#endif
+#if defined(HAVE_LONG_LONG)
+   {sizeof(unsigned long long), ullong_to_one_double},
+#else
+   {0, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+   {sizeof(float), float_to_one_double},
+#else
+   {0, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+   {sizeof(double), double_to_one_double},
+#else
+   {0, NULL},
+#endif
+#if defined(HAVE_LONG_DOUBLE)
+   {sizeof(long double), ldouble_to_one_double},
+#else
+   {0, NULL},
+#endif
+};
+#endif
+
+static Binary_Matrix_Type Binary_Matrix MAX_ARITHMETIC_TYPESMAX_ARITHMETIC_TYPES =
+{
+   /* signed char */
+   {
+     {(FVOID_STAR)copy_char_to_char, char_to_char},
+     {(FVOID_STAR)copy_char_to_uchar, char_to_uchar},
+     {(FVOID_STAR)copy_char_to_short, char_to_short},
+     {(FVOID_STAR)copy_char_to_ushort, char_to_ushort},
+     {(FVOID_STAR)copy_char_to_int, char_to_int},
+     {(FVOID_STAR)copy_char_to_uint, char_to_uint},
+     {(FVOID_STAR)copy_char_to_long, char_to_long},
+     {(FVOID_STAR)copy_char_to_ulong, char_to_ulong},
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_char_to_llong, char_to_llong},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_char_to_ullong, char_to_ullong},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_char_to_float, char_to_float},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_char_to_double, char_to_double},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_DOUBLE)
+     {(FVOID_STAR)copy_char_to_ldouble, char_to_ldouble},
+#else
+     {NULL, NULL},
+#endif
+   },
+   /* unsigned char */
+   {
+     {(FVOID_STAR)copy_uchar_to_char, uchar_to_char},
+     {(FVOID_STAR)copy_uchar_to_uchar, uchar_to_uchar},
+     {(FVOID_STAR)copy_uchar_to_short, uchar_to_short},
+     {(FVOID_STAR)copy_uchar_to_ushort, uchar_to_ushort},
+     {(FVOID_STAR)copy_uchar_to_int, uchar_to_int},
+     {(FVOID_STAR)copy_uchar_to_uint, uchar_to_uint},
+     {(FVOID_STAR)copy_uchar_to_long, uchar_to_long},
+     {(FVOID_STAR)copy_uchar_to_ulong, uchar_to_ulong},
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_uchar_to_llong, uchar_to_llong},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_uchar_to_ullong, uchar_to_ullong},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_uchar_to_float, uchar_to_float},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_uchar_to_double, uchar_to_double},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_DOUBLE)
+     {(FVOID_STAR)copy_uchar_to_ldouble, uchar_to_ldouble},
+#else
+     {NULL, NULL},
+#endif
+   },
+   /* short */
+   {
+     {(FVOID_STAR)copy_short_to_char, short_to_char},
+     {(FVOID_STAR)copy_short_to_uchar, short_to_uchar},
+     {(FVOID_STAR)copy_short_to_short, short_to_short},
+     {(FVOID_STAR)copy_short_to_ushort, short_to_ushort},
+     {(FVOID_STAR)copy_short_to_int, short_to_int},
+     {(FVOID_STAR)copy_short_to_uint, short_to_uint},
+     {(FVOID_STAR)copy_short_to_long, short_to_long},
+     {(FVOID_STAR)copy_short_to_ulong, short_to_ulong},
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_short_to_llong, short_to_llong},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_short_to_ullong, short_to_ullong},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_short_to_float, short_to_float},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_short_to_double, short_to_double},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_DOUBLE)
+     {(FVOID_STAR)copy_short_to_ldouble, short_to_ldouble},
+#else
+     {NULL, NULL},
+#endif
+   },
+   /* unsigned short */
+   {
+     {(FVOID_STAR)copy_ushort_to_char, ushort_to_char},
+     {(FVOID_STAR)copy_ushort_to_uchar, ushort_to_uchar},
+     {(FVOID_STAR)copy_ushort_to_short, ushort_to_short},
+     {(FVOID_STAR)copy_ushort_to_ushort, ushort_to_ushort},
+     {(FVOID_STAR)copy_ushort_to_int, ushort_to_int},
+     {(FVOID_STAR)copy_ushort_to_uint, ushort_to_uint},
+     {(FVOID_STAR)copy_ushort_to_long, ushort_to_long},
+     {(FVOID_STAR)copy_ushort_to_ulong, ushort_to_ulong},
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_ushort_to_llong, ushort_to_llong},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_ushort_to_ullong, ushort_to_ullong},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_ushort_to_float, ushort_to_float},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_ushort_to_double, ushort_to_double},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_DOUBLE)
+     {(FVOID_STAR)copy_ushort_to_ldouble, ushort_to_ldouble},
+#else
+     {NULL, NULL},
+#endif
+   },
+   /* int */
+   {
+     {(FVOID_STAR)copy_int_to_char, int_to_char},
+     {(FVOID_STAR)copy_int_to_uchar, int_to_uchar},
+     {(FVOID_STAR)copy_int_to_short, int_to_short},
+     {(FVOID_STAR)copy_int_to_ushort, int_to_ushort},
+     {(FVOID_STAR)copy_int_to_int, int_to_int},
+     {(FVOID_STAR)copy_int_to_uint, int_to_uint},
+     {(FVOID_STAR)copy_int_to_long, int_to_long},
+     {(FVOID_STAR)copy_int_to_ulong, int_to_ulong},
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_int_to_llong, int_to_llong},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_int_to_ullong, int_to_ullong},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_int_to_float, int_to_float},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_int_to_double, int_to_double},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_DOUBLE)
+     {(FVOID_STAR)copy_int_to_ldouble, int_to_ldouble},
+#else
+     {NULL, NULL},
+#endif
+   },
+   /* unsigned int */
+   {
+     {(FVOID_STAR)copy_uint_to_char, uint_to_char},
+     {(FVOID_STAR)copy_uint_to_uchar, uint_to_uchar},
+     {(FVOID_STAR)copy_uint_to_short, uint_to_short},
+     {(FVOID_STAR)copy_uint_to_ushort, uint_to_ushort},
+     {(FVOID_STAR)copy_uint_to_int, uint_to_int},
+     {(FVOID_STAR)copy_uint_to_uint, uint_to_uint},
+     {(FVOID_STAR)copy_uint_to_long, uint_to_long},
+     {(FVOID_STAR)copy_uint_to_ulong, uint_to_ulong},
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_uint_to_llong, uint_to_llong},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_uint_to_ullong, uint_to_ullong},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_uint_to_float, uint_to_float},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_uint_to_double, uint_to_double},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_DOUBLE)
+     {(FVOID_STAR)copy_uint_to_ldouble, uint_to_ldouble},
+#else
+     {NULL, NULL},
+#endif
+   },
+   /* long */
+   {
+     {(FVOID_STAR)copy_long_to_char, long_to_char},
+     {(FVOID_STAR)copy_long_to_uchar, long_to_uchar},
+     {(FVOID_STAR)copy_long_to_short, long_to_short},
+     {(FVOID_STAR)copy_long_to_ushort, long_to_ushort},
+     {(FVOID_STAR)copy_long_to_int, long_to_int},
+     {(FVOID_STAR)copy_long_to_uint, long_to_uint},
+     {(FVOID_STAR)copy_long_to_long, long_to_long},
+     {(FVOID_STAR)copy_long_to_ulong, long_to_ulong},
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_long_to_llong, long_to_llong},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_long_to_ullong, long_to_ullong},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_long_to_float, long_to_float},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_long_to_double, long_to_double},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_DOUBLE)
+     {(FVOID_STAR)copy_long_to_ldouble, long_to_ldouble},
+#else
+     {NULL, NULL},
+#endif
+   },
+   /* unsigned long */
+   {
+     {(FVOID_STAR)copy_ulong_to_char, ulong_to_char},
+     {(FVOID_STAR)copy_ulong_to_uchar, ulong_to_uchar},
+     {(FVOID_STAR)copy_ulong_to_short, ulong_to_short},
+     {(FVOID_STAR)copy_ulong_to_ushort, ulong_to_ushort},
+     {(FVOID_STAR)copy_ulong_to_int, ulong_to_int},
+     {(FVOID_STAR)copy_ulong_to_uint, ulong_to_uint},
+     {(FVOID_STAR)copy_ulong_to_long, ulong_to_long},
+     {(FVOID_STAR)copy_ulong_to_ulong, ulong_to_ulong},
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_ulong_to_llong, ulong_to_llong},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_ulong_to_ullong, ulong_to_ullong},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_ulong_to_float, ulong_to_float},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_ulong_to_double, ulong_to_double},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_DOUBLE)
+     {(FVOID_STAR)copy_ulong_to_ldouble, ulong_to_ldouble},
+#else
+     {NULL, NULL},
+#endif
+   },
+   /* long long */
+#if defined(HAVE_LONG_LONG)
+   {
+     {(FVOID_STAR)copy_llong_to_char, llong_to_char},
+     {(FVOID_STAR)copy_llong_to_uchar, llong_to_uchar},
+     {(FVOID_STAR)copy_llong_to_short, llong_to_short},
+     {(FVOID_STAR)copy_llong_to_ushort, llong_to_ushort},
+     {(FVOID_STAR)copy_llong_to_int, llong_to_int},
+     {(FVOID_STAR)copy_llong_to_uint, llong_to_uint},
+     {(FVOID_STAR)copy_llong_to_long, llong_to_long},
+     {(FVOID_STAR)copy_llong_to_ulong, llong_to_ulong},
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_llong_to_llong, llong_to_llong},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_llong_to_ullong, llong_to_ullong},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_llong_to_float, llong_to_float},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_llong_to_double, llong_to_double},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_DOUBLE)
+     {(FVOID_STAR)copy_llong_to_ldouble, llong_to_ldouble},
+#else
+     {NULL, NULL},
+#endif
+   },
+#else
+   {
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+   },
+#endif /* defined(HAVE_LONG_LONG) */
+
+   /* unsigned long long */
+#if defined(HAVE_LONG_LONG)
+   {
+     {(FVOID_STAR)copy_ullong_to_char, ullong_to_char},
+     {(FVOID_STAR)copy_ullong_to_uchar, ullong_to_uchar},
+     {(FVOID_STAR)copy_ullong_to_short, ullong_to_short},
+     {(FVOID_STAR)copy_ullong_to_ushort, ullong_to_ushort},
+     {(FVOID_STAR)copy_ullong_to_int, ullong_to_int},
+     {(FVOID_STAR)copy_ullong_to_uint, ullong_to_uint},
+     {(FVOID_STAR)copy_ullong_to_long, ullong_to_long},
+     {(FVOID_STAR)copy_ullong_to_ulong, ullong_to_ulong},
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_ullong_to_llong, ullong_to_llong},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_ullong_to_ullong, ullong_to_ullong},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_ullong_to_float, ullong_to_float},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_ullong_to_double, ullong_to_double},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_DOUBLE)
+     {(FVOID_STAR)copy_ullong_to_ldouble, ullong_to_ldouble},
+#else
+     {NULL, NULL},
+#endif
+   },
+#else
+   {
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+   },
+#endif /* defined(HAVE_LONG_LONG) */
+
+   /* float */
+#if SLANG_HAS_FLOAT
+   {
+     {(FVOID_STAR)copy_float_to_char, float_to_char},
+     {(FVOID_STAR)copy_float_to_uchar, float_to_uchar},
+     {(FVOID_STAR)copy_float_to_short, float_to_short},
+     {(FVOID_STAR)copy_float_to_ushort, float_to_ushort},
+     {(FVOID_STAR)copy_float_to_int, float_to_int},
+     {(FVOID_STAR)copy_float_to_uint, float_to_uint},
+     {(FVOID_STAR)copy_float_to_long, float_to_long},
+     {(FVOID_STAR)copy_float_to_ulong, float_to_ulong},
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_float_to_llong, float_to_llong},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_float_to_ullong, float_to_ullong},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_float_to_float, float_to_float},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_float_to_double, float_to_double},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_DOUBLE)
+     {(FVOID_STAR)copy_float_to_ldouble, float_to_ldouble},
+#else
+     {NULL, NULL},
+#endif
+   },
+#else
+   {
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+   },
+#endif /* SLANG_HAS_FLOAT */
+
+   /* double */
+#if SLANG_HAS_FLOAT
+   {
+     {(FVOID_STAR)copy_double_to_char, double_to_char},
+     {(FVOID_STAR)copy_double_to_uchar, double_to_uchar},
+     {(FVOID_STAR)copy_double_to_short, double_to_short},
+     {(FVOID_STAR)copy_double_to_ushort, double_to_ushort},
+     {(FVOID_STAR)copy_double_to_int, double_to_int},
+     {(FVOID_STAR)copy_double_to_uint, double_to_uint},
+     {(FVOID_STAR)copy_double_to_long, double_to_long},
+     {(FVOID_STAR)copy_double_to_ulong, double_to_ulong},
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_double_to_llong, double_to_llong},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_double_to_ullong, double_to_ullong},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_double_to_float, double_to_float},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_double_to_double, double_to_double},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_DOUBLE)
+     {(FVOID_STAR)copy_double_to_ldouble, double_to_ldouble},
+#else
+     {NULL, NULL},
+#endif
+   },
+#else
+   {
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+   },
+#endif /* SLANG_HAS_FLOAT */
+
+   /* long double */
+#if defined(HAVE_LONG_DOUBLE)
+   {
+     {(FVOID_STAR)copy_ldouble_to_char, ldouble_to_char},
+     {(FVOID_STAR)copy_ldouble_to_uchar, ldouble_to_uchar},
+     {(FVOID_STAR)copy_ldouble_to_short, ldouble_to_short},
+     {(FVOID_STAR)copy_ldouble_to_ushort, ldouble_to_ushort},
+     {(FVOID_STAR)copy_ldouble_to_int, ldouble_to_int},
+     {(FVOID_STAR)copy_ldouble_to_uint, ldouble_to_uint},
+     {(FVOID_STAR)copy_ldouble_to_long, ldouble_to_long},
+     {(FVOID_STAR)copy_ldouble_to_ulong, ldouble_to_ulong},
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_ldouble_to_llong, ldouble_to_llong},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_LONG)
+     {(FVOID_STAR)copy_ldouble_to_ullong, ldouble_to_ullong},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_ldouble_to_float, ldouble_to_float},
+#else
+     {NULL, NULL},
+#endif
+#if SLANG_HAS_FLOAT
+     {(FVOID_STAR)copy_ldouble_to_double, ldouble_to_double},
+#else
+     {NULL, NULL},
+#endif
+#if defined(HAVE_LONG_DOUBLE)
+     {(FVOID_STAR)copy_ldouble_to_ldouble, ldouble_to_ldouble},
+#else
+     {NULL, NULL},
+#endif
+   },
+#else
+   {
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+     {NULL, NULL},
+   },
+#endif /* defined(HAVE_LONG_DOUBLE) */
+
+};
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slarray.c Added

@@ -0,0 +1,5747 @@
+/* Array manipulation routines for S-Lang */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+#include <math.h>
+
+/* #define SL_APP_WANTS_FOREACH */
+#include "slang.h"
+#include "_slang.h"
+
+typedef struct Range_Array_Type SLarray_Range_Array_Type;
+
+struct Range_Array_Type
+{
+ SLindex_Type first_index;
+ SLindex_Type last_index;
+ SLindex_Type delta;
+ int has_first_index;
+ int has_last_index;
+ int (*to_linear_fun) (SLang_Array_Type *, SLarray_Range_Array_Type *, VOID_STAR);
+};
+
+static SLang_Array_Type *inline_implicit_index_array (SLindex_Type *, SLindex_Type *, SLindex_Type *);
+
+/* Use SLang_pop_array when a linear array is required. */
+static int pop_array (SLang_Array_Type **at_ptr, int convert_scalar)
+{
+ SLang_Array_Type *at;
+ SLindex_Type one = 1;
+ int type;
+
+ *at_ptr = NULL;
+ type = SLang_peek_at_stack ();
+
+ switch (type)
+ {
+ case -1:
+	return -1;
+
+ case SLANG_ARRAY_TYPE:
+	return SLclass_pop_ptr_obj (SLANG_ARRAY_TYPE, (VOID_STAR *) at_ptr);
+
+ case SLANG_NULL_TYPE:
+	/* convert_scalar = 0; */ /* commented out for 2.0.5 to fix array_map NULL bug */
+	/* drop */
+ default:
+	if (convert_scalar == 0)
+	 {
+	 SLdo_pop ();
+	 _pSLang_verror (SL_TYPE_MISMATCH, "Context requires an array. Scalar not converted");
+	 return -1;
+	 }
+	break;
+ }
+
+ if (NULL == (at = SLang_create_array ((SLtype) type, 0, NULL, &one, 1)))
+ return -1;
+
+ if (at->flags & SLARR_DATA_VALUE_IS_POINTER)
+ {
+	/* The act of creating the array could have initialized the array
+	 * with pointers to an object of the type. For example, this could
+	 * happen with user-defined structs.
+	 */
+	if (*(VOID_STAR *)at->data != NULL)
+	 {
+	 at->cl->cl_destroy ((SLtype) type, at->data);
+	 *(VOID_STAR *) at->data = NULL;
+	 }
+ }
+
+ if (-1 == at->cl->cl_apop ((SLtype) type, at->data))
+ {
+	SLang_free_array (at);
+	return -1;
+ }
+ at->flags |= SLARR_DERIVED_FROM_SCALAR;
+ *at_ptr = at;
+
+ return 0;
+}
+
+static void throw_size_error (int e)
+{
+ _pSLang_verror (e, "Unable to create a multi-dimensional array of the desired size");
+}
+
+static VOID_STAR linear_get_data_addr (SLang_Array_Type *at, SLindex_Type *dims)
+{
+ size_t ofs;
+
+ if (at->num_dims == 1)
+ {
+	if (*dims < 0)
+	 ofs = (size_t) (*dims + at->dims0);
+	else
+	 ofs = (size_t)*dims;
+ }
+ else
+ {
+	unsigned int i;
+	SLindex_Type *max_dims = at->dims;
+	unsigned int num_dims = at->num_dims;
+	ofs = 0;
+	for (i = 0; i < num_dims; i++)
+	 {
+	 size_t new_ofs;
+	 SLindex_Type d = dimsi;
+	 if (d < 0)
+	 d = d + max_dimsi;
+
+	 new_ofs = ofs * (size_t)max_dims i + (size_t) d;
+	 if ((max_dimsi != 0)
+		 && ((new_ofs - (size_t)d)/max_dimsi != ofs))
+	 {
+		 throw_size_error (SL_Index_Error);
+		 return NULL;
+	 }
+	 ofs = new_ofs;
+	 }
+ }
+ if (ofs >= at->num_elements)
+ {
+	SLang_set_error (SL_Index_Error);
+	return NULL;
+ }
+ return (VOID_STAR) ((char *)at->data + (ofs * at->sizeof_type));
+}
+
+_INLINE_
+static VOID_STAR get_data_addr (SLang_Array_Type *at, SLindex_Type *dims)
+{
+ VOID_STAR data;
+
+ data = at->data;
+ if (data == NULL)
+ {
+	_pSLang_verror (SL_UNKNOWN_ERROR, "Array has no data");
+	return NULL;
+ }
+
+ data = (*at->index_fun) (at, dims);
+
+ if (data == NULL)
+ {
+	_pSLang_verror (SL_UNKNOWN_ERROR, "Unable to access array element");
+	return NULL;
+ }
+
+ return data;
+}
+
+void _pSLarray_free_array_elements (SLang_Class_Type *cl, VOID_STAR s, SLuindex_Type num)
+{
+ size_t sizeof_type;
+ void (*f) (SLtype, VOID_STAR);
+ char *p;
+ SLtype type;
+
+ if ((cl->cl_class_type == SLANG_CLASS_TYPE_SCALAR)
+ || (cl->cl_class_type == SLANG_CLASS_TYPE_VECTOR))
+ return;
+
+ f = cl->cl_destroy;
+ sizeof_type = cl->cl_sizeof_type;
+ type = cl->cl_data_type;
+
+ p = (char *) s;
+ while (num != 0)
+ {
+	if (NULL != *(VOID_STAR *)p)
+	 {
+	 (*f) (type, (VOID_STAR)p);
+	 *(VOID_STAR *) p = NULL;
+	 }
+	p += sizeof_type;
+	num--;
+ }
+}
+
+static int destroy_element (SLang_Array_Type *at,
+			 SLindex_Type *dims,
+			 VOID_STAR data)
+{
+ data = get_data_addr (at, dims);
+ if (data == NULL)
+ return -1;
+
+ /* This function should only get called for arrays that have
+ * pointer elements. Do not call the destroy method if the element
+ * is NULL.
+ */
+ if (NULL != *(VOID_STAR *)data)
+ {
+	(*at->cl->cl_destroy) (at->data_type, data);
+	*(VOID_STAR *) data = NULL;
+ }
+ return 0;
+}
+
+/* This function only gets called when a new array is created. Thus there
+ * is no need to destroy the object first.
+ */
+static int new_object_element (SLang_Array_Type *at,
+			 SLindex_Type *dims,
+			 VOID_STAR data)
+{
+ data = get_data_addr (at, dims);
+ if (data == NULL)
+ return -1;
+
+ return (*at->cl->cl_init_array_object) (at->data_type, data);
+}
+
+int _pSLarray_next_index (SLindex_Type *dims, SLindex_Type *max_dims, unsigned int num_dims)
+{
+ while (num_dims)
+ {
+	SLindex_Type dims_i;
+
+	num_dims--;
+
+	dims_i = dims num_dims + 1;
+	if (dims_i < (int) max_dims num_dims)
+	 {
+	 dims num_dims = dims_i;
+	 return 0;
+	 }
+	dims num_dims = 0;
+ }
+
+ return -1;
+}
+
+static int do_method_for_all_elements (SLang_Array_Type *at,
+				 int (*method)(SLang_Array_Type *,
+						 SLindex_Type *,
+						 VOID_STAR),
+				 VOID_STAR client_data)
+{
+ SLindex_Type dims SLARRAY_MAX_DIMS;
+ SLindex_Type *max_dims;
+ unsigned int num_dims;
+
+ if (at->num_elements == 0)
+ return 0;
+
+ max_dims = at->dims;
+ num_dims = at->num_dims;
+
+ SLMEMSET((char *)dims, 0, sizeof(dims));
+
+ do
+ {
+	if (-1 == (*method) (at, dims, client_data))
+	 return -1;
+ }
+ while (0 == _pSLarray_next_index (dims, max_dims, num_dims));
+
+ return 0;
+}
+
+static void free_array (SLang_Array_Type *at)
+{
+ unsigned int flags;
+
+ if (at == NULL) return;
+
+ if (at->num_refs > 1)
+ {
+	at->num_refs -= 1;
+	return;
+ }
+
+ flags = at->flags;
+
+ if (flags & SLARR_DATA_VALUE_IS_INTRINSIC)
+ return;			 /* not to be freed */
+
+ if (flags & SLARR_DATA_VALUE_IS_POINTER)
+ (void) do_method_for_all_elements (at, destroy_element, NULL);
+
+ if (at->free_fun != NULL)
+ at->free_fun (at);
+ else
+ SLfree ((char *) at->data);
+
+ SLfree ((char *) at);
+}
+
+void SLang_free_array (SLang_Array_Type *at)
+{
+ free_array (at);
+}
+
+SLang_Array_Type *
+SLang_create_array1 (SLtype type, int read_only, VOID_STAR data,
+		 SLindex_Type *dims, unsigned int num_dims, int no_init)
+{
+ SLang_Class_Type *cl;
+ SLang_Array_Type *at;
+ unsigned int i;
+ SLindex_Type num_elements;
+ SLindex_Type size;
+ int sizeof_type;
+
+ if ((num_dims == 0) || (num_dims > SLARRAY_MAX_DIMS))
+ {
+	_pSLang_verror (SL_NOT_IMPLEMENTED, "%u dimensional arrays are not supported", num_dims);
+	return NULL;
+ }
+
+ for (i = 0; i < num_dims; i++)
+ {
+	if (dimsi < 0)
+	 {
+	 _pSLang_verror (SL_INVALID_PARM, "Size of array dim %u is less than 0", i);
+	 return NULL;
+	 }
+ }
+
+ cl = _pSLclass_get_class (type);
+
+ at = (SLang_Array_Type *) SLmalloc (sizeof(SLang_Array_Type));
+ if (at == NULL)
+ return NULL;
+
+ memset ((char*) at, 0, sizeof(SLang_Array_Type));
+
+ at->data_type = type;
+ at->cl = cl;
+ at->num_dims = num_dims;
+ at->num_refs = 1;
+
+ if (read_only) at->flags = SLARR_DATA_VALUE_IS_READ_ONLY;
+
+ if ((cl->cl_class_type != SLANG_CLASS_TYPE_SCALAR)
+ && (cl->cl_class_type != SLANG_CLASS_TYPE_VECTOR))
+ at->flags |= SLARR_DATA_VALUE_IS_POINTER;
+
+ /* The elements of an array must be addressable by a single index of
+ * SLindex_Type, even for multi-dimensional arrays. E.g.,
+ * a = Int_Typem, n;
+ * i = where (a < 0);
+ * ai = 0;
+ */
+ num_elements = 1;
+ for (i = 0; i < num_dims; i++)
+ {
+	SLindex_Type new_num_elements;
+	at->dimsi = dimsi;
+	new_num_elements = dimsi * num_elements;
+	if (dimsi && (new_num_elements/dimsi != num_elements))
+	 {
+	 throw_size_error (SL_Index_Error);
+	 free_array (at);
+	 return NULL;
+	 }
+	num_elements = new_num_elements;
+ }
+
+ /* Now set the rest of the unused dimensions to 1. This makes it easier
+ * when transposing arrays and when indexing arrays derived from scalars.
+ */
+ while (i < SLARRAY_MAX_DIMS)
+ at->dimsi++ = 1;
+
+ at->num_elements = num_elements;
+ at->index_fun = linear_get_data_addr;
+ sizeof_type = (int) cl->cl_sizeof_type;
+ at->sizeof_type = (unsigned int) sizeof_type;
+
+ if (data != NULL)
+ {
+	at->data = data;
+	return at;
+ }
+
+ size = (num_elements * sizeof_type);
+ if ((size/sizeof_type != num_elements) || (size < 0))
+ {
+	throw_size_error (SL_INVALID_PARM);
+	free_array (at);
+	return NULL;
+ }
+
+ if (size == 0) size = 1;
+
+ if (NULL == (data = (VOID_STAR) SLmalloc (size)))
+ {
+	free_array (at);
+	return NULL;
+ }
+
+ at->data = data;
+
+ if ((no_init == 0) || (at->flags & SLARR_DATA_VALUE_IS_POINTER))
+ memset ((char *) data, 0, size);
+
+ if ((no_init == 0)
+ && (cl->cl_init_array_object != NULL)
+ && (-1 == do_method_for_all_elements (at, new_object_element, NULL)))
+ {
+	free_array (at);
+	return NULL;
+ }
+
+ return at;
+}
+
+SLang_Array_Type *
+SLang_create_array (SLtype type, int read_only, VOID_STAR data,
+		 SLindex_Type *dims, unsigned int num_dims)
+{
+ return SLang_create_array1 (type, read_only, data, dims, num_dims, 0);
+}
+
+int SLang_add_intrinsic_array (SLFUTURE_CONST char *name,
+			 SLtype type,
+			 int read_only,
+			 VOID_STAR data,
+			 unsigned int num_dims, ...)
+{
+ va_list ap;
+ unsigned int i;
+ SLindex_Type dimsSLARRAY_MAX_DIMS;
+ SLang_Array_Type *at;
+
+ if ((num_dims > SLARRAY_MAX_DIMS)
+ || (name == NULL)
+ || (data == NULL))
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Unable to create intrinsic array");
+	return -1;
+ }
+
+ va_start (ap, num_dims);
+ for (i = 0; i < num_dims; i++)
+ dims i = va_arg (ap, int);
+ va_end (ap);
+
+ at = SLang_create_array (type, read_only, data, dims, num_dims);
+ if (at == NULL)
+ return -1;
+ at->flags |= SLARR_DATA_VALUE_IS_INTRINSIC;
+
+ /* Note: The variable that refers to the intrinsic array is regarded as
+ * read-only. That way, Array_Name = another_array; will fail.
+ */
+ if (-1 == SLadd_intrinsic_variable (name, (VOID_STAR) at, SLANG_ARRAY_TYPE, 1))
+ {
+	free_array (at);
+	return -1;
+ }
+ return 0;
+}
+
+static int pop_array_indices (SLindex_Type *dims, unsigned int num_dims)
+{
+ unsigned int n;
+ int i;
+
+ if (num_dims > SLARRAY_MAX_DIMS)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Array size not supported");
+	return -1;
+ }
+
+ n = num_dims;
+ while (n != 0)
+ {
+	n--;
+	if (-1 == SLang_pop_integer (&i))
+	 return -1;
+
+	dimsn = i;
+ }
+
+ return 0;
+}
+
+/* This function gets called via expressions such as Double_Type10, 20;
+ */
+static int push_create_new_array (unsigned int num_dims)
+{
+ SLang_Array_Type *at;
+ SLtype type;
+ SLindex_Type dims SLARRAY_MAX_DIMS;
+ int (*anew) (SLtype, unsigned int);
+
+ if (-1 == SLang_pop_datatype (&type))
+ return -1;
+
+ anew = (_pSLclass_get_class (type))->cl_anew;
+ if (anew != NULL)
+ return (*anew) (type, num_dims);
+
+ if (-1 == pop_array_indices (dims, num_dims))
+ return -1;
+
+ if (NULL == (at = SLang_create_array (type, 0, NULL, dims, num_dims)))
+ return -1;
+
+ return SLang_push_array (at, 1);
+}
+
+static int push_element_at_addr (SLang_Array_Type *at,
+				 VOID_STAR data, int allow_null)
+{
+ SLang_Class_Type *cl;
+
+ cl = at->cl;
+ if ((at->flags & SLARR_DATA_VALUE_IS_POINTER)
+ && (*(VOID_STAR *) data == NULL))
+ {
+	if (allow_null)
+	 return SLang_push_null ();
+
+	_pSLang_verror (SL_VARIABLE_UNINITIALIZED,
+		 "%s array has uninitialized element", cl->cl_name);
+	return -1;
+ }
+
+ return (*cl->cl_apush)(at->data_type, data);
+}
+
+static int coerse_array_to_linear (SLang_Array_Type *at)
+{
+ SLarray_Range_Array_Type *range;
+ VOID_STAR vdata;
+ SLuindex_Type imax;
+
+ /* FIXME: Priority = low. This assumes that if an array is not linear, then
+ * it is a range.
+ */
+ if (0 == (at->flags & SLARR_DATA_VALUE_IS_RANGE))
+ return 0;
+
+ range = (SLarray_Range_Array_Type *) at->data;
+ if ((range->has_last_index == 0) || (range->has_first_index == 0))
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Invalid context for a range array of indeterminate size");
+	return -1;
+ }
+
+ imax = at->num_elements;
+ 
+ vdata = (VOID_STAR) _SLcalloc (imax, at->sizeof_type);
+ if (vdata == NULL)
+ return -1;
+ (void) (*range->to_linear_fun)(at, range, vdata);
+ SLfree ((char *) range);
+ at->data = (VOID_STAR) vdata;
+ at->flags &= ~SLARR_DATA_VALUE_IS_RANGE;
+ at->index_fun = linear_get_data_addr;
+ return 0;
+}
+
+static void
+free_index_objects (SLang_Object_Type *index_objs, unsigned int num_indices)
+{
+ unsigned int i;
+
+ for (i = 0; i < num_indices; i++)
+ {
+	SLang_Object_Type *obj = index_objs + i;
+	if (obj->o_data_type != 0)
+	 SLang_free_object (obj);
+ }
+}
+
+/* If *is_index_array!=0, then only one index object is returned, which is
+ * to index all the elements, and not just a single dimension.
+ */
+static int
+pop_indices (unsigned num_dims, SLindex_Type *dims, SLuindex_Type num_elements,
+	 SLang_Object_Type *index_objs, unsigned int num_indices,
+	 int *is_index_array)
+{
+ unsigned int i;
+
+ memset((char *) index_objs, 0, num_indices * sizeof (SLang_Object_Type));
+
+ *is_index_array = 0;
+
+ if (num_indices != num_dims)
+ {
+	if (num_indices != 1)	 /* when 1, it is an index array */
+	 {
+	 _pSLang_verror (SL_INVALID_PARM, "wrong number of indices for array");
+	 return -1;
+	 }
+ }
+
+ i = num_indices;
+ while (i != 0)
+ {
+	SLang_Object_Type *obj;
+	SLtype data_type;
+	SLang_Array_Type *at;
+
+	i--;
+	obj = index_objs + i;
+	if (SLANG_ARRAY_TYPE != _pSLang_peek_at_stack2 (&data_type))
+	 {
+	 if (-1 == _pSLang_pop_object_of_type (SLANG_ARRAY_INDEX_TYPE, obj, 0))
+	 goto return_error;
+
+	 continue;
+	 }
+	if (data_type != SLANG_ARRAY_INDEX_TYPE)
+	 {
+	 if (-1 == SLclass_typecast (SLANG_ARRAY_INDEX_TYPE, 1, 1))
+	 return -1;
+	 }
+	if (-1 == SLang_pop (obj))
+	 goto return_error;
+
+	at = obj->v.array_val;
+	if (at->flags & SLARR_DATA_VALUE_IS_RANGE)
+	 {
+	 SLarray_Range_Array_Type *r = (SLarray_Range_Array_Type *) at->data;
+	 if ((r->has_last_index == 0) || (r->has_first_index == 0))
+	 {
+		 /* Cases to consider (positive increment)
+		 * : ==> 0:n-1 all elements
+		 * :i ==> 0:i for i>=0, 0:n+i for i<0
+		 * i: ==> i:n-1 for i>=0, i+n:n-1 for i<0
+		 * This will allow: :-3 to index all but last 3, etc.
+		 * Also consider cases with a negative increment:
+		 * ::-1 = n-1,n-2,...0 = n-1:0:-1
+		 * :i:-1 = n-1,n-2,..i = n-1:i:-1
+		 * i::-1 = i,i-1,...0 = i:0:-1
+		 */
+		 SLang_Array_Type *new_at;
+		 SLindex_Type first_index, last_index;
+		 SLindex_Type delta = r->delta;
+		 SLindex_Type n;
+
+		 if (num_indices == 1)/* could be index array */
+		 n = (SLindex_Type)num_elements;
+		 else
+		 n = dimsi;
+
+		 if (r->has_first_index)
+		 {
+		 /* Case 3 */
+		 first_index = r->first_index;
+		 if (first_index < 0) first_index += n;
+		 if (delta > 0) last_index = n-1; else last_index = 0;
+		 }
+		 else if (r->has_last_index)
+		 {
+		 /* case 2 */
+		 if (delta > 0) first_index = 0; else first_index = n-1;
+		 last_index = r->last_index;
+		 if (last_index < 0)
+			 last_index += n;
+		 }
+		 else
+		 {
+		 /* case 0 */
+		 if (delta > 0)
+			 {
+			 first_index = 0;
+			 last_index = n - 1;
+			 }
+		 else
+			 {
+			 first_index = n-1;
+			 last_index = 0;
+			 }
+		 }
+
+		 if (NULL == (new_at = inline_implicit_index_array (&first_index, &last_index, &delta)))
+		 goto return_error;
+
+		 free_array (at);
+		 obj->v.array_val = new_at;
+	 }
+	 }
+	if (num_indices == 1)
+	 {
+	 *is_index_array = 1;
+	 return 0;
+	 }
+ }
+ return 0;
+
+ return_error:
+ free_index_objects (index_objs, num_indices);
+ return -1;
+}
+
+static void do_index_error (SLuindex_Type i, SLindex_Type indx, SLindex_Type dim)
+{
+ _pSLang_verror (SL_Index_Error, "Array index %lu (value=%ld) out of allowed range 0<=index<%ld",
+		 (unsigned long)i, (long)indx, (long)dim);
+}
+
+int _pSLarray_pop_index (unsigned int num_elements, SLang_Array_Type **ind_atp, SLindex_Type *ind)
+{
+ SLang_Object_Type index_obj;
+ SLindex_Type dims;
+ int is_index_array = 0;
+ SLang_Array_Type *ind_at;
+
+ *ind_atp = NULL;
+ dims = (SLindex_Type) num_elements;
+ if (dims < 0)
+ {
+	SLang_verror (SL_Index_Error, "Object is too large to be indexed");
+	return -1;
+ }
+
+ if (-1 == pop_indices (1, &dims, num_elements, &index_obj, 1, &is_index_array))
+ return -1;
+
+ if (index_obj.o_data_type != SLANG_ARRAY_TYPE)
+ {
+	*ind = index_obj.v.index_val;
+	return 0;
+ }
+
+ ind_at = index_obj.v.array_val;
+
+ if (-1 == coerse_array_to_linear (ind_at))
+ {
+	SLang_free_array (ind_at);
+	return -1;
+ }
+ *ind_atp = ind_at;
+ return 0;
+}
+
+static int
+transfer_n_elements (SLang_Array_Type *at, VOID_STAR dest_data, VOID_STAR src_data,
+		 size_t sizeof_type, SLuindex_Type n, int is_ptr)
+{
+ SLtype data_type;
+ SLang_Class_Type *cl;
+
+ if (is_ptr == 0)
+ {
+	SLMEMCPY ((char *) dest_data, (char *)src_data, n * sizeof_type);
+	return 0;
+ }
+
+ data_type = at->data_type;
+ cl = at->cl;
+
+ while (n != 0)
+ {
+	if (*(VOID_STAR *)dest_data != NULL)
+	 {
+	 (*cl->cl_destroy) (data_type, dest_data);
+	 *(VOID_STAR *) dest_data = NULL;
+	 }
+
+	if (*(VOID_STAR *) src_data == NULL)
+	 *(VOID_STAR *) dest_data = NULL;
+	else
+	 {
+	 if (-1 == (*cl->cl_acopy) (data_type, src_data, dest_data))
+	 /* No need to destroy anything */
+	 return -1;
+	 }
+
+	src_data = (VOID_STAR) ((char *)src_data + sizeof_type);
+	dest_data = (VOID_STAR) ((char *)dest_data + sizeof_type);
+
+	n--;
+ }
+
+ return 0;
+}
+
+_INLINE_
+int
+_pSLarray_aget_transfer_elem (SLang_Array_Type *at, SLindex_Type *indices,
+			 VOID_STAR new_data, size_t sizeof_type, int is_ptr)
+{
+ VOID_STAR at_data;
+
+ /* Since 1 element is being transferred, there is no need to coerce
+ * the array to linear.
+ */
+ if (NULL == (at_data = get_data_addr (at, indices)))
+ return -1;
+
+ if (is_ptr == 0)
+ {
+	memcpy ((char *) new_data, (char *)at_data, sizeof_type);
+	return 0;
+ }
+
+ return transfer_n_elements (at, new_data, at_data, sizeof_type, 1, is_ptr);
+}
+
+static int
+aget_transfer_n_elems (SLang_Array_Type *at, SLuindex_Type num, SLindex_Type *start_indices,
+		 VOID_STAR new_data, size_t sizeof_type, int is_ptr)
+{
+ SLuindex_Type i;
+ SLuindex_Type last_index = at->num_dims-1;
+ SLindex_Type indicesSLARRAY_MAX_DIMS;
+
+ if (num == 0)
+ return 0;
+
+ for (i = 0; i <= last_index; i++)
+ indicesi = start_indicesi;
+
+ if ((at->data != NULL)
+ && (at->index_fun == linear_get_data_addr))
+ {
+	VOID_STAR addr_start;
+	if (NULL == (addr_start = linear_get_data_addr (at, indices)))
+	 return -1;
+	indiceslast_index += (num-1);
+	if (NULL == linear_get_data_addr (at, indices))
+	 return -1;
+
+	if (is_ptr == 0)
+	 {
+	 memcpy ((char *) new_data, (char *)addr_start, num * sizeof_type);
+	 return 0;
+	 }
+
+	return transfer_n_elements (at, new_data, (char *)addr_start, sizeof_type, num, is_ptr);
+ }
+
+ for (i = 0; i < num; i++)
+ {
+	VOID_STAR at_data;
+
+	/* Since 1 element is being transferred, there is no need to coerce
+	 * the array to linear.
+	 */
+	if (NULL == (at_data = get_data_addr (at, indices)))
+	 return -1;
+
+	if (is_ptr == 0)
+	 memcpy ((char *) new_data, (char *)at_data, sizeof_type);
+	else if (-1 == transfer_n_elements (at, new_data, at_data, sizeof_type, 1, is_ptr))
+	 return -1;
+
+	new_data = (VOID_STAR) ((char *)new_data + sizeof_type);
+	indiceslast_index++;
+ }
+ return 0;
+}
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+# if SLANG_HAS_FLOAT
+# define GENERIC_TYPE double
+# define AGET_FROM_INDEX_ARRAY_FUN aget_doubles_from_index_array
+# define APUT_FROM_INDEX_ARRAY_FUN aput_doubles_from_index_array
+# include "slagetput.inc"
+# define GENERIC_TYPE float
+# define AGET_FROM_INDEX_ARRAY_FUN aget_floats_from_index_array
+# define APUT_FROM_INDEX_ARRAY_FUN aput_floats_from_index_array
+# include "slagetput.inc"
+# endif
+
+# define GENERIC_TYPE int
+# define AGET_FROM_INDEX_ARRAY_FUN aget_ints_from_index_array
+# define APUT_FROM_INDEX_ARRAY_FUN aput_ints_from_index_array
+# include "slagetput.inc"
+# if LONG_IS_INT
+# define aget_longs_from_index_array aget_ints_from_index_array
+# define aput_longs_from_index_array aput_ints_from_index_array
+# else
+# define GENERIC_TYPE long
+# define AGET_FROM_INDEX_ARRAY_FUN aget_longs_from_index_array
+# define APUT_FROM_INDEX_ARRAY_FUN aput_longs_from_index_array
+# include "slagetput.inc"
+# endif
+# define GENERIC_TYPE char
+# define AGET_FROM_INDEX_ARRAY_FUN aget_chars_from_index_array
+# define APUT_FROM_INDEX_ARRAY_FUN aput_chars_from_index_array
+# include "slagetput.inc"
+# define GENERIC_TYPE short
+# define AGET_FROM_INDEX_ARRAY_FUN aget_shorts_from_index_array
+# define APUT_FROM_INDEX_ARRAY_FUN aput_shorts_from_index_array
+# include "slagetput.inc"
+#endif
+
+static int aget_generic_from_index_array (SLang_Array_Type *at,
+					 SLang_Array_Type *at_ind, int is_range,
+					 unsigned char *dest_data)
+{
+ SLindex_Type *indices, *indices_max;
+ unsigned char *src_data = (unsigned char *) at->data;
+ SLindex_Type num_elements = (SLindex_Type) at->num_elements;
+ size_t sizeof_type = at->sizeof_type;
+ int is_ptr = at->flags & SLARR_DATA_VALUE_IS_POINTER;
+
+ if (is_range)
+ {
+	SLarray_Range_Array_Type *r = (SLarray_Range_Array_Type *)at_ind->data;
+	SLindex_Type idx = r->first_index, delta = r->delta;
+	SLuindex_Type j, jmax = at_ind->num_elements;
+
+	for (j = 0; j < jmax; j++)
+	 {
+	 size_t offset;
+	 SLindex_Type i = idx;
+
+	 if (i < 0)
+	 {
+		 i += num_elements;
+		 if (i < 0)
+		 i = num_elements;
+	 }
+	 if (i >= num_elements)
+	 {
+		 SLang_set_error (SL_Index_Error);
+		 return -1;
+	 }
+	 offset = sizeof_type * (SLuindex_Type)i;
+	 if (-1 == transfer_n_elements (at, (VOID_STAR) dest_data,
+					 (VOID_STAR) (src_data + offset),
+					 sizeof_type, 1, is_ptr))
+	 return -1;
+
+	 dest_data += sizeof_type;
+	 idx += delta;
+	 }
+	return 0;
+ }
+
+ /* Since the index array is linear, I can address it directly */
+ indices = (SLindex_Type *) at_ind->data;
+ indices_max = indices + at_ind->num_elements;
+ while (indices < indices_max)
+ {
+	size_t offset;
+	SLindex_Type i = *indices;
+
+	if (i < 0)
+	 {
+	 i += num_elements;
+	 if (i < 0)
+	 i = num_elements;
+	 }
+	if (i >= num_elements)
+	 {
+	 SLang_set_error (SL_Index_Error);
+	 return -1;
+	 }
+
+	offset = sizeof_type * (SLuindex_Type)i;
+	if (-1 == transfer_n_elements (at, (VOID_STAR) dest_data,
+				 (VOID_STAR) (src_data + offset),
+				 sizeof_type, 1, is_ptr))
+	 return -1;
+
+	dest_data += sizeof_type;
+	indices++;
+ }
+ return 0;
+}
+
+/* Here the ind_at index-array is an n-d array of indices. This function
+ * creates an n-d array of made up of values of 'at' at the locations
+ * specified by the indices. The result is pushed.
+ */
+static int
+aget_from_index_array (SLang_Array_Type *at, SLang_Array_Type *ind_at)
+{
+ SLang_Array_Type *new_at;
+ SLindex_Type num_elements;
+ unsigned char *new_data, *src_data;
+ int is_ptr, is_range;
+
+ if (-1 == coerse_array_to_linear (at))
+ return -1;
+
+ is_range = ind_at->flags & SLARR_DATA_VALUE_IS_RANGE;
+
+ if ((is_range == 0)
+ && (-1 == coerse_array_to_linear (ind_at)))
+ return -1;
+
+ is_ptr = (at->flags & SLARR_DATA_VALUE_IS_POINTER);
+ /* Only initialize the elements of the array if it contains pointers. If
+ * an error occurs when filling the array, the array and its elements will
+ * be freed. Hence, to avoid freeing garbage, the array should be initialized
+ */
+ if (NULL == (new_at = SLang_create_array1 (at->data_type, 0, NULL, ind_at->dims, ind_at->num_dims, !is_ptr)))
+ return -1;
+
+ src_data = (unsigned char *) at->data;
+ new_data = (unsigned char *) new_at->data;
+ num_elements = (SLindex_Type) at->num_elements;
+
+ if (num_elements < 0)
+ {
+	_pSLang_verror (SL_Index_Error, "Array is too large to be indexed using an index-array");
+	goto return_error;
+ }
+
+ switch (at->data_type)
+ {
+#if SLANG_OPTIMIZE_FOR_SPEED
+# if SLANG_HAS_FLOAT
+ case SLANG_DOUBLE_TYPE:
+	if (-1 == aget_doubles_from_index_array ((double *)src_data, num_elements,
+						 ind_at, is_range, (double *)new_data))
+	 goto return_error;
+	break;
+ case SLANG_FLOAT_TYPE:
+	if (-1 == aget_floats_from_index_array ((float *)src_data, num_elements,
+						ind_at, is_range, (float *)new_data))
+	 goto return_error;
+	break;
+# endif
+ case SLANG_CHAR_TYPE:
+ case SLANG_UCHAR_TYPE:
+	if (-1 == aget_chars_from_index_array ((char *)src_data, num_elements,
+					 ind_at, is_range, (char *)new_data))
+	 goto return_error;
+	break;
+ case SLANG_SHORT_TYPE:
+ case SLANG_USHORT_TYPE:
+	if (-1 == aget_shorts_from_index_array ((short *)src_data, num_elements,
+					 ind_at, is_range, (short *)new_data))
+	 goto return_error;
+	break;
+
+ case SLANG_LONG_TYPE:
+ case SLANG_ULONG_TYPE:
+	/* drop */
+# if LONG_IS_NOT_INT
+	if (-1 == aget_longs_from_index_array ((long *)src_data, num_elements,
+					 ind_at, is_range, (long *)new_data))
+	 goto return_error;
+	break;
+# endif
+ case SLANG_INT_TYPE:
+ case SLANG_UINT_TYPE:
+	if (-1 == aget_ints_from_index_array ((int *)src_data, num_elements,
+					 ind_at, is_range, (int *)new_data))
+	 goto return_error;
+	break;
+#endif
+ default:
+	if (-1 == aget_generic_from_index_array (at, ind_at, is_range, new_data))
+	 goto return_error;
+ }
+
+ return SLang_push_array (new_at, 1);
+
+ return_error:
+ free_array (new_at);
+ return -1;
+}
+
+/* This is extremely ugly. It is due to the fact that the index_objects
+ * may contain ranges. This is a utility function for the aget/aput
+ * routines
+ */
+static int
+convert_nasty_index_objs (SLang_Array_Type *at,
+			 SLang_Object_Type *index_objs,
+			 unsigned int num_indices,
+			 SLindex_Type **index_data,
+			 SLindex_Type *range_buf, SLindex_Type *range_delta_buf,
+			 SLindex_Type *max_dims,
+			 SLuindex_Type *num_elements,
+			 int *is_array, int is_dim_arraySLARRAY_MAX_DIMS)
+{
+ SLuindex_Type i, total_num_elements;
+ SLang_Array_Type *ind_at;
+
+ if (num_indices != at->num_dims)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Array requires %u indices", at->num_dims);
+	return -1;
+ }
+
+ *is_array = 0;
+ total_num_elements = 1;
+ for (i = 0; i < num_indices; i++)
+ {
+	SLuindex_Type new_total_num_elements;
+	SLang_Object_Type *obj = index_objs + i;
+	range_delta_buf i = 0;
+
+	if (obj->o_data_type == SLANG_ARRAY_INDEX_TYPE)
+	 {
+	 range_buf i = obj->v.index_val;
+	 max_dims i = 1;
+	 index_datai = range_buf + i;
+	 is_dim_arrayi = 0;
+	 }
+#if SLANG_ARRAY_INDEX_TYPE != SLANG_INT_TYPE
+	else if (obj->o_data_type == SLANG_INT_TYPE)
+	 {
+	 range_buf i = obj->v.index_val;
+	 max_dims i = 1;
+	 index_datai = range_buf + i;
+	 is_dim_arrayi = 0;
+	 }
+#endif
+	else
+	 {
+	 *is_array = 1;
+	 is_dim_arrayi = 1;
+	 ind_at = obj->v.array_val;
+
+	 if (ind_at->flags & SLARR_DATA_VALUE_IS_RANGE)
+	 {
+		 SLarray_Range_Array_Type *r;
+
+		 r = (SLarray_Range_Array_Type *) ind_at->data;
+		 range_bufi = r->first_index;
+		 range_delta_buf i = r->delta;
+		 max_dimsi = (SLindex_Type) ind_at->num_elements;
+	 }
+	 else
+	 {
+		 index_data i = (SLindex_Type *) ind_at->data;
+		 max_dimsi = (SLindex_Type) ind_at->num_elements;
+	 }
+	 }
+
+	new_total_num_elements = total_num_elements * max_dimsi;
+	if (max_dimsi && (new_total_num_elements/max_dimsi != total_num_elements))
+	 {
+	 throw_size_error (SL_INVALID_PARM);
+	 return -1;
+	 }
+ total_num_elements = new_total_num_elements;
+ }
+
+ *num_elements = total_num_elements;
+ return 0;
+}
+
+/* This routine pushes a 1-d vector of values from 'at' indexed by
+ * the objects 'index_objs'. These objects can either be integers or
+ * 1-d integer arrays. The fact that the 1-d arrays can be ranges
+ * makes this look ugly.
+ */
+static int
+aget_from_indices (SLang_Array_Type *at,
+		 SLang_Object_Type *index_objs, unsigned int num_indices)
+{
+ SLindex_Type *index_data SLARRAY_MAX_DIMS;
+ SLindex_Type range_buf SLARRAY_MAX_DIMS;
+ SLindex_Type range_delta_buf SLARRAY_MAX_DIMS;
+ SLindex_Type max_dims SLARRAY_MAX_DIMS;
+ SLuindex_Type i, num_elements;
+ SLang_Array_Type *new_at;
+ SLindex_Type map_indicesSLARRAY_MAX_DIMS;
+ SLindex_Type indices SLARRAY_MAX_DIMS;
+ SLindex_Type *at_dims;
+ size_t sizeof_type;
+ int is_ptr, ret, is_array;
+ char *new_data;
+ SLang_Class_Type *cl;
+ int is_dim_arraySLARRAY_MAX_DIMS;
+ SLuindex_Type last_index;
+ SLindex_Type last_index_num;
+
+ if (-1 == convert_nasty_index_objs (at, index_objs, num_indices,
+				 index_data, range_buf, range_delta_buf,
+				 max_dims, &num_elements, &is_array,
+				 is_dim_array))
+ return -1;
+
+ is_ptr = (at->flags & SLARR_DATA_VALUE_IS_POINTER);
+ sizeof_type = at->sizeof_type;
+
+ /* cl = _pSLclass_get_class (at->data_type); */
+ cl = at->cl;
+
+ if ((is_array == 0) && (num_elements == 1))
+ {
+	new_data = (char *)cl->cl_transfer_buf;
+	memset (new_data, 0, sizeof_type);
+	new_at = NULL;
+ }
+ else
+ {
+	SLindex_Type i_num_elements = (SLindex_Type)num_elements;
+
+	new_at = SLang_create_array (at->data_type, 0, NULL, &i_num_elements, 1);
+	if (NULL == new_at)
+	 return -1;
+
+	new_data = (char *)new_at->data;
+
+	if (num_elements == 0)
+	 goto fixup_dims;
+ }
+
+ at_dims = at->dims;
+ memset ((char *) map_indices, 0, sizeof(map_indices));
+
+ last_index = num_indices - 1;
+ /* if last_index_num is non-zero, then that many can be transferred quickly */
+ if ((range_delta_buflast_index == 1) && (range_buflast_index >= 0))
+ last_index_num = max_dimslast_index;
+ else
+ last_index_num = 0;
+
+ while (1)
+ {
+	for (i = 0; i < num_indices; i++)
+	 {
+	 SLindex_Type j = map_indicesi;
+	 SLindex_Type indx;
+
+	 if (0 != range_delta_bufi)
+	 indx = range_bufi + j * range_delta_bufi;
+	 else
+	 indx = index_data ij;
+
+	 if (indx < 0)
+	 indx += at_dimsi;
+
+	 if ((indx < 0) || (indx >= at_dimsi))
+	 {
+		 do_index_error (i, indx, at_dimsi);
+		 free_array (new_at);
+		 return -1;
+	 }
+	 indicesi = indx;
+	 }
+
+	if (last_index_num)
+	 {
+	 if (-1 == aget_transfer_n_elems (at, last_index_num, indices, (VOID_STAR)new_data, sizeof_type, is_ptr))
+	 {
+		 free_array (new_at);
+		 return -1;
+	 }
+	 new_data += last_index_num * sizeof_type;
+	 map_indiceslast_index = last_index_num;
+
+	 if (0 != _pSLarray_next_index (map_indices, max_dims, num_indices))
+	 break;
+	 }
+	else
+	 {
+	 if (-1 == _pSLarray_aget_transfer_elem (at, indices, (VOID_STAR)new_data, sizeof_type, is_ptr))
+	 {
+		 free_array (new_at);
+		 return -1;
+	 }
+	 new_data += sizeof_type;
+
+	 if (num_indices == 1)
+	 {
+		 map_indices0++;
+		 if (map_indices0 == max_dims0)
+		 break;
+	 }
+	 else if (0 != _pSLarray_next_index (map_indices, max_dims, num_indices))
+	 break;
+	 }
+ }
+
+fixup_dims:
+
+ if (new_at != NULL)
+ {
+	int num_dims = 0;
+	/* Fixup dimensions on array */
+	for (i = 0; i < num_indices; i++)
+	 {
+	 if (is_dim_arrayi) /* was: (max_dimsi > 1) */
+	 {
+		 new_at->dimsnum_dims = max_dimsi;
+		 num_dims++;
+	 }
+	 }
+
+	if (num_dims != 0) new_at->num_dims = num_dims;
+	return SLang_push_array (new_at, 1);
+ }
+
+ /* Here new_data is a whole new copy, so free it after the push */
+ new_data -= sizeof_type;
+ if (is_ptr && (*(VOID_STAR *)new_data == NULL))
+ ret = SLang_push_null ();
+ else
+ {
+	ret = (*cl->cl_apush) (at->data_type, (VOID_STAR)new_data);
+	(*cl->cl_adestroy) (at->data_type, (VOID_STAR)new_data);
+ }
+
+ return ret;
+}
+
+static void do_nothing (SLang_Array_Type *at)
+{
+ (void) at;
+}
+
+static int push_string_as_array (unsigned char *s, SLstrlen_Type len, int is_transient)
+{
+ SLindex_Type ilen;
+ SLang_Array_Type *at;
+
+ ilen = (SLindex_Type) len;
+
+ if (is_transient)
+ {
+	if (NULL == (at = SLang_create_array (SLANG_UCHAR_TYPE, 0, s, &ilen, 1)))
+	 return -1;
+	at->free_fun = do_nothing;
+ }
+ else
+ {
+	if (NULL == (at = SLang_create_array (SLANG_UCHAR_TYPE, 0, NULL, &ilen, 1)))
+	 return -1;
+
+	memcpy ((char *)at->data, (char *)s, len);
+ }
+
+ return SLang_push_array (at, 1);
+}
+
+static int pop_array_as_string (char **sp)
+{
+ SLang_Array_Type *at;
+ int ret;
+
+ *sp = NULL;
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_UCHAR_TYPE))
+ return -1;
+
+ ret = 0;
+
+ if (NULL == (*sp = SLang_create_nslstring ((char *) at->data, at->num_elements)))
+ ret = -1;
+
+ free_array (at);
+ return ret;
+}
+
+static int pop_array_as_bstring (SLang_BString_Type **bs)
+{
+ SLang_Array_Type *at;
+ int ret;
+
+ *bs = NULL;
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_UCHAR_TYPE))
+ return -1;
+
+ ret = 0;
+
+ if (NULL == (*bs = SLbstring_create ((unsigned char *) at->data, at->num_elements)))
+ ret = -1;
+
+ free_array (at);
+ return ret;
+}
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+/* This routine assumes that the array is 1d */
+int _pSLarray1d_push_elem (SLang_Array_Type *at, SLindex_Type idx)
+{
+ VOID_STAR data;
+ char *new_data;
+ size_t sizeof_type;
+ int is_ptr, ret;
+ SLang_Class_Type *cl;
+
+ switch (at->data_type)
+ {
+ case SLANG_CHAR_TYPE:
+	if (NULL == (data = at->index_fun(at, &idx))) return -1;
+	return SLclass_push_char_obj (SLANG_CHAR_TYPE, *(signed char *)data);
+
+ case SLANG_INT_TYPE:
+	if (NULL == (data = at->index_fun(at, &idx))) return -1;
+	return SLclass_push_int_obj (SLANG_INT_TYPE, *(int *)data);
+
+#if SLANG_HAS_FLOAT
+ case SLANG_DOUBLE_TYPE:
+	if (NULL == (data = at->index_fun(at, &idx))) return -1;
+	return SLclass_push_double_obj (SLANG_DOUBLE_TYPE, *(double *)data);
+#endif
+ }
+
+ is_ptr = (at->flags & SLARR_DATA_VALUE_IS_POINTER);
+ sizeof_type = at->sizeof_type;
+ cl = at->cl;
+ new_data = (char *)cl->cl_transfer_buf;
+ memset (new_data, 0, sizeof_type);
+
+ if (-1 == _pSLarray_aget_transfer_elem (at, &idx, (VOID_STAR)new_data, sizeof_type, is_ptr))
+ return -1;
+
+ if (is_ptr && (*(VOID_STAR *)new_data == NULL))
+ return SLang_push_null ();
+
+ ret = (*cl->cl_apush) (at->data_type, (VOID_STAR)new_data);
+ (*cl->cl_adestroy) (at->data_type, (VOID_STAR)new_data);
+ return ret;
+}
+#endif
+
+static int aget_from_array (unsigned int num_indices)
+{
+ SLang_Array_Type *at;
+ SLang_Object_Type index_objs SLARRAY_MAX_DIMS;
+ int ret;
+ int is_index_array, free_indices;
+
+ /* Implementation note: The push_string_element function calls this with
+ * num_indices==1, and assumes that the pop_array call below will happen.
+ * No code should be added between these checks and the pop_array call.
+ */
+ if (num_indices == 0)
+ {
+	SLang_set_error (SL_Index_Error);
+	return -1;
+ }
+ if (num_indices > SLARRAY_MAX_DIMS)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Number of dims must be less than %d", 1+SLARRAY_MAX_DIMS);
+	return -1;
+ }
+ if (-1 == pop_array (&at, 1))
+ return -1;
+
+ /* Allow a scalar to be indexed using any number of indices, e.g.,
+ * x = 2; a = x0; b = x0,0;
+ */
+ if ((at->flags & SLARR_DERIVED_FROM_SCALAR)
+ && (at->num_refs == 1))
+ {
+	at->num_dims = num_indices;
+ }
+
+ if (-1 == pop_indices (at->num_dims, at->dims, at->num_elements, index_objs, num_indices, &is_index_array))
+ {
+	free_array (at);
+	return -1;
+ }
+ free_indices = 1;
+
+ if (is_index_array == 0)
+ {
+#if SLANG_OPTIMIZE_FOR_SPEED
+	if ((num_indices == 1)
+	 && (index_objs0.o_data_type == SLANG_ARRAY_INDEX_TYPE)
+	 && (at->num_dims == 1))
+	 {
+	 ret = _pSLarray1d_push_elem (at, index_objs0.v.index_val);
+	 free_indices = 0;
+	 }
+	else
+#endif
+	ret = aget_from_indices (at, index_objs, num_indices);
+ }
+ else
+ ret = aget_from_index_array (at, index_objs0.v.array_val);
+
+ free_array (at);
+ if (free_indices)
+ {
+	unsigned int i;
+	for (i = 0; i < num_indices; i++)
+	 SLang_free_object (index_objs + i);
+ }
+
+ return ret;
+}
+
+static int push_string_element (SLtype type, unsigned char *s, SLuindex_Type len)
+{
+ SLindex_Type i;
+
+ if (SLang_peek_at_stack () == SLANG_ARRAY_TYPE)
+ {
+	char *str;
+
+	/* The indices are array values. So, do this: */
+	if (-1 == push_string_as_array (s, len, 1))
+	 return -1;
+
+	if (-1 == aget_from_array (1))
+	 return -1;
+
+	if (type == SLANG_BSTRING_TYPE)
+	 {
+	 SLang_BString_Type *bs;
+	 int ret;
+
+	 if (-1 == pop_array_as_bstring (&bs))
+	 return -1;
+
+	 ret = SLang_push_bstring (bs);
+	 SLbstring_free (bs);
+	 return ret;
+	 }
+
+	if (-1 == pop_array_as_string (&str))
+	 return -1;
+	return _pSLang_push_slstring (str); /* frees s upon error */
+ }
+
+ if (-1 == SLang_pop_array_index (&i))
+ return -1;
+
+ if (i < 0) i = i + (SLindex_Type)len;
+ if ((SLuindex_Type) i > len)
+ i = len;			 /* get \0 character --- bstrings include it as well */
+
+ return SLang_push_uchar (s(SLuindex_Type)i);
+}
+
+/* ARRAYi, j, k generates code: __args i j ...k ARRAY __aput/__aget
+ * Here i, j, ... k may be a mixture of integers and 1-d arrays, or
+ * a single array of indices. The index array is generated by the
+ * 'where' function.
+ *
+ * If ARRAY is of type DataType, then this function will create an array of
+ * the appropriate type. In that case, the indices i, j, ..., k must be
+ * integers.
+ */
+int _pSLarray_aget1 (unsigned int num_indices)
+{
+ int type;
+ int (*aget_fun) (SLtype, unsigned int);
+
+ type = SLang_peek_at_stack ();
+ switch (type)
+ {
+ case -1:
+	return -1;		 /* stack underflow */
+
+ case SLANG_DATATYPE_TYPE:
+	return push_create_new_array (num_indices);
+
+ case SLANG_BSTRING_TYPE:
+	if (1 == num_indices)
+	 {
+	 SLang_BString_Type *bs;
+	 int ret;
+	 SLstrlen_Type len;
+	 unsigned char *s;
+
+	 if (-1 == SLang_pop_bstring (&bs))
+	 return -1;
+
+	 if (NULL == (s = SLbstring_get_pointer (bs, &len)))
+	 ret = -1;
+	 else
+	 ret = push_string_element (type, s, len);
+
+	 SLbstring_free (bs);
+	 return ret;
+	 }
+	break;
+
+ case SLANG_STRING_TYPE:
+	if (1 == num_indices)
+	 {
+	 char *s;
+	 int ret;
+
+	 if (-1 == SLang_pop_slstring (&s))
+	 return -1;
+
+	 ret = push_string_element (type, (unsigned char *)s, _pSLstring_bytelen (s));
+	 _pSLang_free_slstring (s);
+	 return ret;
+	 }
+	break;
+
+ case SLANG_ARRAY_TYPE:
+	break;
+
+ case SLANG_ASSOC_TYPE:
+	return _pSLassoc_aget (type, num_indices);
+
+ default:
+	aget_fun = _pSLclass_get_class (type)->cl_aget;
+	if (NULL != aget_fun)
+	 return (*aget_fun) (type, num_indices);
+ }
+
+ return aget_from_array (num_indices);
+}
+
+int _pSLarray_aget (void)
+{
+ return _pSLarray_aget1 ((unsigned int)(SLang_Num_Function_Args-1));
+}
+
+/* Aindices...indices+num = data... */
+static int
+aput_transfer_n_elems (SLang_Array_Type *at, SLindex_Type num, SLindex_Type *start_indices,
+		 char *data_to_put, SLuindex_Type data_increment, size_t sizeof_type, int is_ptr)
+{
+ VOID_STAR addr_start;
+ SLindex_Type i;
+ int last_index = (int)at->num_dims-1;
+ SLindex_Type indicesSLARRAY_MAX_DIMS;
+
+ if (num == 0)
+ return 0;
+
+ for (i = 0; i <= (int) last_index; i++)
+ indicesi = start_indicesi;
+
+ if ((at->data != NULL)
+ && (at->index_fun == linear_get_data_addr))
+ {
+	VOID_STAR addr_end;
+	if (NULL == (addr_start = linear_get_data_addr (at, indices)))
+	 return -1;
+	indiceslast_index += (num-1);
+	if (NULL == (addr_end = linear_get_data_addr (at, indices)))
+	 return -1;
+
+	if (is_ptr == 0)
+	 {
+	 while (addr_start <= addr_end)
+	 {
+		 memcpy ((char *) addr_start, data_to_put, sizeof_type);
+		 data_to_put += data_increment;
+		 addr_start = (VOID_STAR) ((char *)addr_start + sizeof_type);
+	 }
+	 return 0;
+	 }
+
+	while (addr_start <= addr_end)
+	 {
+	 if (-1 == transfer_n_elements (at, addr_start, data_to_put, sizeof_type, 1, is_ptr))
+	 return -1;
+	 data_to_put += data_increment;
+	 addr_start = (VOID_STAR) ((char *)addr_start + sizeof_type);
+	 }
+	return 0;
+ }
+
+ for (i = 0; i < num; i++)
+ {
+	/* Since 1 element is being transferred, there is no need to coerce
+	 * the array to linear.
+	 */
+	if (NULL == (addr_start = get_data_addr (at, indices)))
+	 return -1;
+
+	if (is_ptr == 0)
+	 memcpy ((char *) addr_start, data_to_put, sizeof_type);
+	else if (-1 == transfer_n_elements (at, addr_start, (VOID_STAR)data_to_put, sizeof_type, 1, is_ptr))
+	 return -1;
+
+	data_to_put += data_increment;
+	indiceslast_index++;
+ }
+ return 0;
+}
+
+_INLINE_ int
+_pSLarray_aput_transfer_elem (SLang_Array_Type *at, SLindex_Type *indices,
+			 VOID_STAR data_to_put, size_t sizeof_type, int is_ptr)
+{
+ VOID_STAR at_data;
+
+ /*
+ * A range array is not allowed here. I should add a check for it. At
+ * the moment, one will not get here.
+ */
+ if (NULL == (at_data = get_data_addr (at, indices)))
+ return -1;
+
+ if (is_ptr == 0)
+ {
+	memcpy ((char *) at_data, (char *)data_to_put, sizeof_type);
+	return 0;
+ }
+
+ return transfer_n_elements (at, at_data, data_to_put, sizeof_type, 1, is_ptr);
+}
+
+static int
+aput_get_data_to_put (SLang_Class_Type *cl, SLuindex_Type num_elements, int allow_array,
+		 SLang_Array_Type **at_ptr, char **data_to_put, SLuindex_Type *data_increment)
+{
+ SLtype data_type;
+ int type;
+ SLang_Array_Type *at;
+
+ *at_ptr = NULL;
+
+ data_type = cl->cl_data_type;
+ type = SLang_peek_at_stack ();
+
+ if ((SLtype)type != data_type)
+ {
+	if ((type != SLANG_NULL_TYPE)
+	 || ((cl->cl_class_type != SLANG_CLASS_TYPE_PTR)
+		&& (cl->cl_class_type != SLANG_CLASS_TYPE_MMT)))
+	 {
+	 if (-1 == SLclass_typecast (data_type, 1, allow_array))
+	 return -1;
+	 }
+	else
+	 {
+	 /* This bit of code allows, e.g., a10 = NULL; */
+	 *data_increment = 0;
+	 *data_to_put = (char *) cl->cl_transfer_buf;
+	 *((char **)cl->cl_transfer_buf) = NULL;
+	 return SLdo_pop ();
+	 }
+ }
+
+ if (allow_array
+ && (data_type != SLANG_ARRAY_TYPE)
+ && (data_type != SLANG_ANY_TYPE)
+ && (SLANG_ARRAY_TYPE == SLang_peek_at_stack ()))
+ {
+	if (-1 == SLang_pop_array (&at, 0))
+	 return -1;
+
+	if ((at->num_elements != num_elements)
+#if 0
+	 || (at->num_dims != 1)
+#endif
+	 )
+	 {
+	 _pSLang_verror (SL_Index_Error, "Array size is inappropriate for use with index-array");
+	 free_array (at);
+	 return -1;
+	 }
+
+	*data_to_put = (char *) at->data;
+	*data_increment = at->sizeof_type;
+	*at_ptr = at;
+	return 0;
+ }
+
+ *data_increment = 0;
+ *data_to_put = (char *) cl->cl_transfer_buf;
+
+ if (-1 == (*cl->cl_apop)(data_type, (VOID_STAR) *data_to_put))
+ return -1;
+
+ return 0;
+}
+
+static int
+aput_from_indices (SLang_Array_Type *at,
+		 SLang_Object_Type *index_objs, unsigned int num_indices)
+{
+ SLindex_Type *index_data SLARRAY_MAX_DIMS;
+ SLindex_Type range_buf SLARRAY_MAX_DIMS;
+ SLindex_Type range_delta_buf SLARRAY_MAX_DIMS;
+ SLindex_Type max_dims SLARRAY_MAX_DIMS;
+ SLindex_Type *at_dims;
+ SLuindex_Type i, num_elements;
+ SLang_Array_Type *bt;
+ SLindex_Type map_indicesSLARRAY_MAX_DIMS;
+ SLindex_Type indices SLARRAY_MAX_DIMS;
+ size_t sizeof_type;
+ int is_ptr, is_array, ret;
+ char *data_to_put;
+ SLuindex_Type data_increment;
+ SLang_Class_Type *cl;
+ int is_dim_array SLARRAY_MAX_DIMS;
+ SLindex_Type last_index_num;
+ unsigned int last_index;
+
+ if (-1 == convert_nasty_index_objs (at, index_objs, num_indices,
+				 index_data, range_buf, range_delta_buf,
+				 max_dims, &num_elements, &is_array,
+				 is_dim_array))
+ return -1;
+
+ cl = at->cl;
+
+ if (-1 == aput_get_data_to_put (cl, num_elements, is_array,
+				 &bt, &data_to_put, &data_increment))
+ return -1;
+
+ sizeof_type = at->sizeof_type;
+ is_ptr = (at->flags & SLARR_DATA_VALUE_IS_POINTER);
+
+ ret = -1;
+
+ at_dims = at->dims;
+ SLMEMSET((char *) map_indices, 0, sizeof(map_indices));
+
+ last_index = num_indices - 1;
+ /* if last_index_num is non-zero, then that many can be transferred quickly */
+ if ((range_delta_buflast_index == 1) && (range_buflast_index >= 0))
+ last_index_num = max_dimslast_index;
+ else
+ last_index_num = 0;
+
+ if (num_elements) while (1)
+ {
+	for (i = 0; i < num_indices; i++)
+	 {
+	 SLindex_Type j = map_indicesi;
+	 SLindex_Type indx;
+
+	 if (0 != range_delta_bufi)
+	 indx = range_bufi + j * range_delta_bufi;
+	 else
+	 indx = index_data ij;
+
+	 if (indx < 0)
+	 indx += at_dimsi;
+
+	 if ((indx < 0) || (indx >= at_dimsi))
+	 {
+		 do_index_error (i, indx, at_dimsi);
+		 goto return_error;
+	 }
+	 indicesi = indx;
+	 }
+
+	if (last_index_num)
+	 {
+	 if (-1 == aput_transfer_n_elems (at, last_index_num, indices,
+					 data_to_put, data_increment,
+					 sizeof_type, is_ptr))
+	 goto return_error;
+
+	 data_to_put += last_index_num * data_increment;
+	 map_indiceslast_index = last_index_num;
+
+	 if (0 != _pSLarray_next_index (map_indices, max_dims, num_indices))
+	 break;
+	 }
+	else
+	 {
+	 if (-1 == _pSLarray_aput_transfer_elem (at, indices, (VOID_STAR)data_to_put, sizeof_type, is_ptr))
+	 goto return_error;
+
+	 data_to_put += data_increment;
+	 if (num_indices == 1)
+	 {
+		 map_indices0++;
+		 if (map_indices0 == max_dims0)
+		 break;
+	 }
+	 else if (0 != _pSLarray_next_index (map_indices, max_dims, num_indices))
+	 break;
+	 }
+ }
+
+ ret = 0;
+
+ /* drop */
+
+ return_error:
+ if (bt == NULL)
+ {
+	if (is_ptr)
+	 (*cl->cl_destroy) (cl->cl_data_type, (VOID_STAR) data_to_put);
+ }
+ else free_array (bt);
+
+ return ret;
+}
+
+static int
+ aput_generic_from_index_array (char *src_data,
+				 SLuindex_Type data_increment,
+				 SLang_Array_Type *ind_at, int is_range,
+				 SLang_Array_Type *dest_at)
+{
+ SLindex_Type num_elements = (SLindex_Type) dest_at->num_elements;
+ size_t sizeof_type = dest_at->sizeof_type;
+ int is_ptr = dest_at->flags & SLARR_DATA_VALUE_IS_POINTER;
+ char *dest_data = (char *)dest_at->data;
+ SLindex_Type *indices, *indices_max;
+
+ if (is_range)
+ {
+	SLarray_Range_Array_Type *r = (SLarray_Range_Array_Type *)ind_at->data;
+	SLindex_Type idx = r->first_index, delta = r->delta;
+	SLuindex_Type j, jmax = ind_at->num_elements;
+
+	for (j = 0; j < jmax; j++)
+	 {
+	 size_t offset;
+	 SLindex_Type i = idx;
+
+	 if (i < 0)
+	 {
+		 i += num_elements;
+		 if (i < 0)
+		 i = num_elements;
+	 }
+	 if (i >= num_elements)
+	 {
+		 SLang_set_error (SL_Index_Error);
+		 return -1;
+	 }
+	 offset = sizeof_type * (SLuindex_Type)i;
+	 if (-1 == transfer_n_elements (dest_at, (VOID_STAR) (dest_data + offset),
+					 (VOID_STAR) src_data, sizeof_type,
+					 1, is_ptr))
+	 return -1;
+
+	 src_data += data_increment;
+	 idx += delta;
+	 }
+	return 0;
+ }
+
+ /* Since the index array is linear, I can address it directly */
+ indices = (SLindex_Type *) ind_at->data;
+ indices_max = indices + ind_at->num_elements;
+
+ while (indices < indices_max)
+ {
+	size_t offset;
+	SLindex_Type i = *indices;
+
+	if (i < 0)
+	 {
+	 i += num_elements;
+	 if (i < 0)
+	 i = num_elements;
+	 }
+	if (i >= num_elements)
+	 {
+	 SLang_set_error (SL_Index_Error);
+	 return -1;
+	 }
+
+	offset = sizeof_type * (SLuindex_Type)i;
+
+	if (-1 == transfer_n_elements (dest_at, (VOID_STAR) (dest_data + offset),
+				 (VOID_STAR) src_data, sizeof_type, 1,
+				 is_ptr))
+	 return -1;
+
+	indices++;
+	src_data += data_increment;
+ }
+
+ return 0;
+}
+
+static int
+aput_from_index_array (SLang_Array_Type *at, SLang_Array_Type *ind_at)
+{
+ char *data_to_put, *dest_data;
+ SLuindex_Type data_increment;
+ SLindex_Type num_elements;
+ int is_ptr, is_range;
+ SLang_Array_Type *bt;
+ SLang_Class_Type *cl;
+ int ret;
+
+ if (-1 == coerse_array_to_linear (at))
+ return -1;
+
+ is_range = ind_at->flags & SLARR_DATA_VALUE_IS_RANGE;
+
+ if ((is_range == 0)
+ && (-1 == coerse_array_to_linear (ind_at)))
+ return -1;
+
+ cl = at->cl;
+
+ /* Note that if bt is returned as non NULL, then the array is a linear
+ * one.
+ */
+ if (-1 == aput_get_data_to_put (cl, ind_at->num_elements, 1,
+				 &bt, &data_to_put, &data_increment))
+ return -1;
+
+ is_ptr = (at->flags & SLARR_DATA_VALUE_IS_POINTER);
+ dest_data = (char *) at->data;
+ num_elements = (SLindex_Type) at->num_elements;
+
+ ret = -1;
+ switch (at->data_type)
+ {
+#if SLANG_OPTIMIZE_FOR_SPEED
+# if SLANG_HAS_FLOAT
+ case SLANG_DOUBLE_TYPE:
+	if (-1 == aput_doubles_from_index_array (data_to_put, data_increment,
+						 ind_at, is_range,
+						 (double*)dest_data, num_elements))
+	 goto return_error;
+	break;
+
+ case SLANG_FLOAT_TYPE:
+	if (-1 == aput_floats_from_index_array (data_to_put, data_increment,
+						ind_at, is_range,
+						(float*)dest_data, num_elements))
+	 goto return_error;
+	break;
+# endif
+
+ case SLANG_CHAR_TYPE:
+ case SLANG_UCHAR_TYPE:
+	if (-1 == aput_chars_from_index_array (data_to_put, data_increment,
+					 ind_at, is_range,
+					 (char*)dest_data, num_elements))
+	 goto return_error;
+	break;
+ case SLANG_SHORT_TYPE:
+ case SLANG_USHORT_TYPE:
+	if (-1 == aput_shorts_from_index_array (data_to_put, data_increment,
+						ind_at, is_range,
+						(short*)dest_data, num_elements))
+	 goto return_error;
+	break;
+
+ case SLANG_LONG_TYPE:
+ case SLANG_ULONG_TYPE:
+	/* drop */
+#if LONG_IS_NOT_INT
+	if (-1 == aput_longs_from_index_array (data_to_put, data_increment,
+					 ind_at, is_range,
+					 (long*)dest_data, num_elements))
+	 goto return_error;
+	break;
+#endif
+ case SLANG_INT_TYPE:
+ case SLANG_UINT_TYPE:
+	if (-1 == aput_ints_from_index_array (data_to_put, data_increment,
+					 ind_at, is_range,
+					 (int*)dest_data, num_elements))
+	 goto return_error;
+	break;
+#endif
+ default:
+	if (-1 == aput_generic_from_index_array (data_to_put, data_increment,
+						 ind_at, is_range, at))
+	 goto return_error;
+ }
+
+ ret = 0;
+ /* Drop */
+
+ return_error:
+
+ if (bt == NULL)
+ {
+	if (is_ptr)
+	 (*cl->cl_destroy) (cl->cl_data_type, (VOID_STAR)data_to_put);
+ }
+ else free_array (bt);
+
+ return ret;
+}
+
+/* ARRAYi, j, k = generates code: __args i j k ARRAY __aput
+ */
+int _pSLarray_aput1 (unsigned int num_indices)
+{
+ SLang_Array_Type *at;
+ SLang_Object_Type index_objs SLARRAY_MAX_DIMS;
+ int ret;
+ int is_index_array;
+ int (*aput_fun) (SLtype, unsigned int);
+ int type;
+
+ ret = -1;
+
+ type = SLang_peek_at_stack ();
+ switch (type)
+ {
+ case -1:
+	return -1;
+
+ case SLANG_ARRAY_TYPE:
+	break;
+
+ case SLANG_ASSOC_TYPE:
+	return _pSLassoc_aput (type, num_indices);
+
+ default:
+	if (NULL != (aput_fun = _pSLclass_get_class (type)->cl_aput))
+	 return (*aput_fun) (type, num_indices);
+	break;
+ }
+
+ if (-1 == SLang_pop_array (&at, 0))
+ return -1;
+
+ if (at->flags & SLARR_DATA_VALUE_IS_READ_ONLY)
+ {
+	_pSLang_verror (SL_READONLY_ERROR, "%s Array is read-only",
+		 SLclass_get_datatype_name (at->data_type));
+	free_array (at);
+	return -1;
+ }
+
+ if (-1 == pop_indices (at->num_dims, at->dims, at->num_elements, index_objs, num_indices, &is_index_array))
+ {
+	free_array (at);
+	return -1;
+ }
+
+ if (is_index_array == 0)
+ {
+#if SLANG_OPTIMIZE_FOR_SPEED
+	if ((num_indices == 1) && (index_objs0.o_data_type == SLANG_ARRAY_INDEX_TYPE)
+	 && (0 == (at->flags & (SLARR_DATA_VALUE_IS_RANGE|SLARR_DATA_VALUE_IS_POINTER)))
+	 && (1 == at->num_dims)
+	 && (at->data != NULL))
+	 {
+	 SLindex_Type ofs = index_objs0.v.index_val;
+	 if (ofs < 0) ofs += at->dims0;
+	 if ((ofs >= at->dims0) || (ofs < 0))
+	 ret = aput_from_indices (at, index_objs, num_indices);
+	 else switch (at->data_type)
+	 {
+		case SLANG_CHAR_TYPE:
+		 ret = SLang_pop_char (((char *)at->data + ofs));
+		 break;
+		case SLANG_INT_TYPE:
+		 ret = SLang_pop_integer (((int *)at->data + ofs));
+		 break;
+#if SLANG_HAS_FLOAT
+		case SLANG_DOUBLE_TYPE:
+		 ret = SLang_pop_double ((double *)at->data + ofs);
+		 break;
+#endif
+		default:
+		 ret = aput_from_indices (at, index_objs, num_indices);
+	 }
+	 free_array (at);
+	 return ret;
+	 }
+#endif
+	ret = aput_from_indices (at, index_objs, num_indices);
+ }
+ else
+ ret = aput_from_index_array (at, index_objs0.v.array_val);
+
+ free_array (at);
+ free_index_objects (index_objs, num_indices);
+ return ret;
+}
+
+int _pSLarray_aput (void)
+{
+ return _pSLarray_aput1 ((unsigned int)(SLang_Num_Function_Args-1));
+}
+
+static int _pSLmergesort (void *obj,
+			 SLindex_Type *sort_indices, SLindex_Type n,
+			 int (*cmp) (void *, SLindex_Type, SLindex_Type))
+{
+ SLindex_Type i, j, k, kmax, n1, m;
+ SLindex_Type *tmp;
+ int try_quick_merge;
+
+ if (n < 0)
+ {
+	SLang_verror (SL_INVALID_PARM, "_pSLmergesort: The number of elements must be non-negative");
+	return -1;
+ }
+
+ for (i = 0; i < n; i++)
+ sort_indicesi = i;
+
+ /* Insertion sort for 4 elements */
+ n1 = n-1;
+ m = 4; i = 0;
+ while (i < n1)
+ {
+	kmax = i + m - 1;
+	if (kmax >= n)
+	 kmax = n1;
+	for (k = i+1; k <= kmax; k++)
+	 {
+	 j = k;
+	 while (j > i)
+	 {
+		 SLindex_Type t;
+		 j--;
+		 if ((*cmp)(obj, sort_indicesj, k) <= 0)
+		 break;
+		 t = sort_indicesj;
+		 sort_indicesj = sort_indicesj+1;
+		 sort_indicesj+1 = t;
+	 }
+	 }
+	i += m;
+ }
+
+ if (m >= n)
+ return 0;
+
+ /* Note that 1073741824*2 < 0 */
+ i = (n <= 65536) ? m : 65536;
+ while ((i*2 < n) && (i*2 > 0))
+ i *= 2;
+
+ if (NULL == (tmp = (SLindex_Type *)_SLcalloc (i, sizeof(SLindex_Type))))
+ return -1;
+
+ try_quick_merge = 0;
+ /* Now do a bottom-up merge sort */
+ while ((m < n) && (m > 0))
+ {
+	i = 0;
+	while (i < n-m)
+	 {
+	 SLindex_Type imax, jmax, l, e_j, e_k;
+	 SLindex_Type *sort_indices_i;
+
+	 sort_indices_i = sort_indices + i;
+	 k = m;
+	 e_k = sort_indices_ik;
+	 if (try_quick_merge)
+	 {
+		 if ((*cmp)(obj, sort_indices_ik-1, e_k) <= 0)
+		 goto next_i;
+	 }
+
+	 j = 0; jmax = m;
+	 kmax = k+m;
+	 imax = i + kmax;
+
+	 if (imax > n)
+	 {
+		 imax = n;
+		 kmax = imax - i;
+	 }
+
+	 /* Only need to copy the left group */
+	 memcpy (tmp, sort_indices_i, jmax*sizeof(SLindex_Type));
+	 e_j = tmpj;
+
+	 l = i;
+	 while (1)
+	 {
+		 if ((*cmp)(obj, e_j, e_k) <= 0)
+		 {
+		 sort_indicesl = e_j; l++; j++;
+		 if (j == jmax)
+			 break;
+		 e_j = tmpj;
+		 continue;
+		 }
+		 sort_indicesl = e_k; l++; k++;
+		 if (k == kmax)
+		 {
+		 memcpy (sort_indices+l, tmp+j, (imax-l)*sizeof(SLindex_Type));
+		 break;
+		 }
+		 e_k = sort_indices_ik;
+	 }
+	 try_quick_merge = (k == m);
+next_i:
+	 i = i + 2*m;
+	 }
+	m = m * 2;
+ }
+
+ SLfree ((char *)tmp);
+ return 0;
+}
+
+/* Sorting Functions */
+
+typedef struct
+{
+ SLang_Name_Type *func;
+ SLang_Object_Type obj;
+ int dir;			 /* +1=ascend, -1=descend */
+}
+Sort_Object_Type;
+static void *QSort_Obj = NULL;
+
+/* This is for 1-d matrices only. It is used by the sort function */
+static int push_element_at_index (SLang_Array_Type *at, SLindex_Type indx)
+{
+ VOID_STAR data;
+
+ if (NULL == (data = get_data_addr (at, &indx)))
+ return -1;
+
+ return push_element_at_addr (at, (VOID_STAR) data, 1);
+}
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+#define MS_SCALAR_CMP(func, type) \
+ static int func(void *obj, SLindex_Type i, SLindex_Type j) \
+ { \
+ type *data = (type *)obj; \
+ if (datai > dataj) \
+	return 1; \
+ if (datai < dataj) \
+	return -1; \
+ if (i > j) return 1; \
+ if (i < j) return -1; \
+ return 0; \
+ }
+
+#define MS_SCALAR_CMP_DOWN(func, type) \
+ static int func(void *obj, SLindex_Type i, SLindex_Type j) \
+ { \
+ type *data = (type *)obj; \
+ if (datai > dataj) \
+	return -1; \
+ if (datai < dataj) \
+	return 1; \
+ if (i > j) return 1; \
+ if (i < j) return -1; \
+ return 0; \
+ }
+
+#define QS_SCALAR_CMP(func, type) \
+ static int func(const void *ip, const void *jp) \
+ { \
+ SLindex_Type i = *(SLindex_Type *)ip, j = *(SLindex_Type *)jp; \
+ type *data = (type *)QSort_Obj; \
+ if (datai > dataj) \
+	return 1; \
+ if (datai < dataj) \
+	return -1; \
+ if (i > j) return 1; \
+ if (i < j) return -1; \
+ return 0; \
+ }
+
+#define QS_SCALAR_CMP_DOWN(func, type) \
+ static int func(const void *ip, const void *jp) \
+ { \
+ SLindex_Type i = *(SLindex_Type *)ip, j = *(SLindex_Type *)jp; \
+ type *data = (type *)QSort_Obj; \
+ if (datai > dataj) \
+	return -1; \
+ if (datai < dataj) \
+	return 1; \
+ if (i > j) return 1; \
+ if (i < j) return -1; \
+ return 0; \
+ }
+
+#if SLANG_HAS_FLOAT
+MS_SCALAR_CMP(ms_double_sort_cmp, double)
+MS_SCALAR_CMP_DOWN(ms_double_sort_down_cmp, double)
+MS_SCALAR_CMP(ms_float_sort_cmp, float)
+MS_SCALAR_CMP_DOWN(ms_float_sort_down_cmp, float)
+
+QS_SCALAR_CMP(qs_double_sort_cmp, double)
+QS_SCALAR_CMP_DOWN(qs_double_sort_down_cmp, double)
+QS_SCALAR_CMP(qs_float_sort_cmp, float)
+QS_SCALAR_CMP_DOWN(qs_float_sort_down_cmp, float)
+#endif
+
+MS_SCALAR_CMP(ms_int_sort_cmp, int)
+MS_SCALAR_CMP_DOWN(ms_int_sort_down_cmp, int)
+QS_SCALAR_CMP(qs_int_sort_cmp, int)
+QS_SCALAR_CMP_DOWN(qs_int_sort_down_cmp, int)
+
+#endif				 /* SLANG_OPTIMIZE_FOR_SPEED */
+
+static int ms_sort_cmp_fun (void *vobj, SLindex_Type i, SLindex_Type j)
+{
+ int cmp;
+ SLang_Array_Type *at;
+ Sort_Object_Type *sort_obj = (Sort_Object_Type *)vobj;
+
+ at = sort_obj->obj.v.array_val;
+
+ if (SLang_get_error ()
+ || (-1 == push_element_at_index (at, i))
+ || (-1 == push_element_at_index (at, j))
+ || (-1 == SLexecute_function (sort_obj->func))
+ || (-1 == SLang_pop_integer (&cmp)))
+ {
+	/* error: return something meaningful */
+	if (i > j) return 1;
+	if (i < j) return -1;
+	return 0;
+ }
+ if (cmp == 0)
+ {
+	if (i > j) return 1;
+	if (i < j) return -1;
+	return 0;
+ }
+ return cmp*sort_obj->dir;
+}
+
+static int ms_sort_opaque_cmp_fun (void *vobj, SLindex_Type i, SLindex_Type j)
+{
+ int cmp;
+ Sort_Object_Type *sort_obj = (Sort_Object_Type *)vobj;
+
+ if (SLang_get_error ()
+ || (-1 == _pSLpush_slang_obj (&sort_obj->obj))
+ || (-1 == SLang_push_array_index (i))
+ || (-1 == SLang_push_array_index (j))
+ || (-1 == SLexecute_function (sort_obj->func))
+ || (-1 == SLang_pop_integer (&cmp)))
+ {
+	/* error: return something meaninful */
+	if (i > j) return 1;
+	if (i < j) return -1;
+	return 0;
+ }
+ if (cmp == 0)
+ {
+	if (i > j) return 1;
+	if (i < j) return -1;
+	return 0;
+ }
+ return sort_obj->dir*cmp;
+}
+
+static int ms_builtin_sort_cmp_fun (void *vobj, SLindex_Type i, SLindex_Type j)
+{
+ VOID_STAR a_data;
+ VOID_STAR b_data;
+ Sort_Object_Type *sort_obj = (Sort_Object_Type *)vobj;
+ SLang_Array_Type *at;
+ SLang_Class_Type *cl;
+
+ at = sort_obj->obj.v.array_val;
+ cl = at->cl;
+
+ if ((SLang_get_error () == 0)
+ && (NULL != (a_data = get_data_addr (at, &i)))
+ && (NULL != (b_data = get_data_addr (at, &j))))
+ {
+	int cmp;
+
+	if ((at->flags & SLARR_DATA_VALUE_IS_POINTER)
+	 && ((*(VOID_STAR *) a_data == NULL) || (*(VOID_STAR *) b_data == NULL)))
+	 {
+	 _pSLang_verror (SL_VARIABLE_UNINITIALIZED,
+			 "%s array has uninitialized element", cl->cl_name);
+	 }
+	else if (0 == (*cl->cl_cmp)(at->data_type, a_data, b_data, &cmp))
+	 {
+	 if (cmp == 0)
+	 {
+		 if (i > j) return 1;
+		 if (i < j) return -1;
+		 return 0;
+	 }
+	 return cmp * sort_obj->dir;
+	 }
+ }
+
+ if (i > j) return 1;
+ if (i < j) return -1;
+ return 0;
+}
+
+static void ms_sort_array_internal (void *vobj, SLindex_Type n,
+				 int (*sort_cmp)(void *, SLindex_Type, SLindex_Type))
+{
+ SLang_Array_Type *ind_at;
+ SLindex_Type *indx;
+
+ if (NULL == (ind_at = SLang_create_array1 (SLANG_ARRAY_INDEX_TYPE, 0, NULL, &n, 1, 1)))
+ return;
+
+ indx = (SLindex_Type *) ind_at->data;
+ if (-1 == _pSLmergesort (vobj, indx, n, sort_cmp))
+ {
+	free_array (ind_at);
+	return;
+ }
+
+ (void) SLang_push_array (ind_at, 1);
+}
+
+static int qs_builtin_sort_cmp_fun (const void *ip, const void *jp)
+{
+ return ms_builtin_sort_cmp_fun (QSort_Obj, *(SLindex_Type *)ip, *(SLindex_Type *)jp);
+}
+static int qs_sort_opaque_cmp_fun (const void *ip, const void *jp)
+{
+ return ms_sort_opaque_cmp_fun (QSort_Obj, *(SLindex_Type *)ip, *(SLindex_Type *)jp);
+}
+static int qs_sort_cmp_fun (const void *ip, const void *jp)
+{
+ return ms_sort_cmp_fun (QSort_Obj, *(SLindex_Type *)ip, *(SLindex_Type *)jp);
+}
+
+static void qs_sort_array_internal (void *vobj, SLindex_Type n,
+				 int (*sort_cmp)(const void *, const void *))
+{
+ SLang_Array_Type *ind_at;
+ SLindex_Type *indx;
+ SLindex_Type i;
+ void *save_vobj;
+
+ if (NULL == (ind_at = SLang_create_array1 (SLANG_ARRAY_INDEX_TYPE, 0, NULL, &n, 1, 1)))
+ return;
+
+ indx = (SLindex_Type *) ind_at->data;
+ for (i = 0; i < n; i++)
+ indxi = i;
+
+ save_vobj = QSort_Obj;
+ QSort_Obj = vobj;
+ qsort ((void *)indx, n, sizeof (SLindex_Type), sort_cmp);
+ QSort_Obj = save_vobj;
+
+ (void) SLang_push_array (ind_at, 1);
+}
+
+static int pop_1d_array (SLang_Array_Type **atp)
+{
+ SLang_Array_Type *at;
+
+ if (-1 == SLang_pop_array (&at, 1))
+ return -1;
+
+ if (at->num_dims != 1)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "sort is restricted to 1 dim arrays");
+	free_array (at);
+	return -1;
+ }
+ *atp = at;
+ return 0;
+}
+
+#define SORT_METHOD_MSORT	0
+#define SORT_METHOD_QSORT	1
+static int Default_Sort_Method = SORT_METHOD_MSORT;
+static void get_default_sort_method (void)
+{
+ char SLFUTURE_CONST *method = NULL;
+ switch (Default_Sort_Method)
+ {
+ case SORT_METHOD_QSORT: method = "qsort"; break;
+ case SORT_METHOD_MSORT: method = "msort"; break;
+ }
+ (void) SLang_push_string (method);
+}
+static void set_default_sort_method (char *method)
+{
+ if (0 == strcmp (method, "qsort"))
+ {
+	Default_Sort_Method = SORT_METHOD_QSORT;
+	return;
+ }
+ Default_Sort_Method = SORT_METHOD_MSORT;
+}
+
+/* Usage Forms:
+ * i = sort (a);
+ * i = sort (a, &fun); % sort using function fun(ai,aj)
+ * i = sort (a, &fun, n); % sort using fun(a, i, j); 0 <= i,j < n
+ */
+static void array_sort_intrin (void)
+{
+ SLang_Array_Type *at;
+ Sort_Object_Type sort_obj;
+ void *vobj;
+ SLindex_Type n;
+ int nargs = SLang_Num_Function_Args;
+ int dir = 1;
+ int use_qsort = 0;
+ char *method;
+
+ if (-1 == SLang_get_int_qualifier ("dir", &dir, 1))
+ return;
+ dir = (dir >= 0) ? 1 : -1;
+ use_qsort = (Default_Sort_Method == SORT_METHOD_QSORT);
+ if (SLang_qualifier_exists ("qsort")) use_qsort = 1;
+ if (-1 == SLang_get_string_qualifier ("method", &method, NULL))
+ return;
+ if (method != NULL)
+ {
+	if (0 == strcmp(method, "qsort"))
+	 use_qsort = 1;
+	SLang_free_slstring (method);
+ }
+
+ if (nargs == 1)		 /* i = sort (a) */
+ {
+	int (*msort_fun)(void *, SLindex_Type, SLindex_Type);
+	int (*qsort_fun)(const void *, const void *);
+
+	if (-1 == pop_1d_array (&at))
+	 return;
+
+	switch (at->data_type)
+	 {
+#if SLANG_OPTIMIZE_FOR_SPEED
+# if SLANG_HAS_FLOAT
+	 case SLANG_DOUBLE_TYPE:
+	 msort_fun = (dir > 0) ? ms_double_sort_cmp : ms_double_sort_down_cmp;
+	 qsort_fun = (dir > 0) ? qs_double_sort_cmp : qs_double_sort_down_cmp;
+	 vobj = at->data;
+	 break;
+	 case SLANG_FLOAT_TYPE:
+	 msort_fun = (dir > 0) ? ms_float_sort_cmp : ms_float_sort_down_cmp;
+	 qsort_fun = (dir > 0) ? qs_float_sort_cmp : qs_float_sort_down_cmp;
+	 vobj = at->data;
+	 break;
+# endif
+	 case SLANG_INT_TYPE:
+	 msort_fun = (dir > 0) ? ms_int_sort_cmp : ms_int_sort_down_cmp;
+	 qsort_fun = (dir > 0) ? qs_int_sort_cmp : qs_int_sort_down_cmp;
+	 vobj = at->data;
+	 break;
+#endif
+	 default:
+	 if (at->cl->cl_cmp == NULL)
+	 {
+		 _pSLang_verror (SL_NOT_IMPLEMENTED,
+				 "%s does not have a predefined sorting method",
+				 at->cl->cl_name);
+		 free_array (at);
+		 return;
+	 }
+	 msort_fun = ms_builtin_sort_cmp_fun;
+	 qsort_fun = qs_builtin_sort_cmp_fun;
+	 sort_obj.obj.o_data_type = SLANG_ARRAY_TYPE;
+	 sort_obj.obj.v.array_val = at;
+	 sort_obj.dir = dir;
+	 vobj = (void *)&sort_obj;
+	 }
+
+	n = (SLindex_Type) at->num_elements;
+	if (use_qsort)
+	 qs_sort_array_internal (vobj, n, qsort_fun);
+	else
+	 ms_sort_array_internal (vobj, n, msort_fun);
+	free_array (at);
+	return;
+ }
+
+ if (nargs == 2)		 /* i = sort (a, &fun) */
+ {
+	SLang_Name_Type *entry;
+
+	if (NULL == (entry = SLang_pop_function ()))
+	 return;
+
+	if (-1 == pop_1d_array (&at))
+	 {
+	 SLang_free_function (entry);
+	 return;
+	 }
+
+	sort_obj.func = entry;
+	sort_obj.obj.o_data_type = SLANG_ARRAY_TYPE;
+	sort_obj.obj.v.array_val = at;
+	sort_obj.dir = dir;
+	vobj = (void *)&sort_obj;
+
+	n = (SLindex_Type) at->num_elements;
+	if (use_qsort)
+	 qs_sort_array_internal (vobj, n, qs_sort_cmp_fun);
+	else
+	 ms_sort_array_internal (vobj, n, ms_sort_cmp_fun);
+	free_array (at);
+	SLang_free_function (entry);
+	return;
+ }
+
+ if (nargs == 3)		 /* i = sort (a, fun, n) */
+ {
+	SLang_Name_Type *entry;
+
+	if (-1 == SLang_pop_array_index (&n))
+	 return;
+
+	if (n < 0)
+	 {
+	 SLang_verror (SL_Index_Error, "Sort object cannot have a negative size");
+	 return;
+	 }
+
+	if (NULL == (entry = SLang_pop_function ()))
+	 return;
+
+	if (-1 == SLang_pop (&sort_obj.obj))
+	 {
+	 SLang_free_function (entry);
+	 return;
+	 }
+	sort_obj.func = entry;
+	sort_obj.dir = dir;
+	vobj = (void *)&sort_obj;
+
+	if (use_qsort)
+	 qs_sort_array_internal (vobj, n, qs_sort_opaque_cmp_fun);
+	else
+	 ms_sort_array_internal (vobj, n, ms_sort_opaque_cmp_fun);
+	SLang_free_object (&sort_obj.obj);
+	SLang_free_function (entry);
+	return;
+ }
+
+ SLang_verror (SL_Usage_Error, "\
+Usage: i = array_sort(a);\n\
+ i = array_sort(a, &func); %% cmp = func(ai, bj);\n\
+ i = array_sort(obj, &func, n); %% cmp = func(obj, i, j)\n");
+}
+
+static void bstring_to_array (SLang_BString_Type *bs)
+{
+ unsigned char *s;
+ SLstrlen_Type len;
+
+ if (NULL == (s = SLbstring_get_pointer (bs, &len)))
+ (void) SLang_push_null ();
+ else
+ (void) push_string_as_array (s, len, 0);
+}
+
+static void array_to_bstring (SLang_Array_Type *at)
+{
+ size_t nbytes;
+ SLang_BString_Type *bs;
+
+ nbytes = at->num_elements * at->sizeof_type;
+ bs = SLbstring_create ((unsigned char *)at->data, nbytes);
+ (void) SLang_push_bstring (bs);
+ SLbstring_free (bs);
+}
+
+static void init_char_array (void)
+{
+ SLang_Array_Type *at;
+ char *s;
+ SLstrlen_Type n, ndim;
+
+ if (SLang_pop_slstring (&s)) return;
+
+ if (-1 == SLang_pop_array (&at, 0))
+ goto free_and_return;
+
+ if ((at->data_type != SLANG_CHAR_TYPE) && (at->data_type != SLANG_UCHAR_TYPE))
+ {
+	_pSLang_verror (SL_TYPE_MISMATCH, "Operation requires a character array");
+	goto free_and_return;
+ }
+
+ n = _pSLstring_bytelen (s);
+ ndim = at->num_elements;
+ if (n > ndim)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "String too big to initialize array");
+	goto free_and_return;
+ }
+
+ strncpy((char *) at->data, s, ndim);
+ /* drop */
+
+ free_and_return:
+ free_array (at);
+ _pSLang_free_slstring (s);
+}
+
+static VOID_STAR range_get_data_addr (SLang_Array_Type *at, SLindex_Type *dims)
+{
+ static int value;
+ SLarray_Range_Array_Type *r;
+ SLindex_Type d;
+
+ d = *dims;
+ r = (SLarray_Range_Array_Type *)at->data;
+
+ if (d < 0)
+ d += at->dims0;
+
+ if ((SLuindex_Type)d >= at->num_elements)
+ {
+	SLang_set_error (SL_Index_Error);
+	return NULL;
+ }
+ value = r->first_index + d * r->delta;
+ return (VOID_STAR) &value;
+}
+
+static SLang_Array_Type
+ *create_range_array (SLarray_Range_Array_Type *range, SLindex_Type num,
+		 SLtype type, int (*to_linear_fun) (SLang_Array_Type *, SLarray_Range_Array_Type *, VOID_STAR))
+{
+ SLarray_Range_Array_Type *r;
+ SLang_Array_Type *at;
+
+ r = (SLarray_Range_Array_Type *) SLmalloc (sizeof (SLarray_Range_Array_Type));
+ if (r == NULL)
+ return NULL;
+ memset((char *) r, 0, sizeof (SLarray_Range_Array_Type));
+
+ if (NULL == (at = SLang_create_array (type, 0, (VOID_STAR) range, &num, 1)))
+ {
+	SLfree ((char *)r);
+	return NULL;
+ }
+ r->first_index = range->first_index;
+ r->last_index = range->last_index;
+ r->delta = range->delta;
+ r->has_first_index = range->has_first_index;
+ r->has_last_index = range->has_last_index;
+ r->to_linear_fun = to_linear_fun;
+ at->data = (VOID_STAR) r;
+ at->index_fun = range_get_data_addr;
+ at->flags |= SLARR_DATA_VALUE_IS_RANGE;
+ return at;
+}
+
+static int get_range_array_limits (SLindex_Type *first_indexp, SLindex_Type *last_indexp, SLindex_Type *deltap,
+				 SLarray_Range_Array_Type *r, SLindex_Type *nump)
+{
+ SLindex_Type first_index, last_index, delta;
+ SLindex_Type num;
+
+ if (deltap == NULL) delta = 1;
+ else delta = *deltap;
+
+ if (delta == 0)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "range-array increment must be non-zero");
+	return -1;
+ }
+
+ r->has_first_index = (first_indexp != NULL);
+ if (r->has_first_index)
+ first_index = *first_indexp;
+ else
+ first_index = 0;
+
+ r->has_last_index = (last_indexp != NULL);
+ if (r->has_last_index)
+ last_index = *last_indexp;
+ else
+ last_index = -1;
+
+ num = 0;
+ if (delta > 0)
+ {
+	/* Case: 20:10:11 --> 0 elements, 10:20:11 --> 1 element */
+	if (last_index >= first_index)
+	 num = 1 + (last_index - first_index) / delta;
+ }
+ else
+ {
+	/* Case: 20:10:-11 -> 1 element, 20:30:-11 -> none */
+	if (last_index <= first_index)
+	 num = 1 + (last_index - first_index) / delta;
+ }
+
+ r->first_index = first_index;
+ r->last_index = last_index;
+ r->delta = delta;
+ *nump = num;
+
+ return 0;
+}
+
+static int index_range_to_linear (SLang_Array_Type *at, SLarray_Range_Array_Type *range, VOID_STAR buf)
+{
+ SLindex_Type *data = (SLindex_Type *)buf;
+ SLuindex_Type i, imax;
+ SLindex_Type xmin, dx;
+
+ imax = at->num_elements;
+ xmin = range->first_index;
+ dx = range->delta;
+ for (i = 0; i < imax; i++)
+ {
+	data i = xmin;
+	xmin += dx;
+ }
+ return 0;
+}
+
+static SLang_Array_Type *inline_implicit_index_array (SLindex_Type *xminptr, SLindex_Type *xmaxptr, SLindex_Type *dxptr)
+{
+ SLarray_Range_Array_Type r;
+ SLindex_Type num;
+
+ if (-1 == get_range_array_limits (xminptr, xmaxptr, dxptr, &r, &num))
+ return NULL;
+
+ return create_range_array (&r, num, SLANG_ARRAY_INDEX_TYPE, index_range_to_linear);
+}
+
+#if (SLANG_ARRAY_INDEX_TYPE == SLANG_INT_TYPE)
+# define int_range_to_linear index_range_to_linear
+# define inline_implicit_int_array inline_implicit_index_array
+#else
+static int int_range_to_linear (SLang_Array_Type *at, SLarray_Range_Array_Type *range, VOID_STAR buf)
+{
+ int *data = (int *)buf;
+ unsigned int i, imax;
+ int xmin, dx;
+
+ imax = (unsigned int)at->num_elements;
+ xmin = (int) range->first_index;
+ dx = (int) range->delta;
+ for (i = 0; i < imax; i++)
+ {
+	data i = xmin;
+	xmin += dx;
+ }
+ return 0;
+}
+
+static SLang_Array_Type *inline_implicit_int_array (SLindex_Type *xminptr, SLindex_Type *xmaxptr, SLindex_Type *dxptr)
+{
+ SLarray_Range_Array_Type r;
+ SLindex_Type num;
+
+ if (-1 == get_range_array_limits (xminptr, xmaxptr, dxptr, &r, &num))
+ return NULL;
+
+ return create_range_array (&r, num, SLANG_INT_TYPE, int_range_to_linear);
+}
+#endif
+
+#if SLANG_HAS_FLOAT
+static double compute_range_multiplier (double xmin, double xmax, double dx)
+{
+ double multiplier = 1.0;
+
+ (void) xmax;
+ while (multiplier < 1e9)
+ {
+	volatile double xmin1, dx1; /* avoid agressive compiler optimization */
+
+	xmin1 = multiplier * xmin;
+	dx1 = multiplier * dx;
+
+	if ((xmin1 == (int)xmin1) && (dx1 == (int)dx1))
+	 return multiplier;
+	multiplier *= 10.0;
+ }
+ return 1.0;
+}
+
+
+static SLang_Array_Type *inline_implicit_floating_array (SLtype type,
+							 double *xminptr, double *xmaxptr, double *dxptr,
+							 int ntype, SLindex_Type nels)
+{
+ SLindex_Type n, i;
+ SLang_Array_Type *at;
+ SLindex_Type dims;
+ double xmin, xmax, dx;
+ double multiplier = 1.0;
+
+ if ((xminptr == NULL) || (xmaxptr == NULL))
+ {
+	_pSLang_verror (SL_INVALID_PARM, "range-array has unknown size");
+	return NULL;
+ }
+ xmin = *xminptr;
+ xmax = *xmaxptr;
+
+ if (ntype)
+ {
+	/* a:b:#n == a + 0:(n-1)*(b-a)/(n-1)
+	 * ==> dx = (b-a)/(n-1)
+	 */
+	n = nels;
+	if (n <= 0)
+	 {
+	 n = 0;
+	 dx = 1.0;
+	 }
+	else
+	 {
+	 if (n == 1)
+	 dx = 0.0;
+	 else
+	 dx = (xmax-xmin)/(n-1);
+	 }
+ }
+ else
+ {
+	if (dxptr == NULL) dx = 1.0;
+	else dx = *dxptr;
+
+	if (dx == 0.0)
+	 {
+	 _pSLang_verror (SL_INVALID_PARM, "range-array increment must be non-zero");
+	 return NULL;
+	 }
+
+	/* I have convinced myself that it is better to use semi-open intervals
+	 * because of less ambiguities. So, a:b:c will represent the set of
+	 * values a, a + c, a + 2c ... a + nc
+	 * such that a + nc < b. That is, b lies outside the interval.
+	 */
+
+	if (((xmax <= xmin) && (dx >= 0.0))
+	 || ((xmax >= xmin) && (dx <= 0.0)))
+	 n = 0;
+	else
+	 {
+	 double last;
+
+	 if ((xmin + dx == (volatile double)xmin) || (xmax + dx == (volatile double)xmax))
+	 n = 0;
+	 else
+	 /* Allow for roundoff by adding 0.5 before truncation */
+	 n = (int)(1.5 + ((xmax - xmin) / dx));
+
+	 if (n <= 0)
+	 {
+		 _pSLang_verror (SL_INVALID_PARM, "range-array increment is too small");
+		 return NULL;
+	 }
+
+	 multiplier = compute_range_multiplier (xmin, xmax, dx);
+	 last = ((xmin*multiplier) + (n-1) * (dx*multiplier))/multiplier;
+
+	 if (dx > 0.0)
+	 {
+		 if (last >= xmax)
+		 n -= 1;
+	 }
+	 else if (last <= xmax)
+	 n -= 1;
+	 }
+ }
+
+ dims = n;
+ if (NULL == (at = SLang_create_array1 (type, 0, NULL, &dims, 1, 1)))
+ return NULL;
+
+ if (type == SLANG_DOUBLE_TYPE)
+ {
+	double *ptr;
+
+	ptr = (double *) at->data;
+
+	if (multiplier != 1.0)
+	 {
+	 int ixmin = (floor)(multiplier*xmin+0.5);
+	 int idx = (floor)(multiplier*dx+0.5);
+	 for (i = 0; i < n; i++)
+	 ptri = (ixmin + (double)i * idx)/multiplier;
+	 }
+	else for (i = 0; i < n; i++)
+	 ptri = (xmin + i*dx);
+
+	/* Explicitly set the last element to xmax to avoid roundoff error */
+	if (ntype && (n > 1))
+	 ptrn-1 = xmax;
+ }
+ else
+ {
+	float *ptr;
+
+	ptr = (float *) at->data;
+
+	for (i = 0; i < n; i++)
+	 ptri = (float) (xmin + i * dx);
+
+	if (ntype && (n > 0))
+	 ptrn-1 = (float) xmax;
+ }
+ return at;
+}
+#endif
+
+static int pop_range_int (SLindex_Type *ip)
+{
+ return SLang_pop_array_index (ip);
+}
+
+/* FIXME: Priority=medium
+ * This needs to be updated to work with all integer types.
+ * Adding support for other types is going to require a generalization
+ * of the Range_Array_Type object.
+ */
+/* If ntype is non-zero, the array was specified using a:b:#c */
+static int inline_implicit_array (int ntype)
+{
+ SLindex_Type index_vals3;
+#if SLANG_HAS_FLOAT
+ double double_vals3;
+ int is_int;
+#endif
+ int has_vals3;
+ unsigned int i, count;
+ SLindex_Type n = 0;
+ SLang_Array_Type *at;
+ int precedence;
+ SLtype type;
+
+ count = SLang_Num_Function_Args;
+
+ if ((count == 2) && (ntype == 0))
+ has_vals 2 = 0;
+ else if (count != 3)
+ {
+	_pSLang_verror (SL_NUM_ARGS_ERROR, "wrong number of arguments to __implicit_inline_array");
+	return -1;
+ }
+
+#if SLANG_HAS_FLOAT
+ is_int = 1;
+#endif
+
+ type = 0;
+ precedence = 0;
+
+ if (ntype)
+ {
+	if (-1 == pop_range_int (&n))
+	 return -1;
+	has_vals2 = 0;
+	count--;
+ }
+ i = count;
+
+ while (i--)
+ {
+	int this_type, this_precedence;
+	SLindex_Type itmp;
+
+	if (-1 == (this_type = SLang_peek_at_stack ()))
+	 return -1;
+
+	this_precedence = _pSLarith_get_precedence ((SLtype) this_type);
+	if (precedence < this_precedence)
+	 {
+	 type = (SLtype) this_type;
+	 precedence = this_precedence;
+	 }
+
+	has_vals i = 1;
+
+	switch (this_type)
+	 {
+	 case SLANG_NULL_TYPE:
+	 if (ntype)
+	 {
+		 _pSLang_verror (SL_Syntax_Error, "Arrays of the form a:b:#c must be fully specified");
+		 return -1;
+	 }
+	 has_valsi = 0;
+	 (void) SLdo_pop ();
+	 break;
+
+#if SLANG_HAS_FLOAT
+	 case SLANG_DOUBLE_TYPE:
+	 case SLANG_FLOAT_TYPE:
+	 if (-1 == SLang_pop_double (double_vals + i))
+	 return -1;
+	 is_int = 0;
+	 break;
+#endif
+	 default:
+	 if (-1 == pop_range_int (&itmp))
+	 return -1;
+	 index_valsi = itmp;
+#if SLANG_HAS_FLOAT
+	 double_valsi = (double) itmp;
+#endif
+	 }
+ }
+
+#if SLANG_HAS_FLOAT
+ if (ntype)
+ {
+	is_int = 0;
+	if (type != SLANG_FLOAT_TYPE)
+	 type = SLANG_DOUBLE_TYPE;
+ }
+
+ if (is_int == 0)
+ at = inline_implicit_floating_array (type,
+					 (has_vals0 ? &double_vals0 : NULL),
+					 (has_vals1 ? &double_vals1 : NULL),
+					 (has_vals2 ? &double_vals2 : NULL),
+					 ntype, n);
+ else
+#endif
+ at = inline_implicit_int_array ((has_vals0 ? &index_vals0 : NULL),
+				 (has_vals1 ? &index_vals1 : NULL),
+				 (has_vals2 ? &index_vals2 : NULL));
+
+ if (at == NULL)
+ return -1;
+
+ return SLang_push_array (at, 1);
+}
+
+int _pSLarray_inline_implicit_array (void)
+{
+ return inline_implicit_array (0);
+}
+
+int _pSLarray_inline_implicit_arrayn (void)
+{
+ return inline_implicit_array (1);
+}
+
+static int try_typecast_range_array (SLang_Array_Type *at, SLtype to_type,
+				 SLang_Array_Type **btp)
+{
+ SLang_Array_Type *bt;
+
+ *btp = NULL;
+ if (to_type == SLANG_ARRAY_INDEX_TYPE)
+ {
+	if (at->data_type == SLANG_INT_TYPE)
+	 {
+	 SLarray_Range_Array_Type *range;
+
+	 range = (SLarray_Range_Array_Type *)at->data;
+	 bt = create_range_array (range, at->num_elements,
+				 to_type, index_range_to_linear);
+	 if (bt == NULL)
+	 return -1;
+	 *btp = bt;
+	 return 1;
+	 }
+ }
+ return 0;
+}
+
+int _pSLarray_wildcard_array (void)
+{
+ SLang_Array_Type *at;
+
+ if (NULL == (at = inline_implicit_int_array (NULL, NULL, NULL)))
+ return -1;
+
+ return SLang_push_array (at, 1);
+}
+
+/* FIXME: The type-promotion routine needs to be made more generic and
+ * better support user-defined types.
+ */
+
+/* Test if the type cannot be promoted further */
+_INLINE_ static int nowhere_to_promote (SLtype type)
+{
+ switch (type)
+ {
+ case SLANG_COMPLEX_TYPE:
+ case SLANG_BSTRING_TYPE:
+ case SLANG_ARRAY_TYPE:
+	return 1;
+ }
+
+ return 0;
+}
+
+static int promote_to_common_type (SLtype a, SLtype b, SLtype *c)
+{
+ if (a == b)
+ {
+	*c = a;
+	return 0;
+ }
+ if (nowhere_to_promote (a))
+ {
+	/* a type can always be converted to an array: T -> T */
+	if (b == SLANG_ARRAY_TYPE)
+	 *c = b;
+	else
+	 *c = a;
+	return 0;
+ }
+ if (nowhere_to_promote (b))
+ {
+	*c = b;
+	return 0;
+ }
+
+ if (_pSLang_is_arith_type (a) && _pSLang_is_arith_type (b))
+ {
+	if (_pSLarith_get_precedence (a) > _pSLarith_get_precedence (b))
+	 *c = a;
+	else
+	 *c = b;
+	return 0;
+ }
+
+ if (a == SLANG_NULL_TYPE)
+ {
+	*c = b;
+	return 0;
+ }
+ if (b == SLANG_NULL_TYPE)
+ {
+	*c = a;
+	return 0;
+ }
+
+ *c = a;
+ return 0;
+}
+
+static SLtype get_type_for_concat (SLang_Array_Type **arrays, unsigned int n)
+{
+ SLtype type;
+ unsigned int i;
+
+ type = arrays0->data_type;
+
+ for (i = 1; i < n; i++)
+ {
+	SLtype this_type = arraysi->data_type;
+
+	if (this_type == type)
+	 continue;
+
+	if (-1 == promote_to_common_type (type, this_type, &type))
+	 return SLANG_UNDEFINED_TYPE;
+ }
+ return type;
+}
+
+static SLang_Array_Type *concat_arrays (unsigned int count)
+{
+ SLang_Array_Type **arrays;
+ SLang_Array_Type *at, *bt;
+ unsigned int i;
+ SLindex_Type num_elements;
+ SLtype type;
+ char *src_data, *dest_data;
+ int is_ptr;
+ size_t sizeof_type;
+ SLindex_Type max_dims, min_dims, max_rows, min_rows;
+
+ arrays = (SLang_Array_Type **)_SLcalloc (count, sizeof (SLang_Array_Type *));
+ if (arrays == NULL)
+ {
+	SLdo_pop_n (count);
+	return NULL;
+ }
+ memset ((char *) arrays, 0, count * sizeof(SLang_Array_Type *));
+
+ at = NULL;
+
+ num_elements = 0;
+ i = count;
+
+ while (i != 0)
+ {
+	SLindex_Type last_num_elements = num_elements;
+
+	i--;
+
+	if (-1 == SLang_pop_array (&bt, 1)) /* bt is now linear */
+	 goto free_and_return;
+
+	arraysi = bt;
+	num_elements += (SLindex_Type) bt->num_elements;
+	if (num_elements < last_num_elements)
+	 {
+	 SLang_verror (SL_LimitExceeded_Error, "Unable to address concatenated arrays");
+	 goto free_and_return;
+	 }
+ }
+
+ /* From here on, arrays* are linear */
+
+ /* type = arrays0->data_type; */
+ type = get_type_for_concat (arrays, count);
+
+ max_dims = min_dims = arrays0->num_dims;
+ min_rows = max_rows = arrays0->dims0;
+
+ for (i = 0; i < count; i++)
+ {
+	SLang_Array_Type *ct;
+	SLindex_Type num;
+
+	bt = arraysi;
+
+	num = bt->num_dims;
+	if (num > max_dims) max_dims = num;
+	if (num < min_dims) min_dims = num;
+
+	num = bt->dims0;
+	if (num > max_rows) max_rows = num;
+	if (num < min_rows) min_rows = num;
+
+	if (type == bt->data_type)
+	 continue;
+
+	if (1 != _pSLarray_typecast (bt->data_type, (VOID_STAR) &bt, 1,
+				 type, (VOID_STAR) &ct, 1))
+	 goto free_and_return;
+
+	free_array (bt);
+	arrays i = ct;
+ }
+
+ if (NULL == (at = SLang_create_array (type, 0, NULL, &num_elements, 1)))
+ goto free_and_return;
+
+ is_ptr = (at->flags & SLARR_DATA_VALUE_IS_POINTER);
+ sizeof_type = at->sizeof_type;
+ dest_data = (char *) at->data;
+
+ for (i = 0; i < count; i++)
+ {
+	bt = arraysi;
+
+	src_data = (char *) bt->data;
+	num_elements = bt->num_elements;
+
+	if (-1 == transfer_n_elements (bt, (VOID_STAR)dest_data, (VOID_STAR)src_data, sizeof_type,
+				 num_elements, is_ptr))
+	 {
+	 free_array (at);
+	 at = NULL;
+	 goto free_and_return;
+	 }
+
+	dest_data += num_elements * sizeof_type;
+ }
+
+#if 0
+ /* If the arrays are all 1-d, and all the same size, then reshape to a
+ * 2-d array. This will allow us to do, e.g.
+ * a = 1,2, 3,4
+ * to specifiy a 2-d.
+ * Someday I will generalize this.
+ */
+ /* This is a bad idea. Everyone using it expects concatenation to happen.
+ * Perhaps I will extend the syntax to allow a 2-d array to be expressed
+ * as 1,2;3,4.
+ */
+ if ((max_dims == min_dims) && (max_dims == 1) && (min_rows == max_rows))
+ {
+	at->num_dims = 2;
+	at->dims0 = count;
+	at->dims1 = min_rows;
+ }
+#endif
+ free_and_return:
+
+ for (i = 0; i < count; i++)
+ free_array (arraysi);
+ SLfree ((char *) arrays);
+
+ return at;
+}
+
+int _pSLarray_inline_array (void)
+{
+ SLang_Object_Type *obj, *objmin;
+ SLtype type;
+ unsigned int count;
+ SLang_Array_Type *at;
+
+ obj = _pSLang_get_run_stack_pointer ();
+ objmin = _pSLang_get_run_stack_base ();
+
+ count = SLang_Num_Function_Args;
+ type = 0;
+
+ while ((count > 0) && (--obj >= objmin))
+ {
+	SLtype this_type = obj->o_data_type;
+
+	if (type == 0)
+	 type = this_type;
+	else if (type != this_type)
+	 {
+	 if (-1 == promote_to_common_type (type, this_type, &type))
+	 {
+		 _pSLclass_type_mismatch_error (type, this_type);
+		 return -1;
+	 }
+	 }
+	count--;
+ }
+
+ if (count != 0)
+ {
+	SLang_set_error (SL_STACK_UNDERFLOW);
+	return -1;
+ }
+
+ count = SLang_Num_Function_Args;
+
+ if (count == 0)
+ {
+	_pSLang_verror (SL_NOT_IMPLEMENTED, "Empty inline-arrays not supported");
+	return -1;
+ }
+
+ if (type == SLANG_ARRAY_TYPE)
+ {
+	if (count == 1)
+	 return 0;		 /* no point in going on */
+
+	if (NULL == (at = concat_arrays (count)))
+	 return -1;
+ }
+ else
+ {
+	SLang_Object_Type index_obj;
+	SLindex_Type icount = (SLindex_Type) count;
+
+	if (NULL == (at = SLang_create_array (type, 0, NULL, &icount, 1)))
+	 return -1;
+
+	index_obj.o_data_type = SLANG_ARRAY_INDEX_TYPE;
+	while (count != 0)
+	 {
+	 count--;
+	 index_obj.v.index_val = count;
+	 if (-1 == aput_from_indices (at, &index_obj, 1))
+	 {
+		 free_array (at);
+		 SLdo_pop_n (count);
+		 return -1;
+	 }
+	 }
+ }
+
+ return SLang_push_array (at, 1);
+}
+
+int _pSLarray_convert_to_array (VOID_STAR cd,
+				int (*get_type)(VOID_STAR, SLuindex_Type, SLtype *),
+				int (*push)(VOID_STAR, SLuindex_Type),
+			 SLuindex_Type num_objects, SLtype type)
+{
+ SLtype this_type;
+ SLang_Array_Type *at;
+ SLuindex_Type i;
+ SLindex_Type dims;
+ SLang_Object_Type index_obj;
+
+ at = NULL;
+
+ if (type == 0) for (i = 0; i < num_objects; i++)
+ {
+	if (-1 == (*get_type)(cd, i, &this_type))
+	 goto unknown_error;
+
+	if (type == 0)
+	 type = this_type;
+	else if (type != this_type)
+	 {
+	 if (-1 == promote_to_common_type (type, this_type, &type))
+	 {
+		 _pSLclass_type_mismatch_error (type, this_type);
+		 return -1;
+	 }
+	 }
+ }
+
+ if (type == 0)
+ {
+	SLang_verror (SL_TypeMismatch_Error, "Cannot convert an empty container object to an untyped array");
+	return -1;
+ }
+
+ dims = (SLindex_Type) num_objects;
+
+ if (NULL == (at = SLang_create_array (type, 0, NULL, &dims, 1)))
+ return -1;
+
+ index_obj.o_data_type = SLANG_ARRAY_INDEX_TYPE;
+ for (i = 0; i < num_objects; i++)
+ {
+	if (-1 == (*push)(cd, i))
+	 goto unknown_error;
+
+	index_obj.v.index_val = i;
+	if (-1 == aput_from_indices (at, &index_obj, 1))
+	 goto return_error;
+ }
+
+ return SLang_push_array (at, 1);
+
+unknown_error:
+ SLang_verror (SL_Unknown_Error, "Unknown array conversion error");
+return_error:
+ if (at != NULL)
+ free_array (at);
+
+ return -1;
+}
+
+static int array_binary_op_result (int op, SLtype a, SLtype b,
+				 SLtype *c)
+{
+ (void) op;
+ (void) a;
+ (void) b;
+ *c = SLANG_ARRAY_TYPE;
+ return 1;
+}
+
+static int try_range_int_binary (SLang_Array_Type *at, int op, int x, int swap, VOID_STAR cp)
+{
+ SLarray_Range_Array_Type *at_r;
+ SLarray_Range_Array_Type rbuf;
+ SLindex_Type first_index, last_index, delta;
+ SLindex_Type num;
+
+ at_r = (SLarray_Range_Array_Type *)at->data;
+ if ((at_r->has_first_index == 0)
+ || (at_r->has_last_index == 0))
+ return 0;
+
+ switch (op)
+ {
+ case SLANG_MINUS:
+	if (swap)
+	 {
+	 first_index = x - at_r->first_index;
+	 last_index = x - at_r->last_index;
+	 delta = -at_r->delta;
+	 break;
+	 }
+	x = -x;
+	/* drop */
+ case SLANG_PLUS:
+	first_index = at_r->first_index + x;
+	last_index = at_r->last_index + x;
+	delta = at_r->delta;
+	break;
+
+ case SLANG_TIMES:
+	if (x == 0)
+	 return 0;
+	first_index = at_r->first_index*x;
+	last_index = at_r->last_index*x;
+	delta = at_r->delta*x;
+	break;
+
+ default:
+	return 0;
+ }
+
+ if (-1 == get_range_array_limits (&first_index, &last_index, &delta, &rbuf, &num))
+ return -1;
+ if ((SLuindex_Type)num != at->num_elements)
+ return 0; /* This can happen if the integer arithmetic wrapped */
+
+ if (NULL == (at = create_range_array (&rbuf, num, SLANG_INT_TYPE, int_range_to_linear)))
+ return -1;
+
+ *(SLang_Array_Type **)cp = at;
+ return 1;
+}
+
+static int array_binary_op (int op,
+			 SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+			 SLtype b_type, VOID_STAR bp, SLuindex_Type nb,
+			 VOID_STAR cp)
+{
+ SLang_Array_Type *at, *bt, *ct;
+ int (*binary_fun) (int,
+		 SLtype, VOID_STAR, SLuindex_Type,
+		 SLtype, VOID_STAR, SLuindex_Type,
+		 VOID_STAR);
+ SLang_Class_Type *a_cl, *b_cl, *c_cl;
+ int ret;
+
+ if (a_type == SLANG_ARRAY_TYPE)
+ {
+	if (na != 1)
+	 {
+	 _pSLang_verror (SL_NOT_IMPLEMENTED, "Binary operation on multiple arrays not implemented");
+	 return -1;
+	 }
+
+	at = *(SLang_Array_Type **) ap;
+	if ((b_type == SLANG_INT_TYPE)
+	 && (nb == 1)
+	 && (at->flags & SLARR_DATA_VALUE_IS_RANGE)
+	 && (at->data_type == b_type))
+	 {
+	 int status = try_range_int_binary (at, op, *(int *)bp, 0, cp);
+	 if (status)
+	 return status;
+	 /* drop */
+	 }
+
+	if (-1 == coerse_array_to_linear (at))
+	 return -1;
+	ap = at->data;
+	a_type = at->data_type;
+	na = at->num_elements;
+ }
+ else
+ {
+	at = NULL;
+ }
+
+ if (b_type == SLANG_ARRAY_TYPE)
+ {
+	if (nb != 1)
+	 {
+	 _pSLang_verror (SL_NOT_IMPLEMENTED, "Binary operation on multiple arrays not implemented");
+	 return -1;
+	 }
+
+	bt = *(SLang_Array_Type **) bp;
+
+	if ((a_type == SLANG_INT_TYPE)
+	 && (na == 1)
+	 && (bt->flags & SLARR_DATA_VALUE_IS_RANGE)
+	 && (bt->data_type == a_type))
+	 {
+	 int status = try_range_int_binary (bt, op, *(int *)ap, 1, cp);
+	 if (status)
+	 return status;
+	 /* drop */
+	 }
+
+	if (-1 == coerse_array_to_linear (bt))
+	 return -1;
+	bp = bt->data;
+	b_type = bt->data_type;
+	nb = bt->num_elements;
+ }
+ else
+ {
+	bt = NULL;
+ }
+
+ if ((at != NULL) && (bt != NULL))
+ {
+	SLuindex_Type i, num_dims;
+
+	num_dims = at->num_dims;
+
+	if (num_dims != bt->num_dims)
+	 {
+	 _pSLang_verror (SL_TYPE_MISMATCH, "Arrays must have same dimensions for binary operation");
+	 return -1;
+	 }
+
+	for (i = 0; i < num_dims; i++)
+	 {
+	 if (at->dimsi != bt->dimsi)
+	 {
+		 _pSLang_verror (SL_TYPE_MISMATCH, "Arrays must be the same for binary operation");
+		 return -1;
+	 }
+	 }
+ }
+
+ a_cl = _pSLclass_get_class (a_type);
+ if (a_type == b_type)
+ b_cl = a_cl;
+ else
+ b_cl = _pSLclass_get_class (b_type);
+
+ if (NULL == (binary_fun = _pSLclass_get_binary_fun (op, a_cl, b_cl, &c_cl, 1)))
+ return -1;
+
+ ct = NULL;
+
+#if SLANG_USE_TMP_OPTIMIZATION
+ /* If we are dealing with scalar (or vector) objects, and if the object
+ * appears to be owned by the stack, then use it instead of creating a
+ * new version. This can happen with code such as:
+ * @ x = 1,2,3,4;
+ * @ x = __tmp(x) + 1;
+ */
+ if ((c_cl->cl_class_type == SLANG_CLASS_TYPE_SCALAR)
+ || (c_cl->cl_class_type == SLANG_CLASS_TYPE_VECTOR))
+ {
+	if ((at != NULL)
+	 && (at->num_refs == 1)
+	 && (at->data_type == c_cl->cl_data_type)
+	 && (0 == (at->flags & SLARR_DATA_VALUE_IS_READ_ONLY)))
+	 {
+	 ct = at;
+	 ct->num_refs = 2;
+	 }
+	else if ((bt != NULL)
+		 && (bt->num_refs == 1)
+		 && (bt->data_type == c_cl->cl_data_type)
+		 && (0 == (bt->flags & SLARR_DATA_VALUE_IS_READ_ONLY)))
+	 {
+	 ct = bt;
+	 ct->num_refs = 2;
+	 }
+ }
+#endif				 /* SLANG_USE_TMP_OPTIMIZATION */
+
+ if (ct == NULL)
+ {
+	if (at != NULL) ct = at; else ct = bt;
+	ct = SLang_create_array1 (c_cl->cl_data_type, 0, NULL, ct->dims, ct->num_dims, 1);
+	if (ct == NULL)
+	 return -1;
+ }
+
+ if ((na == 0) || (nb == 0))	 /* allow empty arrays */
+ {
+	*(SLang_Array_Type **) cp = ct;
+	return 1;
+ }
+
+ if (a_cl->cl_inc_ref != NULL)(*a_cl->cl_inc_ref)(a_type, ap, 1);
+ if (b_cl->cl_inc_ref != NULL)(*b_cl->cl_inc_ref)(b_type, bp, 1);
+ ret = (*binary_fun) (op, a_type, ap, na, b_type, bp, nb, ct->data);
+ if (a_cl->cl_inc_ref != NULL)(*a_cl->cl_inc_ref)(a_type, ap, -1);
+ if (b_cl->cl_inc_ref != NULL)(*b_cl->cl_inc_ref)(b_type, bp, -1);
+
+ if (ret == 1)
+ {
+	*(SLang_Array_Type **) cp = ct;
+	return 1;
+ }
+
+ free_array (ct);
+ return -1;
+}
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+int _pSLarray_bin_op (SLang_Object_Type *a, SLang_Object_Type *b, int op)
+{
+ SLang_Array_Type *c;
+
+ if (-1 == array_binary_op (op, SLANG_ARRAY_TYPE, (VOID_STAR) &a->v, 1,
+			 SLANG_ARRAY_TYPE, (VOID_STAR) &b->v, 1,
+			 (VOID_STAR) &c))
+ return -1;
+
+ return _pSLang_push_array (c, 1);
+}
+#endif
+
+static int array_eqs_method (SLtype a_type, VOID_STAR ap, SLtype b_type, VOID_STAR bp)
+{
+ SLang_Array_Type *at, *bt, *ct;
+ SLuindex_Type i, num_dims, num_elements;
+ SLang_Class_Type *a_cl, *b_cl, *c_cl;
+ int is_eqs;
+ int *ip, *ipmax;
+
+ if ((a_type != SLANG_ARRAY_TYPE) || (b_type != SLANG_ARRAY_TYPE))
+ return 0;
+
+ at = *(SLang_Array_Type **) ap;
+ bt = *(SLang_Array_Type **) bp;
+
+ if (at == bt)
+ return 1;
+
+ if ((at->num_elements != (num_elements = bt->num_elements))
+ || (at->num_dims != (num_dims = bt->num_dims)))
+ return 0;
+
+ for (i = 0; i < num_dims; i++)
+ {
+	if (at->dimsi != bt->dimsi)
+	 return 0;
+ }
+
+ a_type = at->data_type;
+ b_type = bt->data_type;
+
+ /* Check for an array of arrays. If so, the arrays must reference the same set arrays */
+ if ((a_type == SLANG_ARRAY_TYPE) || (b_type == SLANG_ARRAY_TYPE))
+ {
+	if (a_type != b_type)
+	 return 0;
+
+	return !memcmp ((char *)at->data, (char *)bt->data, num_elements*sizeof(SLang_Array_Type*));
+ }
+
+ a_cl = _pSLclass_get_class (a_type);
+ if (a_type == b_type)
+ b_cl = a_cl;
+ else
+ b_cl = _pSLclass_get_class (b_type);
+
+ if ((a_cl == b_cl)
+ && ((a_cl->cl_class_type == SLANG_CLASS_TYPE_SCALAR)
+	 || (a_cl->cl_class_type == SLANG_CLASS_TYPE_VECTOR)))
+ {
+	if ((-1 == coerse_array_to_linear (at))
+	 || (-1 == coerse_array_to_linear (bt)))
+	 return -1;
+
+	return !memcmp ((char *)at->data, (char *)bt->data, num_elements*at->sizeof_type);
+ }
+
+ /* Do it the hard way */
+
+ if (NULL == _pSLclass_get_binary_fun (SLANG_EQ, a_cl, b_cl, &c_cl, 0))
+ return 0;
+
+ if (num_elements == 0)
+ return 1;
+
+ if (-1 == array_binary_op (SLANG_EQ, SLANG_ARRAY_TYPE, ap, 1, SLANG_ARRAY_TYPE, bp, 1,
+			 (VOID_STAR) &ct))
+ return -1;
+
+ /* ct is linear */
+ num_elements = ct->num_elements;
+ is_eqs = 1;
+ if ((ct->data_type == SLANG_CHAR_TYPE) || (ct->data_type == SLANG_UCHAR_TYPE))
+ {
+	unsigned char *p, *pmax;
+
+	p = (unsigned char *)ct->data;
+	pmax = p + num_elements;
+
+	while (p < pmax)
+	 {
+	 if (*p == 0)
+	 {
+		 is_eqs = 0;
+		 break;
+	 }
+	 p++;
+	 }
+	free_array (ct);
+	return is_eqs;
+ }
+
+ if (ct->data_type != SLANG_INT_TYPE)
+ {
+	SLang_Array_Type *tmp;
+	if (1 != _pSLarray_typecast (ct->data_type, (VOID_STAR) &ct, 1,
+				 SLANG_INT_TYPE, (VOID_STAR) &tmp, 1))
+	 {
+	 free_array (ct);
+	 return -1;
+	 }
+	free_array (ct);
+	ct = tmp;
+ }
+
+ ip = (int *)ct->data;
+ ipmax = ip + num_elements;
+
+ while (ip < ipmax)
+ {
+	if (*ip == 0)
+	 {
+	 is_eqs = 0;
+	 break;
+	 }
+	ip++;
+ }
+ free_array (ct);
+ return is_eqs;
+}
+
+static void is_null_intrinsic_intern (SLang_Array_Type *at)
+{
+ SLang_Array_Type *bt;
+
+ bt = SLang_create_array (SLANG_CHAR_TYPE, 0, NULL, at->dims, at->num_dims);
+ if (bt == NULL)
+ return;
+
+ if (at->data_type == SLANG_NULL_TYPE)
+ memset ((char *)bt->data, 1, bt->num_elements);
+ else if (at->flags & SLARR_DATA_VALUE_IS_POINTER)
+ {
+	char *cdata, *cdata_max;
+	char **data;
+
+	if (-1 == coerse_array_to_linear (at))
+	 {
+	 free_array (bt);
+	 return;
+	 }
+
+	cdata = (char *)bt->data;
+	cdata_max = cdata + bt->num_elements;
+	data = (char **)at->data;
+
+	while (cdata < cdata_max)
+	 {
+	 if (*data == NULL)
+	 *cdata = 1;
+
+	 data++;
+	 cdata++;
+	 }
+ }
+
+ SLang_push_array (bt, 1);
+}
+
+static void is_null_intrinsic (void)
+{
+ char ret = 0;
+ SLang_Array_Type *at;
+
+ switch (SLang_peek_at_stack ())
+ {
+ case SLANG_ARRAY_TYPE:
+	if (-1 == SLang_pop_array (&at, 0))
+	 return;
+	is_null_intrinsic_intern (at);
+	free_array (at);
+	break;
+
+ case SLANG_NULL_TYPE:
+	ret = 1;
+	/* drop */
+ default:
+	(void) SLdo_pop();
+	(void) SLang_push_char (ret);
+ }
+}
+
+static SLang_Array_Type *pop_bool_array (void)
+{
+ SLang_Array_Type *at;
+ SLang_Array_Type *tmp_at;
+ int zero;
+
+ if (-1 == SLang_pop_array (&at, 1))
+ return NULL;
+
+ if (at->data_type == SLANG_CHAR_TYPE)
+ return at;
+
+ tmp_at = at;
+ zero = 0;
+ if (1 != array_binary_op (SLANG_NE,
+			 SLANG_ARRAY_TYPE, (VOID_STAR) &at, 1,
+			 SLANG_CHAR_TYPE, (VOID_STAR) &zero, 1,
+			 (VOID_STAR) &tmp_at))
+ {
+	free_array (at);
+	return NULL;
+ }
+
+ free_array (at);
+ at = tmp_at;
+ if (at->data_type != SLANG_CHAR_TYPE)
+ {
+	free_array (at);
+	SLang_set_error (SL_TYPE_MISMATCH);
+	return NULL;
+ }
+ return at;
+}
+
+static int pop_bool_array_and_start (int nargs, SLang_Array_Type **atp, SLindex_Type *sp)
+{
+ SLang_Array_Type *at;
+ SLindex_Type istart = *sp;
+ SLindex_Type num_elements;
+
+ if (nargs == 2)
+ {
+	if (-1 == SLang_pop_array_index (&istart))
+	 return -1;
+ }
+
+ if (NULL == (at = pop_bool_array ()))
+ return -1;
+
+ num_elements = (SLindex_Type) at->num_elements;
+
+ if (istart < 0)
+ istart += num_elements;
+
+ if (istart < 0)
+ {
+	if (num_elements == 0)
+	 istart = 0;
+	else
+	 {
+	 SLang_set_error (SL_Index_Error);
+	 free_array (at);
+	 return -1;
+	 }
+ }
+
+ *atp = at;
+ *sp = istart;
+ return 0;
+}
+
+/* Usage: i = wherefirst (at ,startpos); */
+static void array_where_first (void)
+{
+ SLang_Array_Type *at;
+ char *a_data;
+ SLindex_Type i, num_elements;
+ SLindex_Type istart = 0;
+
+ istart = 0;
+ if (-1 == pop_bool_array_and_start (SLang_Num_Function_Args, &at, &istart))
+ return;
+
+ a_data = (char *) at->data;
+ num_elements = (SLindex_Type) at->num_elements;
+
+ for (i = istart; i < num_elements; i++)
+ {
+	if (a_datai == 0)
+	 continue;
+
+	(void) SLang_push_array_index (i);
+	free_array (at);
+	return;
+ }
+ free_array (at);
+ SLang_push_null ();
+}
+
+/* Usage: i = wherelast (at ,startpos); */
+static void array_where_last (void)
+{
+ SLang_Array_Type *at;
+ char *a_data;
+ SLindex_Type i;
+ SLindex_Type istart = 0;
+
+ istart = -1;
+ if (-1 == pop_bool_array_and_start (SLang_Num_Function_Args, &at, &istart))
+ return;
+
+ a_data = (char *) at->data;
+
+ i = istart + 1;
+ if (i > (SLindex_Type)at->num_elements)
+ i = (SLindex_Type) at->num_elements;
+ while (i > 0)
+ {
+	i--;
+	if (a_datai == 0)
+	 continue;
+
+	(void) SLang_push_array_index (i);
+	free_array (at);
+	return;
+ }
+ free_array (at);
+ SLang_push_null ();
+}
+
+static void array_where_intern (int cmp)
+{
+ SLang_Array_Type *at, *bt;
+ char *a_data;
+ SLindex_Type *b_data;
+ SLuindex_Type i, num_elements;
+ SLindex_Type b_num;
+ SLang_Ref_Type *ref = NULL;
+
+ if (SLang_Num_Function_Args == 2)
+ {
+	if (-1 == SLang_pop_ref (&ref))
+	 return;
+ }
+
+ if (NULL == (at = pop_bool_array ()))
+ return;
+
+ a_data = (char *) at->data;
+ num_elements = at->num_elements;
+
+ b_num = 0;
+ for (i = 0; i < num_elements; i++)
+ if (cmp == (a_datai != 0)) b_num++;
+
+ if (NULL == (bt = SLang_create_array1 (SLANG_ARRAY_INDEX_TYPE, 0, NULL, &b_num, 1, 1)))
+ goto return_error;
+
+ b_data = (SLindex_Type *) bt->data;
+
+ if (ref != NULL)
+ {
+	SLindex_Type *c_data;
+	SLindex_Type c_num;
+	SLang_Array_Type *ct;
+
+	c_num = num_elements - b_num;
+	if (NULL == (ct = SLang_create_array1 (SLANG_ARRAY_INDEX_TYPE, 0, NULL, &c_num, 1, 1)))
+	 goto return_error;
+	c_data = (SLindex_Type *) ct->data;
+
+	for (i = 0; i < num_elements; i++)
+	 {
+	 if (cmp == (a_datai != 0))
+	 *b_data++ = i;
+	 else
+	 *c_data++ = i;
+	 }
+	(void) SLang_assign_to_ref (ref, SLANG_ARRAY_TYPE, &ct);
+	/* Let any error propagate */
+	free_array (ct);
+	/* drop */
+ }
+ else
+ {
+	i = 0;
+	while (b_num)
+	 {
+	 if (cmp == (a_datai != 0))
+	 {
+		 *b_data++ = i;
+		 b_num--;
+	 }
+	 i++;
+	 }
+ }
+
+ (void) SLang_push_array (bt, 0);
+ /* drop */
+
+ return_error:
+ free_array (at);
+ free_array (bt);
+ if (ref != NULL)
+ SLang_free_ref (ref);
+}
+
+static void array_where (void)
+{
+ array_where_intern (1);
+}
+static void array_wherenot (void)
+{
+ array_where_intern (0);
+}
+
+static void array_wherediff (void)
+{
+ char *data, *isdiff;
+ size_t sizeof_type;
+ SLang_Class_Type *cl;
+ SLuindex_Type i, num;
+ SLindex_Type numdiff, *idx_ptr;
+ SLang_Array_Type *at;
+ SLang_Ref_Type *ref = NULL;
+
+ if (SLang_Num_Function_Args == 2)
+ {
+	if (-1 == SLang_pop_ref (&ref))
+	 return;
+ }
+
+ if (-1 == SLang_pop_array (&at, 1))
+ {
+	SLang_free_ref (ref);
+	return;
+ }
+ num = at->num_elements;
+ if (NULL == (isdiff = (char *) SLmalloc (num+1)))
+ goto free_and_return;
+
+ sizeof_type = at->sizeof_type;
+ data = (char *) at->data;
+
+ if (num == 0)
+ numdiff = 0;
+ else
+ {
+	isdiff0 = 1;
+	numdiff = 1;
+ }
+
+ cl = at->cl;
+
+ if (0 == (at->flags & SLARR_DATA_VALUE_IS_POINTER))
+ {
+	for (i = 1; i < num; i++)
+	 {
+	 char *lastdata = data;
+	 data += sizeof_type;
+	 isdiffi = (0 != memcmp (data, lastdata, sizeof_type));
+	 numdiff += isdiffi;
+	 }
+ }
+ else
+ {
+	VOID_STAR *ptr;
+
+	if (NULL == cl->cl_cmp)
+	 {
+	 _pSLang_verror (SL_NOT_IMPLEMENTED,
+			 "%s does not have a comparision function defined",
+			 cl->cl_name);
+	 goto free_and_return;
+	 }
+	ptr = (VOID_STAR *)at->data;
+	for (i = 1; i < num; i++)
+	 {
+	 VOID_STAR *last_ptr = ptr;
+	 ptr++;
+	 if ((*ptr == NULL) || (*last_ptr == NULL))
+	 isdiffi = (*ptr != *last_ptr);
+	 else
+	 {
+		 int cmp;
+		 if (-1 == cl->cl_cmp (at->data_type, ptr, last_ptr, &cmp))
+		 goto free_and_return;
+
+		 isdiffi = (cmp != 0);
+	 }
+	 numdiff += isdiffi;
+	 }
+ }
+
+ SLang_free_array (at);
+ at = SLang_create_array1 (SLANG_ARRAY_INDEX_TYPE, 0, NULL, &numdiff, 1, 1);
+ if (at == NULL)
+ goto free_and_return;
+
+ idx_ptr = (SLindex_Type *) at->data;
+ for (i = 0; i < num; i++)
+ {
+	if (isdiffi) *idx_ptr++ = i;
+ }
+ if (-1 == SLang_push_array (at, 0))
+ goto free_and_return;
+
+ if (ref != NULL)
+ {
+	SLindex_Type numsame;
+	numsame = (SLindex_Type)num - numdiff;
+
+	SLang_free_array (at);	 /* already pushed, reuse variable */
+	at = SLang_create_array1 (SLANG_ARRAY_INDEX_TYPE, 0, NULL, &numsame, 1, 1);
+	if (at == NULL)
+	 goto free_and_return;
+	idx_ptr = (SLindex_Type *) at->data;
+	for (i = 0; i < num; i++)
+	 {
+	 if (isdiffi == 0) *idx_ptr++ = i;
+	 }
+	(void) SLang_assign_to_ref (ref, SLANG_ARRAY_TYPE, &at);
+	/* drop */
+ }
+
+free_and_return:
+
+ SLfree (isdiff);	 /* NULL ok */
+ SLang_free_array (at);
+ if (ref != NULL)
+ SLang_free_ref (ref);
+}
+
+/* Up to the caller to ensure that ind_at is an index array */
+static int do_array_reshape (SLang_Array_Type *at, SLang_Array_Type *ind_at)
+{
+ SLindex_Type *dims;
+ SLuindex_Type i, num_dims;
+ SLuindex_Type num_elements;
+
+ num_dims = ind_at->num_elements;
+ dims = (SLindex_Type *) ind_at->data;
+
+ num_elements = 1;
+ for (i = 0; i < num_dims; i++)
+ {
+	SLindex_Type d = dimsi;
+	if (d < 0)
+	 {
+	 _pSLang_verror (SL_INVALID_PARM, "reshape: dimension is less then 0");
+	 return -1;
+	 }
+
+	num_elements = (SLuindex_Type) (d * num_elements);
+ }
+
+ if ((num_elements != at->num_elements)
+ || (num_dims > SLARRAY_MAX_DIMS))
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Unable to reshape array to specified size");
+	return -1;
+ }
+
+ for (i = 0; i < num_dims; i++)
+ at->dims i = dimsi;
+
+ while (i < SLARRAY_MAX_DIMS)
+ {
+	at->dims i = 1;
+	i++;
+ }
+
+ at->num_dims = num_dims;
+ return 0;
+}
+
+static int pop_1d_index_array (SLang_Array_Type **ind_atp)
+{
+ SLang_Array_Type *ind_at;
+
+ *ind_atp = NULL;
+ if (-1 == SLang_pop_array_of_type (&ind_at, SLANG_ARRAY_INDEX_TYPE))
+ return -1;
+ if (ind_at->num_dims != 1)
+ {
+	_pSLang_verror (SL_TYPE_MISMATCH, "Expecting 1-d array of indices");
+	return -1;
+ }
+ *ind_atp = ind_at;
+ return 0;
+}
+
+static int pop_reshape_args (SLang_Array_Type **atp, SLang_Array_Type **ind_atp)
+{
+ SLang_Array_Type *at, *ind_at;
+
+ *ind_atp = *atp = NULL;
+
+ if (-1 == pop_1d_index_array (&ind_at))
+ return -1;
+
+ if (-1 == SLang_pop_array (&at, 1))
+ {
+	free_array (ind_at);
+	return -1;
+ }
+
+ *atp = at;
+ *ind_atp = ind_at;
+ return 0;
+}
+
+static void array_reshape (void)
+{
+ SLang_Array_Type *at, *ind_at;
+
+ if (-1 == pop_reshape_args (&at, &ind_at))
+ return;
+ (void) do_array_reshape (at, ind_at);
+ free_array (at);
+ free_array (ind_at);
+}
+
+static void _array_reshape (void)
+{
+ SLang_Array_Type *at;
+ SLang_Array_Type *new_at;
+ SLang_Array_Type *ind_at;
+
+ if (-1 == pop_reshape_args (&at, &ind_at))
+ return;
+
+ /* FIXME: Priority=low: duplicate_array could me modified to look at num_refs */
+
+ /* Now try to avoid the overhead of creating a new array if possible */
+ if (at->num_refs == 1)
+ {
+	/* Great, we are the sole owner of this array. */
+	if ((-1 == do_array_reshape (at, ind_at))
+	 || (-1 == SLclass_push_ptr_obj (SLANG_ARRAY_TYPE, (VOID_STAR)at)))
+	 free_array (at);
+	free_array (ind_at);
+	return;
+ }
+
+ new_at = SLang_duplicate_array (at);
+ if (new_at != NULL)
+ {
+	if (0 == do_array_reshape (new_at, ind_at))
+	 (void) SLang_push_array (new_at, 0);
+
+	free_array (new_at);
+ }
+ free_array (at);
+ free_array (ind_at);
+}
+
+typedef struct
+{
+ SLang_Array_Type *at;
+ int is_array;
+ size_t increment;
+ char *addr;
+}
+Map_Arg_Type;
+
+typedef struct
+{
+ SLtype type;
+ SLang_Array_Type *at;
+ char *addr;
+}
+Map_Return_Type;
+
+static void free_arraymap_retvals (Map_Return_Type *r, SLuindex_Type n)
+{
+ SLuindex_Type i;
+
+ if (r == NULL)
+ return;
+
+ for (i = 0; i < n; i++)
+ {
+	if (ri.at != NULL)
+	 free_array (ri.at);
+ }
+ SLfree ((char *)r);
+}
+
+static void free_arraymap_argvals (Map_Arg_Type *a, SLuindex_Type n)
+{
+ SLuindex_Type i;
+
+ if (a == NULL)
+ return;
+
+ for (i = 0; i < n; i++)
+ {
+	if (ai.at != NULL)
+	 free_array (ai.at);
+ }
+ SLfree ((char *)a);
+}
+
+static int pop_array_map_args (int num_arraymap_parms,
+			 Map_Return_Type **retvalsp, SLuindex_Type *nretp,
+			 SLang_Name_Type **funcp,
+			 Map_Arg_Type **argvalsp, SLuindex_Type *nargsp,
+			 SLang_Array_Type **at_controlp)
+{
+ Map_Return_Type *retvals = NULL;
+ Map_Arg_Type *argvals = NULL;
+ unsigned int i, nret, nargs=0;
+ SLang_Array_Type *at_control;
+ SLang_Name_Type *func = NULL;
+
+ if (-1 == SLreverse_stack (num_arraymap_parms))
+ return -1;
+
+ nret = 0;
+ while (nret < (unsigned int)num_arraymap_parms)
+ {
+	int type;
+
+	if (-1 == (type = SLang_peek_at_stack_n (nret)))
+	 goto return_error;
+
+	if (type != SLANG_DATATYPE_TYPE)
+	 break;
+
+	nret++;
+ }
+ if (nret == 0)
+ retvals = NULL;
+ else
+ {
+	if (NULL == (retvals = (Map_Return_Type *)SLcalloc(nret,sizeof(Map_Return_Type))))
+	 goto return_error;
+
+	for (i = 0; i < nret; i++)
+	 {
+	 num_arraymap_parms--;
+	 if (-1 == SLang_pop_datatype (&retvalsi.type))
+	 goto return_error;
+	 }
+ }
+
+ if (num_arraymap_parms != 0)
+ {
+	num_arraymap_parms--;
+	func = SLang_pop_function ();
+ }
+ if (func == NULL)
+ {
+	SLang_verror (SL_INVALID_PARM, "Expecting a reference to a function");
+	goto return_error;
+ }
+
+ if (num_arraymap_parms == 0)
+ {
+	SLang_verror (SL_NUM_ARGS_ERROR, "array_map requires at least one function argument");
+	goto return_error;
+ }
+
+ nargs = num_arraymap_parms;
+ if (NULL == (argvals = (Map_Arg_Type *)SLcalloc (nargs, sizeof(Map_Arg_Type))))
+ goto return_error;
+
+ at_control = NULL;
+ for (i = 0; i < nargs; i++)
+ {
+	SLang_Array_Type *at;
+
+	argvalsi.is_array = (SLANG_ARRAY_TYPE == SLang_peek_at_stack ());
+
+	num_arraymap_parms--;
+	if (-1 == SLang_pop_array (&at, 1))
+	 goto return_error;
+
+	if ((at_control == NULL) && (argvalsi.is_array))
+	 at_control = at;
+	argvalsi.at = at;
+	argvalsi.addr = (char *)at->data;
+ }
+
+ if (at_control == NULL)
+ at_control = argvals0.at;
+
+ for (i = 0; i < nret; i++)
+ {
+	SLtype t = retvalsi.type;
+
+	if (t == SLANG_UNDEFINED_TYPE) /* Void_Type */
+	 {
+	 retvalsi.at = NULL;
+	 retvalsi.addr = NULL;
+	 }
+	else
+	 {
+	 SLang_Array_Type *at;
+	 if (NULL == (at = SLang_create_array (t, 0, NULL, at_control->dims, at_control->num_dims)))
+	 goto return_error;
+	 retvalsi.at = at;
+	 retvalsi.addr = (char *)at->data;
+	 }
+ }
+
+ *nretp = nret;
+ *retvalsp = retvals;
+ *funcp = func;
+ *nargsp = nargs;
+ *argvalsp = argvals;
+ *at_controlp = at_control;
+ return 0;
+
+return_error:
+ (void) SLdo_pop_n (num_arraymap_parms);
+ free_arraymap_retvals (retvals, nret);
+ SLang_free_function (func);	 /* NULL ok */
+ free_arraymap_argvals (argvals, nargs);
+ return -1;
+}
+
+/* Usage: array_map (Return-Type..., &func, args...); */
+static void array_map (void)
+{
+ Map_Arg_Type *argvals;
+ Map_Return_Type *retvals;
+ SLuindex_Type i, nrets, nargs;
+ SLang_Array_Type *at_control;
+ SLang_Name_Type *func;
+ SLuindex_Type num_elements;
+ int num_arraymap_parms;
+
+ num_arraymap_parms = SLang_Num_Function_Args;
+ if (num_arraymap_parms < 2)
+ {
+	_pSLang_verror (SL_INVALID_PARM,
+		 "Usage: array_map (Return-Types..., &func, args...)");
+	SLdo_pop_n (num_arraymap_parms);
+	return;
+ }
+
+ if (-1 == pop_array_map_args (num_arraymap_parms, &retvals, &nrets, &func,
+				 &argvals, &nargs, &at_control))
+ return;
+
+ num_elements = at_control->num_elements;
+
+ for (i = 0; i < nargs; i++)
+ {
+	SLang_Array_Type *ati = argvalsi.at;
+	/* FIXME: Priority = low: The actual dimensions should be compared. */
+	if (ati->num_elements == num_elements)
+	 argvalsi.increment = ati->sizeof_type;
+	else
+	 argvalsi.increment = 0;
+
+	if ((num_elements != 0)
+	 && (ati->num_elements == 0))
+	 {
+	 _pSLang_verror (SL_TypeMismatch_Error, "array_map: function argument %lu of %lu is an empty array",
+			 (unsigned long) (i+1), (unsigned long)nargs);
+	 goto return_error;
+	 }
+ }
+
+ for (i = 0; i < num_elements; i++)
+ {
+	unsigned int j;
+	Map_Return_Type *ret;
+
+	if (-1 == SLang_start_arg_list ())
+	 goto return_error;
+
+	for (j = 0; j < nargs; j++)
+	 {
+	 if (-1 == push_element_at_addr (argvalsj.at,
+					 (VOID_STAR) argvalsj.addr,
+					 1))
+	 {
+		 SLdo_pop_n (j);
+		 goto return_error;
+	 }
+
+	 argvalsj.addr += argvalsj.increment;
+	 }
+
+	if (-1 == SLang_end_arg_list ())
+	 {
+	 SLdo_pop_n (nargs);
+	 goto return_error;
+	 }
+
+	if (-1 == SLexecute_function (func))
+	 goto return_error;
+
+	ret = retvals + nrets;
+	while (ret > retvals)
+	 {
+	 SLang_Array_Type *at;
+	 SLang_Class_Type *cl;
+
+	 ret--;
+	 if (NULL == (at = ret->at))
+	 continue;
+
+	 cl = at->cl;
+
+	 if (0 == (at->flags & SLARR_DATA_VALUE_IS_POINTER))
+	 {
+		 if (-1 == cl->cl_apop (at->data_type, (VOID_STAR) ret->addr))
+		 goto return_error;
+	 }
+	 else
+	 {
+		 /* Use aput_get_data_to_put to allow NULLs */
+		 SLuindex_Type nelements = 1;
+		 int allow_array = 0;
+		 SLang_Array_Type *unused_array;
+		 char *data_to_put;
+		 SLuindex_Type unused_data_increment;
+
+		 if (-1 == aput_get_data_to_put (cl, nelements, allow_array, &unused_array, &data_to_put, &unused_data_increment))
+		 goto return_error;
+
+		 if (-1 == transfer_n_elements(at, ret->addr, data_to_put, at->sizeof_type, 1, 1))
+		 {
+		 (*cl->cl_destroy) (cl->cl_data_type, (VOID_STAR) data_to_put);
+		 goto return_error;
+		 }
+		 (*cl->cl_destroy) (cl->cl_data_type, (VOID_STAR) data_to_put);
+	 }
+	 ret->addr += at->sizeof_type;
+	 }
+ }
+
+ for (i = 0; i < nrets; i++)
+ {
+	if (retvalsi.at != NULL)
+	 (void) SLang_push_array (retvalsi.at, 0);
+ }
+
+ /* drop */
+
+return_error:
+ free_arraymap_argvals (argvals, nargs);
+ SLang_free_function (func);
+ free_arraymap_retvals (retvals, nrets);
+}
+
+static int push_array_shape (SLang_Array_Type *at)
+{
+ SLang_Array_Type *bt;
+ SLindex_Type num_dims;
+ SLindex_Type *bdata, *a_dims;
+ int i;
+
+ num_dims = (SLindex_Type)at->num_dims;
+ if (NULL == (bt = SLang_create_array (SLANG_ARRAY_INDEX_TYPE, 0, NULL, &num_dims, 1)))
+ return -1;
+
+ a_dims = at->dims;
+ bdata = (SLindex_Type *) bt->data;
+ for (i = 0; i < num_dims; i++) bdata i = a_dims i;
+
+ return SLang_push_array (bt, 1);
+}
+
+static void array_info (void)
+{
+ SLang_Array_Type *at;
+
+ if (-1 == pop_array (&at, 1))
+ return;
+
+ if (0 == push_array_shape (at))
+ {
+	(void) SLang_push_integer ((int) at->num_dims);
+	(void) SLang_push_datatype (at->data_type);
+ }
+ free_array (at);
+}
+
+static void array_shape (void)
+{
+ SLang_Array_Type *at;
+
+ if (-1 == pop_array (&at, 1))
+ return;
+
+ (void) push_array_shape (at);
+ free_array (at);
+}
+
+#if 0
+static int pop_int_indices (SLindex_Type *dims, unsigned int ndims)
+{
+ int i;
+
+ if (ndims > SLARRAY_MAX_DIMS)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Too many dimensions specified");
+	return -1;
+ }
+ for (i = (int)ndims-1; i >= 0; i--)
+ {
+	if (-1 == SLang_pop_integer (dims+i))
+	 return -1;
+ }
+ return 0;
+}
+/* Usage: aput(v, x, i,..,k) */
+static void aput_intrin (void)
+{
+ char *data_to_put;
+ SLuindex_Type data_increment;
+ SLindex_Type indicesSLARRAY_MAX_DIMS;
+ int is_ptr;
+ unsigned int ndims = SLang_Num_Function_Args-2;
+ SLang_Array_Type *at, *bt_unused;
+
+ if (-1 == pop_int_indices (indices, ndims))
+ return;
+
+ if (-1 == SLang_pop_array (&at, 1))
+ return;
+
+ if (at->num_dims != ndims)
+ {
+	SLang_set_error (SL_Index_Error);
+	free_array (at);
+	return;
+ }
+
+ is_ptr = (at->flags & SLARR_DATA_VALUE_IS_POINTER);
+
+ if (-1 == aput_get_data_to_put (at->cl, 1, 0, &bt_unused, &data_to_put, &data_increment))
+ {
+	free_array (at);
+	return;
+ }
+
+ (void) _pSLarray_aput_transfer_elem (at, indices, (VOID_STAR)data_to_put,
+				 at->sizeof_type, is_ptr);
+ if (is_ptr)
+ (*at->cl->cl_destroy) (at->cl->cl_data_type, (VOID_STAR) data_to_put);
+
+ free_array (at);
+}
+
+/* Usage: x_i..k = aget(x, i,..,k) */
+static void aget_intrin (void)
+{
+ SLindex_Type dimsSLARRAY_MAX_DIMS;
+ unsigned int ndims = (unsigned int) (SLang_Num_Function_Args-1);
+ SLang_Array_Type *at;
+ VOID_STAR data;
+
+ if (-1 == pop_int_indices (dims, ndims))
+ return;
+
+ if (-1 == pop_array (&at, 1))
+ return;
+
+ if (at->num_dims != ndims)
+ {
+	SLang_set_error (SL_Index_Error);
+	free_array (at);
+	return;
+ }
+
+ if ((ndims == 1)
+ && (at->index_fun == linear_get_data_addr))
+ {
+	SLindex_Type i = dims0;
+	if (i < 0)
+	 {
+	 i += at->dims0;
+	 if (i < 0)
+	 i = at->dims0;
+	 }
+	if (i >= at->dims0)
+	 {
+	 SLang_set_error (SL_Index_Error);
+	 free_array (at);
+	 return;
+	 }
+	if (at->data_type == SLANG_INT_TYPE)
+	 {
+	 (void) SLclass_push_int_obj (SLANG_INT_TYPE, *((int *)at->data + i));
+	 goto free_and_return;
+	 }
+#if SLANG_HAS_FLOAT
+	if (at->data_type == SLANG_DOUBLE_TYPE)
+	 {
+	 (void) SLclass_push_double_obj (SLANG_DOUBLE_TYPE, *((double *)at->data + i));
+	 goto free_and_return;
+	 }
+#endif
+	if (at->data_type == SLANG_CHAR_TYPE)
+	 {
+	 (void) SLclass_push_int_obj (SLANG_UCHAR_TYPE, *((unsigned char *)at->data + i));
+	 goto free_and_return;
+	 }
+	data = (VOID_STAR) ((char *)at->data + (SLuindex_Type)i * at->sizeof_type);
+ }
+ else data = get_data_addr (at, dims);
+
+ if (data != NULL)
+ (void) push_element_at_addr (at, (VOID_STAR) data, ndims);
+
+ free_and_return:
+ free_array (at);
+}
+#endif
+
+static int pop_byte_order (int *bop)
+{
+ int bo;
+
+ if (-1 == SLang_pop_integer (&bo))
+ return -1;
+
+ switch (bo)
+ {
+ case 'n': case 'N': case '=': bo = _pSLANG_BYTEORDER_NATIVE; break;
+ case 'b': case 'B': case '>': bo = _pSLANG_BYTEORDER_BIGE; break;
+ case 'l': case 'L': case '<': bo = _pSLANG_BYTEORDER_LILE; break;
+ default:
+	SLang_verror (SL_InvalidParm_Error, "Invalid byte-order specifier, expecting one of 'B', 'L', or 'N'");
+	return -1;
+ }
+
+ *bop = bo;
+ return 0;
+}
+
+/* Usage b = _array_byteswap (a, from, to);
+ */
+static void byteswap_intrin (void)
+{
+ SLang_Array_Type *at, *bt;
+ int from, to;
+ int converted_scalar;
+
+ if (SLang_Num_Function_Args != 3)
+ {
+	SLang_verror (SL_Usage_Error, "\
+Usage: b = _array_byteswap (a, from, to);\
+ from/to is one of: 'B' (big), 'L' (little), or 'N'(native) endian order");
+	return;
+ }
+ if ((-1 == pop_byte_order (&to)) || (-1 == pop_byte_order (&from)))
+ return;
+
+ if (-1 == SLang_pop_array (&at, 1))
+ return;
+
+ converted_scalar = at->flags & SLARR_DERIVED_FROM_SCALAR;
+
+ bt = _pSLpack_byteswap_array (at, from, to);
+ SLang_free_array (at);
+ if (bt == NULL)
+ return;
+
+ if (converted_scalar)
+ (void) push_element_at_index (bt, 0);
+ else
+ (void) SLang_push_array (bt, 0);
+
+ SLang_free_array (bt);
+}
+
+
+static SLang_Intrin_Fun_Type Array_Table =
+{
+ MAKE_INTRINSIC_0("array_map", array_map, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("array_sort", array_sort_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("get_default_sort_method", get_default_sort_method, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("set_default_sort_method", set_default_sort_method, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_1("array_to_bstring", array_to_bstring, SLANG_VOID_TYPE, SLANG_ARRAY_TYPE),
+ MAKE_INTRINSIC_1("bstring_to_array", bstring_to_array, SLANG_VOID_TYPE, SLANG_BSTRING_TYPE),
+ MAKE_INTRINSIC("init_char_array", init_char_array, SLANG_VOID_TYPE, 0),
+ MAKE_INTRINSIC_0("_isnull", is_null_intrinsic, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("array_info", array_info, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("array_shape", array_shape, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("where", array_where, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherenot", array_wherenot, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherefirst", array_where_first, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherelast", array_where_last, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherediff", array_wherediff, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("reshape", array_reshape, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_reshape", _array_reshape, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_array_byteswap", byteswap_intrin, SLANG_VOID_TYPE),
+#if 0
+ MAKE_INTRINSIC_0("__aget", aget_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("__aput", aput_intrin, SLANG_VOID_TYPE),
+#endif
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static char *array_string (SLtype type, VOID_STAR v)
+{
+ SLang_Array_Type *at;
+ char buf512;
+ unsigned int i, num_dims;
+ SLindex_Type *dims;
+
+ at = *(SLang_Array_Type **) v;
+ type = at->data_type;
+ num_dims = at->num_dims;
+ dims = at->dims;
+
+ sprintf (buf, "%s%ld", SLclass_get_datatype_name (type), (long)at->dims0);
+
+ for (i = 1; i < num_dims; i++)
+ sprintf (buf + strlen(buf), ",%ld", (long)dimsi);
+ strcat (buf, "");
+
+ return SLmake_string (buf);
+}
+
+static void array_destroy (SLtype type, VOID_STAR v)
+{
+ SLang_Array_Type *at = *(SLang_Array_Type **) v;
+
+ (void) type;
+ if ((at != NULL)
+ && (at->num_refs > 1))
+ {
+	at->num_refs -= 1;
+	return;
+ }
+ free_array (*(SLang_Array_Type **) v);
+}
+
+static int array_push (SLtype type, VOID_STAR v)
+{
+ SLang_Array_Type *at;
+
+ (void) type;
+
+ at = *(SLang_Array_Type **) v;
+ if (at == NULL)
+ return SLang_push_null ();
+
+ at->num_refs += 1;
+
+ if (0 == SLclass_push_ptr_obj (SLANG_ARRAY_TYPE, (VOID_STAR) at))
+ return 0;
+
+ at->num_refs -= 1;
+ return -1;
+}
+
+int SLang_push_array (SLang_Array_Type *at, int free_flag)
+{
+ if (at == NULL)
+ return SLang_push_null ();
+
+ return _pSLang_push_array (at, free_flag);
+}
+
+/* Intrinsic arrays are not stored in a variable. So, the address that
+ * would contain the variable holds the array address.
+ */
+static int array_push_intrinsic (SLtype type, VOID_STAR v)
+{
+ (void) type;
+ return SLang_push_array ((SLang_Array_Type *) v, 0);
+}
+
+int _pSLarray_add_bin_op (SLtype type)
+{
+ SL_OOBinary_Type *ab;
+ SLang_Class_Type *cl;
+
+ if (type == SLANG_VOID_TYPE)
+ {
+	cl = _pSLclass_get_class (SLANG_ARRAY_TYPE);
+	if ((cl->cl_this_binary_void != NULL)
+	 || (cl->cl_void_binary_this != NULL))
+	 return 0;
+ }
+ else
+ {
+	cl = _pSLclass_get_class (type);
+	ab = cl->cl_binary_ops;
+
+	while (ab != NULL)
+	 {
+	 if (ab->data_type == SLANG_ARRAY_TYPE)
+	 return 0;
+	 ab = ab->next;
+	 }
+ }
+
+ if ((-1 == SLclass_add_binary_op (SLANG_ARRAY_TYPE, type, array_binary_op, array_binary_op_result))
+ || (-1 == SLclass_add_binary_op (type, SLANG_ARRAY_TYPE, array_binary_op, array_binary_op_result)))
+ return -1;
+
+ return 0;
+}
+
+static SLang_Array_Type *
+do_array_math_op (int op, int unary_type,
+		 SLang_Array_Type *at, SLuindex_Type na)
+{
+ SLtype a_type, b_type;
+ int (*f) (int, SLtype, VOID_STAR, SLuindex_Type, VOID_STAR);
+ SLang_Array_Type *bt;
+ SLang_Class_Type *b_cl;
+
+ if (na != 1)
+ {
+	_pSLang_verror (SL_NOT_IMPLEMENTED, "Operation restricted to 1 array");
+	return NULL;
+ }
+
+ a_type = at->data_type;
+ if (NULL == (f = _pSLclass_get_unary_fun (op, at->cl, &b_cl, unary_type)))
+ return NULL;
+ b_type = b_cl->cl_data_type;
+
+ if (-1 == coerse_array_to_linear (at))
+ return NULL;
+
+#if SLANG_USE_TMP_OPTIMIZATION
+ /* If we are dealing with scalar (or vector) objects, and if the object
+ * appears to be owned by the stack, then use it instead of creating a
+ * new version. This can happen with code such as:
+ * @ x = 1,2,3,4;
+ * @ x = UNARY_OP(__tmp(x));
+ */
+ if (((b_cl->cl_class_type == SLANG_CLASS_TYPE_SCALAR)
+	|| (b_cl->cl_class_type == SLANG_CLASS_TYPE_VECTOR))
+ && (at->num_refs == 1)
+ && (at->data_type == b_cl->cl_data_type)
+ && (0 == (at->flags & SLARR_DATA_VALUE_IS_READ_ONLY)))
+ {
+	bt = at;
+	bt->num_refs = 2;
+ }
+ else
+#endif				 /* SLANG_USE_TMP_OPTIMIZATION */
+ if (NULL == (bt = SLang_create_array1 (b_type, 0, NULL, at->dims, at->num_dims, 1)))
+ return NULL;
+
+ if (1 != (*f)(op, a_type, at->data, at->num_elements, bt->data))
+ {
+	free_array (bt);
+	return NULL;
+ }
+ return bt;
+}
+
+static int
+array_unary_op_result (int op, SLtype a, SLtype *b)
+{
+ (void) op;
+ (void) a;
+ *b = SLANG_ARRAY_TYPE;
+ return 1;
+}
+
+static int
+array_unary_op (int op,
+		SLtype a, VOID_STAR ap, SLuindex_Type na,
+		VOID_STAR bp)
+{
+ SLang_Array_Type *at;
+
+ (void) a;
+ at = *(SLang_Array_Type **) ap;
+ if (NULL == (at = do_array_math_op (op, SLANG_BC_UNARY, at, na)))
+ {
+	if (SLang_get_error ()) return -1;
+	return 0;
+ }
+ *(SLang_Array_Type **) bp = at;
+ return 1;
+}
+
+static int
+array_math_op (int op,
+	 SLtype a, VOID_STAR ap, SLuindex_Type na,
+	 VOID_STAR bp)
+{
+ SLang_Array_Type *at;
+
+ (void) a;
+ at = *(SLang_Array_Type **) ap;
+ if (NULL == (at = do_array_math_op (op, SLANG_BC_MATH_UNARY, at, na)))
+ {
+	if (SLang_get_error ()) return -1;
+	return 0;
+ }
+ *(SLang_Array_Type **) bp = at;
+ return 1;
+}
+
+static int
+array_app_op (int op,
+	 SLtype a, VOID_STAR ap, SLuindex_Type na,
+	 VOID_STAR bp)
+{
+ SLang_Array_Type *at;
+
+ (void) a;
+ at = *(SLang_Array_Type **) ap;
+ if (NULL == (at = do_array_math_op (op, SLANG_BC_APP_UNARY, at, na)))
+ {
+	if (SLang_get_error ()) return -1;
+	return 0;
+ }
+ *(SLang_Array_Type **) bp = at;
+ return 1;
+}
+
+/* Typecast array from a_type to b_type */
+int
+_pSLarray_typecast (SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+		 SLtype b_type, VOID_STAR bp,
+		 int is_implicit)
+{
+ SLang_Array_Type *at, *bt;
+ SLang_Class_Type *b_cl;
+ int no_init;
+ int (*t) (SLtype, VOID_STAR, SLuindex_Type, SLtype, VOID_STAR);
+
+ if (na != 1)
+ {
+	_pSLang_verror (SL_NOT_IMPLEMENTED, "typecast of multiple arrays not implemented");
+	return -1;
+ }
+
+ at = *(SLang_Array_Type **) ap;
+ a_type = at->data_type;
+
+ if (a_type == b_type)
+ {
+	at->num_refs += 1;
+	*(SLang_Array_Type **) bp = at;
+	return 1;
+ }
+
+ /* check for alias */
+ if (at->cl == (b_cl = _pSLclass_get_class (b_type)))
+ {
+	at->num_refs += 1;
+
+	/* Force to the desired type. Hopefully there will be no consequences
+	 * from this.
+	 */
+	at->data_type = b_cl->cl_data_type;
+	*(SLang_Array_Type **) bp = at;
+	return 1;
+ }
+
+ if (at->flags & SLARR_DATA_VALUE_IS_RANGE)
+ {
+	if (-1 == try_typecast_range_array (at, b_type, &bt))
+	 return -1;
+	if (bt != NULL)
+	 {
+	 *(SLang_Array_Type **) bp = bt;
+	 return 1;
+	 }
+	/* Couldn't do it, so drop */
+ }
+
+ /* Typecast NULL array to the desired type with elements set to NULL */
+ if ((a_type == SLANG_NULL_TYPE)
+ && ((b_cl->cl_class_type == SLANG_CLASS_TYPE_MMT)
+	 || (b_cl->cl_class_type == SLANG_CLASS_TYPE_PTR)))
+ {
+	if (NULL == (bt = SLang_create_array1 (b_type, 0, NULL, at->dims, at->num_dims, 0)))
+	 return -1;
+
+	*(SLang_Array_Type **) bp = bt;
+	return 1;
+ }
+
+ if (NULL == (t = _pSLclass_get_typecast (a_type, b_type, is_implicit)))
+ return -1;
+
+ if (-1 == coerse_array_to_linear (at))
+ return -1;
+
+ no_init = ((b_cl->cl_class_type == SLANG_CLASS_TYPE_SCALAR)
+	 || (b_cl->cl_class_type == SLANG_CLASS_TYPE_VECTOR));
+
+ if (NULL == (bt = SLang_create_array1 (b_type, 0, NULL, at->dims, at->num_dims, no_init)))
+ return -1;
+
+ if (1 == (*t) (a_type, at->data, at->num_elements, b_type, bt->data))
+ {
+	*(SLang_Array_Type **) bp = bt;
+	return 1;
+ }
+
+ free_array (bt);
+ return 0;
+}
+
+static SLang_Array_Type *duplicate_range_array (SLang_Array_Type *at)
+{
+ SLarray_Range_Array_Type *r = (SLarray_Range_Array_Type *)at->data;
+ return create_range_array (r, (SLindex_Type)at->num_elements, at->data_type, r->to_linear_fun);
+}
+
+SLang_Array_Type *SLang_duplicate_array (SLang_Array_Type *at)
+{
+ SLang_Array_Type *bt;
+ char *data, *a_data;
+ SLuindex_Type i, num_elements;
+ size_t sizeof_type, size;
+ int (*cl_acopy) (SLtype, VOID_STAR, VOID_STAR);
+ SLtype type;
+
+ if (at->flags & SLARR_DATA_VALUE_IS_RANGE)
+ return duplicate_range_array (at);
+
+ if (-1 == coerse_array_to_linear (at))
+ return NULL;
+
+ type = at->data_type;
+ num_elements = at->num_elements;
+ sizeof_type = at->sizeof_type;
+
+ if (NULL == (data = (char *)_SLcalloc (num_elements, sizeof_type)))
+ return NULL;
+
+ size = num_elements * sizeof_type;
+
+ if (NULL == (bt = SLang_create_array (type, 0, (VOID_STAR)data, at->dims, at->num_dims)))
+ {
+	SLfree (data);
+	return NULL;
+ }
+
+ a_data = (char *) at->data;
+ if (0 == (at->flags & SLARR_DATA_VALUE_IS_POINTER))
+ {
+	SLMEMCPY (data, a_data, size);
+	return bt;
+ }
+
+ SLMEMSET (data, 0, size);
+
+ cl_acopy = at->cl->cl_acopy;
+ for (i = 0; i < num_elements; i++)
+ {
+	if (NULL != *(VOID_STAR *) a_data)
+	 {
+	 if (-1 == (*cl_acopy) (type, (VOID_STAR) a_data, (VOID_STAR) data))
+	 {
+		 free_array (bt);
+		 return NULL;
+	 }
+	 }
+
+	data += sizeof_type;
+	a_data += sizeof_type;
+ }
+
+ return bt;
+}
+
+static int array_dereference (SLtype type, VOID_STAR addr)
+{
+ SLang_Array_Type *at;
+
+ (void) type;
+ at = SLang_duplicate_array (*(SLang_Array_Type **) addr);
+ if (at == NULL) return -1;
+ return SLang_push_array (at, 1);
+}
+
+/* This function gets called via, e.g., @Array_Type (Double_Type, 10,20);
+ */
+static int
+array_datatype_deref (SLtype type)
+{
+ SLang_Array_Type *ind_at;
+ SLang_Array_Type *at;
+
+#if 0
+ /* The parser generated code for this as if a function call were to be
+ * made. However, the interpreter simply called the deref object routine
+ * instead of the function call. So, I must simulate the function call.
+ * This needs to be formalized to hide this detail from applications
+ * who wish to do the same. So...
+ * FIXME: Priority=medium
+ */
+ if (0 == _pSL_increment_frame_pointer ())
+ (void) _pSL_decrement_frame_pointer ();
+#endif
+
+ if (-1 == pop_1d_index_array (&ind_at))
+ goto return_error;
+
+ if (-1 == SLang_pop_datatype (&type))
+ goto return_error;
+
+ if (NULL == (at = SLang_create_array (type, 0, NULL,
+					 (SLindex_Type *) ind_at->data,
+					 ind_at->num_elements)))
+ goto return_error;
+
+ free_array (ind_at);
+ return SLang_push_array (at, 1);
+
+ return_error:
+ free_array (ind_at);
+ return -1;
+}
+
+static int array_length (SLtype type, VOID_STAR v, SLuindex_Type *len)
+{
+ SLang_Array_Type *at;
+
+ (void) type;
+ at = *(SLang_Array_Type **) v;
+ *len = at->num_elements;
+ return 0;
+}
+
+static void array_inc_ref (SLtype type, VOID_STAR v, int dr)
+{
+ SLang_Array_Type *at = *(SLang_Array_Type **) v;
+ (void) type;
+ if (at != NULL)
+ at->num_refs += dr;
+}
+
+int
+_pSLarray_init_slarray (void)
+{
+ SLang_Class_Type *cl;
+
+ if (-1 == SLadd_intrin_fun_table (Array_Table, NULL))
+ return -1;
+
+ if (NULL == (cl = SLclass_allocate_class ("Array_Type")))
+ return -1;
+
+ (void) SLclass_set_string_function (cl, array_string);
+ (void) SLclass_set_destroy_function (cl, array_destroy);
+ (void) SLclass_set_push_function (cl, array_push);
+ (void) SLclass_set_length_function (cl, array_length);
+ (void) SLclass_set_deref_function (cl, array_dereference);
+ (void) SLclass_set_is_container (cl, 1);
+
+ cl->cl_push_intrinsic = array_push_intrinsic;
+ cl->cl_datatype_deref = array_datatype_deref;
+ cl->cl_inc_ref = array_inc_ref;
+
+ (void) SLclass_set_eqs_function (cl, array_eqs_method);
+
+ if (-1 == SLclass_register_class (cl, SLANG_ARRAY_TYPE, sizeof (VOID_STAR),
+				 SLANG_CLASS_TYPE_PTR))
+ return -1;
+
+ if ((-1 == SLclass_add_binary_op (SLANG_ARRAY_TYPE, SLANG_ARRAY_TYPE, array_binary_op, array_binary_op_result))
+ || (-1 == SLclass_add_unary_op (SLANG_ARRAY_TYPE, array_unary_op, array_unary_op_result))
+ || (-1 == SLclass_add_app_unary_op (SLANG_ARRAY_TYPE, array_app_op, array_unary_op_result))
+ || (-1 == SLclass_add_math_op (SLANG_ARRAY_TYPE, array_math_op, array_unary_op_result)))
+ return -1;
+
+ return 0;
+}
+
+int SLang_pop_array (SLang_Array_Type **at_ptr, int convert_scalar)
+{
+ SLang_Array_Type *at;
+
+ if (-1 == pop_array (&at, convert_scalar))
+ {
+	*at_ptr = NULL;
+	return -1;
+ }
+
+ if (-1 == coerse_array_to_linear (at))
+ {
+	free_array (at);
+	*at_ptr = NULL;
+	return -1;
+ }
+ *at_ptr = at;
+ return 0;
+}
+
+int SLang_pop_array_of_type (SLang_Array_Type **at, SLtype type)
+{
+ if (-1 == SLclass_typecast (type, 1, 1))
+ return -1;
+
+ return SLang_pop_array (at, 1);
+}
+
+void (*_pSLang_Matrix_Multiply)(void);
+
+int _pSLarray_matrix_multiply (void)
+{
+ if (_pSLang_Matrix_Multiply != NULL)
+ {
+	(*_pSLang_Matrix_Multiply)();
+	return 0;
+ }
+ _pSLang_verror (SL_NOT_IMPLEMENTED, "Matrix multiplication not available");
+ return -1;
+}
+
+struct _pSLang_Foreach_Context_Type
+{
+ SLang_Array_Type *at;
+ SLindex_Type next_element_index;
+};
+
+SLang_Foreach_Context_Type *
+_pSLarray_cl_foreach_open (SLtype type, unsigned int num)
+{
+ SLang_Foreach_Context_Type *c;
+
+ if (num != 0)
+ {
+	SLdo_pop_n (num + 1);
+	_pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "%s does not support 'foreach using' form",
+		 SLclass_get_datatype_name (type));
+	return NULL;
+ }
+
+ if (NULL == (c = (SLang_Foreach_Context_Type *) SLmalloc (sizeof (SLang_Foreach_Context_Type))))
+ return NULL;
+
+ memset ((char *) c, 0, sizeof (SLang_Foreach_Context_Type));
+
+ if (-1 == pop_array (&c->at, 1))
+ {
+	SLfree ((char *) c);
+	return NULL;
+ }
+
+ return c;
+}
+
+void _pSLarray_cl_foreach_close (SLtype type, SLang_Foreach_Context_Type *c)
+{
+ (void) type;
+ if (c == NULL) return;
+ free_array (c->at);
+ SLfree ((char *) c);
+}
+
+int _pSLarray_cl_foreach (SLtype type, SLang_Foreach_Context_Type *c)
+{
+ SLang_Array_Type *at;
+ VOID_STAR data;
+
+ (void) type;
+
+ if (c == NULL)
+ return -1;
+
+ at = c->at;
+ /* Use <= here to prepare for the time when arrays are permitted to change size */
+ if ((SLindex_Type)at->num_elements <= c->next_element_index)
+ return 0;
+
+ /* FIXME: Priority = low. The following assumes linear arrays
+ * or Integer range arrays. Fixing it right requires a method to get the
+ * nth element of a multidimensional array.
+ */
+
+ if (at->flags & SLARR_DATA_VALUE_IS_RANGE)
+ {
+	SLindex_Type d = (SLindex_Type) c->next_element_index;
+	data = range_get_data_addr (at, &d);
+ }
+ else
+ data = (VOID_STAR) ((char *)at->data + (c->next_element_index * at->sizeof_type));
+
+ c->next_element_index += 1;
+
+ if ((at->flags & SLARR_DATA_VALUE_IS_POINTER)
+ && (*(VOID_STAR *) data == NULL))
+ {
+	if (-1 == SLang_push_null ())
+	 return -1;
+ }
+ else if (-1 == (*at->cl->cl_apush)(at->data_type, data))
+ return -1;
+
+ /* keep going */
+ return 1;
+}
+
+/* References to array elements */
+typedef struct
+{
+ SLang_Object_Type at;
+ SLang_Object_Type index_objs SLARRAY_MAX_DIMS;
+ unsigned int num_indices;
+}
+Array_Elem_Ref_Type;
+
+static int elem_ref_push_index_objs (Array_Elem_Ref_Type *ert)
+{
+ SLang_Object_Type *o, *omax;
+
+ o = ert->index_objs;
+ omax = o + ert->num_indices;
+
+ while (o < omax)
+ {
+	if (-1 == _pSLpush_slang_obj (o))
+	 return -1;
+	o++;
+ }
+ if (-1 == _pSLpush_slang_obj (&ert->at))
+ return -1;
+
+ return 0;
+}
+
+static int elem_ref_deref_assign (VOID_STAR vdata)
+{
+ Array_Elem_Ref_Type *ert = (Array_Elem_Ref_Type *)vdata;
+
+ if (-1 == elem_ref_push_index_objs (ert))
+ return -1;
+
+ return _pSLarray_aput1 (ert->num_indices);
+}
+
+static int elem_ref_deref (VOID_STAR vdata)
+{
+ Array_Elem_Ref_Type *ert = (Array_Elem_Ref_Type *)vdata;
+
+ if (-1 == elem_ref_push_index_objs (ert))
+ return -1;
+
+ return _pSLarray_aget1 (ert->num_indices);
+}
+
+static void elem_ref_destroy (VOID_STAR vdata)
+{
+ Array_Elem_Ref_Type *ert = (Array_Elem_Ref_Type *)vdata;
+ SLang_Object_Type *o, *omax;
+
+ if (ert->at.o_data_type != 0)
+ SLang_free_object (&ert->at);
+ o = ert->index_objs;
+ omax = o + ert->num_indices;
+ while (o < omax)
+ {
+	if (o->o_data_type != 0)
+	 SLang_free_object (o);
+	o++;
+ }
+}
+
+/* &Ai,...j ==> __args i..j A ARRAY_REF */
+int _pSLarray_push_elem_ref (void)
+{
+ unsigned int num_indices = (unsigned int) (SLang_Num_Function_Args-1);
+ Array_Elem_Ref_Type *ert;
+ SLang_Ref_Type *ref;
+ unsigned int i;
+ int ret;
+
+ if (num_indices > SLARRAY_MAX_DIMS)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Number of dims must be less than %d", 1+SLARRAY_MAX_DIMS);
+	return -1;
+ }
+
+ if (NULL == (ref = _pSLang_new_ref (sizeof (Array_Elem_Ref_Type))))
+ return -1;
+
+ ref->deref = elem_ref_deref;
+ ref->deref_assign = elem_ref_deref_assign;
+ ref->destroy = elem_ref_destroy;
+
+ ert = (Array_Elem_Ref_Type *) ref->data;
+ ert->num_indices = num_indices;
+ if (-1 == SLang_pop (&ert->at))
+ {
+	SLang_free_ref (ref);
+	return -1;
+ }
+
+ i = num_indices;
+ while (i)
+ {
+	i--;
+	if (-1 == SLang_pop (ert->index_objs + i))
+	 {
+	 SLang_free_ref (ref);
+	 return -1;
+	 }
+ }
+ ret = SLang_push_ref (ref);
+ SLang_free_ref (ref);
+ return ret;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slarrfun.c Added

@@ -0,0 +1,2073 @@
+/* Advanced array manipulation routines for S-Lang */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+#if SLANG_HAS_FLOAT
+# include <math.h>
+#endif
+
+#include "slang.h"
+#include "_slang.h"
+
+static unsigned int Inner_Prod_Block_Size = SLANG_INNERPROD_BLOCK_SIZE;
+
+static int next_transposed_index (SLindex_Type *dims, SLindex_Type *max_dims, unsigned int num_dims)
+{
+ int i;
+
+ for (i = 0; i < (int) num_dims; i++)
+ {
+	SLindex_Type dims_i;
+
+	dims_i = dims i + 1;
+	if (dims_i != max_dims i)
+	 {
+	 dims i = dims_i;
+	 return 0;
+	 }
+	dims i = 0;
+ }
+
+ return -1;
+}
+
+/* This is called when at is 2d */
+static SLang_Array_Type *allocate_transposed_array (SLang_Array_Type *at)
+{
+ SLang_Array_Type *bt;
+ int no_init;
+
+ no_init = (0 == (at->flags & SLARR_DATA_VALUE_IS_POINTER));
+ bt = SLang_create_array1 (at->data_type, 0, NULL, at->dims, 2, no_init);
+ if (bt != NULL)
+ {
+	bt->dims1 = at->dims0;
+	bt->dims0 = at->dims1;
+ }
+ return bt;
+}
+
+static int check_for_empty_array (SLCONST char *fun, unsigned int num)
+{
+ if (num)
+ return 0;
+
+ _pSLang_verror (SL_INVALID_PARM, "%s: array is empty", fun);
+ return -1;
+}
+
+/* -------------- FLOAT --------------------- */
+#if SLANG_HAS_FLOAT
+#define GENERIC_TYPE float
+#define TRANSPOSE_2D_ARRAY transpose_floats
+#define GENERIC_TYPE_A float
+#define GENERIC_TYPE_B float
+#define GENERIC_TYPE_C float
+#define INNERPROD_FUNCTION innerprod_float_float
+#if SLANG_HAS_COMPLEX
+# define INNERPROD_COMPLEX_A innerprod_complex_float
+# define INNERPROD_A_COMPLEX innerprod_float_complex
+#endif
+#define SUM_FUNCTION sum_floats
+#define SUMSQ_FUNCTION sumsq_floats
+#define SUM_RESULT_TYPE float
+#define PROD_FUNCTION prod_floats
+#define PROD_RESULT_TYPE float
+#define CUMSUM_FUNCTION cumsum_floats
+#define CUMSUM_RESULT_TYPE float
+#define MIN_FUNCTION min_floats
+#define MINABS_FUNCTION minabs_floats
+#define MAX_FUNCTION max_floats
+#define MAXABS_FUNCTION maxabs_floats
+#define ANY_FUNCTION any_floats
+#define ALL_FUNCTION all_floats
+#define IS_NAN_FUNCTION _pSLmath_isnan
+#define ABS_FUNCTION fabs
+#define WHEREFIRSTMIN_FUNC wherefirstmin_float
+#define WHEREFIRSTMAX_FUNC wherefirstmax_float
+#define WHERELASTMIN_FUNC wherelastmin_float
+#define WHERELASTMAX_FUNC wherelastmax_float
+#include "slarrfun.inc"
+
+/* -------------- DOUBLE --------------------- */
+#define GENERIC_TYPE double
+#define TRANSPOSE_2D_ARRAY transpose_doubles
+#define GENERIC_TYPE_A double
+#define GENERIC_TYPE_B double
+#define GENERIC_TYPE_C double
+#define INNERPROD_FUNCTION innerprod_double_double
+#if SLANG_HAS_COMPLEX
+# define INNERPROD_COMPLEX_A innerprod_complex_double
+# define INNERPROD_A_COMPLEX innerprod_double_complex
+#endif
+#define SUM_FUNCTION sum_doubles
+#define SUMSQ_FUNCTION sumsq_doubles
+#define SUM_RESULT_TYPE double
+#define CUMSUM_FUNCTION cumsum_doubles
+#define CUMSUM_RESULT_TYPE double
+#define PROD_FUNCTION prod_doubles
+#define PROD_RESULT_TYPE double
+#define MIN_FUNCTION min_doubles
+#define MINABS_FUNCTION minabs_doubles
+#define MAX_FUNCTION max_doubles
+#define MAXABS_FUNCTION maxabs_doubles
+#define ANY_FUNCTION any_doubles
+#define ALL_FUNCTION all_doubles
+#define IS_NAN_FUNCTION _pSLmath_isnan
+#define ABS_FUNCTION fabs
+#define WHEREFIRSTMIN_FUNC wherefirstmin_double
+#define WHEREFIRSTMAX_FUNC wherefirstmax_double
+#define WHERELASTMIN_FUNC wherelastmin_double
+#define WHERELASTMAX_FUNC wherelastmax_double
+#include "slarrfun.inc"
+
+#define GENERIC_TYPE_A double
+#define GENERIC_TYPE_B float
+#define GENERIC_TYPE_C double
+#define INNERPROD_FUNCTION innerprod_double_float
+#include "slarrfun.inc"
+
+#define GENERIC_TYPE_A float
+#define GENERIC_TYPE_B double
+#define GENERIC_TYPE_C double
+#define INNERPROD_FUNCTION innerprod_float_double
+#include "slarrfun.inc"
+
+/* Finally pick up the complex_complex multiplication
+ * and do the integers
+ */
+#if SLANG_HAS_COMPLEX
+# define INNERPROD_COMPLEX_COMPLEX innerprod_complex_complex
+#endif
+#endif				 /* SLANG_HAS_FLOAT */
+
+/* -------------- INT --------------------- */
+#define GENERIC_TYPE int
+#define TRANSPOSE_2D_ARRAY transpose_ints
+#define SUM_FUNCTION sum_ints
+#define SUMSQ_FUNCTION sumsq_ints
+#define SUM_RESULT_TYPE double
+#define CUMSUM_FUNCTION cumsum_ints
+#define CUMSUM_RESULT_TYPE double
+#define PROD_FUNCTION prod_ints
+#define PROD_RESULT_TYPE double
+#define MIN_FUNCTION min_ints
+#define MINABS_FUNCTION minabs_ints
+#define MAX_FUNCTION max_ints
+#define MAXABS_FUNCTION maxabs_ints
+#define ANY_FUNCTION any_ints
+#define ALL_FUNCTION all_ints
+#define ABS_FUNCTION abs
+#define WHEREFIRSTMIN_FUNC wherefirstmin_int
+#define WHEREFIRSTMAX_FUNC wherefirstmax_int
+#define WHERELASTMIN_FUNC wherelastmin_int
+#define WHERELASTMAX_FUNC wherelastmax_int
+#include "slarrfun.inc"
+
+/* -------------- UNSIGNED INT --------------------- */
+#define GENERIC_TYPE unsigned int
+#define SUM_FUNCTION sum_uints
+#define SUMSQ_FUNCTION sumsq_uints
+#define SUM_RESULT_TYPE double
+#define MIN_FUNCTION min_uints
+#define MAX_FUNCTION max_uints
+#define ANY_FUNCTION any_uints
+#define ALL_FUNCTION all_uints
+#define WHEREFIRSTMIN_FUNC wherefirstmin_uint
+#define WHEREFIRSTMAX_FUNC wherefirstmax_uint
+#define WHERELASTMIN_FUNC wherelastmin_uint
+#define WHERELASTMAX_FUNC wherelastmax_uint
+#include "slarrfun.inc"
+
+#if SIZEOF_LONG != SIZEOF_INT
+/* -------------- LONG --------------------- */
+# define GENERIC_TYPE long
+# define TRANSPOSE_2D_ARRAY transpose_longs
+# define SUM_FUNCTION sum_longs
+# define SUMSQ_FUNCTION sumsq_longs
+# define SUM_RESULT_TYPE double
+# define PROD_FUNCTION prod_longs
+# define PROD_RESULT_TYPE double
+# define MIN_FUNCTION min_longs
+# define MINABS_FUNCTION minabs_longs
+# define MAX_FUNCTION max_longs
+# define MAXABS_FUNCTION maxabs_longs
+# define ANY_FUNCTION any_longs
+# define ALL_FUNCTION all_longs
+# define ABS_FUNCTION labs
+# define WHEREFIRSTMIN_FUNC wherefirstmin_long
+# define WHEREFIRSTMAX_FUNC wherefirstmax_long
+# define WHERELASTMIN_FUNC wherelastmin_long
+# define WHERELASTMAX_FUNC wherelastmax_long
+# include "slarrfun.inc"
+/* -------------- UNSIGNED LONG --------------------- */
+# define GENERIC_TYPE unsigned long
+# define SUM_FUNCTION sum_ulongs
+# define SUMSQ_FUNCTION sumsq_ulongs
+# define SUM_RESULT_TYPE double
+# define MIN_FUNCTION min_ulongs
+# define MAX_FUNCTION max_ulongs
+# define ANY_FUNCTION any_ulongs
+# define ALL_FUNCTION all_ulongs
+# define WHEREFIRSTMIN_FUNC wherefirstmin_ulong
+# define WHEREFIRSTMAX_FUNC wherefirstmax_ulong
+# define WHERELASTMIN_FUNC wherelastmin_ulong
+# define WHERELASTMAX_FUNC wherelastmax_ulong
+# include "slarrfun.inc"
+#else
+# define transpose_longs transpose_ints
+# define sum_longs sum_ints
+# define sumsq_longs sumsq_ints
+# define sum_ulongs sum_uints
+# define sumsq_ulongs sumsq_uints
+# define prod_longs prod_ints
+# define min_longs min_ints
+# define minabs_longs minabs_ints
+# define min_ulongs min_uints
+# define max_longs max_ints
+# define maxabs_longs maxabs_ints
+# define max_ulongs max_uints
+# define any_longs any_ints
+# define any_ulongs any_uints
+# define all_longs all_ints
+# define all_ulongs all_uints
+# define wherefirstmax_long wherefirstmax_int
+# define wherefirstmin_long wherefirstmin_int
+# define wherelastmin_long wherelastmin_int
+# define wherelastmax_long wherelastmax_int
+# define wherefirstmax_ulong wherefirstmax_uint
+# define wherefirstmin_ulong wherefirstmin_uint
+# define wherelastmin_ulong wherelastmin_uint
+# define wherelastmax_ulong wherelastmax_uint
+#endif
+
+#if SIZEOF_SHORT != SIZEOF_INT
+/* -------------- SHORT --------------------- */
+# define GENERIC_TYPE short
+# define TRANSPOSE_2D_ARRAY transpose_shorts
+# define SUM_FUNCTION sum_shorts
+# define SUMSQ_FUNCTION sumsq_shorts
+# define SUM_RESULT_TYPE double
+# define MIN_FUNCTION min_shorts
+# define MINABS_FUNCTION minabs_shorts
+# define MAX_FUNCTION max_shorts
+# define MAXABS_FUNCTION maxabs_shorts
+# define ANY_FUNCTION any_shorts
+# define ALL_FUNCTION all_shorts
+# define ABS_FUNCTION abs
+# define WHEREFIRSTMIN_FUNC wherefirstmin_short
+# define WHEREFIRSTMAX_FUNC wherefirstmax_short
+# define WHERELASTMIN_FUNC wherelastmin_short
+# define WHERELASTMAX_FUNC wherelastmax_short
+# include "slarrfun.inc"
+/* -------------- UNSIGNED SHORT --------------------- */
+# define GENERIC_TYPE unsigned short
+# define SUM_FUNCTION sum_ushorts
+# define SUMSQ_FUNCTION sumsq_ushorts
+# define SUM_RESULT_TYPE double
+# define MIN_FUNCTION min_ushorts
+# define MAX_FUNCTION max_ushorts
+# define ANY_FUNCTION any_ushorts
+# define ALL_FUNCTION all_ushorts
+# define WHEREFIRSTMIN_FUNC wherefirstmin_ushort
+# define WHEREFIRSTMAX_FUNC wherefirstmax_ushort
+# define WHERELASTMIN_FUNC wherelastmin_ushort
+# define WHERELASTMAX_FUNC wherelastmax_ushort
+# include "slarrfun.inc"
+#else
+# define transpose_shorts transpose_ints
+# define sum_shorts sum_ints
+# define sumsq_shorts sumsq_ints
+# define sum_ushorts sum_uints
+# define sumsq_ushorts sumsq_uints
+# define min_shorts min_ints
+# define minabs_shorts minabs_ints
+# define min_ushorts min_uints
+# define max_shorts max_ints
+# define maxabs_shorts maxabs_ints
+# define max_ushorts max_uints
+# define any_shorts any_ints
+# define any_ushorts any_uints
+# define all_shorts all_ints
+# define all_ushorts all_uints
+# define wherefirstmax_short wherefirstmax_int
+# define wherefirstmin_short wherefirstmin_int
+# define wherelastmin_short wherelastmin_int
+# define wherelastmax_short wherelastmax_int
+# define wherefirstmax_ushort wherefirstmax_uint
+# define wherefirstmin_ushort wherefirstmin_uint
+# define wherelastmin_ushort wherelastmin_uint
+# define wherelastmax_ushort wherelastmax_uint
+#endif
+
+/* -------------- CHAR --------------------- */
+#define GENERIC_TYPE signed char
+#define TRANSPOSE_2D_ARRAY transpose_chars
+#define SUM_FUNCTION sum_chars
+#define SUMSQ_FUNCTION sumsq_chars
+#define SUM_RESULT_TYPE double
+#define MIN_FUNCTION min_chars
+#define MINABS_FUNCTION minabs_chars
+#define MAX_FUNCTION max_chars
+#define MAXABS_FUNCTION maxabs_chars
+#define ANY_FUNCTION any_chars
+#define ALL_FUNCTION all_chars
+#define ABS_FUNCTION abs
+#define WHEREFIRSTMIN_FUNC wherefirstmin_char
+#define WHEREFIRSTMAX_FUNC wherefirstmax_char
+#define WHERELASTMIN_FUNC wherelastmin_char
+#define WHERELASTMAX_FUNC wherelastmax_char
+#include "slarrfun.inc"
+/* -------------- UNSIGNED CHAR --------------------- */
+#define GENERIC_TYPE unsigned char
+#define SUM_FUNCTION sum_uchars
+#define SUMSQ_FUNCTION sumsq_uchars
+#define SUM_RESULT_TYPE double
+#define MIN_FUNCTION min_uchars
+#define MAX_FUNCTION max_uchars
+#define ANY_FUNCTION any_uchars
+#define ALL_FUNCTION all_uchars
+#define WHEREFIRSTMIN_FUNC wherefirstmin_uchar
+#define WHEREFIRSTMAX_FUNC wherefirstmax_uchar
+#define WHERELASTMIN_FUNC wherelastmin_uchar
+#define WHERELASTMAX_FUNC wherelastmax_uchar
+#include "slarrfun.inc"
+
+#ifdef HAVE_LONG_LONG
+# if SIZEOF_LONG != SIZEOF_LONG_LONG
+/* -------------- LONG LONG --------------------- */
+# define GENERIC_TYPE long long
+# define TRANSPOSE_2D_ARRAY transpose_llongs
+# define MIN_FUNCTION min_llongs
+# define MINABS_FUNCTION minabs_llongs
+# define MAX_FUNCTION max_llongs
+# define MAXABS_FUNCTION maxabs_llongs
+# define ANY_FUNCTION any_llongs
+# define ALL_FUNCTION all_llongs
+# define ABS_FUNCTION(x) (((x)>=0)?(x):-(x))
+# define WHEREFIRSTMIN_FUNC wherefirstmin_llong
+# define WHEREFIRSTMAX_FUNC wherefirstmax_llong
+# define WHERELASTMIN_FUNC wherelastmin_llong
+# define WHERELASTMAX_FUNC wherelastmax_llong
+# include "slarrfun.inc"
+/* -------------- UNSIGNED LONG --------------------- */
+# define GENERIC_TYPE unsigned long long
+# define MIN_FUNCTION min_ullongs
+# define MAX_FUNCTION max_ullongs
+# define ANY_FUNCTION any_ullongs
+# define ALL_FUNCTION all_ullongs
+# define WHEREFIRSTMIN_FUNC wherefirstmin_ullong
+# define WHEREFIRSTMAX_FUNC wherefirstmax_ullong
+# define WHERELASTMIN_FUNC wherelastmin_ullong
+# define WHERELASTMAX_FUNC wherelastmax_ullong
+# include "slarrfun.inc"
+# else
+# define transpose_llongs transpose_longs
+# define min_llongs min_longs
+# define minabs_llongs minabs_longs
+# define min_ullongs min_ullongs
+# define max_llongs max_llongs
+# define maxabs_llongs maxabs_llongs
+# define max_ullongs max_ullongs
+# define any_llongs any_llongs
+# define any_ullongs any_ullongs
+# define all_llongs all_llongs
+# define all_ullongs all_ullongs
+# define wherefirstmax_llong wherefirstmax_long
+# define wherefirstmin_llong wherefirstmin_long
+# define wherelastmin_llong wherelastmin_long
+# define wherelastmax_llong wherelastmax_long
+# define wherefirstmax_ullong wherefirstmax_ulong
+# define wherefirstmin_ullong wherefirstmin_ulong
+# define wherelastmin_ullong wherelastmin_ulong
+# define wherelastmax_ullong wherelastmax_ulong
+# endif
+#endif				 /* HAVE_LONG_LONG */
+
+#define GENERIC_TYPE_A signed char
+#define GENERIC_TYPE_B double
+#define DO_WHEREFIRST_OP_FUNC wherefirst_op_char
+#define DO_WHERELAST_OP_FUNC wherelast_op_char
+#include "slarrfun.inc"
+#define GENERIC_TYPE_A unsigned char
+#define GENERIC_TYPE_B double
+#define DO_WHEREFIRST_OP_FUNC wherefirst_op_uchar
+#define DO_WHERELAST_OP_FUNC wherelast_op_uchar
+#include "slarrfun.inc"
+
+#define GENERIC_TYPE_A _pSLint16_Type
+#define GENERIC_TYPE_B double
+#define DO_WHEREFIRST_OP_FUNC wherefirst_op_int16
+#define DO_WHERELAST_OP_FUNC wherelast_op_int16
+#include "slarrfun.inc"
+#define GENERIC_TYPE_A _pSLuint16_Type
+#define GENERIC_TYPE_B double
+#define DO_WHEREFIRST_OP_FUNC wherefirst_op_uint16
+#define DO_WHERELAST_OP_FUNC wherelast_op_uint16
+#include "slarrfun.inc"
+
+#define GENERIC_TYPE_A _pSLint32_Type
+#define GENERIC_TYPE_B double
+#define DO_WHEREFIRST_OP_FUNC wherefirst_op_int32
+#define DO_WHERELAST_OP_FUNC wherelast_op_int32
+#include "slarrfun.inc"
+#define GENERIC_TYPE_A _pSLuint32_Type
+#define GENERIC_TYPE_B double
+#define DO_WHEREFIRST_OP_FUNC wherefirst_op_uint32
+#define DO_WHERELAST_OP_FUNC wherelast_op_uint32
+#include "slarrfun.inc"
+
+#if _pSLANG_INT64_TYPE
+# define GENERIC_TYPE_A _pSLint64_Type
+# define GENERIC_TYPE_B double
+# define DO_WHEREFIRST_OP_FUNC wherefirst_op_int64
+# define DO_WHERELAST_OP_FUNC wherelast_op_int64
+# include "slarrfun.inc"
+# define GENERIC_TYPE_A _pSLuint64_Type
+# define GENERIC_TYPE_B double
+# define DO_WHEREFIRST_OP_FUNC wherefirst_op_uint64
+# define DO_WHERELAST_OP_FUNC wherelast_op_uint64
+# include "slarrfun.inc"
+# define GENERIC_TYPE_A _pSLint64_Type
+# define GENERIC_TYPE_B _pSLint64_Type
+# define DO_WHEREFIRST_OP_FUNC wherefirst_op_int64_alt
+# define DO_WHERELAST_OP_FUNC wherelast_op_int64_alt
+# include "slarrfun.inc"
+# define GENERIC_TYPE_A _pSLuint64_Type
+# define GENERIC_TYPE_B _pSLuint64_Type
+# define DO_WHEREFIRST_OP_FUNC wherefirst_op_uint64_alt
+# define DO_WHERELAST_OP_FUNC wherelast_op_uint64_alt
+# include "slarrfun.inc"
+#endif
+
+#define GENERIC_TYPE_A float
+#define GENERIC_TYPE_B double
+#define DO_WHEREFIRST_OP_FUNC wherefirst_op_float
+#define DO_WHERELAST_OP_FUNC wherelast_op_float
+#include "slarrfun.inc"
+#define GENERIC_TYPE_A double
+#define GENERIC_TYPE_B double
+#define DO_WHEREFIRST_OP_FUNC wherefirst_op_double
+#define DO_WHERELAST_OP_FUNC wherelast_op_double
+#include "slarrfun.inc"
+
+/* This routine works only with linear arrays */
+static SLang_Array_Type *transpose (SLang_Array_Type *at)
+{
+ SLindex_Type dims SLARRAY_MAX_DIMS;
+ SLindex_Type *max_dims;
+ unsigned int num_dims;
+ SLang_Array_Type *bt;
+ int i;
+ size_t sizeof_type;
+ int is_ptr;
+ char *b_data;
+
+ max_dims = at->dims;
+ num_dims = at->num_dims;
+
+ if ((at->num_elements == 0)
+ || (num_dims == 1))
+ {
+	bt = SLang_duplicate_array (at);
+	if (bt == NULL) return NULL;
+	if (num_dims == 1) bt->num_dims = 2;
+	goto transpose_dims;
+ }
+
+ /* For numeric arrays skip the overhead below */
+ if (num_dims == 2)
+ {
+	bt = allocate_transposed_array (at);
+	if (bt == NULL) return NULL;
+
+	switch (at->data_type)
+	 {
+	 case SLANG_INT_TYPE:
+	 case SLANG_UINT_TYPE:
+	 return transpose_ints (at, bt);
+#if SLANG_HAS_FLOAT
+	 case SLANG_DOUBLE_TYPE:
+	 return transpose_doubles (at, bt);
+	 case SLANG_FLOAT_TYPE:
+	 return transpose_floats (at, bt);
+#endif
+	 case SLANG_CHAR_TYPE:
+	 case SLANG_UCHAR_TYPE:
+	 return transpose_chars (at, bt);
+	 case SLANG_LONG_TYPE:
+	 case SLANG_ULONG_TYPE:
+	 return transpose_longs (at, bt);
+	 case SLANG_SHORT_TYPE:
+	 case SLANG_USHORT_TYPE:
+	 return transpose_shorts (at, bt);
+#ifdef HAVE_LONG_LONG
+	 case SLANG_LLONG_TYPE:
+	 case SLANG_ULLONG_TYPE:
+	 return transpose_llongs (at, bt);
+#endif
+	 }
+ }
+ else
+ {
+	bt = SLang_create_array (at->data_type, 0, NULL, max_dims, num_dims);
+	if (bt == NULL) return NULL;
+ }
+
+ sizeof_type = at->sizeof_type;
+ is_ptr = (at->flags & SLARR_DATA_VALUE_IS_POINTER);
+
+ memset ((char *)dims, 0, sizeof(dims));
+
+ b_data = (char *) bt->data;
+
+ do
+ {
+	if (-1 == _pSLarray_aget_transfer_elem (at, dims, (VOID_STAR) b_data,
+					 sizeof_type, is_ptr))
+	 {
+	 SLang_free_array (bt);
+	 return NULL;
+	 }
+	b_data += sizeof_type;
+ }
+ while (0 == next_transposed_index (dims, max_dims, num_dims));
+
+ transpose_dims:
+
+ num_dims = bt->num_dims;
+ for (i = 0; i < (int) num_dims; i++)
+ bt->dimsi = max_dims num_dims - i - 1;
+
+ return bt;
+}
+
+static void array_transpose (SLang_Array_Type *at)
+{
+ if (NULL != (at = transpose (at)))
+ (void) SLang_push_array (at, 1);
+}
+
+#if SLANG_HAS_FLOAT
+static int get_inner_product_parms (SLang_Array_Type *a, int *dp,
+				 SLuindex_Type *loops, SLuindex_Type *other)
+{
+ int num_dims;
+ int d;
+
+ d = *dp;
+
+ num_dims = (int)a->num_dims;
+ if (num_dims == 0)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Inner-product operation requires an array of at least 1 dimension.");
+	return -1;
+ }
+
+ /* An index of -1 refers to last dimension */
+ if (d == -1)
+ d += num_dims;
+ *dp = d;
+
+ if (a->num_elements == 0)
+ {				 /* # ==> */
+	*loops = *other = 0;
+	return 0;
+ }
+
+ *loops = a->num_elements / a->dimsd;
+
+ if (d == 0)
+ {
+	*other = *loops; /* a->num_elements / a->dims0; */
+	return 0;
+ }
+
+ *other = a->dimsd;
+ return 0;
+}
+
+/* This routines takes two arrays A_i..j and B_j..k and produces a third
+ * via C_i..k = A_i..j B_j..k.
+ *
+ * If A is a vector, and B is a 2-d matrix, then regard A as a 2-d matrix
+ * with 1-column.
+ */
+static void do_inner_product (void)
+{
+ SLang_Array_Type *a, *b, *c;
+ void (*fun)(SLang_Array_Type *, SLang_Array_Type *, SLang_Array_Type *,
+	 SLuindex_Type, SLuindex_Type, SLuindex_Type, SLuindex_Type,
+	 SLuindex_Type);
+ SLtype c_type;
+ SLindex_Type dimsSLARRAY_MAX_DIMS;
+ int status;
+ SLuindex_Type a_loops, b_loops, b_inc, a_stride;
+ int ai_dims, i, j;
+ SLuindex_Type num_dims, a_num_dims, b_num_dims;
+ int ai, bi;
+
+ /* The result of a inner_product will be either a float, double, or
+ * a complex number.
+ *
+ * If an integer array is used, it will be promoted to a float.
+ */
+
+ switch (SLang_peek_at_stack1 ())
+ {
+ case SLANG_DOUBLE_TYPE:
+	if (-1 == SLang_pop_array_of_type (&b, SLANG_DOUBLE_TYPE))
+	 return;
+	break;
+
+#if SLANG_HAS_COMPLEX
+ case SLANG_COMPLEX_TYPE:
+	if (-1 == SLang_pop_array_of_type (&b, SLANG_COMPLEX_TYPE))
+	 return;
+	break;
+#endif
+ case SLANG_FLOAT_TYPE:
+ default:
+	if (-1 == SLang_pop_array_of_type (&b, SLANG_FLOAT_TYPE))
+	 return;
+	break;
+ }
+
+ switch (SLang_peek_at_stack1 ())
+ {
+ case SLANG_DOUBLE_TYPE:
+	status = SLang_pop_array_of_type (&a, SLANG_DOUBLE_TYPE);
+	break;
+
+#if SLANG_HAS_COMPLEX
+ case SLANG_COMPLEX_TYPE:
+	status = SLang_pop_array_of_type (&a, SLANG_COMPLEX_TYPE);
+	break;
+#endif
+ case SLANG_FLOAT_TYPE:
+ default:
+	status = SLang_pop_array_of_type (&a, SLANG_FLOAT_TYPE);
+	break;
+ }
+
+ if (status == -1)
+ {
+	SLang_free_array (b);
+	return;
+ }
+
+ ai = -1;			 /* last index of a */
+ bi = 0;			 /* first index of b */
+ if ((-1 == get_inner_product_parms (a, &ai, &a_loops, &a_stride))
+ || (-1 == get_inner_product_parms (b, &bi, &b_loops, &b_inc)))
+ {
+	_pSLang_verror (SL_TYPE_MISMATCH, "Array dimensions are not compatible for inner-product");
+	goto free_and_return;
+ }
+
+ a_num_dims = a->num_dims;
+ b_num_dims = b->num_dims;
+
+ /* Coerse a 1-d vector to 2-d */
+ if ((a_num_dims == 1)
+ && (b_num_dims == 2)
+ && (a->num_elements))
+ {
+	a_num_dims = 2;
+	ai = 1;
+	a_loops = a->num_elements;
+	a_stride = 1;
+ }
+
+ if ((ai_dims = a->dimsai) != b->dimsbi)
+ {
+	_pSLang_verror (SL_TYPE_MISMATCH, "Array dimensions are not compatible for inner-product");
+	goto free_and_return;
+ }
+
+ num_dims = a_num_dims + b_num_dims - 2;
+ if (num_dims > SLARRAY_MAX_DIMS)
+ {
+	_pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "Inner-product result exceeds maximum allowed dimensions");
+	goto free_and_return;
+ }
+
+ if (num_dims)
+ {
+	j = 0;
+	for (i = 0; i < (int)a_num_dims; i++)
+	 if (i != ai) dims j++ = a->dimsi;
+	for (i = 0; i < (int)b_num_dims; i++)
+	 if (i != bi) dims j++ = b->dimsi;
+ }
+ else
+ {
+	/* a scalar */
+	num_dims = 1;
+	dims0 = 1;
+ }
+
+ c_type = 0; fun = NULL;
+ switch (a->data_type)
+ {
+ case SLANG_FLOAT_TYPE:
+	switch (b->data_type)
+	 {
+	 case SLANG_FLOAT_TYPE:
+	 c_type = SLANG_FLOAT_TYPE;
+	 fun = innerprod_float_float;
+	 break;
+	 case SLANG_DOUBLE_TYPE:
+	 c_type = SLANG_DOUBLE_TYPE;
+	 fun = innerprod_float_double;
+	 break;
+#if SLANG_HAS_COMPLEX
+	 case SLANG_COMPLEX_TYPE:
+	 c_type = SLANG_COMPLEX_TYPE;
+	 fun = innerprod_float_complex;
+	 break;
+#endif
+	 }
+	break;
+ case SLANG_DOUBLE_TYPE:
+	switch (b->data_type)
+	 {
+	 case SLANG_FLOAT_TYPE:
+	 c_type = SLANG_DOUBLE_TYPE;
+	 fun = innerprod_double_float;
+	 break;
+	 case SLANG_DOUBLE_TYPE:
+	 c_type = SLANG_DOUBLE_TYPE;
+	 fun = innerprod_double_double;
+	 break;
+#if SLANG_HAS_COMPLEX
+	 case SLANG_COMPLEX_TYPE:
+	 c_type = SLANG_COMPLEX_TYPE;
+	 fun = innerprod_double_complex;
+	 break;
+#endif
+	 }
+	break;
+#if SLANG_HAS_COMPLEX
+ case SLANG_COMPLEX_TYPE:
+	c_type = SLANG_COMPLEX_TYPE;
+	switch (b->data_type)
+	 {
+	 case SLANG_FLOAT_TYPE:
+	 fun = innerprod_complex_float;
+	 break;
+	 case SLANG_DOUBLE_TYPE:
+	 fun = innerprod_complex_double;
+	 break;
+	 case SLANG_COMPLEX_TYPE:
+	 fun = innerprod_complex_complex;
+	 break;
+	 }
+	break;
+#endif
+ default:
+	break;
+ }
+
+ if (NULL == (c = SLang_create_array (c_type, 0, NULL, dims, num_dims)))
+ goto free_and_return;
+
+ (*fun)(a, b, c, a_loops, a_stride, b_loops, b_inc, ai_dims);
+
+ (void) SLang_push_array (c, 1);
+ /* drop */
+
+ free_and_return:
+ SLang_free_array (a);
+ SLang_free_array (b);
+}
+#endif
+
+static int map_or_contract_array (SLCONST SLarray_Map_Type *c, int use_contraction,
+				 int dim_specified, int *use_this_dim,
+				 VOID_STAR clientdata)
+{
+ int k, use_all_dims;
+ SLang_Array_Type *at, *new_at;
+ SLindex_Type *old_dims;
+ SLindex_Type old_dims_bufSLARRAY_MAX_DIMS;
+ SLindex_Type sub_dimsSLARRAY_MAX_DIMS;
+ SLindex_Type tmp_dimsSLARRAY_MAX_DIMS;
+ unsigned int i, j, old_num_dims, sub_num_dims;
+ SLtype new_data_type, old_data_type;
+ char *old_data, *new_data;
+ SLindex_Type wSLARRAY_MAX_DIMS, wk;
+ size_t old_sizeof_type, new_sizeof_type;
+ SLuindex_Type dims_k;
+ int from_type;
+ SLCONST SLarray_Map_Type *csave;
+ SLarray_Map_Fun_Type *fmap;
+ SLarray_Contract_Fun_Type *fcon;
+
+ use_all_dims = 1;
+ k = 0;
+ if (dim_specified)
+ {
+	if (use_this_dim != NULL)
+	 {
+	 k = *use_this_dim;
+	 use_all_dims = 0;
+	 }
+ }
+ else if (SLang_Num_Function_Args == 2)
+ {
+	if (-1 == SLang_pop_integer (&k))
+	 return -1;
+
+	use_all_dims = 0;
+ }
+
+ if (-1 == (from_type = SLang_peek_at_stack1 ()))
+ return -1;
+
+ csave = c;
+ while (c->f != NULL)
+ {
+	if (c->from_type == (SLtype) from_type)
+	 break;
+	c++;
+ }
+
+ /* Look for a more generic version */
+ if (c->f != NULL)
+ {
+	if (-1 == SLang_pop_array_of_type (&at, c->typecast_to_type))
+	 return -1;
+ }
+ else
+ {
+	/* Look for a wildcard match */
+	c = csave;
+	while (c->f != NULL)
+	 {
+	 if (c->from_type == SLANG_VOID_TYPE)
+	 break;
+	 c++;
+	 }
+	if (c->f == NULL)
+	 {
+	 _pSLang_verror (SL_TYPE_MISMATCH, "%s is not supported by this function", SLclass_get_datatype_name (from_type));
+	 return -1;
+	 }
+
+	/* Found it. So, typecast it to appropriate type */
+	if (c->typecast_to_type == SLANG_VOID_TYPE)
+	 {
+	 if (-1 == SLang_pop_array (&at, 1))
+	 return -1;
+	 }
+	else if (-1 == SLang_pop_array_of_type (&at, c->typecast_to_type))
+	 return -1;
+ }
+
+ old_data_type = at->data_type;
+ if (SLANG_VOID_TYPE == (new_data_type = c->result_type))
+ new_data_type = old_data_type;
+
+ old_num_dims = at->num_dims;
+
+ if (use_all_dims == 0)
+ {
+	if (k < 0)
+	 k += old_num_dims;
+
+	if ((k < 0) || (k >= (int)old_num_dims))
+	 {
+	 _pSLang_verror (SL_INVALID_PARM, "Dimension %d is invalid for a %d-d array",
+			 k, old_num_dims);
+	 SLang_free_array (at);
+	 return -1;
+	 }
+	old_dims = at->dims;
+ }
+ else
+ {
+	old_dims = old_dims_buf;
+	old_dims0 = (SLindex_Type)at->num_elements;
+	old_num_dims = 1;
+ }
+
+ fcon = (SLarray_Contract_Fun_Type *) c->f;
+ fmap = c->f;
+
+ if (use_contraction
+ && (use_all_dims || (old_num_dims == 1)))
+ {
+	SLang_Class_Type *cl;
+	VOID_STAR buf;
+	int status = 0;
+
+	cl = _pSLclass_get_class (new_data_type);
+	buf = cl->cl_transfer_buf;
+	if (at->num_elements == 0)
+	 {
+	 /* If there are no elements, the fcon may or may not
+	 * compute a value. So, clear the buffer
+	 */
+	 memset ((char *)buf, 0, cl->cl_sizeof_type);
+	 }
+
+	if ((-1 == (*fcon) (at->data, 1, at->num_elements, buf))
+	 || (-1 == SLang_push_value (new_data_type, buf)))
+	 status = -1;
+
+	SLang_free_array (at);
+	return status;
+ }
+
+ /* The offset for the index i_0,i_1,...i_{N-1} is
+ * i_0*W_0 + i_1*W_1 + ... i_{N-1}*W{N-1}
+ * where W_j = d_{j+1}d_{j+2}...d_{N-1}
+ * and d_k is the number of elements of the kth dimension.
+ *
+ * For a specified value of k, we
+ * So, summing over all elements in the kth dimension of the array
+ * means using the set of offsets given by
+ *
+ * i_k*W_k + sum(j!=k) i_j*W_j.
+ *
+ * So, we want to loop of all dimensions except for the kth using an
+ * offset given by sum(j!=k)i_jW_j, and an increment W_k between elements.
+ */
+
+ wk = 1;
+ i = old_num_dims;
+ while (i != 0)
+ {
+	i--;
+	wi = wk;
+	wk *= old_dimsi;
+ }
+ wk = wk;
+
+ /* Now set up the sub array */
+ j = 0;
+ for (i = 0; i < old_num_dims; i++)
+ {
+	if (i == (unsigned int) k)
+	 continue;
+
+	sub_dimsj = old_dimsi;
+	wj = wi;
+	tmp_dimsj = 0;
+	j++;
+ }
+ sub_num_dims = old_num_dims - 1;
+
+ if (use_contraction)
+ new_at = SLang_create_array1 (new_data_type, 0, NULL, sub_dims, sub_num_dims, 1);
+ else
+ new_at = SLang_create_array1 (new_data_type, 0, NULL, old_dims, old_num_dims, 1);
+
+ if (new_at == NULL)
+ {
+	SLang_free_array (at);
+	return -1;
+ }
+
+ new_data = (char *)new_at->data;
+ old_data = (char *)at->data;
+ old_sizeof_type = at->sizeof_type;
+ new_sizeof_type = new_at->sizeof_type;
+ dims_k = old_dimsk * wk;
+
+ /* Skip this for cases such as sum(Double_Type0,0, 1). Otherwise,
+ * (*fcon) will write to new_data, which has no length
+ */
+ if (new_at->num_elements) do
+ {
+	size_t offset = 0;
+	int status;
+
+	for (i = 0; i < sub_num_dims; i++)
+	 offset += wi * tmp_dimsi;
+
+	if (use_contraction)
+	 {
+	 status = (*fcon) ((VOID_STAR)(old_data + offset*old_sizeof_type), wk,
+			 dims_k, (VOID_STAR) new_data);
+	 new_data += new_sizeof_type;
+	 }
+	else
+	 {
+	 status = (*fmap) (old_data_type, (VOID_STAR) (old_data + offset*old_sizeof_type),
+			 wk, dims_k,
+			 new_data_type, (VOID_STAR) (new_data + offset*new_sizeof_type),
+			 clientdata);
+	 }
+
+	if (status == -1)
+	 {
+	 SLang_free_array (new_at);
+	 SLang_free_array (at);
+	 return -1;
+	 }
+ }
+ while (-1 != _pSLarray_next_index (tmp_dims, sub_dims, sub_num_dims));
+
+ SLang_free_array (at);
+ return SLang_push_array (new_at, 1);
+}
+
+int SLarray_map_array (SLCONST SLarray_Map_Type *m)
+{
+ return map_or_contract_array (m, 0, 0, NULL, NULL);
+}
+
+int SLarray_map_array_1 (SLCONST SLarray_Map_Type *m, int *use_this_dim,
+			 VOID_STAR clientdata)
+{
+ return map_or_contract_array (m, 0, 1, use_this_dim, clientdata);
+}
+
+int SLarray_contract_array (SLCONST SLarray_Contract_Type *c)
+{
+ return map_or_contract_array ((SLarray_Map_Type *)c, 1, 0, NULL, NULL);
+}
+
+#if SLANG_HAS_COMPLEX
+static int sum_complex (VOID_STAR zp, unsigned int inc, unsigned int num, VOID_STAR sp)
+{
+ double *z, *zmax;
+ double sr, si, sr_err, si_err;
+ double *s;
+
+ z = (double *)zp;
+ zmax = z + 2*num;
+ inc *= 2;
+ sr = si = sr_err = si_err = 0.0;
+ while (z < zmax)
+ {
+	double v, new_s;
+
+	v = z0;
+	new_s = sr + v;
+	sr_err += v - (new_s-sr);
+	sr = new_s;
+
+	v = z1;
+	new_s = si + v;
+	si_err += v - (new_s-si);
+	si = new_s;
+
+	z += inc;
+ }
+ s = (double *)sp;
+ s0 = sr + sr_err;
+ s1 = si + si_err;
+ return 0;
+}
+
+static int sumsq_complex (VOID_STAR zp, unsigned int inc, unsigned int num, VOID_STAR sp)
+{
+ double *z, *zmax;
+ double s, serr;
+
+ z = (double *)zp;
+ zmax = z + 2*num;
+ inc *= 2;
+ s = 0.0; serr = 0.0;
+ while (z < zmax)
+ {
+	double v = z0*z0 + z1*z1;
+	double new_s = s + v;
+	serr += v - (new_s-s);
+	s = new_s;
+	z += inc;
+ }
+ *(double *)sp = s+serr;
+ return 0;
+}
+
+static int cumsum_complex (SLtype xtype, VOID_STAR xp, unsigned int inc,
+			 unsigned int num,
+			 SLtype ytype, VOID_STAR yp, VOID_STAR clientdata)
+{
+ double *z, *zmax;
+ double cr, ci, cr_err, ci_err;
+ double *s;
+
+ (void) xtype; (void) ytype; (void) clientdata;
+ z = (double *)xp;
+ zmax = z + 2*num;
+ s = (double *)yp;
+ inc *= 2;
+ cr = ci = cr_err = ci_err = 0.0;
+ while (z < zmax)
+ {
+	double v, c1;
+	v = z0;
+	c1 = cr + v;
+	cr_err += v - (c1 - cr);
+	cr = c1;
+	s0 = cr + cr_err;
+
+	v = z1;
+	c1 = ci + v;
+	ci_err += v - (c1 - ci);
+	ci = c1;
+	s1 = ci + ci_err;
+
+	z += inc;
+	s += inc;
+ }
+ return 0;
+}
+
+static int prod_complex (VOID_STAR zp, unsigned int inc, unsigned int num, VOID_STAR sp)
+{
+ double *z, *zmax;
+ double sr, si;
+ double *s;
+
+ z = (double *)zp;
+ zmax = z + 2*num;
+ inc *= 2;
+ sr = 1.0; si = 0.0;
+ while (z < zmax)
+ {
+	double a = sr, b = si;
+	double c = z0, d = z1;
+	sr = (a*c-b*d);
+	si = (b*c+a*d);
+	z += inc;
+ }
+ s = (double *)sp;
+ s0 = sr;
+ s1 = si;
+ return 0;
+}
+
+#endif
+#if SLANG_HAS_FLOAT
+static SLCONST SLarray_Contract_Type Sum_Functions =
+{
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sum_doubles},
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) sum_floats},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sum_ints},
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sum_chars},
+ {SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sum_uchars},
+ {SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sum_shorts},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sum_ushorts},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sum_uints},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sum_longs},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sum_ulongs},
+#if SLANG_HAS_COMPLEX
+ {SLANG_COMPLEX_TYPE, SLANG_COMPLEX_TYPE, SLANG_COMPLEX_TYPE, (SLarray_Contract_Fun_Type *) sum_complex},
+#endif
+ {0, 0, 0, NULL}
+};
+
+static void array_sum (void)
+{
+ (void) SLarray_contract_array (Sum_Functions);
+}
+
+static SLCONST SLarray_Contract_Type Sumsq_Functions =
+{
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sumsq_doubles},
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) sumsq_floats},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sumsq_ints},
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sumsq_chars},
+ {SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sumsq_uchars},
+ {SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sumsq_shorts},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sumsq_ushorts},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sumsq_uints},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sumsq_longs},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sumsq_ulongs},
+#if SLANG_HAS_COMPLEX
+ {SLANG_COMPLEX_TYPE, SLANG_COMPLEX_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) sumsq_complex},
+#endif
+ {0, 0, 0, NULL}
+};
+
+static void array_sumsq (void)
+{
+ (void) SLarray_contract_array (Sumsq_Functions);
+}
+
+static SLCONST SLarray_Contract_Type Prod_Functions =
+{
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) prod_doubles},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) prod_ints},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) prod_longs},
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) prod_floats},
+ {SLANG_UINT_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) prod_doubles},
+ {SLANG_ULONG_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) prod_doubles},
+ {SLANG_CHAR_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) prod_floats},
+ {SLANG_UCHAR_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) prod_floats},
+ {SLANG_SHORT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) prod_floats},
+ {SLANG_USHORT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) prod_floats},
+ {SLANG_VOID_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) prod_doubles},
+#if SLANG_HAS_COMPLEX
+ {SLANG_COMPLEX_TYPE, SLANG_COMPLEX_TYPE, SLANG_COMPLEX_TYPE, (SLarray_Contract_Fun_Type *) prod_complex},
+#endif
+ {0, 0, 0, NULL}
+};
+
+static void array_prod (void)
+{
+ (void) SLarray_contract_array (Prod_Functions);
+}
+#endif
+
+static SLCONST SLarray_Contract_Type Array_Min_Funs =
+{
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) min_chars},
+ {SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, (SLarray_Contract_Fun_Type *) min_uchars},
+ {SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, (SLarray_Contract_Fun_Type *) min_shorts},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, (SLarray_Contract_Fun_Type *) min_ushorts},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_INT_TYPE, (SLarray_Contract_Fun_Type *) min_ints},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_UINT_TYPE, (SLarray_Contract_Fun_Type *) min_uints},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_LONG_TYPE, (SLarray_Contract_Fun_Type *) min_longs},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, (SLarray_Contract_Fun_Type *) min_ulongs},
+#if defined(HAVE_LONG_LONG) && (SIZEOF_LONG_LONG != SIZEOF_LONG)
+ {SLANG_LLONG_TYPE, SLANG_LLONG_TYPE, SLANG_LLONG_TYPE, (SLarray_Contract_Fun_Type *) min_llongs},
+ {SLANG_ULLONG_TYPE, SLANG_ULLONG_TYPE, SLANG_ULLONG_TYPE, (SLarray_Contract_Fun_Type *) min_ullongs},
+#endif
+#if SLANG_HAS_FLOAT
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) min_floats},
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) min_doubles},
+#endif
+ {0, 0, 0, NULL}
+};
+
+static void
+array_min (void)
+{
+ (void) SLarray_contract_array (Array_Min_Funs);
+}
+
+static SLCONST SLarray_Contract_Type Array_Max_Funs =
+{
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) max_chars},
+ {SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, (SLarray_Contract_Fun_Type *) max_uchars},
+ {SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, (SLarray_Contract_Fun_Type *) max_shorts},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, (SLarray_Contract_Fun_Type *) max_ushorts},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_INT_TYPE, (SLarray_Contract_Fun_Type *) max_ints},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_UINT_TYPE, (SLarray_Contract_Fun_Type *) max_uints},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_LONG_TYPE, (SLarray_Contract_Fun_Type *) max_longs},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, (SLarray_Contract_Fun_Type *) max_ulongs},
+#if defined(HAVE_LONG_LONG) && (SIZEOF_LONG_LONG != SIZEOF_LONG)
+ {SLANG_LLONG_TYPE, SLANG_LLONG_TYPE, SLANG_LLONG_TYPE, (SLarray_Contract_Fun_Type *) max_llongs},
+ {SLANG_ULLONG_TYPE, SLANG_ULLONG_TYPE, SLANG_ULLONG_TYPE, (SLarray_Contract_Fun_Type *) max_ullongs},
+#endif
+#if SLANG_HAS_FLOAT
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) max_floats},
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) max_doubles},
+#endif
+ {0, 0, 0, NULL}
+};
+
+static void
+array_max (void)
+{
+ (void) SLarray_contract_array (Array_Max_Funs);
+}
+
+/* The wherexxx function do not support the optional dim argument */
+#define DO_WHEREXXX_YYY(what, tbl) \
+ if (SLang_Num_Function_Args != 1) \
+ _pSLang_verror (SL_USAGE_ERROR, "Usage: idx = %s(array)", what); \
+ else \
+ (void) SLarray_contract_array (tbl);
+
+static SLCONST SLarray_Contract_Type Array_WhereFirstMin_Funs =
+{
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmin_char},
+ {SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmin_uchar},
+ {SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmin_short},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmin_ushort},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmin_int},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmin_uint},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmin_long},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmin_ulong},
+#if defined(HAVE_LONG_LONG) && (SIZEOF_LONG_LONG != SIZEOF_LONG)
+ {SLANG_LLONG_TYPE, SLANG_LLONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmin_llong},
+ {SLANG_ULLONG_TYPE, SLANG_ULLONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmin_ullong},
+#endif
+#if SLANG_HAS_FLOAT
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmin_float},
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmin_double},
+#endif
+ {0, 0, 0, NULL}
+};
+
+static void
+array_wherefirstmin (void)
+{
+ DO_WHEREXXX_YYY("wherefirstmin", Array_WhereFirstMin_Funs);
+}
+
+static SLCONST SLarray_Contract_Type Array_WhereFirstMax_Funs =
+{
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmax_char},
+ {SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmax_uchar},
+ {SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmax_short},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmax_ushort},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmax_int},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmax_uint},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmax_long},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmax_ulong},
+#if defined(HAVE_LONG_LONG) && (SIZEOF_LONG_LONG != SIZEOF_LONG)
+ {SLANG_LLONG_TYPE, SLANG_LLONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmax_llong},
+ {SLANG_ULLONG_TYPE, SLANG_ULLONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmax_ullong},
+#endif
+#if SLANG_HAS_FLOAT
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmax_float},
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherefirstmax_double},
+#endif
+ {0, 0, 0, NULL}
+};
+
+static void
+array_wherefirstmax (void)
+{
+ DO_WHEREXXX_YYY ("wherefirstmax", Array_WhereFirstMax_Funs);
+}
+
+static SLCONST SLarray_Contract_Type Array_WhereLastMin_Funs =
+{
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmin_char},
+ {SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmin_uchar},
+ {SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmin_short},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmin_ushort},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmin_int},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmin_uint},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmin_long},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmin_ulong},
+#if defined(HAVE_LONG_LONG) && (SIZEOF_LONG_LONG != SIZEOF_LONG)
+ {SLANG_LLONG_TYPE, SLANG_LLONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmin_llong},
+ {SLANG_ULLONG_TYPE, SLANG_ULLONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmin_ullong},
+#endif
+#if SLANG_HAS_FLOAT
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmin_float},
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmin_double},
+#endif
+ {0, 0, 0, NULL}
+};
+
+static void
+array_wherelastmin (void)
+{
+ DO_WHEREXXX_YYY ("wherelastmin", Array_WhereLastMin_Funs);
+}
+
+static SLCONST SLarray_Contract_Type Array_WhereLastMax_Funs =
+{
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmax_char},
+ {SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmax_uchar},
+ {SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmax_short},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmax_ushort},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmax_int},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmax_uint},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmax_long},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmax_ulong},
+#if defined(HAVE_LONG_LONG) && (SIZEOF_LONG_LONG != SIZEOF_LONG)
+ {SLANG_LLONG_TYPE, SLANG_LLONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmax_llong},
+ {SLANG_ULLONG_TYPE, SLANG_ULLONG_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmax_ullong},
+#endif
+#if SLANG_HAS_FLOAT
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmax_float},
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_ARRAY_INDEX_TYPE, (SLarray_Contract_Fun_Type *) wherelastmax_double},
+#endif
+ {0, 0, 0, NULL}
+};
+
+static void
+array_wherelastmax (void)
+{
+ DO_WHEREXXX_YYY ("wherelastmax", Array_WhereLastMax_Funs);
+}
+
+
+static SLCONST SLarray_Contract_Type Array_Maxabs_Funs =
+{
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) maxabs_chars},
+ {SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, (SLarray_Contract_Fun_Type *) max_uchars},
+ {SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, (SLarray_Contract_Fun_Type *) maxabs_shorts},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, (SLarray_Contract_Fun_Type *) max_ushorts},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_INT_TYPE, (SLarray_Contract_Fun_Type *) maxabs_ints},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_UINT_TYPE, (SLarray_Contract_Fun_Type *) max_uints},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_LONG_TYPE, (SLarray_Contract_Fun_Type *) maxabs_longs},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, (SLarray_Contract_Fun_Type *) max_ulongs},
+#if defined(HAVE_LONG_LONG) && (SIZEOF_LONG_LONG != SIZEOF_LONG)
+ {SLANG_LLONG_TYPE, SLANG_LLONG_TYPE, SLANG_LLONG_TYPE, (SLarray_Contract_Fun_Type *) maxabs_llongs},
+ {SLANG_ULLONG_TYPE, SLANG_ULLONG_TYPE, SLANG_ULLONG_TYPE, (SLarray_Contract_Fun_Type *) max_ullongs},
+#endif
+#if SLANG_HAS_FLOAT
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) maxabs_floats},
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) maxabs_doubles},
+#endif
+ {0, 0, 0, NULL}
+};
+
+static void
+array_maxabs (void)
+{
+ (void) SLarray_contract_array (Array_Maxabs_Funs);
+}
+
+static SLCONST SLarray_Contract_Type Array_Minabs_Funs =
+{
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) minabs_chars},
+ {SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, (SLarray_Contract_Fun_Type *) min_uchars},
+ {SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, (SLarray_Contract_Fun_Type *) minabs_shorts},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, (SLarray_Contract_Fun_Type *) min_ushorts},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_INT_TYPE, (SLarray_Contract_Fun_Type *) minabs_ints},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_UINT_TYPE, (SLarray_Contract_Fun_Type *) min_uints},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_LONG_TYPE, (SLarray_Contract_Fun_Type *) minabs_longs},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, (SLarray_Contract_Fun_Type *) min_ulongs},
+#if defined(HAVE_LONG_LONG) && (SIZEOF_LONG_LONG != SIZEOF_LONG)
+ {SLANG_LLONG_TYPE, SLANG_LLONG_TYPE, SLANG_LLONG_TYPE, (SLarray_Contract_Fun_Type *) minabs_llongs},
+ {SLANG_ULLONG_TYPE, SLANG_ULLONG_TYPE, SLANG_ULLONG_TYPE, (SLarray_Contract_Fun_Type *) min_ullongs},
+#endif
+#if SLANG_HAS_FLOAT
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Contract_Fun_Type *) minabs_floats},
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Contract_Fun_Type *) minabs_doubles},
+#endif
+ {0, 0, 0, NULL}
+};
+
+static void
+array_minabs (void)
+{
+ (void) SLarray_contract_array (Array_Minabs_Funs);
+}
+
+static SLCONST SLarray_Map_Type CumSum_Functions =
+{
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Map_Fun_Type *) cumsum_doubles},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Map_Fun_Type *) cumsum_ints},
+ {SLANG_LONG_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Map_Fun_Type *) cumsum_doubles},
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Map_Fun_Type *) cumsum_floats},
+ {SLANG_UINT_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Map_Fun_Type *) cumsum_doubles},
+ {SLANG_ULONG_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Map_Fun_Type *) cumsum_doubles},
+ {SLANG_CHAR_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Map_Fun_Type *) cumsum_floats},
+ {SLANG_UCHAR_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Map_Fun_Type *) cumsum_floats},
+ {SLANG_SHORT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Map_Fun_Type *) cumsum_floats},
+ {SLANG_USHORT_TYPE, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, (SLarray_Map_Fun_Type *) cumsum_floats},
+ {SLANG_VOID_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, (SLarray_Map_Fun_Type *) cumsum_doubles},
+#if SLANG_HAS_COMPLEX
+ {SLANG_COMPLEX_TYPE, SLANG_COMPLEX_TYPE, SLANG_COMPLEX_TYPE, (SLarray_Map_Fun_Type *) cumsum_complex},
+#endif
+ {0, 0, 0, NULL}
+};
+
+static void array_cumsum (void)
+{
+ (void) SLarray_map_array (CumSum_Functions);
+}
+
+static int pop_writable_array (SLang_Array_Type **atp)
+{
+ SLang_Array_Type *at;
+
+ if (-1 == SLang_pop_array (&at, 0))
+ return -1;
+
+ if (at->flags & SLARR_DATA_VALUE_IS_READ_ONLY)
+ {
+	SLang_set_error (SL_ReadOnly_Error);
+	SLang_free_array (at);
+	return -1;
+ }
+
+ *atp = at;
+ return 0;
+}
+
+static int check_range_index (int len, int *ip)
+{
+ int i = *ip;
+ if (i < 0)
+ i += len;
+
+ if ((i < 0) || (i >= len))
+ {
+	SLang_set_error (SL_Index_Error);
+	return -1;
+ }
+ *ip = i;
+ return 0;
+}
+
+static int check_range_indices (int len, int *ip, int *jp)
+{
+ int i = *ip, j = *jp;
+
+ if ((-1 == check_range_index (len, &i))
+ || (-1 == check_range_index (len, &j)))
+ return -1;
+
+ if (i > j)
+ {
+	int t = i; i = j; j = t;
+ }
+ *ip = i;
+ *jp = j;
+ return 0;
+}
+
+/* Usage: array_swap (a, i, j ,dim); (dim not yet supported) */
+static void array_swap (void)
+{
+ int i, j;
+ int len;
+ unsigned char *src, *dst;
+ size_t sizeof_type;
+ int dim, have_dim;
+ SLang_Array_Type *at;
+#if 0
+ SLindex_Type dimsSLARRAY_MAX_DIMS;
+#endif
+ have_dim = 0;
+ if (SLang_Num_Function_Args == 4)
+ {
+	if (-1 == SLang_pop_integer (&dim))
+	 return;
+	have_dim = 1;
+ }
+
+ if ((-1 == SLang_pop_integer (&j))
+ || (-1 == SLang_pop_integer (&i)))
+ return;
+
+ if (i == j)
+ return;			 /* leave array on stack */
+
+ if (-1 == pop_writable_array (&at))
+ return;
+
+ if (have_dim)
+ {
+	if (-1 == check_range_index (at->num_dims, &dim))
+	 {
+	 SLang_free_array (at);
+	 return;
+	 }
+	len = at->dims dim;
+ }
+ else len = (int) at->num_elements;
+
+ if (-1 == check_range_indices (len, &i, &j))
+ {
+	SLang_free_array (at);
+	return;
+ }
+
+ sizeof_type = at->cl->cl_sizeof_type;
+ if (have_dim == 0)
+ {
+	unsigned int k;
+
+	src = (unsigned char *)at->data + j*sizeof_type;
+	dst = (unsigned char *)at->data + i*sizeof_type;
+
+	for (k = 0; k < sizeof_type; k++)
+	 {
+	 unsigned char tmp = srck;
+	 srck = dstk;
+	 dstk = tmp;
+	 }
+	SLang_free_array (at);
+	return;
+ }
+
+ _pSLang_verror (SL_NOT_IMPLEMENTED, "dim not implemented");
+#if 0
+ /* Otherwise we have perform this swap:
+ *
+ * A*,..,i,*,... <--> A*,...,j,*...
+ *
+ * Consider 2x2:
+ * a00 a01 a02 ...
+ * A = a10 a11 a12 ...
+ * a20 a21 a22 ...
+ * .
+ *
+ * Suppose we swap A1,* <--> A2,*. We want:
+ *
+ * a00 a01 a02 ...
+ * A' = a20 a21 a22 ...
+ * a10 a11 a12 ...
+ * .
+ *
+ * Similarly, swapping A*,1 <--> A*,2:
+ *
+ * a00 a02 a01 ...
+ * A = a10 a12 a11 ...
+ * a20 a22 a21 ...
+ * .
+ */
+
+ memset ((char *) dims, 0, sizeof (dims));
+ max_dims = at->dims;
+ dimsdim = i;
+ src_ptr = (unsigned char *)at->data;
+ ofs = 1;
+ for (d = swap_dim + 1; d < max_dims; d++)
+ {
+	ofs = ofs * max_dimsd;
+ }
+ src_ptr = (unsigned char *)at->data + i * ofs;
+ dst_ptr = (unsigned char *)at->data + j * ofs;
+
+ for (d = swap_dim; d < max_dims; d++)
+ {
+	stride =
+	 while (1)
+	 {
+	 int d;
+	 unsigned char *src_ptr;
+	 for (d = num_dims-1; d >= 0; d--)
+		 {
+		 SLindex_Type dims_d;
+		 if (d == swap_dim)
+		 {
+			 src_ptr += sizeof_slice;
+			 continue;
+		 }
+		 XXXXXXXXXXXX all wrong.
+		 dims_d = dimsd + 1;
+		 if (dims_d != (int) max_dimsd)
+		 break;
+		 dimsd = 0;
+		 src_ptr += sizeof_type;
+		 }
+	 if (d == -1)
+		 break;
+	 stride = 1;
+	 k = 0;
+	 while (k < dim)
+		 stride *= at->dimsk;
+
+	 k = dim + 1;
+
+	 src = (unsigned char *)at->data + j*sizeof_type;
+	 dst = (unsigned char *)at->data + i*sizeof_type;
+	 }
+ }
+#endif
+}
+
+/* Usage: array_reverse (a, ,from, to ,dim) */
+static void array_reverse (void)
+{
+ int len;
+ unsigned char *src, *dst;
+ size_t sizeof_type;
+ int dim = 0;
+ /* int has_dim = 0; */
+ int from = 0;
+ int to = -1;
+ int nargs;
+
+ SLang_Array_Type *at;
+
+ nargs = SLang_Num_Function_Args;
+ if ((nargs == 2) || (nargs == 4))
+ {
+	/* FIXME!!! */
+	/* has_dim = 1; */
+	if (-1 == SLang_pop_integer (&dim))
+	 return;
+	_pSLang_verror (SL_NotImplemented_Error, "dim argument not yet implemented");
+	return;
+ }
+
+ if (nargs >= 3)
+ {
+	if ((-1 == SLang_pop_integer (&to))
+	 || (-1 == SLang_pop_integer (&from)))
+	 return;
+ }
+
+ if ((from == to)
+ || (SLang_peek_at_stack () != SLANG_ARRAY_TYPE))
+ {
+	(void) SLdo_pop ();	 /* do nothing */
+	return;
+ }
+
+ if (-1 == pop_writable_array (&at))
+ return;
+
+ len = (int) at->num_elements;
+ if (len == 0)
+ {				 /* nothing to reverse */
+	SLang_free_array (at);
+	return;
+ }
+
+ if (-1 == check_range_indices (len, &from, &to))
+ {
+	SLang_free_array (at);
+	return;
+ }
+
+ sizeof_type = at->cl->cl_sizeof_type;
+
+ src = (unsigned char *)at->data + from*sizeof_type;
+ dst = (unsigned char *)at->data + to*sizeof_type;
+ while (src < dst)
+ {
+	unsigned int k;
+
+	for (k = 0; k < sizeof_type; k++)
+	 {
+	 unsigned char tmp = srck;
+	 srck = dstk;
+	 dstk = tmp;
+	 }
+
+	src += sizeof_type;
+	dst -= sizeof_type;
+ }
+ SLang_free_array (at);
+}
+
+static SLCONST SLarray_Contract_Type Array_Any_Funs =
+{
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) any_chars},
+ {SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) any_uchars},
+ {SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) any_shorts},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) any_ushorts},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) any_ints},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) any_uints},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) any_longs},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) any_ulongs},
+#if defined(HAVE_LONG_LONG) && (SIZEOF_LONG_LONG != SIZEOF_LONG)
+ {SLANG_LLONG_TYPE, SLANG_LLONG_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) any_llongs},
+ {SLANG_ULLONG_TYPE, SLANG_ULLONG_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) any_ullongs},
+#endif
+#if SLANG_HAS_FLOAT
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) any_floats},
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) any_doubles},
+#endif
+ {0, 0, 0, NULL}
+};
+
+static void
+array_any (void)
+{
+ (void) SLarray_contract_array (Array_Any_Funs);
+}
+
+static SLCONST SLarray_Contract_Type Array_All_Funs =
+{
+ {SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) all_chars},
+ {SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) all_uchars},
+ {SLANG_SHORT_TYPE, SLANG_SHORT_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) all_shorts},
+ {SLANG_USHORT_TYPE, SLANG_USHORT_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) all_ushorts},
+ {SLANG_INT_TYPE, SLANG_INT_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) all_ints},
+ {SLANG_UINT_TYPE, SLANG_UINT_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) all_uints},
+ {SLANG_LONG_TYPE, SLANG_LONG_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) all_longs},
+ {SLANG_ULONG_TYPE, SLANG_ULONG_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) all_ulongs},
+#if defined(HAVE_LONG_LONG) && (SIZEOF_LONG_LONG != SIZEOF_LONG)
+ {SLANG_LLONG_TYPE, SLANG_LLONG_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) all_llongs},
+ {SLANG_ULLONG_TYPE, SLANG_ULLONG_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) all_ullongs},
+#endif
+#if SLANG_HAS_FLOAT
+ {SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) all_floats},
+ {SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE, SLANG_CHAR_TYPE, (SLarray_Contract_Fun_Type *) all_doubles},
+#endif
+ {0, 0, 0, NULL}
+};
+
+static void
+array_all (void)
+{
+ (void) SLarray_contract_array (Array_All_Funs);
+}
+
+static int get_innerprod_block_size (void)
+{
+ return (int) Inner_Prod_Block_Size;
+}
+
+static void set_innerprod_block_size (int *sp)
+{
+ int s = *sp;
+ if (s <= 0)
+ s = SLANG_INNERPROD_BLOCK_SIZE;
+
+ Inner_Prod_Block_Size = (unsigned int) s;
+}
+
+static int do_wherefirstlast_op (const char *fname, int is_first, int op)
+{
+ SLindex_Type istart;
+ SLang_Array_Type *at;
+ SLindex_Type num;
+ int use_double, type, status;
+ double b;
+
+ istart = (is_first ? 0 : -1);
+
+ switch (SLang_Num_Function_Args)
+ {
+ case 3:
+	if (-1 == SLang_pop_array_index (&istart))
+	 return -1;
+	/* drop */
+ case 2:
+	if (-1 == SLstack_exch (0, 1))
+	 return -1;
+	break;
+
+ default:
+	_pSLang_verror (SL_Usage_Error, "Usage: i = %s (array, double ,istart", fname);
+	return -1;
+ }
+
+ if (-1 == SLang_pop_array (&at, 1))
+ return -1;
+
+ status = -1;
+
+ num = at->num_elements;
+ if (istart < 0)
+ istart += num;
+ if (istart < 0)
+ {
+	if (num == 0)
+	 istart = 0;
+	else
+	 {
+	 SLang_set_error (SL_Index_Error);
+	 goto free_and_return;
+	 }
+ }
+ else if (istart > num)
+ istart = num;
+
+ use_double = 1;
+ type = at->data_type;
+
+#if _pSLANG_INT64_TYPE
+ if ((type == _pSLANG_INT64_TYPE) || (type == _pSLANG_UINT64_TYPE))
+ {
+	int type1;
+	if (-1 == (type1 = SLang_peek_at_stack ()))
+	 goto free_and_return;
+
+	/* Use the following as a proxy for determining an integral type */
+	use_double = (0 == SLang_get_int_size ((SLtype) type1));
+ }
+#endif
+
+ if (use_double
+ && (-1 == SLang_pop_double (&b)))
+ goto free_and_return;
+
+ switch (type)
+ {
+ case SLANG_CHAR_TYPE:
+	if (is_first)
+	 status = wherefirst_op_char (at, op, b, istart);
+	else
+	 status = wherelast_op_char (at, op, b, istart);
+	break;
+
+ case SLANG_UCHAR_TYPE:
+	if (is_first)
+	 status = wherefirst_op_uchar (at, op, b, istart);
+	else
+	 status = wherelast_op_uchar (at, op, b, istart);
+	break;
+
+ case _pSLANG_INT16_TYPE:
+	if (is_first)
+	 status = wherefirst_op_int16 (at, op, b, istart);
+	else
+	 status = wherelast_op_int16 (at, op, b, istart);
+	break;
+
+ case _pSLANG_UINT16_TYPE:
+	if (is_first)
+	 status = wherefirst_op_uint16 (at, op, b, istart);
+	else
+	 status = wherelast_op_uint16 (at, op, b, istart);
+	break;
+
+ case _pSLANG_INT32_TYPE:
+	if (is_first)
+	 status = wherefirst_op_int32 (at, op, b, istart);
+	else
+	 status = wherelast_op_int32 (at, op, b, istart);
+	break;
+
+ case _pSLANG_UINT32_TYPE:
+	if (is_first)
+	 status = wherefirst_op_uint32 (at, op, b, istart);
+	else
+	 status = wherelast_op_uint32 (at, op, b, istart);
+	break;
+
+#if _pSLANG_INT64_TYPE
+ case _pSLANG_INT64_TYPE:
+	if (use_double)
+	 {
+	 if (is_first)
+	 status = wherefirst_op_int64 (at, op, b, istart);
+	 else
+	 status = wherelast_op_int64 (at, op, b, istart);
+	 }
+	else
+	 {
+	 _pSLint64_Type b64;
+	 if (-1 == (status = _pSLang_pop_int64 (&b64)))
+	 break;
+	 if (is_first)
+	 status = wherefirst_op_int64_alt (at, op, b64, istart);
+	 else
+	 status = wherelast_op_int64_alt (at, op, b64, istart);
+	 }
+	break;
+
+ case _pSLANG_UINT64_TYPE:
+	if (use_double)
+	 {
+	 if (is_first)
+	 status = wherefirst_op_uint64 (at, op, b, istart);
+	 else
+	 status = wherelast_op_uint64 (at, op, b, istart);
+	 }
+	else
+	 {
+	 _pSLuint64_Type b64;
+	 if (-1 == (status = _pSLang_pop_uint64 (&b64)))
+	 break;
+	 if (is_first)
+	 status = wherefirst_op_uint64_alt (at, op, b64, istart);
+	 else
+	 status = wherelast_op_uint64_alt (at, op, b64, istart);
+	 }
+	break;
+#endif				 /* _pSLANG_INT64_TYPE */
+
+ case SLANG_FLOAT_TYPE:
+	if (is_first)
+	 status = wherefirst_op_float (at, op, b, istart);
+	else
+	 status = wherelast_op_float (at, op, b, istart);
+	break;
+
+ case SLANG_DOUBLE_TYPE:
+	if (is_first)
+	 status = wherefirst_op_double (at, op, b, istart);
+	else
+	 status = wherelast_op_double (at, op, b, istart);
+	break;
+
+ default:
+	SLang_verror (SL_NotImplemented_Error, "%s: support for arrays of type %s is not available",
+		 fname, SLclass_get_datatype_name (type));
+	goto free_and_return;
+ }
+
+free_and_return:
+
+ SLang_free_array (at);
+ return status;
+}
+
+
+static void wherefirsteq(void) {(void) do_wherefirstlast_op ("wherefirsteq", 1, SLANG_EQ);}
+static void wherefirstne(void) {(void) do_wherefirstlast_op ("wherefirstne", 1, SLANG_NE);}
+static void wherefirstlt(void) {(void) do_wherefirstlast_op ("wherefirstlt", 1, SLANG_LT);}
+static void wherefirstgt(void) {(void) do_wherefirstlast_op ("wherefirstgt", 1, SLANG_GT);}
+static void wherefirstle(void) {(void) do_wherefirstlast_op ("wherefirstle", 1, SLANG_LE);}
+static void wherefirstge(void) {(void) do_wherefirstlast_op ("wherefirstge", 1, SLANG_GE);}
+
+static void wherelasteq(void) {(void) do_wherefirstlast_op ("wherelasteq", 0, SLANG_EQ);}
+static void wherelastne(void) {(void) do_wherefirstlast_op ("wherelastne", 0, SLANG_NE);}
+static void wherelastlt(void) {(void) do_wherefirstlast_op ("wherelastlt", 0, SLANG_LT);}
+static void wherelastgt(void) {(void) do_wherefirstlast_op ("wherelastgt", 0, SLANG_GT);}
+static void wherelastle(void) {(void) do_wherefirstlast_op ("wherelastle", 0, SLANG_LE);}
+static void wherelastge(void) {(void) do_wherefirstlast_op ("wherelastge", 0, SLANG_GE);}
+
+static SLang_Intrin_Fun_Type Array_Fun_Table =
+{
+ MAKE_INTRINSIC_1("transpose", array_transpose, SLANG_VOID_TYPE, SLANG_ARRAY_TYPE),
+#if SLANG_HAS_FLOAT
+ MAKE_INTRINSIC_0("prod", array_prod, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("sum", array_sum, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("sumsq", array_sumsq, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("cumsum", array_cumsum, SLANG_VOID_TYPE),
+#endif
+ MAKE_INTRINSIC_0("array_swap", array_swap, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("array_reverse", array_reverse, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("min", array_min, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("max", array_max, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("maxabs", array_maxabs, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("minabs", array_minabs, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("any", array_any, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("all", array_all, SLANG_VOID_TYPE),
+
+ MAKE_INTRINSIC_0("wherefirstmin", array_wherefirstmin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherefirstmax", array_wherefirstmax, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherelastmin", array_wherelastmin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherelastmax", array_wherelastmax, SLANG_VOID_TYPE),
+
+ MAKE_INTRINSIC_0("wherefirst_eq", wherefirsteq, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherefirst_ne", wherefirstne, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherefirst_gt", wherefirstgt, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherefirst_lt", wherefirstlt, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherefirst_ge", wherefirstge, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherefirst_le", wherefirstle, SLANG_VOID_TYPE),
+
+ MAKE_INTRINSIC_0("wherelast_eq", wherelasteq, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherelast_ne", wherelastne, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherelast_gt", wherelastgt, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherelast_lt", wherelastlt, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherelast_ge", wherelastge, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wherelast_le", wherelastle, SLANG_VOID_TYPE),
+
+ MAKE_INTRINSIC_0("__get_innerprod_block_size", get_innerprod_block_size, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_I("__set_innerprod_block_size", set_innerprod_block_size, SLANG_VOID_TYPE),
+
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+int SLang_init_array (void)
+{
+ if (-1 == SLadd_intrin_fun_table (Array_Fun_Table, "__SLARRAY__"))
+ return -1;
+#if SLANG_HAS_FLOAT
+ _pSLang_Matrix_Multiply = do_inner_product;
+#endif
+ return 0;
+}
+
+int SLang_init_array_extra (void)
+{
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slarrfun.inc Added

@@ -0,0 +1,876 @@
+/* -*- mode: C -*- */
+
+/* Some "inline" functions for generic scalar types */
+
+#if SLANG_HAS_FLOAT
+# ifndef IS_INFINITY
+# ifdef HAVE_INF
+# define IS_INFINITY(x) isinf(x)
+# else
+# define IS_INFINITY(x) _pSLmath_isinf(x)
+# endif
+# endif
+#endif
+
+#ifdef TRANSPOSE_2D_ARRAY
+static SLang_Array_Type *TRANSPOSE_2D_ARRAY (SLang_Array_Type *at, SLang_Array_Type *bt)
+{
+ GENERIC_TYPE *a_data, *b_data;
+ SLindex_Type nr, nc, i;
+
+ nr = at->dims0;
+ nc = at->dims1;
+
+ a_data = (GENERIC_TYPE *) at->data;
+ b_data = (GENERIC_TYPE *) bt->data;
+
+ for (i = 0; i < nr; i++)
+ {
+	GENERIC_TYPE *offset = b_data + i;
+	int j;
+	for (j = 0; j < nc; j++)
+	 {
+	 *offset = *a_data++;
+	 offset += nr;
+	 }
+ }
+ return bt;
+}
+#undef TRANSPOSE_2D_ARRAY
+#endif
+
+#ifdef INNERPROD_FUNCTION
+
+static void INNERPROD_FUNCTION
+ (SLang_Array_Type *at, SLang_Array_Type *bt, SLang_Array_Type *ct,
+ SLuindex_Type a_loops, SLuindex_Type a_stride,
+ SLuindex_Type b_loops, SLuindex_Type b_inc,
+ SLuindex_Type inner_loops)
+{
+ GENERIC_TYPE_A *a;
+ GENERIC_TYPE_B *b;
+ GENERIC_TYPE_C *c;
+ SLuindex_Type kmin;
+ SLuindex_Type block = Inner_Prod_Block_Size;
+
+ block *= sizeof (double)/sizeof(GENERIC_TYPE_B);
+
+ c = (GENERIC_TYPE_C *) ct->data;
+ b = (GENERIC_TYPE_B *) bt->data;
+ a = (GENERIC_TYPE_A *) at->data;
+#if 1
+ for (kmin = 0; kmin < inner_loops; kmin += block)
+ {
+	SLuindex_Type jmin;
+	SLuindex_Type kmax = kmin + block;
+	if (kmax > inner_loops) kmax = inner_loops;
+
+	for (jmin = 0; jmin < b_loops; jmin += block)
+	 {
+	 SLuindex_Type i;
+	 SLuindex_Type jmax = jmin + block;
+	 if (jmax > b_loops) jmax = b_loops;
+
+	 for (i = 0; i < a_loops; i++)
+	 {
+		 GENERIC_TYPE_A *aa = a + i * a_stride;
+		 GENERIC_TYPE_C *cc = c + i * b_loops;
+		 SLuindex_Type k;
+
+		 for (k = kmin; k < kmax; k++)
+		 {
+		 double x = (double) aak;
+
+		 if (x != 0.0)
+			 {
+			 SLuindex_Type j;
+			 GENERIC_TYPE_B *bb = b + b_inc*k;
+
+			 j = jmin;
+			 if (j + 8 < jmax)
+			 {
+				 SLuindex_Type jmax1 = jmax - 8;
+				 while (j < jmax1)
+				 {
+				 ccj += x * bbj; j++;
+				 ccj += x * bbj; j++;
+				 ccj += x * bbj; j++;
+				 ccj += x * bbj; j++;
+				 ccj += x * bbj; j++;
+				 ccj += x * bbj; j++;
+				 ccj += x * bbj; j++;
+				 ccj += x * bbj; j++;
+				 }
+			 }
+			 while (j < jmax)
+			 {
+				 ccj += x * bbj; j++;
+			 }
+			 }
+		 }
+	 }
+	 }
+ }
+#else
+ while (a_loops--)
+ {
+	GENERIC_TYPE_B *bb;
+	SLuindex_Type j;
+
+	bb = b;
+
+	for (j = 0; j < inner_loops; j++)
+	 {
+	 double x = (double) aj;
+
+	 if (x != 0.0)
+	 {
+		 SLuindex_Type k;
+
+		 for (k = 0; k < b_loops; k++)
+		 ck += x * bbk;
+	 }
+	 bb += b_inc;
+	 }
+	c += b_loops;
+	a += a_stride;
+ }
+#endif
+}
+#undef INNERPROD_FUNCTION
+
+#undef GENERIC_TYPE_A
+#undef GENERIC_TYPE_B
+#undef GENERIC_TYPE_C
+#endif
+
+#ifdef INNERPROD_COMPLEX_A
+static void INNERPROD_COMPLEX_A
+ (SLang_Array_Type *at, SLang_Array_Type *bt, SLang_Array_Type *ct,
+ SLuindex_Type a_loops, SLuindex_Type a_stride,
+ SLuindex_Type b_loops, SLuindex_Type b_inc,
+ SLuindex_Type inner_loops)
+{
+ double *a;
+ GENERIC_TYPE *b;
+ double *c;
+
+ c = (double *) ct->data;
+ b = (GENERIC_TYPE *) bt->data;
+ a = (double *) at->data;
+
+ a_stride *= 2;
+
+ while (a_loops--)
+ {
+	GENERIC_TYPE *bb;
+	SLuindex_Type bb_loops;
+
+	bb = b;
+	bb_loops = b_loops;
+
+	while (bb_loops--)
+	 {
+	 double real_sum;
+	 double imag_sum;
+	 SLuindex_Type iloops;
+	 double *aa;
+	 GENERIC_TYPE *bbb;
+
+	 aa = a;
+	 bbb = bb;
+	 iloops = inner_loops;
+
+	 real_sum = 0.0;
+	 imag_sum = 0.0;
+	 while (iloops--)
+	 {
+		 real_sum += aa0 * (double)bbb0;
+		 imag_sum += aa1 * (double)bbb0;
+		 aa += 2;
+		 bbb += b_inc;
+	 }
+
+	 *c++ = real_sum;
+	 *c++ = imag_sum;
+	 bb++;
+	 }
+
+	a += a_stride;
+ }
+}
+
+static void INNERPROD_A_COMPLEX
+ (SLang_Array_Type *at, SLang_Array_Type *bt, SLang_Array_Type *ct,
+ SLuindex_Type a_loops, SLuindex_Type a_stride,
+ SLuindex_Type b_loops, SLuindex_Type b_inc,
+ SLuindex_Type inner_loops)
+{
+ GENERIC_TYPE *a;
+ double *b;
+ double *c;
+
+ c = (double *) ct->data;
+ b = (double *) bt->data;
+ a = (GENERIC_TYPE *) at->data;
+
+ b_inc *= 2;
+
+ while (a_loops--)
+ {
+	double *bb;
+	SLuindex_Type bb_loops;
+
+	bb = b;
+	bb_loops = b_loops;
+
+	while (bb_loops--)
+	 {
+	 double real_sum;
+	 double imag_sum;
+	 SLuindex_Type iloops;
+	 GENERIC_TYPE *aa;
+	 double *bbb;
+
+	 aa = a;
+	 bbb = bb;
+	 iloops = inner_loops;
+
+	 real_sum = 0.0;
+	 imag_sum = 0.0;
+	 while (iloops--)
+	 {
+		 real_sum += (double)aa0 * bbb0;
+		 imag_sum += (double)aa0 * bbb1;
+		 aa += 1;
+		 bbb += b_inc;
+	 }
+
+	 *c++ = real_sum;
+	 *c++ = imag_sum;
+	 bb += 2;
+	 }
+
+	a += a_stride;
+ }
+}
+
+#undef INNERPROD_A_COMPLEX
+#undef INNERPROD_COMPLEX_A
+#endif				 /* INNERPROD_COMPLEX_A */
+
+#ifdef INNERPROD_COMPLEX_COMPLEX
+static void INNERPROD_COMPLEX_COMPLEX
+ (SLang_Array_Type *at, SLang_Array_Type *bt, SLang_Array_Type *ct,
+ SLuindex_Type a_loops, SLuindex_Type a_stride,
+ SLuindex_Type b_loops, SLuindex_Type b_inc,
+ SLuindex_Type inner_loops)
+{
+ double *a;
+ double *b;
+ double *c;
+
+ c = (double *) ct->data;
+ b = (double *) bt->data;
+ a = (double *) at->data;
+
+ a_stride *= 2;
+ b_inc *= 2;
+
+ while (a_loops--)
+ {
+	double *bb;
+	SLuindex_Type bb_loops;
+
+	bb = b;
+	bb_loops = b_loops;
+
+	while (bb_loops--)
+	 {
+	 double real_sum;
+	 double imag_sum;
+	 SLuindex_Type iloops;
+	 double *aa;
+	 double *bbb;
+
+	 aa = a;
+	 bbb = bb;
+	 iloops = inner_loops;
+
+	 real_sum = 0.0;
+	 imag_sum = 0.0;
+	 while (iloops--)
+	 {
+		 real_sum += aa0*bbb0 - aa1*bbb1;
+		 imag_sum += aa0*bbb1 + aa1*bbb0;
+		 aa += 2;
+		 bbb += b_inc;
+	 }
+
+	 *c++ = real_sum;
+	 *c++ = imag_sum;
+	 bb += 2;
+	 }
+
+	a += a_stride;
+ }
+}
+#undef INNERPROD_COMPLEX_COMPLEX
+#endif
+
+#ifdef SUM_FUNCTION
+#if SLANG_HAS_FLOAT
+static int SUM_FUNCTION (VOID_STAR xp, SLuindex_Type inc, SLuindex_Type num, VOID_STAR yp)
+{
+ GENERIC_TYPE *x, *xmax;
+ double sum, sumerr;
+
+ x = (GENERIC_TYPE *) xp;
+ xmax = x + num;
+
+ sumerr = 0.0;
+ sum = 0.0;
+ while (x < xmax)
+ {
+	double v = *x - sumerr;
+	double new_sum = sum + v;
+	sumerr = (new_sum - sum) - v;
+	sum = new_sum;
+	x += inc;
+ }
+ *(SUM_RESULT_TYPE *)yp = (SUM_RESULT_TYPE) sum;
+ return 0;
+}
+#endif				 /* SLANG_HAS_FLOAT */
+#undef SUM_FUNCTION
+#endif
+
+#ifdef SUMSQ_FUNCTION
+#if SLANG_HAS_FLOAT
+static int SUMSQ_FUNCTION (VOID_STAR xp, SLuindex_Type inc, SLuindex_Type num, VOID_STAR yp)
+{
+ GENERIC_TYPE *x, *xmax;
+ double sum, sumerr;
+
+ sum = 0.0;
+ sumerr = 0.0;
+
+ x = (GENERIC_TYPE *) xp;
+ xmax = x + num;
+ while (x < xmax)
+ {
+	double v = (double)(*x) * (double)(*x) - sumerr;
+	double new_sum = sum + v;
+	sumerr = (new_sum - sum) - v;
+	sum = new_sum;
+	x += inc;
+ }
+ *(SUM_RESULT_TYPE *)yp = (SUM_RESULT_TYPE) sum;
+ return 0;
+}
+#endif				 /* SLANG_HAS_FLOAT */
+#undef SUMSQ_FUNCTION
+#endif
+#undef SUM_RESULT_TYPE
+
+#ifdef MIN_FUNCTION
+static int
+MIN_FUNCTION (VOID_STAR ip, SLuindex_Type inc, SLuindex_Type num, VOID_STAR sp)
+{
+ SLuindex_Type n, n0;
+ GENERIC_TYPE m;
+ GENERIC_TYPE *i = (GENERIC_TYPE *)ip;
+
+ if (-1 == check_for_empty_array ("min", num))
+ return -1;
+
+# ifdef IS_NAN_FUNCTION
+ n0 = 0;
+ do
+ {
+	m = in0;
+	n0 += inc;
+ }
+ while (IS_NAN_FUNCTION(m) && (n0 < num));
+# else
+ m = i0;
+ n0 = inc;
+# endif
+
+ for (n = n0; n < num; n += inc)
+ if (m > in) m = in;
+
+ *(GENERIC_TYPE *)sp = m;
+ return 0;
+}
+#undef MIN_FUNCTION
+#endif
+
+#ifdef MINABS_FUNCTION
+static int
+MINABS_FUNCTION (VOID_STAR ip, SLuindex_Type inc, SLuindex_Type num, VOID_STAR sp)
+{
+ SLuindex_Type n, n0;
+ GENERIC_TYPE m;
+ GENERIC_TYPE *i = (GENERIC_TYPE *)ip;
+
+ if (-1 == check_for_empty_array ("minabs", num))
+ return -1;
+
+# ifdef IS_NAN_FUNCTION
+ n0 = 0;
+ do
+ {
+	m = ABS_FUNCTION(in0);
+	n0 += inc;
+ }
+ while (IS_NAN_FUNCTION(m) && (n0 < num));
+# else
+ m = ABS_FUNCTION(i0);
+ n0 = inc;
+# endif
+
+ for (n = n0; n < num; n += inc)
+ if (m > ABS_FUNCTION(in)) m = ABS_FUNCTION(in);
+
+ *(GENERIC_TYPE *)sp = m;
+ return 0;
+}
+#undef MINABS_FUNCTION
+#endif
+
+#ifdef MAX_FUNCTION
+static int
+MAX_FUNCTION (VOID_STAR ip, SLuindex_Type inc, SLuindex_Type num, VOID_STAR s)
+{
+ SLuindex_Type n, n0;
+ GENERIC_TYPE m;
+ GENERIC_TYPE *i = (GENERIC_TYPE *) ip;
+
+ if (-1 == check_for_empty_array ("max", num))
+ return -1;
+
+# ifdef IS_NAN_FUNCTION
+ n0 = 0;
+ do
+ {
+	m = in0;
+	n0 += inc;
+ }
+ while (IS_NAN_FUNCTION(m) && (n0 < num));
+# else
+ m = i0;
+ n0 = inc;
+# endif
+
+ for (n = n0; n < num; n += inc)
+ if (m < in) m = in;
+
+ *(GENERIC_TYPE *)s = m;
+ return 0;
+}
+#undef MAX_FUNCTION
+#endif
+
+#ifdef MAXABS_FUNCTION
+static int
+MAXABS_FUNCTION (VOID_STAR ip, SLuindex_Type inc, SLuindex_Type num, VOID_STAR s)
+{
+ SLuindex_Type n, n0;
+ GENERIC_TYPE m;
+ GENERIC_TYPE *i = (GENERIC_TYPE *) ip;
+
+ if (-1 == check_for_empty_array ("maxabs", num))
+ return -1;
+
+# ifdef IS_NAN_FUNCTION
+ n0 = 0;
+ do
+ {
+	m = ABS_FUNCTION(in0);
+	n0 += inc;
+ }
+ while (IS_NAN_FUNCTION(m) && (n0 < num));
+# else
+ m = ABS_FUNCTION(i0);
+ n0 = inc;
+# endif
+
+ for (n = n0; n < num; n += inc)
+ if (m < ABS_FUNCTION(in)) m = ABS_FUNCTION(in);
+
+ *(GENERIC_TYPE *)s = m;
+ return 0;
+}
+#undef MAXABS_FUNCTION
+#endif
+
+#ifdef ANY_FUNCTION
+static int
+ANY_FUNCTION (VOID_STAR ip, SLuindex_Type inc, SLuindex_Type num, VOID_STAR s)
+{
+ SLuindex_Type n;
+ GENERIC_TYPE *i = (GENERIC_TYPE *) ip;
+
+ for (n = 0; n < num; n += inc)
+ if (in != 0)
+ {
+#ifdef IS_NAN_FUNCTION
+	 if (IS_NAN_FUNCTION(in))
+	 continue;
+#endif
+	 *(char *)s = 1;
+	 return 0;
+ }
+
+ *(char *)s = 0;
+ return 0;
+}
+#undef ANY_FUNCTION
+#endif
+
+#ifdef ALL_FUNCTION
+static int
+ALL_FUNCTION (VOID_STAR ip, SLuindex_Type inc, SLuindex_Type num, VOID_STAR s)
+{
+ SLuindex_Type n;
+ GENERIC_TYPE *i = (GENERIC_TYPE *) ip;
+
+ if (num == 0)
+ {
+	*(char *)s = 0;
+	return 0;
+ }
+ for (n = 0; n < num; n += inc)
+ {
+	if (in == (GENERIC_TYPE)0)
+	 {
+	 *(char *)s = 0;
+	 return 0;
+	 }
+#ifdef IS_NAN_FUNCTION
+	/* I really do not want to call this for all numbers, nor do I know
+	 * what makes most sense. Doing nothing means that all(_NaN) is 1.
+	 * Such an interpretation is consistent with using
+	 * length(x) == length(where (x))
+	 */
+#endif
+ }
+
+ *(char *)s = 1;
+ return 0;
+}
+#undef ALL_FUNCTION
+#endif
+
+#ifdef CUMSUM_FUNCTION
+#ifdef SLANG_HAS_FLOAT
+static int
+CUMSUM_FUNCTION (SLtype xtype, VOID_STAR xp, SLuindex_Type inc,
+		 SLuindex_Type num,
+		 SLtype ytype, VOID_STAR yp, VOID_STAR clientdata)
+{
+ GENERIC_TYPE *x, *xmax;
+ CUMSUM_RESULT_TYPE *y;
+ double c;
+ double cerr;
+
+ (void) xtype;
+ (void) ytype;
+ (void) clientdata;
+
+ x = (GENERIC_TYPE *) xp;
+ y = (CUMSUM_RESULT_TYPE *) yp;
+ xmax = x + num;
+
+ c = 0.0;
+ cerr = 0.0;
+ while (x < xmax)
+ {
+	double d = (double) *x - cerr;
+	double c1 = c + d;
+	cerr = (c1 - c) - d;
+	c = c1;
+	*y = (CUMSUM_RESULT_TYPE) c;
+	x += inc;
+	y += inc;
+ }
+ return 0;
+}
+#endif				 /* SLANG_HAS_FLOAT */
+#undef CUMSUM_FUNCTION
+#undef CUMSUM_RESULT_TYPE
+#endif
+
+#ifdef PROD_FUNCTION
+#if SLANG_HAS_FLOAT
+static int PROD_FUNCTION (VOID_STAR xp, SLuindex_Type inc, SLuindex_Type num, VOID_STAR yp)
+{
+ GENERIC_TYPE *x, *xmax;
+ double prod;
+
+ prod = 1.0;
+
+ x = (GENERIC_TYPE *) xp;
+ xmax = x + num;
+ while (x < xmax)
+ {
+	prod *= (double) *x;
+	x += inc;
+ }
+ *(PROD_RESULT_TYPE *)yp = (PROD_RESULT_TYPE) (prod);
+ return 0;
+}
+#endif				 /* SLANG_HAS_FLOAT */
+#undef PROD_FUNCTION
+#undef PROD_RESULT_TYPE
+#endif
+
+#ifdef WHEREFIRSTMAX_FUNC
+static int WHEREFIRSTMAX_FUNC (VOID_STAR xp, SLuindex_Type inc, SLuindex_Type num, VOID_STAR yp)
+{
+ GENERIC_TYPE *x;
+ SLuindex_Type i, imax;
+ GENERIC_TYPE maxval;
+
+ if (-1 == check_for_empty_array ("wherefirstmax", num))
+ return -1;
+
+ x = (GENERIC_TYPE *) xp;
+
+# ifdef IS_NAN_FUNCTION
+ i = 0;
+ do
+ {
+	maxval = xi;
+	imax = i;
+	i += inc;
+ }
+ while (IS_NAN_FUNCTION(maxval) && (i < num));
+# else
+ maxval = x0;
+ imax = 0;
+# endif
+
+ for (i = imax+inc; i < num; i += inc)
+ {
+	if (maxval < xi)
+	 {
+	 imax = i;
+	 maxval = xi;
+	 }
+ }
+ *(SLuindex_Type *)yp = imax;
+ return 0;
+}
+# undef WHEREFIRSTMAX_FUNC
+#endif
+
+#ifdef WHERELASTMAX_FUNC
+static int WHERELASTMAX_FUNC (VOID_STAR xp, SLuindex_Type inc, SLuindex_Type num, VOID_STAR yp)
+{
+ GENERIC_TYPE *x;
+ SLuindex_Type i, imax;
+ GENERIC_TYPE maxval;
+
+ if (-1 == check_for_empty_array ("wherelastmax", num))
+ return -1;
+
+ x = (GENERIC_TYPE *) xp;
+
+# ifdef IS_NAN_FUNCTION
+ i = 0;
+ do
+ {
+	maxval = xi;
+	imax = i;
+	i += inc;
+ }
+ while (IS_NAN_FUNCTION(maxval) && (i < num));
+# else
+ maxval = x0;
+ imax = 0;
+# endif
+
+ for (i = imax+inc; i < num; i += inc)
+ {
+	if (maxval <= xi)
+	 {
+	 imax = i;
+	 maxval = xi;
+	 }
+ }
+ *(SLuindex_Type *)yp = imax;
+ return 0;
+}
+# undef WHERELASTMAX_FUNC
+#endif
+
+#ifdef WHEREFIRSTMIN_FUNC
+static int WHEREFIRSTMIN_FUNC (VOID_STAR xp, SLuindex_Type inc, SLuindex_Type num, VOID_STAR yp)
+{
+ GENERIC_TYPE *x;
+ SLuindex_Type i, imin;
+ GENERIC_TYPE minval;
+
+ if (-1 == check_for_empty_array ("wherefirstmin", num))
+ return -1;
+
+ x = (GENERIC_TYPE *) xp;
+
+# ifdef IS_NAN_FUNCTION
+ i = 0;
+ do
+ {
+	minval = xi;
+	imin = i;
+	i += inc;
+ }
+ while (IS_NAN_FUNCTION(minval) && (i < num));
+# else
+ minval = x0;
+ imin = 0;
+# endif
+
+ for (i = imin+inc; i < num; i += inc)
+ {
+	if (minval > xi)
+	 {
+	 imin = i;
+	 minval = xi;
+	 }
+ }
+ *(SLuindex_Type *)yp = imin;
+ return 0;
+}
+# undef WHEREFIRSTMIN_FUNC
+#endif
+
+#ifdef WHERELASTMIN_FUNC
+static int WHERELASTMIN_FUNC (VOID_STAR xp, SLuindex_Type inc, SLuindex_Type num, VOID_STAR yp)
+{
+ GENERIC_TYPE *x;
+ SLuindex_Type i, imin;
+ GENERIC_TYPE minval;
+
+ if (-1 == check_for_empty_array ("wherefirstmin", num))
+ return -1;
+
+ x = (GENERIC_TYPE *) xp;
+
+# ifdef IS_NAN_FUNCTION
+ i = 0;
+ do
+ {
+	minval = xi;
+	imin = i;
+	i += inc;
+ }
+ while (IS_NAN_FUNCTION(minval) && (i < num));
+# else
+ minval = x0;
+ imin = 0;
+# endif
+
+ for (i = imin+inc; i < num; i += inc)
+ {
+	if (minval >= xi)
+	 {
+	 imin = i;
+	 minval = xi;
+	 }
+ }
+ *(SLuindex_Type *)yp = imin;
+ return 0;
+}
+# undef WHERELASTMIN_FUNC
+#endif
+
+#ifdef DO_WHEREFIRST_OP_FUNC
+static int DO_WHEREFIRST_OP_FUNC (SLang_Array_Type *at, int op, GENERIC_TYPE_B b, SLindex_Type istart)
+{
+ GENERIC_TYPE_A *a;
+ SLindex_Type i, num_elements;
+
+ a = (GENERIC_TYPE_A *) at->data;
+ num_elements = (SLindex_Type) at->num_elements;
+
+# define WHEREFIRST_CASE_BODY(cop) \
+ i = istart; while ((i < num_elements) && (0 == (ai cop b))) i++;
+
+ switch (op)
+ {
+ case SLANG_EQ: WHEREFIRST_CASE_BODY(==); break;
+ case SLANG_NE: WHEREFIRST_CASE_BODY(!=); break;
+ case SLANG_GT: WHEREFIRST_CASE_BODY( >); break;
+ case SLANG_GE: WHEREFIRST_CASE_BODY(>=); break;
+ case SLANG_LT: WHEREFIRST_CASE_BODY( <); break;
+ case SLANG_LE: WHEREFIRST_CASE_BODY(<=); break;
+ default:
+	SLang_verror (SL_Internal_Error, "Unexpected op: %d\n", op);
+	return -1;
+ }
+
+ if (i < num_elements)
+ return SLang_push_array_index (i);
+
+ return SLang_push_null ();
+}
+#undef WHEREFIRST_CASE_BODY
+#undef DO_WHEREFIRST_OP_FUNC
+#endif
+
+#ifdef DO_WHERELAST_OP_FUNC
+static int DO_WHERELAST_OP_FUNC (SLang_Array_Type *at, int op, GENERIC_TYPE_B b, SLindex_Type istart)
+{
+ GENERIC_TYPE_A *a;
+ SLindex_Type num_elements;
+
+ a = (GENERIC_TYPE_A *) at->data;
+ num_elements = (SLindex_Type) at->num_elements;
+ if (istart >= num_elements) istart = num_elements-1;
+
+# define WHERELAST_CASE_BODY(cop) \
+ while ((istart >= 0) && (0 == (aistart cop b))) istart--
+
+ switch (op)
+ {
+ case SLANG_EQ: WHERELAST_CASE_BODY(==); break;
+ case SLANG_NE: WHERELAST_CASE_BODY(!=); break;
+ case SLANG_GT: WHERELAST_CASE_BODY( >); break;
+ case SLANG_GE: WHERELAST_CASE_BODY(>=); break;
+ case SLANG_LT: WHERELAST_CASE_BODY( <); break;
+ case SLANG_LE: WHERELAST_CASE_BODY(<=); break;
+ default:
+	SLang_verror (SL_Internal_Error, "Unexpected op: %d\n", op);
+	return -1;
+ }
+
+ if (istart >= 0)
+ return SLang_push_array_index (istart);
+
+ return SLang_push_null ();
+}
+#undef WHERELAST_CASE_BODY
+#undef DO_WHERELAST_OP_FUNC
+#endif
+
+#ifdef GENERIC_TYPE_A
+# undef GENERIC_TYPE_A
+#endif
+
+#ifdef GENERIC_TYPE_B
+# undef GENERIC_TYPE_B
+#endif
+
+#ifdef GENERIC_TYPE
+# undef GENERIC_TYPE
+#endif
+
+#ifdef IS_NAN_FUNCTION
+# undef IS_NAN_FUNCTION
+#endif
+
+#ifdef ABS_FUNCTION
+# undef ABS_FUNCTION
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/slarrmis.c Added

@@ -0,0 +1,52 @@
+/* Misc Array Functions */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+int SLang_get_array_element (SLang_Array_Type *at, SLindex_Type *indices, VOID_STAR data)
+{
+   int is_ptr;
+
+   if ((at == NULL)
+       || (indices == NULL)
+       || (data == NULL))
+     return -1;
+
+   is_ptr = (at->flags & SLARR_DATA_VALUE_IS_POINTER);
+   if (is_ptr) *(VOID_STAR *) data = NULL;
+   return _pSLarray_aget_transfer_elem (at, indices, data, at->sizeof_type, is_ptr);
+}
+
+int SLang_set_array_element (SLang_Array_Type *at, SLindex_Type *indices, VOID_STAR data)
+{
+   if ((at == NULL)
+       || (indices == NULL)
+       || (data == NULL))
+     return -1;
+
+   return _pSLarray_aput_transfer_elem (at, indices, data, at->sizeof_type,
+				       at->flags & SLARR_DATA_VALUE_IS_POINTER);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slassoc.c Added

@@ -0,0 +1,944 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+/* #define SL_APP_WANTS_FOREACH */
+#include "slang.h"
+#include "_slang.h"
+
+#define USE_NEW_ANYTYPE_CODE 1
+
+#define MAP_HASH_TO_INDEX(hash, table_len) \
+ (unsigned int)((hash)&(table_len-1))
+
+/* Must be a power of 2 */
+#define MIN_TABLE_SIZE 512
+
+static SLFUTURE_CONST char *Deleted_Key = "*deleted*";
+
+typedef struct _pSLAssoc_Array_Element_Type
+{
+ SLFUTURE_CONST char *key; /* slstring */
+ SLstr_Hash_Type hash;
+ SLang_Object_Type value;
+}
+_pSLAssoc_Array_Element_Type;
+
+typedef struct _pSLang_Assoc_Array_Type
+{
+ _pSLAssoc_Array_Element_Type *elements;
+ unsigned int table_len;
+ unsigned int num_occupied;	 /* includes deletions */
+ unsigned int num_deleted;
+ unsigned int resize_num;	 /* resize when num_occupied hits this number */
+ SLang_Object_Type default_value;
+#define HAS_DEFAULT_VALUE	1
+ unsigned int flags;
+ SLtype type;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ int is_scalar_type;
+#endif
+ int ref_count;
+}
+_pSLang_Assoc_Array_Type;
+
+static int HASH_AGAIN (SLCONST char *str, SLstr_Hash_Type hash, unsigned int table_len)
+{
+ int h;
+ (void) table_len; (void) str;
+ h = (int)(hash % 311);	 /* 311 should be smaller than MIN_TABLE_SIZE */
+ if (0 == (h & 1))
+ h++;
+ return h;
+}
+
+static _pSLAssoc_Array_Element_Type *
+find_element (SLang_Assoc_Array_Type *a, char *str, SLstr_Hash_Type hash)
+{
+ int i, c;
+ _pSLAssoc_Array_Element_Type *e, *elements;
+ int table_len;
+
+ table_len = a->table_len;
+ i = MAP_HASH_TO_INDEX(hash, table_len);
+ e = a->elements + i;
+ if (e->key == str)
+ return e;
+
+ if (e->key == NULL)
+ return NULL;
+
+ c = HASH_AGAIN(str, hash, table_len);
+ elements = a->elements;
+
+ while (1)
+ {
+	i -= c;
+	if (i < 0)
+	 i += table_len;
+
+	e = elements + i;
+	if (e->key == str)
+	 return e;
+	if (e->key == NULL)
+	 return NULL;
+ }
+}
+
+static _pSLAssoc_Array_Element_Type *
+find_empty_element (_pSLAssoc_Array_Element_Type *elements, unsigned int table_len,
+ SLCONST char *str, SLstr_Hash_Type hash)
+{
+ int i, c;
+ _pSLAssoc_Array_Element_Type *e;
+
+ i = MAP_HASH_TO_INDEX(hash, table_len);
+ e = elements + i;
+ if ((e->key == NULL) || (e->key == Deleted_Key))
+ return e;
+
+ c = HASH_AGAIN(str, hash, table_len);
+ while (1)
+ {
+	i -= c;
+	if (i < 0)
+	 i += table_len;
+
+	e = elements + i;
+	if ((e->key == NULL) || (e->key == Deleted_Key))
+	 return e;
+ }
+}
+
+static int resize_table (SLang_Assoc_Array_Type *a)
+{
+ int num_occupied, new_table_len;
+ _pSLAssoc_Array_Element_Type *old_es;
+ _pSLAssoc_Array_Element_Type *new_es;
+
+ num_occupied = a->num_occupied - a->num_deleted;
+
+ if (num_occupied == 0)
+ num_occupied = (MIN_TABLE_SIZE >> 1);
+
+ new_table_len = a->table_len;
+ if (new_table_len < MIN_TABLE_SIZE)
+ new_table_len = MIN_TABLE_SIZE;
+
+ /* In practice, num_occupied*2 will not overflow because we would be
+ * out of memory if would be num_occupied objects stored.
+ */
+ num_occupied *= 2;
+ while (num_occupied > new_table_len)
+ {
+	new_table_len *= 2;
+	if (new_table_len < 0)
+	 {
+	 SLang_set_error (SL_Malloc_Error);
+	 return -1;
+	 }
+ }
+
+ new_es = (_pSLAssoc_Array_Element_Type *)SLcalloc (new_table_len, sizeof (_pSLAssoc_Array_Element_Type));
+ if (new_es == NULL)
+ return -1;
+ if (NULL != (old_es = a->elements))
+ {
+	_pSLAssoc_Array_Element_Type *old_e, *old_emax;
+
+	old_e = old_es;
+	old_emax = old_e + a->table_len;
+	while (old_e < old_emax)
+	 {
+	 _pSLAssoc_Array_Element_Type *new_e;
+	 SLCONST char *key = old_e->key;
+
+	 if ((key == NULL) || (key == Deleted_Key))
+	 {
+		 old_e++;
+		 continue;
+	 }
+
+	 /* Cannot fail */
+	 new_e = find_empty_element (new_es, new_table_len, key, old_e->hash);
+	 *new_e = *old_e;
+	 old_e++;
+	 }
+	SLfree ((char *)old_es);
+ }
+ a->elements = new_es;
+ a->table_len = new_table_len;
+ a->num_occupied -= a->num_deleted;
+ a->num_deleted = 0;
+ a->resize_num = 13*(new_table_len>>4);
+
+ return 0;
+}
+
+static void delete_assoc_array (SLang_Assoc_Array_Type *a)
+{
+ _pSLAssoc_Array_Element_Type *e;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ int is_scalar_type;
+#endif
+
+ if (a == NULL) return;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ is_scalar_type = a->is_scalar_type;
+#endif
+
+ e = a->elements;
+ if (e != NULL)
+ {
+	_pSLAssoc_Array_Element_Type *emax = e + a->table_len;
+	while (e < emax)
+	 {
+	 if ((e->key != NULL) && (e->key != Deleted_Key))
+	 {
+		 _pSLfree_hashed_string ((char *)e->key, strlen (e->key), e->hash);
+#if SLANG_OPTIMIZE_FOR_SPEED
+		 if ((is_scalar_type == 0) && (e->value.o_data_type != SLANG_INT_TYPE))
+#endif
+		 SLang_free_object (&e->value);
+	 }
+	 e++;
+	 }
+	SLfree ((char *) a->elements);
+ }
+ if (a->flags & HAS_DEFAULT_VALUE)
+ SLang_free_object (&a->default_value);
+
+ SLfree ((char *) a);
+}
+
+static void free_assoc (SLang_Assoc_Array_Type *assoc)
+{
+ if (assoc == NULL)
+ return;
+
+ if (assoc->ref_count > 1)
+ {
+	assoc->ref_count--;
+	return;
+ }
+ delete_assoc_array (assoc);
+}
+
+static SLang_Assoc_Array_Type *alloc_assoc_array (SLtype type, int has_default_value)
+{
+ SLang_Assoc_Array_Type *a;
+
+ a = (SLang_Assoc_Array_Type *)SLmalloc (sizeof (SLang_Assoc_Array_Type));
+ if (a == NULL)
+ {
+	if (has_default_value)
+	 SLdo_pop_n (1);
+	return NULL;
+ }
+
+ memset ((char *) a, 0, sizeof (SLang_Assoc_Array_Type));
+ a->type = type;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ a->is_scalar_type = (SLANG_CLASS_TYPE_SCALAR == _pSLang_get_class_type (type));
+#endif
+
+ if (has_default_value)
+ {
+	if (
+#if USE_NEW_ANYTYPE_CODE
+	 ((type != SLANG_ANY_TYPE) && (-1 == SLclass_typecast (type, 1, 0)))
+#else
+	 (-1 == SLclass_typecast (type, 1, 0))
+#endif
+	 || (-1 == SLang_pop (&a->default_value)))
+	 {
+	 SLfree ((char *) a);
+	 return NULL;
+	 }
+
+	a->flags |= HAS_DEFAULT_VALUE;
+ }
+ if (-1 == resize_table (a))
+ {
+	delete_assoc_array (a);
+	return NULL;
+ }
+
+ a->ref_count = 1;
+ return a;
+}
+
+static _pSLAssoc_Array_Element_Type *store_object (SLang_Assoc_Array_Type *a, _pSLAssoc_Array_Element_Type *e, SLstr_Type *s, SLstr_Hash_Type hash, SLang_Object_Type *obj)
+{
+ if ((e != NULL)
+ || (NULL != (e = find_element (a, s, hash))))
+ {
+#if SLANG_OPTIMIZE_FOR_SPEED
+	if ((a->is_scalar_type == 0) && (e->value.o_data_type != SLANG_INT_TYPE))
+#endif
+	 SLang_free_object (&e->value);
+ }
+ else
+ {
+	if ((a->num_occupied == a->resize_num)
+	 && (-1 == resize_table (a)))
+	 return NULL;
+
+	if (NULL == (e = find_empty_element (a->elements, a->table_len, s, hash)))
+	 return NULL;
+	if (e->key == Deleted_Key)
+	 a->num_deleted--;
+	else
+	 a->num_occupied++;
+
+	if (NULL == (e->key = _pSLstring_dup_hashed_string (s, hash)))
+	 return NULL;
+
+	e->hash = hash;
+ }
+ e->value = *obj;
+ return e;
+}
+
+static int pop_assoc (SLang_Assoc_Array_Type **assoc)
+{
+ if (-1 == SLclass_pop_ptr_obj (SLANG_ASSOC_TYPE, (VOID_STAR *) assoc))
+ {
+ *assoc = NULL;
+ return -1;
+ }
+ return 0;
+}
+
+static int pop_index (unsigned int num_indices,
+ SLang_Assoc_Array_Type **ap,
+ SLstr_Type **strp, SLstr_Hash_Type *hashp)
+{
+
+ if (-1 == pop_assoc (ap))
+ {
+	*strp = NULL;
+	return -1;
+ }
+
+ if ((num_indices != 1)
+ || (-1 == SLang_pop_slstring (strp)))
+ {
+	_pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "Assoc_Type arrays require a single string index");
+	free_assoc (*ap);
+	*ap = NULL;
+	*strp = NULL;
+	return -1;
+ }
+
+ *hashp = _pSLstring_get_hash (*strp);
+
+ return 0;
+}
+
+static int push_assoc_element (SLang_Assoc_Array_Type *a, SLstr_Type *str, SLstr_Hash_Type hash)
+{
+ _pSLAssoc_Array_Element_Type *e = find_element (a, str, hash);
+ SLang_Object_Type *obj;
+
+ if (e == NULL)
+ {
+	if (a->flags & HAS_DEFAULT_VALUE)
+	 obj = &a->default_value;
+	else
+	 {
+	 _pSLang_verror (SL_INTRINSIC_ERROR,
+			 "No such element in Assoc Array: %s", str);
+	 return -1;
+	 }
+ }
+ else
+ obj = &e->value;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ if (a->is_scalar_type)
+ return SLang_push (obj);
+ else
+#endif
+ return _pSLpush_slang_obj (obj);
+}
+
+int _pSLassoc_aget (SLtype type, unsigned int num_indices)
+{
+ SLstr_Hash_Type hash;
+ SLstr_Type *str;
+ SLang_Assoc_Array_Type *a;
+ int ret;
+
+ (void) type;
+
+ if (-1 == pop_index (num_indices, &a, &str, &hash))
+ return -1;
+
+ ret = push_assoc_element (a, str, hash);
+
+ _pSLang_free_slstring (str);
+ free_assoc (a);
+ return ret;
+}
+
+_INLINE_
+static _pSLAssoc_Array_Element_Type *
+assoc_aput (SLang_Assoc_Array_Type *a, _pSLAssoc_Array_Element_Type *e,
+	 SLstr_Type *str, SLstr_Hash_Type hash)
+{
+ SLang_Object_Type obj;
+
+ if (-1 == SLang_pop (&obj))
+ return NULL;
+
+ if ((obj.o_data_type != a->type)
+#if USE_NEW_ANYTYPE_CODE
+ && (a->type != SLANG_ANY_TYPE)
+#endif
+ )
+ {
+	(void) SLang_push (&obj);
+	if ((-1 == SLclass_typecast (a->type, 1, 0))
+	 || (-1 == SLang_pop (&obj)))
+	 return NULL;
+ }
+
+ if (NULL == (e = store_object (a, e, str, hash, &obj)))
+ SLang_free_object (&obj);
+
+ return e;
+}
+
+int _pSLassoc_aput (SLtype type, unsigned int num_indices)
+{
+ SLstr_Type *str;
+ SLang_Assoc_Array_Type *a;
+ int ret;
+ SLstr_Hash_Type hash;
+
+ (void) type;
+
+ if (-1 == pop_index (num_indices, &a, &str, &hash))
+ return -1;
+
+ if (NULL == assoc_aput (a, NULL, str, hash))
+ ret = -1;
+ else
+ ret = 0;
+
+ _pSLang_free_slstring (str);
+ free_assoc (a);
+
+ return ret;
+}
+
+int _pSLassoc_inc_value (unsigned int num_indices, int inc)
+{
+ SLstr_Hash_Type hash;
+ SLstr_Type *str;
+ _pSLAssoc_Array_Element_Type *e;
+ SLang_Assoc_Array_Type *a;
+ SLang_Object_Type *objp;
+ SLang_Object_Type inc_obj;
+ int ret;
+
+ if (-1 == pop_index (num_indices, &a, &str, &hash))
+ return -1;
+
+ e = find_element (a, str, hash);
+
+ ret = -1;
+
+ if (e == NULL)
+ {
+	if (a->flags & HAS_DEFAULT_VALUE)
+	 {
+	 if (-1 == _pSLpush_slang_obj (&a->default_value))
+	 goto free_and_return;
+	 }
+	else
+	 {
+	 _pSLang_verror (SL_INTRINSIC_ERROR,
+			 "No such element in Assoc Array: %s", str);
+	 goto free_and_return;
+	 }
+
+	if (NULL == (e = assoc_aput (a, e, str, hash)))
+	 goto free_and_return;
+ }
+
+ objp = &e->value;
+
+ if (objp->o_data_type == SLANG_INT_TYPE)
+ {
+	ret = 0;
+	objp->v.int_val += inc;
+	goto free_and_return;
+ }
+
+ inc_obj.o_data_type = SLANG_INT_TYPE;
+ inc_obj.v.int_val = inc;
+
+ if ((-1 == _pSLang_do_binary_ab (SLANG_PLUS, objp, &inc_obj))
+ || (NULL == assoc_aput (a, e, str, hash)))
+ goto free_and_return;
+
+ ret = 0;
+ /* drop */
+
+free_and_return:
+
+ _pSLang_free_slstring (str);
+ free_assoc (a);
+ return ret;
+}
+
+static int assoc_anew (SLtype type, unsigned int num_dims)
+{
+ SLang_Assoc_Array_Type *a;
+ int has_default_value;
+
+ has_default_value = 0;
+ switch (num_dims)
+ {
+ case 0:
+	type = SLANG_ANY_TYPE;
+	break;
+ case 2:
+	if (-1 == SLreverse_stack (2))
+	 return -1;
+	has_default_value = 1;
+	/* drop */
+ case 1:
+	if (0 == SLang_pop_datatype (&type))
+	 break;
+	num_dims--;
+	/* drop */
+ default:
+	SLdo_pop_n (num_dims);
+	_pSLang_verror (SL_SYNTAX_ERROR, "Usage: Assoc_Type DataType_Type");
+	return -1;
+ }
+
+ a = alloc_assoc_array (type, has_default_value);
+ if (a == NULL)
+ return -1;
+
+ return SLang_push_assoc (a, 1);
+}
+
+static void assoc_get_keys (SLang_Assoc_Array_Type *a)
+{
+ SLang_Array_Type *at;
+ SLindex_Type i, num;
+ char **data;
+ _pSLAssoc_Array_Element_Type *e, *emax;
+
+ /* Note: If support for threads is added, then we need to modify this
+ * algorithm to prevent another thread from modifying the array.
+ * However, that should be handled in inner_interp.
+ */
+ num = a->num_occupied - a->num_deleted;
+
+ if (NULL == (at = SLang_create_array (SLANG_STRING_TYPE, 0, NULL, &num, 1)))
+ return;
+
+ data = (char **)at->data;
+
+ e = a->elements;
+ emax = e + a->table_len;
+
+ i = 0;
+ while (e < emax)
+ {
+	if ((e->key != NULL) && (e->key != Deleted_Key))
+	 {
+	 /* Next cannot fail because it is an slstring */
+	 data i = _pSLstring_dup_hashed_string (e->key, e->hash);
+	 i++;
+	 }
+	e++;
+ }
+ (void) SLang_push_array (at, 1);
+}
+
+static int
+transfer_element (SLang_Class_Type *cl, VOID_STAR dest_data,
+		 SLang_Object_Type *obj)
+{
+ VOID_STAR src_data;
+
+#if USE_NEW_ANYTYPE_CODE
+ if (cl->cl_data_type == SLANG_ANY_TYPE)
+ {
+	SLang_Any_Type *any;
+
+	if ((-1 == _pSLpush_slang_obj (obj))
+	 || (-1 == SLang_pop_anytype (&any)))
+	 return -1;
+
+	*(SLang_Any_Type **)dest_data = any;
+	return 0;
+ }
+#endif
+ /* Optimize for scalar */
+ if (cl->cl_class_type == SLANG_CLASS_TYPE_SCALAR)
+ {
+	memcpy ((char *) dest_data, (char *)&obj->v, cl->cl_sizeof_type);
+	return 0;
+ }
+
+ src_data = _pSLclass_get_ptr_to_value (cl, obj);
+
+ if (-1 == (*cl->cl_acopy) (cl->cl_data_type, src_data, dest_data))
+ return -1;
+
+ return 0;
+}
+
+static void assoc_get_values (SLang_Assoc_Array_Type *a)
+{
+ SLang_Array_Type *at;
+ SLindex_Type num;
+ char *dest_data;
+ SLtype type;
+ SLang_Class_Type *cl;
+ unsigned int sizeof_type;
+ _pSLAssoc_Array_Element_Type *e, *emax;
+
+ /* Note: If support for threads is added, then we need to modify this
+ * algorithm to prevent another thread from modifying the array.
+ * However, that should be handled in inner_interp.
+ */
+ num = a->num_occupied - a->num_deleted;
+ type = a->type;
+
+ cl = _pSLclass_get_class (type);
+ sizeof_type = cl->cl_sizeof_type;
+
+ if (NULL == (at = SLang_create_array (type, 0, NULL, &num, 1)))
+ return;
+
+ dest_data = (char *)at->data;
+
+ e = a->elements;
+ emax = e + a->table_len;
+
+ while (e < emax)
+ {
+	if ((e->key != NULL) && (e->key != Deleted_Key))
+	 {
+	 if (-1 == transfer_element (cl, (VOID_STAR) dest_data, &e->value))
+	 {
+		 SLang_free_array (at);
+		 return;
+	 }
+	 dest_data += sizeof_type;
+	 }
+	e++;
+ }
+ (void) SLang_push_array (at, 1);
+}
+
+static int assoc_key_exists (SLang_Assoc_Array_Type *a, char *key)
+{
+ return (NULL != find_element (a, key, SLcompute_string_hash (key)));
+}
+
+static void assoc_delete_key (SLang_Assoc_Array_Type *a, char *key)
+{
+ _pSLAssoc_Array_Element_Type *e;
+
+ e = find_element (a, key, _pSLstring_get_hash (key));
+ if (e == NULL)
+ return;
+
+ _pSLang_free_slstring ((char *) e->key);
+ SLang_free_object (&e->value);
+ e->key = Deleted_Key;
+ a->num_deleted++;
+}
+
+#define A SLANG_ASSOC_TYPE
+#define S SLANG_STRING_TYPE
+static SLang_Intrin_Fun_Type Assoc_Table =
+{
+ MAKE_INTRINSIC_1("assoc_get_keys", assoc_get_keys, SLANG_VOID_TYPE, A),
+ MAKE_INTRINSIC_1("assoc_get_values", assoc_get_values, SLANG_VOID_TYPE, A),
+ MAKE_INTRINSIC_2("assoc_key_exists", assoc_key_exists, SLANG_INT_TYPE, A, S),
+ MAKE_INTRINSIC_2("assoc_delete_key", assoc_delete_key, SLANG_VOID_TYPE, A, S),
+
+ SLANG_END_INTRIN_FUN_TABLE
+};
+#undef A
+#undef S
+
+static int assoc_length (SLtype type, VOID_STAR v, SLuindex_Type *len)
+{
+ SLang_Assoc_Array_Type *a;
+
+ (void) type;
+ a = *(SLang_Assoc_Array_Type **) v;
+ *len = a->num_occupied - a->num_deleted;
+ return 0;
+}
+
+struct _pSLang_Foreach_Context_Type
+{
+ SLang_Assoc_Array_Type *a;
+ unsigned int next_hash_index;
+#define CTX_WRITE_KEYS		1
+#define CTX_WRITE_VALUES	2
+ unsigned char flags;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ int is_scalar;
+#endif
+};
+
+static SLang_Foreach_Context_Type *
+cl_foreach_open (SLtype type, unsigned int num)
+{
+ SLang_Foreach_Context_Type *c;
+ SLang_Assoc_Array_Type *assoc;
+ unsigned char flags;
+
+ (void) type;
+
+ if (-1 == pop_assoc (&assoc))
+ return NULL;
+
+ flags = 0;
+
+ while (num--)
+ {
+	char *s;
+
+	if (-1 == SLang_pop_slstring (&s))
+	 {
+	 free_assoc (assoc);
+	 return NULL;
+	 }
+
+	if (0 == strcmp (s, "keys"))
+	 flags |= CTX_WRITE_KEYS;
+	else if (0 == strcmp (s, "values"))
+	 flags |= CTX_WRITE_VALUES;
+	else
+	 {
+	 _pSLang_verror (SL_NOT_IMPLEMENTED,
+			 "using '%s' not supported by SLassoc_Type",
+			 s);
+	 _pSLang_free_slstring (s);
+	 free_assoc (assoc);
+	 return NULL;
+	 }
+
+	_pSLang_free_slstring (s);
+ }
+
+ if (NULL == (c = (SLang_Foreach_Context_Type *) SLmalloc (sizeof (SLang_Foreach_Context_Type))))
+ {
+	free_assoc (assoc);
+	return NULL;
+ }
+
+ memset ((char *) c, 0, sizeof (SLang_Foreach_Context_Type));
+
+ c->a = assoc;
+
+ if (flags == 0) flags = CTX_WRITE_VALUES|CTX_WRITE_KEYS;
+
+ c->flags = flags;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ c->is_scalar = (SLANG_CLASS_TYPE_SCALAR == _pSLang_get_class_type (c->a->type));
+#endif
+ return c;
+}
+
+static void cl_foreach_close (SLtype type, SLang_Foreach_Context_Type *c)
+{
+ (void) type;
+ if (c == NULL) return;
+ free_assoc (c->a);
+ SLfree ((char *) c);
+}
+
+static int cl_foreach (SLtype type, SLang_Foreach_Context_Type *c)
+{
+ SLang_Assoc_Array_Type *a;
+ _pSLAssoc_Array_Element_Type *e, *emax;
+
+ (void) type;
+
+ if (c == NULL)
+ return -1;
+
+ a = c->a;
+
+ e = a->elements + c->next_hash_index;
+ emax = a->elements + a->table_len;
+ while (1)
+ {
+	if (e == emax)
+	 return 0;
+
+	if ((e->key != NULL) && (e->key != Deleted_Key))
+	 break;
+
+	e++;
+ }
+
+ c->next_hash_index = (e - a->elements) + 1;
+
+ if ((c->flags & CTX_WRITE_KEYS)
+ && (-1 == SLang_push_string (e->key)))
+ return -1;
+
+ if (c->flags & CTX_WRITE_VALUES)
+ {
+#if SLANG_OPTIMIZE_FOR_SPEED
+	if (c->is_scalar)
+	 {
+	 if (-1 == SLang_push (&e->value))
+	 return -1;
+	 }
+	else
+#endif
+	 if (-1 == _pSLpush_slang_obj (&e->value))
+	 return -1;
+ }
+
+ /* keep going */
+ return 1;
+}
+
+static void assoc_destroy (SLtype type, VOID_STAR ptr)
+{
+ (void) type;
+ free_assoc (*(SLang_Assoc_Array_Type **) ptr);
+}
+
+static int assoc_push (SLtype type, VOID_STAR ptr)
+{
+ (void) type;
+ return SLang_push_assoc (*(SLang_Assoc_Array_Type **) ptr, 0);
+}
+
+
+int SLang_init_slassoc (void)
+{
+ SLang_Class_Type *cl;
+
+ if (SLclass_is_class_defined (SLANG_ASSOC_TYPE))
+ return 0;
+
+ if (NULL == (cl = SLclass_allocate_class ("Assoc_Type")))
+ return -1;
+
+ (void) SLclass_set_destroy_function (cl, assoc_destroy);
+ (void) SLclass_set_push_function (cl, assoc_push);
+
+ (void) SLclass_set_aput_function (cl, _pSLassoc_aput);
+ (void) SLclass_set_aget_function (cl, _pSLassoc_aget);
+ (void) SLclass_set_anew_function (cl, assoc_anew);
+ cl->cl_length = assoc_length;
+ cl->cl_foreach_open = cl_foreach_open;
+ cl->cl_foreach_close = cl_foreach_close;
+ cl->cl_foreach = cl_foreach;
+
+ cl->is_container = 1;
+ if (-1 == SLclass_register_class (cl, SLANG_ASSOC_TYPE, sizeof (SLang_Assoc_Array_Type), SLANG_CLASS_TYPE_PTR))
+ return -1;
+
+ if (-1 == SLadd_intrin_fun_table (Assoc_Table, "__SLASSOC__"))
+ return -1;
+
+ return 0;
+}
+
+SLang_Assoc_Array_Type *SLang_create_assoc (SLtype type, int has_default_value)
+{
+ if (type == SLANG_VOID_TYPE) type = SLANG_ANY_TYPE;
+ return alloc_assoc_array (type, has_default_value);
+}
+
+int SLang_assoc_put (SLang_Assoc_Array_Type *assoc, SLstr_Type *key)
+{
+ SLstr_Hash_Type hash = _pSLstring_get_hash (key);
+
+ if (NULL == assoc_aput (assoc, NULL, key, hash))
+ return -1;
+
+ return 0;
+}
+
+int SLang_assoc_get (SLang_Assoc_Array_Type *assoc, SLstr_Type *key, SLtype *typep)
+{
+ int type;
+ SLstr_Hash_Type hash = _pSLstring_get_hash (key);
+
+ if ((-1 == push_assoc_element (assoc, key, hash))
+ || (-1 == (type = SLang_peek_at_stack ())))
+ return -1;
+
+ if (typep != NULL)
+ *typep = (SLtype) type;
+
+ return 0;
+}
+
+int SLang_push_assoc (SLang_Assoc_Array_Type *assoc, int free_flag)
+{
+ if (assoc == NULL)
+ return SLang_push_null ();
+
+ /* SLclass_push_ptr_obj does not do memory management */
+ if (-1 == SLclass_push_ptr_obj (SLANG_ASSOC_TYPE, (VOID_STAR)assoc))
+ {
+	if (free_flag) free_assoc (assoc);
+	return -1;
+ }
+
+ if (free_flag == 0)
+ assoc->ref_count++;
+
+ return 0;
+}
+
+int SLang_pop_assoc (SLang_Assoc_Array_Type **assoc)
+{
+ return SLclass_pop_ptr_obj (SLANG_ASSOC_TYPE, (VOID_STAR *) assoc);
+}
+
+void SLang_free_assoc (SLang_Assoc_Array_Type *assoc)
+{
+ free_assoc (assoc);
+}
+
+int SLang_assoc_key_exists (SLang_Assoc_Array_Type *a, SLstr_Type *key)
+{
+ return assoc_key_exists(a, key);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slboseos.c Added

@@ -0,0 +1,384 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+#include "slang.h"
+#include "_slang.h"
+
+#if SLANG_HAS_BOSEOS
+static SLang_Name_Type *BOS_Callback_Handler = NULL;
+static SLang_Name_Type *EOS_Callback_Handler = NULL;
+static SLang_Name_Type *BOF_Callback_Handler = NULL;
+static SLang_Name_Type *EOF_Callback_Handler = NULL;
+
+static void set_bos_eos_handlers (SLang_Name_Type *bos, SLang_Name_Type *eos)
+{
+   if (BOS_Callback_Handler != NULL)
+     SLang_free_function (BOS_Callback_Handler);
+   BOS_Callback_Handler = bos;
+
+   if (EOS_Callback_Handler != NULL)
+     SLang_free_function (EOS_Callback_Handler);
+   EOS_Callback_Handler = eos;
+}
+
+static void set_bof_eof_handlers (SLang_Name_Type *bof, SLang_Name_Type *eof)
+{
+   if (BOF_Callback_Handler != NULL)
+     SLang_free_function (BOF_Callback_Handler);
+   BOF_Callback_Handler = bof;
+
+   if (EOF_Callback_Handler != NULL)
+     SLang_free_function (EOF_Callback_Handler);
+   EOF_Callback_Handler = eof;
+}
+
+static int Handler_Active = 0;
+
+int _pSLcall_bos_handler (SLFUTURE_CONST char *file, int line)
+{
+   int status = 0;
+   int err;
+
+   if (BOS_Callback_Handler == NULL)
+     return 0;
+
+   if (Handler_Active)
+     return 0;
+
+   if ((0 != (err = _pSLang_Error))
+       && (-1 == _pSLang_push_error_context ()))
+     return -1;
+
+   Handler_Active++;
+   if ((-1 == SLang_start_arg_list ())
+       || (-1 == SLang_push_string (file))
+       || (-1 == SLclass_push_int_obj (SLANG_INT_TYPE, line))
+       || (-1 == SLang_end_arg_list ())
+       || (-1 == SLexecute_function (BOS_Callback_Handler)))
+     {
+	set_bos_eos_handlers (NULL, NULL);
+	status = -1;
+     }
+   Handler_Active--;
+
+   if (err)
+     _pSLang_pop_error_context (status != 0);
+
+   return status;
+}
+
+int _pSLcall_eos_handler (void)
+{
+   int err, status = 0;
+
+   if ((EOS_Callback_Handler == NULL)
+       || (Handler_Active))
+     return 0;
+
+   if ((0 != (err = _pSLang_Error))
+       && (-1 == _pSLang_push_error_context ()))
+     return -1;
+
+   Handler_Active++;
+   if ((-1 == SLang_start_arg_list ())
+       || (-1 == SLang_end_arg_list ())
+       || (-1 == SLexecute_function (EOS_Callback_Handler)))
+     {
+	status = -1;
+	set_bos_eos_handlers (NULL, NULL);
+     }
+   Handler_Active--;
+   if (err)
+     _pSLang_pop_error_context (status != 0);
+
+   return status;
+}
+
+int _pSLcall_bof_handler (SLFUTURE_CONST char *fun, SLFUTURE_CONST char *file)
+{
+   int status = 0, err;
+
+   if (BOF_Callback_Handler == NULL)
+     return 0;
+
+   if (Handler_Active)
+     return 0;
+
+   if ((0 != (err = _pSLang_Error))
+       && (-1 == _pSLang_push_error_context ()))
+     return -1;
+
+   Handler_Active++;
+   if ((-1 == SLang_start_arg_list ())
+       || (-1 == SLang_push_string (fun))
+       || (-1 == SLang_push_string (file))
+       || (-1 == SLang_end_arg_list ())
+       || (-1 == SLexecute_function (BOF_Callback_Handler)))
+     {
+	set_bof_eof_handlers (NULL, NULL);
+	status = -1;
+     }
+   Handler_Active--;
+   if (err)
+     _pSLang_pop_error_context (status != 0);
+   return status;
+}
+
+int _pSLcall_eof_handler (void)
+{
+   int status = 0, err;
+
+   if ((EOF_Callback_Handler == NULL)
+       || (Handler_Active))
+     return 0;
+
+   if ((0 != (err = _pSLang_Error))
+       && (-1 == _pSLang_push_error_context ()))
+     return -1;
+
+   Handler_Active++;
+   if ((-1 == SLang_start_arg_list ())
+       || (-1 == SLang_end_arg_list ())
+       || (-1 == SLexecute_function (EOF_Callback_Handler)))
+     {
+	status = -1;
+	set_bof_eof_handlers (NULL, NULL);
+     }
+   Handler_Active--;
+   if (err)
+     _pSLang_pop_error_context (status != 0);
+   return status;
+}
+
+static int pop_new_push_old (SLang_Name_Type **handler)
+{
+   SLang_Name_Type *new_handler;
+   SLang_Name_Type *old_handler;
+
+   old_handler = *handler;
+   if (SLang_peek_at_stack () == SLANG_NULL_TYPE)
+     {
+	SLang_pop_null ();
+	new_handler = NULL;
+     }
+   else if (NULL == (new_handler = SLang_pop_function ()))
+     return -1;
+
+   if (-1 == _pSLang_push_nt_as_ref (old_handler))
+     {
+	SLang_free_function (new_handler);
+	return -1;
+     }
+
+   SLang_free_function (old_handler);
+   *handler = new_handler;
+   return 0;
+}
+
+static void set_bos_handler (void)
+{
+   (void) pop_new_push_old (&BOS_Callback_Handler);
+}
+
+static void set_eos_handler (void)
+{
+   (void) pop_new_push_old (&EOS_Callback_Handler);
+}
+
+static void set_bof_handler (void)
+{
+   (void) pop_new_push_old (&BOF_Callback_Handler);
+}
+
+static void set_eof_handler (void)
+{
+   (void) pop_new_push_old (&EOF_Callback_Handler);
+}
+
+#if SLANG_HAS_DEBUGGER_SUPPORT
+static SLang_Name_Type *Debug_Hook = NULL;
+static int Debug_Handler_Active = 0;
+
+static void set_debug_hook (SLang_Name_Type *deb)
+{
+   if (Debug_Hook != NULL)
+     SLang_free_function (Debug_Hook);
+   Debug_Hook = deb;
+}
+
+/* int _pSLcall_debug_hook (char *file, int line, char *funct) */
+int _pSLcall_debug_hook (SLFUTURE_CONST char *file, int line)
+{
+   int status = 0, err;
+
+   if (Debug_Hook == NULL)
+     return 0;
+
+   if (Debug_Handler_Active)
+     return 0;
+
+   if ((0 != (err = _pSLang_Error))
+       && (-1 == _pSLang_push_error_context ()))
+     return -1;
+
+   Debug_Handler_Active++;
+   if ((-1 == SLang_start_arg_list ())
+       || (-1 == SLang_push_string (file))
+       || (-1 == SLclass_push_int_obj (SLANG_INT_TYPE, line))
+       || (-1 == SLang_end_arg_list ())
+       || (-1 == SLexecute_function (Debug_Hook)))
+     {
+	status = -1;
+	set_debug_hook (NULL);
+     }
+   Debug_Handler_Active--;
+
+   if (err)
+     (void) _pSLang_pop_error_context (status != 0);
+
+   return status;
+}
+
+static void set_debug_hook_intrin (void)
+{
+   pop_new_push_old (&Debug_Hook);
+}
+
+static void get_frame_variable (int *depth, char *name)
+{
+   (void) _pSLang_get_frame_variable ((unsigned int) *depth, name);
+}
+
+static void set_frame_variable (void)
+{
+   char *name;
+   int depth;
+
+   if (-1 == SLroll_stack (3))
+     return;
+
+   if (-1 == SLang_pop_slstring (&name))
+     return;
+
+   if (0 == SLang_pop_int (&depth))
+     (void) _pSLang_set_frame_variable ((unsigned int) depth, name);
+   SLang_free_slstring (name);
+}
+
+static void get_frame_info (int *depth)
+{
+#define NUM_INFO_FIELDS 5
+   static SLFUTURE_CONST char *field_namesNUM_INFO_FIELDS =
+     {
+	"file", "line", "function", "locals", "namespace"
+     };
+   SLtype field_typesNUM_INFO_FIELDS;
+   VOID_STAR field_valuesNUM_INFO_FIELDS;
+   SLang_Array_Type *at = NULL;
+   _pSLang_Frame_Info_Type f;
+   unsigned int i;
+
+   if (-1 == _pSLang_get_frame_fun_info ((unsigned int)*depth, &f))
+     return;
+
+   i = 0;
+
+   field_valuesi = (VOID_STAR) &f.file;
+   if (f.file == NULL)
+     field_typesi = SLANG_NULL_TYPE;
+   else
+     field_typesi = SLANG_STRING_TYPE;
+   i++;
+
+   field_valuesi = &f.line;
+   field_typesi = SLANG_UINT_TYPE;
+   i++;
+
+   field_valuesi = (VOID_STAR) &f.function;
+   if (f.function == NULL)
+     field_typesi = SLANG_NULL_TYPE;
+   else
+     field_typesi = SLANG_STRING_TYPE;
+   i++;
+
+   if (f.locals == NULL)
+     {
+	field_typesi = SLANG_NULL_TYPE;
+	field_valuesi = (VOID_STAR) &f.locals;
+     }
+   else
+     {
+	if (NULL == (at = _pSLstrings_to_array (f.locals, f.nlocals)))
+	  return;
+
+	field_valuesi = &at;
+	field_typesi = SLANG_ARRAY_TYPE;
+     }
+   i++;
+
+   field_valuesi = (VOID_STAR) &f.ns;
+   if (f.ns == NULL)
+     field_typesi = SLANG_NULL_TYPE;
+   else
+     field_typesi = SLANG_STRING_TYPE;
+   i++;
+
+   (void) SLstruct_create_struct (NUM_INFO_FIELDS, field_names, field_types, field_values);
+
+   if (at != NULL)
+     SLang_free_array (at);
+}
+
+static int get_frame_depth (void)
+{
+   return _pSLang_get_frame_depth ();
+}
+
+static void use_frame_namespace (int *depth)
+{
+   _pSLang_use_frame_namespace (*depth);
+}
+
+#endif
+
+static SLang_Intrin_Fun_Type Intrin_Funs  =
+{
+   MAKE_INTRINSIC_0("_set_bos_handler", set_bos_handler, SLANG_VOID_TYPE),
+   MAKE_INTRINSIC_0("_set_eos_handler", set_eos_handler, SLANG_VOID_TYPE),
+   MAKE_INTRINSIC_0("_set_bof_handler", set_bof_handler, SLANG_VOID_TYPE),
+   MAKE_INTRINSIC_0("_set_eof_handler", set_eof_handler, SLANG_VOID_TYPE),
+#if SLANG_HAS_DEBUGGER_SUPPORT
+   MAKE_INTRINSIC_0("_set_frame_variable", set_frame_variable, SLANG_VOID_TYPE),
+   MAKE_INTRINSIC_IS("_get_frame_variable", get_frame_variable, SLANG_VOID_TYPE),
+   MAKE_INTRINSIC_0("_get_frame_depth", get_frame_depth, SLANG_INT_TYPE),
+   MAKE_INTRINSIC_I("_get_frame_info", get_frame_info, SLANG_VOID_TYPE),
+   MAKE_INTRINSIC_I("_use_frame_namespace", use_frame_namespace, SLANG_VOID_TYPE),
+   MAKE_INTRINSIC_0("_set_debug_hook", set_debug_hook_intrin, SLANG_VOID_TYPE),
+#endif
+   SLANG_END_INTRIN_FUN_TABLE
+};
+
+int _pSLang_init_boseos (void)
+{
+   return SLadd_intrin_fun_table (Intrin_Funs, NULL);
+}
+#endif				       /* SLANG_HAS_BOSEOS */

_service:tar_scm:slang-2.3.2.tar.bz2/src/slbstr.c Added

@@ -0,0 +1,1086 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+struct _pSLang_BString_Type
+{
+ unsigned int num_refs;
+ unsigned int len;
+#define BSTRING_EXTRA_BYTES(len)	(32+(len)/10)
+ unsigned int malloced_len;
+ int ptr_type;
+#define IS_BSTRING		0 /* uses bytes field */
+#define IS_SLSTRING		1 /* uses ptr */
+#define IS_MALLOCED		2 /* uses ptr */
+#define IS_NOT_TO_BE_FREED	3 /* uses ptr */
+ union
+ {
+	unsigned char bytes1;
+	unsigned char *ptr;
+ }
+ v;
+};
+
+#define BS_GET_POINTER(b) \
+ (((b)->ptr_type != IS_BSTRING) ? (b)->v.ptr : (b)->v.bytes)
+
+static SLang_BString_Type *create_bstring_of_type (char *bytes, size_t len, int type)
+{
+ SLang_BString_Type *b;
+ size_t size;
+ size_t malloced_len = len;
+
+ size = sizeof(SLang_BString_Type);
+ if (type == IS_BSTRING)
+ {
+	unsigned int dlen = BSTRING_EXTRA_BYTES(len);
+	malloced_len = len + dlen;
+	if ((malloced_len < len)
+	 || (size + malloced_len < size))
+	 {
+	 SLang_verror (SL_Malloc_Error, "Unable to create a binary string of the desired size");
+	 return NULL;
+	 }
+	size += malloced_len;
+ }
+
+ if (NULL == (b = (SLang_BString_Type *)SLmalloc (size)))
+ return NULL;
+
+ b->len = len;
+ b->malloced_len = malloced_len;
+ b->num_refs = 1;
+ b->ptr_type = type;
+
+ switch (type)
+ {
+ default:
+ case IS_BSTRING:
+	if (bytes != NULL) memcpy ((char *) b->v.bytes, bytes, len);
+	/* Now \0 terminate it because we want to also use it as a C string
+	 * whenever possible. Note that sizeof(SLang_BString_Type) includes
+	 * space for 1 character and we allocated len extra bytes. Thus, it is
+	 * ok to add a \0 to the end.
+	 */
+	b->v.byteslen = 0;
+	break;
+
+ case IS_SLSTRING:
+	if (NULL == (b->v.ptr = (unsigned char *)SLang_create_nslstring (bytes, len)))
+	 {
+	 SLfree ((char *) b);
+	 return NULL;
+	 }
+	break;
+
+ case IS_MALLOCED:
+ case IS_NOT_TO_BE_FREED:
+	b->v.ptr = (unsigned char *)bytes;
+	bytes len = 0;	 /* NULL terminate */
+	break;
+ }
+
+ return b;
+}
+
+SLang_BString_Type *
+SLbstring_create (unsigned char *bytes, SLstrlen_Type len)
+{
+ return create_bstring_of_type ((char *)bytes, len, IS_BSTRING);
+}
+
+/* Note that ptr must be len + 1 bytes long for \0 termination */
+SLang_BString_Type *
+SLbstring_create_malloced (unsigned char *ptr, SLstrlen_Type len, int free_on_error)
+{
+ SLang_BString_Type *b;
+
+ if (ptr == NULL)
+ return NULL;
+
+ if (NULL == (b = create_bstring_of_type ((char *)ptr, len, IS_MALLOCED)))
+ {
+	if (free_on_error)
+	 SLfree ((char *) ptr);
+ }
+ return b;
+}
+
+SLang_BString_Type *SLbstring_create_slstring (SLFUTURE_CONST char *s)
+{
+ if (s == NULL)
+ return NULL;
+
+ return create_bstring_of_type ((char *) s, strlen (s), IS_SLSTRING);
+}
+
+SLang_BString_Type *SLbstring_dup (SLang_BString_Type *b)
+{
+ if (b != NULL)
+ b->num_refs += 1;
+
+ return b;
+}
+
+unsigned char *SLbstring_get_pointer (SLang_BString_Type *b, SLstrlen_Type *len)
+{
+ if (b == NULL)
+ {
+	*len = 0;
+	return NULL;
+ }
+ *len = b->len;
+ return BS_GET_POINTER(b);
+}
+
+void SLbstring_free (SLang_BString_Type *b)
+{
+ if (b == NULL)
+ return;
+
+ if (b->num_refs > 1)
+ {
+	b->num_refs -= 1;
+	return;
+ }
+
+ switch (b->ptr_type)
+ {
+ case IS_BSTRING:
+ case IS_NOT_TO_BE_FREED:
+ default:
+	break;
+
+ case IS_SLSTRING:
+	_pSLang_free_slstring ((char *)b->v.ptr);
+	break;
+
+ case IS_MALLOCED:
+	SLfree ((char *)b->v.ptr);
+	break;
+ }
+
+ SLfree ((char *) b);
+}
+
+int SLang_pop_bstring (SLang_BString_Type **b)
+{
+ return SLclass_pop_ptr_obj (SLANG_BSTRING_TYPE, (VOID_STAR *)b);
+}
+
+int SLang_push_bstring (SLang_BString_Type *b)
+{
+ if (b == NULL)
+ return SLang_push_null ();
+
+ b->num_refs += 1;
+
+ if (0 == SLclass_push_ptr_obj (SLANG_BSTRING_TYPE, (VOID_STAR)b))
+ return 0;
+
+ b->num_refs -= 1;
+ return -1;
+}
+
+static int
+bstring_bstring_bin_op_result (int op, SLtype a, SLtype b,
+			 SLtype *c)
+{
+ (void) a;
+ (void) b;
+ switch (op)
+ {
+ default:
+	return 0;
+
+ case SLANG_PLUS:
+	*c = SLANG_BSTRING_TYPE;
+	break;
+
+ case SLANG_GT:
+ case SLANG_GE:
+ case SLANG_LT:
+ case SLANG_LE:
+ case SLANG_EQ:
+ case SLANG_NE:
+	*c = SLANG_CHAR_TYPE;
+	break;
+ }
+ return 1;
+}
+
+static int compare_bstrings (SLang_BString_Type *a, SLang_BString_Type *b)
+{
+ unsigned int len;
+ int ret;
+
+ len = a->len;
+ if (b->len < len) len = b->len;
+
+ ret = memcmp ((char *)BS_GET_POINTER(a), (char *)BS_GET_POINTER(b), len);
+ if (ret != 0)
+ return ret;
+
+ if (a->len > b->len)
+ return 1;
+ if (a->len == b->len)
+ return 0;
+
+ return -1;
+}
+
+static SLang_BString_Type *
+concat_bstrings (SLang_BString_Type *a, SLang_BString_Type *b)
+{
+ SLuindex_Type len;
+ SLang_BString_Type *c;
+ char *bytes;
+
+ len = a->len + b->len;
+
+#if SLANG_USE_TMP_OPTIMIZATION
+ if ((a->num_refs == 1)	 /* owned by stack */
+ && (a->ptr_type == IS_BSTRING)
+ && (len < a->malloced_len))
+ {
+	bytes = (char *)a->v.bytes;
+	memcpy (bytes + a->len, (char *)BS_GET_POINTER(b), b->len);
+	byteslen = 0;		 /* ok to \0 terminate --- see above */
+	a->len = len;
+	a->num_refs++;
+	return a;
+ }
+#endif
+
+ if (NULL == (c = SLbstring_create (NULL, len)))
+ return NULL;
+
+ bytes = (char *)BS_GET_POINTER(c);
+
+ memcpy (bytes, (char *)BS_GET_POINTER(a), a->len);
+ memcpy (bytes + a->len, (char *)BS_GET_POINTER(b), b->len);
+ byteslen = 0;
+
+ return c;
+}
+
+static void free_n_bstrings (SLang_BString_Type **a, SLuindex_Type n)
+{
+ SLuindex_Type i;
+
+ if (a == NULL) return;
+
+ for (i = 0; i < n; i++)
+ {
+	SLbstring_free (ai);
+	ai = NULL;
+ }
+}
+
+static int
+bstring_bstring_bin_op (int op,
+			SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+			SLtype b_type, VOID_STAR bp, SLuindex_Type nb,
+			VOID_STAR cp)
+{
+ char *ic;
+ SLang_BString_Type **a, **b, **c;
+ SLuindex_Type n, n_max;
+ unsigned int da, db;
+
+ (void) a_type;
+ (void) b_type;
+
+ if (na == 1) da = 0; else da = 1;
+ if (nb == 1) db = 0; else db = 1;
+
+ if (na > nb) n_max = na; else n_max = nb;
+
+ a = (SLang_BString_Type **) ap;
+ b = (SLang_BString_Type **) bp;
+ for (n = 0; n < n_max; n++)
+ {
+	if ((*a == NULL) || (*b == NULL))
+	 {
+	 _pSLang_verror (SL_VARIABLE_UNINITIALIZED,
+			 "Binary string element%lu not initialized for binary operation", (unsigned long)n);
+	 return -1;
+	 }
+	a += da; b += db;
+ }
+
+ a = (SLang_BString_Type **) ap;
+ b = (SLang_BString_Type **) bp;
+ ic = (char *) cp;
+ c = NULL;
+
+ switch (op)
+ {
+ case SLANG_PLUS:
+	/* Concat */
+	c = (SLang_BString_Type **) cp;
+	for (n = 0; n < n_max; n++)
+	 {
+	 if (NULL == (cn = concat_bstrings (*a, *b)))
+	 goto return_error;
+
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_NE:
+	for (n = 0; n < n_max; n++)
+	 {
+	 ic n = (0 != compare_bstrings (*a, *b));
+	 a += da;
+	 b += db;
+	 }
+	break;
+ case SLANG_GT:
+	for (n = 0; n < n_max; n++)
+	 {
+	 ic n = (compare_bstrings (*a, *b) > 0);
+	 a += da;
+	 b += db;
+	 }
+	break;
+ case SLANG_GE:
+	for (n = 0; n < n_max; n++)
+	 {
+	 ic n = (compare_bstrings (*a, *b) >= 0);
+	 a += da;
+	 b += db;
+	 }
+	break;
+ case SLANG_LT:
+	for (n = 0; n < n_max; n++)
+	 {
+	 ic n = (compare_bstrings (*a, *b) < 0);
+	 a += da;
+	 b += db;
+	 }
+	break;
+ case SLANG_LE:
+	for (n = 0; n < n_max; n++)
+	 {
+	 ic n = (compare_bstrings (*a, *b) <= 0);
+	 a += da;
+	 b += db;
+	 }
+	break;
+ case SLANG_EQ:
+	for (n = 0; n < n_max; n++)
+	 {
+	 ic n = (compare_bstrings (*a, *b) == 0);
+	 a += da;
+	 b += db;
+	 }
+	break;
+ }
+ return 1;
+
+ return_error:
+ if (c != NULL)
+ {
+	free_n_bstrings (c, n);
+	while (n < n_max)
+	 {
+	 cn = NULL;
+	 n++;
+	 }
+ }
+ return -1;
+}
+
+/* If preserve_ptr, then use ai as the bstring data. See how this function
+ * is called by the binary op routines for why.
+ */
+static SLang_BString_Type **
+make_n_bstrings (SLang_BString_Type **b, char **a, SLuindex_Type n, int ptr_type)
+{
+ SLuindex_Type i;
+ int malloc_flag;
+
+ malloc_flag = 0;
+ if (b == NULL)
+ {
+	b = (SLang_BString_Type **) _SLcalloc (n, sizeof (SLang_BString_Type *));
+	if (b == NULL)
+	 return NULL;
+	malloc_flag = 1;
+ }
+
+ for (i = 0; i < n; i++)
+ {
+	char *s = ai;
+
+	if (s == NULL)
+	 {
+	 bi = NULL;
+	 continue;
+	 }
+
+	if (NULL == (bi = create_bstring_of_type (s, strlen(s), ptr_type)))
+	 {
+	 free_n_bstrings (b, i);
+	 if (malloc_flag) SLfree ((char *) b);
+	 return NULL;
+	 }
+ }
+
+ return b;
+}
+
+static int
+bstring_string_bin_op (int op,
+		 SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+		 SLtype b_type, VOID_STAR bp, SLuindex_Type nb,
+		 VOID_STAR cp)
+{
+ SLang_BString_Type **b;
+ int ret;
+
+ if (NULL == (b = make_n_bstrings (NULL, (char **)bp, nb, IS_NOT_TO_BE_FREED)))
+ return -1;
+
+ b_type = SLANG_BSTRING_TYPE;
+ ret = bstring_bstring_bin_op (op,
+				 a_type, ap, na,
+				 b_type, (VOID_STAR) b, nb,
+				 cp);
+ free_n_bstrings (b, nb);
+ SLfree ((char *) b);
+ return ret;
+}
+
+static int
+string_bstring_bin_op (int op,
+		 SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+		 SLtype b_type, VOID_STAR bp, SLuindex_Type nb,
+		 VOID_STAR cp)
+{
+ SLang_BString_Type **a;
+ int ret;
+
+ if (NULL == (a = make_n_bstrings (NULL, (char **)ap, na, IS_NOT_TO_BE_FREED)))
+ return -1;
+
+ a_type = SLANG_BSTRING_TYPE;
+ ret = bstring_bstring_bin_op (op,
+				 a_type, (VOID_STAR) a, na,
+				 b_type, bp, nb,
+				 cp);
+ free_n_bstrings (a, na);
+ SLfree ((char *) a);
+
+ return ret;
+}
+
+static void bstring_destroy (SLtype unused, VOID_STAR s)
+{
+ (void) unused;
+ SLbstring_free (*(SLang_BString_Type **) s);
+}
+
+static int bstring_push (SLtype unused, VOID_STAR sptr)
+{
+ (void) unused;
+
+ return SLang_push_bstring (*(SLang_BString_Type **) sptr);
+}
+
+static int string_to_bstring (SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+			 SLtype b_type, VOID_STAR bp)
+{
+ char **s;
+ SLang_BString_Type **b;
+
+ (void) a_type;
+ (void) b_type;
+
+ s = (char **) ap;
+ b = (SLang_BString_Type **) bp;
+
+ if (NULL == make_n_bstrings (b, s, na, IS_SLSTRING))
+ return -1;
+
+ return 1;
+}
+
+static int bstring_to_string (SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+			 SLtype b_type, VOID_STAR bp)
+{
+ char **s;
+ SLuindex_Type i;
+ SLang_BString_Type **a;
+
+ (void) a_type;
+ (void) b_type;
+
+ s = (char **) bp;
+ a = (SLang_BString_Type **) ap;
+
+ for (i = 0; i < na; i++)
+ {
+	SLang_BString_Type *ai = ai;
+
+	if (ai == NULL)
+	 {
+	 si = NULL;
+	 continue;
+	 }
+
+	if (NULL == (si = SLang_create_slstring ((char *)BS_GET_POINTER(ai))))
+	 {
+	 while (i != 0)
+	 {
+		 i--;
+		 _pSLang_free_slstring (si);
+		 si = NULL;
+	 }
+	 return -1;
+	 }
+ }
+
+ return 1;
+}
+
+static size_t Printable_BString_Size = 256;
+static void set_printable_bstring_size (unsigned int *np)
+{
+ unsigned int n = *np;
+ if (n > 0xFFFFU)
+ n = 0xFFFFU;
+ if (n < 16)
+ n = 16;
+
+ Printable_BString_Size = n;
+}
+
+static unsigned int get_printable_bstring_size (void)
+{
+ return (unsigned int) Printable_BString_Size;
+}
+
+static char *bstring_string (SLtype type, VOID_STAR v)
+{
+ SLang_BString_Type *s;
+ unsigned char *buf;
+ unsigned char *bytes, *bytes_max;
+ unsigned char *b, *bmax;
+
+ (void) type;
+
+ s = *(SLang_BString_Type **) v;
+ bytes = BS_GET_POINTER(s);
+ bytes_max = bytes + s->len;
+
+ buf = (unsigned char *)SLmalloc (Printable_BString_Size);
+ if (buf == NULL)
+ return NULL;
+
+ b = buf;
+ bmax = buf + (Printable_BString_Size - 4);
+
+ while (bytes < bytes_max)
+ {
+	unsigned char ch = *bytes;
+
+	if ((ch < 32) || (ch >= 127) || (ch == '\\'))
+	 {
+	 if (b + 4 > bmax)
+	 break;
+
+	 sprintf ((char *) b, "\\%03o", ch);
+	 b += 4;
+	 }
+	else
+	 {
+	 if (b == bmax)
+	 break;
+
+	 *b++ = ch;
+	 }
+
+	bytes++;
+ }
+
+ if (bytes < bytes_max)
+ {
+	*b++ = '.';
+	*b++ = '.';
+	*b++ = '.';
+ }
+ *b = 0;
+
+ /* reduce the size */
+ b = (unsigned char *)SLrealloc ((char *)buf, 1+(b-buf));
+ if (b != NULL) buf = b;
+ return (char *)buf;
+}
+
+static unsigned int bstrlen_cmd (SLang_BString_Type *b)
+{
+ return b->len;
+}
+
+static unsigned int count_byte_occurrences (SLang_BString_Type *b, unsigned char *chp)
+{
+ unsigned char ch = *chp;
+ unsigned char *bytes, *bytes_max;
+ unsigned int n;
+
+ bytes = BS_GET_POINTER(b);
+ bytes_max = bytes + b->len;
+
+ n = 0;
+ while (bytes < bytes_max)
+ {
+	if (*bytes++ == ch)
+	 n++;
+ }
+ return n;
+}
+
+/* returns the 1-based byte offset of substring in a string, or 0 */
+static int issubbytes_1 (SLang_BString_Type *as, SLang_BString_Type *bs, unsigned int ofs0)
+{
+ unsigned int lena, lenb;
+ unsigned char *a, *b, *amax, *bmax, *astart;
+ unsigned char ch0;
+
+ a = BS_GET_POINTER(as);
+ b = BS_GET_POINTER(bs);
+ lena = as->len;
+ lenb = bs->len;
+
+ if (ofs0)
+ {
+	if (lena < ofs0)
+	 return 0;
+	lena -= ofs0;
+	a += ofs0;
+ }
+
+ if ((lenb > lena) || (lenb == 0))
+ return 0;
+
+ lena -= lenb;
+ amax = a + lena;
+ bmax = b + lenb;
+
+ astart = a;
+ ch0 = *b++;
+ while (a <= amax)
+ {
+	unsigned char *a0, *b0;
+
+	if (ch0 != *a++)
+	 continue;
+	a0 = a;
+	b0 = b;
+	while ((b < bmax) && (*a == *b))
+	 {
+	 a++;
+	 b++;
+	 }
+	if (b == bmax)
+	 return ofs0 + (a0 - astart);
+
+	a = a0;
+	b = b0;
+ }
+ return 0;
+}
+
+static SLindex_Type issubbytes (void)
+{
+ SLang_BString_Type *a, *b;
+ SLindex_Type ofs = 0;
+
+ if (SLang_Num_Function_Args == 3)
+ {
+	if (-1 == SLang_pop_array_index (&ofs))
+	 return -1;
+	if (ofs <= 0)
+	 {
+	 SLang_verror (SL_InvalidParm_Error, "1-based offset must be greater than 0");
+	 return -1;
+	 }
+	ofs--;
+ }
+ if (-1 == SLang_pop_bstring (&b))
+ return 0;
+ if (0 == SLang_pop_bstring (&a))
+ {
+	SLuindex_Type uofs = issubbytes_1 (a, b, (SLuindex_Type) ofs);
+	/* 1-based upon return */
+
+	ofs = (SLindex_Type) uofs;
+	SLbstring_free (a);
+ }
+ SLbstring_free (b);
+ return ofs;
+}
+
+static SLang_BString_Type *join_bstrings (SLang_BString_Type **data, SLuindex_Type num, SLang_BString_Type *delim,
+					 int tmp_opt_ok)
+{
+ size_t len;
+ SLuindex_Type i;
+ unsigned char *delim_ptr = NULL, *bytes = NULL;
+ SLstrlen_Type delim_len = 0;
+ SLang_BString_Type *bstr;
+ unsigned char *ptr;
+ SLstrlen_Type dlen;
+
+ (void) tmp_opt_ok;
+
+ if (num == 0)
+ return SLbstring_create ((unsigned char *)"", 0);
+
+ if (delim != NULL)
+ {
+	if (NULL == (delim_ptr = SLbstring_get_pointer (delim, &delim_len)))
+	 return NULL;
+ }
+
+ len = 0;
+ for (i = 0; i < num; i++)
+ {
+	if (datai == NULL)
+	 continue;
+	if (NULL == SLbstring_get_pointer (datai, &dlen))
+	 return NULL;
+
+	len += dlen;
+ }
+
+ len += (num-1) * delim_len;
+
+ if (len != (SLstrlen_Type)len)
+ {
+	SLang_set_error (SL_Malloc_Error);
+	return NULL;
+ }
+
+# if SLANG_USE_TMP_OPTIMIZATION
+ bstr = data0;
+ if (tmp_opt_ok && (bstr != NULL)
+ && (bstr->num_refs == 1)	 /* owned by stack */
+ && (bstr->ptr_type == IS_BSTRING)
+ && (len < bstr->malloced_len))
+ {
+	bytes = (unsigned char *)bstr->v.bytes + bstr->len;
+	bstr->len = len;
+	bstr->num_refs++;
+ }
+ else
+ {
+#endif
+	if (NULL == (bstr = create_bstring_of_type (NULL, len, IS_BSTRING)))
+	 return NULL;
+
+	bytes = bstr->v.bytes;
+
+	if (NULL == (ptr = SLbstring_get_pointer (data0, &dlen)))
+	 goto return_error;
+
+	memcpy (bytes, ptr, dlen);
+	bytes += dlen;
+#if SLANG_USE_TMP_OPTIMIZATION
+ }
+#endif
+
+ for (i = 1; i < num; i++)
+ {
+	if (delim_len)
+	 {
+	 memcpy (bytes, delim_ptr, delim_len);
+	 bytes += delim_len;
+	 }
+	if (datai != NULL)
+	 {
+	 if (NULL == (ptr = SLbstring_get_pointer (datai, &dlen)))
+	 goto return_error;
+	 memcpy (bytes, ptr, dlen);
+	 bytes += dlen;
+	 }
+ }
+ *bytes = 0;
+ return bstr;
+
+return_error:
+
+ SLbstring_free (bstr);
+ return NULL;
+}
+
+static void bstrjoin_cmd (void)
+{
+ SLang_Array_Type *at;
+ SLang_BString_Type *delim, *bstr;
+
+ if (SLang_Num_Function_Args == 1)
+ delim = NULL;
+ else
+ {
+	if (-1 == SLang_pop_bstring (&delim))
+	 return;
+ }
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_BSTRING_TYPE))
+ {
+	if (delim != NULL)
+	 SLbstring_free (delim);
+	return;
+ }
+
+ bstr = join_bstrings ((SLang_BString_Type **)at->data, at->num_elements, delim, 0);
+ if (bstr != NULL)
+ {
+	(void) SLang_push_bstring (bstr);
+	SLbstring_free (bstr);
+ }
+ if (delim != NULL) SLbstring_free (delim);
+ SLang_free_array (at);
+}
+
+static void bstrcat_cmd (void) /*{{{*/
+{
+ SLang_BString_Type *bstrings_buf10;
+ SLang_BString_Type **bstrings, *bstr;
+ int i, nargs;
+
+ nargs = SLang_Num_Function_Args;
+ if (nargs <= 0) nargs = 2;
+
+ if (nargs <= 10)
+ bstrings = bstrings_buf;
+ else if (NULL == (bstrings = (SLang_BString_Type **)_SLcalloc (nargs, sizeof (SLang_BString_Type *))))
+ return;
+
+ memset ((char *) bstrings, 0, sizeof (SLang_BString_Type *) * nargs);
+
+ i = nargs;
+ while (i != 0)
+ {
+	i--;
+
+	if (-1 == SLang_pop_bstring (bstrings + i))
+	 goto free_and_return;
+ }
+
+ bstr = join_bstrings (bstrings, nargs, NULL, 1);
+ if (bstr != NULL)
+ {
+	(void) SLang_push_bstring (bstr);
+	SLbstring_free (bstr);
+ }
+ /* drop */
+
+free_and_return:
+ for (i = 0; i < nargs; i++)
+ SLbstring_free (bstringsi);
+
+ if (bstrings != bstrings_buf)
+ SLfree ((char *) bstrings);
+}
+
+static SLang_Intrin_Fun_Type BString_Table = /*{{{*/
+{
+ MAKE_INTRINSIC_1("bstrlen", bstrlen_cmd, SLANG_UINT_TYPE, SLANG_BSTRING_TYPE),
+ MAKE_INTRINSIC_0("bstrcat", bstrcat_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("bstrjoin", bstrjoin_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_2("count_byte_occurances", count_byte_occurrences, SLANG_UINT_TYPE, SLANG_BSTRING_TYPE, SLANG_UCHAR_TYPE),
+ MAKE_INTRINSIC_2("count_byte_occurrences", count_byte_occurrences, SLANG_UINT_TYPE, SLANG_BSTRING_TYPE, SLANG_UCHAR_TYPE),
+ MAKE_INTRINSIC_0("pack", _pSLpack, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_2("unpack", _pSLunpack, SLANG_VOID_TYPE, SLANG_STRING_TYPE, SLANG_BSTRING_TYPE),
+ MAKE_INTRINSIC_1("pad_pack_format", _pSLpack_pad_format, SLANG_VOID_TYPE, SLANG_STRING_TYPE),
+ MAKE_INTRINSIC_1("sizeof_pack", _pSLpack_compute_size, SLANG_UINT_TYPE, SLANG_STRING_TYPE),
+ MAKE_INTRINSIC_0("is_substrbytes", issubbytes, SLANG_ARRAY_INDEX_TYPE),
+ MAKE_INTRINSIC_1("set_printable_bstring_size", set_printable_bstring_size, SLANG_VOID_TYPE, SLANG_UINT_TYPE),
+ MAKE_INTRINSIC_0("get_printable_bstring_size", get_printable_bstring_size, SLANG_UINT_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+struct _pSLang_Foreach_Context_Type
+{
+ SLang_BString_Type *bstr;
+ unsigned char *s, *smax;	 /* pointers into string */
+ int using_chars;
+};
+
+SLang_Foreach_Context_Type *
+_pSLbstring_foreach_open (SLtype type, unsigned int num)
+{
+ char *u;
+ SLang_Foreach_Context_Type *c;
+ int using_chars = 0;
+ SLang_BString_Type *bstr;
+ SLstrlen_Type len;
+
+ (void) type;
+
+ if (-1 == SLang_pop_bstring (&bstr))
+ return NULL;
+
+ switch (num)
+ {
+ case 1:
+	if (-1 == SLang_pop_slstring (&u))
+	 {
+	 SLbstring_free (bstr);
+	 return NULL;
+	 }
+	if (0 == strcmp (u, "chars"))
+	 using_chars = 1;
+	else if (0 == strcmp (u, "bytes"))
+	 using_chars = 0;
+	else
+	 {
+	 _pSLang_verror (SL_InvalidParm_Error, "Expected foreach (BString_Type) using (chars|bytes)");
+	 SLang_free_slstring (u);
+	 SLbstring_free (bstr);
+	 return NULL;
+	 }
+	SLang_free_slstring (u);
+ 	break;
+
+ case 0:
+	using_chars = 0;
+	break;
+ default:
+	_pSLang_verror (SL_NumArgs_Error,
+		 "'foreach (BString_Type) using' requires single control value (chars|bytes)");
+	return NULL;
+ }
+
+ /* In UTF-8 mode, chars and bytes are synonymous */
+ if (_pSLinterp_UTF8_Mode == 0)
+ using_chars = 0;
+
+ c = (SLang_Foreach_Context_Type *)SLmalloc (sizeof (SLang_Foreach_Context_Type));
+ if (c == NULL)
+ {
+	SLbstring_free (bstr);
+	return NULL;
+ }
+
+ memset ((char *) c, 0, sizeof (SLang_Foreach_Context_Type));
+
+ c->bstr = bstr;
+ c->s = SLbstring_get_pointer (bstr, &len);
+ c->smax = c->s + len;
+ c->using_chars = using_chars;
+ return c;
+}
+
+void _pSLbstring_foreach_close (SLtype type, SLang_Foreach_Context_Type *c)
+{
+ (void) type;
+ if (c == NULL) return;
+ SLbstring_free (c->bstr);
+ SLfree ((char *) c);
+}
+
+int _pSLbstring_foreach (SLtype type, SLang_Foreach_Context_Type *c)
+{
+ SLwchar_Type wch;
+ unsigned char *s, *s1, *smax;
+
+ (void) type;
+
+ s = c->s;
+ smax = c->smax;
+ if (s == smax)
+ return 0;
+
+ if (c->using_chars == 0)
+ {
+	unsigned char ch = (unsigned char) *s++;
+	c->s = s;
+
+	if (-1 == SLclass_push_char_obj (SLANG_UCHAR_TYPE, ch))
+	 return -1;
+
+	return 1;
+ }
+ s1 = SLutf8_decode (s, smax, &wch, NULL);
+ if (s1 == NULL)
+ {
+	int iwch = (int) *s;
+	c->s = s + 1;
+	/* Invalid encoded char-- return it as a negative int */
+	if (-1 == SLang_push_int (-iwch))
+	 return -1;
+
+	return 1;
+ }
+ c->s = s1;
+ if (-1 == SLang_push_wchar (wch))
+ return -1;
+
+ return 1;
+}
+
+static void bstring_inc_ref (SLtype type, VOID_STAR ptr, int dr)
+{
+ (void) type;
+ (*(SLang_BString_Type **) ptr)->num_refs += dr;
+}
+
+int _pSLang_init_bstring (void)
+{
+ SLang_Class_Type *cl;
+
+ if (NULL == (cl = SLclass_allocate_class ("BString_Type")))
+ return -1;
+ (void) SLclass_set_destroy_function (cl, bstring_destroy);
+ (void) SLclass_set_push_function (cl, bstring_push);
+ (void) SLclass_set_string_function (cl, bstring_string);
+ cl->cl_inc_ref = bstring_inc_ref;
+
+ if (-1 == SLclass_register_class (cl, SLANG_BSTRING_TYPE, sizeof (char *),
+				 SLANG_CLASS_TYPE_PTR))
+ return -1;
+
+ if ((-1 == SLclass_add_typecast (SLANG_BSTRING_TYPE, SLANG_STRING_TYPE, bstring_to_string, 1))
+ || (-1 == SLclass_add_typecast (SLANG_STRING_TYPE, SLANG_BSTRING_TYPE, string_to_bstring, 1))
+ || (-1 == SLclass_add_binary_op (SLANG_STRING_TYPE, SLANG_BSTRING_TYPE, string_bstring_bin_op, bstring_bstring_bin_op_result))
+ || (-1 == SLclass_add_binary_op (SLANG_BSTRING_TYPE, SLANG_STRING_TYPE, bstring_string_bin_op, bstring_bstring_bin_op_result))
+ || (-1 == SLclass_add_binary_op (SLANG_BSTRING_TYPE, SLANG_BSTRING_TYPE, bstring_bstring_bin_op, bstring_bstring_bin_op_result)))
+ return -1;
+
+ cl->cl_foreach_open = _pSLbstring_foreach_open;
+ cl->cl_foreach_close = _pSLbstring_foreach_close;
+ cl->cl_foreach = _pSLbstring_foreach;
+
+ if (-1 == SLadd_intrin_fun_table (BString_Table, NULL))
+ return -1;
+
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slclass.c Added

@@ -0,0 +1,2002 @@
+/* User defined objects */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+#include <errno.h>
+
+/* #define SL_APP_WANTS_FOREACH */
+#include "slang.h"
+#include "_slang.h"
+
+/* This implementation of the class tables assumes SLtype is 16 bit */
+typedef struct
+{
+ SLang_Class_Type *classes256;
+ unsigned int nclasses;
+}
+Class_Table_Type;
+static Class_Table_Type *Class_Tables256;
+
+static void add_class_to_slot (Class_Table_Type *t, SLang_Class_Type **clp,
+			 SLang_Class_Type *cl)
+{
+ *clp = cl;
+ t->nclasses++;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ _pSLang_set_class_info (cl->cl_data_type, cl);
+#endif
+}
+
+static SLang_Class_Type *lookup_class (SLtype type)
+{
+ Class_Table_Type *t;
+
+ t = Class_Tables(type >> 8)&0xFF;
+
+ if (t == NULL)
+ return NULL;
+ return t->classestype & 0xFF;
+}
+
+static SLang_Class_Type **alloc_class_slot (SLtype type, Class_Table_Type **tp)
+{
+ unsigned int i;
+ Class_Table_Type *t;
+
+ if ((type&0xFFFF) != type)
+ {
+	_pSLang_verror (SL_APPLICATION_ERROR, "Class-Id larger than 0xFFFF is not supported");
+	return NULL;
+ }
+
+ i = ((type >> 8) & 0xFF);
+ if (NULL == (t = Class_Tablesi))
+ {
+	t = (Class_Table_Type *)SLcalloc (1, sizeof (Class_Table_Type));
+	if (t == NULL)
+	 return NULL;
+	Class_Tablesi = t;
+ }
+ *tp = t;
+ return t->classes + (type&0xFF);
+}
+
+static SLang_Class_Type **find_empty_class_slot (SLtype *typep, Class_Table_Type **tp)
+{
+ unsigned int i;
+ Class_Table_Type *t;
+ SLtype type;
+
+ /* Class_Tables0 is reserved (0 <= SLtype < 256) by interpreter */
+ for (i = 1; i < 256; i++)
+ {
+	unsigned int j;
+	SLang_Class_Type **clp;
+
+	if (NULL == (t = Class_Tablesi))
+	 {
+	 type = (SLtype) (i << 8);
+	 clp = alloc_class_slot (type, &t);
+	 if (clp != NULL)
+	 {
+		 *typep = type;
+		 *tp = t;
+	 }
+	 return clp;
+	 }
+
+	if (t->nclasses == 256)
+	 continue;
+
+	clp = t->classes;
+
+	for (j = 0; j < 256; j++)
+	 {
+	 if (clpj == NULL)
+	 {
+		 *typep = (SLtype) ((i << 8) | j);
+		 *tp = t;
+		 return clp + j;
+	 }
+	 }
+
+	_pSLang_verror (SL_INTERNAL_ERROR, "Class table nclasses variable is out of sync");
+	return NULL;
+ }
+
+ return NULL;
+}
+
+static SLang_Class_Type *lookup_class_by_name (SLCONST char *name)
+{
+ unsigned int i;
+
+ for (i = 0; i < 256; i++)
+ {
+	Class_Table_Type *t = Class_Tablesi;
+	SLang_Class_Type **clp, **clpmax;
+
+	if (t == NULL)
+	 continue;
+
+	clp = t->classes;
+	clpmax = t->classes + 256;
+
+	while (clp < clpmax)
+	 {
+	 SLang_Class_Type *cl;
+	 if ((NULL != (cl = *clp))
+		 && (0 == strcmp (cl->cl_name, name)))
+	 return cl;
+	 clp++;
+	 }
+ }
+ return NULL;
+}
+
+SLang_Class_Type *_pSLclass_get_class (SLtype type)
+{
+ SLang_Class_Type *cl;
+
+ if (NULL == (cl = lookup_class (type)))
+ SLang_exit_error ("Application error: Type %d not registered", (int) type);
+
+ return cl;
+}
+
+int SLclass_is_class_defined (SLtype type)
+{
+ return (NULL != lookup_class (type));
+}
+
+int _pSLclass_copy_class (SLtype to, SLtype from)
+{
+ SLang_Class_Type *cl, **clp;
+ Class_Table_Type *t;
+
+ cl = _pSLclass_get_class (from);
+ if (NULL == (clp = alloc_class_slot (to, &t)))
+ return -1;
+
+ if (*clp != NULL)
+ {
+	_pSLang_verror (SL_APPLICATION_ERROR, "Class %d already exists", to);
+	SLang_exit_error ("Application error: Fatal error");
+ }
+ add_class_to_slot (t, clp, cl);
+#if SLANG_OPTIMIZE_FOR_SPEED
+ _pSLang_set_class_info (to, cl);
+#endif
+ return 0;
+}
+
+VOID_STAR _pSLclass_get_ptr_to_value (SLang_Class_Type *cl,
+				 SLang_Object_Type *obj)
+{
+ VOID_STAR p;
+
+ switch (cl->cl_class_type)
+ {
+ case SLANG_CLASS_TYPE_MMT:
+ case SLANG_CLASS_TYPE_PTR:
+ case SLANG_CLASS_TYPE_SCALAR:
+	p = (VOID_STAR) &obj->v;
+	break;
+
+ case SLANG_CLASS_TYPE_VECTOR:
+	p = obj->v.ptr_val;
+	break;
+
+ default:
+	p = NULL;
+ }
+ return p;
+}
+
+SLFUTURE_CONST char *SLclass_get_datatype_name (SLtype stype)
+{
+ SLang_Class_Type *cl;
+
+ cl = _pSLclass_get_class (stype);
+ return cl->cl_name;
+}
+
+static int method_undefined_error (SLtype type, SLCONST char *method, SLCONST char *name)
+{
+ if (name == NULL) name = SLclass_get_datatype_name (type);
+
+ _pSLang_verror (SL_TYPE_MISMATCH, "%s method not defined for %s",
+		 method, name);
+ return -1;
+}
+
+static int
+scalar_vector_bin_op_result (int op, SLtype a, SLtype b,
+			 SLtype *c)
+{
+ (void) a; (void) b;
+ switch (op)
+ {
+ case SLANG_NE:
+ case SLANG_EQ:
+	*c = SLANG_CHAR_TYPE;
+	return 1;
+ }
+ return 0;
+}
+
+static int
+scalar_vector_bin_op (int op,
+		 SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+		 SLtype b_type, VOID_STAR bp, SLuindex_Type nb,
+		 VOID_STAR cp)
+{
+ char *c;
+ char *a, *b;
+ size_t da, db;
+ SLuindex_Type n, n_max;
+ size_t data_type_len;
+ SLang_Class_Type *cl;
+
+ (void) b_type;
+ cl = _pSLclass_get_class (a_type);
+
+ data_type_len = cl->cl_sizeof_type;
+
+ a = (char *) ap;
+ b = (char *) bp;
+ c = (char *) cp;
+
+ if (na == 1) da = 0; else da = data_type_len;
+ if (nb == 1) db = 0; else db = data_type_len;
+ if (na > nb) n_max = na; else n_max = nb;
+
+ switch (op)
+ {
+ default:
+	return 0;
+
+ case SLANG_NE:
+	for (n = 0; n < n_max; n++)
+	 {
+	 cn = (0 != memcmp (a, b, data_type_len));
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_EQ:
+	for (n = 0; n < n_max; n++)
+	 {
+	 cn = (0 == memcmp (a, b, data_type_len));
+	 a += da; b += db;
+	 }
+	break;
+ }
+ return 1;
+}
+
+static int scalar_fread (SLtype type, FILE *fp, VOID_STAR ptr,
+			 SLstrlen_Type desired, SLstrlen_Type *actual)
+{
+ char *buf = (char *)ptr;
+ size_t desired_bytes, actual_bytes;
+ size_t size = _pSLclass_get_class (type)->cl_sizeof_type;
+
+ desired_bytes = size * desired;
+ actual_bytes = 0;
+
+ while (desired_bytes)
+ {
+	size_t n;
+	int e;
+
+	errno = 0;
+	clearerr (fp);
+	n = fread (buf, 1, desired_bytes, fp);
+
+	actual_bytes += n;
+	if (n == desired_bytes)
+	 break;
+
+	e = errno;
+	desired_bytes -= n;
+	buf += n;
+
+	/* clearerr (fp); */
+#ifdef EINTR
+	if ((e == EINTR)
+	 && (0 == SLang_handle_interrupt ()))
+	 continue;
+#endif
+	_pSLerrno_errno = e;
+	break;
+ }
+
+ if (actual_bytes % size)
+ {
+	/* Sigh. We failed to read a full object. */
+ }
+ *actual = actual_bytes / size;
+ return 0;
+}
+
+static int scalar_fwrite (SLtype type, FILE *fp, VOID_STAR ptr,
+			 SLstrlen_Type desired, SLstrlen_Type *actual)
+{
+ char *buf = (char *)ptr;
+ size_t desired_bytes, actual_bytes;
+ size_t size = _pSLclass_get_class (type)->cl_sizeof_type;
+
+ desired_bytes = size * desired;
+ actual_bytes = 0;
+
+ while (desired_bytes)
+ {
+	size_t n;
+	int e;
+
+	errno = 0;
+	clearerr (fp);
+	n = fwrite (buf, 1, desired_bytes, fp);
+
+	actual_bytes += n;
+	if (n == desired_bytes)
+	 break;
+
+	e = errno;
+	desired_bytes -= n;
+	buf += n;
+
+	/* clearerr (fp); */
+#ifdef EINTR
+	if ((e == EINTR)
+	 && (0 == SLang_handle_interrupt ()))
+	 continue;
+#endif
+	_pSLerrno_errno = e;
+
+	/* Apparantly, the write can be interrupted returning a short item
+	 * count but not set errno.
+	 */
+	if (n == 0)
+	 break;
+
+	/* See the comment in slstdio.c:signal_safe_fputs about this */
+#ifdef EPIPE
+	if (e == EPIPE)
+	 break;
+#endif
+ }
+
+ if (actual_bytes % size)
+ {
+	/* Sigh. We failed to write out a full object. */
+ }
+ *actual = actual_bytes / size;
+ return 0;
+}
+
+static int vector_apush (SLtype type, VOID_STAR ptr)
+{
+ SLang_Class_Type *cl;
+
+ cl = _pSLclass_get_class (type);
+ return (*cl->cl_push)(type, (VOID_STAR) &ptr);
+}
+
+static int vector_apop (SLtype type, VOID_STAR ptr)
+{
+ SLang_Class_Type *cl;
+
+ cl = _pSLclass_get_class (type);
+ return (*cl->cl_pop)(type, (VOID_STAR) &ptr);
+}
+
+static int default_push_mmt (SLtype type_unused, VOID_STAR ptr)
+{
+ SLang_MMT_Type *ref;
+
+ (void) type_unused;
+ ref = *(SLang_MMT_Type **) ptr;
+ return SLang_push_mmt (ref);
+}
+
+static void default_destroy_simple (SLtype type_unused, VOID_STAR ptr_unused)
+{
+ (void) type_unused;
+ (void) ptr_unused;
+}
+
+static void default_destroy_user (SLtype type, VOID_STAR ptr)
+{
+ (void) type;
+ SLang_free_mmt (*(SLang_MMT_Type **) ptr);
+}
+
+static int default_pop (SLtype type, VOID_STAR ptr)
+{
+ return SLclass_pop_ptr_obj (type, (VOID_STAR *) ptr);
+}
+
+static int default_datatype_deref (SLtype type)
+{
+ return method_undefined_error (type, "datatype_deref", NULL);
+}
+
+static int default_acopy (SLtype type, VOID_STAR from, VOID_STAR to)
+{
+ SLang_Class_Type *cl;
+
+ cl = _pSLclass_get_class (type);
+ if (-1 == (*cl->cl_apush) (type, from))
+ return -1;
+ return (*cl->cl_apop) (type, to);
+}
+
+static int scalar_acopy (SLtype type, VOID_STAR from, VOID_STAR to)
+{
+ memcpy ((char *)to, (char *)from, _pSLclass_get_class (type)->cl_sizeof_type);
+ return 0;
+}
+
+int SLclass_dup_object (SLtype type, VOID_STAR from, VOID_STAR to)
+{
+ SLang_Class_Type *cl = _pSLclass_get_class (type);
+ return cl->cl_acopy (type, from, to);
+}
+
+static int default_dereference_object (SLtype type, VOID_STAR ptr)
+{
+ (void) ptr;
+ return method_undefined_error (type, "dereference", NULL);
+}
+
+static char *default_string (SLtype stype, VOID_STAR v)
+{
+ char buf 256;
+ char *s;
+#if SLANG_HAS_COMPLEX
+ double *cplx;
+#endif
+ s = buf;
+
+ switch (stype)
+ {
+ case SLANG_STRING_TYPE:
+	s = *(char **) v;
+	break;
+
+ case SLANG_NULL_TYPE:
+	s = (char *) "NULL";
+	break;
+
+ case SLANG_DATATYPE_TYPE:
+	s = (char *) SLclass_get_datatype_name ((SLtype) *(int *)v);
+	break;
+
+#if SLANG_HAS_COMPLEX
+ case SLANG_COMPLEX_TYPE:
+	cplx = *(double **) v;
+	if (cplx1 < 0)
+	 sprintf (s, "(%g - %gi)", cplx 0, -cplx 1);
+	else
+	 sprintf (s, "(%g + %gi)", cplx 0, cplx 1);
+	break;
+#endif
+ default:
+	s = (char *) SLclass_get_datatype_name (stype);
+ }
+
+ return SLmake_string (s);
+}
+
+static int
+use_cmp_bin_op_result (int op, SLtype a, SLtype b,
+		 SLtype *c)
+{
+ if (a != b)
+ return 0;
+ switch (op)
+ {
+ case SLANG_NE:
+ case SLANG_EQ:
+ case SLANG_LT:
+ case SLANG_LE:
+ case SLANG_GT:
+ case SLANG_GE:
+	*c = SLANG_INT_TYPE;
+	return 1;
+ }
+ return 0;
+}
+
+static int
+use_cmp_bin_op (int op,
+		SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+		SLtype b_type, VOID_STAR bp, SLuindex_Type nb,
+		VOID_STAR cp)
+{
+ int *c;
+ char *a, *b;
+ SLuindex_Type da, db;
+ SLuindex_Type n, n_max;
+ size_t data_type_len;
+ SLang_Class_Type *cl;
+ int (*cmp)(SLtype, VOID_STAR, VOID_STAR, int *);
+
+ (void) b_type;
+ cl = _pSLclass_get_class (a_type);
+ cmp = cl->cl_cmp;
+ data_type_len = cl->cl_sizeof_type;
+
+ a = (char *) ap;
+ b = (char *) bp;
+ c = (int *) cp;
+
+ if (na == 1) da = 0; else da = data_type_len;
+ if (nb == 1) db = 0; else db = data_type_len;
+ if (na > nb) n_max = na; else n_max = nb;
+
+ switch (op)
+ {
+	int result;
+
+ default:
+	return 0;
+
+ case SLANG_NE:
+	for (n = 0; n < n_max; n++)
+	 {
+	 if (-1 == (*cmp) (a_type, (VOID_STAR)a, (VOID_STAR)b, &result))
+	 return -1;
+	 cn = (result != 0);
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_EQ:
+	for (n = 0; n < n_max; n++)
+	 {
+	 if (-1 == (*cmp) (a_type, (VOID_STAR)a, (VOID_STAR)b, &result))
+	 return -1;
+	 cn = (result == 0);
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_GT:
+	for (n = 0; n < n_max; n++)
+	 {
+	 if (-1 == (*cmp) (a_type, (VOID_STAR)a, (VOID_STAR)b, &result))
+	 return -1;
+	 cn = (result > 0);
+	 a += da; b += db;
+	 }
+	break;
+ case SLANG_GE:
+	for (n = 0; n < n_max; n++)
+	 {
+	 if (-1 == (*cmp) (a_type, (VOID_STAR)a, (VOID_STAR)b, &result))
+	 return -1;
+	 cn = (result >= 0);
+	 a += da; b += db;
+	 }
+	break;
+ case SLANG_LT:
+	for (n = 0; n < n_max; n++)
+	 {
+	 if (-1 == (*cmp) (a_type, (VOID_STAR)a, (VOID_STAR)b, &result))
+	 return -1;
+	 cn = (result < 0);
+	 a += da; b += db;
+	 }
+	break;
+ case SLANG_LE:
+	for (n = 0; n < n_max; n++)
+	 {
+	 if (-1 == (*cmp) (a_type, (VOID_STAR)a, (VOID_STAR)b, &result))
+	 return -1;
+	 cn = (result <= 0);
+	 a += da; b += db;
+	 }
+	break;
+ }
+ return 1;
+}
+
+int _pSLclass_is_same_obj (SLang_Object_Type *a, SLang_Object_Type *b)
+{
+ SLang_Class_Type *cl;
+ size_t sizeof_type;
+
+ if (a->o_data_type != b->o_data_type)
+ return 0;
+
+ cl = _pSLclass_get_class (a->o_data_type);
+ sizeof_type = cl->cl_sizeof_type;
+
+ switch (cl->cl_class_type)
+ {
+ case SLANG_CLASS_TYPE_MMT:
+ case SLANG_CLASS_TYPE_PTR:
+	return (a->v.ptr_val == b->v.ptr_val);
+
+ case SLANG_CLASS_TYPE_SCALAR:
+	return !memcmp (&a->v, &b->v, sizeof_type);
+
+ case SLANG_CLASS_TYPE_VECTOR:
+	return !memcmp (a->v.ptr_val, b->v.ptr_val, sizeof_type);
+ }
+ return 0;
+}
+
+static int do_default_eqs (SLang_Class_Type *a_cl, VOID_STAR pa,
+			 SLang_Class_Type *b_cl, VOID_STAR pb)
+{
+ SLang_Class_Type *c_cl;
+ int (*binary_fun) (int,
+		 SLtype, VOID_STAR, SLuindex_Type,
+		 SLtype, VOID_STAR, SLuindex_Type,
+		 VOID_STAR);
+ VOID_STAR pc;
+ int ret;
+
+ if (NULL == (binary_fun = _pSLclass_get_binary_fun (SLANG_EQ, a_cl, b_cl, &c_cl, 0)))
+ {
+	if (a_cl != b_cl)
+	 return 0;
+
+	switch (a_cl->cl_class_type)
+	 {
+	 case SLANG_CLASS_TYPE_MMT:
+	 case SLANG_CLASS_TYPE_PTR:
+	 return (*(VOID_STAR *)pa == *(VOID_STAR *)pb);
+
+	 case SLANG_CLASS_TYPE_SCALAR:
+	 case SLANG_CLASS_TYPE_VECTOR:
+	 return !memcmp ((char *)pa, (char *)pb, a_cl->cl_sizeof_type);
+	 }
+	return 0;
+ }
+
+ pc = c_cl->cl_transfer_buf;
+
+ if (1 != (*binary_fun) (SLANG_EQ, a_cl->cl_data_type, pa, 1, b_cl->cl_data_type, pb, 1, pc))
+ return 0;
+
+ /* apush will create a copy, so make sure we free after the push */
+ ret = (*c_cl->cl_apush)(c_cl->cl_data_type, pc);
+ (*c_cl->cl_adestroy)(c_cl->cl_data_type, pc);
+
+ if (ret != 0)
+ return -1;
+
+ if (-1 == SLang_pop_integer (&ret))
+ return -1;
+
+ return (ret != 0);
+}
+
+/* This stack business is necessary to avoid problems with circular references */
+typedef struct Eqs_Stack_Type
+{
+ SLang_Object_Type *a, *b;
+ struct Eqs_Stack_Type *next;
+}
+Eqs_Stack_Type;
+static Eqs_Stack_Type *Eqs_Stack;
+static int push_eqs_comparison (SLang_Object_Type *a, SLang_Object_Type *b)
+{
+ Eqs_Stack_Type *s = Eqs_Stack;
+ while (s != NULL)
+ {
+	if (((s->a == a) && (s->b == b))
+	 || ((s->b == a) || (s->a == b)))
+	 return 1;
+
+	s = s->next;
+ }
+ s = (Eqs_Stack_Type *) SLmalloc (sizeof (Eqs_Stack_Type));
+ if (s == NULL)
+ return -1;
+ s->a = a;
+ s->b = b;
+ s->next = Eqs_Stack;
+ Eqs_Stack = s;
+ return 0;
+}
+
+static void pop_eqs_comparison (void)
+{
+ Eqs_Stack_Type *s = Eqs_Stack;
+ Eqs_Stack = s->next;
+ SLfree ((char *) s);
+}
+
+int _pSLclass_obj_eqs (SLang_Object_Type *a, SLang_Object_Type *b)
+{
+ SLang_Class_Type *a_cl, *b_cl;
+ VOID_STAR pa, pb;
+ int (*eqs)(SLtype, VOID_STAR, SLtype, VOID_STAR);
+ int status;
+
+ a_cl = _pSLclass_get_class (a->o_data_type);
+ b_cl = _pSLclass_get_class (b->o_data_type);
+
+ pa = _pSLclass_get_ptr_to_value (a_cl, a);
+ pb = _pSLclass_get_ptr_to_value (b_cl, b);
+
+ if ((pa == NULL) || (pb == NULL))
+ return -1;
+
+ if ((NULL == (eqs = a_cl->cl_eqs))
+ && (NULL == (eqs = b_cl->cl_eqs)))
+ return do_default_eqs (a_cl, pa, b_cl, pb);
+
+ status = push_eqs_comparison (a, b);
+ if (status != 0)
+ return status;
+
+ status = (*eqs) (a->o_data_type, pa, b->o_data_type, pb);
+ pop_eqs_comparison ();
+ return status;
+}
+
+int SLclass_get_class_id (SLang_Class_Type *cl)
+{
+ if (cl == NULL)
+ return -1;
+ return (int) cl->cl_data_type;
+}
+
+SLang_Class_Type *SLclass_allocate_class (SLFUTURE_CONST char *name)
+{
+ SLang_Class_Type *cl;
+
+ if (NULL != (cl = lookup_class_by_name (name)))
+ {
+	_pSLang_verror (SL_DUPLICATE_DEFINITION, "Type name %s already exists", name);
+	return NULL;
+ }
+
+ cl = (SLang_Class_Type *) SLmalloc (sizeof (SLang_Class_Type));
+ if (cl == NULL) return NULL;
+
+ SLMEMSET ((char *) cl, 0, sizeof (SLang_Class_Type));
+
+ if (NULL == (cl->cl_name = SLang_create_slstring (name)))
+ {
+	SLfree ((char *) cl);
+	return NULL;
+ }
+
+ return cl;
+}
+
+int SLang_push_datatype (SLtype data_type)
+{
+ /* This data type could be a copy of another type, e.g., short and
+ * int if they are the same size (Int16 == Short). So, make sure
+ * we push the original and not the copy.
+ */
+ data_type = _pSLclass_get_class (data_type)->cl_data_type;
+ return SLclass_push_int_obj (SLANG_DATATYPE_TYPE, data_type);
+}
+
+static int datatype_deref (SLtype type, VOID_STAR ptr)
+{
+ SLang_Class_Type *cl;
+ int status;
+
+ /* The parser generated code for this as if a function call were to be
+ * made. However, we are calling the deref object routine
+ * instead of the function call. So, I must simulate the function call.
+ */
+ if (-1 == _pSL_increment_frame_pointer ())
+ return -1;
+
+ type = (SLtype) *(int *) ptr;
+ cl = _pSLclass_get_class (type);
+ status = (*cl->cl_datatype_deref) (type);
+
+ (void) _pSL_decrement_frame_pointer ();
+ return status;
+}
+
+static int datatype_push (SLtype type_unused, VOID_STAR ptr)
+{
+ (void) type_unused;
+ return SLang_push_datatype (*(SLtype *) ptr);
+}
+
+int SLang_pop_datatype (SLtype *type)
+{
+ int i;
+ if (-1 == SLclass_pop_int_obj (SLANG_DATATYPE_TYPE, &i))
+ return -1;
+
+ *type = (SLtype) i;
+ return 0;
+}
+
+static int datatype_pop (SLtype type, VOID_STAR ptr)
+{
+ if (-1 == SLang_pop_datatype (&type))
+ return -1;
+
+ *(SLtype *) ptr = type;
+ return 0;
+}
+
+int _pSLclass_init (void)
+{
+ SLang_Class_Type *cl;
+
+ /* First initialize the container classes. This is so binary operations
+ * added later will work with them.
+ */
+ if (-1 == _pSLarray_init_slarray ())
+ return -1;
+
+ /* DataType_Type */
+ if (NULL == (cl = SLclass_allocate_class ("DataType_Type")))
+ return -1;
+ cl->cl_pop = datatype_pop;
+ cl->cl_push = datatype_push;
+ cl->cl_dereference = datatype_deref;
+ if (-1 == SLclass_register_class (cl, SLANG_DATATYPE_TYPE, sizeof(SLtype),
+				 SLANG_CLASS_TYPE_SCALAR))
+ return -1;
+
+ return 0;
+}
+
+static int register_new_datatype (SLFUTURE_CONST char *name, SLtype type)
+{
+ return SLns_add_iconstant (NULL, name, SLANG_DATATYPE_TYPE, type);
+}
+
+int SLclass_create_synonym (SLFUTURE_CONST char *name, SLtype type)
+{
+ if (NULL == _pSLclass_get_class (type))
+ return -1;
+
+ return register_new_datatype (name, type);
+}
+
+int SLclass_register_class (SLang_Class_Type *cl, SLtype type, unsigned int type_size, SLclass_Type class_type)
+{
+ Class_Table_Type *t = NULL;
+ SLang_Class_Type **clp;
+ char *name;
+ int can_binop = 1;		 /* scalar_vector_bin_op should work
+					* for all data types.
+					*/
+
+ if (type == SLANG_VOID_TYPE)
+ clp = find_empty_class_slot (&type, &t);
+ else
+ clp = alloc_class_slot (type, &t);
+
+ if (clp == NULL)
+ {
+	_pSLang_verror (SL_APPLICATION_ERROR, "Class type %d already in use", (int) type);
+	return -1;
+ }
+
+ cl->cl_data_type = type;
+ cl->cl_class_type = class_type;
+ name = cl->cl_name;
+
+ switch (class_type)
+ {
+ case SLANG_CLASS_TYPE_MMT:
+	if (cl->cl_push == NULL) cl->cl_push = default_push_mmt;
+	if (cl->cl_destroy == NULL)
+	 return method_undefined_error (type, "destroy", name);
+	cl->cl_user_destroy_fun = cl->cl_destroy;
+	cl->cl_destroy = default_destroy_user;
+	type_size = sizeof (VOID_STAR);
+	break;
+
+ case SLANG_CLASS_TYPE_SCALAR:
+	if (cl->cl_destroy == NULL) cl->cl_destroy = default_destroy_simple;
+	if ((type_size == 0)
+	 || (type_size > sizeof (_pSL_Object_Union_Type)))
+	 {
+	 _pSLang_verror (SL_INVALID_PARM,
+			 "Type size for %s not appropriate for SCALAR type",
+			 name);
+	 return -1;
+	 }
+	if (cl->cl_pop == NULL)
+	 return method_undefined_error (type, "pop", name);
+	if (cl->cl_fread == NULL) cl->cl_fread = scalar_fread;
+	if (cl->cl_fwrite == NULL) cl->cl_fwrite = scalar_fwrite;
+	if (cl->cl_acopy == NULL) cl->cl_acopy = scalar_acopy;
+	if (cl->cl_dereference == NULL) cl->cl_dereference = cl->cl_push;
+	can_binop = 1;
+	break;
+
+ case SLANG_CLASS_TYPE_PTR:
+	if (cl->cl_destroy == NULL)
+	 return method_undefined_error (type, "destroy", name);
+	type_size = sizeof (VOID_STAR);
+	break;
+
+ case SLANG_CLASS_TYPE_VECTOR:
+	if (cl->cl_destroy == NULL)
+	 return method_undefined_error (type, "destroy", name);
+	if (cl->cl_pop == NULL)
+	 return method_undefined_error (type, "pop", name);
+	cl->cl_apop = vector_apop;
+	cl->cl_apush = vector_apush;
+	cl->cl_adestroy = default_destroy_simple;
+	if (cl->cl_fread == NULL) cl->cl_fread = scalar_fread;
+	if (cl->cl_fwrite == NULL) cl->cl_fwrite = scalar_fwrite;
+	if (cl->cl_acopy == NULL) cl->cl_acopy = scalar_acopy;
+	if (cl->cl_dereference == NULL) cl->cl_dereference = cl->cl_push;
+	can_binop = 1;
+	break;
+
+ default:
+	_pSLang_verror (SL_INVALID_PARM, "%s: unknown class type (%d)", name, class_type);
+	return -1;
+ }
+
+ if (type_size == 0)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "type size must be non-zero for %s", name);
+	return -1;
+ }
+
+ if (cl->cl_string == NULL) cl->cl_string = default_string;
+ if (cl->cl_acopy == NULL) cl->cl_acopy = default_acopy;
+ if (cl->cl_datatype_deref == NULL) cl->cl_datatype_deref = default_datatype_deref;
+
+ if (cl->cl_pop == NULL) cl->cl_pop = default_pop;
+
+ if (cl->cl_push == NULL)
+ return method_undefined_error (type, "push", name);
+
+ if (cl->cl_byte_code_destroy == NULL)
+ cl->cl_byte_code_destroy = cl->cl_destroy;
+ if (cl->cl_push_literal == NULL)
+ cl->cl_push_literal = cl->cl_push;
+
+ if (cl->cl_dereference == NULL)
+ cl->cl_dereference = default_dereference_object;
+
+ if (cl->cl_apop == NULL) cl->cl_apop = cl->cl_pop;
+ if (cl->cl_apush == NULL) cl->cl_apush = cl->cl_push;
+ if (cl->cl_adestroy == NULL) cl->cl_adestroy = cl->cl_destroy;
+ if (cl->cl_push_intrinsic == NULL) cl->cl_push_intrinsic = cl->cl_push;
+
+ if ((cl->cl_foreach == NULL)
+ || (cl->cl_foreach_open == NULL)
+ || (cl->cl_foreach_close == NULL))
+ {
+	cl->cl_foreach = _pSLarray_cl_foreach;
+	cl->cl_foreach_open = _pSLarray_cl_foreach_open;
+	cl->cl_foreach_close = _pSLarray_cl_foreach_close;
+ }
+
+ cl->cl_sizeof_type = type_size;
+
+ if (NULL == (cl->cl_transfer_buf = (VOID_STAR) SLmalloc (type_size)))
+ return -1;
+
+ add_class_to_slot (t, clp, cl);
+
+ if (-1 == register_new_datatype (name, type))
+ return -1;
+
+ if (cl->cl_cmp != NULL)
+ {
+	if (-1 == SLclass_add_binary_op (type, type, use_cmp_bin_op, use_cmp_bin_op_result))
+	 return -1;
+ }
+ else if (can_binop
+	 && (-1 == SLclass_add_binary_op (type, type, scalar_vector_bin_op, scalar_vector_bin_op_result)))
+ return -1;
+
+ cl->cl_anytype_typecast = _pSLanytype_typecast;
+
+ return 0;
+}
+
+int SLclass_add_math_op (SLtype type,
+			 int (*handler)(int,
+					SLtype, VOID_STAR, SLuindex_Type,
+					VOID_STAR),
+			 int (*result) (int, SLtype, SLtype *))
+{
+ SLang_Class_Type *cl = _pSLclass_get_class (type);
+
+ cl->cl_math_op = handler;
+ cl->cl_math_op_result_type = result;
+ return 0;
+}
+
+int SLclass_add_binary_op (SLtype a, SLtype b,
+			 int (*f) (int,
+				 SLtype, VOID_STAR, SLuindex_Type,
+				 SLtype, VOID_STAR, SLuindex_Type,
+				 VOID_STAR),
+			 int (*r) (int, SLtype, SLtype, SLtype *))
+{
+ SL_OOBinary_Type *ab;
+ SLang_Class_Type *cl;
+
+ if ((f == NULL) || (r == NULL)
+ || ((a == SLANG_VOID_TYPE) && (b == SLANG_VOID_TYPE)))
+ {
+	_pSLang_verror (SL_INVALID_PARM, "SLclass_add_binary_op");
+	return -1;
+ }
+
+ if (NULL == (ab = (SL_OOBinary_Type *) SLmalloc (sizeof(SL_OOBinary_Type))))
+ return -1;
+
+ ab->binary_function = f;
+ ab->binary_result = r;
+
+ if (a == SLANG_VOID_TYPE)
+ {
+	cl = _pSLclass_get_class (b);
+	ab->data_type = a;
+	ab->next = NULL;
+	cl->cl_void_binary_this = ab;
+ }
+ else if (b == SLANG_VOID_TYPE)
+ {
+	cl = _pSLclass_get_class (a);
+	ab->data_type = b;
+	ab->next = NULL;
+	cl->cl_this_binary_void = ab;
+ }
+ else
+ {
+	cl = _pSLclass_get_class (a);
+	ab->next = cl->cl_binary_ops;
+	ab->data_type = b;
+	cl->cl_binary_ops = ab;
+ }
+
+ if ((a != SLANG_ARRAY_TYPE)
+ && (b != SLANG_ARRAY_TYPE))
+ {
+	if ((-1 == _pSLarray_add_bin_op (a))
+	 || (-1 == _pSLarray_add_bin_op (b)))
+	 return -1;
+ }
+
+ return 0;
+}
+
+int SLclass_add_unary_op (SLtype type,
+			 int (*f)(int,
+				 SLtype, VOID_STAR, SLuindex_Type,
+				 VOID_STAR),
+			 int (*r)(int, SLtype, SLtype *))
+{
+ SLang_Class_Type *cl;
+
+ cl = _pSLclass_get_class (type);
+ if ((f == NULL) || (r == NULL))
+ {
+	_pSLang_verror (SL_INVALID_PARM, "SLclass_add_unary_op");
+	return -1;
+ }
+
+ cl->cl_unary_op = f;
+ cl->cl_unary_op_result_type = r;
+
+ return 0;
+}
+
+#if 0
+int _pSLclass_add_arith_unary_op (SLtype type,
+				 int (*f)(int,
+					 SLtype, VOID_STAR, unsigned int,
+					 VOID_STAR),
+				 int (*r)(int, SLtype, SLtype *))
+{
+ SLang_Class_Type *cl;
+
+ cl = _pSLclass_get_class (type);
+ if ((f == NULL) || (r == NULL))
+ {
+	_pSLang_verror (SL_INVALID_PARM, "SLclass_add_arith_unary_op");
+	return -1;
+ }
+
+ cl->cl_arith_unary_op = f;
+ cl->cl_arith_unary_op_result_type = r;
+
+ return 0;
+}
+#endif
+
+int SLclass_add_app_unary_op (SLtype type,
+			 int (*f)(int,
+				 SLtype, VOID_STAR, SLuindex_Type,
+				 VOID_STAR),
+			 int (*r)(int, SLtype, SLtype *))
+{
+ SLang_Class_Type *cl;
+
+ cl = _pSLclass_get_class (type);
+ if ((f == NULL) || (r == NULL))
+ {
+	_pSLang_verror (SL_INVALID_PARM, "SLclass_add_app_unary_op");
+	return -1;
+ }
+
+ cl->cl_app_unary_op = f;
+ cl->cl_app_unary_op_result_type = r;
+
+ return 0;
+}
+
+int SLclass_set_pop_function (SLang_Class_Type *cl, int (*f)(SLtype, VOID_STAR))
+{
+ if (cl == NULL) return -1;
+ cl->cl_pop = f;
+
+ return 0;
+}
+
+int SLclass_set_push_function (SLang_Class_Type *cl, int (*f)(SLtype, VOID_STAR))
+{
+ if (cl == NULL) return -1;
+ cl->cl_push = f;
+
+ return 0;
+}
+
+int SLclass_set_apush_function (SLang_Class_Type *cl, int (*f)(SLtype, VOID_STAR))
+{
+ if (cl == NULL) return -1;
+ cl->cl_apush = f;
+
+ return 0;
+}
+
+int SLclass_set_acopy_function (SLang_Class_Type *cl, int (*f)(SLtype, VOID_STAR, VOID_STAR))
+{
+ if (cl == NULL) return -1;
+ cl->cl_acopy = f;
+
+ return 0;
+}
+
+int SLclass_set_deref_function (SLang_Class_Type *cl, int (*f)(SLtype, VOID_STAR))
+{
+ if (cl == NULL) return -1;
+ cl->cl_dereference = f;
+
+ return 0;
+}
+
+int SLclass_set_eqs_function (SLang_Class_Type *cl, int (*f)(SLtype, VOID_STAR, SLtype, VOID_STAR))
+{
+ if (cl == NULL) return -1;
+ cl->cl_eqs = f;
+
+ return 0;
+}
+
+int SLclass_set_length_function (SLang_Class_Type *cl, int (*f)(SLtype, VOID_STAR, SLuindex_Type *))
+{
+ if (cl == NULL) return -1;
+ cl->cl_length = f;
+
+ return 0;
+}
+
+int SLclass_set_is_container (SLang_Class_Type *cl, int ic)
+{
+ if (cl == NULL)
+ return -1;
+ cl->is_container = ic;
+ return 0;
+}
+
+int SLclass_set_string_function (SLang_Class_Type *cl, char *(*f)(SLtype, VOID_STAR))
+{
+ if (cl == NULL) return -1;
+
+ cl->cl_string = f;
+ return 0;
+}
+
+int SLclass_set_destroy_function (SLang_Class_Type *cl, void (*f)(SLtype, VOID_STAR))
+{
+ if (cl == NULL) return -1;
+
+ cl->cl_destroy = f;
+ return 0;
+}
+
+int SLclass_set_sget_function (SLang_Class_Type *cl, int (*f)(SLtype, SLFUTURE_CONST char *))
+{
+ if (cl == NULL) return -1;
+ cl->cl_sget = f;
+ return 0;
+}
+
+int SLclass_set_sput_function (SLang_Class_Type *cl, int (*f)(SLtype, SLFUTURE_CONST char *))
+{
+ if (cl == NULL) return -1;
+ cl->cl_sput = f;
+ return 0;
+}
+
+int SLclass_set_aget_function (SLang_Class_Type *cl, int (*f)(SLtype, unsigned int))
+{
+ if (cl == NULL) return -1;
+ cl->cl_aget = f;
+ return 0;
+}
+
+int SLclass_set_aput_function (SLang_Class_Type *cl, int (*f)(SLtype, unsigned int))
+{
+ if (cl == NULL) return -1;
+ cl->cl_aput = f;
+ return 0;
+}
+
+int SLclass_set_anew_function (SLang_Class_Type *cl, int (*f)(SLtype, unsigned int))
+{
+ if (cl == NULL) return -1;
+ cl->cl_anew = f;
+ return 0;
+}
+
+int SLclass_set_aelem_init_function (SLang_Class_Type *cl, int (*f)(SLtype, VOID_STAR))
+{
+ if (cl == NULL) return -1;
+ cl->cl_init_array_object = f;
+ return 0;
+}
+
+int SLclass_set_foreach_functions (SLang_Class_Type *cl,
+				 SLang_Foreach_Context_Type *(*fe_open)(SLtype, unsigned int),
+				 int (*fe)(SLtype, SLang_Foreach_Context_Type *),
+				 void (*fe_close)(SLtype, SLang_Foreach_Context_Type *))
+{
+ if (cl == NULL)
+ return -1;
+
+ if ((fe_open == NULL) || (fe == NULL) || (fe_close == NULL))
+ {
+	SLang_set_error (SL_APPLICATION_ERROR);
+	return -1;
+ }
+ cl->cl_foreach_open = fe_open;
+ cl->cl_foreach = fe;
+ cl->cl_foreach_close = fe_close;
+
+ return 0;
+}
+
+/* Misc */
+void _pSLclass_type_mismatch_error (SLtype a, SLtype b)
+{
+ _pSLang_verror (SL_TYPE_MISMATCH, "Expecting %s, found %s",
+		 SLclass_get_datatype_name (a),
+		 SLclass_get_datatype_name (b));
+}
+
+/* */
+
+static int null_binary_fun (int op,
+			 SLtype a, VOID_STAR ap, SLuindex_Type na,
+			 SLtype b, VOID_STAR bp, SLuindex_Type nb,
+			 VOID_STAR cp)
+{
+ char *ic;
+ unsigned int i;
+ char c;
+
+ (void) ap; (void) bp;
+
+ switch (op)
+ {
+ case SLANG_EQ:
+	c = (a == b);
+	break;
+
+ case SLANG_NE:
+	c = (a != b);
+	break;
+
+ default:
+	return 0;
+ }
+
+ if (na > nb) nb = na;
+ ic = (char *) cp;
+ for (i = 0; i < nb; i++)
+ ici = c;
+
+ return 1;
+}
+
+static SLCONST char *Unary_OpsSLANG_UNARY_OP_MAX-SLANG_UNARY_OP_MIN+2 =
+{
+ "++", "--", "-", "not", "~", "abs", "sign", "sqr", "mul2", "_ispos", "_isneg", "_isnonneg", NULL
+};
+
+static SLCONST char *Binary_Ops SLANG_BINARY_OP_MAX - SLANG_BINARY_OP_MIN + 2 =
+{
+ "+", "-", "*", "/", "==", "!=", ">", ">=", "<", "<=", "^",
+ "or", "and", "&", "|", "xor", "shl", "shr", "mod", NULL
+};
+
+static int get_binary_unary_opcode (SLCONST char *name, SLCONST char **tbl, int min_val)
+{
+ SLCONST char **u;
+
+ u = tbl;
+ while (*u != NULL)
+ {
+	if (0 == strcmp (name, *u))
+	 return min_val + (int) (u - tbl);
+
+	u++;
+ }
+
+ _pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "Binary/Unary function %s is unsupported", name);
+ return -1;
+}
+
+int _pSLclass_get_unary_opcode (SLCONST char *name)
+{
+ return get_binary_unary_opcode (name, Unary_Ops, SLANG_UNARY_OP_MIN);
+}
+
+int _pSLclass_get_binary_opcode (SLCONST char *name)
+{
+ return get_binary_unary_opcode (name, Binary_Ops, SLANG_BINARY_OP_MIN);
+}
+
+static SLCONST char *get_binary_op_string (int op)
+{
+ if ((op < SLANG_BINARY_OP_MIN)
+ || (op > SLANG_BINARY_OP_MAX))
+ return "- ?? -";		 /* Note: -??- is a trigraph (sigh) */
+ return Binary_Opsop - SLANG_BINARY_OP_MIN;
+}
+
+int (*_pSLclass_get_binary_fun (int op,
+			 SLang_Class_Type *a_cl, SLang_Class_Type *b_cl,
+			 SLang_Class_Type **c_cl, int do_error))
+(int,
+ SLtype, VOID_STAR, SLuindex_Type,
+ SLtype, VOID_STAR, SLuindex_Type,
+ VOID_STAR)
+{
+ SL_OOBinary_Type *bt;
+ SL_OOBinary_Type *last;
+ SLtype a, b, c;
+
+ a = a_cl->cl_data_type;
+ b = b_cl->cl_data_type;
+
+ if ((a == SLANG_NULL_TYPE) || (b == SLANG_NULL_TYPE))
+ {
+	*c_cl = _pSLclass_get_class (SLANG_CHAR_TYPE);
+	return &null_binary_fun;
+ }
+ bt = a_cl->cl_binary_ops;
+ last = NULL;
+
+ while (bt != NULL)
+ {
+	if (bt->data_type == b)
+	 break;
+
+	last = bt;
+	bt = bt->next;
+ }
+
+ if ((last != NULL) && (bt != NULL))
+ {
+	last->next = bt->next;
+	bt->next = a_cl->cl_binary_ops;
+	a_cl->cl_binary_ops = bt;
+ }
+
+ /* Did find find any specific function, so look for a more generic match */
+ if ((bt != NULL)
+ || (NULL != (bt = a_cl->cl_this_binary_void))
+ || (NULL != (bt = b_cl->cl_void_binary_this)))
+ {
+	if (1 == (*bt->binary_result)(op, a, b, &c))
+	 {
+	 if (c == a) *c_cl = a_cl;
+	 else if (c == b) *c_cl = b_cl;
+	 else *c_cl = _pSLclass_get_class (c);
+
+	 return bt->binary_function;
+	 }
+ }
+
+ if (do_error)
+ _pSLang_verror (SL_TYPE_MISMATCH, "%s %s %s is not possible",
+		 a_cl->cl_name, get_binary_op_string (op), b_cl->cl_name);
+
+ *c_cl = NULL;
+ return NULL;
+}
+
+int (*_pSLclass_get_unary_fun (int op,
+			 SLang_Class_Type *a_cl,
+			 SLang_Class_Type **b_cl,
+			 int utype))
+(int, SLtype, VOID_STAR, SLuindex_Type, VOID_STAR)
+{
+ int (*f)(int, SLtype, VOID_STAR, SLuindex_Type, VOID_STAR);
+ int (*r)(int, SLtype, SLtype *);
+ SLtype a;
+ SLtype b;
+
+ switch (utype)
+ {
+ case SLANG_BC_ARITH_UNARY:
+ case SLANG_BC_UNARY:
+	f = a_cl->cl_unary_op;
+	r = a_cl->cl_unary_op_result_type;
+	break;
+
+ case SLANG_BC_MATH_UNARY:
+	f = a_cl->cl_math_op;
+	r = a_cl->cl_math_op_result_type;
+	break;
+
+ case SLANG_BC_APP_UNARY:
+	f = a_cl->cl_app_unary_op;
+	r = a_cl->cl_app_unary_op_result_type;
+	break;
+
+ default:
+	f = NULL;
+	r = NULL;
+ }
+
+ a = a_cl->cl_data_type;
+ if ((f != NULL) && (r != NULL) && (1 == (*r) (op, a, &b)))
+ {
+	if (a == b)
+	 *b_cl = a_cl;
+	else
+	 *b_cl = _pSLclass_get_class (b);
+	return f;
+ }
+
+ _pSLang_verror (SL_TYPE_MISMATCH, "undefined unary operation/function on %s",
+		 a_cl->cl_name);
+
+ *b_cl = NULL;
+
+ return NULL;
+}
+
+int
+SLclass_typecast (SLtype to_type, int is_implicit, int allow_array)
+{
+ SLtype from_type;
+ SLang_Class_Type *cl_to, *cl_from;
+ SLang_Object_Type obj;
+ VOID_STAR ap;
+ VOID_STAR bp;
+ int status;
+
+ if (-1 == SLang_pop (&obj))
+ return -1;
+
+ from_type = obj.o_data_type;
+ if (from_type == to_type)
+ return SLang_push (&obj);
+
+ cl_from = _pSLclass_get_class (from_type);
+ cl_to = _pSLclass_get_class (to_type);
+
+ /* Check for alias, e.g., int and long */
+ if (cl_from == cl_to)
+ {
+	obj.o_data_type = to_type;
+	return SLang_push (&obj);
+ }
+
+ /* Since the typecast functions are designed to work on arrays,
+ * get the pointer to the value instead of just &obj.v.
+ */
+ ap = _pSLclass_get_ptr_to_value (cl_from, &obj);
+
+ if ((from_type == SLANG_ARRAY_TYPE)
+ && (allow_array || (to_type != SLANG_ANY_TYPE)))
+ {
+	if (allow_array == 0)
+	 goto return_error;
+
+	cl_to = _pSLclass_get_class (SLANG_ARRAY_TYPE);
+	bp = cl_to->cl_transfer_buf;
+	status = _pSLarray_typecast (from_type, ap, 1, to_type, bp, is_implicit);
+ }
+ else
+ {
+	int (*t) (SLtype, VOID_STAR, SLuindex_Type, SLtype, VOID_STAR);
+
+	if (NULL == (t = _pSLclass_get_typecast (from_type, to_type, is_implicit)))
+	 {
+	 SLang_free_object (&obj);
+	 return -1;
+	 }
+
+	bp = cl_to->cl_transfer_buf;
+	status = (*t) (from_type, ap, 1, to_type, bp);
+ }
+
+ if (1 == status)
+ {
+	/* AnyType apush will do a reference, which is undesirable here.
+	 * So, to avoid that, perform push instead of apush. Yes, this is
+	 * an ugly hack.
+	 */
+	if (to_type == SLANG_ANY_TYPE)
+	 status = (*cl_to->cl_push)(to_type, bp);
+	else
+	 status = (*cl_to->cl_apush)(to_type, bp);
+
+	if (status == -1)
+	 {
+	 (*cl_to->cl_adestroy) (to_type, bp);
+	 SLang_free_object (&obj);
+	 return -1;
+	 }
+
+	/* cl_apush will push a copy, so destry this one */
+	(*cl_to->cl_adestroy) (to_type, bp);
+	SLang_free_object (&obj);
+	return 0;
+ }
+
+ return_error:
+
+ _pSLang_verror (SL_TYPE_MISMATCH, "Unable to typecast %s to %s",
+		 cl_from->cl_name,
+		 SLclass_get_datatype_name (to_type));
+ SLang_free_object (&obj);
+ return -1;
+}
+
+int (*_pSLclass_get_typecast (SLtype from, SLtype to, int is_implicit))
+(SLtype, VOID_STAR, SLuindex_Type,
+ SLtype, VOID_STAR)
+{
+ SL_Typecast_Type *t;
+ SLang_Class_Type *cl_from;
+
+ cl_from = _pSLclass_get_class (from);
+
+ t = cl_from->cl_typecast_funs;
+ while (t != NULL)
+ {
+	if (t->data_type != to)
+	 {
+	 t = t->next;
+	 continue;
+	 }
+
+	if (is_implicit && (t->allow_implicit == 0))
+	 break;
+
+	return t->typecast;
+ }
+
+ if (to == SLANG_ANY_TYPE)
+ return &_pSLanytype_typecast;
+
+ if ((is_implicit == 0)
+ && (cl_from->cl_void_typecast != NULL))
+ return cl_from->cl_void_typecast;
+
+ _pSLang_verror (SL_TYPE_MISMATCH, "Unable to typecast %s to %s",
+		 cl_from->cl_name,
+		 SLclass_get_datatype_name (to));
+
+ return NULL;
+}
+
+int
+SLclass_add_typecast (SLtype from, SLtype to,
+		 int (*f)_PROTO((SLtype, VOID_STAR, SLuindex_Type,
+				 SLtype, VOID_STAR)),
+		 int allow_implicit)
+{
+ SL_Typecast_Type *t;
+ SLang_Class_Type *cl;
+
+ cl = _pSLclass_get_class (from);
+ if (to == SLANG_VOID_TYPE)
+ {
+	cl->cl_void_typecast = f;
+	return 0;
+ }
+
+ (void) _pSLclass_get_class (to);
+
+ if (NULL == (t = (SL_Typecast_Type *) SLmalloc (sizeof (SL_Typecast_Type))))
+ return -1;
+
+ SLMEMSET((char *) t, 0, sizeof(SL_Typecast_Type));
+ t->data_type = to;
+ t->next = cl->cl_typecast_funs;
+ t->typecast = f;
+ t->allow_implicit = allow_implicit;
+
+ cl->cl_typecast_funs = t;
+
+ return 0;
+}
+
+SLang_MMT_Type *SLang_pop_mmt (SLtype type) /*{{{*/
+{
+ SLang_MMT_Type *mmt;
+ SLang_Class_Type *cl;
+
+ cl = lookup_class (type);
+ if (cl == NULL)
+ {
+	_pSLang_verror (SL_Application_Error, "SLtype %d is not registered", type);
+	return NULL;
+ }
+ if (cl->cl_class_type != SLANG_CLASS_TYPE_MMT)
+ {
+	_pSLang_verror (SL_Application_Error, "SLtype %d is not an MMT", type);
+	return NULL;
+ }
+
+ if (-1 == SLclass_pop_ptr_obj (type, VOID_STAR_STAR(&mmt)))
+ mmt = NULL;
+ return mmt;
+
+#if 0
+ SLang_Object_Type obj;
+ SLang_Class_Type *cl;
+
+ if (_pSLang_pop_object_of_type (type, &obj))
+ return NULL;
+
+ cl = _pSLclass_get_class (type);
+ if ((cl->cl_class_type == SLANG_CLASS_TYPE_MMT)
+ && (obj.data_type == type))
+ {
+	return obj.v.ref;
+ }
+
+ _pSLclass_type_mismatch_error (type, obj.data_type);
+ SLang_free_object (&obj);
+ return NULL;
+#endif
+}
+
+/*}}}*/
+
+int SLang_push_mmt (SLang_MMT_Type *ref) /*{{{*/
+{
+ if (ref == NULL)
+ return SLang_push_null ();
+
+ ref->count += 1;
+
+ if (0 == SLclass_push_ptr_obj (ref->data_type, (VOID_STAR) ref))
+ return 0;
+
+ ref->count -= 1;
+ return -1;
+}
+
+/*}}}*/
+
+void SLang_inc_mmt (SLang_MMT_Type *ref)
+{
+ if (ref != NULL)
+ ref->count += 1;
+}
+
+VOID_STAR SLang_object_from_mmt (SLang_MMT_Type *ref)
+{
+ if (ref == NULL)
+ return NULL;
+
+ return ref->user_data;
+}
+
+SLang_MMT_Type *SLang_create_mmt (SLtype t, VOID_STAR p)
+{
+ SLang_MMT_Type *ref;
+
+ (void) _pSLclass_get_class (t); /* check to see if it is registered */
+
+ if (NULL == (ref = (SLang_MMT_Type *) SLmalloc (sizeof (SLang_MMT_Type))))
+ return NULL;
+
+ SLMEMSET ((char *) ref, 0, sizeof (SLang_MMT_Type));
+
+ ref->data_type = t;
+ ref->user_data = p;
+ /* FIXME!! To be consistent with other types, the reference count should
+ * be set to 1 here. However, doing so will require other code changes
+ * involving the use of MMTs. For instance, SLang_free_mmt would have
+ * to be called after every push of the MMT.
+ */
+ return ref;
+}
+
+void SLang_free_mmt (SLang_MMT_Type *ref)
+{
+ SLtype type;
+ SLang_Class_Type *cl;
+
+ if (ref == NULL)
+ return;
+
+ /* This can be zero if SLang_create_mmt is called followed
+ * by this routine before anything gets a chance to attach itself
+ * to it.
+ */
+ if (ref->count > 1)
+ {
+	ref->count -= 1;
+	return;
+ }
+
+ type = ref->data_type;
+ cl = _pSLclass_get_class (type);
+ (*cl->cl_user_destroy_fun) (type, ref->user_data);
+ SLfree ((char *)ref);
+}
+
+int SLang_push_value (SLtype type, VOID_STAR v)
+{
+ SLang_Class_Type *cl;
+
+ cl = _pSLclass_get_class (type);
+ return (*cl->cl_apush)(type, v);
+}
+
+int SLang_pop_value (SLtype type, VOID_STAR v)
+{
+ SLang_Class_Type *cl;
+
+ cl = _pSLclass_get_class (type);
+ return (*cl->cl_apop)(type, v);
+}
+
+void SLang_free_value (SLtype type, VOID_STAR v)
+{
+ SLang_Class_Type *cl;
+
+ cl = _pSLclass_get_class (type);
+ (*cl->cl_adestroy) (type, v);
+}
+
+/* These routines are very low-level and are designed for application data
+ * types to access the stack from their push/pop methods. The int and
+ * pointer versions are in slang.c
+ */
+#if SLANG_HAS_FLOAT
+int SLclass_push_float_obj (SLtype type, float x)
+{
+ SLang_Object_Type obj;
+ obj.o_data_type = type;
+ obj.v.float_val = x;
+ return SLang_push (&obj);
+}
+#endif
+
+int SLclass_push_long_obj (SLtype type, long x)
+{
+ SLang_Object_Type obj;
+ obj.o_data_type = type;
+ obj.v.long_val = x;
+ return SLang_push (&obj);
+}
+
+#ifdef HAVE_LONG_LONG
+int SLclass_push_llong_obj (SLtype type, long long x)
+{
+ SLang_Object_Type obj;
+ obj.o_data_type = type;
+ obj.v.llong_val = x;
+ return SLang_push (&obj);
+}
+#endif
+
+int SLclass_push_short_obj (SLtype type, short x)
+{
+ SLang_Object_Type obj;
+ obj.o_data_type = type;
+ obj.v.short_val = x;
+ return SLang_push (&obj);
+}
+
+#if SLANG_HAS_FLOAT
+int SLclass_pop_double_obj (SLtype type, double *x)
+{
+ SLang_Object_Type obj;
+
+ if (-1 == _pSLang_pop_object_of_type (type, &obj, 0))
+ return -1;
+
+ *x = obj.v.double_val;
+ return 0;
+}
+
+int SLclass_pop_float_obj (SLtype type, float *x)
+{
+ SLang_Object_Type obj;
+
+ if (-1 == _pSLang_pop_object_of_type (type, &obj, 0))
+ return -1;
+
+ *x = obj.v.float_val;
+ return 0;
+}
+#endif
+
+int SLclass_pop_long_obj (SLtype type, long *x)
+{
+ SLang_Object_Type obj;
+
+ if (-1 == _pSLang_pop_object_of_type (type, &obj, 0))
+ return -1;
+
+ *x = obj.v.long_val;
+ return 0;
+}
+
+int SLclass_pop_int_obj (SLtype type, int *x)
+{
+ SLang_Object_Type obj;
+
+ if (-1 == _pSLang_pop_object_of_type (type, &obj, 0))
+ return -1;
+
+ *x = obj.v.int_val;
+ return 0;
+}
+
+int SLclass_pop_short_obj (SLtype type, short *x)
+{
+ SLang_Object_Type obj;
+
+ if (-1 == _pSLang_pop_object_of_type (type, &obj, 0))
+ return -1;
+
+ *x = obj.v.short_val;
+ return 0;
+}
+
+int SLclass_pop_char_obj (SLtype type, char *x)
+{
+ SLang_Object_Type obj;
+
+ if (-1 == _pSLang_pop_object_of_type (type, &obj, 0))
+ return -1;
+
+ *x = obj.v.char_val;
+ return 0;
+}
+
+SLtype SLang_get_int_type (int nbits)
+{
+ switch (nbits)
+ {
+ case -8:
+	return SLANG_CHAR_TYPE;
+ case 8:
+	return SLANG_UCHAR_TYPE;
+ case -16:
+	return _pSLANG_INT16_TYPE;
+ case 16:
+	return _pSLANG_UINT16_TYPE;
+ case -32:
+	return _pSLANG_INT32_TYPE;
+ case 32:
+	return _pSLANG_UINT32_TYPE;
+ case -64:
+	return _pSLANG_INT64_TYPE;
+ case 64:
+	return _pSLANG_UINT64_TYPE;
+ }
+ return 0;
+}
+
+int SLang_get_int_size (SLtype type)
+{
+ switch (type)
+ {
+ case 0:
+	return 0;
+ case SLANG_CHAR_TYPE:
+	return -8;
+ case SLANG_UCHAR_TYPE:
+	return 8;
+ case _pSLANG_INT16_TYPE:
+	return -16;
+ case _pSLANG_UINT16_TYPE:
+	return 16;
+ case _pSLANG_INT32_TYPE:
+	return -32;
+ case _pSLANG_UINT32_TYPE:
+	return 32;
+ default:
+	if (type == _pSLANG_INT64_TYPE)
+	 return -64;
+	if (type == _pSLANG_UINT64_TYPE)
+	 return 64;
+ }
+ return 0;
+}
+
+int SLclass_patch_intrin_fun_table (SLang_Intrin_Fun_Type *table,
+				 SLtype *from_types, SLtype *to_types, unsigned int n)
+{
+ unsigned int i, j;
+
+ for (i = 0; i < n; i++)
+ {
+	SLang_Intrin_Fun_Type *t = table;
+	SLtype dummy = from_typesi;
+	SLtype type = to_typesi;
+
+	while (t->name != NULL)
+	 {
+	 unsigned int nargs = t->num_args;
+	 SLtype *args = t->arg_types;
+
+	 for (j = 0; j < nargs; j++)
+	 {
+		 if (argsj == dummy)
+		 argsj = type;
+	 }
+
+	 /* For completeness */
+	 if (t->return_type == dummy)
+	 t->return_type = type;
+	 t++;
+	 }
+ }
+ return 0;
+}
+int SLclass_patch_intrin_fun_table1 (SLang_Intrin_Fun_Type *table,
+				 SLtype from_type, SLtype to_type)
+{
+ return SLclass_patch_intrin_fun_table (table, &from_type, &to_type, 1);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slcmd.c Added

@@ -0,0 +1,370 @@
+/* cmd line facility for slang */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#if SLANG_HAS_FLOAT
+# include <math.h>
+#endif
+
+#include "slang.h"
+#include "_slang.h"
+
+#ifndef HAVE_STDLIB_H
+/* Oh dear. Where is the prototype for atof? If not in stdlib, then
+ * I do not know where. Not in math.h onsome systems either.
+ */
+extern double atof ();
+#endif
+
+static SLcmd_Cmd_Type *SLcmd_find_command (SLFUTURE_CONST char *s, SLcmd_Cmd_Type *cmd)
+{
+ SLCONST char *cmdstr;
+ char chs = *s++, ch;
+
+ while ((cmd->cmdfun != NULL)
+	 && (NULL != (cmdstr = cmd->cmd))
+	 && (0 != (ch = *cmdstr++)))
+ {
+	if ((ch == chs) && !strcmp (s, cmdstr)) return cmd;
+	cmd++;
+ }
+ return NULL;
+}
+
+static int extract_token (SLFUTURE_CONST char **strptr, char *buf)
+{
+ SLFUTURE_CONST char *s;
+ char *b;
+ char ch;
+
+ *buf = 0;
+
+ s = *strptr;
+ while (((ch = *s) != 0)
+	 && ((ch == ' ') || (ch == '\t') || (ch == '\n')))
+ s++;
+
+ *strptr = s;
+
+ if (ch == 0) return 0;
+ if (ch == '%') return 0;
+
+ b = buf;
+
+ *b++ = ch;
+ s++;
+
+ if ((ch == '\'') || (ch == '"'))
+ {
+	char quote = ch;
+	while ((ch = *s) != 0)
+	 {
+	 s++;
+	 *b++ = ch;
+	 if (ch == quote)
+	 break;
+
+	 if (ch == '\\')
+	 {
+		 if (0 == (ch = *s))
+		 break;
+		 *b++ = ch;
+		 s++;
+	 }
+	 }
+	*strptr = s;
+	*b = 0;
+	return 1;
+ }
+
+ while (((ch = *s) != 0)
+	 && (ch != ' ')
+	 && (ch != '\t')
+	 && (ch != '\n')
+	 && (ch != '%'))
+ *b++ = *s++;
+
+ *strptr = s;
+ *b = 0;
+ return 1;
+}
+
+static int allocate_arg_space (SLcmd_Cmd_Table_Type *table, SLstrlen_Type argc, SLstrlen_Type *space_ptr)
+{
+ SLstrlen_Type space = *space_ptr;
+ char *p;
+
+ if (argc + 1 < space)
+ return 0;
+
+ if (space > 128)
+ {
+	if (space > 1024) space += 1024;
+	else space += 128;
+ }
+ else space += 32;
+
+ if (NULL == (p = (char *)SLrealloc ((char *)table->string_args, space * sizeof (char *))))
+ return -1;
+ table->string_args = (SLFUTURE_CONST char **)p;
+ table->string_args argc = NULL;
+
+ if (NULL == (p = (char *)SLrealloc ((char *)table->int_args, space * sizeof (int))))
+ return -1;
+ table->int_args = (int *)p;
+
+ if (NULL == (p = (char *)SLrealloc ((char *)table->double_args, space * sizeof (double))))
+ return -1;
+ table->double_args = (double *)p;
+
+ if (NULL == (p = (char *)SLrealloc ((char *)table->arg_type, space * sizeof (SLtype))))
+ return -1;
+ table->arg_type = (SLtype *)p;
+
+ *space_ptr = space;
+ return 0;
+}
+
+int SLcmd_execute_string (SLFUTURE_CONST char *str, SLcmd_Cmd_Table_Type *table)
+{
+ SLFUTURE_CONST char *s, *arg_type, *last_str, *cmd_name;
+ SLcmd_Cmd_Type *cmd;
+ char *buf;
+ int token_present;
+ int i;
+ int status;
+ SLstrlen_Type len;
+ int argc;
+ SLstrlen_Type space;
+
+ table->argc = 0;
+ table->string_args = NULL;
+ table->int_args = NULL;
+ table->double_args = NULL;
+ table->arg_type = NULL;
+
+ buf = SLmake_string (str);
+ if (buf == NULL)
+ return -1;
+
+ status = extract_token (&str, buf);
+ if (status <= 0)
+ {
+	SLfree (buf);
+	return status;
+ }
+
+ if (((len = strlen (buf)) >= 32)
+ || (NULL == (cmd = SLcmd_find_command (buf, table->table))))
+ {
+	_pSLang_verror (SL_UNDEFINED_NAME,"%s: invalid command", buf);
+	SLfree (buf);
+	return -1;
+ }
+
+ if (NULL == (cmd_name = SLmake_string (buf)))
+ {
+	SLfree (buf);
+	return -1;
+ }
+
+ space = 0;
+ argc = 0;
+ if (-1 == allocate_arg_space (table, argc, &space))
+ {
+	SLfree (buf);
+	return -1;
+ }
+ table->arg_typeargc = SLANG_STRING_TYPE;
+ table->string_argsargc++ = cmd_name;
+
+ arg_type = cmd->arg_type;
+ status = -1;
+ while (*arg_type)
+ {
+	int guess_type = 0;
+
+	last_str = str;
+
+	if (-1 == allocate_arg_space (table, argc, &space))
+	 goto error;
+
+	if (-1 == (token_present = extract_token (&str, buf)))
+	 goto error;
+
+	table->string_argsargc = NULL;
+
+	if (token_present)
+	 {
+	 char *b = buf;
+	 len = strlen (b);
+
+	 if ((*b == '"') && (len > 1))
+	 {
+		 b++;
+		 len -= 2;
+		 blen = 0;
+		 guess_type = SLANG_STRING_TYPE;
+		 SLexpand_escaped_string (buf, b, b + len, -1);
+		 len = strlen (buf);
+	 }
+	 else if ((*b == '\'') && (len > 1))
+	 {
+		 SLwchar_Type ch;
+		 b++;
+		 len -= 2;
+		 blen = 0;
+		 guess_type = SLANG_INT_TYPE;
+		 ch = *b;
+		 if (ch == '\\')
+		 {
+		 if (NULL == _pSLexpand_escaped_char (b, b+len, &ch, NULL))
+			 goto error;
+		 }
+		 sprintf (buf, "%lu", (unsigned long)ch);
+		 len = strlen (buf);
+	 }
+	 else guess_type = SLang_guess_type (buf);
+	 }
+
+	switch (*arg_type++)
+	 {
+	 /* variable argument number */
+	 case 'v':
+	 if (token_present == 0) break;
+	 case 'V':
+	 if (token_present == 0)
+	 {
+		 _pSLang_verror (SL_INVALID_PARM, "%s: Expecting argument", cmd_name);
+		 goto error;
+	 }
+
+	 while (*last_str == ' ') last_str++;
+	 len = strlen (last_str);
+	 str = last_str + len;
+
+	 s = SLmake_nstring (last_str, len);
+	 if (s == NULL) goto error;
+
+	 table->arg_typeargc = SLANG_STRING_TYPE;
+	 table->string_argsargc++ = s;
+	 break;
+
+	 case 's':
+	 if (token_present == 0) break;
+	 case 'S':
+	 if (token_present == 0)
+	 {
+		 _pSLang_verror (SL_TYPE_MISMATCH, "%s: Expecting string argument", cmd_name);
+		 goto error;
+	 }
+
+	 s = SLmake_nstring (buf, len);
+	 if (s == NULL) goto error;
+	 table->arg_typeargc = SLANG_STRING_TYPE;
+	 table->string_argsargc++ = s;
+	 break;
+
+	 /* integer argument */
+	 case 'i':
+	 if (token_present == 0) break;
+	 case 'I':
+	 if ((token_present == 0) || (SLANG_INT_TYPE != guess_type))
+	 {
+		 _pSLang_verror (SL_TYPE_MISMATCH, "%s: Expecting integer argument", cmd_name);
+		 goto error;
+	 }
+
+	 table->arg_typeargc = SLANG_INT_TYPE;
+	 table->int_argsargc++ = SLatoi((unsigned char *) buf);
+	 break;
+
+	 /* floating point arg */
+#if SLANG_HAS_FLOAT
+	 case 'f':
+	 if (token_present == 0) break;
+	 case 'F':
+	 if ((token_present == 0) || (SLANG_STRING_TYPE == guess_type))
+	 {
+		 _pSLang_verror (SL_TYPE_MISMATCH, "%s: Expecting double argument", cmd_name);
+		 goto error;
+	 }
+	 table->arg_typeargc = SLANG_DOUBLE_TYPE;
+	 table->double_argsargc++ = atof(buf);
+	 break;
+#endif
+	 /* Generic type */
+	 case 'g':
+	 if (token_present == 0) break;
+	 case 'G':
+	 if (token_present == 0)
+	 {
+		 _pSLang_verror (SL_TYPE_MISMATCH, "%s: Expecting argument", cmd_name);
+		 goto error;
+	 }
+
+	 switch (guess_type)
+	 {
+		case SLANG_INT_TYPE:
+		 table->arg_typeargc = SLANG_INT_TYPE;
+		 table->int_argsargc++ = SLatoi((unsigned char *) buf);
+		 break;
+
+		case SLANG_STRING_TYPE:
+		 s = SLmake_nstring (buf, len);
+		 if (s == NULL) goto error;
+
+		 table->arg_typeargc = SLANG_STRING_TYPE;
+		 table->string_argsargc++ = s;
+		 break;
+#if SLANG_HAS_FLOAT
+		case SLANG_DOUBLE_TYPE:
+		 table->arg_typeargc = SLANG_DOUBLE_TYPE;
+		 table->double_argsargc++ = atof(buf);
+#endif
+	 }
+	 break;
+	 }
+ }
+
+ /* call function */
+ status = (*cmd->cmdfun)(argc, table);
+
+ error:
+ if (table->string_args != NULL) for (i = 0; i < argc; i++)
+ {
+	if (NULL != table->string_argsi)
+	 {
+	 SLfree ((char *) table->string_argsi);
+	 table->string_argsi = NULL;
+	 }
+ }
+ SLfree ((char *)table->string_args); table->string_args = NULL;
+ SLfree ((char *)table->double_args); table->double_args = NULL;
+ SLfree ((char *)table->int_args); table->int_args = NULL;
+ SLfree ((char *)table->arg_type); table->arg_type = NULL;
+
+ SLfree (buf);
+ return status;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slcmplex.c Added

@@ -0,0 +1,1218 @@
+/* Complex Data Type definition for S-Lang */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+/* The rest of the file is enclosed in this #if */
+#if SLANG_HAS_COMPLEX
+
+#if SLANG_HAS_FLOAT
+# include <math.h>
+#endif
+
+#ifdef PI
+# undef PI
+#endif
+#define PI 3.14159265358979323846
+
+int SLang_pop_complex (double *r, double *i)
+{
+ double *c;
+
+ switch (SLang_peek_at_stack ())
+ {
+ case SLANG_COMPLEX_TYPE:
+	if (-1 == SLclass_pop_ptr_obj (SLANG_COMPLEX_TYPE, VOID_STAR_STAR(&c)))
+	 return -1;
+	*r = c0;
+	*i = c1;
+	SLfree ((char *) c);
+	break;
+
+ default:
+	*i = 0.0;
+	if (-1 == SLang_pop_double (r))
+	 return -1;
+	break;
+
+ case -1:
+	return -1;
+ }
+ return 0;
+}
+
+int SLang_push_complex (double r, double i)
+{
+ double *c;
+
+ c = (double *) SLmalloc (2 * sizeof (double));
+ if (c == NULL)
+ return -1;
+
+ c0 = r;
+ c1 = i;
+
+ if (-1 == SLclass_push_ptr_obj (SLANG_COMPLEX_TYPE, (VOID_STAR) c))
+ {
+	SLfree ((char *) c);
+	return -1;
+ }
+ return 0;
+}
+
+double *SLcomplex_times (double *c, double *a, double *b)
+{
+ double a_real, b_real, a_imag, b_imag;
+
+ a_real = a0;
+ b_real = b0;
+ a_imag = a1;
+ b_imag = b1;
+
+ c0 = a_real * b_real - a_imag * b_imag;
+ c1 = a_imag * b_real + a_real * b_imag;
+
+ return c;
+}
+
+double *SLcomplex_divide (double *c, double *a, double *b)
+{
+ double a_real, b_real, a_imag, b_imag;
+ double ratio, invden;
+
+ a_real = a0;
+ b_real = b0;
+ a_imag = a1;
+ b_imag = b1;
+
+ /* Do it this way to avoid overflow in the denom */
+ if (fabs(b_real) > fabs(b_imag))
+ {
+	ratio = b_imag / b_real;
+	invden = 1.0 / (b_real + b_imag * ratio);
+	c0 = (a_real + ratio * a_imag) * invden;
+	c1 = (a_imag - a_real * ratio) * invden;
+ }
+ else
+ {
+	ratio = b_real / b_imag;
+	invden = 1.0 / (b_real * ratio + b_imag);
+	c0 = (a_real * ratio + a_imag) * invden;
+	c1 = (a_imag * ratio - a_real) * invden;
+ }
+ return c;
+}
+
+/* a^b = exp (b log a); */
+double *SLcomplex_pow (double *c, double *a, double *b)
+{
+ if ((a0 == 0.0) && (b0 == 0.0) && (a1 == 0.0) && (b1 == 0.0))
+ {
+	c0 = 1.0;
+	c1 = 0.0;
+	return c;
+ }
+ return SLcomplex_exp (c, SLcomplex_times (c, b, SLcomplex_log (c, a)));
+}
+
+static double *complex_dpow (double *c, double *a, double b)
+{
+ if ((b == 0.0) && (a0 == 0.0) && (a1 == 0.0))
+ {
+	c0 = 1.0;
+	c1 = 0.0;
+	return c;
+ }
+ SLcomplex_log (c, a);
+ c0 *= b;
+ c1 *= b;
+ return SLcomplex_exp (c, c);
+}
+
+static double *dcomplex_pow (double *c, double a, double *b)
+{
+ if ((a == 0.0) && (b0 == 0.0) && (b1 == 0.0))
+ {
+	c0 = 1.0;
+	c1 = 0.0;
+	return c;
+ }
+ a = log (a);
+ c0 = a * b0;
+ c1 = a * b1;
+ return SLcomplex_exp (c, c);
+}
+
+double SLcomplex_abs (double *z)
+{
+ return SLmath_hypot (z0, z1);
+}
+
+/* It appears that FORTRAN assumes that the branch cut for the log function
+ * is along the -x axis. So, use this for atan2:
+ */
+static double my_atan2 (double y, double x)
+{
+ double val;
+
+ val = atan (y/x);
+
+ if (x >= 0)
+ return val;		 /* I, IV */
+
+ if (y <= 0)			 /* III */
+ return val - PI;
+
+ return PI + val;		 /* II */
+}
+
+static void polar_form (double *r, double *theta, double *z)
+{
+ double x, y;
+
+ *r = SLcomplex_abs (z);
+
+ x = z0;
+ y = z1;
+
+ if (x == 0.0)
+ {
+	if (y >= 0)
+	 *theta = 0.5 * PI;
+	else
+	 *theta = 1.5 * PI;
+ }
+ else *theta = my_atan2 (y, x);
+}
+
+double *SLcomplex_sin (double *sinz, double *z)
+{
+ double x, y;
+
+ x = z0; y = z1;
+ sinz0 = sin (x) * cosh (y);
+ sinz1 = cos (x) * sinh (y);
+ return sinz;
+}
+
+double *SLcomplex_cos (double *cosz, double *z)
+{
+ double x, y;
+
+ x = z0; y = z1;
+ cosz0 = cos (x) * cosh (y);
+ cosz1 = -sin (x) * sinh (y);
+ return cosz;
+}
+
+double *_pSLcomplex_expm1 (double *f, double *z)
+{
+ /* exp(z)-1 = (e^x-1) + (cos(y)-1)*e^x + ie^x*sin(y) */
+ double ex;
+ double x = z0, y = z1;
+ double siny2 = sin(0.5*y);
+
+ ex = exp(x);
+ f0 = EXPM1_FUNC(x) - ex*(2.0*siny2*siny2); /* cos(y)-1 = 2*sin^2(y/2) */
+ f1 = ex*sin(y);
+ return f;
+}
+
+double *SLcomplex_exp (double *expz, double *z)
+{
+ double r, i;
+
+ r = exp (z0);
+ i = z1;
+ expz0 = r * cos (i);
+ expz1 = r * sin (i);
+ return expz;
+}
+
+double *SLcomplex_log (double *logz, double *z)
+{
+ double r, theta;
+
+ polar_form (&r, &theta, z);	 /* log R.e^(ix) = log R + ix */
+ logz0 = log(r);
+ logz1 = theta;
+ return logz;
+}
+
+double *_pSLcomplex_log1p (double *f, double *z)
+{
+ /* f(z) = log(1+z)
+ * = log(1+x+iy)
+ * = log(sqrt((1+x)^2 + y^2)) + i*theta
+ * = 0.5*log((1+x)^2 + y^2) + i*theta
+ * = 0.5*log(1 + 2*x + x^2 + y^2) + i*theta
+ * = 0.5*log(1 + r^2 + 2*x) + i*theta
+ */
+ double r, theta;
+
+ polar_form (&r, &theta, z);
+ if (r < 1)
+ f0 = 0.5*LOG1P_FUNC(r*r + 2.0*z0);
+ else
+ f0 = log(SLmath_hypot(1.0+z0, z1));
+
+ f1 = theta;
+ return f;
+}
+
+double *SLcomplex_log10 (double *log10z, double *z)
+{
+ double l10 = log (10.0);
+ (void) SLcomplex_log (log10z, z);
+ log10z0 = log10z0 / l10;
+ log10z1 = log10z1 / l10;
+ return log10z;
+}
+
+double *SLcomplex_sqrt (double *sqrtz, double *z)
+{
+ double r, x, y;
+
+ x = z0;
+ y = z1;
+
+ r = SLmath_hypot (x, y);
+
+ if (r == 0.0)
+ {
+	sqrtz 0 = sqrtz 1 = 0.0;
+	return sqrtz;
+ }
+
+ if (x >= 0.0)
+ {
+	x = sqrt (0.5 * (r + x));
+	y = 0.5 * y / x;
+ }
+ else
+ {
+	r = sqrt (0.5 * (r - x));
+	x = 0.5 * y / r;
+	y = r;
+
+	if (x < 0.0)
+	 {
+	 x = -x;
+	 y = -y;
+	 }
+ }
+
+ sqrtz0 = x;
+ sqrtz1 = y;
+
+ return sqrtz;
+}
+
+double *SLcomplex_tan (double *tanz, double *z)
+{
+ double x, y, invden;
+
+ x = 2 * z0;
+ y = 2 * z1;
+ invden = 1.0 / (cos (x) + cosh (y));
+ tanz0 = invden * sin (x);
+ tanz1 = invden * sinh (y);
+ return tanz;
+}
+
+/* Utility Function */
+static void compute_alpha_beta (double *z, double *alpha, double *beta)
+{
+ double x, y, a, b;
+
+ x = z0;
+ y = z1;
+ a = 0.5 * SLmath_hypot (x + 1, y);
+ b = 0.5 * SLmath_hypot (x - 1, y);
+
+ *alpha = a + b;
+ *beta = a - b;
+}
+
+double *SLcomplex_asin (double *asinz, double *z)
+{
+ double alpha, beta;
+
+ compute_alpha_beta (z, &alpha, &beta);
+ asinz0 = asin (beta);
+ asinz1 = log (alpha + sqrt (alpha * alpha - 1));
+ return asinz;
+}
+
+double *SLcomplex_acos (double *acosz, double *z)
+{
+ double alpha, beta;
+
+ compute_alpha_beta (z, &alpha, &beta);
+ acosz0 = acos (beta);
+ acosz1 = -log (alpha + sqrt (alpha * alpha - 1));
+ return acosz;
+}
+
+double *SLcomplex_atan (double *atanz, double *z)
+{
+ double x, y;
+ double z12, z22;
+
+ x = z0; y = z1;
+ z10 = x;
+ z11 = 1 + y;
+ z20 = -x;
+ z21 = 1 - y;
+
+ SLcomplex_log (z1, SLcomplex_divide (z2, z1, z2));
+ atanz0 = -0.5 * z11;
+ atanz1 = 0.5 * z10;
+
+ return atanz;
+}
+
+double *SLcomplex_sinh (double *sinhz, double *z)
+{
+ double x, y;
+ x = z0; y = z1;
+ sinhz0 = sinh (x) * cos (y);
+ sinhz1 = cosh (x) * sin (y);
+ return sinhz;
+}
+
+double *SLcomplex_cosh (double *coshz, double *z)
+{
+ double x, y;
+ x = z0; y = z1;
+ coshz0 = cosh (x) * cos (y);
+ coshz1 = sinh (x) * sin (y);
+ return coshz;
+}
+
+double *SLcomplex_tanh (double *tanhz, double *z)
+{
+ double x, y, invden;
+ x = 2 * z0;
+ y = 2 * z1;
+ invden = 1.0 / (cosh (x) + cos (y));
+ tanhz0 = invden * sinh (x);
+ tanhz1 = invden * sin (y);
+ return tanhz;
+}
+#if 0
+static double *not_implemented (char *fun, double *p)
+{
+ _pSLang_verror (SL_NOT_IMPLEMENTED, "%s for complex numbers has not been implemented",
+		 fun);
+ *p = -1.0;
+ return p;
+}
+#endif
+/* Use: asinh(z) = -i asin(iz) */
+double *SLcomplex_asinh (double *asinhz, double *z)
+{
+ double iz2;
+
+ iz0 = -z1;
+ iz1 = z0;
+
+ (void) SLcomplex_asin (iz, iz);
+ asinhz0 = iz1;
+ asinhz1 = -iz0;
+
+ return asinhz;
+}
+
+/* Use: acosh (z) = i acos(z) */
+double *SLcomplex_acosh (double *acoshz, double *z)
+{
+ double iz2;
+
+ (void) SLcomplex_acos (iz, z);
+ acoshz0 = -iz1;
+ acoshz1 = iz0;
+
+ return acoshz;
+}
+
+/* Use: atanh(z) = -i atan(iz) */
+double *SLcomplex_atanh (double *atanhz, double *z)
+{
+ double iz2;
+
+ iz0 = -z1;
+ iz1 = z0;
+
+ (void) SLcomplex_atan (iz, iz);
+ atanhz0 = iz1;
+ atanhz1 = -iz0;
+
+ return atanhz;
+}
+
+static int complex_binary_result (int op, SLtype a, SLtype b,
+				 SLtype *c)
+{
+ (void) a; (void) b;
+
+ switch (op)
+ {
+ default:
+ case SLANG_POW:
+ case SLANG_PLUS:
+ case SLANG_MINUS:
+ case SLANG_TIMES:
+ case SLANG_DIVIDE:
+	*c = SLANG_COMPLEX_TYPE;
+	break;
+
+ case SLANG_EQ:
+ case SLANG_NE:
+	*c = SLANG_CHAR_TYPE;
+	break;
+ }
+ return 1;
+}
+
+static int complex_complex_binary (int op,
+				 SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+				 SLtype b_type, VOID_STAR bp, SLuindex_Type nb,
+				 VOID_STAR cp)
+{
+ char *ic;
+ double *a, *b, *c;
+ SLuindex_Type n, n_max;
+ SLuindex_Type da, db;
+
+ (void) a_type;
+ (void) b_type;
+
+ a = (double *) ap;
+ b = (double *) bp;
+ c = (double *) cp;
+ ic = (char *) cp;
+
+ if (na == 1) da = 0; else da = 2;
+ if (nb == 1) db = 0; else db = 2;
+
+ if (na > nb) n_max = na; else n_max = nb;
+ n_max = 2 * n_max;
+
+ switch (op)
+ {
+ default:
+	return 0;
+
+ case SLANG_PLUS:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 cn = a0 + b0;
+	 cn + 1 = a1 + b1;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_MINUS:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 cn = a0 - b0;
+	 cn + 1 = a1 - b1;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_TIMES:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 SLcomplex_times (c + n, a, b);
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_DIVIDE:	 /* / */
+	for (n = 0; n < n_max; n += 2)
+	 {
+#if 0
+	 if ((b0 == 0.0) && (b1 == 0.0))
+	 {
+		 SLang_set_error (SL_DIVIDE_ERROR);
+		 return -1;
+	 }
+#endif
+	 SLcomplex_divide (c + n, a, b);
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_EQ: 		 /* == */
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 icn/2 = ((a0 == b0) && (a1 == b1));
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_NE:		 /* != */
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 icn/2 = ((a0 != b0) || (a1 != b1));
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_POW:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 SLcomplex_pow (c + n, a, b);
+	 a += da; b += db;
+	 }
+	break;
+
+ }
+
+ return 1;
+}
+
+static int complex_double_binary (int op,
+				 SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+				 SLtype b_type, VOID_STAR bp, SLuindex_Type nb,
+				 VOID_STAR cp)
+{
+ char *ic;
+ double *a, *b, *c;
+ SLuindex_Type n, n_max;
+ SLuindex_Type da, db;
+
+ (void) a_type;
+ (void) b_type;
+
+ a = (double *) ap;
+ b = (double *) bp;
+ c = (double *) cp;
+ ic = (char *) cp;
+
+ if (na == 1) da = 0; else da = 2;
+ if (nb == 1) db = 0; else db = 1;
+
+ if (na > nb) n_max = na; else n_max = nb;
+ n_max = 2 * n_max;
+
+ switch (op)
+ {
+ default:
+	return 0;
+
+ case SLANG_PLUS:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 cn = a0 + b0;
+	 cn + 1 = a1;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_MINUS:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 cn = a0 - b0;
+	 cn + 1 = a1;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_TIMES:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 double b0 = b0;
+	 cn = a0 * b0;
+	 cn + 1 = a1 * b0;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_DIVIDE:	 /* / */
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 double b0 = b0;
+#if 0
+	 if (b0 == 0.0)
+	 {
+		 SLang_set_error (SL_DIVIDE_ERROR);
+		 return -1;
+	 }
+#endif
+	 cn = a0 / b0;
+	 cn + 1 = a1 / b0;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_EQ: 		 /* == */
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 icn/2 = ((a0 == b0) && (a1 == 0.0));
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_NE:		 /* != */
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 icn/2 = ((a0 != b0) || (a1 != 0.0));
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_POW:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 complex_dpow (c + n, a, b0);
+	 a += da; b += db;
+	 }
+	break;
+ }
+
+ return 1;
+}
+
+static int double_complex_binary (int op,
+				 SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+				 SLtype b_type, VOID_STAR bp, SLuindex_Type nb,
+				 VOID_STAR cp)
+{
+ char *ic;
+ double *a, *b, *c;
+ SLuindex_Type n, n_max;
+ SLuindex_Type da, db;
+
+ (void) a_type;
+ (void) b_type;
+
+ a = (double *) ap;
+ b = (double *) bp;
+ c = (double *) cp;
+ ic = (char *) cp;
+
+ if (na == 1) da = 0; else da = 1;
+ if (nb == 1) db = 0; else db = 2;
+
+ if (na > nb) n_max = na; else n_max = nb;
+ n_max = 2 * n_max;
+
+ switch (op)
+ {
+ default:
+	return 0;
+
+ case SLANG_PLUS:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 cn = a0 + b0;
+	 cn + 1 = b1;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_MINUS:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 cn = a0 - b0;
+	 cn + 1 = -b1;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_TIMES:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 double a0 = a0;
+	 cn = a0 * b0;
+	 cn + 1 = a0 * b1;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_DIVIDE:	 /* / */
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 double z2;
+#if 0
+	 if ((b0 == 0.0) && (b1 == 0.0))
+	 {
+		 SLang_set_error (SL_DIVIDE_ERROR);
+		 return -1;
+	 }
+#endif
+	 z0 = a0;
+	 z1 = 0.0;
+	 SLcomplex_divide (c + n, z, b);
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_EQ: 		 /* == */
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 icn/2 = ((a0 == b0) && (0.0 == b1));
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_NE:		 /* != */
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 icn/2 = ((a0 != b0) || (0.0 != b1));
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_POW:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 dcomplex_pow (c + n, a0, b);
+	 a += da; b += db;
+	 }
+	break;
+ }
+
+ return 1;
+}
+
+static int complex_generic_binary (int op,
+				 SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+				 SLtype b_type, VOID_STAR bp, SLuindex_Type nb,
+				 VOID_STAR cp)
+{
+ char *ic;
+ char *b;
+ double *a, *c;
+ SLuindex_Type n, n_max;
+ SLuindex_Type da, db;
+ unsigned int sizeof_b;
+ SLang_To_Double_Fun_Type to_double;
+
+ if (NULL == (to_double = SLarith_get_to_double_fun (b_type, &sizeof_b)))
+ return 0;
+
+ (void) a_type;
+
+ a = (double *) ap;
+ b = (char *) bp;
+ c = (double *) cp;
+ ic = (char *) cp;
+
+ if (na == 1) da = 0; else da = 2;
+ if (nb == 1) db = 0; else db = sizeof_b;
+
+ if (na > nb) n_max = na; else n_max = nb;
+ n_max = 2 * n_max;
+
+ switch (op)
+ {
+ default:
+	return 0;
+
+ case SLANG_POW:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 complex_dpow (c + n, a, to_double((VOID_STAR)b));
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_PLUS:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 cn = a0 + to_double((VOID_STAR)b);
+	 cn + 1 = a1;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_MINUS:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 cn = a0 - to_double((VOID_STAR)b);
+	 cn + 1 = a1;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_TIMES:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 double b0 = to_double((VOID_STAR)b);
+	 cn = a0 * b0;
+	 cn + 1 = a1 * b0;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_DIVIDE:	 /* / */
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 double b0 = to_double((VOID_STAR)b);
+#if 0
+	 if (b0 == 0)
+	 {
+		 SLang_set_error (SL_DIVIDE_ERROR);
+		 return -1;
+	 }
+#endif
+	 cn = a0 / b0;
+	 cn + 1 = a1 / b0;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_EQ: 		 /* == */
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 icn/2 = ((a0 == to_double((VOID_STAR)b)) && (a1 == 0.0));
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_NE:		 /* != */
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 icn/2 = ((a0 != to_double((VOID_STAR)b)) || (a1 != 0.0));
+	 a += da; b += db;
+	 }
+	break;
+ }
+
+ return 1;
+}
+
+static int generic_complex_binary (int op,
+				 SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+				 SLtype b_type, VOID_STAR bp, SLuindex_Type nb,
+				 VOID_STAR cp)
+{
+ double *b, *c;
+ char *a, *ic;
+ SLuindex_Type n, n_max;
+ SLuindex_Type da, db;
+ unsigned int sizeof_a;
+ SLang_To_Double_Fun_Type to_double;
+
+ if (NULL == (to_double = SLarith_get_to_double_fun (a_type, &sizeof_a)))
+ return 0;
+
+ (void) b_type;
+
+ a = (char *) ap;
+ b = (double *) bp;
+ c = (double *) cp;
+ ic = (char *) cp;
+
+ if (na == 1) da = 0; else da = sizeof_a;
+ if (nb == 1) db = 0; else db = 2;
+
+ if (na > nb) n_max = na; else n_max = nb;
+ n_max = 2 * n_max;
+
+ switch (op)
+ {
+ default:
+	return 0;
+ case SLANG_POW:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 dcomplex_pow (c + n, to_double((VOID_STAR)a), b);
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_PLUS:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 cn = to_double((VOID_STAR)a) + b0;
+	 cn + 1 = b1;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_MINUS:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 cn = to_double((VOID_STAR)a) - b0;
+	 cn + 1 = -b1;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_TIMES:
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 double a0 = to_double((VOID_STAR)a);
+	 cn = a0 * b0;
+	 cn + 1 = a0 * b1;
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_DIVIDE:	 /* / */
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 double z2;
+#if 0
+	 if ((b0 == 0.0) && (b1 == 0.0))
+	 {
+		 SLang_set_error (SL_DIVIDE_ERROR);
+		 return -1;
+	 }
+#endif
+	 z0 = to_double((VOID_STAR)a);
+	 z1 = 0.0;
+	 SLcomplex_divide (c + n, z, b);
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_EQ: 		 /* == */
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 icn/2 = ((to_double((VOID_STAR)a) == b0) && (0.0 == b1));
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_NE:		 /* != */
+	for (n = 0; n < n_max; n += 2)
+	 {
+	 icn/2 = ((to_double((VOID_STAR)a) != b0) || (0.0 != b1));
+	 a += da; b += db;
+	 }
+	break;
+ }
+
+ return 1;
+}
+
+static int complex_unary_result (int op, SLtype a, SLtype *b)
+{
+ (void) a;
+
+ switch (op)
+ {
+ default:
+	return 0;
+
+ case SLANG_PLUSPLUS:
+ case SLANG_MINUSMINUS:
+ case SLANG_CHS:
+ case SLANG_MUL2:
+	*b = SLANG_COMPLEX_TYPE;
+	break;
+
+ case SLANG_SQR:		 /* |Real|^2 + |Imag|^2 ==> double */
+ case SLANG_ABS:		 /* |z| ==> double */
+	*b = SLANG_DOUBLE_TYPE;
+	break;
+
+ case SLANG_SIGN:
+	*b = SLANG_INT_TYPE;
+	break;
+ }
+ return 1;
+}
+
+static int complex_unary (int op,
+			 SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+			 VOID_STAR bp)
+{
+ SLuindex_Type n;
+ double *a, *b;
+ int *ic;
+
+ (void) a_type;
+
+ a = (double *) ap;
+ b = (double *) bp;
+ ic = (int *) bp;
+
+ na = 2 * na;
+
+ switch (op)
+ {
+ default:
+	return 0;
+
+ case SLANG_PLUSPLUS:
+	for (n = 0; n < na; n += 2) bn = (an + 1);
+	break;
+ case SLANG_MINUSMINUS:
+	for (n = 0; n < na; n += 2) bn = (an - 1);
+	break;
+ case SLANG_CHS:
+	for (n = 0; n < na; n += 2)
+	 {
+	 bn = -(an);
+	 bn + 1 = -(an + 1);
+	 }
+	break;
+ case SLANG_SQR:		 /* |Real|^2 + |Imag|^2 ==> double */
+	for (n = 0; n < na; n += 2)
+	 bn/2 = (an * an + an + 1 * an + 1);
+	break;
+
+ case SLANG_MUL2:
+	for (n = 0; n < na; n += 2)
+	 {
+	 bn = (2 * an);
+	 bn + 1 = (2 * an + 1);
+	 }
+	break;
+
+ case SLANG_ABS:		 /* |z| ==> double */
+	for (n = 0; n < na; n += 2)
+	 bn/2 = SLcomplex_abs (a + n);
+	break;
+
+ case SLANG_SIGN:
+	/* Another creative extension. Lets return an integer which indicates
+	 * whether the complex number is in the upperhalf plane or not.
+	 */
+	for (n = 0; n < na; n += 2)
+	 {
+	 if (an + 1 < 0.0) icn/2 = -1;
+	 else if (an + 1 > 0.0) icn/2 = 1;
+	 else icn/2 = 0;
+	 }
+	break;
+ }
+
+ return 1;
+}
+
+static int
+complex_typecast (SLtype from_type, VOID_STAR from, SLuindex_Type num,
+		 SLtype to_type, VOID_STAR to)
+{
+ double *z;
+ double *d;
+ char *i;
+ SLuindex_Type n;
+ unsigned int sizeof_i;
+ SLang_To_Double_Fun_Type to_double;
+
+ (void) to_type;
+
+ z = (double *) to;
+
+ switch (from_type)
+ {
+ default:
+	if (NULL == (to_double = SLarith_get_to_double_fun (from_type, &sizeof_i)))
+	 return 0;
+	i = (char *) from;
+	for (n = 0; n < num; n++)
+	 {
+	 *z++ = to_double ((VOID_STAR) i);
+	 *z++ = 0.0;
+
+	 i += sizeof_i;
+	 }
+	break;
+
+ case SLANG_DOUBLE_TYPE:
+	d = (double *) from;
+	for (n = 0; n < num; n++)
+	 {
+	 *z++ = dn;
+	 *z++ = 0.0;
+	 }
+	break;
+ }
+
+ return 1;
+}
+
+static void complex_destroy (SLtype type, VOID_STAR ptr)
+{
+ (void) type;
+ SLfree ((char *)*(double **) ptr);
+}
+
+static int complex_push (SLtype type, VOID_STAR ptr)
+{
+ double *z;
+
+ (void) type;
+ z = *(double **) ptr;
+ return SLang_push_complex (z0, z1);
+}
+
+static int complex_pop (SLtype type, VOID_STAR ptr)
+{
+ double *z;
+
+ (void) type;
+ z = *(double **) ptr;
+ return SLang_pop_complex (&z0, &z1);
+}
+
+int _pSLinit_slcomplex (void)
+{
+ SLang_Class_Type *cl;
+ SLtype *types;
+
+ if (NULL == (cl = SLclass_allocate_class ("Complex_Type")))
+ return -1;
+
+ (void) SLclass_set_destroy_function (cl, complex_destroy);
+ (void) SLclass_set_push_function (cl, complex_push);
+ (void) SLclass_set_pop_function (cl, complex_pop);
+
+ if (-1 == SLclass_register_class (cl, SLANG_COMPLEX_TYPE, 2 * sizeof (double),
+				 SLANG_CLASS_TYPE_VECTOR))
+ return -1;
+
+ types = _pSLarith_Arith_Types;
+ while (*types != SLANG_DOUBLE_TYPE)
+ {
+	SLtype t = *types++;
+
+	if ((-1 == SLclass_add_binary_op (t, SLANG_COMPLEX_TYPE, generic_complex_binary, complex_binary_result))
+	 || (-1 == SLclass_add_binary_op (SLANG_COMPLEX_TYPE, t, complex_generic_binary, complex_binary_result))
+	 || (-1 == (SLclass_add_typecast (t, SLANG_COMPLEX_TYPE, complex_typecast, 1))))
+	 return -1;
+ }
+
+ if ((-1 == (SLclass_add_binary_op (SLANG_COMPLEX_TYPE, SLANG_COMPLEX_TYPE, complex_complex_binary, complex_binary_result)))
+ || (-1 == (SLclass_add_binary_op (SLANG_COMPLEX_TYPE, SLANG_DOUBLE_TYPE, complex_double_binary, complex_binary_result)))
+ || (-1 == (SLclass_add_binary_op (SLANG_DOUBLE_TYPE, SLANG_COMPLEX_TYPE, double_complex_binary, complex_binary_result)))
+ || (-1 == (SLclass_add_unary_op (SLANG_COMPLEX_TYPE, complex_unary, complex_unary_result)))
+ || (-1 == (SLclass_add_typecast (SLANG_DOUBLE_TYPE, SLANG_COMPLEX_TYPE, complex_typecast, 1))))
+ return -1;
+
+ return 0;
+}
+
+#endif				 /* if SLANG_HAS_COMPLEX */
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slcombin.h Added

@@ -0,0 +1,784 @@
+/* This file was automatically created by ./mktables */
+#define SL_COMBINING_MAX_CHAR 0xE0200ul
+
+#define SL_COMBINING_ALOOKUP(y,x) \
+{ \
+ const unsigned char *_t; \
+ (y) = (((unsigned)(x) < SL_COMBINING_MAX_CHAR) \
+	 && (NULL != (_t = _pSLwc_Combining_Table(unsigned)(x)>>9)) \
+	 && (_t(unsigned)((x)>>3)&0x3F & (1 << ((x)&7)))); \
+}
+extern const unsigned char *_pSLwc_Combining_Table1793;
+
+#ifdef DEFINE_PSLWC_COMBINING_TABLE
+static const unsigned char Table_0164 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+ /*0x28-0x2F*/ 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_0264 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0xF8, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0xFE, 0xFF, 0xFF, 0xFF, 0xFF, 0xBF,
+ /*0x38-0x3F*/ 0xB6, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_0364 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0xFF, 0x07, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0xF8, 0xFF, 0xFF, 0x00, 0x00, 0x01, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0xC0, 0x9F, 0x9F, 0x3D, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x02, 0x00, 0x00, 0x00, 0xFF, 0xFF,
+ /*0x28-0x2F*/ 0xFF, 0x07, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0xC0, 0xFF, 0x01, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0xF8, 0x0F, 0x00
+};
+
+static const unsigned char Table_0464 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0xC0, 0xFB, 0xEF, 0x3E, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x0E, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0xF0, 0xFF, 0xFB, 0xFF, 0xFF, 0xFF,
+ /*0x20-0x27*/ 0x07, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x14,
+ /*0x28-0x2F*/ 0xFE, 0x21, 0xFE, 0x00, 0x0C, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10,
+ /*0x38-0x3F*/ 0x1E, 0x20, 0x00, 0x00, 0x0C, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_0564 =
+{
+ /*0x00-0x07*/ 0x06, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10,
+ /*0x08-0x0F*/ 0x86, 0x39, 0x02, 0x00, 0x00, 0x00, 0x23, 0x00,
+ /*0x10-0x17*/ 0x06, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10,
+ /*0x18-0x1F*/ 0xBE, 0x21, 0x00, 0x00, 0x0C, 0x00, 0x00, 0xFC,
+ /*0x20-0x27*/ 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x90,
+ /*0x28-0x2F*/ 0x1E, 0x20, 0x40, 0x00, 0x0C, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x01, 0x20, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_0664 =
+{
+ /*0x00-0x07*/ 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xC0,
+ /*0x08-0x0F*/ 0xC1, 0x3D, 0x60, 0x00, 0x0C, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x90,
+ /*0x18-0x1F*/ 0x40, 0x30, 0x00, 0x00, 0x0C, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x03, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x18,
+ /*0x28-0x2F*/ 0x1E, 0x20, 0x00, 0x00, 0x0C, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x04, 0x5C, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_0764 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xF2, 0x07,
+ /*0x08-0x0F*/ 0x80, 0x7F, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xF2, 0x1B,
+ /*0x18-0x1F*/ 0x00, 0x3F, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x03, 0x00, 0x00, 0xA0, 0x02,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xFE, 0x7F,
+ /*0x30-0x37*/ 0xDF, 0xE0, 0xFF, 0xFE, 0xFF, 0xFF, 0xFF, 0x1F,
+ /*0x38-0x3F*/ 0x40, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_0864 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0xE0, 0xFD, 0x66,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0xC3, 0x01, 0x00, 0x1E, 0x00,
+ /*0x10-0x17*/ 0x64, 0x20, 0x00, 0x20, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0xFF, 0xFF, 0xFF, 0xFF,
+ /*0x30-0x37*/ 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+ /*0x38-0x3F*/ 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF
+};
+
+static const unsigned char Table_0964 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0xE0, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_1064 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x1C, 0x00, 0x00, 0x00, 0x1C, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x0C, 0x00, 0x00, 0x00, 0x0C, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xB0, 0x3F,
+ /*0x38-0x3F*/ 0x40, 0xFE, 0x0F, 0x20, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_1164 =
+{
+ /*0x00-0x07*/ 0x00, 0x38, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x60, 0x00, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x87, 0x01, 0x04, 0x0E,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_1264 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x80, 0x09, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x40, 0x7F, 0xE5, 0x1F, 0xF8, 0x9F,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xFF, 0x7F,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x0F, 0x00, 0x00, 0x00, 0x00, 0x00, 0xD0, 0x17,
+ /*0x28-0x2F*/ 0x04, 0x00, 0x00, 0x00, 0x00, 0xF8, 0x0F, 0x00,
+ /*0x30-0x37*/ 0x03, 0x00, 0x00, 0x00, 0x3C, 0x3B, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x40, 0xA3, 0x03, 0x00
+};
+
+static const unsigned char Table_1364 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0xF0, 0xCF, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0xF7, 0xFF, 0xFD, 0x21, 0x10, 0x03,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFB
+};
+
+static const unsigned char Table_1464 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0xFF, 0xFF, 0xFF, 0xFF, 0x01, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_1564 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x80, 0x03, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0xFF, 0xFF, 0xFF, 0xFF
+};
+
+static const unsigned char Table_1664 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x3C, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x06, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_1764 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x80, 0xF7, 0x3F,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0xC0, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x03, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_1864 =
+{
+ /*0x00-0x07*/ 0x44, 0x08, 0x00, 0x00, 0x60, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x30, 0x00, 0x00, 0x00, 0xFF, 0xFF, 0x03, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0xC0, 0x3F, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x80, 0xFF, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x07, 0x00, 0x00, 0x00, 0x00, 0x00, 0xC8, 0x13,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x20, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_1964 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x7E, 0x66, 0x00,
+ /*0x08-0x0F*/ 0x08, 0x10, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x9D, 0xC1,
+ /*0x18-0x1F*/ 0x02, 0x00, 0x00, 0x00, 0x00, 0x30, 0x40, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x20, 0x21, 0x00, 0x00
+};
+
+static const unsigned char Table_2064 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x40, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_2164 =
+{
+ /*0x00-0x07*/ 0xFF, 0xFF, 0x00, 0x00, 0xFF, 0xFF, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_2264 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x20
+};
+
+static const unsigned char Table_2364 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xC0, 0x07,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_2464 =
+{
+ /*0x00-0x07*/ 0x6E, 0xF0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x87,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x60, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_2564 =
+{
+ /*0x00-0x07*/ 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xFF,
+ /*0x08-0x0F*/ 0x7F, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80,
+ /*0x10-0x17*/ 0x03, 0x00, 0x00, 0x00, 0x00, 0x00, 0x78, 0x06,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x07, 0x00, 0x00, 0x00, 0x80, 0xEF, 0x1F, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x08, 0x00,
+ /*0x30-0x37*/ 0x03, 0x00, 0x00, 0x00, 0x00, 0x00, 0xC0, 0x7F,
+ /*0x38-0x3F*/ 0x00, 0x1C, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_2664 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x80, 0xD3, 0x40,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x80, 0xF8, 0x07, 0x00, 0x00,
+ /*0x20-0x27*/ 0x03, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10,
+ /*0x28-0x2F*/ 0x01, 0x00, 0x00, 0x00, 0xC0, 0x1F, 0x1F, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_2764 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xFF,
+ /*0x08-0x0F*/ 0x5C, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xF8, 0x85,
+ /*0x18-0x1F*/ 0x0D, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x3C, 0xB0,
+ /*0x38-0x3F*/ 0x01, 0x00, 0x00, 0x30, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_2864 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xF8, 0xA7,
+ /*0x08-0x0F*/ 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x28, 0xBF, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0xE0, 0xBC, 0x0F, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_2964 =
+{
+ /*0x00-0x07*/ 0x7E, 0x06, 0x00, 0x00, 0x00, 0x00, 0xF8, 0x79,
+ /*0x08-0x0F*/ 0x80, 0x00, 0x7E, 0x0E, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0xFC, 0x7F, 0x03, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_3064 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x7F, 0xBF,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0xFC, 0xFF, 0xFF, 0xFC, 0x6D, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x7E, 0xB4,
+ /*0x28-0x2F*/ 0xBF, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_3164 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x1F, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x7F, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_3264 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x80, 0x07, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_3364 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x60, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_3464 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x80, 0x03, 0x00, 0xF8,
+ /*0x30-0x37*/ 0xE7, 0x0F, 0x00, 0x00, 0x00, 0x3C, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_3564 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x1C, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_3664 =
+{
+ /*0x00-0x07*/ 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x7F, 0xF8,
+ /*0x08-0x0F*/ 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x1F, 0x20, 0x00,
+ /*0x10-0x17*/ 0x10, 0x00, 0x00, 0xF8, 0xFE, 0xFF, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_3764 =
+{
+ /*0x00-0x07*/ 0x7F, 0xFF, 0xFF, 0xF9, 0xDB, 0x07, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_3864 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x7F, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0xF0, 0x07, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_3964 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+ /*0x28-0x2F*/ 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+ /*0x30-0x37*/ 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+ /*0x38-0x3F*/ 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x00, 0x00
+};
+
+const unsigned char *_pSLwc_Combining_Table1793 =
+{
+ NULL, Table_01, Table_02, Table_03, Table_04, Table_05,
+ Table_06, Table_07, Table_08, Table_09, NULL, Table_10,
+ Table_11, Table_12, Table_13, NULL, Table_14, NULL,
+ NULL, NULL, NULL, NULL, Table_15, NULL,
+ Table_16, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, Table_17,
+ Table_18, Table_19, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, Table_20,
+ NULL, Table_21, Table_22, Table_23, NULL, NULL,
+ NULL, Table_24, NULL, NULL, Table_25, Table_26,
+ Table_27, Table_28, NULL, Table_29, Table_30, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, Table_31, NULL, Table_32, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ Table_33, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, Table_34, Table_35,
+ NULL, NULL, NULL, Table_36, NULL, NULL,
+ Table_37, NULL, NULL, NULL, Table_38, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, NULL, NULL,
+ NULL, NULL, NULL, NULL, Table_39
+};
+#endif /* DEFINE_PSLWC_COMBINING_TABLE */

_service:tar_scm:slang-2.3.2.tar.bz2/src/slcommon.c Added

@@ -0,0 +1,371 @@
+/* This file contains library-wide symbols that are always needed when one
+ * links to the library.
+ */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#ifndef _GNU_SOURCE
+# define _GNU_SOURCE
+#endif
+#include "slinclud.h"
+
+#include <errno.h>
+#include "slang.h"
+#include "_slang.h"
+
+#ifdef HAVE_LOCALE_H
+# include <locale.h>
+#endif
+
+#ifdef HAVE_LANGINFO_H
+# include <langinfo.h>
+#endif
+
+#if defined(__WIN32__)
+# include <windows.h>
+#endif
+
+#define SLSYSWRAP_REALLOC realloc
+#define SLSYSWRAP_MALLOC malloc
+#ifdef SLSYSWRAP
+# include <slsyswrap.h>
+#endif
+
+int SLang_Version = SLANG_VERSION;
+SLFUTURE_CONST char *SLang_Version_String = SLANG_VERSION_STRING;
+
+int _pSLinterp_UTF8_Mode = 0;
+int _pSLtt_UTF8_Mode = 0;
+int _pSLutf8_mode = 0;
+
+#ifndef HAVE_LOCALE_H
+# define setlocale(x,y) (NULL)
+# define LC_ALL 0
+#endif
+
+int SLutf8_is_utf8_mode (void)
+{
+ return _pSLutf8_mode;
+}
+
+int SLinterp_utf8_enable (int mode)
+{
+ if (mode == -1)
+ mode = _pSLutf8_mode;
+
+ return _pSLinterp_UTF8_Mode = mode;
+}
+
+int SLinterp_is_utf8_mode (void)
+{
+ return _pSLinterp_UTF8_Mode;
+}
+
+static int utf8_enable (int mode)
+{
+ char *locale;
+
+ if (mode != -1)
+ return (mode != 0);
+
+#if defined(__WIN32__)
+ if (GetConsoleOutputCP () == 65001)
+ return 1;
+#endif
+
+ (void) setlocale (LC_ALL, "");
+
+#ifdef HAVE_NL_LANGINFO_CODESET
+ locale = nl_langinfo (CODESET);
+# ifdef SLSYSWRAP
+ {
+	char *env;
+	if ((NULL != (env = getenv ("SLTEST_NO_LANGINFO")))
+	 && (atoi (env) != 0))
+	 locale = NULL;		 /* skip this block of code */
+ }
+# endif
+ if ((locale != NULL) && (*locale))
+ {
+	if ((0 == strcmp (locale, "UTF-8"))
+	 || (0 == strcmp (locale, "utf-8"))
+	 || (0 == strcmp (locale, "utf8"))
+	 || (0 == strcmp (locale, "UTF8")))
+	 return 1;
+
+	return 0;
+ }
+#endif
+
+ locale = setlocale (LC_ALL, "");
+
+ if (((locale == NULL) || (*locale == 0))
+ && ((NULL == (locale = getenv ("LC_ALL"))) || (*locale == 0))
+ && ((NULL == (locale = getenv ("LC_CTYPE"))) || (*locale == 0))
+ && ((NULL == (locale = getenv ("LANG"))) || (*locale == 0)))
+ return 0;
+
+ /* setlocale man page says the return value is something like:
+ * language_territory.codeset@modifier+special,...
+ * Here, we want the codeset, if present.
+ */
+
+ while (*locale && (*locale != '.') && (*locale != '@')
+	 && (*locale != '+') && (*locale != ','))
+ locale++;
+
+ if (*locale == '.')
+ {
+	locale++;
+	if (0 == strncmp (locale, "UTF-8", 5))
+	 locale += 5;
+	else if (0 == strncmp (locale, "utf8", 4))
+	 locale += 4;
+	else
+	 return 0;
+
+	if ((*locale == 0) || (*locale == '@')
+	 || (*locale == '+') || (*locale == ','))
+	 return 1;
+ }
+
+ return 0;
+}
+
+/* Returns the value of _pSLutf8_mode */
+int SLutf8_enable (int mode)
+{
+ char *cjk;
+
+ mode = utf8_enable (mode);
+ _pSLutf8_mode = mode;
+ _pSLtt_UTF8_Mode = mode;
+ _pSLinterp_UTF8_Mode = mode;
+ if (mode && (NULL != (cjk = getenv ("WCWIDTH_CJK_LEGACY"))))
+ {
+	if ((*cjk == 0) || (0==strcmp(cjk,"yes")))
+	 (void) SLwchar_set_wcwidth_flags (SLWCWIDTH_CJK_LEGACY);
+ }
+ return mode;
+}
+
+/* Mallocing 0 bytes leads to undefined behavior. Some C libraries will
+ * return NULL, and others return non-NULL. Here, if 0 bytes is requested,
+ * and the library malloc function returns NULL, then malloc will be retried
+ * using 1 byte.
+ */
+SLFUTURE_VOID *SLmalloc (SLstrlen_Type len)
+{
+ SLFUTURE_VOID *p;
+
+ if (NULL != (p = (SLFUTURE_VOID *)SLSYSWRAP_MALLOC(len)))
+ return p;
+
+ if (len || (NULL == (p = (SLFUTURE_VOID *)SLSYSWRAP_MALLOC(1))))
+ SLang_set_error (SL_MALLOC_ERROR);
+
+ return p;
+}
+
+void SLfree (SLFUTURE_VOID *p)
+{
+ if (p != NULL) free (p);
+}
+
+SLFUTURE_VOID *SLrealloc (SLFUTURE_VOID *p, SLstrlen_Type len)
+{
+ if (len == 0)
+ {
+	SLfree (p);
+	return NULL;
+ }
+
+ if (p == NULL) p = SLmalloc (len);
+ else
+ {
+	p = (SLFUTURE_VOID *) SLSYSWRAP_REALLOC(p, len);
+	if (p == NULL)
+	 SLang_set_error (SL_MALLOC_ERROR);
+ }
+ return p;
+}
+
+SLFUTURE_VOID *_SLrecalloc (SLFUTURE_VOID *p, SLstrlen_Type nelems, SLstrlen_Type len)
+{
+ unsigned int nlen = nelems * len;
+
+ if (nelems && (nlen/nelems != len))
+ {
+	SLang_set_error (SL_Malloc_Error);
+	return NULL;
+ }
+ return SLrealloc (p, nlen);
+}
+
+SLFUTURE_VOID *_SLcalloc (SLstrlen_Type nelems, SLstrlen_Type len)
+{
+ SLstrlen_Type nlen = nelems * len;
+
+ if (nelems && (nlen/nelems != len))
+ {
+	SLang_set_error (SL_Malloc_Error);
+	return NULL;
+ }
+ return SLmalloc (nlen);
+}
+
+SLFUTURE_VOID *SLcalloc (SLstrlen_Type nelems, SLstrlen_Type len)
+{
+ SLFUTURE_VOID *p = _SLcalloc (nelems, len);
+ if (p != NULL) memset (p, 0, len*nelems);
+ return p;
+}
+
+int _pSLsecure_issetugid (void)
+{
+#ifdef HAVE_ISSETUGID
+ return (1 == issetugid ());
+#else
+# if defined(HAVE_GETUID) && defined(HAVE_GETEUID) && defined(HAVE_GETGID) && defined(HAVE_GETEUID)
+ static int enable_secure;
+ if (enable_secure == 0)
+ {
+	if ((getuid () != geteuid ())
+	 || (getgid () != getegid ()))
+	 enable_secure = 1;
+	else
+	 enable_secure = -1;
+ }
+ return (enable_secure == 1);
+# else
+ return 0;
+# endif
+#endif
+}
+
+/* Like getenv, except if running as setuid or setgid, returns NULL */
+char *_pSLsecure_getenv (SLCONST char *s)
+{
+ if (_pSLsecure_issetugid ())
+ return NULL;
+ return getenv (s);
+}
+
+typedef struct Interrupt_Hook_Type
+{
+ int (*func)(VOID_STAR);
+ VOID_STAR client_data;
+ struct Interrupt_Hook_Type *next;
+}
+Interrupt_Hook_Type;
+
+static Interrupt_Hook_Type *Interrupt_Hooks = NULL;
+
+static Interrupt_Hook_Type *
+ find_interrupt_hook (int (*func)(VOID_STAR), VOID_STAR cd,
+		 Interrupt_Hook_Type **prevp)
+{
+ Interrupt_Hook_Type *h = Interrupt_Hooks;
+ Interrupt_Hook_Type *prev = NULL;
+ while (h != NULL)
+ {
+	if ((h->func == func) && (h->client_data == cd))
+	 {
+	 if (prevp != NULL)
+	 *prevp = prev;
+	 return h;
+	 }
+	prev = h;
+	h = h->next;
+ }
+ return NULL;
+}
+
+int SLang_add_interrupt_hook (int (*func)(VOID_STAR), VOID_STAR cd)
+{
+ Interrupt_Hook_Type *h;
+
+ if (NULL != find_interrupt_hook (func, cd, NULL))
+ return 0;
+
+ if (NULL == (h = (Interrupt_Hook_Type *)SLmalloc (sizeof (Interrupt_Hook_Type))))
+ return -1;
+
+ h->func = func;
+ h->client_data = cd;
+ h->next = Interrupt_Hooks;
+ Interrupt_Hooks = h;
+ return 0;
+}
+
+void SLang_remove_interrupt_hook (int (*func)(VOID_STAR), VOID_STAR cd)
+{
+ Interrupt_Hook_Type *h, *hprev;
+
+ if (NULL == (h = find_interrupt_hook (func, cd, &hprev)))
+ return;
+
+ if (hprev == NULL)
+ Interrupt_Hooks = h->next;
+ else
+ hprev->next = h->next;
+
+ SLfree ((char *) h);
+}
+
+int SLang_handle_interrupt (void)
+{
+ Interrupt_Hook_Type *h;
+ int status = 0;
+ int e = errno;
+ int se = _pSLerrno_errno;
+
+ h = Interrupt_Hooks;
+ while (h != NULL)
+ {
+	if (-1 == (*h->func)(h->client_data))
+	 status = -1;
+
+	h = h->next;
+ }
+ errno = e;
+ _pSLerrno_errno = se;
+ return status;
+}
+
+int _pSLerrno_errno;
+
+int SLerrno_set_errno (int sys_errno)
+{
+ _pSLerrno_errno = sys_errno;
+ return 0;
+}
+
+#if defined(__WIN32__) && defined(SLANG_DLL)
+# include <windows.h>
+
+/* where is the prototype for DllMain? */
+BOOL WINAPI DllMain(HANDLE hInstance,DWORD dwReason,LPVOID lpParam);
+
+BOOL WINAPI DllMain(HANDLE hInstance,DWORD dwReason,LPVOID lpParam)
+{
+ return 1;
+}
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/slcompat.c Added

@@ -0,0 +1,47 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+/* Compatibility */
+int SLang_init_slunix (void)
+{
+   if ((-1 == SLang_init_posix_dir ())
+       || (-1 == SLang_init_posix_process ())
+       || (-1 == SLdefine_for_ifdef ("__SLUNIX__")))
+     return -1;
+
+   return 0;
+}
+
+int SLang_init_slfile (void)
+{
+   if ((-1 == SLang_init_stdio ())
+       || (-1 == SLang_init_posix_dir ())
+       || (-1 == SLdefine_for_ifdef("__SLFILE__")))
+     return -1;
+
+   return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slconfig.h Added

@@ -0,0 +1,376 @@
+/* This configuration file is for all non-Unix OS */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#ifndef SL_CONFIG_H
+#define SL_CONFIG_H
+
+#ifdef VMS
+# ifdef __DECC
+# define HAVE_STDLIB_H
+# endif
+/* Borland's compiler complains about long constants, so I will work
+ * around it as follows:
+ */
+# define VMS_VERSION_602 60200000
+# define VMS_VERSION_700 70000000
+# if __VMS_VER >= VMS_VERSION_602
+# define HAVE_UNISTD_H
+# endif
+#endif
+
+/* JMS:BC5 The Borland v5.x compiler defines some things that other versions,
+ * and MSC don't, so we can check for those using ifdef __BORLAND_V5__
+ */
+
+#if defined(__BORLANDC__) && ((__BORLANDC__>>8) == 0x5)
+# define __BORLAND_V5__
+#endif
+
+#if defined(__WATCOMC__) && defined(__DOS__)
+# define DOS386
+#endif
+
+/* Set of the various defines for pc systems. This includes OS/2 */
+
+/* DJGPP has a split personality. It tries implement a unix like environment
+ * under MSDOS. Unfortunately, the personalities clash.
+ */
+#ifdef __GO32__
+# ifndef __DJGPP__
+# define __DJGPP__ 1
+# endif
+#endif
+
+#if defined(__DJGPP__) || defined(__CYGWIN32__) || defined(__MINGW32__)
+# ifdef REAL_UNIX_SYSTEM
+# undef REAL_UNIX_SYSTEM
+# endif
+#endif
+
+#if defined(__MSDOS__) || defined(__DOS__)
+# ifndef __MSDOS__
+# define __MSDOS__
+# endif
+# ifndef IBMPC_SYSTEM
+# define IBMPC_SYSTEM
+# endif
+#endif
+
+#if defined(OS2) || defined(__OS2__)
+# ifndef IBMPC_SYSTEM
+# define IBMPC_SYSTEM
+# endif
+# ifndef __os2__
+# define __os2__
+# endif
+#endif
+
+#if defined(__CYGWIN32__) || defined(__MINGW32__)
+# ifndef __WIN32__
+# define __WIN32__
+# endif
+#endif
+
+#if defined(WIN32) || defined(__WIN32__)
+# ifndef IBMPC_SYSTEM
+# define IBMPC_SYSTEM
+# endif
+# ifndef __WIN32__
+# define __WIN32__
+# endif
+#endif
+
+#if defined(__MSDOS__) && !defined(__GO32__) && !defined(DOS386) && !defined(__WIN32__)
+# ifndef __MSDOS_16BIT__
+# define __MSDOS_16BIT__	1
+# endif
+#endif
+
+#if defined(MSWINDOWS)
+# ifndef IBMPC_SYSTEM
+# define IBMPC_SYSTEM
+# endif
+# ifndef __WIN16__
+# define __WIN16__
+# endif
+#endif
+
+#if defined(__WIN16__) || defined(__MSDOS_16BIT__)
+# define __16_BIT_SYSTEM__	1
+#endif
+
+#if defined(__WATCOMC__) && !defined(__QNX__)
+# undef unix
+# undef __unix__
+#endif /* __WATCOMC__ */
+
+#ifdef IBMPC_SYSTEM
+# define HAVE_STDLIB_H
+# define HAVE_PUTENV
+# if defined(__GO32__) || defined(__MINGW32__) || defined(__CYGWIN32__)
+# define HAVE_UNISTD_H
+# endif
+#endif
+
+#ifdef VMS
+# if __VMS_VER >= VMS_VERSION_700
+# define HAVE_MEMORY_H
+# endif
+#else
+# if !defined(__WATCOMC__)
+# define HAVE_MEMORY_H
+# endif
+#endif
+
+#define HAVE_MEMCPY
+#define HAVE_MEMSET
+
+#if !defined(VMS) || (__VMS_VER >= VMS_VERSION_700)
+# define HAVE_MEMCMP
+# define HAVE_MEMCHR
+# define HAVE_FCNTL_H
+#endif
+
+#if defined(__WIN32__)
+# define HAVE_ENVIRON 1
+#endif
+
+#define HAVE_GETCWD 1
+
+#ifndef VMS
+# define HAVE_VFSCANF	1
+# define HAVE_STRTOD	1
+#endif
+
+/* Does VMS have this??? */
+#if !defined(VMS) && !defined(_MSC_VER) && (!defined(__WATCOMC__) || defined(__QNX__))
+# define HAVE_DIRENT_H	1
+#endif
+
+#if defined(VMS) || (defined(__WATCOMC__) && !defined(__QNX__))
+# define HAVE_DIRECT_H 1
+#endif
+
+#if defined(__unix__) || (defined(VMS) && (__VMS_VER >= VMS_VERSION_700))
+# define HAVE_KILL 1
+# define HAVE_CHOWN 1
+#endif
+
+#undef HAVE_LSTAT
+#undef HAVE_LCHOWN
+
+#define HAVE_ATEXIT	1
+
+/* Do these systems have these functions? For now, assume the worst */
+#undef HAVE_GETPPID
+#undef HAVE_GETGID
+#undef HAVE_GETEGID
+#undef HAVE_GETEUID
+#undef HAVE_SETGID
+#undef HAVE_SETPGID
+#undef HAVE_SETUID
+#undef HAVE_ISSETUGID
+
+/* Needed for tic/toc */
+#undef HAVE_TIMES
+#undef HAVE_SYS_TIMES_H
+
+#undef HAVE_ALARM
+#undef HAVE_PAUSE
+
+#undef HAVE_GETITIMER
+#undef HAVE_SETITIMER
+
+#undef HAVE_SYS_TIME_H
+#undef HAVE_GETTIMEOFDAY
+
+#undef HAVE_GMTIME
+#undef HAVE_GMTIME_R
+#undef HAVE_LOCALTIME_R
+#undef HAVE_CTIME_R
+
+#ifdef __unix__
+# define HAVE_GMTIME	1
+#endif
+#define HAVE_MKTIME	1
+
+#undef HAVE_SYMLINK
+#undef HAVE_LINK
+#undef HAVE_READLINK
+#undef HAVE_UNAME
+
+#if defined(__MINGW32__)
+# define HAVE_UTIME
+# define HAVE_UTIME_H
+#endif
+#undef HAVE_UTIMES
+
+#undef HAVE_POPEN
+#if defined(__MINGW32__)
+# define HAVE_POPEN 1
+#endif
+
+/* #define HAVE_ROUND	1 */
+#if !defined(__os2__) && !defined(__WATCOMC__)
+# ifndef VMS			 /* FIXME */
+# define HAVE_FINITE	1
+# define HAVE_ISNAN	1
+# define HAVE_ISINF	1
+# endif
+#endif
+
+#define HAVE_HYPOT	1
+#define HAVE_ATAN2	1
+#define HAVE_FREXP	1
+#undef HAVE_FREXPF
+#define HAVE_LDEXP	1
+#undef HAVE_LDEXPF
+#undef HAVE_SINCOS
+#undef HAVE_SINCOSF
+
+#if defined(__WIN32__)
+# define isnan _isnan
+# define finite _finite
+#endif
+
+/* FPU control unit headers and functions */
+#undef HAVE_FLOATINGPOINT_H
+#undef HAVE_NAN_H
+#undef HAVE_IEEEFP_H
+#undef HAVE_FENV_H
+
+#undef HAVE_FECLEAREXCEPT
+#undef HAVE_FPSETSTICKY
+
+/* Define if you have the vsnprintf, snprintf functions and they return
+ * EOF upon failure.
+ */
+#undef HAVE_VSNPRINTF
+#undef HAVE_SNPRINTF
+
+#ifdef _MSC_VER
+# define HAVE_VSNPRINTF 1
+# define HAVE_SNPRINTF 1
+# if _MSC_VER < 1400
+/* Grrr, older versions of Visual Studio have vnsprintf, but with an '_'. */
+# define vsnprintf _vsnprintf
+# endif
+#endif
+
+/* Some compilers may not have definitions for these. */
+/* #define mode_t int */
+/* #define pid_t int */
+/* #define uid_t int */
+/* #define gid_t int */
+/* #define off_t int */
+/* #define size_t unsigned int */
+
+#if defined(__MINGW64__)
+# define _FILE_OFFSET_BITS 64 /* Makes sizeof(off_t) == 8 */
+# define SIZEOF_SIZE_T 8
+# define SIZEOF_OFF_T 8
+#else
+# if defined(__LP64__) /* gcc only??? 64-bit */
+# define SIZEOF_OFF_T	8
+# define SIZEOF_SIZE_T	8
+# else
+# if defined(__WIN64__)
+# define SIZEOF_OFF_T	4	 /* yes, 4 */
+# define SIZEOF_SIZE_T 8
+# else
+# define SIZEOF_OFF_T	4
+# define SIZEOF_SIZE_T 4
+# endif
+# endif
+#endif
+
+#define HAVE_LONG_LONG 1
+#define SIZEOF_LONG_LONG 8
+
+#define HAVE_SETVBUF
+
+#if defined (__EMX__) || defined(__BORLANDC__) || defined(__IBMC__) || defined(_MSC_VER) || defined(__WATCOMC__)
+# define HAVE_IO_H
+#endif
+
+#if defined(_MSC_VER) || defined(__IBMC__) || defined(__BORLANDC__) || defined(__MINGW32__) || defined(__WATCOMC__)
+# define HAVE_PROCESS_H
+#endif
+
+#ifdef _MSC_VER
+# define HAVE_POPEN	1
+# define popen _popen
+# define pclose _pclose
+#endif
+
+#ifdef VMS
+# define SIZEOF_SHORT	2
+# define SIZEOF_INT	4
+# if defined(__alpha__) || defined(__ALPHA__) || defined(__alpha)
+/* Apparantly, when compaq bought digital, the size of the long was reduced
+ * to 4 bytes for the alpha on VMS. On unix it is still 8 bytes.
+ */
+# define SIZEOF_LONG	4
+# else
+# define SIZEOF_LONG	4
+# endif
+# define SIZEOF_FLOAT	4
+# define SIZEOF_DOUBLE	8
+
+#else				 /* NOT VMS */
+
+# define SIZEOF_SHORT	2
+# if defined(__WIN16__) || defined(__MSDOS_16BIT__)
+# define SIZEOF_INT	2
+#else
+# define SIZEOF_INT	4
+#endif
+#define SIZEOF_LONG	4
+#define SIZEOF_FLOAT	4
+#define SIZEOF_DOUBLE	8
+
+#endif				 /* ifdef VMS */
+
+#ifndef HAVE_LONG_LONG
+# undef SIZEOF_LONG_LONG
+# define SIZEOF_LONG_LONG 0
+#endif
+
+#ifdef HAVE_LONG_LONG
+# define HAVE_ATOLL	1
+# define HAVE_STRTOLL	1
+#endif
+
+#undef HAVE_FORK
+#undef HAVE_WAITPID
+#undef HAVE_TTYNAME
+#undef HAVE_TTYNAME_R
+#undef HAVE_GETRUSAGE
+
+/* Files used by the slang-readline interface. The interface first tries
+ * to read SLRLINE_USER_INIT_FILE from $HOME, and if that does not exist, it
+ * will read SLRLINE_SYS_INIT_FILE from the load path.
+ */
+#define SLRLINE_USER_INIT_FILE	"slrline.rc"
+#define SLRLINE_SYS_INIT_FILE	"rline/slrline.rc"
+
+#endif				 /* ifndef SL_CONFIG_H */

_service:tar_scm:slang-2.3.2.tar.bz2/src/slcurses.c Added

@@ -0,0 +1,1356 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+/* Support for UTF-8 combining characters added by Adrian Colley */
+
+#include "slinclud.h"
+
+#include <signal.h>
+#include <errno.h>
+
+#include "slang.h"
+#include "_slang.h"
+#include "slcurses.h"
+
+/* This file is meant to implement a primitive curses implementation in
+ * terms of SLsmg calls. The fact is that the interfaces are sufficiently
+ * different that a 100% emulation is not possible.
+ */
+
+#define SLCURSES_NULLATTR ((SLcurses_Char_Type)0)
+#define SLCURSES_NULLCHAR ((SLwchar_Type)0)
+
+#define SLCURSES_BUILD_CHAR(ch,wch,c) \
+ ((ch) = ((SLcurses_Char_Type)(wch)) | (((SLcurses_Char_Type)(c)) << 24))
+
+#define SLCURSES_BUILD_CELL(cellp,wch,c,isacs) \
+ do \
+ { \
+	int slcurses_build_cell_i; \
+	SLcurses_Cell_Type *slcurses_build_cell_c = (cellp); \
+	SLCURSES_BUILD_CHAR(slcurses_build_cell_c->main, wch, c); \
+	slcurses_build_cell_c->is_acs = isacs; \
+	for (slcurses_build_cell_i = 0; \
+	 slcurses_build_cell_i < SLSMG_MAX_CHARS_PER_CELL-1; \
+	 slcurses_build_cell_i++) \
+	 slcurses_build_cell_c->combiningslcurses_build_cell_i = SLCURSES_NULLCHAR; \
+ } \
+ while (0)
+
+#define SLCURSES_EXTRACT_COLOR(ch) (((ch >> 24)&0xFF))
+#define SLCURSES_EXTRACT_CHAR(ch) ((ch)&A_CHARTEXT)
+
+SLcurses_Window_Type *SLcurses_Stdscr;
+int SLcurses_Esc_Delay = 150;	 /* 0.15 seconds */
+SLcurses_Char_Type SLcurses_Acs_Map 128;
+int SLcurses_Is_Endwin = 1;
+int SLcurses_Num_Colors = 8;
+
+static void blank_line (SLcurses_Cell_Type *b, unsigned int len, SLsmg_Color_Type color)
+{
+ SLcurses_Cell_Type *bmax = b + len;
+
+ while (b < bmax)
+ SLCURSES_BUILD_CELL(b++,' ',color, 0);
+}
+
+static int va_mvprintw (SLcurses_Window_Type *w, int r, int c, int do_move,
+			char *fmt, va_list ap)
+{
+ char buf1024;
+
+ if (do_move) SLcurses_wmove (w, r, c);
+
+ (void) SLvsnprintf (buf, sizeof(buf), fmt, ap);
+
+ SLcurses_waddnstr (w, buf, -1);
+ return 0;
+}
+
+int SLcurses_mvprintw (int r, int c, char *fmt, ...)
+{
+ va_list ap;
+
+ va_start(ap, fmt);
+ va_mvprintw (SLcurses_Stdscr, r, c, 1, fmt, ap);
+ va_end(ap);
+
+ return 0;
+}
+
+int SLcurses_mvwprintw (SLcurses_Window_Type *w, int r, int c, char *fmt, ...)
+{
+ va_list ap;
+
+ va_start(ap, fmt);
+ va_mvprintw (w, r, c, 1, fmt, ap);
+ va_end(ap);
+
+ return 0;
+}
+
+int SLcurses_wprintw (SLcurses_Window_Type *w, char *fmt, ...)
+{
+ va_list ap;
+
+ va_start(ap, fmt);
+ va_mvprintw (w, 0, 0, 0, fmt, ap);
+ va_end(ap);
+
+ return 0;
+}
+
+int SLcurses_printw (char *fmt, ...)
+{
+ va_list ap;
+
+ va_start(ap, fmt);
+ va_mvprintw (SLcurses_Stdscr, 0, 0, 0, fmt, ap);
+ va_end(ap);
+
+ return 0;
+}
+
+int SLcurses_nil (void)
+{
+ return 0;
+}
+
+int SLcurses_has_colors(void)
+{
+ return SLtt_Use_Ansi_Colors;
+}
+
+int SLcurses_nodelay (SLcurses_Window_Type *w, int onoff)
+{
+ w->delay_off = (onoff ? 0 : -1);
+ return 0;
+}
+
+static unsigned char Keyboard_Buffer256;
+static unsigned char *Keyboard_Buffer_Start = Keyboard_Buffer;
+static unsigned char *Keyboard_Buffer_Stop = Keyboard_Buffer;
+
+static int getkey_function (void)
+{
+ int ch;
+
+ ch = SLang_getkey ();
+ if (ch != SLANG_GETKEY_ERROR)
+ {
+	*Keyboard_Buffer_Stop++ = (unsigned char) ch;
+	if (Keyboard_Buffer_Stop == Keyboard_Buffer + sizeof (Keyboard_Buffer))
+	 Keyboard_Buffer_Stop = Keyboard_Buffer;
+ }
+
+ return ch;
+}
+
+static int get_buffered_key (void)
+{
+ int ch;
+
+ if (Keyboard_Buffer_Stop == Keyboard_Buffer_Start)
+ return SLANG_GETKEY_ERROR;
+
+ ch = *Keyboard_Buffer_Start++;
+ if (Keyboard_Buffer_Start == Keyboard_Buffer + sizeof (Keyboard_Buffer))
+ Keyboard_Buffer_Start = Keyboard_Buffer;
+
+ return ch;
+}
+
+static int get_keypad_key (void)
+{
+ int ch;
+
+ if (Keyboard_Buffer_Stop != Keyboard_Buffer_Start)
+ return get_buffered_key ();
+
+ ch = SLang_getkey ();
+ if (ch == '\033')
+ {
+	if (0 == SLang_input_pending (ESCDELAY / 100))
+	 return ch;
+ }
+ else if (ch == SLANG_GETKEY_ERROR) return ERR;
+ SLang_ungetkey (ch);
+ ch = SLkp_getkey ();
+ if (ch == SL_KEY_ERR)
+ ch = get_buffered_key ();
+ else
+ Keyboard_Buffer_Stop = Keyboard_Buffer_Start;
+ return ch;
+}
+
+int SLcurses_wgetch (SLcurses_Window_Type *w)
+{
+ if (w == NULL)
+ return ERR;
+
+ SLcurses_wrefresh (w);
+
+ if ((Keyboard_Buffer_Start != Keyboard_Buffer_Stop)
+ || (w->delay_off == -1)
+ || SLang_input_pending (w->delay_off))
+ {
+	if (w->use_keypad)
+	 return get_keypad_key ();
+
+	return SLang_getkey ();
+ }
+
+ return ERR;
+}
+
+int SLcurses_getch (void)
+{
+ return SLcurses_wgetch (SLcurses_Stdscr);
+}
+
+/* This is a super hack. That fact is that SLsmg and curses
+ * are incompatible.
+ */
+static unsigned char Color_Objects256;
+
+static unsigned int map_attr_to_object (SLcurses_Char_Type attr)
+{
+ unsigned int obj;
+
+ obj = SLCURSES_EXTRACT_COLOR(attr);
+
+ if (SLtt_Use_Ansi_Colors)
+ {
+	SLtt_Char_Type at;
+
+	if (Color_Objectsobj != 0) return obj;
+
+	at = SLtt_get_color_object (obj & 0xF);
+
+	if (attr & A_BOLD) at |= SLTT_BOLD_MASK;
+	if (attr & A_UNDERLINE) at |= SLTT_ULINE_MASK;
+	if (attr & A_REVERSE) at |= SLTT_REV_MASK;
+	if (attr & A_ALTCHARSET) at |= SLTT_ALTC_MASK;
+
+	SLtt_set_color_object (obj, at);
+
+	Color_Objectsobj = 1;
+ }
+ else obj = obj & 0xF0;
+
+ return obj;
+
+}
+
+int SLcurses_start_color (void)
+{
+ int f, b;
+ int obj;
+
+ if (SLtt_Use_Ansi_Colors == 0) return -1;
+
+ obj = 0;
+ for (f = 0; f < 16; f++)
+ {
+	for (b = 0; b < 16; b++)
+	 {
+	 obj++;
+	 SLtt_set_color_fgbg (obj, f, b);
+	 }
+ }
+ return 0;
+}
+
+#ifdef SIGINT
+static void sigint_handler (int sig)
+{
+ SLang_reset_tty ();
+ SLsmg_reset_smg ();
+ exit (sig);
+}
+#endif
+
+/* Values are assumed to be 0, 1, 2. This fact is exploited */
+static int TTY_State;
+
+static int init_tty (int suspend_ok)
+{
+ if (-1 == SLang_init_tty (-1, 1, 0))
+ return -1;
+
+#ifdef REAL_UNIX_SYSTEM
+ if (suspend_ok) SLtty_set_suspend_state (1);
+#endif
+ return 0;
+}
+
+int SLcurses_raw (void)
+{
+ TTY_State = 1;
+ return init_tty (0);
+}
+
+int SLcurses_cbreak (void)
+{
+ TTY_State = 2;
+ return init_tty (1);
+}
+
+#if defined(SIGTSTP) && defined(SIGSTOP)
+static void sigtstp_handler (int sig)
+{
+ sig = errno;
+
+ SLsmg_suspend_smg ();
+
+ if (TTY_State)
+ SLang_reset_tty ();
+
+ kill(getpid(),SIGSTOP);
+
+ SLsmg_resume_smg ();
+
+ if (TTY_State) init_tty (TTY_State - 1);
+
+ signal (SIGTSTP, sigtstp_handler);
+ errno = sig;
+}
+#endif
+
+SLcurses_Window_Type *SLcurses_initscr (void)
+{
+ SLcurses_Is_Endwin = 0;
+ SLsmg_Newline_Behavior = SLSMG_NEWLINE_MOVES;
+ SLtt_get_terminfo ();
+
+#if !defined(IBMPC_SYSTEM) && !defined(VMS)
+ if (-1 == (SLcurses_Num_Colors = SLtt_tgetnum ("Co")))
+#endif
+ SLcurses_Num_Colors = 8;
+
+ /* Enable UTF-8 support if used on the terminal */
+ (void) SLutf8_enable (-1);
+
+ if ((-1 == SLkp_init ())
+ || (-1 == SLcurses_cbreak ())
+ || (NULL == (SLcurses_Stdscr = SLcurses_newwin (0, 0, 0, 0)))
+ || (-1 == SLsmg_init_smg ()))
+ {
+	SLang_exit_error ("SLcurses_initscr: init failed\n");
+	return NULL;
+ }
+ SLkp_set_getkey_function (getkey_function);
+
+#ifdef SIGINT
+ signal (SIGINT, sigint_handler);
+#endif
+
+#if defined(SIGTSTP) && defined(SIGSTOP)
+ signal (SIGTSTP, sigtstp_handler);
+#endif
+
+ SLtt_set_mono (SLCURSES_EXTRACT_COLOR(A_BOLD), NULL, SLTT_BOLD_MASK);
+ SLtt_set_mono (SLCURSES_EXTRACT_COLOR(A_UNDERLINE), NULL, SLTT_ULINE_MASK);
+ SLtt_set_mono (SLCURSES_EXTRACT_COLOR(A_REVERSE), NULL, SLTT_REV_MASK);
+ /* SLtt_set_mono (SLCURSES_EXTRACT_COLOR(A_BLINK), NULL, SLTT_BLINK_MASK); */
+ /* SLtt_set_mono (SLCURSES_EXTRACT_COLOR(A_ITALIC), NULL, SLTT_ITALIC_MASK); */
+ SLtt_set_mono ((SLCURSES_EXTRACT_COLOR(A_BOLD|A_UNDERLINE)), NULL, SLTT_ULINE_MASK|SLTT_BOLD_MASK);
+ SLtt_set_mono ((SLCURSES_EXTRACT_COLOR(A_REVERSE|A_UNDERLINE)), NULL, SLTT_ULINE_MASK|SLTT_REV_MASK);
+
+ if (SLtt_Has_Alt_Charset)
+ {
+ SLcurses_Acs_MapSLSMG_ULCORN_CHAR = SLSMG_ULCORN_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_URCORN_CHAR = SLSMG_URCORN_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_LLCORN_CHAR = SLSMG_LLCORN_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_LRCORN_CHAR = SLSMG_LRCORN_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_UTEE_CHAR = SLSMG_UTEE_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_DTEE_CHAR = SLSMG_DTEE_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_LTEE_CHAR = SLSMG_LTEE_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_RTEE_CHAR = SLSMG_RTEE_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_VLINE_CHAR = SLSMG_VLINE_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_HLINE_CHAR = SLSMG_HLINE_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_PLUS_CHAR = SLSMG_PLUS_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_CKBRD_CHAR = SLSMG_CKBRD_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_DIAMOND_CHAR = SLSMG_DIAMOND_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_DEGREE_CHAR = SLSMG_DEGREE_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_PLMINUS_CHAR = SLSMG_PLMINUS_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_BULLET_CHAR = SLSMG_BULLET_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_LARROW_CHAR = SLSMG_LARROW_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_RARROW_CHAR = SLSMG_RARROW_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_DARROW_CHAR = SLSMG_DARROW_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_UARROW_CHAR = SLSMG_UARROW_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_BOARD_CHAR = SLSMG_BOARD_CHAR | A_ALTCHARSET;
+ SLcurses_Acs_MapSLSMG_BLOCK_CHAR = SLSMG_BLOCK_CHAR | A_ALTCHARSET;
+ }
+ else
+ {
+ /* ugly defaults to use on terminals which don't support graphics */
+	SLcurses_Acs_MapSLSMG_ULCORN_CHAR = '+';
+	SLcurses_Acs_MapSLSMG_URCORN_CHAR = '+';
+	SLcurses_Acs_MapSLSMG_LLCORN_CHAR = '+';
+	SLcurses_Acs_MapSLSMG_LRCORN_CHAR = '+';
+	SLcurses_Acs_MapSLSMG_UTEE_CHAR = '+';
+	SLcurses_Acs_MapSLSMG_DTEE_CHAR = '+';
+	SLcurses_Acs_MapSLSMG_LTEE_CHAR = '+';
+	SLcurses_Acs_MapSLSMG_RTEE_CHAR = '+';
+	SLcurses_Acs_MapSLSMG_VLINE_CHAR = '|';
+	SLcurses_Acs_MapSLSMG_HLINE_CHAR = '-';
+	SLcurses_Acs_MapSLSMG_PLUS_CHAR = '+';
+	SLcurses_Acs_MapSLSMG_CKBRD_CHAR = '#';
+	SLcurses_Acs_MapSLSMG_DIAMOND_CHAR = '+';
+	SLcurses_Acs_MapSLSMG_DEGREE_CHAR = '\\';
+	SLcurses_Acs_MapSLSMG_PLMINUS_CHAR = '#';
+	SLcurses_Acs_MapSLSMG_BULLET_CHAR = 'o';
+	SLcurses_Acs_MapSLSMG_LARROW_CHAR = '<';
+	SLcurses_Acs_MapSLSMG_RARROW_CHAR = '>';
+	SLcurses_Acs_MapSLSMG_DARROW_CHAR = 'v';
+	SLcurses_Acs_MapSLSMG_UARROW_CHAR = '^';
+	SLcurses_Acs_MapSLSMG_BOARD_CHAR = '#';
+	SLcurses_Acs_MapSLSMG_BLOCK_CHAR = '#';
+ }
+
+ return SLcurses_Stdscr;
+}
+
+int SLcurses_wattrset (SLcurses_Window_Type *w, SLcurses_Char_Type ch)
+{
+ unsigned int obj;
+
+ obj = map_attr_to_object (ch);
+ w->color = obj;
+ w->attr = ch;
+ return 0;
+}
+
+int SLcurses_wattroff (SLcurses_Window_Type *w, SLcurses_Char_Type ch)
+{
+ if (SLtt_Use_Ansi_Colors)
+ return SLcurses_wattrset (w, 0);
+
+ w->attr &= ~ch;
+ return SLcurses_wattrset (w, w->attr);
+}
+
+int SLcurses_wattron (SLcurses_Window_Type *w, SLcurses_Char_Type ch)
+{
+ if (SLtt_Use_Ansi_Colors)
+ return SLcurses_wattrset (w, ch);
+
+ w->attr |= ch;
+ return SLcurses_wattrset (w, w->attr);
+}
+
+int SLcurses_delwin (SLcurses_Window_Type *w)
+{
+ if (w == NULL) return 0;
+ if (w->lines != NULL)
+ {
+	SLcurses_Cell_Type **lines = w->lines;
+	if (w->is_subwin == 0)
+	 {
+	 unsigned int r, rmax;
+
+	 rmax = w->nrows;
+	 for (r = 0; r < rmax; r++)
+	 {
+		 SLfree ((char *)linesr);
+	 }
+	 }
+
+	SLfree ((char *)lines);
+ }
+
+ SLfree ((char *)w);
+ if (w == SLcurses_Stdscr)
+ SLcurses_Stdscr = NULL;
+ return 0;
+}
+
+SLcurses_Window_Type *SLcurses_newwin (unsigned int nrows, unsigned int ncols,
+				 unsigned int r, unsigned int c)
+{
+ SLcurses_Window_Type *win;
+ SLcurses_Cell_Type **lines;
+
+ if (r >= (unsigned int) SLtt_Screen_Rows)
+ return NULL;
+ if (c >= (unsigned int) SLtt_Screen_Cols)
+ return NULL;
+
+ if (NULL == (win = (SLcurses_Window_Type *) SLmalloc (sizeof (SLcurses_Window_Type))))
+ return NULL;
+
+ SLMEMSET ((char *) win, 0, sizeof (SLcurses_Window_Type));
+
+ if (nrows == 0)
+ nrows = (unsigned int) SLtt_Screen_Rows - r;
+ if (ncols == 0)
+ ncols = (unsigned int) SLtt_Screen_Cols - c;
+
+ lines = (SLcurses_Cell_Type **) _SLcalloc (nrows, sizeof (SLcurses_Cell_Type *));
+ if (lines == NULL)
+ {
+	SLcurses_delwin (win);
+	return NULL;
+ }
+
+ SLMEMSET ((char *) lines, 0, nrows * sizeof (SLcurses_Cell_Type *));
+
+ win->lines = lines;
+ win->scroll_max = win->nrows = nrows;
+ win->ncols = ncols;
+ win->_begy = r;
+ win->_begx = c;
+ win->_maxx = (c + ncols) - 1;
+ win->_maxy = (r + nrows) - 1;
+ win->modified = 1;
+ win->delay_off = -1;
+
+ for (r = 0; r < nrows; r++)
+ {
+	SLcurses_Cell_Type *b;
+
+	b = (SLcurses_Cell_Type *) _SLcalloc (ncols, sizeof (SLcurses_Cell_Type));
+	if (b == NULL)
+	 {
+	 SLcurses_delwin (win);
+	 return NULL;
+	 }
+	lines r = b;
+	blank_line (b, ncols, 0);
+ }
+
+ return win;
+}
+
+int SLcurses_wmove (SLcurses_Window_Type *win, unsigned int r, unsigned int c)
+{
+ if (win == NULL) return -1;
+ win->_cury = r;
+ win->_curx = c;
+ win->modified = 1;
+ return 0;
+}
+
+static int do_newline (SLcurses_Window_Type *w)
+{
+ w->_curx = 0;
+ w->_cury += 1;
+ if (w->_cury >= w->scroll_max)
+ {
+	w->_cury = w->scroll_max - 1;
+	if (w->scroll_ok)
+	 SLcurses_wscrl (w, 1);
+ }
+
+ return 0;
+}
+
+/* SLcurses_placechar(w, wch, width, color) places character wch at the current
+ * position in w. If any multicolumn characters are partially overwritten as a
+ * result, the remains of those characters are blanked out. The caller is
+ * responsible for ensuring that there is room at the current position for
+ * (width) columns. The current position is not advanced by this function. If
+ * width is zero, this function adds the character to the combining array of
+ * the current position, if there's room (the character is dropped if there's
+ * no room).
+ */
+static void SLcurses_placechar (SLcurses_Window_Type *w, SLwchar_Type wch,
+				int width, int color, int is_acs)
+{
+ SLcurses_Cell_Type *b;
+ unsigned int i;
+
+ if ((w->_cury >= w->nrows) || (w->_curx >= w->ncols))
+ return;
+
+ if (width <= 0)
+ {
+	/* Backtrack to the start of any multicolumn character. */
+	for (i = w->_curx; i > 0; i--)
+	 if (w->linesw->_curyi.main != SLCURSES_NULLATTR)
+	 break;
+	b = &w->linesw->_curyi;
+	/* Find a place for the new combining character. */
+	for (i = 0; i < SLSMG_MAX_CHARS_PER_CELL-1; i++)
+	 if (b->combiningi == SLCURSES_NULLCHAR)
+	 break;
+	/* Add character if it fits. */
+	if (i < SLSMG_MAX_CHARS_PER_CELL-1)
+	 b->combiningi = wch;
+	return;
+ }
+
+ b = &w->linesw->_curyw->_curx;
+ if (b->main == SLCURSES_NULLATTR)
+ {
+	/* wch will overwrite part of a multicolumn character, so
+	 * blank out the left half of the character.
+	 */
+	int blankcolor = w->color;
+	i = w->_curx;
+	while (1)
+ {
+	 if (w->linesw->_curyi.main != SLCURSES_NULLATTR)
+	 {
+		 blankcolor = SLCURSES_EXTRACT_COLOR(w->linesw->_curyi.main);
+		 break;
+	 }
+	 if (i == 0)
+	 break;
+	 i--;
+	 }
+	while (i < w->_curx)
+	 {
+	 SLCURSES_BUILD_CELL(&w->linesw->_curyi, ' ', blankcolor, is_acs);
+	 i++;
+	 }
+ }
+ /* Place wch itself. */
+ SLCURSES_BUILD_CELL(b, wch, w->color, is_acs);
+ /* If wch is multicolumn, reserve the following cell(s). */
+ for (i = 1; i < (unsigned int) width; i++)
+ {
+	bi.main = SLCURSES_NULLATTR;
+	/* It's unnecessary to clear bi.combined when bi.main==0. */
+ }
+ /* If wch is followed by the tail of a previous, overwritten, multicolumn
+ * character, then blank it out completely.
+ */
+ for (i = w->_curx + width; i < w->ncols; i++)
+ {
+	b = &w->linesw->_curyi;
+	if (b->main != SLCURSES_NULLATTR)
+	 break;
+	SLCURSES_BUILD_CELL(b, ' ', color, is_acs);
+ }
+}
+
+int SLcurses_waddch (SLcurses_Window_Type *win, SLcurses_Char_Type attr)
+{
+ SLcurses_Char_Type ch;
+ SLsmg_Color_Type color;
+ int width;
+ int is_acs;
+
+ if (win == NULL) return -1;
+
+ if (win->_cury >= win->nrows)
+ {
+	/* Curses seems to move current position to top of window. */
+	win->_cury = win->_curx = 0;
+	return -1;
+ }
+
+ win->modified = 1;
+
+ ch = SLCURSES_EXTRACT_CHAR(attr);
+ if (ch == 0) return -1;
+
+ if (attr == ch)
+ color = win->color;
+ else
+ {
+	/* hack to pick up the default color for graphics chars */
+	if (((attr & A_COLOR) == 0) && ((attr & A_ALTCHARSET) != 0))
+	 {
+	 SLCURSES_BUILD_CHAR(attr, attr, win->color);
+	 }
+	color = map_attr_to_object (attr);
+ }
+
+ is_acs = attr & A_ALTCHARSET;
+
+ if (SLwchar_iscntrl((SLwchar_Type)ch))
+ {
+	if (ch == '\n')
+	 {
+	 SLcurses_wclrtoeol (win);
+	 return do_newline (win);
+	 }
+
+	if (ch == '\r')
+	 {
+	 win->_curx = 0;
+	 return 0;
+	 }
+
+	if (ch == '\b')
+	 {
+	 if (win->_curx > 0)
+	 win->_curx--;
+
+	 return 0;
+	 }
+
+	if (ch == '\t')
+	 {
+	 int err;
+	 do
+	 err = SLcurses_waddch (win, (SLtt_Char_Type)' ');
+	 while (err == 0 && win->_curx % SLsmg_Tab_Width != 0);
+	 return err;
+	 }
+ }
+
+ width = SLwchar_isprint (ch)
+	? (SLsmg_is_utf8_mode ()
+		? SLwchar_wcwidth (ch)
+		: 1)
+	: 0;
+ if (win->_curx + width > win->ncols)
+ {
+	SLcurses_wclrtoeol (win);
+	do_newline (win);
+ }
+
+ SLcurses_placechar (win, ch, width, color, is_acs);
+ win->_curx += width;
+
+ return 0;
+}
+
+static void write_color_chars (SLcurses_Cell_Type *p, unsigned int len)
+{
+ int color = -1;
+ unsigned int i;
+ for (i = 0; i < len; i++)
+ {
+	SLwchar_Type ch;
+	int this_color;
+	int j;
+	if (pi.main == SLCURSES_NULLATTR)
+	 continue;	/* prev char was multicolumn */
+	ch = SLCURSES_EXTRACT_CHAR(pi.main);
+	this_color = SLCURSES_EXTRACT_COLOR(pi.main);
+	if (this_color != color)
+	 {
+	 SLsmg_set_color (this_color);
+	 color = this_color;
+	 }
+	if (pi.is_acs)
+	 SLsmg_set_char_set (1);
+	SLsmg_write_char (ch);
+	for (j = 0; j < SLSMG_MAX_CHARS_PER_CELL-1; j++)
+	 {
+	 SLwchar_Type combining = pi.combiningj;
+	 if (combining == SLCURSES_NULLCHAR)
+	 break;	/* no more combining chars */
+	 SLsmg_write_char (combining);
+	 }
+	if (pi.is_acs)
+	 SLsmg_set_char_set (0);
+ }
+}
+
+int SLcurses_wnoutrefresh (SLcurses_Window_Type *w)
+{
+ unsigned int len;
+ unsigned int r, c;
+ unsigned int i, imax;
+
+ if (SLcurses_Is_Endwin)
+ {
+	if (TTY_State) init_tty (TTY_State - 1);
+ 	SLsmg_resume_smg ();
+	SLcurses_Is_Endwin = 0;
+ }
+
+ if (w == NULL)
+ {
+	SLsmg_refresh ();
+	return -1;
+ }
+
+ if (w->modified == 0)
+ return 0;
+
+ r = w->_begy;
+ c = w->_begx;
+
+ len = w->ncols;
+ imax = w->nrows;
+
+ for (i = 0; i < imax; i++)
+ {
+	SLsmg_gotorc (r, c);
+	write_color_chars (w->linesi, len);
+	r++;
+ }
+
+ if (w->has_box)
+ SLsmg_draw_box(w->_begy, w->_begx, w->nrows, w->ncols);
+
+ SLsmg_gotorc (w->_begy + w->_cury, w->_begx + w->_curx);
+ w->modified = 0;
+ return 0;
+}
+
+int SLcurses_wrefresh (SLcurses_Window_Type *w)
+{
+ if (w == NULL)
+ return -1;
+
+ if (w->modified == 0)
+ return 0;
+
+ SLcurses_wnoutrefresh (w);
+ SLsmg_refresh ();
+ return 0;
+}
+
+int SLcurses_wclrtoeol (SLcurses_Window_Type *w)
+{
+ SLcurses_Cell_Type *b, *bmax;
+ int color;
+
+ if (w == NULL) return -1;
+ if (w->_cury >= w->nrows)
+ return 0;
+
+ w->modified = 1;
+
+ b = w->linesw->_cury;
+ bmax = b + w->ncols;
+ b += w->_curx;
+
+ color = w->color;
+ while (b < bmax)
+ SLCURSES_BUILD_CELL(b++,' ',color, 0);
+
+ return 0;
+}
+
+int SLcurses_wclrtobot (SLcurses_Window_Type *w)
+{
+ unsigned int r;
+ int color;
+
+ if (w == NULL) return -1;
+
+ w->modified = 1;
+ color = w->color;
+ SLcurses_wclrtoeol (w);
+ for (r = w->_cury + 1; r < w->nrows; r++)
+ {
+	SLcurses_Cell_Type *b, *bmax;
+	b = w->lines r;
+	bmax = b + w->ncols;
+
+	while (b < bmax)
+	 SLCURSES_BUILD_CELL(b++,' ',color, 0);
+ }
+
+ return 0;
+}
+
+int SLcurses_wscrl (SLcurses_Window_Type *w, int n)
+{
+ SLcurses_Cell_Type **lines;
+ unsigned int r0, r1, rmax, rmin, ncols;
+ SLsmg_Color_Type color;
+
+ if ((w == NULL) || (w->scroll_ok == 0))
+ return -1;
+
+ w->modified = 1;
+#if 0
+ if (w->is_subwin)
+ {
+	SLang_reset_tty ();
+	SLsmg_reset_smg ();
+	fprintf (stderr, "\rAttempt to scroll a subwindow\n");
+	exit (1);
+ }
+#endif
+
+ color = w->color;
+ ncols = w->ncols;
+ lines = w->lines;
+ rmax = w->scroll_max;
+ rmin = w->scroll_min;
+ if (rmax > w->nrows)
+ rmax = w->nrows;
+ if ((rmin >= rmax) || (rmax == 0))
+ return 0;
+
+ if (n == 0)
+ return 0;
+
+ if (n > 0)
+ {
+	r0 = rmin;
+	r1 = rmin + n;
+
+	while (r1 < rmax)
+	 {
+	 if (w->is_subwin)
+	 memcpy ((char *)linesr0, (char *)linesr1,
+		 sizeof (SLcurses_Cell_Type) * ncols);
+	 else
+	 {
+		 SLcurses_Cell_Type *swap = linesr0;
+		 linesr0 = linesr1;
+		 linesr1 = swap;
+	 }
+	 r0++;
+	 r1++;
+	 }
+	while (r0 < rmax)
+	 {
+	 blank_line (linesr0, ncols, color);
+	 r0++;
+	 }
+	return 0;
+ }
+
+ /* else n < 0 */
+ n = -n;
+
+ r1 = rmax - 1;
+ if (r1 < (unsigned int) n)
+ n = r1;
+ r0 = r1 - n;
+
+ while (r0 >= rmin)
+ {
+	if (w->is_subwin)
+	 memcpy ((char *)linesr1, (char *)linesr0,
+		 sizeof (SLcurses_Cell_Type) * ncols);
+	else
+	 {
+	 SLcurses_Cell_Type *swap = linesr1;
+	 linesr1 = linesr0;
+	 linesr0 = swap;
+	 }
+	r1--;
+	if (r0 == 0)
+	 break;
+	r0--;
+ }
+ r0 = rmin;
+ while (r0 <= r1)
+ {
+	blank_line (linesr0, ncols, color);
+	r0++;
+ }
+
+ return 0;
+}
+
+/* Note: if len is < 0, entire string will be used.
+ */
+int SLcurses_waddnstr (SLcurses_Window_Type *w, char *str, int len)
+{
+ unsigned int nrows, ncols, crow, ccol;
+ SLuchar_Type *u, *umax;
+ int is_acs = 0;
+
+ if ((w == NULL)
+ || (str == NULL))
+ return -1;
+
+ w->modified = 1;
+ nrows = w->nrows;
+ ncols = w->ncols;
+ crow = w->_cury;
+ ccol = w->_curx;
+
+ if (w->scroll_max <= nrows)
+ nrows = w->scroll_max;
+
+ if (crow >= nrows)
+ crow = 0;			 /* wrap back to top */
+
+ u = (SLuchar_Type *)str;
+ umax = &ulen >= 0 ? (unsigned int)len : strlen(str);
+ while (u < umax)
+ {
+	SLwchar_Type ch;
+	SLstrlen_Type nconsumed;
+	int width = 1;
+
+	if (SLsmg_is_utf8_mode () && SLutf8_decode (u, umax, &ch, &nconsumed))
+	 {
+	 u += nconsumed;
+	 if ((ch & A_CHARTEXT) != ch)
+	 {
+		 ch = (SLwchar_Type)0xFFFDL;	/* Unicode replacement character */
+		 width = 1;
+	 }
+	 else if (SLwchar_isprint (ch))
+	 width = SLwchar_wcwidth (ch);
+	 else
+	 width = 0;	/* FIXME: cope with <%02X> printstrings. */
+	 }
+	else
+	 {
+	 ch = (SLwchar_Type)*u++;
+	 if (ch < 0x20 || (ch >= 0x7f && ch < 0xa0))
+	 width = 0;	/* FIXME: use display_8bit */
+	 }
+	if (ch == '\t')
+	 width = 1;	/* HACK forcing linewrap if ccol==ncols */
+	if (ch == 0)
+	 continue;	/* Avoid adding a literal SLCURSES_NULLCHAR. */
+
+	/* FIXME; should this function be defined in terms of waddch? */
+	if (ch == '\n')
+	 {
+	 w->_cury = crow;
+	 w->_curx = ccol;
+	 SLcurses_wclrtoeol (w);
+	 do_newline (w);
+	 crow = w->_cury;
+	 ccol = w->_curx;
+	 continue;
+	 }
+
+	if (ccol + width > ncols)
+	 {
+	 w->_curx = ccol;
+	 w->_cury = crow;
+	 SLcurses_wclrtoeol(w);	/* no-op if width<=1 */
+	 w->_curx = ccol = 0;
+	 w->_cury = ++crow;
+	 if (crow >= nrows)
+	 {
+		 do_newline (w);
+		 crow = w->_cury;
+		 ccol = w->_curx;
+	 }
+	 }
+
+	if (ch == '\t')
+	 {
+	 /* assert (ccol < ncols); */
+	 w->_curx = ccol;
+	 w->_cury = crow;
+	 do
+	 {
+		 SLcurses_placechar (w, (SLwchar_Type)' ', 1, w->color, is_acs);
+		 w->_curx = ++ccol;
+	 }
+	 while (ccol < ncols && ccol % SLsmg_Tab_Width != 0);
+	 continue;
+	 }
+
+	SLcurses_placechar (w, ch, width, w->color, is_acs);
+	w->_curx = (ccol += width);
+ }
+
+ w->_curx = ccol;
+ w->_cury = crow;
+
+ return 0;
+}
+
+/* This routine IS NOT CORRECT. It needs to compute the proper overlap
+ * and copy accordingly. Here, I just assume windows are same size.
+ */
+#if 0
+int SLcurses_overlay (SLcurses_Window_Type *swin, SLcurses_Window_Type *dwin)
+{
+ SLcurses_Char_Type *s, *smax, *d, *dmax;
+
+ if ((swin == NULL) || (dwin == NULL))
+ return -1;
+
+ s = swin->buf;
+ smax = swin->bufmax;
+ d = dwin->buf;
+ dmax = dwin->bufmax;
+
+ while ((s < smax) && (d < dmax))
+ {
+	SLcurses_Char_Type ch = *s++;
+	if (SLSMG_EXTRACT_CHAR(ch) != ' ')
+	 *d = ch;
+	d++;
+ }
+
+ return -1;			 /* not implemented */
+}
+
+#endif
+
+SLcurses_Window_Type *SLcurses_subwin (SLcurses_Window_Type *orig,
+				 unsigned int nlines, unsigned int ncols,
+				 unsigned int begin_y, unsigned int begin_x)
+{
+ SLcurses_Window_Type *sw;
+ int r, c;
+ unsigned int i;
+
+ if (orig == NULL)
+ return NULL;
+
+ sw = (SLcurses_Window_Type *) SLmalloc (sizeof (SLcurses_Window_Type));
+ if (sw == NULL)
+ return NULL;
+
+ SLMEMSET ((char *)sw, 0, sizeof (SLcurses_Window_Type));
+#if 1
+ r = begin_y - orig->_begy;
+#else
+ r = 1 + ((int)orig->nrows - (int)nlines) / 2;
+#endif
+ if (r < 0) r = 0;
+ if (r + nlines > orig->nrows) nlines = orig->nrows - r;
+
+ c = ((int)orig->ncols - (int)ncols) / 2;
+ if (c < 0) c = 0;
+ if (c + ncols > orig->ncols) ncols = orig->ncols - c;
+
+ sw->scroll_min = 0;
+ sw->scroll_max = sw->nrows = nlines;
+ sw->ncols = ncols;
+ sw->_begy = begin_y;
+ sw->_begx = begin_x;
+ sw->_maxx = (begin_x + ncols) - 1;
+ sw->_maxy = (begin_y + nlines) - 1;
+
+ sw->lines = (SLcurses_Cell_Type **) _SLcalloc (nlines, sizeof (SLcurses_Cell_Type *));
+ if (sw->lines == NULL)
+ {
+	SLcurses_delwin (sw);
+	return NULL;
+ }
+
+ for (i = 0; i < nlines; i++)
+ {
+	sw->lines i = orig->lines r + i + c;
+ }
+
+ sw->is_subwin = 1;
+ return sw;
+}
+
+int SLcurses_wclear (SLcurses_Window_Type *w)
+{
+ unsigned int i;
+
+ if (w == NULL)
+ return -1;
+ w->modified = 1;
+ for (i=0; i < w->nrows; i++)
+ blank_line (w->linesi, w->ncols, w->color);
+ return 0;
+}
+
+int SLcurses_wdelch (SLcurses_Window_Type *w)
+{
+ int src, dest, limit;
+ SLcurses_Cell_Type *line = w->linesw->_cury;
+
+ dest = w->_curx;
+ /* Backtrack to start of this character. */
+ while (dest > 0 && linedest.main == SLCURSES_NULLATTR)
+ dest--;
+ w->_curx = dest;	/* Point to start of character, not the middle. */
+
+ limit = w->ncols;
+ src = dest + 1;
+ /* Advance to start of next character. */
+ while (src < limit && linesrc.main == SLCURSES_NULLATTR)
+ src++;
+
+ /* linedest..dest+limit-1-src = linesrc..limit-1; */
+#ifdef HAVE_MEMMOVE
+ memmove(&linedest, &linesrc, (limit-src) * sizeof SLcurses_Cell_Type);
+ dest += (limit-src);
+#else
+ while (src < limit)
+ linedest++ = linesrc++;
+#endif
+
+ while (dest < limit)
+ SLCURSES_BUILD_CELL(&linedest++, ' ', w->color, 0);
+
+ w->modified = 1;
+ return 0;
+}
+
+int SLcurses_winsch (SLcurses_Window_Type *w, int ch)
+{
+ int is_acs = 0;
+ int colsneeded;
+#ifndef HAVE_MEMMOVE
+ int dest, src;
+#endif
+ SLcurses_Cell_Type *line = w->linesw->_cury;
+
+ /* Backtrack to start of this character. */
+ while (w->_curx > 0 && linew->_curx.main == SLCURSES_NULLATTR)
+ w->_curx--;
+
+ if (ch == (SLcurses_Char_Type)'\t')
+ ch = ' ';	/* FIXME */
+
+ if (SLwchar_isprint (ch))
+ {
+	if (SLsmg_is_utf8_mode ())
+	 colsneeded = SLwchar_wcwidth (ch);
+	else
+	 colsneeded = 1;
+ }
+ else colsneeded = 0;
+
+ if (colsneeded == 0)
+ {
+	int x, i;
+	SLcurses_Cell_Type *b = NULL;
+	/* Back one character. */
+	for (x = w->_curx - 1; x >= 0; x--)
+	 {
+	 b = &linex;
+	 if (b->main != SLCURSES_NULLATTR)
+	 break;
+	 }
+	if (x < 0)
+	 {	/* Back to end of previous line. */
+	 if (w->_cury == 0)
+	 return (-1);
+	 line = w->linesw->_cury - 1;
+	 for (x = w->ncols - 1; x >= 0; x--)
+	 {
+		 b = &linex;
+		 if (b->main != SLCURSES_NULLATTR)
+		 break;
+	 }
+	 if (x < 0)
+	 return (-1);
+	 }
+	/* b is previous character; insert combining character ch in *b. */
+	for (i = 0; i < SLSMG_MAX_CHARS_PER_CELL-1; i++)
+	 if (b->combiningi == SLCURSES_NULLCHAR)
+	 break;
+	if (i < SLSMG_MAX_CHARS_PER_CELL-1)
+	 b->combiningi = ch;
+	return 0;
+ }
+
+ /* Remove trailing character(s) from line. */
+ if ((colsneeded > 0) && ((unsigned int)colsneeded <= w->ncols))
+ {
+	int i;
+	for (i = w->ncols - colsneeded; i > 0; i--)
+	 if (linei.main != SLCURSES_NULLATTR)
+	 break;
+	/* linew->ncols-colsneeded..w->ncols-1 will be shifted off the end,
+	 * but if i < w->ncols-colsneeded, then linei..w->ncols-colsneeded-1
+	 * must be blanked because they are part of a multicolumn character
+	 * which is partially shifted off the end.
+	 */
+	while (i + colsneeded < (int)w->ncols)
+	 SLCURSES_BUILD_CELL(&linei++, ' ', w->color, is_acs);
+ }
+
+ /* line_curx+colsneeded..ncols-1 = line_curx..ncols-1-colsneeded; */
+#ifdef HAVE_MEMMOVE
+ memmove(&linew->_curx+colsneeded, &linew->_curx, ncols-(w->_curx+colsneeded));
+#else
+ dest = w->ncols - 1;
+ for (src = dest - colsneeded; src >= (int)w->_curx; src--, dest--)
+ linedest = linesrc;
+#endif
+ if (w->_curx + colsneeded <= w->ncols)
+ SLcurses_placechar (w, ch, colsneeded, w->color, is_acs);
+
+ w->modified = 1;
+ return 0;
+}
+
+int SLcurses_endwin (void)
+{
+ SLcurses_Is_Endwin = 1;
+ SLsmg_suspend_smg ();
+ SLang_reset_tty ();
+ return 0;
+}
+
+#if 0
+int SLcurses_mvwscanw (SLcurses_Window_Type *w, unsigned int r, unsigned int c,
+		 char *fmt, ...)
+{
+#if HAVE_VFSCANF
+ int ret;
+ va_list ap;
+
+ SLcurses_wmove (w, r, c);
+ SLcurses_wrefresh (w);
+
+ va_start(ap, fmt);
+ ret = vfscanf (stdin, fmt, ap);
+ va_end(ap);
+ return ret;
+#else
+ return 0;
+#endif
+}
+
+int SLcurses_wscanw (SLcurses_Window_Type *w, char *fmt, ...)
+{
+#if HAVE_VFSCANF
+ va_list ap;
+ int ret;
+
+ SLcurses_wrefresh (w);
+
+ va_start(ap, fmt);
+ ret = vfscanf (stdin, fmt, ap);
+ va_end(ap);
+
+ return ret;
+#else
+ return 0;
+#endif
+}
+
+int SLcurses_scanw (char *fmt, ...)
+{
+#ifdef HAVE_VFSCANF
+ va_list ap;
+ int ret;
+
+ SLcurses_wrefresh (SLcurses_Stdscr);
+
+ va_start(ap, fmt);
+ ret = vfscanf (stdin, fmt, ap);
+ va_end(ap);
+
+ return ret;
+#else
+ return 0;
+#endif
+}
+#endif
+
+int SLcurses_clearok (SLcurses_Window_Type *w, int bf)
+{
+ if (bf)
+ {
+	SLsmg_cls ();
+	w->modified = 1;
+ }
+ return 0;
+}
+/* vim:set noautoindent cinoptions=>5,n-3,{2,^-2,+4 cindent ruler: */

_service:tar_scm:slang-2.3.2.tar.bz2/src/slcurses.h Added

@@ -0,0 +1,389 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include <stdio.h>
+
+#ifndef SLANG_VERSION
+# include <slang.h>
+#endif
+
+/* This is a temporary hack until lynx is fixed to not include this file. */
+#ifndef LYCURSES_H
+
+typedef unsigned long SLcurses_Char_Type;
+typedef struct SLcurses_Cell_Type
+{
+ SLcurses_Char_Type main;
+ SLwchar_Type combiningSLSMG_MAX_CHARS_PER_CELL-1;
+ int is_acs;
+}
+SLcurses_Cell_Type;
+
+typedef struct
+{
+ unsigned int _begy, _begx, _maxy, _maxx;
+ unsigned int _curx, _cury;
+ unsigned int nrows, ncols;
+ unsigned int scroll_min, scroll_max;
+ SLcurses_Cell_Type **lines;
+ int color;
+ int is_subwin;
+ SLtt_Char_Type attr;
+ int delay_off;
+ int scroll_ok;
+ int modified;
+ int has_box;
+ int use_keypad;
+}
+SLcurses_Window_Type;
+
+extern int SLcurses_wclrtobot (SLcurses_Window_Type *);
+extern int SLcurses_wscrl (SLcurses_Window_Type *, int);
+extern int SLcurses_wrefresh (SLcurses_Window_Type *);
+extern int SLcurses_delwin (SLcurses_Window_Type *);
+extern int SLcurses_wprintw (SLcurses_Window_Type *, char *, ...);
+extern SLcurses_Window_Type *SLcurses_newwin (unsigned int, unsigned int,
+					 unsigned int, unsigned int);
+
+extern SLcurses_Window_Type *SLcurses_subwin (SLcurses_Window_Type *,
+					 unsigned int, unsigned int,
+					 unsigned int, unsigned int);
+
+extern int SLcurses_wnoutrefresh (SLcurses_Window_Type *);
+extern int SLcurses_wclrtoeol (SLcurses_Window_Type *);
+
+extern int SLcurses_wmove (SLcurses_Window_Type *, unsigned int, unsigned int);
+extern int SLcurses_waddch (SLcurses_Window_Type *, SLcurses_Char_Type);
+extern int SLcurses_waddnstr (SLcurses_Window_Type *, char *, int);
+
+#define waddnstr		SLcurses_waddnstr
+#define waddch			SLcurses_waddch
+#define waddstr(w,s)		waddnstr((w),(s),-1)
+#define addstr(x)		waddstr(stdscr, (x))
+#define addnstr(s,n)		waddnstr(stdscr,(s),(n))
+#define addch(ch) 		waddch(stdscr,(ch))
+
+#define mvwaddnstr(w,y,x,s,n) \
+ (-1 == wmove((w),(y),(x)) ? -1 : waddnstr((w),(s),(n)))
+#define mvwaddstr(w,y,x,s) \
+ (-1 == wmove((w),(y),(x)) ? -1 : waddnstr((w),(s), -1))
+#define mvaddnstr(y,x,s,n)	mvwaddnstr(stdscr,(y),(x),(s),(n))
+#define mvaddstr(y,x,s) 	mvwaddstr(stdscr,(y),(x),(s))
+#define mvwaddch(w,y,x,c) \
+ ((-1 == wmove((w),(y),(x))) ? -1 : waddch((w),(c)))
+#define mvaddch(y,x,c) 	mvwaddch(stdscr,(y),(x),(c))
+
+extern int SLcurses_wclear (SLcurses_Window_Type *w);
+extern int SLcurses_printw (char *, ...);
+
+#if 0
+/* Why are these functions part of curses??? */
+extern int SLcurses_mvwscanw (SLcurses_Window_Type *, unsigned int, unsigned int,
+			 char *, ...);
+extern int SLcurses_wscanw (SLcurses_Window_Type *, char *, ...);
+extern int SLcurses_scanw (char *, ...);
+#define mvwscanw SLcurses_mvwscanw
+#define wscanw SLcurses_wscanw
+#define scanw SLcurses_scanw
+#endif
+
+extern SLcurses_Window_Type *SLcurses_Stdscr;
+#define WINDOW SLcurses_Window_Type
+#define stdscr SLcurses_Stdscr
+
+#define subwin		SLcurses_subwin
+#define wclrtobot	SLcurses_wclrtobot
+#define wscrl		SLcurses_wscrl
+#define scrl(n)		wscrl(stdscr,(n))
+#define scroll(w)	wscrl((w),1)
+#define wrefresh	SLcurses_wrefresh
+#define delwin		SLcurses_delwin
+#define wmove		SLcurses_wmove
+#define newwin		SLcurses_newwin
+#define wnoutrefresh	SLcurses_wnoutrefresh
+#define werase(w)	SLcurses_wmove((w),0,0); SLcurses_wclrtobot(w)
+#define wclear(w)	SLcurses_wmove((w),0,0); SLcurses_wclrtobot(w)
+#define wprintw		SLcurses_wprintw
+#define mvwprintw	SLcurses_mvwprintw
+
+#define winch(w) \
+ ((((w)->_cury < (w)->nrows) && ((w)->_curx < (w)->ncols)) \
+ ? ((w)->lines(w)->_cury(w)->_curx.main) : 0)
+
+#define inch() winch(stdscr)
+#define mvwinch(w,x,y) \
+ ((-1 != wmove((w),(x),(y))) ? winch(w) : (-1))
+#define doupdate SLsmg_refresh
+
+#define mvwin(w,a,b) ((w)->_begy = (a), (w)->_begx = (b))
+
+extern int SLcurses_mvprintw (int, int, char *, ...);
+extern int SLcurses_mvwprintw (SLcurses_Window_Type *, int, int, char *, ...);
+extern int SLcurses_has_colors(void);
+extern int SLcurses_nil (void);
+extern int SLcurses_wgetch (SLcurses_Window_Type *);
+extern int SLcurses_getch (void);
+
+extern int SLcurses_wattrset (SLcurses_Window_Type *, SLcurses_Char_Type);
+extern int SLcurses_wattron (SLcurses_Window_Type *, SLcurses_Char_Type);
+extern int SLcurses_wattroff (SLcurses_Window_Type *, SLcurses_Char_Type);
+#define attrset(x) SLcurses_wattrset(stdscr, (x))
+#define attron(x) SLcurses_wattron(stdscr, (x))
+#define attroff(x) SLcurses_wattroff(stdscr, (x))
+#define wattrset(w, x) SLcurses_wattrset((w), (x))
+#define wattron(w, x) SLcurses_wattron((w), (x))
+#define wattroff(w, x) SLcurses_wattroff((w), (x))
+#define wattr_get(w) ((w)->color << 8)
+#define attr_get() wattr_get(stdscr)
+
+#define COLOR_PAIR(x) ((SLcurses_Char_Type)(x) << 24)
+
+extern int SLcurses_start_color (void);
+#define start_color SLcurses_start_color
+
+#define ERR 0xFFFF
+#define wgetch SLcurses_wgetch
+#define getch SLcurses_getch
+
+extern int SLcurses_nodelay (SLcurses_Window_Type *, int);
+extern SLcurses_Window_Type *SLcurses_initscr (void);
+#define initscr SLcurses_initscr
+
+extern int SLcurses_cbreak (void);
+extern int SLcurses_raw (void);
+#define cbreak SLcurses_cbreak
+#define crmode SLcurses_cbreak
+#define raw SLcurses_raw
+#define noraw SLang_reset_tty
+#define nocbreak SLang_reset_tty
+
+#define mvprintw SLcurses_mvprintw
+#define has_colors SLcurses_has_colors
+#define nodelay SLcurses_nodelay
+
+#define ungetch SLang_ungetkey
+
+#define COLS SLtt_Screen_Cols
+#define LINES SLtt_Screen_Rows
+
+#define move(x,y) SLcurses_wmove(stdscr, (x), (y))
+#define wclrtoeol SLcurses_wclrtoeol
+#define clrtoeol() SLcurses_wclrtoeol(stdscr)
+#define clrtobot() SLcurses_wclrtobot(stdscr)
+
+#define printw SLcurses_printw
+#define mvprintw SLcurses_mvprintw
+#define wstandout(w) SLcurses_wattrset((w),A_STANDOUT)
+#define wstandend(w) SLcurses_wattrset((w),A_NORMAL)
+#define standout() SLcurses_wattrset(stdscr,A_STANDOUT)
+#define standend() SLcurses_wattrset(stdscr,A_NORMAL)
+
+#define refresh() SLcurses_wrefresh(stdscr)
+#define clear() SLcurses_wclear(stdscr)
+#define erase() werase(stdscr)
+#define touchline SLsmg_touch_lines
+#define resetterm SLang_reset_tty
+
+extern int SLcurses_endwin (void);
+#define endwin SLcurses_endwin
+extern int SLcurses_Is_Endwin;
+#define isendwin() SLcurses_Is_Endwin
+
+#define keypad(w,x) ((w)->use_keypad = (x))
+
+#define KEY_MIN		SL_KEY_UP
+#define KEY_DOWN	SL_KEY_DOWN
+#define KEY_UP		SL_KEY_UP
+#define KEY_LEFT	SL_KEY_LEFT
+#define KEY_RIGHT	SL_KEY_RIGHT
+#define KEY_A1		SL_KEY_A1
+#define KEY_B1		SL_KEY_B1
+#define KEY_C1		SL_KEY_C1
+#define KEY_A2		SL_KEY_A2
+#define KEY_B2		SL_KEY_B2
+#define KEY_C2		SL_KEY_C2
+#define KEY_A3		SL_KEY_A3
+#define KEY_B3		SL_KEY_B3
+#define KEY_C3		SL_KEY_C3
+#define KEY_REDO	SL_KEY_REDO
+#define KEY_UNDO	SL_KEY_UNDO
+#define KEY_BACKSPACE	SL_KEY_BACKSPACE
+#define KEY_PPAGE	SL_KEY_PPAGE
+#define KEY_NPAGE	SL_KEY_NPAGE
+#define KEY_HOME	SL_KEY_HOME
+#define KEY_END		SL_KEY_END
+#define KEY_F0		SL_KEY_F0
+#define KEY_F		SL_KEY_F
+#define KEY_ENTER	SL_KEY_ENTER
+#define KEY_MAX		0xFFFF
+
+/* Ugly Hacks that may not work */
+#define flushinp SLcurses_nil
+#define winsertln(w) \
+ ((w)->scroll_min=(w)->_cury, \
+ (w)->scroll_max=(w)->nrows, \
+ wscrl((w), -1))
+
+extern SLcurses_Char_Type SLcurses_Acs_Map 128;
+#define acs_map SLcurses_Acs_Map
+
+#define ACS_ULCORNER (acs_mapSLSMG_ULCORN_CHAR)
+#define ACS_URCORNER (acs_mapSLSMG_URCORN_CHAR)
+#define ACS_LRCORNER (acs_mapSLSMG_LRCORN_CHAR)
+#define ACS_LLCORNER (acs_mapSLSMG_LLCORN_CHAR)
+#define ACS_TTEE (acs_mapSLSMG_UTEE_CHAR)
+#define ACS_LTEE (acs_mapSLSMG_LTEE_CHAR)
+#define ACS_RTEE (acs_mapSLSMG_RTEE_CHAR)
+#define ACS_BTEE (acs_mapSLSMG_DTEE_CHAR)
+#define ACS_PLUS (acs_mapSLSMG_PLUS_CHAR)
+#define ACS_VLINE (acs_mapSLSMG_VLINE_CHAR)
+#define ACS_HLINE (acs_mapSLSMG_HLINE_CHAR)
+#define ACS_S1		'-'
+#define ACS_S9		'-'
+#define ACS_DIAMOND		'&'
+#define ACS_CKBOARD		(acs_mapSLSMG_CKBRD_CHAR)
+#define ACS_DEGREE		'o'
+#define ACS_PLMINUS		'+'
+#define ACS_BULLET		'*'
+#define ACS_LARROW		'<'
+#define ACS_RARROW		'>'
+#define ACS_DARROW		'v'
+#define ACS_UARROW		'^'
+#define ACS_BOARD		'#'
+#define ACS_LANTERN		'#'
+#define ACS_BLOCK		'#'
+
+#if 1
+#define hline(x,y) SLcurses_nil ()
+#define vline(x,y) SLcurses_nil ()
+#endif
+
+#define A_CHARTEXT	0x001FFFFFUL	/* was 0x00FF */
+#define A_NORMAL	0x00000000UL
+#define A_UNUSED	0x00e00000UL	/* maybe more colors? */
+#define A_COLOR		0x0f000000UL	/* was 0x0F00 */
+#define A_BOLD		0x10000000UL	/* was 0x1000 */
+#define A_REVERSE	0x20000000UL	/* was 0x2000 */
+#define A_STANDOUT	A_REVERSE
+#define A_UNDERLINE	0x40000000UL	/* was 0x4000 */
+#define A_ALTCHARSET	0x80000000UL	/* was 0x8000 */
+#define A_BLINK		0x00000000UL
+#define A_ITALIC	0x00000000UL
+#define A_DIM		0x00000000UL
+#define A_PROTECT	0x00000000UL
+#define A_INVIS		0x00000000UL
+
+#define COLOR_BLACK	SLSMG_COLOR_BLACK
+#define COLOR_RED	SLSMG_COLOR_RED
+#define COLOR_GREEN	SLSMG_COLOR_GREEN
+#define COLOR_YELLOW	SLSMG_COLOR_BROWN
+#define COLOR_BLUE	SLSMG_COLOR_BLUE
+#define COLOR_MAGENTA	SLSMG_COLOR_MAGENTA
+#define COLOR_CYAN	SLSMG_COLOR_CYAN
+#define COLOR_WHITE	SLSMG_COLOR_LGRAY
+
+extern int SLcurses_Num_Colors;
+#define COLORS		SLcurses_Num_Colors
+#define COLOR_PAIRS	(SLcurses_Num_Colors*SLcurses_Num_Colors)
+
+#if SLANG_VERSION >= 30000
+# define init_pair(_x,_f,_b) \
+ SLtt_set_color_fgbg ((_x), \
+			(((_f) == (_b)) ? 7 : (_f)), \
+			(((_f) == (_b)) ? 0 : (_b)))
+#else
+# define init_pair(_x,_f,_b) \
+ SLtt_set_color_object((_x), ((_f) == (_b) ? 0x0700 : ((_f) | ((_b) << 8)) << 8))
+#endif
+
+#define scrollok(a,b) ((a)->scroll_ok = (b))
+#define getyx(a,y,x) (y=(a)->_cury, x=(a)->_curx)
+#define getmaxyx(a,y,x) (y=(a)->nrows, x=(a)->ncols)
+#ifdef napms
+# undef napms
+#endif
+#define napms(x) usleep(1000 * (x))
+typedef SLtt_Char_Type chtype;
+#define beep SLtt_beep
+#define curs_set(x) SLtt_set_cursor_visibility(x)
+#define touchwin(x) SLsmg_touch_lines((x)->_begy, (x)->nrows)
+#define flash SLtt_beep
+
+#define wsetscrreg(w,a,b)	((w)->scroll_min = (a), (w)->scroll_max = (b))
+
+#define wtimeout(a,b) (a)->delay_off = ((b >= 0) ? (b) / 100 : -1)
+#define timeout(a) wtimeout(stdscr, a)
+extern int SLcurses_wdelch (SLcurses_Window_Type *);
+#define wdelch SLcurses_wdelch
+#define delch() wdelch(stdscr)
+
+extern int SLcurses_winsch (SLcurses_Window_Type *, int);
+#define winsch SLcurses_winsch
+
+extern int SLcurses_Esc_Delay;/* ESC expire time in milliseconds (ncurses compatible) */
+#define ESCDELAY SLcurses_Esc_Delay
+
+extern int SLcurses_clearok (SLcurses_Window_Type *, int);
+#define clearok SLcurses_clearok
+
+/* Functions that have not been implemented. */
+#define copywin(w,v,a,b,c,d,e,f,g) SLcurses_nil()
+#define wdeleteln(win) SLcurses_nil()
+#define resetty SLcurses_nil
+#define savetty SLcurses_nil
+#define overlay(u,v) SLcurses_nil()
+
+/* These functions do nothing */
+#define savetty SLcurses_nil
+#define nonl SLcurses_nil
+#define echo SLcurses_nil
+#define noecho SLcurses_nil
+#define saveterm SLcurses_nil
+#define box(w,y,z) ((w)->has_box = 1, (w)->modified = 1)
+#define leaveok(a,b) SLcurses_nil()
+#define nl() SLcurses_nil()
+#define trace(x) SLcurses_nil()
+#define tigetstr(x) NULL
+
+/* These have no place in C */
+#define TRUE 1
+#define FALSE 0
+#define bool int
+
+/* Lynx compatability */
+#else
+
+#define stdscr NULL
+#define COLS SLtt_Screen_Cols
+#define LINES SLtt_Screen_Rows
+#define move SLsmg_gotorc
+#define addstr SLsmg_write_string
+#define clear SLsmg_cls
+#define standout SLsmg_reverse_video
+#define standend SLsmg_normal_video
+#define clrtoeol SLsmg_erase_eol
+#define scrollok(a,b) SLsmg_Newline_Moves = ((b) ? 1 : -1)
+#define addch SLsmg_write_char
+#define echo()
+#define printw SLsmg_printf
+#define endwin SLsmg_reset_smg(),SLang_reset_tty
+
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/sldisply.c Added

@@ -0,0 +1,3351 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include <time.h>
+#include <ctype.h>
+
+#if !defined(VMS) || (__VMS_VER >= 70000000)
+# include <sys/time.h>
+# ifdef __QNX__
+# include <sys/select.h>
+# endif
+# include <sys/types.h>
+#endif
+
+#if defined(__BEOS__) && !defined(__HAIKU__)
+/* Prototype for select */
+# include <net/socket.h>
+#endif
+
+#ifdef HAVE_TERMIOS_H
+# include <termios.h>
+#endif
+
+#ifdef VMS
+# include <unixlib.h>
+# include <unixio.h>
+# include <dvidef.h>
+# include <descrip.h>
+# include <lib$routines.h>
+# include <starlet.h>
+#else
+# if !defined(sun)
+# include <sys/ioctl.h>
+# endif
+#endif
+
+#ifdef SYSV
+# include <sys/termio.h>
+# include <sys/stream.h>
+# include <sys/ptem.h>
+# include <sys/tty.h>
+#endif
+
+#if defined (_AIX) && !defined (FD_SET)
+# include <sys/select.h>	/* for FD_ISSET, FD_SET, FD_ZERO */
+#endif
+
+#include <errno.h>
+
+#if defined(__DECC) && defined(VMS)
+/* These get prototypes for write an sleep */
+# include <unixio.h>
+#endif
+#include <signal.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+#define CROSS_COMPILE_FOR_VMS	0
+#ifdef VMS
+# define VMS_SYSTEM 1
+#else
+# if CROSS_COMPILE_FOR_VMS
+# define VMS 1
+# undef __unix__
+# endif
+#endif
+
+/* Colors: These definitions are used for the display. However, the
+ * application only uses object handles which get mapped to this
+ * internal representation. The mapping is performed by the Color_Map
+ * structure below.
+ *
+ * Colors are encoded in 25 bits as follows:
+ * - Values 0-255 for standard palette
+ * - 256 for terminal's default color
+ * - 0x1RRGGBB for true colors
+ *
+ * The bits are split so we can maintain ABI compatibility on 64 bit machines.
+ */
+#if SLTT_HAS_TRUECOLOR_SUPPORT && (SIZEOF_LONG == 8)
+static int Has_True_Color = 0;
+# if 0
+# define FG_MASK_LOW		0x0000000000FFFFFFULL
+# define FG_MASK_HIGH		0x0200000000000000ULL
+# define BG_MASK		0x01FFFFFF00000000ULL
+# define ATTR_MASK		0x000000003F000000ULL
+# define INVALID_ATTR		0xFFFFFFFFFFFFFFFFULL
+# define SLSMG_COLOR_DEFAULT	0x0000000000000100ULL
+
+# define TRUE_COLOR_BIT		0x01000000ULL
+# define IS_TRUE_COLOR(f)	((f) & TRUE_COLOR_BIT)
+# define GET_FG(fgbg) ((((fgbg) & FG_MASK_HIGH) >> 33) | ((fgbg) & FG_MASK_LOW))
+# define GET_BG(fgbg) (((fgbg) & BG_MASK) >> 32)
+# define MAKE_COLOR(f, b) \
+ ((((f) << 33) & FG_MASK_HIGH) | ((f) & FG_MASK_LOW) \
+ | (((b) << 32) & BG_MASK))
+# else
+# define FG_MASK_LOW		0x000000000000FF00ULL
+# define FG_MASK_HIGH		0x0000FFFF00000000ULL
+# define FG_TRUE_COLOR		0x0000000000000001ULL
+# define BG_MASK_LOW		0x0000000000FF0000ULL
+# define BG_MASK_HIGH		0xFFFF000000000000ULL
+# define BG_TRUE_COLOR		0x0000000000000002ULL
+# define ATTR_MASK		0x000000003F000000ULL
+# define INVALID_ATTR		0xFFFFFFFFFFFFFFFFULL
+
+# define SLSMG_COLOR_DEFAULT		0x00000100ULL
+# define TRUE_COLOR_BIT		0x01000000ULL
+# define IS_TRUE_COLOR(f)	((f) & TRUE_COLOR_BIT)
+# define GET_FG(fgbg) \
+ ((((fgbg)&FG_TRUE_COLOR)<<24) | (((fgbg)&FG_MASK_HIGH)>>24) \
+ | (((fgbg)&FG_MASK_LOW)>>8))
+# define GET_BG(fgbg) \
+ ((((fgbg)&BG_TRUE_COLOR)<<23) | (((fgbg)&BG_MASK_HIGH)>>40) \
+ | (((fgbg)&BG_MASK_LOW)>>16))
+# define MAKE_COLOR(f, b) \
+ (((((f)&0x1000000)>>24) | (((f)&0xFF)<<8) | (((f)&(0xFFFF00))<<24)) \
+ | ((((b)&0x1000000)>>23) | (((b)&0xFF)<<16) | (((b)&(0xFFFF00))<<40)))
+# endif
+#else
+# undef SLTT_HAS_TRUECOLOR_SUPPORT
+# define SLTT_HAS_TRUECOLOR_SUPPORT 0
+# define FG_MASK_LOW		0x0000FF00UL
+# define FG_MASK_HIGH		0x00000000UL
+# define BG_MASK		0x00FF0000UL
+# define ATTR_MASK		0x3F000000UL
+# define INVALID_ATTR		0xFFFFFFFFUL
+# define SLSMG_COLOR_DEFAULT	0x000000FFUL
+# define IS_TRUE_COLOR(f)	(0)
+# define GET_FG(fgbg) (((fgbg) & FG_MASK_LOW)>>8)
+# define GET_BG(fgbg) (((fgbg) & BG_MASK) >> 16)
+# define MAKE_COLOR(fg, bg) (((fg)<<8) | ((bg)<<16))
+#endif
+
+int SLtt_Screen_Cols = 80;
+int SLtt_Screen_Rows = 24;
+int SLtt_Term_Cannot_Insert = 0;
+int SLtt_Term_Cannot_Scroll = 0;
+int SLtt_Use_Ansi_Colors = 0;
+int SLtt_Blink_Mode = 0;
+int SLtt_Use_Blink_For_ACS = 0;
+int SLtt_Newline_Ok = 0;
+int SLtt_Has_Alt_Charset = 0;
+int SLtt_Force_Keypad_Init = -1;
+
+static int Use_Relative_Cursor_Addressing = 0;
+static int Max_Relative_Cursor_r = 0;
+
+/* static int UTF8_Mode = -1; */
+
+void (*_pSLtt_color_changed_hook)(void);
+
+static int Bce_Color_Offset = 0;
+static int Can_Background_Color_Erase = 1;
+
+/* -1 means unknown */
+int SLtt_Has_Status_Line = -1;	 /* hs */
+int SLang_TT_Write_FD = -1;
+
+static int TT_Is_Initialized = 0;
+static int Automatic_Margins;
+/* static int No_Move_In_Standout; */
+static int Worthless_Highlight;
+#define HP_GLITCH_CODE
+#ifdef HP_GLITCH_CODE
+/* This glitch is exclusive to HP term. Basically it means that to clear
+ * attributes, one has to erase to the end of the line.
+ */
+static int Has_HP_Glitch;
+#endif
+
+static char *Reset_Color_String;
+static int Is_Color_Terminal = 0;
+
+static int Linux_Console;
+static int Mouse_Mode = -1;
+
+/* The following comment is nolonger valid, but is here in case there are
+ * some apps that use SLtt_Use_Blink_For_ACS and still need porting to v2.
+ * -------
+ * It is crucial that JMAX_COLORS must be less than 128 since the high bit
+ * is used to indicate a character from the ACS (alt char set). The exception
+ * to this rule is if SLtt_Use_Blink_For_ACS is true. This means that of
+ * the highbit is set, we interpret that as a blink character. This is
+ * exploited by DOSemu.
+ */
+#ifndef SLTT_MAX_COLORS
+# define SLTT_MAX_COLORS 0x8000 /* consistent with SLSMG_COLOR_MASK */
+#endif
+
+#define JMAX_COLORS SLTT_MAX_COLORS
+#define JNORMAL_COLOR 0
+
+typedef struct
+{
+ SLtt_Char_Type fgbg;
+ SLtt_Char_Type mono;
+}
+Brush_Info_Type;
+
+static Brush_Info_Type Brush_TableJMAX_COLORS;
+
+/* 0 if least significant bit is blue, not red */
+static int Is_Fg_BGR = 0;
+static int Is_Bg_BGR = 0;
+#define COLOR_ARG(color, is_bgr) ((is_bgr) ? RGB_to_BGR(color)&0x7 : (color))
+static SLCONST int RGB_to_BGR =
+{
+ 0, 4, 2, 6, 1, 5, 3, 7
+};
+
+static SLCONST char *Color_Fg_Str = "\0333%dm";
+static SLCONST char *Color_Bg_Str = "\0334%dm";
+#if SLTT_HAS_TRUECOLOR_SUPPORT
+static SLCONST char *Color_RGB_Fg_Str = "\03338;2;%d;%d;%dm";
+static SLCONST char *Color_RGB_Bg_Str = "\03348;2;%d;%d;%dm";
+#endif
+static SLCONST char *Default_Color_Fg_Str = "\03339m";
+static SLCONST char *Default_Color_Bg_Str = "\03349m";
+
+static int Max_Terminfo_Colors = 8;	 /* termcap Co */
+
+char *SLtt_Graphics_Char_Pairs = NULL;	 /* ac termcap string -- def is vt100 */
+
+/* 1 if terminal lacks the ability to go into insert mode or into delete
+ mode. Currently controlled by S-Lang but later perhaps termcap. */
+
+static SLCONST char *UnderLine_Vid_Str;
+static SLCONST char *Blink_Vid_Str;
+static SLCONST char *Italic_Vid_Str;
+static SLCONST char *Bold_Vid_Str;
+static SLCONST char *Ins_Mode_Str; /* = "\0334h"; */ /* ins mode (im) */
+static SLCONST char *Eins_Mode_Str; /* = "\0334l"; */ /* end ins mode (ei) */
+static SLCONST char *Scroll_R_Str; /* = "\033%d;%dr"; */ /* scroll region */
+static SLCONST char *Cls_Str; /* = "\0332J\033H"; */ /* cl termcap STR for ansi terminals */
+static SLCONST char *Rev_Vid_Str; /* = "\0337m"; */ /* mr,so termcap string */
+static SLCONST char *Norm_Vid_Str; /* = "\033m"; */ /* me,se termcap string */
+static SLCONST char *Del_Eol_Str; /* = "\033K"; */	 /* ce */
+static SLCONST char *Del_Bol_Str; /* = "\0331K"; */	 /* cb */
+static SLCONST char *Del_Char_Str; /* = "\033P"; */ /* dc */
+static SLCONST char *Del_N_Lines_Str; /* = "\033%dM"; */ /* DL */
+static SLCONST char *Add_N_Lines_Str; /* = "\033%dL"; */ /* AL */
+static SLCONST char *Rev_Scroll_Str;
+static SLCONST char *Curs_Up_Str; /* "up" */
+static SLCONST char *Curs_UpN_Str; /* "UP" */
+static SLCONST char *Curs_Dn_Str; /* "do" */
+static SLCONST char *Curs_DnN_Str; /* "DO" */
+static SLCONST char *Curs_Right_Str; /* "nd" */
+static SLCONST char *Curs_RightN_Str; /* "RI" */
+static SLCONST char *Curs_Left_Str; /* "bc", "le" */
+static SLCONST char *Curs_LeftN_Str; /* "LE" */
+static SLCONST char *Clear_EOS_Str; /* cd */
+
+static SLCONST char *Cursor_Visible_Str; /* ve termcap string */
+static SLCONST char *Cursor_Invisible_Str; /* vi termcap string */
+#if 0
+static SLCONST char *Start_Mouse_Rpt_Str; /* Start mouse reporting mode */
+static SLCONST char *End_Mouse_Rpt_Str; /* End mouse reporting mode */
+#endif
+static SLCONST char *Start_Alt_Chars_Str; /* as */
+static SLCONST char *End_Alt_Chars_Str; /* ae */
+static SLCONST char *Enable_Alt_Char_Set; /* eA */
+
+static SLCONST char *Start_Abs_Cursor_Addressing_Mode;
+static SLCONST char *Keypad_Init_Str;
+static SLCONST char *End_Abs_Cursor_Addressing_Mode;
+static SLCONST char *Keypad_Reset_Str;
+
+/* status line functions */
+static SLCONST char *Disable_Status_line_Str; /* ds */
+static SLCONST char *Return_From_Status_Line_Str; /* fs */
+static SLCONST char *Goto_Status_Line_Str; /* ts */
+/* static int Num_Status_Line_Columns; */ /* ws */
+/* static int Status_Line_Esc_Ok;	 */ /* es */
+
+/* cm string has %i%d since termcap numbers columns from 0 */
+/* char *CURS_POS_STR = "\033%d;%df"; ansi-- hor and vert pos */
+static SLCONST char *Abs_Curs_Pos_Str; /* = "\033%i%d;%dH";*/ /* cm termcap string */
+
+/* scrolling region */
+static int Scroll_r1 = 0, Scroll_r2 = 23;
+static int Cursor_r, Cursor_c;	 /* 0 based */
+
+/* current attributes --- initialized to impossible value */
+static SLtt_Char_Type Current_Fgbg = INVALID_ATTR;
+
+static int Cursor_Set;		 /* 1 if cursor position known, 0
+					* if not. -1 if only row is known
+					*/
+/* This is used only in relative-cursor-addressing mode */
+static SLsmg_Char_Type Display_Start_CharsSLTT_MAX_SCREEN_ROWS;
+
+#define MAX_OUTPUT_BUFFER_SIZE 4096
+
+static unsigned char Output_BufferMAX_OUTPUT_BUFFER_SIZE;
+static unsigned char *Output_Bufferp = Output_Buffer;
+
+unsigned long SLtt_Num_Chars_Output = 0;
+
+int _pSLusleep (unsigned long usecs)
+{
+#if !defined(VMS) || (__VMS_VER >= 70000000)
+ struct timeval tv;
+ tv.tv_sec = usecs / 1000000;
+ tv.tv_usec = usecs % 1000000;
+ return select(0, NULL, NULL, NULL, &tv);
+#else
+ return 0;
+#endif
+}
+
+int SLtt_flush_output (void)
+{
+ size_t total;
+ size_t n = (Output_Bufferp - Output_Buffer);
+
+ SLtt_Num_Chars_Output += n;
+
+ total = 0;
+ while (n > 0)
+ {
+	ssize_t nwrite = write (SLang_TT_Write_FD, (char *) Output_Buffer + total, n);
+	if (nwrite == -1)
+	 {
+	 nwrite = 0;
+#ifdef EAGAIN
+	 if (errno == EAGAIN)
+	 {
+		 _pSLusleep (100000); /* 1/10 sec */
+		 continue;
+	 }
+#endif
+#ifdef EWOULDBLOCK
+	 if (errno == EWOULDBLOCK)
+	 {
+		 _pSLusleep (100000);
+		 continue;
+	 }
+#endif
+#ifdef EINTR
+	 if (errno == EINTR) continue;
+#endif
+	 break;
+	 }
+	n -= nwrite;
+	total += nwrite;
+ }
+ Output_Bufferp = Output_Buffer;
+ return n;
+}
+
+int SLtt_Baud_Rate = 0;
+static void tt_write(SLCONST char *str, SLstrlen_Type n)
+{
+ static unsigned long last_time;
+ static SLstrlen_Type total;
+
+ if ((str == NULL) || (n == 0)) return;
+ total += n;
+
+ while (1)
+ {
+	size_t ndiff = MAX_OUTPUT_BUFFER_SIZE - (Output_Bufferp - Output_Buffer);
+	if (ndiff < n)
+	 {
+	 memcpy ((char *) Output_Bufferp, str, ndiff);
+	 Output_Bufferp += ndiff;
+	 SLtt_flush_output ();
+	 n -= ndiff;
+	 str += ndiff;
+	 }
+	else
+	 {
+	 memcpy ((char *) Output_Bufferp, str, n);
+	 Output_Bufferp += n;
+	 break;
+	 }
+ }
+
+ if (((SLtt_Baud_Rate > 150) && (SLtt_Baud_Rate <= 9600))
+ && (10 * total > (unsigned int)SLtt_Baud_Rate))
+ {
+	unsigned long now;
+	total = 0;
+	if ((now = (unsigned long) time(NULL)) - last_time <= 1)
+	 {
+	 SLtt_flush_output ();
+	 sleep((unsigned) 1);
+	 }
+	last_time = now;
+ }
+}
+
+static void tt_write_string (SLCONST char *str)
+{
+ if (str != NULL) tt_write(str, strlen(str));
+}
+
+void SLtt_write_string (SLFUTURE_CONST char *str)
+{
+ tt_write_string (str);
+ Cursor_Set = 0;
+}
+
+void SLtt_putchar (char ch)
+{
+ SLtt_normal_video ();
+ if (Cursor_Set == 1)
+ {
+	if (ch >= ' ') Cursor_c++;
+	else if (ch == '\b') Cursor_c--;
+	else if (ch == '\r') Cursor_c = 0;
+	else Cursor_Set = 0;
+
+	if ((Cursor_c + 1 == SLtt_Screen_Cols)
+	 && Automatic_Margins) Cursor_Set = 0;
+ }
+
+ if (Output_Bufferp < Output_Buffer + MAX_OUTPUT_BUFFER_SIZE)
+ {
+	*Output_Bufferp++ = (unsigned char) ch;
+ }
+ else tt_write (&ch, 1);
+}
+
+#if defined(__GNUC__)
+# pragma GCC diagnostic ignored "-Wformat-nonliteral"
+#endif
+static unsigned int tt_sprintf(char *buf, unsigned int buflen, SLCONST char *fmt, int x, int y)
+{
+ SLCONST char *fmt_max;
+ unsigned char *b, *bmax;
+ int offset;
+ int z, z1, parse_level;
+ int zero_pad;
+ int field_width;
+ int variables 26;
+ int stack 64;
+ unsigned int stack_len;
+ int parms 10;
+#define STACK_POP (stack_len ? stack--stack_len : 0)
+
+ if (fmt == NULL)
+ {
+	*buf = 0;
+	return 0;
+ }
+
+ stack 0 = y;	 /* pushed for termcap */
+ stack 1 = x;
+ stack_len = 2;
+
+ parms 1 = x;	 /* p1 */
+ parms 2 = y;	 /* p2 */
+
+ offset = 0;
+ zero_pad = 0;
+ field_width = 0;
+
+ b = (unsigned char *) buf;
+ bmax = b + buflen;
+
+ fmt_max = fmt + strlen (fmt);
+
+ while ((fmt < fmt_max) && (b < bmax))
+ {
+	unsigned char ch = *fmt++;
+
+	if (ch != '%')
+	 {
+	 *b++ = ch;
+	 continue;
+	 }
+
+	if (fmt == fmt_max) break;
+	ch = *fmt++;
+
+	switch (ch)
+	 {
+	 default:
+	 *b++ = ch;
+	 break;
+
+	 case 'p':
+
+	 if (fmt == fmt_max) break;
+	 ch = *fmt++;
+	 if ((ch >= '0') && (ch <= '9'))
+	 stack stack_len++ = parms ch - '0';
+	 break;
+
+	 case '\'': /* 'x' */
+	 if (fmt == fmt_max) break;
+	 stack stack_len++ = *fmt++;
+	 if (fmt < fmt_max) fmt++; /* skip ' */
+	 break;
+
+	 case '{':	 /* literal constant, e.g. {30} */
+	 z = 0;
+	 while ((fmt < fmt_max) && ((ch = *fmt) <= '9') && (ch >= '0'))
+	 {
+		 z = z * 10 + (ch - '0');
+		 fmt++;
+	 }
+	 stack stack_len++ = z;
+	 if ((ch == '}') && (fmt < fmt_max)) fmt++;
+	 break;
+
+	 case '0':
+	 if (fmt == fmt_max) break;
+	 ch = *fmt;
+	 if ((ch != '2') && (ch != '3'))
+	 break;
+	 zero_pad = 1;
+	 fmt++;
+	 /* drop */
+
+	 case '2':
+	 case '3':
+	 if (fmt == fmt_max) break;
+	 if (*fmt == 'x')
+	 {
+		 char x_fmt_buf 4;
+		 char *x_fmt_buf_ptr;
+
+		 x_fmt_buf_ptr = x_fmt_buf;
+		 if (zero_pad) *x_fmt_buf_ptr++ = '0';
+		 *x_fmt_buf_ptr++ = ch;
+		 *x_fmt_buf_ptr++ = 'X';
+		 *x_fmt_buf_ptr = 0;
+
+		 z = STACK_POP;
+		 z += offset;
+
+		 sprintf ((char *)b, x_fmt_buf, z);
+		 b += strlen ((char *)b);
+		 zero_pad = 0;
+		 break;
+	 }
+
+	 field_width = (ch - '0');
+		 /* drop */
+
+	 case 'd':
+	 z = STACK_POP;
+	 z += offset;
+	 if (z >= 100)
+	 {
+		 *b++ = z / 100 + '0';
+		 z = z % 100;
+		 zero_pad = 1;
+		 field_width = 2;
+	 }
+	 else if (zero_pad && (field_width == 3))
+	 *b++ = '0';
+
+	 if (b == bmax) break;
+	 if (z >= 10)
+	 {
+		 *b++ = z / 10 + '0';
+		 z = z % 10;
+	 }
+	 else if (zero_pad && (field_width >= 2))
+	 *b++ = '0';
+
+	 if (b == bmax) break;
+	 *b++ = z + '0';
+	 field_width = zero_pad = 0;
+	 break;
+
+	 case 'x':
+	 z = STACK_POP;
+	 z += offset;
+	 if (b + 16 >= bmax)
+	 break;
+	 sprintf ((char *) b, "%X", z);
+	 b += strlen ((char *)b);
+	 break;
+
+	 case 'i':
+	 offset = 1;
+	 break;
+
+	 case '+':
+	 /* Handling this depends upon whether or not we are parsing
+	 * terminfo. Terminfo requires the stack so use it as an
+	 * indicator.
+	 */
+	 if (stack_len > 2)
+	 {
+		 z = STACK_POP;
+		 stack stack_len - 1 += z;
+	 }
+	 else if (fmt < fmt_max)
+	 {
+		 ch = *fmt++;
+		 if ((unsigned char) ch == 128) ch = 0;
+		 ch = ch + (unsigned char) STACK_POP;
+		 if (ch == '\n') ch++;
+		 *b++ = ch;
+	 }
+	 break;
+
+	 /* Binary operators */
+	 case '-':
+	 case '*':
+	 case '/':
+	 case 'm':
+	 case '&':
+	 case '|':
+	 case '^':
+	 case '=':
+	 case '>':
+	 case '<':
+	 case 'A':
+	 case 'O':
+	 z1 = STACK_POP;
+	 z = STACK_POP;
+	 switch (ch)
+	 {
+		case '-': z = (z - z1); break;
+		case '*': z = (z * z1); break;
+		case '/': z = (z / z1); break;
+		case 'm': z = (z % z1); break;
+		case '&': z = (z & z1); break;
+		case '|': z = (z | z1); break;
+		case '^': z = (z ^ z1); break;
+		case '=': z = (z == z1); break;
+		case '>': z = (z > z1); break;
+		case '<': z = (z < z1); break;
+		case 'A': z = (z && z1); break;
+		case 'O': z = (z || z1); break;
+	 }
+	 stack stack_len++ = z;
+	 break;
+
+	 /* unary */
+	 case '!':
+	 z = STACK_POP;
+	 stack stack_len++ = !z;
+	 break;
+
+	 case '~':
+	 z = STACK_POP;
+	 stack stack_len++ = ~z;
+	 break;
+
+	 case 'r':		 /* termcap -- swap parameters */
+	 z = stack 0;
+	 stack 0 = stack 1;
+	 stack 1 = z;
+	 break;
+
+	 case '.':		 /* termcap */
+	 case 'c':
+	 ch = (unsigned char) STACK_POP;
+	 if (ch == '\n') ch++;
+	 *b++ = ch;
+	 break;
+
+	 case 'g':
+	 if (fmt == fmt_max) break;
+	 ch = *fmt++;
+	 if ((ch >= 'a') && (ch <= 'z'))
+	 stack stack_len++ = variables ch - 'a';
+	 break;
+
+	 case 'P':
+	 if (fmt == fmt_max) break;
+	 ch = *fmt++;
+	 if ((ch >= 'a') && (ch <= 'z'))
+	 variables ch - 'a' = STACK_POP;
+	 break;
+
+	 /* If then else parsing. Actually, this is rather easy. The
+	 * key is to notice that 'then' does all the work. 'if' simply
+	 * there to indicate the start of a test and endif indicates
+	 * the end of tests. If 'else' is seen, then skip to
+	 * endif.
+	 */
+	 case '?':		 /* if */
+	 case ';':		 /* endif */
+	 break;
+
+	 case 't':		 /* then */
+	 z = STACK_POP;
+	 if (z != 0)
+	 break;		 /* good. Continue parsing. */
+
+	 /* z == 0 and test has failed. So, skip past this entire if
+	 * expression to the matching else or matching endif.
+	 */
+	 /* drop */
+	 case 'e':		 /* else */
+
+	 parse_level = 0;
+	 while (fmt < fmt_max)
+	 {
+		 unsigned char ch1;
+
+		 ch1 = *fmt++;
+		 if ((ch1 != '%') || (fmt == fmt_max))
+		 continue;
+
+		 ch1 = *fmt++;
+
+		 if (ch1 == '?') parse_level++; /* new if */
+		 else if (ch1 == 'e')
+		 {
+		 if ((ch != 'e') && (parse_level == 0))
+			 break;
+		 }
+		 else if (ch1 == ';')
+		 {
+		 if (parse_level == 0)
+			 break;
+		 parse_level--;
+		 }
+	 }
+	 break;
+	 }
+ }
+ if (b >= bmax)
+ b = bmax - 1;
+ *b = 0;
+
+ return (unsigned int) (b - (unsigned char *) buf);
+}
+#if defined(__GNUC__)
+# pragma GCC diagnostic warning "-Wformat-nonliteral"
+#endif
+
+static void tt_printf(SLCONST char *fmt, int x, int y)
+{
+ char buf1024;
+ unsigned int n;
+ if (fmt == NULL) return;
+ n = tt_sprintf(buf, sizeof (buf), fmt, x, y);
+ tt_write(buf, n);
+}
+
+void SLtt_set_scroll_region (int r1, int r2)
+{
+ if (Use_Relative_Cursor_Addressing)
+ return;
+
+ Scroll_r1 = r1;
+ Scroll_r2 = r2;
+ tt_printf (Scroll_R_Str, Scroll_r1, Scroll_r2);
+ Cursor_Set = 0;
+}
+
+void SLtt_reset_scroll_region (void)
+{
+ SLtt_set_scroll_region(0, SLtt_Screen_Rows - 1);
+}
+
+int SLtt_set_cursor_visibility (int show)
+{
+ if ((Cursor_Visible_Str == NULL) || (Cursor_Invisible_Str == NULL))
+ return -1;
+
+ tt_write_string (show ? Cursor_Visible_Str : Cursor_Invisible_Str);
+ return 0;
+}
+
+static void cursor_motion (SLCONST char *s1, SLCONST char *sN, int n)
+{
+ if ((n == 1) && (s1 != NULL))
+ {
+	tt_write_string (s1);
+	return;
+ }
+
+ if (n <= 0)
+ return;
+
+ if (sN != NULL)
+ tt_printf (sN, n, 0);
+ else while (n > 0)
+ {
+	tt_write_string (s1);
+	n--;
+ }
+}
+
+static void goto_relative_rc (int r, int c)
+{
+ if (r < 0)
+ return;
+
+ if (Cursor_Set != 1)
+ {
+	/* Do not know where the cursor is. At least get the column correct */
+	tt_write ("\r", 1);
+	Cursor_c = 0;
+	Cursor_Set = 1;		 /* pretend we know the row */
+ }
+
+ if (Cursor_r > r)
+ cursor_motion (Curs_Up_Str, Curs_UpN_Str, Cursor_r-r);
+ else if (Cursor_r < r)
+ {
+	tt_write ("\r", 1); Cursor_c = 0;
+	if (r > Max_Relative_Cursor_r)
+	 {
+	 cursor_motion (Curs_Dn_Str, Curs_DnN_Str, Max_Relative_Cursor_r-Cursor_r);
+	 Cursor_r = Max_Relative_Cursor_r;
+	 while (Cursor_r < r)
+	 {
+		 tt_write ("\n", 1);
+		 Cursor_r++;
+	 }
+	 }
+	else
+	 cursor_motion (Curs_Dn_Str, Curs_DnN_Str, r-Cursor_r);
+ }
+ Cursor_r = r;
+ if (r > Max_Relative_Cursor_r)
+ Max_Relative_Cursor_r = r;
+
+ if (Cursor_c > c)
+ cursor_motion (Curs_Left_Str, Curs_LeftN_Str, Cursor_c-c);
+ else if (Cursor_c < c)
+ cursor_motion (Curs_Right_Str, Curs_RightN_Str, c-Cursor_c);
+
+ Cursor_c = c;
+ Cursor_Set = 1;
+}
+
+/* the goto_rc function moves to row relative to scrolling region */
+void SLtt_goto_rc(int r, int c)
+{
+ char *s = NULL;
+ char buf6;
+
+ if ((c < 0) || (r < 0))
+ {
+	Cursor_Set = 0;
+	Cursor_c = 0;
+	Cursor_r = 0;
+	tt_write("\r", 1);
+	return;
+ }
+ if (Use_Relative_Cursor_Addressing)
+ {
+	goto_relative_rc (r, c);
+	return;
+ }
+
+ r += Scroll_r1;
+
+ if ((Cursor_Set > 0)
+ || ((Cursor_Set < 0) && !Automatic_Margins))
+ {
+	int n = r - Cursor_r;
+	if ((n == -1) && (Cursor_Set > 0) && (Cursor_c == c)
+	 && (Curs_Up_Str != NULL))
+	 {
+	 s = (char *)Curs_Up_Str;
+	 }
+	else if ((n >= 0) && (n <= 4))
+	 {
+	 if ((n == 0) && (Cursor_Set == 1)
+		 && ((c > 1) || (c == Cursor_c)))
+	 {
+		 if (Cursor_c == c) return;
+		 if (Cursor_c == c + 1)
+		 {
+		 s = buf;
+		 *s++ = '\b'; *s = 0;
+		 s = buf;
+		 }
+	 }
+	 else if (c == 0)
+	 {
+		 s = buf;
+		 if ((Cursor_Set != 1) || (Cursor_c != 0)) *s++ = '\r';
+		 while (n--) *s++ = '\n';
+#ifdef VMS
+		 /* Need to add this after \n to start a new record. Sheesh. */
+		 *s++ = '\r';
+#endif
+		 *s = 0;
+		 s = buf;
+	 }
+	 /* Will fail on VMS */
+#ifndef VMS
+	 else if (SLtt_Newline_Ok && (Cursor_Set == 1) &&
+		 (Cursor_c >= c) && (c + 3 > Cursor_c))
+	 {
+		 s = buf;
+		 while (n--) *s++ = '\n';
+		 n = Cursor_c - c;
+		 while (n--) *s++ = '\b';
+		 *s = 0;
+		 s = buf;
+	 }
+#endif
+	 }
+ }
+ if (s != NULL) tt_write_string(s);
+ else
+ {
+	tt_printf(Abs_Curs_Pos_Str, r, c);
+ }
+ Cursor_c = c; Cursor_r = r;
+ Cursor_Set = 1;
+}
+
+void SLtt_begin_insert (void)
+{
+ tt_write_string(Ins_Mode_Str);
+}
+
+void SLtt_end_insert (void)
+{
+ tt_write_string(Eins_Mode_Str);
+}
+
+void SLtt_delete_char (void)
+{
+ SLtt_normal_video ();
+ tt_write_string(Del_Char_Str);
+}
+
+void SLtt_erase_line (void)
+{
+ tt_write ("\r", 1);
+ Cursor_Set = 1; Cursor_c = 0;
+ SLtt_del_eol();
+ /* Put the cursor back at the beginning of the line */
+ tt_write_string("\r");
+ Cursor_Set = 1; Cursor_c = 0;
+}
+
+/* It appears that the Linux console, and most likely others do not
+ * like scrolling regions that consist of one line. So I have to
+ * resort to this stupidity to make up for that stupidity.
+ */
+static void delete_line_in_scroll_region (void)
+{
+ SLtt_goto_rc (Cursor_r - Scroll_r1, 0);
+ SLtt_del_eol ();
+}
+
+void SLtt_delete_nlines (int nn)
+{
+ unsigned int n;
+
+ if (nn <= 0) return;
+ n = (unsigned int) nn;
+
+ SLtt_normal_video ();
+
+ if (Scroll_r1 == Scroll_r2)
+ {
+	delete_line_in_scroll_region ();
+	return;
+ }
+
+ if (Del_N_Lines_Str != NULL) tt_printf(Del_N_Lines_Str, n, 0);
+ else
+ /* get a new terminal */
+ {
+	char buf80;
+	int curs, r1;
+	unsigned int dn = n;
+
+	if (dn > sizeof (buf))
+	 dn = sizeof (buf);
+
+	SLMEMSET (buf, '\n', dn);
+	while (n > dn)
+	 {
+	 tt_write (buf, dn);
+	 n -= dn;
+	 }
+	tt_write (buf, n);
+
+	r1 = Scroll_r1;
+	curs = Cursor_r;
+	SLtt_set_scroll_region(curs, Scroll_r2);
+	SLtt_goto_rc(Scroll_r2 - Scroll_r1, 0);
+	SLMEMSET(buf, '\n', (unsigned int) n);
+	tt_write(buf, (unsigned int) n);
+	/* while (n--) tt_putchar('\n'); */
+	SLtt_set_scroll_region(r1, Scroll_r2);
+	SLtt_goto_rc(curs, 0);
+ }
+}
+
+static void cls_internal (SLCONST char *escseq, int rmin)
+{
+ /* If the terminal is a color terminal but the user wants black and
+ * white, then make sure that the colors are reset. This appears to be
+ * necessary.
+ */
+ if ((SLtt_Use_Ansi_Colors == 0) && Is_Color_Terminal)
+ {
+	if (Reset_Color_String != NULL)
+	 tt_write_string (Reset_Color_String);
+	else
+	 tt_write_string ("\0330m\033m");
+ }
+
+ SLtt_normal_video();
+ SLtt_reset_scroll_region ();
+
+ tt_write_string(escseq);
+
+ if (Use_Relative_Cursor_Addressing)
+ {
+	int r, rmax = SLtt_Screen_Rows;
+	for (r = rmin; r < rmax; r++)
+	 Display_Start_Charsr.nchars = 0;
+ }
+}
+
+void SLtt_cls (void)
+{
+ cls_internal (Cls_Str, 0);
+}
+
+static void _pSLtt_clear_eos (void)
+{
+ int rmin = Cursor_r;
+ if (Cursor_c > 0) rmin++;
+ cls_internal (Clear_EOS_Str, rmin);
+}
+
+void SLtt_reverse_index (int n)
+{
+ if (!n) return;
+
+ SLtt_normal_video();
+
+ if (Scroll_r1 == Scroll_r2)
+ {
+	delete_line_in_scroll_region ();
+	return;
+ }
+
+ if (Add_N_Lines_Str != NULL) tt_printf(Add_N_Lines_Str,n, 0);
+ else
+ {
+	while(n--) tt_write_string(Rev_Scroll_Str);
+ }
+}
+
+int SLtt_Ignore_Beep = 1;
+static SLCONST char *Visible_Bell_Str;
+
+void SLtt_beep (void)
+{
+ if (SLtt_Ignore_Beep & 0x1) SLtt_putchar('\007');
+
+ if (SLtt_Ignore_Beep & 0x2)
+ {
+	if (Visible_Bell_Str != NULL) tt_write_string (Visible_Bell_Str);
+#ifdef __linux__
+	else if (Linux_Console)
+	 {
+	 tt_write ("\033?5h", 5);
+	 SLtt_flush_output ();
+	 _pSLusleep (50000);
+	 tt_write ("\033?5l", 5);
+	 }
+#endif
+ }
+ SLtt_flush_output ();
+}
+
+static void write_string_with_care (SLCONST char *);
+
+static void del_eol (void)
+{
+ if ((Cursor_c == 0)
+ && (Use_Relative_Cursor_Addressing)
+ && (Cursor_r < SLTT_MAX_SCREEN_ROWS))
+ {
+	Display_Start_CharsCursor_r.nchars = 0;
+ }
+
+ if ((Del_Eol_Str != NULL)
+ && (Can_Background_Color_Erase || (Current_Fgbg == 0)))
+ {
+	tt_write_string(Del_Eol_Str);
+	return;
+ }
+
+ while (Cursor_c < SLtt_Screen_Cols)
+ {
+	write_string_with_care (" ");
+	Cursor_c++;
+ }
+ Cursor_c = SLtt_Screen_Cols - 1;
+ Cursor_Set = 0;
+}
+
+void SLtt_del_eol (void)
+{
+ if (Current_Fgbg != INVALID_ATTR) SLtt_normal_video ();
+ del_eol ();
+}
+
+typedef SLCONST struct
+{
+ SLCONST char *name;
+ SLtt_Char_Type color;
+}
+Color_Def_Type;
+
+#define MAX_COLOR_NAMES 17
+static Color_Def_Type Color_Defs MAX_COLOR_NAMES =
+{
+ {"black",		SLSMG_COLOR_BLACK},
+ {"red",		SLSMG_COLOR_RED},
+ {"green",		SLSMG_COLOR_GREEN},
+ {"brown",		SLSMG_COLOR_BROWN},
+ {"blue",		SLSMG_COLOR_BLUE},
+ {"magenta",	SLSMG_COLOR_MAGENTA},
+ {"cyan",		SLSMG_COLOR_CYAN},
+ {"lightgray",	SLSMG_COLOR_LGRAY},
+ {"gray",		SLSMG_COLOR_GRAY},
+ {"brightred",	SLSMG_COLOR_BRIGHT_RED},
+ {"brightgreen",	SLSMG_COLOR_BRIGHT_GREEN},
+ {"yellow",		SLSMG_COLOR_BRIGHT_BROWN},
+ {"brightblue",	SLSMG_COLOR_BRIGHT_BLUE},
+ {"brightmagenta",	SLSMG_COLOR_BRIGHT_MAGENTA},
+ {"brightcyan",	SLSMG_COLOR_BRIGHT_CYAN},
+ {"white",		SLSMG_COLOR_BRIGHT_WHITE},
+ {"default",	SLSMG_COLOR_DEFAULT}
+};
+
+static int Brushes_Initialized = 0;
+
+static int initialize_brushes (void)
+{
+ Brush_Info_Type *b, *bmax;
+ SLtt_Char_Type bg;
+
+ b = Brush_Table;
+ bmax = b + JMAX_COLORS;
+
+ bg = 0;
+ while (b < bmax)
+ {
+	SLtt_Char_Type fg = 7;
+	while (b < bmax)
+	 {
+	 if (fg != bg)
+	 {
+		 b->fgbg = MAKE_COLOR(fg,bg);
+		 b->mono = SLTT_REV_MASK;
+		 b++;
+	 }
+	 if (fg == 0)
+	 break;
+	 fg--;
+	 }
+	bg++;
+	if (bg == 8)
+	 bg = 0;
+ }
+
+ Brush_Table0.mono = 0;
+ Brushes_Initialized = 1;
+ return 0;
+}
+
+static Brush_Info_Type *get_brush_info (SLsmg_Color_Type color)
+{
+ if (Brushes_Initialized == 0)
+ initialize_brushes ();
+
+ color &= SLSMG_COLOR_MASK;
+
+ if (color >= JMAX_COLORS)
+ color = 0;
+
+ return Brush_Table + color;
+}
+
+static SLtt_Char_Type get_brush_attr (SLsmg_Color_Type color)
+{
+ Brush_Info_Type *b;
+
+ if (NULL == (b = get_brush_info (color)))
+ return INVALID_ATTR;
+
+ if (SLtt_Use_Ansi_Colors)
+ return b->fgbg;
+
+ return b->mono;
+}
+
+static SLtt_Char_Type get_brush_fgbg (SLsmg_Color_Type color)
+{
+ Brush_Info_Type *b = get_brush_info(color);
+ if (b == NULL)
+ return INVALID_ATTR;
+ return b->fgbg;
+}
+
+int SLtt_set_mono (int obj, SLFUTURE_CONST char *what, SLtt_Char_Type mask)
+{
+ Brush_Info_Type *b;
+
+ (void) what;
+ if (NULL == (b = get_brush_info (obj)))
+ return -1;
+
+ b->mono = mask & ATTR_MASK;
+ return 0;
+}
+
+static SLCONST char *check_color_for_digit_form (SLCONST char *color)
+{
+ unsigned int i, ich;
+ unsigned char *s = (unsigned char *) color;
+
+ i = 0;
+ while ((ich = (unsigned int) *s) != 0)
+ {
+	if ((ich < '0') || (ich > '9'))
+	 return color;
+
+	i = i * 10 + (ich - '0');
+	s++;
+ }
+
+ if (i < MAX_COLOR_NAMES)
+ color = Color_Defsi.name;
+
+ return color;
+}
+
+static int get_default_colors (SLCONST char **fgp, SLCONST char **bgp)
+{
+ static char fg_buf16, bg_buf16;
+ static SLCONST char *bg, *fg;
+ static int already_parsed;
+ char *p, *pmax;
+
+ if (already_parsed == -1)
+ return -1;
+
+ if (already_parsed)
+ {
+	*fgp = fg;
+	*bgp = bg;
+	return 0;
+ }
+
+ already_parsed = -1;
+
+ bg = getenv ("COLORFGBG");
+
+ if (bg == NULL)
+ {
+	bg = getenv ("DEFAULT_COLORS");
+	if (bg == NULL)
+	 return -1;
+ }
+
+ p = fg_buf;
+ pmax = p + (sizeof (fg_buf) - 1);
+
+ while ((*bg != 0) && (*bg != ';'))
+ {
+	if (p < pmax) *p++ = *bg;
+	bg++;
+ }
+ *p = 0;
+
+ if (*bg) bg++;
+
+ p = bg_buf;
+ pmax = p + (sizeof (bg_buf) - 1);
+
+ /* Mark suggested allowing for extra application specific stuff following
+ * the background color. That is what the check for the semi-colon is for.
+ */
+ while ((*bg != 0) && (*bg != ';'))
+ {
+	if (p < pmax) *p++ = *bg;
+	bg++;
+ }
+ *p = 0;
+
+ if (!strcmp (fg_buf, "default") || !strcmp(bg_buf, "default"))
+ {
+	*fgp = *bgp = fg = bg = "default";
+ }
+ else
+ {
+	*fgp = fg = check_color_for_digit_form (fg_buf);
+	*bgp = bg = check_color_for_digit_form (bg_buf);
+ }
+ already_parsed = 1;
+ return 0;
+}
+
+static int Color_0_Modified = 0;
+
+int SLtt_set_color_object (int obj, SLtt_Char_Type attr)
+{
+ Brush_Info_Type *b;
+
+ if (NULL == (b = get_brush_info (obj)))
+ return -1;
+
+ b->fgbg = attr;
+ if (obj == 0) Color_0_Modified = 1;
+
+ if (_pSLtt_color_changed_hook != NULL)
+ (*_pSLtt_color_changed_hook)();
+
+ return 0;
+}
+
+SLtt_Char_Type SLtt_get_color_object (int obj)
+{
+ return get_brush_fgbg (obj);
+}
+
+int SLtt_add_color_attribute (int obj, SLtt_Char_Type attr)
+{
+ Brush_Info_Type *b;
+
+ if (NULL == (b = get_brush_info (obj)))
+ return -1;
+
+ b->fgbg |= (attr & ATTR_MASK);
+
+ if (obj == 0) Color_0_Modified = 1;
+ if (_pSLtt_color_changed_hook != NULL)
+ (*_pSLtt_color_changed_hook)();
+
+ return 0;
+}
+
+static SLtt_Char_Type fb_to_fgbg (SLtt_Char_Type f, SLtt_Char_Type b)
+{
+ SLtt_Char_Type attr;
+
+ if ((Max_Terminfo_Colors != 8)
+#if SLTT_HAS_TRUECOLOR_SUPPORT
+ || Has_True_Color
+#endif
+ )
+ {
+	if ((f != SLSMG_COLOR_DEFAULT) && (0 == IS_TRUE_COLOR(f)))
+	 f %= Max_Terminfo_Colors;
+	if ((b != SLSMG_COLOR_DEFAULT) && (0 == IS_TRUE_COLOR(b)))
+	 b %= Max_Terminfo_Colors;
+	return MAKE_COLOR(f,b);
+ }
+
+ /* Otherwise we have 8 ansi colors. Try to get bright versions
+ * by using the BOLD and BLINK attributes.
+ */
+
+ attr = 0;
+
+ /* Note: If f represents default, it will have the value 0xFF */
+ if (f != SLSMG_COLOR_DEFAULT)
+ {
+	if (f & 0x8) attr = SLTT_BOLD_MASK;
+	f &= 0x7;
+ }
+
+ if (b != SLSMG_COLOR_DEFAULT)
+ {
+	if (b & 0x8) attr |= SLTT_BLINK_MASK;
+	b &= 0x7;
+ }
+
+ return MAKE_COLOR(f,b) | attr;
+}
+
+#if SLTT_HAS_TRUECOLOR_SUPPORT
+static int parse_hex_digit (char ch)
+{
+ if (('0' <= ch) && (ch <= '9')) return ch - '0';
+ if (('A' <= ch) && (ch <= 'F')) return 10 + ch - 'A';
+ if (('a' <= ch) && (ch <= 'f')) return 10 + ch - 'a';
+ return -1;
+}
+
+static int parse_true_color (const char *color, SLtt_Char_Type *c)
+{
+ SLtt_Char_Type rgb;
+ unsigned int i;
+ int h6;
+
+ i = 0;
+ while (i < 6)
+ {
+	if (-1 == (hi = parse_hex_digit (colori)))
+	 return -1;
+	i++;
+ }
+ if (colori != 0)
+ return -1;
+
+ if (i == 3)			 /* RRGGBB */
+ rgb = (h0 << 20) | (h0 << 16) | (h1 << 12) | (h1 << 8) | (h2 << 4) | h2;
+ else if ((i == 6) && (colori == 0))
+ rgb = (h0 << 20) | (h1 << 16) | (h2 << 12) | (h3 << 8) | (h4 << 4) | h5;
+ else
+ return -1;
+
+ *c = rgb | TRUE_COLOR_BIT;
+ return 0;
+}
+#endif
+
+/* This looks for colors with name form 'colorN'. If color is of this
+ * form, N is passed back via parameter list.
+ */
+static int parse_color_digit_name (SLCONST char *color, SLtt_Char_Type *f)
+{
+ unsigned int i;
+
+#if SLTT_HAS_TRUECOLOR_SUPPORT
+ if (Has_True_Color && (color0 == '#'))
+ return parse_true_color (color+1, f);
+#endif
+
+ if (strncmp (color, "color", 5))
+ return -1;
+
+ color += 5;
+ if (*color == 0)
+ return -1;
+
+ i = 0;
+ while (1)
+ {
+	unsigned int j;
+	unsigned char ch;
+
+	ch = (unsigned char) *color++;
+	if (ch == 0)
+	 break;
+	if ((ch > '9') || (ch < '0'))
+	 return -1;
+
+	if (i > 0xFFFFFFFFU / 10)
+	 return -1;
+	j = (i *= 10);
+	i += (ch - '0');
+	if (i < j)
+	 return -1;
+ }
+
+ *f = (SLtt_Char_Type) i;
+ return 0;
+}
+
+/* Here whitespace is not allowed. That is, "blue;blink" is ok but
+ * "blue; blink" or "blue ;blink" are not.
+ */
+static int parse_color_and_attributes (SLCONST char *f, char *buf, size_t buflen, SLtt_Char_Type *attrp)
+{
+ SLCONST char *s;
+ unsigned int len;
+ SLtt_Char_Type a;
+
+ *attrp = a = 0;
+
+ s = strchr (f, ';');
+ if (s == NULL) return 0;
+
+ len = s - f;
+ if (len >= buflen) len = buflen-1;
+ strncpy (buf, f, len);
+ buflen = 0;
+
+ while ((*s == ';') || (*s == ' ') || (*s == '\t')) s++;
+ f = s;
+ while (*f)
+ {
+	s = strchr (f, ';');
+	if (s == NULL)
+	 s = f + strlen (f);
+
+	len = s - f;
+	if (len)
+	 {
+	 if (0 == strncmp (f, "italic", 6))
+	 a |= SLTT_ITALIC_MASK;
+	 else if (0 == strncmp (f, "blink", 5))
+	 a |= SLTT_BLINK_MASK;
+	 else if (0 == strncmp (f, "underline", 9))
+	 a |= SLTT_ULINE_MASK;
+	 else if (0 == strncmp (f, "bold", 4))
+	 a |= SLTT_BOLD_MASK;
+	 }
+	while ((*s == ';') || (*s == ' ') || (*s == '\t')) s++;
+	f = s;
+ }
+ *attrp = a;
+ return 1;
+}
+
+static int make_color_fgbg (SLCONST char *fg, SLCONST char *bg, SLtt_Char_Type *fgbg)
+{
+ SLtt_Char_Type f = INVALID_ATTR, b = INVALID_ATTR;
+ SLCONST char *dfg, *dbg;
+ unsigned int i;
+ char bgbuf16, fgbuf16;
+ SLtt_Char_Type fattr= 0, battr = 0;
+
+ if ((fg != NULL) && (*fg == 0)) fg = NULL;
+ if ((bg != NULL) && (*bg == 0)) bg = NULL;
+
+ if ((fg == NULL) || (bg == NULL))
+ {
+	if (-1 == get_default_colors (&dfg, &dbg))
+	 return -1;
+
+	if (fg == NULL) fg = dfg;
+	if (bg == NULL) bg = dbg;
+ }
+
+ if (1 == parse_color_and_attributes (fg, fgbuf, sizeof(fgbuf), &fattr))
+ fg = fgbuf;
+
+ if (-1 == parse_color_digit_name (fg, &f))
+ {
+	for (i = 0; i < MAX_COLOR_NAMES; i++)
+	 {
+	 if (strcmp(fg, Color_Defsi.name)) continue;
+	 f = Color_Defsi.color;
+	 break;
+	 }
+ }
+
+ if (1 == parse_color_and_attributes (bg, bgbuf, sizeof(bgbuf), &battr))
+ bg = bgbuf;
+
+ if (-1 == parse_color_digit_name (bg, &b))
+ {
+	for (i = 0; i < MAX_COLOR_NAMES; i++)
+	 {
+	 if (strcmp(bg, Color_Defsi.name)) continue;
+	 b = Color_Defsi.color;
+	 break;
+	 }
+ }
+
+ if ((f == INVALID_ATTR) || (b == INVALID_ATTR))
+ return -1;
+
+ *fgbg = fb_to_fgbg (f, b) | fattr | battr;
+ return 0;
+}
+
+static int tt_set_color (int obj, SLCONST char *what, SLCONST char *fg, SLCONST char *bg)
+{
+ SLtt_Char_Type fgbg;
+
+ (void) what;
+
+ if (-1 == make_color_fgbg (fg, bg, &fgbg))
+ return -1;
+
+ return SLtt_set_color_object (obj, fgbg);
+}
+
+int SLtt_set_color (int obj, SLFUTURE_CONST char *what, SLFUTURE_CONST char *fg, SLFUTURE_CONST char *bg)
+{
+ return tt_set_color (obj, what, fg, bg);
+}
+
+int SLtt_set_color_fgbg (int obj, SLtt_Char_Type f, SLtt_Char_Type b)
+{
+ return SLtt_set_color_object (obj, fb_to_fgbg (f, b));
+}
+
+void SLtt_set_alt_char_set (int i)
+{
+ static int last_i;
+ if (SLtt_Has_Alt_Charset == 0) return;
+
+ i = (i != 0);
+
+ if (i == last_i) return;
+ tt_write_string (i ? Start_Alt_Chars_Str : End_Alt_Chars_Str );
+ last_i = i;
+}
+
+#if SLTT_HAS_TRUECOLOR_SUPPORT
+# if defined(__GNUC__)
+# pragma GCC diagnostic ignored "-Wformat-nonliteral"
+# endif
+static void write_truecolor (const char *fmt, SLtt_Char_Type c)
+{
+ char tmpbuf32;
+ int r, g, b;
+
+ r = (int)((c>>16) & 0xFF);
+ g = (int)((c>>8) & 0xFF);
+ b = (int)(c & 0xFF);
+
+ sprintf (tmpbuf, fmt, r, g, b);
+ tt_write_string (tmpbuf);
+}
+# if defined(__GNUC__)
+# pragma GCC diagnostic warning "-Wformat-nonliteral"
+# endif
+#endif				 /* SLTT_HAS_TRUECOLOR_SUPPORT */
+
+static void write_attributes (SLtt_Char_Type fgbg)
+{
+ int unknown_attributes;
+
+ if (Worthless_Highlight) return;
+ if (fgbg == Current_Fgbg) return;
+
+ unknown_attributes = 0;
+
+ /* Before spitting out colors, fix attributes */
+ if ((fgbg & ATTR_MASK) != (Current_Fgbg & ATTR_MASK))
+ {
+	if (Current_Fgbg & ATTR_MASK)
+	 {
+	 tt_write_string(Norm_Vid_Str);
+	 /* In case normal video turns off ALL attributes: */
+	 if (fgbg & SLTT_ALTC_MASK)
+	 Current_Fgbg &= ~SLTT_ALTC_MASK;
+	 SLtt_set_alt_char_set (0);
+	 }
+
+	if ((fgbg & SLTT_ALTC_MASK)
+	 != (Current_Fgbg & SLTT_ALTC_MASK))
+	 {
+	 SLtt_set_alt_char_set ((int) (fgbg & SLTT_ALTC_MASK));
+	 }
+
+	if (fgbg & SLTT_ULINE_MASK) tt_write_string (UnderLine_Vid_Str);
+	if (fgbg & SLTT_BOLD_MASK) SLtt_bold_video ();
+	if (fgbg & SLTT_REV_MASK) tt_write_string (Rev_Vid_Str);
+	if (fgbg & SLTT_ITALIC_MASK) tt_write_string (Italic_Vid_Str);
+	if (fgbg & SLTT_BLINK_MASK)
+	 {
+	 /* Someday Linux will have a blink mode that set high intensity
+	 * background. Lets be prepared.
+	 */
+	 if (SLtt_Blink_Mode) tt_write_string (Blink_Vid_Str);
+	 }
+	unknown_attributes = 1;
+ }
+
+ if (SLtt_Use_Ansi_Colors)
+ {
+	int bg0, fg0;
+	fg0 = (int) GET_FG(fgbg);
+	bg0 = (int) GET_BG(fgbg);
+
+	if (unknown_attributes
+	 || (fg0 != (int)GET_FG(Current_Fgbg)))
+	 {
+	 if (fg0 == SLSMG_COLOR_DEFAULT)
+	 tt_write_string (Default_Color_Fg_Str);
+#if SLTT_HAS_TRUECOLOR_SUPPORT
+	 else if (IS_TRUE_COLOR(fg0))
+	 write_truecolor (Color_RGB_Fg_Str, fg0);
+#endif
+	 else
+	 tt_printf (Color_Fg_Str, COLOR_ARG(fg0, Is_Fg_BGR), 0);
+	 }
+
+	if (unknown_attributes
+	 || (bg0 != (int)GET_BG(Current_Fgbg)))
+	 {
+	 if (bg0 == SLSMG_COLOR_DEFAULT)
+	 tt_write_string (Default_Color_Bg_Str);
+#if SLTT_HAS_TRUECOLOR_SUPPORT
+	 else if (IS_TRUE_COLOR(bg0))
+	 write_truecolor (Color_RGB_Bg_Str, bg0);
+#endif
+	 else
+	 tt_printf (Color_Bg_Str, COLOR_ARG(bg0, Is_Bg_BGR), 0);
+	 }
+ }
+
+ Current_Fgbg = fgbg;
+}
+
+static int Video_Initialized;
+
+void SLtt_reverse_video (int color)
+{
+ SLtt_Char_Type fgbg;
+
+ if (Worthless_Highlight) return;
+
+ if (Video_Initialized == 0)
+ {
+	if (color == JNORMAL_COLOR)
+	 {
+	 tt_write_string (Norm_Vid_Str);
+	 }
+	else tt_write_string (Rev_Vid_Str);
+	Current_Fgbg = INVALID_ATTR;
+	return;
+ }
+
+ fgbg = get_brush_attr (color);
+
+ if (fgbg == Current_Fgbg) return;
+ write_attributes (fgbg);
+}
+
+void SLtt_normal_video (void)
+{
+ SLtt_reverse_video(JNORMAL_COLOR);
+}
+
+void SLtt_narrow_width (void)
+{
+ tt_write ("\033?3l", 5);
+}
+
+void SLtt_wide_width (void)
+{
+ tt_write ("\033?3h", 5);
+}
+
+/* Highest bit represents the character set. */
+#define COLOR_OF(a) ((a)->color & SLSMG_COLOR_MASK)
+
+static int bce_colors_eq (SLsmg_Color_Type ca, SLsmg_Color_Type cb, int just_bg)
+{
+ Brush_Info_Type *ba, *bb;
+
+ if (ca == cb)
+ return 1;
+
+ ba = get_brush_info (ca);
+ bb = get_brush_info (cb);
+
+ if (SLtt_Use_Ansi_Colors == 0)
+ return ba->mono == bb->mono;
+
+ if (Bce_Color_Offset)
+ {
+	/* If either are color 0, then we do not know what that means since the
+	 * terminal does not support BCE
+	 */
+	if ((ca == 0) || (cb == 0))
+	 return 0;
+	ba = get_brush_info (ca-1);
+	bb = get_brush_info (cb-1);
+ }
+
+ if (ba->fgbg == bb->fgbg)
+ return 1;
+ if (just_bg)
+ {
+	return (ba->mono == bb->mono)
+	 && GET_BG(ba->fgbg) == GET_BG(bb->fgbg);
+ }
+ return 0;
+}
+
+/* The whole point of this routine is to prevent writing to the last column
+ * and last row on terminals with automatic margins.
+ */
+static void write_string_with_care (SLCONST char *str)
+{
+ SLstrlen_Type len;
+
+ if (str == NULL) return;
+
+ len = strlen (str);
+ if (Automatic_Margins && (Cursor_r + 1 == SLtt_Screen_Rows))
+ {
+	if (_pSLtt_UTF8_Mode == 0)
+	 {
+	 if (len + (unsigned int) Cursor_c >= (unsigned int) SLtt_Screen_Cols)
+	 {
+	 /* For now, just do not write there. Later, something more
+	 * sophisticated will be implemented.
+	 */
+	 if (SLtt_Screen_Cols > Cursor_c)
+	 len = SLtt_Screen_Cols - Cursor_c - 1;
+	 else
+	 len = 0;
+	 }
+	 }
+ else
+	 {
+	 SLstrlen_Type nchars = SLutf8_strlen((SLuchar_Type *)str, 1);
+	 if (nchars + (unsigned int) Cursor_c >= (unsigned int) SLtt_Screen_Cols)
+	 {
+	 if (SLtt_Screen_Cols > Cursor_c)
+	 {
+		 char *p;
+		 nchars = (SLstrlen_Type)(SLtt_Screen_Cols - Cursor_c - 1);
+		 p = (char *)SLutf8_skip_chars((SLuchar_Type *) str, (SLuchar_Type *)(str + len), nchars, NULL, 1);
+		 len = p - str;
+		 }
+	 else
+		 len = 0;
+	 }
+	 }
+ }
+ tt_write (str, len);
+}
+
+static void send_attr_str (SLsmg_Char_Type *s, SLsmg_Char_Type *smax)
+{
+ unsigned char out1+SLUTF8_MAX_MBLEN*SLSMG_MAX_CHARS_PER_CELL*SLTT_MAX_SCREEN_COLS;
+ unsigned char *p, *pmax;
+ register SLtt_Char_Type attr;
+ SLsmg_Color_Type color, last_color = (SLsmg_Color_Type)-1;
+ int dcursor_c;
+
+ p = out;
+ pmax = p + (sizeof (out)-1);
+
+ if ((Cursor_c == 0)
+ && (Use_Relative_Cursor_Addressing)
+ && (Cursor_r < SLTT_MAX_SCREEN_ROWS))
+ {
+	if (s < smax)
+	 Display_Start_CharsCursor_r = *s;
+	else
+	 Display_Start_CharsCursor_r.nchars = 0;
+ }
+
+ dcursor_c = 0;
+ while (s < smax)
+ {
+	SLwchar_Type wch;
+	unsigned int nchars;
+
+	if (0 == (nchars = s->nchars))
+	 {
+	 /* 2nd element of a char that occupies two columns */
+	 s++;
+	 if (_pSLtt_UTF8_Mode == 0)
+	 *p++ = ' ';
+	 dcursor_c++;
+	 continue;
+	 }
+
+	color = s->color;
+
+#if SLTT_HAS_NON_BCE_SUPPORT
+	if (Bce_Color_Offset
+	 && (color >= Bce_Color_Offset))
+	 color -= Bce_Color_Offset;
+#endif
+
+	wch = s->wchars0;
+
+	if (color != last_color)
+	 {
+	 attr = get_brush_attr (color);
+
+	 if (color & SLSMG_ACS_MASK) /* alternate char set */
+	 {
+		 if (SLtt_Use_Blink_For_ACS)
+		 {
+		 if (SLtt_Blink_Mode) attr |= SLTT_BLINK_MASK;
+		 }
+		 else attr |= SLTT_ALTC_MASK;
+	 }
+
+	 if (attr != Current_Fgbg)
+	 {
+		 if ((wch != ' ')
+		 || (nchars > 1)
+		 /* it is a space so only consider it different if it
+		 * has different attributes.
+		 */
+		 || (attr != Current_Fgbg)
+		 )
+		 {
+		 if (p != out)
+			 {
+			 *p = 0;
+			 write_string_with_care ((char *) out);
+			 p = out;
+			 Cursor_c += dcursor_c;
+			 dcursor_c = 0;
+			 }
+		 write_attributes (attr);
+		 last_color = color;
+		 }
+	 }
+	 }
+
+	if ((wch < 0x80) && (nchars == 1))
+	 *p++ = (unsigned char) wch;
+	else if (_pSLtt_UTF8_Mode == 0)
+	 {
+	 if (wch > 255)
+	 wch = '?';
+	 else if (wch < (SLwchar_Type)SLsmg_Display_Eight_Bit)
+	 wch = '?';
+	 *p++ = (unsigned char) wch;
+	 }
+	else
+	 {
+	 unsigned int i;
+	 for (i = 0; i < nchars; i++)
+	 {
+		 if (NULL == (p = SLutf8_encode (s->wcharsi, p, pmax-p)))
+		 {
+		 fprintf (stderr, "*** send_attr_str: buffer too small\n");
+		 return;
+		 }
+	 }
+	 }
+	dcursor_c++;
+	s++;
+ }
+ *p = 0;
+ if (p != out) write_string_with_care ((char *) out);
+ Cursor_c += dcursor_c;
+}
+
+static void forward_cursor (unsigned int n, int row)
+{
+ char buf 1024;
+
+ /* if (Current_Fgbg & ~0xFF) */
+ /* { */
+ /* 	unsigned int num = 0; */
+ /* 	while (num < n) */
+ /* 	 { */
+ /* 	 write_string_with_care (" "); */
+ /* 	 num++; */
+ /* 	 } */
+ /* 	Cursor_c += n; */
+ /* 	return; */
+ /* } */
+
+ if (n <= 4)
+ {
+	SLtt_normal_video ();
+#if 0
+	if (n >= sizeof (buf))
+	 n = sizeof (buf) - 1;
+#endif
+	SLMEMSET (buf, ' ', n);
+	bufn = 0;
+	write_string_with_care (buf);
+	Cursor_c += n;
+ }
+ else if (Curs_RightN_Str != NULL)
+ {
+	Cursor_c += n;
+	n = tt_sprintf(buf, sizeof (buf), Curs_RightN_Str, (int) n, 0);
+	tt_write(buf, n);
+ }
+ else SLtt_goto_rc (row, (int) (Cursor_c + n));
+}
+
+/* FIXME!! If the terminal does not support color, then this route has
+ * problems of color object 0 has been assigned some monochrome attribute
+ * such as reverse video. In such a case, space_char=' ' is not a simple
+ * space character as is assumed below.
+ */
+
+#define COLORS_EQ(ca,cb) (((ca) == (cb)) || bce_colors_eq((ca), (cb), 0))
+#define BG_COLORS_EQ(ca,cb) (((ca) == (cb)) || (bce_colors_eq((ca),(cb),1)))
+
+#define COLORS_OF_EQ(a,b) COLORS_EQ(COLOR_OF(a),COLOR_OF(b))
+
+#define CHARSET(a) ((a)->color&SLSMG_ACS_MASK)
+#define CHAR_EQS(a, b) (((a)->nchars==(b)->nchars) \
+			 && (((a)->nchars == 0) \
+				 || ((((a)->wchars0==(b)->wchars0) \
+					 && (0 == memcmp((a)->wchars, (b)->wchars, (a)->nchars*sizeof(SLwchar_Type)))) \
+					 && (COLORS_OF_EQ(a,b)) \
+					 && (CHARSET(a)==CHARSET(b)))))
+
+#if 0
+# define CHAR_EQS_SPACE(a) \
+ (((a)->wchars0==' ') && ((a)->color==0) && ((a)->nchars==1))
+#else
+# define CHAR_EQS_SPACE(a) \
+ (((a)->wchars0==' ') && ((a)->nchars==1) \
+ && BG_COLORS_EQ(COLOR_OF(a),Bce_Color_Offset))
+#endif
+
+void SLtt_smart_puts(SLsmg_Char_Type *neww, SLsmg_Char_Type *oldd, int len, int row)
+{
+ register SLsmg_Char_Type *p, *q, *qmax, *pmax, *buf;
+ SLsmg_Char_Type bufferSLTT_MAX_SCREEN_COLS+1;
+ SLsmg_Char_Type *space_match, *last_buffered_match;
+#ifdef HP_GLITCH_CODE
+ int handle_hp_glitch = 0;
+#endif
+ SLsmg_Char_Type *space_char;
+ SLsmg_Char_Type space_char_buf;
+
+#define SLTT_USE_INSERT_HACK 1
+#if SLTT_USE_INSERT_HACK
+ SLsmg_Char_Type *insert_hack_prev = NULL;
+ SLsmg_Char_Type *insert_hack_char = NULL;
+
+ if ((row + 1 == SLtt_Screen_Rows)
+ && (len == SLtt_Screen_Cols)
+ && (len > 1)
+ && (SLtt_Term_Cannot_Insert == 0)
+ && Automatic_Margins)
+ {
+	SLsmg_Char_Type *a, *b;
+	insert_hack_char = &newwlen-1;
+
+	a = oldd+(len-1);
+	b = neww+(len-1);
+
+	if (CHAR_EQS(a,b))
+	 insert_hack_char = NULL;
+	else
+	 insert_hack_prev = &newwlen-2;
+ }
+#endif
+
+ memset ((char *) &space_char_buf, 0, sizeof (SLsmg_Char_Type));
+ space_char = &space_char_buf;
+ space_char->nchars = 1;
+ space_char->wchars0 = ' ';
+
+ if (len > SLTT_MAX_SCREEN_COLS)
+ len = SLTT_MAX_SCREEN_COLS;
+
+ q = oldd; p = neww;
+ qmax = oldd + len;
+ pmax = p + len;
+
+ /* Find out where to begin --- while they match, we are ok */
+ while (1)
+ {
+	if (q == qmax) return;
+#if SLANG_HAS_KANJI_SUPPORT
+# undef SLANG_HAS_KANJI_SUPPORT
+# define SLANG_HAS_KANJI_SUPPORT 0
+#endif
+#if SLANG_HAS_KANJI_SUPPORT
+	if (*p & 0x80)
+	 { /* new is kanji */
+	 if ((*q & 0x80) && ((q + 1) < qmax))
+	 { /* old is also kanji */
+		 if (((0xFF & *q) != (0xFF & *p))
+		 || ((0xFF & q1) != (0xFF & p1)))
+		 break; /* both kanji, but not match */
+
+		 else
+		 { /* kanji match ! */
+		 if (!COLORS_OF_EQ(*q, *p)) break;
+		 q++; p++;
+		 if (!COLORS_OF_EQ(*q, *p)) break;
+		 /* really match! */
+		 q++; p++;
+		 continue;
+		 }
+	 }
+	 else break; /* old is not kanji */
+	 }
+	else
+	 { /* new is not kanji */
+	 if (*q & 0x80) break; /* old is kanji */
+	 }
+#endif
+	if (!CHAR_EQS(q, p)) break;
+	q++; p++;
+ }
+
+#ifdef HP_GLITCH_CODE
+ if (Has_HP_Glitch)
+ {
+	SLsmg_Char_Type *qq = q;
+
+	SLtt_goto_rc (row, (int) (p - neww));
+
+	while (qq < qmax)
+	 {
+	 if (qq->color)
+	 {
+		 SLtt_normal_video ();
+		 SLtt_del_eol ();
+		 qmax = q;
+		 handle_hp_glitch = 1;
+		 break;
+	 }
+	 qq++;
+	 }
+ }
+#endif
+ /* Find where the last non-blank character on old/new screen is */
+
+ /* if (CHAR_EQS_SPACE(pmax-1)) */
+ if (((pmax-1)->wchars0==' ') && ((pmax-1)->nchars==1))
+ {
+	/* If we get here, then we can erase to the end of the line to create
+	 * the final space. However, this will only work _if_ erasing will
+	 * get us the correct color. If the terminal supports BCE, then this
+	 * is easy. If it does not, then we can only perform this operation
+	 * if the color is known via something like COLORFGBG. For now,
+	 * I just will not perform the optimization for such terminals.
+	 */
+	if (Can_Background_Color_Erase
+	 && SLtt_Use_Ansi_Colors)
+	 {
+	 SLtt_Char_Type fgbg;
+
+	 fgbg = get_brush_attr (COLOR_OF(pmax-1));
+	 if (0 == (fgbg & ATTR_MASK))
+	 space_char = pmax - 1;
+	 }
+
+	while (pmax > p)
+	 {
+	 pmax--;
+	 if (!CHAR_EQS(pmax, space_char))
+	 {
+		 pmax++;
+		 break;
+	 }
+	 }
+ }
+
+ while (qmax > q)
+ {
+	qmax--;
+	if (!CHAR_EQS(qmax, space_char))
+	 {
+	 qmax++;
+	 break;
+	 }
+ }
+
+ last_buffered_match = buf = buffer;		 /* buffer is empty */
+
+#ifdef HP_GLITCH_CODE
+ if (handle_hp_glitch)
+ {
+	while (p < pmax)
+	 {
+	 *buf++ = *p++;
+	 }
+ }
+#endif
+
+#ifdef HP_GLITCH_CODE
+ if (Has_HP_Glitch == 0)
+ {
+#endif
+	/* Try use use erase to bol if possible */
+	if ((Del_Bol_Str != NULL) && (CHAR_EQS_SPACE(neww)))
+	 {
+	 SLsmg_Char_Type *p1;
+	 SLsmg_Color_Type blank_color = 0;
+
+	 p1 = neww;
+	 if ((Can_Background_Color_Erase)
+		 && SLtt_Use_Ansi_Colors)
+	 {
+		 SLsmg_Char_Type *blank = p1;
+		 blank_color = COLOR_OF(blank);
+		 while ((p1 < pmax) && (CHAR_EQS (p1, blank)))
+		 p1++;
+	 }
+	 else
+	 {
+		 /* black+white attributes do not support bce */
+		 while ((p1 < pmax) && (CHAR_EQS_SPACE (p1)))
+		 p1++;
+	 }
+
+	 /* Is this optimization worth it? Assume Del_Bol_Str is ESC 1 K
+	 * It costs 4 chars + the space needed to properly position the
+	 * cursor, e.g., ESC 10;10H. So, it costs at least 13 characters.
+	 */
+	 if ((p1 > neww + 13)
+		 && (p1 >= p)
+		 /* Avoid erasing from the end of the line */
+		 && ((p1 != pmax) || (pmax < neww + len)))
+	 {
+		 int ofs = (int) (p1 - neww);
+		 q = oldd + ofs;
+		 p = p1;
+		 SLtt_goto_rc (row, ofs - 1);
+		 SLtt_reverse_video (blank_color);
+		 tt_write_string (Del_Bol_Str);
+		 tt_write (" ", 1);
+		 Cursor_c += 1;
+	 }
+	 else
+	 SLtt_goto_rc (row, (int) (p - neww));
+	 }
+	else
+	 SLtt_goto_rc (row, (int) (p - neww));
+#ifdef HP_GLITCH_CODE
+ }
+#endif
+
+ /* loop using overwrite then skip algorithm until done */
+ while (1)
+ {
+	/* while they do not match and we do not hit a space, buffer them up */
+	unsigned int n_spaces = 0;
+	while (p < pmax)
+	 {
+	 if (CHAR_EQS_SPACE(q) && CHAR_EQS_SPACE(p))
+	 {
+		 /* If *q is not a space, we would have to overwrite it.
+		 * However, if *q is a space, then while *p is also one,
+		 * we only need to skip over the blank field.
+		 */
+		 space_match = p;
+		 p++; q++;
+		 while ((p < pmax)
+			 && CHAR_EQS_SPACE(q)
+			 && CHAR_EQS_SPACE(p))
+		 {
+		 p++;
+		 q++;
+		 }
+		 n_spaces = (unsigned int) (p - space_match);
+		 break;
+	 }
+#if SLANG_HAS_KANJI_SUPPORT
+	 if ((*p & 0x80) && ((p + 1) < pmax))
+	 { /* new is kanji */
+		 if (*q & 0x80)
+		 { /* old is also kanji */
+		 if (((0xFF & *q) != (0xFF & *p))
+			 || ((0xFF & q1) != (0xFF & p1)))
+			 {
+			 /* both kanji, but not match */
+			 *buf++ = *p++;
+			 *buf++ = *p++;
+			 q += 2;
+			 continue;
+			 }
+		 else
+			 { /* kanji match ? */
+			 if (!COLORS_OF_EQ(*q, *p) || !COLORS_OF_EQ(*(q+1), *(p+1)))
+			 {
+				 /* code is match, but color is diff */
+				 *buf++ = *p++;
+				 *buf++ = *p++;
+				 q += 2;
+				 continue;
+			 }
+			 /* really match ! */
+			 break;
+			 }
+		 }
+ 		 else
+		 { /* old is not kanji */
+		 *buf++ = *p++;
+		 *buf++ = *p++;
+		 q += 2;
+		 continue;
+		 }
+	 }
+	 else
+	 { /* new is not kanji */
+ 		 if (*q & 0x80)
+		 { /* old is kanji */
+		 *buf++ = *p++;
+		 q++;
+		 continue;
+		 }
+	 }
+#endif
+
+	 if (CHAR_EQS(q, p))
+	 {
+		 /* Could be the second half of a double width character */
+		 if (p->nchars || q->nchars)
+		 break;
+	 }
+	 *buf++ = *p++;
+	 q++;
+	 }
+
+	/* At this point, the buffer contains characters that do not match */
+	if (buf != buffer) send_attr_str (buffer, buf);
+	buf = buffer;
+
+	if (n_spaces
+	 && ((p < pmax) 	 /* erase to eol will achieve this effect*/
+		|| (!CHAR_EQS_SPACE(space_char))))/* unless space_char is not a simple space */
+	 {
+	 forward_cursor (n_spaces, row);
+	 }
+	/* Now we overwrote what we could and cursor is placed at position
+	 * of a possible match of new and old. If this is the case, skip
+	 * some more.
+	 */
+
+	/* Note that from here on, the buffer will contain matched characters */
+#if !SLANG_HAS_KANJI_SUPPORT
+	while ((p < pmax) && CHAR_EQS(p, q))
+	 {
+	 *buf++ = *p++;
+	 q++;
+	 }
+#else
+	/* Kanji */
+	while (p < pmax)
+	 {
+	 if ((*p & 0x80) && ((p + 1) < pmax))
+	 { /* new is kanji */
+		 if (*q & 0x80)
+		 { /* old is also kanji */
+		 if (((0xFF & *q) == (0xFF & *p))
+			 && ((0xFF & q1) == (0xFF & p1)))
+			 {
+			 /* kanji match ? */
+			 if (!COLORS_OF_EQ(*q, *p)
+				|| !COLORS_OF_EQ(q1, p1))
+			 break;
+
+			 *buf++ = *p++;
+			 q++;
+			 if (p >= pmax)
+			 {
+				 *buf++ = 32;
+				 p++;
+				 break;
+			 }
+			 else
+			 {
+				 *buf++ = *p++;
+				 q++;
+				 continue;
+			 }
+			 }
+		 else break; /* both kanji, but not match */
+		 }
+		 else break; /* old is not kanji */
+	 }
+	 else
+	 { /* new is not kanji */
+		 if (*q & 0x80) break; /* old is kanji */
+		 if (!CHAR_EQS(*q, *p)) break;
+		 *buf++ = *p++;
+		 q++;
+	 }
+	 }
+#endif
+	last_buffered_match = buf;
+	if (p >= pmax) break;
+
+	/* jump to new position is it is greater than 5 otherwise
+	 * let it sit in the buffer and output it later.
+	 */
+	if ((int) (buf - buffer) >= 5)
+	 {
+	 forward_cursor ((unsigned int) (buf - buffer), row);
+	 last_buffered_match = buf = buffer;
+	 }
+ }
+
+ /* At this point we have reached the end of the new string with the
+ * exception of space_chars hanging off the end of it, but we may not have
+ * reached the end of the old string if they did not match.
+ */
+
+ /* Here the buffer will consist only of characters that have matched */
+ if (buf != buffer)
+ {
+	if (q < qmax)
+	 {
+	 if ((buf == last_buffered_match)
+		 && ((int) (buf - buffer) >= 5))
+	 {
+		 forward_cursor ((unsigned int) (buf - buffer), row);
+	 }
+	 else
+	 {
+		 send_attr_str (buffer, buf);
+	 }
+	 }
+ }
+
+ if (q < qmax)
+ {
+	SLtt_reverse_video (COLOR_OF(space_char));
+	del_eol ();
+ }
+
+#if SLTT_USE_INSERT_HACK
+ else if (insert_hack_char != NULL)
+ {
+	SLtt_goto_rc (SLtt_Screen_Rows-1, SLtt_Screen_Cols-2);
+	send_attr_str (insert_hack_char, insert_hack_char+1);
+	SLtt_goto_rc (SLtt_Screen_Rows-1, SLtt_Screen_Cols-2);
+	SLtt_begin_insert ();
+	send_attr_str (insert_hack_prev, insert_hack_prev+1);
+	SLtt_end_insert ();
+ }
+#endif
+
+ if (Cursor_c >= SLtt_Screen_Cols)
+ {
+	if (Use_Relative_Cursor_Addressing)
+	 {
+	 /* Where is the cursor? If we have automatic margins, then the
+	 * cursor _may_ be at the beginning of the next row. But, it may
+	 * not if the terminal permits writing to the LR corner without
+	 * scrolling. In relative-cursor-addressing mode, we do not know.
+	 *
+	 * The trick is to force the cursor to the next line if
+	 * it is at the end of the current line, or if it is at
+	 * the beginning of the next do nothing to change that line.
+	 * The only thing I can think of is to write the character that
+	 * is already there.
+	 */
+	 Cursor_c = 0;
+	 Cursor_r++;
+	 if (Cursor_r < SLTT_MAX_SCREEN_ROWS)
+	 {
+		 SLsmg_Char_Type *c = Display_Start_Chars + Cursor_r;
+		 if (c->nchars)
+		 send_attr_str (c, c+1);
+		 else
+		 tt_write (" ", 1);
+	 }
+	 else
+	 tt_write (" ", 1);
+	 tt_write ("\r", 1);
+	 Cursor_c =0;
+	 }
+	else if (Automatic_Margins)
+	 Cursor_Set = 0;
+ }
+}
+
+static void get_color_info (void)
+{
+ SLCONST char *fg, *bg;
+ char *ct;
+
+ ct = getenv ("COLORTERM");
+
+ if (ct != NULL)
+ {
+	/* Allow easy mechanism to override inadequate termcap/terminfo files. */
+	SLtt_Use_Ansi_Colors = 1;
+#if SLTT_HAS_TRUECOLOR_SUPPORT
+	if ((0 == strcmp(ct, "truecolor")) || (0 == strcmp(ct, "24bit")))
+	 Has_True_Color = 1;
+#endif
+ }
+
+ if (SLtt_Use_Ansi_Colors)
+ Is_Color_Terminal = 1;
+
+#if SLTT_HAS_NON_BCE_SUPPORT
+ if (Can_Background_Color_Erase == 0)
+ Can_Background_Color_Erase = (NULL != getenv ("COLORTERM_BCE"));
+#endif
+
+ /* terminfo does not support truecolor */
+
+ if (-1 == get_default_colors (&fg, &bg))
+ return;
+
+ /* Check to see if application has already set them. */
+ if (Color_0_Modified)
+ return;
+
+ tt_set_color (0, NULL, fg, bg);
+ tt_set_color (1, NULL, bg, fg);
+}
+
+/* termcap stuff */
+
+#ifdef __unix__
+
+static int Termcap_Initialized = 0;
+
+/* #define USE_TERMCAP 1 */
+#ifdef USE_TERMCAP
+/* Termcap based system */
+static char Termcap_Buf4096;
+/* static char Termcap_String_Buf4096; */
+/* static char *Termcap_String_Ptr; */
+extern char *tgetstr(char *, char **);
+extern int tgetent(char *, char *);
+extern int tgetnum(char *);
+extern int tgetflag(char *);
+#else
+/* Terminfo */
+static SLterminfo_Type *Terminfo;
+#endif
+
+#define TGETFLAG(x) (tt_tgetflag(x) > 0)
+
+static char *fixup_tgetstr (char *what)
+{
+ register char *w, *w1;
+ char *wsave;
+
+ if (what == NULL)
+ return NULL;
+
+ /* Check for AIX brain-damage */
+ if (*what == '@')
+ return NULL;
+
+ /* lose pad info --- with today's technology, term is a loser if
+ it is really needed */
+ while ((*what == '.') ||
+	 ((*what >= '0') && (*what <= '9'))) what++;
+ if (*what == '*') what++;
+
+ /* lose terminfo padding--- looks like $<...> */
+ w = what;
+ while (*w) if ((*w++ == '$') && (*w == '<'))
+ {
+	w1 = w - 1;
+	while (*w && (*w != '>')) w++;
+	if (*w == 0) break;
+	w++;
+	wsave = w1;
+	while ((*w1++ = *w++) != 0)
+	 ;
+	w = wsave;
+ }
+
+ if (*what == 0) what = NULL;
+ return what;
+}
+
+static char *tt_tgetstr (SLCONST char *cap)
+{
+ char *s;
+#ifdef USE_TERMCAP
+ char area_buf4096;
+ char *area;
+#endif
+ if (Termcap_Initialized == 0)
+ return NULL;
+
+#ifdef USE_TERMCAP
+ /* tmp_area = &Termcap_String_Buf; */
+ area = area_buf;
+ s = tgetstr (cap, &area);
+ if (area > area_buf + sizeof(area_buf))
+ {
+	SLang_exit_error ("\
+The termcap tgetstr appears to have overflowed a buffer.\n\
+The integrity of this program has been violated.\n");
+ }
+#else
+ s = _pSLtt_tigetstr (Terminfo, cap);
+#endif
+
+ /* Do not strip pad info for alternate character set. I need to make
+ * this more general.
+ */
+ /* FIXME: Priority=low; */
+ if (0 != strcmp (cap, "ac"))
+ s = fixup_tgetstr (s);
+
+#ifdef USE_TERMCAP
+ if ((s >= area_buf) && (s < area_buf + sizeof(area_buf)))
+ {
+	/* It looks like tgetstr placed the object in the buffer and
+	 * returned a pointer to that buffer. So, we have to make a
+	 * copy of it.
+	 *
+	 * Yes, this introduces a leak...
+	 */
+	s = SLmake_string (s);
+ }
+#endif
+ return s;
+}
+
+char *SLtt_tgetstr (SLFUTURE_CONST char *cap)
+{
+ return tt_tgetstr (cap);
+}
+
+static int tt_tgetnum (SLCONST char *s)
+{
+ if (Termcap_Initialized == 0)
+ return -1;
+#ifdef USE_TERMCAP
+ return tgetnum (s);
+#else
+ return _pSLtt_tigetnum (Terminfo, s);
+#endif
+}
+
+int SLtt_tgetnum (SLFUTURE_CONST char *s)
+{
+ return tt_tgetnum (s);
+}
+
+static int tt_tgetflag (SLCONST char *s)
+{
+ if (Termcap_Initialized == 0)
+ return -1;
+#ifdef USE_TERMCAP
+ return tgetflag (s);
+#else
+ return _pSLtt_tigetflag (Terminfo, s);
+#endif
+}
+
+int SLtt_tgetflag (SLFUTURE_CONST char *s)
+{
+ return tt_tgetflag (s);
+}
+
+int SLtt_tgetent(char *term)
+{
+ return 0 == SLtt_initialize(term);
+}
+
+int SLtt_tputs(char *str, int affcnt, int (*p)(int))
+{
+ (void) affcnt;
+ while (*str) (*p)(*str++);
+ return 0;
+}
+
+char *SLtt_tgoto (char *cap, int col, int row)
+{
+ static char buf64;
+ /* beware of overflows. 2^64 is 20 bytes printed */
+ if (strlen(cap) > 23)
+ strcpy(buf, "capability too long");
+ else
+ tt_sprintf(buf, sizeof(buf), cap, row, col);
+ return buf;
+}
+
+static int Vt100_Like = 0;
+
+void SLtt_get_terminfo (void)
+{
+ char *term;
+ int status;
+
+ term = getenv ("TERM");
+ if (term == NULL)
+ SLang_exit_error("%s", "TERM environment variable needs set.");
+
+ if (0 == (status = SLtt_initialize (term)))
+ return;
+
+ if (status == -1)
+ {
+	SLang_exit_error ("Unknown terminal: %s\n\
+Check the TERM environment variable.\n\
+Also make sure that the terminal is defined in the terminfo database.\n\
+Alternatively, set the TERMCAP environment variable to the desired\n\
+termcap entry.",
+			 term);
+ }
+
+ if (status == -2)
+ {
+	SLang_exit_error ("\
+Your terminal lacks the ability to clear the screen or position the cursor.\n");
+ }
+}
+
+/* Returns 0 if all goes well, -1 if terminal capabilities cannot be deduced,
+ * or -2 if terminal cannot position the cursor.
+ */
+int SLtt_initialize (SLFUTURE_CONST char *term)
+{
+ SLCONST char *t;
+ char ch;
+ int is_xterm;
+ int almost_vtxxx;
+
+ if (_pSLtt_UTF8_Mode == -1)
+ _pSLtt_UTF8_Mode = _pSLutf8_mode;
+
+ if (SLang_TT_Write_FD == -1)
+ {
+	/* Apparantly, this cannot fail according to the man pages. */
+	SLang_TT_Write_FD = fileno (stdout);
+ }
+
+ if (term == NULL)
+ {
+	term = getenv ("TERM");
+	if (term == NULL)
+	 return -1;
+ }
+
+ if (_pSLsecure_issetugid ()
+ && ((term0 == '.') || (NULL != strchr(term, '/'))))
+ return -1;
+
+ Linux_Console = (!strncmp (term, "linux", 5)
+# ifdef linux
+		 || !strncmp(term, "con", 3)
+# endif
+		 );
+
+ t = term;
+
+ if (strcmp(t, "vt52") && (*t++ == 'v') && (*t++ == 't')
+ && (ch = *t, (ch >= '1') && (ch <= '9'))) Vt100_Like = 1;
+
+ is_xterm = ((0 == strncmp (term, "xterm", 5))
+	 || (0 == strncmp (term, "rxvt", 4))
+	 || (0 == strncmp (term, "Eterm", 5)));
+
+ almost_vtxxx = (Vt100_Like
+		 || Linux_Console
+		 || is_xterm
+		 || !strcmp (term, "screen"));
+
+# ifndef USE_TERMCAP
+ if (Terminfo != NULL)
+ _pSLtt_tifreeent (Terminfo);
+
+ Termcap_Initialized = 0;	 /* resetting things */
+
+ if (NULL == (Terminfo = _pSLtt_tigetent (term)))
+ {
+	if (almost_vtxxx) /* Special cases. */
+	 {
+	 int vt102 = 1;
+	 if (!strcmp (term, "vt100")) vt102 = 0;
+	 get_color_info ();
+ 	 SLtt_set_term_vtxxx (&vt102);
+	 (void) SLtt_get_screen_size ();
+	 return 0;
+	 }
+	return -1;
+ }
+# else				 /* USE_TERMCAP */
+ if (1 != tgetent(Termcap_Buf, term))
+ return -1;
+ /* Termcap_String_Ptr = Termcap_String_Buf; */
+# endif				 /* NOT USE_TERMCAP */
+
+ Termcap_Initialized = 1;
+
+ Cls_Str = tt_tgetstr ("cl");
+ Abs_Curs_Pos_Str = tt_tgetstr ("cm");
+
+ if ((NULL == (Ins_Mode_Str = tt_tgetstr("im")))
+ || ( NULL == (Eins_Mode_Str = tt_tgetstr("ei")))
+ || ( NULL == (Del_Char_Str = tt_tgetstr("dc"))))
+ SLtt_Term_Cannot_Insert = 1;
+
+ Visible_Bell_Str = tt_tgetstr ("vb");
+
+ Curs_Up_Str = tt_tgetstr ("up");
+ Curs_UpN_Str = tt_tgetstr ("UP");
+
+ /* Avoid \n for moving down because we cannot rely upon the resulting column */
+ Curs_Dn_Str = tt_tgetstr ("do");
+ if ((Curs_Dn_Str != NULL) && (*Curs_Dn_Str == '\n'))
+ Curs_Dn_Str = NULL;
+
+ Curs_DnN_Str = tt_tgetstr ("DO");
+ Curs_Left_Str = tt_tgetstr ("le");
+ if (Curs_Left_Str == NULL)
+ {
+	Curs_Left_Str = tt_tgetstr ("bc");
+	if (Curs_Left_Str == NULL)
+	 Curs_Left_Str = "\b";
+ }
+ Curs_LeftN_Str = tt_tgetstr ("LE");
+ Curs_Right_Str = tt_tgetstr ("nd");
+ Curs_RightN_Str = tt_tgetstr ("RI");
+ Clear_EOS_Str = tt_tgetstr ("cd");
+
+ Rev_Scroll_Str = tt_tgetstr("sr");
+ Del_N_Lines_Str = tt_tgetstr("DL");
+ Add_N_Lines_Str = tt_tgetstr("AL");
+
+ /* Actually these are used to initialize terminals that use cursor
+ * addressing. Hard to believe.
+ */
+ Start_Abs_Cursor_Addressing_Mode = tt_tgetstr ("ti");
+ End_Abs_Cursor_Addressing_Mode = tt_tgetstr ("te");
+
+ /* If I do this for vtxxx terminals, arrow keys start sending ESC O A,
+ * which I do not want. This is mainly for HP terminals.
+ */
+ Keypad_Init_Str = tt_tgetstr ("ks");
+ Keypad_Reset_Str = tt_tgetstr ("ke");
+ if ((almost_vtxxx == 0) && (SLtt_Force_Keypad_Init == -1))
+ SLtt_Force_Keypad_Init = 1;
+
+ /* Make up for defective termcap/terminfo databases */
+ if ((Vt100_Like && (term2 != '1'))
+ || Linux_Console
+ || is_xterm
+ )
+ {
+	if (Del_N_Lines_Str == NULL) Del_N_Lines_Str = "\033%dM";
+	if (Add_N_Lines_Str == NULL) Add_N_Lines_Str = "\033%dL";
+ }
+
+ Scroll_R_Str = tt_tgetstr("cs");
+
+ SLtt_get_screen_size ();
+
+ if ((Scroll_R_Str == NULL)
+ || (((NULL == Del_N_Lines_Str) || (NULL == Add_N_Lines_Str))
+	 && (NULL == Rev_Scroll_Str)))
+ {
+	if (is_xterm
+	 || Linux_Console
+	 )
+	 {
+	 /* Defective termcap mode!!!! */
+	 SLtt_set_term_vtxxx (NULL);
+	 }
+	else SLtt_Term_Cannot_Scroll = 1;
+ }
+
+ Del_Eol_Str = tt_tgetstr("ce");
+ Del_Bol_Str = tt_tgetstr("cb");
+ if (is_xterm && (Del_Bol_Str == NULL))
+ Del_Bol_Str = "\0331K";
+ if (is_xterm && (Del_Eol_Str == NULL))
+ Del_Eol_Str = "\033K";
+
+ Rev_Vid_Str = tt_tgetstr("mr");
+ if (Rev_Vid_Str == NULL) Rev_Vid_Str = tt_tgetstr("so");
+
+ Bold_Vid_Str = tt_tgetstr("md");
+
+ /* Although xterm cannot blink, it does display the blinking characters
+ * as bold ones. Some Rxvt will display the background as high intensity.
+ */
+ if ((NULL == (Blink_Vid_Str = tt_tgetstr("mb")))
+ && is_xterm)
+ Blink_Vid_Str = "\0335m";
+
+ UnderLine_Vid_Str = tt_tgetstr("us");
+ Italic_Vid_Str = "\0333m";
+
+ Start_Alt_Chars_Str = tt_tgetstr ("as"); /* smacs */
+ End_Alt_Chars_Str = tt_tgetstr ("ae"); /* rmacs */
+ Enable_Alt_Char_Set = tt_tgetstr ("eA"); /* enacs */
+ SLtt_Graphics_Char_Pairs = tt_tgetstr ("ac");
+
+ if (NULL == SLtt_Graphics_Char_Pairs)
+ {
+	/* make up for defective termcap/terminfo */
+	if (Vt100_Like)
+	 {
+	 Start_Alt_Chars_Str = "\016";
+	 End_Alt_Chars_Str = "\017";
+	 Enable_Alt_Char_Set = "\033)0";
+	 }
+ }
+
+ /* aixterm added by willi */
+ if (is_xterm || !strncmp (term, "aixterm", 7))
+ {
+#if 0
+	Start_Alt_Chars_Str = "\016";
+	End_Alt_Chars_Str = "\017";
+	Enable_Alt_Char_Set = "\033(B\033)0";
+#else
+	Start_Alt_Chars_Str = "\033(0";
+	End_Alt_Chars_Str = "\033(B";
+	Enable_Alt_Char_Set = "";
+#endif
+ }
+
+ if ((SLtt_Graphics_Char_Pairs == NULL) &&
+ ((Start_Alt_Chars_Str == NULL) || (End_Alt_Chars_Str == NULL)))
+ {
+	SLtt_Has_Alt_Charset = 0;
+	Enable_Alt_Char_Set = NULL;
+ }
+ else SLtt_Has_Alt_Charset = 1;
+
+#ifdef AMIGA
+ Enable_Alt_Char_Set = Start_Alt_Chars_Str = End_Alt_Chars_Str = NULL;
+#endif
+
+ /* status line capabilities */
+ if ((SLtt_Has_Status_Line == -1)
+ && (0 != (SLtt_Has_Status_Line = TGETFLAG ("hs"))))
+ {
+	Disable_Status_line_Str = tt_tgetstr ("ds");
+	Return_From_Status_Line_Str = tt_tgetstr ("fs");
+	Goto_Status_Line_Str = tt_tgetstr ("ts");
+	/* Status_Line_Esc_Ok = TGETFLAG("es"); */
+	/* Num_Status_Line_Columns = tt_tgetnum ("ws"); */
+	/* if (Num_Status_Line_Columns < 0) Num_Status_Line_Columns = 0; */
+ }
+
+ if (NULL == (Norm_Vid_Str = tt_tgetstr("me")))
+ {
+	Norm_Vid_Str = tt_tgetstr("se");
+ }
+
+ Cursor_Invisible_Str = tt_tgetstr("vi");
+ Cursor_Visible_Str = tt_tgetstr("ve");
+
+ Automatic_Margins = TGETFLAG ("am");
+ /* No_Move_In_Standout = !TGETFLAG ("ms"); */
+# ifdef HP_GLITCH_CODE
+ Has_HP_Glitch = TGETFLAG ("xs");
+# else
+ Worthless_Highlight = TGETFLAG ("xs");
+# endif
+
+ if (Worthless_Highlight == 0)
+ {				 /* Magic cookie glitch */
+	Worthless_Highlight = (tt_tgetnum ("sg") > 0);
+ }
+
+ if (Worthless_Highlight)
+ SLtt_Has_Alt_Charset = 0;
+
+ Reset_Color_String = tt_tgetstr ("op");
+
+ /* Apparantly the difference between "AF" and "Sf" is that AF uses RGB,
+ * but Sf uses BGR.
+ */
+ Color_Fg_Str = tt_tgetstr ("AF"); /* ANSI setaf */
+ if (Color_Fg_Str == NULL)
+ {
+	Color_Fg_Str = tt_tgetstr ("Sf"); /* setf */
+	Is_Fg_BGR = (Color_Fg_Str != NULL);
+ }
+ Color_Bg_Str = tt_tgetstr ("AB"); /* ANSI setbf */
+ if (Color_Bg_Str == NULL)
+ {
+	Color_Bg_Str = tt_tgetstr ("Sb"); /* setb */
+	Is_Bg_BGR = (Color_Bg_Str != NULL);
+ }
+
+ if ((Max_Terminfo_Colors = tt_tgetnum ("Co")) < 0)
+ Max_Terminfo_Colors = 8;
+
+ if ((Color_Bg_Str != NULL) && (Color_Fg_Str != NULL))
+ SLtt_Use_Ansi_Colors = 1;
+ else
+ {
+#if 0
+	Color_Fg_Str = "%?%p1%{7}%>%t\0331;3%p1%{8}%m%dm%e\0333%p1%dm%;";
+	Color_Bg_Str = "%?%p1%{7}%>%t\0335;4%p1%{8}%m%dm%e\0334%p1%dm%;";
+	Max_Terminfo_Colors = 16;
+#else
+	Color_Fg_Str = "\0333%dm";
+	Color_Bg_Str = "\0334%dm";
+	Max_Terminfo_Colors = 8;
+#endif
+ }
+
+#if SLTT_HAS_NON_BCE_SUPPORT
+ Can_Background_Color_Erase = TGETFLAG ("ut"); /* bce */
+ /* Modern xterms have the BCE capability as well as the linux console */
+ if (Can_Background_Color_Erase == 0)
+ {
+	Can_Background_Color_Erase = (Linux_Console
+# if SLTT_XTERM_ALWAYS_BCE
+				 || is_xterm
+# endif
+				 );
+ }
+#endif
+ get_color_info ();
+
+ TT_Is_Initialized = 1;
+
+ if ((Cls_Str == NULL)
+ || (Abs_Curs_Pos_Str == NULL))
+ return -2;
+
+ return 0;
+}
+#endif
+/* Unix */
+
+/* specific to vtxxx only */
+void SLtt_enable_cursor_keys (void)
+{
+#ifdef __unix__
+ if (Vt100_Like)
+#endif
+ tt_write_string("\033=\033?1l");
+}
+
+#ifdef VMS
+int SLtt_initialize (char *term)
+{
+ SLtt_get_terminfo ();
+ TT_Is_Initialized = 1;
+ return 0;
+}
+
+void SLtt_get_terminfo ()
+{
+ int zero = 0;
+
+ /* Apparantly, this cannot fail according to the man pages. */
+ if (SLang_TT_Write_FD == -1)
+ SLang_TT_Write_FD = fileno (stdout);
+
+ Can_Background_Color_Erase = 0;
+
+ Color_Fg_Str = "\0333%dm";
+ Color_Bg_Str = "\0334%dm";
+ Max_Terminfo_Colors = 8;
+
+ get_color_info ();
+
+ SLtt_set_term_vtxxx(&zero);
+ Start_Alt_Chars_Str = "\016";
+ End_Alt_Chars_Str = "\017";
+ SLtt_Has_Alt_Charset = 1;
+ SLtt_Graphics_Char_Pairs = "aaffgghhjjkkllmmnnooqqssttuuvvwwxx";
+ Enable_Alt_Char_Set = "\033(B\033)0";
+ SLtt_get_screen_size ();
+}
+#endif
+
+/* This sets term for vt102 terminals it parameter vt100 is 0. If vt100
+ * is non-zero, set terminal appropriate for a only vt100
+ * (no add line capability). */
+
+void SLtt_set_term_vtxxx(int *vt100)
+{
+ Norm_Vid_Str = "\033m";
+
+ Scroll_R_Str = "\033%i%d;%dr";
+ Cls_Str = "\0332J\033H";
+ Rev_Vid_Str = "\0337m";
+ Bold_Vid_Str = "\0331m";
+ Blink_Vid_Str = "\0335m";
+ UnderLine_Vid_Str = "\0334m";
+ Italic_Vid_Str = "\0333m";
+ Del_Eol_Str = "\033K";
+ Del_Bol_Str = "\0331K";
+ Rev_Scroll_Str = "\033M";
+
+ Curs_Up_Str = "\033A";
+ Curs_Dn_Str = "\033B";
+ Curs_Right_Str = "\033C";
+ Curs_Left_Str = "\033D";
+ Curs_UpN_Str = "\033%dA";
+ Curs_DnN_Str = "\033%dB";
+ Curs_RightN_Str = "\033%dC";
+ Curs_LeftN_Str = "\033%dD";
+
+ Abs_Curs_Pos_Str = "\033%i%d;%dH";
+ if ((vt100 == NULL) || (*vt100 == 0))
+ {
+	Ins_Mode_Str = "\0334h";
+	Eins_Mode_Str = "\0334l";
+	Del_Char_Str = "\033P";
+	Del_N_Lines_Str = "\033%dM";
+	Add_N_Lines_Str = "\033%dL";
+	SLtt_Term_Cannot_Insert = 0;
+ }
+ else
+ {
+	Del_N_Lines_Str = NULL;
+	Add_N_Lines_Str = NULL;
+	SLtt_Term_Cannot_Insert = 1;
+ }
+ SLtt_Term_Cannot_Scroll = 0;
+ /* No_Move_In_Standout = 0; */
+}
+
+void SLtt_init_keypad (void)
+{
+ if (SLtt_Force_Keypad_Init > 0)
+ {
+	tt_write_string (Keypad_Init_Str);
+	SLtt_flush_output ();
+ }
+}
+
+void SLtt_deinit_keypad (void)
+{
+ if (SLtt_Force_Keypad_Init > 0)
+ {
+	tt_write_string (Keypad_Reset_Str);
+	SLtt_flush_output ();
+ }
+}
+
+int SLtt_init_video (void)
+{
+ /* send_string_to_term("\033?6h"); */
+ /* relative origin mode */
+ if (Use_Relative_Cursor_Addressing == 0)
+ tt_write_string (Start_Abs_Cursor_Addressing_Mode);
+ SLtt_init_keypad ();
+ SLtt_reset_scroll_region();
+ SLtt_end_insert();
+ tt_write_string (Enable_Alt_Char_Set);
+ Video_Initialized = 1;
+ return 0;
+}
+
+int _pSLtt_init_cmdline_mode (void)
+{
+ if (TT_Is_Initialized == 0)
+ {
+	int status = SLtt_initialize (NULL);
+	if (status < 0)
+	 {
+	 if (status == -1)
+	 SLang_vmessage ("%s", "**WARNING: Unknown terminal capabilities.\n");
+	 return 0;
+	 }
+ }
+ /* We need to be able to use relative cursor addressing in this mode */
+ if (((Curs_UpN_Str == NULL) && (Curs_Up_Str == NULL))
+ || ((Curs_Dn_Str == NULL) && (Curs_DnN_Str == NULL))
+ || ((Curs_Right_Str == NULL) && (Curs_RightN_Str == NULL))
+ || ((Curs_Left_Str == NULL) && (Curs_LeftN_Str == NULL)))
+ return 0;
+
+ SLtt_Term_Cannot_Scroll = 1;
+ SLtt_Use_Ansi_Colors = 0;
+ Use_Relative_Cursor_Addressing = 1;
+ return 1;
+}
+
+void _pSLtt_cmdline_mode_reset (void)
+{
+ Cursor_Set = 0;
+ Cursor_r = Cursor_c = 0;
+ Max_Relative_Cursor_r = 0;
+ tt_write ("\r", 1);
+ _pSLtt_clear_eos ();
+}
+
+int SLtt_reset_video (void)
+{
+ SLtt_goto_rc (SLtt_Screen_Rows - 1, 0);
+ Cursor_Set = 0;
+ SLtt_normal_video ();	 /* MSKermit requires this */
+ tt_write_string(Norm_Vid_Str);
+
+ Current_Fgbg = INVALID_ATTR;
+ SLtt_set_alt_char_set (0);
+ if (SLtt_Use_Ansi_Colors)
+ {
+	if (Reset_Color_String == NULL)
+	 {
+	 SLtt_Char_Type attr;
+	 if (-1 != make_color_fgbg (NULL, NULL, &attr))
+	 write_attributes (attr);
+	 else tt_write_string ("\0330m\033m");
+	 }
+	else tt_write_string (Reset_Color_String);
+	Current_Fgbg = INVALID_ATTR;
+ }
+ SLtt_erase_line ();
+ SLtt_deinit_keypad ();
+
+ if (Use_Relative_Cursor_Addressing == 0)
+ tt_write_string (End_Abs_Cursor_Addressing_Mode);
+
+ if (Mouse_Mode == 1)
+ SLtt_set_mouse_mode (0, 1);
+
+ SLtt_flush_output ();
+ Video_Initialized = 0;
+ return 0;
+}
+
+void SLtt_bold_video (void)
+{
+ tt_write_string (Bold_Vid_Str);
+}
+
+int SLtt_set_mouse_mode (int mode, int force)
+{
+ if (force == 0)
+ {
+	char *term;
+
+	if (NULL == (term = (char *) getenv("TERM"))) return -1;
+	if (strncmp ("xterm", term, 5))
+	 return -1;
+ }
+
+ Mouse_Mode = (mode != 0);
+
+ if (mode)
+ tt_write_string ("\033?9h");
+ else
+ tt_write_string ("\033?9l");
+
+ return 0;
+}
+
+void SLtt_disable_status_line (void)
+{
+ if (SLtt_Has_Status_Line > 0)
+ {
+	tt_write_string (Disable_Status_line_Str);
+	SLtt_flush_output ();
+ }
+}
+
+int SLtt_write_to_status_line (SLFUTURE_CONST char *s, int col)
+{
+ if ((SLtt_Has_Status_Line <= 0)
+ || (Goto_Status_Line_Str == NULL)
+ || (Return_From_Status_Line_Str == NULL))
+ return -1;
+
+ tt_printf (Goto_Status_Line_Str, col, 0);
+ tt_write_string (s);
+ tt_write_string (Return_From_Status_Line_Str);
+ return 0;
+}
+
+void SLtt_get_screen_size (void)
+{
+#ifdef VMS_SYSTEM
+ int status, code;
+ unsigned short chan;
+ $DESCRIPTOR(dev_dsc, "SYS$INPUT:");
+#endif
+ int r = 0, c = 0;
+
+#ifdef TIOCGWINSZ
+ struct winsize wind_struct;
+
+ do
+ {
+	if ((ioctl(1,TIOCGWINSZ,&wind_struct) == 0)
+	 || (ioctl(0, TIOCGWINSZ, &wind_struct) == 0)
+	 || (ioctl(2, TIOCGWINSZ, &wind_struct) == 0))
+	 {
+	 c = (int) wind_struct.ws_col;
+	 r = (int) wind_struct.ws_row;
+	 break;
+	 }
+ }
+ while (errno == EINTR);
+
+#endif
+
+#ifdef VMS_SYSTEM
+ status = sys$assign(&dev_dsc,&chan,0,0,0);
+ if (status & 1)
+ {
+	code = DVI$_DEVBUFSIZ;
+	status = lib$getdvi(&code, &chan,0, &c, 0,0);
+	if (!(status & 1))
+	 c = 80;
+	code = DVI$_TT_PAGE;
+	status = lib$getdvi(&code, &chan,0, &r, 0,0);
+	if (!(status & 1))
+	 r = 24;
+	sys$dassgn(chan);
+ }
+#endif
+
+ if (r <= 0)
+ {
+	char *s = getenv ("LINES");
+	if (s != NULL) r = atoi (s);
+ }
+
+ if (c <= 0)
+ {
+	char *s = getenv ("COLUMNS");
+	if (s != NULL) c = atoi (s);
+ }
+
+ if ((r <= 0) || (r > SLTT_MAX_SCREEN_ROWS)) r = 24;
+ if ((c <= 0) || (c > SLTT_MAX_SCREEN_COLS)) c = 80;
+ SLtt_Screen_Rows = r;
+ SLtt_Screen_Cols = c;
+}
+
+#if SLTT_HAS_NON_BCE_SUPPORT
+int _pSLtt_get_bce_color_offset (void)
+{
+ if ((SLtt_Use_Ansi_Colors == 0)
+ || Can_Background_Color_Erase
+ || SLtt_Use_Blink_For_ACS) /* in this case, we cannot lose a color */
+ Bce_Color_Offset = 0;
+ else
+ {
+	SLtt_Char_Type fgbg = get_brush_fgbg (0);
+	if (GET_BG(fgbg) == SLSMG_COLOR_DEFAULT)
+	 Bce_Color_Offset = 0;
+	else
+	 Bce_Color_Offset = 1;
+ }
+
+ return Bce_Color_Offset;
+}
+#endif
+
+int SLtt_utf8_enable (int mode)
+{
+ if (mode == -1)
+ mode = _pSLutf8_mode;
+
+ return _pSLtt_UTF8_Mode = mode;
+}
+
+int SLtt_is_utf8_mode (void)
+{
+ int mode = _pSLtt_UTF8_Mode;
+ if (mode == -1)
+ mode = _pSLutf8_mode;
+
+ return mode;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/sldostty.c Added

@@ -0,0 +1,535 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#ifdef __DJGPP__
+# define _NAIVE_DOS_REGS
+#endif
+
+#include <dos.h>
+
+#if defined (__EMX__)
+# define int86		_int86
+# define delay		_sleep2
+#endif	/* __EMX__ */
+
+#if defined (__WATCOMC__)
+# include <conio.h>
+# include <bios.h>
+# define int86	int386
+#endif
+
+#if defined (__DJGPP__)
+# include <sys/farptr.h>
+# include <go32.h>
+# include <bios.h>
+#endif
+
+#ifndef _NKEYBRD_READ
+# define _NKEYBRD_READ		0x0
+#endif
+#ifndef _NKEYBRD_READY
+# define _NKEYBRD_READY		0x1
+#endif
+#ifndef _NKEYBRD_SHIFTSTATUS
+# define _NKEYBRD_SHIFTSTATUS	0x2
+#endif
+
+#define BIOSKEY		slbioskey
+#if defined(__WATCOMC__)
+# define keyWaiting() _bios_keybrd(_NKEYBRD_READY)
+#else
+# define keyWaiting()	BIOSKEY(_NKEYBRD_READY)
+#endif
+
+#ifndef __EMX__
+# define USE_MOUSE_CODE 1
+#else
+# define USE_MOUSE_CODE 0
+#endif
+
+#include "slang.h"
+#include "_slang.h"
+
+#ifdef __cplusplus
+# define _DOTS_ ...
+#else
+# define _DOTS_ void
+#endif
+
+#if !defined (__EMX__) && !defined (__GO32__) && !defined (__WATCOMC__)
+#define HAS_INT9
+#endif
+
+#ifdef __GO32__
+# include <signal.h>
+#endif
+
+#if defined (HAS_INT9)
+static void interrupt (*int9_old) (_DOTS_);
+static unsigned char far *shift = (unsigned char far *) 0x417;
+static unsigned int Abort_Scan_Code = 34; /* 34 = scan code for ^G */
+
+/*----------------------------------------------------------------------*\
+ * an interrupt 9 handler, not for use with most 32 bit compilers
+\*----------------------------------------------------------------------*/
+static void interrupt int9_handler (_DOTS_)
+{
+ unsigned char s, s1;
+
+ s1 = *shift & 0xF;		/* ignore caps, ins, num lock, scroll lock */
+ s = inp (0x60);
+ if (s1 & 0x04)		/* control key */
+ {
+	if (s == Abort_Scan_Code)
+	 {
+	 if (SLang_Ignore_User_Abort == 0) SLang_Error = SL_USER_BREAK;
+	 SLKeyBoard_Quit = 1;
+	 }
+ }
+ (*int9_old) ();
+}
+#endif	/* HAS_INT9 */
+
+static void int9_change (int set)
+{
+#if defined (HAS_INT9)
+ if (set)			/* install a new handler */
+ {
+	if (int9_old != NULL) return;
+	int9_old = getvect (9);
+	setvect (9, int9_handler);
+ }
+ else	if (int9_old != NULL)	/* restore the old handler */
+ {
+	setvect (9, int9_old);
+	int9_old = NULL;
+ }
+#else
+ (void) set;
+#endif	/* HAS_INT9 */
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	static void set_ctrl_break (int state);
+ *
+ * set the control-break setting
+\*----------------------------------------------------------------------*/
+static void set_ctrl_break (int state)
+{
+#if defined (__EMX__)
+ (void) state;		/* not really required */
+#else	/* __EMX__ */
+
+ static int prev = 0;
+
+# if defined (__GO32__)
+ if (state == 0)
+ {
+# if __DJGPP__ >= 2
+	signal (SIGINT, SIG_IGN);
+# endif
+	prev = getcbrk ();
+	setcbrk (0);
+ }
+ else
+ {
+# if __DJGPP__ >= 2
+	signal (SIGINT, SIG_DFL);
+# endif
+	setcbrk (prev);
+ }
+# else	/* __GO32__ */
+# if defined(__WATCOMC__)
+ fprintf (stderr, "Have not yet defined set_ctrl_break for __WATCOMC__\n");
+ prev = state;
+# else
+ asm mov dl, byte ptr prev
+ asm mov ax, state
+ asm cmp ax, 0
+ asm jne L1
+ asm mov ah, 33h
+ asm mov al, 0
+ asm mov dl, byte ptr prev
+ asm int 21h
+ asm xor ax, ax
+ asm mov al, dl
+ asm mov prev, ax
+ asm mov dl, 0
+ L1:
+ asm mov al, 1
+ asm mov ah, 33h
+ asm int 21h
+# endif	/* __WATCOMC__ */
+# endif	/* __GO32__ */
+#endif	/* __EMX__ */
+}
+
+/*----------------------------------------------------------------------*\
+ * static unsigned int slbioskey (int op);
+ *
+ * op 0-2 (standard) and 0x10-0x12 (extended) are valid
+ *
+ * 0, 0x10	_NKEYBRD_READ	- read the key
+ * 1, 0x11	_NKEYBRD_READY	- check if a key is waiting
+ * 		if so give a peek of its value, otherwise return 0
+ * 2, 0x12	_NKEYBRD_SHIFTSTATUS	- get shift flags
+ *		(Ins, Cap, Num, Scroll, Alt, ^Ctrl L_shift, R_shift)
+ *		flags = ICNSA^LR	only the lower byte is valid!
+\*----------------------------------------------------------------------*/
+static int bios_key_f = 0;
+static unsigned int slbioskey (int op)
+{
+ union REGS r;
+ r.h.ah = (op & 0x03) | bios_key_f;
+ int86 (0x16, &r, &r);
+#if defined(__WATCOMC__)
+ /* return (_bios_keybrd ((op & 0x03) | bios_key_f)); */
+# if 1			/* the correct zero flag for watcom? */
+ /* is zero flag set? (no key waiting) */
+ if ((op & _NKEYBRD_READY) && (r.x.cflag & 0x40) == 0x40) return 0;
+# else			/* the correct zero flag for watcom? */
+ /* is zero flag set? (no key waiting) */
+ if ((op & _NKEYBRD_READY) && (r.x.cflag & 0x4)) return 0;
+# endif
+ return (r.x.eax & 0xffff);
+#else
+ /* is zero flag set? (no key waiting) */
+ if (op & _NKEYBRD_READY)
+ {
+	if ((r.x.flags & 0x40) == 0x40)
+	 return 0;
+	if (r.x.ax == 0)		 /* CTRL-BREAK */
+	 return -1;
+ }
+ return (r.x.ax & 0xffff);
+#endif
+}
+
+#if USE_MOUSE_CODE
+/*----------------------------------------------------------------------*\
+ * Simple mouse routines for 16/32-bit DOS-targets.
+ * Gisle Vanem <giva@bgnett.no>
+\*----------------------------------------------------------------------*/
+
+#define HARD_MOUSE_RESET 0
+
+static int Have_Mouse = 0;
+static int Process_Mouse_Events = 0;
+
+/*----------------------------------------------------------------------*\
+ * peem_far_mem()
+ *
+\*----------------------------------------------------------------------*/
+static unsigned long peek_dos_mem (unsigned long dos_addr,
+ unsigned char *pentry)
+{
+ unsigned long vector;
+ unsigned char entry;
+
+#if defined(__DJGPP__)
+# define MAKE_LINEAR(seg,ofs) ((unsigned long)(((seg) << 4) + (ofs)))
+ vector = _farpeekl (_dos_ds, dos_addr);
+ entry = _farpeekb (_dos_ds, MAKE_LINEAR(vector >> 16, vector & 0xffff));
+
+#elif defined(__EMX__)
+ vector = 0;
+ entry = 0; /* to-do!! */
+
+#elif defined(__WATCOMC__) && defined(__FLAT__) /* wcc386 */
+ vector = *(unsigned long*) dos_addr;
+ entry = *(unsigned char*) vector;
+#else
+ vector = *(unsigned long far*) dos_addr;
+ entry = *(unsigned char far*) vector;
+#endif
+
+ if (pentry)
+ *pentry = entry;
+ return (vector);
+}
+
+/*----------------------------------------------------------------------*\
+ * mouse_pressed (int button, int *x_pos, int *y_pos)
+ *
+ * Return 1 if left (0) or right (1) mouse-button was pressed.
+\*----------------------------------------------------------------------*/
+static int mouse_pressed (int button, int *x_pos, int *y_pos)
+{
+ union REGS r;
+
+ r.x.ax = 5;
+ r.x.bx = button;
+ int86 (0x33, &r, &r);
+ *x_pos = r.x.cx;
+ *y_pos = r.x.dx;
+ return (r.x.bx);
+}
+
+/*----------------------------------------------------------------------*\
+ * mouse_show (int show)
+ *
+ * Show (show=1) or hide (show=0) the mouse cursor
+\*----------------------------------------------------------------------*/
+static int mouse_show (int show)
+{
+ union REGS r;
+
+ if (Have_Mouse == 0)
+ return -1;
+
+ r.x.ax = show ? 1 : 2;
+ int86 (0x33, &r, &r);
+ return 0;
+}
+
+/*----------------------------------------------------------------------*\
+ * mouse_exit (void)
+ *
+ * Do a soft-reset of the mouse-driver (hides cursor)
+\*----------------------------------------------------------------------*/
+static void mouse_exit (void)
+{
+ union REGS r;
+ r.x.ax = 0x21;
+ int86 (0x33, &r, &r);
+}
+
+/*----------------------------------------------------------------------*\
+ * mouse_init (void)
+ *
+ * Peek at mouse interrupt vector for a driver.
+ * Do a soft/hard-reset of the mouse-driver.
+ * Add a SLang atexit function
+\*----------------------------------------------------------------------*/
+static int mouse_init (void)
+{
+ union REGS r;
+ unsigned char entry = 0;
+ unsigned long vector = peek_dos_mem (4*0x33, &entry);
+
+ if (!vector || entry == 0xCF) /* NULL or points to IRET */
+ return -1;
+
+#if HARD_MOUSE_RESET
+ r.x.ax = 0; /* mouse hard-reset and reinit */
+#else
+ r.x.ax = 0x21; /* mouse soft-reset and reinit */
+#endif
+
+ int86 (0x33, &r, &r);
+ if (r.x.ax != 0xFFFF)
+ return -1;
+
+ (void) SLang_add_cleanup_function (mouse_exit);
+ Have_Mouse = 1;
+ return 0;
+}
+
+/*----------------------------------------------------------------------*\
+ * static int mouse_get_event (void);
+ *
+ * Poll mouse for changed button-state and encode x/y position and
+ * button state into an escape sequence "\eM.."
+\*----------------------------------------------------------------------*/
+static int mouse_get_event (void)
+{
+ char buf 6;
+ int x, y;
+
+ if (!Have_Mouse || Process_Mouse_Events == 0)
+ return (0);
+
+ if (mouse_pressed(0, &x, &y)) /* left button pressed? */
+ buf3 = 040;
+ else if (mouse_pressed(1, &x, &y)) /* right button pressed */
+ buf3 = 041;
+ else return (0);
+
+#if 0 /* test */
+ fprintf (stderr, "mouse_get_event: x=%d, y=%d\n", x, y);
+#endif
+
+ /*
+ * Taken from slw32tty.c / process_mouse_event():
+ *
+ * We have a simple press or release. Encode it as an escape sequence
+ * and buffer the result. The encoding is:
+ * 'ESC M b x y'
+ * where b represents the button state, and x,y represent the coordinates.
+ * The ESC is handled by the calling routine.
+ */
+ buf0 = 27;
+ buf1 = '';
+ buf2 = 'M';
+ buf4 = 1 + ' ' + (x >> 3); /* textmode co-ordinates are 1/8th of */
+ buf5 = 1 + ' ' + (y >> 3); /* graphics-mode co-ordinates */
+
+ if (SLang_buffer_keystring (buf, sizeof(buf)) < 0)
+ return (0);
+ return (1);
+}
+
+#endif				 /* USE_MOUSE_CODE */
+
+/*----------------------------------------------------------------------*\
+ * Function:	int SLang_init_tty (int abort_char, int no_flow_control,
+ *				 int opost);
+ *
+ * initialize the keyboard interface and attempt to set-up the interrupt 9
+ * handler if ABORT_CHAR is non-zero.
+ * NO_FLOW_CONTROL and OPOST are only for compatiblity and are ignored.
+\*----------------------------------------------------------------------*/
+int SLang_init_tty (int abort_char, int no_flow_control, int opost)
+{
+ (void) no_flow_control;
+ (void) opost;
+
+ SLKeyBoard_Quit = 0;
+
+ bios_key_f = 0x10;		/* assume it's an enhanced keyboard */
+#if defined (HAS_INT9)
+ bios_key_f &= peekb (0x40,0x96);	/* verify it's true */
+ if (abort_char > 0) Abort_Scan_Code = (unsigned int) abort_char;
+#else
+ (void) abort_char;
+#endif
+
+ set_ctrl_break (0);
+
+ return 0;
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	void SLang_reset_tty (void);
+ *
+ * reset the tty before exiting
+\*----------------------------------------------------------------------*/
+void SLang_reset_tty (void)
+{
+ int9_change (0);
+ set_ctrl_break (1);
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	int _pSLsys_input_pending (int tsecs);
+ *
+ * sleep for *tsecs tenths of a sec waiting for input
+\*----------------------------------------------------------------------*/
+int _pSLsys_input_pending (int tsecs)
+{
+ if (keyWaiting()) return 1;
+
+ /* Convert tsecs to units of 20 ms */
+ tsecs = tsecs * 5;
+
+ /* If tsecs is less than 0, it represents millisecs */
+ if (tsecs < 0)
+ tsecs = -tsecs / 100;
+
+ while ((tsecs > 0) && (SLang_Input_Buffer_Len == 0))
+ {
+	delay (20);	/* 20 ms or 1/50 sec */
+#if USE_MOUSE_CODE
+	if (1 == mouse_get_event ())
+	 return SLang_Input_Buffer_Len;
+#endif
+	if (keyWaiting()) break;
+	tsecs--;
+ }
+ return (tsecs);
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	unsigned int _pSLsys_getkey (void);
+ *
+ * Wait for and get the next available mouse-event / keystroke.
+ * Also re-maps some useful keystrokes.
+ *
+ *	Backspace (^H)	=>	Del (127)
+ *	Ctrl-Space	=>	^@	(^@^3 - a pc NUL char)
+ *	extended keys are prefixed by a null character
+\*----------------------------------------------------------------------*/
+unsigned int _pSLsys_getkey (void)
+{
+ unsigned int key, scan, ch, shift;
+
+ while ((SLang_Input_Buffer_Len == 0)
+	 && (0 == _pSLsys_input_pending (300)))
+ ;
+
+ if (SLang_Input_Buffer_Len)
+ return SLang_getkey ();
+
+ key = BIOSKEY(_NKEYBRD_READ);
+ ch = key & 0xff;
+ scan = key >> 8;
+ shift = BIOSKEY(_NKEYBRD_SHIFTSTATUS) & 0xf;
+
+ if (key == 0x0e08)
+ return 127;			/* Backspace key */
+
+ switch (ch)
+ {
+ case 32:
+	if (0 == (shift & 0x04))
+	 break;
+	/* ^space = ^@ */
+	scan = 3;		/* send back Ctrl-@ => ^@^C */
+	/* drop */
+ case 0xe0:
+ case 0:			/* extended key code */
+	ch = _pSLpc_convert_scancode (scan, 0, 1);
+ }
+ return (ch);
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	void SLang_set_abort_signal (void (*handler)(int));
+\*----------------------------------------------------------------------*/
+int SLang_set_abort_signal (void (*handler)(int))
+{
+ if (handler == NULL) int9_change (1);
+ return 0;
+}
+
+int SLtt_set_mouse_mode (int mode, int force)
+{
+#if USE_MOUSE_CODE
+ (void) force;
+
+ if ((Have_Mouse == 0)
+ && (-1 == mouse_init ()))
+ {
+ Process_Mouse_Events = 0;
+ return -1;
+ }
+
+ Process_Mouse_Events = mode;
+ return mouse_show (mode);
+#else
+ (void) mode;
+ (void) force;
+
+ return -1;
+#endif
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slerr.c Added

@@ -0,0 +1,871 @@
+/* error handling common to all routines. */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+void (*_pSLinterpreter_Error_Hook) (int) = NULL;
+
+void (*SLang_VMessage_Hook) (SLFUTURE_CONST char *, va_list) = NULL;
+void (*SLang_Error_Hook)(SLFUTURE_CONST char *) = NULL;
+void (*SLang_Exit_Error_Hook)(SLFUTURE_CONST char *, va_list) = NULL;
+void (*SLang_Dump_Routine)(SLFUTURE_CONST char *) = NULL;
+
+volatile int _pSLang_Error = 0;
+volatile int SLKeyBoard_Quit = 0;
+
+typedef struct _Exception_Type Exception_Type;
+struct _Exception_Type
+{
+ int error_code;
+ SLFUTURE_CONST char *name;
+ SLFUTURE_CONST char *description;
+ Exception_Type *subclasses;
+ Exception_Type *next;
+ Exception_Type *parent;
+};
+
+static Exception_Type *Exception_Root;
+static Exception_Type Exception_Root_Buf =
+{
+ -1, "AnyError", "All Errors", NULL, NULL, NULL
+};
+
+/* Built-in error codes */
+/* These values should correspond to the values produced by _pSLerr_init.
+ * Some apps may not use the interpreter, and as such _pSLerr_init will not
+ * get called.
+ */
+int SL_Any_Error = -1;
+int SL_Unknown_Error = 6;
+int SL_Internal_Error = 5;
+int SL_OS_Error = 1;
+int SL_Malloc_Error = 2;
+int SL_Import_Error = 7;
+int SL_RunTime_Error = 3;
+int SL_InvalidParm_Error = 4;
+int SL_TypeMismatch_Error = 8;
+int SL_UserBreak_Error = 9;
+int SL_Stack_Error = 10;
+int SL_StackOverflow_Error = 12;
+int SL_StackUnderflow_Error = 11;
+int SL_ReadOnly_Error = 13;
+int SL_VariableUninitialized_Error = 14;
+int SL_NumArgs_Error = 15;
+int SL_Index_Error = 16;
+int SL_Usage_Error = 17;
+int SL_Application_Error = 18;
+int SL_NotImplemented_Error = 19;
+int SL_LimitExceeded_Error = 20;
+int SL_Forbidden_Error = 21;
+int SL_Math_Error = 22;
+int SL_DivideByZero_Error = 23;
+int SL_ArithOverflow_Error = 24;
+int SL_ArithUnderflow_Error = 25;
+int SL_Domain_Error = 26;
+int SL_IO_Error = 27;
+int SL_Write_Error = 28;
+int SL_Read_Error = 29;
+int SL_Open_Error = 30;
+int SL_Data_Error = 31;
+int SL_Unicode_Error = 32;
+int SL_InvalidUTF8_Error = 33;
+int SL_Namespace_Error = 34;
+int SL_Parse_Error = 35;
+int SL_Syntax_Error = 36;
+int SL_DuplicateDefinition_Error = 37;
+int SL_UndefinedName_Error = 38;
+
+typedef struct
+{
+ int *errcode_ptr;
+ SLFUTURE_CONST char *name;
+ SLFUTURE_CONST char *description;
+ int *base_class_ptr;
+}
+BuiltIn_Exception_Table_Type;
+
+static SLCONST BuiltIn_Exception_Table_Type BuiltIn_Exception_Table =
+{
+ /* Define MallocError and InvalidParmError ASAP */
+ {&SL_OS_Error, "OSError", "OS Error", &SL_Any_Error},
+ {&SL_Malloc_Error, "MallocError", "Not enough memory", &SL_OS_Error},
+
+ {&SL_RunTime_Error, "RunTimeError", "Run-Time Error", &SL_Any_Error},
+ {&SL_InvalidParm_Error, "InvalidParmError", "Invalid Parameter", &SL_RunTime_Error},
+
+ {&SL_Internal_Error, "InternalError", "Internal Error", &SL_Any_Error},
+ {&SL_Unknown_Error, "UnknownError", "Unknown Error", &SL_Any_Error},
+
+ /* Rest of OSErrors */
+ {&SL_Import_Error, "ImportError", "Import Error", &SL_OS_Error},
+
+ /* Rest of RunTimeErrors */
+ {&SL_TypeMismatch_Error, "TypeMismatchError", "Type Mismatch", &SL_RunTime_Error},
+ {&SL_UserBreak_Error, "UserBreakError", "User Break", &SL_RunTime_Error},
+ {&SL_Stack_Error, "StackError", "Stack Error", &SL_RunTime_Error},
+ {&SL_StackUnderflow_Error, "StackUnderflowError", "Stack Underflow Error", &SL_Stack_Error},
+ {&SL_StackOverflow_Error, "StackOverflowError", "Stack Overflow Error", &SL_Stack_Error},
+ {&SL_ReadOnly_Error, "ReadOnlyError", "Read-Only Error", &SL_RunTime_Error},
+ {&SL_VariableUninitialized_Error, "VariableUninitializedError", "Variable Uninitialized Error", &SL_RunTime_Error},
+ {&SL_NumArgs_Error, "NumArgsError", "Invalid Number of Arguments", &SL_RunTime_Error},
+ {&SL_Index_Error, "IndexError", "Invalid Index", &SL_RunTime_Error},
+ {&SL_Usage_Error, "UsageError", "Illegal Usage", &SL_RunTime_Error},
+ {&SL_Application_Error, "ApplicationError", "Application Error", &SL_RunTime_Error},
+ {&SL_NotImplemented_Error, "NotImplementedError", "Not Implemented", &SL_RunTime_Error},
+ {&SL_LimitExceeded_Error, "LimitExceededError", "Limit Exceeded", &SL_RunTime_Error},
+ {&SL_Forbidden_Error, "ForbiddenError", "Operation Forbidden", &SL_RunTime_Error},
+ {&SL_Math_Error, "MathError", "Math Error", &SL_RunTime_Error},
+ {&SL_DivideByZero_Error, "DivideByZeroError", "Divide by Zero", &SL_Math_Error},
+ {&SL_ArithOverflow_Error, "ArithOverflowError", "Arithmetic Overflow", &SL_Math_Error},
+ {&SL_ArithUnderflow_Error, "ArithUnderflowError", "Arithmetic Underflow", &SL_Math_Error},
+ {&SL_Domain_Error, "DomainError", "Domain Error", &SL_Math_Error},
+ {&SL_IO_Error, "IOError", "I/O Error", &SL_RunTime_Error},
+ {&SL_Write_Error, "WriteError", "Write failed", &SL_IO_Error},
+ {&SL_Read_Error, "ReadError", "Read failed", &SL_IO_Error},
+ {&SL_Open_Error, "OpenError", "Open failed", &SL_IO_Error},
+ {&SL_Data_Error, "DataError", "Data Error", &SL_RunTime_Error},
+ {&SL_Unicode_Error, "UnicodeError", "Unicode Error", &SL_RunTime_Error},
+ {&SL_InvalidUTF8_Error, "UTF8Error", "Invalid UTF8", &SL_Unicode_Error},
+ {&SL_Namespace_Error, "NamespaceError", "Namespace Error", &SL_RunTime_Error},
+
+ /* Parse Errors */
+ {&SL_Parse_Error, "ParseError", "Parse Error", &SL_Any_Error},
+ {&SL_Syntax_Error, "SyntaxError", "Syntax Error", &SL_Parse_Error},
+ {&SL_DuplicateDefinition_Error, "DuplicateDefinitionError", "Duplicate Definition", &SL_Parse_Error},
+ {&SL_UndefinedName_Error, "UndefinedNameError", "Undefined Name", &SL_Parse_Error},
+ {NULL, NULL, NULL, NULL}
+};
+
+static Exception_Type *find_exception (Exception_Type *root, int error_code)
+{
+ Exception_Type *e;
+
+ while (root != NULL)
+ {
+	if (error_code == root->error_code)
+	 return root;
+
+	if (root->subclasses != NULL)
+	 {
+	 e = find_exception (root->subclasses, error_code);
+	 if (e != NULL)
+	 return e;
+	 }
+	root = root->next;
+ }
+
+ return root;
+}
+
+static int is_exception_ancestor (int a, int b)
+{
+ Exception_Type *e;
+
+ if (a == b)
+ return 1;
+
+ if (NULL == (e = find_exception (Exception_Root, a)))
+ return 0;
+
+ while (e->parent != NULL)
+ {
+	e = e->parent;
+	if (e->error_code == b)
+	 return 1;
+ }
+ return 0;
+}
+
+int SLerr_exception_eqs (int a, int b)
+{
+ if (is_exception_ancestor (a, b))
+ return 1;
+
+ return 0;
+}
+
+static void free_this_exception (Exception_Type *e)
+{
+ if (e == NULL)
+ return;
+
+ if (e->name != NULL)
+ SLang_free_slstring ((char *) e->name);
+
+ if (e->description != NULL)
+ SLang_free_slstring ((char *) e->description);
+
+ SLfree ((char *)e);
+}
+
+static int Next_Exception_Code;
+/* The whole point of this nonsense involving the _pSLerr_New_Exception_Hook
+ * is to provide a mechanism to avoid linking in the interpreter for apps
+ * that just want the other facilities.
+ */
+int (*_pSLerr_New_Exception_Hook)(SLFUTURE_CONST char *name, SLFUTURE_CONST char *desc, int error_code);
+
+int _pSLerr_init_interp_exceptions (void)
+{
+ SLCONST BuiltIn_Exception_Table_Type *b;
+ Exception_Type *e;
+
+ if (_pSLerr_New_Exception_Hook == NULL)
+ return 0;
+
+ e = &Exception_Root_Buf;
+ if (-1 == (*_pSLerr_New_Exception_Hook)(e->name, e->description, e->error_code))
+ return -1;
+
+ b = BuiltIn_Exception_Table;
+ while (b->errcode_ptr != NULL)
+ {
+	if (-1 == (*_pSLerr_New_Exception_Hook)(b->name, b->description, *b->errcode_ptr))
+	 return -1;
+
+	b++;
+ }
+ return 0;
+}
+
+int SLerr_new_exception (int baseclass, SLFUTURE_CONST char *name, SLFUTURE_CONST char *descript)
+{
+ Exception_Type *base;
+ Exception_Type *e;
+
+ if (-1 == _pSLerr_init ())
+ return -1;
+
+ base = find_exception (Exception_Root, baseclass);
+ if (base == NULL)
+ {
+	_pSLang_verror (SL_InvalidParm_Error,
+		 "Base class for new exception not found");
+	return -1;
+ }
+
+ e = (Exception_Type *) SLcalloc (1, sizeof (Exception_Type));
+ if (e == NULL)
+ return -1;
+
+ if ((NULL == (e->name = SLang_create_slstring (name)))
+ || (NULL == (e->description = SLang_create_slstring (descript))))
+ {
+	free_this_exception (e);
+	return -1;
+ }
+
+ e->error_code = Next_Exception_Code;
+
+ if ((_pSLerr_New_Exception_Hook != NULL)
+ && (-1 == (*_pSLerr_New_Exception_Hook) (e->name, e->description, e->error_code)))
+ {
+	free_this_exception (e);
+	return -1;
+ }
+
+ e->parent = base;
+ e->next = base->subclasses;
+ base->subclasses = e;
+
+ Next_Exception_Code++;
+ return e->error_code;
+}
+
+static int init_exceptions (void)
+{
+ SLCONST BuiltIn_Exception_Table_Type *b;
+
+ if (Exception_Root != NULL)
+ return 0;
+
+ Exception_Root = &Exception_Root_Buf;
+ Next_Exception_Code = 1;
+ b = BuiltIn_Exception_Table;
+ while (b->errcode_ptr != NULL)
+ {
+	int err_code;
+
+	err_code = SLerr_new_exception (*b->base_class_ptr, b->name, b->description);
+	if (err_code == -1)
+	 return -1;
+
+	*b->errcode_ptr = err_code;
+	b++;
+ }
+
+ return 0;
+}
+
+static void free_exceptions (Exception_Type *root)
+{
+ while (root != NULL)
+ {
+	Exception_Type *next;
+
+	if (root->subclasses != NULL)
+	 free_exceptions (root->subclasses);
+
+	next = root->next;
+	free_this_exception (root);
+	root = next;
+ }
+}
+
+static void deinit_exceptions (void)
+{
+ Exception_Type *root = Exception_Root;
+
+ if (root != NULL)
+ free_exceptions (root->subclasses);
+
+ Exception_Root = NULL;
+ Next_Exception_Code = 0;
+}
+
+SLFUTURE_CONST char *SLerr_strerror (int err_code)
+{
+ Exception_Type *e;
+
+ if (err_code == 0)
+ err_code = _pSLang_Error;
+
+ if (-1 == _pSLerr_init ())
+ return "Unable to initialize SLerr module";
+
+ if (NULL == (e = find_exception (Exception_Root, err_code)))
+ return "Invalid/Unknown Error Code";
+
+ return e->description;
+}
+
+/* Error Queue Functions
+ * SLang_verror (int errcode, fmt, args)
+ * Add an error message to the queue.
+ * SLerr_delete_queue ()
+ * Removes messages from the error queue
+ * SLerr_print_queue ()
+ * Prints all messages from the queue, deletes the queue
+ */
+typedef struct _Error_Message_Type
+{
+ char *msg;			 /* SLstring, may be NULL */
+ int msg_type;
+ struct _Error_Message_Type *next;
+}
+Error_Message_Type;
+
+static SLFUTURE_CONST char *Static_Error_Message = NULL;
+
+struct _pSLerr_Error_Queue_Type
+{
+ Error_Message_Type *head;
+ Error_Message_Type *tail;
+};
+
+static _pSLerr_Error_Queue_Type *Default_Error_Queue;
+static _pSLerr_Error_Queue_Type *Active_Error_Queue;
+
+static void free_error_msg (Error_Message_Type *m)
+{
+ if (m == NULL)
+ return;
+ if (m->msg != NULL)
+ SLang_free_slstring (m->msg);
+ SLfree ((char *)m);
+}
+
+static Error_Message_Type *allocate_error_msg (char *msg, int msg_type)
+{
+ Error_Message_Type *m;
+
+ if (NULL == (m = (Error_Message_Type*) SLcalloc (1, sizeof (Error_Message_Type))))
+ return NULL;
+
+ if ((NULL != msg) && (NULL == (m->msg = SLang_create_slstring (msg))))
+ {
+	free_error_msg (m);
+	return NULL;
+ }
+ m->msg_type = msg_type;
+ return m;
+}
+
+static void free_queued_messages (_pSLerr_Error_Queue_Type *q)
+{
+ Error_Message_Type *m;
+
+ if (q == NULL)
+ return;
+
+ m = q->head;
+ while (m != NULL)
+ {
+	Error_Message_Type *m1 = m->next;
+	free_error_msg (m);
+	m = m1;
+ }
+ q->head = NULL;
+ q->tail = NULL;
+}
+
+void _pSLerr_delete_error_queue (_pSLerr_Error_Queue_Type *q)
+{
+ if (q == NULL)
+ return;
+
+ free_queued_messages (q);
+ SLfree ((char *)q);
+}
+
+_pSLerr_Error_Queue_Type *_pSLerr_new_error_queue (int make_active)
+{
+ _pSLerr_Error_Queue_Type *q;
+
+ if (NULL == (q = (_pSLerr_Error_Queue_Type *)SLcalloc (1, sizeof(_pSLerr_Error_Queue_Type))))
+ return NULL;
+
+ if (make_active)
+ Active_Error_Queue = q;
+ return q;
+}
+
+static int queue_message (_pSLerr_Error_Queue_Type *q, char *msg, int msg_type)
+{
+ Error_Message_Type *m;
+
+ if (NULL == (m = allocate_error_msg (msg, msg_type)))
+ return -1;
+
+ if (q->tail != NULL)
+ q->tail->next = m;
+ if (q->head == NULL)
+ q->head = m;
+ q->tail = m;
+
+ return 0;
+}
+
+static void print_error (int msg_type, SLFUTURE_CONST char *err)
+{
+ SLstrlen_Type len;
+
+ switch (msg_type)
+ {
+ case _SLERR_MSG_ERROR:
+	if (SLang_Error_Hook != NULL)
+	 {
+	 (*SLang_Error_Hook)(err);
+	 return;
+	 }
+	break;
+ case _SLERR_MSG_TRACEBACK:
+ case _SLERR_MSG_WARNING:
+	if (SLang_Dump_Routine != NULL)
+	 {
+	 (*SLang_Dump_Routine)(err);
+	 return;
+	 }
+	break;
+ }
+
+ len = strlen (err);
+ if (len == 0)
+ return;
+
+ fputs (err, stderr);
+ if ((errlen-1 != '\n')
+ && (msg_type != _SLERR_MSG_TRACEBACK))
+ fputs("\n", stderr);
+
+ fflush (stderr);
+}
+
+static void print_queue (void)
+{
+ if (-1 == _pSLerr_init ())
+ print_error (_SLERR_MSG_ERROR, "Unable to initialize SLerr module");
+
+ if (_pSLang_Error == 0)
+ return;
+
+ if (Active_Error_Queue != NULL)
+ {
+	_pSLerr_Error_Queue_Type *q = Active_Error_Queue;
+	Error_Message_Type *m = q->head;
+	while (m != NULL)
+	 {
+	 Error_Message_Type *m_next = m->next;
+	 if (m->msg != NULL)
+	 print_error (m->msg_type, m->msg);
+	 m = m_next;
+	 }
+
+	free_queued_messages (q);
+ }
+ if (Static_Error_Message != NULL)
+ {
+	print_error (_SLERR_MSG_ERROR, Static_Error_Message);
+	Static_Error_Message = NULL;
+ }
+}
+
+/* This function concatenates messages in the queue of the specified type and
+ * returns them as an SLstring.
+ */
+char *_pSLerr_get_error_from_queue (_pSLerr_Error_Queue_Type *q, int type)
+{
+ Error_Message_Type *m;
+ SLstrlen_Type len;
+ char *err, *err1, *err_max;
+ SLstrlen_Type nl_len;
+
+ if ((q == NULL)
+ && (NULL == (q = Default_Error_Queue)))
+ return NULL;
+
+ len = 0;
+ /* Only _SLERR_MSG_ERROR type errors need \n to separate them. */
+ nl_len = (type == _SLERR_MSG_ERROR) ? 1 : 0;
+ m = q->head;
+ while (m != NULL)
+ {
+	if (m->msg_type == type)
+	 len += nl_len + strlen (m->msg);
+
+	m = m->next;
+ }
+
+ if (len)
+ len -= nl_len;			 /* last \n not needed */
+
+ if (NULL == (err = _pSLallocate_slstring (len)))
+ return NULL;
+
+ err_max = err + len;
+ err1 = err;
+ m = q->head;
+ while (m != NULL)
+ {
+	if (m->msg_type == type)
+	 {
+	 SLstrlen_Type dlen = strlen (m->msg);
+	 strcpy (err1, m->msg);
+	 err1 += dlen;
+	 if (nl_len && (err1 != err_max))
+	 *err1++ = '\n';
+	 }
+	m = m->next;
+ }
+ *err1 = 0;
+
+ return _pSLcreate_via_alloced_slstring (err, len);
+}
+
+void _pSLerr_print_message_queue (void)
+{
+ print_queue ();
+}
+
+static volatile int Suspend_Error_Messages = 0;
+int _pSLerr_resume_messages (void)
+{
+ if (Suspend_Error_Messages == 0)
+ return 0;
+
+ Suspend_Error_Messages--;
+ if (Suspend_Error_Messages == 0)
+ print_queue ();
+ return 0;
+}
+
+int _pSLerr_suspend_messages (void)
+{
+ Suspend_Error_Messages++;
+ return 0;
+}
+
+void _pSLerr_free_queued_messages (void)
+{
+ Static_Error_Message = NULL;
+ free_queued_messages (Active_Error_Queue);
+}
+
+static void set_error (int error)
+{
+ /* Only allow an error to be cleared (error==0), but not changed
+ * if there already is an error.
+ */
+ if ((error == 0)
+ || (_pSLang_Error == 0))
+ {
+	Static_Error_Message = NULL;
+	_pSLang_Error = error;
+ }
+
+ if (_pSLinterpreter_Error_Hook != NULL)
+ (*_pSLinterpreter_Error_Hook) (_pSLang_Error);
+}
+
+static void verror_va (int err_code, SLCONST char *fmt, va_list ap)
+{
+ char err 4096;
+
+ if (-1 == _pSLerr_init ())
+ {
+	print_queue ();
+	return;
+ }
+
+ if (err_code == 0)
+ err_code = SL_INTRINSIC_ERROR;
+
+ if (_pSLang_Error == 0)
+ set_error (err_code);
+
+ if (fmt == NULL)
+ return;
+
+ (void) SLvsnprintf (err, sizeof (err), (SLFUTURE_CONST char *)fmt, ap);
+
+ if (Suspend_Error_Messages)
+ (void) queue_message (Active_Error_Queue, err, _SLERR_MSG_ERROR);
+ else
+ print_error (_SLERR_MSG_ERROR, err);
+}
+
+void SLang_verror_va (int err_code, SLFUTURE_CONST char *fmt, va_list ap)
+{
+ verror_va (err_code, fmt, ap);
+}
+
+void SLang_verror (int err_code, SLFUTURE_CONST char *fmt, ...)
+{
+ va_list ap;
+
+ va_start(ap, fmt);
+ verror_va (err_code, fmt, ap);
+ va_end(ap);
+}
+
+void _pSLang_verror (int err_code, SLCONST char *fmt, ...)
+{
+ va_list ap;
+
+ va_start(ap, fmt);
+ verror_va (err_code, fmt, ap);
+ va_end(ap);
+}
+
+int _pSLerr_traceback_msg (SLFUTURE_CONST char *fmt, ...)
+{
+ va_list ap;
+ char msg 4096;
+
+ va_start(ap, fmt);
+ (void) SLvsnprintf (msg, sizeof (msg), fmt, ap);
+ va_end(ap);
+
+ return queue_message (Active_Error_Queue, msg, _SLERR_MSG_TRACEBACK);
+}
+
+void SLang_exit_error (SLFUTURE_CONST char *fmt, ...)
+{
+ va_list ap;
+
+ print_queue ();
+ va_start (ap, fmt);
+ if (SLang_Exit_Error_Hook != NULL)
+ {
+	(*SLang_Exit_Error_Hook) (fmt, ap);
+	exit (1);
+ }
+
+ if (fmt != NULL)
+ {
+	vfprintf (stderr, fmt, ap);
+	fputs ("\n", stderr);
+	fflush (stderr);
+ }
+ va_end (ap);
+
+ exit (1);
+}
+
+int SLang_set_error (int error)
+{
+ set_error (error);
+
+ if (error == 0)
+ return 0;
+
+ if (error == SL_UserBreak_Error)
+ {
+	/* This function may be called from a SIGINT handler, in which case the
+	 * error code will be SL_UserBreak_Error.
+	 */
+	/* print_error (_SLERR_MSG_ERROR, SLerr_strerror (_pSLang_Error)); */
+	Static_Error_Message = SLerr_strerror (error);
+	return 0;
+ }
+
+ /* If a string is not in the message queue, then add one. */
+ if (Active_Error_Queue != NULL)
+ {
+	Error_Message_Type *m = Active_Error_Queue->head;
+	while (m != NULL)
+	 {
+	 if (m->msg_type == _SLERR_MSG_ERROR)
+	 return 0;
+	 m = m->next;
+	 }
+ }
+
+ _pSLang_verror (_pSLang_Error, "%s", SLerr_strerror (_pSLang_Error));
+ return 0;
+}
+
+int SLang_get_error (void)
+{
+ return _pSLang_Error;
+}
+
+void SLang_vmessage (SLFUTURE_CONST char *fmt, ...)
+{
+ va_list ap;
+
+ if (fmt == NULL)
+ return;
+
+ va_start (ap, fmt);
+
+ if (SLang_VMessage_Hook != NULL)
+ (*SLang_VMessage_Hook) (fmt, ap);
+ else
+ {
+	vfprintf (stdout, fmt, ap);
+	fputs ("\n", stdout);
+	(void) fflush (stdout);
+ }
+
+ va_end (ap);
+}
+
+/* This routine does not queue messages. It is used for tracing, etc. */
+void _pSLerr_dump_msg (SLFUTURE_CONST char *fmt, ...)
+{
+ va_list ap;
+
+ va_start (ap, fmt);
+ if (SLang_Dump_Routine != NULL)
+ {
+	char buf1024;
+	(void) SLvsnprintf (buf, sizeof (buf), fmt, ap);
+	(*SLang_Dump_Routine) (buf);
+ }
+ else
+ {
+	vfprintf (stderr, fmt, ap);
+	fflush (stderr);
+ }
+ va_end (ap);
+}
+
+int _pSLerr_set_error_queue (_pSLerr_Error_Queue_Type *q)
+{
+ if (q == NULL)
+ {
+	q = Default_Error_Queue;
+	if (Default_Error_Queue == NULL)
+	 return _pSLerr_init ();
+ }
+ Active_Error_Queue = q;
+ return 0;
+}
+
+#if defined(__WIN32__)
+#include <crtdbg.h> /* For _CrtSetReportMode */
+/* See <https://msdn.microsoft.com/en-us/library/ksazx244%28v=vs.140%29.aspx>
+ * for an explanation of the invalid_parm_handler. The default
+ * handler will cause the program to terminate on code such as:
+ *
+ * FILE *fp = fdopen (fd);
+ * close (fd);
+ * fclose (fp); <--- underlying descriptor has been closed.
+ *
+ * On POSIX systems, fclose will fail with errno == EBADF.
+ */
+static void invalid_parm_handler (const wchar_t* expression,
+				 const wchar_t* function,
+				 const wchar_t* file,
+				 unsigned int line,
+				 uintptr_t pReserved)
+{
+ (void) expression;
+ (void) function;
+ (void) file;
+ (void) line;
+ (void) pReserved;
+}
+#endif
+
+void _pSLerr_deinit (void)
+{
+ deinit_exceptions ();
+ _pSLerr_delete_error_queue (Default_Error_Queue);
+ Suspend_Error_Messages = 0;
+ Default_Error_Queue = NULL;
+ Active_Error_Queue = NULL;
+ Static_Error_Message = NULL;
+}
+
+int _pSLerr_init (void)
+{
+ static int inited = 0;
+
+#ifdef __WIN32__
+ (void) _set_invalid_parameter_handler (invalid_parm_handler);
+ /* Disable the message box for assertions. */
+ _CrtSetReportMode(_CRT_ASSERT, 0);
+#endif
+
+ if (Default_Error_Queue == NULL)
+ {
+	Suspend_Error_Messages = 0;
+	if (NULL == (Default_Error_Queue = _pSLerr_new_error_queue (1)))
+	 return -1;
+ }
+
+ if (-1 == init_exceptions ())
+ return -1;
+
+ if (inited == 0)
+ {
+	inited = 1;
+	(void) SLang_add_cleanup_function (_pSLerr_deinit);
+ }
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slerrno.c Added

@@ -0,0 +1,583 @@
+/* The point of this file is to handle errno values in a system independent
+ * way so that they may be used in slang scripts.
+ */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include <errno.h>
+#include "slang.h"
+#include "_slang.h"
+
+typedef SLCONST struct
+{
+ SLFUTURE_CONST char *msg;
+ int sys_errno;
+ SLFUTURE_CONST char *symbolic_name;
+}
+Errno_Map_Type;
+
+static Errno_Map_Type Errno_Map =
+{
+#ifndef EPERM
+# define EPERM	-1
+#endif
+ {"Operation not permitted",	EPERM,	"EPERM"},
+#ifndef ENOENT
+# define ENOENT	-1
+#endif
+ {"No such file or directory",	ENOENT,	"ENOENT"},
+#ifndef ESRCH
+# define ESRCH	-1
+#endif
+ {"No such process",		ESRCH,	"ESRCH"},
+#ifndef EINTR
+# define EINTR	-1
+#endif
+ {"Interrupted system call",	EINTR,	"EINTR"},
+#ifndef EIO
+# define EIO	-1
+#endif
+ {"I/O error",			EIO,	"EIO"},
+#ifndef ENXIO
+# define ENXIO	-1
+#endif
+ {"No such device or address",	ENXIO,	"ENXIO"},
+#ifndef E2BIG
+# define E2BIG	-1
+#endif
+ {"Arg list too long",		E2BIG,	"E2BIG"},
+#ifndef ENOEXEC
+# define ENOEXEC	-1
+#endif
+ {"Exec format error",		ENOEXEC,"ENOEXEC"},
+#ifndef EBADF
+# define EBADF	-1
+#endif
+ {"Bad file number",		EBADF,	"EBADF"},
+#ifndef ECHILD
+# define ECHILD	-1
+#endif
+ {"No children",			ECHILD,	"ECHILD"},
+#ifndef EAGAIN
+# define EAGAIN	-1
+#endif
+ {"Try again",			EAGAIN,	"EAGAIN"},
+#ifndef ENOMEM
+# define ENOMEM	-1
+#endif
+ {"Not enough core",		ENOMEM,	"ENOMEM"},
+#ifndef EACCES
+# define EACCES	-1
+#endif
+ {"Permission denied",		EACCES,	"EACCES"},
+#ifndef EFAULT
+# define EFAULT	-1
+#endif
+ {"Bad address",			EFAULT,	"EFAULT"},
+#ifndef ENOTBLK
+# define ENOTBLK	-1
+#endif
+ {"Block device required",		ENOTBLK,	"ENOTBLK"},
+#ifndef EBUSY
+# define EBUSY	-1
+#endif
+ {"Mount device busy",		EBUSY,	"EBUSY"},
+#ifndef EEXIST
+# define EEXIST	-1
+#endif
+ {"File exists",			EEXIST,	"EEXIST"},
+#ifndef EXDEV
+# define EXDEV	-1
+#endif
+ {"Cross-device link",		EXDEV,	"EXDEV"},
+#ifndef ENODEV
+# define ENODEV	-1
+#endif
+ {"No such device",			ENODEV,	"ENODEV"},
+#ifndef ENOTDIR
+# define ENOTDIR	-1
+#endif
+ {"Not a directory",		ENOTDIR,	"ENOTDIR"},
+#ifndef EISDIR
+# define EISDIR	-1
+#endif
+ {"Is a directory",			EISDIR,	"EISDIR"},
+#ifndef EINVAL
+# define EINVAL	-1
+#endif
+ {"Invalid argument",		EINVAL,	"EINVAL"},
+#ifndef ENFILE
+# define ENFILE	-1
+#endif
+ {"File table overflow",		ENFILE,	"ENFILE"},
+#ifndef EMFILE
+# define EMFILE	-1
+#endif
+ {"Too many open files",		EMFILE,	"EMFILE"},
+#ifndef ENOTTY
+# define ENOTTY	-1
+#endif
+ {"Not a typewriter",		ENOTTY,	"ENOTTY"},
+#ifndef ETXTBSY
+# define ETXTBSY	-1
+#endif
+ {"Text file busy",			ETXTBSY,	"ETXTBSY"},
+#ifndef EFBIG
+# define EFBIG	-1
+#endif
+ {"File too large",			EFBIG,	"EFBIG"},
+#ifndef ENOSPC
+# define ENOSPC	-1
+#endif
+ {"No space left on device",	ENOSPC,	"ENOSPC"},
+#ifndef ESPIPE
+# define ESPIPE	-1
+#endif
+ {"Illegal seek",			ESPIPE,	"ESPIPE"},
+#ifndef EROFS
+# define EROFS	-1
+#endif
+ {"Read-only file system",		EROFS,	"EROFS"},
+#ifndef EMLINK
+# define EMLINK	-1
+#endif
+ {"Too many links",			EMLINK,	"EMLINK"},
+#ifndef EPIPE
+# define EPIPE	-1
+#endif
+ {"Broken pipe",			EPIPE,	"EPIPE"},
+#ifndef ELOOP
+# define ELOOP	-1
+#endif
+ {"Too many levels of symbolic links",ELOOP,	"ELOOP"},
+#ifndef ENAMETOOLONG
+# define ENAMETOOLONG	-1
+#endif
+ {"File name too long",		ENAMETOOLONG,	"ENAMETOOLONG"},
+#ifndef EDOM
+# define EDOM	-1
+#endif
+ {"Math argument out of domain of func", EDOM,	"EDOM"},
+#ifndef ERANGE
+# define ERANGE	-1
+#endif
+ {"Math result not representable", ERANGE,	"ERANGE"},
+
+#ifndef EDEADLK
+# define EDEADLK	-1
+#endif
+ {"Resource deadlock would occur", EDEADLK,	"EDEADLK"},
+#ifndef ENOLCK
+# define ENOLCK	-1
+#endif
+ {"No record locks available", ENOLCK,	"ENOLCK"},
+#ifndef ENOSYS
+# define ENOSYS	-1
+#endif
+ {"Function not implemented", ENOSYS,	"ENOSYS"},
+#ifndef ENOTEMPTY
+# define ENOTEMPTY	-1
+#endif
+ {"Directory not empty", ENOTEMPTY,	"ENOTEMPTY"},
+#ifndef ENOMSG
+# define ENOMSG	-1
+#endif
+ {" No message of desired type ",	ENOMSG,	"ENOMSG"},
+#ifndef EIDRM
+# define EIDRM	-1
+#endif
+ {" Identifier removed ",	EIDRM,	"EIDRM"},
+#ifndef ECHRNG
+# define ECHRNG	-1
+#endif
+ {" Channel number out of range ",	ECHRNG,	"ECHRNG"},
+#ifndef EL2NSYNC
+# define EL2NSYNC	-1
+#endif
+ {" Level 2 not synchronized ",	EL2NSYNC,	"EL2NSYNC"},
+#ifndef EL3HLT
+# define EL3HLT	-1
+#endif
+ {" Level 3 halted ",	EL3HLT,	"EL3HLT"},
+#ifndef EL3RST
+# define EL3RST	-1
+#endif
+ {" Level 3 reset ",	EL3RST,	"EL3RST"},
+#ifndef ELNRNG
+# define ELNRNG	-1
+#endif
+ {" Link number out of range ",	ELNRNG,	"ELNRNG"},
+#ifndef EUNATCH
+# define EUNATCH	-1
+#endif
+ {" Protocol driver not attached ",	EUNATCH,	"EUNATCH"},
+#ifndef ENOCSI
+# define ENOCSI	-1
+#endif
+ {" No CSI structure available ",	ENOCSI,	"ENOCSI"},
+#ifndef EL2HLT
+# define EL2HLT	-1
+#endif
+ {" Level 2 halted ",	EL2HLT,	"EL2HLT"},
+#ifndef EBADE
+# define EBADE	-1
+#endif
+ {" Invalid exchange ",	EBADE,	"EBADE"},
+#ifndef EBADR
+# define EBADR	-1
+#endif
+ {" Invalid request descriptor ",	EBADR,	"EBADR"},
+#ifndef EXFULL
+# define EXFULL	-1
+#endif
+ {" Exchange full ",	EXFULL,	"EXFULL"},
+#ifndef ENOANO
+# define ENOANO	-1
+#endif
+ {" No anode ",	ENOANO,	"ENOANO"},
+#ifndef EBADRQC
+# define EBADRQC	-1
+#endif
+ {" Invalid request code ",	EBADRQC,	"EBADRQC"},
+#ifndef EBADSLT
+# define EBADSLT	-1
+#endif
+ {" Invalid slot ",	EBADSLT,	"EBADSLT"},
+#ifndef EBFONT
+# define EBFONT	-1
+#endif
+ {" Bad font file format ",	EBFONT,	"EBFONT"},
+#ifndef ENOSTR
+# define ENOSTR	-1
+#endif
+ {" Device not a stream ",	ENOSTR,	"ENOSTR"},
+#ifndef ENODATA
+# define ENODATA	-1
+#endif
+ {" No data available ",	ENODATA,	"ENODATA"},
+#ifndef ETIME
+# define ETIME	-1
+#endif
+ {" Timer expired ",	ETIME,	"ETIME"},
+#ifndef ENOSR
+# define ENOSR	-1
+#endif
+ {" Out of streams resources ",	ENOSR,	"ENOSR"},
+#ifndef ENONET
+# define ENONET	-1
+#endif
+ {" Machine is not on the network ",	ENONET,	"ENONET"},
+#ifndef ENOPKG
+# define ENOPKG	-1
+#endif
+ {" Package not installed ",	ENOPKG,	"ENOPKG"},
+#ifndef EREMOTE
+# define EREMOTE	-1
+#endif
+ {" Object is remote ",	EREMOTE,	"EREMOTE"},
+#ifndef ENOLINK
+# define ENOLINK	-1
+#endif
+ {" Link has been severed ",	ENOLINK,	"ENOLINK"},
+#ifndef EADV
+# define EADV	-1
+#endif
+ {" Advertise error ",	EADV,	"EADV"},
+#ifndef ESRMNT
+# define ESRMNT	-1
+#endif
+ {" Srmount error ",	ESRMNT,	"ESRMNT"},
+#ifndef ECOMM
+# define ECOMM	-1
+#endif
+ {" Communication error on send ",	ECOMM,	"ECOMM"},
+#ifndef EPROTO
+# define EPROTO	-1
+#endif
+ {" Protocol error ",	EPROTO,	"EPROTO"},
+#ifndef EMULTIHOP
+# define EMULTIHOP	-1
+#endif
+ {" Multihop attempted ",	EMULTIHOP,	"EMULTIHOP"},
+#ifndef EDOTDOT
+# define EDOTDOT	-1
+#endif
+ {" RFS specific error ",	EDOTDOT,	"EDOTDOT"},
+#ifndef EBADMSG
+# define EBADMSG	-1
+#endif
+ {" Not a data message ",	EBADMSG,	"EBADMSG"},
+#ifndef EOVERFLOW
+# define EOVERFLOW	-1
+#endif
+ {" Value too large for defined data type ",	EOVERFLOW,	"EOVERFLOW"},
+#ifndef ENOTUNIQ
+# define ENOTUNIQ	-1
+#endif
+ {" Name not unique on network ",	ENOTUNIQ,	"ENOTUNIQ"},
+#ifndef EBADFD
+# define EBADFD	-1
+#endif
+ {" File descriptor in bad state ",	EBADFD,	"EBADFD"},
+#ifndef EREMCHG
+# define EREMCHG	-1
+#endif
+ {" Remote address changed ",	EREMCHG,	"EREMCHG"},
+#ifndef ELIBACC
+# define ELIBACC	-1
+#endif
+ {" Can not access a needed shared library ",	ELIBACC,	"ELIBACC"},
+#ifndef ELIBBAD
+# define ELIBBAD	-1
+#endif
+ {" Accessing a corrupted shared library ",	ELIBBAD,	"ELIBBAD"},
+#ifndef ELIBSCN
+# define ELIBSCN	-1
+#endif
+ {" .lib section in a.out corrupted ",	ELIBSCN,	"ELIBSCN"},
+#ifndef ELIBMAX
+# define ELIBMAX	-1
+#endif
+ {" Attempting to link in too many shared libraries ",	ELIBMAX,	"ELIBMAX"},
+#ifndef ELIBEXEC
+# define ELIBEXEC	-1
+#endif
+ {" Cannot exec a shared library directly ",	ELIBEXEC,	"ELIBEXEC"},
+#ifndef EILSEQ
+# define EILSEQ	-1
+#endif
+ {" Illegal byte sequence ",	EILSEQ,	"EILSEQ"},
+#ifndef ERESTART
+# define ERESTART	-1
+#endif
+ {" Interrupted system call should be restarted ",	ERESTART,	"ERESTART"},
+#ifndef ESTRPIPE
+# define ESTRPIPE	-1
+#endif
+ {" Streams pipe error ",	ESTRPIPE,	"ESTRPIPE"},
+#ifndef EUSERS
+# define EUSERS	-1
+#endif
+ {" Too many users ",	EUSERS,	"EUSERS"},
+#ifndef ENOTSOCK
+# define ENOTSOCK	-1
+#endif
+ {" Socket operation on non-socket ",	ENOTSOCK,	"ENOTSOCK"},
+#ifndef EDESTADDRREQ
+# define EDESTADDRREQ	-1
+#endif
+ {" Destination address required ",	EDESTADDRREQ,	"EDESTADDRREQ"},
+#ifndef EMSGSIZE
+# define EMSGSIZE	-1
+#endif
+ {" Message too long ",	EMSGSIZE,	"EMSGSIZE"},
+#ifndef EPROTOTYPE
+# define EPROTOTYPE	-1
+#endif
+ {" Protocol wrong type for socket ",	EPROTOTYPE,	"EPROTOTYPE"},
+#ifndef ENOPROTOOPT
+# define ENOPROTOOPT	-1
+#endif
+ {" Protocol not available ",	ENOPROTOOPT,	"ENOPROTOOPT"},
+#ifndef EPROTONOSUPPORT
+# define EPROTONOSUPPORT	-1
+#endif
+ {" Protocol not supported ",	EPROTONOSUPPORT,	"EPROTONOSUPPORT"},
+#ifndef ESOCKTNOSUPPORT
+# define ESOCKTNOSUPPORT	-1
+#endif
+ {" Socket type not supported ",	ESOCKTNOSUPPORT,	"ESOCKTNOSUPPORT"},
+#ifndef EOPNOTSUPP
+# define EOPNOTSUPP	-1
+#endif
+ {" Operation not supported on transport endpoint ",	EOPNOTSUPP,	"EOPNOTSUPP"},
+#ifndef EPFNOSUPPORT
+# define EPFNOSUPPORT	-1
+#endif
+ {" Protocol family not supported ",	EPFNOSUPPORT,	"EPFNOSUPPORT"},
+#ifndef EAFNOSUPPORT
+# define EAFNOSUPPORT	-1
+#endif
+ {" Address family not supported by protocol ",	EAFNOSUPPORT,	"EAFNOSUPPORT"},
+#ifndef EADDRINUSE
+# define EADDRINUSE	-1
+#endif
+ {" Address already in use ",	EADDRINUSE,	"EADDRINUSE"},
+#ifndef EADDRNOTAVAIL
+# define EADDRNOTAVAIL	-1
+#endif
+ {" Cannot assign requested address ",	EADDRNOTAVAIL,	"EADDRNOTAVAIL"},
+#ifndef ENETDOWN
+# define ENETDOWN	-1
+#endif
+ {" Network is down ",	ENETDOWN,	"ENETDOWN"},
+#ifndef ENETUNREACH
+# define ENETUNREACH	-1
+#endif
+ {" Network is unreachable ",	ENETUNREACH,	"ENETUNREACH"},
+#ifndef ENETRESET
+# define ENETRESET	-1
+#endif
+ {" Network dropped connection because of reset ",	ENETRESET,	"ENETRESET"},
+#ifndef ECONNABORTED
+# define ECONNABORTED	-1
+#endif
+ {" Software caused connection abort ",	ECONNABORTED,	"ECONNABORTED"},
+#ifndef ECONNRESET
+# define ECONNRESET	-1
+#endif
+ {" Connection reset by peer ",	ECONNRESET,	"ECONNRESET"},
+#ifndef ENOBUFS
+# define ENOBUFS	-1
+#endif
+ {" No buffer space available ",	ENOBUFS,	"ENOBUFS"},
+#ifndef EISCONN
+# define EISCONN	-1
+#endif
+ {" Transport endpoint is already connected ",	EISCONN,	"EISCONN"},
+#ifndef ENOTCONN
+# define ENOTCONN	-1
+#endif
+ {" Transport endpoint is not connected ",	ENOTCONN,	"ENOTCONN"},
+#ifndef ESHUTDOWN
+# define ESHUTDOWN	-1
+#endif
+ {" Cannot send after transport endpoint shutdown ",	ESHUTDOWN,	"ESHUTDOWN"},
+#ifndef ETOOMANYREFS
+# define ETOOMANYREFS	-1
+#endif
+ {" Too many references: cannot splice ",	ETOOMANYREFS,	"ETOOMANYREFS"},
+#ifndef ETIMEDOUT
+# define ETIMEDOUT	-1
+#endif
+ {" Connection timed out ",	ETIMEDOUT,	"ETIMEDOUT"},
+#ifndef ECONNREFUSED
+# define ECONNREFUSED	-1
+#endif
+ {" Connection refused ",	ECONNREFUSED,	"ECONNREFUSED"},
+#ifndef EHOSTDOWN
+# define EHOSTDOWN	-1
+#endif
+ {" Host is down ",	EHOSTDOWN,	"EHOSTDOWN"},
+#ifndef EHOSTUNREACH
+# define EHOSTUNREACH	-1
+#endif
+ {" No route to host ",	EHOSTUNREACH,	"EHOSTUNREACH"},
+#ifndef EALREADY
+# define EALREADY	-1
+#endif
+ {" Operation already in progress ",	EALREADY,	"EALREADY"},
+#ifndef EINPROGRESS
+# define EINPROGRESS	-1
+#endif
+ {" Operation now in progress ",	EINPROGRESS,	"EINPROGRESS"},
+#ifndef ESTALE
+# define ESTALE	-1
+#endif
+ {" Stale NFS file handle ",	ESTALE,	"ESTALE"},
+#ifndef EUCLEAN
+# define EUCLEAN	-1
+#endif
+ {" Structure needs cleaning ",	EUCLEAN,	"EUCLEAN"},
+#ifndef ENOTNAM
+# define ENOTNAM	-1
+#endif
+ {" Not a XENIX named type file ",	ENOTNAM,	"ENOTNAM"},
+#ifndef ENAVAIL
+# define ENAVAIL	-1
+#endif
+ {" No XENIX semaphores available ",	ENAVAIL,	"ENAVAIL"},
+#ifndef EISNAM
+# define EISNAM	-1
+#endif
+ {" Is a named type file ",	EISNAM,	"EISNAM"},
+#ifndef EREMOTEIO
+# define EREMOTEIO	-1
+#endif
+ {" Remote I/O error ",	EREMOTEIO,	"EREMOTEIO"},
+#ifndef EDQUOT
+# define EDQUOT	-1
+#endif
+ {" Quota exceeded ",	EDQUOT,	"EDQUOT"},
+#ifndef ENOMEDIUM
+# define ENOMEDIUM	-1
+#endif
+ {" No medium found ",	ENOMEDIUM,	"ENOMEDIUM"},
+#ifndef EMEDIUMTYPE
+# define EMEDIUMTYPE	-1
+#endif
+ {" Wrong medium type ",	EMEDIUMTYPE,	"EMEDIUMTYPE"},
+ {NULL, 0, NULL}
+};
+
+SLFUTURE_CONST char *SLerrno_strerror (int sys_errno)
+{
+ Errno_Map_Type *e;
+
+ e = Errno_Map;
+ while (e->msg != NULL)
+ {
+	if (e->sys_errno == sys_errno)
+	 return e->msg;
+
+	e++;
+ }
+
+ if (sys_errno == SL_ERRNO_NOT_IMPLEMENTED)
+ return "System call not available for this platform";
+
+ return "Unknown error";
+}
+
+static SLCONST char *intrin_errno_string (void)
+{
+ int e;
+ if (SLang_Num_Function_Args == 0)
+ return SLerrno_strerror (_pSLerrno_errno);
+ if (-1 == SLang_pop_int (&e))
+ return NULL;
+ return SLerrno_strerror (e);
+}
+
+int _pSLerrno_init (void)
+{
+ static Errno_Map_Type *e;
+
+ if (e != NULL)		 /* already initialized */
+ return 0;
+
+ if ((-1 == SLadd_intrinsic_function ("errno_string", (FVOID_STAR) intrin_errno_string,
+					SLANG_STRING_TYPE, 0))
+ || (-1 == SLadd_intrinsic_variable ("errno", (VOID_STAR)&_pSLerrno_errno, SLANG_INT_TYPE, 1)))
+ return -1;
+
+ e = Errno_Map;
+ while (e->msg != NULL)
+ {
+	if (-1 == SLadd_intrinsic_variable (e->symbolic_name, (VOID_STAR) &e->sys_errno, SLANG_INT_TYPE, 1))
+	 return -1;
+	e++;
+ }
+
+ return 0;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slexcept.c Added

@@ -0,0 +1,497 @@
+/* Exception Handling */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#ifndef _GNU_SOURCE
+# define _GNU_SOURCE
+#endif
+#include "slinclud.h"
+
+#include "slang.h"
+
+#ifdef HAVE_LOCALE_H
+# include <locale.h>
+#endif
+
+#include "_slang.h"
+
+static SLang_Object_Type *Object_Thrownp = NULL;
+static SLang_Object_Type Object_Thrown;
+static SLCONST char *File_With_Error = NULL;
+static SLCONST char *Function_With_Error = NULL;
+static SLCONST char *Last_Function_With_Error = NULL; /* either slstring or "<top-level>" */
+static _pSLerr_Error_Queue_Type *Error_Message_Queue;
+
+static int Linenum_With_Error = -1;
+
+static void free_thrown_object (void)
+{
+ if (Object_Thrownp != NULL)
+ {
+	SLang_free_object (Object_Thrownp);
+	Object_Thrownp = NULL;
+ }
+}
+
+typedef struct Error_Context_Type
+{
+ int err;
+ int err_cleared;
+ int rethrow;
+ int linenum;
+ SLCONST char *file;
+ SLCONST char *function;
+ _pSLerr_Error_Queue_Type *err_queue;
+ int object_was_thrown;
+ SLang_Object_Type object_thrown;
+ struct Error_Context_Type *next;
+}
+Error_Context_Type;
+
+static Error_Context_Type *Error_Context;
+
+int _pSLang_push_error_context (void)
+{
+ Error_Context_Type *c;
+
+ if (NULL == (c = (Error_Context_Type *)SLmalloc (sizeof (Error_Context_Type))))
+ return -1;
+
+ c->next = Error_Context;
+ c->err = _pSLang_Error;
+ c->err_cleared = 0;
+ c->rethrow = 0;
+ c->file = File_With_Error;
+ c->function = Function_With_Error; /* steal pointers */
+ c->linenum = Linenum_With_Error;
+ c->err_queue = Error_Message_Queue;
+
+ File_With_Error = NULL;
+ Function_With_Error = NULL;
+ Linenum_With_Error = -1;
+
+ if (NULL == (Error_Message_Queue = _pSLerr_new_error_queue (1)))
+ {
+	Error_Message_Queue = c->err_queue;
+	SLfree ((char *) c);
+	return -1;
+ }
+
+ Error_Context = c;
+ SLKeyBoard_Quit = 0;
+
+ c->object_was_thrown = (Object_Thrownp != NULL);
+ if (c->object_was_thrown)
+ {
+	c->object_thrown = Object_Thrown;
+	Object_Thrownp = NULL;
+ }
+
+ if (-1 == SLang_set_error (0))
+ {
+	_pSLang_pop_error_context (1);
+	return -1;
+ }
+ return 0;
+}
+
+/* this will be called with use_current_queue set to 0 if the catch block
+ * was processed with no error. If an error occurs processing the catch
+ * block, then that error will take precedence over the one triggering the
+ * catch block. However, if the original error is rethrown, then this routine
+ * will still be called with use_current_queue non-zero since all the caller
+ * knows is that an error occured and cannot tell if it was a rethrow.
+ */
+int _pSLang_pop_error_context (int use_current_queue)
+{
+ Error_Context_Type *e;
+
+ e = Error_Context;
+ if (e == NULL)
+ return -1;
+
+ Error_Context = e->next;
+
+ if ((use_current_queue == 0) || (e->rethrow))
+ {
+	(void) _pSLerr_set_error_queue (e->err_queue);
+	_pSLerr_delete_error_queue (Error_Message_Queue);
+	Error_Message_Queue = e->err_queue;
+	free_thrown_object ();
+	if (e->object_was_thrown)
+	 {
+	 Object_Thrownp = &Object_Thrown;
+	 Object_Thrown = e->object_thrown;
+	 }
+ }
+ else
+ {
+	_pSLerr_delete_error_queue (e->err_queue);
+	if (e->object_was_thrown)
+	 SLang_free_object (&e->object_thrown);
+ }
+
+ if (_pSLang_Error == 0)
+ {
+	if (e->err_cleared)/* ERROR_BLOCK */
+	 _pSLerr_free_queued_messages ();
+	else
+	 {
+	 SLang_free_slstring ((char *)File_With_Error);
+	 SLang_free_slstring ((char *)Function_With_Error);
+	 File_With_Error = e->file; e->file = NULL;
+	 Function_With_Error = e->function; e->function = NULL;
+	 Linenum_With_Error = e->linenum;
+	 (void) SLang_set_error (e->err);
+	 }
+ }
+
+ if (_pSLang_Error == SL_UserBreak_Error)
+ SLKeyBoard_Quit = 1;
+
+ SLang_free_slstring ((char *) e->file);
+ SLang_free_slstring ((char *) e->function);
+
+ SLfree ((char *) e);
+ return 0;
+}
+
+int _pSLerr_get_last_error (void)
+{
+ Error_Context_Type *e;
+
+ e = Error_Context;
+ if (e == NULL)
+ return 0;
+ return e->err;
+}
+
+static void do_file_line_funct_error (SLCONST char *file, int linenum, SLCONST char *function)
+{
+ if ((file == NULL) || (_pSLang_Error == 0))
+ return;
+
+ if (Last_Function_With_Error == function)	 /* either slstring or "<top-level>" */
+ return;
+ Last_Function_With_Error = function;
+ if (SLang_Traceback && *function)
+ _pSLerr_traceback_msg ("%s:%d:%s:%s\n", file, linenum, function, SLerr_strerror (_pSLang_Error));
+}
+
+int _pSLerr_set_line_info (SLFUTURE_CONST char *file, int linenum, SLFUTURE_CONST char *fun)
+{
+ if (linenum == 0)
+ linenum = -1;
+
+ if (0 == (SLang_Traceback == SL_TB_FULL))
+ {
+	if ((File_With_Error != NULL) && (Linenum_With_Error != -1))
+	 return 0;
+	if ((linenum == -1) && (file == NULL))
+	 return 0;
+ }
+
+ if (fun == NULL)
+ fun = "<top-level>";
+
+ do_file_line_funct_error (file, linenum, fun);
+
+ if (File_With_Error != NULL)
+ return 0;
+
+ Linenum_With_Error = linenum;
+ if (file != NULL)
+ {
+	if (NULL == (file = SLang_create_slstring (file)))
+	 return -1;
+ }
+ if (NULL == (fun = SLang_create_slstring (fun)))
+ {
+	SLang_free_slstring ((char *) file); /* NULL ok */
+	return -1;
+ }
+
+ SLang_free_slstring ((char *)File_With_Error);
+ SLang_free_slstring ((char *)Function_With_Error);
+
+ File_With_Error = file;
+ Function_With_Error = fun;
+
+#if SLANG_HAS_BOSEOS && SLANG_HAS_DEBUGGER_SUPPORT
+ (void) _pSLcall_debug_hook (file, linenum);
+#endif
+
+ return 0;
+}
+
+static int _pSLerr_get_last_error_line_info (SLCONST char **filep, int *linep, SLCONST char **funp)
+{
+ Error_Context_Type *e = Error_Context;
+ if (e == NULL)
+ {
+	*filep = NULL;
+	*linep = -1;
+	*funp = NULL;
+	return -1;
+ }
+ *filep = e->file;
+ *linep = e->linenum;
+ *funp = e->function;
+ return 0;
+}
+
+static char *get_error_msg_from_queue (int type)
+{
+ Error_Context_Type *e = Error_Context;
+
+ if (e == NULL)
+ return NULL;
+
+ return _pSLerr_get_error_from_queue (e->err_queue, type);
+}
+
+void (*SLang_User_Clear_Error)(void) = NULL;
+void _pSLerr_clear_error (int set_clear_err_flag)
+{
+ SLang_set_error (0);
+ free_thrown_object ();
+
+ if ((Error_Context != NULL)
+ && (set_clear_err_flag))
+ {
+	/* This is used only for error blocks */
+	Error_Context->err_cleared = 1;
+ }
+
+ SLang_free_slstring ((char *) File_With_Error); File_With_Error = NULL;
+ SLang_free_slstring ((char *) Function_With_Error); Function_With_Error = NULL;
+ Linenum_With_Error = -1;
+ Last_Function_With_Error = NULL;
+ if (SLang_User_Clear_Error != NULL) (*SLang_User_Clear_Error)();
+ _pSLerr_free_queued_messages ();
+}
+
+static int rethrow_error (void)
+{
+ Error_Context_Type *e = Error_Context;
+
+ if (e == NULL)
+ return 0;
+
+ SLang_set_error (e->err);
+ e->rethrow=1;
+ e->err_cleared = 0;
+ return 0;
+}
+
+int _pSLerr_throw (void)
+{
+ int e;
+ int nargs = SLang_Num_Function_Args;
+ char *msg = NULL;
+
+ free_thrown_object ();
+
+ switch (nargs)
+ {
+ case 3:
+	if (-1 == SLang_pop (&Object_Thrown))
+	 return -1;
+	Object_Thrownp = &Object_Thrown;
+	/* drop */
+ case 2:
+	if (-1 == SLang_pop_slstring (&msg))
+	 {
+	 free_thrown_object ();
+	 return -1;
+	 }
+ case 1:
+	/* drop */
+	if (-1 == _pSLerr_pop_exception (&e))
+	 {
+	 SLang_free_slstring (msg);/* NULL ok */
+	 free_thrown_object ();
+	 return -1;
+	 }
+	break;
+
+ case 0:			 /* rethrow */
+	return rethrow_error ();
+
+ default:
+	_pSLang_verror (SL_NumArgs_Error, "expecting: throw error , optional-message , optional-arg");
+	return -1;
+ }
+
+ if (msg != NULL)
+ {
+	_pSLang_verror (e, "%s", msg);
+	SLang_free_slstring (msg);
+ }
+ else
+ SLang_set_error (e);
+
+ return 0;
+}
+
+int SLerr_throw (int err, SLFUTURE_CONST char *msg, SLtype obj_type, VOID_STAR objptr)
+{
+ free_thrown_object ();
+
+ if ((obj_type != 0) || (objptr != NULL))
+ {
+	if (-1 == SLang_push_value (obj_type, objptr))
+	 return -1;
+	if (-1 == SLang_pop (&Object_Thrown))
+	 return -1;
+	Object_Thrownp = &Object_Thrown;
+ }
+
+ if (msg != NULL)
+ _pSLang_verror (err, "%s", msg);
+ else
+ SLang_set_error (err);
+
+ return 0;
+}
+
+static void new_exception (char *name, int *baseclass, char *description)
+{
+ (void) SLerr_new_exception (*baseclass, name, description);
+}
+
+static void get_exception_info_intrinsic (void)
+{
+#define NUM_EXCEPT_FIELDS 8
+ static SLFUTURE_CONST char *field_namesNUM_EXCEPT_FIELDS =
+ {
+	"error", "descr", "file", "line", "function", "object", "message", "traceback"
+ };
+ SLtype field_typesNUM_EXCEPT_FIELDS;
+ VOID_STAR field_valuesNUM_EXCEPT_FIELDS;
+ int err;
+ SLCONST char *desc;
+ SLCONST char *file;
+ SLCONST char *function;
+ SLCONST char *errmsg;
+ SLCONST char *tbmsg;
+ int linenum;
+
+ err = _pSLerr_get_last_error ();
+ if (err == 0)
+ {
+	(void) SLang_push_null ();
+	return;
+ }
+
+ desc = SLerr_strerror (err);
+ (void) _pSLerr_get_last_error_line_info (&file, &linenum, &function);
+
+ field_types0 = SLANG_INT_TYPE;
+ field_values0 = (VOID_STAR) &err;
+
+ field_types1 = SLANG_STRING_TYPE;
+ field_values1 = (VOID_STAR) &desc;
+
+ field_types2 = SLANG_STRING_TYPE;
+ field_values2 = (VOID_STAR) &file;
+
+ field_types3 = SLANG_INT_TYPE;
+ field_values3 = (VOID_STAR) &linenum;
+
+ field_types4 = SLANG_STRING_TYPE;
+ field_values4 = (VOID_STAR) &function;
+
+ if ((Error_Context == NULL)
+ || (Error_Context->object_was_thrown == 0))
+ {
+	char *null = NULL;
+	field_types5 = SLANG_NULL_TYPE;
+	field_values5 = (VOID_STAR) &null;
+ }
+ else
+ {
+	SLtype data_type = Error_Context->object_thrown.o_data_type;
+	field_types5 = data_type;
+	field_values5 = _pSLclass_get_ptr_to_value (_pSLclass_get_class (data_type),
+						 &Error_Context->object_thrown);
+ }
+ errmsg = get_error_msg_from_queue (_SLERR_MSG_ERROR);
+ if ((errmsg == NULL) || (*errmsg == 0))
+ errmsg = desc;
+ field_types6 = SLANG_STRING_TYPE;
+ field_values6 = (VOID_STAR) &errmsg;
+
+ tbmsg = get_error_msg_from_queue (_SLERR_MSG_TRACEBACK);
+ field_types7 = (tbmsg == NULL) ? SLANG_NULL_TYPE : SLANG_STRING_TYPE;
+ field_values7 = (VOID_STAR) &tbmsg;
+
+ (void) SLstruct_create_struct (NUM_EXCEPT_FIELDS, field_names, field_types, field_values);
+ if (errmsg != desc)
+ SLang_free_slstring ((char *) errmsg);
+ SLang_free_slstring ((char *)tbmsg);
+}
+
+int _pSLerr_pop_exception (int *e)
+{
+ return SLang_pop_integer (e);
+}
+
+static int new_exception_hook (SLFUTURE_CONST char *name, SLFUTURE_CONST char *desc, int err_code)
+{
+ SLang_IConstant_Type *ic;
+
+ (void) desc;
+ if (NULL != (ic = (SLang_IConstant_Type *)_pSLlocate_name (name)))
+ {
+	if ((ic->name_type != SLANG_ICONSTANT)
+	 || (ic->value != err_code))
+	 {
+	 _pSLang_verror (SL_RunTime_Error, "Exception %s already exists and may not be redefined", name);
+	 return -1;
+	 }
+	return 0;
+ }
+
+ if (-1 == SLns_add_iconstant (NULL, name, SLANG_INT_TYPE, err_code))
+ return -1;
+
+ return 0;
+}
+
+static SLang_Intrin_Fun_Type Except_Table =
+{
+ MAKE_INTRINSIC_0("__get_exception_info", get_exception_info_intrinsic, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_SIS("new_exception", new_exception, SLANG_VOID_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+int _pSLang_init_exceptions (void)
+{
+ _pSLerr_New_Exception_Hook = new_exception_hook;
+ if (-1 == _pSLerr_init_interp_exceptions ())
+ return -1;
+
+ if (-1 == SLadd_intrin_fun_table(Except_Table, NULL))
+ return -1;
+
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slfile.c Added

@@ -0,0 +1,38 @@
+/* file stdio intrinsics for S-Lang */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+/* Compatibility */
+int SLang_init_slfile (void)
+{
+   if ((-1 == SLang_init_stdio ())
+       || (-1 == SLang_init_posix_dir ())
+       || (-1 == SLdefine_for_ifdef("__SLFILE__")))
+     return -1;
+
+   return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slfpu.c Added

@@ -0,0 +1,107 @@
+/* Floating point exceptions */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include <float.h>
+#include <math.h>
+
+#ifdef HAVE_FLOATINGPOINT_H
+# include <floatingpoint.h>
+#endif
+
+#ifdef HAVE_FENV_H
+# include <fenv.h>
+#endif
+
+#ifdef HAVE_IEEEFP_H
+# include <ieeefp.h>
+#endif
+
+#include "slang.h"
+#include "_slang.h"
+
+#ifdef HAVE_FECLEAREXCEPT
+# define CLEAR_FP_EXCEPTION	(void)feclearexcept(FE_ALL_EXCEPT);
+# define GET_FP_EXCEPTION	fetestexcept(FE_ALL_EXCEPT)
+# ifndef FE_DIVBYZERO
+# define FE_DIVBYZERO	0
+# endif
+# ifndef FE_INVALID
+# define FE_INVALID	0
+# endif
+# ifndef FE_OVERFLOW
+# define FE_OVERFLOW	0
+# endif
+# ifndef FE_UNDERFLOW
+# define FE_UNDERFLOW	0
+# endif
+# ifndef FE_INEXACT
+# define FE_INEXACT	0
+# endif
+# define SYS_FE_DIVBYZERO	FE_DIVBYZERO
+# define SYS_FE_INVALID		FE_INVALID
+# define SYS_FE_OVERFLOW	FE_OVERFLOW
+# define SYS_FE_UNDERFLOW	FE_UNDERFLOW
+# define SYS_FE_INEXACT		FE_INEXACT
+#else
+# ifdef HAVE_FPSETSTICKY
+# define CLEAR_FP_EXCEPTION	(void)fpsetsticky(0)
+# define GET_FP_EXCEPTION	fpgetsticky()
+# define SYS_FE_DIVBYZERO	FP_X_DZ
+# define SYS_FE_INVALID	FP_X_INV
+# define SYS_FE_OVERFLOW	FP_X_OFL
+# define SYS_FE_UNDERFLOW	FP_X_UFL
+# define SYS_FE_INEXACT	FP_X_IMP
+# else
+/* ??? */
+# define CLEAR_FP_EXCEPTION	(void)0
+# define GET_FP_EXCEPTION	(0)
+# define SYS_FE_DIVBYZERO	0
+# define SYS_FE_INVALID	0
+# define SYS_FE_OVERFLOW	0
+# define SYS_FE_UNDERFLOW	0
+# define SYS_FE_INEXACT	0
+# endif
+#endif
+
+void SLfpu_clear_except_bits (void)
+{
+ CLEAR_FP_EXCEPTION;
+}
+
+unsigned int SLfpu_test_except_bits (unsigned int bits)
+{
+ unsigned int rbits;
+ unsigned long sysbits;
+
+ sysbits = GET_FP_EXCEPTION;
+
+ rbits = 0;
+ if (sysbits & SYS_FE_DIVBYZERO) rbits |= SL_FE_DIVBYZERO;
+ if (sysbits & SYS_FE_INVALID) rbits |= SL_FE_INVALID;
+ if (sysbits & SYS_FE_OVERFLOW) rbits |= SL_FE_OVERFLOW;
+ if (sysbits & SYS_FE_UNDERFLOW) rbits |= SL_FE_UNDERFLOW;
+ if (sysbits & SYS_FE_INEXACT) rbits |= SL_FE_INEXACT;
+
+ return rbits & bits;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slgetkey.c Added

@@ -0,0 +1,319 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+unsigned int SLang_Input_Buffer_Len = 0;
+unsigned char SLang_Input_Buffer SL_MAX_INPUT_BUFFER_LEN;
+
+int SLang_Abort_Char = 7;
+int SLang_Ignore_User_Abort = 0;
+
+/* This has the effect of mapping all characters in the range 128-169 to
+ * ESC something
+ */
+
+unsigned int SLang_getkey (void)
+{
+ unsigned int ch;
+
+ if (SLang_Input_Buffer_Len)
+ {
+	unsigned int imax;
+	ch = (unsigned int) *SLang_Input_Buffer;
+	SLang_Input_Buffer_Len--;
+	imax = SLang_Input_Buffer_Len;
+
+	SLMEMCPY ((char *) SLang_Input_Buffer,
+		(char *) (SLang_Input_Buffer + 1), imax);
+ }
+ else if (SLANG_GETKEY_ERROR == (ch = _pSLsys_getkey ())) return ch;
+
+#if SLANG_MAP_VTXXX_8BIT
+# if !defined(IBMPC_SYSTEM)
+ if (ch & 0x80)
+ {
+	unsigned char i;
+	i = (unsigned char) (ch & 0x7F);
+	if (i < ' ')
+	 {
+	 i += 64;
+	 SLang_ungetkey (i);
+	 ch = 27;
+	 }
+ }
+# endif
+#endif
+ return(ch);
+}
+
+int SLang_ungetkey_string (unsigned char *s, unsigned int n)
+{
+ register unsigned char *bmax, *b, *b1;
+ if (SLang_Input_Buffer_Len + n + 3 > SL_MAX_INPUT_BUFFER_LEN)
+ return -1;
+
+ b = SLang_Input_Buffer;
+ bmax = (b - 1) + SLang_Input_Buffer_Len;
+ b1 = bmax + n;
+ while (bmax >= b) *b1-- = *bmax--;
+ bmax = b + n;
+ while (b < bmax) *b++ = *s++;
+ SLang_Input_Buffer_Len += n;
+ return 0;
+}
+
+int SLang_buffer_keystring (unsigned char *s, unsigned int n)
+{
+
+ if (n + SLang_Input_Buffer_Len + 3 > SL_MAX_INPUT_BUFFER_LEN) return -1;
+
+ SLMEMCPY ((char *) SLang_Input_Buffer + SLang_Input_Buffer_Len,
+	 (char *) s, n);
+ SLang_Input_Buffer_Len += n;
+ return 0;
+}
+
+int SLang_ungetkey (unsigned char ch)
+{
+ return SLang_ungetkey_string(&ch, 1);
+}
+
+int SLang_input_pending (int tsecs)
+{
+ int n;
+ unsigned char c;
+ if (SLang_Input_Buffer_Len) return (int) SLang_Input_Buffer_Len;
+
+ n = _pSLsys_input_pending (tsecs);
+
+ if (n <= 0) return 0;
+
+ c = (unsigned char) SLang_getkey ();
+ SLang_ungetkey_string (&c, 1);
+
+ return n;
+}
+
+void SLang_flush_input (void)
+{
+ int quit = SLKeyBoard_Quit;
+
+ SLang_Input_Buffer_Len = 0;
+ SLKeyBoard_Quit = 0;
+ while (_pSLsys_input_pending (0) > 0)
+ {
+	(void) _pSLsys_getkey ();
+	/* Set this to 0 because _pSLsys_getkey may stuff keyboard buffer if
+	 * key sends key sequence (OS/2, DOS, maybe VMS).
+	 */
+	SLang_Input_Buffer_Len = 0;
+ }
+ SLKeyBoard_Quit = quit;
+}
+
+#ifdef IBMPC_SYSTEM
+static int Map_To_ANSI;
+int SLgetkey_map_to_ansi (int enable)
+{
+ Map_To_ANSI = enable;
+ return 0;
+}
+
+static int convert_scancode (unsigned int scan,
+			 unsigned int shift,
+			 int getkey,
+			 unsigned int *ret_key)
+{
+ unsigned char buf16;
+ unsigned char *b;
+ unsigned char end;
+ int is_arrow;
+
+ shift &= (_pSLTT_KEY_ALT|_pSLTT_KEY_SHIFT|_pSLTT_KEY_CTRL);
+
+ b = buf;
+ if (_pSLTT_KEY_ALT == shift)
+ {
+	shift = 0;
+	*b++ = 27;
+ }
+ *b++ = 27;
+ *b++ = '';
+
+ is_arrow = 0;
+ end = '~';
+ if (shift)
+ {
+	if (shift == _pSLTT_KEY_CTRL)
+	 end = '^';
+	else if (shift == _pSLTT_KEY_SHIFT)
+	 end = '$';
+	else shift = 0;
+ }
+
+ /* These mappings correspond to what rxvt produces under Linux */
+ switch (scan & 0xFF)
+ {
+ default:
+	return -1;
+
+ case 0x47:		 /* home */
+	*b++ = '1';
+	break;
+ case 0x48:		 /* up */
+	end = 'A';
+	is_arrow = 1;
+	break;
+ case 0x49:		 /* PgUp */
+	*b++ = '5';
+	break;
+ case 0x4B:		 /* Left */
+	end = 'D';
+	is_arrow = 1;
+	break;
+ case 0x4D:		 /* Right */
+	end = 'C';
+	is_arrow = 1;
+	break;
+ case 0x4F:		 /* End */
+	*b++ = '4';
+	break;
+ case 0x50:		 /* Down */
+	end = 'B';
+	is_arrow = 1;
+	break;
+ case 0x51:		 /* PgDn */
+	*b++ = '6';
+	break;
+ case 0x52:		 /* Insert */
+	*b++ = '2';
+	break;
+ case 0x53:		 /* Delete */
+	*b++ = '3';
+	break;
+ case ';':			 /* F1 */
+	*b++ = '1';
+	*b++ = '1';
+	break;
+ case '<':			 /* F2 */
+	*b++ = '1';
+	*b++ = '2';
+	break;
+ case '=':			 /* F3 */
+	*b++ = '1';
+	*b++ = '3';
+	break;
+
+ case '>':			 /* F4 */
+	*b++ = '1';
+	*b++ = '4';
+	break;
+
+ case '?':			 /* F5 */
+	*b++ = '1';
+	*b++ = '5';
+	break;
+
+ case '@':			 /* F6 */
+	*b++ = '1';
+	*b++ = '7';
+	break;
+
+ case 'A':			 /* F7 */
+	*b++ = '1';
+	*b++ = '8';
+	break;
+
+ case 'B':			 /* F8 */
+	*b++ = '1';
+	*b++ = '9';
+	break;
+
+ case 'C':			 /* F9 */
+	*b++ = '2';
+	*b++ = '0';
+	break;
+
+ case 'D':			 /* F10 */
+	*b++ = '2';
+	*b++ = '1';
+	break;
+
+ case 0x57:		 /* F11 */
+	*b++ = '2';
+	*b++ = '3';
+	break;
+
+ case 0x58:		 /* F12 */
+	*b++ = '2';
+	*b++ = '4';
+	break;
+ }
+
+ if (is_arrow && shift)
+ {
+	if (shift == _pSLTT_KEY_CTRL)
+	 end &= 0x1F;
+	else
+	 end |= 0x20;
+ }
+ *b++ = end;
+
+ if (getkey)
+ {
+	(void) SLang_buffer_keystring (buf + 1, (unsigned int) (b - (buf + 1)));
+	*ret_key = buf0;
+	return 0;
+ }
+
+ (void) SLang_buffer_keystring (buf, (unsigned int) (b - buf));
+ return 0;
+}
+
+unsigned int _pSLpc_convert_scancode (unsigned int scan,
+				 unsigned int shift,
+				 int getkey)
+{
+ unsigned char buf16;
+
+ if (Map_To_ANSI)
+ {
+	if (0 == convert_scancode (scan, shift, getkey, &scan))
+	 return scan;
+ }
+
+ if (getkey)
+ {
+	buf0 = scan & 0xFF;
+	SLang_buffer_keystring (buf, 1);
+	return (scan >> 8) & 0xFF;
+ }
+ buf0 = (scan >> 8) & 0xFF;
+ buf1 = scan & 0xFF;
+ (void) SLang_buffer_keystring (buf, 2);
+ return 0;
+}
+
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/slimport.c Added

@@ -0,0 +1,420 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+#if defined (HAVE_DLFCN_H) || defined(__WIN32__)
+# define SLANG_HAS_DYNAMIC_LINKING	1
+#else
+# define SLANG_HAS_DYNAMIC_LINKING	0
+#endif
+
+/* The rest of this file is in the if block */
+#if SLANG_HAS_DYNAMIC_LINKING
+
+#ifdef HAVE_DLFCN_H
+# include <dlfcn.h>
+#endif
+
+#ifdef __WIN32__
+# include <windows.h>
+# define dlopen(a, b) LoadLibrary(a)
+# define dlsym (void *)GetProcAddress
+# define dlclose FreeLibrary
+# define dlerror() NULL
+# define SO_SUFFIX "dll"
+#else
+# define SO_SUFFIX "so"
+#endif
+
+static SLFUTURE_CONST char *Module_Path;
+#ifndef MODULE_PATH_ENV_NAME
+# define MODULE_PATH_ENV_NAME "SLANG_MODULE_PATH"
+#endif
+#ifndef MODULE_INSTALL_DIR
+# define MODULE_INSTALL_DIR "/usr/local/lib/slang/v2/modules"
+#endif
+
+#define MAX_MODULE_NAME_SIZE 256
+
+typedef struct Namespace_List_Type
+{
+ char *ns;
+ struct Namespace_List_Type *next;
+}
+Namespace_List_Type;
+
+typedef struct _Handle_Type
+{
+ struct _Handle_Type *next;
+ char *module_name;
+ VOID_STAR handle;
+ int (*ns_init_fun) (SLCONST char *);
+ void (*deinit_fun) (void);
+ Namespace_List_Type *ns_list;
+}
+Handle_Type;
+
+static Handle_Type *Handle_List;
+
+static void free_namespace_list (Namespace_List_Type *ns_list)
+{
+ while (ns_list != NULL)
+ {
+	Namespace_List_Type *next = ns_list->next;
+	SLang_free_slstring (ns_list->ns);
+	SLfree ((char *)ns_list);
+	ns_list = next;
+ }
+}
+
+static void free_handle_type (Handle_Type *h)
+{
+ if (h == NULL)
+ return;
+
+ SLang_free_slstring (h->module_name);
+ free_namespace_list (h->ns_list);
+ SLfree ((char *)h);
+}
+
+static void delete_handles (void)
+{
+ while (Handle_List != NULL)
+ {
+	Handle_Type *next = Handle_List->next;
+
+	if (Handle_List->deinit_fun != NULL)
+	 Handle_List->deinit_fun ();
+	/* (void) dlclose (Handle_List->handle); */
+	free_handle_type (Handle_List);
+	Handle_List = next;
+ }
+}
+
+static Handle_Type *allocate_handle_type (SLFUTURE_CONST char *module_name, VOID_STAR handle)
+{
+ Handle_Type *h;
+
+ h = (Handle_Type *) SLcalloc (1, sizeof (Handle_Type));
+ if (h == NULL)
+ return NULL;
+ if (NULL == (h->module_name = SLang_create_slstring (module_name)))
+ {
+	SLfree ((char *) h);
+	return NULL;
+ }
+ h->handle = handle;
+ return h;
+}
+
+static Handle_Type *find_handle (SLCONST char *module_name)
+{
+ Handle_Type *l;
+
+ l = Handle_List;
+ while (l != NULL)
+ {
+	if (0 == strcmp (l->module_name, module_name))
+	 break;
+	l = l->next;
+ }
+ return l;
+}
+
+static int check_api_version (char *file, int api_version)
+{
+ if (api_version/10000 == SLANG_VERSION/10000)
+ return 0;
+
+ _pSLang_verror (SL_Import_Error, "Module %s is incompatible with this version of S-Lang",
+		 file);
+ return -1;
+}
+
+#if defined(__GNUC__)
+# pragma GCC diagnostic ignored "-Wformat-nonliteral"
+#endif
+static VOID_STAR do_dlsym (VOID_STAR handle, SLFUTURE_CONST char *file, int check_error, SLFUTURE_CONST char *fmt, char *module)
+{
+ char symbolMAX_MODULE_NAME_SIZE + 32;
+ VOID_STAR s;
+
+ SLsnprintf (symbol, sizeof(symbol), fmt, module);
+ if (NULL != (s = (VOID_STAR) dlsym (handle, symbol)))
+ return s;
+
+ if (check_error)
+ {
+	SLCONST char *err;
+
+	if (NULL == (err = (char *) dlerror ()))
+	 err = "UNKNOWN";
+
+	_pSLang_verror (SL_Import_Error,
+		 "Unable to get symbol %s from %s: %s",
+		 symbol, file, err);
+ }
+ return NULL;
+}
+#if defined(__GNUC__)
+# pragma GCC diagnostic warning "-Wformat-nonliteral"
+#endif
+
+static Handle_Type *dynamic_link_module (SLFUTURE_CONST char *module)
+{
+ Handle_Type *h;
+ VOID_STAR handle;
+ SLFUTURE_CONST char *err;
+ char filebuf1024;
+ char *save_file;
+ char *save_err;
+ int api_version;
+ int *api_version_ptr;
+#define MAX_MODULE_NAME_SIZE 256
+ char module_soMAX_MODULE_NAME_SIZE + 32;
+ char *module_name;
+ char *file, *pathfile;
+
+ if (strlen (module) >= MAX_MODULE_NAME_SIZE)
+ {
+	_pSLang_verror (SL_LimitExceeded_Error, "module name too long");
+	return NULL;
+ }
+ SLsnprintf (module_so, sizeof(module_so), "%s-module.%s", module, SO_SUFFIX);
+
+ if (Module_Path != NULL)
+ pathfile = SLpath_find_file_in_path (Module_Path, module_so);
+ else pathfile = NULL;
+
+ if ((pathfile == NULL)
+ && (NULL != (pathfile = _pSLsecure_getenv (MODULE_PATH_ENV_NAME))))
+ pathfile = SLpath_find_file_in_path (pathfile, module_so);
+
+ if (pathfile == NULL)
+ pathfile = SLpath_find_file_in_path (MODULE_INSTALL_DIR, module_so);
+
+ if (pathfile != NULL)
+ file = pathfile;
+ else
+ file = module_so;
+
+ save_err = NULL;
+ save_file = file;
+ while (1)
+ {
+#ifndef RTLD_GLOBAL
+# define RTLD_GLOBAL 0
+#endif
+#ifdef RTLD_NOW
+	handle = (VOID_STAR) dlopen (file, RTLD_NOW | RTLD_GLOBAL);
+#else
+	handle = (VOID_STAR) dlopen (file, RTLD_LAZY | RTLD_GLOBAL);
+#endif
+
+	if (handle != NULL)
+	 {
+	 if (_pSLang_Load_File_Verbose & SLANG_LOAD_MODULE_VERBOSE)
+	 SLang_vmessage ("Importing %s", file);
+	 if (save_err != NULL)
+	 SLfree (save_err);
+	 break;
+	 }
+
+	/* Purify reports that dlerror returns a pointer that generates UMR
+	 * errors. There is nothing that I can do about that....
+	 */
+	if ((NULL == strchr (file, '/'))
+	 && (strlen(file) < sizeof(filebuf)))
+	 {
+	 err = (char *) dlerror ();
+	 if (err != NULL)
+	 save_err = SLmake_string (err);
+
+	 SLsnprintf (filebuf, sizeof (filebuf), "./%s", file);
+	 file = filebuf;
+	 continue;
+	 }
+
+	if ((NULL == (err = save_err))
+	 && (NULL == (err = (char *) dlerror ())))
+	 err = "UNKNOWN";
+
+	_pSLang_verror (SL_Import_Error,
+		 "Error linking to %s: %s", save_file, err);
+
+	if (save_err != NULL)
+	 SLfree (save_err);
+	if (pathfile != NULL)
+	 SLfree (pathfile);
+
+	return NULL;
+ }
+
+ /* Using SLpath_basename allows, e.g., import ("/path/to/module"); */
+ module_name = SLpath_basename (module);
+
+ api_version_ptr = (int *) do_dlsym (handle, file, 0, "SLmodule_%s_api_version", module_name);
+ if (api_version_ptr == NULL)
+ api_version_ptr = (int *) do_dlsym (handle, file, 0, "_SLmodule_%s_api_version", module_name);
+
+ if (api_version_ptr == NULL)
+ api_version = 0;
+ else
+ api_version = *api_version_ptr;
+
+ if ((-1 == check_api_version (file, api_version))
+ || (NULL == (h = allocate_handle_type (module, handle))))
+ {
+	SLfree (pathfile);	 /* NULL ok */
+	dlclose (handle);
+	return NULL;
+ }
+
+ if (NULL == (h->ns_init_fun = (int (*)(SLCONST char *)) do_dlsym (handle, file, 1, "init_%s_module_ns", module_name)))
+ {
+	SLfree (pathfile);
+	free_handle_type (h);
+	dlclose (handle);
+	return NULL;
+ }
+ h->deinit_fun = (void (*)(void)) do_dlsym (handle, file, 0, "deinit_%s_module", module_name);
+
+ SLfree (pathfile);		 /* NULL ok */
+ h->next = Handle_List;
+ Handle_List = h;
+
+ return h;
+}
+
+static int import_module (SLFUTURE_CONST char *module, SLFUTURE_CONST char *ns)
+{
+ Handle_Type *h;
+ Namespace_List_Type *ns_list;
+
+ if (ns == NULL)
+ ns = _pSLang_cur_namespace_intrinsic ();
+
+ if (*ns == 0)
+ ns = "Global";
+
+ if ((NULL == (h = find_handle (module)))
+ && (NULL == (h = dynamic_link_module (module))))
+ return -1;
+
+ ns_list = h->ns_list;
+ while (ns_list != NULL)
+ {
+	if (0 == strcmp (ns, ns_list->ns))
+	 return 0;		 /* already linked to this ns */
+	ns_list = ns_list->next;
+ }
+
+ if (NULL == (ns_list = (Namespace_List_Type *)SLmalloc (sizeof (Namespace_List_Type))))
+ return -1;
+
+ if (NULL == (ns_list->ns = SLang_create_slstring (ns)))
+ {
+	SLfree ((char *)ns_list);
+	return -1;
+ }
+ ns_list->next = h->ns_list;
+ h->ns_list = ns_list;
+
+ if (-1 == (h->ns_init_fun (ns)))
+ return -1;
+
+ return 0;
+}
+
+static void import_module_intrin (void)
+{
+ char *module;
+ char *ns = NULL;
+
+ if (SLang_Num_Function_Args == 2)
+ {
+	if (-1 == SLang_pop_slstring (&ns))
+	 return;
+ }
+
+ if (-1 == SLang_pop_slstring (&module))
+ {
+	SLang_free_slstring (ns); /* NULL ok */
+	return;
+ }
+
+ (void) import_module (module, ns);
+ SLang_free_slstring (module);
+ SLang_free_slstring (ns);	 /* NULL ok */
+}
+
+static void set_import_module_path (char *path)
+{
+ (void) SLang_set_module_load_path (path);
+}
+
+static SLCONST char *get_import_module_path (void)
+{
+ char *path;
+ if (Module_Path != NULL)
+ return Module_Path;
+ if (NULL != (path = _pSLsecure_getenv (MODULE_PATH_ENV_NAME)))
+ return path;
+ return MODULE_INSTALL_DIR;
+}
+
+static SLang_Intrin_Fun_Type Module_Intrins =
+{
+ MAKE_INTRINSIC_0("import", import_module_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("set_import_module_path", set_import_module_path, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("get_import_module_path", get_import_module_path, SLANG_STRING_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+#endif				 /* SLANG_HAS_DYNAMIC_LINKING */
+
+int SLang_set_module_load_path (SLFUTURE_CONST char *path)
+{
+#if SLANG_HAS_DYNAMIC_LINKING
+ if (NULL == (path = SLang_create_slstring (path)))
+ return -1;
+ SLang_free_slstring ((char *) Module_Path);
+ Module_Path = path;
+ return 0;
+#else
+ (void) path;
+ return -1;
+#endif
+}
+
+int SLang_init_import (void)
+{
+#if SLANG_HAS_DYNAMIC_LINKING
+ (void) SLang_add_cleanup_function (delete_handles);
+ return SLadd_intrin_fun_table (Module_Intrins, "__IMPORT__");
+#else
+ return 0;
+#endif
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slinclud.h Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/slintall.c Added

@@ -0,0 +1,45 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+int SLang_init_all (void)
+{
+   if ((-1 == SLang_init_slang ())
+#if SLANG_HAS_FLOAT
+       || (-1 == SLang_init_slmath ())
+#endif
+       || (-1 == SLang_init_posix_dir ())
+       || (-1 == SLang_init_posix_process ())
+       || (-1 == SLang_init_stdio ())
+       || (-1 == SLang_init_array ())
+       || (-1 == SLang_init_posix_io ())
+       || (-1 == SLang_init_signal ())
+       || (-1 == SLang_init_ospath ())
+       )
+     return -1;
+
+   return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slischar.c Added

@@ -0,0 +1,180 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include "slinclud.h"
+#include <ctype.h>
+#include <string.h>
+#include <stdlib.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+#define DEFINE_PSLWC_CLASSIFICATION_TABLE
+#include "slischar.h"
+
+#define MODE_VARIABLE _pSLinterp_UTF8_Mode
+
+int SLwchar_islower (SLwchar_Type ch)
+{
+ if (MODE_VARIABLE)
+ return SL_CLASSIFICATION_LOOKUP(ch) & SLCHARCLASS_LOWER;
+
+ if (ch < 256)
+ return islower ((unsigned char) ch);
+
+ return 0;
+}
+
+int SLwchar_isupper (SLwchar_Type ch)
+{
+ if (MODE_VARIABLE)
+ return SL_CLASSIFICATION_LOOKUP(ch) & SLCHARCLASS_UPPER;
+
+ if (ch < 256)
+ return isupper ((unsigned char) ch);
+
+ return 0;
+}
+
+int SLwchar_isalpha (SLwchar_Type ch)
+{
+ if (MODE_VARIABLE)
+ return SL_CLASSIFICATION_LOOKUP(ch) & SLCHARCLASS_ALPHA;
+
+ if (ch < 256)
+ return isalpha ((unsigned char) ch);
+
+ return 0;
+}
+
+int SLwchar_isxdigit (SLwchar_Type ch)
+{
+ if (MODE_VARIABLE)
+ return SL_CLASSIFICATION_LOOKUP(ch) & SLCHARCLASS_XDIGIT;
+
+ if (ch < 256)
+ return isxdigit ((unsigned char) ch);
+
+ return 0;
+}
+
+int SLwchar_isspace (SLwchar_Type ch)
+{
+ if (MODE_VARIABLE)
+ return SL_CLASSIFICATION_LOOKUP(ch) & SLCHARCLASS_SPACE;
+
+ if (ch < 256)
+ return isspace ((unsigned char) ch);
+
+ return 0;
+}
+
+int SLwchar_isblank (SLwchar_Type ch)
+{
+ if (MODE_VARIABLE)
+ return SL_CLASSIFICATION_LOOKUP(ch) & SLCHARCLASS_BLANK;
+
+ return (ch == ' ') || (ch == '\t');
+}
+
+int SLwchar_iscntrl (SLwchar_Type ch)
+{
+ if (MODE_VARIABLE)
+ return SL_CLASSIFICATION_LOOKUP(ch) & SLCHARCLASS_CNTRL;
+
+ if (ch < 256)
+ return iscntrl ((unsigned char) ch);
+
+ return 0;
+}
+
+int SLwchar_isprint (SLwchar_Type ch)
+{
+ if (MODE_VARIABLE)
+ return SL_CLASSIFICATION_LOOKUP(ch) & SLCHARCLASS_PRINT;
+
+ if (ch < 256)
+ return isprint ((unsigned char) ch);
+
+ return 0;
+}
+
+/* The following are derived quantities */
+#define DIGITCLASS(x) (((x)&SLCHARCLASS_XDIGIT)&&!((x)&SLCHARCLASS_ALPHA))
+#define GRAPHCLASS(x) (((x)&SLCHARCLASS_PRINT)&&!((x)&SLCHARCLASS_SPACE))
+#define ALNUMCLASS(x) ((x)&(SLCHARCLASS_ALPHA|SLCHARCLASS_XDIGIT))
+#define PUNCTCLASS(x) (!ALNUMCLASS(x) && GRAPHCLASS(x))
+
+int SLwchar_isdigit (SLwchar_Type ch)
+{
+ if (MODE_VARIABLE)
+ {
+	unsigned char t = SL_CLASSIFICATION_LOOKUP(ch);
+	return DIGITCLASS(t);
+ }
+
+ if ((unsigned)ch < 256)
+ return isdigit ((unsigned char) ch);
+
+ return 0;
+}
+
+int SLwchar_isgraph (SLwchar_Type ch)
+{
+ if (MODE_VARIABLE)
+ {
+	unsigned char t = SL_CLASSIFICATION_LOOKUP(ch);
+	return GRAPHCLASS(t);
+ }
+
+ if ((unsigned)ch < 256)
+ return isgraph ((unsigned char) ch);
+
+ return 0;
+}
+
+int SLwchar_isalnum (SLwchar_Type ch)
+{
+ if (MODE_VARIABLE)
+ {
+	unsigned char t = SL_CLASSIFICATION_LOOKUP(ch);
+	return ALNUMCLASS(t);
+ }
+
+ if ((unsigned)ch < 256)
+ return isalnum ((unsigned char) ch);
+
+ return 0;
+}
+
+int SLwchar_ispunct (SLwchar_Type ch)
+{
+ if (MODE_VARIABLE)
+ {
+	unsigned char t = SL_CLASSIFICATION_LOOKUP(ch);
+	return PUNCTCLASS(t);
+ }
+
+ if ((unsigned)ch < 256)
+ return ispunct ((unsigned char) ch);
+
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slischar.h Added

@@ -0,0 +1,5290 @@
+/* This file was automatically created by ./mktables */
+#define SLCHARCLASS_LOWER	0x0001
+#define SLCHARCLASS_UPPER	0x0002
+#define SLCHARCLASS_ALPHA	0x0004
+#define SLCHARCLASS_XDIGIT	0x0008
+#define SLCHARCLASS_SPACE	0x0010
+#define SLCHARCLASS_BLANK	0x0020
+#define SLCHARCLASS_CNTRL	0x0040
+#define SLCHARCLASS_PRINT	0x0080
+#define SLCHARCLASS_DIGIT	0x0100
+#define SLCHARCLASS_GRAPH	0x0200
+#define SLCHARCLASS_ALNUM	0x0400
+#define SLCHARCLASS_PUNCT	0x0800
+#define SLCHARCLASS_ASCII	0x1000
+
+
+#define SL_CLASSIFICATION_MAX_CHAR 0x110000ul
+
+#define SL_CLASSIFICATION_LOOKUP(x) \
+  (((unsigned)(x)>=SL_CLASSIFICATION_MAX_CHAR)?0:(_pSLwc_Classification_Table(unsigned)(x)>>8(unsigned)(x)&0xFF))
+
+extern const _pSLuint16_Type *_pSLwc_Classification_Table4352;
+
+#ifdef DEFINE_PSLWC_CLASSIFICATION_TABLE
+static const _pSLuint16_Type Table_00256 =
+{
+  /*0x00-0x07*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x08-0x0F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x10-0x17*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x18-0x1F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x20-0x27*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x28-0x2F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_01256 =
+{
+  /*0x00-0x07*/ 0x1040, 0x1040, 0x1040, 0x1040, 0x1040, 0x1040, 0x1040, 0x1040,
+  /*0x08-0x0F*/ 0x1040, 0x1070, 0x1050, 0x1050, 0x1050, 0x1050, 0x1040, 0x1040,
+  /*0x10-0x17*/ 0x1040, 0x1040, 0x1040, 0x1040, 0x1040, 0x1040, 0x1040, 0x1040,
+  /*0x18-0x1F*/ 0x1040, 0x1040, 0x1040, 0x1040, 0x1040, 0x1040, 0x1040, 0x1040,
+  /*0x20-0x27*/ 0x10B0, 0x1A80, 0x1A80, 0x1A80, 0x1A80, 0x1A80, 0x1A80, 0x1A80,
+  /*0x28-0x2F*/ 0x1A80, 0x1A80, 0x1A80, 0x1A80, 0x1A80, 0x1A80, 0x1A80, 0x1A80,
+  /*0x30-0x37*/ 0x1788, 0x1788, 0x1788, 0x1788, 0x1788, 0x1788, 0x1788, 0x1788,
+  /*0x38-0x3F*/ 0x1788, 0x1788, 0x1A80, 0x1A80, 0x1A80, 0x1A80, 0x1A80, 0x1A80,
+  /*0x40-0x47*/ 0x1A80, 0x168E, 0x168E, 0x168E, 0x168E, 0x168E, 0x168E, 0x1686,
+  /*0x48-0x4F*/ 0x1686, 0x1686, 0x1686, 0x1686, 0x1686, 0x1686, 0x1686, 0x1686,
+  /*0x50-0x57*/ 0x1686, 0x1686, 0x1686, 0x1686, 0x1686, 0x1686, 0x1686, 0x1686,
+  /*0x58-0x5F*/ 0x1686, 0x1686, 0x1686, 0x1A80, 0x1A80, 0x1A80, 0x1A80, 0x1A80,
+  /*0x60-0x67*/ 0x1A80, 0x168D, 0x168D, 0x168D, 0x168D, 0x168D, 0x168D, 0x1685,
+  /*0x68-0x6F*/ 0x1685, 0x1685, 0x1685, 0x1685, 0x1685, 0x1685, 0x1685, 0x1685,
+  /*0x70-0x77*/ 0x1685, 0x1685, 0x1685, 0x1685, 0x1685, 0x1685, 0x1685, 0x1685,
+  /*0x78-0x7F*/ 0x1685, 0x1685, 0x1685, 0x1A80, 0x1A80, 0x1A80, 0x1A80, 0x1040,
+  /*0x80-0x87*/ 0x0040, 0x0040, 0x0040, 0x0040, 0x0040, 0x0040, 0x0040, 0x0040,
+  /*0x88-0x8F*/ 0x0040, 0x0040, 0x0040, 0x0040, 0x0040, 0x0040, 0x0040, 0x0040,
+  /*0x90-0x97*/ 0x0040, 0x0040, 0x0040, 0x0040, 0x0040, 0x0040, 0x0040, 0x0040,
+  /*0x98-0x9F*/ 0x0040, 0x0040, 0x0040, 0x0040, 0x0040, 0x0040, 0x0040, 0x0040,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0685, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xC8-0xCF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xD0-0xD7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0A80,
+  /*0xD8-0xDF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0685,
+  /*0xE0-0xE7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xE8-0xEF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xF0-0xF7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0A80,
+  /*0xF8-0xFF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685
+};
+
+static const _pSLuint16_Type Table_02256 =
+{
+  /*0x00-0x07*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x08-0x0F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x10-0x17*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x18-0x1F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x20-0x27*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x28-0x2F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x30-0x37*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x38-0x3F*/ 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686,
+  /*0x40-0x47*/ 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686,
+  /*0x48-0x4F*/ 0x0685, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x50-0x57*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x58-0x5F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x60-0x67*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x68-0x6F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x70-0x77*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x78-0x7F*/ 0x0686, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0685,
+  /*0x80-0x87*/ 0x0685, 0x0686, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0686,
+  /*0x88-0x8F*/ 0x0685, 0x0686, 0x0686, 0x0686, 0x0685, 0x0685, 0x0686, 0x0686,
+  /*0x90-0x97*/ 0x0686, 0x0686, 0x0685, 0x0686, 0x0686, 0x0685, 0x0686, 0x0686,
+  /*0x98-0x9F*/ 0x0686, 0x0685, 0x0685, 0x0685, 0x0686, 0x0686, 0x0685, 0x0686,
+  /*0xA0-0xA7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0686,
+  /*0xA8-0xAF*/ 0x0685, 0x0686, 0x0685, 0x0685, 0x0686, 0x0685, 0x0686, 0x0686,
+  /*0xB0-0xB7*/ 0x0685, 0x0686, 0x0686, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686,
+  /*0xB8-0xBF*/ 0x0686, 0x0685, 0x0685, 0x0684, 0x0686, 0x0685, 0x0685, 0x0685,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0686, 0x0686, 0x0685, 0x0686,
+  /*0xC8-0xCF*/ 0x0686, 0x0685, 0x0686, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686,
+  /*0xD0-0xD7*/ 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686,
+  /*0xD8-0xDF*/ 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0685, 0x0686, 0x0685,
+  /*0xE0-0xE7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xE8-0xEF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xF0-0xF7*/ 0x0685, 0x0686, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0686,
+  /*0xF8-0xFF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685
+};
+
+static const _pSLuint16_Type Table_03256 =
+{
+  /*0x00-0x07*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x08-0x0F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x10-0x17*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x18-0x1F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x20-0x27*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x28-0x2F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x30-0x37*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x38-0x3F*/ 0x0685, 0x0685, 0x0686, 0x0686, 0x0685, 0x0686, 0x0686, 0x0685,
+  /*0x40-0x47*/ 0x0685, 0x0686, 0x0685, 0x0686, 0x0686, 0x0686, 0x0686, 0x0685,
+  /*0x48-0x4F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x50-0x57*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x58-0x5F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x60-0x67*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x68-0x6F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x70-0x77*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x78-0x7F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x80-0x87*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x88-0x8F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x90-0x97*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0684, 0x0685, 0x0685, 0x0685,
+  /*0x98-0x9F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xA0-0xA7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xA8-0xAF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0A80, 0x0684, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_04256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0685, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0684, 0x0A80, 0x0686, 0x0685,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0684, 0x0685, 0x0685, 0x0685, 0x0A80, 0x0686,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0686, 0x0A80,
+  /*0x88-0x8F*/ 0x0686, 0x0686, 0x0686, 0x0000, 0x0686, 0x0000, 0x0686, 0x0686,
+  /*0x90-0x97*/ 0x0685, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x98-0x9F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xA0-0xA7*/ 0x0686, 0x0686, 0x0000, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xA8-0xAF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xB0-0xB7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xB8-0xBF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xC0-0xC7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xC8-0xCF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0686,
+  /*0xD0-0xD7*/ 0x0685, 0x0685, 0x0686, 0x0686, 0x0686, 0x0685, 0x0685, 0x0685,
+  /*0xD8-0xDF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xE0-0xE7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xE8-0xEF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xF0-0xF7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0686, 0x0685, 0x0A80, 0x0686,
+  /*0xF8-0xFF*/ 0x0685, 0x0686, 0x0686, 0x0685, 0x0685, 0x0686, 0x0686, 0x0686
+};
+
+static const _pSLuint16_Type Table_05256 =
+{
+  /*0x00-0x07*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x08-0x0F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x10-0x17*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x18-0x1F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x20-0x27*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x28-0x2F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x30-0x37*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x38-0x3F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x40-0x47*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x48-0x4F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x50-0x57*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x58-0x5F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x60-0x67*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x68-0x6F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x70-0x77*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x78-0x7F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x80-0x87*/ 0x0686, 0x0685, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x90-0x97*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x98-0x9F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xA0-0xA7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xA8-0xAF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xB0-0xB7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xB8-0xBF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xC0-0xC7*/ 0x0686, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686,
+  /*0xC8-0xCF*/ 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0685,
+  /*0xD0-0xD7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xD8-0xDF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xE0-0xE7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xE8-0xEF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xF0-0xF7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xF8-0xFF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685
+};
+
+static const _pSLuint16_Type Table_06256 =
+{
+  /*0x00-0x07*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x08-0x0F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x10-0x17*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x18-0x1F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x20-0x27*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x28-0x2F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x30-0x37*/ 0x0000, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x38-0x3F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x40-0x47*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x48-0x4F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x50-0x57*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0000, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x68-0x6F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x70-0x77*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x78-0x7F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x80-0x87*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x88-0x8F*/ 0x0000, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_07256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0684, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0684
+};
+
+static const _pSLuint16_Type Table_08256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0A80,
+  /*0x10-0x17*/ 0x0684, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_09256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0000,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_10256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0000, 0x0684, 0x0000, 0x0000, 0x0000, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0A80, 0x0684, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0684, 0x0684, 0x0000, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0A80, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_11256 =
+{
+  /*0x00-0x07*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0000,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0A80, 0x0000, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0A80, 0x0684, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_12256 =
+{
+  /*0x00-0x07*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0A80, 0x0684, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0684, 0x0684, 0x0000, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0A80, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0684, 0x0684, 0x0000, 0x0684, 0x0000, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_13256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0684, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0000,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0A80, 0x0684, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0684, 0x0000,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0000, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_14256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0684, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0A80,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0000,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_15256 =
+{
+  /*0x00-0x07*/ 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0A80, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0684, 0x0684, 0x0000, 0x0684, 0x0000, 0x0000, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0000, 0x0684, 0x0000, 0x0000, 0x0684, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0000, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0000, 0x0684,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0A80, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80, 0x0684, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0000,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_16256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_17256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xA8-0xAF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xB0-0xB7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xB8-0xBF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xC0-0xC7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0000, 0x0686,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0686, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684
+};
+
+static const _pSLuint16_Type Table_18256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684
+};
+
+static const _pSLuint16_Type Table_19256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x58-0x5F*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0xC0-0xC7*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684
+};
+
+static const _pSLuint16_Type Table_20256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xA8-0xAF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xB0-0xB7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xB8-0xBF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xC0-0xC7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xC8-0xCF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xD0-0xD7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xD8-0xDF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xE0-0xE7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xE8-0xEF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xF0-0xF7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_21256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684
+};
+
+static const _pSLuint16_Type Table_22256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0090, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_23256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0x18-0x1F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0000, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0A80, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_24256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0A80, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_25256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0A80, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_26256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_27256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_28256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x88-0x8F*/ 0x0685, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_29256 =
+{
+  /*0x00-0x07*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x08-0x0F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x10-0x17*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x18-0x1F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x20-0x27*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x28-0x2F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x70-0x77*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x78-0x7F*/ 0x0684, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x80-0x87*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x88-0x8F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x90-0x97*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x98-0x9F*/ 0x0685, 0x0685, 0x0685, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_30256 =
+{
+  /*0x00-0x07*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x08-0x0F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x10-0x17*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x18-0x1F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x20-0x27*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x28-0x2F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x30-0x37*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x38-0x3F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x40-0x47*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x48-0x4F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x50-0x57*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x58-0x5F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x60-0x67*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x68-0x6F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x70-0x77*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x78-0x7F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x80-0x87*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x88-0x8F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x90-0x97*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0685, 0x0685,
+  /*0x98-0x9F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0686, 0x0685,
+  /*0xA0-0xA7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xA8-0xAF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xB0-0xB7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xB8-0xBF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xC0-0xC7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xC8-0xCF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xD0-0xD7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xD8-0xDF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xE0-0xE7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xE8-0xEF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xF0-0xF7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xF8-0xFF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685
+};
+
+static const _pSLuint16_Type Table_31256 =
+{
+  /*0x00-0x07*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x08-0x0F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x10-0x17*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0000, 0x0000,
+  /*0x18-0x1F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0000, 0x0000,
+  /*0x20-0x27*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x28-0x2F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x30-0x37*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x38-0x3F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x40-0x47*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x58-0x5F*/ 0x0000, 0x0686, 0x0000, 0x0686, 0x0000, 0x0686, 0x0000, 0x0686,
+  /*0x60-0x67*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x68-0x6F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x70-0x77*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x78-0x7F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x88-0x8F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x90-0x97*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x98-0x9F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xA0-0xA7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xA8-0xAF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xB0-0xB7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0000, 0x0685, 0x0685,
+  /*0xB8-0xBF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0A80, 0x0685, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0685, 0x0685, 0x0685, 0x0000, 0x0685, 0x0685,
+  /*0xC8-0xCF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0000, 0x0000, 0x0685, 0x0685,
+  /*0xD8-0xDF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0000, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xE8-0xEF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0685, 0x0685, 0x0685, 0x0000, 0x0685, 0x0685,
+  /*0xF8-0xFF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0A80, 0x0A80, 0x0000
+};
+
+static const _pSLuint16_Type Table_32256 =
+{
+  /*0x00-0x07*/ 0x0090, 0x0090, 0x0090, 0x0090, 0x0090, 0x0090, 0x0090, 0x0A80,
+  /*0x08-0x0F*/ 0x0090, 0x0090, 0x0090, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0090, 0x0090, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0090,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0684, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_33256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0686, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0686,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0685, 0x0686, 0x0686, 0x0686, 0x0685, 0x0685,
+  /*0x10-0x17*/ 0x0686, 0x0686, 0x0686, 0x0685, 0x0A80, 0x0686, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0686, 0x0A80, 0x0686, 0x0A80,
+  /*0x28-0x2F*/ 0x0686, 0x0A80, 0x0686, 0x0686, 0x0686, 0x0686, 0x0A80, 0x0685,
+  /*0x30-0x37*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0685, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0685, 0x0A80, 0x0A80, 0x0685, 0x0685, 0x0686, 0x0686,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0686, 0x0685, 0x0685,
+  /*0x48-0x4F*/ 0x0685, 0x0685, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0685, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x68-0x6F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x70-0x77*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x78-0x7F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0686, 0x0685, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_34256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_35256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x28-0x2F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0686, 0x0686,
+  /*0xB8-0xBF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xC0-0xC7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xC8-0xCF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xD0-0xD7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xD8-0xDF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xE0-0xE7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xE8-0xEF*/ 0x0685, 0x0685, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_36256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_37256 =
+{
+  /*0x00-0x07*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x08-0x0F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x10-0x17*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x18-0x1F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x20-0x27*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x28-0x2F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0000,
+  /*0x30-0x37*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x38-0x3F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x40-0x47*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x48-0x4F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x50-0x57*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x58-0x5F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0000,
+  /*0x60-0x67*/ 0x0686, 0x0685, 0x0686, 0x0686, 0x0686, 0x0685, 0x0685, 0x0686,
+  /*0x68-0x6F*/ 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0686, 0x0686,
+  /*0x70-0x77*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0685, 0x0686, 0x0685, 0x0685,
+  /*0x78-0x7F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0684, 0x0684, 0x0686, 0x0686,
+  /*0x80-0x87*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x88-0x8F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x90-0x97*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x98-0x9F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xA0-0xA7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xA8-0xAF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xB0-0xB7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xB8-0xBF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xC0-0xC7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xC8-0xCF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xD0-0xD7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xD8-0xDF*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xE0-0xE7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0685, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0686, 0x0685, 0x0686, 0x0685, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0686, 0x0685, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_38256 =
+{
+  /*0x00-0x07*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x08-0x0F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x10-0x17*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x18-0x1F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x20-0x27*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0000, 0x0685,
+  /*0x28-0x2F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0685, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0684,
+  /*0x70-0x77*/ 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_39256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_40256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_41256 =
+{
+  /*0x00-0x07*/ 0x0090, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684
+};
+
+static const _pSLuint16_Type Table_42256 =
+{
+  /*0x00-0x07*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x30-0x37*/ 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684
+};
+
+static const _pSLuint16_Type Table_43256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000
+};
+
+static const _pSLuint16_Type Table_44256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_45256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_46256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_47256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x48-0x4F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x50-0x57*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x58-0x5F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x60-0x67*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x68-0x6F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0684, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684,
+  /*0x80-0x87*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x88-0x8F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x90-0x97*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x98-0x9F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_48256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x28-0x2F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x30-0x37*/ 0x0685, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x38-0x3F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x40-0x47*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x48-0x4F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x50-0x57*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x58-0x5F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x60-0x67*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x68-0x6F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x70-0x77*/ 0x0684, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x78-0x7F*/ 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0686, 0x0685,
+  /*0x80-0x87*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0x88-0x8F*/ 0x0684, 0x0A80, 0x0A80, 0x0686, 0x0685, 0x0686, 0x0685, 0x0684,
+  /*0x90-0x97*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0685, 0x0685, 0x0686, 0x0685,
+  /*0x98-0x9F*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xA0-0xA7*/ 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xA8-0xAF*/ 0x0686, 0x0685, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0000,
+  /*0xB0-0xB7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0685, 0x0686, 0x0685,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0685, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684
+};
+
+static const _pSLuint16_Type Table_49256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0A80, 0x0684, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_50256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0684,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000
+};
+
+static const _pSLuint16_Type Table_51256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0A80, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0684, 0x0A80, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_52256 =
+{
+  /*0x00-0x07*/ 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x08-0x0F*/ 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x10-0x17*/ 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x18-0x1F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x30-0x37*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x38-0x3F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x40-0x47*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x48-0x4F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x50-0x57*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x58-0x5F*/ 0x0685, 0x0685, 0x0685, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x78-0x7F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x80-0x87*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x88-0x8F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x90-0x97*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x98-0x9F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xA0-0xA7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xA8-0xAF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xB0-0xB7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xB8-0xBF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_53256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_54256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_55256 =
+{
+  /*0x00-0x07*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0000,
+  /*0x08-0x0F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x10-0x17*/ 0x0000, 0x0000, 0x0000, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x18-0x1F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0684, 0x0A80, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0000,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684
+};
+
+static const _pSLuint16_Type Table_56256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_57256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0A80
+};
+
+static const _pSLuint16_Type Table_58256 =
+{
+  /*0x00-0x07*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x28-0x2F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x30-0x37*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x38-0x3F*/ 0x0686, 0x0686, 0x0686, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x48-0x4F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x50-0x57*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x58-0x5F*/ 0x0685, 0x0685, 0x0685, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_59256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0000, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_60256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_61256 =
+{
+  /*0x00-0x07*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x08-0x0F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x10-0x17*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x18-0x1F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x20-0x27*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x28-0x2F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_62256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x28-0x2F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0A80,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_63256 =
+{
+  /*0x00-0x07*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x08-0x0F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x10-0x17*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x18-0x1F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x20-0x27*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x28-0x2F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x30-0x37*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x38-0x3F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x40-0x47*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x48-0x4F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xB8-0xBF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xC0-0xC7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xC8-0xCF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xD0-0xD7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xE0-0xE7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xE8-0xEF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xF0-0xF7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xF8-0xFF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_64256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_65256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_66256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0x08-0x0F*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0000, 0x0000, 0x0000, 0x0684, 0x0000, 0x0000, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_67256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0x40-0x47*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_68256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80, 0x0000,
+  /*0x08-0x0F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_69256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_70256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x88-0x8F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x90-0x97*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x98-0x9F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xA0-0xA7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xA8-0xAF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xB0-0xB7*/ 0x0686, 0x0686, 0x0686, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xC8-0xCF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xD0-0xD7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xD8-0xDF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xE0-0xE7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xE8-0xEF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xF0-0xF7*/ 0x0685, 0x0685, 0x0685, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_71256 =
+{
+  /*0x00-0x07*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x08-0x0F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x10-0x17*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x18-0x1F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x20-0x27*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x28-0x2F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_72256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_73256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0684, 0x0A80, 0x0684, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_74256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x40-0x47*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x88-0x8F*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_75256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0A80, 0x0684, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_76256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0000, 0x0A80, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0A80, 0x0684,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_77256 =
+{
+  /*0x00-0x07*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x08-0x0F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x10-0x17*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x18-0x1F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x20-0x27*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x28-0x2F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_78256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_79256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_80256 =
+{
+  /*0x00-0x07*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x08-0x0F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x10-0x17*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x18-0x1F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x20-0x27*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x28-0x2F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xA8-0xAF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xB0-0xB7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xB8-0xBF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xC0-0xC7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xC8-0xCF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xD0-0xD7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xD8-0xDF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0684
+};
+
+static const _pSLuint16_Type Table_81256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_82256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_83256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0A80, 0x0000, 0x0A80, 0x0A80, 0x0000, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0A80,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_84256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_85256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684
+};
+
+static const _pSLuint16_Type Table_86256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_87256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x30-0x37*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_88256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_89256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_90256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_91256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0684, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_92256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_93256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_94256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0x20-0x27*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x28-0x2F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684
+};
+
+static const _pSLuint16_Type Table_95256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_96256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_97256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_98256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x28-0x2F*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_99256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_100256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_101256 =
+{
+  /*0x00-0x07*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x08-0x0F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x10-0x17*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x18-0x1F*/ 0x0686, 0x0686, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x20-0x27*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x28-0x2F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x30-0x37*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x38-0x3F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x40-0x47*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x48-0x4F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0685, 0x0685,
+  /*0x50-0x57*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0000, 0x0685, 0x0685,
+  /*0x58-0x5F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x60-0x67*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x68-0x6F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x70-0x77*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x78-0x7F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x80-0x87*/ 0x0686, 0x0686, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x88-0x8F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x90-0x97*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x98-0x9F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0686, 0x0000, 0x0686, 0x0686,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0686, 0x0000, 0x0000, 0x0686, 0x0686, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0686, 0x0686, 0x0686, 0x0686, 0x0000, 0x0686, 0x0686,
+  /*0xB0-0xB7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0685, 0x0685,
+  /*0xB8-0xBF*/ 0x0685, 0x0685, 0x0000, 0x0685, 0x0000, 0x0685, 0x0685, 0x0685,
+  /*0xC0-0xC7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0000, 0x0685, 0x0685, 0x0685,
+  /*0xC8-0xCF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xD0-0xD7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xD8-0xDF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xE0-0xE7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xE8-0xEF*/ 0x0686, 0x0686, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xF0-0xF7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xF8-0xFF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685
+};
+
+static const _pSLuint16_Type Table_102256 =
+{
+  /*0x00-0x07*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0686, 0x0686, 0x0000, 0x0686,
+  /*0x08-0x0F*/ 0x0686, 0x0686, 0x0686, 0x0000, 0x0000, 0x0686, 0x0686, 0x0686,
+  /*0x10-0x17*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0000, 0x0686, 0x0686,
+  /*0x18-0x1F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0000, 0x0685, 0x0685,
+  /*0x20-0x27*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x28-0x2F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x30-0x37*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x38-0x3F*/ 0x0686, 0x0686, 0x0000, 0x0686, 0x0686, 0x0686, 0x0686, 0x0000,
+  /*0x40-0x47*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0000, 0x0686, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x50-0x57*/ 0x0686, 0x0000, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x58-0x5F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x60-0x67*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x68-0x6F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x70-0x77*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x78-0x7F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x80-0x87*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0685, 0x0685,
+  /*0x88-0x8F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x90-0x97*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x98-0x9F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xA0-0xA7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xA8-0xAF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xB0-0xB7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xB8-0xBF*/ 0x0686, 0x0686, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xC0-0xC7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xC8-0xCF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xD0-0xD7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xD8-0xDF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xE0-0xE7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xE8-0xEF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0685, 0x0685,
+  /*0xF0-0xF7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xF8-0xFF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685
+};
+
+static const _pSLuint16_Type Table_103256 =
+{
+  /*0x00-0x07*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x08-0x0F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x10-0x17*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x18-0x1F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x20-0x27*/ 0x0686, 0x0686, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x28-0x2F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x30-0x37*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x38-0x3F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x40-0x47*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x48-0x4F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x50-0x57*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0685, 0x0685,
+  /*0x58-0x5F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x60-0x67*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x68-0x6F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x70-0x77*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x78-0x7F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x80-0x87*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x88-0x8F*/ 0x0686, 0x0686, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x90-0x97*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x98-0x9F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xA0-0xA7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xB0-0xB7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xB8-0xBF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xC0-0xC7*/ 0x0686, 0x0A80, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xC8-0xCF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xD0-0xD7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xD8-0xDF*/ 0x0685, 0x0685, 0x0685, 0x0A80, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xE0-0xE7*/ 0x0685, 0x0685, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xE8-0xEF*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xF0-0xF7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xF8-0xFF*/ 0x0686, 0x0686, 0x0686, 0x0A80, 0x0685, 0x0685, 0x0685, 0x0685
+};
+
+static const _pSLuint16_Type Table_104256 =
+{
+  /*0x00-0x07*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x08-0x0F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x10-0x17*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0A80, 0x0685, 0x0685,
+  /*0x18-0x1F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x20-0x27*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x28-0x2F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x30-0x37*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0A80, 0x0685, 0x0685,
+  /*0x38-0x3F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x40-0x47*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x48-0x4F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0A80,
+  /*0x50-0x57*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0686, 0x0686,
+  /*0x58-0x5F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x60-0x67*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x68-0x6F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0A80,
+  /*0x70-0x77*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x78-0x7F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x80-0x87*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x88-0x8F*/ 0x0685, 0x0A80, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x90-0x97*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x98-0x9F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xA0-0xA7*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0xA8-0xAF*/ 0x0686, 0x0A80, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xB0-0xB7*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xB8-0xBF*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xC0-0xC7*/ 0x0685, 0x0685, 0x0685, 0x0A80, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0xC8-0xCF*/ 0x0685, 0x0685, 0x0686, 0x0685, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_105256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_106256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0000, 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80, 0x0000, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_107256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_108256 =
+{
+  /*0x00-0x07*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x08-0x0F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x10-0x17*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x18-0x1F*/ 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686, 0x0686,
+  /*0x20-0x27*/ 0x0686, 0x0686, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x28-0x2F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x30-0x37*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x38-0x3F*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685, 0x0685,
+  /*0x40-0x47*/ 0x0685, 0x0685, 0x0685, 0x0685, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_109256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0000, 0x0684, 0x0684, 0x0000, 0x0684, 0x0000, 0x0000, 0x0684,
+  /*0x28-0x2F*/ 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0000, 0x0684, 0x0000, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0000, 0x0000, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0684,
+  /*0x48-0x4F*/ 0x0000, 0x0684, 0x0000, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0000, 0x0684, 0x0684, 0x0000, 0x0684, 0x0000, 0x0000, 0x0684,
+  /*0x58-0x5F*/ 0x0000, 0x0684, 0x0000, 0x0684, 0x0000, 0x0684, 0x0000, 0x0684,
+  /*0x60-0x67*/ 0x0000, 0x0684, 0x0684, 0x0000, 0x0684, 0x0000, 0x0000, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0000,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0684, 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0000, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_110256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0000, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_111256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80
+};
+
+static const _pSLuint16_Type Table_112256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x08-0x0F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_113256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_114256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_115256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_116256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_117256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_118256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684
+};
+
+static const _pSLuint16_Type Table_119256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684
+};
+
+static const _pSLuint16_Type Table_120256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE8-0xEF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF0-0xF7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xF8-0xFF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684
+};
+
+static const _pSLuint16_Type Table_121256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x20-0x27*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x28-0x2F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x30-0x37*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x38-0x3F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x40-0x47*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x48-0x4F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x50-0x57*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x58-0x5F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x60-0x67*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x68-0x6F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x70-0x77*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x78-0x7F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x80-0x87*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x88-0x8F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x90-0x97*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x98-0x9F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA0-0xA7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xA8-0xAF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB0-0xB7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xB8-0xBF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC0-0xC7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xC8-0xCF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD0-0xD7*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xD8-0xDF*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0xE0-0xE7*/ 0x0684, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_122256 =
+{
+  /*0x00-0x07*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x08-0x0F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x10-0x17*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684,
+  /*0x18-0x1F*/ 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0684, 0x0000, 0x0000,
+  /*0x20-0x27*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x28-0x2F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x30-0x37*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x38-0x3F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x40-0x47*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x48-0x4F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x50-0x57*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x58-0x5F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x60-0x67*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x68-0x6F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x70-0x77*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x78-0x7F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_123256 =
+{
+  /*0x00-0x07*/ 0x0000, 0x0A80, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x08-0x0F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x10-0x17*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x18-0x1F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x88-0x8F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x90-0x97*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0x98-0x9F*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA0-0xA7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xA8-0xAF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB0-0xB7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xB8-0xBF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC0-0xC7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xC8-0xCF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD0-0xD7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xD8-0xDF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE0-0xE7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xE8-0xEF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_124256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
+  /*0xF8-0xFF*/ 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
+};
+
+static const _pSLuint16_Type Table_125256 =
+{
+  /*0x00-0x07*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x08-0x0F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x10-0x17*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x18-0x1F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x20-0x27*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x28-0x2F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x30-0x37*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x38-0x3F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x40-0x47*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x48-0x4F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x50-0x57*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x58-0x5F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x60-0x67*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x68-0x6F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x70-0x77*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x78-0x7F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x80-0x87*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x88-0x8F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x90-0x97*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0x98-0x9F*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA0-0xA7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xA8-0xAF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB0-0xB7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xB8-0xBF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC0-0xC7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xC8-0xCF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD0-0xD7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xD8-0xDF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE0-0xE7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xE8-0xEF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF0-0xF7*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80,
+  /*0xF8-0xFF*/ 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0A80, 0x0000, 0x0000
+};
+
+const _pSLuint16_Type *_pSLwc_Classification_Table4352 =
+{
+  Table_01,  Table_02,  Table_03,  Table_04,  Table_05,  Table_06,
+  Table_07,  Table_08,  Table_09,  Table_10,  Table_11,  Table_12,
+  Table_13,  Table_14,  Table_15,  Table_16,  Table_17,  Table_18,
+  Table_19,  Table_20,  Table_21,  Table_18,  Table_22,  Table_23,
+  Table_24,  Table_25,  Table_26,  Table_27,  Table_28,  Table_29,
+  Table_30,  Table_31,  Table_32,  Table_33,  Table_34,  Table_34,
+  Table_35,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_36,  Table_37,  Table_38,  Table_39,  Table_40,
+  Table_41,  Table_42,  Table_43,  Table_34,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_44,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_45,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_46,  Table_18,  Table_47,  Table_48,
+  Table_49,  Table_50,  Table_51,  Table_52,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_53,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_18,  Table_54,  Table_55,
+  Table_18,  Table_56,  Table_57,  Table_58,  Table_59,  Table_60,
+  Table_61,  Table_62,  Table_63,  Table_64,  Table_18,  Table_65,
+  Table_66,  Table_67,  Table_68,  Table_69,  Table_70,  Table_00,
+  Table_71,  Table_00,  Table_72,  Table_73,  Table_74,  Table_75,
+  Table_76,  Table_77,  Table_78,  Table_79,  Table_80,  Table_00,
+  Table_81,  Table_00,  Table_82,  Table_83,  Table_00,  Table_00,
+  Table_18,  Table_18,  Table_18,  Table_84,  Table_85,  Table_86,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_87,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_18,  Table_18,  Table_88,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_18,  Table_18,  Table_89,  Table_90,  Table_00,  Table_00,
+  Table_00,  Table_91,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_92,  Table_18,  Table_18,  Table_93,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_18,  Table_94,  Table_95,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_96,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_97,  Table_98,  Table_99,  Table_100,
+  Table_101,  Table_102,  Table_103,  Table_104,  Table_34,  Table_34,
+  Table_105,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_106,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_107,  Table_108,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_109,  Table_00,  Table_110,  Table_111,
+  Table_112,  Table_34,  Table_34,  Table_34,  Table_113,  Table_114,
+  Table_115,  Table_116,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_117,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_118,
+  Table_119,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_120,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,  Table_18,
+  Table_18,  Table_18,  Table_18,  Table_121,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_18,  Table_18,
+  Table_122,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_123,  Table_124,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_125,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,  Table_34,
+  Table_34,  Table_125
+};
+#endif /* DEFINE_PSLWC_CLASSIFICATION_TABLE */

_service:tar_scm:slang-2.3.2.tar.bz2/src/slistruc.c Added

@@ -0,0 +1,239 @@
+/* Intrinsic Structure type implementation */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+/* Intrinsic structures */
+
+typedef struct
+{
+   char *name;
+   VOID_STAR addr;
+   SLang_IStruct_Field_Type *fields;
+}
+_pSLang_IStruct_Type;
+
+static SLang_IStruct_Field_Type *istruct_pop_field (SLCONST char *name, int no_readonly, VOID_STAR *addr)
+{
+   _pSLang_IStruct_Type *s;
+   SLang_IStruct_Field_Type *f;
+   char *struct_addr;
+
+   /* Note: There is no need to free this object */
+   if (-1 == SLclass_pop_ptr_obj (SLANG_ISTRUCT_TYPE, VOID_STAR_STAR(&s)))
+     return NULL;
+
+   if (NULL == (struct_addr = *(char **)s->addr))
+     {
+	_pSLang_verror (SL_INTRINSIC_ERROR,
+		      "%s is NULL.  Unable to access field", s->name);
+	return NULL;
+     }
+
+   f = s->fields;
+   while (f->field_name != NULL)
+     {
+	/* Since both these are slstrings, just test pointers */
+	if (f->field_name != name)
+	  {
+	     f++;
+	     continue;
+	  }
+
+	if (no_readonly && f->read_only)
+	  {
+	     _pSLang_verror (SL_READONLY_ERROR,
+			   "%s.%s is read-only", s->name, name);
+	     return NULL;
+	  }
+
+	*addr = (VOID_STAR) (struct_addr + f->offset);
+	return f;
+     }
+
+   _pSLang_verror (SL_TYPE_MISMATCH,
+		 "%s has no field called %s", s->name, name);
+   return NULL;
+}
+
+static int istruct_sget (SLtype type, SLFUTURE_CONST char *name)
+{
+   SLang_IStruct_Field_Type *f;
+   VOID_STAR addr;
+   SLang_Class_Type *cl;
+
+   if (NULL == (f = istruct_pop_field (name, 0, &addr)))
+     return -1;
+
+   type = f->type;
+   cl = _pSLclass_get_class (type);
+
+   return (cl->cl_push_intrinsic)(f->type, addr);
+}
+
+static int istruct_sput (SLtype type, SLFUTURE_CONST char *name)
+{
+   SLang_IStruct_Field_Type *f;
+   VOID_STAR addr;
+   SLang_Class_Type *cl;
+
+   if (NULL == (f = istruct_pop_field (name, 1, &addr)))
+     return -1;
+
+   type = f->type;
+   cl = _pSLclass_get_class (type);
+
+   return (*cl->cl_pop) (type, addr);
+}
+
+static int istruct_push (SLtype type, VOID_STAR ptr)
+{
+   _pSLang_IStruct_Type *s;
+
+   s = *(_pSLang_IStruct_Type **) ptr;
+   if ((s == NULL)
+       || (s->addr == NULL)
+       || (*(char **) s->addr == NULL))
+     return SLang_push_null ();
+
+   return SLclass_push_ptr_obj (type, (VOID_STAR) s);
+}
+
+static int istruct_pop (SLtype type, VOID_STAR ptr)
+{
+   return SLclass_pop_ptr_obj (type, (VOID_STAR *)ptr);
+}
+
+static void istruct_destroy (SLtype type, VOID_STAR ptr)
+{
+   (void) type;
+   (void) ptr;
+}
+
+/* Intrinsic struct objects are not stored in a variable. So, the address that
+ * is passed here is actually a pointer to the struct.  So, pass its address
+ * to istruct_push since v is a variable.  Confusing, n'est pas?
+ */
+static int istruct_push_intrinsic (SLtype type, VOID_STAR v)
+{
+   return istruct_push (type, (VOID_STAR) &v);
+}
+
+static int init_intrin_struct (void)
+{
+   SLang_Class_Type *cl;
+   static int initialized;
+
+   if (initialized)
+     return 0;
+
+   if (NULL == (cl = SLclass_allocate_class ("IStruct_Type")))
+     return -1;
+
+   cl->cl_pop = istruct_pop;
+   cl->cl_push = istruct_push;
+   cl->cl_sget = istruct_sget;
+   cl->cl_sput = istruct_sput;
+   cl->cl_destroy = istruct_destroy;
+   cl->cl_push_intrinsic = istruct_push_intrinsic;
+
+   if (-1 == SLclass_register_class (cl, SLANG_ISTRUCT_TYPE, sizeof (_pSLang_IStruct_Type *),
+				     SLANG_CLASS_TYPE_PTR))
+     return -1;
+
+   initialized = 1;
+   return 0;
+}
+
+int SLns_add_istruct_table (SLang_NameSpace_Type *ns, SLang_IStruct_Field_Type *fields, VOID_STAR addr, SLFUTURE_CONST char *name)
+{
+   _pSLang_IStruct_Type *s;
+   SLang_IStruct_Field_Type *f;
+
+   if (-1 == init_intrin_struct ())
+     return -1;
+
+   if (addr == NULL)
+     {
+	_pSLang_verror (SL_INVALID_PARM,
+		      "SLadd_istruct_table: address must be non-NULL");
+	return -1;
+     }
+
+   if (fields == NULL)
+     return -1;
+
+   /* Make the field names slstrings so that only the pointers need to be
+    * compared.  However, this table may have been already been added for
+    * another instance of the intrinsic object.  So, check for the presence
+    * of an slstring.
+    */
+   f = fields;
+   while (f->field_name != NULL)
+     {
+	char *fname;
+
+	fname = SLang_create_slstring (f->field_name);
+	if (fname == NULL)
+	  return -1;
+
+	/* Here is the check for the slstring */
+	if (f->field_name == fname)
+	  SLang_free_slstring (fname);
+	else /* replace string literal with slstring */
+	  f->field_name = fname;
+
+	f++;
+     }
+
+   s = (_pSLang_IStruct_Type *)SLmalloc (sizeof (_pSLang_IStruct_Type));
+   if (s == NULL)
+     return -1;
+
+   memset ((char *)s, 0, sizeof (_pSLang_IStruct_Type));
+   if (NULL == (s->name = SLang_create_slstring (name)))
+     {
+	SLfree ((char *) s);
+	return -1;
+     }
+
+   s->addr = addr;
+   s->fields = fields;
+
+   if (-1 == SLns_add_intrinsic_variable (ns, name, (VOID_STAR) s, SLANG_ISTRUCT_TYPE, 1))
+     {
+	SLang_free_slstring (s->name);
+	SLfree ((char *) s);
+	return -1;
+     }
+
+   return 0;
+}
+
+int SLadd_istruct_table (SLang_IStruct_Field_Type *fields, VOID_STAR addr, SLFUTURE_CONST char *name)
+{
+   return SLns_add_istruct_table (NULL, fields, addr, name);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slkeymap.c Added

@@ -0,0 +1,703 @@
+/* Keymap routines for SLang. The role of these keymap routines is simple:
+ * Just read keys from the tty and return a pointer to a keymap structure.
+ * That is, a keymap is simple a mapping of strings (keys from tty) to
+ * structures. Also included are routines for managing the keymaps.
+ */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+/* FIXME: I need to add a copy-method so that copy-keymap will work with
+ * any object bound to the keysequence.
+ */
+
+/* We need a define a rule for upper and lower case chars that user cannot
+ change! This could be a problem for international chars! */
+
+#define UPPER_CASE_KEY(x) (((x) >= 'a') && ((x) <= 'z') ? (x) - 32 : (x))
+#define LOWER_CASE_KEY(x) (((x) >= 'A') && ((x) <= 'Z') ? (x) + 32 : (x))
+
+int SLang_Key_TimeOut_Flag = 0;	 /* true if more than 1 sec has elapsed
+ without key in multikey sequence */
+
+int SLang_Last_Key_Char = 0;
+
+SLkeymap_Type *SLKeyMap_List_Root = NULL;
+
+typedef struct _Key_Methods_Type
+{
+ int type;
+ void (*free_method) (int, VOID_STAR);
+}
+Key_Methods_Type;
+
+static unsigned int Num_Key_Methods;
+
+static void free_interpret_key (int type, VOID_STAR addr)
+{
+ (void) type;
+
+ SLang_free_slstring (*(char **) addr);
+}
+
+#define SLKEYMAP_MAX_TYPES 16
+static Key_Methods_Type Key_Methods_TableSLKEYMAP_MAX_TYPES =
+{
+ {SLKEY_F_INTERPRET, free_interpret_key}
+};
+
+static Key_Methods_Type *find_key_methods (int type)
+{
+ Key_Methods_Type *k, *kmax;
+
+ k = Key_Methods_Table;
+ kmax = k + Num_Key_Methods;
+
+ while (k < kmax)
+ {
+	if (k->type == type)
+	 return k;
+
+	k++;
+ }
+ return NULL;
+}
+
+static Key_Methods_Type *alloc_key_methods (int type)
+{
+ Key_Methods_Type *k;
+
+ if (Num_Key_Methods >= SLKEYMAP_MAX_TYPES)
+ {
+	_pSLang_verror (SL_LimitExceeded_Error, "Maximum number of keymap types exceeded");
+	return NULL;
+ }
+ k = Key_Methods_Table + Num_Key_Methods;
+ k->type = type;
+ Num_Key_Methods++;
+ return k;
+}
+
+int SLkm_set_free_method (int type, void (*f)(int, VOID_STAR))
+{
+ Key_Methods_Type *k;
+
+ if ((NULL == (k = find_key_methods (type)))
+ && (NULL == (k = alloc_key_methods (type))))
+ return -1;
+
+ k->free_method = f;
+ return 0;
+}
+
+/* This frees the function associated with the key, but does not does not
+ * do anything with the keysequence (str) field.
+ */
+static void free_key_function (SLang_Key_Type *key)
+{
+ Key_Methods_Type *k;
+
+ k = find_key_methods (key->type);
+ if ((k != NULL) && (k->free_method != NULL))
+ (*k->free_method) (key->type, &key->f);
+
+ key->f.f = NULL;
+ key->type = 0;
+ /* *key->str = 0; Let caller do this */
+}
+
+static SLang_Key_Type *malloc_key(unsigned char *str)
+{
+ SLang_Key_Type *neew;
+
+ if (NULL == (neew = (SLang_Key_Type *) SLmalloc(sizeof(SLang_Key_Type))))
+ return NULL;
+
+ SLMEMSET ((char *) neew, 0, sizeof (SLang_Key_Type));
+ SLMEMCPY((char *) neew->str, (char *) str, (unsigned int) *str);
+ return(neew);
+}
+
+static SLkeymap_Type *add_keymap (SLFUTURE_CONST char *name, SLang_Key_Type *map)
+{
+ SLkeymap_Type *km;
+
+ if (NULL == (km = (SLkeymap_Type *)SLcalloc (1, sizeof(SLkeymap_Type))))
+ return NULL;
+
+ if (NULL == (km->name = SLang_create_slstring (name)))
+ {
+	SLfree ((char *)km);
+	return NULL;
+ }
+ km->keymap = map;
+ km->next = SLKeyMap_List_Root;
+ SLKeyMap_List_Root = km;
+ return km;
+}
+
+FVOID_STAR SLang_find_key_function (SLFUTURE_CONST char *name, SLkeymap_Type *keymap)
+{
+ SLKeymap_Function_Type *fp = keymap -> functions;
+ char ch = *name;
+
+ while ((fp != NULL) && (fp->name != NULL))
+ {
+	if ((ch == *fp->name)
+	 && (0 == strcmp(fp->name, name)))
+	 return (FVOID_STAR) fp->f;
+
+	fp++;
+ }
+ return NULL;
+}
+
+#ifdef REAL_UNIX_SYSTEM
+/* Expand termcap string specified by s. s as passed will have the format:
+ * "XY)..." where XY represents a termcap keyname.
+ */
+static SLFUTURE_CONST char *process_termcap_string (SLFUTURE_CONST char *s, char *str, int *ip, int imax)
+{
+ char c3, *val;
+ int i;
+
+ if ((0 == (c0 = s0))
+ || (0 == (c1 = s1))
+ || (s2 != ')'))
+ {
+	_pSLang_verror (SL_SYNTAX_ERROR, "setkey: ^(%s is badly formed", s);
+	return NULL;
+ }
+ s += 3;
+
+ c2 = 0;
+ if ((NULL == (val = SLtt_tgetstr (c)))
+ || (*val == 0))
+ return NULL;
+
+ i = *ip;
+ while ((i < imax) && (*val != 0))
+ {
+	stri++ = *val++;
+ }
+ *ip = i;
+
+ return s;
+}
+#endif
+
+/* convert things like "^A" to 1 etc... The 0th char is the strlen INCLUDING
+ * the length character itself.
+ */
+char *SLang_process_keystring(SLFUTURE_CONST char *s)
+{
+ /* FIXME: v2.0, make this thread safe */
+ static char str32;
+ int i;
+
+ i = 1;
+ while (*s != 0)
+ {
+	unsigned char ch = (unsigned char) *s++;
+	if (ch == '^')
+	 {
+	 ch = *s++;
+	 if (ch == 0)
+	 {
+		 if (i < 32)
+		 stri++ = '^';
+		 break;
+	 }
+#ifdef REAL_UNIX_SYSTEM
+	 if (ch == '(')
+	 {
+		 s = process_termcap_string (s, str, &i, 32);
+		 if (s == NULL)
+		 {
+		 str0 = 1;
+		 return str;
+		 }
+		 continue;
+	 }
+#endif
+	 ch = UPPER_CASE_KEY(ch);
+	 if (ch == '?') ch = 127; else ch = ch - 'A' + 1;
+	 }
+
+	if (i >= 32) break;
+	stri++ = ch;
+ }
+
+ if (i > SLANG_MAX_KEYMAP_KEY_SEQ)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Key sequence is too long");
+	return NULL;
+ }
+
+ str0 = i;
+ return(str);
+}
+
+static int key_string_compare (unsigned char *a, unsigned char *b, unsigned int len)
+{
+ unsigned char *amax = a + len;
+ int cha_up, chb_up;
+
+ while (a < amax)
+ {
+	int cha, chb;
+
+	cha = *a++;
+	chb = *b++;
+
+	if (cha == chb) continue;
+
+	cha_up = UPPER_CASE_KEY(cha);
+	chb_up = UPPER_CASE_KEY(chb);
+
+	if (cha_up == chb_up)
+	 {
+	 /* Use case-sensitive result. */
+	 return cha - chb;
+	 }
+	/* Use case-insensitive result. */
+	return cha_up - chb_up;
+ }
+ return 0;
+}
+
+#define KEY_DEFINITION_ERROR_MSG "Inconsistent key-definition"
+
+/* This function also performs an insertion in an ordered way. */
+static int find_the_key (SLFUTURE_CONST char *s, SLkeymap_Type *kml, SLang_Key_Type **keyp)
+{
+ unsigned char ch;
+ unsigned int str_len;
+ SLang_Key_Type *key, *last, *neew;
+ unsigned char *str;
+
+ *keyp = NULL;
+
+ if (NULL == (str = (unsigned char *) SLang_process_keystring(s)))
+ return -2;
+
+ if (1 == (str_len = str0))
+ return 0;
+
+ ch = str1;
+ key = kml->keymap + ch;
+
+ if (str_len == 2)
+ {
+	if (key->next != NULL)
+	 {
+	 _pSLang_verror (SL_INVALID_PARM, KEY_DEFINITION_ERROR_MSG);
+	 return -2;
+	 }
+
+	free_key_function (key);
+
+	key->str0 = str_len;
+	key->str1 = ch;
+
+	*keyp = key;
+	return 0;
+ }
+
+ /* insert the key definition */
+ while (1)
+ {
+	int cmp;
+	unsigned int key_len, len;
+
+	last = key;
+	key = key->next;
+
+	if ((key != NULL) && (key->str != NULL))
+	 {
+	 len = key_len = key->str0;
+	 if (len > str_len) len = str_len;
+
+	 cmp = key_string_compare (str + 1, key->str + 1, len - 1);
+
+	 if (cmp > 0)
+	 continue;
+
+	 if (cmp == 0)
+	 {
+		 if (key_len != str_len)
+		 {
+		 _pSLang_verror (SL_INVALID_PARM, KEY_DEFINITION_ERROR_MSG);
+		 return -2;
+		 }
+
+		 free_key_function (key);
+
+		 *keyp = key;
+		 return 0;
+	 }
+	 /* Drop to cmp < 0 case */
+	 }
+
+	if (NULL == (neew = malloc_key(str))) return -1;
+
+	neew -> next = key;
+	last -> next = neew;
+
+	*keyp = neew;
+	return 0;
+ }
+}
+
+/* returns -2 if inconsistent, -1 if malloc error, 0 upon success */
+int SLkm_define_key (SLFUTURE_CONST char *s, FVOID_STAR f, SLkeymap_Type *kml)
+{
+ SLang_Key_Type *key;
+ unsigned int type = SLKEY_F_INTRINSIC;
+ int ret;
+
+ ret = find_the_key (s, kml, &key);
+ if ((ret != 0) || (key == NULL))
+ return ret;
+
+ key->type = type;
+ key->f.f = f;
+ return 0;
+}
+
+int SLang_define_key (SLFUTURE_CONST char *s, SLFUTURE_CONST char *funct, SLkeymap_Type *kml)
+{
+ SLang_Key_Type *key;
+ FVOID_STAR f;
+ int ret;
+
+ ret = find_the_key (s, kml, &key);
+ if ((ret != 0) || (key == NULL))
+ return ret;
+
+ f = SLang_find_key_function(funct, kml);
+
+ if (f == NULL) /* assume interpreted */
+ {
+	char *str = SLang_create_slstring (funct);
+	if (str == NULL) return -1;
+	key->type = SLKEY_F_INTERPRET;
+	key->f.s = str;
+ }
+ else
+ {
+	key->type = SLKEY_F_INTRINSIC;
+	key->f.f = f;
+ }
+ return 0;
+}
+
+int SLkm_define_keysym (SLFUTURE_CONST char *s, unsigned int keysym, SLkeymap_Type *kml)
+{
+ SLang_Key_Type *key;
+ int ret;
+
+ ret = find_the_key (s, kml, &key);
+
+ if ((ret != 0) || (key == NULL))
+ return ret;
+
+ key->type = SLKEY_F_KEYSYM;
+ key->f.keysym = keysym;
+ return 0;
+}
+
+int SLkm_define_slkey (SLFUTURE_CONST char *s, SLang_Name_Type *nt, SLkeymap_Type *kml)
+{
+ SLang_Key_Type *key;
+ int ret;
+
+ ret = find_the_key (s, kml, &key);
+ if ((ret != 0) || (key == NULL))
+ return ret;
+
+ key->type = SLKEY_F_SLANG;
+ key->f.slang_fun = nt;
+ return 0;
+}
+
+SLang_Key_Type *SLang_do_key(SLkeymap_Type *kml, int (*getkey)(void))
+{
+ register SLang_Key_Type *key, *next, *kmax;
+ unsigned int len;
+ unsigned char input_ch;
+ register unsigned char chup;
+ unsigned char key_ch = 0;
+
+ SLang_Last_Key_Char = (*getkey)();
+ SLang_Key_TimeOut_Flag = 0;
+
+ if (SLANG_GETKEY_ERROR == (unsigned int) SLang_Last_Key_Char)
+ return NULL;
+
+ input_ch = (unsigned char) SLang_Last_Key_Char;
+
+ key = (SLang_Key_Type *) &((kml->keymap)input_ch);
+
+ /* if the next one is null, then we know this MAY be it. */
+ while (key->next == NULL)
+ {
+	if (key->type != 0)
+	 return key;
+
+	/* Try its opposite case counterpart */
+	if (input_ch == LOWER_CASE_KEY(input_ch))
+	 input_ch = UPPER_CASE_KEY(input_ch);
+
+	key = kml->keymap + input_ch;
+	if (key->type == 0)
+	 return NULL;
+ }
+
+ /* It appears to be a prefix character in a key sequence. */
+
+ len = 1;			 /* already read one character */
+ key = key->next;		 /* Now we are in the key list */
+ kmax = NULL;			 /* set to end of list */
+
+ while (1)
+ {
+	SLang_Key_TimeOut_Flag = 1;
+	SLang_Last_Key_Char = (*getkey)();
+	SLang_Key_TimeOut_Flag = 0;
+
+	len++;
+
+	if ((SLANG_GETKEY_ERROR == (unsigned int) SLang_Last_Key_Char)
+	 || SLKeyBoard_Quit)
+	 break;
+
+	input_ch = (unsigned char) SLang_Last_Key_Char;
+
+	chup = UPPER_CASE_KEY(input_ch);
+
+	while (key != kmax)
+	 {
+	 if (key->str0 > len)
+	 {
+		 key_ch = key->strlen;
+		 if (chup == UPPER_CASE_KEY(key_ch))
+		 break;
+	 }
+	 key = key->next;
+	 }
+
+	if (key == kmax) break;
+
+	/* If the input character is lowercase, check to see if there is
+	 * a lowercase match. If so, set key to it. Note: the
+	 * algorithm assumes the sorting performed by key_string_compare.
+	 */
+	if (input_ch != key_ch)
+	 {
+	 next = key->next;
+	 while (next != kmax)
+	 {
+		 if (next->str0 > len)
+		 {
+		 unsigned char next_ch = next->strlen;
+		 if (next_ch == input_ch)
+			 {
+			 key = next;
+			 break;
+			 }
+		 if (next_ch != chup)
+			 break;
+		 }
+		 next = next->next;
+	 }
+	 }
+
+	/* Ok, we found the first position of a possible match. If it
+	 * is exact, we are done.
+	 */
+	if ((unsigned int) key->str0 == len + 1)
+	 return key;
+
+	/* Apparantly, there are some ambiguities. Read next key to resolve
+	 * the ambiguity. Adjust kmax to encompass ambiguities.
+	 */
+
+	next = key->next;
+	while (next != kmax)
+	 {
+	 if ((unsigned int) next->str0 > len)
+	 {
+		 key_ch = next->strlen;
+		 if (chup != UPPER_CASE_KEY(key_ch))
+		 break;
+	 }
+	 next = next->next;
+	 }
+	kmax = next;
+ }
+
+ return NULL;
+}
+
+void SLang_undefine_key(SLFUTURE_CONST char *s, SLkeymap_Type *kml)
+{
+ int n, i;
+ SLang_Key_Type *key, *next, *last, *key_root, *keymap;
+ unsigned char *str;
+
+ keymap = kml -> keymap;
+ if (NULL == (str = (unsigned char *) SLang_process_keystring(s)))
+ return;
+
+ if (0 == (n = *str++ - 1)) return;
+ i = *str;
+
+ last = key_root = (SLang_Key_Type *) &(keymapi);
+ key = key_root->next;
+
+ while (key != NULL)
+ {
+	next = key->next;
+	if (0 == SLMEMCMP ((char *)(key->str + 1), (char *) str, n))
+	 {
+	 free_key_function (key);
+
+	 SLfree((char *) key);
+	 last->next = next;
+	 }
+	else last = key;
+	key = next;
+ }
+
+ if (n == 1)
+ {
+	free_key_function (key_root);
+	key_root->str0 = 0;
+ }
+}
+
+char *SLang_make_keystring(unsigned char *s)
+{
+ static char buf 3 * SLANG_MAX_KEYMAP_KEY_SEQ + 1;
+ char *b;
+ int n;
+
+ n = *s++ - 1;
+
+ if (n > SLANG_MAX_KEYMAP_KEY_SEQ)
+ {
+	_pSLang_verror (SL_BUILTIN_LIMIT_EXCEEDED, "Key sequence is too long");
+	return NULL;
+ }
+
+ b = buf;
+ while (n--)
+ {
+	if (*s < 32)
+	 {
+	 *b++ = '^';
+	 *b++ = *s + 'A' - 1;
+	 }
+	else *b++ = *s;
+	s++;
+ }
+ *b = 0;
+ return(buf);
+}
+
+static SLang_Key_Type *copy_keymap(SLkeymap_Type *kml)
+{
+ int i;
+ SLang_Key_Type *neew, *old, *new_root, *km;
+
+ if (NULL == (new_root = (SLang_Key_Type *) SLcalloc(256, sizeof(SLang_Key_Type))))
+ return NULL;
+
+ if (kml == NULL) return new_root;
+ km = kml->keymap;
+
+ for (i = 0; i < 256; i++)
+ {
+	old = &(kmi);
+	neew = &(new_rooti);
+
+	/* FIXME: A copy-method needs to be defined here and below */
+	if (old->type == SLKEY_F_INTERPRET)
+	 neew->f.s = SLang_create_slstring (old->f.s);
+	else
+	 neew->f.f = old->f.f;
+
+	neew->type = old->type;
+	SLMEMCPY((char *) neew->str, (char *) old->str, (unsigned int) *old->str);
+
+	old = old->next;
+	while (old != NULL)
+	 {
+	 neew->next = malloc_key((unsigned char *) old->str);
+	 neew = neew->next;
+
+	 if (old->type == SLKEY_F_INTERPRET)
+	 neew->f.s = SLang_create_slstring (old->f.s);
+	 else
+	 neew->f.f = old->f.f;
+
+	 neew->type = old->type;
+	 old = old->next;
+	 }
+	neew->next = NULL;
+ }
+ return(new_root);
+}
+
+SLkeymap_Type *SLang_create_keymap(SLFUTURE_CONST char *name, SLkeymap_Type *map)
+{
+ SLang_Key_Type *neew;
+ SLkeymap_Type *new_map;
+
+ if ((NULL == (neew = copy_keymap(map)))
+ || (NULL == (new_map = add_keymap(name, neew)))) return NULL;
+
+ if (map != NULL) new_map -> functions = map -> functions;
+
+ return new_map;
+}
+
+SLkeymap_Type *SLang_find_keymap(SLFUTURE_CONST char *name)
+{
+ SLkeymap_Type *kmap;
+
+ kmap = SLKeyMap_List_Root;
+
+ while (kmap != NULL)
+ {
+	if ((kmap->name != NULL)
+	 && (0 == strcmp (kmap->name, name)))
+	 return kmap;
+
+	kmap = kmap->next;
+ }
+ return NULL;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slkeypad.c Added

@@ -0,0 +1,197 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+static SLKeyMap_List_Type *Keymap_List;
+
+static int (*Getkey_Function)(void);
+
+int SLkp_init (void)
+{
+ char esc_seq10;
+ int i;
+
+ if (NULL == (Keymap_List = SLang_create_keymap ("_SLKeypad", NULL)))
+ return -1;
+
+ esc_seq1 = 0;
+ for (i = 1; i < 256; i++)
+ {
+	esc_seq0 = (char) i;
+	SLkm_define_keysym (esc_seq, i, Keymap_List);
+ }
+
+ /* Now add most common ones. */
+#ifndef IBMPC_SYSTEM
+ SLkm_define_keysym ("^@", 0, Keymap_List);
+
+ SLkm_define_keysym ("\033A", SL_KEY_UP, Keymap_List);
+ SLkm_define_keysym ("\033OA", SL_KEY_UP, Keymap_List);
+ SLkm_define_keysym ("\033B", SL_KEY_DOWN, Keymap_List);
+ SLkm_define_keysym ("\033OB", SL_KEY_DOWN, Keymap_List);
+ SLkm_define_keysym ("\033C", SL_KEY_RIGHT, Keymap_List);
+ SLkm_define_keysym ("\033OC", SL_KEY_RIGHT, Keymap_List);
+ SLkm_define_keysym ("\033D", SL_KEY_LEFT, Keymap_List);
+ SLkm_define_keysym ("\033OD", SL_KEY_LEFT, Keymap_List);
+ SLkm_define_keysym ("\033F", SL_KEY_END, Keymap_List);
+ SLkm_define_keysym ("\033OF", SL_KEY_END, Keymap_List);
+ SLkm_define_keysym ("\033H", SL_KEY_HOME, Keymap_List);
+ SLkm_define_keysym ("\033OH", SL_KEY_HOME, Keymap_List);
+ SLkm_define_keysym ("\0332~", SL_KEY_IC, Keymap_List);
+ SLkm_define_keysym ("\0333~", SL_KEY_DELETE, Keymap_List);
+ SLkm_define_keysym ("\0335~", SL_KEY_PPAGE, Keymap_List);
+ SLkm_define_keysym ("\0336~", SL_KEY_NPAGE, Keymap_List);
+ SLkm_define_keysym ("\0337~", SL_KEY_HOME, Keymap_List);
+ SLkm_define_keysym ("\0338~", SL_KEY_END, Keymap_List);
+#else
+ /* Note: This will not work if SLgetkey_map_to_ansi (1) has
+ * been called.
+ */
+ SLkm_define_keysym ("^@\x48", SL_KEY_UP, Keymap_List );
+ SLkm_define_keysym ("^@\x50", SL_KEY_DOWN, Keymap_List );
+ SLkm_define_keysym ("^@\x4d", SL_KEY_RIGHT, Keymap_List );
+ SLkm_define_keysym ("^@\x4b", SL_KEY_LEFT, Keymap_List );
+ SLkm_define_keysym ("^@\x47", SL_KEY_HOME, Keymap_List );
+ SLkm_define_keysym ("^@\x49", SL_KEY_PPAGE, Keymap_List );
+ SLkm_define_keysym ("^@\x51", SL_KEY_NPAGE, Keymap_List );
+ SLkm_define_keysym ("^@\x4f", SL_KEY_END, Keymap_List );
+ SLkm_define_keysym ("^@\x52", SL_KEY_IC, Keymap_List );
+ SLkm_define_keysym ("^@\x53", SL_KEY_DELETE, Keymap_List );
+
+ SLkm_define_keysym ("\xE0\x48", SL_KEY_UP, Keymap_List );
+ SLkm_define_keysym ("\xE0\x50", SL_KEY_DOWN, Keymap_List );
+ SLkm_define_keysym ("\xE0\x4d", SL_KEY_RIGHT, Keymap_List );
+ SLkm_define_keysym ("\xE0\x4b", SL_KEY_LEFT, Keymap_List );
+ SLkm_define_keysym ("\xE0\x47", SL_KEY_HOME, Keymap_List );
+ SLkm_define_keysym ("\xE0\x49", SL_KEY_PPAGE, Keymap_List );
+ SLkm_define_keysym ("\xE0\x51", SL_KEY_NPAGE, Keymap_List );
+ SLkm_define_keysym ("\xE0\x4f", SL_KEY_END, Keymap_List );
+ SLkm_define_keysym ("\xE0\x52", SL_KEY_IC, Keymap_List );
+ SLkm_define_keysym ("\xE0\x53", SL_KEY_DELETE, Keymap_List );
+
+ strcpy (esc_seq, "^@ ");	 /* guarantees esc_seq3 = 0. */
+
+ for (i = 0x3b; i < 0x45; i++)
+ {
+	 esc_seq 2 = i;
+	 SLkm_define_keysym (esc_seq, SL_KEY_F(i - 0x3a), Keymap_List);
+ }
+ esc_seq2 = 0x57; SLkm_define_keysym (esc_seq, SL_KEY_F(11), Keymap_List);
+ esc_seq2 = 0x58; SLkm_define_keysym (esc_seq, SL_KEY_F(12), Keymap_List);
+#endif
+
+#ifdef REAL_UNIX_SYSTEM
+ strcpy (esc_seq, "^(kX)");
+ for (i = 0; i <= 9; i++)
+ {
+	esc_seq3 = '0' + i;
+	SLkm_define_keysym (esc_seq, SL_KEY_F(i), Keymap_List);
+ }
+ SLkm_define_keysym ("^(k;)", SL_KEY_F(10), Keymap_List);
+ SLkm_define_keysym ("^(F1)", SL_KEY_F(11), Keymap_List);
+ SLkm_define_keysym ("^(F2)", SL_KEY_F(12), Keymap_List);
+
+ SLkm_define_keysym ("^(ku)", SL_KEY_UP, Keymap_List);
+ SLkm_define_keysym ("^(kd)", SL_KEY_DOWN, Keymap_List);
+ SLkm_define_keysym ("^(kl)", SL_KEY_LEFT, Keymap_List);
+ SLkm_define_keysym ("^(kr)", SL_KEY_RIGHT, Keymap_List);
+ SLkm_define_keysym ("^(kP)", SL_KEY_PPAGE, Keymap_List);
+ SLkm_define_keysym ("^(kN)", SL_KEY_NPAGE, Keymap_List);
+ SLkm_define_keysym ("^(kh)", SL_KEY_HOME, Keymap_List);
+ SLkm_define_keysym ("^(@7)", SL_KEY_END, Keymap_List);
+ SLkm_define_keysym ("^(K1)", SL_KEY_A1, Keymap_List);
+ SLkm_define_keysym ("^(K3)", SL_KEY_A3, Keymap_List);
+ SLkm_define_keysym ("^(K2)", SL_KEY_B2, Keymap_List);
+ SLkm_define_keysym ("^(K4)", SL_KEY_C1, Keymap_List);
+ SLkm_define_keysym ("^(K5)", SL_KEY_C3, Keymap_List);
+ SLkm_define_keysym ("^(%0)", SL_KEY_REDO, Keymap_List);
+ SLkm_define_keysym ("^(&8)", SL_KEY_UNDO, Keymap_List);
+ SLkm_define_keysym ("^(kb)", SL_KEY_BACKSPACE, Keymap_List);
+ SLkm_define_keysym ("^(@8)", SL_KEY_ENTER, Keymap_List);
+ SLkm_define_keysym ("^(kD)", SL_KEY_DELETE, Keymap_List);
+#endif
+
+ if (_pSLang_Error)
+ return -1;
+ return 0;
+}
+
+int SLkp_getkey (void)
+{
+ SLang_Key_Type *key;
+
+ if (Getkey_Function == NULL)
+ Getkey_Function = (int (*)(void)) SLang_getkey;
+
+ key = SLang_do_key (Keymap_List, Getkey_Function);
+ if ((key == NULL) || (key->type != SLKEY_F_KEYSYM))
+ {
+	SLang_flush_input ();
+	return SL_KEY_ERR;
+ }
+
+ return key->f.keysym;
+}
+
+int SLkp_define_keysym (SLFUTURE_CONST char *keystr, unsigned int keysym)
+{
+ if (SLkm_define_keysym (keystr, keysym, Keymap_List) < 0)
+ return -1;
+
+ return 0;
+}
+
+void SLkp_set_getkey_function (int (*f)(void))
+{
+ if (f == NULL)
+ Getkey_Function = (int (*)(void)) SLang_getkey;
+ else
+ Getkey_Function = f;
+}
+
+#if 0
+int main (int argc, char **argv)
+{
+ int ch;
+
+ SLtt_get_terminfo ();
+
+ if (-1 == SLkp_init ())
+ return 1;
+
+ SLang_init_tty (-1, 0, 0);
+
+ while ('q' != (ch = SLkp_getkey ()))
+ {
+	fprintf (stdout, "Keycode = %d\r\n", ch);
+	fflush (stdout);
+ }
+
+ SLang_reset_tty ();
+
+ return 0;
+}
+#endif
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/sllimits.h Added

@@ -0,0 +1,104 @@
+/* sllimits.h */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#define USE_NEW_HASH_CODE	1
+
+/* slstring.c: Size of the hash table used for strings (prime numbers) */
+#define SLSTRING_HASH_TABLE_SIZE       140009  /* was 32327, 25013, 10007 */
+/* Other large primes: 70001, 100003, 300007,... */
+/* slang.c: maximum size of run time stack */
+#ifdef __MSDOS_16BIT__
+# define SLANG_MAX_STACK_LEN		500
+#else
+# define SLANG_MAX_STACK_LEN		2500
+#endif
+
+/* slang.c: This sets the size on the depth of function calls.
+ * Note: The greater the recursion depth, the more likely it is to run
+ * out of C runtime library stackspace.  The numbers below are conservative
+ */
+#ifdef __MSDOS_16BIT__
+# define SLANG_MAX_RECURSIVE_DEPTH	50
+#else
+# if (defined(__WIN32__) || defined(__CYGWIN__))
+#  define SLANG_MAX_RECURSIVE_DEPTH	500
+# else
+#  define SLANG_MAX_RECURSIVE_DEPTH	1500
+# endif
+#endif
+
+/* slang.c: Size of the stack used for local variables */
+#ifdef __MSDOS_16BIT__
+# define SLANG_MAX_LOCAL_STACK		200
+#else
+# define SLANG_MAX_LOCAL_STACK		(10*SLANG_MAX_RECURSIVE_DEPTH)
+#endif
+
+/* slang.c: The size of the hash table used for local and global objects.
+ * These should be prime numbers.
+ */
+#if USE_NEW_HASH_CODE
+# define SLGLOBALS_HASH_TABLE_SIZE	2048
+# define SLLOCALS_HASH_TABLE_SIZE	64
+# define SLSTATIC_HASH_TABLE_SIZE	64
+#else
+# define SLGLOBALS_HASH_TABLE_SIZE	2909
+# define SLLOCALS_HASH_TABLE_SIZE	73
+# define SLSTATIC_HASH_TABLE_SIZE	73
+#endif
+
+/* Do not change this */
+#define SL_MAX_TOKEN_LEN		254
+
+/* Size of the keyboard buffer use by the ungetkey routines */
+#ifdef __MSDOS_16BIT__
+# define SL_MAX_INPUT_BUFFER_LEN	40
+#else
+# define SL_MAX_INPUT_BUFFER_LEN	1024
+#endif
+
+/* Maximum number of nested switch statements */
+#define SLANG_MAX_NESTED_SWITCH		10
+
+/* Size of the block stack (used in byte-compiling) */
+#define SLANG_MAX_BLOCK_STACK_LEN	50
+
+/* slfile.c: Max number of open file pointers */
+#ifdef __MSDOS_16BIT__
+# define SL_MAX_FILES			32
+#else
+# define SL_MAX_FILES			256
+#endif
+
+/* slarrfun.inc: Default value of the innerprod block size */
+#define SLANG_INNERPROD_BLOCK_SIZE	29
+
+#if !defined(__MSDOS_16BIT__)
+# define SLTT_MAX_SCREEN_COLS 512
+# define SLTT_MAX_SCREEN_ROWS 512
+# define SLTT_MAX_COLORS 0x8000       /* consistent with SLSMG_COLOR_MASK */
+#else
+# define SLTT_MAX_SCREEN_ROWS 64
+# define SLTT_MAX_SCREEN_COLS 75
+/* #define SLTT_MAX_COLORS 0x8000 */  /* use slvideo.c default */
+#endif
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/sllist.c Added

@@ -0,0 +1,1349 @@
+/* List of objects */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+/* #define SL_APP_WANTS_FOREACH */
+#include "slang.h"
+#include "_slang.h"
+
+/* A list is a heterogeneous collection of objects. The list container
+ * object here supports the following operations:
+ *
+ * append (list, a) ==> list = {list, a}.
+ * prepend (list, a) ==> list = {a, list}.
+ * extract (list, n) ==> listn (n = 0, ...)
+ * insert (list, a, n) ==> list = {list0,...listn-1,a,listn,...}
+ * delete (list, n) ==> list = {list0, ... listn-1,listn+1,...}
+ * length (list) ==> num elements
+ * eqs (listA, listB)
+ * reverse (list)
+ * copy (list)
+ */
+
+typedef struct _Chunk_Type
+{
+ struct _Chunk_Type *next;
+ struct _Chunk_Type *prev;
+ SLindex_Type num_elements;
+ SLindex_Type chunk_size;
+ SLang_Object_Type *elements;	 /* chunk_size of em */
+}
+Chunk_Type;
+
+struct _pSLang_List_Type
+{
+ SLindex_Type length;
+#define DEFAULT_CHUNK_SIZE	128
+ SLuindex_Type default_chunk_size;
+ Chunk_Type *first;
+ Chunk_Type *last;
+
+ Chunk_Type *recent;		 /* most recent chunk accessed */
+ SLindex_Type recent_num;	 /* num elements before the recent chunk */
+ int ref_count;
+};
+
+static void delete_chunk (Chunk_Type *c)
+{
+ unsigned int i, n;
+ SLang_Object_Type *objs;
+
+ if (c == NULL)
+ return;
+
+ n = c->num_elements;
+ objs = c->elements;
+ for (i = 0; i < n; i++)
+ SLang_free_object (objs+i);
+ SLfree ((char *) objs);
+ SLfree ((char *) c);
+}
+
+static Chunk_Type *new_chunk (unsigned int size)
+{
+ Chunk_Type *c;
+
+ c = (Chunk_Type *) SLcalloc (1, sizeof (Chunk_Type));
+ if (c == NULL)
+ return c;
+
+ c->elements = (SLang_Object_Type *)SLcalloc(size, sizeof(SLang_Object_Type));
+ if (c->elements == NULL)
+ {
+	SLfree ((char *) c);
+	return NULL;
+ }
+ c->chunk_size = size;
+ return c;
+}
+
+static void delete_chunk_chain (Chunk_Type *c)
+{
+ while (c != NULL)
+ {
+	Chunk_Type *next;
+	next = c->next;
+	delete_chunk (c);
+	c = next;
+ }
+}
+
+static void free_list (SLang_List_Type *list)
+{
+ if (list == NULL)
+ return;
+
+ if (list->ref_count > 1)
+ {
+	list->ref_count--;
+	return;
+ }
+
+ delete_chunk_chain (list->first);
+ SLfree ((char *) list);
+}
+
+static int make_chunk_chain (SLindex_Type length, Chunk_Type **firstp, Chunk_Type **lastp, int chunk_size)
+{
+ Chunk_Type *last, *first;
+
+ if (NULL == (first = new_chunk (chunk_size)))
+ return -1;
+ length -= chunk_size;
+
+ last = first;
+ while (length > 0)
+ {
+	Chunk_Type *next;
+	if (NULL == (next = new_chunk (chunk_size)))
+	 {
+	 delete_chunk_chain (first);
+	 return -1;
+	 }
+	last->next = next;
+	next->prev = last;
+	last = next;
+	length -= chunk_size;
+ }
+ *firstp = first;
+ *lastp = last;
+ return 0;
+}
+
+static SLang_List_Type *allocate_list (SLindex_Type chunk_size)
+{
+ SLang_List_Type *list;
+
+ if (chunk_size <= 0)
+ chunk_size = DEFAULT_CHUNK_SIZE;
+ else if (chunk_size > 2*DEFAULT_CHUNK_SIZE)
+ chunk_size = 2*DEFAULT_CHUNK_SIZE;
+
+ list = (SLang_List_Type *)SLcalloc (1, sizeof (SLang_List_Type));
+ if (list != NULL)
+ {
+	list->ref_count = 1;
+	list->default_chunk_size = chunk_size;
+ }
+ return list;
+}
+
+static SLang_Object_Type *find_nth_element (SLang_List_Type *list, SLindex_Type nth, Chunk_Type **cp)
+{
+ Chunk_Type *c, *first, *last;
+ SLindex_Type n, next_n;
+ SLindex_Type length;
+ int dir;
+
+ length = list->length;
+ if (nth < 0)
+ nth += length;
+
+ if ((nth < 0) || (nth >= length))
+ {
+	_pSLang_verror (SL_Index_Error, "List Index out of range");
+	return NULL;
+ }
+
+ n = 0;
+ first = list->first;
+ last = list->last;
+ dir = 1;
+
+ if (list->recent != NULL)
+ {
+	SLindex_Type mid = list->recent_num;
+	if (nth < mid)
+	 {
+	 if (nth > mid/2)
+	 {
+		 dir = -1;
+		 n = mid;
+		 last = list->recent->prev;
+		 /* Note: last cannot be NULL. The only way for it to be NULL
+		 * is for list->recent == list_first, which would mean that
+		 * mid==0. But the condition here is that nth < mid, and
+		 * nth >= 0
+		 */
+	 }
+	 }
+	else
+	 {
+	 if (nth > (mid/2 + length/2))
+	 {
+		 dir = -1;
+		 n = length;
+	 }
+	 else
+	 {
+		 dir = 1;
+		 n = mid;
+		 first = list->recent;
+	 }
+	 }
+ }
+ else if (nth > length/2)
+ {
+	n = length;
+	dir = -1;
+ }
+
+ if (dir > 0)
+ {
+	c = first;
+	while (nth >= (next_n = n + c->num_elements))
+	 {
+	 n = next_n;
+	 c = c->next;
+	 }
+	if (cp != NULL)
+	 *cp = c;
+
+	list->recent = c;
+	list->recent_num = n;
+
+	return c->elements + (nth - n);
+ }
+
+ c = last;
+ while ((next_n = n - c->num_elements) > nth)
+ {
+	n = next_n;
+	c = c->prev;
+ }
+
+ if (cp != NULL)
+ *cp = c;
+
+ list->recent = c;
+ list->recent_num = next_n;
+ return c->elements + (nth - next_n);
+}
+
+static int pop_list (SLang_List_Type **list)
+{
+ if (-1 == SLclass_pop_ptr_obj (SLANG_LIST_TYPE, (VOID_STAR *) list))
+ {
+	*list = NULL;
+	return -1;
+ }
+ return 0;
+}
+
+/* FIXME: This is currently used only by list_dereference and breaks on an
+ * empty list. For this reason, it would probably fail in other contexts.
+ */
+static SLang_List_Type *make_sublist (SLang_List_Type *list, SLindex_Type indx_a, SLindex_Type length)
+{
+ SLang_List_Type *new_list;
+ Chunk_Type *c, *new_c;
+ SLindex_Type i;
+ SLang_Object_Type *obj, *obj_max, *new_obj, *new_obj_max;
+
+ if (length == 0)
+ return allocate_list (0);
+
+ if ((indx_a < 0) || (indx_a + (length - 1) >= list->length))
+ {
+	_pSLang_verror (SL_Index_Error, "Indices are out of range for list object");
+	return NULL;
+ }
+
+ if (NULL == (new_list = allocate_list (length)))
+ return NULL;
+
+ if (-1 == make_chunk_chain (length, &new_list->first, &new_list->last, list->default_chunk_size))
+ {
+	free_list (new_list);
+	return NULL;
+ }
+ obj = find_nth_element (list, indx_a, &c);
+ if (obj == NULL)
+ {
+	free_list (new_list);
+	return NULL;
+ }
+ obj_max = c->elements + c->num_elements;
+
+ new_list->length = length;
+ new_c = new_list->first;
+ new_obj = new_c->elements;
+ new_obj_max = new_obj + new_c->chunk_size;
+
+ for (i = 0; i < length; i++)
+ {
+	while (obj == obj_max)
+	 {
+	 c = c->next;
+	 obj = c->elements;
+	 obj_max = obj + c->num_elements;
+	 }
+	if (new_obj == new_obj_max)
+	 {
+	 new_c = new_c->next;
+	 new_obj = new_c->elements;
+	 new_obj_max = new_obj + new_c->chunk_size;
+	 }
+
+	if ((-1 == _pSLpush_slang_obj (obj))
+	 || (-1 == SLang_pop (new_obj)))
+	 {
+	 free_list (new_list);
+	 return NULL;
+	 }
+
+	new_c->num_elements++;
+	obj++;
+	new_obj++;
+ }
+ return new_list;
+}
+
+static void list_delete_elem (SLang_List_Type *list, SLindex_Type *indxp)
+{
+ SLang_Object_Type *elem;
+ Chunk_Type *c;
+ char *src, *dest, *src_max;
+ SLindex_Type indx;
+
+ indx = *indxp;
+ if (NULL == (elem = find_nth_element (list, indx, &c)))
+ return;
+
+ if (indx < 0) indx += list->length; /* checked by find_nth_element */
+
+ SLang_free_object (elem);
+ c->num_elements--;
+ list->length--;
+
+ if (c->num_elements == 0)
+ {
+	if (list->first == c)
+	 list->first = c->next;
+	if (list->last == c)
+	 list->last = c->prev;
+	if (c->next != NULL)
+	 c->next->prev = c->prev;
+	if (c->prev != NULL)
+	 c->prev->next = c->next;
+	delete_chunk (c);
+	if (list->recent == c)
+	 list->recent = NULL;
+	return;
+ }
+
+ src = (char *) (elem + 1);
+ dest = (char *) elem;
+ src_max = src + sizeof(SLang_Object_Type)*((c->elements+c->num_elements)-elem);
+ while (src < src_max)
+ *dest++ = *src++;
+
+ if ((list->recent != NULL) && (list->recent_num > indx))
+ list->recent_num--;
+}
+
+static void slide_right (Chunk_Type *c, int n)
+{
+ SLang_Object_Type *e2, *e1;
+
+ e2 = c->elements + c->num_elements;
+ e1 = c->elements + n;
+
+ while (e2 != e1)
+ {
+	*e2 = *(e2-1);
+	e2--;
+ }
+}
+
+static int insert_element (SLang_List_Type *list, SLang_Object_Type *obj, SLindex_Type indx)
+{
+ Chunk_Type *c, *c1;
+ SLang_Object_Type *elem;
+ SLindex_Type num;
+ int equality_ok = 0;
+
+ if (indx == 0)
+ {
+	c = list->first;
+	if ((c != NULL)
+	 && (c->num_elements < c->chunk_size))
+	 {
+	 slide_right (c, 0);
+	 c->elements0 = *obj;
+	 goto the_return;
+	 }
+	if (list->default_chunk_size < DEFAULT_CHUNK_SIZE)
+	 list->default_chunk_size *= 2;
+	if (NULL == (c = new_chunk (list->default_chunk_size)))
+	 return -1;
+
+	c->next = list->first;
+	if (list->first != NULL)
+	 list->first->prev = c;
+	list->first = c;
+	if (list->last == NULL)
+	 list->last = c;
+	c->elements0 = *obj;
+
+ equality_ok = 1;
+	goto the_return;
+ }
+
+ if (indx == list->length)
+ {
+	c = list->last;
+	if (c->num_elements < c->chunk_size)
+	 {
+	 c->elementsc->num_elements = *obj;
+	 goto the_return;
+	 }
+
+	if (list->default_chunk_size < DEFAULT_CHUNK_SIZE)
+	 list->default_chunk_size *= 2;
+
+	if (NULL == (c = new_chunk (list->default_chunk_size)))
+	 return -1;
+	c->prev = list->last;
+	list->last->next = c;
+	list->last = c;
+	c->elements0 = *obj;
+	goto the_return;
+ }
+
+ if (NULL == (elem = find_nth_element (list, indx, &c)))
+ return -1;
+
+ if (c->num_elements < c->chunk_size)
+ {
+	slide_right (c, elem - c->elements);
+	*elem = *obj;
+	goto the_return;
+ }
+
+ if (list->default_chunk_size < DEFAULT_CHUNK_SIZE)
+ list->default_chunk_size *= 2;
+
+ if (NULL == (c1 = new_chunk (list->default_chunk_size)))
+ return -1;
+
+ num = c->chunk_size - (elem - c->elements);
+ if (num == c->chunk_size)
+ {
+	c1->next = c;
+	c1->prev = c->prev;
+	if (c->prev != NULL)
+	 c->prev->next = c1;
+	c->prev = c1;
+	if (list->first == c)
+	 list->first = c1;
+	c = c1;
+	c->elements0 = *obj;
+	equality_ok = 1;
+	goto the_return;
+ }
+ c1->prev = c;
+ c1->next = c->next;
+ if (c->next != NULL)
+ c->next->prev = c1;
+ c->next = c1;
+ if (list->last == c)
+ list->last = c1;
+
+ memcpy ((char *)c1->elements, (char *)elem, num*sizeof(SLang_Object_Type));
+ c1->num_elements = num;
+ c->num_elements -= num;
+ c->elementsc->num_elements = *obj;
+ /* drop */
+
+the_return:
+
+ if (list->recent != NULL)
+ {
+	if ((list->recent_num > indx)
+	 || ((list->recent_num == indx) && equality_ok))
+	 list->recent_num++;
+ }
+
+ c->num_elements++;
+ list->length++;
+ return 0;
+}
+
+/* Upon sucess, obj is stored in list and calling routine should not free it.
+ * Upon failure, calling routine should free obj.
+ */
+
+static int pop_insert_append_args (SLang_List_Type **listp,
+				 SLang_Object_Type *obj, int *indx)
+{
+ if (SLang_Num_Function_Args == 3)
+ {
+	if (-1 == SLang_pop_integer (indx))
+	 return -1;
+ }
+ if (-1 == SLang_pop (obj))
+ return -1;
+ if (-1 == pop_list (listp))
+ {
+	SLang_free_object (obj);
+	return -1;
+ }
+ return 0;
+}
+
+static void list_insert_elem (void)
+{
+ int indx;
+ SLang_Object_Type obj;
+ SLang_List_Type *list;
+
+ indx = 0;
+ if (-1 == pop_insert_append_args (&list, &obj, &indx))
+ return;
+
+ if (indx < 0)
+ indx += list->length;
+
+ if (-1 == insert_element (list, &obj, indx))
+ SLang_free_object (&obj);
+
+ free_list (list);
+}
+
+static void list_append_elem (void)
+{
+ int indx;
+ SLang_Object_Type obj;
+ SLang_List_Type *list;
+
+ indx = -1;
+ if (-1 == pop_insert_append_args (&list, &obj, &indx))
+ return;
+
+ if (indx < 0)
+ indx += list->length;
+
+ if (-1 == insert_element (list, &obj, indx+1))
+ SLang_free_object (&obj);
+
+ free_list (list);
+}
+
+static int push_list (SLang_List_Type *list, int free_flag)
+{
+ /* SLclass_push_ptr_obj does not do memory management */
+ if (-1 == SLclass_push_ptr_obj (SLANG_LIST_TYPE, (VOID_STAR)list))
+ {
+	if (free_flag) free_list (list);
+	return -1;
+ }
+
+ if (free_flag == 0)
+ list->ref_count++;
+
+ return 0;
+}
+
+static void list_new (void)
+{
+ SLang_List_Type *list;
+ int len = DEFAULT_CHUNK_SIZE;
+
+ if (SLang_Num_Function_Args == 1)
+ {
+	if (-1 == SLang_pop_integer (&len))
+	 return;
+	if (len <= 0) len = DEFAULT_CHUNK_SIZE;
+ }
+
+ if (NULL == (list = allocate_list (len)))
+ return;
+
+ (void) push_list (list, 1);
+}
+
+static void list_reverse (SLang_List_Type *list)
+{
+ Chunk_Type *c;
+
+ c = list->first;
+ list->first = list->last;
+ list->last = c;
+ while (c != NULL)
+ {
+	int i, j;
+	SLang_Object_Type *objs = c->elements;
+	int num = c->num_elements;
+	Chunk_Type *c1;
+
+	i = 0;
+	j = num-1;
+	while (j > i)
+	 {
+	 SLang_Object_Type tmp = objsi;
+	 objsi = objsj;
+	 objsj = tmp;
+	 j--;
+	 i++;
+	 }
+
+	c1 = c->next;
+	c->next = c->prev;
+	c->prev = c1;
+	c = c1;
+ }
+
+ list->recent = NULL;
+}
+
+static int list_pop_nth (SLang_List_Type *list, SLindex_Type indx)
+{
+ SLang_Object_Type *obj;
+
+ if (NULL == (obj = find_nth_element (list, indx, NULL)))
+ return -1;
+
+ if (-1 == _pSLpush_slang_obj (obj))
+ return -1;
+
+ list_delete_elem (list, &indx);
+ return 0;
+}
+
+static void list_pop (void)
+{
+ int indx = 0;
+ SLang_List_Type *list;
+
+ if (SLang_Num_Function_Args == 2)
+ {
+	if (-1 == SLang_pop_integer (&indx))
+	 return;
+ }
+ if (-1 == pop_list (&list))
+ return;
+
+ (void) list_pop_nth (list, indx);
+ free_list (list);
+}
+
+static int pop_as_list_internal (unsigned int count)
+{
+ SLang_List_Type *list;
+
+ if (NULL == (list = allocate_list (count)))
+ return -1;
+
+ while (count)
+ {
+	SLang_Object_Type obj;
+
+	if (-1 == SLang_pop (&obj))
+	 goto return_error;
+
+	if (-1 == insert_element (list, &obj, 0))
+	 {
+	 SLang_free_object (&obj);
+	 goto return_error;
+	 }
+
+	count--;
+ }
+ return push_list (list, 1);
+
+return_error:
+ free_list (list);
+ return -1;
+}
+
+static void pop_as_list (int *nitems)
+{
+ if (*nitems < 0)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Expecting a non-negative integer");
+	return;
+ }
+ (void) pop_as_list_internal (*nitems);
+}
+
+int _pSLlist_inline_list (void)
+{
+ return pop_as_list_internal (SLang_Num_Function_Args);
+}
+
+static void push_list_elements (SLang_List_Type *list)
+{
+ SLindex_Type n = list->length;
+ SLindex_Type i;
+
+ for (i = 0; i < n; i++)
+ {
+	SLang_Object_Type *objp = find_nth_element (list, i, NULL);
+	if ((objp == NULL) || (-1 == _pSLpush_slang_obj (objp)))
+	 return;
+ }
+}
+
+static int l2a_get_type_callback (VOID_STAR vlist, SLuindex_Type i, SLtype *type)
+{
+ SLang_Object_Type *obj;
+
+ if (NULL == (obj = find_nth_element ((SLang_List_Type *)vlist, i, NULL)))
+ return -1;
+ *type = obj->o_data_type;
+ return 0;
+}
+
+static int l2a_push_callback (VOID_STAR vlist, SLuindex_Type i)
+{
+ SLang_Object_Type *obj;
+
+ if (NULL == (obj = find_nth_element ((SLang_List_Type *)vlist, i, NULL)))
+ return -1;
+
+ return _pSLpush_slang_obj (obj);
+}
+
+static void list_to_array (void)
+{
+ SLang_List_Type *list;
+ SLtype type = 0;
+
+ if ((SLang_Num_Function_Args == 2)
+ && (-1 == SLang_pop_datatype (&type)))
+ return;
+
+ if (-1 == pop_list (&list))
+ return;
+
+ (void) _pSLarray_convert_to_array ((VOID_STAR) list,
+				 l2a_get_type_callback,
+				 l2a_push_callback,
+				 list->length, type);
+
+ free_list (list);
+}
+
+/* joins l2 onto l1 */
+static int list_join_internal (SLang_List_Type *l1, SLang_List_Type *l2)
+{
+ Chunk_Type *chunk;
+ SLindex_Type num2;
+
+ chunk = l2->first;
+ num2 = l2->length;
+ while (num2 > 0)
+ {
+	SLindex_Type i, imax;
+	SLang_Object_Type *objs;
+	objs = chunk->elements;
+	i = 0; imax = chunk->num_elements;
+
+	while ((num2 > 0) && (i < imax))
+	 {
+	 SLang_Object_Type obj;
+	 if (-1 == _pSLslang_copy_obj (objs+i, &obj))
+	 return -1;
+
+	 if (-1 == insert_element(l1, &obj, l1->length))
+	 {
+		 SLang_free_object (&obj);
+		 return -1;
+	 }
+	 i++;
+	 num2--;
+	 }
+	chunk = chunk->next;
+ }
+ return 0;
+}
+
+static void list_join (SLang_List_Type *l1, SLang_List_Type *l2)
+{
+ (void) list_join_internal (l1, l2);
+}
+
+static void list_concat (SLang_List_Type *l1, SLang_List_Type *l2)
+{
+ SLang_List_Type *list;
+
+ if (NULL == (list = make_sublist (l1, 0, l1->length)))
+ return;
+
+ if (-1 == list_join_internal (list, l2))
+ {
+	free_list (list);
+	return;
+ }
+
+ (void) push_list (list, 1);	 /* will delete upon failure */
+}
+
+#define L SLANG_LIST_TYPE
+#define I SLANG_INT_TYPE
+#define A SLANG_ARRAY_INDEX_TYPE
+static SLang_Intrin_Fun_Type Intrin_Table =
+{
+ MAKE_INTRINSIC_2("list_delete", list_delete_elem, SLANG_VOID_TYPE, L, A),
+ MAKE_INTRINSIC_1("list_reverse", list_reverse, SLANG_VOID_TYPE, L),
+ MAKE_INTRINSIC_0("list_insert", list_insert_elem, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("list_append", list_append_elem, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("list_to_array", list_to_array, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("list_new", list_new, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("list_pop", list_pop, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_2("list_concat", list_concat, SLANG_VOID_TYPE, L, L),
+ MAKE_INTRINSIC_2("list_join", list_join, SLANG_VOID_TYPE, L, L),
+ MAKE_INTRINSIC_1("__push_list", push_list_elements, SLANG_VOID_TYPE, L),
+ MAKE_INTRINSIC_1("__pop_list", pop_as_list, SLANG_VOID_TYPE, I),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+#undef L
+#undef I
+#undef A
+
+static int list_length (SLtype type, VOID_STAR v, SLuindex_Type *len)
+{
+ SLang_List_Type *list;
+
+ (void) type;
+ list = *(SLang_List_Type **) v;
+ *len = list->length;
+ return 0;
+}
+
+static int cl_list_dereference (SLtype type, VOID_STAR addr)
+{
+ SLang_List_Type *list;
+ (void) type;
+
+ list = *(SLang_List_Type **) addr;
+
+ if (NULL == (list = make_sublist (list, 0, list->length)))
+ return -1;
+
+ return push_list (list, 1);	 /* will delete upon failure */
+}
+
+static char *string_method (SLtype type, VOID_STAR p)
+{
+ SLang_List_Type *list;
+ char buf256;
+
+ (void) type;
+ list = *(SLang_List_Type **) p;
+
+ sprintf (buf, "List_Type with %ld elements", (long)list->length);
+ return SLmake_string (buf);
+}
+
+static int eqs_method (SLtype a_type, VOID_STAR pa, SLtype b_type, VOID_STAR pb)
+{
+ SLang_List_Type *a, *b;
+ Chunk_Type *ca, *cb;
+ SLang_Object_Type *objb, *objb_max;
+
+ if ((a_type != SLANG_LIST_TYPE) || (b_type != SLANG_LIST_TYPE))
+ return 0;
+
+ a = *(SLang_List_Type **) pa;
+ b = *(SLang_List_Type **) pb;
+
+ if (a == b)
+ return 1;
+
+ if (a->length != b->length)
+ return 0;
+
+ if (a->length == 0)
+ return 1;
+
+ ca = a->first;
+ cb = b->first;
+
+ objb = cb->elements;
+ objb_max = objb + cb->num_elements;
+
+ while (ca != NULL)
+ {
+	SLang_Object_Type *obja = ca->elements;
+	SLang_Object_Type *obja_max = obja + ca->num_elements;
+
+	while (obja < obja_max)
+	 {
+	 int ret;
+
+	 while (objb == objb_max)
+	 {
+		 cb = cb->next;
+		 objb = cb->elements;
+		 objb_max = objb + cb->num_elements;
+	 }
+	 /* For now, use _pSLclass_obj_eqs. Doing so makes the semantics
+	 * different from the array_eqs function.
+	 */
+
+	 ret = _pSLclass_obj_eqs (obja, objb);
+	 if (ret != 1)
+	 return ret;
+
+	 obja++; objb++;
+	 }
+	ca = ca->next;
+ }
+ return 1;
+}
+
+struct _pSLang_Foreach_Context_Type
+{
+ SLang_List_Type *list;
+ int next_index;
+};
+
+static SLang_Foreach_Context_Type *
+cl_foreach_open (SLtype type, unsigned int num)
+{
+ SLang_Foreach_Context_Type *c;
+
+ (void) type;
+
+ if (num != 0)
+ {
+	_pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "%s does not support 'foreach using' form",
+		 SLclass_get_datatype_name (type));
+	return NULL;
+ }
+
+ if (NULL == (c = (SLang_Foreach_Context_Type *) SLcalloc (1, sizeof (SLang_Foreach_Context_Type))))
+ return NULL;
+
+ if (-1 == pop_list (&c->list))
+ {
+	SLfree ((char *) c);
+	return NULL;
+ }
+
+ return c;
+}
+
+static void cl_foreach_close (SLtype type, SLang_Foreach_Context_Type *c)
+{
+ (void) type;
+ if (c == NULL) return;
+ free_list (c->list);
+ SLfree ((char *) c);
+}
+
+static int cl_foreach (SLtype type, SLang_Foreach_Context_Type *c)
+{
+ SLang_Object_Type *obj;
+
+ (void) type;
+ if (c == NULL)
+ return -1;
+
+ if (c->list->length <= c->next_index)
+ return 0;
+
+ if ((NULL == (obj = find_nth_element (c->list, c->next_index, NULL)))
+ || (-1 == _pSLpush_slang_obj (obj)))
+ return -1;
+
+ c->next_index++;
+ return 1;
+}
+
+static int pop_list_and_index (unsigned int num_indices,
+			 SLang_List_Type **listp,
+			 SLang_Array_Type **ind_atp,
+			 SLindex_Type *indx)
+{
+ SLang_List_Type *list;
+
+ *listp = NULL;
+
+ if (-1 == pop_list (&list))
+ return -1;
+
+ if (num_indices != 1)
+ {
+	_pSLang_verror (SL_InvalidParm_Error, "List_Type objects are limited to a single index");
+	free_list (list);
+	return -1;
+ }
+
+ *ind_atp = NULL;
+ if (SLang_peek_at_stack () == SLANG_ARRAY_INDEX_TYPE)
+ {
+	if (-1 == SLang_pop_array_index (indx))
+	 {
+	 free_list (list);
+	 return -1;
+	 }
+ }
+ else
+ {
+	if (-1 == _pSLarray_pop_index (list->length, ind_atp, indx))
+	 {
+	 free_list (list);
+	 return -1;
+	 }
+ }
+
+ *listp = list;
+ return 0;
+}
+
+/* FIXME: Extend this to allow an index array */
+static int _pSLlist_aget (SLtype type, unsigned int num_indices)
+{
+ SLang_List_Type *list, *new_list;
+ SLang_Object_Type *obj;
+ SLang_Array_Type *ind_at;
+ SLindex_Type indx, *idx_data;
+ SLuindex_Type i, num;
+ int ret;
+
+ (void) type;
+
+ if (-1 == pop_list_and_index (num_indices, &list, &ind_at, &indx))
+ return -1;
+
+ ret = -1;
+ if (ind_at == NULL)
+ {
+	obj = find_nth_element (list, indx, NULL);
+	if (obj != NULL)
+	 ret = _pSLpush_slang_obj (obj);
+
+	free_list (list);
+	return ret;
+ }
+
+ num = ind_at->num_elements;
+
+ if (NULL == (new_list = allocate_list (num)))
+ goto free_and_return;
+
+ idx_data = (SLindex_Type *)ind_at->data;
+ for (i = 0; i < num; i++)
+ {
+	SLang_Object_Type *obja;
+	SLang_Object_Type objb;
+
+	indx = idx_datai;
+	if (NULL == (obja = find_nth_element (list, idx_datai, NULL)))
+	 goto free_and_return;
+
+	if (-1 == _pSLslang_copy_obj (obja, &objb))
+	 goto free_and_return;
+
+	if (-1 == insert_element (new_list, &objb, i))
+	 {
+	 SLang_free_object (&objb);
+	 goto free_and_return;
+	 }
+ }
+
+ ret = push_list (new_list, 1);	 /* frees upon error */
+ new_list = NULL;
+
+free_and_return:
+
+ if (new_list != NULL)
+ free_list (new_list);
+ free_list (list);
+ SLang_free_array (ind_at);
+ return ret;
+}
+
+static int aput_object (SLang_List_Type *list, SLindex_Type indx, SLang_Object_Type *obj)
+{
+ SLang_Object_Type *elem;
+
+ if (NULL == (elem = find_nth_element (list, indx, NULL)))
+ return -1;
+
+ SLang_free_object (elem);
+ *elem = *obj;
+ return 0;
+}
+
+static int _pSLlist_aput (SLtype type, unsigned int num_indices)
+{
+ SLang_List_Type *list;
+ SLang_Object_Type obj;
+ SLang_Array_Type *ind_at;
+ SLindex_Type indx, *idx_data;
+ SLuindex_Type i, num;
+ int ret;
+
+ (void) type;
+
+ if (-1 == pop_list_and_index (num_indices, &list, &ind_at, &indx))
+ return -1;
+
+ if (ind_at == NULL)
+ {
+	if (-1 == SLang_pop (&obj))
+	 {
+	 free_list (list);
+	 return -1;
+	 }
+
+	if (-1 == aput_object (list, indx, &obj))
+	 {
+	 SLang_free_object (&obj);
+	 free_list (list);
+	 return -1;
+	 }
+	free_list (list);
+	return 0;
+ }
+
+ idx_data = (SLindex_Type *)ind_at->data;
+ num = ind_at->num_elements;
+
+ if (-1 == SLang_pop (&obj))
+ {
+	free_list (list);
+	SLang_free_array (ind_at);
+	return -1;
+ }
+
+ ret = -1;
+
+ if (obj.o_data_type == SLANG_ARRAY_TYPE)
+ {
+	SLang_Array_Type *at = obj.v.array_val;
+	if ((at->num_elements != num) || (at->num_dims != 1))
+	 {
+	 SLang_verror (SL_Index_Error, "Inappropriate array for listindices=array expression");
+	 goto free_and_return;
+	 }
+
+	for (i = 0; i < num; i++)
+	 {
+	 SLang_Object_Type objb;
+	 indx = idx_datai;
+
+	 if ((-1 == _pSLarray1d_push_elem (at, i))
+		 || (-1 == SLang_pop (&objb)))
+	 goto free_and_return;
+
+	 if (-1 == aput_object (list, indx, &objb))
+	 {
+		 SLang_free_object (&objb);
+		 goto free_and_return;
+	 }
+	 }
+	ret = 0;
+	goto free_and_return;
+ }
+
+ if (obj.o_data_type == SLANG_LIST_TYPE)
+ {
+	SLang_List_Type *list2;
+
+	if (NULL == (list2 = (SLang_List_Type *)obj.v.ptr_val))
+	 goto free_and_return;
+
+	if (list2->length != (SLindex_Type)num)
+	 {
+	 SLang_verror (SL_Index_Error, "Inappropriate list2 size for listindices=list2 expression");
+	 goto free_and_return;
+	 }
+
+	for (i = 0; i < num; i++)
+	 {
+	 SLang_Object_Type *obja;
+	 SLang_Object_Type objb;
+	 indx = idx_datai;
+
+	 if (NULL == (obja = find_nth_element (list, idx_datai, NULL)))
+	 goto free_and_return;
+
+	 if (-1 == _pSLslang_copy_obj (obja, &objb))
+	 goto free_and_return;
+
+	 if (-1 == aput_object (list, indx, &objb))
+	 {
+		 SLang_free_object (&objb);
+		 goto free_and_return;
+	 }
+	 }
+	ret = 0;
+	goto free_and_return;
+ }
+
+ for (i = 0; i < num; i++)
+ {
+	SLang_Object_Type objb;
+	indx = idx_datai;
+
+	if (-1 == _pSLslang_copy_obj (&obj, &objb))
+	 goto free_and_return;
+
+	if (-1 == aput_object (list, indx, &objb))
+	 {
+	 SLang_free_object (&objb);
+	 goto free_and_return;
+	 }
+ }
+
+ ret = 0;
+ /* drop */
+free_and_return:
+
+ SLang_free_object (&obj);
+ SLang_free_array (ind_at);
+ free_list (list);
+ return ret;
+}
+
+
+static void cl_list_destroy (SLtype type, VOID_STAR ptr)
+{
+ (void) type;
+ free_list (*(SLang_List_Type **) ptr);
+}
+
+static int cl_list_push (SLtype type, VOID_STAR ptr)
+{
+ (void) type;
+ return push_list (*(SLang_List_Type **)ptr, 0);
+}
+
+int _pSLang_init_sllist (void)
+{
+ SLang_Class_Type *cl;
+
+ if (SLclass_is_class_defined (SLANG_LIST_TYPE))
+ return 0;
+
+ if (NULL == (cl = SLclass_allocate_class ("List_Type")))
+ return -1;
+
+ (void) SLclass_set_destroy_function (cl, cl_list_destroy);
+ (void) SLclass_set_push_function (cl, cl_list_push);
+ (void) SLclass_set_aput_function (cl, _pSLlist_aput);
+ (void) SLclass_set_aget_function (cl, _pSLlist_aget);
+ (void) SLclass_set_deref_function (cl, cl_list_dereference);
+ (void) SLclass_set_string_function (cl, string_method);
+ (void) SLclass_set_eqs_function (cl, eqs_method);
+ (void) SLclass_set_is_container (cl, 1);
+
+ cl->cl_length = list_length;
+
+ cl->cl_foreach_open = cl_foreach_open;
+ cl->cl_foreach_close = cl_foreach_close;
+ cl->cl_foreach = cl_foreach;
+
+ if (-1 == SLclass_register_class (cl, SLANG_LIST_TYPE, sizeof (SLang_List_Type), SLANG_CLASS_TYPE_PTR))
+ return -1;
+
+ if (-1 == SLadd_intrin_fun_table (Intrin_Table, NULL))
+ return -1;
+
+ return 0;
+}
+
+SLang_List_Type *SLang_create_list (SLindex_Type chunk_size)
+{
+ return allocate_list (chunk_size);
+}
+
+int SLang_list_append (SLang_List_Type *list, int indx)
+{
+ SLang_Object_Type obj;
+
+ if (-1 == SLang_pop (&obj))
+ return -1;
+
+ if (indx < 0)
+ indx += list->length;
+
+ if (-1 == insert_element (list, &obj, indx+1))
+ {
+	SLang_free_object (&obj);
+	return -1;
+ }
+ return 0;
+}
+
+int SLang_list_insert (SLang_List_Type *list, int indx)
+{
+ SLang_Object_Type obj;
+
+ if (-1 == SLang_pop (&obj))
+ return -1;
+
+ if (indx < 0)
+ indx += list->length;
+
+ if (-1 == insert_element (list, &obj, indx))
+ {
+	SLang_free_object (&obj);
+	return -1;
+ }
+ return 0;
+}
+
+int SLang_pop_list (SLang_List_Type **list)
+{
+ return pop_list (list);
+}
+
+int SLang_push_list (SLang_List_Type *list, int free_flag)
+{
+ if (list == NULL)
+ return SLang_push_null ();
+
+ return push_list (list, free_flag);
+}
+
+void SLang_free_list (SLang_List_Type *list)
+{
+ free_list (list);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/sllower.c Added

@@ -0,0 +1,37 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include "slinclud.h"
+#include <ctype.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+#define DEFINE_PSLWC_TOLOWER_TABLE
+#include "sllower.h"
+
+#define MODE_VARIABLE _pSLinterp_UTF8_Mode
+SLwchar_Type SLwchar_tolower (SLwchar_Type ch)
+{
+ if (MODE_VARIABLE)
+ return ch + SL_TOLOWER_LOOKUP(ch);
+
+ return tolower(ch);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/sllower.h Added

@@ -0,0 +1,817 @@
+/* This file was automatically created by ./mktables */
+#define SL_TOLOWER_MAX_CHAR 0x1E980ul
+
+#define SL_TOLOWER_LOOKUP(x) \
+  (((unsigned)(x)>=SL_TOLOWER_MAX_CHAR)?0:(_pSLwc_Tolower_Table(unsigned)(x)>>7(unsigned)(x)&0x7F))
+
+extern const _pSLint32_Type *_pSLwc_Tolower_Table979;
+
+#ifdef DEFINE_PSLWC_TOLOWER_TABLE
+static const _pSLint32_Type Table_00128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_01128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,    32,    32,    32,    32,    32,    32,    32,
+  /*0x48-0x4F*/    32,    32,    32,    32,    32,    32,    32,    32,
+  /*0x50-0x57*/    32,    32,    32,    32,    32,    32,    32,    32,
+  /*0x58-0x5F*/    32,    32,    32,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_02128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/    32,    32,    32,    32,    32,    32,    32,    32,
+  /*0x48-0x4F*/    32,    32,    32,    32,    32,    32,    32,    32,
+  /*0x50-0x57*/    32,    32,    32,    32,    32,    32,    32,     0,
+  /*0x58-0x5F*/    32,    32,    32,    32,    32,    32,    32,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_03128 =
+{
+  /*0x00-0x07*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x08-0x0F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x10-0x17*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x18-0x1F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x20-0x27*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x28-0x2F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x30-0x37*/  -199,     0,     1,     0,     1,     0,     1,     0,
+  /*0x38-0x3F*/     0,     1,     0,     1,     0,     1,     0,     1,
+  /*0x40-0x47*/     0,     1,     0,     1,     0,     1,     0,     1,
+  /*0x48-0x4F*/     0,     0,     1,     0,     1,     0,     1,     0,
+  /*0x50-0x57*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x58-0x5F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x60-0x67*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x68-0x6F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x70-0x77*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x78-0x7F*/  -121,     1,     0,     1,     0,     1,     0,     0
+};
+
+static const _pSLint32_Type Table_04128 =
+{
+  /*0x00-0x07*/     0,   210,     1,     0,     1,     0,   206,     1,
+  /*0x08-0x0F*/     0,   205,   205,     1,     0,     0,    79,   202,
+  /*0x10-0x17*/   203,     1,     0,   205,   207,     0,   211,   209,
+  /*0x18-0x1F*/     1,     0,     0,     0,   211,   213,     0,   214,
+  /*0x20-0x27*/     1,     0,     1,     0,     1,     0,   218,     1,
+  /*0x28-0x2F*/     0,   218,     0,     0,     1,     0,   218,     1,
+  /*0x30-0x37*/     0,   217,   217,     1,     0,     1,     0,   219,
+  /*0x38-0x3F*/     1,     0,     0,     0,     1,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     2,     1,     0,     2,
+  /*0x48-0x4F*/     1,     0,     2,     1,     0,     1,     0,     1,
+  /*0x50-0x57*/     0,     1,     0,     1,     0,     1,     0,     1,
+  /*0x58-0x5F*/     0,     1,     0,     1,     0,     0,     1,     0,
+  /*0x60-0x67*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x68-0x6F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x70-0x77*/     0,     2,     1,     0,     1,     0,   -97,   -56,
+  /*0x78-0x7F*/     1,     0,     1,     0,     1,     0,     1,     0
+};
+
+static const _pSLint32_Type Table_05128 =
+{
+  /*0x00-0x07*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x08-0x0F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x10-0x17*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x18-0x1F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x20-0x27*/  -130,     0,     1,     0,     1,     0,     1,     0,
+  /*0x28-0x2F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x30-0x37*/     1,     0,     1,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,  10795,     1,     0,  -163,  10792,     0,
+  /*0x40-0x47*/     0,     1,     0,  -195,    69,    71,     1,     0,
+  /*0x48-0x4F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_06128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     1,     0,     1,     0,     0,     0,     1,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,   116
+};
+
+static const _pSLint32_Type Table_07128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,    38,     0,
+  /*0x08-0x0F*/    37,    37,    37,     0,    64,     0,    63,    63,
+  /*0x10-0x17*/     0,    32,    32,    32,    32,    32,    32,    32,
+  /*0x18-0x1F*/    32,    32,    32,    32,    32,    32,    32,    32,
+  /*0x20-0x27*/    32,    32,     0,    32,    32,    32,    32,    32,
+  /*0x28-0x2F*/    32,    32,    32,    32,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     8,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x60-0x67*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x68-0x6F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,   -60,     0,     0,     1,
+  /*0x78-0x7F*/     0,    -7,     1,     0,     0,  -130,  -130,  -130
+};
+
+static const _pSLint32_Type Table_08128 =
+{
+  /*0x00-0x07*/    80,    80,    80,    80,    80,    80,    80,    80,
+  /*0x08-0x0F*/    80,    80,    80,    80,    80,    80,    80,    80,
+  /*0x10-0x17*/    32,    32,    32,    32,    32,    32,    32,    32,
+  /*0x18-0x1F*/    32,    32,    32,    32,    32,    32,    32,    32,
+  /*0x20-0x27*/    32,    32,    32,    32,    32,    32,    32,    32,
+  /*0x28-0x2F*/    32,    32,    32,    32,    32,    32,    32,    32,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x68-0x6F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x70-0x77*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x78-0x7F*/     1,     0,     1,     0,     1,     0,     1,     0
+};
+
+static const _pSLint32_Type Table_09128 =
+{
+  /*0x00-0x07*/     1,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     1,     0,     1,     0,     1,     0,
+  /*0x10-0x17*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x18-0x1F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x20-0x27*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x28-0x2F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x30-0x37*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x38-0x3F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x40-0x47*/    15,     1,     0,     1,     0,     1,     0,     1,
+  /*0x48-0x4F*/     0,     1,     0,     1,     0,     1,     0,     0,
+  /*0x50-0x57*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x58-0x5F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x60-0x67*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x68-0x6F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x70-0x77*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x78-0x7F*/     1,     0,     1,     0,     1,     0,     1,     0
+};
+
+static const _pSLint32_Type Table_10128 =
+{
+  /*0x00-0x07*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x08-0x0F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x10-0x17*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x18-0x1F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x20-0x27*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x28-0x2F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x30-0x37*/     0,    48,    48,    48,    48,    48,    48,    48,
+  /*0x38-0x3F*/    48,    48,    48,    48,    48,    48,    48,    48,
+  /*0x40-0x47*/    48,    48,    48,    48,    48,    48,    48,    48,
+  /*0x48-0x4F*/    48,    48,    48,    48,    48,    48,    48,    48,
+  /*0x50-0x57*/    48,    48,    48,    48,    48,    48,    48,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_11128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/  7264,  7264,  7264,  7264,  7264,  7264,  7264,  7264,
+  /*0x28-0x2F*/  7264,  7264,  7264,  7264,  7264,  7264,  7264,  7264,
+  /*0x30-0x37*/  7264,  7264,  7264,  7264,  7264,  7264,  7264,  7264,
+  /*0x38-0x3F*/  7264,  7264,  7264,  7264,  7264,  7264,  7264,  7264,
+  /*0x40-0x47*/  7264,  7264,  7264,  7264,  7264,  7264,     0,  7264,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,  7264,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_12128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/  38864,  38864,  38864,  38864,  38864,  38864,  38864,  38864,
+  /*0x28-0x2F*/  38864,  38864,  38864,  38864,  38864,  38864,  38864,  38864,
+  /*0x30-0x37*/  38864,  38864,  38864,  38864,  38864,  38864,  38864,  38864,
+  /*0x38-0x3F*/  38864,  38864,  38864,  38864,  38864,  38864,  38864,  38864,
+  /*0x40-0x47*/  38864,  38864,  38864,  38864,  38864,  38864,  38864,  38864,
+  /*0x48-0x4F*/  38864,  38864,  38864,  38864,  38864,  38864,  38864,  38864,
+  /*0x50-0x57*/  38864,  38864,  38864,  38864,  38864,  38864,  38864,  38864,
+  /*0x58-0x5F*/  38864,  38864,  38864,  38864,  38864,  38864,  38864,  38864,
+  /*0x60-0x67*/  38864,  38864,  38864,  38864,  38864,  38864,  38864,  38864,
+  /*0x68-0x6F*/  38864,  38864,  38864,  38864,  38864,  38864,  38864,  38864,
+  /*0x70-0x77*/     8,     8,     8,     8,     8,     8,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_13128 =
+{
+  /*0x00-0x07*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x08-0x0F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x10-0x17*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x18-0x1F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x20-0x27*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x28-0x2F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x30-0x37*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x38-0x3F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x40-0x47*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x48-0x4F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x50-0x57*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x58-0x5F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x60-0x67*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x68-0x6F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x70-0x77*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x78-0x7F*/     1,     0,     1,     0,     1,     0,     1,     0
+};
+
+static const _pSLint32_Type Table_14128 =
+{
+  /*0x00-0x07*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x08-0x0F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x10-0x17*/     1,     0,     1,     0,     1,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0, -7615,     0,
+  /*0x20-0x27*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x28-0x2F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x30-0x37*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x38-0x3F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x40-0x47*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x48-0x4F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x50-0x57*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x58-0x5F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x60-0x67*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x68-0x6F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x70-0x77*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x78-0x7F*/     1,     0,     1,     0,     1,     0,     1,     0
+};
+
+static const _pSLint32_Type Table_15128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/    -8,    -8,    -8,    -8,    -8,    -8,    -8,    -8,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/    -8,    -8,    -8,    -8,    -8,    -8,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/    -8,    -8,    -8,    -8,    -8,    -8,    -8,    -8,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/    -8,    -8,    -8,    -8,    -8,    -8,    -8,    -8,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/    -8,    -8,    -8,    -8,    -8,    -8,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,    -8,     0,    -8,     0,    -8,     0,    -8,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/    -8,    -8,    -8,    -8,    -8,    -8,    -8,    -8,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_16128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/    -8,    -8,    -8,    -8,    -8,    -8,    -8,    -8,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/    -8,    -8,    -8,    -8,    -8,    -8,    -8,    -8,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/    -8,    -8,    -8,    -8,    -8,    -8,    -8,    -8,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/    -8,    -8,   -74,   -74,    -9,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/   -86,   -86,   -86,   -86,    -9,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/    -8,    -8,  -100,  -100,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/    -8,    -8,  -112,  -112,    -7,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/  -128,  -128,  -126,  -126,    -9,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_17128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0, -7517,     0,
+  /*0x28-0x2F*/     0,     0, -8383, -8262,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,    28,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/    16,    16,    16,    16,    16,    16,    16,    16,
+  /*0x68-0x6F*/    16,    16,    16,    16,    16,    16,    16,    16,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_18128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     1,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_19128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,    26,    26,
+  /*0x38-0x3F*/    26,    26,    26,    26,    26,    26,    26,    26,
+  /*0x40-0x47*/    26,    26,    26,    26,    26,    26,    26,    26,
+  /*0x48-0x4F*/    26,    26,    26,    26,    26,    26,    26,    26,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_20128 =
+{
+  /*0x00-0x07*/    48,    48,    48,    48,    48,    48,    48,    48,
+  /*0x08-0x0F*/    48,    48,    48,    48,    48,    48,    48,    48,
+  /*0x10-0x17*/    48,    48,    48,    48,    48,    48,    48,    48,
+  /*0x18-0x1F*/    48,    48,    48,    48,    48,    48,    48,    48,
+  /*0x20-0x27*/    48,    48,    48,    48,    48,    48,    48,    48,
+  /*0x28-0x2F*/    48,    48,    48,    48,    48,    48,    48,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     1,     0, -10743, -3814, -10727,     0,     0,     1,
+  /*0x68-0x6F*/     0,     1,     0,     1,     0, -10780, -10749, -10783,
+  /*0x70-0x77*/ -10782,     0,     1,     0,     0,     1,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0, -10815, -10815
+};
+
+static const _pSLint32_Type Table_21128 =
+{
+  /*0x00-0x07*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x08-0x0F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x10-0x17*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x18-0x1F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x20-0x27*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x28-0x2F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x30-0x37*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x38-0x3F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x40-0x47*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x48-0x4F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x50-0x57*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x58-0x5F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x60-0x67*/     1,     0,     1,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     1,     0,     1,     0,     0,
+  /*0x70-0x77*/     0,     0,     1,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_22128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x48-0x4F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x50-0x57*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x58-0x5F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x60-0x67*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x68-0x6F*/     1,     0,     1,     0,     1,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_23128 =
+{
+  /*0x00-0x07*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x08-0x0F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x10-0x17*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x18-0x1F*/     1,     0,     1,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_24128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     1,     0,     1,     0,     1,     0,
+  /*0x28-0x2F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x30-0x37*/     0,     0,     1,     0,     1,     0,     1,     0,
+  /*0x38-0x3F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x40-0x47*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x48-0x4F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x50-0x57*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x58-0x5F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x60-0x67*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x68-0x6F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     1,     0,     1,     0, -35332,     1,     0
+};
+
+static const _pSLint32_Type Table_25128 =
+{
+  /*0x00-0x07*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x08-0x0F*/     0,     0,     0,     1,     0, -42280,     0,     0,
+  /*0x10-0x17*/     1,     0,     1,     0,     0,     0,     1,     0,
+  /*0x18-0x1F*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x20-0x27*/     1,     0,     1,     0,     1,     0,     1,     0,
+  /*0x28-0x2F*/     1,     0, -42308, -42319, -42315, -42305, -42308,     0,
+  /*0x30-0x37*/ -42258, -42282, -42261,   928,     1,     0,     1,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_26128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,    32,    32,    32,    32,    32,    32,    32,
+  /*0x28-0x2F*/    32,    32,    32,    32,    32,    32,    32,    32,
+  /*0x30-0x37*/    32,    32,    32,    32,    32,    32,    32,    32,
+  /*0x38-0x3F*/    32,    32,    32,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_27128 =
+{
+  /*0x00-0x07*/    40,    40,    40,    40,    40,    40,    40,    40,
+  /*0x08-0x0F*/    40,    40,    40,    40,    40,    40,    40,    40,
+  /*0x10-0x17*/    40,    40,    40,    40,    40,    40,    40,    40,
+  /*0x18-0x1F*/    40,    40,    40,    40,    40,    40,    40,    40,
+  /*0x20-0x27*/    40,    40,    40,    40,    40,    40,    40,    40,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_28128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/    40,    40,    40,    40,    40,    40,    40,    40,
+  /*0x38-0x3F*/    40,    40,    40,    40,    40,    40,    40,    40,
+  /*0x40-0x47*/    40,    40,    40,    40,    40,    40,    40,    40,
+  /*0x48-0x4F*/    40,    40,    40,    40,    40,    40,    40,    40,
+  /*0x50-0x57*/    40,    40,    40,    40,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_29128 =
+{
+  /*0x00-0x07*/    64,    64,    64,    64,    64,    64,    64,    64,
+  /*0x08-0x0F*/    64,    64,    64,    64,    64,    64,    64,    64,
+  /*0x10-0x17*/    64,    64,    64,    64,    64,    64,    64,    64,
+  /*0x18-0x1F*/    64,    64,    64,    64,    64,    64,    64,    64,
+  /*0x20-0x27*/    64,    64,    64,    64,    64,    64,    64,    64,
+  /*0x28-0x2F*/    64,    64,    64,    64,    64,    64,    64,    64,
+  /*0x30-0x37*/    64,    64,    64,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_30128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/    32,    32,    32,    32,    32,    32,    32,    32,
+  /*0x28-0x2F*/    32,    32,    32,    32,    32,    32,    32,    32,
+  /*0x30-0x37*/    32,    32,    32,    32,    32,    32,    32,    32,
+  /*0x38-0x3F*/    32,    32,    32,    32,    32,    32,    32,    32,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_31128 =
+{
+  /*0x00-0x07*/    34,    34,    34,    34,    34,    34,    34,    34,
+  /*0x08-0x0F*/    34,    34,    34,    34,    34,    34,    34,    34,
+  /*0x10-0x17*/    34,    34,    34,    34,    34,    34,    34,    34,
+  /*0x18-0x1F*/    34,    34,    34,    34,    34,    34,    34,    34,
+  /*0x20-0x27*/    34,    34,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+const _pSLint32_Type *_pSLwc_Tolower_Table979 =
+{
+  Table_01,  Table_02,  Table_03,  Table_04,  Table_05,  Table_00,
+  Table_06,  Table_07,  Table_08,  Table_09,  Table_10,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_11,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_12,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_13,  Table_14,  Table_15,  Table_16,  Table_00,  Table_00,
+  Table_17,  Table_18,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_19,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_20,  Table_21,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_22,  Table_23,  Table_24,  Table_25,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_26,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_27,  Table_28,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_29,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_30,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_31
+};
+#endif /* DEFINE_PSLWC_TOLOWER_TABLE */

_service:tar_scm:slang-2.3.2.tar.bz2/src/slmalloc.c Added

@@ -0,0 +1,171 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#ifdef SL_MALLOC_DEBUG
+# undef SL_MALLOC_DEBUG
+#endif
+
+#include "slang.h"
+#include "_slang.h"
+
+#ifdef __alpha
+# define Chunk 8
+#else
+# define Chunk 4
+#endif
+
+static long Total_Allocated;
+static long Max_Single_Allocation;
+static long Max_Allocated;
+/* #define SLDEBUG_DOUT */
+
+#ifdef SLDEBUG_DOUT
+static FILE *dout;
+#endif
+
+void SLmalloc_dump_statistics (void)
+{
+#ifdef SLDEBUG_DOUT
+ fflush (dout);
+#endif
+ fprintf (stderr, "Total Allocated: %ld\nHighest single allocation: %ld\nHighest Total Allocated:%ld\n",
+	 Total_Allocated, Max_Single_Allocation, Max_Allocated);
+}
+
+static void register_at_exit_fun (void)
+{
+ static int is_registered = 0;
+ if (is_registered)
+ return;
+ is_registered = 1;
+
+#ifdef SLDEBUG_DOUT
+ if (dout == NULL) dout = fopen ("malloc.out", "w");
+#endif
+ SLang_add_cleanup_function (SLmalloc_dump_statistics);
+}
+
+static void fixup (unsigned char *p, unsigned long n, SLCONST char *what)
+{
+ register_at_exit_fun ();
+
+ p += Chunk;
+ *(p - 4)= (unsigned char) ((n >> 24) & 0xFF);
+ *(p - 3) = (unsigned char) ((n >> 16) & 0xFF);
+ *(p - 2) = (unsigned char) ((n >> 8) & 0xFF);
+ *(p - 1) = (unsigned char) (n & 0xFF);
+ *(p + (int) n) = 27;
+ *(p + (int) (n + 1)) = 182;
+ *(p + (int) (n + 2)) = 81;
+ *(p + (int) (n + 3)) = 86;
+ Total_Allocated += (long) n;
+ if (Total_Allocated > Max_Allocated) Max_Allocated = Total_Allocated;
+ if ((long) n > Max_Single_Allocation)
+ Max_Single_Allocation = (long) n;
+
+#ifdef SLDEBUG_DOUT
+ fprintf (dout, "ALLOC: %s\t%p %ld\n", what, p, (long) n);
+#else
+ (void) what;
+#endif
+}
+
+static int check_memory (unsigned char *p, SLCONST char *what)
+{
+ unsigned long n;
+
+ register_at_exit_fun ();
+
+ n = ((unsigned long) *(p - 4)) << 24;
+ n |= ((unsigned long) *(p - 3)) << 16;
+ n |= ((unsigned long) *(p - 2)) << 8;
+ n |= (unsigned long) *(p - 1);
+
+ if (n == 0xFFFFFFFFUL)
+ {
+	_pSLang_verror (SL_INVALID_DATA_ERROR, "%s: %p: Already FREE! Abort NOW.", what, p - Chunk);
+	return -1;
+ }
+
+ if ((*(p + (int) n) != 27)
+ || (*(p + (int) (n + 1)) != 182)
+ || (*(p + (int) (n + 2)) != 81)
+ || (*(p + (int) (n + 3)) != 86))
+ {
+	_pSLang_verror (SL_INVALID_DATA_ERROR, "\007%s: %p: Memory corrupt! Abort NOW.", what, p);
+	return -1;
+ }
+
+ *(p - 4) = *(p - 3) = *(p - 2) = *(p - 1) = 0xFF;
+
+ Total_Allocated -= (long) n;
+ if (Total_Allocated < 0)
+ {
+	_pSLang_verror (SL_INVALID_DATA_ERROR, "\007%s: %p\nFreed %ld, Allocated is: %ld!\n",
+		 what, p, (long) n, Total_Allocated);
+ }
+#ifdef SLDEBUG_DOUT
+ fprintf (dout, "FREE: %s:\t%p %ld\n", what, p, (long) n);
+#endif
+ return 0;
+}
+
+void SLdebug_free (SLFUTURE_VOID *p)
+{
+ if (p == NULL) return;
+ if (-1 == check_memory ((unsigned char *) p, "FREE")) return;
+
+ SLFREE ((char*)p - Chunk);
+}
+
+SLFUTURE_VOID *SLdebug_malloc (unsigned long n)
+{
+ char *p;
+
+ if ((p = (char *) SLMALLOC (n + 2 * Chunk)) == NULL) return NULL;
+
+ fixup ((unsigned char *) p, n, "MALLOC");
+ return (SLFUTURE_VOID *)(p + Chunk);
+}
+
+SLFUTURE_VOID *SLdebug_realloc (SLFUTURE_VOID *p, unsigned long n)
+{
+ if (-1 == check_memory ((unsigned char *) p, "REALLOC")) return NULL;
+ if ((p = (char *) SLREALLOC ((char*)p - Chunk, n + 2 * Chunk)) == NULL) return NULL;
+ fixup ((unsigned char *) p, n, "REALLOC");
+ return (SLFUTURE_VOID *) ((char*)p + Chunk);
+}
+
+SLFUTURE_VOID *SLdebug_calloc (unsigned long n, unsigned long size)
+{
+ char *p;
+ unsigned int m;
+
+ /* This is tough -- hope this is a good assumption!! */
+ if (size >= Chunk) m = 1; else m = Chunk;
+
+ if ((p = (char *) SLCALLOC (n + m + m, size)) == NULL) return NULL;
+ fixup ((unsigned char *) p, size * n, "CALLOC");
+ return (SLFUTURE_VOID *)(p + Chunk);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slmath.c Added

@@ -0,0 +1,2229 @@
+/* sin, cos, etc, for S-Lang */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#ifndef _GNU_SOURCE
+# define _GNU_SOURCE		 /* sincos */
+#endif
+#include "slinclud.h"
+#include <float.h>
+#include <math.h>
+
+#if SLANG_HAS_FLOAT
+
+#ifdef HAVE_FLOATINGPOINT_H
+# include <floatingpoint.h>
+#endif
+
+#ifdef HAVE_FENV_H
+# include <fenv.h>
+#endif
+
+#ifdef HAVE_IEEEFP_H
+# include <ieeefp.h>
+#endif
+
+#ifdef HAVE_NAN_H
+# include <nan.h>
+#endif
+
+#include "slang.h"
+#include "_slang.h"
+
+#ifdef PI
+# undef PI
+#endif
+#define PI 3.14159265358979323846264338327950288
+
+#if defined(__unix__)
+#include <signal.h>
+#include <errno.h>
+
+static void math_floating_point_exception (int sig)
+{
+ sig = errno;
+ (void) SLsignal (SIGFPE, math_floating_point_exception);
+ errno = sig;
+}
+#endif
+
+double SLmath_hypot (double x, double y)
+{
+#ifdef HAVE_HYPOT
+ return hypot (x,y);
+#else
+ double fr, fi, ratio;
+
+ fr = fabs(x);
+ fi = fabs(y);
+
+ if (fr > fi)
+ {
+	ratio = y / x;
+	x = fr * sqrt (1.0 + ratio * ratio);
+ }
+ else if (fi == 0.0) x = 0.0;
+ else
+ {
+	ratio = x / y;
+	x = fi * sqrt (1.0 + ratio * ratio);
+ }
+
+ return x;
+#endif
+}
+
+static int double_math_op_result (int op, SLtype a, SLtype *b)
+{
+ switch (op)
+ {
+ case SLMATH_ISINF:
+ case SLMATH_ISNAN:
+	*b = SLANG_CHAR_TYPE;
+	break;
+
+ default:
+	if (a != SLANG_FLOAT_TYPE)
+	 *b = SLANG_DOUBLE_TYPE;
+	else
+	 *b = a;
+	break;
+ }
+ return 1;
+}
+
+#ifdef HAVE_ISNAN
+# define ISNAN_FUN	isnan
+#else
+# define ISNAN_FUN	my_isnan
+static int my_isnan (double x)
+{
+ return (volatile double) x != (volatile double) x;
+}
+#endif
+
+int _pSLmath_isnan (double x)
+{
+ return ISNAN_FUN (x);
+}
+
+#ifdef HAVE_ISINF
+# define ISINF_FUN	isinf
+#else
+# define ISINF_FUN	my_isinf
+static int my_isinf (double x)
+{
+#ifdef HAVE_FINITE
+ return (0 == finite (x)) && (0 == ISNAN_FUN (x));
+#else
+ double y;
+ if (x == 0.0)
+ return 0;
+ y = x * 0.5;
+ return (x == y);
+#endif
+}
+#endif
+
+int _pSLmath_isinf (double x)
+{
+ return ISINF_FUN (x);
+}
+
+#ifdef HAVE_ROUND
+# define ROUND_FUN	round
+#else
+# define ROUND_FUN	my_round
+static double my_round (double x)
+{
+ double xf, xi;
+
+ xf = modf (x, &xi);		 /* x = xi + xf */
+ if (xi > 0)
+ {
+	if (xf >= 0.5)
+	 return xi + 1.0;
+ }
+ else if (xi < 0)
+ {
+	if (xf <= -0.5)
+	 return xi - 1.0;
+ }
+ else if (xf < 0)		 /* xi=0 */
+ {
+	if (xf <= -0.5)
+	 return -1.0;
+ }
+ else if (xf >= 0.5)		 /* xi=0 */
+ return 1.0;
+
+ return xi;
+}
+#endif
+
+#ifndef HAVE_LOG1P
+double _pSLmath_log1p (double x)
+{
+ /*
+ * log(1+x) ~= x for small x
+ * Suppose the error in 1+x is e. That is, 1+x produces 1+x+e.
+ * Then log(1+x) will produce log(1+x+e). The error is
+ * df = log(1+x+e)-log(1+x)
+ * = log (1 + e/(1+x))
+ * ~= e/(1+x)
+ * Here e = (1+x) - (1+x)
+ * = ((1+x)-1) - x
+ * So compute:
+ * log1p(x) = log(1+x) - (((1+x)-1)-x)/(1+x)
+ */
+ volatile double xp1, xx;
+ if (ISINF_FUN(x))
+ {
+	if (x < 0) return _pSLang_NaN;
+	return _pSLang_Inf;
+ }
+ xp1 = 1.0 + x;
+ if (xp1 == 0.0)
+ return -_pSLang_Inf;
+ xx = xp1-1.0;
+ return log(xp1) - (xx-x)/xp1;
+}
+#endif
+
+#ifndef HAVE_EXPM1
+double _pSLmath_expm1 (double x)
+{
+ /* f = exp(x)-1
+ * = (exp(x)-1) + x - x
+ * = (exp(x)-(1+x)) + x
+ *
+ * While the above works, it is not as accurate as the algroithm below,
+ * which is due to Kahan (yes, that Kahan).
+ */
+ volatile double u;
+ if (ISINF_FUN(x))
+ {
+	if (x < 0) return -1.0;
+	return _pSLang_Inf;
+ }
+
+ u = exp(x);
+ if (u == 1.0)
+ return x;
+ if (u - 1.0 == -1.0)
+ return -1.0;
+ return (u-1.0)*x/log(u);
+}
+#endif
+
+#ifdef HAVE_ASINH
+# define ASINH_FUN	asinh
+#else
+# define ASINH_FUN	my_asinh
+static double my_asinh (double x)
+{
+ /* f(x) = log(x + sqrt(x^2+1))
+ * Note: f(x)+f(-x)
+ * = log(x+sqrt(x^2+1))+log(-x+sqrt(x^2+1))
+ * = log(x^2+1 - x^2)
+ * = 0
+ * Thus, f(-x)=-f(x) as required.
+ *
+ * So consider x>=0.
+ * For large x
+ * = log(2x + sqrt(x^2+1)-x)
+ * = log(2x + ((x^2+1)-x^2)/(x+sqrt(x^2+1)))
+ * = log(2x + 1/(x+sqrt(x^2+1)))
+ * = log(2x + 1/x/(1+sqrt(1+1/x^2)))
+ * For small x
+ * = log(1 + x + sqrt(1+x^2)-1)
+ * = log(1 + x + (1+x^2-1)/(sqrt(1+x^2)+1))
+ * = log(1 + x + x^2/(1+sqrt(1+x^2)))
+ */
+ double s = 1.0;
+ double x2 = x*x;
+
+ if (x < 0.0)
+ {
+	s = -1.0;
+	x = -x;
+ }
+
+ if (x > 1.0)
+ return s*log (2.0*x + 1.0/x/(1.0+sqrt(1.0+1.0/x2)));
+
+ return LOG1P_FUNC(x+x2/(1.0+sqrt(1.0+x2)));
+}
+#endif
+
+#ifdef HAVE_ACOSH
+# define ACOSH_FUN	acosh
+#else
+# define ACOSH_FUN	my_acosh
+static double my_acosh (double x)
+{
+ /* log (x + sqrt(x^2 - 1); x >= 1
+ * = log(2*x + sqrt(x^2-1)-x)
+ * = log(2*x + (x^2-1-x^2)/(x+sqrt(x^2-1)))
+ * = log(2*x - 1/x/(1+sqrt(1-1/x^2)))
+ */
+ return log(2.0*x - 1.0/x/(1.0+sqrt(1.0-1/x/x)));
+}
+#endif
+#ifdef HAVE_ATANH
+# define ATANH_FUN	atanh
+#else
+# define ATANH_FUN	my_atanh
+
+static double my_atanh (double x)
+{
+ /* 0.5 * log ((1.0 + x)/(1.0 - x)); (0 <= x^2 < 1)
+ * = 0.5*log((1-x+2x)/(1-x))
+ * = 0.5*log(1 + 2x/(1-x))
+ */
+ return 0.5 * LOG1P_FUNC(2.0*x/(1-x));
+}
+#endif
+
+static int double_math_op (int op,
+			 SLtype type, VOID_STAR ap, SLuindex_Type na,
+			 VOID_STAR bp)
+{
+ double *a, *b;
+ unsigned int i;
+ char *c;
+
+ (void) type;
+ a = (double *) ap;
+ b = (double *) bp;
+
+ switch (op)
+ {
+ default:
+	return 0;
+
+ case SLMATH_SINH:
+	for (i = 0; i < na; i++) bi = sinh(ai);
+	break;
+ case SLMATH_COSH:
+	for (i = 0; i < na; i++) bi = cosh(ai);
+	break;
+ case SLMATH_TANH:
+	for (i = 0; i < na; i++) bi = tanh(ai);
+	break;
+ case SLMATH_TAN:
+	for (i = 0; i < na; i++) bi = tan(ai);
+	break;
+ case SLMATH_ASIN:
+	for (i = 0; i < na; i++) bi = asin(ai);
+	break;
+ case SLMATH_ACOS:
+	for (i = 0; i < na; i++) bi = acos(ai);
+	break;
+ case SLMATH_ATAN:
+	for (i = 0; i < na; i++) bi = atan(ai);
+	break;
+ case SLMATH_EXP:
+	for (i = 0; i < na; i++) bi = exp(ai);
+	break;
+ case SLMATH_LOG:
+	for (i = 0; i < na; i++) bi = log(ai);
+	break;
+ case SLMATH_LOG10:
+	for (i = 0; i < na; i++) bi = log10(ai);
+	break;
+ case SLMATH_SQRT:
+	for (i = 0; i < na; i++) bi = sqrt (ai);
+	return 1;
+ case SLMATH_SIN:
+	for (i = 0; i < na; i++) bi = sin(ai);
+	break;
+ case SLMATH_COS:
+	for (i = 0; i < na; i++) bi = cos(ai);
+	break;
+ case SLMATH_ASINH:
+	for (i = 0; i < na; i++) bi = ASINH_FUN(ai);
+	break;
+ case SLMATH_ATANH:
+	for (i = 0; i < na; i++) bi = ATANH_FUN(ai);
+	break;
+ case SLMATH_ACOSH:
+	for (i = 0; i < na; i++) bi = ACOSH_FUN(ai);
+	break;
+
+ case SLMATH_CONJ:
+ case SLMATH_REAL:
+	for (i = 0; i < na; i++)
+	 bi = ai;
+	return 1;
+ case SLMATH_IMAG:
+	for (i = 0; i < na; i++)
+	 bi = 0.0;
+	return 1;
+
+ case SLMATH_ISINF:
+	c = (char *) bp;
+	for (i = 0; i < na; i++)
+	 ci = (char) ISINF_FUN(ai);
+	return 1;
+
+ case SLMATH_ISNAN:
+	c = (char *) bp;
+	for (i = 0; i < na; i++)
+	 ci = (char) ISNAN_FUN(ai);
+	return 1;
+
+ case SLMATH_FLOOR:
+	for (i = 0; i < na; i++) bi = floor(ai);
+	break;
+
+ case SLMATH_CEIL:
+	for (i = 0; i < na; i++) bi = ceil(ai);
+	break;
+
+ case SLMATH_ROUND:
+	for (i = 0; i < na; i++) bi = ROUND_FUN(ai);
+	break;
+
+ case SLMATH_EXPM1:
+	for (i = 0; i < na; i++) bi = EXPM1_FUNC(ai);
+	break;
+
+ case SLMATH_LOG1P:
+	for (i = 0; i < na; i++) bi = LOG1P_FUNC(ai);
+	break;
+ }
+
+ return 1;
+}
+
+static int float_math_op (int op,
+			 SLtype type, VOID_STAR ap, SLuindex_Type na,
+			 VOID_STAR bp)
+{
+ float *a, *b;
+ unsigned int i;
+ char *c;
+
+ (void) type;
+ a = (float *) ap;
+ b = (float *) bp;
+
+ switch (op)
+ {
+ default:
+	return 0;
+
+ case SLMATH_SINH:
+	for (i = 0; i < na; i++) bi = sinh(ai);
+	break;
+ case SLMATH_COSH:
+	for (i = 0; i < na; i++) bi = cosh(ai);
+	break;
+ case SLMATH_TANH:
+	for (i = 0; i < na; i++) bi = tanh(ai);
+	break;
+ case SLMATH_TAN:
+	for (i = 0; i < na; i++) bi = tan(ai);
+	break;
+ case SLMATH_ASIN:
+	for (i = 0; i < na; i++) bi = asin(ai);
+	break;
+ case SLMATH_ACOS:
+	for (i = 0; i < na; i++) bi = acos(ai);
+	break;
+ case SLMATH_ATAN:
+	for (i = 0; i < na; i++) bi = atan(ai);
+	break;
+ case SLMATH_EXP:
+	for (i = 0; i < na; i++) bi = exp(ai);
+	break;
+ case SLMATH_LOG:
+	for (i = 0; i < na; i++) bi = log(ai);
+	break;
+ case SLMATH_LOG10:
+	for (i = 0; i < na; i++) bi = log10(ai);
+	break;
+ case SLMATH_SQRT:
+	for (i = 0; i < na; i++)
+	 bi = (float) sqrt ((double) ai);
+	return 1;
+
+ case SLMATH_SIN:
+	for (i = 0; i < na; i++) bi = sin(ai);
+	break;
+ case SLMATH_COS:
+	for (i = 0; i < na; i++) bi = cos(ai);
+	break;
+
+ case SLMATH_ASINH:
+	for (i = 0; i < na; i++) bi = ASINH_FUN(ai);
+	break;
+ case SLMATH_ATANH:
+	for (i = 0; i < na; i++) bi = ATANH_FUN(ai);
+	break;
+ case SLMATH_ACOSH:
+	for (i = 0; i < na; i++) bi = ACOSH_FUN(ai);
+	break;
+
+ case SLMATH_CONJ:
+ case SLMATH_REAL:
+	for (i = 0; i < na; i++)
+	 bi = ai;
+	return 1;
+ case SLMATH_IMAG:
+	for (i = 0; i < na; i++)
+	 bi = 0.0;
+	return 1;
+ case SLMATH_ISINF:
+	c = (char *) bp;
+	for (i = 0; i < na; i++)
+	 ci = (char) ISINF_FUN((double) ai);
+	return 1;
+
+ case SLMATH_ISNAN:
+	c = (char *) bp;
+	for (i = 0; i < na; i++)
+	 ci = (char) ISNAN_FUN((double) ai);
+	return 1;
+
+ case SLMATH_FLOOR:
+	for (i = 0; i < na; i++) bi = floor(ai);
+	break;
+ case SLMATH_CEIL:
+	for (i = 0; i < na; i++) bi = ceil(ai);
+	break;
+ case SLMATH_ROUND:
+	for (i = 0; i < na; i++) bi = ROUND_FUN(ai);
+	break;
+
+ case SLMATH_EXPM1:
+	for (i = 0; i < na; i++) bi = EXPM1_FUNC(ai);
+	break;
+
+ case SLMATH_LOG1P:
+	for (i = 0; i < na; i++) bi = LOG1P_FUNC(ai);
+	break;
+ }
+
+ return 1;
+}
+
+static int generic_math_op (int op,
+			 SLtype type, VOID_STAR ap, SLuindex_Type na,
+			 VOID_STAR bp)
+{
+ double *b;
+ unsigned int i;
+ SLang_To_Double_Fun_Type to_double;
+ unsigned int da;
+ char *a, *c;
+
+ if (NULL == (to_double = SLarith_get_to_double_fun (type, &da)))
+ return 0;
+
+ b = (double *) bp;
+ a = (char *) ap;
+
+ switch (op)
+ {
+ default:
+	return 0;
+
+ case SLMATH_SINH:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = sinh (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_COSH:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = cosh (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_TANH:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = tanh (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_TAN:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = tan (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_ASIN:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = asin (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_ACOS:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = acos (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_ATAN:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = atan (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_EXP:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = exp (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_LOG:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = log (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_LOG10:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = log10 (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_SQRT:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = sqrt (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_SIN:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = sin (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_COS:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = cos (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+
+ case SLMATH_ASINH:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = ASINH_FUN (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_ATANH:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = ATANH_FUN (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_ACOSH:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = ACOSH_FUN (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+
+ case SLMATH_CONJ:
+ case SLMATH_REAL:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = to_double((VOID_STAR) a);
+	 a += da;
+	 }
+	return 1;
+
+ case SLMATH_IMAG:
+	for (i = 0; i < na; i++)
+	 bi = 0.0;
+	return 1;
+
+ case SLMATH_ISINF:
+	c = (char *) bp;
+	for (i = 0; i < na; i++)
+	 {
+	 ci = (char) ISINF_FUN(to_double((VOID_STAR) a));
+	 a += da;
+	 }
+	return 1;
+ case SLMATH_ISNAN:
+	c = (char *) bp;
+	for (i = 0; i < na; i++)
+	 {
+	 ci = (char) ISNAN_FUN(to_double((VOID_STAR) a));
+	 a += da;
+	 }
+	return 1;
+ case SLMATH_FLOOR:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = floor (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_CEIL:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = ceil (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ case SLMATH_ROUND:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = ROUND_FUN (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+
+ case SLMATH_EXPM1:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = EXPM1_FUNC (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+
+ case SLMATH_LOG1P:
+	for (i = 0; i < na; i++)
+	 {
+	 bi = LOG1P_FUNC (to_double ((VOID_STAR) a));
+	 a += da;
+	 }
+	break;
+ }
+
+ return 1;
+}
+
+#if SLANG_HAS_COMPLEX
+static int complex_math_op_result (int op, SLtype a, SLtype *b)
+{
+ (void) a;
+ switch (op)
+ {
+ default:
+	*b = SLANG_COMPLEX_TYPE;
+	break;
+
+ case SLMATH_ISINF:
+ case SLMATH_ISNAN:
+	*b = SLANG_CHAR_TYPE;
+	break;
+
+ case SLMATH_REAL:
+ case SLMATH_IMAG:
+	*b = SLANG_DOUBLE_TYPE;
+	break;
+ }
+ return 1;
+}
+
+static int complex_math_op (int op,
+			 SLtype type, VOID_STAR ap, SLuindex_Type na,
+			 VOID_STAR bp)
+{
+ double *a, *b;
+ SLuindex_Type i;
+ SLuindex_Type na2 = na * 2;
+ double *(*fun) (double *, double *);
+ char *c;
+
+ (void) type;
+ a = (double *) ap;
+ b = (double *) bp;
+
+ switch (op)
+ {
+ default:
+	return 0;
+
+ case SLMATH_REAL:
+	for (i = 0; i < na; i++)
+	 bi = a2 * i;
+	return 1;
+
+ case SLMATH_IMAG:
+	for (i = 0; i < na; i++)
+	 bi = a2 * i + 1;
+	return 1;
+
+ case SLMATH_CONJ:
+	for (i = 0; i < na2; i += 2)
+	 {
+	 bi = ai;
+	 bi+1 = -ai+1;
+	 }
+	return 1;
+
+ case SLMATH_ATANH:
+	fun = SLcomplex_atanh;
+	break;
+ case SLMATH_ACOSH:
+	fun = SLcomplex_acosh;
+	break;
+ case SLMATH_ASINH:
+	fun = SLcomplex_asinh;
+	break;
+ case SLMATH_EXP:
+	fun = SLcomplex_exp;
+	break;
+ case SLMATH_LOG:
+	fun = SLcomplex_log;
+	break;
+ case SLMATH_LOG10:
+	fun = SLcomplex_log10;
+	break;
+ case SLMATH_SQRT:
+	fun = SLcomplex_sqrt;
+	break;
+ case SLMATH_SIN:
+	fun = SLcomplex_sin;
+	break;
+ case SLMATH_COS:
+	fun = SLcomplex_cos;
+	break;
+ case SLMATH_SINH:
+	fun = SLcomplex_sinh;
+	break;
+ case SLMATH_COSH:
+	fun = SLcomplex_cosh;
+	break;
+ case SLMATH_TANH:
+	fun = SLcomplex_tanh;
+	break;
+ case SLMATH_TAN:
+	fun = SLcomplex_tan;
+	break;
+ case SLMATH_ASIN:
+	fun = SLcomplex_asin;
+	break;
+ case SLMATH_ACOS:
+	fun = SLcomplex_acos;
+	break;
+ case SLMATH_ATAN:
+	fun = SLcomplex_atan;
+	break;
+ case SLMATH_ISINF:
+	c = (char *) bp;
+	for (i = 0; i < na; i++)
+	 {
+	 SLuindex_Type j = 2*i;
+	 ci = (char) (ISINF_FUN(aj) || ISINF_FUN(aj+1));
+	 }
+	return 1;
+ case SLMATH_ISNAN:
+	c = (char *) bp;
+	for (i = 0; i < na; i++)
+	 {
+	 SLuindex_Type j = 2*i;
+	 ci = (char) (ISNAN_FUN(aj) || ISNAN_FUN(aj+1));
+	 }
+	return 1;
+
+ case SLMATH_FLOOR:
+ case SLMATH_ROUND:
+ case SLMATH_CEIL:
+	return double_math_op (op, type, ap, na2, bp);
+ }
+
+ for (i = 0; i < na2; i += 2)
+ (void) (*fun) (b + i, a + i);
+
+ return 1;
+}
+#endif
+
+typedef struct
+{
+ SLang_Array_Type *at;
+ int is_float;		 /* if non-zero, use fptr */
+ float f;
+ double d;
+ char c;
+ float *fptr;			 /* points at at->data or &f */
+ double *dptr;
+ char *cptr;
+ unsigned int inc;		 /* inc = 0, if at==NULL */
+ SLuindex_Type num;
+}
+Array_Or_Scalar_Type;
+
+static void free_array_or_scalar (Array_Or_Scalar_Type *ast)
+{
+ if (ast->at != NULL)
+ SLang_free_array (ast->at);
+}
+
+static int pop_array_or_scalar (Array_Or_Scalar_Type *ast)
+{
+ SLang_Array_Type *at;
+ SLtype dtype;
+
+ ast->at = NULL;
+ ast->inc = 0;
+ ast->num = 1;
+ switch (_pSLang_peek_at_stack2 (&dtype))
+ {
+ case -1:
+	return -1;
+
+ case SLANG_ARRAY_TYPE:
+	if (dtype == SLANG_FLOAT_TYPE)
+	 {
+	 if (-1 == SLang_pop_array_of_type (&at, SLANG_FLOAT_TYPE))
+	 return -1;
+	 ast->is_float = 1;
+	 ast->fptr = (float *) at->data;
+	 }
+	else
+	 {
+	 if (-1 == SLang_pop_array_of_type (&at, SLANG_DOUBLE_TYPE))
+	 return -1;
+	 ast->is_float = 0;
+	 ast->dptr = (double *) at->data;
+	 }
+	ast->inc = 1;
+	ast->num = at->num_elements;
+	ast->at = at;
+	return 0;
+
+ case SLANG_FLOAT_TYPE:
+	ast->is_float = 1;
+	ast->fptr = &ast->f;
+	if (-1 == SLang_pop_float (ast->fptr))
+	 return -1;
+	return 0;
+
+ default:
+	ast->is_float = 0;
+	ast->dptr = &ast->d;
+	if (-1 == SLang_pop_double (ast->dptr))
+	 return -1;
+	return 0;
+ }
+}
+
+static int pop_2_arrays_or_scalar (Array_Or_Scalar_Type *a, Array_Or_Scalar_Type *b)
+{
+ if (-1 == pop_array_or_scalar (b))
+ return -1;
+
+ if (-1 == pop_array_or_scalar (a))
+ {
+	free_array_or_scalar (b);
+	return -1;
+ }
+
+ if ((a->at != NULL) && (b->at != NULL))
+ {
+	if (a->num != b->num)
+	 {
+	 _pSLang_verror (SL_TypeMismatch_Error, "Array sizes do not match");
+	 free_array_or_scalar (a);
+	 free_array_or_scalar (b);
+	 return -1;
+	 }
+ }
+ return 0;
+}
+
+static SLang_Array_Type *create_from_tmp_array (SLang_Array_Type *a, SLang_Array_Type *b, SLtype type)
+{
+ SLang_Array_Type *c;
+
+ if ((a != NULL) && (a->data_type == type) && (a->num_refs == 1))
+ {
+	a->num_refs += 1;
+	return a;
+ }
+ if ((b != NULL) && (b->data_type == type) && (b->num_refs == 1))
+ {
+	b->num_refs += 1;
+	return b;
+ }
+
+ if (a != NULL)
+ c = a;
+ else
+ c = b;
+
+ return SLang_create_array1 (type, 0, NULL, c->dims, c->num_dims, 1);
+}
+
+static int do_dd_fun (double (*f)(double, double),
+		 Array_Or_Scalar_Type *a_ast,
+		 Array_Or_Scalar_Type *b_ast,
+		 Array_Or_Scalar_Type *c_ast)
+{
+ double *a = a_ast->dptr;
+ double *b = b_ast->dptr;
+ double *c = c_ast->dptr;
+ unsigned int a_inc = a_ast->inc;
+ unsigned int b_inc = b_ast->inc;
+ SLuindex_Type i, n = c_ast->num;
+
+ for (i = 0; i < n; i++)
+ {
+	ci = (*f)(*a, *b);
+	a += a_inc;
+	b += b_inc;
+ }
+ return 0;
+}
+
+static int do_ff_fun (double (*f)(double, double),
+		 Array_Or_Scalar_Type *a_ast,
+		 Array_Or_Scalar_Type *b_ast,
+		 Array_Or_Scalar_Type *c_ast)
+{
+ float *a = a_ast->fptr;
+ float *b = b_ast->fptr;
+ float *c = c_ast->fptr;
+ unsigned int a_inc = a_ast->inc;
+ unsigned int b_inc = b_ast->inc;
+ SLuindex_Type i, n = c_ast->num;
+
+ for (i = 0; i < n; i++)
+ {
+	ci = (float) (*f)(*a, *b);
+	a += a_inc;
+	b += b_inc;
+ }
+ return 0;
+}
+
+static int do_fd_fun (double (*f)(double, double),
+		 Array_Or_Scalar_Type *a_ast,
+		 Array_Or_Scalar_Type *b_ast,
+		 Array_Or_Scalar_Type *c_ast)
+{
+ float *a = a_ast->fptr;
+ double *b = b_ast->dptr;
+ double *c = c_ast->dptr;
+ unsigned int a_inc = a_ast->inc;
+ unsigned int b_inc = b_ast->inc;
+ SLuindex_Type i, n = c_ast->num;
+
+ for (i = 0; i < n; i++)
+ {
+	ci = (*f)(*a, *b);
+	a += a_inc;
+	b += b_inc;
+ }
+ return 0;
+}
+
+static int do_df_fun (double (*f)(double, double),
+		 Array_Or_Scalar_Type *a_ast,
+		 Array_Or_Scalar_Type *b_ast,
+		 Array_Or_Scalar_Type *c_ast)
+{
+ double *a = a_ast->dptr;
+ float *b = b_ast->fptr;
+ double *c = c_ast->dptr;
+ unsigned int a_inc = a_ast->inc;
+ unsigned int b_inc = b_ast->inc;
+ SLuindex_Type i, n = c_ast->num;
+
+ for (i = 0; i < n; i++)
+ {
+	ci = (*f)(*a, *b);
+	a += a_inc;
+	b += b_inc;
+ }
+ return 0;
+}
+
+static int do_binary_function (double (*f)(double, double))
+{
+ SLtype type;
+ Array_Or_Scalar_Type a_ast, b_ast, c_ast;
+
+ if (-1 == pop_2_arrays_or_scalar (&a_ast, &b_ast))
+ return -1;
+
+ c_ast.is_float = (a_ast.is_float && b_ast.is_float);
+ c_ast.at = NULL;
+ c_ast.num = 1;
+ c_ast.inc = 0;
+ if (c_ast.is_float)
+ {
+	type = SLANG_FLOAT_TYPE;
+	c_ast.fptr = &c_ast.f;
+ }
+ else
+ {
+	type = SLANG_DOUBLE_TYPE;
+	c_ast.dptr = &c_ast.d;
+ }
+
+ if ((a_ast.at != NULL) || (b_ast.at != NULL))
+ {
+	if (NULL == (c_ast.at = create_from_tmp_array (a_ast.at, b_ast.at, type)))
+	 {
+	 free_array_or_scalar (&a_ast);
+	 free_array_or_scalar (&b_ast);
+	 return -1;
+	 }
+	c_ast.fptr = (float *) c_ast.at->data;
+	c_ast.dptr = (double *) c_ast.at->data;
+	c_ast.num = c_ast.at->num_elements;
+	c_ast.inc = 1;
+ }
+
+ if (a_ast.is_float)
+ {
+	if (b_ast.is_float)
+	 (void) do_ff_fun (f, &a_ast, &b_ast, &c_ast);
+	else
+	 (void) do_fd_fun (f, &a_ast, &b_ast, &c_ast);
+ }
+ else if (b_ast.is_float)
+ (void) do_df_fun (f, &a_ast, &b_ast, &c_ast);
+ else
+ (void) do_dd_fun (f, &a_ast, &b_ast, &c_ast);
+
+ free_array_or_scalar (&a_ast);
+ free_array_or_scalar (&b_ast);
+
+ if (c_ast.at != NULL)
+ return SLang_push_array (c_ast.at, 1);
+
+ if (c_ast.is_float)
+ return SLang_push_float (c_ast.f);
+
+ return SLang_push_double (c_ast.d);
+}
+
+/* num is assumed to be at least 2 here */
+static int do_binary_function_on_nargs (double (*f)(double, double), int num)
+{
+ int depth = SLstack_depth () - num;
+
+ num--;			 /* first time consumes 2 args */
+ while (num > 0)
+ {
+	if (-1 == do_binary_function (f))
+	 {
+	 num = SLstack_depth () - depth;
+	 if (num > 0)
+	 (void) SLdo_pop_n ((unsigned int) num);
+	 return -1;
+	 }
+	num--;
+ }
+ return 0;
+}
+
+static void hypot_fun (void)
+{
+ Array_Or_Scalar_Type ast;
+ SLuindex_Type num;
+
+ if (SLang_Num_Function_Args >= 2)
+ {
+	(void) do_binary_function_on_nargs (SLmath_hypot, SLang_Num_Function_Args);
+	return;
+ }
+
+ if (-1 == pop_array_or_scalar (&ast))
+ return;
+
+ if (0 == (num = ast.num))
+ {
+	SLang_verror (SL_InvalidParm_Error, "An empty array was passed to hypot");
+	free_array_or_scalar (&ast);
+	return;
+ }
+
+ if (ast.is_float)
+ {
+	float *f = ast.fptr;
+	double sum, esum, max;
+	SLuindex_Type i, imax;
+
+	max = fabs((double)*f);
+	imax = 0;
+	for (i = 1; i < num; i++)
+	 {
+	 double max1 = fabs((double)fi);
+	 if (max1 > max)
+	 {
+		 imax = i;
+		 max = max1;
+	 }
+	 }
+	sum = 0.0; esum = 0.0;
+	if (max > 0.0)
+	 {
+	 for (i = 0; i < imax; i++)
+	 {
+		 double term = fi/max;
+		 double new_sum;
+
+		 term = term*term - esum;
+		 new_sum = sum + term;
+		 esum = (new_sum - sum) - term;
+		 sum = new_sum;
+	 }
+	 for (i = imax+1; i < num; i++)
+	 {
+		 double term = fi/max;
+		 double new_sum;
+
+		 term = term*term - esum;
+		 new_sum = sum + term;
+		 esum = (new_sum - sum) - term;
+		 sum = new_sum;
+	 }
+	 }
+	(void) SLang_push_float ((float) max*sqrt(1.0+sum));
+ }
+ else
+ {
+	unsigned int i, imax;
+	double *d = ast.dptr;
+	double sum, esum, max;
+	max = fabs(*d);
+	imax = 0;
+	for (i = 1; i < num; i++)
+	 {
+	 double max1 = fabs(di);
+	 if (max1 > max)
+	 {
+		 max = max1;
+		 imax = i;
+	 }
+	 }
+	sum = 0.0; esum = 0.0;
+	if (max > 0.0)
+	 {
+	 for (i = 0; i < imax; i++)
+	 {
+		 double term = di/max;
+		 double new_sum;
+
+		 term = term*term - esum;
+		 new_sum = sum + term;
+		 esum = (new_sum - sum) - term;
+		 sum = new_sum;
+	 }
+	 for (i = imax+1; i < num; i++)
+	 {
+		 double term = di/max;
+		 double new_sum;
+
+		 term = term*term - esum;
+		 new_sum = sum + term;
+		 esum = (new_sum - sum) - term;
+		 sum = new_sum;
+	 }
+	 }
+	(void) SLang_push_double (max*sqrt(1.0+sum));
+ }
+ free_array_or_scalar (&ast);
+}
+
+static void math_poly (void)
+{
+ Array_Or_Scalar_Type ast;
+ SLang_Array_Type *coeff_at, *y_at;
+ SLuindex_Type i, k, n;
+ SLuindex_Type num;
+ double *a;
+ double x, y;
+ int use_factorial = 0;
+
+ switch (SLang_Num_Function_Args)
+ {
+ case 3:
+	if (-1 == SLang_pop_int (&use_factorial))
+	 return;
+	/* drop */
+ case 2:
+	break;
+
+ default:
+	SLang_verror (SL_Usage_Error, "\
+Usage: y = polynom(a0,a1,..., x ,use_factorial_form)");
+	return;
+ }
+
+ if (-1 == pop_array_or_scalar (&ast))
+ return;
+
+ if (-1 == SLang_pop_array_of_type (&coeff_at, SLANG_DOUBLE_TYPE))
+ {
+	free_array_or_scalar (&ast);
+	return;
+ }
+ a = (double *) coeff_at->data;
+ n = coeff_at->num_elements;
+
+ if (ast.inc == 0)
+ {
+	if (ast.is_float)
+	 x = (double) ast.f;
+	else
+	 x = ast.d;
+
+	y = 0.0;
+	k = n;
+
+	if (use_factorial)
+	 {
+	 while (k != 0)
+	 {
+		 y = ak-1 + (x/k)*y;
+		 k--;
+	 }
+	 }
+	else while (k != 0)
+	 {
+	 k--;
+	 y = ak + x*y;
+	 }
+
+	if (ast.is_float)
+	 (void) SLang_push_float ((float) y);
+	else
+	 (void) SLang_push_double (y);
+
+	goto free_and_return;
+ }
+
+ if (NULL == (y_at = create_from_tmp_array (ast.at, NULL, ast.at->data_type)))
+ goto free_and_return;
+
+ num = ast.num;
+
+ if (ast.is_float)
+ {
+	float *f = ast.fptr;
+	float *yf = (float *)y_at->data;
+
+	for (i = 0; i < num; i++)
+	 {
+	 x = (double) fi;
+	 y = 0.0;
+	 k = n;
+	 if (use_factorial)
+	 {
+		 while (k != 0)
+		 {
+		 y = ak-1 + (x/k)*y;
+		 k--;
+		 }
+	 }
+	 else while (k != 0)
+	 {
+		 k--;
+		 y = ak + x*y;
+	 }
+	 yfi = (float) y;
+	 }
+ }
+ else
+ {
+	double *d = ast.dptr;
+	double *yd = (double *)y_at->data;
+
+	for (i = 0; i < num; i++)
+	 {
+	 x = di;
+	 y = 0.0;
+	 k = n;
+	 if (use_factorial)
+	 {
+		 while (k != 0)
+		 {
+		 y = ak-1 + (x/k)*y;
+		 k--;
+		 }
+	 }
+	 else while (k != 0)
+	 {
+		 k--;
+		 y = ak + x*y;
+	 }
+	 ydi = y;
+	 }
+ }
+
+ (void) SLang_push_array (y_at, 1);
+ /* drop */
+free_and_return:
+ free_array_or_scalar (&ast);
+ SLang_free_array (coeff_at);
+}
+
+static void atan2_fun (void)
+{
+ (void) do_binary_function (atan2);
+}
+
+static double do_min (double a, double b)
+{
+ if ((a >= b) || ISNAN_FUN(a))
+ return b;
+ return a;
+}
+static double do_max (double a, double b)
+{
+ if ((a <= b) || ISNAN_FUN(a))
+ return b;
+ return a;
+}
+static double do_diff (double a, double b)
+{
+ return fabs(a-b);
+}
+
+static void min_fun (void)
+{
+ int num = SLang_Num_Function_Args;
+
+ if (num <= 0)
+ {
+	SLang_verror (SL_Usage_Error, "_min: Expecting at least one argument");
+	return;
+ }
+
+ if (num > 1)
+ (void) do_binary_function_on_nargs (do_min, num);
+}
+
+static void max_fun (void)
+{
+ int num = SLang_Num_Function_Args;
+
+ if (num <= 0)
+ {
+	SLang_verror (SL_Usage_Error, "_max: Expecting at least one argument");
+	return;
+ }
+
+ if (num > 1)
+ (void) do_binary_function_on_nargs (do_max, num);
+}
+
+static void diff_fun (void)
+{
+ (void) do_binary_function (do_diff);
+}
+
+#if 1
+
+static int do_c_dd_fun (int (*f)(double, double, VOID_STAR),
+			VOID_STAR cd,
+			Array_Or_Scalar_Type *a_ast,
+			Array_Or_Scalar_Type *b_ast,
+			Array_Or_Scalar_Type *c_ast)
+{
+ double *a = a_ast->dptr;
+ double *b = b_ast->dptr;
+ char *c = c_ast->cptr;
+ unsigned int a_inc = a_ast->inc;
+ unsigned int b_inc = b_ast->inc;
+ SLuindex_Type i, n = c_ast->num;
+
+ for (i = 0; i < n; i++)
+ {
+	ci = (char) (*f)(*a, *b, cd);
+	a += a_inc;
+	b += b_inc;
+ }
+ return 0;
+}
+
+static int do_c_ff_fun (int (*f)(double, double, VOID_STAR),
+			VOID_STAR cd,
+			Array_Or_Scalar_Type *a_ast,
+			Array_Or_Scalar_Type *b_ast,
+			Array_Or_Scalar_Type *c_ast)
+{
+ float *a = a_ast->fptr;
+ float *b = b_ast->fptr;
+ char *c = c_ast->cptr;
+ unsigned int a_inc = a_ast->inc;
+ unsigned int b_inc = b_ast->inc;
+ SLuindex_Type i, n = c_ast->num;
+
+ for (i = 0; i < n; i++)
+ {
+	ci = (char) (*f)(*a, *b, cd);
+	a += a_inc;
+	b += b_inc;
+ }
+ return 0;
+}
+
+static int do_c_fd_fun (int (*f)(double, double, VOID_STAR),
+			VOID_STAR cd,
+			Array_Or_Scalar_Type *a_ast,
+			Array_Or_Scalar_Type *b_ast,
+			Array_Or_Scalar_Type *c_ast)
+{
+ float *a = a_ast->fptr;
+ double *b = b_ast->dptr;
+ char *c = c_ast->cptr;
+ unsigned int a_inc = a_ast->inc;
+ unsigned int b_inc = b_ast->inc;
+ SLuindex_Type i, n = c_ast->num;
+
+ for (i = 0; i < n; i++)
+ {
+	ci = (char) (*f)(*a, *b, cd);
+	a += a_inc;
+	b += b_inc;
+ }
+ return 0;
+}
+
+static int do_c_df_fun (int (*f)(double, double, VOID_STAR),
+			VOID_STAR cd,
+			Array_Or_Scalar_Type *a_ast,
+			Array_Or_Scalar_Type *b_ast,
+			Array_Or_Scalar_Type *c_ast)
+{
+ double *a = a_ast->dptr;
+ float *b = b_ast->fptr;
+ char *c = c_ast->cptr;
+ unsigned int a_inc = a_ast->inc;
+ unsigned int b_inc = b_ast->inc;
+ SLuindex_Type i, n = c_ast->num;
+
+ for (i = 0; i < n; i++)
+ {
+	ci = (char) (*f)(*a, *b, cd);
+	a += a_inc;
+	b += b_inc;
+ }
+ return 0;
+}
+
+static int do_binary_function_c (int (*f)(double, double,VOID_STAR), VOID_STAR cd)
+{
+ Array_Or_Scalar_Type a_ast, b_ast, c_ast;
+
+ if (-1 == pop_2_arrays_or_scalar (&a_ast, &b_ast))
+ return -1;
+
+ c_ast.at = NULL;
+ c_ast.num = 1;
+ c_ast.inc = 0;
+ c_ast.cptr = &c_ast.c;
+
+ if ((a_ast.at != NULL) || (b_ast.at != NULL))
+ {
+	if (a_ast.at != NULL)
+	 c_ast.at = SLang_create_array1 (SLANG_CHAR_TYPE, 0, NULL, a_ast.at->dims, a_ast.at->num_dims, 1);
+	else
+	 c_ast.at = SLang_create_array1 (SLANG_CHAR_TYPE, 0, NULL, b_ast.at->dims, b_ast.at->num_dims, 1);
+
+	if (c_ast.at == NULL)
+	 {
+	 free_array_or_scalar (&a_ast);
+	 free_array_or_scalar (&b_ast);
+	 return -1;
+	 }
+	c_ast.cptr = (char *) c_ast.at->data;
+	c_ast.num = c_ast.at->num_elements;
+	c_ast.inc = 1;
+ }
+
+ if (a_ast.is_float)
+ {
+	if (b_ast.is_float)
+	 (void) do_c_ff_fun (f, cd, &a_ast, &b_ast, &c_ast);
+	else
+	 (void) do_c_fd_fun (f, cd, &a_ast, &b_ast, &c_ast);
+ }
+ else if (b_ast.is_float)
+ (void) do_c_df_fun (f, cd, &a_ast, &b_ast, &c_ast);
+ else
+ (void) do_c_dd_fun (f, cd, &a_ast, &b_ast, &c_ast);
+
+ free_array_or_scalar (&a_ast);
+ free_array_or_scalar (&b_ast);
+
+ if (c_ast.at != NULL)
+ return SLang_push_array (c_ast.at, 1);
+
+ return SLang_push_char (c_ast.c);
+}
+
+typedef struct
+{
+ double relerr;
+ double abserr;
+}
+Feqs_Err_Type;
+
+static int get_tolerances (int nargs, Feqs_Err_Type *ep)
+{
+ switch (nargs)
+ {
+ case 2:
+	if ((-1 == SLang_pop_double (&ep->abserr))
+	 || (-1 == SLang_pop_double (&ep->relerr)))
+	 return -1;
+	break;
+
+ case 1:
+	if (-1 == SLang_pop_double (&ep->relerr))
+	 return -1;
+	ep->abserr = 0.0;
+	break;
+
+ default:
+	ep->relerr = 0.01;
+	ep->abserr = 1e-6;
+	break;
+ }
+ return 0;
+}
+
+static int do_feqs (double a, double b, VOID_STAR cd)
+{
+ Feqs_Err_Type *e = (Feqs_Err_Type *)cd;
+
+ if (fabs (a-b) <= e->abserr)
+ return 1;
+
+ if (fabs(a) > fabs(b))
+ return fabs ((a-b)/a) <= e->relerr;
+
+ return fabs ((b-a)/b) <= e->relerr;
+}
+
+static int do_fneqs (double a, double b, VOID_STAR cd)
+{
+ return !do_feqs (a, b, cd);
+}
+
+static int do_fleqs (double a, double b, VOID_STAR cd)
+{
+ return (a < b) || do_feqs (a, b, cd);
+}
+
+static int do_fgeqs (double a, double b, VOID_STAR cd)
+{
+ return (a > b) || do_feqs (a, b, cd);
+}
+
+static void do_an_feqs_fun (int (*f)(double, double, VOID_STAR))
+{
+ Feqs_Err_Type e;
+ if (-1 == get_tolerances (SLang_Num_Function_Args-2, &e))
+ return;
+
+ do_binary_function_c (f, (VOID_STAR)&e);
+}
+
+static void feqs_fun (void)
+{
+ do_an_feqs_fun (do_feqs);
+}
+
+static void fgeqs_fun (void)
+{
+ do_an_feqs_fun (do_fgeqs);
+}
+
+static void fleqs_fun (void)
+{
+ do_an_feqs_fun (do_fleqs);
+}
+
+static void fneqs_fun (void)
+{
+ do_an_feqs_fun (do_fneqs);
+}
+#endif
+
+static int do_nint (double x)
+{
+ double xf, xi;
+
+ xf = modf (x, &xi);		 /* x = xi + xf */
+ if (x >= 0)
+ {
+	if (xf >= 0.5)
+	 return xi + 1;
+ }
+ else
+ {
+	if (xf <= -0.5)
+	 return xi - 1;
+ }
+ return xi;
+}
+
+static int float_to_nint (SLang_Array_Type *at, SLang_Array_Type *bt)
+{
+ SLuindex_Type n, i;
+ int *ip;
+ float *fp;
+
+ fp = (float *) at->data;
+ ip = (int *) bt->data;
+ n = at->num_elements;
+
+ for (i = 0; i < n; i++)
+ ipi = do_nint ((double) fpi);
+
+ return 0;
+}
+
+static int double_to_nint (SLang_Array_Type *at, SLang_Array_Type *bt)
+{
+ SLuindex_Type n, i;
+ int *ip;
+ double *dp;
+
+ dp = (double *) at->data;
+ ip = (int *) bt->data;
+ n = at->num_elements;
+
+ for (i = 0; i < n; i++)
+ ipi = do_nint (dpi);
+
+ return 0;
+}
+
+static void nint_intrin (void)
+{
+ double x;
+ SLang_Array_Type *at, *bt;
+ int (*at_to_int_fun)(SLang_Array_Type *, SLang_Array_Type *);
+ SLtype dtype;
+
+ if (SLANG_ARRAY_TYPE != _pSLang_peek_at_stack2 (&dtype))
+ {
+	if (-1 == SLang_pop_double (&x))
+	 return;
+	(void) SLang_push_int (do_nint (x));
+	return;
+ }
+ switch (dtype)
+ {
+ case SLANG_INT_TYPE:
+	return;
+
+ case SLANG_FLOAT_TYPE:
+	if (-1 == SLang_pop_array_of_type (&at, SLANG_FLOAT_TYPE))
+	 return;
+	at_to_int_fun = float_to_nint;
+	break;
+
+ case SLANG_DOUBLE_TYPE:
+ default:
+	if (-1 == SLang_pop_array_of_type (&at, SLANG_DOUBLE_TYPE))
+	 return;
+	at_to_int_fun = double_to_nint;
+	break;
+ }
+
+ if (NULL == (bt = SLang_create_array1 (SLANG_INT_TYPE, 0, NULL, at->dims, at->num_dims, 1)))
+ {
+	SLang_free_array (at);
+	return;
+ }
+ if (0 == (*at_to_int_fun) (at, bt))
+ (void) SLang_push_array (bt, 0);
+
+ SLang_free_array (bt);
+ SLang_free_array (at);
+}
+
+#ifdef HAVE_FREXP
+# define FREXP_FUN(x,e) frexp(x,e)
+# ifdef HAVE_FREXPF
+# define FREXPF_FUN(x,e) frexpf(x,e)
+# else
+# define FREXPF_FUN(x,e) (float)FREXP_FUN(x,e)
+# endif
+
+static void frexp_intrin (void)
+{
+ double d;
+ float f;
+ int e, *ep;
+ SLuindex_Type i, imax;
+ SLang_Array_Type *at, *bt, *et;
+ SLtype dtype;
+
+ switch (_pSLang_peek_at_stack2 (&dtype))
+ {
+ case SLANG_ARRAY_TYPE:
+	switch (dtype)
+	 {
+	 case SLANG_FLOAT_TYPE:
+	 if (-1 == SLang_pop_array_of_type (&at, SLANG_FLOAT_TYPE))
+	 return;
+	 break;
+
+	 default:
+	 case SLANG_DOUBLE_TYPE:
+	 if (-1 == SLang_pop_array_of_type (&at, SLANG_DOUBLE_TYPE))
+	 return;
+	 break;
+	 }
+	break;
+
+ case SLANG_FLOAT_TYPE:
+	if (-1 == SLang_pop_float (&f))
+	 return;
+	f = FREXPF_FUN(f, &e);
+	(void) SLang_push_float (f);
+	(void) SLang_push_int (e);
+	return;
+
+ default:
+ case SLANG_DOUBLE_TYPE:
+	if (-1 == SLang_pop_double (&d))
+	 return;
+	d = FREXP_FUN(d, &e);
+	(void) SLang_push_double (d);
+	(void) SLang_push_int (e);
+	return;
+ }
+
+ if (NULL == (bt = SLang_create_array1 (at->data_type, 0, NULL, at->dims, at->num_dims, 1)))
+ {
+	SLang_free_array (at);
+	return;
+ }
+ if (NULL == (et = SLang_create_array1 (SLANG_INT_TYPE, 0, NULL, at->dims, at->num_dims, 1)))
+ {
+	SLang_free_array (at);
+	SLang_free_array (bt);
+	return;
+ }
+
+ imax = at->num_elements;
+ ep = (int *)et->data;
+
+ if (at->data_type == SLANG_DOUBLE_TYPE)
+ {
+	double *a = (double *)at->data;
+	double *b = (double *)bt->data;
+	for (i = 0; i < imax; i++)
+	 {
+	 bi = FREXP_FUN(ai, ep+i);
+	 }
+ }
+ else
+ {
+	float *a = (float *)at->data;
+	float *b = (float *)bt->data;
+	for (i = 0; i < imax; i++)
+	 {
+	 bi = FREXPF_FUN(ai, ep+i);
+	 }
+ }
+
+ (void) SLang_push_array (bt, 0);
+ (void) SLang_push_array (et, 0);
+ SLang_free_array (et);
+ SLang_free_array (bt);
+ SLang_free_array (at);
+}
+#endif				 /* HAVE_FREXP */
+
+#ifdef HAVE_LDEXP
+# define LDEXP_FUN(a,b) ldexp(a,b)
+# ifdef HAVE_LDEXPF
+# define LDEXPF_FUN(a,b) ldexpf(a,b)
+# else
+# define LDEXPF_FUN(a,b) (float)LDEXP_FUN(a,b)
+# endif
+static void ldexp_intrin (void)
+{
+ Array_Or_Scalar_Type ast;
+ SLang_Array_Type *e_at = NULL, *c_at;
+ int *e_ptr, e_data;
+ SLuindex_Type i, imax;
+
+ if (SLang_peek_at_stack () == SLANG_ARRAY_TYPE)
+ {
+	if (-1 == SLang_pop_array_of_type (&e_at, SLANG_INT_TYPE))
+	 return;
+	e_ptr = (int *)e_at->data;
+ }
+ else
+ {
+	if (-1 == SLang_pop_int (&e_data))
+	 return;
+	e_ptr = &e_data;
+ }
+
+ if (-1 == pop_array_or_scalar (&ast))
+ {
+	if (e_at != NULL)
+	 SLang_free_array (e_at);
+	return;
+ }
+
+ if ((e_at == NULL) && (ast.at == NULL))
+ {
+	/* Scalar case */
+	if (ast.is_float)
+	 (void) SLang_push_float (LDEXPF_FUN(ast.f, *e_ptr));
+	else
+	 (void) SLang_push_double (LDEXP_FUN(ast.d, *e_ptr));
+	/* free_array_or_scalar (&ast); Nothing to free */
+	return;
+ }
+
+ if (NULL == (c_at = create_from_tmp_array (ast.at, e_at, ast.is_float ? SLANG_FLOAT_TYPE : SLANG_DOUBLE_TYPE)))
+ {
+	free_array_or_scalar (&ast);
+	SLang_free_array (e_at);
+	return;
+ }
+
+ if (e_at == NULL)
+ {
+	int e = *e_ptr;
+	imax = ast.num;
+
+	if (ast.is_float)
+	 {
+	 float *c, *a;
+	 a = ast.fptr;
+	 c = (float *)c_at->data;
+	 for (i = 0; i < imax; i++)
+	 ci = LDEXPF_FUN(ai, e);
+	 }
+	else
+	 {
+	 double *c, *a;
+	 a = ast.dptr;
+	 c = (double *)c_at->data;
+	 for (i = 0; i < imax; i++)
+	 ci = LDEXP_FUN(ai, e);
+	 }
+	goto push_free_and_return;
+ }
+
+ if (ast.at == NULL)
+ {
+	imax = e_at->num_elements;
+
+	if (ast.is_float)
+	 {
+	 float *c, a;
+	 a = ast.f;
+	 c = (float *)c_at->data;
+	 for (i = 0; i < imax; i++)
+	 ci = LDEXPF_FUN(a, e_ptri);
+	 }
+	else
+	 {
+	 double *c, a;
+	 a = ast.d;
+	 c = (double *)c_at->data;
+	 for (i = 0; i < imax; i++)
+	 ci = LDEXP_FUN(a, e_ptri);
+	 }
+	goto push_free_and_return;
+ }
+
+ if (e_at->num_elements != ast.num)
+ {
+	SLang_verror (SL_TypeMismatch_Error, "ldexp: Array sizes do not match");
+	goto free_and_return;
+ }
+
+ imax = ast.num;
+ if (ast.is_float)
+ {
+	float *c = (float *)c_at->data;
+	float *a = ast.fptr;
+	for (i = 0; i < imax; i++)
+	 ci = LDEXPF_FUN(ai, e_ptri);
+ }
+ else
+ {
+	double *c = (double *)c_at->data;
+	double *a = ast.dptr;
+	for (i = 0; i < imax; i++)
+	 ci = LDEXP_FUN(ai, e_ptri);
+ }
+ /* drop */
+push_free_and_return:
+ (void) SLang_push_array (c_at, 0);
+ /* drop */
+free_and_return:
+ if (e_at != NULL) SLang_free_array (e_at);
+ SLang_free_array (c_at);
+ free_array_or_scalar (&ast);
+}
+#endif				 /* HAVE_LDEXPF */
+
+
+#ifdef HAVE_SINCOSF
+# define SINCOSF(x, sp, cp) sincosf (x, sp, cp)
+#else
+# define SINCOSF(x, sp, cp) \
+ *(sp) = (float)sin(x); *(cp) = (float)cos(x)
+#endif
+#ifdef HAVE_SINCOS
+# define SINCOS(x, sp, cp) sincos (x, sp, cp)
+#else
+# define SINCOS(x, sp, cp) \
+ *(sp) = sin(x); *(cp) = cos(x)
+#endif
+
+static void sincos_intrin (void)
+{
+ Array_Or_Scalar_Type ast;
+ SLtype type;
+ SLang_Array_Type *s_at, *c_at;
+ SLuindex_Type num;
+
+ if (-1 == pop_array_or_scalar (&ast))
+ return;
+
+ if (ast.inc == 0)
+ {
+	if (ast.is_float)
+	 {
+	 float s, c;
+	 SINCOSF(ast.f, &s, &c);
+	 (void) SLang_push_float (s);
+	 (void) SLang_push_float (c);
+	 }
+	else
+	 {
+	 double s, c;
+	 SINCOS(ast.d, &s, &c);
+	 (void) SLang_push_double (s);
+	 (void) SLang_push_double (c);
+	 }
+	free_array_or_scalar (&ast);
+	return;
+ }
+
+ c_at = s_at = NULL;
+ num = ast.num;
+ type = ast.is_float ? SLANG_FLOAT_TYPE : SLANG_DOUBLE_TYPE;
+
+ s_at = SLang_create_array1(type, 0, NULL, ast.at->dims, ast.at->num_dims, 1);
+ if (s_at == NULL)
+ goto free_and_return;
+ c_at = SLang_create_array1(type, 0, NULL, ast.at->dims, ast.at->num_dims, 1);
+ if (c_at == NULL)
+ goto free_and_return;
+
+ if (ast.is_float)
+ {
+	SLuindex_Type i;
+	float *x = ast.fptr;
+	float *s = (float*) s_at->data;
+	float *c = (float*) c_at->data;
+	for (i=0; i<num; i++)
+	 {
+	 SINCOSF(xi, s+i, c+i);
+	 }
+ }
+ else
+ {
+	SLuindex_Type i;
+	double *x = ast.dptr;
+	double *s = (double*) s_at->data;
+	double *c = (double*) c_at->data;
+	for (i=0; i<num; i++)
+	 {
+	 SINCOS (xi, s+i, c+i);
+	 }
+ }
+
+ if (0 == SLang_push_array (s_at, 0))
+ (void) SLang_push_array (c_at, 0);
+
+ /* drop */
+free_and_return:
+ if (c_at != NULL) SLang_free_array (c_at);
+ if (s_at != NULL) SLang_free_array (s_at);
+ free_array_or_scalar (&ast);
+}
+
+static void fpu_clear_except_bits (void)
+{
+ SLfpu_clear_except_bits ();
+}
+
+static int fpu_test_except_bits (int *bits)
+{
+ return (int) SLfpu_test_except_bits ((unsigned int) *bits);
+}
+
+static SLang_DConstant_Type DConst_Table =
+{
+ MAKE_DCONSTANT("E", 2.718281828459045),
+ MAKE_DCONSTANT("PI", PI),
+ SLANG_END_DCONST_TABLE
+};
+
+static SLang_Math_Unary_Type SLmath_Table =
+{
+ MAKE_MATH_UNARY("sinh", SLMATH_SINH),
+ MAKE_MATH_UNARY("asinh", SLMATH_ASINH),
+ MAKE_MATH_UNARY("cosh", SLMATH_COSH),
+ MAKE_MATH_UNARY("acosh", SLMATH_ACOSH),
+ MAKE_MATH_UNARY("tanh", SLMATH_TANH),
+ MAKE_MATH_UNARY("atanh", SLMATH_ATANH),
+ MAKE_MATH_UNARY("sin", SLMATH_SIN),
+ MAKE_MATH_UNARY("cos", SLMATH_COS),
+ MAKE_MATH_UNARY("tan", SLMATH_TAN),
+ MAKE_MATH_UNARY("atan", SLMATH_ATAN),
+ MAKE_MATH_UNARY("acos", SLMATH_ACOS),
+ MAKE_MATH_UNARY("asin", SLMATH_ASIN),
+ MAKE_MATH_UNARY("exp", SLMATH_EXP),
+ MAKE_MATH_UNARY("log", SLMATH_LOG),
+ MAKE_MATH_UNARY("sqrt", SLMATH_SQRT),
+ MAKE_MATH_UNARY("log10", SLMATH_LOG10),
+ MAKE_MATH_UNARY("isinf", SLMATH_ISINF),
+ MAKE_MATH_UNARY("isnan", SLMATH_ISNAN),
+ MAKE_MATH_UNARY("floor", SLMATH_FLOOR),
+ MAKE_MATH_UNARY("ceil", SLMATH_CEIL),
+ MAKE_MATH_UNARY("round", SLMATH_ROUND),
+ MAKE_MATH_UNARY("expm1", SLMATH_EXPM1),
+ MAKE_MATH_UNARY("log1p", SLMATH_LOG1P),
+
+#if SLANG_HAS_COMPLEX
+ MAKE_MATH_UNARY("Real", SLMATH_REAL),
+ MAKE_MATH_UNARY("Imag", SLMATH_IMAG),
+ MAKE_MATH_UNARY("Conj", SLMATH_CONJ),
+#endif
+ SLANG_END_MATH_UNARY_TABLE
+};
+
+static SLang_Intrin_Fun_Type SLang_Math_Table =
+{
+ MAKE_INTRINSIC_0("nint", nint_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("polynom", math_poly, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("hypot", hypot_fun, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("atan2", atan2_fun, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_min", min_fun, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_max", max_fun, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_diff", diff_fun, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("feqs", feqs_fun, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("fneqs", fneqs_fun, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("flteqs", fleqs_fun, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("fgteqs", fgeqs_fun, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("fpu_clear_except_bits", fpu_clear_except_bits, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_1("fpu_test_except_bits", fpu_test_except_bits, _pSLANG_LONG_TYPE, _pSLANG_LONG_TYPE),
+#ifdef HAVE_FREXP
+ MAKE_INTRINSIC_0("frexp", frexp_intrin, SLANG_VOID_TYPE),
+#endif
+#ifdef HAVE_LDEXP
+ MAKE_INTRINSIC_0("ldexp", ldexp_intrin, SLANG_VOID_TYPE),
+#endif
+ MAKE_INTRINSIC_0("sincos", sincos_intrin, SLANG_VOID_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static SLang_IConstant_Type IConsts =
+{
+ MAKE_ICONSTANT("FE_DIVBYZERO", SL_FE_DIVBYZERO),
+ MAKE_ICONSTANT("FE_INVALID", SL_FE_INVALID),
+ MAKE_ICONSTANT("FE_OVERFLOW", SL_FE_OVERFLOW),
+ MAKE_ICONSTANT("FE_UNDERFLOW", SL_FE_UNDERFLOW),
+ MAKE_ICONSTANT("FE_INEXACT", SL_FE_INEXACT),
+ MAKE_ICONSTANT("FE_ALL_EXCEPT", SL_FE_ALLEXCEPT),
+ SLANG_END_ICONST_TABLE
+};
+
+static int add_nan_and_inf (void)
+{
+ if ((-1 == SLns_add_dconstant (NULL, "_NaN", _pSLang_NaN))
+ || (-1 == SLns_add_dconstant (NULL, "_Inf", _pSLang_Inf)))
+ return -1;
+
+ SLfpu_clear_except_bits ();
+
+ return 0;
+}
+
+int SLang_init_slmath (void)
+{
+ SLtype *int_types;
+
+#if SLANG_HAS_COMPLEX
+ if (-1 == _pSLinit_slcomplex ())
+ return -1;
+#endif
+ int_types = _pSLarith_Arith_Types;
+
+ while (*int_types != SLANG_FLOAT_TYPE)
+ {
+	if (-1 == SLclass_add_math_op (*int_types, generic_math_op, double_math_op_result))
+	 return -1;
+	int_types++;
+ }
+
+ if ((-1 == SLclass_add_math_op (SLANG_FLOAT_TYPE, float_math_op, double_math_op_result))
+ || (-1 == SLclass_add_math_op (SLANG_DOUBLE_TYPE, double_math_op, double_math_op_result))
+#if SLANG_HAS_COMPLEX
+ || (-1 == SLclass_add_math_op (SLANG_COMPLEX_TYPE, complex_math_op, complex_math_op_result))
+#endif
+ )
+ return -1;
+
+ if ((-1 == SLadd_math_unary_table (SLmath_Table, "__SLMATH__"))
+ || (-1 == SLadd_intrin_fun_table (SLang_Math_Table, NULL))
+ || (-1 == SLadd_dconstant_table (DConst_Table, NULL))
+ || (-1 == SLadd_iconstant_table (IConsts, NULL))
+ || (-1 == add_nan_and_inf ()))
+ return -1;
+
+#if defined(__unix__)
+ (void) SLsignal (SIGFPE, math_floating_point_exception);
+#endif
+
+ return 0;
+}
+#endif				 /* SLANG_HAS_FLOAT */

_service:tar_scm:slang-2.3.2.tar.bz2/src/slmemchr.c Added

@@ -0,0 +1,61 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+/* These routines are fast memcpy, memset routines. When available, I
+ use system rouines. For msdos, I use inline assembly. */
+
+/* The current versions only work in the forward direction only!! */
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+char *SLmemchr(register char *p, register char c, register int n)
+{
+ int n2;
+ register char *pmax;
+
+ pmax = p + (n - 32);
+
+ while (p <= pmax)
+ {
+	if ((*p == c) || (*++p == c) || (*++p == c) || (*++p == c)
+	 || (*++p == c) || (*++p == c) || (*++p == c) || (*++p == c)
+	 || (*++p == c) || (*++p == c) || (*++p == c) || (*++p == c)
+	 || (*++p == c) || (*++p == c) || (*++p == c) || (*++p == c)
+	 || (*++p == c) || (*++p == c) || (*++p == c) || (*++p == c)
+	 || (*++p == c) || (*++p == c) || (*++p == c) || (*++p == c)
+	 || (*++p == c) || (*++p == c) || (*++p == c) || (*++p == c)
+	 || (*++p == c) || (*++p == c) || (*++p == c) || (*++p == c))
+	 return p;
+	p++;
+ }
+
+ n2 = n % 32;
+
+ while (n2--)
+ {
+	if (*p == c) return p;
+	p++;
+ }
+ return(NULL);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slmemcmp.c Added

@@ -0,0 +1,90 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+/* These routines are fast memcpy, memset routines. When available, I
+ use system rouines. For msdos, I use inline assembly. */
+
+/* The current versions only work in the forward direction only!! */
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+/* This is an UNSIGNED comparison designed for systems that either do not have
+* this function or performed a signed comparison (SunOS)
+*/
+int SLmemcmp(register char *s1, register char *s2, int n)
+{
+ register char *s1max;
+
+ s1max = s1 + (n - 32);
+
+ while (s1 <= s1max)
+ {
+	if (*s1 != *s2) return ((unsigned char) *s1 - (unsigned char) *s2);
+	if (*(s1 + 1) != *(s2 + 1)) return ((unsigned char) *(s1 + 1) - (unsigned char) *(s2 + 1));
+	if (*(s1 + 2) != *(s2 + 2)) return ((unsigned char) *(s1 + 2) - (unsigned char) *(s2 + 2));
+	if (*(s1 + 3) != *(s2 + 3)) return ((unsigned char) *(s1 + 3) - (unsigned char) *(s2 + 3));
+	if (*(s1 + 4) != *(s2 + 4)) return ((unsigned char) *(s1 + 4) - (unsigned char) *(s2 + 4));
+	if (*(s1 + 5) != *(s2 + 5)) return ((unsigned char) *(s1 + 5) - (unsigned char) *(s2 + 5));
+	if (*(s1 + 6) != *(s2 + 6)) return ((unsigned char) *(s1 + 6) - (unsigned char) *(s2 + 6));
+	if (*(s1 + 7) != *(s2 + 7)) return ((unsigned char) *(s1 + 7) - (unsigned char) *(s2 + 7));
+	if (*(s1 + 8) != *(s2 + 8)) return ((unsigned char) *(s1 + 8) - (unsigned char) *(s2 + 8));
+	if (*(s1 + 9) != *(s2 + 9)) return ((unsigned char) *(s1 + 9) - (unsigned char) *(s2 + 9));
+	if (*(s1 + 10) != *(s2 + 10)) return ((unsigned char) *(s1 + 10) - (unsigned char) *(s2 + 10));
+	if (*(s1 + 11) != *(s2 + 11)) return ((unsigned char) *(s1 + 11) - (unsigned char) *(s2 + 11));
+	if (*(s1 + 12) != *(s2 + 12)) return ((unsigned char) *(s1 + 12) - (unsigned char) *(s2 + 12));
+	if (*(s1 + 13) != *(s2 + 13)) return ((unsigned char) *(s1 + 13) - (unsigned char) *(s2 + 13));
+	if (*(s1 + 14) != *(s2 + 14)) return ((unsigned char) *(s1 + 14) - (unsigned char) *(s2 + 14));
+	if (*(s1 + 15) != *(s2 + 15)) return ((unsigned char) *(s1 + 15) - (unsigned char) *(s2 + 15));
+	if (*(s1 + 16) != *(s2 + 16)) return ((unsigned char) *(s1 + 16) - (unsigned char) *(s2 + 16));
+	if (*(s1 + 17) != *(s2 + 17)) return ((unsigned char) *(s1 + 17) - (unsigned char) *(s2 + 17));
+	if (*(s1 + 18) != *(s2 + 18)) return ((unsigned char) *(s1 + 18) - (unsigned char) *(s2 + 18));
+	if (*(s1 + 19) != *(s2 + 19)) return ((unsigned char) *(s1 + 19) - (unsigned char) *(s2 + 19));
+	if (*(s1 + 20) != *(s2 + 20)) return ((unsigned char) *(s1 + 20) - (unsigned char) *(s2 + 20));
+	if (*(s1 + 21) != *(s2 + 21)) return ((unsigned char) *(s1 + 21) - (unsigned char) *(s2 + 21));
+	if (*(s1 + 22) != *(s2 + 22)) return ((unsigned char) *(s1 + 22) - (unsigned char) *(s2 + 22));
+	if (*(s1 + 23) != *(s2 + 23)) return ((unsigned char) *(s1 + 23) - (unsigned char) *(s2 + 23));
+	if (*(s1 + 24) != *(s2 + 24)) return ((unsigned char) *(s1 + 24) - (unsigned char) *(s2 + 24));
+	if (*(s1 + 25) != *(s2 + 25)) return ((unsigned char) *(s1 + 25) - (unsigned char) *(s2 + 25));
+	if (*(s1 + 26) != *(s2 + 26)) return ((unsigned char) *(s1 + 26) - (unsigned char) *(s2 + 26));
+	if (*(s1 + 27) != *(s2 + 27)) return ((unsigned char) *(s1 + 27) - (unsigned char) *(s2 + 27));
+	if (*(s1 + 28) != *(s2 + 28)) return ((unsigned char) *(s1 + 28) - (unsigned char) *(s2 + 28));
+	if (*(s1 + 29) != *(s2 + 29)) return ((unsigned char) *(s1 + 29) - (unsigned char) *(s2 + 29));
+	if (*(s1 + 30) != *(s2 + 30)) return ((unsigned char) *(s1 + 30) - (unsigned char) *(s2 + 30));
+	if (*(s1 + 31) != *(s2 + 31)) return ((unsigned char) *(s1 + 31) - (unsigned char) *(s2 + 31));
+	s1 += 32; s2 += 32;
+ }
+
+ s1max = s1 + (n % 32);
+
+ while (s1 < s1max)
+ {
+	register int cmp;
+	cmp = (unsigned char) *s1 - (unsigned char) *s2;
+	if (cmp) return(cmp);
+	s1++;
+	s2++;
+ }
+
+ return(0);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slmemcpy.c Added

@@ -0,0 +1,63 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+/* These routines are fast memcpy, memset routines. When available, I
+ use system rouines. For msdos, I use inline assembly. */
+
+/* The current versions only work in the forward direction only!! */
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+char *SLmemcpy(char *s1, char *s2, int n)
+{
+#if defined(__BORLANDC__) && defined(__MSDOS__)
+ asm mov ax, ds
+ asm mov bx, si
+ asm mov dx, di
+ asm mov cx, n
+ asm les di, s1
+ asm lds si, s2
+ asm cld
+ asm rep movsb
+ asm mov ds, ax
+ asm mov si, bx
+ asm mov di, dx
+ return(s1);
+
+#else
+ register char *smax, *s = s1;
+ int n2;
+
+ n2 = n % 4;
+ smax = s + (n - 4);
+ while (s <= smax)
+ {
+	*s = *s2; *(s + 1) = *(s2 + 1); *(s + 2) = *(s2 + 2); *(s + 3) = *(s2 + 3);
+	s += 4;
+	s2 += 4;
+ }
+ while (n2--) *s++ = *s2++;
+ return(s1);
+#endif
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slmemset.c Added

@@ -0,0 +1,53 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+/* These routines are fast memcpy, memset routines. When available, I
+ use system rouines. For msdos, I use inline assembly. */
+
+/* The current versions only work in the forward direction only!! */
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+void SLmemset(char *p, char space, int n)
+{
+#if defined(__BORLANDC__) && defined(__MSDOS__)
+ asm mov al, space
+ asm mov dx, di
+ asm mov cx, n
+ asm les di, p
+ asm cld
+ asm rep stosb
+ asm mov di, dx
+#else
+ register char *pmax;
+
+ pmax = p + (n - 4);
+ n = n % 4;
+ while (p <= pmax)
+ {
+	*p++ = space; *p++ = space; *p++ = space; *p++= space;
+ }
+ while (n--) *p++ = space;
+#endif
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slmisc.c Added

@@ -0,0 +1,894 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#ifndef _GNU_SOURCE
+# define _GNU_SOURCE
+#endif
+#include "slinclud.h"
+
+#include <limits.h>
+#include <ctype.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+#ifndef ULONG_MAX
+# define ULONG_MAX ((unsigned long)-1L)
+#endif
+
+#ifdef HAVE_LONG_LONG
+# ifndef ULLONG_MAX
+# define ULLONG_MAX ((unsigned long long)-1LL)
+# endif
+#endif
+
+char *SLmake_string (SLFUTURE_CONST char *str)
+{
+ return SLmake_nstring(str, strlen (str));
+}
+
+char *SLmake_nstring (SLFUTURE_CONST char *str, SLstrlen_Type n)
+{
+ char *ptr;
+
+ if (NULL == (ptr = (char *)SLmalloc(n + 1)))
+ {
+	return NULL;
+ }
+ SLMEMCPY (ptr, str, n);
+ ptrn = 0;
+ return(ptr);
+}
+
+void SLmake_lut (unsigned char *lut, unsigned char *range, unsigned char reverse)
+{
+ /* register unsigned char *l = lut, *lmax = lut + 256; */
+ int i, r1;
+
+ memset ((char *)lut, reverse, 256);
+ /* while (l < lmax) *l++ = reverse; */
+ reverse = !reverse;
+
+ r1 = *range++;
+ while (r1)
+ {
+	int r2 = *range++;
+	if ((r2 == '-') && (*range != 0))
+	 {
+	 r2 = *range++;
+	 for (i = r1; i <= r2; i++) luti = reverse;
+	 r1 = *range++;
+	 continue;
+	 }
+	lutr1 = reverse;
+	r1 = r2;
+ }
+}
+
+char *_pSLskip_whitespace (SLCONST char *s)
+{
+ while (isspace ((unsigned char)*s))
+ s++;
+
+ return (char *) s;
+}
+
+/*
+ * This function assumes that the initial \ char has been removed.
+ */
+char *_pSLexpand_escaped_char(char *p, char *pmax, SLwchar_Type *ch, int *isunicodep)
+{
+ int i = 0;
+ int num_digits_processed = 1;
+ SLwchar_Type max = 0;
+ SLwchar_Type num, base = 0;
+ SLwchar_Type ch1;
+ int isunicode;
+ int needs_brace;
+
+ if (p >= pmax)
+ goto malformed_error;
+
+ ch1 = *p++;
+ isunicode = 0;
+ needs_brace = 0;
+
+ switch (ch1)
+ {
+ default: num = ch1; break;
+ case 'n': num = '\n'; break;
+ case 't': num = '\t'; break;
+ case 'v': num = '\v'; break;
+ case 'b': num = '\b'; break;
+ case 'r': num = '\r'; break;
+ case 'f': num = '\f'; break;
+ case 'E': case 'e': num = 27; break;
+ case 'a': num = 7;
+	break;
+
+	/* octal */
+ case '0': case '1': case '2': case '3':
+ case '4': case '5': case '6': case '7':
+	max = '7';
+	base = 8; i = 2; num = ch1 - '0';
+	break;
+ case '8': case '9':
+	goto malformed_error;
+
+ case 'd':			 /* decimal -- S-Lang extension */
+	base = 10;
+	i = 3;
+	max = '9';
+	num = 0;
+	if (p == pmax)
+	 goto malformed_error;
+	num_digits_processed = 0;
+	break;
+
+ case 'u':
+	isunicode = 1;
+	/* drop */
+ case 'x':			 /* hex */
+	base = 16;
+	max = '9';
+	if (isunicode)
+	 i = 4;		 /* \u.... */
+	else
+	 i = 2;
+	num = 0;
+	num_digits_processed = 0;
+
+	if (p == pmax)
+	 goto malformed_error;
+
+	if (*p == '{')
+	 {
+	 p++;
+	 i = 0;
+	 while (1)
+	 {
+		 if (p + i >= pmax)
+		 goto malformed_error;
+
+		 if ((pi==0) || (pi == '}'))
+		 break;
+
+		 i++;
+	 }
+	 if (pi != '}')
+	 {
+		 _pSLang_verror (SL_SYNTAX_ERROR, "Escaped character missing closing }.");
+		 return NULL;
+	 }
+	 /* The meaning of \x{...} is mode dependent. If in UTF-8 mode, then
+	 * \x{...} always generates a unicode character. Otherwise, the
+	 * meaning of \x{...} depends upon the number of characters enclosed
+	 * by the brace. If there are less than 3, then assume no unicode.
+	 * If greater than or equal to 3, then assume unicode.
+	 */
+	 if (isunicode == 0) /* \x... */
+	 isunicode = _pSLinterp_UTF8_Mode || (i > 2);
+	 needs_brace = 1;
+	 }
+	break;
+ }
+
+ while (i && (p < pmax))
+ {
+	ch1 = *p;
+
+	i--;
+
+	if ((ch1 <= max) && (ch1 >= '0'))
+	 {
+	 num = base * num + (ch1 - '0');
+	 num_digits_processed++;
+	 }
+	else if (base == 16)
+	 {
+	 ch1 |= 0x20;
+	 if ((ch1 < 'a') || ((ch1 > 'f'))) break;
+	 num_digits_processed++;
+	 num = base * num + 10 + (ch1 - 'a');
+	 }
+	else break;
+	p++;
+ }
+
+ if (needs_brace)
+ {
+	if ((p >= pmax) || (*p != '}'))
+	 goto malformed_error;
+	p++;
+ }
+
+ if (num_digits_processed == 0)
+ {
+	_pSLang_verror (SL_SYNTAX_ERROR, "Empty \\x or \\d escape sequence seen");
+	return NULL;
+ }
+ if ((base == 10) && (num >= 256))
+ {
+	_pSLang_verror (SL_SYNTAX_ERROR, "\\d escape sequence specifies a byte value arger than 255");
+	return NULL;
+ }
+ if (isunicodep != NULL)
+ *isunicodep = isunicode;
+
+ *ch = num;
+ return p;
+
+malformed_error:
+ _pSLang_verror (SL_SYNTAX_ERROR, "Malformed escape sequence.");
+ return NULL;
+}
+
+/* s and t could represent the same space. Note: the space for s is
+ * assumed to be at least tmax-t bytes.
+ */
+int SLexpand_escaped_string (char *s, char *t, char *tmax, int utf8_encode)
+{
+ if (utf8_encode == -1)
+ utf8_encode = _pSLinterp_UTF8_Mode;
+
+ while (t < tmax)
+ {
+	SLwchar_Type wch;
+	char *s1;
+	int isunicode;
+	char ch = *t++;
+
+	if (ch != '\\')
+	 {
+	 *s++ = ch;
+	 continue;
+	 }
+
+	if (NULL == (t = _pSLexpand_escaped_char (t, tmax, &wch, &isunicode)))
+	 {
+	 *s = 0;
+	 return -1;
+	 }
+
+	/* As discussed above, the escaped representation is larger than the
+	 * encoding.
+	 */
+	if ((isunicode == 0)
+#if 0
+	 && ((wch < 127)
+		|| (utf8_encode == 0))
+#endif
+	 )
+	 {
+	 *s++ = (char) wch;
+	 continue;
+	 }
+
+	s1 = (char *)SLutf8_encode (wch, (SLuchar_Type *)s, 6);
+	if (s1 == NULL)
+	 {
+	 _pSLang_verror (SL_INVALID_UTF8, "Unable to UTF-8 encode 0x%lX\n", (unsigned long)wch);
+	 *s = 0;
+	 return -1;
+	 }
+	s = s1;
+ }
+ *s = 0;
+ return 0;
+}
+
+int SLextract_list_element (SLFUTURE_CONST char *list, unsigned int nth, char delim,
+			 char *elem, unsigned int buflen)
+{
+ char *el, *elmax;
+ char ch;
+
+ while (nth > 0)
+ {
+	while ((0 != (ch = *list)) && (ch != delim))
+	 list++;
+
+	if (ch == 0) return -1;
+
+	list++;
+	nth--;
+ }
+
+ el = elem;
+ elmax = el + (buflen - 1);
+
+ while ((0 != (ch = *list)) && (ch != delim) && (el < elmax))
+ *el++ = *list++;
+ *el = 0;
+
+ return 0;
+}
+
+int SLvsnprintf (char *buf, unsigned int buflen, SLFUTURE_CONST char *fmt, va_list ap)
+{
+#ifdef HAVE_VSNPRINTF
+ int status;
+
+ status = vsnprintf(buf, buflen, fmt, ap);
+ if ((unsigned int)status >= buflen)
+ status = -1;
+ return status;
+#else
+ unsigned int len;
+
+ /* On some systems vsprintf returns useless information. So, punt */
+ vsprintf (buf, fmt, ap);
+ len = strlen (buf);
+ if (len >= buflen)
+ {
+	SLang_exit_error ("\
+Your system lacks the vsnprintf system call and vsprintf overflowed a buffer.\n\
+The integrity of this program has been violated.\n");
+	return EOF;		 /* NOT reached */
+ }
+ return (int)len;
+#endif
+}
+
+int SLsnprintf (char *buf, unsigned int buflen, SLFUTURE_CONST char *fmt, ...)
+{
+ int status;
+ va_list ap;
+
+ va_start (ap, fmt);
+ status = SLvsnprintf (buf, buflen, fmt, ap);
+ va_end (ap);
+
+ return status;
+}
+
+int _pSLsnprintf (char *buf, unsigned int buflen, SLFUTURE_CONST char *fmt, ...)
+{
+ int status;
+ va_list ap;
+
+ va_start (ap, fmt);
+ status = SLvsnprintf (buf, buflen, fmt, ap);
+ va_end (ap);
+
+ return status;
+}
+
+typedef struct _Cleanup_Function_Type
+{
+ struct _Cleanup_Function_Type *next;
+ void (*f)(void);
+}
+Cleanup_Function_Type;
+
+static Cleanup_Function_Type *Cleanup_Function_List;
+
+static void cleanup_slang (void)
+{
+ while (Cleanup_Function_List != NULL)
+ {
+	Cleanup_Function_Type *next = Cleanup_Function_List->next;
+	(*Cleanup_Function_List->f)();
+	SLfree ((char *) Cleanup_Function_List);
+	Cleanup_Function_List = next;
+ }
+}
+
+#ifndef HAVE_ATEXIT
+# ifdef HAVE_ON_EXIT
+static void on_exit_cleanup_slang (int arg_unused)
+{
+ (void) arg_unused;
+ cleanup_slang ();
+}
+# endif
+#endif
+
+int SLang_add_cleanup_function (void (*f)(void))
+{
+ Cleanup_Function_Type *l;
+
+ l = (Cleanup_Function_Type *) SLmalloc (sizeof (Cleanup_Function_Type));
+ if (l == NULL)
+ return -1;
+
+ l->f = f;
+ l->next = Cleanup_Function_List;
+
+ if (Cleanup_Function_List == NULL)
+ {
+#ifdef HAVE_ATEXIT
+	(void) atexit (cleanup_slang);
+#else
+# ifdef HAVE_ON_EXIT
+	(void) on_exit (on_exit_cleanup_slang, 0);
+# endif
+#endif
+ }
+ Cleanup_Function_List = l;
+ return 0;
+}
+
+int SLang_guess_type (SLFUTURE_CONST char *t)
+{
+ SLCONST char *p;
+ register char ch;
+ int modifier;
+#define MODIFIER_H	0x01
+#define MODIFIER_L	0x02
+#define MODIFIER_U	0x04
+#define MODIFIER_LL	0x08
+#define MODIFIER_SIZE_MASK 0x0F
+#define MODIFIER_HEX	0x10
+#define MODIFIER_BINARY	0x20
+
+ modifier = 0;
+ if ((*t == '-') || (*t == '+')) t++;
+ p = t;
+
+#if SLANG_HAS_FLOAT
+ if (*p != '.')
+ {
+#endif
+	while ((*p >= '0') && (*p <= '9')) p++;
+	if (t == p) return (SLANG_STRING_TYPE);
+	if (p == t + 1)
+	 {
+	 if (*p == 'x')
+	 {
+		 modifier |= MODIFIER_HEX;
+		 p++;
+		 while (ch = *p,
+			 ((ch >= '0') && (ch <= '9'))
+			 || (((ch | 0x20) >= 'a') && ((ch | 0x20) <= 'f'))) p++;
+	 }
+	 else if (*p == 'b')
+	 {
+		 modifier |= MODIFIER_BINARY;
+		 p++;
+		 while ((*p == '0') || (*p == '1'))
+		 p++;
+	 }
+	 }
+
+	/* Now look for U, H, L, LL, UH, UL, ULL, modifiers */
+	ch = *p | 0x20;
+	if (ch == 'u')
+	 {
+	 modifier |= MODIFIER_U;
+	 p++;
+	 ch = *p | 0x20;
+	 }
+	if (ch == 'h')
+	 {
+	 modifier |= MODIFIER_H;
+	 p++;
+	 ch = *p | 0x20;
+	 }
+	else if (ch == 'l')
+	 {
+	 p++;
+	 ch = *p | 0x20;
+	 if (ch == 'l')
+	 {
+		 modifier |= MODIFIER_LL;
+		 p++;
+		 ch = *p | 0x20;
+	 }
+	 else
+	 modifier |= MODIFIER_L;
+	 }
+	if ((ch == 'u') && (0 == (modifier & MODIFIER_U)))
+	 {
+	 modifier |= MODIFIER_U;
+	 p++;
+	 }
+
+	if (*p == 0) switch (modifier & MODIFIER_SIZE_MASK)
+	 {
+	 case 0:
+	 return SLANG_INT_TYPE;
+	 case MODIFIER_H:
+	 return SLANG_SHORT_TYPE;
+	 case MODIFIER_L:
+	 return SLANG_LONG_TYPE;
+	 case MODIFIER_U:
+	 return SLANG_UINT_TYPE;
+	 case MODIFIER_U|MODIFIER_H:
+	 return SLANG_USHORT_TYPE;
+	 case MODIFIER_U|MODIFIER_L:
+	 return SLANG_ULONG_TYPE;
+	 case MODIFIER_LL:
+	 return SLANG_LLONG_TYPE;
+	 case MODIFIER_U|MODIFIER_LL:
+	 return SLANG_ULLONG_TYPE;
+	 default:
+	 return SLANG_STRING_TYPE;
+	 }
+
+	if (modifier)
+	 return SLANG_STRING_TYPE;
+#if SLANG_HAS_FLOAT
+ }
+
+ /* now down to double case */
+ if (*p == '.')
+ {
+	p++;
+	while ((*p >= '0') && (*p <= '9')) p++;
+ }
+ if (*p == 0) return(SLANG_DOUBLE_TYPE);
+ if ((*p != 'e') && (*p != 'E'))
+ {
+# if SLANG_HAS_COMPLEX
+	if (((*p == 'i') || (*p == 'j'))
+	 && (p1 == 0))
+	 return SLANG_COMPLEX_TYPE;
+# endif
+	if (((*p | 0x20) == 'f') && (p1 == 0))
+	 return SLANG_FLOAT_TYPE;
+
+	return SLANG_STRING_TYPE;
+ }
+
+ p++;
+ if ((*p == '-') || (*p == '+')) p++;
+ while ((*p >= '0') && (*p <= '9')) p++;
+ if (*p != 0)
+ {
+# if SLANG_HAS_COMPLEX
+	if (((*p == 'i') || (*p == 'j'))
+	 && (p1 == 0))
+	 return SLANG_COMPLEX_TYPE;
+# endif
+	if (((*p | 0x20) == 'f') && (p1 == 0))
+	 return SLANG_FLOAT_TYPE;
+
+	return SLANG_STRING_TYPE;
+ }
+ return SLANG_DOUBLE_TYPE;
+#else
+ return SLANG_STRING_TYPE;
+#endif				 /* SLANG_HAS_FLOAT */
+}
+
+static int hex_atoul (unsigned char *s, unsigned long *ul)
+{
+ unsigned char ch;
+ unsigned long value;
+ int base;
+ unsigned int num_processed;
+ unsigned long max_value_before_overflow;
+ unsigned long max_ch1_before_overflow;
+
+ num_processed = 0;
+ if (*s != '0')
+ base = 10;
+ else
+ {
+	s++;				 /* skip the leading 0 */
+
+	/* look for 'x' which indicates hex */
+	if ((*s | 0x20) == 'x')
+	 {
+	 base = 16;
+	 s++;
+	 if (*s == 0)
+	 {
+		 SLang_set_error (SL_SYNTAX_ERROR);
+		 return -1;
+	 }
+	 }
+	else if ((*s | 0x20) == 'b')
+	 {
+	 base = 2;
+	 s++;
+	 if (*s == 0)
+	 {
+		 SLang_set_error (SL_SYNTAX_ERROR);
+		 return -1;
+	 }
+	 }
+	else
+	 {
+	 base = 8;
+	 num_processed++;
+	 }
+ }
+
+ max_value_before_overflow = ULONG_MAX/base;
+ max_ch1_before_overflow = ULONG_MAX - (base*max_value_before_overflow);
+ value = 0;
+ while ((ch = *s++) != 0)
+ {
+	char ch1 = ch | 0x20;
+	switch (ch1)
+	 {
+	 default:
+	 SLang_set_error (SL_SYNTAX_ERROR);
+	 return -1;
+
+	 case 'u':
+	 case 'l':
+	 case 'h':
+	 if (num_processed == 0)
+	 {
+		 SLang_set_error (SL_SYNTAX_ERROR);
+		 return -1;
+	 }
+	 *ul = value;
+	 return 0;
+
+	 case '9':
+	 case '8':
+	 if (base <= 8)
+	 {
+		 _pSLang_verror (SL_SYNTAX_ERROR, "8 or 9 are not permitted in binary or octal numbers");
+		 return -1;
+	 }
+	 /* drop */
+	 case '7':
+	 case '6':
+	 case '5':
+	 case '4':
+	 case '3':
+	 case '2':
+	 if (base <= 2)
+	 {
+		 _pSLang_verror (SL_SYNTAX_ERROR, "Only digits 0 and 1 are permitted in binary numbers");
+		 return -1;
+	 }
+	 case '1':
+	 case '0':
+	 ch1 -= '0';
+	 break;
+
+	 case 'a':
+	 case 'b':
+	 case 'c':
+	 case 'd':
+	 case 'e':
+	 case 'f':
+	 if (base != 16)
+	 {
+		 _pSLang_verror (SL_SYNTAX_ERROR, "Only digits may appear in a binary, octal, or decimal number");
+		 return -1;
+	 }
+	 ch1 = (ch1 - 'a') + 10;
+	 break;
+	 }
+	num_processed++;
+
+	if ((value < max_value_before_overflow)
+	 || ((value == max_value_before_overflow)
+		&& ((unsigned long)ch1 <= max_ch1_before_overflow)))
+	 {
+	 value = value * base + (unsigned long)ch1;
+	 continue;
+	 }
+
+	_pSLang_verror (SL_SYNTAX_ERROR, "Integer overflow detected: too many digits");
+	return -1;
+ }
+ *ul = value;
+ return 0;
+}
+
+#ifdef HAVE_LONG_LONG
+static int hex_atoull (unsigned char *s, unsigned long long *ul)
+{
+ unsigned char ch;
+ unsigned long long value;
+ unsigned long long max_value_before_overflow, max_ch1_before_overflow;
+ int base;
+
+ if (*s != '0')
+ base = 10;
+ else
+ {
+	s++;				 /* skip the leading 0 */
+
+	/* look for 'x' which indicates hex */
+	if ((*s | 0x20) == 'x')
+	 {
+	 base = 16;
+	 s++;
+	 if (*s == 0)
+	 {
+		 SLang_set_error (SL_SYNTAX_ERROR);
+		 return -1;
+	 }
+	 }
+	else if ((*s | 0x20) == 'b')
+	 {
+	 base = 2;
+	 s++;
+	 if (*s == 0)
+	 {
+		 SLang_set_error (SL_SYNTAX_ERROR);
+		 return -1;
+	 }
+	 }
+	else base = 8;
+ }
+
+ value = 0;
+ max_value_before_overflow = ULLONG_MAX/base;
+ max_ch1_before_overflow = ULLONG_MAX - base*max_value_before_overflow;
+
+ while ((ch = *s++) != 0)
+ {
+	char ch1 = ch | 0x20;
+
+	switch (ch1)
+	 {
+	 default:
+	 SLang_set_error (SL_SYNTAX_ERROR);
+	 return -1;
+
+	 case 'u':
+	 case 'l':
+	 *ul = value;
+	 return 0;
+
+	 case '9':
+	 case '8':
+	 if (base <= 8)
+	 {
+		 _pSLang_verror (SL_SYNTAX_ERROR, "8 or 9 are not permitted in binary or octal numbers");
+		 return -1;
+	 }
+	 /* drop */
+	 case '7':
+	 case '6':
+	 case '5':
+	 case '4':
+	 case '3':
+	 case '2':
+	 if (base <= 2)
+	 {
+		 _pSLang_verror (SL_SYNTAX_ERROR, "Only digits 0 and 1 are permitted in binary numbers");
+		 return -1;
+	 }
+	 case '1':
+	 case '0':
+	 ch1 -= '0';
+	 break;
+
+	 case 'a':
+	 case 'b':
+	 case 'c':
+	 case 'd':
+	 case 'e':
+	 case 'f':
+	 if (base != 16)
+	 {
+		 _pSLang_verror (SL_SYNTAX_ERROR, "Only digits may appear in a binary, octal, or decimal number");
+		 return -1;
+	 }
+	 ch1 = (ch1 - 'a') + 10;
+	 break;
+	 }
+
+	if ((value < max_value_before_overflow)
+	 || ((value == max_value_before_overflow)
+		&& ((unsigned long long)ch1 <= max_ch1_before_overflow)))
+	 {
+	 value = value * base + (unsigned long long)ch1;
+	 continue;
+	 }
+	_pSLang_verror (SL_SYNTAX_ERROR, "Integer overflow detected: too many digits");
+	return -1;
+ }
+ *ul = value;
+ return 0;
+}
+#endif				 /* HAVE_LONG_LONG */
+
+/* Note: These routines do not check integer overflow. I would use the C
+ * library functions atol and atoul but some implementations check overflow
+ * and some do not. The following implementations provide a consistent
+ * behavior.
+ */
+static unsigned char *get_sign (SLCONST unsigned char *s, int *signp)
+{
+ s = (unsigned char *) _pSLskip_whitespace ((char *)s);
+
+ if (*s == '-')
+ {
+	*signp = -1;
+	s++;
+ }
+ else
+ {
+	*signp = 1;
+	if (*s == '+') s++;
+ }
+ return (unsigned char *) s;
+}
+
+unsigned long SLatoul (unsigned char *s)
+{
+ int sign;
+ unsigned long value;
+
+ s = get_sign (s, &sign);
+ if (-1 == hex_atoul (s, &value))
+ return (unsigned long) -1;
+
+ if (sign == -1)
+ value = (unsigned long)-1L * value;
+
+ return value;
+}
+
+long SLatol (unsigned char *s)
+{
+ int sign;
+ unsigned long value;
+
+ s = get_sign (s, &sign);
+ if (-1 == hex_atoul (s, &value))
+ return -1L;
+
+ if (sign == -1)
+ return (long)(-1L * value);
+
+ return (long) value;
+}
+
+int SLatoi (unsigned char *s)
+{
+ return (int) SLatol (s);
+}
+
+#ifdef HAVE_LONG_LONG
+long long SLatoll (unsigned char *s)
+{
+ int sign;
+ unsigned long long value;
+
+ s = get_sign (s, &sign);
+ if (-1 == hex_atoull (s, &value))
+ return -1LL;
+
+ if (sign == -1)
+ return (long long)(-1LL * value);
+
+ return (long long) value;
+}
+
+unsigned long long SLatoull (unsigned char *s)
+{
+ int sign;
+ unsigned long long value;
+
+ s = get_sign (s, &sign);
+ if (-1 == hex_atoull (s, &value))
+ return (unsigned long long) -1;
+
+ if (sign == -1)
+ return (unsigned long long)(-1LL * value);
+
+ return value;
+}
+
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/slnspace.c Added

@@ -0,0 +1,564 @@
+/* -*- mode: C; mode: fold; -*- */
+/* slnspace.c --- Name Space implementation */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+#define MAP_HASH_TO_NS_INDEX(hash,ns) (unsigned int) ((hash) % (ns->table_size))
+
+static SLang_NameSpace_Type *Namespace_Tables;
+
+SLang_NameSpace_Type *_pSLns_find_namespace (SLCONST char *name)
+{
+ SLang_NameSpace_Type *table_list;
+
+ table_list = Namespace_Tables;
+ while (table_list != NULL)
+ {
+	if ((table_list->namespace_name != NULL)
+	 && (0 == strcmp (table_list->namespace_name, name)))
+	 break;
+	table_list = table_list->next;
+ }
+ return table_list;
+}
+
+/* This function deletes the namespace. It is up to the caller to ensure that
+ * the table has already been removed from the list.
+ */
+void _pSLns_deallocate_namespace (SLang_NameSpace_Type *ns)
+{
+ SLang_Name_Type **table;
+ unsigned int table_size;
+ unsigned int i;
+
+ if (ns == NULL)
+ return;
+
+ table = ns->table;
+ table_size = ns->table_size;
+
+ for (i = 0; i < table_size; i++)
+ {
+	SLang_Name_Type *t = table i;
+ 	while (t != NULL)
+	 {
+	 SLang_Name_Type *t1 = t->next;
+	 SLang_free_slstring ((char *) t->name);
+	 SLfree ((char *) t);
+	 t = t1;
+	 }
+ }
+ SLang_free_slstring ((char *) ns->name);
+ SLang_free_slstring ((char *) ns->namespace_name);
+ SLang_free_slstring ((char *) ns->private_name);
+ SLfree ((char *)table);
+ SLfree ((char *) ns);
+}
+
+/* This function does not insert the namespace into the list */
+SLang_NameSpace_Type *_pSLns_allocate_namespace (SLFUTURE_CONST char *name, unsigned int size)
+{
+ SLang_Name_Type **nt;
+ SLang_NameSpace_Type *ns;
+
+ if (NULL == (name = SLang_create_slstring (name)))
+ return NULL;
+
+ if (NULL == (ns = (SLang_NameSpace_Type *)
+		SLcalloc (sizeof (SLang_NameSpace_Type), 1)))
+ {
+	SLang_free_slstring ((char *) name);
+	return NULL;
+ }
+
+ if (NULL == (nt = (SLang_Name_Type **) SLcalloc (sizeof (SLang_Name_Type *), size)))
+ {
+	SLang_free_slstring ((char *) name);
+	SLfree ((char *)ns);
+	return NULL;
+ }
+
+ ns->name = name;
+ ns->table = nt;
+ ns->table_size = size;
+
+ return ns;
+}
+
+/* allocate a namespace and add it to the internal list */
+SLang_NameSpace_Type *_pSLns_new_namespace (SLFUTURE_CONST char *name, unsigned int size)
+{
+ SLang_NameSpace_Type *table_list;
+ static int num;
+ char namebuf64;
+
+ if (name == NULL)
+ {
+	sprintf (namebuf, " *** internal ns <%d> *** ", num);
+	name = namebuf;
+	num++;
+ }
+
+ if (NULL == (table_list = _pSLns_allocate_namespace (name, size)))
+ return NULL;
+
+ table_list->next = Namespace_Tables;
+ Namespace_Tables = table_list;
+
+ return table_list;
+}
+
+/* Find the private namespace associated with the object (file, etc) given by
+ * `name', and whose private namespace is given by `namespace_name'. If
+ * `namespace_name' is NULL, then it is anonymous.
+ */
+SLang_NameSpace_Type *_pSLns_get_private_namespace (SLFUTURE_CONST char *name, SLFUTURE_CONST char *namespace_name)
+{
+ SLang_NameSpace_Type *ns;
+
+ if ((namespace_name != NULL)
+ && (*namespace_name == 0))
+ namespace_name = NULL;
+
+ ns = Namespace_Tables;
+ while (ns != NULL)
+ {
+	if ((ns->namespace_name != NULL) /* a static namespace */
+	 || (0 != strcmp (ns->name, name)))
+	 {
+	 ns = ns->next;
+	 continue;
+	 }
+
+	/* at this point, the namespace is anonymous and is associated with
+	 * the correct file (given by name).
+	 */
+	if (ns->private_name == NULL)
+	 {
+	 if (namespace_name == NULL)
+	 return ns;
+
+	 ns = ns->next;
+	 continue;
+	 }
+
+	if ((namespace_name != NULL)
+	 && (0 == strcmp (ns->private_name, namespace_name)))
+	 return ns;
+
+	ns = ns->next;
+ }
+
+ if (NULL == (ns = _pSLns_new_namespace (name, SLSTATIC_HASH_TABLE_SIZE)))
+ return ns;
+
+ if (namespace_name == NULL)
+ return ns;
+
+ if (NULL == (namespace_name = SLang_create_slstring (namespace_name)))
+ {
+	SLns_delete_namespace (ns);
+	return NULL;
+ }
+ ns->private_name = namespace_name;
+ return ns;
+}
+
+int _pSLns_set_namespace_name (SLang_NameSpace_Type *t, SLFUTURE_CONST char *name)
+{
+ SLang_NameSpace_Type *t1;
+
+ t1 = _pSLns_find_namespace (name);
+ if (t == t1)
+ return 0;			 /* already has this name */
+
+ if (t1 == NULL)
+ t1 = t;
+
+ if ((t != t1) || (*name == 0))
+ {
+	_pSLang_verror (SL_Namespace_Error, "Namespace \"%s\" already exists",
+		 name);
+	return -1;
+ }
+
+ if (t->namespace_name != NULL)
+ {
+	_pSLang_verror (SL_Namespace_Error, "An attempt was made to redefine namespace from \"%s\" to \"%s\"\n",
+		 t->namespace_name, name);
+	return -1;
+ }
+
+ if (NULL == (name = SLang_create_slstring (name)))
+ return -1;
+
+ SLang_free_slstring ((char *) t->namespace_name); /* NULL ok */
+ t->namespace_name = name;
+
+ return 0;
+}
+
+SLang_Array_Type *_pSLnspace_apropos (SLang_NameSpace_Type *ns, SLFUTURE_CONST char *pat, unsigned int what)
+{
+ SLang_Array_Type *at;
+ unsigned int table_size;
+ SLang_Name_Type *t, **table;
+ SLindex_Type num_matches;
+ unsigned int i;
+ SLRegexp_Type *reg;
+ unsigned int two;
+
+ at = NULL;
+
+ if ((ns == NULL)
+ || ((table = ns->table) == NULL))
+ return NULL;
+
+ if (NULL == (reg = SLregexp_compile (pat, 0)))
+ {
+	_pSLang_verror (SL_Parse_Error, "Invalid regular expression: %s", pat);
+	return NULL;
+ }
+
+ table_size = ns->table_size;
+
+ two = 2;
+ while (two != 0)
+ {
+	two--;
+
+	num_matches = 0;
+	for (i = 0; i < table_size; i++)
+	 {
+	 t = tablei;
+	 while (t != NULL)
+	 {
+		 unsigned int flags;
+		 SLFUTURE_CONST char *name = t->name;
+
+		 switch (t->name_type)
+		 {
+		 case SLANG_GVARIABLE:
+		 flags = 8;
+		 break;
+
+		 case SLANG_ICONSTANT:
+		 case SLANG_DCONSTANT:
+		 case SLANG_FCONSTANT:
+		 case SLANG_LLCONSTANT:
+		 case SLANG_HCONSTANT:
+		 case SLANG_LCONSTANT:
+		 case SLANG_RVARIABLE:
+		 case SLANG_IVARIABLE:
+		 flags = 4;
+		 break;
+
+		 case SLANG_INTRINSIC:
+		 case SLANG_MATH_UNARY:
+		 case SLANG_APP_UNARY:
+		 case SLANG_ARITH_UNARY:
+		 case SLANG_ARITH_BINARY:
+		 flags = 1;
+		 break;
+
+		 case SLANG_FUNCTION:
+		 flags = 2;
+		 break;
+
+		 default:
+		 flags = 0;
+		 break;
+		 }
+
+		 if ((flags & what)
+		 && (NULL != SLregexp_match (reg, name, strlen (name))))
+		 {
+		 if (at != NULL)
+			 {
+			 if (-1 == SLang_set_array_element (at, &num_matches, (VOID_STAR)&name))
+			 goto return_error;
+			 }
+		 num_matches++;
+		 }
+		 t = t->next;
+	 }
+	 }
+
+	if (at == NULL)
+	 {
+	 at = SLang_create_array (SLANG_STRING_TYPE, 0, NULL, &num_matches, 1);
+	 if (at == NULL)
+	 goto return_error;
+	 }
+ }
+
+ if (reg != NULL)
+ SLregexp_free (reg);
+ return at;
+
+ return_error:
+ SLregexp_free (reg);
+ SLang_free_array (at);
+ return NULL;
+}
+
+SLang_NameSpace_Type *_pSLns_create_namespace2 (SLFUTURE_CONST char *name, SLFUTURE_CONST char *namespace_name)
+{
+ SLang_NameSpace_Type *ns;
+
+ if (namespace_name == NULL)
+ namespace_name = "Global";
+
+ ns = _pSLns_find_namespace (namespace_name);
+ if (ns != NULL)
+ return ns;
+
+ if (NULL == (ns = _pSLns_new_namespace (name, SLSTATIC_HASH_TABLE_SIZE)))
+ return NULL;
+
+ if (-1 == _pSLns_set_namespace_name (ns, namespace_name))
+ {
+	SLns_delete_namespace (ns);
+	return NULL;
+ }
+
+ return ns;
+}
+
+int _pSLns_check_name (SLFUTURE_CONST char *namespace_name)
+{
+ if ((namespace_name == NULL) || (*namespace_name == 0))
+ return 0;
+
+ return _pSLcheck_identifier_syntax (namespace_name);
+}
+
+SLang_NameSpace_Type *SLns_create_namespace (SLFUTURE_CONST char *namespace_name)
+{
+ if (-1 == _pSLns_check_name (namespace_name))
+ return NULL;
+
+ return _pSLns_create_namespace2 (NULL, namespace_name);
+}
+
+void SLns_delete_namespace (SLang_NameSpace_Type *ns)
+{
+ if (ns == NULL)
+ return;
+
+ if (ns == Namespace_Tables)
+ Namespace_Tables = ns->next;
+ else
+ {
+	SLang_NameSpace_Type *prev = Namespace_Tables;
+	while (prev != NULL)
+	 {
+	 if (prev->next != ns)
+	 {
+		 prev = prev->next;
+		 continue;
+	 }
+	 prev->next = ns->next;
+	 break;
+	 }
+ }
+ _pSLns_deallocate_namespace (ns);
+}
+
+SLang_Array_Type *_pSLns_list_namespaces (void)
+{
+ SLang_NameSpace_Type *table_list;
+ SLang_Array_Type *at;
+ SLindex_Type num, i;
+
+ num = 0;
+ table_list = Namespace_Tables;
+ while (table_list != NULL)
+ {
+	if (table_list->namespace_name != NULL)
+	 num++;
+	table_list = table_list->next;
+ }
+ at = SLang_create_array (SLANG_STRING_TYPE, 0, NULL, &num, 1);
+ if (at == NULL)
+ return NULL;
+
+ table_list = Namespace_Tables;
+ i = 0;
+ while ((table_list != NULL)
+	 && (i < num))
+ {
+	if (table_list->namespace_name != NULL)
+	 {
+	 SLCONST char *name = table_list->namespace_name;
+	 if (-1 == SLang_set_array_element (at, &i, (VOID_STAR)&name))
+	 {
+		 SLang_free_array (at);
+		 return NULL;
+	 }
+	 i++;
+	 }
+	table_list = table_list->next;
+ }
+ return at;
+}
+
+SLang_Name_Type *
+ _pSLns_locate_hashed_name (SLang_NameSpace_Type *ns, SLCONST char *name, unsigned long hash)
+{
+ SLang_Name_Type *t;
+ char ch;
+
+ t = ns->table MAP_HASH_TO_NS_INDEX(hash,ns);
+ ch = *name++;
+
+ while (t != NULL)
+ {
+	if ((ch == t->name0)
+	 && (0 == strcmp (t->name + 1, name)))
+	 break;
+
+	t = t->next;
+ }
+
+ return t;
+}
+
+/* It is up to the caller to make sure that the name is not already in the table */
+int _pSLns_add_hashed_name (SLang_NameSpace_Type *ns, SLang_Name_Type *nt, unsigned long hash)
+{
+ hash = MAP_HASH_TO_NS_INDEX(hash,ns);
+ nt->next = ns->table (unsigned int)hash;
+ ns->table (unsigned int) hash = nt;
+
+ return 0;
+}
+
+SLang_NameSpace_Type *_pSLns_find_object_namespace (SLang_Name_Type *nt)
+{
+ SLang_NameSpace_Type *ns;
+ SLCONST char *name;
+ unsigned long hash;
+
+ if (nt == NULL)
+ return NULL;
+
+ name = nt->name;
+ hash = SLcompute_string_hash (name);
+
+ ns = Namespace_Tables;
+ while (ns != NULL)
+ {
+	SLang_Name_Type *t = ns->table MAP_HASH_TO_NS_INDEX(hash,ns);
+	while (t != NULL)
+	 {
+	 if (t == nt)
+	 return ns;
+
+	 t = t->next;
+	 }
+	ns = ns->next;
+ }
+
+ return NULL;
+}
+
+SLang_Name_Type *_pSLns_locate_name (SLang_NameSpace_Type *ns, SLCONST char *name)
+{
+ return _pSLns_locate_hashed_name (ns, name, SLcompute_string_hash (name));
+}
+
+static void delete_namespace_objects (SLang_NameSpace_Type *ns)
+{
+ SLang_Name_Type **table = ns->table;
+ unsigned int i, table_size = ns->table_size;
+
+ for (i = 0; i < table_size; i++)
+ {
+	SLang_Name_Type *t = tablei;
+	while (t != NULL)
+	 {
+	 SLang_Name_Type *t1 = t->next;
+	 switch (t->name_type)
+	 {
+		case SLANG_PVARIABLE:
+		case SLANG_GVARIABLE:
+		 SLang_free_object (&((SLang_Global_Var_Type *)t)->obj);
+		 break;
+
+		case SLANG_PFUNCTION:
+		case SLANG_FUNCTION:
+		 SLang_free_function (t);
+		 break;
+
+		case SLANG_ICONSTANT:
+		case SLANG_DCONSTANT:
+		case SLANG_FCONSTANT:
+		case SLANG_LLCONSTANT:
+		case SLANG_HCONSTANT:
+		case SLANG_LCONSTANT:
+		case SLANG_RVARIABLE:
+		case SLANG_IVARIABLE:
+		case SLANG_INTRINSIC:
+		case SLANG_MATH_UNARY:
+		case SLANG_APP_UNARY:
+		case SLANG_ARITH_UNARY:
+		case SLANG_ARITH_BINARY:
+		default:
+		 break;
+	 }
+	 SLang_free_slstring (t->name);
+	 t = t1;
+	 }
+ }
+}
+
+/* This is only called at exit. Until version 3, I cannot delete everything
+ * since the namespace contains a mixture of statically allocated table
+ * and dynamically allocated ones. The only way to tell the difference is
+ * to change the API by adding an additional field to SLang_Name_Type object.
+ * So, here I delete what I can safely do, but to avoid leak checkers complaining
+ * about false leaks, the Namespace_Tables pointer will be left as is.
+ */
+void _pSLns_delete_namespaces (void)
+{
+ SLang_NameSpace_Type *ns;
+
+ ns = Namespace_Tables;
+ while (ns != NULL)
+ {
+	SLang_NameSpace_Type *next = ns->next;
+	delete_namespace_objects (ns);
+	SLang_free_slstring ((char *) ns->name);
+	SLang_free_slstring ((char *) ns->namespace_name);
+	SLang_free_slstring ((char *) ns->private_name);
+	/* SLfree ((char *)ns->table); v3*/
+	/* SLfree ((char *) ns); v3 */
+	ns = next;
+ }
+ /* Namespace_Tables = NULL; v3 */
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slos2tty.c Added

@@ -0,0 +1,306 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+#define INCL_BASE
+#define INCL_NOPM
+#define INCL_VIO
+#define INCL_KBD
+#define INCL_DOS
+#if 0
+# define INCL_DOSSEMAPHORES
+#endif
+#ifdef LONG
+#undef LONG
+#endif
+#ifdef VOID
+#undef VOID
+#endif
+#include <os2.h>
+
+#include <signal.h>
+#include <process.h>
+
+static TID SLos2_threadID = (TID) 0;
+
+KBDINFO	initialKbdInfo;	/* keyboard info */
+
+/* Code to read keystrokes in a separate thread */
+
+typedef struct kbdcodes {
+ UCHAR ascii;
+ UCHAR scan;
+/* USHORT shift; */
+} KBDCODES;
+
+#define BUFFER_LEN 4096
+static KBDCODES threadKeysBUFFER_LEN;
+static int atEnd = 0;
+static int startBuf;
+static int endBuf;
+
+/* Original code used semaphores to control access to threadKeys.
+ * It is expected that the semaphore code will be deleted after 0.97.
+*/
+#if 0
+
+#ifdef __os2_16__
+
+typedef USHORT APIRET;
+static HSEM Hmtx;
+
+#define DosRequestMutexSem(hmtx,timeout) DosSemRequest(hmtx,timeout)
+#define DosReleaseMutexSem(hmtx) DosSemClear(hmtx)
+#define DosCloseMutexSem(hmtx) DosCloseSem(hmtx)
+
+#else /* !defined(__os2_16__) */
+
+static HMTX Hmtx; /* Mutex Semaphore */
+
+#endif
+
+static APIRET CreateSem(void)
+{
+#ifdef __os2_16__
+ char SemName32;
+ sprintf(SemName, "\\SEM\\jed\\%u", getpid());
+ return ( DosCreateSem (0, &Hmtx, SemName) );
+#else
+ return ( DosCreateMutexSem (NULL, &Hmtx, 0, 0) );
+#endif
+}
+
+static APIRET RequestSem(void)
+{
+ return ( DosRequestMutexSem (Hmtx, -1) );
+}
+
+static APIRET ReleaseSem(void)
+{
+ return ( DosReleaseMutexSem (Hmtx) );
+}
+
+static APIRET CloseSem(void)
+{
+ return( DosCloseMutexSem (Hmtx) );
+}
+
+#else
+
+#define CreateSem()
+#define RequestSem()
+#define ReleaseSem()
+#define CloseSem()
+
+#endif
+
+static void set_kbd(void)
+{
+ KBDINFO kbdInfo;
+
+ kbdInfo = initialKbdInfo;
+ kbdInfo.fsMask &= ~0x0001;		/* not echo on		*/
+ kbdInfo.fsMask |= 0x0002;		/* echo off		*/
+ kbdInfo.fsMask &= ~0x0008;		/* cooked mode off	*/
+ kbdInfo.fsMask |= 0x0004;		/* raw mode		*/
+ kbdInfo.fsMask &= ~0x0100;		/* shift report	off	*/
+ KbdSetStatus(&kbdInfo, 0);
+}
+
+static void thread_getkey ()
+{
+ KBDKEYINFO keyInfo;
+ int n;
+
+ while (!atEnd) { /* at end is a flag */
+ set_kbd();
+ KbdCharIn(&keyInfo, IO_NOWAIT, 0); /* get a character	*/
+ if (keyInfo.fbStatus & 0x040) { /* found a char process it */
+	if (keyInfo.chChar == SLang_Abort_Char) {
+	 if (SLang_Ignore_User_Abort == 0) SLang_set_error (SL_USER_BREAK);
+	 SLKeyBoard_Quit = 1;
+	}
+	n = (endBuf + 1) % BUFFER_LEN;
+	if (n == startBuf) {
+	 DosBeep (500, 20);
+	 KbdFlushBuffer(0);
+	 continue;
+	}
+	RequestSem();
+	threadKeys n.ascii = keyInfo.chChar;
+	threadKeys n.scan = keyInfo.chScan;
+/*	threadKeys n.shift = keyInfo.fsState; */
+	endBuf = n;
+	ReleaseSem();
+ } else /* no char available*/
+	DosSleep (20);
+ }
+}
+
+static void thread_code (void *Args)
+{
+ (void) Args;
+ startBuf = -1; /* initialize the buffer pointers */
+ endBuf = -1;
+ thread_getkey ();
+ atEnd = 0; /* reset the flag */
+ _endthread();
+}
+
+/* The code below is in the main thread */
+
+int SLang_init_tty(int abort_char, int dum2, int dum3)
+{
+ VIOCURSORINFO cursorInfo, OldcursorInfo;
+
+ (void) dum2; (void) dum3;
+ if (abort_char == -1) abort_char = 3; /* ^C */
+ SLang_Abort_Char = abort_char;
+ SLKeyBoard_Quit = 0;
+
+ /* set ^C off */
+ signal (SIGINT, SIG_IGN);
+ signal (SIGBREAK, SIG_IGN);
+
+ /* set up the keyboard */
+
+ initialKbdInfo.cb = sizeof(initialKbdInfo);
+ KbdGetStatus(&initialKbdInfo, 0);
+ set_kbd();
+
+ /* open a semaphore */
+ CreateSem();
+
+ /* start a separate thread to read the keyboard */
+#if defined(__BORLANDC__)
+ SLos2_threadID = _beginthread (thread_code, 8096, NULL);
+#else
+ SLos2_threadID = _beginthread (thread_code, NULL, 8096, NULL);
+#endif
+
+ if ((int)SLos2_threadID == -1)
+ {
+	SLang_exit_error ("init_tty: Error starting keyboard thread.");
+ }
+
+ VioGetCurType (&OldcursorInfo, 0);
+ cursorInfo.yStart = 1;
+ cursorInfo.cEnd = 15;
+ cursorInfo.cx = 1;
+ cursorInfo.attr = 1;
+ if (VioSetCurType (&cursorInfo, 0))
+ VioSetCurType (&OldcursorInfo, 0); /* reset to previous value */
+
+ return 0;
+}
+
+void SLang_reset_tty (void)
+{
+ if (0 == SLos2_threadID) return;
+ atEnd = 1; /* set flag and wait until thread ends */
+ while (atEnd) {DosSleep (0);}
+
+ CloseSem();
+
+ /* close the keyboard */
+ KbdSetStatus(&initialKbdInfo, 0); /* restore original state	*/
+ SLos2_threadID = 0;
+}
+
+#define keyWaiting() (endBuf != startBuf)
+
+/* sleep for *tsecs tenths of a sec waiting for input */
+
+int _pSLsys_input_pending(int tsecs)
+{
+ if (keyWaiting()) return 1;
+
+ /* Convert tsecs to units of 20 ms */
+ tsecs = tsecs * 5;
+
+ /* If tsecs is less than 0, it represents millisecs */
+ if (tsecs < 0)
+ tsecs = -tsecs / 100;
+
+ while (tsecs > 0)
+ {
+	DosSleep(20);		 /* 20 ms or 1/50 sec */
+	if (keyWaiting()) break;
+	tsecs--;
+ }
+ return (tsecs);
+}
+
+unsigned int _pSLsys_getkey ()
+{
+ unsigned int c;
+ unsigned char scan;
+
+
+ if (!keyWaiting())
+ {
+	int tsecs = 300;
+	while (!_pSLsys_input_pending(tsecs))
+	 ;
+ }
+
+ /* read codes from buffer */
+ RequestSem();
+ startBuf = (startBuf + 1) % BUFFER_LEN;
+ c = threadKeys startBuf.ascii;
+ scan = threadKeys startBuf.scan;
+ ReleaseSem();
+
+ switch (c)
+ {
+ case 8:
+	if (scan == 0x0E) c = 127;
+	break;
+
+ case 0xE0:
+ case 0:
+	c = _pSLpc_convert_scancode (scan, 0, 1);
+	break;
+
+ default:
+	break;
+ }
+ return (c);
+}
+
+int SLang_set_abort_signal (void (*dum)(int))
+{
+ (void) dum;
+ return 0;
+}
+
+int SLtt_set_mouse_mode (int mode, int force)
+{
+ /* FIXME: Priority=low */
+ (void) mode;
+ (void) force;
+
+ return -1;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slospath.c Added

@@ -0,0 +1,256 @@
+/* Pathname intrinsic functions */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+#ifdef VMS
+# include <stat.h>
+#else
+# include <sys/stat.h>
+#endif
+
+static void path_concat (char *a, char *b)
+{
+ SLang_push_malloced_string (SLpath_dircat (a,b));
+}
+
+static void path_extname (char *path)
+{
+#ifdef VMS
+ char *p;
+#endif
+
+ path = SLpath_extname (path);
+#ifndef VMS
+ SLang_push_string (path);
+#else
+ p = strchr (path, ';');
+ if (p == NULL)
+ (void)SLang_push_string (p);
+ else
+ (void)SLang_push_malloced_string (SLmake_nstring (path, (unsigned int)(p - path)));
+#endif
+}
+
+static void path_basename (char *path)
+{
+ (void) SLang_push_string (SLpath_basename (path));
+}
+
+static void path_dirname (char *path)
+{
+ (void) SLang_push_malloced_string (SLpath_dirname (path));
+}
+
+static void path_sans_extname (char *path)
+{
+ (void) SLang_push_malloced_string (SLpath_pathname_sans_extname (path));
+}
+
+static void path_basename_sans_extname (char *path)
+{
+ if (NULL == (path = SLpath_pathname_sans_extname (path)))
+ return;
+
+ path_basename (path);
+ SLfree (path);
+}
+
+static SLFUTURE_CONST char *Load_Path;
+int SLpath_set_load_path (SLFUTURE_CONST char *path)
+{
+ if (path == NULL)
+ {
+	SLang_free_slstring ((char *) Load_Path);
+	Load_Path = NULL;
+	return 0;
+ }
+
+ path = SLang_create_slstring (path);
+ if (path == NULL)
+ return -1;
+
+ if (Load_Path != NULL)
+ SLang_free_slstring ((char *) Load_Path);
+
+ Load_Path = path;
+ return 0;
+}
+
+char *SLpath_get_load_path (void)
+{
+ return SLang_create_slstring (Load_Path);
+}
+
+static SLCONST char *get_load_path (void)
+{
+ if (Load_Path == NULL)
+ return "";
+ return Load_Path;
+}
+
+static void set_load_path (char *path)
+{
+ (void) SLpath_set_load_path (path);
+}
+
+static char *more_recent (char *a, char *b)
+{
+ unsigned long ta, tb;
+ struct stat st;
+
+ if (a == NULL)
+ return b;
+ if (b == NULL)
+ return a;
+
+ if (-1 == stat (a, &st))
+ return b;
+ ta = (unsigned long) st.st_mtime;
+ if (-1 == stat (b, &st))
+ return a;
+ tb = (unsigned long) st.st_mtime;
+
+ if (tb >= ta)
+ return b;
+
+ return a;
+}
+
+/* returns SLmalloced string */
+static char *find_file (SLFUTURE_CONST char *path, SLFUTURE_CONST char *file)
+{
+ char *dirfile;
+ char *extname;
+ char *filebuf;
+ char *filesl, *fileslc;
+ unsigned int len;
+
+ if (NULL != (dirfile = SLpath_find_file_in_path (path, file)))
+ return dirfile;
+
+ /* Not found, or an error occured. */
+ if (_pSLang_Error)
+ return NULL;
+
+ extname = SLpath_extname (file);
+ if (*extname != 0)
+ return NULL;
+
+ /* No extension. So look for .slc and .sl forms */
+ len = (extname - file);
+ filebuf = (char *)SLmalloc (len + 5);
+ if (filebuf == NULL)
+ return NULL;
+
+ strcpy (filebuf, file);
+ strcpy (filebuf + len, ".sl");
+
+ filesl = SLpath_find_file_in_path (path, filebuf);
+ if ((filesl == NULL) && _pSLang_Error)
+ {
+	SLfree (filebuf);
+	return NULL;
+ }
+ strcpy (filebuf + len, ".slc");
+ fileslc = SLpath_find_file_in_path (path, filebuf);
+ SLfree (filebuf);
+
+ dirfile = more_recent (filesl, fileslc);
+
+ if (dirfile != filesl)
+ SLfree (filesl);
+ if (dirfile != fileslc)
+ SLfree (fileslc);
+
+ return dirfile;
+}
+
+char *_pSLpath_find_file (SLFUTURE_CONST char *file, int signal_error)
+{
+ SLFUTURE_CONST char *path;
+ char *dirfile;
+
+ if (file == NULL)
+ return NULL;
+
+ path = Load_Path;
+ if ((path == NULL) || (*path == 0))
+ path = ".";
+
+ dirfile = find_file (path, file);
+
+ if (dirfile != NULL)
+ {
+	file = SLang_create_slstring (dirfile);
+	SLfree (dirfile);
+	return (char *) file;
+ }
+
+ if (signal_error)
+ _pSLang_verror (SL_OBJ_NOPEN, "Unable to locate %s on load path", file);
+ return NULL;
+}
+
+static void get_path_delimiter (void)
+{
+ (void) SLang_push_char ((char) SLpath_get_delimiter ());
+}
+
+static int path_is_absolute_path (char *s)
+{
+ return SLpath_is_absolute_path (s);
+}
+
+#if 0
+static void set_path_delimiter (int *d)
+{
+ (void) SLpath_set_delimiter (*d);
+}
+#endif
+static SLang_Intrin_Fun_Type Path_Name_Table =
+{
+ MAKE_INTRINSIC_S("set_slang_load_path", set_load_path, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("get_slang_load_path", get_load_path, SLANG_STRING_TYPE),
+ MAKE_INTRINSIC_0("path_get_delimiter", get_path_delimiter, SLANG_VOID_TYPE),
+ /* MAKE_INTRINSIC_I("path_set_delimiter", set_path_delimiter, SLANG_VOID_TYPE), */
+ MAKE_INTRINSIC_SS("path_concat", path_concat, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("path_extname", path_extname, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("path_dirname", path_dirname, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("path_basename", path_basename, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("path_basename_sans_extname", path_basename_sans_extname, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("path_sans_extname", path_sans_extname, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("path_is_absolute", path_is_absolute_path, SLANG_INT_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+int SLang_init_ospath (void)
+{
+ if (-1 == SLadd_intrin_fun_table(Path_Name_Table, "__OSPATH__"))
+ return -1;
+
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slpack.c Added

@@ -0,0 +1,892 @@
+/* Pack objects as a binary string */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include <ctype.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+#ifndef isdigit
+# define isdigit(c) (((c)>='0')&&((c)<= '9'))
+#endif
+#ifndef isspace
+# define isspace(c) (((c)==' ') || ((c)=='\t') || ((c)=='\n'))
+#endif
+
+/* format description:
+ *
+ * s = string (null padded, except when unpacking)
+ * S = string (space padded)
+ * z = string (null padded)
+ * c = signed char
+ * C = unsigned char
+ * h = short
+ * H = unsigned short
+ * i = int
+ * I = unsigned int
+ * l = long
+ * L = unsigned long
+ * j = 16 bit signed integer (short)
+ * J = 16 bit unsigned integer (short)
+ * k = 32 bit signed integer (long)
+ * K = 32 bit unsigned integer (long)
+ * q = 64 bit unsigned integer (long)
+ * Q = 64 bit unsigned integer (long)
+ * f = float (native format)
+ * F = 32 bit double
+ * d = double (native format)
+ * D = 64 bit double
+ * x = null pad byte
+ * > = big-endian mode
+ * < = little-endian mode
+ * = = native mode
+ */
+
+static int Native_Byte_Order = _pSLANG_BYTEORDER_NATIVE;
+
+typedef struct
+{
+ char format_type;
+ SLtype data_type;
+ unsigned int repeat;
+ unsigned int sizeof_type;
+ char pad;
+ int byteorder;
+ int is_scalar;
+}
+Format_Type;
+
+static int get_int_type_for_size (unsigned int size, SLtype *s, SLtype *u)
+{
+ if (sizeof (int) == size)
+ {
+	if (s != NULL) *s = SLANG_INT_TYPE;
+	if (u != NULL) *u = SLANG_UINT_TYPE;
+	return 0;
+ }
+
+ if (sizeof (short) == size)
+ {
+	if (s != NULL) *s = SLANG_SHORT_TYPE;
+	if (u != NULL) *u = SLANG_USHORT_TYPE;
+	return 1;
+ }
+
+ if (sizeof (long) == size)
+ {
+	if (s != NULL) *s = SLANG_LONG_TYPE;
+	if (u != NULL) *u = SLANG_ULONG_TYPE;
+	return 1;
+ }
+#ifdef HAVE_LONG_LONG
+ if (sizeof (long long) == size)
+ {
+	if (s != NULL) *s = SLANG_LLONG_TYPE;
+	if (u != NULL) *u = SLANG_ULLONG_TYPE;
+	return 1;
+ }
+#endif
+ if (s != NULL) *s = 0;
+ if (u != NULL) *u = 0;
+ _pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "This OS does not support a %u byte int", size);
+ return -1;
+}
+
+static int get_float_type_for_size (unsigned int size, SLtype *s)
+{
+ if (sizeof (float) == size)
+ {
+	*s = SLANG_FLOAT_TYPE;
+	return 0;
+ }
+
+ if (sizeof (double) == size)
+ {
+	*s = SLANG_DOUBLE_TYPE;
+	return 0;
+ }
+
+ _pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "This OS does not support a %u byte float", size);
+ return -1;
+}
+
+static int parse_a_format (char **format, Format_Type *ft)
+{
+ char *f;
+ char ch;
+
+ f = *format;
+
+ while (((ch = *f++) != 0)
+	 && isspace ((unsigned char)ch))
+ ;
+
+ switch (ch)
+ {
+ default:
+	ft->byteorder = _pSLANG_BYTEORDER_NATIVE;
+	break;
+
+ case '=':
+	ft->byteorder = _pSLANG_BYTEORDER_NATIVE;
+	ch = *f++;
+	break;
+
+ case '>':
+	ft->byteorder = _pSLANG_BYTEORDER_BIGE;
+	ch = *f++;
+	break;
+
+ case '<':
+	ft->byteorder = _pSLANG_BYTEORDER_LILE;
+	ch = *f++;
+	break;
+ }
+
+ if (ch == 0)
+ {
+	f--;
+	*format = f;
+	return 0;
+ }
+
+ ft->format_type = ch;
+ ft->repeat = 1;
+
+ if (isdigit ((unsigned char)*f))
+ {
+	unsigned int repeat = (unsigned int) (*f - '0');
+	f++;
+
+	while (isdigit ((unsigned char)*f))
+	 {
+	 unsigned int repeat10 = 10 * repeat + (unsigned int)(*f - '0');
+
+	 /* Check overflow */
+	 if (repeat != repeat10 / 10)
+	 {
+		 _pSLang_verror (SL_ARITH_OVERFLOW_ERROR,
+				"Repeat count too large in unpack format");
+		 return -1;
+	 }
+	 repeat = repeat10;
+	 f++;
+	 }
+	ft->repeat = repeat;
+ }
+
+ *format = f;
+
+ ft->is_scalar = 1;
+ ft->pad = 0;
+
+ switch (ft->format_type)
+ {
+ default:
+	_pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "unpack format character '%c' not supported", ft->format_type);
+	return -1;
+
+ case 'D':
+	ft->sizeof_type = 8;
+	if (-1 == get_float_type_for_size (8, &ft->data_type))
+	 return -1;
+	break;
+
+ case 'd':
+	ft->data_type = SLANG_DOUBLE_TYPE;
+	ft->sizeof_type = sizeof (double);
+	break;
+
+ case 'F':
+	ft->sizeof_type = 4;
+	if (-1 == get_float_type_for_size (4, &ft->data_type))
+	 return -1;
+	break;
+ case 'f':
+	ft->data_type = SLANG_FLOAT_TYPE;
+	ft->sizeof_type = sizeof (float);
+	break;
+
+ case 'h':
+	ft->data_type = SLANG_SHORT_TYPE;
+	ft->sizeof_type = sizeof (short);
+	break;
+ case 'H':
+	ft->data_type = SLANG_USHORT_TYPE;
+	ft->sizeof_type = sizeof (unsigned short);
+	break;
+ case 'i':
+	ft->data_type = SLANG_INT_TYPE;
+	ft->sizeof_type = sizeof (int);
+	break;
+ case 'I':
+	ft->data_type = SLANG_UINT_TYPE;
+	ft->sizeof_type = sizeof (unsigned int);
+	break;
+ case 'l':
+	ft->data_type = SLANG_LONG_TYPE;
+	ft->sizeof_type = sizeof (long);
+	break;
+ case 'L':
+	ft->data_type = SLANG_ULONG_TYPE;
+	ft->sizeof_type = sizeof (unsigned long);
+	break;
+#ifdef HAVE_LONG_LONG
+ case 'm':
+	ft->data_type = SLANG_LLONG_TYPE;
+	ft->sizeof_type = sizeof (long long);
+	break;
+ case 'M':
+	ft->data_type = SLANG_ULLONG_TYPE;
+	ft->sizeof_type = sizeof (unsigned long long);
+	break;
+#endif
+
+	/* 16 bit ints */
+ case 'j':
+	ft->sizeof_type = 2;
+	if (-1 == get_int_type_for_size (2, &ft->data_type, NULL))
+	 return -1;
+	break;
+ case 'J':
+	ft->sizeof_type = 2;
+	if (-1 == get_int_type_for_size (2, NULL, &ft->data_type))
+	 return -1;
+	break;
+
+	/* 32 bit ints */
+ case 'k':
+	ft->sizeof_type = 4;
+	if (-1 == get_int_type_for_size (4, &ft->data_type, NULL))
+	 return -1;
+	break;
+ case 'K':
+	ft->sizeof_type = 4;
+	if (-1 == get_int_type_for_size (4, NULL, &ft->data_type))
+	 return -1;
+	break;
+
+	/* 64 bit ints */
+ case 'q':
+	ft->sizeof_type = 8;
+	if (-1 == get_int_type_for_size (8, &ft->data_type, NULL))
+	 return -1;
+	break;
+ case 'Q':
+	ft->sizeof_type = 8;
+	if (-1 == get_int_type_for_size (8, NULL, &ft->data_type))
+	 return -1;
+	break;
+
+ case 'x':
+	ft->sizeof_type = 1;
+	ft->data_type = 0;
+	break;
+
+ case 'c':
+	ft->sizeof_type = 1;
+	ft->data_type = SLANG_CHAR_TYPE;
+	break;
+
+ case 'C':
+	ft->data_type = SLANG_UCHAR_TYPE;
+	ft->sizeof_type = 1;
+	break;
+
+ case 'S':
+ case 'A':
+	ft->pad = ' ';
+ case 'a':
+ case 's':
+ case 'z':
+	ft->data_type = SLANG_BSTRING_TYPE;
+	ft->sizeof_type = 1;
+	ft->is_scalar = 0;
+	break;
+ }
+ return 1;
+}
+
+static int compute_size_for_format (char *format, SLstrlen_Type *num_bytes)
+{
+ size_t size;
+ Format_Type ft;
+ int status;
+
+ *num_bytes = size = 0;
+
+ while (1 == (status = parse_a_format (&format, &ft)))
+ size += ft.repeat * ft.sizeof_type;
+
+ *num_bytes = size;
+ return status;
+}
+
+static void byte_swap64 (unsigned char *ss, unsigned int n) /*{{{*/
+{
+ unsigned char *p, *pmax;
+
+ if (n == 0) return;
+ p = (unsigned char *) ss;
+ pmax = p + 8 * n;
+ while (p < pmax)
+ {
+	unsigned char ch = *p;
+	*p = *(p + 7);
+	*(p + 7) = ch;
+
+	ch = *(p + 6);
+	*(p + 6) = *(p + 1);
+	*(p + 1) = ch;
+
+	ch = *(p + 5);
+	*(p + 5) = *(p + 2);
+	*(p + 2) = ch;
+
+	ch = *(p + 4);
+	*(p + 4) = *(p + 3);
+	*(p + 3) = ch;
+
+	p += 8;
+ }
+}
+
+/*}}}*/
+static void byte_swap32 (unsigned char *ss, unsigned int n) /*{{{*/
+{
+ unsigned char *p, *pmax;
+
+ p = (unsigned char *) ss;
+ pmax = p + 4 * n;
+ while (p < pmax)
+ {
+	unsigned char ch = *p;
+	*p = *(p + 3);
+	*(p + 3) = ch;
+
+	ch = *(p + 1);
+	*(p + 1) = *(p + 2);
+	*(p + 2) = ch;
+	p += 4;
+ }
+}
+
+/*}}}*/
+static void byte_swap16 (unsigned char *p, unsigned int nread) /*{{{*/
+{
+ unsigned char *pmax;
+
+ pmax = p + 2 * nread;
+ while (p < pmax)
+ {
+	unsigned char ch = *p;
+	*p = *(p + 1);
+	*(p + 1) = ch;
+	p += 2;
+ }
+}
+
+/*}}}*/
+
+static int byteswap (int order, unsigned char *b, unsigned int size, unsigned int num)
+{
+ if (Native_Byte_Order == order)
+ return 0;
+
+ switch (size)
+ {
+ case 2:
+	byte_swap16 (b, num);
+	break;
+ case 4:
+	byte_swap32 (b, num);
+	break;
+ case 8:
+	byte_swap64 (b, num);
+	break;
+ default:
+	return -1;
+ }
+
+ return 0;
+}
+
+static void check_native_byte_order (void)
+{
+ unsigned short x;
+
+ if (Native_Byte_Order != _pSLANG_BYTEORDER_NATIVE)
+ return;
+
+ x = 0xFF;
+ if (*(unsigned char *)&x == 0xFF)
+ Native_Byte_Order = _pSLANG_BYTEORDER_LILE;
+ else
+ Native_Byte_Order = _pSLANG_BYTEORDER_BIGE;
+}
+
+static SLang_BString_Type *
+pack_according_to_format (char *format, SLuindex_Type nitems)
+{
+ SLstrlen_Type size;
+ SLstrlen_Type num;
+ unsigned char *buf, *b;
+ SLang_BString_Type *bs;
+ Format_Type ft;
+
+ buf = NULL;
+
+ if (-1 == compute_size_for_format (format, &size))
+ goto return_error;
+
+ if (NULL == (buf = (unsigned char *) SLmalloc (size + 1)))
+ goto return_error;
+
+ b = buf;
+
+ while (1 == parse_a_format (&format, &ft))
+ {
+	unsigned char *ptr;
+	unsigned int repeat;
+
+	repeat = ft.repeat;
+	if (ft.data_type == 0)
+	 {
+	 memset ((char *) b, ft.pad, repeat);
+	 b += repeat;
+	 continue;
+	 }
+
+	if (ft.is_scalar)
+	 {
+	 unsigned char *bstart;
+	 num = repeat;
+
+	 bstart = b;
+	 while (repeat != 0)
+	 {
+		 unsigned int nelements;
+		 SLang_Array_Type *at;
+
+		 if (nitems == 0)
+		 {
+		 _pSLang_verror (SL_INVALID_PARM,
+				 "Not enough items for pack format");
+		 goto return_error;
+		 }
+
+		 if (-1 == SLang_pop_array_of_type (&at, ft.data_type))
+		 goto return_error;
+
+		 nelements = at->num_elements;
+		 if (repeat < nelements)
+		 nelements = repeat;
+		 repeat -= nelements;
+
+		 nelements = nelements * ft.sizeof_type;
+		 memcpy ((char *)b, (char *)at->data, nelements);
+
+		 b += nelements;
+		 SLang_free_array (at);
+		 nitems--;
+	 }
+
+	 if (ft.byteorder != _pSLANG_BYTEORDER_NATIVE)
+	 byteswap (ft.byteorder, bstart, ft.sizeof_type, num);
+
+	 continue;
+	 }
+
+	/* Otherwise we have a string */
+	if (-1 == SLang_pop_bstring (&bs))
+	 goto return_error;
+
+	ptr = SLbstring_get_pointer (bs, &num);
+	if (repeat < num) num = repeat;
+	memcpy ((char *)b, (char *)ptr, num);
+	b += num;
+	repeat -= num;
+	if ((repeat == 0) && (ft.format_type == 'z'))
+	 {
+	 if (num) *(b-1) = 0;
+	 }
+	else memset ((char *)b, ft.pad, repeat);
+	SLbstring_free (bs);
+	b += repeat;
+	nitems--;
+ }
+
+ *b = 0;
+ bs = SLbstring_create_malloced (buf, size, 0);
+ if (bs == NULL)
+ goto return_error;
+
+ SLdo_pop_n (nitems);
+ return bs;
+
+ return_error:
+ SLdo_pop_n (nitems);
+ if (buf != NULL)
+ SLfree ((char *) buf);
+
+ return NULL;
+}
+
+void _pSLpack (void)
+{
+ SLang_BString_Type *bs;
+ char *fmt;
+ int nitems;
+
+ check_native_byte_order ();
+
+ nitems = SLang_Num_Function_Args;
+ if (nitems <= 0)
+ {
+	_pSLang_verror (SL_SYNTAX_ERROR,
+		 "pack: not enough arguments");
+	return;
+ }
+
+ if ((-1 == SLreverse_stack (nitems))
+ || (-1 == SLang_pop_slstring (&fmt)))
+ bs = NULL;
+ else
+ {
+	bs = pack_according_to_format (fmt, (unsigned int)nitems - 1);
+	SLang_free_slstring (fmt);
+ }
+
+ SLang_push_bstring (bs);
+ SLbstring_free (bs);
+}
+
+static unsigned int get_unpadded_strlen (char *str, char pad, unsigned int len)
+{
+ char *s;
+
+ s = str + len;
+ while (s > str)
+ {
+	s--;
+	if ((*s != pad) && (*s != 0))
+	 {
+	 s++;
+	 break;
+	 }
+ }
+ return (unsigned int) (s - str);
+}
+
+void _pSLunpack (char *format, SLang_BString_Type *bs)
+{
+ Format_Type ft;
+ unsigned char *b;
+ SLstrlen_Type len;
+ SLstrlen_Type num_bytes;
+
+ check_native_byte_order ();
+
+ if (-1 == compute_size_for_format (format, &num_bytes))
+ return;
+
+ b = SLbstring_get_pointer (bs, &len);
+ if (b == NULL)
+ return;
+
+ if (len < num_bytes)
+ {
+	_pSLang_verror (SL_INVALID_PARM,
+		 "unpack format %s is too large for input string",
+		 format);
+	return;
+ }
+
+ while (1 == parse_a_format (&format, &ft))
+ {
+	char *str, *s;
+
+	if (ft.repeat == 0)
+	 continue;
+
+	if (ft.data_type == 0)
+	 {			 /* skip padding */
+	 b += ft.repeat;
+	 continue;
+	 }
+
+	if (ft.is_scalar)
+	 {
+	 SLang_Array_Type *at;
+	 SLindex_Type dims;
+
+	 if (ft.repeat == 1)
+	 {
+		 SLang_Class_Type *cl;
+
+		 cl = _pSLclass_get_class (ft.data_type);
+		 memcpy ((char *)cl->cl_transfer_buf, (char *)b, ft.sizeof_type);
+		 if (ft.byteorder != _pSLANG_BYTEORDER_NATIVE)
+		 byteswap (ft.byteorder, (unsigned char *)cl->cl_transfer_buf, ft.sizeof_type, 1);
+
+		 if (-1 == (cl->cl_apush (ft.data_type, cl->cl_transfer_buf)))
+		 return;
+		 b += ft.sizeof_type;
+		 continue;
+	 }
+
+	 dims = (SLindex_Type) ft.repeat;
+	 at = SLang_create_array (ft.data_type, 0, NULL, &dims, 1);
+	 if (at == NULL)
+	 return;
+
+	 num_bytes = ft.repeat * ft.sizeof_type;
+	 memcpy ((char *)at->data, (char *)b, num_bytes);
+	 if (ft.byteorder != _pSLANG_BYTEORDER_NATIVE)
+	 byteswap (ft.byteorder, (unsigned char *)at->data, ft.sizeof_type, ft.repeat);
+
+	 if (-1 == SLang_push_array (at, 1))
+	 return;
+
+	 b += num_bytes;
+	 continue;
+	 }
+
+	/* string type: s, S, or Z */
+	if (ft.format_type == 's')
+	 len = ft.repeat;
+	else
+	 len = get_unpadded_strlen ((char *)b, ft.pad, ft.repeat);
+
+	str = (char *)SLmalloc (len + 1);
+	if (str == NULL)
+	 return;
+	memcpy ((char *) str, (char *)b, len);
+	str len = 0;
+
+	/* Avoid a bstring if possible */
+	s = SLmemchr (str, 0, len);
+	if (s == NULL)
+	 {
+	 if (-1 == SLang_push_malloced_string (str))
+	 return;
+	 }
+	else
+	 {
+	 SLang_BString_Type *new_bs;
+
+	 new_bs = SLbstring_create_malloced ((unsigned char *)str, len, 1);
+	 if (new_bs == NULL)
+	 return;
+
+	 if (-1 == SLang_push_bstring (new_bs))
+	 {
+		 SLfree (str);
+		 return;
+	 }
+	 SLbstring_free (new_bs);
+	 }
+
+	b += ft.repeat;
+ }
+}
+
+SLstrlen_Type _pSLpack_compute_size (char *format)
+{
+ SLstrlen_Type n;
+
+ n = 0;
+ (void) compute_size_for_format (format, &n);
+ return n;
+}
+
+void _pSLpack_pad_format (char *format)
+{
+ SLstrlen_Type len, max_len;
+ Format_Type ft;
+ char *buf, *b;
+
+ check_native_byte_order ();
+
+ /* Just check the syntax */
+ if (-1 == compute_size_for_format (format, &max_len))
+ return;
+
+ /* This should be sufficient to handle any needed xyy padding characters.
+ * I cannot see how this will be overrun
+ */
+ max_len = 4 * (strlen (format) + 1);
+ if (NULL == (buf = (char *)SLmalloc (max_len + 1)))
+ return;
+
+ b = buf;
+ len = 0;
+ while (1 == parse_a_format (&format, &ft))
+ {
+	struct { char a; short b; } s_h;
+	struct { char a; int b; } s_i;
+	struct { char a; long b; } s_l;
+	struct { char a; float b; } s_f;
+	struct { char a; double b; } s_d;
+	unsigned int pad;
+
+	if (ft.repeat == 0)
+	 continue;
+
+	if (ft.data_type == 0)
+	 {			 /* pad */
+	 sprintf (b, "x%u", ft.repeat);
+	 b += strlen (b);
+	 len += ft.repeat;
+	 continue;
+	 }
+
+	switch (ft.data_type)
+	 {
+	 default:
+	 case SLANG_STRING_TYPE:
+	 case SLANG_BSTRING_TYPE:
+	 case SLANG_CHAR_TYPE:
+	 case SLANG_UCHAR_TYPE:
+	 pad = 0;
+	 break;
+
+	 case SLANG_SHORT_TYPE:
+	 case SLANG_USHORT_TYPE:
+	 pad = ((unsigned int) ((char *)&s_h.b - (char *)&s_h.a));
+	 break;
+
+	 case SLANG_INT_TYPE:
+	 case SLANG_UINT_TYPE:
+	 pad = ((unsigned int) ((char *)&s_i.b - (char *)&s_i.a));
+	 break;
+
+	 case SLANG_LONG_TYPE:
+	 case SLANG_ULONG_TYPE:
+	 pad = ((unsigned int) ((char *)&s_l.b - (char *)&s_l.a));
+	 break;
+
+	 case SLANG_FLOAT_TYPE:
+	 pad = ((unsigned int) ((char *)&s_f.b - (char *)&s_f.a));
+	 break;
+
+	 case SLANG_DOUBLE_TYPE:
+	 pad = ((unsigned int) ((char *)&s_d.b - (char *)&s_d.a));
+	 break;
+	 }
+
+	/* Pad to a length that is an integer multiple of pad. */
+	if (pad)
+	 pad = pad * ((len + pad - 1)/pad) - len;
+
+	if (pad)
+	 {
+	 sprintf (b, "x%u", pad);
+	 b += strlen (b);
+	 len += pad;
+	 }
+
+	*b++ = ft.format_type;
+	if (ft.repeat > 1)
+	 {
+	 sprintf (b, "%u", ft.repeat);
+	 b += strlen (b);
+	 }
+
+	len += ft.repeat * ft.sizeof_type;
+ }
+ *b = 0;
+
+ (void) SLang_push_malloced_string (buf);
+}
+
+SLang_Array_Type *_pSLpack_byteswap_array (SLang_Array_Type *at, int from, int to)
+{
+ SLang_Array_Type *bt;
+ check_native_byte_order ();
+
+ if (0 == _pSLang_is_arith_type (at->data_type))
+ {
+	if (at->data_type != SLANG_COMPLEX_TYPE)
+	 {
+	 SLang_verror (SL_InvalidParm_Error, "type %s arrays do not support byteswapping",
+			 SLclass_get_datatype_name (at->data_type));
+	 return NULL;
+	 }
+ }
+
+ if (from == _pSLANG_BYTEORDER_NATIVE)
+ from = Native_Byte_Order;
+ if (to == _pSLANG_BYTEORDER_NATIVE)
+ to = Native_Byte_Order;
+
+ if ((from == to) || (at->sizeof_type == 1))
+ {
+	at->num_refs++;
+	return at;
+ }
+
+#if SLANG_USE_TMP_OPTIMIZATION
+ if ((at->num_refs == 1)
+ && (0 == (at->flags & SLARR_DATA_VALUE_IS_READ_ONLY)))
+ {
+	at->num_refs++;
+	bt = at;
+ }
+ else/* drop */
+#endif
+ if (NULL == (bt = SLang_duplicate_array (at)))
+ return NULL;
+
+ switch (bt->sizeof_type)
+ {
+ case 2:
+	byte_swap16 ((unsigned char *)bt->data, bt->num_elements);
+	break;
+
+ case 4:
+	byte_swap32 ((unsigned char *)bt->data, bt->num_elements);
+	break;
+
+ case 8:
+	byte_swap64 ((unsigned char *)bt->data, bt->num_elements);
+	break;
+
+ default:
+	if (bt->data_type == SLANG_COMPLEX_TYPE)
+	 {
+	 byte_swap64 ((unsigned char *)bt->data, 2*bt->num_elements);
+	 break;
+	 }
+	SLang_verror (SL_NotImplemented_Error, "Byteswapping of objects with size %u is not supported",
+		 bt->sizeof_type);
+	SLang_free_array (bt);
+	return NULL;
+ }
+
+ return bt;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slparse.c Added

@@ -0,0 +1,3390 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+static SLang_Load_Type *LLT;
+
+static void free_token (_pSLang_Token_Type *t)
+{
+ register unsigned int nrefs = t->num_refs;
+
+ if (nrefs == 0)
+ return;
+
+ if (nrefs == 1)
+ {
+	if (t->free_val_func != NULL)
+	 {
+	 (*t->free_val_func)(t);
+	 t->free_val_func = NULL;
+	 t->v.s_val = NULL;
+	 }
+ }
+
+ t->num_refs = nrefs - 1;
+}
+
+static void init_token (_pSLang_Token_Type *t)
+{
+ memset ((char *) t, 0, sizeof (_pSLang_Token_Type));
+#if SLANG_HAS_DEBUG_CODE
+ t->line_number = -1;
+#endif
+}
+
+/* Allow room for one push back of a token. This is necessary for
+ * multiple assignment.
+ */
+static unsigned int Use_Next_Token;
+static _pSLang_Token_Type Next_Token;
+#if SLANG_HAS_DEBUG_CODE
+static int Last_Line_Number = -1;
+#endif
+
+static int In_Looping_Context = 0;
+
+static int unget_token (_pSLang_Token_Type *ctok)
+{
+ if (_pSLang_Error)
+ return -1;
+ if (Use_Next_Token != 0)
+ {
+	_pSLparse_error (SL_INTERNAL_ERROR, "unget_token failed", ctok, 0);
+	return -1;
+ }
+
+ Use_Next_Token++;
+ Next_Token = *ctok;
+ init_token (ctok);
+ return 0;
+}
+
+static int get_token (_pSLang_Token_Type *ctok)
+{
+ if (ctok->num_refs)
+ free_token (ctok);
+
+ if (Use_Next_Token)
+ {
+	Use_Next_Token--;
+	*ctok = Next_Token;
+	return ctok->type;
+ }
+
+ return _pSLget_token (ctok);
+}
+
+static int check_int_token_overflow (_pSLang_Token_Type *ctok, int sign)
+{
+ long ival, lval;
+ SLtype stype;
+
+ ctok->v.long_val = lval = sign * ctok->v.long_val;
+
+ if (ctok->flags & (SLTOKEN_IS_HEX|SLTOKEN_IS_BINARY))
+ return 0;
+
+ switch (ctok->type)
+ {
+ case CHAR_TOKEN:
+	stype = SLANG_CHAR_TYPE;
+	ival = (long)(char) lval;
+	break;
+ case SHORT_TOKEN:
+	stype = SLANG_SHORT_TYPE;
+	ival = (long)(short) lval;
+	break;
+ case INT_TOKEN:
+	stype = SLANG_INT_TYPE;
+	ival = (long)(int) lval;
+	break;
+ case LONG_TOKEN:
+	stype = LONG_TOKEN;
+ ival = lval;
+	break;
+
+ default:
+	return 0;
+ }
+
+ if (ival == lval)
+ {
+	if (((lval >= 0) && (sign > 0))
+	 || ((lval <= 0) && (sign < 0)))
+	 return 0;
+ }
+ SLang_verror (SL_SYNTAX_ERROR, "Literal integer constant is too large for %s", SLclass_get_datatype_name(stype));
+ return -1;
+}
+
+static int check_uint_token_overflow (_pSLang_Token_Type *ctok, int sign)
+{
+ unsigned long ival, lval;
+ SLtype stype;
+
+ ctok->v.long_val = sign * ctok->v.long_val;
+ lval = (unsigned long) ctok->v.long_val;
+
+ switch (ctok->type)
+ {
+ case UCHAR_TOKEN:
+	ival = (unsigned long)(unsigned char) lval;
+	stype = SLANG_UCHAR_TYPE;
+	break;
+ case USHORT_TOKEN:
+	stype = SLANG_USHORT_TYPE;
+	ival = (unsigned long)(unsigned short) lval;
+	break;
+ case UINT_TOKEN:
+	stype = SLANG_UINT_TYPE;
+	ival = (unsigned long)(unsigned int) lval;
+	break;
+ case ULONG_TOKEN:
+	stype = SLANG_ULONG_TYPE;
+	ival = lval;
+	break;
+ default:
+	return 0;
+ }
+
+ if (ival == lval)
+ return 0;
+
+ SLang_verror (SL_SYNTAX_ERROR, "Literal integer constant is too large for %s", SLclass_get_datatype_name(stype));
+ return -1;
+}
+
+#ifdef HAVE_LONG_LONG
+static int check_llong_token_overflow (_pSLang_Token_Type *ctok, int sign)
+{
+ long long lval = sign * ctok->v.llong_val;
+ ctok->v.llong_val = lval;
+
+ if ((ctok->flags & (SLTOKEN_IS_HEX|SLTOKEN_IS_BINARY))
+ || ((lval >= 0) && (sign > 0))
+ || ((lval <= 0) && (sign < 0)))
+ return 0;
+
+ SLang_verror (SL_SYNTAX_ERROR, "Literal integer constant is too large for %s", SLclass_get_datatype_name(SLANG_LLONG_TYPE));
+ return -1;
+}
+
+static int check_ullong_token_overflow (_pSLang_Token_Type *ctok, int sign)
+{
+ ctok->v.ullong_val *= sign;
+ return 0;
+}
+#endif
+
+static int check_number_token_overflow (_pSLang_Token_Type *tok, int sign)
+{
+ tok->flags |= SLTOKEN_OVERFLOW_CHECKED;
+
+ switch (tok->type)
+ {
+ case CHAR_TOKEN:
+ case SHORT_TOKEN:
+ case INT_TOKEN:
+ case LONG_TOKEN:
+	return check_int_token_overflow (tok, sign);
+
+ case UCHAR_TOKEN:
+ case USHORT_TOKEN:
+ case UINT_TOKEN:
+ case ULONG_TOKEN:
+	return check_uint_token_overflow (tok, sign);
+
+#ifdef HAVE_LONG_LONG
+ case LLONG_TOKEN:
+	return check_llong_token_overflow (tok, sign);
+
+ case ULLONG_TOKEN:
+	return check_ullong_token_overflow (tok, sign);
+#endif
+ }
+ return 0;
+}
+
+static int compile_token (_pSLang_Token_Type *t)
+{
+#if SLANG_HAS_DEBUG_CODE
+ if ((t->line_number != Last_Line_Number)
+ && (t->line_number != -1))
+ {
+	_pSLang_Token_Type tok;
+	tok.type = LINE_NUM_TOKEN;
+	tok.v.long_val = Last_Line_Number = t->line_number;
+	(*_pSLcompile_ptr) (&tok);
+ }
+#endif
+ if ((t->flags & (SLTOKEN_TYPE_INTEGER|SLTOKEN_OVERFLOW_CHECKED)) == SLTOKEN_TYPE_INTEGER)
+ {
+	if (-1 == check_number_token_overflow (t, 1))
+	 return -1;
+ }
+ (*_pSLcompile_ptr) (t);
+ return 0;
+}
+
+typedef struct
+{
+#define USE_PARANOID_MAGIC	0
+#if USE_PARANOID_MAGIC
+ unsigned long magic;
+#endif
+ _pSLang_Token_Type *stack;
+ unsigned int len;
+ unsigned int size;
+}
+Token_List_Type;
+
+#define MAX_TOKEN_LISTS 256
+static Token_List_Type Token_List_Stack MAX_TOKEN_LISTS;
+static unsigned int Token_List_Stack_Depth = 0;
+static Token_List_Type *Token_List = NULL;
+
+static void init_token_list (Token_List_Type *t)
+{
+ t->size = 0;
+ t->len = 0;
+ t->stack = NULL;
+#if USE_PARANOID_MAGIC
+ t->magic = 0xABCDEF12;
+#endif
+}
+
+static void free_token_list (Token_List_Type *t)
+{
+ _pSLang_Token_Type *s;
+
+ if (t == NULL)
+ return;
+#if USE_PARANOID_MAGIC
+ if (t->magic != 0xABCDEF12)
+ {
+	_pSLang_verror (SL_INTERNAL_ERROR, "Token Magic number error.");
+	return;
+ }
+#endif
+ s = t->stack;
+ if (s != NULL)
+ {
+	_pSLang_Token_Type *smax = s + t->len;
+	while (s != smax)
+	 {
+	 if (s->num_refs) free_token (s);
+	 s++;
+	 }
+
+	SLfree ((char *) t->stack);
+ }
+
+ memset ((char *) t, 0, sizeof (Token_List_Type));
+}
+
+static Token_List_Type *push_token_list (void)
+{
+ if (Token_List_Stack_Depth == MAX_TOKEN_LISTS)
+ {
+	_pSLparse_error (SL_BUILTIN_LIMIT_EXCEEDED,
+			"Token list stack size exceeded", NULL, 0);
+	return NULL;
+ }
+
+ Token_List = Token_List_Stack + Token_List_Stack_Depth;
+ Token_List_Stack_Depth++;
+ init_token_list (Token_List);
+ return Token_List;
+}
+
+static int pop_token_list (int do_free)
+{
+ if (Token_List_Stack_Depth == 0)
+ {
+	if (_pSLang_Error == 0)
+	 _pSLparse_error (SL_INTERNAL_ERROR, "Token list stack underflow", NULL, 0);
+	return -1;
+ }
+ Token_List_Stack_Depth--;
+
+ if (do_free) free_token_list (Token_List);
+
+ if (Token_List_Stack_Depth != 0)
+ Token_List = Token_List_Stack + (Token_List_Stack_Depth - 1);
+ else
+ Token_List = NULL;
+
+ return 0;
+}
+
+static int check_token_list_space (Token_List_Type *t, unsigned int delta_size)
+{
+ _pSLang_Token_Type *st;
+ unsigned int len;
+#if USE_PARANOID_MAGIC
+ if (t->magic != 0xABCDEF12)
+ {
+	_pSLang_verror (SL_INTERNAL_ERROR, "Token Magic number error.");
+	return -1;
+ }
+#endif
+ len = t->len + delta_size;
+ if (len <= t->size) return 0;
+
+ if (delta_size < 4)
+ {
+	delta_size = 4;
+	len = t->len + delta_size;
+ }
+
+ st = (_pSLang_Token_Type *) SLrealloc((char *) t->stack,
+					len * sizeof(_pSLang_Token_Type));
+ if (st == NULL)
+ {
+	_pSLparse_error (SL_MALLOC_ERROR, "Malloc error", NULL, 0);
+	return -1;
+ }
+
+ memset ((char *) (st + t->len), 0, delta_size);
+
+ t->stack = st;
+ t->size = len;
+ return 0;
+}
+
+static int append_token (_pSLang_Token_Type *t)
+{
+ if (-1 == check_token_list_space (Token_List, 1))
+ return -1;
+
+ Token_List->stack Token_List->len = *t;
+ Token_List->len += 1;
+ t->num_refs = 0;		 /* stealing it */
+ return 0;
+}
+
+static int append_copy_of_string_token (_pSLang_Token_Type *t)
+{
+ _pSLang_Token_Type *t1;
+
+ if (-1 == check_token_list_space (Token_List, 1))
+ return -1;
+
+ t1 = Token_List->stack + Token_List->len;
+ *t1 = *t;
+
+ if (t->v.s_val == NULL)
+ return -1;
+
+ if (EOF_TOKEN == _pSLtoken_init_slstring_token (t1, t->type, t->v.s_val, strlen (t->v.s_val)))
+ return -1;
+
+ t1->num_refs = 1;
+
+ Token_List->len += 1;
+ return 0;
+}
+
+static int append_int_as_token (int n)
+{
+ _pSLang_Token_Type num_tok;
+
+ init_token (&num_tok);
+ num_tok.type = INT_TOKEN;
+ num_tok.flags |= SLTOKEN_TYPE_INTEGER|SLTOKEN_OVERFLOW_CHECKED;
+ num_tok.v.long_val = n;
+ return append_token (&num_tok);
+}
+
+#if 0
+static int append_string_as_token (char *str)
+{
+ _pSLang_Token_Type *t;
+
+ if (-1 == check_token_list_space (Token_List, 1))
+ return -1;
+
+ t = Token_List->stack + Token_List->len;
+ init_token (t);
+
+ if (EOF_TOKEN == _pSLtoken_init_slstring_token (t, STRING_TOKEN, str, strlen (str)))
+ return -1;
+
+ t->num_refs = 1;
+
+ Token_List->len += 1;
+ return 0;
+}
+#endif
+
+static int append_token_of_type (unsigned char t)
+{
+ _pSLang_Token_Type *tok;
+
+ if (-1 == check_token_list_space (Token_List, 1))
+ return -1;
+
+ /* The memset when the list was created ensures that the other fields
+ * are properly initialized.
+ */
+#if 0
+ if ((t == CHS_TOKEN) && Token_List->len)
+ {
+	tok = Token_List->stack + (Token_List->len-1);
+	if (IS_INTEGER_TOKEN(tok->type))
+	 {
+	 tok->v.long_val = -tok->v.long_val;
+	 return 0;
+	 }
+#ifdef HAVE_LONG_LONG
+	if ((tok->type == LLONG_TOKEN) || (tok->type == ULLONG_TOKEN))
+	 {
+	 tok->v.llong_val = -tok->v.llong_val;
+	 return 0;
+	 }
+#endif
+ }
+#endif
+
+ tok = Token_List->stack + Token_List->len;
+ init_token (tok);
+ tok->type = t;
+ Token_List->len += 1;
+ return 0;
+}
+
+static _pSLang_Token_Type *get_last_token (void)
+{
+ unsigned int len;
+
+ if ((Token_List == NULL)
+ || (0 == (len = Token_List->len)))
+ return NULL;
+
+ len--;
+ return Token_List->stack + len;
+}
+
+/* This function does NOT free the list. */
+static int compile_token_list_with_fun (int dir, Token_List_Type *list,
+					int (*f)(_pSLang_Token_Type *))
+{
+ _pSLang_Token_Type *t0, *t1;
+
+ if (list == NULL)
+ return -1;
+
+ if (f == NULL)
+ f = compile_token;
+
+ t0 = list->stack;
+ t1 = t0 + list->len;
+
+ if (dir < 0)
+ {
+	/* backwards */
+
+	while ((_pSLang_Error == 0) && (t1 > t0))
+	 {
+	 t1--;
+	 (*f) (t1);
+	 }
+	return 0;
+ }
+
+ /* forward */
+ while ((_pSLang_Error == 0) && (t0 < t1))
+ {
+	(*f) (t0);
+	t0++;
+ }
+ return 0;
+}
+
+static int compile_token_list (void)
+{
+ if (Token_List == NULL)
+ return -1;
+
+ compile_token_list_with_fun (1, Token_List, NULL);
+ pop_token_list (1);
+ return 0;
+}
+
+/* Take all elements in the list from pos2 to the end and exchange them
+ * with the elements at pos1, e.g.,
+ * ...ABCDEabc ==> ...abcABCDE
+ * where pos1 denotes A and pos2 denotes a.
+ *
+ * NOTE: The caller must make special provisions for NO_OP_LITERAL tokens.
+ */
+static int token_list_element_exchange (unsigned int pos1, unsigned int pos2)
+{
+ _pSLang_Token_Type *s, *s1, *s2;
+ unsigned int len, nloops;
+
+ if (Token_List == NULL)
+ return -1;
+
+ s = Token_List->stack;
+ len = Token_List->len;
+
+ if ((s == NULL) || (len == 0)
+ || (pos2 >= len))
+ return -1;
+
+ if (pos1 > pos2)
+ {
+	SLang_verror (SL_INTERNAL_ERROR, "pos1<pos2 in token_list_element_exchange");
+	return -1;
+ }
+
+ /* This may not be the most efficient algorithm but the number to swap
+ * is most-likely going to be small, e.g, 3
+ * The algorithm is to rotate the list. The particular rotation
+ * direction was chosen to make insert_token fast.
+ * It works like:
+ * @ ABCabcde --> BCabcdeA --> CabcdeAB --> abcdefAB
+ * which is optimal for Abcdef sequence produced by function calls.
+ *
+ * Profiling indicates that nloops is almost always 1, whereas the inner
+ * loop can loop many times (e.g., 9 times).
+ */
+
+ s2 = s + (len - 1);
+ s1 = s + pos1;
+ nloops = pos2 - pos1;
+
+ while (nloops)
+ {
+	_pSLang_Token_Type save;
+
+	s = s1;
+	save = *s;
+
+	while (s < s2)
+	 {
+	 *s = *(s + 1);
+	 s++;
+	 }
+	*s = save;
+
+	nloops--;
+ }
+ return 0;
+}
+
+#if 0
+static int insert_token (_pSLang_Token_Type *t, unsigned int pos)
+{
+ if (-1 == append_token (t))
+ return -1;
+
+ return token_list_element_exchange (pos, Token_List->len - 1);
+}
+#endif
+static void compile_token_of_type (unsigned char t)
+{
+ _pSLang_Token_Type tok;
+
+#if SLANG_HAS_DEBUG_CODE
+ tok.line_number = -1;
+#endif
+ tok.flags = 0;
+ tok.type = t;
+ compile_token(&tok);
+}
+
+#if SLANG_HAS_BOSEOS
+static void compile_eos (void)
+{
+ /* This is commented out to ensure that if bos was compiled, the eos will be.
+ *
+ * if (0 == (_pSLang_Compile_Line_Num_Info & SLANG_BOSEOS_MASK))
+ * return;
+ */
+ compile_token_of_type (EOS_TOKEN);
+}
+
+static int compile_bos (_pSLang_Token_Type *t, int level)
+{
+ _pSLang_Token_Type tok;
+
+ if (level > (_pSLang_Compile_BOSEOS & SLANG_BOSEOS_VALUE_BITS))
+ return 0;
+
+ tok.type = BOS_TOKEN;
+ tok.v.long_val = t->line_number;
+ (*_pSLcompile_ptr) (&tok);
+ return 1;
+}
+static void append_eos (void)
+{
+ /* This is commented out to ensure that if bos was compiled, the eos will be.
+ *
+ * if (0 == (_pSLang_Compile_Line_Num_Info & SLANG_BOSEOS_MASK))
+ * return;
+ */
+ append_token_of_type (EOS_TOKEN);
+}
+
+static int append_bos (_pSLang_Token_Type *t, int level)
+{
+ _pSLang_Token_Type tok;
+
+ if (level > (_pSLang_Compile_BOSEOS & SLANG_BOSEOS_VALUE_BITS))
+ return 0;
+
+ init_token (&tok);
+ tok.type = BOS_TOKEN;
+ tok.v.long_val = t->line_number;
+
+ append_token (&tok);
+ free_token (&tok);
+ return 1;
+}
+#endif
+
+static void statement (_pSLang_Token_Type *);
+static void loop_statement (_pSLang_Token_Type *);
+static void compound_statement (_pSLang_Token_Type *);
+static void expression_with_parenthesis (_pSLang_Token_Type *);
+static void handle_semicolon (_pSLang_Token_Type *);
+static void handle_for_statement (_pSLang_Token_Type *);
+static void handle_foreach_statement (_pSLang_Token_Type *);
+static void statement_list (_pSLang_Token_Type *);
+static void variable_list (_pSLang_Token_Type *, unsigned char);
+static void struct_declaration (_pSLang_Token_Type *, int);
+static void define_function_args (_pSLang_Token_Type *);
+static void typedef_definition (_pSLang_Token_Type *);
+static void function_args_expression (_pSLang_Token_Type *, int, int, int, unsigned int *);
+static void expression (_pSLang_Token_Type *);
+static void expression_with_commas (_pSLang_Token_Type *, int);
+static void simple_expression (_pSLang_Token_Type *);
+static void unary_expression (_pSLang_Token_Type *);
+static void postfix_expression (_pSLang_Token_Type *);
+static int check_for_lvalue (unsigned char, _pSLang_Token_Type *);
+/* static void primary_expression (_pSLang_Token_Type *); */
+static void block (_pSLang_Token_Type *);
+static void loop_block (_pSLang_Token_Type *);
+static void inline_array_expression (_pSLang_Token_Type *);
+static void inline_list_expression (_pSLang_Token_Type *);
+static void array_index_expression (_pSLang_Token_Type *);
+static void do_multiple_assignment (_pSLang_Token_Type *);
+static void try_multiple_assignment (_pSLang_Token_Type *);
+static void handle_try_statement (_pSLang_Token_Type *);
+static void handle_throw_statement (_pSLang_Token_Type *);
+
+#if 0
+static void not_implemented (char *what)
+{
+ char err 256;
+ sprintf (err, "Expression not implemented: %s", what);
+ _pSLparse_error (SL_NOT_IMPLEMENTED, err, NULL, 0);
+}
+#endif
+static void rpn_parse_line (_pSLang_Token_Type *tok)
+{
+ do
+ {
+	 /* multiple RPN tokens possible when the file looks like:
+	 * . <end of line>
+	 * . <end of line>
+	 */
+	if (tok->type != RPN_TOKEN)
+	 compile_token (tok);
+	free_token (tok);
+ }
+ while (EOF_TOKEN != _pSLget_rpn_token (tok));
+}
+
+static int get_identifier_token (_pSLang_Token_Type *tok, int string_ok)
+{
+ int type = get_token (tok);
+
+ if ((type == IDENT_TOKEN)
+ || (string_ok && (type == STRING_TOKEN)))
+ return 0;
+
+ if (string_ok && (tok->flags & SLTOKEN_VALUE_IS_RESERVED))
+ {
+	if (EOF_TOKEN == _pSLtoken_init_slstring_token (tok, IDENT_TOKEN, tok->v.s_val, strlen(tok->v.s_val)))
+	 return -1;
+	return 0;
+ }
+
+ _pSLparse_error (SL_SYNTAX_ERROR, "Expecting identifier", tok, 0);
+ return -1;
+}
+
+static void define_function (_pSLang_Token_Type *ctok, unsigned char type)
+{
+ _pSLang_Token_Type fname;
+
+ switch (type)
+ {
+ case STATIC_TOKEN:
+	type = DEFINE_STATIC_TOKEN;
+	break;
+
+ case PUBLIC_TOKEN:
+	type = DEFINE_PUBLIC_TOKEN;
+	break;
+
+ case PRIVATE_TOKEN:
+	type = DEFINE_PRIVATE_TOKEN;
+ }
+
+ init_token (&fname);
+ if (-1 == get_identifier_token (&fname, 0))
+ {
+	free_token (&fname);
+	return;
+ }
+
+ compile_token_of_type(OPAREN_TOKEN);
+ get_token (ctok);
+ define_function_args (ctok);
+ compile_token_of_type(FARG_TOKEN);
+
+ if (ctok->type == OBRACE_TOKEN)
+ {
+	int loop_context = In_Looping_Context;
+	In_Looping_Context = 0;
+	compound_statement(ctok);
+	In_Looping_Context = loop_context;
+ }
+
+ else if (ctok->type != SEMICOLON_TOKEN)
+ {
+	_pSLparse_error(SL_SYNTAX_ERROR, "Expecting {", ctok, 0);
+	free_token (&fname);
+	return;
+ }
+
+ fname.type = type;
+ compile_token (&fname);
+ free_token (&fname);
+}
+
+/* This is called from "statement", which is expected to return no
+ * new token.
+ */
+static int check_for_loop_then_else (_pSLang_Token_Type *ctok)
+{
+ int b = 0;
+
+ get_token (ctok);
+
+ while (1)
+ {
+	_pSLtok_Type type = ctok->type;
+#ifdef LOOP_ELSE_TOKEN
+	if ((type == ELSE_TOKEN) && ((b & 1) == 0))
+	 {
+	 get_token (ctok);
+	 block (ctok);
+	 compile_token_of_type (LOOP_ELSE_TOKEN);
+	 get_token (ctok);
+	 b |= 1;
+	 continue;
+	 }
+#endif
+	if ((type == THEN_TOKEN) && ((b & 2) == 0))
+	 {
+	 get_token (ctok);
+	 block (ctok);
+	 compile_token_of_type (LOOP_THEN_TOKEN);
+	 b |= 2;
+#ifdef LOOP_ELSE_TOKEN
+	 get_token (ctok);
+	 continue;
+#else
+	 return b;
+#endif
+	 }
+	break;
+ }
+ unget_token (ctok);
+ return b;
+}
+
+/* statement:
+ *	 compound-statement
+ *	 if ( expression ) statement
+ *	 if ( expression ) statement else statement
+ *	 !if ( expression ) statement
+ *	 loop ( expression ) statement
+ *	 _for ( expression ) statement
+ * foreach ( expression ) statement
+ * foreach (expression ) using (expression-list) statement
+ *	 while ( expression ) statement
+ *	 do statement while (expression) ;
+ *	 for ( expressionopt ; expressionopt ; expressionopt ) statement
+ *	 ERROR_BLOCK statement
+ * try statement rest-of-try-statement
+ * throw exception, object
+ *	 EXIT_BLOCK statement
+ *	 USER_BLOCK0 statement
+ *	 USER_BLOCK1 statement
+ *	 USER_BLOCK2 statement
+ *	 USER_BLOCK3 statement
+ *	 USER_BLOCK4 statement
+ *	 forever statement
+ *	 break ;
+ *	 continue ;
+ *	 return expressionopt ;
+ *	 variable variable-list ;
+ *	 struct struct-decl ;
+ *	 define identifier function-args ;
+ *	 define identifier function-args compound-statement
+ *	 switch ( expression ) statement
+ *	 rpn-line
+ *	 at-line
+ *	 push ( expression )
+ *	 ( expression ) = expression ;
+ *	 expression ;
+ * expression :
+ */
+
+/* Note: This function does not return with a new token. It is up to the
+ * calling routine to handle that.
+ */
+static void statement (_pSLang_Token_Type *ctok)
+{
+ unsigned char type;
+#if SLANG_HAS_BOSEOS
+ int eos;
+#endif
+ if (_pSLang_Error)
+ return;
+
+ LLT->parse_level += 1;
+
+ switch (ctok->type)
+ {
+ case OBRACE_TOKEN:
+	compound_statement (ctok);
+	break;
+
+ case IF_TOKEN:
+ case IFNOT_TOKEN:
+	type = ctok->type;
+	get_token (ctok);
+#if SLANG_HAS_BOSEOS
+	eos = compile_bos (ctok, 2);
+#endif
+	expression_with_parenthesis (ctok);
+#if SLANG_HAS_BOSEOS
+	if (eos) compile_eos ();
+#endif
+	block (ctok);
+
+	if (ELSE_TOKEN != get_token (ctok))
+	 {
+	 compile_token_of_type (type);
+	 unget_token (ctok);
+	 break;
+	 }
+	get_token (ctok);
+	block (ctok);
+	if (type == IF_TOKEN) type = ELSE_TOKEN; else type = NOTELSE_TOKEN;
+	compile_token_of_type (type);
+	break;
+
+ /* case IFNOT_TOKEN: */
+ case _FOR_TOKEN:
+	get_token (ctok);
+	handle_for_statement (ctok);
+	if (0 == check_for_loop_then_else (ctok))
+	 compile_token_of_type (NOP_TOKEN);
+	break;
+
+ case LOOP_TOKEN:
+	get_token (ctok);
+#if SLANG_HAS_BOSEOS
+	eos = compile_bos (ctok, 2);
+#endif
+	expression_with_parenthesis (ctok);
+#if SLANG_HAS_BOSEOS
+	if (eos) compile_eos ();
+#endif
+	loop_block (ctok);
+	compile_token_of_type (LOOP_TOKEN);
+	if (0 == check_for_loop_then_else (ctok))
+	 compile_token_of_type (NOP_TOKEN);
+	break;
+
+ case FOREACH_TOKEN:
+	get_token (ctok);
+	handle_foreach_statement (ctok);
+	if (0 == check_for_loop_then_else (ctok))
+	 compile_token_of_type (NOP_TOKEN);
+	break;
+
+ case WHILE_TOKEN:
+	get_token (ctok);
+	compile_token_of_type (OBRACE_TOKEN);
+#if SLANG_HAS_BOSEOS
+	eos = compile_bos (ctok, 2);
+#endif
+	expression_with_parenthesis (ctok);
+#if SLANG_HAS_BOSEOS
+	if (eos) compile_eos ();
+#endif
+	compile_token_of_type (CBRACE_TOKEN);
+	loop_block (ctok);
+	compile_token_of_type (WHILE_TOKEN);
+	if (0 == check_for_loop_then_else (ctok))
+	 compile_token_of_type (NOP_TOKEN);
+	break;
+
+ case DO_TOKEN:
+	get_token (ctok);
+	loop_block (ctok);
+
+	if (WHILE_TOKEN != get_token (ctok))
+	 {
+	 _pSLparse_error(SL_SYNTAX_ERROR, "Expecting while", ctok, 0);
+	 break;
+	 }
+
+	get_token (ctok);
+
+	compile_token_of_type (OBRACE_TOKEN);
+#if SLANG_HAS_BOSEOS
+	eos = compile_bos (ctok, 2);
+#endif
+	expression_with_parenthesis (ctok);
+#if SLANG_HAS_BOSEOS
+	if (eos) compile_eos ();
+#endif
+	compile_token_of_type (CBRACE_TOKEN);
+	compile_token_of_type (DOWHILE_TOKEN);
+	handle_semicolon (ctok);
+	if (0 == check_for_loop_then_else (ctok))
+	 compile_token_of_type (NOP_TOKEN);
+	break;
+
+ case FOR_TOKEN:
+	/* Look for (exp_opt ; exp_opt ; exp_opt ) */
+
+	if (OPAREN_TOKEN != get_token (ctok))
+	 {
+	 _pSLparse_error(SL_SYNTAX_ERROR, "Expecting (.", ctok, 0);
+	 break;
+	 }
+
+	if (NULL == push_token_list ())
+	 break;
+
+	append_token_of_type (OBRACE_TOKEN);
+	if (SEMICOLON_TOKEN != get_token (ctok))
+	 {
+#if SLANG_HAS_BOSEOS
+	 eos = append_bos (ctok, 2);
+#endif
+	 expression (ctok);
+#if SLANG_HAS_BOSEOS
+	 if (eos) append_eos ();
+#endif
+	 if (ctok->type != SEMICOLON_TOKEN)
+	 {
+		 _pSLparse_error(SL_SYNTAX_ERROR, "Expecting ;", ctok, 0);
+		 break;
+	 }
+	 }
+	append_token_of_type (CBRACE_TOKEN);
+
+	append_token_of_type (OBRACE_TOKEN);
+	if (SEMICOLON_TOKEN == get_token (ctok))
+	 {
+	 (void) append_int_as_token (1);
+	 }
+	else
+	 {
+#if SLANG_HAS_BOSEOS
+	 eos = append_bos (ctok, 2);
+#endif
+	 expression (ctok);
+#if SLANG_HAS_BOSEOS
+	 if (eos) append_eos ();
+#endif
+	 if (ctok->type != SEMICOLON_TOKEN)
+	 {
+		 _pSLparse_error(SL_SYNTAX_ERROR, "Expecting ;", ctok, 0);
+		 break;
+	 }
+	 }
+	append_token_of_type (CBRACE_TOKEN);
+	append_token_of_type (OBRACE_TOKEN);
+	if (CPAREN_TOKEN != get_token (ctok))
+	 {
+#if SLANG_HAS_BOSEOS
+	 eos = append_bos (ctok, 2);
+#endif
+	 expression (ctok);
+#if SLANG_HAS_BOSEOS
+	 if (eos) append_eos ();
+#endif
+	 if (ctok->type != CPAREN_TOKEN)
+	 {
+		 _pSLparse_error(SL_SYNTAX_ERROR, "Expecting ).", ctok, 0);
+		 break;
+	 }
+	 }
+	append_token_of_type (CBRACE_TOKEN);
+
+	compile_token_list ();
+
+	get_token (ctok);
+	loop_block (ctok);
+	compile_token_of_type (FOR_TOKEN);
+	if (0 == check_for_loop_then_else (ctok))
+	 compile_token_of_type (NOP_TOKEN);
+	break;
+
+ case FOREVER_TOKEN:
+	get_token (ctok);
+	loop_block (ctok);
+	compile_token_of_type (FOREVER_TOKEN);
+	if (0 == check_for_loop_then_else (ctok))
+	 compile_token_of_type (NOP_TOKEN);
+	break;
+
+ case ERRBLK_TOKEN:
+ case EXITBLK_TOKEN:
+ case USRBLK0_TOKEN:
+ case USRBLK1_TOKEN:
+ case USRBLK2_TOKEN:
+ case USRBLK3_TOKEN:
+ case USRBLK4_TOKEN:
+	type = ctok->type;
+	get_token (ctok);
+	block (ctok);
+	compile_token_of_type (type);
+	break;
+
+ case BREAK_TOKEN:
+ case CONT_TOKEN:
+	if (In_Looping_Context == 0)
+	 {
+	 _pSLparse_error (SL_SYNTAX_ERROR, "`break' or `continue' requires a looping context", ctok, 0);
+	 break;
+	 }
+
+	type = ctok->type;
+#if SLANG_HAS_BOSEOS
+	eos = compile_bos (ctok, 3);
+#endif
+	if (SEMICOLON_TOKEN != get_token (ctok))
+	 {
+	 if ((ctok->type != INT_TOKEN)
+		 || (ctok->v.long_val <= 0))
+	 {
+		 _pSLparse_error (SL_SYNTAX_ERROR, "Expecting a positive non-zero integer or a semi-colon.", ctok, 0);
+		 break;
+	 }
+	 ctok->type = (type == BREAK_TOKEN) ? BREAK_N_TOKEN : CONT_N_TOKEN;
+	 compile_token (ctok);
+	 get_token (ctok);
+	 handle_semicolon (ctok);
+	 }
+	else compile_token_of_type (type);
+#if SLANG_HAS_BOSEOS
+	if (eos) compile_eos ();
+#endif
+	break;
+
+ case RETURN_TOKEN:
+	if (SEMICOLON_TOKEN != get_token (ctok))
+	 {
+	 if (NULL == push_token_list ())
+	 break;
+
+#if SLANG_HAS_BOSEOS
+	 eos = append_bos (ctok, 3);
+#endif
+	 expression (ctok);
+#if SLANG_HAS_BOSEOS
+	 if (eos) append_eos ();
+#endif
+
+	 if (ctok->type != SEMICOLON_TOKEN)
+	 {
+		 _pSLparse_error (SL_SYNTAX_ERROR, "Expecting ;", ctok, 0);
+		 break;
+	 }
+	 compile_token_list ();
+	 }
+	compile_token_of_type (RETURN_TOKEN);
+	handle_semicolon (ctok);
+	break;
+
+ case STATIC_TOKEN:
+ case PRIVATE_TOKEN:
+ case PUBLIC_TOKEN:
+	type = ctok->type;
+	get_token (ctok);
+	if (ctok->type == VARIABLE_TOKEN)
+	 {
+	 get_token (ctok);
+	 variable_list (ctok, type);
+	 handle_semicolon (ctok);
+	 break;
+	 }
+	if (ctok->type == DEFINE_TOKEN)
+	 {
+	 define_function (ctok, type);
+	 break;
+	 }
+	_pSLparse_error (SL_SYNTAX_ERROR, "Expecting 'variable' or 'define'", ctok, 0);
+	break;
+
+ case VARIABLE_TOKEN:
+	get_token (ctok);
+	variable_list (ctok, OBRACKET_TOKEN);
+	handle_semicolon (ctok);
+	break;
+
+ case TYPEDEF_TOKEN:
+	get_token (ctok);
+	if (NULL == push_token_list ())
+	 break;
+	typedef_definition (ctok);
+	compile_token_list ();
+
+	handle_semicolon (ctok);
+	break;
+
+ case DEFINE_TOKEN:
+	define_function (ctok, DEFINE_TOKEN);
+	break;
+
+ case TRY_TOKEN:
+	get_token (ctok);
+	handle_try_statement (ctok);
+	break;
+
+ case THROW_TOKEN:
+	get_token (ctok);
+	handle_throw_statement (ctok);
+	break;
+
+ case SWITCH_TOKEN:
+	get_token (ctok);
+#if SLANG_HAS_BOSEOS
+	eos = compile_bos (ctok, 2);
+#endif
+	expression_with_parenthesis (ctok);
+#if SLANG_HAS_BOSEOS
+	if (eos) compile_eos ();
+#endif
+
+	while ((_pSLang_Error == 0)
+	 && (OBRACE_TOKEN == ctok->type))
+	 {
+	 compile_token_of_type (OBRACE_TOKEN);
+	 compound_statement (ctok);
+	 compile_token_of_type (CBRACE_TOKEN);
+	 get_token (ctok);
+	 }
+	compile_token_of_type (SWITCH_TOKEN);
+	unget_token (ctok);
+	break;
+
+ case EOF_TOKEN:
+	break;
+#if 0
+ case PUSH_TOKEN:
+	get_token (ctok);
+	expression_list_with_parenthesis (ctok);
+	handle_semicolon (ctok);
+	break;
+#endif
+
+ case SEMICOLON_TOKEN:
+#if SLANG_HAS_BOSEOS
+	eos = compile_bos (ctok, 3);
+	if (eos) compile_eos ();
+#endif
+	handle_semicolon (ctok);
+	break;
+
+ case RPN_TOKEN:
+	if (POUND_TOKEN == get_token (ctok))
+	 _pSLcompile_byte_compiled ();
+	else if (ctok->type != EOF_TOKEN)
+	 rpn_parse_line (ctok);
+	break;
+
+ case OPAREN_TOKEN:	 /* multiple assignment */
+#if SLANG_HAS_BOSEOS
+	eos = compile_bos(ctok, 1);
+#endif
+	try_multiple_assignment (ctok);
+	if (ctok->type == COLON_TOKEN)
+	 compile_token_of_type (COLON_TOKEN);
+	else handle_semicolon (ctok);
+#if SLANG_HAS_BOSEOS
+	if (eos) compile_eos();
+#endif
+	break;
+
+ default:
+
+#if SLANG_HAS_BOSEOS
+	eos = compile_bos(ctok, ctok->type != CASE_TOKEN ? 1 : 2);
+#endif
+	if (NULL == push_token_list ())
+	 break;
+
+	expression (ctok);
+	compile_token_list ();
+
+#if SLANG_HAS_BOSEOS
+	if (eos) compile_eos ();
+#endif
+
+	if (ctok->type == COLON_TOKEN)
+	 compile_token_of_type (COLON_TOKEN);
+	else handle_semicolon (ctok);
+	break;
+ }
+
+ LLT->parse_level -= 1;
+}
+
+static void loop_statement (_pSLang_Token_Type *ctok)
+{
+ In_Looping_Context++;
+ statement (ctok);
+ In_Looping_Context--;
+}
+
+/* This function does not return a new token. Calling routine must do that */
+static void block (_pSLang_Token_Type *ctok)
+{
+ compile_token_of_type (OBRACE_TOKEN);
+ statement (ctok);
+ compile_token_of_type (CBRACE_TOKEN);
+}
+
+static void loop_block (_pSLang_Token_Type *ctok)
+{
+ compile_token_of_type (OBRACE_TOKEN);
+ loop_statement (ctok);
+ compile_token_of_type (CBRACE_TOKEN);
+}
+
+/* It is important that the caller wrap this with push_token_list/compile_token_list */
+static int simple_expressions_with_paren (_pSLang_Token_Type *ctok)
+{
+ int n = 0;
+
+ if (ctok->type != OPAREN_TOKEN)
+ {
+	_pSLparse_error(SL_SYNTAX_ERROR, "Expecting (", ctok, 0);
+	return -1;
+ }
+
+ (void) get_token (ctok);
+ while (_pSLang_Error == 0)
+ {
+	if (ctok->type == COMMA_TOKEN)
+	 {
+	 _pSLparse_error (SL_SYNTAX_ERROR, "Misplaced ','", ctok, 0);
+	 return -1;
+	 }
+
+	simple_expression (ctok);
+	n++;
+
+	if (ctok->type == CPAREN_TOKEN)
+	 {
+	 if (-1 == get_token (ctok))
+	 return -1;
+
+	 return n;
+	 }
+	if (ctok->type != COMMA_TOKEN)
+	 {
+	 _pSLparse_error (SL_SYNTAX_ERROR, "Expecting a ',' or ')'", ctok, 0);
+	 return -1;
+	 }
+	(void) get_token (ctok);
+ }
+
+ return -1;
+}
+
+static void handle_for_statement (_pSLang_Token_Type *ctok)
+{
+ _pSLang_Token_Type tok_buf;
+ _pSLang_Token_Type *ident_token = NULL;
+ int n;
+#if SLANG_HAS_BOSEOS
+ int eos;
+#endif
+
+ if (ctok->type == IDENT_TOKEN)
+ {
+	tok_buf = *ctok;
+	ident_token = &tok_buf;
+	init_token (ctok);
+	get_token (ctok);
+ }
+#if SLANG_HAS_BOSEOS
+ eos = compile_bos(ctok, 2);
+#endif
+
+ if (NULL == push_token_list ())
+ return;
+
+ if (-1 == (n = simple_expressions_with_paren (ctok)))
+ return;
+
+ if (n == 2)			 /* _for (a, b) */
+ {
+	n++;
+	append_int_as_token (1);
+ }
+ if (n != 3)
+ {
+	_pSLparse_error (SL_SYNTAX_ERROR, "Invalid number of control variables in _for statement", ctok, 1);
+	return;
+ }
+ (void) compile_token_list ();
+
+#if SLANG_HAS_BOSEOS
+ if (eos) compile_eos ();
+#endif
+
+ compile_token_of_type (OBRACE_TOKEN);
+ if (ident_token != NULL)
+ {
+	ident_token->type = _SCALAR_ASSIGN_TOKEN;
+	compile_token (ident_token);
+	free_token (ident_token);
+ }
+ loop_statement (ctok);
+ compile_token_of_type (CBRACE_TOKEN);
+
+ compile_token_of_type (_FOR_TOKEN);
+}
+
+static int init_identifier_token (_pSLang_Token_Type *t, SLFUTURE_CONST char *name)
+{
+ init_token (t);
+
+ if (EOF_TOKEN == _pSLtoken_init_slstring_token (t, IDENT_TOKEN, name, strlen(name)))
+ return -1;
+
+ return 0;
+}
+
+/* The try-statement looks like:
+ *
+ * TRY ev_optional catch_blocks_opt finally_block_opt
+ *
+ * ev_optional:
+ * nil
+ * ( e , v)
+ *
+ * catch_blocks_opt:
+ * catch_blocks_opt catch_block
+ * catch_block:
+ * CATCH exception-list : block
+ * CATCH exception-list ;
+ * exception-list:
+ * expression
+ * exception-list , exception
+ *
+ * finally_block_opt:
+ * FINALLY: block
+ *
+ * The above gets compiled into the form:
+ *
+ * {ev_block} {try-statements}
+ * {exception-list}{catch-block}
+ * .
+ * .
+ * {exception-list}{catch-block}
+ * {finally_block} try
+ */
+
+static void handle_try_statement (_pSLang_Token_Type *ctok)
+{
+ int num_catches;
+
+ /* start ev_block */
+ if (NULL == push_token_list ())
+ return;
+
+ append_token_of_type (OBRACE_TOKEN);
+ if (ctok->type == OPAREN_TOKEN)
+ {
+	_pSLang_Token_Type e;
+	if (-1 == init_identifier_token (&e, "__get_exception_info"))
+	 return;
+
+	append_token (&e);
+	free_token (&e);
+
+	get_token (ctok);
+	postfix_expression (ctok);
+	check_for_lvalue (ASSIGN_TOKEN, NULL);
+
+	if (ctok->type != CPAREN_TOKEN)
+	 {
+	 _pSLparse_error (SL_SYNTAX_ERROR, "Expecting )", ctok, 0);
+	 return;
+	 }
+	get_token (ctok);
+ }
+ append_token_of_type (CBRACE_TOKEN);
+ compile_token_list ();
+
+ /* Now the try block itself */
+ block (ctok);
+
+ /* Now the various catch blocks */
+ num_catches = 0;
+ while (CATCH_TOKEN == get_token (ctok))
+ {
+	/* Expecting catch expression-list: */
+	compile_token_of_type (OBRACE_TOKEN);
+	get_token (ctok);
+
+	push_token_list ();
+
+	while (_pSLang_Error == 0)
+	 {
+	 if (ctok->type == COLON_TOKEN)
+	 break;
+
+	 simple_expression (ctok);
+	 if (ctok->type != COMMA_TOKEN)
+	 break;
+	 get_token (ctok);
+	 }
+
+	if (ctok->type == COLON_TOKEN)
+	 get_token (ctok);
+	else if (ctok->type != SEMICOLON_TOKEN)
+	 {
+	 _pSLparse_error (SL_SYNTAX_ERROR, "Expecting a colon to end the exception list", ctok, 0);
+	 return;
+	 }
+	compile_token_list ();
+
+	compile_token_of_type (CBRACE_TOKEN);
+
+	/* catch block */
+	block (ctok);
+	num_catches++;
+ }
+
+ if ((num_catches == 0)
+ && (ctok->type != FINALLY_TOKEN))
+ {
+	_pSLparse_error (SL_SYNTAX_ERROR, "Expecting \"catch\" or \"finally\"", ctok, 0);
+	return;
+ }
+
+ /* finally */
+ if (ctok->type == FINALLY_TOKEN)
+ {
+	get_token (ctok);
+	if (ctok->type == COLON_TOKEN)
+	 get_token (ctok);
+	block (ctok);
+ }
+ else
+ {
+	/* since this is called directly from statement, we need to get only
+	 * tokens that were used. So, since we are not using this, put it back.
+	 */
+	unget_token (ctok);
+	compile_token_of_type (OBRACE_TOKEN);
+	compile_token_of_type (CBRACE_TOKEN);
+ }
+ compile_token_of_type (TRY_TOKEN);
+}
+
+/*
+ * throw-statement:
+ * throw ;
+ * throw exception_expr ;
+ * throw exception_expr , simple_expression
+ * throw exception_expr , simple_expression ;
+ * throw exception_expr , simple_expression, simple_expression ;
+ */
+static void handle_throw_statement (_pSLang_Token_Type *ctok)
+{
+ push_token_list ();
+
+ if (ctok->type == SEMICOLON_TOKEN)
+ append_token_of_type (ARG_TOKEN);
+ else
+ {
+#if SLANG_HAS_BOSEOS
+	int eos = append_bos (ctok, 2);
+#endif
+	append_token_of_type (ARG_TOKEN);
+	simple_expression (ctok);
+	if (ctok->type == COMMA_TOKEN)
+	 {
+	 get_token (ctok);
+	 simple_expression (ctok);
+	 }
+	if (ctok->type == COMMA_TOKEN)
+	 {
+	 get_token (ctok);
+	 simple_expression (ctok);
+	 }
+	handle_semicolon (ctok);
+ /* not-necessary -- append_token_of_type (EARG_TOKEN); */
+#if SLANG_HAS_BOSEOS
+	if (eos) append_eos ();
+#endif
+ }
+ compile_token_list ();
+ compile_token_of_type (THROW_TOKEN);
+}
+
+static _pSLang_Token_Type *allocate_token (void)
+{
+ _pSLang_Token_Type *v;
+
+ v = (_pSLang_Token_Type *)SLmalloc (sizeof (_pSLang_Token_Type));
+ if (v == NULL)
+ return NULL;
+
+ init_token (v);
+ return v;
+}
+
+static void handle_foreach_statement (_pSLang_Token_Type *ctok)
+{
+ _pSLang_Token_Type *var_tokens = NULL;
+ _pSLang_Token_Type *v;
+#if SLANG_HAS_BOSEOS
+ int eos;
+#endif
+
+#if SLANG_HAS_BOSEOS
+ eos = compile_bos (ctok, 2);
+#endif
+ /* I may want to make this a separate routine */
+ while (ctok->type == IDENT_TOKEN)
+ {
+	v = (_pSLang_Token_Type *)SLmalloc (sizeof (_pSLang_Token_Type));
+	if (v == NULL)
+	 goto free_return;
+	init_token (v);
+	*v = *ctok;
+	init_token (ctok);
+	v->next = var_tokens;
+	var_tokens = v;
+	get_token (ctok);
+	if (ctok->type != COMMA_TOKEN)
+	 break;
+	get_token (ctok);
+ }
+
+ expression_with_parenthesis (ctok);
+#if SLANG_HAS_BOSEOS
+ if (eos) compile_eos ();
+#endif
+
+ if (NULL == push_token_list ())
+ goto free_return;
+
+ append_token_of_type (ARG_TOKEN);
+ if (ctok->type == USING_TOKEN)
+ {
+	if (OPAREN_TOKEN != get_token (ctok))
+	 {
+	 _pSLparse_error (SL_SYNTAX_ERROR, "Expected 'using ('", ctok, 0);
+	 goto free_return;
+	 }
+	get_token (ctok);
+	function_args_expression (ctok, 0, 0, 0, NULL);
+ }
+ /* append_token_of_type (EARG_TOKEN); // This is now handled by the
+ * FOREACH_TOKEN itself. Doing it presents a problem if a hook gets
+ * called when the loop_statements are being parsed. This can and will
+ * happen when slsh calls its massage_input hook. The would result in
+ * bytecode such as:
+ * __args <using-expression> __eargs __args <hookargs> __eargs hook
+ * As a result, the first __args/__eargs info will be lost. By allowing
+ * __foreach__ to handle it, we effectively get the proper nested
+ * __args/__eargs form:
+ * __args <using-expression> __args <hookargs> __eargs hook __eargs __foreach
+ *
+ * Yes, this is subtle. Always follow the rule: Avoid __args/__eargs
+ * outside a token list and make sure the code that uses it is either also
+ * in the same token list, or implicitely calls __eargs.
+ */
+
+ compile_token_list ();
+
+ compile_token_of_type (OBRACE_TOKEN);
+
+ v = var_tokens;
+ while (v != NULL)
+ {
+	v->type = _SCALAR_ASSIGN_TOKEN;
+	compile_token (v);
+	v = v->next;
+ }
+
+ loop_statement (ctok);
+
+ compile_token_of_type (CBRACE_TOKEN);
+ compile_token_of_type (FOREACH_EARGS_TOKEN);
+
+ free_return:
+ while (var_tokens != NULL)
+ {
+	v = var_tokens->next;
+	free_token (var_tokens);
+	SLfree ((char *) var_tokens);
+	var_tokens = v;
+ }
+}
+
+/*
+ * statement-list:
+ *	 statement
+ *	 statement-list statement
+ */
+static void statement_list (_pSLang_Token_Type *ctok)
+{
+ while ((_pSLang_Error == 0)
+	 && (ctok->type != CBRACE_TOKEN)
+	 && (ctok->type != EOF_TOKEN))
+ {
+	statement(ctok);
+	get_token (ctok);
+ }
+}
+
+/* compound-statement:
+ *	 { statement-list }
+ */
+static void compound_statement (_pSLang_Token_Type *ctok)
+{
+ /* ctok->type is OBRACE_TOKEN here */
+ get_token (ctok);
+ statement_list(ctok);
+ if (CBRACE_TOKEN != ctok->type)
+ {
+	_pSLparse_error (SL_SYNTAX_ERROR, "Expecting '}'", ctok, 0);
+	return;
+ }
+}
+
+/* This function is only called from statement. */
+static void expression_with_parenthesis (_pSLang_Token_Type *ctok)
+{
+ if (ctok->type != OPAREN_TOKEN)
+ {
+	_pSLparse_error(SL_SYNTAX_ERROR, "Expecting (", ctok, 0);
+	return;
+ }
+
+ if (NULL == push_token_list ())
+ return;
+
+ get_token (ctok);
+ expression (ctok);
+
+ if (ctok->type != CPAREN_TOKEN)
+ _pSLparse_error(SL_SYNTAX_ERROR, "Expecting )", ctok, 0);
+
+ compile_token_list ();
+
+ get_token (ctok);
+}
+
+static void handle_semicolon (_pSLang_Token_Type *ctok)
+{
+ if ((ctok->type == SEMICOLON_TOKEN)
+ || (ctok->type == EOF_TOKEN))
+ return;
+
+ _pSLparse_error (SL_SYNTAX_ERROR, "Expecting ;", ctok, 0);
+}
+
+void _pSLparse_start (SLang_Load_Type *llt)
+{
+ _pSLang_Token_Type ctok;
+ SLang_Load_Type *save_llt;
+ unsigned int save_use_next_token;
+ _pSLang_Token_Type save_next_token;
+ Token_List_Type *save_list;
+ int save_looping_context = In_Looping_Context;
+#if SLANG_HAS_DEBUG_CODE
+ int save_last_line_number = Last_Line_Number;
+
+ Last_Line_Number = -1;
+#endif
+ save_use_next_token = Use_Next_Token;
+ save_next_token = Next_Token;
+ save_list = Token_List;
+ save_llt = LLT;
+ LLT = llt;
+
+ init_token (&Next_Token);
+ Use_Next_Token = 0;
+ In_Looping_Context = 0;
+ init_token (&ctok);
+ get_token (&ctok);
+
+ llt->parse_level = 0;
+ statement_list (&ctok);
+
+ if (_pSLang_Error == 0)
+ {
+	if (ctok.type != EOF_TOKEN)
+	 _pSLparse_error (SL_SYNTAX_ERROR, "Parse ended prematurely", &ctok, 0);
+	else
+	 compile_token_of_type (EOF_TOKEN);
+ }
+
+ if (_pSLang_Error)
+ {
+	if (_pSLang_Error < 0)	 /* severe error */
+	 save_list = NULL;
+
+	while (Token_List != save_list)
+	 {
+	 if (-1 == pop_token_list (1))
+	 break;		 /* ??? when would this happen? */
+	 }
+ }
+
+ free_token (&ctok);
+ LLT = save_llt;
+ if (Use_Next_Token)
+ free_token (&Next_Token);
+ Use_Next_Token = save_use_next_token;
+ Next_Token = save_next_token;
+ In_Looping_Context = save_looping_context;
+
+#if SLANG_HAS_DEBUG_CODE
+ Last_Line_Number = save_last_line_number;
+#endif
+}
+
+/* variable-list:
+ * 	variable-decl
+ * 	variable-decl variable-list
+ *
+ * variable-decl:
+ * 	identifier
+ * 	identifier = simple-expression
+ */
+static void variable_list (_pSLang_Token_Type *name_token, unsigned char variable_type)
+{
+ int declaring;
+ _pSLang_Token_Type tok;
+
+ if (name_token->type != IDENT_TOKEN)
+ {
+	_pSLparse_error (SL_SYNTAX_ERROR, "Expecting a variable name", name_token, 0);
+	return;
+ }
+
+ declaring = 0;
+ do
+ {
+	if (declaring == 0)
+	 {
+	 declaring = 1;
+	 compile_token_of_type (variable_type);
+	 }
+
+	compile_token (name_token);
+
+	init_token (&tok);
+	if (ASSIGN_TOKEN == get_token (&tok))
+	 {
+#if SLANG_HAS_BOSEOS
+	 int eos;
+#endif
+	 compile_token_of_type (CBRACKET_TOKEN);
+	 declaring = 0;
+
+	 get_token (&tok);
+#if SLANG_HAS_BOSEOS
+	 eos = compile_bos (&tok, 1);
+#endif
+	 push_token_list ();
+	 simple_expression (&tok);
+	 compile_token_list ();
+
+	 name_token->type = _SCALAR_ASSIGN_TOKEN;
+	 compile_token (name_token);
+#if SLANG_HAS_BOSEOS
+	 if (eos) compile_eos ();
+#endif
+	 }
+
+	free_token (name_token);
+	*name_token = tok;
+ }
+ while ((name_token->type == COMMA_TOKEN)
+	 && (IDENT_TOKEN == get_token (name_token)));
+
+ if (declaring) compile_token_of_type (CBRACKET_TOKEN);
+}
+
+static void free_token_linked_list (_pSLang_Token_Type *tok)
+{
+ while (tok != NULL)
+ {
+	_pSLang_Token_Type *next = tok->next;
+	free_token (tok);
+	if (tok->num_refs != 0)
+	 {
+	 _pSLang_verror (SL_INTERNAL_ERROR, "Cannot free token in linked list");
+	 }
+	else
+	 SLfree ((char *) tok);
+
+	tok = next;
+ }
+}
+
+/* This works with any string-like token */
+static int prefix_token_sval_field (_pSLang_Token_Type *tok, SLFUTURE_CONST char *prefix)
+{
+ char buf2*SL_MAX_TOKEN_LEN;
+ size_t len, prefix_len;
+
+ prefix_len = strlen (prefix);
+ len = _pSLstring_bytelen (tok->v.s_val); /* sign */
+ if (len + prefix_len >= sizeof(buf))
+ {
+	_pSLparse_error (SL_BUILTIN_LIMIT_EXCEEDED, "Number too long for buffer", tok, 1);
+	return -1;
+ }
+ memcpy (buf, prefix, prefix_len);
+ memcpy (buf+prefix_len, tok->v.s_val, len); /* copys \0 */
+ (*tok->free_val_func)(tok);
+ if (EOF_TOKEN == _pSLtoken_init_slstring_token (tok, tok->type, buf, len+prefix_len))
+ return -1;
+
+ return 0;
+}
+
+/*
+ * This function parses a structure definition block. It returns the names
+ * of the structure fields in the form of a linked list of tokens.
+ *
+ * If the structure contains assignments, the function parses the expressions and returns the
+ * number of such assignments. So:
+ *
+ * foo = foo_expr, bar = bar_expr, ...
+ *
+ * generates: foo_expr_tokens "foo" bar_expr_tokens "bar" ...
+ */
+static _pSLang_Token_Type *
+ handle_struct_assign_list (_pSLang_Token_Type *ctok, int assign_ok, unsigned int *nassignp)
+{
+ _pSLang_Token_Type *name_list_root = NULL;
+ _pSLang_Token_Type *name_list_tail = NULL;
+ unsigned int n, m;
+ char buf64;
+
+ n = m = 0;
+ while (_pSLang_Error == 0)
+ {
+	_pSLang_Token_Type *new_tok;
+	int is_deref = 0;
+
+	if (assign_ok && (ctok->type == DEREF_TOKEN))
+	 {
+	 /* struct { @ expr, ... } */
+
+	 (void) SLsnprintf (buf, sizeof(buf), "@%d", n);
+	 free_token (ctok);
+	 if (EOF_TOKEN == _pSLtoken_init_slstring_token (ctok, STRING_TOKEN, buf, strlen (buf)))
+	 break;
+
+	 is_deref = 1;
+	 }
+	else
+	 {
+	 if ((IDENT_TOKEN != ctok->type) && (ctok->type != STRING_TOKEN))
+	 {
+		 if (0 == (ctok->flags & SLTOKEN_VALUE_IS_RESERVED))
+		 break;
+		 /* Allow field names such as "public", ... */
+		 if (EOF_TOKEN == _pSLtoken_init_slstring_token (ctok, STRING_TOKEN, ctok->v.s_val, strlen(ctok->v.s_val)))
+		 break;
+	 }
+	 }
+
+	new_tok = allocate_token ();
+	if (new_tok == NULL)
+	 break;
+
+	*new_tok = *ctok;
+	new_tok->type = STRING_TOKEN;
+
+	init_token (ctok);
+
+	if (name_list_root == NULL)
+	 name_list_tail = name_list_root = new_tok;
+	else
+	 name_list_tail->next = new_tok;
+	name_list_tail = new_tok;
+
+	n++;
+
+	if ((COMMA_TOKEN == get_token (ctok))
+	 && (is_deref == 0))
+	 {
+	 get_token (ctok);
+	 continue;
+	 }
+
+	if (assign_ok == 0)
+	 break;
+
+	if ((ASSIGN_TOKEN == ctok->type) || is_deref)
+	 {
+	 /* name = ... */
+#if SLANG_HAS_BOSEOS
+	 int eos = append_bos (ctok, 2);
+#endif
+	 if (is_deref == 0)
+	 get_token (ctok);
+
+	 simple_expression (ctok);
+#if SLANG_HAS_BOSEOS
+	 if (eos) append_eos ();
+#endif
+
+	 if (-1 == append_copy_of_string_token (new_tok))
+	 break;
+
+	 m++;
+
+	 if (ctok->type != COMMA_TOKEN)
+	 break;
+
+	 get_token (ctok);
+	 continue;
+	 }
+
+	break;
+ }
+
+ if (_pSLang_Error)
+ {
+	free_token_linked_list (name_list_root);
+	return NULL;
+ }
+
+ if (n == 0)
+ {
+	_pSLparse_error (SL_SYNTAX_ERROR, "Expecting a qualifier", ctok, 0);
+	return NULL;
+ }
+
+ *nassignp = m;
+ return name_list_root;
+}
+
+static int handle_struct_fields (_pSLang_Token_Type *ctok, int assign_ok)
+{
+ _pSLang_Token_Type *name_list, *next;
+ unsigned int n, m;
+
+ if (NULL == (name_list = handle_struct_assign_list (ctok, assign_ok, &m)))
+ return -1;
+
+ n = 0;
+ next = name_list;
+ while (next != NULL)
+ {
+	if (-1 == append_token (next))
+	 break;
+	next = next->next;
+	n++;
+ }
+ free_token_linked_list (name_list);
+
+ if (_pSLang_Error)
+ return -1;
+
+ append_int_as_token (n);
+ if (m == 0)
+ append_token_of_type (STRUCT_TOKEN);
+ else
+ {
+	append_int_as_token (m);
+	append_token_of_type (STRUCT_WITH_ASSIGN_TOKEN);
+ }
+
+ if (_pSLang_Error)
+ return -1;
+
+ return 0;
+}
+
+/* struct-declaration:
+ * 	struct { struct-field-list };
+ *
+ * struct-field-list:
+ * 	struct-field-name = simple_expr, struct-field-list
+ * 	struct-field-name = simple_expr
+ *
+ * Generates code:
+ * "field-name-1" ... "field-name-N" N STRUCT_TOKEN
+ * - OR -
+ * expr-k1 "field-name-k1" ... expr-kM "field-name-kM"
+ * "name-1" ... "field-name-N" N M STRUCT_DEF_ASSIGN_TOKEN
+ */
+static void struct_declaration (_pSLang_Token_Type *ctok, int assign_ok)
+{
+ if (ctok->type != OBRACE_TOKEN)
+ {
+	_pSLparse_error (SL_SYNTAX_ERROR, "Expecting {", ctok, 0);
+	return;
+ }
+ get_token (ctok);
+
+ if (-1 == handle_struct_fields (ctok, assign_ok))
+ return;
+
+ if (ctok->type != CBRACE_TOKEN)
+ {
+	_pSLparse_error (SL_SYNTAX_ERROR, "Expecting }", ctok, 0);
+	return;
+ }
+ get_token (ctok);
+}
+
+/* struct-declaration:
+ * 	typedef struct { struct-field-list } Type_Name;
+ *
+ * struct-field-list:
+ * 	struct-field-name , struct-field-list
+ * 	struct-field-name
+ *
+ * Generates code: "field-name-1" ... "field-name-N" N STRUCT_TOKEN typedef
+ */
+static void typedef_definition (_pSLang_Token_Type *t)
+{
+
+ if (t->type != STRUCT_TOKEN)
+ {
+	_pSLparse_error (SL_SYNTAX_ERROR, "Expecting `struct'", t, 0);
+	return;
+ }
+ get_token (t);
+
+ struct_declaration (t, 0);
+ if (t->type != IDENT_TOKEN)
+ {
+	_pSLparse_error (SL_SYNTAX_ERROR, "Expecting identifier", t, 0);
+	return;
+ }
+
+ t->type = STRING_TOKEN;
+ append_token (t);
+ append_token_of_type (TYPEDEF_TOKEN);
+
+ get_token (t);
+}
+
+/* function-args:
+ * 	( args-dec-opt )
+ *
+ * args-decl-opt:
+ * 	identifier
+ * 	args-decl , identifier
+ */
+static void define_function_args (_pSLang_Token_Type *ctok)
+{
+ if (CPAREN_TOKEN == get_token (ctok))
+ {
+	get_token (ctok);
+	return;
+ }
+
+ compile_token_of_type(OBRACKET_TOKEN);
+
+ while ((_pSLang_Error == 0)
+	 && (ctok->type == IDENT_TOKEN))
+ {
+	compile_token (ctok);
+	if (COMMA_TOKEN != get_token (ctok))
+	 break;
+
+	get_token (ctok);
+ }
+
+ if (CPAREN_TOKEN != ctok->type)
+ {
+	_pSLparse_error(SL_SYNTAX_ERROR, "Expecting )", ctok, 0);
+	return;
+ }
+ compile_token_of_type(CBRACKET_TOKEN);
+
+ get_token (ctok);
+}
+
+void try_multiple_assignment (_pSLang_Token_Type *ctok)
+{
+ /* This is called with ctok->type == OPAREN_TOKEN. We have no idea
+ * what follows this. There are various possibilities such as:
+ * @ () = x;
+ * @ ( expression ) = x;
+ * @ ( expression ) ;
+ * @ ( expression ) OP expression;
+ * @ ( expression ) expression = expression;
+ * and only the first two constitute a multiple assignment. The last
+ * two forms create the difficulty.
+ *
+ * Here is the plan. First parse (expression) and then check next token.
+ * If it is an equal operator, then it will be parsed as a multiple
+ * assignment. In fact, that is the easy part.
+ *
+ * The hard part stems from the fact that by parsing (expression), we
+ * have effectly truncated the parse if (expression) is part of a binary
+ * or unary expression. Somehow, the parsing must be resumed. The trick
+ * here is to use a dummy literal that generates no code: NO_OP_LITERAL
+ * Using it, we just call 'expression' and proceed.
+ */
+
+ if (NULL == push_token_list ())
+ return;
+
+ get_token (ctok);
+
+ if (ctok->type != CPAREN_TOKEN)
+ {
+	expression_with_commas (ctok, 1);
+	if (ctok->type != CPAREN_TOKEN)
+	 {
+	 _pSLparse_error (SL_SYNTAX_ERROR, "Expecting )", ctok, 0);
+	 return;
+	 }
+ }
+
+ switch (get_token (ctok))
+ {
+ case ASSIGN_TOKEN:
+ case PLUSEQS_TOKEN:
+ case MINUSEQS_TOKEN:
+ case TIMESEQS_TOKEN:
+ case DIVEQS_TOKEN:
+ case BOREQS_TOKEN:
+ case BANDEQS_TOKEN:
+	do_multiple_assignment (ctok);
+	pop_token_list (1);
+	break;
+
+ default:
+	unget_token (ctok);
+	ctok->type = NO_OP_LITERAL;
+	expression (ctok);
+	compile_token_list ();
+	break;
+ }
+}
+
+/* assignment-expression:
+ * simple_expression
+ * simple_expression assign-op simple_expression
+ * simple_expression ++
+ * simple_expression --
+ * ++ simple_expression
+ * -- simple_expression
+ */
+static void assignment_expression (_pSLang_Token_Type *ctok)
+{
+ unsigned int start_pos, end_pos;
+ unsigned char type;
+
+ if (Token_List == NULL)
+ return;
+
+ type = ctok->type;
+ if ((type == PLUSPLUS_TOKEN) || (type == MINUSMINUS_TOKEN))
+ {
+	get_token (ctok);
+	simple_expression (ctok);
+	check_for_lvalue (type, NULL);
+	return;
+ }
+ start_pos = Token_List->len;
+
+ if (ctok->type == NO_OP_LITERAL)
+ {
+	/* This is called from try_multiple_assignment with a new token list.
+	 * The tokens added to that list collectively make up a object that
+	 * is treated as a literal. Reset the list start position to
+	 * those start of those elements.
+	 */
+	start_pos = 0;
+ }
+ simple_expression (ctok);
+ switch (ctok->type)
+ {
+ case PLUSPLUS_TOKEN:
+ case MINUSMINUS_TOKEN:
+	check_for_lvalue (ctok->type, NULL);
+	get_token (ctok);
+	break;
+
+ case ASSIGN_TOKEN:
+ case PLUSEQS_TOKEN:
+ case MINUSEQS_TOKEN:
+ case TIMESEQS_TOKEN:
+ case DIVEQS_TOKEN:
+ case BOREQS_TOKEN:
+ case BANDEQS_TOKEN:
+	end_pos = Token_List->len;
+	check_for_lvalue (ctok->type, NULL);
+	get_token (ctok);
+	simple_expression (ctok);
+	token_list_element_exchange (start_pos, end_pos);
+	break;
+ }
+}
+
+/* Note: expression never gets compiled directly. Rather, it gets
+ * appended to the token list and then compiled by a calling
+ * routine.
+ */
+
+/* expression:
+ *	 assignment_expression
+ *	 assignment_expression, expression
+ * <none>
+ */
+static void expression_with_commas (_pSLang_Token_Type *ctok, int save_comma)
+{
+ while (_pSLang_Error == 0)
+ {
+	if (ctok->type != COMMA_TOKEN)
+	 {
+	 if (ctok->type == CPAREN_TOKEN)
+	 return;
+
+	 assignment_expression (ctok);
+
+	 if (ctok->type != COMMA_TOKEN)
+	 break;
+	 }
+	if (save_comma) append_token (ctok);
+	get_token (ctok);
+ }
+}
+
+static void expression (_pSLang_Token_Type *ctok)
+{
+ expression_with_commas (ctok, 0);
+}
+
+/* priority levels of binary operations */
+static unsigned char Binop_Level =
+{
+/* SC_AND_TOKEN */	10,
+/* SC_OR_TOKEN */	12,
+/* POW_TOKEN */		0, /* This case is handled in unary expression so that -x^2 == -(x^2) */
+/* ADD_TOKEN */		2,
+/* SUB_TOKEN */		2,
+/* MUL_TOKEN */		1,
+/* DIV_TOKEN */		1,
+/* LT_TOKEN */		4,
+/* LE_TOKEN */		4,
+/* GT_TOKEN */		4,
+/* GE_TOKEN */		4,
+/* EQ_TOKEN */		4,
+/* NE_TOKEN */		4,
+/* AND_TOKEN */		9,
+/* OR_TOKEN */		11,
+/* MOD_TOKEN */		1,
+/* BAND_TOKEN */	6,
+/* SHL_TOKEN */		3,
+/* SHR_TOKEN */		3,
+/* BXOR_TOKEN */	7,
+/* BOR_TOKEN */		8,
+/* POUND_TOKEN */	1 /* Matrix Multiplication */
+};
+
+static void handle_binary_sequence (_pSLang_Token_Type *, unsigned char);
+static void handle_sc_sequence (_pSLang_Token_Type *ctok, unsigned char level)
+{
+ unsigned char type = ctok->type;
+
+ while ((ctok->type == type) && (_pSLang_Error == 0))
+ {
+	append_token_of_type (OBRACE_TOKEN);
+	get_token (ctok);
+	unary_expression (ctok);
+	handle_binary_sequence (ctok, level);
+	append_token_of_type (CBRACE_TOKEN);
+ }
+ append_token_of_type (type);
+}
+
+/* unary0 OP1 unary1 OP2 unary2 ... OPN unaryN
+ * ==> unary0 unary1 ... unaryN {OP1 OP2 ... OPN} COMPARE_BLOCK
+ */
+static void handle_compare_sequence (_pSLang_Token_Type *ctok, unsigned char level)
+{
+ unsigned char op_stack 64;
+ unsigned int op_num = 0;
+ unsigned int i;
+
+ do
+ {
+	if (op_num >= sizeof(op_stack))
+	 {
+	 _pSLparse_error (SL_BUILTIN_LIMIT_EXCEEDED, "Too many comparison operators", ctok, 0);
+	 return;
+	 }
+	op_stackop_num++ = ctok->type;
+	get_token (ctok);
+	unary_expression (ctok);
+	handle_binary_sequence (ctok, level);
+ }
+ while (IS_COMPARE_OP(ctok->type) && (_pSLang_Error == 0));
+
+ if (op_num == 1)
+ {
+	append_token_of_type (op_stack0);
+	return;
+ }
+
+ append_token_of_type (OBRACE_TOKEN);
+ for (i = 0; i < op_num; i++)
+ append_token_of_type (op_stacki);
+ append_token_of_type (CBRACE_TOKEN);
+ append_token_of_type (_COMPARE_TOKEN);
+}
+
+static void handle_binary_sequence (_pSLang_Token_Type *ctok, unsigned char max_level)
+{
+ unsigned char op_stack 64;
+ unsigned char level_stack 64;
+ unsigned int op_num;
+ unsigned char type;
+
+ op_num = 0;
+ type = ctok->type;
+
+ while ((_pSLang_Error == 0)
+	 && (IS_BINARY_OP(type)))
+ {
+	unsigned char level = Binop_Leveltype - FIRST_BINARY_OP;
+	if (level >= max_level)
+	 break;
+
+	while ((op_num > 0) && (level_stack op_num - 1 <= level))
+	 append_token_of_type (op_stack --op_num);
+
+	if ((type == SC_AND_TOKEN) || (type == SC_OR_TOKEN))
+	 {
+	 handle_sc_sequence (ctok, level);
+	 type = ctok->type;
+	 continue;
+	 }
+
+	if (IS_COMPARE_OP(type))
+	 {
+	 handle_compare_sequence (ctok, level);
+	 type = ctok->type;
+	 continue;
+	 }
+	if (op_num >= sizeof (op_stack) - 1)
+	 {
+	 _pSLparse_error (SL_BUILTIN_LIMIT_EXCEEDED, "Binary op stack overflow", ctok, 0);
+	 return;
+	 }
+
+	op_stack op_num = type;
+	level_stack op_num = level;
+	op_num++;
+
+	get_token (ctok);
+	unary_expression (ctok);
+	type = ctok->type;
+ }
+
+ while (op_num > 0)
+ append_token_of_type(op_stack--op_num);
+}
+
+/* % Note: simple-expression groups operators OP1 at same level. The
+ * % actual implementation will not do this.
+ * simple-expression:
+ * simple-expression ? simple-expression : simple-expression
+ *	 unary-expression
+ *	 binary-expression BINARY-OP unary-expression
+ * andelse xxelse-expression-list
+ * orelse xxelse-expression-list
+ *
+ * xxelse-expression-list:
+ * 	{ expression }
+ * 	xxelse-expression-list { expression }
+ * binary-expression:
+ * unary-expression
+ * unary-expression BINARY-OP binary-expression
+ */
+static void simple_expression (_pSLang_Token_Type *ctok)
+{
+ unsigned char type;
+
+ switch (ctok->type)
+ {
+ case ANDELSE_TOKEN:
+ case ORELSE_TOKEN:
+	type = ctok->type;
+	if (OBRACE_TOKEN != get_token (ctok))
+	 {
+	 _pSLparse_error (SL_SYNTAX_ERROR, "Expecting '{'", ctok, 0);
+	 return;
+	 }
+
+	while (ctok->type == OBRACE_TOKEN)
+	 {
+	 append_token (ctok);
+	 get_token (ctok);
+	 expression (ctok);
+	 if (CBRACE_TOKEN != ctok->type)
+	 {
+		 _pSLparse_error(SL_SYNTAX_ERROR, "Expecting }", ctok, 0);
+		 return;
+	 }
+	 append_token (ctok);
+	 get_token (ctok);
+	 }
+	append_token_of_type (type);
+	return;
+
+	/* avoid unary-expression if possible */
+ case STRING_TOKEN:
+	append_token (ctok);
+	get_token (ctok);
+	break;
+
+ default:
+	unary_expression (ctok);
+	break;
+ }
+
+ if (SEMICOLON_TOKEN == (type = ctok->type))
+ return;
+
+ handle_binary_sequence (ctok, 0xFF);
+
+ if (ctok->type == QUESTION_TOKEN)
+ {
+	append_token_of_type (OBRACE_TOKEN);
+	get_token (ctok);
+	simple_expression (ctok);
+	if (ctok->type != COLON_TOKEN)
+	 {
+	 _pSLparse_error (SL_SYNTAX_ERROR, "Expecting a colon in the ternary expression", ctok, 0);
+	 return;
+	 }
+	append_token_of_type (CBRACE_TOKEN);
+	get_token (ctok);
+	append_token_of_type (OBRACE_TOKEN);
+	simple_expression (ctok);
+	append_token_of_type (CBRACE_TOKEN);
+	append_token_of_type (ELSE_TOKEN);
+ }
+}
+
+static int negate_float_type_token (_pSLang_Token_Type *tok)
+{
+ return prefix_token_sval_field (tok, "-");
+}
+
+/* unary-expression:
+ *	 postfix-expression
+ *	 case unary-expression
+ *	 OP3 unary-expression
+ *	 (OP3: + - ~ & not)
+ *
+ * Note: This grammar permits: case case case WHATEVER
+ */
+static void unary_expression (_pSLang_Token_Type *ctok)
+{
+ unsigned char save_unary_ops 16;
+ unsigned int num_unary_ops;
+ unsigned char type;
+#if 0
+ _pSLang_Token_Type *last_token;
+#endif
+ num_unary_ops = 0;
+ while (_pSLang_Error == 0)
+ {
+	type = ctok->type;
+
+	switch (type)
+	 {
+#if 0
+	 case PLUSPLUS_TOKEN:
+	 case MINUSMINUS_TOKEN:
+	 get_token (ctok);
+	 postfix_expression (ctok);
+	 check_for_lvalue (type, NULL);
+	 goto out_of_switch;
+#endif
+	 case ADD_TOKEN:
+	 get_token (ctok);	 /* skip it-- it's unary here */
+	 break;
+
+	 case SUB_TOKEN:
+	 (void) get_token (ctok);
+	 if (ctok->flags & SLTOKEN_TYPE_NUMBER)
+	 {
+		 _pSLang_Token_Type *last_token;
+		 postfix_expression (ctok);
+		 if ((NULL != (last_token = get_last_token ()))
+		 && (last_token->flags & SLTOKEN_TYPE_NUMBER))
+		 {
+		 if (last_token->flags & SLTOKEN_TYPE_FLOAT)
+			 {
+			 if (-1 == negate_float_type_token (last_token))
+			 return;
+			 }
+		 else if (-1 == check_number_token_overflow (last_token, -1))
+			 return;
+		 }
+		 else
+		 {
+		 if (num_unary_ops == 16)
+			 goto stack_overflow_error;
+		 save_unary_ops num_unary_ops++ = CHS_TOKEN;
+		 }
+		 goto out_of_switch;
+	 }
+	 if (num_unary_ops == 16)
+	 goto stack_overflow_error;
+	 save_unary_ops num_unary_ops++ = CHS_TOKEN;
+	 break;
+#if 0
+	 case DEREF_TOKEN:
+#endif
+	 case BNOT_TOKEN:
+	 case NOT_TOKEN:
+	 case CASE_TOKEN:
+	 if (num_unary_ops == 16)
+	 goto stack_overflow_error;
+
+	 save_unary_ops num_unary_ops++ = type;
+	 get_token (ctok);
+	 break;
+
+	 /* Try to avoid ->postfix_expression->primary_expression
+	 * subroutine calls.
+	 */
+	 case STRING_TOKEN:
+	 append_token (ctok);
+	 get_token (ctok);
+	 goto out_of_switch;
+
+	 default:
+	 postfix_expression (ctok);
+	 goto out_of_switch;
+	 }
+ }
+
+ out_of_switch:
+ while (num_unary_ops)
+ {
+	num_unary_ops--;
+	append_token_of_type (save_unary_ops num_unary_ops);
+ }
+ return;
+
+ stack_overflow_error:
+ _pSLparse_error (SL_BUILTIN_LIMIT_EXCEEDED, "Too many unary operators.", ctok, 0);
+}
+
+static int combine_namespace_tokens (_pSLang_Token_Type *a, _pSLang_Token_Type *b)
+{
+ SLFUTURE_CONST char *sa, *sb;
+ char *sc;
+ size_t lena, lenb;
+ unsigned long hash;
+
+ /* This is somewhat of a hack. Combine the TWO identifier names
+ * (NAMESPACE) and (name) into the form NAMESPACE->name. Then when the
+ * byte compiler compiles the object it will not be found. It will then
+ * check for this hack and make the appropriate namespace lookup.
+ */
+
+ sa = a->v.s_val;
+ sb = b->v.s_val;
+
+ lena = strlen (sa);
+ lenb = strlen (sb);
+
+ sc = (char *)SLmalloc (lena + lenb + 3);
+ if (sc == NULL)
+ return -1;
+
+ strcpy (sc, sa);
+ strcpy (sc + lena, "->");
+ strcpy (sc + lena + 2, sb);
+
+ sb = _pSLstring_make_hashed_string (sc, lena + lenb + 2, &hash);
+ SLfree (sc);
+ if (sb == NULL)
+ return -1;
+
+ /* I can free this string because no other token should be referencing it.
+ * (num_refs == 1).
+ */
+ _pSLfree_hashed_string ((char *) sa, lena, a->hash);
+ a->v.s_val = sb;
+ a->hash = hash;
+
+ return 0;
+}
+
+static void append_identifier_token (_pSLang_Token_Type *ctok)
+{
+ _pSLang_Token_Type *last_token;
+
+ append_token (ctok);
+
+ if (NAMESPACE_TOKEN != get_token (ctok))
+ return;
+
+ if (IDENT_TOKEN != get_token (ctok))
+ {
+	_pSLparse_error (SL_SYNTAX_ERROR, "Expecting name-space identifier", ctok, 0);
+	return;
+ }
+
+ if (NULL == (last_token = get_last_token ()))
+ {
+	if (_pSLang_Error == 0)
+	 _pSLang_verror (SL_INTERNAL_ERROR, "get_last_token returned NULL in append_identifier_token");
+	return;
+ }
+ if (-1 == combine_namespace_tokens (last_token, ctok))
+ return;
+
+ (void) get_token (ctok);
+}
+
+static int get_identifier_expr_token (_pSLang_Token_Type *ctok)
+{
+ _pSLang_Token_Type next_token;
+
+ if (-1 == get_identifier_token (ctok, 0))
+ return -1;
+
+ init_token (&next_token);
+ if (NAMESPACE_TOKEN != get_token (&next_token))
+ {
+	unget_token (&next_token);
+	return IDENT_TOKEN;
+ }
+
+ if (-1 == get_identifier_token (&next_token, 0))
+ {
+	free_token (&next_token);
+	return -1;
+ }
+
+ if (-1 == combine_namespace_tokens (ctok, &next_token))
+ {
+	free_token (&next_token);
+	return -1;
+ }
+ free_token (&next_token);
+ return 0;
+}
+
+/* postfix-expression:
+ * @ postfix-expression
+ *	 primary-expression
+ *	 postfix-expression expression 
+ *	 postfix-expression ( function-args-expression )
+ *	 postfix-expression . identifier
+ * postfix-expression ^ unary-expression
+ *
+ * Not yet supported:
+ *	 postfix-expression ++
+ *	 postfix-expression --
+ *	 postfix-expression = simple-expression
+ *	 postfix-expression += simple-expression
+ *	 postfix-expression -= simple-expression
+ *
+ * primary-expression:
+ *	literal
+ *	identifier-expr
+ *	( expression_opt )
+ * 	 inline-array-expression 
+ * { inline-list-expression }
+ * 	&identifier-expr
+ * struct-definition
+ * __tmp(identifier-expr)
+ *
+ * identifier-expr:
+ * identifier
+ * identifier->identifier
+ */
+static void postfix_expression (_pSLang_Token_Type *ctok)
+{
+ unsigned int start_pos;
+ _pSLang_Token_Type *last_token;
+
+ if (Token_List == NULL)
+ return;
+
+ start_pos = Token_List->len;
+
+ switch (ctok->type)
+ {
+#if 1
+ case DEREF_TOKEN:
+	get_token (ctok);
+	postfix_expression (ctok);
+	append_token_of_type (DEREF_TOKEN);
+	break;
+#endif
+ case IDENT_TOKEN:
+	append_identifier_token (ctok);
+	break;
+
+ case CHAR_TOKEN:
+ case SHORT_TOKEN:
+ case INT_TOKEN:
+ case LONG_TOKEN:
+ case UCHAR_TOKEN:
+ case USHORT_TOKEN:
+ case UINT_TOKEN:
+ case ULONG_TOKEN:
+#ifdef HAVE_LONG_LONG
+ case LLONG_TOKEN:
+ case ULLONG_TOKEN:
+#endif
+ case STRING_TOKEN:
+ case BSTRING_TOKEN:
+#ifdef SLANG_HAS_FLOAT
+ case DOUBLE_TOKEN:
+ case FLOAT_TOKEN:
+ case LDOUBLE_TOKEN:
+#endif
+#ifdef SLANG_HAS_COMPLEX
+ case COMPLEX_TOKEN:
+#endif
+ case STRING_DOLLAR_TOKEN:
+ case MULTI_STRING_TOKEN:
+	append_token (ctok);
+	get_token (ctok);
+	if (ctok->type == OPAREN_TOKEN)
+	 _pSLparse_error(SL_SYNTAX_ERROR, "Literal constant is not callable", ctok, 1);
+	break;
+
+ case OPAREN_TOKEN:
+	if (CPAREN_TOKEN != get_token (ctok))
+	 {
+	 expression (ctok);
+	 if (ctok->type != CPAREN_TOKEN)
+	 _pSLparse_error(SL_SYNTAX_ERROR, "Expecting )", ctok, 0);
+	 }
+	get_token (ctok);
+	break;
+
+ case BAND_TOKEN:
+#if 0
+	if (-1 == get_identifier_expr_token (ctok))
+	 break;
+
+	ctok->type = _REF_TOKEN;
+	append_token (ctok);
+	get_token (ctok);
+	if ((ctok->type == OBRACKET_TOKEN) || (ctok->type == DOT_TOKEN))
+	 _pSLparse_error (SL_NOT_IMPLEMENTED, "& of an array or structure element is not currently supported", ctok, 0);
+#else
+	get_token (ctok);
+	postfix_expression (ctok);
+	last_token = get_last_token ();
+	if (last_token == NULL)
+	 {
+	 if (_pSLang_Error == 0)
+	 _pSLang_verror (SL_SYNTAX_ERROR, "Misplaced &");
+	 return;
+	 }
+	switch (last_token->type)
+	 {
+	 case IDENT_TOKEN:
+	 last_token->type = _REF_TOKEN;
+	 break;
+	 case ARRAY_TOKEN:
+	 last_token->type = _ARRAY_ELEM_REF_TOKEN;
+	 break;
+	 case DOT_TOKEN:
+	 last_token->type = _STRUCT_FIELD_REF_TOKEN;
+	 break;
+	 default:
+	 _pSLparse_error (SL_NOT_IMPLEMENTED, "& not supported in this context", last_token, 0);
+	 }
+#endif
+	break;
+
+ case OBRACKET_TOKEN:
+	get_token (ctok);
+	inline_array_expression (ctok);
+	break;
+
+ case OBRACE_TOKEN:
+	get_token (ctok);
+	inline_list_expression (ctok);
+	break;
+
+ case NO_OP_LITERAL:
+	/* This token was introduced by try_multiple_assignment. There,
+	 * a new token_list was pushed and (expression) was evaluated.
+	 * NO_OP_LITERAL represents the result of expression. However,
+	 * we need to tweak the start_pos variable to point to the beginning
+	 * of the token list to complete the equivalence.
+	 */
+	start_pos = 0;
+	get_token (ctok);
+	break;
+
+ case STRUCT_TOKEN:
+	get_token (ctok);
+	struct_declaration (ctok, 1);
+	break;
+
+ case TMP_TOKEN:
+	get_token (ctok);
+	if (ctok->type == OPAREN_TOKEN)
+	 {
+	 if (-1 != get_identifier_expr_token (ctok))
+	 {
+		 ctok->type = TMP_TOKEN;
+		 append_token (ctok);
+		 get_token (ctok);
+		 if (ctok->type == CPAREN_TOKEN)
+		 {
+		 get_token (ctok);
+		 break;
+		 }
+	 }
+	 }
+	_pSLparse_error (SL_SYNTAX_ERROR, "Expecting form __tmp(NAME)", ctok, 0);
+	break;
+
+ default:
+#ifdef IS_INTERNAL_FUNC
+	if (IS_INTERNAL_FUNC(ctok->type))
+	 {
+	 append_token (ctok);
+	 get_token (ctok);
+	 }
+	else
+#endif
+	 _pSLparse_error(SL_SYNTAX_ERROR, "Expecting a PRIMARY", ctok, 0);
+ }
+
+ while (_pSLang_Error == 0)
+ {
+	unsigned int end_pos = Token_List->len;
+	unsigned char type = ctok->type;
+	switch (type)
+	 {
+	 case OBRACKET_TOKEN:	 /* Xargs ==> args X ARRAY */
+	 get_token (ctok);
+	 append_token_of_type (ARG_TOKEN);
+	 if (ctok->type != CBRACKET_TOKEN)
+	 array_index_expression (ctok);
+
+	 if (ctok->type != CBRACKET_TOKEN)
+	 {
+		 _pSLparse_error (SL_SYNTAX_ERROR, "Expecting ''", ctok, 0);
+		 return;
+	 }
+	 get_token (ctok);
+	 /* append_token_of_type (EARG_TOKEN); -- ARRAY_TOKEN implicitely does this */
+	 token_list_element_exchange (start_pos, end_pos);
+	 append_token_of_type (ARRAY_TOKEN);
+	 break;
+
+	 case OPAREN_TOKEN:
+	 /* f(args) ==> args f */
+	 if ((NULL != (last_token = get_last_token ()))
+		 && (last_token->type == DEREF_TOKEN))
+	 {
+		 /* Expressions such as (@Ai)(args...) */
+		 last_token->type = _DEREF_FUNCALL_TOKEN;
+		 append_token_of_type (ARG_TOKEN);
+		 (void) get_token (ctok);
+		 function_args_expression (ctok, 0, 1, 1, NULL);
+		 /* Now we have: ... @ __args ...
+		 * and we want: ... __args ... @
+		 */
+		 /* token_list_element_exchange (start_pos, end_pos); */
+		 token_list_element_exchange (end_pos-1, end_pos);
+		 break;
+	 }
+
+	 if (CPAREN_TOKEN != get_token (ctok))
+	 {
+		 function_args_expression (ctok, 1, 1, 1, NULL);
+		 token_list_element_exchange (start_pos, end_pos);
+	 }
+	 else get_token (ctok);
+	 break;
+
+	 case DOT_TOKEN:
+	 /* S.a ==> "a" S DOT
+	 * This means that if S is Xb, then Xb.a ==> a b X ARRAY DOT
+	 * and f(a).Xb.c ==> "c" b "X" a f . ARRAY .
+	 * Also, f(a).Xb = g(x); ==> x g b "X" a f .
+	 */
+	 if (-1 == get_identifier_token (ctok, 1))
+	 return;
+
+	 ctok->type = DOT_TOKEN;
+	 append_token (ctok);
+	 get_token (ctok);
+#ifdef DOT_METHOD_CALL_TOKEN
+	 if (ctok->type == OPAREN_TOKEN)
+	 {
+		 unsigned int qual_pos, meth_pos, x_pos, y_pos;
+		 /* This case is a bit tricky for expressions such as:
+		 * foo(x;q1).bar(y;q2)
+		 * ^
+		 * Here, '^' denotes the parse point. The token list looks
+		 * roughly like:
+		 * __arg x q1 __earg foo bar .
+		 */
+		 if (NULL == (last_token = get_last_token ()))
+		 return;
+		 last_token->type = DOT_METHOD_CALL_TOKEN;
+		 x_pos = start_pos;
+		 y_pos = Token_List->len;
+		 meth_pos = y_pos-1;
+		 append_token_of_type (ARG_TOKEN);
+		 get_token (ctok);
+		 function_args_expression (ctok, 0, 1, 1, &qual_pos);
+		 if (_pSLang_Error)
+		 break;
+		 end_pos = Token_List->len;
+		 /* At this point, the token list looks like:
+		 * __arg x q1 __earg foo methcall(bar) __arg y q2
+		 * x^ m^ y^ q^
+		 * where ^ denotes the meth, x, y, and qual positions.
+		 * We want to rearrange this to be:
+		 * __arg y __arg x q1 __earg foo q2 methcall(bar)
+		 * Do it in 3 stages:
+		 */
+		 token_list_element_exchange (x_pos, y_pos);
+		 /* __arg y q2 __arg x q1 __earg foo methcall(bar)
+		 * y^ q^ x^ m^
+		 */
+		 qual_pos = start_pos + (qual_pos-y_pos);
+		 meth_pos = meth_pos + (end_pos-y_pos);
+		 x_pos = start_pos + (end_pos-y_pos);
+		 token_list_element_exchange (qual_pos, x_pos);
+		 /* __arg y __arg x q1 __earg foo methcall(bar) q2
+		 * y^ x^ m^ q^
+		 */
+		 meth_pos = meth_pos - (x_pos - qual_pos);
+		 qual_pos = qual_pos + (end_pos-x_pos);
+		 token_list_element_exchange (meth_pos, qual_pos);
+	 }
+#endif
+	 break;
+
+#if 0
+	 case PLUSPLUS_TOKEN:
+	 case MINUSMINUS_TOKEN:
+	 check_for_lvalue (type, NULL);
+	 get_token (ctok);
+	 break;
+	 case ASSIGN_TOKEN:
+	 case PLUSEQS_TOKEN:
+	 case MINUSEQS_TOKEN:
+	 case TIMESEQS_TOKEN:
+	 case DIVEQS_TOKEN:
+	 case BOREQS_TOKEN:
+	 case BANDEQS_TOKEN:
+	 check_for_lvalue (type, NULL);
+	 get_token (ctok);
+	 simple_expression (ctok);
+	 token_list_element_exchange (start_pos, end_pos);
+	 break;
+#endif
+#if 1
+	 case POW_TOKEN:
+	 get_token (ctok);
+	 unary_expression (ctok);
+	 append_token_of_type (POW_TOKEN);
+	 break;
+#endif
+	 default:
+	 return;
+	 }
+ }
+}
+
+/* This function is used for more than function arguments */
+static void function_args_expression (_pSLang_Token_Type *ctok, int handle_num_args, int handle_qualifiers,
+				 int is_function,
+				 unsigned int *qual_posp)
+{
+ unsigned char last_type, this_type;
+ int has_qualifiers = 0;
+
+ if (handle_num_args) append_token_of_type (ARG_TOKEN);
+
+ last_type = (ctok->type == COMMA_TOKEN) ? COMMA_TOKEN : 0;
+
+ while (_pSLang_Error == 0)
+ {
+	this_type = ctok->type;
+
+	switch (this_type)
+	 {
+	 case COMMA_TOKEN:
+	 if (last_type == COMMA_TOKEN)
+	 append_token_of_type (_NULL_TOKEN);
+	 get_token (ctok);
+	 break;
+
+	 case CPAREN_TOKEN:
+	 if (last_type == COMMA_TOKEN)
+	 append_token_of_type (_NULL_TOKEN);
+
+	 if (handle_num_args) append_token_of_type (EARG_TOKEN);
+
+	 if ((qual_posp != NULL) && (has_qualifiers == 0))
+	 *qual_posp = Token_List->len;
+
+	 get_token (ctok);
+	 if (is_function && (ctok->type == OPAREN_TOKEN))
+	 _pSLparse_error (SL_SYNTAX_ERROR, "A '(' is not permitted here", ctok, 0);
+	 return;
+
+	 case SEMICOLON_TOKEN:
+	 if (handle_qualifiers)
+	 {
+		 if (last_type == COMMA_TOKEN)
+		 append_token_of_type (_NULL_TOKEN);
+
+		 if (qual_posp != NULL)
+		 *qual_posp = Token_List->len;
+
+		 has_qualifiers = 1;
+
+		 if (SEMICOLON_TOKEN == get_token (ctok))
+		 {
+		 /* foo (args... ;; q) form */
+		 if (CPAREN_TOKEN == get_token (ctok))
+			 break; /* foo (args ;;) */
+		 simple_expression (ctok);
+		 }
+		 else if (ctok->type == CPAREN_TOKEN)
+		 break;	 /* foo (args;) */
+		 else if (-1 == handle_struct_fields (ctok, 1))
+		 return;
+
+		 append_token_of_type (QUALIFIER_TOKEN);
+		 if (ctok->type != CPAREN_TOKEN)
+		 _pSLparse_error (SL_SYNTAX_ERROR, "Expecting ')'", ctok, 0);
+		 break;
+	 }
+	 /* drop */
+
+	 default:
+	 simple_expression (ctok);
+	 if ((ctok->type != COMMA_TOKEN)
+		 && (ctok->type != CPAREN_TOKEN)
+		 && ((handle_qualifiers == 0)
+		 || (ctok->type != SEMICOLON_TOKEN)))
+	 {
+		 _pSLparse_error (SL_SYNTAX_ERROR, "Expecting ')'", ctok, 0);
+		 break;
+	 }
+	 }
+	last_type = this_type;
+ }
+}
+
+static int check_for_lvalue (unsigned char eqs_type, _pSLang_Token_Type *ctok)
+{
+ unsigned char type;
+
+ if ((ctok == NULL)
+ && (NULL == (ctok = get_last_token ())))
+ type = ILLEGAL_TOKEN;
+ else
+ type = ctok->type;
+
+ eqs_type -= ASSIGN_TOKEN;
+ switch (type)
+ {
+ case IDENT_TOKEN:
+	eqs_type += _SCALAR_ASSIGN_TOKEN;
+	break;
+ case ARRAY_TOKEN:
+	eqs_type += _ARRAY_ASSIGN_TOKEN;
+	break;
+ case DOT_TOKEN:
+	eqs_type += _STRUCT_ASSIGN_TOKEN;
+	break;
+ case DEREF_TOKEN:
+	eqs_type += _DEREF_ASSIGN_TOKEN;
+	break;
+ default:
+	_pSLparse_error (SL_SYNTAX_ERROR, "Expecting LVALUE", ctok, 0);
+	return -1;
+ }
+
+ ctok->type = eqs_type;
+ return 0;
+}
+
+/* inline_list_expression:
+ * (nil)
+ * simple_expression
+ * inline_list_expression, simple_expression
+ */
+static void inline_list_expression (_pSLang_Token_Type *ctok)
+{
+ append_token_of_type (ARG_TOKEN);
+
+ if (ctok->type != CBRACE_TOKEN)
+ {
+	while (1)
+	 {
+	 simple_expression (ctok);
+	 if (ctok->type != COMMA_TOKEN)
+	 break;
+	 get_token (ctok);
+	 if (ctok->type == CBRACE_TOKEN) /* trailing comma: {a,b,} */
+	 break;
+	 }
+	if (ctok->type != CBRACE_TOKEN)
+	 {
+	 _pSLparse_error (SL_SYNTAX_ERROR, "Expecting '}' to denote list end", ctok, 0);
+	 return;
+	 }
+ }
+
+ append_token_of_type (_INLINE_LIST_TOKEN);
+ get_token (ctok);
+}
+
+static void array_index_expression (_pSLang_Token_Type *ctok)
+{
+ unsigned int num_commas;
+
+ num_commas = 0;
+ while (1)
+ {
+	switch (ctok->type)
+	 {
+	 case COLON_TOKEN:
+	 if (num_commas)
+	 _pSLparse_error (SL_SYNTAX_ERROR, "Misplaced ':'", ctok, 0);
+	 return;
+
+	 case TIMES_TOKEN:
+	 append_token_of_type (_INLINE_WILDCARD_ARRAY_TOKEN);
+	 get_token (ctok);
+	 break;
+
+	 case COMMA_TOKEN:
+	 _pSLparse_error (SL_SYNTAX_ERROR, "Misplaced ','", ctok, 0);
+	 return;
+
+	 default:
+	 simple_expression (ctok);
+	 }
+
+	if (ctok->type != COMMA_TOKEN)
+	 return;
+	num_commas++;
+	get_token (ctok);
+	if (ctok->type == CBRACKET_TOKEN) /* allow trailing comma */
+	 return;
+ }
+}
+
+/* inline-array-expression:
+ * array_index_expression
+ * simple_expression : simple_expression
+ * simple_expression : simple_expression : simple_expression
+ * simple_expression : simple_expression : # simple_expression
+ */
+static void inline_array_expression (_pSLang_Token_Type *ctok)
+{
+ int num_colons = 0;
+ int has_pound = 0;
+
+ append_token_of_type (ARG_TOKEN);
+
+ if (ctok->type == COLON_TOKEN)	 /* :... */
+ append_token_of_type (_NULL_TOKEN);
+ else if (ctok->type != CBRACKET_TOKEN)
+ array_index_expression (ctok);
+
+ if (ctok->type == COLON_TOKEN)
+ {
+	num_colons++;
+	if ((COLON_TOKEN == get_token (ctok))
+	 || (ctok->type == CBRACKET_TOKEN))
+	 append_token_of_type (_NULL_TOKEN);
+	else
+	 simple_expression (ctok);
+
+	if (ctok->type == COLON_TOKEN)
+	 {
+	 num_colons++;
+	 if (POUND_TOKEN == get_token (ctok))
+	 {
+		 has_pound = 1;
+		 get_token(ctok);
+	 }
+	 simple_expression (ctok);
+	 }
+ }
+
+ if (ctok->type != CBRACKET_TOKEN)
+ {
+	_pSLparse_error (SL_SYNTAX_ERROR, "Expecting ''", ctok, 0);
+	return;
+ }
+
+ /* append_token_of_type (EARG_TOKEN); */
+ if (num_colons)
+ {
+	if (has_pound)
+	 append_token_of_type (_INLINE_IMPLICIT_ARRAYN_TOKEN);
+	else
+	 append_token_of_type (_INLINE_IMPLICIT_ARRAY_TOKEN);
+ }
+ else
+ append_token_of_type (_INLINE_ARRAY_TOKEN);
+ get_token (ctok);
+}
+
+static void do_multiple_assignment (_pSLang_Token_Type *ctok)
+{
+ _pSLang_Token_Type *s;
+ unsigned int i, k, len;
+ unsigned char assign_type;
+
+ assign_type = ctok->type;
+
+ /* The LHS token list has already been pushed. Here we do the RHS
+ * so push to another token list, process it, then come back to
+ * LHS for assignment.
+ */
+ if (NULL == push_token_list ())
+ return;
+
+ get_token (ctok);
+ expression (ctok);
+ compile_token_list ();
+
+ if (_pSLang_Error)
+ return;
+
+ /* Finally compile the LHS of the assignment expression
+ * that has been saved.
+ */
+ s = Token_List->stack;
+ len = Token_List->len;
+
+ if (len == 0)
+ {
+	compile_token_of_type (POP_TOKEN);
+	return;
+ }
+
+ while (len > 0)
+ {
+	/* List is of form:
+	 * a , b, c d e, f , g , , , h ,
+	 * The missing expressions will be replaced by a POP
+	 * ,,a
+	 */
+
+	/* Start from back looking for a COMMA */
+	k = len - 1;
+	if (sk.type == COMMA_TOKEN)
+	 {
+	 compile_token_of_type (POP_TOKEN);
+	 len = k;
+	 continue;
+	 }
+
+	if (-1 == check_for_lvalue (assign_type, s + k))
+	 return;
+
+	i = 0;
+	while (1)
+	 {
+	 if (sk.type == COMMA_TOKEN)
+	 {
+		 i = k + 1;
+		 break;
+	 }
+
+	 if (k == 0)
+	 break;
+
+	 k--;
+	 }
+
+	while (i < len)
+	 {
+	 compile_token (s + i);
+	 i++;
+	 }
+
+	len = k;
+ }
+
+ if (s0.type == COMMA_TOKEN)
+ compile_token_of_type (POP_TOKEN);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slpath.c Added

@@ -0,0 +1,656 @@
+/* Pathname and filename functions */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#ifdef HAVE_IO_H
+# include <io.h>
+#endif
+
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <signal.h>
+#include <time.h>
+
+#include <errno.h>
+#include <string.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+/* In this file, all file names are assumed to be specified in the Unix
+ * format, or in the native format.
+ *
+ * Aboout VMS:
+ * VMS pathnames are a mess. In general, they look like
+ * node::device:dir.dirfile.ext;version
+ * and I do not know of a well-defined Unix representation for them. So,
+ * I am going to punt and encourage users to stick to the native
+ * representation.
+ */
+
+#if defined(IBMPC_SYSTEM)
+# define PATH_SEP		'\\'
+# define DRIVE_SPECIFIER	':'
+# define SEARCH_PATH_DELIMITER	';'
+# define THIS_DIR_STRING	"."
+# define PARENT_DIR_STRING ".."
+#else
+# if defined(VMS)
+# define PATH_SEP		''
+# define DRIVE_SPECIFIER	':'
+# define SEARCH_PATH_DELIMITER	' '
+# define THIS_DIR_STRING	"" /* Is this correct?? */
+# define PARENT_DIR_STRING "-" /* ??????????????? */
+# else
+# define PATH_SEP		'/'
+# define UNIX_PATHNAMES_OK
+# define SEARCH_PATH_DELIMITER	':'
+# define THIS_DIR_STRING	"."
+# define PARENT_DIR_STRING ".."
+# endif
+#endif
+
+#ifdef UNIX_PATHNAMES_OK
+# define IS_PATH_SEP(x) ((x) == PATH_SEP)
+#else
+# define IS_PATH_SEP(x)	(((x) == PATH_SEP) || ((x) == '/'))
+#endif
+
+#define TEST_VMS_ON_UNIX	0
+
+static char Path_Delimiter = SEARCH_PATH_DELIMITER;
+
+/* On Unix, this has no effect.
+ * C:zzz ==> returns zzz (DOS/Windows, VMS)
+ * //drive/zzz ==> returns zzz (DOS/Windows)
+ */
+static SLFUTURE_CONST char *skip_drive (SLFUTURE_CONST char *file)
+{
+#ifdef DRIVE_SPECIFIER
+ SLFUTURE_CONST char *f;
+ /* look for A:/foo form */
+ f = file + strlen (file);
+ while (f != file)
+ {
+	f--;
+	if (*f == DRIVE_SPECIFIER)
+	 return f+1;
+ }
+#endif
+#ifdef IBMPC_SYSTEM
+ /* windows //netdrive/dir form */
+ if (IS_PATH_SEP(file0) && IS_PATH_SEP(file1))
+ {
+	file += 2;
+	while (*file && (0 == IS_PATH_SEP(*file)))
+	 file++;
+	return file;
+ }
+#endif
+ return file;
+}
+
+/* If file is /a/b/c/basename, this function returns a pointer to basename */
+SLFUTURE_CONST char *SLpath_basename (SLFUTURE_CONST char *drivefile)
+{
+ SLFUTURE_CONST char *b, *file;
+
+ if (drivefile == NULL) return NULL;
+
+ file = skip_drive (drivefile);
+ b = file + strlen (file);
+
+ while (b != file)
+ {
+	b--;
+	if (IS_PATH_SEP(*b))
+	 return b + 1;
+ }
+
+ return b;
+}
+
+/* Returns a malloced string */
+char *SLpath_pathname_sans_extname (SLFUTURE_CONST char *drivefile)
+{
+ char *b;
+ char *file;
+
+ drivefile = SLmake_string (drivefile);
+ if (drivefile == NULL)
+ return NULL;
+
+ file = (char *)skip_drive (drivefile);
+ b = file + strlen (file);
+
+ while (b != file)
+ {
+	b--;
+	if (IS_PATH_SEP(*b))
+	 break;
+
+	if (*b == '.')
+	 {
+	 *b = 0;
+	 break;
+	 }
+ }
+
+ return drivefile;
+}
+
+/* If path looks like: A/B/C/D/whatever, it returns A/B/C/D as a malloced
+ * string.
+ */
+char *SLpath_dirname (SLFUTURE_CONST char *drivefile)
+{
+ SLCONST char *b;
+ const char *file;
+ char *dir, *drivedir;
+ size_t len;
+
+ if (drivefile == NULL) return NULL;
+ file = skip_drive (drivefile);
+
+ b = file + strlen (file);
+
+ while (b != file)
+ {
+	b--;
+	if (0 == IS_PATH_SEP(*b))
+	 continue;
+
+#ifdef VMS
+	b++;		 /* make sure final is included */
+#else
+	/* collapse multiple slashes */
+	while ((b != file) && IS_PATH_SEP(*(b-1)))
+	 b--;
+
+	if (b == file) b++;
+#endif
+	break;
+ }
+
+ /* now b should point to the character after the slash:
+ * file="zzz/xxxx"
+ * b------^
+ */
+ if (b == file)
+ {
+	/* pathological cases -- what is the parent? For simplicity
+	 * simply return the current directory.
+	 */
+	len = file - drivefile;
+	if (NULL == (dir = SLmalloc (len + 1 + strlen(THIS_DIR_STRING))))
+	 return NULL;
+	strncpy (dir, drivefile, len);
+	strcpy (dir + len, THIS_DIR_STRING);
+	return dir;
+ }
+
+ if (NULL == (drivedir = SLmake_nstring (drivefile, b - drivefile)))
+ return NULL;
+
+ dir = drivedir + (file - drivefile);
+ len = b - file;		 /* len is from start of file on drive */
+
+#ifndef VMS
+ /* handle special cases
+ * /foo/. --> /foo
+ * /. --> /
+ * /foo/.. --> /
+ * C:/.
+ */
+ while ((len > 1) && (dirlen-1 == '.'))
+ {
+	if (IS_PATH_SEP(dirlen-2))
+	 {
+	 len--;		 /* lose "." */
+	 while ((len > 1) && IS_PATH_SEP(dirlen-1))
+	 len--;		 /* lose "/" */
+	 dirlen = 0;
+	 continue;
+	 }
+	if ((len > 2) && (dirlen-2 == '.') && IS_PATH_SEP(dirlen-3))
+	 {
+	 len -= 2;		 /* lose ".." */
+	 if (len > 1)
+	 {
+		 len--;		 /* lose "/" */
+		 dirlen = 0;
+		 b = SLpath_basename (dir); /* will not fail: zzz/xxx --> zzz/x */
+		 len = b - dir;
+		 while ((len > 1) && IS_PATH_SEP(dirlen-1))
+		 len--;
+	 }
+	 dirlen = 0;
+	 continue;
+	 }
+
+	break;
+ }
+#endif				 /* not VMS */
+ return drivedir;
+}
+
+/* Note: VMS filenames also contain version numbers. The caller will have
+ * to deal with that.
+ *
+ * The extension includes the '.'. If no extension is present, "" is returned.
+ */
+char *SLpath_extname (SLFUTURE_CONST char *file)
+{
+ char *b;
+
+ if (NULL == (file = SLpath_basename (file)))
+ return NULL;
+
+ b = (char *) file + strlen (file);
+ while (b != file)
+ {
+	b--;
+	if (*b == '.')
+	 return b;
+ }
+
+ if (*b == '.')
+ return b;
+
+ /* Do not return a literal "" */
+ return (char *) file + strlen (file);
+}
+
+#ifdef IBMPC_SYSTEM
+static void convert_slashes (char *f)
+{
+ while (*f)
+ {
+	if (*f == '/') *f = PATH_SEP;
+	f++;
+ }
+}
+#endif
+
+int SLpath_is_absolute_path (SLFUTURE_CONST char *name)
+{
+ if (name == NULL)
+ return -1;
+
+#ifdef UNIX_PATHNAMES_OK
+ return (*name == '/');
+#else
+ if (IS_PATH_SEP (*name))
+ return 1;
+
+ /* If it contains a drive specifier, regard it as absolute */
+ if (name != skip_drive (name))
+ return 1;
+
+ return 0;
+#endif
+}
+
+#if TEST_VMS_ON_UNIX || defined(VMS)
+static char *vms_fixup_filename (char *file)
+{
+ char *bracket, *slash, *last_slash;
+ /* Convert slashes in filenames such as:
+ * 1. drive:dir.dira/b.c --> drivedir.dir.ab.c
+ * 2. drive:/a/b/c.d --> drive:a.bc.d
+ * 3. drive:a/b/c.d --> drive:a.bc.d
+ * 4. drive:/a.c --> drive:a.c ???
+ * 5. drive:dir.dir/a/b --> drive:a/b
+ * Since the input pointer is malloced, and the length is preserved for the
+ * first 2 cases, the conversion may be performed in-place.
+ *
+ * FIXME: case 5 is not handled
+ */
+ /* First case */
+ bracket = strchr (file,'');
+ if (bracket != NULL)
+ {
+	last_slash = NULL;
+	slash = file;
+	while (NULL != (slash = strchr (slash, '/')))
+	 {
+	 last_slash = slash;
+	 *slash++ = '.';
+	 }
+	if (last_slash != NULL)
+	 {
+	 *bracket = '.';
+	 *last_slash = '';
+	 }
+	return file;
+ }
+ /* Second case */
+ slash = strchr (file, '/');
+ if (slash == NULL)
+ return file;
+ if ((slash != file) && (*(slash-1) != ':'))
+ {
+	/* Case 3: drive:a/b/c.d --> drive:a.bc.d */
+	/* Convert it to case 2: drive:/a/b/c.d */
+	char *drive;
+	unsigned int len;
+	char *new_file = SLmalloc (strlen (file) + 2);
+
+	if (new_file == NULL)
+	 {
+	 SLfree (file);
+	 return NULL;
+	 }
+	drive = strchr (file, ':');
+	if (drive == NULL)
+	 len = 0;
+	else
+	 {
+	 len = 1 + (drive-file);
+	 strncpy (new_file, file, len);
+	 }
+	slash = new_file + len;
+	*slash = '/';
+	strcpy (slash + 1, file + len);
+	SLfree (file);
+	file = new_file;
+ }
+
+ /* Case 2: drive:/a/b/c.d --> drive:a.bc.d */
+ *slash++ = '';
+ last_slash = NULL;
+ while (NULL != (slash = strchr (slash, '/')))
+ {
+	last_slash = slash;
+	*slash++ = '.';
+ }
+ if (last_slash != NULL)
+ {
+	*last_slash = '';
+	return file;
+ }
+
+ /* case 4: drive:/a.c --> drive:a.c */
+ slash = strchr (file, '');	 /* non-NULL */
+ while (*slash)
+ {
+	*slash = *(slash+1);
+	slash++;
+ }
+ return file;
+}
+#endif
+
+/* This returns a MALLOCED string */
+char *SLpath_dircat (SLFUTURE_CONST char *dir, SLFUTURE_CONST char *name)
+{
+ unsigned int len, dirlen;
+ char *file;
+#ifndef VMS
+ int requires_fixup;
+#endif
+
+ if (name == NULL)
+ name = "";
+ if ((dir == NULL)
+#if !TEST_VMS_ON_UNIX
+ || (SLpath_is_absolute_path (name))
+#endif
+ )
+ dir = "";
+
+ /* Both VMS and MSDOS have default directories associated with each drive.
+ * That is, the meaning of something like C:X depends upon more than just
+ * the syntax of the string. Since this concept has more power under VMS
+ * it will be honored here. However, I am going to treat C:X as C:\X
+ * under MSDOS.
+ *
+ * Note!!!
+ * VMS has problems of its own regarding path names, so I am simply
+ * going to strcat. Hopefully the VMS RTL is smart enough to deal with
+ * the result.
+ */
+ dirlen = strlen (dir);
+#ifndef VMS
+# if TEST_VMS_ON_UNIX
+ requires_fixup = 0;
+# else
+ requires_fixup = (dirlen && (0 == IS_PATH_SEP(dirdirlen - 1)));
+# endif
+#endif
+
+ len = dirlen + strlen (name) + 2;
+ if (NULL == (file = (char *)SLmalloc (len)))
+ return NULL;
+
+ strcpy (file, dir);
+
+#ifndef VMS
+ if (requires_fixup)
+ filedirlen++ = PATH_SEP;
+#endif
+
+ strcpy (file + dirlen, name);
+
+#if defined(IBMPC_SYSTEM)
+ convert_slashes (file);
+#endif
+
+#if TEST_VMS_ON_UNIX || defined (VMS)
+ return vms_fixup_filename (file);
+#else
+ return file;
+#endif
+}
+
+int SLpath_file_exists (SLFUTURE_CONST char *file)
+{
+ struct stat st;
+ int m;
+
+#if defined(__os2__) && !defined(S_IFMT)
+/* IBM VA3 doesn't declare S_IFMT */
+# define	S_IFMT	(S_IFDIR | S_IFCHR | S_IFREG)
+#endif
+
+#ifdef _S_IFDIR
+# ifndef S_IFDIR
+# define S_IFDIR _S_IFDIR
+# endif
+#endif
+
+#ifndef S_ISDIR
+# ifdef S_IFDIR
+# define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR)
+# else
+# define S_ISDIR(m) 0
+# endif
+#endif
+
+ if (file == NULL)
+ return -1;
+
+ if (stat(file, &st) < 0) return 0;
+ m = st.st_mode;
+
+ if (S_ISDIR(m)) return (2);
+ return 1;
+}
+
+/* By relatively-absolute, I mean paths of the form ./foo,
+ * and ../foo/bar. But not foo/bar.
+ */
+static int is_relatively_absolute (SLFUTURE_CONST char *file)
+{
+ if (file == NULL)
+ return -1;
+ if (SLpath_is_absolute_path (file))
+ return 1;
+
+#if defined(VMS)
+ return (*file == '');
+#else
+ if (*file == '.') file++;
+ if (*file == '.') file++;
+ return ((*file == PATH_SEP)
+# if defined(IBMPC_SYSTEM)
+	 || (*file == '/')
+# endif
+	 );
+#endif
+}
+
+char *SLpath_find_file_in_path (SLFUTURE_CONST char *path, SLFUTURE_CONST char *name)
+{
+ unsigned int max_path_len;
+ unsigned int this_path_len;
+ char *file, *dir;
+ SLCONST char *p;
+ unsigned int nth;
+
+ if ((path == NULL) || (*path == 0)
+ || (name == NULL) || (*name == 0))
+ return NULL;
+
+ if (is_relatively_absolute (name))
+ {
+	if (0 == SLpath_file_exists (name))
+	 return NULL;
+	return SLmake_string (name);
+ }
+
+ /* Allow "." to mean the current directory on all systems */
+ if ((path0 == '.') && (path1 == 0))
+ {
+	if (0 == SLpath_file_exists (name))
+	 return NULL;
+	return SLpath_dircat (THIS_DIR_STRING, name);
+ }
+
+ max_path_len = 0;
+ this_path_len = 0;
+ p = path;
+ while (*p != 0)
+ {
+	if (*p++ == Path_Delimiter)
+	 {
+	 if (this_path_len > max_path_len) max_path_len = this_path_len;
+	 this_path_len = 0;
+	 }
+	else this_path_len++;
+ }
+ if (this_path_len > max_path_len) max_path_len = this_path_len;
+ max_path_len++;
+
+ if (NULL == (dir = (char *)SLmalloc (max_path_len)))
+ return NULL;
+
+ nth = 0;
+ while (-1 != SLextract_list_element ((char *) path, nth, Path_Delimiter,
+					dir, max_path_len))
+ {
+	nth++;
+	if (*dir == 0)
+	 continue;
+
+	if (NULL == (file = SLpath_dircat (dir, name)))
+	 {
+	 SLfree (dir);
+	 return NULL;
+	 }
+
+	if (1 == SLpath_file_exists (file))
+	 {
+	 SLfree (dir);
+	 return file;
+	 }
+
+	SLfree (file);
+ }
+
+ SLfree (dir);
+ return NULL;
+}
+
+int SLpath_get_delimiter (void)
+{
+ return Path_Delimiter;
+}
+
+int SLpath_set_delimiter (int d)
+{
+ char ch = (char) d;
+ if (ch == 0)
+ return -1;
+
+ Path_Delimiter = ch;
+ return 0;
+}
+
+
+char *SLpath_getcwd (void)
+{
+ char cwd4096;
+ char *p;
+ size_t len;
+
+#ifndef HAVE_GETCWD
+ p = getwd (cwd);
+#else
+# if defined (__EMX__)
+ p = _getcwd2(cwd, sizeof(cwd));	 /* includes drive specifier */
+# else
+ p = getcwd(cwd, sizeof(cwd));	 /* djggp includes drive specifier */
+# endif
+#endif
+
+ if (p == NULL)
+ return NULL;
+
+#ifdef IBMPC_SYSTEM
+ convert_slashes (cwd);
+#endif
+
+ len = strlen (cwd);
+
+ p = (char *) SLmalloc (len+2); /* \0 + trailing / */
+ if (p == NULL)
+ {
+#ifdef ENOMEM
+	errno = ENOMEM;
+#endif
+	return NULL;
+ }
+
+ strcpy (p, cwd);
+
+#ifndef VMS
+ if (len && (plen-1 != PATH_SEP))
+ {
+	plen++ = PATH_SEP;
+	plen = 0;
+ }
+#endif
+
+ return p;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slposdir.c Added

@@ -0,0 +1,1319 @@
+/* file intrinsics for S-Lang */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#if defined(__unix__) || (defined (__os2__) && defined (__EMX__))
+# include <sys/types.h>
+#endif
+
+#include <time.h>
+#ifdef HAVE_SYS_TIME_H
+# include <sys/time.h>
+#endif
+
+#ifdef HAVE_UTIME_H
+# include <utime.h>
+#endif
+
+#ifdef HAVE_IO_H
+# include <io.h>		 /* for chmod */
+#endif
+
+#if defined(__BORLANDC__)
+# include <process.h>
+# include <dos.h>
+#endif
+
+#ifdef HAVE_FCNTL_H
+# include <fcntl.h>
+#else
+# ifdef HAVE_SYS_FCNTL_H
+# include <sys/fcntl.h>
+# endif
+#endif
+
+#ifdef __unix__
+# include <sys/file.h>
+#endif
+
+#if defined(__BORLANDC__)
+# include <dir.h>
+#endif
+
+#if defined(_MSC_VER)
+# include <io.h>
+#endif
+
+#if defined(__DECC) && defined(VMS)
+# include <unixio.h>
+# include <unixlib.h>
+#endif
+
+#ifdef VMS
+# include <stat.h>
+#else
+# include <sys/stat.h>
+#endif
+
+#ifdef HAVE_SYS_STATVFS_H
+# include <sys/statvfs.h>
+#endif
+
+#if defined(VMS)
+# define USE_LISTDIR_INTRINSIC	0
+#else
+# define USE_LISTDIR_INTRINSIC	1
+#endif
+
+#if USE_LISTDIR_INTRINSIC
+
+#if defined(__WIN32__)
+# include <windows.h>
+# include <direct.h>
+#else
+# if defined(__OS2__) && defined(__IBMC__)
+# define INCL_DOS
+# define INCL_ERRORS
+# include <os2.h>
+# include <direct.h>
+# include <ctype.h>
+# else
+# ifdef HAVE_DIRENT_H
+# include <dirent.h>
+# else
+# ifdef HAVE_DIRECT_H
+# include <direct.h>
+# else
+# define dirent direct
+# define NEED_D_NAMLEN
+# if HAVE_SYS_NDIR_H
+# include <sys/ndir.h>
+# endif
+# if HAVE_SYS_DIR_H
+# include <sys/dir.h>
+# endif
+# if HAVE_NDIR_H
+# include <ndir.h>
+# endif
+# endif
+# endif
+# endif
+#endif
+
+#endif				 /* USE_LISTDIR_INTRINSIC */
+
+#include <errno.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+#define SLSYSWRAP_READDIR readdir
+#ifdef SLSYSWRAP
+# include <slsyswrap.h>
+#endif
+
+static int is_interrupt (int e)
+{
+#ifdef EINTR
+ if (e == EINTR)
+ {
+	if (0 == SLang_handle_interrupt ())
+	 return 1;
+ }
+#endif
+#ifdef EAGAIN
+ if (e == EAGAIN)
+ {
+	if (0 == SLang_handle_interrupt ())
+	 return 1;
+ }
+#endif
+ return 0;
+}
+
+typedef struct
+{
+ struct stat st;
+ int st_opt_attrs;
+}
+Stat_Type;
+
+static SLang_CStruct_Field_Type Stat_Struct =
+{
+ MAKE_CSTRUCT_INT_FIELD(Stat_Type, st.st_dev, "st_dev", 0),
+ MAKE_CSTRUCT_INT_FIELD(Stat_Type, st.st_ino, "st_ino", 0),
+ MAKE_CSTRUCT_INT_FIELD(Stat_Type, st.st_mode, "st_mode", 0),
+ MAKE_CSTRUCT_INT_FIELD(Stat_Type, st.st_nlink, "st_nlink", 0),
+ MAKE_CSTRUCT_UINT_FIELD(Stat_Type, st.st_uid, "st_uid", 0),
+ MAKE_CSTRUCT_UINT_FIELD(Stat_Type, st.st_gid, "st_gid", 0),
+ MAKE_CSTRUCT_INT_FIELD(Stat_Type, st.st_rdev, "st_rdev", 0),
+ MAKE_CSTRUCT_UINT_FIELD(Stat_Type, st.st_size, "st_size", 0),
+ MAKE_CSTRUCT_UINT_FIELD(Stat_Type, st.st_atime, "st_atime", 0),
+ MAKE_CSTRUCT_UINT_FIELD(Stat_Type, st.st_mtime, "st_mtime", 0),
+ MAKE_CSTRUCT_UINT_FIELD(Stat_Type, st.st_ctime, "st_ctime", 0),
+ MAKE_CSTRUCT_INT_FIELD(Stat_Type, st_opt_attrs, "st_opt_attrs", 0),
+ SLANG_END_CSTRUCT_TABLE
+};
+
+static int push_stat_struct (struct stat *st, int opt_attrs)
+{
+ Stat_Type s;
+
+ s.st = *st;
+ s.st_opt_attrs = opt_attrs;
+ return SLang_push_cstruct ((VOID_STAR) &s, Stat_Struct);
+}
+
+static void stat_cmd (char *file)
+{
+ struct stat st;
+ int status;
+ int opt_attrs;
+#if defined(__MSDOS__) || defined(__WIN32__)
+ unsigned int len = strlen (file);
+ int is_malloced = 0;
+
+ if (len && ((filelen-1 == '\\') || (filelen-1 == '/')))
+ {
+	file = SLmake_nstring (file, len-1);
+	if (file == NULL)
+	 return;
+
+	is_malloced = 1;
+ }
+#endif
+
+ while ((-1 == (status = stat (file, &st)))
+	 && (is_interrupt (errno)))
+ continue;
+
+ if (status == 0)
+ {
+#ifdef __WIN32__
+	opt_attrs = GetFileAttributes (file);
+#else
+	opt_attrs = 0;
+#endif
+
+	push_stat_struct (&st, opt_attrs);
+ }
+ else
+ {
+	_pSLerrno_errno = errno;
+	SLang_push_null ();
+ }
+
+#if defined(__MSDOS__) || defined(__WIN32__)
+ if (is_malloced)
+ SLfree (file);
+#endif
+}
+
+static void lstat_cmd (char *file)
+{
+#ifdef HAVE_LSTAT
+ struct stat st;
+ int opt_attrs;
+
+ while (-1 == lstat (file, &st))
+ {
+	if (is_interrupt (errno))
+	 continue;
+
+	_pSLerrno_errno = errno;
+	SLang_push_null ();
+	return;
+ }
+
+# ifdef __WIN32__
+ opt_attrs = GetFileAttributes (file);
+# else
+ opt_attrs = 0;
+# endif
+
+ push_stat_struct (&st, opt_attrs);
+#else
+ stat_cmd (file);
+#endif				 /* HAVE_LSTAT */
+}
+
+#if defined(HAVE_STATVFS)
+static SLang_CStruct_Field_Type StatVFS_Struct =
+{
+ MAKE_CSTRUCT_UINT_FIELD(struct statvfs, f_bsize, "f_bsize", 0),
+ MAKE_CSTRUCT_UINT_FIELD(struct statvfs, f_bsize, "f_bsize", 0),
+ MAKE_CSTRUCT_UINT_FIELD(struct statvfs, f_frsize, "f_frsize", 0),
+ MAKE_CSTRUCT_UINT_FIELD(struct statvfs, f_blocks, "f_blocks", 0),
+ MAKE_CSTRUCT_UINT_FIELD(struct statvfs, f_bfree, "f_bfree", 0),
+ MAKE_CSTRUCT_UINT_FIELD(struct statvfs, f_bavail, "f_bavail", 0),
+ MAKE_CSTRUCT_UINT_FIELD(struct statvfs, f_files, "f_files", 0),
+ MAKE_CSTRUCT_UINT_FIELD(struct statvfs, f_ffree, "f_ffree", 0),
+ MAKE_CSTRUCT_UINT_FIELD(struct statvfs, f_favail, "f_favail", 0),
+ MAKE_CSTRUCT_UINT_FIELD(struct statvfs, f_fsid, "f_fsid", 0),
+ MAKE_CSTRUCT_UINT_FIELD(struct statvfs, f_flag, "f_flag", 0),
+ MAKE_CSTRUCT_UINT_FIELD(struct statvfs, f_namemax, "f_namemax", 0),
+ SLANG_END_CSTRUCT_TABLE
+};
+
+static void statvfs_cmd (void)
+{
+ struct statvfs vfs;
+ FILE *fp;
+ char *path = NULL;
+ SLFile_FD_Type *f = NULL;
+ SLang_MMT_Type *mmt = NULL;
+ int fd, status;
+
+ switch (SLang_peek_at_stack ())
+ {
+ default:
+ case SLANG_INT_TYPE:
+	if (-1 == SLang_pop_int (&fd))
+	 return;
+	break;
+
+ case SLANG_FILE_FD_TYPE:
+	if (-1 == SLfile_pop_fd (&f))
+	 return;
+	if (-1 == SLfile_get_fd (f, &fd))
+	 goto free_and_return;
+	break;
+
+ case SLANG_FILE_PTR_TYPE:
+	if (-1 == SLang_pop_fileptr (&mmt, &fp))
+	 return;
+	fd = fileno (fp);
+	break;
+
+ case SLANG_STRING_TYPE:
+	if (-1 == SLang_pop_slstring (&path))
+	 return;
+	break;
+ }
+
+ if (path != NULL)
+ {
+	while ((-1 == (status = statvfs (path, &vfs)))
+	 && (is_interrupt (errno)))
+	 continue;
+ }
+ else
+ {
+	while ((-1 == (status = fstatvfs (fd, &vfs)))
+	 && (is_interrupt (errno)))
+	 continue;
+ }
+
+ if (status == 0)
+ (void) SLang_push_cstruct ((VOID_STAR) &vfs, StatVFS_Struct);
+ else
+ {
+	_pSLerrno_errno = errno;
+	(void) SLang_push_null ();
+ }
+
+ /* drop */
+free_and_return:
+ if (f != NULL) SLfile_free_fd (f);
+ if (mmt != NULL) SLang_free_mmt (mmt);
+ if (path != NULL) SLang_free_slstring (path);
+}
+#endif				 /* HAVE_STATVFS */
+
+#if defined(HAVE_UTIME) || defined(HAVE_UTIMES)
+static int utime_intrin (char *file, double *t0p, double *t1p)
+{
+# ifdef HAVE_UTIMES
+ struct timeval tv2;
+# else
+ struct utimbuf u;
+# endif
+ int ret;
+ double t0 = *t0p, t1 = *t1p;
+
+# ifdef HAVE_UTIMES
+ tv0.tv_sec = (long) t0;
+ tv0.tv_usec = (long) ((t0 - (long)t0)*1e6);
+ tv1.tv_sec = (long) t1;
+ tv1.tv_usec = (long) ((t1 - (long)t1)*1e6);
+ ret = utimes (file, tv);
+# else
+ u.actime = (time_t) t0;
+ u.modtime = (time_t) t1;
+ ret = utime (file, &u);
+# endif
+
+ if (ret == -1)
+ _pSLerrno_errno = errno;
+
+ return ret;
+}
+#endif
+
+/* Well, it appears that on some systems, these are not defined. Here I
+ * provide them. These are derived from the Linux stat.h file.
+ */
+
+#ifdef __os2__
+# ifdef __IBMC__
+/* IBM VA3 doesn't declare S_IFMT */
+# define	S_IFMT	(S_IFDIR | S_IFCHR | S_IFREG)
+# endif
+#endif
+
+#ifndef S_ISLNK
+# ifdef S_IFLNK
+# define S_ISLNK(m) (((m) & S_IFMT) == S_IFLNK)
+# else
+# define S_ISLNK(m) 0
+# endif
+#endif
+
+#ifndef S_ISREG
+# ifdef S_IFREG
+# define S_ISREG(m) (((m) & S_IFMT) == S_IFREG)
+# else
+# define S_ISREG(m) 0
+# endif
+#endif
+
+#ifndef S_ISDIR
+# ifdef S_IFDIR
+# define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR)
+# else
+# define S_ISDIR(m) 0
+# endif
+#endif
+
+#ifndef S_ISCHR
+# ifdef S_IFCHR
+# define S_ISCHR(m) (((m) & S_IFMT) == S_IFCHR)
+# else
+# define S_ISCHR(m) 0
+# endif
+#endif
+
+#ifndef S_ISBLK
+# ifdef S_IFBLK
+# define S_ISBLK(m) (((m) & S_IFMT) == S_IFBLK)
+# else
+# define S_ISBLK(m) 0
+# endif
+#endif
+
+#ifndef S_ISFIFO
+# ifdef S_IFIFO
+# define S_ISFIFO(m) (((m) & S_IFMT) == S_IFIFO)
+# else
+# define S_ISFIFO(m) 0
+# endif
+#endif
+
+#ifndef S_ISSOCK
+# ifdef S_IFSOCK
+# define S_ISSOCK(m) (((m) & S_IFMT) == S_IFSOCK)
+# else
+# define S_ISSOCK(m) 0
+# endif
+#endif
+
+static char stat_is_cmd (char *what, int *mode_ptr)
+{
+ int ret;
+ int st_mode = *mode_ptr;
+
+ if (!strcmp (what, "sock")) ret = S_ISSOCK(st_mode);
+ else if (!strcmp (what, "fifo")) ret = S_ISFIFO(st_mode);
+ else if (!strcmp (what, "blk")) ret = S_ISBLK(st_mode);
+ else if (!strcmp (what, "chr")) ret = S_ISCHR(st_mode);
+ else if (!strcmp (what, "dir")) ret = S_ISDIR(st_mode);
+ else if (!strcmp (what, "reg")) ret = S_ISREG(st_mode);
+ else if (!strcmp (what, "lnk")) ret = S_ISLNK(st_mode);
+ else
+ {
+	_pSLang_verror (SL_INVALID_PARM, "stat_is: Unrecognized type: %s", what);
+	return -1;
+ }
+
+ return (char) (ret != 0);
+}
+
+#ifdef HAVE_READLINK
+static void readlink_cmd (char *s)
+{
+ char buf2048;
+ ssize_t n;
+
+ while ((-1 == (n = readlink (s, buf, sizeof (buf)-1)))
+	 && is_interrupt (errno))
+ ;
+
+ if (n == -1)
+ {
+	_pSLerrno_errno = errno;
+	s = NULL;
+ }
+ else
+ {
+	bufn = 0;
+	s = buf;
+ }
+
+ (void) SLang_push_string (s);
+}
+#endif
+
+#ifdef HAVE_SYMLINK
+static int symlink_cmd (char *oldpath, char *newpath)
+{
+ int s;
+
+ while (-1 == (s = symlink (oldpath, newpath)))
+ {
+	if (is_interrupt (errno))
+	 continue;
+
+	_pSLerrno_errno = errno;
+	break;
+ }
+ return s;
+}
+#endif
+
+#ifdef HAVE_LINK
+static int hardlink_cmd (char *oldpath, char *newpath)
+{
+ int s;
+
+ while (-1 == (s = link (oldpath, newpath)))
+ {
+	if (is_interrupt (errno))
+	 continue;
+
+	_pSLerrno_errno = errno;
+	break;
+ }
+ return s;
+}
+#endif
+
+static int chmod_cmd (char *file, int *mode)
+{
+ while (-1 == chmod(file, (mode_t) *mode))
+ {
+	if (is_interrupt (errno))
+	 continue;
+
+	_pSLerrno_errno = errno;
+	return -1;
+ }
+ return 0;
+}
+
+#ifdef HAVE_CHOWN
+static int chown_cmd (char *file, int *owner, int *group)
+{
+ while (-1 == chown(file, (uid_t) *owner, (gid_t) *group))
+ {
+	if (is_interrupt (errno))
+	 continue;
+
+	_pSLerrno_errno = errno;
+	return -1;
+ }
+ return 0;
+}
+
+static int lchown_cmd (char *file, int *owner, int *group)
+{
+#ifdef HAVE_LCHOWN
+ while (-1 == lchown(file, (uid_t) *owner, (gid_t) *group))
+ {
+	if (is_interrupt (errno))
+	 continue;
+
+	_pSLerrno_errno = errno;
+	return -1;
+ }
+ return 0;
+#else
+ return chown_cmd (file, owner, group);
+#endif
+}
+#endif				 /* HAVE_CHOWN */
+
+static void slget_cwd (void)
+{
+ char *p = SLpath_getcwd ();
+
+ if (p == NULL)
+ {
+	_pSLerrno_errno = errno;
+	(void) SLang_push_null ();
+	return;
+ }
+
+ (void) SLang_push_malloced_string (p); /* free string even when push fails */
+}
+
+static int chdir_cmd (char *s)
+{
+ int ret;
+
+ while (-1 == (ret = chdir (s)))
+ {
+	if (is_interrupt (errno))
+	 continue;
+
+	_pSLerrno_errno = errno;
+	break;
+ }
+ return ret;
+}
+
+#ifdef VMS
+static int remove_cmd (char *);
+/* If the file looks like xxx, then change it to xxx.dir. If
+ * it looks like A:B.xxx then change it to A:Bxxx.dir.
+ */
+
+static char *vms_convert_dirspec_to_vms_dir (char *str)
+{
+ char *s;
+ char *version;
+ unsigned int len;
+ char *dot;
+
+ len = strlen (str);
+
+ version = strchr (str, ';');
+ if (version == NULL)
+ version = str + len;
+ /* version points to the version of the input string */
+
+ if (NULL == (s = SLmalloc (len + 8)))/* allow extra space to work with */
+ return NULL;
+
+ len = (unsigned int) (version - str);
+ strncpy (s, str, len);
+ slen = 0;
+ str = s;
+
+ /* Lowercase the whole thing */
+ while (*s != 0)
+ {
+	*s = LOWER_CASE(*s);
+	s++;
+ }
+
+ if ((s > str)
+ && (s-1 != ''))
+ {
+	if ((s >= str + 4)
+	 && (0 == strcmp (s - 4, ".dir")))
+	 s -= 4;
+	goto add_dir_version;
+ }
+
+ /* Check for one of two possibilities:
+ *
+ * dev:x --> dev:x
+ * dev:a.x --> dev:ax
+ */
+
+ if (NULL == (dot = strchr (str, '.')))
+ {
+	/* First possibility */
+	if (NULL == (s = strchr (str, '')))
+	 return str;		 /* let someone else figure this out */
+	while (s1 != '')
+	 {
+	 s0 = s1;
+	 s++;
+	 }
+	*s = 0;
+	goto add_dir_version;
+ }
+
+ while (NULL != (s = strchr (dot + 1, '.')))
+ dot = s;
+
+ *dot = '';
+ s = str + (len - 1);
+
+ /* Drop */
+
+ add_dir_version:
+ strcpy (s, ".dir");
+ strcpy (s+4, version);
+ return str;
+}
+#endif
+
+static int rmdir_cmd (char *s)
+{
+#ifdef VMS
+ int status;
+
+ if (NULL == (s = vms_convert_dirspec_to_vms_dir (s)))
+ return -1;
+
+ status = remove_cmd (s);
+ SLfree (s);
+
+ return status;
+
+#else
+ int ret;
+
+ while (-1 == (ret = rmdir (s)))
+ {
+	if (is_interrupt (errno))
+	 continue;
+
+	_pSLerrno_errno = errno;
+	break;
+ }
+ return ret;
+#endif
+}
+
+static int remove_cmd (char *s)
+{
+ int ret;
+#ifdef VMS
+# define REMOVE delete
+#else
+# ifdef REAL_UNIX_SYSTEM
+# define REMOVE unlink
+# else
+# define REMOVE remove
+# endif
+#endif
+
+ while (-1 == (ret = REMOVE (s)))
+ {
+	if (is_interrupt (errno))
+	 continue;
+
+	_pSLerrno_errno = errno;
+	break;
+ }
+ return ret;
+}
+
+static int rename_cmd (char *oldpath, char *newpath)
+{
+ int ret;
+ while (-1 == (ret = rename (oldpath, newpath)))
+ {
+	if (is_interrupt (errno))
+	 continue;
+
+	_pSLerrno_errno = errno;
+	break;
+ }
+ return ret;
+}
+
+static int mkdir_cmd (void)
+{
+ int ret;
+ char *dir;
+ int mode = 0777;
+
+ if (SLang_Num_Function_Args != 1)
+ {
+	if (-1 == SLang_pop_integer (&mode))
+	 return -1;
+ }
+ if (-1 == SLang_pop_slstring (&dir))
+ return -1;
+
+ errno = 0;
+
+#if defined (__MSDOS__) && !defined(__GO32__)
+# define MKDIR(x,y) mkdir(x)
+#else
+# if defined (__os2__) && !defined (__EMX__)
+# define MKDIR(x,y) mkdir(x)
+# else
+# if (defined (__WIN32__) || defined(__WINDOWS__)) && !defined (__CYGWIN32__)
+# define MKDIR(x,y) mkdir(x)
+# else
+# define MKDIR mkdir
+# endif
+# endif
+#endif
+
+ while (-1 == (ret = MKDIR(dir, mode)))
+ {
+	if (is_interrupt (errno))
+	 continue;
+	_pSLerrno_errno = errno;
+	break;
+ }
+
+ SLang_free_slstring (dir);
+ return ret;
+}
+
+#ifdef HAVE_MKFIFO
+static int mkfifo_cmd (char *path, int *mode)
+{
+ while (-1 == mkfifo (path, *mode))
+ {
+	if (is_interrupt (errno))
+	 continue;
+
+	_pSLerrno_errno = errno;
+	return -1;
+ }
+ return 0;
+}
+#endif
+
+#if USE_LISTDIR_INTRINSIC
+
+static void free_dir_list (char **list, unsigned int num)
+{
+ unsigned int i;
+
+ if (list == NULL)
+ return;
+
+ for (i = 0; i < num; i++)
+ SLang_free_slstring (listi);
+ SLfree ((char *) list);
+}
+
+#if defined(__WIN32__) || defined(__os2__) && defined(__IBMC__)
+static int build_dirlist (char *file, char *opt, char ***listp, unsigned int *nump, unsigned int *maxnum)
+{
+# ifdef __WIN32__
+ DWORD status;
+ HANDLE h;
+ WIN32_FIND_DATA fd;
+# else
+ APIRET rc;
+ FILESTATUS3 status;
+ HDIR h;
+ FILEFINDBUF3 fd;
+ ULONG cFileNames;
+# endif
+ char *pat;
+ unsigned int len;
+ char **list;
+ unsigned int num;
+ unsigned int max_num;
+ int hok;
+
+ /* If an option is present, assume ok to list hidden files. Later
+ * I will formalize this.
+ */
+ hok = (opt != NULL);
+
+# ifdef __WIN32__
+ status = GetFileAttributes (file);
+# else
+ rc = DosQueryPathInfo(file, FIL_STANDARD, &status, sizeof(FILESTATUS3));
+# endif
+
+# ifdef __WIN32__
+ if (status == (DWORD)-1)
+ {
+	_pSLerrno_errno = ENOENT;
+	return -1;
+ }
+ if (0 == (status & FILE_ATTRIBUTE_DIRECTORY))
+ {
+	_pSLerrno_errno = ENOTDIR;
+	return -1;
+ }
+# else
+ if ((rc != 0) || (status.attrFile & FILE_DIRECTORY) == 0)
+ {
+	/* ENOTDIR isn't defined in VA3. */
+	_pSLerrno_errno = ENOENT;
+	return -1;
+ }
+# endif
+
+ len = strlen (file);
+ pat = SLmalloc (len + 3);
+ if (pat == NULL)
+ return -1;
+
+ strcpy (pat, file);
+ file = pat;
+ while (*file != 0)
+ {
+	if (*file == '/') *file = '\\';
+	file++;
+ }
+
+ if (len && (patlen-1 != '\\'))
+ {
+	patlen = '\\';
+	len++;
+ }
+ patlen++ = '*';
+ patlen = 0;
+
+ num = 0;
+ max_num = 50;
+ list = (char **)_SLcalloc (max_num, sizeof(char *));
+ if (list == NULL)
+ {
+	SLfree (pat);
+	return -1;
+ }
+
+# ifdef __WIN32__
+ h = FindFirstFile(pat, &fd);
+ if (h == INVALID_HANDLE_VALUE)
+ {
+	if (ERROR_NO_MORE_FILES != GetLastError())
+	 {
+	 SLfree (pat);
+	 SLfree ((char *)list);
+	 return -1;
+	 }
+ }
+# else
+ h = HDIR_CREATE;
+ cFileNames = 1;
+ rc = DosFindFirst(pat, &h, FILE_READONLY | FILE_DIRECTORY |
+		 FILE_ARCHIVED, &fd, sizeof(fd), &cFileNames, FIL_STANDARD);
+ if (rc != 0)
+ {
+	if (rc != ERROR_NO_MORE_FILES)
+	 {
+	 SLfree (pat);
+	 SLfree ((char *)list);
+	 return -1;
+	 }
+ }
+# endif
+ else while (1)
+ {
+	/* Do not include hidden files in the list. Also, do not
+	 * include "." and ".." entries.
+	 */
+#ifdef __WIN32__
+	file = fd.cFileName;
+#else
+	file = fd.achName;
+#endif
+	if (
+#ifdef __WIN32__
+	 (hok || (0 == (fd.dwFileAttributes & FILE_ATTRIBUTE_HIDDEN)))
+#else
+	 (hok || (0 == (fd.attrFile & FILE_HIDDEN)))
+#endif
+	 && ((*file != '.')
+		|| ((0 != strcmp (file, "."))
+		 && (0 != strcmp (file, "..")))))
+	 {
+	 if (num == max_num)
+	 {
+		 char **new_list;
+
+		 max_num += 100;
+		 new_list = (char **)SLrealloc ((char *)list, max_num * sizeof (char *));
+		 if (new_list == NULL)
+		 goto return_error;
+
+		 list = new_list;
+	 }
+
+	 file = SLang_create_slstring (file);
+	 if (file == NULL)
+	 goto return_error;
+
+	 listnum = file;
+	 num++;
+	 }
+
+#ifdef __WIN32__
+	if (FALSE == FindNextFile(h, &fd))
+	 {
+	 if (ERROR_NO_MORE_FILES == GetLastError())
+	 {
+		 FindClose (h);
+		 break;
+	 }
+
+	 _pSLerrno_errno = errno;
+	 FindClose (h);
+	 goto return_error;
+	 }
+#else
+ cFileNames = 1;
+ rc = DosFindNext(h, &fd, sizeof(fd), &cFileNames);
+ if (rc != 0)
+	 {
+	 if (rc == ERROR_NO_MORE_FILES)
+	 {
+		 DosFindClose (h);
+		 break;
+	 }
+
+	 _pSLerrno_errno = errno;
+	 DosFindClose (h);
+	 goto return_error;
+	 }
+#endif
+ }
+
+ SLfree (pat);
+ *maxnum = max_num;
+ *nump = num;
+ *listp = list;
+ return 0;
+
+ return_error:
+ free_dir_list (list, num);
+ SLfree (pat);
+ return -1;
+}
+
+#else				 /* NOT __WIN32__ */
+
+static int build_dirlist (char *dir, char *opt, char ***listp, unsigned int *nump, unsigned int *maxnum)
+{
+ DIR *dp;
+ struct dirent *ep;
+ unsigned int num_files;
+ unsigned int max_num_files;
+ char **list;
+
+ (void) opt;
+
+ if (NULL == (dp = opendir (dir)))
+ {
+	_pSLerrno_errno = errno;
+	return -1;
+ }
+
+ num_files = max_num_files = 0;
+ list = NULL;
+ while (1)
+ {
+	unsigned int len;
+	char *name;
+
+	errno = 0;
+	if (NULL == (ep = SLSYSWRAP_READDIR (dp)))
+	 {
+	 if (errno == 0)
+	 break;
+
+	 if (is_interrupt (errno))
+	 continue;
+	 _pSLerrno_errno = errno;
+	 goto return_error;
+	 }
+
+	name = ep->d_name;
+# ifdef NEED_D_NAMLEN
+	len = ep->d_namlen;
+# else
+	len = strlen (name);
+# endif
+	if ((*name == '.') && (len <= 2))
+	 {
+	 if (len == 1) continue;
+	 if (name 1 == '.') continue;
+	 }
+
+	if (num_files == max_num_files)
+	 {
+	 char **new_list;
+
+	 max_num_files += 100;
+	 if (NULL == (new_list = (char **) SLrealloc ((char *)list, max_num_files * sizeof(char *))))
+	 goto return_error;
+
+	 list = new_list;
+	 }
+
+	if (NULL == (listnum_files = SLang_create_nslstring (name, len)))
+	 goto return_error;
+
+	num_files++;
+ }
+
+ closedir (dp);
+ *nump = num_files;
+ *maxnum = max_num_files;
+ *listp = list;
+ return 0;
+
+ return_error:
+ if (dp != NULL)
+ closedir (dp);
+ free_dir_list (list, num_files);
+ return -1;
+}
+# endif				 /* NOT __WIN32__ */
+
+static void listdir_cmd (char *dir, char *opt)
+{
+ SLang_Array_Type *at;
+ unsigned int num_files;
+ unsigned int max_num_files;
+ SLindex_Type inum_files;
+ char **list;
+
+ if (-1 == build_dirlist (dir, opt, &list, &num_files, &max_num_files))
+ {
+	SLang_push_null ();
+	return;
+ }
+ /* If max_num_files == 0, then num_files == 0 and list == NULL.
+ * The realloc step below will malloc list for us.
+ */
+ if (num_files + 1 < max_num_files)
+ {
+	char **new_list;
+	if (NULL == (new_list = (char **) SLrealloc ((char *)list, (num_files + 1)* sizeof(char*))))
+	 {
+	 free_dir_list (list, num_files);
+	 SLang_push_null ();
+	 return;
+	 }
+	list = new_list;
+ }
+
+ inum_files = (SLindex_Type) num_files;
+ if (NULL == (at = SLang_create_array (SLANG_STRING_TYPE, 0, (VOID_STAR) list, &inum_files, 1)))
+ {
+	free_dir_list (list, num_files);
+	SLang_push_null ();
+	return;
+ }
+
+ /* Allow the array to free this list if push fails */
+ if (-1 == SLang_push_array (at, 1))
+ SLang_push_null ();
+}
+
+static void listdir_cmd_wrap (void)
+{
+ char *s, *sopt;
+
+ sopt = NULL;
+ switch (SLang_Num_Function_Args)
+ {
+ case 2:
+	if (-1 == SLang_pop_slstring (&sopt))
+	 return;
+ case 1:
+	if (-1 == SLang_pop_slstring (&s))
+	 {
+	 SLang_free_slstring (sopt);
+	 return;
+	 }
+	break;
+
+ default:
+	_pSLang_verror (SL_Usage_Error, "Usage: listdir (string)"); /* FIXME */
+	return;
+ }
+
+ listdir_cmd (s, sopt);
+ SLang_free_slstring (s);
+ SLang_free_slstring (sopt);
+}
+
+#endif				 /* USE_LISTDIR_INTRINSIC */
+
+#ifdef HAVE_UMASK
+static int umask_cmd (int *u)
+{
+ return umask (*u);
+}
+#endif
+
+#if defined(R_OK) && defined(W_OK) && defined(X_OK) && defined (F_OK)
+# define HAS_ACCESS_CMD 1
+#else
+# define HAS_ACCESS_CMD 0
+#endif
+
+#if HAS_ACCESS_CMD
+static int access_cmd (char *path, int *modep)
+{
+ int mode = *modep & (R_OK|W_OK|X_OK|F_OK);
+
+ while (-1 == access (path, mode))
+ {
+	if (is_interrupt (errno))
+	 continue;
+
+	_pSLerrno_errno = errno;
+	return -1;
+ }
+ return 0;
+}
+#endif
+
+static SLang_Intrin_Fun_Type PosixDir_Name_Table =
+{
+#ifdef HAVE_READLINK
+ MAKE_INTRINSIC_S("readlink", readlink_cmd, SLANG_VOID_TYPE),
+#endif
+#ifdef HAVE_SYMLINK
+ MAKE_INTRINSIC_SS("symlink", symlink_cmd, SLANG_INT_TYPE),
+#endif
+#ifdef HAVE_LINK
+ MAKE_INTRINSIC_SS("hardlink", hardlink_cmd, SLANG_INT_TYPE),
+#endif
+ MAKE_INTRINSIC_S("lstat_file", lstat_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("stat_file", stat_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_SI("stat_is", stat_is_cmd, SLANG_CHAR_TYPE),
+#ifdef HAVE_MKFIFO
+ MAKE_INTRINSIC_SI("mkfifo", mkfifo_cmd, SLANG_INT_TYPE),
+#endif
+#ifdef HAVE_CHOWN
+ MAKE_INTRINSIC_SII("chown", chown_cmd, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_SII("lchown", lchown_cmd, SLANG_INT_TYPE),
+#endif
+ MAKE_INTRINSIC_SI("chmod", chmod_cmd, SLANG_INT_TYPE),
+#ifdef HAVE_UMASK
+ MAKE_INTRINSIC_I("umask", umask_cmd, SLANG_INT_TYPE),
+#endif
+ MAKE_INTRINSIC_0("getcwd", slget_cwd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("mkdir", mkdir_cmd, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_S("chdir", chdir_cmd, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_S("rmdir", rmdir_cmd, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_S("remove", remove_cmd, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_SS("rename", rename_cmd, SLANG_INT_TYPE),
+#if HAS_ACCESS_CMD
+ MAKE_INTRINSIC_SI("access", access_cmd, SLANG_INT_TYPE),
+#endif
+#if USE_LISTDIR_INTRINSIC
+ MAKE_INTRINSIC("listdir", listdir_cmd_wrap, SLANG_VOID_TYPE, 0),
+#endif
+#ifdef HAVE_UTIME
+ MAKE_INTRINSIC_3("utime", utime_intrin, SLANG_INT_TYPE, SLANG_STRING_TYPE, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE),
+#endif
+#ifdef HAVE_STATVFS
+ MAKE_INTRINSIC_0("statvfs", statvfs_cmd, SLANG_VOID_TYPE),
+#endif
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static SLang_IConstant_Type PosixDir_Consts =
+{
+#ifndef S_IRWXU
+# define S_IRWXU 00700
+#endif
+ MAKE_ICONSTANT("S_IRWXU", S_IRWXU),
+#ifndef S_IRUSR
+# define S_IRUSR 00400
+#endif
+ MAKE_ICONSTANT("S_IRUSR", S_IRUSR),
+#ifndef S_IWUSR
+# define S_IWUSR 00200
+#endif
+ MAKE_ICONSTANT("S_IWUSR", S_IWUSR),
+#ifndef S_IXUSR
+# define S_IXUSR 00100
+#endif
+ MAKE_ICONSTANT("S_IXUSR", S_IXUSR),
+#ifndef S_IRWXG
+# define S_IRWXG 00070
+#endif
+ MAKE_ICONSTANT("S_IRWXG", S_IRWXG),
+#ifndef S_IRGRP
+# define S_IRGRP 00040
+#endif
+ MAKE_ICONSTANT("S_IRGRP", S_IRGRP),
+#ifndef S_IWGRP
+# define S_IWGRP 00020
+#endif
+ MAKE_ICONSTANT("S_IWGRP", S_IWGRP),
+#ifndef S_IXGRP
+# define S_IXGRP 00010
+#endif
+ MAKE_ICONSTANT("S_IXGRP", S_IXGRP),
+#ifndef S_IRWXO
+# define S_IRWXO 00007
+#endif
+ MAKE_ICONSTANT("S_IRWXO", S_IRWXO),
+#ifndef S_IROTH
+# define S_IROTH 00004
+#endif
+ MAKE_ICONSTANT("S_IROTH", S_IROTH),
+#ifndef S_IWOTH
+# define S_IWOTH 00002
+#endif
+ MAKE_ICONSTANT("S_IWOTH", S_IWOTH),
+#ifndef S_IXOTH
+# define S_IXOTH 00001
+#endif
+ MAKE_ICONSTANT("S_IXOTH", S_IXOTH),
+#ifdef __WIN32__
+ MAKE_ICONSTANT("FILE_ATTRIBUTE_ARCHIVE", FILE_ATTRIBUTE_ARCHIVE),
+ MAKE_ICONSTANT("FILE_ATTRIBUTE_COMPRESSED", FILE_ATTRIBUTE_COMPRESSED),
+ MAKE_ICONSTANT("FILE_ATTRIBUTE_NORMAL", FILE_ATTRIBUTE_NORMAL),
+ MAKE_ICONSTANT("FILE_ATTRIBUTE_DIRECTORY", FILE_ATTRIBUTE_DIRECTORY),
+ MAKE_ICONSTANT("FILE_ATTRIBUTE_HIDDEN", FILE_ATTRIBUTE_HIDDEN),
+ MAKE_ICONSTANT("FILE_ATTRIBUTE_READONLY", FILE_ATTRIBUTE_READONLY),
+ MAKE_ICONSTANT("FILE_ATTRIBUTE_SYSTEM", FILE_ATTRIBUTE_SYSTEM),
+ MAKE_ICONSTANT("FILE_ATTRIBUTE_TEMPORARY", FILE_ATTRIBUTE_TEMPORARY),
+#endif
+#if HAS_ACCESS_CMD
+ MAKE_ICONSTANT("R_OK", R_OK),
+ MAKE_ICONSTANT("W_OK", W_OK),
+ MAKE_ICONSTANT("X_OK", X_OK),
+ MAKE_ICONSTANT("F_OK", F_OK),
+#endif
+#ifdef ST_RDONLY
+ MAKE_ICONSTANT("ST_RDONLY", ST_RDONLY),
+#endif
+#ifdef ST_NOSUID
+ MAKE_ICONSTANT("ST_NOSUID", ST_NOSUID),
+#endif
+ SLANG_END_ICONST_TABLE
+};
+
+static int Initialized;
+
+int SLang_init_posix_dir (void)
+{
+ if (Initialized)
+ return 0;
+
+ if ((-1 == SLadd_intrin_fun_table(PosixDir_Name_Table, "__POSIX_DIR__"))
+ || (-1 == SLadd_iconstant_table (PosixDir_Consts, NULL))
+ || (-1 == _pSLerrno_init ()))
+ return -1;
+
+ Initialized = 1;
+
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slposio.c Added

@@ -0,0 +1,1218 @@
+/* This module implements an interface to posix system calls */
+/* file stdio intrinsics for S-Lang */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#if defined(__unix__) || (defined (__os2__) && defined (__EMX__))
+# include <sys/types.h>
+#endif
+
+#ifdef HAVE_FCNTL_H
+# include <fcntl.h>
+#else
+# ifdef HAVE_SYS_FCNTL_H
+# include <sys/fcntl.h>
+# endif
+#endif
+
+#ifdef __unix__
+# include <sys/file.h>
+#endif
+
+#ifdef HAVE_IO_H
+# include <io.h>
+#endif
+
+#if defined(__BORLANDC__)
+# include <dir.h>
+#endif
+
+#if defined(__DECC) && defined(VMS)
+# include <unixio.h>
+# include <unixlib.h>
+#endif
+
+#ifdef VMS
+# include <stat.h>
+#else
+# include <sys/stat.h>
+#endif
+
+#include <errno.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+#define SLSYSWRAP_OPEN open
+#define SLSYSWRAP_READ read
+#define SLSYSWRAP_WRITE write
+#ifdef SLSYSWRAP
+# include <slsyswrap.h>
+#endif
+
+typedef struct _Stdio_MMT_List_Type
+{
+ SLang_MMT_Type *stdio_mmt;
+ struct _Stdio_MMT_List_Type *next;
+}
+Stdio_MMT_List_Type;
+
+struct _pSLFile_FD_Type
+{
+ char *name;
+ unsigned int num_refs;	 /* reference counting */
+ int fd;			 /* used if get_fd method is NULL */
+
+ Stdio_MMT_List_Type *stdio_mmt_list;/* fdopen'd stdio objects */
+
+ int is_closed;		 /* non-zero if closed */
+
+#define _SLFD_NO_AUTO_CLOSE	1
+ unsigned int flags;
+
+ /* methods */
+ int clientdata_id;
+ VOID_STAR clientdata;
+ void (*free_client_data)(VOID_STAR);
+
+ int (*get_fd) (VOID_STAR, int *);
+ /* If non-NULL, get_fd will be used to obtain the descriptor when needed */
+
+ int (*close) (VOID_STAR);
+ int (*read)(VOID_STAR, char *, unsigned int);
+ int (*write)(VOID_STAR, char *, unsigned int);
+ SLFile_FD_Type *(*dup)(VOID_STAR);
+
+ SLFile_FD_Type *next;	 /* next in the list */
+};
+
+static int get_fd (SLFile_FD_Type *f, int *fdp)
+{
+ if (f->is_closed == 0)
+ {
+	if (f->get_fd == NULL)
+	 {
+	 *fdp = f->fd;
+	 return 0;
+	 }
+
+	if (0 == (*f->get_fd)(f->clientdata, fdp))
+	 return 0;
+ }
+ *fdp = -1;
+#ifdef EBADF
+ SLerrno_set_errno (EBADF);
+#endif
+ return -1;
+}
+
+static SLFile_FD_Type *FD_Type_List = NULL;
+
+static void chain_fd_type (SLFile_FD_Type *f)
+{
+ f->next = FD_Type_List;
+ FD_Type_List = f;
+}
+
+static void unchain_fdtype (SLFile_FD_Type *f)
+{
+ SLFile_FD_Type *curr;
+
+ curr = FD_Type_List;
+ if (curr == f)
+ {
+	FD_Type_List = f->next;
+	return;
+ }
+
+ while (curr != NULL)
+ {
+	SLFile_FD_Type *prev = curr;
+	curr = curr->next;
+	if (curr == f)
+	 {
+	 prev->next = f->next;
+	 return;
+	 }
+ }
+}
+
+static SLFile_FD_Type *find_chained_fd (int fd)
+{
+ SLFile_FD_Type *f;
+
+ f = FD_Type_List;
+ while (f != NULL)
+ {
+	int fd1;
+
+	if ((0 == get_fd (f, &fd1))
+	 && (fd1 == fd))
+	 return f;
+
+	f = f->next;
+ }
+
+ return NULL;
+}
+
+/* This function gets called when the fclose intrinsic is called on an fdopen
+ * derived object.
+ */
+void _pSLfclose_fdopen_fp (SLang_MMT_Type *mmt)
+{
+ SLFile_FD_Type *f;
+
+ f = FD_Type_List;
+ while (f != NULL)
+ {
+	Stdio_MMT_List_Type *prev, *curr;
+
+	prev = NULL;
+	curr = f->stdio_mmt_list;
+	while (curr != NULL)
+	 {
+	 if (curr->stdio_mmt != mmt)
+	 {
+		 prev = curr;
+		 curr = curr->next;
+		 continue;
+	 }
+
+	 if (prev == NULL)
+	 f->stdio_mmt_list = curr->next;
+	 else
+	 prev->next = curr->next;
+
+	 SLang_free_mmt (mmt);
+	 SLfree ((char *) curr);
+	 /* Do not attempt to close the descriptor since fclose did it.
+	 * This avoids a problem if a new descriptor with the same fd
+	 * has been created before this has been called, e.g.,
+	 * fd = open(); fp = fdopen(fd); fclose(fp); fd = open();
+	 * The last open is the problem, since it is equive to the following:
+	 * tmp = open(); close(fd); fd = tmp;
+	 * Here, after the first open, tmp may be set to the same integer
+	 * as fd.
+	 */
+	 f->is_closed = 1;
+	 return;
+	 }
+	f = f->next;
+ }
+}
+
+static void free_stdio_mmts (SLFile_FD_Type *f)
+{
+ Stdio_MMT_List_Type *curr = f->stdio_mmt_list;
+
+ while (curr != NULL)
+ {
+	Stdio_MMT_List_Type *next = curr->next;
+	SLang_free_mmt (curr->stdio_mmt);
+	SLfree ((char *) curr);
+	curr = next;
+ }
+ f->stdio_mmt_list = NULL;
+}
+
+static Stdio_MMT_List_Type *alloc_stdio_list_elem (void)
+{
+ Stdio_MMT_List_Type *elem;
+
+ elem = (Stdio_MMT_List_Type *) SLmalloc(sizeof(Stdio_MMT_List_Type));
+ if (elem != NULL)
+ memset ((char *)elem, 0, sizeof (Stdio_MMT_List_Type));
+ return elem;
+}
+
+/* Returns 0 the system call should not be restarted, 1 otherwise */
+static int is_interrupt (int e, int check_eagain)
+{
+ SLerrno_set_errno (e);
+
+#ifdef EINTR
+ if (e == EINTR)
+ {
+	if (0 == SLang_handle_interrupt ())
+	 return 1;
+ }
+#endif
+#ifdef EAGAIN
+ if (e == EAGAIN)
+ {
+	if (check_eagain
+	 && (0 == SLang_handle_interrupt ()))
+	 return 1;
+ }
+#endif
+ return 0;
+}
+
+static int do_close (SLFile_FD_Type *f)
+{
+ int fd;
+ int status;
+
+ if (-1 == get_fd (f, &fd))
+ return -1;
+
+ errno = 0;
+ if (f->close != NULL)
+ status = (*f->close)(f->clientdata);
+ else
+ status = close (fd);
+
+ if (status == 0)
+ {
+	f->fd = -1;
+	f->is_closed = 1;
+	if ((f->clientdata != NULL) && (f->free_client_data != NULL))
+	 (*f->free_client_data) (f->clientdata);
+	f->clientdata = NULL;
+	return status;
+ }
+
+ /* see http://lwn.net/Articles/576478/ */
+ if (0 == is_interrupt (errno, 1))
+ return -1;
+
+ return 0;
+}
+
+static int do_write (SLFile_FD_Type *f, char *buf, SLstrlen_Type *nump)
+{
+ int fd;
+
+ if (-1 == get_fd (f, &fd))
+ {
+	*nump = 0;
+	return -1;
+ }
+
+ while (1)
+ {
+	ssize_t num;
+
+	errno = 0;
+	if (f->write != NULL)
+	 num = (*f->write)(f->clientdata, buf, *nump);
+	else
+	 num = SLSYSWRAP_WRITE (fd, buf, *nump);
+
+	if (num != -1)
+	 {
+	 *nump = (unsigned int) num;
+	 return 0;
+	 }
+
+	if (is_interrupt (errno, 0))
+	 continue;
+
+	*nump = 0;
+	return -1;
+ }
+}
+
+static int do_read (SLFile_FD_Type *f, char *buf, unsigned int *nump)
+{
+ int fd;
+
+ if (-1 == get_fd (f, &fd))
+ {
+	*nump = 0;
+	return -1;
+ }
+
+ while (1)
+ {
+	int num;
+
+	errno = 0;
+	if (f->read != NULL)
+	 num = (*f->read)(f->clientdata, buf, *nump);
+	else
+	 num = SLSYSWRAP_READ (fd, buf, *nump);
+
+	if (num != -1)
+	 {
+	 *nump = (unsigned int) num;
+	 return 0;
+	 }
+
+	if (is_interrupt (errno, 0))
+	 continue;
+
+	*nump = 0;
+	return -1;
+ }
+}
+
+static int posix_close_fd (int *fd)
+{
+ if (-1 == close (*fd))
+ {
+	/* see http://lwn.net/Articles/576478/ */
+	if (0 == is_interrupt (errno, 1))
+	 return -1;
+ }
+ return 0;
+}
+
+static int posix_close_slfd (SLFile_FD_Type *f)
+{
+ int status = do_close (f);
+
+ free_stdio_mmts (f);
+ return status;
+}
+
+/* Usage: Uint write (f, buf); */
+static void posix_write (SLFile_FD_Type *f, SLang_BString_Type *bstr)
+{
+ SLstrlen_Type len;
+ char *p;
+
+ if ((NULL == (p = (char *)SLbstring_get_pointer (bstr, &len)))
+ || (-1 == do_write (f, p, &len)))
+ {
+	SLang_push_integer (-1);
+	return;
+ }
+ (void) SLang_push_uinteger (len);
+}
+
+/* Usage: nn = read (f, &buf, n); */
+static void posix_read (SLFile_FD_Type *f, SLang_Ref_Type *ref, unsigned int *nbytes)
+{
+ unsigned int len;
+ char *b;
+ SLang_BString_Type *bstr;
+
+ b = NULL;
+
+ len = *nbytes;
+ if ((NULL == (b = (char *)SLmalloc (len + 1)))
+ || (-1 == do_read (f, b, &len)))
+ goto return_error;
+
+ if (len != *nbytes)
+ {
+	char *b1 = (char *)SLrealloc (b, len + 1);
+	if (b1 == NULL)
+	 goto return_error;
+	b = b1;
+ }
+
+ bstr = SLbstring_create_malloced ((unsigned char *) b, len, 0);
+ if (bstr != NULL)
+ {
+	if (-1 == SLang_assign_to_ref (ref, SLANG_BSTRING_TYPE, (VOID_STAR)&bstr))
+	 {
+	 SLbstring_free (bstr);
+	 return;
+	 }
+	SLbstring_free (bstr);
+	(void) SLang_push_uinteger (len);
+	return;
+ }
+
+ return_error:
+ if (b != NULL) SLfree ((char *)b);
+ (void) SLang_assign_to_ref (ref, SLANG_NULL_TYPE, NULL);
+ (void) SLang_push_integer (-1);
+}
+
+SLFile_FD_Type *SLfile_create_fd (SLFUTURE_CONST char *name, int fd)
+{
+ SLFile_FD_Type *f;
+
+ if (name == NULL)
+ name = "";
+
+ if (NULL == (f = (SLFile_FD_Type *) SLmalloc (sizeof (SLFile_FD_Type))))
+ return NULL;
+
+ memset ((char *) f, 0, sizeof (SLFile_FD_Type));
+ if (NULL == (f->name = SLang_create_slstring (name)))
+ {
+	SLfree ((char *)f);
+	return NULL;
+ }
+
+ f->fd = fd;
+ f->num_refs = 1;
+
+ f->clientdata_id = 0;
+ f->clientdata = NULL;
+ /* If NULL, use the standard routines on a file descriptor */
+ f->close = NULL;
+ f->read = NULL;
+ f->write = NULL;
+
+ chain_fd_type (f);
+
+ return f;
+}
+
+int SLfile_set_getfd_method (SLFile_FD_Type *f, int (*func)(VOID_STAR, int *))
+{
+ if (f == NULL)
+ return -1;
+ f->get_fd = func;
+ return 0;
+}
+
+int Last_Client_Data_ID = 0;
+int SLfile_create_clientdata_id (int *idp)
+{
+ if (Last_Client_Data_ID != -1)
+ Last_Client_Data_ID++;
+
+ if (Last_Client_Data_ID == -1)
+ {
+	*idp = -1;
+	return -1;
+ }
+ *idp = Last_Client_Data_ID;
+ return 0;
+}
+
+int SLfile_get_clientdata (SLFile_FD_Type *f, int id, VOID_STAR *cdp)
+{
+ if ((f == NULL)
+ || (f->clientdata_id != id))
+ {
+	*cdp = NULL;
+	return -1;
+ }
+
+ *cdp = f->clientdata;
+ return 0;
+}
+
+int SLfile_set_clientdata (SLFile_FD_Type *f, void (*func)(VOID_STAR), VOID_STAR cd, int id)
+{
+ if (f == NULL)
+ return -1;
+ if (id == -1)
+ {
+	_pSLang_verror (SL_Application_Error, "SLfile_set_client_data: invalid id");
+	return -1;
+ }
+
+ f->free_client_data = func;
+ f->clientdata = cd;
+ f->clientdata_id = id;
+ return 0;
+}
+
+int SLfile_set_close_method (SLFile_FD_Type *f, int (*func)(VOID_STAR))
+{
+ if (f == NULL)
+ return -1;
+ f->close = func;
+ return 0;
+}
+
+int SLfile_set_read_method (SLFile_FD_Type *f, int (*func)(VOID_STAR, char*, unsigned int))
+{
+ if (f == NULL)
+ return -1;
+ f->read = func;
+ return 0;
+}
+
+int SLfile_set_write_method (SLFile_FD_Type *f, int (*func)(VOID_STAR, char*, unsigned int))
+{
+ if (f == NULL)
+ return -1;
+ f->write = func;
+ return 0;
+}
+
+int SLfile_set_dup_method (SLFile_FD_Type *f, SLFile_FD_Type *(*func)(VOID_STAR))
+{
+ if (f == NULL)
+ return -1;
+ f->dup = func;
+ return 0;
+}
+
+SLFile_FD_Type *SLfile_dup_fd (SLFile_FD_Type *f0)
+{
+ SLFile_FD_Type *f;
+ int fd0, fd;
+
+ if (f0 == NULL)
+ return NULL;
+
+ if (-1 == get_fd (f0, &fd0))
+ return NULL;
+
+ if (f0->dup != NULL)
+ return (*f0->dup)(f0->clientdata);
+
+ while (-1 == (fd = dup (fd0)))
+ {
+	if (is_interrupt (errno, 1))
+	 continue;
+
+	return NULL;
+ }
+
+ if (NULL == (f = SLfile_create_fd (f0->name, fd)))
+ {
+	(void) close (fd);
+	return NULL;
+ }
+
+ return f;
+}
+
+/* Not yet a public function */
+static int SLfile_dup2_fd (SLFile_FD_Type *f0, int newfd)
+{
+ int fd0, fd;
+
+ if ((f0 == NULL)
+ || (-1 == get_fd (f0, &fd0)))
+ {
+#ifdef EBADF
+	SLerrno_set_errno (EBADF);
+#endif
+	return -1;
+ }
+
+ while (-1 == (fd = dup2 (fd0, newfd)))
+ {
+	if (is_interrupt (errno, 1))
+	 continue;
+
+	return -1;
+ }
+ return fd;
+}
+
+int SLfile_get_fd (SLFile_FD_Type *f, int *fd)
+{
+ if (f == NULL)
+ return -1;
+
+ return get_fd (f, fd);
+}
+
+void SLfile_free_fd (SLFile_FD_Type *f)
+{
+ if (f == NULL)
+ return;
+
+ if (f->num_refs > 1)
+ {
+	f->num_refs -= 1;
+	return;
+ }
+
+ if (0 == (f->flags & _SLFD_NO_AUTO_CLOSE))
+ (void) do_close (f);
+
+ if ((f->clientdata != NULL)
+ && (f->free_client_data != NULL))
+ (*f->free_client_data) (f->clientdata);
+
+ free_stdio_mmts (f);
+
+ unchain_fdtype (f);
+
+ SLfree ((char *) f);
+}
+
+static int pop_string_int (char **s, int *i)
+{
+ *s = NULL;
+ if ((-1 == SLang_pop_integer (i))
+ || (-1 == SLang_pop_slstring (s)))
+ return -1;
+
+ return 0;
+}
+
+static int pop_string_int_int (char **s, int *a, int *b)
+{
+ *s = NULL;
+ if ((-1 == SLang_pop_integer (b))
+ || (-1 == pop_string_int (s, a)))
+ return -1;
+
+ return 0;
+}
+
+static void posix_open (void)
+{
+ char *file;
+ int mode, flags;
+ SLFile_FD_Type *f;
+
+ switch (SLang_Num_Function_Args)
+ {
+ case 3:
+	if (-1 == pop_string_int_int (&file, &flags, &mode))
+	 {
+	 SLang_push_null ();
+	 return;
+	 }
+	break;
+
+ case 2:
+ default:
+	if (-1 == pop_string_int (&file, &flags))
+	 return;
+	mode = 0777;
+	break;
+ }
+
+ f = SLfile_create_fd (file, -1);
+ if (f == NULL)
+ {
+	SLang_free_slstring (file);
+	SLang_push_null ();
+	return;
+ }
+ SLang_free_slstring (file);
+
+ while (-1 == (f->fd = SLSYSWRAP_OPEN (f->name, flags, mode)))
+ {
+	int e = errno;
+	if (is_interrupt (errno, 1))
+	 continue;
+
+	SLfile_free_fd (f);	 /* could affect errno */
+	SLerrno_set_errno (e);
+	SLang_push_null ();
+	return;
+ }
+
+ if (-1 == SLfile_push_fd (f))
+ SLang_push_null ();
+ SLfile_free_fd (f);
+}
+
+static int dummy_close (VOID_STAR cd)
+{
+ (void) cd;
+ return 0;
+}
+
+static int posix_fileno_int (void)
+{
+ int fd;
+ SLFile_FD_Type *f;
+
+ if (SLang_peek_at_stack () == SLANG_FILE_PTR_TYPE)
+ {
+	SLang_MMT_Type *mmt;
+	FILE *fp;
+
+	if (-1 == SLang_pop_fileptr (&mmt, &fp))
+	 return -1;
+
+	fd = fileno (fp);
+	SLang_free_mmt (mmt);
+	return fd;
+ }
+
+ if (-1 == SLfile_pop_fd (&f))
+ return -1;
+
+ if (-1 == get_fd (f, &fd))
+ fd = -1;
+
+ SLfile_free_fd (f);
+ return fd;
+}
+
+static void posix_fileno (void)
+{
+ FILE *fp;
+ SLang_MMT_Type *mmt;
+ int fd;
+ SLFile_FD_Type *f;
+ SLFUTURE_CONST char *name;
+
+ if (-1 == SLang_pop_fileptr (&mmt, &fp))
+ {
+	SLang_push_null ();
+	return;
+ }
+ name = SLang_get_name_from_fileptr (mmt);
+ fd = fileno (fp);
+
+ f = SLfile_create_fd (name, fd);
+ if (f != NULL)
+ {
+	/* prevent fd from being closed when it goes out of scope */
+	f->flags |= _SLFD_NO_AUTO_CLOSE;
+	f->close = dummy_close;
+ }
+
+ SLang_free_mmt (mmt);
+
+ if (-1 == SLfile_push_fd (f))
+ SLang_push_null ();
+ SLfile_free_fd (f);
+}
+
+static void posix_fdopen (SLFile_FD_Type *f, char *mode)
+{
+ Stdio_MMT_List_Type *elem;
+
+ if (NULL == (elem = alloc_stdio_list_elem ()))
+ return;
+
+ if (-1 == _pSLstdio_fdopen (f->name, f->fd, mode))
+ {
+	SLfree ((char *)elem);
+	return;
+ }
+
+ if (NULL == (elem->stdio_mmt = SLang_pop_mmt (SLANG_FILE_PTR_TYPE)))
+ {
+	SLfree ((char *) elem);
+	return;
+ }
+
+ if (-1 == SLang_push_mmt (elem->stdio_mmt))
+ {
+	SLfree ((char *) elem);
+	return;
+ }
+
+ elem->next = f->stdio_mmt_list;
+ f->stdio_mmt_list = elem;
+}
+
+static void posix_lseek (SLFile_FD_Type *f, _pSLc_off_t_Type *ofs, int *whence)
+{
+ _pSLc_off_t_Type status;
+ int fd;
+
+ if (-1 == (status = get_fd (f, &fd)))
+ goto the_return;
+
+ while (-1 == (status = lseek (fd, *ofs, *whence)))
+ {
+	if (0 == is_interrupt (errno, 1))
+	 break;
+ }
+
+the_return:
+
+ (void) SLANG_PUSH_OFF_T (status);
+}
+
+static int pop_fd (int *fdp, SLFile_FD_Type **fp, SLang_MMT_Type **mmtp)
+{
+ int fd;
+
+ *fp = NULL; *mmtp = NULL;
+
+ switch (SLang_peek_at_stack ())
+ {
+ case SLANG_FILE_PTR_TYPE:
+	 {
+	 SLang_MMT_Type *mmt;
+	 FILE *p;
+
+	 if (-1 == SLang_pop_fileptr (&mmt, &p))
+	 return -1;
+	 fd = fileno (p);
+	 *mmtp = mmt;
+	 }
+	break;
+
+ case SLANG_FILE_FD_TYPE:
+	 {
+	 SLFile_FD_Type *f;
+	 if (-1 == SLfile_pop_fd (&f))
+	 return -1;
+	 if (-1 == get_fd (f, &fd))
+	 {
+		 SLfile_free_fd (f);
+		 return -1;
+	 }
+	 }
+	break;
+
+ default:
+	if (-1 == SLang_pop_int (&fd))
+	 return -1;
+ }
+ *fdp = fd;
+ return 0;
+}
+
+static int posix_isatty (void)
+{
+ int ret;
+ SLFile_FD_Type *f;
+ SLang_MMT_Type *mmt;
+ int fd;
+
+ if (-1 == pop_fd (&fd, &f, &mmt))
+ return 0;		 /* invalid descriptor */
+
+ if (0 == (ret = isatty (fd)))
+ _pSLerrno_errno = errno;
+
+ if (mmt != NULL) SLang_free_mmt (mmt);
+ if (f != NULL) SLfile_free_fd (f);
+
+ return ret;
+}
+
+#ifdef HAVE_TTYNAME_R
+/* Older POSIX standards had a different interface for this. Avoid it. */
+# if !defined(_POSIX_C_SOURCE) || (_POSIX_C_SOURCE < 199506L)
+# undef HAVE_TTYNAME_R
+# endif
+#endif
+
+#ifdef HAVE_TTYNAME_R
+# define TTYNAME_R ttyname_r
+#else
+# ifdef HAVE_TTYNAME
+# define TTYNAME_R my_ttyname_r
+static int my_ttyname_r (int fd, char *buf, size_t buflen)
+{
+ char *tty = ttyname (fd);
+ if (tty == NULL)
+ {
+	int e = errno;
+	if (e == 0)
+	 e = -1;
+	return e;
+ }
+ strncpy (buf, tty, buflen);
+ bufbuflen-1 = 0;
+ return 0;
+}
+# endif
+#endif
+
+#ifdef TTYNAME_R
+static void posix_ttyname (void)
+{
+ SLFile_FD_Type *f;
+ SLang_MMT_Type *mmt;
+ int fd;
+ char buf512;
+ int e;
+
+ if (SLang_Num_Function_Args == 0)
+ {
+	fd = 0;
+	f = NULL;
+	mmt = NULL;
+ }
+ else if (-1 == pop_fd (&fd, &f, &mmt))
+ return;
+
+ if (0 != (e = TTYNAME_R (fd, buf, sizeof(buf))))
+ {
+	_pSLerrno_errno = e;
+	SLang_push_null ();
+ }
+ else
+ (void) SLang_push_string (buf);
+
+ if (mmt != NULL) SLang_free_mmt (mmt);
+ if (f != NULL) SLfile_free_fd (f);
+}
+#endif
+
+static void posix_dup (SLFile_FD_Type *f)
+{
+ if ((NULL == (f = SLfile_dup_fd (f)))
+ || (-1 == SLfile_push_fd (f)))
+ SLang_push_null ();
+
+ SLfile_free_fd (f);
+}
+
+static int posix_dup2 (SLFile_FD_Type *f, int *new_fd)
+{
+ return SLfile_dup2_fd (f, *new_fd);
+}
+
+static int fdtype_datatype_deref (SLtype type)
+{
+ SLFile_FD_Type *f;
+ int status;
+ int fd;
+
+ (void) type;
+
+ if (-1 == SLang_pop_int (&fd))
+ return -1;
+#ifdef F_GETFL
+ while (-1 == fcntl (fd, F_GETFL))
+ {
+	if (is_interrupt (errno, 1))
+	 continue;
+
+	return SLang_push_null ();
+ }
+#endif
+ f = find_chained_fd (fd);
+ if (f != NULL)
+ return SLfile_push_fd (f);
+
+ /* The descriptor is valid, but we have no record of what it is. So make sure
+ * it is not automatically closed.
+ */
+ if (NULL == (f = SLfile_create_fd (NULL, fd)))
+ return -1;
+ f->flags |= _SLFD_NO_AUTO_CLOSE;
+
+ status = SLfile_push_fd (f);
+ SLfile_free_fd (f);
+ return status;
+}
+
+#define I SLANG_INT_TYPE
+#define V SLANG_VOID_TYPE
+#define F SLANG_FILE_FD_TYPE
+#define B SLANG_BSTRING_TYPE
+#define R SLANG_REF_TYPE
+#define U SLANG_UINT_TYPE
+#define S SLANG_STRING_TYPE
+#define L SLANG_LONG_TYPE
+static SLang_Intrin_Fun_Type Fd_Name_Table =
+{
+ MAKE_INTRINSIC_0("fileno", posix_fileno, V),
+ MAKE_INTRINSIC_0("_fileno", posix_fileno_int, I),
+ MAKE_INTRINSIC_0("isatty", posix_isatty, I),
+ MAKE_INTRINSIC_0("open", posix_open, V),
+ MAKE_INTRINSIC_3("read", posix_read, V, F, R, U),
+ MAKE_INTRINSIC_3("lseek", posix_lseek, V, F, SLANG_C_OFF_T_TYPE, I),
+ MAKE_INTRINSIC_2("fdopen", posix_fdopen, V, F, S),
+ MAKE_INTRINSIC_2("write", posix_write, V, F, B),
+ MAKE_INTRINSIC_1("dup_fd", posix_dup, V, F),
+ MAKE_INTRINSIC_2("dup2_fd", posix_dup2, I, F, I),
+ MAKE_INTRINSIC_1("close", posix_close_slfd, I, F),
+ MAKE_INTRINSIC_1("_close", posix_close_fd, I, I),
+#if defined(TTYNAME_R)
+ MAKE_INTRINSIC_0("ttyname", posix_ttyname, V),
+#endif
+ SLANG_END_INTRIN_FUN_TABLE
+};
+#undef I
+#undef V
+#undef F
+#undef B
+#undef R
+#undef S
+#undef L
+#undef U
+
+static SLang_IConstant_Type PosixIO_Consts =
+{
+#ifdef O_RDONLY
+ MAKE_ICONSTANT("O_RDONLY", O_RDONLY),
+#endif
+#ifdef O_WRONLY
+ MAKE_ICONSTANT("O_WRONLY", O_WRONLY),
+#endif
+#ifdef O_RDWR
+ MAKE_ICONSTANT("O_RDWR", O_RDWR),
+#endif
+#ifdef O_APPEND
+ MAKE_ICONSTANT("O_APPEND", O_APPEND),
+#endif
+#ifdef O_CREAT
+ MAKE_ICONSTANT("O_CREAT", O_CREAT),
+#endif
+#ifdef O_EXCL
+ MAKE_ICONSTANT("O_EXCL", O_EXCL),
+#endif
+#ifdef O_NOCTTY
+ MAKE_ICONSTANT("O_NOCTTY", O_NOCTTY),
+#endif
+#ifdef O_NONBLOCK
+ MAKE_ICONSTANT("O_NONBLOCK", O_NONBLOCK),
+#endif
+#ifdef O_TRUNC
+ MAKE_ICONSTANT("O_TRUNC", O_TRUNC),
+#endif
+#ifndef O_BINARY
+# define O_BINARY 0
+#endif
+ MAKE_ICONSTANT("O_BINARY", O_BINARY),
+#ifndef O_TEXT
+# define O_TEXT 0
+#endif
+ MAKE_ICONSTANT("O_TEXT", O_TEXT),
+#ifdef O_LARGEFILE
+ MAKE_ICONSTANT("O_LARGEFILE", O_LARGEFILE),
+#endif
+ SLANG_END_ICONST_TABLE
+};
+
+int SLfile_push_fd (SLFile_FD_Type *f)
+{
+ if (f == NULL)
+ return SLang_push_null ();
+
+ f->num_refs += 1;
+
+ if (0 == SLclass_push_ptr_obj (SLANG_FILE_FD_TYPE, (VOID_STAR) f))
+ return 0;
+
+ f->num_refs -= 1;
+
+ return -1;
+}
+
+int SLfile_pop_fd (SLFile_FD_Type **f)
+{
+ return SLclass_pop_ptr_obj (SLANG_FILE_FD_TYPE, (VOID_STAR *) f);
+}
+
+static void destroy_fd_type (SLtype type, VOID_STAR ptr)
+{
+ /* Avoid setting errno when a variable goes out of scope */
+ int e = _pSLerrno_errno;
+
+ (void) type;
+
+ SLfile_free_fd (*(SLFile_FD_Type **) ptr);
+ _pSLerrno_errno = e;
+}
+
+static int fd_push (SLtype type, VOID_STAR v)
+{
+ (void) type;
+ return SLfile_push_fd (*(SLFile_FD_Type **)v);
+}
+
+static int
+fd_fd_bin_op_result (int op, SLtype a, SLtype b,
+			 SLtype *c)
+{
+ (void) a;
+ (void) b;
+ switch (op)
+ {
+ default:
+	return 0;
+
+#if 0
+ case SLANG_GT:
+ case SLANG_GE:
+ case SLANG_LT:
+ case SLANG_LE:
+#endif
+ case SLANG_EQ:
+ case SLANG_NE:
+	*c = SLANG_CHAR_TYPE;
+	break;
+ }
+ return 1;
+}
+
+static int
+fd_fd_bin_op (int op,
+		 SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+		 SLtype b_type, VOID_STAR bp, SLuindex_Type nb,
+		 VOID_STAR cp)
+{
+ char *ic;
+ SLFile_FD_Type **a, **b;
+ SLuindex_Type n, n_max;
+ SLuindex_Type da, db;
+
+ (void) a_type;
+ (void) b_type;
+
+ if (na == 1) da = 0; else da = 1;
+ if (nb == 1) db = 0; else db = 1;
+
+ if (na > nb) n_max = na; else n_max = nb;
+
+ a = (SLFile_FD_Type **) ap;
+ b = (SLFile_FD_Type **) bp;
+ ic = (char *) cp;
+
+ switch (op)
+ {
+ case SLANG_NE:
+	for (n = 0; n < n_max; n++)
+	 {
+	 if ((*a == NULL) || (*b == NULL))
+	 ic n = (*a != *b);
+	 else
+	 ic n = (*a)->fd != (*b)->fd;
+	 a += da;
+	 b += db;
+	 }
+	break;
+ case SLANG_EQ:
+	for (n = 0; n < n_max; n++)
+	 {
+	 if ((*a == NULL) || (*b == NULL))
+	 ic n = (*a == *b);
+	 else
+	 ic n = (*a)->fd == (*b)->fd;
+	 a += da;
+	 b += db;
+	 }
+	break;
+
+ default:
+	return 0;
+ }
+ return 1;
+}
+
+int SLang_init_posix_io (void)
+{
+ SLang_Class_Type *cl;
+
+ if (NULL == (cl = SLclass_allocate_class ("FD_Type")))
+ return -1;
+ cl->cl_destroy = destroy_fd_type;
+ (void) SLclass_set_push_function (cl, fd_push);
+ cl->cl_datatype_deref = fdtype_datatype_deref;
+
+ if ((-1 == SLclass_register_class (cl, SLANG_FILE_FD_TYPE, sizeof (SLFile_FD_Type), SLANG_CLASS_TYPE_PTR))
+ || (-1 == SLclass_add_binary_op (SLANG_FILE_FD_TYPE, SLANG_FILE_FD_TYPE, fd_fd_bin_op, fd_fd_bin_op_result)))
+ return -1;
+
+ if ((-1 == SLadd_intrin_fun_table(Fd_Name_Table, "__POSIXIO__"))
+ || (-1 == SLadd_iconstant_table (PosixIO_Consts, NULL))
+ || (-1 == _pSLerrno_init ()))
+ return -1;
+
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slprepr.c Added

@@ -0,0 +1,703 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+/*--------------------------------*-C-*---------------------------------*
+ * File:	slprepr.c
+ *
+ * preprocessing routines
+ */
+/*{{{ notes: */
+/*
+ * various preprocessing tokens supported
+ *
+ * #ifdef TOKEN1 TOKEN2 ...
+ *	- True if any of TOKEN1 TOKEN2 ... are defined
+ *
+ * #ifndef TOKEN1 TOKEN2 ...
+ *	- True if none of TOKEN1 TOKEN2 ... are defined
+ *
+ * #iftrue
+ * #ifnfalse
+ * #if true
+ * #if !false
+ *	- always True
+ *
+ * #iffalse
+ * #ifntrue
+ * #if false
+ * #if !true
+ *	- always False
+ *
+ * #if$ENV
+ *	- True if the enviroment variable ENV is set
+ *
+ * #ifn$ENV
+ * #if !$ENV
+ *	- True if the enviroment variable ENV is not set
+ *
+ * #if$ENV TOKEN1 TOKEN2 ...
+ *	- True if the contents of enviroment variable ENV match
+ *	 any of TOKEN1 TOKEN2 ...
+ *
+ * #ifn$ENV TOKEN1 TOKEN2 ...
+ * #if !$ENV TOKEN1 TOKEN2 ...
+ *	- True if the contents of enviroment variable ENV do not match
+ *	 any of TOKEN1 TOKEN2 ...
+ *
+ *	NB: For $ENV, the tokens may contain wildcard characters:
+ *		'?' - match any single character
+ *		'*' - match any number of characters
+ *
+ * #ifexists TOKEN
+ * #ifnexists TOKEN
+ * #if !exists TOKEN
+ *	- check if a variable/function exists
+ *
+ * #ifeval EXPRESSION
+ * #ifneval EXPRESSION
+ * #if !eval TOKEN
+ *	- evaluates the EXPRESSION as an SLang expression
+ *
+ * #if (EXPRESSION)
+ * #if !(EXPRESSION)
+ *	- as per '#ifeval' / '#ifneval',
+ *	 evaluates the EXPRESSION as a SLang expression
+ *	- using '#ifn (EXPRESSION)' is possible, but deprecated
+ *
+ * #elif...
+ * #else
+ * #endif
+ *
+ * #stop
+ *	- stop reading the entire file here, provided that the line
+ *	 would have been executed
+ *	eg:
+ *		#iffalse
+ *		# stop
+ *		#endif
+ *	would NEVER stop
+ *
+ * #<TAG>
+ *	- start embedded text region
+ * #</TAG>
+ *	- end embedded text region
+ *
+ *	All text, include other preprocessing directives, that occurs between
+ *	the '#<TAG>' and '#</TAG>' directives will be ignored.
+ *	This is useful for embedding other code or documentation.
+ *	eg:
+ *		#<latex>
+ *		\chapter{My Documentation Effort}
+ *		#</latex>
+ *	NB: * although the current implementation only looks for sequences
+ *	 '#<' and '#</', it is advisable to use the full '<TAG>' form
+ *	 for documentation purposes and to avoid future surprises.
+ * * do NOT attempt to nest these constructions
+ *
+ * GENERAL NOTES:
+ * Apart from the '#ifdef' and '#ifndef' constructions, we are quite
+ * generous with accepting whitespace and the alternative '!' form.
+ * eg.,
+ *	#ifTEST
+ *	#ifnTEST
+ *	#if TEST
+ *	#if !TEST
+ *	#if ! TEST
+ *
+ * mj olesen
+ *----------------------------------------------------------------------*/
+/*}}}*/
+/*{{{ includes: */
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+/*}}}*/
+
+int (*SLprep_exists_hook) (SLFUTURE_CONST char *, char);	/* in "slang.h" */
+int (*_pSLprep_eval_hook) (SLFUTURE_CONST char *);		/* in "_slang.h" */
+
+struct _pSLprep_Type
+{
+ int this_level;
+ int exec_level;
+ int prev_exec_level;
+ SLCONST char *prefix;
+ unsigned int prefix_len;
+ SLCONST char *comment_start;
+ SLCONST char *comment_stop;
+ unsigned int comment_start_len;
+ unsigned int flags;
+#define SLPREP_USER_FLAGS_MASK	0x00FF
+#define SLPREP_STOP_READING	0x0100
+#define SLPREP_EMBEDDED_TEXT	0x0200
+
+ int (*exists_hook) (SLprep_Type *, SLFUTURE_CONST char *);
+ int (*eval_hook) (SLprep_Type *, SLFUTURE_CONST char *);
+};
+
+int SLprep_set_eval_hook (SLprep_Type *pt, int (*f)(SLprep_Type *, SLFUTURE_CONST char *))
+{
+ if (pt == NULL)
+ return -1;
+ pt->eval_hook = f;
+ return 0;
+}
+int SLprep_set_exists_hook (SLprep_Type *pt, int (*f)(SLprep_Type *, SLFUTURE_CONST char *))
+{
+ if (pt == NULL)
+ return -1;
+ pt->exists_hook = f;
+ return 0;
+}
+
+void SLprep_delete (SLprep_Type *pt)
+{
+ if (pt == NULL)
+ return;
+
+ /* NULLs ok */
+ SLang_free_slstring ((char *)pt->comment_start);
+ SLang_free_slstring ((char *)pt->comment_stop);
+ SLang_free_slstring ((char *)pt->prefix);
+
+ SLfree ((char *) pt);
+}
+
+int SLprep_set_comment (SLprep_Type *pt, SLFUTURE_CONST char *start, SLFUTURE_CONST char *stop)
+{
+ if ((pt == NULL) || (start == NULL))
+ return -1;
+
+ if (NULL == (start = SLang_create_slstring (start)))
+ return -1;
+
+ if (stop == NULL)
+ stop = "";
+
+ if (NULL == (stop = SLang_create_slstring (stop)))
+ {
+	SLang_free_slstring ((char *) start);
+	return -1;
+ }
+
+ if (pt->comment_start != NULL)
+ SLang_free_slstring ((char *) pt->comment_start);
+ pt->comment_start = start;
+ pt->comment_start_len = strlen (start);
+
+ if (pt->comment_stop != NULL)
+ SLang_free_slstring ((char *) pt->comment_stop);
+ pt->comment_stop = stop;
+
+ return 0;
+}
+
+int SLprep_set_prefix (SLprep_Type *pt, SLFUTURE_CONST char *prefix)
+{
+ if ((pt == NULL) || (prefix == NULL))
+ return -1;
+
+ if (NULL == (prefix = SLang_create_slstring (prefix)))
+ return -1;
+
+ if (pt->prefix != NULL)
+ SLang_free_slstring ((char *) pt->prefix);
+ pt->prefix = prefix;
+ pt->prefix_len = strlen (prefix);
+ return 0;
+}
+
+/*{{{ SLprep_open_prep (), SLprep_close_prep () */
+SLprep_Type *SLprep_new (void)
+{
+ SLprep_Type *pt;
+
+ if (NULL == (pt = (SLprep_Type *)SLcalloc (1, sizeof (SLprep_Type))))
+ return NULL;
+
+ if (-1 == SLprep_set_comment (pt, "%", ""))
+ {
+	SLprep_delete (pt);
+	return NULL;
+ }
+ if (-1 == SLprep_set_prefix (pt, "#"))
+ {
+	SLprep_delete (pt);
+	return NULL;
+ }
+ return pt;
+}
+
+int SLprep_set_flags (SLprep_Type *pt, unsigned int flags)
+{
+ if (pt == NULL)
+ return -1;
+
+ flags &= SLPREP_USER_FLAGS_MASK;
+ pt->flags &= ~SLPREP_USER_FLAGS_MASK;
+ pt->flags |= flags;
+ return 0;
+}
+
+/*}}}*/
+
+/*{{{ SLwildcard () */
+/*----------------------------------------------------------------------*
+ * Does `string' match `pattern' ?
+ *
+ * '*' in pattern matches any sub-string (including the null string)
+ * '?' matches any single char.
+ *
+ * Code taken from that donated by Paul Hudson <paulh@harlequin.co.uk>
+ * to the fvwm project.
+ * It is public domain, no strings attached. No guarantees either.
+ *----------------------------------------------------------------------*/
+static int SLwildcard (char *pattern, char *string)
+{
+ if (pattern == NULL || *pattern == '\0' || !strcmp (pattern, "*"))
+ return 1;
+ else if (string == NULL)
+ return 0;
+
+ while (*pattern && *string) switch (*pattern)
+ {
+ case '?':
+	/* match any single character */
+	pattern++;
+	string++;
+	break;
+
+ case '*':
+	/* see if rest of pattern matches any trailing */
+	/* substring of the string. */
+	if (*++pattern == '\0')
+	 return 1;	/* trailing * must match rest */
+
+	while (*string)
+	 {
+	 if (SLwildcard (pattern, string)) return 1;
+	 string++;
+	 }
+	return 0;
+
+	/* break; */
+
+ default:
+	if (*pattern == '\\')
+	 {
+	 if (*++pattern == '\0')
+	 pattern--;	/* don't skip trailing backslash */
+	 }
+	if (*pattern++ != *string++) return 0;
+	break;
+ }
+
+ return ((*string == '\0')
+	 && ((*pattern == '\0') || !strcmp (pattern, "*")));
+}
+/*}}}*/
+
+#if defined(__16_BIT_SYSTEM__)
+# define MAX_DEFINES 10
+#else
+# define MAX_DEFINES 128
+#endif
+
+/* The extra one is for NULL termination */
+SLFUTURE_CONST char *_pSLdefines MAX_DEFINES + 1;
+
+int SLdefine_for_ifdef (SLFUTURE_CONST char *s)	/*{{{*/
+{
+ unsigned int i;
+
+ for (i = 0; i < MAX_DEFINES; i++)
+ {
+	SLCONST char *s1 = _pSLdefines i;
+
+	if (s1 == s)
+	 return 0;		 /* already defined (hashed string) */
+
+	if (s1 != NULL)
+	 continue;
+
+	s = SLang_create_slstring (s);
+	if (s == NULL)
+	 return -1;
+
+	_pSLdefinesi = s;
+	return 0;
+ }
+ return -1;
+}
+/*}}}*/
+
+/*{{{ static functions */
+static int is_any_defined (SLprep_Type *pt, SLCONST char *buf)	/*{{{*/
+{
+ char comment;
+
+ /* FIXME: priority: low. This needs adapted to multi-char comments */
+ comment = pt->comment_start0;
+ while (1)
+ {
+	SLCONST char *sys;
+	unsigned int i;
+	register char ch;
+
+	/* Skip whitespace */
+	while (((ch = *buf) == ' ') || (ch == '\t'))
+	 buf++;
+
+	if ((ch == '\n') || (ch == 0) || (ch == comment))
+	 return 0;
+
+	i = 0;
+	while (NULL != (sys = _pSLdefines i++))
+	 {
+	 unsigned int n;
+
+	 if (*sys != ch)
+	 continue;
+
+	 n = strlen (sys);
+	 if (0 == strncmp (buf, sys, n))
+	 {
+		 char ch1 = *(buf + n);
+
+		 if ((ch1 == '\n') || (ch1 == 0)
+		 || (ch1 == ' ') || (ch1 == '\t')
+		 || (ch == comment))
+		 return 1;
+
+	 }
+	 }
+
+	/* Skip past word */
+	while (((ch = *buf) != ' ')
+	 && (ch != '\n')
+	 && (ch != 0)
+	 && (ch != '\t')
+	 && (ch != comment))
+	 buf++;
+ }
+}
+/*}}}*/
+
+static SLCONST unsigned char *tokenize (SLCONST unsigned char *buf, char *token, unsigned int len)
+{
+ register char *token_end;
+
+ token_end = token + (len - 1); /* allow room for \0 */
+
+ while ((token < token_end) && (*buf > ' '))
+ *token++ = *buf++;
+
+ if (*buf > ' ') return NULL;	/* token too long */
+
+ *token = '\0';
+
+ while ((*buf == ' ') || (*buf == '\t')) buf++;
+
+ return buf;
+}
+
+static int is_env_defined (SLprep_Type *pt, SLCONST char *buf)	/*{{{*/
+{
+ char *env, token 128;
+ char comment = pt->comment_start0;
+
+ /* FIXME: priority: low. This needs adapted to multi-char comments */
+ if (((unsigned char)*buf <= ' ')
+ || (*buf == comment))
+ return 0;	/* no token */
+
+ if (NULL == (buf = (char *) tokenize ((unsigned char *) buf,
+					 token, sizeof (token))))
+ return 0;
+
+ if (NULL == (env = getenv (token)))
+ return 0;		/* ENV not defined */
+
+ if ((*buf == '\0') || (*buf == '\n') || (*buf == comment))
+ return 1;			/* no tokens, but getenv() worked */
+
+ do
+ {
+	buf = (char *) tokenize ((unsigned char *) buf, token, sizeof (token));
+	if (buf == NULL) return 0;
+
+	if (SLwildcard (token, env))
+	 return 1;
+ }
+ while (*buf && (*buf != '\n') && (*buf != comment));
+
+ return 0;
+}
+/*}}}*/
+/*}}}*/
+
+int SLprep_line_ok (SLFUTURE_CONST char *buf, SLprep_Type *pt)	/*{{{*/
+{
+ int level, prev_exec_level, exec_level;
+ unsigned int flags;
+
+ if ((buf == NULL) || (pt == NULL)) return 1;
+
+ /* the '#stop' marker was already reached */
+ if (pt->flags & SLPREP_STOP_READING)
+ return 0;
+
+ /* local bookkeeping */
+ level = pt->this_level;
+ exec_level = pt->exec_level;
+ prev_exec_level = pt->prev_exec_level;
+ flags = pt->flags;
+
+ if ((*buf != pt->prefix0)
+ || (0 != strncmp (buf, pt->prefix, pt->prefix_len)))
+ {
+	/* ignore out-of-context or embedded text */
+	if ((level != exec_level) || (flags & SLPREP_EMBEDDED_TEXT))
+	 return 0;
+
+	if (*buf == '\n')
+	 return (0 != (flags & SLPREP_BLANK_LINES_OK));
+
+	if ((*buf == pt->comment_start0)
+	 && (0 == strncmp (buf, pt->comment_start, pt->comment_start_len)))
+	 return (0 != (flags & SLPREP_COMMENT_LINES_OK));
+
+	return 1;
+ }
+
+ buf += pt->prefix_len;
+
+ /*
+ * Always allow '#!' to pass. This could be a shell script
+ * with something like '#! /usr/local/bin/slang'
+ */
+ if ((*buf == '!') && (pt->prefix0 == '#') && (pt->prefix_len == 1))
+ return 0;
+
+ /* Allow whitespace as in '# ifdef' */
+ while ((*buf == ' ') || (*buf == '\t')) buf++;
+
+ /*
+ * quick and dirty coding for '#<TAG>' and '#</TAG>'
+ * only bothers to differentiate between '#<' and '#</'
+ * never attempt to nest these constructions!!
+ */
+ if (*buf == '<')
+ {
+	buf++;
+	if (*buf == '/') 	/* likely a '#</TAG>' */
+	 pt->flags &= ~SLPREP_EMBEDDED_TEXT;
+	else			/* likely a '#<TAG>' */
+	 pt->flags |= SLPREP_EMBEDDED_TEXT;
+
+	return 0;
+ }
+
+ if (pt->flags & SLPREP_EMBEDDED_TEXT)
+ return 0;		/* embedded text - ignore everything */
+
+ if ((*buf < 'a') || (*buf > 'z'))	/* something weird */
+ return (level == exec_level);
+
+ if ( !strncmp(buf, "stop", 4) )
+ {
+	if (level == exec_level)	/* signal stop if we're in scope */
+	 pt->flags |= SLPREP_STOP_READING;
+	return 0;	/* swallow this tag */
+ }
+
+ if (!strncmp(buf, "endif", 5))
+ {
+	if (level == exec_level)
+	 {
+	 exec_level--;
+	 prev_exec_level = exec_level;
+	 }
+	level--;
+	if (level < prev_exec_level) prev_exec_level = level;
+	goto done;
+ }
+
+ if ((buf0 == 'e') && (buf1 == 'l')) /* else, elifdef, ... */
+ {
+	if ((level == exec_level + 1)
+	 && (prev_exec_level != level))
+	 {
+	 /* We are in position to execute */
+	 buf += 2;
+	 if ((buf0 == 's') && (buf1 == 'e'))
+	 {
+		 /* 'else' */
+		 exec_level = level;
+		 goto done;
+	 }
+
+	 /*
+	 * drop through to 'if' testing.
+	 * First set variable to value appropriate for 'if' testing.
+	 */
+	 level--;		 /* now == to exec level */
+	 }
+	else
+	 {
+	 if (level == exec_level)
+	 {
+		 exec_level--;
+	 }
+	 goto done;
+	 }
+ }
+
+ if ((buf0 == 'i') && (buf1 == 'f'))
+ {
+	int test = 0;			/* fallback value */
+	int truth = 1;
+	buf += 2;
+
+	if (level != exec_level)
+	 {
+	 level++;
+	 goto done;			/* Not interested */
+	 }
+	level++;
+
+	if (buf0 == 'n')
+	 {
+	 truth = !truth;
+	 buf++;
+	 }
+
+	/* for 'ifdef' and 'ifndef' we are done */
+	if (!strncmp (buf, "def", 3))
+	 {
+	 test = is_any_defined(pt, buf + 3);
+	 }
+	else
+	 {
+	 /*
+	 * the '#ifn' construction cannot have whitespace or '!'
+	 * for the other forms, we can also accept
+	 * 'if!..' instead of 'ifn...', or even 'if ...' or 'if ! ...'
+	 */
+	 if (truth)
+	 {
+		 /* Allow some whitespace */
+		 while ((*buf == ' ') || (*buf == '\t')) buf++;
+
+		 if (*buf == '!')
+		 {
+		 /* the 'if !' form */
+		 truth = !truth;
+		 buf++;
+		 while ((*buf == ' ') || (*buf == '\t')) buf++;
+		 }
+	 }
+
+	 if (*buf == '$')
+	 test = is_env_defined (pt, buf + 1);
+	 else if ((*buf == '(')
+		 && (pt->eval_hook != NULL))
+	 test = pt->eval_hook (pt, buf);
+	 else if (!strncmp (buf, "eval", 4)
+		 && (pt->eval_hook != NULL))
+	 test = pt->eval_hook (pt, buf + 4);
+	 else if (!strncmp (buf, "exists", 6)
+		 && (pt->exists_hook != NULL))
+	 test = pt->exists_hook (pt, buf + 6);
+	 else if (!strncmp (buf, "true", 4))
+	 test = 1;
+	 else if (strncmp (buf, "false", 5))
+	 return 1;	/* unknown - let it bomb */
+	 }
+
+	if (truth == test) prev_exec_level = exec_level = level;
+ }
+ else
+ {
+	return 1; /* let it bomb */
+ }
+
+ done:
+
+ if (exec_level < 0) return 1;	/* bad level - let it bomb */
+
+ pt->this_level = level;
+ pt->exec_level = exec_level;
+ pt->prev_exec_level = prev_exec_level;
+ return 0;
+}
+/*}}}*/
+
+/*{{{ main() - for testing only */
+#if 0
+int main (int argc, char *argv)
+{
+ int i;
+ char buf1024;
+ SLprep_Type pt;
+
+ SLprep_open_prep (&pt);
+ SLdefine_for_ifdef ("UNIX");
+
+ /* super cheap getopts */
+ for (i = 1; i < argc; i++)
+ {
+	char *p = argvi;
+	if (*p++ != '-') break;
+	if (*p == '-') break;
+
+	if (*p == 'D')
+	 {
+	 SLdefine_for_ifdef (p + 1);
+	 continue;
+	 }
+
+	while (*p) {
+	 switch (*p) {
+	 case 'B': pt.flags |= (SLPREP_BLANK_LINES_OK);	break;
+	 case 'C': pt.flags |= (SLPREP_COMMENT_LINES_OK);	break;
+	 case 'c': if (p1) pt.comment_char = *++p;		break;
+	 case 'p': if (p1) pt.preprocess_char = *++p;	break;
+	 default:
+	 fprintf (stderr, "unknown flag '%c'\n", *p);
+	 break;
+	 }
+	 p++;
+	}
+ }
+
+ while (NULL != fgets (buf, sizeof (buf) - 1, stdin))
+ {
+	if (SLprep_line_ok (buf, &pt))
+	 fputs (buf, stdout);
+ }
+
+ SLprep_close_prep (&pt);
+ return 0;
+}
+#endif
+/*}}}*/

_service:tar_scm:slang-2.3.2.tar.bz2/src/slproc.c Added

@@ -0,0 +1,402 @@
+/* Process specific system calls */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#ifndef _BSD_SOURCE
+# define _BSD_SOURCE 1
+#endif
+
+#ifndef _DEFAULT_SOURCE
+# define _DEFAULT_SOURCE 1
+#endif
+
+#ifndef _XOPEN_SOURCE
+# define _XOPEN_SOURCE 1
+#endif
+#ifndef _XOPEN_SOURCE_EXTENDED
+# define _XOPEN_SOURCE_EXTENDED 1
+#endif
+
+#ifndef __EXTENSIONS__
+# define __EXTENSIONS__
+#endif
+
+#include "slinclud.h"
+
+#ifdef HAVE_IO_H
+# include <io.h>		 /* for chmod */
+#endif
+
+#ifdef HAVE_PROCESS_H
+# include <process.h>			/* for getpid */
+#endif
+
+#if defined(__BORLANDC__)
+# include <dos.h>
+#endif
+
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <signal.h>
+#include <time.h>
+#ifdef HAVE_SYS_TIME_H
+# include <sys/time.h>
+#endif
+#ifdef HAVE_SYS_RESOURCE_H
+# include <sys/resource.h>
+#endif
+
+#include <errno.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+#ifdef HAVE_KILL
+static int kill_cmd (int *pid, int *sig)
+{
+ int ret;
+
+ if (-1 == (ret = kill ((pid_t) *pid, *sig)))
+ _pSLerrno_errno = errno;
+ return ret;
+}
+#endif
+
+#ifdef HAVE_KILLPG
+static int killpg_cmd (int *pgrp, int *sig)
+{
+ int ret;
+
+ if (-1 == (ret = killpg ((pid_t) *pgrp, *sig)))
+ _pSLerrno_errno = errno;
+ return ret;
+}
+#endif
+
+static int getpid_cmd (void)
+{
+ return getpid ();
+}
+
+#ifdef HAVE_GETPPID
+static int getppid_cmd (void)
+{
+ return getppid ();
+}
+#endif
+
+#ifdef HAVE_GETGID
+static int getgid_cmd (void)
+{
+ return getgid ();
+}
+#endif
+
+#ifdef HAVE_GETEGID
+static int getegid_cmd (void)
+{
+ return getegid ();
+}
+#endif
+
+#ifdef HAVE_GETEUID
+static int geteuid_cmd (void)
+{
+ return geteuid ();
+}
+#endif
+
+#ifdef HAVE_GETUID
+static int getuid_cmd (void)
+{
+ return getuid ();
+}
+#endif
+
+#ifdef HAVE_SETGID
+static int setgid_cmd (int *gid)
+{
+ if (0 == setgid (*gid))
+ return 0;
+ _pSLerrno_errno = errno;
+ return -1;
+}
+#endif
+
+#ifdef HAVE_SETPGID
+static int setpgid_cmd (int *pid, int *pgid)
+{
+ if (0 == setpgid (*pid, *pgid))
+ return 0;
+ _pSLerrno_errno = errno;
+ return -1;
+}
+#endif
+
+#ifdef HAVE_GETPGID
+static int getpgid_cmd (int *pid)
+{
+ int pgid = getpgid (*pid);
+ if (-1 != pgid)
+ return pgid;
+ _pSLerrno_errno = errno;
+ return -1;
+}
+#endif
+
+#ifdef HAVE_GETPGRP
+static int getpgrp_cmd (void)
+{
+ int pgid = getpgrp ();
+ if (-1 != pgid)
+ return pgid;
+ _pSLerrno_errno = errno;
+ return -1;
+}
+#endif
+
+#ifdef HAVE_SETPGRP
+#if 0
+static int setpgrp_cmd (void)
+{
+ if (0 == setpgrp ())
+ return 0;
+ _pSLerrno_errno = errno;
+ return -1;
+}
+#endif
+#endif
+
+#ifdef HAVE_SETUID
+static int setuid_cmd (int *uid)
+{
+ if (0 == setuid (*uid))
+ return 0;
+ _pSLerrno_errno = errno;
+ return -1;
+}
+#endif
+
+#ifdef HAVE_SETSID
+static int setsid_cmd (void)
+{
+ pid_t pid = setsid ();
+
+ if (pid == (pid_t)-1)
+ _pSLerrno_errno = errno;
+ return pid;
+}
+#endif
+
+#ifdef HAVE_GETSID
+static int getsid_cmd (void)
+{
+ int ipid = 0;
+ pid_t pid;
+
+ if ((SLang_Num_Function_Args == 1)
+ && (-1 == SLang_pop_int (&ipid)))
+ return -1;
+
+ pid = getsid (ipid);
+
+ if (pid == (pid_t)-1)
+ _pSLerrno_errno = errno;
+ return pid;
+}
+#endif
+
+#ifdef HAVE_GETPRIORITY
+static void getpriority_intrin (int *which, int *who)
+{
+ int ret;
+ errno = 0;
+ ret = getpriority (*which, *who);
+ if ((ret == -1) && (errno != 0))
+ {
+	_pSLerrno_errno = errno;
+	(void) SLang_push_null ();
+	return;
+ }
+ (void) SLang_push_int (ret);
+}
+#endif
+
+#ifdef HAVE_SETPRIORITY
+static int setpriority_intrin (int *which, int *who, int *prio)
+{
+ int ret;
+ if (-1 == (ret = setpriority (*which, *who, *prio)))
+ _pSLerrno_errno = errno;
+ return ret;
+}
+#endif
+
+#ifdef HAVE_GETRUSAGE
+typedef struct
+{
+ struct rusage r;
+ double ru_utimesecs;
+ double ru_stimesecs;
+}
+RUsage_Type;
+
+static SLang_CStruct_Field_Type RUsage_Struct =
+{
+ MAKE_CSTRUCT_FLOAT_FIELD(RUsage_Type, ru_utimesecs, "ru_utimesecs", 0),
+ MAKE_CSTRUCT_FLOAT_FIELD(RUsage_Type, ru_stimesecs, "ru_stimesecs", 0),
+ MAKE_CSTRUCT_INT_FIELD(RUsage_Type, r.ru_maxrss, "ru_maxrss", 0),
+ MAKE_CSTRUCT_INT_FIELD(RUsage_Type, r.ru_minflt, "ru_minflt", 0),
+ MAKE_CSTRUCT_INT_FIELD(RUsage_Type, r.ru_majflt, "ru_majflt", 0),
+ MAKE_CSTRUCT_INT_FIELD(RUsage_Type, r.ru_inblock, "ru_inblock", 0),
+ MAKE_CSTRUCT_INT_FIELD(RUsage_Type, r.ru_oublock, "ru_oublock", 0),
+ MAKE_CSTRUCT_INT_FIELD(RUsage_Type, r.ru_nvcsw, "ru_nvcsw", 0),
+ MAKE_CSTRUCT_INT_FIELD(RUsage_Type, r.ru_nivcsw, "ru_nivcsw", 0),
+ MAKE_CSTRUCT_INT_FIELD(RUsage_Type, r.ru_ixrss, "ru_ixrss", 0),
+ MAKE_CSTRUCT_INT_FIELD(RUsage_Type, r.ru_idrss, "ru_idrss", 0),
+ MAKE_CSTRUCT_INT_FIELD(RUsage_Type, r.ru_isrss, "ru_isrss", 0),
+ MAKE_CSTRUCT_INT_FIELD(RUsage_Type, r.ru_nswap, "ru_nswap", 0),
+ MAKE_CSTRUCT_INT_FIELD(RUsage_Type, r.ru_msgsnd, "ru_msgsnd", 0),
+ MAKE_CSTRUCT_INT_FIELD(RUsage_Type, r.ru_msgrcv, "ru_msgrcv", 0),
+ MAKE_CSTRUCT_INT_FIELD(RUsage_Type, r.ru_nsignals, "ru_nsignals", 0),
+ SLANG_END_CSTRUCT_TABLE
+};
+
+static void getrusage_intrin (void)
+{
+ RUsage_Type rut;
+ int who = RUSAGE_SELF;
+
+ if ((SLang_Num_Function_Args == 1)
+ && (-1 == SLang_pop_int (&who)))
+ return;
+
+ if (-1 == getrusage (who, &rut.r))
+ {
+	_pSLerrno_errno = errno;
+	(void) SLang_push_null ();
+	return;
+ }
+
+ rut.ru_stimesecs
+ = (double)rut.r.ru_stime.tv_sec + 1e-6*rut.r.ru_stime.tv_usec;
+ rut.ru_utimesecs
+ = (double)rut.r.ru_utime.tv_sec + 1e-6*rut.r.ru_utime.tv_usec;
+
+ (void) SLang_push_cstruct ((VOID_STAR) &rut, RUsage_Struct);
+}
+#endif
+
+static SLang_Intrin_Fun_Type Process_Name_Table =
+{
+ MAKE_INTRINSIC_0("getpid", getpid_cmd, SLANG_INT_TYPE),
+
+#ifdef HAVE_SETSID
+ MAKE_INTRINSIC_0("setsid", setsid_cmd, SLANG_INT_TYPE),
+#endif
+#ifdef HAVE_GETSID
+ MAKE_INTRINSIC_0("getsid", getsid_cmd, SLANG_INT_TYPE),
+#endif
+
+#ifdef HAVE_GETPPID
+ MAKE_INTRINSIC_0("getppid", getppid_cmd, SLANG_INT_TYPE),
+#endif
+#ifdef HAVE_GETGID
+ MAKE_INTRINSIC_0("getgid", getgid_cmd, SLANG_INT_TYPE),
+#endif
+#ifdef HAVE_GETEGID
+ MAKE_INTRINSIC_0("getegid", getegid_cmd, SLANG_INT_TYPE),
+#endif
+#ifdef HAVE_GETEUID
+ MAKE_INTRINSIC_0("geteuid", geteuid_cmd, SLANG_INT_TYPE),
+#endif
+#ifdef HAVE_GETUID
+ MAKE_INTRINSIC_0("getuid", getuid_cmd, SLANG_INT_TYPE),
+#endif
+#ifdef HAVE_SETGID
+ MAKE_INTRINSIC_I("setgid", setgid_cmd, SLANG_INT_TYPE),
+#endif
+#ifdef HAVE_GETPGID
+ MAKE_INTRINSIC_I("getpgid", getpgid_cmd, SLANG_INT_TYPE),
+#endif
+#ifdef HAVE_SETPGID
+ MAKE_INTRINSIC_II("setpgid", setpgid_cmd, SLANG_INT_TYPE),
+#endif
+#ifdef HAVE_GETPGRP
+ MAKE_INTRINSIC_0("getpgrp", getpgrp_cmd, SLANG_INT_TYPE),
+#endif
+#ifdef HAVE_SETPGRP
+ /* MAKE_INTRINSIC_0("setpgrp", setpgrp_cmd, SLANG_INT_TYPE), */
+#endif
+#ifdef HAVE_SETUID
+ MAKE_INTRINSIC_I("setuid", setuid_cmd, SLANG_INT_TYPE),
+#endif
+
+#ifdef HAVE_KILL
+ MAKE_INTRINSIC_II("kill", kill_cmd, SLANG_INT_TYPE),
+#endif
+#ifdef HAVE_KILLPG
+ MAKE_INTRINSIC_II("killpg", killpg_cmd, SLANG_INT_TYPE),
+#endif
+#ifdef HAVE_SETPRIORITY
+ MAKE_INTRINSIC_III("setpriority", setpriority_intrin, SLANG_INT_TYPE),
+#endif
+#ifdef HAVE_GETPRIORITY
+ MAKE_INTRINSIC_II("getpriority", getpriority_intrin, SLANG_VOID_TYPE),
+#endif
+#ifdef HAVE_GETRUSAGE
+ MAKE_INTRINSIC_0("getrusage", getrusage_intrin, SLANG_VOID_TYPE),
+#endif
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static SLang_IConstant_Type Const_Table =
+{
+#ifdef PRIO_PROCESS
+ MAKE_ICONSTANT("PRIO_PROCESS", PRIO_PROCESS),
+#endif
+#ifdef PRIO_PGRP
+ MAKE_ICONSTANT("PRIO_PGRP", PRIO_PGRP),
+#endif
+#ifdef PRIO_USER
+ MAKE_ICONSTANT("PRIO_USER", PRIO_USER),
+#endif
+#ifdef RUSAGE_SELF
+ MAKE_ICONSTANT("RUSAGE_SELF", RUSAGE_SELF),
+#endif
+#ifdef RUSAGE_CHILDREN
+ MAKE_ICONSTANT("RUSAGE_CHILDREN", RUSAGE_CHILDREN),
+#endif
+#ifdef RUSAGE_THREAD
+ MAKE_ICONSTANT("RUSAGE_THREAD", RUSAGE_THREAD),
+#endif
+ SLANG_END_ICONST_TABLE
+};
+
+int SLang_init_posix_process (void)
+{
+ if ((-1 == SLadd_intrin_fun_table (Process_Name_Table, "__POSIX_PROCESS__"))
+ || (-1 == SLadd_iconstant_table (Const_Table, NULL))
+ || (-1 == _pSLerrno_init ()))
+ return -1;
+
+ return 0;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slregexp.c Added

@@ -0,0 +1,1114 @@
+/* ed style regular expressions */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+struct _pSLRegexp_Type
+{
+ /* These must be set by calling routine. */
+ unsigned char *pat;		 /* regular expression pattern */
+ unsigned char *buf;		 /* buffer for compiled regexp */
+ size_t buf_len;		 /* length of buffer */
+ int case_sensitive;		 /* 1 if match is case sensitive */
+
+ /* The rest are set by SLang_regexp_compile */
+
+ int must_match;		 /* 1 if line must contain substring */
+ int must_match_bol;		 /* true if it must match beginning of line */
+ unsigned char must_match_str16; /* 15 char null term substring */
+ int osearch;			 /* 1 if ordinary search suffices */
+ size_t min_length;		 /* minimum length the match must be */
+ ssize_t beg_matches10;	 /* offset of start of $ */
+ size_t end_matches10;	 /* length of nth submatch
+					* Note that the entire match corresponds
+					* to \0
+					*/
+ int offset;			 /* offset to be added to beg_matches */
+};
+
+#define SET_BIT(b, n) b(unsigned int) (n) >> 3 |= 1 << ((unsigned int) (n) % 8)
+#define TEST_BIT(b, n) (b(unsigned int)(n) >> 3 & (1 << ((unsigned int) (n) % 8)))
+#define LITERAL 1
+#define RANGE 2			 /* ... */
+#define ANY 3			 /* . */
+#define BOL 4			 /* ^ */
+#define EOL 5			 /* $ */
+#define NTH_MATCH 6		 /* \1 \2 ... \9 */
+#define OPAREN 7		 /* \( */
+#define CPAREN 0x8		 /* $ */
+#define ANY_DIGIT 0x9		 /* \d */
+#define BOW	0xA		 /* \< */
+#define EOW	0xB		 /* \> */
+#if 0
+#define NOT_LITERAL		0xC	 /* \~ */
+#endif
+#define STAR 0x80		 /* * */
+#define LEAST_ONCE 0x40		 /* + */
+#define MAYBE_ONCE 0x20		 /* ? */
+#define MANY 0x10		 /* {n,m} */
+/* The rest are additions */
+#define YES_CASE (STAR | BOL)
+#define NO_CASE (STAR | EOL)
+
+#define UPPERCASE(x) (cs ? (x) : UPPER_CASE(x))
+#define LOWERCASE(x) (cs ? (x) : LOWER_CASE(x))
+
+/* FIXME: UTF8 */
+static unsigned char Word_Chars256;
+#define IS_WORD_CHAR(x) Word_Chars(unsigned int) (x)
+
+#if 0
+static int ctx->open_paren_number;
+static char Closed_Paren_Matches10;
+
+static SLRegexp_Type *This_Reg;
+static unsigned char *This_Str;
+#endif
+
+typedef struct
+{
+ SLRegexp_Type *reg;
+ SLCONST unsigned char *str;
+ SLstrlen_Type len;
+ char closed_paren_matches10;
+ int open_paren_number;
+}
+Re_Context_Type;
+
+static SLCONST unsigned char *do_nth_match (Re_Context_Type *ctx, int idx, SLCONST unsigned char *str, SLCONST unsigned char *estr)
+{
+ SLCONST unsigned char *bpos;
+ size_t m;
+
+ if (ctx->closed_paren_matchesidx == 0)
+ return NULL;
+
+ bpos = ctx->reg->beg_matchesidx + ctx->str;
+ m = ctx->reg->end_matchesidx;
+ if (m == 0) return(str);
+ if (str + m > estr) return (NULL);
+
+ /* This needs fixed for case in-sensitive match */
+ if (0 != strncmp((char *) str, (char *) bpos, m)) return (NULL);
+ str += m;
+ return (str);
+}
+
+/* returns pointer to the end of regexp or NULL */
+static SLCONST unsigned char *regexp_looking_at (Re_Context_Type *ctx,
+						 SLCONST unsigned char *str, SLCONST unsigned char *estr,
+						 unsigned char *regexp,
+						 int cs)
+{
+ register unsigned char p, p1;
+ SLCONST unsigned char *save_str, *tmpstr;
+ int n, n0, n1;
+ int save_num_open;
+ char save_closed_matches10;
+
+ p = *regexp++;
+
+ while (p != 0)
+ {
+	/* p1 = UPPERCASE(*regexp); */
+	/* if (str < estr) c = UPPERCASE(*str); */
+
+	switch((unsigned char) p)
+	 {
+	 case BOW:
+	 if ((str != ctx->str)
+		 && ((str >= estr)
+		 || IS_WORD_CHAR(*(str - 1))
+		 || (0 == IS_WORD_CHAR(*str)))) return NULL;
+	 break;
+
+	 case EOW:
+	 if ((str < estr)
+		 && IS_WORD_CHAR (*str)) return NULL;
+	 break;
+
+	 case YES_CASE: cs = 1; break;
+	 case NO_CASE: cs = 0; break;
+
+	 case OPAREN:
+	 ctx->open_paren_number++;
+	 ctx->reg->beg_matchesctx->open_paren_number = (str - ctx->str);
+	 break;
+	 case CPAREN:
+	 n = ctx->open_paren_number;
+	 while (n > 0)
+	 {
+		 if (ctx->closed_paren_matchesn != 0)
+		 {
+		 n--;
+		 continue;
+		 }
+		 ctx->closed_paren_matchesn = 1;
+		 ctx->reg->end_matchesn = (str - (ctx->str + ctx->reg->beg_matchesn));
+		 break;
+	 }
+	 break;
+#ifdef NOT_LITERAL
+	 case NOT_LITERAL:
+	 if ((str >= estr) || (*regexp == UPPERCASE(*str))) return (NULL);
+	 str++; regexp++;
+	 break;
+
+	 case MAYBE_ONCE | NOT_LITERAL:
+	 save_str = str;
+	 if ((str < estr) && (*regexp != UPPERCASE(*str))) str++;
+	 regexp++;
+	 goto match_rest;
+
+	 case NOT_LITERAL | LEAST_ONCE: /* match at least once */
+	 if ((str >= estr) || (UPPERCASE(*str) == UPPERCASE(*regexp))) return (NULL);
+	 str++;
+	 /* drop */
+	 case STAR | NOT_LITERAL:
+	 save_str = str; p1 = *regexp;
+	 while ((str < estr) && (UPPERCASE(*str) != p1)) str++;
+	 regexp++;
+	 goto match_rest;
+
+	 /* this type consists of the expression + two bytes that
+	 determine number of matches to perform */
+	 case MANY | NOT_LITERAL:
+	 p1 = *regexp; regexp++;
+	 n = n0 = (int) (unsigned char) *regexp++;
+	 /* minimum number to match--- could be 0 */
+	 n1 = (int) (unsigned char) *regexp++;
+	 /* maximum number to match */
+
+	 while (n && (str < estr) && (p1 != UPPERCASE(*str)))
+	 {
+		 n--;
+		 str++;
+	 }
+	 if (n) return (NULL);
+
+	 save_str = str;
+	 n = n1 - n0;
+	 while (n && (str < estr) && (p1 != UPPERCASE(*str)))
+	 {
+		 n--;
+		 str++;
+	 }
+	 goto match_rest;
+#endif				 /* NOT_LITERAL */
+	 case LITERAL:
+	 if ((str >= estr) || (*regexp != UPPERCASE(*str))) return (NULL);
+	 str++; regexp++;
+	 break;
+
+	 case MAYBE_ONCE | LITERAL:
+	 save_str = str;
+	 if ((str < estr) && (*regexp == UPPERCASE(*str))) str++;
+	 regexp++;
+	 goto match_rest;
+
+	 case LITERAL | LEAST_ONCE: /* match at least once */
+	 if ((str >= estr) || (UPPERCASE(*str) != UPPERCASE(*regexp))) return (NULL);
+	 str++;
+	 /* drop */
+	 case STAR | LITERAL:
+	 save_str = str; p1 = *regexp;
+	 while ((str < estr) && (UPPERCASE(*str) == p1)) str++;
+	 regexp++;
+	 goto match_rest;
+
+	 /* this type consists of the expression + two bytes that
+	 determine number of matches to perform */
+	 case MANY | LITERAL:
+	 p1 = *regexp; regexp++;
+	 n = n0 = (int) (unsigned char) *regexp++;
+	 /* minimum number to match--- could be 0 */
+	 n1 = (int) (unsigned char) *regexp++;
+	 /* maximum number to match */
+
+	 while (n && (str < estr) && (p1 == UPPERCASE(*str)))
+	 {
+		 n--;
+		 str++;
+	 }
+	 if (n) return (NULL);
+
+	 save_str = str;
+	 n = n1 - n0;
+	 while (n && (str < estr) && (p1 == UPPERCASE(*str)))
+	 {
+		 n--;
+		 str++;
+	 }
+	 goto match_rest;
+
+	 case NTH_MATCH:
+	 if ((str = do_nth_match(ctx, (int) (unsigned char) *regexp, str, estr)) == NULL) return(NULL);
+	 regexp++;
+	 break;
+
+	 case MAYBE_ONCE | NTH_MATCH:
+	 save_str = str;
+	 tmpstr = do_nth_match (ctx, (int) (unsigned char) *regexp, str, estr);
+	 if (tmpstr != NULL)
+	 str = tmpstr;
+	 regexp++;
+	 goto match_rest;
+
+	 case LEAST_ONCE | NTH_MATCH:
+	 if ((str = do_nth_match(ctx, (int) (unsigned char) *regexp, str, estr)) == NULL) return(NULL);
+	 /* drop */
+	 case STAR | NTH_MATCH:
+	 save_str = str;
+	 while (NULL != (tmpstr = do_nth_match(ctx, (int) (unsigned char) *regexp, str, estr)))
+	 {
+		 str = tmpstr;
+	 }
+	 regexp++;
+	 goto match_rest;
+
+	 case MANY | NTH_MATCH:
+	 /* minimum number to match--- could be 0 */
+	 n = n0 = (int) (unsigned char) regexp1;
+	 /* maximum number to match */
+	 n1 = (int) (unsigned char) regexp2;
+
+	 while (n && (str < estr)
+		 && (NULL != (tmpstr = do_nth_match(ctx, (int) (unsigned char) *regexp, str, estr))))
+	 {
+		 n--;
+		 str = tmpstr;
+	 }
+	 if (n) return (NULL);
+
+	 save_str = str;
+	 n = n1 - n0;
+	 while (n && (str < estr)
+		 && (NULL != (tmpstr = do_nth_match(ctx, (int) (unsigned char) *regexp, str, estr))))
+	 {
+		 n--;
+		 str = tmpstr;
+	 }
+	 regexp += 3;
+	 goto match_rest;
+
+	 case RANGE:
+	 if (str >= estr) return (NULL);
+	 if (TEST_BIT(regexp, UPPERCASE(*str)) == 0) return (NULL);
+	 regexp += 32; str++;
+	 break;
+
+	 case MAYBE_ONCE | RANGE:
+	 save_str = str;
+	 if ((str < estr) && TEST_BIT(regexp, UPPERCASE(*str))) str++;
+	 regexp += 32;
+	 goto match_rest;
+
+	 case LEAST_ONCE | RANGE:
+	 if ((str >= estr) || (0 == TEST_BIT(regexp, UPPERCASE(*str)))) return NULL;
+	 str++;
+	 /* drop */
+	 case STAR | RANGE:
+	 save_str = str;
+	 while ((str < estr) && TEST_BIT(regexp, UPPERCASE(*str))) str++;
+	 regexp += 32;
+	 goto match_rest;
+
+	 /* The first 32 bytes correspond to the range and the two
+	 * following bytes indicate the min and max number of matches.
+	 */
+	 case MANY | RANGE:
+	 /* minimum number to match--- could be 0 */
+	 n = n0 = (int) (unsigned char) *(regexp + 32);
+	 /* maximum number to match */
+	 n1 = (int) (unsigned char) *(regexp + 33);
+
+	 while (n && (str < estr) && (TEST_BIT(regexp, UPPERCASE(*str))))
+	 {
+		 n--;
+		 str++;
+	 }
+	 if (n) return (NULL);
+	 save_str = str;
+	 n = n1 - n0;
+	 while (n && (str < estr) && (TEST_BIT(regexp, UPPERCASE(*str))))
+	 {
+		 n--;
+		 str++;
+	 }
+	 regexp += 34;		 /* 32 + 2 */
+	 goto match_rest;
+
+	 case ANY_DIGIT:
+	 if ((str >= estr) || (*str > '9') || (*str < '0')) return (NULL);
+	 str++;
+	 break;
+
+	 case MAYBE_ONCE | ANY_DIGIT:
+	 save_str = str;
+	 if ((str < estr) && ((*str <= '9') && (*str >= '0'))) str++;
+	 goto match_rest;
+
+	 case LEAST_ONCE | ANY_DIGIT:
+	 if ((str >= estr) || ((*str > '9') || (*str < '0'))) return NULL;
+	 str++;
+	 /* drop */
+	 case STAR | ANY_DIGIT:
+	 save_str = str;
+	 while ((str < estr) && ((*str <= '9') && (*str >= '0'))) str++;
+	 goto match_rest;
+
+	 case MANY | ANY_DIGIT:
+	 /* minimum number to match--- could be 0 */
+	 n = n0 = (int) (unsigned char) *regexp++;
+	 /* maximum number to match */
+	 n1 = (int) (unsigned char) *regexp++;
+
+	 while (n && (str < estr) && (*str <= '9') && (*str >= '0'))
+	 {
+		 n--;
+		 str++;
+	 }
+	 if (n) return (NULL);
+	 save_str = str;
+	 n = n1 - n0;
+	 while (n && (str < estr) && (*str <= '9') && (*str >= '0'))
+	 {
+		 n--;
+		 str++;
+	 }
+	 goto match_rest;
+
+	 case ANY:		 /* . */
+	 /* FIXME: UTF8 */
+	 if ((str >= estr) || (*str == '\n')) return (NULL);
+	 str++;
+	 break;
+
+	 case MAYBE_ONCE | ANY: /* .? */
+	 /* FIXME: UTF8 */
+	 save_str = str;
+	 if ((str < estr) && (*str != '\n')) str++;
+	 goto match_rest;
+
+	 case LEAST_ONCE | ANY: /* .+ */
+	 /* FIXME: UTF8 */
+	 if ((str >= estr) || (*str == '\n')) return (NULL);
+	 str++;
+	 /* drop */
+	 case STAR | ANY:	 /* .* */
+	 /* FIXME: UTF8 */
+	 save_str = str;
+	 while ((str < estr) && (*str != '\n')) str++;
+	 goto match_rest;
+
+	 case MANY | ANY:
+	 /* minimum number to match--- could be 0 */
+	 n = n0 = (int) (unsigned char) *regexp++;
+	 /* maximum number to match */
+	 n1 = (int) (unsigned char) *regexp++;
+
+	 while (n && (str < estr) && (*str != '\n'))
+	 {
+		 n--;
+		 str++;
+	 }
+	 if (n) return (NULL);
+	 save_str = str;
+	 n = n1 - n0;
+	 while (n && (str < estr) && (*str != '\n'))
+	 {
+		 n--;
+		 str++;
+	 }
+	 goto match_rest;
+
+	 case EOL:
+	 if (str >= estr)
+	 return str;
+	 if ((*str == '\n') && (str+1 == estr))
+	 return str;
+	 return(NULL);
+
+	 default: return (NULL);
+	 }
+	p = *regexp++;
+	continue;
+
+	match_rest:
+	if (save_str == str)
+	 {
+	 p = *regexp++;
+	 continue;
+	 }
+
+	/* if (p == EOL)
+	 * {
+	 * if (str < estr) return (NULL); else return (str);
+	 * }
+	 */
+
+	SLMEMCPY(save_closed_matches, ctx->closed_paren_matches, sizeof(save_closed_matches));
+	save_num_open = ctx->open_paren_number;
+	while (str >= save_str)
+	 {
+	 tmpstr = regexp_looking_at (ctx, str, estr, regexp, cs);
+	 if (tmpstr != NULL) return(tmpstr);
+	 SLMEMCPY(ctx->closed_paren_matches, save_closed_matches, sizeof(ctx->closed_paren_matches));
+	 ctx->open_paren_number = save_num_open;
+	 str--;
+	 }
+	return NULL;
+ }
+ if ((p != 0) && (p != EOL)) return (NULL); else return (str);
+}
+
+static void
+fixup_beg_end_matches (Re_Context_Type *ctx, SLRegexp_Type *r,
+		 SLCONST unsigned char *str, SLCONST unsigned char *epos)
+{
+ int i;
+
+ if (str == NULL)
+ {
+	r->beg_matches0 = -1;
+	r->end_matches0 = 0;
+	SLMEMSET(ctx->closed_paren_matches, 0, sizeof(ctx->closed_paren_matches));
+ }
+ else
+ {
+	r->beg_matches0 = (str - ctx->str);
+	r->end_matches0 = (epos - str);
+ }
+
+ for (i = 1; i < 10; i++)
+ {
+	if (ctx->closed_paren_matches i == 0)
+	 {
+	 r->beg_matchesi = -1;
+	 r->end_matchesi = 0;
+	 }
+ }
+}
+
+static void init_re_context (Re_Context_Type *ctx, SLRegexp_Type *reg,
+			 SLCONST unsigned char *str, SLstrlen_Type len)
+{
+ memset ((char *) ctx, 0, sizeof (Re_Context_Type));
+ ctx->reg = reg;
+ ctx->str = str;
+ ctx->len = len;
+}
+
+static SLCONST unsigned char *regexp_match(SLCONST unsigned char *str,
+					 SLstrlen_Type len, SLRegexp_Type *reg)
+{
+ unsigned char c = 0;
+ SLCONST unsigned char *estr = str + len;
+ int cs = reg->case_sensitive, lit = 0;
+ unsigned char *buf = reg->buf;
+ SLCONST unsigned char *epos = NULL;
+ Re_Context_Type ctx_buf;
+
+ if (reg->min_length > len) return NULL;
+
+ init_re_context (&ctx_buf, reg, str, len);
+
+ if (*buf == BOL)
+ {
+	if (NULL == (epos = regexp_looking_at (&ctx_buf, str, estr, buf + 1, cs)))
+	 str = NULL;
+
+	fixup_beg_end_matches (&ctx_buf, reg, str, epos);
+	return str;
+ }
+
+ if (*buf == NO_CASE)
+ {
+	buf++; cs = 0;
+ }
+
+ if (*buf == YES_CASE)
+ {
+	buf++; cs = 1;
+ }
+
+ if (*buf == LITERAL)
+ {
+	lit = 1;
+	c = *(buf + 1);
+ }
+ else if ((*buf == OPAREN) && (*(buf + 1) == LITERAL))
+ {
+	lit = 1;
+	c = *(buf + 2);
+ }
+
+ while (1)
+ {
+	ctx_buf.open_paren_number = 0;
+	memset (ctx_buf.closed_paren_matches, 0, sizeof(ctx_buf.closed_paren_matches));
+	/* take care of leading chars */
+	if (lit)
+	 {
+	 while ((str < estr) && (c != UPPERCASE(*str))) str++;
+	 if (str >= estr)
+	 break;		 /* failed */
+	 }
+
+	if (NULL != (epos = regexp_looking_at(&ctx_buf, str, estr, buf, cs)))
+	 {
+	 fixup_beg_end_matches (&ctx_buf, reg, str, epos);
+	 return str;
+	 }
+	if (str >= estr)
+	 break;
+	str++;
+ }
+ fixup_beg_end_matches (&ctx_buf, reg, NULL, epos);
+ return NULL;
+}
+
+char *SLregexp_match (SLRegexp_Type *reg, SLFUTURE_CONST char *str, SLstrlen_Type len)
+{
+ return (char *) regexp_match ((SLCONST unsigned char *)str, len, reg);
+}
+
+static unsigned char *convert_digit(unsigned char *pat, int *nn)
+{
+ int n = 0;
+ unsigned char c;
+ while (c = (unsigned char) *pat, (c <= '9') && (c >= '0'))
+ {
+	pat++;
+	n = 10 * n + (c - '0');
+ }
+ *nn = n;
+ return pat;
+}
+
+#define ERROR return (int) (pat - reg->pat)
+
+/* Returns 0 if successful or offset in pattern of error */
+static int regexp_compile (SLRegexp_Type *reg)
+{
+ register unsigned char *buf, *ebuf, *pat;
+ unsigned char *last = NULL, *tmppat;
+ register unsigned char c;
+ int i, reverse = 0, n, cs;
+ int oparen = 0, nparen = 0;
+ /* substring stuff */
+ int count, last_count, this_max_mm = 0, max_mm = 0, ordinary_search,
+ no_osearch = 0, min_length = 0;
+ unsigned char *mm_p = NULL, *this_mm_p = NULL;
+ static int already_initialized;
+
+ reg->beg_matches0 = reg->end_matches0 = 0;
+ buf = reg->buf;
+ ebuf = (reg->buf + reg->buf_len) - 2; /* make some room */
+ pat = reg->pat;
+ cs = reg->case_sensitive;
+
+ if (already_initialized == 0)
+ {
+	SLang_init_case_tables ();
+#ifdef IBMPC_SYSTEM
+	SLmake_lut (Word_Chars, (unsigned char *) "_0-9a-zA-Z\200-\232\240-\245\341-\353", 0);
+#else
+	SLmake_lut (Word_Chars, (unsigned char *) "_0-9a-zA-Z\277-\326\330-\336\340-\366\370-\376", 0);
+#endif
+	already_initialized = 1;
+ }
+
+ i = 1; while (i < 10)
+ {
+	reg->beg_matchesi = -1;
+	reg->end_matchesi = 0;
+	i++;
+ }
+
+ if (*pat == '\\')
+ {
+	if (pat1 == 'c')
+	 {
+	 cs = 1;
+	 pat += 2;
+	 no_osearch = 1;
+	 }
+	else if (pat1 == 'C')
+	 {
+	 cs = 0;
+	 pat += 2;
+	 no_osearch = 1;
+	 }
+ }
+
+ if (*pat == '^')
+ {
+	pat++;
+	*buf++ = BOL;
+	reg->must_match_bol = 1;
+ }
+ else reg->must_match_bol = 0;
+
+ if (cs != reg->case_sensitive)
+ {
+	if (cs) *buf++ = YES_CASE;
+	else *buf++ = NO_CASE;
+ }
+
+ *buf = 0;
+
+ last_count = count = 0;
+ while ((c = *pat++) != 0)
+ {
+	if (buf >= ebuf - 3)
+	 {
+	 _pSLang_verror (SL_BUILTIN_LIMIT_EXCEEDED, "Pattern too large to be compiled.");
+	 ERROR;
+	 }
+
+	count++;
+	switch (c)
+	 {
+	 case '$':
+	 if (*pat != 0) goto literal_char;
+	 *buf++ = EOL;
+	 break;
+
+	 case '\\':
+	 c = *pat++;
+	 no_osearch = 1;
+	 switch(c)
+	 {
+		case 'e': c = 033; goto literal_char;
+		case 'n': c = '\n'; goto literal_char;
+		case 't': c = '\t'; goto literal_char;
+		case 'C': cs = 0; *buf++ = NO_CASE; break;
+		case 'c': cs = 1; *buf++ = YES_CASE; break;
+		case '1': case '2': case '3': case '4': case '5':
+		case '6': case '7': case '8': case '9':
+		 c = c - '0';
+		 if ((int) c > nparen) ERROR;
+		 last = buf;
+		 *buf++ = NTH_MATCH; *buf++ = c;
+		 break;
+#ifdef NOT_LITERAL
+		case '~':	 /* slang extension */
+		 if ((c = *pat) == 0) ERROR;
+		 pat++;
+		 last = buf;
+		 *buf++ = NOT_LITERAL;
+		 *buf++ = c;
+		 min_length++;
+		 break;
+#endif
+		case 'd':	 /* slang extension */
+		 last = buf;
+		 *buf++ = ANY_DIGIT;
+		 min_length++;
+		 break;
+
+		case '<':
+		 last = NULL;
+		 *buf++ = BOW;
+		 break;
+
+		case '>':
+		 last = NULL;
+		 *buf++ = EOW;
+		 break;
+
+		case '{':
+		 if (last == NULL) goto literal_char;
+		 *last |= MANY;
+		 tmppat = convert_digit(pat, &n);
+		 if (tmppat == NULL) ERROR;
+		 pat = tmppat;
+		 *buf++ = n;
+
+		 min_length += (n - 1);
+
+		 if (*pat == '\\')
+		 {
+		 *buf++ = n;
+		 }
+		 else if (*pat == ',')
+		 {
+		 pat++;
+		 if (*pat == '\\')
+			 {
+			 n = 255;
+			 }
+		 else
+			 {
+			 tmppat = convert_digit(pat, &n);
+			 if (tmppat == NULL) ERROR;
+			 pat = tmppat;
+			 if (*pat != '\\') ERROR;
+			 }
+		 *buf++ = n;
+		 }
+		 else ERROR;
+		 last = NULL;
+		 pat++;
+		 if (*pat != '}') ERROR;
+		 pat++;
+		 break; /* case '{' */
+
+		case '(':
+		 oparen++;
+		 if (oparen > 9) ERROR;
+		 *buf++ = OPAREN;
+		 break;
+		case ')':
+		 if (oparen == 0) ERROR;
+		 oparen--;
+		 nparen++;
+		 *buf++ = CPAREN;
+		 break;
+
+		case 0: ERROR;
+		default:
+		 goto literal_char;
+	 }
+	 break;
+
+	 case '':
+
+	 *buf = RANGE;
+	 last = buf++;
+
+	 if (buf + 32 >= ebuf) ERROR;
+
+	 for (i = 0; i < 32; i++) bufi = 0;
+	 c = *pat++;
+	 if (c == '^')
+	 {
+		 reverse = 1;
+		 SET_BIT(buf, '\n');
+		 c = *pat++;
+	 }
+
+	 if (c == '')
+	 {
+		 SET_BIT(buf, c);
+		 c = *pat++;
+	 }
+	 while (c && (c != ''))
+	 {
+		 if (c == '\\')
+		 {
+		 c = *pat++;
+		 switch(c)
+			 {
+			 case 'n': c = '\n'; break;
+			 case 't': c = '\t'; break;
+			 case 0: ERROR;
+			 }
+		 }
+
+		 if (*pat == '-')
+		 {
+		 pat++;
+		 while (c < *pat)
+			 {
+			 if (cs == 0)
+			 {
+				 SET_BIT(buf, UPPERCASE(c));
+				 SET_BIT(buf, LOWERCASE(c));
+			 }
+			 else SET_BIT(buf, c);
+			 c++;
+			 }
+		 }
+		 if (cs == 0)
+		 {
+		 SET_BIT(buf, UPPERCASE(c));
+		 SET_BIT(buf, LOWERCASE(c));
+		 }
+		 else SET_BIT(buf, c);
+		 c = *pat++;
+	 }
+	 if (c != '') ERROR;
+	 if (reverse) for (i = 0; i < 32; i++) bufi = bufi ^ 0xFF;
+	 reverse = 0;
+	 buf += 32;
+	 min_length++;
+	 break;
+
+	 case '.':
+	 last = buf;
+	 *buf++ = ANY;
+	 min_length++;
+	 break;
+
+	 case '*':
+	 if (last == NULL) goto literal_char;
+	 *last |= STAR;
+	 min_length--;
+	 last = NULL;
+	 break;
+
+	 case '+':
+	 if (last == NULL) goto literal_char;
+	 *last |= LEAST_ONCE;
+	 last = NULL;
+	 break;
+
+	 case '?':
+	 if (last == NULL) goto literal_char;
+	 *last |= MAYBE_ONCE;
+	 last = NULL;
+	 min_length--;
+	 break;
+
+	 literal_char:
+	 default:
+	 /* This is to keep track of longest substring */
+	 min_length++;
+	 this_max_mm++;
+	 if (last_count + 1 == count)
+	 {
+		 if (this_max_mm == 1)
+		 {
+		 this_mm_p = buf;
+		 }
+		 else if (max_mm < this_max_mm)
+		 {
+		 mm_p = this_mm_p;
+		 max_mm = this_max_mm;
+		 }
+	 }
+	 else
+	 {
+		 this_mm_p = buf;
+		 this_max_mm = 1;
+	 }
+
+	 last_count = count;
+
+	 last = buf;
+	 *buf++ = LITERAL;
+	 *buf++ = UPPERCASE(c);
+	 }
+ }
+ *buf = 0;
+ /* Check for ordinary search */
+ ebuf = buf;
+ buf = reg->buf;
+
+ if (no_osearch) ordinary_search = 0;
+ else
+ {
+	ordinary_search = 1;
+	while (buf < ebuf)
+	 {
+	 if (*buf != LITERAL)
+	 {
+		 ordinary_search = 0;
+		 break;
+	 }
+	 buf += 2;
+	 }
+ }
+
+ reg->osearch = ordinary_search;
+ reg->must_match_str15 = 0;
+ reg->min_length = (min_length > 0) ? (unsigned int) min_length : 0;
+ if (ordinary_search)
+ {
+	strncpy((char *) reg->must_match_str, (char *) reg->pat, 15);
+	reg->must_match = 1;
+	return(0);
+ }
+ /* check for longest substring of pattern */
+ reg->must_match = 0;
+ if ((mm_p == NULL) && (this_mm_p != NULL)) mm_p = this_mm_p;
+ if (mm_p == NULL)
+ {
+	return (0);
+ }
+ n = 15;
+ pat = reg->must_match_str;
+ buf = mm_p;
+ while (n--)
+ {
+	if (*buf++ != LITERAL) break;
+	*pat++ = *buf++;
+ }
+ *pat = 0;
+ if (pat != reg->must_match_str) reg->must_match = 1;
+ return(0);
+}
+
+void SLregexp_free (SLRegexp_Type *reg)
+{
+ if (reg == NULL)
+ return;
+ if (reg->buf != NULL)
+ SLfree ((char *) reg->buf);
+ SLfree ((char *) reg);
+}
+
+SLRegexp_Type *SLregexp_compile (SLFUTURE_CONST char *pattern, unsigned int flags)
+{
+ SLRegexp_Type *reg;
+ int ret;
+
+ reg = (SLRegexp_Type *)SLcalloc (1, sizeof (SLRegexp_Type));
+ if (reg == NULL)
+ return NULL;
+
+ if (NULL == (reg->buf = (unsigned char *)SLmalloc (1024)))
+ {
+	SLfree ((char *) reg);
+	return NULL;
+ }
+ reg->buf_len = 1024;
+ reg->case_sensitive = (0 == (flags & SLREGEXP_CASELESS));
+ reg->pat = (unsigned char *)pattern;
+
+ if (0 != (ret = regexp_compile (reg)))
+ {
+	SLang_verror (SL_Parse_Error, "Error compiling RE '%s' at byte offset %d",
+		 pattern, ret);
+	SLregexp_free (reg);
+	return NULL;
+ }
+
+ return reg;
+}
+
+char *SLregexp_quote_string (SLFUTURE_CONST char *re, char *buf, unsigned int buflen)
+{
+ char *b, *bmax;
+
+ if (re == NULL) return NULL;
+
+ b = buf;
+ bmax = buf + buflen;
+
+ while (b < bmax)
+ {
+	char ch;
+	switch (ch = *re++)
+	 {
+	 case 0:
+	 *b = 0;
+	 return buf;
+
+	 case '$':
+	 case '\\':
+	 case '':
+	 case '':
+	 case '.':
+	 case '^':
+	 case '*':
+	 case '+':
+	 case '?':
+	 *b++ = '\\';
+	 if (b == bmax) break;
+	 /* drop */
+
+	 default:
+	 *b++ = ch;
+	 }
+ }
+ return NULL;
+}
+
+int SLregexp_nth_match (SLRegexp_Type *reg, unsigned int nth,
+			SLstrlen_Type *ofsp, SLstrlen_Type *lenp)
+{
+ if (nth >= 10)
+ {
+	SLang_set_error (SL_InvalidParm_Error);
+	return -1;
+ }
+ if (reg->beg_matchesnth < 0)
+ return -1;
+
+ if (ofsp != NULL)
+ *ofsp = reg->beg_matchesnth;
+ if (lenp != NULL)
+ *lenp = reg->end_matchesnth;
+
+ return 0;
+}
+
+int SLregexp_get_hints (SLRegexp_Type *reg, unsigned int *hintsp)
+{
+ unsigned int hints = 0;
+
+ if (reg == NULL)
+ return -1;
+
+ if (reg->osearch) hints |= SLREGEXP_HINT_OSEARCH;
+ if (reg->must_match_bol) hints |= SLREGEXP_HINT_BOL;
+
+ *hintsp = hints;
+ return 0;
+}
+
+#if 0
+#define MAX_EXP 4096
+int main(int argc, char **argv)
+{
+ FILE *fp;
+ char *regexp, *file;
+ char expbufMAX_EXP, buf512;
+ SLRegexp_Type reg;
+
+ file = argv2;
+ regexp = argv1;
+
+ if (NULL == (fp = fopen(file, "r")))
+ {
+	fprintf(stderr, "File not open\n");
+	return(1);
+ }
+
+ reg.buf = expbuf;
+ reg.buf_len = MAX_EXP;
+ reg.pat = regexp;
+ reg.case_sensitive = 1;
+
+ if (!regexp_compile(&reg)) while (NULL != fgets(buf, 511, fp))
+ {
+	if (reg.osearch)
+	 {
+	 if (NULL == strstr(buf, reg.pat)) continue;
+	 }
+	else
+	 {
+	 if (reg.must_match && (NULL == strstr(buf, reg.must_match_str))) continue;
+	 if (0 == regexp_match(buf, buf + strlen(buf), &reg)) continue;
+	 }
+
+	fputs(buf, stdout);
+ }
+ return (0);
+}
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/slrline.c Added

@@ -0,0 +1,2426 @@
+/* SLang_read_line interface --- uses SLang tty stuff */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+#include <errno.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+typedef struct RL_History_Type
+{
+ struct RL_History_Type *prev, *next;
+ char *buf;
+ unsigned int len;
+ unsigned int point;
+} RL_History_Type;
+
+/* Maximum size of display */
+#define SLRL_DISPLAY_BUFFER_SIZE 4096 /* reasonable size for UTF-8 */
+
+struct _pSLrline_Type
+{
+ RL_History_Type *root, *tail, *last;
+ RL_History_Type *saved_line;	 /* used when browsing the history */
+ char *name;			 /* the name of this object */
+ unsigned char *buf;		 /* edit buffer */
+ unsigned int buf_len;			 /* sizeof buffer */
+ unsigned int point;			 /* current editing point */
+ unsigned int tab;			 /* tab width */
+ unsigned int len;			 /* current line size */
+
+ /* display variables */
+ unsigned int edit_width;		 /* #cols of display field */
+ int curs_pos;			 /* current column */
+ int start_column;		 /* column offset of display */
+ unsigned int hscroll;		 /* amount to use for horiz scroll */
+ SLFUTURE_CONST char *prompt;
+
+ SLang_Key_Type last_key;	 /* last key executed by rl */
+
+ /* These two contain an image of what is on the display. They are
+ * used by the default display handling functions. (update_hook is NULL)
+ */
+ unsigned char upd_buf1SLRL_DISPLAY_BUFFER_SIZE;
+ unsigned char upd_buf2SLRL_DISPLAY_BUFFER_SIZE;
+ unsigned char *old_upd, *new_upd; /* pointers to previous two buffers */
+ int new_upd_len, old_upd_len; /* length of output buffers */
+ unsigned int last_nonblank_column; /* column of last non-blank char */
+
+ SLKeyMap_List_Type *keymap;
+ int eof_char;
+
+ unsigned int flags;		 /* */
+
+ int state;
+#define RLI_LINE_INVALID	0
+#define RLI_LINE_SET		1
+#define RLI_LINE_IN_PROGRESS	2
+#define RLI_LINE_READ		3
+
+ int is_modified;
+
+ int quit;
+#define RLINE_QUIT_DONE 1
+#define RLINE_QUIT_ABORT 2
+
+ /* tty variables */
+ unsigned int (*getkey)(void); /* getkey function -- required */
+ void (*tt_goto_column)(int);
+ void (*tt_insert)(char);
+ void (*update_hook)(SLrline_Type *rli,
+		 SLFUTURE_CONST char *prompt, SLFUTURE_CONST char *buf, unsigned int len, unsigned int point,
+		 VOID_STAR client_data);
+ VOID_STAR update_client_data;
+ void (*update_free_update_data_hook)(SLrline_Type *rli, VOID_STAR client_data);
+ void (*update_clear_hook)(SLrline_Type *rli, VOID_STAR client_data);
+ void (*update_preread_hook)(SLrline_Type *rli, VOID_STAR client_data);
+ void (*update_postread_hook)(SLrline_Type *rli, VOID_STAR client_data);
+ void (*update_display_width_changed_hook)(SLrline_Type *rli, int width, VOID_STAR client_data);
+
+ /* This function is only called when blinking matches */
+ int (*input_pending)(int);
+
+ SLang_Name_Type *completion_callback;
+ SLang_Name_Type *list_completions_callback;
+};
+
+static SLang_Name_Type *Default_Completion_Callback;
+static SLang_Name_Type *Default_List_Completions_Callback;
+
+static unsigned char Char_Widths256;
+static void position_cursor (SLrline_Type *, int);
+
+static void free_history_item (RL_History_Type *h)
+{
+ if (h == NULL)
+ return;
+
+ if (h->buf != NULL)
+ SLang_create_slstring (h->buf);
+ SLfree ((char *)h);
+}
+
+static void free_history (RL_History_Type *h)
+{
+ while (h != NULL)
+ {
+	RL_History_Type *next = h->next;
+	free_history_item (h);
+	h = next;
+ }
+}
+
+static RL_History_Type *allocate_history (SLFUTURE_CONST char *str, int point)
+{
+ RL_History_Type *h;
+
+ if (NULL == (h = (RL_History_Type *) SLcalloc (1, sizeof (RL_History_Type)))
+ || (NULL == (h->buf = SLang_create_slstring (str))))
+ {
+	SLfree ((char *)h);	 /* NULL ok */
+	return NULL;
+ }
+
+ h->len = strlen (str);
+ if ((point < 0) || ((unsigned int)point > h->len))
+ point = h->len;
+ h->point = point;
+ return h;
+}
+
+static void rl_beep (void)
+{
+ putc(7, stdout);
+ fflush (stdout);
+}
+
+static int check_space (SLrline_Type *This_RLI, unsigned int dn)
+{
+ unsigned char *new_buf;
+ unsigned int new_len;
+
+ new_len = 1 + This_RLI->len + dn;
+
+ if (new_len <= This_RLI->buf_len)
+ return 0;
+
+ if (NULL == (new_buf = (unsigned char *) SLrealloc ((char *)This_RLI->buf, new_len)))
+ return -1;
+
+ This_RLI->buf_len = new_len;
+ This_RLI->buf = new_buf;
+ return 0;
+}
+
+/* editing functions */
+int SLrline_bol (SLrline_Type *This_RLI)
+{
+ This_RLI->point = 0;
+ return 0;
+}
+
+int SLrline_eol (SLrline_Type *This_RLI)
+{
+ This_RLI->point = This_RLI->len;
+ return 0;
+}
+
+static int rl_right (SLrline_Type *This_RLI)
+{
+ SLuchar_Type *s, *smax;
+ int ignore_combining = 1;
+
+ s = This_RLI->buf + This_RLI->point;
+ smax = This_RLI->buf + This_RLI->len;
+
+ if (s < smax)
+ {
+	if (This_RLI->flags & SL_RLINE_UTF8_MODE)
+	 s = SLutf8_skip_chars (s, smax, 1, NULL, ignore_combining);
+	else
+	 s++;
+
+	This_RLI->point = s - This_RLI->buf;
+ }
+
+ return 0;
+}
+
+static int rl_left (SLrline_Type *This_RLI)
+{
+ SLuchar_Type *s, *smin;
+ int ignore_combining = 1;
+
+ smin = This_RLI->buf;
+ s = smin + This_RLI->point;
+
+ if (s > smin)
+ {
+	if (This_RLI->flags & SL_RLINE_UTF8_MODE)
+	 s = SLutf8_bskip_chars (smin, s, 1, NULL, ignore_combining);
+	else
+	 s--;
+
+	This_RLI->point = s - This_RLI->buf;
+ }
+
+ return 0;
+}
+
+int SLrline_move (SLrline_Type *rli, int n)
+{
+ if (rli == NULL)
+ return -1;
+
+ if (n < 0)
+ {
+	n = -n;
+	while (n && rli->point)
+	 {
+	 (void) rl_left (rli);
+	 n--;
+	 }
+	return 0;
+ }
+
+ while (n && (rli->point != rli->len))
+ {
+	(void) rl_right (rli);
+	n--;
+ }
+ return 0;
+}
+
+int SLrline_ins (SLrline_Type *This_RLI, SLFUTURE_CONST char *s, unsigned int n)
+{
+ unsigned char *pmin;
+
+ if (-1 == check_space (This_RLI, n + 128))
+ return -1;
+
+ pmin = This_RLI->buf + This_RLI->point;
+ if (This_RLI->len)
+ {
+	unsigned char *p = This_RLI->buf + This_RLI->len;
+	while (p >= pmin)
+	 {
+	 *(p + n) = *p;
+	 p--;
+	 }
+ }
+ memcpy ((char *) pmin, s, n);
+
+ This_RLI->len += n;
+ This_RLI->point += n;
+ This_RLI->is_modified = 1;
+
+ return n;
+}
+
+static int rl_self_insert (SLrline_Type *This_RLI)
+{
+ char buf8;
+
+ buf0 = SLang_Last_Key_Char;
+ buf1 = 0;
+
+ return SLrline_ins (This_RLI, buf, 1);
+}
+
+int SLrline_del (SLrline_Type *This_RLI, unsigned int n)
+{
+ SLuchar_Type *pmax, *p, *pn;
+ int ignore_combining = 1;
+
+ p = This_RLI->buf + This_RLI->point;
+ pmax = This_RLI->buf + This_RLI->len;
+
+ if (This_RLI->flags & SL_RLINE_UTF8_MODE)
+ {
+	pn = SLutf8_skip_chars (p, pmax, n, NULL, ignore_combining);
+	n = pn - p;
+ }
+ else
+ {
+	if (p + n > pmax) n = (pmax - p);
+	pn = p + n;
+ }
+ This_RLI->len -= n;
+
+ while (pn < pmax)
+ {
+	*p++ = *pn++;
+ }
+ This_RLI->is_modified = 1;
+ return 0;
+}
+
+static int rl_del (SLrline_Type *This_RLI)
+{
+ return SLrline_del (This_RLI, 1);
+}
+
+static int rl_quote_insert (SLrline_Type *This_RLI)
+{
+ /* FIXME. We should not be messing with SLang_Error here */
+ int err = _pSLang_Error;
+ _pSLang_Error = 0;
+ SLang_Last_Key_Char = (*This_RLI->getkey)();
+ if (_pSLang_Error == SL_USER_BREAK)
+ {
+	SLKeyBoard_Quit = 0;
+	SLang_Last_Key_Char = SLang_Abort_Char;
+ }
+ SLang_set_error (err);
+ rl_self_insert (This_RLI);
+ return 0;
+}
+
+static int rl_trim (SLrline_Type *This_RLI)
+{
+ unsigned char *p, *pmax, *p1;
+
+ p = This_RLI->buf + This_RLI->point;
+ pmax = This_RLI->buf + This_RLI->len;
+
+ if (p == pmax)
+ {
+	if (p == This_RLI->buf) return 0;
+	p--;
+ }
+
+ if ((*p != ' ') && (*p != '\t')) return 0;
+ p1 = p;
+ while ((p1 < pmax) && ((*p1 == ' ') || (*p1 == '\t'))) p1++;
+ pmax = p1;
+ p1 = This_RLI->buf;
+
+ while ((p >= p1) && ((*p == ' ') || (*p == '\t'))) p--;
+ if (p == pmax) return 0;
+ p++;
+
+ This_RLI->point = (int) (p - p1);
+ return SLrline_del (This_RLI, (int) (pmax - p));
+}
+
+static int rl_bdel (SLrline_Type *This_RLI)
+{
+ if (This_RLI->point)
+ {
+	rl_left (This_RLI);
+	rl_del(This_RLI);
+ }
+ return 0;
+}
+
+static int rl_delbol (SLrline_Type *This_RLI)
+{
+ while (This_RLI->point)
+ {
+	rl_left (This_RLI);
+	rl_del(This_RLI);
+ }
+ return 0;
+}
+
+static int rl_deleol (SLrline_Type *This_RLI)
+{
+ if (This_RLI->point == This_RLI->len) return 0;
+ *(This_RLI->buf + This_RLI->point) = 0;
+ This_RLI->len = This_RLI->point;
+ This_RLI->is_modified = 1;
+ return 0;
+}
+
+#if 0
+static int rl_delete_line (SLrline_Type *This_RLI)
+{
+ (void) SLrline_bol (This_RLI);
+ rl_deleol (This_RLI);
+ return 0;
+}
+#endif
+
+static int rl_enter (SLrline_Type *This_RLI)
+{
+ if (-1 == check_space (This_RLI, 1))
+ return -1;
+
+ *(This_RLI->buf + This_RLI->len) = 0;
+ This_RLI->quit = RLINE_QUIT_DONE;
+ return 0;
+}
+
+static int rl_complete (SLrline_Type *rli)
+{
+ char *line;
+ unsigned int i, n, nbytes;
+ char **strings, *str0, ch0;
+ int start_point, delta;
+ SLang_Array_Type *at;
+ SLang_Name_Type *completion_callback;
+ SLang_Name_Type *list_completions_callback;
+
+ if (NULL == (completion_callback = rli->completion_callback))
+ {
+	completion_callback = Default_Completion_Callback;
+	if (completion_callback == NULL)
+	 return SLrline_ins (rli, "\t", 1);
+ }
+ if (NULL == (list_completions_callback = rli->list_completions_callback))
+ list_completions_callback = Default_List_Completions_Callback;
+
+ if (NULL == (line = SLrline_get_line (rli)))
+ return -1;
+
+ if ((-1 == SLang_start_arg_list ())
+ || (-1 == SLang_push_string (line))
+ || (-1 == SLang_push_int (rli->point))
+ || (-1 == SLang_end_arg_list ())
+ || (-1 == SLexecute_function (completion_callback)))
+ {
+	SLfree (line);
+	return -1;
+ }
+
+ SLfree (line);
+
+ if (-1 == SLang_pop_int (&start_point))
+ return -1;
+
+ if (start_point < 0)
+ start_point = 0;
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_STRING_TYPE))
+ return -1;
+
+ strings = (char **) at->data;
+ n = at->num_elements;
+
+ if (n == 0)
+ {
+	SLang_free_array (at);
+	return 0;
+ }
+
+ if ((n != 1) && (list_completions_callback != NULL))
+ {
+	if ((-1 == SLang_start_arg_list ())
+	 || (-1 == SLang_push_array (at, 0))
+	 || (-1 == SLang_end_arg_list ())
+	 || (-1 == SLexecute_function (list_completions_callback)))
+	 {
+	 SLang_free_array (at);
+	 return -1;
+	 }
+	(void) SLrline_redraw (rli);
+ }
+
+ str0 = strings0;
+ nbytes = 0;
+ while (0 != (ch0 = str0nbytes))
+ {
+	for (i = 1; i < n; i++)
+	 {
+	 char ch1 = stringsinbytes;
+	 if (ch0 != ch1)
+	 break;
+	 }
+	if (i != n)
+	 break;
+	nbytes++;
+ }
+
+ delta = start_point - rli->point;
+ if (delta < 0)
+ {
+	(void) SLrline_move (rli, delta);
+	delta = -delta;
+ }
+ (void) SLrline_del (rli, (unsigned int) delta);
+ (void) SLrline_ins (rli, str0, nbytes);
+
+ /* How should the completion be ended?
+ * "foo/ --> "foo/
+ * "foo/bar --> "foo/bar"
+ * "foo --> "foo"
+ * foo --> fooSPACE
+ * foo/bar --> fooSPACE
+ */
+ if ((n == 1)
+ && nbytes && (str0nbytes-1 != '/') && (str0nbytes-1 != '\\'))
+ {
+	char qch = ' ';
+
+	if (start_point > 0)
+	 {
+	 ch0 = rli->bufstart_point-1;
+	 if ((ch0 == '"') || (ch0 == '\''))
+	 qch = ch0;
+	 }
+	if (qch != 0)
+	 (void) SLrline_ins (rli, &qch, 1);
+ }
+
+ SLang_free_array (at);
+ return 0;
+}
+
+static SLKeyMap_List_Type *RL_Keymap;
+
+static SLuchar_Type *compute_char_width (SLuchar_Type *b, SLuchar_Type *bmax, int utf8_mode, unsigned int *wp, SLwchar_Type *wchp, int *illegalp)
+{
+ SLwchar_Type wch;
+
+ if (illegalp != NULL) *illegalp = 0;
+
+ if (b >= bmax)
+ {
+	*wp = 0;
+	if (wchp != NULL) *wchp = 0;
+	return b;
+ }
+
+ if (utf8_mode == 0)
+ {
+	*wp = Char_Widths*b;
+	if (wchp != NULL) *wchp = *b;
+	return b + 1;
+ }
+
+ if (NULL == SLutf8_decode (b, bmax, &wch, NULL))
+ {
+	/* Illegal byte sequence */
+	*wp = 4; /* <XX> */
+	if (wchp != NULL) *wchp = *b;
+	if (illegalp != NULL) *illegalp = 1;
+	return b + 1;
+ }
+
+ /* skip combining */
+ if ((wch >= ' ') && (wch < 127))
+ *wp = 1;
+ else if (wch > 127)
+ *wp = SLwchar_wcwidth (wch);
+ else
+ *wp = 2;			 /* ^X */
+
+ if (wchp != NULL) *wchp = wch;
+ /* skip combining chars too */
+ return SLutf8_skip_chars (b, bmax, 1, NULL, 1);
+}
+
+/* This update is designed for dumb terminals. It assumes only that the
+ * terminal can backspace via ^H, and move cursor to start of line via ^M.
+ * There is a hook so the user can provide a more sophisticated update if
+ * necessary.
+ */
+static void position_cursor (SLrline_Type *This_RLI, int col)
+{
+ unsigned char *p, *pmax;
+ unsigned int len, dlen;
+ int curs_pos;
+ int dc;
+ int utf8_mode = This_RLI->flags & SL_RLINE_UTF8_MODE;
+
+ if (col == This_RLI->curs_pos)
+ {
+	fflush (stdout);
+	return;
+ }
+
+ if (This_RLI->tt_goto_column != NULL)
+ {
+	(*This_RLI->tt_goto_column)(col);
+	This_RLI->curs_pos = col;
+	fflush (stdout);
+	return;
+ }
+
+ curs_pos = This_RLI->curs_pos;
+ dc = This_RLI->curs_pos - col;
+ if (dc < 0)
+ {
+	p = This_RLI->new_upd;
+	pmax = p + SLRL_DISPLAY_BUFFER_SIZE;
+
+	len = 0;
+	while (((int)len < curs_pos) && (p < pmax))
+	 {
+	 p = compute_char_width (p, pmax, utf8_mode, &dlen, NULL, NULL);
+	 len += dlen;
+	 }
+	while (((int)len < col) && (p < pmax))
+	 {
+	 SLuchar_Type *p1;
+	 p1 = compute_char_width (p, pmax, utf8_mode, &dlen, NULL, NULL);
+	 while (p < p1)
+	 putc((char) *p++, stdout);
+
+	 len += dlen;
+	 }
+ }
+ else
+ {
+	if (dc < col)
+	 {
+	 while (dc--) putc(8, stdout);
+	 }
+	else
+	 {
+	 putc('\r', stdout);
+	 p = This_RLI->new_upd;
+	 pmax = p + SLRL_DISPLAY_BUFFER_SIZE;
+	 len = 0;
+	 while (((int)len < col) && (p < pmax))
+	 {
+		 SLuchar_Type *p1;
+		 p1 = compute_char_width (p, pmax, utf8_mode, &dlen, NULL, NULL);
+		 while (p < p1)
+		 putc((char) *p++, stdout);
+		 len += dlen;
+	 }
+	 }
+ }
+ This_RLI->curs_pos = col;
+ fflush (stdout);
+}
+
+static void erase_eol (SLrline_Type *rli)
+{
+ int col = rli->curs_pos;
+ int col_max = rli->last_nonblank_column;
+
+ while (col < col_max)
+ {
+	putc(' ', stdout);
+	col++;
+ }
+ rli->curs_pos = col_max;
+}
+
+static void spit_out(SLrline_Type *rli, SLuchar_Type *p, SLuchar_Type *pmax, int col)
+{
+ int utf8_mode = rli->flags & SL_RLINE_UTF8_MODE;
+ position_cursor (rli, col);
+ while (p < pmax)
+ {
+	SLuchar_Type *p1;
+	unsigned int dcol;
+	p1 = compute_char_width (p, pmax, utf8_mode, &dcol, NULL, NULL);
+	while (p < p1)
+	 putc((char) *p++, stdout);
+	col += dcol;
+ }
+ rli->curs_pos = col;
+}
+
+static void really_update (SLrline_Type *rli, int new_curs_position)
+{
+ SLuchar_Type *b, *bmax, *p, *pmax;
+ unsigned int col, max_col;
+ int utf8_mode = rli->flags & SL_RLINE_UTF8_MODE;
+
+ col = 0;
+ max_col = rli->edit_width-1;
+ b = rli->old_upd;
+ p = rli->new_upd;
+ bmax = b + rli->old_upd_len;
+ pmax = p + rli->new_upd_len;
+
+ while (col < max_col)
+ {
+	SLwchar_Type pch, bch;
+	SLuchar_Type *p1, *b1;
+	unsigned int plen, blen;
+
+	b1 = compute_char_width (b, bmax, utf8_mode, &blen, &bch, NULL);
+	p1 = compute_char_width (p, pmax, utf8_mode, &plen, &pch, NULL);
+
+	if ((p1 != p) && ((b1-b) == (p1-p))
+	 && (bch == pch))
+	 {
+	 col += plen;
+	 b = b1;
+	 p = p1;
+	 continue;
+	 }
+
+	spit_out (rli, p, pmax, col);
+
+	col = rli->curs_pos;
+	if (col < rli->last_nonblank_column)
+	 erase_eol (rli);
+	rli->last_nonblank_column = col;
+
+	break;
+ }
+
+ position_cursor (rli, new_curs_position);
+
+ /* update finished, so swap */
+
+ rli->old_upd_len = rli->new_upd_len;
+ p = rli->old_upd;
+ rli->old_upd = rli->new_upd;
+ rli->new_upd = p;
+}
+
+static SLuchar_Type *
+ compute_tabbed_char_width (SLuchar_Type *b, SLuchar_Type *bmax,
+			 int utf8_mode, int col, int tab_width,
+			 unsigned int *dlenp)
+{
+ if (b >= bmax)
+ {
+	*dlenp = 0;
+	return bmax;
+ }
+
+ if ((*b == '\t') && tab_width)
+ {
+	*dlenp = tab_width * (col / tab_width + 1) - col;
+	return b+1;
+ }
+
+ return compute_char_width (b, bmax, utf8_mode, dlenp, NULL, NULL);
+}
+
+static unsigned int compute_string_width (SLrline_Type *rli, SLuchar_Type *b, SLuchar_Type *bmax, unsigned int tab_width)
+{
+ int utf8_mode = rli->flags & SL_RLINE_UTF8_MODE;
+ unsigned int len;
+
+ if (b == NULL)
+ return 0;
+
+ len = 0;
+ while (b < bmax)
+ {
+	unsigned int dlen;
+
+	if ((*b == '\t') && tab_width)
+	 {
+	 dlen = tab_width * (len / tab_width + 1) - len;
+	 b++;
+	 }
+	else b = compute_char_width (b, bmax, utf8_mode, &dlen, NULL, NULL);
+
+	len += dlen;
+ }
+ return len;
+}
+
+static void RLupdate (SLrline_Type *rli)
+{
+ unsigned int len, dlen, prompt_len = 0, tw = 0, count;
+ unsigned int start_len;
+ int want_cursor_pos;
+ unsigned char *b, *bmax, *b_point, *p, *pmax;
+ int no_echo;
+ int utf8_mode;
+ unsigned int edit_width;
+
+ no_echo = rli->flags & SL_RLINE_NO_ECHO;
+ utf8_mode = rli->flags & SL_RLINE_UTF8_MODE;
+ edit_width = rli->edit_width-1;
+
+ *(rli->buf + rli->len) = 0;
+
+ if (rli->update_hook != NULL)
+ {
+	if (no_echo)
+	 (*rli->update_hook) (rli, rli->prompt, "", 0, 0, rli->update_client_data);
+	else
+	 (*rli->update_hook) (rli, rli->prompt, (char *)rli->buf, rli->len, rli->point, rli->update_client_data);
+	return;
+ }
+
+ /* expand characters for output buffer --- handle prompt first.
+ * Do two passes --- first to find out where to begin upon horiz
+ * scroll and the second to actually fill the buffer. */
+ len = 0;
+ b = (unsigned char *) rli->prompt;
+ if (b != NULL)
+ {
+	bmax = b + strlen ((char *)b);
+	len += compute_string_width (rli, b, bmax, 0);
+ }
+ prompt_len = len;
+
+ b = (unsigned char *) rli->buf;
+ b_point = (unsigned char *) (rli->buf + rli->point);
+ if (no_echo == 0)
+ len += compute_string_width (rli, b, b_point, rli->tab);
+
+ if (len + rli->hscroll < edit_width) start_len = 0;
+ else if ((rli->start_column > (int)len)
+	 || (rli->start_column + (int)edit_width <= (int)len))
+ start_len = (len + rli->hscroll) - edit_width;
+ else start_len = rli->start_column;
+ rli->start_column = start_len;
+
+ /* want_cursor_pos = len - start_len; */
+
+ /* second pass */
+ b = (unsigned char *) rli->prompt;
+ if (b == NULL) b = (unsigned char *) "";
+ bmax = b + strlen ((char *)b);
+ len = 0;
+ count = 2;
+ while ((len < start_len) && (b < bmax))
+ {
+	b = compute_tabbed_char_width (b, bmax, utf8_mode, 0, 0, &dlen);
+	len += dlen;
+ }
+
+ tw = 0;
+ if (b == bmax)
+ {
+	b = (unsigned char *) rli->buf;
+	bmax = b + strlen ((char *)b);
+	tw = rli->tab;
+	while ((len < start_len) && (b < bmax))
+	 {
+	 b = compute_tabbed_char_width (b, bmax, utf8_mode, 0, tw, &dlen);
+	 len += dlen;
+	 }
+	count--;
+ }
+
+ len = 0;
+ p = rli->new_upd;
+ pmax = p + SLRL_DISPLAY_BUFFER_SIZE;
+ want_cursor_pos = -1;
+
+ while (count--)
+ {
+	if ((count == 0) && (no_echo))
+	 break;
+
+	while ((len < edit_width) && (b < bmax))
+	 {
+	 SLwchar_Type wch;
+	 int is_illegal;
+	 SLuchar_Type *b1;
+
+	 if (b == b_point)
+	 want_cursor_pos = len;
+
+	 if ((*b == '\t') && tw)
+	 {
+		 dlen = tw * ((len + start_len - prompt_len) / tw + 1) - (len + start_len - prompt_len);
+		 len += dlen;	 /* ok since dlen comes out 0 */
+		 if (len > edit_width) dlen = len - edit_width;
+		 while (dlen-- && (p < pmax)) *p++ = ' ';
+		 b++;
+		 continue;
+	 }
+
+	 b1 = compute_char_width (b, bmax, utf8_mode, &dlen, &wch, &is_illegal);
+	 if (len + dlen > edit_width)
+	 {
+		 /* The character is double width and a portion of it exceeds
+		 * the edit width
+		 */
+		 break;
+	 }
+
+	 if (is_illegal == 0)
+	 {
+		 if (wch < 32)
+		 {
+		 if (p < pmax) *p++ = '^';
+		 if (p < pmax) *p++ = *b + '@';
+		 }
+		 else if (wch == 127)
+		 {
+		 if (p < pmax) *p++ = '^';
+		 if (p < pmax) *p++ = '?';
+		 }
+		 else while (b < b1)
+		 {
+		 if (p < pmax) *p++ = *b++;
+		 }
+	 }
+	 else
+	 {
+		 if (p + 4 < pmax)
+		 {
+		 sprintf ((char *)p, "<%02X>", *b);
+		 p += 4;
+		 }
+	 }
+	 b = b1;
+	 len += dlen;
+	 }
+	/* if (start_len > prompt_len) break; */
+	tw = rli->tab;
+	b = (unsigned char *) rli->buf;
+	bmax = b + strlen ((char *)b);
+ }
+
+ if (want_cursor_pos == -1)
+ want_cursor_pos = len;
+
+ rli->new_upd_len = (int) (p - rli->new_upd);
+ while ((p < pmax) && (len < edit_width))
+ {
+	*p++ = ' ';
+	len++;
+ }
+ really_update (rli, want_cursor_pos);
+}
+
+void SLrline_redraw (SLrline_Type *rli)
+{
+ if (rli == NULL)
+ return;
+
+ if (rli->update_hook != NULL)
+ {
+	(*rli->update_hook) (rli, "", "", 0, 0, rli->update_client_data);
+ }
+ else
+ {
+	unsigned char *p;
+	unsigned char *pmax;
+
+	p = rli->new_upd;
+	pmax = p + rli->edit_width;
+	while (p < pmax) *p++ = ' ';
+	rli->new_upd_len = rli->edit_width;
+	rli->last_nonblank_column = rli->edit_width-1;
+	really_update (rli, 0);
+	rli->last_nonblank_column = 0;
+ }
+ RLupdate (rli);
+}
+
+static int rl_eof_insert (SLrline_Type *This_RLI)
+{
+ return rl_enter (This_RLI);
+}
+
+/* This is very naive. It knows very little about nesting and nothing
+ * about quoting.
+ */
+static void blink_match (SLrline_Type *rli)
+{
+ unsigned char bra, ket;
+ unsigned int delta_column;
+ unsigned char *p, *pmin;
+ int dq_level, sq_level;
+ int level;
+
+ pmin = rli->buf;
+ p = pmin + rli->point;
+ if (pmin == p)
+ return;
+
+ ket = SLang_Last_Key_Char;
+ switch (ket)
+ {
+ case ')':
+	bra = '(';
+	break;
+ case '':
+	bra = '';
+	break;
+ case '}':
+	bra = '{';
+	break;
+ default:
+	return;
+ }
+
+ level = 0;
+ sq_level = dq_level = 0;
+
+ delta_column = 0;
+ while (p > pmin)
+ {
+	char ch;
+
+	p--;
+	delta_column++;
+	ch = *p;
+
+	if (ch == ket)
+	 {
+	 if ((dq_level == 0) && (sq_level == 0))
+	 level++;
+	 }
+	else if (ch == bra)
+	 {
+	 if ((dq_level != 0) || (sq_level != 0))
+	 continue;
+
+	 level--;
+	 if (level == 0)
+	 {
+		 rli->point -= delta_column;
+		 RLupdate (rli);
+		 if (rli->input_pending != NULL)
+		 (*rli->input_pending)(10);
+		 rli->point += delta_column;
+		 RLupdate (rli);
+		 break;
+	 }
+	 if (level < 0)
+	 break;
+	 }
+	else if (ch == '"') dq_level = !dq_level;
+	else if (ch == '\'') sq_level = !sq_level;
+ }
+}
+
+static void free_last_key (SLrline_Type *rli)
+{
+ SLang_Key_Type *last_key;
+
+ if (rli == NULL)
+ return;
+
+ last_key = &rli->last_key;
+ switch (last_key->type)
+ {
+ case SLKEY_F_INTERPRET:
+	if (last_key->f.s != NULL)
+	 {
+	 SLang_free_slstring (last_key->f.s);
+	 last_key->f.s = NULL;
+	 }
+	break;
+
+ case SLKEY_F_SLANG:
+	if (NULL != last_key->f.slang_fun)
+	 {
+	 SLang_free_function (last_key->f.slang_fun);
+	 last_key->f.slang_fun = NULL;
+	 }
+	break;
+ }
+
+ last_key->type = 0;
+}
+
+static int save_last_key (SLrline_Type *rli, SLang_Key_Type *key)
+{
+ SLang_Key_Type *last_key;
+
+ if ((rli == NULL) || (key == NULL))
+ return 0;
+
+ free_last_key (rli);
+
+ last_key = &rli->last_key;
+ last_key->type = 0;
+
+ switch (key->type)
+ {
+ case SLKEY_F_INTERPRET:
+	if (NULL == (last_key->f.s = SLang_create_slstring (key->f.s)))
+	 return -1;
+	break;
+
+ case SLKEY_F_KEYSYM:
+	last_key->f.keysym = key->f.keysym;
+	break;
+
+ case SLKEY_F_SLANG:
+	if (NULL == (last_key->f.slang_fun = SLang_copy_function (key->f.slang_fun)))
+	 return -1;
+	break;
+
+ default:
+ case SLKEY_F_INTRINSIC:
+	last_key->f.f = key->f.f;
+ }
+
+ last_key->type = key->type;
+ memcpy (last_key->str, key->str, sizeof(key->str));
+ return 0;
+}
+
+static SLrline_Type *Active_Rline_Info = NULL;
+
+char *SLrline_read_line (SLrline_Type *rli, SLFUTURE_CONST char *prompt, unsigned int *lenp)
+{
+ unsigned char *p, *pmax;
+ int last_input_char;
+ unsigned int dummy_len_buf;
+
+ if (lenp == NULL)
+ lenp = &dummy_len_buf;
+
+ *lenp = 0;
+
+ if (rli == NULL)
+ return NULL;
+
+ if (rli->state == RLI_LINE_IN_PROGRESS)
+ {
+	*lenp = 0;
+	return NULL;
+ }
+
+ if (prompt == NULL)
+ prompt = "";
+
+ if ((rli->prompt == NULL)
+ || strcmp (rli->prompt, prompt))
+ {
+	if (NULL == (prompt = SLmake_string (prompt)))
+	 return NULL;
+
+	SLfree ((char *)rli->prompt);
+	rli->prompt = prompt;
+ }
+
+ rli->quit = 0;
+ p = rli->old_upd; pmax = p + rli->edit_width;
+ while (p < pmax) *p++ = ' ';
+
+ if (rli->state != RLI_LINE_SET)
+ {
+	rli->len = 0;
+	rli->point = 0;
+	*rli->buf = 0;
+ }
+ rli->state = RLI_LINE_IN_PROGRESS;
+
+ if (rli->update_preread_hook != NULL)
+ (*rli->update_preread_hook)(rli, rli->update_client_data);
+
+ rli->curs_pos = rli->start_column = 0;
+ rli->new_upd_len = rli->old_upd_len = 0;
+
+ free_last_key (rli);
+ if (rli->update_hook == NULL)
+ putc ('\r', stdout);
+
+ rli->is_modified = 0;
+ rli->last = NULL;
+
+ RLupdate (rli);
+
+ last_input_char = 0;
+ while (1)
+ {
+	SLang_Key_Type *key;
+	SLrline_Type *save_rli = Active_Rline_Info;
+
+	errno = 0;
+	key = SLang_do_key (RL_Keymap, (int (*)(void)) rli->getkey);
+
+	if ((key == NULL) || (key->f.f == NULL))
+	 {
+	 if ((key == NULL)
+		 && (SLANG_GETKEY_ERROR == (unsigned int)SLang_Last_Key_Char)
+#ifdef EINTR
+		 && (errno != EINTR)
+#endif
+		)
+	 return NULL;
+
+	 rl_beep ();
+	 continue;
+	 }
+
+	if ((*key->str != 2) || (key->str1 != rli->eof_char))
+	 last_input_char = 0;
+	else
+	 {
+	 if ((rli->len == 0) && (last_input_char != rli->eof_char))
+	 {
+		 rli->bufrli->len = 0;
+		 rli->state = RLI_LINE_READ;
+		 *lenp = 0;
+
+		 if (rli->update_postread_hook != NULL)
+		 (*rli->update_postread_hook)(rli, rli->update_client_data);
+
+		 return NULL;	 /* EOF */
+	 }
+
+	 last_input_char = rli->eof_char;
+	 }
+
+	Active_Rline_Info = rli;
+	if (key->type == SLKEY_F_INTRINSIC)
+	 {
+	 int (*func)(SLrline_Type *);
+	 func = (int (*)(SLrline_Type *)) key->f.f;
+
+	 (void) (*func)(rli);
+
+	 RLupdate (rli);
+
+	 if ((rli->flags & SL_RLINE_BLINK_MATCH)
+		 && (rli->input_pending != NULL))
+	 blink_match (rli);
+	 }
+	else if (key->type == SLKEY_F_SLANG)
+	 {
+	 (void) SLexecute_function (key->f.slang_fun);
+	 RLupdate (rli);
+	 }
+	Active_Rline_Info = save_rli;
+
+	if (_pSLang_Error) rli->quit = RLINE_QUIT_ABORT;
+
+	if (rli->quit)
+	 {
+	 if (rli->quit == RLINE_QUIT_ABORT)
+	 {
+		 rli->len = 0;
+	 }
+	 rli->bufrli->len = 0;
+	 rli->state = RLI_LINE_READ;
+	 *lenp = rli->len;
+
+	 free_history_item (rli->saved_line);
+	 rli->saved_line = NULL;
+
+	 if (rli->update_postread_hook != NULL)
+	 (*rli->update_postread_hook)(rli, rli->update_client_data);
+
+	 if (rli->quit == RLINE_QUIT_ABORT)
+	 {
+		 return NULL;
+	 }
+
+	 return SLmake_nstring ((char *)rli->buf, rli->len);
+	 }
+	if (key != NULL)
+	 (void) save_last_key (rli, key);
+ }
+}
+
+static int rl_abort (SLrline_Type *This_RLI)
+{
+ SLang_set_error (SL_USER_BREAK);
+ This_RLI->quit = RLINE_QUIT_ABORT;
+ return 0;
+}
+
+/* TTY interface --- ANSI */
+
+static void ansi_goto_column (int n)
+{
+ putc('\r', stdout);
+ if (n) fprintf(stdout, "\033%dC", n);
+}
+
+static int rl_select_line (SLrline_Type *rli, RL_History_Type *p)
+{
+ unsigned int len;
+
+ len = p->len;
+ if (-1 == check_space (rli, len))
+ return -1;
+
+ rli->last = p;
+ strcpy ((char *) rli->buf, p->buf);
+ rli->point = p->point;
+ rli->len = len;
+ rli->is_modified = 0;
+ return 0;
+}
+
+static int rl_redraw (SLrline_Type *This_RLI)
+{
+ SLrline_redraw (This_RLI);
+ return 0;
+}
+
+static int rl_prev_line (SLrline_Type *This_RLI)
+{
+ RL_History_Type *prev;
+
+ if ((This_RLI->is_modified)
+ || (This_RLI->last == NULL))
+ {
+	prev = This_RLI->tail;
+ }
+ else
+ prev = This_RLI->last->prev;
+
+ if (prev == NULL)
+ {
+	rl_beep ();
+	return 0;
+ }
+
+ if (prev == This_RLI->tail)
+ {
+	This_RLI->bufThis_RLI->len = 0;
+	free_history_item (This_RLI->saved_line);
+	This_RLI->saved_line = allocate_history ((char *)This_RLI->buf, This_RLI->point);
+	if (This_RLI->saved_line == NULL)
+	 return -1;
+ }
+
+ return rl_select_line (This_RLI, prev);
+}
+
+static int rl_next_line (SLrline_Type *This_RLI)
+{
+ RL_History_Type *next;
+
+ if ((This_RLI->is_modified)
+ || (This_RLI->last == NULL))
+ {
+	rl_beep ();
+	return 0;
+ }
+
+ next = This_RLI->last->next;
+
+ if (next == NULL)
+ {
+	int status = 0;
+
+	if (This_RLI->saved_line != NULL)
+	 {
+	 status = rl_select_line (This_RLI, This_RLI->saved_line);
+	 free_history_item (This_RLI->saved_line);
+	 This_RLI->saved_line = NULL;
+	 This_RLI->is_modified = 1;
+	 if (status == 0)
+	 return 0;
+	 }
+	This_RLI->len = This_RLI->point = 0;
+	*This_RLI->buf = 0;
+	This_RLI->last = NULL;
+	This_RLI->is_modified = 0;
+	return status;
+ }
+
+ return rl_select_line (This_RLI, next);
+}
+
+#define AKEY(name,func) {name,(int (*)(void))func}
+
+static SLKeymap_Function_Type SLReadLine_Functions =
+{
+ AKEY("kbd_quit",rl_abort),
+ AKEY("redraw",rl_redraw),
+ AKEY("up", rl_prev_line),
+ AKEY("down", rl_next_line),
+ AKEY("bol", SLrline_bol),
+ AKEY("eol", SLrline_eol),
+ AKEY("right", rl_right),
+ AKEY("left", rl_left),
+ AKEY("self_insert", rl_self_insert),
+ AKEY("bdel", rl_bdel),
+ AKEY("del", rl_del),
+ AKEY("deleol", rl_deleol),
+ AKEY("delbol", rl_delbol),
+ AKEY("enter", rl_enter),
+ AKEY("trim", rl_trim),
+ AKEY("quoted_insert", rl_quote_insert),
+ AKEY("complete", rl_complete),
+ AKEY(NULL, NULL),
+};
+
+void SLrline_close (SLrline_Type *rli)
+{
+ if (rli == NULL)
+ return;
+
+ if (rli->name != NULL)
+ {
+	char hookname1024;
+	SLrline_Type *arli = Active_Rline_Info;
+	Active_Rline_Info = rli;
+	SLsnprintf (hookname, sizeof(hookname), "%s_rline_close_hook", rli->name);
+	if (0 == SLang_run_hooks (hookname, 0))
+	 (void) SLang_run_hooks ("rline_close_hook", 1, rli->name);
+	Active_Rline_Info = arli;
+	SLang_free_slstring (rli->name);
+ }
+
+ if ((rli->update_free_update_data_hook != NULL)
+ && (rli->update_client_data != NULL))
+ (*rli->update_free_update_data_hook)(rli, rli->update_client_data);
+
+ free_last_key (rli);
+ free_history (rli->root);
+ free_history_item (rli->saved_line);
+ SLang_free_function (rli->list_completions_callback);
+ SLang_free_function (rli->completion_callback);
+ SLfree ((char *)rli->prompt);
+ SLfree ((char *)rli->buf);
+ SLfree ((char *)rli);
+}
+
+static int init_keymap (void)
+{
+ int ch;
+ char simple2;
+ SLkeymap_Type *km;
+
+ if (RL_Keymap != NULL)
+ return 0;
+
+ simple1 = 0;
+ if (NULL == (km = SLang_create_keymap ("ReadLine", NULL)))
+ return -1;
+
+ km->functions = SLReadLine_Functions;
+
+ /* This breaks under some DEC ALPHA compilers (scary!) */
+#ifndef __DECC
+ for (ch = ' '; ch < 256; ch++)
+ {
+	simple0 = (char) ch;
+	SLkm_define_key (simple, (FVOID_STAR) rl_self_insert, km);
+ }
+#else
+ ch = ' ';
+ while (1)
+ {
+	simple0 = (char) ch;
+	SLkm_define_key (simple, (FVOID_STAR) rl_self_insert, km);
+	ch = ch + 1;
+	if (ch == 256) break;
+ }
+#endif				 /* NOT __DECC */
+
+ simple0 = SLang_Abort_Char;
+ SLkm_define_key (simple, (FVOID_STAR) rl_abort, km);
+#ifdef REAL_UNIX_SYSTEM
+ simple0 = (char) 4;
+#else
+ simple0 = (char) 26;
+#endif
+ SLkm_define_key (simple, (FVOID_STAR) rl_eof_insert, km);
+
+#ifndef IBMPC_SYSTEM
+ SLkm_define_key ("^A", (FVOID_STAR) rl_prev_line, km);
+ SLkm_define_key ("^B", (FVOID_STAR) rl_next_line, km);
+ SLkm_define_key ("^C", (FVOID_STAR) rl_right, km);
+ SLkm_define_key ("^D", (FVOID_STAR) rl_left, km);
+ SLkm_define_key ("^OA", (FVOID_STAR) rl_prev_line, km);
+ SLkm_define_key ("^OB", (FVOID_STAR) rl_next_line, km);
+ SLkm_define_key ("^OC", (FVOID_STAR) rl_right, km);
+ SLkm_define_key ("^OD", (FVOID_STAR) rl_left, km);
+#else
+ SLkm_define_key ("^@H", (FVOID_STAR) rl_prev_line, km);
+ SLkm_define_key ("^@P", (FVOID_STAR) rl_next_line, km);
+ SLkm_define_key ("^@M", (FVOID_STAR) rl_right, km);
+ SLkm_define_key ("^@K", (FVOID_STAR) rl_left, km);
+ SLkm_define_key ("^@S", (FVOID_STAR) rl_del, km);
+ SLkm_define_key ("^@O", (FVOID_STAR) SLrline_eol, km);
+ SLkm_define_key ("^@G", (FVOID_STAR) SLrline_bol, km);
+
+ SLkm_define_key ("\xE0H", (FVOID_STAR) rl_prev_line, km);
+ SLkm_define_key ("\xE0P", (FVOID_STAR) rl_next_line, km);
+ SLkm_define_key ("\xE0M", (FVOID_STAR) rl_right, km);
+ SLkm_define_key ("\xE0K", (FVOID_STAR) rl_left, km);
+ SLkm_define_key ("\xE0S", (FVOID_STAR) rl_del, km);
+ SLkm_define_key ("\xE0O", (FVOID_STAR) SLrline_eol, km);
+ SLkm_define_key ("\xE0G", (FVOID_STAR) SLrline_bol, km);
+#endif
+ SLkm_define_key ("^C", (FVOID_STAR) rl_abort, km);
+ SLkm_define_key ("^E", (FVOID_STAR) SLrline_eol, km);
+ SLkm_define_key ("^G", (FVOID_STAR) rl_abort, km);
+ SLkm_define_key ("^I", (FVOID_STAR) rl_complete, km);
+ SLkm_define_key ("^A", (FVOID_STAR) SLrline_bol, km);
+ SLkm_define_key ("\r", (FVOID_STAR) rl_enter, km);
+ SLkm_define_key ("\n", (FVOID_STAR) rl_enter, km);
+ SLkm_define_key ("^K", (FVOID_STAR) rl_deleol, km);
+ SLkm_define_key ("^L", (FVOID_STAR) rl_deleol, km);
+ SLkm_define_key ("^U", (FVOID_STAR) rl_delbol, km);
+ SLkm_define_key ("^V", (FVOID_STAR) rl_del, km);
+ SLkm_define_key ("^D", (FVOID_STAR) rl_del, km);
+ SLkm_define_key ("^F", (FVOID_STAR) rl_right, km);
+ SLkm_define_key ("^B", (FVOID_STAR) rl_left, km);
+ SLkm_define_key ("^?", (FVOID_STAR) rl_bdel, km);
+ SLkm_define_key ("^H", (FVOID_STAR) rl_bdel, km);
+ SLkm_define_key ("^P", (FVOID_STAR) rl_prev_line, km);
+ SLkm_define_key ("^N", (FVOID_STAR) rl_next_line, km);
+ SLkm_define_key ("^R", (FVOID_STAR) rl_redraw, km);
+ SLkm_define_key ("`", (FVOID_STAR) rl_quote_insert, km);
+ SLkm_define_key ("\033\\", (FVOID_STAR) rl_trim, km);
+ if (_pSLang_Error)
+ return -1;
+ RL_Keymap = km;
+ return 0;
+}
+
+#if SLANG_HAS_MULTILINE_RLINE
+typedef struct
+{
+ int max_row;
+ int max_col;
+ int num_screen_cols;
+ int num_screen_rows;
+}
+RLine_SMG_Update_Type;
+
+static RLine_SMG_Update_Type *alloc_smg_update_data (void)
+{
+ return (RLine_SMG_Update_Type *)SLcalloc (1, sizeof(RLine_SMG_Update_Type));
+}
+
+static void free_smg_update_data (SLrline_Type *rli, VOID_STAR cd)
+{
+ (void) rli;
+ if (cd != NULL)
+ SLfree ((char *)cd);
+}
+
+static int check_window_size_and_redraw (SLrline_Type *rli, RLine_SMG_Update_Type *s)
+{
+ if ((s->num_screen_cols != SLtt_Screen_Cols)
+ || (s->num_screen_rows != SLtt_Screen_Rows))
+ {
+	SLsmg_reinit_smg ();
+	rli->edit_width = s->num_screen_cols = SLtt_Screen_Cols;
+	s->num_screen_rows = SLtt_Screen_Rows;
+	SLrline_redraw (rli);
+	return 1;
+ }
+ return 0;
+}
+
+static void rline_smg_update (SLrline_Type *rli, SLFUTURE_CONST char *prompt,
+			 SLFUTURE_CONST char *buf, unsigned int buflen,
+			 unsigned int point, VOID_STAR cd)
+{
+ int r0, c0, r1, c1;
+ RLine_SMG_Update_Type *s = (RLine_SMG_Update_Type *) cd;
+ (void) rli;
+
+ if (check_window_size_and_redraw (rli, s))
+ return;
+
+ if ((*buf == 0) && (*prompt == 0))
+ _pSLtt_cmdline_mode_reset ();
+
+ SLsmg_gotorc (0, 0);
+ SLsmg_write_string (prompt);
+ r0 = SLsmg_get_row ();
+ c0 = SLsmg_get_column ();
+ SLsmg_write_nchars (buf, buflen);
+ r1 = SLsmg_get_row ();
+ c1 = SLsmg_get_column ();
+ if (r1 <= s->max_row)
+ {
+	int r = r1, c = c1;
+	while (r <= s->max_row)
+	 {
+	 SLsmg_gotorc (r, c);
+	 SLsmg_erase_eol ();
+	 c = 0;
+	 r++;
+	 }
+ }
+ s->max_row = r1;
+ s->max_col = c1;
+ SLsmg_gotorc (r0, c0);
+ SLsmg_write_nchars (buf, point);
+ SLsmg_refresh ();
+}
+
+static void rline_smg_preread (SLrline_Type *rli, VOID_STAR cd)
+{
+ RLine_SMG_Update_Type *s = (RLine_SMG_Update_Type *) cd;
+
+ (void) rli;
+ _pSLtt_cmdline_mode_reset ();
+ SLsmg_gotorc (0,0);
+ SLsmg_erase_eos ();
+ s->max_row = 0;
+ s->max_col = 0;
+ SLsmg_refresh ();
+}
+
+static void rline_smg_postread (SLrline_Type *rli, VOID_STAR cd)
+{
+ RLine_SMG_Update_Type *s = (RLine_SMG_Update_Type *) cd;
+
+ (void) rli;
+ SLsmg_gotorc (s->max_row, s->max_col);
+ SLsmg_refresh ();
+}
+
+static void rline_smg_clear (SLrline_Type *rli, VOID_STAR cd)
+{
+ RLine_SMG_Update_Type *s = (RLine_SMG_Update_Type *) cd;
+
+ (void) rli;
+ SLsmg_gotorc (0,0);
+ SLsmg_cls ();
+ s->max_row = 0;
+ s->max_col = 0;
+}
+
+static void rline_smg_display_width_changed (SLrline_Type *rli, int w, VOID_STAR cd)
+{
+ RLine_SMG_Update_Type *s = (RLine_SMG_Update_Type *) cd;
+ (void) w;
+
+ SLtt_get_screen_size ();
+ (void) check_window_size_and_redraw (rli, s);
+}
+
+static int try_smg_multiline_mode (SLrline_Type *rli)
+{
+ int status;
+ RLine_SMG_Update_Type *cd;
+
+ status = _pSLtt_init_cmdline_mode ();
+ if (status <= 0)
+ return status;
+
+ if (NULL == (cd = alloc_smg_update_data ()))
+ return -1;
+
+ (void) SLrline_set_update_hook (rli, rline_smg_update, cd);
+ rli->update_free_update_data_hook = free_smg_update_data;
+ rli->update_clear_hook = rline_smg_clear;
+ rli->update_preread_hook = rline_smg_preread;
+ rli->update_postread_hook = rline_smg_postread;
+ rli->update_display_width_changed_hook = rline_smg_display_width_changed;
+
+ rli->edit_width = cd->num_screen_cols = SLtt_Screen_Cols;
+ cd->num_screen_rows = SLtt_Screen_Rows;
+
+ if (-1 == _pSLsmg_init_smg_cmdline ())
+ return -1;
+
+ return 1;
+}
+#endif				 /* SLANG_HAS_MULTILINE_RLINE */
+
+SLrline_Type *SLrline_open (unsigned int width, unsigned int flags)
+{
+ SLrline_Type *rli;
+
+ if (_pSLutf8_mode)
+ flags |= SL_RLINE_UTF8_MODE;
+
+ if (NULL == (rli = (SLrline_Type *)SLcalloc (1, sizeof (SLrline_Type))))
+ return NULL;
+
+ if (width == 0)
+ width = 80;
+
+ if (width < 256) rli->buf_len = 256;
+ else rli->buf_len = width;
+
+ if (NULL == (rli->buf = (unsigned char *)SLmalloc (rli->buf_len)))
+ {
+	SLrline_close (rli);
+	return NULL;
+ }
+ *rli->buf = 0;
+#ifdef REAL_UNIX_SYSTEM
+ rli->eof_char = 4;
+#else
+ rli->eof_char = 26;
+#endif
+
+ rli->point = 0;
+ rli->flags = flags;
+ rli->edit_width = width;
+ rli->hscroll = width/4;
+ rli->tab = 8;
+ rli->getkey = SLang_getkey;
+ rli->input_pending = SLang_input_pending;
+ rli->state = RLI_LINE_INVALID;
+
+ if (rli->flags & SL_RLINE_USE_ANSI)
+ {
+	if (rli->tt_goto_column == NULL) rli->tt_goto_column = ansi_goto_column;
+ }
+
+ if (-1 == init_keymap ())
+ {
+	SLrline_close (rli);
+	return NULL;
+ }
+ rli->keymap = RL_Keymap;
+ rli->old_upd = rli->upd_buf1;
+ rli->new_upd = rli->upd_buf2;
+
+ if (Char_Widths0 == 0)
+ {
+	int ch;
+	/* FIXME: This does not support UTF-8 */
+	for (ch = 0; ch < 32; ch++) Char_Widthsch = 2;
+	for (ch = 32; ch < 256; ch++) Char_Widthsch = 1;
+	Char_Widths127 = 2;
+#ifndef IBMPC_SYSTEM
+	for (ch = 128; ch < 160; ch++) Char_Widthsch = 3;
+#endif
+ }
+#if SLANG_HAS_MULTILINE_RLINE
+ if (flags & SL_RLINE_USE_MULTILINE)
+ {
+	if (-1 == try_smg_multiline_mode (rli))
+	 {
+	 SLrline_close (rli);
+	 return NULL;
+	 }
+ }
+#endif
+ return rli;
+}
+
+SLrline_Type *SLrline_open2 (SLFUTURE_CONST char *name, unsigned int width, unsigned int flags)
+{
+ SLrline_Type *rli;
+ SLrline_Type *arli;
+ char hookname 1024;
+
+ if (NULL == (rli = SLrline_open (width, flags)))
+ return NULL;
+
+ if (NULL != rli->name)
+ SLang_free_slstring (rli->name);
+ if (NULL == (rli->name = SLang_create_slstring (name)))
+ {
+	SLrline_close (rli);
+	return NULL;
+ }
+
+ arli = Active_Rline_Info;
+ Active_Rline_Info = rli;
+ SLsnprintf (hookname, sizeof(hookname), "%s_rline_open_hook", name);
+ if (0 == SLang_run_hooks (hookname, 0))
+ (void) SLang_run_hooks ("rline_open_hook", 1, name);
+ Active_Rline_Info = arli;
+ return rli;
+}
+
+int SLrline_add_to_history (SLrline_Type *rli, SLFUTURE_CONST char *hist)
+{
+ RL_History_Type *h;
+
+ if ((rli == NULL) || (hist == NULL))
+ return -1;
+
+ h = allocate_history (hist, -1);
+
+ if (rli->root == NULL)
+ rli->root = h;
+
+ if (rli->tail != NULL)
+ rli->tail->next = h;
+
+ h->prev = rli->tail;
+ rli->tail = h;
+ h->next = NULL;
+
+ return 0;
+}
+
+int SLrline_save_line (SLrline_Type *rli)
+{
+ if (rli == NULL)
+ return -1;
+
+ return SLrline_add_to_history (rli, (char *) rli->buf);
+}
+
+SLkeymap_Type *SLrline_get_keymap (SLrline_Type *rli)
+{
+ if (rli == NULL)
+ return NULL;
+ return rli->keymap;
+}
+
+int SLrline_set_update_hook (SLrline_Type *rli,
+			 void (*fun)(SLrline_Type *, SLFUTURE_CONST char *, SLFUTURE_CONST char *, unsigned int, unsigned int, VOID_STAR),
+			 VOID_STAR client_data)
+{
+ if (rli == NULL)
+ return -1;
+
+ rli->update_hook = fun;
+ rli->update_client_data = client_data;
+ return 0;
+}
+
+int SLrline_get_update_client_data (SLrline_Type *rli, VOID_STAR *cdp)
+{
+ if (rli == NULL)
+ return -1;
+ *cdp = rli->update_client_data;
+ return 0;
+}
+
+void SLrline_set_free_update_cb (SLrline_Type *rli,
+				 void (*fun)(SLrline_Type *, VOID_STAR))
+{
+ if (rli != NULL)
+ rli->update_free_update_data_hook = fun;
+}
+
+void SLrline_set_update_clear_cb (SLrline_Type *rli,
+				 void (*fun)(SLrline_Type *, VOID_STAR))
+{
+ if (rli != NULL)
+ rli->update_clear_hook = fun;
+}
+
+void SLrline_set_update_preread_cb (SLrline_Type *rli,
+				 void (*fun)(SLrline_Type *, VOID_STAR))
+{
+ if (rli != NULL)
+ rli->update_preread_hook = fun;
+}
+
+void SLrline_set_update_postread_cb (SLrline_Type *rli,
+				 void (*fun)(SLrline_Type *, VOID_STAR))
+{
+ if (rli != NULL)
+ rli->update_postread_hook = fun;
+}
+
+void SLrline_set_update_width_cb (SLrline_Type *rli,
+				 void (*fun)(SLrline_Type *, int, VOID_STAR))
+{
+ if (rli != NULL)
+ rli->update_display_width_changed_hook = fun;
+}
+
+
+char *SLrline_get_line (SLrline_Type *rli)
+{
+ if (rli == NULL)
+ return NULL;
+ return SLmake_nstring ((char *)rli->buf, rli->len);
+}
+
+int SLrline_get_point (SLrline_Type *rli, unsigned int *pointp)
+{
+ if (rli == NULL)
+ return -1;
+ *pointp = rli->point;
+ return 0;
+}
+
+int SLrline_set_point (SLrline_Type *rli, unsigned int point)
+{
+ if (rli == NULL)
+ return -1;
+
+ if (rli->state == RLI_LINE_INVALID)
+ return -1;
+
+ if (point > rli->len)
+ point = rli->len;
+
+ rli->point = point;
+ return 0;
+}
+
+int SLrline_get_tab (SLrline_Type *rli, unsigned int *p)
+{
+ if (rli == NULL)
+ return -1;
+ *p = rli->tab;
+ return 0;
+}
+
+int SLrline_set_tab (SLrline_Type *rli, unsigned int tab)
+{
+ if (rli == NULL)
+ return -1;
+
+ rli->tab = tab;
+ return 0;
+}
+
+int SLrline_get_hscroll (SLrline_Type *rli, unsigned int *p)
+{
+ if (rli == NULL)
+ return -1;
+ *p = rli->hscroll;
+ return 0;
+}
+
+int SLrline_set_hscroll (SLrline_Type *rli, unsigned int p)
+{
+ if (rli == NULL)
+ return -1;
+ rli->hscroll = p;
+ return 0;
+}
+
+int SLrline_set_line (SLrline_Type *rli, SLFUTURE_CONST char *buf)
+{
+ unsigned int len;
+
+ if (rli == NULL)
+ return -1;
+
+ if (buf == NULL)
+ buf = "";
+
+ len = strlen (buf);
+
+ buf = SLmake_string (buf);
+ if (buf == NULL)
+ return -1;
+
+ SLfree ((char *)rli->buf);
+ rli->buf = (unsigned char *)buf;
+ rli->buf_len = len;
+
+ rli->point = len;
+ rli->len = len;
+
+ rli->state = RLI_LINE_SET;
+ return 0;
+}
+
+int SLrline_set_echo (SLrline_Type *rli, int state)
+{
+ if (rli == NULL)
+ return -1;
+
+ if (state == 0)
+ rli->flags |= SL_RLINE_NO_ECHO;
+ else
+ rli->flags &= ~SL_RLINE_NO_ECHO;
+
+ return 0;
+}
+
+int SLrline_get_echo (SLrline_Type *rli, int *statep)
+{
+ if (rli == NULL)
+ return -1;
+
+ *statep = (0 == (rli->flags & SL_RLINE_NO_ECHO));
+ return 0;
+}
+
+int SLrline_set_display_width (SLrline_Type *rli, unsigned int w)
+{
+ unsigned int old_width;
+
+ if (rli == NULL)
+ return -1;
+ if (w < 1)
+ w = 80;
+
+ old_width = rli->edit_width;
+ rli->edit_width = w;
+
+ if (rli->update_display_width_changed_hook != NULL)
+ (*rli->update_display_width_changed_hook) (rli, w, rli->update_client_data);
+ else
+ {
+	if (w != old_width)
+	 SLrline_redraw (rli);
+ }
+ return 0;
+}
+
+/* SLang Interface */
+
+static void rline_ins_intrinsic (char *str)
+{
+ if (Active_Rline_Info != NULL)
+ (void) SLrline_ins (Active_Rline_Info, str, strlen (str));
+}
+
+static void rline_del_intrinsic (int *np)
+{
+ int n = *np;
+
+ if (Active_Rline_Info == NULL)
+ return;
+
+ if (n < 0)
+ {
+	(void) SLrline_move (Active_Rline_Info, n);
+	n = -n;
+ }
+
+ (void) SLrline_del (Active_Rline_Info, (unsigned int) n);
+}
+
+static SLkeymap_Type *get_keymap (void)
+{
+ SLkeymap_Type *kmap;
+
+ if (Active_Rline_Info != NULL)
+ kmap = SLrline_get_keymap (Active_Rline_Info);
+ else
+ kmap = RL_Keymap;
+
+ if (kmap != NULL)
+ return kmap;
+
+ _pSLang_verror (SL_APPLICATION_ERROR, "No keymap available for rline interface");
+ return NULL;
+}
+
+static void rline_setkey_intrinsic (char *keyseq)
+{
+ char *str;
+ SLkeymap_Type *kmap;
+
+ if (NULL == (kmap = get_keymap ()))
+ return;
+
+ if (SLang_peek_at_stack () == SLANG_REF_TYPE)
+ {
+	SLang_Name_Type *nt;
+
+	if (NULL == (nt = SLang_pop_function ()))
+	 return;
+
+	(void) SLkm_define_slkey (keyseq, nt, kmap);
+	return;
+ }
+
+ if (-1 == SLang_pop_slstring (&str))
+ return;
+
+ (void) SLang_define_key (keyseq, str, kmap);
+ SLang_free_slstring (str);
+}
+
+static void rline_unsetkey_intrinsic (char *keyseq)
+{
+ SLkeymap_Type *kmap;
+
+ if (NULL != (kmap = get_keymap ()))
+ SLang_undefine_key (keyseq, kmap);
+}
+
+static int rline_get_point_intrinsic (void)
+{
+ unsigned int p;
+
+ if ((Active_Rline_Info == NULL)
+ || (-1 == SLrline_get_point (Active_Rline_Info, &p)))
+ return 0;
+
+ return (int) p;
+}
+
+static void rline_set_point_intrinsic (int *pp)
+{
+ int p;
+ SLrline_Type *rli;
+
+ if (NULL == (rli = Active_Rline_Info))
+ return;
+
+ p = *pp;
+ if (p < 0)
+ {
+	p = (int)rli->len + (p + 1);
+	if (p < 0)
+	 p = 0;
+ }
+
+ if ((unsigned int)p > rli->len)
+ p = (int)rli->len;
+
+ (void) SLrline_set_point (rli, (unsigned int) p);
+}
+
+static void rline_call_intrinsic (char *fun)
+{
+ int (*f)(SLrline_Type *);
+
+ if (Active_Rline_Info == NULL)
+ return;
+
+ if (NULL == (f = (int (*)(SLrline_Type *)) (SLang_find_key_function(fun, Active_Rline_Info->keymap))))
+ {
+	_pSLang_verror (SL_UndefinedName_Error, "rline internal function %s does not exist", fun);
+	return;
+ }
+
+ (void) (*f)(Active_Rline_Info);
+ /* Active_Rline_Info->last_fun = (FVOID_STAR) f; */
+}
+
+static void rline_get_line_intrinsic (void)
+{
+ char *s;
+
+ if ((Active_Rline_Info == NULL)
+ || (NULL == (s = SLrline_get_line (Active_Rline_Info))))
+ {
+	(void) SLang_push_string ("");
+	return;
+ }
+ (void) SLang_push_malloced_string (s);
+}
+
+static void rline_set_line_intrinsic (char *str)
+{
+ if (Active_Rline_Info == NULL)
+ return;
+
+ (void) SLrline_set_line (Active_Rline_Info, str);
+}
+
+static void rline_set_completion_callback (void)
+{
+ SLang_Name_Type *nt;
+
+ if (NULL == (nt = SLang_pop_function ()))
+ return;
+
+ if (Active_Rline_Info == NULL)
+ {
+	SLang_free_function (Default_Completion_Callback);
+	Default_Completion_Callback = nt;
+	return;
+ }
+ SLang_free_function (Active_Rline_Info->completion_callback);
+ Active_Rline_Info->completion_callback = nt;
+}
+
+static void rline_set_list_completions_callback (void)
+{
+ SLang_Name_Type *nt;
+
+ if (NULL == (nt = SLang_pop_function ()))
+ return;
+
+ if (Active_Rline_Info == NULL)
+ {
+	SLang_free_function (Default_List_Completions_Callback);
+	Default_List_Completions_Callback = nt;
+	return;
+ }
+ SLang_free_function (Active_Rline_Info->list_completions_callback);
+ Active_Rline_Info->list_completions_callback = nt;
+}
+
+static int rline_input_pending_intrinsic (int *tsecsp)
+{
+ int tsecs = *tsecsp;
+ if (tsecs < 0)
+ tsecs = 0;
+
+ if (Active_Rline_Info == NULL)
+ return 0;
+
+ if (Active_Rline_Info->input_pending == NULL)
+ return 1;
+
+ return Active_Rline_Info->input_pending (tsecs);
+}
+
+static int rline_getkey_intrinsic (void)
+{
+ if (Active_Rline_Info == NULL)
+ return -1;
+
+ return (int) Active_Rline_Info->getkey ();
+}
+
+static int rline_bolp_intrinsic (void)
+{
+ if (Active_Rline_Info == NULL)
+ return 0;
+ return Active_Rline_Info->point == 0;
+}
+
+static int rline_eolp_intrinsic (void)
+{
+ if (Active_Rline_Info == NULL)
+ return 0;
+ return Active_Rline_Info->point == Active_Rline_Info->len;
+}
+
+static int rline_get_edit_width_intrinsic (void)
+{
+ if (Active_Rline_Info == NULL)
+ return 80;
+ return Active_Rline_Info->edit_width;
+}
+
+static void rline_get_history_intrinsic (void)
+{
+ SLindex_Type i, num;
+ RL_History_Type *h;
+ char **data;
+ SLang_Array_Type *at;
+
+ if (Active_Rline_Info == NULL)
+ {
+	SLang_push_null ();
+	return;
+ }
+
+ num = 0;
+ h = Active_Rline_Info->root;
+ while (h != NULL)
+ {
+	h = h->next;
+	num++;
+ }
+ if (NULL == (at = SLang_create_array (SLANG_STRING_TYPE, 0, NULL, &num, 1)))
+ return;
+
+ data = (char **)at->data;
+ h = Active_Rline_Info->root;
+ for (i = 0; i < num; i++)
+ {
+	if (NULL == (datai = SLang_create_slstring (h->buf)))
+	 {
+	 SLang_free_array (at);
+	 return;
+	 }
+	h = h->next;
+ }
+
+ (void) SLang_push_array (at, 1);
+}
+
+static void rline_set_history_intrinsic (void)
+{
+ int i, num;
+ char **data;
+ SLrline_Type *rli;
+ SLang_Array_Type *at;
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_STRING_TYPE))
+ return;
+
+ if (NULL == (rli = Active_Rline_Info))
+ {
+	SLang_free_array (at);
+	return;
+ }
+
+ free_history (rli->root);
+ rli->tail = rli->root = rli->last = NULL;
+
+ data = (char **)at->data;
+ num = at->num_elements;
+ for (i = 0; i < num; i++)
+ {
+	if (-1 == SLrline_add_to_history (rli, datai))
+	 break;
+ }
+ SLang_free_array (at);
+}
+
+static char *find_function_string (SLrline_Type *rli, FVOID_STAR f)
+{
+ SLKeymap_Function_Type *fp;
+
+ if ((rli == NULL) || (rli->keymap == NULL))
+ return NULL;
+
+ fp = rli->keymap->functions;
+ while ((fp != NULL) && (fp->name != NULL))
+ {
+	if ((FVOID_STAR) fp->f == f) return (char *) fp->name;
+	fp++;
+ }
+ return NULL;
+}
+
+static void rline_get_last_key_function_intrinsic (void)
+{
+ SLang_Key_Type *last_key;
+ char *s;
+
+ if (Active_Rline_Info == NULL)
+ {
+	(void) SLang_push_null ();
+	return;
+ }
+
+ last_key = &Active_Rline_Info->last_key;
+ switch (last_key->type)
+ {
+ case SLKEY_F_INTERPRET:
+	if (last_key->f.s != NULL)
+	 {
+	 (void) SLang_push_string (last_key->f.s);
+	 return;
+	 }
+	break;
+
+ case SLKEY_F_INTRINSIC:
+	if (NULL != (s = find_function_string (Active_Rline_Info, last_key->f.f)))
+	 {
+	 (void) SLang_push_string (s);
+	 return;
+	 }
+	break;
+
+ case SLKEY_F_SLANG:
+	if (NULL != last_key->f.slang_fun)
+	 {
+	 (void) SLang_push_function (last_key->f.slang_fun);
+	 return;
+	 }
+ case SLKEY_F_KEYSYM:
+	(void) SLang_push_uint (last_key->f.keysym);
+	return;
+
+ default:
+	break;
+ }
+
+ (void) SLang_push_null ();
+}
+
+static SLang_Intrin_Fun_Type Intrinsics =
+{
+ MAKE_INTRINSIC_S("rline_call", rline_call_intrinsic, VOID_TYPE),
+ MAKE_INTRINSIC_S("rline_ins", rline_ins_intrinsic, VOID_TYPE),
+ MAKE_INTRINSIC_I("rline_del", rline_del_intrinsic, VOID_TYPE),
+ MAKE_INTRINSIC_0("rline_bolp", rline_bolp_intrinsic, INT_TYPE),
+ MAKE_INTRINSIC_0("rline_eolp", rline_eolp_intrinsic, INT_TYPE),
+ MAKE_INTRINSIC_0("rline_get_point", rline_get_point_intrinsic, INT_TYPE),
+ MAKE_INTRINSIC_I("rline_set_point", rline_set_point_intrinsic, VOID_TYPE),
+ MAKE_INTRINSIC_0("rline_get_edit_width", rline_get_edit_width_intrinsic, INT_TYPE),
+ MAKE_INTRINSIC_0("rline_get_line", rline_get_line_intrinsic, VOID_TYPE),
+ MAKE_INTRINSIC_S("rline_set_line", rline_set_line_intrinsic, VOID_TYPE),
+ MAKE_INTRINSIC_S("rline_setkey", rline_setkey_intrinsic, VOID_TYPE),
+ MAKE_INTRINSIC_S("rline_unsetkey", rline_unsetkey_intrinsic, VOID_TYPE),
+ MAKE_INTRINSIC_0("rline_getkey", rline_getkey_intrinsic, INT_TYPE),
+ MAKE_INTRINSIC_0("rline_set_history", rline_set_history_intrinsic, VOID_TYPE),
+ MAKE_INTRINSIC_0("rline_get_history", rline_get_history_intrinsic, VOID_TYPE),
+ MAKE_INTRINSIC_I("rline_input_pending", rline_input_pending_intrinsic, INT_TYPE),
+ MAKE_INTRINSIC_0("rline_set_completion_callback", rline_set_completion_callback, VOID_TYPE),
+ MAKE_INTRINSIC_0("rline_set_list_completions_callback", rline_set_list_completions_callback, VOID_TYPE),
+ MAKE_INTRINSIC_0("rline_get_last_key_function", rline_get_last_key_function_intrinsic, VOID_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+int SLrline_init (SLFUTURE_CONST char *appname, SLFUTURE_CONST char *user_initfile, SLFUTURE_CONST char *sys_initfile)
+{
+#ifdef __WIN32__
+ char *home_dir = getenv ("USERPROFILE");
+#else
+# ifdef VMS
+ char *home_dir = "SYS$LOGIN:";
+# else
+ char *home_dir = getenv ("HOME");
+# endif
+#endif
+ char *file = NULL;
+ int status;
+ static char *appname_malloced;
+
+ if (sys_initfile == NULL)
+ sys_initfile = SLRLINE_SYS_INIT_FILE;
+ if (user_initfile == NULL)
+ user_initfile = SLRLINE_USER_INIT_FILE;
+
+ if (appname == NULL)
+ appname = "Unknown";
+
+ if (NULL == (appname_malloced = SLmake_string (appname)))
+ return -1;
+
+ if (-1 == SLadd_intrinsic_variable ("__RL_APP__", &appname_malloced, SLANG_STRING_TYPE, 1))
+ return -1;
+
+ if (-1 == SLadd_intrin_fun_table (Intrinsics, NULL))
+ return -1;
+
+ if (-1 == init_keymap ())
+ return -1;
+#if SLANG_HAS_MULTILINE_RLINE
+ /* Initialize the terminal here to allow the user to use termcap sequences */
+ (void) SLtt_initialize (NULL);
+#endif
+ if (user_initfile != NULL)
+ {
+	file = SLpath_find_file_in_path (home_dir, user_initfile);
+	if (file != NULL)
+	 {
+	 status = SLns_load_file (file, NULL);
+	 SLfree (file);
+	 return status;
+	 }
+ }
+
+ if (sys_initfile != NULL)
+ {
+	file = _pSLpath_find_file (sys_initfile, 0);
+	if (file != NULL)
+	 {
+	 status = SLns_load_file (file, NULL);
+	 SLang_free_slstring (file);
+	 return status;
+	 }
+ }
+
+ return 0;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slscanf.c Added

@@ -0,0 +1,868 @@
+/* sscanf function for S-Lang */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#ifndef _GNU_SOURCE
+# define _GNU_SOURCE
+#endif
+#ifndef __EXTENSIONS__
+# define __EXTENSIONS__
+#endif
+
+#include "slinclud.h"
+#include <ctype.h>
+#include <math.h>
+#include <errno.h>
+
+#ifdef HAVE_LOCALE_H
+# include <locale.h>
+#endif
+
+#ifdef HAVE_XLOCALE_H
+# include <xlocale.h>
+#endif
+
+#include "slang.h"
+#include "_slang.h"
+
+static void init_map (unsigned char map256, int base)
+{
+ memset ((char *) map, 0xFF, 256);
+
+ map'0' = 0; map'1' = 1; map'2' = 2; map'3' = 3;
+ map'4' = 4; map'5' = 5; map'6' = 6; map'7' = 7;
+ if (base == 8)
+ return;
+
+ map'8' = 8; map'9' = 9;
+ if (base == 10)
+ return;
+
+ map'A' = 10; map'B' = 11; map'C' = 12; map'D' = 13;
+ map'E' = 14; map'F' = 15; map'a' = 10; map'b' = 11;
+ map'c' = 12; map'd' = 13; map'e' = 14; map'f' = 15;
+}
+
+static SLFUTURE_CONST char *get_sign (SLFUTURE_CONST char *s, SLFUTURE_CONST char *smax, int *sign)
+{
+ *sign = 1;
+ if (s + 1 < smax)
+ {
+	if (*s == '+') s++;
+	else if (*s == '-')
+	 {
+	 s++;
+	 *sign = -1;
+	 }
+ }
+ return s;
+}
+
+static int parse_long (SLFUTURE_CONST char **sp, SLFUTURE_CONST char *smax, long *np,
+		 long base, unsigned char map256)
+{
+ SLFUTURE_CONST char *s, *s0;
+ long n;
+ int sign;
+
+ s = s0 = get_sign (*sp, smax, &sign);
+
+ n = 0;
+ while (s < smax)
+ {
+	unsigned char value;
+
+	value = map (unsigned char) *s;
+	if (value == 0xFF)
+	 break;
+
+	n = base * n + value;
+	s++;
+ }
+
+ *sp = s;
+ if (s == s0)
+ return 0;
+
+ *np = n * sign;
+
+ return 1;
+}
+
+static int parse_int (SLFUTURE_CONST char **sp, SLFUTURE_CONST char *smax, int *np,
+		 long base, unsigned char map256)
+{
+ long n;
+ int status;
+
+ if (1 == (status = parse_long (sp, smax, &n, base, map)))
+ *np = (int) n;
+ return status;
+}
+
+static int parse_short (SLFUTURE_CONST char **sp, SLFUTURE_CONST char *smax, short *np,
+			long base, unsigned char map256)
+{
+ long n;
+ int status;
+
+ if (1 == (status = parse_long (sp, smax, &n, base, map)))
+ *np = (short) n;
+ return status;
+}
+
+static int parse_ulong (SLFUTURE_CONST char **sp, SLFUTURE_CONST char *smax, unsigned long *np,
+			long base, unsigned char map256)
+{
+ return parse_long (sp, smax, (long *) np, base, map);
+}
+
+static int parse_uint (SLFUTURE_CONST char **sp, SLFUTURE_CONST char *smax, unsigned int *np,
+		 long base, unsigned char map256)
+{
+ return parse_int (sp, smax, (int *) np, base, map);
+}
+
+static int parse_ushort (SLFUTURE_CONST char **sp, SLFUTURE_CONST char *smax, unsigned short *np,
+			 long base, unsigned char map256)
+{
+ return parse_short (sp, smax, (short *) np, base, map);
+}
+
+#if SLANG_HAS_FLOAT
+/* See <pubs.opengroup.org> for information about locale_t, newlocale, etc.
+ * The usage below is based on the opengroup manpages.
+ */
+# if defined(HAVE_STRTOD_L) && defined(HAVE_NEWLOCALE) && defined(LC_ALL_MASK)
+# define USE_STRTOD_L 1
+# else
+# define USE_STRTOD_L 0
+# endif
+
+# if USE_STRTOD_L
+static locale_t C_Locale = (locale_t) 0;
+# endif
+static int do_strtod (char *buf, int sign, double *xp)
+{
+# if USE_STRTOD_L
+ if (C_Locale != (locale_t) 0)
+ {
+	*xp = sign * strtod_l (buf, NULL, C_Locale);
+	return 1;
+ }
+
+ C_Locale = newlocale (LC_ALL_MASK, "C", (locale_t) 0);
+ if (C_Locale != (locale_t) 0)
+ {
+	*xp = sign * strtod_l (buf, NULL, C_Locale);
+	return 1;
+ }
+ /* drop */
+# endif
+
+# ifdef HAVE_STRTOD
+ *xp = sign * strtod (buf, NULL);
+# else
+ *xp = sign * atof (buf);
+# endif
+ return 1;
+}
+
+/*
+ * In an ideal world, strtod would be the correct function to use. However,
+ * there may be problems relying on this function because some systems do
+ * not support and some that do get it wrong. So, I will handle the parsing
+ * of the string and let atof or strtod handle the arithmetic.
+ */
+static int parse_double (SLFUTURE_CONST char **sp, SLFUTURE_CONST char *smax, double *d)
+{
+ SLFUTURE_CONST char *s, *s0;
+ int sign;
+ int expon;
+ unsigned char map256;
+ char buf128;
+ int has_leading_zeros;
+ SLFUTURE_CONST char *start_pos, *sign_pos;
+ char *b, *bmax;
+ char ch;
+ const char *decimal_point = ".";
+ char *b_after_decimal_position;
+# if !USE_STRTOD_L && defined(HAVE_LOCALECONV)
+ struct lconv *locale_data;
+
+ if (NULL != (locale_data = localeconv()))
+ {
+	decimal_point = locale_data->decimal_point;
+	if (*decimal_point == 0) decimal_point = ".";
+ }
+# endif
+
+ start_pos = *sp;
+ s = get_sign (start_pos, smax, &sign);
+ if (s >= smax)
+ {
+	errno = _pSLerrno_errno = EINVAL;
+	return 0;
+ }
+
+ ch = *s|0x20;
+ if ((ch == 'n') || (ch == 'i'))
+ {
+	if (s + 3 <= smax)
+	 {
+	 if (ch == 'n')
+	 {
+		 if (((s1|0x20) == 'a') && ((s2|0x20) == 'n'))
+		 {
+		 s += 3;
+		 s0 = s;
+		 /* Now parse the nan(chars) form. Here we allow
+			* (a-zA-Z_0-9*)
+			*/
+		 if ((s < smax) && (*s == '('))
+			 {
+			 s++;
+			 while (s < smax)
+			 {
+				 ch = *s++;
+				 if (isdigit ((unsigned char)ch)
+				 || ((ch >= 'a') && (ch <= 'z'))
+				 || ((ch >= 'A') && (ch <= 'Z'))
+				 || (ch == '_'))
+				 continue;
+
+				 if (ch == ')')
+				 s0 = s;
+
+				 break;
+			 }
+			 }
+		 *sp = s0;
+		 *d = _pSLang_NaN;
+		 return 1;
+		 }
+		 *sp = start_pos;
+		 errno = _pSLerrno_errno = EINVAL;
+		 return 0;
+	 }
+	 if (((s1 | 0x20) == 'n') && ((s2 | 0x20) == 'f'))
+	 {
+		 /* check for infinity */
+		 if ((s + 8 <= smax)
+		 && (((s3|0x20)=='i')&&((s4|0x20)=='n')&&((s5|0x20)=='i')
+		 && ((s6|0x20)=='t')&&((s7|0x20)=='y')))
+		 *sp = s + 8;
+		 else
+		 *sp = s + 3;
+		 *d = _pSLang_Inf * sign;
+		 return 1;
+	 }
+	 }
+	*sp = start_pos;
+	errno = _pSLerrno_errno = EINVAL;
+	return 0;
+ }
+
+ /* Prepare the buffer that will be passed to strtod */
+ /* Allow the exponent to be 5 significant digits: E+xxxxx\0 */
+ bmax = buf + (sizeof (buf) - 8);
+ b = buf;
+ *b++ = '0';
+ do
+ {
+	*b++ = *decimal_point++;
+ }
+ while ((*decimal_point != 0) && (b < bmax));
+ b_after_decimal_position = b;
+
+ init_map (map, 10);
+
+ /* Skip leading 0s */
+ s0 = s;
+ while ((s < smax) && (*s == '0'))
+ s++;
+ has_leading_zeros = (s != s0);
+
+ expon = 0;
+ while (s < smax)
+ {
+	unsigned char value = map (unsigned char) *s;
+
+	if (value == 0xFF)
+	 break;
+
+	if (b < bmax)
+	 *b++ = *s;
+
+	expon++;
+	s++;
+ }
+
+ if ((s < smax) && (*s == '.'))
+ {
+	s++;
+	if (b == b_after_decimal_position)	 /* nothing added yet */
+	 {
+	 while ((s < smax) && (*s == '0'))
+	 {
+		 expon--;
+		 s++;
+	 }
+	 }
+
+	while (s < smax)
+	 {
+	 unsigned char value = map (unsigned char) *s;
+
+	 if (value == 0xFF)
+	 break;
+
+	 if (b < bmax)
+	 *b++ = *s;
+	 s++;
+	 }
+ }
+
+ if ((b == b_after_decimal_position)
+ && (has_leading_zeros == 0)
+ && (expon == 0))		 /* .0 ==> expon=-1 */
+ {
+	*sp = start_pos;
+	errno = EINVAL;
+	return 0;
+ }
+
+ if ((s + 1 < smax) && ((*s == 'E') || (*s == 'e')))
+ {
+	int e;
+	int esign;
+
+	s0 = s;
+	s = get_sign (s + 1, smax, &esign);
+	sign_pos = s;
+	e = 0;
+	while (s < smax)
+	 {
+	 unsigned char value = map (unsigned char) *s;
+	 if (value == 0xFF)
+	 break;
+	 if (e < 25000)	 /* avoid overflow if 16 bit */
+	 e = 10 * e + value;
+	 s++;
+	 }
+#ifdef ERANGE
+	if (e >= 25000)
+	 errno = ERANGE;
+#endif
+	if (s == sign_pos)
+	 s = s0;		 /* ...E-X */
+	else
+	 {
+	 e = esign * e;
+	 expon += e;
+	 }
+ }
+
+ if (expon != 0)
+ sprintf (b, "e%d", expon);
+ else
+ *b = 0;
+
+ *sp = s;
+
+ return do_strtod (buf, sign, d);
+}
+
+static int parse_float (SLFUTURE_CONST char **sp, SLFUTURE_CONST char *smax, float *d)
+{
+ double x;
+ if (1 == parse_double (sp, smax, &x))
+ {
+	*d = (float) x;
+	return 1;
+ }
+ return 0;
+}
+#endif				 /* SLANG_HAS_FLOAT */
+
+static int parse_string (SLFUTURE_CONST char **sp, SLFUTURE_CONST char *smax, char **str)
+{
+ SLFUTURE_CONST char *s, *s0;
+
+ s0 = s = *sp;
+ while (s < smax)
+ {
+	if (isspace ((unsigned char)*s))
+	 break;
+	s++;
+ }
+ if (NULL == (*str = SLang_create_nslstring (s0, (unsigned int) (s - s0))))
+ return -1;
+
+ *sp = s;
+ return 1;
+}
+
+static int parse_bstring (SLFUTURE_CONST char **sp, SLFUTURE_CONST char *smax, char **str)
+{
+ SLFUTURE_CONST char *s;
+
+ s = *sp;
+ if (NULL == (*str = SLang_create_nslstring (s, (unsigned int) (smax - s))))
+ return -1;
+
+ *sp = smax;
+ return 1;
+}
+
+static int parse_range (SLFUTURE_CONST char **sp, SLFUTURE_CONST char *smax, SLFUTURE_CONST char **fp, char **str)
+{
+ SLFUTURE_CONST char *s, *s0;
+ char *range;
+ SLFUTURE_CONST char *f;
+ unsigned char map256;
+ unsigned char reverse;
+
+ /* How can one represent a range with just '^'? The naive answer is
+ * is ^. However, this may be interpreted as meaning any character
+ * but '' and others. Let's assume that the user will not use a range
+ * to match '^'.
+ */
+ f = *fp;
+ /* f is a pointer to (one char after) .... */
+ if (*f == '^')
+ {
+	f++;
+	reverse = 1;
+ }
+ else reverse = 0;
+
+ s0 = f;
+ if (*f == '')
+ f++;
+
+ while (1)
+ {
+	char ch = *f;
+
+	if (ch == 0)
+	 {
+	 _pSLang_verror (SL_INVALID_PARM, "Unexpected end of range in format");
+	 return -1;
+	 }
+	if (ch == '')
+	 break;
+	f++;
+ }
+ if (NULL == (range = SLmake_nstring (s0, (unsigned int) (f - s0))))
+ return -1;
+ *fp = f + 1;			 /* skip */
+
+ SLmake_lut (map, (unsigned char *) range, reverse);
+ SLfree (range);
+
+ s0 = s = *sp;
+ while ((s < smax) && map (unsigned char) *s)
+ s++;
+
+ if (NULL == (*str = SLang_create_nslstring (s0, (unsigned int) (s - s0))))
+ return -1;
+
+ *sp = s;
+ return 1;
+}
+
+/* FIXME: This function does not handle LONG_LONG */
+int _pSLang_sscanf (void)
+{
+ int num;
+ unsigned int num_refs;
+ char *format;
+ char *input_string, *input_string_max;
+ SLFUTURE_CONST char *f, *s;
+ unsigned char map8256, map10256, map16256;
+
+ if (SLang_Num_Function_Args < 2)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Int_Type sscanf (str, format, ...)");
+	return -1;
+ }
+
+ num_refs = (unsigned int) SLang_Num_Function_Args;
+ if (-1 == SLreverse_stack (num_refs))
+ return -1;
+ num_refs -= 2;
+
+ if (-1 == SLang_pop_slstring (&input_string))
+ return -1;
+
+ if (-1 == SLang_pop_slstring (&format))
+ {
+	SLang_free_slstring (input_string);
+	return -1;
+ }
+
+ f = format;
+ s = input_string;
+ input_string_max = input_string + strlen (input_string);
+
+ init_map (map8, 8);
+ init_map (map10, 10);
+ init_map (map16, 16);
+
+ num = 0;
+
+ while (num_refs != 0)
+ {
+	SLang_Object_Type obj;
+	SLang_Ref_Type *ref;
+	SLFUTURE_CONST char *smax;
+	unsigned char *map;
+	int base;
+	int no_assign;
+	int is_short;
+	int is_long;
+	int force_signed;
+	int status;
+	char chf;
+	unsigned int width;
+	int has_width;
+
+	chf = *f++;
+
+	if (chf == 0)
+	 {
+	 /* Hmmm.... what is the most useful thing to do?? */
+#if 1
+	 break;
+#else
+	 _pSLang_verror (SL_INVALID_PARM, "sscanf: format not big enough for output list");
+	 goto return_error;
+#endif
+	 }
+
+	if (isspace ((unsigned char)chf))
+	 {
+	 char *s1 = _pSLskip_whitespace (s);
+
+	 /* Next line commented out since the sscanf man page allows
+	 * whitespace to match 0 or more whitespace chars.
+	 */
+	 /* if (s1 == s) break; */
+	 s = s1;
+	 continue;
+	 }
+
+	if ((chf != '%')
+	 || ((chf = *f++) == '%'))
+	 {
+	 if (*s != chf)
+	 break;
+	 s++;
+	 continue;
+	 }
+
+	no_assign = 0;
+	is_short = 0;
+	is_long = 0;
+	width = 0;
+	smax = input_string_max;
+
+	/* Look for the flag character */
+	if (chf == '*')
+	 {
+	 no_assign = 1;
+	 chf = *f++;
+	 }
+
+	/* Width */
+	has_width = isdigit ((unsigned char)chf);
+	if (has_width)
+	 {
+	 f--;
+	 (void) parse_uint (&f, f + strlen(f), &width, 10, map10);
+	 chf = *f++;
+	 }
+
+	/* Now the type modifier */
+	switch (chf)
+	 {
+	 case 'h':
+	 is_short = 1;
+	 chf = *f++;
+	 break;
+
+	 case 'L':		 /* not implemented */
+	 case 'l':
+	 is_long = 1;
+	 chf = *f++;
+	 break;
+	 }
+
+	status = -1;
+
+	if ((chf != 'c') && (chf != ''))
+	 {
+	 s = _pSLskip_whitespace (s);
+	 if (*s == 0)
+	 break;
+	 }
+
+	if (has_width)
+	 {
+	 if (width > (unsigned int) (input_string_max - s))
+	 width = (unsigned int) (input_string_max - s);
+	 smax = s + width;
+	 }
+
+	/* Now the format descriptor */
+
+	map = map10;
+	base = 10;
+	force_signed = 0;
+try_again:		 /* used by i, x, and o, conversions */
+	switch (chf)
+	 {
+	 case 0:
+	 _pSLang_verror (SL_INVALID_PARM, "sscanf: Unexpected end of format");
+	 goto return_error;
+	 case 'D':
+	 is_long = 1;
+	 case 'd':
+	 if (is_short)
+	 {
+		 obj.o_data_type = SLANG_SHORT_TYPE;
+		 status = parse_short (&s, smax, &obj.v.short_val, base, map);
+	 }
+	 else if (is_long)
+	 {
+		 obj.o_data_type = SLANG_LONG_TYPE;
+		 status = parse_long (&s, smax, &obj.v.long_val, base, map);
+	 }
+	 else
+	 {
+		 obj.o_data_type = SLANG_INT_TYPE;
+		 status = parse_int (&s, smax, &obj.v.int_val, base, map);
+	 }
+	 break;
+
+	 case 'U':
+	 is_long = 1;
+	 case 'u':
+	 if (is_short)
+	 {
+		 obj.o_data_type = SLANG_USHORT_TYPE;
+		 status = parse_ushort (&s, smax, &obj.v.ushort_val, base, map);
+	 }
+	 else if (is_long)
+	 {
+		 obj.o_data_type = SLANG_ULONG_TYPE;
+		 status = parse_ulong (&s, smax, &obj.v.ulong_val, base, map);
+	 }
+	 else
+	 {
+		 obj.o_data_type = SLANG_UINT_TYPE;
+		 status = parse_uint (&s, smax, &obj.v.uint_val, base, map);
+	 }
+	 break;
+
+	 case 'I':
+	 is_long = 1;
+	 /* drop */
+	 case 'i':
+	 if ((s + 1 >= smax)
+		 || (*s != '0'))
+	 chf = 'd';
+	 else if (((s1 == 'x') || (s1 == 'X'))
+		 && (s + 2 < smax))
+	 {
+		 s += 2;
+		 chf = 'x';
+	 }
+	 else chf = 'o';
+	 force_signed = 1;
+	 goto try_again;
+
+	 case 'O':
+	 is_long = 1;
+	 /* drop */
+	 case 'o':
+	 map = map8;
+	 base = 8;
+	 if (force_signed)
+	 chf = 'd';
+	 else
+	 chf = 'u';
+	 goto try_again;
+
+	 case 'X':
+	 is_long = 1;
+	 /* drop */
+	 case 'x':
+	 base = 16;
+	 map = map16;
+	 if (force_signed)
+	 chf = 'd';
+	 else
+	 chf = 'u';
+	 goto try_again;
+
+	 case 'E':
+	 case 'F':
+	 is_long = 1;
+	 /* drop */
+	 case 'e':
+	 case 'f':
+	 case 'g':
+#if SLANG_HAS_FLOAT
+	 if (is_long)
+	 {
+		 obj.o_data_type = SLANG_DOUBLE_TYPE;
+		 status = parse_double (&s, smax, &obj.v.double_val);
+	 }
+	 else
+	 {
+		 obj.o_data_type = SLANG_FLOAT_TYPE;
+		 status = parse_float (&s, smax, &obj.v.float_val);
+	 }
+#else
+	 _pSLang_verror (SL_NOT_IMPLEMENTED,
+			 "This version of the S-Lang does not support floating point");
+	 status = -1;
+#endif
+	 break;
+
+	 case 's':
+	 obj.o_data_type = SLANG_STRING_TYPE;
+	 status = parse_string (&s, smax, &obj.v.s_val);
+	 break;
+
+	 case 'c':
+	 if (has_width == 0)
+	 {
+		 obj.o_data_type = SLANG_UCHAR_TYPE;
+		 obj.v.uchar_val = *s++;
+		 status = 1;
+		 break;
+	 }
+	 obj.o_data_type = SLANG_STRING_TYPE;
+	 status = parse_bstring (&s, smax, &obj.v.s_val);
+	 break;
+
+	 case '':
+	 obj.o_data_type = SLANG_STRING_TYPE;
+	 status = parse_range (&s, smax, &f, &obj.v.s_val);
+	 break;
+
+	 case 'n':
+	 obj.o_data_type = SLANG_UINT_TYPE;
+	 obj.v.uint_val = (unsigned int) (s - input_string);
+	 status = 1;
+	 break;
+
+	 default:
+	 status = -1;
+	 _pSLang_verror (SL_NOT_IMPLEMENTED, "format specifier '%c' is not supported", chf);
+	 break;
+	 }
+
+	if (status == 0)
+	 break;
+
+	if (status == -1)
+	 goto return_error;
+
+	if (no_assign)
+	 {
+	 SLang_free_object (&obj);
+	 continue;
+	 }
+
+	if (-1 == SLang_pop_ref (&ref))
+	 {
+	 SLang_free_object (&obj);
+	 goto return_error;
+	 }
+
+	if (-1 == SLang_push (&obj))
+	 {
+	 SLang_free_object (&obj);
+	 SLang_free_ref (ref);
+	 goto return_error;
+	 }
+
+	if (-1 == _pSLang_deref_assign (ref))
+	 {
+	 SLang_free_ref (ref);
+	 goto return_error;
+	 }
+	SLang_free_ref (ref);
+
+	num++;
+	num_refs--;
+ }
+
+ if (-1 == SLdo_pop_n (num_refs))
+ goto return_error;
+
+ SLang_free_slstring (format);
+ SLang_free_slstring (input_string);
+ return num;
+
+ return_error:
+ /* NULLS ok */
+ SLang_free_slstring (format);
+ SLang_free_slstring (input_string);
+ return -1;
+}
+
+# if SLANG_HAS_FLOAT
+
+#ifndef HAVE_STDLIB_H
+/* Oh dear. Where is the prototype for atof? If not in stdlib, then
+ * I do not know where. Not in math.h on some systems either.
+ */
+extern double atof ();
+#endif
+
+double _pSLang_atof (SLFUTURE_CONST char *s)
+{
+ double x;
+
+ s = _pSLskip_whitespace (s);
+ errno = 0;
+
+ if (1 != parse_double (&s, s + strlen (s), &x))
+ {
+	if ((0 == strcmp ("NaN", s))
+	 || (0 == strcmp ("-Inf", s))
+	 || (0 == strcmp ("Inf", s)))
+	 return atof (s);	 /* let this deal with it */
+#ifdef EINVAL
+	errno = _pSLerrno_errno = EINVAL;
+#endif
+	return 0.0;
+ }
+ if (errno)
+ _pSLerrno_errno = errno;
+ return x;
+}
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/slscroll.c Added

@@ -0,0 +1,462 @@
+/* SLang Scrolling Window Routines */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+static void find_window_bottom (SLscroll_Window_Type *win)
+{
+ unsigned int nrows;
+ unsigned int hidden_mask;
+ SLscroll_Type *bot, *cline, *last_bot;
+ unsigned int row;
+
+ nrows = win->nrows;
+ hidden_mask = win->hidden_mask;
+ cline = win->current_line;
+
+ win->window_row = row = 0;
+ last_bot = bot = win->top_window_line;
+
+ while (row < nrows)
+ {
+	if (bot == cline)
+	 win->window_row = row;
+
+	last_bot = bot;
+
+	if (bot == NULL)
+	 break;
+
+	bot = bot->next;
+
+	if (hidden_mask)
+	 {
+	 while ((bot != NULL) && (bot->flags & hidden_mask))
+	 bot = bot->next;
+	 }
+
+	row++;
+ }
+
+ win->bot_window_line = last_bot;
+}
+
+static int find_top_to_recenter (SLscroll_Window_Type *win)
+{
+ unsigned int nrows;
+ unsigned int hidden_mask;
+ SLscroll_Type *prev, *last_prev, *cline;
+
+ nrows = win->nrows;
+ cline = win->current_line;
+ hidden_mask = win->hidden_mask;
+
+ nrows = nrows / 2;
+
+ last_prev = prev = cline;
+
+ while (nrows && (prev != NULL))
+ {
+	nrows--;
+	last_prev = prev;
+	do
+	 {
+	 prev = prev->prev;
+	 }
+	while (hidden_mask
+	 && (prev != NULL)
+	 && (prev->flags & hidden_mask));
+ }
+
+ if (prev == NULL) prev = last_prev;
+
+ win->top_window_line = prev;
+ find_window_bottom (win);
+
+ return 0;
+}
+
+#define HAS_BORDER_CODE 1
+int SLscroll_find_top (SLscroll_Window_Type *win)
+{
+ unsigned int i;
+ SLscroll_Type *cline, *prev, *next;
+ SLscroll_Type *top_window_line;
+ unsigned int nrows;
+ unsigned int hidden_mask;
+ int scroll_mode;
+ unsigned int border;
+
+ cline = win->current_line;
+ nrows = win->nrows;
+ scroll_mode = win->cannot_scroll;
+ border = win->border;
+ if (scroll_mode == 2)
+ border = 0;
+
+ if ((cline == NULL) || (nrows <= 1))
+ {
+	win->top_window_line = cline;
+	find_window_bottom (win);
+	return 0;
+ }
+
+ hidden_mask = win->hidden_mask;
+
+ /* Note: top_window_line might be a bogus pointer. This means that I cannot
+ * access it unless it really corresponds to a pointer in the buffer.
+ */
+ top_window_line = win->top_window_line;
+
+ if (top_window_line == NULL)
+ return find_top_to_recenter (win);
+
+ /* Chances are that the current line is visible in the window. This means
+ * that the top window line should be above it.
+ */
+ prev = cline;
+
+ i = 0;
+
+ while ((i < nrows) && (prev != NULL))
+ {
+	if (prev == top_window_line)
+	 {
+	 SLscroll_Type *twl = top_window_line;
+	 int dir = 0;
+
+	 if (i < border) dir = -1; else if (i + border >= nrows) dir = 1;
+
+	 if (dir) while (border)
+	 {
+		 if (dir < 0) twl = twl->prev;
+		 else twl = twl->next;
+
+		 if (twl == NULL)
+		 {
+		 twl = top_window_line;
+		 break;
+		 }
+		 if ((hidden_mask == 0)
+		 || (0 == (twl->flags & hidden_mask)))
+		 border--;
+	 }
+
+	 win->top_window_line = twl;
+	 find_window_bottom (win);
+	 return 0;
+	 }
+
+	do
+	 {
+	 prev = prev->prev;
+	 }
+	while (hidden_mask
+	 && (prev != NULL)
+	 && (prev->flags & hidden_mask));
+	i++;
+ }
+
+ /* Now check the borders of the window. Perhaps the current line lies
+ * outsider the border by a line. Only do this if terminal can scroll.
+ */
+
+ if (scroll_mode == 1)
+ return find_top_to_recenter (win);
+ else if (scroll_mode == -1)
+ scroll_mode = 0;
+
+ next = cline->next;
+ while (hidden_mask
+	 && (next != NULL)
+	 && (next->flags & hidden_mask))
+ next = next->next;
+
+ if ((next != NULL)
+ && (next == top_window_line))
+ {
+	/* The current line is one line above the window. This means user
+	 * has moved up past the top of the window. If scroll_mode is set
+	 * to scroll by pages, we need to do a page up.
+	 */
+
+	win->top_window_line = cline;
+	find_window_bottom (win);
+
+	if (scroll_mode) return SLscroll_pageup (win);
+
+	return 0;
+ }
+
+ prev = cline->prev;
+
+ while (hidden_mask
+	 && (prev != NULL)
+	 && (prev->flags & hidden_mask))
+ prev = prev->prev;
+
+ if ((prev == NULL)
+ || (prev != win->bot_window_line))
+ return find_top_to_recenter (win);
+
+ /* It looks like cline is below window by one line. See what line should
+ * be at top to scroll it into view. Only do this unless we are scrolling
+ * by pages.
+ */
+ if (scroll_mode)
+ {
+	win->top_window_line = cline;
+	find_window_bottom (win);
+	return 0;
+ }
+
+ i = 2;
+ while ((i < nrows) && (prev != NULL))
+ {
+	do
+	 {
+	 prev = prev->prev;
+	 }
+	while (hidden_mask
+	 && (prev != NULL)
+	 && (prev->flags & hidden_mask));
+	i++;
+ }
+
+ if (prev != NULL)
+ {
+	win->top_window_line = prev;
+	find_window_bottom (win);
+	return 0;
+ }
+
+ return find_top_to_recenter (win);
+}
+
+int SLscroll_find_line_num (SLscroll_Window_Type *win)
+{
+ SLscroll_Type *cline, *l;
+ unsigned int n;
+ unsigned int hidden_mask;
+
+ if (win == NULL) return -1;
+
+ hidden_mask = win->hidden_mask;
+ cline = win->current_line;
+
+ n = 1;
+
+ l = win->lines;
+ while (l != cline)
+ {
+	if ((hidden_mask == 0)
+	 || (0 == (l->flags & hidden_mask)))
+	 n++;
+
+	l = l->next;
+ }
+
+ win->line_num = n;
+ n--;
+
+ while (l != NULL)
+ {
+	if ((hidden_mask == 0)
+	 || (0 == (l->flags & hidden_mask)))
+	 n++;
+	l = l->next;
+ }
+ win->num_lines = n;
+
+ return 0;
+}
+
+unsigned int SLscroll_next_n (SLscroll_Window_Type *win, unsigned int n)
+{
+ unsigned int i;
+ unsigned int hidden_mask;
+ SLscroll_Type *l, *cline;
+
+ if ((win == NULL)
+ || (NULL == (cline = win->current_line)))
+ return 0;
+
+ hidden_mask = win->hidden_mask;
+ l = cline;
+ i = 0;
+ while (i < n)
+ {
+	l = l->next;
+	while (hidden_mask
+	 && (l != NULL) && (l->flags & hidden_mask))
+	 l = l->next;
+
+	if (l == NULL)
+	 break;
+
+	i++;
+	cline = l;
+ }
+
+ win->current_line = cline;
+ win->line_num += i;
+ return i;
+}
+
+unsigned int SLscroll_prev_n (SLscroll_Window_Type *win, unsigned int n)
+{
+ unsigned int i;
+ unsigned int hidden_mask;
+ SLscroll_Type *l, *cline;
+
+ if ((win == NULL)
+ || (NULL == (cline = win->current_line)))
+ return 0;
+
+ hidden_mask = win->hidden_mask;
+ l = cline;
+ i = 0;
+ while (i < n)
+ {
+	l = l->prev;
+	while (hidden_mask
+	 && (l != NULL) && (l->flags & hidden_mask))
+	 l = l->prev;
+
+	if (l == NULL)
+	 break;
+
+	i++;
+	cline = l;
+ }
+
+ win->current_line = cline;
+ win->line_num -= i;
+ return i;
+}
+
+int SLscroll_pageup (SLscroll_Window_Type *win)
+{
+ SLscroll_Type *l, *top;
+ unsigned int nrows, hidden_mask;
+
+ if (win == NULL)
+ return -1;
+
+ (void) SLscroll_find_top (win);
+
+ nrows = win->nrows;
+
+ if ((NULL != (top = win->top_window_line))
+ && (nrows > 2))
+ {
+	unsigned int n = 0;
+	hidden_mask = win->hidden_mask;
+	l = win->current_line;
+	while ((l != NULL) && (l != top))
+	 {
+	 l = l->prev;
+	 if ((hidden_mask == 0)
+		 || ((l != NULL) && (0 == (l->flags & hidden_mask))))
+	 n++;
+	 }
+
+	if (l != NULL)
+	 {
+	 unsigned int save_line_num;
+	 int ret = 0;
+
+	 win->current_line = l;
+	 win->line_num -= n;
+
+	 /* Compute a new top/bottom header */
+	 save_line_num = win->line_num;
+
+	 if ((0 == SLscroll_prev_n (win, nrows - 1))
+		 && (n == 0))
+	 ret = -1;
+
+	 win->top_window_line = win->current_line;
+	 win->current_line = l;
+	 win->line_num = save_line_num;
+
+	 find_window_bottom (win);
+	 return ret;
+	 }
+ }
+
+ if (nrows < 2) nrows++;
+ if (0 == SLscroll_prev_n (win, nrows - 1))
+ return -1;
+ return 0;
+}
+
+int SLscroll_pagedown (SLscroll_Window_Type *win)
+{
+ SLscroll_Type *l, *bot;
+ unsigned int nrows, hidden_mask;
+
+ if (win == NULL)
+ return -1;
+
+ (void) SLscroll_find_top (win);
+
+ nrows = win->nrows;
+
+ if ((NULL != (bot = win->bot_window_line))
+ && (nrows > 2))
+ {
+	unsigned int n = 0;
+	hidden_mask = win->hidden_mask;
+	l = win->current_line;
+	while ((l != NULL) && (l != bot))
+	 {
+	 l = l->next;
+	 if ((hidden_mask == 0)
+		 || ((l != NULL) && (0 == (l->flags & hidden_mask))))
+	 n++;
+	 }
+
+	if (l != NULL)
+	 {
+	 win->current_line = l;
+	 win->top_window_line = l;
+	 win->line_num += n;
+
+	 find_window_bottom (win);
+
+	 if (n || (bot != win->bot_window_line))
+	 return 0;
+
+	 return -1;
+	 }
+ }
+
+ if (nrows < 2) nrows++;
+ if (0 == SLscroll_next_n (win, nrows - 1))
+ return -1;
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slsearch.c Added

@@ -0,0 +1,785 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+#ifdef upcase
+# undef upcase
+#endif
+
+/* The Boyer-Moore search algorthm is used below under the following
+ * conditions:
+ *
+ * 1. The search is case-sensitive.
+ * 3. UTF-8 mode is not active.
+ * 2. The search key contains only of single byte characters.
+ * 4. The multi-byte characters in the key are case-less.
+ *
+ * Otherwise, the search is case-insensitive and the key consists of
+ * multi-byte characters. In this case, a modified BM algorithm is used
+ * _if_ each character in the key is composed of multi-byte characters that
+ * have upper and lower case versions of the same length.
+ *
+ * Otherwise, the search search will be performed in a brute-force manner.
+ */
+
+typedef struct
+{
+ SLuchar_Type *key;
+ size_t key_len;
+ size_t fskip_table256;
+ size_t bskip_table256;
+}
+BoyerMoore_Search_Type;
+
+typedef struct
+{
+ SLuchar_Type **lower_chars;
+ SLuchar_Type **upper_chars;
+ SLstrlen_Type nlower_chars;
+ SLstrlen_Type nupper_chars;
+ SLsearch_Type *st;
+}
+BruteForce_Search_Type;
+
+struct _pSLsearch_Type
+{
+ SLuchar_Type *(*search_fun)(SLsearch_Type *, SLuchar_Type *, SLuchar_Type *, SLuchar_Type *, int);
+ void (*free_fun) (SLsearch_Type *);
+ int flags;
+ size_t match_len;
+ union
+ {
+ BoyerMoore_Search_Type bm;
+ BruteForce_Search_Type bf;
+ }
+ s;
+};
+
+/* Simple BM search--- case-sensitive, or case-less, or no UTF-8, or 7-bit ascii */
+static SLuchar_Type *
+ bm_search_forward (SLsearch_Type *st, SLuchar_Type *beg, SLuchar_Type *end)
+{
+ register unsigned char char1;
+ unsigned char *pos;
+ size_t *skip_table;
+ SLuchar_Type *key;
+ SLstrlen_Type key_len;
+ int case_fold;
+ BoyerMoore_Search_Type *bm;
+
+ bm = &st->s.bm;
+ key_len = bm->key_len;
+
+ st->match_len = 0;
+
+ if ((key_len > (unsigned int) (end - beg))
+ || (key_len == 0))
+ return NULL;
+
+ case_fold = st->flags & SLSEARCH_CASELESS;
+ key = bm->key;
+ skip_table = bm->fskip_table;
+
+ char1 = keykey_len - 1;
+ beg += (key_len - 1);
+
+ while(1)
+ {
+	SLuchar_Type ch;
+ SLstrlen_Type j;
+
+ while (beg < end)
+ {
+	 SLstrlen_Type dbeg;
+ ch = *beg;
+ dbeg = skip_tablech;
+ if ((dbeg < key_len)
+ && ((ch == char1)
+ || (case_fold && (char1 == UPPER_CASE(ch)))))
+ break;
+ beg += dbeg;
+ }
+	if (beg >= end) return NULL;
+
+	pos = beg - (key_len - 1);
+	for (j = 0; j < key_len; j++)
+	 {
+ ch = posj;
+	 if ((keyj != ch)
+ && ((case_fold == 0)
+ || (keyj != UPPER_CASE(ch))))
+ break;
+ }
+
+	if (j == key_len)
+ {
+ st->match_len = key_len;
+ return pos;
+ }
+
+	beg += 1;
+ }
+}
+
+static SLuchar_Type *
+ bm_search_backward (SLsearch_Type *st,
+ SLuchar_Type *beg, SLuchar_Type *start, SLuchar_Type *end)
+{
+ SLuchar_Type char1;
+ SLstrlen_Type j, ofs;
+ SLstrlen_Type key_len;
+ SLuchar_Type *key;
+ int case_fold;
+ size_t *skip_table;
+ BoyerMoore_Search_Type *bm;
+
+ st->match_len = 0;
+ bm = &st->s.bm;
+
+ key_len = bm->key_len;
+ if ((key_len > (unsigned int) (end - beg))
+ || (key_len == 0)
+ || (end <= beg)
+ || (start < beg)
+ || (start >= end))
+ return NULL;
+
+ case_fold = st->flags & SLSEARCH_CASELESS;
+ key = bm->key;
+ skip_table = bm->bskip_table;
+
+ if (start + key_len > end)
+ start = end - key_len;
+
+ char1 = key0;
+
+ while(1)
+ {
+ SLuchar_Type ch;
+
+	 while (beg <= start)
+	 {
+ ch = *start;
+
+ if ((ch == char1)
+ || (case_fold && (char1 == UPPER_CASE(ch))))
+ break;
+
+ ofs = skip_tablech;
+	 start -= ofs;
+	 }
+	 if (beg > start) return NULL;
+
+	 for (j = 1; j < key_len; j++)
+	 {
+ ch = startj;
+ if ((keyj != ch)
+ && ((case_fold == 0)
+ || (keyj != UPPER_CASE(ch))))
+ break;
+	 }
+	 if (j == key_len)
+ {
+ st->match_len = key_len;
+ return start;
+ }
+	 start--;
+ }
+}
+
+static SLuchar_Type *bm_search (SLsearch_Type *st,
+ SLuchar_Type *pmin, SLuchar_Type *p, SLuchar_Type *pmax,
+ int dir)
+{
+ if (dir > 0)
+ return bm_search_forward (st, p, pmax);
+ else
+ return bm_search_backward (st, pmin, p, pmax);
+}
+
+/* Return value, if non-NULL returns pointer to the end of the string */
+static SLuchar_Type *
+ looking_at_bf (SLuchar_Type *pmin, SLuchar_Type *pmax,
+ SLuchar_Type **lower_chars, SLstrlen_Type nlower_chars,
+ SLuchar_Type **upper_chars, SLstrlen_Type nupper_chars)
+
+{
+ unsigned int n;
+
+ n = 0;
+ while ((n < nupper_chars) && (n < nlower_chars))
+ {
+ SLuchar_Type *up, *lo, *p;
+ up = upper_charsn;
+ lo = lower_charsn;
+
+ n++;
+
+ p = pmin;
+ while ((p < pmax)
+ && (*up == *p)
+ && (*up != 0))
+ {
+ up++;
+ p++;
+ }
+
+ if (*up == 0)
+ {
+ pmin = p;
+ continue;
+ }
+
+ p = pmin;
+ while ((p < pmax)
+ && (*lo == *p)
+ && (*lo != 0))
+ {
+ lo++;
+ p++;
+ }
+
+ if (*lo == 0)
+ {
+ pmin = p;
+ continue;
+ }
+
+ return NULL;
+ }
+ return pmin;
+}
+
+/* Brute force case-insensitive searches */
+static SLuchar_Type *
+ bf_search_forward (SLsearch_Type *st,
+ SLuchar_Type *pmin, SLuchar_Type *pmax)
+{
+ SLsearch_Type *bf_st;
+ SLuchar_Type chup, chlo;
+ SLuchar_Type **upper_chars;
+ SLuchar_Type **lower_chars;
+ SLstrlen_Type nupper_chars, nlower_chars;
+
+ bf_st = st->s.bf.st;
+ upper_chars = st->s.bf.upper_chars;
+ lower_chars = st->s.bf.lower_chars;
+ nupper_chars = st->s.bf.nupper_chars;
+ nlower_chars = st->s.bf.nlower_chars;
+
+ chup = upper_chars00;
+ chlo = lower_chars00;
+
+ while (1)
+ {
+ SLuchar_Type *p;
+
+ if (bf_st != NULL)
+ {
+ if (NULL == (pmin = SLsearch_forward (bf_st, pmin, pmax)))
+ {
+ st->match_len = 0;
+ return NULL;
+ }
+ p = pmin + bf_st->match_len;
+ }
+ else
+ {
+ while (pmin < pmax)
+ {
+ if ((*pmin == chup) || (*pmin == chlo))
+ break;
+
+ pmin++;
+ }
+
+ if (pmin >= pmax)
+ {
+ st->match_len = 0;
+ return NULL;
+ }
+
+ p = pmin;
+ }
+
+ p = looking_at_bf (p, pmax, lower_chars, nlower_chars,
+ upper_chars, nupper_chars);
+
+ if (p != NULL)
+ {
+ st->match_len = p - pmin;
+ return pmin;
+ }
+
+ pmin++;
+ }
+}
+
+static SLuchar_Type *
+ bf_search_backward (SLsearch_Type *st,
+ SLuchar_Type *pmin, SLuchar_Type *start, SLuchar_Type *pmax)
+{
+ SLsearch_Type *bf_st;
+ SLuchar_Type chup, chlo;
+ SLuchar_Type **upper_chars;
+ SLuchar_Type **lower_chars;
+ SLstrlen_Type nupper_chars, nlower_chars;
+
+ bf_st = st->s.bf.st;
+ upper_chars = st->s.bf.upper_chars;
+ lower_chars = st->s.bf.lower_chars;
+ nupper_chars = st->s.bf.nupper_chars;
+ nlower_chars = st->s.bf.nlower_chars;
+
+ chup = upper_chars00;
+ chlo = lower_chars00;
+
+ while (1)
+ {
+ SLuchar_Type *p;
+
+ if (bf_st != NULL)
+ {
+ if (NULL == (start = SLsearch_backward (bf_st, pmin, start+1, pmax)))
+ {
+ st->match_len = 0;
+ return NULL;
+ }
+ p = start + bf_st->match_len;
+ }
+ else
+ {
+ /* start--; */
+ while (start >= pmin)
+ {
+ if ((*start == chup) || (*start == chlo))
+ break;
+ start--;
+ }
+
+ if (start < pmin)
+ {
+ st->match_len = 0;
+ return NULL;
+ }
+
+ p = start;
+ }
+
+ p = looking_at_bf (p, pmax, lower_chars, nlower_chars,
+ upper_chars, nupper_chars);
+
+ if (p != NULL)
+ {
+ st->match_len = p - start;
+ return start;
+ }
+
+ start--;
+ }
+}
+
+static SLuchar_Type *
+ bf_search (SLsearch_Type *st,
+ SLuchar_Type *pmin, SLuchar_Type *p, SLuchar_Type *pmax,
+ int dir)
+{
+ if (dir > 0)
+ return bf_search_forward (st, p, pmax);
+ else
+ return bf_search_backward (st, pmin, p, pmax);
+}
+
+SLuchar_Type *SLsearch_forward (SLsearch_Type *st,
+ SLuchar_Type *pmin, SLuchar_Type *pmax)
+{
+ if (st == NULL)
+ return NULL;
+
+ return st->search_fun (st, pmin, pmin, pmax, 1);
+}
+
+SLuchar_Type *SLsearch_backward (SLsearch_Type *st, SLuchar_Type *pmin,
+ SLuchar_Type *p, SLuchar_Type *pmax)
+{
+ if (st == NULL)
+ return NULL;
+
+ /* For the backward search, the first character of the string
+ * is assumed satisfy pmin <= BEG search_fun (st, pmin, p-1, pmax, -1);
+}
+
+static int Case_Tables_Ok;
+
+static void init_skip_table (SLuchar_Type *key, SLstrlen_Type key_len,
+			 size_t *skip_table, int dir, int flags)
+{
+ unsigned int i;
+
+ for (i = 0; i < 256; i++)
+ skip_tablei = key_len;
+
+ if (dir < 0)
+ key += (key_len-1);
+
+ /* For a case-insensitive search, the key here will be uppercased */
+ flags = flags & SLSEARCH_CASELESS;
+ i = 0;
+ while (i < key_len)
+ {
+	i++;
+	skip_table*key = key_len - i;
+	if (flags)
+	 skip_tableLOWER_CASE(*key) = key_len - i;
+	key += dir;
+ }
+}
+
+static void bm_free (SLsearch_Type *st)
+{
+ SLang_free_slstring ((char *) st->s.bm.key);
+}
+
+static void bf_free (SLsearch_Type *st)
+{
+ SLstrlen_Type i, n;
+ SLuchar_Type **a;
+
+ if (NULL != (a = st->s.bf.lower_chars))
+ {
+ n = st->s.bf.nlower_chars;
+ for (i = 0; i < n; i++)
+ SLang_free_slstring ((char *) ai);
+ SLfree ((char *) a);
+ }
+
+ if (NULL != (a = st->s.bf.upper_chars))
+ {
+ n = st->s.bf.nupper_chars;
+ for (i = 0; i < n; i++)
+ SLang_free_slstring ((char *) ai);
+ SLfree ((char *) a);
+ }
+}
+
+SLstrlen_Type SLsearch_match_len (SLsearch_Type *st)
+{
+ if (st == NULL)
+ return 0;
+
+ return st->match_len;
+}
+
+void SLsearch_delete (SLsearch_Type *st)
+{
+ if (st == NULL)
+ return;
+
+ (*st->free_fun) (st);
+ SLfree ((char *)st);
+}
+
+/* This is used if the key is not UTF-8, or it is but the search is case-sensitive */
+static SLsearch_Type *bm_open_search (SLuchar_Type *key, int flags)
+{
+ SLsearch_Type *st;
+ size_t keylen;
+
+ keylen = strlen ((char *)key);
+ if (NULL == (st = (SLsearch_Type *)SLcalloc (1, sizeof (SLsearch_Type))))
+ return NULL;
+
+ st->free_fun = bm_free;
+
+ /* If the search is case-insensitive, then it must either be all ascii, or
+ * it is not unicode. In either case, the UPPER_CASE and LOWER_CASE macros
+ * should be ok to use.
+ */
+ if (flags & SLSEARCH_CASELESS)
+ {
+	char *keyup = SLmake_nstring ((char *)key, keylen);
+	if (keyup != NULL)
+	 {
+	 unsigned char *k = (unsigned char *)keyup;
+	 while (*k != 0)
+	 {
+		 *k = UPPER_CASE(*k);
+		 k++;
+	 }
+	 st->s.bm.key = (SLuchar_Type *)SLang_create_slstring (keyup);
+	 SLfree (keyup);
+	 }
+	else st->s.bm.key = NULL;
+ }
+ else st->s.bm.key = (SLuchar_Type*) SLang_create_slstring ((char *)key);
+
+ if (st->s.bm.key == NULL)
+ {
+ SLsearch_delete (st);
+ return NULL;
+ }
+ st->s.bm.key_len = keylen;
+ st->flags = flags;
+
+ st->search_fun = bm_search;
+
+ init_skip_table (st->s.bm.key, st->s.bm.key_len, st->s.bm.fskip_table, 1, flags);
+ init_skip_table (st->s.bm.key, st->s.bm.key_len, st->s.bm.bskip_table, -1, flags);
+ return st;
+}
+
+static int is_bm_ok (SLuchar_Type *key, SLstrlen_Type len, SLuchar_Type **non_ascii)
+{
+ SLuchar_Type *keymax;
+
+ /* See if the key is ascii-only */
+ keymax = key + len;
+
+ while (key < keymax)
+ {
+ if (*key & 0x80)
+ {
+ *non_ascii = key;
+ return 0;
+ }
+
+ key++;
+ }
+
+ return 1;
+}
+
+static SLuchar_Type **make_string_array (SLuchar_Type *u, SLstrlen_Type len, SLuindex_Type *nump)
+{
+ SLuchar_Type *umax;
+ SLuchar_Type **a;
+ SLuindex_Type num, i;
+ int ignore_combining = 0;
+
+ num = SLutf8_strlen (u, ignore_combining);
+ if (num == 0)
+ return NULL; /* should not happen */
+
+ if (NULL == (a = (SLuchar_Type **) SLcalloc (sizeof (SLuchar_Type *), num)))
+ return NULL;
+
+ umax = u + len;
+ for (i = 0; i < num; i++)
+ {
+ SLuchar_Type *u1 = SLutf8_skip_char (u, umax);
+ if (NULL == (ai = (SLuchar_Type *)SLang_create_nslstring ((char *)u, u1 - u)))
+ goto return_error;
+	u = u1;
+ }
+ *nump = num;
+ return a;
+
+ return_error:
+ for (i = 0; i < num; i++)
+ SLang_free_slstring ((char *) ai);
+ SLfree ((char *) a);
+ return NULL;
+}
+
+SLsearch_Type *SLsearch_new (SLuchar_Type *key, int flags)
+{
+ SLsearch_Type *st, *bf_st;
+ SLuchar_Type *key_upper, *key_lower, *non_ascii;
+ size_t len, upper_len, lower_len;
+
+ if (Case_Tables_Ok == 0)
+ SLang_init_case_tables ();
+
+ if (key == NULL)
+ return NULL;
+
+ if ((0 == (flags & SLSEARCH_CASELESS))
+ || (0 == (flags & SLSEARCH_UTF8)))
+ return bm_open_search (key, flags);
+
+ /* Otherwise the key is UTF-8 and the search is case-insensitive */
+ len = strlen ((char *)key);
+ key_upper = SLutf8_strup (key, key + len);
+ if (key_upper == NULL)
+ return NULL;
+
+ upper_len = strlen ((char *)key_upper);
+
+ if (is_bm_ok (key_upper, upper_len, &non_ascii))
+ {
+ st = bm_open_search (key_upper, flags);
+ SLang_free_slstring ((char *)key_upper);
+ return st;
+ }
+
+ /* Tricky part */
+
+ if (NULL == (key_lower = SLutf8_strlo (key, key + len)))
+ {
+ SLang_free_slstring ((char *)key_upper);
+ return NULL;
+ }
+
+ lower_len = strlen ((char *)key_lower);
+
+ /* Try a case-less search */
+ if ((lower_len == upper_len)
+ && (0 == strcmp ((char *)key_upper, (char *)key_lower)))
+ {
+ flags &= ~SLSEARCH_CASELESS;
+ st = bm_open_search (key_upper, flags);
+ SLang_free_slstring ((char *)key_upper);
+ SLang_free_slstring ((char *)key_lower);
+ return st;
+ }
+
+ /* Now Perform a brute-force search. */
+
+ /* If the first few characters of the search string are ascii, then
+ * use BM for that portion
+ */
+ bf_st = NULL;
+ if (non_ascii - key_upper >= 3)
+ {
+ SLuchar_Type *key1 = (SLuchar_Type *) SLmake_nstring ((char *)key_upper, non_ascii - key_upper);
+
+ /* ok to propagate NULL below */
+ bf_st = SLsearch_new (key1, flags);
+ SLfree ((char *)key1);
+ if (bf_st == NULL)
+ {
+ SLang_free_slstring ((char *)key_upper);
+ SLang_free_slstring ((char *)key_lower);
+ return NULL;
+ }
+
+ key1 = (SLuchar_Type *) SLang_create_slstring ((char *)non_ascii);
+ non_ascii = key_lower + (non_ascii - key_upper);
+ SLang_free_slstring ((char *)key_upper);
+ key_upper = key1;
+
+ key1 = (SLuchar_Type *)SLang_create_slstring ((char *)non_ascii);
+ SLang_free_slstring ((char *)key_lower);
+ key_lower = key1;
+
+ if ((key_lower == NULL) || (key_upper == NULL))
+ {
+ SLang_free_slstring ((char *)key_upper);
+ SLang_free_slstring ((char *)key_lower);
+ SLsearch_delete (bf_st);
+ return NULL;
+ }
+ upper_len = strlen ((char *)key_upper);
+ lower_len = strlen ((char *)key_lower);
+ }
+
+ st = (SLsearch_Type *)SLcalloc (sizeof (SLsearch_Type), 1);
+ if (st == NULL)
+ goto return_error;
+ st->free_fun = bf_free;
+ st->flags = flags;
+ st->search_fun = bf_search;
+
+ st->s.bf.st = bf_st; bf_st = NULL;
+
+ if (NULL == (st->s.bf.lower_chars = make_string_array (key_lower, lower_len, &st->s.bf.nlower_chars)))
+ goto return_error;
+
+ if (NULL == (st->s.bf.upper_chars = make_string_array (key_upper, upper_len, &st->s.bf.nupper_chars)))
+ goto return_error;
+
+ SLang_free_slstring ((char *)key_upper);
+ SLang_free_slstring ((char *)key_lower);
+ return st;
+
+ return_error:
+ SLsearch_delete (st);
+ SLsearch_delete (bf_st);
+ SLang_free_slstring ((char *)key_upper);
+ SLang_free_slstring ((char *)key_lower);
+ return NULL;
+}
+
+/* 8bit clean upper and lowercase tables. These are used _only_ when UTF-8
+ * mode is not active, or when uppercasing ASCII.
+ */
+unsigned char _pSLChg_LCase_Lut256 = {0};
+unsigned char _pSLChg_UCase_Lut256 = {0};
+
+void SLang_define_case (int *u, int *l)
+{
+ unsigned char up = (unsigned char) *u, dn = (unsigned char) *l;
+
+ _pSLChg_LCase_Lutup = dn;
+ _pSLChg_LCase_Lutdn = dn;
+ _pSLChg_UCase_Lutdn = up;
+ _pSLChg_UCase_Lutup = up;
+}
+
+void SLang_init_case_tables (void)
+{
+ int i;
+ if (Case_Tables_Ok) return;
+
+ for (i = 0; i < 256; i++)
+ {
+	_pSLChg_UCase_Luti = i;
+	_pSLChg_LCase_Luti = i;
+ }
+
+ for (i = 'A'; i <= 'Z'; i++)
+ {
+	int j = i + 32;
+	_pSLChg_UCase_Lutj = i;
+	_pSLChg_LCase_Luti = j;
+ }
+#ifdef PC_SYSTEM
+ /* Initialize for DOS code page 437. */
+ _pSLChg_UCase_Lut135 = 128; _pSLChg_LCase_Lut128 = 135;
+ _pSLChg_UCase_Lut132 = 142; _pSLChg_LCase_Lut142 = 132;
+ _pSLChg_UCase_Lut134 = 143; _pSLChg_LCase_Lut143 = 134;
+ _pSLChg_UCase_Lut130 = 144; _pSLChg_LCase_Lut144 = 130;
+ _pSLChg_UCase_Lut145 = 146; _pSLChg_LCase_Lut146 = 145;
+ _pSLChg_UCase_Lut148 = 153; _pSLChg_LCase_Lut153 = 148;
+ _pSLChg_UCase_Lut129 = 154; _pSLChg_LCase_Lut154 = 129;
+ _pSLChg_UCase_Lut164 = 165; _pSLChg_LCase_Lut165 = 164;
+#else
+ /* ISO Latin */
+ for (i = 192; i <= 221; i++)
+ {
+	int j = i + 32;
+	_pSLChg_UCase_Lutj = i;
+	_pSLChg_LCase_Luti = j;
+ }
+ _pSLChg_UCase_Lut215 = 215; _pSLChg_LCase_Lut215 = 215;
+ _pSLChg_UCase_Lut223 = 223; _pSLChg_LCase_Lut223 = 223;
+ _pSLChg_UCase_Lut247 = 247; _pSLChg_LCase_Lut247 = 247;
+ _pSLChg_UCase_Lut255 = 255; _pSLChg_LCase_Lut255 = 255;
+#endif
+ Case_Tables_Ok = 1;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slsig.c Added

@@ -0,0 +1,862 @@
+/* interpreter signal handling functions */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include <signal.h>
+#include <errno.h>
+
+#ifdef HAVE_SYS_TYPES_H
+# include <sys/types.h>
+#endif
+#ifdef HAVE_SYS_WAIT_H
+# include <sys/wait.h>
+#endif
+
+#ifdef HAVE_SYS_TIME_H
+# include <sys/time.h>
+#endif
+
+#include "slang.h"
+#include "_slang.h"
+
+#if SLANG_HAS_SIGNALS		 /* until end of file */
+
+/* Do not trust these environments */
+#if defined(__MINGW32__) || defined(AMIGA)
+# ifdef SLANG_POSIX_SIGNALS
+# undef SLANG_POSIX_SIGNALS
+# endif
+#endif
+
+typedef struct
+{
+ int sig;
+ SLFUTURE_CONST char *name;
+ SLang_Name_Type *handler;
+ void (*c_handler)(int);
+ int pending;			 /* if set, the signal needs to be delivered */
+ int forbidden;		 /* If set, this signal is off-limits */
+}
+Signal_Type;
+
+#define SIG_DFL_CONSTANT	0
+#define SIG_IGN_CONSTANT	1
+#define SIG_APP_CONSTANT	2
+
+/* SIG_APP represents the application's handler */
+#ifdef SLANG_POSIX_SIGNALS
+typedef sigset_t Signal_Set_Type;
+#else
+typedef int Signal_Set_Type;
+#endif
+
+#define MAKE_SIGNAL(sig,name) {sig,name,NULL,NULL,0,0}
+static Signal_Type Signal_Table =
+{
+#ifdef SIGHUP
+ MAKE_SIGNAL(SIGHUP,"SIGHUP"),
+#endif
+#ifdef SIGINT
+ MAKE_SIGNAL(SIGINT,"SIGINT"),
+#endif
+#ifdef SIGQUIT
+ MAKE_SIGNAL(SIGQUIT,"SIGQUIT"),
+#endif
+#ifdef SIGILL
+ MAKE_SIGNAL(SIGILL,"SIGILL"),
+#endif
+#ifdef SIGTRAP
+ MAKE_SIGNAL(SIGTRAP,"SIGTRAP"),
+#endif
+#ifdef SIGABRT
+ MAKE_SIGNAL(SIGABRT,"SIGABRT"),
+#endif
+#ifdef SIGIOT
+ MAKE_SIGNAL(SIGIOT,"SIGIOT"),
+#endif
+#ifdef SIGBUS
+ MAKE_SIGNAL(SIGBUS,"SIGBUS"),
+#endif
+#ifdef SIGFPE
+ MAKE_SIGNAL(SIGFPE,"SIGFPE"),
+#endif
+#ifdef SIGKILL
+ MAKE_SIGNAL(SIGKILL,"SIGKILL"),
+#endif
+#ifdef SIGUSR1
+ MAKE_SIGNAL(SIGUSR1,"SIGUSR1"),
+#endif
+#ifdef SIGSEGV
+ MAKE_SIGNAL(SIGSEGV,"SIGSEGV"),
+#endif
+#ifdef SIGUSR2
+ MAKE_SIGNAL(SIGUSR2,"SIGUSR2"),
+#endif
+#ifdef SIGPIPE
+ MAKE_SIGNAL(SIGPIPE,"SIGPIPE"),
+#endif
+#ifdef SIGALRM
+ MAKE_SIGNAL(SIGALRM,"SIGALRM"),
+#endif
+#ifdef SIGTERM
+ MAKE_SIGNAL(SIGTERM,"SIGTERM"),
+#endif
+#ifdef SIGSTKFLT
+ MAKE_SIGNAL(SIGSTKFLT,"SIGSTKFLT"),
+#endif
+#ifdef SIGCHLD
+ MAKE_SIGNAL(SIGCHLD,"SIGCHLD"),
+#endif
+#ifdef SIGCONT
+ MAKE_SIGNAL(SIGCONT,"SIGCONT"),
+#endif
+#ifdef SIGSTOP
+ MAKE_SIGNAL(SIGSTOP,"SIGSTOP"),
+#endif
+#ifdef SIGTSTP
+ MAKE_SIGNAL(SIGTSTP,"SIGTSTP"),
+#endif
+#ifdef SIGTTIN
+ MAKE_SIGNAL(SIGTTIN,"SIGTTIN"),
+#endif
+#ifdef SIGTTOU
+ MAKE_SIGNAL(SIGTTOU,"SIGTTOU"),
+#endif
+#ifdef SIGURG
+ MAKE_SIGNAL(SIGURG,"SIGURG"),
+#endif
+#ifdef SIGXCPU
+ MAKE_SIGNAL(SIGXCPU,"SIGXCPU"),
+#endif
+#ifdef SIGXFSZ
+ MAKE_SIGNAL(SIGXFSZ,"SIGXFSZ"),
+#endif
+#ifdef SIGVTALRM
+ MAKE_SIGNAL(SIGVTALRM,"SIGVTALRM"),
+#endif
+#ifdef SIGPROF
+ MAKE_SIGNAL(SIGPROF,"SIGPROF"),
+#endif
+#ifdef SIGWINCH
+ MAKE_SIGNAL(SIGWINCH,"SIGWINCH"),
+#endif
+#ifdef SIGIO
+ MAKE_SIGNAL(SIGIO,"SIGIO"),
+#endif
+#ifdef SIGPOLL
+ MAKE_SIGNAL(SIGPOLL,"SIGPOLL"),
+#endif
+#ifdef SIGPWR
+ MAKE_SIGNAL(SIGPWR,"SIGPWR"),
+#endif
+#ifdef SIGSYS
+ MAKE_SIGNAL(SIGSYS,"SIGSYS"),
+#endif
+ MAKE_SIGNAL(-1, NULL),
+};
+
+static Signal_Type *find_signal (int sig)
+{
+ Signal_Type *s = Signal_Table;
+
+ while (s->name != NULL)
+ {
+	if (s->sig == sig)
+	 return s;
+	s++;
+ }
+ return NULL;
+}
+
+#ifdef SLANG_POSIX_SIGNALS
+static int do_sigprocmask (int how, sigset_t *new_mask, sigset_t *old_mask)
+{
+ while (-1 == sigprocmask (how, new_mask, old_mask))
+ {
+#ifdef EINTR
+	if (errno == EINTR)
+	 continue;
+#endif
+	return -1;
+ }
+ return 0;
+}
+#endif
+
+static int block_signal (int sig, int *was_blocked)
+{
+#ifdef SLANG_POSIX_SIGNALS
+ sigset_t new_mask;
+ sigset_t old_mask;
+ sigemptyset (&new_mask);
+ sigaddset (&new_mask, sig);
+ (void) do_sigprocmask (SIG_BLOCK, &new_mask, &old_mask);
+ *was_blocked = sigismember (&old_mask, sig);
+ return 0;
+#else
+ *was_blocked = 0;
+ return 0;
+#endif
+}
+
+static int unblock_signal (int sig)
+{
+#ifdef SLANG_POSIX_SIGNALS
+ sigset_t new_mask;
+ sigemptyset (&new_mask);
+ sigaddset (&new_mask, sig);
+ (void) do_sigprocmask (SIG_UNBLOCK, &new_mask, NULL);
+#endif
+ return 0;
+}
+
+static void signal_handler (int sig)
+{
+ Signal_Type *s;
+ int e = errno;
+
+ /* Until the signal has been delivered, block it. */
+ /* Hmmm... it appears that the system unblocks the signal as soon
+ * as this function exits. Fortunately, this is not an issue.
+ */
+ /* (void) block_signal (sig); */
+ (void) SLsignal_intr (sig, &signal_handler);
+
+ s = find_signal (sig);	 /* cannot fail here */
+
+ s->pending = 1;
+ if (sig == SIGINT)
+ SLKeyBoard_Quit = 1;
+ _pSLang_signal_interrupt ();
+ errno = e;
+}
+
+int _pSLsig_block_and_call (int (*func)(VOID_STAR), VOID_STAR cd)
+{
+ Signal_Type *s;
+ int status;
+
+#ifdef SLANG_POSIX_SIGNALS
+ sigset_t new_mask, old_mask;
+ sigemptyset (&new_mask);
+#endif
+
+ s = Signal_Table;
+ while (s->name != NULL)
+ {
+	if (s->handler == NULL)
+	 {
+	 s++;
+	 continue;
+	 }
+#ifdef SLANG_POSIX_SIGNALS
+	sigaddset (&new_mask, s->sig);
+#endif
+	s++;
+ }
+
+#ifdef SLANG_POSIX_SIGNALS
+ (void) do_sigprocmask (SIG_BLOCK, &new_mask, &old_mask);
+#endif
+
+ status = (*func) (cd);
+
+#ifdef SLANG_POSIX_SIGNALS
+ (void) do_sigprocmask (SIG_SETMASK, &old_mask, NULL);
+#endif
+
+ return status;
+}
+
+/* This function is reentrant */
+static int handle_signal (Signal_Type *s)
+{
+ int status = 0;
+ int was_blocked;
+
+ (void) block_signal (s->sig, &was_blocked);
+
+ /* At this point, sig is blocked and the handler is about to be called.
+ * The pending flag can be safely set to 0 here.
+ */
+ s->pending = 0;
+
+ if (s->handler != NULL)
+ {
+	int depth = SLstack_depth ();
+
+	if ((-1 == SLang_start_arg_list ())
+	 || (-1 == SLang_push_integer (s->sig))
+	 || (-1 == SLang_end_arg_list ())
+	 || (-1 == SLexecute_function (s->handler)))
+	 status = -1;
+
+	if ((status == 0)
+	 && (depth != SLstack_depth ()))
+	 {
+	 SLang_verror (SL_Application_Error, "The signal handler %s corrupted the stack", s->handler->name);
+	 status = -1;
+	 }
+ }
+
+ if (was_blocked == 0)
+ (void) unblock_signal (s->sig);
+
+ return status;
+}
+
+/* This routine gets called by the interpreter when a signal needs to be
+ * handled.
+ */
+int _pSLsig_handle_signals (void)
+{
+ Signal_Type *s = Signal_Table;
+ int status = 0;
+
+ while (s->name != NULL)
+ {
+	if ((s->pending != 0)
+	 && (-1 == handle_signal (s)))
+	 status = -1;
+
+	s++;
+ }
+ return status;
+}
+
+static int pop_signal (Signal_Type **sp)
+{
+ int sig;
+ Signal_Type *s;
+
+ if (-1 == SLang_pop_int (&sig))
+ return -1;
+
+ s = Signal_Table;
+ while (s->name != NULL)
+ {
+	if (s->sig == sig)
+	 {
+	 if (s->forbidden)
+	 {
+		 SLang_set_error (SL_Forbidden_Error);
+		 return -1;
+	 }
+
+	 *sp = s;
+	 return 0;
+	 }
+	s++;
+ }
+
+ _pSLang_verror (SL_INVALID_PARM, "Signal %d invalid or unknown", sig);
+ return -1;
+}
+
+static int set_old_handler (Signal_Type *s, SLang_Ref_Type *ref, void (*old_handler)(int))
+{
+ if (old_handler == (void (*)(int))SIG_ERR)
+ {
+	_pSLang_verror (0, "signal system call failed");
+	return -1;
+ }
+
+ if (ref != NULL)
+ {
+	int ret;
+
+	if (old_handler == signal_handler)
+	 ret = SLang_assign_nametype_to_ref (ref, s->handler);
+	else
+	 {
+	 int h;
+
+	 if (old_handler == SIG_IGN)
+	 h = SIG_IGN_CONSTANT;
+	 else if (old_handler == SIG_DFL)
+	 h = SIG_DFL_CONSTANT;
+	 else
+	 h = SIG_APP_CONSTANT;
+
+	 ret = SLang_assign_to_ref (ref, SLANG_INT_TYPE, &h);
+	 }
+	if (ret == -1)
+	 {
+	 (void) SLsignal_intr (s->sig, old_handler);
+	 return -1;
+	 }
+ }
+
+ if (old_handler != signal_handler)
+ s->c_handler = old_handler;
+
+ return 0;
+}
+
+static void signal_intrinsic (void)
+{
+ SLang_Name_Type *f;
+ Signal_Type *s;
+ void (*old_handler) (int);
+ SLang_Ref_Type *old_ref;
+
+ if (SLang_Num_Function_Args == 3)
+ {
+	if (-1 == SLang_pop_ref (&old_ref))
+	 return;
+ }
+ else old_ref = NULL;
+
+ if (SLang_Num_Function_Args == 0)
+ {
+	SLang_verror (SL_Internal_Error, "signal called with 0 args");
+	return;
+ }
+
+ if (SLANG_INT_TYPE == SLang_peek_at_stack ())
+ {
+	int h;
+
+	if ((-1 == SLang_pop_int (&h))
+	 || (-1 == pop_signal (&s)))
+	 {
+	 SLang_free_ref (old_ref);
+	 return;
+	 }
+
+	/* If this signal has already been caught, deliver it now to the old handler */
+	if (s->pending)
+	 handle_signal (s);
+	/* Note that the signal has the potential of being lost if the user has
+	 * blocked its delivery. For this reason, the unblock_signal intrinsic
+	 * will have to deliver the signal via an explicit kill if it is pending.
+	 */
+
+	if (h == SIG_IGN_CONSTANT)
+	 old_handler = SLsignal_intr (s->sig, SIG_IGN);
+	else if (h == SIG_DFL_CONSTANT)
+	 old_handler = SLsignal_intr (s->sig, SIG_DFL);
+	else if (h == SIG_APP_CONSTANT)
+	 old_handler = SLsignal_intr (s->sig, s->c_handler);
+	else
+	 {
+	 SLang_free_ref (old_ref);
+	 _pSLang_verror (SL_INVALID_PARM, "Signal handler '%d' is invalid", h);
+	 return;
+	 }
+
+	if (-1 == set_old_handler (s, old_ref, old_handler))
+	 {
+	 SLang_free_ref (old_ref);
+	 return;
+	 }
+
+	if (s->handler != NULL)
+	 {
+	 SLang_free_function (s->handler);
+	 s->handler = NULL;
+	 }
+
+	SLang_free_ref (old_ref);
+	return;
+ }
+
+ if (NULL == (f = SLang_pop_function ()))
+ {
+	SLang_free_ref (old_ref);
+	return;
+ }
+
+ if (-1 == pop_signal (&s))
+ {
+	SLang_free_ref (old_ref);
+	SLang_free_function (f);
+	return;
+ }
+
+ old_handler = SLsignal_intr (s->sig, signal_handler);
+ if (-1 == set_old_handler (s, old_ref, old_handler))
+ {
+	SLang_free_ref (old_ref);
+	SLang_free_function (f);
+	return;
+ }
+
+ if (s->handler != NULL)
+ SLang_free_function (s->handler);
+ s->handler = f;
+ SLang_free_ref (old_ref);
+}
+
+static void alarm_intrinsic (void)
+{
+#ifndef HAVE_ALARM
+ SLang_set_error (SL_NotImplemented_Error);
+#else
+ SLang_Ref_Type *ref = NULL;
+ unsigned int secs;
+ Signal_Type *s;
+
+ if (SLang_Num_Function_Args == 2)
+ {
+	if (-1 == SLang_pop_ref (&ref))
+	 return;
+ }
+
+ if (-1 == SLang_pop_uint (&secs))
+ {
+	SLang_free_ref (ref);	 /* NULL ok */
+	return;
+ }
+#ifdef SIGALRM
+ if ((NULL != (s = find_signal (SIGALRM)))
+ && s->forbidden)
+ {
+	SLang_set_error (SL_Forbidden_Error);
+	return;
+ }
+#endif
+ secs = alarm (secs);
+ if (ref != NULL)
+ (void) SLang_assign_to_ref (ref, SLANG_UINT_TYPE, &secs);
+#endif
+}
+
+#ifdef SLANG_POSIX_SIGNALS
+static int pop_signal_mask (sigset_t *maskp)
+{
+ SLang_Array_Type *at;
+ unsigned int i, num, num_set;
+ int *sigs;
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_INT_TYPE))
+ return -1;
+
+ sigemptyset (maskp);
+ num = at->num_elements;
+ sigs = (int *) at->data;
+ num_set = 0;
+
+ for (i = 0; i < num; i++)
+ {
+	int sig = sigsi;
+	if (NULL == find_signal (sig))
+	 continue;
+
+	sigaddset (maskp, sig);
+	num_set++;
+ }
+ SLang_free_array (at);
+
+ return 0;
+}
+#endif 				 /* SLANG_POSIX_SIGNALS */
+
+static void sigsuspend_intrinsic (void)
+{
+#ifdef SLANG_POSIX_SIGNALS
+ sigset_t mask;
+#endif
+
+ if (SLang_Num_Function_Args == 0)
+ {
+#ifdef HAVE_PAUSE
+	(void) pause ();
+#else
+	SLang_set_error (SL_NotImplemented_Error);
+#endif
+	return;
+ }
+
+#ifndef SLANG_POSIX_SIGNALS
+ SLang_set_error (SL_NotImplemented_Error);
+#else
+ if (-1 == pop_signal_mask (&mask))
+ return;
+
+ (void) sigsuspend (&mask);
+#endif
+}
+
+#ifdef SLANG_POSIX_SIGNALS
+static SLang_Array_Type *mask_to_array (sigset_t *mask)
+{
+ SLang_Array_Type *at;
+ SLindex_Type num;
+ Signal_Type *s;
+ int *data;
+
+ num = 0;
+ s = Signal_Table;
+ while (s->name != NULL)
+ {
+	if (sigismember (mask, s->sig))
+	 num++;
+	s++;
+ }
+ at = SLang_create_array (SLANG_INT_TYPE, 0, NULL, &num, 1);
+ if (at == NULL)
+ return NULL;
+
+ s = Signal_Table;
+ data = (int *)at->data;
+ while (s->name != NULL)
+ {
+	if (sigismember (mask, s->sig))
+	 *data++ = s->sig;
+	s++;
+ }
+
+ return at;
+}
+
+static int assign_mask_to_ref (sigset_t *mask, SLang_Ref_Type *ref)
+{
+ SLang_Array_Type *at = mask_to_array (mask);
+
+ if (at == NULL)
+ return -1;
+
+ if (-1 == SLang_assign_to_ref (ref, SLANG_ARRAY_TYPE, (VOID_STAR)&at))
+ {
+	SLang_free_array (at);
+	return -1;
+ }
+ SLang_free_array (at);
+ return 0;
+}
+
+static void sigprocmask_intrinsic (void)
+{
+ sigset_t mask, oldmask;
+ SLang_Ref_Type *ref = NULL;
+ int how;
+
+ if (SLang_Num_Function_Args == 3)
+ {
+ if (-1 == SLang_pop_ref (&ref))
+	 return;
+ }
+
+ if (-1 == pop_signal_mask (&mask))
+ {
+	SLang_free_ref (ref);
+	return;
+ }
+
+ if (-1 == SLang_pop_int (&how))
+ {
+	SLang_free_ref (ref);
+	return;
+ }
+
+ if ((how != SIG_BLOCK) && (how != SIG_UNBLOCK) && (how != SIG_SETMASK))
+ {
+	_pSLang_verror (SL_InvalidParm_Error, "sigprocmask: invalid operation");
+	SLang_free_ref (ref);
+	return;
+ }
+
+ do_sigprocmask (how, &mask, &oldmask);
+
+ if (ref == NULL)
+ return;
+
+ if (-1 == assign_mask_to_ref (&oldmask, ref))
+ do_sigprocmask (SIG_SETMASK, &oldmask, NULL);
+
+ SLang_free_ref (ref);
+}
+
+#endif
+
+#if defined(HAVE_GETITIMER) || defined(HAVE_SETITIMER)
+static double timeval_to_double (struct timeval *tv)
+{
+ return tv->tv_sec + (double) tv->tv_usec * 1e-6;
+}
+
+static void double_to_timeval (double t, struct timeval *tv)
+{
+ if (t < 0.0)
+ t = 0.0;
+ tv->tv_sec = (long) t;
+ tv->tv_usec = (long) ((t - (long)t) * 1e6);
+}
+
+# ifdef HAVE_GETITIMER
+static void getitimer_intrinsic (int *wp)
+{
+ struct itimerval it;
+
+ if (-1 == getitimer (*wp, &it))
+ {
+	SLerrno_set_errno (errno);
+	SLang_verror (SL_OS_Error, "getitimer failed: %s", SLerrno_strerror (errno));
+	return;
+ }
+ (void) SLang_push_double (timeval_to_double (&it.it_value));
+ (void) SLang_push_double (timeval_to_double (&it.it_interval));
+}
+# endif
+# ifdef HAVE_SETITIMER
+static void setitimer_intrinsic (void)
+{
+ SLang_Ref_Type *interval_ref = NULL, *value_ref = NULL;
+ int w;
+ struct itimerval new_value, old_value;
+ double interval = 0.0, value;
+ int argc = SLang_Num_Function_Args;
+
+ if (SLang_peek_at_stack () == SLANG_REF_TYPE)
+ {
+	if (-1 == SLang_pop_ref (&value_ref))
+	 return;
+	argc--;
+	if (SLang_peek_at_stack() == SLANG_REF_TYPE)
+	 {
+	 interval_ref = value_ref;
+	 if (-1 == SLang_pop_ref (&value_ref))
+	 goto free_and_return;
+	 argc--;
+	 }
+ }
+
+ switch (argc)
+ {
+ case 3:
+	if (-1 == SLang_pop_double (&interval))
+	 goto free_and_return;
+	/* drop */
+ case 2:
+ default:
+	if ((-1 == SLang_pop_double (&value))
+	 || (-1 == SLang_pop_int (&w)))
+	 goto free_and_return;
+ }
+
+ double_to_timeval (interval, &new_value.it_interval);
+ double_to_timeval (value, &new_value.it_value);
+
+ if (-1 == setitimer (w, &new_value, &old_value))
+ {
+	SLerrno_set_errno (errno);
+	SLang_verror (SL_OS_Error, "setitimer failed: %s", SLerrno_strerror (errno));
+	goto free_and_return;
+ }
+
+ if (value_ref != NULL)
+ {
+	value = timeval_to_double (&old_value.it_value);
+	if (-1 == SLang_assign_to_ref (value_ref, SLANG_DOUBLE_TYPE, &value))
+	 goto free_and_return;
+ }
+ if (interval_ref != NULL)
+ {
+	interval = timeval_to_double (&old_value.it_interval);
+	if (-1 == SLang_assign_to_ref (interval_ref, SLANG_DOUBLE_TYPE, &interval))
+	 goto free_and_return;
+ }
+
+free_and_return:
+ if (value_ref != NULL)
+ SLang_free_ref (value_ref);
+ if (interval_ref != NULL)
+ SLang_free_ref (interval_ref);
+}
+# endif
+#endif
+
+static SLang_IConstant_Type IConsts =
+{
+#ifdef SLANG_POSIX_SIGNALS
+ MAKE_ICONSTANT("SIG_BLOCK", SIG_BLOCK),
+ MAKE_ICONSTANT("SIG_UNBLOCK", SIG_UNBLOCK),
+ MAKE_ICONSTANT("SIG_SETMASK", SIG_SETMASK),
+#endif
+ MAKE_ICONSTANT("SIG_IGN", SIG_IGN_CONSTANT),
+ MAKE_ICONSTANT("SIG_DFL", SIG_DFL_CONSTANT),
+ MAKE_ICONSTANT("SIG_APP", SIG_APP_CONSTANT),
+#ifdef ITIMER_REAL
+ MAKE_ICONSTANT("ITIMER_REAL", ITIMER_REAL),
+#endif
+#ifdef ITIMER_VIRTUAL
+ MAKE_ICONSTANT("ITIMER_VIRTUAL", ITIMER_VIRTUAL),
+#endif
+#ifdef ITIMER_PROF
+ MAKE_ICONSTANT("ITIMER_PROF", ITIMER_PROF),
+#endif
+ SLANG_END_ICONST_TABLE
+};
+
+static SLang_Intrin_Fun_Type Intrin_Table =
+{
+ MAKE_INTRINSIC_0("signal", signal_intrinsic, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("alarm", alarm_intrinsic, SLANG_VOID_TYPE),
+#ifdef HAVE_SETITIMER
+ MAKE_INTRINSIC_0("setitimer", setitimer_intrinsic, SLANG_VOID_TYPE),
+#endif
+#ifdef HAVE_GETITIMER
+ MAKE_INTRINSIC_1("getitimer", getitimer_intrinsic, SLANG_VOID_TYPE, SLANG_INT_TYPE),
+#endif
+ MAKE_INTRINSIC_0("sigsuspend", sigsuspend_intrinsic, SLANG_VOID_TYPE),
+#ifdef SLANG_POSIX_SIGNALS
+ MAKE_INTRINSIC_0("sigprocmask", sigprocmask_intrinsic, SLANG_VOID_TYPE),
+#endif
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+int SLang_init_signal (void)
+{
+ Signal_Type *s;
+
+ if ((-1 == SLadd_intrin_fun_table(Intrin_Table, NULL))
+ || (-1 == SLadd_iconstant_table (IConsts, NULL)))
+ return -1;
+
+ s = Signal_Table;
+ while (s->name != NULL)
+ {
+	if (-1 == SLns_add_iconstant (NULL, s->name, SLANG_INT_TYPE, s->sig))
+	 return -1;
+
+	s++;
+ }
+
+ return 0;
+}
+#endif				 /* SLANG_HAS_SIGNALS */
+
+int SLsig_forbid_signal (int sig)
+{
+#if SLANG_HAS_SIGNALS
+ Signal_Type *s = find_signal (sig);
+ if (s != NULL)
+ s->forbidden = 1;
+ return 0;
+#else
+ (void) sig;
+ return 0;
+#endif
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slsignal.c Added

@@ -0,0 +1,406 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include <signal.h>
+
+#ifdef HAVE_SYS_TYPES_H
+# include <sys/types.h>
+#endif
+#ifdef HAVE_SYS_WAIT_H
+# include <sys/wait.h>
+#endif
+
+#include <errno.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+/* Do not trust these environments */
+#if defined(__MINGW32__) || defined(AMIGA)
+# ifdef SLANG_POSIX_SIGNALS
+# undef SLANG_POSIX_SIGNALS
+# endif
+#endif
+
+/* This function will cause system calls to be restarted after signal if possible */
+SLSig_Fun_Type *SLsignal (int sig, SLSig_Fun_Type *f)
+{
+#if defined(SLANG_POSIX_SIGNALS)
+ struct sigaction old_sa, new_sa;
+
+# ifdef SIGALRM
+ /* We want system calls to be interrupted by SIGALRM. */
+ if (sig == SIGALRM) return SLsignal_intr (sig, f);
+# endif
+
+ sigemptyset (&new_sa.sa_mask);
+ new_sa.sa_handler = f;
+
+ new_sa.sa_flags = 0;
+# ifdef SA_RESTART
+ new_sa.sa_flags |= SA_RESTART;
+# endif
+
+ while (-1 == sigaction (sig, &new_sa, &old_sa))
+ {
+#ifdef EINTR
+	if (errno == EINTR)
+	 {
+	 if (0 == SLang_handle_interrupt ())
+	 continue;
+	 }
+#endif
+	_pSLerrno_errno = errno;
+	return (SLSig_Fun_Type *) SIG_ERR;
+ }
+
+ return old_sa.sa_handler;
+#else
+ /* Not POSIX. */
+ return signal (sig, f);
+#endif
+}
+
+/* This function will NOT cause system calls to be restarted after
+ * signal if possible
+ */
+SLSig_Fun_Type *SLsignal_intr (int sig, SLSig_Fun_Type *f)
+{
+#ifdef SLANG_POSIX_SIGNALS
+ struct sigaction old_sa, new_sa;
+
+ sigemptyset (&new_sa.sa_mask);
+ new_sa.sa_handler = f;
+
+ new_sa.sa_flags = 0;
+# ifdef SA_INTERRUPT
+ new_sa.sa_flags |= SA_INTERRUPT;
+# endif
+
+ while (-1 == sigaction (sig, &new_sa, &old_sa))
+ {
+# ifdef EINTR
+	if (errno == EINTR)
+	 {
+	 if (0 == SLang_handle_interrupt ())
+	 continue;
+	 }
+#endif
+	_pSLerrno_errno = errno;
+	return (SLSig_Fun_Type *) SIG_ERR;
+ }
+
+ return old_sa.sa_handler;
+#else
+ /* Not POSIX. */
+ return signal (sig, f);
+#endif
+}
+
+/* We are primarily interested in blocking signals that would cause the
+ * application to reset the tty. These include suspend signals and
+ * possibly interrupt signals.
+ */
+#ifdef SLANG_POSIX_SIGNALS
+static sigset_t Old_Signal_Mask;
+#endif
+
+static volatile unsigned int Blocked_Depth;
+
+int SLsig_block_signals (void)
+{
+#ifdef SLANG_POSIX_SIGNALS
+ sigset_t new_mask;
+#endif
+
+ Blocked_Depth++;
+ if (Blocked_Depth != 1)
+ {
+	return 0;
+ }
+
+#ifdef SLANG_POSIX_SIGNALS
+ sigemptyset (&new_mask);
+# ifdef SIGQUIT
+ sigaddset (&new_mask, SIGQUIT);
+# endif
+# ifdef SIGTSTP
+ sigaddset (&new_mask, SIGTSTP);
+# endif
+# ifdef SIGINT
+ sigaddset (&new_mask, SIGINT);
+# endif
+# ifdef SIGTTIN
+ sigaddset (&new_mask, SIGTTIN);
+# endif
+# ifdef SIGTTOU
+ sigaddset (&new_mask, SIGTTOU);
+# endif
+# ifdef SIGWINCH
+ sigaddset (&new_mask, SIGWINCH);
+# endif
+
+ (void) sigprocmask (SIG_BLOCK, &new_mask, &Old_Signal_Mask);
+ return 0;
+#else
+ /* Not implemented. */
+ return -1;
+#endif
+}
+
+int SLsig_unblock_signals (void)
+{
+ if (Blocked_Depth == 0)
+ return -1;
+
+ Blocked_Depth--;
+
+ if (Blocked_Depth != 0)
+ return 0;
+
+#ifdef SLANG_POSIX_SIGNALS
+ (void) sigprocmask (SIG_SETMASK, &Old_Signal_Mask, NULL);
+ return 0;
+#else
+ return -1;
+#endif
+}
+
+#ifdef MSWINDOWS
+int SLsystem (SLFUTURE_CONST char *cmd)
+{
+ _pSLang_verror (SL_NOT_IMPLEMENTED, "system not implemented");
+ return -1;
+}
+int SLsystem_intr (SLFUTURE_CONST char *cmd)
+{
+ return SLsystem (cmd);
+}
+
+#else
+static int system_internal (SLFUTURE_CONST char *cmd, int do_sigint)
+{
+#ifdef SLANG_POSIX_SIGNALS
+ pid_t pid;
+ int status;
+ struct sigaction ignore;
+# ifdef SIGINT
+ struct sigaction save_intr;
+# endif
+# ifdef SIGQUIT
+ struct sigaction save_quit;
+# endif
+# ifdef SIGCHLD
+ sigset_t child_mask, save_mask;
+# endif
+
+ if (cmd == NULL) return 1;
+
+ ignore.sa_handler = SIG_IGN;
+ sigemptyset (&ignore.sa_mask);
+ ignore.sa_flags = 0;
+
+# ifdef SIGINT
+ if (do_sigint
+ && (-1 == sigaction (SIGINT, &ignore, &save_intr)))
+ return -1;
+# endif
+
+# ifdef SIGQUIT
+ if (-1 == sigaction (SIGQUIT, &ignore, &save_quit))
+ {
+	if (do_sigint)
+	 (void) sigaction (SIGINT, &save_intr, NULL);
+	return -1;
+ }
+# endif
+
+# ifdef SIGCHLD
+ sigemptyset (&child_mask);
+ sigaddset (&child_mask, SIGCHLD);
+ if (-1 == sigprocmask (SIG_BLOCK, &child_mask, &save_mask))
+ {
+# ifdef SIGINT
+	if (do_sigint)
+	 (void) sigaction (SIGINT, &save_intr, NULL);
+# endif
+# ifdef SIGQUIT
+	(void) sigaction (SIGQUIT, &save_quit, NULL);
+# endif
+	return -1;
+ }
+# endif
+
+ pid = fork();
+
+ if (pid == -1)
+ {
+	_pSLerrno_errno = errno;
+	status = -1;
+ }
+ else if (pid == 0)
+ {
+	/* Child */
+# ifdef SIGINT
+	if (do_sigint)
+	 (void) sigaction (SIGINT, &save_intr, NULL);
+# endif
+# ifdef SIGQUIT
+	(void) sigaction (SIGQUIT, &save_quit, NULL);
+# endif
+# ifdef SIGCHLD
+	(void) sigprocmask (SIG_SETMASK, &save_mask, NULL);
+# endif
+
+	execl ("/bin/sh", "sh", "-c", cmd, (char *)NULL);
+	_exit (127);
+ }
+ else
+ {
+	/* parent */
+	while (-1 == waitpid (pid, &status, 0))
+	 {
+# ifdef EINTR
+	 if (errno == EINTR)
+	 {
+		 (void) SLang_handle_interrupt ();
+		 continue;
+	 }
+# endif
+# ifdef ERESTARTSYS
+	 if (errno == ERESTARTSYS)
+	 {
+		 (void) SLang_handle_interrupt ();
+		 continue;
+	 }
+# endif
+	 _pSLerrno_errno = errno;
+	 status = -1;
+	 break;
+	 }
+ }
+# ifdef SIGINT
+ if (do_sigint
+ && (-1 == sigaction (SIGINT, &save_intr, NULL)))
+ status = -1;
+# endif
+# ifdef SIGQUIT
+ if (-1 == sigaction (SIGQUIT, &save_quit, NULL))
+ status = -1;
+# endif
+# ifdef SIGCHLD
+ if (-1 == sigprocmask (SIG_SETMASK, &save_mask, NULL))
+ status = -1;
+# endif
+
+ return status;
+
+#else				 /* No POSIX Signals */
+# ifdef SIGINT
+ void (*sint)(int);
+# endif
+# ifdef SIGQUIT
+ void (*squit)(int);
+# endif
+ int status;
+
+# ifdef SIGQUIT
+ squit = SLsignal (SIGQUIT, SIG_IGN);
+# endif
+# ifdef SIGINT
+ if (do_sigint)
+ sint = SLsignal (SIGINT, SIG_IGN);
+# endif
+
+ status = system (cmd);
+ _pSLerrno_errno = errno;
+
+# ifdef SIGINT
+ if (do_sigint)
+ SLsignal (SIGINT, sint);
+# endif
+# ifdef SIGQUIT
+ SLsignal (SIGQUIT, squit);
+# endif
+ return status;
+#endif				 /* POSIX_SIGNALS */
+}
+
+int SLsystem (SLFUTURE_CONST char *cmd)
+{
+ return system_internal (cmd, 1);
+}
+
+int SLsystem_intr (SLFUTURE_CONST char *cmd)
+{
+ return system_internal (cmd, 0);
+}
+
+#endif
+
+#if 0
+#include <windows.h>
+static int msw_system (char *cmd)
+{
+ STARTUPINFO startup_info;
+ PROCESS_INFORMATION process_info;
+ int status;
+
+ if (cmd == NULL) return -1;
+
+ memset ((char *) &startup_info, 0, sizeof (STARTUPINFO));
+ startup_info.cb = sizeof(STARTUPINFO);
+ startup_info.dwFlags = STARTF_USESHOWWINDOW;
+ startup_info.wShowWindow = SW_SHOWDEFAULT;
+
+ if (FALSE == CreateProcess (NULL,
+			 cmd,
+			 NULL,
+			 NULL,
+			 FALSE,
+			 NORMAL_PRIORITY_CLASS|CREATE_NEW_CONSOLE,
+			 NULL,
+			 NULL,
+			 &startup_info,
+			 &process_info))
+ {
+	_pSLang_verror (0, "%s: CreateProcess failed.", cmd);
+	return -1;
+ }
+
+ status = -1;
+
+ if (0xFFFFFFFFUL != WaitForSingleObject (process_info.hProcess, INFINITE))
+ {
+	DWORD exit_code;
+
+	if (TRUE == GetExitCodeProcess (process_info.hProcess, &exit_code))
+	 status = (int) exit_code;
+ }
+
+ CloseHandle (process_info.hThread);
+ CloseHandle (process_info.hProcess);
+
+ return status;
+}
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/slsmg.c Added

@@ -0,0 +1,2301 @@
+/* SLang Screen management routines */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include "slinclud.h"
+
+#include <stdio.h>
+#include <string.h>
+#include "slang.h"
+#include "_slang.h"
+
+typedef struct
+ {
+ int n; /* number of chars written last time */
+ int flags; /* line untouched, etc... */
+ SLsmg_Char_Type *old, *neew;
+#ifndef IBMPC_SYSTEM
+ unsigned long old_hash, new_hash;
+#endif
+ }
+Screen_Type;
+
+#define TOUCHED 0x1
+#define TRASHED 0x2
+static int Screen_Trashed;
+
+static Screen_Type SL_ScreenSLTT_MAX_SCREEN_ROWS;
+static int Start_Col, Start_Row;
+static unsigned int Screen_Cols, Screen_Rows;
+static int This_Row, This_Col;
+static SLsmg_Color_Type This_Color;
+
+static int UTF8_Mode = -1;
+
+#if SLTT_HAS_NON_BCE_SUPPORT && !defined(IBMPC_SYSTEM)
+#define REQUIRES_NON_BCE_SUPPORT 1
+static int Bce_Color_Offset;
+#endif
+
+int SLsmg_Newline_Behavior = SLSMG_NEWLINE_IGNORED;
+int SLsmg_Backspace_Moves = 0;
+
+#if SLSMG_HAS_EMBEDDED_ESCAPE
+/* If non-zero, interpret escape sequences ESC x m as an embedded set color
+ * sequence. The 'x' is a decimal integer that specifies the color. The sequence
+ * ends at m. Examples: \e3m --> set color 3. \e272m --> color=272.
+ * Note: These escape sequences are NOT ANSI, though similar. ANSI permits
+ * sequences such as \e32;44m to set the foreground to green/blue. This interface
+ * will support such sequences, _but_ in will map such squences to the sum of
+ * the colors: \e32;44m --> color (32+44)=76.
+ *
+ * In addition to 'm', '' is also supported.
+ */
+static int Embedded_Escape_Mode = 0;
+int SLsmg_embedded_escape_mode (int mode)
+{
+ int old_mode = Embedded_Escape_Mode;
+ Embedded_Escape_Mode = mode;
+ return old_mode;
+}
+
+/* This function gets called with u pointing at what may be ''. If it sucessfully
+ * parses the escape sequence, *up and the color will be updated.
+ */
+static int parse_embedded_escape (SLuchar_Type *u, SLuchar_Type *umax,
+				 SLsmg_Color_Type default_color,
+				 SLuchar_Type **up, SLsmg_Color_Type *colorp)
+{
+ unsigned int val;
+ SLuchar_Type ch;
+
+ if ((u < umax) && (*u != ''))
+ return -1;
+
+ u++;
+ if ((u < umax) && ((*u == 'm') || (*u == '')))
+ {
+	*colorp = default_color; /* ESCm */
+	*up = u+1;
+	return 0;
+ }
+
+ val = 0;
+ while ((u < umax)
+	 && (((ch = *u) >= '0') && (ch <= '9')))
+ {
+	val = 10*val + (ch - '0');
+	u++;
+ }
+ if ((u < umax) && ((*u == 'm') || (*u == '')) && (val <= SLSMG_MAX_COLORS))
+ {
+# ifdef REQUIRES_NON_BCE_SUPPORT
+	val += Bce_Color_Offset;
+#endif
+	*colorp = (SLsmg_Color_Type) val;
+	*up = u + 1;
+	return 0;
+ }
+ return -1;
+}
+
+static void parse_embedded_set_color (SLuchar_Type *u, SLuchar_Type *umax,
+				 SLsmg_Color_Type default_color)
+{
+ SLsmg_Color_Type color = default_color;
+
+ while (u < umax)
+ {
+	if (*u++ == 033)
+	 (void) parse_embedded_escape (u, umax, default_color, &u, &color);
+ }
+ if (color == default_color)
+ return;
+
+#ifdef REQUIRES_NON_BCE_SUPPORT
+ color -= Bce_Color_Offset;
+#endif
+ SLsmg_set_color (color);
+}
+#endif
+
+/* Backward compatibility. Not used. */
+/* int SLsmg_Newline_Moves; */
+static int *tt_Screen_Rows = NULL;
+static int *tt_Screen_Cols = NULL;
+static int *tt_unicode_ok;
+
+static void (*tt_normal_video)(void);
+static void (*tt_goto_rc)(int, int);
+static void (*tt_cls) (void);
+static void (*tt_del_eol) (void);
+static void (*tt_smart_puts) (SLsmg_Char_Type *, SLsmg_Char_Type *, int, int);
+static int (*tt_flush_output) (void);
+static int (*tt_reset_video) (void);
+static int (*tt_init_video) (void);
+
+#ifndef IBMPC_SYSTEM
+static void (*tt_set_scroll_region)(int, int);
+static void (*tt_reverse_index)(int);
+static void (*tt_reset_scroll_region)(void);
+static void (*tt_delete_nlines)(int);
+#endif
+
+#ifndef IBMPC_SYSTEM
+static int *tt_Term_Cannot_Scroll;
+static int *tt_Has_Alt_Charset;
+static char **tt_Graphics_Char_Pairs;
+#else
+static int *tt_Has_Alt_Charset = NULL;
+static char **tt_Graphics_Char_Pairs = NULL;
+#endif
+
+static int Smg_Mode = 0;
+#define SMG_MODE_NONE		0
+#define SMG_MODE_FULLSCREEN	1
+#define SMG_MODE_CMDLINE	2
+
+/* This is necessary because the windoze run-time linker cannot perform
+ * relocations on its own.
+ */
+static void init_tt_symbols (void)
+{
+ tt_Screen_Rows = &SLtt_Screen_Rows;
+ tt_Screen_Cols = &SLtt_Screen_Cols;
+ tt_unicode_ok = &_pSLtt_UTF8_Mode;
+
+ tt_normal_video = SLtt_normal_video;
+ tt_goto_rc = SLtt_goto_rc;
+ tt_cls = SLtt_cls;
+ tt_del_eol = SLtt_del_eol;
+ tt_smart_puts = SLtt_smart_puts;
+ tt_flush_output = SLtt_flush_output;
+ tt_reset_video = SLtt_reset_video;
+ tt_init_video = SLtt_init_video;
+
+#ifndef IBMPC_SYSTEM
+ tt_set_scroll_region = SLtt_set_scroll_region;
+ tt_reverse_index = SLtt_reverse_index;
+ tt_reset_scroll_region = SLtt_reset_scroll_region;
+ tt_delete_nlines = SLtt_delete_nlines;
+#endif
+
+#ifndef IBMPC_SYSTEM
+ tt_Term_Cannot_Scroll = &SLtt_Term_Cannot_Scroll;
+ tt_Has_Alt_Charset = &SLtt_Has_Alt_Charset;
+ tt_Graphics_Char_Pairs = &SLtt_Graphics_Char_Pairs;
+#else
+ tt_Has_Alt_Charset = NULL;
+ tt_Graphics_Char_Pairs = NULL;
+#endif
+}
+
+/* Unicode box drawing characters */
+
+/* This lookup table is indexed by the vt100 characters */
+static SLwchar_Type ACS_Map128;
+
+typedef struct
+{
+ unsigned char vt100_char;
+ unsigned char ascii;
+ SLwchar_Type unicode;	 /* may have an ambiguous width */
+ SLwchar_Type unicode_narrow;	 /* has a narrow width */
+}
+ACS_Def_Type;
+
+static SLCONST ACS_Def_Type UTF8_ACS_Map =
+{
+ {'+', '>', 0x2192, '>'}, /* RIGHTWARDS ARROW A */
+ {',', '<', 0x2190, '<'}, /* LEFTWARDS ARROW A */
+ {'-', '^', 0x2191, 0x2303}, /* UPWARDS ARROW A */
+ {'.', 'v', 0x2193, 0x2304}, /* DOWNWARDS ARROW A */
+ {'0', '#', 0x25AE, '#'}, /* BLACK VERTICAL RECTANGLE */
+ {'`', '+', 0x25C6, 0x2666}, /* BLACK DIAMOND A */
+ {'a', ':', 0x2592, ':'}, /* MEDIUM SHADE A */
+ {'f', '\'', 0x00B0, 0xFF9F},/* DEGREE SIGN A */
+ {'g', '#', 0x00B1, '#'}, /* PLUS-MINUS SIGN A */
+ {'h', '#', 0x2592, '#'}, /* MEDIUM SHADE A */
+ {'i', '#', 0x2603, '#'}, /* SNOWMAN A */
+ {'j', '+', 0x2518, '+'}, /* BOX DRAWINGS LIGHT UP AND LEFT */
+ {'k', '+', 0x2510, '+'}, /* BOX DRAWINGS LIGHT DOWN AND LEFT */
+ {'l', '+', 0x250c, '+'}, /* BOX DRAWINGS LIGHT DOWN AND RIGHT */
+ {'m', '+', 0x2514, '+'}, /* BOX DRAWINGS LIGHT UP AND RIGHT */
+ {'n', '+', 0x253C, '+'}, /* BOX DRAWINGS LIGHT VERTICAL AND HORIZONTAL */
+ {'o', '~', 0x23BA, '~'}, /* HORIZONTAL SCAN LINE-1 */
+ {'p', '-', 0x23BB, '-'}, /* HORIZONTAL SCAN LINE-3 (ncurses addition) */
+ {'q', '-', 0x2500, '-'}, /* BOX DRAWINGS LIGHT HORIZONTAL */
+ {'r', '-', 0x23BC, '-'}, /* HORIZONTAL SCAN LINE-7 (ncurses addition) */
+ {'s', '_', 0x23BD, '_'}, /* HORIZONTAL SCAN LINE-9 */
+ {'t', '+', 0x251C, '+'}, /* BOX DRAWINGS LIGHT VERTICAL AND RIGHT */
+ {'u', '+', 0x2524, '+'}, /* BOX DRAWINGS LIGHT VERTICAL AND LEFT */
+ {'v', '+', 0x2534, '+'}, /* BOX DRAWINGS LIGHT UP AND HORIZONTAL */
+ {'w', '+', 0x252C, '+'}, /* BOX DRAWINGS LIGHT DOWN AND HORIZONTAL */
+ {'x', '|', 0x2502, '|'}, /* BOX DRAWINGS LIGHT VERTICAL */
+ {'y', '<', 0x2264, '<'}, /* LESS-THAN OR EQUAL TO (ncurses addition) */
+ {'z', '>', 0x2265, '>'}, /* GREATER-THAN OR EQUAL TO (ncurses addition) */
+ {'{', '*', 0x03C0, '*'}, /* GREEK SMALL LETTER PI (ncurses addition) */
+ {'|', '!', 0x2260, '!'}, /* NOT EQUAL TO (ncurses addition) */
+ {'}', 'f', 0x00A3, 'f'}, /* POUND SIGN (ncurses addition) */
+ {'~', 'o', 0x00B7, 0xFF65}, /* MIDDLE DOT */
+ {0, 0, 0, 0}
+};
+
+#define ACS_MODE_NONE	 -1
+#define ACS_MODE_AUTO		0
+#define ACS_MODE_UNICODE	1
+#define ACS_MODE_TERMINFO	2
+#define ACS_MODE_ASCII		3
+
+static int Current_ACS_Mode = ACS_MODE_NONE;
+static void init_acs (int mode)
+{
+ unsigned int i;
+ SLCONST ACS_Def_Type *acs;
+
+ if (Current_ACS_Mode == mode)
+ return;
+
+ for (i = 0; i < 0x80; i++)
+ ACS_Mapi = ' ';
+
+ if (mode == ACS_MODE_AUTO)
+ {
+	if (UTF8_Mode &&
+	 (tt_unicode_ok != NULL) && (*tt_unicode_ok > 0))
+	 mode = ACS_MODE_UNICODE;
+	else
+	 mode = ACS_MODE_TERMINFO;
+ }
+
+ switch (mode)
+ {
+ case ACS_MODE_UNICODE:
+	SLsmg_Display_Eight_Bit = 0xA0;
+	acs = UTF8_ACS_Map;
+	while (acs->vt100_char != 0)
+	 {
+	 SLwchar_Type wch = acs->unicode;
+	 if (SLwchar_wcwidth (wch) != 1)
+	 wch = acs->unicode_narrow;
+	 ACS_Mapacs->vt100_char = wch;
+	 acs++;
+	 }
+	break;
+
+ case ACS_MODE_TERMINFO:
+	if ((tt_Has_Alt_Charset != NULL)
+	 && *tt_Has_Alt_Charset
+	 && (tt_Graphics_Char_Pairs != NULL)
+	 && (*tt_Graphics_Char_Pairs != NULL))
+	 {
+	 unsigned char *p = (unsigned char *) *tt_Graphics_Char_Pairs;
+	 unsigned char *pmax = p + strlen ((char *) p);
+
+	 while (p < pmax)
+	 {
+		 unsigned char ch = *p++;
+		 ACS_Mapch & 0x7F = *p++;
+	 }
+	 break;
+	 }
+	mode = ACS_MODE_ASCII;
+	/* drop */
+ case ACS_MODE_ASCII:
+ default:
+	acs = UTF8_ACS_Map;
+	while (acs->vt100_char != 0)
+	 {
+	 ACS_Mapacs->vt100_char = acs->ascii;
+	 acs++;
+	 }
+	break;
+ }
+
+ Current_ACS_Mode = mode;
+}
+
+static void blank_line (SLsmg_Char_Type *c, unsigned int n, SLwchar_Type wch)
+{
+ SLsmg_Char_Type *cmax = c + n;
+ SLsmg_Color_Type color = This_Color;
+
+ memset ((char *)c, 0, n*sizeof(SLsmg_Char_Type));
+ while (c < cmax)
+ {
+	c->nchars = 1;
+	c->wchars0 = wch;
+	c->color = color;
+	c++;
+ }
+}
+
+static void clear_region (int row, int n, SLwchar_Type ch)
+{
+ int i;
+ int imax = row + n;
+
+ if (imax > (int) Screen_Rows) imax = (int) Screen_Rows;
+ if (row < 0)
+ row = 0;
+
+ for (i = row; i < imax; i++)
+ {
+	blank_line (SL_Screeni.neew, Screen_Cols, ch);
+	SL_Screeni.flags |= TOUCHED;
+ }
+}
+
+void SLsmg_erase_eol (void)
+{
+ int r, c;
+
+ if (Smg_Mode == SMG_MODE_NONE) return;
+
+ c = This_Col - Start_Col;
+ r = This_Row - Start_Row;
+
+ if ((r < 0) || (r >= (int)Screen_Rows)) return;
+ if (c < 0) c = 0; else if (c >= (int)Screen_Cols) return;
+ blank_line (SL_ScreenThis_Row.neew + c , Screen_Cols - c, 0x20);
+ SL_ScreenThis_Row.flags |= TOUCHED;
+}
+
+static void scroll_up (void)
+{
+ unsigned int i, imax;
+ SLsmg_Char_Type *neew;
+
+ neew = SL_Screen0.neew;
+ imax = Screen_Rows - 1;
+ for (i = 0; i < imax; i++)
+ {
+	SL_Screeni.neew = SL_Screeni + 1.neew;
+	SL_Screeni.flags |= TOUCHED;
+ }
+ SL_Screeni.neew = neew;
+ SL_Screeni.flags |= TOUCHED;
+ blank_line (neew, Screen_Cols, 0x20);
+ This_Row--;
+}
+
+void SLsmg_gotorc (int r, int c)
+{
+ This_Row = r;
+ This_Col = c;
+}
+
+int SLsmg_get_row (void)
+{
+ return This_Row;
+}
+
+int SLsmg_get_column (void)
+{
+ return This_Col;
+}
+
+void SLsmg_erase_eos (void)
+{
+ if (Smg_Mode == SMG_MODE_NONE) return;
+
+ SLsmg_erase_eol ();
+ clear_region (This_Row + 1, (int)Screen_Rows, 0x20);
+}
+
+static int This_Alt_Char;
+
+void SLsmg_set_char_set (int i)
+{
+#ifdef IBMPC_SYSTEM
+ (void) i;
+#else
+ if (i != 0)
+ This_Alt_Char = SLSMG_ACS_MASK;
+ else This_Alt_Char = 0;
+
+ This_Color &= SLSMG_COLOR_MASK;
+ This_Color |= This_Alt_Char;
+#endif
+}
+
+void SLsmg_set_color (SLsmg_Color_Type color)
+{
+#ifdef REQUIRES_NON_BCE_SUPPORT
+ color += Bce_Color_Offset;
+#endif
+ This_Color = color | This_Alt_Char;
+}
+
+void SLsmg_reverse_video (void)
+{
+ SLsmg_set_color (1);
+}
+
+void SLsmg_normal_video (void)
+{
+ SLsmg_set_color (0);
+}
+
+static int point_visible (int col_too)
+{
+ return ((This_Row >= Start_Row) && (This_Row < Start_Row + (int)Screen_Rows)
+	 && ((col_too == 0)
+	 || ((This_Col >= Start_Col)
+		 && (This_Col < Start_Col + (int)Screen_Cols))));
+}
+
+#define NEXT_CHAR_CELL \
+ { \
+ if (p < pmax) \
+	{ \
+	 if ((p->nchars != i) || (p->color != color)) flags |= TOUCHED; \
+	 p->nchars = i; \
+	 p->color = color; \
+	 p++; \
+	} \
+ i = 0; \
+ col++; \
+ } (void) 0
+
+#define ADD_TO_CHAR_CELL(wc) \
+ { \
+ if ((p < pmax) && (p->wcharsi != wc)) \
+	{ \
+	 p->wcharsi = wc; \
+	 flags |= TOUCHED; \
+	} \
+ i++; \
+ } (void) 0
+
+#define ADD_CHAR_OR_BREAK(ch) \
+ if (col >= start_col) \
+ { \
+	 if (i != 0) NEXT_CHAR_CELL; \
+	 if (last_was_double_width) \
+	 { \
+	 last_was_double_width = 0; \
+	 NEXT_CHAR_CELL; \
+	 } \
+	 if (col >= max_col) break; \
+	 ADD_TO_CHAR_CELL(ch); \
+ } \
+ else col++
+
+void SLsmg_write_chars (unsigned char *u, unsigned char *umax)
+{
+ SLsmg_Char_Type *p, *pmax;
+ SLsmg_Color_Type color;
+ int flags;
+ int col, start_col, max_col;
+ int newline_flag;
+ int utf8_mode = UTF8_Mode;
+ unsigned char display_8bit;
+ int last_was_double_width = 0;
+ int alt_char_set_flag;
+ unsigned int i;
+ int wrap_mode;
+#if SLSMG_HAS_EMBEDDED_ESCAPE
+ SLsmg_Color_Type default_color;
+#endif
+ if (Smg_Mode == SMG_MODE_NONE) return;
+ if (u >= umax)
+ return;
+
+ wrap_mode = (Smg_Mode == SMG_MODE_CMDLINE);
+
+ display_8bit = (unsigned char) SLsmg_Display_Eight_Bit;
+ if (utf8_mode)
+ display_8bit = 0xA0;
+
+ color = This_Color;
+ /* If we are using unicode characters for the line drawing characters, then
+ * do not attempt to use the terminals alternate character set
+ */
+ alt_char_set_flag = (color & SLSMG_ACS_MASK);
+ if (Current_ACS_Mode == ACS_MODE_UNICODE)
+ color = color & ~SLSMG_ACS_MASK;
+
+#if SLSMG_HAS_EMBEDDED_ESCAPE
+ default_color = color;	 /* used for ESCm */
+#endif
+
+ top:				 /* get here only on newline */
+
+ newline_flag = 0;
+ start_col = Start_Col;
+
+ if (point_visible (0) == 0) return;
+
+ col = This_Col;
+ max_col = start_col + Screen_Cols;
+
+ p = SL_ScreenThis_Row - Start_Row.neew;
+ pmax = p + Screen_Cols;
+
+ if (col >= start_col)
+ {
+	p += (col - start_col);
+	if ((p < pmax) && (p->nchars == 0))
+	 {
+	 /* It looks like we are about to overwrite the right side of a
+	 * double width character. Let's see...
+	 */
+	 if (col > start_col)
+	 {
+		 p--;
+		 if (p->nchars != 0)
+		 {
+		 p->nchars = 1;
+		 p->wchars0 = ' ';
+		 }
+		 p++;
+	 }
+	 }
+ }
+
+ flags = SL_ScreenThis_Row - Start_Row.flags;
+ i = 0;
+
+ while (u < umax)
+ {
+	SLwchar_Type wc;
+	unsigned int width;
+	SLstrlen_Type nconsumed;
+
+ 	if (*u < (SLuchar_Type) 0x80)		 /* ASCII */
+	 {
+	 unsigned char ch;
+
+	 ch = (unsigned char) *u;
+
+	 if (alt_char_set_flag)
+	 {
+		 wc = ACS_Mapch;
+		 ADD_CHAR_OR_BREAK(wc);
+		 u++;
+		 continue;
+	 }
+
+	 if ((ch >= (SLuchar_Type)0x20) && (ch < (SLuchar_Type)0x7F))
+	 {
+		 ADD_CHAR_OR_BREAK(ch);
+		 u++;
+		 continue;
+	 }
+
+	 if ((ch == '\t') && (SLsmg_Tab_Width > 0))
+	 {
+		 int bump_u = 0;
+		 do
+		 {
+		 if (col < start_col)
+			 {
+			 col++;
+			 bump_u = 1;
+			 }
+		 else
+			 {
+			 ADD_CHAR_OR_BREAK(' ');
+			 NEXT_CHAR_CELL;
+			 bump_u = 1;
+			 }
+		 }
+		 while (col % SLsmg_Tab_Width);
+		 if (bump_u)
+		 u++;
+		 if (col >= max_col)
+		 break;
+
+		 continue;
+	 }
+
+	 if ((ch == '\n')
+		 && (SLsmg_Newline_Behavior != SLSMG_NEWLINE_PRINTABLE))
+	 {
+		 u++;		 /* eat \n */
+		 newline_flag = 1;
+		 break;
+	 }
+
+	 if ((ch == 0x8) && SLsmg_Backspace_Moves)
+	 {
+		 if (col != 0)
+		 {
+		 if (i != 0)
+			 {
+			 NEXT_CHAR_CELL;
+			 col--;
+			 p--;
+			 }
+		 col--;
+		 p--;
+		 }
+		 u++;
+		 continue;
+	 }
+#if SLSMG_HAS_EMBEDDED_ESCAPE
+	 if ((ch == 033) && Embedded_Escape_Mode)
+	 {
+		 SLsmg_Color_Type next_color;
+
+		 u++;
+		 if (0 == parse_embedded_escape (u, umax, default_color, &u, &next_color))
+		 {
+		 if (i != 0)
+			 NEXT_CHAR_CELL;
+		 color = next_color;
+		 continue;
+		 }
+		 u--;
+	 }
+#endif
+	 ADD_CHAR_OR_BREAK('^');
+	 u++;
+	 if (ch == 127) ch = '?'; else ch = ch + '@';
+	 ADD_CHAR_OR_BREAK (ch);
+	 continue;
+	 }
+
+	nconsumed = 1;
+	if ((utf8_mode == 0)
+	 || (NULL == SLutf8_decode (u, umax, &wc, &nconsumed)))
+	 {
+	 unsigned int ii, jj;
+	 unsigned char hexbuf8;
+
+	 if ((utf8_mode == 0)
+		 && display_8bit && (*u >= display_8bit))
+	 {
+		 ADD_CHAR_OR_BREAK(*u);
+		 u += nconsumed;
+		 continue;
+	 }
+
+	 for (ii = 0; ii < nconsumed; ii++)
+	 {
+		 sprintf ((char *)hexbuf, "<%02X>", *u);
+		 for (jj = 0; jj < 4; jj++)
+		 {
+		 ADD_CHAR_OR_BREAK (hexbufjj);
+		 }
+		 if (jj == 0)
+		 break;
+		 u++;
+	 }
+	 if (ii != nconsumed)
+	 break;
+
+	 continue;
+	 }
+
+	if (wc < (SLwchar_Type)display_8bit)
+	 {
+	 unsigned char hexbuf8;
+	 unsigned int jj;
+
+	 sprintf ((char *)hexbuf, "<%02X>", (unsigned char) wc);
+	 for (jj = 0; jj < 4; jj++)
+	 {
+		 ADD_CHAR_OR_BREAK (hexbufjj);
+	 }
+	 if (jj == 0)
+	 break;
+	 u += nconsumed;
+	 continue;
+	 }
+
+	width = SLwchar_wcwidth (wc);
+	if (width == 0)
+	 {
+	 /* Combining character--- must follow non-zero width char */
+	 u += nconsumed;
+	 if (i == 0)
+	 continue;
+	 if (i < SLSMG_MAX_CHARS_PER_CELL)
+	 {
+		 ADD_TO_CHAR_CELL (wc);
+	 }
+	 continue;
+	 }
+
+	if (width == 2)
+	 {
+	 if (col + 2 <= start_col)
+	 {
+		 u += nconsumed;
+		 col += 2;
+		 continue;
+	 }
+
+	 if (col + 1 == start_col)
+	 {
+		 /* double width character is clipped at left part of screen.
+		 * So, display right edge as a space
+		 */
+		 u += nconsumed;
+		 col++;	 /* left edge */
+		 ADD_CHAR_OR_BREAK('<');
+		 continue;
+	 }
+
+	 if (i != 0) 	 /* finish active cell */
+	 NEXT_CHAR_CELL;
+
+	 if (last_was_double_width)
+	 {
+		 /* and right half of the cell */
+		 last_was_double_width = 0;
+		 NEXT_CHAR_CELL;
+	 }
+
+	 if (col + 2 > max_col)
+	 {
+		 /* right side of character gets clipped */
+		 ADD_TO_CHAR_CELL('>');
+		 u += nconsumed;
+		 col++;
+		 break;
+	 }
+	 ADD_CHAR_OR_BREAK(wc);
+	 last_was_double_width = 1;
+	 u += nconsumed;
+	 continue;
+	 }
+	ADD_CHAR_OR_BREAK(wc);
+	u += nconsumed;
+ }
+
+ if (i != 0)
+ {
+	NEXT_CHAR_CELL;
+ }
+
+ if (last_was_double_width)
+ {
+	if (col < max_col)
+	 NEXT_CHAR_CELL;
+	last_was_double_width = 0;
+ }
+ else if ((col < max_col) && (p->nchars == 0))
+ {
+	/* The left side of a double with character was overwritten */
+	p->nchars = 1;
+	p->wchars0 = ' ';
+ }
+ SL_ScreenThis_Row - Start_Row.flags = flags;
+ This_Col = col;
+
+ /* Why would u be NULL here?? */
+
+ if ((SLsmg_Newline_Behavior == SLSMG_NEWLINE_IGNORED)
+ && (wrap_mode == 0))
+ {
+#if SLSMG_HAS_EMBEDDED_ESCAPE
+	if (Embedded_Escape_Mode && (u != NULL))
+	 parse_embedded_set_color (u, umax, default_color);
+#endif
+	return;
+ }
+
+ if (u >= umax)
+ {
+	if ((wrap_mode && (col >= max_col))
+	 || newline_flag)
+	 {
+	 This_Col = 0;
+	 This_Row++;
+	 }
+	return;
+ }
+
+ if ((newline_flag == 0) && (wrap_mode == 0))
+ {
+#if SLSMG_HAS_EMBEDDED_ESCAPE
+	SLuchar_Type *usave = u;
+#endif
+	if (u == NULL)
+	 return;
+
+	while (u < umax)
+	 {
+	 if (*u == '\n') break;
+	 u++;
+	 }
+	if (u >= umax)
+	 {
+#if SLSMG_HAS_EMBEDDED_ESCAPE
+	 if (Embedded_Escape_Mode)
+	 parse_embedded_set_color (usave, umax, default_color);
+#endif
+	 return;
+	 }
+	u++;
+ }
+
+ This_Row++;
+ This_Col = 0;
+ if (This_Row == Start_Row + (int)Screen_Rows)
+ {
+	if (SLsmg_Newline_Behavior == SLSMG_NEWLINE_SCROLLS) scroll_up ();
+ }
+ goto top;
+}
+
+void SLsmg_write_nchars (SLFUTURE_CONST char *str, unsigned int len)
+{
+ SLsmg_write_chars ((unsigned char *) str, (unsigned char *)str + len);
+}
+
+void SLsmg_write_string (SLFUTURE_CONST char *str)
+{
+ SLsmg_write_chars ((unsigned char *)str,
+		 (unsigned char *)str + strlen (str));
+}
+
+void SLsmg_write_wrapped_string (SLuchar_Type *u, int r, int c,
+				 unsigned int dr, unsigned int dc,
+				 int fill)
+{
+ int maxc = (int) dc;
+ unsigned char *p, *pmax;
+ int utf8_mode = UTF8_Mode;
+ unsigned char display_8bit = (unsigned char) SLsmg_Display_Eight_Bit;
+
+ if (utf8_mode)
+ display_8bit = 0xA0;
+
+ if ((dr == 0) || (dc == 0)) return;
+ if (u == NULL)
+ u = (unsigned char *)"";
+
+ p = u;
+ pmax = u + strlen ((char *)u);
+
+ dc = 0;
+ while (1)
+ {
+	SLwchar_Type wc;
+	SLstrlen_Type nconsumed;
+	unsigned char ch = *p;
+	unsigned int ddc;
+
+	if ((ch == 0) || (ch == '\n'))
+	 {
+	 int diff;
+
+	 diff = maxc - (int) dc;
+
+	 SLsmg_gotorc (r, c);
+	 SLsmg_write_chars (u, p);
+	 if (fill && (diff > 0))
+	 {
+		 unsigned char *blank = (unsigned char *)" ";
+		 while (diff--) SLsmg_write_chars (blank, blank+1);
+	 }
+	 if ((ch == 0) || (dr == 1)) break;
+
+	 r++;
+	 dc = 0;
+	 dr--;
+	 p++;
+	 u = p;
+	 continue;
+	 }
+
+	/* If the width of the characters buffered so far extend to or beyond
+	 * the width of the box, then write them out and goto the
+	 * next line. Note that dc > maxc if the displayable width of
+	 * the last character to be written is greater than the width
+	 * of the box. This will be the case if (maxc<ddc) -- see below
+	 */
+	if ((int) dc >= maxc)
+	 goto write_chars_and_reset;
+
+	nconsumed = 1;
+	if (ch < 0x80)
+	 {
+	 p++;
+	 if ((ch >= 0x20) && (ch != 0x7F))
+	 {
+		 dc++;
+		 continue;
+	 }
+	 /* Otherwise display as ^X */
+	 dc += 2;
+	 continue;
+	 }
+
+	nconsumed = 1;
+	if ((utf8_mode == 0)
+	 || (NULL == SLutf8_decode (p, pmax, &wc, &nconsumed)))
+	 {
+	 if ((utf8_mode == 0)
+		 && (display_8bit && (*p >= display_8bit)))
+	 {
+		 dc++;
+		 p += nconsumed;
+		 continue;
+	 }
+
+	 ddc = 4*nconsumed; /* <XX> */
+	 }
+	else if (wc < (SLwchar_Type)display_8bit)
+	 ddc = 4;		 /* displays as <XX> */
+	else
+	 ddc = SLwchar_wcwidth (wc);
+
+	dc += ddc;
+	if (((int)dc > maxc) && (maxc > (int)ddc))
+	 {
+	 dc -= ddc;
+	 goto write_chars_and_reset;
+	 }
+	p += nconsumed;
+	continue;
+
+	write_chars_and_reset:
+	SLsmg_gotorc (r, c);
+	SLsmg_write_chars (u, p);
+	while ((int)dc < maxc)
+	 {
+	 SLsmg_write_char (' ');
+	 dc++;
+	 }
+	if (dr == 1) break;
+	r++;
+	dc = 0;
+	dr--;
+	u = p;
+ }
+}
+
+void SLsmg_write_nstring (SLFUTURE_CONST char *str, unsigned int n)
+{
+ /* Avoid a problem if a user accidently passes a negative value */
+ if ((int) n < 0)
+ return;
+
+ SLsmg_write_wrapped_string ((unsigned char *)str, This_Row, This_Col, 1, n, 1);
+}
+
+int SLsmg_Tab_Width = 8;
+
+/* Minimum value for which eight bit char is displayed as is. */
+
+#ifndef IBMPC_SYSTEM
+int SLsmg_Display_Eight_Bit = 160;
+#else
+int SLsmg_Display_Eight_Bit = 128;
+#endif
+
+void SLsmg_write_char (SLwchar_Type ch)
+{
+ unsigned char uSLUTF8_MAX_MBLEN;
+ unsigned char *umax;
+
+ if ((ch < 0x80) || (UTF8_Mode == 0))
+ {
+	u0 = (unsigned char) ch;
+	SLsmg_write_chars (u, u+1);
+	return;
+ }
+ if (NULL == (umax = SLutf8_encode (ch, u, SLUTF8_MAX_MBLEN)))
+ return;
+ SLsmg_write_chars (u, umax);
+}
+
+static int Cls_Flag;
+
+void SLsmg_cls (void)
+{
+ int tac;
+ if (Smg_Mode == SMG_MODE_NONE) return;
+
+ tac = This_Alt_Char; This_Alt_Char = 0;
+ SLsmg_set_color (0);
+ clear_region (0, (int)Screen_Rows, 0x20);
+ This_Alt_Char = tac;
+ SLsmg_set_color (0);
+ Cls_Flag = 1;
+}
+
+#ifndef IBMPC_SYSTEM
+int SLsmg_Scroll_Hash_Border = 0;
+static unsigned long compute_hash (SLsmg_Char_Type *c, unsigned int n)
+{
+ SLsmg_Char_Type *cmin, *cmax;
+ int is_blank = 2;
+
+ cmin = c;
+ cmax = c + n;
+
+ if (SLsmg_Scroll_Hash_Border > 0)
+ {
+	cmax -= SLsmg_Scroll_Hash_Border;
+	cmin += SLsmg_Scroll_Hash_Border;
+ }
+
+ c = cmin;
+ while ((c < cmax) && is_blank)
+ {
+	if ((c->wchars0 != 32) || (c->nchars != 1))
+	 is_blank--;
+	c++;
+ }
+ if (is_blank) return 0;
+
+ return _pSLstring_hash ((unsigned char *)cmin, (unsigned char *)cmax);
+}
+
+static unsigned long Blank_Hash;
+
+static int try_scroll_down (int rmin, int rmax)
+{
+ int i, r1, r2, di, j;
+ int did_scroll;
+ SLsmg_Color_Type color;
+ SLsmg_Char_Type *tmp;
+ int ignore;
+
+ did_scroll = 0;
+ for (i = rmax; i > rmin; i--)
+ {
+	unsigned long hash;
+	hash = SL_Screeni.new_hash;
+	if (hash == Blank_Hash) continue;
+
+	if ((hash == SL_Screeni.old_hash)
+#if 0
+	 || ((i + 1 < Screen_Rows) && (hash == SL_Screeni + 1.old_hash))
+	 || ((i - 1 > rmin) && (SL_Screeni.old_hash == SL_Screeni - 1.new_hash))
+#endif
+	 )
+	 continue;
+
+	for (j = i - 1; j >= rmin; j--)
+	 {
+	 if (hash == SL_Screenj.old_hash) break;
+	 }
+	if (j < rmin) continue;
+
+	r2 = i;			 /* end scroll region */
+
+	di = i - j;
+	j--;
+	ignore = 0;
+	while ((j >= rmin) && (SL_Screenj.old_hash == SL_Screenj + di.new_hash))
+	 {
+	 if (SL_Screenj.old_hash == Blank_Hash) ignore++;
+	 j--;
+	 }
+	r1 = j + 1;
+
+	/* If this scroll only scrolls this line into place, don't do it.
+	 */
+	if ((di > 1) && (r1 + di + ignore == r2)) continue;
+
+	/* If there is anything in the scrolling region that is ok, abort the
+	 * scroll.
+	 */
+
+	for (j = r1; j <= r2; j++)
+	 {
+	 if ((SL_Screenj.old_hash != Blank_Hash)
+		 && (SL_Screenj.old_hash == SL_Screenj.new_hash))
+	 {
+		 /* See if the scroll is happens to scroll this one into place. */
+		 if ((j + di > r2) || (SL_Screenj.old_hash != SL_Screenj + di.new_hash))
+		 break;
+	 }
+	 }
+	if (j <= r2) continue;
+
+	color = This_Color; This_Color = 0;
+	did_scroll = 1;
+	(*tt_normal_video) ();
+	(*tt_set_scroll_region) (r1, r2);
+	(*tt_goto_rc) (0, 0);
+	(*tt_reverse_index) (di);
+	(*tt_reset_scroll_region) ();
+	/* Now we have a hole in the screen.
+	 * Make the virtual screen look like it.
+	 *
+	 * Note that if the terminal does not support BCE, then we have
+	 * no idea what color the hole is. So, for this case, we do not
+	 * want to add Bce_Color_Offset to This_Color since if Bce_Color_Offset
+	 * is non-zero, then This_Color = 0 does not match any valid color
+	 * obtained by adding Bce_Color_Offset.
+	 */
+	for (j = r1; j <= r2; j++) SL_Screenj.flags = TOUCHED;
+
+	while (di--)
+	 {
+	 tmp = SL_Screenr2.old;
+	 for (j = r2; j > r1; j--)
+	 {
+		 SL_Screenj.old = SL_Screenj - 1.old;
+		 SL_Screenj.old_hash = SL_Screenj - 1.old_hash;
+	 }
+	 SL_Screenr1.old = tmp;
+	 blank_line (SL_Screenr1.old, Screen_Cols, 0x20);
+	 SL_Screenr1.old_hash = Blank_Hash;
+	 r1++;
+	 }
+	This_Color = color;
+ }
+
+ return did_scroll;
+}
+
+static int try_scroll_up (int rmin, int rmax)
+{
+ int i, r1, r2, di, j;
+ int did_scroll;
+ SLsmg_Color_Type color;
+ SLsmg_Char_Type *tmp;
+ int ignore;
+
+ did_scroll = 0;
+ for (i = rmin; i < rmax; i++)
+ {
+	unsigned long hash;
+	hash = SL_Screeni.new_hash;
+	if (hash == Blank_Hash) continue;
+	if (hash == SL_Screeni.old_hash)
+	 continue;
+	/* find a match further down screen */
+	for (j = i + 1; j <= rmax; j++)
+	 {
+	 if (hash == SL_Screenj.old_hash) break;
+	 }
+	if (j > rmax) continue;
+
+	r1 = i;			 /* beg scroll region */
+	di = j - i;		 /* number of lines to scroll */
+	j++;			 /* since we know this is a match */
+
+	/* find end of scroll region */
+	ignore = 0;
+	while ((j <= rmax) && (SL_Screenj.old_hash == SL_Screenj - di.new_hash))
+	 {
+	 if (SL_Screenj.old_hash == Blank_Hash) ignore++;
+	 j++;
+	 }
+	r2 = j - 1;		 /* end of scroll region */
+
+	/* If this scroll only scrolls this line into place, don't do it.
+	 */
+	if ((di > 1) && (r1 + di + ignore == r2)) continue;
+
+	/* If there is anything in the scrolling region that is ok, abort the
+	 * scroll.
+	 */
+
+	for (j = r1; j <= r2; j++)
+	 {
+	 if ((SL_Screenj.old_hash != Blank_Hash)
+		 && (SL_Screenj.old_hash == SL_Screenj.new_hash))
+	 {
+		 if ((j - di < r1) || (SL_Screenj.old_hash != SL_Screenj - di.new_hash))
+		 break;
+	 }
+
+	 }
+	if (j <= r2) continue;
+
+	did_scroll = 1;
+
+	/* See the above comments about BCE */
+	color = This_Color; This_Color = 0;
+	(*tt_normal_video) ();
+	(*tt_set_scroll_region) (r1, r2);
+	(*tt_goto_rc) (0, 0);	 /* relative to scroll region */
+	(*tt_delete_nlines) (di);
+	(*tt_reset_scroll_region) ();
+	/* Now we have a hole in the screen. Make the virtual screen look
+	 * like it.
+	 */
+	for (j = r1; j <= r2; j++) SL_Screenj.flags = TOUCHED;
+
+	while (di--)
+	 {
+	 tmp = SL_Screenr1.old;
+	 for (j = r1; j < r2; j++)
+	 {
+		 SL_Screenj.old = SL_Screenj + 1.old;
+		 SL_Screenj.old_hash = SL_Screenj + 1.old_hash;
+	 }
+	 SL_Screenr2.old = tmp;
+	 blank_line (SL_Screenr2.old, Screen_Cols, ' ');
+	 SL_Screenr2.old_hash = Blank_Hash;
+	 r2--;
+	 }
+	This_Color = color;
+ }
+ return did_scroll;
+}
+
+static void try_scroll (void)
+{
+ int r1, rmin, rmax;
+ int num_up, num_down;
+ /* find region limits. */
+
+ for (rmax = Screen_Rows - 1; rmax > 0; rmax--)
+ {
+	if (SL_Screenrmax.new_hash != SL_Screenrmax.old_hash)
+	 {
+	 r1 = rmax - 1;
+	 if ((r1 == 0)
+		 || (SL_Screenr1.new_hash != SL_Screenr1.old_hash))
+	 break;
+
+	 rmax = r1;
+	 }
+ }
+
+ for (rmin = 0; rmin < rmax; rmin++)
+ {
+	if (SL_Screenrmin.new_hash != SL_Screenrmin.old_hash)
+	 {
+	 r1 = rmin + 1;
+	 if ((r1 == rmax)
+		 || (SL_Screenr1.new_hash != SL_Screenr1.old_hash))
+	 break;
+
+	 rmin = r1;
+	 }
+ }
+
+ /* Below, we have two scrolling algorithms. The first has the effect of
+ * scrolling lines down. This is usually appropriate when one moves
+ * up the display, e.g., with the UP arrow. The second algorithm is
+ * appropriate for going the other way. It is important to choose the
+ * correct one.
+ */
+
+ num_up = 0;
+ for (r1 = rmin; r1 < rmax; r1++)
+ {
+	if (SL_Screenr1.new_hash == SL_Screenr1 + 1.old_hash)
+	 num_up++;
+ }
+
+ num_down = 0;
+ for (r1 = rmax; r1 > rmin; r1--)
+ {
+	if (SL_Screenr1 - 1.old_hash == SL_Screenr1.new_hash)
+	 num_down++;
+ }
+
+ if (num_up > num_down)
+ {
+	if (try_scroll_up (rmin, rmax))
+	 return;
+
+	(void) try_scroll_down (rmin, rmax);
+ }
+ else
+ {
+	if (try_scroll_down (rmin, rmax))
+	 return;
+
+	(void) try_scroll_up (rmin, rmax);
+ }
+}
+#endif /* NOT IBMPC_SYSTEM */
+
+#ifdef REQUIRES_NON_BCE_SUPPORT
+static void adjust_colors (void)
+{
+ int bce;
+ unsigned int i;
+
+ bce = Bce_Color_Offset;
+ Bce_Color_Offset = _pSLtt_get_bce_color_offset ();
+ if (bce == Bce_Color_Offset)
+ return;
+
+ for (i = 0; i < Screen_Rows; i++)
+ {
+	SLsmg_Char_Type *s, *smax;
+
+	SL_Screeni.flags |= TRASHED;
+	s = SL_Screeni.neew;
+	smax = s + Screen_Cols;
+
+	while (s < smax)
+	 {
+	 SLsmg_Color_Type color = s->color;
+	 int acs = color & SLSMG_ACS_MASK;
+	 color = (color & SLSMG_COLOR_MASK) + (Bce_Color_Offset - bce);
+	 if (color < SLSMG_MAX_COLORS)
+	 s->color = color | acs;
+
+	 s++;
+	 }
+ }
+}
+#endif
+
+void SLsmg_refresh (void)
+{
+ unsigned int i;
+#ifndef IBMPC_SYSTEM
+ int trashed = 0;
+#endif
+ int r, c;
+
+ if (Smg_Mode == SMG_MODE_NONE) return;
+
+ if (Screen_Trashed)
+ {
+	Cls_Flag = 1;
+	for (i = 0; i < Screen_Rows; i++)
+	 SL_Screeni.flags |= TRASHED;
+#ifdef REQUIRES_NON_BCE_SUPPORT
+	adjust_colors ();
+#endif
+ }
+
+#ifndef IBMPC_SYSTEM
+ for (i = 0; i < Screen_Rows; i++)
+ {
+	if (SL_Screeni.flags == 0) continue;
+	SL_Screeni.new_hash = compute_hash (SL_Screeni.neew, Screen_Cols);
+	trashed = 1;
+ }
+#endif
+
+ if (Cls_Flag)
+ {
+	(*tt_normal_video) (); (*tt_cls) ();
+ }
+#ifndef IBMPC_SYSTEM
+ else if (trashed && (*tt_Term_Cannot_Scroll == 0)) try_scroll ();
+#endif
+
+ for (i = 0; i < Screen_Rows; i++)
+ {
+	if (SL_Screeni.flags == 0) continue;
+
+	if (Cls_Flag || SL_Screeni.flags & TRASHED)
+	 {
+	 SLsmg_Color_Type color = This_Color;
+
+	 if (Cls_Flag == 0)
+	 {
+		 (*tt_goto_rc) (i, 0);
+		 (*tt_del_eol) ();
+	 }
+	 This_Color = 0;
+	 blank_line (SL_Screeni.old, Screen_Cols, 0x20);
+	 This_Color = color;
+	 }
+
+	(*tt_smart_puts) (SL_Screeni.neew, SL_Screeni.old, Screen_Cols, i);
+
+	memcpy ((char *) SL_Screeni.old, (char *) SL_Screeni.neew,
+		Screen_Cols * sizeof (SLsmg_Char_Type));
+
+	SL_Screeni.flags = 0;
+#ifndef IBMPC_SYSTEM
+	SL_Screeni.old_hash = SL_Screeni.new_hash;
+#endif
+ }
+
+ r = This_Row - Start_Row;
+ c = This_Col - Start_Col;
+ if (r < 0)
+ {
+	r = 0;
+	c = 0;
+ }
+ else if (r >= (int)Screen_Rows)
+ {
+	r = (int)Screen_Rows;
+	c = (int)Screen_Cols-1;
+ }
+ if (c < 0)
+ c = 0;
+ else if (c >= (int)Screen_Cols)
+ c = (int)Screen_Cols-1;
+
+ (*tt_goto_rc) (r,c);
+ (void) (*tt_flush_output) ();
+ Cls_Flag = 0;
+ Screen_Trashed = 0;
+}
+
+static int compute_clip (int row, int n, int box_start, int box_end,
+			 int *rmin, int *rmax)
+{
+ int row_max;
+
+ if (n < 0) return 0;
+ if (row >= box_end) return 0;
+ row_max = row + n;
+ if (row_max <= box_start) return 0;
+
+ if (row < box_start) row = box_start;
+ if (row_max >= box_end) row_max = box_end;
+ *rmin = row;
+ *rmax = row_max;
+ return 1;
+}
+
+void SLsmg_touch_lines (int row, unsigned int n)
+{
+ int i;
+ int r1, r2;
+
+ /* Allow this function to be called even when we are not initialied.
+ * Calling this function is useful after calling SLtt_set_color
+ * to force the display to be redrawn
+ */
+
+ if (Smg_Mode == SMG_MODE_NONE)
+ return;
+
+ if (0 == compute_clip (row, (int) n, Start_Row, Start_Row + Screen_Rows, &r1, &r2))
+ return;
+
+ r1 -= Start_Row;
+ r2 -= Start_Row;
+ for (i = r1; i < r2; i++)
+ {
+	SL_Screeni.flags |= TRASHED;
+ }
+}
+
+void SLsmg_touch_screen (void)
+{
+ Screen_Trashed = 1;
+}
+
+#ifndef IBMPC_SYSTEM
+# define BLOCK_SIGNALS SLsig_block_signals ()
+# define UNBLOCK_SIGNALS SLsig_unblock_signals ()
+#else
+# define BLOCK_SIGNALS (void)0
+# define UNBLOCK_SIGNALS (void)0
+#endif
+
+static int Smg_Suspended;
+int SLsmg_suspend_smg (void)
+{
+ BLOCK_SIGNALS;
+
+ if (Smg_Suspended == 0)
+ {
+	(*tt_reset_video) ();
+	Smg_Suspended = 1;
+ }
+
+ UNBLOCK_SIGNALS;
+ return 0;
+}
+
+int SLsmg_resume_smg (void)
+{
+ BLOCK_SIGNALS;
+
+ if (Smg_Suspended == 0)
+ {
+	UNBLOCK_SIGNALS;
+	return 0;
+ }
+
+ Smg_Suspended = 0;
+
+ if (-1 == (*tt_init_video) ())
+ {
+	UNBLOCK_SIGNALS;
+	return -1;
+ }
+
+ if (Smg_Mode == SMG_MODE_FULLSCREEN)
+ Cls_Flag = 1;
+
+ SLsmg_touch_screen ();
+ SLsmg_refresh ();
+
+ UNBLOCK_SIGNALS;
+ return 0;
+}
+
+static void reset_smg (void)
+{
+ unsigned int i;
+ if (Smg_Mode == SMG_MODE_NONE)
+ return;
+
+ for (i = 0; i < Screen_Rows; i++)
+ {
+	SLfree ((char *)SL_Screeni.old);
+	SLfree ((char *)SL_Screeni.neew);
+	SL_Screeni.old = SL_Screeni.neew = NULL;
+ }
+ This_Alt_Char = This_Color = 0;
+ Smg_Mode = SMG_MODE_NONE;
+}
+
+static int init_smg (int mode)
+{
+ unsigned int i, len;
+ SLsmg_Char_Type *old, *neew;
+
+ Smg_Mode = mode;
+
+#ifdef REQUIRES_NON_BCE_SUPPORT
+ Bce_Color_Offset = _pSLtt_get_bce_color_offset ();
+#endif
+
+ Screen_Rows = *tt_Screen_Rows;
+ if (Screen_Rows > SLTT_MAX_SCREEN_ROWS)
+ Screen_Rows = SLTT_MAX_SCREEN_ROWS;
+
+ Screen_Cols = *tt_Screen_Cols;
+
+ This_Col = This_Row = Start_Col = Start_Row = 0;
+
+ This_Alt_Char = 0;
+ SLsmg_set_color (0);
+
+ if (mode == SMG_MODE_FULLSCREEN)
+ Cls_Flag = 1;
+
+ init_acs (ACS_MODE_AUTO);
+
+ len = Screen_Cols + 3;
+ for (i = 0; i < Screen_Rows; i++)
+ {
+	if ((NULL == (old = (SLsmg_Char_Type *) _SLcalloc (len, sizeof(SLsmg_Char_Type))))
+	 || ((NULL == (neew = (SLsmg_Char_Type *) _SLcalloc (len, sizeof(SLsmg_Char_Type))))))
+	 {
+	 SLfree ((char *) old);
+	 return -1;
+	 }
+	blank_line (old, len, ' ');
+	blank_line (neew, len, ' ');
+	SL_Screeni.old = old;
+	SL_Screeni.neew = neew;
+	SL_Screeni.flags = 0;
+#ifndef IBMPC_SYSTEM
+	Blank_Hash = compute_hash (old, Screen_Cols);
+	SL_Screeni.new_hash = SL_Screeni.old_hash = Blank_Hash;
+#endif
+ }
+
+ _pSLtt_color_changed_hook = SLsmg_touch_screen;
+
+ if (Smg_Mode == SMG_MODE_FULLSCREEN)
+ Screen_Trashed = 1;
+ return 0;
+}
+
+static int init_smg_for_mode (int mode)
+{
+ int ret;
+
+ BLOCK_SIGNALS;
+
+ if (tt_Screen_Rows == NULL)
+ init_tt_symbols ();
+
+ if (Smg_Mode != SMG_MODE_NONE)
+ SLsmg_reset_smg ();
+
+ if (UTF8_Mode == -1)
+ (void) SLsmg_utf8_enable (-1);
+
+ if (-1 == (*tt_init_video) ())
+ {
+	UNBLOCK_SIGNALS;
+	return -1;
+ }
+
+ if (-1 == (ret = init_smg (mode)))
+ (void) (*tt_reset_video)();
+
+ UNBLOCK_SIGNALS;
+ return ret;
+}
+
+int SLsmg_init_smg (void)
+{
+ return init_smg_for_mode (SMG_MODE_FULLSCREEN);
+}
+
+int _pSLsmg_init_smg_cmdline (void)
+{
+ return init_smg_for_mode (SMG_MODE_CMDLINE);
+}
+
+int SLsmg_reinit_smg (void)
+{
+ int ret;
+ int mode;
+
+ if (SMG_MODE_NONE == (mode = Smg_Mode))
+ return SLsmg_init_smg ();
+
+ BLOCK_SIGNALS;
+ reset_smg ();
+ ret = init_smg (mode);
+ UNBLOCK_SIGNALS;
+ return ret;
+}
+
+void SLsmg_reset_smg (void)
+{
+ if (Smg_Mode == SMG_MODE_NONE)
+ return;
+
+ BLOCK_SIGNALS;
+
+ reset_smg ();
+ (*tt_reset_video)();
+
+ UNBLOCK_SIGNALS;
+}
+
+void SLsmg_vprintf (SLFUTURE_CONST char *fmt, va_list ap)
+{
+ char buf1024;
+
+ if (Smg_Mode == SMG_MODE_NONE) return;
+
+ (void) SLvsnprintf (buf, sizeof (buf), fmt, ap);
+ SLsmg_write_string (buf);
+}
+
+void SLsmg_printf (SLFUTURE_CONST char *fmt, ...)
+{
+ va_list ap;
+ SLFUTURE_CONST char *f;
+
+ if (Smg_Mode == SMG_MODE_NONE) return;
+
+ va_start(ap, fmt);
+
+ f = fmt;
+ while (*f && (*f != '%'))
+ f++;
+ if (f != fmt)
+ SLsmg_write_chars ((SLuchar_Type *)fmt, (SLuchar_Type *)f);
+
+ if (*f != 0)
+ SLsmg_vprintf (f, ap);
+
+ va_end (ap);
+}
+
+void SLsmg_set_screen_start (int *r, int *c)
+{
+ int orow = Start_Row, oc = Start_Col;
+
+ if (Smg_Mode == SMG_MODE_NONE) return;
+
+ if (c == NULL) Start_Col = 0;
+ else
+ {
+	Start_Col = *c;
+	*c = oc;
+ }
+ if (r == NULL) Start_Row = 0;
+ else
+ {
+	Start_Row = *r;
+	*r = orow;
+ }
+}
+
+void SLsmg_draw_object (int r, int c, SLwchar_Type object)
+{
+ This_Row = r; This_Col = c;
+
+ if (Smg_Mode == SMG_MODE_NONE) return;
+
+ if (point_visible (1))
+ {
+	int color = This_Color;
+	This_Color |= SLSMG_ACS_MASK;
+	SLsmg_write_char (object);
+	This_Color = color;
+ }
+
+ This_Col = c + 1;
+}
+
+void SLsmg_draw_hline (unsigned int n)
+{
+ static unsigned char hbuf16;
+ int cmin, cmax;
+ int final_col = This_Col + (int) n;
+ int save_color;
+
+ if (Smg_Mode == SMG_MODE_NONE) return;
+
+ if ((This_Row < Start_Row) || (This_Row >= Start_Row + (int)Screen_Rows)
+ || (0 == compute_clip (This_Col, n, Start_Col, Start_Col + (int)Screen_Cols,
+			 &cmin, &cmax)))
+ {
+	This_Col = final_col;
+	return;
+ }
+
+ n = (unsigned int)(cmax - cmin);
+
+ save_color = This_Color;
+ This_Color |= SLSMG_ACS_MASK;
+ This_Col = cmin;
+
+ if (hbuf0 == 0)
+ {
+	SLMEMSET ((char *) hbuf, SLSMG_HLINE_CHAR, 16);
+ }
+
+ while (n)
+ {
+	SLsmg_write_char (SLSMG_HLINE_CHAR);
+	n--;
+ }
+ This_Color = save_color;
+ This_Col = final_col;
+}
+
+void SLsmg_draw_vline (int n)
+{
+ int c = This_Col, rmin, rmax;
+ int final_row = This_Row + n;
+ int save_color;
+
+ if (Smg_Mode == SMG_MODE_NONE) return;
+
+ if (((c < Start_Col) || (c >= Start_Col + (int)Screen_Cols))
+ || (0 == compute_clip (This_Row, n, Start_Row,
+			 Start_Row + (int)Screen_Rows,
+			 &rmin, &rmax)))
+ {
+	This_Row = final_row;
+	return;
+ }
+
+ save_color = This_Color;
+ This_Color |= SLSMG_ACS_MASK;
+
+ for (This_Row = rmin; This_Row < rmax; This_Row++)
+ {
+	This_Col = c;
+	SLsmg_write_char (SLSMG_VLINE_CHAR);
+ }
+
+ This_Col = c; This_Row = final_row;
+ This_Color = save_color;
+}
+
+void SLsmg_draw_box (int r, int c, unsigned int dr, unsigned int dc)
+{
+ if (Smg_Mode == SMG_MODE_NONE) return;
+
+ if (!dr || !dc) return;
+ This_Row = r; This_Col = c;
+ dr--; dc--;
+ SLsmg_draw_hline (dc);
+ SLsmg_draw_vline (dr);
+ This_Row = r; This_Col = c;
+ SLsmg_draw_vline (dr);
+ SLsmg_draw_hline (dc);
+ SLsmg_draw_object (r, c, SLSMG_ULCORN_CHAR);
+ SLsmg_draw_object (r, c + (int) dc, SLSMG_URCORN_CHAR);
+ SLsmg_draw_object (r + (int) dr, c, SLSMG_LLCORN_CHAR);
+ SLsmg_draw_object (r + (int) dr, c + (int) dc, SLSMG_LRCORN_CHAR);
+ This_Row = r; This_Col = c;
+}
+
+void SLsmg_fill_region (int r, int c, unsigned int dr, unsigned int dc, SLwchar_Type wch)
+{
+ static unsigned char buf16;
+ unsigned char ubuf16*SLUTF8_MAX_MBLEN;
+ unsigned char *b, *bmax;
+ int count;
+ int dcmax, rmax;
+ unsigned int wchlen;
+
+ if (Smg_Mode == SMG_MODE_NONE) return;
+
+ SLsmg_gotorc (r, c);
+ r = This_Row; c = This_Col;
+
+ dcmax = Screen_Cols - This_Col;
+ if (dcmax < 0)
+ return;
+
+ if (dc > (unsigned int) dcmax) dc = (unsigned int) dcmax;
+
+ rmax = This_Row + (int)dr;
+ if (rmax > (int)Screen_Rows) rmax = (int)Screen_Rows;
+
+ if ((wch < 0x80)
+ || (UTF8_Mode == 0))
+ {
+	if (buf0 != (unsigned char) wch)
+	 memset ((char *) buf, (unsigned char) wch, sizeof(buf));
+	b = buf;
+	bmax = buf + sizeof (buf);
+	wchlen = 1;
+ }
+ else
+ {
+	unsigned int i;
+
+	b = ubuf;
+	bmax = SLutf8_encode (wch, b, SLUTF8_MAX_MBLEN);
+	if (bmax == NULL)
+	 {
+	 bmax = ubuf;
+	 *bmax++ = '?';
+	 }
+	wchlen = (unsigned int) (bmax - b);
+	for (i = 1; i < 16; i++)
+	 {
+	 memcpy (bmax, b, wchlen);
+	 bmax += wchlen;
+	 }
+ }
+
+ for (This_Row = r; This_Row < rmax; This_Row++)
+ {
+	This_Col = c;
+	count = dc / 16;
+	SLsmg_write_chars (b, b + wchlen * (dc % 16));
+	while (count-- > 0)
+	 {
+	 SLsmg_write_chars (b, bmax);
+	 }
+ }
+
+ This_Row = r;
+}
+
+void SLsmg_forward (int n)
+{
+ This_Col += n;
+}
+
+void
+SLsmg_set_color_in_region (int color, int r, int c, unsigned int dr, unsigned int dc)
+{
+ int cmax, rmax;
+
+ if (Smg_Mode == SMG_MODE_NONE) return;
+
+ c -= Start_Col;
+ r -= Start_Row;
+
+ cmax = c + (int) dc;
+ rmax = r + (int) dr;
+
+ if (cmax > (int)Screen_Cols) cmax = (int)Screen_Cols;
+ if (rmax > (int)Screen_Rows) rmax = (int)Screen_Rows;
+
+ if (c < 0) c = 0;
+ if (r < 0) r = 0;
+
+#ifdef REQUIRES_NON_BCE_SUPPORT
+ if (Bce_Color_Offset)
+ color += Bce_Color_Offset;
+#endif
+
+ while (r < rmax)
+ {
+	SLsmg_Char_Type *cell, *cell_max;
+
+	SL_Screenr.flags |= TOUCHED;
+	cell = SL_Screenr.neew;
+	cell_max = cell + cmax;
+	cell += c;
+
+	while (cell < cell_max)
+	 {
+	 int acs = cell->color & SLSMG_ACS_MASK;
+	 cell->color = color | acs;
+	 cell++;
+	 }
+	r++;
+ }
+}
+
+void SLsmg_set_terminal_info (SLsmg_Term_Type *tt)
+{
+ if (tt == NULL)		 /* use default */
+ return;
+
+ if ((tt->tt_normal_video == NULL)
+ || (tt->tt_goto_rc == NULL)
+ || (tt->tt_cls == NULL)
+ || (tt->tt_del_eol == NULL)
+ || (tt->tt_smart_puts == NULL)
+ || (tt->tt_flush_output == NULL)
+ || (tt->tt_reset_video == NULL)
+ || (tt->tt_init_video == NULL)
+#ifndef IBMPC_SYSTEM
+ || (tt->tt_set_scroll_region == NULL)
+ || (tt->tt_reverse_index == NULL)
+ || (tt->tt_reset_scroll_region == NULL)
+ || (tt->tt_delete_nlines == NULL)
+ /* Variables */
+ || (tt->tt_term_cannot_scroll == NULL)
+ || (tt->tt_has_alt_charset == NULL)
+#if 0 /* These can be NULL */
+ || (tt->tt_use_blink_for_acs == NULL)
+ || (tt->tt_graphic_char_pairs == NULL)
+#endif
+ || (tt->tt_screen_cols == NULL)
+ || (tt->tt_screen_rows == NULL)
+#endif
+ )
+ SLang_exit_error ("The Terminal not powerful enough for S-Lang's SLsmg interface");
+
+ tt_normal_video = tt->tt_normal_video;
+ tt_goto_rc = tt->tt_goto_rc;
+ tt_cls = tt->tt_cls;
+ tt_del_eol = tt->tt_del_eol;
+ tt_smart_puts = tt->tt_smart_puts;
+ tt_flush_output = tt->tt_flush_output;
+ tt_reset_video = tt->tt_reset_video;
+ tt_init_video = tt->tt_init_video;
+
+#ifndef IBMPC_SYSTEM
+ tt_set_scroll_region = tt->tt_set_scroll_region;
+ tt_reverse_index = tt->tt_reverse_index;
+ tt_reset_scroll_region = tt->tt_reset_scroll_region;
+ tt_delete_nlines = tt->tt_delete_nlines;
+
+ tt_Term_Cannot_Scroll = tt->tt_term_cannot_scroll;
+#endif
+
+ tt_Has_Alt_Charset = tt->tt_has_alt_charset;
+ tt_Screen_Cols = tt->tt_screen_cols;
+ tt_Screen_Rows = tt->tt_screen_rows;
+ tt_unicode_ok = tt->unicode_ok;
+}
+
+/* The following routines are partially supported. */
+void SLsmg_write_color_chars (SLsmg_Char_Type *s, unsigned int len)
+{
+#if 1
+ SLsmg_write_raw (s, len);
+#else
+ SLsmg_Char_Type *smax, sh;
+ char buf32, *b, *bmax;
+ int color, save_color;
+
+ if (Smg_Mode == SMG_MODE_NONE) return;
+
+ smax = s + len;
+ b = buf;
+ bmax = b + sizeof (buf);
+
+ save_color = This_Color;
+
+ while (s < smax)
+ {
+	sh = *s++;
+
+	color = SLSMG_EXTRACT_COLOR(sh);
+
+#ifdef REQUIRES_NON_BCE_SUPPORT
+	if (Bce_Color_Offset)
+	 {
+	 if (color & 0x80)
+	 color = ((color & 0x7F) + Bce_Color_Offset) | 0x80;
+	 else
+	 color = ((color & 0x7F) + Bce_Color_Offset) & 0x7F;
+	 }
+#endif
+
+	if ((color != This_Color) || (b == bmax))
+	 {
+	 if (b != buf)
+	 {
+		 SLsmg_write_nchars (buf, (int) (b - buf));
+		 b = buf;
+	 }
+	 This_Color = color;
+	 }
+	*b++ = (char) SLSMG_EXTRACT_CHAR(sh);
+ }
+
+ if (b != buf)
+ SLsmg_write_nchars (buf, (unsigned int) (b - buf));
+
+ This_Color = save_color;
+#endif
+}
+
+unsigned int SLsmg_strwidth (SLuchar_Type *u, SLuchar_Type *umax)
+{
+ unsigned char display_8bit;
+ int utf8_mode = UTF8_Mode;
+ int col;
+
+ if (u == NULL)
+ return 0;
+
+ display_8bit = (unsigned char) SLsmg_Display_Eight_Bit;
+ if (utf8_mode)
+ display_8bit = 0xA0;
+
+ col = This_Col;
+
+ while (u < umax)
+ {
+	SLuchar_Type ch;
+	SLstrlen_Type nconsumed;
+	SLwchar_Type wc;
+
+	ch = *u;
+	if (ch < 0x80)
+	 {
+	 u++;
+
+	 if ((ch >= 0x20) && (ch != 0x7F))
+	 {
+		 col++;
+		 continue;
+	 }
+
+	 if ((ch == '\t') && (SLsmg_Tab_Width > 0))
+	 {
+		 if (col >= 0)
+		 col = (1 + col/SLsmg_Tab_Width) * SLsmg_Tab_Width;
+		 else
+		 col = ((col + 1)/SLsmg_Tab_Width) * SLsmg_Tab_Width;
+
+		 continue;
+	 }
+
+	 if ((ch == '\n')
+		 && (SLsmg_Newline_Behavior != SLSMG_NEWLINE_PRINTABLE))
+	 break;
+
+	 if ((ch == 0x8) && SLsmg_Backspace_Moves)
+	 {
+		 col--;
+		 continue;
+	 }
+#if SLSMG_HAS_EMBEDDED_ESCAPE
+	 if ((ch == 033) && Embedded_Escape_Mode)
+	 {
+		 SLsmg_Color_Type color;
+		 if (0 == parse_embedded_escape (u, umax, 0, &u, &color))
+		 continue;
+	 }
+#endif
+	 col += 2;
+	 continue;
+	 }
+
+	nconsumed = 1;
+	if ((utf8_mode == 0)
+	 || (NULL == SLutf8_decode (u, umax, &wc, &nconsumed)))
+	 {
+	 if ((utf8_mode == 0)
+		 && (display_8bit && (*u >= display_8bit)))
+	 col++;
+	 else
+	 col += 4*nconsumed;
+	 u += nconsumed;
+	 continue;
+	 }
+
+	u += nconsumed;
+	if (wc < (SLwchar_Type)display_8bit)
+	 {
+	 col += 4;
+	 continue;
+	 }
+	col += SLwchar_wcwidth (wc);
+ }
+
+ if (col < This_Col)
+ return 0;
+
+ return (unsigned int) (col - This_Col);
+}
+
+/* If the string u were written at the current positition, this function
+ * returns the number of bytes necessary to reach the specified width.
+ */
+unsigned int SLsmg_strbytes (SLuchar_Type *u, SLuchar_Type *umax, unsigned int width)
+{
+ SLuchar_Type *ustart;
+ unsigned char display_8bit;
+ int utf8_mode = UTF8_Mode;
+ int col, col_max;
+
+ if (u == NULL)
+ return 0;
+
+ display_8bit = (unsigned char) SLsmg_Display_Eight_Bit;
+ if (utf8_mode)
+ display_8bit = 0xA0;
+
+ col = This_Col;
+ col_max = col + width;
+ ustart = u;
+
+ while (u < umax)
+ {
+	SLuchar_Type ch;
+	SLwchar_Type wc;
+ SLstrlen_Type nconsumed = 1;
+
+	ch = *u;
+	if (ch < 0x80)
+	 {
+	 if ((ch >= 0x20) && (ch != 0x7F))
+	 col++;
+	 else if ((ch == '\t') && (SLsmg_Tab_Width > 0))
+	 {
+		 if (col >= 0)
+		 col = (1 + col/SLsmg_Tab_Width) * SLsmg_Tab_Width;
+		 else
+		 col = ((col + 1)/SLsmg_Tab_Width) * SLsmg_Tab_Width;
+	 }
+	 else if ((ch == '\n')
+		 && (SLsmg_Newline_Behavior != SLSMG_NEWLINE_PRINTABLE))
+	 break;
+	 else if ((ch == 0x8) && SLsmg_Backspace_Moves)
+	 col--;
+#if SLSMG_HAS_EMBEDDED_ESCAPE
+	 else if ((ch == 033) && Embedded_Escape_Mode)
+	 {
+		 SLsmg_Color_Type color;
+		 SLuchar_Type *u1 = u+1;
+		 if (-1 == parse_embedded_escape (u1, umax, 0, &u1, &color))
+		 col += 2;
+		 nconsumed = (u1 - u);
+	 }
+#endif
+	 else col += 2;
+	 }
+	else if ((utf8_mode == 0)
+		 || (NULL == SLutf8_decode (u, umax, &wc, &nconsumed)))
+	 {
+	 if ((utf8_mode == 0)
+		 && (display_8bit && (*u >= display_8bit)))
+	 col++;
+	 else
+	 col += 4*nconsumed; /* <XX> */
+	 }
+	else if (wc < (SLwchar_Type)display_8bit)
+	 col += 4;
+	else col += SLwchar_wcwidth (wc);
+
+	if (col >= col_max)
+	 break;
+
+	u += nconsumed;
+ }
+
+ return (unsigned int) (u - ustart);
+}
+
+unsigned int SLsmg_read_raw (SLsmg_Char_Type *buf, unsigned int len)
+{
+ unsigned int r, c;
+
+ if (Smg_Mode == SMG_MODE_NONE) return 0;
+
+ if (0 == point_visible (1)) return 0;
+
+ r = (unsigned int) (This_Row - Start_Row);
+ c = (unsigned int) (This_Col - Start_Col);
+
+ if (c + len > (unsigned int) Screen_Cols)
+ len = (unsigned int) Screen_Cols - c;
+
+ memcpy ((char *) buf, (char *) (SL_Screenr.neew + c), len * sizeof (SLsmg_Char_Type));
+ return len;
+}
+
+unsigned int SLsmg_write_raw (SLsmg_Char_Type *buf, unsigned int len)
+{
+ unsigned int r, c;
+ SLsmg_Char_Type *dest;
+
+ if (Smg_Mode == SMG_MODE_NONE) return 0;
+
+ if (0 == point_visible (1)) return 0;
+
+ r = (unsigned int) (This_Row - Start_Row);
+ c = (unsigned int) (This_Col - Start_Col);
+
+ if (c + len > (unsigned int) Screen_Cols)
+ len = (unsigned int) Screen_Cols - c;
+
+ dest = SL_Screenr.neew + c;
+
+ if (0 != memcmp ((char *) dest, (char *) buf, len * sizeof (SLsmg_Char_Type)))
+ {
+	memcpy ((char *) dest, (char *) buf, len * sizeof (SLsmg_Char_Type));
+	SL_Screenr.flags |= TOUCHED;
+ }
+ return len;
+}
+
+int SLsmg_char_at (SLsmg_Char_Type *cp)
+{
+ if (Smg_Mode == SMG_MODE_NONE) return -1;
+
+ if (point_visible (1))
+ {
+	SLsmg_Char_Type *c = &SL_ScreenThis_Row - Start_Row.neewThis_Col - Start_Col;
+	if (c->nchars == 0)
+	 return -1;
+	*cp = *c;
+	return 0;
+ }
+ return -1;
+}
+
+int SLsmg_utf8_enable (int mode)
+{
+ if (mode == -1)
+ {
+	mode = _pSLutf8_mode;
+	if (mode == -1)
+	 mode = SLutf8_enable (-1);
+ }
+ return UTF8_Mode = mode;
+}
+
+int SLsmg_is_utf8_mode (void)
+{
+ int mode = UTF8_Mode;
+ if (mode == -1)
+ mode = _pSLutf8_mode;
+
+ return mode;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slstd.c Added

@@ -0,0 +1,1505 @@
+/* -*- mode: C; mode: fold; -*- */
+/* Standard intrinsic functions for S-Lang. Included here are string
+ and array operations */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#define _BSD_SOURCE 1		 /* to get strtoll */
+#define _SVID_SOURCE		 /* for putenv */
+#define _DEFAULT_SOURCE 1
+#include "slinclud.h"
+/*{{{ Include Files */
+
+#include <time.h>
+
+#ifndef __QNX__
+# if defined(__GO32__) || defined(__WATCOMC__)
+# include <dos.h>
+# include <bios.h>
+# endif
+#endif
+
+#if SLANG_HAS_FLOAT
+# include <math.h>
+#endif
+
+#if defined(__APPLE__) && defined(HAVE_ENVIRON)
+# include <crt_externs.h>	 /* for _NSGetEnviron */
+#endif
+
+#include "slang.h"
+#include "_slang.h"
+
+/*}}}*/
+
+/* builtin stack manipulation functions */
+int SLdo_pop(void) /*{{{*/
+{
+ return SLdo_pop_n (1);
+}
+
+/*}}}*/
+
+int SLdo_pop_n (unsigned int n)
+{
+ SLang_Object_Type x;
+
+ while (n--)
+ {
+	if (SLang_pop(&x)) return -1;
+	SLang_free_object (&x);
+ }
+
+ return 0;
+}
+
+static void do_dup(void) /*{{{*/
+{
+ (void) SLdup_n (1);
+}
+
+/*}}}*/
+
+static void length_cmd (void)
+{
+ SLang_Class_Type *cl;
+ SLang_Object_Type obj;
+ VOID_STAR p;
+ SLuindex_Type length;
+ SLindex_Type ilen;
+
+ if (-1 == SLang_pop (&obj))
+ return;
+
+ cl = _pSLclass_get_class (obj.o_data_type);
+ p = _pSLclass_get_ptr_to_value (cl, &obj);
+
+ ilen = 1;
+ if (cl->cl_length != NULL)
+ {
+	if (0 == (*cl->cl_length)(obj.o_data_type, p, &length))
+	 ilen = (SLindex_Type) length;
+	else
+	 ilen = -1;
+ }
+
+ SLang_free_object (&obj);
+ (void) SLang_push_array_index (ilen);
+}
+
+/* convert integer to a string of length 1 */
+static void char_cmd (SLwchar_Type *x) /*{{{*/
+{
+ SLuchar_Type bufSLUTF8_MAX_MBLEN + 1;
+ int is_byte;
+
+ is_byte = ((signed)*x < 0);
+ if (is_byte)
+ {
+	buf0 = (SLuchar_Type) (-(signed)*x);
+	buf1 = 0;
+ }
+ else if ((_pSLinterp_UTF8_Mode == 0)
+	 || (*x < 0x80))
+ {
+ buf0 = (SLuchar_Type) *x;
+ buf1 = 0;
+ }
+ else
+ {
+ SLuchar_Type *p;
+
+ p = SLutf8_encode (*x, buf, SLUTF8_MAX_MBLEN);
+ if (p == NULL) p = buf;
+
+ *p = 0;
+ }
+
+ SLang_push_string ((char *)buf);
+}
+
+/*}}}*/
+
+/* format object into a string and returns slstring */
+char *_pSLstringize_object (SLang_Object_Type *obj) /*{{{*/
+{
+ SLang_Class_Type *cl;
+ SLtype stype;
+ VOID_STAR p;
+ char *s, *s1;
+
+ stype = obj->o_data_type;
+ p = (VOID_STAR) &obj->v.ptr_val;
+
+ cl = _pSLclass_get_class (stype);
+
+ s = (*cl->cl_string) (stype, p);
+ if (s != NULL)
+ {
+	s1 = SLang_create_slstring (s);
+	SLfree (s);
+	s = s1;
+ }
+ return s;
+}
+/*}}}*/
+
+int SLang_run_hooks (SLFUTURE_CONST char *hook, unsigned int num_args, ...)
+{
+ unsigned int i;
+ va_list ap;
+
+ if (SLang_get_error ())
+ return -1;
+
+ if (0 == SLang_is_defined (hook))
+ return 0;
+
+ (void) SLang_start_arg_list ();
+ va_start (ap, num_args);
+ for (i = 0; i < num_args; i++)
+ {
+	char *arg;
+
+	arg = va_arg (ap, char *);
+	if (-1 == SLang_push_string (arg))
+	 break;
+ }
+ va_end (ap);
+ (void) SLang_end_arg_list ();
+
+ if (_pSLang_Error) return -1;
+ return SLang_execute_function (hook);
+}
+
+static void intrin_getenv_cmd (char *s)
+{
+ SLang_push_string (getenv (s));
+}
+
+#ifdef HAVE_PUTENV
+/* This is a silly hack to deal with the ambiguity of whether or not to free
+ * a pointer passed to putenv. Here it is attached to an array so that leak
+ * checkers can located it.
+ */
+# define MAX_PUTENV_ARRAY_SIZE 64
+static char *Putenv_Pointer_ArrayMAX_PUTENV_ARRAY_SIZE;
+unsigned int Num_Putenv_Pointers = 0;
+static void intrin_putenv (void) /*{{{*/
+{
+ char *s;
+
+ /* Some putenv implementations require malloced strings. */
+ if (SLpop_string(&s)) return;
+
+ if (putenv (s))
+ {
+	SLang_set_error (SL_OS_Error);
+	SLfree (s);
+ }
+ /* Note that s is NOT freed */
+
+ if (Num_Putenv_Pointers < MAX_PUTENV_ARRAY_SIZE)
+ Putenv_Pointer_ArrayNum_Putenv_Pointers++ = s;
+}
+
+/*}}}*/
+
+#endif
+
+static void byte_compile_file (char *f, int *m)
+{
+ SLang_byte_compile_file (f, *m);
+}
+
+static void intrin_type_info1 (void)
+{
+ SLang_Object_Type obj;
+ unsigned int type;
+
+ if (-1 == SLang_pop (&obj))
+ return;
+
+ type = obj.o_data_type;
+ if (type == SLANG_ARRAY_TYPE)
+ type = obj.v.array_val->data_type;
+
+ SLang_free_object (&obj);
+
+ SLang_push_datatype (type);
+}
+
+static void intrin_type_info (void)
+{
+ SLang_Object_Type obj;
+
+ if (-1 == SLang_pop (&obj))
+ return;
+
+ SLang_push_datatype (obj.o_data_type);
+ SLang_free_object (&obj);
+}
+
+void _pSLstring_intrinsic (void) /*{{{*/
+{
+ SLang_Object_Type x;
+ char *s;
+
+ if (SLANG_STRING_TYPE == SLang_peek_at_stack ())
+ return;
+
+ if (-1 == SLang_pop (&x))
+ return;
+
+ if (NULL != (s = _pSLstringize_object (&x)))
+ _pSLang_push_slstring (s);
+
+ SLang_free_object (&x);
+}
+
+/*}}}*/
+
+static void intrin_typecast (void)
+{
+ SLtype to_type;
+ if (0 == SLang_pop_datatype (&to_type))
+ (void) SLclass_typecast (to_type, 0, 1);
+}
+
+#if SLANG_HAS_FLOAT
+static void intrin_double (void)
+{
+ (void) SLclass_typecast (SLANG_DOUBLE_TYPE, 0, 1);
+}
+
+#endif
+
+static void intrin_int (void) /*{{{*/
+{
+ (void) SLclass_typecast (SLANG_INT_TYPE, 0, 1);
+}
+
+/*}}}*/
+
+static SLCONST char *
+intrin_function_name (void)
+{
+ SLCONST char *name;
+ if (NULL == (name = _pSLang_current_function_name ()))
+ return "";
+ return name;
+}
+
+static void intrin_message (char *s)
+{
+ SLang_vmessage ("%s", s);
+}
+
+static void intrin_error (char *s)
+{
+ _pSLang_verror (SL_RunTime_Error, "%s", s);
+}
+
+static void intrin_pop_n (int *n)
+{
+ SLdo_pop_n ((unsigned int) *n);
+}
+
+static void intrin_reverse_stack (int *n)
+{
+ SLreverse_stack (*n);
+}
+
+static void intrin_roll_stack (int *n)
+{
+ SLroll_stack (*n);
+}
+
+static void usage (void)
+{
+ char *msg;
+
+ _pSLstrops_do_sprintf_n (SLang_Num_Function_Args - 1); /* do not include format */
+
+ if (-1 == SLang_pop_slstring (&msg))
+ return;
+
+ _pSLang_verror (SL_USAGE_ERROR, "Usage: %s", msg);
+ SLang_free_slstring (msg);
+}
+
+static void guess_type (char *s)
+{
+ SLang_push_datatype (SLang_guess_type(s));
+}
+
+static int load_string_or_file (int (*f) (SLFUTURE_CONST char *, SLFUTURE_CONST char *))
+{
+ char *file;
+ char *ns = NULL;
+ int status;
+
+ if (SLang_Num_Function_Args == 2)
+ {
+	if (-1 == SLang_pop_slstring (&ns))
+	 return -1;
+	if (-1 == _pSLns_check_name (ns))
+	 {
+	 SLang_free_slstring (ns);
+	 return -1;
+	 }
+ }
+
+ if (-1 == SLang_pop_slstring (&file))
+ {
+	SLang_free_slstring (ns);
+	return -1;
+ }
+
+ status = (*f) (file, ns);
+ SLang_free_slstring (file);
+ SLang_free_slstring (ns);
+ return status;
+}
+
+static int load_file (void)
+{
+ return (0 == load_string_or_file (SLns_load_file));
+}
+
+static void load_string (void)
+{
+ /* FIXME: This should use the namespace of the currently executing code */
+ (void) load_string_or_file (SLns_load_string);
+}
+
+static int get_doc_string (char *file, char *topic)
+{
+ FILE *fp;
+ char line1024;
+ size_t topic_len, str_len;
+ char *str;
+ char ch;
+
+ topic_len = strlen (topic);
+ if (topic_len == 0)
+ return -1;
+
+ if (NULL == (fp = fopen (file, "r")))
+ return -1;
+
+ while (1)
+ {
+	char *pos;
+
+	if (NULL == fgets (line, sizeof(line), fp))
+	 {
+	 fclose (fp);
+	 return -1;
+	 }
+	ch = *line;
+	if ((ch == ' ') || (ch == '\t') || (ch == '\n') || (ch == '-'))
+	 continue;
+
+	pos = strstr (line, topic);
+	if (pos == NULL)
+	 continue;
+
+	ch = postopic_len;
+
+	/* Most common case */
+	if ((pos == line)
+	 && ((ch == '\n') || (ch == 0) || (ch == ' ') || (ch == '\t') || (ch == ',')))
+	 break;
+
+	pos = line;
+	while (NULL != (pos = strchr (pos, ',')))
+	 {
+	 /* Here *pos == ',' */
+	 if (NULL == (pos = strstr (pos+1, topic)))
+	 break;
+	 ch = pos-1;
+	 if ((ch != ' ') && (ch != ',') && (ch != '\t'))
+	 {
+		 pos += topic_len;
+		 continue;
+	 }
+	 ch = postopic_len;
+	 if ((ch == '\n') || (ch == ',')
+		 || (ch == ' ') || (ch == '\t') || (ch == 0))
+	 break;
+	 }
+	if (pos != NULL)
+	 break;
+ }
+
+ if (NULL == (str = SLmake_string (line)))
+ {
+	fclose (fp);
+	return -1;
+ }
+ str_len = strlen (str);
+
+ while (NULL != fgets (line, sizeof (line), fp))
+ {
+	size_t len;
+	char *new_str;
+
+	ch = *line;
+	if (ch == '#') continue;
+	if (ch == '-') break;
+
+	len = strlen (line);
+	if (NULL == (new_str = (char *)SLrealloc (str, str_len + len + 1)))
+	 {
+	 SLfree (str);
+	 str = NULL;
+	 break;
+	 }
+	str = new_str;
+	strcpy (str + str_len, line);
+	str_len += len;
+ }
+
+ fclose (fp);
+
+ (void) SLang_push_malloced_string (str);
+ return 0;
+}
+
+static _pSLString_List_Type *Doc_Files;
+
+static int add_doc_file (char *file)
+{
+ if (Doc_Files == NULL)
+ {
+	Doc_Files = _pSLstring_list_new (5, 5);
+	if (Doc_Files == NULL)
+	 return -1;
+ }
+
+ if ((file == NULL) || (*file == 0))
+ return 0;
+
+ return _pSLstring_list_append_copy (Doc_Files, file);
+}
+
+static void add_doc_file_intrin (char *file)
+{
+ (void) add_doc_file (file);
+}
+
+static void get_doc_files_intrin (void)
+{
+ if (Doc_Files == NULL)
+ Doc_Files = _pSLstring_list_new (5, 5);
+ (void) _pSLstring_list_push (Doc_Files, 0);
+}
+
+static void set_doc_files_intrin (void)
+{
+ SLang_Array_Type *at;
+ size_t i, num;
+ char **data;
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_STRING_TYPE))
+ return;
+
+ _pSLstring_list_delete (Doc_Files);
+ Doc_Files = NULL;
+
+ num = at->num_elements;
+ data = (char **) at->data;
+ for (i = 0; i < num; i++)
+ {
+	if (-1 == add_doc_file (datai))
+	 break;
+ }
+ SLang_free_array (at);
+}
+
+static void get_doc_string_intrin (char *topic)
+{
+ char *file;
+ char **files;
+ unsigned int i, num_files;
+
+ if (SLang_Num_Function_Args == 2)
+ {
+	if (-1 == SLang_pop_slstring (&file))
+	 return;
+
+	if (-1 == get_doc_string (file, topic))
+	 (void) SLang_push_null ();
+
+	SLang_free_slstring (file);
+	return;
+ }
+
+ if ((Doc_Files == NULL)
+ || (NULL == (files = Doc_Files->buf)))
+ {
+	SLang_push_null ();
+	return;
+ }
+ num_files = Doc_Files->num;
+ for (i = 0; i < num_files; i++)
+ {
+	file = filesi;
+	if (file == NULL)
+	 continue;
+
+	if (0 == get_doc_string (file, topic))
+	 return;
+ }
+ (void) SLang_push_null ();
+}
+
+static int push_string_array_elements (SLang_Array_Type *at)
+{
+ char **strs;
+ size_t num;
+ size_t i;
+
+ if (at == NULL)
+ return -1;
+
+ strs = (char **)at->data;
+ num = at->num_elements;
+ for (i = 0; i < num; i++)
+ {
+	if (-1 == SLang_push_string (strsi))
+	 {
+	 SLdo_pop_n (i);
+	 return -1;
+	 }
+ }
+ SLang_push_integer ((int) num);
+ return 0;
+}
+
+static void intrin_apropos (void)
+{
+ int num_args;
+ char *pat;
+ char *namespace_name;
+ unsigned int flags;
+ SLang_Array_Type *at;
+
+ num_args = SLang_Num_Function_Args;
+
+ if (-1 == SLang_pop_uinteger (&flags))
+ return;
+ if (-1 == SLang_pop_slstring (&pat))
+ return;
+
+ namespace_name = NULL;
+ at = NULL;
+ if (num_args == 3)
+ {
+	if (-1 == SLang_pop_slstring (&namespace_name))
+	 goto free_and_return;
+ }
+
+ at = _pSLang_apropos (namespace_name, pat, flags);
+ if (num_args == 3)
+ {
+	(void) SLang_push_array (at, 0);
+	goto free_and_return;
+ }
+
+ /* Maintain compatibility with old version of the function. That version
+ * did not take three arguments and returned everything to the stack.
+ * Yuk.
+ */
+ (void) push_string_array_elements (at);
+
+ free_and_return:
+ /* NULLs ok */
+ SLang_free_slstring (namespace_name);
+ SLang_free_slstring (pat);
+ SLang_free_array (at);
+}
+
+static int intrin_get_defines (void)
+{
+ int n = 0;
+ SLFUTURE_CONST char **s = _pSLdefines;
+
+ while (*s != NULL)
+ {
+	if (-1 == SLang_push_string (*s))
+	 {
+	 SLdo_pop_n ((unsigned int) n);
+	 return -1;
+	 }
+	s++;
+	n++;
+ }
+ return n;
+}
+
+static void intrin_get_reference (char *name)
+{
+ if (*name == '&') name++;
+ _pSLang_push_nt_as_ref (_pSLlocate_name (name));
+}
+
+static void intrin_get_namespaces (void)
+{
+ SLang_push_array (_pSLns_list_namespaces (), 1);
+}
+
+#ifdef HAVE_SYS_UTSNAME_H
+# include <sys/utsname.h>
+#endif
+
+static void uname_cmd (void)
+{
+#ifdef HAVE_UNAME
+ struct utsname u;
+ SLFUTURE_CONST char *field_names 6;
+ SLtype field_types6;
+ VOID_STAR field_values 6;
+ char *ptrs6;
+ int i;
+
+ if (-1 == uname (&u))
+ (void) SLang_push_null ();
+
+ field_names0 = "sysname"; ptrs0 = u.sysname;
+ field_names1 = "nodename"; ptrs1 = u.nodename;
+ field_names2 = "release"; ptrs2 = u.release;
+ field_names3 = "version"; ptrs3 = u.version;
+ field_names4 = "machine"; ptrs4 = u.machine;
+
+ for (i = 0; i < 5; i++)
+ {
+	field_typesi = SLANG_STRING_TYPE;
+	field_valuesi = (VOID_STAR) &ptrsi;
+ }
+
+ if (0 == SLstruct_create_struct (5, field_names, field_types, field_values))
+ return;
+#endif
+
+ SLang_push_null ();
+}
+
+static void uninitialize_ref_intrin (SLang_Ref_Type *ref)
+{
+ (void) _pSLang_uninitialize_ref (ref);
+}
+
+static int class_type_intrinsic (void)
+{
+ SLtype type;
+
+ if (-1 == SLang_pop_datatype (&type))
+ return -1;
+ return _pSLclass_get_class (type)->cl_class_type;
+}
+
+static int class_id_intrinsic (void)
+{
+ SLtype type;
+
+ if (-1 == SLang_pop_datatype (&type))
+ return -1;
+ return _pSLclass_get_class (type)->cl_data_type;
+}
+
+static void datatype_intrinsic (SLtype *t)
+{
+ SLang_Class_Type *cl;
+
+ if (0 == SLclass_is_class_defined (*t))
+ {
+	(void) SLang_push_null ();
+	return;
+ }
+
+ cl = _pSLclass_get_class (*t);
+ (void) SLang_push_datatype (cl->cl_data_type);
+}
+
+static int do_obj_cmp_fun (int (*fun)(SLang_Object_Type *, SLang_Object_Type *))
+{
+ int eqs;
+ SLang_Object_Type a, b;
+
+ if (-1 == SLang_pop (&b))
+ return -1;
+
+ if (-1 == SLang_pop (&a))
+ {
+	SLang_free_object (&b);
+	return -1;
+ }
+
+ eqs = (*fun) (&a, &b);
+
+ SLang_free_object (&a);
+ SLang_free_object (&b);
+ return eqs;
+}
+
+static int is_same_intrinsic (void)
+{
+ return do_obj_cmp_fun (_pSLclass_is_same_obj);
+}
+
+static int eqs_intrinsic (void)
+{
+ return do_obj_cmp_fun (_pSLclass_obj_eqs);
+}
+
+static int is_callable_intrinsic (void)
+{
+ SLang_Ref_Type *ref;
+ int ret;
+
+ if (SLang_peek_at_stack () != SLANG_REF_TYPE)
+ {
+	(void) SLdo_pop ();
+	return 0;
+ }
+
+ if (-1 == SLang_pop_ref (&ref))
+ return -1;
+
+ ret = _pSLang_ref_is_callable (ref);
+ SLang_free_ref (ref);
+
+ return ret;
+}
+
+static int is_numeric (SLtype type)
+{
+ /* Version 2: Add attributes to the class tables to simplify this.
+ * Also clarify exactly what _pSLang_is_arith_type is supposed to return.
+ */
+ if (0 == _pSLang_is_arith_type ((SLtype) type))
+ {
+	if (type == SLANG_COMPLEX_TYPE)
+	 return 3;
+
+	return 0;
+ }
+ if ((type == SLANG_DOUBLE_TYPE) || (type == SLANG_FLOAT_TYPE))
+ return 2;
+
+ return 1;
+}
+
+static int is_numeric_intrinsic (void)
+{
+ int type;
+
+ if (-1 == (type = SLang_peek_at_stack1 ()))
+ return -1;
+
+ (void) SLdo_pop ();
+ return is_numeric ((SLtype) type);
+}
+
+static int is_datatype_numeric_intrinsic (void)
+{
+ SLtype type;
+
+ if (-1 == SLang_pop_datatype (&type))
+ return -1;
+
+ return is_numeric (type);
+}
+
+static void lang_print_stack (void)
+{
+ (void) _pSLang_dump_stack ();
+}
+
+static int pop_array_or_string (SLtype itype, char **sp,
+				SLang_Array_Type **atsp, SLang_Array_Type **atip)
+{
+ char *s;
+
+ if (SLang_peek_at_stack () == SLANG_ARRAY_TYPE)
+ {
+	SLang_Array_Type *ats, *ati;
+
+	*sp = NULL;
+	if (-1 == SLang_pop_array_of_type (&ats, SLANG_STRING_TYPE))
+	 {
+	 *atsp = NULL;
+	 *atip = NULL;
+	 return -1;
+	 }
+	if (NULL == (ati = SLang_create_array1 (itype, 0, NULL, ats->dims, ats->num_dims, 1)))
+	 {
+	 *atsp = NULL;
+	 *atip = NULL;
+	 SLang_free_array (ats);
+	 return -1;
+	 }
+	*atsp = ats;
+	*atip = ati;
+	return 0;
+ }
+
+ *atsp = NULL;
+ *atip = NULL;
+ if (-1 == SLang_pop_slstring (&s))
+ {
+	*sp = NULL;
+	return -1;
+ }
+ *sp = s;
+ return 0;
+}
+
+#if SLANG_HAS_FLOAT
+static void intrin_atof (void)
+{
+ char *s;
+ SLang_Array_Type *ats;
+ SLang_Array_Type *ati;
+ double *ip;
+ char **strp, **strpmax;
+
+ if (-1 == pop_array_or_string (SLANG_DOUBLE_TYPE, &s, &ats, &ati))
+ return;
+
+ if (s != NULL)
+ {
+	(void) SLang_push_double(_pSLang_atof(s));
+	SLang_free_slstring (s);
+	return;
+ }
+
+ strp = (char **) ats->data;
+ strpmax = strp + ats->num_elements;
+ ip = (double *) ati->data;
+
+ while (strp < strpmax)
+ {
+	if (*strp == NULL)
+	 *ip++ = _pSLang_NaN;
+	else
+	 *ip++ = _pSLang_atof (*strp);
+	strp++;
+ }
+ SLang_free_array (ats);
+ (void) SLang_push_array (ati, 1);
+}
+#endif
+
+/* Convert string to integer */
+static void intrin_integer (void)
+{
+ char *s;
+ SLang_Array_Type *ats;
+ SLang_Array_Type *ati;
+ int *ip;
+ unsigned char **strp, **strpmax;
+
+ if (-1 == pop_array_or_string (SLANG_INT_TYPE, &s, &ats, &ati))
+ return;
+
+ if (s != NULL)
+ {
+	(void) SLang_push_integer (SLatoi ((unsigned char *) s));
+	SLang_free_slstring (s);
+	return;
+ }
+
+ strp = (unsigned char **) ats->data;
+ strpmax = strp + ats->num_elements;
+ ip = (int *) ati->data;
+
+ while ((strp < strpmax) && (_pSLang_Error == 0))
+ {
+	if (*strp == NULL)
+	 *ip++ = 0;
+	else
+	 *ip++ = SLatoi (*strp);
+	strp++;
+ }
+ SLang_free_array (ats);
+ (void) SLang_push_array (ati, 1);
+}
+/*}}}*/
+
+static void atoi_intrin (void)
+{
+ char *s;
+ SLang_Array_Type *ats;
+ SLang_Array_Type *ati;
+ int *ip;
+ char **strp, **strpmax;
+
+ if (-1 == pop_array_or_string (SLANG_INT_TYPE, &s, &ats, &ati))
+ return;
+
+ if (s != NULL)
+ {
+	(void) SLang_push_integer (atoi (s));
+	SLang_free_slstring (s);
+	return;
+ }
+
+ strp = (char **) ats->data;
+ strpmax = strp + ats->num_elements;
+ ip = (int *) ati->data;
+
+ while (strp < strpmax)
+ {
+	if (*strp == NULL)
+	 *ip++ = 0;
+	else
+	 *ip++ = atoi (*strp);
+	strp++;
+ }
+ SLang_free_array (ats);
+ (void) SLang_push_array (ati, 1);
+}
+
+static void atol_intrin (void)
+{
+ char *s;
+ SLang_Array_Type *ats;
+ SLang_Array_Type *ati;
+ long *ip;
+ char **strp, **strpmax;
+
+ if (-1 == pop_array_or_string (_pSLANG_LONG_TYPE, &s, &ats, &ati))
+ return;
+
+ if (s != NULL)
+ {
+	(void) SLang_push_long (atol (s));
+	SLang_free_slstring (s);
+	return;
+ }
+
+ strp = (char **) ats->data;
+ strpmax = strp + ats->num_elements;
+ ip = (long *) ati->data;
+
+ while (strp < strpmax)
+ {
+	if (*strp == NULL)
+	 *ip++ = 0;
+	else
+	 *ip++ = atol (*strp);
+	strp++;
+ }
+ SLang_free_array (ats);
+ (void) SLang_push_array (ati, 1);
+}
+
+#ifdef HAVE_LONG_LONG
+# ifdef HAVE_ATOLL
+# define ATOLL_FUN(s) atoll(s)
+# else
+# ifdef HAVE_STRTOLL
+# define ATOLL_FUN(s) strtoll((s), NULL, 10)
+# else
+# define ATOLL_FUN(s) strtol((s), NULL, 10)
+# endif
+# endif
+static void atoll_intrin (void)
+{
+ char *s;
+ SLang_Array_Type *ats;
+ SLang_Array_Type *ati;
+ long long *ip;
+ char **strp, **strpmax;
+
+ if (-1 == pop_array_or_string (_pSLANG_LLONG_TYPE, &s, &ats, &ati))
+ return;
+
+ if (s != NULL)
+ {
+	(void) SLang_push_long_long (ATOLL_FUN(s));
+	SLang_free_slstring (s);
+	return;
+ }
+
+ strp = (char **) ats->data;
+ strpmax = strp + ats->num_elements;
+ ip = (long long *) ati->data;
+
+ while (strp < strpmax)
+ {
+	if (*strp == NULL)
+	 *ip++ = 0;
+	else
+	 *ip++ = ATOLL_FUN (*strp);
+	strp++;
+ }
+ SLang_free_array (ats);
+ (void) SLang_push_array (ati, 1);
+}
+#endif
+
+static void autoload_intrinsic (char *a, char *b)
+{
+ SLang_autoload (a, b);
+}
+static int is_defined_intrin (char *s)
+{
+ return SLang_is_defined (s);
+}
+
+static int system_intrinsic (char *s)
+{
+ return SLsystem (s);
+}
+
+static int system_intr_intrinsic (char *s)
+{
+ return SLsystem_intr (s);
+}
+
+static int stack_depth_intrin (void)
+{
+ return SLstack_depth ();
+}
+
+static void expand_dollar_string (char *s)
+{
+ (void) _pSLpush_dollar_string (s);
+}
+
+#if SLANG_HAS_QUALIFIERS
+static void get_qualifiers_intrin (void)
+{
+ SLang_Struct_Type *q;
+ if (0 == _pSLang_get_qualifiers_intrin (&q))
+ (void) SLang_push_struct (q);
+}
+
+static int qualifier_exists_intrin (char *name)
+{
+ SLang_Struct_Type *q;
+
+ if (-1 == _pSLang_get_qualifiers_intrin (&q))
+ return -1;
+
+ if ((q == NULL)
+ || (NULL == _pSLstruct_get_field_value (q, name)))
+ return 0;
+
+ return 1;
+}
+
+static void qualifier_intrin (void)
+{
+ int has_default;
+ char *name;
+ SLang_Struct_Type *q;
+ SLang_Object_Type *objp;
+
+ if (-1 == _pSLang_get_qualifiers_intrin (&q))
+ return;
+
+ has_default = (SLang_Num_Function_Args == 2);
+ if (has_default)
+ {
+	if (-1 == SLroll_stack (2))
+	 return;
+ }
+
+ if (-1 == SLang_pop_slstring (&name))
+ return;
+
+ if (q != NULL)
+ objp = _pSLstruct_get_field_value (q, name);
+ else
+ objp = NULL;
+
+ SLang_free_slstring (name);
+
+ if (objp != NULL)
+ {
+	if (has_default)
+	 SLdo_pop ();
+	_pSLpush_slang_obj (objp);
+ }
+ else if (has_default == 0)
+ (void) SLang_push_null ();
+
+ /* Note: objp and q should _not_ be freed since they were not allocated */
+}
+#endif
+
+static void clear_error_intrin (void)
+{
+ (void) _pSLerr_clear_error (1);
+}
+
+#ifdef HAVE_ENVIRON
+
+/* In a shared library, macos requires a call to _NSGetEnviron to get the environ. */
+# if !defined(__APPLE__)
+extern char **environ; /* POSIX and ??? */
+# endif
+
+static char **get_sys_environ (void)
+{
+# if defined(__APPLE__)
+ char ***e = _NSGetEnviron ();
+ if (e == NULL) return NULL;
+ return *e;
+# else
+ return environ;
+# endif
+}
+
+static void get_environment (void)
+{
+ unsigned int num;
+ char **env, **e;
+
+ if (NULL == (env = get_sys_environ ()))
+ {
+	(void) SLang_push_null ();
+	return;
+ }
+
+ e = env;
+ num = 0;
+ while (*e != NULL)
+ {
+	num++;
+	e++;
+ }
+
+ (void) SLang_push_array (_pSLstrings_to_array (env, num), 1); /* NULL ok */
+}
+#endif				 /* HAVE_ENVIRON */
+
+static void set_argv_intrinsic (void);
+static SLang_Intrin_Fun_Type SLang_Basic_Table = /*{{{*/
+{
+ MAKE_INTRINSIC_0("__is_callable", is_callable_intrinsic, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_0("__is_numeric", is_numeric_intrinsic, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_0("__is_datatype_numeric", is_datatype_numeric_intrinsic, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_1("__is_initialized", _pSLang_is_ref_initialized, SLANG_INT_TYPE, SLANG_REF_TYPE),
+ MAKE_INTRINSIC_S("__get_reference", intrin_get_reference, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_1("__uninitialize", uninitialize_ref_intrin, SLANG_VOID_TYPE, SLANG_REF_TYPE),
+ MAKE_INTRINSIC_0("__is_same", is_same_intrinsic, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_0("__class_type", class_type_intrinsic, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_0("__class_id", class_id_intrinsic, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_1("__datatype", datatype_intrinsic, SLANG_VOID_TYPE, SLANG_SLTYPE_INT_TYPE),
+ MAKE_INTRINSIC_0("_eqs", eqs_intrinsic, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_S("get_doc_string_from_file", get_doc_string_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("add_doc_file", add_doc_file_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("get_doc_files", get_doc_files_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("set_doc_files", set_doc_files_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_SS("autoload", autoload_intrinsic, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("is_defined", is_defined_intrin, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_0("string", _pSLstring_intrinsic, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("uname", uname_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("getenv", intrin_getenv_cmd, SLANG_VOID_TYPE),
+#ifdef HAVE_PUTENV
+ MAKE_INTRINSIC_0("putenv", intrin_putenv, SLANG_VOID_TYPE),
+#endif
+#ifdef HAVE_ENVIRON
+ MAKE_INTRINSIC_0("get_environ", get_environment, SLANG_VOID_TYPE),
+#endif
+ MAKE_INTRINSIC_0("evalfile", load_file, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_I("char", char_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("eval", load_string, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("dup", do_dup, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("integer", intrin_integer, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("system", system_intrinsic, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_S("system_intr", system_intr_intrinsic, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_0("_apropos", intrin_apropos, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_get_namespaces", intrin_get_namespaces, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("_trace_function", _pSLang_trace_fun, SLANG_VOID_TYPE),
+#if SLANG_HAS_FLOAT
+ MAKE_INTRINSIC_0("atof", intrin_atof, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("double", intrin_double, SLANG_VOID_TYPE),
+#endif
+ MAKE_INTRINSIC_0("atoi", atoi_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("atol", atol_intrin, SLANG_VOID_TYPE),
+#ifdef HAVE_LONG_LONG
+ MAKE_INTRINSIC_0("atoll", atoll_intrin, SLANG_VOID_TYPE),
+#endif
+ MAKE_INTRINSIC_0("int", intrin_int, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("typecast", intrin_typecast, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_stkdepth", stack_depth_intrin, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_I("_stk_reverse", intrin_reverse_stack, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("typeof", intrin_type_info, VOID_TYPE),
+ MAKE_INTRINSIC_0("_typeof", intrin_type_info1, VOID_TYPE),
+ MAKE_INTRINSIC_I("_pop_n", intrin_pop_n, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_print_stack", lang_print_stack, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_I("_stk_roll", intrin_roll_stack, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_SI("byte_compile_file", byte_compile_file, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_clear_error", clear_error_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_function_name", intrin_function_name, SLANG_STRING_TYPE),
+#if SLANG_HAS_FLOAT
+ MAKE_INTRINSIC_S("set_float_format", _pSLset_double_format, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("get_float_format", _pSLget_double_format, SLANG_STRING_TYPE),
+#endif
+ MAKE_INTRINSIC_S("_slang_guess_type", guess_type, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("error", intrin_error, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("message", intrin_message, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("__get_defined_symbols", intrin_get_defines, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_I("__pop_args", _pSLstruct_pop_args, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_1("__push_args", _pSLstruct_push_args, SLANG_VOID_TYPE, SLANG_ARRAY_TYPE),
+ MAKE_INTRINSIC_0("usage", usage, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("implements", _pSLang_implements_intrinsic, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("use_namespace", _pSLang_use_namespace_intrinsic, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("current_namespace", _pSLang_cur_namespace_intrinsic, SLANG_STRING_TYPE),
+ MAKE_INTRINSIC_0("length", length_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("__set_argc_argv", set_argv_intrinsic, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("_$", expand_dollar_string, SLANG_VOID_TYPE),
+#if SLANG_HAS_QUALIFIERS
+ MAKE_INTRINSIC_0("__qualifiers", get_qualifiers_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("qualifier", qualifier_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("qualifier_exists", qualifier_exists_intrin, SLANG_INT_TYPE),
+#endif
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+/*}}}*/
+
+#ifdef SLANG_DOC_DIR
+SLFUTURE_CONST char *SLang_Doc_Dir = SLANG_DOC_DIR;
+#else
+SLFUTURE_CONST char *SLang_Doc_Dir = "";
+#endif
+
+#ifdef SLANG_INSTALL_PREFIX
+static SLCONST char *Install_Prefix = SLANG_INSTALL_PREFIX;
+#else
+static char *Install_Prefix = "";
+#endif
+
+static int obsolete_int_variable;
+static SLang_Intrin_Var_Type Intrin_Vars =
+{
+ MAKE_VARIABLE("_debug_info", &obsolete_int_variable, SLANG_INT_TYPE, 0),
+#if SLANG_HAS_BOSEOS
+ MAKE_VARIABLE("_boseos_info", &_pSLang_Compile_BOSEOS, SLANG_INT_TYPE, 0),
+ MAKE_VARIABLE("_bofeof_info", &_pSLang_Compile_BOFEOF, SLANG_INT_TYPE, 0),
+#endif
+ MAKE_VARIABLE("_auto_declare", &_pSLang_Auto_Declare_Globals, SLANG_INT_TYPE, 0),
+ MAKE_VARIABLE("_slangtrace", &_pSLang_Trace, SLANG_INT_TYPE, 0),
+ MAKE_VARIABLE("_slang_utf8_ok", &_pSLinterp_UTF8_Mode, SLANG_INT_TYPE, 1),
+ MAKE_VARIABLE("_slang_install_prefix", &Install_Prefix, SLANG_STRING_TYPE, 1),
+ MAKE_VARIABLE("NULL", NULL, SLANG_NULL_TYPE, 1),
+ SLANG_END_INTRIN_VAR_TABLE
+};
+
+int SLang_init_slang (void) /*{{{*/
+{
+ char name3;
+ unsigned int i;
+ SLFUTURE_CONST char **s;
+ static SLFUTURE_CONST char *sys_defines =
+ {
+#if defined(__os2__)
+	"OS2",
+#endif
+#if defined(__MSDOS__)
+	"MSDOS",
+#endif
+#if defined(__WIN16__)
+	"WIN16",
+#endif
+#if defined (__WIN32__)
+	"WIN32",
+#endif
+#if defined(__NT__)
+	"NT",
+#endif
+#if defined (VMS)
+	"VMS",
+#endif
+#ifdef REAL_UNIX_SYSTEM
+	"UNIX",
+#endif
+#if SLANG_HAS_FLOAT
+	"SLANG_DOUBLE_TYPE",
+#endif
+	NULL
+ };
+
+ if (-1 == _pSLerr_init ())
+ return -1;
+
+ if (-1 == _pSLregister_types ()) return -1;
+
+ if ((-1 == SLadd_intrin_fun_table(SLang_Basic_Table, NULL))
+ || (-1 == SLadd_intrin_var_table (Intrin_Vars, NULL))
+ || (-1 == _pSLang_init_slstrops ())
+ || (-1 == _pSLang_init_sltime ())
+ || (-1 == _pSLang_init_sllist ())
+ || (-1 == _pSLstruct_init ())
+#if SLANG_HAS_ASSOC_ARRAYS
+ || (-1 == SLang_init_slassoc ())
+#endif
+#if SLANG_HAS_BOSEOS
+ || (-1 == _pSLang_init_boseos ())
+#endif
+ || (-1 == _pSLang_init_exceptions ())
+ )
+ return -1;
+
+ /* More nonsense for the windoze loader */
+ if ((-1 == SLadd_intrinsic_variable ("_NARGS", &SLang_Num_Function_Args, SLANG_INT_TYPE, 1))
+ || (-1 == SLadd_intrinsic_variable ("_traceback", &SLang_Traceback, SLANG_INT_TYPE, 0))
+ || (-1 == SLadd_intrinsic_variable ("_slang_version", &SLang_Version, SLANG_INT_TYPE, 1))
+ || (-1 == SLadd_intrinsic_variable ("_slang_version_string", &SLang_Version_String, SLANG_STRING_TYPE, 1))
+ || (-1 == SLadd_intrinsic_variable ("_slang_doc_dir", &SLang_Doc_Dir, SLANG_STRING_TYPE, 1)))
+ return -1;
+
+ SLadd_global_variable (SLANG_SYSTEM_NAME);
+
+ s = sys_defines;
+ while (*s != NULL)
+ {
+	if (-1 == SLdefine_for_ifdef (*s)) return -1;
+	s++;
+ }
+
+ /* give temp global variables $0 --> $9 */
+ name2 = 0; name0 = '$';
+ for (i = 0; i < 10; i++)
+ {
+	name1 = (char) (i + '0');
+	SLadd_global_variable (name);
+ }
+
+ SLang_init_case_tables ();
+
+ /* Now add a couple of macros */
+ SLang_load_string (".(_NARGS 1 - Sprintf error)verror");
+ SLang_load_string (".(_NARGS 1 - Sprintf message)vmessage");
+
+#if SLANG_HAS_SIGNALS
+ if (-1 == SLang_add_interrupt_hook (_pSLang_check_signals_hook, NULL))
+ return -1;
+#endif
+
+ if ((SLang_Doc_Dir != NULL)
+ && (*SLang_Doc_Dir != 0))
+ {
+	char *docfile = SLpath_dircat (SLang_Doc_Dir, "slangfun.txt");
+	/* NULL ok */
+	(void) add_doc_file (docfile);
+	SLfree (docfile);
+ }
+
+ if (_pSLang_Error)
+ return -1;
+
+ return 0;
+}
+
+/*}}}*/
+
+static int This_Argc;
+static SLang_Array_Type *This_Argv = NULL;
+
+static int add_argc_argv (SLang_Array_Type *at)
+{
+ This_Argc = at->num_elements;
+ if (-1 == SLadd_intrinsic_variable ("__argc", (VOID_STAR)&This_Argc,
+				 SLANG_INT_TYPE, 1))
+ return -1;
+
+ if (-1 == SLadd_intrinsic_variable ("__argv", (VOID_STAR)at, SLANG_ARRAY_TYPE, 0))
+ return -1;
+ if (This_Argv != NULL)
+ SLang_free_array (This_Argv);
+ This_Argv = at;
+ return 0;
+}
+
+static void set_argv_intrinsic (void)
+{
+ SLang_Array_Type *at;
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_STRING_TYPE))
+ return;
+
+ if (-1 == add_argc_argv (at))
+ SLang_free_array (at);
+}
+
+int SLang_set_argc_argv (int argc, char **argv)
+{
+ SLang_Array_Type *at = _pSLstrings_to_array (argv, argc);
+
+ if (at == NULL)
+ return -1;
+
+ if (-1 == add_argc_argv (at))
+ {
+	SLang_free_array (at);
+	return -1;
+ }
+
+ return 0;
+}
+
+#if 0
+int SLang_set_argc_argv (int argc, char **argv)
+{
+ static int this_argc;
+ static char **this_argv;
+ int i;
+
+ if (argc < 0) argc = 0;
+ this_argc = argc;
+
+ if (NULL == (this_argv = (char **) _SLcalloc ((argc + 1), sizeof (char *))))
+ return -1;
+ memset ((char *) this_argv, 0, sizeof (char *) * (argc + 1));
+
+ for (i = 0; i < argc; i++)
+ {
+	if (NULL == (this_argvi = SLang_create_slstring (argvi)))
+	 goto return_error;
+ }
+
+ if (-1 == SLadd_intrinsic_variable ("__argc", (VOID_STAR)&this_argc,
+				 SLANG_INT_TYPE, 1))
+ goto return_error;
+
+ if (-1 == SLang_add_intrinsic_array ("__argv", SLANG_STRING_TYPE, 1,
+					(VOID_STAR) this_argv, 1, argc))
+ goto return_error;
+
+ return 0;
+
+ return_error:
+ for (i = 0; i < argc; i++)
+ SLang_free_slstring (this_argvi); /* NULL ok */
+ SLfree ((char *) this_argv);
+
+ return -1;
+}
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/slstdio.c Added

@@ -0,0 +1,1397 @@
+/* file stdio intrinsics for S-Lang */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#if defined(__unix__) || (defined (__os2__) && defined (__EMX__))
+# include <sys/types.h>
+#endif
+
+#ifdef HAVE_FCNTL_H
+# include <fcntl.h>
+#else
+# ifdef HAVE_SYS_FCNTL_H
+# include <sys/fcntl.h>
+# endif
+#endif
+
+#ifdef __unix__
+# include <sys/file.h>
+#endif
+
+#if defined(__BORLANDC__)
+# include <io.h>
+# include <dir.h>
+#endif
+
+#if defined(__DECC) && defined(VMS)
+# include <unixio.h>
+# include <unixlib.h>
+#endif
+
+#ifdef VMS
+# include <stat.h>
+#else
+# include <sys/stat.h>
+#endif
+
+#include <errno.h>
+
+#include <ctype.h>
+
+/* #define SL_APP_WANTS_FOREACH */
+#include "slang.h"
+#include "_slang.h"
+
+#ifdef HAVE_FSEEKO
+# define FSEEK(a,b,c) fseeko(a,b,c)
+# define FTELL(a) ftello(a)
+#else
+# define FSEEK(a,b,c) fseek(a,b,c)
+# define FTELL(a) ftell(a)
+#endif
+
+typedef struct
+{
+ FILE *fp;			 /* kind of obvious */
+ char *file;			 /* file name associated with pointer */
+
+ unsigned int flags;		 /* modes, etc... */
+#define SL_READ		0x0001
+#define SL_WRITE	0x0002
+#define SL_BINARY	0x0004
+#define SL_FDOPEN	0x2000
+#define SL_PIPE		0x4000
+#define SL_INUSE	0x8000
+
+ char *buf;
+ unsigned int buflen;
+}
+SL_File_Table_Type;
+
+static SL_File_Table_Type *SL_File_Table;
+
+static SL_File_Table_Type *get_free_file_table_entry (void)
+{
+ SL_File_Table_Type *t = SL_File_Table, *tmax;
+
+ tmax = t + SL_MAX_FILES;
+ while (t < tmax)
+ {
+	if (t->flags == 0)
+	 {
+	 memset ((char *) t, 0, sizeof (SL_File_Table_Type));
+	 return t;
+	 }
+	t++;
+ }
+
+ return NULL;
+}
+
+/* This function returns 1 if a system call should be restarted, otherwise 0 */
+static int handle_errno (int e)
+{
+#ifdef EINTR
+ if (e == EINTR)
+ {
+	if (0 == SLang_handle_interrupt ())
+	 {
+	 errno = 0;
+	 return 1;
+	 }
+ }
+#endif
+ _pSLerrno_errno = e;
+ return 0;
+}
+
+/* The man page for fputs indicates that it returns a non-negative integer, or
+ * EOF. It says nothing about how many bytes were sucessfully written. Sigh.
+ * So, use fwrite instead.
+ */
+static ssize_t signal_safe_fputs (char *buf, FILE *fp)
+{
+ size_t len;
+ size_t num_written;
+
+ len = strlen (buf);
+ num_written = 0;
+ while (num_written < len)
+ {
+	unsigned int n = len - num_written;
+	unsigned int dn;
+
+	clearerr (fp);
+	errno = 0;
+	dn = fwrite (buf + num_written, 1, n, fp);
+
+	num_written += dn;
+	if (dn < n)
+	 {
+	 int e = errno;
+
+	 /* The idea is that since some of the bytes were written
+	 * (dn != 0), trying it again would not hurt. The reason for this
+	 * is that sometimes glibc's fwrite would get interrupted by a
+	 * signal, but return with errno==0 (not EINTR), which resulted
+	 * in data being lost. So it seemed that as long as something was
+	 * being written, things would work out ok.
+	 *
+	 * However, it was discovered that this work-around would fail
+	 * when writing to a stream buffered pipe that was closed. In
+	 * such a case, glibc was returning a short non-zero item count
+	 * even though the underlying stream was closed. For this reason
+	 * I recommend that one should turn off stdio buffering when
+	 * writing to pipes. Here, a special check is added for EPIPE.
+	 */
+	 _pSLerrno_errno = e;
+	 if ((dn == 0)
+#ifdef EPIPE
+		 || (e == EPIPE)
+#endif
+		)
+	 {
+		 if (0 == handle_errno (e))
+		 break;
+	 }
+	 }
+ }
+ return num_written;
+}
+
+static int signal_safe_fgets (char *buf, unsigned int buflen, FILE *fp)
+{
+ errno = 0;
+
+ while (NULL == fgets (buf, buflen, fp))
+ {
+	if (0 == handle_errno (errno))
+	 return -1;
+ }
+ return 0;
+}
+
+static unsigned int file_process_flags (char *mode)
+{
+ char ch;
+ unsigned int flags = 0;
+
+ while (1)
+ {
+	ch = *mode++;
+	switch (ch)
+	 {
+	 case 'r': flags |= SL_READ;
+	 break;
+	 case 'w':
+	 case 'a':
+	 case 'A':
+	 flags |= SL_WRITE;
+	 break;
+	 case '+': flags |= SL_WRITE | SL_READ;
+	 break;
+	 case 'b': flags |= SL_BINARY;
+	 break;
+	 case 0:
+	 return flags;
+
+	 default:
+	 _pSLang_verror (SL_INVALID_PARM, "File flag %c is not supported", ch);
+	 return 0;
+	 }
+ }
+}
+
+static int open_file_type (char *file, int fd, char *mode,
+			 FILE *(*open_fun)(char *, char *),
+			 int (*close_fun)(FILE *),
+			 unsigned int xflags)
+{
+ FILE *fp;
+ SL_File_Table_Type *t;
+ unsigned int flags;
+ SLang_MMT_Type *mmt;
+
+ fp = NULL;
+ /* t = NULL; */
+ mmt = NULL;
+
+ if ((NULL == (t = get_free_file_table_entry ()))
+ || (0 == (flags = file_process_flags(mode))))
+ goto return_error;
+
+ while (1)
+ {
+	errno = 0;
+	if (fd != -1)
+	 fp = fdopen (fd, mode);
+	else
+	 fp = open_fun (file, mode);
+
+	if (fp != NULL)
+	 break;
+
+	if (0 == handle_errno (errno))
+	 goto return_error;
+ }
+
+ if (NULL == (mmt = SLang_create_mmt (SLANG_FILE_PTR_TYPE, (VOID_STAR) t)))
+ goto return_error;
+
+ t->fp = fp;
+ t->flags = flags | xflags;
+ fp = NULL;			 /* allow free_mmt to close fp */
+
+ if ((NULL != (t->file = SLang_create_slstring (file)))
+ && (0 == SLang_push_mmt (mmt)))
+ return 0;
+
+ /* drop */
+
+ return_error:
+ if (fp != NULL) (*close_fun) (fp);
+ if (mmt != NULL) SLang_free_mmt (mmt);
+ (void) SLang_push_null ();
+ return -1;
+}
+
+/* Since some compilers do not have popen/pclose prototyped and in scope,
+ * and pc compilers sometimes have silly prototypes involving PASCAL, etc.
+ * use wrappers around the function to avoid compilation errors.
+ */
+
+static FILE *fopen_fun (char *f, char *m)
+{
+ FILE *fp;
+
+ errno = 0;
+ while (NULL == (fp = fopen (f, m)))
+ {
+	if (0 == handle_errno (errno))
+	 return NULL;
+ }
+ return fp;
+}
+
+/* This function is used only the open_file_type function */
+static int fclose_fun (FILE *fp)
+{
+ if (EOF == fclose (fp))
+ {
+	(void) handle_errno (errno);
+	return -1;
+ }
+ return 0;
+}
+
+static void stdio_fopen (char *file, char *mode)
+{
+ (void) open_file_type (file, -1, mode, fopen_fun, fclose_fun, 0);
+}
+
+int _pSLstdio_fdopen (char *file, int fd, char *mode)
+{
+ if (fd == -1)
+ {
+	_pSLerrno_errno = EBADF;
+	(void) SLang_push_null ();
+	return -1;
+ }
+
+ return open_file_type (file, fd, mode, NULL, fclose_fun, SL_FDOPEN);
+}
+
+#ifdef HAVE_POPEN
+static int pclose_fun (FILE *fp)
+{
+ int status;
+
+ errno = 0;
+ status = pclose (fp);
+ if (status != 0)
+ _pSLerrno_errno = errno;
+ return status;
+}
+
+static FILE *popen_fun (char *file, char *mode)
+{
+ return popen (file, mode);
+}
+
+static void stdio_popen (char *file, char *mode)
+{
+ (void) open_file_type (file, -1, mode, popen_fun, pclose_fun, SL_PIPE);
+}
+#endif
+
+/* returns pointer to file entry if it is open and consistent with
+ flags. Returns NULL otherwise */
+static SLang_MMT_Type *pop_fp (unsigned int flags, FILE **fp_ptr)
+{
+ SL_File_Table_Type *t;
+ SLang_MMT_Type *mmt;
+
+ *fp_ptr = NULL;
+
+ if (NULL == (mmt = SLang_pop_mmt (SLANG_FILE_PTR_TYPE)))
+ return NULL;
+
+ t = (SL_File_Table_Type *) SLang_object_from_mmt (mmt);
+ if ((t->flags & flags)
+ && (NULL != (*fp_ptr = t->fp)))
+ return mmt;
+
+#ifdef EBADF
+ _pSLerrno_errno = EBADF;
+#endif
+ SLang_free_mmt (mmt);
+ return NULL;
+}
+
+static FILE *check_fp (SL_File_Table_Type *t, unsigned flags)
+{
+ if ((t != NULL) && (t->flags & flags))
+ return t->fp;
+
+ return NULL;
+}
+
+SLFUTURE_CONST char *SLang_get_name_from_fileptr (SLang_MMT_Type *mmt)
+{
+ SL_File_Table_Type *ft;
+
+ ft = (SL_File_Table_Type *) SLang_object_from_mmt (mmt);
+ if (ft == NULL)
+ return NULL;
+ return ft->file;
+}
+
+int SLang_pop_fileptr (SLang_MMT_Type **mmt, FILE **fp)
+{
+ if (NULL == (*mmt = pop_fp (0xFFFF, fp)))
+ return -1;
+
+ return 0;
+}
+
+int SLang_get_fileptr (SLang_MMT_Type *mmt, FILE **fpp)
+{
+ SL_File_Table_Type *t;
+
+ *fpp = NULL;
+ if (mmt == NULL)
+ return -1;
+
+ t = (SL_File_Table_Type *) SLang_object_from_mmt (mmt);
+ if (t == NULL)
+ return -1;
+
+ *fpp = t->fp;
+ return 0;
+}
+
+static int close_file_type (SL_File_Table_Type *t)
+{
+ int ret = 0;
+ FILE *fp;
+
+ if (t == NULL)
+ return -1;
+
+ fp = t->fp;
+
+ /* fclose should not be restarted upon EINTR. So, flush the stream
+ * and then close it. Assume the same for pclose.
+ */
+ if (NULL == fp) ret = -1;
+#if HAVE_POPEN
+ else if (t->flags & SL_PIPE)
+ ret = pclose (fp);
+#endif
+ else
+ {
+	if (t->flags & SL_WRITE)
+	 {
+	 errno = 0;
+	 while ((-1 == fflush (fp))
+		 && (1 == handle_errno (errno)))
+	 errno = 0;
+	 }
+	if (EOF == fclose (fp))
+	 ret = -1;
+ }
+
+ if (t->buf != NULL) SLfree (t->buf);
+ if (t->file != NULL) SLang_free_slstring (t->file);
+ memset ((char *) t, 0, sizeof (SL_File_Table_Type));
+ return ret;
+}
+
+static int stdio_fclose (void)
+{
+ int ret;
+ SLang_MMT_Type *mmt;
+ SL_File_Table_Type *t;
+
+ if (NULL == (mmt = SLang_pop_mmt (SLANG_FILE_PTR_TYPE)))
+ return -1;
+
+ t = (SL_File_Table_Type *) SLang_object_from_mmt (mmt);
+ if (NULL == check_fp (t, 0xFFFF))
+ {
+	SLang_free_mmt (mmt);
+	return -1;
+ }
+
+ if (t->flags & SL_FDOPEN)
+ _pSLfclose_fdopen_fp (mmt);
+
+ ret = close_file_type (t);
+
+ t->flags = SL_INUSE;
+ SLang_free_mmt (mmt);
+ return ret;
+}
+
+static int read_one_line (FILE *fp, char **strp, SLstrlen_Type *lenp, int trim_trailing)
+{
+ char buf512;
+ char *str;
+ size_t len;
+
+ *strp = NULL;
+ len = 0;
+ str = NULL;
+
+ while (-1 != signal_safe_fgets (buf, sizeof (buf), fp))
+ {
+	size_t dlen;
+	char *new_str;
+	int done_flag;
+
+	dlen = strlen (buf);
+	/* Note: If the file contains embedded \0 characters, then this
+	 * fails to work properly since dlen will not be correct.
+	 */
+	done_flag = ((dlen + 1 < sizeof (buf))
+		 || (bufdlen - 1 == '\n'));
+
+	if (done_flag && (str == NULL))
+	 {
+	 /* Avoid the malloc */
+	 str = buf;
+	 len = dlen;
+	 break;
+	 }
+
+	if (NULL == (new_str = (char *)SLrealloc (str, len + dlen + 1)))
+	 {
+	 SLfree (str);
+	 return -1;
+	 }
+
+	str = new_str;
+	strcpy (str + len, buf);
+	len += dlen;
+
+	if (done_flag) break;
+ }
+
+ if (str == NULL)
+ return 0;
+
+ if (trim_trailing)
+ {
+	unsigned int len1 = len;
+	while (len1)
+	 {
+	 len1--;
+	 if (0 == isspace ((unsigned char)strlen1))
+	 {
+		 len1++;
+		 break;
+	 }
+	 }
+	len = len1;
+ }
+
+ *strp = SLang_create_nslstring (str, len);
+ if (str != buf) SLfree (str);
+
+ if (*strp == NULL) return -1;
+
+ *lenp = len;
+ return 1;
+}
+
+/* returns number of characters read and pushes the string to the stack.
+ If it fails, it returns -1 */
+static int stdio_fgets (SLang_Ref_Type *ref, SL_File_Table_Type *t)
+{
+ char *s;
+ SLstrlen_Type len;
+ FILE *fp;
+ int status;
+
+ if (NULL == (fp = check_fp (t, SL_READ)))
+ return -1;
+
+ status = read_one_line (fp, &s, &len, 0);
+ if (status <= 0)
+ return -1;
+
+ status = SLang_assign_to_ref (ref, SLANG_STRING_TYPE, (VOID_STAR)&s);
+ _pSLang_free_slstring (s);
+
+ if (status == -1)
+ return -1;
+
+ return (int) len;
+}
+
+static void stdio_fgetslines_internal (FILE *fp, unsigned int n)
+{
+ unsigned int num_lines, max_num_lines;
+ char **list;
+ SLang_Array_Type *at;
+ SLindex_Type inum_lines;
+
+ if (n > 1024)
+ max_num_lines = 1024;
+ else
+ {
+	max_num_lines = n;
+	if (max_num_lines == 0)
+	 max_num_lines++;
+ }
+
+ list = (char **) _SLcalloc (max_num_lines, sizeof (char *));
+ if (list == NULL)
+ return;
+
+ num_lines = 0;
+ while (num_lines < n)
+ {
+	int status;
+	char *line;
+	SLstrlen_Type len;
+
+	status = read_one_line (fp, &line, &len, 0);
+	if (status == -1)
+	 goto return_error;
+
+	if (status == 0)
+	 break;
+
+	if (max_num_lines == num_lines)
+	 {
+	 char **new_list;
+
+	 if (max_num_lines + 4096 > n)
+	 max_num_lines = n;
+	 else
+	 max_num_lines += 4096;
+
+	 new_list = (char **) SLrealloc ((char *)list, sizeof (char *) * max_num_lines);
+	 if (new_list == NULL)
+	 {
+		 _pSLang_free_slstring (line);
+		 goto return_error;
+	 }
+	 list = new_list;
+	 }
+
+	listnum_lines = line;
+	num_lines++;
+ }
+
+ if (num_lines != max_num_lines)
+ {
+	char **new_list;
+
+	new_list = (char **)SLrealloc ((char *)list, sizeof (char *) * (num_lines + 1));
+	if (new_list == NULL)
+	 goto return_error;
+
+	list = new_list;
+ }
+
+ inum_lines = (SLindex_Type) num_lines;
+ if (NULL == (at = SLang_create_array (SLANG_STRING_TYPE, 0, (VOID_STAR) list, &inum_lines, 1)))
+ goto return_error;
+
+ if (-1 == SLang_push_array (at, 1))
+ SLang_push_null ();
+ return;
+
+return_error:
+ while (num_lines > 0)
+ {
+	num_lines--;
+	SLang_free_slstring (listnum_lines);
+ }
+ SLfree ((char *)list);
+ SLang_push_null ();
+}
+
+static void stdio_fgetslines (void)
+{
+ unsigned int n;
+ FILE *fp;
+ SLang_MMT_Type *mmt;
+
+ n = (unsigned int)-1;
+
+ if (SLang_Num_Function_Args == 2)
+ {
+	if (-1 == SLang_pop_uinteger (&n))
+	 return;
+ }
+
+ if (NULL == (mmt = pop_fp (SL_READ, &fp)))
+ {
+	SLang_push_null ();
+	return;
+ }
+
+ stdio_fgetslines_internal (fp, n);
+ SLang_free_mmt (mmt);
+}
+
+static int stdio_fputslines (void)
+{
+ char **lines, **lines_max;
+ int num;
+ FILE *fp;
+ SLang_MMT_Type *mmt;
+ SLang_Array_Type *at;
+
+ if (NULL == (mmt = pop_fp (SL_WRITE, &fp)))
+ return -1;
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_STRING_TYPE))
+ {
+	SLang_free_mmt (mmt);
+	return -1;
+ }
+ lines = (char **)at->data;
+ lines_max = lines + at->num_elements;
+
+ while (lines < lines_max)
+ {
+	if ((*lines != NULL)
+	 && (-1 == signal_safe_fputs (*lines, fp)))
+	 break;
+
+	lines++;
+ }
+ SLang_free_mmt (mmt);
+ num = (int) (lines - (char **)at->data);
+ SLang_free_array (at);
+ return num;
+}
+
+static int stdio_fputs (char *s, SL_File_Table_Type *t)
+{
+ FILE *fp;
+
+ if (NULL == (fp = check_fp (t, SL_WRITE)))
+ return -1;
+
+ return signal_safe_fputs (s, fp);
+}
+
+static int stdio_fflush (SL_File_Table_Type *t)
+{
+ FILE *fp;
+
+ if (NULL == (fp = check_fp (t, SL_WRITE)))
+ return -1;
+
+ errno = 0;
+ clearerr (fp);
+ while ((EOF == fflush (fp)) || ferror (fp))
+ {
+	if (0 == handle_errno (errno))
+	 return -1;
+	clearerr (fp);
+ }
+
+ return 0;
+}
+
+/* Helper function */
+static int check_ferror_and_realloc (FILE *fp, int ret, char **strp, unsigned int num_wanted,
+				 unsigned int num_read, unsigned int sizeof_type)
+{
+ if ((num_read == 0)
+ && (num_read != num_wanted))
+ ret = -1;
+
+ if ((ret == -1) && ferror (fp))
+ _pSLerrno_errno = errno;
+
+ if ((ret == 0)
+ && (num_read != num_wanted))
+ {
+	char *new_s;
+	unsigned int nbytes = num_read * sizeof_type;
+	new_s = (char *)SLrealloc (*strp, nbytes + 1);
+	if (new_s == NULL)
+	 ret = -1;
+	else
+	 *strp = new_s;
+ }
+ return ret;
+}
+
+static void stdio_fread_bytes (SLang_Ref_Type *ref, unsigned int *num_wantedp, SL_File_Table_Type *t)
+{
+ FILE *fp;
+ size_t num_read = 0, num_wanted = *num_wantedp;
+ int ret = -1;
+ char *buf = NULL;
+ SLstrlen_Type nwp1;
+ SLang_BString_Type *bs;
+ if (NULL == (fp = check_fp (t, SL_READ)))
+ goto the_return;
+
+ /* FIXME: until SLstrlen_Type == size_t, add this check */
+ nwp1 = num_wanted + 1;
+ if ((size_t)nwp1 != num_wanted+1)
+ {
+	SLang_set_error (SL_MALLOC_ERROR);
+	return;
+ }
+
+ if (NULL == (buf = (char *)SLmalloc (num_wanted + 1)))
+ goto the_return;
+
+ while (num_read < num_wanted)
+ {
+	size_t dnum;
+
+	dnum = fread (buf + num_read, sizeof(char), num_wanted-num_read, fp);
+	num_read += dnum;
+	if (num_read == num_wanted)
+	 break;
+
+	if (0 == handle_errno (errno))
+	 break;
+ }
+
+ ret = check_ferror_and_realloc (fp, 0, &buf, num_wanted, num_read, sizeof (char));
+ if (ret == -1)
+ goto the_return;
+
+ bs = SLbstring_create_malloced ((unsigned char *)buf, num_read, 1);
+ ret = SLang_assign_to_ref (ref, SLANG_BSTRING_TYPE, (VOID_STAR)&bs);
+ SLbstring_free (bs);
+ buf = NULL;
+
+ the_return:
+
+ if (buf != NULL) SLfree (buf);
+ if (ret == -1)
+ (void) SLang_push_integer (ret);
+ else
+ (void) SLang_push_uinteger (num_read);
+}
+
+/* Usage: n = fread (&str, data-type, nelems, fp); */
+static void stdio_fread (SLang_Ref_Type *ref, int *data_typep, unsigned int *num_elemns, SL_File_Table_Type *t)
+{
+ char *s;
+ FILE *fp;
+ int ret;
+ SLstrlen_Type num_read, num_to_read;
+ SLstrlen_Type nbytes;
+ SLang_Class_Type *cl;
+ size_t sizeof_type;
+ int data_type;
+
+ /* FIXME: priority = low : I should add some mechanism to support
+ * other types.
+ */
+ data_type = *data_typep;
+ if ((data_type == SLANG_BSTRING_TYPE) || (data_type == SLANG_STRING_TYPE))
+ {
+	stdio_fread_bytes (ref, num_elemns, t);
+	return;
+ }
+
+ ret = -1;
+ s = NULL;
+ /* cl = NULL; */
+
+ if (NULL == (fp = check_fp (t, SL_READ)))
+ goto the_return;
+
+ cl = _pSLclass_get_class ((SLtype) data_type);
+
+ if (cl->cl_fread == NULL)
+ {
+	_pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "fread does not support %s objects",
+		 cl->cl_name);
+	goto the_return;
+ }
+
+ sizeof_type = cl->cl_sizeof_type;
+
+ num_to_read = *num_elemns;
+ nbytes = num_to_read * sizeof_type;
+
+ s = (char *)SLmalloc (nbytes + 1);
+ if (s == NULL)
+ goto the_return;
+
+ ret = cl->cl_fread (data_type, fp, (VOID_STAR)s, num_to_read, &num_read);
+
+ ret = check_ferror_and_realloc (fp, ret, &s, num_to_read, num_read, sizeof_type);
+ if (ret == -1)
+ goto the_return;
+
+ if (num_read == 1)
+ {
+	ret = SLang_assign_to_ref (ref, data_type, (VOID_STAR)s);
+	SLfree (s);
+ }
+ else
+ {
+	SLang_Array_Type *at;
+	SLindex_Type inum_read = (SLindex_Type) num_read;
+	at = SLang_create_array (data_type, 0, (VOID_STAR)s, &inum_read, 1);
+	if (at == NULL)
+	 goto the_return;
+
+	ret = SLang_assign_to_ref (ref, SLANG_ARRAY_TYPE, (VOID_STAR)&at);
+	SLang_free_array (at);
+ }
+ s = NULL;
+ /* drop */
+the_return:
+ if (s != NULL)
+ SLfree (s);
+
+ if (ret == -1)
+ SLang_push_integer (ret);
+ else
+ SLang_push_uinteger (num_read);
+}
+
+/* Usage: n = fwrite (str, fp); */
+static void stdio_fwrite (SL_File_Table_Type *t)
+{
+ FILE *fp;
+ unsigned char *s;
+ SLstrlen_Type num_to_write, num_write;
+ int ret;
+ SLang_BString_Type *b;
+ SLang_Array_Type *at;
+ SLang_Class_Type *cl;
+
+ ret = -1;
+ b = NULL;
+ at = NULL;
+
+ switch (SLang_peek_at_stack ())
+ {
+ case SLANG_BSTRING_TYPE:
+ case SLANG_STRING_TYPE:
+	if (-1 == SLang_pop_bstring (&b))
+	 goto the_return;
+
+	if (NULL == (s = SLbstring_get_pointer (b, &num_to_write)))
+	 goto the_return;
+
+	cl = _pSLclass_get_class (SLANG_UCHAR_TYPE);
+	break;
+
+ default:
+	if (-1 == SLang_pop_array (&at, 1))
+	 goto the_return;
+
+	cl = at->cl;
+	num_to_write = at->num_elements;
+	s = (unsigned char *) at->data;
+ }
+
+ if (NULL == (fp = check_fp (t, SL_WRITE)))
+ goto the_return;
+
+ if (cl->cl_fwrite == NULL)
+ {
+	_pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "fwrite does not support %s objects", cl->cl_name);
+	goto the_return;
+ }
+
+ /* The cl_fwrite method should handle EINTR */
+ ret = cl->cl_fwrite (cl->cl_data_type, fp, s, num_to_write, &num_write);
+
+ if ((ret == -1) && ferror (fp))
+ _pSLerrno_errno = errno;
+
+ /* drop */
+ the_return:
+ if (b != NULL)
+ SLbstring_free (b);
+ if (at != NULL)
+ SLang_free_array (at);
+
+ if (ret == -1)
+ SLang_push_integer (ret);
+ else
+ SLang_push_uinteger (num_write);
+}
+
+static int stdio_fseek (SL_File_Table_Type *t, _pSLc_off_t_Type *ofs, int *whence)
+{
+ FILE *fp;
+
+ if (NULL == (fp = check_fp (t, 0xFFFF)))
+ return -1;
+
+ errno = 0;
+ while (-1 == FSEEK (fp, *ofs, *whence))
+ {
+	if (0 == handle_errno (errno))
+	 return -1;
+ }
+ return 0;
+}
+
+static void stdio_ftell (SL_File_Table_Type *t)
+{
+ FILE *fp;
+ _pSLc_off_t_Type ofs;
+
+ if (NULL == (fp = check_fp (t, 0xFFFF)))
+ {
+	(void) SLang_push_int (-1);
+	return;
+ }
+
+ errno = 0;
+ while (-1L == (ofs = FTELL (fp)))
+ {
+	if (0 == handle_errno (errno))
+	 {
+	 (void) SLang_push_int (-1);
+	 return;
+	 }
+ }
+ (void) SLANG_PUSH_OFF_T (ofs);
+}
+
+static int stdio_feof (SL_File_Table_Type *t)
+{
+ FILE *fp;
+
+ if (NULL == (fp = check_fp (t, 0xFFFF)))
+ return -1;
+
+ return feof (fp);
+}
+
+static int stdio_ferror (SL_File_Table_Type *t)
+{
+ FILE *fp;
+
+ if (NULL == (fp = check_fp (t, 0xFFFF)))
+ return -1;
+
+ return ferror (fp);
+}
+
+static void stdio_clearerr (SL_File_Table_Type *t)
+{
+ FILE *fp;
+
+ if (NULL != (fp = check_fp (t, 0xFFFF)))
+ clearerr (fp);
+}
+
+/* () = fprintf (fp, "FORMAT", arg...); */
+static int stdio_fprintf (void)
+{
+ char *s;
+ FILE *fp;
+ SLang_MMT_Type *mmt;
+ int status;
+
+ if (-1 == _pSLstrops_do_sprintf_n (SLang_Num_Function_Args - 2))
+ return -1;
+
+ if (-1 == SLang_pop_slstring (&s))
+ return -1;
+
+ if (NULL == (mmt = pop_fp (SL_WRITE, &fp)))
+ {
+	_pSLang_free_slstring (s);
+	return -1;
+ }
+
+ status = signal_safe_fputs (s, fp);
+
+ SLang_free_mmt (mmt);
+ _pSLang_free_slstring (s);
+ return status;
+}
+
+static int stdio_printf (void)
+{
+ char *s;
+ int status;
+
+ if (-1 == _pSLstrops_do_sprintf_n (SLang_Num_Function_Args - 1))
+ return -1;
+
+ if (-1 == SLang_pop_slstring (&s))
+ return -1;
+
+ status = signal_safe_fputs (s, stdout);
+
+ _pSLang_free_slstring (s);
+ return status;
+}
+
+#ifdef HAVE_SETVBUF
+static int stdio_setvbuf (SL_File_Table_Type *t, int *modep, int *sizep)
+{
+ FILE *fp;
+ int status;
+ char *newbuf;
+ unsigned int size;
+
+ if (NULL == (fp = check_fp (t, 0xFFFF)))
+ return -1;
+
+ if (*sizep < 0)
+ {
+	SLang_verror (SL_InvalidParm_Error, "setvbuf: Expecting a positive integer for the size parameter");
+	return -1;
+ }
+
+ size = (unsigned int) *sizep;
+ newbuf = NULL;
+
+ errno = 0;
+ if (*modep == _IONBF)
+ status = setvbuf (fp, NULL, _IONBF, 0);
+ else if (*sizep == 0)
+ status = setvbuf (fp, NULL, *modep, 0);
+ else
+ {
+	if (size == 0) size = BUFSIZ;
+
+	if (NULL == (newbuf = (char *)SLmalloc (size)))
+	 return -1;
+	errno = 0;
+	status = setvbuf (fp, newbuf, *modep, size);
+ }
+
+ if (status != 0)
+ {
+	_pSLerrno_errno = errno;
+	if (newbuf != NULL)
+	 SLfree (newbuf);
+	return -1;
+ }
+
+ if (newbuf != NULL)
+ {
+	if (t->buf != NULL)
+	 SLfree (t->buf);
+	t->buf = newbuf;
+	t->buflen = size;
+ }
+ return status;
+}
+#endif
+
+#define F SLANG_FILE_PTR_TYPE
+#define R SLANG_REF_TYPE
+#define I SLANG_INT_TYPE
+#define V SLANG_VOID_TYPE
+#define S SLANG_STRING_TYPE
+#define B SLANG_BSTRING_TYPE
+#define U SLANG_UINT_TYPE
+#define D SLANG_DATATYPE_TYPE
+static SLang_Intrin_Fun_Type Stdio_Name_Table =
+{
+ MAKE_INTRINSIC_0("fgetslines", stdio_fgetslines, V),
+ MAKE_INTRINSIC_0("fputslines", stdio_fputslines, I),
+ MAKE_INTRINSIC_SS("fopen", stdio_fopen, V),
+ MAKE_INTRINSIC_1("feof", stdio_feof, I, F),
+ MAKE_INTRINSIC_1("ferror", stdio_ferror, I, F),
+ MAKE_INTRINSIC_0("fclose", stdio_fclose, I),
+ MAKE_INTRINSIC_2("fgets", stdio_fgets, I, R, F),
+ MAKE_INTRINSIC_1("fflush", stdio_fflush, I, F),
+ MAKE_INTRINSIC_2("fputs", stdio_fputs, I, S, F),
+ MAKE_INTRINSIC_0("fprintf", stdio_fprintf, I),
+ MAKE_INTRINSIC_0("printf", stdio_printf, I),
+ MAKE_INTRINSIC_3("fseek", stdio_fseek, I, F, SLANG_C_OFF_T_TYPE, I),
+ MAKE_INTRINSIC_1("ftell", stdio_ftell, V, F),
+ MAKE_INTRINSIC_1("clearerr", stdio_clearerr, V, F),
+ MAKE_INTRINSIC_4("fread", stdio_fread, V, R, D, U, F),
+ MAKE_INTRINSIC_3("fread_bytes", stdio_fread_bytes, V, R, U, F),
+ MAKE_INTRINSIC_1("fwrite", stdio_fwrite, V, F),
+#ifdef HAVE_POPEN
+ MAKE_INTRINSIC_SS("popen", stdio_popen, V),
+ MAKE_INTRINSIC_0("pclose", stdio_fclose, I),
+#endif
+#ifdef HAVE_SETVBUF
+ MAKE_INTRINSIC_3("setvbuf", stdio_setvbuf, I, F, I, I),
+#endif
+ SLANG_END_INTRIN_FUN_TABLE
+};
+#undef F
+#undef I
+#undef R
+#undef V
+#undef S
+#undef B
+#undef U
+#undef D
+
+#ifndef SEEK_SET
+# define SEEK_SET 0
+#endif
+#ifndef SEEK_CUR
+# define SEEK_CUR 1
+#endif
+#ifndef SEEK_END
+# define SEEK_END 2
+#endif
+
+static SLang_IConstant_Type Stdio_Consts =
+{
+ MAKE_ICONSTANT("SEEK_SET", SEEK_SET),
+ MAKE_ICONSTANT("SEEK_END", SEEK_END),
+ MAKE_ICONSTANT("SEEK_CUR", SEEK_CUR),
+#ifdef _IONBF
+ MAKE_ICONSTANT("_IONBF", _IONBF),
+#endif
+#ifdef _IOLBF
+ MAKE_ICONSTANT("_IOLBF", _IOLBF),
+#endif
+#ifdef _IOFBF
+ MAKE_ICONSTANT("_IOFBF", _IOFBF),
+#endif
+ SLANG_END_ICONST_TABLE
+};
+
+static void destroy_file_type (SLtype type, VOID_STAR ptr)
+{
+ /* Do not change errno when a variable goes out of scope */
+ int e = _pSLerrno_errno;
+
+ (void) type;
+ (void) close_file_type ((SL_File_Table_Type *) ptr);
+
+ _pSLerrno_errno = e;
+}
+
+struct _pSLang_Foreach_Context_Type
+{
+ SLang_MMT_Type *mmt;
+ FILE *fp;
+#define CTX_USE_LINE		1
+#define CTX_USE_CHAR		2
+#define CTX_USE_LINE_WS		3
+ unsigned char type;
+};
+
+static SLang_Foreach_Context_Type *
+cl_foreach_open (SLtype type, unsigned int num)
+{
+ SLang_Foreach_Context_Type *c;
+ SLang_MMT_Type *mmt;
+ FILE *fp;
+
+ if (NULL == (mmt = pop_fp (SL_READ, &fp)))
+ return NULL;
+
+ /* type = CTX_USE_LINE; */
+
+ switch (num)
+ {
+	char *s;
+
+ case 0:
+	type = CTX_USE_LINE;
+	break;
+
+ case 1:
+	if (-1 == SLang_pop_slstring (&s))
+	 {
+	 SLang_free_mmt (mmt);
+	 return NULL;
+	 }
+	if (0 == strcmp (s, "char"))
+	 type = CTX_USE_CHAR;
+	else if (0 == strcmp (s, "line"))
+	 type = CTX_USE_LINE;
+	else if (0 == strcmp (s, "wsline"))
+	 type = CTX_USE_LINE_WS;
+	else
+	 {
+	 _pSLang_verror (SL_NOT_IMPLEMENTED,
+			 "using '%s' not supported by File_Type",
+			 s);
+	 _pSLang_free_slstring (s);
+	 SLang_free_mmt (mmt);
+	 return NULL;
+	 }
+	_pSLang_free_slstring (s);
+	break;
+
+ default:
+	SLdo_pop_n (num);
+	_pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "Usage: foreach (File_Type) using (line|wsline|char)");
+	SLang_free_mmt (mmt);
+	return NULL;
+ }
+
+ if (NULL == (c = (SLang_Foreach_Context_Type *) SLmalloc (sizeof (SLang_Foreach_Context_Type))))
+ {
+	SLang_free_mmt (mmt);
+	return NULL;
+ }
+ memset ((char *) c, 0, sizeof (SLang_Foreach_Context_Type));
+
+ c->type = type;
+ c->mmt = mmt;
+ c->fp = fp;
+
+ return c;
+}
+
+static void cl_foreach_close (SLtype type, SLang_Foreach_Context_Type *c)
+{
+ (void) type;
+ if (c == NULL) return;
+ SLang_free_mmt (c->mmt);
+ SLfree ((char *) c);
+}
+
+static int cl_foreach (SLtype type, SLang_Foreach_Context_Type *c)
+{
+ int status;
+ int ch;
+ SLuindex_Type len;
+ char *s;
+
+ (void) type;
+
+ if (c == NULL)
+ return -1;
+
+ switch (c->type)
+ {
+ case CTX_USE_CHAR:
+	if (EOF == (ch = getc (c->fp)))
+	 return 0;
+	if (-1 == SLang_push_uchar ((unsigned char) ch))
+	 return -1;
+	return 1;
+
+ case CTX_USE_LINE:
+ case CTX_USE_LINE_WS:
+	status = read_one_line (c->fp, &s, &len, (c->type==CTX_USE_LINE_WS));
+	if (status <= 0)
+	 return status;
+	if (0 == _pSLang_push_slstring (s))
+	 return 1;
+	return -1;
+ }
+
+ return -1;
+}
+
+static int Stdio_Initialized;
+static SLang_MMT_Type *Stdio_Mmts3;
+
+int SLang_init_stdio (void)
+{
+ unsigned int i;
+ SL_File_Table_Type *s;
+ SLang_Class_Type *cl;
+ SLFUTURE_CONST char *names3;
+
+ if (Stdio_Initialized)
+ return 0;
+
+ SL_File_Table = (SL_File_Table_Type *)SLcalloc(sizeof (SL_File_Table_Type), SL_MAX_FILES);
+ if (SL_File_Table == NULL)
+ return -1;
+
+ if (NULL == (cl = SLclass_allocate_class ("File_Type")))
+ return -1;
+
+ (void) SLclass_set_destroy_function (cl, destroy_file_type);
+ (void) SLclass_set_foreach_functions (cl, cl_foreach_open, cl_foreach, cl_foreach_close);
+
+ if (-1 == SLclass_register_class (cl, SLANG_FILE_PTR_TYPE, sizeof (SL_File_Table_Type), SLANG_CLASS_TYPE_MMT))
+ return -1;
+
+ if ((-1 == SLadd_intrin_fun_table(Stdio_Name_Table, "__STDIO__"))
+ || (-1 == SLadd_iconstant_table (Stdio_Consts, NULL))
+ || (-1 == _pSLerrno_init ()))
+ return -1;
+
+ names0 = "stdin";
+ names1 = "stdout";
+ names2 = "stderr";
+
+ s = SL_File_Table;
+ s->fp = stdin; s->flags = SL_READ;
+
+ s++;
+ s->fp = stdout; s->flags = SL_WRITE;
+
+ s++;
+ s->fp = stderr; s->flags = SL_WRITE|SL_READ;
+
+ s = SL_File_Table;
+ for (i = 0; i < 3; i++)
+ {
+	if (NULL == (s->file = SLang_create_slstring (namesi)))
+	 return -1;
+
+	if (NULL == (Stdio_Mmtsi = SLang_create_mmt (SLANG_FILE_PTR_TYPE, (VOID_STAR) s)))
+	 return -1;
+	SLang_inc_mmt (Stdio_Mmtsi);
+
+	if (-1 == SLadd_intrinsic_variable (s->file, (VOID_STAR)&Stdio_Mmtsi, SLANG_FILE_PTR_TYPE, 1))
+	 return -1;
+	s++;
+ }
+
+ Stdio_Initialized = 1;
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slstring.c Added

@@ -0,0 +1,722 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+typedef struct _pSLstring_Type
+{
+ struct _pSLstring_Type *next;
+ unsigned int ref_count;
+ SLstr_Hash_Type hash;
+ size_t len;
+ char bytes 1;
+}
+SLstring_Type;
+
+#define MAP_HASH_TO_INDEX(hash) ((hash) % SLSTRING_HASH_TABLE_SIZE)
+
+static SLstring_Type *String_Hash_Table SLSTRING_HASH_TABLE_SIZE;
+static char Single_Char_Strings 256 * 2;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+#define MAX_FREE_STORE_LEN 32
+static SLstring_Type *SLS_Free_Store MAX_FREE_STORE_LEN;
+
+# define NUM_CACHED_STRINGS 601
+typedef struct
+{
+ SLstring_Type *sls;
+ SLCONST char *str;
+}
+Cached_String_Type;
+static SLCONST char *Deleted_String = "*deleted*";
+static Cached_String_Type Cached_Strings NUM_CACHED_STRINGS;
+
+#define GET_CACHED_STRING(s) \
+ (Cached_Strings + (unsigned int)(((size_t) (s)) % NUM_CACHED_STRINGS))
+
+_INLINE_
+static void cache_string (SLstring_Type *sls)
+{
+ Cached_String_Type *cs;
+
+ cs = GET_CACHED_STRING(sls->bytes);
+ cs->str = sls->bytes;
+ cs->sls = sls;
+}
+
+_INLINE_
+static void uncache_string (SLCONST char *s)
+{
+ Cached_String_Type *cs;
+
+ cs = GET_CACHED_STRING(s);
+ if (cs->str == s)
+ {
+	cs->sls = NULL;
+	cs->str = Deleted_String;
+ }
+}
+#endif
+
+#if USE_NEW_HASH_CODE
+/* This hash algorithm comes from:
+ *
+ * Bob Jenkins, 1996. bob_jenkins@burtleburtle.net.
+ * You may use this code any way you wish, private, educational, or commercial. It's free.
+ * See http://burtleburtle.net/bob/hash/evahash.html
+ */
+
+#define mix(a,b,c) \
+{ \
+ a -= b; a -= c; a ^= (c>>13); \
+ b -= c; b -= a; b ^= (a<<8); \
+ c -= a; c -= b; c ^= (b>>13); \
+ a -= b; a -= c; a ^= (c>>12); \
+ b -= c; b -= a; b ^= (a<<16); \
+ c -= a; c -= b; c ^= (b>>5); \
+ a -= b; a -= c; a ^= (c>>3); \
+ b -= c; b -= a; b ^= (a<<10); \
+ c -= a; c -= b; c ^= (b>>15); \
+}
+
+_INLINE_
+SLstr_Hash_Type _pSLstring_hash (SLCONST unsigned char *s, SLCONST unsigned char *smax)
+{
+ register _pSLuint32_Type a,b,c;
+ unsigned int length = (unsigned int)(smax - s);
+ unsigned int len = length;
+
+ a = b = 0x9e3779b9; /* the golden ratio; an arbitrary value */
+ c = 0;
+
+ /*---------------------------------------- handle most of the key */
+ while (len >= 12)
+ {
+	a += (s0 +((_pSLuint32_Type)s1<<8) +((_pSLuint32_Type)s2<<16) +((_pSLuint32_Type)s3<<24));
+	b += (s4 +((_pSLuint32_Type)s5<<8) +((_pSLuint32_Type)s6<<16) +((_pSLuint32_Type)s7<<24));
+	c += (s8 +((_pSLuint32_Type)s9<<8) +((_pSLuint32_Type)s10<<16)+((_pSLuint32_Type)s11<<24));
+	mix(a,b,c);
+	s += 12; len -= 12;
+ }
+
+ /*------------------------------------- handle the last 11 bytes */
+ c += length;
+ switch(len) /* all the case statements fall through */
+ {
+ case 11: c+=((_pSLuint32_Type)s10<<24);
+ case 10: c+=((_pSLuint32_Type)s9<<16);
+ case 9 : c+=((_pSLuint32_Type)s8<<8);
+ /* the first byte of c is reserved for the length */
+ case 8 : b+=((_pSLuint32_Type)s7<<24);
+ case 7 : b+=((_pSLuint32_Type)s6<<16);
+ case 6 : b+=((_pSLuint32_Type)s5<<8);
+ case 5 : b+=s4;
+ case 4 : a+=((_pSLuint32_Type)s3<<24);
+ case 3 : a+=((_pSLuint32_Type)s2<<16);
+ case 2 : a+=((_pSLuint32_Type)s1<<8);
+ case 1 : a+=s0;
+ /* case 0: nothing left to add */
+ }
+ mix(a,b,c);
+
+ /*-------------------------------------------- report the result */
+ return (SLstr_Hash_Type) c;
+}
+#else
+_INLINE_
+unsigned long _pSLstring_hash (SLCONST unsigned char *s, SLCONST unsigned char *smax)
+{
+ register unsigned long h = 0;
+ register unsigned long sum = 0;
+ unsigned char *smax4;
+
+ smax4 = smax - 4;
+
+ while (s < smax4)
+ {
+	sum += s0;
+	h = sum + (h << 1);
+	sum += s1;
+	h = sum + (h << 1);
+	sum += s2;
+	h = sum + (h << 1);
+	sum += s3;
+	h = sum + (h << 1);
+
+	s += 4;
+ }
+
+ while (s < smax)
+ {
+	sum += *s++;
+	h ^= sum + (h << 3);	 /* slightly different */
+ }
+
+ return h;
+}
+#endif
+SLstr_Hash_Type SLcompute_string_hash (SLCONST char *s)
+{
+#if SLANG_OPTIMIZE_FOR_SPEED
+ Cached_String_Type *cs;
+
+ cs = GET_CACHED_STRING(s);
+ if (cs->str == s)
+ return cs->sls->hash;
+#endif
+ return _pSLstring_hash ((unsigned char *) s, (unsigned char *) s + strlen (s));
+}
+
+_INLINE_
+static SLstring_Type *find_slstring (SLCONST char *s, SLstr_Hash_Type hash)
+{
+ SLstring_Type *sls, *prev;
+ size_t idx = MAP_HASH_TO_INDEX(hash);
+
+ sls = String_Hash_Table idx;
+ if ((sls == NULL) || (sls->bytes == s)) return sls;
+
+ sls = sls->next;
+ if ((sls == NULL) || (sls->bytes == s)) return sls;
+
+ sls = sls->next;
+ if ((sls == NULL) || (sls->bytes == s)) return sls;
+
+ prev = sls;
+ sls = sls->next;
+ while (sls != NULL)
+ {
+	if (s == sls->bytes)
+	 {
+	 SLstring_Type *sls0;
+	 prev->next = sls->next;
+	 sls0 = String_Hash_Tableidx;
+	 String_Hash_Tableidx = sls;
+	 sls->next = sls0;
+	 return sls;
+	 }
+	prev = sls;
+	sls = sls->next;
+ }
+ return sls;
+}
+
+_INLINE_
+/* This routine works with any (long) string */
+static SLstring_Type *find_string (SLCONST char *s, unsigned int len, SLstr_Hash_Type hash)
+{
+ SLstring_Type *sls;
+
+ /* Assume it is an slstring */
+ sls = find_slstring (s, hash);
+ if (sls != NULL)
+ {
+	/* This means that sls->bytes == s. But the string that we are looking
+	 * for consists of just the first len bytes. Check that too.
+	 */
+	if (sls->len == len)
+	 return sls;
+ }
+
+ /* Ok, not an slstring. Try to find a matching one */
+ sls = String_Hash_Table (unsigned int) MAP_HASH_TO_INDEX(hash);
+
+ if (sls == NULL)
+ return NULL;
+
+ do
+ {
+	/* Note that we need to actually make sure that byteslen == 0.
+	 * In this case, it is not enough to just compare pointers. In fact,
+	 * this is called from create_nstring, etc... It is unlikely that the
+	 * pointer is a slstring
+	 */
+	if ((sls->hash == hash)
+	 && (sls->len == len)
+	 && (0 == strncmp (s, sls->bytes, len)))
+	 break;
+
+	sls = sls->next;
+ }
+ while (sls != NULL);
+
+ return sls;
+}
+
+_INLINE_
+static SLstring_Type *allocate_sls (unsigned int len)
+{
+ SLstring_Type *sls;
+#if SLANG_OPTIMIZE_FOR_SPEED
+
+ if ((len < MAX_FREE_STORE_LEN)
+ && (NULL != (sls = SLS_Free_Store len)))
+ {
+	SLS_Free_Storelen = NULL;
+	return sls;
+ }
+#endif
+ /* FIXME: use structure padding */
+ sls = (SLstring_Type *) SLmalloc (len + sizeof (SLstring_Type));
+ if (sls != NULL)
+ sls->len = len;
+ return sls;
+}
+
+_INLINE_
+static void free_sls (SLstring_Type *sls)
+{
+#if SLANG_OPTIMIZE_FOR_SPEED
+ size_t len = sls->len;
+ if ((len < MAX_FREE_STORE_LEN)
+ && (SLS_Free_Storelen == NULL))
+ {
+	SLS_Free_Store len = sls;
+	return;
+ }
+#endif
+ SLfree ((char *)sls);
+}
+
+_INLINE_
+static char *create_long_string (SLCONST char *s, size_t len, SLstr_Hash_Type hash)
+{
+ SLstring_Type *sls;
+
+ sls = find_string (s, len, hash);
+
+ if (sls != NULL)
+ {
+	sls->ref_count++;
+#if SLANG_OPTIMIZE_FOR_SPEED
+	cache_string (sls);
+#endif
+	return sls->bytes;
+ }
+
+ sls = allocate_sls (len);
+ if (sls == NULL)
+ return NULL;
+
+ strncpy (sls->bytes, s, len);
+ sls->byteslen = 0;
+ sls->ref_count = 1;
+ sls->hash = hash;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ cache_string (sls);
+#endif
+
+ hash = MAP_HASH_TO_INDEX(hash);
+ sls->next = String_Hash_Table (unsigned int)hash;
+ String_Hash_Table (unsigned int)hash = sls;
+
+ return sls->bytes;
+}
+
+_INLINE_
+static char *create_short_string (SLCONST char *s, unsigned int len)
+{
+ char ch;
+
+ /* Note: if len is 0, then it does not matter what *s is. This is
+ * important for SLang_create_nslstring.
+ */
+ if (len) ch = *s; else ch = 0;
+
+ len = 2 * (unsigned int) ((unsigned char) ch);
+ Single_Char_Strings len = ch;
+ Single_Char_Strings len + 1 = 0;
+ return Single_Char_Strings + len;
+}
+
+/* s cannot be NULL */
+_INLINE_
+static SLstr_Type *create_nstring (SLCONST char *s, size_t len, SLstr_Hash_Type *hash_ptr)
+{
+ SLstr_Hash_Type hash;
+
+ if (len < 2)
+ return create_short_string (s, len);
+
+ hash = _pSLstring_hash ((unsigned char *) s, (unsigned char *) (s + len));
+ *hash_ptr = hash;
+
+ return create_long_string (s, len, hash);
+}
+
+SLstr_Type *SLang_create_nslstring (SLFUTURE_CONST char *s, SLstrlen_Type len)
+{
+ SLstr_Hash_Type hash;
+ if (s == NULL)
+ return NULL;
+ return create_nstring (s, len, &hash);
+}
+
+char *_pSLstring_make_hashed_string (SLCONST char *s, SLstrlen_Type len, SLstr_Hash_Type *hashptr)
+{
+ SLstr_Hash_Type hash;
+
+ if (s == NULL) return NULL;
+
+ hash = _pSLstring_hash ((unsigned char *) s, (unsigned char *) s + len);
+ *hashptr = hash;
+
+ if (len < 2)
+ return create_short_string (s, len);
+
+ return create_long_string (s, len, hash);
+}
+
+char *_pSLstring_dup_hashed_string (SLCONST char *s, SLstr_Hash_Type hash)
+{
+ size_t len;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ Cached_String_Type *cs;
+
+ if (s == NULL) return NULL;
+ if (s0 == 0)
+ return create_short_string (s, 0);
+ if (s1 == 0)
+ return create_short_string (s, 1);
+
+ cs = GET_CACHED_STRING(s);
+ if (cs->str == s)
+ {
+	cs->sls->ref_count += 1;
+	return (char *) s;
+ }
+#else
+ if (s == NULL) return NULL;
+#endif
+
+ len = strlen (s);
+#if !SLANG_OPTIMIZE_FOR_SPEED
+ if (len < 2) return create_short_string (s, len);
+#endif
+
+ return create_long_string (s, len, hash);
+}
+
+/* This function requires an slstring!!! */
+SLCONST char *_pSLstring_dup_slstring (SLCONST char *s)
+{
+ SLstring_Type *sls;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ Cached_String_Type *cs;
+#endif
+
+ if (s == NULL)
+ return s;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ cs = GET_CACHED_STRING(s);
+ if (cs->str == s)
+ {
+	cs->sls->ref_count += 1;
+	return s;
+ }
+#endif
+ if ((s0 == 0) || (s1 == 0))
+ return s;
+
+ sls = (SLstring_Type *) (s - offsetof(SLstring_Type,bytes0));
+ sls->ref_count++;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ cache_string (sls);
+#endif
+ return s;
+}
+
+static void free_sls_string (SLstring_Type *sls)
+{
+ SLstring_Type *sls1, *prev;
+ SLstr_Hash_Type hash = sls->hash;
+
+ hash = MAP_HASH_TO_INDEX(hash);
+
+ sls1 = String_Hash_Table (unsigned int) hash;
+
+ prev = NULL;
+
+ /* This should not fail. */
+ while (sls1 != sls)
+ {
+	prev = sls1;
+	sls1 = sls1->next;
+ }
+
+ if (prev != NULL)
+ prev->next = sls->next;
+ else
+ String_Hash_Table (unsigned int) hash = sls->next;
+
+ free_sls (sls);
+}
+
+_INLINE_
+static void free_long_string (SLCONST char *s, SLstr_Hash_Type hash)
+{
+ SLstring_Type *sls;
+
+ if (NULL == (sls = find_slstring (s, hash)))
+ {
+	_pSLang_verror (SL_APPLICATION_ERROR, "invalid attempt to free string:%s", s);
+	return;
+ }
+
+ sls->ref_count--;
+ if (sls->ref_count != 0)
+ {
+#if SLANG_OPTIMIZE_FOR_SPEED
+	/* cache_string (sls, len, hash); */
+#endif
+	return;
+ }
+#if SLANG_OPTIMIZE_FOR_SPEED
+ uncache_string (s);
+#endif
+ free_sls_string (sls);
+}
+
+/* This routine may be passed NULL-- it is not an error. */
+void SLang_free_slstring (SLCONST char *s)
+{
+ SLstr_Hash_Type hash;
+ size_t len;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ Cached_String_Type *cs;
+#endif
+
+ if (s == NULL) return;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ cs = GET_CACHED_STRING(s);
+ if (cs->str == s)
+ {
+	SLstring_Type *sls = cs->sls;
+	if (sls->ref_count <= 1)
+	 {
+#if SLANG_OPTIMIZE_FOR_SPEED
+	 cs->sls = NULL;
+	 cs->str = Deleted_String;
+#endif
+	 free_sls_string (sls);
+	 }
+	else
+	 sls->ref_count -= 1;
+	return;
+ }
+#endif
+
+ if ((len = strlen (s)) < 2)
+ return;
+
+ hash = _pSLstring_hash ((unsigned char *)s, (unsigned char *) s + len);
+ free_long_string (s, hash);
+}
+
+char *SLang_create_slstring (SLFUTURE_CONST char *s)
+{
+ SLstr_Hash_Type hash;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ Cached_String_Type *cs;
+#endif
+
+ if (s == NULL) return NULL;
+#if SLANG_OPTIMIZE_FOR_SPEED
+ cs = GET_CACHED_STRING(s);
+ if (cs->str == s)
+ {
+	cs->sls->ref_count += 1;
+	return (char *) s;
+ }
+#endif
+
+ return create_nstring (s, strlen (s), &hash);
+}
+
+void _pSLfree_hashed_string (SLCONST char *s, size_t len, SLstr_Hash_Type hash)
+{
+ if ((s == NULL) || (len < 2)) return;
+ free_long_string (s, hash);
+}
+
+char *_pSLallocate_slstring (size_t len)
+{
+ SLstring_Type *sls = allocate_sls (len);
+ if (sls == NULL)
+ return NULL;
+
+ sls->hash = 0;
+ return sls->bytes;
+}
+
+void _pSLunallocate_slstring (char *s, size_t len)
+{
+ SLstring_Type *sls;
+
+ (void) len;
+ if (s == NULL)
+ return;
+
+ sls = (SLstring_Type *) (s - offsetof(SLstring_Type,bytes0));
+ free_sls (sls);
+}
+
+/* frees s upon error */
+char *_pSLcreate_via_alloced_slstring (char *s, size_t len)
+{
+ SLstr_Hash_Type hash;
+ SLstring_Type *sls;
+
+ if (s == NULL)
+ return NULL;
+
+ if (len < 2)
+ {
+	char *s1 = create_short_string (s, len);
+	_pSLunallocate_slstring (s, len);
+	return s1;
+ }
+
+ /* s is not going to be in the cache because when it was malloced, its
+ * value was unknown. This simplifies the coding.
+ */
+ hash = _pSLstring_hash ((unsigned char *)s, (unsigned char *)s + len);
+ sls = find_string (s, len, hash);
+ if (sls != NULL)
+ {
+	sls->ref_count++;
+	_pSLunallocate_slstring (s, len);
+	s = sls->bytes;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+	cache_string (sls);
+#endif
+	return s;
+ }
+
+ sls = (SLstring_Type *) (s - offsetof(SLstring_Type,bytes0));
+ sls->ref_count = 1;
+ sls->hash = hash;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ cache_string (sls);
+#endif
+
+ hash = MAP_HASH_TO_INDEX(hash);
+ sls->next = String_Hash_Table (unsigned int)hash;
+ String_Hash_Table (unsigned int)hash = sls;
+
+ return s;
+}
+
+/* Note, a and b may be ordinary strings. The result is an slstring */
+char *SLang_concat_slstrings (char *a, char *b)
+{
+ unsigned int lena, lenb, len;
+ char *c;
+
+ lena = _pSLstring_bytelen (a);
+ lenb = _pSLstring_bytelen (b);
+ len = lena + lenb;
+
+ c = _pSLallocate_slstring (len);
+ if (c == NULL)
+ return NULL;
+
+ memcpy (c, a, lena);
+ memcpy (c + lena, b, lenb);
+ clen = 0;
+
+ return _pSLcreate_via_alloced_slstring (c, len);
+}
+
+/* This routine is assumed to work even if s is not an slstring */
+size_t _pSLstring_bytelen (SLCONST SLstr_Type *s)
+{
+#if SLANG_OPTIMIZE_FOR_SPEED
+ Cached_String_Type *cs;
+
+ cs = GET_CACHED_STRING(s);
+ if (cs->str == s)
+ return cs->sls->len;
+#endif
+ return strlen (s);
+}
+
+/* The caller must ensure that this is an slstring */
+void _pSLang_free_slstring (SLstr_Type *s)
+{
+#if SLANG_OPTIMIZE_FOR_SPEED
+ Cached_String_Type *cs;
+#endif
+ SLstring_Type *sls;
+
+ if (s == NULL) return;
+
+#if SLANG_OPTIMIZE_FOR_SPEED
+ cs = GET_CACHED_STRING(s);
+ if (cs->str == s)
+ {
+	sls = cs->sls;
+	if (sls->ref_count <= 1)
+	 {
+#if SLANG_OPTIMIZE_FOR_SPEED
+	 cs->sls = NULL;
+	 cs->str = Deleted_String;
+#endif
+	 free_sls_string (sls);
+	 }
+	else
+	 sls->ref_count -= 1;
+	return;
+ }
+#endif
+
+ if ((s0 == 0) || (s1 == 0))
+ return;
+
+ sls = (SLstring_Type *) (s - offsetof(SLstring_Type,bytes0));
+ if (sls->ref_count > 1)
+ {
+	sls->ref_count--;
+	return;
+ }
+ free_long_string (s, sls->hash);
+}
+
+/* An SLstring is required */
+SLstr_Hash_Type _pSLstring_get_hash (SLstr_Type *s)
+{
+ SLstring_Type *sls;
+
+ if (s0 == 0)
+ return _pSLstring_hash ((unsigned char*)s, (unsigned char *)s);
+ if (s1 == 0)
+ return _pSLstring_hash ((unsigned char *)s, (unsigned char *)s+1);
+
+ sls = (SLstring_Type *) (s - offsetof(SLstring_Type,bytes0));
+ return sls->hash;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slstrops.c Added

@@ -0,0 +1,3130 @@
+/* -*- mode: C; mode: fold; -*- */
+/* string manipulation functions for S-Lang. */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+/*{{{ Include Files */
+
+#include <time.h>
+
+#ifndef __QNX__
+# if defined(__GO32__) || defined(__WATCOMC__)
+# include <dos.h>
+# include <bios.h>
+# endif
+#endif
+
+#if SLANG_HAS_FLOAT
+#include <math.h>
+#endif
+
+#include <string.h>
+#include <stdarg.h>
+#include <ctype.h>
+
+#ifndef isdigit
+# define isdigit(x) (((x) >= '0') && ((x) <= '9'))
+#endif
+
+#include "slang.h"
+#include "_slang.h"
+
+/*}}}*/
+
+#define STRLEN(x,ignore_combining) (_pSLinterp_UTF8_Mode \
+		 ? SLutf8_strlen ((SLuchar_Type *)(x), ignore_combining) \
+		 : strlen (x))
+#define SKIP_CHAR(s,smax) (_pSLinterp_UTF8_Mode \
+			 ? SLutf8_skip_char ((s),(smax)) : (s)+1)
+
+static SLwchar_Lut_Type *WhiteSpace_Lut;
+
+_INLINE_
+static SLwchar_Lut_Type *make_whitespace_lut (void)
+{
+ if (WhiteSpace_Lut != NULL)
+ return WhiteSpace_Lut;
+
+ return WhiteSpace_Lut = SLwchar_strtolut ((SLuchar_Type *)"\\s", 1, 1);
+}
+
+static SLwchar_Lut_Type *pop_lut (int *invertp)
+{
+ char *white;
+ int invert;
+ SLwchar_Lut_Type *lut;
+
+ if (-1 == SLang_pop_slstring (&white))
+ return NULL;
+ if (*white == '^')
+ invert = 1;
+ else
+ invert = 0;
+
+ lut = SLwchar_strtolut ((SLuchar_Type *)white+invert, 1, 1);
+ _pSLang_free_slstring (white);
+ *invertp = invert;
+ return lut;
+}
+
+static unsigned int do_trim (SLuchar_Type **beg, int do_beg,
+			 SLuchar_Type **end, int do_end,
+			 SLwchar_Lut_Type *lut, int invert) /*{{{*/
+{
+ unsigned int len;
+ SLuchar_Type *a, *b;
+ int ignore_combining = 0;
+
+ a = *beg;
+ len = _pSLstring_bytelen ((char *)a);
+ b = a + len;
+
+ if (do_beg)
+ a = SLwchar_skip_range (lut, a, b, ignore_combining, invert);
+
+ if (do_end)
+ b = SLwchar_bskip_range (lut, a, b, ignore_combining, invert);
+
+ len = (unsigned int) (b - a);
+ *beg = a;
+ *end = b;
+
+ return len;
+}
+
+/*}}}*/
+
+/*}}}*/
+
+static int pop_3_malloced_strings (char **a, char **b, char **c)
+{
+ *a = *b = *c = NULL;
+ if (-1 == SLpop_string (c))
+ return -1;
+
+ if (-1 == SLpop_string (b))
+ {
+	SLfree (*c);
+	*c = NULL;
+	return -1;
+ }
+
+ if (-1 == SLpop_string (a))
+ {
+	SLfree (*b);
+	SLfree (*c);
+	*b = *c = NULL;
+	return -1;
+ }
+
+ return 0;
+}
+
+static void free_3_malloced_strings (char *a, char *b, char *c)
+{
+ SLfree (a);
+ SLfree (b);
+ SLfree (c);
+}
+
+static void strcat_cmd (void) /*{{{*/
+{
+ char *c, *c1;
+ int nargs;
+ int i;
+ char **ptrs;
+ unsigned int len;
+ char *ptrs_buf10;
+
+ nargs = SLang_Num_Function_Args;
+ if (nargs <= 0) nargs = 2;
+
+ if (nargs <= 10)
+ ptrs = ptrs_buf;
+ else if (NULL == (ptrs = (char **)_SLcalloc (nargs, sizeof (char *))))
+ return;
+
+ memset ((char *) ptrs, 0, sizeof (char *) * nargs);
+
+ c = NULL;
+ i = nargs;
+ len = 0;
+ while (i != 0)
+ {
+	char *s;
+
+	i--;
+	if (-1 == SLang_pop_slstring (&s))
+	 goto free_and_return;
+	ptrsi = s;
+	len += _pSLstring_bytelen (s);
+ }
+ if (NULL == (c = _pSLallocate_slstring (len)))
+ goto free_and_return;
+
+ c1 = c;
+ for (i = 0; i < nargs; i++)
+ {
+	unsigned int len2 = _pSLstring_bytelen (ptrsi);
+	memcpy (c1, ptrsi, len2);
+	c1 += len2; /* c1 does not take advantage of the slstring cache */
+ }
+ *c1 = 0;
+
+ free_and_return:
+ for (i = 0; i < nargs; i++)
+ _pSLang_free_slstring (ptrsi);
+ if (ptrs != ptrs_buf)
+ SLfree ((char *) ptrs);
+
+ (void) _pSLpush_alloced_slstring (c, len); /* NULL ok */
+}
+
+/*}}}*/
+
+_INLINE_
+static int _pSLang_push_nstring (char *a, unsigned int len)
+{
+ a = SLang_create_nslstring (a, len);
+ if (a == NULL)
+ return -1;
+
+ if (0 == SLclass_push_ptr_obj (SLANG_STRING_TYPE, (VOID_STAR)a))
+ return 0;
+
+ SLang_free_slstring (a);
+ return -1;
+}
+
+static int str_replace_cmd_1 (char *orig, char *match, char *rep, unsigned int max_num_replaces,
+			 char **new_strp) /*{{{*/
+{
+ char *s, *t, *new_str;
+ size_t rep_len, match_len, new_len;
+ unsigned int num_replaces;
+
+ *new_strp = NULL;
+
+ match_len = strlen (match);
+
+ if (match_len == 0)
+ return 0;
+
+ num_replaces = 0;
+ s = orig;
+ while (num_replaces < max_num_replaces)
+ {
+	s = strstr (s, match);
+	if (s == NULL)
+	 break;
+	s += match_len;
+	num_replaces++;
+ }
+
+ if (num_replaces == 0)
+ return 0;
+
+ max_num_replaces = num_replaces;
+
+ rep_len = strlen (rep);
+
+ new_len = (strlen (orig) - num_replaces * match_len) + num_replaces * rep_len;
+ new_str = (char *)SLmalloc (new_len + 1);
+ if (new_str == NULL)
+ return -1;
+
+ s = orig;
+ t = new_str;
+
+ for (num_replaces = 0; num_replaces < max_num_replaces; num_replaces++)
+ {
+	char *next_s;
+	unsigned int len;
+
+	next_s = strstr (s, match); /* cannot be NULL */
+	len = (unsigned int) (next_s - s);
+	memcpy (t, s, len);
+	t += len;
+	memcpy (t, rep, rep_len);
+	t += rep_len;
+
+	s = next_s + match_len;
+ }
+ strcpy (t, s);		 /* will \0 terminate t */
+ *new_strp = new_str;
+
+ return (int) num_replaces;
+}
+
+/*}}}*/
+
+static void reverse_string (char *a)
+{
+ char *b;
+
+ b = a + strlen (a);
+ while (b > a)
+ {
+	char ch;
+
+	b--;
+	ch = *a;
+	*a++ = *b;
+	*b = ch;
+ }
+}
+
+static void strreplace_cmd (void)
+{
+ char *orig, *match, *rep;
+ char *new_str;
+ int max_num_replaces = -1;
+ int ret;
+ int has_max_num_replaces;
+
+ has_max_num_replaces = (SLang_Num_Function_Args == 4);
+ if (has_max_num_replaces
+ && (-1 == SLang_pop_int (&max_num_replaces)))
+ return;
+
+ if (-1 == pop_3_malloced_strings (&orig, &match, &rep))
+ return;
+
+ if (has_max_num_replaces == 0)
+ max_num_replaces = _pSLstring_bytelen (orig);
+
+ if (max_num_replaces < 0)
+ {
+	reverse_string (orig);
+	reverse_string (match);
+	reverse_string (rep);
+	ret = str_replace_cmd_1 (orig, match, rep, -max_num_replaces, &new_str);
+	if (ret > 0) reverse_string (new_str);
+	else if (ret == 0)
+	 reverse_string (orig);
+ }
+ else ret = str_replace_cmd_1 (orig, match, rep, max_num_replaces, &new_str);
+
+ if (ret >= 0)
+ {
+	if (ret == 0)
+	 {
+	 (void) SLang_push_malloced_string (orig); /* Always frees orig */
+	 orig = NULL;
+	 }
+	else
+	 (void) SLang_push_malloced_string (new_str);
+
+	if (has_max_num_replaces)
+	 (void) SLang_push_integer (ret);
+ }
+ free_3_malloced_strings (orig, match, rep);
+}
+
+/* FIXME: This function is deprecated and should removed */
+static int str_replace_cmd (char *orig, char *match, char *rep)
+{
+ char *s;
+ int ret;
+
+ ret = str_replace_cmd_1 (orig, match, rep, 1, &s);
+ if (ret == 1)
+ (void) SLang_push_malloced_string (s);
+ return ret;
+}
+
+static void strtok_cmd (char *str)
+{
+ _pSLString_List_Type sl;
+ SLuchar_Type *s, *smax, *white;
+ SLwchar_Lut_Type *lut;
+ int invert;
+ int ignore_combining = 0;
+
+ invert = 0;
+
+ if (SLang_Num_Function_Args == 1)
+ {
+	white = NULL;
+	lut = make_whitespace_lut ();
+ }
+ else
+ {
+	white = (SLuchar_Type *)str;
+	if (-1 == SLang_pop_slstring (&str))
+	 return;
+	if (*white == '^')
+	 {
+	 invert = 1;
+	 white++;
+	 }
+	lut = SLwchar_strtolut (white, 1, 1);
+ }
+
+ if ((lut == NULL)
+ || (-1 == _pSLstring_list_init (&sl, 256, 1024)))
+ goto the_return;
+
+ s = (SLuchar_Type *)str;
+ smax = s + _pSLstring_bytelen ((SLstr_Type *)s);
+ while (s < smax)
+ {
+	SLuchar_Type *s0;
+	char *new_s;
+
+	/* Skip whitespace */
+	s0 = SLwchar_skip_range (lut, s, smax, ignore_combining, invert);
+
+	if (s0 == smax)
+	 break;
+
+	/* skip non-whitespace */
+	s = SLwchar_skip_range (lut, s0, smax, ignore_combining, !invert);
+
+	new_s = SLang_create_nslstring ((char *)s0, (unsigned int) (s - s0));
+	if (new_s == NULL)
+	 {
+	 _pSLstring_list_delete (&sl);
+	 goto the_return;
+	 }
+	if (-1 == _pSLstring_list_append (&sl, new_s))
+	 {
+	 _pSLang_free_slstring (new_s);
+	 _pSLstring_list_delete (&sl);
+	 goto the_return;
+	 }
+ }
+
+ /* Deletes sl */
+ (void) _pSLstring_list_push (&sl, 1);
+
+ the_return:
+ if (white != NULL)
+ {
+	_pSLang_free_slstring (str);
+	SLwchar_free_lut (lut);
+ }
+}
+
+/* This routine returns the string with text removed between single character
+ comment delimiters from the set b and e. */
+
+static void str_uncomment_string_cmd (char *str, char *b, char *e) /*{{{*/
+{
+ SLuchar_Type *s, *smax, *bmax, *emax;
+ SLwchar_Lut_Type *lut;
+ size_t len, elen, blen;
+ SLuchar_Type *etable;
+ SLuchar_Type *b1, *e1;
+ int ignore_combining = 0;
+
+ blen = _pSLstring_bytelen (b);
+ elen = _pSLstring_bytelen (e);
+
+ if (((elen != blen) && (_pSLinterp_UTF8_Mode == 0))
+ || (_pSLinterp_UTF8_Mode
+	 && SLutf8_strlen ((SLuchar_Type*)b,ignore_combining) != SLutf8_strlen ((SLuchar_Type*)e,ignore_combining)))
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Comment delimiter length mismatch.");
+	return;
+ }
+
+ if (NULL == (etable = (SLuchar_Type *) _SLcalloc (blen, (SLUTF8_MAX_MBLEN+1))))
+ return;
+
+ b1 = (SLuchar_Type *) b;
+ e1 = (SLuchar_Type *) e;
+ emax = e1 + elen;
+ bmax = b1 + blen;
+
+ if (_pSLinterp_UTF8_Mode)
+ {
+	while (b1 < bmax)
+	 {
+	 SLuchar_Type *et = etable + (SLUTF8_MAX_MBLEN+1)*((char*)b1-b);
+	 e1 = SLutf8_extract_utf8_char (e1, emax, et);
+	 b1 = SLutf8_skip_char (b1, bmax);
+	 }
+ }
+ else
+ {
+	while (b1 < bmax)
+	 {
+	 SLuchar_Type *et = etable + (SLUTF8_MAX_MBLEN+1)*((char*)b1-b);
+	 *et++ = *e1++; *et = 0;
+	 b1++;
+	 }
+ }
+
+ if (NULL == (lut = SLwchar_strtolut ((SLuchar_Type *)b, 0, 0)))
+ {
+	SLfree ((char *)etable);
+	return;
+ }
+
+ len = strlen (str);
+
+ if (NULL == (str = (char *) SLmake_nstring(str, len)))
+ {
+	SLwchar_free_lut (lut);
+	SLfree ((char *)etable);
+	return;
+ }
+
+ s = (SLuchar_Type *) str;
+ smax = s + len;
+
+ while (s < smax)
+ {
+	SLuchar_Type *s1, *s2;
+	SLuchar_Type bufSLUTF8_MAX_MBLEN+1;
+
+	s = SLwchar_skip_range (lut, s, smax, ignore_combining, 1);
+	if (s == smax)
+	 break;
+
+	/* s is now at the position of the comment-start character.
+	 * Skip to the corresponding comment-end character.
+	 */
+	if (_pSLinterp_UTF8_Mode)
+	 s1 = SLutf8_extract_utf8_char (s, smax, buf);
+	else
+	 {
+	 s1 = s;
+	 buf0 = *s1++;
+	 buf1 = 0;
+	 }
+
+	/* buf contains the comment-start character. Find the corresponding
+	 * comment end via the etable constructed above. The use of
+	 * strstr should not fail, unless there is an error in the algorithm.
+	 */
+	e1 = etable + (strstr (b, (char*)buf) - b) * (SLUTF8_MAX_MBLEN+1);
+
+	s1 = (SLuchar_Type *)strstr ((char*)s1, (char*)e1);
+	if (s1 != NULL)
+	 s1 += strlen ((char*)e1);
+	else
+	 s1 = smax;
+
+	/* Delete characters between s and s1 */
+	s2 = s;
+	while (s1 < smax)
+	 *s2++ = *s1++;
+	*s2 = 0;
+
+	smax = s2;
+ }
+ (void) SLang_push_malloced_string (str); /* frees str */
+ SLwchar_free_lut (lut);
+ SLfree ((char *)etable);
+ return;
+}
+
+/*}}}*/
+
+static void str_quote_string_cmd (char *str, char *quotes, SLwchar_Type *slash_ptr) /*{{{*/
+{
+ char *q, *q1;
+ int slash;
+ size_t len;
+ SLwchar_Lut_Type *lut;
+ SLuchar_Type slash_utf8 SLUTF8_MAX_MBLEN+1;
+ SLuchar_Type *s, *smax;
+ unsigned int slash_len;
+ int ignore_combining = 0;
+
+ slash = *slash_ptr;
+
+ if (NULL == _pSLinterp_encode_wchar (slash, slash_utf8, &slash_len))
+ return;
+
+ lut = SLwchar_strtolut ((SLuchar_Type *)quotes, 0, 0);
+ if (lut == NULL)
+ return;
+
+ /* Make sure slash character gets escaped */
+ if (-1 == SLwchar_add_range_to_lut (lut, slash, slash))
+ {
+	SLwchar_free_lut (lut);
+	return;
+ }
+
+ /* calculate length */
+ s = (SLuchar_Type *) str;
+ len = strlen (str);
+ smax = s + len;
+
+ while (1)
+ {
+	SLuchar_Type *s1;
+
+	s1 = SLwchar_skip_range (lut, s, smax, ignore_combining, 1);
+	if (s1 == smax)
+	 break;
+
+	len += slash_len;
+	s = SKIP_CHAR(s1, smax);
+ }
+ len++;			 /* null terminate */
+
+ if (NULL == (q = (char *)SLmalloc(len)))
+ {
+	SLwchar_free_lut (lut);
+	return;
+ }
+
+ s = (SLuchar_Type *) str; q1 = q;
+ while (1)
+ {
+	SLuchar_Type *s1;
+	unsigned int dlen;
+
+	s1 = SLwchar_skip_range (lut, s, smax, ignore_combining, 1);
+
+	dlen = (unsigned int) (s1 - s);
+	memcpy (q1, (char *)s, dlen);
+	q1 += dlen;
+
+	if (s1 == smax)
+	 break;
+
+	memcpy (q1, (char *)slash_utf8, slash_len);
+	q1 += slash_len;
+
+	s = SKIP_CHAR(s1, smax);
+	dlen = (unsigned int) (s - s1);
+	memcpy (q1, s1, dlen);
+	q1 += dlen;
+ }
+ *q1 = 0;
+ (void) SLang_push_malloced_string(q); /* frees q */
+ SLwchar_free_lut (lut);
+}
+
+/*}}}*/
+
+static void subbytes_cmd (SLstr_Type *a, int *n_ptr, int *m_ptr) /*{{{*/
+{
+ int m;
+ size_t n;
+ size_t lena;
+
+ n = (*n_ptr - 1);
+ m = *m_ptr;
+
+ lena = _pSLstring_bytelen (a);
+
+ if (n > lena)
+ n = lena;
+
+ if (m < 0) m = lena;
+ if (n + m > lena) m = lena - n;
+
+ (void) _pSLang_push_nstring (a + n, (unsigned int) m);
+}
+
+/*}}}*/
+
+static void substr_cmd (SLstr_Type *a, int *n_ptr, int *m_ptr) /*{{{*/
+{
+ int n, m;
+ int lena;
+ int ignore_combining;
+ char *a1;
+
+ if (_pSLinterp_UTF8_Mode == 0)
+ {
+	subbytes_cmd (a, n_ptr, m_ptr);
+	return;
+ }
+
+ ignore_combining = 0;
+
+ n = *n_ptr;
+ m = *m_ptr;
+
+ lena = SLutf8_strlen ((SLuchar_Type *)a, ignore_combining);
+
+ if (n > lena) n = lena + 1;
+ if (n < 1)
+ {
+	SLang_set_error (SL_INVALID_PARM);
+	return;
+ }
+
+ n--;
+ if (m < 0) m = lena;
+ if (n + m > lena) m = lena - n;
+
+ /* FIXME: Are the strlens necessary here? */
+ a = (char *)SLutf8_skip_chars ((SLuchar_Type *)a, (SLuchar_Type*)a + strlen(a),
+				 (unsigned int)n, NULL, ignore_combining);
+
+ a1 = (char *)SLutf8_skip_chars ((SLuchar_Type *)a, (SLuchar_Type*)a + strlen(a),
+				 (unsigned int)m, NULL, ignore_combining);
+
+ (void) _pSLang_push_nstring (a, (unsigned int)(a1 - a));
+}
+
+/*}}}*/
+
+/* substitute byte ch at byte-position n in string*/
+static void strbytesub_cmd (int *nptr, char *chp)
+{
+ char *a;
+ size_t n;
+ size_t lena;
+
+ if (-1 == SLpop_string (&a))
+ return;
+
+ n = (*nptr-1);
+ lena = strlen (a);
+
+ if (n >= lena)
+ {
+	SLang_set_error (SL_INVALID_PARM);
+	SLfree(a);
+	return;
+ }
+
+ an = *chp;
+
+ SLang_push_malloced_string (a);
+}
+
+/* substitute char m at position n in string*/
+static void strsub_cmd (int *nptr, SLwchar_Type *mptr) /*{{{*/
+{
+ char *a;
+ size_t n;
+ SLwchar_Type m;
+ size_t lena;
+ int ignore_combining = 0;
+
+ if (-1 == SLpop_string (&a))
+ return;
+
+ n = (unsigned int) *nptr;
+ m = (SLwchar_Type) *mptr;
+
+ lena = STRLEN (a, ignore_combining);
+
+ if ((n == 0) || (lena < n))
+ {
+	SLang_set_error (SL_INVALID_PARM);
+	SLfree(a);
+	return;
+ }
+
+ /* The API for this function specifies 1-based indices */
+ n--;
+ if (_pSLinterp_UTF8_Mode)
+ {
+
+	SLstr_Type *b = SLutf8_subst_wchar ((SLuchar_Type *)a,
+					 (SLuchar_Type *)a + strlen (a),
+					 m, n, ignore_combining);
+	if (b != NULL)
+	 _pSLang_push_slstring (b); /* frees b */
+
+	SLfree (a);
+	return;
+ }
+
+ an = (char) m;
+
+ SLang_push_malloced_string (a);
+}
+
+/*}}}*/
+
+
+static int pop_wchar (SLwchar_Type *wchp)
+{
+ if (SLang_peek_at_stack() == SLANG_STRING_TYPE)
+ {
+	char *s;
+	SLwchar_Type wch;
+
+	if (-1 == SLang_pop_slstring (&s))
+	 return -1;
+
+	if (_pSLinterp_UTF8_Mode)
+	 {
+	 if (NULL == SLutf8_decode ((unsigned char *)s, (unsigned char *)s+strlen(s), &wch, NULL))
+	 wch = 0;
+	 }
+	else wch = s0;
+
+	_pSLang_free_slstring (s);
+	*wchp = wch;
+	return 0;
+ }
+
+ return _pSLang_pop_wchar (wchp);
+}
+
+#define ISXXX_INTRIN(name,isxxx) \
+ static int name (void) \
+ { \
+ SLwchar_Type wch; \
+ if (-1 == pop_wchar (&wch)) \
+	return -1; \
+ return (0 != isxxx (wch)); \
+ }
+ISXXX_INTRIN(islower_intrin, SLwchar_islower)
+ISXXX_INTRIN(isupper_intrin, SLwchar_isupper)
+ISXXX_INTRIN(isalpha_intrin, SLwchar_isalpha)
+ISXXX_INTRIN(isxdigit_intrin, SLwchar_isxdigit)
+ISXXX_INTRIN(isspace_intrin, SLwchar_isspace)
+ISXXX_INTRIN(isblank_intrin, SLwchar_isblank)
+ISXXX_INTRIN(iscntrl_intrin, SLwchar_iscntrl)
+ISXXX_INTRIN(isprint_intrin, SLwchar_isprint)
+ISXXX_INTRIN(isdigit_intrin, SLwchar_isdigit)
+ISXXX_INTRIN(isgraph_intrin, SLwchar_isgraph)
+ISXXX_INTRIN(isalnum_intrin, SLwchar_isalnum)
+ISXXX_INTRIN(ispunct_intrin, SLwchar_ispunct)
+static int isascii_fun (SLwchar_Type wch)
+{
+ return wch < 0x80;
+}
+ISXXX_INTRIN(isascii_intrin, isascii_fun)
+
+static int pop_skipintrin_args (SLuchar_Type **strp, SLstrlen_Type *lenp, SLstrlen_Type *posp, int *skip_combp)
+{
+ char *str;
+ SLstrlen_Type len, pos;
+
+ *skip_combp = 1;
+ if (SLang_Num_Function_Args == 3)
+ {
+	if (-1 == SLang_pop_int (skip_combp))
+	 return -1;
+ }
+ if (-1 == SLang_pop_strlen_type (&pos))
+ return -1;
+ if (-1 == SLang_pop_slstring (&str))
+ return -1;
+ len = _pSLstring_bytelen (str);
+ if (pos > len)
+ {
+	SLang_verror (SL_Index_Error, "%s", "String index lies outside the string");
+	SLang_free_slstring (str);
+	return -1;
+ }
+ *strp = (SLuchar_Type *)str;
+ *lenp = len;
+ *posp = pos;
+ return 0;
+}
+
+/* Usage: (wc, pos) = strskipchar (str, pos ,skip_comb);
+ */
+static void strskipchar_intrin (void)
+{
+ SLuchar_Type *str, *str0, *str1, *strmax;
+ int skip_combining;
+ SLstrlen_Type pos, len;
+ SLwchar_Type wch;
+
+ if (-1 == pop_skipintrin_args (&str, &len, &pos, &skip_combining))
+ return;
+
+ str0 = str + pos;
+ strmax = str + len;
+ if (str0 == strmax)
+ {
+	(void) SLang_push_strlen_type (pos);
+	(void) SLang_push_uchar (0);
+	goto free_and_return;
+ }
+ if (_pSLinterp_UTF8_Mode == 0)
+ {
+	(void) SLang_push_strlen_type (pos+1);
+	(void) SLang_push_uchar (*str0);
+	goto free_and_return;
+ }
+ str1 = SLutf8_skip_chars (str0, strmax, 1, NULL, skip_combining);
+ pos = str1 - str;
+ (void) SLang_push_strlen_type (pos);
+
+ if (NULL == SLutf8_decode (str0, str1, &wch, NULL))
+ {
+	(void) SLang_push_integer (-(int)*str0);
+	goto free_and_return;
+ }
+ (void) SLang_push_wchar (wch);
+ /* drop */
+free_and_return:
+ SLang_free_slstring ((char *)str);
+}
+
+static void strbskipchar_intrin (void)
+{
+ SLuchar_Type *str, *str0, *str1;
+ int skip_combining;
+ SLstrlen_Type pos, len;
+ SLwchar_Type wch;
+
+ if (-1 == pop_skipintrin_args (&str, &len, &pos, &skip_combining))
+ return;
+
+ str0 = str + pos;
+ if (pos == 0)
+ {
+	(void) SLang_push_strlen_type (pos);
+	(void) SLang_push_uchar (0);
+	goto free_and_return;
+ }
+ if (_pSLinterp_UTF8_Mode == 0)
+ {
+	(void) SLang_push_strlen_type (pos-1);
+	(void) SLang_push_uchar (*(str0-1));
+	goto free_and_return;
+ }
+ str1 = SLutf8_bskip_chars (str, str0, 1, NULL, skip_combining);
+ pos = str1 - str;
+ (void) SLang_push_strlen_type (pos);
+
+ if (NULL == SLutf8_decode (str1, str0, &wch, NULL))
+ {
+	(void) SLang_push_integer (-(int)*str1);
+	goto free_and_return;
+ }
+ (void) SLang_push_wchar (wch);
+ /* drop */
+free_and_return:
+ SLang_free_slstring ((char *)str);
+}
+
+static int toupper_cmd (SLwchar_Type *ch) /*{{{*/
+{
+ if (_pSLinterp_UTF8_Mode)
+ return SLwchar_toupper (*ch);
+
+ return UPPER_CASE(*ch);
+}
+
+/*}}}*/
+
+static int tolower_cmd (SLwchar_Type *ch) /*{{{*/
+{
+ if (_pSLinterp_UTF8_Mode)
+ return SLwchar_tolower (*ch);
+
+ return LOWER_CASE(*ch);
+}
+
+/*}}}*/
+
+static SLang_Array_Type *do_strchop (SLuchar_Type *str, SLwchar_Type delim, SLwchar_Type quote)
+{
+ SLindex_Type count;
+ SLuchar_Type *s0, *s1;
+ SLang_Array_Type *at;
+ char **data;
+ SLuchar_Type delim_utf8 SLUTF8_MAX_MBLEN+1;
+ SLuchar_Type quote_utf8 SLUTF8_MAX_MBLEN+1;
+ unsigned int delim_len, quote_len;
+ SLwchar_Lut_Type *lut;
+ SLuchar_Type *smax;
+ int ignore_combining = 0;
+
+ if (NULL == _pSLinterp_encode_wchar ((SLwchar_Type)delim, delim_utf8, &delim_len))
+ return NULL;
+ if (NULL == _pSLinterp_encode_wchar ((SLwchar_Type)quote, quote_utf8, &quote_len))
+ return NULL;
+
+ if (NULL == (lut = SLwchar_create_lut (2)))
+ return NULL;
+
+ if ((-1 == SLwchar_add_range_to_lut (lut, delim, delim))
+ || ((quote != 0)
+	 && (-1 == SLwchar_add_range_to_lut (lut, quote, quote))))
+ {
+	SLwchar_free_lut (lut);
+	return NULL;
+ }
+
+ smax = str + strlen ((char *) str);
+ s1 = s0 = str;
+
+ count = 1;			 /* at least 1 */
+
+ /* Count strings on first pass */
+ while (1)
+ {
+	SLwchar_Type wch;
+
+	/* Look for the delimiter or the quote */
+	s1 = SLwchar_skip_range (lut, s1, smax, ignore_combining, 1);
+
+	if (s1 == smax)
+	 break;
+
+	/* Test for quote */
+	if (NULL == (s1 = _pSLinterp_decode_wchar (s1, smax, &wch)))
+	 {
+	 SLwchar_free_lut (lut);
+	 return NULL;
+	 }
+
+	if ((wch == quote) && quote)
+	 {
+	 if (s1 == smax)
+	 break;
+
+	 s1 = SKIP_CHAR(s1, smax);
+	 continue;
+	 }
+
+	if (wch == delim)
+	 {
+	 count++;
+	 continue;
+	 }
+ }
+
+ if (NULL == (at = SLang_create_array (SLANG_STRING_TYPE, 0, NULL, &count, 1)))
+ {
+	SLwchar_free_lut (lut);
+	return NULL;
+ }
+
+ data = (char **)at->data;
+
+ count = 0;
+ s1 = str;
+
+ while (1)
+ {
+	SLwchar_Type wch;
+	char *elm;
+
+	/* Look for the delimiter or the quote */
+	s1 = SLwchar_skip_range (lut, s1, smax, ignore_combining, 1);
+
+	if (s1 != smax)
+	 {
+	 SLuchar_Type *s1_save = s1;
+
+	 if (NULL == (s1 = _pSLinterp_decode_wchar (s1, smax, &wch)))
+	 break;
+
+	 if ((wch == quote) && quote)
+	 {
+		 if (s1 != smax)
+		 s1 = SKIP_CHAR (s1, smax);
+
+		 continue;
+	 }
+	 s1 = s1_save;
+	 /* Otherwise it must be the delim */
+	 }
+	elm = SLang_create_nslstring ((char *)s0, (unsigned int) (s1 - s0));
+
+	if (elm == NULL)
+	 break;
+
+	datacount = elm;
+	count++;
+
+	if (s1 == smax)
+	 {
+	 SLwchar_free_lut (lut);
+	 return at;
+	 }
+
+	s1 = SKIP_CHAR(s1, smax); /* skip past delim */
+	s0 = s1;		 /* and reset */
+ }
+
+ SLwchar_free_lut (lut);
+ SLang_free_array (at);
+ return NULL;
+}
+
+static void strchop_cmd (char *str, SLwchar_Type *q, SLwchar_Type *d)
+{
+ (void) SLang_push_array (do_strchop ((SLuchar_Type *)str, *q, *d), 1);
+}
+
+static void strchopr_cmd (char *str, SLwchar_Type *q, SLwchar_Type *d)
+{
+ SLang_Array_Type *at;
+
+ if (NULL != (at = do_strchop ((SLuchar_Type *)str, *q, *d)))
+ {
+	char **d0, **d1;
+
+	d0 = (char **) at->data;
+	d1 = d0 + (at->num_elements - 1);
+
+	while (d0 < d1)
+	 {
+	 char *tmp;
+
+	 tmp = *d0;
+	 *d0 = *d1;
+	 *d1 = tmp;
+	 d0++;
+	 d1--;
+	 }
+ }
+ SLang_push_array (at, 1);
+}
+
+/*}}}*/
+
+typedef struct
+{
+ SLstr_Type **sp;
+ SLuindex_Type num;
+ SLstr_Type *str;
+ SLang_Array_Type *at;
+}
+Array_Or_String_Type;
+
+static int pop_array_or_string (Array_Or_String_Type *aos)
+{
+ char *str;
+
+ if (SLang_peek_at_stack () == SLANG_ARRAY_TYPE)
+ {
+	SLang_Array_Type *at;
+	aos->str = NULL;
+	if (-1 == SLang_pop_array_of_type (&at, SLANG_STRING_TYPE))
+	 {
+	 aos->at = NULL;
+	 return -1;
+	 }
+	aos->num = at->num_elements;
+	aos->sp = (char **)at->data;
+	aos->at = at;
+	return 0;
+ }
+ aos->at = NULL;
+ if (-1 == SLang_pop_slstring (&str))
+ {
+	aos->str = NULL;
+	return -1;
+ }
+ aos->num = 1;
+ aos->sp = &str;
+ aos->str = str;
+ return 0;
+}
+
+static void free_array_or_string (Array_Or_String_Type *aos)
+{
+ if (aos->str != NULL)
+ {
+	SLang_free_slstring (aos->str);
+	return;
+ }
+ if (aos->at != NULL)
+ {
+	SLang_free_array (aos->at);
+	return;
+ }
+}
+
+static int pop_matched_array_or_string (Array_Or_String_Type *aos, Array_Or_String_Type *bos,
+					int *is_arrayp)
+{
+ if (-1 == pop_array_or_string (bos))
+ return -1;
+ if (-1 == pop_array_or_string (aos))
+ {
+	free_array_or_string (bos);
+	return -1;
+ }
+ if (0 == (*is_arrayp = (aos->at != NULL) || (bos->at != NULL)))
+ return 0;
+
+ if ((aos->num != bos->num)
+ && (aos->at != NULL) && (bos->at != NULL))
+ {
+	SLang_verror (SL_InvalidParm_Error, "String arrays must be the same length.");
+	free_array_or_string (aos);
+	free_array_or_string (bos);
+	return -1;
+ }
+ return 0;
+}
+
+static int arraymap_int_func_str_str (int (*func)(char *, char *, void *), void *cd)
+{
+ int status = -1;
+ int is_array;
+ Array_Or_String_Type aos, bos;
+ SLang_Array_Type *int_at;
+ int *int_at_data;
+ SLuindex_Type i, num;
+
+ if (-1 == pop_matched_array_or_string (&aos, &bos, &is_array))
+ return -1;
+ if (0 == is_array)
+ {
+	status = SLang_push_int ((*func)(aos.str, bos.str, cd));
+	goto free_and_return;
+ }
+
+ if (aos.at != NULL)
+ {
+	char **astrs, **bstrs;
+	if (NULL == (int_at = (SLang_create_array1 (SLANG_INT_TYPE, 0, NULL, aos.at->dims, aos.at->num_dims, 0))))
+	 goto free_and_return;
+
+	int_at_data = (int *)int_at->data;
+	num = aos.num;
+	astrs = aos.sp;
+	if (bos.at == NULL)
+	 {
+	 char *b = bos.str;
+	 for (i = 0; i < num; i++)
+	 int_at_datai = (*func)(astrsi, b, cd);
+	 goto push_and_return;
+	 }
+	bstrs = bos.sp;
+	for (i = 0; i < num; i++)
+	 int_at_datai = (*func)(astrsi, bstrsi, cd);
+	goto push_and_return;
+ }
+
+ if (NULL == (int_at = (SLang_create_array1 (SLANG_INT_TYPE, 0, NULL, bos.at->dims, bos.at->num_dims, 0))))
+ goto free_and_return;
+
+ int_at_data = (int *)int_at->data;
+ num = bos.num;
+ for (i = 0; i < num; i++)
+ int_at_datai = (*func)(aos.str, bos.spi, cd);
+
+ /* drop */
+
+push_and_return:
+ status = SLang_push_array (int_at, 1);
+ /* drop */
+free_and_return:
+ free_array_or_string (&aos);
+ free_array_or_string (&bos);
+ return status;
+}
+
+static int arraymap_int_func_str (int (*func)(char *, void *), void *cd)
+{
+ SLang_Array_Type *int_at, *at;
+ SLuindex_Type i, num;
+ int *int_at_data;
+ char **at_data;
+
+ if (SLang_peek_at_stack () != SLANG_ARRAY_TYPE)
+ {
+	int status;
+	char *str;
+
+	if (-1 == SLang_pop_slstring (&str))
+	 return -1;
+	status = SLang_push_int ((*func)(str, cd));
+	SLang_free_slstring (str);
+	return status;
+ }
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_STRING_TYPE))
+ return -1;
+
+ if (NULL == (int_at = (SLang_create_array1 (SLANG_INT_TYPE, 0, NULL, at->dims, at->num_dims, 0))))
+ {
+	SLang_free_array (at);
+	return -1;
+ }
+
+ at_data = (char **)at->data;
+ int_at_data = (int *)int_at->data;
+ num = at->num_elements;
+ for (i = 0; i < num; i++)
+ int_at_datai = (*func)(at_datai, cd);
+
+ SLang_free_array (at);
+ return SLang_push_array (int_at, 1);
+}
+
+static int arraymap_str_func_str (char *(*func)(char *, void *), void *cd)
+{
+ SLang_Array_Type *at, *bt;
+ SLuindex_Type i, num;
+ char **adata, **bdata;
+
+ if (SLang_peek_at_stack () != SLANG_ARRAY_TYPE)
+ {
+	char *a, *b;
+
+	if (-1 == SLang_pop_slstring (&a))
+	 return -1;
+
+	b = (*func)(a, cd);
+	SLang_free_slstring (a);
+	return _pSLang_push_slstring (b); /* frees string */
+ }
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_STRING_TYPE))
+ return -1;
+
+ if (NULL == (bt = SLang_create_array (SLANG_STRING_TYPE, 0, NULL, at->dims, at->num_dims)))
+ {
+	SLang_free_array (at);
+	return -1;
+ }
+
+ adata = (char **)at->data; bdata = (char **)bt->data;
+ num = bt->num_elements;
+ for (i = 0; i < num; i++)
+ {
+	char *s = adatai;
+	if (s != NULL)
+	 {
+	 s = (*func)(s, cd);
+	 if (s == NULL)
+	 {
+		 SLang_free_array (bt);
+		 SLang_free_array (at);
+		 return -1;
+	 }
+	 }
+	bdatai = s;
+ }
+ SLang_free_array (at);
+ return SLang_push_array (bt, 1);
+}
+
+static int func_issubstr (char *a, char *b, void *cd)
+{
+ SLstrlen_Type n;
+ char *c;
+
+ (void) cd;
+
+ if (NULL == (c = strstr(a, b)))
+ return 0;
+
+ if (_pSLinterp_UTF8_Mode == 0)
+ return 1 + (int) (c - a);
+
+ n = (unsigned int) (c - a);
+ (void) SLutf8_skip_chars ((SLuchar_Type *)a, (SLuchar_Type *)c, n, &n, 0);
+ return (int) (n+1);
+}
+
+static int issubstr_vintrin (void) /*{{{*/
+{
+ return arraymap_int_func_str_str (func_issubstr, NULL);
+}
+
+
+typedef struct
+{
+ int do_beg, do_end;
+ SLwchar_Lut_Type *lut;
+ int invert;
+}
+Strtrim_CD_Type;
+
+static char *func_strtrim (char *str, void *cd)
+{
+ Strtrim_CD_Type *info;
+ SLuchar_Type *beg, *end;
+ unsigned int len;
+
+ info = (Strtrim_CD_Type *)cd;
+
+ beg = (SLuchar_Type *)str;
+ len = do_trim (&beg, info->do_beg, &end, info->do_end, info->lut, info->invert);
+
+ return SLang_create_nslstring ((char *) beg, len);
+}
+
+static int strtrim_internal (int do_beg, int do_end)
+{
+ Strtrim_CD_Type cd;
+ int status;
+ int free_lut;
+
+ cd.do_beg = do_beg;
+ cd.do_end = do_end;
+ cd.invert = 0;
+ free_lut = 0;
+ if (SLang_Num_Function_Args == 2)
+ {
+	cd.lut = pop_lut (&cd.invert);
+	free_lut = 1;
+ }
+ else cd.lut = make_whitespace_lut ();
+
+ if (cd.lut == NULL)
+ return -1;
+
+ status = arraymap_str_func_str (func_strtrim, &cd);
+ if (free_lut) SLwchar_free_lut (cd.lut);
+ return status;
+}
+
+static void strtrim_vintrin (void)
+{
+ (void) strtrim_internal (1, 1);
+}
+
+static void strtrim_beg_vintrin (void)
+{
+ (void) strtrim_internal (1, 0);
+}
+
+static void strtrim_end_vintrin (void)
+{
+ (void) strtrim_internal (0, 1);
+}
+
+static char *func_strup (char *str, void *cd)
+{
+ size_t i, len;
+ unsigned char *a;
+
+ (void) cd;
+ len = strlen (str);
+
+ if (_pSLinterp_UTF8_Mode)
+ return (char *)SLutf8_strup ((SLuchar_Type *)str, (SLuchar_Type *)str+len);
+
+ if (NULL == (a = (unsigned char *)SLmalloc (len+1)))
+ return NULL;
+
+ for (i = 0; i < len; i++)
+ {
+	unsigned char c = (unsigned char)stri;
+	ai = UPPER_CASE(c);
+ }
+ alen = 0;
+ str = SLang_create_nslstring ((char *)a, len);
+ SLfree ((char *)a);
+ return str;
+}
+
+static void strup_vintrin (void)
+{
+ (void) arraymap_str_func_str (&func_strup, NULL);
+}
+
+static char *func_strlow (char *str, void *cd)
+{
+ size_t i, len;
+ unsigned char *a;
+
+ (void) cd;
+ len = strlen (str);
+
+ if (_pSLinterp_UTF8_Mode)
+ return (char *)SLutf8_strlo ((SLuchar_Type *)str, (SLuchar_Type *)str+len);
+
+ if (NULL == (a = (unsigned char *)SLmalloc (len+1)))
+ return NULL;
+
+ for (i = 0; i < len; i++)
+ {
+	unsigned char c = (unsigned char)stri;
+	ai = LOWER_CASE(c);
+ }
+ alen = 0;
+ str = SLang_create_nslstring ((char *)a, len);
+ SLfree ((char *)a);
+ return str;
+}
+
+static void strlow_vintrin (void)
+{
+ (void) arraymap_str_func_str (&func_strlow, NULL);
+}
+
+static int func_strcmp (char *a, char *b, void *cd)
+{
+ (void) cd;
+
+ if (a == b)
+ return 0;
+
+ if ((a != NULL) && (b != NULL))
+ return strcmp(a, b);
+
+ if (a == NULL)
+ return -1;
+
+ return 1;
+}
+static void strcmp_vintrin (void)
+{
+ (void) arraymap_int_func_str_str (func_strcmp, NULL);
+}
+
+static int func_strnbytecmp (char *a, char *b, void *cd)
+{
+ if ((a != NULL) && (b != NULL))
+ return strncmp (a, b, *(unsigned int *)cd);
+ if (a == NULL)
+ return b == NULL ? 0 : -1;
+ return 1;
+}
+
+static void strnbytecmp_vintrin (void)
+{
+ unsigned int n;
+ if (0 == SLang_pop_uint (&n))
+ (void) arraymap_int_func_str_str (func_strnbytecmp, (void *)&n);
+}
+
+typedef struct
+{
+ unsigned int n;
+ int skip_combining;
+}
+Strncmp_CD_Type;
+
+static int func_strncmp (char *a, char *b, void *cd)
+{
+ int skip_combining;
+ unsigned int n;
+ char *p;
+ unsigned int na, nb;
+ unsigned int lena, lenb;
+ int cmp;
+
+ if (a == NULL)
+ return b == NULL ? 0 : -1;
+ if (b == NULL)
+ return 1;
+
+ skip_combining = ((Strncmp_CD_Type *)cd)->skip_combining;
+ n = ((Strncmp_CD_Type *)cd)->n;
+
+ lena = _pSLstring_bytelen (a);
+ lenb = _pSLstring_bytelen (b);
+
+ p = (char *)SLutf8_skip_chars ((SLuchar_Type *)a, (SLuchar_Type *)(a + lena),
+ (unsigned int) n, NULL, skip_combining);
+ na = (unsigned int) (p - a);
+
+ p = (char *)SLutf8_skip_chars ((SLuchar_Type *)b, (SLuchar_Type *)(b + lenb),
+ (unsigned int) n, NULL, skip_combining);
+ nb = (unsigned int) (p - b);
+
+ if (na > nb)
+ {
+ cmp = strncmp (a, b, nb);
+ if (cmp == 0)
+ return (int) (unsigned char) anb;
+ return cmp;
+ }
+
+ if (na == nb)
+ return strncmp (a, b, nb);
+
+ /* nb > na */
+ cmp = strncmp (a, b, na);
+ if (cmp == 0)
+ return -(int)(unsigned char) bna;
+
+ return cmp;
+}
+
+static void strncmp_vintrin (void)
+{
+ Strncmp_CD_Type cd;
+
+ if (_pSLinterp_UTF8_Mode == 0)
+ {
+	strnbytecmp_vintrin ();
+	return;
+ }
+ if (-1 == SLang_pop_uint (&cd.n))
+ return;
+ cd.skip_combining = 1;
+
+ (void) arraymap_int_func_str_str (func_strncmp, (void *)&cd);
+}
+
+static void strncharcmp_vintrin (void)
+{
+ Strncmp_CD_Type cd;
+
+ if (_pSLinterp_UTF8_Mode == 0)
+ {
+	strnbytecmp_vintrin ();
+	return;
+ }
+ if (-1 == SLang_pop_uint (&cd.n))
+ return;
+ cd.skip_combining = 0;
+
+ (void) arraymap_int_func_str_str (func_strncmp, (void *)&cd);
+}
+
+static int func_utf8_strlen (char *s, void *cd)
+{
+ if (s == NULL)
+ return 0;
+ return (int) SLutf8_strlen ((SLuchar_Type *)s, *(int *)cd);
+}
+
+static int func_bytelen (char *s, void *cd)
+{
+ (void) cd;
+ if (s == NULL)
+ return 0;
+ return (int) _pSLstring_bytelen (s);
+}
+
+static void strlen_vintrin (void)
+{
+ int ignore_combining = 1;
+
+ if (_pSLinterp_UTF8_Mode == 0)
+ {
+	(void) arraymap_int_func_str (&func_bytelen, NULL);
+	return;
+ }
+ (void) arraymap_int_func_str (&func_utf8_strlen, (void *)&ignore_combining);
+}
+
+static void strcharlen_vintrin (void)
+{
+ int ignore_combining = 0;
+
+ if (_pSLinterp_UTF8_Mode == 0)
+ {
+	(void) arraymap_int_func_str (&func_bytelen, NULL);
+	return;
+ }
+ (void) arraymap_int_func_str (&func_utf8_strlen, (void *)&ignore_combining);
+}
+
+static void strbytelen_vintrin (void)
+{
+ (void) arraymap_int_func_str (&func_bytelen, NULL);
+}
+
+/*}}}*/
+
+typedef struct
+{
+ SLwchar_Lut_Type *lut;
+ int invert;
+}
+Str_Delete_Chars_CD_Type;
+
+static char *func_str_delete_chars (char *str, void *cd)
+{
+ SLwchar_Lut_Type *lut;
+ SLuchar_Type *s1;
+ SLuchar_Type *t, *tmax;
+ int invert, ignore_combining = 0;
+ SLuchar_Type *s;
+
+ lut = ((Str_Delete_Chars_CD_Type *)cd)->lut;
+ invert = ((Str_Delete_Chars_CD_Type *)cd)->invert;
+
+ /* Assume that the number of characters to be deleted is smaller then
+ * the number not to be deleted. In this case, it is better to
+ * skip past call characters not in the set to be deleted. Hence,
+ * we want to invert the deletion set.
+ */
+ invert = !invert;
+
+ if ((str == NULL)
+ || (NULL == (s = (SLuchar_Type *)SLmake_string (str))))
+ return NULL;
+
+ s1 = s;
+ t = s;
+ tmax = t + strlen((char *)t);
+ while (t != tmax)
+ {
+	SLuchar_Type *t1;
+	size_t len;
+
+	t1 = SLwchar_skip_range (lut, t, tmax, ignore_combining, invert);
+	if (t1 == NULL)
+	 break;
+
+	len = t1 - t;
+	if (len)
+	 {
+	 if (t != s1)
+	 {
+		 /* strncpy ((char *)s1, (char *)t, len); */
+		 while (t < t1)
+		 *s1++ = *t++;
+	 }
+	 else s1 += len;
+	 }
+	t = SLwchar_skip_range (lut, t1, tmax, ignore_combining, !invert);
+	if (t == NULL)
+	 break;
+ }
+ *s1 = 0;
+ str = SLang_create_slstring ((char *)s);
+ SLfree ((char *)s);
+ return str;
+}
+
+static void str_delete_chars_vintrin (void)
+{
+ Str_Delete_Chars_CD_Type cd;
+ int free_lut;
+
+ cd.invert = 0;
+ free_lut = 0;
+
+ /* This function may also be called by strtrans_vintrin, with some of its
+ * args on the stack.
+ */
+ if (SLang_Num_Function_Args > 1)
+ {
+	cd.lut = pop_lut (&cd.invert);
+	free_lut = 1;
+ }
+ else
+ cd.lut = make_whitespace_lut ();
+
+ if (cd.lut == NULL)
+ return;
+
+ (void) arraymap_str_func_str (&func_str_delete_chars, (void *)&cd);
+
+ if (free_lut)
+ SLwchar_free_lut (cd.lut);
+}
+
+static char *func_strtrans (char *s, void *cd)
+{
+ SLuchar_Type *u;
+
+ if (s == NULL)
+ return NULL;
+
+ u = SLuchar_apply_char_map ((SLwchar_Map_Type *)cd, (SLuchar_Type *)s);
+ s = SLang_create_slstring ((char *) u);
+ SLfree ((char *)u);
+ return s;
+}
+
+static void strtrans_vintrin (char *to)
+{
+ SLwchar_Map_Type *map;
+ char *from;
+
+ if (*to == 0)
+ {
+	str_delete_chars_vintrin ();
+	return;
+ }
+
+ if (-1 == SLang_pop_slstring (&from))
+ return;
+
+ if (NULL == (map = SLwchar_allocate_char_map ((SLuchar_Type *)from, (SLuchar_Type *)to)))
+ return;
+
+ _pSLang_free_slstring (from);
+
+ (void) arraymap_str_func_str (&func_strtrans, (void *)map);
+ SLwchar_free_char_map (map);
+}
+
+typedef struct
+{
+ SLwchar_Lut_Type *lut;
+ SLuchar_Type pref_char_bufSLUTF8_MAX_MBLEN+1;
+ unsigned int pref_len;
+}
+Strcompress_CD_Type;
+
+static char *func_strcompress (char *str, void *cd) /*{{{*/
+{
+ char *c;
+ Strcompress_CD_Type *info;
+ SLuchar_Type *s, *beg, *end;
+ size_t len, pref_len;
+ SLwchar_Lut_Type *lut;
+ int ignore_combining = 0;
+
+ if (str == NULL)
+ return str;
+
+ info = (Strcompress_CD_Type *)cd;
+ pref_len = info->pref_len;
+ lut = info->lut;
+
+ beg = (SLuchar_Type *) str;
+ (void) do_trim (&beg, 1, &end, 1, lut, 0);
+
+ /* Determine the effective length */
+ len = 0;
+ s = (unsigned char *) beg;
+ while (1)
+ {
+	SLuchar_Type *s1;
+
+	s1 = SLwchar_skip_range (lut, s, end, ignore_combining, 1);
+	len += (s1 - s);
+	s = s1;
+
+	if (s == end)
+	 break;
+
+	len += pref_len;
+
+	s = SLwchar_skip_range (lut, s, end, ignore_combining, 0);
+ }
+
+ c = _pSLallocate_slstring (len);
+ if (c == NULL)
+ return NULL;
+
+ s = (unsigned char *) c;
+
+ while (1)
+ {
+	SLuchar_Type *beg1;
+	unsigned int dlen;
+
+	beg1 = SLwchar_skip_range (lut, beg, end, ignore_combining, 1);
+	dlen = (unsigned int) (beg1 - beg);
+
+	memcpy ((char *)s, beg, dlen);
+	beg = beg1;
+	s += dlen;
+
+	if (beg == end)
+	 break;
+
+	memcpy (s, info->pref_char_buf, pref_len);
+	s += pref_len;
+
+	beg = SLwchar_skip_range (lut, beg, end, ignore_combining, 0);
+ }
+ *s = 0;
+
+ return _pSLcreate_via_alloced_slstring (c, len);
+}
+
+static void strcompress_vintrin (char *white) /*{{{*/
+{
+ char *white_max;
+ SLuchar_Type *s;
+ SLwchar_Type pref_char;
+ Strcompress_CD_Type cd;
+
+ /* The first character of white is the preferred whitespace character */
+ white_max = white + strlen (white);
+ if (NULL == (s = _pSLinterp_decode_wchar ((SLuchar_Type *)white, (SLuchar_Type *)white_max,
+					 &pref_char)))
+ return;
+
+ /* This cannot overflow since _pSLinterp_decode_wchar will not return an
+ * offset of more than SLUTF8_MAX_BLEN bytes.
+ */
+ cd.pref_len = (unsigned int)(s - (SLuchar_Type*)white);
+ memcpy ((char *)cd.pref_char_buf, white, cd.pref_len);
+ cd.pref_char_bufcd.pref_len = 0;
+
+ /* No ranges and no character classes in white */
+ if (NULL == (cd.lut = SLwchar_strtolut ((SLuchar_Type *)white, 0, 0)))
+ return;
+
+ (void) arraymap_str_func_str (&func_strcompress, (void *)&cd);
+
+ SLwchar_free_lut (cd.lut);
+}
+
+/*}}}*/
+
+#if defined(__GNUC__)
+# pragma GCC diagnostic ignored "-Wformat-nonliteral"
+#endif
+static char *SLdo_sprintf (char *fmt) /*{{{*/
+{
+ register char *p = fmt;
+ char *out = NULL, *outp = NULL;
+ char dfmt1024;	 /* used to hold part of format */
+ char *f, *f1;
+ char *str;
+ unsigned int want_width, width, precis;
+ int int_var, use_string;
+ long long_var;
+#ifdef HAVE_LONG_LONG
+ long long llong_var;
+#endif
+ size_t len = 0, malloc_len = 0, dlen;
+ int do_free;
+ unsigned int guess_size;
+#if SLANG_HAS_FLOAT
+ int use_double;
+ double x;
+#endif
+ unsigned char uch;
+ int use_long = 0, use_alt_format = 0;
+ SLuchar_Type utf8_bufSLUTF8_MAX_MBLEN+1;
+
+ while (1)
+ {
+	char ch;
+
+	while ((ch = *p) != 0)
+	 {
+	 if (ch == '%')
+	 break;
+	 p++;
+	 }
+
+	/* p points at '%' or 0 */
+
+	dlen = (unsigned int) (p - fmt);
+
+	if (len + dlen >= malloc_len)
+	 {
+	 malloc_len = len + dlen + 512;
+	 if (out == NULL) outp = (char *)SLmalloc(malloc_len + 1);
+	 else outp = (char *)SLrealloc(out, malloc_len + 1);
+	 if (NULL == outp)
+	 return out;
+	 out = outp;
+	 outp = out + len;
+	 }
+
+	strncpy(outp, fmt, dlen);
+	len += dlen;
+	outp = out + len;
+	*outp = 0;
+	if (ch == 0) break;
+
+	/* bump it beyond '%' */
+	++p;
+	fmt = p;
+
+	f = dfmt;
+	*f++ = ch;
+	/* handle flag char */
+	ch = *p++;
+
+	/* Make sure cases such as "% #g" can be handled. */
+	if ((ch == '-') || (ch == '+') || (ch == ' ') || (ch == '#'))
+	 {
+	 if (ch == '#')
+	 use_alt_format = 1;
+	 *f++ = ch;
+	 ch = *p++;
+	 if ((ch == '-') || (ch == '+') || (ch == ' ') || (ch == '#'))
+	 {
+		 if (ch == '#')
+		 use_alt_format = 1;
+		 *f++ = ch;
+		 ch = *p++;
+	 }
+	 }
+
+	/* width */
+	/* I have got to parse it myself so that I can see how big it needs
+	 * to be.
+	 */
+	want_width = width = 0;
+	if (ch == '*')
+	 {
+	 if (SLang_pop_uinteger(&width)) return (out);
+	 want_width = 1;
+	 ch = *p++;
+	 }
+	else
+	 {
+	 if (ch == '0')
+	 {
+		 *f++ = '0';
+		 ch = *p++;
+	 }
+
+	 while ((ch <= '9') && (ch >= '0'))
+	 {
+		 width = width * 10 + (ch - '0');
+		 ch = *p++;
+		 want_width = 1;
+	 }
+	 }
+
+	if (want_width)
+	 {
+	 sprintf(f, "%u", width);
+	 f += strlen (f);
+	 }
+	precis = 0;
+	/* precision -- also indicates max number of chars from string */
+	if (ch == '.')
+	 {
+	 *f++ = ch;
+	 ch = *p++;
+	 want_width = 0;
+	 if (ch == '*')
+	 {
+		 if (SLang_pop_uinteger(&precis)) return (out);
+		 ch = *p++;
+		 want_width = 1;
+	 }
+	 else while ((ch <= '9') && (ch >= '0'))
+	 {
+		 precis = precis * 10 + (ch - '0');
+		 ch = *p++;
+		 want_width = 1;
+	 }
+	 if (want_width)
+	 {
+		 sprintf(f, "%u", precis);
+		 f += strlen (f);
+	 }
+	 else precis = 0;
+	 }
+
+	long_var = 0;
+	int_var = 0;
+#ifdef HAVE_LONG_LONG
+	llong_var = 0;
+#endif
+	str = NULL;
+	guess_size = 32;
+#if SLANG_HAS_FLOAT
+	use_double = 0;
+#endif
+	use_long = 0;
+	use_string = 0;
+	do_free = 0;
+
+	if (ch == 'l')
+	 {
+	 use_long = 1;
+	 ch = *p++;
+	 if (ch == 'l')
+	 {
+		 use_long = 2;	 /* long long */
+		 ch = *p++;
+	 }
+	 }
+	else if (ch == 'h') ch = *p++; /* not supported */
+
+	/* Now the actual format specifier */
+	switch (ch)
+	 {
+	 case 'B':
+	 if (-1 == _pSLformat_as_binary (precis, use_alt_format))
+	 return out;
+	 /* Remove the precision value from the format string */
+	 f1 = f-1;
+	 while (f1 > dfmt)
+	 {
+		 if (*f1 == '.')
+		 {
+		 *f1 = 0;
+		 f = f1;
+		 break;
+		 }
+		 f1--;
+	 }
+
+	 /* drop */
+	 case 'S':
+	 if (ch == 'S')
+	 _pSLstring_intrinsic ();
+	 ch = 's';
+	 /* drop */
+	 case 's':
+	 if (-1 == SLang_pop_slstring(&str))
+	 return (out);
+	 do_free = 1;
+	 guess_size = strlen(str);
+	 use_string = 1;
+	 break;
+
+	 case '%':
+	 guess_size = 1;
+	 do_free = 0;
+	 use_string = 1;
+	 str = (char *) "%";
+	 break;
+
+	 case 'c':
+#if 0
+	 if (use_long)
+#endif
+	 {
+		 SLwchar_Type wc;
+
+		 if (-1 == _pSLang_pop_wchar (&wc))
+		 return out;
+		 if ((_pSLinterp_UTF8_Mode == 0) && (wc <= 0xFF))
+		 {
+		 utf8_buf0 = (unsigned char)wc;
+		 utf8_buf1 = 0;
+		 }
+		 else if (NULL == SLutf8_encode_null_terminate (wc, utf8_buf))
+		 return out;
+		 ch = 's';
+		 str = (char *)utf8_buf;
+		 use_string = 1;
+	 }
+	 break;
+
+	 case 'b':
+	 use_long = 0;
+	 guess_size = 1;
+	 if (-1 == SLang_pop_uchar (&uch))
+	 return out;
+	 int_var = (int) uch;
+	 ch = 'c';
+	 break;
+
+	 case 'd':
+	 case 'i':
+	 case 'o':
+	 case 'u':
+	 case 'X':
+	 case 'x':
+#ifdef HAVE_LONG_LONG
+	 if (use_long > 1)
+	 {
+		 if (-1 == SLang_pop_long_long (&llong_var))
+		 return out;
+# ifdef __WIN32__
+		 *f++ = 'I'; *f++ = '6'; *f++ = '4';
+# else
+		 *f++ = 'l'; *f++ = 'l';
+# endif
+	 }
+	 else
+#endif				 /* HAVE_LONG_LONG */
+	 if (use_long)
+		 {
+		 if (-1 == SLang_pop_long (&long_var))
+		 return out;
+		 *f++ = 'l';
+		 }
+	 else if (-1 == SLang_pop_int (&int_var))
+	 return out;
+	 break;
+
+	 case 'f':
+	 case 'e':
+	 case 'g':
+	 case 'E':
+	 case 'G':
+#if SLANG_HAS_FLOAT
+	 if (SLang_pop_double(&x)) return (out);
+	 use_double = 1;
+	 guess_size = 256;
+	 if (fabs(x) > 1e38)
+	 {
+		 if (0 == _pSLmath_isinf (x))
+		 {
+		 double expon = log10 (fabs(x));
+		 if (expon > (double) 0xFFFF)
+			 ch = 'E';
+		 else
+			 guess_size += (unsigned int) expon;
+		 }
+		 else ch = 'E';
+	 }
+	 use_long = 0;
+	 break;
+#endif
+	 case 'p':
+	 guess_size = 32;
+	 /* Pointer type?? Why?? */
+	 if (-1 == SLdo_pop ())
+	 return out;
+	 str = (char *) _pSLang_get_run_stack_pointer ();
+	 use_string = 1;
+	 use_long = 0;
+	 break;
+
+	 default:
+	 _pSLang_verror (SL_INVALID_PARM, "Invalid printf format");
+	 return(out);
+	 }
+	*f++ = ch; *f = 0;
+
+	width = width + precis;
+	if (width > guess_size) guess_size = width;
+
+	if (len + guess_size > malloc_len)
+	 {
+	 guess_size += 512;
+	 outp = (char *) SLrealloc(out, len + guess_size + 1);
+	 if (outp == NULL)
+	 {
+		 SLang_set_error (SL_MALLOC_ERROR);
+		 return (out);
+	 }
+	 out = outp;
+	 outp = out + len;
+	 malloc_len = len + guess_size;
+	 }
+
+	if (use_string)
+	 {
+	 sprintf(outp, dfmt, str);
+	 if (do_free) _pSLang_free_slstring (str);
+	 }
+#if SLANG_HAS_FLOAT
+	else if (use_double) sprintf(outp, dfmt, x);
+#endif
+	else if (use_long)
+	 {
+#ifdef HAVE_LONG_LONG
+	 if (use_long > 1)
+	 sprintf (outp, dfmt, llong_var);
+	 else
+#endif
+	 sprintf (outp, dfmt, long_var);
+	 }
+	else sprintf(outp, dfmt, int_var);
+
+	len += strlen(outp);
+	outp = out + len;
+	fmt = p;
+ }
+
+ if (out != NULL)
+ {
+	outp = (char *)SLrealloc (out, (unsigned int) (outp - out) + 1);
+	if (outp != NULL) out = outp;
+ }
+
+ return (out);
+}
+#if defined(__GNUC__)
+# pragma GCC diagnostic warning "-Wformat-nonliteral"
+#endif
+
+/*}}}*/
+
+int _pSLstrops_do_sprintf_n (int n) /*{{{*/
+{
+ char *p;
+ char *fmt;
+ SLang_Object_Type *ptr;
+ int ofs;
+
+ if (-1 == (ofs = SLreverse_stack (n + 1)))
+ return -1;
+
+ ptr = _pSLang_get_run_stack_base () + ofs;
+
+ if (SLang_pop_slstring(&fmt))
+ return -1;
+
+ p = SLdo_sprintf (fmt);
+ _pSLang_free_slstring (fmt);
+
+ SLdo_pop_n (_pSLang_get_run_stack_pointer () - ptr);
+
+ if (_pSLang_Error)
+ {
+	SLfree (p);
+	return -1;
+ }
+
+ return SLang_push_malloced_string (p);
+}
+
+/*}}}*/
+
+static void sprintf_n_cmd (int *n)
+{
+ _pSLstrops_do_sprintf_n (*n);
+}
+
+static void sprintf_cmd (void)
+{
+ _pSLstrops_do_sprintf_n (SLang_Num_Function_Args - 1); /* do not include format */
+}
+
+/* converts string s to a form that can be used in an eval */
+/* UTF-8 ok */
+static void make_printable_string(unsigned char *s) /*{{{*/
+{
+ unsigned int len;
+ unsigned char *s1 = s, ch, *ss1;
+ unsigned char *ss;
+
+ /* compute length */
+ len = 3;
+ while ((ch = *s1++) != 0)
+ {
+	if ((ch == '\n') || (ch == '\\') || (ch == '"'))
+	 {
+	 len += 2;
+	 continue;
+	 }
+	ch &= 0x7F;
+	if ((ch == 127) || (ch < 32))
+	 {
+	 len += 4;
+	 continue;
+	 }
+	len++;
+ }
+
+ if (NULL == (ss = (unsigned char *) SLmalloc(len)))
+ return;
+
+ s1 = s;
+ ss1 = ss;
+ *ss1++ = '"';
+ while ((ch = *s1++) != 0)
+ {
+	if (ch == '\n')
+	 {
+	 *ss1++ = '\\';
+	 *ss1++ = 'n';
+	 continue;
+	 }
+	if ((ch == '\\') || (ch == '"'))
+	 {
+	 *ss1++ = '\\';
+	 *ss1++ = ch;
+	 continue;
+	 }
+
+	if ((ch == 127) || ((ch & 0x7F) < 32))
+	 {
+	 sprintf ((char *)ss1, "\\x%02X", ch);
+	 ss1 += 4;
+	 continue;
+	 }
+	*ss1++ = ch;
+ }
+ *ss1++ = '"';
+ *ss1 = 0;
+ (void) SLang_push_malloced_string ((char *)ss);
+}
+
+/*}}}*/
+
+static void extract_element_cmd (char *list, int *nth_ptr, SLwchar_Type *delim_ptr)
+{
+ SLwchar_Type delim = *delim_ptr;
+ SLuchar_Type delim_utf8SLUTF8_MAX_MBLEN+1;
+ unsigned int delim_len;
+ char *list1;
+ int n;
+
+ n = *nth_ptr;
+ if (n < 0)
+ {
+	SLang_push_null ();
+	return;
+ }
+
+ if (NULL == _pSLinterp_encode_wchar (delim, delim_utf8, &delim_len))
+ return;
+
+ while (n > 0)
+ {
+	list = strstr (list, (char *)delim_utf8);
+	if (list == NULL)
+	 {
+	 (void) SLang_push_null();
+	 return;
+	 }
+	list += delim_len;
+	n--;
+ }
+
+ list1 = strstr (list, (char *)delim_utf8);
+ if (list1 == NULL)
+ {
+	SLang_push_string (list);
+	return;
+ }
+
+ (void) _pSLang_push_nstring (list, (unsigned int)(list1 - list));
+}
+
+static int is_list_element_cmd (char *list, char *elem, SLwchar_Type *delim_ptr)
+{
+ SLuchar_Type delim_utf8SLUTF8_MAX_MBLEN+1;
+ unsigned int delim_len;
+ size_t elem_len;
+ int n;
+
+ if (NULL == _pSLinterp_encode_wchar (*delim_ptr, delim_utf8, &delim_len))
+ return 0;
+
+ if (delim_len == 0)
+ return (list == elem);
+
+ n = 0;
+ elem_len = strlen (elem);
+
+ while (1)
+ {
+	size_t len;
+	char *list_end = strstr (list, (char *)delim_utf8);
+
+	if (list_end == NULL)
+	 {
+	 if (0 == strcmp (list, elem))
+	 return n + 1;
+	 return 0;
+	 }
+	len = list_end - list;
+	if ((len == elem_len)
+	 && (0 == strncmp (list, elem, len)))
+	 return n + 1;
+
+	list += len + delim_len;
+	n++;
+ }
+}
+
+/*}}}*/
+
+/* Regular expression routines for strings */
+static SLRegexp_Type *Regexp;
+static unsigned int Regexp_Match_Byte_Offset;
+
+static int string_match_internal (char *str, char *pat, int n) /*{{{*/
+{
+ char *match;
+ size_t len;
+ size_t byte_offset;
+
+ if (Regexp != NULL)
+ {
+	SLregexp_free (Regexp);
+	Regexp = NULL;
+ }
+
+ byte_offset = (unsigned int) (n - 1);
+ len = strlen(str);
+
+ if (byte_offset > len)
+ return 0;
+
+ if (NULL == (Regexp = SLregexp_compile (pat, 0)))
+ return -1;
+ Regexp_Match_Byte_Offset = byte_offset;
+
+ if (NULL == (match = SLregexp_match (Regexp, str+byte_offset, len-byte_offset)))
+ return 0;
+
+ return 1 + (int) (match - str);
+}
+
+/*}}}*/
+
+
+static int pop_string_match_args (int nargs, char **strp, char **patp, int *np)
+{
+ *strp = *patp = NULL;
+
+ if (nargs == 2)
+ *np = 1;
+ else if (-1 == SLang_pop_int (np))
+ return -1;
+
+ if (-1 == SLang_pop_slstring (patp))
+ return -1;
+
+ if (0 == SLang_pop_slstring (strp))
+ return 0;
+
+ SLang_free_slstring (*patp);
+ *patp = NULL;
+ return -1;
+}
+
+static int string_match_cmd (void)
+{
+ char *str, *pat;
+ int n, status;
+
+ if (-1 == pop_string_match_args (SLang_Num_Function_Args, &str, &pat, &n))
+ return -1;
+
+ status = string_match_internal (str, pat, n);
+ SLang_free_slstring (str);
+ SLang_free_slstring (pat);
+ return status;
+}
+
+static int string_match_nth_cmd (int *nptr) /*{{{*/
+{
+ SLuindex_Type ofs, len;
+
+ if (Regexp == NULL)
+ {
+	_pSLang_verror (SL_RunTime_Error, "A successful call to string_match was not made");
+	return -1;
+ }
+
+ if (-1 == SLregexp_nth_match (Regexp, (unsigned int) *nptr, &ofs, &len))
+ {
+	_pSLang_verror (0, "SLregexp_nth_match failed");
+	return -1;
+ }
+
+ ofs += Regexp_Match_Byte_Offset;
+
+ /* zero based return value */
+ SLang_push_integer((int) ofs);
+ return (int) len;
+}
+
+/*}}}*/
+
+static int string_matches_internal (char *str, char *pat, int n)
+{
+ int status;
+ SLuindex_Type i;
+ SLstrlen_Type lens10;
+ SLstrlen_Type offsets10;
+ char **strs;
+ SLindex_Type num;
+ SLang_Array_Type *at;
+
+ status = string_match_internal (str, pat, n);
+ if (status <= 0)
+ {
+	SLang_push_null ();
+	return -1;
+ }
+
+ for (i = 0; i < 10; i++)
+ {
+	if (-1 == SLregexp_nth_match (Regexp, i, offsets+i, lens+i))
+	 break;
+	offsetsi += Regexp_Match_Byte_Offset;
+ }
+
+ num = (SLindex_Type)i;
+
+ if (NULL == (at = SLang_create_array (SLANG_STRING_TYPE, 0, NULL, &num, 1)))
+ return -1;
+
+ strs = (char **) at->data;
+ for (i = 0; i < (unsigned int) num; i++)
+ {
+	if (NULL == (strsi = SLang_create_nslstring (str+offsetsi, lensi)))
+	 {
+	 SLang_free_array (at);
+	 return -1;
+	 }
+ }
+
+ return SLang_push_array (at, 1);
+}
+
+static void string_matches_cmd (void)
+{
+ char *str, *pat;
+ int n;
+
+ if (-1 == pop_string_match_args (SLang_Num_Function_Args, &str, &pat, &n))
+ return;
+
+ (void) string_matches_internal (str, pat, n);
+ SLang_free_slstring (str);
+ SLang_free_slstring (pat);
+}
+
+/* UTF-8 ok */
+static char *create_delimited_string (char **list, size_t n,
+				 char *delim)
+{
+ size_t len, dlen;
+ size_t i;
+ size_t num;
+ char *str, *s;
+
+ len = 1;			 /* allow room for \0 char */
+ num = 0;
+ for (i = 0; i < n; i++)
+ {
+	if (listi == NULL) continue;
+	len += strlen (listi);
+	num++;
+ }
+
+ dlen = strlen (delim);
+ if (num > 1)
+ len += (num - 1) * dlen;
+
+ if (NULL == (str = (char *)SLmalloc (len)))
+ return NULL;
+
+ *str = 0;
+ s = str;
+ i = 0;
+
+ while (num > 1)
+ {
+	size_t len2;
+
+	while (listi == NULL)
+	 i++;
+
+	len2 = strlen (listi);
+	memcpy (s, listi, len2);
+	s += len2;
+	strcpy (s, delim);	 /* \0 terminates s */
+	s += dlen;
+	i++;
+	num--;
+ }
+
+ if (num)
+ {
+	while (listi == NULL)
+	 i++;
+
+	strcpy (s, listi);
+ }
+
+ return str;
+}
+
+/* UTF-8 ok */
+static void create_delimited_string_cmd (int *nptr)
+{
+ unsigned int n, i;
+ char **strings;
+ char *str;
+
+ str = NULL;
+
+ n = 1 + (unsigned int) *nptr; /* n includes delimiter */
+
+ if (NULL == (strings = (char **)_SLcalloc (n, sizeof (char *))))
+ {
+	SLdo_pop_n (n);
+	return;
+ }
+ memset((char *)strings, 0, n * sizeof (char *));
+
+ i = n;
+ while (i != 0)
+ {
+	i--;
+	if (-1 == SLang_pop_slstring (strings + i))
+	 goto return_error;
+ }
+
+ str = create_delimited_string (strings + 1, (n - 1), strings0);
+ /* drop */
+ return_error:
+ for (i = 0; i < n; i++) _pSLang_free_slstring (stringsi);
+ SLfree ((char *)strings);
+
+ (void) SLang_push_malloced_string (str); /* NULL Ok */
+}
+
+/* UTF-8 ok */
+static void strjoin_cmd (void)
+{
+ SLang_Array_Type *at;
+ char *str;
+ char *delim;
+ int free_delim;
+
+ if (SLang_Num_Function_Args == 1)
+ {
+	free_delim = 0;
+	delim = (char *)"";
+ }
+ else
+ {
+	if (-1 == SLang_pop_slstring (&delim))
+	 return;
+	free_delim = 1;
+ }
+
+ if (-1 == SLang_pop_array_of_type (&at, SLANG_STRING_TYPE))
+ return;
+
+ str = create_delimited_string ((char **)at->data, at->num_elements, delim);
+ SLang_free_array (at);
+ if (free_delim)
+ SLang_free_slstring (delim);
+
+ (void) SLang_push_malloced_string (str); /* NULL Ok */
+}
+
+static unsigned int count_char_occurrences (char *str, SLwchar_Type *wchp)
+{
+ SLwchar_Type wch = *wchp;
+ SLuchar_Type wch_utf8SLUTF8_MAX_MBLEN+1;
+ unsigned int wch_utf8_len;
+ unsigned int n = 0;
+ int is_byte;
+
+ if (wch < 0x80)
+ is_byte = 1;
+ else
+ {
+	if (_pSLinterp_UTF8_Mode == 0)
+	 {
+	 if (wch >= 256)
+	 {
+		 _pSLang_verror (SL_InvalidParm_Error, "Character is invalid in non-UTF-8 mode");
+		 return 0;
+	 }
+	 is_byte = 1;
+	 }
+	else
+	 is_byte = 0;
+ }
+
+ if (is_byte)
+ {
+	unsigned char byte = (unsigned char) wch;
+	while (*str != 0)
+	 {
+	 if (*str == byte) n++;
+	 str++;
+	 }
+	return n;
+ }
+
+ if (NULL == _pSLinterp_encode_wchar (wch, wch_utf8, &wch_utf8_len))
+ return 0;
+
+ while (NULL != (str = strstr (str, (char *)wch_utf8)))
+ {
+	n++;
+	str += wch_utf8_len;
+ }
+
+ return n;
+}
+
+static void glob_to_regexp (char *glob)
+{
+ unsigned int len;
+ char *pat, *p;
+ char ch;
+
+ len = _pSLstring_bytelen (glob);
+ pat = (char *)SLmalloc (2*len + 8);
+ if (pat == NULL)
+ return;
+
+ p = pat;
+ *p++ = '^';
+
+ /* If the first character of a file is '.', it must be explicitly matched. */
+ /*
+ * This will not work until | is supported in REs. Then if the glob
+ * pattern is *X, the RE will be ^(^..*X | ^X)$
+ *
+ if ((*glob == '?') || (*glob == '*'))
+ {
+	*p++ = '';
+	*p++ = '^';
+	*p++ = '.';
+	*p++ = '';
+	if (*glob == '?')
+	 glob++;
+ }
+ */
+ while (0 != (ch = *glob++))
+ {
+	if ((ch == '.') || (ch == '$') || (ch == '+') || (ch == '\\'))
+	 {
+	 *p++ = '\\';
+	 *p++ = ch;
+	 continue;
+	 }
+	if (ch == '*')
+	 {
+	 *p++ = '.';
+	 *p++ = '*';
+	 continue;
+	 }
+	if (ch == '?')
+	 {
+	 *p++ = '.';
+	 continue;
+	 }
+	if (ch != '')
+	 {
+	 *p++ = ch;
+	 continue;
+	 }
+
+	/* Otherwise ch = '' */
+	if (*glob != 0)
+	 {
+	 char *g = glob;
+	 int is_complement = 0;
+
+	 ch = *g;
+	 if ((ch == '^') || (ch == '!'))
+	 {
+		 is_complement = 1;
+		 g++;
+		 ch = *g;
+	 }
+	 if (ch == '')
+	 g++;
+
+	 while (((ch = *g) != 0) && (ch != ''))
+	 g++;
+
+	 if (ch == '')
+	 {
+		 *p++ = '';
+		 if (is_complement)
+		 {
+		 *p++ = '^';
+		 glob++;
+		 }
+		 while (glob <= g)
+		 *p++ = *glob++;
+
+		 continue;
+	 }
+	 }
+
+	/* failed to find the matching ''. So quote it */
+	*p++ = '\\';
+	*p++ = '';
+ }
+ *p++ = '$';
+ *p = 0;
+
+ (void) SLang_push_malloced_string (pat); /* frees it too */
+}
+
+static void define_case_intrin (int *a, int *b)
+{
+ SLang_define_case (a, b);
+}
+
+static char *convert_offset_to_ptr (char *str, unsigned int len, int ofs)
+{
+ if (ofs < 0)
+ {
+	if ((unsigned int) -ofs > len)
+	 {
+	 SLang_verror (SL_InvalidParm_Error, "offset parameter is too large for input string");
+	 return NULL;
+	 }
+	return (str + len) + ofs;
+ }
+
+ if ((unsigned int) ofs > len)
+ {
+	SLang_verror (SL_InvalidParm_Error, "offset parameter is too large for input string");
+	return NULL;
+ }
+ return str + ofs;
+}
+
+static void skip_bytes_intrin (void)
+{
+ int nmax = -1, n0 = 0;
+ int has_nmax = 0, utf8_mode;
+ unsigned int len;
+ char *str, *chars;
+ SLuchar_Type *strmin, *strmax;
+ int invert;
+ int nargs = SLang_Num_Function_Args;
+ SLwchar_Lut_Type *lut;
+ int ignore_combining = 0;
+
+ switch (nargs)
+ {
+ case 4:
+	if (-1 == SLang_pop_int (&nmax))
+	 return;
+	has_nmax = 1;
+	/* drop */
+ case 3:
+	if (-1 == SLang_pop_int (&n0))
+	 return;
+	/* drop */
+ default:
+	if (-1 == SLang_pop_slstring (&chars))
+	 return;
+	if (-1 == SLang_pop_slstring (&str))
+	 {
+	 SLang_free_slstring (chars);
+	 return;
+	 }
+ }
+ len = _pSLstring_bytelen (str);
+ if (has_nmax)
+ {
+	strmax = (SLuchar_Type *)convert_offset_to_ptr (str, len, nmax);
+	if (strmax == NULL)
+	 goto free_and_return;
+ }
+ else strmax = (SLuchar_Type *)str + len;
+
+ strmin = (SLuchar_Type *)convert_offset_to_ptr (str, len, n0);
+ if (strmin == NULL)
+ goto free_and_return;
+
+ /* FIXME!! There should be a way of specifying this when making the lut */
+ utf8_mode = _pSLinterp_UTF8_Mode; _pSLinterp_UTF8_Mode = 0;
+ invert = (chars0 == '^');
+ if (invert)
+ lut = SLwchar_strtolut ((SLuchar_Type*)chars+1, 1, 1);
+ else
+ lut = SLwchar_strtolut ((SLuchar_Type*)chars, 1, 1);
+ _pSLinterp_UTF8_Mode = utf8_mode;
+ if (lut == NULL)
+ goto free_and_return;
+
+ strmax = SLwchar_skip_range (lut, strmin, strmax, ignore_combining, invert);
+ SLwchar_free_lut (lut);
+ if (strmax == NULL)
+ goto free_and_return;
+
+ (void) SLang_push_integer ((int)((char *)strmax - str));
+ /* drop */
+
+free_and_return:
+ SLang_free_slstring (str);
+ SLang_free_slstring (chars);
+}
+
+static int copy_strlen_type_to_index_type (SLstrlen_Type a, SLindex_Type *bp)
+{
+ *bp = (SLindex_Type) a;
+ if ((SLstrlen_Type)*bp != a)
+ {
+	SLang_verror (SL_TypeMismatch_Error, "%s", "SLstrlen_Type value to large for conversion to SLindex_Type");
+	return -1;
+ }
+ return 0;
+}
+
+static void string_to_wchars (unsigned char *str)
+{
+ SLstrlen_Type i, len;
+ SLang_Array_Type *at;
+ _pSLint32_Type *data;
+ unsigned char *strmax;
+ SLindex_Type dims1;
+
+ len = SLutf8_strlen (str, 0);
+ if (-1 == copy_strlen_type_to_index_type (len, dims))
+ return;
+
+ if (NULL == (at = SLang_create_array (_pSLANG_INT32_TYPE, 0, NULL, dims, 1)))
+ return;
+
+ i = 0;
+ strmax = str + _pSLstring_bytelen ((const char *)str);
+ data = (_pSLint32_Type *)at->data;
+ while (str < strmax)
+ {
+	unsigned char *s;
+	SLwchar_Type wch;
+
+	if (*str < 0x80)
+	 {
+	 datai++ = *str++;
+	 continue;
+	 }
+
+	s = SLutf8_decode (str, strmax, &wch, NULL);
+	if (s == NULL)
+	 {
+	 datai++ = -(int)(*str);
+	 str++;
+	 continue;
+	 }
+	datai++ = (_pSLint32_Type)wch;
+	str = s;
+ }
+
+ (void) SLang_push_array (at, 1);
+}
+
+static void wchars_to_string (void)
+{
+ SLindex_Type i, n;
+ SLang_Array_Type *at;
+ _pSLint32_Type *data;
+ unsigned char *buf, *b, *bmax;
+ SLstrlen_Type buflen;
+
+ if (-1 == SLang_pop_array_of_type (&at, _pSLANG_INT32_TYPE))
+ return;
+
+ buflen = n = at->num_elements;
+ buf = (unsigned char *)SLmalloc(buflen+1);
+ if (buf == NULL)
+ {
+	SLang_free_array (at);
+	return;
+ }
+
+ data = (_pSLint32_Type *) at->data;
+ b = buf;
+ bmax = b + buflen;
+
+ i = 0;
+ for (i = 0; i < n; i++)
+ {
+	SLstrlen_Type dlen;
+	_pSLint32_Type wch;
+
+	wch = datai;
+	if ((wch < 0x80) && (b < bmax))
+	 {
+	 if (wch < 0) wch = -wch;
+	 *b++ = (unsigned char)(wch);
+	 continue;
+	 }
+
+	dlen = SLUTF8_MAX_MBLEN;
+	if (b + dlen >= bmax)
+	 {
+	 unsigned char *newbuf;
+
+	 dlen = 6;
+	 if (NULL == (newbuf = (unsigned char *)SLrealloc ((char *)buf, buflen+dlen+1)))
+	 {
+		 SLfree ((char *)buf);
+		 SLang_free_array (at);
+		 return;
+	 }
+	 b = newbuf + (b-buf);
+	 buf = newbuf;
+	 buflen += dlen;
+	 bmax = b + buflen;
+	 }
+	b = SLutf8_encode (wch, b, SLUTF8_MAX_MBLEN);
+ }
+
+ if (buf + buflen != b)
+ {
+	unsigned char *newbuf;
+	buflen = b - buf;
+	newbuf = (unsigned char *)SLrealloc((char *)buf, buflen+1);
+	if (newbuf == NULL)
+	 {
+	 SLfree ((char *)buf);
+	 SLang_free_array (at);
+	 return;
+	 }
+	b = newbuf + (b - buf);
+	buf = newbuf;
+ }
+ *b = 0;
+
+ (void) SLang_push_malloced_string ((char *)buf); /* frees it, even upon error */
+ SLang_free_array (at);
+}
+
+static SLang_Intrin_Fun_Type Strops_Table = /*{{{*/
+{
+ MAKE_INTRINSIC_I("create_delimited_string", create_delimited_string_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("strcmp", strcmp_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("strncmp", strncmp_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("strncharcmp", strncharcmp_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("strnbytecmp", strnbytecmp_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("strcat", strcat_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("strlen", strlen_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("strcharlen", strcharlen_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("strbytelen", strbytelen_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_3("strchop", strchop_cmd, SLANG_VOID_TYPE, SLANG_STRING_TYPE, SLANG_WCHAR_TYPE, SLANG_WCHAR_TYPE),
+ MAKE_INTRINSIC_3("strchopr", strchopr_cmd, SLANG_VOID_TYPE, SLANG_STRING_TYPE, SLANG_WCHAR_TYPE, SLANG_WCHAR_TYPE),
+ MAKE_INTRINSIC_0("strreplace", strreplace_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_SSS("str_replace", str_replace_cmd, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_SII("substr", substr_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_SII("substrbytes", subbytes_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("is_substr", issubstr_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_2("strsub", strsub_cmd, SLANG_VOID_TYPE, SLANG_INT_TYPE, SLANG_WCHAR_TYPE),
+ MAKE_INTRINSIC_2("strbytesub", strbytesub_cmd, SLANG_VOID_TYPE, SLANG_INT_TYPE, SLANG_UCHAR_TYPE),
+ MAKE_INTRINSIC_3("extract_element", extract_element_cmd, SLANG_VOID_TYPE, SLANG_STRING_TYPE, SLANG_INT_TYPE, SLANG_WCHAR_TYPE),
+ MAKE_INTRINSIC_3("is_list_element", is_list_element_cmd, SLANG_INT_TYPE, SLANG_STRING_TYPE, SLANG_STRING_TYPE, SLANG_WCHAR_TYPE),
+ MAKE_INTRINSIC_0("string_match", string_match_cmd, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_0("string_matches", string_matches_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_I("string_match_nth", string_match_nth_cmd, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_0("strlow", strlow_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_1("tolower", tolower_cmd, SLANG_INT_TYPE, SLANG_WCHAR_TYPE),
+ MAKE_INTRINSIC_1("toupper", toupper_cmd, SLANG_INT_TYPE, SLANG_WCHAR_TYPE),
+ MAKE_INTRINSIC_0("strup", strup_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("strtrim", strtrim_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("strtrim_end", strtrim_end_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("strtrim_beg", strtrim_beg_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("strcompress", strcompress_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_I("Sprintf", sprintf_n_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("sprintf", sprintf_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("sscanf", _pSLang_sscanf, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_S("make_printable_string", make_printable_string, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_3("str_quote_string", str_quote_string_cmd, SLANG_VOID_TYPE, SLANG_STRING_TYPE, SLANG_STRING_TYPE, SLANG_WCHAR_TYPE),
+ MAKE_INTRINSIC_SSS("str_uncomment_string", str_uncomment_string_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_II("define_case", define_case_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("strtok", strtok_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("strjoin", strjoin_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("strtrans", strtrans_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("str_delete_chars", str_delete_chars_vintrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("glob_to_regexp", glob_to_regexp, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_2("count_char_occurrences", count_char_occurrences, SLANG_UINT_TYPE, SLANG_STRING_TYPE, SLANG_WCHAR_TYPE),
+ MAKE_INTRINSIC_2("count_char_occurances", count_char_occurrences, SLANG_UINT_TYPE, SLANG_STRING_TYPE, SLANG_WCHAR_TYPE),
+ MAKE_INTRINSIC_0("strskipbytes", skip_bytes_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("islower", islower_intrin, SLANG_CHAR_TYPE),
+ MAKE_INTRINSIC_0("isupper", isupper_intrin, SLANG_CHAR_TYPE),
+ MAKE_INTRINSIC_0("isalpha", isalpha_intrin, SLANG_CHAR_TYPE),
+ MAKE_INTRINSIC_0("isxdigit", isxdigit_intrin, SLANG_CHAR_TYPE),
+ MAKE_INTRINSIC_0("isspace", isspace_intrin, SLANG_CHAR_TYPE),
+ MAKE_INTRINSIC_0("isblank", isblank_intrin, SLANG_CHAR_TYPE),
+ MAKE_INTRINSIC_0("iscntrl", iscntrl_intrin, SLANG_CHAR_TYPE),
+ MAKE_INTRINSIC_0("isprint", isprint_intrin, SLANG_CHAR_TYPE),
+ MAKE_INTRINSIC_0("isdigit", isdigit_intrin, SLANG_CHAR_TYPE),
+ MAKE_INTRINSIC_0("isgraph", isgraph_intrin, SLANG_CHAR_TYPE),
+ MAKE_INTRINSIC_0("isalnum", isalnum_intrin, SLANG_CHAR_TYPE),
+ MAKE_INTRINSIC_0("ispunct", ispunct_intrin, SLANG_CHAR_TYPE),
+ MAKE_INTRINSIC_0("isascii", isascii_intrin, SLANG_CHAR_TYPE),
+ MAKE_INTRINSIC_0("strskipchar", strskipchar_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("strbskipchar", strbskipchar_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_S("string_to_wchars", string_to_wchars, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("wchars_to_string", wchars_to_string, SLANG_VOID_TYPE),
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+/*}}}*/
+
+int _pSLang_init_slstrops (void)
+{
+ return SLadd_intrin_fun_table (Strops_Table, NULL);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slstruct.c Added

@@ -0,0 +1,2602 @@
+/* Structure type implementation */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+/* #define SL_APP_WANTS_FOREACH */
+#include "slang.h"
+#include "_slang.h"
+
+static void free_fields (_pSLstruct_Field_Type *fields, unsigned int n)
+{
+ _pSLstruct_Field_Type *field, *field_max;
+
+ if (fields == NULL)
+ return;
+
+ field = fields;
+ field_max = field + n;
+
+ while (field < field_max)
+ {
+	SLang_free_object (&field->obj);
+	SLang_free_slstring ((char *) field->name); /* could be NULL */
+	field++;
+ }
+ SLfree ((char *) fields);
+}
+
+static void free_struct (_pSLang_Struct_Type *s)
+{
+ if (s == NULL) return;
+
+ if (s->num_refs > 1)
+ {
+	s->num_refs -= 1;
+	return;
+ }
+
+ if (s->destroy_method != NULL)
+ {
+	int err, status;
+
+	if ((0 != (err = _pSLang_Error))
+	 && (-1 == _pSLang_push_error_context ()))
+	 {
+	 SLang_free_function (s->destroy_method);
+	 free_fields (s->fields, s->nfields);
+	 SLfree ((char *) s);
+	 return;
+	 }
+
+	status = 0;
+	if ((-1 == SLang_start_arg_list ())
+	 || (-1 == SLang_push_struct (s))
+	 || (-1 == SLang_end_arg_list ())
+	 || (-1 == SLexecute_function (s->destroy_method)))
+	 status = -1;
+
+	if (err)
+	 _pSLang_pop_error_context (status != 0);
+
+	if (s->num_refs > 1)
+	 {
+	 s->num_refs -= 1;
+	 return;
+	 }
+
+	SLang_free_function (s->destroy_method);
+ }
+ free_fields (s->fields, s->nfields);
+ SLfree ((char *) s);
+}
+
+void SLang_free_struct (_pSLang_Struct_Type *s)
+{
+ free_struct (s);
+}
+
+static _pSLang_Struct_Type *allocate_struct (unsigned int nfields)
+{
+ _pSLang_Struct_Type *s;
+ _pSLstruct_Field_Type *f;
+ unsigned int i, size;
+
+ s = (_pSLang_Struct_Type *) SLmalloc (sizeof (_pSLang_Struct_Type));
+ if (s == NULL) return NULL;
+
+ SLMEMSET((char *) s, 0, sizeof (_pSLang_Struct_Type));
+
+ size = nfields * sizeof(_pSLstruct_Field_Type);
+ if (NULL == (f = (_pSLstruct_Field_Type *) _SLcalloc (nfields, size)))
+ {
+	SLfree ((char *) s);
+	return NULL;
+ }
+ SLMEMSET ((char *) f, 0, size);
+ s->nfields = nfields;
+ s->fields = f;
+
+ /* By default, all structs will be created with elements set to NULL. I
+ * do not know whether or not it is better to use SLANG_UNDEFINED_TYPE.
+ */
+ for (i = 0; i < nfields; i++)
+ fi.obj.o_data_type = SLANG_NULL_TYPE;
+
+ return s;
+}
+
+static int push_struct_of_type (SLtype type, _pSLang_Struct_Type *s)
+{
+ SLang_Object_Type obj;
+
+ obj.o_data_type = type;
+ obj.v.struct_val = s;
+ s->num_refs += 1;
+
+ if (0 == SLang_push (&obj))
+ return 0;
+
+ s->num_refs -= 1;
+ return -1;
+}
+
+int SLang_push_struct (_pSLang_Struct_Type *s)
+{
+ if (s == NULL)
+ return SLang_push_null ();
+
+ return push_struct_of_type (SLANG_STRUCT_TYPE, s);
+}
+
+int SLang_pop_struct (_pSLang_Struct_Type **sp)
+{
+ SLang_Object_Type obj;
+ SLtype type;
+
+ if (0 != SLang_pop (&obj))
+ return -1;
+
+ type = obj.o_data_type;
+ if (type != SLANG_STRUCT_TYPE)
+ {
+	SLang_Class_Type *cl;
+	cl = _pSLclass_get_class (type);
+	if (cl->is_struct == 0)
+	 {
+	 *sp = NULL;
+	 SLang_free_object (&obj);
+	 _pSLang_verror (SL_TYPE_MISMATCH,
+			 "Expecting struct type object. Found %s",
+			 cl->cl_name);
+	 return -1;
+	 }
+ }
+
+ *sp = obj.v.struct_val;
+ return 0;
+}
+
+static void struct_destroy (SLtype type, VOID_STAR vs)
+{
+ (void) type;
+ SLang_free_struct (*(_pSLang_Struct_Type **) vs);
+}
+
+static int struct_push (SLtype type, VOID_STAR ptr)
+{
+ return push_struct_of_type (type, *(_pSLang_Struct_Type **) ptr);
+}
+
+static _pSLstruct_Field_Type *find_field_in_fields (_pSLstruct_Field_Type *fields, unsigned int n, SLCONST char *name)
+{
+ _pSLstruct_Field_Type *f, *fmax;
+
+ f = fields;
+ fmax = fields + n;
+
+ while (f < fmax)
+ {
+	/* Since both these are slstrings, only compare pointer */
+	if (name == f->name)
+	 return f;
+
+	f++;
+ }
+
+ return NULL;
+}
+
+static _pSLstruct_Field_Type *find_field (_pSLang_Struct_Type *s, SLCONST char *name)
+{
+ return find_field_in_fields (s->fields, s->nfields, name);
+}
+
+static _pSLstruct_Field_Type *find_field_strcmp (_pSLang_Struct_Type *s, SLCONST char *name)
+{
+ _pSLstruct_Field_Type *f, *fmax;
+
+ if (NULL != (f = find_field_in_fields (s->fields, s->nfields, name)))
+ return f;
+
+ f = s->fields;
+ fmax = f + s->nfields;
+
+ while (f < fmax)
+ {
+	if (0 == strcmp (name, f->name))
+	 return f;
+
+	f++;
+ }
+
+ return NULL;
+}
+
+/* This function is used by the qualifier-code. Here "name" cannot be
+ * assumed to be an slstring.
+ */
+SLang_Object_Type *_pSLstruct_get_field_value (SLang_Struct_Type *s, SLCONST char *name)
+{
+ _pSLstruct_Field_Type *f = find_field_strcmp (s, name);
+
+ if (f == NULL)
+ return NULL;
+
+ return &f->obj;
+}
+
+static _pSLstruct_Field_Type *pop_field (_pSLang_Struct_Type *s, SLCONST char *name,
+					_pSLstruct_Field_Type *(*find)(_pSLang_Struct_Type *, SLCONST char *))
+{
+ _pSLstruct_Field_Type *f;
+
+ f = (*find) (s, name);
+ if (f == NULL)
+ _pSLang_verror (SL_INVALID_PARM, "struct has no field named %s", name);
+ return f;
+}
+
+static _pSLang_Struct_Type *
+ create_struct (unsigned int nfields,
+		 SLFUTURE_CONST char **field_names,
+		 SLtype *field_types,
+		 VOID_STAR *field_values)
+{
+ _pSLang_Struct_Type *s;
+ _pSLstruct_Field_Type *f;
+ unsigned int i;
+
+ if (NULL == (s = allocate_struct (nfields)))
+ return NULL;
+
+ f = s->fields;
+ for (i = 0; i < nfields; i++)
+ {
+	SLtype type;
+	SLang_Class_Type *cl;
+	VOID_STAR value;
+	SLFUTURE_CONST char *name = field_names i;
+
+	if (name == NULL)
+	 {
+	 _pSLang_verror (SL_APPLICATION_ERROR, "A struct field name cannot be NULL");
+	 goto return_error;
+	 }
+#if 0
+	if (-1 == _pSLcheck_identifier_syntax (name))
+	 goto return_error;
+#endif
+	if (NULL == (f->name = SLang_create_slstring (name)))
+	 goto return_error;
+
+	if ((field_values == NULL)
+	 || (NULL == (value = field_values i)))
+	 {
+	 f++;
+	 continue;
+	 }
+
+	type = field_typesi;
+	cl = _pSLclass_get_class (type);
+
+	if ((-1 == (cl->cl_apush (type, value)))
+	 || (-1 == SLang_pop (&f->obj)))
+	 goto return_error;
+
+	f++;
+ }
+
+ return s;
+
+ return_error:
+ SLang_free_struct (s);
+ return NULL;
+}
+
+int SLstruct_create_struct (unsigned int nfields,
+			 SLFUTURE_CONST char **field_names,
+			 SLtype *field_types,
+			 VOID_STAR *field_values)
+{
+ _pSLang_Struct_Type *s;
+
+ if (NULL == (s = create_struct (nfields, field_names, field_types, field_values)))
+ return -1;
+
+ if (0 == SLang_push_struct (s))
+ return 0;
+
+ SLang_free_struct (s);
+ return -1;
+}
+
+/* Interpreter interface */
+
+static _pSLang_Struct_Type *struct_from_struct_fields (int nfields)
+{
+ _pSLang_Struct_Type *s;
+ _pSLstruct_Field_Type *f;
+ int max_fields;
+
+ if (nfields <= 0)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Number of struct fields must be > 0");
+	return NULL;
+ }
+
+ if (NULL == (s = allocate_struct (nfields)))
+ return NULL;
+
+ f = s->fields;
+ max_fields = nfields;
+ while (nfields)
+ {
+	char *name;
+	int i;
+
+	nfields--;
+	if (-1 == SLang_pop_slstring (&name))
+	 {
+	 SLang_free_struct (s);
+	 return NULL;
+	 }
+
+	fnfields.name = name;
+
+	for (i = nfields + 1; i < max_fields; i++)
+	 {
+	 if (name != fi.name)
+	 continue;
+
+	 _pSLang_verror (SL_DuplicateDefinition_Error,
+			 "Field %s used more than once in the struct",
+			 name);
+	 SLang_free_struct (s);
+	 return NULL;
+	 }
+ }
+
+ return s;
+}
+
+int _pSLstruct_define_struct (void)
+{
+ _pSLang_Struct_Type *s;
+ int nfields;
+
+ if (-1 == SLang_pop_integer (&nfields))
+ return -1;
+
+ if (NULL == (s = struct_from_struct_fields (nfields)))
+ return -1;
+
+ if (-1 == SLang_push_struct (s))
+ {
+	SLang_free_struct (s);
+	return -1;
+ }
+ return 0;
+}
+
+static int pop_to_struct_field (_pSLang_Struct_Type *s, SLCONST char *name)
+{
+ _pSLstruct_Field_Type *f;
+ SLang_Object_Type obj;
+
+ if ((NULL == (f = pop_field (s, name, find_field)))
+ || (-1 == SLang_pop (&obj)))
+ return -1;
+
+ SLang_free_object (&f->obj);
+ f->obj = obj;
+
+ return 0;
+}
+
+/* Take the fields of b and use those to replace the field atname of a */
+static int merge_struct_fields (SLCONST char *atname, _pSLang_Struct_Type *a, _pSLang_Struct_Type *b)
+{
+ unsigned int i, j;
+ SLFUTURE_CONST char **new_names;
+ _pSLstruct_Field_Type *f, *fmax, *new_fields;
+ _pSLstruct_Field_Type *atfield;
+ unsigned int num_before, num_insert, num_after, new_num;
+
+ atfield = find_field (a, atname);
+ if (atfield == NULL)
+ {
+	SLang_verror (SL_Internal_Error, "Unable to find struct field %s", atname);
+	return -1;
+ }
+ num_before = atfield - a->fields;
+ num_after = a->nfields - (1 + num_before);
+ num_insert = 0;
+
+ if (b != NULL)
+ {
+	unsigned int nb = b->nfields;
+	new_names = (SLFUTURE_CONST char **)_SLcalloc (nb, sizeof (char *));
+	if (new_names == NULL)
+	 return -1;
+
+	f = b->fields;
+	fmax = f + nb;
+	while (f < fmax)
+	 {
+	 if (NULL == find_field (a, f->name))
+	 new_namesnum_insert++ = f->name;
+	 f++;
+	 }
+ }
+ else new_names = NULL;
+
+ new_num = num_before + num_insert + num_after;
+ new_fields = (_pSLstruct_Field_Type *)SLcalloc (new_num, sizeof(_pSLstruct_Field_Type));
+ if (new_fields == NULL)
+ {
+	SLfree ((char *) new_names);
+	return -1;
+ }
+
+ f = a->fields;
+ j = 0;
+ for (i = 0; i < num_before; i++)
+ {
+	new_fieldsj++ = fi;
+	memset ((char *)&fi, 0, sizeof(_pSLstruct_Field_Type));
+ }
+
+ for (i = 0; i < num_insert; i++)
+ {
+	if (NULL == (new_fieldsj.name = SLang_create_slstring (new_namesi)))
+	 goto return_error;
+	j++;
+ }
+
+ f = a->fields + num_before + 1;
+ for (i = 0; i < num_after; i++)
+ {
+	new_fieldsj++ = fi;
+	memset ((char *)&fi, 0, sizeof(_pSLstruct_Field_Type));
+ }
+
+ if (b != NULL)
+ {
+	f = b->fields;
+	fmax = f + b->nfields;
+	while (f < fmax)
+	 {
+	 _pSLstruct_Field_Type *fa;
+
+	 /* Cannot fail by construction */
+	 fa = find_field_in_fields (new_fields, new_num, f->name);
+
+	 if ((-1 == _pSLpush_slang_obj (&f->obj))
+		 || (-1 == SLang_pop (&fa->obj)))
+	 goto return_error;
+
+	 f++;
+	 }
+ }
+
+ SLfree ((char *) new_names);
+ free_fields (a->fields, a->nfields);
+ a->fields = new_fields;
+ a->nfields = new_num;
+ return 0;
+
+return_error:
+
+ free_fields (new_fields, new_num);
+ SLfree ((char *) new_names);
+ return -1;
+}
+
+static int pop_struct_into_field (_pSLang_Struct_Type *s, SLCONST char *name)
+{
+ _pSLang_Struct_Type *t;
+ int status;
+
+ if (SLang_peek_at_stack () == SLANG_NULL_TYPE)
+ {
+	(void) SLdo_pop_n(1);
+	return merge_struct_fields (name, s, NULL);
+ }
+
+ if (-1 == SLang_pop_struct (&t))
+ {
+	SLang_verror (SL_TypeMismatch_Error, "Field %s should represent a struct", name);
+	return -1;
+ }
+
+ status = merge_struct_fields (name, s, t);
+ free_struct (t);
+ return status;
+}
+
+/* This function is used for structure definitions with embedded assignments */
+int _pSLstruct_define_struct2 (void)
+{
+ _pSLang_Struct_Type *s;
+ int nfields;
+ int nassigns;
+
+ if (-1 == SLang_pop_integer (&nassigns))
+ return -1;
+
+ if (-1 == SLang_pop_integer (&nfields))
+ return -1;
+
+ if (NULL == (s = struct_from_struct_fields (nfields)))
+ return -1;
+
+ /* On stack: nameN, valN, ...., name1, val1 .... */
+ if (nassigns
+ && (-1 == SLreverse_stack (2*nassigns)))
+ goto return_error;
+ while (nassigns > 0)
+ {
+	char *name;
+	int status;
+
+	/* Stack: val1, name1, val2, name2, ...
+	 */
+	if ((-1 == SLreverse_stack (2))
+	 || (-1 == SLang_pop_slstring (&name)))
+	 goto return_error;
+
+	if (*name == '@')
+	 status = pop_struct_into_field (s, name);
+	else
+	 status = pop_to_struct_field (s, name);
+
+	SLang_free_slstring (name);
+	if (status == -1)
+	 goto return_error;
+
+	nassigns--;
+ }
+
+ if (0 == SLang_push_struct (s))
+ return 0;
+
+return_error:
+
+ SLang_free_struct (s);
+ return -1;
+}
+
+static int init_struct_with_user_methods (SLtype, _pSLang_Struct_Type *);
+/* Simply make a struct that contains the same fields as struct s. Do not
+ * duplicate the field values.
+ */
+static _pSLang_Struct_Type *make_struct_shell (_pSLang_Struct_Type *s, SLtype type)
+{
+ _pSLang_Struct_Type *new_s;
+ _pSLstruct_Field_Type *new_f, *old_f;
+ unsigned int i, nfields;
+
+ nfields = s->nfields;
+ if (NULL == (new_s = allocate_struct (nfields)))
+ return NULL;
+
+ new_f = new_s->fields;
+ old_f = s->fields;
+
+ for (i = 0; i < nfields; i++)
+ {
+	if (NULL == (new_fi.name = SLang_create_slstring (old_fi.name)))
+	 {
+	 SLang_free_struct (new_s);
+	 return NULL;
+	 }
+ }
+
+ if (type != SLANG_STRUCT_TYPE)
+ (void) init_struct_with_user_methods (type, new_s);
+ return new_s;
+}
+
+static int struct_init_array_object (SLtype type, VOID_STAR addr)
+{
+ SLang_Class_Type *cl;
+ _pSLang_Struct_Type *s;
+
+ cl = _pSLclass_get_class (type);
+ if (NULL == (s = make_struct_shell (cl->cl_struct_def, type)))
+ return -1;
+
+ s->num_refs = 1;
+ *(_pSLang_Struct_Type **) addr = s;
+ return 0;
+}
+
+static int
+typedefed_struct_datatype_deref (SLtype type)
+{
+ SLang_Class_Type *cl;
+ _pSLang_Struct_Type *s;
+
+ cl = _pSLclass_get_class (type);
+ if (NULL == (s = make_struct_shell (cl->cl_struct_def, type)))
+ return -1;
+
+ if (-1 == push_struct_of_type (type, s))
+ {
+	SLang_free_struct (s);
+	return -1;
+ }
+
+ return 0;
+}
+
+static _pSLang_Struct_Type *duplicate_struct (_pSLang_Struct_Type *s, SLtype type)
+{
+ _pSLang_Struct_Type *new_s;
+ _pSLstruct_Field_Type *new_f, *f, *fmax;
+
+ new_s = make_struct_shell (s, type);
+
+ if (new_s == NULL)
+ return NULL;
+
+ f = s->fields;
+ fmax = f + s->nfields;
+ new_f = new_s->fields;
+
+ while (f < fmax)
+ {
+	SLang_Object_Type *obj;
+
+	obj = &f->obj;
+	if (obj->o_data_type != SLANG_UNDEFINED_TYPE)
+	 {
+	 if ((-1 == _pSLpush_slang_obj (obj))
+		 || (-1 == SLang_pop (&new_f->obj)))
+	 {
+		 SLang_free_struct (new_s);
+		 return NULL;
+	 }
+	 }
+	new_f++;
+	f++;
+ }
+
+ return new_s;
+}
+
+static int struct_dereference (SLtype type, VOID_STAR addr)
+{
+ _pSLang_Struct_Type *s;
+
+ if (NULL == (s = duplicate_struct (*(_pSLang_Struct_Type **) addr, type)))
+ return -1;
+
+ if (-1 == push_struct_of_type (type, s))
+ {
+	SLang_free_struct (s);
+	return -1;
+ }
+
+ return 0;
+}
+
+/*{{{ foreach */
+
+struct _pSLang_Foreach_Context_Type
+{
+ _pSLang_Struct_Type *s;
+ char *next_field_name;
+};
+
+static SLang_Foreach_Context_Type *
+struct_foreach_open (SLtype type, unsigned int num)
+{
+ SLang_Foreach_Context_Type *c;
+ _pSLang_Struct_Type *s;
+ char *next_name;
+
+ (void) type;
+
+ if (-1 == SLang_pop_struct (&s))
+ return NULL;
+
+ switch (num)
+ {
+ case 0:
+	next_name = SLang_create_slstring ("next");
+	break;
+
+ case 1:
+	if (-1 == SLang_pop_slstring (&next_name))
+	 next_name = NULL;
+	break;
+
+ default:
+	next_name = NULL;
+	_pSLang_verror (SL_NOT_IMPLEMENTED,
+		 "'foreach (Struct_Type) using' requires single control value");
+	SLdo_pop_n (num);
+	break;
+ }
+
+ if (next_name == NULL)
+ {
+	SLang_free_struct (s);
+	return NULL;
+ }
+
+ c = (SLang_Foreach_Context_Type *)SLmalloc (sizeof (SLang_Foreach_Context_Type));
+ if (c == NULL)
+ {
+	SLang_free_struct (s);
+	SLang_free_slstring (next_name);
+	return NULL;
+ }
+ memset ((char *) c, 0, sizeof (SLang_Foreach_Context_Type));
+
+ c->next_field_name = next_name;
+ c->s = s;
+
+ return c;
+}
+
+static void struct_foreach_close (SLtype type, SLang_Foreach_Context_Type *c)
+{
+ (void) type;
+ if (c == NULL) return;
+
+ SLang_free_slstring (c->next_field_name);
+ if (c->s != NULL) SLang_free_struct (c->s);
+ SLfree ((char *) c);
+}
+
+static int struct_foreach (SLtype type, SLang_Foreach_Context_Type *c)
+{
+ _pSLstruct_Field_Type *f;
+ _pSLang_Struct_Type *next_s;
+
+ (void) type;
+
+ if (c == NULL)
+ return -1;
+
+ if (c->s == NULL)
+ return 0;			 /* done */
+
+ if (-1 == SLang_push_struct (c->s))
+ return -1;
+
+ /* Now get the next one ready for the next foreach loop */
+
+ next_s = NULL;
+ if (NULL != (f = find_field (c->s, c->next_field_name)))
+ {
+	SLang_Class_Type *cl;
+
+	cl = _pSLclass_get_class (f->obj.o_data_type);
+	/* Note that I cannot simply look for SLANG_STRUCT_TYPE since the
+	 * user may have typedefed another struct type. So, look at the
+	 * class methods.
+	 */
+	if (cl->cl_foreach_open == struct_foreach_open)
+	 {
+	 next_s = f->obj.v.struct_val;
+	 next_s->num_refs += 1;
+	 }
+ }
+
+ SLang_free_struct (c->s);
+ c->s = next_s;
+
+ /* keep going */
+ return 1;
+}
+
+/*}}}*/
+
+/* Operator Overloading Functions */
+static int push_struct_of_type (SLtype type, _pSLang_Struct_Type *s);
+
+#define NUM_BINARY_OPS	(SLANG_BINARY_OP_MAX-SLANG_BINARY_OP_MIN+1)
+#define NUM_UNARY_OPS	(SLANG_UNARY_OP_MAX-SLANG_UNARY_OP_MIN+1)
+
+typedef struct Binary_Op_List_Type_
+{
+ SLtype type;
+ SLang_Class_Type *result_cl;
+ SLang_Name_Type *binary_func;
+ struct Binary_Op_List_Type_ *next;
+}
+Binary_Op_List_Type;
+
+typedef struct
+{
+ SLang_Name_Type *this_op_any;
+ SLang_Class_Type *result_this_op_any_cl;
+ SLang_Name_Type *any_op_this;
+ SLang_Class_Type *result_any_op_this_cl;
+ Binary_Op_List_Type *that_op_this_list;
+ Binary_Op_List_Type *this_op_that_list;
+}
+Binary_Op_Info_Type;
+
+typedef struct
+{
+ SLang_Class_Type *result_cl;
+ SLang_Name_Type *unary_function;
+}
+Unary_Op_Info_Type;
+
+typedef struct _Typecast_Info_Type
+{
+ SLang_Name_Type *typecast_fun;
+ SLtype totype;
+ struct _Typecast_Info_Type *next;
+}
+Typecast_Info_Type;
+
+typedef struct _Struct_Info_Type
+{
+ SLtype type;
+ struct _Struct_Info_Type *next;
+
+ int binary_registered;
+ int unary_registered;
+ Binary_Op_Info_Type *bi;
+ Unary_Op_Info_Type *ui;
+ Typecast_Info_Type *ti;
+
+ /* Other methods */
+ SLang_Name_Type *destroy_method;
+ SLang_Name_Type *string_method;
+ SLang_Name_Type *aget_method;
+ SLang_Name_Type *aput_method;
+}
+Struct_Info_Type;
+
+static Struct_Info_Type *Struct_Info_List;
+
+static Binary_Op_Info_Type *find_binary_info (int, SLtype);
+static Unary_Op_Info_Type *find_unary_info (int, SLtype);
+
+static int allocate_struct_info (SLtype type)
+{
+ Struct_Info_Type *si;
+
+ si = (Struct_Info_Type *)SLmalloc (sizeof (Struct_Info_Type));
+ if (si == NULL)
+ return -1;
+
+ memset ((char *) si, 0, sizeof (Struct_Info_Type));
+ si->type = type;
+ si->next = Struct_Info_List;
+ Struct_Info_List = si;
+
+ return 0;
+}
+
+static Struct_Info_Type *find_struct_info (SLtype type, int do_error)
+{
+ Struct_Info_Type *s, *prev = NULL;
+
+ s = Struct_Info_List;
+ while (s != NULL)
+ {
+	Struct_Info_Type *next = s->next;
+	if (s->type == type)
+	 {
+	 if (s != Struct_Info_List)
+	 {
+		 if (prev != NULL)
+		 prev->next = next;
+		 s->next = Struct_Info_List;
+		 Struct_Info_List = s;
+	 }
+	 return s;
+	 }
+	prev = s;
+	s = next;
+ }
+ if (do_error)
+ _pSLang_verror (SL_TYPE_MISMATCH,
+		 "%s is not a user-defined type", SLclass_get_datatype_name (type));
+ return NULL;
+}
+
+static int struct_unary_result (int op, SLtype t, SLtype *result)
+{
+ Unary_Op_Info_Type *ui;
+
+ if (NULL == (ui = find_unary_info (op, t)))
+ return 0;
+
+ if (ui->result_cl == NULL)
+ return 0;
+
+ *result = (SLtype) ui->result_cl->cl_data_type;
+ return 1;
+}
+
+static int check_struct_array (SLtype t, SLang_Struct_Type **sp, SLuindex_Type n)
+{
+ SLuindex_Type i;
+
+ for (i = 0; i < n; i++)
+ {
+	if (spi == NULL)
+	 {
+	 _pSLang_verror (SL_VARIABLE_UNINITIALIZED, "%s%lu not initialized for binary/unary operation",
+			 SLclass_get_datatype_name(t), (unsigned long) i);
+	 return -1;
+	 }
+ }
+ return 0;
+}
+
+static int struct_unary (int op, SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+			 VOID_STAR bp)
+{
+ SLang_Struct_Type **sa;
+ Unary_Op_Info_Type *ui;
+ SLuindex_Type i;
+ SLtype result_type;
+ SLang_Name_Type *function;
+ SLang_Class_Type *bcl;
+ int (*apop) (SLtype, VOID_STAR);
+ size_t binc;
+
+ if (NULL == (ui = find_unary_info (op, a_type)))
+ {
+	_pSLang_verror (SL_INTERNAL_ERROR, "unary-op not supported");
+	return -1;
+ }
+
+ sa = (SLang_Struct_Type **) ap;
+
+ if (-1 == check_struct_array (a_type, sa, na))
+ return -1;
+
+ function = ui->unary_function;
+ bcl = ui->result_cl;
+ result_type = bcl->cl_data_type;
+ apop = bcl->cl_apop;
+ binc = bcl->cl_sizeof_type;
+
+ for (i = 0; i < na; i++)
+ {
+	if ((-1 == SLang_start_arg_list ())
+	 || (-1 == push_struct_of_type (a_type, sai))
+	 || (-1 == SLang_end_arg_list ())
+	 || (-1 == SLexecute_function (function))
+	 || (-1 == (*apop)(result_type, bp)))
+	 goto return_error;
+
+	bp = (VOID_STAR) ((char *)bp + binc);
+ }
+
+ return 1;
+
+ return_error:
+ while (i > 0)
+ {
+	i--;
+	bp = (VOID_STAR) ((char *)bp - binc);
+	bcl->cl_adestroy (result_type, bp);
+	memset ((char *)bp, 0, binc);
+ }
+ return -1;
+}
+
+static Binary_Op_List_Type *find_type_in_binary_list (Binary_Op_List_Type *list, SLtype type)
+{
+ while ((list != NULL) && (list->type != type))
+ list = list->next;
+
+ return list;
+}
+
+static int this_op_any_result (int op, SLtype a, SLtype b, SLtype *result)
+{
+ Binary_Op_Info_Type *bi;
+ Binary_Op_List_Type *item;
+ SLang_Class_Type *cl;
+
+ if (NULL == (bi = find_binary_info (op, a)))
+ return 0;
+
+ if (NULL != (item = find_type_in_binary_list (bi->this_op_that_list, b)))
+ cl = item->result_cl;
+ else
+ cl = bi->result_this_op_any_cl;
+
+ if (cl == NULL)
+ return 0;
+
+ *result = cl->cl_data_type;
+ return 1;
+}
+
+static int any_op_this_result (int op, SLtype a, SLtype b, SLtype *result)
+{
+ Binary_Op_Info_Type *bi;
+ Binary_Op_List_Type *item;
+ SLang_Class_Type *cl;
+
+ if (NULL == (bi = find_binary_info (op, b)))
+ return 0;
+
+ if (NULL != (item = find_type_in_binary_list (bi->that_op_this_list, a)))
+ cl = item->result_cl;
+ else
+ cl = bi->result_any_op_this_cl;
+
+ if (cl == NULL)
+ return 0;
+
+ *result = cl->cl_data_type;
+ return 1;
+}
+
+static int do_struct_binary (SLang_Name_Type *function,
+			 SLang_Class_Type *cla, VOID_STAR ap, SLuindex_Type na,
+			 SLang_Class_Type *clb, VOID_STAR bp, SLuindex_Type nb,
+			 SLang_Class_Type *clc, VOID_STAR cp)
+{
+ SLuindex_Type i;
+ SLtype a_type, b_type, c_type;
+ int (*cpop) (SLtype, VOID_STAR);
+ int (*apush) (SLtype, VOID_STAR);
+ int (*bpush) (SLtype, VOID_STAR);
+ size_t ainc, binc, cinc;
+ SLuindex_Type num;
+
+ if (na == 1) ainc = 0; else ainc = cla->cl_sizeof_type;
+ if (nb == 1) binc = 0; else binc = clb->cl_sizeof_type;
+ cinc = clc->cl_sizeof_type;
+
+ a_type = cla->cl_data_type;
+ b_type = clb->cl_data_type;
+ c_type = clc->cl_data_type;
+ apush = cla->cl_apush;
+ bpush = clb->cl_apush;
+ cpop = clc->cl_apop;
+
+ if (na > nb) num = na; else num = nb;
+
+ for (i = 0; i < num; i++)
+ {
+	if ((-1 == SLang_start_arg_list ())
+	 || (-1 == (*apush) (a_type, ap))
+	 || (-1 == (*bpush) (b_type, bp))
+	 || (-1 == SLang_end_arg_list ())
+	 || (-1 == SLexecute_function (function))
+	 || (-1 == (*cpop)(c_type, cp)))
+	 goto return_error;
+
+	ap = (VOID_STAR) ((char *)ap + ainc);
+	bp = (VOID_STAR) ((char *)bp + binc);
+	cp = (VOID_STAR) ((char *)cp + cinc);
+ }
+
+ return 1;
+
+ return_error:
+ while (i > 0)
+ {
+	i--;
+	cp = (VOID_STAR) ((char *)cp - cinc);
+	clc->cl_adestroy (c_type, cp);
+	memset ((char *)cp, 0, cinc);
+ }
+ return -1;
+}
+
+static int this_op_any (int op,
+			SLtype a, VOID_STAR ap, SLuindex_Type na,
+			SLtype b, VOID_STAR bp, SLuindex_Type nb,
+			VOID_STAR cp)
+{
+ Binary_Op_Info_Type *bi;
+ Binary_Op_List_Type *item;
+ SLang_Name_Type *nt;
+ SLang_Class_Type *cl;
+
+ if (NULL == (bi = find_binary_info (op, a)))
+ {
+	_pSLang_verror (SL_INTERNAL_ERROR, "binary-op not supported");
+	return -1;
+ }
+
+ if (NULL != (item = find_type_in_binary_list (bi->this_op_that_list, b)))
+ {
+	nt = item->binary_func;
+	cl = item->result_cl;
+ }
+ else
+ {
+	nt = bi->this_op_any;
+	cl = bi->result_this_op_any_cl;
+ }
+
+ return do_struct_binary (nt,
+			 _pSLclass_get_class (a), ap, na,
+			 _pSLclass_get_class (b), bp, nb,
+			 cl, cp);
+}
+
+static int any_op_this (int op,
+			SLtype a, VOID_STAR ap, SLuindex_Type na,
+			SLtype b, VOID_STAR bp, SLuindex_Type nb,
+			VOID_STAR cp)
+{
+ Binary_Op_Info_Type *bi;
+ Binary_Op_List_Type *item;
+ SLang_Name_Type *nt;
+ SLang_Class_Type *cl;
+
+ if (NULL == (bi = find_binary_info (op, b)))
+ {
+	_pSLang_verror (SL_INTERNAL_ERROR, "binary-op not supported");
+	return -1;
+ }
+
+ if (NULL != (item = find_type_in_binary_list (bi->that_op_this_list, a)))
+ {
+	nt = item->binary_func;
+	cl = item->result_cl;
+ }
+ else
+ {
+	nt = bi->any_op_this;
+	cl = bi->result_any_op_this_cl;
+ }
+
+ return do_struct_binary (nt,
+			 _pSLclass_get_class (a), ap, na,
+			 _pSLclass_get_class (b), bp, nb,
+			 cl, cp);
+}
+
+static int register_unary_ops (Struct_Info_Type *si, SLtype t)
+{
+ if (si->unary_registered)
+ return 0;
+
+ if (-1 == SLclass_add_unary_op (t, struct_unary, struct_unary_result))
+ return -1;
+
+ si->unary_registered = 1;
+ return 0;
+}
+
+static int register_binary_ops (Struct_Info_Type *si, SLtype t)
+{
+ if (si->binary_registered)
+ return 0;
+
+ if ((-1 == SLclass_add_binary_op (t, SLANG_VOID_TYPE,
+				 this_op_any, this_op_any_result))
+ || (-1 == SLclass_add_binary_op (SLANG_VOID_TYPE, t,
+					any_op_this, any_op_this_result))
+ || (-1 == SLclass_add_binary_op (t, t, this_op_any, this_op_any_result)))
+ return -1;
+
+ si->binary_registered = 1;
+ return 0;
+}
+
+static Unary_Op_Info_Type *find_unary_info (int op, SLtype t)
+{
+ Struct_Info_Type *si;
+
+ if (NULL == (si = find_struct_info (t, 1)))
+ return NULL;
+
+ if (-1 == register_unary_ops (si, t))
+ return NULL;
+
+ if (si->ui == NULL)
+ {
+	Unary_Op_Info_Type *ui;
+
+	ui = (Unary_Op_Info_Type *)_SLcalloc (NUM_UNARY_OPS,sizeof(Unary_Op_Info_Type));
+	if (NULL == (si->ui = ui))
+	 return NULL;
+
+	memset ((char *) ui, 0, NUM_UNARY_OPS*sizeof(Unary_Op_Info_Type));
+ }
+
+ op -= SLANG_UNARY_OP_MIN;
+ if ((op >= NUM_UNARY_OPS) || (op < 0))
+ {
+	_pSLang_verror (SL_INTERNAL_ERROR,
+		 "struct_unary_op: op-code out of range");
+	return NULL;
+ }
+
+ return si->ui + op;
+}
+
+static Binary_Op_Info_Type *find_binary_info (int op, SLtype t)
+{
+ Struct_Info_Type *si;
+
+ if (NULL == (si = find_struct_info (t, 1)))
+ return NULL;
+
+ if (-1 == register_binary_ops (si, t))
+ return NULL;
+
+ if (si->bi == NULL)
+ {
+	Binary_Op_Info_Type *bi;
+
+	bi = (Binary_Op_Info_Type *)_SLcalloc (NUM_BINARY_OPS, sizeof(Binary_Op_Info_Type));
+	if (NULL == (si->bi = bi))
+	 return NULL;
+
+	memset ((char *) bi, 0, NUM_BINARY_OPS*sizeof(Binary_Op_Info_Type));
+ }
+
+ op -= SLANG_BINARY_OP_MIN;
+ if ((op >= NUM_BINARY_OPS) || (op < 0))
+ {
+	_pSLang_verror (SL_INTERNAL_ERROR,
+		 "struct_binary_op: op-code out of range");
+	return NULL;
+ }
+
+ return si->bi + op;
+}
+
+static int add_binary_op_to_list (Binary_Op_List_Type **listp,
+				 SLang_Class_Type *cl,
+				 SLang_Name_Type *nt, SLtype type)
+{
+ Binary_Op_List_Type *item, *list = *listp;
+
+ if (NULL == (item = find_type_in_binary_list (list, type)))
+ {
+	item = (Binary_Op_List_Type *)SLmalloc (sizeof(Binary_Op_List_Type));
+	if (item == NULL)
+	 return -1;
+	memset (item, 0, sizeof(Binary_Op_List_Type));
+	item->type = type;
+
+	if (list == NULL)
+	 *listp = item;
+	else
+	 {
+	 while (list->next != NULL) list = list->next;
+	 list->next = item;
+	 }
+	/* drop */
+ }
+ SLang_free_function (item->binary_func);
+ item->binary_func = nt;
+ item->result_cl = cl;
+ return 0;
+}
+
+static int add_binary_op (char *op,
+			 SLtype result_type, SLang_Name_Type *nt,
+			 SLtype a_type, SLtype b_type)
+{
+ Binary_Op_Info_Type *bi;
+ SLang_Class_Type *cl;
+ int opcode;
+
+ if (-1 == (opcode = _pSLclass_get_binary_opcode (op)))
+ return -1;
+
+ cl = _pSLclass_get_class (result_type);
+
+ if ((a_type == SLANG_ANY_TYPE)
+ || (NULL == find_struct_info (a_type, 0)))
+ {
+	/* something op this form */
+	bi = find_binary_info (opcode, b_type);
+	if (bi == NULL)
+	 return -1;
+	if (a_type == SLANG_ANY_TYPE)
+	 {
+	 SLang_free_function (bi->any_op_this); /* NULL ok */
+	 bi->any_op_this = nt;
+	 bi->result_any_op_this_cl = cl;
+	 return 0;
+	 }
+
+	return add_binary_op_to_list (&bi->that_op_this_list, cl, nt, a_type);
+ }
+
+ /* Otherwise this op something form */
+ bi = find_binary_info (opcode, a_type);
+ if (bi == NULL)
+ return -1;
+ if (b_type == SLANG_ANY_TYPE)
+ {
+	SLang_free_function (bi->this_op_any); /* NULL ok */
+	bi->this_op_any = nt;
+	bi->result_this_op_any_cl = cl;
+	return 0;
+ }
+
+ return add_binary_op_to_list (&bi->this_op_that_list, cl, nt, b_type);
+}
+
+static int add_unary_op (char *op,
+			 SLtype result_type, SLang_Name_Type *nt, SLtype type)
+{
+ Unary_Op_Info_Type *ui;
+ int opcode;
+
+ if (-1 == (opcode = _pSLclass_get_unary_opcode (op)))
+ return -1;
+
+ if (NULL == (ui = find_unary_info (opcode, type)))
+ return -1;
+
+ if (ui->unary_function != NULL)
+ SLang_free_function (ui->unary_function);
+
+ ui->unary_function = nt;
+ ui->result_cl = _pSLclass_get_class (result_type);
+ return 0;
+}
+
+static void add_unary_op_intrin (void)
+{
+ SLtype type, result_type;
+ SLang_Name_Type *nt;
+ char *op;
+
+ if ((-1 == SLang_pop_datatype (&type))
+ || (NULL == (nt = SLang_pop_function ())))
+ return;
+
+ if ((-1 == SLang_pop_datatype (&result_type))
+ || (-1 == SLang_pop_slstring (&op)))
+ {
+	SLang_free_function (nt);
+	return;
+ }
+
+ if (-1 == add_unary_op (op, result_type, nt, type))
+ SLang_free_function (nt);
+
+ SLang_free_slstring (op);
+}
+
+static void add_binary_op_intrin (void)
+{
+ SLtype a_type, b_type, result_type;
+ SLang_Name_Type *nt;
+ char *op;
+
+ if ((-1 == SLang_pop_datatype (&b_type))
+ || (-1 == SLang_pop_datatype (&a_type))
+ || (NULL == (nt = SLang_pop_function ())))
+ return;
+
+ if ((-1 == SLang_pop_datatype (&result_type))
+ || (-1 == SLang_pop_slstring (&op)))
+ {
+	SLang_free_function (nt);
+	return;
+ }
+
+ if (-1 == add_binary_op (op, result_type, nt, a_type, b_type))
+ SLang_free_function (nt);
+
+ SLang_free_slstring (op);
+}
+
+static void add_destroy_method (void)
+{
+ _pSLang_Struct_Type *s;
+ SLang_Name_Type *f;
+
+ if (NULL == (f = SLang_pop_function ()))
+ return;
+
+ if (SLang_peek_at_stack () == SLANG_DATATYPE_TYPE)
+ {
+	SLtype type;
+	Struct_Info_Type *si;
+
+	if ((-1 == SLang_pop_datatype (&type))
+	 || (NULL == (si = find_struct_info (type, 1))))
+	 {
+	 SLang_free_function (f);
+	 return;
+	 }
+
+	if (si->destroy_method != NULL)
+	 SLang_free_function (si->destroy_method);
+	si->destroy_method = f;
+	return;
+ }
+
+ if (-1 == SLang_pop_struct (&s))
+ {
+	SLang_free_function (f);
+	return;
+ }
+
+ if (s->destroy_method != NULL)
+ SLang_free_function (s->destroy_method);
+ s->destroy_method = SLang_copy_function (f);
+ SLang_free_struct (s);
+}
+
+static void add_string_method (SLtype *typep, SLang_Ref_Type *ref)
+{
+ Struct_Info_Type *si;
+ SLang_Name_Type *f;
+ SLtype type = *typep;
+
+ if (NULL == (f = SLang_get_fun_from_ref (ref)))
+ return;
+
+ if (NULL == (si = find_struct_info (type, 1)))
+ return;
+
+ if (si->string_method != NULL)
+ SLang_free_function (si->string_method);
+
+ si->string_method = SLang_copy_function (f);
+}
+
+static int aget_method (SLtype type, unsigned int num_indices)
+{
+ Struct_Info_Type *si;
+
+ if (NULL == (si = find_struct_info (type, 1)))
+ return -1;
+
+ if (si->aget_method == NULL)
+ {
+	SLang_verror (SL_Internal_Error, "aget method called but is NULL");
+	return -1;
+ }
+
+ if ((-1 == _pSLang_restart_arg_list ((int) num_indices))
+ || (-1 == SLang_end_arg_list ())
+ || (-1 == SLexecute_function (si->aget_method)))
+ return -1;
+
+ return 0;
+}
+
+static int aput_method (SLtype type, unsigned int num_indices)
+{
+ Struct_Info_Type *si;
+
+ if (NULL == (si = find_struct_info (type, 1)))
+ return -1;
+
+ if (si->aput_method == NULL)
+ {
+	SLang_verror (SL_Internal_Error, "aput method called but is NULL");
+	return -1;
+ }
+
+ if ((-1 == _pSLang_restart_arg_list ((int) num_indices))
+ || (-1 == SLang_end_arg_list ())
+ || (-1 == SLexecute_function (si->aput_method)))
+ return -1;
+
+ return 0;
+}
+
+static void add_aget_method (SLtype *typep, SLang_Ref_Type *ref)
+{
+ Struct_Info_Type *si;
+ SLang_Name_Type *f;
+ SLtype type = *typep;
+ SLang_Class_Type *cl;
+
+ if (NULL == (cl = _pSLclass_get_class (type)))
+ return;
+
+ if (NULL == (f = SLang_get_fun_from_ref (ref)))
+ return;
+
+ if (NULL == (si = find_struct_info (type, 1)))
+ return;
+
+ if (si->aget_method != NULL)
+ SLang_free_function (si->aget_method);
+
+ si->aget_method = SLang_copy_function (f);
+ (void) SLclass_set_aget_function (cl, aget_method);
+}
+
+static void add_aput_method (SLtype *typep, SLang_Ref_Type *ref)
+{
+ Struct_Info_Type *si;
+ SLang_Name_Type *f;
+ SLtype type = *typep;
+ SLang_Class_Type *cl;
+
+ if (NULL == (cl = _pSLclass_get_class (type)))
+ return;
+
+ if (NULL == (f = SLang_get_fun_from_ref (ref)))
+ return;
+
+ if (NULL == (si = find_struct_info (type, 1)))
+ return;
+
+ if (si->aput_method != NULL)
+ SLang_free_function (si->aput_method);
+
+ si->aput_method = SLang_copy_function (f);
+ (void) SLclass_set_aput_function (cl, aput_method);
+}
+
+static Typecast_Info_Type *find_typecast (Struct_Info_Type *si, SLtype to)
+{
+ Typecast_Info_Type *ti = si->ti;
+
+ while (ti != NULL)
+ {
+	if (ti->totype == to)
+	 return ti;
+	ti = ti->next;
+ }
+ return ti;
+}
+
+static int typecast_method (SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+			 SLtype b_type, VOID_STAR bp)
+{
+ Struct_Info_Type *si;
+ Typecast_Info_Type *ti;
+ SLuindex_Type i;
+ SLang_Class_Type *acl, *bcl;
+ int (*apush) (SLtype, VOID_STAR);
+ int (*bpop) (SLtype, VOID_STAR);
+ size_t ainc, binc;
+ SLang_Name_Type *f;
+
+ if (NULL == (si = find_struct_info (a_type, 1)))
+ return -1;
+
+ if ((NULL == (ti = find_typecast (si, b_type)))
+ || (NULL == (f = ti->typecast_fun)))
+ {
+	_pSLang_verror (SL_TYPE_MISMATCH, "Typecast method not found");
+	return -1;
+ }
+
+ acl = _pSLclass_get_class (a_type);
+ bcl = _pSLclass_get_class (b_type);
+ apush = acl->cl_apush;
+ bpop = bcl->cl_apop;
+ ainc = acl->cl_sizeof_type;
+ binc = bcl->cl_sizeof_type;
+
+ for (i = 0; i < na; i++)
+ {
+	if ((-1 == SLang_start_arg_list ())
+	 || (-1 == (*apush) (a_type, ap))
+	 || (-1 == SLang_end_arg_list ())
+	 || (-1 == SLexecute_function (f))
+	 || (-1 == (*bpop)(b_type, bp)))
+	 return -1;
+
+	ap = (VOID_STAR) ((char *)ap + ainc);
+	bp = (VOID_STAR) ((char *)bp + binc);
+ }
+
+ return 1;
+}
+
+static void add_typecast_method (SLtype *fromtype, SLtype *totype, SLang_Ref_Type *ref)
+{
+ Struct_Info_Type *si;
+ SLang_Name_Type *f;
+ SLtype to = *totype, from = *fromtype;
+ Typecast_Info_Type *ti;
+
+ if (NULL == (f = SLang_get_fun_from_ref (ref)))
+ return;
+
+ if (NULL == (si = find_struct_info (from, 1)))
+ return;
+
+ if (NULL != (ti = find_typecast (si, to)))
+ {
+	if (ti->typecast_fun != NULL)
+	 SLang_free_function (ti->typecast_fun);
+	ti->typecast_fun = SLang_copy_function (f);
+	return;
+ }
+
+ if (NULL == (ti = (Typecast_Info_Type *)SLmalloc (sizeof (Typecast_Info_Type))))
+ return;
+
+ ti->totype = to;
+ ti->typecast_fun = SLang_copy_function (f);
+ ti->next = si->ti;
+ si->ti = ti;
+ (void) SLclass_add_typecast (from, to, typecast_method, 1);
+}
+
+static int init_struct_with_user_methods (SLtype type, _pSLang_Struct_Type *s)
+{
+ Struct_Info_Type *si;
+
+ if (NULL == (si = find_struct_info (type, 1)))
+ return -1;
+
+ s->destroy_method = SLang_copy_function (si->destroy_method);
+
+ return 0;
+}
+
+static int struct_sput (SLtype type, SLFUTURE_CONST char *name)
+{
+ _pSLang_Struct_Type *s;
+
+ (void) type;
+
+ if (-1 == SLang_pop_struct (&s))
+ return -1;
+
+ if (-1 == pop_to_struct_field (s, name))
+ {
+	SLang_free_struct (s);
+	return -1;
+ }
+ SLang_free_struct (s);
+ return 0;
+}
+
+int _pSLstruct_pop_field (SLang_Struct_Type *s, SLFUTURE_CONST char *name, int do_free)
+{
+ int ret = pop_to_struct_field (s, name);
+
+ if (do_free)
+ SLang_free_struct (s);
+
+ return ret;
+}
+
+int _pSLstruct_push_field (SLang_Struct_Type *s, SLFUTURE_CONST char *name, int do_free)
+{
+ _pSLstruct_Field_Type *f;
+ int ret;
+
+ if (NULL == (f = pop_field (s, name, find_field)))
+ {
+	if (do_free) SLang_free_struct (s);
+	return -1;
+ }
+
+ ret = _pSLpush_slang_obj (&f->obj);
+ if (do_free) SLang_free_struct (s);
+ return ret;
+}
+
+static int struct_sget (SLtype type, SLFUTURE_CONST char *name)
+{
+ _pSLang_Struct_Type *s;
+ _pSLstruct_Field_Type *f;
+ int ret;
+
+ (void) type;
+
+ if (-1 == SLang_pop_struct (&s))
+ return -1;
+
+ if (NULL == (f = pop_field (s, name, find_field)))
+ {
+	SLang_free_struct (s);
+	return -1;
+ }
+
+ ret = _pSLpush_slang_obj (&f->obj);
+ SLang_free_struct (s);
+ return ret;
+}
+
+static int struct_typecast
+ (SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+ SLtype b_type, VOID_STAR bp)
+{
+ _pSLang_Struct_Type **a, **b;
+ unsigned int i;
+
+ (void) a_type;
+ (void) b_type;
+
+ a = (_pSLang_Struct_Type **) ap;
+ b = (_pSLang_Struct_Type **) bp;
+ for (i = 0; i < na; i++)
+ {
+	bi = ai;
+	if (ai != NULL)
+	 ai->num_refs += 1;
+ }
+
+ return 1;
+}
+
+static char *string_method (SLtype type, VOID_STAR p)
+{
+ SLang_Struct_Type *s;
+ Struct_Info_Type *si;
+ SLang_Name_Type *f;
+ char *str;
+
+ s = *(SLang_Struct_Type **)p;
+
+ si = find_struct_info (type, 0);
+ if ((si == NULL)
+ || (NULL == (f = si->string_method)))
+ {
+	char buf256;
+	(void) SLsnprintf (buf, sizeof(buf), "%s with %d fields", SLclass_get_datatype_name (type), s->nfields);
+	return SLmake_string (buf);
+ }
+
+ if ((-1 == SLang_start_arg_list ())
+ || (-1 == SLang_push_struct (s))
+ || (-1 == SLang_end_arg_list ())
+ || (-1 == SLexecute_function (f)))
+ return NULL;
+
+ if (-1 == SLpop_string (&str))
+ return NULL;
+
+ return str;
+}
+
+static int struct_eqs_method (SLtype a_type, VOID_STAR ap, SLtype b_type, VOID_STAR bp)
+{
+ SLang_Struct_Type *a, *b;
+ _pSLstruct_Field_Type *afields;
+ unsigned int i, nfields;
+
+ a = *(SLang_Struct_Type **) ap;
+ b = *(SLang_Struct_Type **) bp;
+
+ /* Suppose typedef struct {x}T; a = @T; b = typecast (a, Struct_Type);
+ * Then a_type != b_type BUT ap == bp. So compare pointers after types
+ */
+ if ((a_type != b_type)
+ || (a->nfields != b->nfields))
+ return 0;
+
+ if (a == b)
+ return 1;
+
+ nfields = a->nfields;
+ afields = a->fields;
+
+ for (i = 0; i < nfields; i++)
+ {
+	if (NULL == find_field (b, afieldsi.name))
+	 return 0;
+ }
+
+ for (i = 0; i < nfields; i++)
+ {
+	int status;
+
+	_pSLstruct_Field_Type *afield = afields + i;
+	_pSLstruct_Field_Type *bfield = find_field (b, afield->name);
+	status = _pSLclass_obj_eqs (&afield->obj, &bfield->obj);
+	if (status <= 0)
+	 return status;
+ }
+
+ return 1;
+}
+
+static int struct_acopy (SLtype unused, VOID_STAR src_sptr, VOID_STAR dest_sptr)
+{
+ _pSLang_Struct_Type *s;
+
+ (void) unused;
+ s = *(_pSLang_Struct_Type **)src_sptr;
+ s->num_refs++;
+ *(_pSLang_Struct_Type **)dest_sptr = s;
+ return 0;
+}
+
+int _pSLstruct_define_typedef (void)
+{
+ char *type_name;
+ _pSLang_Struct_Type *s, *s1;
+ SLang_Class_Type *cl;
+
+ if (-1 == SLang_pop_slstring (&type_name))
+ return -1;
+
+ if (-1 == SLang_pop_struct (&s))
+ {
+	SLang_free_slstring (type_name);
+	return -1;
+ }
+
+ if (NULL == (s1 = make_struct_shell (s, SLANG_STRUCT_TYPE)))
+ {
+	SLang_free_slstring (type_name);
+	SLang_free_struct (s);
+	return -1;
+ }
+
+ SLang_free_struct (s);
+
+ if (NULL == (cl = SLclass_allocate_class (type_name)))
+ {
+	SLang_free_slstring (type_name);
+	SLang_free_struct (s1);
+	return -1;
+ }
+ SLang_free_slstring (type_name);
+
+ cl->cl_struct_def = s1;
+ cl->cl_datatype_deref = typedefed_struct_datatype_deref;
+ cl->cl_destroy = struct_destroy;
+ cl->cl_push = struct_push;
+ cl->cl_dereference = struct_dereference;
+ cl->cl_foreach_open = struct_foreach_open;
+ cl->cl_foreach_close = struct_foreach_close;
+ cl->cl_foreach = struct_foreach;
+
+ (void) SLclass_set_aelem_init_function (cl, struct_init_array_object);
+ (void) SLclass_set_string_function (cl, string_method);
+ (void) SLclass_set_eqs_function (cl, struct_eqs_method);
+ (void) SLclass_set_acopy_function (cl, struct_acopy);
+
+ cl->cl_sget = struct_sget;
+ cl->cl_sput = struct_sput;
+ cl->is_container = 1;
+ cl->is_struct = 1;
+
+ if ((-1 == SLclass_register_class (cl,
+				 SLANG_VOID_TYPE, /* any open slot */
+				 sizeof (_pSLang_Struct_Type),
+				 SLANG_CLASS_TYPE_PTR))
+ || (-1 == allocate_struct_info (cl->cl_data_type)))
+ {
+	/* FIXME: Priority=low */
+	/* There is a memory leak here if this fails... */
+	return -1;
+ }
+ /* Note: typecast from a user type to a struct type allowed but not the other
+ * way.
+ */
+ if (-1 == SLclass_add_typecast (cl->cl_data_type, SLANG_STRUCT_TYPE, struct_typecast, 1))
+ return -1;
+
+ return 0;
+}
+
+static int
+struct_datatype_deref (SLtype stype)
+{
+ (void) stype;
+
+ if (SLang_peek_at_stack () == SLANG_ARRAY_TYPE)
+ {
+	SLang_Array_Type *at;
+	int status;
+
+	if (-1 == SLang_pop_array_of_type (&at, SLANG_STRING_TYPE))
+	 return -1;
+
+	status = SLstruct_create_struct (at->num_elements,
+					 (SLFUTURE_CONST char **) at->data, NULL, NULL);
+
+	SLang_free_array (at);
+	return status;
+ }
+
+ if (-1 == SLang_push_int (SLang_Num_Function_Args))
+ return -1;
+
+ return _pSLstruct_define_struct ();
+}
+
+static int register_struct (void)
+{
+ SLang_Class_Type *cl;
+
+ if (NULL == (cl = SLclass_allocate_class ("Struct_Type")))
+ return -1;
+
+ (void) SLclass_set_destroy_function (cl, struct_destroy);
+ (void) SLclass_set_push_function (cl, struct_push);
+ cl->cl_dereference = struct_dereference;
+ cl->cl_datatype_deref = struct_datatype_deref;
+
+ cl->cl_foreach_open = struct_foreach_open;
+ cl->cl_foreach_close = struct_foreach_close;
+ cl->cl_foreach = struct_foreach;
+
+ cl->cl_sget = struct_sget;
+ cl->cl_sput = struct_sput;
+ (void) SLclass_set_string_function (cl, string_method);
+ (void) SLclass_set_eqs_function (cl, struct_eqs_method);
+ (void) SLclass_set_acopy_function (cl, struct_acopy);
+
+ cl->is_container = 1;
+ cl->is_struct = 1;
+
+ if (-1 == SLclass_register_class (cl, SLANG_STRUCT_TYPE, sizeof (_pSLang_Struct_Type),
+				 SLANG_CLASS_TYPE_PTR))
+ return -1;
+
+ return 0;
+}
+
+static void get_struct_field_names (_pSLang_Struct_Type *s)
+{
+ SLang_Array_Type *a;
+ char **data;
+ SLindex_Type i, nfields;
+ _pSLstruct_Field_Type *f;
+
+ nfields = (SLindex_Type) s->nfields;
+
+ if (NULL == (a = SLang_create_array (SLANG_STRING_TYPE, 0, NULL, &nfields, 1)))
+ return;
+
+ f = s->fields;
+ data = (char **) a->data;
+ for (i = 0; i < nfields; i++)
+ {
+	/* Since we are dealing with hashed strings, the next call should not
+	 * fail. If it does, the interpreter will handle it at some other
+	 * level.
+	 */
+	data i = SLang_create_slstring (fi.name);
+ }
+
+ SLang_push_array (a, 1);
+}
+
+static void push_struct_fields_intrin (void)
+{
+ _pSLang_Struct_Type *s;
+ _pSLstruct_Field_Type *f, *fmax;
+ SLang_Array_Type *at = NULL;
+ int num;
+
+ switch (SLang_Num_Function_Args)
+ {
+ default:
+	SLang_verror (SL_Usage_Error, "Usage: Incorrect number of arguments passed, expecting one or two arguments");
+	return;
+ case 2:
+	if (-1 == SLang_pop_array_of_type (&at, SLANG_STRING_TYPE))
+	 return;
+	/* drop */
+ case 1:
+	if (-1 == SLang_pop_struct (&s))
+	 {
+	 SLang_free_array (at); /* NULL ok */
+	 return;
+	 }
+	break;
+ }
+
+ if (at != NULL)
+ {
+	char **namep, **namep_max;
+	int ret = 0;
+
+	namep = (char **)at->data;
+	namep_max = namep + at->num_elements;
+	while ((ret == 0) && (namep < namep_max))
+	 {
+	 /* Use strcmp method since there is no guarantee that the array is one of slstrings */
+	 if (NULL == (f = find_field_strcmp (s, *namep)))
+	 ret = SLang_push_null ();
+	 else
+	 ret = _pSLpush_slang_obj (&f->obj);
+
+	 namep++;
+	 }
+	SLang_free_array (at);
+	free_struct (s);
+	return;
+ }
+
+ f = s->fields;
+ fmax = f + s->nfields;
+ num = 0;
+
+ while (fmax > f)
+ {
+	fmax--;
+	if (-1 == _pSLpush_slang_obj (&fmax->obj))
+	 break;
+
+	num++;
+ }
+ SLang_free_struct (s);
+ (void) SLang_push_int (num);
+}
+
+/* Syntax: set_struct_field (s, name, value); */
+static void struct_set_field (void)
+{
+ _pSLang_Struct_Type *s;
+ _pSLstruct_Field_Type *f;
+ SLang_Object_Type obj;
+ char *name;
+
+ if (-1 == SLang_pop (&obj))
+ return;
+
+ if (-1 == SLang_pop_slstring (&name))
+ {
+	SLang_free_object (&obj);
+	return;
+ }
+
+ if (-1 == SLang_pop_struct (&s))
+ {
+	SLang_free_slstring (name);
+	SLang_free_object (&obj);
+	return;
+ }
+
+ if (NULL == (f = pop_field (s, name, find_field)))
+ {
+	SLang_free_struct (s);
+	SLang_free_slstring (name);
+	SLang_free_object (&obj);
+	return;
+ }
+
+ SLang_free_object (&f->obj);
+ f->obj = obj;
+
+ SLang_free_struct (s);
+ SLang_free_slstring (name);
+}
+
+/* Syntax: set_struct_fields (s, values....); */
+static void set_struct_fields (void)
+{
+ unsigned int n;
+ _pSLang_Struct_Type *s;
+ _pSLstruct_Field_Type *f;
+
+ n = (unsigned int) SLang_Num_Function_Args;
+
+ if (-1 == SLreverse_stack (n))
+ return;
+
+ n--;
+ if (-1 == SLang_pop_struct (&s))
+ {
+	SLdo_pop_n (n);
+	return;
+ }
+
+ if (n > s->nfields)
+ {
+	SLdo_pop_n (n);
+	_pSLang_verror (SL_INVALID_PARM, "Too many values for structure");
+	SLang_free_struct (s);
+	return;
+ }
+
+ f = s->fields;
+ while (n > 0)
+ {
+	SLang_Object_Type obj;
+
+	if (-1 == SLang_pop (&obj))
+	 break;
+
+	SLang_free_object (&f->obj);
+	f->obj = obj;
+
+	f++;
+	n--;
+ }
+
+ SLang_free_struct (s);
+}
+
+static void get_struct_field (char *name)
+{
+ (void) struct_sget (0, name);
+}
+
+static int is_struct_type (void)
+{
+ SLang_Object_Type obj;
+ SLtype type;
+ int status;
+
+ if (-1 == SLang_pop (&obj))
+ return -1;
+
+ type = obj.o_data_type;
+ if (type == SLANG_STRUCT_TYPE)
+ status = 1;
+ else
+ status = (NULL != _pSLclass_get_class (type)->cl_struct_def);
+ SLang_free_object (&obj);
+ return status;
+}
+
+static int is_struct_type1 (void)
+{
+ SLang_Object_Type obj;
+ SLtype type;
+ int status;
+
+ if (-1 == SLang_pop (&obj))
+ return -1;
+
+ type = obj.o_data_type;
+ if (type == SLANG_ARRAY_TYPE)
+ type = obj.v.array_val->data_type;
+ if (type == SLANG_STRUCT_TYPE)
+ status = 1;
+ else
+ status = (NULL != _pSLclass_get_class (type)->cl_struct_def);
+ SLang_free_object (&obj);
+ return status;
+}
+
+static SLang_Intrin_Fun_Type Struct_Table =
+{
+ MAKE_INTRINSIC_1("get_struct_field_names", get_struct_field_names, SLANG_VOID_TYPE, SLANG_STRUCT_TYPE),
+ MAKE_INTRINSIC_1("get_struct_field", get_struct_field, SLANG_VOID_TYPE, SLANG_STRING_TYPE),
+ MAKE_INTRINSIC_0("_push_struct_field_values", push_struct_fields_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("set_struct_field", struct_set_field, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("set_struct_fields", set_struct_fields, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("is_struct_type", is_struct_type, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_0("_is_struct_type", is_struct_type1, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_0("__add_unary", add_unary_op_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("__add_binary", add_binary_op_intrin, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("__add_destroy", add_destroy_method, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_2("__add_string", add_string_method, SLANG_VOID_TYPE, SLANG_DATATYPE_TYPE, SLANG_REF_TYPE),
+ MAKE_INTRINSIC_2("__add_aget", add_aget_method, SLANG_VOID_TYPE, SLANG_DATATYPE_TYPE, SLANG_REF_TYPE),
+ MAKE_INTRINSIC_2("__add_aput", add_aput_method, SLANG_VOID_TYPE, SLANG_DATATYPE_TYPE, SLANG_REF_TYPE),
+ MAKE_INTRINSIC_3("__add_typecast", add_typecast_method, SLANG_VOID_TYPE, SLANG_DATATYPE_TYPE, SLANG_DATATYPE_TYPE, SLANG_REF_TYPE),
+
+ /* MAKE_INTRINSIC_I("_create_struct", create_struct, SLANG_VOID_TYPE), */
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+int _pSLstruct_init (void)
+{
+ if ((-1 == SLadd_intrin_fun_table (Struct_Table, NULL))
+ || (-1 == register_struct ()))
+ return -1;
+
+ return 0;
+}
+
+void _pSLstruct_pop_args (int *np)
+{
+ SLang_Array_Type *at;
+ SLindex_Type i, n;
+ _pSLang_Struct_Type **data;
+
+ n = *np;
+
+ if (n < 0)
+ {
+	SLang_set_error (SL_INVALID_PARM);
+	return;
+ }
+
+ data = (_pSLang_Struct_Type **) _SLcalloc (n, sizeof (_pSLang_Struct_Type *));
+ if (data == NULL)
+ {
+	SLdo_pop_n (n);
+	return;
+ }
+
+ memset ((char *)data, 0, n * sizeof (_pSLang_Struct_Type *));
+
+ i = n;
+ while (i > 0)
+ {
+	_pSLang_Struct_Type *s;
+	_pSLstruct_Field_Type *f;
+
+	i--;
+
+	if (NULL == (s = allocate_struct (1)))
+	 goto return_error;
+
+	datai = s;
+	s->num_refs += 1;	 /* keeping a copy */
+
+	f = s->fields;
+	if (NULL == (f->name = SLang_create_slstring ("value")))
+	 goto return_error;
+
+	if (-1 == SLang_pop (&f->obj))
+	 goto return_error;
+ }
+
+ if (NULL == (at = SLang_create_array (SLANG_STRUCT_TYPE, 0,
+					 (VOID_STAR) data, &n, 1)))
+ goto return_error;
+
+ (void) SLang_push_array (at, 1);
+ return;
+
+ return_error:
+ for (i = 0; i < n; i++)
+ {
+	_pSLang_Struct_Type *s;
+
+	s = datai;
+	if (s != NULL)
+	 SLang_free_struct (s);
+ }
+
+ SLfree ((char *) data);
+}
+
+void _pSLstruct_push_args (SLang_Array_Type *at)
+{
+ _pSLang_Struct_Type **sp;
+ SLuindex_Type num;
+
+ if (at->data_type != SLANG_STRUCT_TYPE)
+ {
+	SLang_set_error (SL_TYPE_MISMATCH);
+	return;
+ }
+
+ sp = (_pSLang_Struct_Type **) at->data;
+ num = at->num_elements;
+
+ while ((_pSLang_Error == 0) && (num > 0))
+ {
+	_pSLang_Struct_Type *s;
+
+	num--;
+	if (NULL == (s = *sp++))
+	 {
+	 SLang_push_null ();
+	 continue;
+	 }
+
+	/* I should check to see if the value field is present, but... */
+	(void) _pSLpush_slang_obj (&s->fields->obj);
+ }
+}
+
+/* C structures */
+static _pSLstruct_Field_Type *find_field_via_strcmp (_pSLang_Struct_Type *s, SLCONST char *name)
+{
+ _pSLstruct_Field_Type *f, *fmax;
+
+ f = s->fields;
+ fmax = f + s->nfields;
+
+ while (f < fmax)
+ {
+	if (0 == strcmp (name, f->name))
+	 return f;
+
+	f++;
+ }
+ return NULL;
+}
+
+static void free_cstruct_field (SLang_CStruct_Field_Type *cfield, VOID_STAR cs)
+{
+ SLang_Class_Type *cl;
+
+ if ((cfield->read_only == 0)
+ && (NULL != (cl = _pSLclass_get_class (cfield->type))))
+ _pSLarray_free_array_elements (cl, (VOID_STAR)((char*)cs + cfield->offset), 1);
+}
+
+void SLang_free_cstruct (VOID_STAR cs, SLang_CStruct_Field_Type *cfields)
+{
+ if ((cs == NULL) || (cfields == NULL))
+ return;
+
+ while (cfields->field_name != NULL)
+ {
+	free_cstruct_field (cfields, cs);
+	cfields++;
+ }
+}
+
+int SLang_pop_cstruct (VOID_STAR cs, SLang_CStruct_Field_Type *cfields)
+{
+ _pSLang_Struct_Type *s;
+ SLang_CStruct_Field_Type *cfield;
+ SLCONST char *field_name;
+ char *cs_addr;
+
+ if ((cfields == NULL) || (cs == NULL))
+ return -1;
+
+ if (-1 == SLang_pop_struct (&s))
+ return -1;
+
+ cfield = cfields;
+ cs_addr = (char *) cs;
+
+ while (NULL != (field_name = cfield->field_name))
+ {
+	if (cfield->read_only == 0)
+	 {
+	 _pSLstruct_Field_Type *f;
+	 SLang_Class_Type *cl;
+	 VOID_STAR addr = (VOID_STAR) (cs_addr + cfield->offset);
+
+	 if ((NULL == (f = pop_field (s, field_name, find_field_via_strcmp)))
+		 || (-1 == _pSLpush_slang_obj (&f->obj)))
+	 goto return_error;
+
+	 if (cfield->type == SLANG_ARRAY_TYPE)
+	 {
+		 if (-1 == SLang_pop_array ((SLang_Array_Type **)addr, 1))
+		 goto return_error;
+	 }
+	 else if ((NULL == (cl = _pSLclass_get_class (cfield->type)))
+		 || (-1 == (*cl->cl_apop)(cfield->type, addr)))
+	 goto return_error;
+	 }
+
+	cfield++;
+ }
+
+ SLang_free_struct (s);
+ return 0;
+
+ return_error:
+ while (cfield != cfields)
+ {
+	free_cstruct_field (cfield, cs);
+	cfield--;
+ }
+ SLang_free_struct (s);
+ return -1;
+}
+
+static _pSLang_Struct_Type *create_cstruct (VOID_STAR cs, SLang_CStruct_Field_Type *cfields)
+{
+ unsigned int i, n;
+ _pSLang_Struct_Type *s;
+ SLang_CStruct_Field_Type *cfield;
+ SLFUTURE_CONST char **field_names;
+ VOID_STAR *field_values;
+ SLtype *field_types;
+
+ if ((cs == NULL) || (cfields == NULL))
+ return NULL;
+
+ cfield = cfields;
+ while (cfield->field_name != NULL)
+ cfield++;
+ n = cfield - cfields;
+ if (n == 0)
+ {
+	_pSLang_verror (SL_APPLICATION_ERROR, "C structure has no fields");
+	return NULL;
+ }
+
+ s = NULL;
+ field_types = NULL;
+ field_values = NULL;
+ if ((NULL == (field_names = (SLFUTURE_CONST char **) _SLcalloc (n,sizeof (char *))))
+ || (NULL == (field_types = (SLtype *)_SLcalloc (n,sizeof(SLtype))))
+ || (NULL == (field_values = (VOID_STAR *)_SLcalloc (n,sizeof(VOID_STAR)))))
+ goto return_error;
+
+ for (i = 0; i < n; i++)
+ {
+	cfield = cfields + i;
+	field_namesi = cfield->field_name;
+	field_typesi = cfield->type;
+	field_valuesi = (VOID_STAR)((char *)cs + cfield->offset);
+ }
+
+ s = create_struct (n, field_names, field_types, field_values);
+ /* drop */
+
+ return_error:
+ SLfree ((char *) field_values);
+ SLfree ((char *) field_types);
+ SLfree ((char *) field_names);
+
+ return s;
+}
+
+int SLang_push_cstruct (VOID_STAR cs, SLang_CStruct_Field_Type *cfields)
+{
+ _pSLang_Struct_Type *s;
+
+ if (NULL == (s = create_cstruct (cs, cfields)))
+ return -1;
+
+ if (0 == SLang_push_struct (s))
+ return 0;
+
+ SLang_free_struct (s);
+ return -1;
+}
+
+int SLang_assign_cstruct_to_ref (SLang_Ref_Type *ref, VOID_STAR cs, SLang_CStruct_Field_Type *cfields)
+{
+ _pSLang_Struct_Type *s;
+
+ if (NULL == (s = create_cstruct (cs, cfields)))
+ return -1;
+
+ if (0 == SLang_assign_to_ref (ref, SLANG_STRUCT_TYPE, (VOID_STAR) &s))
+ return 0;
+
+ SLang_free_struct (s);
+ return -1;
+}
+
+/* Struct Field Reference */
+typedef struct
+{
+ SLang_Struct_Type *s;
+ SLCONST char *field_name;
+}
+Struct_Field_Ref_Type;
+
+static int struct_field_deref_assign (VOID_STAR vdata)
+{
+ Struct_Field_Ref_Type *data = (Struct_Field_Ref_Type *)vdata;
+ return pop_to_struct_field (data->s, data->field_name);
+}
+
+static int struct_field_deref (VOID_STAR vdata)
+{
+ Struct_Field_Ref_Type *frt = (Struct_Field_Ref_Type *)vdata;
+ _pSLstruct_Field_Type *f;
+
+ if (NULL == (f = pop_field (frt->s, frt->field_name, find_field)))
+ return -1;
+
+ return _pSLpush_slang_obj (&f->obj);
+}
+
+static void struct_field_ref_destroy (VOID_STAR vdata)
+{
+ Struct_Field_Ref_Type *frt = (Struct_Field_Ref_Type *)vdata;
+
+ SLang_free_slstring ((char *) frt->field_name);
+ SLang_free_struct (frt->s);
+}
+
+/* Stack: struct */
+int _pSLstruct_push_field_ref (SLFUTURE_CONST char *name)
+{
+ SLang_Struct_Type *s;
+ Struct_Field_Ref_Type *frt;
+ SLang_Ref_Type *ref;
+ int ret;
+
+ if (-1 == SLang_pop_struct (&s))
+ return -1;
+
+ if (NULL == (name = SLang_create_slstring (name)))
+ {
+	SLang_free_struct (s);
+	return -1;
+ }
+ if (NULL == (ref = _pSLang_new_ref (sizeof (Struct_Field_Ref_Type))))
+ {
+	SLang_free_struct (s);
+	SLang_free_slstring ((char *) name);
+	return -1;
+ }
+ frt = (Struct_Field_Ref_Type *) ref->data;
+ frt->s = s;
+ frt->field_name = name;
+ ref->deref = struct_field_deref;
+ ref->deref_assign = struct_field_deref_assign;
+ ref->destroy = struct_field_ref_destroy;
+
+ ret = SLang_push_ref (ref);
+ SLang_free_ref (ref);
+ return ret;
+}
+
+SLang_Struct_Type *SLang_create_struct (SLFUTURE_CONST char **field_names, unsigned int nfields)
+{
+ SLang_Struct_Type *s = create_struct (nfields, field_names, NULL, NULL);
+ if (s != NULL)
+ s->num_refs = 1;
+ return s;
+}
+
+int SLang_pop_struct_field (SLang_Struct_Type *s, char *name)
+{
+ _pSLstruct_Field_Type *f;
+ SLang_Object_Type obj;
+
+ if (NULL == (f = pop_field (s, name, find_field_via_strcmp)))
+ return -1;
+
+ if (-1 == SLang_pop (&obj))
+ return -1;
+
+ if (f->obj.o_data_type != SLANG_NULL_TYPE)
+ SLang_free_object (&f->obj);
+
+ f->obj = obj;
+ return 0;
+}
+
+int SLang_push_struct_field (SLang_Struct_Type *s, char *name)
+{
+ _pSLstruct_Field_Type *f;
+
+ if (NULL == (f = pop_field (s, name, find_field_via_strcmp)))
+ return -1;
+
+ return _pSLpush_slang_obj (&f->obj);
+}
+
+int SLang_pop_struct_fields (SLang_Struct_Type *s, int n)
+{
+ _pSLstruct_Field_Type *fields, *f;
+
+ if (n < 0)
+ n = (int) s->nfields;
+ else if ((unsigned int)n > s->nfields)
+ {
+	_pSLang_verror (SL_Application_Error, "SLang_pop_struct_fields called with too many field values");
+	return -1;
+ }
+
+ fields = s->fields;
+ f = fields + n;
+ while (f > fields)
+ {
+	SLang_Object_Type obj;
+
+	f--;
+
+	if (-1 == SLang_pop (&obj))
+	 return -1;
+
+	if (f->obj.o_data_type != SLANG_NULL_TYPE)
+	 SLang_free_object (&f->obj);
+
+	f->obj = obj;
+ }
+ return 0;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/sltermin.c Added

@@ -0,0 +1,738 @@
+/* This file contains enough terminfo reading capabilities sufficient for
+ * the slang SLtt interface.
+ */
+
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+/*
+ * The majority of the comments found in the file were taken from the
+ * term(4) man page on an SGI.
+ */
+
+/* The ncurses terminfo binary files come in two flavors: A legacy
+ * format that uses 16 bit integers in the number-section, and a new
+ * 32 bit format (ncurses 6.1, from 2018).
+ */
+
+/* Short integers are stored in two 8-bit bytes. The first byte contains
+ * the least significant 8 bits of the value, and the second byte contains
+ * the most significant 8 bits. (Thus, the value represented is
+ * 256*second+first.) The value -1 is represented by 0377,0377, and the
+ * value -2 is represented by 0376,0377; other negative values are illegal.
+ * The -1 generally means that a capability is missing from this terminal.
+ * The -2 means that the capability has been cancelled in the terminfo
+ * source and also is to be considered missing.
+ */
+
+static int make_integer16 (unsigned char *buf)
+{
+ register int lo, hi;
+ lo = (int) *buf++; hi = (int) *buf;
+ if (hi == 0377)
+ {
+	if (lo == 0377) return -1;
+	if (lo == 0376) return -2;
+ }
+ return lo + 256 * hi;
+}
+
+static int make_integer32 (unsigned char *buf)
+{
+ unsigned int u;
+ int i;
+
+ u = (unsigned int)buf0;
+ u |= ((unsigned int)buf1)<<8;
+ u |= ((unsigned int)buf2)<<16;
+ u |= ((unsigned int)buf3)<<24;
+
+ i = (int)u;
+ return i;
+}
+
+/*
+ * The compiled file is created from the source file descriptions of the
+ * terminals (see the -I option of infocmp) by using the terminfo compiler,
+ * tic, and read by the routine setupterm see curses(3X). The file is
+ * divided into six parts in the following order: the header, terminal
+ * names, boolean flags, numbers, strings, and string table.
+ *
+ * The header section begins the file. This section contains six
+ * short integers in the format described below. These integers are
+ * (1) the magic number (legacy:0432, 32 bit:01036); (2) the size, in
+ * bytes, of the names section; (3) the number of bytes in the
+ * boolean section; (4) the number of integers in the numbers
+ * section; (5) the number of offsets (short integers) in the strings
+ * section; (6) the size, in bytes, of the string table.
+ */
+
+#define MAGIC_LEGACY 0432
+#define MAGIC_32BIT 01036
+
+/* In this structure, all char * fields are malloced EXCEPT if the
+ * structure is SLTERMCAP. In that case, only terminal_names is malloced
+ * and the other fields are pointers into it.
+ */
+struct _pSLterminfo_Type
+{
+#define SLTERMINFO 1
+#define SLTERMCAP 2
+ unsigned int flags;
+
+ unsigned int name_section_size;
+ char *terminal_names;
+
+ unsigned int boolean_section_size;
+ unsigned char *boolean_flags;
+
+ unsigned int num_numbers;
+ unsigned char *numbers;
+ unsigned int sizeof_number;
+ int (*make_integer)(unsigned char *);
+
+ unsigned int num_string_offsets;
+ unsigned char *string_offsets;
+
+ unsigned int string_table_size;
+ char *string_table;
+
+};
+
+static char *tcap_getstr (SLCONST char *, SLterminfo_Type *);
+static int tcap_getnum (SLCONST char *, SLterminfo_Type *);
+static int tcap_getflag (SLCONST char *, SLterminfo_Type *);
+static int tcap_getent (SLCONST char *, SLterminfo_Type *);
+
+static FILE *open_terminfo (char *file, SLterminfo_Type *h)
+{
+ FILE *fp;
+ unsigned char buf12;
+ int magic;
+
+ /* Alan Cox reported a security problem here if the application using the
+ * library is setuid. So, I need to make sure open the file as a normal
+ * user. Unfortunately, there does not appear to be a portable way of
+ * doing this, so I am going to use 'setfsgid' and 'setfsuid', which
+ * are not portable.
+ *
+ * I will also look into the use of setreuid, seteuid and setregid, setegid.
+ * FIXME: Priority=medium
+ */
+ fp = fopen (file, "rb");
+ if (fp == NULL) return NULL;
+
+ if (12 != fread ((char *)buf, 1, 12, fp))
+ {
+	(void) fclose(fp);
+	return NULL;
+ }
+ magic = make_integer16(buf);
+ if (magic == MAGIC_LEGACY)
+ {
+	h->make_integer = make_integer16;
+	h->sizeof_number = 2;
+ }
+ else if (magic == MAGIC_32BIT)
+ {
+	h->make_integer = make_integer32;
+	h->sizeof_number = 4;
+ }
+ else
+ {
+	(void) fclose (fp);
+	return NULL;
+ }
+
+ h->name_section_size = make_integer16 (buf + 2);
+ h->boolean_section_size = make_integer16 (buf + 4);
+ h->num_numbers = make_integer16 (buf + 6);
+ h->num_string_offsets = make_integer16 (buf + 8);
+ h->string_table_size = make_integer16 (buf + 10);
+
+ return fp;
+}
+
+/*
+ * The terminal names section comes next. It contains the first line of the
+ * terminfo description, listing the various names for the terminal,
+ * separated by the bar ( | ) character (see term(5)). The section is
+ * terminated with an ASCII NUL character.
+ */
+
+/* returns pointer to malloced space */
+static unsigned char *read_terminfo_section (FILE *fp, unsigned int size)
+{
+ char *s;
+
+ if (NULL == (s = (char *) SLmalloc (size))) return NULL;
+ if (size != fread (s, 1, size, fp))
+ {
+	SLfree (s);
+	return NULL;
+ }
+ return (unsigned char *) s;
+}
+
+static char *read_terminal_names (FILE *fp, SLterminfo_Type *t)
+{
+ return t->terminal_names = (char *) read_terminfo_section (fp, t->name_section_size);
+}
+
+/*
+ * The boolean flags have one byte for each flag. This byte is either 0 or
+ * 1 as the flag is present or absent. The value of 2 means that the flag
+ * has been cancelled. The capabilities are in the same order as the file
+ * <term.h>.
+ */
+
+static unsigned char *read_boolean_flags (FILE *fp, SLterminfo_Type *t)
+{
+ /* Between the boolean section and the number section, a null byte is
+ * inserted, if necessary, to ensure that the number section begins on an
+ * even byte offset. All short integers are aligned on a short word
+ * boundary.
+ */
+
+ unsigned int size = (t->name_section_size + t->boolean_section_size) % 2;
+ size += t->boolean_section_size;
+
+ return t->boolean_flags = read_terminfo_section (fp, size);
+}
+
+/*
+ * The numbers section is similar to the boolean flags section. Each
+ * capability takes up 2(4) bytes for the legacy(32 bit) format and
+ * is stored as a integer. If the value represented is -1 or -2, the
+ * capability is taken to be missing.
+ */
+
+static unsigned char *read_numbers (FILE *fp, SLterminfo_Type *t)
+{
+ return t->numbers = read_terminfo_section (fp, t->sizeof_number * t->num_numbers);
+}
+
+/* The strings section is also similar. Each capability is stored as a
+ * short integer, in the format above. A value of -1 or -2 means the
+ * capability is missing. Otherwise, the value is taken as an offset from
+ * the beginning of the string table. Special characters in ^X or \c
+ * notation are stored in their interpreted form, not the printing
+ * representation. Padding information ($<nn>) and parameter information
+ * (%x) are stored intact in uninterpreted form.
+ */
+
+static unsigned char *read_string_offsets (FILE *fp, SLterminfo_Type *t)
+{
+ return t->string_offsets = (unsigned char *) read_terminfo_section (fp, 2 * t->num_string_offsets);
+}
+
+/* The final section is the string table. It contains all the values of
+ * string capabilities referenced in the string section. Each string is
+ * null terminated.
+ */
+
+static char *read_string_table (FILE *fp, SLterminfo_Type *t)
+{
+ return t->string_table = (char *) read_terminfo_section (fp, t->string_table_size);
+}
+
+/*
+ * Compiled terminfo(4) descriptions are placed under the directory
+ * /usr/share/lib/terminfo. In order to avoid a linear search of a huge
+ * UNIX system directory, a two-level scheme is used:
+ * /usr/share/lib/terminfo/c/name where name is the name of the terminal,
+ * and c is the first character of name. Thus, att4425 can be found in the
+ * file /usr/share/lib/terminfo/a/att4425. Synonyms for the same terminal
+ * are implemented by multiple links to the same compiled file.
+ */
+
+static SLCONST char *Terminfo_Dirs =
+{
+ "", /* $TERMINFO */
+ "", /* $HOME/.terminfo */
+#ifdef MISC_TERMINFO_DIRS
+ MISC_TERMINFO_DIRS,
+#endif
+ "/usr/local/etc/terminfo",
+ "/usr/local/share/terminfo",
+ "/usr/local/lib/terminfo",
+ "/etc/terminfo",
+ "/usr/share/terminfo",
+ "/usr/lib/terminfo",
+ "/usr/share/lib/terminfo",
+ "/lib/terminfo",
+ NULL,
+};
+
+void _pSLtt_tifreeent (SLterminfo_Type *t)
+{
+ if (t == NULL)
+ return;
+
+ if (t->flags != SLTERMCAP)
+ {
+	SLfree ((char *)t->string_table);
+	SLfree ((char *)t->string_offsets);
+	SLfree ((char *)t->numbers);
+	SLfree ((char *)t->boolean_flags);
+ }
+ SLfree ((char *)t->terminal_names);
+ SLfree ((char *)t);
+}
+
+SLterminfo_Type *_pSLtt_tigetent (SLCONST char *term)
+{
+ SLCONST char **tidirs, *tidir;
+ FILE *fp = NULL;
+ char file1024;
+ static char home_ti 1024;
+ char *env;
+ SLterminfo_Type *ti;
+
+ if (
+ (term == NULL)
+#ifdef SLANG_UNTIC
+ && (SLang_Untic_Terminfo_File == NULL)
+#endif
+ )
+ return NULL;
+
+ if (_pSLsecure_issetugid ()
+ && ((term0 == '.') || (NULL != strchr (term, '/'))))
+ return NULL;
+
+ if (NULL == (ti = (SLterminfo_Type *) SLmalloc (sizeof (SLterminfo_Type))))
+ {
+	return NULL;
+ }
+ memset ((char *)ti, 0, sizeof (SLterminfo_Type));
+
+#ifdef SLANG_UNTIC
+ if (SLang_Untic_Terminfo_File != NULL)
+ {
+	fp = open_terminfo (SLang_Untic_Terminfo_File, ti);
+	goto fp_open_label;
+ }
+ else
+#endif
+ /* If we are on a termcap based system, use termcap */
+ if (0 == tcap_getent (term, ti)) return ti;
+
+ if (NULL != (env = _pSLsecure_getenv ("TERMINFO")))
+ Terminfo_Dirs0 = env;
+
+ if (NULL != (env = _pSLsecure_getenv ("HOME")))
+ {
+	strncpy (home_ti, env, sizeof (home_ti) - 11);
+	home_ti sizeof(home_ti) - 11 = 0;
+	strcat (home_ti, "/.terminfo");
+	Terminfo_Dirs 1 = home_ti;
+ }
+
+ tidirs = Terminfo_Dirs;
+ while (NULL != (tidir = *tidirs++))
+ {
+	if (*tidir == 0)
+	 continue;
+
+	if (sizeof (file) > strlen (tidir) + 5 + strlen (term))
+	 {
+	 sprintf (file, "%s/%c/%s", tidir, *term, term);
+	 if (NULL != (fp = open_terminfo (file, ti)))
+	 break;
+	 sprintf (file, "%s/%02x/%s", tidir, (unsigned char)*term, term);
+	 if (NULL != (fp = open_terminfo (file, ti)))
+	 break;
+	 }
+ }
+
+#ifdef SLANG_UNTIC
+ fp_open_label:
+#endif
+
+ if (fp == NULL)
+ {
+	SLfree ((char *) ti);
+	return NULL;
+ }
+
+ ti->flags = SLTERMINFO;
+ if ((NULL == read_terminal_names (fp, ti))
+ || (NULL == read_boolean_flags (fp, ti))
+ || (NULL == read_numbers (fp, ti))
+ || (NULL == read_string_offsets (fp, ti))
+ || (NULL == read_string_table (fp, ti)))
+ {
+	_pSLtt_tifreeent (ti);
+	ti = NULL;
+ }
+ (void) fclose (fp);
+ return ti;
+}
+
+#ifdef SLANG_UNTIC
+# define UNTIC_COMMENT(x) ,x
+#else
+# define UNTIC_COMMENT(x)
+#endif
+
+typedef SLCONST struct
+{
+ char name3;
+ int offset;
+#ifdef SLANG_UNTIC
+ char *comment;
+#endif
+}
+Tgetstr_Map_Type;
+
+#include "terminfo.inc"
+
+static int compute_cap_offset (SLCONST char *cap, SLterminfo_Type *t, Tgetstr_Map_Type *map, unsigned int max_ofs)
+{
+ char cha, chb;
+
+ (void) t;
+ cha = *cap++; chb = *cap;
+
+ while (*map->name != 0)
+ {
+	if ((cha == *map->name) && (chb == *(map->name + 1)))
+	 {
+	 if (map->offset >= (int) max_ofs) return -1;
+	 return map->offset;
+	 }
+	map++;
+ }
+ return -1;
+}
+
+char *_pSLtt_tigetstr (SLterminfo_Type *t, SLCONST char *cap)
+{
+ int offset;
+
+ if (t == NULL)
+ return NULL;
+
+ if (t->flags == SLTERMCAP) return tcap_getstr (cap, t);
+
+ offset = compute_cap_offset (cap, t, Tgetstr_Map, t->num_string_offsets);
+ if (offset < 0) return NULL;
+ offset = make_integer16 (t->string_offsets + 2 * offset);
+ if (offset < 0) return NULL;
+ return t->string_table + offset;
+}
+
+int _pSLtt_tigetnum (SLterminfo_Type *t, SLCONST char *cap)
+{
+ int offset;
+
+ if (t == NULL)
+ return -1;
+
+ if (t->flags == SLTERMCAP) return tcap_getnum (cap, t);
+
+ offset = compute_cap_offset (cap, t, Tgetnum_Map, t->num_numbers);
+ if (offset < 0) return -1;
+
+ return (*t->make_integer)(t->numbers + t->sizeof_number * offset);
+}
+
+int _pSLtt_tigetflag (SLterminfo_Type *t, SLCONST char *cap)
+{
+ int offset;
+
+ if (t == NULL) return -1;
+
+ if (t->flags == SLTERMCAP) return tcap_getflag (cap, t);
+
+ offset = compute_cap_offset (cap, t, Tgetflag_Map, t->boolean_section_size);
+
+ if (offset < 0) return -1;
+ return (int) *(t->boolean_flags + offset);
+}
+
+/* These are my termcap routines. They only work with the TERMCAP environment
+ * variable. This variable must contain the termcap entry and NOT the file.
+ */
+
+static int tcap_getflag (SLCONST char *cap, SLterminfo_Type *t)
+{
+ char a, b;
+ char *f = (char *) t->boolean_flags;
+ char *fmax;
+
+ if (f == NULL) return 0;
+ fmax = f + t->boolean_section_size;
+
+ a = *cap;
+ b = *(cap + 1);
+ while (f < fmax)
+ {
+	if ((a == f0) && (b == f1))
+	 return 1;
+	f += 2;
+ }
+ return 0;
+}
+
+static char *tcap_get_cap (unsigned char *cap, unsigned char *caps, unsigned int len)
+{
+ unsigned char c0, c1;
+ unsigned char *caps_max;
+
+ c0 = cap0;
+ c1 = cap1;
+
+ if (caps == NULL) return NULL;
+ caps_max = caps + len;
+ while (caps < caps_max)
+ {
+	if ((c0 == caps0) && (c1 == caps1))
+	 {
+	 return (char *) caps + 3;
+	 }
+	caps += (int) caps2;
+ }
+ return NULL;
+}
+
+static int tcap_getnum (SLCONST char *cap, SLterminfo_Type *t)
+{
+ cap = tcap_get_cap ((unsigned char *) cap, t->numbers, t->num_numbers);
+ if (cap == NULL) return -1;
+ return atoi (cap);
+}
+
+static char *tcap_getstr (SLCONST char *cap, SLterminfo_Type *t)
+{
+ return tcap_get_cap ((unsigned char *) cap, (unsigned char *) t->string_table, t->string_table_size);
+}
+
+static int tcap_extract_field (unsigned char *t0)
+{
+ register unsigned char ch, *t = t0;
+ while (((ch = *t) != 0) && (ch != ':')) t++;
+ if (ch == ':') return (int) (t - t0);
+ return -1;
+}
+
+int SLtt_Try_Termcap = 1;
+static int tcap_getent (SLCONST char *term, SLterminfo_Type *ti)
+{
+ unsigned char *termcap, ch;
+ unsigned char *buf, *b;
+ unsigned char *t;
+ int len;
+ SLstrlen_Type ulen;
+
+ if (SLtt_Try_Termcap == 0) return -1;
+#if 1
+ /* XFREE86 xterm sets the TERMCAP environment variable to an invalid
+ * value. Specifically, it lacks the tc= string.
+ */
+ if (!strncmp (term, "xterm", 5))
+ return -1;
+#endif
+ termcap = (unsigned char *) getenv ("TERMCAP");
+ if ((termcap == NULL) || (*termcap == '/')) return -1;
+
+ /* SUN Solaris 7&8 have bug in tset program under tcsh,
+ * eval `tset -s -A -Q` sets value of TERMCAP to ":",
+ * under other shells it works fine.
+ * SUN was informed, they marked it as duplicate of bug 4086585
+ * but didn't care to fix it... <mikkopa@cs.tut.fi>
+ */
+ if ((termcap0 == ':') && (termcap1 == 0))
+ return -1;
+
+ /* We have a termcap so lets use it provided it does not have a reference
+ * to another terminal via tc=. In that case, use terminfo. The alternative
+ * would be to parse the termcap file which I do not want to do right now.
+ * Besides, this is a terminfo based system and if the termcap were parsed
+ * terminfo would almost never get a chance to run. In addition, the tc=
+ * thing should not occur if tset is used to set the termcap entry.
+ */
+ ti->flags = SLTERMCAP;
+
+ t = termcap;
+ while ((len = tcap_extract_field (t)) != -1)
+ {
+	if ((len > 3) && (t0 == 't') && (t1 == 'c') && (t2 == '='))
+	 return -1;
+	t += (len + 1);
+ }
+
+ /* malloc some extra space just in case it is needed. */
+ ulen = strlen ((char *) termcap) + 256;
+ if (NULL == (buf = (unsigned char *) SLmalloc (ulen)))
+ return -1;
+
+ b = buf;
+
+ /* The beginning of the termcap entry contains the names of the entry.
+ * It is terminated by a colon.
+ */
+
+ ti->terminal_names = (char *) b;
+ t = termcap;
+ len = tcap_extract_field (t);
+ if (len < 0)
+ {
+	SLfree ((char *)buf);
+	return -1;
+ }
+ strncpy ((char *) b, (char *) t, (unsigned int) len);
+ blen = 0;
+ b += len + 1;
+ ti->name_section_size = len;
+
+ /* Now, we are really at the start of the termcap entries. Point the
+ * termcap variable here since we want to refer to this a number of times.
+ */
+ termcap = t + (len + 1);
+
+ /* Process strings first. */
+ ti->string_table = (char *) b;
+ t = termcap;
+ while (-1 != (len = tcap_extract_field (t)))
+ {
+	unsigned char *b1;
+	unsigned char *tmax;
+
+	/* We are looking for: XX=something */
+	if ((len < 4) || (t2 != '=') || (*t == '.'))
+	 {
+	 t += len + 1;
+	 continue;
+	 }
+	tmax = t + len;
+	b1 = b;
+
+	while (t < tmax)
+	 {
+	 ch = *t++;
+	 if ((ch == '\\') && (t < tmax))
+	 {
+		 SLwchar_Type wch;
+
+		 t = (unsigned char *) _pSLexpand_escaped_char ((char *) t, (char *) tmax, &wch, NULL);
+		 if (t == NULL)
+		 {
+		 SLfree ((char *)buf);
+		 return -1;
+		 }
+		 ch = (char) wch;
+	 }
+	 else if ((ch == '^') && (t < tmax))
+	 {
+		 ch = *t++;
+		 if (ch == '?') ch = 127;
+		 else ch = (ch | 0x20) - ('a' - 1);
+	 }
+	 *b++ = ch;
+	 }
+	/* Null terminate it. */
+	*b++ = 0;
+	len = (int) (b - b1);
+	b12 = (unsigned char) len; /* replace the = by the length */
+	/* skip colon to next field. */
+	t++;
+ }
+ ti->string_table_size = (int) (b - (unsigned char *) ti->string_table);
+
+ /* Now process the numbers. */
+
+ t = termcap;
+ ti->numbers = b;
+ while (-1 != (len = tcap_extract_field (t)))
+ {
+	unsigned char *b1;
+	unsigned char *tmax;
+
+	/* We are looking for: XX#NUMBER */
+	if ((len < 4) || (t2 != '#') || (*t == '.'))
+	 {
+	 t += len + 1;
+	 continue;
+	 }
+	tmax = t + len;
+	b1 = b;
+
+	while (t < tmax)
+	 {
+	 *b++ = *t++;
+	 }
+	/* Null terminate it. */
+	*b++ = 0;
+	len = (int) (b - b1);
+	b12 = (unsigned char) len; /* replace the # by the length */
+	t++;
+ }
+ ti->num_numbers = (b - ti->numbers);
+
+ /* Now process the flags. */
+ t = termcap;
+ ti->boolean_flags = b;
+ while (-1 != (len = tcap_extract_field (t)))
+ {
+	/* We are looking for: XX#NUMBER */
+	if ((len != 2) || (*t == '.') || (*t <= ' '))
+	 {
+	 t += len + 1;
+	 continue;
+	 }
+	b0 = t0;
+	b1 = t1;
+	t += 3;
+	b += 2;
+ }
+ ti->boolean_section_size = (b - ti->boolean_flags);
+ return 0;
+}
+
+/* These routines are provided only for backward binary compatability.
+ * They will vanish in V3.x
+ */
+char *SLtt_tigetent (SLFUTURE_CONST char *s)
+{
+ return (char *) _pSLtt_tigetent (s);
+}
+
+char *SLtt_tigetstr (SLFUTURE_CONST char *s, char **p)
+{
+ if (p == NULL)
+ return NULL;
+ return _pSLtt_tigetstr ((SLterminfo_Type *) *p, s);
+}
+
+int SLtt_tigetnum (SLFUTURE_CONST char *s, char **p)
+{
+ if (p == NULL)
+ return -1;
+ return _pSLtt_tigetnum ((SLterminfo_Type *) *p, s);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/sltime.c Added

@@ -0,0 +1,770 @@
+/* time related system calls */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include <sys/types.h>
+#include <time.h>
+#ifdef HAVE_SYS_TIME_H
+# include <sys/time.h>
+#endif
+
+#if defined(__BORLANDC__)
+# include <dos.h>
+#endif
+#if defined(__GO32__) || (defined(__WATCOMC__) && !defined(__QNX__))
+# include <dos.h>
+# include <bios.h>
+#endif
+
+#include <errno.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+#ifdef __WIN32__
+#include <windows.h>
+/* Sleep is defined badly in MSVC... */
+# ifdef _MSC_VER
+# define sleep(n) _sleep((n)*1000)
+# else
+# ifdef sleep
+# undef sleep
+# endif
+# define sleep(x) if(x)Sleep((x)*1000)
+# endif
+#endif
+
+/* Turns on/off intrinsics that _may_ get added in the future */
+#define USE_FROM_FUTURE		0
+
+#if ((SIZEOF_LONG < 8) && defined(HAVE_LONG_LONG))
+# define SLANG_TIME_T_TYPE SLANG_LLONG_TYPE
+typedef long long _sltime_t;
+# define PUSH_TIME_T SLang_push_long_long
+# define POP_TIME_T SLang_pop_long_long
+#else
+# define SLANG_TIME_T_TYPE SLANG_LONG_TYPE
+typedef long _sltime_t;
+# define PUSH_TIME_T SLang_push_long
+# define POP_TIME_T SLang_pop_long
+#endif
+
+static int pop_time_t (time_t *tt)
+{
+ _sltime_t t;
+ if (-1 == POP_TIME_T(&t))
+ return -1;
+ *tt = (time_t)t;
+ return 0;
+}
+
+static int push_time_t (time_t t)
+{
+ return PUSH_TIME_T ((_sltime_t) t);
+}
+
+#if defined(IBMPC_SYSTEM)
+/* For other system (Unix and VMS), _pSLusleep is in sldisply.c */
+int _pSLusleep (unsigned long s)
+{
+ sleep (s/1000000L);
+ s = s % 1000000L;
+
+# if defined(__WIN32__)
+ Sleep (s/1000);
+#else
+# if defined(__IBMC__)
+ DosSleep(s/1000);
+# else
+# if defined(_MSC_VER)
+ _sleep (s/1000);
+# endif
+# endif
+#endif
+ return 0;
+}
+#endif
+
+#if defined(__IBMC__) && !defined(_AIX)
+/* sleep is not a standard function in VA3. */
+unsigned int sleep (unsigned int seconds)
+{
+ DosSleep(1000L * ((long)seconds));
+ return 0;
+}
+#endif
+
+/* Older POSIX standards had a different interfaces for these. Avoid them. */
+#if !defined(_POSIX_C_SOURCE) || (_POSIX_C_SOURCE < 199506L)
+# undef HAVE_CTIME_R
+# undef HAVE_GMTIME_R
+# undef HAVE_LOCALTIME_R
+#endif
+
+static char *ctime_cmd (void)
+{
+ char *t;
+ time_t tt;
+#ifdef HAVE_CTIME_R
+ static char buf64;
+#endif
+ if (-1 == pop_time_t (&tt))
+ return NULL;
+#ifdef HAVE_CTIME_R
+ t = ctime_r (&tt, buf);
+#else
+ t = ctime (&tt);
+#endif
+ t24 = 0; /* knock off \n */
+ return (t);
+}
+
+static void sleep_cmd (void)
+{
+ unsigned int secs;
+#if SLANG_HAS_FLOAT
+ unsigned long usecs;
+ double x;
+
+ if (-1 == SLang_pop_double (&x))
+ return;
+
+ if (x < 0.0)
+ x = 0.0;
+ secs = (unsigned int) x;
+ sleep (secs);
+ x -= (double) secs;
+ usecs = (unsigned long) (1e6 * x);
+ if (usecs > 0) _pSLusleep (usecs);
+#else
+ if (-1 == SLang_pop_uinteger (&secs))
+ return;
+ if (secs != 0) sleep (secs);
+#endif
+}
+
+static void _time_cmd (void)
+{
+ (void) push_time_t (time(NULL));
+}
+
+#if defined(__GO32__)
+static char *djgpp_current_time (void) /*{{{*/
+{
+ union REGS rg;
+ unsigned int year;
+ unsigned char month, day, weekday, hour, minute, sec;
+ char days = "SunMonTueWedThuFriSat";
+ char months = "JanFebMarAprMayJunJulAugSepOctNovDec";
+ static char the_date26;
+
+ rg.h.ah = 0x2A;
+#ifndef __WATCOMC__
+ int86(0x21, &rg, &rg);
+ year = rg.x.cx & 0xFFFF;
+#else
+ int386(0x21, &rg, &rg);
+ year = rg.x.ecx & 0xFFFF;
+#endif
+
+ month = 3 * (rg.h.dh - 1);
+ day = rg.h.dl;
+ weekday = 3 * rg.h.al;
+
+ rg.h.ah = 0x2C;
+
+#ifndef __WATCOMC__
+ int86(0x21, &rg, &rg);
+#else
+ int386(0x21, &rg, &rg);
+#endif
+
+ hour = rg.h.ch;
+ minute = rg.h.cl;
+ sec = rg.h.dh;
+
+ /* we want this form: Thu Apr 14 15:43:39 1994\n */
+ sprintf(the_date, "%.3s %.3s%3d %02d:%02d:%02d %d\n",
+	 days + weekday, months + month,
+	 day, hour, minute, sec, year);
+ return the_date;
+}
+
+/*}}}*/
+
+#endif
+
+char *SLcurrent_time_string (void) /*{{{*/
+{
+ char *the_time;
+#ifndef __GO32__
+ time_t myclock;
+
+ myclock = time((time_t *) 0);
+ the_time = (char *) ctime(&myclock);
+#else
+ the_time = djgpp_current_time ();
+#endif
+ /* returns the form Sun Sep 16 01:03:52 1985\n\0 */
+ the_time24 = '\0';
+ return(the_time);
+}
+
+/*}}}*/
+
+static SLang_CStruct_Field_Type TM_Struct =
+{
+ MAKE_CSTRUCT_INT_FIELD(struct tm, tm_sec, "tm_sec", 0),
+ MAKE_CSTRUCT_INT_FIELD(struct tm, tm_min, "tm_min", 0),
+ MAKE_CSTRUCT_INT_FIELD(struct tm, tm_hour, "tm_hour", 0),
+ MAKE_CSTRUCT_INT_FIELD(struct tm, tm_mday, "tm_mday", 0),
+ MAKE_CSTRUCT_INT_FIELD(struct tm, tm_mon, "tm_mon", 0),
+ MAKE_CSTRUCT_INT_FIELD(struct tm, tm_year, "tm_year", 0),
+ MAKE_CSTRUCT_INT_FIELD(struct tm, tm_wday, "tm_wday", 0),
+ MAKE_CSTRUCT_INT_FIELD(struct tm, tm_yday, "tm_yday", 0),
+ MAKE_CSTRUCT_INT_FIELD(struct tm, tm_isdst, "tm_isdst", 0),
+ SLANG_END_CSTRUCT_TABLE
+};
+
+static int validate_tm (struct tm *tms)
+{
+ if ((tms->tm_sec < 0) || (tms->tm_sec > 61) /* allows for leap-seconds */
+ || (tms->tm_min < 0) || (tms->tm_min > 59)
+ || (tms->tm_hour < 0) || (tms->tm_hour > 23)
+ || (tms->tm_mday < 1) || (tms->tm_mday > 31)
+ || (tms->tm_mon < 0) || (tms->tm_mon > 11)
+ || (tms->tm_wday < 0) || (tms->tm_wday > 6)
+ || (tms->tm_yday < 0) || (tms->tm_yday > 365))
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Time structure contains invalid values");
+	return -1;
+ }
+ /* The man page specifies no range for is_dst. Map it to -1,0,1 for safety */
+ if (tms->tm_isdst < -1) tms->tm_isdst = -1;
+ else if (tms->tm_isdst > 1) tms->tm_isdst = 1;
+ return 0;
+}
+
+static int push_tm_struct (struct tm *tms)
+{
+ if (tms == NULL)
+ return SLang_push_null ();
+ return SLang_push_cstruct ((VOID_STAR) tms, TM_Struct);
+}
+
+static int pop_tm_struct (struct tm *tms)
+{
+ /* The memset is necessary because GLIBC has extra fields that may be
+ * meaningful. In fact, without it strftime will generate access errors
+ */
+ memset ((char *) tms, 0, sizeof (*tms));
+ if (-1 == SLang_pop_cstruct (tms, TM_Struct))
+ return -1;
+
+ return validate_tm (tms);
+}
+
+#ifdef HAVE_GMTIME
+static int call_gmtime (time_t t, struct tm *tmp)
+{
+ struct tm *_tmp;
+# ifdef HAVE_GMTIME_R
+ if (NULL != (_tmp = gmtime_r (&t, tmp)))
+ return 0;
+# else
+ _tmp = gmtime (&t);
+ if (_tmp != NULL)
+ {
+	*tmp = *_tmp;
+	return 0;
+ }
+# endif
+ SLang_verror (SL_RunTime_Error, "libc gmtime returned NULL");
+ return -1;
+}
+#endif
+
+static int call_localtime (time_t t, struct tm *tmp)
+{
+ struct tm *_tmp;
+#ifdef HAVE_LOCALTIME_R
+ if (NULL != (_tmp = localtime_r (&t, tmp)))
+ return 0;
+#else
+ _tmp = localtime (&t);
+ if (_tmp != NULL)
+ {
+	*tmp = *_tmp;
+	return 0;
+ }
+#endif
+ SLang_verror (SL_RunTime_Error, "libc localtime returned NULL");
+ return -1;
+}
+
+
+static void localtime_cmd (void)
+{
+ time_t t;
+ struct tm tm;
+
+ if (-1 == pop_time_t (&t))
+ return;
+ if (0 == call_localtime (t, &tm))
+ (void) push_tm_struct (&tm);
+}
+
+static void gmtime_cmd (void)
+{
+ time_t t;
+ struct tm tm;
+
+ if (-1 == pop_time_t (&t))
+ return;
+
+#ifdef HAVE_GMTIME
+ if (0 == call_gmtime (t, &tm))
+ (void) push_tm_struct (&tm);
+#else
+ if (0 == call_localtime (t, &tm))
+ (void) push_tm_struct (&tm);
+#endif
+}
+
+#ifdef HAVE_GMTIME
+/* Implement gmtime using a binary search. The linux manpage says to
+ * play games with the TZ environment variable but that is too ugly for
+ * my taste.
+ */
+static int tm_cmp (struct tm *a, struct tm *b)
+{
+ if (a->tm_year != b->tm_year)
+ return a->tm_year - b->tm_year;
+ if (a->tm_yday != b->tm_yday)
+ return a->tm_yday - b->tm_yday;
+ if (a->tm_hour - b->tm_hour)
+ return a->tm_hour - b->tm_hour;
+ return (a->tm_min - b->tm_min)*60 + (a->tm_sec - b->tm_sec);
+}
+
+static int timegm_internal (struct tm *tmp, time_t *tp)
+{
+ struct tm tm0;
+ struct tm tm1;
+ time_t t0, t1, t, dt;
+ static time_t delta;
+ static int delta_ok = 0;
+ int diff;
+
+ /* Construct t0 and t1 to bracket the answer. First, guess a value close
+ * to the correct answer. Consider:
+ * tm_utc = gmtime(t)
+ * tm_loc = localtime(t)
+ * delta = tm_loc - tm_utc
+ * Then we expect
+ * t = mktime (tm_loc) = timegm(tm_utc)
+ * = mktime (tm_utc + delta)
+ * = mktime (tm_utc) + delta
+ * ==> timegm(tm) = mktime(tm) + delta
+ * ==> tm = gmtime(mktime(tm+delta))
+ * = gmtime(mktime(tm)) + delta
+ * delta = tm - gmtime(mktime(tm))
+ */
+ if (delta_ok == 0)
+ {
+	/* localtime Jan 15, 2000 00:00:00 */
+	memset ((char *)&tm1, 0, sizeof(tm0));
+	tm1.tm_mday = 15;
+	tm1.tm_year = 100;
+
+	/* want mktime(tm1), but mktime will modify tm1, so use tm0 as a tmp */
+	tm0 = tm1; t1 = mktime (&tm0);
+	if (-1 == call_gmtime (t1, &tm0))
+	 return -1;
+	/* Compute delta = tm1 - tm0 */
+	tm1.tm_hour += 24*(tm1.tm_mday - tm0.tm_mday);
+	delta = (tm1.tm_hour - tm0.tm_hour)*3600
+	 + (tm1.tm_min - tm0.tm_min)*60 + (tm1.tm_sec - tm0.tm_sec);
+	delta_ok = 1;
+ }
+
+ tm0 = *tmp;			 /* do not allow mktime to mess with *tmp */
+ t = mktime (&tm0) + delta;
+
+ /* Find a lower bound */
+ dt = 0;
+ while (1)
+ {
+	int wrapped = 0;
+	t0 = t - dt;
+	while (t0 > t)/* handle wrapping */
+	 {
+	 wrapped = 1;
+	 t0++;
+	 }
+	if (-1 == call_gmtime (t0, &tm0))
+	 return -1;
+	diff = tm_cmp (&tm0, tmp);
+	if (diff == 0)
+	 {
+	 *tp = t0;
+	 return 0;
+	 }
+	if (diff < 0)
+	 break;
+
+	if (wrapped)
+	 {
+	 SLang_verror (SL_Internal_Error, "timegm: Unable to find a lower limit");
+	 return -1;
+	 }
+
+	dt = dt*2 + 1;
+ }
+
+ /* upper bound */
+ dt = 1;
+ while (1)
+ {
+	int wrapped = 0;
+	t1 = t + dt;
+	while (t1 < t)/* handle wrapping */
+	 {
+	 wrapped = 1;
+	 t1--;
+	 }
+	if (-1 == call_gmtime (t1, &tm1))
+	 return -1;
+	diff = tm_cmp (&tm1, tmp);
+	if (diff == 0)
+	 {
+	 *tp = t1;
+	 return 0;
+	 }
+	if (diff>0)
+	 break;
+
+	if (wrapped)
+	 {
+	 SLang_verror (SL_Internal_Error, "timegm: Unable to find an upper limit");
+	 return -1;
+	 }
+	dt = dt * 2;
+ }
+
+ do
+ {
+	struct tm tmx;
+	t = t0 + (t1-t0)/2;
+	if (-1 == call_gmtime (t, &tmx))
+	 return -1;
+	diff = tm_cmp (&tmx, tmp);
+	if (diff == 0)
+	 {
+	 *tp = t;
+	 return 0;
+	 }
+	if (diff < 0)
+	 {
+	 if (t0 == t)
+	 break;
+	 t0 = t; tm0 = tmx;
+	 }
+	else
+	 {
+	 t1 = t; tm1 = tmx;
+	 }
+ }
+ while (t0 + 1 < t1);
+ *tp = t1;
+ return 0;
+}
+
+static void timegm_cmd (void)
+{
+ struct tm tm;
+ time_t t;
+
+ if (-1 == pop_tm_struct (&tm))
+ return;
+ if (-1 == timegm_internal (&tm, &t))
+ return;
+ (void) push_time_t (t);
+}
+
+#endif
+
+#ifdef HAVE_MKTIME
+static void mktime_cmd (void)
+{
+ struct tm tm;
+
+ if (-1 == SLang_pop_cstruct (&tm, TM_Struct))
+ return;
+
+ (void) push_time_t (mktime (&tm));
+}
+#endif
+
+#ifdef HAVE_TIMES
+
+# ifdef HAVE_SYS_TIMES_H
+# include <sys/times.h>
+# endif
+
+#include <limits.h>
+
+#ifdef CLK_TCK
+# define SECS_PER_TICK (1.0/(double)CLK_TCK)
+#else
+# ifdef CLOCKS_PER_SEC
+# define SECS_PER_TICK (1.0/(double)CLOCKS_PER_SEC)
+# else
+# define SECS_PER_TICK (1.0/60.0)
+# endif
+#endif
+
+typedef struct
+{
+ double tms_utime;
+ double tms_stime;
+ double tms_cutime;
+ double tms_cstime;
+}
+TMS_Type;
+
+static SLang_CStruct_Field_Type TMS_Struct =
+{
+ MAKE_CSTRUCT_FIELD(TMS_Type, tms_utime, "tms_utime", SLANG_DOUBLE_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(TMS_Type, tms_stime, "tms_stime", SLANG_DOUBLE_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(TMS_Type, tms_cutime, "tms_cutime", SLANG_DOUBLE_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(TMS_Type, tms_cstime, "tms_cstime", SLANG_DOUBLE_TYPE, 0),
+ SLANG_END_CSTRUCT_TABLE
+};
+
+static void times_cmd (void)
+{
+ TMS_Type d;
+ struct tms t;
+
+ (void) times (&t);
+
+ d.tms_utime = SECS_PER_TICK * (double)t.tms_utime;
+ d.tms_stime = SECS_PER_TICK * (double)t.tms_stime;
+ d.tms_cutime = SECS_PER_TICK * (double)t.tms_cutime;
+ d.tms_cstime = SECS_PER_TICK * (double)t.tms_cstime;
+ (void) SLang_push_cstruct ((VOID_STAR)&d, TMS_Struct);
+}
+
+static struct tms Tic_TMS;
+
+static void _tic_cmd (void)
+{
+ times (&Tic_TMS);
+}
+
+static double _toc_cmd (void)
+{
+ struct tms t;
+ double d;
+
+ (void) times (&t);
+
+ d = ((t.tms_utime - Tic_TMS.tms_utime)
+	+ (t.tms_stime - Tic_TMS.tms_stime)) * SECS_PER_TICK;
+ Tic_TMS = t;
+ return d;
+}
+
+#endif				 /* HAVE_TIMES */
+
+#ifdef __WIN32__
+static LARGE_INTEGER Start_Time, Frequency;
+#else
+# ifdef HAVE_GETTIMEOFDAY
+static struct timeval Start_Time;
+# else
+static time_t Start_Time;
+# endif
+#endif
+
+static void tic_cmd (void)
+{
+#ifdef __WIN32__
+ QueryPerformanceCounter(&Start_Time);
+ QueryPerformanceFrequency(&Frequency);
+#else
+# ifdef HAVE_GETTIMEOFDAY
+ (void) gettimeofday (&Start_Time, NULL);
+# else
+ Start_Time = time (NULL);
+# endif
+#endif
+}
+
+static double toc_cmd (void)
+{
+#ifdef __WIN32__
+ LARGE_INTEGER t;
+
+ QueryPerformanceCounter(&t);
+ return (t.QuadPart-Start_Time.QuadPart)/(double)Frequency.QuadPart;
+#else
+# ifdef HAVE_GETTIMEOFDAY
+ struct timeval tv;
+ (void) gettimeofday (&tv, NULL);
+ return (double) tv.tv_sec - (double) Start_Time.tv_sec
+ + ((double) tv.tv_usec - (double) Start_Time.tv_usec) * 1e-6;
+# else
+ return (double) time(NULL) - Start_Time;
+# endif
+#endif
+}
+
+#ifdef SLANG_HAS_FLOAT
+static double _ftime_cmd (void)
+{
+ double e = 0.0;
+ if (SLang_Num_Function_Args == 1)
+ {
+	if (-1 == SLang_pop_double (&e))
+	 return -1.0;
+ }
+
+# ifdef HAVE_GETTIMEOFDAY
+ {
+	struct timeval tv;
+	(void) gettimeofday (&tv, NULL);
+	return (tv.tv_sec - e) + 1e-6*tv.tv_usec;
+ }
+# else
+ return (double)time(NULL) - e;
+# endif
+}
+#endif
+
+#if defined(__GNUC__)
+# pragma GCC diagnostic ignored "-Wformat-nonliteral"
+#endif
+static void strftime_cmd (void)
+{
+ /* Rather then using some sort of portable version of strftime, which would
+ * miss the locale-specific features, just call the system routine. However,
+ * it cannot be called blindly because some versions (e.g., the the one from
+ * c.snippets.org) do no input checking, and use code such as
+ *
+ * static char *day = {"Sunday", "Monday", ..., "Saturday"};
+ * ...
+ * switch (*f++)
+ * {
+ * case 'A' :
+ * r = dayt->tm_wday;
+ * break;
+ * ...
+ *
+ * and lead to a SEGV if t->tm_wday is not in the range 0:6.
+ */
+ struct tm tms;
+ char buf4096;
+ int status;
+ char *fmt;
+
+ if (SLang_Num_Function_Args == 1)
+ {
+	time_t t = time(NULL);
+	if (-1 == call_localtime (t, &tms))
+	 return;
+	if (-1 == validate_tm (&tms))
+	 return;
+ }
+ else if (-1 == pop_tm_struct (&tms))
+ return;
+
+ if (-1 == SLang_pop_slstring (&fmt))
+ return;
+
+ /* Ugh. The man page says:
+ *
+ * The strftime() function returns the number of characters placed in the
+ * array s, not including the terminating NUL character, provided the
+ * string, including the terminating NUL, fits. Otherwise, it returns 0,
+ * and the contents of the array is undefined. (Thus at least since libc
+ * 4.4.4; very old versions of libc, such as libc 4.4.1, would return max
+ * if the array was too small.)
+ *
+ * Note that the return value 0 does not necessarily indicate an error;
+ * for example, in many locales %p yields an empty string.
+ *
+ * Was this too designed by committee?
+ */
+ status = strftime (buf, sizeof(buf), fmt, &tms);
+ if (status == 0)
+ buf0 = 0;
+ bufsizeof(buf)-1 = 0;
+ (void) SLang_push_string (buf);
+ SLang_free_slstring (fmt);
+}
+#if defined(__GNUC__)
+# pragma GCC diagnostic warning "-Wformat-nonliteral"
+#endif
+
+static SLang_Intrin_Fun_Type Time_Funs_Table =
+{
+ MAKE_INTRINSIC_0("ctime", ctime_cmd, SLANG_STRING_TYPE),
+ MAKE_INTRINSIC_0("sleep", sleep_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_time", _time_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("time", SLcurrent_time_string, SLANG_STRING_TYPE),
+ MAKE_INTRINSIC_0("localtime", localtime_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("gmtime", gmtime_cmd, SLANG_VOID_TYPE),
+#ifdef HAVE_GMTIME
+ MAKE_INTRINSIC_0("timegm", timegm_cmd, SLANG_VOID_TYPE),
+#endif
+#ifdef HAVE_MKTIME
+ MAKE_INTRINSIC_0("mktime", mktime_cmd, SLANG_VOID_TYPE),
+#endif
+ MAKE_INTRINSIC_0("strftime", strftime_cmd, SLANG_VOID_TYPE),
+#ifdef HAVE_TIMES
+ MAKE_INTRINSIC_0("times", times_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_tic", _tic_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("_toc", _toc_cmd, SLANG_DOUBLE_TYPE),
+#endif
+ MAKE_INTRINSIC_0("tic", tic_cmd, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("toc", toc_cmd, SLANG_DOUBLE_TYPE),
+#if SLANG_HAS_FLOAT
+ MAKE_INTRINSIC_0("_ftime", _ftime_cmd, SLANG_DOUBLE_TYPE),
+#endif
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+int _pSLang_init_sltime (void)
+{
+ if (sizeof (time_t) > sizeof(_sltime_t))
+ {
+	SLang_exit_error ("S-Lang library not built properly. Fix _sltime_t in sltime.c");
+ }
+#ifdef HAVE_TIMES
+ (void) tic_cmd ();
+#endif
+ return SLadd_intrin_fun_table (Time_Funs_Table, NULL);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/sltoken.c Added

@@ -0,0 +1,2525 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include "slang.h"
+#include "_slang.h"
+
+#define MAX_FILE_LINE_LEN (SL_MAX_TOKEN_LEN + 2)
+
+/* int _pSLang_Compile_Line_Num_Info; */
+#if SLANG_HAS_BOSEOS
+int _pSLang_Compile_BOSEOS;
+int _pSLang_Compile_BOFEOF;
+#endif
+#if SLANG_HAS_DEBUG_CODE
+/* static int Default_Compile_Line_Num_Info; */
+#if 0
+static int Default_Compile_BOSEOS;
+#endif
+#endif
+
+static char Empty_Line1 = {0};
+
+static char *Input_Line = Empty_Line;
+static char *Input_Line_Pointer;
+
+static SLprep_Type *This_SLpp;
+
+static SLang_Load_Type *LLT;
+
+static int next_input_line (void)
+{
+ LLT->line_num++;
+ Input_Line_Pointer = Input_Line = LLT->read(LLT);
+ if ((NULL == Input_Line) || _pSLang_Error)
+ {
+	Input_Line_Pointer = Input_Line = NULL;
+	return -1;
+ }
+ return 0;
+}
+
+static void free_slstring_token_val (_pSLang_Token_Type *tok)
+{
+ SLCONST char *s = tok->v.s_val;
+ if (s != NULL)
+ {
+	_pSLfree_hashed_string (s, strlen(s), tok->hash);
+	tok->v.s_val = NULL;
+ }
+}
+static void free_static_sval_token (_pSLang_Token_Type *tok)
+{
+ tok->v.s_val = NULL;
+}
+
+_pSLtok_Type _pSLtoken_init_slstring_token (_pSLang_Token_Type *tok, _pSLtok_Type type,
+					 SLCONST char *s, SLstrlen_Type len)
+{
+ char *sval;
+ if (NULL == (sval = _pSLstring_make_hashed_string (s, len, &tok->hash)))
+ return tok->type = EOF_TOKEN;
+
+ tok->v.s_val = sval;
+ tok->free_val_func = free_slstring_token_val;
+ return tok->type = type;
+}
+
+static void free_bstring_token_val (_pSLang_Token_Type *tok)
+{
+ if (tok->v.b_val != NULL)
+ {
+	SLbstring_free (tok->v.b_val);
+	tok->v.b_val = NULL;
+ }
+}
+
+static _pSLtok_Type init_bstring_token (_pSLang_Token_Type *tok,
+					unsigned char *s, unsigned int len)
+{
+ if (NULL == (tok->v.b_val = SLbstring_create (s, len)))
+ return tok->type = EOF_TOKEN;
+
+ tok->free_val_func = free_bstring_token_val;
+ return tok->type = BSTRING_TOKEN;
+}
+
+/* In this table, if a single character can represent an operator, e.g.,
+ * '&' (BAND_TOKEN), then it must be placed before multiple-character
+ * operators that begin with the same character, e.g., "&=". See
+ * get_op_token to see how this is exploited.
+ */
+#define NUM_OPERATOR_TABLE_ROWS 31
+typedef struct
+{
+ char opstring4;
+ _pSLtok_Type type;
+}
+Operator_Table_Entry_Type;
+static SLCONST Operator_Table_Entry_Type OperatorsNUM_OPERATOR_TABLE_ROWS =
+{
+#define OFS_EXCL	0
+ {"!=",	NE_TOKEN},
+#define OFS_POUND	1
+ {"#",	POUND_TOKEN},
+#define OFS_BAND	2
+ {"&",	BAND_TOKEN},
+ {"&&",	SC_AND_TOKEN},
+ {"&=",	BANDEQS_TOKEN},
+#define OFS_STAR	5
+ {"*",	TIMES_TOKEN},
+ {"*=",	TIMESEQS_TOKEN},
+#define OFS_PLUS	7
+ {"+",	ADD_TOKEN},
+ {"++",	PLUSPLUS_TOKEN},
+ {"+=",	PLUSEQS_TOKEN},
+#define OFS_MINUS	10
+ {"-",	SUB_TOKEN},
+ {"--",	MINUSMINUS_TOKEN},
+ {"-=",	MINUSEQS_TOKEN},
+ {"->",	NAMESPACE_TOKEN},
+#define OFS_DIV		14
+ {"/",	DIV_TOKEN},
+ {"/=",	DIVEQS_TOKEN},
+#define OFS_LT		16
+ {"<",	LT_TOKEN},
+ {"<<",	SHL_TOKEN},
+ {"<=",	LE_TOKEN},
+#define OFS_EQS		19
+ {"=",	ASSIGN_TOKEN},
+ {"==",	EQ_TOKEN},
+#define OFS_GT		21
+ {">",	GT_TOKEN},
+ {">=",	GE_TOKEN},
+ {">>",	SHR_TOKEN},
+#define OFS_AT		24
+ {"@",	DEREF_TOKEN},
+#define OFS_POW		25
+ {"^",	POW_TOKEN},
+#define OFS_BOR		26
+ {"|",	BOR_TOKEN},
+ {"||",	SC_OR_TOKEN},
+ {"|=",	BOREQS_TOKEN},
+#define OFS_BNOT	29
+ {"~",	BNOT_TOKEN},
+ {"",	EOF_TOKEN}
+};
+
+static SLCONST char *lookup_op_token_string (_pSLtok_Type type)
+{
+ SLCONST Operator_Table_Entry_Type *op, *opmax;
+
+ op = Operators;
+ opmax = op + NUM_OPERATOR_TABLE_ROWS;
+
+ while (op < opmax)
+ {
+	if (op->type == type)
+	 return op->opstring;
+	op++;
+ }
+ return NULL;
+}
+
+static SLCONST char *map_token_to_string (_pSLang_Token_Type *tok)
+{
+ SLCONST char *s;
+ static char numbuf 32;
+ _pSLtok_Type type;
+ s = NULL;
+
+ if (tok != NULL) type = tok->type;
+ else type = 0;
+
+ switch (type)
+ {
+ case 0:
+	s = "??";
+	break;
+
+ case EOF_TOKEN:
+	s = "End of input";
+	break;
+
+ case CHAR_TOKEN:
+ case SHORT_TOKEN:
+ case INT_TOKEN:
+ case LONG_TOKEN:
+	sprintf (numbuf, "%ld", tok->v.long_val);
+	s = numbuf;
+	break;
+
+ case UCHAR_TOKEN:
+ case USHORT_TOKEN:
+ case UINT_TOKEN:
+ case ULONG_TOKEN:
+	sprintf (numbuf, "%lu", (unsigned long)tok->v.long_val);
+	s = numbuf;
+	break;
+
+#ifdef HAVE_LONG_LONG
+ case LLONG_TOKEN:
+	sprintf (numbuf, SLFMT_LLD, tok->v.llong_val);
+	s = numbuf;
+	break;
+
+ case ULLONG_TOKEN:
+	sprintf (numbuf, SLFMT_LLU, tok->v.ullong_val);
+	s = numbuf;
+	break;
+#endif
+
+ case OBRACKET_TOKEN: s = ""; break;
+ case CBRACKET_TOKEN: s = ""; break;
+ case OPAREN_TOKEN: s = "("; break;
+ case CPAREN_TOKEN: s = ")"; break;
+ case OBRACE_TOKEN: s = "{"; break;
+ case CBRACE_TOKEN: s = "}"; break;
+ case AND_TOKEN: s = "and"; break;
+ case OR_TOKEN: s = "or"; break;
+ case MOD_TOKEN: s = "mod"; break;
+ case SHL_TOKEN: s = "shl"; break;
+ case SHR_TOKEN: s = "shr"; break;
+ case BXOR_TOKEN: s = "xor"; break;
+ case COMMA_TOKEN: s = ","; break;
+ case SEMICOLON_TOKEN: s = ";"; break;
+ case COLON_TOKEN: s = ":"; break;
+ case QUESTION_TOKEN: s = "?"; break;
+
+ case ARRAY_TOKEN: s = ""; break;
+ case DOT_TOKEN: s = "."; break;
+
+ case MULTI_STRING_TOKEN:
+	if (tok->v.multistring_val != NULL)
+	 {
+	 _pSLang_Multiline_String_Type *m = tok->v.multistring_val;
+	 if ((m->type == STRING_TOKEN) || (m->type == STRING_DOLLAR_TOKEN))
+	 s = m->v.s_val;
+	 else
+	 s = "<binary string>";
+	 }
+	break;
+
+ case _BSTRING_TOKEN:
+ case BSTRING_TOKEN:
+ case ESC_BSTRING_TOKEN:
+	s = "<binary string>";
+	break;
+
+#if SLANG_HAS_FLOAT
+ case FLOAT_TOKEN:
+ case DOUBLE_TOKEN:
+ case COMPLEX_TOKEN:
+	/* drop */
+#endif
+ default:
+	 if (NULL != (s = lookup_op_token_string (type)))
+	 break;
+	if (((tok->free_val_func == free_slstring_token_val)
+	 || (tok->free_val_func == free_static_sval_token))
+	 && (tok->num_refs != 0))
+	 s = tok->v.s_val;
+	break;
+ }
+
+ if (s == NULL)
+ {
+	sprintf (numbuf, "(0x%02X)", type);
+	s = numbuf;
+ }
+
+ return s;
+}
+
+void _pSLparse_error (int errcode, SLCONST char *str, _pSLang_Token_Type *tok, int flag)
+{
+ int line = LLT->line_num;
+ SLFUTURE_CONST char *file = (char *) LLT->name;
+
+ if (str == NULL)
+ str = "Parse Error";
+
+#if SLANG_HAS_DEBUG_CODE
+ if ((tok != NULL) && (tok->line_number != -1))
+ line = tok->line_number;
+#endif
+ if (file == NULL) file = "??";
+
+ if (flag || (_pSLang_Error == 0))
+ _pSLang_verror (errcode, "%s:%d: %s: found '%s'",
+		 file, line, str, map_token_to_string (tok));
+
+ (void) _pSLerr_set_line_info (file, line, NULL);
+}
+
+#define ALPHA_CHAR 	1
+#define DIGIT_CHAR	2
+#define EXCL_CHAR 	3
+#define SEP_CHAR	4
+#define OP_CHAR		5
+#define DOT_CHAR	6
+#define BOLDOT_CHAR	7
+#define DQUOTE_CHAR	8
+#define QUOTE_CHAR	9
+#define COMMENT_CHAR	10
+#define NL_CHAR		11
+#define BAD_CHAR	12
+#define WHITE_CHAR	13
+#define BQUOTE_CHAR	15
+
+#define CHAR_EOF	255
+
+#define CHAR_CLASS(c)	(Char_Type_Table(c)0)
+#define CHAR_DATA(c)	(Char_Type_Table(c)1)
+
+static SLCONST unsigned char Char_Type_Table2562 =
+{
+ { NL_CHAR, 0 },	/* 0x0 */ { BAD_CHAR, 0 },	/* 0x1 */
+ { BAD_CHAR, 0 },	/* 0x2 */ { BAD_CHAR, 0 },	/* 0x3 */
+ { BAD_CHAR, 0 },	/* 0x4 */ { BAD_CHAR, 0 },	/* 0x5 */
+ { BAD_CHAR, 0 },	/* 0x6 */ { BAD_CHAR, 0 },	/* 0x7 */
+ { WHITE_CHAR, 0 },	/* 0x8 */ { WHITE_CHAR, 0 },	/* 0x9 */
+ { NL_CHAR, 0 },	/* \n */ { WHITE_CHAR, 0 },	/* 0xb */
+ { WHITE_CHAR, 0 },	/* 0xc */ { WHITE_CHAR, 0 },	/* \r */
+ { BAD_CHAR, 0 },	/* 0xe */ { BAD_CHAR, 0 },	/* 0xf */
+ { BAD_CHAR, 0 },	/* 0x10 */ { BAD_CHAR, 0 },	/* 0x11 */
+ { BAD_CHAR, 0 },	/* 0x12 */ { BAD_CHAR, 0 },	/* 0x13 */
+ { BAD_CHAR, 0 },	/* 0x14 */ { BAD_CHAR, 0 },	/* 0x15 */
+ { BAD_CHAR, 0 },	/* 0x16 */ { BAD_CHAR, 0 },	/* 0x17 */
+ { BAD_CHAR, 0 },	/* 0x18 */ { BAD_CHAR, 0 },	/* 0x19 */
+ { BAD_CHAR, 0 },	/* 0x1a */ { BAD_CHAR, 0 },	/* 0x1b */
+ { BAD_CHAR, 0 },	/* 0x1c */ { BAD_CHAR, 0 },	/* 0x1d */
+ { BAD_CHAR, 0 },	/* 0x1e */ { BAD_CHAR, 0 },	/* 0x1f */
+ { WHITE_CHAR, 0 },	/* 0x20 */ { EXCL_CHAR, OFS_EXCL },	/* ! */
+ { DQUOTE_CHAR, 0 },	/* " */	 { OP_CHAR, OFS_POUND },	/* # */
+ { ALPHA_CHAR, 0 },	/* $ */	 { NL_CHAR, 0 },/* % */
+ { OP_CHAR, OFS_BAND },	/* & */	 { QUOTE_CHAR, 0 },	/* ' */
+ { SEP_CHAR, OPAREN_TOKEN },	/* ( */	 { SEP_CHAR, CPAREN_TOKEN },	/* ) */
+ { OP_CHAR, OFS_STAR },	/* * */	 { OP_CHAR, OFS_PLUS},	/* + */
+ { SEP_CHAR, COMMA_TOKEN },	/* , */	 { OP_CHAR, OFS_MINUS },	/* - */
+ { DOT_CHAR, 0 },	/* . */	 { OP_CHAR, OFS_DIV },	/* / */
+ { DIGIT_CHAR, 0 },	/* 0 */	 { DIGIT_CHAR, 0 },	/* 1 */
+ { DIGIT_CHAR, 0 },	/* 2 */	 { DIGIT_CHAR, 0 },	/* 3 */
+ { DIGIT_CHAR, 0 },	/* 4 */	 { DIGIT_CHAR, 0 },	/* 5 */
+ { DIGIT_CHAR, 0 },	/* 6 */	 { DIGIT_CHAR, 0 },	/* 7 */
+ { DIGIT_CHAR, 0 },	/* 8 */	 { DIGIT_CHAR, 0 },	/* 9 */
+ { SEP_CHAR, COLON_TOKEN },	/* : */	 { SEP_CHAR, SEMICOLON_TOKEN },	/* ; */
+ { OP_CHAR, OFS_LT },	/* < */	 { OP_CHAR, OFS_EQS },	/* = */
+ { OP_CHAR, OFS_GT },	/* > */	 { SEP_CHAR, QUESTION_TOKEN},	/* ? */
+ { OP_CHAR, OFS_AT},	/* @ */	 { ALPHA_CHAR, 0 },	/* A */
+ { ALPHA_CHAR, 0 },	/* B */	 { ALPHA_CHAR, 0 },	/* C */
+ { ALPHA_CHAR, 0 },	/* D */	 { ALPHA_CHAR, 0 },	/* E */
+ { ALPHA_CHAR, 0 },	/* F */	 { ALPHA_CHAR, 0 },	/* G */
+ { ALPHA_CHAR, 0 },	/* H */	 { ALPHA_CHAR, 0 },	/* I */
+ { ALPHA_CHAR, 0 },	/* J */	 { ALPHA_CHAR, 0 },	/* K */
+ { ALPHA_CHAR, 0 },	/* L */	 { ALPHA_CHAR, 0 },	/* M */
+ { ALPHA_CHAR, 0 },	/* N */	 { ALPHA_CHAR, 0 },	/* O */
+ { ALPHA_CHAR, 0 },	/* P */	 { ALPHA_CHAR, 0 },	/* Q */
+ { ALPHA_CHAR, 0 },	/* R */	 { ALPHA_CHAR, 0 },	/* S */
+ { ALPHA_CHAR, 0 },	/* T */	 { ALPHA_CHAR, 0 },	/* U */
+ { ALPHA_CHAR, 0 },	/* V */	 { ALPHA_CHAR, 0 },	/* W */
+ { ALPHA_CHAR, 0 },	/* X */	 { ALPHA_CHAR, 0 },	/* Y */
+ { ALPHA_CHAR, 0 },	/* Z */	 { SEP_CHAR, OBRACKET_TOKEN },	/* */
+ { BAD_CHAR, 0 },	/* \ */	 { SEP_CHAR, CBRACKET_TOKEN },	/* */
+ { OP_CHAR, OFS_POW },	/* ^ */	 { ALPHA_CHAR, 0 },	/* _ */
+ { BQUOTE_CHAR, 0 },	/* ` */	 { ALPHA_CHAR, 0 },	/* a */
+ { ALPHA_CHAR, 0 },	/* b */	 { ALPHA_CHAR, 0 },	/* c */
+ { ALPHA_CHAR, 0 },	/* d */	 { ALPHA_CHAR, 0 },	/* e */
+ { ALPHA_CHAR, 0 },	/* f */	 { ALPHA_CHAR, 0 },	/* g */
+ { ALPHA_CHAR, 0 },	/* h */	 { ALPHA_CHAR, 0 },	/* i */
+ { ALPHA_CHAR, 0 },	/* j */	 { ALPHA_CHAR, 0 },	/* k */
+ { ALPHA_CHAR, 0 },	/* l */	 { ALPHA_CHAR, 0 },	/* m */
+ { ALPHA_CHAR, 0 },	/* n */	 { ALPHA_CHAR, 0 },	/* o */
+ { ALPHA_CHAR, 0 },	/* p */	 { ALPHA_CHAR, 0 },	/* q */
+ { ALPHA_CHAR, 0 },	/* r */	 { ALPHA_CHAR, 0 },	/* s */
+ { ALPHA_CHAR, 0 },	/* t */	 { ALPHA_CHAR, 0 },	/* u */
+ { ALPHA_CHAR, 0 },	/* v */	 { ALPHA_CHAR, 0 },	/* w */
+ { ALPHA_CHAR, 0 },	/* x */	 { ALPHA_CHAR, 0 },	/* y */
+ { ALPHA_CHAR, 0 },	/* z */	 { SEP_CHAR, OBRACE_TOKEN },	/* { */
+ { OP_CHAR, OFS_BOR },	/* | */	 { SEP_CHAR, CBRACE_TOKEN },	/* } */
+ { OP_CHAR, OFS_BNOT },	/* ~ */	 { BAD_CHAR, 0 },	/* 0x7f */
+
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/*   */	 { ALPHA_CHAR, 0 },	/* ¡ */
+ { ALPHA_CHAR, 0 },	/* ¢ */	 { ALPHA_CHAR, 0 },	/* £ */
+ { ALPHA_CHAR, 0 },	/* ¤ */	 { ALPHA_CHAR, 0 },	/* ¥ */
+ { ALPHA_CHAR, 0 },	/* ¦ */	 { ALPHA_CHAR, 0 },	/* § */
+ { ALPHA_CHAR, 0 },	/* ¨ */	 { ALPHA_CHAR, 0 },	/* © */
+ { ALPHA_CHAR, 0 },	/* ª */	 { ALPHA_CHAR, 0 },	/* « */
+ { ALPHA_CHAR, 0 },	/* ¬ */	 { ALPHA_CHAR, 0 },	/* */
+ { ALPHA_CHAR, 0 },	/* ® */	 { ALPHA_CHAR, 0 },	/* ¯ */
+ { ALPHA_CHAR, 0 },	/* ° */	 { ALPHA_CHAR, 0 },	/* ± */
+ { ALPHA_CHAR, 0 },	/* ² */	 { ALPHA_CHAR, 0 },	/* ³ */
+ { ALPHA_CHAR, 0 },	/* ´ */	 { ALPHA_CHAR, 0 },	/* µ */
+ { ALPHA_CHAR, 0 },	/* ¶ */	 { ALPHA_CHAR, 0 },	/* · */
+ { ALPHA_CHAR, 0 },	/* ¸ */	 { ALPHA_CHAR, 0 },	/* ¹ */
+ { ALPHA_CHAR, 0 },	/* º */	 { ALPHA_CHAR, 0 },	/* » */
+ { ALPHA_CHAR, 0 },	/* ¼ */	 { ALPHA_CHAR, 0 },	/* ½ */
+ { ALPHA_CHAR, 0 },	/* ¾ */	 { ALPHA_CHAR, 0 },	/* ¿ */
+ { ALPHA_CHAR, 0 },	/* À */	 { ALPHA_CHAR, 0 },	/* Á */
+ { ALPHA_CHAR, 0 },	/* Â */	 { ALPHA_CHAR, 0 },	/* Ã */
+ { ALPHA_CHAR, 0 },	/* Ä */	 { ALPHA_CHAR, 0 },	/* Å */
+ { ALPHA_CHAR, 0 },	/* Æ */	 { ALPHA_CHAR, 0 },	/* Ç */
+ { ALPHA_CHAR, 0 },	/* È */	 { ALPHA_CHAR, 0 },	/* É */
+ { ALPHA_CHAR, 0 },	/* Ê */	 { ALPHA_CHAR, 0 },	/* Ë */
+ { ALPHA_CHAR, 0 },	/* Ì */	 { ALPHA_CHAR, 0 },	/* Í */
+ { ALPHA_CHAR, 0 },	/* Î */	 { ALPHA_CHAR, 0 },	/* Ï */
+ { ALPHA_CHAR, 0 },	/* Ð */	 { ALPHA_CHAR, 0 },	/* Ñ */
+ { ALPHA_CHAR, 0 },	/* Ò */	 { ALPHA_CHAR, 0 },	/* Ó */
+ { ALPHA_CHAR, 0 },	/* Ô */	 { ALPHA_CHAR, 0 },	/* Õ */
+ { ALPHA_CHAR, 0 },	/* Ö */	 { ALPHA_CHAR, 0 },	/* × */
+ { ALPHA_CHAR, 0 },	/* Ø */	 { ALPHA_CHAR, 0 },	/* Ù */
+ { ALPHA_CHAR, 0 },	/* Ú */	 { ALPHA_CHAR, 0 },	/* Û */
+ { ALPHA_CHAR, 0 },	/* Ü */	 { ALPHA_CHAR, 0 },	/* Ý */
+ { ALPHA_CHAR, 0 },	/* Þ */	 { ALPHA_CHAR, 0 },	/* ß */
+ { ALPHA_CHAR, 0 },	/* à */	 { ALPHA_CHAR, 0 },	/* á */
+ { ALPHA_CHAR, 0 },	/* â */	 { ALPHA_CHAR, 0 },	/* ã */
+ { ALPHA_CHAR, 0 },	/* ä */	 { ALPHA_CHAR, 0 },	/* å */
+ { ALPHA_CHAR, 0 },	/* æ */	 { ALPHA_CHAR, 0 },	/* ç */
+ { ALPHA_CHAR, 0 },	/* è */	 { ALPHA_CHAR, 0 },	/* é */
+ { ALPHA_CHAR, 0 },	/* ê */	 { ALPHA_CHAR, 0 },	/* ë */
+ { ALPHA_CHAR, 0 },	/* ì */	 { ALPHA_CHAR, 0 },	/* í */
+ { ALPHA_CHAR, 0 },	/* î */	 { ALPHA_CHAR, 0 },	/* ï */
+ { ALPHA_CHAR, 0 },	/* ð */	 { ALPHA_CHAR, 0 },	/* ñ */
+ { ALPHA_CHAR, 0 },	/* ò */	 { ALPHA_CHAR, 0 },	/* ó */
+ { ALPHA_CHAR, 0 },	/* ô */	 { ALPHA_CHAR, 0 },	/* õ */
+ { ALPHA_CHAR, 0 },	/* ö */	 { ALPHA_CHAR, 0 },	/* ÷ */
+ { ALPHA_CHAR, 0 },	/* ø */	 { ALPHA_CHAR, 0 },	/* ù */
+ { ALPHA_CHAR, 0 },	/* ú */	 { ALPHA_CHAR, 0 },	/* û */
+ { ALPHA_CHAR, 0 },	/* ü */	 { ALPHA_CHAR, 0 },	/* ý */
+ { ALPHA_CHAR, 0 },	/* þ */	 { ALPHA_CHAR, 0 },	/* ÿ */
+};
+
+int _pSLcheck_identifier_syntax (SLCONST char *name)
+{
+ unsigned char *p;
+
+ p = (unsigned char *) name;
+ if (ALPHA_CHAR == Char_Type_Table*p0) while (1)
+ {
+	unsigned ch;
+	unsigned char type;
+
+	ch = *++p;
+
+	type = Char_Type_Table ch0;
+	if ((type != ALPHA_CHAR) && (type != DIGIT_CHAR))
+	 {
+	 if (ch == 0)
+	 return 0;
+	 break;
+	 }
+ }
+
+ _pSLang_verror (SL_SYNTAX_ERROR,
+		 "Identifier, namespace or structure field name '%s' contains an illegal character", name);
+ return -1;
+}
+
+static unsigned char prep_get_char (void)
+{
+ register unsigned char ch;
+
+ if (0 != (ch = *Input_Line_Pointer++))
+ return ch;
+
+ Input_Line_Pointer--;
+ return 0;
+}
+
+static void unget_prep_char (unsigned char ch)
+{
+ if ((Input_Line_Pointer != Input_Line)
+ && (ch != 0))
+ Input_Line_Pointer--;
+ /* *Input_Line_Pointer = ch; -- Do not modify the Input_Line */
+}
+
+#include "keywhash.c"
+
+static int get_ident_token (_pSLang_Token_Type *tok, unsigned char *s, unsigned int len)
+{
+ unsigned char ch;
+ unsigned char type;
+ Keyword_Table_Type *table;
+
+ while (1)
+ {
+	ch = prep_get_char ();
+	type = CHAR_CLASS (ch);
+	if ((type != ALPHA_CHAR) && (type != DIGIT_CHAR))
+	 {
+	 unget_prep_char (ch);
+	 break;
+	 }
+	if (len == (SL_MAX_TOKEN_LEN - 1))
+	 {
+	 _pSLparse_error (SL_BUILTIN_LIMIT_EXCEEDED, "Identifier length exceeded maximum supported value", NULL, 0);
+	 return tok->type = EOF_TOKEN;
+	 }
+	s len++ = ch;
+ }
+
+ slen = 0;
+
+ /* check if keyword */
+ table = is_keyword ((char *) s, len);
+ if (table != NULL)
+ {
+	tok->v.s_val = table->name;
+	tok->free_val_func = free_static_sval_token;
+	tok->flags |= SLTOKEN_VALUE_IS_RESERVED;
+	return (tok->type = table->type);
+ }
+
+ return _pSLtoken_init_slstring_token (tok, IDENT_TOKEN, (char *) s, len);
+}
+
+#define LONG_MASK (~(long)(unsigned long)-1) /* 0 */
+#define INT_MASK (~(long)(unsigned int)-1)
+#define SHORT_MASK (~(long)(unsigned short)-1)
+#define CHAR_MASK (~(long)(unsigned char)-1)
+
+static int str_to_signed_constant (unsigned char *s, SLtype stype, _pSLtok_Type ttype, long mask,
+				 _pSLang_Token_Type *tok)
+{
+ long lval = SLatol (s);
+
+ if (lval & mask)
+ {
+	SLang_verror (SL_SYNTAX_ERROR, "Literal integer constant is too large for %s", SLclass_get_datatype_name(stype));
+	return tok->type = EOF_TOKEN;
+ }
+
+ (void) stype;
+ tok->flags |= SLTOKEN_TYPE_INTEGER;
+ tok->v.long_val = lval;
+ return tok->type = ttype;
+}
+
+static int str_to_unsigned_constant (unsigned char *s, SLtype stype, _pSLtok_Type ttype, long mask,
+				 _pSLang_Token_Type *tok)
+{
+ unsigned long lval = SLatoul (s);
+
+ if (lval & mask)
+ {
+	SLang_verror (SL_SYNTAX_ERROR, "Literal integer constant is too large for %s", SLclass_get_datatype_name(stype));
+	return tok->type = EOF_TOKEN;
+ }
+
+ (void) stype;
+ tok->flags |= SLTOKEN_TYPE_INTEGER;
+ tok->v.long_val = (long) lval;
+ return tok->type = ttype;
+}
+
+static int get_number_token (_pSLang_Token_Type *tok, unsigned char *s, unsigned int len)
+{
+ unsigned char ch;
+ unsigned char type;
+ int tok_flags = 0;
+ int status;
+
+ /* Look for pattern 0-9.xXb*(eE-+?digits)?ijfhul? */
+ while (1)
+ {
+	ch = prep_get_char ();
+
+	type = CHAR_CLASS (ch);
+	if ((type != DIGIT_CHAR) && (type != DOT_CHAR))
+	 {
+	 if ((ch == 'x') || (ch == 'X'))
+	 tok_flags = SLTOKEN_IS_HEX;
+	 else if ((ch == 'b') || (ch == 'B'))
+	 tok_flags = SLTOKEN_IS_BINARY;
+	 else
+	 break;
+
+	 do
+	 {
+		 if (len == (SL_MAX_TOKEN_LEN - 1))
+		 goto too_long_return_error;
+
+		 slen++ = ch;
+		 ch = prep_get_char ();
+		 type = CHAR_CLASS (ch);
+	 }
+	 while ((type == DIGIT_CHAR) || (type == ALPHA_CHAR));
+	 break;
+	 }
+	if (len == (SL_MAX_TOKEN_LEN - 1))
+	 goto too_long_return_error;
+	slen++ = ch;
+ }
+
+ /* At this point, type and ch are synchronized */
+
+ if ((ch == 'e') || (ch == 'E'))
+ {
+	if (len == (SL_MAX_TOKEN_LEN - 1))
+	 goto too_long_return_error;
+	slen++ = ch;
+	ch = prep_get_char ();
+	if ((ch == '+') || (ch == '-'))
+	 {
+	 if (len == (SL_MAX_TOKEN_LEN - 1))
+	 goto too_long_return_error;
+	 slen++ = ch;
+	 ch = prep_get_char ();
+	 }
+
+	while (DIGIT_CHAR == (type = CHAR_CLASS(ch)))
+	 {
+	 if (len == (SL_MAX_TOKEN_LEN - 1))
+	 goto too_long_return_error;
+	 slen++ = ch;
+	 ch = prep_get_char ();
+	 }
+ }
+ tok->flags |= tok_flags;
+
+ while (ALPHA_CHAR == type)
+ {
+	if (len == (SL_MAX_TOKEN_LEN - 1))
+	 goto too_long_return_error;
+	slen++ = ch;
+	ch = prep_get_char ();
+	type = CHAR_CLASS(ch);
+ }
+
+ unget_prep_char (ch);
+ slen = 0;
+
+ switch (SLang_guess_type ((char *) s))
+ {
+ default:
+	tok->v.s_val = (char *) s;
+	_pSLparse_error (SL_TYPE_MISMATCH, "Not a number", tok, 0);
+	return (tok->type = EOF_TOKEN);
+
+#if SLANG_HAS_FLOAT
+ case SLANG_FLOAT_TYPE:
+	status = _pSLtoken_init_slstring_token (tok, FLOAT_TOKEN, (char *)s, len);
+	if (status == FLOAT_TOKEN)
+	 tok->flags |= SLTOKEN_TYPE_FLOAT;
+	return status;
+
+ case SLANG_DOUBLE_TYPE:
+	status = _pSLtoken_init_slstring_token (tok, DOUBLE_TOKEN, (char *)s, len);
+	if (status == DOUBLE_TOKEN)
+	 tok->flags |= SLTOKEN_TYPE_FLOAT;
+	return status;
+#endif
+#if SLANG_HAS_COMPLEX
+ case SLANG_COMPLEX_TYPE:
+	status = _pSLtoken_init_slstring_token (tok, COMPLEX_TOKEN, (char *)s, len);
+	if (status == COMPLEX_TOKEN)
+	 tok->flags |= SLTOKEN_TYPE_FLOAT;
+	return status;
+#endif
+ case SLANG_CHAR_TYPE:
+	return str_to_signed_constant (s, SLANG_CHAR_TYPE, CHAR_TOKEN, CHAR_MASK, tok);
+
+ case SLANG_UCHAR_TYPE:
+	return str_to_unsigned_constant (s, SLANG_UCHAR_TYPE, UCHAR_TOKEN, CHAR_MASK, tok);
+
+ case SLANG_SHORT_TYPE:
+	return str_to_signed_constant (s, SLANG_SHORT_TYPE, SHORT_TOKEN, SHORT_MASK, tok);
+
+ case SLANG_USHORT_TYPE:
+	return str_to_unsigned_constant (s, SLANG_USHORT_TYPE, USHORT_TOKEN, SHORT_MASK, tok);
+
+ case SLANG_INT_TYPE:
+	return str_to_signed_constant (s, SLANG_INT_TYPE, INT_TOKEN, INT_MASK, tok);
+
+ case SLANG_UINT_TYPE:
+	return str_to_unsigned_constant (s, SLANG_UINT_TYPE, UINT_TOKEN, INT_MASK, tok);
+
+ case SLANG_LONG_TYPE:
+	return str_to_signed_constant (s, SLANG_LONG_TYPE, LONG_TOKEN, LONG_MASK, tok);
+
+ case SLANG_ULONG_TYPE:
+	return str_to_unsigned_constant (s, SLANG_ULONG_TYPE, ULONG_TOKEN, LONG_MASK, tok);
+
+#ifdef HAVE_LONG_LONG
+ case SLANG_LLONG_TYPE:
+	tok->v.llong_val = SLatoll (s);
+	tok->flags |= SLTOKEN_TYPE_INTEGER;
+	return tok->type = LLONG_TOKEN;
+ case SLANG_ULLONG_TYPE:
+	tok->flags |= SLTOKEN_TYPE_INTEGER;
+	tok->v.ullong_val = SLatoull (s);
+	return tok->type = ULLONG_TOKEN;
+#endif
+ }
+
+ too_long_return_error:
+ _pSLparse_error (SL_BUILTIN_LIMIT_EXCEEDED, "Number too long for buffer", NULL, 0);
+ return (tok->type = EOF_TOKEN);
+}
+
+static int get_op_token (_pSLang_Token_Type *tok, char ch)
+{
+ unsigned int offset;
+ char second_char;
+ _pSLtok_Type type;
+ SLCONST char *name;
+ SLCONST Operator_Table_Entry_Type *op;
+
+ /* operators are: + - / * ++ -- += -= = == != > < >= <= | etc..
+ * These lex to the longest valid operator token.
+ */
+
+ offset = CHAR_DATA((unsigned char) ch);
+ op = Operators + offset;
+ if (0 == op->opstring1)
+ {
+	name = op->opstring;
+	type = op->type;
+ }
+ else
+ {
+	type = EOF_TOKEN;
+	name = NULL;
+ }
+
+ second_char = prep_get_char ();
+ do
+ {
+	if (second_char == op->opstring1)
+	 {
+	 name = op->opstring;
+	 type = op->type;
+	 break;
+	 }
+	op++;
+ }
+ while (ch == op->opstring0);
+
+ tok->type = type;
+
+ if (type == EOF_TOKEN)
+ {
+	_pSLparse_error (SL_NOT_IMPLEMENTED, "Operator not supported", NULL, 0);
+	return type;
+ }
+
+ tok->v.s_val = (char *)name;
+
+ if (name1 == 0)
+ unget_prep_char (second_char);
+
+ return type;
+}
+
+/* s and t may point to the same buffer --- even for unicode. This
+ * is because a wchar is denoted by (greater than) 4 characters \x{...}, which
+ * will expand to at most 6 bytes when UTF-8 encoded. That is:
+ * \x{F} expands to 1 byte
+ * \x{FF} expands to 2 bytes
+ * \x{FFF} expands to 3 bytes
+ * \x{FFFF} expands to 3 bytes
+ * \x{FFFFF} expands to 4 bytes
+ * \x{FFFFFF} expands to 5 bytes
+ * \x{7FFFFFF} expands to 6 bytes
+ *
+ * Also, consider octal, decimal, and hex forms:
+ *
+ * \200 (0x80)
+ * \d128
+ * \x80
+ *
+ * In all these cases, the escaped form uses 4 bytes. Hence, these forms also
+ * may be converted to UTF-8.
+ */
+/* If this returns non-zero, then it is a binary string */
+static int expand_escaped_string (register char *s,
+				 register char *t, register char *tmax,
+				 unsigned int *lenp, int is_binary)
+{
+ char *s0;
+ char ch;
+#if 0
+ int utf8_encode;
+
+ utf8_encode = (is_binary == 0) && _pSLinterp_UTF8_Mode;
+#endif
+ s0 = s;
+ while (t < tmax)
+ {
+	int isunicode;
+	SLwchar_Type wch;
+	char *s1;
+	ch = *t++;
+
+	if (ch != '\\')
+	 {
+	 if (ch == 0) is_binary = 1;
+	 *s++ = ch;
+	 continue;
+	 }
+
+	if ((t == tmax)		 /* \ at EOL */
+	 || (((t + 1) == tmax) && (*t == '\n'))) /* \ \n at EOL */
+	 break;
+
+	if (NULL == (t = _pSLexpand_escaped_char (t, tmax, &wch, &isunicode)))
+	 {
+	 is_binary = -1;
+	 break;
+	 }
+	if ((isunicode == 0)
+#if 0
+	 && ((wch < 127)
+		|| (utf8_encode == 0))
+#endif
+	 )
+	 {
+	 if (wch == 0)
+	 is_binary = 1;
+
+	 *s++ = (char) wch;
+	 continue;
+	 }
+	/* Escaped representation is always greater than encoded form.
+	 * So, 6 below is ok (although ugly).
+	 */
+	s1 = (char *) SLutf8_encode (wch, (SLuchar_Type *)s, 6);
+	if (s1 == NULL)
+	 {
+	 _pSLang_verror (SL_INVALID_UTF8, "Unable to UTF-8 encode 0x%lX\n", (unsigned long)wch);
+	 is_binary = -1;
+	 break;
+	 }
+	s = s1;
+ }
+ *s = 0;
+
+ *lenp = (unsigned char) (s - s0);
+ return is_binary;
+}
+
+#define STRING_SUFFIX_B		1
+#define STRING_SUFFIX_Q		2
+#define STRING_SUFFIX_R		4
+#define STRING_SUFFIX_S		8
+static int get_string_suffix (int *suffixp)
+{
+ int suffix = 0;
+
+ while (1)
+ {
+	unsigned char ch = prep_get_char ();
+	if (ch == 'B')
+	 {
+	 suffix |= STRING_SUFFIX_B;
+	 continue;
+	 }
+
+	if (ch == 'R')
+	 {
+	 suffix |= STRING_SUFFIX_R;
+	 continue;
+	 }
+
+	if (ch == 'Q')
+	 {
+	 suffix |= STRING_SUFFIX_Q;
+	 continue;
+	 }
+	if (ch == '$')
+	 {
+	 suffix |= STRING_SUFFIX_S;
+	 continue;
+	 }
+	unget_prep_char (ch);
+	break;
+ }
+
+ if ((suffix & STRING_SUFFIX_R) && (suffix & STRING_SUFFIX_Q))
+ {
+	_pSLparse_error (SL_SYNTAX_ERROR, "Conflicting suffix for string literal", NULL, 0);
+	return -1;
+ }
+
+ *suffixp = suffix;
+ return 0;
+}
+
+static int process_string_token (_pSLang_Token_Type *tok, unsigned char quote_char,
+				 unsigned char *s, unsigned int len,
+				 int has_backslash)
+{
+ SLwchar_Type wch;
+
+ if (('"' == quote_char) || (quote_char == '`'))
+ {
+	int suffix;
+	int is_binary;
+
+	if (-1 == get_string_suffix (&suffix))
+	 return tok->type = EOF_TOKEN;
+
+	if ((quote_char == '`') && (0 == (suffix & STRING_SUFFIX_Q)))
+	 suffix |= STRING_SUFFIX_R;
+
+	is_binary = (suffix & STRING_SUFFIX_B);
+	if (suffix & STRING_SUFFIX_R)
+	 has_backslash = 0;
+
+	if (has_backslash)
+	 is_binary = expand_escaped_string ((char *) s, (char *)s, (char *)s + len, &len, is_binary);
+
+	if (is_binary && (suffix & STRING_SUFFIX_S))
+	 {
+	 _pSLparse_error (SL_SYNTAX_ERROR, "A binary string is not permitted to have the $ suffix", NULL, 0);
+	 return tok->type = EOF_TOKEN;
+	 }
+
+	if (is_binary)
+	 return init_bstring_token (tok, s, len);
+	else
+	 {
+	 _pSLtok_Type t = (suffix & STRING_SUFFIX_S) ? STRING_DOLLAR_TOKEN : STRING_TOKEN;
+	 return _pSLtoken_init_slstring_token (tok, t, (char *) s, len);
+	 }
+ }
+
+ /* else single character */
+
+ if (has_backslash)
+ {
+	if ((s0 != '\\')
+	 || (NULL == (s = (unsigned char *)_pSLexpand_escaped_char ((char *)s+1, (char *)s+len, &wch, NULL)))
+	 || (*s != 0))
+	 {
+	 _pSLparse_error (SL_SYNTAX_ERROR, "Unable to parse character", NULL, 0);
+	 return (tok->type = EOF_TOKEN);
+	 }
+ }
+ else if (len == 1)
+ wch = s0;
+ else /* Assume unicode */
+ {
+	unsigned char *ss = SLutf8_decode (s, s+len, &wch, NULL);
+	if ((ss == NULL) || (*ss != 0))
+	 {
+	 _pSLparse_error(SL_SYNTAX_ERROR, "Single char expected", NULL, 0);
+	 return (tok->type = EOF_TOKEN);
+	 }
+ }
+ tok->v.long_val = wch;
+
+ if (wch > 256)
+ return tok->type = ULONG_TOKEN;
+
+ return (tok->type = UCHAR_TOKEN);
+}
+
+static int read_string_token (unsigned char quote_char,
+			 unsigned char *s, unsigned int maxlen,
+			 int is_multiline_raw,
+			 int *has_backslashp,
+			 unsigned int *lenp)
+{
+ unsigned int len = 0;
+ int has_bs = 0;
+ int is_continued = 0;
+
+ while (len < maxlen)
+ {
+	unsigned char ch = prep_get_char ();
+
+	if (ch == 0)
+	 ch = '\n';
+
+	if (ch == '\n')
+	 {
+	 if (is_multiline_raw)
+	 {
+		 slen++ = ch;
+		 is_continued = 1;
+		 break;
+	 }
+	 _pSLparse_error(SL_SYNTAX_ERROR, "Expecting a quote-character", NULL, 0);
+	 return -1;
+	 }
+
+	if (ch == quote_char)
+	 {
+	 if (is_multiline_raw == 0)
+	 break;
+
+	 /* For multi-line raw, double quotes make a single one */
+	 ch = prep_get_char ();
+	 if (ch == quote_char)
+	 {
+		 slen++ = ch;
+		 continue;
+	 }
+
+	 unget_prep_char (ch);
+	 break;
+	 }
+
+	if (ch == '\\')
+	 {
+	 if (is_multiline_raw)
+	 {
+		 slen++ = ch;
+		 has_bs = 1;
+		 continue;
+	 }
+
+	 ch = prep_get_char ();
+	 if ((ch == '\n') || (ch == 0))
+	 {
+		 is_continued = 1;
+		 break;
+	 }
+	 slen++ = '\\';
+	 if (len < maxlen)
+	 {
+		 slen++ = ch;
+		 has_bs = 1;
+	 }
+	 continue;
+	 }
+
+	slen++ = ch;
+ }
+
+ if (len == maxlen)
+ {
+	_pSLparse_error (SL_BUILTIN_LIMIT_EXCEEDED, "Literal string exceeds the maximum allowable size--- use concatenation", NULL, 0);
+	return -1;
+ }
+
+ slen = 0;
+ *lenp = len;
+ *has_backslashp = has_bs;
+ return is_continued;
+}
+
+static _pSLtoken_String_List_Type *alloc_string_list_type (unsigned char *buf, unsigned int len)
+{
+ _pSLtoken_String_List_Type *l;
+
+ if (NULL == (l = (_pSLtoken_String_List_Type *) SLmalloc (sizeof (_pSLtoken_String_List_Type) + len)))
+ return NULL;
+
+ l->next = NULL;
+ l->len = len;
+ memcpy ((char *) l->buf, (char *)buf, len);
+ return l;
+}
+
+static void free_string_list (_pSLtoken_String_List_Type *l)
+{
+ while (l != NULL)
+ {
+	_pSLtoken_String_List_Type *next = l->next;
+	SLfree ((char *) l);
+	l = next;
+ }
+}
+
+static void free_multistring_token_val (_pSLang_Token_Type *tok)
+{
+ _pSLang_Multiline_String_Type *m;
+
+ m = tok->v.multistring_val;
+ if (m == NULL)
+ return;
+
+ if ((m->type == STRING_TOKEN) || (m->type == STRING_DOLLAR_TOKEN))
+ {
+	_pSLfree_hashed_string (m->v.s_val, m->len, m->hash);
+ }
+ else if (m->type == BSTRING_TOKEN)
+ {
+	SLbstring_free (m->v.b_val);
+ }
+
+ free_string_list (m->list);
+ SLfree ((char *) m);
+
+ tok->v.multistring_val = NULL;
+}
+
+static _pSLang_Multiline_String_Type *
+ create_multistring (_pSLtoken_String_List_Type **rootp, _pSLtok_Type type)
+{
+ _pSLtoken_String_List_Type *root, *tail;
+ _pSLang_Multiline_String_Type *m;
+ char *buf;
+ unsigned int len, num;
+
+ m = (_pSLang_Multiline_String_Type *) SLmalloc (sizeof (_pSLang_Multiline_String_Type));
+ if (m == NULL)
+ return NULL;
+
+ len = 0;
+ num = 0;
+ tail = root = *rootp;
+ while (tail != NULL)
+ {
+	len += tail->len;
+	tail = tail->next;
+	num++;
+ }
+
+ if (NULL == (buf = (char *)SLmalloc (len+1)))
+ {
+	SLfree ((char *) m);
+	return NULL;
+ }
+
+ tail = root;
+ len = 0;
+ while (tail != NULL)
+ {
+	memcpy (buf+len, tail->buf, tail->len);
+	len += tail->len;
+	tail = tail->next;
+ }
+
+ m->num = num;
+ m->type = type;
+ if (type == BSTRING_TOKEN)
+ {
+	if (NULL == (m->v.b_val = SLbstring_create_malloced ((unsigned char *)buf, len, 0)))
+	 goto return_error;
+	buf = NULL;
+ }
+ else
+ {
+	m->v.s_val = _pSLstring_make_hashed_string (buf, len, &m->hash);
+	if (m->v.s_val == NULL)
+	 goto return_error;
+	SLfree (buf);
+ }
+ m->num = num;
+ m->list = root;
+ m->len = len;
+ *rootp = NULL;
+ return m;
+
+return_error:
+ if (buf != NULL) SLfree (buf);
+ SLfree ((char *) m);
+ return NULL;
+}
+
+static int get_string_token (_pSLang_Token_Type *tok, unsigned char quote_char,
+			 unsigned char *s, int is_multiline_raw)
+{
+ _pSLtoken_String_List_Type *root, *tail;
+ _pSLang_Multiline_String_Type *m;
+ unsigned int len;
+ int has_backslash;
+ int status;
+ unsigned int num_lines;
+ int suffix;
+ int is_binary;
+ _pSLtok_Type type;
+
+ status = read_string_token (quote_char, s, SL_MAX_TOKEN_LEN-1,
+			 is_multiline_raw, &has_backslash, &len);
+
+ if (status == -1)
+ return tok->type = EOF_TOKEN;
+
+ if (status == 0)
+ return process_string_token (tok, quote_char, s, len, has_backslash);
+
+ tail = root = alloc_string_list_type (s, len);
+ if (root == NULL)
+ return tok->type = EOF_TOKEN;
+
+ LLT->parse_level += 1;
+
+ num_lines = 1;
+ do
+ {
+	int has_bs;
+
+	if (-1 == next_input_line ())
+	 {
+	 _pSLparse_error (SL_SYNTAX_ERROR, "Multiline string literal is unterminated", NULL, 0);
+	 goto return_error;
+	 }
+
+	status = read_string_token (quote_char, s, SL_MAX_TOKEN_LEN-1,
+				 is_multiline_raw, &has_bs, &len);
+
+	if ((status == -1)
+	 || (NULL == (tail->next = alloc_string_list_type (s, len))))
+	 goto return_error;
+
+	has_backslash = has_backslash || has_bs;
+	tail = tail->next;
+	num_lines++;
+ }
+ while (status == 1);
+
+ /* At this point, root contains the list of strings */
+ if (-1 == get_string_suffix (&suffix))
+ goto return_error;
+
+ /* A multiline raw string is raw unless an explicit Q suffix was given */
+ if (is_multiline_raw
+ && (0 == (suffix & STRING_SUFFIX_Q)))
+ suffix |= STRING_SUFFIX_R;
+
+ is_binary = (suffix & STRING_SUFFIX_B);
+ if (suffix & STRING_SUFFIX_R)
+ has_backslash = 0;
+
+ if (has_backslash)
+ {
+	tail = root;
+	while (tail != NULL)
+	 {
+	 int ib;
+
+	 ib = expand_escaped_string (tail->buf, tail->buf,
+					 tail->buf+tail->len, &tail->len, is_binary);
+
+	 is_binary = is_binary || ib;
+
+	 if (is_binary && (suffix & STRING_SUFFIX_S))
+	 {
+		 _pSLparse_error (SL_SYNTAX_ERROR, "A binary string is not permitted to have the $ suffix", NULL, 0);
+		 goto return_error;
+	 }
+	 tail = tail->next;
+	 }
+ }
+
+ if (is_binary)
+ type = BSTRING_TOKEN;
+ else if (suffix & STRING_SUFFIX_S)
+ type = STRING_DOLLAR_TOKEN;
+ else
+ type = STRING_TOKEN;
+
+ if (NULL == (m = create_multistring (&root, type)))
+ goto return_error;
+
+ tok->v.multistring_val = m;
+ tok->free_val_func = free_multistring_token_val;
+
+ LLT->parse_level -= 1;
+ return tok->type = MULTI_STRING_TOKEN;
+
+return_error:
+
+ if (root != NULL)
+ free_string_list (root);
+
+ LLT->parse_level -= 1;
+ return tok->type = EOF_TOKEN;
+}
+
+static int extract_token (_pSLang_Token_Type *tok, unsigned char ch, unsigned char t)
+{
+ unsigned char s SL_MAX_TOKEN_LEN;
+ unsigned int slen;
+
+ s0 = (char) ch;
+ slen = 1;
+
+ switch (t)
+ {
+ case ALPHA_CHAR:
+	return get_ident_token (tok, s, slen);
+
+ case OP_CHAR:
+	return get_op_token (tok, ch);
+
+ case DIGIT_CHAR:
+	return get_number_token (tok, s, slen);
+
+ case EXCL_CHAR:
+	ch = prep_get_char ();
+	s slen++ = ch;
+	t = CHAR_CLASS(ch);
+	if (t == ALPHA_CHAR) return get_ident_token (tok, s, slen);
+	if (t == OP_CHAR)
+	 {
+	 unget_prep_char (ch);
+	 return get_op_token (tok, '!');
+	 }
+	_pSLparse_error(SL_SYNTAX_ERROR, "Misplaced !", NULL, 0);
+	return -1;
+
+ case DOT_CHAR:
+	ch = prep_get_char ();
+	if (DIGIT_CHAR == CHAR_CLASS(ch))
+	 {
+	 s slen++ = ch;
+	 return get_number_token (tok, s, slen);
+	 }
+	unget_prep_char (ch);
+	return (tok->type = DOT_TOKEN);
+
+ case SEP_CHAR:
+	return (tok->type = CHAR_DATA(ch));
+
+ case DQUOTE_CHAR:
+ case QUOTE_CHAR:
+	return get_string_token (tok, ch, s, 0);
+
+ case BQUOTE_CHAR:
+	return get_string_token (tok, ch, s, 1);
+
+ default:
+	_pSLparse_error(SL_SYNTAX_ERROR, "Invalid character", NULL, 0);
+	return (tok->type = EOF_TOKEN);
+ }
+}
+
+int _pSLget_rpn_token (_pSLang_Token_Type *tok)
+{
+ unsigned char ch;
+
+ tok->v.s_val = "??";
+ while ((ch = *Input_Line_Pointer) != 0)
+ {
+	unsigned char t;
+
+	Input_Line_Pointer++;
+	if (WHITE_CHAR == (t = CHAR_CLASS(ch)))
+	 continue;
+
+	if (NL_CHAR == t)
+	 break;
+
+	return extract_token (tok, ch, t);
+ }
+ Input_Line_Pointer = Empty_Line;
+ return EOF_TOKEN;
+}
+
+int _pSLget_token (_pSLang_Token_Type *tok)
+{
+ unsigned char ch;
+ unsigned char t;
+
+ tok->num_refs = 1;
+ tok->free_val_func = NULL;
+ tok->v.s_val = "??";
+ tok->flags = 0;
+#if SLANG_HAS_DEBUG_CODE
+ tok->line_number = LLT->line_num;
+#endif
+ if (_pSLang_Error || (Input_Line == NULL))
+ return (tok->type = EOF_TOKEN);
+
+ while (1)
+ {
+	ch = *Input_Line_Pointer++;
+	if (WHITE_CHAR == (t = CHAR_CLASS (ch)))
+	 continue;
+
+	if (t != NL_CHAR)
+	 return extract_token (tok, ch, t);
+
+	do
+	 {
+#if SLANG_HAS_DEBUG_CODE
+	 tok->line_number++;
+#endif
+	 if (-1 == next_input_line ())
+	 return tok->type = EOF_TOKEN;
+	 }
+	while (0 == SLprep_line_ok(Input_Line, This_SLpp));
+
+	if (*Input_Line_Pointer == '.')
+	 {
+	 Input_Line_Pointer++;
+	 return tok->type = RPN_TOKEN;
+	 }
+ }
+}
+
+static int prep_exists_function (SLprep_Type *pt, SLFUTURE_CONST char *line)
+{
+ char bufMAX_FILE_LINE_LEN+1, *b, *bmax;
+ unsigned char ch;
+ unsigned char comment;
+
+ (void) pt;
+ bmax = buf + (sizeof (buf) - 1);
+
+ comment = (unsigned char)'%';
+ while (1)
+ {
+	/* skip whitespace */
+	while ((ch = (unsigned char) *line),
+	 ch && (ch != '\n') && (ch <= ' '))
+	 line++;
+
+	if ((ch <= '\n')
+	 || (ch == comment)) break;
+
+	b = buf;
+	while ((ch = (unsigned char) *line) > ' ')
+	 {
+	 if (b < bmax) *b++ = (char) ch;
+	 line++;
+	 }
+	*b = 0;
+#if 0
+	if (SLang_is_defined (buf))
+	 return 1;
+#else
+	if (NULL != _pSLlocate_name (buf))
+	 return 1;
+#endif
+ }
+
+ return 0;
+}
+
+static int prep_eval_expr (SLprep_Type *pt, SLFUTURE_CONST char *expr)
+{
+ int ret;
+ SLCONST char *end;
+ void (*compile)(_pSLang_Token_Type *);
+ char *expr1;
+#if SLANG_HAS_BOSEOS
+ int boseos;
+#endif
+
+ (void) pt;
+ end = strchr (expr, '\n');
+ if (end == NULL)
+ end = expr + strlen (expr);
+ expr1 = SLmake_nstring (expr, (unsigned int) (end - expr));
+ if (expr1 == NULL)
+ return -1;
+
+ compile = _pSLcompile_ptr;
+ _pSLcompile_ptr = _pSLcompile;
+#if SLANG_HAS_BOSEOS
+ boseos = _pSLang_Compile_BOSEOS;
+ if (0 == (boseos & SLANG_BOSEOS_PREPROC))
+ _pSLang_Compile_BOSEOS = 0;
+#endif
+ if ((0 != SLns_load_string (expr1, _pSLang_cur_namespace_intrinsic ()))
+ || (-1 == SLang_pop_integer (&ret)))
+ ret = -1;
+ else
+ ret = (ret != 0);
+#if SLANG_HAS_BOSEOS
+ _pSLang_Compile_BOSEOS = boseos;
+#endif
+ _pSLcompile_ptr = compile;
+
+ SLfree (expr1);
+ return ret;
+}
+
+int SLang_load_object (SLang_Load_Type *x)
+{
+ SLprep_Type *this_pp;
+ SLprep_Type *save_this_pp;
+ SLang_Load_Type *save_llt;
+ char *save_input_line, *save_input_line_ptr;
+#if SLANG_HAS_DEBUG_CODE
+ /* int save_compile_line_num_info; */
+#endif
+#if SLANG_HAS_BOSEOS
+ int save_compile_boseos;
+ int save_compile_bofeof;
+#endif
+ int save_auto_declare_variables;
+
+ if (NULL == (this_pp = SLprep_new ()))
+ return -1;
+ (void) SLprep_set_exists_hook (this_pp, prep_exists_function);
+ (void) SLprep_set_eval_hook (this_pp, prep_eval_expr);
+
+ if (-1 == _pSLcompile_push_context (x))
+ {
+	SLprep_delete (this_pp);
+	return -1;
+ }
+
+#if SLANG_HAS_DEBUG_CODE
+ /* save_compile_line_num_info = _pSLang_Compile_Line_Num_Info; */
+#endif
+#if SLANG_HAS_BOSEOS
+ save_compile_boseos = _pSLang_Compile_BOSEOS;
+ save_compile_bofeof = _pSLang_Compile_BOFEOF;
+#endif
+ save_this_pp = This_SLpp;
+ save_input_line = Input_Line;
+ save_input_line_ptr = Input_Line_Pointer;
+ save_llt = LLT;
+ save_auto_declare_variables = _pSLang_Auto_Declare_Globals;
+
+ This_SLpp = this_pp;
+ Input_Line_Pointer = Input_Line = Empty_Line;
+ LLT = x;
+
+ /* x->line_num = 0; */ /* already set to 0 when allocated. */
+ x->parse_level = 0;
+ _pSLang_Auto_Declare_Globals = x->auto_declare_globals;
+
+#if SLANG_HAS_DEBUG_CODE
+ /* _pSLang_Compile_Line_Num_Info = Default_Compile_Line_Num_Info; */
+#endif
+#if SLANG_HAS_BOSEOS
+#if 0
+ /* Instead of setting this variable to 0, let it keep its current value.
+ * Suppose that the following evalfiles take place:
+ *
+ * A -> B1 --> C1 --> D1
+ * -> B2 --> C1 --> D2
+ *
+ * and that B1 sets _boseos_info to 1. Then C1 and D1 will get this value
+ * but B2 will not, since it will get rest to 0 when the routine has finished
+ * loading B1.
+ */
+ {
+	char *env = getenv ("SLANG_BOSEOS");
+	if (env != NULL)
+	 _pSLang_Compile_BOSEOS = atoi (env);
+	else
+	 _pSLang_Compile_BOSEOS = 0;
+ }
+#endif
+#endif
+ _pSLparse_start (x);
+ if (_pSLang_Error)
+ {
+ if (_pSLang_Error != SL_Usage_Error)
+	 (void) _pSLerr_set_line_info (x->name, x->line_num, NULL);
+	/* Doing this resets the state of the line_info object */
+	(void) _pSLerr_set_line_info (x->name, x->line_num, "");
+ }
+
+ _pSLang_Auto_Declare_Globals = save_auto_declare_variables;
+
+ (void) _pSLcompile_pop_context ();
+
+ Input_Line = save_input_line;
+ Input_Line_Pointer = save_input_line_ptr;
+ LLT = save_llt;
+ SLprep_delete (this_pp);
+ This_SLpp = save_this_pp;
+
+#if SLANG_HAS_DEBUG_CODE
+ /* _pSLang_Compile_Line_Num_Info = save_compile_line_num_info; */
+#endif
+#if SLANG_HAS_BOSEOS
+ _pSLang_Compile_BOSEOS = save_compile_boseos;
+ _pSLang_Compile_BOFEOF = save_compile_bofeof;
+#endif
+ if (_pSLang_Error) return -1;
+ return 0;
+}
+
+SLang_Load_Type *SLns_allocate_load_type (SLFUTURE_CONST char *name, SLFUTURE_CONST char *namespace_name)
+{
+ SLang_Load_Type *x;
+
+ if (NULL == (x = (SLang_Load_Type *)SLmalloc (sizeof (SLang_Load_Type))))
+ return NULL;
+ memset ((char *) x, 0, sizeof (SLang_Load_Type));
+
+ if (name == NULL) name = "";
+
+ if (NULL == (x->name = SLang_create_slstring (name)))
+ {
+	SLfree ((char *) x);
+	return NULL;
+ }
+
+ if (namespace_name != NULL)
+ {
+	if (NULL == (x->namespace_name = SLang_create_slstring (namespace_name)))
+	 {
+	 SLang_free_slstring ((char *) x->name);
+	 SLfree ((char *) x);
+	 return NULL;
+	 }
+ }
+
+ return x;
+}
+
+SLang_Load_Type *SLallocate_load_type (SLFUTURE_CONST char *name)
+{
+ return SLns_allocate_load_type (name, NULL);
+}
+
+void SLdeallocate_load_type (SLang_Load_Type *x)
+{
+ if (x != NULL)
+ {
+	SLang_free_slstring ((char *) x->name);
+	SLang_free_slstring ((char *) x->namespace_name);
+	SLfree ((char *) x);
+ }
+}
+
+typedef struct
+{
+ SLCONST char *string;
+ SLCONST char *ptr;
+}
+String_Client_Data_Type;
+
+static char *read_from_string (SLang_Load_Type *x)
+{
+ String_Client_Data_Type *data;
+ SLCONST char *s, *s1;
+ char ch;
+
+ data = (String_Client_Data_Type *)x->client_data;
+ s1 = s = data->ptr;
+
+ if (*s == 0)
+ return NULL;
+
+ while ((ch = *s) != 0)
+ {
+	s++;
+	if (ch == '\n')
+	 break;
+ }
+
+ data->ptr = s;
+ return (char *) s1;
+}
+
+int SLang_load_string (SLFUTURE_CONST char *string)
+{
+ return SLns_load_string (string, NULL);
+}
+
+int SLns_load_string (SLFUTURE_CONST char *string, SLFUTURE_CONST char *ns_name)
+{
+ SLang_Load_Type *x;
+ String_Client_Data_Type data;
+ int ret;
+
+ if (string == NULL)
+ return -1;
+
+ /* Grab a private copy in case loading modifies string */
+ if (NULL == (string = SLang_create_slstring (string)))
+ return -1;
+
+ /* To avoid creating a static data space for every string loaded,
+ * all string objects will be regarded as identical. So, identify
+ * all of them by ***string***
+ */
+ if (NULL == (x = SLns_allocate_load_type ("***string***", ns_name)))
+ {
+	SLang_free_slstring ((char *) string);
+	return -1;
+ }
+
+ x->client_data = (VOID_STAR) &data;
+ x->read = read_from_string;
+
+ data.ptr = data.string = string;
+ if ((-1 == (ret = SLang_load_object (x)))
+ && (SLang_Traceback & SL_TB_FULL))
+ _pSLerr_traceback_msg ("Traceback: called from eval: %s\n", string);
+
+ SLang_free_slstring ((char *)string);
+ SLdeallocate_load_type (x);
+ return ret;
+}
+
+typedef struct
+{
+ char *buf;
+ FILE *fp;
+}
+File_Client_Data_Type;
+
+char *SLang_User_Prompt = NULL;
+static char *read_from_file (SLang_Load_Type *x)
+{
+ FILE *fp;
+ File_Client_Data_Type *c;
+ char *buf;
+
+ c = (File_Client_Data_Type *)x->client_data;
+ fp = c->fp;
+
+ if ((fp == stdin) && (SLang_User_Prompt != NULL))
+ {
+	fputs (SLang_User_Prompt, stdout);
+	fflush (stdout);
+ }
+
+ buf = fgets (c->buf, MAX_FILE_LINE_LEN+1, c->fp);
+ if (buf != NULL)
+ {
+	size_t num;
+
+	num = strlen (buf);
+	if ((num == MAX_FILE_LINE_LEN)
+	 && (bufnum-1 != '\n'))
+	 {
+	 SLang_verror (SL_LimitExceeded_Error, "Line %u is too long or lacks a newline character", x->line_num);
+	 return NULL;
+	 }
+ }
+ return buf;
+}
+
+int _pSLang_Load_File_Verbose = 0;
+int SLang_load_file_verbose (int v)
+{
+ int v1 = _pSLang_Load_File_Verbose;
+ _pSLang_Load_File_Verbose = v;
+ return v1;
+}
+
+/* Note that file could be freed from Slang during run of this routine
+ * so get it and store it !! (e.g., autoloading)
+ */
+int (*SLang_Load_File_Hook) (SLFUTURE_CONST char *) = NULL;
+int (*SLns_Load_File_Hook) (SLFUTURE_CONST char *, SLFUTURE_CONST char *) = NULL;
+int SLang_load_file (SLFUTURE_CONST char *f)
+{
+ return SLns_load_file (f, NULL);
+}
+
+int SLns_load_file (SLFUTURE_CONST char *f, SLFUTURE_CONST char *ns_name)
+{
+ File_Client_Data_Type client_data;
+ SLang_Load_Type *x;
+ char *name, *buf;
+ FILE *fp;
+
+ if ((ns_name == NULL) && (NULL != SLang_Load_File_Hook))
+ return (*SLang_Load_File_Hook) (f);
+
+ if (SLns_Load_File_Hook != NULL)
+ return (*SLns_Load_File_Hook) (f, ns_name);
+
+ if (f == NULL)
+ name = SLang_create_slstring ("<stdin>");
+ else
+ name = _pSLpath_find_file (f, 1);
+
+ if (name == NULL)
+ return -1;
+
+ if (NULL == (x = SLns_allocate_load_type (name, ns_name)))
+ {
+	SLang_free_slstring (name);
+	return -1;
+ }
+
+ buf = NULL;
+
+ if (f != NULL)
+ {
+	fp = fopen (name, "r");
+	if (_pSLang_Load_File_Verbose & SLANG_LOAD_FILE_VERBOSE)
+	 {
+	 if ((ns_name != NULL)
+		 && (*ns_name != 0) && (0 != strcmp (ns_name, "Global")))
+	 SLang_vmessage ("Loading %s ns:%s", name, ns_name);
+	 else
+	 SLang_vmessage ("Loading %s", name);
+	 }
+ }
+ else
+ fp = stdin;
+
+ if (fp == NULL)
+ _pSLang_verror (SL_OBJ_NOPEN, "Unable to open %s", name);
+ else if (NULL != (buf = (char *)SLmalloc (MAX_FILE_LINE_LEN + 1)))
+ {
+	client_data.fp = fp;
+	client_data.buf = buf;
+	x->client_data = (VOID_STAR) &client_data;
+	x->read = read_from_file;
+
+	(void) SLang_load_object (x);
+ }
+
+ if ((fp != NULL) && (fp != stdin))
+ fclose (fp);
+
+ SLfree (buf);
+ SLang_free_slstring (name);
+ SLdeallocate_load_type (x);
+
+ if (_pSLang_Error)
+ return -1;
+
+ return 0;
+}
+
+/* In the byte-compiled file, a token is represented by N+3 bytes, where
+ * byte0 = TOKEN_TYPE;
+ * byte1 = len_lo
+ * byte2 = len_hi
+ * bytes3:N+3 = value
+ * and N = (len_lo - 32) | (len_hi-32) << 7.
+ * The maximumn value of N for this encoding is 28639.
+ */
+static char *check_byte_compiled_token (char *buf)
+{
+ unsigned int len_lo, len_hi, len;
+ char *input_buffer;
+ char *b;
+
+ input_buffer = Input_Line_Pointer;
+
+ len_lo = (unsigned char) *input_buffer++;
+ while ((len_lo == 0) || (len_lo == '\n'))
+ {
+	if (-1 == next_input_line ())
+	 goto return_error;
+	input_buffer = Input_Line_Pointer;
+	len_lo = (unsigned char) *input_buffer++;
+ }
+
+ len_hi = (unsigned char) *input_buffer++;
+ while ((len_hi == 0) || (len_hi == '\n'))
+ {
+	if (-1 == next_input_line ())
+	 goto return_error;
+	input_buffer = Input_Line_Pointer;
+	len_hi = (unsigned char) *input_buffer++;
+ }
+
+ if ((len_lo < 32) || (len_hi < 32)
+ || ((len = (len_lo - 32) | ((len_hi - 32) << 7)) >= SL_MAX_TOKEN_LEN))
+ goto return_error;
+
+ b = buf;
+ while (len)
+ {
+	char ch = *input_buffer++;
+	if ((ch == 0) || (ch == '\n'))
+	 {
+	 if (-1 == next_input_line ())
+	 goto return_error;
+
+	 input_buffer = Input_Line_Pointer;
+	 continue;
+	 }
+	*b++ = ch;
+	len--;
+ }
+ *b = 0;
+ Input_Line_Pointer = input_buffer;
+ return b;
+
+return_error:
+ _pSLang_verror (SL_INVALID_DATA_ERROR, "Byte compiled file appears corrupt");
+ return NULL;
+}
+
+static int compile_byte_compiled_multistring (char *buf)
+{
+ _pSLtok_Type type;
+ _pSLtoken_String_List_Type *root, *tail;
+ _pSLang_Multiline_String_Type *m;
+ _pSLang_Token_Type tok;
+
+ /* The caller read MULTI_STRING_TOKEN from the input stream. Concat the
+ * next N objects in the stream until another MULTI_STRING_TOKEN is seen.
+ */
+ type = 0;
+ tail = root = NULL;
+ while (1)
+ {
+	char *ebuf;
+	unsigned int len;
+	_pSLtok_Type this_type, last_type;
+	_pSLtoken_String_List_Type *next;
+	unsigned char ch = *Input_Line_Pointer++;
+
+	if ((ch == 0) || (ch == '\n'))
+	 {
+	 if (-1 == next_input_line ())
+	 return -1;
+	 continue;
+	 }
+	this_type = ch;
+
+	if (this_type == MULTI_STRING_TOKEN)
+	 break;
+
+	switch (this_type)
+	 {
+	 case STRING_TOKEN:
+	 case STRING_DOLLAR_TOKEN:
+	 if (NULL == (ebuf = check_byte_compiled_token (buf)))
+	 goto return_error;
+	 len = (unsigned int) (ebuf - buf);
+	 last_type = this_type;
+	 break;
+
+	 case ESC_STRING_TOKEN:
+	 if (NULL == (ebuf = check_byte_compiled_token (buf)))
+	 goto return_error;
+	 (void) expand_escaped_string (buf, buf, ebuf, &len, 0);
+	 last_type = STRING_TOKEN;
+	 break;
+
+	 case ESC_STRING_DOLLAR_TOKEN:
+	 last_type = STRING_DOLLAR_TOKEN;
+	 if (NULL == (ebuf = check_byte_compiled_token (buf)))
+	 goto return_error;
+	 (void) expand_escaped_string (buf, buf, ebuf, &len, 0);
+	 last_type = STRING_DOLLAR_TOKEN;
+	 break;
+
+	 case ESC_BSTRING_TOKEN:
+	 type = BSTRING_TOKEN;
+	 if (NULL == (ebuf = check_byte_compiled_token (buf)))
+	 goto return_error;
+	 (void) expand_escaped_string (buf, buf, ebuf, &len, 1);
+	 last_type = BSTRING_TOKEN;
+	 break;
+
+	 default:
+	 SLang_verror (SL_INVALID_DATA_ERROR, "Unexpected object (0x%X) encountered in stream", (int)this_type);
+	 goto return_error;
+	 }
+
+	if ((last_type != type) && (type != 0))
+	 {
+	 SLang_verror (SL_INVALID_DATA_ERROR, "Unexpected object (0x%X) encountered in stream", (int)this_type);
+	 return -1;
+	 }
+	type = last_type;
+
+	if (NULL == (next = alloc_string_list_type ((unsigned char *)buf, len)))
+	 goto return_error;
+	if (root == NULL)
+	 root = next;
+	else
+	 tail->next = next;
+	tail = next;
+ }
+
+ if (NULL == (m = create_multistring (&root, type)))
+ goto return_error;
+
+ tok.v.multistring_val = m;
+ tok.free_val_func = free_multistring_token_val;
+ tok.type = MULTI_STRING_TOKEN;
+ (*_pSLcompile_ptr)(&tok);
+ (*tok.free_val_func) (&tok);
+ if (_pSLang_Error)
+ return -1;
+ return 0;
+
+return_error:
+ if (root != NULL) free_string_list (root);
+ return -1;
+}
+
+void _pSLcompile_byte_compiled (void)
+{
+ _pSLtok_Type type;
+ _pSLang_Token_Type tok;
+ char bufSL_MAX_TOKEN_LEN+1;
+ char *ebuf;
+ unsigned int len;
+
+ memset ((char *) &tok, 0, sizeof (_pSLang_Token_Type));
+
+ while (_pSLang_Error == 0)
+ {
+	top_of_switch:
+	type = (unsigned char) *Input_Line_Pointer++;
+	switch (type)
+	 {
+	 case '\n':
+	 case 0:
+	 if (-1 == next_input_line ())
+	 return;
+
+	 goto top_of_switch;
+
+	 case CONT_N_TOKEN:
+	 case BREAK_N_TOKEN:
+	 case LINE_NUM_TOKEN:
+	 case CHAR_TOKEN:
+	 case SHORT_TOKEN:
+	 case INT_TOKEN:
+	 case LONG_TOKEN:
+	 if (NULL == check_byte_compiled_token (buf))
+	 return;
+	 tok.v.long_val = SLatol ((unsigned char *)buf);
+	 break;
+
+	 case UCHAR_TOKEN:
+	 case USHORT_TOKEN:
+	 case UINT_TOKEN:
+	 case ULONG_TOKEN:
+	 if (NULL == check_byte_compiled_token (buf))
+	 return;
+	 tok.v.ulong_val = SLatoul ((unsigned char *)buf);
+	 break;
+#ifdef HAVE_LONG_LONG
+	 case LLONG_TOKEN:
+	 if (NULL == check_byte_compiled_token (buf))
+	 return;
+	 tok.v.llong_val = SLatoll ((unsigned char *)buf);
+	 break;
+	 case ULLONG_TOKEN:
+	 if (NULL == check_byte_compiled_token (buf))
+	 return;
+	 tok.v.ullong_val = SLatoull ((unsigned char *)buf);
+	 break;
+#endif
+	 case COMPLEX_TOKEN:
+	 case FLOAT_TOKEN:
+	 case DOUBLE_TOKEN:
+	 if (NULL == check_byte_compiled_token (buf))
+	 return;
+	 tok.v.s_val = buf;
+	 break;
+
+	 case ESC_STRING_DOLLAR_TOKEN:
+	 if (NULL == (ebuf = check_byte_compiled_token (buf)))
+	 return;
+	 tok.v.s_val = buf;
+	 (void) expand_escaped_string (buf, buf, ebuf, &len, 0);
+	 tok.hash = _pSLstring_hash ((unsigned char *)buf, (unsigned char *)buf + len);
+	 type = STRING_DOLLAR_TOKEN;
+	 break;
+
+	 case ESC_STRING_TOKEN:
+	 if (NULL == (ebuf = check_byte_compiled_token (buf)))
+	 return;
+	 tok.v.s_val = buf;
+	 (void) expand_escaped_string (buf, buf, ebuf, &len, 0);
+	 tok.hash = _pSLstring_hash ((unsigned char *)buf, (unsigned char *)buf + len);
+	 type = STRING_TOKEN;
+	 break;
+
+	 case ESC_BSTRING_TOKEN:
+	 if (NULL == (ebuf = check_byte_compiled_token (buf)))
+	 return;
+	 tok.v.s_val = buf;
+	 (void) expand_escaped_string (buf, buf, ebuf, &len, 1);
+	 tok.hash = len;
+	 type = _BSTRING_TOKEN;
+	 break;
+
+	 case TMP_TOKEN:
+	 case DEFINE_TOKEN:
+	 case DEFINE_STATIC_TOKEN:
+	 case DEFINE_PRIVATE_TOKEN:
+	 case DEFINE_PUBLIC_TOKEN:
+	 case DOT_TOKEN:
+	 case DOT_METHOD_CALL_TOKEN:
+	 case STRING_DOLLAR_TOKEN:
+	 case STRING_TOKEN:
+	 case IDENT_TOKEN:
+	 case _REF_TOKEN:
+	 /* case _DEREF_ASSIGN_TOKEN: */
+	 case _SCALAR_ASSIGN_TOKEN:
+	 case _SCALAR_PLUSEQS_TOKEN:
+	 case _SCALAR_MINUSEQS_TOKEN:
+	 case _SCALAR_TIMESEQS_TOKEN:
+	 case _SCALAR_DIVEQS_TOKEN:
+	 case _SCALAR_BOREQS_TOKEN:
+	 case _SCALAR_BANDEQS_TOKEN:
+	 case _SCALAR_PLUSPLUS_TOKEN:
+	 case _SCALAR_POST_PLUSPLUS_TOKEN:
+	 case _SCALAR_MINUSMINUS_TOKEN:
+	 case _SCALAR_POST_MINUSMINUS_TOKEN:
+	 case _STRUCT_ASSIGN_TOKEN:
+	 case _STRUCT_PLUSEQS_TOKEN:
+	 case _STRUCT_MINUSEQS_TOKEN:
+	 case _STRUCT_TIMESEQS_TOKEN:
+	 case _STRUCT_DIVEQS_TOKEN:
+	 case _STRUCT_BOREQS_TOKEN:
+	 case _STRUCT_BANDEQS_TOKEN:
+	 case _STRUCT_POST_MINUSMINUS_TOKEN:
+	 case _STRUCT_MINUSMINUS_TOKEN:
+	 case _STRUCT_POST_PLUSPLUS_TOKEN:
+	 case _STRUCT_PLUSPLUS_TOKEN:
+	 case _STRUCT_FIELD_REF_TOKEN:
+	 if (NULL == (ebuf = check_byte_compiled_token (buf)))
+	 return;
+	 tok.v.s_val = buf;
+	 tok.hash = _pSLstring_hash ((unsigned char *)buf, (unsigned char *)ebuf);
+	 break;
+
+	 case MULTI_STRING_TOKEN:
+	 if (-1 == compile_byte_compiled_multistring (buf))
+	 return;
+	 type = 0;
+	 break;
+
+	 default:
+	 break;
+	 }
+
+	if (type == 0)
+	 continue;
+
+	tok.type = type;
+	(*_pSLcompile_ptr) (&tok);
+ }
+}
+
+static int escape_string (unsigned char *s, unsigned char *smax,
+			 unsigned char *buf, unsigned char *buf_max,
+			 int *is_escaped)
+{
+ unsigned char ch;
+
+ *is_escaped = 0;
+ while (buf < buf_max)
+ {
+	if (s == smax)
+	 {
+	 *buf = 0;
+	 return 0;
+	 }
+
+	ch = *s++;
+	switch (ch)
+	 {
+	 default:
+	 *buf++ = ch;
+	 break;
+
+	 case 0:
+	 *buf++ = '\\';
+	 if (buf < buf_max) *buf++ = 'x';
+	 if (buf < buf_max) *buf++ = '0';
+	 if (buf < buf_max) *buf++ = '0';
+	 *is_escaped = 1;
+	 break; /* return 0; */
+
+	 case '\n':
+	 *buf++ = '\\';
+	 if (buf < buf_max) *buf++ = 'n';
+	 *is_escaped = 1;
+	 break;
+
+	 case '\r':
+	 *buf++ = '\\';
+	 if (buf < buf_max) *buf++ = 'r';
+	 *is_escaped = 1;
+	 break;
+
+	 case 0x1A:		 /* ^Z */
+	 *buf++ = '\\';
+	 if (buf < buf_max) *buf++ = 'x';
+	 if (buf < buf_max) *buf++ = '1';
+	 if (buf < buf_max) *buf++ = 'A';
+	 *is_escaped = 1;
+	 break;
+
+	 case '\\':
+	 *buf++ = ch;
+	 if (buf < buf_max) *buf++ = ch;
+	 *is_escaped = 1;
+	 break;
+	 }
+ }
+ _pSLparse_error (SL_BUILTIN_LIMIT_EXCEEDED, "String too long to byte-compile", NULL, 0);
+ return -1;
+}
+
+static FILE *Byte_Compile_Fp;
+static unsigned int Byte_Compile_Line_Len;
+
+static int bytecomp_write_data (SLCONST char *buf, unsigned int len)
+{
+ unsigned int clen = Byte_Compile_Line_Len;
+ unsigned int clen_max = MAX_FILE_LINE_LEN - 1;
+ SLCONST char *bufmax = buf + len;
+ FILE *fp = Byte_Compile_Fp;
+
+ while (buf < bufmax)
+ {
+	if (clen == clen_max)
+	 {
+	 if (EOF == putc ('\n', fp))
+	 {
+		 SLang_set_error (SL_IO_WRITE_ERROR);
+		 return -1;
+	 }
+	 clen = 0;
+	 }
+
+	if (EOF == putc ((unsigned char)*buf, fp))
+	 {
+	 SLang_set_error (SL_IO_WRITE_ERROR);
+	 return -1;
+	 }
+	buf++;
+	clen++;
+ }
+ Byte_Compile_Line_Len = clen;
+ return 0;
+}
+
+static int byte_compile_multiline_token (_pSLang_Token_Type *tok,
+					 unsigned char *buf, unsigned char *buf_max)
+{
+ _pSLtoken_String_List_Type *root;
+ _pSLang_Multiline_String_Type *m;
+ _pSLtok_Type type, esc_type;
+ char *b3;
+
+ /* The token consists of N elements. It gets encoded as N+2 tokens:
+ * TYPE STRING_1 .... STRING_N TYPE
+ */
+ m = tok->v.multistring_val;
+ switch (m->type)
+ {
+ case STRING_TOKEN:
+	type = STRING_TOKEN;
+	esc_type = ESC_STRING_TOKEN;
+	break;
+
+ case BSTRING_TOKEN:
+	type = esc_type = ESC_BSTRING_TOKEN;
+	break;
+
+ case STRING_DOLLAR_TOKEN:
+	type = STRING_DOLLAR_TOKEN;
+	esc_type = ESC_STRING_DOLLAR_TOKEN;
+	break;
+
+ default:
+	SLang_verror (SL_Internal_Error, "Unsupported multline token: 0x%X", tok->type);
+	return -1;
+ }
+
+ buf0 = tok->type;
+ buf1 = 0;
+ if (-1 == bytecomp_write_data ((char *)buf, 1))
+ return -1;
+
+ root = m->list;
+ b3 = (char *)buf + 3;
+ while (root != NULL)
+ {
+	unsigned int len;
+	int is_escaped;
+
+	if (-1 == escape_string ((unsigned char *)root->buf, (unsigned char *)root->buf + root->len,
+				 (unsigned char *)b3, buf_max, &is_escaped))
+	 return -1;
+
+	if (is_escaped)
+	 buf0 = esc_type;
+	else
+	 buf0 = type;
+
+	len = strlen (b3);
+	buf1 = (unsigned char) ((len & 0x7F) + 32);
+	buf2 = (unsigned char) (((len >> 7) & 0x7F) + 32);
+	len += 3;
+
+	if (-1 == bytecomp_write_data ((char *) buf, len))
+	 return -1;
+
+	root = root->next;
+ }
+
+ buf0 = tok->type;
+ buf1 = 0;
+ if (-1 == bytecomp_write_data ((char *)buf, 1))
+ return -1;
+
+ return 0;
+}
+
+static void byte_compile_token (_pSLang_Token_Type *tok)
+{
+ unsigned char buf SL_MAX_TOKEN_LEN + 4, *buf_max;
+ SLstrlen_Type len;
+ char *b3;
+ int is_escaped;
+ unsigned char *s;
+
+ if (_pSLang_Error) return;
+
+ buf 0 = (unsigned char) tok->type;
+ buf 1 = 0;
+
+ buf_max = buf + sizeof(buf);
+ b3 = (char *) buf + 3;
+
+ switch (tok->type)
+ {
+ case BOS_TOKEN:
+ case LINE_NUM_TOKEN:
+ case CHAR_TOKEN:
+ case SHORT_TOKEN:
+ case INT_TOKEN:
+ case LONG_TOKEN:
+	sprintf (b3, "%ld", tok->v.long_val);
+	break;
+
+ case UCHAR_TOKEN:
+ case USHORT_TOKEN:
+ case UINT_TOKEN:
+ case ULONG_TOKEN:
+	sprintf (b3, "%lu", tok->v.long_val);
+	break;
+
+#ifdef HAVE_LONG_LONG
+ case LLONG_TOKEN:
+	sprintf (b3, SLFMT_LLD, tok->v.llong_val);
+	break;
+
+ case ULLONG_TOKEN:
+	sprintf (b3, SLFMT_LLU, tok->v.ullong_val);
+	break;
+#endif
+ case _BSTRING_TOKEN:
+	s = (unsigned char *) tok->v.s_val;
+	len = (unsigned int) tok->hash;
+
+	if (-1 == escape_string (s, s + len,
+				 (unsigned char *)b3, buf_max,
+				 &is_escaped))
+	 return;
+
+	buf0 = ESC_BSTRING_TOKEN;
+	break;
+
+ case BSTRING_TOKEN:
+	if (NULL == (s = SLbstring_get_pointer (tok->v.b_val, &len)))
+	 return;
+
+	if (-1 == escape_string (s, s + len,
+				 (unsigned char *)b3, buf_max,
+				 &is_escaped))
+	 return;
+	buf0 = ESC_BSTRING_TOKEN;
+	break;
+
+ case STRING_DOLLAR_TOKEN:
+ case STRING_TOKEN:
+	s = (unsigned char *)tok->v.s_val;
+
+	if (-1 == escape_string (s, s + strlen ((char *)s),
+				 (unsigned char *)b3, buf_max,
+				 &is_escaped))
+	 return;
+
+	if (is_escaped)
+	 buf0 = ((tok->type == STRING_TOKEN)
+		 ? ESC_STRING_TOKEN : ESC_STRING_DOLLAR_TOKEN);
+	break;
+
+ /* case _DEREF_ASSIGN_TOKEN: */
+	/* a _SCALAR_* token is attached to an identifier. */
+ case _SCALAR_ASSIGN_TOKEN:
+ case _SCALAR_PLUSEQS_TOKEN:
+ case _SCALAR_MINUSEQS_TOKEN:
+ case _SCALAR_TIMESEQS_TOKEN:
+ case _SCALAR_DIVEQS_TOKEN:
+ case _SCALAR_BOREQS_TOKEN:
+ case _SCALAR_BANDEQS_TOKEN:
+ case _SCALAR_PLUSPLUS_TOKEN:
+ case _SCALAR_POST_PLUSPLUS_TOKEN:
+ case _SCALAR_MINUSMINUS_TOKEN:
+ case _SCALAR_POST_MINUSMINUS_TOKEN:
+ case DOT_TOKEN:
+ case DOT_METHOD_CALL_TOKEN:
+ case TMP_TOKEN:
+ case DEFINE_TOKEN:
+ case DEFINE_STATIC_TOKEN:
+ case DEFINE_PRIVATE_TOKEN:
+ case DEFINE_PUBLIC_TOKEN:
+ case FLOAT_TOKEN:
+ case DOUBLE_TOKEN:
+ case COMPLEX_TOKEN:
+ case IDENT_TOKEN:
+ case _REF_TOKEN:
+ case _STRUCT_ASSIGN_TOKEN:
+ case _STRUCT_PLUSEQS_TOKEN:
+ case _STRUCT_MINUSEQS_TOKEN:
+ case _STRUCT_TIMESEQS_TOKEN:
+ case _STRUCT_DIVEQS_TOKEN:
+ case _STRUCT_BOREQS_TOKEN:
+ case _STRUCT_BANDEQS_TOKEN:
+ case _STRUCT_POST_MINUSMINUS_TOKEN:
+ case _STRUCT_MINUSMINUS_TOKEN:
+ case _STRUCT_POST_PLUSPLUS_TOKEN:
+ case _STRUCT_PLUSPLUS_TOKEN:
+ case _STRUCT_FIELD_REF_TOKEN:
+	strcpy (b3, tok->v.s_val);
+	break;
+
+ case BREAK_N_TOKEN:
+ case CONT_N_TOKEN:
+	sprintf (b3, "%ld", tok->v.long_val);
+	break;
+
+ case MULTI_STRING_TOKEN:
+	(void) byte_compile_multiline_token (tok, buf, buf_max);
+	return;
+
+ default:
+	b3 = NULL;
+ }
+
+ if (b3 != NULL)
+ {
+	len = strlen (b3);
+	buf1 = (unsigned char) ((len & 0x7F) + 32);
+	buf2 = (unsigned char) (((len >> 7) & 0x7F) + 32);
+	len += 3;
+ }
+ else len = 1;
+
+ (void) bytecomp_write_data ((char *)buf, len);
+}
+
+int SLang_byte_compile_file (SLFUTURE_CONST char *name, int method)
+{
+ char file 1024;
+
+ (void) method;
+ if (strlen (name) + 2 >= sizeof (file))
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Filename too long");
+	return -1;
+ }
+ sprintf (file, "%sc", name);
+ if (NULL == (Byte_Compile_Fp = fopen (file, "w")))
+ {
+	_pSLang_verror(SL_OBJ_NOPEN, "%s: unable to open", file);
+	return -1;
+ }
+
+ Byte_Compile_Line_Len = 0;
+ if (-1 != bytecomp_write_data (".#", 2))
+ {
+	_pSLcompile_ptr = byte_compile_token;
+	(void) SLang_load_file (name);
+	_pSLcompile_ptr = _pSLcompile;
+
+	(void) bytecomp_write_data ("\n", 1);
+ }
+
+ if (EOF == fclose (Byte_Compile_Fp))
+ SLang_set_error (SL_IO_WRITE_ERROR);
+
+ if (_pSLang_Error)
+ {
+	_pSLang_verror (0, "Error processing %s", name);
+	return -1;
+ }
+ return 0;
+}
+
+int SLang_generate_debug_info (int x)
+{
+#if SLANG_HAS_DEBUG_CODE
+ /* int y = Default_Compile_Line_Num_Info; */
+ /* Default_Compile_Line_Num_Info = x; */
+ int y = 0;
+ (void)x;
+#if 0
+ if (x == 0)
+ Default_Compile_BOSEOS = 0;
+ else
+ Default_Compile_BOSEOS = 3;
+#endif
+ return y;
+#else
+ (void) x;
+ return 0;
+#endif
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/sltypes.c Added

@@ -0,0 +1,1100 @@
+/* Basic type operations for S-Lang */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#if SLANG_HAS_FLOAT
+# include <math.h>
+#endif
+
+/* #define SL_APP_WANTS_FOREACH	*/ /* for String_Type */
+#include "slang.h"
+#include "_slang.h"
+
+int SLpop_string (char **s) /*{{{*/
+{
+ char *sls;
+
+ *s = NULL;
+
+ if (-1 == SLang_pop_slstring (&sls))
+ return -1;
+
+ if (NULL == (*s = SLmake_string (sls)))
+ {
+	SLang_free_slstring (sls);
+	return -1;
+ }
+
+ SLang_free_slstring (sls);
+ return 0;
+}
+
+/*}}}*/
+
+int SLang_pop_slstring (char **s) /*{{{*/
+{
+ return SLclass_pop_ptr_obj (SLANG_STRING_TYPE, (VOID_STAR *)s);
+}
+
+/*}}}*/
+
+int _pSLang_push_slstring (char *s)
+{
+ if (0 == SLclass_push_ptr_obj (SLANG_STRING_TYPE, (VOID_STAR)s))
+ return 0;
+
+ SLang_free_slstring (s);
+ return -1;
+}
+
+/* Frees s upon error */
+int _pSLpush_alloced_slstring (char *s, size_t len)
+{
+ if (NULL == (s = _pSLcreate_via_alloced_slstring (s, len)))
+ return -1;
+
+ return _pSLang_push_slstring (s);
+}
+
+int SLang_push_string (SLFUTURE_CONST char *t) /*{{{*/
+{
+ if (t == NULL)
+ return SLang_push_null ();
+
+ if (NULL == (t = SLang_create_slstring (t)))
+ return -1;
+
+ return _pSLang_push_slstring ((char *) t);
+}
+
+/*}}}*/
+
+int _pSLang_dup_and_push_slstring (SLCONST char *s)
+{
+ if (NULL == (s = _pSLstring_dup_slstring (s)))
+ return SLang_push_null ();
+
+ return _pSLang_push_slstring ((char *) s);
+}
+
+/* This function _always_ frees the malloced string */
+int SLang_push_malloced_string (char *c) /*{{{*/
+{
+ int ret;
+
+ ret = SLang_push_string (c);
+ SLfree (c);
+
+ return ret;
+}
+
+/*}}}*/
+
+#if 0
+static int int_int_power (int a, int b)
+{
+ int r, s;
+
+ if (a == 0) return 0;
+ if (b < 0) return 0;
+ if (b == 0) return 1;
+
+ s = 1;
+ if (a < 0)
+ {
+	if ((b % 2) == 1) s = -1;
+	a = -a;
+ }
+
+ /* FIXME: Priority=low
+ * This needs optimized
+ */
+ r = 1;
+ while (b)
+ {
+	r = r * a;
+	b--;
+ }
+ return r * s;
+}
+#endif
+
+static int
+string_string_bin_op_result (int op, SLtype a, SLtype b,
+			 SLtype *c)
+{
+ (void) a;
+ (void) b;
+ switch (op)
+ {
+ default:
+	return 0;
+
+ case SLANG_PLUS:
+	*c = SLANG_STRING_TYPE;
+	break;
+
+ case SLANG_GT:
+ case SLANG_GE:
+ case SLANG_LT:
+ case SLANG_LE:
+ case SLANG_EQ:
+ case SLANG_NE:
+	*c = SLANG_CHAR_TYPE;
+	break;
+ }
+ return 1;
+}
+
+static int
+string_string_bin_op (int op,
+		 SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+		 SLtype b_type, VOID_STAR bp, SLuindex_Type nb,
+		 VOID_STAR cp)
+{
+ char *ic;
+ char **a, **b, **c;
+ SLuindex_Type n, n_max;
+ unsigned int da, db;
+
+ (void) a_type;
+ (void) b_type;
+
+ if (na == 1) da = 0; else da = 1;
+ if (nb == 1) db = 0; else db = 1;
+
+ if (na > nb) n_max = na; else n_max = nb;
+
+ a = (char **) ap;
+ b = (char **) bp;
+
+ if ((op != SLANG_NE) && (op != SLANG_EQ))
+ for (n = 0; n < n_max; n++)
+ {
+	 if ((*a == NULL) || (*b == NULL))
+	 {
+	 _pSLang_verror (SL_VARIABLE_UNINITIALIZED, "String element%lu not initialized for binary operation", (unsigned long)n);
+	 return -1;
+	 }
+	 a += da; b += db;
+ }
+
+ a = (char **) ap;
+ b = (char **) bp;
+ ic = (char *) cp;
+ c = NULL;
+
+ switch (op)
+ {
+ case SLANG_DIVIDE:
+ case SLANG_MINUS:
+ default:
+	return 0;
+
+ case SLANG_PLUS:
+	/* Concat */
+	c = (char **) cp;
+	for (n = 0; n < n_max; n++)
+	 {
+	 if (NULL == (cn = SLang_concat_slstrings (*a, *b)))
+	 goto return_error;
+
+	 a += da; b += db;
+	 }
+	break;
+
+ case SLANG_NE:
+	for (n = 0; n < n_max; n++)
+	 {
+	 if ((*a == NULL) || (*b == NULL))
+	 ic n = (*a != *b);
+	 else
+	 ic n = (*a != *b) && (0 != strcmp (*a, *b));
+
+	 a += da;
+	 b += db;
+	 }
+	break;
+ case SLANG_GT:
+	for (n = 0; n < n_max; n++)
+	 {
+	 ic n = (strcmp (*a, *b) > 0);
+	 a += da;
+	 b += db;
+	 }
+	break;
+ case SLANG_GE:
+	for (n = 0; n < n_max; n++)
+	 {
+	 ic n = (strcmp (*a, *b) >= 0);
+	 a += da;
+	 b += db;
+	 }
+	break;
+ case SLANG_LT:
+	for (n = 0; n < n_max; n++)
+	 {
+	 ic n = (strcmp (*a, *b) < 0);
+	 a += da;
+	 b += db;
+	 }
+	break;
+ case SLANG_LE:
+	for (n = 0; n < n_max; n++)
+	 {
+	 ic n = (strcmp (*a, *b) <= 0);
+	 a += da;
+	 b += db;
+	 }
+	break;
+ case SLANG_EQ:
+	for (n = 0; n < n_max; n++)
+	 {
+	 if ((*a == NULL) || (*b == NULL))
+	 icn = (*a == *b);
+	 else
+	 ic n = (*a == *b) || (strcmp (*a, *b) == 0);
+	 a += da;
+	 b += db;
+	 }
+	break;
+ }
+ return 1;
+
+ return_error:
+ if (c != NULL)
+ {
+	SLuindex_Type nn;
+	for (nn = 0; nn < n; nn++)
+	 {
+	 SLang_free_slstring (cnn);
+	 cnn = NULL;
+	 }
+	for (nn = n; nn < n_max; nn++)
+	 cnn = NULL;
+ }
+ return -1;
+}
+
+static void string_destroy (SLtype unused, VOID_STAR s)
+{
+ (void) unused;
+ SLang_free_slstring (*(char **) s);
+}
+
+static int string_push (SLtype unused, VOID_STAR sptr)
+{
+ (void) unused;
+ return SLang_push_string (*(char **) sptr);
+}
+
+static int string_cmp (SLtype unused, VOID_STAR ap, VOID_STAR bp, int *c)
+{
+ char *a, *b;
+ (void) unused;
+
+ a = *(char **) ap;
+ b = *(char **) bp;
+ if (a != b)
+ {
+	if (a == NULL) *c = -1;
+	else if (b == NULL) *c = 1;
+	else *c = strcmp (a, b);
+	return 0;
+ }
+ *c = 0;
+ return 0;
+}
+
+static int string_to_int (SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+			 SLtype b_type, VOID_STAR bp)
+{
+ char **s;
+ unsigned int i;
+ int *b;
+
+ (void) a_type;
+ (void) b_type;
+
+ s = (char **) ap;
+ b = (int *) bp;
+ for (i = 0; i < na; i++)
+ {
+	if (si == NULL) bi = 0;
+	else bi = si0;
+ }
+ return 1;
+}
+
+static int string_acopy (SLtype unused, VOID_STAR src_sptr, VOID_STAR dest_sptr)
+{
+ char *s;
+ (void) unused;
+ if (NULL == (s = SLang_create_slstring (*(char **)src_sptr)))
+ return -1;
+ *(char **)dest_sptr = s;
+ return 0;
+}
+
+SLang_Array_Type *_pSLstrings_to_array (char **strs, unsigned int n)
+{
+ char **data;
+ SLindex_Type i, inum;
+ SLang_Array_Type *at;
+
+ inum = (SLindex_Type) n;
+
+ if (NULL == (at = SLang_create_array (SLANG_STRING_TYPE, 0, NULL, &inum, 1)))
+ return NULL;
+
+ data = (char **)at->data;
+ for (i = 0; i < inum; i++)
+ {
+	if (strsi == NULL)
+	 {
+	 datai = NULL;
+	 continue;
+	 }
+
+	if (NULL == (datai = SLang_create_slstring (strsi)))
+	 {
+	 SLang_free_array (at);
+	 return NULL;
+	 }
+ }
+ return at;
+}
+
+static SLang_Array_Type *string_list_to_array (_pSLString_List_Type *p, int delete_list)
+{
+ unsigned int num;
+ SLindex_Type inum;
+ SLang_Array_Type *at;
+ char **buf;
+
+ buf = p->buf;
+ num = p->num;
+
+ if (delete_list == 0)
+ return _pSLstrings_to_array (buf, num);
+
+ inum = (SLindex_Type) num;
+ if (num == 0) num++;		 /* so realloc succeeds */
+
+ /* Since the list is to be deleted, we can steal the buffer */
+ if ((num != p->max_num)
+ && (NULL == (buf = (char **)SLrealloc ((char *) buf, sizeof (char *) * num))))
+ {
+	_pSLstring_list_delete (p);
+	return NULL;
+ }
+ p->max_num = num;
+ p->buf = buf;
+
+ if (NULL == (at = SLang_create_array (SLANG_STRING_TYPE, 0, (VOID_STAR) buf, &inum, 1)))
+ {
+	_pSLstring_list_delete (p);
+	return NULL;
+ }
+ p->buf = NULL;
+ _pSLstring_list_delete (p);
+ return at;
+}
+
+int _pSLstring_list_push (_pSLString_List_Type *p, int delete_list)
+{
+ SLang_Array_Type *at;
+
+ if ((p == NULL)
+ || (p->buf == NULL))
+ {
+	int ret = SLang_push_null ();
+	if (delete_list)
+	 _pSLstring_list_delete (p);
+	return ret;
+ }
+
+ if (NULL == (at = string_list_to_array (p, delete_list)))
+ return -1;
+
+ return SLang_push_array (at, 1);
+}
+
+int _pSLstring_list_init (_pSLString_List_Type *p, unsigned int max_num, unsigned int delta_num)
+{
+ if (NULL == (p->buf = (char **) _SLcalloc (max_num, sizeof (char *))))
+ return -1;
+
+ p->max_num = max_num;
+ p->num = 0;
+ p->delta_num = delta_num;
+ p->is_malloced = 0;
+ return 0;
+}
+
+int _pSLstring_list_append (_pSLString_List_Type *p, char *s)
+{
+ if (s == NULL)
+ return -1;
+
+ if (p->max_num == p->num)
+ {
+	char **b;
+	unsigned int max_num = p->num + p->delta_num;
+	b = (char **)SLrealloc ((char *)p->buf, max_num * sizeof (char *));
+	if (b == NULL)
+	 return -1;
+	p->buf = b;
+	p->max_num = max_num;
+ }
+
+ p->bufp->num = s;
+ p->num++;
+ return 0;
+}
+
+int _pSLstring_list_append_copy (_pSLString_List_Type *p, char *s)
+{
+ s = SLang_create_slstring (s);
+ if (s == NULL)
+ return -1;
+ if (-1 == _pSLstring_list_append (p, s))
+ {
+	SLang_free_slstring (s);
+	return -1;
+ }
+ return 0;
+}
+
+void _pSLstring_list_delete (_pSLString_List_Type *p)
+{
+ if (p == NULL)
+ return;
+
+ if (p->buf != NULL)
+ {
+	unsigned int i, imax;
+	char **buf = p->buf;
+	imax = p->num;
+	for (i = 0; i < imax; i++)
+	 SLang_free_slstring (bufi);
+	SLfree ((char *)buf);
+	p->buf = NULL;
+ }
+ if (p->is_malloced)
+ SLfree ((char *) p);
+}
+
+_pSLString_List_Type *_pSLstring_list_new (unsigned int max_num, unsigned int delta_num)
+{
+ _pSLString_List_Type *p;
+
+ p = (_pSLString_List_Type *)SLmalloc (sizeof (_pSLString_List_Type));
+ if (p == NULL)
+ return NULL;
+
+ if (-1 == _pSLstring_list_init (p, max_num, delta_num))
+ {
+	SLfree ((char *) p);
+	return NULL;
+ }
+ p->is_malloced = 1;
+ return p;
+}
+
+/* Ref type */
+
+int _pSLang_deref_assign (SLang_Ref_Type *ref)
+{
+ return ref->deref_assign (ref->data);
+}
+
+int SLang_pop_ref (SLang_Ref_Type **ref)
+{
+ return SLclass_pop_ptr_obj (SLANG_REF_TYPE, (VOID_STAR *)ref);
+}
+
+int SLang_push_ref (SLang_Ref_Type *ref)
+{
+ ref->num_refs++;
+ if (0 == SLclass_push_ptr_obj (SLANG_REF_TYPE, (VOID_STAR) ref))
+ return 0;
+ ref->num_refs--;
+ return -1;
+}
+
+void SLang_free_ref (SLang_Ref_Type *ref)
+{
+ if (ref == NULL)
+ return;
+
+ if (ref->num_refs > 1)
+ {
+	ref->num_refs--;
+	return;
+ }
+
+ if (ref->destroy != NULL)
+ (*ref->destroy)(ref->data);
+ SLfree ((char *)ref->data);
+ SLfree ((char *)ref);
+}
+
+SLang_Ref_Type *_pSLang_new_ref (unsigned int sizeof_data)
+{
+ SLang_Ref_Type *ref;
+
+ if (NULL == (ref = (SLang_Ref_Type *)SLcalloc (1, sizeof (SLang_Ref_Type))))
+ return NULL;
+ if (NULL == (ref->data = (VOID_STAR)SLcalloc (1, sizeof_data)))
+ {
+	SLfree ((char *)ref);
+	return NULL;
+ }
+ ref->num_refs = 1;
+ ref->sizeof_data = sizeof_data;
+ return ref;
+}
+
+static void ref_destroy (SLtype type, VOID_STAR ptr)
+{
+ (void) type;
+ SLang_free_ref (*(SLang_Ref_Type **)ptr);
+}
+
+static int ref_push (SLtype type, VOID_STAR ptr)
+{
+ SLang_Ref_Type *ref;
+
+ (void) type;
+
+ ref = *(SLang_Ref_Type **) ptr;
+
+ if (ref == NULL)
+ return SLang_push_null ();
+
+ return SLang_push_ref (ref);
+}
+
+int SLang_assign_to_ref (SLang_Ref_Type *ref, SLtype type, VOID_STAR v)
+{
+ SLang_Object_Type *stkptr;
+ SLang_Class_Type *cl;
+
+ cl = _pSLclass_get_class (type);
+
+ /* Use apush since this function is passing ``array'' bytes rather than the
+ * address of the data. I need to somehow make this more consistent. To
+ * see what I mean, consider:
+ *
+ * double z2;
+ * char *s = "silly";
+ * char bytes10; BAD--- Don't do this
+ * int i;
+ *
+ * SLang_assign_to_ref (ref, SLANG_INT_TYPE, &i);
+ * SLang_assign_to_ref (ref, SLANG_STRING_TYPE, &s);
+ * SLang_assign_to_ref (ref, SLANG_COMPLEX_TYPE, z);
+ *
+ * That is, all external routines that take a VOID_STAR argument need to
+ * be documented such that how the function should be called with the
+ * various class_types.
+ */
+ if (-1 == (*cl->cl_apush) (type, v))
+ return -1;
+
+ stkptr = _pSLang_get_run_stack_pointer ();
+ if (0 == _pSLang_deref_assign (ref))
+ return 0;
+
+ if (stkptr != _pSLang_get_run_stack_pointer ())
+ SLdo_pop ();
+
+ return -1;
+}
+
+static char *ref_string (SLtype type, VOID_STAR ptr)
+{
+ SLang_Ref_Type *ref;
+
+ (void) type;
+ ref = *(SLang_Ref_Type **) ptr;
+ if (ref->string != NULL)
+ return ref->string (ref->data);
+ return SLmake_string ("Ref_Type");
+}
+
+static int ref_dereference (SLtype unused, VOID_STAR ptr)
+{
+ (void) unused;
+ return _pSLang_dereference_ref (*(SLang_Ref_Type **) ptr);
+}
+
+static int ref_cmp (SLtype type, VOID_STAR a, VOID_STAR b, int *c)
+{
+ SLang_Ref_Type *ra, *rb;
+
+ (void) type;
+
+ ra = *(SLang_Ref_Type **)a;
+ rb = *(SLang_Ref_Type **)b;
+
+ if (ra == NULL)
+ {
+	if (rb == NULL) *c = 0;
+	else *c = -1;
+	return 0;
+ }
+ if (rb == NULL)
+ {
+	*c = 1;
+	return 0;
+ }
+ if (ra->sizeof_data != rb->sizeof_data)
+ {
+	*c = (int)ra->sizeof_data - (int)rb->sizeof_data;
+	return 0;
+ }
+
+ *c = memcmp (ra->data, rb->data, ra->sizeof_data);
+ return 0;
+}
+
+/* NULL is permitted here */
+int SLang_push_function (SLang_Name_Type *nt)
+{
+ return _pSLang_push_nt_as_ref (nt);
+}
+
+SLang_Name_Type *SLang_pop_function (void)
+{
+ SLang_Ref_Type *ref;
+ SLang_Name_Type *f;
+
+ if (SLang_peek_at_stack () == SLANG_STRING_TYPE)
+ {
+	char *name;
+
+	if (-1 == SLang_pop_slstring (&name))
+	 return NULL;
+
+	if (NULL == (f = SLang_get_function (name)))
+	 {
+	 _pSLang_verror (SL_UNDEFINED_NAME, "Function %s does not exist", name);
+	 SLang_free_slstring (name);
+	 return NULL;
+	 }
+	SLang_free_slstring (name);
+	return f;
+ }
+
+ if (-1 == SLang_pop_ref (&ref))
+ return NULL;
+
+ f = SLang_get_fun_from_ref (ref);
+ SLang_free_ref (ref);
+ return f;
+}
+
+/* This is a placeholder for version 3 --- NULL assumed to be ok */
+void SLang_free_function (SLang_Name_Type *f)
+{
+ (void) f;
+}
+
+SLang_Name_Type *SLang_copy_function (SLang_Name_Type *f)
+{
+ /* Add ref-count here */
+ return f;
+}
+
+/* NULL type */
+int SLang_push_null (void)
+{
+ return SLclass_push_ptr_obj (SLANG_NULL_TYPE, NULL);
+}
+
+int SLang_pop_null (void)
+{
+ SLang_Object_Type obj;
+ return _pSLang_pop_object_of_type (SLANG_NULL_TYPE, &obj, 0);
+}
+
+static int null_push (SLtype unused, VOID_STAR ptr_unused)
+{
+ (void) unused; (void) ptr_unused;
+ return SLang_push_null ();
+}
+
+static int null_pop (SLtype type, VOID_STAR ptr)
+{
+ (void) type;
+
+ if (-1 == SLang_pop_null ())
+ return -1;
+
+ *(char **) ptr = NULL;
+ return 0;
+}
+
+static int null_dereference (SLtype unused, VOID_STAR ptr)
+{
+ (void) unused; (void) ptr;
+ return SLang_push_null ();
+}
+
+/* Implement foreach (NULL) using (whatever) to do nothing. This is useful
+ * because suppose that X is a list but is NULL in some situations. Then
+ * when it is NULL, we want foreach(X) to do nothing.
+ */
+static SLang_Foreach_Context_Type *
+null_foreach_open (SLtype type, unsigned int num)
+{
+ (void) type;
+ SLdo_pop_n (num + 1);
+ return (SLang_Foreach_Context_Type *)1;
+}
+
+static void null_foreach_close (SLtype type, SLang_Foreach_Context_Type *c)
+{
+ (void) type;
+ (void) c;
+}
+
+static int null_foreach (SLtype type, SLang_Foreach_Context_Type *c)
+{
+ (void) type;
+ (void) c;
+ return 0;
+}
+
+static int null_to_bool (SLtype type, int *t)
+{
+ (void) type;
+ *t = 0;
+ return SLang_pop_null ();
+}
+
+/* AnyType */
+int _pSLanytype_typecast (SLtype a_type, VOID_STAR ap, SLuindex_Type na,
+			 SLtype b_type, VOID_STAR bp)
+{
+ SLang_Class_Type *cl;
+ SLang_Any_Type **any;
+ SLuindex_Type i;
+ size_t sizeof_type;
+
+ (void) b_type;
+
+ any = (SLang_Any_Type **) bp;
+
+ cl = _pSLclass_get_class (a_type);
+ sizeof_type = cl->cl_sizeof_type;
+
+ for (i = 0; i < na; i++)
+ {
+	if ((-1 == (*cl->cl_apush) (a_type, ap))
+	 || (-1 == SLang_pop_anytype (&anyi)))
+	 {
+	 while (i != 0)
+	 {
+		 i--;
+		 SLang_free_anytype (anyi);
+		 anyi = NULL;
+	 }
+	 return -1;
+	 }
+	ap = (VOID_STAR)((char *)ap + sizeof_type);
+ }
+
+ return 1;
+}
+
+int SLang_pop_anytype (SLang_Any_Type **any)
+{
+ SLang_Object_Type *obj;
+
+ if (NULL == (obj = (SLang_Object_Type *) SLmalloc (sizeof (SLang_Object_Type))))
+ {
+	*any = NULL;
+	return -1;
+ }
+
+ if (-1 == SLang_pop (obj))
+ {
+	*any = NULL;
+	SLfree ((char *) obj);
+	return -1;
+ }
+ *any = (SLang_Any_Type *)obj;
+ return 0;
+}
+
+/* This function will result in an object that is represented by the
+ * anytype object.
+ */
+int SLang_push_anytype (SLang_Any_Type *any)
+{
+ return _pSLpush_slang_obj ((SLang_Object_Type *)any);
+}
+
+/* After this call, the stack will contain an Any_Type object */
+static int anytype_push (SLtype type, VOID_STAR ptr)
+{
+ SLang_Any_Type *obj;
+
+ /* Push the object onto the stack, then pop it back off into our anytype
+ * container. That way, any memory managing associated with the type
+ * will be performed automatically. Another way to think of it is that
+ * pushing an Any_Type onto the stack will create another copy of the
+ * object represented by it.
+ */
+ if (-1 == _pSLpush_slang_obj (*(SLang_Object_Type **)ptr))
+ return -1;
+
+ if (-1 == SLang_pop_anytype (&obj))
+ return -1;
+
+ /* There is no need to reference count the anytype objects since every
+ * push results in a new anytype container.
+ */
+ if (-1 == SLclass_push_ptr_obj (type, (VOID_STAR) obj))
+ {
+	SLang_free_anytype (obj);
+	return -1;
+ }
+
+ return 0;
+}
+
+static void anytype_destroy (SLtype type, VOID_STAR ptr)
+{
+ SLang_Object_Type *obj;
+
+ (void) type;
+ obj = *(SLang_Object_Type **)ptr;
+ SLang_free_object (obj);
+ SLfree ((char *) obj);
+}
+
+void SLang_free_anytype (SLang_Any_Type *any)
+{
+ if (any != NULL)
+ anytype_destroy (SLANG_ANY_TYPE, (VOID_STAR) &any);
+}
+
+static int anytype_dereference (SLtype unused, VOID_STAR ptr)
+{
+ (void) unused;
+ return _pSLpush_slang_obj (*(SLang_Object_Type **) ptr);
+}
+
+#if 0
+/* This function performs a deref since we may want the symmetry
+ * a = Any_Type1; ax = "foo"; bar = ax; ==> bar == "foo"
+ * That is, we do not want bar to be an Any_Type.
+ *
+ * Unfortunately, this does not work because of the use of the transfer
+ * buffer by both slarray.c and sltypecast.c. I can work around that
+ * but I am not sure that I like typeof(Any_Type0) != Any_Type.
+ */
+static int anytype_apush (SLtype type, VOID_STAR ptr)
+{
+ (void) type;
+ return _pSLpush_slang_obj (*(SLang_Object_Type **)ptr);
+}
+#endif
+
+/* SLANG_INTP_TYPE */
+static int intp_push (SLtype unused, VOID_STAR ptr)
+{
+ int *addr;
+ (void) unused;
+ addr = *(int **)ptr;
+ if (addr == NULL)
+ return SLclass_push_int_obj (SLANG_INT_TYPE, 0);
+ return SLclass_push_int_obj (SLANG_INT_TYPE, *addr);
+}
+
+static int intp_pop (SLtype unused, VOID_STAR ptr)
+{
+ int *addr;
+
+ (void) unused;
+ addr = *(int **)ptr;
+ if (addr == NULL)
+ {
+	SLang_verror (SL_VariableUninitialized_Error, "_IntegerP_Type: integer pointer address is NULL");
+	return -1;
+ }
+ return SLang_pop_integer (addr);
+}
+
+int _pSLang_pop_wchar (SLwchar_Type *wcp)
+{
+ /* FIXME: This bit of code will be merged into the SLang_pop_wchar function
+ * for the next major version. Currently, SLang_pop_wchar is a macro.
+ */
+ if (SLang_peek_at_stack () == SLANG_CHAR_TYPE)
+ {
+	char ch;
+	if (-1 == SLang_pop_char (&ch))
+	 return -1;
+	*wcp = (unsigned char)ch;
+	return 0;
+ }
+ return SLang_pop_wchar (wcp);
+}
+
+static int undefined_method (SLtype t, VOID_STAR p)
+{
+ (void) t; (void) p;
+ SLang_set_error (SL_VARIABLE_UNINITIALIZED);
+ return -1;
+}
+static void void_undefined_method (SLtype t, VOID_STAR p)
+{
+ (void) t; (void) p;
+}
+
+static void check_sizeof (size_t c, size_t s, const char *obj, int *errp)
+{
+ if (c == s) return;
+ (void) fprintf (stderr, "C sizeof (%s) is %d, configured to be %d\n",
+		 obj, (int)c, (int)s);
+ *errp = 1;
+}
+
+int _pSLregister_types (void)
+{
+ SLang_Class_Type *cl;
+ int err = 0;
+
+ check_sizeof (sizeof(short), SIZEOF_SHORT, "short", &err);
+ check_sizeof (sizeof(int), SIZEOF_INT, "int", &err);
+ check_sizeof (sizeof(long), SIZEOF_LONG, "long", &err);
+ check_sizeof (sizeof(float), SIZEOF_FLOAT, "float", &err);
+ check_sizeof (sizeof(double), SIZEOF_DOUBLE, "double", &err);
+ check_sizeof (sizeof(size_t), SIZEOF_SIZE_T, "size_t", &err);
+ check_sizeof (sizeof(off_t), SIZEOF_OFF_T, "off_t", &err);
+
+ if (err)
+ SLang_exit_error ("S-Lang Library not built properly. Fix SIZEOF_* in config.h and recompile");
+
+ if (-1 == _pSLclass_init ())
+ return -1;
+
+ /* Undefined Type */
+ if (NULL == (cl = SLclass_allocate_class ("Undefined_Type")))
+ return -1;
+ (void) SLclass_set_push_function (cl, undefined_method);
+ (void) SLclass_set_pop_function (cl, undefined_method);
+ (void) SLclass_set_destroy_function (cl, void_undefined_method);
+ if (-1 == SLclass_register_class (cl, SLANG_UNDEFINED_TYPE, sizeof (int),
+				 SLANG_CLASS_TYPE_SCALAR))
+ return -1;
+ /* Make Void_Type a synonym for Undefined_Type. Note that this does
+ * not mean that Void_Type represents SLANG_VOID_TYPE. Void_Type is
+ * used by array_map to indicate no array is to be created.
+ */
+ if (-1 == SLclass_create_synonym ("Void_Type", SLANG_UNDEFINED_TYPE))
+ return -1;
+
+ if (-1 == _pSLarith_register_types ())
+ return -1;
+
+ /* SLANG_INTP_TYPE -- not used within the interpreter */
+ if (NULL == (cl = SLclass_allocate_class ("_IntegerP_Type")))
+ return -1;
+ (void) SLclass_set_push_function (cl, intp_push);
+ (void) SLclass_set_pop_function (cl, intp_pop);
+ if (-1 == SLclass_register_class (cl, SLANG_INTP_TYPE, sizeof (int *),
+				 SLANG_CLASS_TYPE_SCALAR))
+ return -1;
+
+ /* String Type */
+
+ if (NULL == (cl = SLclass_allocate_class ("String_Type")))
+ return -1;
+ (void) SLclass_set_destroy_function (cl, string_destroy);
+ (void) SLclass_set_push_function (cl, string_push);
+ (void) SLclass_set_acopy_function (cl, string_acopy);
+ cl->cl_foreach_open = _pSLbstring_foreach_open;
+ cl->cl_foreach_close = _pSLbstring_foreach_close;
+ cl->cl_foreach = _pSLbstring_foreach;
+ cl->cl_cmp = string_cmp;
+ if (-1 == SLclass_register_class (cl, SLANG_STRING_TYPE, sizeof (char *),
+				 SLANG_CLASS_TYPE_PTR))
+ return -1;
+
+ /* ref Type */
+ if (NULL == (cl = SLclass_allocate_class ("Ref_Type")))
+ return -1;
+ cl->cl_dereference = ref_dereference;
+ cl->cl_push = ref_push;
+ cl->cl_destroy = ref_destroy;
+ cl->cl_string = ref_string;
+ cl->cl_cmp = ref_cmp;
+ if (-1 == SLclass_register_class (cl, SLANG_REF_TYPE,
+				 sizeof (SLang_Ref_Type *),
+				 SLANG_CLASS_TYPE_PTR))
+ return -1;
+
+ /* NULL Type */
+
+ if (NULL == (cl = SLclass_allocate_class ("Null_Type")))
+ return -1;
+ cl->cl_dereference = null_dereference,
+ cl->cl_push = null_push;
+ cl->cl_pop = null_pop;
+ cl->cl_foreach_open = null_foreach_open;
+ cl->cl_foreach_close = null_foreach_close;
+ cl->cl_foreach = null_foreach;
+ cl->cl_to_bool = null_to_bool;
+ if (-1 == SLclass_register_class (cl, SLANG_NULL_TYPE, sizeof (char *),
+				 SLANG_CLASS_TYPE_SCALAR))
+ return -1;
+
+ /* AnyType */
+ if (NULL == (cl = SLclass_allocate_class ("Any_Type")))
+ return -1;
+ (void) SLclass_set_push_function (cl, anytype_push);
+ (void) SLclass_set_destroy_function (cl, anytype_destroy);
+#if 0
+ (void) SLclass_set_apush_function (cl, anytype_apush);
+#endif
+ cl->cl_dereference = anytype_dereference;
+ if (-1 == SLclass_register_class (cl, SLANG_ANY_TYPE, sizeof (VOID_STAR),
+				 SLANG_CLASS_TYPE_PTR))
+ return -1;
+
+ if (-1 == _pSLang_init_bstring ())
+ return -1;
+
+ if ((-1 == SLclass_add_typecast (SLANG_STRING_TYPE, SLANG_INT_TYPE, string_to_int, 0))
+ || (-1 == SLclass_add_binary_op (SLANG_STRING_TYPE, SLANG_STRING_TYPE, string_string_bin_op, string_string_bin_op_result)))
+ return -1;
+
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slupper.c Added

@@ -0,0 +1,37 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include "slinclud.h"
+#include <ctype.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+#define DEFINE_PSLWC_TOUPPER_TABLE
+#include "slupper.h"
+
+#define MODE_VARIABLE _pSLinterp_UTF8_Mode
+SLwchar_Type SLwchar_toupper (SLwchar_Type ch)
+{
+ if (MODE_VARIABLE)
+ return ch + SL_TOUPPER_LOOKUP(ch);
+
+ return toupper (ch);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slupper.h Added

@@ -0,0 +1,937 @@
+/* This file was automatically created by ./mktables */
+#define SL_TOUPPER_MAX_CHAR 0x1E980ul
+
+#define SL_TOUPPER_LOOKUP(x) \
+  (((unsigned)(x)>=SL_TOUPPER_MAX_CHAR)?0:(_pSLwc_Toupper_Table(unsigned)(x)>>7(unsigned)(x)&0x7F))
+
+extern const _pSLint32_Type *_pSLwc_Toupper_Table979;
+
+#ifdef DEFINE_PSLWC_TOUPPER_TABLE
+static const _pSLint32_Type Table_00128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_01128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x68-0x6F*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x70-0x77*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x78-0x7F*/   -32,   -32,   -32,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_02128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,   743,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x68-0x6F*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x70-0x77*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,     0,
+  /*0x78-0x7F*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   121
+};
+
+static const _pSLint32_Type Table_03128 =
+{
+  /*0x00-0x07*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x08-0x0F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x10-0x17*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x18-0x1F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x20-0x27*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x28-0x2F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x30-0x37*/     0,  -232,     0,    -1,     0,    -1,     0,    -1,
+  /*0x38-0x3F*/     0,     0,    -1,     0,    -1,     0,    -1,     0,
+  /*0x40-0x47*/    -1,     0,    -1,     0,    -1,     0,    -1,     0,
+  /*0x48-0x4F*/    -1,     0,     0,    -1,     0,    -1,     0,    -1,
+  /*0x50-0x57*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x58-0x5F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x60-0x67*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x68-0x6F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x70-0x77*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x78-0x7F*/     0,     0,    -1,     0,    -1,     0,    -1,  -300
+};
+
+static const _pSLint32_Type Table_04128 =
+{
+  /*0x00-0x07*/   195,     0,     0,    -1,     0,    -1,     0,     0,
+  /*0x08-0x0F*/    -1,     0,     0,     0,    -1,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,    -1,     0,     0,    97,     0,     0,
+  /*0x18-0x1F*/     0,    -1,   163,     0,     0,     0,   130,     0,
+  /*0x20-0x27*/     0,    -1,     0,    -1,     0,    -1,     0,     0,
+  /*0x28-0x2F*/    -1,     0,     0,     0,     0,    -1,     0,     0,
+  /*0x30-0x37*/    -1,     0,     0,     0,    -1,     0,    -1,     0,
+  /*0x38-0x3F*/     0,    -1,     0,     0,     0,    -1,     0,    56,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,    -1,    -2,     0,
+  /*0x48-0x4F*/    -1,    -2,     0,    -1,    -2,     0,    -1,     0,
+  /*0x50-0x57*/    -1,     0,    -1,     0,    -1,     0,    -1,     0,
+  /*0x58-0x5F*/    -1,     0,    -1,     0,    -1,   -79,     0,    -1,
+  /*0x60-0x67*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x68-0x6F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x70-0x77*/     0,     0,    -1,    -2,     0,    -1,     0,     0,
+  /*0x78-0x7F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1
+};
+
+static const _pSLint32_Type Table_05128 =
+{
+  /*0x00-0x07*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x08-0x0F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x10-0x17*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x18-0x1F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x20-0x27*/     0,     0,     0,    -1,     0,    -1,     0,    -1,
+  /*0x28-0x2F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x30-0x37*/     0,    -1,     0,    -1,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,    -1,     0,     0,  10815,
+  /*0x40-0x47*/  10815,     0,    -1,     0,     0,     0,     0,    -1,
+  /*0x48-0x4F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x50-0x57*/  10783,  10780,  10782,  -210,  -206,     0,  -205,  -205,
+  /*0x58-0x5F*/     0,  -202,     0,  -203,  42319,     0,     0,     0,
+  /*0x60-0x67*/  -205,  42315,     0,  -207,     0,  42280,  42308,     0,
+  /*0x68-0x6F*/  -209,  -211,  42308,  10743,  42305,     0,     0,  -211,
+  /*0x70-0x77*/     0,  10749,  -213,     0,     0,  -214,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,  10727,     0,     0
+};
+
+static const _pSLint32_Type Table_06128 =
+{
+  /*0x00-0x07*/  -218,     0,     0,  -218,     0,     0,     0,  42282,
+  /*0x08-0x0F*/  -218,   -69,  -217,  -217,   -71,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,  -219,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,  42261,  42258,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_07128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,    84,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,    -1,     0,    -1,     0,     0,     0,    -1,
+  /*0x78-0x7F*/     0,     0,     0,   130,   130,   130,     0,     0
+};
+
+static const _pSLint32_Type Table_08128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,   -38,   -37,   -37,   -37,
+  /*0x30-0x37*/     0,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x38-0x3F*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x40-0x47*/   -32,   -32,   -31,   -32,   -32,   -32,   -32,   -32,
+  /*0x48-0x4F*/   -32,   -32,   -32,   -32,   -64,   -63,   -63,     0,
+  /*0x50-0x57*/   -62,   -57,     0,     0,     0,   -47,   -54,    -8,
+  /*0x58-0x5F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x60-0x67*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x68-0x6F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x70-0x77*/   -86,   -80,     7,  -116,     0,   -96,     0,     0,
+  /*0x78-0x7F*/    -1,     0,     0,    -1,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_09128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x38-0x3F*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x40-0x47*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x48-0x4F*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x50-0x57*/   -80,   -80,   -80,   -80,   -80,   -80,   -80,   -80,
+  /*0x58-0x5F*/   -80,   -80,   -80,   -80,   -80,   -80,   -80,   -80,
+  /*0x60-0x67*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x68-0x6F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x70-0x77*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x78-0x7F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1
+};
+
+static const _pSLint32_Type Table_10128 =
+{
+  /*0x00-0x07*/     0,    -1,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,    -1,     0,    -1,     0,    -1,
+  /*0x10-0x17*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x18-0x1F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x20-0x27*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x28-0x2F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x30-0x37*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x38-0x3F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x40-0x47*/     0,     0,    -1,     0,    -1,     0,    -1,     0,
+  /*0x48-0x4F*/    -1,     0,    -1,     0,    -1,     0,    -1,   -15,
+  /*0x50-0x57*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x58-0x5F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x60-0x67*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x68-0x6F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x70-0x77*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x78-0x7F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1
+};
+
+static const _pSLint32_Type Table_11128 =
+{
+  /*0x00-0x07*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x08-0x0F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x10-0x17*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x18-0x1F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x20-0x27*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x28-0x2F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,   -48,   -48,   -48,   -48,   -48,   -48,   -48,
+  /*0x68-0x6F*/   -48,   -48,   -48,   -48,   -48,   -48,   -48,   -48,
+  /*0x70-0x77*/   -48,   -48,   -48,   -48,   -48,   -48,   -48,   -48,
+  /*0x78-0x7F*/   -48,   -48,   -48,   -48,   -48,   -48,   -48,   -48
+};
+
+static const _pSLint32_Type Table_12128 =
+{
+  /*0x00-0x07*/   -48,   -48,   -48,   -48,   -48,   -48,   -48,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_13128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/    -8,    -8,    -8,    -8,    -8,    -8,     0,     0
+};
+
+static const _pSLint32_Type Table_14128 =
+{
+  /*0x00-0x07*/ -6254, -6253, -6244, -6242, -6242, -6243, -6236, -6181,
+  /*0x08-0x0F*/  35266,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_15128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,  35332,     0,     0,     0,  3814,     0,     0
+};
+
+static const _pSLint32_Type Table_16128 =
+{
+  /*0x00-0x07*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x08-0x0F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x10-0x17*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x18-0x1F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x20-0x27*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x28-0x2F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x30-0x37*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x38-0x3F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x40-0x47*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x48-0x4F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x50-0x57*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x58-0x5F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x60-0x67*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x68-0x6F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x70-0x77*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x78-0x7F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1
+};
+
+static const _pSLint32_Type Table_17128 =
+{
+  /*0x00-0x07*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x08-0x0F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x10-0x17*/     0,    -1,     0,    -1,     0,    -1,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,   -59,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x28-0x2F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x30-0x37*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x38-0x3F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x40-0x47*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x48-0x4F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x50-0x57*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x58-0x5F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x60-0x67*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x68-0x6F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x70-0x77*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x78-0x7F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1
+};
+
+static const _pSLint32_Type Table_18128 =
+{
+  /*0x00-0x07*/     8,     8,     8,     8,     8,     8,     8,     8,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     8,     8,     8,     8,     8,     8,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     8,     8,     8,     8,     8,     8,     8,     8,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     8,     8,     8,     8,     8,     8,     8,     8,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     8,     8,     8,     8,     8,     8,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     8,     0,     8,     0,     8,     0,     8,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     8,     8,     8,     8,     8,     8,     8,     8,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/    74,    74,    86,    86,    86,    86,   100,   100,
+  /*0x78-0x7F*/   128,   128,   112,   112,   126,   126,     0,     0
+};
+
+static const _pSLint32_Type Table_19128 =
+{
+  /*0x00-0x07*/     8,     8,     8,     8,     8,     8,     8,     8,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     8,     8,     8,     8,     8,     8,     8,     8,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     8,     8,     8,     8,     8,     8,     8,     8,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     8,     8,     0,     9,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0, -7205,     0,
+  /*0x40-0x47*/     0,     0,     0,     9,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     8,     8,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     8,     8,     0,     0,     0,     7,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     9,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_20128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,   -28,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/   -16,   -16,   -16,   -16,   -16,   -16,   -16,   -16,
+  /*0x78-0x7F*/   -16,   -16,   -16,   -16,   -16,   -16,   -16,   -16
+};
+
+static const _pSLint32_Type Table_21128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,    -1,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_22128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/   -26,   -26,   -26,   -26,   -26,   -26,   -26,   -26,
+  /*0x58-0x5F*/   -26,   -26,   -26,   -26,   -26,   -26,   -26,   -26,
+  /*0x60-0x67*/   -26,   -26,   -26,   -26,   -26,   -26,   -26,   -26,
+  /*0x68-0x6F*/   -26,   -26,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_23128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/   -48,   -48,   -48,   -48,   -48,   -48,   -48,   -48,
+  /*0x38-0x3F*/   -48,   -48,   -48,   -48,   -48,   -48,   -48,   -48,
+  /*0x40-0x47*/   -48,   -48,   -48,   -48,   -48,   -48,   -48,   -48,
+  /*0x48-0x4F*/   -48,   -48,   -48,   -48,   -48,   -48,   -48,   -48,
+  /*0x50-0x57*/   -48,   -48,   -48,   -48,   -48,   -48,   -48,   -48,
+  /*0x58-0x5F*/   -48,   -48,   -48,   -48,   -48,   -48,   -48,     0,
+  /*0x60-0x67*/     0,    -1,     0,     0,     0, -10795, -10792,     0,
+  /*0x68-0x6F*/    -1,     0,    -1,     0,    -1,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,    -1,     0,     0,    -1,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_24128 =
+{
+  /*0x00-0x07*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x08-0x0F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x10-0x17*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x18-0x1F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x20-0x27*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x28-0x2F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x30-0x37*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x38-0x3F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x40-0x47*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x48-0x4F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x50-0x57*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x58-0x5F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x60-0x67*/     0,    -1,     0,    -1,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,    -1,     0,    -1,     0,
+  /*0x70-0x77*/     0,     0,     0,    -1,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_25128 =
+{
+  /*0x00-0x07*/ -7264, -7264, -7264, -7264, -7264, -7264, -7264, -7264,
+  /*0x08-0x0F*/ -7264, -7264, -7264, -7264, -7264, -7264, -7264, -7264,
+  /*0x10-0x17*/ -7264, -7264, -7264, -7264, -7264, -7264, -7264, -7264,
+  /*0x18-0x1F*/ -7264, -7264, -7264, -7264, -7264, -7264, -7264, -7264,
+  /*0x20-0x27*/ -7264, -7264, -7264, -7264, -7264, -7264,     0, -7264,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0, -7264,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_26128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x48-0x4F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x50-0x57*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x58-0x5F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x60-0x67*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x68-0x6F*/     0,    -1,     0,    -1,     0,    -1,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_27128 =
+{
+  /*0x00-0x07*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x08-0x0F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x10-0x17*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x18-0x1F*/     0,    -1,     0,    -1,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_28128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,    -1,     0,    -1,     0,    -1,
+  /*0x28-0x2F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x30-0x37*/     0,     0,     0,    -1,     0,    -1,     0,    -1,
+  /*0x38-0x3F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x40-0x47*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x48-0x4F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x50-0x57*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x58-0x5F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x60-0x67*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x68-0x6F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,    -1,     0,    -1,     0,     0,    -1
+};
+
+static const _pSLint32_Type Table_29128 =
+{
+  /*0x00-0x07*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x08-0x0F*/     0,     0,     0,     0,    -1,     0,     0,     0,
+  /*0x10-0x17*/     0,    -1,     0,    -1,     0,     0,     0,    -1,
+  /*0x18-0x1F*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x20-0x27*/     0,    -1,     0,    -1,     0,    -1,     0,    -1,
+  /*0x28-0x2F*/     0,    -1,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,    -1,     0,    -1,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_30128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,  -928,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/ -38864, -38864, -38864, -38864, -38864, -38864, -38864, -38864,
+  /*0x78-0x7F*/ -38864, -38864, -38864, -38864, -38864, -38864, -38864, -38864
+};
+
+static const _pSLint32_Type Table_31128 =
+{
+  /*0x00-0x07*/ -38864, -38864, -38864, -38864, -38864, -38864, -38864, -38864,
+  /*0x08-0x0F*/ -38864, -38864, -38864, -38864, -38864, -38864, -38864, -38864,
+  /*0x10-0x17*/ -38864, -38864, -38864, -38864, -38864, -38864, -38864, -38864,
+  /*0x18-0x1F*/ -38864, -38864, -38864, -38864, -38864, -38864, -38864, -38864,
+  /*0x20-0x27*/ -38864, -38864, -38864, -38864, -38864, -38864, -38864, -38864,
+  /*0x28-0x2F*/ -38864, -38864, -38864, -38864, -38864, -38864, -38864, -38864,
+  /*0x30-0x37*/ -38864, -38864, -38864, -38864, -38864, -38864, -38864, -38864,
+  /*0x38-0x3F*/ -38864, -38864, -38864, -38864, -38864, -38864, -38864, -38864,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_32128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x48-0x4F*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x50-0x57*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x58-0x5F*/   -32,   -32,   -32,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_33128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/   -40,   -40,   -40,   -40,   -40,   -40,   -40,   -40,
+  /*0x30-0x37*/   -40,   -40,   -40,   -40,   -40,   -40,   -40,   -40,
+  /*0x38-0x3F*/   -40,   -40,   -40,   -40,   -40,   -40,   -40,   -40,
+  /*0x40-0x47*/   -40,   -40,   -40,   -40,   -40,   -40,   -40,   -40,
+  /*0x48-0x4F*/   -40,   -40,   -40,   -40,   -40,   -40,   -40,   -40,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_34128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/   -40,   -40,   -40,   -40,   -40,   -40,   -40,   -40,
+  /*0x60-0x67*/   -40,   -40,   -40,   -40,   -40,   -40,   -40,   -40,
+  /*0x68-0x6F*/   -40,   -40,   -40,   -40,   -40,   -40,   -40,   -40,
+  /*0x70-0x77*/   -40,   -40,   -40,   -40,   -40,   -40,   -40,   -40,
+  /*0x78-0x7F*/   -40,   -40,   -40,   -40,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_35128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/   -64,   -64,   -64,   -64,   -64,   -64,   -64,   -64,
+  /*0x48-0x4F*/   -64,   -64,   -64,   -64,   -64,   -64,   -64,   -64,
+  /*0x50-0x57*/   -64,   -64,   -64,   -64,   -64,   -64,   -64,   -64,
+  /*0x58-0x5F*/   -64,   -64,   -64,   -64,   -64,   -64,   -64,   -64,
+  /*0x60-0x67*/   -64,   -64,   -64,   -64,   -64,   -64,   -64,   -64,
+  /*0x68-0x6F*/   -64,   -64,   -64,   -64,   -64,   -64,   -64,   -64,
+  /*0x70-0x77*/   -64,   -64,   -64,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_36128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x28-0x2F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x30-0x37*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x38-0x3F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x40-0x47*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x48-0x4F*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x50-0x57*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x58-0x5F*/   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+static const _pSLint32_Type Table_37128 =
+{
+  /*0x00-0x07*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x08-0x0F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x10-0x17*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x18-0x1F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x20-0x27*/     0,     0,   -34,   -34,   -34,   -34,   -34,   -34,
+  /*0x28-0x2F*/   -34,   -34,   -34,   -34,   -34,   -34,   -34,   -34,
+  /*0x30-0x37*/   -34,   -34,   -34,   -34,   -34,   -34,   -34,   -34,
+  /*0x38-0x3F*/   -34,   -34,   -34,   -34,   -34,   -34,   -34,   -34,
+  /*0x40-0x47*/   -34,   -34,   -34,   -34,     0,     0,     0,     0,
+  /*0x48-0x4F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x50-0x57*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x58-0x5F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x60-0x67*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x68-0x6F*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x70-0x77*/     0,     0,     0,     0,     0,     0,     0,     0,
+  /*0x78-0x7F*/     0,     0,     0,     0,     0,     0,     0,     0
+};
+
+const _pSLint32_Type *_pSLwc_Toupper_Table979 =
+{
+  Table_01,  Table_02,  Table_03,  Table_04,  Table_05,  Table_06,
+  Table_07,  Table_08,  Table_09,  Table_10,  Table_11,  Table_12,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_13,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_14,  Table_15,  Table_00,
+  Table_16,  Table_17,  Table_18,  Table_19,  Table_00,  Table_00,
+  Table_20,  Table_21,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_22,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_23,  Table_24,
+  Table_25,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_26,  Table_27,  Table_28,  Table_29,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_30,  Table_31,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_32,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_33,  Table_34,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_35,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_36,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,  Table_00,
+  Table_37
+};
+#endif /* DEFINE_PSLWC_TOUPPER_TABLE */

_service:tar_scm:slang-2.3.2.tar.bz2/src/slutf8.c Added

@@ -0,0 +1,853 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include "slinclud.h"
+#include <string.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+static unsigned char Len_Map256 =
+{
+ 0,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, /* - 31 */
+ 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, /* - 63 */
+ 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, /* - 95 */
+ 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, /* - 127 */
+ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* - 159 */
+ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* - 191 */
+ 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, /* - 223 */
+ 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,6,6,1,1 /* - 255 */
+};
+
+/*
+ * Also note that the code positions U+D800 to U+DFFF (UTF-16 surrogates)
+ * as well as U+FFFE and U+FFFF must not occur in normal UTF-8 or UCS-4
+ * data. UTF-8 decoders should treat them like malformed or overlong
+ * sequences for safety reasons.
+ */
+#define IS_ILLEGAL_UNICODE(w) \
+ (((w >= 0xD800) && (w <= 0xDFFF)) || (w == 0xFFFE) || (w == 0xFFFF))
+
+_INLINE_
+static int is_invalid_or_overlong_utf8 (SLuchar_Type *u, unsigned int len)
+{
+ unsigned int i;
+ unsigned char ch, ch1;
+
+ /* Check for invalid sequences */
+ for (i = 1; i < len; i++)
+ {
+	if ((ui & 0xC0) != 0x80)
+	 return 1;
+ }
+
+ /* Illegal (overlong) sequences */
+ /* 1100000x (10xxxxxx) */
+ /* 11100000 100xxxxx (10xxxxxx) */
+ /* 11110000 1000xxxx (10xxxxxx 10xxxxxx) */
+ /* 11111000 10000xxx (10xxxxxx 10xxxxxx 10xxxxxx) */
+ /* 11111100 100000xx (10xxxxxx 10xxxxxx 10xxxxxx 10xxxxxx) */
+ ch = *u;
+ if ((ch == 0xC0) || (ch == 0xC1))
+ return 1;
+
+ ch1 = u1;
+ if (((ch1 & ch) == 0x80)
+ && ((ch == 0xE0)
+	 || (ch == 0xF0)
+	 || (ch == 0xF8)
+	 || (ch == 0xFC)))
+ return 1;
+
+ if (len == 3)
+ {
+	/* D800 is encoded as 0xED 0xA0 0x80 and DFFF as 0xED 0xBF 0xBF */
+	if ((ch == 0xED)
+	 && ((ch1 >= 0xA0) && (ch1 <= 0xBF))
+	 && (u2 >= 0x80) && (u2 <= 0xBF))
+	 return 1;
+	/* Now FFFE and FFFF */
+	if ((ch == 0xEF)
+	 && (ch1 == 0xBF)
+	 && ((u2 == 0xBE) || (u2 == 0xBF)))
+	 return 1;
+ }
+ return 0;
+}
+
+/* This function assumes that the necessary checks have been made to ensure
+ * a valid UTF-8 encoded character is present.
+ */
+_INLINE_
+static SLwchar_Type fast_utf8_decode (SLuchar_Type *u, unsigned int len)
+{
+ static unsigned char masks7 =
+ {
+	0, 0, 0x1F, 0xF, 0x7, 0x3, 0x1
+ };
+ SLuchar_Type *umax;
+ SLwchar_Type w;
+
+ w = (*u & maskslen);
+ umax = u + len;
+ u++;
+ while (u < umax)
+ {
+	w = (w << 6)| (u0 & 0x3F);
+	u++;
+ }
+ return w;
+}
+
+unsigned char *SLutf8_skip_char (unsigned char *s, unsigned char *smax)
+{
+ unsigned int len;
+
+ if (s >= smax)
+ return s;
+
+ len = Len_Map*s;
+ if (len <= 1)
+ return s+1;
+
+ if (s + len > smax)
+ return s+1;
+
+ if (is_invalid_or_overlong_utf8 (s, len))
+ return s + 1;
+
+ return s + len;
+}
+
+SLuchar_Type *SLutf8_skip_chars (SLuchar_Type *s, SLuchar_Type *smax,
+				 SLstrlen_Type num, SLstrlen_Type *dnum,
+				 int ignore_combining)
+{
+ SLstrlen_Type n;
+
+ n = 0;
+ while ((n < num) && (s < smax))
+ {
+	unsigned int len = Len_Map*s;
+
+	if (len <= 1)
+	 {
+	 n++;
+	 s++;
+	 continue;
+	 }
+
+	if (s + len > smax)
+	 {
+	 s++;
+	 n++;
+	 continue;
+	 }
+
+	if (is_invalid_or_overlong_utf8 (s, len))
+	 {
+	 s++;
+	 n++;
+	 continue;
+	 }
+
+	if (ignore_combining)
+	 {
+	 SLwchar_Type w = fast_utf8_decode (s, len);
+	 if (0 != SLwchar_wcwidth (w))
+	 n++;
+	 s += len;
+	 continue;
+	 }
+
+	n++;
+	s += len;
+ }
+
+ if (ignore_combining)
+ {
+	while (s < smax)
+	 {
+	 SLwchar_Type w;
+	 SLstrlen_Type nconsumed;
+	 if (NULL == SLutf8_decode (s, smax, &w, &nconsumed))
+	 break;
+
+	 if (0 != SLwchar_wcwidth (w))
+	 break;
+
+	 s += nconsumed;
+	 }
+ }
+
+ if (dnum != NULL)
+ *dnum = n;
+ return s;
+}
+
+SLuchar_Type *SLutf8_bskip_chars (SLuchar_Type *smin, SLuchar_Type *s,
+				 SLstrlen_Type num, SLstrlen_Type *dnum,
+				 int ignore_combining)
+{
+ SLstrlen_Type n;
+ SLuchar_Type *smax = s;
+
+ n = 0;
+ while ((n < num) && (s > smin))
+ {
+	unsigned char ch;
+	unsigned int dn;
+
+	s--;
+	ch = *s;
+	if (ch < 0x80)
+	 {
+	 n++;
+	 smax = s;
+	 continue;
+	 }
+
+	dn = 0;
+	while ((s != smin)
+	 && (Len_Mapch == 0)
+	 && (dn < SLUTF8_MAX_MBLEN))
+	 {
+	 s--;
+	 ch = *s;
+	 dn++;
+	 }
+
+	if (ch <= 0xBF)
+	 {
+	 /* Invalid sequence */
+	 n++;
+	 smax--;
+	 s = smax;
+	 continue;
+	 }
+
+	if (ch > 0xBF)
+	 {
+	 SLwchar_Type w;
+	 SLuchar_Type *s1;
+
+	 if ((NULL == (s1 = SLutf8_decode (s, smax, &w, NULL)))
+		 || (s1 != smax))
+	 {
+		 /* This means we backed up over an invalid sequence */
+		 dn = (unsigned int) (smax - s);
+		 n++;
+		 smax--;
+		 s = smax;
+		 continue;
+	 }
+
+	 if ((ignore_combining == 0)
+		 || (0 != SLwchar_wcwidth (w)))
+	 n++;
+
+	 smax = s;
+	 }
+ }
+
+ if (dnum != NULL)
+ *dnum = n;
+ return s;
+}
+
+SLuchar_Type *SLutf8_bskip_char (SLuchar_Type *smin, SLuchar_Type *s)
+{
+ if (s > smin)
+ {
+	SLstrlen_Type dn;
+
+	s--;
+	if (*s >= 0x80)
+	 s = SLutf8_bskip_chars (smin, s+1, 1, &dn, 0);
+ }
+ return s;
+}
+
+/* This function counts the number of wide characters in a UTF-8 encoded
+ * string. Each byte in an invalid sequence is counted as a single
+ * character. If the string contains illegal values, the illegal byte
+ * is counted as 1 character.
+ */
+SLstrlen_Type SLutf8_strlen (SLuchar_Type *s, int ignore_combining)
+{
+ SLstrlen_Type count, len;
+
+ if (s == NULL)
+ return 0;
+
+ len = strlen ((char *)s);
+ (void) SLutf8_skip_chars (s, s + len, len, &count, ignore_combining);
+ return count;
+}
+
+/*
+ * This function returns NULL if the input does not correspond to a valid
+ * UTF-8 sequence, otherwise, it returns the position of the next character
+ * in the sequence.
+ */
+unsigned char *SLutf8_decode (unsigned char *u, unsigned char *umax,
+			 SLwchar_Type *wp, SLstrlen_Type *nconsumedp)
+{
+ unsigned int len;
+ unsigned char ch;
+ SLwchar_Type w;
+
+ if (u >= umax)
+ {
+	*wp = 0;
+	if (nconsumedp != NULL)
+	 *nconsumedp = 0;
+	return NULL;
+ }
+
+ *wp = ch = *u;
+ if (ch < 0x80)
+ {
+	if (nconsumedp != NULL) *nconsumedp = 1;
+	return u+1;
+ }
+
+ len = Len_Mapch;
+ if (len < 2)
+ {
+	/* should not happen--- code here for completeness */
+	if (nconsumedp != NULL) *nconsumedp = 1;
+	return NULL;
+ }
+ if (u + len > umax)
+ {
+	if (nconsumedp != NULL) *nconsumedp = 1; /* (unsigned int) (umax - u); */
+	return NULL;
+ }
+
+ if (is_invalid_or_overlong_utf8 (u, len))
+ {
+	if (nconsumedp != NULL)
+	 *nconsumedp = 1;
+
+	return NULL;
+ }
+
+ if (nconsumedp != NULL)
+ *nconsumedp = len;
+
+ *wp = w = fast_utf8_decode (u, len);
+
+ if (IS_ILLEGAL_UNICODE(w))
+ return NULL;
+
+ return u + len;
+}
+
+/* Encode the wide character returning a pointer to the end of the
+ * utf8 of the encoded multi-byte character. This function will also encode
+ * illegal unicode values. It returns NULL if buflen is too small.
+ * Otherwise, it returns a pointer at the end of the last encoded byte.
+ * It does not null terminate the encoded string.
+ */
+SLuchar_Type *SLutf8_encode (SLwchar_Type w, SLuchar_Type *u, SLstrlen_Type ulen)
+{
+ SLuchar_Type *umax = u + ulen;
+
+ /* U-00000000 - U-0000007F: 0xxxxxxx */
+ if (w <= 0x7F)
+ {
+	if (u >= umax)
+	 return NULL;
+
+	*u++ = (unsigned char) w;
+	return u;
+ }
+
+ /* U-00000080 - U-000007FF: 110xxxxx 10xxxxxx */
+ if (w <= 0x7FF)
+ {
+	if ((u + 1) >= umax)
+	 return NULL;
+
+	*u++ = (w >> 6) | 0xC0;
+	*u++ = (w & 0x3F) | 0x80;
+	return u;
+ }
+
+ /* First bad character starts at 0xD800 */
+
+ /* Allow illegal values to be encoded */
+
+ /*
+ *if (IS_ILLEGAL_UNICODE(w))
+ * return NULL;
+ */
+
+ /* U-00000800 - U-0000FFFF: 1110xxxx 10xxxxxx 10xxxxxx */
+ if (w <= 0xFFFF)
+ {
+	if (u+2 >= umax)
+	 return NULL;
+	*u++ = (w >> 12 ) | 0xE0;
+	goto finish_2;
+ }
+
+ /* U-00010000 - U-001FFFFF: 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx */
+ if (w <= 0x1FFFFF)
+ {
+	if (u+3 >= umax)
+	 return NULL;
+	*u++ = (w >> 18) | 0xF0;
+	goto finish_3;
+ }
+
+ /* U-00200000 - U-03FFFFFF: 111110xx 10xxxxxx 10xxxxxx 10xxxxxx 10xxxxxx */
+ if (w <= 0x3FFFFFF)
+ {
+	if (u+4 >= umax)
+	 return NULL;
+	*u++ = (w >> 24) | 0xF8;
+	goto finish_4;
+ }
+
+ /* U-04000000 - U-7FFFFFFF: 1111110x 10xxxxxx 10xxxxxx 10xxxxxx 10xxxxxx 10xxxxxx */
+ if (w <= 0x7FFFFFFF)
+ {
+	if (u+5 >= umax)
+	 return NULL;
+	*u++ = (w >> 30) | 0xFC;
+	goto finish_5;
+ }
+
+ /* unreached?? */
+ return NULL;
+
+ finish_5: *u++ = ((w >> 24) & 0x3F)|0x80;
+ finish_4: *u++ = ((w >> 18) & 0x3F)|0x80;
+ finish_3: *u++ = ((w >> 12) & 0x3F)|0x80;
+ finish_2: *u++ = ((w >> 6) & 0x3F)|0x80;
+ *u++ = (w & 0x3F)|0x80;
+
+ return u;
+}
+
+/* Like SLutf8_encode, but null terminates the result.
+ * At least SLUTF8_MAX_MBLEN+1 bytes assumed.
+ */
+SLuchar_Type *SLutf8_encode_null_terminate (SLwchar_Type w, SLuchar_Type *u)
+{
+ SLuchar_Type *p;
+
+ p = SLutf8_encode (w, u, SLUTF8_MAX_MBLEN);
+ if (p != NULL)
+ *p = 0;
+ return p;
+}
+
+#if 0
+int SLutf8_decode_bytes (SLuchar_Type *u, SLuchar_Type *umax,
+			 unsigned char *b, unsigned int *np)
+{
+ unsigned char *bmax;
+
+ bmax = b;
+ while (u < umax)
+ {
+	SLwchar_Type w;
+
+	if (0 == (*u & 0x80))
+	 {
+	 *bmax++ = *u++;
+	 continue;
+	 }
+
+	if (NULL == (u = SLutf8_decode (u, umax, &w, NULL)))
+	 return -1;		 /* FIXME: HANDLE ERROR */
+
+	if (w > 0xFF)
+	 {
+#if 0
+	 sprintf (bmax, "<U+%04X>", w);
+	 bmax += strlen (bmax);
+	 continue;
+#endif
+	 /* FIXME: HANDLE ERROR */
+	 w = w & 0xFF;
+	 }
+
+	*bmax++ = w;
+ }
+ *np = bmax - b;
+ *bmax = 0;
+ return 0;
+}
+
+/* UTF-8 Encode the bytes between b and bmax storing the results in the
+ * buffer defined by u and umax, returning the position following the
+ * last encoded character. Upon return, *np is set to the number of bytes
+ * sucessfully encoded.
+ */
+SLuchar_Type *SLutf8_encode_bytes (unsigned char *b, unsigned char *bmax,
+				 SLuchar_Type *u, unsigned int ulen,
+				 unsigned int *np)
+{
+ unsigned char *bstart = b;
+ SLuchar_Type *umax = u + ulen;
+
+ while (b < bmax)
+ {
+	SLuchar_Type *u1;
+
+	if (0 == (*b & 0x80))
+	 {
+	 if (u >= umax)
+	 break;
+
+	 *u++ = *b++;
+	 continue;
+	 }
+
+	if (NULL == (u1 = SLutf8_encode (*b, u, umax - u)))
+	 break;
+	u = u1;
+	b++;
+ }
+
+ *np = b - bstart;
+ if (u < umax)
+ *u = 0;
+
+ return u;
+}
+#endif
+
+static SLuchar_Type *xform_utf8 (SLuchar_Type *u, SLuchar_Type *umax,
+ SLwchar_Type (*fun)(SLwchar_Type))
+{
+ SLuchar_Type *buf, *p;
+ size_t malloced_len, len;
+
+ if (umax < u)
+ return NULL;
+
+ len = 0;
+ p = buf = NULL;
+ malloced_len = 0;
+
+ while (1)
+ {
+ SLwchar_Type w;
+ SLuchar_Type *u1;
+ SLstrlen_Type nconsumed;
+
+ if (malloced_len <= len + SLUTF8_MAX_MBLEN)
+ {
+ SLuchar_Type *newbuf;
+ malloced_len += 1 + (umax - u) + SLUTF8_MAX_MBLEN;
+
+ newbuf = (SLuchar_Type *)SLrealloc ((char *)buf, malloced_len);
+ if (newbuf == NULL)
+ {
+ SLfree ((char *)buf);
+ return NULL;
+ }
+ buf = newbuf;
+ p = buf + len;
+ }
+
+ if (u >= umax)
+ {
+ *p = 0;
+ p = (SLuchar_Type *) SLang_create_nslstring ((char *)buf, len);
+ SLfree ((char *)buf);
+ return p;
+ }
+
+ if (NULL == (u1 = SLutf8_decode (u, umax, &w, &nconsumed)))
+ {
+ /* Invalid sequence */
+ memcpy ((char *) p, u, nconsumed);
+ p += nconsumed;
+ len += nconsumed;
+ u1 = u + nconsumed;
+ }
+ else
+ {
+ SLuchar_Type *p1;
+
+ p1 = SLutf8_encode ((*fun)(w), p, malloced_len);
+ if (p1 == NULL)
+ {
+ SLfree ((char *)buf);
+ _pSLang_verror (SL_INTERNAL_ERROR, "SLutf8_encode returned NULL");
+ return NULL;
+ }
+ len += p1 - p;
+ p = p1;
+ }
+
+ u = u1;
+ }
+}
+
+/* Returned an uppercased version of an UTF-8 encoded string. Illegal or
+ * invalid sequences will be returned as-is. This function returns
+ * an SLstring.
+ */
+SLuchar_Type *SLutf8_strup (SLuchar_Type *u, SLuchar_Type *umax)
+{
+ return xform_utf8 (u, umax, SLwchar_toupper);
+}
+
+/* Returned an lowercased version of an UTF-8 encoded string. Illegal or
+ * invalid sequences will be returned as-is. This function returns
+ * an SLstring.
+ */
+SLuchar_Type *SLutf8_strlo (SLuchar_Type *u, SLuchar_Type *umax)
+{
+ return xform_utf8 (u, umax, SLwchar_tolower);
+}
+
+int SLutf8_compare (SLuchar_Type *a, SLuchar_Type *amax,
+ SLuchar_Type *b, SLuchar_Type *bmax,
+ SLstrlen_Type nchars,
+ int cs)
+{
+ while (nchars && (a < amax) && (b < bmax))
+ {
+ SLwchar_Type cha, chb;
+ SLstrlen_Type na, nb;
+ int aok, bok;
+
+ if (*a < 0x80)
+ {
+ cha = (SLwchar_Type) *a++;
+ aok = 1;
+ }
+ else
+ {
+ aok = (NULL != SLutf8_decode (a, amax, &cha, &na));
+ a += na;
+ }
+
+ if (*b < 0x80)
+ {
+ chb = (SLwchar_Type) *b++;
+ bok = 1;
+ }
+ else
+ {
+ bok = (NULL != SLutf8_decode (b, bmax, &chb, &nb));
+ b += nb;
+ }
+
+ nchars--;
+
+ if (aok && bok)
+ {
+ if (cs == 0)
+ {
+ cha = SLwchar_toupper (cha);
+ chb = SLwchar_toupper (chb);
+ }
+ }
+ else if (aok)
+ return 1;
+ else if (bok)
+ return -1;
+
+ if (cha == chb)
+ continue;
+
+ if (cha > chb)
+ return 1;
+
+ return -1;
+ }
+
+ if (nchars == 0)
+ return 0;
+
+ if ((a >= amax) && (b >= bmax))
+ return 0;
+
+ if (b >= bmax)
+ return 1;
+
+ return -1;
+}
+
+/* Returns an SLstring */
+SLstr_Type *SLutf8_subst_wchar (SLuchar_Type *u, SLuchar_Type *umax,
+				SLwchar_Type wch, SLstrlen_Type pos,
+				int ignore_combining)
+{
+ SLuchar_Type *a, *a1, *b;
+ SLstrlen_Type dpos;
+ SLuchar_Type bufSLUTF8_MAX_MBLEN+1;
+ SLstr_Type *c;
+ SLstrlen_Type n1, n2, n3, len;
+
+ a = SLutf8_skip_chars (u, umax, pos, &dpos, ignore_combining);
+
+ if ((dpos != pos) || (a == umax))
+ {
+	_pSLang_verror (SL_INDEX_ERROR, "Specified character position is invalid for string");
+	return NULL;
+ }
+
+ a1 = SLutf8_skip_chars (a, umax, 1, NULL, ignore_combining);
+
+ b = SLutf8_encode (wch, buf, SLUTF8_MAX_MBLEN);
+ if (b == NULL)
+ {
+	_pSLang_verror (SL_UNICODE_ERROR, "Unable to encode wchar 0x%lX", (unsigned long)wch);
+	return NULL;
+ }
+
+ n1 = (a-u);
+ n2 = (b-buf);
+ n3 = (umax-a1);
+ len = n1 + n2 + n3;
+ c = _pSLallocate_slstring (len);
+ if (c == NULL)
+ return NULL;
+
+ memcpy (c, (char *)u, n1);
+ memcpy (c+n1, (char *)buf, n2);
+ memcpy (c+n1+n2, (char *)a1, n3);
+ clen = 0;
+
+ /* No need to worry about this failing-- it frees its argument */
+ return _pSLcreate_via_alloced_slstring (c, len);
+}
+
+/* utf8 buffer assumed to be at least SLUTF8_MAX_MBLEN+1 bytes. Result will be
+ * null terminated. Returns position of NEXT character.
+ * Analogous to: *p++
+ */
+SLuchar_Type *SLutf8_extract_utf8_char (SLuchar_Type *u,
+					SLuchar_Type *umax,
+					SLuchar_Type *utf8)
+{
+ SLuchar_Type *u1;
+
+ u1 = SLutf8_skip_char (u, umax);
+ memcpy ((char *)utf8, u, u1-u);
+ utf8u1-u = 0;
+
+ return u1;
+}
+
+/* These routines depend upon the value of the _pSLinterp_UTF8_Mode variable.
+ * They also generate slang errors upon error.
+ */
+SLuchar_Type *_pSLinterp_decode_wchar (SLuchar_Type *u,
+				 SLuchar_Type *umax,
+				 SLwchar_Type *chp)
+{
+ if (_pSLinterp_UTF8_Mode == 0)
+ {
+	if (u < umax)
+	 *chp = (SLwchar_Type) *u++;
+	return u;
+ }
+
+ if (NULL == (u = SLutf8_decode (u, umax, chp, NULL)))
+ _pSLang_verror (SL_INVALID_UTF8, "Invalid UTF-8 encoded string");
+
+ return u;
+}
+
+/* At least SLUTF8_MAX_MBLEN+1 bytes assumed-- null terminates result.
+ * Upon success, it returns a pointer to the _end_ of the encoded character
+ */
+SLuchar_Type *_pSLinterp_encode_wchar (SLwchar_Type wch, SLuchar_Type *u, unsigned int *encoded_len)
+{
+ SLuchar_Type *u1;
+
+ if (_pSLinterp_UTF8_Mode == 0)
+ {
+	*encoded_len = 1;
+	*u++ = (SLuchar_Type) wch;
+	*u++ = 0;
+	return u;
+ }
+
+ if (NULL == (u1 = SLutf8_encode_null_terminate (wch, u)))
+ {
+	_pSLang_verror (SL_UNICODE_ERROR, "Unable to encode character 0x%lX", (unsigned long)wch);
+	return NULL;
+ }
+
+ *encoded_len = (unsigned int) (u1 - u);
+ return u1;
+}
+
+#ifdef REGRESSION
+int main (int argc, char **argv)
+{
+ unsigned char *s, *smax;
+ char **t;
+ char *ok_tests =
+ {
+	"í¿",
+	 "î",
+	 "ï¿½",
+	 "ô¿¿",
+	 "ô",
+	 NULL
+ };
+ char *long_tests =
+ {
+	"À¯",
+	 "à¯",
+	 "ð¯",
+	 "ø¯",
+	 "ü¯",
+	 NULL
+ };
+
+ t = long_tests;
+ while ((s = (unsigned char *) *t++) != NULL)
+ {
+	smax = s + strlen ((char *)s);
+
+	while (s < smax)
+	 {
+	 SLwchar_Type w;
+
+	 if (NULL == (s = SLutf8_to_wc (s, smax, &w)))
+	 {
+		 fprintf (stderr, "SLutf8_to_wc failed\n");
+		 break;
+	 }
+	 if (w == 0)
+	 break;
+	 fprintf (stdout, " 0x%X", w);
+	 }
+
+	fprintf (stdout, "\n");
+ }
+ return 0;
+}
+#endif
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slutty.c Added

@@ -0,0 +1,678 @@
+/* slutty.c --- Unix Low level terminal (tty) functions for S-Lang */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include <signal.h>
+/* sequent support thanks to Kenneth Lorber <keni@oasys.dt.navy.mil> */
+/* SYSV (SYSV ISC R3.2 v3.0) provided by iain.lea@erlm.siemens.de */
+
+#if defined (_AIX) && !defined (_ALL_SOURCE)
+# define _ALL_SOURCE	/* so NBBY is defined in <sys/types.h> */
+#endif
+
+#include <sys/time.h>
+#include <sys/types.h>
+
+#ifdef SYSV
+# include <fcntl.h>
+# ifndef CRAY
+# include <sys/termio.h>
+# include <sys/stream.h>
+# include <sys/ptem.h>
+# include <sys/tty.h>
+# endif
+#endif
+
+#if defined(__BEOS__) && !defined(__HAIKU__)
+/* Prototype for select */
+# include <net/socket.h>
+#endif
+
+#include <sys/file.h>
+
+#ifndef sun
+# include <sys/ioctl.h>
+#endif
+
+#if defined(__QNX__) || defined(__HAIKU__)
+# include <sys/select.h>
+#endif
+
+#include <sys/stat.h>
+#include <errno.h>
+
+#if defined (_AIX) && !defined (FD_SET)
+# include <sys/select.h>	/* for FD_ISSET, FD_SET, FD_ZERO */
+#endif
+
+#if !defined(O_RDWR) || !defined(FD_CLOEXEC)
+# include <fcntl.h>
+#endif
+
+#include "slang.h"
+#include "_slang.h"
+
+int SLang_TT_Read_FD = -1;
+int SLang_TT_Baud_Rate = 0;
+
+#ifdef HAVE_TERMIOS_H
+# if !defined(HAVE_TCGETATTR) || !defined(HAVE_TCSETATTR)
+# undef HAVE_TERMIOS_H
+# endif
+#endif
+
+#ifndef HAVE_TERMIOS_H
+
+# if !defined(CBREAK) && defined(sun)
+# ifndef BSD_COMP
+# define BSD_COMP 1
+# endif
+# include <sys/ioctl.h>
+# endif
+
+typedef struct
+ {
+ struct tchars t;
+ struct ltchars lt;
+ struct sgttyb s;
+ }
+TTY_Termio_Type;
+#else
+# include <termios.h>
+typedef struct termios TTY_Termio_Type;
+#endif
+
+static TTY_Termio_Type Old_TTY;
+
+#ifdef HAVE_TERMIOS_H
+typedef SLCONST struct
+{
+ unsigned int key;
+ unsigned int value;
+} Baud_Rate_Type;
+
+static Baud_Rate_Type Baud_Rates =
+{
+#ifdef B0
+ {B0, 0},
+#endif
+#ifdef B50
+ {B50, 50},
+#endif
+#ifdef B75
+ {B75, 75},
+#endif
+#ifdef B110
+ {B110, 110},
+#endif
+#ifdef B134
+ {B134, 134},
+#endif
+#ifdef B150
+ {B150, 150},
+#endif
+#ifdef B200
+ {B200, 200},
+#endif
+#ifdef B300
+ {B300, 300},
+#endif
+#ifdef B600
+ {B600, 600},
+#endif
+#ifdef B1200
+ {B1200, 1200},
+#endif
+#ifdef B1800
+ {B1800, 1800},
+#endif
+#ifdef B2400
+ {B2400, 2400},
+#endif
+#ifdef B4800
+ {B4800, 4800},
+#endif
+#ifdef B9600
+ {B9600, 9600},
+#endif
+#ifdef B19200
+ {B19200, 19200},
+#endif
+#ifdef B38400
+ {B38400, 38400},
+#endif
+#ifdef B57600
+ {B57600, 57600},
+#endif
+#ifdef B115200
+ {B115200, 115200},
+#endif
+#ifdef B230400
+ {B230400, 230400},
+#endif
+#ifdef B460800
+ {B460800, 460800},
+#endif
+#ifdef B500000
+ {B500000, 500000},
+#endif
+#ifdef B576000
+ {B576000, 576000},
+#endif
+#ifdef B921600
+ {B921600, 921600},
+#endif
+#ifdef B1000000
+ {B1000000, 1000000},
+#endif
+#ifdef B1152000
+ {B1152000, 1152000},
+#endif
+#ifdef B1500000
+ {B1500000, 1500000},
+#endif
+#ifdef B2000000
+ {B2000000, 2000000},
+#endif
+#ifdef B2500000
+ {B2500000, 2500000},
+#endif
+#ifdef B3000000
+ {B3000000, 3000000},
+#endif
+#ifdef B3500000
+ {B3500000, 3500000},
+#endif
+#ifdef B4000000
+ {B4000000, 4000000},
+#endif
+ {0, 0}
+};
+
+static void
+set_baud_rate (TTY_Termio_Type *tty)
+{
+#ifdef HAVE_CFGETOSPEED
+ unsigned int speed;
+ Baud_Rate_Type *b, *bmax;
+
+ if (SLang_TT_Baud_Rate)
+ return;			 /* already set */
+
+ speed = (unsigned int) cfgetospeed (tty);
+
+ b = Baud_Rates;
+ bmax = b + (sizeof (Baud_Rates)/sizeof(Baud_Rates0));
+ while (b < bmax)
+ {
+	if (b->key == speed)
+	 {
+	 SLang_TT_Baud_Rate = b->value;
+	 return;
+	 }
+	b++;
+ }
+#else
+ (void) tty;
+#endif
+}
+
+#endif				 /* HAVE_TERMIOS_H */
+
+#ifdef HAVE_TERMIOS_H
+# define GET_TERMIOS(fd, x) tcgetattr(fd, x)
+# define SET_TERMIOS(fd, x) tcsetattr(fd, TCSADRAIN, x)
+#else
+# ifdef TCGETS
+# define GET_TERMIOS(fd, x) ioctl(fd, TCGETS, x)
+# define SET_TERMIOS(fd, x) ioctl(fd, TCSETS, x)
+# else
+# define X(x,m) &(((TTY_Termio_Type *)(x))->m)
+# define GET_TERMIOS(fd, x)	\
+ ((ioctl(fd, TIOCGETC, X(x,t)) || \
+ ioctl(fd, TIOCGLTC, X(x,lt)) || \
+ ioctl(fd, TIOCGETP, X(x,s))) ? -1 : 0)
+# define SET_TERMIOS(fd, x)	\
+ ((ioctl(fd, TIOCSETC, X(x,t)) ||\
+ ioctl(fd, TIOCSLTC, X(x,lt)) || \
+ ioctl(fd, TIOCSETP, X(x,s))) ? -1 : 0)
+# endif
+#endif
+
+static int TTY_Inited = 0;
+static int TTY_Open = 0;
+
+#ifdef ultrix /* Ultrix gets _POSIX_VDISABLE wrong! */
+# define NULL_VALUE -1
+#else
+# ifdef _POSIX_VDISABLE
+# define NULL_VALUE _POSIX_VDISABLE
+# else
+# define NULL_VALUE 255
+# endif
+#endif
+
+/* If no_flow_control < 0, do not change the tty IXON bit */
+int SLang_init_tty (int abort_char, int no_flow_control, int opost)
+{
+ TTY_Termio_Type newtty;
+
+ SLsig_block_signals ();
+
+ if (TTY_Inited)
+ {
+	SLsig_unblock_signals ();
+	return 0;
+ }
+
+ TTY_Open = 0;
+ SLKeyBoard_Quit = 0;
+
+ if ((SLang_TT_Read_FD == -1)
+ || (1 != isatty (SLang_TT_Read_FD)))
+ {
+#ifdef O_RDWR
+# if !defined(__BEOS__) && !defined(__APPLE__)
+	/* I have been told that BEOS will HANG if passed /dev/tty */
+	if ((SLang_TT_Read_FD = open("/dev/tty", O_RDWR)) >= 0)
+	 {
+# ifdef FD_CLOEXEC
+	 /* Make sure /dev/tty is closed upon exec */
+	 int flags = fcntl (SLang_TT_Read_FD, F_GETFD);
+	 if (flags >= 0)
+	 (void) fcntl(SLang_TT_Read_FD, F_SETFD, flags | FD_CLOEXEC);
+# endif
+	 TTY_Open = 1;
+	 }
+# endif
+#endif
+	if (TTY_Open == 0)
+	 {
+	 SLang_TT_Read_FD = fileno (stderr);
+	 if (1 != isatty (SLang_TT_Read_FD))
+	 {
+		 SLang_TT_Read_FD = fileno (stdin);
+		 if (1 != isatty (SLang_TT_Read_FD))
+		 {
+		 fprintf (stderr, "Failed to open terminal.");
+		 return -1;
+		 }
+	 }
+	 }
+ }
+
+ SLang_Abort_Char = abort_char;
+
+ /* Some systems may not permit signals to be blocked. As a result, the
+ * return code must be checked.
+ */
+ while (-1 == GET_TERMIOS(SLang_TT_Read_FD, &Old_TTY))
+ {
+	if (errno != EINTR)
+	 {
+	 SLsig_unblock_signals ();
+	 return -1;
+	 }
+ }
+
+ while (-1 == GET_TERMIOS(SLang_TT_Read_FD, &newtty))
+ {
+	if (errno != EINTR)
+	 {
+	 SLsig_unblock_signals ();
+	 return -1;
+	 }
+ }
+
+#ifndef HAVE_TERMIOS_H
+ (void) opost;
+ (void) no_flow_control;
+ newtty.s.sg_flags &= ~(ECHO);
+ newtty.s.sg_flags &= ~(CRMOD);
+ /* if (Flow_Control == 0) newtty.s.sg_flags &= ~IXON; */
+ newtty.t.t_eofc = 1;
+ if (abort_char == -1) SLang_Abort_Char = newtty.t.t_intrc;
+ newtty.t.t_intrc = SLang_Abort_Char;	/* ^G */
+ newtty.t.t_quitc = 255;
+ newtty.lt.t_suspc = 255; /* to ignore ^Z */
+ newtty.lt.t_dsuspc = 255; /* to ignore ^Y */
+ newtty.lt.t_lnextc = 255;
+ newtty.s.sg_flags |= CBREAK;		/* do I want cbreak or raw????? */
+#else
+
+ /* get baud rate */
+
+ newtty.c_iflag &= ~(ECHO | INLCR | ICRNL);
+#ifdef ISTRIP
+ /* newtty.c_iflag &= ~ISTRIP; */
+#endif
+ if (opost == 0) newtty.c_oflag &= ~OPOST;
+
+ set_baud_rate (&newtty);
+
+ if (no_flow_control > 0)
+ newtty.c_iflag &= ~IXON;
+ else if (no_flow_control == 0)
+ newtty.c_iflag |= IXON;
+
+ newtty.c_ccVEOF = 1;
+ newtty.c_ccVMIN = 1;
+ newtty.c_ccVTIME = 0;
+ newtty.c_lflag = ISIG | NOFLSH;
+ if (abort_char == -1) SLang_Abort_Char = newtty.c_ccVINTR;
+ newtty.c_ccVINTR = SLang_Abort_Char; /* ^G */
+ newtty.c_ccVQUIT = NULL_VALUE;
+ newtty.c_ccVSUSP = NULL_VALUE; /* to ignore ^Z */
+#ifdef VDSUSP
+ newtty.c_ccVDSUSP = NULL_VALUE; /* to ignore ^Y */
+#endif
+#ifdef VLNEXT
+ newtty.c_ccVLNEXT = NULL_VALUE; /* to ignore ^V ? */
+#endif
+#ifdef VSWTCH
+ newtty.c_ccVSWTCH = NULL_VALUE; /* to ignore who knows what */
+#endif
+#endif /* NOT HAVE_TERMIOS_H */
+
+ while (-1 == SET_TERMIOS(SLang_TT_Read_FD, &newtty))
+ {
+	if (errno != EINTR)
+	 {
+	 SLsig_unblock_signals ();
+	 return -1;
+	 }
+ }
+
+ TTY_Inited = 1;
+ SLsig_unblock_signals ();
+ return 0;
+}
+
+void SLtty_set_suspend_state (int mode)
+{
+ TTY_Termio_Type newtty;
+
+ SLsig_block_signals ();
+
+ if (TTY_Inited == 0)
+ {
+	SLsig_unblock_signals ();
+	return;
+ }
+
+ while ((-1 == GET_TERMIOS (SLang_TT_Read_FD, &newtty))
+	 && (errno == EINTR))
+ ;
+
+#ifndef HAVE_TERMIOS_H
+ /* I do not know if all systems define the t_dsuspc field */
+ if (mode == 0)
+ {
+	newtty.lt.t_suspc = 255;
+	newtty.lt.t_dsuspc = 255;
+ }
+ else
+ {
+	newtty.lt.t_suspc = Old_TTY.lt.t_suspc;
+	newtty.lt.t_dsuspc = Old_TTY.lt.t_dsuspc;
+ }
+#else
+ if (mode == 0)
+ {
+	newtty.c_ccVSUSP = NULL_VALUE;
+#ifdef VDSUSP
+	newtty.c_ccVDSUSP = NULL_VALUE;
+#endif
+ }
+ else
+ {
+	newtty.c_ccVSUSP = Old_TTY.c_ccVSUSP;
+#ifdef VDSUSP
+	newtty.c_ccVDSUSP = Old_TTY.c_ccVDSUSP;
+#endif
+ }
+#endif
+
+ while ((-1 == SET_TERMIOS (SLang_TT_Read_FD, &newtty))
+	 && (errno == EINTR))
+ ;
+
+ SLsig_unblock_signals ();
+}
+
+void SLang_reset_tty (void)
+{
+ SLsig_block_signals ();
+
+ if (TTY_Inited == 0)
+ {
+	SLsig_unblock_signals ();
+	return;
+ }
+
+ while ((-1 == SET_TERMIOS(SLang_TT_Read_FD, &Old_TTY))
+	 && (errno == EINTR))
+ ;
+
+ if (TTY_Open)
+ {
+	(void) close (SLang_TT_Read_FD);
+
+	TTY_Open = 0;
+	SLang_TT_Read_FD = -1;
+ }
+
+ TTY_Inited = 0;
+ SLsig_unblock_signals ();
+}
+
+static void default_sigint (int sig)
+{
+ sig = errno;			 /* use parameter */
+
+ SLKeyBoard_Quit = 1;
+ if (SLang_Ignore_User_Abort == 0) SLang_set_error (SL_USER_BREAK);
+ SLsignal_intr (SIGINT, default_sigint);
+ errno = sig;
+}
+
+int SLang_set_abort_signal (void (*hand)(int))
+{
+ int save_errno = errno;
+ SLSig_Fun_Type *f;
+
+ if (hand == NULL) hand = default_sigint;
+ f = SLsignal_intr (SIGINT, hand);
+
+ errno = save_errno;
+
+ if (f == (SLSig_Fun_Type *) SIG_ERR)
+ return -1;
+
+ return 0;
+}
+
+#ifndef FD_SET
+#define FD_SET(fd, tthis) *(tthis) = 1 << (fd)
+#define FD_ZERO(tthis) *(tthis) = 0
+#define FD_ISSET(fd, tthis) (*(tthis) & (1 << fd))
+typedef int fd_set;
+#endif
+
+static fd_set Read_FD_Set;
+
+/* HACK: If > 0, use 1/10 seconds. If < 0, use 1/1000 seconds */
+
+int _pSLsys_input_pending(int tsecs)
+{
+ struct timeval wait;
+ long usecs, secs;
+
+ if ((TTY_Inited == 0)
+ || (SLang_TT_Read_FD < 0))
+ {
+	errno = EBADF;
+	return -1;
+ }
+
+ if (tsecs >= 0)
+ {
+	secs = tsecs / 10;
+	usecs = (tsecs % 10) * 100000;
+ }
+ else
+ {
+	tsecs = -tsecs;
+	secs = tsecs / 1000;
+	usecs = (tsecs % 1000) * 1000;
+ }
+
+ wait.tv_sec = secs;
+ wait.tv_usec = usecs;
+
+ FD_ZERO(&Read_FD_Set);
+ FD_SET(SLang_TT_Read_FD, &Read_FD_Set);
+
+ return select(SLang_TT_Read_FD + 1, &Read_FD_Set, NULL, NULL, &wait);
+}
+
+int (*SLang_getkey_intr_hook) (void) = NULL;
+
+static int handle_interrupt (void)
+{
+ if (SLang_getkey_intr_hook != NULL)
+ {
+	/* int save_tty_fd = SLang_TT_Read_FD; */
+
+	if (-1 == (*SLang_getkey_intr_hook) ())
+	 return -1;
+
+	/* The interrupt hook may suspend the process and reset the tty.
+	 * When it comes back up, a new descriptor may allocated.
+	 * Allow that here.
+	 */
+
+	/* if (save_tty_fd != SLang_TT_Read_FD) */
+	 /* return -1; */
+ }
+
+ return 0;
+}
+
+unsigned int _pSLsys_getkey (void)
+{
+ unsigned char c;
+
+ if (TTY_Inited == 0)
+ {
+	int ic = fgetc (stdin);
+	if (ic == EOF) return SLANG_GETKEY_ERROR;
+	return (unsigned int) ic;
+ }
+
+ while (1)
+ {
+	int ret;
+
+	if (SLKeyBoard_Quit)
+	 return SLang_Abort_Char;
+
+	if (0 == (ret = _pSLsys_input_pending (100)))
+	 continue;
+
+	if (ret != -1)
+	 break;
+
+	if (errno == EINTR)
+	 {
+	 if (-1 == handle_interrupt ())
+	 {
+		 errno = EINTR;
+		 return SLANG_GETKEY_ERROR;
+	 }
+
+	 if (SLKeyBoard_Quit)
+	 return SLang_Abort_Char;
+
+	 continue;
+	 }
+
+	if (SLKeyBoard_Quit)
+	 return SLang_Abort_Char;
+
+	break;			 /* let read handle it */
+ }
+
+ while (1)
+ {
+	ssize_t status = read(SLang_TT_Read_FD, (char *) &c, 1);
+
+	if (status > 0)
+	 break;
+
+	if (status == 0)
+	 {
+	 /* We are at the end of a file. Let application handle it. */
+	 return SLANG_GETKEY_ERROR;
+	 }
+
+	if (errno == EINTR)
+	 {
+	 if (-1 == handle_interrupt ())
+	 {
+		 errno = EINTR;
+		 return SLANG_GETKEY_ERROR;
+	 }
+
+	 if (SLKeyBoard_Quit)
+	 return SLang_Abort_Char;
+
+	 continue;
+	 }
+#ifdef EAGAIN
+	if (errno == EAGAIN)
+	 {
+	 sleep (1);
+	 continue;
+	 }
+#endif
+#ifdef EWOULDBLOCK
+	if (errno == EWOULDBLOCK)
+	 {
+	 sleep (1);
+	 continue;
+	 }
+#endif
+#ifdef EIO
+	if (errno == EIO)
+	 {
+	 _pSLang_verror (SL_Read_Error, "_pSLsys_getkey: EIO error");
+	 errno = EIO;
+	 }
+#endif
+	return SLANG_GETKEY_ERROR;
+ }
+
+ return((unsigned int) c);
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slvideo.c Added

@@ -0,0 +1,2419 @@
+/* -*- mode: C; mode: fold -*- */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+/* This file is best edited with a folding editor */
+
+#include "slinclud.h"
+
+#if !defined(__WIN32__) && !defined(__IBMC__)
+# include <dos.h>
+#endif
+
+#include "slang.h"
+#include "_slang.h"
+
+int SLtt_Term_Cannot_Insert = 0;
+int SLtt_Term_Cannot_Scroll = 0;
+int SLtt_Ignore_Beep = 3;
+int SLtt_Use_Ansi_Colors = 0;
+int SLtt_Has_Status_Line = 0;
+int SLtt_Screen_Rows = 25;
+int SLtt_Screen_Cols = 80;
+int SLtt_Msdos_Cheap_Video = 0;
+
+void (*_pSLtt_color_changed_hook)(void);
+
+/* This definition will need changing when SLsmg_Char_Type changes. */
+#define SLSMG_CHAR_TO_USHORT(x) ((unsigned short)(x))
+
+/*{{{ ------------- static local variables ---------- */
+
+static int Attribute_Byte;
+static int Scroll_r1 = 0, Scroll_r2 = 25;
+static int Cursor_Row = 1, Cursor_Col = 1;
+static int Current_Color;
+static int IsColor = 1;
+static int Blink_Killed = 1;	/* high intensity background enabled */
+
+/* FIXME: sldisply.c allows up to SLTT_MAX_COLORS colors */
+#define JMAX_COLORS	256
+#define JNORMAL_COLOR	0
+#define JNO_COLOR	-1
+
+static unsigned char Color_Map JMAX_COLORS =
+{
+ 0x7, 0x70, 0x70, 0x70, 0x70, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,
+ 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7
+};
+
+#define JMAX_COLOR_NAMES 16
+static SLCONST char *Color_Names JMAX_COLOR_NAMES =
+{
+ "black", "blue", "green", "cyan",
+ "red", "magenta", "brown", "lightgray",
+ "gray", "brightblue", "brightgreen", "brightcyan",
+ "brightred", "brightmagenta", "yellow", "white"
+};
+
+static void fixup_colors (void);
+
+/*}}}*/
+
+static void goto_rc_abs (int r, int c)
+{
+ SLtt_goto_rc (r - Scroll_r1, c);
+}
+
+#if defined(__BORLANDC__) && defined(__MSDOS__)
+# define IBMPC_ASM_VIDEO	1
+#endif
+
+#if defined(__WATCOMC__) && !defined(__NT__) && !defined(__os2__)
+# define WATCOM_VIDEO		1
+#endif
+
+#if defined (__GO32__)
+# define GO32_VIDEO		1
+#endif
+
+#if defined (__EMX__)		/* EMX video does both DOS & OS/2 */
+# define EMX_VIDEO		1
+#else
+# if defined(__os2__)
+# define OS2_VIDEO		1
+# endif
+#endif
+
+#if defined (__WIN32__)
+# define WIN32_VIDEO		1
+#endif
+
+/* The functions in these folds contain somewhat video system specific code
+ * that if merged together into single functions will become a confusing
+ * mess.
+ */
+
+#ifdef IBMPC_ASM_VIDEO /*{{{*/
+
+# include <conio.h>
+# include <bios.h>
+# include <mem.h>
+
+/* buffer to hold a line of character/attribute pairs */
+#define MAXCOLS 256
+static unsigned char Line_Buffer MAXCOLS*2;
+
+#define MK_SPACE_CHAR()	(((Attribute_Byte) << 8) | 0x20)
+
+static unsigned char *Video_Base;
+# define MK_SCREEN_POINTER(row,col)	((unsigned short *)\
+					 (Video_Base +\
+					 2 * (SLtt_Screen_Cols * (row)\
+					 + (col))))
+static int Video_Status_Port;
+
+# define MONO_STATUS	0x3BA
+# define CGA_STATUS	0x3DA
+# define CGA_SETMODE	0x3D8
+
+# define SNOW_CHECK \
+ if (SLtt_Msdos_Cheap_Video)\
+ { while ((inp (CGA_STATUS) & 0x08)); while (!(inp (CGA_STATUS) & 0x08)); }
+
+void SLtt_write_string (SLFUTURE_CONST char *str)
+{
+ /* FIXME: Priority=medium
+ * This should not go to stdout. */
+ fputs (str, stdout);
+}
+
+/* row is with respect to the scrolling region. */
+void SLtt_goto_rc (int r, int c)
+{
+ union REGS regs;
+
+ r += Scroll_r1;
+
+ if (r > SLtt_Screen_Rows - 1) r = SLtt_Screen_Rows - 1;
+ if (c > SLtt_Screen_Cols - 1) c = SLtt_Screen_Cols - 1;
+
+ Cursor_Row = r;
+ Cursor_Col = c;
+
+ regs.h.dh = r;
+ regs.h.dl = c;
+ regs.h.bh = 0;
+ regs.h.ah = 2;
+ int86 (0x10, &regs, &regs);
+}
+
+static void asm_video_getxy (void)
+{
+ asm mov ah, 3
+ asm mov bh, 0
+ asm int 10h
+ asm xor ax, ax
+ asm mov al, dh
+ asm mov Cursor_Row, ax
+ asm xor ax, ax
+ asm mov al, dl
+ asm mov Cursor_Col, ax
+}
+
+void SLtt_begin_insert (void)
+{
+ unsigned short *p;
+ int n;
+
+ asm_video_getxy ();
+ n = SLtt_Screen_Cols - Cursor_Col;
+ p = MK_SCREEN_POINTER (Cursor_Row, SLtt_Screen_Cols - 1);
+
+ SNOW_CHECK;
+ asm mov ax, ds
+ asm mov bx, di
+ asm mov dx, si
+
+ asm mov cx, n
+ asm les di, p
+ asm lds si, p
+ asm sub si, 2
+ asm std
+ asm rep movsw
+
+ asm mov ds, ax
+ asm mov di, bx
+ asm mov si, dx
+}
+
+void SLtt_end_insert (void)
+{
+}
+
+void SLtt_delete_char (void)
+{
+ unsigned short *p;
+ int n;
+
+ asm_video_getxy ();
+ n = SLtt_Screen_Cols - Cursor_Col - 1;
+ p = MK_SCREEN_POINTER (Cursor_Row, Cursor_Col);
+
+ SNOW_CHECK;
+ asm mov ax, ds
+ asm mov bx, si
+ asm mov dx, di
+
+ asm mov cx, n
+ asm les di, p
+ asm lds si, p
+ asm add si, 2
+ asm cld
+ asm rep movsw
+
+ asm mov ds, ax
+ asm mov si, bx
+ asm mov di, dx
+}
+
+void SLtt_erase_line (void)
+{
+ unsigned short w, *p;
+
+ p = MK_SCREEN_POINTER (Cursor_Row, 0);
+ Attribute_Byte = 0x07;
+
+ w = MK_SPACE_CHAR ();
+
+ SNOW_CHECK;
+ asm mov dx, di
+ asm mov ax, w
+ asm mov cx, SLtt_Screen_Cols
+ asm les di, p
+ asm cld
+ asm rep stosw
+ asm mov di, dx
+
+ Current_Color = JNO_COLOR;		/* since we messed with attribute byte */
+}
+
+void SLtt_delete_nlines (int nlines)
+{
+ SLtt_normal_video ();
+
+ /* This has the effect of pulling all lines below it up */
+ asm mov ax, nlines
+ asm mov ah, 6		/* int 6h */
+ asm xor cx, cx
+ asm mov ch, byte ptr Scroll_r1
+ asm mov dx, SLtt_Screen_Cols
+ asm dec dx
+ asm mov dh, byte ptr Scroll_r2
+ asm mov bh, byte ptr Attribute_Byte
+ asm int 10h
+}
+
+void SLtt_reverse_index (int nlines)
+{
+ SLtt_normal_video ();
+ asm xor cx, cx
+ asm mov ch, byte ptr Scroll_r1
+ asm mov dx, SLtt_Screen_Cols
+ asm dec dx
+ asm mov dh, byte ptr Scroll_r2
+ asm mov bh, byte ptr Attribute_Byte
+ asm mov ah, 7
+ asm mov al, byte ptr nlines
+ asm int 10h
+}
+
+static void asm_video_invert_region (int top_row, int bot_row)
+{
+ register unsigned short ch, sh;
+ register unsigned short *pmin = MK_SCREEN_POINTER (top_row, 0);
+ register unsigned short *pmax = MK_SCREEN_POINTER (bot_row, 0);
+
+ while (pmin < pmax)
+ {
+	sh = *pmin;
+	ch = sh;
+	ch = ch ^ 0xFF00;
+	*pmin = (ch & 0xFF00) | (sh & 0x00FF);
+	pmin++;
+ }
+}
+
+void SLtt_del_eol (void)
+{
+ unsigned short *p;
+ unsigned short w;
+ int n;
+
+ n = SLtt_Screen_Cols - Cursor_Col;
+ p = MK_SCREEN_POINTER (Cursor_Row, Cursor_Col);
+ if (Current_Color != JNO_COLOR) SLtt_normal_video ();
+ w = MK_SPACE_CHAR ();
+
+ SNOW_CHECK;
+ asm mov dx, di
+ asm les di, p
+ asm mov ax, w
+ asm mov cx, n
+ asm cld
+ asm rep stosw
+
+ asm mov di, dx
+}
+
+static unsigned short *asm_video_write (register unsigned char *pp,
+					register unsigned char *p,
+					register unsigned short *pos)
+{
+ int n = (int) (p - pp);	/* num of characters of PP to write */
+
+ asm push si
+ asm push ds
+ asm push di
+
+ /* set up register for BOTH fast and slow */
+ asm mov bx, SLtt_Msdos_Cheap_Video
+
+ /* These are the registers needed for both fast AND slow */
+ asm mov ah, byte ptr Attribute_Byte
+ asm mov cx, n
+ asm lds si, dword ptr pp
+ asm les di, dword ptr pos
+ asm cld
+
+ asm cmp bx, 0		 /* cheap video test */
+ asm je L_fast
+ asm mov bx, ax
+ asm mov dx, CGA_STATUS
+ asm jg L_slow_blank
+
+ /* slow video */
+ asm cli
+
+ /* wait for retrace */
+ L_slow:
+ asm in al, dx
+ asm test al, 1
+ asm jnz L_slow
+
+ L_slow1:
+ asm in al, dx
+ asm test al, 1
+ asm jz L_slow1
+
+ /* move a character out */
+ asm mov ah, bh
+ asm lodsb
+ asm stosw
+ asm loop L_slow
+
+ asm sti
+ asm jmp done
+
+/* -------------- slow video, vertical retace and pump --------------*/
+ L_slow_blank:
+ L_slow_blank_loop:
+ asm in al, dx
+ asm test al, 8
+ asm jnz L_slow_blank_loop
+
+ L_slow_blank1:
+ asm in al, dx
+ asm test al, 8
+ asm jz L_slow_blank1
+ /* write line */
+ asm mov ah, bh
+ L_slow_blank2:
+ asm lodsb
+ asm stosw
+ asm loop L_slow_blank2
+
+ asm jmp done
+/*-------------- Fast video --------------*/
+
+ L_fast:
+ asm lodsb
+ asm stosw
+ asm loop L_fast
+ done:
+ asm pop di
+ asm pop ds
+ asm pop si
+ return (pos + n);
+}
+
+static void write_attributes (SLsmg_Char_Type *src, unsigned int count)
+{
+ register unsigned char *p;
+ register unsigned short pair;
+ unsigned char ch, color;
+ register unsigned short *pos;
+
+ p = Line_Buffer;
+ pos = MK_SCREEN_POINTER (Cursor_Row, 0);
+
+ while (count--)
+ {
+	pair = SLSMG_CHAR_TO_USHORT(*src);	/* character/color pair */
+	src++;
+	ch = pair & 0xff;	/* character value */
+	color = pair >> 8;	/* color value */
+	if (color != Current_Color)	/* need a new color */
+	 {
+	 if (p != Line_Buffer)
+	 {
+		 pos = asm_video_write (Line_Buffer, p, pos);
+		 p = Line_Buffer;
+	 }
+	 SLtt_reverse_video (color);	/* change color */
+	 }
+	*(p++) = ch;
+ }
+ pos = asm_video_write (Line_Buffer, p, pos);
+}
+
+void SLtt_cls (void)
+{
+ SLtt_normal_video ();
+
+ asm mov dx, SLtt_Screen_Cols
+ asm dec dx
+ asm mov ax, SLtt_Screen_Rows
+ asm dec ax
+ asm mov dh, al
+ asm xor cx, cx
+ asm xor ax, ax
+ asm mov ah, 7
+ asm mov bh, byte ptr Attribute_Byte
+ asm int 10h
+}
+
+void SLtt_putchar (char ch)
+{
+ unsigned short p, *pp;
+
+ if (Current_Color) SLtt_normal_video ();
+ asm_video_getxy ();		/* get current position */
+ switch (ch)
+ {
+ case 7:			/* ^G - break */
+	SLtt_beep (); break;
+ case 8:			/* ^H - backspace */
+	goto_rc_abs (Cursor_Row, Cursor_Col - 1); break;
+ case 13:			/* ^M - carriage return */
+	goto_rc_abs (Cursor_Row, 0); break;
+ default:
+	/* write character to screen */
+	pp = MK_SCREEN_POINTER (Cursor_Row, Cursor_Col);
+	p = (Attribute_Byte << 8) | (unsigned char) ch;
+	SNOW_CHECK;
+	*pp = p;
+	goto_rc_abs (Cursor_Row, Cursor_Col + 1);
+ }
+}
+
+void SLtt_get_screen_size (void)
+{
+ int w, h;
+
+ h = 0;
+
+ /* Get BIOS's screenwidth, this works on ALL displays. */
+ w = *((int *)MK_FP(0x40, 0x4a));
+
+ /* Use Ralf Brown test for EGA or greater */
+ asm mov ah, 12h
+ asm mov bl, 10h
+ asm mov bh, 0xFF /* EGA or greater will change this */
+ asm int 10h
+ asm cmp bh, 0xFF
+ asm je L1
+ /* if EGA or compatible: Get BIOS's number of rows. */
+ h = *(char *)MK_FP(0x40, 0x84) + 1;
+ /* scan_lines = *(int *) 0x485; */
+
+ L1:
+ if (h <= 0) h = 25;
+
+ SLtt_Screen_Rows = h;
+ SLtt_Screen_Cols = w;
+}
+
+void SLtt_get_terminfo (void)
+{
+ SLtt_get_screen_size ();
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	int SLtt_init_video (void);
+\*----------------------------------------------------------------------*/
+int SLtt_init_video (void)
+{
+ unsigned char *p;
+
+#ifdef HAS_SAVE_SCREEN
+ save_screen ();
+#endif
+
+ Cursor_Row = Cursor_Col = 0;
+ p = (unsigned char far *) 0x00400049L;
+ if (*p == 7)
+ {
+	Video_Status_Port = MONO_STATUS;
+	Video_Base = (unsigned char *) MK_FP (0xb000,0000);
+	IsColor = 0;
+ }
+ else
+ {
+	Video_Status_Port = CGA_STATUS;
+	Video_Base = (unsigned char *) MK_FP (0xb800,0000);
+	IsColor = 1;
+ }
+
+ /* test for video adapter type. Of primary interest is whether there is
+ * snow or not. Assume snow if the card is color and not EGA or greater.
+ */
+
+ /* Use Ralf Brown test for EGA or greater */
+ asm mov ah, 0x12
+ asm mov bl, 0x10
+ asm mov bh, 0xFF
+ asm int 10h
+ asm cmp bh, 0xFF
+ asm je L1
+
+ /* (V)EGA */
+ asm xor bx, bx
+ asm mov SLtt_Msdos_Cheap_Video, bx
+ asm mov ax, Attribute_Byte
+ asm cmp ax, bx
+ asm jne L2
+ asm mov ax, 0x17
+ asm mov Attribute_Byte, ax
+ asm jmp L2
+
+ L1:
+ /* Not (V)EGA */
+ asm mov ah, 0x0F
+ asm int 10h
+ asm cmp al, 7
+ asm je L3
+ asm mov ax, 1
+ asm mov SLtt_Msdos_Cheap_Video, ax
+ L3:
+ asm mov ax, Attribute_Byte
+ asm cmp ax, 0
+ asm jne L2
+ asm mov ax, 0x07
+ asm mov Attribute_Byte, ax
+ L2:
+ /* toggle the blink bit so we can use hi intensity background */
+ if (IsColor && !SLtt_Msdos_Cheap_Video)
+ {
+	asm mov ax, 0x1003
+	 asm mov bx, 0
+	 asm int 0x10
+	 Blink_Killed = 1;
+ }
+
+ SLtt_Use_Ansi_Colors = IsColor;
+ SLtt_get_screen_size ();
+ SLtt_reset_scroll_region ();
+ fixup_colors ();
+ return 0;
+}
+
+void SLtt_beep (void)
+{
+ int audible;			/* audible bell */
+ int special = 0;		/* first row to invert */
+ int visual = 0;		/* final row to invert */
+
+ if (!SLtt_Ignore_Beep) return;
+
+ audible = (SLtt_Ignore_Beep & 1);
+ if ( (SLtt_Ignore_Beep & 4) )
+ {
+	special = SLtt_Screen_Rows - 1;
+	visual = special--;	/* only invert bottom status line */
+ }
+ else if ( (SLtt_Ignore_Beep & 2) )
+ {
+	visual = SLtt_Screen_Rows;
+ }
+
+ if (visual) asm_video_invert_region (special, visual);
+ if (audible) sound (1500); delay (100); if (audible) nosound ();
+ if (visual) asm_video_invert_region (special, visual);
+}
+
+#endif				 /* IBMPC_ASM_VIDEO */
+
+/*}}}*/
+
+#ifdef GO32_VIDEO /*{{{*/
+
+# include <pc.h>
+# define HAS_SAVE_SCREEN	1
+
+# ifdef HAS_SAVE_SCREEN
+static void *Saved_Screen_Buffer;
+static int Saved_Cursor_Row;
+
+static void save_screen (void)
+{
+ int row, col;
+
+ SLfree ((char *) Saved_Screen_Buffer);
+ Saved_Screen_Buffer = NULL;
+
+ Saved_Screen_Buffer = (short *) SLmalloc (sizeof (short) *
+				 ScreenCols () * ScreenRows ());
+
+ if (Saved_Screen_Buffer == NULL)
+ return;
+
+ ScreenRetrieve (Saved_Screen_Buffer);
+ ScreenGetCursor (&row, &col);
+ Saved_Cursor_Row = row;
+}
+
+static void restore_screen (void)
+{
+ if (Saved_Screen_Buffer == NULL) return;
+ ScreenUpdate (Saved_Screen_Buffer);
+ goto_rc_abs (Saved_Cursor_Row, 0);
+}
+#endif				 /* HAS_SAVE_SCREEN */
+
+void SLtt_write_string (SLFUTURE_CONST char *str)
+{
+ while (Cursor_Col < SLtt_Screen_Cols)
+ {
+	char ch = *str++;
+
+	if (ch == 0)
+	 break;
+
+	ScreenPutChar (ch, Attribute_Byte, Cursor_Col, Cursor_Row);
+	Cursor_Col++;
+ }
+ goto_rc_abs (Cursor_Row, Cursor_Col);
+}
+
+void SLtt_goto_rc (int row, int col)
+{
+ row += Scroll_r1;
+ if (row > SLtt_Screen_Rows) row = SLtt_Screen_Rows;
+ if (col > SLtt_Screen_Cols) col = SLtt_Screen_Cols;
+
+ ScreenSetCursor (row, col);
+
+ Cursor_Row = row;
+ Cursor_Col = col;
+}
+
+static void go32_video_getxy (void)
+{
+ ScreenGetCursor (&Cursor_Row, &Cursor_Col);
+}
+
+static void go32_video_deleol (int x)
+{
+ while (x < SLtt_Screen_Cols)
+ ScreenPutChar (32, Attribute_Byte, x++, Cursor_Row);
+}
+
+void SLtt_begin_insert (void)
+{
+}
+
+void SLtt_end_insert (void)
+{
+}
+
+void SLtt_delete_char (void)
+{
+}
+
+void SLtt_erase_line (void)
+{
+ Attribute_Byte = 0x07;
+ go32_video_deleol (0);
+ Current_Color = JNO_COLOR;		/* since we messed with attribute byte */
+}
+
+void SLtt_delete_nlines (int nlines)
+{
+ union REGS r;
+
+ SLtt_normal_video ();
+
+ r.x.ax = nlines;
+ r.x.cx = 0;
+ r.h.ah = 6;
+ r.h.ch = Scroll_r1;
+ r.h.dl = SLtt_Screen_Cols - 1;
+ r.h.dh = Scroll_r2;
+ r.h.bh = Attribute_Byte;
+ int86 (0x10, &r, &r);
+}
+
+void SLtt_reverse_index (int nlines)
+{
+ union REGS r;
+
+ SLtt_normal_video ();
+
+ r.h.al = nlines;
+ r.x.cx = 0;
+ r.h.ah = 7;
+ r.h.ch = Scroll_r1;
+ r.h.dl = SLtt_Screen_Cols - 1;
+ r.h.dh = Scroll_r2;
+ r.h.bh = Attribute_Byte;
+ int86 (0x10, &r, &r);
+}
+
+static void go32_video_invert_region (int top_row, int bot_row)
+{
+ unsigned char buf 2 * 180 * 80; /* 180 cols x 80 rows */
+ unsigned char *b, *bmax;
+
+ b = buf + 1 + 2 * SLtt_Screen_Cols * top_row;
+ bmax = buf + 1 + 2 * SLtt_Screen_Cols * bot_row;
+
+ ScreenRetrieve (buf);
+ while (b < bmax)
+ {
+	*b ^= 0xFF;
+	b += 2;
+ }
+ ScreenUpdate (buf);
+}
+
+void SLtt_beep (void)
+{
+ int audible;			/* audible bell */
+ int special = 0;		/* first row to invert */
+ int visual = 0;		/* final row to invert */
+
+ if (!SLtt_Ignore_Beep) return;
+
+ audible = (SLtt_Ignore_Beep & 1);
+ if ( (SLtt_Ignore_Beep & 4) )
+ {
+	special = SLtt_Screen_Rows - 1;
+	visual = special--;	/* only invert bottom status line */
+ }
+ else if ( (SLtt_Ignore_Beep & 2) )
+ {
+	visual = SLtt_Screen_Rows;
+ }
+
+ if (visual) go32_video_invert_region (special, visual);
+ if (audible) sound (1500); delay (100); if (audible) nosound ();
+ if (visual) go32_video_invert_region (special, visual);
+}
+
+void SLtt_del_eol (void)
+{
+ if (Current_Color != JNO_COLOR) SLtt_normal_video ();
+ go32_video_deleol (Cursor_Col);
+}
+
+static void
+write_attributes (SLsmg_Char_Type *src, unsigned int count)
+{
+ unsigned int n;
+
+ /* write into a character/attribute pair */
+ n = Cursor_Col;
+ while (count)
+ {
+ SLtt_reverse_video (src->color); /* color change */
+ ScreenPutChar (src->wchars0 & 0xFF, Attribute_Byte, n, Cursor_Row);
+	n++;
+	src++;
+	count--;
+ }
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	void SLtt_cls (void);
+\*----------------------------------------------------------------------*/
+void SLtt_cls (void)
+{
+ SLtt_normal_video ();
+ SLtt_reset_scroll_region ();
+ SLtt_goto_rc (0, 0);
+ SLtt_delete_nlines (SLtt_Screen_Rows);
+}
+
+void SLtt_putchar (char ch)
+{
+ if (Current_Color) SLtt_normal_video ();
+
+ go32_video_getxy ();		/* get current position */
+
+ switch (ch)
+ {
+ case 7:			/* ^G - break */
+	SLtt_beep (); break;
+ case 8:			/* ^H - backspace */
+	goto_rc_abs (Cursor_Row, Cursor_Col - 1); break;
+ case 13:			/* ^M - carriage return */
+	goto_rc_abs (Cursor_Row, 0); break;
+ default:			/* write character to screen */
+	ScreenPutChar ((int) ch, Attribute_Byte, Cursor_Col, Cursor_Row);
+	goto_rc_abs (Cursor_Row, Cursor_Col + 1);
+ }
+}
+
+void SLtt_get_screen_size (void)
+{
+ SLtt_Screen_Rows = ScreenRows ();
+ SLtt_Screen_Cols = ScreenCols ();
+}
+
+void SLtt_get_terminfo (void)
+{
+ SLtt_get_screen_size ();
+}
+
+int SLtt_init_video (void)
+{
+#ifdef HAS_SAVE_SCREEN
+ save_screen ();
+#endif
+
+ if (!Attribute_Byte) Attribute_Byte = 0x17;
+
+ IsColor = 1;			/* is it really? */
+
+ if (IsColor)
+ {
+	union REGS r;
+	r.x.ax = 0x1003; r.x.bx = 0;
+	int86 (0x10, &r, &r);
+	Blink_Killed = 1;
+ }
+
+ Cursor_Row = Cursor_Col = 0;
+
+ SLtt_Term_Cannot_Insert = 1;
+ SLtt_reset_scroll_region ();
+ SLtt_Use_Ansi_Colors = IsColor;
+ fixup_colors ();
+ return 0;
+}
+
+#endif				 /* GO32_VIDEO */
+
+/*}}}*/
+
+#ifdef EMX_VIDEO /*{{{*/
+
+# define INCL_VIO
+# define INCL_DOSPROCESS
+# include <os2.h>
+# include <os2emx.h>
+# include <sys/video.h>
+
+static VIOMODEINFO vioModeInfo;
+/* buffer to hold a line of character/attribute pairs */
+#define MAXCOLS 256
+static unsigned char Line_Buffer MAXCOLS*2;
+
+void SLtt_write_string (SLFUTURE_CONST char *str)
+{
+ /* FIXME: Priority=medium
+ * This should not go to stdout. */
+ fputs (str, stdout);
+}
+
+void SLtt_goto_rc (int row, int col)
+{
+ row += Scroll_r1;
+ if (row > SLtt_Screen_Rows) row = SLtt_Screen_Rows;
+ if (col > SLtt_Screen_Cols) col = SLtt_Screen_Cols;
+ v_gotoxy (col, row);
+ Cursor_Row = row;
+ Cursor_Col = col;
+}
+
+static void emx_video_getxy (void)
+{
+ v_getxy (&Cursor_Col, &Cursor_Row);
+}
+
+static void emx_video_deleol (int x)
+{
+ unsigned char *p, *pmax;
+ int count = SLtt_Screen_Cols - x;
+ unsigned char attr = Attribute_Byte;
+
+ p = Line_Buffer;
+ pmax = p + 2 * count;
+
+ while (p < pmax)
+ {
+	*p++ = (unsigned char) ' ';
+	*p++ = attr;
+ }
+
+ v_putline (Line_Buffer, x, Cursor_Row, count);
+}
+
+void SLtt_begin_insert (void)
+{
+ int n;
+
+ emx_video_getxy ();
+
+ n = SLtt_Screen_Cols - Cursor_Col;
+ v_getline (Line_Buffer, Cursor_Col, Cursor_Row, n);
+ v_putline (Line_Buffer, Cursor_Col+1, Cursor_Row, n - 1);
+}
+
+void SLtt_end_insert (void)
+{
+}
+
+void SLtt_delete_char (void)
+{
+ int n;
+
+ emx_video_getxy ();
+
+ n = SLtt_Screen_Cols - Cursor_Col - 1;
+ v_getline (Line_Buffer, Cursor_Col+1, Cursor_Row, n);
+ v_putline (Line_Buffer, Cursor_Col, Cursor_Row, n);
+}
+
+void SLtt_erase_line (void)
+{
+ Attribute_Byte = 0x07;
+ emx_video_deleol (0);
+ Current_Color = JNO_COLOR;		/* since we messed with attribute byte */
+}
+
+void SLtt_delete_nlines (int nlines)
+{
+ SLtt_normal_video ();
+ v_attrib (Attribute_Byte);
+ v_scroll (0, Scroll_r1, SLtt_Screen_Cols-1, Scroll_r2, nlines, V_SCROLL_UP);
+}
+
+void SLtt_reverse_index (int nlines)
+{
+ SLtt_normal_video ();
+
+ v_attrib (Attribute_Byte);
+ v_scroll (0, Scroll_r1, SLtt_Screen_Cols-1, Scroll_r2, nlines,
+	 V_SCROLL_DOWN);
+}
+
+static void emx_video_invert_region (int top_row, int bot_row)
+{
+ int row, col;
+
+ for (row = top_row; row < bot_row; row++)
+ {
+	v_getline (Line_Buffer, 0, row, SLtt_Screen_Cols);
+	for (col = 1; col < SLtt_Screen_Cols * 2; col += 2)
+	 Line_Buffer col ^= 0xff;
+	v_putline (Line_Buffer, 0, row, SLtt_Screen_Cols);
+ }
+}
+
+void SLtt_beep (void)
+{
+ int audible;			/* audible bell */
+ int special = 0;		/* first row to invert */
+ int visual = 0;		/* final row to invert */
+
+ if (!SLtt_Ignore_Beep) return;
+
+ audible = (SLtt_Ignore_Beep & 1);
+ if ( (SLtt_Ignore_Beep & 4) )
+ {
+	special = SLtt_Screen_Rows - 1;
+	visual = special--;	/* only invert bottom status line */
+ }
+ else if ( (SLtt_Ignore_Beep & 2) )
+ {
+	visual = SLtt_Screen_Rows;
+ }
+
+ if (visual) emx_video_invert_region (special, visual);
+ if (audible) /*sound (1500)*/; _sleep2 (100); if (audible) /* nosound () */;
+ if (visual) emx_video_invert_region (special, visual);
+}
+
+void SLtt_del_eol (void)
+{
+ if (Current_Color != JNO_COLOR) SLtt_normal_video ();
+ emx_video_deleol (Cursor_Col);
+}
+
+static void
+write_attributes (SLsmg_Char_Type *src, unsigned int count)
+{
+ register unsigned char *p = Line_Buffer;
+ int n = count;
+
+ /* write into a character/attribute pair */
+ while (n > 0)
+ {
+	/* UTF8 FIXME */
+	if (src->nchars)
+	 {
+	 SLtt_reverse_video (src->color & SLSMG_COLOR_MASK);
+	 *p++ = src->wchars0;
+	 }
+	else *p++ = ' ';
+	*p++ = Attribute_Byte;
+	n--;
+	src++;
+ }
+ v_putline (Line_Buffer, Cursor_Col, Cursor_Row, count);
+}
+
+void SLtt_cls (void)
+{
+ SLtt_normal_video ();
+ SLtt_reset_scroll_region ();
+ SLtt_goto_rc (0, 0);
+ SLtt_delete_nlines (SLtt_Screen_Rows);
+}
+
+void SLtt_putchar (char ch)
+{
+ if (Current_Color) SLtt_normal_video ();
+
+ emx_video_getxy ();		/* get current position */
+ switch (ch)
+ {
+ case 7:			/* ^G - break */
+	SLtt_beep (); break;
+ case 8:			/* ^H - backspace */
+	goto_rc_abs (Cursor_Row, Cursor_Col - 1); break;
+ case 13:			/* ^M - carriage return */
+	goto_rc_abs (Cursor_Row, 0); break;
+ default:			/* write character to screen */
+	v_putn (ch, 1);
+	goto_rc_abs (Cursor_Row, Cursor_Col + 1);
+ }
+}
+
+void SLtt_get_terminfo (void)
+{
+ SLtt_get_screen_size ();
+}
+
+void SLtt_get_screen_size (void)
+{
+ vioModeInfo.cb = sizeof(vioModeInfo);
+ VioGetMode (&vioModeInfo, 0);
+ SLtt_Screen_Cols = vioModeInfo.col;
+ SLtt_Screen_Rows = vioModeInfo.row;
+}
+
+int SLtt_init_video (void)
+{
+ int OldCol, OldRow;
+ PTIB ptib;
+ PPIB ppib;
+ USHORT args3 = { 6, 2, 1 };
+
+#ifdef HAS_SAVE_SCREEN
+ save_screen ();
+#endif
+
+ Cursor_Row = Cursor_Col = 0;
+
+ v_init ();
+ if ( v_hardware () != V_MONOCHROME ) IsColor = 1; else IsColor = 0;
+
+ v_getxy(&OldCol,&OldRow);
+ v_gotoxy (0, 0);
+ if (IsColor)
+ {
+	if (_osmode == OS2_MODE)
+	 {
+# if 0
+	 /* Enable high-intensity background colors */
+	 VIOINTENSITY RequestBlock;
+	 RequestBlock.cb = sizeof (RequestBlock);
+	 RequestBlock.type = 2; RequestBlock.fs = 1;
+	 VioSetState (&RequestBlock, 0);	/* nop if !fullscreen */
+# endif
+	 }
+ }
+
+ DosGetInfoBlocks (&ptib, &ppib);
+ if ((ppib->pib_ultype) == 2) /* VIO */
+ Blink_Killed = 1;
+ else
+ { /* Fullscreen */
+ if (VioSetState (args, 0) == 0)
+	 Blink_Killed = 1;
+ else
+	 Blink_Killed = 0;
+ }
+
+ if (!Attribute_Byte)
+ {
+	/* find the attribute currently under the cursor */
+	v_getline (Line_Buffer, OldCol, OldRow, 1);
+	Attribute_Byte = Line_Buffer1;
+	SLtt_set_color (JNORMAL_COLOR, NULL,
+			Color_Names(Attribute_Byte) & 0xf,
+			Color_Names(Attribute_Byte) >> 4);
+ }
+
+ v_attrib (Attribute_Byte);
+
+ fixup_colors ();
+
+ SLtt_get_screen_size ();
+ SLtt_Use_Ansi_Colors = IsColor;
+ SLtt_reset_scroll_region ();
+ return 0;
+}
+
+#endif				 /* EMX_VIDEO */
+
+/*}}}*/
+
+#ifdef WIN32_VIDEO /*{{{*/
+
+# define UNICODE 1
+#include <windows.h>
+
+static HANDLE hStdout = INVALID_HANDLE_VALUE;
+
+#define MAXCOLS 256
+static CHAR_INFO Line_Buffer MAXCOLS;
+
+void SLtt_write_string (SLFUTURE_CONST char *str)
+{
+ DWORD bytes;
+ int n, c;
+ if (str == NULL) return;
+
+ n = (int) strlen (str);
+ c = n + Cursor_Col;
+ if (c >= SLtt_Screen_Cols)
+ n = SLtt_Screen_Cols - Cursor_Col;
+ if (n < 0) n = 0;
+
+ (void) WriteConsole (hStdout, str, (unsigned int) n, &bytes, NULL);
+
+ goto_rc_abs (Cursor_Row, Cursor_Col + n);
+}
+
+void SLtt_goto_rc (int row, int col)
+{
+ COORD newPosition;
+
+ row += Scroll_r1;
+ if (row > SLtt_Screen_Rows) row = SLtt_Screen_Rows;
+ if (col > SLtt_Screen_Cols) col = SLtt_Screen_Cols;
+ newPosition.X = col;
+ newPosition.Y = row;
+
+ (void) SetConsoleCursorPosition(hStdout, newPosition);
+
+ Cursor_Row = row;
+ Cursor_Col = col;
+}
+
+static void win32_video_getxy (void)
+{
+ CONSOLE_SCREEN_BUFFER_INFO screenInfo;
+
+ if (TRUE == GetConsoleScreenBufferInfo(hStdout, &screenInfo))
+ {
+	Cursor_Row = screenInfo.dwCursorPosition.Y;
+	Cursor_Col = screenInfo.dwCursorPosition.X;
+ }
+}
+
+static void win32_video_hscroll (int n)
+{
+ SMALL_RECT rc;
+ COORD c;
+ CHAR_INFO ci;
+ WORD w = 227;
+ DWORD d;
+
+ win32_video_getxy ();
+
+ rc.Left = Cursor_Col;
+ rc.Right = SLtt_Screen_Cols;
+ rc.Top = rc.Bottom = Cursor_Row;
+
+ c.Y = Cursor_Row;
+#if 1
+ c.X = SLtt_Screen_Cols - 1;
+ ReadConsoleOutputAttribute(hStdout, &w, 1, c, &d);
+#else
+ /* New region gets the current color */
+ w = Attribute_Byte;
+#endif
+ c.X = Cursor_Col + n;
+
+ ci.Char.AsciiChar = ' ';
+ ci.Attributes = w;
+
+ ScrollConsoleScreenBuffer(hStdout, &rc, &rc, c, &ci);
+}
+
+static void win32_video_deleol (int x)
+{
+ DWORD d;
+ COORD c;
+
+ c.X = x;
+ c.Y = Cursor_Row;
+
+ x = SLtt_Screen_Cols - x;
+ FillConsoleOutputCharacter(hStdout, ' ', x, c, &d);
+ FillConsoleOutputAttribute(hStdout, (char)Attribute_Byte, x, c, &d);
+}
+
+static void win32_video_vscroll (int n)
+{
+ SMALL_RECT rc, clip_rc;
+ COORD c;
+ CHAR_INFO ci;
+
+ SLtt_normal_video();
+
+ /* ScrollConsoleScreenBuffer appears to have a bug when
+ * Scroll_r1 == Scroll_r2. Sigh.
+ */
+ if (Scroll_r2 == Scroll_r1)
+ {
+	SLtt_goto_rc (0, 0);
+	win32_video_deleol (0);
+	return;
+ }
+
+ rc.Left = clip_rc.Left = 0;
+ rc.Right = clip_rc.Right = SLtt_Screen_Cols - 1;
+ rc.Top = clip_rc.Top = Scroll_r1;
+ rc.Bottom = clip_rc.Bottom = Scroll_r2;
+
+ c.X = 0;
+ c.Y = Scroll_r1 + n;
+
+ ci.Char.AsciiChar = ' ';
+ ci.Attributes = Attribute_Byte;
+
+ ScrollConsoleScreenBuffer(hStdout, &rc, &clip_rc, c, &ci);
+}
+
+void SLtt_begin_insert (void)
+{
+ win32_video_hscroll (1);
+}
+
+void SLtt_end_insert (void)
+{
+}
+
+void SLtt_delete_char (void)
+{
+ win32_video_hscroll (-1);
+}
+
+void SLtt_erase_line (void)
+{
+ Attribute_Byte = 0x7;
+ win32_video_deleol (0);
+ Current_Color = JNO_COLOR;
+}
+
+void SLtt_delete_nlines (int nlines)
+{
+ win32_video_vscroll (-nlines);
+}
+
+void SLtt_reverse_index (int nlines)
+{
+ win32_video_vscroll (nlines);
+}
+
+static void win32_invert_region (int top_row, int bot_row)
+{
+ (void) top_row; (void) bot_row;
+}
+
+void SLtt_beep (void)
+{
+ int audible;			/* audible bell */
+ int special = 0;		/* first row to invert */
+ int visual = 0;		/* final row to invert */
+
+ if (!SLtt_Ignore_Beep) return;
+
+ audible = (SLtt_Ignore_Beep & 1);
+
+ if ( (SLtt_Ignore_Beep & 4) )
+ {
+	special = SLtt_Screen_Rows - 1;
+	visual = special--;	/* only invert bottom status line */
+ }
+ else if ( (SLtt_Ignore_Beep & 2) )
+ {
+	visual = SLtt_Screen_Rows;
+ }
+
+ if (visual) win32_invert_region (special, visual);
+ if (audible) Beep (1500, 100); else Sleep (100);
+ if (visual) win32_invert_region (special, visual);
+}
+
+void SLtt_del_eol (void)
+{
+ if (Current_Color != JNO_COLOR)
+ SLtt_normal_video ();
+ win32_video_deleol (Cursor_Col);
+}
+
+static void
+write_attributes (SLsmg_Char_Type *src, unsigned int count)
+{
+ COORD coord, c;
+ CHAR_INFO *p;
+ unsigned int n;
+ SMALL_RECT rc;
+
+ /* write into a character/attribute pair */
+ n = count;
+ p = Line_Buffer;
+ while (n)
+ {
+	/* UTF8 FIXME */
+	if (src->nchars)
+	 {
+	 SLtt_reverse_video (src->color & SLSMG_COLOR_MASK);
+	 if (_pSLtt_UTF8_Mode)
+	 p->Char.UnicodeChar = src->wchars0;
+	 else
+	 p->Char.AsciiChar = src->wchars0;
+	 }
+	else
+	 {
+	 if (_pSLtt_UTF8_Mode)
+	 p->Char.UnicodeChar = 0;
+	 else
+	 p->Char.AsciiChar = 0;
+	 }
+	p->Attributes = Attribute_Byte;
+	p++;
+	n--;
+	src++;
+ }
+
+ c.X = count;
+ c.Y = 1;
+ coord.X = coord.Y = 0;
+ rc.Left = Cursor_Col;
+ rc.Right = Cursor_Col + count - 1;
+ rc.Top = rc.Bottom = Cursor_Row;
+ WriteConsoleOutput(hStdout, Line_Buffer, c, coord, &rc);
+}
+
+void SLtt_cls (void)
+{
+ DWORD bytes;
+ COORD coord;
+ char ch;
+
+ SLtt_normal_video ();
+ /* clear the WIN32 screen in one shot */
+ coord.X = 0;
+ coord.Y = 0;
+
+ ch = ' ';
+
+ (void) FillConsoleOutputCharacter(hStdout,
+				 ch,
+				 SLtt_Screen_Cols * SLtt_Screen_Rows,
+				 coord,
+				 &bytes);
+
+ /* now set screen to the current attribute */
+ ch = Attribute_Byte;
+ (void) FillConsoleOutputAttribute(hStdout,
+				 ch,
+				 SLtt_Screen_Cols * SLtt_Screen_Rows,
+				 coord,
+				 &bytes);
+}
+
+void SLtt_putchar (char ch)
+{
+ DWORD bytes;
+ WORD attr;
+ COORD c;
+ WCHAR wch;
+
+ wch = (unsigned char) ch;
+ if (Current_Color) SLtt_normal_video ();
+ win32_video_getxy ();
+ switch (wch)
+ {
+ case 7:			/* ^G - break */
+	SLtt_beep (); break;
+ case 8:			/* ^H - backspace */
+	goto_rc_abs (Cursor_Row, Cursor_Col - 1); break;
+ case 13:			/* ^M - carriage return */
+	goto_rc_abs (Cursor_Row, 0); break;
+ default:			/* write character to screen */
+	c.X = Cursor_Col;
+	c.Y = Cursor_Row;
+	attr = Attribute_Byte;
+	WriteConsoleOutputCharacter(hStdout, &wch, 1, c, &bytes);
+	WriteConsoleOutputAttribute(hStdout, &attr, 1, c, &bytes);
+	goto_rc_abs (Cursor_Row, Cursor_Col + 1);
+ }
+}
+
+void SLtt_get_screen_size (void)
+{
+ CONSOLE_SCREEN_BUFFER_INFO csbi;
+ HANDLE h;
+
+ h = hStdout;
+ if (h == INVALID_HANDLE_VALUE)
+ h = GetStdHandle (STD_OUTPUT_HANDLE);
+
+ if ((h == INVALID_HANDLE_VALUE)
+ || (FALSE == GetConsoleScreenBufferInfo(h, &csbi)))
+ {
+	/* FIXME: Is it a good idea to exit? If the console is hosed, would
+	 * the error message be seen?
+	 */
+	SLang_exit_error ("Unable to determine the screen size");
+	return;
+ }
+#if 0
+ SLtt_Screen_Rows = csbi.dwSize.Y;
+ SLtt_Screen_Cols = csbi.dwSize.X;
+#else
+ SLtt_Screen_Rows = (csbi.srWindow.Bottom - csbi.srWindow.Top) + 1;
+ SLtt_Screen_Cols = (csbi.srWindow.Right - csbi.srWindow.Left) + 1;
+#endif
+}
+
+void SLtt_get_terminfo (void)
+{
+ SLtt_get_screen_size ();
+}
+
+static int win32_resize (void)
+{
+ SMALL_RECT windowRect;
+
+ SLtt_get_screen_size ();
+
+ windowRect.Left = 0;
+ windowRect.Top = 0;
+ windowRect.Right = SLtt_Screen_Cols - 1;
+ windowRect.Bottom = SLtt_Screen_Rows - 1;
+
+ if (FALSE == SetConsoleWindowInfo(hStdout, TRUE, &windowRect))
+ return -1;
+
+ return 0;
+}
+
+static int Save_Code_Page = 0;
+static int win32_init (void)
+{
+ SECURITY_ATTRIBUTES sec;
+
+ memset ((char *) &sec, 0, sizeof(SECURITY_ATTRIBUTES));
+ sec.nLength = sizeof (SECURITY_ATTRIBUTES);
+ sec.bInheritHandle = FALSE;
+
+ hStdout = CreateConsoleScreenBuffer(GENERIC_READ | GENERIC_WRITE,
+				 FILE_SHARE_READ|FILE_SHARE_WRITE,
+				 &sec,
+				 CONSOLE_TEXTMODE_BUFFER,
+				 0);
+
+ if (hStdout == INVALID_HANDLE_VALUE)
+ return -1;
+
+ if ((FALSE == SetConsoleActiveScreenBuffer(hStdout))
+ || (FALSE == SetConsoleMode(hStdout, 0))
+ || (-1 == win32_resize ()))
+ {
+	SLtt_reset_video ();
+	return -1;
+ }
+
+ Save_Code_Page = GetConsoleOutputCP ();
+ if (_pSLtt_UTF8_Mode)
+ {
+	(void) SetConsoleOutputCP (65001);
+	(void) fprintf (stderr, "CodePage = %d\n", GetConsoleOutputCP ());
+ }
+ return 0;
+}
+
+int SLtt_init_video (void)
+{
+ SLtt_reset_video ();
+
+ if (-1 == win32_init ())
+ return -1;
+
+ /* It is possible for SLtt_init_video to be called after suspension.
+ * For all I know, the window size may have changed. So, resize it
+ * now.
+ */
+
+ Cursor_Row = Cursor_Col = 0;
+ SLtt_Use_Ansi_Colors = IsColor = 1;
+ Blink_Killed = 1;
+
+ SLtt_reset_scroll_region ();
+ goto_rc_abs (0, 0);
+ fixup_colors ();
+
+ return 0;
+}
+
+int SLtt_reset_video (void)
+{
+ if (hStdout == INVALID_HANDLE_VALUE)
+ return 0;
+
+ SLtt_reset_scroll_region ();
+ SLtt_goto_rc (SLtt_Screen_Rows - 1, 0);
+ Attribute_Byte = 0x7;
+ Current_Color = JNO_COLOR;
+ SLtt_del_eol ();
+ (void) CloseHandle (hStdout);
+
+ hStdout = GetStdHandle (STD_OUTPUT_HANDLE);
+ if (hStdout != INVALID_HANDLE_VALUE)
+ (void) SetConsoleActiveScreenBuffer(hStdout);
+
+ hStdout = INVALID_HANDLE_VALUE;
+ (void) SetConsoleOutputCP (Save_Code_Page);
+ return 0;
+}
+
+#endif
+
+/*}}}*/
+
+#ifdef OS2_VIDEO /*{{{*/
+
+# define INCL_BASE
+# define INCL_NOPM
+# define INCL_VIO
+# define INCL_KBD
+
+# define INCL_DOSPROCESS
+
+# include <os2.h>
+# ifndef __IBMC__
+# include <dos.h>
+# endif
+/* this is how to make a space character */
+#define MK_SPACE_CHAR()	(((Attribute_Byte) << 8) | 0x20)
+
+/* buffer to hold a line of character/attribute pairs */
+#define MAXCOLS 256
+static unsigned char Line_Buffer MAXCOLS*2;
+
+void SLtt_write_string (SLFUTURE_CONST char *str)
+{
+ /* FIXME: Priority=medium
+ * This should not go to stdout. */
+ fputs (str, stdout);
+}
+
+void SLtt_goto_rc (int row, int col)
+{
+ row += Scroll_r1;
+ VioSetCurPos (row, col, 0);
+ Cursor_Row = row;
+ Cursor_Col = col;
+}
+
+static void os2_video_getxy (void)
+{
+ USHORT r, c;
+
+ VioGetCurPos (&r, &c, 0);
+ Cursor_Row = r;
+ Cursor_Col = c;
+}
+
+void SLtt_begin_insert (void)
+{
+ USHORT n;
+
+ os2_video_getxy ();
+ n = SLtt_Screen_Cols - Cursor_Col;
+
+ n = 2 * (n - 1);
+ VioReadCellStr ((PCH)Line_Buffer, &n, Cursor_Row, Cursor_Col, 0);
+ VioWrtCellStr ((PCH)Line_Buffer, n, Cursor_Row, Cursor_Col + 1, 0);
+}
+
+void SLtt_end_insert (void)
+{
+}
+
+void SLtt_delete_char (void)
+{
+ USHORT n;
+
+ os2_video_getxy ();
+ n = SLtt_Screen_Cols - Cursor_Col - 1;
+
+ n *= 2;
+ VioReadCellStr ((PCH)Line_Buffer, &n, Cursor_Row, Cursor_Col + 1, 0);
+ VioWrtCellStr ((PCH)Line_Buffer, n, Cursor_Row, Cursor_Col, 0);
+}
+
+void SLtt_erase_line (void)
+{
+ USHORT w;
+
+ Attribute_Byte = 0x07;
+ w = MK_SPACE_CHAR ();
+
+ VioWrtNCell ((BYTE*)&w, SLtt_Screen_Cols, Cursor_Row, 0, 0);
+
+ Current_Color = JNO_COLOR;		/* since we messed with attribute byte */
+}
+
+void SLtt_delete_nlines (int nlines)
+{
+ SLtt_normal_video ();
+
+ Line_Buffer0 = ' '; Line_Buffer1 = Attribute_Byte;
+ VioScrollUp (Scroll_r1, 0, Scroll_r2, SLtt_Screen_Cols-1,
+		nlines, (PCH) Line_Buffer, 0);
+}
+
+void SLtt_reverse_index (int nlines)
+{
+ SLtt_normal_video ();
+
+ Line_Buffer0 = ' '; Line_Buffer1 = Attribute_Byte;
+ VioScrollDn (Scroll_r1, 0, Scroll_r2, SLtt_Screen_Cols-1,
+		nlines, (PCH) Line_Buffer, 0);
+}
+
+static void os2_video_invert_region (int top_row, int bot_row)
+{
+ int row, col;
+ USHORT length = SLtt_Screen_Cols * 2;
+
+ for (row = top_row; row < bot_row; row++)
+ {
+	VioReadCellStr ((PCH)Line_Buffer, &length, row, 0, 0);
+	for (col = 1; col < length; col += 2)
+	 Line_Buffer col ^= 0xff;
+	VioWrtCellStr ((PCH)Line_Buffer, length, row, 0, 0);
+ }
+}
+
+void SLtt_beep (void)
+{
+ int audible;			/* audible bell */
+ int special = 0;		/* first row to invert */
+ int visual = 0;		/* final row to invert */
+
+ if (!SLtt_Ignore_Beep) return;
+
+ audible = (SLtt_Ignore_Beep & 1);
+
+ if ( (SLtt_Ignore_Beep & 4) )
+ {
+	special = SLtt_Screen_Rows - 1;
+	visual = special--;	/* only invert bottom status line */
+ }
+ else if ( (SLtt_Ignore_Beep & 2) )
+ {
+	visual = SLtt_Screen_Rows;
+ }
+
+ if (visual) os2_video_invert_region (special, visual);
+ if (audible) DosBeep (1500, 100); else DosSleep (100);
+ if (visual) os2_video_invert_region (special, visual);
+}
+
+void SLtt_del_eol (void)
+{
+ USHORT w;
+ if (Current_Color != JNO_COLOR) SLtt_normal_video ();
+
+ w = MK_SPACE_CHAR ();
+
+ VioWrtNCell ((BYTE*)&w, (SLtt_Screen_Cols - Cursor_Col),
+		Cursor_Row, Cursor_Col, 0);
+}
+
+static void
+write_attributes (SLsmg_Char_Type *src, unsigned int count)
+{
+ register unsigned char *p = Line_Buffer;
+ register unsigned short pair;
+ int n = count;
+
+ /* write into a character/attribute pair */
+ while (n-- > 0)
+ {
+	pair = SLSMG_CHAR_TO_USHORT(*src);/* character/color pair */
+	src++;
+	SLtt_reverse_video (pair >> 8);	/* color change */
+	*(p++) = pair & 0xff;		/* character byte */
+	*(p++) = Attribute_Byte;	/* attribute byte */
+ }
+
+ VioWrtCellStr ((PCH)Line_Buffer, (USHORT)(2 * count),
+		 (USHORT)Cursor_Row, (USHORT)Cursor_Col, 0);
+}
+
+void SLtt_cls (void)
+{
+ SLtt_normal_video ();
+ Line_Buffer 0 = ' '; Line_Buffer 1 = Attribute_Byte;
+ VioScrollUp (0, 0, -1, -1, -1, (PCH)Line_Buffer, 0);
+}
+
+void SLtt_putchar (char ch)
+{
+ unsigned short p, *pp;
+
+ if (Current_Color) SLtt_normal_video ();
+ os2_video_getxy ();		/* get current position */
+
+ switch (ch)
+ {
+ case 7:			/* ^G - break */
+	SLtt_beep (); break;
+ case 8:			/* ^H - backspace */
+	goto_rc_abs (Cursor_Row, Cursor_Col - 1); break;
+ case 13:			/* ^M - carriage return */
+	goto_rc_abs (Cursor_Row, 0); break;
+ default:			/* write character to screen */
+ 	VioWrtCharStrAtt (&ch, 1, Cursor_Row, Cursor_Col,
+ 			 (BYTE*)&Attribute_Byte, 0);
+	goto_rc_abs (Cursor_Row, Cursor_Col + 1);
+ }
+}
+
+void SLtt_get_screen_size (void)
+{
+#ifdef __os2__
+# ifdef __IBMC__
+ VIOMODEINFO vioModeInfo;
+# endif
+ vioModeInfo.cb = sizeof(vioModeInfo);
+ VioGetMode (&vioModeInfo, 0);
+ SLtt_Screen_Cols = vioModeInfo.col;
+ SLtt_Screen_Rows = vioModeInfo.row;
+#endif
+}
+
+void SLtt_get_terminfo (void)
+{
+ SLtt_get_screen_size ();
+}
+
+int SLtt_init_video (void)
+{
+ VIOINTENSITY RequestBlock;
+ PTIB ptib;
+ PPIB ppib;
+ USHORT args3 = { 6, 2, 1 };
+
+ Cursor_Row = Cursor_Col = 0;
+
+ IsColor = 1;			/* is it really? */
+
+ /* Enable high-intensity background colors */
+ RequestBlock.cb = sizeof (RequestBlock);
+ RequestBlock.type = 2; RequestBlock.fs = 1;
+ VioSetState (&RequestBlock, 0);	/* nop if !fullscreen */
+
+ DosGetInfoBlocks (&ptib, &ppib);
+ if ((ppib->pib_ultype) == 2) /* VIO */
+ Blink_Killed = 1;
+ else
+ { /* Fullscreen */
+ if (VioSetState (args, 0) == 0)
+	 Blink_Killed = 1;
+ else
+	 Blink_Killed = 0;
+ }
+
+ if (!Attribute_Byte)
+ {
+	/* find the attribute currently under the cursor */
+	USHORT len, r, c;
+
+	len = 2;
+	VioGetCurPos (&r, &c, 0);
+	VioReadCellStr ((PCH)Line_Buffer, &len, r, c, 0);
+	Attribute_Byte = Line_Buffer1;
+
+	SLtt_set_color (JNORMAL_COLOR, NULL,
+			Color_Names(Attribute_Byte) & 0xf,
+			Color_Names(Attribute_Byte) >> 4);
+ }
+
+ SLtt_Use_Ansi_Colors = IsColor;
+ SLtt_get_screen_size ();
+ SLtt_reset_scroll_region ();
+ fixup_colors ();
+
+ return 0;
+}
+
+#endif				 /* OS2_VIDEO */
+/*}}}*/
+
+#ifdef WATCOM_VIDEO /*{{{*/
+
+# include <graph.h>
+# define int86	int386		/* simplify code writing */
+
+#include <dos.h>
+
+/* this is how to make a space character */
+#define MK_SPACE_CHAR()	(((Attribute_Byte) << 8) | 0x20)
+
+/* buffer to hold a line of character/attribute pairs */
+#define MAXCOLS 256
+static unsigned char Line_Buffer MAXCOLS*2;
+
+/* define for direct to memory screen writes */
+static unsigned char *Video_Base;
+#define MK_SCREEN_POINTER(row,col) \
+ ((unsigned short *)(Video_Base + 2 * (SLtt_Screen_Cols * (row) + (col))))
+
+#define ScreenPrimary	(0xb800 << 4)
+#define ScreenSize	(SLtt_Screen_Cols * SLtt_Screen_Rows)
+#define ScreenSetCursor(x,y) _settextposition (x+1,y+1)
+
+void ScreenGetCursor (int *x, int *y)
+{
+ struct rccoord rc = _gettextposition ();
+ *x = rc.row - 1;
+ *y = rc.col - 1;
+}
+
+void ScreenRetrieve (unsigned char *dest)
+{
+ memcpy (dest, (unsigned char *) ScreenPrimary, 2 * ScreenSize);
+}
+
+void ScreenUpdate (unsigned char *src)
+{
+ memcpy ((unsigned char *) ScreenPrimary, src, 2 * ScreenSize);
+}
+
+void SLtt_write_string (SLFUTURE_CONST char *str)
+{
+ /* FIXME: Priority=medium
+ * This should not go to stdout. */
+ fputs (str, stdout);
+}
+
+void SLtt_goto_rc (int row, int col)
+{
+ row += Scroll_r1;
+ if (row > SLtt_Screen_Rows) row = SLtt_Screen_Rows;
+ if (col > SLtt_Screen_Cols) col = SLtt_Screen_Cols;
+ ScreenSetCursor(row, col);
+ Cursor_Row = row;
+ Cursor_Col = col;
+}
+
+static void watcom_video_getxy (void)
+{
+ ScreenGetCursor (&Cursor_Row, &Cursor_Col);
+}
+
+void SLtt_begin_insert (void)
+{
+ unsigned short *p;
+ unsigned short *pmin;
+ int n;
+
+ watcom_video_getxy ();
+ n = SLtt_Screen_Cols - Cursor_Col;
+
+ p = MK_SCREEN_POINTER (Cursor_Row, SLtt_Screen_Cols - 1);
+ pmin = MK_SCREEN_POINTER (Cursor_Row, Cursor_Col);
+
+ while (p-- > pmin) *(p + 1) = *p;
+}
+
+void SLtt_end_insert (void)
+{
+}
+
+void SLtt_delete_char (void)
+{
+ unsigned short *p;
+ register unsigned short *p1;
+ int n;
+
+ watcom_video_getxy ();
+ n = SLtt_Screen_Cols - Cursor_Col - 1;
+
+ p = MK_SCREEN_POINTER (Cursor_Row, Cursor_Col);
+ while (n--)
+ {
+	p1 = p + 1;
+	*p = *p1;
+	p++;
+ }
+}
+
+void SLtt_erase_line (void)
+{
+ unsigned short w;
+ unsigned short *p = MK_SCREEN_POINTER (Cursor_Row, 0);
+ register unsigned short *pmax = p + SLtt_Screen_Cols;
+
+ Attribute_Byte = 0x07;
+ w = MK_SPACE_CHAR ();
+ while (p < pmax) *p++ = w;
+ Current_Color = JNO_COLOR;		/* since we messed with attribute byte */
+}
+
+void SLtt_delete_nlines (int nlines)
+{
+ union REGS r;
+
+ SLtt_normal_video ();
+ r.x.eax = nlines;
+ r.x.ecx = 0;
+ r.h.ah = 6;
+ r.h.ch = Scroll_r1;
+ r.h.dl = SLtt_Screen_Cols - 1;
+ r.h.dh = Scroll_r2;
+ r.h.bh = Attribute_Byte;
+ int86 (0x10, &r, &r);
+}
+
+void SLtt_reverse_index (int nlines)
+{
+ union REGS r;
+
+ SLtt_normal_video ();
+ r.h.al = nlines;
+ r.x.ecx = 0;
+ r.h.ah = 7;
+ r.h.ch = Scroll_r1;
+ r.h.dl = SLtt_Screen_Cols - 1;
+ r.h.dh = Scroll_r2;
+ r.h.bh = Attribute_Byte;
+ int86 (0x10, &r, &r);
+}
+
+static void watcom_video_invert_region (int top_row, int bot_row)
+{
+ unsigned char buf 2 * 180 * 80; /* 180 cols x 80 rows */
+ unsigned char *b, *bmax;
+
+ b = buf + 1 + 2 * SLtt_Screen_Cols * top_row;
+ bmax = buf + 1 + 2 * SLtt_Screen_Cols * bot_row;
+ ScreenRetrieve (buf);
+ while (b < bmax)
+ {
+	*b ^= 0xFF;
+	b += 2;
+ }
+ ScreenUpdate (buf);
+}
+
+void SLtt_beep (void)
+{
+ int audible;			/* audible bell */
+ int special = 0;		/* first row to invert */
+ int visual = 0;		/* final row to invert */
+
+ if (!SLtt_Ignore_Beep) return;
+
+ audible = (SLtt_Ignore_Beep & 1);
+ if ( (SLtt_Ignore_Beep & 4) )
+ {
+	special = SLtt_Screen_Rows - 1;
+	visual = special--;	/* only invert bottom status line */
+ }
+ else if ( (SLtt_Ignore_Beep & 2) )
+ {
+	visual = SLtt_Screen_Rows;
+ }
+
+ if (visual) watcom_video_invert_region (special, visual);
+ if (audible) sound (1500); delay (100); if (audible) nosound ();
+ if (visual) watcom_video_invert_region (special, visual);
+}
+
+void SLtt_del_eol (void)
+{
+ unsigned short *p, *pmax;
+ unsigned short w;
+ int n;
+
+ n = SLtt_Screen_Cols - Cursor_Col;
+ p = MK_SCREEN_POINTER (Cursor_Row, Cursor_Col);
+ pmax = p + n;
+
+ if (Current_Color != JNO_COLOR) SLtt_normal_video ();
+
+ w = MK_SPACE_CHAR ();
+ while (p < pmax) *p++ = w;
+}
+
+static void
+write_attributes (SLsmg_Char_Type *src, unsigned int count)
+{
+ register unsigned short pair;
+ register unsigned short *pos = MK_SCREEN_POINTER (Cursor_Row, 0);
+
+ /* write into a character/attribute pair */
+ while (count--)
+ {
+	pair = SLSMG_CHAR_TO_USHORT(*src);/* character/color pair */
+	src++;
+	SLtt_reverse_video (pair >> 8);	/* color change */
+	*(pos++) = ((unsigned short) Attribute_Byte << 8) | (pair & 0xff);
+ }
+}
+
+void SLtt_cls (void)
+{
+ SLtt_normal_video ();
+ SLtt_reset_scroll_region ();
+ SLtt_goto_rc (0, 0);
+ SLtt_delete_nlines (SLtt_Screen_Rows);
+}
+
+void SLtt_putchar (char ch)
+{
+ unsigned short p, *pp;
+
+ if (Current_Color) SLtt_normal_video ();
+ watcom_video_getxy ();
+ switch (ch)
+ {
+ case 7:			/* ^G - break */
+	SLtt_beep (); break;
+ case 8:			/* ^H - backspace */
+	goto_rc_abs (Cursor_Row, Cursor_Col - 1); break;
+ case 13:			/* ^M - carriage return */
+	goto_rc_abs (Cursor_Row, 0); break;
+ default:			/* write character to screen */
+	p = (Attribute_Byte << 8) | (unsigned char) ch;
+	pp = MK_SCREEN_POINTER (Cursor_Row, Cursor_Col);
+	*pp = p;
+	goto_rc_abs (Cursor_Row, Cursor_Col + 1);
+ }
+}
+
+void SLtt_get_screen_size (void)
+{
+ struct videoconfig vc;
+ _getvideoconfig(&vc);
+
+ SLtt_Screen_Rows = vc.numtextrows;
+ SLtt_Screen_Cols = vc.numtextcols;
+}
+
+void SLtt_get_terminfo (void)
+{
+ SLtt_get_screen_size ();
+}
+
+int SLtt_init_video (void)
+{
+#ifdef HAS_SAVE_SCREEN
+ save_screen ();
+#endif
+
+ Cursor_Row = Cursor_Col = 0;
+ Video_Base = (unsigned char *) ScreenPrimary;
+ if (!Attribute_Byte) Attribute_Byte = 0x17;
+ IsColor = 1;			/* is it really? */
+
+ if (IsColor)
+ {
+	union REGS r;
+	r.x.eax = 0x1003; r.x.ebx = 0;
+	int86 (0x10, &r, &r);
+	Blink_Killed = 1;
+ }
+
+ SLtt_Use_Ansi_Colors = IsColor;
+ SLtt_get_screen_size ();
+ SLtt_reset_scroll_region ();
+ fixup_colors ();
+
+ return 0;
+}
+
+#endif				 /* WATCOM_VIDEO */
+
+/*}}}*/
+
+/* -------------------------------------------------------------------------*\
+ * The rest of the functions are, for the most part, independent of a specific
+ * video system.
+\* ------------------------------------------------------------------------ */
+
+/*----------------------------------------------------------------------*\
+ * Function:	void SLtt_set_scroll_region (int r1, int r2);
+ *
+ * define a scroll region of top_row to bottom_row
+\*----------------------------------------------------------------------*/
+void SLtt_set_scroll_region (int top_row, int bottom_row)
+{
+ Scroll_r1 = top_row;
+ Scroll_r2 = bottom_row;
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	void SLtt_reset_scroll_region (void);
+ *
+ * reset the scrol region to be the entire screen,
+ * ie, SLtt_set_scroll_region (0, SLtt_Screen_Rows);
+\*----------------------------------------------------------------------*/
+void SLtt_reset_scroll_region (void)
+{
+ Scroll_r1 = 0;
+ Scroll_r2 = SLtt_Screen_Rows - 1;
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	int SLtt_flush_output (void);
+\*----------------------------------------------------------------------*/
+int SLtt_flush_output (void)
+{
+#if defined(WIN32_VIDEO)
+ return 0;
+#else
+ /* FIXME: Priority=medium
+ * This should not go to stdout. */
+ fflush (stdout);
+ return 0;
+#endif
+}
+
+int SLtt_set_cursor_visibility (int show)
+{
+#if defined(WIN32_VIDEO)
+ CONSOLE_CURSOR_INFO c;
+
+ if (0 == GetConsoleCursorInfo (hStdout, &c))
+ return -1;
+ c.bVisible = (show ? TRUE: FALSE);
+ if (0 == SetConsoleCursorInfo (hStdout, &c))
+ return -1;
+ return 0;
+#else
+ (void) show;
+ return -1;
+#endif
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	void SLtt_reverse_video (int color);
+ *
+ * set Attribute_Byte corresponding to COLOR.
+ * Use Current_Color to remember the color which was set.
+ * convert from the COLOR number to the attribute value.
+\*----------------------------------------------------------------------*/
+void SLtt_reverse_video (int color)
+{
+ if ((color >= JMAX_COLORS) || (color < 0))
+ return;
+
+ Attribute_Byte = Color_Map color;
+ Current_Color = color;
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	void SLtt_normal_video (void);
+ *
+ * reset the attributes for normal video
+\*----------------------------------------------------------------------*/
+void SLtt_normal_video (void)
+{
+ SLtt_reverse_video (JNORMAL_COLOR);
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	void SLtt_smart_puts (SLsmg_Char_Type *new_string,
+ *				 SLsmg_Char_Type *old_string,
+ *				 int len, int row);
+ *
+ * puts NEW_STRING, which has length LEN, at row ROW. NEW_STRING contains
+ * characters/colors packed in the form value = ((color << 8) | (ch));
+ *
+ * the puts tries to avoid overwriting the same characters/colors
+ *
+ * OLD_STRING is not used, maintained for compatibility with other systems
+\*----------------------------------------------------------------------*/
+void SLtt_smart_puts (SLsmg_Char_Type *new_string,
+		 SLsmg_Char_Type *old_string,
+		 int len, int row)
+{
+ (void) old_string;
+ Cursor_Row = row;
+ Cursor_Col = 0;
+ /* fprintf (stderr, "smart_puts called: len=%d, row=%d\n", len, row); */
+ /* return; */
+ write_attributes (new_string, len);
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	int SLtt_reset_video (void);
+\*----------------------------------------------------------------------*/
+#ifndef WIN32_VIDEO
+int SLtt_reset_video (void)
+{
+ SLtt_reset_scroll_region ();
+ SLtt_goto_rc (SLtt_Screen_Rows - 1, 0);
+#ifdef HAS_SAVE_SCREEN
+ restore_screen ();
+#endif
+ Attribute_Byte = 0x07;
+ Current_Color = JNO_COLOR;
+ SLtt_del_eol ();
+ return 0;
+}
+#endif
+
+/* FIXME: This does nothing with the attributes */
+static char *parse_color_and_attributes (char *f, char *buf, size_t buflen)
+{
+ SLCONST char *s;
+ size_t len;
+
+ s = strchr (f, ';');
+ if (s == NULL) return f;
+
+ len = s - f;
+ if (len >= buflen) len = buflen-1;
+ strncpy (buf, f, len);
+ buflen = 0;
+
+ return buf;
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	void SLtt_set_color (int obj, char *what, char *fg, char *bg);
+ *
+ * set foreground and background colors of OBJ to the attributes which
+ * correspond to the names FG and BG, respectively.
+ *
+ * WHAT is the name corresponding to the object OBJ, but is not used in
+ * this routine.
+\*----------------------------------------------------------------------*/
+int SLtt_set_color (int obj, SLFUTURE_CONST char *what, SLFUTURE_CONST char *fg, SLFUTURE_CONST char *bg)
+{
+ int i, b = 0, f = 7;
+ char fgbuf32, bgbuf32;
+
+ (void) what;
+
+ if ((obj < 0) || (obj >= JMAX_COLORS))
+ return -1;
+
+ fg = parse_color_and_attributes ((char *)fg, fgbuf, sizeof(fgbuf));
+ bg = parse_color_and_attributes ((char *)bg, bgbuf, sizeof(bgbuf));
+
+ for (i = 0; i < JMAX_COLOR_NAMES; i++ )
+ {
+	if (!strcmp (fg, Color_Names i))
+	 {
+	 f = i;
+	 break;
+	 }
+ }
+
+ for (i = 0; i < JMAX_COLOR_NAMES; i++)
+ {
+	if (!strcmp (bg, Color_Names i))
+	 {
+	 if (Blink_Killed) b = i; else b = i & 0x7;
+	 break;
+	 }
+ }
+ if (f == b) return 0;
+
+ Color_Map obj = (b << 4) | f;
+
+ /* if we're setting the normal color, and the attribute byte hasn't
+ been set yet, set it to the new color */
+ if ((obj == 0) && (Attribute_Byte == 0))
+ SLtt_reverse_video (0);
+
+ if (_pSLtt_color_changed_hook != NULL)
+ (*_pSLtt_color_changed_hook)();
+
+ return 0;
+}
+
+static void fixup_colors (void)
+{
+ unsigned int i;
+
+ if (Blink_Killed)
+ return;
+
+ for (i = 0; i < JMAX_COLORS; i++)
+ Color_Mapi &= 0x7F;
+
+ SLtt_normal_video ();
+}
+
+/* FIXME!!! Add mono support.
+ * The following functions have not been fully implemented.
+ */
+int SLtt_set_mono (int obj_unused, SLFUTURE_CONST char *unused, SLtt_Char_Type c_unused)
+{
+ (void) obj_unused;
+ (void) unused;
+ (void) c_unused;
+ return 0;
+}
+
+#if 0
+void SLtt_add_color_attribute (int obj, SLtt_Char_Type attr)
+{
+ (void) obj;
+ (void) attr;
+}
+#endif
+
+int SLtt_utf8_enable (int mode)
+{
+ /* FIXME: UTF-8 mode is disabled until the drivers support UTF-8 */
+ mode = 0;
+
+ if (mode == -1)
+ mode = _pSLtt_UTF8_Mode;
+
+ return _pSLtt_UTF8_Mode = mode;
+}
+
+int SLtt_is_utf8_mode (void)
+{
+ return _pSLtt_UTF8_Mode;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slvmstty.c Added

@@ -0,0 +1,399 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include <ssdef.h>
+#include <rmsdef.h>
+#include <dvidef.h>
+#include <jpidef.h>
+#include <descrip.h>
+#include <iodef.h>
+#include <ttdef.h>
+#include <tt2def.h>
+#include <rms.h>
+#include <errno.h>
+
+#ifdef __DECC
+#include <starlet.h>
+#include <lib$routines>
+#endif
+
+#include "slang.h"
+#include "_slang.h"
+
+/* If this function returns -1, ^Y will be added to input buffer. */
+int (*SLtty_VMS_Ctrl_Y_Hook) (void);
+
+typedef struct { /* I/O status block */
+ short i_cond; /* Condition value */
+ short i_xfer; /* Transfer count */
+ long i_info; /* Device information */
+} Iosb_Type;
+
+typedef struct { /* Terminal characteristics */
+ char t_class; /* Terminal class */
+ char t_type; /* Terminal type */
+ short t_width; /* Terminal width in characters */
+ long t_mandl; /* Terminal's mode and length */
+ long t_extend; /* Extended terminal characteristics */
+} TermChar_Type;
+
+static TermChar_Type Old_Term_Char, New_Term_Char;
+
+/* This serves to identify the channel we are reading input from. */
+static short This_Term;
+
+typedef struct
+{
+ short buflen;
+ short item_code;
+ int *buf_addr;
+ int *len_addr;
+} item_list_3;
+
+static int TTY_Inited;
+
+/*
+ * Exit Handler Control Block
+ */
+static struct argument_block
+ {
+ int forward_link;
+ int (*exit_routine)();
+ int arg_count;
+ int *status_address;
+ int exit_status;
+ }
+exit_block =
+ {
+ 0,
+ NULL,
+ 1,
+ &exit_block.exit_status,
+ 0
+ };
+
+static void vms_cancel_exithandler()
+{
+ sys$canexh(exit_block);
+}
+
+static int vms_exit_handler ()
+{
+ if (TTY_Inited == 0) return 0;
+ SLang_reset_tty ();
+ return 0;
+}
+
+static int vms_input_buffer;
+
+static struct vms_ast_iosb
+{
+ short status;
+ short offset;
+ short termlen;
+ short term;
+} vms_ast_iosb;
+
+static void vms_que_key_ast();
+static int Ast_Fired_Event_Flag;
+static int Timer_Event_Flag;
+static int Event_Flag_Mask;
+static int Ast_Stop_Input;
+static int Waiting_For_Ast;
+
+static int getkey_ast(int not_used)
+{
+ unsigned int c = 1000;
+
+ if (vms_ast_iosb.offset)
+ {
+	c = (unsigned int) vms_input_buffer;
+ }
+
+ if (c <= 255)
+ {
+	if (c == SLang_Abort_Char)
+	 {
+	 if (SLang_Ignore_User_Abort == 0)
+	 SLang_set_error (SL_USER_BREAK);
+	 SLKeyBoard_Quit = 1;
+	 }
+
+	if ((c != 0x19)		 /* ^Y */
+	 || (SLtty_VMS_Ctrl_Y_Hook == NULL)
+	 || (-1 == (*SLtty_VMS_Ctrl_Y_Hook) ()))
+	 {
+	 if (SLang_Input_Buffer_Len < SL_MAX_INPUT_BUFFER_LEN - 3)
+	 SLang_Input_BufferSLang_Input_Buffer_Len++ = c;
+	 }
+ }
+
+ if (Waiting_For_Ast) sys$setef (Ast_Fired_Event_Flag);
+ Waiting_For_Ast = 0;
+ vms_que_key_ast();
+ return (1);
+}
+
+static void vms_que_key_ast()
+{
+ static int trmmsk 2 = { 0, 0 };
+ int status;
+
+ if (Ast_Stop_Input) return;
+ status = sys$qio (0, This_Term,
+		 IO$_READVBLK | IO$M_NOECHO | IO$_TTYREADALL,
+		 &vms_ast_iosb, getkey_ast, 1,
+		 &vms_input_buffer, 1, 0, trmmsk, 0, 0);
+}
+
+static char TTY_Name8;
+static int This_Process_Pid;
+
+/* FIXME: priority=medium
+ * The keypad state may have been tampered with by the application. So, I
+ * need to get the keypad status at initialization time and then reset it
+ * in the call to SLang_reset_tty. Unfortunately, this will most likely
+ * involve interaction with the sldisply interface.
+ */
+int SLang_init_tty (int a, int flow, int out)
+{
+ Iosb_Type iostatus;
+ int tmp, name_len, status, lastppid, ppid;
+ item_list_3 itmlst3;
+ $DESCRIPTOR ( term, TTY_Name);
+
+ itmlst0.buflen = sizeof(int);
+ itmlst0.item_code = JPI$_PID;
+ itmlst0.buf_addr = &This_Process_Pid;
+ itmlst0.len_addr = &tmp;
+
+ itmlst1.buflen = 7;
+ itmlst1.item_code = JPI$_TERMINAL;
+ itmlst1.buf_addr = (int *) TTY_Name;
+ itmlst1.len_addr = &name_len;
+
+ itmlst2.buflen = 0;
+ itmlst2.item_code = 0;
+ itmlst2.buf_addr = 0;
+ itmlst2.len_addr = 0;
+
+ if (a == -1) a = 3;		 /* ^C */
+ SLang_Abort_Char = a;
+ SLKeyBoard_Quit = 0;
+ TTY_Inited = 1;
+ ppid = 0, lastppid = -1;
+
+ /* Here I get this process pid then I get the master process pid
+ and use the controlling terminal of that process. */
+ while (1)
+ {
+	status = sys$getjpiw(0, /* event flag */
+			 &ppid, /* pid address */
+			 0, /* proc name address */
+			 itmlst,
+			 0, 0, 0);
+
+	if (status != SS$_NORMAL)
+	 {
+	 fprintf(stderr, "PID: %X, status: %X\n", This_Process_Pid, status);
+	 exit(1);
+	 }
+
+	if (lastppid == ppid) break;
+	lastppid = ppid;
+
+	itmlst0.item_code = JPI$_MASTER_PID;
+	itmlst0.buf_addr = &ppid;
+ }
+
+ term.dsc$w_length = name_len;
+ status = sys$assign ( &term, &This_Term, 0, 0 );
+ if (status != SS$_NORMAL)
+ {
+	fprintf(stderr,"Unable to assign input channel\n");
+	fprintf(stderr,"PID: %X, DEV %s, status: %d\n", This_Process_Pid, TTY_Name, status);
+	exit(0);
+ }
+
+ if (NULL == exit_block.exit_routine)
+ {
+	exit_block.exit_routine = (int (*)()) vms_exit_handler;
+	sys$dclexh(&exit_block);
+ }
+
+ /* allocate an event flag and clear it--- used by ast routines. Since
+ * I am only using a few local event flags, there is really no need to
+ * worry about freeing these.
+ *
+ * The event flags are used to avoid timing problems with the getkey AST
+ * as well as for a form of time out.
+ */
+ if (!Ast_Fired_Event_Flag) lib$get_ef (&Ast_Fired_Event_Flag);
+ sys$clref (Ast_Fired_Event_Flag);
+
+ if (!Timer_Event_Flag) lib$get_ef (&Timer_Event_Flag);
+ sys$clref (Timer_Event_Flag);
+
+ /* The working assumption here is that the event flags are in the same
+ * cluster. They need not be but it is very likely that they are.
+ */
+ Event_Flag_Mask = ((unsigned) 1 << (Ast_Fired_Event_Flag % 32));
+ Event_Flag_Mask |= ((unsigned) 1 << (Timer_Event_Flag % 32));
+
+ Waiting_For_Ast = 0;
+ Ast_Stop_Input = 0;
+
+ /* Get the startup terminal characteristics */
+ status = sys$qiow(0,		 /* Wait on event flag zero */
+		 This_Term,	 /* Channel to input terminal */
+		 IO$_SENSEMODE, /* Get current characteristic */
+		 &iostatus,	 /* Status after operation */
+		 0, 0,	 /* No AST service */
+ &Old_Term_Char, /* Terminal characteristics buf */
+		 sizeof(Old_Term_Char),/* Size of the buffer */
+		 0, 0, 0, 0);
+
+ New_Term_Char = Old_Term_Char;
+ New_Term_Char.t_mandl |= TT$M_EIGHTBIT | TT$M_NOECHO;
+ New_Term_Char.t_extend |= TT2$M_PASTHRU | TT2$M_XON;
+
+ status = sys$qiow(0,		 /* Wait on event flag zero */
+		 This_Term,	 /* Channel to input terminal */
+		 IO$_SETMODE, /* Set current characteristic */
+		 &iostatus,	 /* Status after operation */
+		 0, 0,	 /* No AST service */
+ &New_Term_Char, /* Terminal characteristics buf */
+		 sizeof(New_Term_Char),/* Size of the buffer */
+		 0, 0, 0, 0);
+
+ vms_que_key_ast(); /* set up the key ast */
+ return 0;
+}
+
+static void cancel_ast (void)
+{
+ if (TTY_Inited == 0) return;
+
+ /* stop the keyboard ast */
+ sys$setast (0);		 /* disable AST delivery */
+ sys$clref (Ast_Fired_Event_Flag);
+ Waiting_For_Ast = 1;
+ Ast_Stop_Input = 1;
+
+ /* cancel all i/o on this channel. This canels pending, as well as those
+ * already in progress and queued. In particular, according to the
+ * manuals, cancelling I/O on the channel will cause the getkey AST
+ * to fire even though the sys$qio call was aborted. This is crucial
+ * because below we wait for the AST to set the event flag.
+ */
+ sys$cancel (This_Term);
+ sys$setast (1);		 /* enable ASTs again */
+ sys$waitfr (Ast_Fired_Event_Flag); /* sleep until it fires */
+ Waiting_For_Ast = 0;
+}
+
+void SLang_reset_tty (void)
+{
+ Iosb_Type iostatus;
+
+ if (!TTY_Inited) return;
+
+ cancel_ast ();
+ TTY_Inited = 0;
+
+ /* reset the terminal characteristics */
+
+ sys$qiow(0,			 /* event flag 0 */
+	 This_Term,		 /* Channel to input terminal */
+	 IO$_SETMODE,	 /* Set current characteristic */
+	 &iostatus,		 /* Status after operation */
+	 0, 0,		 /* No AST service */
+	 &Old_Term_Char,	 /* Terminal characteristics buf */
+	 sizeof(Old_Term_Char), /* Size of the buffer */
+	 0, 0, 0, 0); 	 /* unused */
+
+}
+
+unsigned int _pSLsys_getkey()
+{
+ unsigned int c;
+
+ if (SLKeyBoard_Quit) return((unsigned int) SLang_Abort_Char);
+
+ /* On VMS, the keyboard ast routine should be stuffing the buffer, so
+ do nothing except sleep */
+
+ /* clear the flag which ast will set */
+ Waiting_For_Ast = 0;
+
+ if (SLang_Input_Buffer_Len) return(SLang_getkey());
+ while (!_pSLsys_input_pending(450));
+ c = SLang_getkey();
+ return(c);
+}
+
+/* waits *secs tenth of seconds for input */
+int _pSLsys_input_pending(int tsecs)
+{
+ unsigned long daytim2;
+
+ if (SLang_Input_Buffer_Len) return(SLang_Input_Buffer_Len);
+
+ if (tsecs < 0)
+ tsecs = -tsecs/100;	 /* tsecs is ms, convert to 1/10 sec */
+
+ if (tsecs)
+ {
+	/* takes a quad word time. If negative, use a relative time. */
+	daytim1 = 0xFFFFFFFF;
+	daytim0 = -(tsecs * 1000 * 1000);
+	/* 1000 * 1000 is a tenth of a sec */
+
+	sys$clref (Ast_Fired_Event_Flag);
+	/* sys$clref (Timer_Event_Flag); sys$setimr call clears this */
+
+	/* set up a flag for the ast so it knows to set the event flag */
+	Waiting_For_Ast = 1;
+
+	sys$setimr(Timer_Event_Flag, daytim, 0, 1);
+
+	/* this will return when ast does its job or timer expires.
+	 * The first argument simply serves to identify the cluster for
+	 * the event flag and that is all. The second argument serves
+	 * to identify the event flags to wait for.
+	 */
+	sys$wflor (Ast_Fired_Event_Flag, Event_Flag_Mask);
+
+	Waiting_For_Ast = 0;
+
+	/* cancel the timer */
+	sys$cantim(1, 3); /* 3 is user mode */
+ }
+ return (SLang_Input_Buffer_Len);
+}
+
+int SLang_set_abort_signal (void (*f)(int))
+{
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/slw32tty.c Added

@@ -0,0 +1,370 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+#include "slinclud.h"
+
+#include <windows.h>
+#include <winbase.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+#ifdef __cplusplus
+# define _DOTS_ ...
+#else
+# define _DOTS_ void
+#endif
+
+static int Process_Mouse_Events;
+
+/*----------------------------------------------------------------------*\
+ * Function:	static void set_ctrl_break (int state);
+ *
+ * set the control-break setting
+\*----------------------------------------------------------------------*/
+static void set_ctrl_break (int state)
+{
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	int SLang_init_tty (int abort_char, int no_flow_control,
+ *				 int opost);
+ *
+ * initialize the keyboard interface and attempt to set-up the interrupt 9
+ * handler if ABORT_CHAR is non-zero.
+ * NO_FLOW_CONTROL and OPOST are only for compatiblity and are ignored.
+\*----------------------------------------------------------------------*/
+
+HANDLE SLw32_Hstdin = INVALID_HANDLE_VALUE;
+
+int SLang_init_tty (int abort_char, int no_flow_control, int opost)
+{
+ (void) opost;
+ (void) no_flow_control;
+
+ SLKeyBoard_Quit = 0;
+
+ if (SLw32_Hstdin != INVALID_HANDLE_VALUE)
+ return 0;
+
+#if 1
+ /* stdin may have been redirected. So try this */
+ SLw32_Hstdin = CreateFile ("CONIN$", GENERIC_READ|GENERIC_WRITE,
+			 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL,
+			 OPEN_EXISTING, 0, NULL);
+ if (SLw32_Hstdin == INVALID_HANDLE_VALUE)
+ return -1;
+#else
+ if (INVALID_HANDLE_VALUE == (SLw32_Hstdin = GetStdHandle(STD_INPUT_HANDLE)))
+ return -1;
+#endif
+
+ if (FALSE == SetConsoleMode(SLw32_Hstdin, ENABLE_WINDOW_INPUT|ENABLE_MOUSE_INPUT))
+ {
+	SLw32_Hstdin = INVALID_HANDLE_VALUE;
+	return -1;
+ }
+
+ if (abort_char > 0)
+ SLang_Abort_Char = abort_char;
+
+ return 0;
+}
+/* SLang_init_tty */
+
+/*----------------------------------------------------------------------*\
+ * Function:	void SLang_reset_tty (void);
+ *
+ * reset the tty before exiting
+\*----------------------------------------------------------------------*/
+void SLang_reset_tty (void)
+{
+ SLw32_Hstdin = INVALID_HANDLE_VALUE;
+ set_ctrl_break (1);
+}
+
+static int process_mouse_event (MOUSE_EVENT_RECORD *m)
+{
+ char buf 8;
+
+ if (Process_Mouse_Events == 0)
+ return -1;
+
+ if (m->dwEventFlags)
+ return -1;			 /* double click or movement event */
+
+ /* A button was either pressed or released. Now make sure that
+ * the shift keys were not also pressed.
+ */
+ if (m->dwControlKeyState
+ & (LEFT_ALT_PRESSED|RIGHT_ALT_PRESSED
+	 |LEFT_CTRL_PRESSED|RIGHT_CTRL_PRESSED
+	 |SHIFT_PRESSED))
+ return -1;
+
+ /* We have a simple press or release. Encode it as an escape sequence
+ * and buffer the result. The encoding is:
+ * 'ESC M b x y'
+ * where b represents the button state, and x,y represent the coordinates.
+ * The ESC is handled by the calling routine.
+ */
+ if (m->dwButtonState & 1) buf3 = ' ';
+ else if (m->dwButtonState & 2) buf3 = ' ' + 2;
+ else if (m->dwButtonState & 4) buf3 = ' ' + 1;
+ else return -1;
+
+ buf0 = 27;
+ buf1 = '';
+ buf2 = 'M';
+
+ buf4 = 1 + ' ' + m->dwMousePosition.X;
+ buf5 = 1 + ' ' + m->dwMousePosition.Y;
+
+ return SLang_buffer_keystring ((unsigned char *)buf, 6);
+}
+
+static int process_key_event (KEY_EVENT_RECORD *key)
+{
+ unsigned int key_state = 0;
+ unsigned int scan;
+ char c1;
+ DWORD d = key->dwControlKeyState;
+ unsigned char buf4;
+
+ if (!key->bKeyDown) return 0;
+ if (d & (LEFT_ALT_PRESSED | RIGHT_ALT_PRESSED))
+ key_state |= _pSLTT_KEY_ALT;
+ if (d & (LEFT_CTRL_PRESSED | RIGHT_CTRL_PRESSED))
+ key_state |= _pSLTT_KEY_CTRL;
+ if (d & SHIFT_PRESSED)
+ key_state |= _pSLTT_KEY_SHIFT;
+
+ scan = key->wVirtualScanCode;
+
+ switch (scan)
+ {
+ case 0x00E:		 /* backspace */
+	return SLang_buffer_keystring ((unsigned char *)"\x7F", 1);
+
+ case 0x003:		 /* 2 key */
+	if (key_state & _pSLTT_KEY_ALT)
+	 break;
+	/* Drop */
+ case 0x039: 		 /* space */
+	if (key_state & _pSLTT_KEY_CTRL)
+	 return SLang_buffer_keystring ((unsigned char *)"\x00\x03", 2);
+	break;
+
+ case 0x007:		 /* 6 key */
+	if (_pSLTT_KEY_CTRL == (key_state & (_pSLTT_KEY_ALT|_pSLTT_KEY_CTRL)))
+	 return SLang_buffer_keystring ((unsigned char *)"\x1E", 1); /* Ctrl-^ */
+	break;
+
+ case 0x00C:		 /* -/_ key */
+	if (_pSLTT_KEY_CTRL == (key_state & (_pSLTT_KEY_ALT|_pSLTT_KEY_CTRL)))
+	 return SLang_buffer_keystring ((unsigned char *)"\x1F", 1);
+	break;
+
+ case 0x00F:		 /* TAB */
+	if (_pSLTT_KEY_SHIFT == key_state)
+	 return SLang_buffer_keystring ((unsigned char *)"\x00\x09", 2);
+	break;
+
+ case 0xE02F:		 /* KEYPAD SLASH */
+ case 0x037:		 /* KEYPAD STAR */
+ case 0x04A:		 /* KEYPAD MINUS */
+ case 0x04E:		 /* KEYPAD PLUS */
+	if (d & NUMLOCK_ON)
+	 break;
+ case 0x047:		 /* KEYPAD HOME */
+ case 0x048:		 /* KEYPAD UP */
+ case 0x049:		 /* KEYPAD PGUP */
+ case 0x04B:		 /* KEYPAD LEFT */
+ case 0x04C:		 /* KEYPAD 5 */
+ case 0x04D:		 /* KEYPAD RIGHT */
+ case 0x04F:		 /* KEYPAD END */
+ case 0x050:		 /* KEYPAD DOWN */
+ case 0x051:		 /* KEYPAD PGDN */
+ case 0x052:		 /* KEYPAD INSERT */
+ case 0x053:		 /* KEYPAD DEL */
+	if (d & ENHANCED_KEY)
+	 scan |= 0xE000;
+	else
+	 {
+	 if (d & NUMLOCK_ON)
+	 break;
+	 }
+	(void) _pSLpc_convert_scancode (scan, key_state, 0);
+	return 0;
+
+ case 0x3b:		 /* F1 */
+ case 0x3c:
+ case 0x3d:
+ case 0x3e:
+ case 0x3f:
+ case 0x40:
+ case 0x41:
+ case 0x42:
+ case 0x43:
+ case 0x44:
+ case 0x57:
+ case 0x58:		 /* F12 */
+	(void) _pSLpc_convert_scancode (scan, key_state, 0);
+ }
+
+ c1 = key->uChar.AsciiChar;
+ if (c1 != 0)
+ {
+	if (_pSLTT_KEY_ALT == (key_state & (_pSLTT_KEY_ALT|_pSLTT_KEY_CTRL)))
+	 {
+	 buf0 = 27;
+	 buf1 = c1;
+	 return SLang_buffer_keystring (buf, 2);
+	 }
+	if (c1 == SLang_Abort_Char)
+	 {
+	 if (SLang_Ignore_User_Abort == 0)
+	 SLang_set_error (USER_BREAK);
+	 SLKeyBoard_Quit = 1;
+	 }
+	buf0 = c1;
+	return SLang_buffer_keystring (buf, 1);
+ }
+ return 0;
+}
+
+static void process_console_records(void)
+{
+ INPUT_RECORD record;
+ DWORD bytesRead;
+ DWORD n = 0;
+
+ if (FALSE == GetNumberOfConsoleInputEvents(SLw32_Hstdin, &n))
+ return;
+
+ while (n > 0)
+ {
+	ReadConsoleInput(SLw32_Hstdin, &record, 1, &bytesRead);
+	switch (record.EventType)
+	 {
+	 case KEY_EVENT:
+	 (void) process_key_event(&record.Event.KeyEvent);
+	 break;
+
+	 case MOUSE_EVENT:
+	 process_mouse_event(&record.Event.MouseEvent);
+	 break;
+
+	 case WINDOW_BUFFER_SIZE_EVENT:
+	 /* process_resize_records(&record.Event.WindowBufferSizeEvent); */
+	 break;
+	 }
+	n--;
+ }
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	int _pSLsys_input_pending (int tsecs);
+ *
+ * sleep for *tsecs tenths of a sec waiting for input
+\*----------------------------------------------------------------------*/
+int _pSLsys_input_pending (int tsecs)
+{
+ long ms;
+
+ if (SLw32_Hstdin == INVALID_HANDLE_VALUE)
+ return -1;
+
+ if (tsecs < 0) ms = -tsecs;	 /* specifies 1/1000 */
+ else ms = tsecs * 100L;	 /* convert 1/10 to 1/1000 secs */
+
+ process_console_records ();
+ while ((ms > 0)
+	 && (SLang_Input_Buffer_Len == 0))
+ {
+	long t;
+
+	t = GetTickCount ();
+
+	(void) WaitForSingleObject (SLw32_Hstdin, ms);
+	process_console_records ();
+	ms -= GetTickCount () - t;
+ }
+
+ return SLang_Input_Buffer_Len;
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	unsigned int _pSLsys_getkey (void);
+ *
+ * wait for and get the next available keystroke.
+ * Also re-maps some useful keystrokes.
+ *
+ *	Backspace (^H)	=>	Del (127)
+ *	Ctrl-Space	=>	^@	(^@^3 - a pc NUL char)
+ *	extended keys are prefixed by a null character
+\*----------------------------------------------------------------------*/
+unsigned int _pSLsys_getkey (void)
+{
+ /* Check the input buffer because _pSLsys_input_pending may have been
+ * called prior to this to stuff the input buffer.
+ */
+ if (SLang_Input_Buffer_Len)
+ return SLang_getkey ();
+
+ if (SLw32_Hstdin == INVALID_HANDLE_VALUE)
+ return SLANG_GETKEY_ERROR;
+
+ while (1)
+ {
+	int status;
+
+	if (SLKeyBoard_Quit)
+	 return SLang_Abort_Char;
+
+	status = _pSLsys_input_pending (600);
+	if (status == -1)
+	 return SLANG_GETKEY_ERROR;
+
+	if (status > 0)
+	 return SLang_getkey ();
+ }
+}
+
+/*----------------------------------------------------------------------*\
+ * Function:	int SLang_set_abort_signal (void (*handler)(int));
+\*----------------------------------------------------------------------*/
+int SLang_set_abort_signal (void (*handler)(int))
+{
+ if (SLw32_Hstdin == INVALID_HANDLE_VALUE)
+ return -1;
+ if (handler == NULL)
+ SLang_Interrupt = process_console_records;
+ return 0;
+}
+
+int SLtt_set_mouse_mode (int mode, int force)
+{
+ (void) force;
+
+ Process_Mouse_Events = mode;
+ return 0;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slwclut.c Added

@@ -0,0 +1,1296 @@
+/* slwclut.c: wide character lookup tables */
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include "slinclud.h"
+#include <string.h>
+
+#include "slang.h"
+#include "_slang.h"
+#include "slischar.h"
+
+#define IS_ASCII256(x) ((x) < 256)
+
+struct SLwchar_Lut_Type
+{
+ unsigned char lut256; /* for chars < 256 */
+ int utf8_mode;
+
+ SLwchar_Type *chmin, *chmax;
+ unsigned int table_len;
+ unsigned int malloced_len;
+ unsigned int char_class;
+};
+
+void SLwchar_free_lut (SLwchar_Lut_Type *r)
+{
+ if (r == NULL)
+ return;
+
+ SLfree ((char *) r->chmin);
+ SLfree ((char *) r->chmax);
+
+ SLfree ((char *) r);
+}
+
+SLwchar_Lut_Type *SLwchar_create_lut (unsigned int num_entries)
+{
+ SLwchar_Lut_Type *r;
+
+ r = (SLwchar_Lut_Type *)SLcalloc (sizeof (SLwchar_Lut_Type), 1);
+ if (r == NULL)
+ return NULL;
+
+ r->chmin = (SLwchar_Type *) _SLcalloc (num_entries, sizeof(SLwchar_Type));
+ r->chmax = (SLwchar_Type *) _SLcalloc (num_entries, sizeof(SLwchar_Type));
+ if ((r->chmin == NULL) || (r->chmax == NULL))
+ {
+ SLwchar_free_lut (r);
+ return NULL;
+ }
+
+ r->malloced_len = num_entries;
+ r->utf8_mode = _pSLinterp_UTF8_Mode;
+ return r;
+}
+
+int SLwchar_add_range_to_lut (SLwchar_Lut_Type *r, SLwchar_Type a, SLwchar_Type b)
+{
+ if (b < a)
+ {
+ SLwchar_Type tmp = a;
+ a = b;
+ b = tmp;
+ }
+
+ if (b < 256)
+ {
+ unsigned char *lut = r->lut;
+ while (a <= b)
+ {
+ luta = 1;
+ a++;
+ }
+ return 0;
+ }
+
+ if (a < 256)
+ {
+ if (-1 == SLwchar_add_range_to_lut (r, a, 255))
+ return -1;
+
+ a = 256;
+ }
+
+ if (r->table_len == r->malloced_len)
+ {
+ SLwchar_Type *chmin, *chmax;
+ unsigned int malloced_len = r->malloced_len + 5;
+
+ chmin = (SLwchar_Type *) _SLrecalloc ((char *)r->chmin, malloced_len, sizeof (SLwchar_Type));
+ if (chmin == NULL)
+ return -1;
+ r->chmin = chmin;
+
+ chmax = (SLwchar_Type *) _SLrecalloc ((char *)r->chmax, malloced_len, sizeof (SLwchar_Type));
+ if (chmax == NULL)
+ return -1;
+
+ r->chmax = chmax;
+ r->malloced_len = malloced_len;
+ }
+
+ r->chminr->table_len = a;
+ r->chmaxr->table_len = b;
+
+ r->table_len += 1;
+
+ return 0;
+}
+
+static void add_char_class (SLwchar_Lut_Type *r, unsigned int char_class)
+{
+ unsigned int i;
+ unsigned char *lut;
+
+ r->char_class |= char_class;
+ lut = r->lut;
+
+ for (i = 0; i < 256; i++)
+ {
+	if (SL_CLASSIFICATION_LOOKUP(i) & char_class)
+	 luti = 1;
+ }
+}
+
+static int wch_in_lut (SLwchar_Lut_Type *r, SLwchar_Type wch)
+{
+ unsigned int i, table_len;
+ SLwchar_Type *chmin, *chmax;
+
+ if (wch < 256)
+ return r->lutwch;
+
+ if (r->char_class
+ && (SL_CLASSIFICATION_LOOKUP(wch) & r->char_class))
+ return 1;
+
+ /* FIXME. I should use a binary search for this... */
+ table_len = r->table_len;
+ chmin = r->chmin;
+ chmax = r->chmax;
+
+ for (i = 0; i < table_len; i++)
+ {
+	if ((wch <= chmaxi)
+	 && (wch >= chmini))
+	 return 1;
+ }
+ return 0;
+}
+
+int SLwchar_in_lut (SLwchar_Lut_Type *r, SLwchar_Type wch)
+{
+ if (r == NULL)
+ return -1;
+
+ return wch_in_lut (r, wch);
+}
+
+SLuchar_Type *SLwchar_skip_range (SLwchar_Lut_Type *r, SLuchar_Type *p,
+ SLuchar_Type *pmax, int ignore_combining,
+ int invert)
+{
+ unsigned char *lut;
+ int utf8_mode;
+
+ if ((r == NULL) || (p == NULL) || (pmax == NULL))
+ return NULL;
+
+ lut = r->lut;
+ invert = (invert != 0);
+ utf8_mode = r->utf8_mode;
+
+ while (p < pmax)
+ {
+ SLwchar_Type wch;
+ SLstrlen_Type dn;
+
+ if ((*p < 0x80)
+	 || (utf8_mode == 0))
+ {
+ if ((int)lut*p == invert)
+	 return p;
+
+ p++;
+ continue;
+ }
+
+ if (NULL == SLutf8_decode (p, pmax, &wch, &dn))
+ {
+ if (invert == 0)
+ return p;
+
+ p++;
+ continue;
+ }
+
+	if ((ignore_combining)
+	 && (0 == SLwchar_wcwidth (wch)))
+	 {
+	 p += dn;
+	 continue;
+	 }
+
+	if (invert == wch_in_lut (r, wch))
+	 return p;
+
+ p += dn;
+ }
+
+ return p;
+}
+
+SLuchar_Type *SLwchar_bskip_range (SLwchar_Lut_Type *r, SLuchar_Type *pmin,
+				 SLuchar_Type *p,
+				 int ignore_combining,
+				 int invert)
+{
+ unsigned char *lut;
+ SLuchar_Type *pmax;
+ int utf8_mode;
+
+ if ((r == NULL) || (p == NULL) || (pmin == NULL))
+ return NULL;
+
+ lut = r->lut;
+ pmax = p;
+
+ invert = (invert != 0);
+ utf8_mode = r->utf8_mode;
+
+ while (p > pmin)
+ {
+	SLuchar_Type *p0;
+ SLwchar_Type wch;
+ SLstrlen_Type dn;
+
+	p0 = p - 1;
+ if ((*p0 < 0x80) || (utf8_mode == 0))
+ {
+ if ((int)lut*p0 == invert)
+	 return p;
+
+	 p = p0;
+	 continue;
+	 }
+
+	p0 = SLutf8_bskip_char (pmin, p);
+
+ if (NULL == SLutf8_decode (p0, pmax, &wch, &dn))
+ {
+ if (invert)
+ return p;
+
+ p = p0;
+ continue;
+ }
+
+	if ((ignore_combining)
+	 && (0 == SLwchar_wcwidth (wch)))
+	 {
+	 p = p0;
+	 continue;
+	 }
+
+	if (invert == wch_in_lut (r, wch))
+	 return p;
+
+ p = p0;
+ }
+
+ return p;
+}
+
+/*
+ * Special Range characters:
+ *
+ * \w matches a unicode "word" character, taken to be alphanumeric.
+ * \a alpha character, excluding digits
+ * \s matches whitespace
+ * \l matches lowercase
+ * \u matches uppercase
+ * \d matches a digit
+ */
+
+/* QUESTION: What is the encoding of the range? Is it utf-8? I suspect
+ * it ought to be. For example, a jed .sl file may use:
+ *
+ * skip_chars ("\\w\u{ADFF}-\u{AFFF}");
+ *
+ * to skip words chars and chars in the range 0xADFF-0xAFFF. By the time it
+ * gets here, the parser will have converted the wchars \u{ADFF} and \u{AFFF}
+ * to their UTF-8 equivalents. Hence the function needs to use SLutf8_decode
+ * to get characters.
+ */
+
+typedef struct
+{
+ SLCONST char *name;
+ char escaped_form;
+}
+Posix_Char_Class_Type;
+
+static Posix_Char_Class_Type Posix_Char_Class_Table =
+{
+ {"alnum", 'w'},
+ {"alpha", 'a'},
+ {"blank", 'b'},
+ {"cntrl", 'c'},
+ {"digit", 'd'},
+ {"graph", 'g'},
+ {"lower", 'l'},
+ {"print", 'p'},
+ {"punct", ','},
+ {"space", 's'},
+ {"upper", 'u'},
+ {"xdigit", 'x'},
+ {NULL, 0}
+};
+
+static int is_posix_charclass (SLuchar_Type **up, SLuchar_Type *umax, SLwchar_Type *char_classp)
+{
+ SLuchar_Type *u, *u1;
+ size_t len;
+ Posix_Char_Class_Type *p;
+
+ u = *up;
+ if (*u != ':')
+ return 0;
+ u++;
+
+ u1 = u;
+ while ((u1 < umax)
+	 && (*u1 >= 'a')
+	 && (*u1 <= 'z'))
+ u1++;
+
+ if (((u1+1) >= umax) || (u10 != ':') || (u11 != ''))
+ return 0;
+
+ len = u1 - u;
+ p = Posix_Char_Class_Table;
+ while (p->name != NULL)
+ {
+	if ((0 == strncmp (p->name, (char *) u, len))
+	 && (p->namelen == 0))
+	 {
+	 *char_classp = p->escaped_form;
+	 *up = u1 + 2;
+	 return 1;
+	 }
+	p++;
+ }
+ _pSLang_verror (SL_NotImplemented_Error, "Character class in range specification is unknown or unsupported");
+ return -1;
+}
+
+static int get_lex_char (SLuchar_Type **up, SLuchar_Type *umax,
+			 int allow_charclass,
+			 SLwchar_Type *chp, SLwchar_Type *char_classp)
+{
+ SLuchar_Type *u;
+ SLwchar_Type ch;
+
+ u = *up;
+ if (u == umax)
+ {
+	*chp = 0;
+	*char_classp = 0;
+	return 0;
+ }
+
+ if (NULL == (u = _pSLinterp_decode_wchar (u, umax, &ch)))
+ return -1;
+
+ if ((ch == '') && allow_charclass)
+ {
+	int status = is_posix_charclass (&u, umax, &ch);
+	if (status != 0)
+	 {
+	 if (status == 1)
+	 {
+		 *chp = *char_classp = ch;
+		 *up = u;
+	 }
+	 return status;
+	 }
+ }
+
+ if ((ch != '\\') || (allow_charclass == 0)
+ || (u == umax)) /* Permit a single backslash as the last character */
+ {
+	*char_classp = 0;
+	*chp = ch;
+	*up = u;
+	return 0;
+ }
+
+ /* Here, ch=='\\' and *u represents the next character. */
+
+ /* Allow \\ and \^ to represent \ and ^, resp. Supporting \^ is useful
+ * in constructs such as "\\^x" since "^x" may mean anything but x, and not
+ * '^' or 'x'.
+ */
+ ch = *u;
+ if ((ch == '\\') || (ch == '^'))
+ {
+	*char_classp = 0;
+	*chp = ch;
+	*up = u+1;
+	return 0;
+ }
+
+ if (NULL == (u = _pSLinterp_decode_wchar (u, umax, &ch)))
+ return -1;
+
+ *chp = *char_classp = ch;
+ *up = u;
+ return 0;
+}
+
+typedef struct
+{
+#define LEXICAL_CHAR_TYPE	1
+#define LEXICAL_RANGE_TYPE	2
+#define LEXICAL_CLASS_TYPE	3
+ int lexical_type;
+ union
+ {
+	SLwchar_Type range2;
+	SLwchar_Type wch;
+	int char_class;
+ }
+ e;
+}
+Lexical_Element_Type;
+
+static SLuchar_Type *get_lexical_element (SLuchar_Type *u, SLuchar_Type *umax,
+					 int allow_range,
+					 int allow_charclass,
+					 Lexical_Element_Type *lex)
+{
+ SLwchar_Type r0, r1;
+ SLwchar_Type char_class;
+
+ if (u == umax)
+ return NULL;
+
+ if (-1 == get_lex_char (&u, umax, allow_charclass, &r0, &char_class))
+ return NULL;
+
+ if (char_class)
+ {
+	lex->lexical_type = LEXICAL_CLASS_TYPE;
+	switch (char_class)
+	 {
+	 case '7':
+	 lex->e.char_class = SLCHARCLASS_ASCII;
+	 break;
+
+	 case 'a':	 /* alpha */
+	 lex->e.char_class = SLCHARCLASS_ALPHA;
+	 break;
+
+	 case 'b':
+	 lex->e.char_class = SLCHARCLASS_BLANK;
+	 break;
+
+	 case 'c':
+	 lex->e.char_class = SLCHARCLASS_CNTRL;
+	 break;
+
+	 case 'd':	 /* digit */
+	 lex->lexical_type = LEXICAL_RANGE_TYPE;
+	 lex->e.range0 = '0';
+	 lex->e.range1 = '9';
+	 break;
+
+	 case 'g':
+	 lex->e.char_class = SLCHARCLASS_GRAPH;
+	 break;
+
+	 case 'l':	 /* lowercase */
+	 lex->e.char_class = SLCHARCLASS_LOWER;
+	 break;
+
+	 case 'p':	 /* printable */
+	 lex->e.char_class = SLCHARCLASS_PRINT;
+	 break;
+
+	 case ',':	 /* punctuation */
+	 lex->e.char_class = SLCHARCLASS_PUNCT;
+	 break;
+
+	 case 's':	 /* whitespace */
+	 lex->e.char_class = SLCHARCLASS_SPACE;
+	 break;
+
+	 case 'u':	 /* uppercase */
+	 lex->e.char_class = SLCHARCLASS_UPPER;
+	 break;
+
+	 case 'x':
+	 lex->e.char_class = SLCHARCLASS_XDIGIT;
+	 break;
+
+	 case 'w':	 /* alphanumeric */
+	 lex->e.char_class = SLCHARCLASS_ALPHA|SLCHARCLASS_XDIGIT;
+	 break;
+
+	 default:
+	 _pSLang_verror (SL_INVALID_PARM, "Invalid character class '%c'.", char_class);
+	 return NULL;
+	 }
+	return u;
+ }
+
+ if ((*u != '-') || (allow_range == 0)
+ || (u+1 == umax))/* Allow '-' to occur at the end without being interpreted as a range */
+ {
+	lex->lexical_type = LEXICAL_CHAR_TYPE;
+	lex->e.wch = r0;
+	return u;
+ }
+
+ u++;
+
+ if (-1 == get_lex_char (&u, umax, allow_charclass, &r1, &char_class))
+ return NULL;
+
+ if (char_class)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Character class not allowed in a range");
+	return NULL;
+ }
+
+ if (r1 == 0)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Unfinished range specification");
+	return NULL;
+ }
+
+ lex->lexical_type = LEXICAL_RANGE_TYPE;
+ lex->e.range0 = r0;
+ lex->e.range1 = r1;
+ return u;
+}
+
+SLwchar_Lut_Type *SLwchar_strtolut (SLuchar_Type *u,
+				 int allow_range, int allow_charclass)
+{
+ SLuchar_Type *umax;
+ SLwchar_Lut_Type *r;
+ Lexical_Element_Type lex;
+
+ r = SLwchar_create_lut (32);
+ if (r == NULL)
+ return NULL;
+
+ umax = u + strlen ((char *) u);
+
+ while (u < umax)
+ {
+	if (NULL == (u = get_lexical_element (u, umax, allow_range, allow_charclass, &lex)))
+	 goto return_error;
+
+	switch (lex.lexical_type)
+	 {
+	 case LEXICAL_CHAR_TYPE:
+	 if (-1 == SLwchar_add_range_to_lut (r, lex.e.wch, lex.e.wch))
+	 goto return_error;
+	 break;
+
+	 case LEXICAL_RANGE_TYPE:
+	 if (-1 == SLwchar_add_range_to_lut (r, lex.e.range0, lex.e.range1))
+	 goto return_error;
+	 break;
+
+	 case LEXICAL_CLASS_TYPE:
+	 add_char_class (r, lex.e.char_class);
+	 break;
+	 }
+ }
+ return r;
+
+ return_error:
+ SLwchar_free_lut (r);
+ return NULL;
+}
+
+/* This structure is used for mapping 1 character to another, and is used
+ * by, e.g., strtrans.
+ *
+ * The most efficient implementation that I have come up with requires a
+ * many-1 mapping between _constructs_ in the "from" list and the "to" list.
+ * Here a _construct_ is a single character, range, or a character class.
+ * The following mappings are legal:
+ *
+ * Character --> Character
+ * Range --> Character
+ * Range --> Equal length range
+ * Range	--> Class (upper or lower)
+ * Class --> Character
+ * Class --> Compatible Class
+ *
+ * For inversion, the only mapping that makes sense is a many to one mapping.
+ * For example, strtrans(str, "^A-Za-z", "x"), should replace any character
+ * that is not one of the ranges A-Z and a-z by x.
+ */
+typedef struct Char_Map_Type
+{
+ int (*map_function)(Lexical_Element_Type *, Lexical_Element_Type *, int,
+		 SLwchar_Type, SLwchar_Type *);
+
+ Lexical_Element_Type from;
+ Lexical_Element_Type to;
+
+ struct Char_Map_Type *next;
+}
+Char_Map_Type;
+
+struct SLwchar_Map_Type
+{
+ /* for chars < 256. */
+ SLwchar_Type chmap256;
+
+ int invert;
+ Char_Map_Type *list;
+};
+
+static int map_char_to_char_method (Lexical_Element_Type *from,
+				 Lexical_Element_Type *to, int invert,
+				 SLwchar_Type in, SLwchar_Type *out)
+{
+ int ok = (in == from->e.wch);
+ if (0 == (ok ^ invert))
+ return 0;
+
+ *out = to->e.wch;
+ return 1;
+}
+
+static int map_range_to_char_method (Lexical_Element_Type *from,
+				 Lexical_Element_Type *to, int invert,
+				 SLwchar_Type in, SLwchar_Type *out)
+{
+ int ok = ((in >= from->e.range0) && (in <= from->e.range1));
+ if (0 == (ok ^ invert))
+ return 0;
+
+ *out = to->e.wch;
+ return 1;
+}
+
+static int map_range_to_range_method (Lexical_Element_Type *from,
+				 Lexical_Element_Type *to, int invert,
+				 SLwchar_Type in, SLwchar_Type *out)
+{
+ int ok = ((in >= from->e.range0) && (in <= from->e.range1));
+ if (0 == (ok ^ invert))
+ return 0;
+
+ *out = to->e.range0 + (in - from->e.range0);
+ return 1;
+}
+
+static int map_range_to_class_method (Lexical_Element_Type *from,
+				 Lexical_Element_Type *to, int invert,
+				 SLwchar_Type in, SLwchar_Type *out)
+{
+ int ok = ((in >= from->e.range0) && (in <= from->e.range1));
+ if (0 == (ok ^ invert))
+ return 0;
+
+ if (to->e.char_class == SLCHARCLASS_UPPER)
+ *out = SLwchar_toupper (in);
+ else if (to->e.char_class == SLCHARCLASS_LOWER)
+ *out = SLwchar_tolower (in);
+ else
+ return 0;
+
+ return 1;
+}
+
+static int is_of_class (int char_class, SLwchar_Type w)
+{
+ switch (char_class)
+ {
+ case SLCHARCLASS_ALPHA:
+	return SLwchar_isalpha (w);
+
+ case SLCHARCLASS_ALPHA|SLCHARCLASS_XDIGIT:
+	return SLwchar_isalnum (w);
+
+ case SLCHARCLASS_UPPER:
+	return SLwchar_isupper (w);
+
+ case SLCHARCLASS_LOWER:
+	return SLwchar_islower (w);
+
+ case SLCHARCLASS_SPACE:
+	return SLwchar_isspace (w);
+
+ case SLCHARCLASS_ASCII:
+	return w < (SLwchar_Type)0x80;
+ }
+
+ return 0;
+}
+
+static int map_class_to_char_method (Lexical_Element_Type *from,
+				 Lexical_Element_Type *to, int invert,
+				 SLwchar_Type in, SLwchar_Type *out)
+{
+ int ok = is_of_class (from->e.char_class, in);
+ if (0 == (ok ^ invert))
+ return 0;
+
+ *out = to->e.wch;
+ return 1;
+}
+
+static int map_class_to_class_method (Lexical_Element_Type *from,
+				 Lexical_Element_Type *to, int invert,
+				 SLwchar_Type in, SLwchar_Type *out)
+{
+ int ok = is_of_class (from->e.char_class, in);
+ if (0 == (ok ^ invert))
+ return 0;
+
+ if (to->e.char_class == SLCHARCLASS_UPPER)
+ *out = SLwchar_toupper (in);
+ else if (to->e.char_class == SLCHARCLASS_LOWER)
+ *out = SLwchar_tolower (in);
+ else
+ return 0;
+
+ return 1;
+}
+
+static void init_chmap (SLwchar_Type *chmap, SLwchar_Type wch,
+			SLwchar_Type (*to_func)(SLwchar_Type))
+{
+ unsigned int i;
+
+ chmap0 = 0;
+ if (to_func == NULL)
+ {
+	for (i = 1; i < 256; i++)
+	 chmapi = wch;
+ }
+ else
+ {
+	for (i = 1; i < 256; i++)
+	 chmapi = (*to_func) (i);
+ }
+}
+
+static void get_range_values (Lexical_Element_Type *lex,
+			 SLwchar_Type *chminp, SLwchar_Type *chmaxp,
+			 int *range_dirp)
+{
+ SLwchar_Type chmin = lex->e.range0;
+ SLwchar_Type chmax = lex->e.range1;
+
+ *range_dirp = 1;
+ if (chmin > chmax)
+ {
+	SLwchar_Type tmp = chmin;
+	chmin = chmax;
+	chmax = tmp;
+
+	lex->e.range0 = chmax;
+	lex->e.range1 = chmin;
+	*range_dirp = -1;
+ }
+ *chminp = chmin;
+ *chmaxp = chmax;
+}
+
+static int is_ascii (SLwchar_Type wch)
+{
+ return wch < (SLwchar_Type) 0x80;
+}
+
+static int check_char_mapping (SLwchar_Map_Type *map, Char_Map_Type *list, int first_time)
+{
+ Lexical_Element_Type *lex_from, *lex_to;
+ SLwchar_Type chmin, chmax, wch, wch1;
+ SLwchar_Type (*to_func) (SLwchar_Type);
+ int (*is_func) (SLwchar_Type);
+ SLwchar_Type *chmap;
+ int invert, from_range_dir, to_range_dir;
+
+ lex_to = &list->to;
+ lex_from = &list->from;
+ chmap = map->chmap;
+ invert = map->invert;
+
+ switch (lex_from->lexical_type)
+ {
+ default:
+	return -1;
+
+ case LEXICAL_CHAR_TYPE:
+	if (lex_to->lexical_type != LEXICAL_CHAR_TYPE)
+	 return -1;
+
+	wch = lex_to->e.wch;
+	if (invert && first_time)
+	 init_chmap (chmap, wch, NULL);
+
+	list->map_function = map_char_to_char_method;
+
+	if (0 == IS_ASCII256(lex_from->e.wch))
+	 break;
+
+	if (invert)
+	 map->chmaplex_from->e.wch = lex_from->e.wch;
+	else
+	 {
+	 map->chmaplex_from->e.wch = wch;
+	 list->map_function = NULL;
+	 }
+	break;
+
+ case LEXICAL_RANGE_TYPE:
+	get_range_values (lex_from, &chmin, &chmax, &from_range_dir);
+
+	switch (lex_to->lexical_type)
+	 {
+	 case LEXICAL_CHAR_TYPE:
+	 wch = lex_to->e.wch;
+	 if (invert && first_time)
+	 init_chmap (chmap, wch, NULL);
+
+	 while ((chmin < 256) && (chmin <= chmax))
+	 {
+		 chmapchmin = (invert ? chmin : wch);
+		 chmin++;
+	 }
+	 list->map_function = map_range_to_char_method;
+	 break;
+
+	 case LEXICAL_CLASS_TYPE:
+	 if (lex_to->e.char_class == SLCHARCLASS_UPPER)
+	 to_func = SLwchar_toupper;
+	 else if (lex_to->e.char_class == SLCHARCLASS_LOWER)
+	 to_func = SLwchar_tolower;
+	 else return -1;
+
+	 if (invert && first_time)
+	 init_chmap (chmap, 0, to_func);
+
+	 while ((chmin < 256) && (chmin <= chmax))
+	 {
+		 chmapchmin = (invert ? chmin : (*to_func) (chmin));
+		 chmin++;
+	 }
+	 list->map_function = map_range_to_class_method;
+	 break;
+
+	 case LEXICAL_RANGE_TYPE:
+	 if (invert)
+	 {
+		 _pSLang_verror (SL_INVALID_PARM, "Inversion from a range to a range not permitted");
+		 return -1;
+	 }
+
+	 get_range_values (lex_to, &wch, &wch1, &to_range_dir);
+
+	 if ((chmax - chmin) != (wch1 - wch))
+	 {
+		 _pSLang_verror (SL_INVALID_PARM, "Character mapping of unequal ranges is forbidden");
+		 return -1;
+	 }
+	 if (from_range_dir != to_range_dir)
+	 {
+		 wch = wch1;
+		 to_range_dir = -1;
+	 }
+	 else to_range_dir = 1;
+
+	 while ((chmin < 256) && (chmin <= chmax))
+	 {
+		 chmapchmin = wch;
+		 chmin++;
+		 wch += to_range_dir;
+	 }
+	 list->map_function = map_range_to_range_method;
+	 break;
+
+	 default:
+	 return -1;
+	 }
+	if ((chmax < 256) && (invert == 0))
+	 list->map_function = NULL;
+	break;
+
+ case LEXICAL_CLASS_TYPE:
+	switch (lex_from->e.char_class)
+	 {
+	 case SLCHARCLASS_ALPHA:
+	 is_func = SLwchar_isalpha;
+	 break;
+
+	 case SLCHARCLASS_ALPHA|SLCHARCLASS_XDIGIT:
+	 is_func = SLwchar_isalnum;
+	 break;
+
+	 case SLCHARCLASS_UPPER:
+	 is_func = SLwchar_isupper;
+	 break;
+
+	 case SLCHARCLASS_LOWER:
+	 is_func = SLwchar_islower;
+	 break;
+
+	 case SLCHARCLASS_SPACE:
+	 is_func = SLwchar_isspace;
+	 break;
+
+	 case SLCHARCLASS_ASCII:
+	 is_func = is_ascii;
+	 break;
+
+	 case SLCHARCLASS_BLANK:
+	 is_func = SLwchar_isblank;
+	 break;
+
+	 case SLCHARCLASS_CNTRL:
+	 is_func = SLwchar_iscntrl;
+	 break;
+
+	 case SLCHARCLASS_GRAPH:
+	 is_func = SLwchar_isgraph;
+	 break;
+
+	 case SLCHARCLASS_PRINT:
+	 is_func = SLwchar_isprint;
+	 break;
+
+	 case SLCHARCLASS_PUNCT:
+	 is_func = SLwchar_ispunct;
+	 break;
+
+	 case SLCHARCLASS_XDIGIT:
+	 is_func = SLwchar_isxdigit;
+	 break;
+
+	 default:
+	 _pSLang_verror (SL_INVALID_PARM, "Invalid character class in character map");
+	 return -1;
+	 }
+	switch (lex_to->lexical_type)
+	 {
+	 case LEXICAL_CHAR_TYPE:
+	 wch = lex_to->e.wch;
+
+	 if (first_time && invert)
+	 init_chmap (chmap, wch, NULL);
+
+	 for (chmin = 0; chmin < 256; chmin++)
+	 {
+		 if ((*is_func)(chmin))
+		 chmapchmin = (invert ? chmin : wch);
+	 }
+	 list->map_function = map_class_to_char_method;
+	 break;
+
+	 case LEXICAL_CLASS_TYPE:
+	 switch (lex_to->e.char_class)
+	 {
+		case SLCHARCLASS_LOWER:
+		 to_func = SLwchar_tolower;
+		 break;
+		case SLCHARCLASS_UPPER:
+		 to_func = SLwchar_toupper;
+		 break;
+
+		default:
+		 return -1;
+	 }
+
+	 if (invert && first_time)
+	 init_chmap (chmap, 0, to_func);
+
+	 for (chmin = 0; chmin < 256; chmin++)
+	 {
+		 if ((*is_func)(chmin))
+		 chmapchmin = (invert ? chmin : (*to_func)(chmin));
+	 }
+	 list->map_function = map_class_to_class_method;
+	 break;
+
+	 default:
+	 return -1;
+	 }
+	break;
+ }
+ return 0;
+}
+
+static void free_char_map_type (Char_Map_Type *m)
+{
+ SLfree ((char *) m);
+}
+
+void SLwchar_free_char_map (SLwchar_Map_Type *map)
+{
+ Char_Map_Type *list;
+
+ if (map == NULL)
+ return;
+
+ list = map->list;
+ while (list != NULL)
+ {
+	Char_Map_Type *next = list->next;
+	free_char_map_type (list);
+	list = next;
+ }
+ SLfree ((char *) map);
+}
+
+SLwchar_Map_Type *SLwchar_allocate_char_map (SLuchar_Type *from, SLuchar_Type *to)
+{
+ SLwchar_Map_Type *map;
+ Char_Map_Type *list, *prev;
+ SLuchar_Type *from_max, *to_max;
+ unsigned int i;
+ int invert = 0, first_time;
+
+ if (*from == '^')
+ {
+	invert = 1;
+	from++;
+ }
+
+#if 0
+ if (*from == 0)
+ {
+	_pSLang_verror (SL_INVALID_PARM, "Illegal empty string in character map specification");
+	return NULL;
+ }
+#endif
+ map = (SLwchar_Map_Type *)SLcalloc (1, sizeof (SLwchar_Map_Type));
+ if (map == NULL)
+ return NULL;
+
+ map->invert = invert;
+
+ for (i = 0; i < 256; i++)
+ map->chmapi = i;
+
+ from_max = from + strlen ((char *) from);
+ to_max = to + strlen ((char *) to);
+
+ list = NULL;
+
+ while (from < from_max)
+ {
+	Char_Map_Type *next;
+	SLuchar_Type *next_to;
+
+	if (NULL == (next = (Char_Map_Type *) SLcalloc (1, sizeof (Char_Map_Type))))
+	 goto return_error;
+
+	if (list == NULL)
+	 map->list = next;
+	else
+	 list->next = next;
+	list = next;
+
+	if (NULL == (from = get_lexical_element (from, from_max, 1, 1, &list->from)))
+	 goto return_error;
+
+	if (NULL == (next_to = get_lexical_element (to, to_max, 1, 1, &list->to)))
+	 goto return_error;
+
+	/* If the mapping is not 1-1, then the last "to" object applies to the
+	 * remaining "from" objects. This will permit, e.g.,
+	 * A-Za-z --> X
+	 */
+	if (next_to != to_max)
+	 {
+	 if (invert)
+	 {
+		 _pSLang_verror (SL_INVALID_PARM, "Character map inversion must specify a many-to-one mapping");
+		 goto return_error;
+	 }
+	 to = next_to;
+	 }
+ }
+
+ list = map->list;
+ prev = NULL;
+ first_time = 1;
+ while (list != NULL)
+ {
+	Char_Map_Type *next = list->next;
+
+	if (-1 == check_char_mapping (map, list, first_time))
+	 {
+	 _pSLang_verror (SL_INVALID_PARM, "Specified character mapping is invalid");
+	 goto return_error;
+	 }
+	first_time = 0;
+
+	if (list->map_function == NULL)
+	 {
+	 if (prev == NULL)
+	 map->list = next;
+	 else
+	 prev->next = next;
+
+	 free_char_map_type (list);
+	 }
+	else prev = list;
+	list = next;
+ }
+ return map;
+
+ return_error:
+ SLwchar_free_char_map (map);
+ return NULL;
+}
+
+static int apply_lexical_map (SLwchar_Map_Type *map, SLwchar_Type wc_in, SLwchar_Type *wc_out)
+{
+ Char_Map_Type *list = map->list;
+ int invert = map->invert;
+
+ while (list != NULL)
+ {
+	if (list->map_function != NULL)
+	 {
+	 int status = (*list->map_function)(&list->from, &list->to, invert, wc_in, wc_out);
+	 if (status == 0)
+	 {
+		 if (invert)
+		 return status;
+	 }
+	 else return status;
+	 }
+	list = list->next;
+ }
+ return 0;
+}
+
+int SLwchar_apply_char_map (SLwchar_Map_Type *map, SLwchar_Type *input, SLwchar_Type *output, unsigned int num)
+{
+ unsigned int i;
+ SLwchar_Type *chmap;
+
+ if ((map == NULL) || (input == NULL) || (output == NULL))
+ return -1;
+
+ chmap = map->chmap;
+
+ for (i = 0; i < num; i++)
+ {
+	SLwchar_Type wc_in;
+
+	if ((wc_in = inputi) < 0x100)
+	 {
+	 outputi = chmapwc_in;
+	 continue;
+	 }
+
+	if (0 == apply_lexical_map (map, wc_in, output + i))
+	 outputi = wc_in;
+ }
+
+ return 0;
+}
+
+/* This function returns a malloced string */
+SLuchar_Type *SLuchar_apply_char_map (SLwchar_Map_Type *map, SLuchar_Type *str)
+{
+ SLuchar_Type *str_max;
+ SLuchar_Type *output, *output_max, *outptr;
+ int use_chmap;
+ size_t len;
+ SLwchar_Type *chmap;
+
+ if ((map == NULL) || (str == NULL))
+ return NULL;
+
+ use_chmap = 1;
+ if (_pSLinterp_UTF8_Mode == 0)
+ str_max = str + strlen ((char *)str);
+ else
+ {
+	str_max = str;
+	while (*str_max)
+	 {
+	 if (*str_max & 0x80)
+	 use_chmap = 0;
+	 str_max++;
+	 }
+ }
+
+ len = str_max - str;
+ chmap = map->chmap;
+
+ if (use_chmap)
+ {
+	unsigned int i;
+
+	output = (SLuchar_Type *)SLmalloc (len+1);
+	if (output == NULL)
+	 return NULL;
+
+	for (i = 0; i < len; i++)
+	 outputi = chmapstri;
+
+	outputlen = 0;
+	return output;
+ }
+
+ /* Hard way */
+ len += SLUTF8_MAX_MBLEN;
+ if (NULL == (output = (SLuchar_Type *)SLmalloc (len + 1)))
+ return NULL;
+ output_max = output + len;
+ outptr = output;
+
+ while (str < str_max)
+ {
+	SLwchar_Type w_out, w_in;
+	unsigned int encoded_len;
+
+	w_in = (SLwchar_Type) *str;
+	if (w_in < 0x80)
+	 str++;
+	else if (NULL == (str = _pSLinterp_decode_wchar (str, str_max, &w_in)))
+	 goto return_error;
+
+	if (w_in < 0x100)
+	 {
+	 w_out = chmapw_in;
+	 if ((w_out < 0x80) && (outptr < output_max))
+	 {
+		 *outptr++ = (SLuchar_Type) w_out;
+		 continue;
+	 }
+	 }
+	else
+	 {
+	 if (-1 == SLwchar_apply_char_map (map, &w_in, &w_out, 1))
+	 goto return_error;
+	 }
+
+	if (outptr + SLUTF8_MAX_MBLEN >= output_max)
+	 {
+	 SLuchar_Type *tmp;
+
+	 len += 32 * SLUTF8_MAX_MBLEN;
+	 if (NULL == (tmp = (SLuchar_Type *)SLrealloc ((char *)output, len)))
+	 goto return_error;
+
+	 outptr = tmp + (outptr - output);
+	 output = tmp;
+	 output_max = output + len;
+	 }
+
+	if (NULL == (outptr = _pSLinterp_encode_wchar (w_out, outptr, &encoded_len)))
+	 goto return_error;
+ }
+
+ *outptr = 0;
+
+ return output;
+
+ return_error:
+ SLfree ((char *) output);
+ return NULL;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slwcwidth.c Added

@@ -0,0 +1,58 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include "slinclud.h"
+#include <ctype.h>
+
+#include "slang.h"
+#include "_slang.h"
+
+#define DEFINE_PSLWC_WIDTH_TABLE
+#include "slwcwidth.h"
+
+static int Width_Flags = 0;
+int SLwchar_wcwidth (SLwchar_Type ch)
+{
+ int w;
+
+ SL_WIDTH_ALOOKUP(w,ch);
+
+ if ((w == 1) || (w == 4))
+ return w;
+
+ if (Width_Flags & SLWCWIDTH_SINGLE_WIDTH)
+ return 1;
+
+ if (w == 3)
+ {
+	if (Width_Flags & SLWCWIDTH_CJK_LEGACY)
+	 w = 2;
+	else
+	 w = 1;
+ }
+ return w;
+}
+
+int SLwchar_set_wcwidth_flags (int flags)
+{
+ int oflags = Width_Flags;
+ Width_Flags = flags;
+ return oflags;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/slwcwidth.h Added

@@ -0,0 +1,2720 @@
+/* This file was automatically created by ./mktables */
+#define SL_WIDTH_MAX_CHAR 0x110000ul
+
+#define SL_WIDTH_ALOOKUP(y,x) \
+{ \
+ const unsigned char *_t; \
+ (y) = (((unsigned)(x) < SL_WIDTH_MAX_CHAR) \
+	 && (NULL != (_t = _pSLwc_Width_Table(unsigned)(x)>>9)) \
+	 ? ((_t(unsigned)((x)>>1)&0xFF>>(4*((x)&1)))&15) : 1); \
+}
+extern const unsigned char *_pSLwc_Width_Table2176;
+
+#ifdef DEFINE_PSLWC_WIDTH_TABLE
+static const unsigned char Table_01256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44,
+ /*0x48-0x4F*/ 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44, 0x44,
+ /*0x50-0x57*/ 0x31, 0x11, 0x13, 0x31, 0x13, 0x13, 0x31, 0x13,
+ /*0x58-0x5F*/ 0x33, 0x33, 0x13, 0x33, 0x33, 0x13, 0x33, 0x33,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x13, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x13, 0x11, 0x11, 0x31, 0x13, 0x11, 0x11, 0x33,
+ /*0x70-0x77*/ 0x33, 0x11, 0x11, 0x13, 0x33, 0x13, 0x33, 0x11,
+ /*0x78-0x7F*/ 0x13, 0x33, 0x11, 0x31, 0x33, 0x13, 0x13, 0x13,
+ /*0x80-0x87*/ 0x31, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x31, 0x31, 0x11, 0x11, 0x11, 0x31, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x33, 0x11, 0x31, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x31, 0x33, 0x11, 0x11, 0x13, 0x11, 0x11, 0x31,
+ /*0xA0-0xA7*/ 0x33, 0x13, 0x13, 0x11, 0x33, 0x33, 0x31, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x33, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x33, 0x11, 0x31, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x13,
+ /*0xE8-0xEF*/ 0x13, 0x13, 0x13, 0x13, 0x13, 0x13, 0x13, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_02256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x31, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x31, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x13, 0x31, 0x31, 0x33, 0x31, 0x11,
+ /*0x68-0x6F*/ 0x13, 0x11, 0x11, 0x11, 0x33, 0x33, 0x31, 0x31,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x88-0x8F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x90-0x97*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x98-0x9F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xA0-0xA7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xA8-0xAF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xB0-0xB7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x31, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xD0-0xD7*/ 0x33, 0x31, 0x33, 0x33, 0x33, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x31, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xE0-0xE7*/ 0x33, 0x31, 0x33, 0x33, 0x33, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_03256 =
+{
+ /*0x00-0x07*/ 0x31, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x10-0x17*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x18-0x1F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x20-0x27*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x28-0x2F*/ 0x31, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x01, 0x00, 0x00, 0x00, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xD0-0xD7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xD8-0xDF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
+ /*0xE0-0xE7*/ 0x01, 0x10, 0x00, 0x01, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_04256 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x10, 0x10, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x01, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x00, 0x00, 0x00, 0x00, 0x01,
+ /*0x70-0x77*/ 0x00, 0x00, 0x10, 0x01, 0x10, 0x00, 0x00, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01,
+ /*0x88-0x8F*/ 0x01, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xA0-0xA7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x10, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xD8-0xDF*/ 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x01, 0x00, 0x00,
+ /*0xF8-0xFF*/ 0x00, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_05256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x00, 0x00, 0x01, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x01, 0x00, 0x01, 0x00, 0x00, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x01, 0x00, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x70-0x77*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x78-0x7F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x80-0x87*/ 0x00, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x10, 0x10, 0x11,
+ /*0xA0-0xA7*/ 0x01, 0x00, 0x00, 0x00, 0x10, 0x11, 0x01, 0x11,
+ /*0xA8-0xAF*/ 0x01, 0x00, 0x00, 0x00, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x01, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x10, 0x11,
+ /*0xE0-0xE7*/ 0x01, 0x00, 0x10, 0x11, 0x11, 0x11, 0x01, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_06256 =
+{
+ /*0x00-0x07*/ 0x01, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x10, 0x11,
+ /*0x20-0x27*/ 0x01, 0x10, 0x11, 0x01, 0x10, 0x01, 0x00, 0x11,
+ /*0x28-0x2F*/ 0x01, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x00, 0x11, 0x01, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x01, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x10, 0x11,
+ /*0x60-0x67*/ 0x01, 0x00, 0x00, 0x01, 0x10, 0x11, 0x01, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x00, 0x00, 0x00,
+ /*0x80-0x87*/ 0x01, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x10, 0x01,
+ /*0xA0-0xA7*/ 0x01, 0x00, 0x10, 0x11, 0x11, 0x11, 0x01, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x10, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_07256 =
+{
+ /*0x00-0x07*/ 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x00,
+ /*0x20-0x27*/ 0x10, 0x11, 0x11, 0x00, 0x10, 0x00, 0x00, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x01, 0x10, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x01, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x10, 0x01,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x10, 0x11, 0x11, 0x00, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x01, 0x10, 0x11,
+ /*0xA0-0xA7*/ 0x01, 0x00, 0x10, 0x11, 0x11, 0x11, 0x01, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x10, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x00, 0x10, 0x10, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_08256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x01, 0x11, 0x00, 0x00, 0x00, 0x10, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x01, 0x00, 0x00, 0x00, 0x10,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x01, 0x11, 0x00, 0x00, 0x00, 0x01, 0x10, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x00, 0x00, 0x00, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x00, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x01, 0x01, 0x01, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10,
+ /*0xC0-0xC7*/ 0x00, 0x00, 0x10, 0x00, 0x11, 0x11, 0x01, 0x00,
+ /*0xC8-0xCF*/ 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00,
+ /*0xD0-0xD7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xD8-0xDF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x10, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_09256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01, 0x00,
+ /*0x18-0x1F*/ 0x10, 0x00, 0x00, 0x00, 0x01, 0x10, 0x01, 0x10,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x00, 0x11, 0x11, 0x00,
+ /*0x30-0x37*/ 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x01, 0x00, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x10, 0x01, 0x10, 0x11, 0x11, 0x01, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x88-0x8F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x90-0x97*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x98-0x9F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA0-0xA7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA8-0xAF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB0-0xB7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xB8-0xBF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xC0-0xC7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xC8-0xCF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xD0-0xD7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xD8-0xDF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xE0-0xE7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xE8-0xEF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xF0-0xF7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xF8-0xFF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_10256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01, 0x00,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_11256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_12256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x00, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x00, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x00, 0x01, 0x00, 0x00, 0x00, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x10, 0x01, 0x00, 0x00, 0x00,
+ /*0xE8-0xEF*/ 0x00, 0x00, 0x11, 0x11, 0x11, 0x11, 0x01, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_13256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x01, 0x00, 0x10,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x01, 0x10, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x01, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x00, 0x10, 0x11, 0x01, 0x10, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x10, 0x11, 0x11, 0x01, 0x00, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_14256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x01, 0x10, 0x01, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x10, 0x00, 0x00, 0x00, 0x10,
+ /*0x30-0x37*/ 0x10, 0x10, 0x01, 0x00, 0x00, 0x00, 0x10, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x01, 0x00, 0x00, 0x00, 0x00, 0x10, 0x01,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x00, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x10, 0x00, 0x00, 0x10, 0x10, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x01, 0x00, 0x00,
+ /*0xB8-0xBF*/ 0x00, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x00, 0x00, 0x11, 0x00, 0x01, 0x00, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x10, 0x00, 0x11, 0x01, 0x01,
+ /*0xF8-0xFF*/ 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_15256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x11, 0x00, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x00, 0x10, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x70-0x77*/ 0x10, 0x00, 0x00, 0x00, 0x10, 0x11, 0x01, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x10, 0x11, 0x00, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xE8-0xEF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xF0-0xF7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xF8-0xFF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00
+};
+
+static const unsigned char Table_16256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x01, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x13, 0x31, 0x33, 0x13, 0x33, 0x11, 0x33, 0x11,
+ /*0x10-0x17*/ 0x33, 0x13, 0x33, 0x33, 0x11, 0x00, 0x00, 0x10,
+ /*0x18-0x1F*/ 0x13, 0x33, 0x31, 0x11, 0x11, 0x31, 0x11, 0x13,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x13, 0x11, 0x11, 0x11, 0x11, 0x31,
+ /*0x40-0x47*/ 0x31, 0x33, 0x13, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x13, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x70-0x77*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x78-0x7F*/ 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x31, 0x31, 0x11, 0x31, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x31, 0x11, 0x13, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x31, 0x13, 0x11, 0x13, 0x11, 0x31, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x31, 0x13, 0x11, 0x11, 0x31, 0x33, 0x13,
+ /*0xB0-0xB7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x31, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x33, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x13, 0x13, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x31, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_17256 =
+{
+ /*0x00-0x07*/ 0x13, 0x33, 0x11, 0x31, 0x13, 0x31, 0x11, 0x31,
+ /*0x08-0x0F*/ 0x31, 0x11, 0x31, 0x11, 0x11, 0x13, 0x31, 0x33,
+ /*0x10-0x17*/ 0x13, 0x31, 0x31, 0x31, 0x33, 0x33, 0x13, 0x13,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x33, 0x33, 0x11, 0x11, 0x33, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x13, 0x11, 0x13, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x13, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x33, 0x11, 0x33, 0x33, 0x11, 0x33, 0x11, 0x33,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x33, 0x11, 0x33, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x31, 0x11, 0x31, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x31, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x31,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x13, 0x11, 0x11, 0x11, 0x22, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x21, 0x12, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x21, 0x22, 0x12, 0x11,
+ /*0xF8-0xFF*/ 0x12, 0x21, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_18256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x38-0x3F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x40-0x47*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x48-0x4F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x50-0x57*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x58-0x5F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x60-0x67*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x68-0x6F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x70-0x77*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x31, 0x33, 0x33,
+ /*0x78-0x7F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x80-0x87*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x88-0x8F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x90-0x97*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x98-0x9F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xA0-0xA7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xB0-0xB7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xB8-0xBF*/ 0x33, 0x33, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xC8-0xCF*/ 0x11, 0x33, 0x33, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x33, 0x31, 0x33, 0x33, 0x33, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x33, 0x11, 0x33, 0x11, 0x11, 0x33, 0x11,
+ /*0xE0-0xE7*/ 0x33, 0x11, 0x11, 0x33, 0x13, 0x31, 0x11, 0x33,
+ /*0xE8-0xEF*/ 0x33, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x33, 0x33, 0x11, 0x11, 0x11, 0x11, 0x31,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x21, 0x12
+};
+
+static const unsigned char Table_19256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x31, 0x13, 0x31, 0x11, 0x11, 0x33,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x22, 0x11, 0x11, 0x11, 0x13, 0x13,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x13, 0x13, 0x11, 0x11, 0x22, 0x22, 0x22, 0x22,
+ /*0x28-0x2F*/ 0x22, 0x22, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x33, 0x31, 0x33, 0x31, 0x33, 0x13, 0x33, 0x31,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x21,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x21, 0x11, 0x11, 0x11, 0x11, 0x11, 0x33,
+ /*0x50-0x57*/ 0x21, 0x11, 0x11, 0x11, 0x11, 0x22, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x21, 0x32,
+ /*0x60-0x67*/ 0x11, 0x11, 0x22, 0x33, 0x33, 0x33, 0x33, 0x32,
+ /*0x68-0x6F*/ 0x33, 0x33, 0x32, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x70-0x77*/ 0x33, 0x31, 0x11, 0x11, 0x33, 0x32, 0x33, 0x33,
+ /*0x78-0x7F*/ 0x33, 0x22, 0x23, 0x33, 0x33, 0x32, 0x23, 0x33,
+ /*0x80-0x87*/ 0x11, 0x11, 0x21, 0x11, 0x11, 0x22, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x12, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x31, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x12, 0x12,
+ /*0xA8-0xAF*/ 0x11, 0x21, 0x22, 0x21, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x21, 0x22, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x12, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x21,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_20256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x21, 0x12, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x12, 0x11, 0x21, 0x33, 0x33, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_21256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01,
+ /*0x78-0x7F*/ 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xF8-0xFF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+static const unsigned char Table_22256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x48-0x4F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x21, 0x22, 0x22,
+ /*0x50-0x57*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x58-0x5F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x60-0x67*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x68-0x6F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x70-0x77*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x78-0x7F*/ 0x22, 0x22, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x88-0x8F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x90-0x97*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x98-0x9F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA0-0xA7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA8-0xAF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB0-0xB7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB8-0xBF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC0-0xC7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC8-0xCF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD0-0xD7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD8-0xDF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE0-0xE7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE8-0xEF*/ 0x22, 0x22, 0x22, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x11, 0x11
+};
+
+static const unsigned char Table_23256 =
+{
+ /*0x00-0x07*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x10-0x17*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x00, 0x00, 0x22,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x12,
+ /*0x20-0x27*/ 0x21, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x28-0x2F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x30-0x37*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x38-0x3F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x40-0x47*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x48-0x4F*/ 0x22, 0x22, 0x22, 0x12, 0x01, 0x20, 0x22, 0x22,
+ /*0x50-0x57*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x58-0x5F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x60-0x67*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x68-0x6F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x70-0x77*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x78-0x7F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x80-0x87*/ 0x11, 0x11, 0x21, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x88-0x8F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x90-0x97*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x12,
+ /*0x98-0x9F*/ 0x21, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA0-0xA7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA8-0xAF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB0-0xB7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB8-0xBF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC0-0xC7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x12,
+ /*0xC8-0xCF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD0-0xD7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD8-0xDF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x12, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE8-0xEF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xF0-0xF7*/ 0x22, 0x22, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22
+};
+
+static const unsigned char Table_24256 =
+{
+ /*0x00-0x07*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x12,
+ /*0x10-0x17*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x20-0x27*/ 0x22, 0x22, 0x22, 0x22, 0x33, 0x33, 0x33, 0x33,
+ /*0x28-0x2F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x30-0x37*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x38-0x3F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x40-0x47*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x48-0x4F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x50-0x57*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x58-0x5F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x60-0x67*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x68-0x6F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x70-0x77*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x78-0x7F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x12,
+ /*0x80-0x87*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x88-0x8F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x90-0x97*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x98-0x9F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA0-0xA7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA8-0xAF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB0-0xB7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB8-0xBF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC0-0xC7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC8-0xCF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD0-0xD7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD8-0xDF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE0-0xE7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE8-0xEF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xF0-0xF7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xF8-0xFF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22
+};
+
+static const unsigned char Table_25256 =
+{
+ /*0x00-0x07*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x10-0x17*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x20-0x27*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x28-0x2F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x30-0x37*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x38-0x3F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x40-0x47*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x48-0x4F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x50-0x57*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x58-0x5F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x60-0x67*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x68-0x6F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x70-0x77*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x78-0x7F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x80-0x87*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x88-0x8F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x90-0x97*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x98-0x9F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA0-0xA7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA8-0xAF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB0-0xB7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB8-0xBF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC0-0xC7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC8-0xCF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD0-0xD7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD8-0xDF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE0-0xE7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE8-0xEF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xF0-0xF7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xF8-0xFF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22
+};
+
+static const unsigned char Table_26256 =
+{
+ /*0x00-0x07*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x10-0x17*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x20-0x27*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x28-0x2F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x30-0x37*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x38-0x3F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x40-0x47*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x48-0x4F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x50-0x57*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x58-0x5F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x60-0x67*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x68-0x6F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x70-0x77*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x78-0x7F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x80-0x87*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x88-0x8F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x90-0x97*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x98-0x9F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA0-0xA7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA8-0xAF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB0-0xB7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB8-0xBF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC0-0xC7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC8-0xCF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD0-0xD7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD8-0xDF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_27256 =
+{
+ /*0x00-0x07*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x10-0x17*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x20-0x27*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x28-0x2F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x30-0x37*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x38-0x3F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x40-0x47*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x12, 0x11,
+ /*0x48-0x4F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x50-0x57*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x58-0x5F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x60-0x67*/ 0x22, 0x22, 0x22, 0x12, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_28256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01,
+ /*0x38-0x3F*/ 0x00, 0x10, 0x00, 0x00, 0x00, 0x00, 0x00, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x00,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_29256 =
+{
+ /*0x00-0x07*/ 0x11, 0x10, 0x11, 0x10, 0x11, 0x01, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x01, 0x10, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x78-0x7F*/ 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x00, 0x00, 0x00, 0x00, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x01, 0x00, 0x00, 0x00, 0x00,
+ /*0xA8-0xAF*/ 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB8-0xBF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x12, 0x11,
+ /*0xC0-0xC7*/ 0x00, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x01, 0x11, 0x00, 0x00, 0x11, 0x10, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x01, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_30256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x01, 0x00, 0x00, 0x10,
+ /*0x18-0x1F*/ 0x01, 0x10, 0x01, 0x10, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x01, 0x11, 0x11, 0x11, 0x11, 0x10, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x10, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x10, 0x00, 0x10, 0x01, 0x10, 0x11, 0x11, 0x00,
+ /*0x60-0x67*/ 0x01, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x00, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x10, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x01, 0x11, 0x10, 0x11, 0x01, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_31256 =
+{
+ /*0x00-0x07*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x10-0x17*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x20-0x27*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x28-0x2F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x30-0x37*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x38-0x3F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x40-0x47*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x48-0x4F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x50-0x57*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x58-0x5F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x60-0x67*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x68-0x6F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x70-0x77*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x78-0x7F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x80-0x87*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x88-0x8F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x90-0x97*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x98-0x9F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA0-0xA7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA8-0xAF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB0-0xB7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB8-0xBF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC0-0xC7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC8-0xCF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD0-0xD7*/ 0x22, 0x22, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_32256 =
+{
+ /*0x00-0x07*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x08-0x0F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x10-0x17*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x18-0x1F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x20-0x27*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x28-0x2F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x30-0x37*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x38-0x3F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x40-0x47*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x48-0x4F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x50-0x57*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x58-0x5F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x60-0x67*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x68-0x6F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x70-0x77*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x78-0x7F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x80-0x87*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x88-0x8F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x90-0x97*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x98-0x9F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xA0-0xA7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xA8-0xAF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xB0-0xB7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xB8-0xBF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xC0-0xC7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xC8-0xCF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xD0-0xD7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xD8-0xDF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xE0-0xE7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xE8-0xEF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xF0-0xF7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xF8-0xFF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33
+};
+
+static const unsigned char Table_33256 =
+{
+ /*0x00-0x07*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x08-0x0F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x10-0x17*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x18-0x1F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x20-0x27*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x28-0x2F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x30-0x37*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x38-0x3F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x40-0x47*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x48-0x4F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x50-0x57*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x58-0x5F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x60-0x67*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x68-0x6F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x70-0x77*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x78-0x7F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x80-0x87*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x88-0x8F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x90-0x97*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x98-0x9F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA0-0xA7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA8-0xAF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB0-0xB7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB8-0xBF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC0-0xC7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC8-0xCF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD0-0xD7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD8-0xDF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE0-0xE7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE8-0xEF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xF0-0xF7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xF8-0xFF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22
+};
+
+static const unsigned char Table_34256 =
+{
+ /*0x00-0x07*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x10-0x17*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x20-0x27*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x28-0x2F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x30-0x37*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x38-0x3F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x40-0x47*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x48-0x4F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x50-0x57*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x58-0x5F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x60-0x67*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x68-0x6F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x70-0x77*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x78-0x7F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x10,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_35256 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x20-0x27*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x28-0x2F*/ 0x22, 0x12, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x30-0x37*/ 0x22, 0x22, 0x22, 0x12, 0x22, 0x22, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01,
+ /*0x80-0x87*/ 0x21, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x88-0x8F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x90-0x97*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x98-0x9F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA0-0xA7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA8-0xAF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB0-0xB7*/ 0x12, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x22, 0x22, 0x22, 0x12, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x01, 0x00, 0x31, 0x11
+};
+
+static const unsigned char Table_36256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01, 0x11
+};
+
+static const unsigned char Table_37256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x00, 0x00, 0x10, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_38256 =
+{
+ /*0x00-0x07*/ 0x01, 0x00, 0x01, 0x10, 0x11, 0x11, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x00, 0x10, 0x11, 0x01,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x01, 0x10, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_39256 =
+{
+ /*0x00-0x07*/ 0x01, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x10, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01,
+ /*0x40-0x47*/ 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x01, 0x00, 0x10, 0x01, 0x10, 0x01, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x00, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x01, 0x00, 0x00, 0x01, 0x00,
+ /*0x98-0x9F*/ 0x00, 0x00, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x01, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x00, 0x00, 0x00, 0x00, 0x10,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x00, 0x10, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_40256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01,
+ /*0x18-0x1F*/ 0x00, 0x11, 0x10, 0x00, 0x11, 0x11, 0x11, 0x10,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01,
+ /*0x70-0x77*/ 0x11, 0x01, 0x00, 0x00, 0x00, 0x10, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x10, 0x11,
+ /*0xA0-0xA7*/ 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x00, 0x00, 0x00, 0x10, 0x11,
+ /*0xB8-0xBF*/ 0x00, 0x00, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_41256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x11, 0x00, 0x10, 0x10, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x01, 0x00, 0x00, 0x10, 0x10, 0x11, 0x01,
+ /*0x60-0x67*/ 0x10, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x00, 0x00, 0x11, 0x11, 0x11, 0x00, 0x01,
+ /*0xE0-0xE7*/ 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x00, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_42256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x01, 0x00, 0x00, 0x00, 0x10, 0x01, 0x01,
+ /*0x20-0x27*/ 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x01, 0x01, 0x11,
+ /*0x58-0x5F*/ 0x00, 0x00, 0x00, 0x01, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01, 0x00,
+ /*0x90-0x97*/ 0x11, 0x00, 0x00, 0x01, 0x00, 0x00, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_43256 =
+{
+ /*0x00-0x07*/ 0x01, 0x00, 0x00, 0x10, 0x01, 0x10, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x01, 0x00, 0x00, 0x10, 0x01, 0x00, 0x10,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x01, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x01, 0x00, 0x00, 0x10, 0x01, 0x00, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x00, 0x00, 0x00,
+ /*0x48-0x4F*/ 0x00, 0x00, 0x00, 0x10, 0x00, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_44256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x01,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x50-0x57*/ 0x00, 0x00, 0x00, 0x00, 0x11, 0x00, 0x00, 0x00,
+ /*0x58-0x5F*/ 0x10, 0x00, 0x01, 0x10, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x01, 0x00, 0x00, 0x10, 0x11, 0x10, 0x00, 0x01,
+ /*0xA0-0xA7*/ 0x00, 0x00, 0x00, 0x01, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_45256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x00, 0x00, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x00, 0x00, 0x00, 0x10, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_46256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01,
+ /*0xC8-0xCF*/ 0x00, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x22, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_47256 =
+{
+ /*0x00-0x07*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x10-0x17*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x20-0x27*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x28-0x2F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x30-0x37*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x38-0x3F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x40-0x47*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x48-0x4F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x50-0x57*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x58-0x5F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x60-0x67*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x68-0x6F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x70-0x77*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x78-0x7F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x80-0x87*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x88-0x8F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x90-0x97*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x98-0x9F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA0-0xA7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA8-0xAF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB0-0xB7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB8-0xBF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC0-0xC7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC8-0xCF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD0-0xD7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD8-0xDF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE0-0xE7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE8-0xEF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xF0-0xF7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x12, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_48256 =
+{
+ /*0x00-0x07*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x10-0x17*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x20-0x27*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x28-0x2F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x30-0x37*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x38-0x3F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x40-0x47*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x48-0x4F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x50-0x57*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x58-0x5F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x60-0x67*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x68-0x6F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x70-0x77*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x78-0x7F*/ 0x22, 0x12, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_49256 =
+{
+ /*0x00-0x07*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x10-0x17*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x20-0x27*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x28-0x2F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x30-0x37*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x38-0x3F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x40-0x47*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x48-0x4F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x50-0x57*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x58-0x5F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x60-0x67*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x68-0x6F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x70-0x77*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x78-0x7F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x80-0x87*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x88-0x8F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x12,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC0-0xC7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC8-0xCF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD0-0xD7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD8-0xDF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE0-0xE7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE8-0xEF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xF0-0xF7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xF8-0xFF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22
+};
+
+static const unsigned char Table_50256 =
+{
+ /*0x00-0x07*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x10-0x17*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x20-0x27*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x28-0x2F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x30-0x37*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x38-0x3F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x40-0x47*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x48-0x4F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x50-0x57*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x58-0x5F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x60-0x67*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x68-0x6F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x70-0x77*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x78-0x7F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_51256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x01, 0x10,
+ /*0x50-0x57*/ 0x00, 0x00, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_52256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x01, 0x00, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xC0-0xC7*/ 0x00, 0x10, 0x01, 0x00, 0x00, 0x00, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x00, 0x00, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_53256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x00, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_54256 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x10, 0x11, 0x01, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x01, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x10, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x01, 0x00, 0x00,
+ /*0x50-0x57*/ 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_55256 =
+{
+ /*0x00-0x07*/ 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x00,
+ /*0x08-0x0F*/ 0x00, 0x00, 0x00, 0x00, 0x10, 0x01, 0x00, 0x00,
+ /*0x10-0x17*/ 0x00, 0x01, 0x10, 0x00, 0x00, 0x10, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_56256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x00, 0x00, 0x00, 0x10, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x00, 0x00, 0x00, 0x10, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_57256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x12, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x21,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x13, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x90-0x97*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x11,
+ /*0x98-0x9F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xA0-0xA7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xA8-0xAF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xB0-0xB7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xC0-0xC7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x32,
+ /*0xC8-0xCF*/ 0x23, 0x22, 0x22, 0x22, 0x22, 0x32, 0x33, 0x33,
+ /*0xD0-0xD7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x13, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_58256 =
+{
+ /*0x00-0x07*/ 0x22, 0x12, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x10-0x17*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x11, 0x11,
+ /*0x20-0x27*/ 0x22, 0x22, 0x22, 0x22, 0x12, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x22, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x22, 0x22, 0x22, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x88-0x8F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x90-0x97*/ 0x12, 0x11, 0x11, 0x11, 0x11, 0x11, 0x21, 0x22,
+ /*0x98-0x9F*/ 0x22, 0x22, 0x22, 0x21, 0x22, 0x22, 0x22, 0x22,
+ /*0xA0-0xA7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA8-0xAF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB0-0xB7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB8-0xBF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x12, 0x22,
+ /*0xC0-0xC7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC8-0xCF*/ 0x22, 0x22, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD8-0xDF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE0-0xE7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x12, 0x11, 0x21,
+ /*0xE8-0xEF*/ 0x22, 0x22, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xF8-0xFF*/ 0x12, 0x11, 0x12, 0x11, 0x22, 0x22, 0x22, 0x22
+};
+
+static const unsigned char Table_59256 =
+{
+ /*0x00-0x07*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x10-0x17*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x12,
+ /*0x20-0x27*/ 0x12, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x28-0x2F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x30-0x37*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x38-0x3F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x40-0x47*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x48-0x4F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x50-0x57*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x58-0x5F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x60-0x67*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x68-0x6F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x70-0x77*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x78-0x7F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x12, 0x21,
+ /*0x80-0x87*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x88-0x8F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x90-0x97*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x98-0x9F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x21, 0x22, 0x12,
+ /*0xA8-0xAF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB0-0xB7*/ 0x22, 0x22, 0x22, 0x22, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x12, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x21, 0x12, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x12, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x21, 0x22, 0x22
+};
+
+static const unsigned char Table_60256 =
+{
+ /*0x00-0x07*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x10-0x17*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x20-0x27*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x48-0x4F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x50-0x57*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x58-0x5F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x60-0x67*/ 0x22, 0x22, 0x22, 0x11, 0x11, 0x11, 0x12, 0x11,
+ /*0x68-0x6F*/ 0x22, 0x12, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x21, 0x12, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x22, 0x22, 0x12, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x90-0x97*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x98-0x9F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA0-0xA7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xA8-0xAF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB0-0xB7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC8-0xCF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF0-0xF7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_61256 =
+{
+ /*0x00-0x07*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x18-0x1F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x20-0x27*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x28-0x2F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x30-0x37*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x38-0x3F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x88-0x8F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x90-0x97*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x98-0x9F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x12,
+ /*0xA0-0xA7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x12, 0x11,
+ /*0xA8-0xAF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB0-0xB7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x11, 0x11,
+ /*0xB8-0xBF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xC0-0xC7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC8-0xCF*/ 0x22, 0x22, 0x22, 0x22, 0x11, 0x11, 0x11, 0x11,
+ /*0xD0-0xD7*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xD8-0xDF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE0-0xE7*/ 0x12, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0xE8-0xEF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xF0-0xF7*/ 0x22, 0x22, 0x22, 0x12, 0x11, 0x11, 0x11, 0x11,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_62256 =
+{
+ /*0x00-0x07*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x08-0x0F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x10-0x17*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x18-0x1F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x20-0x27*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x28-0x2F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x30-0x37*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x38-0x3F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x40-0x47*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x48-0x4F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x50-0x57*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x58-0x5F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x60-0x67*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x68-0x6F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x70-0x77*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x78-0x7F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x80-0x87*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x88-0x8F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x90-0x97*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0x98-0x9F*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA0-0xA7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xA8-0xAF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB0-0xB7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xB8-0xBF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC0-0xC7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xC8-0xCF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD0-0xD7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xD8-0xDF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE0-0xE7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xE8-0xEF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xF0-0xF7*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22,
+ /*0xF8-0xFF*/ 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x22, 0x11
+};
+
+static const unsigned char Table_63256 =
+{
+ /*0x00-0x07*/ 0x01, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x08-0x0F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x10-0x17*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x18-0x1F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x20-0x27*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x28-0x2F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x30-0x37*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x38-0x3F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x40-0x47*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x48-0x4F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x50-0x57*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x58-0x5F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x60-0x67*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x68-0x6F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x70-0x77*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x78-0x7F*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11,
+ /*0x80-0x87*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x88-0x8F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x90-0x97*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0x98-0x9F*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xA0-0xA7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xA8-0xAF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xB0-0xB7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xB8-0xBF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xC0-0xC7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xC8-0xCF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xD0-0xD7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xD8-0xDF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xE0-0xE7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xE8-0xEF*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xF0-0xF7*/ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ /*0xF8-0xFF*/ 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11, 0x11
+};
+
+static const unsigned char Table_64256 =
+{
+ /*0x00-0x07*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x08-0x0F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x10-0x17*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x18-0x1F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x20-0x27*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x28-0x2F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x30-0x37*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x38-0x3F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x40-0x47*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x48-0x4F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x50-0x57*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x58-0x5F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x60-0x67*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x68-0x6F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x70-0x77*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x78-0x7F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x80-0x87*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x88-0x8F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x90-0x97*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x98-0x9F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xA0-0xA7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xA8-0xAF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xB0-0xB7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xB8-0xBF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xC0-0xC7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xC8-0xCF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xD0-0xD7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xD8-0xDF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xE0-0xE7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xE8-0xEF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xF0-0xF7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xF8-0xFF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x11
+};
+
+static const unsigned char Table_65256 =
+{
+ /*0x00-0x07*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x08-0x0F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x10-0x17*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x18-0x1F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x20-0x27*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x28-0x2F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x30-0x37*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x38-0x3F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x40-0x47*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x48-0x4F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x50-0x57*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x58-0x5F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x60-0x67*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x68-0x6F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x70-0x77*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x78-0x7F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x80-0x87*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x88-0x8F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x90-0x97*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0x98-0x9F*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xA0-0xA7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xA8-0xAF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xB0-0xB7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xB8-0xBF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xC0-0xC7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xC8-0xCF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xD0-0xD7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xD8-0xDF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xE0-0xE7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xE8-0xEF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xF0-0xF7*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33,
+ /*0xF8-0xFF*/ 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x33, 0x00
+};
+
+const unsigned char *_pSLwc_Width_Table2176 =
+{
+ Table_01, Table_02, Table_03, Table_04, Table_05, Table_06,
+ Table_07, Table_08, Table_09, Table_10, Table_11, Table_12,
+ Table_13, Table_14, Table_15, Table_11, Table_16, Table_17,
+ Table_18, Table_19, Table_11, Table_20, Table_21, Table_22,
+ Table_23, Table_24, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_26, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_27, Table_28,
+ Table_29, Table_30, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_31,
+ Table_11, Table_11, Table_11, Table_11, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_33, Table_34,
+ Table_11, Table_35, Table_36, Table_37, Table_11, Table_11,
+ Table_11, Table_38, Table_11, Table_11, Table_39, Table_40,
+ Table_41, Table_42, Table_11, Table_43, Table_44, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_45, Table_11, Table_46, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_47, Table_25, Table_48,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_49, Table_50, Table_11, Table_11, Table_11, Table_11,
+ Table_51, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_52, Table_53,
+ Table_11, Table_11, Table_11, Table_54, Table_11, Table_11,
+ Table_55, Table_11, Table_11, Table_11, Table_56, Table_11,
+ Table_11, Table_11, Table_57, Table_58, Table_59, Table_60,
+ Table_61, Table_11, Table_11, Table_11, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_62,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_25, Table_25, Table_25, Table_25, Table_25,
+ Table_25, Table_62, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_63, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_11, Table_11, Table_11, Table_11, Table_11, Table_11,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_64, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_32, Table_32, Table_32,
+ Table_32, Table_32, Table_32, Table_65
+};
+#endif /* DEFINE_PSLWC_WIDTH_TABLE */

_service:tar_scm:slang-2.3.2.tar.bz2/src/slxstrng.c Added

@@ -0,0 +1,58 @@
+/*
+Copyright (C) 2004-2017,2018 John E. Davis
+
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+
+/* These routines are simple and inefficient.  They were designed to work on
+ * SunOS when using Electric Fence.
+ */
+
+#include "slinclud.h"
+#include "slang.h"
+#include "_slang.h"
+char *SLstrcpy(register char *aa, register char *b)
+{
+   char *a = aa;
+   while ((*a++ = *b++) != 0);
+   return aa;
+}
+
+int SLstrcmp(register char *a, register char *b)
+{
+   while (*a && (*a == *b))
+     {
+	a++;
+	b++;
+     }
+   if (*a) return((unsigned char) *a - (unsigned char) *b);
+   else if (*b) return ((unsigned char) *a - (unsigned char) *b);
+   else return 0;
+}
+
+char *SLstrncpy(char *a, register char *b,register  int n)
+{
+   register char *aa = a;
+   while ((n > 0) && *b)
+     {
+	*aa++ = *b++;
+	n--;
+     }
+   while (n-- > 0) *aa++ = 0;
+   return (a);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/terminfo Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/terminfo/Makefile Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/terminfo/README Added

@@ -0,0 +1,33 @@
+The include files in this directory define the binary layout of the terminfo
+file.  They were derived from the Cap files distributed with
+ncurses-5.6 using the parsecaps.sl script.
+
+Those files contain the following copyright notice:
+
+##############################################################################
+# Copyright (c) 1998-2002,2006 Free Software Foundation, Inc.                #
+#                                                                            #
+# 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, distribute    #
+# with modifications, 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 ABOVE 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.                                                  #
+#                                                                            #
+# Except as contained in this notice, the name(s) of the above copyright     #
+# holders shall not be used in advertising or otherwise to promote the sale, #
+# use or other dealings in this Software without prior written               #
+# authorization.                                                             #
+##############################################################################

_service:tar_scm:slang-2.3.2.tar.bz2/src/terminfo/aix4.inc Added

@@ -0,0 +1,587 @@
+/* This file was autogenerated using parsecaps.sl /tmp/Caps.aix4 */
+
+static Tgetstr_Map_Type Tgetstr_Map =
+{
+   {"!1", 339		UNTIC_COMMENT("shifted save key")},
+   {"!2", 340		UNTIC_COMMENT("shifted suspend key")},
+   {"!3", 341		UNTIC_COMMENT("shifted undo key")},
+   {"#1", 325		UNTIC_COMMENT("shifted help key")},
+   {"#2", 326		UNTIC_COMMENT("shifted home key")},
+   {"#3", 327		UNTIC_COMMENT("shifted insert-character key")},
+   {"#4", 328		UNTIC_COMMENT("shifted left-arrow key")},
+   {"%0", 304		UNTIC_COMMENT("redo key")},
+   {"%2", 296		UNTIC_COMMENT("mark key")},
+   {"%3", 297		UNTIC_COMMENT("message key")},
+   {"%4", 298		UNTIC_COMMENT("move key")},
+   {"%5", 299		UNTIC_COMMENT("next key")},
+   {"%6", 300		UNTIC_COMMENT("open key")},
+   {"%7", 301		UNTIC_COMMENT("options key")},
+   {"%8", 302		UNTIC_COMMENT("previous key")},
+   {"%9", 303		UNTIC_COMMENT("print key")},
+   {"%a", 329		UNTIC_COMMENT("shifted message key")},
+   {"%b", 330		UNTIC_COMMENT("shifted move key")},
+   {"%c", 331		UNTIC_COMMENT("shifted next key")},
+   {"%d", 332		UNTIC_COMMENT("shifted options key")},
+   {"%e", 333		UNTIC_COMMENT("shifted previous key")},
+   {"%f", 334		UNTIC_COMMENT("shifted print key")},
+   {"%g", 335		UNTIC_COMMENT("shifted redo key")},
+   {"%h", 336		UNTIC_COMMENT("shifted replace key")},
+   {"%i", 337		UNTIC_COMMENT("shifted right-arrow key")},
+   {"%j", 338		UNTIC_COMMENT("shifted resume key")},
+   {"&0", 314		UNTIC_COMMENT("shifted cancel key")},
+   {"&1", 305		UNTIC_COMMENT("reference key")},
+   {"&2", 306		UNTIC_COMMENT("refresh key")},
+   {"&3", 307		UNTIC_COMMENT("replace key")},
+   {"&4", 308		UNTIC_COMMENT("restart key")},
+   {"&5", 309		UNTIC_COMMENT("resume key")},
+   {"&6", 310		UNTIC_COMMENT("save key")},
+   {"&7", 311		UNTIC_COMMENT("suspend key")},
+   {"&8", 312		UNTIC_COMMENT("undo key")},
+   {"&9", 313		UNTIC_COMMENT("shifted begin key")},
+   {"*0", 324		UNTIC_COMMENT("shifted find key")},
+   {"*1", 315		UNTIC_COMMENT("shifted command key")},
+   {"*2", 316		UNTIC_COMMENT("shifted copy key")},
+   {"*3", 317		UNTIC_COMMENT("shifted create key")},
+   {"*4", 318		UNTIC_COMMENT("shifted delete-character key")},
+   {"*5", 319		UNTIC_COMMENT("shifted delete-line key")},
+   {"*6", 320		UNTIC_COMMENT("select key")},
+   {"*7", 321		UNTIC_COMMENT("shifted end key")},
+   {"*8", 322		UNTIC_COMMENT("shifted clear-to-end-of-line key")},
+   {"*9", 323		UNTIC_COMMENT("shifted exit key")},
+   {"@0", 295		UNTIC_COMMENT("find key")},
+   {"@1", 288		UNTIC_COMMENT("begin key")},
+   {"@2", 289		UNTIC_COMMENT("cancel key")},
+   {"@3", 290		UNTIC_COMMENT("close key")},
+   {"@5", 291		UNTIC_COMMENT("copy key")},
+   {"@6", 292		UNTIC_COMMENT("create key")},
+   {"@8", 293		UNTIC_COMMENT("enter/send key")},
+   {"@9", 294		UNTIC_COMMENT("exit key")},
+   {"AB", 434		UNTIC_COMMENT("Set background color to #1, using ANSI escape")},
+   {"AF", 433		UNTIC_COMMENT("Set foreground color to #1, using ANSI escape")},
+   {"AL", 110		UNTIC_COMMENT("insert #1 lines (P*)")},
+   {"Bx", 147		UNTIC_COMMENT("attributes for box1")},
+   {"By", 148		UNTIC_COMMENT("attributes for box2")},
+   {"CC",   9		UNTIC_COMMENT("terminal settable cmd character in prototype !?")},
+   {"CM",  15		UNTIC_COMMENT("memory relative cursor addressing, move to row #1 columns #2")},
+   {"CW", 351		UNTIC_COMMENT("define a window #1 from #2,#3 to #4,#5")},
+   {"DC", 105		UNTIC_COMMENT("delete #1 characters (P*)")},
+   {"DI", 354		UNTIC_COMMENT("dial number #1")},
+   {"DK", 349		UNTIC_COMMENT("display clock")},
+   {"DL", 106		UNTIC_COMMENT("delete #1 lines (P*)")},
+   {"DO", 107		UNTIC_COMMENT("down #1 lines (P*)")},
+   {"F1", 217		UNTIC_COMMENT("F11 function key")},
+   {"F2", 218		UNTIC_COMMENT("F12 function key")},
+   {"F3", 219		UNTIC_COMMENT("F13 function key")},
+   {"F4", 220		UNTIC_COMMENT("F14 function key")},
+   {"F5", 221		UNTIC_COMMENT("F15 function key")},
+   {"F6", 222		UNTIC_COMMENT("F16 function key")},
+   {"F7", 223		UNTIC_COMMENT("F17 function key")},
+   {"F8", 224		UNTIC_COMMENT("F18 function key")},
+   {"F9", 225		UNTIC_COMMENT("F19 function key")},
+   {"FA", 226		UNTIC_COMMENT("F20 function key")},
+   {"FB", 227		UNTIC_COMMENT("F21 function key")},
+   {"FC", 228		UNTIC_COMMENT("F22 function key")},
+   {"FD", 229		UNTIC_COMMENT("F23 function key")},
+   {"FE", 230		UNTIC_COMMENT("F24 function key")},
+   {"FF", 231		UNTIC_COMMENT("F25 function key")},
+   {"FG", 232		UNTIC_COMMENT("F26 function key")},
+   {"FH", 233		UNTIC_COMMENT("F27 function key")},
+   {"FI", 234		UNTIC_COMMENT("F28 function key")},
+   {"FJ", 235		UNTIC_COMMENT("F29 function key")},
+   {"FK", 236		UNTIC_COMMENT("F30 function key")},
+   {"FL", 237		UNTIC_COMMENT("F31 function key")},
+   {"FM", 238		UNTIC_COMMENT("F32 function key")},
+   {"FN", 239		UNTIC_COMMENT("F33 function key")},
+   {"FO", 240		UNTIC_COMMENT("F34 function key")},
+   {"FP", 241		UNTIC_COMMENT("F35 function key")},
+   {"FQ", 242		UNTIC_COMMENT("F36 function key")},
+   {"FR", 243		UNTIC_COMMENT("F37 function key")},
+   {"FS", 244		UNTIC_COMMENT("F38 function key")},
+   {"FT", 245		UNTIC_COMMENT("F39 function key")},
+   {"FU", 246		UNTIC_COMMENT("F40 function key")},
+   {"FV", 247		UNTIC_COMMENT("F41 function key")},
+   {"FW", 248		UNTIC_COMMENT("F42 function key")},
+   {"FX", 249		UNTIC_COMMENT("F43 function key")},
+   {"FY", 250		UNTIC_COMMENT("F44 function key")},
+   {"FZ", 251		UNTIC_COMMENT("F45 function key")},
+   {"Fa", 252		UNTIC_COMMENT("F46 function key")},
+   {"Fb", 253		UNTIC_COMMENT("F47 function key")},
+   {"Fc", 254		UNTIC_COMMENT("F48 function key")},
+   {"Fd", 255		UNTIC_COMMENT("F49 function key")},
+   {"Fe", 256		UNTIC_COMMENT("F50 function key")},
+   {"Ff", 257		UNTIC_COMMENT("F51 function key")},
+   {"Fg", 258		UNTIC_COMMENT("F52 function key")},
+   {"Fh", 259		UNTIC_COMMENT("F53 function key")},
+   {"Fi", 260		UNTIC_COMMENT("F54 function key")},
+   {"Fj", 261		UNTIC_COMMENT("F55 function key")},
+   {"Fk", 262		UNTIC_COMMENT("F56 function key")},
+   {"Fl", 263		UNTIC_COMMENT("F57 function key")},
+   {"Fm", 264		UNTIC_COMMENT("F58 function key")},
+   {"Fn", 265		UNTIC_COMMENT("F59 function key")},
+   {"Fo", 266		UNTIC_COMMENT("F60 function key")},
+   {"Fp", 267		UNTIC_COMMENT("F61 function key")},
+   {"Fq", 268		UNTIC_COMMENT("F62 function key")},
+   {"Fr", 269		UNTIC_COMMENT("F63 function key")},
+   {"G1", 476		UNTIC_COMMENT("single upper right")},
+   {"G2", 474		UNTIC_COMMENT("single upper left")},
+   {"G3", 475		UNTIC_COMMENT("single lower left")},
+   {"G4", 477		UNTIC_COMMENT("single lower right")},
+   {"GC", 484		UNTIC_COMMENT("single intersection")},
+   {"GD", 481		UNTIC_COMMENT("tee pointing down")},
+   {"GH", 482		UNTIC_COMMENT("single horizontal line")},
+   {"GL", 479		UNTIC_COMMENT("tee pointing left")},
+   {"GR", 478		UNTIC_COMMENT("tee pointing right")},
+   {"GU", 480		UNTIC_COMMENT("tee pointing up")},
+   {"GV", 483		UNTIC_COMMENT("single vertical line")},
+   {"Gm", 432		UNTIC_COMMENT("Curses should get button events, parameter #1 not documented.")},
+   {"HU", 353		UNTIC_COMMENT("hang-up phone")},
+   {"IC", 108		UNTIC_COMMENT("insert #1 characters (P*)")},
+   {"Ic", 373		UNTIC_COMMENT("initialize color #1 to (#2,#3,#4)")},
+   {"Ip", 374		UNTIC_COMMENT("Initialize color pair #1 to fg=(#2,#3,#4), bg=(#5,#6,#7)")},
+   {"K1", 139		UNTIC_COMMENT("upper left of keypad")},
+   {"K2", 141		UNTIC_COMMENT("center of keypad")},
+   {"K3", 140		UNTIC_COMMENT("upper right of keypad")},
+   {"K4", 142		UNTIC_COMMENT("lower left of keypad")},
+   {"K5", 143		UNTIC_COMMENT("lower right of keypad")},
+   {"KR", 200		UNTIC_COMMENT("special mapped key 6 output")},
+   {"KS", 202		UNTIC_COMMENT("special mapped key 7 output")},
+   {"KT", 204		UNTIC_COMMENT("special mapped key 8 output")},
+   {"KU", 206		UNTIC_COMMENT("special mapped key 9 output")},
+   {"KV", 189		UNTIC_COMMENT("special mapped key 1 output")},
+   {"KW", 191		UNTIC_COMMENT("special mapped key 2 output")},
+   {"KX", 193		UNTIC_COMMENT("special mapped key 3 output")},
+   {"KY", 195		UNTIC_COMMENT("special mapped key 4 output")},
+   {"KZ", 197		UNTIC_COMMENT("special mapped key 5 output")},
+   {"Km", 429		UNTIC_COMMENT("Mouse event has occurred")},
+   {"Kv", 188		UNTIC_COMMENT("special mapped key 1 input")},
+   {"Kw", 190		UNTIC_COMMENT("special mapped key 2 input")},
+   {"Kx", 192		UNTIC_COMMENT("special mapped key 3 input")},
+   {"Ky", 194		UNTIC_COMMENT("special mapped key 4 input")},
+   {"Kz", 196		UNTIC_COMMENT("special mapped key 5 input")},
+   {"LE", 111		UNTIC_COMMENT("move #1 characters to the left (P)")},
+   {"LF", 287		UNTIC_COMMENT("turn off soft labels")},
+   {"LO", 286		UNTIC_COMMENT("turn on soft labels")},
+   {"Lf", 347		UNTIC_COMMENT("label format")},
+   {"MC", 344		UNTIC_COMMENT("clear right and left soft margins")},
+   {"ML", 345		UNTIC_COMMENT("set left soft margin at current column.	 See smgl. (ML is not in BSD termcap).")},
+   {"ML", 442		UNTIC_COMMENT("Set both left and right margins to #1, #2.  (ML is not in BSD termcap).")},
+   {"MR", 346		UNTIC_COMMENT("set right soft margin at current column")},
+   {"MT", 443		UNTIC_COMMENT("Sets both top and bottom margins to #1, #2")},
+   {"Mi", 430		UNTIC_COMMENT("Mouse status information")},
+   {"PA", 359		UNTIC_COMMENT("pause for 2-3 seconds")},
+   {"PU", 357		UNTIC_COMMENT("select pulse dialing")},
+   {"QD", 355		UNTIC_COMMENT("dial number #1 without checking")},
+   {"RA", 282		UNTIC_COMMENT("turn off automatic margins")},
+   {"RC", 350		UNTIC_COMMENT("remove clock")},
+   {"RF", 342		UNTIC_COMMENT("send next input char (for ptys)")},
+   {"RI", 112		UNTIC_COMMENT("move #1 characters to the right (P*)")},
+   {"RQ", 431		UNTIC_COMMENT("Request mouse position")},
+   {"RX", 280		UNTIC_COMMENT("turn off xon/xoff handshaking")},
+   {"S0", 216		UNTIC_COMMENT("special function key 10")},
+   {"S1", 207		UNTIC_COMMENT("special function key 1")},
+   {"S1", 452		UNTIC_COMMENT("Display PC character #1")},
+   {"S2", 208		UNTIC_COMMENT("special function key 2")},
+   {"S2", 453		UNTIC_COMMENT("Enter PC character display mode")},
+   {"S3", 209		UNTIC_COMMENT("special function key 3")},
+   {"S3", 454		UNTIC_COMMENT("Exit PC character display mode")},
+   {"S4", 210		UNTIC_COMMENT("special function key 4")},
+   {"S4", 455		UNTIC_COMMENT("Enter PC scancode mode")},
+   {"S5", 211		UNTIC_COMMENT("special function key 5")},
+   {"S5", 456		UNTIC_COMMENT("Exit PC scancode mode")},
+   {"S6", 212		UNTIC_COMMENT("special function key 6")},
+   {"S6", 457		UNTIC_COMMENT("PC terminal options")},
+   {"S7", 213		UNTIC_COMMENT("special function key 7")},
+   {"S7", 458		UNTIC_COMMENT("Escape for scancode emulation")},
+   {"S8", 214		UNTIC_COMMENT("special function key 8")},
+   {"S8", 459		UNTIC_COMMENT("Alternate escape for scancode emulation")},
+   {"S9", 215		UNTIC_COMMENT("special function key 9")},
+   {"SA", 281		UNTIC_COMMENT("turn on automatic margins")},
+   {"SC", 348		UNTIC_COMMENT("set clock, #1 hrs #2 mins #3 secs")},
+   {"SF", 109		UNTIC_COMMENT("scroll forward #1 lines (P)")},
+   {"SR", 113		UNTIC_COMMENT("scroll back #1 lines (P)")},
+   {"SX", 279		UNTIC_COMMENT("turn on xon/xoff handshaking")},
+   {"Sb", 377		UNTIC_COMMENT("Set background color #1")},
+   {"Sf", 376		UNTIC_COMMENT("Set foreground color #1")},
+   {"TO", 356		UNTIC_COMMENT("select touch tone dialing")},
+   {"UP", 114		UNTIC_COMMENT("up #1 lines (P*)")},
+   {"WA", 360		UNTIC_COMMENT("wait for dial-tone")},
+   {"WG", 352		UNTIC_COMMENT("go to window #1")},
+   {"XF", 284		UNTIC_COMMENT("XOFF character")},
+   {"XN", 283		UNTIC_COMMENT("XON character")},
+   {"Xh", 460		UNTIC_COMMENT("Enter horizontal highlight mode")},
+   {"Xl", 461		UNTIC_COMMENT("Enter left highlight mode")},
+   {"Xo", 462		UNTIC_COMMENT("Enter low highlight mode")},
+   {"Xr", 463		UNTIC_COMMENT("Enter right highlight mode")},
+   {"Xt", 464		UNTIC_COMMENT("Enter top highlight mode")},
+   {"Xv", 465		UNTIC_COMMENT("Enter vertical highlight mode")},
+   {"Xy", 444		UNTIC_COMMENT("Repeat bit image cell #1 #2 times")},
+   {"YZ", 451		UNTIC_COMMENT("Set page length to #1 lines")},
+   {"Yv", 446		UNTIC_COMMENT("Move to beginning of same row")},
+   {"Yw", 447		UNTIC_COMMENT("Give name for color #1")},
+   {"Yx", 448		UNTIC_COMMENT("Define rectangualar bit image region")},
+   {"Yy", 449		UNTIC_COMMENT("End a bit-image region")},
+   {"Yz", 450		UNTIC_COMMENT("Change to ribbon color #1")},
+   {"ZA", 378		UNTIC_COMMENT("Change number of characters per inch to #1")},
+   {"ZB", 379		UNTIC_COMMENT("Change number of lines per inch to #1")},
+   {"ZC", 380		UNTIC_COMMENT("Change horizontal resolution to #1")},
+   {"ZD", 381		UNTIC_COMMENT("Change vertical resolution to #1")},
+   {"ZE", 382		UNTIC_COMMENT("Define a character #1, #2 dots wide, descender #3")},
+   {"ZF", 383		UNTIC_COMMENT("Enter double-wide mode")},
+   {"ZG", 384		UNTIC_COMMENT("Enter draft-quality mode")},
+   {"ZH", 385		UNTIC_COMMENT("Enter italic mode")},
+   {"ZI", 386		UNTIC_COMMENT("Start leftward carriage motion")},
+   {"ZJ", 387		UNTIC_COMMENT("Start micro-motion mode")},
+   {"ZK", 388		UNTIC_COMMENT("Enter NLQ mode")},
+   {"ZL", 389		UNTIC_COMMENT("Enter normal-quality mode")},
+   {"ZM", 390		UNTIC_COMMENT("Enter shadow-print mode")},
+   {"ZN", 391		UNTIC_COMMENT("Enter subscript mode")},
+   {"ZO", 392		UNTIC_COMMENT("Enter superscript mode")},
+   {"ZP", 393		UNTIC_COMMENT("Start upward carriage motion")},
+   {"ZQ", 394		UNTIC_COMMENT("End double-wide mode")},
+   {"ZR", 395		UNTIC_COMMENT("End italic mode")},
+   {"ZS", 396		UNTIC_COMMENT("End left-motion mode")},
+   {"ZT", 397		UNTIC_COMMENT("End micro-motion mode")},
+   {"ZU", 398		UNTIC_COMMENT("End shadow-print mode")},
+   {"ZV", 399		UNTIC_COMMENT("End subscript mode")},
+   {"ZW", 400		UNTIC_COMMENT("End superscript mode")},
+   {"ZX", 401		UNTIC_COMMENT("End reverse character motion")},
+   {"ZY", 402		UNTIC_COMMENT("Like column_address in micro mode")},
+   {"ZZ", 403		UNTIC_COMMENT("Like cursor_down in micro mode")},
+   {"Za", 404		UNTIC_COMMENT("Like cursor_left in micro mode")},
+   {"Zb", 405		UNTIC_COMMENT("Like cursor_right in micro mode")},
+   {"Zc", 406		UNTIC_COMMENT("Like row_address #1 in micro mode")},
+   {"Zd", 407		UNTIC_COMMENT("Like cursor_up in micro mode")},
+   {"Ze", 408		UNTIC_COMMENT("Match software bits to print-head pins")},
+   {"Zf", 409		UNTIC_COMMENT("Like parm_down_cursor in micro mode")},
+   {"Zg", 410		UNTIC_COMMENT("Like parm_left_cursor in micro mode")},
+   {"Zh", 411		UNTIC_COMMENT("Like parm_right_cursor in micro mode")},
+   {"Zi", 412		UNTIC_COMMENT("Like parm_up_cursor in micro mode")},
+   {"Zj", 413		UNTIC_COMMENT("Select character set, #1")},
+   {"Zk", 414		UNTIC_COMMENT("Set bottom margin at current line")},
+   {"Zl", 415		UNTIC_COMMENT("Set bottom margin at line #1 or (if smgtp is not given) #2 lines from bottom")},
+   {"Zm", 416		UNTIC_COMMENT("Set left (right) margin at column #1")},
+   {"Zn", 417		UNTIC_COMMENT("Set right margin at column #1")},
+   {"Zo", 418		UNTIC_COMMENT("Set top margin at current line")},
+   {"Zp", 419		UNTIC_COMMENT("Set top (bottom) margin at row #1")},
+   {"Zq", 420		UNTIC_COMMENT("Start printing bit image graphics")},
+   {"Zr", 421		UNTIC_COMMENT("Start character set definition #1, with #2 characters in the set")},
+   {"Zs", 422		UNTIC_COMMENT("Stop printing bit image graphics")},
+   {"Zt", 423		UNTIC_COMMENT("End definition of character set #1")},
+   {"Zu", 424		UNTIC_COMMENT("List of subscriptable characters")},
+   {"Zv", 425		UNTIC_COMMENT("List of superscriptable characters")},
+   {"Zw", 426		UNTIC_COMMENT("Printing any of these characters causes CR")},
+   {"Zx", 427		UNTIC_COMMENT("No motion for subsequent character")},
+   {"Zy", 428		UNTIC_COMMENT("Produce #1'th item from list of character set names")},
+   {"Zz", 445		UNTIC_COMMENT("Move to next row of the bit image")},
+   {"ac", 276		UNTIC_COMMENT("graphics charset pairs, based on vt100")},
+   {"ae",  38		UNTIC_COMMENT("end alternate character set (P)")},
+   {"al",  53		UNTIC_COMMENT("insert line (P*)")},
+   {"as",  25		UNTIC_COMMENT("start alternate character set (P)")},
+   {"bc", 471		UNTIC_COMMENT("move left, if not ^H")},
+   {"bl",   1		UNTIC_COMMENT("audible signal (bell) (P)")},
+   {"bm", 272		UNTIC_COMMENT("start bottom-line mode")},
+   {"bt",   0		UNTIC_COMMENT("back tab (P)")},
+   {"bx", 145		UNTIC_COMMENT("box characters primary set")},
+   {"by", 146		UNTIC_COMMENT("box characters secondary set")},
+   {"c0", 157		UNTIC_COMMENT("foreground color 0")},
+   {"c1", 158		UNTIC_COMMENT("foreground color 1")},
+   {"c2", 159		UNTIC_COMMENT("foreground color 2")},
+   {"c3", 160		UNTIC_COMMENT("foreground color 3")},
+   {"c4", 161		UNTIC_COMMENT("foreground color 4")},
+   {"c5", 162		UNTIC_COMMENT("foreground color 5")},
+   {"c6", 163		UNTIC_COMMENT("foreground color 6")},
+   {"c7", 164		UNTIC_COMMENT("foreground color 7")},
+   {"cb", 343		UNTIC_COMMENT("Clear to beginning of line")},
+   {"cd",   7		UNTIC_COMMENT("clear to end of screen (P*)")},
+   {"ce",   6		UNTIC_COMMENT("clear to end of line (P)")},
+   {"ch",   8		UNTIC_COMMENT("horizontal position #1, absolute (P)")},
+   {"ci", 437		UNTIC_COMMENT("Init sequence for multiple codesets")},
+   {"cl",   5		UNTIC_COMMENT("clear screen and home cursor (P*)")},
+   {"cm",  10		UNTIC_COMMENT("move to row #1 columns #2")},
+   {"cr",   2		UNTIC_COMMENT("carriage return (P*) (P*)")},
+   {"cs",   3		UNTIC_COMMENT("change region to line #1 to line #2 (P)")},
+   {"ct",   4		UNTIC_COMMENT("clear all tab stops (P)")},
+   {"cv", 127		UNTIC_COMMENT("vertical position #1 absolute (P)")},
+   {"d0", 149		UNTIC_COMMENT("background color 0")},
+   {"d1", 150		UNTIC_COMMENT("background color 1")},
+   {"d2", 151		UNTIC_COMMENT("background color 2")},
+   {"d3", 152		UNTIC_COMMENT("background color 3")},
+   {"d4", 153		UNTIC_COMMENT("background color 4")},
+   {"d5", 154		UNTIC_COMMENT("background color 5")},
+   {"d6", 155		UNTIC_COMMENT("background color 6")},
+   {"d7", 156		UNTIC_COMMENT("background color 7")},
+   {"dc",  21		UNTIC_COMMENT("delete character (P*)")},
+   {"dl",  22		UNTIC_COMMENT("delete line (P*)")},
+   {"dm",  29		UNTIC_COMMENT("enter delete mode")},
+   {"do",  11		UNTIC_COMMENT("down one line")},
+   {"ds",  23		UNTIC_COMMENT("disable status line")},
+   {"dv", 436		UNTIC_COMMENT("Indicate language/codeset support")},
+   {"eA", 285		UNTIC_COMMENT("enable alternate char set")},
+   {"ec",  37		UNTIC_COMMENT("erase #1 characters (P)")},
+   {"ed",  41		UNTIC_COMMENT("end delete mode")},
+   {"ei",  42		UNTIC_COMMENT("exit insert mode")},
+   {"f0", 165		UNTIC_COMMENT("select font 0")},
+   {"f1", 166		UNTIC_COMMENT("select font 1")},
+   {"f2", 167		UNTIC_COMMENT("select font 2")},
+   {"f3", 168		UNTIC_COMMENT("select font 3")},
+   {"f4", 169		UNTIC_COMMENT("select font 4")},
+   {"f5", 170		UNTIC_COMMENT("select font 5")},
+   {"f6", 171		UNTIC_COMMENT("select font 6")},
+   {"f7", 172		UNTIC_COMMENT("select font 7")},
+   {"ff",  46		UNTIC_COMMENT("hardcopy terminal page eject (P*)")},
+   {"fh", 358		UNTIC_COMMENT("flash switch hook")},
+   {"fs",  47		UNTIC_COMMENT("return from status line")},
+   {"hd",  24		UNTIC_COMMENT("half a line down")},
+   {"ho",  12		UNTIC_COMMENT("home cursor (if no cup)")},
+   {"hu", 137		UNTIC_COMMENT("half a line up")},
+   {"i1",  48		UNTIC_COMMENT("initialization string")},
+   {"i2", 468		UNTIC_COMMENT("secondary initialization string")},
+   {"i3",  50		UNTIC_COMMENT("initialization string")},
+   {"iP", 138		UNTIC_COMMENT("path name of program for initialization")},
+   {"ic",  52		UNTIC_COMMENT("insert character (P)")},
+   {"if",  51		UNTIC_COMMENT("name of initialization file")},
+   {"im",  31		UNTIC_COMMENT("enter insert mode")},
+   {"ip",  54		UNTIC_COMMENT("insert padding after inserted character")},
+   {"is",  49		UNTIC_COMMENT("initialization string")},
+   {"k0",  65		UNTIC_COMMENT("F0 function key")},
+   {"k0", 173		UNTIC_COMMENT("backtab key")},
+   {"k1",  66		UNTIC_COMMENT("F1 function key")},
+   {"k2",  68		UNTIC_COMMENT("F2 function key")},
+   {"k3",  69		UNTIC_COMMENT("F3 function key")},
+   {"k4",  70		UNTIC_COMMENT("F4 function key")},
+   {"k5",  71		UNTIC_COMMENT("F5 function key")},
+   {"k6",  72		UNTIC_COMMENT("F6 function key")},
+   {"k7",  73		UNTIC_COMMENT("F7 function key")},
+   {"k8",  74		UNTIC_COMMENT("F8 function key")},
+   {"k9",  75		UNTIC_COMMENT("F9 function key")},
+   {"k;",  67		UNTIC_COMMENT("F10 function key")},
+   {"kA",  78		UNTIC_COMMENT("insert-line key")},
+   {"kB", 278		UNTIC_COMMENT("back-tab key")},
+   {"kC",  57		UNTIC_COMMENT("clear-screen or erase key")},
+   {"kD",  59		UNTIC_COMMENT("delete-character key")},
+   {"kE",  63		UNTIC_COMMENT("clear-to-end-of-line key")},
+   {"kF",  84		UNTIC_COMMENT("scroll-forward key")},
+   {"kH",  80		UNTIC_COMMENT("lower-left key (home down)")},
+   {"kI",  77		UNTIC_COMMENT("insert-character key")},
+   {"kJ", 270		UNTIC_COMMENT("sent by action key")},
+   {"kL",  60		UNTIC_COMMENT("delete-line key")},
+   {"kM",  62		UNTIC_COMMENT("sent by rmir or smir in insert mode")},
+   {"kN",  81		UNTIC_COMMENT("next-page key")},
+   {"kP",  82		UNTIC_COMMENT("previous-page key")},
+   {"kQ", 183		UNTIC_COMMENT("quit key")},
+   {"kR",  85		UNTIC_COMMENT("scroll-backward key")},
+   {"kS",  64		UNTIC_COMMENT("clear-to-end-of-screen key")},
+   {"kT",  86		UNTIC_COMMENT("set-tab key")},
+   {"kU", 184		UNTIC_COMMENT("select key")},
+   {"kV", 182		UNTIC_COMMENT("previous-pane key")},
+   {"kW", 176		UNTIC_COMMENT("command-pane key")},
+   {"kZ", 186		UNTIC_COMMENT("scroll right")},
+   {"ka",  56		UNTIC_COMMENT("clear-all-tabs key")},
+   {"kb",  55		UNTIC_COMMENT("backspace key")},
+   {"kd",  61		UNTIC_COMMENT("down-arrow key")},
+   {"kd", 175		UNTIC_COMMENT("command-request key")},
+   {"ke",  88		UNTIC_COMMENT("leave 'keyboard_transmit' mode")},
+   {"kh",  76		UNTIC_COMMENT("home key")},
+   {"ki", 174		UNTIC_COMMENT("do request key")},
+   {"kl",  79		UNTIC_COMMENT("left-arrow key")},
+   {"ko", 187		UNTIC_COMMENT("tab key")},
+   {"ko", 472		UNTIC_COMMENT("list of self-mapped keycaps")},
+   {"kp", 181		UNTIC_COMMENT("previous-command key")},
+   {"kq", 178		UNTIC_COMMENT("help key")},
+   {"kr",  83		UNTIC_COMMENT("right-arrow key")},
+   {"kr", 199		UNTIC_COMMENT("special mapped key 6 input")},
+   {"ks",  89		UNTIC_COMMENT("enter 'keyboard_transmit' mode")},
+   {"ks", 201		UNTIC_COMMENT("special mapped key 7 input")},
+   {"kt",  58		UNTIC_COMMENT("clear-tab key")},
+   {"kt", 203		UNTIC_COMMENT("special mapped key 8 input")},
+   {"ku",  87		UNTIC_COMMENT("up-arrow key")},
+   {"ku", 205		UNTIC_COMMENT("special mapped key 9 input")},
+   {"kv", 180		UNTIC_COMMENT("next-pane key")},
+   {"kw", 177		UNTIC_COMMENT("end key")},
+   {"kz", 185		UNTIC_COMMENT("scroll left")},
+   {"l0",  90		UNTIC_COMMENT("label on function key f0 if not f0")},
+   {"l1",  91		UNTIC_COMMENT("label on function key f1 if not f1")},
+   {"l2",  93		UNTIC_COMMENT("label on function key f2 if not f2")},
+   {"l3",  94		UNTIC_COMMENT("label on function key f3 if not f3")},
+   {"l4",  95		UNTIC_COMMENT("label on function key f4 if not f4")},
+   {"l5",  96		UNTIC_COMMENT("label on function key f5 if not f5")},
+   {"l6",  97		UNTIC_COMMENT("label on function key f6 if not f6")},
+   {"l7",  98		UNTIC_COMMENT("label on function key f7 if not f7")},
+   {"l8",  99		UNTIC_COMMENT("label on function key f8 if not f8")},
+   {"l9", 100		UNTIC_COMMENT("label on function key f9 if not f9")},
+   {"la",  92		UNTIC_COMMENT("label on function key f10 if not f10")},
+   {"le",  14		UNTIC_COMMENT("move left one space")},
+   {"ll",  18		UNTIC_COMMENT("last line, first column (if no cup)")},
+   {"lv", 274		UNTIC_COMMENT("start left-vertical mode")},
+   {"ma", 473		UNTIC_COMMENT("map arrow keys rogue(1) motion keys")},
+   {"mb",  26		UNTIC_COMMENT("turn on blinking")},
+   {"md",  27		UNTIC_COMMENT("turn on bold (extra bright) mode")},
+   {"me",  39		UNTIC_COMMENT("turn off all attributes")},
+   {"mh",  30		UNTIC_COMMENT("turn on half-bright mode")},
+   {"mk",  32		UNTIC_COMMENT("turn on blank mode (characters invisible)")},
+   {"ml", 485		UNTIC_COMMENT("lock memory above cursor")},
+   {"mm", 102		UNTIC_COMMENT("turn on meta mode (8th-bit on)")},
+   {"mo", 101		UNTIC_COMMENT("turn off meta mode")},
+   {"mp",  33		UNTIC_COMMENT("turn on protected mode")},
+   {"mr",  34		UNTIC_COMMENT("turn on reverse video mode")},
+   {"mu", 486		UNTIC_COMMENT("unlock memory")},
+   {"nd",  17		UNTIC_COMMENT("non-destructive space (move right one space)")},
+   {"nl", 179		UNTIC_COMMENT("newline key")},
+   {"nl", 470		UNTIC_COMMENT("use to move down")},
+   {"nw", 103		UNTIC_COMMENT("newline (behave like cr followed by lf)")},
+   {"oc", 372		UNTIC_COMMENT("Set all color pairs to the original ones")},
+   {"op", 371		UNTIC_COMMENT("Set default pair to its original value")},
+   {"pO", 144		UNTIC_COMMENT("turn on printer for #1 bytes")},
+   {"pc", 104		UNTIC_COMMENT("padding char (instead of null)")},
+   {"pf", 119		UNTIC_COMMENT("turn off printer")},
+   {"pk", 115		UNTIC_COMMENT("program function key #1 to type string #2")},
+   {"pl", 116		UNTIC_COMMENT("program function key #1 to execute string #2")},
+   {"pn", 277		UNTIC_COMMENT("program label #1 to show string #2")},
+   {"po", 120		UNTIC_COMMENT("turn on printer")},
+   {"ps", 118		UNTIC_COMMENT("print contents of screen")},
+   {"px", 117		UNTIC_COMMENT("program function key #1 to transmit string #2")},
+   {"r1", 122		UNTIC_COMMENT("reset string")},
+   {"r2", 123		UNTIC_COMMENT("reset string")},
+   {"r3", 124		UNTIC_COMMENT("reset string")},
+   {"rP", 275		UNTIC_COMMENT("like ip but when in insert mode")},
+   {"rc", 126		UNTIC_COMMENT("restore cursor to position of last save_cursor")},
+   {"rf", 125		UNTIC_COMMENT("name of reset file")},
+   {"rp", 121		UNTIC_COMMENT("repeat char #1 #2 times (P*)")},
+   {"rs", 469		UNTIC_COMMENT("terminal reset string")},
+   {"rv", 273		UNTIC_COMMENT("start right-vertical mode")},
+   {"s0", 438		UNTIC_COMMENT("Shift to codeset 0 (EUC set 0, ASCII)")},
+   {"s1", 439		UNTIC_COMMENT("Shift to codeset 1")},
+   {"s2", 440		UNTIC_COMMENT("Shift to codeset 2")},
+   {"s3", 441		UNTIC_COMMENT("Shift to codeset 3")},
+   {"sA", 466		UNTIC_COMMENT("Define second set of video attributes #1-#6")},
+   {"sL", 467		UNTIC_COMMENT("YI Set page length to #1 hundredth of an inch")},
+   {"sa", 131		UNTIC_COMMENT("define video attributes #1-#9 (PG9)")},
+   {"sc", 128		UNTIC_COMMENT("save current cursor position (P)")},
+   {"se",  43		UNTIC_COMMENT("exit standout mode")},
+   {"sf", 129		UNTIC_COMMENT("scroll text up (P)")},
+   {"so",  35		UNTIC_COMMENT("begin standout mode")},
+   {"sp", 375		UNTIC_COMMENT("Set current color pair to #1")},
+   {"sr", 130		UNTIC_COMMENT("scroll text down (P)")},
+   {"st", 132		UNTIC_COMMENT("set a tab in every row, current columns")},
+   {"ta", 134		UNTIC_COMMENT("tab to next 8-space hardware tab stop")},
+   {"te",  40		UNTIC_COMMENT("strings to end programs using cup")},
+   {"ti",  28		UNTIC_COMMENT("string to start programs using cup")},
+   {"tp", 271		UNTIC_COMMENT("start top-line mode")},
+   {"ts", 135		UNTIC_COMMENT("move to status line, column #1")},
+   {"u0", 361		UNTIC_COMMENT("User string #0")},
+   {"u1", 362		UNTIC_COMMENT("User string #1")},
+   {"u2", 363		UNTIC_COMMENT("User string #2")},
+   {"u3", 364		UNTIC_COMMENT("User string #3")},
+   {"u4", 365		UNTIC_COMMENT("User string #4")},
+   {"u5", 366		UNTIC_COMMENT("User string #5")},
+   {"u6", 367		UNTIC_COMMENT("User string #6")},
+   {"u7", 368		UNTIC_COMMENT("User string #7")},
+   {"u8", 369		UNTIC_COMMENT("User string #8")},
+   {"u9", 370		UNTIC_COMMENT("User string #9")},
+   {"uc", 136		UNTIC_COMMENT("underline char and move past it")},
+   {"ue",  44		UNTIC_COMMENT("exit underline mode")},
+   {"up",  19		UNTIC_COMMENT("up one line")},
+   {"us",  36		UNTIC_COMMENT("begin underline mode")},
+   {"vb",  45		UNTIC_COMMENT("visible bell (may not move cursor)")},
+   {"ve",  16		UNTIC_COMMENT("make cursor appear normal (undo civis/cvvis)")},
+   {"vi",  13		UNTIC_COMMENT("make cursor invisible")},
+   {"vs",  20		UNTIC_COMMENT("make cursor very visible")},
+   {"wi", 133		UNTIC_COMMENT("current window is lines #1-#2 cols #3-#4")},
+   {"xl", 435		UNTIC_COMMENT("Program function key #1 to type string #2 and show string #3")},
+   {"za", 198		UNTIC_COMMENT("application-defined string")},
+   {"",  -1		UNTIC_COMMENT("NULL")},
+};
+
+static Tgetstr_Map_Type Tgetnum_Map =
+{
+   {"BT",  30		UNTIC_COMMENT("number of buttons on mouse")},
+   {"Co",  13		UNTIC_COMMENT("maximum number of colors on screen")},
+   {"MW",  12		UNTIC_COMMENT("maximum number of defineable windows")},
+   {"NC",  15		UNTIC_COMMENT("video attributes that cannot be used with colors")},
+   {"Nl",   8		UNTIC_COMMENT("number of labels on screen")},
+   {"Ya",  16		UNTIC_COMMENT("numbers of bytes buffered before printing")},
+   {"Yb",  17		UNTIC_COMMENT("spacing of pins vertically in pins per inch")},
+   {"Yc",  18		UNTIC_COMMENT("spacing of dots horizontally in dots per inch")},
+   {"Yd",  19		UNTIC_COMMENT("maximum value in micro_..._address")},
+   {"Ye",  20		UNTIC_COMMENT("maximum value in parm_..._micro")},
+   {"Yf",  21		UNTIC_COMMENT("character step size when in micro mode")},
+   {"Yg",  22		UNTIC_COMMENT("line step size when in micro mode")},
+   {"Yh",  23		UNTIC_COMMENT("numbers of pins in print-head")},
+   {"Yi",  24		UNTIC_COMMENT("horizontal resolution in units per line")},
+   {"Yj",  25		UNTIC_COMMENT("vertical resolution in units per line")},
+   {"Yk",  26		UNTIC_COMMENT("horizontal resolution in units per inch")},
+   {"Yl",  27		UNTIC_COMMENT("vertical resolution in units per inch")},
+   {"Ym",  28		UNTIC_COMMENT("print rate in characters per second")},
+   {"Yn",  29		UNTIC_COMMENT("character step size when in double wide mode")},
+   {"Yo",  31		UNTIC_COMMENT("number of passes for each bit-image row")},
+   {"Yp",  32		UNTIC_COMMENT("type of bit-image device")},
+   {"co",   0		UNTIC_COMMENT("number of columns in a line")},
+   {"dB",  36		UNTIC_COMMENT("padding required for ^H")},
+   {"dC",  34		UNTIC_COMMENT("pad needed for CR")},
+   {"dN",  35		UNTIC_COMMENT("pad needed for LF")},
+   {"dT",  37		UNTIC_COMMENT("padding required for ^I")},
+   {"it",   1		UNTIC_COMMENT("tabs initially every # spaces")},
+   {"kn",  38		UNTIC_COMMENT("count of function keys")},
+   {"lh",   9		UNTIC_COMMENT("rows in each label")},
+   {"li",   2		UNTIC_COMMENT("number of lines on screen or page")},
+   {"lm",   3		UNTIC_COMMENT("lines of memory if > line. 0 means varies")},
+   {"lw",  10		UNTIC_COMMENT("columns in each label")},
+   {"ma",  11		UNTIC_COMMENT("maximum combined attributes terminal can handle")},
+   {"pa",  14		UNTIC_COMMENT("maximum number of color-pairs on the screen")},
+   {"pb",   5		UNTIC_COMMENT("lowest baud rate where padding needed")},
+   {"sg",   4		UNTIC_COMMENT("number of blank characters left by smso or rmso")},
+   {"ug",  33		UNTIC_COMMENT("number of blanks left by ul")},
+   {"vt",   6		UNTIC_COMMENT("virtual terminal number (CB/unix)")},
+   {"ws",   7		UNTIC_COMMENT("number of columns in status line")},
+   {"",  -1		UNTIC_COMMENT("NULL")},
+};
+
+static Tgetstr_Map_Type Tgetflag_Map =
+{
+   {"5i",  22		UNTIC_COMMENT("printer will not echo on screen")},
+   {"HC",  23		UNTIC_COMMENT("cursor is hard to see")},
+   {"MT",  40		UNTIC_COMMENT("has meta key")},
+   {"ND",  26		UNTIC_COMMENT("scrolling region is non-destructive")},
+   {"NL",  41		UNTIC_COMMENT("move down with \n")},
+   {"NP",  25		UNTIC_COMMENT("pad character does not exist")},
+   {"NR",  24		UNTIC_COMMENT("smcup does not reverse rmcup")},
+   {"YA",  30		UNTIC_COMMENT("only positive motion for hpa/mhpa caps")},
+   {"YB",  31		UNTIC_COMMENT("using cr turns off micro mode")},
+   {"YC",  32		UNTIC_COMMENT("printer needs operator to change character set")},
+   {"YD",  33		UNTIC_COMMENT("only positive motion for vpa/mvpa caps")},
+   {"YE",  34		UNTIC_COMMENT("printing in last column causes cr")},
+   {"YF",  35		UNTIC_COMMENT("changing character pitch changes resolution")},
+   {"YG",  36		UNTIC_COMMENT("changing line pitch changes resolution")},
+   {"am",   1		UNTIC_COMMENT("terminal has automatic margins")},
+   {"bs",  37		UNTIC_COMMENT("uses ^H to move left")},
+   {"bw",   0		UNTIC_COMMENT("cub1 wraps from column 0 to last column")},
+   {"cc",  27		UNTIC_COMMENT("terminal can re-define existing colors")},
+   {"da",  11		UNTIC_COMMENT("display may be retained above the screen")},
+   {"db",  12		UNTIC_COMMENT("display may be retained below the screen")},
+   {"eo",   5		UNTIC_COMMENT("can erase overstrikes with a blank")},
+   {"es",  16		UNTIC_COMMENT("escape can be used on the status line")},
+   {"gn",   6		UNTIC_COMMENT("generic line type")},
+   {"hc",   7		UNTIC_COMMENT("hardcopy terminal")},
+   {"hl",  29		UNTIC_COMMENT("terminal uses only HLS color notation (Tektronix)")},
+   {"hs",   9		UNTIC_COMMENT("has extra status line")},
+   {"hz",  18		UNTIC_COMMENT("cannot print ~'s (hazeltine)")},
+   {"in",  10		UNTIC_COMMENT("insert mode distinguishes nulls")},
+   {"km",   8		UNTIC_COMMENT("Has a meta key (i.e., sets 8th-bit)")},
+   {"mi",  13		UNTIC_COMMENT("safe to move while in insert mode")},
+   {"ms",  14		UNTIC_COMMENT("safe to move while in standout mode")},
+   {"nc",  39		UNTIC_COMMENT("no way to go to start of line")},
+   {"ns",  38		UNTIC_COMMENT("crt cannot scroll")},
+   {"nx",  21		UNTIC_COMMENT("padding will not work, xon/xoff required")},
+   {"os",  15		UNTIC_COMMENT("terminal can overstrike")},
+   {"pt",  42		UNTIC_COMMENT("has 8-char tabs invoked with ^I")},
+   {"ul",  19		UNTIC_COMMENT("underline character overstrikes")},
+   {"ut",  28		UNTIC_COMMENT("screen erased with background color")},
+   {"xb",   2		UNTIC_COMMENT("beehive (f1=escape, f2=ctrl C)")},
+   {"xn",   4		UNTIC_COMMENT("newline ignored after 80 cols (concept)")},
+   {"xo",  20		UNTIC_COMMENT("terminal uses xon/xoff handshaking")},
+   {"xr",  43		UNTIC_COMMENT("return clears the line")},
+   {"xs",   3		UNTIC_COMMENT("standout not erased by overwriting (hp)")},
+   {"xt",  17		UNTIC_COMMENT("tabs destructive, magic so char (t1061)")},
+   {"",  -1		UNTIC_COMMENT("NULL")},
+};
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/terminfo/default.inc Added

@@ -0,0 +1,514 @@
+/* This file was autogenerated using parsecaps.sl /tmp/Caps */
+
+static Tgetstr_Map_Type Tgetstr_Map =
+{
+   {"!1", 212		UNTIC_COMMENT("shifted save key")},
+   {"!2", 213		UNTIC_COMMENT("shifted suspend key")},
+   {"!3", 214		UNTIC_COMMENT("shifted undo key")},
+   {"#1", 198		UNTIC_COMMENT("shifted help key")},
+   {"#2", 199		UNTIC_COMMENT("shifted home key")},
+   {"#3", 200		UNTIC_COMMENT("shifted insert-character key")},
+   {"#4", 201		UNTIC_COMMENT("shifted left-arrow key")},
+   {"%0", 177		UNTIC_COMMENT("redo key")},
+   {"%1", 168		UNTIC_COMMENT("help key")},
+   {"%2", 169		UNTIC_COMMENT("mark key")},
+   {"%3", 170		UNTIC_COMMENT("message key")},
+   {"%4", 171		UNTIC_COMMENT("move key")},
+   {"%5", 172		UNTIC_COMMENT("next key")},
+   {"%6", 173		UNTIC_COMMENT("open key")},
+   {"%7", 174		UNTIC_COMMENT("options key")},
+   {"%8", 175		UNTIC_COMMENT("previous key")},
+   {"%9", 176		UNTIC_COMMENT("print key")},
+   {"%a", 202		UNTIC_COMMENT("shifted message key")},
+   {"%b", 203		UNTIC_COMMENT("shifted move key")},
+   {"%c", 204		UNTIC_COMMENT("shifted next key")},
+   {"%d", 205		UNTIC_COMMENT("shifted options key")},
+   {"%e", 206		UNTIC_COMMENT("shifted previous key")},
+   {"%f", 207		UNTIC_COMMENT("shifted print key")},
+   {"%g", 208		UNTIC_COMMENT("shifted redo key")},
+   {"%h", 209		UNTIC_COMMENT("shifted replace key")},
+   {"%i", 210		UNTIC_COMMENT("shifted right-arrow key")},
+   {"%j", 211		UNTIC_COMMENT("shifted resume key")},
+   {"&0", 187		UNTIC_COMMENT("shifted cancel key")},
+   {"&1", 178		UNTIC_COMMENT("reference key")},
+   {"&2", 179		UNTIC_COMMENT("refresh key")},
+   {"&3", 180		UNTIC_COMMENT("replace key")},
+   {"&4", 181		UNTIC_COMMENT("restart key")},
+   {"&5", 182		UNTIC_COMMENT("resume key")},
+   {"&6", 183		UNTIC_COMMENT("save key")},
+   {"&7", 184		UNTIC_COMMENT("suspend key")},
+   {"&8", 185		UNTIC_COMMENT("undo key")},
+   {"&9", 186		UNTIC_COMMENT("shifted begin key")},
+   {"*0", 197		UNTIC_COMMENT("shifted find key")},
+   {"*1", 188		UNTIC_COMMENT("shifted command key")},
+   {"*2", 189		UNTIC_COMMENT("shifted copy key")},
+   {"*3", 190		UNTIC_COMMENT("shifted create key")},
+   {"*4", 191		UNTIC_COMMENT("shifted delete-character key")},
+   {"*5", 192		UNTIC_COMMENT("shifted delete-line key")},
+   {"*6", 193		UNTIC_COMMENT("select key")},
+   {"*7", 194		UNTIC_COMMENT("shifted end key")},
+   {"*8", 195		UNTIC_COMMENT("shifted clear-to-end-of-line key")},
+   {"*9", 196		UNTIC_COMMENT("shifted exit key")},
+   {"@0", 167		UNTIC_COMMENT("find key")},
+   {"@1", 158		UNTIC_COMMENT("begin key")},
+   {"@2", 159		UNTIC_COMMENT("cancel key")},
+   {"@3", 160		UNTIC_COMMENT("close key")},
+   {"@4", 161		UNTIC_COMMENT("command key")},
+   {"@5", 162		UNTIC_COMMENT("copy key")},
+   {"@6", 163		UNTIC_COMMENT("create key")},
+   {"@7", 164		UNTIC_COMMENT("end key")},
+   {"@8", 165		UNTIC_COMMENT("enter/send key")},
+   {"@9", 166		UNTIC_COMMENT("exit key")},
+   {"AB", 360		UNTIC_COMMENT("Set background color to #1, using ANSI escape")},
+   {"AF", 359		UNTIC_COMMENT("Set foreground color to #1, using ANSI escape")},
+   {"AL", 110		UNTIC_COMMENT("insert #1 lines (P*)")},
+   {"CC",   9		UNTIC_COMMENT("terminal settable cmd character in prototype !?")},
+   {"CM",  15		UNTIC_COMMENT("memory relative cursor addressing, move to row #1 columns #2")},
+   {"CW", 277		UNTIC_COMMENT("define a window #1 from #2,#3 to #4,#5")},
+   {"DC", 105		UNTIC_COMMENT("delete #1 characters (P*)")},
+   {"DI", 280		UNTIC_COMMENT("dial number #1")},
+   {"DK", 275		UNTIC_COMMENT("display clock")},
+   {"DL", 106		UNTIC_COMMENT("delete #1 lines (P*)")},
+   {"DO", 107		UNTIC_COMMENT("down #1 lines (P*)")},
+   {"F1", 216		UNTIC_COMMENT("F11 function key")},
+   {"F2", 217		UNTIC_COMMENT("F12 function key")},
+   {"F3", 218		UNTIC_COMMENT("F13 function key")},
+   {"F4", 219		UNTIC_COMMENT("F14 function key")},
+   {"F5", 220		UNTIC_COMMENT("F15 function key")},
+   {"F6", 221		UNTIC_COMMENT("F16 function key")},
+   {"F7", 222		UNTIC_COMMENT("F17 function key")},
+   {"F8", 223		UNTIC_COMMENT("F18 function key")},
+   {"F9", 224		UNTIC_COMMENT("F19 function key")},
+   {"FA", 225		UNTIC_COMMENT("F20 function key")},
+   {"FB", 226		UNTIC_COMMENT("F21 function key")},
+   {"FC", 227		UNTIC_COMMENT("F22 function key")},
+   {"FD", 228		UNTIC_COMMENT("F23 function key")},
+   {"FE", 229		UNTIC_COMMENT("F24 function key")},
+   {"FF", 230		UNTIC_COMMENT("F25 function key")},
+   {"FG", 231		UNTIC_COMMENT("F26 function key")},
+   {"FH", 232		UNTIC_COMMENT("F27 function key")},
+   {"FI", 233		UNTIC_COMMENT("F28 function key")},
+   {"FJ", 234		UNTIC_COMMENT("F29 function key")},
+   {"FK", 235		UNTIC_COMMENT("F30 function key")},
+   {"FL", 236		UNTIC_COMMENT("F31 function key")},
+   {"FM", 237		UNTIC_COMMENT("F32 function key")},
+   {"FN", 238		UNTIC_COMMENT("F33 function key")},
+   {"FO", 239		UNTIC_COMMENT("F34 function key")},
+   {"FP", 240		UNTIC_COMMENT("F35 function key")},
+   {"FQ", 241		UNTIC_COMMENT("F36 function key")},
+   {"FR", 242		UNTIC_COMMENT("F37 function key")},
+   {"FS", 243		UNTIC_COMMENT("F38 function key")},
+   {"FT", 244		UNTIC_COMMENT("F39 function key")},
+   {"FU", 245		UNTIC_COMMENT("F40 function key")},
+   {"FV", 246		UNTIC_COMMENT("F41 function key")},
+   {"FW", 247		UNTIC_COMMENT("F42 function key")},
+   {"FX", 248		UNTIC_COMMENT("F43 function key")},
+   {"FY", 249		UNTIC_COMMENT("F44 function key")},
+   {"FZ", 250		UNTIC_COMMENT("F45 function key")},
+   {"Fa", 251		UNTIC_COMMENT("F46 function key")},
+   {"Fb", 252		UNTIC_COMMENT("F47 function key")},
+   {"Fc", 253		UNTIC_COMMENT("F48 function key")},
+   {"Fd", 254		UNTIC_COMMENT("F49 function key")},
+   {"Fe", 255		UNTIC_COMMENT("F50 function key")},
+   {"Ff", 256		UNTIC_COMMENT("F51 function key")},
+   {"Fg", 257		UNTIC_COMMENT("F52 function key")},
+   {"Fh", 258		UNTIC_COMMENT("F53 function key")},
+   {"Fi", 259		UNTIC_COMMENT("F54 function key")},
+   {"Fj", 260		UNTIC_COMMENT("F55 function key")},
+   {"Fk", 261		UNTIC_COMMENT("F56 function key")},
+   {"Fl", 262		UNTIC_COMMENT("F57 function key")},
+   {"Fm", 263		UNTIC_COMMENT("F58 function key")},
+   {"Fn", 264		UNTIC_COMMENT("F59 function key")},
+   {"Fo", 265		UNTIC_COMMENT("F60 function key")},
+   {"Fp", 266		UNTIC_COMMENT("F61 function key")},
+   {"Fq", 267		UNTIC_COMMENT("F62 function key")},
+   {"Fr", 268		UNTIC_COMMENT("F63 function key")},
+   {"G1", 402		UNTIC_COMMENT("single upper right")},
+   {"G2", 400		UNTIC_COMMENT("single upper left")},
+   {"G3", 401		UNTIC_COMMENT("single lower left")},
+   {"G4", 403		UNTIC_COMMENT("single lower right")},
+   {"GC", 410		UNTIC_COMMENT("single intersection")},
+   {"GD", 407		UNTIC_COMMENT("tee pointing down")},
+   {"GH", 408		UNTIC_COMMENT("single horizontal line")},
+   {"GL", 405		UNTIC_COMMENT("tee pointing left")},
+   {"GR", 404		UNTIC_COMMENT("tee pointing right")},
+   {"GU", 406		UNTIC_COMMENT("tee pointing up")},
+   {"GV", 409		UNTIC_COMMENT("single vertical line")},
+   {"Gm", 358		UNTIC_COMMENT("Curses should get button events, parameter #1 not documented.")},
+   {"HU", 279		UNTIC_COMMENT("hang-up phone")},
+   {"IC", 108		UNTIC_COMMENT("insert #1 characters (P*)")},
+   {"Ic", 299		UNTIC_COMMENT("initialize color #1 to (#2,#3,#4)")},
+   {"Ip", 300		UNTIC_COMMENT("Initialize color pair #1 to fg=(#2,#3,#4), bg=(#5,#6,#7)")},
+   {"K1", 139		UNTIC_COMMENT("upper left of keypad")},
+   {"K2", 141		UNTIC_COMMENT("center of keypad")},
+   {"K3", 140		UNTIC_COMMENT("upper right of keypad")},
+   {"K4", 142		UNTIC_COMMENT("lower left of keypad")},
+   {"K5", 143		UNTIC_COMMENT("lower right of keypad")},
+   {"Km", 355		UNTIC_COMMENT("Mouse event has occurred")},
+   {"LE", 111		UNTIC_COMMENT("move #1 characters to the left (P)")},
+   {"LF", 157		UNTIC_COMMENT("turn off soft labels")},
+   {"LO", 156		UNTIC_COMMENT("turn on soft labels")},
+   {"Lf", 273		UNTIC_COMMENT("label format")},
+   {"MC", 270		UNTIC_COMMENT("clear right and left soft margins")},
+   {"ML", 271		UNTIC_COMMENT("set left soft margin at current column.	 See smgl. (ML is not in BSD termcap).")},
+   {"ML", 368		UNTIC_COMMENT("Set both left and right margins to #1, #2.  (ML is not in BSD termcap).")},
+   {"MR", 272		UNTIC_COMMENT("set right soft margin at current column")},
+   {"MT", 369		UNTIC_COMMENT("Sets both top and bottom margins to #1, #2")},
+   {"Mi", 356		UNTIC_COMMENT("Mouse status information")},
+   {"PA", 285		UNTIC_COMMENT("pause for 2-3 seconds")},
+   {"PU", 283		UNTIC_COMMENT("select pulse dialing")},
+   {"QD", 281		UNTIC_COMMENT("dial number #1 without checking")},
+   {"RA", 152		UNTIC_COMMENT("turn off automatic margins")},
+   {"RC", 276		UNTIC_COMMENT("remove clock")},
+   {"RF", 215		UNTIC_COMMENT("send next input char (for ptys)")},
+   {"RI", 112		UNTIC_COMMENT("move #1 characters to the right (P*)")},
+   {"RQ", 357		UNTIC_COMMENT("Request mouse position")},
+   {"RX", 150		UNTIC_COMMENT("turn off xon/xoff handshaking")},
+   {"S1", 378		UNTIC_COMMENT("Display PC character #1")},
+   {"S2", 379		UNTIC_COMMENT("Enter PC character display mode")},
+   {"S3", 380		UNTIC_COMMENT("Exit PC character display mode")},
+   {"S4", 381		UNTIC_COMMENT("Enter PC scancode mode")},
+   {"S5", 382		UNTIC_COMMENT("Exit PC scancode mode")},
+   {"S6", 383		UNTIC_COMMENT("PC terminal options")},
+   {"S7", 384		UNTIC_COMMENT("Escape for scancode emulation")},
+   {"S8", 385		UNTIC_COMMENT("Alternate escape for scancode emulation")},
+   {"SA", 151		UNTIC_COMMENT("turn on automatic margins")},
+   {"SC", 274		UNTIC_COMMENT("set clock, #1 hrs #2 mins #3 secs")},
+   {"SF", 109		UNTIC_COMMENT("scroll forward #1 lines (P)")},
+   {"SR", 113		UNTIC_COMMENT("scroll back #1 lines (P)")},
+   {"SX", 149		UNTIC_COMMENT("turn on xon/xoff handshaking")},
+   {"Sb", 303		UNTIC_COMMENT("Set background color #1")},
+   {"Sf", 302		UNTIC_COMMENT("Set foreground color #1")},
+   {"TO", 282		UNTIC_COMMENT("select touch tone dialing")},
+   {"UP", 114		UNTIC_COMMENT("up #1 lines (P*)")},
+   {"WA", 286		UNTIC_COMMENT("wait for dial-tone")},
+   {"WG", 278		UNTIC_COMMENT("go to window #1")},
+   {"XF", 154		UNTIC_COMMENT("XOFF character")},
+   {"XN", 153		UNTIC_COMMENT("XON character")},
+   {"Xh", 386		UNTIC_COMMENT("Enter horizontal highlight mode")},
+   {"Xl", 387		UNTIC_COMMENT("Enter left highlight mode")},
+   {"Xo", 388		UNTIC_COMMENT("Enter low highlight mode")},
+   {"Xr", 389		UNTIC_COMMENT("Enter right highlight mode")},
+   {"Xt", 390		UNTIC_COMMENT("Enter top highlight mode")},
+   {"Xv", 391		UNTIC_COMMENT("Enter vertical highlight mode")},
+   {"Xy", 370		UNTIC_COMMENT("Repeat bit image cell #1 #2 times")},
+   {"YZ", 377		UNTIC_COMMENT("Set page length to #1 lines")},
+   {"Yv", 372		UNTIC_COMMENT("Move to beginning of same row")},
+   {"Yw", 373		UNTIC_COMMENT("Give name for color #1")},
+   {"Yx", 374		UNTIC_COMMENT("Define rectangualar bit image region")},
+   {"Yy", 375		UNTIC_COMMENT("End a bit-image region")},
+   {"Yz", 376		UNTIC_COMMENT("Change to ribbon color #1")},
+   {"ZA", 304		UNTIC_COMMENT("Change number of characters per inch to #1")},
+   {"ZB", 305		UNTIC_COMMENT("Change number of lines per inch to #1")},
+   {"ZC", 306		UNTIC_COMMENT("Change horizontal resolution to #1")},
+   {"ZD", 307		UNTIC_COMMENT("Change vertical resolution to #1")},
+   {"ZE", 308		UNTIC_COMMENT("Define a character #1, #2 dots wide, descender #3")},
+   {"ZF", 309		UNTIC_COMMENT("Enter double-wide mode")},
+   {"ZG", 310		UNTIC_COMMENT("Enter draft-quality mode")},
+   {"ZH", 311		UNTIC_COMMENT("Enter italic mode")},
+   {"ZI", 312		UNTIC_COMMENT("Start leftward carriage motion")},
+   {"ZJ", 313		UNTIC_COMMENT("Start micro-motion mode")},
+   {"ZK", 314		UNTIC_COMMENT("Enter NLQ mode")},
+   {"ZL", 315		UNTIC_COMMENT("Enter normal-quality mode")},
+   {"ZM", 316		UNTIC_COMMENT("Enter shadow-print mode")},
+   {"ZN", 317		UNTIC_COMMENT("Enter subscript mode")},
+   {"ZO", 318		UNTIC_COMMENT("Enter superscript mode")},
+   {"ZP", 319		UNTIC_COMMENT("Start upward carriage motion")},
+   {"ZQ", 320		UNTIC_COMMENT("End double-wide mode")},
+   {"ZR", 321		UNTIC_COMMENT("End italic mode")},
+   {"ZS", 322		UNTIC_COMMENT("End left-motion mode")},
+   {"ZT", 323		UNTIC_COMMENT("End micro-motion mode")},
+   {"ZU", 324		UNTIC_COMMENT("End shadow-print mode")},
+   {"ZV", 325		UNTIC_COMMENT("End subscript mode")},
+   {"ZW", 326		UNTIC_COMMENT("End superscript mode")},
+   {"ZX", 327		UNTIC_COMMENT("End reverse character motion")},
+   {"ZY", 328		UNTIC_COMMENT("Like column_address in micro mode")},
+   {"ZZ", 329		UNTIC_COMMENT("Like cursor_down in micro mode")},
+   {"Za", 330		UNTIC_COMMENT("Like cursor_left in micro mode")},
+   {"Zb", 331		UNTIC_COMMENT("Like cursor_right in micro mode")},
+   {"Zc", 332		UNTIC_COMMENT("Like row_address #1 in micro mode")},
+   {"Zd", 333		UNTIC_COMMENT("Like cursor_up in micro mode")},
+   {"Ze", 334		UNTIC_COMMENT("Match software bits to print-head pins")},
+   {"Zf", 335		UNTIC_COMMENT("Like parm_down_cursor in micro mode")},
+   {"Zg", 336		UNTIC_COMMENT("Like parm_left_cursor in micro mode")},
+   {"Zh", 337		UNTIC_COMMENT("Like parm_right_cursor in micro mode")},
+   {"Zi", 338		UNTIC_COMMENT("Like parm_up_cursor in micro mode")},
+   {"Zj", 339		UNTIC_COMMENT("Select character set, #1")},
+   {"Zk", 340		UNTIC_COMMENT("Set bottom margin at current line")},
+   {"Zl", 341		UNTIC_COMMENT("Set bottom margin at line #1 or (if smgtp is not given) #2 lines from bottom")},
+   {"Zm", 342		UNTIC_COMMENT("Set left (right) margin at column #1")},
+   {"Zn", 343		UNTIC_COMMENT("Set right margin at column #1")},
+   {"Zo", 344		UNTIC_COMMENT("Set top margin at current line")},
+   {"Zp", 345		UNTIC_COMMENT("Set top (bottom) margin at row #1")},
+   {"Zq", 346		UNTIC_COMMENT("Start printing bit image graphics")},
+   {"Zr", 347		UNTIC_COMMENT("Start character set definition #1, with #2 characters in the set")},
+   {"Zs", 348		UNTIC_COMMENT("Stop printing bit image graphics")},
+   {"Zt", 349		UNTIC_COMMENT("End definition of character set #1")},
+   {"Zu", 350		UNTIC_COMMENT("List of subscriptable characters")},
+   {"Zv", 351		UNTIC_COMMENT("List of superscriptable characters")},
+   {"Zw", 352		UNTIC_COMMENT("Printing any of these characters causes CR")},
+   {"Zx", 353		UNTIC_COMMENT("No motion for subsequent character")},
+   {"Zy", 354		UNTIC_COMMENT("Produce #1'th item from list of character set names")},
+   {"Zz", 371		UNTIC_COMMENT("Move to next row of the bit image")},
+   {"ac", 146		UNTIC_COMMENT("graphics charset pairs, based on vt100")},
+   {"ae",  38		UNTIC_COMMENT("end alternate character set (P)")},
+   {"al",  53		UNTIC_COMMENT("insert line (P*)")},
+   {"as",  25		UNTIC_COMMENT("start alternate character set (P)")},
+   {"bc", 397		UNTIC_COMMENT("move left, if not ^H")},
+   {"bl",   1		UNTIC_COMMENT("audible signal (bell) (P)")},
+   {"bt",   0		UNTIC_COMMENT("back tab (P)")},
+   {"bx", 413		UNTIC_COMMENT("box characters primary set")},
+   {"cb", 269		UNTIC_COMMENT("Clear to beginning of line")},
+   {"cd",   7		UNTIC_COMMENT("clear to end of screen (P*)")},
+   {"ce",   6		UNTIC_COMMENT("clear to end of line (P)")},
+   {"ch",   8		UNTIC_COMMENT("horizontal position #1, absolute (P)")},
+   {"ci", 363		UNTIC_COMMENT("Init sequence for multiple codesets")},
+   {"cl",   5		UNTIC_COMMENT("clear screen and home cursor (P*)")},
+   {"cm",  10		UNTIC_COMMENT("move to row #1 columns #2")},
+   {"cr",   2		UNTIC_COMMENT("carriage return (P*) (P*)")},
+   {"cs",   3		UNTIC_COMMENT("change region to line #1 to line #2 (P)")},
+   {"ct",   4		UNTIC_COMMENT("clear all tab stops (P)")},
+   {"cv", 127		UNTIC_COMMENT("vertical position #1 absolute (P)")},
+   {"dc",  21		UNTIC_COMMENT("delete character (P*)")},
+   {"dl",  22		UNTIC_COMMENT("delete line (P*)")},
+   {"dm",  29		UNTIC_COMMENT("enter delete mode")},
+   {"do",  11		UNTIC_COMMENT("down one line")},
+   {"ds",  23		UNTIC_COMMENT("disable status line")},
+   {"dv", 362		UNTIC_COMMENT("Indicate language/codeset support")},
+   {"eA", 155		UNTIC_COMMENT("enable alternate char set")},
+   {"ec",  37		UNTIC_COMMENT("erase #1 characters (P)")},
+   {"ed",  41		UNTIC_COMMENT("end delete mode")},
+   {"ei",  42		UNTIC_COMMENT("exit insert mode")},
+   {"ff",  46		UNTIC_COMMENT("hardcopy terminal page eject (P*)")},
+   {"fh", 284		UNTIC_COMMENT("flash switch hook")},
+   {"fs",  47		UNTIC_COMMENT("return from status line")},
+   {"hd",  24		UNTIC_COMMENT("half a line down")},
+   {"ho",  12		UNTIC_COMMENT("home cursor (if no cup)")},
+   {"hu", 137		UNTIC_COMMENT("half a line up")},
+   {"i1",  48		UNTIC_COMMENT("initialization string")},
+   {"i2", 394		UNTIC_COMMENT("secondary initialization string")},
+   {"i3",  50		UNTIC_COMMENT("initialization string")},
+   {"iP", 138		UNTIC_COMMENT("path name of program for initialization")},
+   {"ic",  52		UNTIC_COMMENT("insert character (P)")},
+   {"if",  51		UNTIC_COMMENT("name of initialization file")},
+   {"im",  31		UNTIC_COMMENT("enter insert mode")},
+   {"ip",  54		UNTIC_COMMENT("insert padding after inserted character")},
+   {"is",  49		UNTIC_COMMENT("initialization string")},
+   {"k0",  65		UNTIC_COMMENT("F0 function key")},
+   {"k1",  66		UNTIC_COMMENT("F1 function key")},
+   {"k2",  68		UNTIC_COMMENT("F2 function key")},
+   {"k3",  69		UNTIC_COMMENT("F3 function key")},
+   {"k4",  70		UNTIC_COMMENT("F4 function key")},
+   {"k5",  71		UNTIC_COMMENT("F5 function key")},
+   {"k6",  72		UNTIC_COMMENT("F6 function key")},
+   {"k7",  73		UNTIC_COMMENT("F7 function key")},
+   {"k8",  74		UNTIC_COMMENT("F8 function key")},
+   {"k9",  75		UNTIC_COMMENT("F9 function key")},
+   {"k;",  67		UNTIC_COMMENT("F10 function key")},
+   {"kA",  78		UNTIC_COMMENT("insert-line key")},
+   {"kB", 148		UNTIC_COMMENT("back-tab key")},
+   {"kC",  57		UNTIC_COMMENT("clear-screen or erase key")},
+   {"kD",  59		UNTIC_COMMENT("delete-character key")},
+   {"kE",  63		UNTIC_COMMENT("clear-to-end-of-line key")},
+   {"kF",  84		UNTIC_COMMENT("scroll-forward key")},
+   {"kH",  80		UNTIC_COMMENT("lower-left key (home down)")},
+   {"kI",  77		UNTIC_COMMENT("insert-character key")},
+   {"kL",  60		UNTIC_COMMENT("delete-line key")},
+   {"kM",  62		UNTIC_COMMENT("sent by rmir or smir in insert mode")},
+   {"kN",  81		UNTIC_COMMENT("next-page key")},
+   {"kP",  82		UNTIC_COMMENT("previous-page key")},
+   {"kR",  85		UNTIC_COMMENT("scroll-backward key")},
+   {"kS",  64		UNTIC_COMMENT("clear-to-end-of-screen key")},
+   {"kT",  86		UNTIC_COMMENT("set-tab key")},
+   {"ka",  56		UNTIC_COMMENT("clear-all-tabs key")},
+   {"kb",  55		UNTIC_COMMENT("backspace key")},
+   {"kd",  61		UNTIC_COMMENT("down-arrow key")},
+   {"ke",  88		UNTIC_COMMENT("leave 'keyboard_transmit' mode")},
+   {"kh",  76		UNTIC_COMMENT("home key")},
+   {"kl",  79		UNTIC_COMMENT("left-arrow key")},
+   {"ko", 398		UNTIC_COMMENT("list of self-mapped keycaps")},
+   {"kr",  83		UNTIC_COMMENT("right-arrow key")},
+   {"ks",  89		UNTIC_COMMENT("enter 'keyboard_transmit' mode")},
+   {"kt",  58		UNTIC_COMMENT("clear-tab key")},
+   {"ku",  87		UNTIC_COMMENT("up-arrow key")},
+   {"l0",  90		UNTIC_COMMENT("label on function key f0 if not f0")},
+   {"l1",  91		UNTIC_COMMENT("label on function key f1 if not f1")},
+   {"l2",  93		UNTIC_COMMENT("label on function key f2 if not f2")},
+   {"l3",  94		UNTIC_COMMENT("label on function key f3 if not f3")},
+   {"l4",  95		UNTIC_COMMENT("label on function key f4 if not f4")},
+   {"l5",  96		UNTIC_COMMENT("label on function key f5 if not f5")},
+   {"l6",  97		UNTIC_COMMENT("label on function key f6 if not f6")},
+   {"l7",  98		UNTIC_COMMENT("label on function key f7 if not f7")},
+   {"l8",  99		UNTIC_COMMENT("label on function key f8 if not f8")},
+   {"l9", 100		UNTIC_COMMENT("label on function key f9 if not f9")},
+   {"la",  92		UNTIC_COMMENT("label on function key f10 if not f10")},
+   {"le",  14		UNTIC_COMMENT("move left one space")},
+   {"ll",  18		UNTIC_COMMENT("last line, first column (if no cup)")},
+   {"ma", 399		UNTIC_COMMENT("map arrow keys rogue(1) motion keys")},
+   {"mb",  26		UNTIC_COMMENT("turn on blinking")},
+   {"md",  27		UNTIC_COMMENT("turn on bold (extra bright) mode")},
+   {"me",  39		UNTIC_COMMENT("turn off all attributes")},
+   {"mh",  30		UNTIC_COMMENT("turn on half-bright mode")},
+   {"mk",  32		UNTIC_COMMENT("turn on blank mode (characters invisible)")},
+   {"ml", 411		UNTIC_COMMENT("lock memory above cursor")},
+   {"mm", 102		UNTIC_COMMENT("turn on meta mode (8th-bit on)")},
+   {"mo", 101		UNTIC_COMMENT("turn off meta mode")},
+   {"mp",  33		UNTIC_COMMENT("turn on protected mode")},
+   {"mr",  34		UNTIC_COMMENT("turn on reverse video mode")},
+   {"mu", 412		UNTIC_COMMENT("unlock memory")},
+   {"nd",  17		UNTIC_COMMENT("non-destructive space (move right one space)")},
+   {"nl", 396		UNTIC_COMMENT("use to move down")},
+   {"nw", 103		UNTIC_COMMENT("newline (behave like cr followed by lf)")},
+   {"oc", 298		UNTIC_COMMENT("Set all color pairs to the original ones")},
+   {"op", 297		UNTIC_COMMENT("Set default pair to its original value")},
+   {"pO", 144		UNTIC_COMMENT("turn on printer for #1 bytes")},
+   {"pc", 104		UNTIC_COMMENT("padding char (instead of null)")},
+   {"pf", 119		UNTIC_COMMENT("turn off printer")},
+   {"pk", 115		UNTIC_COMMENT("program function key #1 to type string #2")},
+   {"pl", 116		UNTIC_COMMENT("program function key #1 to execute string #2")},
+   {"pn", 147		UNTIC_COMMENT("program label #1 to show string #2")},
+   {"po", 120		UNTIC_COMMENT("turn on printer")},
+   {"ps", 118		UNTIC_COMMENT("print contents of screen")},
+   {"px", 117		UNTIC_COMMENT("program function key #1 to transmit string #2")},
+   {"r1", 122		UNTIC_COMMENT("reset string")},
+   {"r2", 123		UNTIC_COMMENT("reset string")},
+   {"r3", 124		UNTIC_COMMENT("reset string")},
+   {"rP", 145		UNTIC_COMMENT("like ip but when in insert mode")},
+   {"rc", 126		UNTIC_COMMENT("restore cursor to position of last save_cursor")},
+   {"rf", 125		UNTIC_COMMENT("name of reset file")},
+   {"rp", 121		UNTIC_COMMENT("repeat char #1 #2 times (P*)")},
+   {"rs", 395		UNTIC_COMMENT("terminal reset string")},
+   {"s0", 364		UNTIC_COMMENT("Shift to codeset 0 (EUC set 0, ASCII)")},
+   {"s1", 365		UNTIC_COMMENT("Shift to codeset 1")},
+   {"s2", 366		UNTIC_COMMENT("Shift to codeset 2")},
+   {"s3", 367		UNTIC_COMMENT("Shift to codeset 3")},
+   {"sA", 392		UNTIC_COMMENT("Define second set of video attributes #1-#6")},
+   {"sL", 393		UNTIC_COMMENT("YI Set page length to #1 hundredth of an inch")},
+   {"sa", 131		UNTIC_COMMENT("define video attributes #1-#9 (PG9)")},
+   {"sc", 128		UNTIC_COMMENT("save current cursor position (P)")},
+   {"se",  43		UNTIC_COMMENT("exit standout mode")},
+   {"sf", 129		UNTIC_COMMENT("scroll text up (P)")},
+   {"so",  35		UNTIC_COMMENT("begin standout mode")},
+   {"sp", 301		UNTIC_COMMENT("Set current color pair to #1")},
+   {"sr", 130		UNTIC_COMMENT("scroll text down (P)")},
+   {"st", 132		UNTIC_COMMENT("set a tab in every row, current columns")},
+   {"ta", 134		UNTIC_COMMENT("tab to next 8-space hardware tab stop")},
+   {"te",  40		UNTIC_COMMENT("strings to end programs using cup")},
+   {"ti",  28		UNTIC_COMMENT("string to start programs using cup")},
+   {"ts", 135		UNTIC_COMMENT("move to status line, column #1")},
+   {"u0", 287		UNTIC_COMMENT("User string #0")},
+   {"u1", 288		UNTIC_COMMENT("User string #1")},
+   {"u2", 289		UNTIC_COMMENT("User string #2")},
+   {"u3", 290		UNTIC_COMMENT("User string #3")},
+   {"u4", 291		UNTIC_COMMENT("User string #4")},
+   {"u5", 292		UNTIC_COMMENT("User string #5")},
+   {"u6", 293		UNTIC_COMMENT("User string #6")},
+   {"u7", 294		UNTIC_COMMENT("User string #7")},
+   {"u8", 295		UNTIC_COMMENT("User string #8")},
+   {"u9", 296		UNTIC_COMMENT("User string #9")},
+   {"uc", 136		UNTIC_COMMENT("underline char and move past it")},
+   {"ue",  44		UNTIC_COMMENT("exit underline mode")},
+   {"up",  19		UNTIC_COMMENT("up one line")},
+   {"us",  36		UNTIC_COMMENT("begin underline mode")},
+   {"vb",  45		UNTIC_COMMENT("visible bell (may not move cursor)")},
+   {"ve",  16		UNTIC_COMMENT("make cursor appear normal (undo civis/cvvis)")},
+   {"vi",  13		UNTIC_COMMENT("make cursor invisible")},
+   {"vs",  20		UNTIC_COMMENT("make cursor very visible")},
+   {"wi", 133		UNTIC_COMMENT("current window is lines #1-#2 cols #3-#4")},
+   {"xl", 361		UNTIC_COMMENT("Program function key #1 to type string #2 and show string #3")},
+   {"",  -1		UNTIC_COMMENT("NULL")},
+};
+
+static Tgetstr_Map_Type Tgetnum_Map =
+{
+   {"BT",  30		UNTIC_COMMENT("number of buttons on mouse")},
+   {"Co",  13		UNTIC_COMMENT("maximum number of colors on screen")},
+   {"MW",  12		UNTIC_COMMENT("maximum number of defineable windows")},
+   {"NC",  15		UNTIC_COMMENT("video attributes that cannot be used with colors")},
+   {"Nl",   8		UNTIC_COMMENT("number of labels on screen")},
+   {"Ya",  16		UNTIC_COMMENT("numbers of bytes buffered before printing")},
+   {"Yb",  17		UNTIC_COMMENT("spacing of pins vertically in pins per inch")},
+   {"Yc",  18		UNTIC_COMMENT("spacing of dots horizontally in dots per inch")},
+   {"Yd",  19		UNTIC_COMMENT("maximum value in micro_..._address")},
+   {"Ye",  20		UNTIC_COMMENT("maximum value in parm_..._micro")},
+   {"Yf",  21		UNTIC_COMMENT("character step size when in micro mode")},
+   {"Yg",  22		UNTIC_COMMENT("line step size when in micro mode")},
+   {"Yh",  23		UNTIC_COMMENT("numbers of pins in print-head")},
+   {"Yi",  24		UNTIC_COMMENT("horizontal resolution in units per line")},
+   {"Yj",  25		UNTIC_COMMENT("vertical resolution in units per line")},
+   {"Yk",  26		UNTIC_COMMENT("horizontal resolution in units per inch")},
+   {"Yl",  27		UNTIC_COMMENT("vertical resolution in units per inch")},
+   {"Ym",  28		UNTIC_COMMENT("print rate in characters per second")},
+   {"Yn",  29		UNTIC_COMMENT("character step size when in double wide mode")},
+   {"Yo",  31		UNTIC_COMMENT("number of passes for each bit-image row")},
+   {"Yp",  32		UNTIC_COMMENT("type of bit-image device")},
+   {"co",   0		UNTIC_COMMENT("number of columns in a line")},
+   {"dB",  36		UNTIC_COMMENT("padding required for ^H")},
+   {"dC",  34		UNTIC_COMMENT("pad needed for CR")},
+   {"dN",  35		UNTIC_COMMENT("pad needed for LF")},
+   {"dT",  37		UNTIC_COMMENT("padding required for ^I")},
+   {"it",   1		UNTIC_COMMENT("tabs initially every # spaces")},
+   {"kn",  38		UNTIC_COMMENT("count of function keys")},
+   {"lh",   9		UNTIC_COMMENT("rows in each label")},
+   {"li",   2		UNTIC_COMMENT("number of lines on screen or page")},
+   {"lm",   3		UNTIC_COMMENT("lines of memory if > line. 0 means varies")},
+   {"lw",  10		UNTIC_COMMENT("columns in each label")},
+   {"ma",  11		UNTIC_COMMENT("maximum combined attributes terminal can handle")},
+   {"pa",  14		UNTIC_COMMENT("maximum number of color-pairs on the screen")},
+   {"pb",   5		UNTIC_COMMENT("lowest baud rate where padding needed")},
+   {"sg",   4		UNTIC_COMMENT("number of blank characters left by smso or rmso")},
+   {"ug",  33		UNTIC_COMMENT("number of blanks left by ul")},
+   {"vt",   6		UNTIC_COMMENT("virtual terminal number (CB/unix)")},
+   {"ws",   7		UNTIC_COMMENT("number of columns in status line")},
+   {"",  -1		UNTIC_COMMENT("NULL")},
+};
+
+static Tgetstr_Map_Type Tgetflag_Map =
+{
+   {"5i",  22		UNTIC_COMMENT("printer will not echo on screen")},
+   {"HC",  23		UNTIC_COMMENT("cursor is hard to see")},
+   {"MT",  40		UNTIC_COMMENT("has meta key")},
+   {"ND",  26		UNTIC_COMMENT("scrolling region is non-destructive")},
+   {"NL",  41		UNTIC_COMMENT("move down with \n")},
+   {"NP",  25		UNTIC_COMMENT("pad character does not exist")},
+   {"NR",  24		UNTIC_COMMENT("smcup does not reverse rmcup")},
+   {"YA",  30		UNTIC_COMMENT("only positive motion for hpa/mhpa caps")},
+   {"YB",  31		UNTIC_COMMENT("using cr turns off micro mode")},
+   {"YC",  32		UNTIC_COMMENT("printer needs operator to change character set")},
+   {"YD",  33		UNTIC_COMMENT("only positive motion for vpa/mvpa caps")},
+   {"YE",  34		UNTIC_COMMENT("printing in last column causes cr")},
+   {"YF",  35		UNTIC_COMMENT("changing character pitch changes resolution")},
+   {"YG",  36		UNTIC_COMMENT("changing line pitch changes resolution")},
+   {"am",   1		UNTIC_COMMENT("terminal has automatic margins")},
+   {"bs",  37		UNTIC_COMMENT("uses ^H to move left")},
+   {"bw",   0		UNTIC_COMMENT("cub1 wraps from column 0 to last column")},
+   {"cc",  27		UNTIC_COMMENT("terminal can re-define existing colors")},
+   {"da",  11		UNTIC_COMMENT("display may be retained above the screen")},
+   {"db",  12		UNTIC_COMMENT("display may be retained below the screen")},
+   {"eo",   5		UNTIC_COMMENT("can erase overstrikes with a blank")},
+   {"es",  16		UNTIC_COMMENT("escape can be used on the status line")},
+   {"gn",   6		UNTIC_COMMENT("generic line type")},
+   {"hc",   7		UNTIC_COMMENT("hardcopy terminal")},
+   {"hl",  29		UNTIC_COMMENT("terminal uses only HLS color notation (Tektronix)")},
+   {"hs",   9		UNTIC_COMMENT("has extra status line")},
+   {"hz",  18		UNTIC_COMMENT("cannot print ~'s (hazeltine)")},
+   {"in",  10		UNTIC_COMMENT("insert mode distinguishes nulls")},
+   {"km",   8		UNTIC_COMMENT("Has a meta key (i.e., sets 8th-bit)")},
+   {"mi",  13		UNTIC_COMMENT("safe to move while in insert mode")},
+   {"ms",  14		UNTIC_COMMENT("safe to move while in standout mode")},
+   {"nc",  39		UNTIC_COMMENT("no way to go to start of line")},
+   {"ns",  38		UNTIC_COMMENT("crt cannot scroll")},
+   {"nx",  21		UNTIC_COMMENT("padding will not work, xon/xoff required")},
+   {"os",  15		UNTIC_COMMENT("terminal can overstrike")},
+   {"pt",  42		UNTIC_COMMENT("has 8-char tabs invoked with ^I")},
+   {"ul",  19		UNTIC_COMMENT("underline character overstrikes")},
+   {"ut",  28		UNTIC_COMMENT("screen erased with background color")},
+   {"xb",   2		UNTIC_COMMENT("beehive (f1=escape, f2=ctrl C)")},
+   {"xn",   4		UNTIC_COMMENT("newline ignored after 80 cols (concept)")},
+   {"xo",  20		UNTIC_COMMENT("terminal uses xon/xoff handshaking")},
+   {"xr",  43		UNTIC_COMMENT("return clears the line")},
+   {"xs",   3		UNTIC_COMMENT("standout not erased by overwriting (hp)")},
+   {"xt",  17		UNTIC_COMMENT("tabs destructive, magic so char (t1061)")},
+   {"",  -1		UNTIC_COMMENT("NULL")},
+};
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/terminfo/hpux11.inc Added

@@ -0,0 +1,520 @@
+/* This file was autogenerated using parsecaps.sl /tmp/Caps.hpux11 */
+
+static Tgetstr_Map_Type Tgetstr_Map =
+{
+   {"!1", 267		UNTIC_COMMENT("shifted save key")},
+   {"!2", 268		UNTIC_COMMENT("shifted suspend key")},
+   {"!3", 269		UNTIC_COMMENT("shifted undo key")},
+   {"#1", 253		UNTIC_COMMENT("shifted help key")},
+   {"#2", 254		UNTIC_COMMENT("shifted home key")},
+   {"#3", 255		UNTIC_COMMENT("shifted insert-character key")},
+   {"#4", 256		UNTIC_COMMENT("shifted left-arrow key")},
+   {"%0", 232		UNTIC_COMMENT("redo key")},
+   {"%1", 223		UNTIC_COMMENT("help key")},
+   {"%2", 224		UNTIC_COMMENT("mark key")},
+   {"%3", 225		UNTIC_COMMENT("message key")},
+   {"%4", 226		UNTIC_COMMENT("move key")},
+   {"%5", 227		UNTIC_COMMENT("next key")},
+   {"%6", 228		UNTIC_COMMENT("open key")},
+   {"%7", 229		UNTIC_COMMENT("options key")},
+   {"%8", 230		UNTIC_COMMENT("previous key")},
+   {"%9", 231		UNTIC_COMMENT("print key")},
+   {"%a", 257		UNTIC_COMMENT("shifted message key")},
+   {"%b", 258		UNTIC_COMMENT("shifted move key")},
+   {"%c", 259		UNTIC_COMMENT("shifted next key")},
+   {"%d", 260		UNTIC_COMMENT("shifted options key")},
+   {"%e", 261		UNTIC_COMMENT("shifted previous key")},
+   {"%f", 262		UNTIC_COMMENT("shifted print key")},
+   {"%g", 263		UNTIC_COMMENT("shifted redo key")},
+   {"%h", 264		UNTIC_COMMENT("shifted replace key")},
+   {"%i", 265		UNTIC_COMMENT("shifted right-arrow key")},
+   {"%j", 266		UNTIC_COMMENT("shifted resume key")},
+   {"&0", 242		UNTIC_COMMENT("shifted cancel key")},
+   {"&1", 233		UNTIC_COMMENT("reference key")},
+   {"&2", 234		UNTIC_COMMENT("refresh key")},
+   {"&3", 235		UNTIC_COMMENT("replace key")},
+   {"&4", 236		UNTIC_COMMENT("restart key")},
+   {"&5", 237		UNTIC_COMMENT("resume key")},
+   {"&6", 238		UNTIC_COMMENT("save key")},
+   {"&7", 239		UNTIC_COMMENT("suspend key")},
+   {"&8", 240		UNTIC_COMMENT("undo key")},
+   {"&9", 241		UNTIC_COMMENT("shifted begin key")},
+   {"*0", 252		UNTIC_COMMENT("shifted find key")},
+   {"*1", 243		UNTIC_COMMENT("shifted command key")},
+   {"*2", 244		UNTIC_COMMENT("shifted copy key")},
+   {"*3", 245		UNTIC_COMMENT("shifted create key")},
+   {"*4", 246		UNTIC_COMMENT("shifted delete-character key")},
+   {"*5", 247		UNTIC_COMMENT("shifted delete-line key")},
+   {"*6", 248		UNTIC_COMMENT("select key")},
+   {"*7", 249		UNTIC_COMMENT("shifted end key")},
+   {"*8", 250		UNTIC_COMMENT("shifted clear-to-end-of-line key")},
+   {"*9", 251		UNTIC_COMMENT("shifted exit key")},
+   {"@0", 222		UNTIC_COMMENT("find key")},
+   {"@1", 213		UNTIC_COMMENT("begin key")},
+   {"@2", 214		UNTIC_COMMENT("cancel key")},
+   {"@3", 215		UNTIC_COMMENT("close key")},
+   {"@4", 216		UNTIC_COMMENT("command key")},
+   {"@5", 217		UNTIC_COMMENT("copy key")},
+   {"@6", 218		UNTIC_COMMENT("create key")},
+   {"@7", 219		UNTIC_COMMENT("end key")},
+   {"@8", 220		UNTIC_COMMENT("enter/send key")},
+   {"@9", 221		UNTIC_COMMENT("exit key")},
+   {"AB", 362		UNTIC_COMMENT("Set background color to #1, using ANSI escape")},
+   {"AF", 361		UNTIC_COMMENT("Set foreground color to #1, using ANSI escape")},
+   {"AL", 110		UNTIC_COMMENT("insert #1 lines (P*)")},
+   {"CC",   9		UNTIC_COMMENT("terminal settable cmd character in prototype !?")},
+   {"CM",  15		UNTIC_COMMENT("memory relative cursor addressing, move to row #1 columns #2")},
+   {"CW", 279		UNTIC_COMMENT("define a window #1 from #2,#3 to #4,#5")},
+   {"DC", 105		UNTIC_COMMENT("delete #1 characters (P*)")},
+   {"DI", 282		UNTIC_COMMENT("dial number #1")},
+   {"DK", 277		UNTIC_COMMENT("display clock")},
+   {"DL", 106		UNTIC_COMMENT("delete #1 lines (P*)")},
+   {"DO", 107		UNTIC_COMMENT("down #1 lines (P*)")},
+   {"F1", 150		UNTIC_COMMENT("F11 function key")},
+   {"F2", 151		UNTIC_COMMENT("F12 function key")},
+   {"F3", 152		UNTIC_COMMENT("F13 function key")},
+   {"F4", 153		UNTIC_COMMENT("F14 function key")},
+   {"F5", 154		UNTIC_COMMENT("F15 function key")},
+   {"F6", 155		UNTIC_COMMENT("F16 function key")},
+   {"F7", 156		UNTIC_COMMENT("F17 function key")},
+   {"F8", 157		UNTIC_COMMENT("F18 function key")},
+   {"F9", 158		UNTIC_COMMENT("F19 function key")},
+   {"FA", 159		UNTIC_COMMENT("F20 function key")},
+   {"FB", 160		UNTIC_COMMENT("F21 function key")},
+   {"FC", 161		UNTIC_COMMENT("F22 function key")},
+   {"FD", 162		UNTIC_COMMENT("F23 function key")},
+   {"FE", 163		UNTIC_COMMENT("F24 function key")},
+   {"FF", 164		UNTIC_COMMENT("F25 function key")},
+   {"FG", 165		UNTIC_COMMENT("F26 function key")},
+   {"FH", 166		UNTIC_COMMENT("F27 function key")},
+   {"FI", 167		UNTIC_COMMENT("F28 function key")},
+   {"FJ", 168		UNTIC_COMMENT("F29 function key")},
+   {"FK", 169		UNTIC_COMMENT("F30 function key")},
+   {"FL", 170		UNTIC_COMMENT("F31 function key")},
+   {"FM", 171		UNTIC_COMMENT("F32 function key")},
+   {"FN", 172		UNTIC_COMMENT("F33 function key")},
+   {"FO", 173		UNTIC_COMMENT("F34 function key")},
+   {"FP", 174		UNTIC_COMMENT("F35 function key")},
+   {"FQ", 175		UNTIC_COMMENT("F36 function key")},
+   {"FR", 176		UNTIC_COMMENT("F37 function key")},
+   {"FS", 177		UNTIC_COMMENT("F38 function key")},
+   {"FT", 178		UNTIC_COMMENT("F39 function key")},
+   {"FU", 179		UNTIC_COMMENT("F40 function key")},
+   {"FV", 180		UNTIC_COMMENT("F41 function key")},
+   {"FW", 181		UNTIC_COMMENT("F42 function key")},
+   {"FX", 182		UNTIC_COMMENT("F43 function key")},
+   {"FY", 183		UNTIC_COMMENT("F44 function key")},
+   {"FZ", 184		UNTIC_COMMENT("F45 function key")},
+   {"Fa", 185		UNTIC_COMMENT("F46 function key")},
+   {"Fb", 186		UNTIC_COMMENT("F47 function key")},
+   {"Fc", 187		UNTIC_COMMENT("F48 function key")},
+   {"Fd", 188		UNTIC_COMMENT("F49 function key")},
+   {"Fe", 189		UNTIC_COMMENT("F50 function key")},
+   {"Ff", 190		UNTIC_COMMENT("F51 function key")},
+   {"Fg", 191		UNTIC_COMMENT("F52 function key")},
+   {"Fh", 192		UNTIC_COMMENT("F53 function key")},
+   {"Fi", 193		UNTIC_COMMENT("F54 function key")},
+   {"Fj", 194		UNTIC_COMMENT("F55 function key")},
+   {"Fk", 195		UNTIC_COMMENT("F56 function key")},
+   {"Fl", 196		UNTIC_COMMENT("F57 function key")},
+   {"Fm", 197		UNTIC_COMMENT("F58 function key")},
+   {"Fn", 198		UNTIC_COMMENT("F59 function key")},
+   {"Fo", 199		UNTIC_COMMENT("F60 function key")},
+   {"Fp", 200		UNTIC_COMMENT("F61 function key")},
+   {"Fq", 201		UNTIC_COMMENT("F62 function key")},
+   {"Fr", 202		UNTIC_COMMENT("F63 function key")},
+   {"G1", 410		UNTIC_COMMENT("single upper right")},
+   {"G2", 408		UNTIC_COMMENT("single upper left")},
+   {"G3", 409		UNTIC_COMMENT("single lower left")},
+   {"G4", 411		UNTIC_COMMENT("single lower right")},
+   {"GC", 418		UNTIC_COMMENT("single intersection")},
+   {"GD", 415		UNTIC_COMMENT("tee pointing down")},
+   {"GH", 416		UNTIC_COMMENT("single horizontal line")},
+   {"GL", 413		UNTIC_COMMENT("tee pointing left")},
+   {"GR", 412		UNTIC_COMMENT("tee pointing right")},
+   {"GU", 414		UNTIC_COMMENT("tee pointing up")},
+   {"GV", 417		UNTIC_COMMENT("single vertical line")},
+   {"Gm", 360		UNTIC_COMMENT("Curses should get button events, parameter #1 not documented.")},
+   {"HU", 281		UNTIC_COMMENT("hang-up phone")},
+   {"IC", 108		UNTIC_COMMENT("insert #1 characters (P*)")},
+   {"Ic", 301		UNTIC_COMMENT("initialize color #1 to (#2,#3,#4)")},
+   {"Ip", 302		UNTIC_COMMENT("Initialize color pair #1 to fg=(#2,#3,#4), bg=(#5,#6,#7)")},
+   {"K1", 139		UNTIC_COMMENT("upper left of keypad")},
+   {"K2", 141		UNTIC_COMMENT("center of keypad")},
+   {"K3", 140		UNTIC_COMMENT("upper right of keypad")},
+   {"K4", 142		UNTIC_COMMENT("lower left of keypad")},
+   {"K5", 143		UNTIC_COMMENT("lower right of keypad")},
+   {"Km", 357		UNTIC_COMMENT("Mouse event has occurred")},
+   {"LE", 111		UNTIC_COMMENT("move #1 characters to the left (P)")},
+   {"LF", 149		UNTIC_COMMENT("turn off soft labels")},
+   {"LO", 148		UNTIC_COMMENT("turn on soft labels")},
+   {"Lf", 275		UNTIC_COMMENT("label format")},
+   {"MC", 272		UNTIC_COMMENT("clear right and left soft margins")},
+   {"ML", 273		UNTIC_COMMENT("set left soft margin at current column.	 See smgl. (ML is not in BSD termcap).")},
+   {"ML", 370		UNTIC_COMMENT("Set both left and right margins to #1, #2.  (ML is not in BSD termcap).")},
+   {"MR", 274		UNTIC_COMMENT("set right soft margin at current column")},
+   {"MT", 371		UNTIC_COMMENT("Sets both top and bottom margins to #1, #2")},
+   {"Mi", 358		UNTIC_COMMENT("Mouse status information")},
+   {"PA", 287		UNTIC_COMMENT("pause for 2-3 seconds")},
+   {"PU", 285		UNTIC_COMMENT("select pulse dialing")},
+   {"QD", 283		UNTIC_COMMENT("dial number #1 without checking")},
+   {"RA", 209		UNTIC_COMMENT("turn off automatic margins")},
+   {"RC", 278		UNTIC_COMMENT("remove clock")},
+   {"RF", 270		UNTIC_COMMENT("send next input char (for ptys)")},
+   {"RI", 112		UNTIC_COMMENT("move #1 characters to the right (P*)")},
+   {"RQ", 359		UNTIC_COMMENT("Request mouse position")},
+   {"RX", 207		UNTIC_COMMENT("turn off xon/xoff handshaking")},
+   {"S1", 380		UNTIC_COMMENT("Display PC character #1")},
+   {"S2", 381		UNTIC_COMMENT("Enter PC character display mode")},
+   {"S3", 382		UNTIC_COMMENT("Exit PC character display mode")},
+   {"S4", 383		UNTIC_COMMENT("Enter PC scancode mode")},
+   {"S5", 384		UNTIC_COMMENT("Exit PC scancode mode")},
+   {"S6", 385		UNTIC_COMMENT("PC terminal options")},
+   {"S7", 386		UNTIC_COMMENT("Escape for scancode emulation")},
+   {"S8", 387		UNTIC_COMMENT("Alternate escape for scancode emulation")},
+   {"SA", 208		UNTIC_COMMENT("turn on automatic margins")},
+   {"SC", 276		UNTIC_COMMENT("set clock, #1 hrs #2 mins #3 secs")},
+   {"SF", 109		UNTIC_COMMENT("scroll forward #1 lines (P)")},
+   {"SR", 113		UNTIC_COMMENT("scroll back #1 lines (P)")},
+   {"SX", 206		UNTIC_COMMENT("turn on xon/xoff handshaking")},
+   {"Sb", 305		UNTIC_COMMENT("Set background color #1")},
+   {"Sf", 304		UNTIC_COMMENT("Set foreground color #1")},
+   {"TO", 284		UNTIC_COMMENT("select touch tone dialing")},
+   {"UP", 114		UNTIC_COMMENT("up #1 lines (P*)")},
+   {"WA", 288		UNTIC_COMMENT("wait for dial-tone")},
+   {"WG", 280		UNTIC_COMMENT("go to window #1")},
+   {"XF", 211		UNTIC_COMMENT("XOFF character")},
+   {"XH", 396		UNTIC_COMMENT("Exit horizontal highlight mode")},
+   {"XL", 397		UNTIC_COMMENT("Exit left highlight mode")},
+   {"XN", 210		UNTIC_COMMENT("XON character")},
+   {"XO", 398		UNTIC_COMMENT("Exit low highlight mode")},
+   {"XR", 399		UNTIC_COMMENT("Exit right highlight mode")},
+   {"XT", 400		UNTIC_COMMENT("Exit top highlight mode")},
+   {"XV", 401		UNTIC_COMMENT("Exit vertical highlight mode")},
+   {"Xh", 389		UNTIC_COMMENT("Enter horizontal highlight mode")},
+   {"Xl", 390		UNTIC_COMMENT("Enter left highlight mode")},
+   {"Xo", 391		UNTIC_COMMENT("Enter low highlight mode")},
+   {"Xr", 392		UNTIC_COMMENT("Enter right highlight mode")},
+   {"Xt", 393		UNTIC_COMMENT("Enter top highlight mode")},
+   {"Xv", 394		UNTIC_COMMENT("Enter vertical highlight mode")},
+   {"Xy", 372		UNTIC_COMMENT("Repeat bit image cell #1 #2 times")},
+   {"YZ", 379		UNTIC_COMMENT("Set page length to #1 lines")},
+   {"Yv", 374		UNTIC_COMMENT("Move to beginning of same row")},
+   {"Yw", 375		UNTIC_COMMENT("Give name for color #1")},
+   {"Yx", 376		UNTIC_COMMENT("Define rectangualar bit image region")},
+   {"Yy", 377		UNTIC_COMMENT("End a bit-image region")},
+   {"Yz", 378		UNTIC_COMMENT("Change to ribbon color #1")},
+   {"ZA", 306		UNTIC_COMMENT("Change number of characters per inch to #1")},
+   {"ZB", 307		UNTIC_COMMENT("Change number of lines per inch to #1")},
+   {"ZC", 308		UNTIC_COMMENT("Change horizontal resolution to #1")},
+   {"ZD", 309		UNTIC_COMMENT("Change vertical resolution to #1")},
+   {"ZE", 310		UNTIC_COMMENT("Define a character #1, #2 dots wide, descender #3")},
+   {"ZF", 311		UNTIC_COMMENT("Enter double-wide mode")},
+   {"ZG", 312		UNTIC_COMMENT("Enter draft-quality mode")},
+   {"ZH", 313		UNTIC_COMMENT("Enter italic mode")},
+   {"ZI", 314		UNTIC_COMMENT("Start leftward carriage motion")},
+   {"ZJ", 315		UNTIC_COMMENT("Start micro-motion mode")},
+   {"ZK", 316		UNTIC_COMMENT("Enter NLQ mode")},
+   {"ZL", 317		UNTIC_COMMENT("Enter normal-quality mode")},
+   {"ZM", 318		UNTIC_COMMENT("Enter shadow-print mode")},
+   {"ZN", 319		UNTIC_COMMENT("Enter subscript mode")},
+   {"ZO", 320		UNTIC_COMMENT("Enter superscript mode")},
+   {"ZP", 321		UNTIC_COMMENT("Start upward carriage motion")},
+   {"ZQ", 322		UNTIC_COMMENT("End double-wide mode")},
+   {"ZR", 323		UNTIC_COMMENT("End italic mode")},
+   {"ZS", 324		UNTIC_COMMENT("End left-motion mode")},
+   {"ZT", 325		UNTIC_COMMENT("End micro-motion mode")},
+   {"ZU", 326		UNTIC_COMMENT("End shadow-print mode")},
+   {"ZV", 327		UNTIC_COMMENT("End subscript mode")},
+   {"ZW", 328		UNTIC_COMMENT("End superscript mode")},
+   {"ZX", 329		UNTIC_COMMENT("End reverse character motion")},
+   {"ZY", 330		UNTIC_COMMENT("Like column_address in micro mode")},
+   {"ZZ", 331		UNTIC_COMMENT("Like cursor_down in micro mode")},
+   {"Za", 332		UNTIC_COMMENT("Like cursor_left in micro mode")},
+   {"Zb", 333		UNTIC_COMMENT("Like cursor_right in micro mode")},
+   {"Zc", 334		UNTIC_COMMENT("Like row_address #1 in micro mode")},
+   {"Zd", 335		UNTIC_COMMENT("Like cursor_up in micro mode")},
+   {"Ze", 336		UNTIC_COMMENT("Match software bits to print-head pins")},
+   {"Zf", 337		UNTIC_COMMENT("Like parm_down_cursor in micro mode")},
+   {"Zg", 338		UNTIC_COMMENT("Like parm_left_cursor in micro mode")},
+   {"Zh", 339		UNTIC_COMMENT("Like parm_right_cursor in micro mode")},
+   {"Zi", 340		UNTIC_COMMENT("Like parm_up_cursor in micro mode")},
+   {"Zj", 341		UNTIC_COMMENT("Select character set, #1")},
+   {"Zk", 342		UNTIC_COMMENT("Set bottom margin at current line")},
+   {"Zl", 343		UNTIC_COMMENT("Set bottom margin at line #1 or (if smgtp is not given) #2 lines from bottom")},
+   {"Zm", 344		UNTIC_COMMENT("Set left (right) margin at column #1")},
+   {"Zn", 345		UNTIC_COMMENT("Set right margin at column #1")},
+   {"Zo", 346		UNTIC_COMMENT("Set top margin at current line")},
+   {"Zp", 347		UNTIC_COMMENT("Set top (bottom) margin at row #1")},
+   {"Zq", 348		UNTIC_COMMENT("Start printing bit image graphics")},
+   {"Zr", 349		UNTIC_COMMENT("Start character set definition #1, with #2 characters in the set")},
+   {"Zs", 350		UNTIC_COMMENT("Stop printing bit image graphics")},
+   {"Zt", 351		UNTIC_COMMENT("End definition of character set #1")},
+   {"Zu", 352		UNTIC_COMMENT("List of subscriptable characters")},
+   {"Zv", 353		UNTIC_COMMENT("List of superscriptable characters")},
+   {"Zw", 354		UNTIC_COMMENT("Printing any of these characters causes CR")},
+   {"Zx", 355		UNTIC_COMMENT("No motion for subsequent character")},
+   {"Zy", 356		UNTIC_COMMENT("Produce #1'th item from list of character set names")},
+   {"Zz", 373		UNTIC_COMMENT("Move to next row of the bit image")},
+   {"ac", 204		UNTIC_COMMENT("graphics charset pairs, based on vt100")},
+   {"ae",  38		UNTIC_COMMENT("end alternate character set (P)")},
+   {"al",  53		UNTIC_COMMENT("insert line (P*)")},
+   {"as",  25		UNTIC_COMMENT("start alternate character set (P)")},
+   {"bc", 405		UNTIC_COMMENT("move left, if not ^H")},
+   {"bl",   1		UNTIC_COMMENT("audible signal (bell) (P)")},
+   {"bt",   0		UNTIC_COMMENT("back tab (P)")},
+   {"bx", 419		UNTIC_COMMENT("box characters primary set")},
+   {"cb", 271		UNTIC_COMMENT("Clear to beginning of line")},
+   {"cd",   7		UNTIC_COMMENT("clear to end of screen (P*)")},
+   {"ce",   6		UNTIC_COMMENT("clear to end of line (P)")},
+   {"ch",   8		UNTIC_COMMENT("horizontal position #1, absolute (P)")},
+   {"ci", 365		UNTIC_COMMENT("Init sequence for multiple codesets")},
+   {"cl",   5		UNTIC_COMMENT("clear screen and home cursor (P*)")},
+   {"cm",  10		UNTIC_COMMENT("move to row #1 columns #2")},
+   {"cr",   2		UNTIC_COMMENT("carriage return (P*) (P*)")},
+   {"cs",   3		UNTIC_COMMENT("change region to line #1 to line #2 (P)")},
+   {"ct",   4		UNTIC_COMMENT("clear all tab stops (P)")},
+   {"cv", 127		UNTIC_COMMENT("vertical position #1 absolute (P)")},
+   {"dc",  21		UNTIC_COMMENT("delete character (P*)")},
+   {"dl",  22		UNTIC_COMMENT("delete line (P*)")},
+   {"dm",  29		UNTIC_COMMENT("enter delete mode")},
+   {"do",  11		UNTIC_COMMENT("down one line")},
+   {"ds",  23		UNTIC_COMMENT("disable status line")},
+   {"dv", 364		UNTIC_COMMENT("Indicate language/codeset support")},
+   {"eA", 212		UNTIC_COMMENT("enable alternate char set")},
+   {"ec",  37		UNTIC_COMMENT("erase #1 characters (P)")},
+   {"ed",  41		UNTIC_COMMENT("end delete mode")},
+   {"ei",  42		UNTIC_COMMENT("exit insert mode")},
+   {"ff",  46		UNTIC_COMMENT("hardcopy terminal page eject (P*)")},
+   {"fh", 286		UNTIC_COMMENT("flash switch hook")},
+   {"fs",  47		UNTIC_COMMENT("return from status line")},
+   {"hd",  24		UNTIC_COMMENT("half a line down")},
+   {"ho",  12		UNTIC_COMMENT("home cursor (if no cup)")},
+   {"hu", 137		UNTIC_COMMENT("half a line up")},
+   {"i1",  48		UNTIC_COMMENT("initialization string")},
+   {"i2", 402		UNTIC_COMMENT("secondary initialization string")},
+   {"i3",  50		UNTIC_COMMENT("initialization string")},
+   {"iP", 138		UNTIC_COMMENT("path name of program for initialization")},
+   {"ic",  52		UNTIC_COMMENT("insert character (P)")},
+   {"if",  51		UNTIC_COMMENT("name of initialization file")},
+   {"im",  31		UNTIC_COMMENT("enter insert mode")},
+   {"ip",  54		UNTIC_COMMENT("insert padding after inserted character")},
+   {"is",  49		UNTIC_COMMENT("initialization string")},
+   {"k0",  65		UNTIC_COMMENT("F0 function key")},
+   {"k1",  66		UNTIC_COMMENT("F1 function key")},
+   {"k2",  68		UNTIC_COMMENT("F2 function key")},
+   {"k3",  69		UNTIC_COMMENT("F3 function key")},
+   {"k4",  70		UNTIC_COMMENT("F4 function key")},
+   {"k5",  71		UNTIC_COMMENT("F5 function key")},
+   {"k6",  72		UNTIC_COMMENT("F6 function key")},
+   {"k7",  73		UNTIC_COMMENT("F7 function key")},
+   {"k8",  74		UNTIC_COMMENT("F8 function key")},
+   {"k9",  75		UNTIC_COMMENT("F9 function key")},
+   {"k;",  67		UNTIC_COMMENT("F10 function key")},
+   {"kA",  78		UNTIC_COMMENT("insert-line key")},
+   {"kB", 205		UNTIC_COMMENT("back-tab key")},
+   {"kC",  57		UNTIC_COMMENT("clear-screen or erase key")},
+   {"kD",  59		UNTIC_COMMENT("delete-character key")},
+   {"kE",  63		UNTIC_COMMENT("clear-to-end-of-line key")},
+   {"kF",  84		UNTIC_COMMENT("scroll-forward key")},
+   {"kH",  80		UNTIC_COMMENT("lower-left key (home down)")},
+   {"kI",  77		UNTIC_COMMENT("insert-character key")},
+   {"kL",  60		UNTIC_COMMENT("delete-line key")},
+   {"kM",  62		UNTIC_COMMENT("sent by rmir or smir in insert mode")},
+   {"kN",  81		UNTIC_COMMENT("next-page key")},
+   {"kP",  82		UNTIC_COMMENT("previous-page key")},
+   {"kR",  85		UNTIC_COMMENT("scroll-backward key")},
+   {"kS",  64		UNTIC_COMMENT("clear-to-end-of-screen key")},
+   {"kT",  86		UNTIC_COMMENT("set-tab key")},
+   {"ka",  56		UNTIC_COMMENT("clear-all-tabs key")},
+   {"kb",  55		UNTIC_COMMENT("backspace key")},
+   {"kd",  61		UNTIC_COMMENT("down-arrow key")},
+   {"ke",  88		UNTIC_COMMENT("leave 'keyboard_transmit' mode")},
+   {"kh",  76		UNTIC_COMMENT("home key")},
+   {"kl",  79		UNTIC_COMMENT("left-arrow key")},
+   {"ko", 406		UNTIC_COMMENT("list of self-mapped keycaps")},
+   {"kr",  83		UNTIC_COMMENT("right-arrow key")},
+   {"ks",  89		UNTIC_COMMENT("enter 'keyboard_transmit' mode")},
+   {"kt",  58		UNTIC_COMMENT("clear-tab key")},
+   {"ku",  87		UNTIC_COMMENT("up-arrow key")},
+   {"l0",  90		UNTIC_COMMENT("label on function key f0 if not f0")},
+   {"l1",  91		UNTIC_COMMENT("label on function key f1 if not f1")},
+   {"l2",  93		UNTIC_COMMENT("label on function key f2 if not f2")},
+   {"l3",  94		UNTIC_COMMENT("label on function key f3 if not f3")},
+   {"l4",  95		UNTIC_COMMENT("label on function key f4 if not f4")},
+   {"l5",  96		UNTIC_COMMENT("label on function key f5 if not f5")},
+   {"l6",  97		UNTIC_COMMENT("label on function key f6 if not f6")},
+   {"l7",  98		UNTIC_COMMENT("label on function key f7 if not f7")},
+   {"l8",  99		UNTIC_COMMENT("label on function key f8 if not f8")},
+   {"l9", 100		UNTIC_COMMENT("label on function key f9 if not f9")},
+   {"la",  92		UNTIC_COMMENT("label on function key f10 if not f10")},
+   {"le",  14		UNTIC_COMMENT("move left one space")},
+   {"ll",  18		UNTIC_COMMENT("last line, first column (if no cup)")},
+   {"ma", 407		UNTIC_COMMENT("map arrow keys rogue(1) motion keys")},
+   {"mb",  26		UNTIC_COMMENT("turn on blinking")},
+   {"md",  27		UNTIC_COMMENT("turn on bold (extra bright) mode")},
+   {"me",  39		UNTIC_COMMENT("turn off all attributes")},
+   {"mh",  30		UNTIC_COMMENT("turn on half-bright mode")},
+   {"mk",  32		UNTIC_COMMENT("turn on blank mode (characters invisible)")},
+   {"ml", 145		UNTIC_COMMENT("lock memory above cursor")},
+   {"mm", 102		UNTIC_COMMENT("turn on meta mode (8th-bit on)")},
+   {"mo", 101		UNTIC_COMMENT("turn off meta mode")},
+   {"mp",  33		UNTIC_COMMENT("turn on protected mode")},
+   {"mr",  34		UNTIC_COMMENT("turn on reverse video mode")},
+   {"mu", 146		UNTIC_COMMENT("unlock memory")},
+   {"nd",  17		UNTIC_COMMENT("non-destructive space (move right one space)")},
+   {"nl", 404		UNTIC_COMMENT("use to move down")},
+   {"nw", 103		UNTIC_COMMENT("newline (behave like cr followed by lf)")},
+   {"oc", 300		UNTIC_COMMENT("Set all color pairs to the original ones")},
+   {"op", 299		UNTIC_COMMENT("Set default pair to its original value")},
+   {"pO", 144		UNTIC_COMMENT("turn on printer for #1 bytes")},
+   {"pc", 104		UNTIC_COMMENT("padding char (instead of null)")},
+   {"pf", 119		UNTIC_COMMENT("turn off printer")},
+   {"pk", 115		UNTIC_COMMENT("program function key #1 to type string #2")},
+   {"pl", 116		UNTIC_COMMENT("program function key #1 to execute string #2")},
+   {"pn", 147		UNTIC_COMMENT("program label #1 to show string #2")},
+   {"po", 120		UNTIC_COMMENT("turn on printer")},
+   {"ps", 118		UNTIC_COMMENT("print contents of screen")},
+   {"px", 117		UNTIC_COMMENT("program function key #1 to transmit string #2")},
+   {"r1", 122		UNTIC_COMMENT("reset string")},
+   {"r2", 123		UNTIC_COMMENT("reset string")},
+   {"r3", 124		UNTIC_COMMENT("reset string")},
+   {"rP", 203		UNTIC_COMMENT("like ip but when in insert mode")},
+   {"rc", 126		UNTIC_COMMENT("restore cursor to position of last save_cursor")},
+   {"rf", 125		UNTIC_COMMENT("name of reset file")},
+   {"rp", 121		UNTIC_COMMENT("repeat char #1 #2 times (P*)")},
+   {"rs", 403		UNTIC_COMMENT("terminal reset string")},
+   {"s0", 366		UNTIC_COMMENT("Shift to codeset 0 (EUC set 0, ASCII)")},
+   {"s1", 367		UNTIC_COMMENT("Shift to codeset 1")},
+   {"s2", 368		UNTIC_COMMENT("Shift to codeset 2")},
+   {"s3", 369		UNTIC_COMMENT("Shift to codeset 3")},
+   {"sA", 395		UNTIC_COMMENT("Define second set of video attributes #1-#6")},
+   {"sL", 388		UNTIC_COMMENT("YI Set page length to #1 hundredth of an inch")},
+   {"sa", 131		UNTIC_COMMENT("define video attributes #1-#9 (PG9)")},
+   {"sc", 128		UNTIC_COMMENT("save current cursor position (P)")},
+   {"se",  43		UNTIC_COMMENT("exit standout mode")},
+   {"sf", 129		UNTIC_COMMENT("scroll text up (P)")},
+   {"so",  35		UNTIC_COMMENT("begin standout mode")},
+   {"sp", 303		UNTIC_COMMENT("Set current color pair to #1")},
+   {"sr", 130		UNTIC_COMMENT("scroll text down (P)")},
+   {"st", 132		UNTIC_COMMENT("set a tab in every row, current columns")},
+   {"ta", 134		UNTIC_COMMENT("tab to next 8-space hardware tab stop")},
+   {"te",  40		UNTIC_COMMENT("strings to end programs using cup")},
+   {"ti",  28		UNTIC_COMMENT("string to start programs using cup")},
+   {"ts", 135		UNTIC_COMMENT("move to status line, column #1")},
+   {"u0", 289		UNTIC_COMMENT("User string #0")},
+   {"u1", 290		UNTIC_COMMENT("User string #1")},
+   {"u2", 291		UNTIC_COMMENT("User string #2")},
+   {"u3", 292		UNTIC_COMMENT("User string #3")},
+   {"u4", 293		UNTIC_COMMENT("User string #4")},
+   {"u5", 294		UNTIC_COMMENT("User string #5")},
+   {"u6", 295		UNTIC_COMMENT("User string #6")},
+   {"u7", 296		UNTIC_COMMENT("User string #7")},
+   {"u8", 297		UNTIC_COMMENT("User string #8")},
+   {"u9", 298		UNTIC_COMMENT("User string #9")},
+   {"uc", 136		UNTIC_COMMENT("underline char and move past it")},
+   {"ue",  44		UNTIC_COMMENT("exit underline mode")},
+   {"up",  19		UNTIC_COMMENT("up one line")},
+   {"us",  36		UNTIC_COMMENT("begin underline mode")},
+   {"vb",  45		UNTIC_COMMENT("visible bell (may not move cursor)")},
+   {"ve",  16		UNTIC_COMMENT("make cursor appear normal (undo civis/cvvis)")},
+   {"vi",  13		UNTIC_COMMENT("make cursor invisible")},
+   {"vs",  20		UNTIC_COMMENT("make cursor very visible")},
+   {"wi", 133		UNTIC_COMMENT("current window is lines #1-#2 cols #3-#4")},
+   {"xl", 363		UNTIC_COMMENT("Program function key #1 to type string #2 and show string #3")},
+   {"",  -1		UNTIC_COMMENT("NULL")},
+};
+
+static Tgetstr_Map_Type Tgetnum_Map =
+{
+   {"BT",  30		UNTIC_COMMENT("number of buttons on mouse")},
+   {"Co",  13		UNTIC_COMMENT("maximum number of colors on screen")},
+   {"MW",  12		UNTIC_COMMENT("maximum number of defineable windows")},
+   {"NC",  15		UNTIC_COMMENT("video attributes that cannot be used with colors")},
+   {"Nl",   8		UNTIC_COMMENT("number of labels on screen")},
+   {"Ya",  16		UNTIC_COMMENT("numbers of bytes buffered before printing")},
+   {"Yb",  17		UNTIC_COMMENT("spacing of pins vertically in pins per inch")},
+   {"Yc",  18		UNTIC_COMMENT("spacing of dots horizontally in dots per inch")},
+   {"Yd",  19		UNTIC_COMMENT("maximum value in micro_..._address")},
+   {"Ye",  20		UNTIC_COMMENT("maximum value in parm_..._micro")},
+   {"Yf",  21		UNTIC_COMMENT("character step size when in micro mode")},
+   {"Yg",  22		UNTIC_COMMENT("line step size when in micro mode")},
+   {"Yh",  23		UNTIC_COMMENT("numbers of pins in print-head")},
+   {"Yi",  24		UNTIC_COMMENT("horizontal resolution in units per line")},
+   {"Yj",  25		UNTIC_COMMENT("vertical resolution in units per line")},
+   {"Yk",  26		UNTIC_COMMENT("horizontal resolution in units per inch")},
+   {"Yl",  27		UNTIC_COMMENT("vertical resolution in units per inch")},
+   {"Ym",  28		UNTIC_COMMENT("print rate in characters per second")},
+   {"Yn",  29		UNTIC_COMMENT("character step size when in double wide mode")},
+   {"Yo",  31		UNTIC_COMMENT("number of passes for each bit-image row")},
+   {"Yp",  32		UNTIC_COMMENT("type of bit-image device")},
+   {"co",   0		UNTIC_COMMENT("number of columns in a line")},
+   {"dB",  36		UNTIC_COMMENT("padding required for ^H")},
+   {"dC",  34		UNTIC_COMMENT("pad needed for CR")},
+   {"dN",  35		UNTIC_COMMENT("pad needed for LF")},
+   {"dT",  37		UNTIC_COMMENT("padding required for ^I")},
+   {"it",   1		UNTIC_COMMENT("tabs initially every # spaces")},
+   {"kn",  38		UNTIC_COMMENT("count of function keys")},
+   {"lh",   9		UNTIC_COMMENT("rows in each label")},
+   {"li",   2		UNTIC_COMMENT("number of lines on screen or page")},
+   {"lm",   3		UNTIC_COMMENT("lines of memory if > line. 0 means varies")},
+   {"lw",  10		UNTIC_COMMENT("columns in each label")},
+   {"ma",  11		UNTIC_COMMENT("maximum combined attributes terminal can handle")},
+   {"pa",  14		UNTIC_COMMENT("maximum number of color-pairs on the screen")},
+   {"pb",   5		UNTIC_COMMENT("lowest baud rate where padding needed")},
+   {"sg",   4		UNTIC_COMMENT("number of blank characters left by smso or rmso")},
+   {"ug",  33		UNTIC_COMMENT("number of blanks left by ul")},
+   {"vt",   6		UNTIC_COMMENT("virtual terminal number (CB/unix)")},
+   {"ws",   7		UNTIC_COMMENT("number of columns in status line")},
+   {"",  -1		UNTIC_COMMENT("NULL")},
+};
+
+static Tgetstr_Map_Type Tgetflag_Map =
+{
+   {"5i",  22		UNTIC_COMMENT("printer will not echo on screen")},
+   {"HC",  23		UNTIC_COMMENT("cursor is hard to see")},
+   {"MT",  40		UNTIC_COMMENT("has meta key")},
+   {"ND",  26		UNTIC_COMMENT("scrolling region is non-destructive")},
+   {"NL",  41		UNTIC_COMMENT("move down with \n")},
+   {"NP",  25		UNTIC_COMMENT("pad character does not exist")},
+   {"NR",  24		UNTIC_COMMENT("smcup does not reverse rmcup")},
+   {"YA",  30		UNTIC_COMMENT("only positive motion for hpa/mhpa caps")},
+   {"YB",  31		UNTIC_COMMENT("using cr turns off micro mode")},
+   {"YC",  32		UNTIC_COMMENT("printer needs operator to change character set")},
+   {"YD",  33		UNTIC_COMMENT("only positive motion for vpa/mvpa caps")},
+   {"YE",  34		UNTIC_COMMENT("printing in last column causes cr")},
+   {"YF",  35		UNTIC_COMMENT("changing character pitch changes resolution")},
+   {"YG",  36		UNTIC_COMMENT("changing line pitch changes resolution")},
+   {"am",   1		UNTIC_COMMENT("terminal has automatic margins")},
+   {"bs",  37		UNTIC_COMMENT("uses ^H to move left")},
+   {"bw",   0		UNTIC_COMMENT("cub1 wraps from column 0 to last column")},
+   {"cc",  27		UNTIC_COMMENT("terminal can re-define existing colors")},
+   {"da",  11		UNTIC_COMMENT("display may be retained above the screen")},
+   {"db",  12		UNTIC_COMMENT("display may be retained below the screen")},
+   {"eo",   5		UNTIC_COMMENT("can erase overstrikes with a blank")},
+   {"es",  16		UNTIC_COMMENT("escape can be used on the status line")},
+   {"gn",   6		UNTIC_COMMENT("generic line type")},
+   {"hc",   7		UNTIC_COMMENT("hardcopy terminal")},
+   {"hl",  29		UNTIC_COMMENT("terminal uses only HLS color notation (Tektronix)")},
+   {"hs",   9		UNTIC_COMMENT("has extra status line")},
+   {"hz",  18		UNTIC_COMMENT("cannot print ~'s (hazeltine)")},
+   {"in",  10		UNTIC_COMMENT("insert mode distinguishes nulls")},
+   {"km",   8		UNTIC_COMMENT("Has a meta key (i.e., sets 8th-bit)")},
+   {"mi",  13		UNTIC_COMMENT("safe to move while in insert mode")},
+   {"ms",  14		UNTIC_COMMENT("safe to move while in standout mode")},
+   {"nc",  39		UNTIC_COMMENT("no way to go to start of line")},
+   {"ns",  38		UNTIC_COMMENT("crt cannot scroll")},
+   {"nx",  21		UNTIC_COMMENT("padding will not work, xon/xoff required")},
+   {"os",  15		UNTIC_COMMENT("terminal can overstrike")},
+   {"pt",  42		UNTIC_COMMENT("has 8-char tabs invoked with ^I")},
+   {"ul",  19		UNTIC_COMMENT("underline character overstrikes")},
+   {"ut",  28		UNTIC_COMMENT("screen erased with background color")},
+   {"xb",   2		UNTIC_COMMENT("beehive (f1=escape, f2=ctrl C)")},
+   {"xn",   4		UNTIC_COMMENT("newline ignored after 80 cols (concept)")},
+   {"xo",  20		UNTIC_COMMENT("terminal uses xon/xoff handshaking")},
+   {"xr",  43		UNTIC_COMMENT("return clears the line")},
+   {"xs",   3		UNTIC_COMMENT("standout not erased by overwriting (hp)")},
+   {"xt",  17		UNTIC_COMMENT("tabs destructive, magic so char (t1061)")},
+   {"",  -1		UNTIC_COMMENT("NULL")},
+};
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/terminfo/osf1r5.inc Added

@@ -0,0 +1,582 @@
+/* This file was autogenerated using parsecaps.sl /tmp/Caps.osf1r5 */
+
+static Tgetstr_Map_Type Tgetstr_Map =
+{
+   {"!1", 379		UNTIC_COMMENT("shifted save key")},
+   {"!2", 380		UNTIC_COMMENT("shifted suspend key")},
+   {"!3", 381		UNTIC_COMMENT("shifted undo key")},
+   {"#1", 365		UNTIC_COMMENT("shifted help key")},
+   {"#2", 366		UNTIC_COMMENT("shifted home key")},
+   {"#3", 367		UNTIC_COMMENT("shifted insert-character key")},
+   {"#4", 368		UNTIC_COMMENT("shifted left-arrow key")},
+   {"%0", 347		UNTIC_COMMENT("redo key")},
+   {"%1", 178		UNTIC_COMMENT("help key")},
+   {"%2", 338		UNTIC_COMMENT("mark key")},
+   {"%3", 339		UNTIC_COMMENT("message key")},
+   {"%4", 341		UNTIC_COMMENT("move key")},
+   {"%5", 342		UNTIC_COMMENT("next key")},
+   {"%6", 343		UNTIC_COMMENT("open key")},
+   {"%7", 344		UNTIC_COMMENT("options key")},
+   {"%8", 345		UNTIC_COMMENT("previous key")},
+   {"%9", 346		UNTIC_COMMENT("print key")},
+   {"%a", 369		UNTIC_COMMENT("shifted message key")},
+   {"%b", 370		UNTIC_COMMENT("shifted move key")},
+   {"%c", 371		UNTIC_COMMENT("shifted next key")},
+   {"%d", 372		UNTIC_COMMENT("shifted options key")},
+   {"%e", 373		UNTIC_COMMENT("shifted previous key")},
+   {"%f", 374		UNTIC_COMMENT("shifted print key")},
+   {"%g", 375		UNTIC_COMMENT("shifted redo key")},
+   {"%h", 376		UNTIC_COMMENT("shifted replace key")},
+   {"%i", 377		UNTIC_COMMENT("shifted right-arrow key")},
+   {"%j", 378		UNTIC_COMMENT("shifted resume key")},
+   {"&0", 355		UNTIC_COMMENT("shifted cancel key")},
+   {"&1", 348		UNTIC_COMMENT("reference key")},
+   {"&2", 349		UNTIC_COMMENT("refresh key")},
+   {"&3", 350		UNTIC_COMMENT("replace key")},
+   {"&4", 351		UNTIC_COMMENT("restart key")},
+   {"&5", 352		UNTIC_COMMENT("resume key")},
+   {"&6", 353		UNTIC_COMMENT("save key")},
+   {"&7", 382		UNTIC_COMMENT("suspend key")},
+   {"&8", 383		UNTIC_COMMENT("undo key")},
+   {"&9", 354		UNTIC_COMMENT("shifted begin key")},
+   {"*0", 364		UNTIC_COMMENT("shifted find key")},
+   {"*1", 356		UNTIC_COMMENT("shifted command key")},
+   {"*2", 357		UNTIC_COMMENT("shifted copy key")},
+   {"*3", 358		UNTIC_COMMENT("shifted create key")},
+   {"*4", 359		UNTIC_COMMENT("shifted delete-character key")},
+   {"*5", 360		UNTIC_COMMENT("shifted delete-line key")},
+   {"*6", 184		UNTIC_COMMENT("select key")},
+   {"*7", 361		UNTIC_COMMENT("shifted end key")},
+   {"*8", 362		UNTIC_COMMENT("shifted clear-to-end-of-line key")},
+   {"*9", 363		UNTIC_COMMENT("shifted exit key")},
+   {"@0", 337		UNTIC_COMMENT("find key")},
+   {"@1", 302		UNTIC_COMMENT("begin key")},
+   {"@2", 304		UNTIC_COMMENT("cancel key")},
+   {"@3", 305		UNTIC_COMMENT("close key")},
+   {"@5", 306		UNTIC_COMMENT("copy key")},
+   {"@6", 307		UNTIC_COMMENT("create key")},
+   {"@7", 177		UNTIC_COMMENT("end key")},
+   {"@8", 308		UNTIC_COMMENT("enter/send key")},
+   {"@9", 309		UNTIC_COMMENT("exit key")},
+   {"AB", 415		UNTIC_COMMENT("Set background color to #1, using ANSI escape")},
+   {"AF", 416		UNTIC_COMMENT("Set foreground color to #1, using ANSI escape")},
+   {"AL", 110		UNTIC_COMMENT("insert #1 lines (P*)")},
+   {"Bx", 147		UNTIC_COMMENT("attributes for box1")},
+   {"By", 148		UNTIC_COMMENT("attributes for box2")},
+   {"CC",   9		UNTIC_COMMENT("terminal settable cmd character in prototype !?")},
+   {"CM",  15		UNTIC_COMMENT("memory relative cursor addressing, move to row #1 columns #2")},
+   {"CW", 259		UNTIC_COMMENT("define a window #1 from #2,#3 to #4,#5")},
+   {"DC", 105		UNTIC_COMMENT("delete #1 characters (P*)")},
+   {"DI", 263		UNTIC_COMMENT("dial number #1")},
+   {"DK", 264		UNTIC_COMMENT("display clock")},
+   {"DL", 106		UNTIC_COMMENT("delete #1 lines (P*)")},
+   {"DO", 107		UNTIC_COMMENT("down #1 lines (P*)")},
+   {"F1", 217		UNTIC_COMMENT("F11 function key")},
+   {"F2", 218		UNTIC_COMMENT("F12 function key")},
+   {"F3", 219		UNTIC_COMMENT("F13 function key")},
+   {"F4", 220		UNTIC_COMMENT("F14 function key")},
+   {"F5", 221		UNTIC_COMMENT("F15 function key")},
+   {"F6", 222		UNTIC_COMMENT("F16 function key")},
+   {"F7", 223		UNTIC_COMMENT("F17 function key")},
+   {"F8", 224		UNTIC_COMMENT("F18 function key")},
+   {"F9", 225		UNTIC_COMMENT("F19 function key")},
+   {"FA", 226		UNTIC_COMMENT("F20 function key")},
+   {"FB", 227		UNTIC_COMMENT("F21 function key")},
+   {"FC", 228		UNTIC_COMMENT("F22 function key")},
+   {"FD", 229		UNTIC_COMMENT("F23 function key")},
+   {"FE", 230		UNTIC_COMMENT("F24 function key")},
+   {"FF", 231		UNTIC_COMMENT("F25 function key")},
+   {"FG", 232		UNTIC_COMMENT("F26 function key")},
+   {"FH", 233		UNTIC_COMMENT("F27 function key")},
+   {"FI", 234		UNTIC_COMMENT("F28 function key")},
+   {"FJ", 235		UNTIC_COMMENT("F29 function key")},
+   {"FK", 236		UNTIC_COMMENT("F30 function key")},
+   {"FL", 237		UNTIC_COMMENT("F31 function key")},
+   {"FM", 238		UNTIC_COMMENT("F32 function key")},
+   {"FN", 239		UNTIC_COMMENT("F33 function key")},
+   {"FO", 240		UNTIC_COMMENT("F34 function key")},
+   {"FP", 241		UNTIC_COMMENT("F35 function key")},
+   {"FQ", 242		UNTIC_COMMENT("F36 function key")},
+   {"FR", 310		UNTIC_COMMENT("F37 function key")},
+   {"FS", 311		UNTIC_COMMENT("F38 function key")},
+   {"FT", 312		UNTIC_COMMENT("F39 function key")},
+   {"FU", 313		UNTIC_COMMENT("F40 function key")},
+   {"FV", 314		UNTIC_COMMENT("F41 function key")},
+   {"FW", 315		UNTIC_COMMENT("F42 function key")},
+   {"FX", 316		UNTIC_COMMENT("F43 function key")},
+   {"FY", 317		UNTIC_COMMENT("F44 function key")},
+   {"FZ", 318		UNTIC_COMMENT("F45 function key")},
+   {"Fa", 319		UNTIC_COMMENT("F46 function key")},
+   {"Fb", 320		UNTIC_COMMENT("F47 function key")},
+   {"Fc", 321		UNTIC_COMMENT("F48 function key")},
+   {"Fd", 322		UNTIC_COMMENT("F49 function key")},
+   {"Fe", 323		UNTIC_COMMENT("F50 function key")},
+   {"Ff", 324		UNTIC_COMMENT("F51 function key")},
+   {"Fg", 325		UNTIC_COMMENT("F52 function key")},
+   {"Fh", 326		UNTIC_COMMENT("F53 function key")},
+   {"Fi", 327		UNTIC_COMMENT("F54 function key")},
+   {"Fj", 328		UNTIC_COMMENT("F55 function key")},
+   {"Fk", 329		UNTIC_COMMENT("F56 function key")},
+   {"Fl", 330		UNTIC_COMMENT("F57 function key")},
+   {"Fm", 331		UNTIC_COMMENT("F58 function key")},
+   {"Fn", 332		UNTIC_COMMENT("F59 function key")},
+   {"Fo", 333		UNTIC_COMMENT("F60 function key")},
+   {"Fp", 334		UNTIC_COMMENT("F61 function key")},
+   {"Fq", 335		UNTIC_COMMENT("F62 function key")},
+   {"Fr", 336		UNTIC_COMMENT("F63 function key")},
+   {"G1", 471		UNTIC_COMMENT("single upper right")},
+   {"G2", 469		UNTIC_COMMENT("single upper left")},
+   {"G3", 470		UNTIC_COMMENT("single lower left")},
+   {"G4", 472		UNTIC_COMMENT("single lower right")},
+   {"GC", 479		UNTIC_COMMENT("single intersection")},
+   {"GD", 476		UNTIC_COMMENT("tee pointing down")},
+   {"GH", 477		UNTIC_COMMENT("single horizontal line")},
+   {"GL", 474		UNTIC_COMMENT("tee pointing left")},
+   {"GR", 473		UNTIC_COMMENT("tee pointing right")},
+   {"GU", 475		UNTIC_COMMENT("tee pointing up")},
+   {"GV", 478		UNTIC_COMMENT("single vertical line")},
+   {"Gm", 297		UNTIC_COMMENT("Curses should get button events, parameter #1 not documented.")},
+   {"HU", 299		UNTIC_COMMENT("hang-up phone")},
+   {"IC", 108		UNTIC_COMMENT("insert #1 characters (P*)")},
+   {"Ic", 300		UNTIC_COMMENT("initialize color #1 to (#2,#3,#4)")},
+   {"Ip", 301		UNTIC_COMMENT("Initialize color pair #1 to fg=(#2,#3,#4), bg=(#5,#6,#7)")},
+   {"K1", 139		UNTIC_COMMENT("upper left of keypad")},
+   {"K2", 141		UNTIC_COMMENT("center of keypad")},
+   {"K3", 140		UNTIC_COMMENT("upper right of keypad")},
+   {"K4", 142		UNTIC_COMMENT("lower left of keypad")},
+   {"K5", 143		UNTIC_COMMENT("lower right of keypad")},
+   {"KR", 200		UNTIC_COMMENT("special mapped key 6 output")},
+   {"KS", 202		UNTIC_COMMENT("special mapped key 7 output")},
+   {"KT", 204		UNTIC_COMMENT("special mapped key 8 output")},
+   {"KU", 206		UNTIC_COMMENT("special mapped key 9 output")},
+   {"KV", 189		UNTIC_COMMENT("special mapped key 1 output")},
+   {"KW", 191		UNTIC_COMMENT("special mapped key 2 output")},
+   {"KX", 193		UNTIC_COMMENT("special mapped key 3 output")},
+   {"KY", 195		UNTIC_COMMENT("special mapped key 4 output")},
+   {"KZ", 197		UNTIC_COMMENT("special mapped key 5 output")},
+   {"Km", 340		UNTIC_COMMENT("Mouse event has occurred")},
+   {"Kr", 199		UNTIC_COMMENT("special mapped key 6 input")},
+   {"Ks", 201		UNTIC_COMMENT("special mapped key 7 input")},
+   {"Kt", 203		UNTIC_COMMENT("special mapped key 8 input")},
+   {"Ku", 205		UNTIC_COMMENT("special mapped key 9 input")},
+   {"Kv", 188		UNTIC_COMMENT("special mapped key 1 input")},
+   {"Kw", 190		UNTIC_COMMENT("special mapped key 2 input")},
+   {"Kx", 192		UNTIC_COMMENT("special mapped key 3 input")},
+   {"Ky", 194		UNTIC_COMMENT("special mapped key 4 input")},
+   {"Kz", 196		UNTIC_COMMENT("special mapped key 5 input")},
+   {"LE", 111		UNTIC_COMMENT("move #1 characters to the left (P)")},
+   {"LF", 385		UNTIC_COMMENT("turn off soft labels")},
+   {"LO", 386		UNTIC_COMMENT("turn on soft labels")},
+   {"Lf", 384		UNTIC_COMMENT("label format")},
+   {"MC", 255		UNTIC_COMMENT("clear right and left soft margins")},
+   {"ML", 424		UNTIC_COMMENT("set left soft margin at current column.	 See smgl. (ML is not in BSD termcap).")},
+   {"ML", 426		UNTIC_COMMENT("Set both left and right margins to #1, #2.  (ML is not in BSD termcap).")},
+   {"MR", 428		UNTIC_COMMENT("set right soft margin at current column")},
+   {"MT", 430		UNTIC_COMMENT("Sets both top and bottom margins to #1, #2")},
+   {"Mi", 393		UNTIC_COMMENT("Mouse status information")},
+   {"PA", 295		UNTIC_COMMENT("pause for 2-3 seconds")},
+   {"PU", 404		UNTIC_COMMENT("select pulse dialing")},
+   {"QD", 405		UNTIC_COMMENT("dial number #1 without checking")},
+   {"RA", 283		UNTIC_COMMENT("turn off automatic margins")},
+   {"RC", 408		UNTIC_COMMENT("remove clock")},
+   {"RF", 406		UNTIC_COMMENT("send next input char (for ptys)")},
+   {"RI", 112		UNTIC_COMMENT("move #1 characters to the right (P*)")},
+   {"RQ", 407		UNTIC_COMMENT("Request mouse position")},
+   {"RX", 294		UNTIC_COMMENT("turn off xon/xoff handshaking")},
+   {"S1", 207		UNTIC_COMMENT("special function key 1")},
+   {"S1", 265		UNTIC_COMMENT("Display PC character #1")},
+   {"S2", 208		UNTIC_COMMENT("special function key 2")},
+   {"S2", 276		UNTIC_COMMENT("Enter PC character display mode")},
+   {"S3", 209		UNTIC_COMMENT("special function key 3")},
+   {"S3", 288		UNTIC_COMMENT("Exit PC character display mode")},
+   {"S4", 210		UNTIC_COMMENT("special function key 4")},
+   {"S4", 277		UNTIC_COMMENT("Enter PC scancode mode")},
+   {"S5", 211		UNTIC_COMMENT("special function key 5")},
+   {"S5", 289		UNTIC_COMMENT("Exit PC scancode mode")},
+   {"S6", 212		UNTIC_COMMENT("special function key 6")},
+   {"S6", 401		UNTIC_COMMENT("PC terminal options")},
+   {"S7", 213		UNTIC_COMMENT("special function key 7")},
+   {"S7", 409		UNTIC_COMMENT("Escape for scancode emulation")},
+   {"S8", 214		UNTIC_COMMENT("special function key 8")},
+   {"S8", 245		UNTIC_COMMENT("Alternate escape for scancode emulation")},
+   {"S9", 215		UNTIC_COMMENT("special function key 9")},
+   {"SA", 216		UNTIC_COMMENT("special function key 10")},
+   {"SA", 268		UNTIC_COMMENT("turn on automatic margins")},
+   {"SC", 420		UNTIC_COMMENT("set clock, #1 hrs #2 mins #3 secs")},
+   {"SF", 109		UNTIC_COMMENT("scroll forward #1 lines (P)")},
+   {"SR", 113		UNTIC_COMMENT("scroll back #1 lines (P)")},
+   {"SX", 282		UNTIC_COMMENT("turn on xon/xoff handshaking")},
+   {"Sb", 417		UNTIC_COMMENT("Set background color #1")},
+   {"Sf", 423		UNTIC_COMMENT("Set foreground color #1")},
+   {"TO", 440		UNTIC_COMMENT("select touch tone dialing")},
+   {"UP", 114		UNTIC_COMMENT("up #1 lines (P*)")},
+   {"WA", 451		UNTIC_COMMENT("wait for dial-tone")},
+   {"WG", 298		UNTIC_COMMENT("go to window #1")},
+   {"XF", 452		UNTIC_COMMENT("XOFF character")},
+   {"XN", 453		UNTIC_COMMENT("XON character")},
+   {"Xh", 456		UNTIC_COMMENT("Enter horizontal highlight mode")},
+   {"Xl", 457		UNTIC_COMMENT("Enter left highlight mode")},
+   {"Xo", 458		UNTIC_COMMENT("Enter low highlight mode")},
+   {"Xr", 459		UNTIC_COMMENT("Enter right highlight mode")},
+   {"Xt", 460		UNTIC_COMMENT("Enter top highlight mode")},
+   {"Xv", 461		UNTIC_COMMENT("Enter vertical highlight mode")},
+   {"Xy", 246		UNTIC_COMMENT("Repeat bit image cell #1 #2 times")},
+   {"YZ", 427		UNTIC_COMMENT("Set page length to #1 lines")},
+   {"Yv", 248		UNTIC_COMMENT("Move to beginning of same row")},
+   {"Yw", 258		UNTIC_COMMENT("Give name for color #1")},
+   {"Yx", 260		UNTIC_COMMENT("Define rectangualar bit image region")},
+   {"Yy", 267		UNTIC_COMMENT("End a bit-image region")},
+   {"Yz", 421		UNTIC_COMMENT("Change to ribbon color #1")},
+   {"ZA", 249		UNTIC_COMMENT("Change number of characters per inch to #1")},
+   {"ZB", 250		UNTIC_COMMENT("Change number of lines per inch to #1")},
+   {"ZC", 251		UNTIC_COMMENT("Change horizontal resolution to #1")},
+   {"ZD", 252		UNTIC_COMMENT("Change vertical resolution to #1")},
+   {"ZE", 261		UNTIC_COMMENT("Define a character #1, #2 dots wide, descender #3")},
+   {"ZF", 269		UNTIC_COMMENT("Enter double-wide mode")},
+   {"ZG", 270		UNTIC_COMMENT("Enter draft-quality mode")},
+   {"ZH", 271		UNTIC_COMMENT("Enter italic mode")},
+   {"ZI", 272		UNTIC_COMMENT("Start leftward carriage motion")},
+   {"ZJ", 273		UNTIC_COMMENT("Start micro-motion mode")},
+   {"ZK", 274		UNTIC_COMMENT("Enter NLQ mode")},
+   {"ZL", 275		UNTIC_COMMENT("Enter normal-quality mode")},
+   {"ZM", 278		UNTIC_COMMENT("Enter shadow-print mode")},
+   {"ZN", 279		UNTIC_COMMENT("Enter subscript mode")},
+   {"ZO", 280		UNTIC_COMMENT("Enter superscript mode")},
+   {"ZP", 281		UNTIC_COMMENT("Start upward carriage motion")},
+   {"ZQ", 284		UNTIC_COMMENT("End double-wide mode")},
+   {"ZR", 285		UNTIC_COMMENT("End italic mode")},
+   {"ZS", 286		UNTIC_COMMENT("End left-motion mode")},
+   {"ZT", 287		UNTIC_COMMENT("End micro-motion mode")},
+   {"ZU", 290		UNTIC_COMMENT("End shadow-print mode")},
+   {"ZV", 291		UNTIC_COMMENT("End subscript mode")},
+   {"ZW", 292		UNTIC_COMMENT("End superscript mode")},
+   {"ZX", 293		UNTIC_COMMENT("End reverse character motion")},
+   {"ZY", 387		UNTIC_COMMENT("Like column_address in micro mode")},
+   {"ZZ", 388		UNTIC_COMMENT("Like cursor_down in micro mode")},
+   {"Za", 389		UNTIC_COMMENT("Like cursor_left in micro mode")},
+   {"Zb", 390		UNTIC_COMMENT("Like cursor_right in micro mode")},
+   {"Zc", 391		UNTIC_COMMENT("Like row_address #1 in micro mode")},
+   {"Zd", 392		UNTIC_COMMENT("Like cursor_up in micro mode")},
+   {"Ze", 394		UNTIC_COMMENT("Match software bits to print-head pins")},
+   {"Zf", 397		UNTIC_COMMENT("Like parm_down_cursor in micro mode")},
+   {"Zg", 398		UNTIC_COMMENT("Like parm_left_cursor in micro mode")},
+   {"Zh", 399		UNTIC_COMMENT("Like parm_right_cursor in micro mode")},
+   {"Zi", 400		UNTIC_COMMENT("Like parm_up_cursor in micro mode")},
+   {"Zj", 410		UNTIC_COMMENT("Select character set, #1")},
+   {"Zk", 418		UNTIC_COMMENT("Set bottom margin at current line")},
+   {"Zl", 419		UNTIC_COMMENT("Set bottom margin at line #1 or (if smgtp is not given) #2 lines from bottom")},
+   {"Zm", 425		UNTIC_COMMENT("Set left (right) margin at column #1")},
+   {"Zn", 429		UNTIC_COMMENT("Set right margin at column #1")},
+   {"Zo", 431		UNTIC_COMMENT("Set top margin at current line")},
+   {"Zp", 432		UNTIC_COMMENT("Set top (bottom) margin at row #1")},
+   {"Zq", 433		UNTIC_COMMENT("Start printing bit image graphics")},
+   {"Zr", 434		UNTIC_COMMENT("Start character set definition #1, with #2 characters in the set")},
+   {"Zs", 435		UNTIC_COMMENT("Stop printing bit image graphics")},
+   {"Zt", 436		UNTIC_COMMENT("End definition of character set #1")},
+   {"Zu", 437		UNTIC_COMMENT("List of subscriptable characters")},
+   {"Zv", 438		UNTIC_COMMENT("List of superscriptable characters")},
+   {"Zw", 439		UNTIC_COMMENT("Printing any of these characters causes CR")},
+   {"Zx", 454		UNTIC_COMMENT("No motion for subsequent character")},
+   {"Zy", 254		UNTIC_COMMENT("Produce #1'th item from list of character set names")},
+   {"Zz", 247		UNTIC_COMMENT("Move to next row of the bit image")},
+   {"ac", 244		UNTIC_COMMENT("graphics charset pairs, based on vt100")},
+   {"ae",  38		UNTIC_COMMENT("end alternate character set (P)")},
+   {"al",  53		UNTIC_COMMENT("insert line (P*)")},
+   {"as",  25		UNTIC_COMMENT("start alternate character set (P)")},
+   {"bc", 466		UNTIC_COMMENT("move left, if not ^H")},
+   {"bl",   1		UNTIC_COMMENT("audible signal (bell) (P)")},
+   {"bt",   0		UNTIC_COMMENT("back tab (P)")},
+   {"bx", 145		UNTIC_COMMENT("box characters primary set")},
+   {"by", 146		UNTIC_COMMENT("box characters secondary set")},
+   {"c0", 157		UNTIC_COMMENT("foreground color 0")},
+   {"c1", 158		UNTIC_COMMENT("foreground color 1")},
+   {"c2", 159		UNTIC_COMMENT("foreground color 2")},
+   {"c3", 160		UNTIC_COMMENT("foreground color 3")},
+   {"c4", 161		UNTIC_COMMENT("foreground color 4")},
+   {"c5", 162		UNTIC_COMMENT("foreground color 5")},
+   {"c6", 163		UNTIC_COMMENT("foreground color 6")},
+   {"c7", 164		UNTIC_COMMENT("foreground color 7")},
+   {"cb", 256		UNTIC_COMMENT("Clear to beginning of line")},
+   {"cd",   7		UNTIC_COMMENT("clear to end of screen (P*)")},
+   {"ce",   6		UNTIC_COMMENT("clear to end of line (P)")},
+   {"ch",   8		UNTIC_COMMENT("horizontal position #1, absolute (P)")},
+   {"ci", 257		UNTIC_COMMENT("Init sequence for multiple codesets")},
+   {"cl",   5		UNTIC_COMMENT("clear screen and home cursor (P*)")},
+   {"cm",  10		UNTIC_COMMENT("move to row #1 columns #2")},
+   {"cr",   2		UNTIC_COMMENT("carriage return (P*) (P*)")},
+   {"cs",   3		UNTIC_COMMENT("change region to line #1 to line #2 (P)")},
+   {"ct",   4		UNTIC_COMMENT("clear all tab stops (P)")},
+   {"cv", 127		UNTIC_COMMENT("vertical position #1 absolute (P)")},
+   {"d0", 149		UNTIC_COMMENT("background color 0")},
+   {"d1", 150		UNTIC_COMMENT("background color 1")},
+   {"d2", 151		UNTIC_COMMENT("background color 2")},
+   {"d3", 152		UNTIC_COMMENT("background color 3")},
+   {"d4", 153		UNTIC_COMMENT("background color 4")},
+   {"d5", 154		UNTIC_COMMENT("background color 5")},
+   {"d6", 155		UNTIC_COMMENT("background color 6")},
+   {"d7", 156		UNTIC_COMMENT("background color 7")},
+   {"dc",  21		UNTIC_COMMENT("delete character (P*)")},
+   {"dl",  22		UNTIC_COMMENT("delete line (P*)")},
+   {"dm",  29		UNTIC_COMMENT("enter delete mode")},
+   {"do",  11		UNTIC_COMMENT("down one line")},
+   {"ds",  23		UNTIC_COMMENT("disable status line")},
+   {"dv", 262		UNTIC_COMMENT("Indicate language/codeset support")},
+   {"eA", 266		UNTIC_COMMENT("enable alternate char set")},
+   {"ec",  37		UNTIC_COMMENT("erase #1 characters (P)")},
+   {"ed",  41		UNTIC_COMMENT("end delete mode")},
+   {"ei",  42		UNTIC_COMMENT("exit insert mode")},
+   {"f0", 165		UNTIC_COMMENT("select font 0")},
+   {"f1", 166		UNTIC_COMMENT("select font 1")},
+   {"f2", 167		UNTIC_COMMENT("select font 2")},
+   {"f3", 168		UNTIC_COMMENT("select font 3")},
+   {"f4", 169		UNTIC_COMMENT("select font 4")},
+   {"f5", 170		UNTIC_COMMENT("select font 5")},
+   {"f6", 171		UNTIC_COMMENT("select font 6")},
+   {"f7", 172		UNTIC_COMMENT("select font 7")},
+   {"ff",  46		UNTIC_COMMENT("hardcopy terminal page eject (P*)")},
+   {"fh", 296		UNTIC_COMMENT("flash switch hook")},
+   {"fs",  47		UNTIC_COMMENT("return from status line")},
+   {"hd",  24		UNTIC_COMMENT("half a line down")},
+   {"ho",  12		UNTIC_COMMENT("home cursor (if no cup)")},
+   {"hu", 137		UNTIC_COMMENT("half a line up")},
+   {"i1",  48		UNTIC_COMMENT("initialization string")},
+   {"i2", 463		UNTIC_COMMENT("secondary initialization string")},
+   {"i3",  50		UNTIC_COMMENT("initialization string")},
+   {"iP", 138		UNTIC_COMMENT("path name of program for initialization")},
+   {"ic",  52		UNTIC_COMMENT("insert character (P)")},
+   {"if",  51		UNTIC_COMMENT("name of initialization file")},
+   {"im",  31		UNTIC_COMMENT("enter insert mode")},
+   {"ip",  54		UNTIC_COMMENT("insert padding after inserted character")},
+   {"is",  49		UNTIC_COMMENT("initialization string")},
+   {"k0",  65		UNTIC_COMMENT("F0 function key")},
+   {"k0", 173		UNTIC_COMMENT("backtab key")},
+   {"k1",  66		UNTIC_COMMENT("F1 function key")},
+   {"k2",  68		UNTIC_COMMENT("F2 function key")},
+   {"k3",  69		UNTIC_COMMENT("F3 function key")},
+   {"k4",  70		UNTIC_COMMENT("F4 function key")},
+   {"k5",  71		UNTIC_COMMENT("F5 function key")},
+   {"k6",  72		UNTIC_COMMENT("F6 function key")},
+   {"k7",  73		UNTIC_COMMENT("F7 function key")},
+   {"k8",  74		UNTIC_COMMENT("F8 function key")},
+   {"k9",  75		UNTIC_COMMENT("F9 function key")},
+   {"k;",  67		UNTIC_COMMENT("F10 function key")},
+   {"kA",  78		UNTIC_COMMENT("insert-line key")},
+   {"kB", 303		UNTIC_COMMENT("back-tab key")},
+   {"kC",  57		UNTIC_COMMENT("clear-screen or erase key")},
+   {"kD",  59		UNTIC_COMMENT("delete-character key")},
+   {"kE",  63		UNTIC_COMMENT("clear-to-end-of-line key")},
+   {"kF",  84		UNTIC_COMMENT("scroll-forward key")},
+   {"kH",  80		UNTIC_COMMENT("lower-left key (home down)")},
+   {"kI",  77		UNTIC_COMMENT("insert-character key")},
+   {"kJ", 243		UNTIC_COMMENT("sent by action key")},
+   {"kL",  60		UNTIC_COMMENT("delete-line key")},
+   {"kM",  62		UNTIC_COMMENT("sent by rmir or smir in insert mode")},
+   {"kN",  81		UNTIC_COMMENT("next-page key")},
+   {"kP",  82		UNTIC_COMMENT("previous-page key")},
+   {"kQ", 183		UNTIC_COMMENT("quit key")},
+   {"kR",  85		UNTIC_COMMENT("scroll-backward key")},
+   {"kS",  64		UNTIC_COMMENT("clear-to-end-of-screen key")},
+   {"kT",  86		UNTIC_COMMENT("set-tab key")},
+   {"kV", 182		UNTIC_COMMENT("previous-pane key")},
+   {"kW", 176		UNTIC_COMMENT("command-pane key")},
+   {"kZ", 186		UNTIC_COMMENT("scroll right")},
+   {"ka",  56		UNTIC_COMMENT("clear-all-tabs key")},
+   {"kb",  55		UNTIC_COMMENT("backspace key")},
+   {"kc", 175		UNTIC_COMMENT("command key")},
+   {"kd",  61		UNTIC_COMMENT("down-arrow key")},
+   {"ke",  88		UNTIC_COMMENT("leave 'keyboard_transmit' mode")},
+   {"kh",  76		UNTIC_COMMENT("home key")},
+   {"ki", 174		UNTIC_COMMENT("do request key")},
+   {"kl",  79		UNTIC_COMMENT("left-arrow key")},
+   {"ko", 187		UNTIC_COMMENT("tab key")},
+   {"ko", 467		UNTIC_COMMENT("list of self-mapped keycaps")},
+   {"kp", 181		UNTIC_COMMENT("previous-command key")},
+   {"kr",  83		UNTIC_COMMENT("right-arrow key")},
+   {"ks",  89		UNTIC_COMMENT("enter 'keyboard_transmit' mode")},
+   {"kt",  58		UNTIC_COMMENT("clear-tab key")},
+   {"ku",  87		UNTIC_COMMENT("up-arrow key")},
+   {"kv", 180		UNTIC_COMMENT("next-pane key")},
+   {"kz", 185		UNTIC_COMMENT("scroll left")},
+   {"l0",  90		UNTIC_COMMENT("label on function key f0 if not f0")},
+   {"l1",  91		UNTIC_COMMENT("label on function key f1 if not f1")},
+   {"l2",  93		UNTIC_COMMENT("label on function key f2 if not f2")},
+   {"l3",  94		UNTIC_COMMENT("label on function key f3 if not f3")},
+   {"l4",  95		UNTIC_COMMENT("label on function key f4 if not f4")},
+   {"l5",  96		UNTIC_COMMENT("label on function key f5 if not f5")},
+   {"l6",  97		UNTIC_COMMENT("label on function key f6 if not f6")},
+   {"l7",  98		UNTIC_COMMENT("label on function key f7 if not f7")},
+   {"l8",  99		UNTIC_COMMENT("label on function key f8 if not f8")},
+   {"l9", 100		UNTIC_COMMENT("label on function key f9 if not f9")},
+   {"la",  92		UNTIC_COMMENT("label on function key f10 if not f10")},
+   {"le",  14		UNTIC_COMMENT("move left one space")},
+   {"ll",  18		UNTIC_COMMENT("last line, first column (if no cup)")},
+   {"ma", 468		UNTIC_COMMENT("map arrow keys rogue(1) motion keys")},
+   {"mb",  26		UNTIC_COMMENT("turn on blinking")},
+   {"md",  27		UNTIC_COMMENT("turn on bold (extra bright) mode")},
+   {"me",  39		UNTIC_COMMENT("turn off all attributes")},
+   {"mh",  30		UNTIC_COMMENT("turn on half-bright mode")},
+   {"mk",  32		UNTIC_COMMENT("turn on blank mode (characters invisible)")},
+   {"ml", 480		UNTIC_COMMENT("lock memory above cursor")},
+   {"mm", 102		UNTIC_COMMENT("turn on meta mode (8th-bit on)")},
+   {"mo", 101		UNTIC_COMMENT("turn off meta mode")},
+   {"mp",  33		UNTIC_COMMENT("turn on protected mode")},
+   {"mr",  34		UNTIC_COMMENT("turn on reverse video mode")},
+   {"mu", 481		UNTIC_COMMENT("unlock memory")},
+   {"nd",  17		UNTIC_COMMENT("non-destructive space (move right one space)")},
+   {"nl", 179		UNTIC_COMMENT("newline key")},
+   {"nl", 465		UNTIC_COMMENT("use to move down")},
+   {"nw", 103		UNTIC_COMMENT("newline (behave like cr followed by lf)")},
+   {"oc", 395		UNTIC_COMMENT("Set all color pairs to the original ones")},
+   {"op", 396		UNTIC_COMMENT("Set default pair to its original value")},
+   {"pO", 144		UNTIC_COMMENT("turn on printer for #1 bytes")},
+   {"pc", 104		UNTIC_COMMENT("padding char (instead of null)")},
+   {"pf", 119		UNTIC_COMMENT("turn off printer")},
+   {"pk", 115		UNTIC_COMMENT("program function key #1 to type string #2")},
+   {"pl", 116		UNTIC_COMMENT("program function key #1 to execute string #2")},
+   {"pn", 403		UNTIC_COMMENT("program label #1 to show string #2")},
+   {"po", 120		UNTIC_COMMENT("turn on printer")},
+   {"ps", 118		UNTIC_COMMENT("print contents of screen")},
+   {"px", 117		UNTIC_COMMENT("program function key #1 to transmit string #2")},
+   {"r1", 122		UNTIC_COMMENT("reset string")},
+   {"r2", 123		UNTIC_COMMENT("reset string")},
+   {"r3", 124		UNTIC_COMMENT("reset string")},
+   {"rP", 253		UNTIC_COMMENT("like ip but when in insert mode")},
+   {"rc", 126		UNTIC_COMMENT("restore cursor to position of last save_cursor")},
+   {"rf", 125		UNTIC_COMMENT("name of reset file")},
+   {"rp", 121		UNTIC_COMMENT("repeat char #1 #2 times (P*)")},
+   {"rs", 464		UNTIC_COMMENT("terminal reset string")},
+   {"s0", 411		UNTIC_COMMENT("Shift to codeset 0 (EUC set 0, ASCII)")},
+   {"s1", 412		UNTIC_COMMENT("Shift to codeset 1")},
+   {"s2", 413		UNTIC_COMMENT("Shift to codeset 2")},
+   {"s3", 414		UNTIC_COMMENT("Shift to codeset 3")},
+   {"sA", 462		UNTIC_COMMENT("Define second set of video attributes #1-#6")},
+   {"sL", 455		UNTIC_COMMENT("YI Set page length to #1 hundredth of an inch")},
+   {"sa", 131		UNTIC_COMMENT("define video attributes #1-#9 (PG9)")},
+   {"sc", 128		UNTIC_COMMENT("save current cursor position (P)")},
+   {"se",  43		UNTIC_COMMENT("exit standout mode")},
+   {"sf", 129		UNTIC_COMMENT("scroll text up (P)")},
+   {"so",  35		UNTIC_COMMENT("begin standout mode")},
+   {"sp", 422		UNTIC_COMMENT("Set current color pair to #1")},
+   {"sr", 130		UNTIC_COMMENT("scroll text down (P)")},
+   {"st", 132		UNTIC_COMMENT("set a tab in every row, current columns")},
+   {"ta", 134		UNTIC_COMMENT("tab to next 8-space hardware tab stop")},
+   {"te",  40		UNTIC_COMMENT("strings to end programs using cup")},
+   {"ti",  28		UNTIC_COMMENT("string to start programs using cup")},
+   {"ts", 135		UNTIC_COMMENT("move to status line, column #1")},
+   {"u0", 441		UNTIC_COMMENT("User string #0")},
+   {"u1", 442		UNTIC_COMMENT("User string #1")},
+   {"u2", 443		UNTIC_COMMENT("User string #2")},
+   {"u3", 444		UNTIC_COMMENT("User string #3")},
+   {"u4", 445		UNTIC_COMMENT("User string #4")},
+   {"u5", 446		UNTIC_COMMENT("User string #5")},
+   {"u6", 447		UNTIC_COMMENT("User string #6")},
+   {"u7", 448		UNTIC_COMMENT("User string #7")},
+   {"u8", 449		UNTIC_COMMENT("User string #8")},
+   {"u9", 450		UNTIC_COMMENT("User string #9")},
+   {"uc", 136		UNTIC_COMMENT("underline char and move past it")},
+   {"ue",  44		UNTIC_COMMENT("exit underline mode")},
+   {"up",  19		UNTIC_COMMENT("up one line")},
+   {"us",  36		UNTIC_COMMENT("begin underline mode")},
+   {"vb",  45		UNTIC_COMMENT("visible bell (may not move cursor)")},
+   {"ve",  16		UNTIC_COMMENT("make cursor appear normal (undo civis/cvvis)")},
+   {"vi",  13		UNTIC_COMMENT("make cursor invisible")},
+   {"vs",  20		UNTIC_COMMENT("make cursor very visible")},
+   {"wi", 133		UNTIC_COMMENT("current window is lines #1-#2 cols #3-#4")},
+   {"xl", 402		UNTIC_COMMENT("Program function key #1 to type string #2 and show string #3")},
+   {"za", 198		UNTIC_COMMENT("application-defined string")},
+   {"",  -1		UNTIC_COMMENT("NULL")},
+};
+
+static Tgetstr_Map_Type Tgetnum_Map =
+{
+   {"BT",  11		UNTIC_COMMENT("number of buttons on mouse")},
+   {"Co",  17		UNTIC_COMMENT("maximum number of colors on screen")},
+   {"MW",  21		UNTIC_COMMENT("maximum number of defineable windows")},
+   {"NC",  24		UNTIC_COMMENT("video attributes that can not be used with colors")},
+   {"Nl",  26		UNTIC_COMMENT("number of labels on screen")},
+   {"Ya",  10		UNTIC_COMMENT("numbers of bytes buffered before printing")},
+   {"Yb",  12		UNTIC_COMMENT("spacing of pins vertically in pins per inch")},
+   {"Yc",  13		UNTIC_COMMENT("spacing of dots horizontally in dots per inch")},
+   {"Yd",  18		UNTIC_COMMENT("maximum value in micro_..._address")},
+   {"Ye",  19		UNTIC_COMMENT("maximum value in parm_..._micro")},
+   {"Yf",  22		UNTIC_COMMENT("character step size when in micro mode")},
+   {"Yg",  23		UNTIC_COMMENT("line step size when in micro mode")},
+   {"Yh",  25		UNTIC_COMMENT("numbers of pins in print-head")},
+   {"Yi",  27		UNTIC_COMMENT("horizontal resolution in units per line")},
+   {"Yj",  28		UNTIC_COMMENT("vertical resolution in units per line")},
+   {"Yk",  29		UNTIC_COMMENT("horizontal resolution in units per inch")},
+   {"Yl",  30		UNTIC_COMMENT("vertical resolution in units per inch")},
+   {"Ym",  31		UNTIC_COMMENT("print rate in characters per second")},
+   {"Yn",  32		UNTIC_COMMENT("character step size when in double wide mode")},
+   {"Yo",   8		UNTIC_COMMENT("number of passes for each bit-image row")},
+   {"Yp",   9		UNTIC_COMMENT("type of bit-image device")},
+   {"co",   0		UNTIC_COMMENT("number of columns in a line")},
+   {"dB",  36		UNTIC_COMMENT("padding required for ^H")},
+   {"dC",  34		UNTIC_COMMENT("pad needed for CR")},
+   {"dN",  35		UNTIC_COMMENT("pad needed for LF")},
+   {"dT",  37		UNTIC_COMMENT("padding required for ^I")},
+   {"it",   1		UNTIC_COMMENT("tabs initially every # spaces")},
+   {"kn",  38		UNTIC_COMMENT("count of function keys")},
+   {"lh",  14		UNTIC_COMMENT("rows in each label")},
+   {"li",   2		UNTIC_COMMENT("number of lines on screen or page")},
+   {"lm",   3		UNTIC_COMMENT("lines of memory if > line. 0 means varies")},
+   {"lw",  15		UNTIC_COMMENT("columns in each label")},
+   {"ma",  16		UNTIC_COMMENT("maximum combined attributes terminal can handle")},
+   {"pa",  20		UNTIC_COMMENT("maximum number of color-pairs on the screen")},
+   {"pb",   5		UNTIC_COMMENT("lowest baud rate where padding needed")},
+   {"sg",   4		UNTIC_COMMENT("number of blank characters left by smso or rmso")},
+   {"ug",  33		UNTIC_COMMENT("number of blanks left by ul")},
+   {"vt",   6		UNTIC_COMMENT("virtual terminal number (CB/unix)")},
+   {"ws",   7		UNTIC_COMMENT("number of columns in status line")},
+   {"",  -1		UNTIC_COMMENT("NULL")},
+};
+
+static Tgetstr_Map_Type Tgetflag_Map =
+{
+   {"5i",  34		UNTIC_COMMENT("printer will not echo on screen")},
+   {"HC",  26		UNTIC_COMMENT("cursor is hard to see")},
+   {"MT",  40		UNTIC_COMMENT("has meta key")},
+   {"ND",  31		UNTIC_COMMENT("scrolling region is non-destructive")},
+   {"NL",  41		UNTIC_COMMENT("move down with \n")},
+   {"NP",  33		UNTIC_COMMENT("pad character does not exist")},
+   {"NR",  32		UNTIC_COMMENT("smcup does not reverse rmcup")},
+   {"YA",  23		UNTIC_COMMENT("only positive motion for hpa/mhpa caps")},
+   {"YB",  25		UNTIC_COMMENT("using cr turns off micro mode")},
+   {"YC",  27		UNTIC_COMMENT("printer needs operator to change character set")},
+   {"YD",  35		UNTIC_COMMENT("only positive motion for vpa/mvpa caps")},
+   {"YE",  36		UNTIC_COMMENT("printing in last column causes cr")},
+   {"YF",  24		UNTIC_COMMENT("changing character pitch changes resolution")},
+   {"YG",  29		UNTIC_COMMENT("changing line pitch changes resolution")},
+   {"am",   1		UNTIC_COMMENT("terminal has automatic margins")},
+   {"bs",  37		UNTIC_COMMENT("uses ^H to move left")},
+   {"bw",   0		UNTIC_COMMENT("cub1 wraps from column 0 to last column")},
+   {"cc",  22		UNTIC_COMMENT("terminal can re-define existing colors")},
+   {"da",  11		UNTIC_COMMENT("display may be retained above the screen")},
+   {"db",  12		UNTIC_COMMENT("display may be retained below the screen")},
+   {"eo",   5		UNTIC_COMMENT("can erase overstrikes with a blank")},
+   {"es",  16		UNTIC_COMMENT("escape can be used on the status line")},
+   {"gn",   6		UNTIC_COMMENT("generic line type")},
+   {"hc",   7		UNTIC_COMMENT("hardcopy terminal")},
+   {"hl",  28		UNTIC_COMMENT("terminal uses only HLS color notation (Tektronix)")},
+   {"hs",   9		UNTIC_COMMENT("has extra status line")},
+   {"hz",  18		UNTIC_COMMENT("cannot print ~'s (hazeltine)")},
+   {"in",  10		UNTIC_COMMENT("insert mode distinguishes nulls")},
+   {"km",   8		UNTIC_COMMENT("Has a meta key (i.e., sets 8th-bit)")},
+   {"mi",  13		UNTIC_COMMENT("safe to move while in insert mode")},
+   {"ms",  14		UNTIC_COMMENT("safe to move while in standout mode")},
+   {"nc",  39		UNTIC_COMMENT("no way to go to start of line")},
+   {"ns",  38		UNTIC_COMMENT("crt cannot scroll")},
+   {"nx",  30		UNTIC_COMMENT("padding will not work, xon/xoff required")},
+   {"os",  15		UNTIC_COMMENT("terminal can overstrike")},
+   {"pt",  42		UNTIC_COMMENT("has 8-char tabs invoked with ^I")},
+   {"ul",  19		UNTIC_COMMENT("underline character overstrikes")},
+   {"ut",  21		UNTIC_COMMENT("screen erased with background color")},
+   {"xb",   2		UNTIC_COMMENT("beehive (f1=escape, f2=ctrl C)")},
+   {"xn",   4		UNTIC_COMMENT("newline ignored after 80 cols (concept)")},
+   {"xo",  20		UNTIC_COMMENT("terminal uses xon/xoff handshaking")},
+   {"xr",  43		UNTIC_COMMENT("return clears the line")},
+   {"xs",   3		UNTIC_COMMENT("standout not erased by overwriting (hp)")},
+   {"xt",  17		UNTIC_COMMENT("tabs destructive, magic so char (t1061)")},
+   {"",  -1		UNTIC_COMMENT("NULL")},
+};
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/terminfo/parsecaps.sl Added

@@ -0,0 +1,80 @@
+% This file parses an ncurses Caps file, which determines the terminfo
+% binary layout.
+
+% Caps file format:
+% Column 1: terminfo variable name
+% Column 2: terminfo capability name
+% Column 3: capability type (boolean, numeric, or string)
+% Column 4: termcap capability name
+% Column 5: KEY_xxx name, if any, `-' otherwise
+% Column 6: value for KEY_xxx name, if any, `-' otherwise
+% Column 7: Lead with `Y' if capability should be emitted in termcap
+%           translations, `-' otherwise
+% Column 8: capability description
+% Note: Stop parsing the file when a line contains %%-STOP-HERE-%%
+
+private variable Stop_String = "%%-STOP-HERE-%%";
+
+define read_caps_file (file)
+{
+   variable fp = fopen (file, "r");
+   if (fp == NULL)
+     {
+	() = fprintf (stderr, "Unable to open %s\n", file);
+	exit (1);
+     }
+   variable lines = fgetslines (fp);
+   variable i = wherefirst (1 == array_map (Int_Type, &is_substr, lines, Stop_String));
+   if (i != NULL)
+     lines = lines:i;
+
+   variable s = struct
+     {
+	name, ti_cap, type, tc_cap, keyname, keyval, flags, desc
+     };
+
+   variable fmt = "%s %s %s %s %s %s %s %^\n";
+   () = readascii (lines, &s.name, &s.ti_cap, &s.type, &s.tc_cap,
+		   &s.keyname, &s.keyval, &s.flags, &s.desc;
+		   format=fmt, comment="#");
+
+   return s;
+}
+
+private define write_table (fp, s, type, tblname)
+{
+
+   variable i = where (s.type == type);
+   variable cap = s.tc_capi;
+   variable comment = s.desci;
+   variable ofs = 0:length(cap)-1;
+   i = array_sort (cap); cap = capi; comment = commenti; ofs = ofsi;
+
+   () = fprintf (fp, "static Tgetstr_Map_Type %s = \n{\n", tblname);
+   _for i (0, length (cap)-1, 1)
+     {
+	() = fprintf (fp, "   {\"%s\", %3d\t\tUNTIC_COMMENT(\"%s\")},\n",
+		     capi, ofsi, commenti);
+     }
+   () = fprintf (fp, "   {\"%s\", %3d\t\tUNTIC_COMMENT(\"%s\")},\n",
+		 "", -1, "NULL");
+   () = fprintf (fp, "};\n\n\n");
+}
+
+define slsh_main ()
+{
+   if (__argc != 2)
+     {
+	() = fprintf (stderr, "Usage: %s Caps-file > outfile\n", __argv0);
+	exit (1);
+     }
+   variable s = read_caps_file (__argv1);
+   variable fp = stdout;
+
+   () = fprintf (stdout, "/* This file was autogenerated using %s */\n\n",
+		 strjoin (__argv, " "));
+
+   write_table (fp, s, "str", "Tgetstr_Map");
+   write_table (fp, s, "num", "Tgetnum_Map");
+   write_table (fp, s, "bool", "Tgetflag_Map");
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/terminfo/uwin.inc Added

@@ -0,0 +1,389 @@
+/* This file was autogenerated using parsecaps.sl /tmp/Caps.uwin */
+
+static Tgetstr_Map_Type Tgetstr_Map =
+{
+   {"!1", 212		UNTIC_COMMENT("shifted save key")},
+   {"!2", 213		UNTIC_COMMENT("shifted suspend key")},
+   {"!3", 214		UNTIC_COMMENT("shifted undo key")},
+   {"#1", 198		UNTIC_COMMENT("shifted help key")},
+   {"#2", 199		UNTIC_COMMENT("shifted home key")},
+   {"#3", 200		UNTIC_COMMENT("shifted insert-character key")},
+   {"#4", 201		UNTIC_COMMENT("shifted left-arrow key")},
+   {"%0", 177		UNTIC_COMMENT("redo key")},
+   {"%1", 168		UNTIC_COMMENT("help key")},
+   {"%2", 169		UNTIC_COMMENT("mark key")},
+   {"%3", 170		UNTIC_COMMENT("message key")},
+   {"%4", 171		UNTIC_COMMENT("move key")},
+   {"%5", 172		UNTIC_COMMENT("next key")},
+   {"%6", 173		UNTIC_COMMENT("open key")},
+   {"%7", 174		UNTIC_COMMENT("options key")},
+   {"%8", 175		UNTIC_COMMENT("previous key")},
+   {"%9", 176		UNTIC_COMMENT("print key")},
+   {"%a", 202		UNTIC_COMMENT("shifted message key")},
+   {"%b", 203		UNTIC_COMMENT("shifted move key")},
+   {"%c", 204		UNTIC_COMMENT("shifted next key")},
+   {"%d", 205		UNTIC_COMMENT("shifted options key")},
+   {"%e", 206		UNTIC_COMMENT("shifted previous key")},
+   {"%f", 207		UNTIC_COMMENT("shifted print key")},
+   {"%g", 208		UNTIC_COMMENT("shifted redo key")},
+   {"%h", 209		UNTIC_COMMENT("shifted replace key")},
+   {"%i", 210		UNTIC_COMMENT("shifted right-arrow key")},
+   {"%j", 211		UNTIC_COMMENT("shifted resume key")},
+   {"&0", 187		UNTIC_COMMENT("shifted cancel key")},
+   {"&1", 178		UNTIC_COMMENT("reference key")},
+   {"&2", 179		UNTIC_COMMENT("refresh key")},
+   {"&3", 180		UNTIC_COMMENT("replace key")},
+   {"&4", 181		UNTIC_COMMENT("restart key")},
+   {"&5", 182		UNTIC_COMMENT("resume key")},
+   {"&6", 183		UNTIC_COMMENT("save key")},
+   {"&7", 184		UNTIC_COMMENT("suspend key")},
+   {"&8", 185		UNTIC_COMMENT("undo key")},
+   {"&9", 186		UNTIC_COMMENT("shifted begin key")},
+   {"*0", 197		UNTIC_COMMENT("shifted find key")},
+   {"*1", 188		UNTIC_COMMENT("shifted command key")},
+   {"*2", 189		UNTIC_COMMENT("shifted copy key")},
+   {"*3", 190		UNTIC_COMMENT("shifted create key")},
+   {"*4", 191		UNTIC_COMMENT("shifted delete-character key")},
+   {"*5", 192		UNTIC_COMMENT("shifted delete-line key")},
+   {"*6", 193		UNTIC_COMMENT("select key")},
+   {"*7", 194		UNTIC_COMMENT("shifted end key")},
+   {"*8", 195		UNTIC_COMMENT("shifted clear-to-end-of-line key")},
+   {"*9", 196		UNTIC_COMMENT("shifted exit key")},
+   {"@0", 167		UNTIC_COMMENT("find key")},
+   {"@1", 158		UNTIC_COMMENT("begin key")},
+   {"@2", 159		UNTIC_COMMENT("cancel key")},
+   {"@3", 160		UNTIC_COMMENT("close key")},
+   {"@4", 161		UNTIC_COMMENT("command key")},
+   {"@5", 162		UNTIC_COMMENT("copy key")},
+   {"@6", 163		UNTIC_COMMENT("create key")},
+   {"@7", 164		UNTIC_COMMENT("end key")},
+   {"@8", 165		UNTIC_COMMENT("enter/send key")},
+   {"@9", 166		UNTIC_COMMENT("exit key")},
+   {"AB", 289		UNTIC_COMMENT("Set background color to #1, using ANSI escape")},
+   {"AF", 290		UNTIC_COMMENT("Set foreground color to #1, using ANSI escape")},
+   {"AL", 110		UNTIC_COMMENT("insert #1 lines (P*)")},
+   {"CC",   9		UNTIC_COMMENT("terminal settable cmd character in prototype !?")},
+   {"CM",  15		UNTIC_COMMENT("memory relative cursor addressing, move to row #1 columns #2")},
+   {"DC", 105		UNTIC_COMMENT("delete #1 characters (P*)")},
+   {"DL", 106		UNTIC_COMMENT("delete #1 lines (P*)")},
+   {"DO", 107		UNTIC_COMMENT("down #1 lines (P*)")},
+   {"F1", 216		UNTIC_COMMENT("F11 function key")},
+   {"F2", 217		UNTIC_COMMENT("F12 function key")},
+   {"F3", 218		UNTIC_COMMENT("F13 function key")},
+   {"F4", 219		UNTIC_COMMENT("F14 function key")},
+   {"F5", 220		UNTIC_COMMENT("F15 function key")},
+   {"F6", 221		UNTIC_COMMENT("F16 function key")},
+   {"F7", 222		UNTIC_COMMENT("F17 function key")},
+   {"F8", 223		UNTIC_COMMENT("F18 function key")},
+   {"F9", 224		UNTIC_COMMENT("F19 function key")},
+   {"FA", 225		UNTIC_COMMENT("F20 function key")},
+   {"FB", 226		UNTIC_COMMENT("F21 function key")},
+   {"FC", 227		UNTIC_COMMENT("F22 function key")},
+   {"FD", 228		UNTIC_COMMENT("F23 function key")},
+   {"FE", 229		UNTIC_COMMENT("F24 function key")},
+   {"FF", 230		UNTIC_COMMENT("F25 function key")},
+   {"FG", 231		UNTIC_COMMENT("F26 function key")},
+   {"FH", 232		UNTIC_COMMENT("F27 function key")},
+   {"FI", 233		UNTIC_COMMENT("F28 function key")},
+   {"FJ", 234		UNTIC_COMMENT("F29 function key")},
+   {"FK", 235		UNTIC_COMMENT("F30 function key")},
+   {"FL", 236		UNTIC_COMMENT("F31 function key")},
+   {"FM", 237		UNTIC_COMMENT("F32 function key")},
+   {"FN", 238		UNTIC_COMMENT("F33 function key")},
+   {"FO", 239		UNTIC_COMMENT("F34 function key")},
+   {"FP", 240		UNTIC_COMMENT("F35 function key")},
+   {"FQ", 241		UNTIC_COMMENT("F36 function key")},
+   {"FR", 242		UNTIC_COMMENT("F37 function key")},
+   {"FS", 243		UNTIC_COMMENT("F38 function key")},
+   {"FT", 244		UNTIC_COMMENT("F39 function key")},
+   {"FU", 245		UNTIC_COMMENT("F40 function key")},
+   {"FV", 246		UNTIC_COMMENT("F41 function key")},
+   {"FW", 247		UNTIC_COMMENT("F42 function key")},
+   {"FX", 248		UNTIC_COMMENT("F43 function key")},
+   {"FY", 249		UNTIC_COMMENT("F44 function key")},
+   {"FZ", 250		UNTIC_COMMENT("F45 function key")},
+   {"Fa", 251		UNTIC_COMMENT("F46 function key")},
+   {"Fb", 252		UNTIC_COMMENT("F47 function key")},
+   {"Fc", 253		UNTIC_COMMENT("F48 function key")},
+   {"Fd", 254		UNTIC_COMMENT("F49 function key")},
+   {"Fe", 255		UNTIC_COMMENT("F50 function key")},
+   {"Ff", 256		UNTIC_COMMENT("F51 function key")},
+   {"Fg", 257		UNTIC_COMMENT("F52 function key")},
+   {"Fh", 258		UNTIC_COMMENT("F53 function key")},
+   {"Fi", 259		UNTIC_COMMENT("F54 function key")},
+   {"Fj", 260		UNTIC_COMMENT("F55 function key")},
+   {"Fk", 261		UNTIC_COMMENT("F56 function key")},
+   {"Fl", 262		UNTIC_COMMENT("F57 function key")},
+   {"Fm", 263		UNTIC_COMMENT("F58 function key")},
+   {"Fn", 264		UNTIC_COMMENT("F59 function key")},
+   {"Fo", 265		UNTIC_COMMENT("F60 function key")},
+   {"Fp", 266		UNTIC_COMMENT("F61 function key")},
+   {"Fq", 267		UNTIC_COMMENT("F62 function key")},
+   {"Fr", 268		UNTIC_COMMENT("F63 function key")},
+   {"G1", 302		UNTIC_COMMENT("single upper right")},
+   {"G2", 300		UNTIC_COMMENT("single upper left")},
+   {"G3", 301		UNTIC_COMMENT("single lower left")},
+   {"G4", 303		UNTIC_COMMENT("single lower right")},
+   {"GC", 310		UNTIC_COMMENT("single intersection")},
+   {"GD", 307		UNTIC_COMMENT("tee pointing down")},
+   {"GH", 308		UNTIC_COMMENT("single horizontal line")},
+   {"GL", 305		UNTIC_COMMENT("tee pointing left")},
+   {"GR", 304		UNTIC_COMMENT("tee pointing right")},
+   {"GU", 306		UNTIC_COMMENT("tee pointing up")},
+   {"GV", 309		UNTIC_COMMENT("single vertical line")},
+   {"Gm", 282		UNTIC_COMMENT("Curses should get button events, parameter #1 not documented.")},
+   {"IC", 108		UNTIC_COMMENT("insert #1 characters (P*)")},
+   {"Ic", 285		UNTIC_COMMENT("initialize color #1 to (#2,#3,#4)")},
+   {"Ip", 286		UNTIC_COMMENT("Initialize color pair #1 to fg=(#2,#3,#4), bg=(#5,#6,#7)")},
+   {"K1", 139		UNTIC_COMMENT("upper left of keypad")},
+   {"K2", 141		UNTIC_COMMENT("center of keypad")},
+   {"K3", 140		UNTIC_COMMENT("upper right of keypad")},
+   {"K4", 142		UNTIC_COMMENT("lower left of keypad")},
+   {"K5", 143		UNTIC_COMMENT("lower right of keypad")},
+   {"Km", 279		UNTIC_COMMENT("Mouse event has occurred")},
+   {"LE", 111		UNTIC_COMMENT("move #1 characters to the left (P)")},
+   {"LF", 157		UNTIC_COMMENT("turn off soft labels")},
+   {"LO", 156		UNTIC_COMMENT("turn on soft labels")},
+   {"MC", 270		UNTIC_COMMENT("clear right and left soft margins")},
+   {"ML", 271		UNTIC_COMMENT("set left soft margin at current column.	 See smgl. (ML is not in BSD termcap).")},
+   {"MR", 272		UNTIC_COMMENT("set right soft margin at current column")},
+   {"Mi", 280		UNTIC_COMMENT("Mouse status information")},
+   {"RA", 152		UNTIC_COMMENT("turn off automatic margins")},
+   {"RF", 215		UNTIC_COMMENT("send next input char (for ptys)")},
+   {"RI", 112		UNTIC_COMMENT("move #1 characters to the right (P*)")},
+   {"RQ", 281		UNTIC_COMMENT("Request mouse position")},
+   {"RX", 150		UNTIC_COMMENT("turn off xon/xoff handshaking")},
+   {"Rm", 283		UNTIC_COMMENT("Curses should release the mouse */")},
+   {"SA", 151		UNTIC_COMMENT("turn on automatic margins")},
+   {"SF", 109		UNTIC_COMMENT("scroll forward #1 lines (P)")},
+   {"SR", 113		UNTIC_COMMENT("scroll back #1 lines (P)")},
+   {"SX", 149		UNTIC_COMMENT("turn on xon/xoff handshaking")},
+   {"Sb", 291		UNTIC_COMMENT("Set background color #1")},
+   {"Sf", 293		UNTIC_COMMENT("Set foreground color #1")},
+   {"UP", 114		UNTIC_COMMENT("up #1 lines (P*)")},
+   {"XF", 154		UNTIC_COMMENT("XOFF character")},
+   {"XN", 153		UNTIC_COMMENT("XON character")},
+   {"Yw", 284		UNTIC_COMMENT("Give name for color #1")},
+   {"ac", 146		UNTIC_COMMENT("graphics charset pairs, based on vt100")},
+   {"ae",  38		UNTIC_COMMENT("end alternate character set (P)")},
+   {"al",  53		UNTIC_COMMENT("insert line (P*)")},
+   {"as",  25		UNTIC_COMMENT("start alternate character set (P)")},
+   {"bc", 297		UNTIC_COMMENT("move left, if not ^H")},
+   {"bl",   1		UNTIC_COMMENT("audible signal (bell) (P)")},
+   {"bt",   0		UNTIC_COMMENT("back tab (P)")},
+   {"bx", 313		UNTIC_COMMENT("box characters primary set")},
+   {"cb", 269		UNTIC_COMMENT("Clear to beginning of line")},
+   {"cd",   7		UNTIC_COMMENT("clear to end of screen (P*)")},
+   {"ce",   6		UNTIC_COMMENT("clear to end of line (P)")},
+   {"ch",   8		UNTIC_COMMENT("horizontal position #1, absolute (P)")},
+   {"ci", 274		UNTIC_COMMENT("Init sequence for multiple codesets")},
+   {"cl",   5		UNTIC_COMMENT("clear screen and home cursor (P*)")},
+   {"cm",  10		UNTIC_COMMENT("move to row #1 columns #2")},
+   {"cr",   2		UNTIC_COMMENT("carriage return (P*) (P*)")},
+   {"cs",   3		UNTIC_COMMENT("change region to line #1 to line #2 (P)")},
+   {"ct",   4		UNTIC_COMMENT("clear all tab stops (P)")},
+   {"cv", 127		UNTIC_COMMENT("vertical position #1 absolute (P)")},
+   {"dc",  21		UNTIC_COMMENT("delete character (P*)")},
+   {"dl",  22		UNTIC_COMMENT("delete line (P*)")},
+   {"dm",  29		UNTIC_COMMENT("enter delete mode")},
+   {"do",  11		UNTIC_COMMENT("down one line")},
+   {"ds",  23		UNTIC_COMMENT("disable status line")},
+   {"dv", 273		UNTIC_COMMENT("Indicate language/codeset support")},
+   {"eA", 155		UNTIC_COMMENT("enable alternate char set")},
+   {"ec",  37		UNTIC_COMMENT("erase #1 characters (P)")},
+   {"ed",  41		UNTIC_COMMENT("end delete mode")},
+   {"ei",  42		UNTIC_COMMENT("exit insert mode")},
+   {"ff",  46		UNTIC_COMMENT("hardcopy terminal page eject (P*)")},
+   {"fs",  47		UNTIC_COMMENT("return from status line")},
+   {"hd",  24		UNTIC_COMMENT("half a line down")},
+   {"ho",  12		UNTIC_COMMENT("home cursor (if no cup)")},
+   {"hu", 137		UNTIC_COMMENT("half a line up")},
+   {"i1",  48		UNTIC_COMMENT("initialization string")},
+   {"i2", 294		UNTIC_COMMENT("secondary initialization string")},
+   {"i3",  50		UNTIC_COMMENT("initialization string")},
+   {"iP", 138		UNTIC_COMMENT("path name of program for initialization")},
+   {"ic",  52		UNTIC_COMMENT("insert character (P)")},
+   {"if",  51		UNTIC_COMMENT("name of initialization file")},
+   {"im",  31		UNTIC_COMMENT("enter insert mode")},
+   {"ip",  54		UNTIC_COMMENT("insert padding after inserted character")},
+   {"is",  49		UNTIC_COMMENT("initialization string")},
+   {"k0",  65		UNTIC_COMMENT("F0 function key")},
+   {"k1",  66		UNTIC_COMMENT("F1 function key")},
+   {"k2",  68		UNTIC_COMMENT("F2 function key")},
+   {"k3",  69		UNTIC_COMMENT("F3 function key")},
+   {"k4",  70		UNTIC_COMMENT("F4 function key")},
+   {"k5",  71		UNTIC_COMMENT("F5 function key")},
+   {"k6",  72		UNTIC_COMMENT("F6 function key")},
+   {"k7",  73		UNTIC_COMMENT("F7 function key")},
+   {"k8",  74		UNTIC_COMMENT("F8 function key")},
+   {"k9",  75		UNTIC_COMMENT("F9 function key")},
+   {"k;",  67		UNTIC_COMMENT("F10 function key")},
+   {"kA",  78		UNTIC_COMMENT("insert-line key")},
+   {"kB", 148		UNTIC_COMMENT("back-tab key")},
+   {"kC",  57		UNTIC_COMMENT("clear-screen or erase key")},
+   {"kD",  59		UNTIC_COMMENT("delete-character key")},
+   {"kE",  63		UNTIC_COMMENT("clear-to-end-of-line key")},
+   {"kF",  84		UNTIC_COMMENT("scroll-forward key")},
+   {"kH",  80		UNTIC_COMMENT("lower-left key (home down)")},
+   {"kI",  77		UNTIC_COMMENT("insert-character key")},
+   {"kL",  60		UNTIC_COMMENT("delete-line key")},
+   {"kM",  62		UNTIC_COMMENT("sent by rmir or smir in insert mode")},
+   {"kN",  81		UNTIC_COMMENT("next-page key")},
+   {"kP",  82		UNTIC_COMMENT("previous-page key")},
+   {"kR",  85		UNTIC_COMMENT("scroll-backward key")},
+   {"kS",  64		UNTIC_COMMENT("clear-to-end-of-screen key")},
+   {"kT",  86		UNTIC_COMMENT("set-tab key")},
+   {"ka",  56		UNTIC_COMMENT("clear-all-tabs key")},
+   {"kb",  55		UNTIC_COMMENT("backspace key")},
+   {"kd",  61		UNTIC_COMMENT("down-arrow key")},
+   {"ke",  88		UNTIC_COMMENT("leave 'keyboard_transmit' mode")},
+   {"kh",  76		UNTIC_COMMENT("home key")},
+   {"kl",  79		UNTIC_COMMENT("left-arrow key")},
+   {"ko", 298		UNTIC_COMMENT("list of self-mapped keycaps")},
+   {"kr",  83		UNTIC_COMMENT("right-arrow key")},
+   {"ks",  89		UNTIC_COMMENT("enter 'keyboard_transmit' mode")},
+   {"kt",  58		UNTIC_COMMENT("clear-tab key")},
+   {"ku",  87		UNTIC_COMMENT("up-arrow key")},
+   {"l0",  90		UNTIC_COMMENT("label on function key f0 if not f0")},
+   {"l1",  91		UNTIC_COMMENT("label on function key f1 if not f1")},
+   {"l2",  93		UNTIC_COMMENT("label on function key f2 if not f2")},
+   {"l3",  94		UNTIC_COMMENT("label on function key f3 if not f3")},
+   {"l4",  95		UNTIC_COMMENT("label on function key f4 if not f4")},
+   {"l5",  96		UNTIC_COMMENT("label on function key f5 if not f5")},
+   {"l6",  97		UNTIC_COMMENT("label on function key f6 if not f6")},
+   {"l7",  98		UNTIC_COMMENT("label on function key f7 if not f7")},
+   {"l8",  99		UNTIC_COMMENT("label on function key f8 if not f8")},
+   {"l9", 100		UNTIC_COMMENT("label on function key f9 if not f9")},
+   {"la",  92		UNTIC_COMMENT("label on function key f10 if not f10")},
+   {"le",  14		UNTIC_COMMENT("move left one space")},
+   {"ll",  18		UNTIC_COMMENT("last line, first column (if no cup)")},
+   {"ma", 299		UNTIC_COMMENT("map arrow keys rogue(1) motion keys")},
+   {"mb",  26		UNTIC_COMMENT("turn on blinking")},
+   {"md",  27		UNTIC_COMMENT("turn on bold (extra bright) mode")},
+   {"me",  39		UNTIC_COMMENT("turn off all attributes")},
+   {"mh",  30		UNTIC_COMMENT("turn on half-bright mode")},
+   {"mk",  32		UNTIC_COMMENT("turn on blank mode (characters invisible)")},
+   {"ml", 311		UNTIC_COMMENT("lock memory above cursor")},
+   {"mm", 102		UNTIC_COMMENT("turn on meta mode (8th-bit on)")},
+   {"mo", 101		UNTIC_COMMENT("turn off meta mode")},
+   {"mp",  33		UNTIC_COMMENT("turn on protected mode")},
+   {"mr",  34		UNTIC_COMMENT("turn on reverse video mode")},
+   {"mu", 312		UNTIC_COMMENT("unlock memory")},
+   {"nd",  17		UNTIC_COMMENT("non-destructive space (move right one space)")},
+   {"nl", 296		UNTIC_COMMENT("use to move down")},
+   {"nw", 103		UNTIC_COMMENT("newline (behave like cr followed by lf)")},
+   {"oc", 287		UNTIC_COMMENT("Set all color pairs to the original ones")},
+   {"op", 288		UNTIC_COMMENT("Set default pair to its original value")},
+   {"pO", 144		UNTIC_COMMENT("turn on printer for #1 bytes")},
+   {"pc", 104		UNTIC_COMMENT("padding char (instead of null)")},
+   {"pf", 119		UNTIC_COMMENT("turn off printer")},
+   {"pk", 115		UNTIC_COMMENT("program function key #1 to type string #2")},
+   {"pl", 116		UNTIC_COMMENT("program function key #1 to execute string #2")},
+   {"pn", 147		UNTIC_COMMENT("program label #1 to show string #2")},
+   {"po", 120		UNTIC_COMMENT("turn on printer")},
+   {"ps", 118		UNTIC_COMMENT("print contents of screen")},
+   {"px", 117		UNTIC_COMMENT("program function key #1 to transmit string #2")},
+   {"r1", 122		UNTIC_COMMENT("reset string")},
+   {"r2", 123		UNTIC_COMMENT("reset string")},
+   {"r3", 124		UNTIC_COMMENT("reset string")},
+   {"rP", 145		UNTIC_COMMENT("like ip but when in insert mode")},
+   {"rc", 126		UNTIC_COMMENT("restore cursor to position of last save_cursor")},
+   {"rf", 125		UNTIC_COMMENT("name of reset file")},
+   {"rp", 121		UNTIC_COMMENT("repeat char #1 #2 times (P*)")},
+   {"rs", 295		UNTIC_COMMENT("terminal reset string")},
+   {"s0", 275		UNTIC_COMMENT("Shift to codeset 0 (EUC set 0, ASCII)")},
+   {"s1", 276		UNTIC_COMMENT("Shift to codeset 1")},
+   {"s2", 277		UNTIC_COMMENT("Shift to codeset 2")},
+   {"s3", 278		UNTIC_COMMENT("Shift to codeset 3")},
+   {"sa", 131		UNTIC_COMMENT("define video attributes #1-#9 (PG9)")},
+   {"sc", 128		UNTIC_COMMENT("save current cursor position (P)")},
+   {"se",  43		UNTIC_COMMENT("exit standout mode")},
+   {"sf", 129		UNTIC_COMMENT("scroll text up (P)")},
+   {"so",  35		UNTIC_COMMENT("begin standout mode")},
+   {"sp", 292		UNTIC_COMMENT("Set current color pair to #1")},
+   {"sr", 130		UNTIC_COMMENT("scroll text down (P)")},
+   {"st", 132		UNTIC_COMMENT("set a tab in every row, current columns")},
+   {"ta", 134		UNTIC_COMMENT("tab to next 8-space hardware tab stop")},
+   {"te",  40		UNTIC_COMMENT("strings to end programs using cup")},
+   {"ti",  28		UNTIC_COMMENT("string to start programs using cup")},
+   {"ts", 135		UNTIC_COMMENT("move to status line, column #1")},
+   {"uc", 136		UNTIC_COMMENT("underline char and move past it")},
+   {"ue",  44		UNTIC_COMMENT("exit underline mode")},
+   {"up",  19		UNTIC_COMMENT("up one line")},
+   {"us",  36		UNTIC_COMMENT("begin underline mode")},
+   {"vb",  45		UNTIC_COMMENT("visible bell (may not move cursor)")},
+   {"ve",  16		UNTIC_COMMENT("make cursor appear normal (undo civis/cvvis)")},
+   {"vi",  13		UNTIC_COMMENT("make cursor invisible")},
+   {"vs",  20		UNTIC_COMMENT("make cursor very visible")},
+   {"wi", 133		UNTIC_COMMENT("current window is lines #1-#2 cols #3-#4")},
+   {"",  -1		UNTIC_COMMENT("NULL")},
+};
+
+static Tgetstr_Map_Type Tgetnum_Map =
+{
+   {"BT",  11		UNTIC_COMMENT("number of buttons on mouse")},
+   {"Co",  12		UNTIC_COMMENT("maximum number of colors on screen")},
+   {"NC",  14		UNTIC_COMMENT("video attributes that cannot be used with colors")},
+   {"Nl",   8		UNTIC_COMMENT("number of labels on screen")},
+   {"co",   0		UNTIC_COMMENT("number of columns in a line")},
+   {"dB",  18		UNTIC_COMMENT("padding required for ^H")},
+   {"dC",  16		UNTIC_COMMENT("pad needed for CR")},
+   {"dN",  17		UNTIC_COMMENT("pad needed for LF")},
+   {"dT",  19		UNTIC_COMMENT("padding required for ^I")},
+   {"it",   1		UNTIC_COMMENT("tabs initially every # spaces")},
+   {"kn",  20		UNTIC_COMMENT("count of function keys")},
+   {"lh",   9		UNTIC_COMMENT("rows in each label")},
+   {"li",   2		UNTIC_COMMENT("number of lines on screen or page")},
+   {"lm",   3		UNTIC_COMMENT("lines of memory if > line. 0 means varies")},
+   {"lw",  10		UNTIC_COMMENT("columns in each label")},
+   {"pa",  13		UNTIC_COMMENT("maximum number of color-pairs on the screen")},
+   {"pb",   5		UNTIC_COMMENT("lowest baud rate where padding needed")},
+   {"sg",   4		UNTIC_COMMENT("number of blank characters left by smso or rmso")},
+   {"ug",  15		UNTIC_COMMENT("number of blanks left by ul")},
+   {"vt",   6		UNTIC_COMMENT("virtual terminal number (CB/unix)")},
+   {"ws",   7		UNTIC_COMMENT("number of columns in status line")},
+   {"",  -1		UNTIC_COMMENT("NULL")},
+};
+
+static Tgetstr_Map_Type Tgetflag_Map =
+{
+   {"5i",  22		UNTIC_COMMENT("printer will not echo on screen")},
+   {"HC",  23		UNTIC_COMMENT("cursor is hard to see")},
+   {"MT",  33		UNTIC_COMMENT("has meta key")},
+   {"ND",  26		UNTIC_COMMENT("scrolling region is non-destructive")},
+   {"NL",  34		UNTIC_COMMENT("move down with \n")},
+   {"NP",  25		UNTIC_COMMENT("pad character does not exist")},
+   {"NR",  24		UNTIC_COMMENT("smcup does not reverse rmcup")},
+   {"am",   1		UNTIC_COMMENT("terminal has automatic margins")},
+   {"bs",  30		UNTIC_COMMENT("uses ^H to move left")},
+   {"bw",   0		UNTIC_COMMENT("cub1 wraps from column 0 to last column")},
+   {"cc",  28		UNTIC_COMMENT("terminal can re-define existing colors")},
+   {"da",  11		UNTIC_COMMENT("display may be retained above the screen")},
+   {"db",  12		UNTIC_COMMENT("display may be retained below the screen")},
+   {"eo",   5		UNTIC_COMMENT("can erase overstrikes with a blank")},
+   {"es",  16		UNTIC_COMMENT("escape can be used on the status line")},
+   {"gn",   6		UNTIC_COMMENT("generic line type")},
+   {"hc",   7		UNTIC_COMMENT("hardcopy terminal")},
+   {"hl",  29		UNTIC_COMMENT("terminal uses only HLS color notation (Tektronix)")},
+   {"hs",   9		UNTIC_COMMENT("has extra status line")},
+   {"hz",  18		UNTIC_COMMENT("cannot print ~'s (hazeltine)")},
+   {"in",  10		UNTIC_COMMENT("insert mode distinguishes nulls")},
+   {"km",   8		UNTIC_COMMENT("Has a meta key (i.e., sets 8th-bit)")},
+   {"mi",  13		UNTIC_COMMENT("safe to move while in insert mode")},
+   {"ms",  14		UNTIC_COMMENT("safe to move while in standout mode")},
+   {"nc",  32		UNTIC_COMMENT("no way to go to start of line")},
+   {"ns",  31		UNTIC_COMMENT("crt cannot scroll")},
+   {"nx",  21		UNTIC_COMMENT("padding will not work, xon/xoff required")},
+   {"os",  15		UNTIC_COMMENT("terminal can overstrike")},
+   {"pt",  35		UNTIC_COMMENT("has 8-char tabs invoked with ^I")},
+   {"ul",  19		UNTIC_COMMENT("underline character overstrikes")},
+   {"ut",  27		UNTIC_COMMENT("screen erased with background color")},
+   {"xb",   2		UNTIC_COMMENT("beehive (f1=escape, f2=ctrl C)")},
+   {"xn",   4		UNTIC_COMMENT("newline ignored after 80 cols (concept)")},
+   {"xo",  20		UNTIC_COMMENT("terminal uses xon/xoff handshaking")},
+   {"xr",  36		UNTIC_COMMENT("return clears the line")},
+   {"xs",   3		UNTIC_COMMENT("standout not erased by overwriting (hp)")},
+   {"xt",  17		UNTIC_COMMENT("tabs destructive, magic so char (t1061)")},
+   {"",  -1		UNTIC_COMMENT("NULL")},
+};
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/Makefile Added

@@ -0,0 +1,90 @@
+# -*- make -*-
+TEST_SCRIPTS_SLC = argv syntax scircuit eqs sscanf loops arith array strops \
+  bstring pack stdio assoc selfload struct nspace path ifeval anytype arrmult \
+  time utf8 except bugs list regexp method deref naninf overflow sort \
+  longlong signal dollar req docfun debug qualif compare break multline \
+  stack misc posixio posdir proc math
+
+TEST_SCRIPTS_NO_SLC = autoload nspace2 prep
+
+TEST_SCRIPTS = $(TEST_SCRIPTS_SLC) $(TEST_SCRIPTS_NO_SLC)
+
+TEST_PGM = sltest
+MEMCHECK = valgrind --tool=memcheck --leak-check=yes --leak-resolution=med --num-callers=20
+RUN_TEST_PGM = ./$(TEST_PGM)
+SLANGINC = ..
+SLANGLIB = ../$(ARCH)objs
+OTHER_LIBS = -lm
+OTHER_CFLAGS =
+
+runtests: $(TEST_PGM) cleantmp
+	@tests=""; \
+	for test in $(TEST_SCRIPTS); \
+	do \
+	   tests="$$tests $$test.sl"; \
+	done; \
+	for test in $(TEST_SCRIPTS_SLC); \
+	do \
+	   tests="$$tests $$test.slc"; \
+	done; \
+	MAKERUNNING=1 ./runtests.sh $$tests
+#	@touch $(TEST_PGM).c
+
+update: $(TEST_PGM) cleantmp
+	@tests=""; \
+	for X in $(TEST_SCRIPTS); \
+	do \
+	  if  ! -e lastrun/$$X.sl  ||  $$X.sl -nt lastrun/$$X.sl  ; \
+	  then \
+	   tests="$$tests $$X.sl"; \
+	  fi \
+	done; \
+	for X in $(TEST_SCRIPTS_SLC); \
+	do \
+	  if  ! -e lastrun/$$X.slc  ||  $$X.sl -nt lastrun/$$X.slc  ; \
+	  then \
+	   tests="$$tests $$X.slc"; \
+	  fi \
+	done; \
+	if test -n "$$tests"; \
+	then \
+	  MAKERUNNING=1 ./runtests.sh $$tests; \
+	fi
+#	@touch $(TEST_PGM).c
+
+memcheck_runtests: $(TEST_PGM) cleantmp
+	@echo ""
+	@echo "Running tests:"
+	@echo ""
+	-@for X in $(TEST_SCRIPTS); \
+	do \
+	   $(MEMCHECK) --log-file=log.$${X} $(RUN_TEST_PGM) $$X.sl; \
+	   grep ERROR log.$${X}; grep 'lost: ^0' log.$${X}; \
+	   $(MEMCHECK) --log-file=log.$${X}_u $(RUN_TEST_PGM) -utf8 $$X.sl; \
+	   grep ERROR log.$${X}_u; grep 'lost: ^0' log.$${X}_u; \
+	done
+#	touch $(TEST_PGM).c
+
+memcheck_runtests_slc: $(TEST_PGM) cleantmp
+	@echo ""
+	@echo "Running tests:"
+	@echo ""
+	-@for X in $(TEST_SCRIPTS_SLC); \
+	do \
+	   $(MEMCHECK) --log-file=log.$${X}_c $(RUN_TEST_PGM) $$X.slc; \
+	   $(MEMCHECK) --log-file=log.$${X}_uc $(RUN_TEST_PGM) -utf8 $$X.slc; \
+	done
+#	touch $(TEST_PGM).c
+
+memcheck: memcheck_runtests memcheck_runtests_slc
+
+$(TEST_PGM): $(TEST_PGM).c assoc.c list.c $(SLANGLIB)/libslang.a
+	$(CC) $(CFLAGS) $(OTHER_CFLAGS) $(LDFLAGS) $(TEST_PGM).c -o $(TEST_PGM) -I$(SLANGINC) -L$(SLANGLIB) -lslang $(OTHER_LIBS)
+cleantmp:
+	-/bin/rm -rf tmpfile*.* tmpdir*.*
+clean: cleantmp
+	-/bin/rm -f *~ *.o *.log log.pid* *.slc log.* *.log-*
+distclean: clean
+	/bin/rm -f $(TEST_PGM) $(TEST_PGM).gcda $(TEST_PGM).gcno
+.PHONY: clean memcheck runtests memcheck_runtests_slc memcheck_runtests cleantmp
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/README Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/anytype.sl Added

@@ -0,0 +1,62 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("Any_Type");
+
+% Tests go here....
+
+variable A = Any_Type10;
+if ((_typeof(A)) != Any_Type) failed ("_typeof");
+
+static define eqs (a, b)
+{
+   variable len;
+   len = length (a);
+   if (len != length (b))
+     return 0;
+
+   len == length (where (a == b));
+}
+
+static define neqs (a, b)
+{
+   not (eqs (a, b));
+}
+
+static define check (a, i, value)
+{
+   ai = value;
+   if (typeof (ai) != Any_Type)
+     failed ("check typeof");
+   % Because value can be an array, use neqs
+   if (neqs(@ai, value))
+     failed ("ai = value for %S, computed: %S", value, @ai);
+}
+
+check (A, 0, "hello");
+check (A, 0, 14);
+#ifexists Double_Type
+check (A, 0, 2.3);
+#endif
+check (A, 0, &A);
+check (A, 0, 1:10);
+#ifexists Complex_Type
+check (A, 0, 1+2i);
+#endif
+check (A, 0, String_Type);
+
+A = "a", "ab", "abc";
+static variable B = typecast (A, Any_Type);
+if ((typeof (B) != Array_Type)
+    or (_typeof(B) != Any_Type))
+  failed ("typecast to Any_Type");
+_for (0, length(B)-1, 1)
+{
+   $1 = ();
+   if (A$1 != @B$1)
+     failed ("@typecast(A,Any_Type)");
+}
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/argv.sl Added

@@ -0,0 +1,56 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("argv processing");
+
+define play_games_width_argv ()
+{
+   try
+     {
+	eval ("__argc = 1;");
+	failed ("__argc read-only test");
+     }
+   catch ReadOnlyError;
+
+   try
+     {
+	eval ("__argv = \"a\", \"b\";");
+	failed ("__argv = ... test");
+     }
+   catch ForbiddenError;
+
+   try
+     {
+	if (length (__argv))
+	  eval ("__argv0 = \"a\";");
+     }
+   catch ReadOnlyError: failed ("__argv0 is read-only");
+
+   loop (20)
+     {
+	variable x = __argv;
+     }
+}
+play_games_width_argv ();
+
+define test_argv (argv)
+{
+   __set_argc_argv (argv);
+   variable argc = length (argv);
+   if (__argc != argc)
+     failed ("Expected __argc to be %d, found %d", argc, __argc);
+   if (length (argv) != __argc)
+     failed ("__argv does not have the expected length, found %d", length(__argv));
+   if (not _eqs (__argv, argv))
+     failed ("__argv did not have the expected value");
+
+   play_games_width_argv ();
+}
+test_argv (String_Type0);
+test_argv ("a0");
+test_argv ("a0", "b0");
+test_argv ("a0", "b0", "c0");
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/arith.sl Added

@@ -0,0 +1,471 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("Arithmetic");
+
+static define test_value (a, b)
+{
+ if (a != b)
+ failed ("test_value: %S != %S", a, b);
+}
+
+test_value ('\x1', 1);
+test_value ('\x11', 0x11);
+test_value ('\x{111}', 0x111);
+test_value ('\x80', 128);
+test_value ('\x81', 129);
+test_value ('\xFF', 255);
+test_value ('\d255', 255);
+test_value ('\d8', 8);
+
+static variable G = 11;
+define check_global_local ()
+{
+ variable x = 1;
+ if (G + 1 != 12)
+ failed ("global + int");
+ if (1 + G != 12)
+ failed ("int + global");
+ if (x + 11 != 12)
+ failed ("local + int");
+ if (11 + x != 12)
+ failed ("int + local");
+ if (x + x != 2)
+ failed ("local + local");
+ if (x + G != 12)
+ failed ("local + global");
+ if (G + x != 12)
+ failed ("global + local");
+ if (1 + 11 != 12)
+ failed ("int + int");
+
+ variable y = 3;
+ x = 37; x = x + 3;
+ if (x != 40)
+ failed ("x = x + 3");
+ x = 37; x = 3 + x;
+ if (x != 40)
+ failed ("x = 3 + x");
+ x = 37; x = x + y;
+ if (x != 40)
+ failed ("x = x + y");
+#ifexists Double_Type
+ x = 37; x = x + 3.0;
+ if (x != 40.0)
+ failed ("x = x + 3.0");
+ x = 37; x = 3.0 + x;
+ if (x != 40.0)
+ failed ("x = 3.0 + x");
+#endif
+}
+check_global_local ();
+
+define check_typeof (expr, type)
+{
+ if (typeof (expr) != type)
+ verror ("typeof(%S) ==> %S, not %S as expected",
+	 expr, typeof(expr), type);
+}
+
+define check_bool (i)
+{
+ check_typeof (i == i, Char_Type);
+}
+
+define check_sum_result (i, j, k)
+{
+ if (k != i + j)
+ failed (sprintf("%S + %S != %S", typeof (i), typeof(j), typeof(k)));
+}
+
+check_typeof('a', UChar_Type);
+check_typeof(1h, Short_Type);
+check_typeof(1hu, UShort_Type);
+check_typeof(0x20hu, UShort_Type);
+check_typeof(1, Integer_Type);
+check_typeof(0x20, Integer_Type);
+check_typeof(1u, UInteger_Type);
+check_typeof(1LU, ULong_Type);
+#ifexists Double_Type
+check_typeof(1f, Float_Type);
+check_typeof(1e10f, Float_Type);
+check_typeof(.1e10f, Float_Type);
+check_typeof(.1e10, Double_Type);
+#endif
+check_typeof(~'a', UChar_Type);
+check_typeof(~1h, Short_Type);
+check_typeof(~1hu, UShort_Type);
+check_typeof(~0x20hu, UShort_Type);
+check_typeof(~1, Integer_Type);
+check_typeof(~0x20, Integer_Type);
+check_typeof(~1u, UInteger_Type);
+check_typeof(~1LU, ULong_Type);
+
+check_typeof ('a' + 'b', Integer_Type);
+check_typeof (1h + 'b', Integer_Type);
+
+if (Integer_Type == Short_Type) check_typeof (1hu + 'b', UInteger_Type);
+else check_typeof (1hu + 'b', Integer_Type);
+
+check_typeof (1u + 1, UInteger_Type);
+
+define check_typeof_in_func ()
+{
+ check_typeof (1 & 1UL, ULong_Type);
+ check_typeof (1 & 1, Int_Type);
+ check_typeof (1 & 1uh, Int_Type);
+ check_typeof (1UL & 1uh, ULong_Type);
+}
+check_typeof_in_func ();
+
+if (Integer_Type == Long_Type) check_typeof (1u + 1L, ULong_Type);
+else check_typeof (1u + 1L, Long_Type);
+
+check_typeof (1u + 1UL, ULong_Type);
+#ifexists Double_Type
+check_typeof (1u + 1.0f, Float_Type);
+check_typeof (1u + 1.0, Double_Type);
+#endif
+#ifexists Complex_Type
+check_typeof ('c' * 1i, Complex_Type);
+check_typeof (1h * 1i, Complex_Type);
+check_typeof (1.0 * 1i, Complex_Type);
+check_typeof (1i * 1i, Complex_Type);
+#endif
+
+check_bool ('a');
+check_bool (1h);
+check_bool (1hu);
+check_bool (1);
+check_bool (1u);
+check_bool (1L);
+check_bool (1LU);
+#ifexists Double_Type
+check_bool (1f);
+check_bool (1.0);
+#endif
+#ifexists Complex_Type
+check_bool (1.0i);
+#endif
+
+#ifexists Complex_Type
+check_typeof (Real(1), Double_Type);
+check_typeof (Real('a'), Double_Type);
+check_typeof (Real(1L), Double_Type);
+check_typeof (Real(1f), Float_Type);
+check_typeof (Real(1.0), Double_Type);
+#endif
+
+check_sum_result (1, 1, 2);
+check_sum_result (1, 0x31, 50);
+check_sum_result (1, '1', 50);
+check_sum_result (1L, '1', 50L);
+check_sum_result (1L, 1h, 2L);
+check_sum_result (1, 1h, 2);
+check_sum_result (1h, '1', 50);
+check_sum_result (1u, 3, 4);
+check_sum_result (1UL, '\x3', 4UL);
+
+#ifexists Complex_Type
+private define check_complex_real_binary (z)
+{
+ if ((z * 1.0) != z) failed ("complex %S*1.0", z);
+ if ((z / 1.0) != z) failed ("complex %S/1.0", z);
+ if ((z * 1L) != z) failed ("complex %S*1L", z);
+ if ((z / 1L) != z) failed ("complex %S/1L", z);
+
+ if ((z + 0.0) != z) failed ("complex %S+0.0", z);
+ if ((z - 0.0) != z) failed ("complex %S-0.0", z);
+ if ((z + 0L) != z) failed ("complex %S+0.0", z);
+ if ((z - 0L) != z) failed ("complex %S-0.0", z);
+
+ if ((1.0 * z) != z) failed ("complex 1.0*%S", z);
+ if ((0.0 + z) != z) failed ("complex 1.0+%S", z);
+ if ((0.0 - z) != -z) failed ("complex 1.0-%S", z);
+
+ if ((1L * z) != z) failed ("complex 1L*%S", z);
+ if ((0L + z) != z) failed ("complex 1.0+%S", z);
+ if ((0L - z) != -z) failed ("complex 1.0-%S", z);
+
+ if (((1i*z) / (1.0i)) != z) failed ("complex (1i*%S)/(1i)", z);
+ if (z/(1+0i) != z) failed ("complex (1i*%S)/(1i)", z);
+
+ if (Real(z) == 0)
+ {
+	ifnot (Imag (z) == -1i*z) failed ("double==complex");
+	ifnot (-1i*z == Imag(z)) failed ("complex==double");
+
+	if ((-1i*z != Imag(z)) || (Imag(z) != -1i*z))
+	 failed ("imag z");
+ }
+
+ variable z2, w, z1, x, y, zz, diff;
+
+ x = Real(z); y = Imag(z);
+ z2 = z^2.0, zz = z*z;
+ diff = abs (z2-zz);
+
+ z2 = 2.0^z;
+ zz = exp (z*log(2.0));
+ diff = abs (z2-zz);
+ if (diff > 1e-13) failed ("%S^%S", 2.0, z);
+ z2 = (2+0i)^z;
+ diff = abs (z2-zz);
+ if (diff > 1e-13) failed ("%S^%S", 2.0, z);
+ z2 = (2L)^z;
+ diff = abs (z2-zz);
+ if (diff > 1e-13) failed ("%S^%S", 2.0, z);
+
+ z2 = 1i*x + y;
+ if ((Imag(z2) != x) || (Real(z2) != y))
+ failed ("Real/Imag %S", z);
+
+ z2 = Conj(z);
+ if ((Real(z2) != x) || (Imag(z2) != -y))
+ failed ("Conj %S", z);
+
+ % 1/z = z*/|z|^2
+ z1 = 1.0/z;
+ z2 = sqr(z); % |z|^2
+ diff = abs (z1 - (x/z2 - 1i*y/z2));
+ if (diff > 1e-13) failed ("1/z, sqr(z)");
+ z1 = 1L/z;
+ diff = abs (z1 - (x/z2 - 1i*y/z2));
+ if (diff > 1e-13) failed ("1/z, sqr(z)");
+
+ z1 = z^0.5;
+ z2 = sqrt(z);
+ diff = abs (z1-z2);
+ if (diff > 1e-13) failed ("z^0.5 vs sqrt");
+
+ z1 = z+1;
+ z2 = z; z2++;
+ if (z2 != z1) failed ("z++");
+ z1--;
+ if (z1 != z) failed ("z--");
+
+ if (mul2(z) != 2*z) failed ("mul2");
+
+ if (sign(z) != sign(y))
+ failed ("sign z");
+
+ if ((z^0 != 1) || (z^0L != 1) || (z^0.0 != 1L))
+ failed ("z^0");
+
+ if (z*0 != 0L) failed ("z*0 != 0L");
+ if (0L != z*0h) failed ("0L != z*0h");
+
+#iffalse % needs to be implemented for Complex
+ if (abs(z) >= 1L)
+ {
+	w = z^-50;
+	if (log1p (w) != w)
+	 failed ("log1p(%S) ==> %S", w, log1p(w));
+
+	if (expm1(w) != w)
+	 failed ("expm1");
+ }
+#endif
+}
+
+
+
+check_complex_real_binary (0+0i);
+check_complex_real_binary (0+1i);
+check_complex_real_binary (0+2i);
+check_complex_real_binary (1+0i);
+check_complex_real_binary (1+1i);
+check_complex_real_binary (2+1i);
+
+static define check_complex_fun (fun, x)
+{
+ variable z = x + 0i;
+ variable diff = abs ((@fun)(z) - (@fun)(x));
+ if (diff > 1e-13)
+ failed ("%S %S", fun, z);
+}
+
+check_complex_fun (&sin, 1);
+check_complex_fun (&cos, 1);
+check_complex_fun (&tan, 1);
+check_complex_fun (&acos, 0.5);
+check_complex_fun (&asin, 0.5);
+check_complex_fun (&atan, 0.5);
+check_complex_fun (&cosh, 1);
+check_complex_fun (&sinh, 1);
+check_complex_fun (&tanh, 1);
+check_complex_fun (&asinh, 0.5);
+check_complex_fun (&acosh, 2.0);
+check_complex_fun (&atanh, 0.5);
+check_complex_fun (&sqrt, 0.5);
+check_complex_fun (&exp, 0.5);
+#endif
+
+define test_is_same (a, b, r)
+{
+ if (r != __is_same (a,b))
+ failed ("__is_same (%S,%S)", a, b);
+}
+
+test_is_same (1,1,1);
+test_is_same (1,'\001', 0);
+#ifexists Double_Type
+test_is_same (1, 1.0, 0);
+test_is_same (-1.0, -(1.0), 1);
+test_is_same (-PI, -(PI), 1);
+test_is_same (-20.312345678, -(20.312345678), 1);
+test_is_same (-20.3123f, -(20.3123f), 1);
+#endif
+test_is_same ("xyz", "xyz", 1);
+test_is_same (1:3,1:3,0);
+test_is_same (stdout, stderr, 0);
+test_is_same (stderr, 1, 0);
+#ifexists Complex_Type
+test_is_same (1+2i, 1+2i, 1);
+test_is_same (1.0+0.0i, 1.0, 0);
+test_is_same (-20.3-2i, -(20.3+2i), 1);
+#endif
+
+#ifexists Double_Type
+define another_test ()
+{
+ variable x = 1.0;
+ variable y;
+
+ if (18 != 1.0+1+x
+ + 1.0+x+1
+ + x+1.0+1
+ + x+1+1.0
+ + 1+1.0+x
+ + 1+x+1.0)
+ failed ("sum combinations");
+}
+
+another_test();
+#endif
+
+define test_typecast ()
+{
+ variable s, t, x = 37;
+ variable x2 = 74;
+ foreach t (Util_Arith_Types)
+ {
+	variable y = typecast (x, t);
+	if ((x != y) || (typeof (y) != t))
+	 failed ("typecast scalar");
+	foreach s (Util_Arith_Types)
+	 {
+	 variable z = typecast (y, s);
+	 if ((z != x) || (z != y) || (typeof(z) != s))
+	 failed ("typecast scalar %S->%S", t, s);
+	 }
+ }
+}
+test_typecast ();
+
+define test_binary ()
+{
+ variable x = 37, x2 = 74, xm2 = 35, xp2 = 39, xmod2=1, s, t;
+ foreach t (Util_Arith_Types)
+ {
+	variable y = typecast (x, t);
+	variable y2 = typecast (x2, t);
+	foreach s (Util_Arith_Types)
+	 {
+	 variable two = typecast(2, s);
+	 if (y2/two != x) failed ("binary %S/%S", t, s);
+	 if (y*two != x2) failed ("binary %S*%S", t, s);
+	 if (y-two != xm2) failed ("binary %S-%S", t, s);
+	 if (y+two != xp2) failed ("binary %S+%S", t, s);
+	 if ((y mod two) != xmod2) failed ("binary %S mod %S", t, s);
+	 ifnot (y>two) failed ("binary %S > %S", t, s);
+	 ifnot (y>=two) failed ("binary %S > %S", t, s);
+	 if (y<two) failed ("binary %S > %S", t, s);
+	 if (y<=two) failed ("binary %S <= %S", t, s);
+	 if (y==two) failed ("binary %S==%S", t, s);
+	 ifnot (y!=two) failed ("binary %S!=%S", t, s);
+	 }
+ }
+}
+test_binary ();
+
+static define check_integer (str, val)
+{
+ variable val1 = integer (str);
+ if ((val != val1) or (typeof (val) != typeof (val1)))
+ failed ("integer($str) ==> $val1, not $val"$);
+}
+
+check_integer ("0", 0);
+check_integer ("0x0", 0);
+check_integer ("0x1", 1);
+check_integer ("0x1h", 1);
+check_integer ("0x1L", 1);
+check_integer ("0x1FL", 0x1F);
+check_integer ("-0x1FL", -0x1F);
+check_integer ("-1L", -1);
+check_integer ("-1h", -1);
+try
+{
+ check_integer ("h", 0);
+ failed ("integer(h) should have produced an exception");
+}
+catch SyntaxError;
+
+static define check_atox (fun, str, val)
+{
+ ifnot (__is_same (val, (@fun)(str)))
+ failed ("%S", fun);
+
+ variable a = String_Type1024;
+ a* = str;
+ variable b = (@fun) (a);
+ if ((typeof (b) != Array_Type)
+ || (_typeof(b) != typeof (val)))
+ failed ("%S did not return array of type %S", fun, typeof(val));
+ if (any(b != val))
+ failed ("%S did not return the correct array of values", fun);
+}
+
+check_atox (&atoi, "7", 7);
+check_atox (&atol, "7", 7L);
+#ifexists atoll
+check_atox (&atoll, "7", 7LL);
+#endif
+
+#ifexists Double_Type
+check_atox (&atof, "7.0", 7.0);
+#endif				 % Double_Type
+
+private define test_string()
+{
+ variable t;
+ foreach t (Util_Arith_Types)
+ {
+	variable s = string (typecast (37, t));
+	if ((t == Double_Type) || (t == Float_Type))
+	 {
+	 if (s != "37.0")
+	 failed ("string(%S)", t);
+	 continue;
+	 }
+	if (s != "37")
+	 failed ("string(%S)", t);
+ }
+
+ foreach t (Util_Signed_Arith_Types)
+ {
+	s = string (typecast (-37, t));
+	if ((t == Double_Type) || (t == Float_Type))
+	 {
+	 if (s != "-37.0")
+	 failed ("string(%S)", t);
+	 continue;
+	 }
+	if (s != "-37")
+	 failed ("string(%S)", t);
+ }
+}
+test_string ();
+
+print ("Ok\n");
+exit (0);

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/array.sl Added

@@ -0,0 +1,1921 @@
+() = evalfile ("./inc.sl");
+
+testing_feature ("array functions");
+
+% Ensure that this mechanism of array creation is supported.
+$1 = Short_Type10, 20;
+$2 = _typeof ($1)3,4;
+if (typeof ($2) != Array_Type)
+ failed ("_typeof(X) failed to create an array");
+if (_typeof($2) != Short_Type)
+ failed ("_typeof(X) failed to create an array of the proper type");
+if ((array_shape ($2)0 != 3) or (array_shape($2)1 != 4))
+ failed ("typeof(X) failed to create an array of the proper shape");
+
+private define eqs (a, b)
+{
+ return _eqs(a,b);
+#iffalse
+ variable len;
+ len = length (a);
+ if (len != length (b))
+ return 0;
+
+ len == length (where (a == b));
+#endif
+}
+
+private define array_dims (a)
+{
+ variable dims;
+ (dims,,) = array_info (a);
+ if (0 == eqs (dims, array_shape (a)))
+ failed ("array_shape failed");
+
+ return dims;
+}
+
+private define neqs (a, b)
+{
+ not (eqs (a, b));
+}
+
+private variable A = 0:23;
+
+private variable B = transpose(A);
+private variable dims;
+
+(dims,,) = array_info (B);
+if ((dims0 != 1)
+ or (dims1 != 24))
+ failed ("transpose (0:23, found %S)", B);
+
+reshape (A, 2,3,4);
+
+% 0 1 2 3
+% 4 5 6 7 = A0,*,*
+% 8 9 10 11
+%
+% 12 13 14 14
+% 16 17 18 19 = A1,*,*
+% 20 21 22 23
+%
+if ((A0,0,0 != 0)
+ or (A0,0,1 != 1)
+ or (neqs (A0,0,:, 0:3))
+ or (neqs (A0,1,:, 4:7))
+ or (neqs (A0,2,:, 8:11))
+ or (neqs (A1,0,:, 12:15))
+ or (neqs (A1,1,:, 16:19))
+ or (neqs (A1,2,:, 20:23))) failed ("reshape");
+
+if (A0,-1, -1 != 11) failed ("A0,-1,-1");
+if (length (A0,-1, 0:-1)) failed ("length A0,-1,0:-1");
+if (length (A0,-1, -1:3) != 5) failed ("length A0,-1,-1:3");
+#iffalse
+if (neqs(array_shape(A0:-1,*,*), 0,3,4)
+ || neqs(array_shape(A*,0:-1,*), 2,0,4)
+ || neqs(array_shape(A*,*,0:-1), 2,3,0)
+ || neqs(array_shape(A*,0:-1,0:-1), 2,0,0)
+ || neqs(array_shape(A0:-1,*,0:-1), 0,3,0)
+ || neqs(array_shape(A0:-1,0:-1,*), 0,0,4)
+ || neqs(array_shape(A0:-1,0:-1,0:-1), 0,0,0))
+ failed ("indexing mult-dim array with 0:-1");
+#endif
+try
+{
+ () = A0,-1,-7:0;
+ failed ("A0,-1,-5:0");
+}
+catch IndexError;
+
+private define test_transpose_for_all_types ()
+{
+ foreach (Util_Arith_Types)
+ {
+	variable t = ();
+	variable b = transpose (typecast (A, t));
+	if ((b0,0,0 != 0)
+	 or (b1,0,0 != 1)
+	 or (neqs (b:,0,0, 0:3))
+	 or (neqs (b:,1,0, 4:7))
+	 or (neqs (b:,2,0, 8:11))
+	 or (neqs (b:,0,1, 12:15))
+	 or (neqs (b:,1,1, 16:19))
+	 or (neqs (b:,2,1, 20:23)))
+	 failed ("transpose %S array", t);
+ }
+}
+
+if (length (8198:8192:8192) != 0)
+ failed ("length (8198:8192:8192)");
+
+if (length (8198.0:8192.0:8192) != 0)
+ failed ("length (8198.0:8192.0:8192)");
+
+% Test for memory leak
+B = transpose (A);
+loop (3) B = transpose (B);
+B = 0;
+
+% Try on a string array
+A = 0:23;
+variable S = String_Typelength (A);
+foreach (A)
+{
+ variable i = ();
+ Si = string (i);
+}
+
+variable T = @S;
+reshape (S, 2,3,4);
+
+if ((S0,0,0 != T0)
+ or (S0,0,1 != T1)
+ or (neqs (S0,0,*, T0:3))
+ or (neqs (S0,1,*, T4:7))
+ or (neqs (S0,2,*, T8:11))
+ or (neqs (S1,0,*, T12:15))
+ or (neqs (S1,1,*, T16:19))
+ or (neqs (S1,2,*, T20:23))) failed ("reshape string array");
+
+S = transpose (S);
+
+if ((S0,0,0 != T0)
+ or (S1,0,0 != T1)
+ or (neqs (S*,0,0, T0:3))
+ or (neqs (S*,1,0, T4:7))
+ or (neqs (S*,2,0, T8:11))
+ or (neqs (S*,0,1, T12:15))
+ or (neqs (S*,1,1, T16:19))
+ or (neqs (S*,2,1, T20:23))) failed ("transpose string array");
+
+S = "", "1", "12", "123", "1234", "12345";
+S = array_map (Int_Type, &strlen, S);
+if (neqs (S, 0:5)) failed ("array_map 1");
+
+S = "", "1", "12", "123", "1234", "12345";
+variable SS = S + S;
+if (neqs (SS, array_map (String_Type, &strcat, S, S))) failed ("array_map 2");
+
+SS = S + "--end";
+if (neqs (SS, array_map (String_Type, &strcat, S, "--end"))) failed ("array_map 3");
+
+try
+{
+ SS = Long_Type10000,10000,10000,10000,10000,10000;
+}
+catch IndexError;
+
+private define array_map2_func ()
+{
+ variable args = __pop_list (_NARGS-1);
+ variable f = ();
+ variable r1, r2;
+ (r1, r2) = (@f)(__push_list(args));
+ return {r1, r2};
+}
+
+private define array_map2 ()
+{
+ variable args = __pop_list (_NARGS-3);
+ variable ret1, ret2, f;
+ (ret1, ret2, f) = ();
+ variable rlist = array_map (List_Type, &array_map2_func, f, __push_list(args));
+ %rlist is an array of lists
+ variable n = length (rlist);
+ variable t0 = typeof (rlist00), t1 = typeof (rlist01);
+ variable a0 = t0n, a1 = t1n;
+ _for (0, n-1, 1)
+ {
+	variable i = ();
+	a0i = rlisti0;
+	a1i = rlisti1;
+ }
+ return a0, a1;
+}
+
+private define sum_and_diff (x, y)
+{
+ return x+y, x-y;
+}
+
+private define count_func (x, ref)
+{
+ @ref++;
+}
+
+private define test_array_mapN ()
+{
+ variable s, d, s1, d1, x, y;
+ x = 1:10, y = 1:10;
+ (s,d) = array_map (Double_Type, Double_Type, &sum_and_diff, x, y);
+ (s1, d1) = array_map2 (Double_Type, Double_Type, &sum_and_diff, x, y);
+ if (neqs (s1,s) || neqs (d1, d))
+ failed ("array_map with 2 returns test 1");
+
+ x = 1:10, y = 1.0;
+ (s,d) = array_map (Double_Type, Double_Type, &sum_and_diff, x, y);
+ (s1, d1) = array_map2 (Double_Type, Double_Type, &sum_and_diff, x, y);
+ if (neqs (s1,s) || neqs (d1, d))
+ failed ("array_map with 2 returns test 2");
+
+ y = 1:10, x = 1.0;
+ (s,d) = array_map (Double_Type, Double_Type, &sum_and_diff, x, y);
+ (s1, d1) = array_map2 (Double_Type, Double_Type, &sum_and_diff, x, y);
+ if (neqs (s1,s) || neqs (d1, d))
+ failed ("array_map with 2 returns test 3");
+
+ x = 1:10;
+ s = array_map (Double_Type, &sin, x);
+ s1 = array_map (Void_Type, Double_Type, &sin, x);
+ if (neqs (s1,s))
+ failed ("array_map with 1 void return test 1");
+ s1 = array_map (Double_Type, Void_Type, &sin, x);
+ if (neqs (s1,s))
+ failed ("array_map with 1 void return test 2");
+
+ x = 1:10;
+ y = 0;
+ array_map (&count_func, x, &y);
+ if (y != length(x))
+ failed ("array_map with implicit void");
+
+ x = 1:10;
+ y = 0;
+ array_map (Void_Type, &count_func, x, &y);
+ if (y != length(x))
+ failed ("array_map with explicit void");
+}
+
+test_array_mapN ();
+
+#ifexists Double_Type
+S = 1:20:0.1;
+if (neqs (sin(S), array_map (Double_Type, &sin, S))) failed ("array_map 4");
+
+S = 1:20:0.1;
+variable Sin_S = Double_Typelength(S);
+private define void_sin (x, i)
+{
+ Sin_Si = sin (x);
+}
+array_map (Void_Type, &void_sin, S, 0:length(S)-1);
+if (neqs (sin(S), Sin_S))
+ failed ("array_map Void_Type");
+#endif
+
+$1 = array_map (Int_Type, &strlen, String_Type0);
+if ((length ($1) != 0) or (_typeof ($1) != Int_Type))
+ failed ("array_map String_Type0");
+
+$1 = array_map (String_Type, &strcat, "Hello", String_Type0);
+if ((length ($1) != 0) or (_typeof ($1) != String_Type))
+ failed ("array_map (Hello, String_Type0");
+
+try
+{
+ $1 = array_map (String_Type, &strcat, "Hello", String_Type0);
+ failed ("array_map (Hello, String_Type0 did not generate an exception");
+}
+catch TypeMismatchError;
+
+private define function_returning_NULL_or_string (x) { x == 0 ? NULL : "!0"; }
+$1 = array_map (String_Type, &function_returning_NULL_or_string, -1:1);
+if (neqs ($1, "!0", NULL, "!0"))
+ failed ("array_map putting NULL into String_Type array");
+
+% Indexing of 7d array
+if (31 != _reshape (31, 1,1,1,1,1,1,1)0,0,0,0,0,0,0)
+ failed ("reshape of 7d array");
+
+A=1:24;
+B = A*;
+if (neqs(A,B))
+ failed("A* 1");
+B = (A+1)-1;
+if (neqs (A, B))
+ failed ("(A+1)-1");
+B = A*;
+if (neqs(A,B))
+ failed("A* 2");
+A = 3; if (typeof (A*) != Array_Type) failed ("typeof A*");
+
+% Check indexing with negative subscripts
+S = 0:10;
+if (S-1 != 10) failed ("-1");
+#iffalse
+% Old, broken semantics
+if (length (S-1:3)) failed ("-1:3");
+if (neqs(S-1:0:-1, 10:0:-1)) failed ("-1:0:-1");
+if (neqs(S0:-1, S)) failed ("0:-1");
+if (neqs(S3:-1, 3:10)) failed (3:-1);
+if (length (S0:-1:-1)) failed ("0:-1:-1"); % first to last by -1
+if (neqs(S0:, S)) failed ("0:");
+if (neqs(S:-1, S)) failed (":-1");
+#else
+% New semantics
+if (length (S-1:3) != 5) failed ("-1:3");
+if (length(S-1:0:-1)) failed ("-1:0:-1");
+if (neqs(S-1:1, S-1,S0,S1)) failed ("-1:1");
+if (neqs(S0:-1:-1, S0,S-1)) failed ("0:-1:-1");
+if (neqs(S-2:2, S-2,S-1,S0,S1,S2)) failed (-2:2);
+if (length (S0:-1:1)) failed ("0:-1:1");
+if (neqs(S0:, S)) failed ("0:");
+if (neqs(S-11:-1, S)) failed ("-10:-1");
+
+if (length (S:-1) != length(S)) failed ("S:-1");
+if (neqs(S:-1, S)) failed ("0:-1");
+if (neqs(S-1::-1, 10:0:-1)) failed ("S-1::-1");
+if (neqs(S3:, 3:10)) failed (3:);
+if (neqs(S-3:, S8:10)) failed ("-3:");
+if (neqs(S-3::-1, S8:0:-1)) failed ("-3:");
+if (neqs(S:-3, S0:8)) failed (":-3");
+if (neqs(S:3:-1, S10:3:-1)) failed (":-1");
+if (neqs(S::-1, S10:0:-1)) failed ("::-1");
+if (neqs(S:, S0:10)) failed (":");
+if (neqs(S::1, S0:10)) failed ("::1");
+
+% This is very useful in practice. Make sure it does not break.
+if (length(Slength(S):)) failed("length(S):");
+
+#endif
+
+A = 0:20;
+A-1,-2 = 0;
+if (neqs (A0:18, 0:18))
+ failed ("A-1,-2 = 0");
+if ((A19 != 0) or (A20 != 0))
+ failed ("A-1,-2 = 0");
+
+S = Int_Type0;
+if (length (S) != 0) failed ("Int_Type0");
+if (neqs (S, S0:-1)) failed ("Int_Type00:-1");
+
+S = bstring_to_array ("hello");
+if ((length (S) != 5)
+ or (typeof (S) != Array_Type)) failed ("bstring_to_array");
+if ("hello" != array_to_bstring (S)) failed ("array_to_bstring");
+
+A = 'a':'z';
+foreach (A)
+{
+ $1 = ();
+ if (A$1 - 'a' != $1)
+ failed ("'a':'z'");
+}
+
+define check_result (result, answer, op)
+{
+ if (neqs (answer, result))
+ failed ("Binary operation `%s' failed", op);
+}
+
+check_result (1,2 + 3,4, 4,6,"+");
+check_result (1 + 3,4, 4,5,"+");
+check_result (3,4 + 1, 4,5,"+");
+
+check_result (1,2 - 3,4, -2,-2,"-");
+check_result (1 - 3,4, -2,-3,"-");
+check_result (3,4 - 1, 2,3,"-");
+
+check_result (1,2 * 3,4, 3,8, "*");
+check_result (1 * 3,4, 3,4, "*");
+check_result (3,4 * 1, 3,4, "*");
+
+check_result (12,24 / 3,4, 4,6,"/");
+check_result (12 / 3,4, 4,3,"/");
+check_result (3,4 / 1, 3,4,"/");
+
+check_result (1,2 mod 3,4, 1,2,"mod");
+check_result (3 mod 3,2, 0,1,"mod");
+check_result (3,4 mod 4, 3,0,"mod");
+
+check_result (1,2 == 3,2, 0,1,"==");
+check_result (3 == 3,4, 1,0,"==");
+check_result (3,4 == 1, 0,0,"==");
+
+check_result (1,2 != 3,2, 1,0,"!=");
+check_result (3 != 3,4, 0,1,"!=");
+check_result (3,4 != 1, 1,1,"!=");
+
+check_result (1,2 > 3,2, 0,0,">");
+check_result (1 > 3,4, 0,0,">");
+check_result (3,4 > 1, 1,1,">");
+
+check_result (1,2 >= 3,2, 0,1,">=");
+check_result (1 >= 3,4, 0,0,">=");
+check_result (3,4 >= 1, 1,1,">=");
+
+check_result (1,2 >= 3,2, 0,1,">=");
+check_result (1 >= 3,4, 0,0,">=");
+check_result (3,4 >= 1, 1,1,">=");
+
+check_result (1,2 < 3,2, 1,0,"<");
+check_result (1 < 3,4, 1,1,"<");
+check_result (3,4 < 1, 0,0,"<");
+
+check_result (1,2 <= 3,2, 1,1,"<=");
+check_result (1 <= 3,4, 1,1,"<=");
+check_result (3,4 <= 1, 0,0,"<=");
+#ifexists Double_Type
+check_result (1,2 ^ 3,2, 1,4,"^");
+check_result (1 ^ 3,4, 1,1,"^");
+check_result (3,4 ^ 1, 3,4,"^");
+check_result (3,4 ^ 0, 1,1,"^");
+#endif
+check_result (1,2 or 3,2, 1,1,"or");
+check_result (1 or 3,4, 1,1,"or");
+check_result (0,1 or 1, 1,1,"or");
+
+check_result (1,2 and 3,2, 1,1,"and");
+check_result (1 and 0,4, 0,1,"and");
+check_result (3,4 and 0, 0,0,"and");
+
+check_result (1,2 & 3,2, 1,2,"&");
+check_result (1 & 3,4, 1,0,"&");
+check_result (3,4 & 1, 1,0,"&");
+
+check_result (1,2 | 3,2, 3,2,"|");
+check_result (1 | 3,4, 3,5,"|");
+check_result (3,4 | 1, 3,5,"|");
+
+check_result (1,2 xor 3,2, 2,0,"xor");
+check_result (1 xor 3,4, 2,5,"xor");
+check_result (3,4 xor 1, 2,5,"xor");
+
+check_result (1,2 shl 3,2, 8,8,"shl");
+check_result (1 shl 3,4, 8,16,"shl");
+check_result (3,4 shl 1, 6,8,"shl");
+
+check_result (1,4 shr 3,1, 0,2,"shr");
+check_result (8 shr 3,4, 1,0,"shr");
+check_result (3,4 shr 1, 1,2,"shr");
+
+% Test __tmp optimizations
+private define test_tmp ()
+{
+ variable x = 1:100;
+ x = 1*__tmp(x)*1 + 1;
+ if (neqs (x), 2:101)
+ failed ("__tmp optimizations");
+}
+
+private define ones ()
+{
+ variable a;
+
+ a = __pop_args (_NARGS);
+ return @Array_Type (Integer_Type, __push_args (a)) + 1;
+}
+
+variable X = ones (5, 10);
+
+(dims,,) = array_info (X);
+if ((dims0 != 5) or (dims1 != 10))
+ failed ("ones dims: %S,%S", dims0, dims1);
+if (length (where (X != 1)))
+ failed ("ones 1");
+
+define test_assignments (x, i, a)
+{
+ variable y, z;
+
+ y = @x; z = @x; yi += a; zi = zi + a; check_result (y, z, "+=");
+ y = @x; z = @x; yi -= a; zi = zi - a; check_result (y, z, "-=");
+ y = @x; z = @x; yi /= a; zi = zi / a; check_result (y, z, "/=");
+ y = @x; z = @x; yi *= a; zi = zi * a; check_result (y, z, "*=");
+
+ y = @x; z = @x; yi++; zi = zi + 1; check_result (y, z, "++");
+ y = @x; z = @x; yi--; zi = zi - 1; check_result (y, z, "--");
+}
+
+test_assignments (1:10, 3, 5);
+test_assignments (1:10, 3, 5);
+test_assignments (1:10, 1,3,5, 5);
+test_assignments (1:10, 0:4, 5);
+test_assignments (1:10, 0:, 5);
+test_assignments (1:10, :, 5);
+test_assignments (1:10, *, 5);
+
+% Test semi-open intervals
+define test_semiopen (a, b, dx, n)
+{
+ variable last, first;
+ variable aa = a:b:dx;
+
+ if (length (aa) != n)
+ failed ("test_semiopen (%S,%S,%S,%S): length==>%d", a, b, dx, n, length(aa));
+
+ if (n == 0)
+ return;
+
+ first = aa0;
+ if (first != a)
+ failed ("test_semiopen (%S,%S,%S,%S): first", a, b, dx, n);
+
+ last = a-1;
+ if (dx > 0)
+ {
+	if (last >= b)
+	 failed ("test_semiopen (%S,%S,%S,%S): last", a, b, dx, n);
+ }
+ else if (last <= b)
+	 failed ("test_semiopen (%S,%S,%S,%S): last", a, b, dx, n);
+}
+#ifexists Double_Type
+test_semiopen (1.0, 10.0, 1.0, 9);
+test_semiopen (1.0, 1.0, 12.0, 0);
+test_semiopen (1.0, 1.2, -1.0, 0);
+test_semiopen (1.0, 0.0, -1.0, 1);
+test_semiopen (1.0, -0.0001, -1.0, 2);
+#endif
+
+private define test_inline_array (a, type)
+{
+ if (_typeof (a) != type)
+ failed ("test_inline_array: %S is not %S type", a, type);
+}
+
+test_inline_array (1,2,3, Int_Type);
+test_inline_array (1L,2L,3L, Long_Type);
+test_inline_array (1h,2h,3h, Short_Type);
+#ifexists Double_Type
+test_inline_array (1f, 0, 0, Float_Type);
+test_inline_array (1f, 0.0, 0h, Double_Type);
+#endif
+#ifexists Complex_Type
+test_inline_array (1f, 0.0, 0i, Complex_Type);
+test_inline_array (1i, 0h, 0i, Complex_Type);
+test_inline_array (0h, 0i, Complex_Type);
+test_inline_array (0i, 0i, Complex_Type);
+#endif
+test_inline_array ("a", "b", String_Type);
+
+A = String_Type10;
+A* = "a";
+if ("aaaaaaaaaa" != strjoin (A, ""))
+ failed ("A*");
+A5 = NULL;
+if ((A5 != NULL)
+ or ("aaaaaaaaa" != strjoin (A0,1,2,3,4,6,7,8,9, "")))
+ failed ("A5 != NULL");
+
+A1 = NULL;
+if ((length(where(_isnull(A))) != 2)
+ or (where (_isnull(A))0 != 1)
+ or (where (_isnull(A))1 != 5))
+ failed ("_isnull: %S", where(_isnull(A))1 != 5);
+
+A = NULL; if (_isnull(A) == 0) failed ("_isnull(NULL)");
+A = Null_Type10;
+ifnot (all(_isnull (A))) failed ("_isnull(Null_Type10)");
+if (length (_isnull(A)) != length(A)) failed ("length _isnull(Null_Type10)");
+
+A = String_Type10;
+A* = "a";
+if ("aaaaaaaaaa" != strjoin (A, ""))
+ failed ("A5=a");
+A3,7 = NULL;
+if ((A3 != NULL) or (A7 != NULL)
+ or ("aaaaaaaa" != strjoin (A0,1,2,4,5,6,8,9, "")))
+ failed ("A3,7=NULL");
+
+A = String_Type10;
+A* = "a";
+A1 = NULL;
+if (length (where (A != String_Type10)) != 9)
+ failed ("A != String_Type10");
+
+
+
+private define test_indexing_with_1_index ()
+{
+ variable n = 10;
+ variable a = Double_Typen,n;
+ variable i = 0:n*n-1:n+1;
+ variable ai = ai;
+ if (0 == _eqs (ai, a0:n*n-1:n+1))
+ failed ("ai != a0:n*n-1:n+1");
+ i = 0,11,22,33,44,55,66,77,88,99;
+ if (0 == _eqs (ai, ai))
+ failed ("ai != ai");
+ ai = a0,0,a1,1,a2,2,a3,3,a4,4,
+	 a5,5,a6,6,a7,7,a8,8,a9,9;
+ if (0 == _eqs (ai, ai))
+ failed ("a0,0,...,a9,9 != ai");
+
+ reshape (a, n*n);
+ i = -1;
+ if ((a-1 != ai) || (a-1 != ai+length(a)))
+ failed ("ai != a%d, with i==%d", i, i);
+
+ i = -2;
+ if ((a-2 != ai) || (a-2 != ai+length(a)))
+ failed ("ai != a%d, with i==%d", i, i);
+
+ i = 1;
+ if ((a1 != ai) || (a1 != ai-length(a)))
+ failed ("ai != a%d, with i==%d", i, i);
+}
+test_indexing_with_1_index ();
+
+private define test_index_arrays ()
+{
+ foreach (Util_Arith_Types)
+ {
+	variable s = ();
+	variable x = typecast (1:10, s);
+	variable y = typecast (1,3,5,7,9, s);
+	variable i = 0::2;
+	foreach (Util_Arith_Types)
+	 {
+	 variable t = ();
+	 if (1 != __is_numeric(t))
+	 continue;
+	 variable ii = typecast (i, t);
+	 ifnot (_eqs (y, xi))
+	 failed ("get with index array of type %S", t);
+	 variable z = Int_Type10;
+	 zii = y;
+	 ifnot (_eqs (y, zii))
+	 failed ("put with index array of type %S", t);
+	 }
+ }
+}
+test_index_arrays ();
+
+% Test array summing operations
+#ifexists Double_Type
+private define compute_sum (a, n)
+{
+ variable s = 0;
+ variable b;
+ variable i, j, k;
+ variable dims;
+
+ (dims,,) = array_info (a);
+ if (n == 0)
+ {
+	b = Double_Typedims1,dims2;
+	for (i = 0; i < dims1; i++)
+	 {
+	 for (j = 0; j < dims2; j++)
+	 {
+		 for (k = 0; k < dimsn; k++)
+		 bi,j += ak,i,j;
+	 }
+	 }
+	return b;
+ }
+ if (n == 1)
+ {
+	b = Double_Typedims0,dims2;
+	for (i = 0; i < dims0; i++)
+	 {
+	 for (j = 0; j < dims2; j++)
+	 {
+		 for (k = 0; k < dimsn; k++)
+		 bi,j += ai,k,j;
+	 }
+	 }
+	return b;
+ }
+ if (n == 2)
+ {
+	b = Double_Typedims0,dims1;
+	for (i = 0; i < dims0; i++)
+	 {
+	 for (j = 0; j < dims1; j++)
+	 {
+		 for (k = 0; k < dimsn; k++)
+		 bi,j += ai,j,k;
+	 }
+	 }
+	return b;
+ }
+
+ b = 0.0;
+ for (i = 0; i < dims0; i++)
+ {
+	for (j = 0; j < dims1; j++)
+	 {
+	 for (k = 0; k < dims2; k++)
+	 b += ai,j,k;
+	 }
+ }
+ return b;
+}
+
+A = 1:3*4*5;
+reshape (A, 3,4,5);
+
+define test_sum (a, n)
+{
+ variable s1, s2;
+
+ if (n == -1)
+ s1 = sum(A);
+ else
+ s1 = sum(A,n);
+
+ s2 = compute_sum (A, n);
+
+ if (neqs (s1, s2))
+ {
+	failed ("sum(A,%d): %S != %S: %g != %g", n, s1, s2, s10,0, s20,0);
+ }
+}
+
+test_sum (A,-1);
+test_sum (A,2);
+test_sum (A,1);
+test_sum (A,0);
+
+A = 1+2i, 2+3i, 3+4i;
+if (sum(A) != A0 + A1 + A2)
+ failed ("sum(Complex)");
+#endif				 % Double_Type
+
+define find_min (a)
+{
+ %a = awhere(not isnan(a));
+ a = awherenot (isnan(a));
+ variable m = a0;
+ _for (1, length(a)-1, 1)
+ {
+	variable i = ();
+	if (ai < m)
+	 m = ai;
+ }
+ return m;
+}
+
+define find_max (a)
+{
+ a = awhere (not isnan(a));
+ variable m = a0;
+ _for (1, length(a)-1, 1)
+ {
+	variable i = ();
+	if (ai > m)
+	 m = ai;
+ }
+ return m;
+}
+
+define test_eqs (what, a, b)
+{
+ if (_typeof(a) != _typeof(b))
+ failed ("%s: %S != %S", what, a, b);
+
+ if (neqs (a, b))
+ failed ("%s: %S != %S", what, a, b);
+}
+
+private define shuffle (a)
+{
+ variable i, n = length (a);
+ variable list = {};
+ _for i (0, n-1, 1)
+ list_append (list, ai);
+
+ variable b = @a;
+ i = 0;
+ do
+ {
+	variable j = int (n*urand ());
+	bi = sign (0.5-urand()) * list_pop (list, j);
+	n--; i++;
+ }
+ while (n);
+ return b;
+}
+
+private define test_min_maxabs (a)
+{
+ a = shuffle (a);
+ test_eqs ("minabs", minabs(a), min(abs(a)));
+ test_eqs ("maxabs", maxabs(a), max(abs(a)));
+}
+
+A = 1:10;
+test_eqs ("min", min(A), find_min(A));
+test_eqs ("max", max(A), find_max(A));
+test_min_maxabs(A);
+#ifexists Double_Type
+A *= 1.0f;
+test_eqs ("min", min(A), find_min(A));
+test_eqs ("max", max(A), find_max(A));
+test_min_maxabs(A);
+A *= 1.0;
+test_eqs ("min", min(A), find_min(A));
+test_eqs ("max", max(A), find_max(A));
+test_min_maxabs(A);
+#endif
+A = 1h:10h;
+test_eqs ("min", min(A), find_min(A));
+test_eqs ("max", max(A), find_max(A));
+test_min_maxabs(A);
+A = '0':'9';
+test_eqs ("min", min(A), find_min(A));
+test_eqs ("max", max(A), find_max(A));
+test_min_maxabs(A);
+
+A = 1.0:10; A0 = _NaN;
+test_eqs ("min", min(A), find_min(A));
+test_eqs ("max", max(A), find_max(A));
+test_min_maxabs(A);
+
+A = 1.0:10; A-1 = _NaN;
+test_eqs ("min", min(A), find_min(A));
+test_eqs ("max", max(A), find_max(A));
+test_min_maxabs(A);
+
+A = 1.0:10; A3 = _NaN;
+test_eqs ("min", min(A), find_min(A));
+test_eqs ("max", max(A), find_max(A));
+test_min_maxabs(A);
+
+private define test_eqsmin_max_all_types (A)
+{
+ foreach (Util_Arith_Types)
+ {
+	variable t = ();
+	variable b = typecast (A, t);
+	test_eqs ("min", min(b), find_min(b));
+	test_eqs ("max", max(b), find_max(b));
+	test_min_maxabs(b);
+ }
+}
+test_eqsmin_max_all_types (10:20);
+
+if ((_min(2, 1) != 1) or (_min(1,2) != 1))
+ failed ("_min");
+if ((_max(2, 1) != 2) or (_max(1,2) != 2))
+ failed ("_max");
+
+A=Int_Type10,10;
+A*,* = 0:99;
+if (length (A0:99:11) != 10)
+ failed ("A0:99:11");
+
+if ((_min(_NaN, 1) != 1) or (_min(1,_NaN) != 1))
+ failed ("_min with NaN");
+if ((_max(_NaN, 1) != 1) or (_max(1,_NaN) != 1))
+ failed ("_max with NaN");
+
+#ifexists cumsum
+private define do_cumsum (a)
+{
+ variable b = 1.0 * a;
+ variable i, s;
+
+ s = 0;
+ _for (0, length(a)-1, 1)
+ {
+	i = ();
+	s += ai;
+	bi = s;
+ }
+ return b;
+}
+
+private define test_cumsum (a, k, result_type)
+{
+ variable b = 1.0 * a;
+ variable bb;
+
+ variable dims, ndims;
+ variable i, j;
+ (dims, ndims, ) = array_info (a);
+
+ if (k != -1)
+ bb = cumsum (a, k);
+ else
+ bb = cumsum (a);
+
+ if (_typeof (bb) != result_type)
+ {
+	failed ("cumsum(%S) has wrong return type (%S)", a, b);
+ }
+#ifexists Complex_Type
+ if ((_typeof (a) != Complex_Type) and (_typeof (a) != Float_Type))
+#endif
+ a = typecast (a, Double_Type);
+
+ if (k == -1)
+ {
+	b = do_cumsum (_reshape (a, length(a)));
+ }
+ else switch (ndims)
+ {
+ case 1:
+	b = cumsum (a);
+ }
+ {
+ case 2:
+	if (k == 0)
+	 {
+	 %a_j = cumsum_i a_ij
+	 _for (0, dims1-1, 1)
+	 {
+		 j = ();
+		 b*, j = do_cumsum (a*, j);
+	 }
+	 }
+	else
+	 {
+	 _for (0, dims1-1, 1)
+	 {
+		 i = ();
+		 bi, * = do_cumsum (ai, *);
+	 }
+	 }
+ }
+ {
+ case 3:
+	if (k == 0)
+	 {
+	 %a_j = cumsum_i a_ij
+	 _for (0, dims1-1, 1)
+	 {
+		 i = ();
+		 _for (0, dims2-1, 1)
+		 {
+		 j = ();
+		 b*, i, j = do_cumsum (a*, i, j);
+		 }
+	 }
+	 }
+	else if (k == 1)
+	 {
+	 _for (0, dims0-1, 1)
+	 {
+		 i = ();
+		 _for (0, dims2-1, 1)
+		 {
+		 j = ();
+		 bi, *, j = do_cumsum (ai, *, j);
+		 }
+	 }
+	 }
+	else
+	 {
+	 _for (0, dims0-1, 1)
+	 {
+		 i = ();
+		 _for (0, dims1-1, 1)
+		 {
+		 j = ();
+		 bi, j, * = do_cumsum (ai, j, *);
+		 }
+	 }
+	 }
+ }
+
+ if (neqs (b, bb))
+ {
+	failed ("cumsum (%S, %d), expected %S, got %S", a, k, b, bb);
+ }
+}
+
+A = Int_Type10; A* = 1;
+test_cumsum (A, -1, Double_Type);
+test_cumsum (A, 0, Double_Type);
+A = 1:3*4*5;
+reshape (A, 3,4,5);
+test_cumsum (A, -1, Double_Type);
+test_cumsum (A, 0, Double_Type);
+test_cumsum (A, 1, Double_Type);
+test_cumsum (A, 2, Double_Type);
+
+A = Char_Type10; A* = 1;
+test_cumsum (A, -1, Float_Type);
+test_cumsum (A, 0, Float_Type);
+A = 1:3*4*5; A = typecast (A, Char_Type);
+reshape (A, 3,4,5);
+test_cumsum (A, -1, Float_Type);
+test_cumsum (A, 0, Float_Type);
+test_cumsum (A, 1, Float_Type);
+test_cumsum (A, 2, Float_Type);
+
+A = UChar_Type10; A* = 1;
+test_cumsum (A, -1, Float_Type);
+test_cumsum (A, 0, Float_Type);
+A = 1:3*4*5; A = typecast (A, UChar_Type);
+reshape (A, 3,4,5);
+test_cumsum (A, -1, Float_Type);
+test_cumsum (A, 0, Float_Type);
+test_cumsum (A, 1, Float_Type);
+test_cumsum (A, 2, Float_Type);
+
+A = Short_Type10; A* = 1;
+test_cumsum (A, -1, Float_Type);
+test_cumsum (A, 0, Float_Type);
+A = 1:3*4*5; A = typecast (A, Short_Type);
+reshape (A, 3,4,5);
+test_cumsum (A, -1, Float_Type);
+test_cumsum (A, 0, Float_Type);
+test_cumsum (A, 1, Float_Type);
+test_cumsum (A, 2, Float_Type);
+
+A = UShort_Type10; A* = 1;
+test_cumsum (A, -1, Float_Type);
+test_cumsum (A, 0, Float_Type);
+A = 1:3*4*5; A = typecast (A, UShort_Type);
+reshape (A, 3,4,5);
+test_cumsum (A, -1, Float_Type);
+test_cumsum (A, 0, Float_Type);
+test_cumsum (A, 1, Float_Type);
+test_cumsum (A, 2, Float_Type);
+
+A = Float_Type10; A* = 1;
+test_cumsum (A, -1, Float_Type);
+test_cumsum (A, 0, Float_Type);
+A = 1:3*4*5*1.0f;
+reshape (A, 3,4,5);
+test_cumsum (A, -1, Float_Type);
+test_cumsum (A, 0, Float_Type);
+test_cumsum (A, 1, Float_Type);
+test_cumsum (A, 2, Float_Type);
+
+#ifexists Complex_Type
+A = Complex_Type10; A* = 1;
+test_cumsum (A, -1, Complex_Type);
+test_cumsum (A, 0, Complex_Type);
+A = 1:3*4*5 + 2i*1:3*4*5;
+reshape (A, 3,4,5);
+test_cumsum (A, -1, Complex_Type);
+test_cumsum (A, 0, Complex_Type);
+test_cumsum (A, 1, Complex_Type);
+test_cumsum (A, 2, Complex_Type);
+#endif
+
+#endif
+
+private variable I;
+A=1:100;
+I = Int_Type3,3;
+if (neqs (array_dims (AI), array_dims(I)))
+ failed ("AI 3x3 dims");
+I = Int_Type0,0;
+if (neqs (array_dims (AI), array_dims(I)))
+ failed ("AI 0x0 dims");
+
+A =_reshape (1:100, 5,20);
+I = Int_Type3,3;
+if (neqs (array_dims (AI), array_dims(I)))
+ failed ("AI 3x3 dims");
+I = Int_Type0,0;
+if (neqs (array_dims (AI), array_dims(I)))
+ failed ("AI 0x0 dims");
+if (neqs (A0,*, 1:20))
+ failed ("A0,*");
+if (neqs (A-1,*, 81:100))
+ failed ("A-1,*");
+I = _reshape (20,30,40,50, 2,2);
+if (neqs (AI, _reshape (21,31,41,51,2,2)))
+ failed ("AI for 20,30;40,50");
+#iffalse
+if (length (A-1:0) != 0)
+ failed ("A-1:0");
+#else
+if (length (A99:0) != 0)
+ failed ("A99:0");
+#endif
+
+% Now test the examples from the documentation
+
+define test_example ()
+{
+ variable a = Integer_Type 10, 10;
+ variable j;
+ for (j = 0; j < 10; j++) aj, j = 5;
+
+ variable b = Integer_Type 10, 10;
+ j = 0:99:11;
+ bj = 5;
+
+ if (0 == _eqs (a, b))
+ failed ("Example 1");
+}
+test_example ();
+
+#ifexists array_swap
+private define test_array_swap (a, i, j)
+{
+ variable b = @a;
+ array_swap (a, i, j);
+ (bi, bj) = (bj, bi);
+ if (0 == _eqs (a, b))
+ failed ("array_swap");
+}
+test_array_swap (1:5, 0, 0);
+test_array_swap (1:5, 0, 1);
+test_array_swap (1:5, 0, -1);
+test_array_swap (1:5, -2, -1);
+test_array_swap (1:5, 3, 4);
+test_array_swap ("ab", "cd", "ef", "gh", "ij", 3, 4);
+#endif
+
+#ifexists array_reverse
+private define test_array_reverse (a, i, j)
+{
+ variable b = @a;
+ if (i == NULL)
+ {
+	array_reverse (a);
+	i = 0;
+	j = length (a)-1;
+ }
+ else
+ array_reverse (a, i, j);
+
+ bi:j = bj:i:-1;
+ if (0 == _eqs (a, b))
+ failed ("array_reverse");
+}
+test_array_reverse (1:5, 0, 0);
+test_array_reverse (1, 0, 0);
+test_array_reverse (1:5, 2, 3);
+test_array_reverse (1:5, 4, 4);
+test_array_reverse (1:5, 3, 4);
+test_array_reverse (1:5, 0, 1);
+test_array_reverse (1:5, NULL, 1);
+test_array_reverse ("ab", "cd", "ef", "gh", "ij", 3, 4);
+test_array_reverse ("ab", "cd", "ef", "gh", "ij", NULL, 4);
+
+private define test_2darray_reverse (a, i, j, dim)
+{
+ variable b = @a;
+ try
+ {
+	if (i == NULL)
+	 {
+	 array_reverse (a, dim);
+	 i = 0;
+	 variable dims;
+	 (dims,,) = array_info (a);
+	 j = dimsdim-1;
+	 }
+	else
+	 array_reverse (a, i, j, dim);
+ }
+ catch NotImplementedError: return;
+
+ if (dim == 0)
+ b*, i:j = b*, j:i:-1;
+ else
+ bi:j, * = bj:i:-1, *;
+ if (0 == _eqs (a, b))
+ failed ("array_reverse 2d");
+}
+
+test_2darray_reverse (_reshape (1:3*4, 3,4), NULL, NULL, 0);
+test_2darray_reverse (_reshape (1:3*4, 3,4), NULL, NULL, 1);
+test_2darray_reverse (_reshape (1:3*4, 3,4), 1,2, 0);
+test_2darray_reverse (_reshape (1:3*4, 3,4), 1,3, 1);
+#endif
+
+#ifexists __aget
+private define test_aget ()
+{
+ variable a, indices;
+ indices = __pop_args (_NARGS-1);
+ a = ();
+
+ if (__aget (a, __push_args(indices)) != a__push_args(indices))
+ failed ("aget");
+
+ try
+ {
+	__aget (a);
+ }
+ catch IndexError;
+ try
+ {
+	__aget (a, __push_args(indices), 1);
+ }
+ catch IndexError;
+}
+
+private variable A = 1:3*7*11;
+test_aget (A, 3*4*5);
+test_aget (A, -1);
+test_aget (A, -20);
+test_aget (A, -20);
+reshape (A, 3,7,11);
+test_aget (A, -1,-1,-1);
+test_aget (A, 0,0,0);
+test_aget (A, 1,3,5);
+
+private define test_aput ()
+{
+ variable a, x, indices;
+
+ % test_aput (val, a, indices);
+ indices = __pop_args (_NARGS-2);
+ (x,a) = ();
+
+ __aput (x, a, __push_args(indices));
+ if (not _eqs (a__push_args(indices), x))
+ failed ("aget");
+
+ try
+ {
+	__aput (x, a);
+ }
+ catch IndexError;
+ try
+ {
+	__aput (x, a, __push_args(indices), 1);
+ }
+ catch IndexError;
+}
+
+private variable A = 1:3*7*11;
+test_aput (1023, A, 3*4*5);
+test_aput (1024, A, -1);
+test_aput (1024, A, -20);
+test_aput (1024, A, -20);
+reshape (A, 3,7,11);
+test_aput (1024, A, -1,-1,-1);
+test_aput (1035, A, 0,0,0);
+
+A = "foo", "bar", "bob";
+test_aput ("goober", A, -1);
+test_aput ("goober", A, 0);
+A = Array_Type 4;
+test_aput (1:4, A, 2);
+#endif
+
+A = Int_Type2,3,4;
+A* = 1:24;
+if (neqs (A0,0,*, 1,2,3,4))
+ failed ("A*=1:24;A0,0,*");
+if (neqs (A, _reshape(1:24, 2,3,4)))
+ failed ("A*=1:24");
+if (neqs(A0,0,-2:3,3,4,1,2,3,4))
+ failed ("A0,0,-2:3");
+if (neqs (A,A*,*,*))
+ failed ("A*,*,*");
+
+A = 1:10;
+A0:9 += 1;
+if (not _eqs (A, 2:11))
+ failed ("A0:9 += 1");
+A0:9 += A0:9;
+if (not (_eqs (A, 2:11*2)))
+ failed ("A0:9 += A0:9");
+
+A = 1:10;
+A* += 1;
+if (not _eqs (A, 2:11))
+ failed ("A* += 1");
+A* += A*;
+if (not (_eqs (A, 2:11*2)))
+ failed ("A* += A*");
+
+private define index_random ()
+{
+ variable a = 1:60;
+ variable n = Int_Type83; n* = 70;
+ loop (5)
+ {
+	try
+	 {
+	 i = array_map (Double_Type, &random, n);
+	 i = int (i*2-70);
+	 () = ai;
+	 }
+	catch IndexError;
+ }
+}
+index_random ();
+
+% Finally make sure 0 a 0 increment is not allowed
+try
+{
+ () = 1:10:0;
+ failed ("range array with 0 increment");
+
+}
+catch InvalidParmError;
+
+private define test_any_1 (astr, ans)
+{
+ variable ans1 = any(eval(astr));
+ if (ans != ans1)
+ failed ("any(%S) != %S", astr, ans);
+ if (typeof (ans1) != Char_Type)
+ failed ("any(%S) returned %S", astr, typeof(ans1));
+}
+private define test_all_1 (astr, ans)
+{
+ variable ans1 = all(eval(astr));
+ if (ans != ans1)
+ failed ("all(%S) != %S", astr, ans);
+ if (typeof (ans1) != Char_Type)
+ failed ("all(%S) returned %S", astr, typeof(ans1));
+}
+
+private define test_any_or_all (fun, astr, ans)
+{
+ foreach (Util_Arith_Types)
+ {
+	variable t = ();
+	(@fun) ("typecast ($astr, $t);"$, ans);
+ }
+}
+
+private define test_any (astr, ans)
+{
+ test_any_or_all (&test_any_1, astr, ans);
+}
+
+private define test_all (astr, ans)
+{
+ test_any_or_all (&test_all_1, astr, ans);
+}
+
+test_any ("0,0,0,0", 0);
+test_any ("0,0,0,1", 1);
+test_any ("0,0,1,0", 1);
+test_any ("0,1,0,0", 1);
+test_any ("1,0,0,0", 1);
+test_any ("0", 0);
+test_any ("1", 1);
+test_any ("Int_Type0", 0);
+
+test_all ("0,0,0,0", 0);
+test_all ("0,0,0,1", 0);
+test_all ("0,0,1,0", 0);
+test_all ("0,1,0,0", 0);
+test_all ("1,0,0,0", 0);
+test_all ("0", 0);
+test_all ("1", 1);
+test_all ("1,1,1,1", 1);
+test_all ("1,1,1,0", 0);
+test_all ("1,1,0,1", 0);
+test_all ("1,0,1,1", 0);
+test_all ("0,1,1,1", 0);
+test_all ("Int_Type0", 0);
+
+test_all_1 ("1.0,_NaN", 1);
+test_any_1 ("1.0,_NaN", 1);
+test_any_1 ("_NaN", 0);
+test_all_1 ("_NaN", 1);
+
+define test_where_first_last (a)
+{
+ variable i = where (a);
+ variable i0 = wherefirst (a);
+ variable i1 = wherelast (a);
+
+ if (length (i) == 0)
+ {
+	if ((i0 != NULL) or (i1 != NULL))
+	 failed ("Expected wherefirst/wherelast to return NULL");
+	return;
+ }
+ if (i0 != i0)
+ failed ("wherefirst");
+ if (i1 != i-1)
+ failed ("wherelast");
+
+ i0 = wherefirst (a, 0);
+ i1 = wherelast (a, -1);
+
+ if (i0 != i0)
+ failed ("wherefirst 0");
+ if (i1 != i-1)
+ failed ("wherelast -1");
+
+ i0 = wherefirst (a, i0);
+ i1 = wherelast (a, i1);
+ if (i0 != i0)
+ failed ("wherefirst i0");
+ if (i1 != i-1)
+ failed ("wherelast i1");
+}
+
+test_where_first_last (1:10 == 1);
+test_where_first_last (1:10 == -1);
+test_where_first_last (1:10 == 2);
+test_where_first_last (1:10 == 10);
+test_where_first_last (1:10 == 9);
+test_where_first_last (1:10 > 1);
+test_where_first_last (1:10 < 10);
+test_where_first_last (1:10 == 5);
+test_where_first_last (1:10 mod 2);
+test_where_first_last (1:10 mod 3);
+
+test_where_first_last (0:-1 == 1);
+
+if (length (1,2,) != 2)
+ failed ("2-element array with trailing comma has wrong length");
+if (length (1,) != 1)
+ failed ("1-element array with trailing comma has wrong length");
+
+try
+{
+ eval("() = ,;");
+ failed ("Illegal commas in array not caught");
+ eval("() = 1,,;");
+ failed ("Illegal commas in array not caught");
+ eval("() = 1,2,,;");
+ failed ("Illegal commas in array not caught");
+}
+catch SyntaxError;
+
+% inline array of different types
+private define test_array_types (a, b)
+{
+ variable t = typeof (a+b);
+
+ if ((t != _typeof (a,b))
+ or (t != _typeof (a,b))
+ or (t != _typeof (a,b))
+ or (t != _typeof (a,b))
+ or (t != _typeof (b,a))
+ or (t != _typeof (b,a))
+ or (t != _typeof (b,a)))
+ {
+	failed ("array of %S and %S not of expected type %S", typeof(a), typeof(b));
+ }
+}
+
+test_array_types (1h, 1L);
+test_array_types (1h, 1f);
+test_array_types (1h, 1.0);
+test_array_types (1h, 1j);
+test_array_types ("a", "a\0");
+
+% Test presence of NULLs in inline arrays
+private define test_nulls_in_array (arr, is_good)
+{
+ try
+ {
+	eval ("()=" + arr);
+	if (is_good)
+	 return;
+	failed ("%s should have generated an error", arr);
+ }
+ catch TypeMismatchError:
+ {
+	if (is_good)
+	 failed ("typemismatch evaluating %s", arr);
+ }
+}
+
+test_nulls_in_array ("NULL, &sin", 1);
+test_nulls_in_array ("&sin, NULL", 1);
+test_nulls_in_array ("&sin, NULL,NULL,NULL,NULL", 1);
+test_nulls_in_array ("NULL,NULL,&sin,NULL,NULL", 1);
+test_nulls_in_array ("NULL,NULL,&sin,&sin,NULL", 1);
+test_nulls_in_array ("1,2,NULL", 0);
+test_nulls_in_array ("1,NULL", 0);
+test_nulls_in_array ("1,NULL,", 0);
+test_nulls_in_array ("1,NULL,2", 0);
+
+define test_bool_ops ()
+{
+ variable a = typecast (1,2,3,4,0, Char_Type);
+ variable b = typecast (1,2,0,5,0, Char_Type);
+ variable i = where (a == b);
+ if (0 == eqs (i, 0,1,4))
+ failed ("test_bool_ops: a==b");
+ i = where (a != b);
+ if (0 == eqs (i, 2,3))
+ failed ("test_bool_ops: a!=b");
+ i = where (a or b);
+ if (0 == eqs (i, 0,1,2,3))
+ failed ("test_bool_ops: a or b");
+ i = where (a and b);
+ if (0 == eqs (i, 0,1,3))
+ failed ("test_bool_ops: a and b");
+}
+test_bool_ops ();
+
+private define test_where_2_args (a)
+{
+ variable i0, j0, i1, j1;
+ i0 = where (a);
+ j0 = wherenot(a);
+ i1 = where (a, &j1);
+
+ if ((not eqs (i0, i1)) or (not eqs (j0, j1)))
+ {
+	failed ("where_2_args");
+ }
+}
+
+test_where_2_args ((1:10 mod 2)==0);
+test_where_2_args ((1:10 mod 2)==1);
+test_where_2_args ((1:10 mod 3)==0);
+test_where_2_args ((1:10 mod 3)==1);
+test_where_2_args ((1:10 mod 3)==2);
+test_where_2_args ((1:-1 mod 2)==2);
+
+private define test_arrayn (a, b, n)
+{
+ variable a0;
+
+ if (n == 1)
+ a0 = a;
+ else
+ a0 = a + (0:n-1)*((b-a)/double(n-1));
+ variable a1 = a:b:#n;
+
+ if ((typeof (a) == Float_Type) && (_typeof(a1) != Float_Type))
+ {
+	failed ("Expecting %g:%g:#%g to be Float_Type", a,b,n);
+ }
+
+ if (n <= 0)
+ {
+	if (length (a1) != 0)
+	 failed ("expecting $a:$b:$n to have 0 length"$);
+	return;
+ }
+
+ variable tol = 1e15;
+
+ tol = 1e-15;
+ if (max (_diff(a1,a0)>tol*abs(a)))
+ failed ("$a:$b:$n max_diff=%g"$, max(_diff(a1,a0)));
+}
+
+test_arrayn (1,10, 1);
+test_arrayn (1,10, 10);
+test_arrayn (1,20, 10);
+test_arrayn (-5, 5, 10);
+test_arrayn (33.1, 45.0, 2048);
+test_arrayn (33.1, 45.0, 0);
+test_arrayn (33.1, 45.0, -5);
+test_arrayn (0f,255f,256);
+
+private define test_array_refs ()
+{
+ variable a = String_Type10, 10;
+ variable r = &a5,5;
+
+ @r = "foo";
+ if (a5,5 != "foo")
+ failed ("&a5,5");
+
+ r = &a2,3,4,5,6;
+ @r = "1x", "2x", "3x", "4x", "5x","6x";
+ if ((a2,4 != "1x") or (a3,6 != "6x"))
+ failed ("&a2,3,4,5,6");
+
+ ifnot (_eqs (@r, _reshape ("1x", "2x", "3x", "4x", "5x","6x", 2,3)))
+ {
+	failed ("@r = %S did not produce expected result", @r);
+ }
+}
+test_array_refs ();
+
+define test_string_array()
+{
+ variable i, n = 20, m = 10;
+ variable A = String_Typen;
+ A* = "foo";
+ ifnot (all (A == "foo"))
+ failed ("A*=\"foo\"");
+ A0:n-1 = "bar";
+ ifnot (all (A == "bar"))
+ failed ("A0:n-1=\"foo\"");
+
+ A0::2 = "ebar";
+ i = where (A=="ebar");
+ if (length (i) != n/2)
+ failed ("A0::2=ebar");
+ if (any(i mod 2))
+ failed ("A0::2=ebar (mod)");
+
+ variable B = String_Typen,m;
+ B0::2,* = "foo";
+ ifnot (all(_isnull (B1::2,*)))
+ failed ("B0::2,*=foo");
+ B*,1 = A;
+ ifnot (_eqs(B*,1, A))
+ failed ("B*,1=A");
+ A = transpose(B*,:);
+ variable C = @A;
+ C*,* = transpose(B);
+ ifnot (_eqs(C3,1,3,5,6, A3,1,3,5,6))
+ failed ("transpose(B*,:)");
+ ifnot (_eqs(C1:3,5:7, A1,2,3,5,6,7))
+ failed ("transpose(B*,:, test2");
+}
+test_string_array ();
+
+define test_range_arith (a, x)
+{
+ ifnot (_eqs (a/1 + x, a+x))
+ failed ("range addition");
+
+ ifnot (_eqs (a/1 - x, a-x))
+ failed ("range subtraction");
+
+ ifnot (_eqs ((a/1) * x, a*x))
+ failed ("range multiplication");
+
+ ifnot (_eqs (x + a/1, x+a))
+ failed ("x range addition");
+
+ ifnot (_eqs (x-a/1, x-a))
+ failed ("x range subtraction");
+
+ ifnot (_eqs (x*(a/1), x*a))
+ failed ("x range multiplication");
+}
+
+test_range_arith (1:10, 2);
+test_range_arith (1:10:3, -1);
+test_range_arith (10:1:-2, 2);
+test_range_arith (10:1:-2, 1);
+test_range_arith (10:1:-2, -1);
+test_range_arith (10:1:-2, -10);
+
+define test_dup (a)
+{
+ variable b = @a;
+ if (__is_same (a, b))
+ failed ("b=@a failed __is_same");
+ ifnot (_eqs (a,b))
+ failed ("b=@a failed _eqs");
+}
+test_dup (1:10);
+test_dup (1:-3);
+test_dup (1:4);
+test_dup (1,2,3,4);
+test_dup ("foo", "bar", "baz");
+
+private define test_sumsq (a)
+{
+ variable s, t;
+
+ s = sumsq (a);
+ if (_typeof (a) == Complex_Type)
+ t = sumsq (Real(a)) + sumsq(Imag(a));
+ else
+ t = sum (a*a);
+
+ if (s != t)
+ {
+	failed ("sumsq: %S != %S, diff=%S", s, t, s-t);
+ }
+}
+test_sumsq (1:10);
+test_sumsq (typecast (1:10, Char_Type));
+test_sumsq (typecast (1:10, UChar_Type));
+test_sumsq (typecast (1:10, Long_Type));
+test_sumsq (typecast (1:10, ULong_Type));
+test_sumsq (typecast (1:10, Short_Type));
+test_sumsq (typecast (1:10, UShort_Type));
+#ifexists Double_Type
+test_sumsq (typecast (1:10, Float_Type));
+test_sumsq (typecast (1:10, Double_Type));
+#endif
+#ifexists Complex_Type
+test_sumsq (1:10 + 2:11*1i);
+#endif
+
+private define test_linear_combination ()
+{
+ foreach ({1, 1.0})
+ {
+	variable one = ();
+
+	variable a = 1, 2, 3, 4 * one;
+	variable b = 1, 2, 3, 4;
+	variable ans, ans1;
+
+	ans = sum (a*b);
+	ans1 = 1*a0 + 2*a1 + 3*a2 + 4*a3;
+	if (ans != ans1)
+	 failed ("%S*%S linear combination1 not equal to sum", _typeof(a), _typeof(b));
+
+	ans1 = a0*1 + a1*2 + a2*3 + a3*4;
+	if (ans != ans1)
+	 failed ("%S*%S linear combination2 not equal to sum", _typeof(a), _typeof(b));
+ }
+
+}
+test_linear_combination ();
+
+private define test_range_multiplier ()
+{
+ variable x0 = 1.7, x1 = 2.05, dx = 0.02;
+ variable a = x0:x1:dx;
+ if (a0 != x0)
+ failed ("range multiplier: first element is incorrect (%S vs %S", a0, x0);
+ x0 = -1.7;
+ a = x0:x1:dx;
+ if (a0 != x0)
+ failed ("range multiplier: first element is incorrect (%S vs %S", a0, x0);
+}
+test_range_multiplier ();
+
+private define test_wherefirstlast_minmax (a)
+{
+ foreach (Util_Arith_Types)
+ {
+	variable type = ();
+	variable b = typecast (a, type);
+
+	variable i;
+	i = wherefirst (b == min(b));
+	if (i != wherefirstmin (b))
+	 failed ("wherefirstmin on %S", type, b);
+
+	i = wherefirst (b == max(b));
+	if (i != wherefirstmax (b))
+	 failed ("wherefirstmax on %S", type, b);
+
+	i = wherelast (b == min(b));
+	if (i != wherelastmin (b))
+	 failed ("wherelastmin on %S", type, b);
+
+	i = wherelast (b == max(b));
+	if (i != wherelastmax (b))
+	 failed ("wherelastmax on %S", type, b);
+ }
+}
+
+test_wherefirstlast_minmax (1);
+test_wherefirstlast_minmax (1);
+test_wherefirstlast_minmax (-1,1);
+test_wherefirstlast_minmax (-1,1,-1);
+test_wherefirstlast_minmax (-1,1,-1,1);
+test_wherefirstlast_minmax (-1,1,-1,1,0);
+test_wherefirstlast_minmax (-1,1,-1,1,0,1,2,3);
+test_wherefirstlast_minmax (-1,1,-1,1,0,1,2,3,0);
+
+private define test_prod (a)
+{
+ variable p = prod (a);
+ variable p1 = 1.0;
+ foreach (a)
+ {
+	variable aa = ();
+	p1 *= aa;
+ }
+ if (p1 == p)
+ return;
+#ifexists Complex_Type
+ if (_typeof (a) == Complex_Type)
+ {
+	if (feqs (Real(p), Real(p1)) && feqs (Imag(p), Imag(p1)))
+	 return;
+ }
+ else
+#endif
+ {
+	if (feqs (p, p1))
+	 return;
+ }
+
+ failed ("prod(%S) produced %S, expected %S", a, p, p1);
+}
+test_prod (1);
+test_prod (1:5);
+test_prod (1.0);
+test_prod (1.0f);
+test_prod (1:5*1.0);
+test_prod (1:5*1.0f);
+test_prod (1h, 2h);
+#ifexists LLong_Type
+test_prod (1LL);
+test_prod (1:5*1LL);
+#ifexists Complex_Type
+test_prod (1+0i);
+test_prod (1:5 + 1i*2:6);
+#endif
+
+private define test_wherefirst_op ()
+{
+ variable types = Util_Arith_Types;
+
+ variable ops = {"_op_eqs", "_op_neqs", "_op_gt", "_op_ge", "_op_lt", "_op_le"};
+ loop (5)
+ {
+	foreach (ops)
+	 {
+	 variable op = ();
+	 variable suffix = op3:5;
+	 variable wherefirst_func = __get_reference ("wherefirst" + suffix);
+	 variable wherelast_func = __get_reference ("wherelast" + suffix);
+	 op = __get_reference (op);
+
+	 variable a = 128*urand(1000);
+	 variable b = 128*urand();
+	 variable istart = int (-10 + 10*urand ());
+	 variable aa, bb, atype, btype, i, j;
+
+	 foreach atype (types)
+	 {
+		 aa = typecast (a, atype);
+		 foreach btype (types)
+		 {
+		 bb = typecast (b, btype);
+		 i = (@wherefirst_func)(aa, bb);
+		 j = wherefirst ((@op)(aa, bb));
+		 if (i != j)
+			 {
+			 failed ("%S(%S,%S %S)==>a%S=%S, expected a%S=%S",
+				 wherefirst_func, aa, btype, bb,
+				 i, (i==NULL?"NULL":aai),
+				 j, (j==NULL?"NULL":aaj));
+			 }
+
+		 i = (@wherelast_func)(aa, bb);
+		 j = wherelast ((@op)(aa, bb));
+		 if (i != j)
+			 {
+			 failed ("%S(%S,%S %S)==>a%S=%S, expected a%S=%S",
+				 wherelast_func, aa, btype, bb,
+				 i, (i==NULL?"NULL":aai),
+				 j, (j==NULL?"NULL":aaj));
+			 }
+
+		 i = (@wherefirst_func)(aa, bb, istart);
+		 j = wherefirst ((@op)(aa, bb), istart);
+		 if (i != j)
+			 {
+			 failed ("%S(%S,%S %S)==>a%S=%S, expected a%S=%S",
+				 wherefirst_func, aa, btype, bb, istart,
+				 i, (i==NULL?"NULL":aai),
+				 j, (j==NULL?"NULL":aaj));
+			 }
+
+		 i = (@wherelast_func)(aa, bb, istart);
+		 j = wherelast ((@op)(aa, bb), istart);
+		 if (i != j)
+			 {
+			 failed ("%S(%S,%S %S,%S)==>a%S=%S, expected a%S=%S",
+				 wherelast_func, aa, btype, bb, istart,
+				 i, (i==NULL?"NULL":aai),
+				 j, (j==NULL?"NULL":aaj));
+			 }
+		 }
+	 }
+	 }
+ }
+}
+
+test_wherefirst_op ();
+
+private define test_wherediff ()
+{
+ variable a = 1, 1, 3, 0, 0, 4, 7, 7;
+ variable i, j;
+
+ i = wherediff (a, &j);
+ ifnot (_eqs (i, 0, 2, 3, 5, 6) && _eqs(j, 1, 4, 7))
+ failed ("wherediff test1");
+
+ i = wherediff (Int_Type0, &j);
+ if (length(i) || length(j))
+ failed ("wherediff test2");
+
+ a = "foo";
+ i = wherediff (a, &j);
+ ifnot (_eqs (i, 0) && _eqs(j, Int_Type0))
+ failed ("wherediff test3");
+ a = "foo";
+
+ a = String_Type3;
+ i = wherediff (a, &j);
+ ifnot (_eqs (i, 0) && _eqs(j, 1,2))
+ failed ("wherediff test4");
+}
+test_wherediff ();
+
+private define test_init_char_array (s)
+{
+ variable t;
+ foreach t (Char_Type, UChar_Type)
+ {
+	variable a = tstrbytelen (s);
+	init_char_array (a, s);
+
+	variable i;
+	_for i (0, length(a)-1, 1)
+	 {
+	 if (ai != typecast (si, t))
+	 failed ("init_char_array: type=%S", t);
+	 }
+ }
+}
+
+test_init_char_array ("HelloWorld");
+test_init_char_array ("\xAB\xCD\xEF");
+
+
+print ("Ok\n");
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/arrmult.sl Added

@@ -0,0 +1,165 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("Matrix Multiplications");
+#ifexists Double_Type
+
+static define dot_prod (a, b)
+{
+ (a # b)0;			 % transpose not needed for 1-d arrays
+}
+
+static define sum (a)
+{
+ variable ones = Double_Type length (a) + 1;
+ dot_prod (a, ones);
+}
+
+if (1+2+3+4+5 != sum(1,2,3,4,5))
+ failed ("sum");
+
+#ifexists Complex_Type
+if (1+2i != sum (1,2i))
+ failed ("sum complex");
+#endif
+
+define mult (a, b)
+{
+ variable dims_a, dims_b;
+ variable nr_a, nr_b, nc_a, nc_b;
+ variable i, j;
+ variable c;
+
+ (dims_a,,) = array_info (a);
+ (dims_b,,) = array_info (b);
+ nr_a = dims_a0;
+ nc_a = dims_a1;
+ nr_b = dims_b0;
+ nc_b = dims_b1;
+
+ c = _typeof (a0,0#b0,0)nr_a, nc_b;
+
+ for (i = 0; i < nr_a; i++)
+ {
+	for (j = 0; j < nc_b; j++)
+	 ci,j = dot_prod (ai,*, b*,j);
+ }
+ return c;
+}
+
+static define arr_cmp (a, b)
+{
+ variable i = length (where (b != a));
+ if (i == 0)
+ return 0;
+
+ i = where (b != a);
+ a = ai;
+ b = bi;
+ reshape (a, length(a));
+ reshape (b, length(b));
+ vmessage ("%S != %S\n", a0, b0);
+ return 1;
+}
+
+static define test (a, b)
+{
+ if (0 != arr_cmp (mult (a,b), a#b))
+ failed ("%S # %S", a, b);
+}
+
+variable A, B;
+
+#ifexists Complex_Type
+A = 1+2i;
+B = 3+4i;
+reshape (A, 1, 1);
+reshape (B, 1, 1);
+test (A,B);
+#endif
+
+% Test intgers
+A = _reshape (1:20, 1:20, 2,20);
+B = _reshape (1:20,1:20,1:20,1:20,1:20, 5,20);
+B = transpose (B);
+
+foreach $1 (1:100:10)
+{
+ __set_innerprod_block_size ($1);
+ test (A, B);
+
+ B *= 1f;
+ test (A, B);
+
+ B *= 1.0;
+ test (A,B);
+
+ A *= 1f;
+ test (A,B);
+
+#ifexists Complex_Type
+ B += 2i;
+ test (A,B);
+
+ A += 3i;
+ test (A,B);
+
+ B = Real(B);
+ test (A,B);
+
+% Now try an empty array
+
+ if (Complex_Type != _typeof (Complex_Type0,0,0 # Complex_Type0))
+ failed ("#");
+#endif
+}
+% And finally, do a 3-d array:
+
+A = _reshape (1:2*3*4, 2,3,4);
+B = _reshape (1:4*5*6, 4,5,6);
+static variable C = A#B;
+
+% C should be a 2,3,5,6 matrix. Let's check via brute force
+
+static define multiply_3d (a, b, c)
+{
+ variable i, j, k, l, m;
+ variable dims_a, dims_b;
+
+ (dims_a,,) = array_info(a);
+ (dims_b,,) = array_info(b);
+
+ _for (0, dims_a0-1, 1)
+ {
+	i = ();
+	_for (0, dims_a1-1, 1)
+	 {
+	 j = ();
+	 _for (0, dims_b1-1, 1)
+	 {
+		 l = ();
+		 _for (0, dims_b2-1, 1)
+		 {
+		 m = ();
+
+		 variable sum = 0;
+		 _for (0, dims_b0-1, 1)
+			 {
+			 k = ();
+			 sum += ai,j,k * bk, l, m;
+			 }
+		 if (sum != ci,j,l,m)
+			 failed ("multiply_3d");
+		 }
+	 }
+	 }
+ }
+}
+
+multiply_3d (A, B, C);
+
+print ("Ok\n");
+#else
+print ("Not available\n");
+#endif
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/assoc.c Added

@@ -0,0 +1,108 @@
+static void api_create_asssoc (void)
+{
+ int i, nkeys;
+ int type;
+ int has_def_value = 0;
+ SLang_Assoc_Array_Type *a;
+
+ nkeys = SLang_Num_Function_Args;
+ if (nkeys < 0)
+ {
+	SLang_verror (SL_Usage_Error, "Illegal usage of api_create_asssoc");
+	return;
+ }
+
+ type = SLANG_VOID_TYPE;
+
+ if (nkeys % 2)
+ {
+	nkeys -= 1;
+	if (-1 == (type = SLang_peek_at_stack ()))
+	 return;
+	has_def_value = 1;
+ }
+
+ if (NULL == (a = SLang_create_assoc (type, has_def_value)))
+ {
+	SLang_verror (SL_Any_Error, "Failed: (API) SLang_create_assoc");
+	return;
+ }
+
+ for (i = 0; i < nkeys; i += 2)
+ {
+	char *key;
+
+	if (-1 == SLreverse_stack (2))
+	 goto free_and_return;
+
+	if (-1 == SLang_pop_slstring (&key))
+	 goto free_and_return;
+
+	if (-1 == SLang_assoc_put (a, key))
+	 {
+	 SLang_free_slstring (key);
+	 goto free_and_return;
+	 }
+	SLang_free_slstring (key);
+ }
+
+ if (-1 == SLang_push_assoc (a, 0))
+ SLang_verror (SL_Any_Error, "Failed: SLang_push_assoc");
+
+ /* drop */
+free_and_return:
+ SLang_free_assoc (a);
+}
+
+static void api_assoc_get (SLang_Assoc_Array_Type *a, char *key)
+{
+ (void) SLang_assoc_get (a, key, NULL);
+}
+
+static void api_assoc_put (void)
+{
+ SLang_Assoc_Array_Type *a;
+ char *key;
+
+ if (-1 == SLreverse_stack (3))
+ return;
+
+ if (-1 == SLang_pop_assoc (&a))
+ return;
+
+ if (0 == SLang_pop_slstring (&key))
+ {
+	(void) SLang_assoc_put (a, key);
+	SLang_free_slstring (key);
+ }
+ SLang_free_assoc (a);
+}
+
+static void test_push_and_pop_assoc (void) /*{{{*/
+{
+ SLang_Assoc_Array_Type *a1 = SLang_create_assoc (SLANG_VOID_TYPE, 0);
+ SLang_Assoc_Array_Type *a2;
+
+ SLang_push_assoc (a1, 1);
+ SLang_pop_assoc (&a2);
+ if (a2 != a1)
+ SLang_verror (SL_Any_Error, "Failed: (API) pop yields pointer to previously pushed assoc");
+ SLang_free_assoc (a2);
+}
+/*}}}*/
+
+static void pop_and_push_assoc (void) /*{{{*/
+{
+ SLang_Assoc_Array_Type *a;
+
+ SLang_pop_assoc (&a);
+ SLang_push_assoc (a, 1);
+}
+/*}}}*/
+
+#define ASSOC_API_TEST_INTRINSICS \
+ MAKE_INTRINSIC_0("api_create_asssoc", api_create_asssoc, SLANG_VOID_TYPE), \
+ MAKE_INTRINSIC_2("api_assoc_get", api_assoc_get, SLANG_VOID_TYPE, SLANG_ASSOC_TYPE, SLANG_STRING_TYPE), \
+ MAKE_INTRINSIC_0("api_assoc_put", api_assoc_put, SLANG_VOID_TYPE), \
+ MAKE_INTRINSIC_0("test_api_push_and_pop_assoc", test_push_and_pop_assoc, SLANG_VOID_TYPE), \
+ MAKE_INTRINSIC_0("api_pop_and_push_assoc", pop_and_push_assoc, SLANG_VOID_TYPE)

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/assoc.sl Added

@@ -0,0 +1,259 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("Associative Arrays");
+
+static define key_to_value (k)
+{
+ return "<<<" + k + ">>>";
+}
+
+static define value_to_key (v)
+{
+ strcompress (v, "<>");
+}
+
+static define add_to_x (x, k)
+{
+ xk = key_to_value(k);
+}
+
+static variable Default_Value = "****Default-Value****";
+
+define setup (type)
+{
+ variable x = Assoc_Type type, Default_Value;
+ variable num = 0;
+
+ while (num < 512)
+ {
+	add_to_x (x, sprintf ("key_%d", num));
+	num++;
+ }
+
+ add_to_x (x, "foo"); num++;
+ add_to_x (x, "bar"); num++;
+ add_to_x (x, "silly"); num++;
+ add_to_x (x, "cow"); num++;
+ add_to_x (x, "dog"); num++;
+ add_to_x (x, "chicken"); num++;
+
+ variable i = 0;
+ while (i < 512)
+ {
+	assoc_delete_key (x, sprintf ("key_%d", i)); num--;
+	i += 2;
+ }
+
+ if (length (x) != num)
+ {
+	failed ("length(x)");
+ }
+ assoc_delete_key (x, "cow"); num--;
+ if (length(x) != num)
+ {
+	failed ("length after assoc_delete_key");
+ }
+ add_to_x (x, "cow");
+ return x;
+}
+
+static variable X;
+
+% Test create/destuction of arrays
+loop (3) X = setup (Any_Type);
+
+loop (3) X = setup (String_Type);
+
+static variable k, v;
+
+foreach k,v (X)
+{
+ if ((k != value_to_key(v)) or (v != key_to_value (k))
+ or (Xk != v))
+ failed ("foreach");
+}
+
+foreach k (X) using ("keys")
+{
+ if (Xk != key_to_value (k))
+ failed ("foreach using keys");
+}
+
+foreach k,v (X) using ("keys", "values")
+{
+ if ((k != value_to_key(v)) or (v != key_to_value (k))
+ or (Xk != v))
+ failed ("foreach using keys, values");
+}
+
+k = assoc_get_keys (X);
+v = assoc_get_values (X);
+
+static variable i;
+_for i (0, length(k)-1, 1)
+{
+ if (vi != Xki)
+ failed ("assoc_get_keys/values");
+ assoc_delete_key (X, ki);
+}
+
+if (length (X) != 0)
+ error ("assoc_delete_key failed");
+
+if (X"*******************" != Default_Value)
+ failed ("default value");
+
+static define eqs (a, b)
+{
+ variable len;
+ len = length (a);
+ if (len != length (b))
+ return 0;
+
+ len == length (where (a == b));
+}
+
+static define neqs (a, b)
+{
+ not (eqs (a, b));
+}
+
+static define store_and_test (a, indx, value)
+{
+ aindx = value;
+ if (typeof (value) != typeof(aindx))
+ failed ("typeof (value)");
+ if (neqs (aindx, value))
+ failed ("aindx != value");
+}
+
+X = Assoc_Type;
+
+store_and_test (X, "string", "string");
+store_and_test (X, "array", "a", "b", "c");
+store_and_test (X, "int", 3);
+#ifexists Complex_Type
+store_and_test (X, "z", 3+2i);
+#endif
+
+static variable V = assoc_get_values (X);
+static variable K = assoc_get_keys (X);
+
+static variable i;
+
+_for i (0, length(X)-1, 1)
+{
+ if (neqs(XKi, @Vi))
+ failed ("assoc_get_values");
+}
+
+define test_arith ()
+{
+ variable a = Assoc_TypeInt_Type, 1;
+ a"foo" += 3;
+ if (a"foo" != 4)
+ failed ("afoo += 3");
+
+ a"foo"--;
+ if (a"foo" != 3)
+ failed ("afoo--");
+
+ a"foo"++;
+ if (a"foo" != 4)
+ failed ("afoo++");
+
+ a = Assoc_Type Array_Type, 1,2;
+
+ a"bar" += 3;
+ ifnot (_eqs (a"bar", 1,2 + 3))
+ failed ("abar += 3");
+
+ a"bar"++;
+ ifnot (_eqs (a"bar", 1,2 + 3 + 1))
+ failed ("abar++");
+}
+test_arith ();
+
+private define check_assoc_values (a, key_value_pairs)
+{
+ variable key, expected_value, v, i;
+
+ _for i (0, length(key_value_pairs)-1, 2)
+ {
+	key = key_value_pairsi;
+	expected_value = key_value_pairsi+1;
+
+ % test value seen by the interpreter
+ v = akey;
+	ifnot (__is_same (v, expected_value))
+	 {
+	 failed ("api_created assoc's value (key=%S) was %S, expected %S",
+		 key, v, expected_value);
+	 }
+
+ % test value seen by SLang_assoc_get
+	v = api_assoc_get (a, key);
+	ifnot (__is_same (v, expected_value))
+	 {
+	 failed ("api_assoc_get (key=%S) produced %S, expected %S",
+		 key, v, expected_value);
+	 }
+ }
+}
+
+private define test_api_create_assoc_without_default_value ()
+{
+ variable key_value_pairs =
+ {
+	"foo", 1,
+	"bar", PI,
+	"complex", 2+3i,
+	"string", "foobar",
+	"array", 1,2,3,4,
+	"struct", struct {foo, bar},
+ };
+ variable a = api_create_asssoc (__push_list (key_value_pairs));
+
+ loop (10) check_assoc_values (a, key_value_pairs);
+}
+test_api_create_assoc_without_default_value ();
+
+private define test_api_create_assoc_with_default_value ()
+{
+ variable key_value_pairs =
+ {
+	"foo", "1",
+	"bar", "3.141592653589793",
+	"complex", "(2 + 3i)",
+	"string", "foobar",
+	"array", "Integer_Type4",
+	"struct", "Struct_Type with 2 fields",
+ };
+
+ variable default_value = "*default*";
+ variable a = api_create_asssoc (__push_list (key_value_pairs), default_value);
+
+ list_join (key_value_pairs,
+	 {"bla", default_value, "blabla", default_value});
+
+ loop (10) check_assoc_values (a, key_value_pairs);
+}
+test_api_create_assoc_with_default_value ();
+
+test_api_push_and_pop_assoc (); % entirely defined in assoc.c
+
+private define test_api_pop_and_push_assoc ()
+{
+ variable a1 = Assoc_TypeInteger_Type, 42;
+ a1;
+ variable a2 = api_pop_and_push_assoc ();
+ ifnot (__is_same (a1, a2))
+ {
+	failed ("api_push_and_pop_assoc");
+ }
+}
+test_api_pop_and_push_assoc ();
+
+print ("Ok\n");
+
+exit (0);

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/autoload.sl Added

@@ -0,0 +1,107 @@
+#ifnexists Testing_Autoload
+public variable Testing_Autoload = 1;
+() = evalfile ("./inc.sl");
+testing_feature ("autoload");
+
+public variable Num_Foo_Loads = 0;
+public variable Num_Foo_Args = 0;
+public variable Num = 0;
+
+autoload ("foo", __FILE__);	       %  load foo into the global namespace
+if (0 == is_defined ("foo"))
+  failed ("autoload foo 1");
+
+autoload ("ns2->foo", __FILE__);	       %  load foo into ns2
+
+implements ("ns1");
+# iffalse
+% I want to add private namespaces before I allow this to be implicitly
+% be loaded into the current namespace
+autoload ("foo", __FILE__);
+# else
+autoload ("ns1->foo", __FILE__);
+# endif
+% Now foo should be define in ns1, as well as in the global
+if (0 == is_defined ("ns1->foo"))
+  failed ("autoload ns1->foo");
+
+$1 = Global->foo (1,2,3);
+if (Num_Foo_Loads != 1)
+  failed ("Failed to load foo into the global namespace: %d", Num_Foo_Loads);
+if (Num_Foo_Args != 3)
+  failed ("_NARGS not 3 in autoloaded function");
+
+%if ($1 == "Global")
+%  failed ("Global namespace was used for private objects");
+
+() = ns1->foo (1,2,3,4);
+if (Num_Foo_Loads != 2)
+  failed ("Failed to load foo into ns1");
+if (Num_Foo_Args != 4)
+  failed ("_NARGS not 4 in autoloaded function");
+
+() = ns2->foo ();
+if (Num_Foo_Loads != 3)
+  failed ("Failed to load foo into ns2");
+if (Num_Foo_Args != 0)
+  failed ("_NARGS not 0 in autoloaded function");
+
+() = evalfile (__FILE__, "ns3");
+if (0 == is_defined ("ns3->foo"))
+  failed ("ns3->foo is not defined");
+
+if ("ns3" != ns3->foo())
+  failed ("ns3->foo returned %s", ns3->foo ());
+if ("ns2" != ns2->foo())
+  failed ("ns2->foo returned %s", ns2->foo ());
+if ("ns1" != ns1->foo())
+  failed ("ns1->foo returned %s", ns1->foo ());
+
+ns3->set_private_num (3);
+ns2->set_private_num (2);
+ns1->set_private_num (1);
+Global->Num = 0;
+
+if ((ns3->get_private_num () != 3)
+    or (ns2->get_private_num () != 2)
+    or (ns1->get_private_num () != 1))
+  failed ("private namepaces were modified");
+
+if (is_defined ("private_foo")
+    or is_defined ("ns1->private_foo")
+    or is_defined ("ns2->private_foo")
+    or is_defined ("ns3->private_foo"))
+  failed ("private_foo was defined in a non-private namespace");
+
+print ("Ok\n");
+exit (0);
+#else
+private variable My_Namespace = current_namespace ();
+private variable Num = 1;
+private define private_foo ()
+{
+   if (Num != 1)
+     failed ("Private variable Num_Loads has been modified");
+   return My_Namespace;
+}
+
+define get_private_num ()
+{
+   return Num;
+}
+
+define set_private_num (n)
+{
+   Num = n;
+}
+
+Num_Foo_Loads++;
+define foo ()
+{
+   _pop_n (_NARGS);
+   Num_Foo_Args = _NARGS;
+   return private_foo ();
+}
+if (current_namespace () != foo (1,2,3,4,5))
+  failed ("current_namespace: %s, Expected %s", current_namespace(), My_Namespace);
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/break.sl Added

@@ -0,0 +1,96 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("break and continue N");
+
+define test_break_n ()
+{
+   variable n1 = 3, n2 = 5, n3 = 7;
+   variable n1_loops = 0;
+   variable n2_loops = 0;
+   variable n3_loops = 0;
+   loop (n1)
+     {
+	loop (n2)
+	  {
+	     loop (n3)
+	       {
+		  break 2;
+		  n3_loops++;
+	       }
+	     n2_loops++;
+	  }
+	n1_loops++;
+     }
+
+   if ((n1_loops != n1) || (n2_loops) || (n3_loops))
+     failed ("break 2");
+}
+
+define test_cont_n ()
+{
+   variable n1 = 3, n2 = 5, n3 = 7;
+   variable n1_loops = 0;
+   variable n2_loops = 0;
+   variable n2_then_loops = 0;
+   variable n3_loops = 0;
+   variable n3_then_loops = 0;
+   variable n3_finally_loops = 0;
+   loop (n1)
+     {
+	loop (n2)
+	  {
+	     test_break_n ();
+	     loop (n3)
+	       {
+		  try
+		    {
+		       continue 2;
+		    }
+		  finally
+		    {
+		       n3_finally_loops++;
+		    }
+		  n3_loops++;
+	       }
+	     then
+	       {
+		  n3_then_loops++;
+	       }
+	     n2_loops++;
+	  }
+	then
+	  {
+	     n2_then_loops++;
+	  }
+	n1_loops++;
+     }
+
+   if (n3_finally_loops != (n1*n2))
+     failed ("continue 2 with finally");
+   if ((n1_loops != n1) || (n2_loops) || (n3_loops))
+     failed ("continue 2");
+   if (n3_then_loops || (n2_then_loops != n1))
+     failed ("continue 2 with then");
+}
+
+test_break_n ();
+test_cont_n  ();
+
+loop (2)
+{
+   loop (2)
+     continue 4;
+}
+
+$1 = 0;
+loop (2)
+{
+   $1++;
+}
+if ($1 != 2)
+  failed ("Use of continue N outside a function: val=%d", $1);
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/bstring.sl Added

@@ -0,0 +1,165 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("Binary Strings");
+
+private define test_printable_bstring ()
+{
+ variable db = "a\000"B, b = ""B;
+ loop (20)
+ b += db;
+
+ set_printable_bstring_size (16);
+ if (16 != get_printable_bstring_size ())
+ failed ("get/set_printable_bstring_size");
+ % for 16, we expect
+ variable expect = "a\\000a\\000a...";
+ if (expect != "$b"$)
+ failed ("expected expected bstring representation to be: %s, got %s",
+	 expect, "$b"$);
+
+ set_printable_bstring_size (256);
+ b = "abc";
+ if ("abc" != "$b"$)
+ failed ("representation of small binary string");
+}
+test_printable_bstring ();
+
+define test ()
+{
+ variable a = "\000A\000B\000C\000D";
+
+ if (typeof (a) != BString_Type) failed ("typeof");
+
+ if (bstrlen (a) != 8) failed ("bstrlen");
+
+ if ((a0:7:2 != "\000\000\000\000")
+ or (a1:7:2 != "ABCD")) failed ("array indexing");
+
+ if (strlen (a) != 0) failed ("typecast");
+
+ a += "XYZ";
+ if (a8: != "XYZ") failed ("+= op");
+
+ a = "XYZ" + a;
+ if (a == "XYZ") failed ("== op");
+ if (strcmp (a, "XYZ")) failed ("failed strcmp");
+
+ a = "XYZ"B;
+ if (typeof (a) != BString_Type)
+ failed ("B suffix on a binary string");
+
+ loop (10)
+ {
+	variable aa = a + ""B;
+	variable b = __tmp(a) + "X";
+	if (b != aa + "X")
+	 failed ("__tmp op");
+	a = __tmp(b);
+ }
+
+ a = BString_Type10; a* = "XYZ"B;
+
+ if (bstrjoin (a) != strjoin (a))
+ failed ("bstrjoin 1");
+ if (bstrjoin (a, "\n") != strjoin (a,"\n"))
+ failed ("bstrjoin 2");
+
+ b = "XYZ";
+ loop (10)
+ {
+	a += "XYZ"B;
+	b += "XYZ";
+	if (any (a != b))
+	 failed ("Adding array of bstrings");
+ }
+
+ loop (20)
+ {
+	a = "\000A\000B\000C\000D";
+	a = "A\000B\000C\000";
+ }
+
+ if ("XYZ\000XYZ\000XYZ\000" != bstrcat ("XY","Z\000", "XYZ\000", "XYZ", "\000"))
+ failed ("bstrcat");
+ if ("XYZ" == bstrcat ("XY","Z\000", "XYZ\000", "XYZ", "\000"))
+ failed ("bstrcat 2");
+}
+test ();
+
+define test_is_substrbytes (a, b, ans)
+{
+ variable x = is_substrbytes (a, b);
+ if (ans != x)
+ failed ("%d != (%d = is_substrbytes (%S, %S))", ans, x, a, b);
+ if (ans > 1)
+ {
+	x = is_substrbytes (a, b, ans-1);
+	if (ans != x)
+	 failed ("%d != (%d = is_substrbytes (%S, %S, %S))", ans, x, a, b, ans-1);
+ }
+}
+test_is_substrbytes ("hello", "o", 5);
+test_is_substrbytes ("hello", "x", 0);
+test_is_substrbytes ("hello", "h", 1);
+test_is_substrbytes ("hello", "hello", 1);
+test_is_substrbytes ("hello", "hellox", 0);
+test_is_substrbytes ("hell\0", "\0", 5);
+test_is_substrbytes ("hell\0w", "l\0w", 4);
+test_is_substrbytes ("hell\0w", "", 0);
+test_is_substrbytes ("", "", 0);
+test_is_substrbytes ("\0hello", "h", 2);
+test_is_substrbytes ("\0", "h", 0);
+test_is_substrbytes ("\0", "", 0);
+test_is_substrbytes ("\0", "\0", 1);
+test_is_substrbytes ("\0x", "\0", 1);
+test_is_substrbytes ("\0x", "\0x", 1);
+test_is_substrbytes ("\0x", "\0xy", 0);
+test_is_substrbytes ("", "\0xy", 0);
+test_is_substrbytes ("", "\0x", 0);
+test_is_substrbytes ("", "\0", 0);
+test_is_substrbytes ("eefdefg", "efg", 5);
+
+private define test_ops (a1, a2)
+{
+ variable b1, b2;
+ b1 = typecast (a1, BString_Type);
+ b2 = typecast (a2, BString_Type);
+
+ if ((a1 == a2) != (b1 == b2))
+ failed ("operator %S == %S", b1, b2);
+ if ((a1 >= a2) != (b1 >= b2))
+ failed ("operator %S >= %S", b1, b2);
+ if ((a1 <= a2) != (b1 <= b2))
+ failed ("operator %S <= %S", b1, b2);
+ if ((a1 > a2) != (b1 > b2))
+ failed ("operator %S > %S", b1, b2);
+ if ((a1 < a2) != (b1 < b2))
+ failed ("operator %S < %S", b1, b2);
+
+ variable c1 = BString_Type5; c1* = b1;
+ variable c2 = BString_Type5; c2* = b2;
+ a1 = typecast (c1, String_Type);
+ a2 = typecast (c2, String_Type);
+
+ if (any ((a1 == a2) != (c1 == c2)))
+ failed ("operator %S == %S", b1, b2);
+ if (any ((a1 >= a2) != (c1 >= c2)))
+ failed ("operator %S >= %S", b1, b2);
+ if (any ((a1 <= a2) != (c1 <= c2)))
+ failed ("operator %S <= %S", b1, b2);
+ if (any ((a1 > a2) != (c1 > c2)))
+ failed ("operator %S > %S", b1, b2);
+ if (any ((a1 < a2) != (c1 < c2)))
+ failed ("operator %S < %S", b1, b2);
+}
+
+test_ops ("hello", "world");
+test_ops ("hello", "hello");
+test_ops ("hell", "hello");
+test_ops ("hello", "hell");
+test_ops ("", "hell");
+test_ops ("hell", "");
+test_ops ("", "");
+
+print ("Ok\n");
+exit (0);

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/bugs.sl Added

@@ -0,0 +1,232 @@
+() = evalfile ("inc.sl");
+print ("Known Bugs or not yet implemented features:\n");
+implements ("bugs");
+
+static define f()
+{
+   _pop_n (_NARGS);
+   return _NARGS;
+}
+
+static variable A = &f;
+if (3 != (@A0)(1,2,3))
+  vmessage ("\tArray indexing/_NARGS interaction still present: %d",
+	    (@A0)(1,2,3));
+
+static define func1(p1, p2) { return _NARGS; }
+static variable A =  &func1, &func1 ;
+define test(which) { (@Awhich)(which, which);}
+if (2 != test(0))
+  vmessage ("\tArray indexing/deref/_NARGS interaction present");
+A = &f;
+if (3 != (@A)(4,5,6))
+  vmessage ("\tderef/_NARGS interaction present");
+
+static variable s = struct
+{
+   method
+};
+s.method = &f;
+if (3 != (@s.method)(4,5,6))
+  vmessage ("\tUnexpected struct method/_NARGS interaction");
+if (4 != s.method(7,8,9))
+  vmessage ("\tUnexpected struct method call/_NARGS interaction");
+
+if (1)
+{
+   $1 = 0;
+   ERROR_BLOCK
+     {
+	$1 = 1;
+	_clear_error();
+     }
+   static variable A = Assoc_TypeInt_Type;
+   A"foo" = 1:10;
+   if ($1 == 0)
+     vmessage ("\tAssoc_Type/Array conflict present");
+   %else
+   %  vmessage ("\tIgnore above error.");
+}
+
+$1 = 1L,1; $1 = 1,1L;
+
+$1 = Double_Type2,2;
+$1* = PI;
+if (length (where ($1 == PI)) != length ($1))
+  vmessage ("\tA* where A is multidimensional");
+
+% This _used_ to cause a subtle leak
+typedef struct {a} Foo_Type;
+()=Struct_Type1,@Foo_Type;
+
+#iffalse
+% This "broken-feature" is nolonger supported.
+$1 = 1:10;
+if (10 != length ($10:-1))
+  vmessage ("\tSubscripting a 1d array with negative indices");
+$1 = _reshape ($1, 5,2);
+if (10 != length ($10:-1))
+  vmessage ("\tSubscripting a 2d array with negative indices");
+#endif
+
+if (1)
+{
+   $1 = 0;
+   ERROR_BLOCK
+     {
+	_clear_error();
+	vmessage ("case Array_Type bug present");
+     }
+   switch ($1)
+     {
+      case "hello":
+	failed ("case");
+     }
+     {
+      case 1:10:
+	failed ("case");
+     }
+}
+
+static define foo ()
+{
+   return "foo";
+}
+static define bar ()
+{
+   return "bar";
+}
+static variable A = &foo, &bar;
+if ("bar" != (@A1)())
+  vmessage ("Dereferencing a array element bug");
+
+A = Struct_Type2;
+static variable S = struct
+{
+   addr
+};
+A0 = S;
+A1 = @S;
+
+A0.addr = &$1;
+A1.addr = &$2;
+
+try
+{
+   eval ("@A0.addr = PI", "bugs");
+   eval ("@(A0.addr) = PI", "bugs");
+}
+catch NotImplementedError:
+{
+   vmessage ("\tDereferencing an array of struct fields");
+}
+
+static define test_xxx (xxx)
+{
+   variable x=0, y=0;
+   loop (3)
+     {
+	x++;
+	try eval(sprintf ("if (1) %s;", xxx));
+	catch SyntaxError;
+	y++;
+     }
+   return 10*y+x;
+}
+
+if (test_xxx ("break") != 33)
+  vmessage ("\tbreak at top-level");
+
+if (test_xxx ("continue") != 33)
+  vmessage ("\tcontinue at top-level");
+
+if (test_xxx ("return") != 33)
+  vmessage ("\treturn at top-level");
+
+static define test_function_name ()
+{
+   return eval ("_function_name()");
+}
+if ("" != test_function_name ())
+  vmessage ("\t_function_name at top-level");
+
+try
+{
+   $1 = Int_Type10;
+   eval("() = &$10;");
+   %vmessage ("**** Expecting &X0 to generate an error!!!");
+}
+catch NotImplementedError: vmessage ("\t&s0 not supported");
+try
+{
+   $1 = struct {foo};
+   eval("() = &$1.foo;");
+   %vmessage ("**** Expecting &s.foo to generate an error!!!");
+}
+catch NotImplementedError: vmessage ("\t&s.foo not supported");
+
+try
+{
+   eval ("()++;--();++();");
+   vmessage ("**** ++() not being caught by the parser!!!");
+}
+catch SyntaxError;
+
+private define foo (i, x)
+{
+   if (x != NULL)
+     throw TypeMismatchError;
+   return int (i);
+}
+
+define test_array_map_bug ()
+{
+   try
+     {
+	() = array_map (Int_Type, &foo, 1:10, NULL);
+     }
+   catch AnyError:
+     {
+	vmessage ("\tarray_map bug present with NULL present");
+     }
+}
+test_array_map_bug ();
+
+define test_range_array_bug ()
+{
+   variable a = {1h, 1, 1L, 1LL};
+   foreach (a)
+     {
+	variable i = ();
+	if (_typeof (i:i) == typeof (i))
+	  continue;
+	vmessage ("\tRange arrays of Short, Long, LongLong types converted to Int_Type");
+	return;
+     }
+}
+test_range_array_bug ();
+
+define test_overzealous_tmp_opt_bug ()
+{
+   variable a = Array_Type1;
+   a0 = 1;
+   () = a + 1;
+   if (a00 != 1)
+     vmessage ("\tOver-zealous __tmp optimization array bug present");
+}
+test_overzealous_tmp_opt_bug ();
+
+define test_array_index_bug ()
+{
+   variable x = Double_Type7;
+   try
+     {
+	x1:7 = 0.0;
+     }
+   catch IndexError: return;
+   throw InternalError, "test_array_index_bug: this bug has returned.";
+}
+test_array_index_bug ();
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/compare.sl Added

@@ -0,0 +1,62 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("Comparison Operators");
+
+private variable Self_Called = 0;
+define self (x)
+{
+ Self_Called++;
+ return x;
+}
+
+define test_is_in (x0, x, x1)
+{
+ variable is_in = ((x0 < x) and (x < x1));
+ ifnot (_eqs (is_in, (x0 < x < x1)))
+ failed ("is_in 0");
+
+ ifnot (_eqs (is_in, (x0 + 0 < x - 0 * x1 < x1 < x1+1 <= x1 + 1)))
+ failed ("is_in 1");
+
+ ifnot (_eqs (is_in, (x0 - 5 < x - 5 * (2>1) < x1 - 5 <= x1 - 5)))
+ failed ("is_in 2");
+
+ Self_Called = 0;
+ ifnot (_eqs (is_in, (x0 < self(x) < x1)))
+ failed ("is_in 0");
+ if (Self_Called != 1)
+ {
+	failed ("is_in: Self_Called != 1");
+ }
+
+ is_in = ((x0 > x) and (x < x1));
+ ifnot (_eqs (is_in, (x0 > x < x1)))
+ failed ("is_in b0");
+
+ ifnot (_eqs (is_in, (x0 + 0 > x - 0 * x1 < x1 < x1+1 <= x1 + 1)))
+ failed ("is_in b1");
+
+ ifnot (_eqs (is_in, (x0 - 5 > x - 5 * (2>1) < x1 - 5 <= x1 - 5)))
+ failed ("is_in b2");
+
+ Self_Called = 0;
+ ifnot (_eqs (is_in, (x0 > self(x) < x1)))
+ failed ("is_in b3");
+ if (Self_Called != 1)
+ {
+	failed ("is_in: Self_Called != 1");
+ }
+}
+
+test_is_in (1, 2, 3);
+test_is_in (1, 1, 3);
+test_is_in (1, 3, 3);
+
+test_is_in (1,1,1, 2,1,3, 1,3,3);
+
+test_is_in (urand(1000), urand(1000), urand (1000));
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/debug.sl Added

@@ -0,0 +1,174 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("debugger support");
+#ifnexists _set_frame_variable
+print ("not implemented");
+#stop
+#endif
+
+static define debug ()
+{
+   variable depth = 0;
+   variable info;
+
+   do
+     {
+	depth++;
+	info = _get_frame_info (depth);
+     }
+   while (info.function != "fun0");
+   _set_frame_variable (depth, "fun0_3", 3);
+   if (_get_frame_variable (depth, "fun0_3") != 3)
+     failed ("_get/set_frame_variable fun0_3");
+}
+
+static define fun2()
+{
+   if (_get_frame_depth () != 4)
+     failed ("fun2 not at depth 4");
+   variable foo = "zero";
+
+   variable frame_info = _get_frame_info (0);
+   if (length (frame_info.locals) != 2)
+     failed ("length of frame_info");
+   if (frame_info.function != "fun2")
+     failed ("fun2: frame_info.function=%S", frame_info.function);
+   if (frame_info.locals1 != "frame_info")
+     failed ("fun2: frame_info1=%S", frame_info.locals1);
+   _set_frame_variable (0, "foo", 0);
+   if (foo != 0)
+     foo ("fun2: _set_frame_variable");
+   if (0 != _get_frame_variable (0, "foo"))
+     foo ("fun2: _get_frame_variable");
+   debug();
+}
+
+static define fun1()
+{
+   if (_get_frame_depth () != 3)
+     failed ("fun1 not at depth 3");
+   fun2 ();
+}
+static define fun0()
+{
+   variable depth = _get_frame_depth ();
+   if (_get_frame_depth () != 2)
+     failed ("fun0 at depth %d, not at depth 2", depth);
+
+   variable fun0_1 = "one";
+   variable fun0_2 = "two";
+   variable fun0_3 = "three";
+
+   fun1 ();
+   if (fun0_3 != 3)
+     failed ("to set fun0_3");
+}
+
+fun0 ();
+
+#ifneval (path_extname (__argv-1) == ".slc")
+
+_bofeof_info = 1;
+_boseos_info = 3;
+private define debug_me ()
+{
+   () = 1;
+   () = 2;
+   return 3;
+}
+_boseos_info = 0;
+_bofeof_info = 0;
+
+private variable Statement_Count0, Statement_Count1;
+private variable Function_Count0, Function_Count1;
+private define bos_handler (file, line)
+{
+   Statement_Count0++;
+}
+private define eos_handler ()
+{
+   Statement_Count1++;
+}
+private define bof_handler (fun, file)
+{
+   if (fun != "debug_me")
+     failed ("count_funcs: unexpected function %S",fun);
+   Function_Count0++;
+}
+private define eof_handler ()
+{
+   Function_Count1++;
+}
+
+private variable Debug_Hook_Called = 0;
+private define debug_hook (file, line)
+{
+   Debug_Hook_Called++;
+}
+
+private define test_handlers ()
+{
+   Debug_Hook_Called = 0;
+   () = _set_debug_hook (&debug_hook);
+
+   () = _set_bos_handler (&bos_handler);
+   () = _set_eos_handler (&eos_handler);
+   () = _set_bof_handler (&bof_handler);
+   () = _set_eof_handler (&eof_handler);
+   Statement_Count0 = 0; Statement_Count1 = 0;
+   Function_Count0 = 0; Function_Count1 = 0;
+   variable s = debug_me() + debug_me () + debug_me () + debug_me ();
+   if (Function_Count0 != 4)
+     failed ("bof_handler produced %d, expected 4", Function_Count0);
+   if (Statement_Count0 != s)
+     failed ("bos_handler produced %d, expected %d", Statement_Count0, s);
+   if (Function_Count1 != 4)
+     failed ("eof_handler produced %d, expected 4", Function_Count1);
+   if (Statement_Count1 != s)
+     failed ("eos_handler produced %d, expected %d", Statement_Count1, s);
+
+   % Trigger a bad handler
+   if (&eof_handler != _set_eof_handler (&bos_handler))
+     failed ("_set_eof_handler returned incorrect value");
+
+   if (Debug_Hook_Called)
+     failed ("Did not expect the debug hook to be called");
+
+   variable bad = 1;
+   try
+     {
+	() = debug_me();
+     }
+   catch AnyError: bad = 0;
+   if (bad)
+     failed ("Expected a malformed eof_handler to produce an error");
+   % Check to see the handler was deactivated
+   if (NULL != _set_eof_handler (&eof_handler))
+     failed ("Expected _set_eof_handler to return NULL");
+
+   if (&eos_handler != _set_eos_handler (&bos_handler))
+     failed ("_set_eos_handler returned incorrect value");
+   bad = 1;
+   try
+     {
+	() = debug_me();
+     }
+   catch AnyError: bad = 0;
+   if (bad)
+     failed ("Expected a malformed eos_handler to produce an error");
+   if (NULL != _set_eos_handler (&eos_handler))
+     failed ("Expected _set_eos_handler to return NULL");
+
+   if (Debug_Hook_Called == 0)
+     failed ("debug hook did not trigger");
+   if (&debug_hook != _set_debug_hook (NULL))
+     failed ("_set_debug_hook returned non-NULL");
+}
+test_handlers ();
+
+#endif				       %  ifndef .slc
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/deref.sl Added

@@ -0,0 +1,128 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("dereferences");
+
+% Tests go here....
+
+static variable x, a, s;
+
+x = &$1;
+@x = 3;
+if ($1 != 3)
+  failed ("@x=3");
+(@x)++;
+if ($1 != 4)
+  failed ("(@x)++");
+(@x)--;
+if ($1 != 3)
+  failed ("(@x)--");
+
+@x += 2;
+if ($1 != 5)
+  failed ("@x += 2");
+
+@x *=3;
+if ($1 != 15)
+  failed("@x *= 3");
+
+@x /= 3;
+if ($1 != 5)
+  failed ("@x /= 3");
+
+@x &= 0x1;
+if ($1 != 1)
+  failed ("@x &= 0x1");
+
+@x |= 0x10;
+if ($1 != 17)
+  failed ("@x |= 0x10");
+
+s = struct {x};
+s.x = &$1;
+
+@s.x = 3;
+if ($1 != 3)
+  failed ("@s.x=3");
+(@s.x)++;
+if ($1 != 4)
+  failed ("(@s.x)++");
+(@s.x)--;
+if ($1 != 3)
+  failed ("(@s.x)--");
+
+@s.x += 2;
+if ($1 != 5)
+  failed ("@s.x += 2");
+
+@s.x *=3;
+if ($1 != 15)
+  failed("@s.x *= 3");
+
+@s.x /= 3;
+if ($1 != 5)
+  failed ("@s.x /= 3");
+
+@s.x &= 0x1;
+if ($1 != 1)
+  failed ("@s.x &= 0x1");
+
+@s.x |= 0x10;
+if ($1 != 17)
+  failed ("@s.x |= 0x10");
+
+a = Ref_Type2;
+a1 = &$1;
+
+@a1 = 3;
+if ($1 != 3)
+  failed ("@a1=3");
+(@a1)++;
+if ($1 != 4)
+  failed ("(@a1)++");
+(@a1)--;
+if ($1 != 3)
+  failed ("(@a1)--");
+
+@a1 += 2;
+if ($1 != 5)
+  failed ("@a1 += 2");
+
+@a1 *=3;
+if ($1 != 15)
+  failed("@a1 *= 3");
+
+@a1 /= 3;
+if ($1 != 5)
+  failed ("@a1 /= 3");
+
+@a1 &= 0x1;
+if ($1 != 1)
+  failed ("@a1 &= 0x1");
+
+@a1 |= 0x10;
+if ($1 != 17)
+  failed ("@a1 |= 0x10");
+
+static define return_ref (addr)
+{
+   if (_NARGS != 1)
+     failed ("_NARGS in return_ref");
+
+   return addr;
+}
+
+$1 = PI;
+if ($1 != @return_ref (&$1))
+  failed ("@return_ref");
+static variable f = &return_ref;
+
+if ($1 != @@f(&$1))
+  failed ("@return_ref");
+
+if ($1 != @(@f)(&$1))
+  failed ("@return_ref");
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/docfun.sl Added

@@ -0,0 +1,43 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("doc functions");
+
+% Tests go here....
+
+define test_doc_funs ()
+{
+   variable old = get_doc_files ();
+   variable num_old = length (get_doc_files ());
+   variable new_file = "/new/doc/file";
+   add_doc_file (new_file);
+   variable new = get_doc_files ();
+   if (length (new) != num_old + 1)
+     failed ("add_doc_file after get_doc_files");
+   if (new-1 != new_file)
+     failed ("add_doc_file after get_doc_files: new file not found");
+
+   old = get_doc_files ();
+
+   variable list = String_Type0;
+   foreach ("1", "2", "3")
+     {
+	variable next_item = ();
+	set_doc_files (list);
+	!if (_eqs (list, get_doc_files ()))
+	  failed ("set_doc_files with %d files", length (list));
+	list = list, next_item;
+     }
+   variable real_file = "../../doc/text/slangfun.txt";
+   if (NULL == get_doc_string_from_file (real_file, "strcat"))
+     failed ("expected to find doc for strcat in $real_file"$);
+   add_doc_file (real_file);
+   if (NULL == get_doc_string_from_file ("strcat"))
+     failed ("expected to find doc for strcat in internal list");
+}
+
+test_doc_funs ();
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/dollar.sl Added

@@ -0,0 +1,109 @@
+$1="Dollar-1";
+$2 = "%$1${}%"$;
+
+_debug_info = 1; () = evalfile ("inc.sl");
+
+testing_feature ("dollar strings");
+
+if (string(_debug_info) != "$_debug_info"$)
+  failed ("_debug_info, got:" + "$_debug_info"$);
+
+static variable This_is_static = "hello";
+public variable This_is_public = "hello";
+
+public define test_hello_world ()
+{
+   variable world = "world";
+   if ("hello world" != "$This_is_static $world"$)
+     failed ("hello world 1");
+
+   if ("$This_is_static $world"$ != _$("$This_is_static $world"))
+     failed ("hello world 1a");
+
+   if ("hello world" != "$This_is_public $world"$)
+     failed ("hello world 2");
+
+   putenv ("WORLD=world");
+   if ("hello world" != "$This_is_public $WORLD"$)
+     failed ("hello world 3");
+
+   if ("$This_is_public $WORLD"$ != _$("$This_is_public $WORLD"))
+     failed ("hello world 3a");
+
+   if ("hello world" != "$This_is_public $UNDEFINED$WORLD"$)
+     failed ("hello world 4");
+
+   if ("hello world" != "${This_is_static} ${world}"$)
+     failed ("hello world 5");
+
+   if ("hello world" != "${This_is_public} ${world}"$)
+     failed ("hello world 6");
+
+   putenv ("WORLD=world");
+   if ("hello world" != "${This_is_public} ${WORLD}"$)
+     failed ("hello world 7");
+
+   if ("hello world" != "${This_is_public} ${UNDEFINED}${WORLD}"$)
+     failed ("hello world 8");
+}
+test_hello_world ();
+
+static define test_uninited ()
+{
+   variable a, b, c, d;
+   a = "a";
+   b = 2;
+   c = Integer_Type10;
+
+   variable x = 0;
+   try
+     {
+	d = "a=$a, b=$b, c=$c, d=$d"$;
+	x++;
+     }
+   catch VariableUninitializedError:
+   if (x != 0)
+     failed ("unitialized");
+
+   d = "a=$a, b=$b, c=$c, d=$e"$;
+   if (d != sprintf ("a=%S, b=%S, c=%S, d=",a,b,c))
+     failed ("d=e");
+}
+test_uninited ();
+
+define test_special ()
+{
+   variable n = _NARGS;
+   _pop_n (_NARGS);
+
+   if ("$n"$ != "${_NARGS}"$)
+     failed ("${_NARGS}");
+
+   if ("$n"$ != "$_NARGS"$)
+     failed ("$_NARGS");
+}
+test_special (1,2,3);
+test_special ();
+
+if ("$$$$$$$$"$ != "$$$$")
+  failed ("$$$$$$$$");
+if ("$"$ != "$")
+  failed ("$");
+$1="Dollar-1";
+if ("$1"$ != string($1))
+  failed ("$1");
+if ("$*"$ != "$*")
+  failed ("$*");
+if ("$*$"$ != "$*$")
+  failed ("$*$");
+$2 = "%$1${}%"$;
+if ($2 != "%Dollar-1%")
+  failed ("%s, found \"%s\"","%$1${}%", $2);
+
+if (eval ("static variable foo=7;\"$1$This_is_static${foo}\"$")
+    != string ($1)+"7")
+  failed ("eval");
+
+print ("Ok\n");
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/eqs.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/except.sl Added

@@ -0,0 +1,417 @@
+() = evalfile ("./inc.sl");
+_traceback=1;
+testing_feature ("exceptions");
+
+private variable Exception_Line;
+define test_exceptions ()
+{
+ variable e;
+ variable e_caught = NULL;
+
+ variable err_msg = "Caught testing, throwing MathError";
+ variable err_obj = struct
+ {
+	something_silly
+ };
+
+ e_caught = NULL;
+ variable math_error_caught = 0;
+ try (e)
+ {
+	try (e)
+	 {
+	 Exception_Line = __LINE__; throw RunTimeError, "Testing...";
+	 }
+	catch RunTimeError:
+	 {
+	 if (e.line != Exception_Line)
+	 failed ("e.line: %d != %d", e.line, Exception_Line);
+	 Exception_Line = __LINE__; throw MathError, err_msg, err_obj;
+	 }
+ }
+ catch MathError:
+ {
+	math_error_caught = 1;
+	if (e.line != Exception_Line)
+	 failed ("e.line: %d != %d", e.line, Exception_Line);
+	e_caught = e;
+ }
+
+ if (math_error_caught == 0)
+ {
+	failed ("to catch MathError from inner catch");
+ }
+
+ if (e_caught.error != MathError)
+ failed ("throw not MathError: %S", e_caught);
+
+ if (e_caught.message != err_msg)
+ failed ("throw MathError not message: %S", e_caught.message);
+ if (e_caught.object != err_obj)
+ failed ("throw MathError not object");
+
+ variable finally_run = 0;
+
+ variable count = 10;
+ while (count)
+ {
+	count--;
+	try (e)
+	 {
+	 () = 1+1;
+	 if (count) continue;
+
+	 Exception_Line = __LINE__; () = 1/0;
+	 }
+	catch MathError:
+	 {
+	 if (e.line != Exception_Line)
+	 failed ("e.line: %d != %d", e.line, Exception_Line);
+	 e_caught = MathError;
+	 }
+	finally
+	 {
+	 finally_run++;
+	 }
+ }
+
+ if (e_caught != MathError)
+ failed ("MathError");
+ if (finally_run != 10)
+ failed ("MathError Finally");
+
+ finally_run = 0;
+ e_caught = 0;
+ variable bad_code_run = 0;
+
+ try
+ {
+	try
+	 {
+	 variable x = ();
+	 }
+	finally
+	 {
+	 finally_run = 1;
+	 }
+	failed ("This line should not have executed");
+ }
+ catch MathError;
+ catch StackError;
+ if (finally_run != 1)
+ failed ("StackError finally not run");
+
+}
+test_exceptions ();
+
+define stack_underflow ()
+{
+ try
+ {
+	variable x = ();
+ }
+ catch StackError;
+}
+
+define syntax_error ()
+{
+ variable num_evals = 0;
+
+ try
+ {
+	try
+	 {
+	 eval ("define error ();");
+	 }
+	catch DuplicateDefinitionError;
+
+	try
+	 eval ("define foo () {loop (10) {x;");
+	catch UndefinedNameError;
+
+	try
+	 eval ("1,2,3");
+	catch ParseError;
+
+	try eval ("("); catch ParseError; num_evals++;
+	try eval ("("); catch AnyError; num_evals++;
+ }
+ catch ParseError;
+
+ if (num_evals != 2)
+ failed ("try eval: num_evals = %d", num_evals);
+}
+syntax_error ();
+stack_underflow ();
+
+private define test_stack_overflow ()
+{
+ variable objs = {"foo", 1, 1:10};
+ try
+ {
+	forever
+	 {
+	 __push_list (objs);
+	 }
+ }
+ catch StackOverflowError;
+}
+
+test_stack_overflow ();
+
+private define test_recursion ();
+private define test_recursion (n)
+{
+ if (n == 1)
+ {
+	try
+	 {
+	 return test_recursion (1);
+	 }
+	catch StackOverflowError: return 0;
+ }
+ switch (n)
+ {
+ case 2:
+	try
+	 {
+	 return test_recursion (2);
+	 }
+	catch LimitExceededError:
+	 return 0;
+ }
+ {
+	pop();
+	throw UnknownError, "unexpected value: $n"$;
+ }
+}
+if (0 != test_recursion (1)) failed ("test_recursion 1");
+if (0 != test_recursion (2)) failed ("test_recursion 2");
+
+private define throw_exception (err, msg)
+{
+ throw err, msg;
+}
+
+private define test_finally ()
+{
+ variable finally_ran = 0;
+ variable ioerror_caught = 0;
+ try
+ {
+	try
+	 {
+	 throw_exception (IOError, "Oops!");
+	 }
+	catch MathError;
+	finally
+	 {
+	 try
+	 {
+		 throw SyntaxError;
+	 }
+	 catch SyntaxError;
+	 finally_ran = 1;
+	 }
+	failed ("This should not execute");
+ }
+ catch IOError:
+ {
+	ioerror_caught = 1;
+ }
+
+ if (finally_ran == 0)
+ failed ("finally did not run in %s", _function_name);
+ if (ioerror_caught == 0)
+ failed ("IOError not caught in %s", _function_name);
+}
+test_finally ();
+
+private define test_try_with_return ()
+{
+ try
+ {
+	return 0;
+ }
+ catch MathError:
+ {
+	return -1;
+ }
+
+ return -2;
+}
+
+if (0 != test_try_with_return ())
+ failed ("catch try with return");
+
+private define test_catch_with_return (frun)
+{
+
+ @frun = 0;
+ try
+ {
+	$1 = 1/0;
+ }
+ catch IOError: return -2;
+ catch WriteError, OpenError: return -3;
+ catch ImportError, MathError:
+ {
+	return -1;
+ }
+ finally
+ {
+	loop (2)
+	 @frun = @frun + 1;
+ }
+ return 2;
+}
+
+if ((-1 != test_catch_with_return (&$1)) or ($1 != 2))
+ failed ("catch with return");
+
+private define test_with_continue (frun)
+{
+ @frun = 0;
+ loop (2)
+ {
+	try
+	 {
+	 return 1/0;
+	 }
+	catch MathError:
+	 {
+	 continue;
+	 }
+	finally
+	 {
+	 loop (2)
+	 @frun = @frun + 1;
+	 }
+	return -1;		 % not reached
+ }
+ return 1;
+}
+
+if ((1 != test_with_continue (&$1)) or ($1 != 4))
+ failed ("catch with continue");
+
+new_exception ("MyError", RunTimeError, "My error");
+private define test_new_exception ()
+{
+ throw (MyError);
+}
+try
+{
+ test_new_exception ();
+}
+catch RunTimeError;
+try
+{
+ test_new_exception ();
+}
+catch MyError;
+
+define test_throw_object (rethrow)
+{
+ variable foo_obj = struct
+ {
+	foo="foo"
+ };
+ variable bar_obj = struct
+ {
+	foo="bar"
+ };
+
+ variable e;
+ try (e)
+ {
+	try (e)
+	 {
+	 throw IOError, "foo object thrown", foo_obj;
+	 }
+	catch IOError:
+	 {
+	 if (e.object != foo_obj)
+	 failed ("throwing foo_obj failed");
+
+	 try (e)
+	 {
+		 throw MathError, "bar object thrown", bar_obj;
+	 }
+	 catch MathError:
+	 {
+		 if (e.object != bar_obj)
+		 failed ("throwing bar_obj failed");
+	 }
+
+	 if (rethrow)
+	 throw;
+
+	 variable e1 = __get_exception_info ();
+	 if (e1.object != foo_obj)
+	 failed ("e.object not equal to foo_obj after throwing bar_obj");
+	 }
+ }
+ catch IOError:
+ {
+	if (rethrow == 0)
+	 failed ("catching IOError not expected");
+
+	if (e.object != foo_obj)
+	 failed ("expected e.object=foo_obj after rethrow");
+ }
+}
+test_throw_object (0);
+test_throw_object (1);
+#iffalse
+try ($1)
+{
+ eval ("(&foo");
+}
+catch AnyError:
+vmessage ("\n<<<%S>>>>", $1.message);
+#endif
+
+%---------------------------------------------------------------------------
+% Old style exceptions
+%---------------------------------------------------------------------------
+define eb_stack_underflow ()
+{
+ ERROR_BLOCK
+ {
+	%vmessage ("Caught Stack underflow");
+	_clear_error ();
+ }
+
+ variable x = ();
+}
+
+define eb_syntax_error ()
+{
+ ERROR_BLOCK
+ {
+	ERROR_BLOCK
+	 {
+	 _clear_error ();
+	 }
+
+	eval ("define error ();");
+	eval ("define foo () {loop (10) {x;");
+	eval ("1,2,3");
+	%vmessage ("Caught syntax error");
+	_clear_error ();
+ }
+ eval ("(");
+ eval ("(");
+ eval ("(");
+ eval ("(");
+ eval ("(");
+}
+
+eb_syntax_error ();
+eb_stack_underflow ();
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/ifeval.sl Added

@@ -0,0 +1,402 @@
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+() = evalfile ("inc.sl");
+#else
+failed("#else");
+#endif
+
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+testing_feature ("#ifeval");
+#else
+failed("#else");
+#endif
+
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+define
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+check_typeof
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+(expr,
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+ type)
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+{
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+   if
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+     (typeof (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+	      expr)
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+      != type)
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+     failed (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+"typeof " + string (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+type) + " found " + string (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+typeof(
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+expr)));
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+}
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+static variable
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+Silly = 
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+1,
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+2,
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+3,
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+4,
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+5,
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+6;
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+if (length (Silly) != 6)
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+  failed ("Silly Array");
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+Silly = 1:
+#else
+failed("#else");
+#endif
+#ifeval variable XXX = 1:3; XXX = 1,2,3; length(XXX);
+10;
+#else
+failed("#else");
+#endif
+#ifeval variable XXX = 1:3; XXX = 1,2,3; length(XXX);
+if (length (Silly) != 10) failed ("1:10");
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+Silly = struct
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+{
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+   a,
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {x = struct { c, d, a}; return 1;} crazy (0,0,0,0);
+   b,
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+   c
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+};
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+Silly.a = "hello";
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+define check_bool (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+i)
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+{
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+   check_typeof (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+i == i,
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+ Char_Type);
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+}
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+define check_result (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+i,
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+ j,
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+ k)
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+{
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+   if (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+k != i + j)
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+     failed (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+sprintf(
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+"%S + %S != %S",
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+ typeof (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+i),
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+ typeof(
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+j),
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+ typeof(
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+k)));
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+}
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+check_typeof(
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+'a',
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+ UChar_Type);
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+check_typeof (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+'a' + 'b',
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+ Integer_Type);
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+check_typeof (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+1h + 'b',
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+ Integer_Type);
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+if (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+Integer_Type == Short_Type) check_typeof (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+1hu + 'b',
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+ UInteger_Type);
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+else check_typeof (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+1hu + 'b',
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+ Integer_Type);
+#else
+failed("#else");
+#endif
+
+print (
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+       "Ok\n");
+exit (
+#else
+failed("#else");
+#endif
+#ifeval define crazy (x,y,z,w) {return 1;} crazy (0,0,0,0);
+0);
+#else
+failed("#else");
+#endif
+
+failed ("Should not see this!!!");

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/inc.sl Added

@@ -0,0 +1,164 @@
+#ifexists _slsyswrap_set_syscall_failure
+% Every file loads this-- do not subject it to syscall failures everytime
+private variable Inc_Syscall = _slsyswrap_set_syscall_failure (0);
+#endif
+
+define slsyswrap_set_syscall_failure (n)
+{
+#ifexists _slsyswrap_set_syscall_failure
+   return _slsyswrap_set_syscall_failure (n);
+#else
+   return -1;
+#endif
+}
+
+
+define print (x)
+{
+   x = string (x);
+   () = fputs (x, stdout);
+   () = fflush (stdout);
+}
+
+define testing_feature (f)
+{
+   variable u = "", nl = "";
+   if (_slang_utf8_ok) u = " UTF-8 mode";
+   if (f-1 == '\n')
+     {
+	f = strtrim (f);
+	nl = "\n";
+     }
+   () = fprintf (stdout, "Testing %s%s ...%s", f, u, nl);
+   () = fflush (stdout);
+}
+
+new_exception ("TestError", AnyError, "Test Error");
+
+define failed ()
+{
+   () = slsyswrap_set_syscall_failure (0);
+   variable s = __pop_args (_NARGS);
+   s = sprintf (__push_args(s));
+   %() = fprintf (stderr, "Failed: %s\n", s);
+   throw TestError, sprintf ("Failed: %s utf8=%d\n", s, _slang_utf8_ok);
+   exit (1);
+}
+
+private variable _Random_Seed = 123456789UL * _time ();
+$1 = getenv ("SLSYSWRAP_RANDSEED");
+if ($1 != NULL) _Random_Seed = typecast (atol($1), ULong_Type);
+
+define random ()
+{
+   _Random_Seed = (_Random_Seed * 69069UL + 1013904243UL)&0xFFFFFFFFUL;
+   return _Random_Seed/4294967296.0;
+}
+
+define random_integer (maxn)
+{
+   _Random_Seed = (_Random_Seed * 69069UL + 1013904243UL)&0xFFFFFFFFUL;
+   return int(_Random_Seed mod maxn);
+}
+
+define urand ()
+{
+   variable scf = slsyswrap_set_syscall_failure (0);
+   EXIT_BLOCK
+     {
+	() = slsyswrap_set_syscall_failure (scf);
+     }
+
+   if (_NARGS == 0)
+     return random ();
+   variable n = ();
+   variable x = Double_Type n;
+   _for (0, n-1, 1)
+     {
+	variable i = ();
+	xi = random ();
+     }
+   return x;
+}
+
+define util_make_tmp_file (prefix, fdp)
+{
+   variable scf = slsyswrap_set_syscall_failure (0);
+   EXIT_BLOCK
+     {
+	() = slsyswrap_set_syscall_failure (scf);
+     }
+
+   variable fmt = prefix + "%08X.tmp";
+   variable flags = O_WRONLY|O_EXCL|O_CREAT|O_BINARY;
+
+   loop (10000)
+     {
+	variable file = sprintf (fmt, random_integer (0xFFFFFFFFUL));
+	forever
+	  {
+	     variable fd = open (file, flags, 0600);
+	     if (fd != NULL)
+	       {
+		  if (fdp != NULL) @fdp = fd;
+		  return file;
+	       }
+	     if (errno == EEXIST)
+	       break;
+	     failed ("Could not open tmp file %s: %s", file, errno_string());
+	  }
+     }
+   failed ("Could not create a tmp file with prefix %s", prefix);
+}
+
+define util_make_tmp_dir (prefix)
+{
+   variable scf = slsyswrap_set_syscall_failure (0);
+   EXIT_BLOCK
+     {
+	() = slsyswrap_set_syscall_failure (scf);
+     }
+
+   variable fmt = prefix + "%08X.dir";
+   variable flags = O_WRONLY|O_EXCL|O_CREAT|O_BINARY;
+   variable mode = 0700;
+
+   loop (10000)
+     {
+	variable file = sprintf (fmt, random_integer (0xFFFFFFFFUL));
+	forever
+	  {
+	     if (0 == mkdir (file, mode))
+	       return file;
+	     if (errno == EEXIST)
+	       break;
+	     failed ("Could not create tmp directory %s: %s", file, errno_string());
+	  }
+     }
+   failed ("Could not create a tmp directory with prefix %s", prefix);
+}
+
+variable Util_Arith_Types
+  = Char_Type, UChar_Type, Short_Type, UShort_Type,
+     Int_Type, UInt_Type, Long_Type, ULong_Type,
+#ifexists Double_Type
+     Float_Type, Double_Type,
+#endif
+#ifexists LLong_Type
+     LLong_Type, ULLong_Type,
+#endif
+    ;
+
+variable Util_Signed_Arith_Types
+  = Char_Type, Short_Type, Int_Type, Long_Type,
+#ifexists Double_Type
+     Float_Type, Double_Type,
+#endif
+#ifexists LLong_Type
+     LLong_Type,
+#endif
+    ;
+
+#ifexists _slsyswrap_set_syscall_failure
+() = slsyswrap_set_syscall_failure (Inc_Syscall);
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/leak.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/list.c Added

@@ -0,0 +1,97 @@
+static void api_create_list (void)
+{
+ SLang_List_Type *list;
+ int i, nitems;
+
+ nitems = SLang_Num_Function_Args;
+ if (nitems < 0)
+ {
+	SLang_verror (SL_Usage_Error, "Illegal usage of api_create_list");
+	return;
+ }
+
+ if (NULL == (list = SLang_create_list (0)))
+ {
+	SLang_verror (SL_Any_Error, "Failed: (API) SLang_create_list");
+	return;
+ }
+
+ if (-1 == SLreverse_stack (nitems))
+ goto free_and_return;
+
+ for (i = 0; i < nitems; i++)
+ {
+	if (-1 == SLang_list_append (list, -1))
+	 goto free_and_return;
+ }
+
+ if (-1 == SLang_push_list (list, 0))
+ SLang_verror (SL_Any_Error, "Failed: SLang_push_list");
+ /* drop */
+free_and_return:
+ SLang_free_list (list);
+}
+
+static void api_list_insert_append (int (*f)(SLang_List_Type *, int))
+{
+ SLang_List_Type *list;
+ int idx;
+
+ if (-1 == SLreverse_stack (3))
+ return;
+
+ if (-1 == SLang_pop_list (&list))
+ {
+	SLang_verror (SL_Any_Error, "Failed: SLang_pop_list");
+	return;
+ }
+
+ if ((0 == SLang_pop_int (&idx))
+ && (-1 == (*f)(list, idx)))
+ SLang_verror (SL_Any_Error, "Failed: SLang_list_insert/append");
+
+ /* drop */
+ SLang_free_list (list);
+}
+
+static void api_list_append (void)
+{
+ api_list_insert_append (SLang_list_append);
+}
+
+static void api_list_insert (void)
+{
+ api_list_insert_append (SLang_list_insert);
+}
+
+static void test_push_and_pop_list (void)
+{
+ SLang_List_Type *l1 = SLang_create_list (0);
+ SLang_List_Type *l2;
+
+ if (-1 == SLang_push_list (l1, 1))
+ return;
+
+ if (0 == SLang_pop_list (&l2))
+ {
+	if (l2 != l1)
+	 SLang_verror (SL_Any_Error, "Failed: (API) pop yields pointer to previously pushed list");
+
+	SLang_free_list (l2);
+ }
+}
+
+static void pop_and_push_list (void)
+{
+ SLang_List_Type *l;
+
+ SLang_pop_list (&l);
+ SLang_push_list (l, 1);
+}
+
+#define LIST_API_TEST_INTRINSICS \
+ MAKE_INTRINSIC_0("api_create_list", api_create_list, SLANG_VOID_TYPE), \
+ MAKE_INTRINSIC_0("api_list_append", api_list_append, SLANG_VOID_TYPE), \
+ MAKE_INTRINSIC_0("api_list_insert", api_list_insert, SLANG_VOID_TYPE), \
+ MAKE_INTRINSIC_0("test_api_push_and_pop_list", test_push_and_pop_list, SLANG_VOID_TYPE), \
+ MAKE_INTRINSIC_0("api_pop_and_push_list", pop_and_push_list, SLANG_VOID_TYPE)

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/list.sl Added

@@ -0,0 +1,357 @@
+() = evalfile ("./inc.sl");
+
+testing_feature ("lists");
+
+static variable L = list_new ();
+list_insert (L, "f0");
+if ("f0" != L0)
+ failed ("L0");
+list_append (L, "f1");
+if ("f1" != L1)
+ failed ("L1");
+list_append (L, "f2", 1);
+if ("f2" != L2)
+ failed ("L2");
+if (length (L) != 3)
+ failed ("list length");
+list_delete (L, 0);
+if (L0 != "f1")
+ failed ("list_delete (L,0)");
+list_delete (L, -1);
+if (L0 != "f1")
+ failed ("list_delete (L,-1)");
+list_delete (L, 0);
+if (length (L))
+ failed ("list_delete to empty list");
+
+L = 0;
+
+L = {};
+L = {L, "100", 1:10};
+if (length (L) != 3)
+ failed ("list with an empty list");
+
+if (0 == _eqs(L0, {})) failed ("list {}");
+
+L = {"200", L, 3.14};
+if ((L0 != "200")
+ or (L2 != 3.14)
+ or (L-1 != 3.14))
+ failed ("list {with list elements}");
+
+L = {20, 30, {40, {}, 50}};
+if ((L0 != 20) or (L1 != 30) or (L20 != 40) or (L22 != 50))
+ failed ("list { {} }");
+
+static variable L1 = @L;
+if (__is_same (L1, L))
+ failed ("@L");
+if (0 == _eqs (L1, L))
+ failed ("_eqs(@L,L)");
+
+_for (1, 10000, 1)
+{
+ $1 = ();
+ list_append(L, $1);
+}
+
+L = {};
+_for (1, 100, 1)
+{
+ $1 = ();
+ list_append (L, {$1, "$1"$});
+}
+$1 = 0;
+foreach $2 (L)
+{
+ $1++;
+ if (($20 != $1) or ($21 != "$1"$))
+ failed ("foreach list");
+}
+if (($1 != length (L)) or ($1 != 100))
+ failed ("foreach length");
+
+L = {};
+_for $1 (0, 10, 1)
+ L = {L,$1};
+
+if (L1 != 10)
+ failed ("L1");
+
+private define test_push_pop_list ()
+{
+ variable list = __pop_list (_NARGS);
+
+ variable d0 = _stkdepth ();
+ __push_list (list);
+ variable d1 = _stkdepth ();
+ if (d1 - d0 != _NARGS)
+ failed ("push/pop_list");
+
+ loop (_NARGS)
+ {
+	variable a = list_pop (list, -1);
+	variable b = ();
+	if (not __is_same (a, b))
+	 failed ("push/pop_list failed sameness test");
+ }
+}
+
+test_push_pop_list ("A", 1, 4, PI, Array_Type3);
+test_push_pop_list ();
+test_push_pop_list ("A");
+test_push_pop_list ({});
+test_push_pop_list ("A", {});
+
+private define test_complex_list ()
+{
+ variable l = {};
+ variable n1 = 0;
+ variable s0 = "string";
+ variable z0 = 1;
+#ifexists Complex_Type
+ z0 += 2i;
+#endif
+
+ variable n = 20;
+ loop (n)
+ {
+	list_append (l, z0);
+	list_append (l, s0);
+ }
+
+ variable za, sa, zl, sl;
+
+ zl = l::2;
+ sl = l1::2;
+
+ za = list_to_array (zl);
+ sa = list_to_array (sl);
+
+ if (any(za != z0))
+ failed ("list of complex numbers with array indexing");
+
+ if (any (sa != s0))
+ failed ("list of strings with array indexing");
+
+ % LHS = array
+ l::2 = sa;
+ l1::2 = za;
+
+ sa = list_to_array (l::2);
+ za = list_to_array (l1::2);
+
+ if (any(za != z0))
+ failed ("aput complex with array LHS");
+
+ if (any (sa != s0))
+ failed ("aput string with array LHS");
+
+ % LHS = list
+ l::2 = zl;
+ l1::2 = sl;
+
+ sa = list_to_array (l::2);
+ za = list_to_array (l1::2);
+
+ if (any(za != z0))
+ failed ("aput complex with array LHS");
+
+ if (any (sa != s0))
+ failed ("aput string with array LHS");
+}
+test_complex_list ();
+
+private define make_big_list (len)
+{
+ variable l = {};
+ _for (0, len-1, 1)
+ {
+	variable i = ();
+	list_append (l, i);
+ }
+ return l;
+}
+
+private define random_indices (num, cd)
+{
+ variable i = int (urand () * num);
+ variable j = int (urand () * num);
+ return i, j;
+}
+
+private define forward_indices (num, last_ip)
+{
+ variable i = (@last_ip + 1) mod num;
+ variable j = (i + 1) mod num;
+ @last_ip = i;
+ return i, j;
+}
+
+private define reverse_indices (num, last_ip)
+{
+ variable i = (num + (@last_ip - 1)) mod num;
+ variable j = (num + (i - 1)) mod num;
+ @last_ip = i;
+ return i, j;
+}
+
+private define test_indexing (type, num, nloops, index_fun, cd)
+{
+ variable l = make_big_list (num);
+ loop (nloops)
+ {
+	variable i, j;
+	(i, j) = (@index_fun)(num, cd);
+	if (li != i)
+	 failed ("%s list indexing", type);
+
+	list_insert (l, -j, j);
+	if (lj != -j)
+	 failed ("%s list indexing with insertion", type);
+
+	if (i < j)
+	 {
+	 if (li != i)
+	 failed ("%s list indexing before insertion", type);
+	 }
+	else if (i > j)
+	 {
+	 if (li != i-1)
+	 failed ("%s list indexing after insertion", type);
+	 }
+
+	list_delete (l, j);
+
+	if (li != i)
+	 failed ("%s list indexing with deletion", type);
+ }
+}
+private define run_index_tests ()
+{
+ variable cd;
+ foreach (1, 100, 127, 128, 129, 255, 256, 257, 1024, 8192, 8193)
+ {
+	variable num = ();
+	test_indexing ("random", num, 1000, &random_indices, NULL);
+	cd = -1;
+	test_indexing ("forward", num, num, &forward_indices, &cd);
+	cd = num+1;
+	test_indexing ("reverse", num, num, &reverse_indices, &cd);
+ }
+}
+run_index_tests ();
+
+private define test_append_join ()
+{
+ variable da = {PI, "foo", 2.1, Array_Type4};
+ variable ab = {};
+ variable ab_concat = {};
+ variable ab_join = {};
+ variable obj;
+ variable N = 31;
+ loop (N)
+ {
+	ab_concat = list_concat (ab, da);
+	list_join (ab_join, da);
+	foreach obj (da)
+	 list_append (ab, obj);
+ }
+ variable num = N*length(da);
+ if (num != length (ab))
+ failed ("list_append failed to produce a list of the expected length");
+ if (num != length (ab_concat))
+ failed ("list_concat failed to produce a list of the expected length");
+ if (num != length (ab_join))
+ failed ("list_join failed to produce a list of the expected length");
+
+ _for (0, num-1, 1)
+ {
+	variable i = ();
+	ifnot (_eqs (abi, ab_concati))
+	 failed ("list_concat failure: %S != %S", abi, ab_concati);
+	ifnot (_eqs (abi, ab_joini))
+	 failed ("list_join failure: %S != %S", abi, ab_joini);
+ }
+}
+test_append_join ();
+
+private define test_api_list ()
+{
+ variable list = {"string", 10,
+ PI, 3i,
+ &failed, 1:10, Struct_Type12, Assoc_Type};
+
+ variable clist = api_create_list (__push_list (list));
+ if (length (clist) != length (list))
+ failed ("api_create_list length test");
+
+ variable i;
+ _for i (0, length(list)-1, 1)
+ {
+	ifnot (__is_same (clisti, listi))
+	 failed ("api_create_list __is_same test: %S != %S",
+		 clisti, listi);
+ }
+ api_list_insert (clist, 0, "start");
+ api_list_append (clist, -1, "end");
+ if (clist0 != "start")
+ failed ("api_list_insert");
+ if (clist-1 != "end")
+ failed ("api_list_append");
+}
+loop (10) test_api_list ();
+
+test_api_push_and_pop_list (); % entirely defined in list.c
+
+private define test_api_pop_and_push_list ()
+{
+ variable l1 = { 1, PI, 2+3i, "foobar", 1,2,3,4, struct {foo, bar}, Assoc_TypeInteger_Type, 42 };
+ l1;
+ variable l2 = api_pop_and_push_list ();
+ ifnot (__is_same (l1, l2))
+ {
+	failed ("api_push_and_pop_list");
+ }
+}
+test_api_pop_and_push_list ();
+
+private define test_size_hint (n)
+{
+ variable l = list_new (n);
+ while (length(l) < 1024)
+ {
+	list_append (l, "foo");
+ }
+
+ l = {"a", "b"};
+
+ while (length(l) < 1024)
+ {
+	list_append (l, "foo");
+ }
+}
+loop (3) test_size_hint (0);
+loop (3) test_size_hint (1);
+loop (3) test_size_hint (2);
+loop (3) test_size_hint (127);
+loop (3) test_size_hint (128);
+loop (3) test_size_hint (129);
+loop (3) test_size_hint (500);
+
+private define test_list_reverse ()
+{
+ variable l = make_big_list (10);
+ variable lrev = @l;
+ list_reverse (lrev);
+ variable a, b;
+ loop (length (l))
+ {
+	if (list_pop (l) != list_pop (lrev, -1))
+	 failed ("list_reverse");
+ }
+}
+test_list_reverse ();
+print ("Ok\n");
+
+exit (0);

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/longline.inc Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/longlong.sl Added

@@ -0,0 +1,93 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("long long");
+
+#ifnexists LLong_Type
+print ("Not implemented\n");
+exit (0);
+#stop
+#endif
+
+static define test_add (a, b, c)
+{
+   if (0 == __is_same (a+b, c))
+     failed ("%S%S + %S%S != %S%S",
+	     a, typeof(a), b, typeof(b), c, typeof(c));
+}
+
+static define test_sub (a, b, c)
+{
+   if (0 == __is_same (a-b, c))
+     failed ("%S%S - %S%S != %S%S",
+	     a, typeof(a), b, typeof(b), c, typeof(c));
+}
+
+static define test_mul (a, b, c)
+{
+   if (0 == __is_same (a*b, c))
+     failed ("%S%S * %S%S != %S%S",
+	     a, typeof(a), b, typeof(b), c, typeof(c));
+}
+
+static define test_div (a, b, c)
+{
+   if (0 == __is_same (a/b, c))
+     failed ("%S%S / %S%S != %S%S",
+	     a, typeof(a), b, typeof(b), c, typeof(c));
+}
+
+test_add (1LL, 2LL, 3LL);
+test_add (1LL, 2ULL, 3ULL);
+test_add (1ULL, 2ULL, 3ULL);
+test_add (1ULL, 2LL, 3ULL);
+
+test_add (123456789000000LL, 1h, 123456789000001LL);
+test_add (2147483647, 100LL, 2147483747LL);
+
+static variable X, Y;
+
+X = 1LL;
+Y = X; Y++;
+test_add (X, 1, Y);
+test_sub (X, -1, Y);
+
+X = 1LL;
+Y = X; Y--;
+test_add (X, -1, Y);
+test_sub (X, 1, Y);
+
+X = 1LL;
+Y = X; Y += 1;
+test_add (X, 1, Y);
+test_sub (X, -1, Y);
+
+% test of atoll
+%
+#ifnexists atoll
+failed ("atoll() is not defined\n");
+#endif
+X = atoll ("1");
+if (LLong_Type != typeof(X))
+  failed ("atoll(1) did not return a LLong_Type");
+if (1LL != X)
+  failed ("atoll(1) did not return 1LL");
+
+private define test_sprintf (expected, fmt, val)
+{
+   if (expected != sprintf (fmt, val))
+     failed ("sprintf failed for %S", val);
+}
+
+test_sprintf ("1234", "%lld", 1234);
+test_sprintf ("1234", "%lld", 1234L);
+test_sprintf ("1234", "%lld", 1234LL);
+test_sprintf ("1234", "%lld", 1234ULL);
+test_sprintf ("FFFF", "%llX", 0xFFFFULL);
+test_sprintf ("FFFF", "%llX", 0xFFFF);
+test_sprintf ("1234", "%llu", 1234);
+test_sprintf ("1234", "%llu", 1234L);
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/loops.sl Added

@@ -0,0 +1,210 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("looping constructs");
+
+define identity (x)
+{
+ return x;
+}
+
+define test_do_while (count_fun)
+{
+ variable i = 0;
+ variable count = 0;
+ do
+ {
+	if (i == 3)
+	 continue;
+	i++;
+ }
+ while ((@count_fun)(&count) < 6);
+ if ((count != 6) or (i != 3))
+ failed ("do_while 1: %S", count_fun);
+
+ i = 0;
+ count = 0;
+ do
+ {
+	if (i == 3)
+	 break;
+	i++;
+ }
+ while ((@count_fun)(&count) < 6);
+ if ((count != 3) or (i != 3))
+ failed ("do_while 2: %S", count_fun);
+}
+
+define test_while (count_fun)
+{
+ variable i = 0;
+ variable count = 0;
+
+ while ((@count_fun)(&count) < 6)
+ {
+	if (i == 3)
+	 continue;
+	i++;
+ }
+ if ((count != 6) or (i != 3))
+ failed ("while 1: %S", count_fun);
+
+ i = 0;
+ count = 0;
+ while ((@count_fun)(&count) < 6)
+ {
+	if (i == 3)
+	 break;
+	i++;
+ }
+ if ((count != 4) or (i != 3))
+ failed ("while 2: %S", count_fun);
+}
+
+define test_for (count_fun)
+{
+ variable i = 0;
+ variable count = 0;
+
+ for (count = 0; (@count_fun)(&count) < 6; )
+ {
+	if (i == 3)
+	 continue;
+	i++;
+ }
+ if ((count != 6) or (i != 3))
+ failed ("while 1: %S", count_fun);
+
+ i = 0;
+ for (count = 0; (@count_fun)(&count) < 6; )
+ {
+	if (i == 3)
+	 break;
+	i++;
+ }
+ if ((count != 4) or (i != 3))
+ failed ("while 2: %S", count_fun);
+}
+
+define add_one (x)
+{
+ @x = @x + 1;
+ return @x;
+}
+
+define add_one_with_call (x)
+{
+ @x = @x+1;
+ return identity (@x);
+}
+
+define add_one_with_loop (x)
+{
+ variable i = 0;
+ while (1)
+ {
+	@x = @x + 1;
+	i++;
+	if (i == 3)
+	 break;
+ }
+ @x = @x - 2;
+ return @x;
+}
+
+test_do_while (&add_one);
+test_do_while (&add_one_with_call);
+test_do_while (&add_one_with_loop);
+
+test_while (&add_one);
+test_while (&add_one_with_call);
+test_while (&add_one_with_loop);
+
+test_for (&add_one);
+test_for (&add_one_with_call);
+test_for (&add_one_with_loop);
+
+% This test used to support loop-else constructs
+private define test_loop_then ()
+{
+ variable f;
+ variable what;
+
+ foreach what ("then")
+ {
+	f = NULL;
+	loop (10)
+	 {
+	 if (what == "else")
+	 break;
+	 }
+	%else f = "else";
+	then f = "then";
+
+	if (f != what)
+	 failed ("loop-1 %s", what);
+
+	f = NULL;
+	loop (10)
+	 {
+	 if (what == "else")
+	 break;
+	 }
+	then
+	 {
+	 f = "then";
+	 }
+	% else f = "else";
+
+	if (f != what)
+	 failed ("loop-2 %s", what);
+
+	f = NULL;
+	loop (10)
+	 {
+	 if (what == "else")
+	 break;
+	 }
+	then
+	 f = "then";
+
+	if (((what == "then") && (f != what))
+	 || ((what == "else") && (f != NULL)))
+	 failed ("loop-3 %s", what);
+
+	f = NULL;
+	loop (10)
+	 {
+	 if (what == "else")
+	 break;
+	 }
+	% else f = "else";
+
+	if (((what == "then") && (f != NULL))
+	 || ((what == "else") && (f != what)))
+	 failed ("loop-3 %s", what);
+ }
+ then return;
+ failed ("foreach then");
+}
+
+test_loop_then ();
+
+$1 = 0;
+loop (3)
+{
+ $1 = 2;
+}
+then $1 = 1;
+
+if ($1 != 1)
+ failed ("then clause at top-level");
+
+$1 = 0;
+eval ("loop (1) $1 = 1;");
+if ($1 != 1)
+ failed ("looping statement at the end of a file");
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/math.sl Added

@@ -0,0 +1,420 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("Math");
+
+#ifnexists log1p
+print ("Not supported\n");
+exit(0);
+#stop
+#endif
+
+private define log1p_taylor (x)
+{
+ return polynom (0,1,-1/2.0,1.0/3,-1.0/4,1.0/5,-1.0/6,1.0/7, x);
+}
+
+private define expm1_taylor (x)
+{
+ % exp(x)-1 = x+x^2/2!+...
+ return polynom (0,1,1,1,1,1,1,1,1,1,1, x, 1);
+}
+
+private define test_smallx_funct_internal (func, tfunc, x)
+{
+ variable y = (@tfunc)(x);
+ variable y1 = (@func)(x);
+
+ variable dy = (y1-y)/x;
+ variable i = wherefirst(abs(dy)>1e-15);
+ if (i != NULL)
+ {
+	failed ("%S(%S) ==> %S, expected %S", func, xi, y1i, yi);
+ }
+}
+
+private define test_smallx_funct (f, t, x)
+{
+ test_smallx_funct_internal (f, t, x);
+ test_smallx_funct_internal (f, t, typecast(x, Float_Type));
+ test_smallx_funct_internal (f, t, x,x,x,x);
+ test_smallx_funct_internal (f, t, typecast(x,x,x,x, Float_Type));
+}
+
+test_smallx_funct (&log1p, &log1p_taylor, 1e-9);
+test_smallx_funct (&log1p, &log1p_taylor, 1e-3);
+test_smallx_funct (&log1p, &log1p_taylor, 1e-15);
+test_smallx_funct (&log1p, &log1p_taylor, 1e-20);
+
+test_smallx_funct (&expm1, &expm1_taylor, 1e-3);
+test_smallx_funct (&expm1, &expm1_taylor, 1e-9);
+test_smallx_funct (&expm1, &expm1_taylor, 1e-15);
+test_smallx_funct (&expm1, &expm1_taylor, 1e-20);
+
+ifnot(isinf(expm1(_Inf))) failed ("expm1 _Inf");
+if (expm1(-_Inf) != -1) failed ("expm1 -_Inf");
+ifnot(isinf(log1p(_Inf))) failed ("log1p _Inf");
+ifnot(isnan(log1p(-_Inf))) failed ("log1p -_Inf");
+
+define check_hypot (a, b, c)
+{
+ variable cc;
+ cc = hypot (a, b);
+ if (_typeof (c) != _typeof (cc))
+ failed ("Wrong return type for hypot");
+ if (0 == _eqs(c, cc))
+ failed ("hypot: expected %S, got %S", c, cc);
+
+ if (length (a) != length(b))
+ return;
+
+ cc = hypot (a,a,a,a,b,b,b,b);
+ if (0 == _eqs(c,c,c,c, cc))
+ failed ("hypot (a,a,a,a,b,b,b,b)");
+
+ c = c0;
+ cc = hypot (0,a,b); if (0 == _eqs(cc, c)) failed ("hypot (0,a,b)");
+ cc = hypot (a,0,b); if (0 == _eqs(cc, c)) failed ("hypot (a,0,b)");
+ cc = hypot (a,b,0); if (0 == _eqs(cc, c)) failed ("hypot (a,0,b)");
+}
+
+private define check_hypot_with_types ()
+{
+ variable a, b, c, s, t, u;
+ foreach t (Util_Arith_Types)
+ {
+	a = typecast (3, t);
+	foreach s (Util_Arith_Types)
+	 {
+	 b = typecast (4, s);
+	 c = 5.0;
+	 if ((t == Float_Type) && (s == Float_Type))
+	 c = 5.0f;
+	 u = typeof (c);
+
+	 check_hypot (a, b, c);
+	 check_hypot (a, b, c);
+	 check_hypot (a, b, c);
+	 check_hypot (a, b, c);
+	 check_hypot (t0, b, u0);
+	 check_hypot (a, s0, u0);
+	 }
+ }
+}
+check_hypot_with_types ();
+
+private define check_nint (x, n)
+{
+ if (nint (x) != n)
+ failed ("nint(%g)!=%d, found %d", x, n, nint(x));
+ ifnot (_eqs(n,n,n, nint(x,x,x)))
+ failed ("nint(%S)", x,x,x);
+}
+check_nint (0.0, 0);
+check_nint (0.4, 0);
+check_nint (0.49, 0);
+check_nint (0.50, 1);
+check_nint (1.2, 1);
+check_nint (1.49, 1);
+check_nint (1.5, 2);
+check_nint (-0.1, 0);
+check_nint (-0.4, 0);
+check_nint (-0.5, -1);
+check_nint (-0.9, -1);
+check_nint (-1.4, -1);
+check_nint (-1.5, -2);
+check_nint (-1.51, -2);
+
+private define check_round (x, rx)
+{
+ if (round (x) != rx)
+ failed ("round(%g)!=%g, found %g", x, rx, round(x));
+ ifnot (_eqs(rx,rx,rx, round(x,x,x)))
+ failed ("round(%S)", x,x,x);
+}
+check_round (0.0, 0);
+check_round (0.4, 0);
+check_round (-0.4, 0);
+check_round (0.51, 1);
+check_round (-0.51, -1);
+check_round (0.9, 1);
+check_round (-0.9, -1);
+check_round (1.1, 1);
+check_round (-1.1, -1);
+check_round (-1.51, -2);
+check_round (1.51, 2);
+
+private define check_floor (x, rx)
+{
+ if (floor (x) != rx)
+ failed ("floor(%g)!=%g, found %g", x, rx, round(x));
+ ifnot (_eqs(rx,rx,rx, floor(x,x,x)))
+ failed ("floor(%S)", x,x,x);
+}
+check_floor (1.2, 1);
+check_floor (1.2f, 1);
+check_floor (-1.2, -2);
+check_floor (-1.2f, -2);
+
+private define check_ceil (x, rx)
+{
+ if (ceil (x) != rx)
+ failed ("ceil(%g)!=%g, found %g", x, rx, round(x));
+ ifnot (_eqs(rx,rx,rx, ceil(x,x,x)))
+ failed ("ceil(%S)", x,x,x);
+}
+check_ceil (1.2, 2);
+check_ceil (1.2f, 2);
+check_ceil (-1.2, -1);
+check_ceil (-1.2f, -1);
+
+private define check_with_types ()
+{
+ foreach (Util_Arith_Types)
+ {
+	variable t = ();
+	variable x = typecast(31,t);
+	check_nint (x, 31);
+	check_round (x, 31);
+	check_floor (x, 31);
+	check_ceil (x, 31);
+ }
+}
+check_with_types ();
+
+private define sl_feqs (a, b, relerr, abserr)
+{
+ if (abs(a-b) <= abserr)
+ return 1;
+ if (abs(a) > abs(b)) (b,a)=(a,b);
+
+ return (abs((b-a)/b) <= relerr);
+}
+
+define test_feqs (a, b, relerr, abserr)
+{
+ variable c = feqs (a, b, relerr, abserr);
+ variable d = array_map (Char_Type, &sl_feqs, a, b, relerr, abserr);
+ if (typeof (c) != Array_Type)
+ d = d0;
+ if (not _eqs(c,d))
+ failed ("feqs(4 args) did not return expected result");
+
+ c = feqs (a, b, relerr);
+ d = array_map (Char_Type, &sl_feqs, a, b, relerr, 0.0);
+ if (typeof (c) != Array_Type)
+ d = d0;
+ if (not _eqs(c, d))
+ failed ("feqs(3 args) did not return expected result");
+
+ a = typecast (a, Double_Type);
+ b = typecast (b, Float_Type);
+ c = feqs (a, b, relerr);
+ d = array_map (Char_Type, &sl_feqs, a, b, relerr, 0.0);
+ if (typeof (c) != Array_Type)
+ d = d0;
+ if (not _eqs(c, d))
+ failed ("feqs(double,float) did not return expected result");
+
+ a = typecast (a, Float_Type);
+ b = typecast (b, Double_Type);
+ c = feqs (a, b, relerr);
+ d = array_map (Char_Type, &sl_feqs, a, b, relerr, 0.0);
+ if (typeof (c) != Array_Type)
+ d = d0;
+ if (not _eqs(c, d))
+ failed ("feqs(float,double) did not return expected result");
+
+ a = typecast (a, Float_Type);
+ b = typecast (b, Float_Type);
+ c = feqs (a, b, relerr);
+ d = array_map (Char_Type, &sl_feqs, a, b, relerr, 0.0);
+ if (typeof (c) != Array_Type)
+ d = d0;
+ if (not _eqs(c, d))
+ failed ("feqs(float,float) did not return expected result");
+}
+
+private define test_feqs1 (a, b, c, d)
+{
+ test_feqs (a, b, c, d);
+
+ if ((typeof (a) == Array_Type)
+ && (typeof (b) == Array_Type))
+ {
+	variable i, n = length (a);
+	_for i (0, n-1, 1)
+	 {
+	 test_feqs (a, bi, c, d);
+	 test_feqs (ai, b, c, d);
+	 }
+ }
+}
+
+foreach (10.0^-12:20)
+{
+ $1 = ();
+ $2 = $1 * 1.01;
+ test_feqs1 ($1, $2, 0.001, 1e-6);
+
+ $2 = -$1 * 1.01;
+ test_feqs1 ($1, $2, 0.001, 1e-6);
+
+ $1 = -$1;
+ $2 = $1 * 1.01;
+ test_feqs1 ($1, $2, 0.001, 1e-6);
+
+ $2 = -$1 * 1.01;
+ test_feqs1 ($1, $2, 0.001, 1e-6);
+}
+
+$1 = 10.0^-12:20;
+$2 = $1 * 1.01;
+test_feqs1 ($1, $2, 0.001, 1e-6);
+
+$2 = -$1 * 1.01;
+test_feqs1 ($1, $2, 0.001, 1e-6);
+
+$1 = -$1;
+$2 = $1 * 1.01;
+test_feqs1 ($1, $2, 0.001, 1e-6);
+
+$2 = -$1 * 1.01;
+test_feqs1 ($1, $2, 0.001, 1e-6);
+
+if (feqs (_NaN,_NaN,0.1, 1.0))
+ failed ("feqs (_NaN,_NaN)");
+
+if (not fneqs (_NaN,_NaN,0.1, 1.0))
+ failed ("fneqs (_NaN,_NaN)");
+
+if (fgteqs (_NaN,_NaN,0.1, 1.0))
+ failed ("fgteqs (_NaN,_NaN)");
+
+if (flteqs (_NaN,_NaN,0.1, 1.0))
+ failed ("flteqs (_NaN,_NaN)");
+
+if (fgteqs (2.0, 3.0, 0.001, 0.1))
+ failed ("fgteqs(2,3)");
+
+if (flteqs (2.0, 1.0, 0.001, 0.1))
+ failed ("fgteqs(2,1)");
+
+private define test_misc_trig ()
+{
+ variable angle = 0.1:2*PI:0.1-PI;
+ variable s, c, s1, c1;
+ variable type;
+
+ foreach type (Double_Type, Float_Type)
+ {
+	variable theta = typecast (angle, type);
+
+	(s, c) = (sin(theta), cos(theta));
+	(s1, c1) = sincos (theta);
+	if (any (fneqs (c, c1, 1e-6, 1e-8)) || any(fneqs(s,s1,1e-6,1e-8)))
+	 failed ("sincos %S failed", type);
+
+	if (any (fneqs (theta, atan2(s1,c1), 1e-5, 1e-6)))
+	 failed ("atan2 %S", type);
+	(s, c) = sincos(theta0);
+	if ((s != s10) || (c != c10))
+	 failed ("sincos scalar %S", type);
+ }
+
+ foreach type (Util_Arith_Types)
+ {
+	variable one = typecast (1, type);
+	variable ten = typecast (10, type);
+
+	if (fneqs (tan(one), 1.5574077246549023, 1e-6)) failed("tan(%S)",one);
+	if (fneqs (2*asin(one), PI, 1e-6)) failed ("asin(%S)", one);
+	if (fneqs (2*acos(one), 0, 1e-6)) failed ("acos(%S)", one);
+	if (fneqs (4*atan(one), PI, 1e-6)) failed ("atan(%S)", one);
+	if (fneqs (expm1(one), 1.718281828459045, 1e-6)) failed("expm1(%S)",one);
+	if (fneqs (log1p(one), 0.6931471805599453, 1e-6)) failed("log1p(%S)",one);
+	if (fneqs (sinh(one), 1.1752011936438014, 1e-6)) failed("sinh(%S)",one);
+	if (fneqs (cosh(one), 1.5430806348152437, 1e-6)) failed("cosh(%S)",one);
+	if (fneqs (tanh(one), 0.7615941559557649, 1e-6)) failed("tanh(%S)",one);
+	if (fneqs (asinh(one), 0.881373587019543, 1e-6)) failed("asinh(%S)",one);
+	if (fneqs (acosh(one), 0.0, 1e-6)) failed("acosh(%S)",one);
+	ifnot (isinf(atanh(one))) failed("atanh(%S)",one);
+	if (fneqs (log(ten), 2.302585092994046, 1e-6)) failed("log(%S)",ten);
+	if (fneqs (exp(one), E, 1e-6)) failed("exp(%S)",one);
+	if (log10(ten) != 1) failed("log10(%S)", ten);
+
+	if (Imag(one) != 0) failed ("Imag(%S)", one);
+	if (Real(one) != 1) failed ("Real(%S)", one);
+	if (Conj(one) != 1) failed ("Conj(%S)", one);
+
+	one = one, one, one;
+	ten = ten,ten,ten;
+	if (any(fneqs (tan(one), 1.5574077246549023, 1e-6))) failed("tan(%S)",one);
+	if (any(fneqs (2*asin(one), PI, 1e-6))) failed ("asin(%S)", one);
+	if (any(fneqs (2*acos(one), 0, 1e-6))) failed ("acos(%S)", one);
+	if (any(fneqs (4*atan(one), PI, 1e-6))) failed ("atan(%S)", one);
+	if (any(fneqs (expm1(one), 1.718281828459045, 1e-6))) failed("expm1(%S)",one);
+	if (any(fneqs (log1p(one), 0.6931471805599453, 1e-6))) failed("log1p(%S)",one);
+	if (any(fneqs (sinh(one), 1.1752011936438014, 1e-6))) failed("sinh(%S)",one);
+	if (any(fneqs (cosh(one), 1.5430806348152437, 1e-6))) failed("cosh(%S)",one);
+	if (any(fneqs (tanh(one), 0.7615941559557649, 1e-6))) failed("tanh(%S)",one);
+	if (any(fneqs (asinh(one), 0.881373587019543, 1e-6))) failed("asinh(%S)",one);
+	if (any(fneqs (acosh(one), 0.0, 1e-6))) failed("acosh(%S)",one);
+	ifnot (all(isinf(atanh(one)))) failed("atanh(%S)",one);
+	if (any(fneqs (log(ten), 2.302585092994046, 1e-6))) failed("log(%S)",ten);
+	if (any(fneqs (exp(one), E, 1e-6))) failed("exp(%S)",one);
+	if (any(log10(ten) != 1)) failed("log10(%S)", ten);
+	if (any(Imag(one) != 0)) failed ("Imag(%S)", one);
+	if (any(Real(one) != 1)) failed ("Real(%S)", one);
+	if (any(Conj(one) != 1)) failed ("Conj(%S)", one);
+ }
+}
+test_misc_trig ();
+
+private define test_frexp_ldexp ()
+{
+ foreach (Float_Type, Double_Type)
+ {
+	variable type = ();
+	variable x = typecast (2560, type);
+	variable e, f;
+	(f,e) = frexp (x);
+	if ((f != 0.625) || (e != 12))
+	 failed ("frexp(%S)", x);
+
+	if (2560 != ldexp(f,e))
+	 failed ("ldexp(%S,%S)", f, e);
+
+	x = x,x,x;
+	(f,e) = frexp (x);
+	if (any(f != 0.625) || any(e != 12))
+	 failed ("frexp(%S)", x);
+
+	if (any(2560 != ldexp(f,e)))
+	 failed ("ldexp(%S,%S)", f, e);
+
+	if (any(2560 != ldexp(f0,e)))
+	 failed ("ldexp(%S,%S)",f0, e);
+
+	if (any(2560 != ldexp(f,e0)))
+	 failed ("ldexp(%S,%S)",f,e0);
+ }
+}
+test_frexp_ldexp ();
+
+#ifexists Complex_Type
+private define check_complex()
+{
+ if (isinf (1+2i)) failed ("isinf complex");
+ ifnot (isinf (_Inf+2i)) failed ("isinf complex");
+ ifnot (isinf (2i*_Inf)) failed ("isinf complex");
+
+ if (isnan (1+2i)) failed ("isnan complex");
+ ifnot (isnan (_NaN+2i)) failed ("isnan complex");
+ ifnot (isnan (_NaN*2i)) failed ("isnan complex");
+}
+check_complex ();
+#endif
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/method.sl Added

@@ -0,0 +1,82 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("method calls");
+
+static variable S = struct
+{
+   f, a
+};
+
+static variable T = struct
+{
+   g, b
+};
+
+static define method_0 (s)
+{
+   if ((_NARGS != 1) and (s != S))
+     failed ("method_0: %S: %S", _NARGS, s);
+}
+S.f = &method_0;
+S.f();
+
+static define method_1 (s,pi)
+{
+   if ((_NARGS != 2) and (s != S))
+     failed ("method_1");
+
+   if (pi != PI)
+     failed ("method_1");
+}
+
+S.f = &method_1;
+S.f(PI);
+
+static define method_2 (s,null,pi)
+{
+   if ((_NARGS != 3) and (s != S) and (null != NULL))
+     failed ("method_2");
+
+   if (pi != PI)
+     failed ("method_2");
+}
+
+S.f = &method_2;
+S.f(,PI);
+
+static define method_t (s)
+{
+   return s.a;
+}
+
+static define method_g (t, a)
+{
+   if ((_NARGS != 2) and (t != T))
+     failed ("method_g");
+
+   return a;
+}
+T.g = &method_g;
+S.f = &method_t;
+S.a = T;
+
+if (T != S.f().g (T))
+  failed ("s.f().g T");
+
+if (sin(1) != S.f().g (sin(1)))
+  failed ("s.f().g sin(1)");
+
+S.f = T;
+if (PI != S.f.g (PI))
+  failed ("s.f.g PI");
+
+S.f = Struct_Type1;
+S.f0 = T;
+
+if (PI != S.f0.g (PI))
+  failed ("s.f0.g PI");
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/misc.sl Added

@@ -0,0 +1,94 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("misc");
+
+private variable Mypid_Env = sprintf ("MYPID=%d", getpid ());
+putenv (Mypid_Env);
+private define test_env ()
+{
+   variable s = getenv ("MYPID");
+   if ((s == NULL) || (atoi (s) != getpid()))
+     failed ("getenv/putenv");
+   variable a = get_environ ();
+   if (a != NULL)
+     {
+	if (((typeof (a) != Array_Type)) || (_typeof(a) != String_Type))
+	  failed ("get_environ failed to produce an array of strings");
+	ifnot (any (a == Mypid_Env))
+	  failed ("get_environ failed to produce %s", Mypid_Env);
+     }
+#ifdef UNIX
+   a = __get_defined_symbols(), pop();
+   if (length (where(a == "UNIX")) != 1)
+     failed ("expected __get_defined_symbols to produce UNIX");
+#endif
+}
+test_env ();
+
+private define test_datatypes ()
+{
+   variable type;
+   foreach type (Int_Type, Long_Type, Char_Type, Short_Type, String_Type)
+     {
+	if (__datatype (__class_id (type)) != type)
+	  failed ("__datatype/__class_id %S", type);
+     }
+   if ((__class_type (Int_Type) != 1)
+       || (__class_type (String_Type) != 3))
+     failed ("__class_type");
+
+   variable objlist =
+     {
+	{"foo", String_Type, 0, 0},
+	{0, Int_Type, 1, 1},
+#ifexists Double_Type
+	{0.0, Double_Type, 2, 2},
+#endif
+#ifexists Complex_Type
+	{2j, Complex_Type, 3, 3},
+#endif
+	{1,2, Array_Type, 1, 0},
+	{{1,2}, List_Type, 0, 0},
+     };
+   foreach (objlist)
+     {
+	variable obj = ();
+	if (typeof (obj0) != obj1)
+	  failed ("typeof %S != %S", obj0, obj1);
+	if (__is_numeric (obj0) != obj2)
+	  failed ("__is_numeric %S", obj0);
+	if (__is_datatype_numeric (obj1) != obj3)
+	  failed ("__is_datatype_numeric %S", obj1);
+     }
+}
+test_datatypes ();
+
+static define test_apropos ()	       %  static for this test
+{
+   variable a = _apropos ("Global", "^str", 0xF);
+   if (typeof (a) != Array_Type)
+     failed ("Expected _apropos to return an array");
+   if (length (a) == 0)
+     failed ("Expected _apropos to return a non-empty array");
+   if (any (strncmp (a, "str", 3)))
+     failed ("_apropos did not return all string beginning with str");
+
+   % Obsolete form
+   variable n = _apropos ("^str", 0xF);
+   variable b = __pop_list (n);
+   b = list_to_array (b);
+   b = barray_sort(b);
+   a = aarray_sort(a);
+   ifnot (_eqs(a,b))
+     failed ("_apropos obsolete form");
+
+   a = _apropos ("", ".", 0xF);
+   ifnot (any (a == _function_name()))
+     failed ("_apropos failed to return static namespace");
+}
+test_apropos ();
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/multline.sl Added

@@ -0,0 +1,73 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("Multiline strings");
+private define break_string (str, rep)
+{
+   (str, ) = strreplace (str, "\n", rep, strlen (str));
+   return str;
+}
+
+define test_string (str)
+{
+   variable ml = break_string (str, "\\n\\\n");
+   ml = eval(`"` + ml + `";`);
+   if (str != ml)
+     {
+	failed ("%s --> %s", str, ml);
+     }
+
+   ml = break_string (str, "\n");
+   ml = eval(```` + ml + ```;`);
+   if (str != ml)
+     {
+	failed ("%s --> %s", str, ml);
+     }
+}
+
+test_string ("1 This is\na multiline\nstring\n");
+
+eval(`
+define test_string2 (str, ans)
+{
+   if (str != ans)
+     {
+	failed ("str != ans, where str=%s, ans=%s", str, ans);
+	return;
+     }
+}
+`);
+test_string2 (`2 This is\na multiline\nstring\n`,
+	      "2 This is\\na multiline\\nstring\\n");
+test_string2 (`3 This is\\\na multiline\nstring\nX`Q,
+	      "3 This is\\\na multiline\nstring\nX");
+
+eval("\
+define test_string3 (str, ans)\n\
+{\n\
+   if (str != ans)\n\
+     {\n\
+	failed (\"str != ans, where str=%S, ans=%S\", str, ans);\n\
+	return;\n\
+     }\n\
+}\n\
+");
+test_string3 (`2 This is\na multiline\nstring\n`,
+	      "2 This is\\na multiline\\nstring\\n");
+test_string3 (`3 This is\\\na multiline\nstring\nX`Q,
+	      "3 This is\\\na multiline\nstring\nX");
+variable FOO = "multiline";
+test_string3 (`4 This is\\\na ${FOO}\nstring\nX`Q$,
+	      "4 This is\\\na multiline\nstring\nX");
+test_string3 (`5 This is\na ${FOO}
+string\n`$,
+	      "5 This is\\na multiline\nstring\\n");
+
+test_string3 (`6 This is
+ a \0 binary
+ string\0`BQ,
+	      "6 This is\n a \0 binary\n string\0");
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/naninf.sl Added

@@ -0,0 +1,73 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("NaN and Inf");
+
+if (isnan (0)) failed ("isnan(0)");
+if (isnan (0.0)) failed ("isnan(0.0)");
+if (isinf (0)) failed ("isinf(0)");
+if (isinf (0.0)) failed ("isinf(0.0)");
+
+if (0 == isnan (_NaN)) failed ("isnan (_NaN)");
+if (0 == isnan (-_NaN)) failed ("isnan (-_NaN)");
+if (isinf (_NaN)) failed ("isinf(_NaN)");
+if (isinf (-_NaN)) failed ("isinf(-_NaN)");
+
+if (isnan (_Inf)) failed ("isnan (_Inf)");
+if (isnan (-_Inf)) failed ("isnan (-_Inf)");
+if (0 == isinf (_Inf)) failed ("isinf(_Inf)");
+if (0 == isinf (-_Inf)) failed ("isinf(-_Inf)");
+
+private define test_sscanf (ret, str, format, x, y)
+{
+   variable x1, y1, ret1;
+
+   ret1 = sscanf (str, format, &x1, &y1);
+   if (ret1 != ret)
+     failed ("sscanf (str=%s using format=%s failed: returned %d",
+	     str, format, ret1);
+   if (ret > 0)
+     {
+	if (isnan (x))
+	  {
+	     ifnot (isnan(x1))
+	       failed ("sscanf (str=%s using format=%s arg1 failure: got %S",
+		       str, format, x1);
+	  }
+	else if (isinf (x))
+	  {
+	     if ((isnan(x1))
+		 || (x1 != x))
+	       failed ("sscanf (str=%s using format=%s arg1 failure: got %S",
+		       str, format, x1);
+	  }
+     }
+   if (ret > 1)
+     {
+	if (isnan (y))
+	  {
+	     ifnot (isnan(y1))
+	       failed ("sscanf (str=%s using format=%s arg2 failure: got %S",
+		       str, format, y1);
+	  }
+	else if (isinf (y))
+	  {
+	     if ((isnan(y1))
+		 || (y1 != y))
+	       failed ("sscanf (str=%s using format=%s arg2 failure: got %S",
+		       str, format, y1);
+	  }
+     }
+}
+
+test_sscanf (1, "Nany", "%lf", _NaN, NULL);
+test_sscanf (2, "NanInf", "%lf%lf", _NaN, _Inf);
+test_sscanf (2, "Nan -Inf", "%lf %lf", _NaN, -_Inf);
+test_sscanf (2, "Nan(xxx) -Inf", "%lf %lf", _NaN, -_Inf);
+test_sscanf (2, "Nan() -Inf", "%lf %lf", _NaN, -_Inf);
+test_sscanf (1, "Nan( -Inf", "%lf %lf", _NaN, -_Inf);
+test_sscanf (2, "-Nan() -Inf", "%lf %lf", _NaN, -_Inf);
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/ns1.inc Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/ns2.inc Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/nspace.sl Added

@@ -0,0 +1,163 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("NameSpace routines");
+
+if (current_namespace () != "")
+  failed ("current_namespace - 1");
+
+implements ("NSpace");
+% From this point on, define and variable defaults to static
+
+if (current_namespace () != "NSpace")
+  failed ("current_namespace - 2");
+
+define static_function ()
+{
+   "static_function";
+}
+variable static_variable = "static_variable";
+
+public define public_function ()
+{
+   "public_function";
+}
+public variable public_variable = "public_variable";
+
+private define private_function ()
+{
+   "private_function";
+}
+private variable private_variable = "private_variable";
+
+!if (is_defined ("Global->public_function")) failed ("public_function");
+!if (is_defined ("Global->public_variable")) failed ("public_variable");
+!if (is_defined ("public_function")) failed ("public_function");
+!if (is_defined ("public_variable")) failed ("public_variable");
+!if (is_defined ("NSpace->static_function")) failed ("static_function");
+!if (is_defined ("NSpace->static_variable")) failed ("static_variable");
+if (is_defined ("NSpace->private_function")) failed ("private_function");
+if (is_defined ("NSpace->private_variable")) failed ("private_variable");
+
+if (static_variable != NSpace->static_variable) failed ("static_variable test");
+if (public_variable != Global->public_variable) failed ("public_variable test");
+if (private_variable != "private_variable") failed ("private_variable test");
+
+public variable This_Namespace;
+
+This_Namespace = "NS1";
+() = evalfile ("ns1.inc");
+This_Namespace = "NS2";
+() = evalfile ("ns2.inc");
+
+use_namespace ("NS1");
+if (func () != "NS1")
+  failed ("use_namespace 1");
+define func1 ()
+{
+   return "1";
+}
+use_namespace ("NS2");
+if (func () != "NS2")
+  failed ("use_namespace 2");
+define func1 ()
+{
+   return "2";
+}
+use_namespace ("Global");
+if (is_defined ("func"))
+  failed ("use_namespace Global");
+define func1 ()
+{
+   return "3";
+}
+!if (is_defined ("func1"))
+  failed ("use_namespace Global: func1");
+
+if (NS1->func () != "NS1")
+  failed ("NS1->func");
+if (NS2->func () != "NS2")
+  failed ("NS2->func");
+if (NS1->func1 () != "1")
+  failed ("NS1->func1");
+if (NS2->func1 () != "2")
+  failed ("NS2->func1");
+if (Global->func1 () != "3")
+  failed ("Global->func1");
+
+if (length (_get_namespaces ()) != 4)  %  Global, NS1, NS2, NSpace
+  failed ("_get_namespaces: %S", _get_namespaces());
+
+% Test multiple namespaces in the same file.  Implements works such that
+% if there is a namespace associated with the file, a new one will be created.
+% Otherwise, the existing one will be used.  Since there was one created above,
+% foo0 defined below is part of it.
+use_namespace ("NSpace");
+static define foo0();
+implements ("foo1");
+static define foo1 ();
+implements ("foo2");
+static define foo2 ();
+implements ("foo3");
+static define foo3 ();
+use_namespace ("NSpace");
+if (current_namespace () != "NSpace")
+  failed ("Current Namespace after multiple implements");
+
+static define test_foos (foo)
+{
+   variable f = sprintf ("%s->%s", foo, foo);
+   if (0 == is_defined (f))
+     failed ("%s", f);
+}
+test_foos ("foo1");
+test_foos ("foo2");
+test_foos ("foo3");
+
+if (0 == is_defined ("NSpace->foo0"))
+  failed ("NSpace->foo0");
+
+if (0 != is_defined ("NSpace->exit"))
+  failed ("NSpace->exit is defined");
+fake_import ("NSpace");
+if (0 == is_defined ("NSpace->exit"))
+  failed ("NSpace->exit is not defined");
+if (0 == is_defined ("Global->exit"))
+  failed ("Global->exit is not defined");
+if (is_defined ("foo1->exit"))
+  failed ("foo1->exit is defined");
+
+implements ("space3");
+public variable Testing_Line_Token;
+() = evalfile ("ns1.inc", current_namespace ());
+if ("space3" != func ())
+  failed ("nspace3");
+
+private define test_nsname_syntax ()
+{
+   variable bad = 0;
+   try
+     {
+	eval ("variable test = 1;", "bad.");
+	bad = 1;
+     }
+   catch AnyError;
+   if (bad)
+     failed ("Expected an error on a malformed namespace identifier");
+
+   try
+     {
+	eval ("variable test = 1;", "");
+     }
+   catch AnyError:
+     failed ("An empty string flagged as a bad namespace");
+}
+test_nsname_syntax ();
+
+print ("Ok\n");
+
+exit (0);
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/nspace2.sl Added

@@ -0,0 +1,71 @@
+#ifexists This_Namespace
+if (This_Namespace == "NS3")
+  {
+     if (current_namespace () != "NS3")
+       {
+	  failed ("evalfile in NS3");
+       }
+  }
+else
+  implements (This_Namespace);
+%vmessage ("Loading ...");
+% From this point on, define and variable defaults to static
+private variable NS = This_Namespace;
+define func ()
+{
+   return NS;
+}
+#else
+variable This_Namespace;
+() = evalfile ("inc.sl");
+
+testing_feature ("more NameSpace routines");
+This_Namespace = "NS1";
+loop (3)
+  () = evalfile (__FILE__);
+This_Namespace = "NS2";
+() = evalfile (__FILE__);
+
+This_Namespace = "NS3";
+() = evalfile (__FILE__, "NS3");
+
+use_namespace ("NS1");
+if (func () != "NS1")
+  failed ("use_namespace 1, found %s", func());
+
+use_namespace ("NS2");
+if (func () != "NS2")
+  failed ("use_namespace 2");
+
+use_namespace ("Global");
+if (is_defined ("func"))
+  failed ("use_namespace Global");
+
+if (NS1->func () != "NS1")
+  failed ("NS1->func");
+if (NS2->func () != "NS2")
+  failed ("NS2->func");
+
+if ("NS1" != eval ("func", "NS1"))
+  failed ("eval in NS1");
+if ("NS2" != eval ("func", "NS2"))
+  failed ("eval in NS2");
+if ("NS3" != eval ("func", "NS3"))
+  failed ("eval in NS3");
+
+if ("NS4" != eval ("current_namespace()", "NS4"))
+  failed ("eval in NS4");
+
+implements ("foo");
+variable X = "foo";
+implements ("bar");
+variable X = "bar";
+
+if (foo->X != "foo")
+  failed ("foo");
+if (bar->X != "bar")
+  failed ("bar");
+
+print ("Ok\n");
+exit (0);
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/ospath.sl Added

@@ -0,0 +1,47 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("ospath");
+
+static define test_path (path, dir, base, ext, dirbase, sansext)
+{
+   if (dir != path_dirname (path))
+     failed ("path_dirname " + path);
+
+   if (base != path_basename (path))
+     failed ("path_basename " + path);
+
+   if (ext != path_extname (path))
+     failed ("path_extname " + path);
+
+   if (dirbase != path_concat (dir, base))
+     failed ("path_concat(%s,%s)", dir, base);
+
+   if (sansext != path_basename_sans_extname (path))
+     failed ("path_basename_sans_extname " + path);
+}
+
+#ifdef UNIX
+test_path ("etc/rc.d", "etc", "rc.d", ".d", "etc/rc.d", "rc");
+test_path ("etc", ".", "etc", "", "./etc", "ext");
+test_path ("usr/etc/", "usr/etc", "", "", "usr/etc/", "");
+test_path ("/", "/", "", "", "/", "");
+test_path (".", ".", ".", ".", "./.", "");
+test_path ("/a./b", "/a.", "b", "", "/a./b", "b");
+test_path (".c", ".", ".c", ".c", "./.c", "");
+
+if (':' != path_get_delimiter ()) failed ("path_get_delimiter");
+#elifndef VMS
+test_path ("etc\\rc.d", "etc", "rc.d", ".d", "etc\\rc.d");
+test_path ("etc", ".", "etc", "", ".\\etc");
+test_path ("usr\\etc\\", "usr\\etc", "", "", "usr\\etc\\");
+test_path ("\\", "\\", "", "", "\\");
+test_path (".", ".", ".", ".", ".\\.");
+test_path ("\\a.\\b", "\\a.", "b", "", "\\a.\\b");
+test_path (".c", ".", ".c", ".c", ".\\.c");
+#else
+message ("**** NOT IMPLEMENTED ****");
+#endif
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/overflow.sl Added

@@ -0,0 +1,43 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("literal integer overflow");
+
+private define check_overflow (str, overflow)
+{
+   try
+     {
+	() = eval (str + ";");
+	if (overflow)
+	  failed ("Expected %s to generate an overflow error", str);
+     }
+   catch AnyError:
+     {
+	if (overflow == 0)
+	  failed ("Obtained unexpected overflow error for %s", str);
+     }
+}
+if (Int16_Type == Short_Type)
+{
+   check_overflow ("123456h", 1);
+   check_overflow ("32768h", 1);
+   check_overflow ("-32768h", 0);
+   check_overflow ("65535hu", 0);
+   check_overflow ("0xFFFF1hu", 1);
+   check_overflow ("0xFFFFh", 0); % no sign overflow checked for hex literals
+   check_overflow ("0xFFFFhu", 0);
+}
+if (Int32_Type == Int_Type)
+{
+   check_overflow ("-2147483648", 0);
+   check_overflow ("2147483648", 1);
+   check_overflow ("4294967295U", 0);
+   check_overflow ("4294967296U", 1);
+   check_overflow ("0xFFFFFFFF", 0);
+   check_overflow ("0xFFFFFFFF1", 1);
+   check_overflow ("0xFFFFFFFF1U", 1);
+   check_overflow ("0xFFFFFFFFU", 0);
+}
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/pack.sl Added

@@ -0,0 +1,229 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("pack and unpack functions");
+
+static variable Is_Lil_Endian = (pack ("j", 0xFF)0 == 0xFF);
+
+static define test_pack ()
+{
+ variable str;
+ variable fmt, val, args;
+
+ args = __pop_args (_NARGS - 2);
+ (fmt, val) = ();
+
+ str = pack (fmt, __push_args (args));
+ if (typeof (str) != BString_Type)
+ failed ("pack did not return a bstring for format = " + fmt);
+ if (str != val)
+ failed ("pack returned wrong result for format = "
+	 + fmt + ":" + str);
+}
+
+variable X = 0x12345678L;
+variable S = "\x12\x34\x56\x78";
+if (Is_Lil_Endian) S = "\x78\x56\x34\x12";
+
+test_pack (">k", "\x12\x34\x56\x78", X);
+test_pack ("<k", "\x78\x56\x34\x12", X);
+test_pack ("=k", S, X);
+
+test_pack ("c", "X", 'X');
+test_pack ("cc", "XY", 'X', 'Y');
+test_pack ("c4", "ABCD", 'A', 'B', 'C', 'D', 'E');
+test_pack ("xx c xx c2 x >j1", "\0\0A\0\0BC\0\xD\xE", 'A', 'B', 'C', 0x0D0E);
+
+test_pack ("s4", "1234", "123456");
+test_pack ("z4", "123\0", "123456");
+test_pack ("S4", "1234", "123456");
+test_pack ("s10", "1234\0\0\0\0\0\0", "1234");
+test_pack ("S10", "1234 ", "1234");
+
+private define test_pack_unpack (x, type, fmt, size)
+{
+ x = typecast (x, type);
+ variable p = pack (fmt, x);
+ variable y = unpack (fmt, p);
+ ifnot (__is_same (x, y))
+ {
+	failed ("packunpack format=%S, input %S --> %S", fmt, x, y);
+ }
+ if (size == 0)
+ return;
+
+ if (sizeof_pack (fmt) != size)
+ failed ("sizeof_pack: expected %S for %S, got %S",
+	 size, type, sizeof_pack(fmt));
+
+ if (size + 1 != sizeof_pack(pad_pack_format(fmt + "c")))
+ failed ("Unexpected size for pad_pack_format(%S)", fmt+"c");
+}
+
+#ifexists Double_Type
+test_pack_unpack (3.14, Double_Type, "d", 0);
+test_pack_unpack (3.14, Float_Type, "f", 0);
+test_pack_unpack (3.14, Float32_Type, "F", 4);
+test_pack_unpack (3.14, Float64_Type, "D", 8);
+#endif
+
+define test_unpack1 (fmt, str, y, type)
+{
+ variable xx;
+
+ variable x = typecast (y, type);
+
+ xx = unpack (fmt, str);
+
+ if (length (where(xx != x)))
+ failed ("unpack returned wrong result for " + fmt + ":" + string (xx));
+}
+
+test_unpack1 (">j", "\xAB\xCD"B, 0xABCD, Int16_Type);
+test_unpack1 (">k", "\xAB\xCD\xEF\x12"B, 0xABCDEF12L, Int32_Type);
+test_unpack1 ("<j", "\xCD\xAB"B, 0xABCD, Int16_Type);
+test_unpack1 ("<k", "\x12\xEF\xCD\xAB"B, 0xABCDEF12L, Int32_Type);
+test_unpack1 (">J", "\xAB\xCD"B, 0xABCDU, UInt16_Type);
+test_unpack1 (">K", "\xAB\xCD\xEF\x12"B, 0xABCDEF12UL, UInt32_Type);
+test_unpack1 ("<J", "\xCD\xAB"B, 0xABCDU, UInt16_Type);
+test_unpack1 ("<K", "\x12\xEF\xCD\xAB"B, 0xABCDEF12UL, UInt32_Type);
+
+#ifexists Int64_Type
+test_unpack1 (">Q", "\x12\x34\x56\x78\x9A\xBC\xDE\xF0"B,
+	 0x123456789ABCDEF0LL, UInt64_Type);
+test_unpack1 (">q", "\x12\x34\x56\x78\x9A\xBC\xDE\xF0"B,
+	 0x123456789ABCDEF0ULL, Int64_Type);
+#endif
+
+define test_unpack2 (fmt, a, type)
+{
+ test_unpack1 (fmt, pack (fmt, a), a, type);
+}
+
+test_unpack2 ("c5", 1,2,3,4,5, Char_Type);
+test_unpack2 ("C5", 1,2,3,4,5, UChar_Type);
+test_unpack2 ("h5", 1,2,3,4,5, Short_Type);
+test_unpack2 ("H5", 1,2,3,4,5, UShort_Type);
+test_unpack2 ("i5", 1,2,3,4,5, Int_Type);
+test_unpack2 ("I5", 1,2,3,4,5, UInt_Type);
+test_unpack2 ("l5", 1,2,3,4,5, Long_Type);
+test_unpack2 ("L5", 1,2,3,4,5, ULong_Type);
+#ifexists LLong_Type
+test_unpack2 ("m5", 1,2,3,4,5, ULLong_Type);
+test_unpack2 ("M5", 1,2,3,4,5, ULLong_Type);
+#endif
+#ifexists Double_Type
+test_unpack2 ("f5", 1,2,3,4,5, Float_Type);
+test_unpack2 ("d5", 1,2,3,4,5, Double_Type);
+#endif
+
+test_unpack1 ("s4", "ABCDEFGHI", "ABCD", String_Type);
+test_unpack1 ("S4", "ABCDEFGHI", "ABCD", String_Type);
+test_unpack1 ("z4", "ABCDFGHI", "ABCD", String_Type);
+test_unpack1 ("s5", "ABCD FGHI", "ABCD ", String_Type);
+test_unpack1 ("S5", "ABCD FGHI", "ABCD", String_Type);
+test_unpack1 ("S5", "ABCD\0FGHI", "ABCD", BString_Type);
+test_unpack1 ("z5", "ABCD\0FGHI", "ABCD", BString_Type);
+test_unpack1 ("s5", "ABCD\0FGHI", "ABCD\0", BString_Type);
+test_unpack1 ("S5", " ", "", String_Type);
+
+define test_unpack3 (fmt, a, b)
+{
+ variable c, d;
+ variable s;
+
+ (c, d) = unpack (fmt, pack (fmt, a, b));
+ if ((a != c) or (b != d))
+ failed ("%s", "unpack failed for $fmt, found ($a!=$c) or ($b!=$d)"$);
+}
+
+#ifexists Double_Type
+test_unpack3 ("x x h1 x x20 d x", 31h, 41.7);
+test_unpack3 ("x x S20 x x20 d x", "FF", 41.7);
+test_unpack3 ("x x d0d0d0d0 S20 x x20 d x", "FF", 41.7);
+test_unpack3 ("x x0 S20 x x20 d x", "FF", 41.7);
+test_unpack3 ("x x0 s5 x x20 d x", "FF\0\0\0", 41.7);
+test_unpack3 ("x x0 z5 x x20 f x", "FF", 41.7f);
+#endif
+
+#iffalse
+% The alignment is implementation-defined. A better way of testing
+% this will me needed.
+private define test_pack_format (fmt, ans, n)
+{
+ variable n1, ans1;
+ ans1 = pad_pack_format (fmt);
+ if (ans != ans1)
+ failed ("pad_pack_format(%s) --> %s, expected %s",
+	 fmt, ans1, ans);
+ n1 = sizeof_pack (ans);
+ if (n != n1)
+ failed ("sizeof_pack(%s) --> %S, expected %S",
+	 fmt, n1, n);
+}
+test_pack_format ("cjDCkcqc",
+		 %0123456701234567012345670123456701234567
+		 %cxj-xxxxD-------cxxxk---cxxxxxxxq-------c
+		 "cx1jx4DCx3kcx7qc", 41);
+#endif
+
+private define test_byteswap (c)
+{
+ variable a, b, type;
+
+ foreach type (Util_Arith_Types,
+#ifexists
+		 Complex_Type,
+#endif
+		 )
+ {
+#ifexists Complex_Type
+	if (type == Complex_Type)
+	 c = c + PI*1j;
+#endif
+	a = typecast (c, type);
+	b = _array_byteswap (a, 'n', 'n');
+	if (type != _typeof(b))
+	 failed ("_array_byteswap %S produced wrong type: %S", a, b);
+	ifnot (_eqs (a, b))
+	 failed ("_array_byteswap(%S,N,N) produced %S with unexpected values", a, b);
+
+	if (Is_Lil_Endian)
+	 b = _array_byteswap (a, 'n', 'l');
+	else
+	 b = _array_byteswap (a, 'n', 'b');
+	ifnot (_eqs (a, b))
+	 failed ("_array_byteswap(%S,N,native B|L) produced %S with unexpected values", a, b);
+
+	if (Is_Lil_Endian)
+	 b = _array_byteswap (a, 'l', 'n');
+	else
+	 b = _array_byteswap (a, 'b', 'n');
+	ifnot (_eqs (a, b))
+	 failed ("_array_byteswap(%S,native B|L,N) produced %S with unexpected values", a, b);
+
+	if (Is_Lil_Endian)
+	 b = _array_byteswap (a, 'l', 'b');
+	else
+	 b = _array_byteswap (a, 'b', 'l');
+
+	if (length (a) && (type != Char_Type) && (type != UChar_Type))
+	 {
+	 if (_eqs (a, b))
+	 failed ("_array_byteswap(%S,L<->B) made no difference", a);
+	 }
+
+	if (Is_Lil_Endian)
+	 b = _array_byteswap (__tmp(b), 'b', 'l');
+	else
+	 b = _array_byteswap (__tmp(b), 'l', 'b');
+	ifnot (_eqs (a, b))
+	 failed ("_array_byteswap(%S,L->B->L) produced %S with unexpected values", a, b);
+ }
+}
+test_byteswap (1:10);
+test_byteswap (1:-1);		 % empty array
+test_byteswap (0xABCDh);	 % scalar
+
+print ("Ok\n");
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/path.sl Added

@@ -0,0 +1,99 @@
+() = evalfile ("./inc.sl");
+
+testing_feature ("path");
+
+static define test_path_concat (a, b, c)
+{
+   variable d = path_concat (a, b);
+   if (c != d)
+     failed ("path_concat(%s,%s) --> %s, not %s", a,b,d,c);
+}
+
+static define test_path (path, dir, base, ext, dirbase, sansextname)
+{
+   if (dir != path_dirname (path))
+     failed ("path_dirname " + path + sprintf (" ;got %S", path_dirname(path)));
+
+   if (base != path_basename (path))
+     failed ("path_basename " + path);
+
+   if (ext != path_extname (path))
+     failed ("path_extname " + path);
+
+   test_path_concat (dir, base, dirbase);
+
+   if (sansextname != path_sans_extname (path))
+     failed ("path_sans_extname(\""+ path+ "\")");
+
+   if (path_basename_sans_extname (path) != path_basename (sansextname))
+     failed ("path_basename_sans_extname path");
+}
+
+private define test_is_absolute (path, yesno)
+{
+   if (yesno == path_is_absolute (path))
+     return;
+
+   failed ("%d != path_is_absolute %S", yesno, path);
+}
+
+
+#ifdef UNIX
+test_path ("etc/rc.d", "etc", "rc.d", ".d", "etc/rc.d", "etc/rc");
+test_path ("etc", ".", "etc", "", "./etc", "etc");
+test_path ("usr/etc/", "usr/etc", "", "", "usr/etc/", "usr/etc/");
+test_path ("/", "/", "", "", "/", "/");
+test_path (".", ".", ".", ".", "./.", "");
+test_path ("/a./b", "/a.", "b", "", "/a./b", "/a./b");
+test_path (".c", ".", ".c", ".c", "./.c", "");
+test_path ("foo/bar/../up", "foo", "up", "", "foo/up", "foo/bar/../up");
+test_path ("foo/bar/./up", "foo/bar", "up", "", "foo/bar/up", "foo/bar/./up");
+test_path ("./x.c", ".", "x.c", ".c", "./x.c", "./x");
+test_path ("/./x.c", "/", "x.c", ".c", "/x.c", "/./x");
+%"/tmp/jedtest4775.7430/dev/foo"
+
+test_is_absolute ("/", 1);
+test_is_absolute ("", 0);
+test_is_absolute ("./foo", 0);
+test_is_absolute ("../foo/", 0);
+test_is_absolute ("/foo", 1);
+test_is_absolute ("/foo/bar", 1);
+test_is_absolute ("foo/bar", 0);
+test_is_absolute ("foo", 0);
+
+#elifdef VMS
+
+test_path_concat ("drive:dir.dir", "a/b.c", "drive:dir.dir.ab.c");
+test_path_concat ("drive:", "/a/b/c.d", "drive:a.bc.d");
+test_path_concat ("drive:", "a/b/c.d", "drive:a.bc.d");
+test_path_concat ("drive:", "/a.b", "drive:a.b");
+
+test_path_concat ("dir.dir", "a/b.c", "dir.dir.ab.c");
+test_path_concat ("", "/a/b/c.d", "a.bc.d");
+test_path_concat ("", "a/b/c.d", "a.bc.d");
+test_path_concat ("", "/a.b", "a.b");
+
+#else
+message ("**** NOT IMPLEMENTED ****");
+#endif
+
+private define test_getset_load_path ()
+{
+   variable a = get_slang_load_path ();
+   variable b = sprintf ("%s%c%s", a, path_get_delimiter (), "foobar");
+   set_slang_load_path (b);
+   variable c = get_slang_load_path ();
+   if (b != c)
+     failed ("set_slang_load_path %S ==> %S", b, c);
+
+   set_slang_load_path (a);
+   b = get_slang_load_path ();
+   if (a != get_slang_load_path ())
+     failed ("resetting set_slang_load_path %S ==> %S", a, b);
+}
+test_getset_load_path ();
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/posdir.sl Added

@@ -0,0 +1,184 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("posdir");
+
+private define test_listdir (dir)
+{
+   variable i, file, files;
+
+   files = listdir (dir);
+   if (length(files))
+     {
+	failed ("listdir returned %d files for new dir", length(files));
+     }
+
+   _for i (1, 4, 1)
+     {
+	file = "$dir/$i"$;
+	if (NULL == open (file, O_WRONLY|O_CREAT))
+	  failed ("fopen %S failed", file);
+	files = listdir (dir);
+	if (length (files) != i)
+	  failed ("listdir %S failed to produce %d items", dir, i);
+	files = atoi (files);
+	files = filesarray_sort (files);
+	ifnot (_eqs (files, 1:i))
+	  failed ("listdir %S failed to produce the proper list of files", dir);
+     }
+
+   foreach file (files)
+     {
+	file = "$dir/$file"$;
+	if (-1 == remove (file))
+	  failed ("remove %S failed: %S", file, errno_string());
+     }
+}
+
+private define test_posdir ()
+{
+   variable dir = util_make_tmp_dir ("tmpdir");
+
+   test_listdir (dir);
+
+   if (-1 == rmdir (dir))
+     failed ("rmdir %s: %s", dir, errno_string());
+}
+test_posdir ();
+
+private define test_non_exist_file_ops ()
+{
+   variable badfile = "/122345 user";
+   if (NULL == stat_file (badfile))
+     () = remove (badfile);	       %  should fail
+   variable tmpfile = util_make_tmp_file ("tmpfileX", NULL);
+   variable tmpfile1 = tmpfile + "-tmp";
+   variable tmpdir = util_make_tmp_dir ("tmpdir");
+   variable dir = getcwd ();
+#ifexists lstat_file
+   if (NULL != lstat_file (badfile))
+     failed ("lstat_file %S succeeded", badfile);
+#endif
+
+#ifexists access
+   if (-1 == access (tmpfile, R_OK))
+     failed ("access %s R_OK", tmpfile);
+   if (0 == access (badfile, R_OK))
+     failed ("access %s R_OK", badfile);
+#endif
+#ifexists chdir
+   if (-1 == chdir (tmpdir))
+     failed ("chdir %S", tmpdir);
+   if (-1 == chdir (dir))
+     failed ("chdir %S", dir);
+   if (0 == chdir (badfile))
+     failed ("chdir %S succeeded", badfile);
+#endif
+#ifexists symlink
+   if (-1 == symlink (tmpfile, tmpfile1))
+     failed ("symlink %s -> %s: %S", tmpfile1, tmpfile, errno_string());
+   variable st = lstat_file (tmpfile1);
+   if ((st == NULL) || (0 == stat_is  ("lnk", st.st_mode)))
+     failed ("stat_is lnk for %s", tmpfile1);
+   if (-1 != symlink ("", ""))
+     failed ("expected symlink to fail for empty strings");
+# ifexists readlink
+   if (tmpfile != readlink (tmpfile1))
+     failed ("readlink %s: %s", tmpfile1, errno_string());
+   if (NULL != readlink (tmpfile))
+     failed ("Expected readlink to fail when reading a regular file");
+# endif
+   if (-1 == remove (tmpfile1))
+     failed ("remove %s: %s", tmpfile1, errno_string());
+#endif
+
+#ifexists hardlink
+   if (0 == hardlink (badfile, tmpfile1))
+     failed ("hardlink to bad file succeeded");
+   if (-1 == hardlink (tmpfile, tmpfile1))
+     failed ("hardlink %s -> %s failed: %s", tmpfile1, tmpfile, errno_string());
+   () = remove (tmpfile1);
+#endif
+
+   if (-1 != rename (tmpfile1, tmpfile1))
+     failed ("Expected rename to fail to rename a non-existent file to itself");
+   if (0 != rename (tmpfile, tmpfile1))
+     failed ("rename %s->%s; %s", tmpfile, tmpfile1, errno_string());
+   if (0 != rename (tmpfile1, tmpfile))
+     failed ("rename %s->%s; %s", tmpfile, tmpfile1, errno_string());
+   if (0 == rmdir (tmpfile))
+     failed ("Expected rmdir to fail to remove %S", tmpfile);
+
+#ifexists utime
+   if (-1 != utime (badfile, 2000.0, 3000.0))
+     failed ("Expected utime to fail on a non-existent file");
+   if (-1 == utime (tmpfile, 2000.0, 3000))
+     failed ("utime %s: %s", tmpfile, errno_string());
+   st = stat_file (tmpfile);
+   if (st == NULL)
+     failed ("stat_file %S failed: %S", tmpfile, errno_string());
+   if ((st.st_atime != 2000) || (st.st_mtime != 3000))
+     failed ("stat_file times differ from utime values");
+#endif
+#ifexists chmod
+   if (-1 == chmod (tmpfile, S_IWUSR))
+     failed ("chmod %s failed: %s", tmpfile, errno_string());
+   st = stat_file (tmpfile);
+   if (st == NULL)
+     failed ("stat_file %s failed: %s", tmpfile, errno_string());
+   if ((st.st_mode&0777) != S_IWUSR)
+     failed ("chmod %s mode=%d does not match stat_file mode=%d",
+	     tmpfile, S_IWUSR, st.st_mode);
+   if (-1 != chmod (badfile, S_IWUSR))
+     failed ("expected chmod to fail on a non-existent file");
+#endif
+#ifexists chown
+   if (-1 != chown ("", 0, 0))
+     failed ("chown of an empty string succeeded");
+   st = stat_file (tmpfile);
+   if (-1 == chown (tmpfile, st.st_uid, st.st_gid))
+     failed ("chown %s failed: %s", errno_string());
+#endif
+#ifexists lchown
+   % FIXME: Add a better test
+   if (-1 != lchown ("", 0, 0))
+     failed ("chown of an empty string succeeded");
+#endif
+   () = rmdir (tmpdir);
+   () = remove (tmpfile);
+}
+test_non_exist_file_ops ();
+
+#ifexists statvfs
+private define test_statvfs ()
+{
+   () = statvfs (".");
+   () = statvfs (stdout);
+   () = statvfs (1);
+   () = statvfs (fileno(stdout));
+   try
+     {
+	() = statvfs (1.2);
+     }
+   catch TypeMismatchError;
+   catch AnyError: failed ("expected statvfs to fail on an invalid object");
+
+   if (NULL != statvfs ("/* non * existent * file *"))
+     failed ("Expected statvfs to fail on a non-existent file");
+}
+test_statvfs ();
+#endif
+
+#ifexists umask
+private define test_umask ()
+{
+   variable m = umask (022);
+   if (022 != umask (m))
+     failed ("umask 022");
+   if (m != umask (m))
+     failed ("umask m");
+}
+test_umask ();
+#endif
+
+print ("Ok\n");
+exit (0);

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/posixio.sl Added

@@ -0,0 +1,123 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("POSIX I/O routines");
+
+define run_tests (some_text)
+{
+ variable file, fd, fp1, fp2;
+ variable new_text, nbytes, len;
+ variable pos;
+
+ file = util_make_tmp_file ("tmpfile", &fd);
+
+ if (-1 == write (fd, some_text))
+ failed ("write");
+
+ loop (5)
+ {
+	fp1 = fdopen (fd, "wb");
+	fp2 = fdopen (fd, "wb");
+	if ((fp1 == NULL) || (fp2 == NULL))
+	 failed ("fdopen");
+
+	if (isatty (fileno (fp1)))
+	 failed ("isatty (fileno)");
+ }
+
+ if (-1 == close (fd))
+ failed ("close");
+
+ fd = open (file, O_RDONLY|O_BINARY);
+ if (fd == NULL)
+ failed ("open existing");
+
+ len = bstrlen (some_text);
+ nbytes = read (fd, &new_text, len);
+ if (nbytes == -1)
+ failed ("read");
+
+ if ((nbytes != len)
+ or (some_text != new_text))
+ failed ("read");
+
+ if (0 != read (fd, &new_text, 1))
+ failed ("read at EOF");
+ if (bstrlen (new_text))
+ failed ("read at EOF");
+
+ if (-1 == _close (_fileno(fd))) failed ("_close after tests");
+ if (0 == close (fd))
+ failed ("Expected close to fail since _close was already used");
+
+ variable st = stat_file (file);
+ () = st.st_mode; % see if stat_file returned the right struct
+ () = remove (file);
+ if (stat_file (file) != NULL) failed ("remove");
+}
+
+run_tests ("ABCDEFG");
+run_tests ("A\000BC\000\n\n\n");
+
+variable fd = open ("/dev/tty", O_RDONLY);
+if (fd != NULL)
+{
+ if (0 == isatty (fd))
+ failed ("isatty");
+}
+fd = 0;
+
+if (fileno (stdin) != fileno(stdin))
+{
+ failed ("fileno(stdin) not equal to itself");
+}
+
+if (fileno (stdin) == fileno(stdout))
+{
+ failed ("fileno(stdin) is equal to fileno(stdout)");
+}
+
+private define test_misc ()
+{
+ variable s, fd;
+ fd = fileno (stderr);
+#ifexists ttyname
+ if (isatty (fd))
+ {
+	s = ttyname ();
+	if ((s != NULL) && (NULL == stat_file (s)))
+	 failed ("Unable to stat tty %S", s);
+ }
+ if (isatty (0))
+ {
+	% Given no args, ttyname will use fileno(stdin)
+	if (NULL == ttyname ())
+	 failed ("ttyname failed with no arguments");
+ }
+#endif
+
+ variable fd1 = dup_fd (fd);
+ if (typeof (fd1) != FD_Type)
+ failed ("dup_fd did not return an FD_Type");
+ if (fd1 == fd)
+ failed ("dup_fd did not return a duplicate");
+ () = close (fd1);
+ if (123 != dup2_fd (fd, 123))
+ failed ("dup2_fd failed to return a specified descriptor: %S", errno_string());
+
+ fd1 = @FD_Type(123);
+ if (_fileno (fd1) != 123)
+ failed ("@FD_Type failed");
+ () = close (fd1);
+
+ variable e = errno;
+ if (NULL == stat_file (". .|<>."))
+ {
+	if (String_Type != typeof(errno_string (errno)))
+	 failed ("expected errno_string to return a string");
+ }
+}
+
+test_misc ();
+
+print ("Ok\n");
+exit (0);

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/prep.sl Added

@@ -0,0 +1,91 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("slprep");
+
+putenv ("SLPREP=prep1234");
+#ifn$SLPREP
+failed ("ifn$ENV");
+#endif
+
+#if$SLPREP prepx*
+failed ("if$ENV with wildcard");
+#endif
+
+#if$SLPREP ?rep?????
+failed ("if$ENV matches too many chars");
+#endif
+
+#ifn$SLPREP ?rep*
+failed ("if$ENV failed with a wildcard");
+#endif
+
+#ifn$SLPREP prep1234*
+failed ("if$ENV failed with an appended wildcard");
+#endif
+
+public variable X = 0;
+
+#ifdef FOO_MOO_TOO_KOO
+failed ("ifdef");
+#else
+X = 1;
+#endif
+#if (X!=1)
+failed ("X!=1");
+#else
+X=-1;
+#endif
+
+#if !eval(X==-1)
+failed ("eval");
+#else
+
+#<ignore>
+failed ("#<ignore>");
+#</ignore>
+
+define gbar ();
+static define sbar ();
+if ((0 == is_defined ("gbar")) || (is_defined ("sbar")))
+{
+ failed ("is_defined(bar)");
+}
+#ifnexists gbar
+failed ("gbar does not exist");
+#endif
+#ifnexists sbar
+failed ("sbar does not exist");
+#endif
+#if (NULL == __get_reference("gbar"))
+failed ("No preprocessor reference to gbar");
+#endif
+if (NULL == __get_reference ("sbar"))
+{
+ failed ("no reference to sbar");
+}
+
+%Currently, sbar is effectively private and not accessable from the
+%preprocessor since it has a different private namespace. This may be
+%be changed in a future version so that the prep shares the uses the
+%file's private namespace.
+%#if (NULL == __get_reference("sbar"))
+%failed ("No preprocessor reference to sbar");
+%#endif
+
+implements ("foo");
+define sfoo ();
+if (is_defined ("sfoo"))
+{
+ failed ("is_defined(sfoo)");	 % is_defined looks at global namespace
+}
+#ifnexists sfoo
+failed ("sfoo does not exist");
+#endif
+#if (NULL == __get_reference("sfoo"))
+failed ("No preprocessor reference to sfoo");
+#endif
+
+print ("Ok\n");
+
+exit (0);
+#endif

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/proc.sl Added

@@ -0,0 +1,126 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("proc");
+
+private define test_getsetid_funcs ()
+{
+   variable func, funcp, i;
+   foreach func ("getpid", "getppid", "getgid", "getegid",
+	     "geteuid", "getuid", "getpgrp", "getsid")
+     {
+	funcp = __get_reference (func);
+	if (funcp == NULL)
+	  continue;
+	i = (@funcp)();
+	if (typeof(i) != Int_Type)
+	  failed ("%s did not return an integer", func);
+     }
+
+   variable pid = getpid ();
+
+#ifexists setgid
+   i = setgid (getgid ());
+   if (typeof(i) != Int_Type)
+     failed ("setgid did not return an integer");
+#endif
+#ifexists setpgid
+   i = setpgid (pid, getpgid (0));
+   if (typeof(i) != Int_Type)
+     failed ("setpgid did not return an integer");
+#endif
+#ifexists setuid
+   i = setuid (pid);
+   if (typeof(i) != Int_Type)
+     failed ("setuid did not return an integer");
+#endif
+#ifexists getsid
+   i = getsid (pid);
+   if (typeof(i) != Int_Type)
+     failed ("getsid(pid) did not return an integer");
+#endif
+#ifexists setsid
+   % Do not call it-- I do not want to create a new session.
+#endif
+}
+test_getsetid_funcs ();
+
+private define test_getsetpriority ()
+{
+#ifexists getpriority
+   variable p = getpriority (PRIO_PROCESS, 0);
+   if (p == NULL)
+     failed ("getpriority failed: %S", errno_string());
+
+   if (-1 == setpriority (PRIO_PROCESS, 0, p))
+     failed ("setpriority failed: %S", errno_string());
+
+   % Try to trigger an error to exercise that bit of code.
+   () = getpriority (-1, -1);
+   () = setpriority (-1, p-1, -10000);
+#endif
+}
+test_getsetpriority ();
+
+private define test_getrusage ()
+{
+   variable fields =
+     {
+	"ru_utimesecs",
+	"ru_stimesecs",
+	"ru_maxrss",
+	"ru_minflt",
+	"ru_majflt",
+	"ru_inblock",
+	"ru_oublock",
+	"ru_nvcsw",
+	"ru_nivcsw",
+	"ru_ixrss",
+	"ru_idrss",
+	"ru_isrss",
+	"ru_nswap",
+	"ru_msgsnd",
+	"ru_msgrcv",
+	"ru_nsignals",
+     };
+#ifexists getrusage
+   foreach ({
+# ifexists RUSAGE_SELF
+      RUSAGE_SELF,
+# endif
+# ifexists RUSAGE_CHILDREN
+      RUSAGE_CHILDREN,
+# endif
+# ifexists RUSAGE_THREAD
+      RUSAGE_THREAD,
+# endif
+   })
+     {
+	variable w = ();
+	variable s = getrusage (w);
+	if (s == NULL)
+	  failed ("getrusage failed: %S", errno_string ());
+	foreach (fields)
+	  {
+	     variable f = ();
+	     try
+	       {
+		  () = get_struct_field (s, f);
+	       }
+	     catch InvalidParmError:
+	       failed ("getrusage struct does not contain field %s", f);
+	  }
+     }
+   % Try to trigger an error to exercise the error handling code
+   () = getrusage (0x800);
+#endif
+}
+test_getrusage ();
+
+#ifexists killpg
+if (typeof (killpg(0,0)) != Int_Type) failed ("killpg did not return an integer");
+#endif
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/qualif.sl Added

@@ -0,0 +1,324 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("qualifiers");
+
+private define simple_test_function ()
+{
+   variable q = __qualifiers ();
+   return q.qualifier;
+}
+
+if (3 != simple_test_function (;qualifier=3))
+  failed ("Simple qualifier test");
+
+public define qualifier_function ()
+{
+   variable q = __qualifiers ();
+   loop (3) q = __qualifiers ();
+
+   return _NARGS, q;
+}
+
+public variable Arg_List, Qual_Struct, Func_Ref, Struct;
+private define call_qualifier_function (f, args, q)
+{
+   Arg_List = args;
+   Qual_Struct = q;
+
+   loop (10) () = __qualifiers (;foo="bar");
+   variable args_expr
+     = strjoin (array_map (String_Type, &sprintf,
+			   "Arg_List%d", 0:length(args)-1), ",");
+   variable fields = get_struct_field_names (q);
+   variable q_expr
+     = strjoin (array_map (String_Type, &sprintf,
+			   "%s=Qual_Struct.%s", fields, fields), ",");
+
+   variable expr = sprintf ("%s (%s ; %s);", f, args_expr, q_expr);
+   return eval (expr);
+}
+
+private define test_qualifiers (args, q)
+{
+   variable n = length (args), n1, q1;
+
+   Func_Ref = &qualifier_function;
+   Struct = struct { method = &qualifier_function };
+
+   variable fs = "qualifier_function", "(@Func_Ref)", "Struct.method";
+   variable ns = n, n, n+1;
+
+   variable f, i;
+   _for i (0, 2, 1)
+     {
+	f = fsi; n = nsi;
+	(n1, q1) = call_qualifier_function (f, args, q);
+	if (n != n1)
+	  failed ("Expecting _NARGS to be %d, found %d  -- f = %s", n, n1, f);
+	if (not _eqs (q, q1))
+	  failed ("Qualifiers to do match the expected values -- f = %s", f);
+     }
+}
+
+test_qualifiers ({1, 2, 3}, struct {a=1, b=3, c="foo"});
+test_qualifiers ({1, 2, test_qualifiers ({1,2}, struct{c=&cos})},
+		 struct {a=1, b=3, c="foo"}
+		 ; foo=1, bar=length (1:10;baz=3));
+
+private define test_qualifiers ()
+{
+   variable q = __qualifiers ();
+   variable n, q1;
+
+   (n, q1) = qualifier_function (1,, ;; q);
+   if (n != 3)
+     failed ("function call did not handle implicit NULL arguments");
+   if (not _eqs (q, q1))
+     failed (";; form of qualifiers");
+}
+
+test_qualifiers ();
+test_qualifiers (;);
+test_qualifiers (;;);
+test_qualifiers (;;struct {foo=7});
+
+private define fun2 (x, y)
+{
+   return qualifier ("x", x), qualifier ("y", y);
+}
+
+private define fun1 (x, y)
+{
+   return fun2 (x, y;; __qualifiers ());
+}
+
+private define test_qualifier ()
+{
+   variable x, y, x0, y0, x1, y1;
+
+   x0 = 1; y0 = 2; x1 = "one"; y1 = "two";
+
+   (x, y) = fun1 (x0, y0; x=x1, y=y1);
+   if ((x != x1) || (y != y1))
+     failed ("qualifier intrinsic 1");
+
+   (x, y) = fun1 (x0, y0; y=y1);
+   if ((x != x0) || (y != y1))
+     failed ("qualifier intrinsic 2");
+
+   (x, y) = fun1 (x0, y0; x = x1);
+   if ((x != x1) || (y != y0))
+     failed ("qualifier intrinsic 3");
+}
+test_qualifier ();
+
+private define test_qualifier_exists (name, exists)
+{
+   if (exists != qualifier_exists (name))
+     failed ("qualifier_exists (%s) != %d", name, exists);
+}
+test_qualifier_exists ("foo", 0);
+test_qualifier_exists ("foo", 1; goo, foo=7);
+test_qualifier_exists ("goo", 1; goo, foo=7);
+test_qualifier_exists ("foo", 1; goo, foo);
+test_qualifier_exists ("boo", 0; goo, foo);
+test_qualifier_exists ("foo", 0; food=7);
+test_qualifier_exists ("foo", 0;; struct{food=7});
+test_qualifier_exists ("foo", 1;; struct{food=7, foo});
+
+private variable Funcs = Assoc_Type;
+Funcs"f" = &test_qualifier_exists;
+
+private define passthru ();
+private define test_qualifier_passing (name, exists)
+{
+   (@Funcs"f")(name, exists;; __qualifiers);
+   (@Funcs"f")(passthru(name, exists);; __qualifiers);
+   (@Funcs"f")(name, exists;; passthru(__qualifiers));
+   (@passthru(Funcs"f"))(name, exists;; __qualifiers);
+}
+
+test_qualifier_passing ("foo", 0);
+test_qualifier_passing ("foo", 1; goo, foo=7);
+test_qualifier_passing ("goo", 1; goo, foo=7);
+test_qualifier_passing ("foo", 1; goo, foo);
+test_qualifier_passing ("boo", 0; goo, foo);
+test_qualifier_passing ("foo", 0; food=7);
+test_qualifier_passing ("foo", 0;; struct{food=7});
+test_qualifier_passing ("foo", 1;; struct{food=7, foo});
+
+private define fun2 (x, y)
+{
+   return qualifier ("x", x), qualifier ("y", y);
+}
+
+private define fun1 (x, y)
+{
+   if (_NARGS != 2)
+     failed ("_NARGS=%d instead of 2 in fun1", _NARGS);
+   return fun2 (x, y;; __qualifiers ());
+}
+
+private define qualifiers_as_func (x,y,z)
+{
+   if (_NARGS != 3)
+     failed ("_NARGS=%d instead of 3 in qualifiers_as_func", _NARGS);
+
+   return __qualifiers ();
+}
+
+private define test_mixed_qualifiers ()
+{
+   variable x, y, x0, y0, x1, y1;
+   x0 = 1, y0 = 2; x1 = "one", y1="two";
+
+   (x,y) = fun1 (x0, y0; @qualifiers_as_func(1,2,3));
+   if ((x0 != x)||(y0!=y))
+     failed ("mixed qualifiers NULL");
+
+   (x,y) = fun1 (x0, y0; @qualifiers_as_func(1,2,3;x=x1));
+   if ((x != x1)||(y0!=y))
+     failed ("mixed qualifiers ;x=x1");
+
+   (x,y) = fun1 (x0, y0; x=x0, @qualifiers_as_func(1,2,3 ;x=x1));
+   if ((x != x1)||(y0!=y))
+     failed ("mixed qualifiers ;x=x0,x=x1");
+   (x,y) = fun1 (x0, y0; y=y0, @qualifiers_as_func(1,2,3;x=x1), x=x0);
+   if ((x != x0)||(y0!=y))
+     failed ("mixed qualifiers ;x=x1,x=x0");
+   (x,y) = fun1 (x0, y0; @qualifiers_as_func(1,2,3;x=x1,y=y1), x=y1);
+   if ((x != y1)||(y1!=y))
+     failed ("mixed qualifiers ;x=x1,y=y0,x=y1");
+}
+test_mixed_qualifiers ();
+
+private define fun1_method (obj)
+{
+   if (_NARGS != 1)
+     {
+	failed ("_NARGS=%d instead of 1 in fun1_method", _NARGS);
+     }
+
+   return fun1 (obj.x, obj.y ;; __qualifiers);
+}
+
+private define new_object ()
+{
+   return struct
+     {
+	method=&fun1_method,
+	x=qualifier("x"),
+	y=qualifier("y"),
+     };
+}
+
+private define test_qualifiers_in_methods ()
+{
+   variable x0 = 1, y0 = 2, x, y;
+   variable obj = new_object (;x=x0, y=y0);
+   (x,y) = obj.method ();
+   if ((x != x0) || (y != y0))
+     failed ("passing object qualifiers");
+
+   x0 = 3; y0 = 4;
+   (x,y) = obj.method (;x=3,y=4);
+   if ((x != x0) || (y != y0))
+     failed ("obj.method qualifiers");
+
+   x0 = 5; y0 = 6;
+   (x,y) = new_object (;x=x0,y=y0).method ();
+   if ((x != x0) || (y != y0))
+     failed ("new_object.method default qualifiers");
+
+   x0 = 7; y0 = 8;
+   (x,y) = new_object (;x=x0).method (;y=y0);
+   if ((x != x0) || (y != y0))
+     failed ("new_object.method default and specified qualifiers");
+}
+test_qualifiers_in_methods ();
+
+#iffalse
+% tests pre2.3.0-54
+private define test_empty_qualifiers (qval, defval)
+{
+   variable q;
+
+   q = qualifier ("foo");
+   if (q != qval)
+     failed ("test_empty_qualifiers 1");
+
+   q = qualifier ("foo", defval);
+   if (qval == NULL)
+     {
+	if (q != defval)
+	  {
+	     failed ("test_empty_qualifiers 2");
+	  }
+     }
+   else if (q != qval)
+     failed ("test_empty_qualifiers 3");
+}
+test_empty_qualifiers (2100, 3100; foo=2100);
+test_empty_qualifiers (2100, 3100; foo=2100, bar="x");
+test_empty_qualifiers (2100, 3100; bar="x", foo=2100);
+test_empty_qualifiers (1, 3100; foo);
+test_empty_qualifiers (1, 3100; foo,);
+test_empty_qualifiers (1, 3100; bar,foo,);
+test_empty_qualifiers (1, 3100; foo, bar="x");
+test_empty_qualifiers (NULL, 3100);
+#endif
+
+private define check_intrinsic_qualifier (func, qval, defval)
+{
+   variable val;
+
+   if (qval == NULL)
+     {
+	val = (@func)("foo", defval);
+	if (val != defval)
+	  failed ("%S(%S,%S) returned %S instead of %S",
+		  func, "foo", defval, val, defval);
+
+	% The integer 1 will get assigned to a qualifier without
+	% a value.  So, do not use this with strings
+	if (func == &check_intrin_string_qualifier)
+	  return;
+#iffalse
+	% pre2.3.0-54 semantics
+	val = (@func)("foo", defval; foo);
+	if (val != 1)
+	  failed ("%S(%S,%S; foo) returned %S instead of %S",
+		  func, "foo", defval, val, defval);
+#endif
+	return;
+     }
+   val = (@func)("foo", defval; foo=qval);
+   if (val != qval)
+     failed ("%S(%S,%S ;%S=%S) returned %S instead of %S",
+	     func, "foo", defval, "foo", qval, val, qval);
+}
+
+private define test_intrinsic_qualifiers ()
+{
+   check_intrinsic_qualifier (&check_intrin_int_qualifier, 2718, 3141);
+   check_intrinsic_qualifier (&check_intrin_int_qualifier, NULL, 3141);
+   check_intrinsic_qualifier (&check_intrin_int_qualifier, 2718h, 3141);
+
+   check_intrinsic_qualifier (&check_intrin_long_qualifier, NULL, 3141L);
+   check_intrinsic_qualifier (&check_intrin_long_qualifier, 2718, 3141L);
+   check_intrinsic_qualifier (&check_intrin_long_qualifier, 2718h, 3141L);
+
+   check_intrinsic_qualifier (&check_intrin_double_qualifier, NULL, 3.141);
+   check_intrinsic_qualifier (&check_intrin_double_qualifier, 2.718, 3.141);
+   check_intrinsic_qualifier (&check_intrin_double_qualifier, 2718, 3.141);
+
+   check_intrinsic_qualifier (&check_intrin_string_qualifier, NULL, "3.141");
+   check_intrinsic_qualifier (&check_intrin_string_qualifier, "2.718", "3.141");
+   check_intrinsic_qualifier (&check_intrin_string_qualifier, "2718"B, "3.141");
+}
+test_intrinsic_qualifiers ();
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/regexp.sl Added

@@ -0,0 +1,169 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("regexp");
+
+% Tests go here....
+
+private define test_regexp (pat, str, val, ans)
+{
+ variable val1 = string_match (str, pat); % form 1
+ if (val != val1)
+ failed ("string_match(%S,%S) ==> %S, not %S", str, pat, val1, val);
+
+ if (val == 0)
+ return;
+
+ variable pos, len;
+ (pos, len) = string_match_nth (0);
+ variable ans1 = strpos:pos+len-1;
+ if (ans1 != ans)
+ failed ("string_match(%S,%S) ==> %S, not %S", str, pat, ans1, ans);
+}
+
+test_regexp (`.d`, "ffdoodfoo fob", 2, "fd");
+test_regexp (`.*d`, "ffdoodfoo fob", 1, "ffdood");
+test_regexp (`.?d`, "ffdoodfoo fob", 2, "fd");
+test_regexp (`.+d`, "ffdoodfoo fob", 1, "ffdood");
+test_regexp (`.\{1,3\}d`, "ffdoodfoo fob", 1, "ffd");
+test_regexp (`.\{1,\}d`, "ffdoodfoo fob", 1, "ffdood");
+test_regexp (`.\{4,\}d`, "ffdoodfoo fob", 1, "ffdood");
+test_regexp (`.\{3,4\}d`, "ffdoodfoo fob", 2, "fdood");
+test_regexp (`.\{3\}d`, "ffdoodfoo fob", 3, "dood");
+
+test_regexp (`\cA-Z+`, "fooFOO4", 4, "FOO");
+test_regexp (`\CA-Z+`, "fooFOO4", 1, "fooFOO");
+test_regexp (`\<fo+`, "ffoodfoo fob", 10, "fo");
+test_regexp (`\<fo+\>`, "ffoodfoo fob", 0, NULL);
+test_regexp (`fo+\>`, "ffoodfoo fob", 6, "foo");
+test_regexp (`fo?\>`, "ffoodfoo fob", 0, NULL);
+test_regexp (`fo?.\>`, "ffoodfoo fob", 6, "foo");
+test_regexp (`\<fo?.*`, "ffoodfoo fob", 1, "ffoodfoo fob");
+test_regexp (`\<fo+.*`, "ffoodfoo fob", 10, "fob");
+test_regexp (`fo?.`, "ffoodfoo fob", 1, "ff");
+
+test_regexp (`o\{0,3\}d`, "ffdoodfoo fob", 3, "d");
+test_regexp (`o\{,3\}d`, "ffdoodfoo fob", 3, "d");
+test_regexp (`o\{1,3\}d`, "ffdoodfoo fob", 4, "ood");
+test_regexp (`o\{1,\}d`, "ffdoodfoo fob", 4, "ood");
+test_regexp (`o\{,\}d`, "ffdoodfoo fob", 3, "d");
+test_regexp (`o\{2\}d`, "ffdoodfoo fob", 4, "ood");
+
+test_regexp (`k-s\{0,3\}d`, "ffdoodfoo fob", 3, "d");
+test_regexp (`k-s\{,3\}d`, "ffdoodfoo fob", 3, "d");
+test_regexp (`k-s\{1,3\}d`, "ffdoodfoo fob", 4, "ood");
+test_regexp (`k-s\{1,\}d`, "ffdoodfoo fob", 4, "ood");
+test_regexp (`k-s\{,\}d`, "ffdoodfoo fob", 3, "d");
+test_regexp (`k-s\{2\}d`, "ffdoodfoo fob", 4, "ood");
+
+test_regexp (`k-sd`, "ffdoodfoo fob", 5, "od");
+test_regexp (`k-s?d`, "ffdoodfoo fob", 3, "d");
+test_regexp (`k-s*d`, "ffdoodfoo fob", 3, "d");
+test_regexp (`k-s+d`, "ffdoodfoo fob", 4, "ood");
+
+test_regexp (`.\{0,3\}d`, "ffdoodfoo fob", 1, "ffd");
+test_regexp (`.\{,3\}d`, "ffdoodfoo fob", 1, "ffd");
+test_regexp (`.\{1,3\}d`, "ffdoodfoo fob", 1, "ffd");
+test_regexp (`.\{1,\}d`, "ffdoodfoo fob", 1, "ffdood");
+test_regexp (`.\{4,\}d`, "ffdoodfoo fob", 1, "ffdood");
+test_regexp (`.\{3,4\}d`, "ffdoodfoo fob", 2, "fdood");
+test_regexp (`.\{3\}d`, "ffdoodfoo fob", 3, "dood");
+
+test_regexp (`\d\{0,3\}d`, "ffd00df00 f0b", 3, "d");
+test_regexp (`\d\{,3\}d`, "ffd00df00 f0b", 3, "d");
+test_regexp (`\d\{1,3\}d`, "ffd00df00 f0b", 4, "00d");
+test_regexp (`\d\{1,\}d`, "ffd00df00 f0b", 4, "00d");
+test_regexp (`\d\{,\}d`, "ffd00df00 f0b", 3, "d");
+test_regexp (`\d\{2\}d`, "ffd00df00 f0b", 4, "00d");
+
+test_regexp (`$a-z+$\1?`, "foodoododd", 1, "foodoododd");
+test_regexp (`$a-z+$\1*`, "foodoododd", 1, "foodoododd");
+test_regexp (`$a-z+$\1+`, "foodoododd", 2, "oodood");
+test_regexp (`^$a-z+$\1+`, "foodoododd", 0, NULL);
+test_regexp (`$a-z+$\1+$`, "foodoodood", 2, "oodoodood");
+test_regexp (`$a-z+$.\1+`, "foodjoododd", 2, "oodjood");
+
+test_regexp (`$^j+$j\1\{2,3\}`, "foodjfoodfoodfoodfood", 1, "foodjfoodfoodfood");
+test_regexp (`$^\t+$\t\e\n\1\{2,3\}`, "food\t\e\nfoodfoodfoodfood", 1, "food\t\e\nfoodfoodfood");
+test_regexp (`$^j+$\1\{2,3\}`, "foodjfoodfoodfoodfoodxood", 6, "foodfoodfoodfood");
+test_regexp (`$^j+$\1\{2,3\}`, "foodjfoodfoodfoodfoodxood", 6, "foodfoodfoodfood");
+test_regexp (`$^j+$\1\{2,3\}`, "foodjfoodfoodfoodfoodxood", 6, "foodfoodfoodfood");
+test_regexp (`$^j\n+$\1\{2,3\}`, "food\nfoodfoodfoodfoodxood", 6, "foodfoodfoodfood");
+
+test_regexp (`$\ca-z+\t\Ca-z+$`, "CATcat\tCATcat", 4, "cat\tCATcat");
+test_regexp (`\<.*$`, "foo bar\nbazb\n", 9, "bazb");
+test_regexp (`\<.*$`, "foo bar\nbazb\n\n", 0, NULL);
+test_regexp (`\<a-z\n+$`, "foo bar\nbazb\n\n", 5, "bar\nbazb\n\n");
+test_regexp (`\<a-z+\n+$`, "foo bar.bazb\n\n", 9, "bazb\n\n");
+
+static define test_regexp_match (pat, str, val, ans)
+{
+ variable val1 = string_match (str, pat); % form 1
+ if (val != val1)
+ failed ("string_match(%S,%S) ==> %S, not %S", str, pat, val1, val);
+
+ if (val == 0)
+ return;
+
+ variable ofs = 1+strbytelen (str);
+ str = strcat (str, str);
+
+ val1 = string_match (str, pat, ofs);% form 2
+ if (val1)
+ val += ofs-1;
+
+ if (val1 != val)
+ failed ("string_match($str,$pat,$ofs) ==> $val1, not $val"$);
+
+ if (ans == NULL)
+ return;
+
+ variable matches = string_matches (str, pat);
+ if ((length (matches) < 2) || (ans != matches1))
+ failed ("string_matches (%s, %s)", str, pat);
+}
+
+test_regexp_match ("B.*1-5", "0xAB123G", 4, NULL);
+test_regexp_match ("$1-5+$G\1"R, "0xAB123G12F", 0, NULL);
+test_regexp_match ("$1-5+$G\1"R, "0xAB123G123F", 5, "123");
+test_regexp_match ("1-5", "0xAB123G", 5, NULL);
+test_regexp_match ("$1-52$"R, "0xAB123G", 5, "12");
+test_regexp_match ("G", "0xAB123G", 8, NULL);
+test_regexp_match ("$G$"R, "0xAB123G", 8, "G");
+
+test_regexp_match (`=$\d$`, "L=1X", 2, "1");
+test_regexp_match (`=$\d?$`, "L=1X", 2, "1");
+test_regexp_match (`=$\d?$`, "L=12X", 2, "1");
+test_regexp_match (`=$\d+$`, "L=1X", 2, "1");
+test_regexp_match (`=$\d+$`, "L=12X", 2, "12");
+test_regexp_match (`=$\d*$`, "L=1X", 2, "1");
+test_regexp_match (`=$\d*$`, "L=X", 2, "");
+
+static define test_globbing (glob, re)
+{
+ variable pat = glob_to_regexp (glob);
+ if (re != pat)
+ failed ("glob_to_regexp (%s) produced %s, expected %s",
+	 glob, pat, re);
+}
+
+#iffalse
+test_globbing ("*.c", "^^..*\\.c$");
+#else
+test_globbing ("*.c", "^.*\\.c$");
+#endif
+test_globbing ("*.c", "^*\\.c$");
+test_globbing ("x+??$.$", "^x\\+..\\$\\.\\$$");
+test_globbing ("x+file$", "^x\\+\\file\\$$");
+test_globbing ("x+^$", "^x\\+\\^\\$$");
+test_globbing ("x+^$", "^x\\+\\^\\$$");
+test_globbing ("x+^$", "^x\\+^\\$$");
+test_globbing ("", "^\\$");
+test_globbing ("x", "^x\\$");
+test_globbing ("x", "^x\\$");
+test_globbing ("x", "^x$");
+test_globbing ("x\\", "^x\\\\$");
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/req.sl Added

@@ -0,0 +1,50 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("provide and require");
+
+() = evalfile ("../../slsh/lib/require.sl");
+
+public variable ReqFoo_Num_Loads = 0;
+require ("reqfoo", "foo");
+if (ReqFoo_Num_Loads != 1)
+  failed ("reqfoo did not load into foo");
+if (ReqFoo_Namespace != "foo")
+  failed ("ReqFoo_Namespace not foo");
+
+require ("reqfoo", "bar");
+if (ReqFoo_Num_Loads != 2)
+  failed ("reqfoo did not load into bar");
+if (ReqFoo_Namespace != "bar")
+  failed ("ReqFoo_Namespace not bar");
+if (0 == is_defined ("bar->reqfoo"))
+  failed ("bar->reqfoo");
+
+implements ("baz");
+require ("reqfoo");
+if (ReqFoo_Num_Loads != 3)
+  failed ("reqfoo not loaded into baz");
+if (ReqFoo_Namespace != "baz")
+  failed ("ReqFoo_Namespace is not baz");
+
+implements ("buz");
+require ("reqfoo");
+if (ReqFoo_Num_Loads != 4)
+  failed ("reqfoo not loaded into buz");
+if (ReqFoo_Namespace != "buz")
+  failed ("ReqFoo_Namespace is not buz");
+
+if ((0 == is_defined ("buz->reqfoo")) or (0 == is_defined ("baz->reqfoo")))
+  failed ("reqfoo is not in buz and baz namespaces");
+
+use_namespace ("Global");
+require ("reqfoo");
+if (ReqFoo_Num_Loads != 5)
+  failed ("reqfoo did not load into global");
+require ("reqfoo");
+if (ReqFoo_Num_Loads != 5)
+  failed ("reqfoo loaded again into global");
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/reqfoo.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/runtests.sh Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/scircuit.sl Added

@@ -0,0 +1,52 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("Short Ciruit Operators");
+
+private variable Fired = 0;
+private define fun (tf)
+{
+   Fired++;
+   return tf;
+}
+
+private define test_sc (one)
+{
+   Fired = 0;
+   if (one && fun(one) && 0 && fun(0) && fun (one))
+     failed ("Simple &&");
+   if (Fired != 1)
+     failed ("&& is not short circuiting (one=%d)", one);
+
+   Fired = 0;
+   if (0 == (0 || fun(one) || 0 || fun(0) || fun (one)))
+     failed ("Simple || (one=%d)", one);
+   if (Fired != 1)
+     failed ("|| is not short circuiting (one=%d)", one);
+
+   Fired = 0;
+   if (0 == (fun(0) && fun(0) || one || fun(one)))
+     failed ("mixed && || (one=%d)", one);
+   if (Fired != 1)
+     failed ("mixed && || did not short circuit: Fired=%d", Fired);
+
+   Fired = 0;
+   if (one && fun(0) || one && fun(0) || 0 && fun(0))
+     {
+	failed ("mixed || && 2 (one=%d)", one);
+     }
+   if (Fired != 2)
+     failed ("mixed || && 2 did not short circuit (one=%d)", one);
+
+   variable a = 1,2;
+   if (length (a) > 5 && a5 == 3)
+     failed ("Simple && case 2 failed (one=%d)", one);
+}
+
+test_sc (1);
+test_sc (256);
+test_sc (1024);
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/selfload.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/signal.sl Added

@@ -0,0 +1,210 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("signals\n");
+
+private variable Signal = 0;
+
+private define handle_hup (sig)
+{
+   Signal = sig;
+}
+
+private define test_signal (sig, func, old_func)
+{
+   variable old;
+   signal (sig, func, &old);
+   if (_eqs (old, old_func))
+     return;
+   failed ("signal ($sig,$func,$old_func), got $old"$);
+}
+
+test_signal (SIGHUP, &handle_hup, SIG_DFL);
+test_signal (SIGHUP, SIG_APP, &handle_hup);
+test_signal (SIGHUP, SIG_DFL, SIG_DFL);
+test_signal (SIGHUP, SIG_IGN, SIG_DFL);
+test_signal (SIGHUP, &handle_hup, SIG_IGN);
+
+private define test_signal (sig, func)
+{
+   Signal = 0;
+   signal (sig, func);
+   () = kill (getpid (), sig);
+   variable count = 10;
+   while (count and (Signal == 0))
+     {
+	sleep (1);
+	count--;
+     }
+   if (Signal != sig)
+     failed ("signal %d not caught, count=%d", sig, count);
+}
+test_signal (SIGHUP, &handle_hup);
+
+private define sigalrm_handler (sig)
+{
+   if (sig != SIGALRM)
+     failed ("alarm");
+   throw MathError;
+}
+signal (SIGALRM, &sigalrm_handler);
+
+private define test_sigalarm ()
+{
+   print ("\tPausing for 2 seconds for alarm test");
+   alarm (2);
+   try
+     {
+	while (1)
+	  {
+	     sleep (1);
+	     print (".");
+	  }
+     }
+   catch MathError;
+   print ("\n");
+}
+
+private define test_getsetitimer ()
+{
+#ifexists setitimer
+   % check syntax
+   signal (SIGALRM, SIG_IGN);
+   variable interval = 10.0, value = 3.1, old_interval, old_value;
+   setitimer (ITIMER_REAL, value, interval);
+   setitimer (ITIMER_REAL, value, interval, &old_value, &old_interval);
+   if (abs (old_interval-interval) > 0.1)   %  adjust for timer resolution
+     failed ("setitimer: unexpected old interval");
+   (old_value, old_interval) = getitimer (ITIMER_REAL);
+   if (abs (old_interval-interval) > 0.1)   %  adjust for timer resolution
+     failed ("getitimer: unexpected old interval");
+
+   setitimer (ITIMER_REAL, interval, value, &old_interval);
+
+   signal (SIGALRM, &sigalrm_handler);
+   print ("\tPausing for 2.5 seconds for setitimer test");
+   setitimer (ITIMER_REAL, 2.5, 2.5);
+   try
+     {
+	while (1)
+	  {
+	     sleep (1);
+	     print (".");
+	  }
+     }
+   catch MathError:
+     {
+	setitimer (ITIMER_REAL, 0);
+     }
+   print ("\n");
+#endif
+}
+
+private define sigint_handler (sig)
+{
+   if (sig != SIGINT)
+     failed ("sigint_handler");
+   throw UserBreakError;
+}
+
+private define test_sigsuspend ()
+{
+   if (NULL != getenv ("MAKERUNNING"))
+     {
+	print ("\t(make detected: skipping test_sigsuspend)\n");
+	return;
+     }
+
+   signal (SIGINT, &sigint_handler);
+   print ("\tNow try pressing ^C in next 5 seconds...");
+   alarm (5);
+   try
+     sigsuspend (SIGINT, SIGTSTP);
+   catch UserBreakError;
+   catch MathError;
+   print ("\n");
+}
+
+private define test_sigprocmask ()
+{
+   variable oldmask, origmask;
+   sigprocmask (SIG_SETMASK, SIGHUP, &origmask);
+   sigprocmask (SIG_BLOCK, SIGINT, &oldmask);
+
+   if (orelse
+       {length (oldmask) != 1}
+       {oldmask0 != SIGHUP})
+     failed ("sigprocmask: expected to see SIGHUP in the mask");
+
+   sigprocmask (SIG_UNBLOCK, SIGHUP, &oldmask);
+   if (orelse
+       {length (oldmask) != 2}
+       {(0 == length (where (oldmask == SIGHUP)))}
+       {(0 == length (where (oldmask == SIGINT)))})
+     failed ("sigprocmask: expected to see SIGINT and SIGHUP in the mask");
+
+   sigprocmask (SIG_SETMASK, origmask, &oldmask);
+   if (orelse
+       {length (oldmask) != 1}
+       {oldmask0 != SIGINT})
+     failed ("sigprocmask: expected to see SIGINT in the mask");
+}
+
+$1 = getenv ("SLSYSWRAP_TEST");
+
+if (($1 == NULL) || (atoi ($1) == 0))
+{
+   test_sigalarm ();
+   test_getsetitimer ();
+   test_sigsuspend ();
+}
+
+test_sigprocmask ();
+
+% Interrupts are tiggered by signals that interrupt system calls.
+% These tests here are design to exercise that library interrupt hook
+% data structures.
+private variable Interrupt_Hook_A_Fired = 0;
+private variable Interrupt_Hook_B_Fired = 0;
+private define interrupt_hook_a ()
+{
+   Interrupt_Hook_A_Fired = 1;
+   return 0;
+}
+
+private define interrupt_hook_b ()
+{
+   Interrupt_Hook_B_Fired = 1;
+   return 0;
+}
+
+private define add_interrupt_hooks ()
+{
+   sltest_add_interrupt_hook (&interrupt_hook_a);
+   sltest_add_interrupt_hook (&interrupt_hook_b);
+   sltest_add_interrupt_hook (&interrupt_hook_a);
+}
+
+private define remove_interrupt_hooks ()
+{
+   sltest_remove_interrupt_hook (&interrupt_hook_a);
+   sltest_remove_interrupt_hook (&interrupt_hook_b);
+   sltest_remove_interrupt_hook (&interrupt_hook_a);
+}
+
+private define test_interrupts ()
+{
+   add_interrupt_hooks ();
+
+   () = sltest_invoke_interrupts ();
+
+   ifnot (Interrupt_Hook_A_Fired && Interrupt_Hook_B_Fired)
+     failed ("Interrupt_Hooks were not activated");
+
+   remove_interrupt_hooks ();
+}
+test_interrupts ();
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/sltest.c Added

@@ -0,0 +1,677 @@
+#include "../config.h"
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+#include <stdlib.h>
+
+#include "../sl-feat.h"
+#include "../slang.h"
+
+#ifdef SLSYSWRAP
+# include <slsyswrap.h>
+#endif
+
+#if SLANG_HAS_FLOAT
+#if defined(__FreeBSD__) || defined(__386BSD__)
+# include <floatingpoint.h>
+# define HAVE_FPSETMASK 1
+#endif
+#endif
+
+static int Ignore_Exit = 0;
+static void c_exit (int *code)
+{
+ if (Ignore_Exit == 0)
+ exit (*code);
+}
+
+static char test_char_return (char *x)
+{
+ char y, y1;
+
+ if ((-1 == SLang_push_char (*x))
+ || (-1 == SLang_pop_char (&y1))
+ || (-1 == SLclass_dup_object (SLANG_CHAR_TYPE, &y1, &y))
+ || (-1 == SLclass_push_char_obj (SLANG_CHAR_TYPE, y))
+ || (-1 == SLclass_pop_char_obj (SLANG_CHAR_TYPE, (char *)&y)))
+ return -1;
+
+ return y;
+}
+static short test_short_return (short *x)
+{
+ short y, y1;
+
+ if ((-1 == SLang_push_short (*x))
+ || (-1 == SLang_pop_short (&y1))
+ || (-1 == SLclass_dup_object (SLANG_SHORT_TYPE, &y1, &y))
+ || (-1 == SLclass_push_short_obj (SLANG_SHORT_TYPE, y))
+ || (-1 == SLclass_pop_short_obj (SLANG_SHORT_TYPE, (short *)&y)))
+ return -1;
+
+ return y;
+}
+
+static int test_int_return (int *x)
+{
+ int y, y1;
+ if ((-1 == SLang_push_int (*x))
+ || (-1 == SLang_pop_int (&y1))
+ || (-1 == SLclass_dup_object (SLANG_INT_TYPE, &y1, &y))
+ || (-1 == SLclass_push_int_obj (SLANG_INT_TYPE, y))
+ || (-1 == SLclass_pop_int_obj (SLANG_INT_TYPE, (int *)&y)))
+ return -1;
+
+ return y;
+}
+
+static long test_long_return (long *x)
+{
+ long y, y1;
+
+ if ((-1 == SLang_push_long (*x))
+ || (-1 == SLang_pop_long (&y1))
+ || (-1 == SLclass_dup_object (SLANG_LONG_TYPE, &y1, &y))
+ || (-1 == SLclass_push_long_obj (SLANG_LONG_TYPE, y))
+ || (-1 == SLclass_pop_long_obj (SLANG_LONG_TYPE, (long *)&y)))
+ return -1;
+
+ return y;
+}
+
+static unsigned char test_uchar_return (unsigned char *x)
+{
+ unsigned char y, y1;
+
+ if ((-1 == SLang_push_uchar (*x))
+ || (-1 == SLang_pop_uchar (&y1))
+ || (-1 == SLclass_dup_object (SLANG_UCHAR_TYPE, &y1, &y))
+ || (-1 == SLclass_push_char_obj (SLANG_UCHAR_TYPE, y))
+ || (-1 == SLclass_pop_char_obj (SLANG_UCHAR_TYPE, (char *)&y)))
+ return -1;
+
+ return y;
+}
+
+static unsigned short test_ushort_return (unsigned short *x)
+{
+ unsigned short y, y1;
+
+ if ((-1 == SLang_push_ushort (*x))
+ || (-1 == SLang_pop_ushort (&y1))
+ || (-1 == SLclass_dup_object (SLANG_USHORT_TYPE, &y1, &y))
+ || (-1 == SLclass_push_short_obj (SLANG_USHORT_TYPE, y))
+ || (-1 == SLclass_pop_short_obj (SLANG_USHORT_TYPE, (short *)&y)))
+ return -1;
+
+ return y;
+}
+
+static unsigned int test_uint_return (unsigned int *x)
+{
+ unsigned int y, y1;
+ if ((-1 == SLang_push_uint (*x))
+ || (-1 == SLang_pop_uint (&y1))
+ || (-1 == SLclass_dup_object (SLANG_UINT_TYPE, &y1, &y))
+ || (-1 == SLclass_push_int_obj (SLANG_UINT_TYPE, y))
+ || (-1 == SLclass_pop_int_obj (SLANG_UINT_TYPE, (int *)&y)))
+ return -1;
+
+ return y;
+}
+
+static unsigned long test_ulong_return (unsigned long *x)
+{
+ unsigned long y, y1;
+
+ if ((-1 == SLang_push_ulong (*x))
+ || (-1 == SLang_pop_ulong (&y1))
+ || (-1 == SLclass_dup_object (SLANG_ULONG_TYPE, &y1, &y))
+ || (-1 == SLclass_push_long_obj (SLANG_ULONG_TYPE, y))
+ || (-1 == SLclass_pop_long_obj (SLANG_ULONG_TYPE, (long *)&y)))
+ return -1;
+
+ return y;
+}
+
+#if SLANG_HAS_FLOAT
+
+/* Intrinsics that return float are not supported. */
+/* static float test_float_return (float *x) */
+/* { */
+/* return *x; */
+/* } */
+
+static double test_double_return (double *x)
+{
+ double y, y1;
+
+ if ((-1 == SLang_push_double (*x))
+ || (-1 == SLang_pop_double (&y1))
+ || (-1 == SLclass_dup_object (SLANG_DOUBLE_TYPE, &y1, &y))
+ || (-1 == SLclass_push_double_obj (SLANG_DOUBLE_TYPE, y))
+ || (-1 == SLclass_pop_double_obj (SLANG_DOUBLE_TYPE, &y)))
+ return -1;
+
+ return y;
+}
+#endif
+typedef struct
+{
+ int i;
+ long l;
+ short h;
+ char b;
+#if SLANG_HAS_FLOAT
+ double d;
+ double c2;
+#endif
+ char *s;
+ SLang_Array_Type *a;
+ char *ro_str;
+}
+CStruct_Type;
+
+static SLang_CStruct_Field_Type C_Struct =
+{
+ MAKE_CSTRUCT_FIELD(CStruct_Type, i, "i", SLANG_INT_TYPE, 0),
+#if SLANG_HAS_FLOAT
+ MAKE_CSTRUCT_FIELD(CStruct_Type, d, "d", SLANG_DOUBLE_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(CStruct_Type, c, "z", SLANG_COMPLEX_TYPE, 0),
+#endif
+ MAKE_CSTRUCT_FIELD(CStruct_Type, s, "s", SLANG_STRING_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(CStruct_Type, a, "a", SLANG_ARRAY_TYPE, 0),
+ MAKE_CSTRUCT_FIELD(CStruct_Type, ro_str, "ro_str", SLANG_STRING_TYPE, 1),
+ MAKE_CSTRUCT_INT_FIELD(CStruct_Type, l, "l", 0),
+ MAKE_CSTRUCT_INT_FIELD(CStruct_Type, h, "h", 0),
+ MAKE_CSTRUCT_INT_FIELD(CStruct_Type, b, "b", 0),
+ SLANG_END_CSTRUCT_TABLE
+};
+
+static CStruct_Type C_Struct_Buf;
+static void check_cstruct (void)
+{
+ static int first_time = 1;
+ if (first_time)
+ {
+	C_Struct_Buf.ro_str = "read-only";
+	first_time = 0;
+ }
+}
+
+static void get_c_struct (void)
+{
+ check_cstruct ();
+ (void) SLang_push_cstruct ((VOID_STAR) &C_Struct_Buf, C_Struct);
+}
+
+static void set_c_struct (void)
+{
+ SLang_Array_Type *at;
+
+ SLang_free_cstruct ((VOID_STAR) &C_Struct_Buf, C_Struct);
+ if (-1 == SLang_pop_cstruct ((VOID_STAR) &C_Struct_Buf, C_Struct))
+ return;
+
+ at = C_Struct_Buf.a;
+ if ((at != NULL) && (at->data_type == SLANG_INT_TYPE))
+ {
+	/* The point of this is to look for access errors */
+	SLindex_Type i, imax = (SLindex_Type)at->num_elements;
+	int sum = 0;
+	int *data = (int *)at->data;
+	for (i = 0; i < imax; i++)
+	 sum += datai;
+ }
+}
+
+static void get_c_struct_via_ref (SLang_Ref_Type *r)
+{
+ check_cstruct ();
+ (void) SLang_assign_cstruct_to_ref (r, (VOID_STAR) &C_Struct_Buf, C_Struct);
+}
+
+static void test_pop_mmt (void)
+{
+ SLang_MMT_Type *mmt;
+
+ if (NULL == (mmt = SLang_pop_mmt (SLang_peek_at_stack ())))
+ return;
+
+ if (-1 == SLang_push_mmt (mmt))
+ SLang_free_mmt (mmt);
+}
+
+typedef struct
+{
+ char *name;
+ int i_value;
+ char *s_value;
+ double d_value;
+}
+My_Struct_Type;
+
+static My_Struct_Type My_Struct =
+{
+ "My_Struct",
+ -41,
+ NULL,
+ 7.18
+};
+
+static My_Struct_Type *My_Struct_Ptr = &My_Struct;
+
+static SLang_IStruct_Field_Type My_Struct_Field_Table =
+{
+ MAKE_ISTRUCT_FIELD(My_Struct_Type, name, "name", SLANG_STRING_TYPE, 1),
+ MAKE_ISTRUCT_FIELD(My_Struct_Type, i_value, "i", SLANG_INT_TYPE, 0),
+ MAKE_ISTRUCT_FIELD(My_Struct_Type, s_value, "s", SLANG_STRING_TYPE, 0),
+ MAKE_ISTRUCT_FIELD(My_Struct_Type, d_value, "d", SLANG_DOUBLE_TYPE, 0),
+ SLANG_END_ISTRUCT_TABLE
+};
+
+static int add_my_struct_type (void)
+{
+ return SLadd_istruct_table (My_Struct_Field_Table,
+			 (VOID_STAR) &My_Struct_Ptr,
+			 "Intrinsic_Struct");
+}
+
+
+typedef struct
+{
+ int field1;
+ int field2;
+ SLang_Any_Type *any;
+ int num_refs;
+}
+Test_Type;
+static int Test_Type_Id = -1;
+
+static void free_test_type (Test_Type *t)
+{
+ if (t == NULL)
+ return;
+
+ if (t->num_refs > 1)
+ {
+	t->num_refs -= 1;
+	return;
+ }
+ if (t->any != NULL)
+ SLang_free_anytype (t->any);
+ SLfree ((char *)t);
+}
+
+static void test_type_destroy (SLtype type, VOID_STAR addr)
+{
+ (void) type;
+ free_test_type (*(Test_Type **)addr);
+}
+
+static int push_test_type (Test_Type *t)
+{
+ t->num_refs++;
+ if (0 == SLclass_push_ptr_obj (Test_Type_Id, (VOID_STAR) t))
+ return 0;
+ t->num_refs--;
+ return -1;
+}
+
+static int pop_test_type (Test_Type **tp)
+{
+ return SLclass_pop_ptr_obj (Test_Type_Id, (VOID_STAR *)tp);
+}
+
+static int test_type_sget (SLtype type, SLFUTURE_CONST char *name)
+{
+ Test_Type *t;
+ int status;
+
+ (void) type;
+ if (-1 == pop_test_type (&t))
+ return -1;
+
+ status = -1;
+ if (0 == strcmp (name, "field1"))
+ status = SLang_push_int (t->field1);
+ else if (0 == strcmp (name, "field2"))
+ status = SLang_push_int (t->field2);
+ else if (0 == strcmp (name, "any"))
+ status = SLang_push_anytype (t->any);
+ else
+ SLang_verror (SL_INVALID_PARM,
+		 "Test_Type.%s is invalid", name);
+
+ free_test_type (t);
+ return status;
+}
+
+static int test_type_sput (SLtype type, SLFUTURE_CONST char *name)
+{
+ Test_Type *t;
+ int status;
+
+ (void) type;
+ if (-1 == pop_test_type (&t))
+ return -1;
+
+ status = -1;
+ if (0 == strcmp (name, "field1"))
+ status = SLang_pop_int (&t->field1);
+ else if (0 == strcmp (name, "field2"))
+ status = SLang_pop_int (&t->field2);
+ else if (0 == strcmp (name, "any"))
+ {
+	SLang_Any_Type *any;
+	if (0 == (status = SLang_pop_anytype (&any)))
+	 {
+	 SLang_free_anytype (t->any);
+	 t->any = any;
+	 }
+ }
+ else
+ SLang_verror (SL_INVALID_PARM,
+		 "Test_Type.%s is invalid", name);
+
+ free_test_type (t);
+ return status;
+}
+
+static int test_type_push (SLtype type, VOID_STAR addr)
+{
+ (void) type;
+
+ return push_test_type (*(Test_Type **)addr);
+}
+
+static void new_test_type (void)
+{
+ Test_Type *t;
+
+ if (NULL == (t = (Test_Type *)SLmalloc (sizeof(Test_Type))))
+ return;
+ memset ((char *)t, 0, sizeof(Test_Type));
+ t->field1 = -1;
+ t->field2 = -1;
+ t->num_refs = 1;
+ (void) push_test_type (t);
+ free_test_type (t);
+}
+
+static int add_test_classes (void)
+{
+ SLang_Class_Type *cl;
+
+ cl = SLclass_allocate_class ("Test_Type");
+ if (cl == NULL) return -1;
+ (void) SLclass_set_destroy_function (cl, test_type_destroy);
+ (void) SLclass_set_sget_function (cl, test_type_sget);
+ (void) SLclass_set_sput_function (cl, test_type_sput);
+ (void) SLclass_set_push_function (cl, test_type_push);
+
+ if (-1 == SLclass_register_class (cl, SLANG_VOID_TYPE, sizeof (Test_Type *), SLANG_CLASS_TYPE_PTR))
+ return -1;
+ Test_Type_Id = SLclass_get_class_id (cl);
+
+ if (-1 == add_my_struct_type ())
+ return -1;
+
+ return 0;
+}
+
+static void check_intrin_string_qualifier (char *name, char *def)
+{
+ char *s;
+ if (-1 == SLang_get_string_qualifier (name, &s, def))
+ return;
+ SLang_push_string (s);
+ SLang_free_slstring (s);
+}
+
+static void check_intrin_double_qualifier (char *name, double *def)
+{
+ double q;
+ if (-1 == SLang_get_double_qualifier (name, &q, *def))
+ return;
+ SLang_push_double (q);
+}
+
+static void check_intrin_int_qualifier (char *name, int *def)
+{
+ int q;
+ if (-1 == SLang_get_int_qualifier (name, &q, *def))
+ return;
+ SLang_push_int (q);
+}
+
+static void check_intrin_long_qualifier (char *name, long *def)
+{
+ long q;
+ if (-1 == SLang_get_long_qualifier (name, &q, *def))
+ return;
+ SLang_push_long (q);
+}
+
+#ifdef SLSYSWRAP
+static int set_syscall_failure (int *f)
+{
+ return SLsyswrap_set_syscall_failure (*f);
+}
+#endif
+
+static int interrupt_hook (VOID_STAR fp)
+{
+ int ret;
+ SLang_Name_Type *f;
+
+ f = (SLang_Name_Type *)fp;
+ if (-1 == SLexecute_function (f))
+ return -1;
+ if (-1 == SLang_pop_int (&ret))
+ return -1;
+
+ return ret;
+}
+
+static void add_interrupt_hook (void)
+{
+ SLang_Name_Type *f;
+
+ if (NULL == (f = SLang_pop_function ()))
+ return;
+
+ /* FIXME: Add f to a list that can be memory managed */
+ (void) SLang_add_interrupt_hook (interrupt_hook, f);
+ /* SLang_free_function (f); */
+}
+
+static void remove_interrupt_hook (void)
+{
+ SLang_Name_Type *f;
+
+ if (NULL == (f = SLang_pop_function ()))
+ return;
+
+ SLang_remove_interrupt_hook (interrupt_hook, f);
+ /* SLang_free_function (f); */
+}
+
+static int invoke_interrupts (void)
+{
+ return SLang_handle_interrupt ();
+}
+
+#include "assoc.c"
+#include "list.c"
+
+static void fake_import (char *);
+static SLang_Intrin_Fun_Type Intrinsics =
+{
+ MAKE_INTRINSIC_S("fake_import", fake_import, VOID_TYPE),
+ MAKE_INTRINSIC_I("exit", c_exit, VOID_TYPE),
+ MAKE_INTRINSIC_2("check_intrin_int_qualifier", check_intrin_int_qualifier, VOID_TYPE, SLANG_STRING_TYPE, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_2("check_intrin_long_qualifier", check_intrin_long_qualifier, VOID_TYPE, SLANG_STRING_TYPE, SLANG_LONG_TYPE),
+ MAKE_INTRINSIC_2("check_intrin_double_qualifier", check_intrin_double_qualifier, VOID_TYPE, SLANG_STRING_TYPE, SLANG_DOUBLE_TYPE),
+ MAKE_INTRINSIC_2("check_intrin_string_qualifier", check_intrin_string_qualifier, VOID_TYPE, SLANG_STRING_TYPE, SLANG_STRING_TYPE),
+ MAKE_INTRINSIC_1("test_char_return", test_char_return, SLANG_CHAR_TYPE, SLANG_CHAR_TYPE),
+ MAKE_INTRINSIC_1("test_short_return", test_short_return, SLANG_SHORT_TYPE, SLANG_SHORT_TYPE),
+ MAKE_INTRINSIC_1("test_int_return", test_int_return, SLANG_INT_TYPE, SLANG_INT_TYPE),
+ MAKE_INTRINSIC_1("test_long_return", test_long_return, SLANG_LONG_TYPE, SLANG_LONG_TYPE),
+
+ MAKE_INTRINSIC_1("test_uchar_return", test_uchar_return, SLANG_UCHAR_TYPE, SLANG_UCHAR_TYPE),
+ MAKE_INTRINSIC_1("test_ushort_return", test_ushort_return, SLANG_USHORT_TYPE, SLANG_USHORT_TYPE),
+ MAKE_INTRINSIC_1("test_uint_return", test_uint_return, SLANG_UINT_TYPE, SLANG_UINT_TYPE),
+ MAKE_INTRINSIC_1("test_ulong_return", test_ulong_return, SLANG_ULONG_TYPE, SLANG_ULONG_TYPE),
+#if SLANG_HAS_FLOAT
+ /* MAKE_INTRINSIC_1("test_float_return", test_float_return, SLANG_FLOAT_TYPE, SLANG_FLOAT_TYPE), */
+ MAKE_INTRINSIC_1("test_double_return", test_double_return, SLANG_DOUBLE_TYPE, SLANG_DOUBLE_TYPE),
+#endif
+ MAKE_INTRINSIC_0("test_pop_mmt", test_pop_mmt, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("get_c_struct", get_c_struct, VOID_TYPE),
+ MAKE_INTRINSIC_0("set_c_struct", set_c_struct, VOID_TYPE),
+ MAKE_INTRINSIC_1("get_c_struct_via_ref", get_c_struct_via_ref, VOID_TYPE, SLANG_REF_TYPE),
+ MAKE_INTRINSIC_0("new_test_type", new_test_type, SLANG_VOID_TYPE),
+#ifdef SLSYSWRAP
+ MAKE_INTRINSIC_1("_slsyswrap_set_syscall_failure", set_syscall_failure, SLANG_INT_TYPE, SLANG_INT_TYPE),
+#endif
+ MAKE_INTRINSIC_0("sltest_add_interrupt_hook", add_interrupt_hook, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("sltest_remove_interrupt_hook", remove_interrupt_hook, SLANG_VOID_TYPE),
+ MAKE_INTRINSIC_0("sltest_invoke_interrupts", invoke_interrupts, SLANG_INT_TYPE),
+
+ ASSOC_API_TEST_INTRINSICS,
+ LIST_API_TEST_INTRINSICS,
+
+ SLANG_END_INTRIN_FUN_TABLE
+};
+
+static void fake_import (char *ns_name)
+{
+ SLang_NameSpace_Type *ns = SLns_create_namespace (ns_name);
+ if (ns == NULL)
+ return;
+
+ (void) SLns_add_intrin_fun_table (ns, Intrinsics, NULL);
+}
+
+int main (int argc, char **argv)
+{
+ int i;
+ int utf8 = 0;
+
+ for (i = 1; i < argc; i++)
+ {
+	char *arg = argvi;
+	if (*arg != '-')
+	 break;
+
+	if (0 == strcmp (arg, "-utf8"))
+	 {
+	 utf8 = 1;
+	 continue;
+	 }
+	i = argc;
+ }
+
+ if (i >= argc)
+ {
+	fprintf (stderr, "Usage: %s -utf8 FILE...\n", argv0);
+	return 1;
+ }
+
+ if (utf8)
+ {
+#ifdef SLSYSWRAP
+	putenv("LANG=");
+	(void) SLutf8_enable (-1); /* exercise some of the code */
+
+	putenv ("SLTEST_NO_LANGINFO=1");
+	(void) SLutf8_enable (-1); /* exercise some of the code */
+	putenv("LANG=en_US.UTF-8");
+	if (0 == SLutf8_enable (-1))
+	 {
+	 fprintf (stderr, "***WARNING: Failed to trigger utf8 mode via LANG\n");
+	 (void) SLutf8_enable (1);
+	 }
+	putenv ("SLTEST_NO_LANGINFO=0");
+#else
+	(void) SLutf8_enable (1);
+#endif
+ }
+ else (void) SLutf8_enable (0);
+
+ SLinterp_utf8_enable (utf8);
+
+ if ((utf8 != SLutf8_is_utf8_mode ())
+ || (utf8 != SLinterp_is_utf8_mode ()))
+
+ {
+	fprintf (stderr, "SLinterp/utf8_is_utf8_mode failed\n");
+	return 1;
+ }
+
+#ifdef SLSYSWRAP
+ (void) SLsyswrap_set_syscall_failure (0);
+#endif
+ if ((-1 == SLang_init_all ())
+ || (-1 == SLang_init_array_extra ())
+ || (-1 == SLadd_intrin_fun_table (Intrinsics, NULL))
+ || (-1 == add_test_classes ()))
+ return 1;
+#ifdef SLSYSWRAP
+ (void) SLsyswrap_set_syscall_failure (1);
+#endif
+ SLang_Traceback = 1;
+
+ if (-1 == SLang_set_argc_argv (argc, argv))
+ return 1;
+
+#ifdef HAVE_FPSETMASK
+# ifndef FP_X_OFL
+# define FP_X_OFL 0
+# endif
+# ifndef FP_X_INV
+# define FP_X_INV 0
+# endif
+# ifndef FP_X_DZ
+# define FP_X_DZ 0
+# endif
+# ifndef FP_X_DNML
+# define FP_X_DNML 0
+# endif
+# ifndef FP_X_UFL
+# define FP_X_UFL 0
+# endif
+# ifndef FP_X_IMP
+# define FP_X_IMP 0
+# endif
+ fpsetmask (~(FP_X_OFL|FP_X_INV|FP_X_DZ|FP_X_DNML|FP_X_UFL|FP_X_IMP));
+#endif
+
+ if (i + 1 < argc)
+ Ignore_Exit = 1;
+
+ while (i < argc)
+ {
+	char *file = argvi;
+	if (0 == strncmp (SLpath_extname (file), ".slc", 4))
+	 {
+	 char *file_sl = SLmake_string (file);
+	 if (file_sl == NULL)
+	 return 1;
+
+	 file_slstrlen(file_sl)-1 = 0;
+	 if (-1 == SLang_byte_compile_file (file_sl, 0))
+	 {
+		 SLfree (file_sl);
+		 return 1;
+	 }
+	 SLfree (file_sl);
+	 }
+	if (-1 == SLang_load_file (file))
+	 return 1;
+	i++;
+ }
+
+ return SLang_get_error ();
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/sort.sl Added

@@ -0,0 +1,166 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("sorting");
+
+private define test_simple_sort (n, dir)
+{
+   variable cmp_op = (dir > 0) ? &_op_lt : &_op_gt;
+   variable ishift = 1:n-1, 0;
+   variable x, dx, bad;
+
+   foreach (Int_Type, Float_Type, Double_Type,
+	     UShort_Type, Short_Type, Char_Type, Long_Type,
+	     UInt_Type, UChar_Type, ULong_Type,
+#ifexists LLong_Type
+	     LLong_Type, ULLong_Type
+#endif
+	    )
+     {
+	variable type = ();
+	loop (3)
+	  {
+	     x = typecast (1000*(urand (n)), type);
+	     x = xarray_sort (x; dir=dir);
+	     dx = xishift - 1.0*x;
+	     dx-1 = 0;
+	     if (any((@cmp_op)(dx, 0)))
+	       failed ("simple sort: %S", type);
+
+	     % Already sorted
+	     x = xarray_sort (x; dir=dir);
+	     dx = xishift - 1.0*x;
+	     dx-1 = 0;
+	     if (any((@cmp_op)(dx, 0)))
+	       failed ("simple sort already sorted: %S", type);
+
+	     % Reversed
+	     array_reverse (x);
+	     x = xarray_sort (x; dir=dir);
+	     dx = xishift - 1.0*x;
+	     dx-1 = 0;
+	     if (any((@cmp_op)(dx, 0)))
+	       failed ("simple sort reversed: %S", type);
+	  }
+     }
+}
+
+define run_test_simple_sorts (method)
+{
+   set_default_sort_method (method);
+   if (method != get_default_sort_method ())
+     failed ("get/set_default_sort_method");
+
+   test_simple_sort (1, 1);
+   test_simple_sort (2, 1);
+   test_simple_sort (3, 1);
+   test_simple_sort (4, 1);
+   test_simple_sort (5, 1);
+   test_simple_sort (14, 1);
+   test_simple_sort (15, 1);
+   test_simple_sort (16, 1);
+   test_simple_sort (17, 1);
+   test_simple_sort (1023, 1);
+   test_simple_sort (1024, 1);
+   test_simple_sort (1025, 1);
+   test_simple_sort (2, -1);
+   test_simple_sort (3, -1);
+   test_simple_sort (15, -1);
+   test_simple_sort (1023, -1);
+   test_simple_sort (1024, -1);
+   test_simple_sort (1025, -1);
+}
+run_test_simple_sorts ("qsort");
+run_test_simple_sorts ("msort");
+
+private define opaque_sort_func (s, i, j)
+{
+   return sign (s.ai - s.aj);
+}
+
+private define cmp_fun (a, b)
+{
+   return sign (a-b);
+}
+
+private define test_sort (x, n, ans)
+{
+   variable i, a;
+
+   a = xarray_sort (x;; __qualifiers);
+   ifnot (_eqs (a, ans))
+     failed ("array_sort(int x)");
+
+   a = 1.0f*x;
+   a = aarray_sort (a;; __qualifiers);
+   ifnot (_eqs (a, ans))
+     failed ("array_sort(float x)");
+
+   a = 1.0*x;
+   a = aarray_sort (a;; __qualifiers);
+   ifnot (_eqs (a, ans))
+     failed ("array_sort(double x)");
+
+   a = xarray_sort (x, &cmp_fun;; __qualifiers);
+   ifnot (_eqs (a, ans))
+     failed ("array_sort(int x, &cmp_fun)");
+
+   a = 1.0f*x;
+   a = aarray_sort (a, &cmp_fun;; __qualifiers);
+   ifnot (_eqs (a, ans))
+     failed ("array_sort(float x, &cmp_fun)");
+
+   a = 1.0*x;
+   a = aarray_sort (a, &cmp_fun;; __qualifiers);
+   ifnot (_eqs (a, ans))
+     failed ("array_sort(double x, &cmp_fun)");
+
+   variable s = struct {a};
+   s.a = 1.0*x;
+   i = array_sort(s, &opaque_sort_func, n;; __qualifiers);
+   a = s.ai;
+   ifnot (_eqs (a, ans))
+     failed ("array_sort(struct, &opaque_sort_func, n)");
+}
+
+private define run_test_sort (method)
+{
+   set_default_sort_method (method);
+   if (method != get_default_sort_method ())
+     failed ("get/set_default_sort_method");
+
+   variable A = 2, 3, 7, 9, 4, 1, 0, 8, 6, 5;
+   test_sort (A, length(A), 0:length(A)-1);
+   test_sort (2, 1, 2);
+   test_sort (A0:-1, 0, A0:-1);
+
+   test_sort (A, length(A), length(A)-1:0:-1 ;dir=-1);
+   test_sort (2, 1, 2; dir=-1);
+   test_sort (A0:-1, 0, A0:-1; dir=-1);
+}
+run_test_sort ("qsort");
+run_test_sort ("msort");
+
+private define test_stability (method)
+{
+   variable a = 1, 2, 3, 3, 4, 5, 5, 6;
+   variable i = 7, 5, 6, 4, 2, 3, 1, 0;
+
+   variable j = array_sort (a; dir=-1, method=method);
+   ifnot (_eqs (j, i))
+     failed ("%s: descend sort was not stable", method);
+
+   a = 6, 6, 5, 4, 4, 3, 2, 1, 1;
+   i = 7, 8, 6, 5, 3, 4, 2, 0, 1;
+
+   j = array_sort (a; dir=1, method=method);
+   ifnot (_eqs (j, i))
+     failed ("%s: ascend sort was not stable", method);
+
+}
+test_stability ("qsort");
+test_stability ("msort");
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/sscanf.sl Added

@@ -0,0 +1,311 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("sscanf");
+
+#ifexists Double_Type
+static variable eps = 1.0;
+while (1 + eps/2.0 != 1)
+ eps /= 2.0;
+
+static define feqs (x, y)
+{
+ if (x == y)
+ return 1;
+
+ % (delta_diff)^2 = (delta_y)^ + (delta_x)^2
+ % delta_y = eps * y
+ % (delta_diff)^2 = eps*eps (y^2 + x^2)
+ % |delta_diff| = eps * sqrt (y^2 + x^2) ~= eps * x *sqrt(2)
+ variable diff = y - x;
+ if (x < 0) x = -x;
+ if (y < 0) y = -y;
+ if (diff < 0) diff = -diff;
+ variable tol = ((x + y) * eps);
+
+ if (diff <= tol)
+ return 1;
+ vmessage ("diff = %e, abs(x)*eps = %e, error=%e",
+	 diff, tol, diff/(x+y));
+ return 1;
+}
+
+static variable Inf = 1e1000;
+static define test_atof (x)
+{
+ variable y;
+ variable str = sprintf ("%.64e", x);
+ variable tstr;
+
+ tstr = strup (strtrim (str));
+
+ if (tstr == "INF")
+ y = Inf;
+ else if (tstr == "-INF")
+ y = -Inf;
+ else
+ y = atof (str);
+
+ !if (feqs (x,y))
+ failed ("%e = atof(%e %s): diff = %e\n", y, x, tstr, y-x);
+}
+
+static define test_atof_main (n)
+{
+
+ loop (n)
+ {
+	variable a,b,c;
+	a = 500 - random () * 1000;
+	b = 400 - 800 * random ();
+	ERROR_BLOCK
+	 {
+	 _clear_error ();
+	 () = fprintf (stderr, "Floating point exception occured for %g * 10^%g\n",
+			 a, b);
+	 }
+	if (1)
+	 {
+	 c = a * 10.0^b;
+	 test_atof (c);
+	 }
+ }
+
+ test_atof (random ());
+}
+test_atof_main (1000);
+
+# ifexists EINVAL
+if ((0.0 != atof ("FOO")) || (errno != EINVAL)) failed ("atof FOO");
+# endif
+
+#endif				 % Double_Type
+
+
+define test_scanf (buf, format, xp, yp, n)
+{
+ variable nn, x, y;
+ nn = sscanf (buf, format, &x, &y);
+ if (n != nn)
+ failed ("sscanf (%s, %s, &x, &y) ==> returned %d",
+	 buf, format, nn);
+ if (n >= 1)
+ {
+	if (x != xp)
+	 {
+#ifexists Double_Type
+	 if ((typeof (x) == Double_Type)
+		 or (typeof (x) == Float_Type))
+	 {
+		 if (1)
+		 failed ("sscanf (%s, %s, &x, &y) ==> x = %e, diff=%e",
+			 buf, format, x, x - xp);
+	 }
+	 else
+#endif
+	 failed ("sscanf (%s, %s, &x, &y) ==> x = %S",
+		 buf, format, x);
+	 }
+ }
+
+ if (n >= 2)
+ {
+	if (y != yp)
+	 {
+#ifexists Double_Type
+	 if ((typeof (y) == Double_Type)
+		 or (typeof (y) == Float_Type))
+	 failed ("sscanf (%s, %s, &x, &y) ==> y = %e, diff=%e",
+		 buf, format, y, y - yp);
+	 else
+#endif
+	 failed ("sscanf (%s, %s, &x, &y) ==> y = %S",
+		 buf, format, y);
+	 }
+ }
+}
+
+test_scanf (" -30,,XX ,,2,3", "%2hd%4s", -3, "0,,X", 2);
+test_scanf ("1,2,3", "%d,%2s", 1, "2,", 2);
+test_scanf ("1,2 ,3", "%d,%2s", 1, "2", 2);
+test_scanf ("1,2 ,3", "%d,%20s", 1, "2", 2);
+test_scanf ("1,,,,2,3", "%d,%20s", 1, ",,,2,3", 2);
+test_scanf ("1, ,,,2,3", "%d,%20s", 1, ",,,2,3", 2);
+test_scanf ("-30.1,,,,2,3", "%d,%2s", -30, "", 1);
+test_scanf (" -30,,XX ,,2,3", "%d%4s", -30, ",,XX", 2);
+test_scanf (" -30,,XX ,,2,3", "%hd%4s", -30, ",,XX", 2);
+test_scanf (" -30,,XX ,,2,3", "%1hd%4s", -3, "0,,X", 0);
+#ifexists Double_Type
+test_scanf (" +30.173e-2,,XX ,,2,3", "%lf,,%4s", 30.173e-2, "XX", 2);
+test_scanf (" -30.1,,XX ,,2,3", "%lf,,%4s", -30.1, "XX", 2);
+test_scanf (" +30.1,,XX ,,2,3", "%lf,,%4s", 30.1, "XX", 2);
+test_scanf (" +30.,,XX ,,2,3", "%lf,,%4s", 30.0, "XX", 2);
+test_scanf (" +30.173,,XX ,,2,3", "%lf,,%4s", 30.173, "XX", 2);
+test_scanf (" +30.173e+2,,XX ,,2,3", "%lf,,%4s", 30.173e2, "XX", 2);
+test_scanf (" +30.173e-03,,XX ,,2,3", "%lf,,%4s", 30.173e-3, "XX", 2);
+test_scanf (" +30.173E-03,,XX ,,2,3", "%lf,,%4s", 30.173e-3, "XX", 2);
+test_scanf ("+.E", "%lf%lf", 0, 0, 0);
+test_scanf ("+0.E", "%lf%s", 0, "E", 2);
+test_scanf ("-0.E", "%lf%s", 0, "E", 2);
+test_scanf ("-0.E-", "%lf%s", 0, "E-", 2);
+test_scanf ("-0.E+", "%lf%s", 0, "E+", 2);
+test_scanf ("-0.E+X", "%lf%s", 0, "E+X", 2);
+test_scanf ("-1.E+0X", "%lf%s", -1, "X", 2);
+test_scanf (".000", "%lf", 0.0, "", 1);
+test_scanf ("-.000", "%lf", -0.0, "", 1);
+test_scanf ("-0+X", "%lf%s", 0, "+X", 2);
+test_scanf ("0+X", "%lf%s", 0, "+X", 2);
+test_scanf ("0.000000000000E00+X", "%lf%s", 0, "+X", 2);
+test_scanf ("1.000000000000E000000001+X", "%lf%s", 10, "+X", 2);
+#endif
+
+test_scanf (" hello world", "%s%s", "hello", "world", 2);
+test_scanf (" hello world", "%s%c", "hello", ' ', 2);
+test_scanf (" hello world", "%s%2c", "hello", " w", 2);
+test_scanf (" hello world", "%s%5c", "hello", " worl", 2);
+test_scanf (" hello world", "%s%6c", "hello", " world", 2);
+test_scanf (" hello world", "%s%7c", "hello", " world", 2);
+test_scanf (" hello world", "%s%1000c", "hello", " world", 2);
+
+test_scanf (" hello world", "%*s%c%1000c", ' ', "world", 2);
+
+test_scanf ("abcdefghijk", "%a-c%s", "abc", "defghijk", 2);
+test_scanf ("abcdefghijk", "%4a-z%s", "abcd", "efghijk", 2);
+test_scanf ("ab-cdefghijk", "%4ab%s", "ab", "-cdefghijk", 2);
+test_scanf ("ab-cdefghijk", "%40ab-%s", "ab-", "cdefghijk", 2);
+test_scanf ("ab12345cdefghijk", "ab%^1-9%s", "", "12345cdefghijk", 2);
+test_scanf ("ab12345cdefghijk", "ab%3^4-5%s", "123", "45cdefghijk", 2);
+
+% tests " " matching 0 or more whitespace chars
+test_scanf ("hel7o world19", " h el %do wor l d%d", 7, 19, 2);
+
+test_scanf ("\t\n", "%s %s", "", "", 0);
+test_scanf ("", "%s", "", "", 0);
+
+define test_default_format ()
+{
+ loop (1000)
+ {
+	variable x = (2.0 * (random ()-0.5))
+	 * 10^(40*(random()-0.5));
+	if (x != eval(string(x)))
+	 {
+	 () = fprintf (stderr, "double %%S format failed for %.17g ==> %S\n", x, x);
+	 }
+	x = typecast (x, Float_Type);
+
+	if (x != eval(string(x)+"f"))
+	 {
+	 () = fprintf (stderr, "float %%S format failed for %.17g ==> %S\n", x, x);
+	 }
+ }
+}
+test_default_format ();
+
+private define test_bad_formats (str, fmt, varp)
+{
+ try
+ {
+	if (0 == sscanf (str, fmt, varp))
+	 throw AnyError, "sscanf returned 0-- this is ok";
+ }
+ catch AnyError: return;
+
+ failed ("expected sscanf(%S,%S,%S) to fail, produced %S", str, fmt, varp, @varp);
+}
+test_bad_formats ("7", "%d", 14);
+test_bad_formats ("7", "%)", &$1);
+test_bad_formats ("7", "%", &$1);
+test_bad_formats ("7", "%d", &errno);
+test_bad_formats ("7", "%d", &sin);
+test_bad_formats ("range", "%a-d", &$1);
+test_bad_formats ("range", "%", &$1);
+
+private define test_other_formats (str, fmt, val)
+{
+ variable x;
+ if (1 != sscanf (str, fmt, &x))
+ failed ("scanf (%S. %S. %S) did not return 1", str, fmt, &x);
+
+ if (typeof (x) != typeof (val))
+ failed ("sscanf (%S. %S. %S) produced %S, expected %S",
+	 str, fmt, &x, typeof(x), typeof(val));
+
+ if (x != val)
+ {
+	failed ("sscanf (%S, %S, %S) produced %S, expected %S",
+		str, fmt, &x, x, val);
+ }
+}
+
+#ifexists Double_Type
+test_other_formats ("2.0", "%e", 2.0f);
+test_other_formats ("2.0", "%f", 2.0f);
+test_other_formats ("2.0", "%g", 2.0f);
+test_other_formats ("2.0", "%E", 2.0);
+test_other_formats ("2.0", "%F", 2.0);
+#endif
+test_other_formats ("255", "%i", 255);
+test_other_formats ("0xFF", "%i", 255);
+test_other_formats ("0377", "%i", 255);
+
+test_other_formats ("255", "%hi", 255h);
+test_other_formats ("0xFF", "%hi", 255h);
+test_other_formats ("0377", "%hi", 255h);
+
+test_other_formats ("255", "%li", 255L);
+test_other_formats ("0xFF", "%li", 255L);
+test_other_formats ("0377", "%li", 255L);
+
+test_other_formats ("255", "%I", 255L);
+test_other_formats ("0xFF", "%I", 255L);
+test_other_formats ("0XFF", "%I", 255L);
+test_other_formats ("0377", "%I", 255L);
+
+test_other_formats ("FF", "%x", 255u);
+test_other_formats ("FF", "%hx", 255uh);
+test_other_formats ("FF", "%lx", 255UL);
+test_other_formats ("FF", "%X", 255UL);
+
+test_other_formats ("377", "%o", 255U);
+test_other_formats ("377", "%ho", 255uh);
+test_other_formats ("377", "%lo", 255UL);
+test_other_formats ("377", "%O", 255UL);
+
+test_other_formats ("1234", "%u", 1234U);
+test_other_formats ("1234", "%hu", 1234UH);
+test_other_formats ("1234", "%lu", 1234UL);
+test_other_formats ("1234", "%U", 1234UL);
+
+private define is_equal (x, y)
+{
+ if (x == y) return 1;
+#ifexists isnan
+ if (isnan (x) && isnan (y))
+ return 1;
+#endif
+ return 0;
+}
+
+private define test_2weird (str, fmt, x, y)
+{
+ variable a, b;
+ if ((2 != sscanf (str, fmt, &a, &b))
+ || (0 == is_equal(a, x))
+ || (0 == is_equal(b, y)))
+ failed ("sscanf (%S, %S): expected %S, %S", str, fmt, x, y);
+}
+
+#ifexists Double_Type
+test_2weird ("-nan:4", "%f:%d", _NaN, 4);
+test_2weird ("-nan():4", "%f:%d", _NaN, 4);
+test_2weird ("-nan(here):4", "%f:%d", _NaN, 4);
+test_2weird ("Inf:4", "%f:%d", _Inf, 4);
+test_2weird ("Infinity:4", "%f:%d", _Inf, 4);
+test_2weird ("-Inf:4", "%f:%d", -_Inf, 4);
+test_2weird ("-Infinity:4", "%f:%d", -_Inf, 4);
+#endif
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/stack.sl Added

@@ -0,0 +1,56 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("stack functions");
+
+private define push(a)
+{
+   foreach (a)
+     ;
+}
+
+private define check_stack (f, a)
+{
+   variable n = _stkdepth ();
+   if (n != length (a))
+     failed ("%s: _stkdepth != %d", f, n);
+   variable list = __pop_list (n);
+   ifnot (_eqs (list_to_array (list), a))
+     failed ("%s: stack mismatch", f);
+   __push_list (list);
+}
+
+private define check_stack_funcs ()
+{
+   push (1,2,3,4,5);
+   _stk_roll (0);
+   check_stack ("_stk_roll 0", 1,2,3,4,5);
+   _stk_roll (1);
+   check_stack ("_stk_roll 1", 1,2,3,4,5);
+   _stk_roll (2);
+   check_stack ("_stk_roll 2", 1,2,3,5,4);
+   _stk_roll (-2);
+   check_stack ("_stk_roll -2", 1,2,3,4,5);
+   _stk_roll (-5); check_stack ("_stk_roll -5", 2,3,4,5,1);
+   _stk_roll (5); check_stack ("_stk_roll 5", 1,2,3,4,5);
+
+   _stk_reverse (0); check_stack ("_stk_reverse 0", 1,2,3,4,5);
+   _stk_reverse (1); check_stack ("_stk_reverse 1", 1,2,3,4,5);
+   _stk_reverse (3); check_stack ("_stk_reverse 3", 1,2,5,4,3);
+   try
+     {
+	_stk_reverse (-3);
+	failed ("Expected _stk_reverse -3 to fail");
+     }
+   catch StackUnderflowError;
+   check_stack ("_stk_reverse -3 corruption", 1,2,5,4,3);
+
+   dup (); check_stack ("dup", 1,2,5,4,3,3);
+   pop (); check_stack ("pop", 1,2,5,4,3);
+   exch (); check_stack ("exch", 1,2,5,3,4);
+}
+check_stack_funcs ();
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/stdio.sl Added

@@ -0,0 +1,384 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("stdio routines");
+
+define fdopen_tmp_file (fileptr, mode, fdp)
+{
+ variable file, fp, fd;
+
+ @fileptr = NULL;
+
+ file = util_make_tmp_file ("tmpfile", &fd);
+ fp = fdopen (fd, mode);
+ if (fp == NULL)
+ failed ("fdopen failed: %s", errno_string());
+
+ @fdp = fd;
+ @fileptr = file;
+ return fp;
+}
+
+define fopen_tmp_file (fileptr, mode)
+{
+ variable file, fp;
+
+ @fileptr = NULL;
+
+ file = util_make_tmp_file ("tmpfile", NULL);
+
+ fp = fopen (file, mode);
+ if (fp == NULL)
+ failed ("Unable to open %S", file);
+
+ @fileptr = file;
+ return fp;
+}
+
+define run_tests (some_text, read_fun, write_fun, length_fun)
+{
+ variable file, fp, fd;
+ variable new_text, nbytes, len;
+ variable pos;
+
+ fp = fdopen_tmp_file (&file, "wb", &fd);
+#ifexists setvbuf
+ if (-1 == setvbuf (fp, _IOFBF, 8))
+ failed ("setvbuf");
+#endif
+ if (-1 == @write_fun (some_text, fp))
+ failed (string (write_fun));
+
+ if (-1 == fclose (fp))
+ failed ("fclose");
+
+ fp = fopen (file, "rb");
+ if (fp == NULL) failed ("fopen existing");
+
+ len = @length_fun (some_text);
+ nbytes = @read_fun (&new_text, len, fp);
+
+ if ((nbytes != len)
+ or (some_text != new_text))
+ failed (string (read_fun));
+
+ if (-1 != @read_fun (&new_text, 1, fp))
+ failed (string (read_fun) + " at EOF");
+
+ if (0 == feof (fp)) failed ("feof");
+
+ if (ferror (fp))
+ failed ("expected ferror to return 0");
+
+ clearerr (fp);
+ if (feof (fp)) failed ("clearerr");
+
+ if (0 != fseek (fp, 0, SEEK_SET)) failed ("fseek");
+
+ nbytes = @read_fun (&new_text, len, fp);
+
+ if ((nbytes != len)
+ or (some_text != new_text))
+ failed (string (read_fun) + " after fseek");
+
+ pos = ftell (fp);
+ if (pos == -1) failed ("ftell at EOF");
+
+ if (0 != fseek (fp, 0, SEEK_SET)) failed ("fseek");
+ if (0 != ftell (fp)) failed ("ftell at BOF");
+ if (0 != fseek (fp, pos, SEEK_CUR)) failed ("fseek to pos");
+
+ if (pos != ftell (fp)) failed ("ftell after fseek to pos");
+
+ if (feof (fp) != 0) failed ("feof after fseek to EOF");
+
+ () = fseek (fp, 0, SEEK_SET);
+ nbytes = fread (&new_text, Char_Type, 0, fp);
+ if (nbytes != 0)
+ failed ("fread for 0 bytes");
+
+ nbytes = fread (&new_text, Char_Type, len + 100, fp);
+ if (nbytes != len)
+ failed ("fread for 100 extra bytes");
+
+ if (-1 == fclose (fp)) failed ("fclose after tests");
+
+ fd = open (file, O_RDONLY);
+ if (fd == NULL)
+ failed ("open %s failed", file);
+
+ variable ofs = (@length_fun)(some_text) - 1;
+ variable ofs1 = lseek (fd, ofs, SEEK_SET);
+ if (ofs != ofs1)
+ failed ("lseek returned %S, expected %S: %S", ofs1, ofs, errno_string());
+ if (1 != read (fd, &new_text, 1))
+ failed ("read failed after lseek");
+ if (new_text0 != some_text-1)
+ failed ("read failed to read the correct byte after lseek: 0x%X vs 0x%X",
+	 new_text0, some_text-1);
+ () = close (fd);
+
+ () = remove (file);
+ if (stat_file (file) != NULL) failed ("remove");
+}
+
+static define do_fgets (addr, nbytes, fp)
+{
+ variable count;
+ variable dbytes, bytes;
+
+ variable dc = fgets (&bytes, fp);
+ if (dc == -1)
+ return -1;
+
+ count = dc;
+ while (count < nbytes)
+ {
+	dc = fgets (&dbytes, fp);
+	if (dc == -1)
+	 break;
+	count += dc;
+	bytes += dbytes;
+ }
+ @addr = bytes;
+ return count;
+}
+
+static define do_fread (addr, nbytes, fp)
+{
+ % return fread (addr, UChar_Type, nbytes, fp);
+ return fread_bytes (addr, nbytes, fp);
+}
+
+private define do_fprintf (some_text, fp)
+{
+ if (fprintf (fp, "%s", some_text) != strbytelen(some_text))
+ return -1;
+
+ return 0;
+}
+
+private define do_foreach_char (addr, nbytes, fp)
+{
+ variable ch, str = NULL, count = 0;
+ foreach ch (fp) using ("char")
+ {
+	if (str == NULL)
+	 str = "";
+	str = strcat (str, char(-1*ch));
+	count++;
+	if (count >= nbytes)
+	 break;
+ }
+ if (str == NULL)
+ return -1;
+
+ @addr = str;
+ return count;
+}
+
+private define do_foreach_line (addr, nbytes, fp)
+{
+ variable line, str = NULL, count = 0;
+ foreach line (fp) using ("line")
+ {
+	if (str == NULL)
+	 str = "";
+	str = strcat (str, line);
+	count += strbytelen(line);
+	if (count >= nbytes)
+	 break;
+ }
+ if (str == NULL)
+ return -1;
+
+ @addr = str;
+ return count;
+}
+
+run_tests ("ABCDEFG", &do_fgets, &fputs, &strlen);
+run_tests ("A\000BC\000\n\n\n", &do_fread, &fwrite, &bstrlen);
+run_tests ("A\nAB\n\ABC\nABCD", &do_fgets, &do_fprintf, &strbytelen);
+run_tests ("A\nAB\n\ABC\nABCD", &do_foreach_char, &fwrite, &strbytelen);
+run_tests ("A\nAB\n\ABC\nABCD", &do_foreach_line, &fwrite, &strbytelen);
+
+define test_fread_fwrite (x)
+{
+ variable fp, file, str, n, m, y, type, ch;
+
+ fp = fopen_tmp_file (&file, "w+b");
+
+ type = _typeof(x);
+ n = length (x);
+ if ((type == String_Type) or (type == BString_Type))
+ {
+	%type = UChar_Type;
+	n = bstrlen (x);
+ }
+
+ if (n != fwrite (x, fp))
+ failed ("test_fread_fwrite: fwrite");
+
+ if (-1 == fseek (fp, 0, SEEK_SET))
+ failed ("test_fread_fwrite: fseek");
+
+ if (n != fread (&y, type, n, fp))
+ failed ("test_fread_fwrite: fread");
+
+ if (length (where (y != x)))
+ failed ("test_fread_fwrite: fread failed to return: " + string(x));
+
+ if (-1 == fseek (fp, 0, SEEK_SET))
+ failed ("test_fread_fwrite: fseek");
+
+ if (type == UChar_Type)
+ {
+	y = 0;
+	foreach (fp) using ("char")
+	 {
+	 ch = ();
+	 if (ch != xy)
+	 failed ("foreach using char: %S != %S", ch, xy);
+	 y++;
+	 }
+	if (y != n)
+	 failed ("foreach using char 2");
+ }
+
+ () = fclose (fp);
+
+ if (-1 == remove (file))
+ failed ("remove:" + errno_string(errno));
+ if (stat_file (file) != NULL) failed ("remove");
+}
+
+test_fread_fwrite ("");
+test_fread_fwrite ("hello");
+test_fread_fwrite ("hel\0\0lo");
+test_fread_fwrite (Integer_Type0);
+test_fread_fwrite (1:10);
+#ifexists Double_Type
+test_fread_fwrite (3.17);
+test_fread_fwrite (1:10:0.1);
+#endif
+#ifexists Complex_Type
+test_fread_fwrite (Complex_Type50 + 3 + 2i);
+test_fread_fwrite (2i+3);
+test_fread_fwrite (2i+3, 7i+1);
+#endif
+
+static define test_fgetsputslines ()
+{
+ variable lines = array_map (String_Type, &string, 1:1000);
+ lines += "\n";
+ variable file;
+ variable fp = fopen_tmp_file (&file, "w");
+ if (length (lines) != fputslines (lines, fp))
+ failed ("fputslines");
+ if (-1 == fclose (fp))
+ failed ("fputslines;fclose");
+ fp = fopen (file, "r");
+ if (fp == NULL)
+ failed ("fputslines...fopen");
+ variable lines1 = fgetslines (fp);
+ if (0 == _eqs (lines1, lines))
+ failed ("fgetslines");
+ ()=fclose (fp);
+ if (-1 == remove (file))
+ failed ("remove:" + errno_string(errno));
+}
+test_fgetsputslines ();
+
+define test_read_write ()
+{
+ variable file;
+ variable fp = fopen_tmp_file (&file, "w");
+ variable fd = fileno (fp);
+
+ variable str = "helloworld";
+ variable n = write (fd, str);
+ if (n != strlen (str))
+ failed ("write(%s) returned %d", str, n);
+ () = fclose (fp);
+ fd = open (file, O_RDONLY);
+ variable buf;
+ n = read (fd, &buf, n);
+ if (n != strlen (str))
+ failed ("read returned %d bytes", n);
+ if (buf != str)
+ failed ("read returned %s not %s", buf, str);
+ () = close (fd);
+ () = remove (file);
+}
+test_read_write();
+
+#ifdef UNIX
+private define test_write_to_stdout ()
+{
+ () = fflush(stdout);
+ variable fd = fileno (stdout);
+ variable ifd = _fileno(stdout);
+ variable old_stdout = dup_fd(fd);
+ if (old_stdout == NULL)
+ failed ("test_write_to_stdout: dup: %S", errno_string());
+
+ variable new_fd = open("/dev/null", O_WRONLY);
+
+ if (-1 == dup2_fd(new_fd, ifd))
+ failed ("test_write_to_stdout: dup2: %S", errno_string());
+
+ () = close (new_fd);
+
+ () = printf ("Write to stdout, fileno=%S", fileno(stdout));
+ () = fflush(stdout);
+
+ () = dup2_fd(old_stdout, ifd);
+ () = close (old_stdout);
+}
+test_write_to_stdout ();
+#endif
+
+#ifdef UNIX
+private define test_popen ()
+{
+ variable fp = popen ("ls", "r");
+ if (fp == NULL)
+ failed ("popen ls failed");
+ variable count = 0;
+ foreach (fp) using ("wsline")
+ {
+	variable line = ();
+	count++;
+ }
+ if (0 != pclose (fp))
+ failed ("pclose: %S", errno_string());
+ if (count == 0)
+ failed ("no lines read from popen ls");
+}
+test_popen ();
+#endif
+
+private define test_bad_fds ()
+{
+ variable file;
+ variable fp = fopen_tmp_file (&file, "w");
+ () = remove (file);
+
+ if (NULL != fgetslines (fp, 0))
+ {
+	() = fclose (fp);
+	failed ("fgetslines on write-only stdio file pointer");
+ }
+
+ clearerr (fp);
+
+ if (-1 == fclose (fp))
+ failed ("fclose failed");
+
+ if (-1 != fclose (fp))
+ failed ("Expected second fclose to fail");
+}
+test_bad_fds ();
+
+print ("Ok\n");
+
+exit (0);

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/strops.sl Added

@@ -0,0 +1,997 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("string functions");
+
+% Usage: test (&fun, args, expected_ans);
+static define test ()
+{
+ variable ans = ();
+ variable args = __pop_args (_NARGS-2);
+ variable fun = ();
+ variable result = (@fun) (__push_args(args));
+ if (ans != result)
+ {
+	variable fmt = String_Type_NARGS-2;
+	fmt* = "%S";
+	fmt = sprintf ("%%S(%s) ==> %%S!=%%S", strjoin (fmt, ","));
+	failed (fmt, fun, __push_args(args), result, ans);
+ }
+}
+
+%test (&str_delete_chars, "foo\xAAbar", "\xAA", "foobar");
+
+private variable s;
+s = " \t hello world\n\t";
+if ("hello world" != strtrim (s)) failed ("strtrim");
+if ("hello world\n\t" != strtrim_beg (s)) failed ("strtrim_beg");
+if (" \t hello world" != strtrim_end (s)) failed ("strtrim_beg");
+
+if ("hello wor" != strtrim (s, " \t\nld")) failed ("strtrim with whitespace");
+
+if ("" != strcat ("", ""))
+ failed ("strcat 0");
+if ("1" != strcat ("", "1"))
+ failed ("strcat 1");
+
+if ("abcdefg" != strcat ("a", "b", "c", "d", "e", "f", "g")) failed ("strcat");
+if ("abcdefg" != strcat ("abcdefg")) failed ("strcat 2");
+
+if ((strtok (s)0 != "hello")
+ or (strtok(s)1 != "world")
+ or (strtok (s, "^a-z")0 != "hello")
+ or (strtok (s, "^a-z")1 != "world")
+ or (2 != length (strtok (s)))
+ or (2 != length (strtok (s, "^a-z")))) failed ("strtok");
+
+define test_create_delimited_string ()
+{
+ variable n = ();
+ variable args = __pop_args (_NARGS - 3);
+ variable delim = ();
+ variable eresult = ();
+ variable result;
+
+ result = create_delimited_string (delim, __push_args (args), n);
+ if (eresult != result)
+ failed ("create_delimited_string: expected: %s, got: %s",
+	 eresult, result);
+
+ if (n)
+ result = strjoin (__push_args (args), delim);
+ else
+ result = strjoin (String_Type0, delim);
+
+ if (eresult != result)
+ failed ("strjoin: expected: %s, got: %s",
+	 eresult, result);
+}
+
+test_create_delimited_string ("aXXbXXcXXdXXe",
+			 "XX",
+			 "a", "b", "c", "d", "e",
+			 5);
+
+test_create_delimited_string ("", "", "", 1);
+test_create_delimited_string ("a", ",", "a", 1);
+test_create_delimited_string (",", ",", "", "", 2);
+test_create_delimited_string (",,", ",", "", "", "", 3);
+test_create_delimited_string ("", "XXX", 0);
+
+static define test_str_delete_chars (str, del_set, ans)
+{
+ variable s1 = str_delete_chars (str, del_set);
+ if (ans != s1)
+ failed ("str_delete_chars(\"%s\", \"%s\") --> \"%s\"", str, del_set, s1);
+
+ variable a, b, b1, i = 1,3,4;
+ a = String_Type5; b = @a;
+ ai = str;
+ bi = ans;
+ b1 = str_delete_chars (a, del_set);
+ if (any(b1 != b))
+ failed ("str_delete_chars(\"%S\", \"%S\") --> \"%S\"", a, del_set, b1);
+}
+
+test_str_delete_chars ("abcdefg", "bdf", "aceg");
+test_str_delete_chars ("abcdefg", "^bdf", "bdf");
+test_str_delete_chars ("abcdefg", "bdfg", "ace");
+test_str_delete_chars ("abcdefg", "ag", "bcdef");
+test_str_delete_chars ("abcdefg", "^ag", "ag");
+test_str_delete_chars ("abcdefg", "a-z", "");
+test_str_delete_chars ("abcdefgABCDEF", "\l"R, "ABCDEF");
+test_str_delete_chars ("abcdefgABCDEF", "^\l"R, "abcdefg");
+
+test_str_delete_chars (",1,", `\,`, "1");
+test_str_delete_chars (",", `\,`, "");
+test_str_delete_chars ("1,", `\,`, "1");
+test_str_delete_chars ("1,,,1", `\,`, "11");
+test_str_delete_chars ("\\", "\\", "");
+test_str_delete_chars ("\\n", "\\", "n");
+test_str_delete_chars ("12,a,3,b", "\\a", "12,,3,");
+test_str_delete_chars ("12\t,a\n, 3,b", "\\g", "\t\n ");
+test_str_delete_chars ("12\t,a\ng, 3,b", "\\x", "\t,\ng, ,");
+
+static define test_strtrans (s, from, to, ans)
+{
+ variable s1;
+
+ try
+ {
+	s1 = strtrans (s, from, to);
+	if (ans == NULL)
+	 failed ("Expected strtrans('%s', '%s', '%s') to fail", s, from, to);
+ }
+ catch AnyError:
+ {
+	if (ans == NULL)
+	 return;
+	throw;
+ }
+ if (ans != s1)
+ failed ("strtrans(%s, %s, %s) --> %s", s, from, to, s1);
+
+ variable a, b, b1, i = 1,3,4;
+ a = String_Type5; b = @a;
+ ai = s;
+ bi = ans;
+ b1 = strtrans (a, from, to);
+ if (any(b1 != b))
+ failed ("strtrans(%S, %S, %S) --> %S", a, from, to, b1);
+
+ if ((to == "X") && (from0 != '^'))
+ {
+	% we can double the from and get the same result
+	from = from + from;
+	s1 = strtrans (s, from, to);
+	if (ans != s1)
+	 failed ("strtrans(%s, \"%s\", \"%s\") --> \"%s\"", s, from, to, s1);
+	to = "XX";
+	s1 = strtrans (s, from, to);
+	if (ans != s1)
+	 failed ("strtrans(%s, \"%s\", \"%s\") --> \"%s\"", s, from, to, s1);
+ }
+}
+
+test_strtrans ("hello world", "^a-zA-Z", "X", "helloXworld");
+test_strtrans ("hello world", "^\a"R, "X", "helloXworld");
+test_strtrans ("hello", "", "xxxx", "hello");
+test_strtrans ("hello", "l", "", "heo");
+test_strtrans ("hello", "helo", "abcd", "abccd");
+test_strtrans ("hello", "hl", "X", "XeXXo");
+test_strtrans ("", "hl", "X", "");
+test_strtrans ("hello", "a-z", "A-Z", "HELLO");
+test_strtrans ("he\\o"R, "\\\\", "x", "hexxo");
+test_strtrans ("hello", "\l"R, "\u"R, "HELLO");
+test_strtrans ("hello", "a-mn-z", "A-MN-Z", "HELLO");
+test_strtrans ("hello", "a-mn-z", "\\u", "HELLO");
+test_strtrans ("hello", "a-mn-z", "\\u\\l", "HELLo");
+test_strtrans ("abcdefg", "a-z", "Z-A", "ZYXWVUT");
+%test_strtrans ("hejklo", "k-l", "L---", "hejL-o");
+test_strtrans ("hejklo", "k-l", "\\u", "hejKLo");
+test_strtrans ("hello", "he", "-+", "-+llo");
+test_strtrans ("hello", "", "", "hello");
+test_strtrans ("hello", "helo", "", "");
+test_strtrans ("hello", "o", "", "hell");
+test_strtrans ("hello", "hlo", "", "e");
+test_strtrans ("", "hlo", "", "");
+test_strtrans ("HeLLo", "A-Ze", "", "o");
+test_strtrans ("HeLLo", "^A-Z", "", "HLL");
+test_strtrans ("HeLLo", "\\l\\u", "aA", "AaAAa");
+test_strtrans ("He11o", "\l\u\d"R, "aAx", "Aaxxa");
+
+test_strtrans (",1,", `\,`, "X", "X1X");
+test_strtrans (",", `\,`, "X", "X");
+test_strtrans ("1,", `\,`, "X", "1X");
+test_strtrans ("1,,,1", `\,`, "X", "1XXX1");
+test_strtrans ("\\", "\\", "X", "X");
+test_strtrans ("\\n", "\\", "X", "Xn");
+test_strtrans ("12,a,X3,b", "\\a", "X", "12,X,X3,X");
+test_strtrans ("12\t,a\n, 3,b", "\\g", "X", "XX\tXX\nX XXX");
+test_strtrans ("12\t,a\n, 3,b", "\\c", "X", "12X,aX, 3,b");
+test_strtrans ("12\t,a\n, 3,b", "\\p", "X", "XX\tXX\nXXXXX");
+test_strtrans ("12\t,a\n, 3,b", "\\b", "X", "12X,a\n,X3,b");
+test_strtrans ("12\t,A\ng, 3,b", "\\x", "X", "XX\t,X\ng, X,X");
+test_strtrans ("12\t,A\ng, 3,b", "\\w", "X", "XX\t,X\nX, X,X");
+
+test_strtrans (",1,", ":punct:", "X", "X1X");
+test_strtrans (",", ":punct:", "X", "X");
+test_strtrans ("1,", ":punct:", "X", "1X");
+test_strtrans ("1,,,1", ":punct:", "X", "1XXX1");
+test_strtrans ("12,a,X3,b", ":alpha:", "X", "12,X,X3,X");
+test_strtrans ("12\t,a\n, 3,b", ":print:", "X", "XX\tXX\nXXXXX");
+test_strtrans ("12\t,a\n, 3,b", ":blank:", "X", "12X,a\n,X3,b");
+test_strtrans ("12\t,a\n, 3,b", ":graph:", "X", "XX\tXX\nX XXX");
+test_strtrans ("12\t,A\ng, 3,b", ":xdigit:", "X", "XX\t,X\ng, X,X");
+
+#ifeval _slang_utf8_ok
+test_strtrans ("|\u{EF}\u{100}\u{80}|", "^\\7", "X", "|XXX|");
+test_strtrans ("|\u{EF}\u{100}\u{80}|", "\\7", "X", "X\u{EF}\u{100}\u{80}X");
+test_strtrans ("|\u{100}|", "^\\7", "X", "|X|");
+test_strtrans ("|\u{FF}|", "\\7", "\u{1234}", "\u{1234}\u{FF}\u{1234}");
+test_strtrans ("|\u{FF}|", "^\\7", "X", "|X|");
+
+test_strtrans ("|\u{FF}\u{100}\u{101}|", "\u{100}", "X", "|\u{FF}X\u{101}|");
+test_strtrans ("|\u{FF}\u{100}\u{101}|", "^\u{100}\\7", "X", "|X\u{100}X|");
+test_strtrans ("|\u{FF}\u{100}\u{101}|", "^\u{100}\\7", "\u{1000}", "|\u{1000}\u{100}\u{1000}|");
+test_strtrans ("|\u{FF}\u{100}\u{101}|", "\u{100}-\u{101}", "X", "|\u{FF}XX|");
+test_strtrans ("|\u{FF}\u{100}\u{101}|", "\u{FF}-\u{100}", "X", "|XX\u{101}|");
+test_strtrans ("|\u{FF}\u{100}\u{101}|", "\u{100}-\u{101}", "\u{FF}-\u{100}", "|\u{FF}\u{FF}\u{100}|");
+
+test_strtrans ("|\u{FF}\u{100}\u{101}|", "\u{100}-\u{101}", "\\u", "|\u{FF}\u{100}\u{100}|");
+test_strtrans ("|\u{FF}\u{100}\u{101}|", "\u{100}-\u{101}", "\\l", "|\u{FF}\u{101}\u{101}|");
+test_strtrans ("|\u{FF}\u{100}\u{101}|", "^\\7", "\\u", "|\u{178}\u{100}\u{100}|");
+
+test_strtrans ("|\u{1000}|", "^\\7", "\\l", "|\u{1000}|");
+test_strtrans ("|\u{1000}|", "^\\7", "\\u", "|\u{1000}|");
+test_strtrans ("|\u{1000}|", "\u{999}-\u{1000}", "\\u", "|\u{1000}|");
+test_strtrans ("|\u{1000}|", "\u{999}-\u{1000}\u{2000}-\u{3000}", "\\u", "|\u{1000}|");
+test_strtrans ("|\u{1000}|", "\u{7f}-\u{1500}\u{2000}", "", "||");
+test_strtrans ("|\u{1000}x", "^\u{999}-\u{1000}", "\\u", "|\u{1000}X");
+
+test_strtrans ("|\u{FF}\u{100}\u{101}|", "\u{100}-\u{101}", "\u{FF}-\u{100}", "|\u{FF}\u{FF}\u{100}|");
+test_strtrans ("|\u{FF}\u{100}\u{101}|", "\\c", "X", "|\u{FF}\u{100}\u{101}|");
+
+% Bad cases
+test_strtrans ("|\u{FF}\u{100}\u{101}|", "^\u{100}-\u{101}", "\u{FF}-\u{100}", NULL);
+test_strtrans ("|\u{FF}\u{100}\u{101}|", "\u{100}-\u{101}", "^\u{FF}-\u{100}", NULL);
+test_strtrans ("|\u{FF}\u{100}\u{101}|", "\u{100}-\u{101}", "\\7", NULL);
+
+private define test_long_range ()
+{
+ variable r1 = "";
+ variable r2 = "";
+ _for (1000, 1067, 1)
+ {
+	variable i = ();
+	r1 = strcat (r1, char(i));
+	r2 = strcat (r2, char(i+1));
+ }
+ test_strtrans (r1, r1, r2, r2);
+ test_strtrans (r1, r2, "", substr(r1,1,1));
+}
+test_long_range();
+
+#endif
+test_strtrans (",1,", ":Xpunct:", "X", NULL);
+
+private define test_strcompress (str, white, ans)
+{
+ variable ans1 = strcompress (str, white);
+ if (ans != ans1)
+ failed ("%S != %S = strcompress(%S, %S)", ans, ans1, str, white);
+
+ variable a, b, b1, i = 1,3,4;
+ a = String_Type5; b = @a;
+ ai = str;
+ bi = ans;
+ b1 = strcompress (a, white);
+ if (any(b1 != b))
+ failed ("strcompress(%S, %S) --> %S", a, white, b1);
+}
+test_strcompress ("3)x", "_ #&<>\t()-", "3_x");
+test_strcompress (" \t \tA\n\ntest\t", " \t\n", "A test");
+test_strcompress ("../afoo/bfoo/cbard/ooohbhar/", "/", "../afoo/bfoo/cbard/ooohbhar");
+
+define test_str_replace_all (a, b, c, result, n)
+{
+ variable new;
+ variable m;
+
+ (new, m) = strreplace (a, b, c, n);
+
+ if (new != result)
+ failed ("strreplace (%s, %s, %s, %d) ==> %s!=%s", a, b, c, n, new, result);
+
+ if (n == 1)
+ {
+	n = str_replace (a, b, c);
+	!if (n) a;
+	new = ();
+	if (new != result)
+	 failed ("str_replace (%s, %s, %s) ==> %s!=", a, b, c, new, result);
+ }
+}
+
+define test_str_replace (a, b, c, result, n)
+{
+ variable new;
+ variable m;
+
+ (new, m) = strreplace (a, b, c, n);
+
+ if (new != result)
+ failed ("strreplace (%s, %s, %s, %d) ==> %s!=%s", a, b, c, n, new, result);
+
+ if (n == 1)
+ {
+	n = str_replace (a, b, c);
+	!if (n) a;
+	new = ();
+	if (new != result)
+	 failed ("str_replace (%s, %s, %s) ==> %s!=%S", a, b, c, new, result);
+ }
+
+ % Alternate interface
+ variable new1 = strreplace (a, b, c);
+ (new,) = strreplace (a, b, c, strbytelen (a));
+ if (new1 != new)
+ failed ("str_replace (%s, %s, %s) ==> %s!=%s", a, b, c, new, new1);
+}
+
+test_str_replace ("a", "b", "x", "a", 1);
+test_str_replace ("a", "b", "x", "a", -1);
+test_str_replace ("a", "b", "x", "a", -10);
+test_str_replace ("a", "b", "x", "a", 10);
+test_str_replace ("a", "b", "x", "a", 0);
+test_str_replace ("blafoofbarfoobar", "", "xyyy", "blafoofbarfoobar", 0);
+test_str_replace ("blafoofbarfoobar", "", "xyyy", "blafoofbarfoobar", 1);
+test_str_replace ("blafoofbarfoobar", "", "xyyy", "blafoofbarfoobar", -1);
+test_str_replace ("blafoofbarfoobar", "", "xyyy", "blafoofbarfoobar", -10);
+
+test_str_replace ("blafoofbarfoobar", "foo", "XY", "blafoofbarfoobar", 0);
+test_str_replace ("blafoofbarfoobar", "foo", "XY", "blaXYfbarfoobar", 1);
+test_str_replace ("blafoofbarfoobar", "foo", "XY", "blaXYfbarXYbar", 2);
+test_str_replace ("blafoofbarfoobar", "foo", "XY", "blaXYfbarXYbar", 10);
+test_str_replace ("blafoofbarfoobar", "foo", "XY", "blafoofbarXYbar", -1);
+test_str_replace ("blafoofbarfoobar", "foo", "XY", "blaXYfbarXYbar", -2);
+test_str_replace ("blafoofbarfoobar", "r", "", "blafoofbarfoobar", 0);
+test_str_replace ("blafoofbarfoobar", "r", "", "blafoofbafoobar", 1);
+test_str_replace ("blafoofbarfoobar", "r", "", "blafoofbafooba", 2);
+test_str_replace ("blafoofbarfoobar", "r", "", "blafoofbarfooba", -1);
+test_str_replace ("blafoofbarfoobar", "r", "", "blafoofbafooba", -2);
+test_str_replace ("bla", "bla", "", "", -2);
+test_str_replace ("bla", "bla", "foo", "foo", -2);
+test_str_replace ("bla", "bla", "foo", "foo", 1);
+
+define test_strcat ()
+{
+ % This test generates a combined byte-code. It is used for leak checking
+ variable a = "hello";
+ variable b = "world";
+ loop (20)
+ {
+	variable c = a + b;
+	a = c;
+ }
+}
+test_strcat ();
+
+static define test_str_uncomment_string (s, beg, end, result)
+{
+ variable r = str_uncomment_string (s, beg, end);
+ if (r != result)
+ {
+	failed ("str_uncomment_string(%s,%s,%s)==>%s!=%s",
+		s, beg, end, r, result);
+ }
+}
+
+test_str_uncomment_string ("Ab(cd)e", "(",")", "Abe");
+test_str_uncomment_string ("(Ab(cd)e", "(",")", "e");
+test_str_uncomment_string ("(Abcde)", "(",")", "");
+test_str_uncomment_string ("(Abcde)defg", "(",")", "g");
+
+static define test_str_quote_string (str, qlis, quote, result)
+{
+ variable r = str_quote_string (str, qlis, quote);
+ if (r != result)
+ {
+	failed ("str_quote_string (%s,%s,%d)==>%s!=%s",
+		str, qlis, quote, r, result);
+ }
+}
+
+test_str_quote_string ("hello", "lh", 'X', "XheXlXlo");
+#ifeval _slang_utf8_ok
+test_str_quote_string ("hel\u{1234}o", "lh\u{1234}", 0x2345, "\u{2345}he\u{2345}l\u{2345}\u{1234}o");
+#endif
+
+private variable D, S;
+
+foreach D (',', 0xAB, 0xABCD)
+{
+ if ((D > 0xFF) and (_slang_utf8_ok == 0))
+ continue;
+
+ S = "foo0,bar1,baz2,,bing4,5,,,8,";
+ test_str_replace ((S, ",", sprintf ("%c", D),
+		 sprintf ("foo0%sbar1%sbaz2%s%sbing4%s5%s%s%s8%s",
+			 char(D),char(D),char(D),char(D),char(D),char(D),
+			 char(D),char(D),char(D)),
+		 strlen (S)));
+
+ (S,) = strreplace (S, ",", sprintf ("%c", D), strlen (S));
+ test (&extract_element,(S,0,,D,), "foo0");
+ test (&extract_element,(S,1,,D,), "bar1");
+ test (&extract_element,(S,3,,D,), "");
+ test (&extract_element,(S,4,,D,), "bing4");
+ test (&extract_element,(S,5,,D,), "5");
+ test (&extract_element,(S,6,,D,), "");
+ test (&extract_element,(S,7,,D,), "");
+ test (&extract_element,(S,8,,D,), "8");
+ test (&extract_element,(S,9,,D,), "");
+
+ test(&is_list_element, (S, "bar1", ,D,), 1+1);
+ test(&is_list_element, (S, "goo", ,D,), 0);
+ test(&is_list_element, (S, "8", ,D,), 8+1);
+ test(&is_list_element, (S, "", ,D,), 3+1);
+
+ S = ",1,";
+ (S,) = strreplace (S, ",", sprintf ("%c", D), strlen (S));
+ test (&extract_element,(S,0,,D,), "");
+ test (&extract_element,(S,1,,D,), "1");
+ test (&extract_element,(S,2,,D,), "");
+ S = "";
+ (S,) = strreplace (S, ",", sprintf ("%c", D), strlen (S));
+ test (&extract_element,(S,0,,D,), "");
+ test (&extract_element,(S,1,,D,), NULL);
+ S = ",1";
+ (S,) = strreplace (S, ",", sprintf ("%lc", D), strlen (S));
+ test (&extract_element,(S,0,,D,), "");
+ test (&extract_element,(S,1,,D,), "1");
+}
+
+static define test_strncmp (a, b, n, ans)
+{
+ variable ans1 = strncmp (a, b, n);
+ if (ans1 != ans)
+ failed ("strncmp (%s,%s,%s)", a, b, n);
+ variable aa, bb;
+
+ aa = a,a,a, bb = b;
+ ans1 = strncmp (aa, bb, n);
+ if ((length (ans1) != length (aa))
+ || not all (ans1 == ans))
+ failed ("%S = strncmp (%S, %S, %S)", ans1, aa, bb, n);
+
+ aa = a, bb = b,b;
+ ans1 = strncmp (aa, bb, n);
+ if ((length (ans1) != length (bb))
+ || not all (ans1 == ans))
+ failed ("%S = strncmp (%S, %S, %S)", ans1, aa, bb, n);
+
+ aa = a,a,a,a, bb = b,b,b,b;
+ ans1 = strncmp (aa, bb, n);
+ if ((length (ans1) != length (aa))
+ || not all (ans1 == ans))
+ failed ("%S = strncmp (%S, %S, %S)", ans1, aa, bb, n);
+}
+
+test_strncmp ("ignore_all", "ign", 3, 0);
+test_strncmp ("ign", "ignore_all", 3, 0);
+
+static define test_strnbytecmp (a, b, n, ans)
+{
+ variable ans1 = strnbytecmp (a, b, n);
+ if (ans1 != ans)
+ failed ("strnbytecmp (%s,%s,%s)", a, b, n);
+ variable aa, bb;
+
+ aa = a,a,a, bb = b;
+ ans1 = strnbytecmp (aa, bb, n);
+ if ((length (ans1) != length (aa))
+ || not all (ans1 == ans))
+ failed ("%S = strnbytecmp (%S, %S, %S)", ans1, aa, bb, n);
+
+ aa = a, bb = b,b;
+ ans1 = strnbytecmp (aa, bb, n);
+ if ((length (ans1) != length (bb))
+ || not all (ans1 == ans))
+ failed ("%S = strnbytecmp (%S, %S, %S)", ans1, aa, bb, n);
+
+ aa = a,a,a,a, bb = b,b,b,b;
+ ans1 = strnbytecmp (aa, bb, n);
+ if ((length (ans1) != length (aa))
+ || not all (ans1 == ans))
+ failed ("%S = strnbytecmp (%S, %S, %S)", ans1, aa, bb, n);
+
+ aa = String_Type0;
+ bb = b;
+ ans1 = strnbytecmp (aa, bb, n);
+ if (length (ans1) != length (aa))
+ failed ("%S = strnbytecmp (%S, %S, %S)", ans1, aa, bb, n);
+}
+
+test_strnbytecmp ("ignore_all", "ign", 3, 0);
+test_strnbytecmp ("ign", "ignore_all", 3, 0);
+
+static define test_strcmp (a, b, ans)
+{
+ variable ans1 = sign(strcmp (a, b));
+ if (ans1 != ans)
+ failed ("strcmp (%s,%s)", a, b);
+ variable aa, bb;
+
+ aa = a,a,a, bb = b;
+ ans1 = sign(strcmp (aa, bb));
+ if ((length (ans1) != length (aa))
+ || not all (ans1 == ans))
+ failed ("%S = strcmp (%S, %S)", ans1, aa, bb);
+
+ aa = a, bb = b,b;
+ ans1 = sign(strcmp (aa, bb));
+ if ((length (ans1) != length (bb))
+ || not all (ans1 == ans))
+ failed ("%S = strcmp (%S, %S)", ans1, aa, bb);
+
+ aa = a,a,a,a, bb = b,b,b,b;
+ ans1 = sign(strcmp (aa, bb));
+ if ((length (ans1) != length (aa))
+ || not all (ans1 == ans))
+ failed ("%S = strcmp (%S, %S)", ans1, aa, bb);
+}
+
+test_strcmp ("ignore_all", "ign", 1);
+test_strcmp ("ign", "ignore_all", -1);
+test_strcmp ("silly", "silly", 0);
+
+private define test_strchop (s, d, len, nth, nth_val)
+{
+ variable a = strchop (s, d, 0);
+ if (length (a) != len)
+ failed ("strchop (%S,%S,0) ==> %S", s,d,a);
+
+ if (anth != nth_val)
+ failed ("strchop (%S,%S,0)%d ==> %S, not %S", s,d,nth,anth,nth_val);
+
+ variable b = strchopr (s, d, 0);
+ ifnot (_eqs (b-1::-1, a))
+ failed ("strchopr (%S,%S,0)", s,d);
+}
+test_strchop ("{{{\r}}}\r\rX", '\r', 4, 0, "{{{");
+test_strchop ("{{{\r}}}\r\rX", '\r', 4, 1, "}}}");
+test_strchop ("{{{\r}}}\r\rX", '\r', 4, 2, "");
+test_strchop ("{{{\r}}}\r\rX", '\r', 4, 3, "X");
+
+test_strchop ("\r{{{\r}}}\r\rX", '\r', 5, 0, "");
+test_strchop ("\r{{{\r}}}\r\rX", '\r', 5, 1, "{{{");
+test_strchop ("", '\r', 1, 0, "");
+test_strchop ("\r", '\r', 2, 0, "");
+test_strchop ("\r", '\r', 2, 1, "");
+
+static define test_substr (fun, s, n, len, ret)
+{
+ variable ret1 = (@fun) (s, n, len);
+ if (ret1 != ret)
+ failed ("$fun($s,$n,$len)==>$ret1 not $ret"$);
+}
+test_substr (&substr, "To be or not to be", 7, 5, "or no");
+test_substr (&substr, "", 1, -1, "");
+test_substr (&substr, "A", 1, -1, "A");
+test_substr (&substr, "A", 1, 0, "");
+test_substr (&substr, "A", 2, 1, "");
+
+test_substr (&substrbytes, "To be or not to be", 7, 5, "or no");
+test_substr (&substrbytes, "", 1, -1, "");
+test_substr (&substrbytes, "A", 1, -1, "A");
+test_substr (&substrbytes, "A", 1, 0, "");
+test_substr (&substrbytes, "A", 2, 1, "");
+
+static define test_strsub (fun, s, pos, ch, ret)
+{
+ variable ret1 = (@fun)(s, pos, ch);
+ if (ret1 != ret)
+ failed ("$fun($s,$pos,$ch) ==> $ret1 not $ret"$);
+}
+
+test_strsub (&strsub, "A", 1, 0, "");
+test_strsub (&strsub, "AB", 1, 'a', "aB");
+test_strsub (&strsub, "AB", 2, 0, "A");
+
+test_strsub (&strbytesub, "A", 1, 0, "");
+test_strsub (&strbytesub, "AB", 1, 'a', "aB");
+test_strsub (&strbytesub, "AB", 2, 0, "A");
+
+private define test_foreach ()
+{
+ variable X = "ab\xAA\x{BB}";
+ variable utf8_X = {'a', 'b', -0xAA, 0xBB};
+ % Note that \x{BB} varies according to the UTF-8 mode
+ variable xi;
+ foreach xi (X)
+ {
+	if (typeof (xi) != UChar_Type)
+	 failed ("foreach (String_Type) failed to produce UChar_Types");
+ }
+ foreach (X) using ("bytes")
+ {
+	xi = ();
+	if (typeof (xi) != UChar_Type)
+	 failed ("foreach (String_Type) using bytes failed to produce UChar_Types");
+ }
+
+ variable i = 0;
+ foreach xi (X) using ("chars")
+ {
+	if (_slang_utf8_ok)
+	 {
+	 if (xi != utf8_Xi)
+	 failed ("foreach (String_Type) using chars failed at i=%d", i);
+	 }
+	else if (xi != Xi)
+	 failed ("foreach (String_Type) using chars failed at i=%d", i);
+	i++;
+ }
+}
+test_foreach ();
+
+define test_char (c, s)
+{
+ variable cs = char (c);
+ variable ss = sprintf ("%b", -c);
+ if (s != cs)
+ failed ("char(%d) ==> %s, not %s as expected", c, cs, s);
+
+ if (s != ss)
+ failed ("sprintf using %%b with %d ==> %s, not %s as expected",
+	 -c, cs, s);
+}
+test_char (-0x78, "\x78");
+test_char (-0xAB, "\xAB");
+
+#ifexists Double_Type
+foreach $1 (0,1,2,5,10,20,50,100,200,500,1000,2000,5000)
+{
+ () = sprintf ("%f", 10^$1);
+ () = sprintf ("%f", -10^$1);
+ () = sprintf ("%f", 10^-$1);
+ () = sprintf ("%f", -10^-$1);
+}
+#endif
+
+define test_count_occur (func, s, ch, ans)
+{
+ variable n = (@func) (s, ch);
+ if (ans != n)
+ {
+	failed ("%S failed on %s: expected %u, got %u", func, s, ans, n);
+ }
+}
+
+test_count_occur (&count_char_occurrences, "", 'A', 0);
+test_count_occur (&count_char_occurrences, "A", 'A', 1);
+test_count_occur (&count_char_occurrences, " A", 'A', 1);
+test_count_occur (&count_char_occurrences, "A ", 'A', 1);
+test_count_occur (&count_char_occurrences, "A A", 'A', 2);
+test_count_occur (&count_char_occurrences, "A A ", 'A', 2);
+
+test_count_occur (&count_byte_occurrences, "", 'A', 0);
+test_count_occur (&count_byte_occurrences, "A", 'A', 1);
+test_count_occur (&count_byte_occurrences, " A\0", 'A', 1);
+test_count_occur (&count_byte_occurrences, "A ", 'A', 1);
+test_count_occur (&count_byte_occurrences, "A \0A", 'A', 2);
+test_count_occur (&count_byte_occurrences, "A \0 A ", 'A', 2);
+
+if (_slang_utf8_ok)
+{
+ test_count_occur (&count_char_occurrences, "", 0xFF, 0);
+ test_count_occur (&count_char_occurrences, "\u{00FF}", 0xFF, 1);
+ test_count_occur (&count_char_occurrences, " \u{00FF}", 0xFF, 1);
+ test_count_occur (&count_char_occurrences, "\u{00FF} ", 0xFF, 1);
+ test_count_occur (&count_char_occurrences, "\u{00FF} \u{00FF}", 0xFF, 2);
+ test_count_occur (&count_char_occurrences, "\u{00FF} \u{00FF} ", 0xFF, 2);
+}
+
+private define test_strskipbytes (args, ans)
+{
+ variable n1 = strskipbytes (__push_list(args));
+ if (n1 != ans)
+ {
+	failed ("strskipbytes failed, expected %d, got %d", ans, n1);
+ }
+}
+
+test_strskipbytes ({"abc def", "a-z", 4}, 7);
+test_strskipbytes ({"abc def", "a-z", 4, -1}, 6);
+test_strskipbytes ({"abc def", "a-z"}, 3);
+test_strskipbytes ({"abc def", "a-z", 0}, 3);
+test_strskipbytes ({"abc def", "a-z", 1}, 3);
+test_strskipbytes ({"abc def", "a-z", 2}, 3);
+test_strskipbytes ({"abc def", "a-z", 3}, 3);
+test_strskipbytes ({"abc def", "a-z", 5}, 7);
+test_strskipbytes ({"abc def", "a-z", 6}, 7);
+test_strskipbytes ({"abc def", "a-z", 7}, 7);
+
+test_strskipbytes ({"abc def", "a-z", 0, 0}, 0);
+test_strskipbytes ({"abc def", "a-z", 0, 1}, 1);
+test_strskipbytes ({"abc def", "a-z", 0, 2}, 2);
+test_strskipbytes ({"abc def", "a-z", 0, 4}, 3);
+test_strskipbytes ({"abc def", "a-z", 0, -1}, 3);
+test_strskipbytes ({"abc def", "a-z", -3, -1}, 6);
+
+private define test_strup (a, b)
+{
+ variable c = strup (a);
+ if (b != c)
+ failed ("strup %s produced %s, expected %s", a, c, b);
+ a = a, a+a, a+a+a;
+ b = b, b+b, b+b+b;
+ c = strup (a);
+ ifnot (_eqs (b, c))
+ failed ("strup on an array");
+
+ ifnot (_eqs (String_Type0, strup(String_Type0)))
+ failed ("strup on empty array");
+}
+test_strup("", "");
+test_strup("a", "A");
+test_strup("ab", "AB");
+test_strup("abC", "ABC");
+
+private define test_strlow (a, b)
+{
+ variable c = strlow (a);
+ if (b != c)
+ failed ("strlow %s produced %s", a, c);
+ a = a, a+a, a+a+a;
+ b = b, b+b, b+b+b;
+ c = strlow (a);
+ ifnot (_eqs (b, c))
+ failed ("strlow on an array");
+ ifnot (_eqs (String_Type0, strlow(String_Type0)))
+ failed ("strlow on empty array");
+}
+test_strlow("", "");
+test_strlow("A", "a");
+test_strlow("AB", "ab");
+test_strlow("ABc", "abc");
+
+private define test_strlen (func, s, ans)
+{
+ variable ans1 = (@func)(s);
+ if (ans1 != ans)
+ failed ("%S != %S = %S (%S)", ans, ans1, func, s);
+
+ variable ss = s,s,s,s;
+ ans1 = (@func)(ss);
+ if (all (ans1 != ans))
+ failed ("%S != %S = %S (%S)", ans, ans1, func, s);
+
+ ans = Int_Type5 + ans;
+ ans1 = 0; ans-1 = 0;
+ ss = String_Type5;
+ ss0,2,3 = s;
+ ans1 = (@func)(ss);
+ if (all (ans1 != ans))
+ failed ("%S != %S = %S (%S)", ans, ans1, func, s);
+}
+test_strlen (&strlen, "foobar", 6);
+test_strlen (&strbytelen, "foobar", 6);
+test_strlen (&strcharlen, "foobar", 6);
+
+private define test_strtrim (func, in, out, white)
+{
+ variable out1;
+ variable a, b, b1;
+ if (white == NULL)
+ {
+	out1 = (@func)(in);
+	if (out != out1)
+	 failed ("%S != %S = %S(%S)", out, out1, func, in);
+	a = in, in, in;
+	b = out, out, out;
+	b1 = (@func)(a);
+	if (any(b != b1))
+	 failed ("%S != %S = %S(%S)", b, b1, func, a);
+	return;
+ }
+ out1 = (@func)(in, white);
+ if (out != out1)
+ failed ("%S != %S = %S(%S,%S)", out, out1, func, in, white);
+ a = String_Type5;
+ b = String_Type5;
+ a1,3,4 = in;
+ b1,3,4 = out;
+ b1 = (@func)(a, white);
+ if (any(b != b1))
+ failed ("%S != %S = %S(%S,%S)", b, b1, func, a, white);
+}
+
+$1 = " \t hello world\n\t";
+test_strtrim (&strtrim, $1, "hello world", NULL);
+test_strtrim (&strtrim_beg, $1, "hello world\n\t", NULL);
+test_strtrim (&strtrim_end, $1, " \t hello world", NULL);
+test_strtrim (&strtrim, $1, "hello wor", " \t\nld");
+
+#ifeval _slang_utf8_ok
+test_strtrim (&strtrim, "\u{FF}X\u{FF}Y\u{100}", "X\u{FF}Y", "\u{FF}\u{100}");
+test_strtrim (&strtrim, "\u{FF}X\u{FF}Y\u{100}", "X\u{FF}Y", "\u{FF}-\u{100}");
+test_strtrim (&strtrim, "\u{FF}X\u{FF}Y\u{100}", "\u{FF}X\u{FF}Y", "\u{100}-\u{101}");
+test_strtrim (&strtrim, "\u{FF}X\u{FF}Y\u{100}\u{101}", "X\u{FF}Y\u{100}\u{101}", "\u{FF}-\u{100}");
+test_strtrim (&strtrim, "\u{FF}X\u{FF}Y\u{100}\u{101}", "\u{FF}X\u{FF}Y\u{100}", "^\u{FF}-\u{100}");
+test_strtrim (&strtrim, "\u{FF}X\u{FF}Y\u{100}", "X\u{FF}Y", "^\\7");
+#endif
+
+private define test_strtrim_bad ()
+{
+ try
+ {
+	() = strtrim ("asasasc", "\\n"); % --> \ + n is invalid character class
+	failed ("%s", "Expected strtrim to choke on invalid char class");
+ }
+ catch InvalidParmError;
+}
+test_strtrim_bad ();
+
+private define test_string_to_wchars (str, ans)
+{
+ ifnot (_eqs (ans, string_to_wchars (str)))
+ {
+	failed ("string_to_wchars (%S)", str);
+ }
+
+ ifnot (_eqs (str, wchars_to_string (ans)))
+ {
+	failed ("wchars_to_string: expected to produce %S", str);
+ }
+
+ ans = random_integer(1024), random_integer(1024)-255, random_integer(1024),
+	 random_integer(1024), random_integer(1024), random_integer(1024)-255;
+ answhere(-127 <= ans <= 0) += 512;
+ str = wchars_to_string (ans);
+ variable ans1 = string_to_wchars(str);
+ if (_eqs (ans, ans1))
+ return;
+
+ variable msg = "";
+ if (length(ans) == length(ans1))
+ {
+	msg = "\n";
+	_for (0, length(ans)-1, 1)
+	 {
+	 variable i = ();
+	 msg = sprintf ("%s%d: in=%d, out=%d\n", msg, i, ansi, ans1i);
+	 }
+ }
+ failed ("string_to_wchars <-> wchars_to_string: %S -> %S -> %S%S", ans, str, ans1, msg);
+}
+
+
+test_string_to_wchars ("", Int_Type0);
+test_string_to_wchars ("a", 'a');
+test_string_to_wchars ("\xEE", -0xEE);
+test_string_to_wchars ("\u{1234}", 0x1234);
+test_string_to_wchars ("a\xEE", 'a', -0xEE);
+test_string_to_wchars ("\xEEa", -0xEE, 'a');
+test_string_to_wchars ("\xEE\u{1234}", -0xEE, 0x1234);
+test_string_to_wchars ("\u{1234}\xEE", 0x1234, -0xEE);
+test_string_to_wchars ("\u{1234}\xEEa", 0x1234, -0xEE, 'a');
+test_string_to_wchars ("b\u{1234}\xEEa", 'b', 0x1234, -0xEE, 'a');
+test_string_to_wchars ("b\u{1234}\u{EE}\xEEa", 'b', 0x1234, 0xEE, -0xEE, 'a');
+
+private define _string_to_array (str)
+{
+ variable n = strcharlen (str);
+ variable a = ULong_Typen;
+ variable p = 0;
+ _for (0, n-1, 1)
+ {
+	variable i = ();
+	variable wch;
+	(p, ai) = strskipchar (str, p, 0);
+ }
+ return a;
+}
+
+private define string_to_array_b (str)
+{
+ variable n = strcharlen (str);
+ variable a = ULong_Typen;
+ variable p = strbytelen (str);
+ _for (n-1, 0, -1)
+ {
+	variable i = ();
+	variable wch;
+	(p, ai) = strbskipchar (str, p, 0);
+ }
+ return a;
+}
+
+private define test_wchar_funcs ()
+{
+ variable str = "123";%ABCdef";
+ variable i;
+ _for i (225, 260, -1)
+ str = strcat (str, char(i), char(10*i));
+
+ variable astr = string_to_array_b (str);
+ variable lstr = _string_to_array (strlow (str));
+ variable ustr = _string_to_array (strup (str));
+ _for i (0, strcharlen(str)-1, 1)
+ {
+	variable wch = astri;
+	if ((isupper (wch))
+	 && (wch != ustri))
+	 failed ("isupper");
+
+	if (islower (wch)
+	 && (wch != lstri))
+	 failed ("islower");
+	if (tolower (wch) != lstri)
+	 failed ("tolower");
+	if (toupper (wch) != ustri)
+	 failed ("toupper");
+ }
+ variable s = char (32), d = '1', p = ',';
+
+ if ((0 == isspace(s)) || isspace (d)) failed ("ispace");
+ if ((0 == isblank(s)) || isblank (d)) failed ("isblank");
+ if ((0 == ispunct (p)) || ispunct (d)) failed ("ispunct");
+ if ((0 == iscntrl (1)) || iscntrl (' ')) failed ("iscntrl");
+ if ((0 == isxdigit (d)) || isxdigit ('g')) failed ("isxdigit");
+ if ((0 == isgraph ("x")) || isgraph (' ')) failed ("isgraph");
+ if ((0 == isprint (' ')) || isprint (1)) failed ("isprint");
+ if ((0 == isascii (' ')) || isascii (255)) failed ("isascii");
+ if ((0 == isalpha ('a')) || isalpha ('6')) failed ("isalpha");
+ if ((0 == isalnum ('6')) || isalnum ('/')) failed ("isalnum");
+}
+test_wchar_funcs ();
+
+if (any (typecast ("foo", "", NULL, "bar", Int_Type) != 'f',0,0,'b'))
+ failed ("typecast of string to integer");
+
+private define test_string_sort ()
+{
+ variable a = "1", "2", "3", "33", "22", "11";
+ variable i = array_sort (a);
+ if (any (i != 0,5,1,4,2,3))
+ failed ("string sort");
+}
+test_string_sort ();
+
+#ifexists Double_Type
+private define test_get_set_float_format (fmt, x)
+{
+ variable dfmt = get_float_format ();
+
+ set_float_format (fmt);
+ if (string (x) != sprintf (fmt, x))
+ failed ("set_float_format %S", fmt);
+ set_float_format (dfmt);
+}
+test_get_set_float_format ("%e", PI);
+test_get_set_float_format ("%f", PI);
+test_get_set_float_format ("%g", PI);
+test_get_set_float_format ("%+ f", PI);
+test_get_set_float_format ("%+f", PI);
+test_get_set_float_format ("%+.5f", PI);
+test_get_set_float_format ("%+3.5f", PI);
+test_get_set_float_format ("% 3.5f", PI);
+
+#endif
+
+private define test_sprintf (fmt, x, ans)
+{
+ foreach (Char_Type, UChar_Type, Short_Type, UShort_Type,
+	 Int_Type, UInt_Type, Long_Type, ULong_Type,
+#ifexists LLong_Type
+	 LLong_Type, ULLong_Type
+#endif
+	 )
+ {
+	variable t = ();
+	if (ans != sprintf (fmt, typecast (x, t)))
+	 failed ("%S != sprintf (%S, (%S)%x)", ans, fmt, t);
+ }
+}
+test_sprintf ("%B", 7, "111");
+test_sprintf ("%5B", 7, " 111");
+test_sprintf ("%5.5B", 7, "00111");
+test_sprintf ("%.7B", 7, "0000111");
+test_sprintf ("%8.7B", 7, " 0000111");
+
+% Reuse function name
+private define test_sprintf ()
+{
+ variable c = typecast (-55, Char_Type);
+ variable u = typecast (-55, UChar_Type);
+ variable cs = sprintf ("%c", c);
+ variable us = sprintf ("%c", u);
+
+ if (us != cs)
+ failed ("sprintf %%c with signed and unsigned char");
+}
+test_sprintf ();
+
+print ("Ok\n");
+exit (0);

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/struct.sl Added

@@ -0,0 +1,815 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("structures");
+
+variable S = struct
+{
+ a, b, c,
+};
+
+S.a = "a";
+S.b = "b";
+S.c = "c";
+
+variable U = @Struct_Type ("a", "b", "c");
+variable abc = get_struct_field_names (U);
+if ((abc0 != "a")
+ or (abc1 != "b")
+ or (abc2 != "c"))
+ failed ("@Struct_Type");
+
+abc = "a", "b", "c";
+U = @Struct_Type (abc);
+if (length (where (abc != get_struct_field_names (U))))
+ failed ("@Struct_Type(abc)");
+
+variable T = @S;
+
+if (S.a != T.a) failed ("Unable to copy via @S");
+if (S.b != T.b) failed ("Unable to copy via @S");
+if (S.c != T.c) failed ("Unable to copy via @S");
+
+if (_eqs (S, T) == 0)
+ failed ("_eqs(S,T) 1");
+
+T.a = "XXX";
+if (T.a == S.a) failed ("Unable to copy via @S");
+
+if (_eqs (S, T))
+ failed ("_eqs(S,T) 2");
+
+set_struct_fields (T, 1, 2, "three");
+if ((T.c != "three") or (T.a != 1) or (T.b != 2))
+ failed ("set_struct_fields");
+
+T.a++;
+T.a += 3;
+T.a -= 20;
+if (T.a != -15)
+ failed ("structure arithmetic");
+
+#ifexists Complex_Type
+T.a += 3+2i;			 % =-18+2i
+T.a -= 2*T.a - T.a;		 % = 0
+if (T.a != 0)
+ failed ("structure arithmetic with complex fields");
+#endif
+
+T.c = S;
+S.a = T;
+
+if (T != T.c.a)
+ failed ("Unable to create a circular list");
+
+if (0 == _eqs (T, T.c.a))
+ failed ("_eqs(T,T)");
+
+T.a = 1:10;
+S.a = 1:10;
+T.b = S.b;
+T.c = T;
+S.c = S;
+
+if (0 == _eqs (S,T))
+ failed ("_eqs(S,T) circular 1");
+T.c = S;
+S.c = T;
+if (0 == _eqs (S,T))
+ failed ("_eqs(S,T) circular 2");
+T.c = 1;
+S.c = 0;
+
+T.a = 1:10*1;
+T.a *= 2;
+ifnot (_eqs(T.a, 2*1:10))
+ failed ("T.a *= 2 for an array");
+
+typedef struct
+{
+ TT_x, TT_y
+}
+TT;
+
+T = @TT;
+S = @T;
+if (0 == _eqs (T,S))
+ failed ("_eqs(T,S) for type TT");
+
+if (typeof (T) != TT)
+ failed ("typeof(T)");
+if (0 == is_struct_type (T))
+ failed ("is_struct_type");
+S = typecast (T, Struct_Type);
+if (typeof (S) != Struct_Type)
+ failed ("typecast");
+if (T != T)
+ failed ("typedefed T != T");
+
+if (_eqs (T,S))
+ failed ("_eqs(T,S) for S and T different");
+
+T = TT3;
+private variable i = where (T == T2);
+if (length (i) != 1)
+ failed ("where on array of TT, found length=%d", length(i));
+
+% C structures
+
+S = get_c_struct ();
+if ((typeof (S.h) != Short_Type)
+ or (typeof (S.l) != Long_Type)
+ or (typeof (S.b) != Char_Type))
+ failed ("get_c_struct field types");
+
+private define print_struct(s)
+{
+ foreach (get_struct_field_names (s))
+ {
+	variable f = ();
+	vmessage ("S.%s = %S", f, get_struct_field (s, f));
+ }
+}
+
+#ifexists Complex_Type
+S.z = 1+2i;
+#endif
+S.a = 1:10;
+#ifexists Double_Type
+S.d = PI;
+#endif
+S.s = "foobar";
+S.ro_str = "FOO";
+
+loop (10)
+ set_c_struct (S);
+
+loop (10)
+ T = get_c_struct ();
+
+%print_struct (T);
+
+if ((not __is_same(S.a, T.a))
+#ifexists Complex_Type
+ or (S.z != T.z)
+#endif
+#ifexists Double_Type
+ or (S.d != T.d)
+#endif
+ or (T.ro_str != "read-only"))
+ failed ("C Struct");
+
+loop (10)
+ get_c_struct_via_ref (&T);
+
+%print_struct (T);
+
+if ((not __is_same(S.a, T.a))
+#ifexists Complex_Type
+ or (S.z != T.z)
+#endif
+#ifexists Double_Type
+ or (S.d != T.d)
+#endif
+ or (T.ro_str != "read-only"))
+ failed ("C Struct");
+
+private define count_args ()
+{
+ if (_NARGS != 0)
+ failed ("foreach using with NULL");
+}
+private define test_foreach_using_with_null (s)
+{
+ foreach (s) using ("next")
+ {
+	s = ();
+ }
+ count_args ();
+}
+test_foreach_using_with_null (NULL);
+
+private define test_foreach ()
+{
+ variable s = struct
+ {
+	val = 1,
+	next = struct
+	 {
+	 val = 2,
+	 next = struct
+	 {
+		 val = 3,
+		 next = NULL
+	 }
+	 }
+ };
+ variable c = 0;
+ variable ss;
+ foreach ss (s)
+ c += ss.val;
+ foreach ss (s) using ("next")
+ c += 2*ss.val;
+
+ if (c != 18)
+ {
+	failed ("foreach using implicit next");
+ }
+ try
+ {
+	foreach (s) using ("foo", "bar")
+	 ss = ();
+ }
+ catch AnyError: return;
+
+ failed ("Expected foreach with bad using clause to fail");
+}
+test_foreach ();
+
+define return_struct_fun (c)
+{
+ variable s = struct
+ {
+	X
+ };
+ variable t = struct
+ {
+	c
+ };
+ s.X = Struct_Type3;
+ s.X* = t;
+ t.c = c;
+ return s;
+}
+() = return_struct_fun (1);
+if (return_struct_fun(PI).X2.c != PI)
+ failed ("f(a).Xb.c");
+$1 = &return_struct_fun;
+if ((@$1)(PI).X2.c != PI)
+ failed ("f(a).Xb.c");
+
+% Test operator overloading
+
+typedef struct
+{
+ x, y, z
+}
+Vector_Type;
+
+private define vector (a, b, c)
+{
+ variable v = @Vector_Type;
+ v.x = a;
+ v.y = b;
+ v.z = c;
+ return v;
+}
+
+private define vector_sqr (v)
+{
+ return v.x^2 + v.y^2 + v.z^2;
+}
+private define vector_abs (v)
+{
+ return sqrt (vector_sqr (v));
+}
+private define vector_chs (v)
+{
+ v = @v;
+ v.x = -v.x;
+ v.y = -v.y;
+ v.z = -v.z;
+ return v;
+}
+
+private variable Num_Destroyed = 0;
+private define destroy_vector (v)
+{
+ Num_Destroyed++;
+}
+
+__add_unary ("-", Vector_Type, &vector_chs, Vector_Type);
+__add_unary ("abs", Double_Type, &vector_abs, Vector_Type);
+__add_unary ("sqr", Double_Type, &vector_sqr, Vector_Type);
+__add_destroy (Vector_Type, &destroy_vector);
+
+private define vector_plus (v1, v2)
+{
+ variable v = @Vector_Type;
+ v.x = v1.x + v2.x;
+ v.y = v1.y + v2.y;
+ v.z = v1.z + v2.z;
+ return v;
+}
+__add_binary ("+", Vector_Type, &vector_plus, Vector_Type, Vector_Type);
+
+private define vector_minus (v1, v2)
+{
+ variable v = @Vector_Type;
+ v.x = v1.x - v2.x;
+ v.y = v1.y - v2.y;
+ v.z = v1.z - v2.z;
+ return v;
+}
+__add_binary ("-", Vector_Type, &vector_minus, Vector_Type, Vector_Type);
+
+private define scalar_vector_mul (a, u)
+{
+ variable v = @Vector_Type;
+ v.x = a*u.x;
+ v.y = a*u.y;
+ v.z = a*u.z;
+ return v;
+}
+__add_binary ("*", Vector_Type, &scalar_vector_mul, Any_Type, Vector_Type);
+
+private define dotprod (u, v)
+{
+ return u.x*v.x + u.y*v.y + u.z*v.z;
+}
+__add_binary ("*", Double_Type, &dotprod, Vector_Type, Vector_Type);
+
+private define vector_scalar_mul (v, a)
+{
+ return scalar_vector_mul (a,v);
+}
+__add_binary ("*", Vector_Type, &vector_scalar_mul, Vector_Type, Any_Type);
+
+private define vector_eqs (a,b)
+{
+ return ((a.x == b.x)
+	 and (a.y == b.y)
+	 and (a.z == b.z));
+}
+__add_binary ("==", Char_Type, &vector_eqs, Vector_Type, Vector_Type);
+
+private define vector_neqs (a,b)
+{
+ return not vector_eqs (a, b);
+}
+__add_binary ("!=", Char_Type, &vector_neqs, Vector_Type, Vector_Type);
+
+private define vector_string (a)
+{
+ if (_NARGS != 1)
+ failed ("__add_string: _NARGS!=1");
+ sprintf ("%S,%S,%S", a.x, a.y, a.z);
+}
+__add_string (Vector_Type, &vector_string);
+
+private define vector_aget (i, v)
+{
+ return vector (v.xi, v.yi, v.zi);
+}
+__add_aget (Vector_Type, &vector_aget);
+
+private define vector_aput (i, v)
+{
+ variable u = ();
+ v.xi = u.x;
+ v.yi = u.y;
+ v.zi = u.z;
+}
+__add_aput (Vector_Type, &vector_aput);
+
+typedef struct
+{
+ ax, ay, az,
+}
+Matrix33_Type;
+
+private define matrix33 (ax, ay, az)
+{
+ variable m = @Matrix33_Type;
+ m.ax = vector (ax0, ax1, ax2);
+ m.ay = vector (ay0, ay1, ay2);
+ m.az = vector (az0, az1, az2);
+ return m;
+}
+private define matrix_vector_mul (m, v)
+{
+ return vector (m.ax*v, m.ay*v, m.az*v);
+}
+__add_binary ("*", Vector_Type, &matrix_vector_mul, Matrix33_Type, Vector_Type);
+
+private define test_matrix_vector_mul ()
+{
+ variable v = vector (1, 2, 3);
+ variable m = matrix33 (4, 5, 6, 7, 8, 9, 1,2,3);
+ variable mv = m*v;
+ if (typeof (mv) != Vector_Type)
+ failed ("typeof Matrix33_Type*Vector_Type");
+ if ((mv.x != (4*1+5*2+6*3))
+ || (mv.y != (7*1+8*2+9*3))
+ || (mv.z != (1*1+2*2+3*3)))
+ failed ("Matrix33_Type*Vector_Type");
+}
+test_matrix_vector_mul ();
+
+private define test_aget_aput ()
+{
+ variable v = vector (0:10, 1:11, 2:12);
+ variable u = v3;
+ if ((u.x != 3) || (u.y != 4) || (u.z != 5))
+ failed ("vector aget");
+
+ v4 = u + vector(1,1,1);
+ u = v4;
+ if ((u.x != 4) || (u.y != 5) || (u.z != 6))
+ failed ("vector aput");
+}
+test_aget_aput ();
+
+private define test_destroy ()
+{
+ Num_Destroyed = 0;
+ variable v1 = vector(1,2,3), v2 = vector (3, 4, 5);
+ try
+ {
+	() = @Vector_Type + "foo";
+ }
+ catch AnyError;
+ if (Num_Destroyed != 1)
+ failed ("Expected Num_Destroyed = 1, found %S", Num_Destroyed);
+ Num_Destroyed = 0;
+
+ variable v3 = v1 + v2;
+ if (Num_Destroyed)
+ failed ("unexpected destroy method called");
+ v3 = 0;
+ v2 = v1;
+ if (Num_Destroyed != 2)
+ failed ("expected destroy method to be called 2 times");
+ v2 = 0;
+ if (Num_Destroyed != 2)
+ failed ("expected destroy method to be called 2 times");
+ v1 = 0;
+ if (Num_Destroyed != 3)
+ failed ("expected destroy method to be called 3 times");
+
+ __add_destroy (Vector_Type, &destroy_vector);
+ __add_destroy (Vector_Type, &destroy_vector);
+ __add_destroy (Vector_Type, &destroy_vector);
+ __add_destroy (Vector_Type, &destroy_vector);
+}
+test_destroy ();
+
+private variable X = vector (1,2,3);
+
+if (not vector_eqs (-X, vector_chs (X)))
+ failed ("Vector chs(X)");
+
+if (sqr(X) != vector_sqr(X))
+ failed ("Vector sqr(X)");
+
+if (abs(X) != vector_abs(X))
+ failed ("Vector abs(X)");
+
+if (vector_string (X) != string (X))
+ failed ("Vector string(X)");
+
+private define vector_to_list (v)
+{
+ return {v.x, v.y, v.z};
+}
+private define is_vector_eq_to_list (v, l)
+{
+ return ((length (l) == 3)
+	 && (l0 == v.x) && (l1 == v.y) && (l2 == v.z));
+}
+__add_typecast (Vector_Type, List_Type, &vector_to_list);
+
+private define vector_to_complex (v)
+{
+ return v.x + 1j*v.y;
+}
+private define is_vector_eq_to_complex (v, z)
+{
+ return (vector_to_complex (v) == z);
+}
+__add_typecast (Vector_Type, Complex_Type, &vector_to_complex);
+
+private define vector_to_stdout (v)
+{
+ return stdout;
+}
+private define is_vector_eq_to_stdout (v, s)
+{
+ return ((vector_to_stdout(v) == s)
+	 && (fileno (s) == fileno (v)));
+}
+__add_typecast (Vector_Type, File_Type, &vector_to_stdout);
+
+private define vector_to_string (v)
+{
+ return sprintf ("%S e_x + %S e_y + %S e_z", v.x, v.y, v.z);
+}
+private define is_vector_eq_to_string (v, z)
+{
+ return ((vector_to_string (v) == z)
+	 && (0 == strcmp (v, z)));
+}
+__add_typecast (Vector_Type, String_Type, &vector_to_string);
+
+private define test_typecast (to, eqsfun)
+{
+ variable v = vector (4,5,6);
+ variable l = typecast (v, to);
+ ifnot ((@eqsfun) (v, l))
+ failed ("simple vector not equal to %S", to);
+ v = vector(4,5,6),
+		 vector (7,8,9),
+		 vector (1i,2i,3i);
+ l = typecast (v, to);
+ _for (0, length (v)-1, 1)
+ {
+	variable i = ();
+	ifnot ((@eqsfun) (vi, li))
+	 failed ("array of vectors not equal to array of %S", to);
+ }
+}
+test_typecast (List_Type, &is_vector_eq_to_list);
+test_typecast (Complex_Type, &is_vector_eq_to_complex);
+test_typecast (File_Type, &is_vector_eq_to_stdout);
+test_typecast (String_Type, &is_vector_eq_to_string);
+
+% test binary
+private variable Y = vector (4, 5, 6);
+
+if (X == X) ; else failed ("Vector == Vector");
+if (X == Y) failed ("Vector X == Vector Y");
+if (X + vector (3,3,3) != Y) failed ("Vector +");
+if (X + 3*vector(1,1,1) != Y) failed ("Vector *");
+if (X + vector(1,1,1)*3 != Y) failed ("* Vector");
+if (Y - X != vector (3,3,3)) failed ("Vector -");
+
+if (X == NULL)
+ failed ("X is NULL??");
+
+% Now test arrays of Vector_Type
+X = Vector_Type3;
+
+X0 = vector (1,2,3);
+X1 = vector (1,2,3);
+X2 = vector (1,2,3);
+%X = Vector_Type3;
+
+%Y = vector_chs (X);
+Y = -X;
+
+if (not vector_eqs (Y0, vector_chs (X0)))
+ failed ("Vector chs(X)");
+
+Y = sqr(X);
+if (Y1 != vector_sqr(X1))
+ failed ("Vector sqr(X)");
+
+Y = abs (X);
+if (Y2 != vector_abs(X2))
+ failed ("Vector abs(X)");
+
+Y = 2*X;
+if (Y2 != 2*X2)
+ failed ("Vector 2*X");
+
+Y = X + 2*X;
+if (Y2 != 3*X2)
+ failed ("Vector 3*X");
+
+Y = (X == X);
+if (length (where (Y != 1)))
+ failed ("X == X");
+
+private define test_duplicate_fields (fields, isok)
+{
+ try
+ {
+	() = eval ("struct {$fields}"$);
+	if (0 == isok)
+	 failed ("Created a struct with duplicate fields");
+ }
+ catch DuplicateDefinitionError;
+ catch AnyError:
+ {
+	failed ("Unexpected error when creating a struct with duplicate fields %s", fields);
+ }
+}
+test_duplicate_fields ("a", 1);
+test_duplicate_fields ("a, a", 0);
+test_duplicate_fields ("a, b, c", 1);
+test_duplicate_fields ("a, b, a", 0);
+test_duplicate_fields ("a, a, b", 0);
+test_duplicate_fields ("a, b, c, b, e", 0);
+test_duplicate_fields ("a, b, c, b, e, a", 0);
+test_duplicate_fields ("a, b, c, d, e, e", 0);
+
+private define test_struct_with_assign (exprs)
+{
+ variable i, n = length (exprs);
+ variable fields = array_map (String_Type, &sprintf, ("field%d", 1:n));
+
+ variable s0 = @Struct_Type(fields);
+ variable s1_expr = "struct {\n";
+ _for i (0, n-1, 1)
+ {
+	variable expr = exprsi;
+	variable field = fieldsi;
+
+	if (expr != NULL)
+	 {
+	 s1_expr = strcat (s1_expr, field, "= ", expr, ",\n");
+	 set_struct_field (s0, field, eval(expr));
+	 continue;
+	 }
+
+	s1_expr = strcat (s1_expr, field, ",\n");
+ }
+ s1_expr = strcat (s1_expr, "};");
+
+ variable s1 = eval (s1_expr);
+ if (not _eqs (s0, s1))
+ failed ("structures are not equal: %s", s1_expr);
+}
+
+test_struct_with_assign (NULL);
+test_struct_with_assign (NULL, "3");
+#ifexists Double_Type
+test_struct_with_assign ("3*sin(2)", NULL);
+#endif
+test_struct_with_assign ("13", "1:10");
+test_struct_with_assign ("-2", NULL, "1:10");
+test_struct_with_assign ("-10", "1:10", "NULL");
+test_struct_with_assign ("&strcat", "1:10", "NULL", NULL);
+test_struct_with_assign ("struct{a,b}");
+test_struct_with_assign ("struct{a,b}", NULL);
+#ifexists Complex_Type
+test_struct_with_assign ("1+2j", NULL);
+#endif
+test_struct_with_assign ("\"string\"");
+
+define test_struct_refs ()
+{
+ variable s = struct {foo, bar};
+ variable f = &s.bar;
+ @f = 7;
+ if (s.bar != 7)
+ failed ("ref to s.bar via f");
+
+ @(&s.bar) = 3;
+ if (s.bar != 3)
+ failed ("@(&s.bar)");
+
+ @&s.bar = "foo";
+ if (s.bar != "foo")
+ failed ("@&s.bar");
+}
+test_struct_refs ();
+
+private define test_internal_struct_type ()
+{
+ variable t;
+
+ loop (5)
+ {
+	t = new_test_type ();
+	t.field1 = 7;
+	t.field2 = 3;
+	t.field1 += 4;
+	t.field1 -= t.field2;
+	if (t.field1 != 8)
+	 failed ("new_test_type");
+ }
+}
+test_internal_struct_type ();
+
+private define test_it (p)
+{
+ loop (5)
+ {
+	variable userdata = struct{items};
+
+	p.any = @userdata;
+	p.any.items = {};
+
+	p.any = @userdata;
+	variable x = @userdata;
+	p.any = x;
+	x.items = {};
+ }
+}
+test_it (new_test_type ());
+
+define test_struct_merge ()
+{
+ variable s = struct
+ {
+	x = 3,
+	@ @Vector_Type,
+	t = 1,
+ };
+ if (s.x != NULL)
+ failed ("struct merge: x is non-NULL");
+
+ s = struct
+ {
+	@ vector(1,2,3)+vector(4,5,6),
+	x = -1, y = -2,
+ };
+ if ((s.z != 9) || (s.x != -1) || (s.y != -2))
+ failed ("struct merge: vector+vector");
+}
+test_struct_merge ();
+
+private define test_push_struct_fields ()
+{
+ variable field, fields = "foo", "bar", "baz";
+ variable v0 = {"20", "30", "40"}, v1, v2;
+
+ variable s = @Struct_Type(fields);
+ set_struct_fields (s, __push_list (v0));
+
+ variable i, n;
+
+ % usage form 1
+ n = _push_struct_field_values(s);
+ if (n != length (fields))
+ failed ("Expected _push_struct_field_values to return %d, got %d", length(fields), n);
+
+ _for i (0, n-1, 1)
+ {
+	v1 = ();
+	v2 = get_struct_field (s, fieldsi);
+	if (v1 != v2)
+	 failed ("Expecting _push_struct_field_values to push %S at i=%d, found %S", v2, i, v1);
+ }
+
+ % usage form 2
+ v1 = {_push_struct_field_values (s, fields)};
+ ifnot (_eqs (v1, v0))
+ failed ("_push_struct_field_values usage form 2 produced incorrect result");
+
+ v2 = { _push_struct_field_values (s, String_Type0) };
+ if (length (v2) != 0)
+ failed ("Expected _push_struct_field_values to return nothing for an empty array");
+
+ if (NULL != _push_struct_field_values (s, "b i z a r r e"))
+ failed ("_push_struct_field_values failed to return NULL for non-existent field");
+}
+
+test_push_struct_fields ();
+
+% Intrinsic structure
+private define test_intrinsic_structure ()
+{
+ variable s = Intrinsic_Struct;
+ if (s.name != "My_Struct")
+ failed ("Intrinsic_Struct name: %S", s.name);
+
+ try
+ {
+	s.name = "foo";
+	failed ("Intrinsic_Struct.name should be read-only");
+ }
+ catch ReadOnlyError;
+ s.i = 37;
+ s.s = "foobar";
+ s.d = PI;
+ if ((s.i != 37) || (s.s != "foobar") || (s.d != PI))
+ failed ("Intrinsic_Struct field read/write error");
+}
+test_intrinsic_structure();
+
+private define test_struct_with_reserved_fields ()
+{
+ variable s = struct
+ {
+	public = "*public*",
+	define = "*define*",
+	not = "*not*",
+	xor = "*xor*",
+	then = "*then*",
+	else = "*else*",
+	struct = "*struct*",
+ };
+
+ variable name, names = get_struct_field_names (s);
+ foreach name (names)
+ {
+	variable v = get_struct_field (s, name);
+	if (v != "*$name*"$)
+	 failed ("struct with reserved name %S", name);
+ }
+ s.struct = struct
+ {
+	struct = "<struct>",
+ };
+ if (s.struct.struct != "<struct>")
+ failed ("s.struct with struct failure");
+ s.struct.struct = "foo";
+ if (s.struct.struct != "foo")
+ failed ("s.struct as LVALUE");
+}
+test_struct_with_reserved_fields ();
+
+print ("Ok\n");
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/syntax.sl Added

@@ -0,0 +1,459 @@
+() = evalfile ("inc.sl");
+testing_feature ("syntax");
+
+private define check_version_string ()
+{
+   variable vers = _slang_version_string;
+   if (0 == strncmp (vers, "pre", 3))
+     vers = vers3:;
+   if (isalpha(vers-1)) vers = vers:-2;   %  knock off patch-level
+
+   variable v = strtok (vers, "-.");
+   variable major = integer(v0);
+   variable minor = integer(v1);
+   variable micro = integer(v2);
+
+   v = ((major*100)+minor)*100 + micro;
+   if (v != _slang_version)
+     failed ("slang version %S does not match %S", _slang_version, _slang_version_string);
+}
+check_version_string ();
+
+pop(1);  % This tests pop as a special keyword
+
+#ifexists test_char_return	       %  defined by the sltest script
+private define test_type_return (func, type, x)
+{
+   variable skip_float = __is_datatype_numeric (type) == 1;
+   foreach (Util_Arith_Types)
+     {
+	variable t = ();
+
+	if ((__is_datatype_numeric(t) == 2) && skip_float)
+	  continue;		       %  cannot pass floats to int functs
+
+	variable y = (@func)(typecast (x, t));
+	if ((y != x) || (typeof(y) != type))
+	  failed ("%S failed", func);
+     }
+}
+test_type_return (&test_char_return, Char_Type, 0x12);
+test_type_return (&test_short_return, Short_Type, 0x12);
+test_type_return (&test_int_return, Int_Type, 0x12);
+test_type_return (&test_long_return, Long_Type, 0x12);
+test_type_return (&test_uchar_return, UChar_Type, 0x12);
+test_type_return (&test_ushort_return, UShort_Type, 0x12);
+test_type_return (&test_uint_return, UInt_Type, 0x12);
+test_type_return (&test_ulong_return, ULong_Type, 0x12);
+
+# ifexists Double_Type
+%test_type_return (&test_float_return, Float_Type, 1.2f);
+test_type_return (&test_double_return, Double_Type, 12.0);
+# endif
+#endif
+
+static define static_xxx ()
+{
+   return "xxx";
+}
+
+private define private_yyy ()
+{
+   return "yyy";
+}
+
+public define public_zzz ()
+{
+   return "zzz";
+}
+
+if (is_defined ("static_xxx") or "xxx" != static_xxx ())
+  failed ("static_xxx");
+if (is_defined ("private_yyy") or "yyy" != private_yyy ())
+  failed ("private_yyy");
+if (not is_defined ("public_zzz") or "zzz" != public_zzz ())
+  failed ("public_xxx");
+
+variable XXX = 1;
+static define xxx ()
+{
+   variable XXX = 2;
+   if (XXX != 2) failed ("local variable XXX");
+}
+
+xxx ();
+if (XXX != 1) failed ("global variable XXX");
+if (1)
+{
+   if (orelse
+	{0}
+	{0}
+	{0}
+	{0}
+       )
+     failed ("orelse");
+}
+
+!if (orelse
+     {0}
+     {0}
+     {0}
+     {1}) failed ("not orelse");
+
+_auto_declare = 1;
+XXX_auto_declared = 1;
+
+if (&XXX_auto_declared != __get_reference ("XXX_auto_declared"))
+  failed ("__get_reference");
+
+if (&XXX_auto_declared != __get_reference (string(&XXX_auto_declared)))
+  failed ("__get_reference via string form");
+
+if (0 == __is_initialized (&XXX_auto_declared))
+  failed ("__is_initialized");
+() = __tmp (XXX_auto_declared);
+if (__is_initialized (&XXX_auto_declared))
+  failed ("__is_initialized __tmp");
+XXX_auto_declared = "xxx";
+__uninitialize (&XXX_auto_declared);
+if (__is_initialized (&XXX_auto_declared))
+  failed ("__is_initialized __uninitialize");
+
+static define test_uninitialize ()
+{
+   variable x;
+   if (__is_initialized (&x))
+     failed ("__is_initialized x");
+   x = 3;
+   !if (__is_initialized (&x))
+     failed ("__is_initialized x=3");
+   if (3 != __tmp (x))
+     failed ("__tmp return value");
+   if (__is_initialized (&x))
+     failed ("__tmp x");
+   x = 4;
+   __uninitialize (&x);
+   if (__is_initialized (&x))
+     failed ("__uninitialize x");
+}
+
+test_uninitialize ();
+
+static define check_args (n)
+{
+   if (n + 1 != _NARGS)
+     failed ("check_args %d", n);
+   _pop_n (_NARGS-1);
+}
+
+static define nitems (n)
+{
+   loop (n) 1;
+}
+
+static define check_iscallable (x, y)
+{
+   if (y != __is_callable (x))
+     failed ("__is_callable %S", x);
+}
+
+check_iscallable (1, 0);
+check_iscallable (&_NARGS, 0);
+check_iscallable (&check_iscallable, 1);
+check_iscallable (&sin, 1);
+check_iscallable (NULL, 0);
+
+static define check_isnumeric (x, y)
+{
+   if (y != __is_numeric (x))
+     failed ("__is_numeric %S", x);
+}
+
+check_isnumeric ("foo", 0);
+check_isnumeric ("0", 0);
+check_isnumeric (0, 1);
+check_isnumeric (PI, 2);
+#ifexists Complex_Type
+check_isnumeric (2i, 3);
+#endif
+check_args (1, 1);
+check_args (1,2,2);
+check_args (nitems(3), nitems(5), 8);
+static variable X = 1:10;
+check_args (nitems (3), check_args(nitems(4), 4, 5), 3);
+
+static define check_no_args ()
+{
+   if (_NARGS != 0)
+     failed ("check_no_args");
+}
+
+% This failed in previous versions because abs was not treated as a function
+% call.
+if (abs (1) > 0)
+  check_no_args ();
+
+define check_tmp_optim ()
+{
+   variable a = 1:10:1.0;
+   variable b = a*0.0;
+   if ((a0 != 1.0) or (__is_same(a,b)))
+     failed ("__tmp optimization: a0 = %f", a0);
+}
+
+check_tmp_optim ();
+
+define check_for ()
+{
+   variable i;
+
+   variable s = 0;
+   _for (0, 10, 1)
+     {
+	i = ();
+	s += i;
+     }
+   variable s1 = 0;
+
+   _for i (0, 10, 1)
+     s1 += i;
+
+   if ((s1 != s) or (s != 55))
+     failed ("_for: s1=%S, s=%S", s1, s);
+
+   i = 0;
+   for (;;i++)
+     {
+	if (i == 5) break;
+     }
+   if (i != 5)
+     failed ("The for statement without a conditional failed");
+}
+
+check_for ();
+
+define check_foreach ()
+{
+   variable i;
+
+   variable s = 0;
+   foreach (0:10)
+     {
+	i = ();
+	s += i;
+     }
+
+   variable s1 = 0;
+   foreach i (0:10)
+     s1 += i;
+
+   if ((s1 != s) or (s != 55))
+     failed ("foreach");
+}
+check_foreach ();
+
+$1 = 0;
+static define check_NULL_args ()
+{
+   if (_NARGS != $1)
+     failed ("check_NULL_args: _NARGS=%d != %d", _NARGS, $1);
+}
+$1 = 0; check_NULL_args ();
+$1 = 2; check_NULL_args (,);
+$1 = 3; check_NULL_args (,,);
+$1 = 3; check_NULL_args (1,,);
+$1 = 3; check_NULL_args (1,2,);
+$1 = 3; check_NULL_args (1,,3);
+$1 = 4; check_NULL_args (1,,3,);
+
+static define test_strings (a, b)
+{
+   if (a != b)
+     failed ("test_strings: %S != %S");
+}
+
+test_strings ("\\", "\x5C");
+test_strings ("\\"Q, "\x5C");
+test_strings ("\x5C"R, "\\x5C"Q);
+test_strings ("\\"Q, "\x5C"Q);
+%test_strings ("\"R, "\\");   % "%);
+
+static define test_optimized ()
+{
+   variable x=10,y,z;
+   (x,y,z) = (x*x,2*x+1,x+1);
+   if (x != 100)
+     failed ("test_optimized: x");
+   if (y != 21)
+     failed ("test_optimized: y");
+   if (z != 11)
+     failed ("test_optimized: z");
+}
+test_optimized ();
+
+private define test (expr)
+{
+   if (eval (expr))
+     failed (expr);
+}
+test ("-1 != 0-1");
+test ("-1h != 0h-1h");
+test ("-1L != 0L-1L");
+#ifexists Double_Type
+test ("-11^2 != -121");
+test ("-2.0^2 != -4");
+#endif
+
+#ifexists test_pop_mmt
+try
+{
+   () = test_pop_mmt (1.0);
+}
+catch ApplicationError;
+
+() = test_pop_mmt (stdin);
+#endif
+
+define test_ternary ()
+{
+   variable arg, ans;
+   foreach arg ('A', 'B', 'C', 'D', 'Z')
+     {
+	ans =
+	  arg == 'A' ? "A" :
+	  arg == 'B' ? "B" :
+	  arg == 'C' ? "C" :
+	  arg == 'D' ? "D" :
+	  "Z";
+
+	if (ans0 != arg)
+	  failed ("ternary expression");
+     }
+   foreach arg ('A', 'B', 'C', 'D', 'Z')
+     {
+	ans =
+	  arg == 'A' - 1 + 1 ? "A" :
+	  arg == 'B' - 1 + 1 ? "B" :
+	  arg == 'C' - 1 + 1 ? "C" :
+	  arg == 'D' - 1 + 1 ? "D" :
+	  "Z";
+
+	if (ans0 != arg)
+	  failed ("ternary expression involving binary ops");
+     }
+   foreach arg ('A', 'B', 'C', 'D', 'Z')
+     {
+	ans =
+	  arg == char('A')0 - 1 + 1 ? "A" :
+	  arg == char('B')0 - 1 + 1 ? "B" :
+	  arg == char('C')0 - 1 + 1 ? "C" :
+	  arg == char('D')0 - 1 + 1 ? "D" :
+	  "Z";
+	if (ans0 != arg)
+	  failed ("ternary expression involving array index");
+     }
+}
+test_ternary ();
+
+private variable P = "foo";
+private define test_private_variable_ops ()
+{
+   % This test is for valgrind
+   loop (5)
+     {
+	variable x;
+	foreach x ({2, 1,2,3, "foobar"})
+	  {
+	     x = x;
+	     P = x;
+	     P += x;
+	     P += (x+x);
+	     P = P;
+	     P += P;
+	     P = __tmp(P);
+
+	     x = x+x;
+	     x = x;
+	     P = x;
+	     P += x;
+	     P += (x+x);
+	     P = P;
+	     P += P;
+	     P = __tmp(P);
+	  }
+     }
+}
+test_private_variable_ops ();
+
+private define test_assignment_expressions ()
+{
+   variable a = 1,2,3;
+   (a)1 = -1;
+   if ((a1 != -1) || ((a)1!=-1))
+     failed ("lvalue parse problem: (a)1=-1");
+
+   (a)1 += 10*(a)1;
+   if ((a1 != -11)||(a1!=-11))
+     failed ("lvalue parse problem: (a)1 += 10*(a)1");
+
+   (a+a)1 = -1;
+}
+test_assignment_expressions ();
+try
+{
+   () = evalfile("./longline.inc");
+}
+catch LimitExceededError;
+
+private define test_binary (astr, b)
+{
+   variable a = eval (astr);
+   if (a != b)
+     {
+	failed ("Binary string %S ==> %S != %S", astr, a, b);
+     }
+   if (b >= 0)
+     {
+	variable fmt = sprintf ("%%#.%dB", strbytelen (astr)-2);
+	variable bstr = sprintf (fmt, b);
+	if (bstr != astr)
+	  {
+	     failed ("%S != %S=sprintf(%S, %S)", astr, bstr, fmt, b);
+	  }
+     }
+}
+test_binary ("0b0", 0);
+test_binary ("0b00", 0);
+test_binary ("0b1", 1);
+test_binary ("-0b1", -1);
+test_binary ("0b01", 1);
+test_binary ("0b0001", 1);
+test_binary ("0b0011", 3);
+test_binary ("0b11", 3);
+test_binary ("0b111", 7);
+test_binary ("0b1110", 14);
+test_binary ("-0b1110", -14);
+
+$1 = -0;
+
+private define usage_func ()
+{
+   if (_NARGS != 1)
+     usage ("usage_func (x)");
+   variable x = ();
+}
+
+private define test_usage ()
+{
+   try
+     {
+	usage_func ();
+	failed ("Expected a usage error");
+     }
+   catch UsageError;
+}
+test_usage ();
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/template.sl Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/time.sl Added

@@ -0,0 +1,97 @@
+() = evalfile ("inc.sl");
+
+testing_feature ("time functions");
+
+#ifexists mktime
+static variable t = _time ();
+static variable tm = localtime (t);
+if (t != mktime (tm))
+  failed ("mktime");
+tm.tm_sec -= 1;
+if (t-1 != mktime (tm))
+  failed ("mktime 1 sec earlier");
+#endif
+
+static define test_strftime ()
+{
+   variable tm = localtime (_time ());
+   variable fmts = "%a", "%A", "%b", "%B", "%c", "%C", "%d", "%D", "%e",
+		    "%E", "%F", "%G", "%g", "%h", "%H", "%I", "%j", "%k",
+		    "%l", "%m", "%M", "%n", "%O", "%p", "%P", "%r", "%R",
+		    "%s", "%S", "%t", "%T", "%u", "%U", "%V", "%w", "%W",
+		    "%x", "%X", "%y", "%Y", "%z", "%+", "%%";
+
+   % Test only a subset, since many systems do not support all the above
+   fmts = "%a", "%A", "%b", "%B", "%c", "%d",
+	   "%H", "%I", "%j",
+	   "%m", "%M", "%p",
+	   "%S", "%U", "%w", "%W",
+	   "%x", "%X", "%y", "%Y", "%z", "%%";
+
+   variable fmt1 = strjoin (fmts, " ");
+   variable ans1 = strftime (fmt1, tm);
+   variable ans0 = strjoin (array_map (String_Type, &strftime, fmts, tm), " ");
+   if (ans0 != ans1)
+     {
+	failed ("strftime: %s != %s", ans0, ans1);
+     }
+   ans0 = strftime ("%d", tm);
+   ans1 = sprintf ("%02d", tm.tm_mday);
+   if (ans1 != ans0)
+     failed ("strftime: failed %%d format: %s != %s", ans0, ans1);
+}
+
+test_strftime ();
+
+define test_mktime ()
+{
+   loop (50)
+     {
+	variable t0 = int (urand () * 0x7FFFFFFFL);
+	variable t1, tm;
+	tm = localtime (t0);
+	if (tm != NULL)
+	  {
+	     t1 = mktime(tm);
+	     if (t0 != t1)
+	       failed ("mktime failed to produce %S, got %S instead", t0, t1);
+	  }
+#ifexists timegm
+	tm = gmtime (t0);
+	if (tm != NULL)
+	  {
+	     t1 = timegm(tm);
+	     if (t0 != t1)
+	       failed ("timegm failed to produce %S, got %S instead", t0, t1);
+	  }
+#endif
+     }
+}
+test_mktime ();
+
+private define test_other ()
+{
+   % Just test the calling syntax on these.
+   tic(); _tic();
+   variable n1 = toc(), n2 = _toc();
+
+   variable secs = 1000000;
+   if (typeof (ctime (secs)) != String_Type)
+     failed ("Expected ctime to return a string");
+   if (typeof (_ftime ()) != Double_Type)
+     failed ("Expected _ftime to return a double");
+#ifexists times
+   variable s = times ();
+   if ((Double_Type != typeof(s.tms_utime))
+       || (Double_Type != typeof(s.tms_stime))
+       || (Double_Type != typeof(s.tms_cutime))
+       || (Double_Type != typeof(s.tms_cstime)))
+     failed ("Expected fields to return value of the times function to be doubles");
+#endif
+}
+test_other ();
+
+print ("Ok\n");
+
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/utf8.sl Added

@@ -0,0 +1,188 @@
+() = evalfile ("inc.sl");
+
+#ifeval (0 == _slang_utf8_ok)
+%#stop
+#endif
+
+testing_feature ("utf8");
+
+static define check_sprintf (wc)
+{
+   variable s1 = sprintf ("%lc", wc);
+   variable s2 = eval (sprintf ("\"\\x{%X}\"", wc));
+   if (s1 != s2)
+     failed ("check_sprintf: %lX", wc);
+}
+
+check_sprintf (0xF);
+check_sprintf (0xFF);
+check_sprintf (0xFFF);
+check_sprintf (0xFFFF);
+check_sprintf (0xFFFFF);
+check_sprintf (0xFFFFFF);
+check_sprintf (0xFFFFFFF);
+check_sprintf (0x7FFFFFFF);
+
+#iffalse
+vmessage ("%s", "\x{F}\n");
+vmessage ("%s", "\x{FF}\n");
+vmessage ("%s", "\x{FFF}\n");
+vmessage ("%s", "\x{FFFF}\n");
+vmessage ("%s", "\x{FFFFF}\n");
+vmessage ("%s", "\x{FFFFFF}\n");
+vmessage ("%s", "\x{FFFFFFF}\n");
+vmessage ("%s", "\x{7FFFFFFF}\n");
+#endif
+
+if (strlen (char (173)) != 1)
+  failed ("strlen (char(173))");
+
+$1 = 0;
+try
+{
+   $1+='';			       %  2 bytes: 0xC2 an 0xAD
+   $1+='\x{AD}';
+   $1+='\xAD';
+   $1+='\d173';
+}
+catch AnyError: failed ("To parse 'x'");
+if ($1 != 4*173)
+  failed ("various character forms");
+
+if ("\u{AD}" != "\xC2\xAD")
+{
+   failed ("\\u{AD} != \\xC2\\xAD");
+}
+
+% If \x{...} is used with 3 or more hex digits, the result is UTF-8,
+% regardless of the mode.
+if ("\x{0AD}" != "\xC2\xAD")
+{
+   failed ("\\x{0AD} != \\xC2\\xAD");
+}
+if ("\x{0AD}" != "\xC2\xAD")
+{
+   failed ("\\x{00AD} != \\xC2\\xAD");
+}
+
+if (strbytelen ("\uAB") != 2)
+{
+   failed ("\\uAB expected to be 2 bytes");
+}
+
+if (_slang_utf8_ok)
+{
+   if (strbytelen ("\x{AB}") != 2)
+     failed ("\\x{AB} expected to be 2 bytes");
+}
+else
+{
+   if (strbytelen ("\x{AB}") != 1)
+     failed ("\\x{AB} expected to be 1 byte");
+}
+
+% Invalid sequences
+#ifeval (_slang_utf8_ok)
+private define check_illegal (wch)
+{
+   variable ustr = char (wch);
+   variable nbytes = strbytelen (ustr);
+   if (nbytes != strlen (ustr))
+     failed ("%d != strlen of wide char %S", nbytes, wch);
+
+   variable ustr_up = "A" + ustr;
+   variable ustr_dn = strlow (ustr_up);
+   if ((ustr_up != strup (ustr_dn)) || (ustr != ustr_dn1:))
+     failed ("strlow/strup on illegal seq");
+
+   variable p = 0;
+   variable ch;
+   forever
+     {
+	(p, ch) = strskipchar (ustr, p);
+	if (ch == 0)
+	  {
+	     if (nbytes == 0)
+	       break;
+	     failed ("strskipchar on illegal sequence of wch = %S", wch);
+	  }
+	if (nbytes == 0)
+	  {
+	     failed ("strskipchar-1 on illegal sequence of wch = %S", wch);
+	  }
+	nbytes--;
+     }
+
+   nbytes = strbytelen (ustr);
+   p = nbytes;
+   forever
+     {
+	(p, ch) = strbskipchar (ustr, p);
+	if (ch == 0)
+	  {
+	     if ((nbytes == 0) && (p == 0))
+	       break;
+	     failed ("strbskipchar on illegal sequence of wch = %S", wch);
+	  }
+	if (nbytes == 0)
+	  {
+	     failed ("strbskipchar-1 on illegal sequence of wch = %S", wch);
+	  }
+	nbytes--;
+     }
+}
+
+
+check_illegal (0xD800);
+check_illegal (0xDFFF);
+check_illegal (0xDA12);
+check_illegal (0xFFFE);
+check_illegal (0xFFFF);
+
+#endif
+
+% The escape sequence checks are for the unbraced \xhh, \d, and \ooo forms.
+% They always expand to single bytes.
+private define test_escaped_chars (testid, a, b)
+{
+   if (a != b)
+     failed ("testid=%s: test_escaped_chars (\"%s\", \"%s\")", testid, a, b);
+}
+
+test_escaped_chars ("X1", "\x20A", " A");
+test_escaped_chars ("X2", "A\x20", "A ");
+test_escaped_chars ("X3", "A\x20B", "A B");
+
+test_escaped_chars ("O1", "\0406", " 6");
+test_escaped_chars ("O2", "6\040", "6 ");
+test_escaped_chars ("O3", "6\0407", "6 7");
+test_escaped_chars ("O3", "\7A", "\x07A");
+test_escaped_chars ("O3", "\10A", "\x08A");
+
+test_escaped_chars ("D1", "\d0327", " 7");
+test_escaped_chars ("D2", "6\d032", "6 ");
+test_escaped_chars ("D3","6\d0327", "6 7");
+test_escaped_chars ("D4","6\d1A", "6\x01A");
+test_escaped_chars ("D5","6\d15A", "6\x0FA");
+
+private define test_bad_cases ()
+{
+   foreach (`\x`, `\d`, `\800`,
+	     `\xZ`, `\dZ`, `\d256`)
+     {
+	variable s = ();
+	variable bad = 0;
+	try
+	  {
+	     ()=eval(`"` + s + `"`);
+	     bad = 1;
+	  }
+	catch AnyError;
+	if (bad) failed ("Expected parsing of %S to fail.", s);
+     }
+}
+test_bad_cases ();
+
+print ("Ok\n");
+exit (0);
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/test/w32test.bat Added

@@ -0,0 +1,195 @@
+gcc -I.. -DSLANG_DLL=1 -DWIN32 -L..\gw32objs sltest.c -lslang -luser32
+sltest argv.sl
+sltest syntax.sl
+sltest scircuit.sl
+sltest eqs.sl
+sltest sscanf.sl
+sltest loops.sl
+sltest arith.sl
+sltest array.sl
+sltest strops.sl
+sltest bstring.sl
+sltest pack.sl
+sltest stdio.sl
+sltest assoc.sl
+sltest selfload.sl
+sltest struct.sl
+sltest nspace.sl
+sltest path.sl
+sltest ifeval.sl
+sltest anytype.sl
+sltest arrmult.sl
+sltest time.sl
+sltest utf8.sl
+sltest except.sl
+sltest bugs.sl
+sltest list.sl
+sltest regexp.sl
+sltest method.sl
+sltest deref.sl
+sltest naninf.sl
+sltest overflow.sl
+sltest sort.sl
+sltest longlong.sl
+sltest signal.sl
+sltest dollar.sl
+sltest req.sl
+sltest docfun.sl
+sltest debug.sl
+sltest qualif.sl
+sltest compare.sl
+sltest break.sl
+sltest multline.sl
+sltest stack.sl
+sltest misc.sl
+sltest posixio.sl
+sltest posdir.sl
+sltest proc.sl
+sltest math.sl
+sltest autoload.sl
+sltest nspace2.sl
+sltest prep.sl
+sltest argv.slc
+sltest syntax.slc
+sltest scircuit.slc
+sltest eqs.slc
+sltest sscanf.slc
+sltest loops.slc
+sltest arith.slc
+sltest array.slc
+sltest strops.slc
+sltest bstring.slc
+sltest pack.slc
+sltest stdio.slc
+sltest assoc.slc
+sltest selfload.slc
+sltest struct.slc
+sltest nspace.slc
+sltest path.slc
+sltest ifeval.slc
+sltest anytype.slc
+sltest arrmult.slc
+sltest time.slc
+sltest utf8.slc
+sltest except.slc
+sltest bugs.slc
+sltest list.slc
+sltest regexp.slc
+sltest method.slc
+sltest deref.slc
+sltest naninf.slc
+sltest overflow.slc
+sltest sort.slc
+sltest longlong.slc
+sltest signal.slc
+sltest dollar.slc
+sltest req.slc
+sltest docfun.slc
+sltest debug.slc
+sltest qualif.slc
+sltest compare.slc
+sltest break.slc
+sltest multline.slc
+sltest stack.slc
+sltest misc.slc
+sltest posixio.slc
+sltest posdir.slc
+sltest proc.slc
+sltest -utf8 math.slc
+sltest -utf8 argv.sl
+sltest -utf8 syntax.sl
+sltest -utf8 scircuit.sl
+sltest -utf8 eqs.sl
+sltest -utf8 sscanf.sl
+sltest -utf8 loops.sl
+sltest -utf8 arith.sl
+sltest -utf8 array.sl
+sltest -utf8 strops.sl
+sltest -utf8 bstring.sl
+sltest -utf8 pack.sl
+sltest -utf8 stdio.sl
+sltest -utf8 assoc.sl
+sltest -utf8 selfload.sl
+sltest -utf8 struct.sl
+sltest -utf8 nspace.sl
+sltest -utf8 path.sl
+sltest -utf8 ifeval.sl
+sltest -utf8 anytype.sl
+sltest -utf8 arrmult.sl
+sltest -utf8 time.sl
+sltest -utf8 utf8.sl
+sltest -utf8 except.sl
+sltest -utf8 bugs.sl
+sltest -utf8 list.sl
+sltest -utf8 regexp.sl
+sltest -utf8 method.sl
+sltest -utf8 deref.sl
+sltest -utf8 naninf.sl
+sltest -utf8 overflow.sl
+sltest -utf8 sort.sl
+sltest -utf8 longlong.sl
+sltest -utf8 signal.sl
+sltest -utf8 dollar.sl
+sltest -utf8 req.sl
+sltest -utf8 docfun.sl
+sltest -utf8 debug.sl
+sltest -utf8 qualif.sl
+sltest -utf8 compare.sl
+sltest -utf8 break.sl
+sltest -utf8 multline.sl
+sltest -utf8 stack.sl
+sltest -utf8 misc.sl
+sltest -utf8 posixio.sl
+sltest -utf8 posdir.sl
+sltest -utf8 proc.sl
+sltest -utf8 math.sl
+sltest -utf8 autoload.sl
+sltest -utf8 nspace2.sl
+sltest -utf8 prep.sl
+sltest -utf8 argv.slc
+sltest -utf8 syntax.slc
+sltest -utf8 scircuit.slc
+sltest -utf8 eqs.slc
+sltest -utf8 sscanf.slc
+sltest -utf8 loops.slc
+sltest -utf8 arith.slc
+sltest -utf8 array.slc
+sltest -utf8 strops.slc
+sltest -utf8 bstring.slc
+sltest -utf8 pack.slc
+sltest -utf8 stdio.slc
+sltest -utf8 assoc.slc
+sltest -utf8 selfload.slc
+sltest -utf8 struct.slc
+sltest -utf8 nspace.slc
+sltest -utf8 path.slc
+sltest -utf8 ifeval.slc
+sltest -utf8 anytype.slc
+sltest -utf8 arrmult.slc
+sltest -utf8 time.slc
+sltest -utf8 utf8.slc
+sltest -utf8 except.slc
+sltest -utf8 bugs.slc
+sltest -utf8 list.slc
+sltest -utf8 regexp.slc
+sltest -utf8 method.slc
+sltest -utf8 deref.slc
+sltest -utf8 naninf.slc
+sltest -utf8 overflow.slc
+sltest -utf8 sort.slc
+sltest -utf8 longlong.slc
+sltest -utf8 signal.slc
+sltest -utf8 dollar.slc
+sltest -utf8 req.slc
+sltest -utf8 docfun.slc
+sltest -utf8 debug.slc
+sltest -utf8 qualif.slc
+sltest -utf8 compare.slc
+sltest -utf8 break.slc
+sltest -utf8 multline.slc
+sltest -utf8 stack.slc
+sltest -utf8 misc.slc
+sltest -utf8 posixio.slc
+sltest -utf8 posdir.slc
+sltest -utf8 proc.slc
+sltest -utf8 math.slc

_service:tar_scm:slang-2.3.2.tar.bz2/src/untic.c Added

@@ -0,0 +1,91 @@
+#define SLANG_UNTIC
+char *SLang_Untic_Terminfo_File;
+#include "sltermin.c"
+
+static void usage (void)
+{
+ fprintf (stderr, "Usage: untic --terminfo filename | term\n");
+ exit (1);
+}
+
+int main (int argc, char **argv)
+{
+ SLterminfo_Type *t;
+ Tgetstr_Map_Type *map = Tgetstr_Map;
+ unsigned char *str;
+ char *term;
+
+ term = getenv ("TERM");
+ if (argc > 1)
+ {
+	if (!strcmp ("--help", argv1)) usage ();
+	if (argc == 2)
+	 term = argv1;
+	else if ((argc == 3) && !strcmp(argv1, "--terminfo"))
+	 {
+	 SLang_Untic_Terminfo_File = argv2;
+	 }
+	else usage ();
+ }
+ else if (term == NULL) return -1;
+
+ SLtt_Try_Termcap = 0;
+ t = _pSLtt_tigetent (term);
+ if (t == NULL) return -1;
+
+ puts (t->terminal_names);
+ while (*map->name != 0)
+ {
+	str = (unsigned char *) SLtt_tigetstr ((SLFUTURE_CONST char *)map->name, (char **) &t);
+	if (str == NULL)
+	 {
+	 map++;
+	 continue;
+	 /* str = (unsigned char *) "NULL"; */
+	 }
+
+	fprintf (stdout, "\t%s=", map->name);
+	while (*str)
+	 {
+	 if ((int) (*str & 0x7F) < ' ')
+	 {
+		 putc ('^', stdout);
+		 *str += '@';
+	 }
+	 putc (*str, stdout);
+	 str++;
+	 }
+	if (map->comment != NULL)
+	 fprintf (stdout, "\t\t%s", map->comment);
+	putc ('\n', stdout);
+	map++;
+ }
+
+ map = Tgetflag_Map;
+ while (*map->name != 0)
+ {
+	if (_pSLtt_tigetflag (t, map->name) > 0)
+	 {
+	 fprintf (stdout, "\t%s\t\t%s\n",
+		 map->name,
+		 ((map->comment == NULL) ? "" : map->comment));
+	 }
+	map++;
+ }
+ map = Tgetnum_Map;
+ while (*map->name != 0)
+ {
+	int val;
+	if ((val = SLtt_tigetnum ((SLFUTURE_CONST char *)map->name, (char **) &t)) >= 0)
+	 {
+	 fprintf (stdout, "\t%s#%d\t\t%s\n",
+		 map->name, val,
+		 ((map->comment == NULL) ? "" : map->comment));
+	 }
+	map++;
+ }
+
+ _pSLtt_tifreeent (t);
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/util Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/util/Makefile Added

_service:tar_scm:slang-2.3.2.tar.bz2/src/util/bcdump.c Added

@@ -0,0 +1,563 @@
+#include <stdio.h>
+#include <stdio.h>
+#include "slinclud.h"
+#include "slang.h"
+#include "_slang.h"
+
+static void dump_token (_pSLang_Token_Type *t)
+{
+ char buf 256, *b;
+
+ b = buf;
+
+ if (_pSLang_Error)
+ return;
+
+ switch (t->type)
+ {
+ case TIMES_TOKEN:
+	b = "*";
+	break;
+ case IDENT_TOKEN:
+	b = t->v.s_val;
+	break;
+
+ case TMP_TOKEN:
+	b = "__tmp"; break;
+
+ case CHAR_TOKEN:
+ case UCHAR_TOKEN:
+ case INT_TOKEN:
+ case LONG_TOKEN:
+	sprintf (buf, "%ld", t->v.long_val);
+	break;
+
+ case DOUBLE_TOKEN:
+ b = t->v.s_val;
+	break;
+
+ case STRING_TOKEN:
+	sprintf (buf, "\"%s\"", t->v.s_val);
+	break;
+
+ case STRING_DOLLAR_TOKEN:
+	sprintf (buf, "\"%s\"$", t->v.s_val);
+	break;
+
+ case PLUSPLUS_TOKEN:
+	sprintf (buf, "++ (RPN)");
+	break;
+
+ case POST_PLUSPLUS_TOKEN:
+	sprintf (buf, "%s++", t->v.s_val);
+	break;
+
+ case MINUSMINUS_TOKEN:
+	sprintf (buf, "-- (RPN)");
+	break;
+
+ case POST_MINUSMINUS_TOKEN:
+	sprintf (buf, "%s--", t->v.s_val);
+	break;
+
+ case MINUSEQS_TOKEN:
+	sprintf (buf, "-=%s", t->v.s_val);
+	break;
+
+ case PLUSEQS_TOKEN:
+	sprintf (buf, "+=%s", t->v.s_val);
+	break;
+
+ case ASSIGN_TOKEN:
+	sprintf (buf, "= (RPN assign)");
+	break;
+
+ case EOF_TOKEN:
+	b = "EOF_TOKEN";
+	break;
+
+ case NOP_TOKEN:
+	b = "NOP_TOKEN";
+	break;
+
+ case FOREVER_TOKEN:
+	b = "forever";
+	break;
+
+ case ARG_TOKEN:
+	b = "__args";
+	break;
+
+ case EARG_TOKEN:
+	b = "__eargs";
+	break;
+
+ case FARG_TOKEN:
+	b = "__farg";
+	break;
+
+ case _INLINE_ARRAY_TOKEN:
+	b = "__inline_array";
+	break;
+
+ case _INLINE_IMPLICIT_ARRAY_TOKEN:
+	b = "__inline_implicit_array";
+	break;
+
+ case IFNOT_TOKEN:
+	b = "!if";
+	break;
+#ifdef ABS_TOKEN
+ case ABS_TOKEN:
+	b = "abs";
+	break;
+#endif
+ case LT_TOKEN:
+	b = "<";
+	break;
+
+ case LE_TOKEN:
+	b = "<=";
+	break;
+
+ case GT_TOKEN:
+	b = ">";
+	break;
+
+ case GE_TOKEN:
+	b = ">=";
+	break;
+
+ case EQ_TOKEN:
+	b = "==";
+	break;
+
+ case NE_TOKEN:
+	b = "!=";
+	break;
+
+ case AND_TOKEN:
+	b = "and";
+	break;
+
+ case IF_TOKEN:
+	b = "if";
+	break;
+
+ case POP_TOKEN:
+	b = "pop";
+	break;
+
+ case ANDELSE_TOKEN:
+	b = "andelse";
+	break;
+
+ case BXOR_TOKEN:
+	b = "xor";
+	break;
+
+ case BAND_TOKEN:
+	b = "&";
+	break;
+
+ case BOR_TOKEN:
+	b = "|";
+	break;
+
+ case BNOT_TOKEN:
+	b = "~";
+	break;
+
+ case SHR_TOKEN:
+	b = "shr";
+	break;
+
+ case CHS_TOKEN:
+	b = "chs";
+	break;
+
+ case SHL_TOKEN:
+	b = "shl";
+	break;
+#ifdef SQR_TOKEN
+ case SQR_TOKEN:
+	b = "sqr";
+	break;
+#endif
+ case CASE_TOKEN:
+	b = "case";
+	break;
+#ifdef SIGN_TOKEN
+ case SIGN_TOKEN:
+	b = "sign";
+	break;
+#endif
+ case BREAK_TOKEN:
+	b = "break";
+	break;
+
+ case STATIC_TOKEN:
+	b = "static";
+	break;
+
+ case PRIVATE_TOKEN:
+	b = "private";
+	break;
+
+ case PUBLIC_TOKEN:
+	b = "public";
+	break;
+
+ case STRUCT_TOKEN:
+	b = "struct";
+	break;
+
+ case STRUCT_WITH_ASSIGN_TOKEN:
+	b = "__struct_with_assign";
+	break;
+
+ case QUALIFIER_TOKEN:
+	b = "set __qualifiers";
+	break;
+
+ case RETURN_TOKEN:
+	b = "return";
+	break;
+
+ case SWITCH_TOKEN:
+	b = "switch";
+	break;
+
+ case EXCH_TOKEN:
+	b = "exch";
+	break;
+
+ case CONT_TOKEN:
+	b = "continue";
+	break;
+
+ case EXITBLK_TOKEN:
+	b = "EXIT_BLOCK";
+	break;
+
+ case ERRBLK_TOKEN:
+	b = "ERROR_BLOCK";
+	break;
+
+ case USRBLK0_TOKEN:
+	b = "USER_BLOCK0";
+	break;
+
+ case USRBLK1_TOKEN:
+	b = "USER_BLOCK1";
+	break;
+
+ case USRBLK2_TOKEN:
+	b = "USER_BLOCK2";
+	break;
+
+ case USRBLK3_TOKEN:
+	b = "USER_BLOCK3";
+	break;
+
+ case USRBLK4_TOKEN:
+	b = "USER_BLOCK4";
+	break;
+
+ case ELSE_TOKEN:
+	b = "else";
+	break;
+#ifdef MUL2_TOKEN
+ case MUL2_TOKEN:
+	b = "mul2";
+	break;
+#endif
+ case DEFINE_TOKEN:
+	sprintf (buf, ") %s", t->v.s_val);
+	break;
+
+ case DEFINE_STATIC_TOKEN:
+	sprintf (buf, ") static %s", t->v.s_val);
+	break;
+
+ case DEFINE_PRIVATE_TOKEN:
+	sprintf (buf, ") private %s", t->v.s_val);
+	break;
+
+ case LOOP_TOKEN:
+	b = "loop";
+	break;
+
+ case MOD_TOKEN:
+	b = "mod";
+	break;
+
+ case DO_TOKEN:
+	b = "do";
+	break;
+
+ case DOWHILE_TOKEN:
+	b = "do_while";
+	break;
+
+ case WHILE_TOKEN:
+	b = "while";
+	break;
+
+ case OR_TOKEN:
+	b = "or";
+	break;
+
+ case VARIABLE_TOKEN:
+	b = "variable";
+	break;
+
+ case _SCALAR_ASSIGN_TOKEN:
+	sprintf (buf, "=%s", t->v.s_val);
+	break;
+
+ case _SCALAR_PLUSEQS_TOKEN:
+	sprintf (buf, "+=%s", t->v.s_val);
+	break;
+
+ case _SCALAR_MINUSEQS_TOKEN:
+	sprintf (buf, "-=%s", t->v.s_val);
+	break;
+
+ case _SCALAR_PLUSPLUS_TOKEN:
+	sprintf (buf, "++%s", t->v.s_val);
+	break;
+
+ case _SCALAR_POST_PLUSPLUS_TOKEN:
+	sprintf (buf, "%s++", t->v.s_val);
+	break;
+
+ case _SCALAR_MINUSMINUS_TOKEN:
+	sprintf (buf, "--%s", t->v.s_val);
+	break;
+
+ case _SCALAR_POST_MINUSMINUS_TOKEN:
+	sprintf (buf, "%s--", t->v.s_val);
+	break;
+
+ case _ARRAY_DIVEQS_TOKEN:
+	sprintf (buf, "/= (array)"); break;
+
+#if 0
+ case _DEREF_ASSIGN_TOKEN:
+	sprintf (buf, "=@%s", t->v.s_val);
+	break;
+#endif
+ case _REF_TOKEN:
+	sprintf (buf, "%s __ref", t->v.s_val);
+	break;
+
+ case _ARRAY_ELEM_REF_TOKEN:
+	b = "__array_elem_ref";
+	break;
+
+ case _STRUCT_FIELD_REF_TOKEN:
+	sprintf (buf, "%s __struct_field_ref", t->v.s_val);
+	break;
+
+ case ORELSE_TOKEN:
+	b = "orelse";
+	break;
+
+ case _FOR_TOKEN:
+	b = "_for";
+	break;
+
+ case FOR_TOKEN:
+	b = "for";
+	break;
+
+ case NOT_TOKEN:
+	b = "not";
+	break;
+
+ case OBRACKET_TOKEN:
+	b = "";
+	break;
+
+ case CBRACKET_TOKEN:
+	b = "";
+	break;
+
+ case OPAREN_TOKEN:
+	b = "(";
+	break;
+
+ case CPAREN_TOKEN:
+	b = ")";
+	break;
+
+ case OBRACE_TOKEN:
+	b = "{";
+	break;
+
+ case CBRACE_TOKEN:
+	b = "}";
+	break;
+
+ case DEREF_TOKEN:
+	b = "@";
+	break;
+
+ case COMMA_TOKEN:
+	b = ",";
+	break;
+
+ case SEMICOLON_TOKEN:
+	b = ";";
+	break;
+
+ case COLON_TOKEN:
+	b = ":";
+	break;
+
+ case SC_AND_TOKEN: b = "&&"; break;
+ case SC_OR_TOKEN: b = "||"; break;
+
+ case POW_TOKEN:
+	b = "^";
+	break;
+
+ case ADD_TOKEN:
+	b = "+";
+	break;
+
+ case SUB_TOKEN:
+	b = "-";
+	break;
+
+ /* case MUL_TOKEN: */
+ /* 	b = "*"; */
+ /* 	break; */
+
+ case DIV_TOKEN:
+	b = "/";
+	break;
+
+ case ARRAY_TOKEN:
+	b = "__aget";
+	break;
+
+ case DOT_TOKEN:
+	sprintf (buf, "%s .", t->v.s_val);
+	break;
+
+ case DOT_METHOD_CALL_TOKEN:
+	sprintf (buf, "%s __eargs __method_call", t->v.s_val);
+	break;
+
+ case _STRUCT_ASSIGN_TOKEN:
+	b = "__struct_eqs"; break;
+ case _STRUCT_PLUSEQS_TOKEN:
+	b = "__struct_pluseqs"; break;
+ case _STRUCT_MINUSEQS_TOKEN:
+	b = "__struct_minuseqs"; break;
+ case _STRUCT_PLUSPLUS_TOKEN:
+	b = "__struct_plusplus"; break;
+ case _STRUCT_POST_PLUSPLUS_TOKEN:
+	b = "__struct_pplusplus"; break;
+ case _STRUCT_MINUSMINUS_TOKEN:
+	b = "__struct_minusminus"; break;
+ case _STRUCT_POST_MINUSMINUS_TOKEN:
+	b = "__struct_pminusminus"; break;
+
+ case _ARRAY_ASSIGN_TOKEN:
+	b = "_aput"; break;
+ case _ARRAY_PLUSEQS_TOKEN:
+	b = "__array_pluseqs"; break;
+ case _ARRAY_MINUSEQS_TOKEN:
+	b = "__array_minuseqs"; break;
+ case _ARRAY_PLUSPLUS_TOKEN:
+	b = "__array_plusplus"; break;
+ case _ARRAY_POST_PLUSPLUS_TOKEN:
+	b = "__array_pplusplus"; break;
+ case _ARRAY_MINUSMINUS_TOKEN:
+	b = "__array_minusminus"; break;
+ case _ARRAY_POST_MINUSMINUS_TOKEN:
+	b = "__array_pminusminus"; break;
+
+ case _DEREF_ASSIGN_TOKEN:
+	b = "__deref_eqs"; break;
+ case _DEREF_PLUSEQS_TOKEN:
+	b = "__deref_pluseqs"; break;
+ case _DEREF_MINUSEQS_TOKEN:
+	b = "__deref_minuseqs"; break;
+ case _DEREF_PLUSPLUS_TOKEN:
+	b = "__deref_plusplus"; break;
+ case _DEREF_POST_PLUSPLUS_TOKEN:
+	b = "__deref_pplusplus"; break;
+ case _DEREF_MINUSMINUS_TOKEN:
+	b = "__deref_minusminus"; break;
+ case _DEREF_POST_MINUSMINUS_TOKEN:
+	b = "__deref_pminusminus"; break;
+
+ case _DEREF_OBSOLETE_FUNCALL_TOKEN:
+	b = "__deref_funcall ***WARNING: OBSOLETE form"; break;
+
+ case _DEREF_FUNCALL_TOKEN:
+	b = "__deref_funcall"; break;
+
+ case _NULL_TOKEN: b = "NULL"; break;
+
+ case USING_TOKEN:
+	b = "__using__"; break;
+ case FOREACH_TOKEN:
+	b = "__foreach__"; break;
+
+ case LOOP_THEN_TOKEN:
+	b = "__loopthen__"; break;
+#if 0
+ case LOOP_ELSE_TOKEN:
+	b = "__loopelse__"; break;
+#endif
+ case TRY_TOKEN:
+	b = "try"; break;
+
+ case LINE_NUM_TOKEN:
+ sprintf (buf, "__line_num__ %ld", t->v.long_val); break;
+
+ case _INLINE_WILDCARD_ARRAY_TOKEN:
+	sprintf (buf, "__inline_wildcard_array__"); break;
+
+ case BOS_TOKEN:
+	b = "__bos__"; break;
+ case EOS_TOKEN:
+	b = "__eos__"; break;
+ case THROW_TOKEN:
+	b = "__throw__"; break;
+
+ default:
+	sprintf (buf, "____UNKNOWN___0x%X", t->type);
+	break;
+ }
+
+ fprintf (stdout, "0x%2X: %s\n", t->type, b);
+}
+
+int main (int argc, char **argv)
+{
+ char *file;
+
+ if (argc == 2)
+ {
+	/* fprintf (stderr, "Usage: %s <filename>\n", argv0); */
+	file = argv1;
+	/* return 1; */
+ }
+ else file = NULL;
+
+ if (-1 == SLang_init_slang ())
+ return 1;
+
+ _pSLcompile_ptr = dump_token;
+ _pSLang_Compile_BOSEOS = 3;
+ _pSLang_Compile_BOFEOF = 1;
+ SLang_load_file (file);
+
+ return _pSLang_Error;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/util/chkproto.c Added

@@ -0,0 +1,220 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <string.h>
+
+static char *Make_Intrinsic_Forms =
+{
+ "0",
+ "I",
+ "S",
+ "II",
+ "SS",
+ "SI",
+ "IS",
+ "III",
+ "IIS",
+ "ISI",
+ "ISS",
+ "SII",
+ "SIS",
+ "SSI",
+ "SSS",
+ "IIII",
+ "SSSS",
+ NULL
+};
+
+static char *output_start (FILE *fp)
+{
+ char **form;
+
+ form = Make_Intrinsic_Forms;
+
+ while (*form != NULL)
+ {
+	char *r = "0ISD";
+	char *f;
+
+	while (*r != 0)
+	 {
+	 switch (*r)
+	 {
+		case '0':
+		 fprintf (fp, "static void (*V_F");
+		 break;
+
+		case 'I':
+		 fprintf (fp, "static int (*I_F");
+		 break;
+
+		case 'S':
+		 fprintf (fp, "static char *(*S_F");
+		 break;
+
+		case 'D':
+		 fprintf (fp, "static double (*D_F");
+		 break;
+	 }
+
+	 f = *form;
+	 fprintf (fp, "%s)(", f);
+	 while (*f != 0)
+	 {
+		 if (f != *form) fputc (',', fp);
+		 switch (*f)
+		 {
+		 case 'I':
+		 fputs ("int*", fp);
+		 break;
+
+		 case 'S':
+		 fputs ("char*", fp);
+		 break;
+
+		 case '0':
+		 fputs ("void", fp);
+		 break;
+		 }
+		 f++;
+	 }
+	 fputs (");\n", fp);
+
+	 r++;
+	 }
+	form++;
+ }
+
+ fputs ("\n", fp);
+
+ fprintf (fp, "static void chkproto_not_used_fun (void)\n{\n");
+
+ return 0;
+}
+
+static void output_finish (FILE *fp)
+{
+ fputs ("\n}\n", fp);
+}
+
+static char *skip_whitespace (char *p)
+{
+ while ((*p == ' ') || (*p == '\t') || (*p == '\n'))
+ p++;
+
+ return p;
+}
+
+static int do_make_intrinsic (unsigned int linenum, char *p)
+{
+ char *e;
+ char *name;
+ int ret_type;
+
+ e = p;
+ while (*e && (*e != ' ') && (*e != '\t') && (*e != '('))
+ e++;
+
+ if (*e == 0)
+ {
+	return -1;
+ }
+ *e++ = 0;
+
+ /* We expect form: IIS("name", function_name, RETURN_TYPE) */
+ while (*e && (*e != ',')) e++;
+ if (*e == 0)
+ {
+	return -1;
+ }
+ e = skip_whitespace (e + 1);
+ name = e;
+ if (*name == 0)
+ {
+	return -1;
+ }
+ while (*e && (*e != ',')) e++;
+ if (*e == 0)
+ {
+	return -1;
+ }
+ *e = 0;
+
+ e = skip_whitespace (e + 1);
+ if (0 == strncmp (e, "SLANG_", 6))
+ e += 6;
+
+ if (0 == strncmp (e, "VOID_TYPE", 8))
+ ret_type = 'V';
+ else if (0 == strncmp (e, "STRING_TYPE", 11))
+ ret_type = 'S';
+ else if (0 == strncmp (e, "INT_TYPE", 8))
+ ret_type = 'I';
+ else if (0 == strncmp (e, "DOUBLE_TYPE", 8))
+ ret_type = 'D';
+ else
+ {
+	fprintf (stderr, "return type on line %u is not supported\n", linenum);
+	return -1;
+ }
+
+ fprintf (stdout, " %c_F%s = %s;\n", ret_type, p, name);
+ return 0;
+}
+
+int main (int argc, char **argv)
+{
+ char line 1024;
+ FILE *fp;
+ unsigned int linenum;
+
+ if (isatty (0)
+ || (argc > 1))
+ {
+	fprintf (stderr, "Usage: %s < infile > outfile\n", argv0);
+	exit (1);
+ }
+
+ output_start (stdout);
+
+ fp = stdin;
+
+ linenum = 0;
+ while (NULL != fgets (line, sizeof (line), fp))
+ {
+	char *p = skip_whitespace (line);
+
+	linenum++;
+
+	if (*p != 'M') continue;
+
+	if (0 != strncmp (p, "MAKE_INTRINSIC", 14))
+	 continue;
+
+	if (p14 != '_')
+	 {
+	 fprintf (stderr, "Warning: line %u is old-fashioned\n", linenum);
+	 continue;
+	 }
+
+	p += 15;
+
+	switch (*p)
+	 {
+	 case 'I':
+	 case 'S':
+	 case '0':
+	 do_make_intrinsic (linenum, p);
+	 break;
+
+	 default:
+	 fprintf (stderr, "Warning: Unable to handle MAKE_INTRINSIC form on line %u\n",
+		 linenum);
+	 break;
+	 }
+ }
+
+ output_finish (stdout);
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/src/util/keywords.lis Added

@@ -0,0 +1,79 @@
+!if			IFNOT_TOKEN
+ERROR_BLOCK		ERRBLK_TOKEN
+EXIT_BLOCK		EXITBLK_TOKEN
+USER_BLOCK0		USRBLK0_TOKEN
+USER_BLOCK1		USRBLK1_TOKEN
+USER_BLOCK2		USRBLK2_TOKEN
+USER_BLOCK3		USRBLK3_TOKEN
+USER_BLOCK4		USRBLK4_TOKEN
+__tmp			TMP_TOKEN
+_for			_FOR_TOKEN
+%abs			ABS_TOKEN
+and			AND_TOKEN
+andelse			ANDELSE_TOKEN
+break			BREAK_TOKEN
+case			CASE_TOKEN
+catch			CATCH_TOKEN
+%chs			CHS_TOKEN
+continue		CONT_TOKEN
+define			DEFINE_TOKEN
+do			DO_TOKEN
+%do_while		DOWHILE_TOKEN
+else			ELSE_TOKEN
+exch			EXCH_TOKEN
+finally			FINALLY_TOKEN
+for			FOR_TOKEN
+foreach			FOREACH_TOKEN
+forever			FOREVER_TOKEN
+if			IF_TOKEN
+ifnot			IFNOT_TOKEN
+loop			LOOP_TOKEN
+mod			MOD_TOKEN
+%mul2			MUL2_TOKEN
+not			NOT_TOKEN
+or			OR_TOKEN
+orelse			ORELSE_TOKEN
+pop			POP_TOKEN
+private			PRIVATE_TOKEN
+public			PUBLIC_TOKEN
+return			RETURN_TOKEN
+shl			SHL_TOKEN
+shr			SHR_TOKEN
+%sign			SIGN_TOKEN
+%sqr			SQR_TOKEN
+static			STATIC_TOKEN
+struct			STRUCT_TOKEN
+switch			SWITCH_TOKEN
+then			THEN_TOKEN
+throw			THROW_TOKEN
+try			TRY_TOKEN
+typedef			TYPEDEF_TOKEN
+using			USING_TOKEN
+variable		VARIABLE_TOKEN
+while			WHILE_TOKEN
+xor			BXOR_TOKEN
+%
+% The kewords below here are commented out because they are not
+% used.  Most of them could be used if one wanted to write in RPN form
+% but I want to discontinue it
+%
+%push			PUSH_TOKEN
+%readonly		READONLY_TOKEN
+%__ref			_REF_TOKEN
+%__aput			_ARRAY_ASSIGN_TOKEN
+%__aput_minuseqs		_ARRAY_MINUSEQS_TOKEN
+%__aput_minusminus	_ARRAY_MINUSMINUS_TOKEN
+%__aput_pluseqs		_ARRAY_PLUSEQS_TOKEN
+%__aput_plusplus		_ARRAY_PLUSPLUS_TOKEN
+%__aput_pminusminus	_ARRAY_POST_MINUSMINUS_TOKEN
+%__aput_pplusplus	_ARRAY_POST_PLUSPLUS_TOKEN
+%__arg			ARG_TOKEN
+%__array			ARRAY_TOKEN
+%__earg			EARG_TOKEN
+%__struct_eqs		_STRUCT_ASSIGN_TOKEN
+%__struct_minuseqs	_STRUCT_MINUSEQS_TOKEN
+%__struct_minusminus	_STRUCT_MINUSMINUS_TOKEN
+%__struct_pluseqs	_STRUCT_PLUSEQS_TOKEN
+%__struct_plusplus	_STRUCT_PLUSPLUS_TOKEN
+%__struct_pminusminus	_STRUCT_POST_MINUSMINUS_TOKEN
+%__struct_pplusplus	_STRUCT_POST_PLUSPLUS_TOKEN

_service:tar_scm:slang-2.3.2.tar.bz2/src/util/mkslarith2.sl Added

@@ -0,0 +1,235 @@
+#!/usr/bin/env slsh
+
+private variable CTypes =
+ "signed char", "unsigned char", "short", "unsigned short", "int", "unsigned int",
+ "long", "unsigned long", "long long", "unsigned long long",
+ "float", "double", "long double";
+private variable Is_Int_Type =
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0;
+
+private variable Precedence =
+ 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 5, 6;
+
+private variable SLTypes =
+ "CHAR", "UCHAR", "SHORT", "USHORT", "INT", "UINT",
+ "LONG", "ULONG", "LLONG", "ULLONG",
+ "FLOAT", "DOUBLE", "LDOUBLE";
+private variable FNames =
+ "char", "uchar", "short", "ushort", "int", "uint",
+ "long", "ulong", "llong", "ullong",
+ "float", "double", "ldouble";
+% private variable Compile_If =
+% "", "", "SHORT_IS_NOT_INT", "SHORT_IS_NOT_INT", "", "",
+% "LONG_IS_NOT_INT", "LONG_IS_NOT_INT",
+% "defined(HAVE_LONG_LONG)", "defined(HAVE_LONG_LONG)",
+% "SLANG_HAS_FLOAT", "SLANG_HAS_FLOAT", "defined(HAVE_LONG_DOUBLE)";
+private variable Compile_If =
+ "", "", "", "", "", "", "", "",
+ "defined(HAVE_LONG_LONG)", "defined(HAVE_LONG_LONG)",
+ "SLANG_HAS_FLOAT", "SLANG_HAS_FLOAT", "defined(HAVE_LONG_DOUBLE)";
+
+private variable Else_Alias =
+ "", "", "int", "uint", "", "", "int", "uint", "", "", "", "", "";
+
+define mkarith_copy_funs (fp)
+{
+ variable ntypes = length (CTypes);
+ variable i, j;
+ _for i (0, ntypes-1, 1)
+ {
+	variable ctype = CTypesi;
+	variable is_int = Is_Int_Typei;
+	variable sltype = SLTypesi;
+	variable fname = FNamesi;
+	variable compile_if = Compile_Ifi;
+	variable prec = Precedencei;
+	variable else_alias = Else_Aliasi;
+	variable s_fname = fname;
+	if (s_fname0 == 'u') s_fname = substr (s_fname, 2, -1);
+
+	() = fprintf (fp, "/* ------------ %s ---------- */\n", ctype);
+
+	if (compile_if != "")
+	 () = fprintf (fp, "#if %s\n", compile_if);
+
+	variable is_long = (s_fname == "long");
+
+	_for j (0, ntypes-1, 1)
+	 {
+	 variable ctype1 = CTypesj;
+	 variable is_int1 = Is_Int_Typej;
+	 variable sltype1 = SLTypesj;
+	 variable fname1 = FNamesj;
+	 variable compile_if1 = Compile_Ifj;
+	 variable else_alias1 = Else_Aliasj;
+	 variable prec1 = Precedencej;
+	 variable s_fname1;
+
+	 if (compile_if1 != "")
+	 () = fprintf (fp, "#if %s\n", compile_if1);
+
+	 s_fname1 = fname1;
+	 if (s_fname10 == 'u') s_fname1 = substr (s_fname1, 2, -1);
+	 variable is_long1 = (s_fname1 == "long");
+	 variable is_conditional = is_long || is_long1;
+
+	 variable def1 = sprintf ("copy_%s_to_%s", fname, fname1);
+	 variable def2 = sprintf ("%s_to_%s", fname, fname1);
+
+	 if ((s_fname1 == s_fname)
+		 and ((s_fname1 != fname1) or (s_fname != fname)))
+	 () = fprintf (fp, "#define copy_%s_to_%s\tcopy_%s_to_%s\n",
+			 fname, fname1, s_fname, s_fname1);
+	 else
+	 {
+		 if (is_conditional)
+		 {
+		 () = fputs ("#if LONG_IS_INT\n", fp);
+		 if (is_long1)
+			 () = fputs ("# define $def1 copy_${fname}_to_${else_alias1}\n"$, fp);
+		 else
+			 () = fputs ("# define $def1 copy_${else_alias}_to_${fname1}\n"$, fp);
+		 () = fputs ("#else\n", fp);
+		 }
+		 () = fputs ("DEFUN_1($def1,$ctype,$ctype1)\n"$, fp);
+		 if (is_conditional)
+		 () = fputs ("#endif\n", fp);
+	 }
+
+	 if (prec < prec1)
+	 {
+		 if (is_conditional)
+		 {
+		 () = fputs ("#if LONG_IS_INT\n", fp);
+		 if (is_long1)
+			 () = fputs ("# define $def2 ${fname}_to_${else_alias1}\n"$, fp);
+		 else
+			 () = fputs ("# define $def2 ${else_alias}_to_${fname1}\n"$, fp);
+		 () = fputs ("#else\n", fp);
+		 }
+		 () = fputs ("DEFUN_2($def2,$ctype,$ctype1,$def1)\n"$, fp);
+		 if (is_conditional)
+		 () = fputs ("#endif\n", fp);
+	 }
+	 else
+	 {
+		 () = fprintf (fp, "#define %s_to_%s\tNULL\n", fname, fname1);
+	 }
+#iffalse
+	 if (else_alias != "")
+	 {
+		 () = fprintf (fp, "#else\n");
+		 () = fprintf (fp, "# define copy_%s_to_%s\tcopy_%s_to_%s\n",
+				fname, fname1, fname, else_alias);
+		 if (prec < prec1)
+		 {
+		 if (fname != else_alias)
+			 () = fprintf (fp, "# define %s_to_%s\t%s_to_%s\n",
+				 fname, fname1, fname, else_alias);
+		 }
+	 }
+#endif
+	 if (compile_if1 != "")
+	 () = fprintf (fp, "#endif /* %s */\n", compile_if1);
+	 }
+
+	() = fprintf (fp, "#if SLANG_HAS_FLOAT\n");
+	() = fprintf (fp, "TO_DOUBLE_FUN(%s_to_one_double,%s)\n",
+		 fname, ctype);
+	() = fprintf (fp, "#endif\n");
+
+	if (compile_if != "")
+	 () = fprintf (fp, "#endif /* %s */\n", compile_if);
+
+	() = fprintf (fp, "\n");
+ }
+}
+
+define mk_to_double_table (fp)
+{
+ variable ntypes = length (CTypes);
+
+ () = fprintf (fp, "#if SLANG_HAS_FLOAT\n");
+ () = fprintf (fp, "static To_Double_Fun_Table_Type To_Double_Fun_Table MAX_ARITHMETIC_TYPES =\n{\n");
+
+ variable i;
+ _for i (0, ntypes-1, 1)
+ {
+	variable ctype = CTypesi;
+	variable compile_if = Compile_Ifi;
+	variable fname = FNamesi;
+
+	if (compile_if != "")
+	 () = fprintf (fp, "#if %s\n", compile_if);
+	() = fprintf (fp, " {sizeof(%s), %s_to_one_double},\n", ctype, fname);
+	if (compile_if != "")
+	 {
+	 () = fprintf (fp, "#else\n");
+	 () = fprintf (fp, " {0, NULL},\n#endif\n");
+	 }
+ }
+ () = fprintf (fp, "};\n#endif\n\n");
+}
+
+private define mk_binary_table (fp)
+{
+ variable ntypes = length (CTypes);
+ variable i, j;
+
+ () = fprintf (fp, "static Binary_Matrix_Type Binary_Matrix MAX_ARITHMETIC_TYPESMAX_ARITHMETIC_TYPES =\n{\n");
+
+ _for i (0, ntypes-1, 1)
+ {
+	variable fname = FNamesi;
+	variable compile_if = Compile_Ifi;
+
+	() = fprintf (fp, " /* %s */\n", CTypesi);
+
+	if (compile_if != "")
+	 () = fprintf (fp, "#if %s\n", compile_if);
+
+	() = fprintf (fp, " {\n");
+
+	_for j (0, ntypes-1, 1)
+	 {
+	 variable fname1 = FNamesj;
+	 variable compile_if1 = Compile_Ifj;
+
+	 if (compile_if1 != "")
+	 () = fprintf (fp, "#if %s\n", compile_if1);
+
+	 () = fprintf (fp, " {(FVOID_STAR)copy_%s_to_%s, %s_to_%s},\n",
+			 fname, fname1, fname, fname1);
+
+	 if (compile_if1 == "")
+	 continue;
+
+	 () = fprintf (fp, "#else\n");
+	 () = fprintf (fp, " {NULL, NULL},\n");
+	 () = fprintf (fp, "#endif\n");
+	 }
+
+	() = fprintf (fp, " },\n");
+	if (compile_if == "")
+	 continue;
+
+	() = fprintf (fp, "#else\n");
+
+	() = fprintf (fp, " {\n");
+	loop (ntypes)
+	 () = fprintf (fp, " {NULL, NULL},\n");
+	() = fprintf (fp, " },\n");
+	() = fprintf (fp, "#endif /* %s */\n\n", compile_if);
+ }
+ () = fprintf (fp, "};\n\n");
+}
+
+define slsh_main ()
+{
+ variable fp = fopen ("slarith2.inc", "w");
+ () = fputs ("/* DO NOT EDIT -- this file was generated by src/util/mkslarith2.sl */\n", fp);
+ mkarith_copy_funs (fp);
+ mk_to_double_table (fp);
+ mk_binary_table (fp);
+ () = fclose (fp);
+}

_service:tar_scm:slang-2.3.2.tar.bz2/src/util/perfhash.c Added

@@ -0,0 +1,603 @@
+/* Copyright (c) 1998-2017,2018 John E. Davis
+This file is part of the S-Lang Library.
+
+The S-Lang Library 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 2 of the
+License, or (at your option) any later version.
+
+The S-Lang Library 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 library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+USA.
+*/
+#include <stdio.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <string.h>
+
+static char *C_Char_Map_Name = "Keyword_Hash_Table";
+static char *C_Hash_Function_Name = "keyword_hash";
+static char *C_Hash_Table_Type = "Keyword_Table_Type";
+static char *C_Hash_Table_Name = "Keyword_Table";
+static char *C_Is_Keyword_Function_Name = "is_keyword";
+
+typedef struct
+{
+ unsigned int hash;
+ unsigned int len;
+ unsigned int freq_statistic;
+ char *name;
+ char *type;
+}
+String_Table_Type;
+
+static String_Table_Type String_Table 256;
+
+static unsigned int Num_Strings;
+
+static unsigned int Max_Table_Value;
+static unsigned int Max_String_Len;
+static unsigned int Min_String_Len;
+static unsigned int Max_Hash_Value;
+static unsigned int Tweak_Step_Size;
+static int Use_Length = 1;
+
+static int Char_Table_Map 256;
+
+static void write_table (unsigned int min_hash, unsigned int max_hash)
+{
+ String_Table_Type *st, *st_max;
+ unsigned int i;
+
+ fprintf (stdout, "\n\
+typedef SLCONST struct\n\
+{\n\
+ SLCONST char *name;\n\
+ unsigned int type;\n\
+}\n\
+%s;\n\
+",
+	 C_Hash_Table_Type);
+
+ fprintf (stdout, "\nstatic %s %s /* %u */ =\n{\n",
+	 C_Hash_Table_Type, C_Hash_Table_Name, (max_hash - min_hash) + 1);
+ fprintf (stderr, "String Table Size: %u\n", (max_hash - min_hash) + 1);
+
+ for (i = min_hash; i <= max_hash; i++)
+ {
+	st = String_Table;
+	st_max = st + Num_Strings;
+	while (st < st_max)
+	 {
+	 if ((unsigned int) st->hash == i)
+	 break;
+	 st++;
+	 }
+
+	if (st == st_max)
+	 fprintf (stdout, " {NULL,0},\n");
+	else
+	 fprintf (stdout, " {\"%s\",\t%s},\n", st->name, st->type);
+ }
+
+ fputs ("};\n\n", stdout);
+
+ fprintf (stdout, "\
+static %s *%s (char *str, unsigned int len)\n\
+{\n\
+ unsigned int hash;\n\
+ SLCONST char *name;\n\
+ %s *kw;\n\
+\n\
+ if ((len < MIN_KEYWORD_LEN)\n\
+ || (len > MAX_KEYWORD_LEN))\n\
+ return NULL;\n\
+\n\
+ hash = %s (str, len);\n\
+ if ((hash > MAX_HASH_VALUE) || (hash < MIN_HASH_VALUE))\n\
+ return NULL;\n\
+\n\
+ kw = &%shash - MIN_HASH_VALUE;\n\
+ if ((NULL != (name = kw->name))\n\
+ && (*str == *name)\n\
+ && (0 == strcmp (str, name)))\n\
+ return kw;\n\
+ return NULL;\n\
+}\n\
+",
+	 C_Hash_Table_Type, C_Is_Keyword_Function_Name,
+	 C_Hash_Table_Type, C_Hash_Function_Name, C_Hash_Table_Name);
+}
+
+static unsigned int hash_function (int *char_map,
+				 unsigned char *s, unsigned int len)
+{
+ unsigned int sum;
+
+ if (Use_Length) sum = len;
+ else sum = 0;
+
+ while (len)
+ {
+	len--;
+	sum += (unsigned int) char_map slen;
+ }
+ return sum;
+}
+
+static unsigned int Frequency_Table 256;
+
+static void init_map (int *map)
+{
+ unsigned int i;
+
+ for (i = 0; i < 256; i++) map i = -1;
+
+ for (i = 0; i < Num_Strings; i++)
+ {
+	unsigned char *s;
+
+	s = (unsigned char *) String_Tablei.name;
+
+	while (*s != 0)
+	 {
+	 map *s = 0;
+	 s++;
+	 }
+ }
+}
+
+static void write_map (int *map)
+{
+ unsigned int i;
+ unsigned int min_hash, max_hash;
+ char *type;
+
+ min_hash = 0xFFFF;
+ max_hash = 0;
+ for (i = 0; i < Num_Strings; i++)
+ {
+	unsigned int h = String_Tablei.hash;
+	if (h < min_hash) min_hash = h;
+	if (h > max_hash) max_hash = h;
+#if 0
+	fprintf (stdout, "-->%s\t%u\n", String_Tablei.name, h);
+#endif
+ }
+
+ fprintf (stdout, "#ifndef SLCONST\n#define SLCONST const\n#endif\n");
+ fprintf (stdout, "#define MIN_HASH_VALUE\t%u\n", min_hash);
+ fprintf (stdout, "#define MAX_HASH_VALUE\t%u\n", max_hash);
+ fprintf (stdout, "#define MIN_KEYWORD_LEN %u\n", Min_String_Len);
+ fprintf (stdout, "#define MAX_KEYWORD_LEN %u\n", Max_String_Len);
+
+ for (i = 0; i < 256; i++)
+ if (mapi == -1) mapi = (max_hash + 1);
+
+ if (max_hash + 1 < 0xFF)
+ type = "unsigned char";
+ else if (max_hash + 1 < 0xFFFF)
+ type = "unsigned short";
+ else
+ type = "unsigned long";
+
+ fprintf (stderr, "Hash Table is of type %s with max hash %u\n",
+	 type, max_hash);
+
+ fprintf (stdout, "\nstatic SLCONST %s %s 256 =\n",
+	 type, C_Char_Map_Name);
+
+ fprintf (stdout, "{\n ");
+
+ for (i = 0; i < 255; i++)
+ {
+	fprintf (stdout, "%3d, ", mapi);
+	if ((i % 16) == 15)
+	 fputs ("\n ", stdout);
+ }
+ fprintf (stdout, "%3d\n};\n", map255);
+
+ fputs ("\n", stdout);
+
+ fprintf (stdout, "static %s %s (char *s, unsigned int len)\n",
+	 type, C_Hash_Function_Name);
+
+fprintf (stdout,"\
+{\n\
+ unsigned int sum;\n\
+\n\
+ sum = %s;\n\
+ while (len)\n\
+ {\n\
+	len--;\n\
+	sum += (unsigned int) %s (unsigned char)slen;\n\
+ }\n\
+ return sum;\n\
+}\n\
+",
+	 (Use_Length ? "len" : "0"),
+	 C_Char_Map_Name);
+
+ write_table (min_hash, max_hash);
+}
+
+static unsigned int compute_hash (unsigned int i)
+{
+ String_Table_Type *s;
+ unsigned int hash;
+
+ s = String_Table + i;
+ hash = hash_function (Char_Table_Map, (unsigned char *) s->name, s->len);
+ return s->hash = hash;
+}
+
+static int tweak_character (unsigned char ch, unsigned int bad)
+{
+ unsigned int val;
+ unsigned int val_save;
+ unsigned int i, j;
+ unsigned int nvalues;
+
+ val_save = (unsigned int) Char_Table_Map ch;
+ nvalues = Max_Table_Value;
+
+ val = 0;
+ while (nvalues)
+ {
+	val += Tweak_Step_Size;
+	val = val % Max_Table_Value;
+
+	Char_Table_Mapch = (int) val;
+
+	for (i = 0; i <= bad; i++)
+	 {
+	 unsigned int hash = compute_hash (i);
+	 for (j = 0; j < i; j++)
+	 {
+		 if (hash == String_Tablej.hash)
+		 break;
+	 }
+	 if (j != i)
+	 break;
+	 }
+
+	if (i > bad) return 0;
+	nvalues--;
+ }
+
+ Char_Table_Map ch = (int) val_save;
+#if 0
+ /* reset hashes */
+ for (i = 0; i <= bad; i++)
+ (void) compute_hash (i);
+#endif
+ return -1;
+}
+
+static void sort_according_to_frequency (unsigned char *s, unsigned int len)
+{
+ /* since len is small (I hope), I will be lazy */
+ unsigned char si, sj;
+ unsigned int fi;
+ unsigned int i, j, imax;
+
+ imax = len - 1;
+ for (i = 0; i < imax; i++)
+ {
+	si = si;
+	fi = Frequency_Table si;
+
+	for (j = i + 1; j < len; j++)
+	 {
+	 sj = sj;
+	 if (Frequency_Tablesj < fi)
+	 {
+		 si = sj;
+		 sj = si;
+		 break;
+	 }
+	 }
+ }
+}
+
+static void create_frequency_table (unsigned int num)
+{
+ unsigned int i;
+
+ memset ((char *) Frequency_Table, 0, sizeof(Frequency_Table));
+
+ for (i = 0; i < num; i++)
+ {
+	unsigned char *s, ch;
+
+	s = (unsigned char *)String_Tablei.name;
+	while (0 != (ch = *s))
+	 {
+	 Frequency_Table ch += 1;
+	 s++;
+	 }
+ }
+}
+
+static int tweak_hash_function (unsigned int bad, unsigned int good)
+{
+ unsigned char unique_chars 256;
+ unsigned char bad_chars 256, good_chars256;
+ unsigned char *s;
+ unsigned int i, len;
+
+ memset ((char *)unique_chars, 0, sizeof (unique_chars));
+ memset ((char *)bad_chars, 0, sizeof (bad_chars));
+ memset ((char *)good_chars, 0, sizeof (good_chars));
+
+ s = (unsigned char *) String_Tablebad.name;
+ while (*s != 0)
+ {
+	bad_chars *s = 1;
+	s++;
+ }
+
+ s = (unsigned char *) String_Tablegood.name;
+ while (*s != 0)
+ {
+	good_chars *s = 1;
+	s++;
+ }
+
+ /* Find out the characters that are in good or bad, and not both. That
+ * way we are free to manipulate those to avoid the collision.
+ */
+ len = 0;
+ for (i = 0; i < 256; i++)
+ {
+	if (bad_charsi)
+	 {
+	 if (good_chars i == 0)
+	 unique_chars len++ = i;
+	 }
+	else if (good_chars i)
+	 unique_chars len++ = i;
+ }
+
+ /* Unfortunately, the unique_chars may already be part of the words
+ * that have already been hashed. So, sort them according to how often
+ * they occur and deal with those that occur the least often first.
+ */
+#if 1
+ create_frequency_table (bad);
+#endif
+ sort_according_to_frequency (unique_chars, len);
+
+ for (i = 0; i < len; i++)
+ {
+	unsigned char ch = unique_chars i;
+	if (0 == tweak_character (ch, bad))
+	 return 0;
+ }
+
+ return -1;
+}
+
+static int perfect_hash (void)
+{
+ unsigned int i, j;
+ unsigned int hash;
+ int has_collisions = 1;
+
+ for (i = 0; i < Num_Strings; i++)
+ {
+	hash = compute_hash (i);
+	for (j = 0; j < i; j++)
+	 {
+	 if (hash != String_Tablej.hash)
+	 continue;
+
+	 /* Oops. We have a collision. tweak_hash_function will
+	 * adjust the hash table array to resolve this collision
+	 * and ensure that previous ones remain resolved.
+	 */
+	 if (-1 == tweak_hash_function (i, j))
+	 {
+		 has_collisions = 1;
+		 /* return -1; */
+	 }
+	 break;
+	 }
+ }
+
+ if (has_collisions == 0)
+ return 0;
+
+ has_collisions = 0;
+ /* Now check for collisions */
+ for (i = 0; i < Num_Strings; i++)
+ {
+	char *s = String_Tablei.name;
+	hash = compute_hash (i);
+
+	for (j = 0; j < i; j++)
+	 {
+	 if (hash != String_Tablej.hash)
+	 continue;
+
+	 has_collisions++;
+	 fprintf (stderr, "Collision: %s, %s\n", s, String_Table j.name);
+	 }
+ }
+
+ if (has_collisions)
+ return -1;
+
+ return 0;
+}
+
+static int sort_function (String_Table_Type *a, String_Table_Type *b)
+{
+ return b->freq_statistic - a->freq_statistic;
+}
+
+static void sort_strings (void)
+{
+ unsigned int i;
+ void (*qsort_fun) (String_Table_Type *, unsigned int,
+		 unsigned int, int (*)(String_Table_Type *, String_Table_Type *));
+
+ for (i = 0; i < Num_Strings; i++)
+ {
+	int f;
+	unsigned char *s;
+
+	f = 0;
+	s = (unsigned char *) String_Tablei.name;
+	while (*s != 0) f += Frequency_Table *s++;
+	String_Table i.freq_statistic = f;
+ }
+
+ qsort_fun = (void (*) (String_Table_Type *, unsigned int,
+			 unsigned int,
+			 int (*)(String_Table_Type *, String_Table_Type *)))
+ qsort;
+
+ qsort_fun (String_Table, Num_Strings, sizeof (String_Table_Type),
+	 sort_function);
+}
+
+int main (int argc, char **argv)
+{
+ char line256;
+ unsigned int count;
+ unsigned int min_char;
+ unsigned int max_char;
+ unsigned int min_len;
+ unsigned int max_len;
+ unsigned int i;
+
+ Tweak_Step_Size = 5;
+
+ if (isatty (0) || (argc > 2))
+ {
+	fprintf (stderr, "Usage: %s step-size < keywords > hash.c\n", argv0);
+	fprintf (stderr, " Default step-size is %u\n", Tweak_Step_Size);
+	return 1;
+ }
+
+ if (argc > 1)
+ {
+	if (1 != sscanf (argv1, "%u", &Tweak_Step_Size))
+	 Tweak_Step_Size = 5;
+
+	if ((Tweak_Step_Size % 2) == 0) Tweak_Step_Size++;
+ }
+
+ count = 0;
+ min_char = 255;
+ max_char = 0;
+ max_len = 0;
+ min_len = 0xFFFF;
+
+ while (NULL != fgets (line, sizeof (line), stdin))
+ {
+	char *s;
+	unsigned int len;
+	char *type;
+
+	if (*line == '%') continue;
+
+	if (count == 256)
+	 {
+	 fprintf (stderr, "Only 256 keywords permitted.\n");
+	 return 1;
+	 }
+
+	len = strlen (line);
+	if (len && (line len - 1 == '\n'))
+	 {
+	 len--;
+	 line len = 0;
+	 }
+
+	if (len == 0)
+	 continue;
+
+	s = malloc (len + 1);
+	if (s == NULL)
+	 {
+	 fprintf (stderr, "Malloc error.\n");
+	 return 1;
+	 }
+	strcpy (s, line);
+	String_Tablecount.name = s;
+
+	type = s;
+	while (*type && (*type != ' ') && (*type != '\t'))
+	 type++;
+
+	len = (unsigned int) (type - s);
+	String_Table count.len = len;
+	if (len > max_len) max_len = len;
+	if (len < min_len) min_len = len;
+
+	if (*type != 0)
+	 {
+	 *type++ = 0;
+	 while ((*type == ' ') || (*type == '\t'))
+	 type++;
+	 }
+
+	String_Table count.type = type;
+
+	for (i = 0; i < len; i++)
+	 {
+	 unsigned char ch;
+
+	 ch = (unsigned char) si;
+
+	 if (ch < min_char)
+	 min_char = ch;
+	 if (ch > max_char)
+	 max_char = ch;
+	 }
+
+	count++;
+ }
+
+ Max_String_Len = max_len;
+ Min_String_Len = min_len;
+
+ Num_Strings = count;
+ Max_Table_Value = 1;
+ while (Max_Table_Value < Num_Strings)
+ Max_Table_Value = Max_Table_Value << 1;
+
+ Max_Hash_Value = Max_Table_Value * Max_String_Len;
+
+ fprintf (stderr, "Theoretical Max_Table_Value: %u\n", Max_Table_Value);
+ fprintf (stderr, "Theoretical Max_Hash_Value: %u\n", Max_Hash_Value);
+
+ create_frequency_table (Num_Strings);
+ sort_strings ();
+
+ init_map (Char_Table_Map);
+ if (-1 == perfect_hash ())
+ {
+	fprintf (stderr, "Hash failed.\n");
+	return -1;
+ }
+
+ fprintf (stderr, "Success.\n");
+
+ fprintf (stdout, "/* Perfect hash generated by command line:\n *");
+ for (i = 0; i < (unsigned int)argc; i++)
+ fprintf (stdout, " %s", argvi);
+ fputs ("\n */\n", stdout);
+
+ write_map (Char_Table_Map);
+ return 0;
+}
+

_service:tar_scm:slang-2.3.2.tar.bz2/utf8 Added

_service:tar_scm:slang-2.3.2.tar.bz2/utf8/Makefile Added

_service:tar_scm:slang-2.3.2.tar.bz2/utf8/test_isxxx.c Added

@@ -0,0 +1,84 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <locale.h>
+
+#include <slang.h>
+
+#include <wctype.h>
+
+int main (int argc, char **argv)
+{
+ char * locale;
+ int i;
+#define VARIABLE(xxx) unsigned int sys_##xxx=0, sl_##xxx = 0
+ VARIABLE(lower);
+ VARIABLE(alpha);
+ VARIABLE(upper);
+ VARIABLE(graph);
+ VARIABLE(print);
+ VARIABLE(space);
+ VARIABLE(alnum);
+ VARIABLE(digit);
+ VARIABLE(xdigit);
+ VARIABLE(cntrl);
+ VARIABLE(punct);
+
+ if (NULL == (locale = setlocale (LC_ALL, "en_US.UTF-8")))
+ {
+	fprintf (stderr, "setlocale failed\n");
+	exit (1);
+ }
+
+ (void) SLutf8_enable (1);
+ fprintf (stdout, "locale = %s\n", locale);
+
+ for (i = 0; i <= 0x10FFFD; i++)
+ {
+#define TEST(xxx) \
+ if ((0 == isw##xxx(i)) != (0 == SLwchar_is##xxx(i))) \
+ fprintf (stderr, "Failed " #xxx "(0x%X) : libc:0x%X != slang:0x%X\n", \
+		 i, isw##xxx(i), SLwchar_is##xxx(i))
+
+	if (towupper (i) != SLwchar_toupper (i))
+	 fprintf (stderr, "towupper (0x%X) failed 0x%X vs 0x%lX\n",
+		 i, towupper(i), (unsigned long)SLwchar_toupper(i));
+	if (towlower (i) != SLwchar_tolower (i))
+	 fprintf (stderr, "towlower (0x%X) failed 0x%X vs 0x%lX\n",
+		 i, towlower(i), (unsigned long)SLwchar_tolower(i));
+#if 0
+#undef TEST
+#define TEST(xxx) \
+ sys_##xxx += (0 != isw##xxx(i)); sl_##xxx += (0 != SLwchar_is##xxx(i))
+
+	TEST(alpha);
+	TEST(print);
+	TEST(alnum);
+	TEST(graph);
+	TEST(lower);
+	TEST(punct);
+#endif
+	TEST(lower);
+	TEST(upper);
+	TEST(cntrl);
+	TEST(space);
+	TEST(xdigit);
+	TEST(digit);
+ }
+
+#define PRINT(xxx) \
+ fprintf (stdout, #xxx ": %7u %7u\n", sys_##xxx, sl_##xxx)
+
+ PRINT(lower);
+ PRINT(alpha);
+ PRINT(digit);
+ PRINT(print);
+ PRINT(alnum);
+ PRINT(cntrl);
+ PRINT(graph);
+ PRINT(punct);
+ PRINT(space);
+ PRINT(upper);
+ PRINT(xdigit);
+
+ return 0;
+}

_service:tar_scm:slang-2.3.2.tar.bz2/utf8/testfiles Added

_service:tar_scm:slang-2.3.2.tar.bz2/utf8/testfiles/UTF-8-demo.txt Added

@@ -0,0 +1,212 @@
+
+UTF-8 encoded sample plain-text file
+‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾
+
+Markus Kuhn ˈmaʳkʊs kuːn <http://www.cl.cam.ac.uk/~mgk25/> — 2002-07-25
+
+
+The ASCII compatible UTF-8 encoding used in this plain-text file
+is defined in Unicode, ISO 10646-1, and RFC 2279.
+
+
+Using Unicode/UTF-8, you can write in emails and source code things such as
+
+Mathematics and sciences:
+
+ ∮ E⋅da = Q, n → ∞, ∑ f(i) = ∏ g(i), ⎧⎡⎛┌─────┐⎞⎤⎫
+ ⎪⎢⎜│a²+b³ ⎟⎥⎪
+ ∀x∈ℝ: ⌈x⌉ = −⌊−x⌋, α ∧ ¬β = ¬(¬α ∨ β), ⎪⎢⎜│───── ⎟⎥⎪
+ ⎪⎢⎜⎷ c₈ ⎟⎥⎪
+ ℕ ⊆ ℕ₀ ⊂ ℤ ⊂ ℚ ⊂ ℝ ⊂ ℂ, ⎨⎢⎜ ⎟⎥⎬
+ ⎪⎢⎜ ∞ ⎟⎥⎪
+ ⊥ < a ≠ b ≡ c ≤ d ≪ ⊤ ⇒ (⟦A⟧ ⇔ ⟪B⟫), ⎪⎢⎜ ⎲ ⎟⎥⎪
+ ⎪⎢⎜ ⎳aⁱ-bⁱ⎟⎥⎪
+ 2H₂ + O₂ ⇌ 2H₂O, R = 4.7 kΩ, ⌀ 200 mm ⎩⎣⎝i=1 ⎠⎦⎭
+
+Linguistics and dictionaries:
+
+ ði ıntəˈnæʃənəl fəˈnɛtık əsoʊsiˈeıʃn
+ Y ˈʏpsilɔn, Yen jɛn, Yoga ˈjoːgɑ
+
+APL:
+
+ ((V⍳V)=⍳⍴V)/V←,V ⌷←⍳→⍴∆∇⊃‾⍎⍕⌈
+
+Nicer typography in plain text files:
+
+ ╔══════════════════════════════════════════╗
+ ║ ║
+ ║ • ‘single’ and “double” quotes ║
+ ║ ║
+ ║ • Curly apostrophes: “We’ve been here” ║
+ ║ ║
+ ║ • Latin-1 apostrophe and accents: '´` ║
+ ║ ║
+ ║ • ‚deutsche‘ „Anführungszeichen“ ║
+ ║ ║
+ ║ • †, ‡, ‰, •, 3–4, —, −5/+5, ™, … ║
+ ║ ║
+ ║ • ASCII safety test: 1lI|, 0OD, 8B ║
+ ║ ╭─────────╮ ║
+ ║ • the euro symbol: │ 14.95 € │ ║
+ ║ ╰─────────╯ ║
+ ╚══════════════════════════════════════════╝
+
+Combining characters:
+
+ STARGΛ̊TE SG-1, a = v̇ = r̈, a⃑ ⊥ b⃑
+
+Greek (in Polytonic):
+
+ The Greek anthem:
+
+ Σὲ γνωρίζω ἀπὸ τὴν κόψη
+ τοῦ σπαθιοῦ τὴν τρομερή,
+ σὲ γνωρίζω ἀπὸ τὴν ὄψη
+ ποὺ μὲ βία μετράει τὴ γῆ.
+
+ ᾿Απ᾿ τὰ κόκκαλα βγαλμένη
+ τῶν ῾Ελλήνων τὰ ἱερά
+ καὶ σὰν πρῶτα ἀνδρειωμένη
+ χαῖρε, ὦ χαῖρε, ᾿Ελευθεριά!
+
+ From a speech of Demosthenes in the 4th century BC:
+
+ Οὐχὶ ταὐτὰ παρίσταταί μοι γιγνώσκειν, ὦ ἄνδρες ᾿Αθηναῖοι,
+ ὅταν τ᾿ εἰς τὰ πράγματα ἀποβλέψω καὶ ὅταν πρὸς τοὺς
+ λόγους οὓς ἀκούω· τοὺς μὲν γὰρ λόγους περὶ τοῦ
+ τιμωρήσασθαι Φίλιππον ὁρῶ γιγνομένους, τὰ δὲ πράγματ᾿ 
+ εἰς τοῦτο προήκοντα, ὥσθ᾿ ὅπως μὴ πεισόμεθ᾿ αὐτοὶ
+ πρότερον κακῶς σκέψασθαι δέον. οὐδέν οὖν ἄλλο μοι δοκοῦσιν
+ οἱ τὰ τοιαῦτα λέγοντες ἢ τὴν ὑπόθεσιν, περὶ ἧς βουλεύεσθαι,
+ οὐχὶ τὴν οὖσαν παριστάντες ὑμῖν ἁμαρτάνειν. ἐγὼ δέ, ὅτι μέν
+ ποτ᾿ ἐξῆν τῇ πόλει καὶ τὰ αὑτῆς ἔχειν ἀσφαλῶς καὶ Φίλιππον
+ τιμωρήσασθαι, καὶ μάλ᾿ ἀκριβῶς οἶδα· ἐπ᾿ ἐμοῦ γάρ, οὐ πάλαι
+ γέγονεν ταῦτ᾿ ἀμφότερα· νῦν μέντοι πέπεισμαι τοῦθ᾿ ἱκανὸν
+ προλαβεῖν ἡμῖν εἶναι τὴν πρώτην, ὅπως τοὺς συμμάχους
+ σώσομεν. ἐὰν γὰρ τοῦτο βεβαίως ὑπάρξῃ, τότε καὶ περὶ τοῦ
+ τίνα τιμωρήσεταί τις καὶ ὃν τρόπον ἐξέσται σκοπεῖν· πρὶν δὲ
+ τὴν ἀρχὴν ὀρθῶς ὑποθέσθαι, μάταιον ἡγοῦμαι περὶ τῆς
+ τελευτῆς ὁντινοῦν ποιεῖσθαι λόγον.
+
+ Δημοσθένους, Γ´ ᾿Ολυνθιακὸς
+
+Georgian:
+
+ From a Unicode conference invitation:
+
+ გთხოვთ ახლავე გაიაროთ რეგისტრაცია Unicode-ის მეათე საერთაშორისო
+ კონფერენციაზე დასასწრებად, რომელიც გაიმართება 10-12 მარტს,
+ ქ. მაინცში, გერმანიაში. კონფერენცია შეჰკრებს ერთად მსოფლიოს
+ ექსპერტებს ისეთ დარგებში როგორიცაა ინტერნეტი და Unicode-ი,
+ ინტერნაციონალიზაცია და ლოკალიზაცია, Unicode-ის გამოყენება
+ ოპერაციულ სისტემებსა, და გამოყენებით პროგრამებში, შრიფტებში,
+ ტექსტების დამუშავებასა და მრავალენოვან კომპიუტერულ სისტემებში.
+
+Russian:
+
+ From a Unicode conference invitation:
+
+ Зарегистрируйтесь сейчас на Десятую Международную Конференцию по
+ Unicode, которая состоится 10-12 марта 1997 года в Майнце в Германии.
+ Конференция соберет широкий круг экспертов по вопросам глобального
+ Интернета и Unicode, локализации и интернационализации, воплощению и
+ применению Unicode в различных операционных системах и программных
+ приложениях, шрифтах, верстке и многоязычных компьютерных системах.
+
+Thai (UCS Level 2):
+
+ Excerpt from a poetry on The Romance of The Three Kingdoms (a Chinese
+ classic 'San Gua'):
+
+ ----------------------------|------------------------
+ ๏ แผ่นดินฮั่นเสื่อมโทรมแสนสังเวช พระปกเกศกองบู๊กู้ขึ้นใหม่
+ สิบสองกษัตริย์ก่อนหน้าแลถัดไป สององค์ไซร้โง่เขลาเบาปัญญา
+ ทรงนับถือขันทีเป็นที่พึ่ง บ้านเมืองจึงวิปริตเป็นนักหนา
+ โฮจิ๋นเรียกทัพทั่วหัวเมืองมา หมายจะฆ่ามดชั่วตัวสำคัญ
+ เหมือนขับไสไล่เสือจากเคหา รับหมาป่าเข้ามาเลยอาสัญ
+ ฝ่ายอ้องอุ้นยุแยกให้แตกกัน ใช้สาวนั้นเป็นชนวนชื่นชวนใจ
+ พลันลิฉุยกุยกีกลับก่อเหตุ ช่างอาเพศจริงหนาฟ้าร้องไห้
+ ต้องรบราฆ่าฟันจนบรรลัย ฤๅหาใครค้ำชูกู้บรรลังก์ ฯ
+
+ (The above is a two-column text. If combining characters are handled
+ correctly, the lines of the second column should be aligned with the
+ | character above.)
+
+Ethiopian:
+
+ Proverbs in the Amharic language:
+
+ ሰማይ አይታረስ ንጉሥ አይከሰስ።
+ ብላ ካለኝ እንደአባቴ በቆመጠኝ።
+ ጌጥ ያለቤቱ ቁምጥና ነው።
+ ደሀ በሕልሙ ቅቤ ባይጠጣ ንጣት በገደለው።
+ የአፍ ወለምታ በቅቤ አይታሽም።
+ አይጥ በበላ ዳዋ ተመታ።
+ ሲተረጉሙ ይደረግሙ።
+ ቀስ በቀስ፥ ዕንቁላል በእግሩ ይሄዳል።
+ ድር ቢያብር አንበሳ ያስር።
+ ሰው እንደቤቱ እንጅ እንደ ጉረቤቱ አይተዳደርም።
+ እግዜር የከፈተውን ጉሮሮ ሳይዘጋው አይድርም።
+ የጎረቤት ሌባ፥ ቢያዩት ይስቅ ባያዩት ያጠልቅ።
+ ሥራ ከመፍታት ልጄን ላፋታት።
+ ዓባይ ማደሪያ የለው፥ ግንድ ይዞ ይዞራል።
+ የእስላም አገሩ መካ የአሞራ አገሩ ዋርካ።
+ ተንጋሎ ቢተፉ ተመልሶ ባፉ።
+ ወዳጅህ ማር ቢሆን ጨርስህ አትላሰው።
+ እግርህን በፍራሽህ ልክ ዘርጋ።
+
+Runes:
+
+ ᚻᛖ ᚳᚹᚫᚦ ᚦᚫᛏ ᚻᛖ ᛒᚢᛞᛖ ᚩᚾ ᚦᚫᛗ ᛚᚪᚾᛞᛖ ᚾᚩᚱᚦᚹᛖᚪᚱᛞᚢᛗ ᚹᛁᚦ ᚦᚪ ᚹᛖᛥᚫ
+
+ (Old English, which transcribed into Latin reads 'He cwaeth that he
+ bude thaem lande northweardum with tha Westsae.' and means 'He said
+ that he lived in the northern land near the Western Sea.')
+
+Braille:
+
+ ⡌⠁⠧⠑ ⠼⠁⠒ ⡍⠜⠇⠑⠹⠰⠎ ⡣⠕⠌
+
+ ⡍⠜⠇⠑⠹ ⠺⠁⠎ ⠙⠑⠁⠙⠒ ⠞⠕ ⠃⠑⠛⠔ ⠺⠊⠹⠲ ⡹⠻⠑ ⠊⠎ ⠝⠕ ⠙⠳⠃⠞
+ ⠱⠁⠞⠑⠧⠻ ⠁⠃⠳⠞ ⠹⠁⠞⠲ ⡹⠑ ⠗⠑⠛⠊⠌⠻ ⠕⠋ ⠙⠊⠎ ⠃⠥⠗⠊⠁⠇ ⠺⠁⠎
+ ⠎⠊⠛⠝⠫ ⠃⠹ ⠹⠑ ⠊⠇⠻⠛⠹⠍⠁⠝⠂ ⠹⠑ ⠊⠇⠻⠅⠂ ⠹⠑ ⠥⠝⠙⠻⠞⠁⠅⠻⠂
+ ⠁⠝⠙ ⠹⠑ ⠡⠊⠑⠋ ⠍⠳⠗⠝⠻⠲ ⡎⠊⠗⠕⠕⠛⠑ ⠎⠊⠛⠝⠫ ⠊⠞⠲ ⡁⠝⠙
+ ⡎⠊⠗⠕⠕⠛⠑⠰⠎ ⠝⠁⠍⠑ ⠺⠁⠎ ⠛⠕⠕⠙ ⠥⠏⠕⠝ ⠰⡡⠁⠝⠛⠑⠂ ⠋⠕⠗ ⠁⠝⠹⠹⠔⠛ ⠙⠑ 
+ ⠡⠕⠎⠑ ⠞⠕ ⠏⠥⠞ ⠙⠊⠎ ⠙⠁⠝⠙ ⠞⠕⠲
+
+ ⡕⠇⠙ ⡍⠜⠇⠑⠹ ⠺⠁⠎ ⠁⠎ ⠙⠑⠁⠙ ⠁⠎ ⠁ ⠙⠕⠕⠗⠤⠝⠁⠊⠇⠲
+
+ ⡍⠔⠙⠖ ⡊ ⠙⠕⠝⠰⠞ ⠍⠑⠁⠝ ⠞⠕ ⠎⠁⠹ ⠹⠁⠞ ⡊ ⠅⠝⠪⠂ ⠕⠋ ⠍⠹
+ ⠪⠝ ⠅⠝⠪⠇⠫⠛⠑⠂ ⠱⠁⠞ ⠹⠻⠑ ⠊⠎ ⠏⠜⠞⠊⠊⠥⠇⠜⠇⠹ ⠙⠑⠁⠙ ⠁⠃⠳⠞
+ ⠁ ⠙⠕⠕⠗⠤⠝⠁⠊⠇⠲ ⡊ ⠍⠊⠣⠞ ⠙⠁⠧⠑ ⠃⠑⠲ ⠔⠊⠇⠔⠫⠂ ⠍⠹⠎⠑⠇⠋⠂ ⠞⠕
+ ⠗⠑⠛⠜⠙ ⠁ ⠊⠕⠋⠋⠔⠤⠝⠁⠊⠇ ⠁⠎ ⠹⠑ ⠙⠑⠁⠙⠑⠌ ⠏⠊⠑⠊⠑ ⠕⠋ ⠊⠗⠕⠝⠍⠕⠝⠛⠻⠹ 
+ ⠔ ⠹⠑ ⠞⠗⠁⠙⠑⠲ ⡃⠥⠞ ⠹⠑ ⠺⠊⠎⠙⠕⠍ ⠕⠋ ⠳⠗ ⠁⠝⠊⠑⠌⠕⠗⠎ 
+ ⠊⠎ ⠔ ⠹⠑ ⠎⠊⠍⠊⠇⠑⠆ ⠁⠝⠙ ⠍⠹ ⠥⠝⠙⠁⠇⠇⠪⠫ ⠙⠁⠝⠙⠎
+ ⠩⠁⠇⠇ ⠝⠕⠞ ⠙⠊⠌⠥⠗⠃ ⠊⠞⠂ ⠕⠗ ⠹⠑ ⡊⠳⠝⠞⠗⠹⠰⠎ ⠙⠕⠝⠑ ⠋⠕⠗⠲ ⡹⠳
+ ⠺⠊⠇⠇ ⠹⠻⠑⠋⠕⠗⠑ ⠏⠻⠍⠊⠞ ⠍⠑ ⠞⠕ ⠗⠑⠏⠑⠁⠞⠂ ⠑⠍⠏⠙⠁⠞⠊⠊⠁⠇⠇⠹⠂ ⠹⠁⠞
+ ⡍⠜⠇⠑⠹ ⠺⠁⠎ ⠁⠎ ⠙⠑⠁⠙ ⠁⠎ ⠁ ⠙⠕⠕⠗⠤⠝⠁⠊⠇⠲
+
+ (The first couple of paragraphs of "A Christmas Carol" by Dickens)
+
+Compact font selection example text:
+
+ ABCDEFGHIJKLMNOPQRSTUVWXYZ /0123456789
+ abcdefghijklmnopqrstuvwxyz £©µÀÆÖÞßéöÿ
+ –—‘“”„†•…‰™œŠŸž€ ΑΒΓΔΩαβγδω АБВГДабвгд
+ ∀∂∈ℝ∧∪≡∞ ↑↗↨↻⇣ ┐┼╔╘░►☺♀ ﬁ�⑀₂ἠḂӥẄɐː⍎אԱა
+
+Greetings in various languages:
+
+ Hello world, Καλημέρα κόσμε, コンニチハ
+
+Box drawing alignment tests: █
+ ▉
+ ╔══╦══╗ ┌──┬──┐ ╭──┬──╮ ╭──┬──╮ ┏━━┳━━┓ ┎┒┏┑ ╷ ╻ ┏┯┓ ┌┰┐ ▊ ╱╲╱╲╳╳╳
+ ║┌─╨─┐║ │╔═╧═╗│ │╒═╪═╕│ │╓─╁─╖│ ┃┌─╂─┐┃ ┗╃╄┙ ╶┼╴╺╋╸┠┼┨ ┝╋┥ ▋ ╲╱╲╱╳╳╳
+ ║│╲ ╱│║ │║ ║│ ││ │ ││ │║ ┃ ║│ ┃│ ╿ │┃ ┍╅╆┓ ╵ ╹ ┗┷┛ └┸┘ ▌ ╱╲╱╲╳╳╳
+ ╠╡ ╳ ╞╣ ├╢ ╟┤ ├┼─┼─┼┤ ├╫─╂─╫┤ ┣┿╾┼╼┿┫ ┕┛┖┚ ┌┄┄┐ ╎ ┏┅┅┓ ┋ ▍ ╲╱╲╱╳╳╳
+ ║│╱ ╲│║ │║ ║│ ││ │ ││ │║ ┃ ║│ ┃│ ╽ │┃ ░░▒▒▓▓██ ┊ ┆ ╎ ╏ ┇ ┋ ▎
+ ║└─╥─┘║ │╚═╤═╝│ │╘═╪═╛│ │╙─╀─╜│ ┃└─╂─┘┃ ░░▒▒▓▓██ ┊ ┆ ╎ ╏ ┇ ┋ ▏
+ ╚══╩══╝ └──┴──┘ ╰──┴──╯ ╰──┴──╯ ┗━━┻━━┛ ▗▄▖▛▀▜ └╌╌┘ ╎ ┗╍╍┛ ┋ ▁▂▃▄▅▆▇█
+ ▝▀▘▙▄▟

_service:tar_scm:slang-2.3.2.tar.bz2/utf8/testfiles/UTF-8-test.txt Added

_service:tar_scm:slang-2.3.2.tar.bz2/utf8/tools Added

_service:tar_scm:slang-2.3.2.tar.bz2/utf8/tools/EastAsianWidth.txt Added

@@ -0,0 +1,2382 @@
+# EastAsianWidth-10.0.0.txt
+# Date: 2017-03-08, 02:00:00 GMT KW, LI
+# © 2017 Unicode®, Inc.
+# Unicode and the Unicode Logo are registered trademarks of Unicode, Inc. in the U.S. and other countries.
+# For terms of use, see http://www.unicode.org/terms_of_use.html
+#
+# Unicode Character Database
+# For documentation, see http://www.unicode.org/reports/tr44/
+#
+# East_Asian_Width Property
+#
+# This file is an informative contributory data file in the
+# Unicode Character Database.
+#
+# The format is two fields separated by a semicolon.
+# Field 0: Unicode code point value or range of code point values
+# Field 1: East_Asian_Width property, consisting of one of the following values:
+# "A", "F", "H", "N", "Na", "W"
+# - All code points, assigned or unassigned, that are not listed
+# explicitly are given the value "N".
+# - The unassigned code points in the following blocks default to "W":
+# CJK Unified Ideographs Extension A: U+3400..U+4DBF
+# CJK Unified Ideographs: U+4E00..U+9FFF
+# CJK Compatibility Ideographs: U+F900..U+FAFF
+# - All undesignated code points in Planes 2 and 3, whether inside or
+# outside of allocated blocks, default to "W":
+# Plane 2: U+20000..U+2FFFD
+# Plane 3: U+30000..U+3FFFD
+#
+# Character ranges are specified as for other property files in the
+# Unicode Character Database.
+#
+# For legacy reasons, there are no spaces before or after the semicolon
+# which separates the two fields. The comments following the number sign
+# "#" list the General_Category property value or the L& alias of the
+# derived value LC, the Unicode character name or names, and, in lines
+# with ranges of code points, the code point count in square brackets.
+#
+# For more information, see UAX #11: East Asian Width,
+# at http://www.unicode.org/reports/tr11/
+#
+# @missing: 0000..10FFFF; N
+0000..001F;N # Cc 32 <control-0000>..<control-001F>
+0020;Na # Zs SPACE
+0021..0023;Na # Po 3 EXCLAMATION MARK..NUMBER SIGN
+0024;Na # Sc DOLLAR SIGN
+0025..0027;Na # Po 3 PERCENT SIGN..APOSTROPHE
+0028;Na # Ps LEFT PARENTHESIS
+0029;Na # Pe RIGHT PARENTHESIS
+002A;Na # Po ASTERISK
+002B;Na # Sm PLUS SIGN
+002C;Na # Po COMMA
+002D;Na # Pd HYPHEN-MINUS
+002E..002F;Na # Po 2 FULL STOP..SOLIDUS
+0030..0039;Na # Nd 10 DIGIT ZERO..DIGIT NINE
+003A..003B;Na # Po 2 COLON..SEMICOLON
+003C..003E;Na # Sm 3 LESS-THAN SIGN..GREATER-THAN SIGN
+003F..0040;Na # Po 2 QUESTION MARK..COMMERCIAL AT
+0041..005A;Na # Lu 26 LATIN CAPITAL LETTER A..LATIN CAPITAL LETTER Z
+005B;Na # Ps LEFT SQUARE BRACKET
+005C;Na # Po REVERSE SOLIDUS
+005D;Na # Pe RIGHT SQUARE BRACKET
+005E;Na # Sk CIRCUMFLEX ACCENT
+005F;Na # Pc LOW LINE
+0060;Na # Sk GRAVE ACCENT
+0061..007A;Na # Ll 26 LATIN SMALL LETTER A..LATIN SMALL LETTER Z
+007B;Na # Ps LEFT CURLY BRACKET
+007C;Na # Sm VERTICAL LINE
+007D;Na # Pe RIGHT CURLY BRACKET
+007E;Na # Sm TILDE
+007F;N # Cc <control-007F>
+0080..009F;N # Cc 32 <control-0080>..<control-009F>
+00A0;N # Zs NO-BREAK SPACE
+00A1;A # Po INVERTED EXCLAMATION MARK
+00A2..00A3;Na # Sc 2 CENT SIGN..POUND SIGN
+00A4;A # Sc CURRENCY SIGN
+00A5;Na # Sc YEN SIGN
+00A6;Na # So BROKEN BAR
+00A7;A # Po SECTION SIGN
+00A8;A # Sk DIAERESIS
+00A9;N # So COPYRIGHT SIGN
+00AA;A # Lo FEMININE ORDINAL INDICATOR
+00AB;N # Pi LEFT-POINTING DOUBLE ANGLE QUOTATION MARK
+00AC;Na # Sm NOT SIGN
+00AD;A # Cf SOFT HYPHEN
+00AE;A # So REGISTERED SIGN
+00AF;Na # Sk MACRON
+00B0;A # So DEGREE SIGN
+00B1;A # Sm PLUS-MINUS SIGN
+00B2..00B3;A # No 2 SUPERSCRIPT TWO..SUPERSCRIPT THREE
+00B4;A # Sk ACUTE ACCENT
+00B5;N # Ll MICRO SIGN
+00B6..00B7;A # Po 2 PILCROW SIGN..MIDDLE DOT
+00B8;A # Sk CEDILLA
+00B9;A # No SUPERSCRIPT ONE
+00BA;A # Lo MASCULINE ORDINAL INDICATOR
+00BB;N # Pf RIGHT-POINTING DOUBLE ANGLE QUOTATION MARK
+00BC..00BE;A # No 3 VULGAR FRACTION ONE QUARTER..VULGAR FRACTION THREE QUARTERS
+00BF;A # Po INVERTED QUESTION MARK
+00C0..00C5;N # Lu 6 LATIN CAPITAL LETTER A WITH GRAVE..LATIN CAPITAL LETTER A WITH RING ABOVE
+00C6;A # Lu LATIN CAPITAL LETTER AE
+00C7..00CF;N # Lu 9 LATIN CAPITAL LETTER C WITH CEDILLA..LATIN CAPITAL LETTER I WITH DIAERESIS
+00D0;A # Lu LATIN CAPITAL LETTER ETH
+00D1..00D6;N # Lu 6 LATIN CAPITAL LETTER N WITH TILDE..LATIN CAPITAL LETTER O WITH DIAERESIS
+00D7;A # Sm MULTIPLICATION SIGN
+00D8;A # Lu LATIN CAPITAL LETTER O WITH STROKE
+00D9..00DD;N # Lu 5 LATIN CAPITAL LETTER U WITH GRAVE..LATIN CAPITAL LETTER Y WITH ACUTE
+00DE..00E1;A # L& 4 LATIN CAPITAL LETTER THORN..LATIN SMALL LETTER A WITH ACUTE
+00E2..00E5;N # Ll 4 LATIN SMALL LETTER A WITH CIRCUMFLEX..LATIN SMALL LETTER A WITH RING ABOVE
+00E6;A # Ll LATIN SMALL LETTER AE
+00E7;N # Ll LATIN SMALL LETTER C WITH CEDILLA
+00E8..00EA;A # Ll 3 LATIN SMALL LETTER E WITH GRAVE..LATIN SMALL LETTER E WITH CIRCUMFLEX
+00EB;N # Ll LATIN SMALL LETTER E WITH DIAERESIS
+00EC..00ED;A # Ll 2 LATIN SMALL LETTER I WITH GRAVE..LATIN SMALL LETTER I WITH ACUTE
+00EE..00EF;N # Ll 2 LATIN SMALL LETTER I WITH CIRCUMFLEX..LATIN SMALL LETTER I WITH DIAERESIS
+00F0;A # Ll LATIN SMALL LETTER ETH
+00F1;N # Ll LATIN SMALL LETTER N WITH TILDE
+00F2..00F3;A # Ll 2 LATIN SMALL LETTER O WITH GRAVE..LATIN SMALL LETTER O WITH ACUTE
+00F4..00F6;N # Ll 3 LATIN SMALL LETTER O WITH CIRCUMFLEX..LATIN SMALL LETTER O WITH DIAERESIS
+00F7;A # Sm DIVISION SIGN
+00F8..00FA;A # Ll 3 LATIN SMALL LETTER O WITH STROKE..LATIN SMALL LETTER U WITH ACUTE
+00FB;N # Ll LATIN SMALL LETTER U WITH CIRCUMFLEX
+00FC;A # Ll LATIN SMALL LETTER U WITH DIAERESIS
+00FD;N # Ll LATIN SMALL LETTER Y WITH ACUTE
+00FE;A # Ll LATIN SMALL LETTER THORN
+00FF;N # L& LATIN SMALL LETTER Y WITH DIAERESIS
+0100;N # Lu LATIN CAPITAL LETTER A WITH MACRON
+0101;A # Ll LATIN SMALL LETTER A WITH MACRON
+0102..0110;N # L& 15 LATIN CAPITAL LETTER A WITH BREVE..LATIN CAPITAL LETTER D WITH STROKE
+0111;A # Ll LATIN SMALL LETTER D WITH STROKE
+0112;N # Lu LATIN CAPITAL LETTER E WITH MACRON
+0113;A # Ll LATIN SMALL LETTER E WITH MACRON
+0114..011A;N # L& 7 LATIN CAPITAL LETTER E WITH BREVE..LATIN CAPITAL LETTER E WITH CARON
+011B;A # Ll LATIN SMALL LETTER E WITH CARON
+011C..0125;N # L& 10 LATIN CAPITAL LETTER G WITH CIRCUMFLEX..LATIN SMALL LETTER H WITH CIRCUMFLEX
+0126..0127;A # L& 2 LATIN CAPITAL LETTER H WITH STROKE..LATIN SMALL LETTER H WITH STROKE
+0128..012A;N # L& 3 LATIN CAPITAL LETTER I WITH TILDE..LATIN CAPITAL LETTER I WITH MACRON
+012B;A # Ll LATIN SMALL LETTER I WITH MACRON
+012C..0130;N # L& 5 LATIN CAPITAL LETTER I WITH BREVE..LATIN CAPITAL LETTER I WITH DOT ABOVE
+0131..0133;A # L& 3 LATIN SMALL LETTER DOTLESS I..LATIN SMALL LIGATURE IJ
+0134..0137;N # L& 4 LATIN CAPITAL LETTER J WITH CIRCUMFLEX..LATIN SMALL LETTER K WITH CEDILLA
+0138;A # Ll LATIN SMALL LETTER KRA
+0139..013E;N # L& 6 LATIN CAPITAL LETTER L WITH ACUTE..LATIN SMALL LETTER L WITH CARON
+013F..0142;A # L& 4 LATIN CAPITAL LETTER L WITH MIDDLE DOT..LATIN SMALL LETTER L WITH STROKE
+0143;N # Lu LATIN CAPITAL LETTER N WITH ACUTE
+0144;A # Ll LATIN SMALL LETTER N WITH ACUTE
+0145..0147;N # L& 3 LATIN CAPITAL LETTER N WITH CEDILLA..LATIN CAPITAL LETTER N WITH CARON
+0148..014B;A # L& 4 LATIN SMALL LETTER N WITH CARON..LATIN SMALL LETTER ENG
+014C;N # Lu LATIN CAPITAL LETTER O WITH MACRON
+014D;A # Ll LATIN SMALL LETTER O WITH MACRON
+014E..0151;N # L& 4 LATIN CAPITAL LETTER O WITH BREVE..LATIN SMALL LETTER O WITH DOUBLE ACUTE
+0152..0153;A # L& 2 LATIN CAPITAL LIGATURE OE..LATIN SMALL LIGATURE OE
+0154..0165;N # L& 18 LATIN CAPITAL LETTER R WITH ACUTE..LATIN SMALL LETTER T WITH CARON
+0166..0167;A # L& 2 LATIN CAPITAL LETTER T WITH STROKE..LATIN SMALL LETTER T WITH STROKE
+0168..016A;N # L& 3 LATIN CAPITAL LETTER U WITH TILDE..LATIN CAPITAL LETTER U WITH MACRON
+016B;A # Ll LATIN SMALL LETTER U WITH MACRON
+016C..017F;N # L& 20 LATIN CAPITAL LETTER U WITH BREVE..LATIN SMALL LETTER LONG S
+0180..01BA;N # L& 59 LATIN SMALL LETTER B WITH STROKE..LATIN SMALL LETTER EZH WITH TAIL
+01BB;N # Lo LATIN LETTER TWO WITH STROKE
+01BC..01BF;N # L& 4 LATIN CAPITAL LETTER TONE FIVE..LATIN LETTER WYNN
+01C0..01C3;N # Lo 4 LATIN LETTER DENTAL CLICK..LATIN LETTER RETROFLEX CLICK
+01C4..01CD;N # L& 10 LATIN CAPITAL LETTER DZ WITH CARON..LATIN CAPITAL LETTER A WITH CARON
+01CE;A # Ll LATIN SMALL LETTER A WITH CARON
+01CF;N # Lu LATIN CAPITAL LETTER I WITH CARON
+01D0;A # Ll LATIN SMALL LETTER I WITH CARON
+01D1;N # Lu LATIN CAPITAL LETTER O WITH CARON
+01D2;A # Ll LATIN SMALL LETTER O WITH CARON
+01D3;N # Lu LATIN CAPITAL LETTER U WITH CARON
+01D4;A # Ll LATIN SMALL LETTER U WITH CARON
+01D5;N # Lu LATIN CAPITAL LETTER U WITH DIAERESIS AND MACRON
+01D6;A # Ll LATIN SMALL LETTER U WITH DIAERESIS AND MACRON
+01D7;N # Lu LATIN CAPITAL LETTER U WITH DIAERESIS AND ACUTE
+01D8;A # Ll LATIN SMALL LETTER U WITH DIAERESIS AND ACUTE
+01D9;N # Lu LATIN CAPITAL LETTER U WITH DIAERESIS AND CARON
+01DA;A # Ll LATIN SMALL LETTER U WITH DIAERESIS AND CARON
+01DB;N # Lu LATIN CAPITAL LETTER U WITH DIAERESIS AND GRAVE
+01DC;A # Ll LATIN SMALL LETTER U WITH DIAERESIS AND GRAVE
+01DD..024F;N # L& 115 LATIN SMALL LETTER TURNED E..LATIN SMALL LETTER Y WITH STROKE
+0250;N # Ll LATIN SMALL LETTER TURNED A
+0251;A # Ll LATIN SMALL LETTER ALPHA
+0252..0260;N # Ll 15 LATIN SMALL LETTER TURNED ALPHA..LATIN SMALL LETTER G WITH HOOK
+0261;A # Ll LATIN SMALL LETTER SCRIPT G
+0262..0293;N # Ll 50 LATIN LETTER SMALL CAPITAL G..LATIN SMALL LETTER EZH WITH CURL
+0294;N # Lo LATIN LETTER GLOTTAL STOP
+0295..02AF;N # Ll 27 LATIN LETTER PHARYNGEAL VOICED FRICATIVE..LATIN SMALL LETTER TURNED H WITH FISHHOOK AND TAIL
+02B0..02C1;N # Lm 18 MODIFIER LETTER SMALL H..MODIFIER LETTER REVERSED GLOTTAL STOP
+02C2..02C3;N # Sk 2 MODIFIER LETTER LEFT ARROWHEAD..MODIFIER LETTER RIGHT ARROWHEAD
+02C4;A # Sk MODIFIER LETTER UP ARROWHEAD
+02C5;N # Sk MODIFIER LETTER DOWN ARROWHEAD
+02C6;N # Lm MODIFIER LETTER CIRCUMFLEX ACCENT
+02C7;A # Lm CARON
+02C8;N # Lm MODIFIER LETTER VERTICAL LINE
+02C9..02CB;A # Lm 3 MODIFIER LETTER MACRON..MODIFIER LETTER GRAVE ACCENT
+02CC;N # Lm MODIFIER LETTER LOW VERTICAL LINE
+02CD;A # Lm MODIFIER LETTER LOW MACRON
+02CE..02CF;N # Lm 2 MODIFIER LETTER LOW GRAVE ACCENT..MODIFIER LETTER LOW ACUTE ACCENT
+02D0;A # Lm MODIFIER LETTER TRIANGULAR COLON
+02D1;N # Lm MODIFIER LETTER HALF TRIANGULAR COLON
+02D2..02D7;N # Sk 6 MODIFIER LETTER CENTRED RIGHT HALF RING..MODIFIER LETTER MINUS SIGN
+02D8..02DB;A # Sk 4 BREVE..OGONEK
+02DC;N # Sk SMALL TILDE
+02DD;A # Sk DOUBLE ACUTE ACCENT
+02DE;N # Sk MODIFIER LETTER RHOTIC HOOK
+02DF;A # Sk MODIFIER LETTER CROSS ACCENT
+02E0..02E4;N # Lm 5 MODIFIER LETTER SMALL GAMMA..MODIFIER LETTER SMALL REVERSED GLOTTAL STOP
+02E5..02EB;N # Sk 7 MODIFIER LETTER EXTRA-HIGH TONE BAR..MODIFIER LETTER YANG DEPARTING TONE MARK
+02EC;N # Lm MODIFIER LETTER VOICING
+02ED;N # Sk MODIFIER LETTER UNASPIRATED
+02EE;N # Lm MODIFIER LETTER DOUBLE APOSTROPHE
+02EF..02FF;N # Sk 17 MODIFIER LETTER LOW DOWN ARROWHEAD..MODIFIER LETTER LOW LEFT ARROW
+0300..036F;A # Mn 112 COMBINING GRAVE ACCENT..COMBINING LATIN SMALL LETTER X
+0370..0373;N # L& 4 GREEK CAPITAL LETTER HETA..GREEK SMALL LETTER ARCHAIC SAMPI
+0374;N # Lm GREEK NUMERAL SIGN
+0375;N # Sk GREEK LOWER NUMERAL SIGN
+0376..0377;N # L& 2 GREEK CAPITAL LETTER PAMPHYLIAN DIGAMMA..GREEK SMALL LETTER PAMPHYLIAN DIGAMMA
+037A;N # Lm GREEK YPOGEGRAMMENI
+037B..037D;N # Ll 3 GREEK SMALL REVERSED LUNATE SIGMA SYMBOL..GREEK SMALL REVERSED DOTTED LUNATE SIGMA SYMBOL
+037E;N # Po GREEK QUESTION MARK
+037F;N # Lu GREEK CAPITAL LETTER YOT
+0384..0385;N # Sk 2 GREEK TONOS..GREEK DIALYTIKA TONOS
+0386;N # Lu GREEK CAPITAL LETTER ALPHA WITH TONOS
+0387;N # Po GREEK ANO TELEIA
+0388..038A;N # Lu 3 GREEK CAPITAL LETTER EPSILON WITH TONOS..GREEK CAPITAL LETTER IOTA WITH TONOS
+038C;N # Lu GREEK CAPITAL LETTER OMICRON WITH TONOS
+038E..0390;N # L& 3 GREEK CAPITAL LETTER UPSILON WITH TONOS..GREEK SMALL LETTER IOTA WITH DIALYTIKA AND TONOS
+0391..03A1;A # Lu 17 GREEK CAPITAL LETTER ALPHA..GREEK CAPITAL LETTER RHO
+03A3..03A9;A # Lu 7 GREEK CAPITAL LETTER SIGMA..GREEK CAPITAL LETTER OMEGA
+03AA..03B0;N # L& 7 GREEK CAPITAL LETTER IOTA WITH DIALYTIKA..GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND TONOS
+03B1..03C1;A # Ll 17 GREEK SMALL LETTER ALPHA..GREEK SMALL LETTER RHO
+03C2;N # Ll GREEK SMALL LETTER FINAL SIGMA
+03C3..03C9;A # Ll 7 GREEK SMALL LETTER SIGMA..GREEK SMALL LETTER OMEGA
+03CA..03F5;N # L& 44 GREEK SMALL LETTER IOTA WITH DIALYTIKA..GREEK LUNATE EPSILON SYMBOL
+03F6;N # Sm GREEK REVERSED LUNATE EPSILON SYMBOL
+03F7..03FF;N # L& 9 GREEK CAPITAL LETTER SHO..GREEK CAPITAL REVERSED DOTTED LUNATE SIGMA SYMBOL
+0400;N # Lu CYRILLIC CAPITAL LETTER IE WITH GRAVE
+0401;A # Lu CYRILLIC CAPITAL LETTER IO
+0402..040F;N # Lu 14 CYRILLIC CAPITAL LETTER DJE..CYRILLIC CAPITAL LETTER DZHE
+0410..044F;A # L& 64 CYRILLIC CAPITAL LETTER A..CYRILLIC SMALL LETTER YA
+0450;N # Ll CYRILLIC SMALL LETTER IE WITH GRAVE
+0451;A # Ll CYRILLIC SMALL LETTER IO
+0452..0481;N # L& 48 CYRILLIC SMALL LETTER DJE..CYRILLIC SMALL LETTER KOPPA
+0482;N # So CYRILLIC THOUSANDS SIGN
+0483..0487;N # Mn 5 COMBINING CYRILLIC TITLO..COMBINING CYRILLIC POKRYTIE
+0488..0489;N # Me 2 COMBINING CYRILLIC HUNDRED THOUSANDS SIGN..COMBINING CYRILLIC MILLIONS SIGN
+048A..04FF;N # L& 118 CYRILLIC CAPITAL LETTER SHORT I WITH TAIL..CYRILLIC SMALL LETTER HA WITH STROKE
+0500..052F;N # L& 48 CYRILLIC CAPITAL LETTER KOMI DE..CYRILLIC SMALL LETTER EL WITH DESCENDER
+0531..0556;N # Lu 38 ARMENIAN CAPITAL LETTER AYB..ARMENIAN CAPITAL LETTER FEH
+0559;N # Lm ARMENIAN MODIFIER LETTER LEFT HALF RING
+055A..055F;N # Po 6 ARMENIAN APOSTROPHE..ARMENIAN ABBREVIATION MARK
+0561..0587;N # Ll 39 ARMENIAN SMALL LETTER AYB..ARMENIAN SMALL LIGATURE ECH YIWN
+0589;N # Po ARMENIAN FULL STOP
+058A;N # Pd ARMENIAN HYPHEN
+058D..058E;N # So 2 RIGHT-FACING ARMENIAN ETERNITY SIGN..LEFT-FACING ARMENIAN ETERNITY SIGN
+058F;N # Sc ARMENIAN DRAM SIGN
+0591..05BD;N # Mn 45 HEBREW ACCENT ETNAHTA..HEBREW POINT METEG
+05BE;N # Pd HEBREW PUNCTUATION MAQAF
+05BF;N # Mn HEBREW POINT RAFE
+05C0;N # Po HEBREW PUNCTUATION PASEQ
+05C1..05C2;N # Mn 2 HEBREW POINT SHIN DOT..HEBREW POINT SIN DOT
+05C3;N # Po HEBREW PUNCTUATION SOF PASUQ
+05C4..05C5;N # Mn 2 HEBREW MARK UPPER DOT..HEBREW MARK LOWER DOT
+05C6;N # Po HEBREW PUNCTUATION NUN HAFUKHA
+05C7;N # Mn HEBREW POINT QAMATS QATAN
+05D0..05EA;N # Lo 27 HEBREW LETTER ALEF..HEBREW LETTER TAV
+05F0..05F2;N # Lo 3 HEBREW LIGATURE YIDDISH DOUBLE VAV..HEBREW LIGATURE YIDDISH DOUBLE YOD
+05F3..05F4;N # Po 2 HEBREW PUNCTUATION GERESH..HEBREW PUNCTUATION GERSHAYIM
+0600..0605;N # Cf 6 ARABIC NUMBER SIGN..ARABIC NUMBER MARK ABOVE
+0606..0608;N # Sm 3 ARABIC-INDIC CUBE ROOT..ARABIC RAY
+0609..060A;N # Po 2 ARABIC-INDIC PER MILLE SIGN..ARABIC-INDIC PER TEN THOUSAND SIGN
+060B;N # Sc AFGHANI SIGN
+060C..060D;N # Po 2 ARABIC COMMA..ARABIC DATE SEPARATOR
+060E..060F;N # So 2 ARABIC POETIC VERSE SIGN..ARABIC SIGN MISRA
+0610..061A;N # Mn 11 ARABIC SIGN SALLALLAHOU ALAYHE WASSALLAM..ARABIC SMALL KASRA
+061B;N # Po ARABIC SEMICOLON
+061C;N # Cf ARABIC LETTER MARK
+061E..061F;N # Po 2 ARABIC TRIPLE DOT PUNCTUATION MARK..ARABIC QUESTION MARK
+0620..063F;N # Lo 32 ARABIC LETTER KASHMIRI YEH..ARABIC LETTER FARSI YEH WITH THREE DOTS ABOVE
+0640;N # Lm ARABIC TATWEEL
+0641..064A;N # Lo 10 ARABIC LETTER FEH..ARABIC LETTER YEH
+064B..065F;N # Mn 21 ARABIC FATHATAN..ARABIC WAVY HAMZA BELOW
+0660..0669;N # Nd 10 ARABIC-INDIC DIGIT ZERO..ARABIC-INDIC DIGIT NINE
+066A..066D;N # Po 4 ARABIC PERCENT SIGN..ARABIC FIVE POINTED STAR
+066E..066F;N # Lo 2 ARABIC LETTER DOTLESS BEH..ARABIC LETTER DOTLESS QAF
+0670;N # Mn ARABIC LETTER SUPERSCRIPT ALEF
+0671..06D3;N # Lo 99 ARABIC LETTER ALEF WASLA..ARABIC LETTER YEH BARREE WITH HAMZA ABOVE
+06D4;N # Po ARABIC FULL STOP
+06D5;N # Lo ARABIC LETTER AE
+06D6..06DC;N # Mn 7 ARABIC SMALL HIGH LIGATURE SAD WITH LAM WITH ALEF MAKSURA..ARABIC SMALL HIGH SEEN
+06DD;N # Cf ARABIC END OF AYAH
+06DE;N # So ARABIC START OF RUB EL HIZB
+06DF..06E4;N # Mn 6 ARABIC SMALL HIGH ROUNDED ZERO..ARABIC SMALL HIGH MADDA
+06E5..06E6;N # Lm 2 ARABIC SMALL WAW..ARABIC SMALL YEH
+06E7..06E8;N # Mn 2 ARABIC SMALL HIGH YEH..ARABIC SMALL HIGH NOON
+06E9;N # So ARABIC PLACE OF SAJDAH
+06EA..06ED;N # Mn 4 ARABIC EMPTY CENTRE LOW STOP..ARABIC SMALL LOW MEEM
+06EE..06EF;N # Lo 2 ARABIC LETTER DAL WITH INVERTED V..ARABIC LETTER REH WITH INVERTED V
+06F0..06F9;N # Nd 10 EXTENDED ARABIC-INDIC DIGIT ZERO..EXTENDED ARABIC-INDIC DIGIT NINE
+06FA..06FC;N # Lo 3 ARABIC LETTER SHEEN WITH DOT BELOW..ARABIC LETTER GHAIN WITH DOT BELOW
+06FD..06FE;N # So 2 ARABIC SIGN SINDHI AMPERSAND..ARABIC SIGN SINDHI POSTPOSITION MEN
+06FF;N # Lo ARABIC LETTER HEH WITH INVERTED V
+0700..070D;N # Po 14 SYRIAC END OF PARAGRAPH..SYRIAC HARKLEAN ASTERISCUS
+070F;N # Cf SYRIAC ABBREVIATION MARK
+0710;N # Lo SYRIAC LETTER ALAPH
+0711;N # Mn SYRIAC LETTER SUPERSCRIPT ALAPH
+0712..072F;N # Lo 30 SYRIAC LETTER BETH..SYRIAC LETTER PERSIAN DHALATH
+0730..074A;N # Mn 27 SYRIAC PTHAHA ABOVE..SYRIAC BARREKH
+074D..074F;N # Lo 3 SYRIAC LETTER SOGDIAN ZHAIN..SYRIAC LETTER SOGDIAN FE
+0750..077F;N # Lo 48 ARABIC LETTER BEH WITH THREE DOTS HORIZONTALLY BELOW..ARABIC LETTER KAF WITH TWO DOTS ABOVE
+0780..07A5;N # Lo 38 THAANA LETTER HAA..THAANA LETTER WAAVU
+07A6..07B0;N # Mn 11 THAANA ABAFILI..THAANA SUKUN
+07B1;N # Lo THAANA LETTER NAA
+07C0..07C9;N # Nd 10 NKO DIGIT ZERO..NKO DIGIT NINE
+07CA..07EA;N # Lo 33 NKO LETTER A..NKO LETTER JONA RA
+07EB..07F3;N # Mn 9 NKO COMBINING SHORT HIGH TONE..NKO COMBINING DOUBLE DOT ABOVE
+07F4..07F5;N # Lm 2 NKO HIGH TONE APOSTROPHE..NKO LOW TONE APOSTROPHE
+07F6;N # So NKO SYMBOL OO DENNEN
+07F7..07F9;N # Po 3 NKO SYMBOL GBAKURUNEN..NKO EXCLAMATION MARK
+07FA;N # Lm NKO LAJANYALAN
+0800..0815;N # Lo 22 SAMARITAN LETTER ALAF..SAMARITAN LETTER TAAF
+0816..0819;N # Mn 4 SAMARITAN MARK IN..SAMARITAN MARK DAGESH
+081A;N # Lm SAMARITAN MODIFIER LETTER EPENTHETIC YUT
+081B..0823;N # Mn 9 SAMARITAN MARK EPENTHETIC YUT..SAMARITAN VOWEL SIGN A
+0824;N # Lm SAMARITAN MODIFIER LETTER SHORT A
+0825..0827;N # Mn 3 SAMARITAN VOWEL SIGN SHORT A..SAMARITAN VOWEL SIGN U
+0828;N # Lm SAMARITAN MODIFIER LETTER I
+0829..082D;N # Mn 5 SAMARITAN VOWEL SIGN LONG I..SAMARITAN MARK NEQUDAA
+0830..083E;N # Po 15 SAMARITAN PUNCTUATION NEQUDAA..SAMARITAN PUNCTUATION ANNAAU
+0840..0858;N # Lo 25 MANDAIC LETTER HALQA..MANDAIC LETTER AIN
+0859..085B;N # Mn 3 MANDAIC AFFRICATION MARK..MANDAIC GEMINATION MARK
+085E;N # Po MANDAIC PUNCTUATION
+0860..086A;N # Lo 11 SYRIAC LETTER MALAYALAM NGA..SYRIAC LETTER MALAYALAM SSA
+08A0..08B4;N # Lo 21 ARABIC LETTER BEH WITH SMALL V BELOW..ARABIC LETTER KAF WITH DOT BELOW
+08B6..08BD;N # Lo 8 ARABIC LETTER BEH WITH SMALL MEEM ABOVE..ARABIC LETTER AFRICAN NOON
+08D4..08E1;N # Mn 14 ARABIC SMALL HIGH WORD AR-RUB..ARABIC SMALL HIGH SIGN SAFHA
+08E2;N # Cf ARABIC DISPUTED END OF AYAH
+08E3..08FF;N # Mn 29 ARABIC TURNED DAMMA BELOW..ARABIC MARK SIDEWAYS NOON GHUNNA
+0900..0902;N # Mn 3 DEVANAGARI SIGN INVERTED CANDRABINDU..DEVANAGARI SIGN ANUSVARA
+0903;N # Mc DEVANAGARI SIGN VISARGA
+0904..0939;N # Lo 54 DEVANAGARI LETTER SHORT A..DEVANAGARI LETTER HA
+093A;N # Mn DEVANAGARI VOWEL SIGN OE
+093B;N # Mc DEVANAGARI VOWEL SIGN OOE
+093C;N # Mn DEVANAGARI SIGN NUKTA
+093D;N # Lo DEVANAGARI SIGN AVAGRAHA
+093E..0940;N # Mc 3 DEVANAGARI VOWEL SIGN AA..DEVANAGARI VOWEL SIGN II
+0941..0948;N # Mn 8 DEVANAGARI VOWEL SIGN U..DEVANAGARI VOWEL SIGN AI
+0949..094C;N # Mc 4 DEVANAGARI VOWEL SIGN CANDRA O..DEVANAGARI VOWEL SIGN AU
+094D;N # Mn DEVANAGARI SIGN VIRAMA
+094E..094F;N # Mc 2 DEVANAGARI VOWEL SIGN PRISHTHAMATRA E..DEVANAGARI VOWEL SIGN AW
+0950;N # Lo DEVANAGARI OM
+0951..0957;N # Mn 7 DEVANAGARI STRESS SIGN UDATTA..DEVANAGARI VOWEL SIGN UUE
+0958..0961;N # Lo 10 DEVANAGARI LETTER QA..DEVANAGARI LETTER VOCALIC LL
+0962..0963;N # Mn 2 DEVANAGARI VOWEL SIGN VOCALIC L..DEVANAGARI VOWEL SIGN VOCALIC LL
+0964..0965;N # Po 2 DEVANAGARI DANDA..DEVANAGARI DOUBLE DANDA
+0966..096F;N # Nd 10 DEVANAGARI DIGIT ZERO..DEVANAGARI DIGIT NINE
+0970;N # Po DEVANAGARI ABBREVIATION SIGN
+0971;N # Lm DEVANAGARI SIGN HIGH SPACING DOT
+0972..097F;N # Lo 14 DEVANAGARI LETTER CANDRA A..DEVANAGARI LETTER BBA
+0980;N # Lo BENGALI ANJI
+0981;N # Mn BENGALI SIGN CANDRABINDU
+0982..0983;N # Mc 2 BENGALI SIGN ANUSVARA..BENGALI SIGN VISARGA
+0985..098C;N # Lo 8 BENGALI LETTER A..BENGALI LETTER VOCALIC L
+098F..0990;N # Lo 2 BENGALI LETTER E..BENGALI LETTER AI
+0993..09A8;N # Lo 22 BENGALI LETTER O..BENGALI LETTER NA
+09AA..09B0;N # Lo 7 BENGALI LETTER PA..BENGALI LETTER RA
+09B2;N # Lo BENGALI LETTER LA
+09B6..09B9;N # Lo 4 BENGALI LETTER SHA..BENGALI LETTER HA
+09BC;N # Mn BENGALI SIGN NUKTA
+09BD;N # Lo BENGALI SIGN AVAGRAHA
+09BE..09C0;N # Mc 3 BENGALI VOWEL SIGN AA..BENGALI VOWEL SIGN II
+09C1..09C4;N # Mn 4 BENGALI VOWEL SIGN U..BENGALI VOWEL SIGN VOCALIC RR
+09C7..09C8;N # Mc 2 BENGALI VOWEL SIGN E..BENGALI VOWEL SIGN AI
+09CB..09CC;N # Mc 2 BENGALI VOWEL SIGN O..BENGALI VOWEL SIGN AU
+09CD;N # Mn BENGALI SIGN VIRAMA
+09CE;N # Lo BENGALI LETTER KHANDA TA
+09D7;N # Mc BENGALI AU LENGTH MARK
+09DC..09DD;N # Lo 2 BENGALI LETTER RRA..BENGALI LETTER RHA
+09DF..09E1;N # Lo 3 BENGALI LETTER YYA..BENGALI LETTER VOCALIC LL
+09E2..09E3;N # Mn 2 BENGALI VOWEL SIGN VOCALIC L..BENGALI VOWEL SIGN VOCALIC LL
+09E6..09EF;N # Nd 10 BENGALI DIGIT ZERO..BENGALI DIGIT NINE
+09F0..09F1;N # Lo 2 BENGALI LETTER RA WITH MIDDLE DIAGONAL..BENGALI LETTER RA WITH LOWER DIAGONAL
+09F2..09F3;N # Sc 2 BENGALI RUPEE MARK..BENGALI RUPEE SIGN
+09F4..09F9;N # No 6 BENGALI CURRENCY NUMERATOR ONE..BENGALI CURRENCY DENOMINATOR SIXTEEN
+09FA;N # So BENGALI ISSHAR
+09FB;N # Sc BENGALI GANDA MARK
+09FC;N # Lo BENGALI LETTER VEDIC ANUSVARA
+09FD;N # Po BENGALI ABBREVIATION SIGN
+0A01..0A02;N # Mn 2 GURMUKHI SIGN ADAK BINDI..GURMUKHI SIGN BINDI
+0A03;N # Mc GURMUKHI SIGN VISARGA
+0A05..0A0A;N # Lo 6 GURMUKHI LETTER A..GURMUKHI LETTER UU
+0A0F..0A10;N # Lo 2 GURMUKHI LETTER EE..GURMUKHI LETTER AI
+0A13..0A28;N # Lo 22 GURMUKHI LETTER OO..GURMUKHI LETTER NA
+0A2A..0A30;N # Lo 7 GURMUKHI LETTER PA..GURMUKHI LETTER RA
+0A32..0A33;N # Lo 2 GURMUKHI LETTER LA..GURMUKHI LETTER LLA
+0A35..0A36;N # Lo 2 GURMUKHI LETTER VA..GURMUKHI LETTER SHA
+0A38..0A39;N # Lo 2 GURMUKHI LETTER SA..GURMUKHI LETTER HA
+0A3C;N # Mn GURMUKHI SIGN NUKTA
+0A3E..0A40;N # Mc 3 GURMUKHI VOWEL SIGN AA..GURMUKHI VOWEL SIGN II
+0A41..0A42;N # Mn 2 GURMUKHI VOWEL SIGN U..GURMUKHI VOWEL SIGN UU
+0A47..0A48;N # Mn 2 GURMUKHI VOWEL SIGN EE..GURMUKHI VOWEL SIGN AI
+0A4B..0A4D;N # Mn 3 GURMUKHI VOWEL SIGN OO..GURMUKHI SIGN VIRAMA
+0A51;N # Mn GURMUKHI SIGN UDAAT
+0A59..0A5C;N # Lo 4 GURMUKHI LETTER KHHA..GURMUKHI LETTER RRA
+0A5E;N # Lo GURMUKHI LETTER FA
+0A66..0A6F;N # Nd 10 GURMUKHI DIGIT ZERO..GURMUKHI DIGIT NINE
+0A70..0A71;N # Mn 2 GURMUKHI TIPPI..GURMUKHI ADDAK
+0A72..0A74;N # Lo 3 GURMUKHI IRI..GURMUKHI EK ONKAR
+0A75;N # Mn GURMUKHI SIGN YAKASH
+0A81..0A82;N # Mn 2 GUJARATI SIGN CANDRABINDU..GUJARATI SIGN ANUSVARA
+0A83;N # Mc GUJARATI SIGN VISARGA
+0A85..0A8D;N # Lo 9 GUJARATI LETTER A..GUJARATI VOWEL CANDRA E
+0A8F..0A91;N # Lo 3 GUJARATI LETTER E..GUJARATI VOWEL CANDRA O
+0A93..0AA8;N # Lo 22 GUJARATI LETTER O..GUJARATI LETTER NA
+0AAA..0AB0;N # Lo 7 GUJARATI LETTER PA..GUJARATI LETTER RA
+0AB2..0AB3;N # Lo 2 GUJARATI LETTER LA..GUJARATI LETTER LLA
+0AB5..0AB9;N # Lo 5 GUJARATI LETTER VA..GUJARATI LETTER HA
+0ABC;N # Mn GUJARATI SIGN NUKTA
+0ABD;N # Lo GUJARATI SIGN AVAGRAHA
+0ABE..0AC0;N # Mc 3 GUJARATI VOWEL SIGN AA..GUJARATI VOWEL SIGN II
+0AC1..0AC5;N # Mn 5 GUJARATI VOWEL SIGN U..GUJARATI VOWEL SIGN CANDRA E
+0AC7..0AC8;N # Mn 2 GUJARATI VOWEL SIGN E..GUJARATI VOWEL SIGN AI
+0AC9;N # Mc GUJARATI VOWEL SIGN CANDRA O
+0ACB..0ACC;N # Mc 2 GUJARATI VOWEL SIGN O..GUJARATI VOWEL SIGN AU
+0ACD;N # Mn GUJARATI SIGN VIRAMA
+0AD0;N # Lo GUJARATI OM
+0AE0..0AE1;N # Lo 2 GUJARATI LETTER VOCALIC RR..GUJARATI LETTER VOCALIC LL
+0AE2..0AE3;N # Mn 2 GUJARATI VOWEL SIGN VOCALIC L..GUJARATI VOWEL SIGN VOCALIC LL
+0AE6..0AEF;N # Nd 10 GUJARATI DIGIT ZERO..GUJARATI DIGIT NINE
+0AF0;N # Po GUJARATI ABBREVIATION SIGN
+0AF1;N # Sc GUJARATI RUPEE SIGN
+0AF9;N # Lo GUJARATI LETTER ZHA
+0AFA..0AFF;N # Mn 6 GUJARATI SIGN SUKUN..GUJARATI SIGN TWO-CIRCLE NUKTA ABOVE
+0B01;N # Mn ORIYA SIGN CANDRABINDU
+0B02..0B03;N # Mc 2 ORIYA SIGN ANUSVARA..ORIYA SIGN VISARGA
+0B05..0B0C;N # Lo 8 ORIYA LETTER A..ORIYA LETTER VOCALIC L
+0B0F..0B10;N # Lo 2 ORIYA LETTER E..ORIYA LETTER AI
+0B13..0B28;N # Lo 22 ORIYA LETTER O..ORIYA LETTER NA
+0B2A..0B30;N # Lo 7 ORIYA LETTER PA..ORIYA LETTER RA
+0B32..0B33;N # Lo 2 ORIYA LETTER LA..ORIYA LETTER LLA
+0B35..0B39;N # Lo 5 ORIYA LETTER VA..ORIYA LETTER HA
+0B3C;N # Mn ORIYA SIGN NUKTA
+0B3D;N # Lo ORIYA SIGN AVAGRAHA
+0B3E;N # Mc ORIYA VOWEL SIGN AA
+0B3F;N # Mn ORIYA VOWEL SIGN I
+0B40;N # Mc ORIYA VOWEL SIGN II
+0B41..0B44;N # Mn 4 ORIYA VOWEL SIGN U..ORIYA VOWEL SIGN VOCALIC RR
+0B47..0B48;N # Mc 2 ORIYA VOWEL SIGN E..ORIYA VOWEL SIGN AI
+0B4B..0B4C;N # Mc 2 ORIYA VOWEL SIGN O..ORIYA VOWEL SIGN AU
+0B4D;N # Mn ORIYA SIGN VIRAMA
+0B56;N # Mn ORIYA AI LENGTH MARK
+0B57;N # Mc ORIYA AU LENGTH MARK
+0B5C..0B5D;N # Lo 2 ORIYA LETTER RRA..ORIYA LETTER RHA
+0B5F..0B61;N # Lo 3 ORIYA LETTER YYA..ORIYA LETTER VOCALIC LL
+0B62..0B63;N # Mn 2 ORIYA VOWEL SIGN VOCALIC L..ORIYA VOWEL SIGN VOCALIC LL
+0B66..0B6F;N # Nd 10 ORIYA DIGIT ZERO..ORIYA DIGIT NINE
+0B70;N # So ORIYA ISSHAR
+0B71;N # Lo ORIYA LETTER WA
+0B72..0B77;N # No 6 ORIYA FRACTION ONE QUARTER..ORIYA FRACTION THREE SIXTEENTHS
+0B82;N # Mn TAMIL SIGN ANUSVARA
+0B83;N # Lo TAMIL SIGN VISARGA
+0B85..0B8A;N # Lo 6 TAMIL LETTER A..TAMIL LETTER UU
+0B8E..0B90;N # Lo 3 TAMIL LETTER E..TAMIL LETTER AI
+0B92..0B95;N # Lo 4 TAMIL LETTER O..TAMIL LETTER KA
+0B99..0B9A;N # Lo 2 TAMIL LETTER NGA..TAMIL LETTER CA
+0B9C;N # Lo TAMIL LETTER JA
+0B9E..0B9F;N # Lo 2 TAMIL LETTER NYA..TAMIL LETTER TTA
+0BA3..0BA4;N # Lo 2 TAMIL LETTER NNA..TAMIL LETTER TA
+0BA8..0BAA;N # Lo 3 TAMIL LETTER NA..TAMIL LETTER PA
+0BAE..0BB9;N # Lo 12 TAMIL LETTER MA..TAMIL LETTER HA
+0BBE..0BBF;N # Mc 2 TAMIL VOWEL SIGN AA..TAMIL VOWEL SIGN I
+0BC0;N # Mn TAMIL VOWEL SIGN II
+0BC1..0BC2;N # Mc 2 TAMIL VOWEL SIGN U..TAMIL VOWEL SIGN UU
+0BC6..0BC8;N # Mc 3 TAMIL VOWEL SIGN E..TAMIL VOWEL SIGN AI
+0BCA..0BCC;N # Mc 3 TAMIL VOWEL SIGN O..TAMIL VOWEL SIGN AU
+0BCD;N # Mn TAMIL SIGN VIRAMA
+0BD0;N # Lo TAMIL OM
+0BD7;N # Mc TAMIL AU LENGTH MARK
+0BE6..0BEF;N # Nd 10 TAMIL DIGIT ZERO..TAMIL DIGIT NINE
+0BF0..0BF2;N # No 3 TAMIL NUMBER TEN..TAMIL NUMBER ONE THOUSAND
+0BF3..0BF8;N # So 6 TAMIL DAY SIGN..TAMIL AS ABOVE SIGN
+0BF9;N # Sc TAMIL RUPEE SIGN
+0BFA;N # So TAMIL NUMBER SIGN
+0C00;N # Mn TELUGU SIGN COMBINING CANDRABINDU ABOVE
+0C01..0C03;N # Mc 3 TELUGU SIGN CANDRABINDU..TELUGU SIGN VISARGA
+0C05..0C0C;N # Lo 8 TELUGU LETTER A..TELUGU LETTER VOCALIC L
+0C0E..0C10;N # Lo 3 TELUGU LETTER E..TELUGU LETTER AI
+0C12..0C28;N # Lo 23 TELUGU LETTER O..TELUGU LETTER NA
+0C2A..0C39;N # Lo 16 TELUGU LETTER PA..TELUGU LETTER HA
+0C3D;N # Lo TELUGU SIGN AVAGRAHA
+0C3E..0C40;N # Mn 3 TELUGU VOWEL SIGN AA..TELUGU VOWEL SIGN II
+0C41..0C44;N # Mc 4 TELUGU VOWEL SIGN U..TELUGU VOWEL SIGN VOCALIC RR
+0C46..0C48;N # Mn 3 TELUGU VOWEL SIGN E..TELUGU VOWEL SIGN AI
+0C4A..0C4D;N # Mn 4 TELUGU VOWEL SIGN O..TELUGU SIGN VIRAMA
+0C55..0C56;N # Mn 2 TELUGU LENGTH MARK..TELUGU AI LENGTH MARK
+0C58..0C5A;N # Lo 3 TELUGU LETTER TSA..TELUGU LETTER RRRA
+0C60..0C61;N # Lo 2 TELUGU LETTER VOCALIC RR..TELUGU LETTER VOCALIC LL
+0C62..0C63;N # Mn 2 TELUGU VOWEL SIGN VOCALIC L..TELUGU VOWEL SIGN VOCALIC LL
+0C66..0C6F;N # Nd 10 TELUGU DIGIT ZERO..TELUGU DIGIT NINE
+0C78..0C7E;N # No 7 TELUGU FRACTION DIGIT ZERO FOR ODD POWERS OF FOUR..TELUGU FRACTION DIGIT THREE FOR EVEN POWERS OF FOUR
+0C7F;N # So TELUGU SIGN TUUMU
+0C80;N # Lo KANNADA SIGN SPACING CANDRABINDU
+0C81;N # Mn KANNADA SIGN CANDRABINDU
+0C82..0C83;N # Mc 2 KANNADA SIGN ANUSVARA..KANNADA SIGN VISARGA
+0C85..0C8C;N # Lo 8 KANNADA LETTER A..KANNADA LETTER VOCALIC L
+0C8E..0C90;N # Lo 3 KANNADA LETTER E..KANNADA LETTER AI
+0C92..0CA8;N # Lo 23 KANNADA LETTER O..KANNADA LETTER NA
+0CAA..0CB3;N # Lo 10 KANNADA LETTER PA..KANNADA LETTER LLA
+0CB5..0CB9;N # Lo 5 KANNADA LETTER VA..KANNADA LETTER HA
+0CBC;N # Mn KANNADA SIGN NUKTA
+0CBD;N # Lo KANNADA SIGN AVAGRAHA
+0CBE;N # Mc KANNADA VOWEL SIGN AA
+0CBF;N # Mn KANNADA VOWEL SIGN I
+0CC0..0CC4;N # Mc 5 KANNADA VOWEL SIGN II..KANNADA VOWEL SIGN VOCALIC RR
+0CC6;N # Mn KANNADA VOWEL SIGN E
+0CC7..0CC8;N # Mc 2 KANNADA VOWEL SIGN EE..KANNADA VOWEL SIGN AI
+0CCA..0CCB;N # Mc 2 KANNADA VOWEL SIGN O..KANNADA VOWEL SIGN OO
+0CCC..0CCD;N # Mn 2 KANNADA VOWEL SIGN AU..KANNADA SIGN VIRAMA
+0CD5..0CD6;N # Mc 2 KANNADA LENGTH MARK..KANNADA AI LENGTH MARK
+0CDE;N # Lo KANNADA LETTER FA
+0CE0..0CE1;N # Lo 2 KANNADA LETTER VOCALIC RR..KANNADA LETTER VOCALIC LL
+0CE2..0CE3;N # Mn 2 KANNADA VOWEL SIGN VOCALIC L..KANNADA VOWEL SIGN VOCALIC LL
+0CE6..0CEF;N # Nd 10 KANNADA DIGIT ZERO..KANNADA DIGIT NINE
+0CF1..0CF2;N # Lo 2 KANNADA SIGN JIHVAMULIYA..KANNADA SIGN UPADHMANIYA
+0D00..0D01;N # Mn 2 MALAYALAM SIGN COMBINING ANUSVARA ABOVE..MALAYALAM SIGN CANDRABINDU
+0D02..0D03;N # Mc 2 MALAYALAM SIGN ANUSVARA..MALAYALAM SIGN VISARGA
+0D05..0D0C;N # Lo 8 MALAYALAM LETTER A..MALAYALAM LETTER VOCALIC L
+0D0E..0D10;N # Lo 3 MALAYALAM LETTER E..MALAYALAM LETTER AI
+0D12..0D3A;N # Lo 41 MALAYALAM LETTER O..MALAYALAM LETTER TTTA
+0D3B..0D3C;N # Mn 2 MALAYALAM SIGN VERTICAL BAR VIRAMA..MALAYALAM SIGN CIRCULAR VIRAMA
+0D3D;N # Lo MALAYALAM SIGN AVAGRAHA
+0D3E..0D40;N # Mc 3 MALAYALAM VOWEL SIGN AA..MALAYALAM VOWEL SIGN II
+0D41..0D44;N # Mn 4 MALAYALAM VOWEL SIGN U..MALAYALAM VOWEL SIGN VOCALIC RR
+0D46..0D48;N # Mc 3 MALAYALAM VOWEL SIGN E..MALAYALAM VOWEL SIGN AI
+0D4A..0D4C;N # Mc 3 MALAYALAM VOWEL SIGN O..MALAYALAM VOWEL SIGN AU
+0D4D;N # Mn MALAYALAM SIGN VIRAMA
+0D4E;N # Lo MALAYALAM LETTER DOT REPH
+0D4F;N # So MALAYALAM SIGN PARA
+0D54..0D56;N # Lo 3 MALAYALAM LETTER CHILLU M..MALAYALAM LETTER CHILLU LLL
+0D57;N # Mc MALAYALAM AU LENGTH MARK
+0D58..0D5E;N # No 7 MALAYALAM FRACTION ONE ONE-HUNDRED-AND-SIXTIETH..MALAYALAM FRACTION ONE FIFTH
+0D5F..0D61;N # Lo 3 MALAYALAM LETTER ARCHAIC II..MALAYALAM LETTER VOCALIC LL
+0D62..0D63;N # Mn 2 MALAYALAM VOWEL SIGN VOCALIC L..MALAYALAM VOWEL SIGN VOCALIC LL
+0D66..0D6F;N # Nd 10 MALAYALAM DIGIT ZERO..MALAYALAM DIGIT NINE
+0D70..0D78;N # No 9 MALAYALAM NUMBER TEN..MALAYALAM FRACTION THREE SIXTEENTHS
+0D79;N # So MALAYALAM DATE MARK
+0D7A..0D7F;N # Lo 6 MALAYALAM LETTER CHILLU NN..MALAYALAM LETTER CHILLU K
+0D82..0D83;N # Mc 2 SINHALA SIGN ANUSVARAYA..SINHALA SIGN VISARGAYA
+0D85..0D96;N # Lo 18 SINHALA LETTER AYANNA..SINHALA LETTER AUYANNA
+0D9A..0DB1;N # Lo 24 SINHALA LETTER ALPAPRAANA KAYANNA..SINHALA LETTER DANTAJA NAYANNA
+0DB3..0DBB;N # Lo 9 SINHALA LETTER SANYAKA DAYANNA..SINHALA LETTER RAYANNA
+0DBD;N # Lo SINHALA LETTER DANTAJA LAYANNA
+0DC0..0DC6;N # Lo 7 SINHALA LETTER VAYANNA..SINHALA LETTER FAYANNA
+0DCA;N # Mn SINHALA SIGN AL-LAKUNA
+0DCF..0DD1;N # Mc 3 SINHALA VOWEL SIGN AELA-PILLA..SINHALA VOWEL SIGN DIGA AEDA-PILLA
+0DD2..0DD4;N # Mn 3 SINHALA VOWEL SIGN KETTI IS-PILLA..SINHALA VOWEL SIGN KETTI PAA-PILLA
+0DD6;N # Mn SINHALA VOWEL SIGN DIGA PAA-PILLA
+0DD8..0DDF;N # Mc 8 SINHALA VOWEL SIGN GAETTA-PILLA..SINHALA VOWEL SIGN GAYANUKITTA
+0DE6..0DEF;N # Nd 10 SINHALA LITH DIGIT ZERO..SINHALA LITH DIGIT NINE
+0DF2..0DF3;N # Mc 2 SINHALA VOWEL SIGN DIGA GAETTA-PILLA..SINHALA VOWEL SIGN DIGA GAYANUKITTA
+0DF4;N # Po SINHALA PUNCTUATION KUNDDALIYA
+0E01..0E30;N # Lo 48 THAI CHARACTER KO KAI..THAI CHARACTER SARA A
+0E31;N # Mn THAI CHARACTER MAI HAN-AKAT
+0E32..0E33;N # Lo 2 THAI CHARACTER SARA AA..THAI CHARACTER SARA AM
+0E34..0E3A;N # Mn 7 THAI CHARACTER SARA I..THAI CHARACTER PHINTHU
+0E3F;N # Sc THAI CURRENCY SYMBOL BAHT
+0E40..0E45;N # Lo 6 THAI CHARACTER SARA E..THAI CHARACTER LAKKHANGYAO
+0E46;N # Lm THAI CHARACTER MAIYAMOK
+0E47..0E4E;N # Mn 8 THAI CHARACTER MAITAIKHU..THAI CHARACTER YAMAKKAN
+0E4F;N # Po THAI CHARACTER FONGMAN
+0E50..0E59;N # Nd 10 THAI DIGIT ZERO..THAI DIGIT NINE
+0E5A..0E5B;N # Po 2 THAI CHARACTER ANGKHANKHU..THAI CHARACTER KHOMUT
+0E81..0E82;N # Lo 2 LAO LETTER KO..LAO LETTER KHO SUNG
+0E84;N # Lo LAO LETTER KHO TAM
+0E87..0E88;N # Lo 2 LAO LETTER NGO..LAO LETTER CO
+0E8A;N # Lo LAO LETTER SO TAM
+0E8D;N # Lo LAO LETTER NYO
+0E94..0E97;N # Lo 4 LAO LETTER DO..LAO LETTER THO TAM
+0E99..0E9F;N # Lo 7 LAO LETTER NO..LAO LETTER FO SUNG
+0EA1..0EA3;N # Lo 3 LAO LETTER MO..LAO LETTER LO LING
+0EA5;N # Lo LAO LETTER LO LOOT
+0EA7;N # Lo LAO LETTER WO
+0EAA..0EAB;N # Lo 2 LAO LETTER SO SUNG..LAO LETTER HO SUNG
+0EAD..0EB0;N # Lo 4 LAO LETTER O..LAO VOWEL SIGN A
+0EB1;N # Mn LAO VOWEL SIGN MAI KAN
+0EB2..0EB3;N # Lo 2 LAO VOWEL SIGN AA..LAO VOWEL SIGN AM
+0EB4..0EB9;N # Mn 6 LAO VOWEL SIGN I..LAO VOWEL SIGN UU
+0EBB..0EBC;N # Mn 2 LAO VOWEL SIGN MAI KON..LAO SEMIVOWEL SIGN LO
+0EBD;N # Lo LAO SEMIVOWEL SIGN NYO
+0EC0..0EC4;N # Lo 5 LAO VOWEL SIGN E..LAO VOWEL SIGN AI
+0EC6;N # Lm LAO KO LA
+0EC8..0ECD;N # Mn 6 LAO TONE MAI EK..LAO NIGGAHITA
+0ED0..0ED9;N # Nd 10 LAO DIGIT ZERO..LAO DIGIT NINE
+0EDC..0EDF;N # Lo 4 LAO HO NO..LAO LETTER KHMU NYO
+0F00;N # Lo TIBETAN SYLLABLE OM
+0F01..0F03;N # So 3 TIBETAN MARK GTER YIG MGO TRUNCATED A..TIBETAN MARK GTER YIG MGO -UM GTER TSHEG MA
+0F04..0F12;N # Po 15 TIBETAN MARK INITIAL YIG MGO MDUN MA..TIBETAN MARK RGYA GRAM SHAD
+0F13;N # So TIBETAN MARK CARET -DZUD RTAGS ME LONG CAN
+0F14;N # Po TIBETAN MARK GTER TSHEG
+0F15..0F17;N # So 3 TIBETAN LOGOTYPE SIGN CHAD RTAGS..TIBETAN ASTROLOGICAL SIGN SGRA GCAN -CHAR RTAGS
+0F18..0F19;N # Mn 2 TIBETAN ASTROLOGICAL SIGN -KHYUD PA..TIBETAN ASTROLOGICAL SIGN SDONG TSHUGS
+0F1A..0F1F;N # So 6 TIBETAN SIGN RDEL DKAR GCIG..TIBETAN SIGN RDEL DKAR RDEL NAG
+0F20..0F29;N # Nd 10 TIBETAN DIGIT ZERO..TIBETAN DIGIT NINE
+0F2A..0F33;N # No 10 TIBETAN DIGIT HALF ONE..TIBETAN DIGIT HALF ZERO
+0F34;N # So TIBETAN MARK BSDUS RTAGS
+0F35;N # Mn TIBETAN MARK NGAS BZUNG NYI ZLA
+0F36;N # So TIBETAN MARK CARET -DZUD RTAGS BZHI MIG CAN
+0F37;N # Mn TIBETAN MARK NGAS BZUNG SGOR RTAGS
+0F38;N # So TIBETAN MARK CHE MGO
+0F39;N # Mn TIBETAN MARK TSA -PHRU
+0F3A;N # Ps TIBETAN MARK GUG RTAGS GYON
+0F3B;N # Pe TIBETAN MARK GUG RTAGS GYAS
+0F3C;N # Ps TIBETAN MARK ANG KHANG GYON
+0F3D;N # Pe TIBETAN MARK ANG KHANG GYAS
+0F3E..0F3F;N # Mc 2 TIBETAN SIGN YAR TSHES..TIBETAN SIGN MAR TSHES
+0F40..0F47;N # Lo 8 TIBETAN LETTER KA..TIBETAN LETTER JA
+0F49..0F6C;N # Lo 36 TIBETAN LETTER NYA..TIBETAN LETTER RRA
+0F71..0F7E;N # Mn 14 TIBETAN VOWEL SIGN AA..TIBETAN SIGN RJES SU NGA RO
+0F7F;N # Mc TIBETAN SIGN RNAM BCAD
+0F80..0F84;N # Mn 5 TIBETAN VOWEL SIGN REVERSED I..TIBETAN MARK HALANTA
+0F85;N # Po TIBETAN MARK PALUTA
+0F86..0F87;N # Mn 2 TIBETAN SIGN LCI RTAGS..TIBETAN SIGN YANG RTAGS
+0F88..0F8C;N # Lo 5 TIBETAN SIGN LCE TSA CAN..TIBETAN SIGN INVERTED MCHU CAN
+0F8D..0F97;N # Mn 11 TIBETAN SUBJOINED SIGN LCE TSA CAN..TIBETAN SUBJOINED LETTER JA
+0F99..0FBC;N # Mn 36 TIBETAN SUBJOINED LETTER NYA..TIBETAN SUBJOINED LETTER FIXED-FORM RA
+0FBE..0FC5;N # So 8 TIBETAN KU RU KHA..TIBETAN SYMBOL RDO RJE
+0FC6;N # Mn TIBETAN SYMBOL PADMA GDAN
+0FC7..0FCC;N # So 6 TIBETAN SYMBOL RDO RJE RGYA GRAM..TIBETAN SYMBOL NOR BU BZHI -KHYIL
+0FCE..0FCF;N # So 2 TIBETAN SIGN RDEL NAG RDEL DKAR..TIBETAN SIGN RDEL NAG GSUM
+0FD0..0FD4;N # Po 5 TIBETAN MARK BSKA- SHOG GI MGO RGYAN..TIBETAN MARK CLOSING BRDA RNYING YIG MGO SGAB MA
+0FD5..0FD8;N # So 4 RIGHT-FACING SVASTI SIGN..LEFT-FACING SVASTI SIGN WITH DOTS
+0FD9..0FDA;N # Po 2 TIBETAN MARK LEADING MCHAN RTAGS..TIBETAN MARK TRAILING MCHAN RTAGS
+1000..102A;N # Lo 43 MYANMAR LETTER KA..MYANMAR LETTER AU
+102B..102C;N # Mc 2 MYANMAR VOWEL SIGN TALL AA..MYANMAR VOWEL SIGN AA
+102D..1030;N # Mn 4 MYANMAR VOWEL SIGN I..MYANMAR VOWEL SIGN UU
+1031;N # Mc MYANMAR VOWEL SIGN E
+1032..1037;N # Mn 6 MYANMAR VOWEL SIGN AI..MYANMAR SIGN DOT BELOW
+1038;N # Mc MYANMAR SIGN VISARGA
+1039..103A;N # Mn 2 MYANMAR SIGN VIRAMA..MYANMAR SIGN ASAT
+103B..103C;N # Mc 2 MYANMAR CONSONANT SIGN MEDIAL YA..MYANMAR CONSONANT SIGN MEDIAL RA
+103D..103E;N # Mn 2 MYANMAR CONSONANT SIGN MEDIAL WA..MYANMAR CONSONANT SIGN MEDIAL HA
+103F;N # Lo MYANMAR LETTER GREAT SA
+1040..1049;N # Nd 10 MYANMAR DIGIT ZERO..MYANMAR DIGIT NINE
+104A..104F;N # Po 6 MYANMAR SIGN LITTLE SECTION..MYANMAR SYMBOL GENITIVE
+1050..1055;N # Lo 6 MYANMAR LETTER SHA..MYANMAR LETTER VOCALIC LL
+1056..1057;N # Mc 2 MYANMAR VOWEL SIGN VOCALIC R..MYANMAR VOWEL SIGN VOCALIC RR
+1058..1059;N # Mn 2 MYANMAR VOWEL SIGN VOCALIC L..MYANMAR VOWEL SIGN VOCALIC LL
+105A..105D;N # Lo 4 MYANMAR LETTER MON NGA..MYANMAR LETTER MON BBE
+105E..1060;N # Mn 3 MYANMAR CONSONANT SIGN MON MEDIAL NA..MYANMAR CONSONANT SIGN MON MEDIAL LA
+1061;N # Lo MYANMAR LETTER SGAW KAREN SHA
+1062..1064;N # Mc 3 MYANMAR VOWEL SIGN SGAW KAREN EU..MYANMAR TONE MARK SGAW KAREN KE PHO
+1065..1066;N # Lo 2 MYANMAR LETTER WESTERN PWO KAREN THA..MYANMAR LETTER WESTERN PWO KAREN PWA
+1067..106D;N # Mc 7 MYANMAR VOWEL SIGN WESTERN PWO KAREN EU..MYANMAR SIGN WESTERN PWO KAREN TONE-5
+106E..1070;N # Lo 3 MYANMAR LETTER EASTERN PWO KAREN NNA..MYANMAR LETTER EASTERN PWO KAREN GHWA
+1071..1074;N # Mn 4 MYANMAR VOWEL SIGN GEBA KAREN I..MYANMAR VOWEL SIGN KAYAH EE
+1075..1081;N # Lo 13 MYANMAR LETTER SHAN KA..MYANMAR LETTER SHAN HA
+1082;N # Mn MYANMAR CONSONANT SIGN SHAN MEDIAL WA
+1083..1084;N # Mc 2 MYANMAR VOWEL SIGN SHAN AA..MYANMAR VOWEL SIGN SHAN E
+1085..1086;N # Mn 2 MYANMAR VOWEL SIGN SHAN E ABOVE..MYANMAR VOWEL SIGN SHAN FINAL Y
+1087..108C;N # Mc 6 MYANMAR SIGN SHAN TONE-2..MYANMAR SIGN SHAN COUNCIL TONE-3
+108D;N # Mn MYANMAR SIGN SHAN COUNCIL EMPHATIC TONE
+108E;N # Lo MYANMAR LETTER RUMAI PALAUNG FA
+108F;N # Mc MYANMAR SIGN RUMAI PALAUNG TONE-5
+1090..1099;N # Nd 10 MYANMAR SHAN DIGIT ZERO..MYANMAR SHAN DIGIT NINE
+109A..109C;N # Mc 3 MYANMAR SIGN KHAMTI TONE-1..MYANMAR VOWEL SIGN AITON A
+109D;N # Mn MYANMAR VOWEL SIGN AITON AI
+109E..109F;N # So 2 MYANMAR SYMBOL SHAN ONE..MYANMAR SYMBOL SHAN EXCLAMATION
+10A0..10C5;N # Lu 38 GEORGIAN CAPITAL LETTER AN..GEORGIAN CAPITAL LETTER HOE
+10C7;N # Lu GEORGIAN CAPITAL LETTER YN
+10CD;N # Lu GEORGIAN CAPITAL LETTER AEN
+10D0..10FA;N # Lo 43 GEORGIAN LETTER AN..GEORGIAN LETTER AIN
+10FB;N # Po GEORGIAN PARAGRAPH SEPARATOR
+10FC;N # Lm MODIFIER LETTER GEORGIAN NAR
+10FD..10FF;N # Lo 3 GEORGIAN LETTER AEN..GEORGIAN LETTER LABIAL SIGN
+1100..115F;W # Lo 96 HANGUL CHOSEONG KIYEOK..HANGUL CHOSEONG FILLER
+1160..11FF;N # Lo 160 HANGUL JUNGSEONG FILLER..HANGUL JONGSEONG SSANGNIEUN
+1200..1248;N # Lo 73 ETHIOPIC SYLLABLE HA..ETHIOPIC SYLLABLE QWA
+124A..124D;N # Lo 4 ETHIOPIC SYLLABLE QWI..ETHIOPIC SYLLABLE QWE
+1250..1256;N # Lo 7 ETHIOPIC SYLLABLE QHA..ETHIOPIC SYLLABLE QHO
+1258;N # Lo ETHIOPIC SYLLABLE QHWA
+125A..125D;N # Lo 4 ETHIOPIC SYLLABLE QHWI..ETHIOPIC SYLLABLE QHWE
+1260..1288;N # Lo 41 ETHIOPIC SYLLABLE BA..ETHIOPIC SYLLABLE XWA
+128A..128D;N # Lo 4 ETHIOPIC SYLLABLE XWI..ETHIOPIC SYLLABLE XWE
+1290..12B0;N # Lo 33 ETHIOPIC SYLLABLE NA..ETHIOPIC SYLLABLE KWA
+12B2..12B5;N # Lo 4 ETHIOPIC SYLLABLE KWI..ETHIOPIC SYLLABLE KWE
+12B8..12BE;N # Lo 7 ETHIOPIC SYLLABLE KXA..ETHIOPIC SYLLABLE KXO
+12C0;N # Lo ETHIOPIC SYLLABLE KXWA
+12C2..12C5;N # Lo 4 ETHIOPIC SYLLABLE KXWI..ETHIOPIC SYLLABLE KXWE
+12C8..12D6;N # Lo 15 ETHIOPIC SYLLABLE WA..ETHIOPIC SYLLABLE PHARYNGEAL O
+12D8..1310;N # Lo 57 ETHIOPIC SYLLABLE ZA..ETHIOPIC SYLLABLE GWA
+1312..1315;N # Lo 4 ETHIOPIC SYLLABLE GWI..ETHIOPIC SYLLABLE GWE
+1318..135A;N # Lo 67 ETHIOPIC SYLLABLE GGA..ETHIOPIC SYLLABLE FYA
+135D..135F;N # Mn 3 ETHIOPIC COMBINING GEMINATION AND VOWEL LENGTH MARK..ETHIOPIC COMBINING GEMINATION MARK
+1360..1368;N # Po 9 ETHIOPIC SECTION MARK..ETHIOPIC PARAGRAPH SEPARATOR
+1369..137C;N # No 20 ETHIOPIC DIGIT ONE..ETHIOPIC NUMBER TEN THOUSAND
+1380..138F;N # Lo 16 ETHIOPIC SYLLABLE SEBATBEIT MWA..ETHIOPIC SYLLABLE PWE
+1390..1399;N # So 10 ETHIOPIC TONAL MARK YIZET..ETHIOPIC TONAL MARK KURT
+13A0..13F5;N # Lu 86 CHEROKEE LETTER A..CHEROKEE LETTER MV
+13F8..13FD;N # Ll 6 CHEROKEE SMALL LETTER YE..CHEROKEE SMALL LETTER MV
+1400;N # Pd CANADIAN SYLLABICS HYPHEN
+1401..166C;N # Lo 620 CANADIAN SYLLABICS E..CANADIAN SYLLABICS CARRIER TTSA
+166D..166E;N # Po 2 CANADIAN SYLLABICS CHI SIGN..CANADIAN SYLLABICS FULL STOP
+166F..167F;N # Lo 17 CANADIAN SYLLABICS QAI..CANADIAN SYLLABICS BLACKFOOT W
+1680;N # Zs OGHAM SPACE MARK
+1681..169A;N # Lo 26 OGHAM LETTER BEITH..OGHAM LETTER PEITH
+169B;N # Ps OGHAM FEATHER MARK
+169C;N # Pe OGHAM REVERSED FEATHER MARK
+16A0..16EA;N # Lo 75 RUNIC LETTER FEHU FEOH FE F..RUNIC LETTER X
+16EB..16ED;N # Po 3 RUNIC SINGLE PUNCTUATION..RUNIC CROSS PUNCTUATION
+16EE..16F0;N # Nl 3 RUNIC ARLAUG SYMBOL..RUNIC BELGTHOR SYMBOL
+16F1..16F8;N # Lo 8 RUNIC LETTER K..RUNIC LETTER FRANKS CASKET AESC
+1700..170C;N # Lo 13 TAGALOG LETTER A..TAGALOG LETTER YA
+170E..1711;N # Lo 4 TAGALOG LETTER LA..TAGALOG LETTER HA
+1712..1714;N # Mn 3 TAGALOG VOWEL SIGN I..TAGALOG SIGN VIRAMA
+1720..1731;N # Lo 18 HANUNOO LETTER A..HANUNOO LETTER HA
+1732..1734;N # Mn 3 HANUNOO VOWEL SIGN I..HANUNOO SIGN PAMUDPOD
+1735..1736;N # Po 2 PHILIPPINE SINGLE PUNCTUATION..PHILIPPINE DOUBLE PUNCTUATION
+1740..1751;N # Lo 18 BUHID LETTER A..BUHID LETTER HA
+1752..1753;N # Mn 2 BUHID VOWEL SIGN I..BUHID VOWEL SIGN U
+1760..176C;N # Lo 13 TAGBANWA LETTER A..TAGBANWA LETTER YA
+176E..1770;N # Lo 3 TAGBANWA LETTER LA..TAGBANWA LETTER SA
+1772..1773;N # Mn 2 TAGBANWA VOWEL SIGN I..TAGBANWA VOWEL SIGN U
+1780..17B3;N # Lo 52 KHMER LETTER KA..KHMER INDEPENDENT VOWEL QAU
+17B4..17B5;N # Mn 2 KHMER VOWEL INHERENT AQ..KHMER VOWEL INHERENT AA
+17B6;N # Mc KHMER VOWEL SIGN AA
+17B7..17BD;N # Mn 7 KHMER VOWEL SIGN I..KHMER VOWEL SIGN UA
+17BE..17C5;N # Mc 8 KHMER VOWEL SIGN OE..KHMER VOWEL SIGN AU
+17C6;N # Mn KHMER SIGN NIKAHIT
+17C7..17C8;N # Mc 2 KHMER SIGN REAHMUK..KHMER SIGN YUUKALEAPINTU
+17C9..17D3;N # Mn 11 KHMER SIGN MUUSIKATOAN..KHMER SIGN BATHAMASAT
+17D4..17D6;N # Po 3 KHMER SIGN KHAN..KHMER SIGN CAMNUC PII KUUH
+17D7;N # Lm KHMER SIGN LEK TOO
+17D8..17DA;N # Po 3 KHMER SIGN BEYYAL..KHMER SIGN KOOMUUT
+17DB;N # Sc KHMER CURRENCY SYMBOL RIEL
+17DC;N # Lo KHMER SIGN AVAKRAHASANYA
+17DD;N # Mn KHMER SIGN ATTHACAN
+17E0..17E9;N # Nd 10 KHMER DIGIT ZERO..KHMER DIGIT NINE
+17F0..17F9;N # No 10 KHMER SYMBOL LEK ATTAK SON..KHMER SYMBOL LEK ATTAK PRAM-BUON
+1800..1805;N # Po 6 MONGOLIAN BIRGA..MONGOLIAN FOUR DOTS
+1806;N # Pd MONGOLIAN TODO SOFT HYPHEN
+1807..180A;N # Po 4 MONGOLIAN SIBE SYLLABLE BOUNDARY MARKER..MONGOLIAN NIRUGU
+180B..180D;N # Mn 3 MONGOLIAN FREE VARIATION SELECTOR ONE..MONGOLIAN FREE VARIATION SELECTOR THREE
+180E;N # Cf MONGOLIAN VOWEL SEPARATOR
+1810..1819;N # Nd 10 MONGOLIAN DIGIT ZERO..MONGOLIAN DIGIT NINE
+1820..1842;N # Lo 35 MONGOLIAN LETTER A..MONGOLIAN LETTER CHI
+1843;N # Lm MONGOLIAN LETTER TODO LONG VOWEL SIGN
+1844..1877;N # Lo 52 MONGOLIAN LETTER TODO E..MONGOLIAN LETTER MANCHU ZHA
+1880..1884;N # Lo 5 MONGOLIAN LETTER ALI GALI ANUSVARA ONE..MONGOLIAN LETTER ALI GALI INVERTED UBADAMA
+1885..1886;N # Mn 2 MONGOLIAN LETTER ALI GALI BALUDA..MONGOLIAN LETTER ALI GALI THREE BALUDA
+1887..18A8;N # Lo 34 MONGOLIAN LETTER ALI GALI A..MONGOLIAN LETTER MANCHU ALI GALI BHA
+18A9;N # Mn MONGOLIAN LETTER ALI GALI DAGALGA
+18AA;N # Lo MONGOLIAN LETTER MANCHU ALI GALI LHA
+18B0..18F5;N # Lo 70 CANADIAN SYLLABICS OY..CANADIAN SYLLABICS CARRIER DENTAL S
+1900..191E;N # Lo 31 LIMBU VOWEL-CARRIER LETTER..LIMBU LETTER TRA
+1920..1922;N # Mn 3 LIMBU VOWEL SIGN A..LIMBU VOWEL SIGN U
+1923..1926;N # Mc 4 LIMBU VOWEL SIGN EE..LIMBU VOWEL SIGN AU
+1927..1928;N # Mn 2 LIMBU VOWEL SIGN E..LIMBU VOWEL SIGN O
+1929..192B;N # Mc 3 LIMBU SUBJOINED LETTER YA..LIMBU SUBJOINED LETTER WA
+1930..1931;N # Mc 2 LIMBU SMALL LETTER KA..LIMBU SMALL LETTER NGA
+1932;N # Mn LIMBU SMALL LETTER ANUSVARA
+1933..1938;N # Mc 6 LIMBU SMALL LETTER TA..LIMBU SMALL LETTER LA
+1939..193B;N # Mn 3 LIMBU SIGN MUKPHRENG..LIMBU SIGN SA-I
+1940;N # So LIMBU SIGN LOO
+1944..1945;N # Po 2 LIMBU EXCLAMATION MARK..LIMBU QUESTION MARK
+1946..194F;N # Nd 10 LIMBU DIGIT ZERO..LIMBU DIGIT NINE
+1950..196D;N # Lo 30 TAI LE LETTER KA..TAI LE LETTER AI
+1970..1974;N # Lo 5 TAI LE LETTER TONE-2..TAI LE LETTER TONE-6
+1980..19AB;N # Lo 44 NEW TAI LUE LETTER HIGH QA..NEW TAI LUE LETTER LOW SUA
+19B0..19C9;N # Lo 26 NEW TAI LUE VOWEL SIGN VOWEL SHORTENER..NEW TAI LUE TONE MARK-2
+19D0..19D9;N # Nd 10 NEW TAI LUE DIGIT ZERO..NEW TAI LUE DIGIT NINE
+19DA;N # No NEW TAI LUE THAM DIGIT ONE
+19DE..19DF;N # So 2 NEW TAI LUE SIGN LAE..NEW TAI LUE SIGN LAEV
+19E0..19FF;N # So 32 KHMER SYMBOL PATHAMASAT..KHMER SYMBOL DAP-PRAM ROC
+1A00..1A16;N # Lo 23 BUGINESE LETTER KA..BUGINESE LETTER HA
+1A17..1A18;N # Mn 2 BUGINESE VOWEL SIGN I..BUGINESE VOWEL SIGN U
+1A19..1A1A;N # Mc 2 BUGINESE VOWEL SIGN E..BUGINESE VOWEL SIGN O
+1A1B;N # Mn BUGINESE VOWEL SIGN AE
+1A1E..1A1F;N # Po 2 BUGINESE PALLAWA..BUGINESE END OF SECTION
+1A20..1A54;N # Lo 53 TAI THAM LETTER HIGH KA..TAI THAM LETTER GREAT SA
+1A55;N # Mc TAI THAM CONSONANT SIGN MEDIAL RA
+1A56;N # Mn TAI THAM CONSONANT SIGN MEDIAL LA
+1A57;N # Mc TAI THAM CONSONANT SIGN LA TANG LAI
+1A58..1A5E;N # Mn 7 TAI THAM SIGN MAI KANG LAI..TAI THAM CONSONANT SIGN SA
+1A60;N # Mn TAI THAM SIGN SAKOT
+1A61;N # Mc TAI THAM VOWEL SIGN A
+1A62;N # Mn TAI THAM VOWEL SIGN MAI SAT
+1A63..1A64;N # Mc 2 TAI THAM VOWEL SIGN AA..TAI THAM VOWEL SIGN TALL AA
+1A65..1A6C;N # Mn 8 TAI THAM VOWEL SIGN I..TAI THAM VOWEL SIGN OA BELOW
+1A6D..1A72;N # Mc 6 TAI THAM VOWEL SIGN OY..TAI THAM VOWEL SIGN THAM AI
+1A73..1A7C;N # Mn 10 TAI THAM VOWEL SIGN OA ABOVE..TAI THAM SIGN KHUEN-LUE KARAN
+1A7F;N # Mn TAI THAM COMBINING CRYPTOGRAMMIC DOT
+1A80..1A89;N # Nd 10 TAI THAM HORA DIGIT ZERO..TAI THAM HORA DIGIT NINE
+1A90..1A99;N # Nd 10 TAI THAM THAM DIGIT ZERO..TAI THAM THAM DIGIT NINE
+1AA0..1AA6;N # Po 7 TAI THAM SIGN WIANG..TAI THAM SIGN REVERSED ROTATED RANA
+1AA7;N # Lm TAI THAM SIGN MAI YAMOK
+1AA8..1AAD;N # Po 6 TAI THAM SIGN KAAN..TAI THAM SIGN CAANG
+1AB0..1ABD;N # Mn 14 COMBINING DOUBLED CIRCUMFLEX ACCENT..COMBINING PARENTHESES BELOW
+1ABE;N # Me COMBINING PARENTHESES OVERLAY
+1B00..1B03;N # Mn 4 BALINESE SIGN ULU RICEM..BALINESE SIGN SURANG
+1B04;N # Mc BALINESE SIGN BISAH
+1B05..1B33;N # Lo 47 BALINESE LETTER AKARA..BALINESE LETTER HA
+1B34;N # Mn BALINESE SIGN REREKAN
+1B35;N # Mc BALINESE VOWEL SIGN TEDUNG
+1B36..1B3A;N # Mn 5 BALINESE VOWEL SIGN ULU..BALINESE VOWEL SIGN RA REPA
+1B3B;N # Mc BALINESE VOWEL SIGN RA REPA TEDUNG
+1B3C;N # Mn BALINESE VOWEL SIGN LA LENGA
+1B3D..1B41;N # Mc 5 BALINESE VOWEL SIGN LA LENGA TEDUNG..BALINESE VOWEL SIGN TALING REPA TEDUNG
+1B42;N # Mn BALINESE VOWEL SIGN PEPET
+1B43..1B44;N # Mc 2 BALINESE VOWEL SIGN PEPET TEDUNG..BALINESE ADEG ADEG
+1B45..1B4B;N # Lo 7 BALINESE LETTER KAF SASAK..BALINESE LETTER ASYURA SASAK
+1B50..1B59;N # Nd 10 BALINESE DIGIT ZERO..BALINESE DIGIT NINE
+1B5A..1B60;N # Po 7 BALINESE PANTI..BALINESE PAMENENG
+1B61..1B6A;N # So 10 BALINESE MUSICAL SYMBOL DONG..BALINESE MUSICAL SYMBOL DANG GEDE
+1B6B..1B73;N # Mn 9 BALINESE MUSICAL SYMBOL COMBINING TEGEH..BALINESE MUSICAL SYMBOL COMBINING GONG
+1B74..1B7C;N # So 9 BALINESE MUSICAL SYMBOL RIGHT-HAND OPEN DUG..BALINESE MUSICAL SYMBOL LEFT-HAND OPEN PING
+1B80..1B81;N # Mn 2 SUNDANESE SIGN PANYECEK..SUNDANESE SIGN PANGLAYAR
+1B82;N # Mc SUNDANESE SIGN PANGWISAD
+1B83..1BA0;N # Lo 30 SUNDANESE LETTER A..SUNDANESE LETTER HA
+1BA1;N # Mc SUNDANESE CONSONANT SIGN PAMINGKAL
+1BA2..1BA5;N # Mn 4 SUNDANESE CONSONANT SIGN PANYAKRA..SUNDANESE VOWEL SIGN PANYUKU
+1BA6..1BA7;N # Mc 2 SUNDANESE VOWEL SIGN PANAELAENG..SUNDANESE VOWEL SIGN PANOLONG
+1BA8..1BA9;N # Mn 2 SUNDANESE VOWEL SIGN PAMEPET..SUNDANESE VOWEL SIGN PANEULEUNG
+1BAA;N # Mc SUNDANESE SIGN PAMAAEH
+1BAB..1BAD;N # Mn 3 SUNDANESE SIGN VIRAMA..SUNDANESE CONSONANT SIGN PASANGAN WA
+1BAE..1BAF;N # Lo 2 SUNDANESE LETTER KHA..SUNDANESE LETTER SYA
+1BB0..1BB9;N # Nd 10 SUNDANESE DIGIT ZERO..SUNDANESE DIGIT NINE
+1BBA..1BBF;N # Lo 6 SUNDANESE AVAGRAHA..SUNDANESE LETTER FINAL M
+1BC0..1BE5;N # Lo 38 BATAK LETTER A..BATAK LETTER U
+1BE6;N # Mn BATAK SIGN TOMPI
+1BE7;N # Mc BATAK VOWEL SIGN E
+1BE8..1BE9;N # Mn 2 BATAK VOWEL SIGN PAKPAK E..BATAK VOWEL SIGN EE
+1BEA..1BEC;N # Mc 3 BATAK VOWEL SIGN I..BATAK VOWEL SIGN O
+1BED;N # Mn BATAK VOWEL SIGN KARO O
+1BEE;N # Mc BATAK VOWEL SIGN U
+1BEF..1BF1;N # Mn 3 BATAK VOWEL SIGN U FOR SIMALUNGUN SA..BATAK CONSONANT SIGN H
+1BF2..1BF3;N # Mc 2 BATAK PANGOLAT..BATAK PANONGONAN
+1BFC..1BFF;N # Po 4 BATAK SYMBOL BINDU NA METEK..BATAK SYMBOL BINDU PANGOLAT
+1C00..1C23;N # Lo 36 LEPCHA LETTER KA..LEPCHA LETTER A
+1C24..1C2B;N # Mc 8 LEPCHA SUBJOINED LETTER YA..LEPCHA VOWEL SIGN UU
+1C2C..1C33;N # Mn 8 LEPCHA VOWEL SIGN E..LEPCHA CONSONANT SIGN T
+1C34..1C35;N # Mc 2 LEPCHA CONSONANT SIGN NYIN-DO..LEPCHA CONSONANT SIGN KANG
+1C36..1C37;N # Mn 2 LEPCHA SIGN RAN..LEPCHA SIGN NUKTA
+1C3B..1C3F;N # Po 5 LEPCHA PUNCTUATION TA-ROL..LEPCHA PUNCTUATION TSHOOK
+1C40..1C49;N # Nd 10 LEPCHA DIGIT ZERO..LEPCHA DIGIT NINE
+1C4D..1C4F;N # Lo 3 LEPCHA LETTER TTA..LEPCHA LETTER DDA
+1C50..1C59;N # Nd 10 OL CHIKI DIGIT ZERO..OL CHIKI DIGIT NINE
+1C5A..1C77;N # Lo 30 OL CHIKI LETTER LA..OL CHIKI LETTER OH
+1C78..1C7D;N # Lm 6 OL CHIKI MU TTUDDAG..OL CHIKI AHAD
+1C7E..1C7F;N # Po 2 OL CHIKI PUNCTUATION MUCAAD..OL CHIKI PUNCTUATION DOUBLE MUCAAD
+1C80..1C88;N # Ll 9 CYRILLIC SMALL LETTER ROUNDED VE..CYRILLIC SMALL LETTER UNBLENDED UK
+1CC0..1CC7;N # Po 8 SUNDANESE PUNCTUATION BINDU SURYA..SUNDANESE PUNCTUATION BINDU BA SATANGA
+1CD0..1CD2;N # Mn 3 VEDIC TONE KARSHANA..VEDIC TONE PRENKHA
+1CD3;N # Po VEDIC SIGN NIHSHVASA
+1CD4..1CE0;N # Mn 13 VEDIC SIGN YAJURVEDIC MIDLINE SVARITA..VEDIC TONE RIGVEDIC KASHMIRI INDEPENDENT SVARITA
+1CE1;N # Mc VEDIC TONE ATHARVAVEDIC INDEPENDENT SVARITA
+1CE2..1CE8;N # Mn 7 VEDIC SIGN VISARGA SVARITA..VEDIC SIGN VISARGA ANUDATTA WITH TAIL
+1CE9..1CEC;N # Lo 4 VEDIC SIGN ANUSVARA ANTARGOMUKHA..VEDIC SIGN ANUSVARA VAMAGOMUKHA WITH TAIL
+1CED;N # Mn VEDIC SIGN TIRYAK
+1CEE..1CF1;N # Lo 4 VEDIC SIGN HEXIFORM LONG ANUSVARA..VEDIC SIGN ANUSVARA UBHAYATO MUKHA
+1CF2..1CF3;N # Mc 2 VEDIC SIGN ARDHAVISARGA..VEDIC SIGN ROTATED ARDHAVISARGA
+1CF4;N # Mn VEDIC TONE CANDRA ABOVE
+1CF5..1CF6;N # Lo 2 VEDIC SIGN JIHVAMULIYA..VEDIC SIGN UPADHMANIYA
+1CF7;N # Mc VEDIC SIGN ATIKRAMA
+1CF8..1CF9;N # Mn 2 VEDIC TONE RING ABOVE..VEDIC TONE DOUBLE RING ABOVE
+1D00..1D2B;N # Ll 44 LATIN LETTER SMALL CAPITAL A..CYRILLIC LETTER SMALL CAPITAL EL
+1D2C..1D6A;N # Lm 63 MODIFIER LETTER CAPITAL A..GREEK SUBSCRIPT SMALL LETTER CHI
+1D6B..1D77;N # Ll 13 LATIN SMALL LETTER UE..LATIN SMALL LETTER TURNED G
+1D78;N # Lm MODIFIER LETTER CYRILLIC EN
+1D79..1D7F;N # Ll 7 LATIN SMALL LETTER INSULAR G..LATIN SMALL LETTER UPSILON WITH STROKE
+1D80..1D9A;N # Ll 27 LATIN SMALL LETTER B WITH PALATAL HOOK..LATIN SMALL LETTER EZH WITH RETROFLEX HOOK
+1D9B..1DBF;N # Lm 37 MODIFIER LETTER SMALL TURNED ALPHA..MODIFIER LETTER SMALL THETA
+1DC0..1DF9;N # Mn 58 COMBINING DOTTED GRAVE ACCENT..COMBINING WIDE INVERTED BRIDGE BELOW
+1DFB..1DFF;N # Mn 5 COMBINING DELETION MARK..COMBINING RIGHT ARROWHEAD AND DOWN ARROWHEAD BELOW
+1E00..1EFF;N # L& 256 LATIN CAPITAL LETTER A WITH RING BELOW..LATIN SMALL LETTER Y WITH LOOP
+1F00..1F15;N # L& 22 GREEK SMALL LETTER ALPHA WITH PSILI..GREEK SMALL LETTER EPSILON WITH DASIA AND OXIA
+1F18..1F1D;N # Lu 6 GREEK CAPITAL LETTER EPSILON WITH PSILI..GREEK CAPITAL LETTER EPSILON WITH DASIA AND OXIA
+1F20..1F45;N # L& 38 GREEK SMALL LETTER ETA WITH PSILI..GREEK SMALL LETTER OMICRON WITH DASIA AND OXIA
+1F48..1F4D;N # Lu 6 GREEK CAPITAL LETTER OMICRON WITH PSILI..GREEK CAPITAL LETTER OMICRON WITH DASIA AND OXIA
+1F50..1F57;N # Ll 8 GREEK SMALL LETTER UPSILON WITH PSILI..GREEK SMALL LETTER UPSILON WITH DASIA AND PERISPOMENI
+1F59;N # Lu GREEK CAPITAL LETTER UPSILON WITH DASIA
+1F5B;N # Lu GREEK CAPITAL LETTER UPSILON WITH DASIA AND VARIA
+1F5D;N # Lu GREEK CAPITAL LETTER UPSILON WITH DASIA AND OXIA
+1F5F..1F7D;N # L& 31 GREEK CAPITAL LETTER UPSILON WITH DASIA AND PERISPOMENI..GREEK SMALL LETTER OMEGA WITH OXIA
+1F80..1FB4;N # L& 53 GREEK SMALL LETTER ALPHA WITH PSILI AND YPOGEGRAMMENI..GREEK SMALL LETTER ALPHA WITH OXIA AND YPOGEGRAMMENI
+1FB6..1FBC;N # L& 7 GREEK SMALL LETTER ALPHA WITH PERISPOMENI..GREEK CAPITAL LETTER ALPHA WITH PROSGEGRAMMENI
+1FBD;N # Sk GREEK KORONIS
+1FBE;N # Ll GREEK PROSGEGRAMMENI
+1FBF..1FC1;N # Sk 3 GREEK PSILI..GREEK DIALYTIKA AND PERISPOMENI
+1FC2..1FC4;N # Ll 3 GREEK SMALL LETTER ETA WITH VARIA AND YPOGEGRAMMENI..GREEK SMALL LETTER ETA WITH OXIA AND YPOGEGRAMMENI
+1FC6..1FCC;N # L& 7 GREEK SMALL LETTER ETA WITH PERISPOMENI..GREEK CAPITAL LETTER ETA WITH PROSGEGRAMMENI
+1FCD..1FCF;N # Sk 3 GREEK PSILI AND VARIA..GREEK PSILI AND PERISPOMENI
+1FD0..1FD3;N # Ll 4 GREEK SMALL LETTER IOTA WITH VRACHY..GREEK SMALL LETTER IOTA WITH DIALYTIKA AND OXIA
+1FD6..1FDB;N # L& 6 GREEK SMALL LETTER IOTA WITH PERISPOMENI..GREEK CAPITAL LETTER IOTA WITH OXIA
+1FDD..1FDF;N # Sk 3 GREEK DASIA AND VARIA..GREEK DASIA AND PERISPOMENI
+1FE0..1FEC;N # L& 13 GREEK SMALL LETTER UPSILON WITH VRACHY..GREEK CAPITAL LETTER RHO WITH DASIA
+1FED..1FEF;N # Sk 3 GREEK DIALYTIKA AND VARIA..GREEK VARIA
+1FF2..1FF4;N # Ll 3 GREEK SMALL LETTER OMEGA WITH VARIA AND YPOGEGRAMMENI..GREEK SMALL LETTER OMEGA WITH OXIA AND YPOGEGRAMMENI
+1FF6..1FFC;N # L& 7 GREEK SMALL LETTER OMEGA WITH PERISPOMENI..GREEK CAPITAL LETTER OMEGA WITH PROSGEGRAMMENI
+1FFD..1FFE;N # Sk 2 GREEK OXIA..GREEK DASIA
+2000..200A;N # Zs 11 EN QUAD..HAIR SPACE
+200B..200F;N # Cf 5 ZERO WIDTH SPACE..RIGHT-TO-LEFT MARK
+2010;A # Pd HYPHEN
+2011..2012;N # Pd 2 NON-BREAKING HYPHEN..FIGURE DASH
+2013..2015;A # Pd 3 EN DASH..HORIZONTAL BAR
+2016;A # Po DOUBLE VERTICAL LINE
+2017;N # Po DOUBLE LOW LINE
+2018;A # Pi LEFT SINGLE QUOTATION MARK
+2019;A # Pf RIGHT SINGLE QUOTATION MARK
+201A;N # Ps SINGLE LOW-9 QUOTATION MARK
+201B;N # Pi SINGLE HIGH-REVERSED-9 QUOTATION MARK
+201C;A # Pi LEFT DOUBLE QUOTATION MARK
+201D;A # Pf RIGHT DOUBLE QUOTATION MARK
+201E;N # Ps DOUBLE LOW-9 QUOTATION MARK
+201F;N # Pi DOUBLE HIGH-REVERSED-9 QUOTATION MARK
+2020..2022;A # Po 3 DAGGER..BULLET
+2023;N # Po TRIANGULAR BULLET
+2024..2027;A # Po 4 ONE DOT LEADER..HYPHENATION POINT
+2028;N # Zl LINE SEPARATOR
+2029;N # Zp PARAGRAPH SEPARATOR
+202A..202E;N # Cf 5 LEFT-TO-RIGHT EMBEDDING..RIGHT-TO-LEFT OVERRIDE
+202F;N # Zs NARROW NO-BREAK SPACE
+2030;A # Po PER MILLE SIGN
+2031;N # Po PER TEN THOUSAND SIGN
+2032..2033;A # Po 2 PRIME..DOUBLE PRIME
+2034;N # Po TRIPLE PRIME
+2035;A # Po REVERSED PRIME
+2036..2038;N # Po 3 REVERSED DOUBLE PRIME..CARET
+2039;N # Pi SINGLE LEFT-POINTING ANGLE QUOTATION MARK
+203A;N # Pf SINGLE RIGHT-POINTING ANGLE QUOTATION MARK
+203B;A # Po REFERENCE MARK
+203C..203D;N # Po 2 DOUBLE EXCLAMATION MARK..INTERROBANG
+203E;A # Po OVERLINE
+203F..2040;N # Pc 2 UNDERTIE..CHARACTER TIE
+2041..2043;N # Po 3 CARET INSERTION POINT..HYPHEN BULLET
+2044;N # Sm FRACTION SLASH
+2045;N # Ps LEFT SQUARE BRACKET WITH QUILL
+2046;N # Pe RIGHT SQUARE BRACKET WITH QUILL
+2047..2051;N # Po 11 DOUBLE QUESTION MARK..TWO ASTERISKS ALIGNED VERTICALLY
+2052;N # Sm COMMERCIAL MINUS SIGN
+2053;N # Po SWUNG DASH
+2054;N # Pc INVERTED UNDERTIE
+2055..205E;N # Po 10 FLOWER PUNCTUATION MARK..VERTICAL FOUR DOTS
+205F;N # Zs MEDIUM MATHEMATICAL SPACE
+2060..2064;N # Cf 5 WORD JOINER..INVISIBLE PLUS
+2066..206F;N # Cf 10 LEFT-TO-RIGHT ISOLATE..NOMINAL DIGIT SHAPES
+2070;N # No SUPERSCRIPT ZERO
+2071;N # Lm SUPERSCRIPT LATIN SMALL LETTER I
+2074;A # No SUPERSCRIPT FOUR
+2075..2079;N # No 5 SUPERSCRIPT FIVE..SUPERSCRIPT NINE
+207A..207C;N # Sm 3 SUPERSCRIPT PLUS SIGN..SUPERSCRIPT EQUALS SIGN
+207D;N # Ps SUPERSCRIPT LEFT PARENTHESIS
+207E;N # Pe SUPERSCRIPT RIGHT PARENTHESIS
+207F;A # Lm SUPERSCRIPT LATIN SMALL LETTER N
+2080;N # No SUBSCRIPT ZERO
+2081..2084;A # No 4 SUBSCRIPT ONE..SUBSCRIPT FOUR
+2085..2089;N # No 5 SUBSCRIPT FIVE..SUBSCRIPT NINE
+208A..208C;N # Sm 3 SUBSCRIPT PLUS SIGN..SUBSCRIPT EQUALS SIGN
+208D;N # Ps SUBSCRIPT LEFT PARENTHESIS
+208E;N # Pe SUBSCRIPT RIGHT PARENTHESIS
+2090..209C;N # Lm 13 LATIN SUBSCRIPT SMALL LETTER A..LATIN SUBSCRIPT SMALL LETTER T
+20A0..20A8;N # Sc 9 EURO-CURRENCY SIGN..RUPEE SIGN
+20A9;H # Sc WON SIGN
+20AA..20AB;N # Sc 2 NEW SHEQEL SIGN..DONG SIGN
+20AC;A # Sc EURO SIGN
+20AD..20BF;N # Sc 19 KIP SIGN..BITCOIN SIGN
+20D0..20DC;N # Mn 13 COMBINING LEFT HARPOON ABOVE..COMBINING FOUR DOTS ABOVE
+20DD..20E0;N # Me 4 COMBINING ENCLOSING CIRCLE..COMBINING ENCLOSING CIRCLE BACKSLASH
+20E1;N # Mn COMBINING LEFT RIGHT ARROW ABOVE
+20E2..20E4;N # Me 3 COMBINING ENCLOSING SCREEN..COMBINING ENCLOSING UPWARD POINTING TRIANGLE
+20E5..20F0;N # Mn 12 COMBINING REVERSE SOLIDUS OVERLAY..COMBINING ASTERISK ABOVE
+2100..2101;N # So 2 ACCOUNT OF..ADDRESSED TO THE SUBJECT
+2102;N # Lu DOUBLE-STRUCK CAPITAL C
+2103;A # So DEGREE CELSIUS
+2104;N # So CENTRE LINE SYMBOL
+2105;A # So CARE OF
+2106;N # So CADA UNA
+2107;N # Lu EULER CONSTANT
+2108;N # So SCRUPLE
+2109;A # So DEGREE FAHRENHEIT
+210A..2112;N # L& 9 SCRIPT SMALL G..SCRIPT CAPITAL L
+2113;A # Ll SCRIPT SMALL L
+2114;N # So L B BAR SYMBOL
+2115;N # Lu DOUBLE-STRUCK CAPITAL N
+2116;A # So NUMERO SIGN
+2117;N # So SOUND RECORDING COPYRIGHT
+2118;N # Sm SCRIPT CAPITAL P
+2119..211D;N # Lu 5 DOUBLE-STRUCK CAPITAL P..DOUBLE-STRUCK CAPITAL R
+211E..2120;N # So 3 PRESCRIPTION TAKE..SERVICE MARK
+2121..2122;A # So 2 TELEPHONE SIGN..TRADE MARK SIGN
+2123;N # So VERSICLE
+2124;N # Lu DOUBLE-STRUCK CAPITAL Z
+2125;N # So OUNCE SIGN
+2126;A # Lu OHM SIGN
+2127;N # So INVERTED OHM SIGN
+2128;N # Lu BLACK-LETTER CAPITAL Z
+2129;N # So TURNED GREEK SMALL LETTER IOTA
+212A;N # Lu KELVIN SIGN
+212B;A # Lu ANGSTROM SIGN
+212C..212D;N # Lu 2 SCRIPT CAPITAL B..BLACK-LETTER CAPITAL C
+212E;N # So ESTIMATED SYMBOL
+212F..2134;N # L& 6 SCRIPT SMALL E..SCRIPT SMALL O
+2135..2138;N # Lo 4 ALEF SYMBOL..DALET SYMBOL
+2139;N # Ll INFORMATION SOURCE
+213A..213B;N # So 2 ROTATED CAPITAL Q..FACSIMILE SIGN
+213C..213F;N # L& 4 DOUBLE-STRUCK SMALL PI..DOUBLE-STRUCK CAPITAL PI
+2140..2144;N # Sm 5 DOUBLE-STRUCK N-ARY SUMMATION..TURNED SANS-SERIF CAPITAL Y
+2145..2149;N # L& 5 DOUBLE-STRUCK ITALIC CAPITAL D..DOUBLE-STRUCK ITALIC SMALL J
+214A;N # So PROPERTY LINE
+214B;N # Sm TURNED AMPERSAND
+214C..214D;N # So 2 PER SIGN..AKTIESELSKAB
+214E;N # Ll TURNED SMALL F
+214F;N # So SYMBOL FOR SAMARITAN SOURCE
+2150..2152;N # No 3 VULGAR FRACTION ONE SEVENTH..VULGAR FRACTION ONE TENTH
+2153..2154;A # No 2 VULGAR FRACTION ONE THIRD..VULGAR FRACTION TWO THIRDS
+2155..215A;N # No 6 VULGAR FRACTION ONE FIFTH..VULGAR FRACTION FIVE SIXTHS
+215B..215E;A # No 4 VULGAR FRACTION ONE EIGHTH..VULGAR FRACTION SEVEN EIGHTHS
+215F;N # No FRACTION NUMERATOR ONE
+2160..216B;A # Nl 12 ROMAN NUMERAL ONE..ROMAN NUMERAL TWELVE
+216C..216F;N # Nl 4 ROMAN NUMERAL FIFTY..ROMAN NUMERAL ONE THOUSAND
+2170..2179;A # Nl 10 SMALL ROMAN NUMERAL ONE..SMALL ROMAN NUMERAL TEN
+217A..2182;N # Nl 9 SMALL ROMAN NUMERAL ELEVEN..ROMAN NUMERAL TEN THOUSAND
+2183..2184;N # L& 2 ROMAN NUMERAL REVERSED ONE HUNDRED..LATIN SMALL LETTER REVERSED C
+2185..2188;N # Nl 4 ROMAN NUMERAL SIX LATE FORM..ROMAN NUMERAL ONE HUNDRED THOUSAND
+2189;A # No VULGAR FRACTION ZERO THIRDS
+218A..218B;N # So 2 TURNED DIGIT TWO..TURNED DIGIT THREE
+2190..2194;A # Sm 5 LEFTWARDS ARROW..LEFT RIGHT ARROW
+2195..2199;A # So 5 UP DOWN ARROW..SOUTH WEST ARROW
+219A..219B;N # Sm 2 LEFTWARDS ARROW WITH STROKE..RIGHTWARDS ARROW WITH STROKE
+219C..219F;N # So 4 LEFTWARDS WAVE ARROW..UPWARDS TWO HEADED ARROW
+21A0;N # Sm RIGHTWARDS TWO HEADED ARROW
+21A1..21A2;N # So 2 DOWNWARDS TWO HEADED ARROW..LEFTWARDS ARROW WITH TAIL
+21A3;N # Sm RIGHTWARDS ARROW WITH TAIL
+21A4..21A5;N # So 2 LEFTWARDS ARROW FROM BAR..UPWARDS ARROW FROM BAR
+21A6;N # Sm RIGHTWARDS ARROW FROM BAR
+21A7..21AD;N # So 7 DOWNWARDS ARROW FROM BAR..LEFT RIGHT WAVE ARROW
+21AE;N # Sm LEFT RIGHT ARROW WITH STROKE
+21AF..21B7;N # So 9 DOWNWARDS ZIGZAG ARROW..CLOCKWISE TOP SEMICIRCLE ARROW
+21B8..21B9;A # So 2 NORTH WEST ARROW TO LONG BAR..LEFTWARDS ARROW TO BAR OVER RIGHTWARDS ARROW TO BAR
+21BA..21CD;N # So 20 ANTICLOCKWISE OPEN CIRCLE ARROW..LEFTWARDS DOUBLE ARROW WITH STROKE
+21CE..21CF;N # Sm 2 LEFT RIGHT DOUBLE ARROW WITH STROKE..RIGHTWARDS DOUBLE ARROW WITH STROKE
+21D0..21D1;N # So 2 LEFTWARDS DOUBLE ARROW..UPWARDS DOUBLE ARROW
+21D2;A # Sm RIGHTWARDS DOUBLE ARROW
+21D3;N # So DOWNWARDS DOUBLE ARROW
+21D4;A # Sm LEFT RIGHT DOUBLE ARROW
+21D5..21E6;N # So 18 UP DOWN DOUBLE ARROW..LEFTWARDS WHITE ARROW
+21E7;A # So UPWARDS WHITE ARROW
+21E8..21F3;N # So 12 RIGHTWARDS WHITE ARROW..UP DOWN WHITE ARROW
+21F4..21FF;N # Sm 12 RIGHT ARROW WITH SMALL CIRCLE..LEFT RIGHT OPEN-HEADED ARROW
+2200;A # Sm FOR ALL
+2201;N # Sm COMPLEMENT
+2202..2203;A # Sm 2 PARTIAL DIFFERENTIAL..THERE EXISTS
+2204..2206;N # Sm 3 THERE DOES NOT EXIST..INCREMENT
+2207..2208;A # Sm 2 NABLA..ELEMENT OF
+2209..220A;N # Sm 2 NOT AN ELEMENT OF..SMALL ELEMENT OF
+220B;A # Sm CONTAINS AS MEMBER
+220C..220E;N # Sm 3 DOES NOT CONTAIN AS MEMBER..END OF PROOF
+220F;A # Sm N-ARY PRODUCT
+2210;N # Sm N-ARY COPRODUCT
+2211;A # Sm N-ARY SUMMATION
+2212..2214;N # Sm 3 MINUS SIGN..DOT PLUS
+2215;A # Sm DIVISION SLASH
+2216..2219;N # Sm 4 SET MINUS..BULLET OPERATOR
+221A;A # Sm SQUARE ROOT
+221B..221C;N # Sm 2 CUBE ROOT..FOURTH ROOT
+221D..2220;A # Sm 4 PROPORTIONAL TO..ANGLE
+2221..2222;N # Sm 2 MEASURED ANGLE..SPHERICAL ANGLE
+2223;A # Sm DIVIDES
+2224;N # Sm DOES NOT DIVIDE
+2225;A # Sm PARALLEL TO
+2226;N # Sm NOT PARALLEL TO
+2227..222C;A # Sm 6 LOGICAL AND..DOUBLE INTEGRAL
+222D;N # Sm TRIPLE INTEGRAL
+222E;A # Sm CONTOUR INTEGRAL
+222F..2233;N # Sm 5 SURFACE INTEGRAL..ANTICLOCKWISE CONTOUR INTEGRAL
+2234..2237;A # Sm 4 THEREFORE..PROPORTION
+2238..223B;N # Sm 4 DOT MINUS..HOMOTHETIC
+223C..223D;A # Sm 2 TILDE OPERATOR..REVERSED TILDE
+223E..2247;N # Sm 10 INVERTED LAZY S..NEITHER APPROXIMATELY NOR ACTUALLY EQUAL TO
+2248;A # Sm ALMOST EQUAL TO
+2249..224B;N # Sm 3 NOT ALMOST EQUAL TO..TRIPLE TILDE
+224C;A # Sm ALL EQUAL TO
+224D..2251;N # Sm 5 EQUIVALENT TO..GEOMETRICALLY EQUAL TO
+2252;A # Sm APPROXIMATELY EQUAL TO OR THE IMAGE OF
+2253..225F;N # Sm 13 IMAGE OF OR APPROXIMATELY EQUAL TO..QUESTIONED EQUAL TO
+2260..2261;A # Sm 2 NOT EQUAL TO..IDENTICAL TO
+2262..2263;N # Sm 2 NOT IDENTICAL TO..STRICTLY EQUIVALENT TO
+2264..2267;A # Sm 4 LESS-THAN OR EQUAL TO..GREATER-THAN OVER EQUAL TO
+2268..2269;N # Sm 2 LESS-THAN BUT NOT EQUAL TO..GREATER-THAN BUT NOT EQUAL TO
+226A..226B;A # Sm 2 MUCH LESS-THAN..MUCH GREATER-THAN
+226C..226D;N # Sm 2 BETWEEN..NOT EQUIVALENT TO
+226E..226F;A # Sm 2 NOT LESS-THAN..NOT GREATER-THAN
+2270..2281;N # Sm 18 NEITHER LESS-THAN NOR EQUAL TO..DOES NOT SUCCEED
+2282..2283;A # Sm 2 SUBSET OF..SUPERSET OF
+2284..2285;N # Sm 2 NOT A SUBSET OF..NOT A SUPERSET OF
+2286..2287;A # Sm 2 SUBSET OF OR EQUAL TO..SUPERSET OF OR EQUAL TO
+2288..2294;N # Sm 13 NEITHER A SUBSET OF NOR EQUAL TO..SQUARE CUP
+2295;A # Sm CIRCLED PLUS
+2296..2298;N # Sm 3 CIRCLED MINUS..CIRCLED DIVISION SLASH
+2299;A # Sm CIRCLED DOT OPERATOR
+229A..22A4;N # Sm 11 CIRCLED RING OPERATOR..DOWN TACK
+22A5;A # Sm UP TACK
+22A6..22BE;N # Sm 25 ASSERTION..RIGHT ANGLE WITH ARC
+22BF;A # Sm RIGHT TRIANGLE
+22C0..22FF;N # Sm 64 N-ARY LOGICAL AND..Z NOTATION BAG MEMBERSHIP
+2300..2307;N # So 8 DIAMETER SIGN..WAVY LINE
+2308;N # Ps LEFT CEILING
+2309;N # Pe RIGHT CEILING
+230A;N # Ps LEFT FLOOR
+230B;N # Pe RIGHT FLOOR
+230C..2311;N # So 6 BOTTOM RIGHT CROP..SQUARE LOZENGE
+2312;A # So ARC
+2313..2319;N # So 7 SEGMENT..TURNED NOT SIGN
+231A..231B;W # So 2 WATCH..HOURGLASS
+231C..231F;N # So 4 TOP LEFT CORNER..BOTTOM RIGHT CORNER
+2320..2321;N # Sm 2 TOP HALF INTEGRAL..BOTTOM HALF INTEGRAL
+2322..2328;N # So 7 FROWN..KEYBOARD
+2329;W # Ps LEFT-POINTING ANGLE BRACKET
+232A;W # Pe RIGHT-POINTING ANGLE BRACKET
+232B..237B;N # So 81 ERASE TO THE LEFT..NOT CHECK MARK
+237C;N # Sm RIGHT ANGLE WITH DOWNWARDS ZIGZAG ARROW
+237D..239A;N # So 30 SHOULDERED OPEN BOX..CLEAR SCREEN SYMBOL
+239B..23B3;N # Sm 25 LEFT PARENTHESIS UPPER HOOK..SUMMATION BOTTOM
+23B4..23DB;N # So 40 TOP SQUARE BRACKET..FUSE
+23DC..23E1;N # Sm 6 TOP PARENTHESIS..BOTTOM TORTOISE SHELL BRACKET
+23E2..23E8;N # So 7 WHITE TRAPEZIUM..DECIMAL EXPONENT SYMBOL
+23E9..23EC;W # So 4 BLACK RIGHT-POINTING DOUBLE TRIANGLE..BLACK DOWN-POINTING DOUBLE TRIANGLE
+23ED..23EF;N # So 3 BLACK RIGHT-POINTING DOUBLE TRIANGLE WITH VERTICAL BAR..BLACK RIGHT-POINTING TRIANGLE WITH DOUBLE VERTICAL BAR
+23F0;W # So ALARM CLOCK
+23F1..23F2;N # So 2 STOPWATCH..TIMER CLOCK
+23F3;W # So HOURGLASS WITH FLOWING SAND
+23F4..23FF;N # So 12 BLACK MEDIUM LEFT-POINTING TRIANGLE..OBSERVER EYE SYMBOL
+2400..2426;N # So 39 SYMBOL FOR NULL..SYMBOL FOR SUBSTITUTE FORM TWO
+2440..244A;N # So 11 OCR HOOK..OCR DOUBLE BACKSLASH
+2460..249B;A # No 60 CIRCLED DIGIT ONE..NUMBER TWENTY FULL STOP
+249C..24E9;A # So 78 PARENTHESIZED LATIN SMALL LETTER A..CIRCLED LATIN SMALL LETTER Z
+24EA;N # No CIRCLED DIGIT ZERO
+24EB..24FF;A # No 21 NEGATIVE CIRCLED NUMBER ELEVEN..NEGATIVE CIRCLED DIGIT ZERO
+2500..254B;A # So 76 BOX DRAWINGS LIGHT HORIZONTAL..BOX DRAWINGS HEAVY VERTICAL AND HORIZONTAL
+254C..254F;N # So 4 BOX DRAWINGS LIGHT DOUBLE DASH HORIZONTAL..BOX DRAWINGS HEAVY DOUBLE DASH VERTICAL
+2550..2573;A # So 36 BOX DRAWINGS DOUBLE HORIZONTAL..BOX DRAWINGS LIGHT DIAGONAL CROSS
+2574..257F;N # So 12 BOX DRAWINGS LIGHT LEFT..BOX DRAWINGS HEAVY UP AND LIGHT DOWN
+2580..258F;A # So 16 UPPER HALF BLOCK..LEFT ONE EIGHTH BLOCK
+2590..2591;N # So 2 RIGHT HALF BLOCK..LIGHT SHADE
+2592..2595;A # So 4 MEDIUM SHADE..RIGHT ONE EIGHTH BLOCK
+2596..259F;N # So 10 QUADRANT LOWER LEFT..QUADRANT UPPER RIGHT AND LOWER LEFT AND LOWER RIGHT
+25A0..25A1;A # So 2 BLACK SQUARE..WHITE SQUARE
+25A2;N # So WHITE SQUARE WITH ROUNDED CORNERS
+25A3..25A9;A # So 7 WHITE SQUARE CONTAINING BLACK SMALL SQUARE..SQUARE WITH DIAGONAL CROSSHATCH FILL
+25AA..25B1;N # So 8 BLACK SMALL SQUARE..WHITE PARALLELOGRAM
+25B2..25B3;A # So 2 BLACK UP-POINTING TRIANGLE..WHITE UP-POINTING TRIANGLE
+25B4..25B5;N # So 2 BLACK UP-POINTING SMALL TRIANGLE..WHITE UP-POINTING SMALL TRIANGLE
+25B6;A # So BLACK RIGHT-POINTING TRIANGLE
+25B7;A # Sm WHITE RIGHT-POINTING TRIANGLE
+25B8..25BB;N # So 4 BLACK RIGHT-POINTING SMALL TRIANGLE..WHITE RIGHT-POINTING POINTER
+25BC..25BD;A # So 2 BLACK DOWN-POINTING TRIANGLE..WHITE DOWN-POINTING TRIANGLE
+25BE..25BF;N # So 2 BLACK DOWN-POINTING SMALL TRIANGLE..WHITE DOWN-POINTING SMALL TRIANGLE
+25C0;A # So BLACK LEFT-POINTING TRIANGLE
+25C1;A # Sm WHITE LEFT-POINTING TRIANGLE
+25C2..25C5;N # So 4 BLACK LEFT-POINTING SMALL TRIANGLE..WHITE LEFT-POINTING POINTER
+25C6..25C8;A # So 3 BLACK DIAMOND..WHITE DIAMOND CONTAINING BLACK SMALL DIAMOND
+25C9..25CA;N # So 2 FISHEYE..LOZENGE
+25CB;A # So WHITE CIRCLE
+25CC..25CD;N # So 2 DOTTED CIRCLE..CIRCLE WITH VERTICAL FILL
+25CE..25D1;A # So 4 BULLSEYE..CIRCLE WITH RIGHT HALF BLACK
+25D2..25E1;N # So 16 CIRCLE WITH LOWER HALF BLACK..LOWER HALF CIRCLE
+25E2..25E5;A # So 4 BLACK LOWER RIGHT TRIANGLE..BLACK UPPER RIGHT TRIANGLE
+25E6..25EE;N # So 9 WHITE BULLET..UP-POINTING TRIANGLE WITH RIGHT HALF BLACK
+25EF;A # So LARGE CIRCLE
+25F0..25F7;N # So 8 WHITE SQUARE WITH UPPER LEFT QUADRANT..WHITE CIRCLE WITH UPPER RIGHT QUADRANT
+25F8..25FC;N # Sm 5 UPPER LEFT TRIANGLE..BLACK MEDIUM SQUARE
+25FD..25FE;W # Sm 2 WHITE MEDIUM SMALL SQUARE..BLACK MEDIUM SMALL SQUARE
+25FF;N # Sm LOWER RIGHT TRIANGLE
+2600..2604;N # So 5 BLACK SUN WITH RAYS..COMET
+2605..2606;A # So 2 BLACK STAR..WHITE STAR
+2607..2608;N # So 2 LIGHTNING..THUNDERSTORM
+2609;A # So SUN
+260A..260D;N # So 4 ASCENDING NODE..OPPOSITION
+260E..260F;A # So 2 BLACK TELEPHONE..WHITE TELEPHONE
+2610..2613;N # So 4 BALLOT BOX..SALTIRE
+2614..2615;W # So 2 UMBRELLA WITH RAIN DROPS..HOT BEVERAGE
+2616..261B;N # So 6 WHITE SHOGI PIECE..BLACK RIGHT POINTING INDEX
+261C;A # So WHITE LEFT POINTING INDEX
+261D;N # So WHITE UP POINTING INDEX
+261E;A # So WHITE RIGHT POINTING INDEX
+261F..263F;N # So 33 WHITE DOWN POINTING INDEX..MERCURY
+2640;A # So FEMALE SIGN
+2641;N # So EARTH
+2642;A # So MALE SIGN
+2643..2647;N # So 5 JUPITER..PLUTO
+2648..2653;W # So 12 ARIES..PISCES
+2654..265F;N # So 12 WHITE CHESS KING..BLACK CHESS PAWN
+2660..2661;A # So 2 BLACK SPADE SUIT..WHITE HEART SUIT
+2662;N # So WHITE DIAMOND SUIT
+2663..2665;A # So 3 BLACK CLUB SUIT..BLACK HEART SUIT
+2666;N # So BLACK DIAMOND SUIT
+2667..266A;A # So 4 WHITE CLUB SUIT..EIGHTH NOTE
+266B;N # So BEAMED EIGHTH NOTES
+266C..266D;A # So 2 BEAMED SIXTEENTH NOTES..MUSIC FLAT SIGN
+266E;N # So MUSIC NATURAL SIGN
+266F;A # Sm MUSIC SHARP SIGN
+2670..267E;N # So 15 WEST SYRIAC CROSS..PERMANENT PAPER SIGN
+267F;W # So WHEELCHAIR SYMBOL
+2680..2692;N # So 19 DIE FACE-1..HAMMER AND PICK
+2693;W # So ANCHOR
+2694..269D;N # So 10 CROSSED SWORDS..OUTLINED WHITE STAR
+269E..269F;A # So 2 THREE LINES CONVERGING RIGHT..THREE LINES CONVERGING LEFT
+26A0;N # So WARNING SIGN
+26A1;W # So HIGH VOLTAGE SIGN
+26A2..26A9;N # So 8 DOUBLED FEMALE SIGN..HORIZONTAL MALE WITH STROKE SIGN
+26AA..26AB;W # So 2 MEDIUM WHITE CIRCLE..MEDIUM BLACK CIRCLE
+26AC..26BC;N # So 17 MEDIUM SMALL WHITE CIRCLE..SESQUIQUADRATE
+26BD..26BE;W # So 2 SOCCER BALL..BASEBALL
+26BF;A # So SQUARED KEY
+26C0..26C3;N # So 4 WHITE DRAUGHTS MAN..BLACK DRAUGHTS KING
+26C4..26C5;W # So 2 SNOWMAN WITHOUT SNOW..SUN BEHIND CLOUD
+26C6..26CD;A # So 8 RAIN..DISABLED CAR
+26CE;W # So OPHIUCHUS
+26CF..26D3;A # So 5 PICK..CHAINS
+26D4;W # So NO ENTRY
+26D5..26E1;A # So 13 ALTERNATE ONE-WAY LEFT WAY TRAFFIC..RESTRICTED LEFT ENTRY-2
+26E2;N # So ASTRONOMICAL SYMBOL FOR URANUS
+26E3;A # So HEAVY CIRCLE WITH STROKE AND TWO DOTS ABOVE
+26E4..26E7;N # So 4 PENTAGRAM..INVERTED PENTAGRAM
+26E8..26E9;A # So 2 BLACK CROSS ON SHIELD..SHINTO SHRINE
+26EA;W # So CHURCH
+26EB..26F1;A # So 7 CASTLE..UMBRELLA ON GROUND
+26F2..26F3;W # So 2 FOUNTAIN..FLAG IN HOLE
+26F4;A # So FERRY
+26F5;W # So SAILBOAT
+26F6..26F9;A # So 4 SQUARE FOUR CORNERS..PERSON WITH BALL
+26FA;W # So TENT
+26FB..26FC;A # So 2 JAPANESE BANK SYMBOL..HEADSTONE GRAVEYARD SYMBOL
+26FD;W # So FUEL PUMP
+26FE..26FF;A # So 2 CUP ON BLACK SQUARE..WHITE FLAG WITH HORIZONTAL MIDDLE BLACK STRIPE
+2700..2704;N # So 5 BLACK SAFETY SCISSORS..WHITE SCISSORS
+2705;W # So WHITE HEAVY CHECK MARK
+2706..2709;N # So 4 TELEPHONE LOCATION SIGN..ENVELOPE
+270A..270B;W # So 2 RAISED FIST..RAISED HAND
+270C..2727;N # So 28 VICTORY HAND..WHITE FOUR POINTED STAR
+2728;W # So SPARKLES
+2729..273C;N # So 20 STRESS OUTLINED WHITE STAR..OPEN CENTRE TEARDROP-SPOKED ASTERISK
+273D;A # So HEAVY TEARDROP-SPOKED ASTERISK
+273E..274B;N # So 14 SIX PETALLED BLACK AND WHITE FLORETTE..HEAVY EIGHT TEARDROP-SPOKED PROPELLER ASTERISK
+274C;W # So CROSS MARK
+274D;N # So SHADOWED WHITE CIRCLE
+274E;W # So NEGATIVE SQUARED CROSS MARK
+274F..2752;N # So 4 LOWER RIGHT DROP-SHADOWED WHITE SQUARE..UPPER RIGHT SHADOWED WHITE SQUARE
+2753..2755;W # So 3 BLACK QUESTION MARK ORNAMENT..WHITE EXCLAMATION MARK ORNAMENT
+2756;N # So BLACK DIAMOND MINUS WHITE X
+2757;W # So HEAVY EXCLAMATION MARK SYMBOL
+2758..2767;N # So 16 LIGHT VERTICAL BAR..ROTATED FLORAL HEART BULLET
+2768;N # Ps MEDIUM LEFT PARENTHESIS ORNAMENT
+2769;N # Pe MEDIUM RIGHT PARENTHESIS ORNAMENT
+276A;N # Ps MEDIUM FLATTENED LEFT PARENTHESIS ORNAMENT
+276B;N # Pe MEDIUM FLATTENED RIGHT PARENTHESIS ORNAMENT
+276C;N # Ps MEDIUM LEFT-POINTING ANGLE BRACKET ORNAMENT
+276D;N # Pe MEDIUM RIGHT-POINTING ANGLE BRACKET ORNAMENT
+276E;N # Ps HEAVY LEFT-POINTING ANGLE QUOTATION MARK ORNAMENT
+276F;N # Pe HEAVY RIGHT-POINTING ANGLE QUOTATION MARK ORNAMENT
+2770;N # Ps HEAVY LEFT-POINTING ANGLE BRACKET ORNAMENT
+2771;N # Pe HEAVY RIGHT-POINTING ANGLE BRACKET ORNAMENT
+2772;N # Ps LIGHT LEFT TORTOISE SHELL BRACKET ORNAMENT
+2773;N # Pe LIGHT RIGHT TORTOISE SHELL BRACKET ORNAMENT
+2774;N # Ps MEDIUM LEFT CURLY BRACKET ORNAMENT
+2775;N # Pe MEDIUM RIGHT CURLY BRACKET ORNAMENT
+2776..277F;A # No 10 DINGBAT NEGATIVE CIRCLED DIGIT ONE..DINGBAT NEGATIVE CIRCLED NUMBER TEN
+2780..2793;N # No 20 DINGBAT CIRCLED SANS-SERIF DIGIT ONE..DINGBAT NEGATIVE CIRCLED SANS-SERIF NUMBER TEN
+2794;N # So HEAVY WIDE-HEADED RIGHTWARDS ARROW
+2795..2797;W # So 3 HEAVY PLUS SIGN..HEAVY DIVISION SIGN
+2798..27AF;N # So 24 HEAVY SOUTH EAST ARROW..NOTCHED LOWER RIGHT-SHADOWED WHITE RIGHTWARDS ARROW
+27B0;W # So CURLY LOOP
+27B1..27BE;N # So 14 NOTCHED UPPER RIGHT-SHADOWED WHITE RIGHTWARDS ARROW..OPEN-OUTLINED RIGHTWARDS ARROW
+27BF;W # So DOUBLE CURLY LOOP
+27C0..27C4;N # Sm 5 THREE DIMENSIONAL ANGLE..OPEN SUPERSET
+27C5;N # Ps LEFT S-SHAPED BAG DELIMITER
+27C6;N # Pe RIGHT S-SHAPED BAG DELIMITER
+27C7..27E5;N # Sm 31 OR WITH DOT INSIDE..WHITE SQUARE WITH RIGHTWARDS TICK
+27E6;Na # Ps MATHEMATICAL LEFT WHITE SQUARE BRACKET
+27E7;Na # Pe MATHEMATICAL RIGHT WHITE SQUARE BRACKET
+27E8;Na # Ps MATHEMATICAL LEFT ANGLE BRACKET
+27E9;Na # Pe MATHEMATICAL RIGHT ANGLE BRACKET
+27EA;Na # Ps MATHEMATICAL LEFT DOUBLE ANGLE BRACKET
+27EB;Na # Pe MATHEMATICAL RIGHT DOUBLE ANGLE BRACKET
+27EC;Na # Ps MATHEMATICAL LEFT WHITE TORTOISE SHELL BRACKET
+27ED;Na # Pe MATHEMATICAL RIGHT WHITE TORTOISE SHELL BRACKET
+27EE;N # Ps MATHEMATICAL LEFT FLATTENED PARENTHESIS
+27EF;N # Pe MATHEMATICAL RIGHT FLATTENED PARENTHESIS
+27F0..27FF;N # Sm 16 UPWARDS QUADRUPLE ARROW..LONG RIGHTWARDS SQUIGGLE ARROW
+2800..28FF;N # So 256 BRAILLE PATTERN BLANK..BRAILLE PATTERN DOTS-12345678
+2900..297F;N # Sm 128 RIGHTWARDS TWO-HEADED ARROW WITH VERTICAL STROKE..DOWN FISH TAIL
+2980..2982;N # Sm 3 TRIPLE VERTICAL BAR DELIMITER..Z NOTATION TYPE COLON
+2983;N # Ps LEFT WHITE CURLY BRACKET
+2984;N # Pe RIGHT WHITE CURLY BRACKET
+2985;Na # Ps LEFT WHITE PARENTHESIS
+2986;Na # Pe RIGHT WHITE PARENTHESIS
+2987;N # Ps Z NOTATION LEFT IMAGE BRACKET
+2988;N # Pe Z NOTATION RIGHT IMAGE BRACKET
+2989;N # Ps Z NOTATION LEFT BINDING BRACKET
+298A;N # Pe Z NOTATION RIGHT BINDING BRACKET
+298B;N # Ps LEFT SQUARE BRACKET WITH UNDERBAR
+298C;N # Pe RIGHT SQUARE BRACKET WITH UNDERBAR
+298D;N # Ps LEFT SQUARE BRACKET WITH TICK IN TOP CORNER
+298E;N # Pe RIGHT SQUARE BRACKET WITH TICK IN BOTTOM CORNER
+298F;N # Ps LEFT SQUARE BRACKET WITH TICK IN BOTTOM CORNER
+2990;N # Pe RIGHT SQUARE BRACKET WITH TICK IN TOP CORNER
+2991;N # Ps LEFT ANGLE BRACKET WITH DOT
+2992;N # Pe RIGHT ANGLE BRACKET WITH DOT
+2993;N # Ps LEFT ARC LESS-THAN BRACKET
+2994;N # Pe RIGHT ARC GREATER-THAN BRACKET
+2995;N # Ps DOUBLE LEFT ARC GREATER-THAN BRACKET
+2996;N # Pe DOUBLE RIGHT ARC LESS-THAN BRACKET
+2997;N # Ps LEFT BLACK TORTOISE SHELL BRACKET
+2998;N # Pe RIGHT BLACK TORTOISE SHELL BRACKET
+2999..29D7;N # Sm 63 DOTTED FENCE..BLACK HOURGLASS
+29D8;N # Ps LEFT WIGGLY FENCE
+29D9;N # Pe RIGHT WIGGLY FENCE
+29DA;N # Ps LEFT DOUBLE WIGGLY FENCE
+29DB;N # Pe RIGHT DOUBLE WIGGLY FENCE
+29DC..29FB;N # Sm 32 INCOMPLETE INFINITY..TRIPLE PLUS
+29FC;N # Ps LEFT-POINTING CURVED ANGLE BRACKET
+29FD;N # Pe RIGHT-POINTING CURVED ANGLE BRACKET
+29FE..29FF;N # Sm 2 TINY..MINY
+2A00..2AFF;N # Sm 256 N-ARY CIRCLED DOT OPERATOR..N-ARY WHITE VERTICAL BAR
+2B00..2B1A;N # So 27 NORTH EAST WHITE ARROW..DOTTED SQUARE
+2B1B..2B1C;W # So 2 BLACK LARGE SQUARE..WHITE LARGE SQUARE
+2B1D..2B2F;N # So 19 BLACK VERY SMALL SQUARE..WHITE VERTICAL ELLIPSE
+2B30..2B44;N # Sm 21 LEFT ARROW WITH SMALL CIRCLE..RIGHTWARDS ARROW THROUGH SUPERSET
+2B45..2B46;N # So 2 LEFTWARDS QUADRUPLE ARROW..RIGHTWARDS QUADRUPLE ARROW
+2B47..2B4C;N # Sm 6 REVERSE TILDE OPERATOR ABOVE RIGHTWARDS ARROW..RIGHTWARDS ARROW ABOVE REVERSE TILDE OPERATOR
+2B4D..2B4F;N # So 3 DOWNWARDS TRIANGLE-HEADED ZIGZAG ARROW..SHORT BACKSLANTED SOUTH ARROW
+2B50;W # So WHITE MEDIUM STAR
+2B51..2B54;N # So 4 BLACK SMALL STAR..WHITE RIGHT-POINTING PENTAGON
+2B55;W # So HEAVY LARGE CIRCLE
+2B56..2B59;A # So 4 HEAVY OVAL WITH OVAL INSIDE..HEAVY CIRCLED SALTIRE
+2B5A..2B73;N # So 26 SLANTED NORTH ARROW WITH HOOKED HEAD..DOWNWARDS TRIANGLE-HEADED ARROW TO BAR
+2B76..2B95;N # So 32 NORTH WEST TRIANGLE-HEADED ARROW TO BAR..RIGHTWARDS BLACK ARROW
+2B98..2BB9;N # So 34 THREE-D TOP-LIGHTED LEFTWARDS EQUILATERAL ARROWHEAD..UP ARROWHEAD IN A RECTANGLE BOX
+2BBD..2BC8;N # So 12 BALLOT BOX WITH LIGHT X..BLACK MEDIUM RIGHT-POINTING TRIANGLE CENTRED
+2BCA..2BD2;N # So 9 TOP HALF BLACK CIRCLE..GROUP MARK
+2BEC..2BEF;N # So 4 LEFTWARDS TWO-HEADED ARROW WITH TRIANGLE ARROWHEADS..DOWNWARDS TWO-HEADED ARROW WITH TRIANGLE ARROWHEADS
+2C00..2C2E;N # Lu 47 GLAGOLITIC CAPITAL LETTER AZU..GLAGOLITIC CAPITAL LETTER LATINATE MYSLITE
+2C30..2C5E;N # Ll 47 GLAGOLITIC SMALL LETTER AZU..GLAGOLITIC SMALL LETTER LATINATE MYSLITE
+2C60..2C7B;N # L& 28 LATIN CAPITAL LETTER L WITH DOUBLE BAR..LATIN LETTER SMALL CAPITAL TURNED E
+2C7C..2C7D;N # Lm 2 LATIN SUBSCRIPT SMALL LETTER J..MODIFIER LETTER CAPITAL V
+2C7E..2C7F;N # Lu 2 LATIN CAPITAL LETTER S WITH SWASH TAIL..LATIN CAPITAL LETTER Z WITH SWASH TAIL
+2C80..2CE4;N # L& 101 COPTIC CAPITAL LETTER ALFA..COPTIC SYMBOL KAI
+2CE5..2CEA;N # So 6 COPTIC SYMBOL MI RO..COPTIC SYMBOL SHIMA SIMA
+2CEB..2CEE;N # L& 4 COPTIC CAPITAL LETTER CRYPTOGRAMMIC SHEI..COPTIC SMALL LETTER CRYPTOGRAMMIC GANGIA
+2CEF..2CF1;N # Mn 3 COPTIC COMBINING NI ABOVE..COPTIC COMBINING SPIRITUS LENIS
+2CF2..2CF3;N # L& 2 COPTIC CAPITAL LETTER BOHAIRIC KHEI..COPTIC SMALL LETTER BOHAIRIC KHEI
+2CF9..2CFC;N # Po 4 COPTIC OLD NUBIAN FULL STOP..COPTIC OLD NUBIAN VERSE DIVIDER
+2CFD;N # No COPTIC FRACTION ONE HALF
+2CFE..2CFF;N # Po 2 COPTIC FULL STOP..COPTIC MORPHOLOGICAL DIVIDER
+2D00..2D25;N # Ll 38 GEORGIAN SMALL LETTER AN..GEORGIAN SMALL LETTER HOE
+2D27;N # Ll GEORGIAN SMALL LETTER YN
+2D2D;N # Ll GEORGIAN SMALL LETTER AEN
+2D30..2D67;N # Lo 56 TIFINAGH LETTER YA..TIFINAGH LETTER YO
+2D6F;N # Lm TIFINAGH MODIFIER LETTER LABIALIZATION MARK
+2D70;N # Po TIFINAGH SEPARATOR MARK
+2D7F;N # Mn TIFINAGH CONSONANT JOINER
+2D80..2D96;N # Lo 23 ETHIOPIC SYLLABLE LOA..ETHIOPIC SYLLABLE GGWE
+2DA0..2DA6;N # Lo 7 ETHIOPIC SYLLABLE SSA..ETHIOPIC SYLLABLE SSO
+2DA8..2DAE;N # Lo 7 ETHIOPIC SYLLABLE CCA..ETHIOPIC SYLLABLE CCO
+2DB0..2DB6;N # Lo 7 ETHIOPIC SYLLABLE ZZA..ETHIOPIC SYLLABLE ZZO
+2DB8..2DBE;N # Lo 7 ETHIOPIC SYLLABLE CCHA..ETHIOPIC SYLLABLE CCHO
+2DC0..2DC6;N # Lo 7 ETHIOPIC SYLLABLE QYA..ETHIOPIC SYLLABLE QYO
+2DC8..2DCE;N # Lo 7 ETHIOPIC SYLLABLE KYA..ETHIOPIC SYLLABLE KYO
+2DD0..2DD6;N # Lo 7 ETHIOPIC SYLLABLE XYA..ETHIOPIC SYLLABLE XYO
+2DD8..2DDE;N # Lo 7 ETHIOPIC SYLLABLE GYA..ETHIOPIC SYLLABLE GYO
+2DE0..2DFF;N # Mn 32 COMBINING CYRILLIC LETTER BE..COMBINING CYRILLIC LETTER IOTIFIED BIG YUS
+2E00..2E01;N # Po 2 RIGHT ANGLE SUBSTITUTION MARKER..RIGHT ANGLE DOTTED SUBSTITUTION MARKER
+2E02;N # Pi LEFT SUBSTITUTION BRACKET
+2E03;N # Pf RIGHT SUBSTITUTION BRACKET
+2E04;N # Pi LEFT DOTTED SUBSTITUTION BRACKET
+2E05;N # Pf RIGHT DOTTED SUBSTITUTION BRACKET
+2E06..2E08;N # Po 3 RAISED INTERPOLATION MARKER..DOTTED TRANSPOSITION MARKER
+2E09;N # Pi LEFT TRANSPOSITION BRACKET
+2E0A;N # Pf RIGHT TRANSPOSITION BRACKET
+2E0B;N # Po RAISED SQUARE
+2E0C;N # Pi LEFT RAISED OMISSION BRACKET
+2E0D;N # Pf RIGHT RAISED OMISSION BRACKET
+2E0E..2E16;N # Po 9 EDITORIAL CORONIS..DOTTED RIGHT-POINTING ANGLE
+2E17;N # Pd DOUBLE OBLIQUE HYPHEN
+2E18..2E19;N # Po 2 INVERTED INTERROBANG..PALM BRANCH
+2E1A;N # Pd HYPHEN WITH DIAERESIS
+2E1B;N # Po TILDE WITH RING ABOVE
+2E1C;N # Pi LEFT LOW PARAPHRASE BRACKET
+2E1D;N # Pf RIGHT LOW PARAPHRASE BRACKET
+2E1E..2E1F;N # Po 2 TILDE WITH DOT ABOVE..TILDE WITH DOT BELOW
+2E20;N # Pi LEFT VERTICAL BAR WITH QUILL
+2E21;N # Pf RIGHT VERTICAL BAR WITH QUILL
+2E22;N # Ps TOP LEFT HALF BRACKET
+2E23;N # Pe TOP RIGHT HALF BRACKET
+2E24;N # Ps BOTTOM LEFT HALF BRACKET
+2E25;N # Pe BOTTOM RIGHT HALF BRACKET
+2E26;N # Ps LEFT SIDEWAYS U BRACKET
+2E27;N # Pe RIGHT SIDEWAYS U BRACKET
+2E28;N # Ps LEFT DOUBLE PARENTHESIS
+2E29;N # Pe RIGHT DOUBLE PARENTHESIS
+2E2A..2E2E;N # Po 5 TWO DOTS OVER ONE DOT PUNCTUATION..REVERSED QUESTION MARK
+2E2F;N # Lm VERTICAL TILDE
+2E30..2E39;N # Po 10 RING POINT..TOP HALF SECTION SIGN
+2E3A..2E3B;N # Pd 2 TWO-EM DASH..THREE-EM DASH
+2E3C..2E3F;N # Po 4 STENOGRAPHIC FULL STOP..CAPITULUM
+2E40;N # Pd DOUBLE HYPHEN
+2E41;N # Po REVERSED COMMA
+2E42;N # Ps DOUBLE LOW-REVERSED-9 QUOTATION MARK
+2E43..2E49;N # Po 7 DASH WITH LEFT UPTURN..DOUBLE STACKED COMMA
+2E80..2E99;W # So 26 CJK RADICAL REPEAT..CJK RADICAL RAP
+2E9B..2EF3;W # So 89 CJK RADICAL CHOKE..CJK RADICAL C-SIMPLIFIED TURTLE
+2F00..2FD5;W # So 214 KANGXI RADICAL ONE..KANGXI RADICAL FLUTE
+2FF0..2FFB;W # So 12 IDEOGRAPHIC DESCRIPTION CHARACTER LEFT TO RIGHT..IDEOGRAPHIC DESCRIPTION CHARACTER OVERLAID
+3000;F # Zs IDEOGRAPHIC SPACE
+3001..3003;W # Po 3 IDEOGRAPHIC COMMA..DITTO MARK
+3004;W # So JAPANESE INDUSTRIAL STANDARD SYMBOL
+3005;W # Lm IDEOGRAPHIC ITERATION MARK
+3006;W # Lo IDEOGRAPHIC CLOSING MARK
+3007;W # Nl IDEOGRAPHIC NUMBER ZERO
+3008;W # Ps LEFT ANGLE BRACKET
+3009;W # Pe RIGHT ANGLE BRACKET
+300A;W # Ps LEFT DOUBLE ANGLE BRACKET
+300B;W # Pe RIGHT DOUBLE ANGLE BRACKET
+300C;W # Ps LEFT CORNER BRACKET
+300D;W # Pe RIGHT CORNER BRACKET
+300E;W # Ps LEFT WHITE CORNER BRACKET
+300F;W # Pe RIGHT WHITE CORNER BRACKET
+3010;W # Ps LEFT BLACK LENTICULAR BRACKET
+3011;W # Pe RIGHT BLACK LENTICULAR BRACKET
+3012..3013;W # So 2 POSTAL MARK..GETA MARK
+3014;W # Ps LEFT TORTOISE SHELL BRACKET
+3015;W # Pe RIGHT TORTOISE SHELL BRACKET
+3016;W # Ps LEFT WHITE LENTICULAR BRACKET
+3017;W # Pe RIGHT WHITE LENTICULAR BRACKET
+3018;W # Ps LEFT WHITE TORTOISE SHELL BRACKET
+3019;W # Pe RIGHT WHITE TORTOISE SHELL BRACKET
+301A;W # Ps LEFT WHITE SQUARE BRACKET
+301B;W # Pe RIGHT WHITE SQUARE BRACKET
+301C;W # Pd WAVE DASH
+301D;W # Ps REVERSED DOUBLE PRIME QUOTATION MARK
+301E..301F;W # Pe 2 DOUBLE PRIME QUOTATION MARK..LOW DOUBLE PRIME QUOTATION MARK
+3020;W # So POSTAL MARK FACE
+3021..3029;W # Nl 9 HANGZHOU NUMERAL ONE..HANGZHOU NUMERAL NINE
+302A..302D;W # Mn 4 IDEOGRAPHIC LEVEL TONE MARK..IDEOGRAPHIC ENTERING TONE MARK
+302E..302F;W # Mc 2 HANGUL SINGLE DOT TONE MARK..HANGUL DOUBLE DOT TONE MARK
+3030;W # Pd WAVY DASH
+3031..3035;W # Lm 5 VERTICAL KANA REPEAT MARK..VERTICAL KANA REPEAT MARK LOWER HALF
+3036..3037;W # So 2 CIRCLED POSTAL MARK..IDEOGRAPHIC TELEGRAPH LINE FEED SEPARATOR SYMBOL
+3038..303A;W # Nl 3 HANGZHOU NUMERAL TEN..HANGZHOU NUMERAL THIRTY
+303B;W # Lm VERTICAL IDEOGRAPHIC ITERATION MARK
+303C;W # Lo MASU MARK
+303D;W # Po PART ALTERNATION MARK
+303E;W # So IDEOGRAPHIC VARIATION INDICATOR
+303F;N # So IDEOGRAPHIC HALF FILL SPACE
+3041..3096;W # Lo 86 HIRAGANA LETTER SMALL A..HIRAGANA LETTER SMALL KE
+3099..309A;W # Mn 2 COMBINING KATAKANA-HIRAGANA VOICED SOUND MARK..COMBINING KATAKANA-HIRAGANA SEMI-VOICED SOUND MARK
+309B..309C;W # Sk 2 KATAKANA-HIRAGANA VOICED SOUND MARK..KATAKANA-HIRAGANA SEMI-VOICED SOUND MARK
+309D..309E;W # Lm 2 HIRAGANA ITERATION MARK..HIRAGANA VOICED ITERATION MARK
+309F;W # Lo HIRAGANA DIGRAPH YORI
+30A0;W # Pd KATAKANA-HIRAGANA DOUBLE HYPHEN
+30A1..30FA;W # Lo 90 KATAKANA LETTER SMALL A..KATAKANA LETTER VO
+30FB;W # Po KATAKANA MIDDLE DOT
+30FC..30FE;W # Lm 3 KATAKANA-HIRAGANA PROLONGED SOUND MARK..KATAKANA VOICED ITERATION MARK
+30FF;W # Lo KATAKANA DIGRAPH KOTO
+3105..312E;W # Lo 42 BOPOMOFO LETTER B..BOPOMOFO LETTER O WITH DOT ABOVE
+3131..318E;W # Lo 94 HANGUL LETTER KIYEOK..HANGUL LETTER ARAEAE
+3190..3191;W # So 2 IDEOGRAPHIC ANNOTATION LINKING MARK..IDEOGRAPHIC ANNOTATION REVERSE MARK
+3192..3195;W # No 4 IDEOGRAPHIC ANNOTATION ONE MARK..IDEOGRAPHIC ANNOTATION FOUR MARK
+3196..319F;W # So 10 IDEOGRAPHIC ANNOTATION TOP MARK..IDEOGRAPHIC ANNOTATION MAN MARK
+31A0..31BA;W # Lo 27 BOPOMOFO LETTER BU..BOPOMOFO LETTER ZY
+31C0..31E3;W # So 36 CJK STROKE T..CJK STROKE Q
+31F0..31FF;W # Lo 16 KATAKANA LETTER SMALL KU..KATAKANA LETTER SMALL RO
+3200..321E;W # So 31 PARENTHESIZED HANGUL KIYEOK..PARENTHESIZED KOREAN CHARACTER O HU
+3220..3229;W # No 10 PARENTHESIZED IDEOGRAPH ONE..PARENTHESIZED IDEOGRAPH TEN
+322A..3247;W # So 30 PARENTHESIZED IDEOGRAPH MOON..CIRCLED IDEOGRAPH KOTO
+3248..324F;A # No 8 CIRCLED NUMBER TEN ON BLACK SQUARE..CIRCLED NUMBER EIGHTY ON BLACK SQUARE
+3250;W # So PARTNERSHIP SIGN
+3251..325F;W # No 15 CIRCLED NUMBER TWENTY ONE..CIRCLED NUMBER THIRTY FIVE
+3260..327F;W # So 32 CIRCLED HANGUL KIYEOK..KOREAN STANDARD SYMBOL
+3280..3289;W # No 10 CIRCLED IDEOGRAPH ONE..CIRCLED IDEOGRAPH TEN
+328A..32B0;W # So 39 CIRCLED IDEOGRAPH MOON..CIRCLED IDEOGRAPH NIGHT
+32B1..32BF;W # No 15 CIRCLED NUMBER THIRTY SIX..CIRCLED NUMBER FIFTY
+32C0..32FE;W # So 63 IDEOGRAPHIC TELEGRAPH SYMBOL FOR JANUARY..CIRCLED KATAKANA WO
+3300..33FF;W # So 256 SQUARE APAATO..SQUARE GAL
+3400..4DB5;W # Lo 6582 CJK UNIFIED IDEOGRAPH-3400..CJK UNIFIED IDEOGRAPH-4DB5
+4DB6..4DBF;W # Cn 10 <reserved-4DB6>..<reserved-4DBF>
+4DC0..4DFF;N # So 64 HEXAGRAM FOR THE CREATIVE HEAVEN..HEXAGRAM FOR BEFORE COMPLETION
+4E00..9FEA;W # Lo 20971 CJK UNIFIED IDEOGRAPH-4E00..CJK UNIFIED IDEOGRAPH-9FEA
+9FEB..9FFF;W # Cn 21 <reserved-9FEB>..<reserved-9FFF>
+A000..A014;W # Lo 21 YI SYLLABLE IT..YI SYLLABLE E
+A015;W # Lm YI SYLLABLE WU
+A016..A48C;W # Lo 1143 YI SYLLABLE BIT..YI SYLLABLE YYR
+A490..A4C6;W # So 55 YI RADICAL QOT..YI RADICAL KE
+A4D0..A4F7;N # Lo 40 LISU LETTER BA..LISU LETTER OE
+A4F8..A4FD;N # Lm 6 LISU LETTER TONE MYA TI..LISU LETTER TONE MYA JEU
+A4FE..A4FF;N # Po 2 LISU PUNCTUATION COMMA..LISU PUNCTUATION FULL STOP
+A500..A60B;N # Lo 268 VAI SYLLABLE EE..VAI SYLLABLE NG
+A60C;N # Lm VAI SYLLABLE LENGTHENER
+A60D..A60F;N # Po 3 VAI COMMA..VAI QUESTION MARK
+A610..A61F;N # Lo 16 VAI SYLLABLE NDOLE FA..VAI SYMBOL JONG
+A620..A629;N # Nd 10 VAI DIGIT ZERO..VAI DIGIT NINE
+A62A..A62B;N # Lo 2 VAI SYLLABLE NDOLE MA..VAI SYLLABLE NDOLE DO
+A640..A66D;N # L& 46 CYRILLIC CAPITAL LETTER ZEMLYA..CYRILLIC SMALL LETTER DOUBLE MONOCULAR O
+A66E;N # Lo CYRILLIC LETTER MULTIOCULAR O
+A66F;N # Mn COMBINING CYRILLIC VZMET
+A670..A672;N # Me 3 COMBINING CYRILLIC TEN MILLIONS SIGN..COMBINING CYRILLIC THOUSAND MILLIONS SIGN
+A673;N # Po SLAVONIC ASTERISK
+A674..A67D;N # Mn 10 COMBINING CYRILLIC LETTER UKRAINIAN IE..COMBINING CYRILLIC PAYEROK
+A67E;N # Po CYRILLIC KAVYKA
+A67F;N # Lm CYRILLIC PAYEROK
+A680..A69B;N # L& 28 CYRILLIC CAPITAL LETTER DWE..CYRILLIC SMALL LETTER CROSSED O
+A69C..A69D;N # Lm 2 MODIFIER LETTER CYRILLIC HARD SIGN..MODIFIER LETTER CYRILLIC SOFT SIGN
+A69E..A69F;N # Mn 2 COMBINING CYRILLIC LETTER EF..COMBINING CYRILLIC LETTER IOTIFIED E
+A6A0..A6E5;N # Lo 70 BAMUM LETTER A..BAMUM LETTER KI
+A6E6..A6EF;N # Nl 10 BAMUM LETTER MO..BAMUM LETTER KOGHOM
+A6F0..A6F1;N # Mn 2 BAMUM COMBINING MARK KOQNDON..BAMUM COMBINING MARK TUKWENTIS
+A6F2..A6F7;N # Po 6 BAMUM NJAEMLI..BAMUM QUESTION MARK
+A700..A716;N # Sk 23 MODIFIER LETTER CHINESE TONE YIN PING..MODIFIER LETTER EXTRA-LOW LEFT-STEM TONE BAR
+A717..A71F;N # Lm 9 MODIFIER LETTER DOT VERTICAL BAR..MODIFIER LETTER LOW INVERTED EXCLAMATION MARK
+A720..A721;N # Sk 2 MODIFIER LETTER STRESS AND HIGH TONE..MODIFIER LETTER STRESS AND LOW TONE
+A722..A76F;N # L& 78 LATIN CAPITAL LETTER EGYPTOLOGICAL ALEF..LATIN SMALL LETTER CON
+A770;N # Lm MODIFIER LETTER US
+A771..A787;N # L& 23 LATIN SMALL LETTER DUM..LATIN SMALL LETTER INSULAR T
+A788;N # Lm MODIFIER LETTER LOW CIRCUMFLEX ACCENT
+A789..A78A;N # Sk 2 MODIFIER LETTER COLON..MODIFIER LETTER SHORT EQUALS SIGN
+A78B..A78E;N # L& 4 LATIN CAPITAL LETTER SALTILLO..LATIN SMALL LETTER L WITH RETROFLEX HOOK AND BELT
+A78F;N # Lo LATIN LETTER SINOLOGICAL DOT
+A790..A7AE;N # L& 31 LATIN CAPITAL LETTER N WITH DESCENDER..LATIN CAPITAL LETTER SMALL CAPITAL I
+A7B0..A7B7;N # L& 8 LATIN CAPITAL LETTER TURNED K..LATIN SMALL LETTER OMEGA
+A7F7;N # Lo LATIN EPIGRAPHIC LETTER SIDEWAYS I
+A7F8..A7F9;N # Lm 2 MODIFIER LETTER CAPITAL H WITH STROKE..MODIFIER LETTER SMALL LIGATURE OE
+A7FA;N # Ll LATIN LETTER SMALL CAPITAL TURNED M
+A7FB..A7FF;N # Lo 5 LATIN EPIGRAPHIC LETTER REVERSED F..LATIN EPIGRAPHIC LETTER ARCHAIC M
+A800..A801;N # Lo 2 SYLOTI NAGRI LETTER A..SYLOTI NAGRI LETTER I
+A802;N # Mn SYLOTI NAGRI SIGN DVISVARA
+A803..A805;N # Lo 3 SYLOTI NAGRI LETTER U..SYLOTI NAGRI LETTER O
+A806;N # Mn SYLOTI NAGRI SIGN HASANTA
+A807..A80A;N # Lo 4 SYLOTI NAGRI LETTER KO..SYLOTI NAGRI LETTER GHO
+A80B;N # Mn SYLOTI NAGRI SIGN ANUSVARA
+A80C..A822;N # Lo 23 SYLOTI NAGRI LETTER CO..SYLOTI NAGRI LETTER HO
+A823..A824;N # Mc 2 SYLOTI NAGRI VOWEL SIGN A..SYLOTI NAGRI VOWEL SIGN I
+A825..A826;N # Mn 2 SYLOTI NAGRI VOWEL SIGN U..SYLOTI NAGRI VOWEL SIGN E
+A827;N # Mc SYLOTI NAGRI VOWEL SIGN OO
+A828..A82B;N # So 4 SYLOTI NAGRI POETRY MARK-1..SYLOTI NAGRI POETRY MARK-4
+A830..A835;N # No 6 NORTH INDIC FRACTION ONE QUARTER..NORTH INDIC FRACTION THREE SIXTEENTHS
+A836..A837;N # So 2 NORTH INDIC QUARTER MARK..NORTH INDIC PLACEHOLDER MARK
+A838;N # Sc NORTH INDIC RUPEE MARK
+A839;N # So NORTH INDIC QUANTITY MARK
+A840..A873;N # Lo 52 PHAGS-PA LETTER KA..PHAGS-PA LETTER CANDRABINDU
+A874..A877;N # Po 4 PHAGS-PA SINGLE HEAD MARK..PHAGS-PA MARK DOUBLE SHAD
+A880..A881;N # Mc 2 SAURASHTRA SIGN ANUSVARA..SAURASHTRA SIGN VISARGA
+A882..A8B3;N # Lo 50 SAURASHTRA LETTER A..SAURASHTRA LETTER LLA
+A8B4..A8C3;N # Mc 16 SAURASHTRA CONSONANT SIGN HAARU..SAURASHTRA VOWEL SIGN AU
+A8C4..A8C5;N # Mn 2 SAURASHTRA SIGN VIRAMA..SAURASHTRA SIGN CANDRABINDU
+A8CE..A8CF;N # Po 2 SAURASHTRA DANDA..SAURASHTRA DOUBLE DANDA
+A8D0..A8D9;N # Nd 10 SAURASHTRA DIGIT ZERO..SAURASHTRA DIGIT NINE
+A8E0..A8F1;N # Mn 18 COMBINING DEVANAGARI DIGIT ZERO..COMBINING DEVANAGARI SIGN AVAGRAHA
+A8F2..A8F7;N # Lo 6 DEVANAGARI SIGN SPACING CANDRABINDU..DEVANAGARI SIGN CANDRABINDU AVAGRAHA
+A8F8..A8FA;N # Po 3 DEVANAGARI SIGN PUSHPIKA..DEVANAGARI CARET
+A8FB;N # Lo DEVANAGARI HEADSTROKE
+A8FC;N # Po DEVANAGARI SIGN SIDDHAM
+A8FD;N # Lo DEVANAGARI JAIN OM
+A900..A909;N # Nd 10 KAYAH LI DIGIT ZERO..KAYAH LI DIGIT NINE
+A90A..A925;N # Lo 28 KAYAH LI LETTER KA..KAYAH LI LETTER OO
+A926..A92D;N # Mn 8 KAYAH LI VOWEL UE..KAYAH LI TONE CALYA PLOPHU
+A92E..A92F;N # Po 2 KAYAH LI SIGN CWI..KAYAH LI SIGN SHYA
+A930..A946;N # Lo 23 REJANG LETTER KA..REJANG LETTER A
+A947..A951;N # Mn 11 REJANG VOWEL SIGN I..REJANG CONSONANT SIGN R
+A952..A953;N # Mc 2 REJANG CONSONANT SIGN H..REJANG VIRAMA
+A95F;N # Po REJANG SECTION MARK
+A960..A97C;W # Lo 29 HANGUL CHOSEONG TIKEUT-MIEUM..HANGUL CHOSEONG SSANGYEORINHIEUH
+A980..A982;N # Mn 3 JAVANESE SIGN PANYANGGA..JAVANESE SIGN LAYAR
+A983;N # Mc JAVANESE SIGN WIGNYAN
+A984..A9B2;N # Lo 47 JAVANESE LETTER A..JAVANESE LETTER HA
+A9B3;N # Mn JAVANESE SIGN CECAK TELU
+A9B4..A9B5;N # Mc 2 JAVANESE VOWEL SIGN TARUNG..JAVANESE VOWEL SIGN TOLONG
+A9B6..A9B9;N # Mn 4 JAVANESE VOWEL SIGN WULU..JAVANESE VOWEL SIGN SUKU MENDUT
+A9BA..A9BB;N # Mc 2 JAVANESE VOWEL SIGN TALING..JAVANESE VOWEL SIGN DIRGA MURE
+A9BC;N # Mn JAVANESE VOWEL SIGN PEPET
+A9BD..A9C0;N # Mc 4 JAVANESE CONSONANT SIGN KERET..JAVANESE PANGKON
+A9C1..A9CD;N # Po 13 JAVANESE LEFT RERENGGAN..JAVANESE TURNED PADA PISELEH
+A9CF;N # Lm JAVANESE PANGRANGKEP
+A9D0..A9D9;N # Nd 10 JAVANESE DIGIT ZERO..JAVANESE DIGIT NINE
+A9DE..A9DF;N # Po 2 JAVANESE PADA TIRTA TUMETES..JAVANESE PADA ISEN-ISEN
+A9E0..A9E4;N # Lo 5 MYANMAR LETTER SHAN GHA..MYANMAR LETTER SHAN BHA
+A9E5;N # Mn MYANMAR SIGN SHAN SAW
+A9E6;N # Lm MYANMAR MODIFIER LETTER SHAN REDUPLICATION
+A9E7..A9EF;N # Lo 9 MYANMAR LETTER TAI LAING NYA..MYANMAR LETTER TAI LAING NNA
+A9F0..A9F9;N # Nd 10 MYANMAR TAI LAING DIGIT ZERO..MYANMAR TAI LAING DIGIT NINE
+A9FA..A9FE;N # Lo 5 MYANMAR LETTER TAI LAING LLA..MYANMAR LETTER TAI LAING BHA
+AA00..AA28;N # Lo 41 CHAM LETTER A..CHAM LETTER HA
+AA29..AA2E;N # Mn 6 CHAM VOWEL SIGN AA..CHAM VOWEL SIGN OE
+AA2F..AA30;N # Mc 2 CHAM VOWEL SIGN O..CHAM VOWEL SIGN AI
+AA31..AA32;N # Mn 2 CHAM VOWEL SIGN AU..CHAM VOWEL SIGN UE
+AA33..AA34;N # Mc 2 CHAM CONSONANT SIGN YA..CHAM CONSONANT SIGN RA
+AA35..AA36;N # Mn 2 CHAM CONSONANT SIGN LA..CHAM CONSONANT SIGN WA
+AA40..AA42;N # Lo 3 CHAM LETTER FINAL K..CHAM LETTER FINAL NG
+AA43;N # Mn CHAM CONSONANT SIGN FINAL NG
+AA44..AA4B;N # Lo 8 CHAM LETTER FINAL CH..CHAM LETTER FINAL SS
+AA4C;N # Mn CHAM CONSONANT SIGN FINAL M
+AA4D;N # Mc CHAM CONSONANT SIGN FINAL H
+AA50..AA59;N # Nd 10 CHAM DIGIT ZERO..CHAM DIGIT NINE
+AA5C..AA5F;N # Po 4 CHAM PUNCTUATION SPIRAL..CHAM PUNCTUATION TRIPLE DANDA
+AA60..AA6F;N # Lo 16 MYANMAR LETTER KHAMTI GA..MYANMAR LETTER KHAMTI FA
+AA70;N # Lm MYANMAR MODIFIER LETTER KHAMTI REDUPLICATION
+AA71..AA76;N # Lo 6 MYANMAR LETTER KHAMTI XA..MYANMAR LOGOGRAM KHAMTI HM
+AA77..AA79;N # So 3 MYANMAR SYMBOL AITON EXCLAMATION..MYANMAR SYMBOL AITON TWO
+AA7A;N # Lo MYANMAR LETTER AITON RA
+AA7B;N # Mc MYANMAR SIGN PAO KAREN TONE
+AA7C;N # Mn MYANMAR SIGN TAI LAING TONE-2
+AA7D;N # Mc MYANMAR SIGN TAI LAING TONE-5
+AA7E..AA7F;N # Lo 2 MYANMAR LETTER SHWE PALAUNG CHA..MYANMAR LETTER SHWE PALAUNG SHA
+AA80..AAAF;N # Lo 48 TAI VIET LETTER LOW KO..TAI VIET LETTER HIGH O
+AAB0;N # Mn TAI VIET MAI KANG
+AAB1;N # Lo TAI VIET VOWEL AA
+AAB2..AAB4;N # Mn 3 TAI VIET VOWEL I..TAI VIET VOWEL U
+AAB5..AAB6;N # Lo 2 TAI VIET VOWEL E..TAI VIET VOWEL O
+AAB7..AAB8;N # Mn 2 TAI VIET MAI KHIT..TAI VIET VOWEL IA
+AAB9..AABD;N # Lo 5 TAI VIET VOWEL UEA..TAI VIET VOWEL AN
+AABE..AABF;N # Mn 2 TAI VIET VOWEL AM..TAI VIET TONE MAI EK
+AAC0;N # Lo TAI VIET TONE MAI NUENG
+AAC1;N # Mn TAI VIET TONE MAI THO
+AAC2;N # Lo TAI VIET TONE MAI SONG
+AADB..AADC;N # Lo 2 TAI VIET SYMBOL KON..TAI VIET SYMBOL NUENG
+AADD;N # Lm TAI VIET SYMBOL SAM
+AADE..AADF;N # Po 2 TAI VIET SYMBOL HO HOI..TAI VIET SYMBOL KOI KOI
+AAE0..AAEA;N # Lo 11 MEETEI MAYEK LETTER E..MEETEI MAYEK LETTER SSA
+AAEB;N # Mc MEETEI MAYEK VOWEL SIGN II
+AAEC..AAED;N # Mn 2 MEETEI MAYEK VOWEL SIGN UU..MEETEI MAYEK VOWEL SIGN AAI
+AAEE..AAEF;N # Mc 2 MEETEI MAYEK VOWEL SIGN AU..MEETEI MAYEK VOWEL SIGN AAU
+AAF0..AAF1;N # Po 2 MEETEI MAYEK CHEIKHAN..MEETEI MAYEK AHANG KHUDAM
+AAF2;N # Lo MEETEI MAYEK ANJI
+AAF3..AAF4;N # Lm 2 MEETEI MAYEK SYLLABLE REPETITION MARK..MEETEI MAYEK WORD REPETITION MARK
+AAF5;N # Mc MEETEI MAYEK VOWEL SIGN VISARGA
+AAF6;N # Mn MEETEI MAYEK VIRAMA
+AB01..AB06;N # Lo 6 ETHIOPIC SYLLABLE TTHU..ETHIOPIC SYLLABLE TTHO
+AB09..AB0E;N # Lo 6 ETHIOPIC SYLLABLE DDHU..ETHIOPIC SYLLABLE DDHO
+AB11..AB16;N # Lo 6 ETHIOPIC SYLLABLE DZU..ETHIOPIC SYLLABLE DZO
+AB20..AB26;N # Lo 7 ETHIOPIC SYLLABLE CCHHA..ETHIOPIC SYLLABLE CCHHO
+AB28..AB2E;N # Lo 7 ETHIOPIC SYLLABLE BBA..ETHIOPIC SYLLABLE BBO
+AB30..AB5A;N # Ll 43 LATIN SMALL LETTER BARRED ALPHA..LATIN SMALL LETTER Y WITH SHORT RIGHT LEG
+AB5B;N # Sk MODIFIER BREVE WITH INVERTED BREVE
+AB5C..AB5F;N # Lm 4 MODIFIER LETTER SMALL HENG..MODIFIER LETTER SMALL U WITH LEFT HOOK
+AB60..AB65;N # Ll 6 LATIN SMALL LETTER SAKHA YAT..GREEK LETTER SMALL CAPITAL OMEGA
+AB70..ABBF;N # Ll 80 CHEROKEE SMALL LETTER A..CHEROKEE SMALL LETTER YA
+ABC0..ABE2;N # Lo 35 MEETEI MAYEK LETTER KOK..MEETEI MAYEK LETTER I LONSUM
+ABE3..ABE4;N # Mc 2 MEETEI MAYEK VOWEL SIGN ONAP..MEETEI MAYEK VOWEL SIGN INAP
+ABE5;N # Mn MEETEI MAYEK VOWEL SIGN ANAP
+ABE6..ABE7;N # Mc 2 MEETEI MAYEK VOWEL SIGN YENAP..MEETEI MAYEK VOWEL SIGN SOUNAP
+ABE8;N # Mn MEETEI MAYEK VOWEL SIGN UNAP
+ABE9..ABEA;N # Mc 2 MEETEI MAYEK VOWEL SIGN CHEINAP..MEETEI MAYEK VOWEL SIGN NUNG
+ABEB;N # Po MEETEI MAYEK CHEIKHEI
+ABEC;N # Mc MEETEI MAYEK LUM IYEK
+ABED;N # Mn MEETEI MAYEK APUN IYEK
+ABF0..ABF9;N # Nd 10 MEETEI MAYEK DIGIT ZERO..MEETEI MAYEK DIGIT NINE
+AC00..D7A3;W # Lo 11172 HANGUL SYLLABLE GA..HANGUL SYLLABLE HIH
+D7B0..D7C6;N # Lo 23 HANGUL JUNGSEONG O-YEO..HANGUL JUNGSEONG ARAEA-E
+D7CB..D7FB;N # Lo 49 HANGUL JONGSEONG NIEUN-RIEUL..HANGUL JONGSEONG PHIEUPH-THIEUTH
+D800..DB7F;N # Cs 896 <surrogate-D800>..<surrogate-DB7F>
+DB80..DBFF;N # Cs 128 <surrogate-DB80>..<surrogate-DBFF>
+DC00..DFFF;N # Cs 1024 <surrogate-DC00>..<surrogate-DFFF>
+E000..F8FF;A # Co 6400 <private-use-E000>..<private-use-F8FF>
+F900..FA6D;W # Lo 366 CJK COMPATIBILITY IDEOGRAPH-F900..CJK COMPATIBILITY IDEOGRAPH-FA6D
+FA6E..FA6F;W # Cn 2 <reserved-FA6E>..<reserved-FA6F>
+FA70..FAD9;W # Lo 106 CJK COMPATIBILITY IDEOGRAPH-FA70..CJK COMPATIBILITY IDEOGRAPH-FAD9
+FADA..FAFF;W # Cn 38 <reserved-FADA>..<reserved-FAFF>
+FB00..FB06;N # Ll 7 LATIN SMALL LIGATURE FF..LATIN SMALL LIGATURE ST
+FB13..FB17;N # Ll 5 ARMENIAN SMALL LIGATURE MEN NOW..ARMENIAN SMALL LIGATURE MEN XEH
+FB1D;N # Lo HEBREW LETTER YOD WITH HIRIQ
+FB1E;N # Mn HEBREW POINT JUDEO-SPANISH VARIKA
+FB1F..FB28;N # Lo 10 HEBREW LIGATURE YIDDISH YOD YOD PATAH..HEBREW LETTER WIDE TAV
+FB29;N # Sm HEBREW LETTER ALTERNATIVE PLUS SIGN
+FB2A..FB36;N # Lo 13 HEBREW LETTER SHIN WITH SHIN DOT..HEBREW LETTER ZAYIN WITH DAGESH
+FB38..FB3C;N # Lo 5 HEBREW LETTER TET WITH DAGESH..HEBREW LETTER LAMED WITH DAGESH
+FB3E;N # Lo HEBREW LETTER MEM WITH DAGESH
+FB40..FB41;N # Lo 2 HEBREW LETTER NUN WITH DAGESH..HEBREW LETTER SAMEKH WITH DAGESH
+FB43..FB44;N # Lo 2 HEBREW LETTER FINAL PE WITH DAGESH..HEBREW LETTER PE WITH DAGESH
+FB46..FB4F;N # Lo 10 HEBREW LETTER TSADI WITH DAGESH..HEBREW LIGATURE ALEF LAMED
+FB50..FBB1;N # Lo 98 ARABIC LETTER ALEF WASLA ISOLATED FORM..ARABIC LETTER YEH BARREE WITH HAMZA ABOVE FINAL FORM
+FBB2..FBC1;N # Sk 16 ARABIC SYMBOL DOT ABOVE..ARABIC SYMBOL SMALL TAH BELOW
+FBD3..FD3D;N # Lo 363 ARABIC LETTER NG ISOLATED FORM..ARABIC LIGATURE ALEF WITH FATHATAN ISOLATED FORM
+FD3E;N # Pe ORNATE LEFT PARENTHESIS
+FD3F;N # Ps ORNATE RIGHT PARENTHESIS
+FD50..FD8F;N # Lo 64 ARABIC LIGATURE TEH WITH JEEM WITH MEEM INITIAL FORM..ARABIC LIGATURE MEEM WITH KHAH WITH MEEM INITIAL FORM
+FD92..FDC7;N # Lo 54 ARABIC LIGATURE MEEM WITH JEEM WITH KHAH INITIAL FORM..ARABIC LIGATURE NOON WITH JEEM WITH YEH FINAL FORM
+FDF0..FDFB;N # Lo 12 ARABIC LIGATURE SALLA USED AS KORANIC STOP SIGN ISOLATED FORM..ARABIC LIGATURE JALLAJALALOUHOU
+FDFC;N # Sc RIAL SIGN
+FDFD;N # So ARABIC LIGATURE BISMILLAH AR-RAHMAN AR-RAHEEM
+FE00..FE0F;A # Mn 16 VARIATION SELECTOR-1..VARIATION SELECTOR-16
+FE10..FE16;W # Po 7 PRESENTATION FORM FOR VERTICAL COMMA..PRESENTATION FORM FOR VERTICAL QUESTION MARK
+FE17;W # Ps PRESENTATION FORM FOR VERTICAL LEFT WHITE LENTICULAR BRACKET
+FE18;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT WHITE LENTICULAR BRAKCET
+FE19;W # Po PRESENTATION FORM FOR VERTICAL HORIZONTAL ELLIPSIS
+FE20..FE2F;N # Mn 16 COMBINING LIGATURE LEFT HALF..COMBINING CYRILLIC TITLO RIGHT HALF
+FE30;W # Po PRESENTATION FORM FOR VERTICAL TWO DOT LEADER
+FE31..FE32;W # Pd 2 PRESENTATION FORM FOR VERTICAL EM DASH..PRESENTATION FORM FOR VERTICAL EN DASH
+FE33..FE34;W # Pc 2 PRESENTATION FORM FOR VERTICAL LOW LINE..PRESENTATION FORM FOR VERTICAL WAVY LOW LINE
+FE35;W # Ps PRESENTATION FORM FOR VERTICAL LEFT PARENTHESIS
+FE36;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT PARENTHESIS
+FE37;W # Ps PRESENTATION FORM FOR VERTICAL LEFT CURLY BRACKET
+FE38;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT CURLY BRACKET
+FE39;W # Ps PRESENTATION FORM FOR VERTICAL LEFT TORTOISE SHELL BRACKET
+FE3A;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT TORTOISE SHELL BRACKET
+FE3B;W # Ps PRESENTATION FORM FOR VERTICAL LEFT BLACK LENTICULAR BRACKET
+FE3C;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT BLACK LENTICULAR BRACKET
+FE3D;W # Ps PRESENTATION FORM FOR VERTICAL LEFT DOUBLE ANGLE BRACKET
+FE3E;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT DOUBLE ANGLE BRACKET
+FE3F;W # Ps PRESENTATION FORM FOR VERTICAL LEFT ANGLE BRACKET
+FE40;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT ANGLE BRACKET
+FE41;W # Ps PRESENTATION FORM FOR VERTICAL LEFT CORNER BRACKET
+FE42;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT CORNER BRACKET
+FE43;W # Ps PRESENTATION FORM FOR VERTICAL LEFT WHITE CORNER BRACKET
+FE44;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT WHITE CORNER BRACKET
+FE45..FE46;W # Po 2 SESAME DOT..WHITE SESAME DOT
+FE47;W # Ps PRESENTATION FORM FOR VERTICAL LEFT SQUARE BRACKET
+FE48;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT SQUARE BRACKET
+FE49..FE4C;W # Po 4 DASHED OVERLINE..DOUBLE WAVY OVERLINE
+FE4D..FE4F;W # Pc 3 DASHED LOW LINE..WAVY LOW LINE
+FE50..FE52;W # Po 3 SMALL COMMA..SMALL FULL STOP
+FE54..FE57;W # Po 4 SMALL SEMICOLON..SMALL EXCLAMATION MARK
+FE58;W # Pd SMALL EM DASH
+FE59;W # Ps SMALL LEFT PARENTHESIS
+FE5A;W # Pe SMALL RIGHT PARENTHESIS
+FE5B;W # Ps SMALL LEFT CURLY BRACKET
+FE5C;W # Pe SMALL RIGHT CURLY BRACKET
+FE5D;W # Ps SMALL LEFT TORTOISE SHELL BRACKET
+FE5E;W # Pe SMALL RIGHT TORTOISE SHELL BRACKET
+FE5F..FE61;W # Po 3 SMALL NUMBER SIGN..SMALL ASTERISK
+FE62;W # Sm SMALL PLUS SIGN
+FE63;W # Pd SMALL HYPHEN-MINUS
+FE64..FE66;W # Sm 3 SMALL LESS-THAN SIGN..SMALL EQUALS SIGN
+FE68;W # Po SMALL REVERSE SOLIDUS
+FE69;W # Sc SMALL DOLLAR SIGN
+FE6A..FE6B;W # Po 2 SMALL PERCENT SIGN..SMALL COMMERCIAL AT
+FE70..FE74;N # Lo 5 ARABIC FATHATAN ISOLATED FORM..ARABIC KASRATAN ISOLATED FORM
+FE76..FEFC;N # Lo 135 ARABIC FATHA ISOLATED FORM..ARABIC LIGATURE LAM WITH ALEF FINAL FORM
+FEFF;N # Cf ZERO WIDTH NO-BREAK SPACE
+FF01..FF03;F # Po 3 FULLWIDTH EXCLAMATION MARK..FULLWIDTH NUMBER SIGN
+FF04;F # Sc FULLWIDTH DOLLAR SIGN
+FF05..FF07;F # Po 3 FULLWIDTH PERCENT SIGN..FULLWIDTH APOSTROPHE
+FF08;F # Ps FULLWIDTH LEFT PARENTHESIS
+FF09;F # Pe FULLWIDTH RIGHT PARENTHESIS
+FF0A;F # Po FULLWIDTH ASTERISK
+FF0B;F # Sm FULLWIDTH PLUS SIGN
+FF0C;F # Po FULLWIDTH COMMA
+FF0D;F # Pd FULLWIDTH HYPHEN-MINUS
+FF0E..FF0F;F # Po 2 FULLWIDTH FULL STOP..FULLWIDTH SOLIDUS
+FF10..FF19;F # Nd 10 FULLWIDTH DIGIT ZERO..FULLWIDTH DIGIT NINE
+FF1A..FF1B;F # Po 2 FULLWIDTH COLON..FULLWIDTH SEMICOLON
+FF1C..FF1E;F # Sm 3 FULLWIDTH LESS-THAN SIGN..FULLWIDTH GREATER-THAN SIGN
+FF1F..FF20;F # Po 2 FULLWIDTH QUESTION MARK..FULLWIDTH COMMERCIAL AT
+FF21..FF3A;F # Lu 26 FULLWIDTH LATIN CAPITAL LETTER A..FULLWIDTH LATIN CAPITAL LETTER Z
+FF3B;F # Ps FULLWIDTH LEFT SQUARE BRACKET
+FF3C;F # Po FULLWIDTH REVERSE SOLIDUS
+FF3D;F # Pe FULLWIDTH RIGHT SQUARE BRACKET
+FF3E;F # Sk FULLWIDTH CIRCUMFLEX ACCENT
+FF3F;F # Pc FULLWIDTH LOW LINE
+FF40;F # Sk FULLWIDTH GRAVE ACCENT
+FF41..FF5A;F # Ll 26 FULLWIDTH LATIN SMALL LETTER A..FULLWIDTH LATIN SMALL LETTER Z
+FF5B;F # Ps FULLWIDTH LEFT CURLY BRACKET
+FF5C;F # Sm FULLWIDTH VERTICAL LINE
+FF5D;F # Pe FULLWIDTH RIGHT CURLY BRACKET
+FF5E;F # Sm FULLWIDTH TILDE
+FF5F;F # Ps FULLWIDTH LEFT WHITE PARENTHESIS
+FF60;F # Pe FULLWIDTH RIGHT WHITE PARENTHESIS
+FF61;H # Po HALFWIDTH IDEOGRAPHIC FULL STOP
+FF62;H # Ps HALFWIDTH LEFT CORNER BRACKET
+FF63;H # Pe HALFWIDTH RIGHT CORNER BRACKET
+FF64..FF65;H # Po 2 HALFWIDTH IDEOGRAPHIC COMMA..HALFWIDTH KATAKANA MIDDLE DOT
+FF66..FF6F;H # Lo 10 HALFWIDTH KATAKANA LETTER WO..HALFWIDTH KATAKANA LETTER SMALL TU
+FF70;H # Lm HALFWIDTH KATAKANA-HIRAGANA PROLONGED SOUND MARK
+FF71..FF9D;H # Lo 45 HALFWIDTH KATAKANA LETTER A..HALFWIDTH KATAKANA LETTER N
+FF9E..FF9F;H # Lm 2 HALFWIDTH KATAKANA VOICED SOUND MARK..HALFWIDTH KATAKANA SEMI-VOICED SOUND MARK
+FFA0..FFBE;H # Lo 31 HALFWIDTH HANGUL FILLER..HALFWIDTH HANGUL LETTER HIEUH
+FFC2..FFC7;H # Lo 6 HALFWIDTH HANGUL LETTER A..HALFWIDTH HANGUL LETTER E
+FFCA..FFCF;H # Lo 6 HALFWIDTH HANGUL LETTER YEO..HALFWIDTH HANGUL LETTER OE
+FFD2..FFD7;H # Lo 6 HALFWIDTH HANGUL LETTER YO..HALFWIDTH HANGUL LETTER YU
+FFDA..FFDC;H # Lo 3 HALFWIDTH HANGUL LETTER EU..HALFWIDTH HANGUL LETTER I
+FFE0..FFE1;F # Sc 2 FULLWIDTH CENT SIGN..FULLWIDTH POUND SIGN
+FFE2;F # Sm FULLWIDTH NOT SIGN
+FFE3;F # Sk FULLWIDTH MACRON
+FFE4;F # So FULLWIDTH BROKEN BAR
+FFE5..FFE6;F # Sc 2 FULLWIDTH YEN SIGN..FULLWIDTH WON SIGN
+FFE8;H # So HALFWIDTH FORMS LIGHT VERTICAL
+FFE9..FFEC;H # Sm 4 HALFWIDTH LEFTWARDS ARROW..HALFWIDTH DOWNWARDS ARROW
+FFED..FFEE;H # So 2 HALFWIDTH BLACK SQUARE..HALFWIDTH WHITE CIRCLE
+FFF9..FFFB;N # Cf 3 INTERLINEAR ANNOTATION ANCHOR..INTERLINEAR ANNOTATION TERMINATOR
+FFFC;N # So OBJECT REPLACEMENT CHARACTER
+FFFD;A # So REPLACEMENT CHARACTER
+10000..1000B;N # Lo 12 LINEAR B SYLLABLE B008 A..LINEAR B SYLLABLE B046 JE
+1000D..10026;N # Lo 26 LINEAR B SYLLABLE B036 JO..LINEAR B SYLLABLE B032 QO
+10028..1003A;N # Lo 19 LINEAR B SYLLABLE B060 RA..LINEAR B SYLLABLE B042 WO
+1003C..1003D;N # Lo 2 LINEAR B SYLLABLE B017 ZA..LINEAR B SYLLABLE B074 ZE
+1003F..1004D;N # Lo 15 LINEAR B SYLLABLE B020 ZO..LINEAR B SYLLABLE B091 TWO
+10050..1005D;N # Lo 14 LINEAR B SYMBOL B018..LINEAR B SYMBOL B089
+10080..100FA;N # Lo 123 LINEAR B IDEOGRAM B100 MAN..LINEAR B IDEOGRAM VESSEL B305
+10100..10102;N # Po 3 AEGEAN WORD SEPARATOR LINE..AEGEAN CHECK MARK
+10107..10133;N # No 45 AEGEAN NUMBER ONE..AEGEAN NUMBER NINETY THOUSAND
+10137..1013F;N # So 9 AEGEAN WEIGHT BASE UNIT..AEGEAN MEASURE THIRD SUBUNIT
+10140..10174;N # Nl 53 GREEK ACROPHONIC ATTIC ONE QUARTER..GREEK ACROPHONIC STRATIAN FIFTY MNAS
+10175..10178;N # No 4 GREEK ONE HALF SIGN..GREEK THREE QUARTERS SIGN
+10179..10189;N # So 17 GREEK YEAR SIGN..GREEK TRYBLION BASE SIGN
+1018A..1018B;N # No 2 GREEK ZERO SIGN..GREEK ONE QUARTER SIGN
+1018C..1018E;N # So 3 GREEK SINUSOID SIGN..NOMISMA SIGN
+10190..1019B;N # So 12 ROMAN SEXTANS SIGN..ROMAN CENTURIAL SIGN
+101A0;N # So GREEK SYMBOL TAU RHO
+101D0..101FC;N # So 45 PHAISTOS DISC SIGN PEDESTRIAN..PHAISTOS DISC SIGN WAVY BAND
+101FD;N # Mn PHAISTOS DISC SIGN COMBINING OBLIQUE STROKE
+10280..1029C;N # Lo 29 LYCIAN LETTER A..LYCIAN LETTER X
+102A0..102D0;N # Lo 49 CARIAN LETTER A..CARIAN LETTER UUU3
+102E0;N # Mn COPTIC EPACT THOUSANDS MARK
+102E1..102FB;N # No 27 COPTIC EPACT DIGIT ONE..COPTIC EPACT NUMBER NINE HUNDRED
+10300..1031F;N # Lo 32 OLD ITALIC LETTER A..OLD ITALIC LETTER ESS
+10320..10323;N # No 4 OLD ITALIC NUMERAL ONE..OLD ITALIC NUMERAL FIFTY
+1032D..1032F;N # Lo 3 OLD ITALIC LETTER YE..OLD ITALIC LETTER SOUTHERN TSE
+10330..10340;N # Lo 17 GOTHIC LETTER AHSA..GOTHIC LETTER PAIRTHRA
+10341;N # Nl GOTHIC LETTER NINETY
+10342..10349;N # Lo 8 GOTHIC LETTER RAIDA..GOTHIC LETTER OTHAL
+1034A;N # Nl GOTHIC LETTER NINE HUNDRED
+10350..10375;N # Lo 38 OLD PERMIC LETTER AN..OLD PERMIC LETTER IA
+10376..1037A;N # Mn 5 COMBINING OLD PERMIC LETTER AN..COMBINING OLD PERMIC LETTER SII
+10380..1039D;N # Lo 30 UGARITIC LETTER ALPA..UGARITIC LETTER SSU
+1039F;N # Po UGARITIC WORD DIVIDER
+103A0..103C3;N # Lo 36 OLD PERSIAN SIGN A..OLD PERSIAN SIGN HA
+103C8..103CF;N # Lo 8 OLD PERSIAN SIGN AURAMAZDAA..OLD PERSIAN SIGN BUUMISH
+103D0;N # Po OLD PERSIAN WORD DIVIDER
+103D1..103D5;N # Nl 5 OLD PERSIAN NUMBER ONE..OLD PERSIAN NUMBER HUNDRED
+10400..1044F;N # L& 80 DESERET CAPITAL LETTER LONG I..DESERET SMALL LETTER EW
+10450..1047F;N # Lo 48 SHAVIAN LETTER PEEP..SHAVIAN LETTER YEW
+10480..1049D;N # Lo 30 OSMANYA LETTER ALEF..OSMANYA LETTER OO
+104A0..104A9;N # Nd 10 OSMANYA DIGIT ZERO..OSMANYA DIGIT NINE
+104B0..104D3;N # Lu 36 OSAGE CAPITAL LETTER A..OSAGE CAPITAL LETTER ZHA
+104D8..104FB;N # Ll 36 OSAGE SMALL LETTER A..OSAGE SMALL LETTER ZHA
+10500..10527;N # Lo 40 ELBASAN LETTER A..ELBASAN LETTER KHE
+10530..10563;N # Lo 52 CAUCASIAN ALBANIAN LETTER ALT..CAUCASIAN ALBANIAN LETTER KIW
+1056F;N # Po CAUCASIAN ALBANIAN CITATION MARK
+10600..10736;N # Lo 311 LINEAR A SIGN AB001..LINEAR A SIGN A664
+10740..10755;N # Lo 22 LINEAR A SIGN A701 A..LINEAR A SIGN A732 JE
+10760..10767;N # Lo 8 LINEAR A SIGN A800..LINEAR A SIGN A807
+10800..10805;N # Lo 6 CYPRIOT SYLLABLE A..CYPRIOT SYLLABLE JA
+10808;N # Lo CYPRIOT SYLLABLE JO
+1080A..10835;N # Lo 44 CYPRIOT SYLLABLE KA..CYPRIOT SYLLABLE WO
+10837..10838;N # Lo 2 CYPRIOT SYLLABLE XA..CYPRIOT SYLLABLE XE
+1083C;N # Lo CYPRIOT SYLLABLE ZA
+1083F;N # Lo CYPRIOT SYLLABLE ZO
+10840..10855;N # Lo 22 IMPERIAL ARAMAIC LETTER ALEPH..IMPERIAL ARAMAIC LETTER TAW
+10857;N # Po IMPERIAL ARAMAIC SECTION SIGN
+10858..1085F;N # No 8 IMPERIAL ARAMAIC NUMBER ONE..IMPERIAL ARAMAIC NUMBER TEN THOUSAND
+10860..10876;N # Lo 23 PALMYRENE LETTER ALEPH..PALMYRENE LETTER TAW
+10877..10878;N # So 2 PALMYRENE LEFT-POINTING FLEURON..PALMYRENE RIGHT-POINTING FLEURON
+10879..1087F;N # No 7 PALMYRENE NUMBER ONE..PALMYRENE NUMBER TWENTY
+10880..1089E;N # Lo 31 NABATAEAN LETTER FINAL ALEPH..NABATAEAN LETTER TAW
+108A7..108AF;N # No 9 NABATAEAN NUMBER ONE..NABATAEAN NUMBER ONE HUNDRED
+108E0..108F2;N # Lo 19 HATRAN LETTER ALEPH..HATRAN LETTER QOPH
+108F4..108F5;N # Lo 2 HATRAN LETTER SHIN..HATRAN LETTER TAW
+108FB..108FF;N # No 5 HATRAN NUMBER ONE..HATRAN NUMBER ONE HUNDRED
+10900..10915;N # Lo 22 PHOENICIAN LETTER ALF..PHOENICIAN LETTER TAU
+10916..1091B;N # No 6 PHOENICIAN NUMBER ONE..PHOENICIAN NUMBER THREE
+1091F;N # Po PHOENICIAN WORD SEPARATOR
+10920..10939;N # Lo 26 LYDIAN LETTER A..LYDIAN LETTER C
+1093F;N # Po LYDIAN TRIANGULAR MARK
+10980..1099F;N # Lo 32 MEROITIC HIEROGLYPHIC LETTER A..MEROITIC HIEROGLYPHIC SYMBOL VIDJ-2
+109A0..109B7;N # Lo 24 MEROITIC CURSIVE LETTER A..MEROITIC CURSIVE LETTER DA
+109BC..109BD;N # No 2 MEROITIC CURSIVE FRACTION ELEVEN TWELFTHS..MEROITIC CURSIVE FRACTION ONE HALF
+109BE..109BF;N # Lo 2 MEROITIC CURSIVE LOGOGRAM RMT..MEROITIC CURSIVE LOGOGRAM IMN
+109C0..109CF;N # No 16 MEROITIC CURSIVE NUMBER ONE..MEROITIC CURSIVE NUMBER SEVENTY
+109D2..109FF;N # No 46 MEROITIC CURSIVE NUMBER ONE HUNDRED..MEROITIC CURSIVE FRACTION TEN TWELFTHS
+10A00;N # Lo KHAROSHTHI LETTER A
+10A01..10A03;N # Mn 3 KHAROSHTHI VOWEL SIGN I..KHAROSHTHI VOWEL SIGN VOCALIC R
+10A05..10A06;N # Mn 2 KHAROSHTHI VOWEL SIGN E..KHAROSHTHI VOWEL SIGN O
+10A0C..10A0F;N # Mn 4 KHAROSHTHI VOWEL LENGTH MARK..KHAROSHTHI SIGN VISARGA
+10A10..10A13;N # Lo 4 KHAROSHTHI LETTER KA..KHAROSHTHI LETTER GHA
+10A15..10A17;N # Lo 3 KHAROSHTHI LETTER CA..KHAROSHTHI LETTER JA
+10A19..10A33;N # Lo 27 KHAROSHTHI LETTER NYA..KHAROSHTHI LETTER TTTHA
+10A38..10A3A;N # Mn 3 KHAROSHTHI SIGN BAR ABOVE..KHAROSHTHI SIGN DOT BELOW
+10A3F;N # Mn KHAROSHTHI VIRAMA
+10A40..10A47;N # No 8 KHAROSHTHI DIGIT ONE..KHAROSHTHI NUMBER ONE THOUSAND
+10A50..10A58;N # Po 9 KHAROSHTHI PUNCTUATION DOT..KHAROSHTHI PUNCTUATION LINES
+10A60..10A7C;N # Lo 29 OLD SOUTH ARABIAN LETTER HE..OLD SOUTH ARABIAN LETTER THETH
+10A7D..10A7E;N # No 2 OLD SOUTH ARABIAN NUMBER ONE..OLD SOUTH ARABIAN NUMBER FIFTY
+10A7F;N # Po OLD SOUTH ARABIAN NUMERIC INDICATOR
+10A80..10A9C;N # Lo 29 OLD NORTH ARABIAN LETTER HEH..OLD NORTH ARABIAN LETTER ZAH
+10A9D..10A9F;N # No 3 OLD NORTH ARABIAN NUMBER ONE..OLD NORTH ARABIAN NUMBER TWENTY
+10AC0..10AC7;N # Lo 8 MANICHAEAN LETTER ALEPH..MANICHAEAN LETTER WAW
+10AC8;N # So MANICHAEAN SIGN UD
+10AC9..10AE4;N # Lo 28 MANICHAEAN LETTER ZAYIN..MANICHAEAN LETTER TAW
+10AE5..10AE6;N # Mn 2 MANICHAEAN ABBREVIATION MARK ABOVE..MANICHAEAN ABBREVIATION MARK BELOW
+10AEB..10AEF;N # No 5 MANICHAEAN NUMBER ONE..MANICHAEAN NUMBER ONE HUNDRED
+10AF0..10AF6;N # Po 7 MANICHAEAN PUNCTUATION STAR..MANICHAEAN PUNCTUATION LINE FILLER
+10B00..10B35;N # Lo 54 AVESTAN LETTER A..AVESTAN LETTER HE
+10B39..10B3F;N # Po 7 AVESTAN ABBREVIATION MARK..LARGE ONE RING OVER TWO RINGS PUNCTUATION
+10B40..10B55;N # Lo 22 INSCRIPTIONAL PARTHIAN LETTER ALEPH..INSCRIPTIONAL PARTHIAN LETTER TAW
+10B58..10B5F;N # No 8 INSCRIPTIONAL PARTHIAN NUMBER ONE..INSCRIPTIONAL PARTHIAN NUMBER ONE THOUSAND
+10B60..10B72;N # Lo 19 INSCRIPTIONAL PAHLAVI LETTER ALEPH..INSCRIPTIONAL PAHLAVI LETTER TAW
+10B78..10B7F;N # No 8 INSCRIPTIONAL PAHLAVI NUMBER ONE..INSCRIPTIONAL PAHLAVI NUMBER ONE THOUSAND
+10B80..10B91;N # Lo 18 PSALTER PAHLAVI LETTER ALEPH..PSALTER PAHLAVI LETTER TAW
+10B99..10B9C;N # Po 4 PSALTER PAHLAVI SECTION MARK..PSALTER PAHLAVI FOUR DOTS WITH DOT
+10BA9..10BAF;N # No 7 PSALTER PAHLAVI NUMBER ONE..PSALTER PAHLAVI NUMBER ONE HUNDRED
+10C00..10C48;N # Lo 73 OLD TURKIC LETTER ORKHON A..OLD TURKIC LETTER ORKHON BASH
+10C80..10CB2;N # Lu 51 OLD HUNGARIAN CAPITAL LETTER A..OLD HUNGARIAN CAPITAL LETTER US
+10CC0..10CF2;N # Ll 51 OLD HUNGARIAN SMALL LETTER A..OLD HUNGARIAN SMALL LETTER US
+10CFA..10CFF;N # No 6 OLD HUNGARIAN NUMBER ONE..OLD HUNGARIAN NUMBER ONE THOUSAND
+10E60..10E7E;N # No 31 RUMI DIGIT ONE..RUMI FRACTION TWO THIRDS
+11000;N # Mc BRAHMI SIGN CANDRABINDU
+11001;N # Mn BRAHMI SIGN ANUSVARA
+11002;N # Mc BRAHMI SIGN VISARGA
+11003..11037;N # Lo 53 BRAHMI SIGN JIHVAMULIYA..BRAHMI LETTER OLD TAMIL NNNA
+11038..11046;N # Mn 15 BRAHMI VOWEL SIGN AA..BRAHMI VIRAMA
+11047..1104D;N # Po 7 BRAHMI DANDA..BRAHMI PUNCTUATION LOTUS
+11052..11065;N # No 20 BRAHMI NUMBER ONE..BRAHMI NUMBER ONE THOUSAND
+11066..1106F;N # Nd 10 BRAHMI DIGIT ZERO..BRAHMI DIGIT NINE
+1107F;N # Mn BRAHMI NUMBER JOINER
+11080..11081;N # Mn 2 KAITHI SIGN CANDRABINDU..KAITHI SIGN ANUSVARA
+11082;N # Mc KAITHI SIGN VISARGA
+11083..110AF;N # Lo 45 KAITHI LETTER A..KAITHI LETTER HA
+110B0..110B2;N # Mc 3 KAITHI VOWEL SIGN AA..KAITHI VOWEL SIGN II
+110B3..110B6;N # Mn 4 KAITHI VOWEL SIGN U..KAITHI VOWEL SIGN AI
+110B7..110B8;N # Mc 2 KAITHI VOWEL SIGN O..KAITHI VOWEL SIGN AU
+110B9..110BA;N # Mn 2 KAITHI SIGN VIRAMA..KAITHI SIGN NUKTA
+110BB..110BC;N # Po 2 KAITHI ABBREVIATION SIGN..KAITHI ENUMERATION SIGN
+110BD;N # Cf KAITHI NUMBER SIGN
+110BE..110C1;N # Po 4 KAITHI SECTION MARK..KAITHI DOUBLE DANDA
+110D0..110E8;N # Lo 25 SORA SOMPENG LETTER SAH..SORA SOMPENG LETTER MAE
+110F0..110F9;N # Nd 10 SORA SOMPENG DIGIT ZERO..SORA SOMPENG DIGIT NINE
+11100..11102;N # Mn 3 CHAKMA SIGN CANDRABINDU..CHAKMA SIGN VISARGA
+11103..11126;N # Lo 36 CHAKMA LETTER AA..CHAKMA LETTER HAA
+11127..1112B;N # Mn 5 CHAKMA VOWEL SIGN A..CHAKMA VOWEL SIGN UU
+1112C;N # Mc CHAKMA VOWEL SIGN E
+1112D..11134;N # Mn 8 CHAKMA VOWEL SIGN AI..CHAKMA MAAYYAA
+11136..1113F;N # Nd 10 CHAKMA DIGIT ZERO..CHAKMA DIGIT NINE
+11140..11143;N # Po 4 CHAKMA SECTION MARK..CHAKMA QUESTION MARK
+11150..11172;N # Lo 35 MAHAJANI LETTER A..MAHAJANI LETTER RRA
+11173;N # Mn MAHAJANI SIGN NUKTA
+11174..11175;N # Po 2 MAHAJANI ABBREVIATION SIGN..MAHAJANI SECTION MARK
+11176;N # Lo MAHAJANI LIGATURE SHRI
+11180..11181;N # Mn 2 SHARADA SIGN CANDRABINDU..SHARADA SIGN ANUSVARA
+11182;N # Mc SHARADA SIGN VISARGA
+11183..111B2;N # Lo 48 SHARADA LETTER A..SHARADA LETTER HA
+111B3..111B5;N # Mc 3 SHARADA VOWEL SIGN AA..SHARADA VOWEL SIGN II
+111B6..111BE;N # Mn 9 SHARADA VOWEL SIGN U..SHARADA VOWEL SIGN O
+111BF..111C0;N # Mc 2 SHARADA VOWEL SIGN AU..SHARADA SIGN VIRAMA
+111C1..111C4;N # Lo 4 SHARADA SIGN AVAGRAHA..SHARADA OM
+111C5..111C9;N # Po 5 SHARADA DANDA..SHARADA SANDHI MARK
+111CA..111CC;N # Mn 3 SHARADA SIGN NUKTA..SHARADA EXTRA SHORT VOWEL MARK
+111CD;N # Po SHARADA SUTRA MARK
+111D0..111D9;N # Nd 10 SHARADA DIGIT ZERO..SHARADA DIGIT NINE
+111DA;N # Lo SHARADA EKAM
+111DB;N # Po SHARADA SIGN SIDDHAM
+111DC;N # Lo SHARADA HEADSTROKE
+111DD..111DF;N # Po 3 SHARADA CONTINUATION SIGN..SHARADA SECTION MARK-2
+111E1..111F4;N # No 20 SINHALA ARCHAIC DIGIT ONE..SINHALA ARCHAIC NUMBER ONE THOUSAND
+11200..11211;N # Lo 18 KHOJKI LETTER A..KHOJKI LETTER JJA
+11213..1122B;N # Lo 25 KHOJKI LETTER NYA..KHOJKI LETTER LLA
+1122C..1122E;N # Mc 3 KHOJKI VOWEL SIGN AA..KHOJKI VOWEL SIGN II
+1122F..11231;N # Mn 3 KHOJKI VOWEL SIGN U..KHOJKI VOWEL SIGN AI
+11232..11233;N # Mc 2 KHOJKI VOWEL SIGN O..KHOJKI VOWEL SIGN AU
+11234;N # Mn KHOJKI SIGN ANUSVARA
+11235;N # Mc KHOJKI SIGN VIRAMA
+11236..11237;N # Mn 2 KHOJKI SIGN NUKTA..KHOJKI SIGN SHADDA
+11238..1123D;N # Po 6 KHOJKI DANDA..KHOJKI ABBREVIATION SIGN
+1123E;N # Mn KHOJKI SIGN SUKUN
+11280..11286;N # Lo 7 MULTANI LETTER A..MULTANI LETTER GA
+11288;N # Lo MULTANI LETTER GHA
+1128A..1128D;N # Lo 4 MULTANI LETTER CA..MULTANI LETTER JJA
+1128F..1129D;N # Lo 15 MULTANI LETTER NYA..MULTANI LETTER BA
+1129F..112A8;N # Lo 10 MULTANI LETTER BHA..MULTANI LETTER RHA
+112A9;N # Po MULTANI SECTION MARK
+112B0..112DE;N # Lo 47 KHUDAWADI LETTER A..KHUDAWADI LETTER HA
+112DF;N # Mn KHUDAWADI SIGN ANUSVARA
+112E0..112E2;N # Mc 3 KHUDAWADI VOWEL SIGN AA..KHUDAWADI VOWEL SIGN II
+112E3..112EA;N # Mn 8 KHUDAWADI VOWEL SIGN U..KHUDAWADI SIGN VIRAMA
+112F0..112F9;N # Nd 10 KHUDAWADI DIGIT ZERO..KHUDAWADI DIGIT NINE
+11300..11301;N # Mn 2 GRANTHA SIGN COMBINING ANUSVARA ABOVE..GRANTHA SIGN CANDRABINDU
+11302..11303;N # Mc 2 GRANTHA SIGN ANUSVARA..GRANTHA SIGN VISARGA
+11305..1130C;N # Lo 8 GRANTHA LETTER A..GRANTHA LETTER VOCALIC L
+1130F..11310;N # Lo 2 GRANTHA LETTER EE..GRANTHA LETTER AI
+11313..11328;N # Lo 22 GRANTHA LETTER OO..GRANTHA LETTER NA
+1132A..11330;N # Lo 7 GRANTHA LETTER PA..GRANTHA LETTER RA
+11332..11333;N # Lo 2 GRANTHA LETTER LA..GRANTHA LETTER LLA
+11335..11339;N # Lo 5 GRANTHA LETTER VA..GRANTHA LETTER HA
+1133C;N # Mn GRANTHA SIGN NUKTA
+1133D;N # Lo GRANTHA SIGN AVAGRAHA
+1133E..1133F;N # Mc 2 GRANTHA VOWEL SIGN AA..GRANTHA VOWEL SIGN I
+11340;N # Mn GRANTHA VOWEL SIGN II
+11341..11344;N # Mc 4 GRANTHA VOWEL SIGN U..GRANTHA VOWEL SIGN VOCALIC RR
+11347..11348;N # Mc 2 GRANTHA VOWEL SIGN EE..GRANTHA VOWEL SIGN AI
+1134B..1134D;N # Mc 3 GRANTHA VOWEL SIGN OO..GRANTHA SIGN VIRAMA
+11350;N # Lo GRANTHA OM
+11357;N # Mc GRANTHA AU LENGTH MARK
+1135D..11361;N # Lo 5 GRANTHA SIGN PLUTA..GRANTHA LETTER VOCALIC LL
+11362..11363;N # Mc 2 GRANTHA VOWEL SIGN VOCALIC L..GRANTHA VOWEL SIGN VOCALIC LL
+11366..1136C;N # Mn 7 COMBINING GRANTHA DIGIT ZERO..COMBINING GRANTHA DIGIT SIX
+11370..11374;N # Mn 5 COMBINING GRANTHA LETTER A..COMBINING GRANTHA LETTER PA
+11400..11434;N # Lo 53 NEWA LETTER A..NEWA LETTER HA
+11435..11437;N # Mc 3 NEWA VOWEL SIGN AA..NEWA VOWEL SIGN II
+11438..1143F;N # Mn 8 NEWA VOWEL SIGN U..NEWA VOWEL SIGN AI
+11440..11441;N # Mc 2 NEWA VOWEL SIGN O..NEWA VOWEL SIGN AU
+11442..11444;N # Mn 3 NEWA SIGN VIRAMA..NEWA SIGN ANUSVARA
+11445;N # Mc NEWA SIGN VISARGA
+11446;N # Mn NEWA SIGN NUKTA
+11447..1144A;N # Lo 4 NEWA SIGN AVAGRAHA..NEWA SIDDHI
+1144B..1144F;N # Po 5 NEWA DANDA..NEWA ABBREVIATION SIGN
+11450..11459;N # Nd 10 NEWA DIGIT ZERO..NEWA DIGIT NINE
+1145B;N # Po NEWA PLACEHOLDER MARK
+1145D;N # Po NEWA INSERTION SIGN
+11480..114AF;N # Lo 48 TIRHUTA ANJI..TIRHUTA LETTER HA
+114B0..114B2;N # Mc 3 TIRHUTA VOWEL SIGN AA..TIRHUTA VOWEL SIGN II
+114B3..114B8;N # Mn 6 TIRHUTA VOWEL SIGN U..TIRHUTA VOWEL SIGN VOCALIC LL
+114B9;N # Mc TIRHUTA VOWEL SIGN E
+114BA;N # Mn TIRHUTA VOWEL SIGN SHORT E
+114BB..114BE;N # Mc 4 TIRHUTA VOWEL SIGN AI..TIRHUTA VOWEL SIGN AU
+114BF..114C0;N # Mn 2 TIRHUTA SIGN CANDRABINDU..TIRHUTA SIGN ANUSVARA
+114C1;N # Mc TIRHUTA SIGN VISARGA
+114C2..114C3;N # Mn 2 TIRHUTA SIGN VIRAMA..TIRHUTA SIGN NUKTA
+114C4..114C5;N # Lo 2 TIRHUTA SIGN AVAGRAHA..TIRHUTA GVANG
+114C6;N # Po TIRHUTA ABBREVIATION SIGN
+114C7;N # Lo TIRHUTA OM
+114D0..114D9;N # Nd 10 TIRHUTA DIGIT ZERO..TIRHUTA DIGIT NINE
+11580..115AE;N # Lo 47 SIDDHAM LETTER A..SIDDHAM LETTER HA
+115AF..115B1;N # Mc 3 SIDDHAM VOWEL SIGN AA..SIDDHAM VOWEL SIGN II
+115B2..115B5;N # Mn 4 SIDDHAM VOWEL SIGN U..SIDDHAM VOWEL SIGN VOCALIC RR
+115B8..115BB;N # Mc 4 SIDDHAM VOWEL SIGN E..SIDDHAM VOWEL SIGN AU
+115BC..115BD;N # Mn 2 SIDDHAM SIGN CANDRABINDU..SIDDHAM SIGN ANUSVARA
+115BE;N # Mc SIDDHAM SIGN VISARGA
+115BF..115C0;N # Mn 2 SIDDHAM SIGN VIRAMA..SIDDHAM SIGN NUKTA
+115C1..115D7;N # Po 23 SIDDHAM SIGN SIDDHAM..SIDDHAM SECTION MARK WITH CIRCLES AND FOUR ENCLOSURES
+115D8..115DB;N # Lo 4 SIDDHAM LETTER THREE-CIRCLE ALTERNATE I..SIDDHAM LETTER ALTERNATE U
+115DC..115DD;N # Mn 2 SIDDHAM VOWEL SIGN ALTERNATE U..SIDDHAM VOWEL SIGN ALTERNATE UU
+11600..1162F;N # Lo 48 MODI LETTER A..MODI LETTER LLA
+11630..11632;N # Mc 3 MODI VOWEL SIGN AA..MODI VOWEL SIGN II
+11633..1163A;N # Mn 8 MODI VOWEL SIGN U..MODI VOWEL SIGN AI
+1163B..1163C;N # Mc 2 MODI VOWEL SIGN O..MODI VOWEL SIGN AU
+1163D;N # Mn MODI SIGN ANUSVARA
+1163E;N # Mc MODI SIGN VISARGA
+1163F..11640;N # Mn 2 MODI SIGN VIRAMA..MODI SIGN ARDHACANDRA
+11641..11643;N # Po 3 MODI DANDA..MODI ABBREVIATION SIGN
+11644;N # Lo MODI SIGN HUVA
+11650..11659;N # Nd 10 MODI DIGIT ZERO..MODI DIGIT NINE
+11660..1166C;N # Po 13 MONGOLIAN BIRGA WITH ORNAMENT..MONGOLIAN TURNED SWIRL BIRGA WITH DOUBLE ORNAMENT
+11680..116AA;N # Lo 43 TAKRI LETTER A..TAKRI LETTER RRA
+116AB;N # Mn TAKRI SIGN ANUSVARA
+116AC;N # Mc TAKRI SIGN VISARGA
+116AD;N # Mn TAKRI VOWEL SIGN AA
+116AE..116AF;N # Mc 2 TAKRI VOWEL SIGN I..TAKRI VOWEL SIGN II
+116B0..116B5;N # Mn 6 TAKRI VOWEL SIGN U..TAKRI VOWEL SIGN AU
+116B6;N # Mc TAKRI SIGN VIRAMA
+116B7;N # Mn TAKRI SIGN NUKTA
+116C0..116C9;N # Nd 10 TAKRI DIGIT ZERO..TAKRI DIGIT NINE
+11700..11719;N # Lo 26 AHOM LETTER KA..AHOM LETTER JHA
+1171D..1171F;N # Mn 3 AHOM CONSONANT SIGN MEDIAL LA..AHOM CONSONANT SIGN MEDIAL LIGATING RA
+11720..11721;N # Mc 2 AHOM VOWEL SIGN A..AHOM VOWEL SIGN AA
+11722..11725;N # Mn 4 AHOM VOWEL SIGN I..AHOM VOWEL SIGN UU
+11726;N # Mc AHOM VOWEL SIGN E
+11727..1172B;N # Mn 5 AHOM VOWEL SIGN AW..AHOM SIGN KILLER
+11730..11739;N # Nd 10 AHOM DIGIT ZERO..AHOM DIGIT NINE
+1173A..1173B;N # No 2 AHOM NUMBER TEN..AHOM NUMBER TWENTY
+1173C..1173E;N # Po 3 AHOM SIGN SMALL SECTION..AHOM SIGN RULAI
+1173F;N # So AHOM SYMBOL VI
+118A0..118DF;N # L& 64 WARANG CITI CAPITAL LETTER NGAA..WARANG CITI SMALL LETTER VIYO
+118E0..118E9;N # Nd 10 WARANG CITI DIGIT ZERO..WARANG CITI DIGIT NINE
+118EA..118F2;N # No 9 WARANG CITI NUMBER TEN..WARANG CITI NUMBER NINETY
+118FF;N # Lo WARANG CITI OM
+11A00;N # Lo ZANABAZAR SQUARE LETTER A
+11A01..11A06;N # Mn 6 ZANABAZAR SQUARE VOWEL SIGN I..ZANABAZAR SQUARE VOWEL SIGN O
+11A07..11A08;N # Mc 2 ZANABAZAR SQUARE VOWEL SIGN AI..ZANABAZAR SQUARE VOWEL SIGN AU
+11A09..11A0A;N # Mn 2 ZANABAZAR SQUARE VOWEL SIGN REVERSED I..ZANABAZAR SQUARE VOWEL LENGTH MARK
+11A0B..11A32;N # Lo 40 ZANABAZAR SQUARE LETTER KA..ZANABAZAR SQUARE LETTER KSSA
+11A33..11A38;N # Mn 6 ZANABAZAR SQUARE FINAL CONSONANT MARK..ZANABAZAR SQUARE SIGN ANUSVARA
+11A39;N # Mc ZANABAZAR SQUARE SIGN VISARGA
+11A3A;N # Lo ZANABAZAR SQUARE CLUSTER-INITIAL LETTER RA
+11A3B..11A3E;N # Mn 4 ZANABAZAR SQUARE CLUSTER-FINAL LETTER YA..ZANABAZAR SQUARE CLUSTER-FINAL LETTER VA
+11A3F..11A46;N # Po 8 ZANABAZAR SQUARE INITIAL HEAD MARK..ZANABAZAR SQUARE CLOSING DOUBLE-LINED HEAD MARK
+11A47;N # Mn ZANABAZAR SQUARE SUBJOINER
+11A50;N # Lo SOYOMBO LETTER A
+11A51..11A56;N # Mn 6 SOYOMBO VOWEL SIGN I..SOYOMBO VOWEL SIGN OE
+11A57..11A58;N # Mc 2 SOYOMBO VOWEL SIGN AI..SOYOMBO VOWEL SIGN AU
+11A59..11A5B;N # Mn 3 SOYOMBO VOWEL SIGN VOCALIC R..SOYOMBO VOWEL LENGTH MARK
+11A5C..11A83;N # Lo 40 SOYOMBO LETTER KA..SOYOMBO LETTER KSSA
+11A86..11A89;N # Lo 4 SOYOMBO CLUSTER-INITIAL LETTER RA..SOYOMBO CLUSTER-INITIAL LETTER SA
+11A8A..11A96;N # Mn 13 SOYOMBO FINAL CONSONANT SIGN G..SOYOMBO SIGN ANUSVARA
+11A97;N # Mc SOYOMBO SIGN VISARGA
+11A98..11A99;N # Mn 2 SOYOMBO GEMINATION MARK..SOYOMBO SUBJOINER
+11A9A..11A9C;N # Po 3 SOYOMBO MARK TSHEG..SOYOMBO MARK DOUBLE SHAD
+11A9E..11AA2;N # Po 5 SOYOMBO HEAD MARK WITH MOON AND SUN AND TRIPLE FLAME..SOYOMBO TERMINAL MARK-2
+11AC0..11AF8;N # Lo 57 PAU CIN HAU LETTER PA..PAU CIN HAU GLOTTAL STOP FINAL
+11C00..11C08;N # Lo 9 BHAIKSUKI LETTER A..BHAIKSUKI LETTER VOCALIC L
+11C0A..11C2E;N # Lo 37 BHAIKSUKI LETTER E..BHAIKSUKI LETTER HA
+11C2F;N # Mc BHAIKSUKI VOWEL SIGN AA
+11C30..11C36;N # Mn 7 BHAIKSUKI VOWEL SIGN I..BHAIKSUKI VOWEL SIGN VOCALIC L
+11C38..11C3D;N # Mn 6 BHAIKSUKI VOWEL SIGN E..BHAIKSUKI SIGN ANUSVARA
+11C3E;N # Mc BHAIKSUKI SIGN VISARGA
+11C3F;N # Mn BHAIKSUKI SIGN VIRAMA
+11C40;N # Lo BHAIKSUKI SIGN AVAGRAHA
+11C41..11C45;N # Po 5 BHAIKSUKI DANDA..BHAIKSUKI GAP FILLER-2
+11C50..11C59;N # Nd 10 BHAIKSUKI DIGIT ZERO..BHAIKSUKI DIGIT NINE
+11C5A..11C6C;N # No 19 BHAIKSUKI NUMBER ONE..BHAIKSUKI HUNDREDS UNIT MARK
+11C70..11C71;N # Po 2 MARCHEN HEAD MARK..MARCHEN MARK SHAD
+11C72..11C8F;N # Lo 30 MARCHEN LETTER KA..MARCHEN LETTER A
+11C92..11CA7;N # Mn 22 MARCHEN SUBJOINED LETTER KA..MARCHEN SUBJOINED LETTER ZA
+11CA9;N # Mc MARCHEN SUBJOINED LETTER YA
+11CAA..11CB0;N # Mn 7 MARCHEN SUBJOINED LETTER RA..MARCHEN VOWEL SIGN AA
+11CB1;N # Mc MARCHEN VOWEL SIGN I
+11CB2..11CB3;N # Mn 2 MARCHEN VOWEL SIGN U..MARCHEN VOWEL SIGN E
+11CB4;N # Mc MARCHEN VOWEL SIGN O
+11CB5..11CB6;N # Mn 2 MARCHEN SIGN ANUSVARA..MARCHEN SIGN CANDRABINDU
+11D00..11D06;N # Lo 7 MASARAM GONDI LETTER A..MASARAM GONDI LETTER E
+11D08..11D09;N # Lo 2 MASARAM GONDI LETTER AI..MASARAM GONDI LETTER O
+11D0B..11D30;N # Lo 38 MASARAM GONDI LETTER AU..MASARAM GONDI LETTER TRA
+11D31..11D36;N # Mn 6 MASARAM GONDI VOWEL SIGN AA..MASARAM GONDI VOWEL SIGN VOCALIC R
+11D3A;N # Mn MASARAM GONDI VOWEL SIGN E
+11D3C..11D3D;N # Mn 2 MASARAM GONDI VOWEL SIGN AI..MASARAM GONDI VOWEL SIGN O
+11D3F..11D45;N # Mn 7 MASARAM GONDI VOWEL SIGN AU..MASARAM GONDI VIRAMA
+11D46;N # Lo MASARAM GONDI REPHA
+11D47;N # Mn MASARAM GONDI RA-KARA
+11D50..11D59;N # Nd 10 MASARAM GONDI DIGIT ZERO..MASARAM GONDI DIGIT NINE
+12000..12399;N # Lo 922 CUNEIFORM SIGN A..CUNEIFORM SIGN U U
+12400..1246E;N # Nl 111 CUNEIFORM NUMERIC SIGN TWO ASH..CUNEIFORM NUMERIC SIGN NINE U VARIANT FORM
+12470..12474;N # Po 5 CUNEIFORM PUNCTUATION SIGN OLD ASSYRIAN WORD DIVIDER..CUNEIFORM PUNCTUATION SIGN DIAGONAL QUADCOLON
+12480..12543;N # Lo 196 CUNEIFORM SIGN AB TIMES NUN TENU..CUNEIFORM SIGN ZU5 TIMES THREE DISH TENU
+13000..1342E;N # Lo 1071 EGYPTIAN HIEROGLYPH A001..EGYPTIAN HIEROGLYPH AA032
+14400..14646;N # Lo 583 ANATOLIAN HIEROGLYPH A001..ANATOLIAN HIEROGLYPH A530
+16800..16A38;N # Lo 569 BAMUM LETTER PHASE-A NGKUE MFON..BAMUM LETTER PHASE-F VUEQ
+16A40..16A5E;N # Lo 31 MRO LETTER TA..MRO LETTER TEK
+16A60..16A69;N # Nd 10 MRO DIGIT ZERO..MRO DIGIT NINE
+16A6E..16A6F;N # Po 2 MRO DANDA..MRO DOUBLE DANDA
+16AD0..16AED;N # Lo 30 BASSA VAH LETTER ENNI..BASSA VAH LETTER I
+16AF0..16AF4;N # Mn 5 BASSA VAH COMBINING HIGH TONE..BASSA VAH COMBINING HIGH-LOW TONE
+16AF5;N # Po BASSA VAH FULL STOP
+16B00..16B2F;N # Lo 48 PAHAWH HMONG VOWEL KEEB..PAHAWH HMONG CONSONANT CAU
+16B30..16B36;N # Mn 7 PAHAWH HMONG MARK CIM TUB..PAHAWH HMONG MARK CIM TAUM
+16B37..16B3B;N # Po 5 PAHAWH HMONG SIGN VOS THOM..PAHAWH HMONG SIGN VOS FEEM
+16B3C..16B3F;N # So 4 PAHAWH HMONG SIGN XYEEM NTXIV..PAHAWH HMONG SIGN XYEEM FAIB
+16B40..16B43;N # Lm 4 PAHAWH HMONG SIGN VOS SEEV..PAHAWH HMONG SIGN IB YAM
+16B44;N # Po PAHAWH HMONG SIGN XAUS
+16B45;N # So PAHAWH HMONG SIGN CIM TSOV ROG
+16B50..16B59;N # Nd 10 PAHAWH HMONG DIGIT ZERO..PAHAWH HMONG DIGIT NINE
+16B5B..16B61;N # No 7 PAHAWH HMONG NUMBER TENS..PAHAWH HMONG NUMBER TRILLIONS
+16B63..16B77;N # Lo 21 PAHAWH HMONG SIGN VOS LUB..PAHAWH HMONG SIGN CIM NRES TOS
+16B7D..16B8F;N # Lo 19 PAHAWH HMONG CLAN SIGN TSHEEJ..PAHAWH HMONG CLAN SIGN VWJ
+16F00..16F44;N # Lo 69 MIAO LETTER PA..MIAO LETTER HHA
+16F50;N # Lo MIAO LETTER NASALIZATION
+16F51..16F7E;N # Mc 46 MIAO SIGN ASPIRATION..MIAO VOWEL SIGN NG
+16F8F..16F92;N # Mn 4 MIAO TONE RIGHT..MIAO TONE BELOW
+16F93..16F9F;N # Lm 13 MIAO LETTER TONE-2..MIAO LETTER REFORMED TONE-8
+16FE0..16FE1;W # Lm 2 TANGUT ITERATION MARK..NUSHU ITERATION MARK
+17000..187EC;W # Lo 6125 TANGUT IDEOGRAPH-17000..TANGUT IDEOGRAPH-187EC
+18800..18AF2;W # Lo 755 TANGUT COMPONENT-001..TANGUT COMPONENT-755
+1B000..1B0FF;W # Lo 256 KATAKANA LETTER ARCHAIC E..HENTAIGANA LETTER RE-2
+1B100..1B11E;W # Lo 31 HENTAIGANA LETTER RE-3..HENTAIGANA LETTER N-MU-MO-2
+1B170..1B2FB;W # Lo 396 NUSHU CHARACTER-1B170..NUSHU CHARACTER-1B2FB
+1BC00..1BC6A;N # Lo 107 DUPLOYAN LETTER H..DUPLOYAN LETTER VOCALIC M
+1BC70..1BC7C;N # Lo 13 DUPLOYAN AFFIX LEFT HORIZONTAL SECANT..DUPLOYAN AFFIX ATTACHED TANGENT HOOK
+1BC80..1BC88;N # Lo 9 DUPLOYAN AFFIX HIGH ACUTE..DUPLOYAN AFFIX HIGH VERTICAL
+1BC90..1BC99;N # Lo 10 DUPLOYAN AFFIX LOW ACUTE..DUPLOYAN AFFIX LOW ARROW
+1BC9C;N # So DUPLOYAN SIGN O WITH CROSS
+1BC9D..1BC9E;N # Mn 2 DUPLOYAN THICK LETTER SELECTOR..DUPLOYAN DOUBLE MARK
+1BC9F;N # Po DUPLOYAN PUNCTUATION CHINOOK FULL STOP
+1BCA0..1BCA3;N # Cf 4 SHORTHAND FORMAT LETTER OVERLAP..SHORTHAND FORMAT UP STEP
+1D000..1D0F5;N # So 246 BYZANTINE MUSICAL SYMBOL PSILI..BYZANTINE MUSICAL SYMBOL GORGON NEO KATO
+1D100..1D126;N # So 39 MUSICAL SYMBOL SINGLE BARLINE..MUSICAL SYMBOL DRUM CLEF-2
+1D129..1D164;N # So 60 MUSICAL SYMBOL MULTIPLE MEASURE REST..MUSICAL SYMBOL ONE HUNDRED TWENTY-EIGHTH NOTE
+1D165..1D166;N # Mc 2 MUSICAL SYMBOL COMBINING STEM..MUSICAL SYMBOL COMBINING SPRECHGESANG STEM
+1D167..1D169;N # Mn 3 MUSICAL SYMBOL COMBINING TREMOLO-1..MUSICAL SYMBOL COMBINING TREMOLO-3
+1D16A..1D16C;N # So 3 MUSICAL SYMBOL FINGERED TREMOLO-1..MUSICAL SYMBOL FINGERED TREMOLO-3
+1D16D..1D172;N # Mc 6 MUSICAL SYMBOL COMBINING AUGMENTATION DOT..MUSICAL SYMBOL COMBINING FLAG-5
+1D173..1D17A;N # Cf 8 MUSICAL SYMBOL BEGIN BEAM..MUSICAL SYMBOL END PHRASE
+1D17B..1D182;N # Mn 8 MUSICAL SYMBOL COMBINING ACCENT..MUSICAL SYMBOL COMBINING LOURE
+1D183..1D184;N # So 2 MUSICAL SYMBOL ARPEGGIATO UP..MUSICAL SYMBOL ARPEGGIATO DOWN
+1D185..1D18B;N # Mn 7 MUSICAL SYMBOL COMBINING DOIT..MUSICAL SYMBOL COMBINING TRIPLE TONGUE
+1D18C..1D1A9;N # So 30 MUSICAL SYMBOL RINFORZANDO..MUSICAL SYMBOL DEGREE SLASH
+1D1AA..1D1AD;N # Mn 4 MUSICAL SYMBOL COMBINING DOWN BOW..MUSICAL SYMBOL COMBINING SNAP PIZZICATO
+1D1AE..1D1E8;N # So 59 MUSICAL SYMBOL PEDAL MARK..MUSICAL SYMBOL KIEVAN FLAT SIGN
+1D200..1D241;N # So 66 GREEK VOCAL NOTATION SYMBOL-1..GREEK INSTRUMENTAL NOTATION SYMBOL-54
+1D242..1D244;N # Mn 3 COMBINING GREEK MUSICAL TRISEME..COMBINING GREEK MUSICAL PENTASEME
+1D245;N # So GREEK MUSICAL LEIMMA
+1D300..1D356;N # So 87 MONOGRAM FOR EARTH..TETRAGRAM FOR FOSTERING
+1D360..1D371;N # No 18 COUNTING ROD UNIT DIGIT ONE..COUNTING ROD TENS DIGIT NINE
+1D400..1D454;N # L& 85 MATHEMATICAL BOLD CAPITAL A..MATHEMATICAL ITALIC SMALL G
+1D456..1D49C;N # L& 71 MATHEMATICAL ITALIC SMALL I..MATHEMATICAL SCRIPT CAPITAL A
+1D49E..1D49F;N # Lu 2 MATHEMATICAL SCRIPT CAPITAL C..MATHEMATICAL SCRIPT CAPITAL D
+1D4A2;N # Lu MATHEMATICAL SCRIPT CAPITAL G
+1D4A5..1D4A6;N # Lu 2 MATHEMATICAL SCRIPT CAPITAL J..MATHEMATICAL SCRIPT CAPITAL K
+1D4A9..1D4AC;N # Lu 4 MATHEMATICAL SCRIPT CAPITAL N..MATHEMATICAL SCRIPT CAPITAL Q
+1D4AE..1D4B9;N # L& 12 MATHEMATICAL SCRIPT CAPITAL S..MATHEMATICAL SCRIPT SMALL D
+1D4BB;N # Ll MATHEMATICAL SCRIPT SMALL F
+1D4BD..1D4C3;N # Ll 7 MATHEMATICAL SCRIPT SMALL H..MATHEMATICAL SCRIPT SMALL N
+1D4C5..1D505;N # L& 65 MATHEMATICAL SCRIPT SMALL P..MATHEMATICAL FRAKTUR CAPITAL B
+1D507..1D50A;N # Lu 4 MATHEMATICAL FRAKTUR CAPITAL D..MATHEMATICAL FRAKTUR CAPITAL G
+1D50D..1D514;N # Lu 8 MATHEMATICAL FRAKTUR CAPITAL J..MATHEMATICAL FRAKTUR CAPITAL Q
+1D516..1D51C;N # Lu 7 MATHEMATICAL FRAKTUR CAPITAL S..MATHEMATICAL FRAKTUR CAPITAL Y
+1D51E..1D539;N # L& 28 MATHEMATICAL FRAKTUR SMALL A..MATHEMATICAL DOUBLE-STRUCK CAPITAL B
+1D53B..1D53E;N # Lu 4 MATHEMATICAL DOUBLE-STRUCK CAPITAL D..MATHEMATICAL DOUBLE-STRUCK CAPITAL G
+1D540..1D544;N # Lu 5 MATHEMATICAL DOUBLE-STRUCK CAPITAL I..MATHEMATICAL DOUBLE-STRUCK CAPITAL M
+1D546;N # Lu MATHEMATICAL DOUBLE-STRUCK CAPITAL O
+1D54A..1D550;N # Lu 7 MATHEMATICAL DOUBLE-STRUCK CAPITAL S..MATHEMATICAL DOUBLE-STRUCK CAPITAL Y
+1D552..1D6A5;N # L& 340 MATHEMATICAL DOUBLE-STRUCK SMALL A..MATHEMATICAL ITALIC SMALL DOTLESS J
+1D6A8..1D6C0;N # Lu 25 MATHEMATICAL BOLD CAPITAL ALPHA..MATHEMATICAL BOLD CAPITAL OMEGA
+1D6C1;N # Sm MATHEMATICAL BOLD NABLA
+1D6C2..1D6DA;N # Ll 25 MATHEMATICAL BOLD SMALL ALPHA..MATHEMATICAL BOLD SMALL OMEGA
+1D6DB;N # Sm MATHEMATICAL BOLD PARTIAL DIFFERENTIAL
+1D6DC..1D6FA;N # L& 31 MATHEMATICAL BOLD EPSILON SYMBOL..MATHEMATICAL ITALIC CAPITAL OMEGA
+1D6FB;N # Sm MATHEMATICAL ITALIC NABLA
+1D6FC..1D714;N # Ll 25 MATHEMATICAL ITALIC SMALL ALPHA..MATHEMATICAL ITALIC SMALL OMEGA
+1D715;N # Sm MATHEMATICAL ITALIC PARTIAL DIFFERENTIAL
+1D716..1D734;N # L& 31 MATHEMATICAL ITALIC EPSILON SYMBOL..MATHEMATICAL BOLD ITALIC CAPITAL OMEGA
+1D735;N # Sm MATHEMATICAL BOLD ITALIC NABLA
+1D736..1D74E;N # Ll 25 MATHEMATICAL BOLD ITALIC SMALL ALPHA..MATHEMATICAL BOLD ITALIC SMALL OMEGA
+1D74F;N # Sm MATHEMATICAL BOLD ITALIC PARTIAL DIFFERENTIAL
+1D750..1D76E;N # L& 31 MATHEMATICAL BOLD ITALIC EPSILON SYMBOL..MATHEMATICAL SANS-SERIF BOLD CAPITAL OMEGA
+1D76F;N # Sm MATHEMATICAL SANS-SERIF BOLD NABLA
+1D770..1D788;N # Ll 25 MATHEMATICAL SANS-SERIF BOLD SMALL ALPHA..MATHEMATICAL SANS-SERIF BOLD SMALL OMEGA
+1D789;N # Sm MATHEMATICAL SANS-SERIF BOLD PARTIAL DIFFERENTIAL
+1D78A..1D7A8;N # L& 31 MATHEMATICAL SANS-SERIF BOLD EPSILON SYMBOL..MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL OMEGA
+1D7A9;N # Sm MATHEMATICAL SANS-SERIF BOLD ITALIC NABLA
+1D7AA..1D7C2;N # Ll 25 MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL ALPHA..MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL OMEGA
+1D7C3;N # Sm MATHEMATICAL SANS-SERIF BOLD ITALIC PARTIAL DIFFERENTIAL
+1D7C4..1D7CB;N # L& 8 MATHEMATICAL SANS-SERIF BOLD ITALIC EPSILON SYMBOL..MATHEMATICAL BOLD SMALL DIGAMMA
+1D7CE..1D7FF;N # Nd 50 MATHEMATICAL BOLD DIGIT ZERO..MATHEMATICAL MONOSPACE DIGIT NINE
+1D800..1D9FF;N # So 512 SIGNWRITING HAND-FIST INDEX..SIGNWRITING HEAD
+1DA00..1DA36;N # Mn 55 SIGNWRITING HEAD RIM..SIGNWRITING AIR SUCKING IN
+1DA37..1DA3A;N # So 4 SIGNWRITING AIR BLOW SMALL ROTATIONS..SIGNWRITING BREATH EXHALE
+1DA3B..1DA6C;N # Mn 50 SIGNWRITING MOUTH CLOSED NEUTRAL..SIGNWRITING EXCITEMENT
+1DA6D..1DA74;N # So 8 SIGNWRITING SHOULDER HIP SPINE..SIGNWRITING TORSO-FLOORPLANE TWISTING
+1DA75;N # Mn SIGNWRITING UPPER BODY TILTING FROM HIP JOINTS
+1DA76..1DA83;N # So 14 SIGNWRITING LIMB COMBINATION..SIGNWRITING LOCATION DEPTH
+1DA84;N # Mn SIGNWRITING LOCATION HEAD NECK
+1DA85..1DA86;N # So 2 SIGNWRITING LOCATION TORSO..SIGNWRITING LOCATION LIMBS DIGITS
+1DA87..1DA8B;N # Po 5 SIGNWRITING COMMA..SIGNWRITING PARENTHESIS
+1DA9B..1DA9F;N # Mn 5 SIGNWRITING FILL MODIFIER-2..SIGNWRITING FILL MODIFIER-6
+1DAA1..1DAAF;N # Mn 15 SIGNWRITING ROTATION MODIFIER-2..SIGNWRITING ROTATION MODIFIER-16
+1E000..1E006;N # Mn 7 COMBINING GLAGOLITIC LETTER AZU..COMBINING GLAGOLITIC LETTER ZHIVETE
+1E008..1E018;N # Mn 17 COMBINING GLAGOLITIC LETTER ZEMLJA..COMBINING GLAGOLITIC LETTER HERU
+1E01B..1E021;N # Mn 7 COMBINING GLAGOLITIC LETTER SHTA..COMBINING GLAGOLITIC LETTER YATI
+1E023..1E024;N # Mn 2 COMBINING GLAGOLITIC LETTER YU..COMBINING GLAGOLITIC LETTER SMALL YUS
+1E026..1E02A;N # Mn 5 COMBINING GLAGOLITIC LETTER YO..COMBINING GLAGOLITIC LETTER FITA
+1E800..1E8C4;N # Lo 197 MENDE KIKAKUI SYLLABLE M001 KI..MENDE KIKAKUI SYLLABLE M060 NYON
+1E8C7..1E8CF;N # No 9 MENDE KIKAKUI DIGIT ONE..MENDE KIKAKUI DIGIT NINE
+1E8D0..1E8D6;N # Mn 7 MENDE KIKAKUI COMBINING NUMBER TEENS..MENDE KIKAKUI COMBINING NUMBER MILLIONS
+1E900..1E943;N # L& 68 ADLAM CAPITAL LETTER ALIF..ADLAM SMALL LETTER SHA
+1E944..1E94A;N # Mn 7 ADLAM ALIF LENGTHENER..ADLAM NUKTA
+1E950..1E959;N # Nd 10 ADLAM DIGIT ZERO..ADLAM DIGIT NINE
+1E95E..1E95F;N # Po 2 ADLAM INITIAL EXCLAMATION MARK..ADLAM INITIAL QUESTION MARK
+1EE00..1EE03;N # Lo 4 ARABIC MATHEMATICAL ALEF..ARABIC MATHEMATICAL DAL
+1EE05..1EE1F;N # Lo 27 ARABIC MATHEMATICAL WAW..ARABIC MATHEMATICAL DOTLESS QAF
+1EE21..1EE22;N # Lo 2 ARABIC MATHEMATICAL INITIAL BEH..ARABIC MATHEMATICAL INITIAL JEEM
+1EE24;N # Lo ARABIC MATHEMATICAL INITIAL HEH
+1EE27;N # Lo ARABIC MATHEMATICAL INITIAL HAH
+1EE29..1EE32;N # Lo 10 ARABIC MATHEMATICAL INITIAL YEH..ARABIC MATHEMATICAL INITIAL QAF
+1EE34..1EE37;N # Lo 4 ARABIC MATHEMATICAL INITIAL SHEEN..ARABIC MATHEMATICAL INITIAL KHAH
+1EE39;N # Lo ARABIC MATHEMATICAL INITIAL DAD
+1EE3B;N # Lo ARABIC MATHEMATICAL INITIAL GHAIN
+1EE42;N # Lo ARABIC MATHEMATICAL TAILED JEEM
+1EE47;N # Lo ARABIC MATHEMATICAL TAILED HAH
+1EE49;N # Lo ARABIC MATHEMATICAL TAILED YEH
+1EE4B;N # Lo ARABIC MATHEMATICAL TAILED LAM
+1EE4D..1EE4F;N # Lo 3 ARABIC MATHEMATICAL TAILED NOON..ARABIC MATHEMATICAL TAILED AIN
+1EE51..1EE52;N # Lo 2 ARABIC MATHEMATICAL TAILED SAD..ARABIC MATHEMATICAL TAILED QAF
+1EE54;N # Lo ARABIC MATHEMATICAL TAILED SHEEN
+1EE57;N # Lo ARABIC MATHEMATICAL TAILED KHAH
+1EE59;N # Lo ARABIC MATHEMATICAL TAILED DAD
+1EE5B;N # Lo ARABIC MATHEMATICAL TAILED GHAIN
+1EE5D;N # Lo ARABIC MATHEMATICAL TAILED DOTLESS NOON
+1EE5F;N # Lo ARABIC MATHEMATICAL TAILED DOTLESS QAF
+1EE61..1EE62;N # Lo 2 ARABIC MATHEMATICAL STRETCHED BEH..ARABIC MATHEMATICAL STRETCHED JEEM
+1EE64;N # Lo ARABIC MATHEMATICAL STRETCHED HEH
+1EE67..1EE6A;N # Lo 4 ARABIC MATHEMATICAL STRETCHED HAH..ARABIC MATHEMATICAL STRETCHED KAF
+1EE6C..1EE72;N # Lo 7 ARABIC MATHEMATICAL STRETCHED MEEM..ARABIC MATHEMATICAL STRETCHED QAF
+1EE74..1EE77;N # Lo 4 ARABIC MATHEMATICAL STRETCHED SHEEN..ARABIC MATHEMATICAL STRETCHED KHAH
+1EE79..1EE7C;N # Lo 4 ARABIC MATHEMATICAL STRETCHED DAD..ARABIC MATHEMATICAL STRETCHED DOTLESS BEH
+1EE7E;N # Lo ARABIC MATHEMATICAL STRETCHED DOTLESS FEH
+1EE80..1EE89;N # Lo 10 ARABIC MATHEMATICAL LOOPED ALEF..ARABIC MATHEMATICAL LOOPED YEH
+1EE8B..1EE9B;N # Lo 17 ARABIC MATHEMATICAL LOOPED LAM..ARABIC MATHEMATICAL LOOPED GHAIN
+1EEA1..1EEA3;N # Lo 3 ARABIC MATHEMATICAL DOUBLE-STRUCK BEH..ARABIC MATHEMATICAL DOUBLE-STRUCK DAL
+1EEA5..1EEA9;N # Lo 5 ARABIC MATHEMATICAL DOUBLE-STRUCK WAW..ARABIC MATHEMATICAL DOUBLE-STRUCK YEH
+1EEAB..1EEBB;N # Lo 17 ARABIC MATHEMATICAL DOUBLE-STRUCK LAM..ARABIC MATHEMATICAL DOUBLE-STRUCK GHAIN
+1EEF0..1EEF1;N # Sm 2 ARABIC MATHEMATICAL OPERATOR MEEM WITH HAH WITH TATWEEL..ARABIC MATHEMATICAL OPERATOR HAH WITH DAL
+1F000..1F003;N # So 4 MAHJONG TILE EAST WIND..MAHJONG TILE NORTH WIND
+1F004;W # So MAHJONG TILE RED DRAGON
+1F005..1F02B;N # So 39 MAHJONG TILE GREEN DRAGON..MAHJONG TILE BACK
+1F030..1F093;N # So 100 DOMINO TILE HORIZONTAL BACK..DOMINO TILE VERTICAL-06-06
+1F0A0..1F0AE;N # So 15 PLAYING CARD BACK..PLAYING CARD KING OF SPADES
+1F0B1..1F0BF;N # So 15 PLAYING CARD ACE OF HEARTS..PLAYING CARD RED JOKER
+1F0C1..1F0CE;N # So 14 PLAYING CARD ACE OF DIAMONDS..PLAYING CARD KING OF DIAMONDS
+1F0CF;W # So PLAYING CARD BLACK JOKER
+1F0D1..1F0F5;N # So 37 PLAYING CARD ACE OF CLUBS..PLAYING CARD TRUMP-21
+1F100..1F10A;A # No 11 DIGIT ZERO FULL STOP..DIGIT NINE COMMA
+1F10B..1F10C;N # No 2 DINGBAT CIRCLED SANS-SERIF DIGIT ZERO..DINGBAT NEGATIVE CIRCLED SANS-SERIF DIGIT ZERO
+1F110..1F12D;A # So 30 PARENTHESIZED LATIN CAPITAL LETTER A..CIRCLED CD
+1F12E;N # So CIRCLED WZ
+1F130..1F169;A # So 58 SQUARED LATIN CAPITAL LETTER A..NEGATIVE CIRCLED LATIN CAPITAL LETTER Z
+1F16A..1F16B;N # So 2 RAISED MC SIGN..RAISED MD SIGN
+1F170..1F18D;A # So 30 NEGATIVE SQUARED LATIN CAPITAL LETTER A..NEGATIVE SQUARED SA
+1F18E;W # So NEGATIVE SQUARED AB
+1F18F..1F190;A # So 2 NEGATIVE SQUARED WC..SQUARE DJ
+1F191..1F19A;W # So 10 SQUARED CL..SQUARED VS
+1F19B..1F1AC;A # So 18 SQUARED THREE D..SQUARED VOD
+1F1E6..1F1FF;N # So 26 REGIONAL INDICATOR SYMBOL LETTER A..REGIONAL INDICATOR SYMBOL LETTER Z
+1F200..1F202;W # So 3 SQUARE HIRAGANA HOKA..SQUARED KATAKANA SA
+1F210..1F23B;W # So 44 SQUARED CJK UNIFIED IDEOGRAPH-624B..SQUARED CJK UNIFIED IDEOGRAPH-914D
+1F240..1F248;W # So 9 TORTOISE SHELL BRACKETED CJK UNIFIED IDEOGRAPH-672C..TORTOISE SHELL BRACKETED CJK UNIFIED IDEOGRAPH-6557
+1F250..1F251;W # So 2 CIRCLED IDEOGRAPH ADVANTAGE..CIRCLED IDEOGRAPH ACCEPT
+1F260..1F265;W # So 6 ROUNDED SYMBOL FOR FU..ROUNDED SYMBOL FOR CAI
+1F300..1F320;W # So 33 CYCLONE..SHOOTING STAR
+1F321..1F32C;N # So 12 THERMOMETER..WIND BLOWING FACE
+1F32D..1F335;W # So 9 HOT DOG..CACTUS
+1F336;N # So HOT PEPPER
+1F337..1F37C;W # So 70 TULIP..BABY BOTTLE
+1F37D;N # So FORK AND KNIFE WITH PLATE
+1F37E..1F393;W # So 22 BOTTLE WITH POPPING CORK..GRADUATION CAP
+1F394..1F39F;N # So 12 HEART WITH TIP ON THE LEFT..ADMISSION TICKETS
+1F3A0..1F3CA;W # So 43 CAROUSEL HORSE..SWIMMER
+1F3CB..1F3CE;N # So 4 WEIGHT LIFTER..RACING CAR
+1F3CF..1F3D3;W # So 5 CRICKET BAT AND BALL..TABLE TENNIS PADDLE AND BALL
+1F3D4..1F3DF;N # So 12 SNOW CAPPED MOUNTAIN..STADIUM
+1F3E0..1F3F0;W # So 17 HOUSE BUILDING..EUROPEAN CASTLE
+1F3F1..1F3F3;N # So 3 WHITE PENNANT..WAVING WHITE FLAG
+1F3F4;W # So WAVING BLACK FLAG
+1F3F5..1F3F7;N # So 3 ROSETTE..LABEL
+1F3F8..1F3FA;W # So 3 BADMINTON RACQUET AND SHUTTLECOCK..AMPHORA
+1F3FB..1F3FF;W # Sk 5 EMOJI MODIFIER FITZPATRICK TYPE-1-2..EMOJI MODIFIER FITZPATRICK TYPE-6
+1F400..1F43E;W # So 63 RAT..PAW PRINTS
+1F43F;N # So CHIPMUNK
+1F440;W # So EYES
+1F441;N # So EYE
+1F442..1F4FC;W # So 187 EAR..VIDEOCASSETTE
+1F4FD..1F4FE;N # So 2 FILM PROJECTOR..PORTABLE STEREO
+1F4FF..1F53D;W # So 63 PRAYER BEADS..DOWN-POINTING SMALL RED TRIANGLE
+1F53E..1F54A;N # So 13 LOWER RIGHT SHADOWED WHITE CIRCLE..DOVE OF PEACE
+1F54B..1F54E;W # So 4 KAABA..MENORAH WITH NINE BRANCHES
+1F54F;N # So BOWL OF HYGIEIA
+1F550..1F567;W # So 24 CLOCK FACE ONE OCLOCK..CLOCK FACE TWELVE-THIRTY
+1F568..1F579;N # So 18 RIGHT SPEAKER..JOYSTICK
+1F57A;W # So MAN DANCING
+1F57B..1F594;N # So 26 LEFT HAND TELEPHONE RECEIVER..REVERSED VICTORY HAND
+1F595..1F596;W # So 2 REVERSED HAND WITH MIDDLE FINGER EXTENDED..RAISED HAND WITH PART BETWEEN MIDDLE AND RING FINGERS
+1F597..1F5A3;N # So 13 WHITE DOWN POINTING LEFT HAND INDEX..BLACK DOWN POINTING BACKHAND INDEX
+1F5A4;W # So BLACK HEART
+1F5A5..1F5FA;N # So 86 DESKTOP COMPUTER..WORLD MAP
+1F5FB..1F5FF;W # So 5 MOUNT FUJI..MOYAI
+1F600..1F64F;W # So 80 GRINNING FACE..PERSON WITH FOLDED HANDS
+1F650..1F67F;N # So 48 NORTH WEST POINTING LEAF..REVERSE CHECKER BOARD
+1F680..1F6C5;W # So 70 ROCKET..LEFT LUGGAGE
+1F6C6..1F6CB;N # So 6 TRIANGLE WITH ROUNDED CORNERS..COUCH AND LAMP
+1F6CC;W # So SLEEPING ACCOMMODATION
+1F6CD..1F6CF;N # So 3 SHOPPING BAGS..BED
+1F6D0..1F6D2;W # So 3 PLACE OF WORSHIP..SHOPPING TROLLEY
+1F6D3..1F6D4;N # So 2 STUPA..PAGODA
+1F6E0..1F6EA;N # So 11 HAMMER AND WRENCH..NORTHEAST-POINTING AIRPLANE
+1F6EB..1F6EC;W # So 2 AIRPLANE DEPARTURE..AIRPLANE ARRIVING
+1F6F0..1F6F3;N # So 4 SATELLITE..PASSENGER SHIP
+1F6F4..1F6F8;W # So 5 SCOOTER..FLYING SAUCER
+1F700..1F773;N # So 116 ALCHEMICAL SYMBOL FOR QUINTESSENCE..ALCHEMICAL SYMBOL FOR HALF OUNCE
+1F780..1F7D4;N # So 85 BLACK LEFT-POINTING ISOSCELES RIGHT TRIANGLE..HEAVY TWELVE POINTED PINWHEEL STAR
+1F800..1F80B;N # So 12 LEFTWARDS ARROW WITH SMALL TRIANGLE ARROWHEAD..DOWNWARDS ARROW WITH LARGE TRIANGLE ARROWHEAD
+1F810..1F847;N # So 56 LEFTWARDS ARROW WITH SMALL EQUILATERAL ARROWHEAD..DOWNWARDS HEAVY ARROW
+1F850..1F859;N # So 10 LEFTWARDS SANS-SERIF ARROW..UP DOWN SANS-SERIF ARROW
+1F860..1F887;N # So 40 WIDE-HEADED LEFTWARDS LIGHT BARB ARROW..WIDE-HEADED SOUTH WEST VERY HEAVY BARB ARROW
+1F890..1F8AD;N # So 30 LEFTWARDS TRIANGLE ARROWHEAD..WHITE ARROW SHAFT WIDTH TWO THIRDS
+1F900..1F90B;N # So 12 CIRCLED CROSS FORMEE WITH FOUR DOTS..DOWNWARD FACING NOTCHED HOOK WITH DOT
+1F910..1F93E;W # So 47 ZIPPER-MOUTH FACE..HANDBALL
+1F940..1F94C;W # So 13 WILTED FLOWER..CURLING STONE
+1F950..1F96B;W # So 28 CROISSANT..CANNED FOOD
+1F980..1F997;W # So 24 CRAB..CRICKET
+1F9C0;W # So CHEESE WEDGE
+1F9D0..1F9E6;W # So 23 FACE WITH MONOCLE..SOCKS
+20000..2A6D6;W # Lo 42711 CJK UNIFIED IDEOGRAPH-20000..CJK UNIFIED IDEOGRAPH-2A6D6
+2A6D7..2A6FF;W # Cn 41 <reserved-2A6D7>..<reserved-2A6FF>
+2A700..2B734;W # Lo 4149 CJK UNIFIED IDEOGRAPH-2A700..CJK UNIFIED IDEOGRAPH-2B734
+2B735..2B73F;W # Cn 11 <reserved-2B735>..<reserved-2B73F>
+2B740..2B81D;W # Lo 222 CJK UNIFIED IDEOGRAPH-2B740..CJK UNIFIED IDEOGRAPH-2B81D
+2B81E..2B81F;W # Cn 2 <reserved-2B81E>..<reserved-2B81F>
+2B820..2CEA1;W # Lo 5762 CJK UNIFIED IDEOGRAPH-2B820..CJK UNIFIED IDEOGRAPH-2CEA1
+2CEA2..2CEAF;W # Cn 14 <reserved-2CEA2>..<reserved-2CEAF>
+2CEB0..2EBE0;W # Lo 7473 CJK UNIFIED IDEOGRAPH-2CEB0..CJK UNIFIED IDEOGRAPH-2EBE0
+2EBE1..2F7FF;W # Cn 3103 <reserved-2EBE1>..<reserved-2F7FF>
+2F800..2FA1D;W # Lo 542 CJK COMPATIBILITY IDEOGRAPH-2F800..CJK COMPATIBILITY IDEOGRAPH-2FA1D
+2FA1E..2FFFD;W # Cn 1504 <reserved-2FA1E>..<reserved-2FFFD>
+30000..3FFFD;W # Cn 65534 <reserved-30000>..<reserved-3FFFD>
+E0001;N # Cf LANGUAGE TAG
+E0020..E007F;N # Cf 96 TAG SPACE..CANCEL TAG
+E0100..E01EF;A # Mn 240 VARIATION SELECTOR-17..VARIATION SELECTOR-256
+F0000..FFFFD;A # Co 65534 <private-use-F0000>..<private-use-FFFFD>
+100000..10FFFD;A # Co 65534 <private-use-100000>..<private-use-10FFFD>
+
+# EOF

_service:tar_scm:slang-2.3.2.tar.bz2/utf8/tools/Makefile Added

_service:tar_scm:slang-2.3.2.tar.bz2/utf8/tools/README Added

_service:tar_scm:slang-2.3.2.tar.bz2/utf8/tools/UnicodeData.txt Added

@@ -0,0 +1,31618 @@
+0000;<control>;Cc;0;BN;;;;;N;NULL;;;;
+0001;<control>;Cc;0;BN;;;;;N;START OF HEADING;;;;
+0002;<control>;Cc;0;BN;;;;;N;START OF TEXT;;;;
+0003;<control>;Cc;0;BN;;;;;N;END OF TEXT;;;;
+0004;<control>;Cc;0;BN;;;;;N;END OF TRANSMISSION;;;;
+0005;<control>;Cc;0;BN;;;;;N;ENQUIRY;;;;
+0006;<control>;Cc;0;BN;;;;;N;ACKNOWLEDGE;;;;
+0007;<control>;Cc;0;BN;;;;;N;BELL;;;;
+0008;<control>;Cc;0;BN;;;;;N;BACKSPACE;;;;
+0009;<control>;Cc;0;S;;;;;N;CHARACTER TABULATION;;;;
+000A;<control>;Cc;0;B;;;;;N;LINE FEED (LF);;;;
+000B;<control>;Cc;0;S;;;;;N;LINE TABULATION;;;;
+000C;<control>;Cc;0;WS;;;;;N;FORM FEED (FF);;;;
+000D;<control>;Cc;0;B;;;;;N;CARRIAGE RETURN (CR);;;;
+000E;<control>;Cc;0;BN;;;;;N;SHIFT OUT;;;;
+000F;<control>;Cc;0;BN;;;;;N;SHIFT IN;;;;
+0010;<control>;Cc;0;BN;;;;;N;DATA LINK ESCAPE;;;;
+0011;<control>;Cc;0;BN;;;;;N;DEVICE CONTROL ONE;;;;
+0012;<control>;Cc;0;BN;;;;;N;DEVICE CONTROL TWO;;;;
+0013;<control>;Cc;0;BN;;;;;N;DEVICE CONTROL THREE;;;;
+0014;<control>;Cc;0;BN;;;;;N;DEVICE CONTROL FOUR;;;;
+0015;<control>;Cc;0;BN;;;;;N;NEGATIVE ACKNOWLEDGE;;;;
+0016;<control>;Cc;0;BN;;;;;N;SYNCHRONOUS IDLE;;;;
+0017;<control>;Cc;0;BN;;;;;N;END OF TRANSMISSION BLOCK;;;;
+0018;<control>;Cc;0;BN;;;;;N;CANCEL;;;;
+0019;<control>;Cc;0;BN;;;;;N;END OF MEDIUM;;;;
+001A;<control>;Cc;0;BN;;;;;N;SUBSTITUTE;;;;
+001B;<control>;Cc;0;BN;;;;;N;ESCAPE;;;;
+001C;<control>;Cc;0;B;;;;;N;INFORMATION SEPARATOR FOUR;;;;
+001D;<control>;Cc;0;B;;;;;N;INFORMATION SEPARATOR THREE;;;;
+001E;<control>;Cc;0;B;;;;;N;INFORMATION SEPARATOR TWO;;;;
+001F;<control>;Cc;0;S;;;;;N;INFORMATION SEPARATOR ONE;;;;
+0020;SPACE;Zs;0;WS;;;;;N;;;;;
+0021;EXCLAMATION MARK;Po;0;ON;;;;;N;;;;;
+0022;QUOTATION MARK;Po;0;ON;;;;;N;;;;;
+0023;NUMBER SIGN;Po;0;ET;;;;;N;;;;;
+0024;DOLLAR SIGN;Sc;0;ET;;;;;N;;;;;
+0025;PERCENT SIGN;Po;0;ET;;;;;N;;;;;
+0026;AMPERSAND;Po;0;ON;;;;;N;;;;;
+0027;APOSTROPHE;Po;0;ON;;;;;N;APOSTROPHE-QUOTE;;;;
+0028;LEFT PARENTHESIS;Ps;0;ON;;;;;Y;OPENING PARENTHESIS;;;;
+0029;RIGHT PARENTHESIS;Pe;0;ON;;;;;Y;CLOSING PARENTHESIS;;;;
+002A;ASTERISK;Po;0;ON;;;;;N;;;;;
+002B;PLUS SIGN;Sm;0;ES;;;;;N;;;;;
+002C;COMMA;Po;0;CS;;;;;N;;;;;
+002D;HYPHEN-MINUS;Pd;0;ES;;;;;N;;;;;
+002E;FULL STOP;Po;0;CS;;;;;N;PERIOD;;;;
+002F;SOLIDUS;Po;0;CS;;;;;N;SLASH;;;;
+0030;DIGIT ZERO;Nd;0;EN;;0;0;0;N;;;;;
+0031;DIGIT ONE;Nd;0;EN;;1;1;1;N;;;;;
+0032;DIGIT TWO;Nd;0;EN;;2;2;2;N;;;;;
+0033;DIGIT THREE;Nd;0;EN;;3;3;3;N;;;;;
+0034;DIGIT FOUR;Nd;0;EN;;4;4;4;N;;;;;
+0035;DIGIT FIVE;Nd;0;EN;;5;5;5;N;;;;;
+0036;DIGIT SIX;Nd;0;EN;;6;6;6;N;;;;;
+0037;DIGIT SEVEN;Nd;0;EN;;7;7;7;N;;;;;
+0038;DIGIT EIGHT;Nd;0;EN;;8;8;8;N;;;;;
+0039;DIGIT NINE;Nd;0;EN;;9;9;9;N;;;;;
+003A;COLON;Po;0;CS;;;;;N;;;;;
+003B;SEMICOLON;Po;0;ON;;;;;N;;;;;
+003C;LESS-THAN SIGN;Sm;0;ON;;;;;Y;;;;;
+003D;EQUALS SIGN;Sm;0;ON;;;;;N;;;;;
+003E;GREATER-THAN SIGN;Sm;0;ON;;;;;Y;;;;;
+003F;QUESTION MARK;Po;0;ON;;;;;N;;;;;
+0040;COMMERCIAL AT;Po;0;ON;;;;;N;;;;;
+0041;LATIN CAPITAL LETTER A;Lu;0;L;;;;;N;;;;0061;
+0042;LATIN CAPITAL LETTER B;Lu;0;L;;;;;N;;;;0062;
+0043;LATIN CAPITAL LETTER C;Lu;0;L;;;;;N;;;;0063;
+0044;LATIN CAPITAL LETTER D;Lu;0;L;;;;;N;;;;0064;
+0045;LATIN CAPITAL LETTER E;Lu;0;L;;;;;N;;;;0065;
+0046;LATIN CAPITAL LETTER F;Lu;0;L;;;;;N;;;;0066;
+0047;LATIN CAPITAL LETTER G;Lu;0;L;;;;;N;;;;0067;
+0048;LATIN CAPITAL LETTER H;Lu;0;L;;;;;N;;;;0068;
+0049;LATIN CAPITAL LETTER I;Lu;0;L;;;;;N;;;;0069;
+004A;LATIN CAPITAL LETTER J;Lu;0;L;;;;;N;;;;006A;
+004B;LATIN CAPITAL LETTER K;Lu;0;L;;;;;N;;;;006B;
+004C;LATIN CAPITAL LETTER L;Lu;0;L;;;;;N;;;;006C;
+004D;LATIN CAPITAL LETTER M;Lu;0;L;;;;;N;;;;006D;
+004E;LATIN CAPITAL LETTER N;Lu;0;L;;;;;N;;;;006E;
+004F;LATIN CAPITAL LETTER O;Lu;0;L;;;;;N;;;;006F;
+0050;LATIN CAPITAL LETTER P;Lu;0;L;;;;;N;;;;0070;
+0051;LATIN CAPITAL LETTER Q;Lu;0;L;;;;;N;;;;0071;
+0052;LATIN CAPITAL LETTER R;Lu;0;L;;;;;N;;;;0072;
+0053;LATIN CAPITAL LETTER S;Lu;0;L;;;;;N;;;;0073;
+0054;LATIN CAPITAL LETTER T;Lu;0;L;;;;;N;;;;0074;
+0055;LATIN CAPITAL LETTER U;Lu;0;L;;;;;N;;;;0075;
+0056;LATIN CAPITAL LETTER V;Lu;0;L;;;;;N;;;;0076;
+0057;LATIN CAPITAL LETTER W;Lu;0;L;;;;;N;;;;0077;
+0058;LATIN CAPITAL LETTER X;Lu;0;L;;;;;N;;;;0078;
+0059;LATIN CAPITAL LETTER Y;Lu;0;L;;;;;N;;;;0079;
+005A;LATIN CAPITAL LETTER Z;Lu;0;L;;;;;N;;;;007A;
+005B;LEFT SQUARE BRACKET;Ps;0;ON;;;;;Y;OPENING SQUARE BRACKET;;;;
+005C;REVERSE SOLIDUS;Po;0;ON;;;;;N;BACKSLASH;;;;
+005D;RIGHT SQUARE BRACKET;Pe;0;ON;;;;;Y;CLOSING SQUARE BRACKET;;;;
+005E;CIRCUMFLEX ACCENT;Sk;0;ON;;;;;N;SPACING CIRCUMFLEX;;;;
+005F;LOW LINE;Pc;0;ON;;;;;N;SPACING UNDERSCORE;;;;
+0060;GRAVE ACCENT;Sk;0;ON;;;;;N;SPACING GRAVE;;;;
+0061;LATIN SMALL LETTER A;Ll;0;L;;;;;N;;;0041;;0041
+0062;LATIN SMALL LETTER B;Ll;0;L;;;;;N;;;0042;;0042
+0063;LATIN SMALL LETTER C;Ll;0;L;;;;;N;;;0043;;0043
+0064;LATIN SMALL LETTER D;Ll;0;L;;;;;N;;;0044;;0044
+0065;LATIN SMALL LETTER E;Ll;0;L;;;;;N;;;0045;;0045
+0066;LATIN SMALL LETTER F;Ll;0;L;;;;;N;;;0046;;0046
+0067;LATIN SMALL LETTER G;Ll;0;L;;;;;N;;;0047;;0047
+0068;LATIN SMALL LETTER H;Ll;0;L;;;;;N;;;0048;;0048
+0069;LATIN SMALL LETTER I;Ll;0;L;;;;;N;;;0049;;0049
+006A;LATIN SMALL LETTER J;Ll;0;L;;;;;N;;;004A;;004A
+006B;LATIN SMALL LETTER K;Ll;0;L;;;;;N;;;004B;;004B
+006C;LATIN SMALL LETTER L;Ll;0;L;;;;;N;;;004C;;004C
+006D;LATIN SMALL LETTER M;Ll;0;L;;;;;N;;;004D;;004D
+006E;LATIN SMALL LETTER N;Ll;0;L;;;;;N;;;004E;;004E
+006F;LATIN SMALL LETTER O;Ll;0;L;;;;;N;;;004F;;004F
+0070;LATIN SMALL LETTER P;Ll;0;L;;;;;N;;;0050;;0050
+0071;LATIN SMALL LETTER Q;Ll;0;L;;;;;N;;;0051;;0051
+0072;LATIN SMALL LETTER R;Ll;0;L;;;;;N;;;0052;;0052
+0073;LATIN SMALL LETTER S;Ll;0;L;;;;;N;;;0053;;0053
+0074;LATIN SMALL LETTER T;Ll;0;L;;;;;N;;;0054;;0054
+0075;LATIN SMALL LETTER U;Ll;0;L;;;;;N;;;0055;;0055
+0076;LATIN SMALL LETTER V;Ll;0;L;;;;;N;;;0056;;0056
+0077;LATIN SMALL LETTER W;Ll;0;L;;;;;N;;;0057;;0057
+0078;LATIN SMALL LETTER X;Ll;0;L;;;;;N;;;0058;;0058
+0079;LATIN SMALL LETTER Y;Ll;0;L;;;;;N;;;0059;;0059
+007A;LATIN SMALL LETTER Z;Ll;0;L;;;;;N;;;005A;;005A
+007B;LEFT CURLY BRACKET;Ps;0;ON;;;;;Y;OPENING CURLY BRACKET;;;;
+007C;VERTICAL LINE;Sm;0;ON;;;;;N;VERTICAL BAR;;;;
+007D;RIGHT CURLY BRACKET;Pe;0;ON;;;;;Y;CLOSING CURLY BRACKET;;;;
+007E;TILDE;Sm;0;ON;;;;;N;;;;;
+007F;<control>;Cc;0;BN;;;;;N;DELETE;;;;
+0080;<control>;Cc;0;BN;;;;;N;;;;;
+0081;<control>;Cc;0;BN;;;;;N;;;;;
+0082;<control>;Cc;0;BN;;;;;N;BREAK PERMITTED HERE;;;;
+0083;<control>;Cc;0;BN;;;;;N;NO BREAK HERE;;;;
+0084;<control>;Cc;0;BN;;;;;N;;;;;
+0085;<control>;Cc;0;B;;;;;N;NEXT LINE (NEL);;;;
+0086;<control>;Cc;0;BN;;;;;N;START OF SELECTED AREA;;;;
+0087;<control>;Cc;0;BN;;;;;N;END OF SELECTED AREA;;;;
+0088;<control>;Cc;0;BN;;;;;N;CHARACTER TABULATION SET;;;;
+0089;<control>;Cc;0;BN;;;;;N;CHARACTER TABULATION WITH JUSTIFICATION;;;;
+008A;<control>;Cc;0;BN;;;;;N;LINE TABULATION SET;;;;
+008B;<control>;Cc;0;BN;;;;;N;PARTIAL LINE FORWARD;;;;
+008C;<control>;Cc;0;BN;;;;;N;PARTIAL LINE BACKWARD;;;;
+008D;<control>;Cc;0;BN;;;;;N;REVERSE LINE FEED;;;;
+008E;<control>;Cc;0;BN;;;;;N;SINGLE SHIFT TWO;;;;
+008F;<control>;Cc;0;BN;;;;;N;SINGLE SHIFT THREE;;;;
+0090;<control>;Cc;0;BN;;;;;N;DEVICE CONTROL STRING;;;;
+0091;<control>;Cc;0;BN;;;;;N;PRIVATE USE ONE;;;;
+0092;<control>;Cc;0;BN;;;;;N;PRIVATE USE TWO;;;;
+0093;<control>;Cc;0;BN;;;;;N;SET TRANSMIT STATE;;;;
+0094;<control>;Cc;0;BN;;;;;N;CANCEL CHARACTER;;;;
+0095;<control>;Cc;0;BN;;;;;N;MESSAGE WAITING;;;;
+0096;<control>;Cc;0;BN;;;;;N;START OF GUARDED AREA;;;;
+0097;<control>;Cc;0;BN;;;;;N;END OF GUARDED AREA;;;;
+0098;<control>;Cc;0;BN;;;;;N;START OF STRING;;;;
+0099;<control>;Cc;0;BN;;;;;N;;;;;
+009A;<control>;Cc;0;BN;;;;;N;SINGLE CHARACTER INTRODUCER;;;;
+009B;<control>;Cc;0;BN;;;;;N;CONTROL SEQUENCE INTRODUCER;;;;
+009C;<control>;Cc;0;BN;;;;;N;STRING TERMINATOR;;;;
+009D;<control>;Cc;0;BN;;;;;N;OPERATING SYSTEM COMMAND;;;;
+009E;<control>;Cc;0;BN;;;;;N;PRIVACY MESSAGE;;;;
+009F;<control>;Cc;0;BN;;;;;N;APPLICATION PROGRAM COMMAND;;;;
+00A0;NO-BREAK SPACE;Zs;0;CS;<noBreak> 0020;;;;N;NON-BREAKING SPACE;;;;
+00A1;INVERTED EXCLAMATION MARK;Po;0;ON;;;;;N;;;;;
+00A2;CENT SIGN;Sc;0;ET;;;;;N;;;;;
+00A3;POUND SIGN;Sc;0;ET;;;;;N;;;;;
+00A4;CURRENCY SIGN;Sc;0;ET;;;;;N;;;;;
+00A5;YEN SIGN;Sc;0;ET;;;;;N;;;;;
+00A6;BROKEN BAR;So;0;ON;;;;;N;BROKEN VERTICAL BAR;;;;
+00A7;SECTION SIGN;Po;0;ON;;;;;N;;;;;
+00A8;DIAERESIS;Sk;0;ON;<compat> 0020 0308;;;;N;SPACING DIAERESIS;;;;
+00A9;COPYRIGHT SIGN;So;0;ON;;;;;N;;;;;
+00AA;FEMININE ORDINAL INDICATOR;Lo;0;L;<super> 0061;;;;N;;;;;
+00AB;LEFT-POINTING DOUBLE ANGLE QUOTATION MARK;Pi;0;ON;;;;;Y;LEFT POINTING GUILLEMET;;;;
+00AC;NOT SIGN;Sm;0;ON;;;;;N;;;;;
+00AD;SOFT HYPHEN;Cf;0;BN;;;;;N;;;;;
+00AE;REGISTERED SIGN;So;0;ON;;;;;N;REGISTERED TRADE MARK SIGN;;;;
+00AF;MACRON;Sk;0;ON;<compat> 0020 0304;;;;N;SPACING MACRON;;;;
+00B0;DEGREE SIGN;So;0;ET;;;;;N;;;;;
+00B1;PLUS-MINUS SIGN;Sm;0;ET;;;;;N;PLUS-OR-MINUS SIGN;;;;
+00B2;SUPERSCRIPT TWO;No;0;EN;<super> 0032;;2;2;N;SUPERSCRIPT DIGIT TWO;;;;
+00B3;SUPERSCRIPT THREE;No;0;EN;<super> 0033;;3;3;N;SUPERSCRIPT DIGIT THREE;;;;
+00B4;ACUTE ACCENT;Sk;0;ON;<compat> 0020 0301;;;;N;SPACING ACUTE;;;;
+00B5;MICRO SIGN;Ll;0;L;<compat> 03BC;;;;N;;;039C;;039C
+00B6;PILCROW SIGN;Po;0;ON;;;;;N;PARAGRAPH SIGN;;;;
+00B7;MIDDLE DOT;Po;0;ON;;;;;N;;;;;
+00B8;CEDILLA;Sk;0;ON;<compat> 0020 0327;;;;N;SPACING CEDILLA;;;;
+00B9;SUPERSCRIPT ONE;No;0;EN;<super> 0031;;1;1;N;SUPERSCRIPT DIGIT ONE;;;;
+00BA;MASCULINE ORDINAL INDICATOR;Lo;0;L;<super> 006F;;;;N;;;;;
+00BB;RIGHT-POINTING DOUBLE ANGLE QUOTATION MARK;Pf;0;ON;;;;;Y;RIGHT POINTING GUILLEMET;;;;
+00BC;VULGAR FRACTION ONE QUARTER;No;0;ON;<fraction> 0031 2044 0034;;;1/4;N;FRACTION ONE QUARTER;;;;
+00BD;VULGAR FRACTION ONE HALF;No;0;ON;<fraction> 0031 2044 0032;;;1/2;N;FRACTION ONE HALF;;;;
+00BE;VULGAR FRACTION THREE QUARTERS;No;0;ON;<fraction> 0033 2044 0034;;;3/4;N;FRACTION THREE QUARTERS;;;;
+00BF;INVERTED QUESTION MARK;Po;0;ON;;;;;N;;;;;
+00C0;LATIN CAPITAL LETTER A WITH GRAVE;Lu;0;L;0041 0300;;;;N;LATIN CAPITAL LETTER A GRAVE;;;00E0;
+00C1;LATIN CAPITAL LETTER A WITH ACUTE;Lu;0;L;0041 0301;;;;N;LATIN CAPITAL LETTER A ACUTE;;;00E1;
+00C2;LATIN CAPITAL LETTER A WITH CIRCUMFLEX;Lu;0;L;0041 0302;;;;N;LATIN CAPITAL LETTER A CIRCUMFLEX;;;00E2;
+00C3;LATIN CAPITAL LETTER A WITH TILDE;Lu;0;L;0041 0303;;;;N;LATIN CAPITAL LETTER A TILDE;;;00E3;
+00C4;LATIN CAPITAL LETTER A WITH DIAERESIS;Lu;0;L;0041 0308;;;;N;LATIN CAPITAL LETTER A DIAERESIS;;;00E4;
+00C5;LATIN CAPITAL LETTER A WITH RING ABOVE;Lu;0;L;0041 030A;;;;N;LATIN CAPITAL LETTER A RING;;;00E5;
+00C6;LATIN CAPITAL LETTER AE;Lu;0;L;;;;;N;LATIN CAPITAL LETTER A E;;;00E6;
+00C7;LATIN CAPITAL LETTER C WITH CEDILLA;Lu;0;L;0043 0327;;;;N;LATIN CAPITAL LETTER C CEDILLA;;;00E7;
+00C8;LATIN CAPITAL LETTER E WITH GRAVE;Lu;0;L;0045 0300;;;;N;LATIN CAPITAL LETTER E GRAVE;;;00E8;
+00C9;LATIN CAPITAL LETTER E WITH ACUTE;Lu;0;L;0045 0301;;;;N;LATIN CAPITAL LETTER E ACUTE;;;00E9;
+00CA;LATIN CAPITAL LETTER E WITH CIRCUMFLEX;Lu;0;L;0045 0302;;;;N;LATIN CAPITAL LETTER E CIRCUMFLEX;;;00EA;
+00CB;LATIN CAPITAL LETTER E WITH DIAERESIS;Lu;0;L;0045 0308;;;;N;LATIN CAPITAL LETTER E DIAERESIS;;;00EB;
+00CC;LATIN CAPITAL LETTER I WITH GRAVE;Lu;0;L;0049 0300;;;;N;LATIN CAPITAL LETTER I GRAVE;;;00EC;
+00CD;LATIN CAPITAL LETTER I WITH ACUTE;Lu;0;L;0049 0301;;;;N;LATIN CAPITAL LETTER I ACUTE;;;00ED;
+00CE;LATIN CAPITAL LETTER I WITH CIRCUMFLEX;Lu;0;L;0049 0302;;;;N;LATIN CAPITAL LETTER I CIRCUMFLEX;;;00EE;
+00CF;LATIN CAPITAL LETTER I WITH DIAERESIS;Lu;0;L;0049 0308;;;;N;LATIN CAPITAL LETTER I DIAERESIS;;;00EF;
+00D0;LATIN CAPITAL LETTER ETH;Lu;0;L;;;;;N;;;;00F0;
+00D1;LATIN CAPITAL LETTER N WITH TILDE;Lu;0;L;004E 0303;;;;N;LATIN CAPITAL LETTER N TILDE;;;00F1;
+00D2;LATIN CAPITAL LETTER O WITH GRAVE;Lu;0;L;004F 0300;;;;N;LATIN CAPITAL LETTER O GRAVE;;;00F2;
+00D3;LATIN CAPITAL LETTER O WITH ACUTE;Lu;0;L;004F 0301;;;;N;LATIN CAPITAL LETTER O ACUTE;;;00F3;
+00D4;LATIN CAPITAL LETTER O WITH CIRCUMFLEX;Lu;0;L;004F 0302;;;;N;LATIN CAPITAL LETTER O CIRCUMFLEX;;;00F4;
+00D5;LATIN CAPITAL LETTER O WITH TILDE;Lu;0;L;004F 0303;;;;N;LATIN CAPITAL LETTER O TILDE;;;00F5;
+00D6;LATIN CAPITAL LETTER O WITH DIAERESIS;Lu;0;L;004F 0308;;;;N;LATIN CAPITAL LETTER O DIAERESIS;;;00F6;
+00D7;MULTIPLICATION SIGN;Sm;0;ON;;;;;N;;;;;
+00D8;LATIN CAPITAL LETTER O WITH STROKE;Lu;0;L;;;;;N;LATIN CAPITAL LETTER O SLASH;;;00F8;
+00D9;LATIN CAPITAL LETTER U WITH GRAVE;Lu;0;L;0055 0300;;;;N;LATIN CAPITAL LETTER U GRAVE;;;00F9;
+00DA;LATIN CAPITAL LETTER U WITH ACUTE;Lu;0;L;0055 0301;;;;N;LATIN CAPITAL LETTER U ACUTE;;;00FA;
+00DB;LATIN CAPITAL LETTER U WITH CIRCUMFLEX;Lu;0;L;0055 0302;;;;N;LATIN CAPITAL LETTER U CIRCUMFLEX;;;00FB;
+00DC;LATIN CAPITAL LETTER U WITH DIAERESIS;Lu;0;L;0055 0308;;;;N;LATIN CAPITAL LETTER U DIAERESIS;;;00FC;
+00DD;LATIN CAPITAL LETTER Y WITH ACUTE;Lu;0;L;0059 0301;;;;N;LATIN CAPITAL LETTER Y ACUTE;;;00FD;
+00DE;LATIN CAPITAL LETTER THORN;Lu;0;L;;;;;N;;;;00FE;
+00DF;LATIN SMALL LETTER SHARP S;Ll;0;L;;;;;N;;;;;
+00E0;LATIN SMALL LETTER A WITH GRAVE;Ll;0;L;0061 0300;;;;N;LATIN SMALL LETTER A GRAVE;;00C0;;00C0
+00E1;LATIN SMALL LETTER A WITH ACUTE;Ll;0;L;0061 0301;;;;N;LATIN SMALL LETTER A ACUTE;;00C1;;00C1
+00E2;LATIN SMALL LETTER A WITH CIRCUMFLEX;Ll;0;L;0061 0302;;;;N;LATIN SMALL LETTER A CIRCUMFLEX;;00C2;;00C2
+00E3;LATIN SMALL LETTER A WITH TILDE;Ll;0;L;0061 0303;;;;N;LATIN SMALL LETTER A TILDE;;00C3;;00C3
+00E4;LATIN SMALL LETTER A WITH DIAERESIS;Ll;0;L;0061 0308;;;;N;LATIN SMALL LETTER A DIAERESIS;;00C4;;00C4
+00E5;LATIN SMALL LETTER A WITH RING ABOVE;Ll;0;L;0061 030A;;;;N;LATIN SMALL LETTER A RING;;00C5;;00C5
+00E6;LATIN SMALL LETTER AE;Ll;0;L;;;;;N;LATIN SMALL LETTER A E;;00C6;;00C6
+00E7;LATIN SMALL LETTER C WITH CEDILLA;Ll;0;L;0063 0327;;;;N;LATIN SMALL LETTER C CEDILLA;;00C7;;00C7
+00E8;LATIN SMALL LETTER E WITH GRAVE;Ll;0;L;0065 0300;;;;N;LATIN SMALL LETTER E GRAVE;;00C8;;00C8
+00E9;LATIN SMALL LETTER E WITH ACUTE;Ll;0;L;0065 0301;;;;N;LATIN SMALL LETTER E ACUTE;;00C9;;00C9
+00EA;LATIN SMALL LETTER E WITH CIRCUMFLEX;Ll;0;L;0065 0302;;;;N;LATIN SMALL LETTER E CIRCUMFLEX;;00CA;;00CA
+00EB;LATIN SMALL LETTER E WITH DIAERESIS;Ll;0;L;0065 0308;;;;N;LATIN SMALL LETTER E DIAERESIS;;00CB;;00CB
+00EC;LATIN SMALL LETTER I WITH GRAVE;Ll;0;L;0069 0300;;;;N;LATIN SMALL LETTER I GRAVE;;00CC;;00CC
+00ED;LATIN SMALL LETTER I WITH ACUTE;Ll;0;L;0069 0301;;;;N;LATIN SMALL LETTER I ACUTE;;00CD;;00CD
+00EE;LATIN SMALL LETTER I WITH CIRCUMFLEX;Ll;0;L;0069 0302;;;;N;LATIN SMALL LETTER I CIRCUMFLEX;;00CE;;00CE
+00EF;LATIN SMALL LETTER I WITH DIAERESIS;Ll;0;L;0069 0308;;;;N;LATIN SMALL LETTER I DIAERESIS;;00CF;;00CF
+00F0;LATIN SMALL LETTER ETH;Ll;0;L;;;;;N;;;00D0;;00D0
+00F1;LATIN SMALL LETTER N WITH TILDE;Ll;0;L;006E 0303;;;;N;LATIN SMALL LETTER N TILDE;;00D1;;00D1
+00F2;LATIN SMALL LETTER O WITH GRAVE;Ll;0;L;006F 0300;;;;N;LATIN SMALL LETTER O GRAVE;;00D2;;00D2
+00F3;LATIN SMALL LETTER O WITH ACUTE;Ll;0;L;006F 0301;;;;N;LATIN SMALL LETTER O ACUTE;;00D3;;00D3
+00F4;LATIN SMALL LETTER O WITH CIRCUMFLEX;Ll;0;L;006F 0302;;;;N;LATIN SMALL LETTER O CIRCUMFLEX;;00D4;;00D4
+00F5;LATIN SMALL LETTER O WITH TILDE;Ll;0;L;006F 0303;;;;N;LATIN SMALL LETTER O TILDE;;00D5;;00D5
+00F6;LATIN SMALL LETTER O WITH DIAERESIS;Ll;0;L;006F 0308;;;;N;LATIN SMALL LETTER O DIAERESIS;;00D6;;00D6
+00F7;DIVISION SIGN;Sm;0;ON;;;;;N;;;;;
+00F8;LATIN SMALL LETTER O WITH STROKE;Ll;0;L;;;;;N;LATIN SMALL LETTER O SLASH;;00D8;;00D8
+00F9;LATIN SMALL LETTER U WITH GRAVE;Ll;0;L;0075 0300;;;;N;LATIN SMALL LETTER U GRAVE;;00D9;;00D9
+00FA;LATIN SMALL LETTER U WITH ACUTE;Ll;0;L;0075 0301;;;;N;LATIN SMALL LETTER U ACUTE;;00DA;;00DA
+00FB;LATIN SMALL LETTER U WITH CIRCUMFLEX;Ll;0;L;0075 0302;;;;N;LATIN SMALL LETTER U CIRCUMFLEX;;00DB;;00DB
+00FC;LATIN SMALL LETTER U WITH DIAERESIS;Ll;0;L;0075 0308;;;;N;LATIN SMALL LETTER U DIAERESIS;;00DC;;00DC
+00FD;LATIN SMALL LETTER Y WITH ACUTE;Ll;0;L;0079 0301;;;;N;LATIN SMALL LETTER Y ACUTE;;00DD;;00DD
+00FE;LATIN SMALL LETTER THORN;Ll;0;L;;;;;N;;;00DE;;00DE
+00FF;LATIN SMALL LETTER Y WITH DIAERESIS;Ll;0;L;0079 0308;;;;N;LATIN SMALL LETTER Y DIAERESIS;;0178;;0178
+0100;LATIN CAPITAL LETTER A WITH MACRON;Lu;0;L;0041 0304;;;;N;LATIN CAPITAL LETTER A MACRON;;;0101;
+0101;LATIN SMALL LETTER A WITH MACRON;Ll;0;L;0061 0304;;;;N;LATIN SMALL LETTER A MACRON;;0100;;0100
+0102;LATIN CAPITAL LETTER A WITH BREVE;Lu;0;L;0041 0306;;;;N;LATIN CAPITAL LETTER A BREVE;;;0103;
+0103;LATIN SMALL LETTER A WITH BREVE;Ll;0;L;0061 0306;;;;N;LATIN SMALL LETTER A BREVE;;0102;;0102
+0104;LATIN CAPITAL LETTER A WITH OGONEK;Lu;0;L;0041 0328;;;;N;LATIN CAPITAL LETTER A OGONEK;;;0105;
+0105;LATIN SMALL LETTER A WITH OGONEK;Ll;0;L;0061 0328;;;;N;LATIN SMALL LETTER A OGONEK;;0104;;0104
+0106;LATIN CAPITAL LETTER C WITH ACUTE;Lu;0;L;0043 0301;;;;N;LATIN CAPITAL LETTER C ACUTE;;;0107;
+0107;LATIN SMALL LETTER C WITH ACUTE;Ll;0;L;0063 0301;;;;N;LATIN SMALL LETTER C ACUTE;;0106;;0106
+0108;LATIN CAPITAL LETTER C WITH CIRCUMFLEX;Lu;0;L;0043 0302;;;;N;LATIN CAPITAL LETTER C CIRCUMFLEX;;;0109;
+0109;LATIN SMALL LETTER C WITH CIRCUMFLEX;Ll;0;L;0063 0302;;;;N;LATIN SMALL LETTER C CIRCUMFLEX;;0108;;0108
+010A;LATIN CAPITAL LETTER C WITH DOT ABOVE;Lu;0;L;0043 0307;;;;N;LATIN CAPITAL LETTER C DOT;;;010B;
+010B;LATIN SMALL LETTER C WITH DOT ABOVE;Ll;0;L;0063 0307;;;;N;LATIN SMALL LETTER C DOT;;010A;;010A
+010C;LATIN CAPITAL LETTER C WITH CARON;Lu;0;L;0043 030C;;;;N;LATIN CAPITAL LETTER C HACEK;;;010D;
+010D;LATIN SMALL LETTER C WITH CARON;Ll;0;L;0063 030C;;;;N;LATIN SMALL LETTER C HACEK;;010C;;010C
+010E;LATIN CAPITAL LETTER D WITH CARON;Lu;0;L;0044 030C;;;;N;LATIN CAPITAL LETTER D HACEK;;;010F;
+010F;LATIN SMALL LETTER D WITH CARON;Ll;0;L;0064 030C;;;;N;LATIN SMALL LETTER D HACEK;;010E;;010E
+0110;LATIN CAPITAL LETTER D WITH STROKE;Lu;0;L;;;;;N;LATIN CAPITAL LETTER D BAR;;;0111;
+0111;LATIN SMALL LETTER D WITH STROKE;Ll;0;L;;;;;N;LATIN SMALL LETTER D BAR;;0110;;0110
+0112;LATIN CAPITAL LETTER E WITH MACRON;Lu;0;L;0045 0304;;;;N;LATIN CAPITAL LETTER E MACRON;;;0113;
+0113;LATIN SMALL LETTER E WITH MACRON;Ll;0;L;0065 0304;;;;N;LATIN SMALL LETTER E MACRON;;0112;;0112
+0114;LATIN CAPITAL LETTER E WITH BREVE;Lu;0;L;0045 0306;;;;N;LATIN CAPITAL LETTER E BREVE;;;0115;
+0115;LATIN SMALL LETTER E WITH BREVE;Ll;0;L;0065 0306;;;;N;LATIN SMALL LETTER E BREVE;;0114;;0114
+0116;LATIN CAPITAL LETTER E WITH DOT ABOVE;Lu;0;L;0045 0307;;;;N;LATIN CAPITAL LETTER E DOT;;;0117;
+0117;LATIN SMALL LETTER E WITH DOT ABOVE;Ll;0;L;0065 0307;;;;N;LATIN SMALL LETTER E DOT;;0116;;0116
+0118;LATIN CAPITAL LETTER E WITH OGONEK;Lu;0;L;0045 0328;;;;N;LATIN CAPITAL LETTER E OGONEK;;;0119;
+0119;LATIN SMALL LETTER E WITH OGONEK;Ll;0;L;0065 0328;;;;N;LATIN SMALL LETTER E OGONEK;;0118;;0118
+011A;LATIN CAPITAL LETTER E WITH CARON;Lu;0;L;0045 030C;;;;N;LATIN CAPITAL LETTER E HACEK;;;011B;
+011B;LATIN SMALL LETTER E WITH CARON;Ll;0;L;0065 030C;;;;N;LATIN SMALL LETTER E HACEK;;011A;;011A
+011C;LATIN CAPITAL LETTER G WITH CIRCUMFLEX;Lu;0;L;0047 0302;;;;N;LATIN CAPITAL LETTER G CIRCUMFLEX;;;011D;
+011D;LATIN SMALL LETTER G WITH CIRCUMFLEX;Ll;0;L;0067 0302;;;;N;LATIN SMALL LETTER G CIRCUMFLEX;;011C;;011C
+011E;LATIN CAPITAL LETTER G WITH BREVE;Lu;0;L;0047 0306;;;;N;LATIN CAPITAL LETTER G BREVE;;;011F;
+011F;LATIN SMALL LETTER G WITH BREVE;Ll;0;L;0067 0306;;;;N;LATIN SMALL LETTER G BREVE;;011E;;011E
+0120;LATIN CAPITAL LETTER G WITH DOT ABOVE;Lu;0;L;0047 0307;;;;N;LATIN CAPITAL LETTER G DOT;;;0121;
+0121;LATIN SMALL LETTER G WITH DOT ABOVE;Ll;0;L;0067 0307;;;;N;LATIN SMALL LETTER G DOT;;0120;;0120
+0122;LATIN CAPITAL LETTER G WITH CEDILLA;Lu;0;L;0047 0327;;;;N;LATIN CAPITAL LETTER G CEDILLA;;;0123;
+0123;LATIN SMALL LETTER G WITH CEDILLA;Ll;0;L;0067 0327;;;;N;LATIN SMALL LETTER G CEDILLA;;0122;;0122
+0124;LATIN CAPITAL LETTER H WITH CIRCUMFLEX;Lu;0;L;0048 0302;;;;N;LATIN CAPITAL LETTER H CIRCUMFLEX;;;0125;
+0125;LATIN SMALL LETTER H WITH CIRCUMFLEX;Ll;0;L;0068 0302;;;;N;LATIN SMALL LETTER H CIRCUMFLEX;;0124;;0124
+0126;LATIN CAPITAL LETTER H WITH STROKE;Lu;0;L;;;;;N;LATIN CAPITAL LETTER H BAR;;;0127;
+0127;LATIN SMALL LETTER H WITH STROKE;Ll;0;L;;;;;N;LATIN SMALL LETTER H BAR;;0126;;0126
+0128;LATIN CAPITAL LETTER I WITH TILDE;Lu;0;L;0049 0303;;;;N;LATIN CAPITAL LETTER I TILDE;;;0129;
+0129;LATIN SMALL LETTER I WITH TILDE;Ll;0;L;0069 0303;;;;N;LATIN SMALL LETTER I TILDE;;0128;;0128
+012A;LATIN CAPITAL LETTER I WITH MACRON;Lu;0;L;0049 0304;;;;N;LATIN CAPITAL LETTER I MACRON;;;012B;
+012B;LATIN SMALL LETTER I WITH MACRON;Ll;0;L;0069 0304;;;;N;LATIN SMALL LETTER I MACRON;;012A;;012A
+012C;LATIN CAPITAL LETTER I WITH BREVE;Lu;0;L;0049 0306;;;;N;LATIN CAPITAL LETTER I BREVE;;;012D;
+012D;LATIN SMALL LETTER I WITH BREVE;Ll;0;L;0069 0306;;;;N;LATIN SMALL LETTER I BREVE;;012C;;012C
+012E;LATIN CAPITAL LETTER I WITH OGONEK;Lu;0;L;0049 0328;;;;N;LATIN CAPITAL LETTER I OGONEK;;;012F;
+012F;LATIN SMALL LETTER I WITH OGONEK;Ll;0;L;0069 0328;;;;N;LATIN SMALL LETTER I OGONEK;;012E;;012E
+0130;LATIN CAPITAL LETTER I WITH DOT ABOVE;Lu;0;L;0049 0307;;;;N;LATIN CAPITAL LETTER I DOT;;;0069;
+0131;LATIN SMALL LETTER DOTLESS I;Ll;0;L;;;;;N;;;0049;;0049
+0132;LATIN CAPITAL LIGATURE IJ;Lu;0;L;<compat> 0049 004A;;;;N;LATIN CAPITAL LETTER I J;;;0133;
+0133;LATIN SMALL LIGATURE IJ;Ll;0;L;<compat> 0069 006A;;;;N;LATIN SMALL LETTER I J;;0132;;0132
+0134;LATIN CAPITAL LETTER J WITH CIRCUMFLEX;Lu;0;L;004A 0302;;;;N;LATIN CAPITAL LETTER J CIRCUMFLEX;;;0135;
+0135;LATIN SMALL LETTER J WITH CIRCUMFLEX;Ll;0;L;006A 0302;;;;N;LATIN SMALL LETTER J CIRCUMFLEX;;0134;;0134
+0136;LATIN CAPITAL LETTER K WITH CEDILLA;Lu;0;L;004B 0327;;;;N;LATIN CAPITAL LETTER K CEDILLA;;;0137;
+0137;LATIN SMALL LETTER K WITH CEDILLA;Ll;0;L;006B 0327;;;;N;LATIN SMALL LETTER K CEDILLA;;0136;;0136
+0138;LATIN SMALL LETTER KRA;Ll;0;L;;;;;N;;;;;
+0139;LATIN CAPITAL LETTER L WITH ACUTE;Lu;0;L;004C 0301;;;;N;LATIN CAPITAL LETTER L ACUTE;;;013A;
+013A;LATIN SMALL LETTER L WITH ACUTE;Ll;0;L;006C 0301;;;;N;LATIN SMALL LETTER L ACUTE;;0139;;0139
+013B;LATIN CAPITAL LETTER L WITH CEDILLA;Lu;0;L;004C 0327;;;;N;LATIN CAPITAL LETTER L CEDILLA;;;013C;
+013C;LATIN SMALL LETTER L WITH CEDILLA;Ll;0;L;006C 0327;;;;N;LATIN SMALL LETTER L CEDILLA;;013B;;013B
+013D;LATIN CAPITAL LETTER L WITH CARON;Lu;0;L;004C 030C;;;;N;LATIN CAPITAL LETTER L HACEK;;;013E;
+013E;LATIN SMALL LETTER L WITH CARON;Ll;0;L;006C 030C;;;;N;LATIN SMALL LETTER L HACEK;;013D;;013D
+013F;LATIN CAPITAL LETTER L WITH MIDDLE DOT;Lu;0;L;<compat> 004C 00B7;;;;N;;;;0140;
+0140;LATIN SMALL LETTER L WITH MIDDLE DOT;Ll;0;L;<compat> 006C 00B7;;;;N;;;013F;;013F
+0141;LATIN CAPITAL LETTER L WITH STROKE;Lu;0;L;;;;;N;LATIN CAPITAL LETTER L SLASH;;;0142;
+0142;LATIN SMALL LETTER L WITH STROKE;Ll;0;L;;;;;N;LATIN SMALL LETTER L SLASH;;0141;;0141
+0143;LATIN CAPITAL LETTER N WITH ACUTE;Lu;0;L;004E 0301;;;;N;LATIN CAPITAL LETTER N ACUTE;;;0144;
+0144;LATIN SMALL LETTER N WITH ACUTE;Ll;0;L;006E 0301;;;;N;LATIN SMALL LETTER N ACUTE;;0143;;0143
+0145;LATIN CAPITAL LETTER N WITH CEDILLA;Lu;0;L;004E 0327;;;;N;LATIN CAPITAL LETTER N CEDILLA;;;0146;
+0146;LATIN SMALL LETTER N WITH CEDILLA;Ll;0;L;006E 0327;;;;N;LATIN SMALL LETTER N CEDILLA;;0145;;0145
+0147;LATIN CAPITAL LETTER N WITH CARON;Lu;0;L;004E 030C;;;;N;LATIN CAPITAL LETTER N HACEK;;;0148;
+0148;LATIN SMALL LETTER N WITH CARON;Ll;0;L;006E 030C;;;;N;LATIN SMALL LETTER N HACEK;;0147;;0147
+0149;LATIN SMALL LETTER N PRECEDED BY APOSTROPHE;Ll;0;L;<compat> 02BC 006E;;;;N;LATIN SMALL LETTER APOSTROPHE N;;;;
+014A;LATIN CAPITAL LETTER ENG;Lu;0;L;;;;;N;;;;014B;
+014B;LATIN SMALL LETTER ENG;Ll;0;L;;;;;N;;;014A;;014A
+014C;LATIN CAPITAL LETTER O WITH MACRON;Lu;0;L;004F 0304;;;;N;LATIN CAPITAL LETTER O MACRON;;;014D;
+014D;LATIN SMALL LETTER O WITH MACRON;Ll;0;L;006F 0304;;;;N;LATIN SMALL LETTER O MACRON;;014C;;014C
+014E;LATIN CAPITAL LETTER O WITH BREVE;Lu;0;L;004F 0306;;;;N;LATIN CAPITAL LETTER O BREVE;;;014F;
+014F;LATIN SMALL LETTER O WITH BREVE;Ll;0;L;006F 0306;;;;N;LATIN SMALL LETTER O BREVE;;014E;;014E
+0150;LATIN CAPITAL LETTER O WITH DOUBLE ACUTE;Lu;0;L;004F 030B;;;;N;LATIN CAPITAL LETTER O DOUBLE ACUTE;;;0151;
+0151;LATIN SMALL LETTER O WITH DOUBLE ACUTE;Ll;0;L;006F 030B;;;;N;LATIN SMALL LETTER O DOUBLE ACUTE;;0150;;0150
+0152;LATIN CAPITAL LIGATURE OE;Lu;0;L;;;;;N;LATIN CAPITAL LETTER O E;;;0153;
+0153;LATIN SMALL LIGATURE OE;Ll;0;L;;;;;N;LATIN SMALL LETTER O E;;0152;;0152
+0154;LATIN CAPITAL LETTER R WITH ACUTE;Lu;0;L;0052 0301;;;;N;LATIN CAPITAL LETTER R ACUTE;;;0155;
+0155;LATIN SMALL LETTER R WITH ACUTE;Ll;0;L;0072 0301;;;;N;LATIN SMALL LETTER R ACUTE;;0154;;0154
+0156;LATIN CAPITAL LETTER R WITH CEDILLA;Lu;0;L;0052 0327;;;;N;LATIN CAPITAL LETTER R CEDILLA;;;0157;
+0157;LATIN SMALL LETTER R WITH CEDILLA;Ll;0;L;0072 0327;;;;N;LATIN SMALL LETTER R CEDILLA;;0156;;0156
+0158;LATIN CAPITAL LETTER R WITH CARON;Lu;0;L;0052 030C;;;;N;LATIN CAPITAL LETTER R HACEK;;;0159;
+0159;LATIN SMALL LETTER R WITH CARON;Ll;0;L;0072 030C;;;;N;LATIN SMALL LETTER R HACEK;;0158;;0158
+015A;LATIN CAPITAL LETTER S WITH ACUTE;Lu;0;L;0053 0301;;;;N;LATIN CAPITAL LETTER S ACUTE;;;015B;
+015B;LATIN SMALL LETTER S WITH ACUTE;Ll;0;L;0073 0301;;;;N;LATIN SMALL LETTER S ACUTE;;015A;;015A
+015C;LATIN CAPITAL LETTER S WITH CIRCUMFLEX;Lu;0;L;0053 0302;;;;N;LATIN CAPITAL LETTER S CIRCUMFLEX;;;015D;
+015D;LATIN SMALL LETTER S WITH CIRCUMFLEX;Ll;0;L;0073 0302;;;;N;LATIN SMALL LETTER S CIRCUMFLEX;;015C;;015C
+015E;LATIN CAPITAL LETTER S WITH CEDILLA;Lu;0;L;0053 0327;;;;N;LATIN CAPITAL LETTER S CEDILLA;;;015F;
+015F;LATIN SMALL LETTER S WITH CEDILLA;Ll;0;L;0073 0327;;;;N;LATIN SMALL LETTER S CEDILLA;;015E;;015E
+0160;LATIN CAPITAL LETTER S WITH CARON;Lu;0;L;0053 030C;;;;N;LATIN CAPITAL LETTER S HACEK;;;0161;
+0161;LATIN SMALL LETTER S WITH CARON;Ll;0;L;0073 030C;;;;N;LATIN SMALL LETTER S HACEK;;0160;;0160
+0162;LATIN CAPITAL LETTER T WITH CEDILLA;Lu;0;L;0054 0327;;;;N;LATIN CAPITAL LETTER T CEDILLA;;;0163;
+0163;LATIN SMALL LETTER T WITH CEDILLA;Ll;0;L;0074 0327;;;;N;LATIN SMALL LETTER T CEDILLA;;0162;;0162
+0164;LATIN CAPITAL LETTER T WITH CARON;Lu;0;L;0054 030C;;;;N;LATIN CAPITAL LETTER T HACEK;;;0165;
+0165;LATIN SMALL LETTER T WITH CARON;Ll;0;L;0074 030C;;;;N;LATIN SMALL LETTER T HACEK;;0164;;0164
+0166;LATIN CAPITAL LETTER T WITH STROKE;Lu;0;L;;;;;N;LATIN CAPITAL LETTER T BAR;;;0167;
+0167;LATIN SMALL LETTER T WITH STROKE;Ll;0;L;;;;;N;LATIN SMALL LETTER T BAR;;0166;;0166
+0168;LATIN CAPITAL LETTER U WITH TILDE;Lu;0;L;0055 0303;;;;N;LATIN CAPITAL LETTER U TILDE;;;0169;
+0169;LATIN SMALL LETTER U WITH TILDE;Ll;0;L;0075 0303;;;;N;LATIN SMALL LETTER U TILDE;;0168;;0168
+016A;LATIN CAPITAL LETTER U WITH MACRON;Lu;0;L;0055 0304;;;;N;LATIN CAPITAL LETTER U MACRON;;;016B;
+016B;LATIN SMALL LETTER U WITH MACRON;Ll;0;L;0075 0304;;;;N;LATIN SMALL LETTER U MACRON;;016A;;016A
+016C;LATIN CAPITAL LETTER U WITH BREVE;Lu;0;L;0055 0306;;;;N;LATIN CAPITAL LETTER U BREVE;;;016D;
+016D;LATIN SMALL LETTER U WITH BREVE;Ll;0;L;0075 0306;;;;N;LATIN SMALL LETTER U BREVE;;016C;;016C
+016E;LATIN CAPITAL LETTER U WITH RING ABOVE;Lu;0;L;0055 030A;;;;N;LATIN CAPITAL LETTER U RING;;;016F;
+016F;LATIN SMALL LETTER U WITH RING ABOVE;Ll;0;L;0075 030A;;;;N;LATIN SMALL LETTER U RING;;016E;;016E
+0170;LATIN CAPITAL LETTER U WITH DOUBLE ACUTE;Lu;0;L;0055 030B;;;;N;LATIN CAPITAL LETTER U DOUBLE ACUTE;;;0171;
+0171;LATIN SMALL LETTER U WITH DOUBLE ACUTE;Ll;0;L;0075 030B;;;;N;LATIN SMALL LETTER U DOUBLE ACUTE;;0170;;0170
+0172;LATIN CAPITAL LETTER U WITH OGONEK;Lu;0;L;0055 0328;;;;N;LATIN CAPITAL LETTER U OGONEK;;;0173;
+0173;LATIN SMALL LETTER U WITH OGONEK;Ll;0;L;0075 0328;;;;N;LATIN SMALL LETTER U OGONEK;;0172;;0172
+0174;LATIN CAPITAL LETTER W WITH CIRCUMFLEX;Lu;0;L;0057 0302;;;;N;LATIN CAPITAL LETTER W CIRCUMFLEX;;;0175;
+0175;LATIN SMALL LETTER W WITH CIRCUMFLEX;Ll;0;L;0077 0302;;;;N;LATIN SMALL LETTER W CIRCUMFLEX;;0174;;0174
+0176;LATIN CAPITAL LETTER Y WITH CIRCUMFLEX;Lu;0;L;0059 0302;;;;N;LATIN CAPITAL LETTER Y CIRCUMFLEX;;;0177;
+0177;LATIN SMALL LETTER Y WITH CIRCUMFLEX;Ll;0;L;0079 0302;;;;N;LATIN SMALL LETTER Y CIRCUMFLEX;;0176;;0176
+0178;LATIN CAPITAL LETTER Y WITH DIAERESIS;Lu;0;L;0059 0308;;;;N;LATIN CAPITAL LETTER Y DIAERESIS;;;00FF;
+0179;LATIN CAPITAL LETTER Z WITH ACUTE;Lu;0;L;005A 0301;;;;N;LATIN CAPITAL LETTER Z ACUTE;;;017A;
+017A;LATIN SMALL LETTER Z WITH ACUTE;Ll;0;L;007A 0301;;;;N;LATIN SMALL LETTER Z ACUTE;;0179;;0179
+017B;LATIN CAPITAL LETTER Z WITH DOT ABOVE;Lu;0;L;005A 0307;;;;N;LATIN CAPITAL LETTER Z DOT;;;017C;
+017C;LATIN SMALL LETTER Z WITH DOT ABOVE;Ll;0;L;007A 0307;;;;N;LATIN SMALL LETTER Z DOT;;017B;;017B
+017D;LATIN CAPITAL LETTER Z WITH CARON;Lu;0;L;005A 030C;;;;N;LATIN CAPITAL LETTER Z HACEK;;;017E;
+017E;LATIN SMALL LETTER Z WITH CARON;Ll;0;L;007A 030C;;;;N;LATIN SMALL LETTER Z HACEK;;017D;;017D
+017F;LATIN SMALL LETTER LONG S;Ll;0;L;<compat> 0073;;;;N;;;0053;;0053
+0180;LATIN SMALL LETTER B WITH STROKE;Ll;0;L;;;;;N;LATIN SMALL LETTER B BAR;;0243;;0243
+0181;LATIN CAPITAL LETTER B WITH HOOK;Lu;0;L;;;;;N;LATIN CAPITAL LETTER B HOOK;;;0253;
+0182;LATIN CAPITAL LETTER B WITH TOPBAR;Lu;0;L;;;;;N;LATIN CAPITAL LETTER B TOPBAR;;;0183;
+0183;LATIN SMALL LETTER B WITH TOPBAR;Ll;0;L;;;;;N;LATIN SMALL LETTER B TOPBAR;;0182;;0182
+0184;LATIN CAPITAL LETTER TONE SIX;Lu;0;L;;;;;N;;;;0185;
+0185;LATIN SMALL LETTER TONE SIX;Ll;0;L;;;;;N;;;0184;;0184
+0186;LATIN CAPITAL LETTER OPEN O;Lu;0;L;;;;;N;;;;0254;
+0187;LATIN CAPITAL LETTER C WITH HOOK;Lu;0;L;;;;;N;LATIN CAPITAL LETTER C HOOK;;;0188;
+0188;LATIN SMALL LETTER C WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER C HOOK;;0187;;0187
+0189;LATIN CAPITAL LETTER AFRICAN D;Lu;0;L;;;;;N;;;;0256;
+018A;LATIN CAPITAL LETTER D WITH HOOK;Lu;0;L;;;;;N;LATIN CAPITAL LETTER D HOOK;;;0257;
+018B;LATIN CAPITAL LETTER D WITH TOPBAR;Lu;0;L;;;;;N;LATIN CAPITAL LETTER D TOPBAR;;;018C;
+018C;LATIN SMALL LETTER D WITH TOPBAR;Ll;0;L;;;;;N;LATIN SMALL LETTER D TOPBAR;;018B;;018B
+018D;LATIN SMALL LETTER TURNED DELTA;Ll;0;L;;;;;N;;;;;
+018E;LATIN CAPITAL LETTER REVERSED E;Lu;0;L;;;;;N;LATIN CAPITAL LETTER TURNED E;;;01DD;
+018F;LATIN CAPITAL LETTER SCHWA;Lu;0;L;;;;;N;;;;0259;
+0190;LATIN CAPITAL LETTER OPEN E;Lu;0;L;;;;;N;LATIN CAPITAL LETTER EPSILON;;;025B;
+0191;LATIN CAPITAL LETTER F WITH HOOK;Lu;0;L;;;;;N;LATIN CAPITAL LETTER F HOOK;;;0192;
+0192;LATIN SMALL LETTER F WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER SCRIPT F;;0191;;0191
+0193;LATIN CAPITAL LETTER G WITH HOOK;Lu;0;L;;;;;N;LATIN CAPITAL LETTER G HOOK;;;0260;
+0194;LATIN CAPITAL LETTER GAMMA;Lu;0;L;;;;;N;;;;0263;
+0195;LATIN SMALL LETTER HV;Ll;0;L;;;;;N;LATIN SMALL LETTER H V;;01F6;;01F6
+0196;LATIN CAPITAL LETTER IOTA;Lu;0;L;;;;;N;;;;0269;
+0197;LATIN CAPITAL LETTER I WITH STROKE;Lu;0;L;;;;;N;LATIN CAPITAL LETTER BARRED I;;;0268;
+0198;LATIN CAPITAL LETTER K WITH HOOK;Lu;0;L;;;;;N;LATIN CAPITAL LETTER K HOOK;;;0199;
+0199;LATIN SMALL LETTER K WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER K HOOK;;0198;;0198
+019A;LATIN SMALL LETTER L WITH BAR;Ll;0;L;;;;;N;LATIN SMALL LETTER BARRED L;;023D;;023D
+019B;LATIN SMALL LETTER LAMBDA WITH STROKE;Ll;0;L;;;;;N;LATIN SMALL LETTER BARRED LAMBDA;;;;
+019C;LATIN CAPITAL LETTER TURNED M;Lu;0;L;;;;;N;;;;026F;
+019D;LATIN CAPITAL LETTER N WITH LEFT HOOK;Lu;0;L;;;;;N;LATIN CAPITAL LETTER N HOOK;;;0272;
+019E;LATIN SMALL LETTER N WITH LONG RIGHT LEG;Ll;0;L;;;;;N;;;0220;;0220
+019F;LATIN CAPITAL LETTER O WITH MIDDLE TILDE;Lu;0;L;;;;;N;LATIN CAPITAL LETTER BARRED O;;;0275;
+01A0;LATIN CAPITAL LETTER O WITH HORN;Lu;0;L;004F 031B;;;;N;LATIN CAPITAL LETTER O HORN;;;01A1;
+01A1;LATIN SMALL LETTER O WITH HORN;Ll;0;L;006F 031B;;;;N;LATIN SMALL LETTER O HORN;;01A0;;01A0
+01A2;LATIN CAPITAL LETTER OI;Lu;0;L;;;;;N;LATIN CAPITAL LETTER O I;;;01A3;
+01A3;LATIN SMALL LETTER OI;Ll;0;L;;;;;N;LATIN SMALL LETTER O I;;01A2;;01A2
+01A4;LATIN CAPITAL LETTER P WITH HOOK;Lu;0;L;;;;;N;LATIN CAPITAL LETTER P HOOK;;;01A5;
+01A5;LATIN SMALL LETTER P WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER P HOOK;;01A4;;01A4
+01A6;LATIN LETTER YR;Lu;0;L;;;;;N;LATIN LETTER Y R;;;0280;
+01A7;LATIN CAPITAL LETTER TONE TWO;Lu;0;L;;;;;N;;;;01A8;
+01A8;LATIN SMALL LETTER TONE TWO;Ll;0;L;;;;;N;;;01A7;;01A7
+01A9;LATIN CAPITAL LETTER ESH;Lu;0;L;;;;;N;;;;0283;
+01AA;LATIN LETTER REVERSED ESH LOOP;Ll;0;L;;;;;N;;;;;
+01AB;LATIN SMALL LETTER T WITH PALATAL HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER T PALATAL HOOK;;;;
+01AC;LATIN CAPITAL LETTER T WITH HOOK;Lu;0;L;;;;;N;LATIN CAPITAL LETTER T HOOK;;;01AD;
+01AD;LATIN SMALL LETTER T WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER T HOOK;;01AC;;01AC
+01AE;LATIN CAPITAL LETTER T WITH RETROFLEX HOOK;Lu;0;L;;;;;N;LATIN CAPITAL LETTER T RETROFLEX HOOK;;;0288;
+01AF;LATIN CAPITAL LETTER U WITH HORN;Lu;0;L;0055 031B;;;;N;LATIN CAPITAL LETTER U HORN;;;01B0;
+01B0;LATIN SMALL LETTER U WITH HORN;Ll;0;L;0075 031B;;;;N;LATIN SMALL LETTER U HORN;;01AF;;01AF
+01B1;LATIN CAPITAL LETTER UPSILON;Lu;0;L;;;;;N;;;;028A;
+01B2;LATIN CAPITAL LETTER V WITH HOOK;Lu;0;L;;;;;N;LATIN CAPITAL LETTER SCRIPT V;;;028B;
+01B3;LATIN CAPITAL LETTER Y WITH HOOK;Lu;0;L;;;;;N;LATIN CAPITAL LETTER Y HOOK;;;01B4;
+01B4;LATIN SMALL LETTER Y WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER Y HOOK;;01B3;;01B3
+01B5;LATIN CAPITAL LETTER Z WITH STROKE;Lu;0;L;;;;;N;LATIN CAPITAL LETTER Z BAR;;;01B6;
+01B6;LATIN SMALL LETTER Z WITH STROKE;Ll;0;L;;;;;N;LATIN SMALL LETTER Z BAR;;01B5;;01B5
+01B7;LATIN CAPITAL LETTER EZH;Lu;0;L;;;;;N;LATIN CAPITAL LETTER YOGH;;;0292;
+01B8;LATIN CAPITAL LETTER EZH REVERSED;Lu;0;L;;;;;N;LATIN CAPITAL LETTER REVERSED YOGH;;;01B9;
+01B9;LATIN SMALL LETTER EZH REVERSED;Ll;0;L;;;;;N;LATIN SMALL LETTER REVERSED YOGH;;01B8;;01B8
+01BA;LATIN SMALL LETTER EZH WITH TAIL;Ll;0;L;;;;;N;LATIN SMALL LETTER YOGH WITH TAIL;;;;
+01BB;LATIN LETTER TWO WITH STROKE;Lo;0;L;;;;;N;LATIN LETTER TWO BAR;;;;
+01BC;LATIN CAPITAL LETTER TONE FIVE;Lu;0;L;;;;;N;;;;01BD;
+01BD;LATIN SMALL LETTER TONE FIVE;Ll;0;L;;;;;N;;;01BC;;01BC
+01BE;LATIN LETTER INVERTED GLOTTAL STOP WITH STROKE;Ll;0;L;;;;;N;LATIN LETTER INVERTED GLOTTAL STOP BAR;;;;
+01BF;LATIN LETTER WYNN;Ll;0;L;;;;;N;;;01F7;;01F7
+01C0;LATIN LETTER DENTAL CLICK;Lo;0;L;;;;;N;LATIN LETTER PIPE;;;;
+01C1;LATIN LETTER LATERAL CLICK;Lo;0;L;;;;;N;LATIN LETTER DOUBLE PIPE;;;;
+01C2;LATIN LETTER ALVEOLAR CLICK;Lo;0;L;;;;;N;LATIN LETTER PIPE DOUBLE BAR;;;;
+01C3;LATIN LETTER RETROFLEX CLICK;Lo;0;L;;;;;N;LATIN LETTER EXCLAMATION MARK;;;;
+01C4;LATIN CAPITAL LETTER DZ WITH CARON;Lu;0;L;<compat> 0044 017D;;;;N;LATIN CAPITAL LETTER D Z HACEK;;;01C6;01C5
+01C5;LATIN CAPITAL LETTER D WITH SMALL LETTER Z WITH CARON;Lt;0;L;<compat> 0044 017E;;;;N;LATIN LETTER CAPITAL D SMALL Z HACEK;;01C4;01C6;01C5
+01C6;LATIN SMALL LETTER DZ WITH CARON;Ll;0;L;<compat> 0064 017E;;;;N;LATIN SMALL LETTER D Z HACEK;;01C4;;01C5
+01C7;LATIN CAPITAL LETTER LJ;Lu;0;L;<compat> 004C 004A;;;;N;LATIN CAPITAL LETTER L J;;;01C9;01C8
+01C8;LATIN CAPITAL LETTER L WITH SMALL LETTER J;Lt;0;L;<compat> 004C 006A;;;;N;LATIN LETTER CAPITAL L SMALL J;;01C7;01C9;01C8
+01C9;LATIN SMALL LETTER LJ;Ll;0;L;<compat> 006C 006A;;;;N;LATIN SMALL LETTER L J;;01C7;;01C8
+01CA;LATIN CAPITAL LETTER NJ;Lu;0;L;<compat> 004E 004A;;;;N;LATIN CAPITAL LETTER N J;;;01CC;01CB
+01CB;LATIN CAPITAL LETTER N WITH SMALL LETTER J;Lt;0;L;<compat> 004E 006A;;;;N;LATIN LETTER CAPITAL N SMALL J;;01CA;01CC;01CB
+01CC;LATIN SMALL LETTER NJ;Ll;0;L;<compat> 006E 006A;;;;N;LATIN SMALL LETTER N J;;01CA;;01CB
+01CD;LATIN CAPITAL LETTER A WITH CARON;Lu;0;L;0041 030C;;;;N;LATIN CAPITAL LETTER A HACEK;;;01CE;
+01CE;LATIN SMALL LETTER A WITH CARON;Ll;0;L;0061 030C;;;;N;LATIN SMALL LETTER A HACEK;;01CD;;01CD
+01CF;LATIN CAPITAL LETTER I WITH CARON;Lu;0;L;0049 030C;;;;N;LATIN CAPITAL LETTER I HACEK;;;01D0;
+01D0;LATIN SMALL LETTER I WITH CARON;Ll;0;L;0069 030C;;;;N;LATIN SMALL LETTER I HACEK;;01CF;;01CF
+01D1;LATIN CAPITAL LETTER O WITH CARON;Lu;0;L;004F 030C;;;;N;LATIN CAPITAL LETTER O HACEK;;;01D2;
+01D2;LATIN SMALL LETTER O WITH CARON;Ll;0;L;006F 030C;;;;N;LATIN SMALL LETTER O HACEK;;01D1;;01D1
+01D3;LATIN CAPITAL LETTER U WITH CARON;Lu;0;L;0055 030C;;;;N;LATIN CAPITAL LETTER U HACEK;;;01D4;
+01D4;LATIN SMALL LETTER U WITH CARON;Ll;0;L;0075 030C;;;;N;LATIN SMALL LETTER U HACEK;;01D3;;01D3
+01D5;LATIN CAPITAL LETTER U WITH DIAERESIS AND MACRON;Lu;0;L;00DC 0304;;;;N;LATIN CAPITAL LETTER U DIAERESIS MACRON;;;01D6;
+01D6;LATIN SMALL LETTER U WITH DIAERESIS AND MACRON;Ll;0;L;00FC 0304;;;;N;LATIN SMALL LETTER U DIAERESIS MACRON;;01D5;;01D5
+01D7;LATIN CAPITAL LETTER U WITH DIAERESIS AND ACUTE;Lu;0;L;00DC 0301;;;;N;LATIN CAPITAL LETTER U DIAERESIS ACUTE;;;01D8;
+01D8;LATIN SMALL LETTER U WITH DIAERESIS AND ACUTE;Ll;0;L;00FC 0301;;;;N;LATIN SMALL LETTER U DIAERESIS ACUTE;;01D7;;01D7
+01D9;LATIN CAPITAL LETTER U WITH DIAERESIS AND CARON;Lu;0;L;00DC 030C;;;;N;LATIN CAPITAL LETTER U DIAERESIS HACEK;;;01DA;
+01DA;LATIN SMALL LETTER U WITH DIAERESIS AND CARON;Ll;0;L;00FC 030C;;;;N;LATIN SMALL LETTER U DIAERESIS HACEK;;01D9;;01D9
+01DB;LATIN CAPITAL LETTER U WITH DIAERESIS AND GRAVE;Lu;0;L;00DC 0300;;;;N;LATIN CAPITAL LETTER U DIAERESIS GRAVE;;;01DC;
+01DC;LATIN SMALL LETTER U WITH DIAERESIS AND GRAVE;Ll;0;L;00FC 0300;;;;N;LATIN SMALL LETTER U DIAERESIS GRAVE;;01DB;;01DB
+01DD;LATIN SMALL LETTER TURNED E;Ll;0;L;;;;;N;;;018E;;018E
+01DE;LATIN CAPITAL LETTER A WITH DIAERESIS AND MACRON;Lu;0;L;00C4 0304;;;;N;LATIN CAPITAL LETTER A DIAERESIS MACRON;;;01DF;
+01DF;LATIN SMALL LETTER A WITH DIAERESIS AND MACRON;Ll;0;L;00E4 0304;;;;N;LATIN SMALL LETTER A DIAERESIS MACRON;;01DE;;01DE
+01E0;LATIN CAPITAL LETTER A WITH DOT ABOVE AND MACRON;Lu;0;L;0226 0304;;;;N;LATIN CAPITAL LETTER A DOT MACRON;;;01E1;
+01E1;LATIN SMALL LETTER A WITH DOT ABOVE AND MACRON;Ll;0;L;0227 0304;;;;N;LATIN SMALL LETTER A DOT MACRON;;01E0;;01E0
+01E2;LATIN CAPITAL LETTER AE WITH MACRON;Lu;0;L;00C6 0304;;;;N;LATIN CAPITAL LETTER A E MACRON;;;01E3;
+01E3;LATIN SMALL LETTER AE WITH MACRON;Ll;0;L;00E6 0304;;;;N;LATIN SMALL LETTER A E MACRON;;01E2;;01E2
+01E4;LATIN CAPITAL LETTER G WITH STROKE;Lu;0;L;;;;;N;LATIN CAPITAL LETTER G BAR;;;01E5;
+01E5;LATIN SMALL LETTER G WITH STROKE;Ll;0;L;;;;;N;LATIN SMALL LETTER G BAR;;01E4;;01E4
+01E6;LATIN CAPITAL LETTER G WITH CARON;Lu;0;L;0047 030C;;;;N;LATIN CAPITAL LETTER G HACEK;;;01E7;
+01E7;LATIN SMALL LETTER G WITH CARON;Ll;0;L;0067 030C;;;;N;LATIN SMALL LETTER G HACEK;;01E6;;01E6
+01E8;LATIN CAPITAL LETTER K WITH CARON;Lu;0;L;004B 030C;;;;N;LATIN CAPITAL LETTER K HACEK;;;01E9;
+01E9;LATIN SMALL LETTER K WITH CARON;Ll;0;L;006B 030C;;;;N;LATIN SMALL LETTER K HACEK;;01E8;;01E8
+01EA;LATIN CAPITAL LETTER O WITH OGONEK;Lu;0;L;004F 0328;;;;N;LATIN CAPITAL LETTER O OGONEK;;;01EB;
+01EB;LATIN SMALL LETTER O WITH OGONEK;Ll;0;L;006F 0328;;;;N;LATIN SMALL LETTER O OGONEK;;01EA;;01EA
+01EC;LATIN CAPITAL LETTER O WITH OGONEK AND MACRON;Lu;0;L;01EA 0304;;;;N;LATIN CAPITAL LETTER O OGONEK MACRON;;;01ED;
+01ED;LATIN SMALL LETTER O WITH OGONEK AND MACRON;Ll;0;L;01EB 0304;;;;N;LATIN SMALL LETTER O OGONEK MACRON;;01EC;;01EC
+01EE;LATIN CAPITAL LETTER EZH WITH CARON;Lu;0;L;01B7 030C;;;;N;LATIN CAPITAL LETTER YOGH HACEK;;;01EF;
+01EF;LATIN SMALL LETTER EZH WITH CARON;Ll;0;L;0292 030C;;;;N;LATIN SMALL LETTER YOGH HACEK;;01EE;;01EE
+01F0;LATIN SMALL LETTER J WITH CARON;Ll;0;L;006A 030C;;;;N;LATIN SMALL LETTER J HACEK;;;;
+01F1;LATIN CAPITAL LETTER DZ;Lu;0;L;<compat> 0044 005A;;;;N;;;;01F3;01F2
+01F2;LATIN CAPITAL LETTER D WITH SMALL LETTER Z;Lt;0;L;<compat> 0044 007A;;;;N;;;01F1;01F3;01F2
+01F3;LATIN SMALL LETTER DZ;Ll;0;L;<compat> 0064 007A;;;;N;;;01F1;;01F2
+01F4;LATIN CAPITAL LETTER G WITH ACUTE;Lu;0;L;0047 0301;;;;N;;;;01F5;
+01F5;LATIN SMALL LETTER G WITH ACUTE;Ll;0;L;0067 0301;;;;N;;;01F4;;01F4
+01F6;LATIN CAPITAL LETTER HWAIR;Lu;0;L;;;;;N;;;;0195;
+01F7;LATIN CAPITAL LETTER WYNN;Lu;0;L;;;;;N;;;;01BF;
+01F8;LATIN CAPITAL LETTER N WITH GRAVE;Lu;0;L;004E 0300;;;;N;;;;01F9;
+01F9;LATIN SMALL LETTER N WITH GRAVE;Ll;0;L;006E 0300;;;;N;;;01F8;;01F8
+01FA;LATIN CAPITAL LETTER A WITH RING ABOVE AND ACUTE;Lu;0;L;00C5 0301;;;;N;;;;01FB;
+01FB;LATIN SMALL LETTER A WITH RING ABOVE AND ACUTE;Ll;0;L;00E5 0301;;;;N;;;01FA;;01FA
+01FC;LATIN CAPITAL LETTER AE WITH ACUTE;Lu;0;L;00C6 0301;;;;N;;;;01FD;
+01FD;LATIN SMALL LETTER AE WITH ACUTE;Ll;0;L;00E6 0301;;;;N;;;01FC;;01FC
+01FE;LATIN CAPITAL LETTER O WITH STROKE AND ACUTE;Lu;0;L;00D8 0301;;;;N;;;;01FF;
+01FF;LATIN SMALL LETTER O WITH STROKE AND ACUTE;Ll;0;L;00F8 0301;;;;N;;;01FE;;01FE
+0200;LATIN CAPITAL LETTER A WITH DOUBLE GRAVE;Lu;0;L;0041 030F;;;;N;;;;0201;
+0201;LATIN SMALL LETTER A WITH DOUBLE GRAVE;Ll;0;L;0061 030F;;;;N;;;0200;;0200
+0202;LATIN CAPITAL LETTER A WITH INVERTED BREVE;Lu;0;L;0041 0311;;;;N;;;;0203;
+0203;LATIN SMALL LETTER A WITH INVERTED BREVE;Ll;0;L;0061 0311;;;;N;;;0202;;0202
+0204;LATIN CAPITAL LETTER E WITH DOUBLE GRAVE;Lu;0;L;0045 030F;;;;N;;;;0205;
+0205;LATIN SMALL LETTER E WITH DOUBLE GRAVE;Ll;0;L;0065 030F;;;;N;;;0204;;0204
+0206;LATIN CAPITAL LETTER E WITH INVERTED BREVE;Lu;0;L;0045 0311;;;;N;;;;0207;
+0207;LATIN SMALL LETTER E WITH INVERTED BREVE;Ll;0;L;0065 0311;;;;N;;;0206;;0206
+0208;LATIN CAPITAL LETTER I WITH DOUBLE GRAVE;Lu;0;L;0049 030F;;;;N;;;;0209;
+0209;LATIN SMALL LETTER I WITH DOUBLE GRAVE;Ll;0;L;0069 030F;;;;N;;;0208;;0208
+020A;LATIN CAPITAL LETTER I WITH INVERTED BREVE;Lu;0;L;0049 0311;;;;N;;;;020B;
+020B;LATIN SMALL LETTER I WITH INVERTED BREVE;Ll;0;L;0069 0311;;;;N;;;020A;;020A
+020C;LATIN CAPITAL LETTER O WITH DOUBLE GRAVE;Lu;0;L;004F 030F;;;;N;;;;020D;
+020D;LATIN SMALL LETTER O WITH DOUBLE GRAVE;Ll;0;L;006F 030F;;;;N;;;020C;;020C
+020E;LATIN CAPITAL LETTER O WITH INVERTED BREVE;Lu;0;L;004F 0311;;;;N;;;;020F;
+020F;LATIN SMALL LETTER O WITH INVERTED BREVE;Ll;0;L;006F 0311;;;;N;;;020E;;020E
+0210;LATIN CAPITAL LETTER R WITH DOUBLE GRAVE;Lu;0;L;0052 030F;;;;N;;;;0211;
+0211;LATIN SMALL LETTER R WITH DOUBLE GRAVE;Ll;0;L;0072 030F;;;;N;;;0210;;0210
+0212;LATIN CAPITAL LETTER R WITH INVERTED BREVE;Lu;0;L;0052 0311;;;;N;;;;0213;
+0213;LATIN SMALL LETTER R WITH INVERTED BREVE;Ll;0;L;0072 0311;;;;N;;;0212;;0212
+0214;LATIN CAPITAL LETTER U WITH DOUBLE GRAVE;Lu;0;L;0055 030F;;;;N;;;;0215;
+0215;LATIN SMALL LETTER U WITH DOUBLE GRAVE;Ll;0;L;0075 030F;;;;N;;;0214;;0214
+0216;LATIN CAPITAL LETTER U WITH INVERTED BREVE;Lu;0;L;0055 0311;;;;N;;;;0217;
+0217;LATIN SMALL LETTER U WITH INVERTED BREVE;Ll;0;L;0075 0311;;;;N;;;0216;;0216
+0218;LATIN CAPITAL LETTER S WITH COMMA BELOW;Lu;0;L;0053 0326;;;;N;;;;0219;
+0219;LATIN SMALL LETTER S WITH COMMA BELOW;Ll;0;L;0073 0326;;;;N;;;0218;;0218
+021A;LATIN CAPITAL LETTER T WITH COMMA BELOW;Lu;0;L;0054 0326;;;;N;;;;021B;
+021B;LATIN SMALL LETTER T WITH COMMA BELOW;Ll;0;L;0074 0326;;;;N;;;021A;;021A
+021C;LATIN CAPITAL LETTER YOGH;Lu;0;L;;;;;N;;;;021D;
+021D;LATIN SMALL LETTER YOGH;Ll;0;L;;;;;N;;;021C;;021C
+021E;LATIN CAPITAL LETTER H WITH CARON;Lu;0;L;0048 030C;;;;N;;;;021F;
+021F;LATIN SMALL LETTER H WITH CARON;Ll;0;L;0068 030C;;;;N;;;021E;;021E
+0220;LATIN CAPITAL LETTER N WITH LONG RIGHT LEG;Lu;0;L;;;;;N;;;;019E;
+0221;LATIN SMALL LETTER D WITH CURL;Ll;0;L;;;;;N;;;;;
+0222;LATIN CAPITAL LETTER OU;Lu;0;L;;;;;N;;;;0223;
+0223;LATIN SMALL LETTER OU;Ll;0;L;;;;;N;;;0222;;0222
+0224;LATIN CAPITAL LETTER Z WITH HOOK;Lu;0;L;;;;;N;;;;0225;
+0225;LATIN SMALL LETTER Z WITH HOOK;Ll;0;L;;;;;N;;;0224;;0224
+0226;LATIN CAPITAL LETTER A WITH DOT ABOVE;Lu;0;L;0041 0307;;;;N;;;;0227;
+0227;LATIN SMALL LETTER A WITH DOT ABOVE;Ll;0;L;0061 0307;;;;N;;;0226;;0226
+0228;LATIN CAPITAL LETTER E WITH CEDILLA;Lu;0;L;0045 0327;;;;N;;;;0229;
+0229;LATIN SMALL LETTER E WITH CEDILLA;Ll;0;L;0065 0327;;;;N;;;0228;;0228
+022A;LATIN CAPITAL LETTER O WITH DIAERESIS AND MACRON;Lu;0;L;00D6 0304;;;;N;;;;022B;
+022B;LATIN SMALL LETTER O WITH DIAERESIS AND MACRON;Ll;0;L;00F6 0304;;;;N;;;022A;;022A
+022C;LATIN CAPITAL LETTER O WITH TILDE AND MACRON;Lu;0;L;00D5 0304;;;;N;;;;022D;
+022D;LATIN SMALL LETTER O WITH TILDE AND MACRON;Ll;0;L;00F5 0304;;;;N;;;022C;;022C
+022E;LATIN CAPITAL LETTER O WITH DOT ABOVE;Lu;0;L;004F 0307;;;;N;;;;022F;
+022F;LATIN SMALL LETTER O WITH DOT ABOVE;Ll;0;L;006F 0307;;;;N;;;022E;;022E
+0230;LATIN CAPITAL LETTER O WITH DOT ABOVE AND MACRON;Lu;0;L;022E 0304;;;;N;;;;0231;
+0231;LATIN SMALL LETTER O WITH DOT ABOVE AND MACRON;Ll;0;L;022F 0304;;;;N;;;0230;;0230
+0232;LATIN CAPITAL LETTER Y WITH MACRON;Lu;0;L;0059 0304;;;;N;;;;0233;
+0233;LATIN SMALL LETTER Y WITH MACRON;Ll;0;L;0079 0304;;;;N;;;0232;;0232
+0234;LATIN SMALL LETTER L WITH CURL;Ll;0;L;;;;;N;;;;;
+0235;LATIN SMALL LETTER N WITH CURL;Ll;0;L;;;;;N;;;;;
+0236;LATIN SMALL LETTER T WITH CURL;Ll;0;L;;;;;N;;;;;
+0237;LATIN SMALL LETTER DOTLESS J;Ll;0;L;;;;;N;;;;;
+0238;LATIN SMALL LETTER DB DIGRAPH;Ll;0;L;;;;;N;;;;;
+0239;LATIN SMALL LETTER QP DIGRAPH;Ll;0;L;;;;;N;;;;;
+023A;LATIN CAPITAL LETTER A WITH STROKE;Lu;0;L;;;;;N;;;;2C65;
+023B;LATIN CAPITAL LETTER C WITH STROKE;Lu;0;L;;;;;N;;;;023C;
+023C;LATIN SMALL LETTER C WITH STROKE;Ll;0;L;;;;;N;;;023B;;023B
+023D;LATIN CAPITAL LETTER L WITH BAR;Lu;0;L;;;;;N;;;;019A;
+023E;LATIN CAPITAL LETTER T WITH DIAGONAL STROKE;Lu;0;L;;;;;N;;;;2C66;
+023F;LATIN SMALL LETTER S WITH SWASH TAIL;Ll;0;L;;;;;N;;;2C7E;;2C7E
+0240;LATIN SMALL LETTER Z WITH SWASH TAIL;Ll;0;L;;;;;N;;;2C7F;;2C7F
+0241;LATIN CAPITAL LETTER GLOTTAL STOP;Lu;0;L;;;;;N;;;;0242;
+0242;LATIN SMALL LETTER GLOTTAL STOP;Ll;0;L;;;;;N;;;0241;;0241
+0243;LATIN CAPITAL LETTER B WITH STROKE;Lu;0;L;;;;;N;;;;0180;
+0244;LATIN CAPITAL LETTER U BAR;Lu;0;L;;;;;N;;;;0289;
+0245;LATIN CAPITAL LETTER TURNED V;Lu;0;L;;;;;N;;;;028C;
+0246;LATIN CAPITAL LETTER E WITH STROKE;Lu;0;L;;;;;N;;;;0247;
+0247;LATIN SMALL LETTER E WITH STROKE;Ll;0;L;;;;;N;;;0246;;0246
+0248;LATIN CAPITAL LETTER J WITH STROKE;Lu;0;L;;;;;N;;;;0249;
+0249;LATIN SMALL LETTER J WITH STROKE;Ll;0;L;;;;;N;;;0248;;0248
+024A;LATIN CAPITAL LETTER SMALL Q WITH HOOK TAIL;Lu;0;L;;;;;N;;;;024B;
+024B;LATIN SMALL LETTER Q WITH HOOK TAIL;Ll;0;L;;;;;N;;;024A;;024A
+024C;LATIN CAPITAL LETTER R WITH STROKE;Lu;0;L;;;;;N;;;;024D;
+024D;LATIN SMALL LETTER R WITH STROKE;Ll;0;L;;;;;N;;;024C;;024C
+024E;LATIN CAPITAL LETTER Y WITH STROKE;Lu;0;L;;;;;N;;;;024F;
+024F;LATIN SMALL LETTER Y WITH STROKE;Ll;0;L;;;;;N;;;024E;;024E
+0250;LATIN SMALL LETTER TURNED A;Ll;0;L;;;;;N;;;2C6F;;2C6F
+0251;LATIN SMALL LETTER ALPHA;Ll;0;L;;;;;N;LATIN SMALL LETTER SCRIPT A;;2C6D;;2C6D
+0252;LATIN SMALL LETTER TURNED ALPHA;Ll;0;L;;;;;N;LATIN SMALL LETTER TURNED SCRIPT A;;2C70;;2C70
+0253;LATIN SMALL LETTER B WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER B HOOK;;0181;;0181
+0254;LATIN SMALL LETTER OPEN O;Ll;0;L;;;;;N;;;0186;;0186
+0255;LATIN SMALL LETTER C WITH CURL;Ll;0;L;;;;;N;LATIN SMALL LETTER C CURL;;;;
+0256;LATIN SMALL LETTER D WITH TAIL;Ll;0;L;;;;;N;LATIN SMALL LETTER D RETROFLEX HOOK;;0189;;0189
+0257;LATIN SMALL LETTER D WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER D HOOK;;018A;;018A
+0258;LATIN SMALL LETTER REVERSED E;Ll;0;L;;;;;N;;;;;
+0259;LATIN SMALL LETTER SCHWA;Ll;0;L;;;;;N;;;018F;;018F
+025A;LATIN SMALL LETTER SCHWA WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER SCHWA HOOK;;;;
+025B;LATIN SMALL LETTER OPEN E;Ll;0;L;;;;;N;LATIN SMALL LETTER EPSILON;;0190;;0190
+025C;LATIN SMALL LETTER REVERSED OPEN E;Ll;0;L;;;;;N;LATIN SMALL LETTER REVERSED EPSILON;;A7AB;;A7AB
+025D;LATIN SMALL LETTER REVERSED OPEN E WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER REVERSED EPSILON HOOK;;;;
+025E;LATIN SMALL LETTER CLOSED REVERSED OPEN E;Ll;0;L;;;;;N;LATIN SMALL LETTER CLOSED REVERSED EPSILON;;;;
+025F;LATIN SMALL LETTER DOTLESS J WITH STROKE;Ll;0;L;;;;;N;LATIN SMALL LETTER DOTLESS J BAR;;;;
+0260;LATIN SMALL LETTER G WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER G HOOK;;0193;;0193
+0261;LATIN SMALL LETTER SCRIPT G;Ll;0;L;;;;;N;;;A7AC;;A7AC
+0262;LATIN LETTER SMALL CAPITAL G;Ll;0;L;;;;;N;;;;;
+0263;LATIN SMALL LETTER GAMMA;Ll;0;L;;;;;N;;;0194;;0194
+0264;LATIN SMALL LETTER RAMS HORN;Ll;0;L;;;;;N;LATIN SMALL LETTER BABY GAMMA;;;;
+0265;LATIN SMALL LETTER TURNED H;Ll;0;L;;;;;N;;;A78D;;A78D
+0266;LATIN SMALL LETTER H WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER H HOOK;;A7AA;;A7AA
+0267;LATIN SMALL LETTER HENG WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER HENG HOOK;;;;
+0268;LATIN SMALL LETTER I WITH STROKE;Ll;0;L;;;;;N;LATIN SMALL LETTER BARRED I;;0197;;0197
+0269;LATIN SMALL LETTER IOTA;Ll;0;L;;;;;N;;;0196;;0196
+026A;LATIN LETTER SMALL CAPITAL I;Ll;0;L;;;;;N;;;A7AE;;A7AE
+026B;LATIN SMALL LETTER L WITH MIDDLE TILDE;Ll;0;L;;;;;N;;;2C62;;2C62
+026C;LATIN SMALL LETTER L WITH BELT;Ll;0;L;;;;;N;LATIN SMALL LETTER L BELT;;A7AD;;A7AD
+026D;LATIN SMALL LETTER L WITH RETROFLEX HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER L RETROFLEX HOOK;;;;
+026E;LATIN SMALL LETTER LEZH;Ll;0;L;;;;;N;LATIN SMALL LETTER L YOGH;;;;
+026F;LATIN SMALL LETTER TURNED M;Ll;0;L;;;;;N;;;019C;;019C
+0270;LATIN SMALL LETTER TURNED M WITH LONG LEG;Ll;0;L;;;;;N;;;;;
+0271;LATIN SMALL LETTER M WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER M HOOK;;2C6E;;2C6E
+0272;LATIN SMALL LETTER N WITH LEFT HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER N HOOK;;019D;;019D
+0273;LATIN SMALL LETTER N WITH RETROFLEX HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER N RETROFLEX HOOK;;;;
+0274;LATIN LETTER SMALL CAPITAL N;Ll;0;L;;;;;N;;;;;
+0275;LATIN SMALL LETTER BARRED O;Ll;0;L;;;;;N;;;019F;;019F
+0276;LATIN LETTER SMALL CAPITAL OE;Ll;0;L;;;;;N;LATIN LETTER SMALL CAPITAL O E;;;;
+0277;LATIN SMALL LETTER CLOSED OMEGA;Ll;0;L;;;;;N;;;;;
+0278;LATIN SMALL LETTER PHI;Ll;0;L;;;;;N;;;;;
+0279;LATIN SMALL LETTER TURNED R;Ll;0;L;;;;;N;;;;;
+027A;LATIN SMALL LETTER TURNED R WITH LONG LEG;Ll;0;L;;;;;N;;;;;
+027B;LATIN SMALL LETTER TURNED R WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER TURNED R HOOK;;;;
+027C;LATIN SMALL LETTER R WITH LONG LEG;Ll;0;L;;;;;N;;;;;
+027D;LATIN SMALL LETTER R WITH TAIL;Ll;0;L;;;;;N;LATIN SMALL LETTER R HOOK;;2C64;;2C64
+027E;LATIN SMALL LETTER R WITH FISHHOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER FISHHOOK R;;;;
+027F;LATIN SMALL LETTER REVERSED R WITH FISHHOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER REVERSED FISHHOOK R;;;;
+0280;LATIN LETTER SMALL CAPITAL R;Ll;0;L;;;;;N;;;01A6;;01A6
+0281;LATIN LETTER SMALL CAPITAL INVERTED R;Ll;0;L;;;;;N;;;;;
+0282;LATIN SMALL LETTER S WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER S HOOK;;;;
+0283;LATIN SMALL LETTER ESH;Ll;0;L;;;;;N;;;01A9;;01A9
+0284;LATIN SMALL LETTER DOTLESS J WITH STROKE AND HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER DOTLESS J BAR HOOK;;;;
+0285;LATIN SMALL LETTER SQUAT REVERSED ESH;Ll;0;L;;;;;N;;;;;
+0286;LATIN SMALL LETTER ESH WITH CURL;Ll;0;L;;;;;N;LATIN SMALL LETTER ESH CURL;;;;
+0287;LATIN SMALL LETTER TURNED T;Ll;0;L;;;;;N;;;A7B1;;A7B1
+0288;LATIN SMALL LETTER T WITH RETROFLEX HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER T RETROFLEX HOOK;;01AE;;01AE
+0289;LATIN SMALL LETTER U BAR;Ll;0;L;;;;;N;;;0244;;0244
+028A;LATIN SMALL LETTER UPSILON;Ll;0;L;;;;;N;;;01B1;;01B1
+028B;LATIN SMALL LETTER V WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER SCRIPT V;;01B2;;01B2
+028C;LATIN SMALL LETTER TURNED V;Ll;0;L;;;;;N;;;0245;;0245
+028D;LATIN SMALL LETTER TURNED W;Ll;0;L;;;;;N;;;;;
+028E;LATIN SMALL LETTER TURNED Y;Ll;0;L;;;;;N;;;;;
+028F;LATIN LETTER SMALL CAPITAL Y;Ll;0;L;;;;;N;;;;;
+0290;LATIN SMALL LETTER Z WITH RETROFLEX HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER Z RETROFLEX HOOK;;;;
+0291;LATIN SMALL LETTER Z WITH CURL;Ll;0;L;;;;;N;LATIN SMALL LETTER Z CURL;;;;
+0292;LATIN SMALL LETTER EZH;Ll;0;L;;;;;N;LATIN SMALL LETTER YOGH;;01B7;;01B7
+0293;LATIN SMALL LETTER EZH WITH CURL;Ll;0;L;;;;;N;LATIN SMALL LETTER YOGH CURL;;;;
+0294;LATIN LETTER GLOTTAL STOP;Lo;0;L;;;;;N;;;;;
+0295;LATIN LETTER PHARYNGEAL VOICED FRICATIVE;Ll;0;L;;;;;N;LATIN LETTER REVERSED GLOTTAL STOP;;;;
+0296;LATIN LETTER INVERTED GLOTTAL STOP;Ll;0;L;;;;;N;;;;;
+0297;LATIN LETTER STRETCHED C;Ll;0;L;;;;;N;;;;;
+0298;LATIN LETTER BILABIAL CLICK;Ll;0;L;;;;;N;LATIN LETTER BULLSEYE;;;;
+0299;LATIN LETTER SMALL CAPITAL B;Ll;0;L;;;;;N;;;;;
+029A;LATIN SMALL LETTER CLOSED OPEN E;Ll;0;L;;;;;N;LATIN SMALL LETTER CLOSED EPSILON;;;;
+029B;LATIN LETTER SMALL CAPITAL G WITH HOOK;Ll;0;L;;;;;N;LATIN LETTER SMALL CAPITAL G HOOK;;;;
+029C;LATIN LETTER SMALL CAPITAL H;Ll;0;L;;;;;N;;;;;
+029D;LATIN SMALL LETTER J WITH CROSSED-TAIL;Ll;0;L;;;;;N;LATIN SMALL LETTER CROSSED-TAIL J;;A7B2;;A7B2
+029E;LATIN SMALL LETTER TURNED K;Ll;0;L;;;;;N;;;A7B0;;A7B0
+029F;LATIN LETTER SMALL CAPITAL L;Ll;0;L;;;;;N;;;;;
+02A0;LATIN SMALL LETTER Q WITH HOOK;Ll;0;L;;;;;N;LATIN SMALL LETTER Q HOOK;;;;
+02A1;LATIN LETTER GLOTTAL STOP WITH STROKE;Ll;0;L;;;;;N;LATIN LETTER GLOTTAL STOP BAR;;;;
+02A2;LATIN LETTER REVERSED GLOTTAL STOP WITH STROKE;Ll;0;L;;;;;N;LATIN LETTER REVERSED GLOTTAL STOP BAR;;;;
+02A3;LATIN SMALL LETTER DZ DIGRAPH;Ll;0;L;;;;;N;LATIN SMALL LETTER D Z;;;;
+02A4;LATIN SMALL LETTER DEZH DIGRAPH;Ll;0;L;;;;;N;LATIN SMALL LETTER D YOGH;;;;
+02A5;LATIN SMALL LETTER DZ DIGRAPH WITH CURL;Ll;0;L;;;;;N;LATIN SMALL LETTER D Z CURL;;;;
+02A6;LATIN SMALL LETTER TS DIGRAPH;Ll;0;L;;;;;N;LATIN SMALL LETTER T S;;;;
+02A7;LATIN SMALL LETTER TESH DIGRAPH;Ll;0;L;;;;;N;LATIN SMALL LETTER T ESH;;;;
+02A8;LATIN SMALL LETTER TC DIGRAPH WITH CURL;Ll;0;L;;;;;N;LATIN SMALL LETTER T C CURL;;;;
+02A9;LATIN SMALL LETTER FENG DIGRAPH;Ll;0;L;;;;;N;;;;;
+02AA;LATIN SMALL LETTER LS DIGRAPH;Ll;0;L;;;;;N;;;;;
+02AB;LATIN SMALL LETTER LZ DIGRAPH;Ll;0;L;;;;;N;;;;;
+02AC;LATIN LETTER BILABIAL PERCUSSIVE;Ll;0;L;;;;;N;;;;;
+02AD;LATIN LETTER BIDENTAL PERCUSSIVE;Ll;0;L;;;;;N;;;;;
+02AE;LATIN SMALL LETTER TURNED H WITH FISHHOOK;Ll;0;L;;;;;N;;;;;
+02AF;LATIN SMALL LETTER TURNED H WITH FISHHOOK AND TAIL;Ll;0;L;;;;;N;;;;;
+02B0;MODIFIER LETTER SMALL H;Lm;0;L;<super> 0068;;;;N;;;;;
+02B1;MODIFIER LETTER SMALL H WITH HOOK;Lm;0;L;<super> 0266;;;;N;MODIFIER LETTER SMALL H HOOK;;;;
+02B2;MODIFIER LETTER SMALL J;Lm;0;L;<super> 006A;;;;N;;;;;
+02B3;MODIFIER LETTER SMALL R;Lm;0;L;<super> 0072;;;;N;;;;;
+02B4;MODIFIER LETTER SMALL TURNED R;Lm;0;L;<super> 0279;;;;N;;;;;
+02B5;MODIFIER LETTER SMALL TURNED R WITH HOOK;Lm;0;L;<super> 027B;;;;N;MODIFIER LETTER SMALL TURNED R HOOK;;;;
+02B6;MODIFIER LETTER SMALL CAPITAL INVERTED R;Lm;0;L;<super> 0281;;;;N;;;;;
+02B7;MODIFIER LETTER SMALL W;Lm;0;L;<super> 0077;;;;N;;;;;
+02B8;MODIFIER LETTER SMALL Y;Lm;0;L;<super> 0079;;;;N;;;;;
+02B9;MODIFIER LETTER PRIME;Lm;0;ON;;;;;N;;;;;
+02BA;MODIFIER LETTER DOUBLE PRIME;Lm;0;ON;;;;;N;;;;;
+02BB;MODIFIER LETTER TURNED COMMA;Lm;0;L;;;;;N;;;;;
+02BC;MODIFIER LETTER APOSTROPHE;Lm;0;L;;;;;N;;;;;
+02BD;MODIFIER LETTER REVERSED COMMA;Lm;0;L;;;;;N;;;;;
+02BE;MODIFIER LETTER RIGHT HALF RING;Lm;0;L;;;;;N;;;;;
+02BF;MODIFIER LETTER LEFT HALF RING;Lm;0;L;;;;;N;;;;;
+02C0;MODIFIER LETTER GLOTTAL STOP;Lm;0;L;;;;;N;;;;;
+02C1;MODIFIER LETTER REVERSED GLOTTAL STOP;Lm;0;L;;;;;N;;;;;
+02C2;MODIFIER LETTER LEFT ARROWHEAD;Sk;0;ON;;;;;N;;;;;
+02C3;MODIFIER LETTER RIGHT ARROWHEAD;Sk;0;ON;;;;;N;;;;;
+02C4;MODIFIER LETTER UP ARROWHEAD;Sk;0;ON;;;;;N;;;;;
+02C5;MODIFIER LETTER DOWN ARROWHEAD;Sk;0;ON;;;;;N;;;;;
+02C6;MODIFIER LETTER CIRCUMFLEX ACCENT;Lm;0;ON;;;;;N;MODIFIER LETTER CIRCUMFLEX;;;;
+02C7;CARON;Lm;0;ON;;;;;N;MODIFIER LETTER HACEK;;;;
+02C8;MODIFIER LETTER VERTICAL LINE;Lm;0;ON;;;;;N;;;;;
+02C9;MODIFIER LETTER MACRON;Lm;0;ON;;;;;N;;;;;
+02CA;MODIFIER LETTER ACUTE ACCENT;Lm;0;ON;;;;;N;MODIFIER LETTER ACUTE;;;;
+02CB;MODIFIER LETTER GRAVE ACCENT;Lm;0;ON;;;;;N;MODIFIER LETTER GRAVE;;;;
+02CC;MODIFIER LETTER LOW VERTICAL LINE;Lm;0;ON;;;;;N;;;;;
+02CD;MODIFIER LETTER LOW MACRON;Lm;0;ON;;;;;N;;;;;
+02CE;MODIFIER LETTER LOW GRAVE ACCENT;Lm;0;ON;;;;;N;MODIFIER LETTER LOW GRAVE;;;;
+02CF;MODIFIER LETTER LOW ACUTE ACCENT;Lm;0;ON;;;;;N;MODIFIER LETTER LOW ACUTE;;;;
+02D0;MODIFIER LETTER TRIANGULAR COLON;Lm;0;L;;;;;N;;;;;
+02D1;MODIFIER LETTER HALF TRIANGULAR COLON;Lm;0;L;;;;;N;;;;;
+02D2;MODIFIER LETTER CENTRED RIGHT HALF RING;Sk;0;ON;;;;;N;MODIFIER LETTER CENTERED RIGHT HALF RING;;;;
+02D3;MODIFIER LETTER CENTRED LEFT HALF RING;Sk;0;ON;;;;;N;MODIFIER LETTER CENTERED LEFT HALF RING;;;;
+02D4;MODIFIER LETTER UP TACK;Sk;0;ON;;;;;N;;;;;
+02D5;MODIFIER LETTER DOWN TACK;Sk;0;ON;;;;;N;;;;;
+02D6;MODIFIER LETTER PLUS SIGN;Sk;0;ON;;;;;N;;;;;
+02D7;MODIFIER LETTER MINUS SIGN;Sk;0;ON;;;;;N;;;;;
+02D8;BREVE;Sk;0;ON;<compat> 0020 0306;;;;N;SPACING BREVE;;;;
+02D9;DOT ABOVE;Sk;0;ON;<compat> 0020 0307;;;;N;SPACING DOT ABOVE;;;;
+02DA;RING ABOVE;Sk;0;ON;<compat> 0020 030A;;;;N;SPACING RING ABOVE;;;;
+02DB;OGONEK;Sk;0;ON;<compat> 0020 0328;;;;N;SPACING OGONEK;;;;
+02DC;SMALL TILDE;Sk;0;ON;<compat> 0020 0303;;;;N;SPACING TILDE;;;;
+02DD;DOUBLE ACUTE ACCENT;Sk;0;ON;<compat> 0020 030B;;;;N;SPACING DOUBLE ACUTE;;;;
+02DE;MODIFIER LETTER RHOTIC HOOK;Sk;0;ON;;;;;N;;;;;
+02DF;MODIFIER LETTER CROSS ACCENT;Sk;0;ON;;;;;N;;;;;
+02E0;MODIFIER LETTER SMALL GAMMA;Lm;0;L;<super> 0263;;;;N;;;;;
+02E1;MODIFIER LETTER SMALL L;Lm;0;L;<super> 006C;;;;N;;;;;
+02E2;MODIFIER LETTER SMALL S;Lm;0;L;<super> 0073;;;;N;;;;;
+02E3;MODIFIER LETTER SMALL X;Lm;0;L;<super> 0078;;;;N;;;;;
+02E4;MODIFIER LETTER SMALL REVERSED GLOTTAL STOP;Lm;0;L;<super> 0295;;;;N;;;;;
+02E5;MODIFIER LETTER EXTRA-HIGH TONE BAR;Sk;0;ON;;;;;N;;;;;
+02E6;MODIFIER LETTER HIGH TONE BAR;Sk;0;ON;;;;;N;;;;;
+02E7;MODIFIER LETTER MID TONE BAR;Sk;0;ON;;;;;N;;;;;
+02E8;MODIFIER LETTER LOW TONE BAR;Sk;0;ON;;;;;N;;;;;
+02E9;MODIFIER LETTER EXTRA-LOW TONE BAR;Sk;0;ON;;;;;N;;;;;
+02EA;MODIFIER LETTER YIN DEPARTING TONE MARK;Sk;0;ON;;;;;N;;;;;
+02EB;MODIFIER LETTER YANG DEPARTING TONE MARK;Sk;0;ON;;;;;N;;;;;
+02EC;MODIFIER LETTER VOICING;Lm;0;ON;;;;;N;;;;;
+02ED;MODIFIER LETTER UNASPIRATED;Sk;0;ON;;;;;N;;;;;
+02EE;MODIFIER LETTER DOUBLE APOSTROPHE;Lm;0;L;;;;;N;;;;;
+02EF;MODIFIER LETTER LOW DOWN ARROWHEAD;Sk;0;ON;;;;;N;;;;;
+02F0;MODIFIER LETTER LOW UP ARROWHEAD;Sk;0;ON;;;;;N;;;;;
+02F1;MODIFIER LETTER LOW LEFT ARROWHEAD;Sk;0;ON;;;;;N;;;;;
+02F2;MODIFIER LETTER LOW RIGHT ARROWHEAD;Sk;0;ON;;;;;N;;;;;
+02F3;MODIFIER LETTER LOW RING;Sk;0;ON;;;;;N;;;;;
+02F4;MODIFIER LETTER MIDDLE GRAVE ACCENT;Sk;0;ON;;;;;N;;;;;
+02F5;MODIFIER LETTER MIDDLE DOUBLE GRAVE ACCENT;Sk;0;ON;;;;;N;;;;;
+02F6;MODIFIER LETTER MIDDLE DOUBLE ACUTE ACCENT;Sk;0;ON;;;;;N;;;;;
+02F7;MODIFIER LETTER LOW TILDE;Sk;0;ON;;;;;N;;;;;
+02F8;MODIFIER LETTER RAISED COLON;Sk;0;ON;;;;;N;;;;;
+02F9;MODIFIER LETTER BEGIN HIGH TONE;Sk;0;ON;;;;;N;;;;;
+02FA;MODIFIER LETTER END HIGH TONE;Sk;0;ON;;;;;N;;;;;
+02FB;MODIFIER LETTER BEGIN LOW TONE;Sk;0;ON;;;;;N;;;;;
+02FC;MODIFIER LETTER END LOW TONE;Sk;0;ON;;;;;N;;;;;
+02FD;MODIFIER LETTER SHELF;Sk;0;ON;;;;;N;;;;;
+02FE;MODIFIER LETTER OPEN SHELF;Sk;0;ON;;;;;N;;;;;
+02FF;MODIFIER LETTER LOW LEFT ARROW;Sk;0;ON;;;;;N;;;;;
+0300;COMBINING GRAVE ACCENT;Mn;230;NSM;;;;;N;NON-SPACING GRAVE;;;;
+0301;COMBINING ACUTE ACCENT;Mn;230;NSM;;;;;N;NON-SPACING ACUTE;;;;
+0302;COMBINING CIRCUMFLEX ACCENT;Mn;230;NSM;;;;;N;NON-SPACING CIRCUMFLEX;;;;
+0303;COMBINING TILDE;Mn;230;NSM;;;;;N;NON-SPACING TILDE;;;;
+0304;COMBINING MACRON;Mn;230;NSM;;;;;N;NON-SPACING MACRON;;;;
+0305;COMBINING OVERLINE;Mn;230;NSM;;;;;N;NON-SPACING OVERSCORE;;;;
+0306;COMBINING BREVE;Mn;230;NSM;;;;;N;NON-SPACING BREVE;;;;
+0307;COMBINING DOT ABOVE;Mn;230;NSM;;;;;N;NON-SPACING DOT ABOVE;;;;
+0308;COMBINING DIAERESIS;Mn;230;NSM;;;;;N;NON-SPACING DIAERESIS;;;;
+0309;COMBINING HOOK ABOVE;Mn;230;NSM;;;;;N;NON-SPACING HOOK ABOVE;;;;
+030A;COMBINING RING ABOVE;Mn;230;NSM;;;;;N;NON-SPACING RING ABOVE;;;;
+030B;COMBINING DOUBLE ACUTE ACCENT;Mn;230;NSM;;;;;N;NON-SPACING DOUBLE ACUTE;;;;
+030C;COMBINING CARON;Mn;230;NSM;;;;;N;NON-SPACING HACEK;;;;
+030D;COMBINING VERTICAL LINE ABOVE;Mn;230;NSM;;;;;N;NON-SPACING VERTICAL LINE ABOVE;;;;
+030E;COMBINING DOUBLE VERTICAL LINE ABOVE;Mn;230;NSM;;;;;N;NON-SPACING DOUBLE VERTICAL LINE ABOVE;;;;
+030F;COMBINING DOUBLE GRAVE ACCENT;Mn;230;NSM;;;;;N;NON-SPACING DOUBLE GRAVE;;;;
+0310;COMBINING CANDRABINDU;Mn;230;NSM;;;;;N;NON-SPACING CANDRABINDU;;;;
+0311;COMBINING INVERTED BREVE;Mn;230;NSM;;;;;N;NON-SPACING INVERTED BREVE;;;;
+0312;COMBINING TURNED COMMA ABOVE;Mn;230;NSM;;;;;N;NON-SPACING TURNED COMMA ABOVE;;;;
+0313;COMBINING COMMA ABOVE;Mn;230;NSM;;;;;N;NON-SPACING COMMA ABOVE;;;;
+0314;COMBINING REVERSED COMMA ABOVE;Mn;230;NSM;;;;;N;NON-SPACING REVERSED COMMA ABOVE;;;;
+0315;COMBINING COMMA ABOVE RIGHT;Mn;232;NSM;;;;;N;NON-SPACING COMMA ABOVE RIGHT;;;;
+0316;COMBINING GRAVE ACCENT BELOW;Mn;220;NSM;;;;;N;NON-SPACING GRAVE BELOW;;;;
+0317;COMBINING ACUTE ACCENT BELOW;Mn;220;NSM;;;;;N;NON-SPACING ACUTE BELOW;;;;
+0318;COMBINING LEFT TACK BELOW;Mn;220;NSM;;;;;N;NON-SPACING LEFT TACK BELOW;;;;
+0319;COMBINING RIGHT TACK BELOW;Mn;220;NSM;;;;;N;NON-SPACING RIGHT TACK BELOW;;;;
+031A;COMBINING LEFT ANGLE ABOVE;Mn;232;NSM;;;;;N;NON-SPACING LEFT ANGLE ABOVE;;;;
+031B;COMBINING HORN;Mn;216;NSM;;;;;N;NON-SPACING HORN;;;;
+031C;COMBINING LEFT HALF RING BELOW;Mn;220;NSM;;;;;N;NON-SPACING LEFT HALF RING BELOW;;;;
+031D;COMBINING UP TACK BELOW;Mn;220;NSM;;;;;N;NON-SPACING UP TACK BELOW;;;;
+031E;COMBINING DOWN TACK BELOW;Mn;220;NSM;;;;;N;NON-SPACING DOWN TACK BELOW;;;;
+031F;COMBINING PLUS SIGN BELOW;Mn;220;NSM;;;;;N;NON-SPACING PLUS SIGN BELOW;;;;
+0320;COMBINING MINUS SIGN BELOW;Mn;220;NSM;;;;;N;NON-SPACING MINUS SIGN BELOW;;;;
+0321;COMBINING PALATALIZED HOOK BELOW;Mn;202;NSM;;;;;N;NON-SPACING PALATALIZED HOOK BELOW;;;;
+0322;COMBINING RETROFLEX HOOK BELOW;Mn;202;NSM;;;;;N;NON-SPACING RETROFLEX HOOK BELOW;;;;
+0323;COMBINING DOT BELOW;Mn;220;NSM;;;;;N;NON-SPACING DOT BELOW;;;;
+0324;COMBINING DIAERESIS BELOW;Mn;220;NSM;;;;;N;NON-SPACING DOUBLE DOT BELOW;;;;
+0325;COMBINING RING BELOW;Mn;220;NSM;;;;;N;NON-SPACING RING BELOW;;;;
+0326;COMBINING COMMA BELOW;Mn;220;NSM;;;;;N;NON-SPACING COMMA BELOW;;;;
+0327;COMBINING CEDILLA;Mn;202;NSM;;;;;N;NON-SPACING CEDILLA;;;;
+0328;COMBINING OGONEK;Mn;202;NSM;;;;;N;NON-SPACING OGONEK;;;;
+0329;COMBINING VERTICAL LINE BELOW;Mn;220;NSM;;;;;N;NON-SPACING VERTICAL LINE BELOW;;;;
+032A;COMBINING BRIDGE BELOW;Mn;220;NSM;;;;;N;NON-SPACING BRIDGE BELOW;;;;
+032B;COMBINING INVERTED DOUBLE ARCH BELOW;Mn;220;NSM;;;;;N;NON-SPACING INVERTED DOUBLE ARCH BELOW;;;;
+032C;COMBINING CARON BELOW;Mn;220;NSM;;;;;N;NON-SPACING HACEK BELOW;;;;
+032D;COMBINING CIRCUMFLEX ACCENT BELOW;Mn;220;NSM;;;;;N;NON-SPACING CIRCUMFLEX BELOW;;;;
+032E;COMBINING BREVE BELOW;Mn;220;NSM;;;;;N;NON-SPACING BREVE BELOW;;;;
+032F;COMBINING INVERTED BREVE BELOW;Mn;220;NSM;;;;;N;NON-SPACING INVERTED BREVE BELOW;;;;
+0330;COMBINING TILDE BELOW;Mn;220;NSM;;;;;N;NON-SPACING TILDE BELOW;;;;
+0331;COMBINING MACRON BELOW;Mn;220;NSM;;;;;N;NON-SPACING MACRON BELOW;;;;
+0332;COMBINING LOW LINE;Mn;220;NSM;;;;;N;NON-SPACING UNDERSCORE;;;;
+0333;COMBINING DOUBLE LOW LINE;Mn;220;NSM;;;;;N;NON-SPACING DOUBLE UNDERSCORE;;;;
+0334;COMBINING TILDE OVERLAY;Mn;1;NSM;;;;;N;NON-SPACING TILDE OVERLAY;;;;
+0335;COMBINING SHORT STROKE OVERLAY;Mn;1;NSM;;;;;N;NON-SPACING SHORT BAR OVERLAY;;;;
+0336;COMBINING LONG STROKE OVERLAY;Mn;1;NSM;;;;;N;NON-SPACING LONG BAR OVERLAY;;;;
+0337;COMBINING SHORT SOLIDUS OVERLAY;Mn;1;NSM;;;;;N;NON-SPACING SHORT SLASH OVERLAY;;;;
+0338;COMBINING LONG SOLIDUS OVERLAY;Mn;1;NSM;;;;;N;NON-SPACING LONG SLASH OVERLAY;;;;
+0339;COMBINING RIGHT HALF RING BELOW;Mn;220;NSM;;;;;N;NON-SPACING RIGHT HALF RING BELOW;;;;
+033A;COMBINING INVERTED BRIDGE BELOW;Mn;220;NSM;;;;;N;NON-SPACING INVERTED BRIDGE BELOW;;;;
+033B;COMBINING SQUARE BELOW;Mn;220;NSM;;;;;N;NON-SPACING SQUARE BELOW;;;;
+033C;COMBINING SEAGULL BELOW;Mn;220;NSM;;;;;N;NON-SPACING SEAGULL BELOW;;;;
+033D;COMBINING X ABOVE;Mn;230;NSM;;;;;N;NON-SPACING X ABOVE;;;;
+033E;COMBINING VERTICAL TILDE;Mn;230;NSM;;;;;N;NON-SPACING VERTICAL TILDE;;;;
+033F;COMBINING DOUBLE OVERLINE;Mn;230;NSM;;;;;N;NON-SPACING DOUBLE OVERSCORE;;;;
+0340;COMBINING GRAVE TONE MARK;Mn;230;NSM;0300;;;;N;NON-SPACING GRAVE TONE MARK;;;;
+0341;COMBINING ACUTE TONE MARK;Mn;230;NSM;0301;;;;N;NON-SPACING ACUTE TONE MARK;;;;
+0342;COMBINING GREEK PERISPOMENI;Mn;230;NSM;;;;;N;;;;;
+0343;COMBINING GREEK KORONIS;Mn;230;NSM;0313;;;;N;;;;;
+0344;COMBINING GREEK DIALYTIKA TONOS;Mn;230;NSM;0308 0301;;;;N;GREEK NON-SPACING DIAERESIS TONOS;;;;
+0345;COMBINING GREEK YPOGEGRAMMENI;Mn;240;NSM;;;;;N;GREEK NON-SPACING IOTA BELOW;;0399;;0399
+0346;COMBINING BRIDGE ABOVE;Mn;230;NSM;;;;;N;;;;;
+0347;COMBINING EQUALS SIGN BELOW;Mn;220;NSM;;;;;N;;;;;
+0348;COMBINING DOUBLE VERTICAL LINE BELOW;Mn;220;NSM;;;;;N;;;;;
+0349;COMBINING LEFT ANGLE BELOW;Mn;220;NSM;;;;;N;;;;;
+034A;COMBINING NOT TILDE ABOVE;Mn;230;NSM;;;;;N;;;;;
+034B;COMBINING HOMOTHETIC ABOVE;Mn;230;NSM;;;;;N;;;;;
+034C;COMBINING ALMOST EQUAL TO ABOVE;Mn;230;NSM;;;;;N;;;;;
+034D;COMBINING LEFT RIGHT ARROW BELOW;Mn;220;NSM;;;;;N;;;;;
+034E;COMBINING UPWARDS ARROW BELOW;Mn;220;NSM;;;;;N;;;;;
+034F;COMBINING GRAPHEME JOINER;Mn;0;NSM;;;;;N;;;;;
+0350;COMBINING RIGHT ARROWHEAD ABOVE;Mn;230;NSM;;;;;N;;;;;
+0351;COMBINING LEFT HALF RING ABOVE;Mn;230;NSM;;;;;N;;;;;
+0352;COMBINING FERMATA;Mn;230;NSM;;;;;N;;;;;
+0353;COMBINING X BELOW;Mn;220;NSM;;;;;N;;;;;
+0354;COMBINING LEFT ARROWHEAD BELOW;Mn;220;NSM;;;;;N;;;;;
+0355;COMBINING RIGHT ARROWHEAD BELOW;Mn;220;NSM;;;;;N;;;;;
+0356;COMBINING RIGHT ARROWHEAD AND UP ARROWHEAD BELOW;Mn;220;NSM;;;;;N;;;;;
+0357;COMBINING RIGHT HALF RING ABOVE;Mn;230;NSM;;;;;N;;;;;
+0358;COMBINING DOT ABOVE RIGHT;Mn;232;NSM;;;;;N;;;;;
+0359;COMBINING ASTERISK BELOW;Mn;220;NSM;;;;;N;;;;;
+035A;COMBINING DOUBLE RING BELOW;Mn;220;NSM;;;;;N;;;;;
+035B;COMBINING ZIGZAG ABOVE;Mn;230;NSM;;;;;N;;;;;
+035C;COMBINING DOUBLE BREVE BELOW;Mn;233;NSM;;;;;N;;;;;
+035D;COMBINING DOUBLE BREVE;Mn;234;NSM;;;;;N;;;;;
+035E;COMBINING DOUBLE MACRON;Mn;234;NSM;;;;;N;;;;;
+035F;COMBINING DOUBLE MACRON BELOW;Mn;233;NSM;;;;;N;;;;;
+0360;COMBINING DOUBLE TILDE;Mn;234;NSM;;;;;N;;;;;
+0361;COMBINING DOUBLE INVERTED BREVE;Mn;234;NSM;;;;;N;;;;;
+0362;COMBINING DOUBLE RIGHTWARDS ARROW BELOW;Mn;233;NSM;;;;;N;;;;;
+0363;COMBINING LATIN SMALL LETTER A;Mn;230;NSM;;;;;N;;;;;
+0364;COMBINING LATIN SMALL LETTER E;Mn;230;NSM;;;;;N;;;;;
+0365;COMBINING LATIN SMALL LETTER I;Mn;230;NSM;;;;;N;;;;;
+0366;COMBINING LATIN SMALL LETTER O;Mn;230;NSM;;;;;N;;;;;
+0367;COMBINING LATIN SMALL LETTER U;Mn;230;NSM;;;;;N;;;;;
+0368;COMBINING LATIN SMALL LETTER C;Mn;230;NSM;;;;;N;;;;;
+0369;COMBINING LATIN SMALL LETTER D;Mn;230;NSM;;;;;N;;;;;
+036A;COMBINING LATIN SMALL LETTER H;Mn;230;NSM;;;;;N;;;;;
+036B;COMBINING LATIN SMALL LETTER M;Mn;230;NSM;;;;;N;;;;;
+036C;COMBINING LATIN SMALL LETTER R;Mn;230;NSM;;;;;N;;;;;
+036D;COMBINING LATIN SMALL LETTER T;Mn;230;NSM;;;;;N;;;;;
+036E;COMBINING LATIN SMALL LETTER V;Mn;230;NSM;;;;;N;;;;;
+036F;COMBINING LATIN SMALL LETTER X;Mn;230;NSM;;;;;N;;;;;
+0370;GREEK CAPITAL LETTER HETA;Lu;0;L;;;;;N;;;;0371;
+0371;GREEK SMALL LETTER HETA;Ll;0;L;;;;;N;;;0370;;0370
+0372;GREEK CAPITAL LETTER ARCHAIC SAMPI;Lu;0;L;;;;;N;;;;0373;
+0373;GREEK SMALL LETTER ARCHAIC SAMPI;Ll;0;L;;;;;N;;;0372;;0372
+0374;GREEK NUMERAL SIGN;Lm;0;ON;02B9;;;;N;GREEK UPPER NUMERAL SIGN;;;;
+0375;GREEK LOWER NUMERAL SIGN;Sk;0;ON;;;;;N;;;;;
+0376;GREEK CAPITAL LETTER PAMPHYLIAN DIGAMMA;Lu;0;L;;;;;N;;;;0377;
+0377;GREEK SMALL LETTER PAMPHYLIAN DIGAMMA;Ll;0;L;;;;;N;;;0376;;0376
+037A;GREEK YPOGEGRAMMENI;Lm;0;L;<compat> 0020 0345;;;;N;GREEK SPACING IOTA BELOW;;;;
+037B;GREEK SMALL REVERSED LUNATE SIGMA SYMBOL;Ll;0;L;;;;;N;;;03FD;;03FD
+037C;GREEK SMALL DOTTED LUNATE SIGMA SYMBOL;Ll;0;L;;;;;N;;;03FE;;03FE
+037D;GREEK SMALL REVERSED DOTTED LUNATE SIGMA SYMBOL;Ll;0;L;;;;;N;;;03FF;;03FF
+037E;GREEK QUESTION MARK;Po;0;ON;003B;;;;N;;;;;
+037F;GREEK CAPITAL LETTER YOT;Lu;0;L;;;;;N;;;;03F3;
+0384;GREEK TONOS;Sk;0;ON;<compat> 0020 0301;;;;N;GREEK SPACING TONOS;;;;
+0385;GREEK DIALYTIKA TONOS;Sk;0;ON;00A8 0301;;;;N;GREEK SPACING DIAERESIS TONOS;;;;
+0386;GREEK CAPITAL LETTER ALPHA WITH TONOS;Lu;0;L;0391 0301;;;;N;GREEK CAPITAL LETTER ALPHA TONOS;;;03AC;
+0387;GREEK ANO TELEIA;Po;0;ON;00B7;;;;N;;;;;
+0388;GREEK CAPITAL LETTER EPSILON WITH TONOS;Lu;0;L;0395 0301;;;;N;GREEK CAPITAL LETTER EPSILON TONOS;;;03AD;
+0389;GREEK CAPITAL LETTER ETA WITH TONOS;Lu;0;L;0397 0301;;;;N;GREEK CAPITAL LETTER ETA TONOS;;;03AE;
+038A;GREEK CAPITAL LETTER IOTA WITH TONOS;Lu;0;L;0399 0301;;;;N;GREEK CAPITAL LETTER IOTA TONOS;;;03AF;
+038C;GREEK CAPITAL LETTER OMICRON WITH TONOS;Lu;0;L;039F 0301;;;;N;GREEK CAPITAL LETTER OMICRON TONOS;;;03CC;
+038E;GREEK CAPITAL LETTER UPSILON WITH TONOS;Lu;0;L;03A5 0301;;;;N;GREEK CAPITAL LETTER UPSILON TONOS;;;03CD;
+038F;GREEK CAPITAL LETTER OMEGA WITH TONOS;Lu;0;L;03A9 0301;;;;N;GREEK CAPITAL LETTER OMEGA TONOS;;;03CE;
+0390;GREEK SMALL LETTER IOTA WITH DIALYTIKA AND TONOS;Ll;0;L;03CA 0301;;;;N;GREEK SMALL LETTER IOTA DIAERESIS TONOS;;;;
+0391;GREEK CAPITAL LETTER ALPHA;Lu;0;L;;;;;N;;;;03B1;
+0392;GREEK CAPITAL LETTER BETA;Lu;0;L;;;;;N;;;;03B2;
+0393;GREEK CAPITAL LETTER GAMMA;Lu;0;L;;;;;N;;;;03B3;
+0394;GREEK CAPITAL LETTER DELTA;Lu;0;L;;;;;N;;;;03B4;
+0395;GREEK CAPITAL LETTER EPSILON;Lu;0;L;;;;;N;;;;03B5;
+0396;GREEK CAPITAL LETTER ZETA;Lu;0;L;;;;;N;;;;03B6;
+0397;GREEK CAPITAL LETTER ETA;Lu;0;L;;;;;N;;;;03B7;
+0398;GREEK CAPITAL LETTER THETA;Lu;0;L;;;;;N;;;;03B8;
+0399;GREEK CAPITAL LETTER IOTA;Lu;0;L;;;;;N;;;;03B9;
+039A;GREEK CAPITAL LETTER KAPPA;Lu;0;L;;;;;N;;;;03BA;
+039B;GREEK CAPITAL LETTER LAMDA;Lu;0;L;;;;;N;GREEK CAPITAL LETTER LAMBDA;;;03BB;
+039C;GREEK CAPITAL LETTER MU;Lu;0;L;;;;;N;;;;03BC;
+039D;GREEK CAPITAL LETTER NU;Lu;0;L;;;;;N;;;;03BD;
+039E;GREEK CAPITAL LETTER XI;Lu;0;L;;;;;N;;;;03BE;
+039F;GREEK CAPITAL LETTER OMICRON;Lu;0;L;;;;;N;;;;03BF;
+03A0;GREEK CAPITAL LETTER PI;Lu;0;L;;;;;N;;;;03C0;
+03A1;GREEK CAPITAL LETTER RHO;Lu;0;L;;;;;N;;;;03C1;
+03A3;GREEK CAPITAL LETTER SIGMA;Lu;0;L;;;;;N;;;;03C3;
+03A4;GREEK CAPITAL LETTER TAU;Lu;0;L;;;;;N;;;;03C4;
+03A5;GREEK CAPITAL LETTER UPSILON;Lu;0;L;;;;;N;;;;03C5;
+03A6;GREEK CAPITAL LETTER PHI;Lu;0;L;;;;;N;;;;03C6;
+03A7;GREEK CAPITAL LETTER CHI;Lu;0;L;;;;;N;;;;03C7;
+03A8;GREEK CAPITAL LETTER PSI;Lu;0;L;;;;;N;;;;03C8;
+03A9;GREEK CAPITAL LETTER OMEGA;Lu;0;L;;;;;N;;;;03C9;
+03AA;GREEK CAPITAL LETTER IOTA WITH DIALYTIKA;Lu;0;L;0399 0308;;;;N;GREEK CAPITAL LETTER IOTA DIAERESIS;;;03CA;
+03AB;GREEK CAPITAL LETTER UPSILON WITH DIALYTIKA;Lu;0;L;03A5 0308;;;;N;GREEK CAPITAL LETTER UPSILON DIAERESIS;;;03CB;
+03AC;GREEK SMALL LETTER ALPHA WITH TONOS;Ll;0;L;03B1 0301;;;;N;GREEK SMALL LETTER ALPHA TONOS;;0386;;0386
+03AD;GREEK SMALL LETTER EPSILON WITH TONOS;Ll;0;L;03B5 0301;;;;N;GREEK SMALL LETTER EPSILON TONOS;;0388;;0388
+03AE;GREEK SMALL LETTER ETA WITH TONOS;Ll;0;L;03B7 0301;;;;N;GREEK SMALL LETTER ETA TONOS;;0389;;0389
+03AF;GREEK SMALL LETTER IOTA WITH TONOS;Ll;0;L;03B9 0301;;;;N;GREEK SMALL LETTER IOTA TONOS;;038A;;038A
+03B0;GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND TONOS;Ll;0;L;03CB 0301;;;;N;GREEK SMALL LETTER UPSILON DIAERESIS TONOS;;;;
+03B1;GREEK SMALL LETTER ALPHA;Ll;0;L;;;;;N;;;0391;;0391
+03B2;GREEK SMALL LETTER BETA;Ll;0;L;;;;;N;;;0392;;0392
+03B3;GREEK SMALL LETTER GAMMA;Ll;0;L;;;;;N;;;0393;;0393
+03B4;GREEK SMALL LETTER DELTA;Ll;0;L;;;;;N;;;0394;;0394
+03B5;GREEK SMALL LETTER EPSILON;Ll;0;L;;;;;N;;;0395;;0395
+03B6;GREEK SMALL LETTER ZETA;Ll;0;L;;;;;N;;;0396;;0396
+03B7;GREEK SMALL LETTER ETA;Ll;0;L;;;;;N;;;0397;;0397
+03B8;GREEK SMALL LETTER THETA;Ll;0;L;;;;;N;;;0398;;0398
+03B9;GREEK SMALL LETTER IOTA;Ll;0;L;;;;;N;;;0399;;0399
+03BA;GREEK SMALL LETTER KAPPA;Ll;0;L;;;;;N;;;039A;;039A
+03BB;GREEK SMALL LETTER LAMDA;Ll;0;L;;;;;N;GREEK SMALL LETTER LAMBDA;;039B;;039B
+03BC;GREEK SMALL LETTER MU;Ll;0;L;;;;;N;;;039C;;039C
+03BD;GREEK SMALL LETTER NU;Ll;0;L;;;;;N;;;039D;;039D
+03BE;GREEK SMALL LETTER XI;Ll;0;L;;;;;N;;;039E;;039E
+03BF;GREEK SMALL LETTER OMICRON;Ll;0;L;;;;;N;;;039F;;039F
+03C0;GREEK SMALL LETTER PI;Ll;0;L;;;;;N;;;03A0;;03A0
+03C1;GREEK SMALL LETTER RHO;Ll;0;L;;;;;N;;;03A1;;03A1
+03C2;GREEK SMALL LETTER FINAL SIGMA;Ll;0;L;;;;;N;;;03A3;;03A3
+03C3;GREEK SMALL LETTER SIGMA;Ll;0;L;;;;;N;;;03A3;;03A3
+03C4;GREEK SMALL LETTER TAU;Ll;0;L;;;;;N;;;03A4;;03A4
+03C5;GREEK SMALL LETTER UPSILON;Ll;0;L;;;;;N;;;03A5;;03A5
+03C6;GREEK SMALL LETTER PHI;Ll;0;L;;;;;N;;;03A6;;03A6
+03C7;GREEK SMALL LETTER CHI;Ll;0;L;;;;;N;;;03A7;;03A7
+03C8;GREEK SMALL LETTER PSI;Ll;0;L;;;;;N;;;03A8;;03A8
+03C9;GREEK SMALL LETTER OMEGA;Ll;0;L;;;;;N;;;03A9;;03A9
+03CA;GREEK SMALL LETTER IOTA WITH DIALYTIKA;Ll;0;L;03B9 0308;;;;N;GREEK SMALL LETTER IOTA DIAERESIS;;03AA;;03AA
+03CB;GREEK SMALL LETTER UPSILON WITH DIALYTIKA;Ll;0;L;03C5 0308;;;;N;GREEK SMALL LETTER UPSILON DIAERESIS;;03AB;;03AB
+03CC;GREEK SMALL LETTER OMICRON WITH TONOS;Ll;0;L;03BF 0301;;;;N;GREEK SMALL LETTER OMICRON TONOS;;038C;;038C
+03CD;GREEK SMALL LETTER UPSILON WITH TONOS;Ll;0;L;03C5 0301;;;;N;GREEK SMALL LETTER UPSILON TONOS;;038E;;038E
+03CE;GREEK SMALL LETTER OMEGA WITH TONOS;Ll;0;L;03C9 0301;;;;N;GREEK SMALL LETTER OMEGA TONOS;;038F;;038F
+03CF;GREEK CAPITAL KAI SYMBOL;Lu;0;L;;;;;N;;;;03D7;
+03D0;GREEK BETA SYMBOL;Ll;0;L;<compat> 03B2;;;;N;GREEK SMALL LETTER CURLED BETA;;0392;;0392
+03D1;GREEK THETA SYMBOL;Ll;0;L;<compat> 03B8;;;;N;GREEK SMALL LETTER SCRIPT THETA;;0398;;0398
+03D2;GREEK UPSILON WITH HOOK SYMBOL;Lu;0;L;<compat> 03A5;;;;N;GREEK CAPITAL LETTER UPSILON HOOK;;;;
+03D3;GREEK UPSILON WITH ACUTE AND HOOK SYMBOL;Lu;0;L;03D2 0301;;;;N;GREEK CAPITAL LETTER UPSILON HOOK TONOS;;;;
+03D4;GREEK UPSILON WITH DIAERESIS AND HOOK SYMBOL;Lu;0;L;03D2 0308;;;;N;GREEK CAPITAL LETTER UPSILON HOOK DIAERESIS;;;;
+03D5;GREEK PHI SYMBOL;Ll;0;L;<compat> 03C6;;;;N;GREEK SMALL LETTER SCRIPT PHI;;03A6;;03A6
+03D6;GREEK PI SYMBOL;Ll;0;L;<compat> 03C0;;;;N;GREEK SMALL LETTER OMEGA PI;;03A0;;03A0
+03D7;GREEK KAI SYMBOL;Ll;0;L;;;;;N;;;03CF;;03CF
+03D8;GREEK LETTER ARCHAIC KOPPA;Lu;0;L;;;;;N;;;;03D9;
+03D9;GREEK SMALL LETTER ARCHAIC KOPPA;Ll;0;L;;;;;N;;;03D8;;03D8
+03DA;GREEK LETTER STIGMA;Lu;0;L;;;;;N;GREEK CAPITAL LETTER STIGMA;;;03DB;
+03DB;GREEK SMALL LETTER STIGMA;Ll;0;L;;;;;N;;;03DA;;03DA
+03DC;GREEK LETTER DIGAMMA;Lu;0;L;;;;;N;GREEK CAPITAL LETTER DIGAMMA;;;03DD;
+03DD;GREEK SMALL LETTER DIGAMMA;Ll;0;L;;;;;N;;;03DC;;03DC
+03DE;GREEK LETTER KOPPA;Lu;0;L;;;;;N;GREEK CAPITAL LETTER KOPPA;;;03DF;
+03DF;GREEK SMALL LETTER KOPPA;Ll;0;L;;;;;N;;;03DE;;03DE
+03E0;GREEK LETTER SAMPI;Lu;0;L;;;;;N;GREEK CAPITAL LETTER SAMPI;;;03E1;
+03E1;GREEK SMALL LETTER SAMPI;Ll;0;L;;;;;N;;;03E0;;03E0
+03E2;COPTIC CAPITAL LETTER SHEI;Lu;0;L;;;;;N;GREEK CAPITAL LETTER SHEI;;;03E3;
+03E3;COPTIC SMALL LETTER SHEI;Ll;0;L;;;;;N;GREEK SMALL LETTER SHEI;;03E2;;03E2
+03E4;COPTIC CAPITAL LETTER FEI;Lu;0;L;;;;;N;GREEK CAPITAL LETTER FEI;;;03E5;
+03E5;COPTIC SMALL LETTER FEI;Ll;0;L;;;;;N;GREEK SMALL LETTER FEI;;03E4;;03E4
+03E6;COPTIC CAPITAL LETTER KHEI;Lu;0;L;;;;;N;GREEK CAPITAL LETTER KHEI;;;03E7;
+03E7;COPTIC SMALL LETTER KHEI;Ll;0;L;;;;;N;GREEK SMALL LETTER KHEI;;03E6;;03E6
+03E8;COPTIC CAPITAL LETTER HORI;Lu;0;L;;;;;N;GREEK CAPITAL LETTER HORI;;;03E9;
+03E9;COPTIC SMALL LETTER HORI;Ll;0;L;;;;;N;GREEK SMALL LETTER HORI;;03E8;;03E8
+03EA;COPTIC CAPITAL LETTER GANGIA;Lu;0;L;;;;;N;GREEK CAPITAL LETTER GANGIA;;;03EB;
+03EB;COPTIC SMALL LETTER GANGIA;Ll;0;L;;;;;N;GREEK SMALL LETTER GANGIA;;03EA;;03EA
+03EC;COPTIC CAPITAL LETTER SHIMA;Lu;0;L;;;;;N;GREEK CAPITAL LETTER SHIMA;;;03ED;
+03ED;COPTIC SMALL LETTER SHIMA;Ll;0;L;;;;;N;GREEK SMALL LETTER SHIMA;;03EC;;03EC
+03EE;COPTIC CAPITAL LETTER DEI;Lu;0;L;;;;;N;GREEK CAPITAL LETTER DEI;;;03EF;
+03EF;COPTIC SMALL LETTER DEI;Ll;0;L;;;;;N;GREEK SMALL LETTER DEI;;03EE;;03EE
+03F0;GREEK KAPPA SYMBOL;Ll;0;L;<compat> 03BA;;;;N;GREEK SMALL LETTER SCRIPT KAPPA;;039A;;039A
+03F1;GREEK RHO SYMBOL;Ll;0;L;<compat> 03C1;;;;N;GREEK SMALL LETTER TAILED RHO;;03A1;;03A1
+03F2;GREEK LUNATE SIGMA SYMBOL;Ll;0;L;<compat> 03C2;;;;N;GREEK SMALL LETTER LUNATE SIGMA;;03F9;;03F9
+03F3;GREEK LETTER YOT;Ll;0;L;;;;;N;;;037F;;037F
+03F4;GREEK CAPITAL THETA SYMBOL;Lu;0;L;<compat> 0398;;;;N;;;;03B8;
+03F5;GREEK LUNATE EPSILON SYMBOL;Ll;0;L;<compat> 03B5;;;;N;;;0395;;0395
+03F6;GREEK REVERSED LUNATE EPSILON SYMBOL;Sm;0;ON;;;;;N;;;;;
+03F7;GREEK CAPITAL LETTER SHO;Lu;0;L;;;;;N;;;;03F8;
+03F8;GREEK SMALL LETTER SHO;Ll;0;L;;;;;N;;;03F7;;03F7
+03F9;GREEK CAPITAL LUNATE SIGMA SYMBOL;Lu;0;L;<compat> 03A3;;;;N;;;;03F2;
+03FA;GREEK CAPITAL LETTER SAN;Lu;0;L;;;;;N;;;;03FB;
+03FB;GREEK SMALL LETTER SAN;Ll;0;L;;;;;N;;;03FA;;03FA
+03FC;GREEK RHO WITH STROKE SYMBOL;Ll;0;L;;;;;N;;;;;
+03FD;GREEK CAPITAL REVERSED LUNATE SIGMA SYMBOL;Lu;0;L;;;;;N;;;;037B;
+03FE;GREEK CAPITAL DOTTED LUNATE SIGMA SYMBOL;Lu;0;L;;;;;N;;;;037C;
+03FF;GREEK CAPITAL REVERSED DOTTED LUNATE SIGMA SYMBOL;Lu;0;L;;;;;N;;;;037D;
+0400;CYRILLIC CAPITAL LETTER IE WITH GRAVE;Lu;0;L;0415 0300;;;;N;;;;0450;
+0401;CYRILLIC CAPITAL LETTER IO;Lu;0;L;0415 0308;;;;N;;;;0451;
+0402;CYRILLIC CAPITAL LETTER DJE;Lu;0;L;;;;;N;;;;0452;
+0403;CYRILLIC CAPITAL LETTER GJE;Lu;0;L;0413 0301;;;;N;;;;0453;
+0404;CYRILLIC CAPITAL LETTER UKRAINIAN IE;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER E;;;0454;
+0405;CYRILLIC CAPITAL LETTER DZE;Lu;0;L;;;;;N;;;;0455;
+0406;CYRILLIC CAPITAL LETTER BYELORUSSIAN-UKRAINIAN I;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER I;;;0456;
+0407;CYRILLIC CAPITAL LETTER YI;Lu;0;L;0406 0308;;;;N;;;;0457;
+0408;CYRILLIC CAPITAL LETTER JE;Lu;0;L;;;;;N;;;;0458;
+0409;CYRILLIC CAPITAL LETTER LJE;Lu;0;L;;;;;N;;;;0459;
+040A;CYRILLIC CAPITAL LETTER NJE;Lu;0;L;;;;;N;;;;045A;
+040B;CYRILLIC CAPITAL LETTER TSHE;Lu;0;L;;;;;N;;;;045B;
+040C;CYRILLIC CAPITAL LETTER KJE;Lu;0;L;041A 0301;;;;N;;;;045C;
+040D;CYRILLIC CAPITAL LETTER I WITH GRAVE;Lu;0;L;0418 0300;;;;N;;;;045D;
+040E;CYRILLIC CAPITAL LETTER SHORT U;Lu;0;L;0423 0306;;;;N;;;;045E;
+040F;CYRILLIC CAPITAL LETTER DZHE;Lu;0;L;;;;;N;;;;045F;
+0410;CYRILLIC CAPITAL LETTER A;Lu;0;L;;;;;N;;;;0430;
+0411;CYRILLIC CAPITAL LETTER BE;Lu;0;L;;;;;N;;;;0431;
+0412;CYRILLIC CAPITAL LETTER VE;Lu;0;L;;;;;N;;;;0432;
+0413;CYRILLIC CAPITAL LETTER GHE;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER GE;;;0433;
+0414;CYRILLIC CAPITAL LETTER DE;Lu;0;L;;;;;N;;;;0434;
+0415;CYRILLIC CAPITAL LETTER IE;Lu;0;L;;;;;N;;;;0435;
+0416;CYRILLIC CAPITAL LETTER ZHE;Lu;0;L;;;;;N;;;;0436;
+0417;CYRILLIC CAPITAL LETTER ZE;Lu;0;L;;;;;N;;;;0437;
+0418;CYRILLIC CAPITAL LETTER I;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER II;;;0438;
+0419;CYRILLIC CAPITAL LETTER SHORT I;Lu;0;L;0418 0306;;;;N;CYRILLIC CAPITAL LETTER SHORT II;;;0439;
+041A;CYRILLIC CAPITAL LETTER KA;Lu;0;L;;;;;N;;;;043A;
+041B;CYRILLIC CAPITAL LETTER EL;Lu;0;L;;;;;N;;;;043B;
+041C;CYRILLIC CAPITAL LETTER EM;Lu;0;L;;;;;N;;;;043C;
+041D;CYRILLIC CAPITAL LETTER EN;Lu;0;L;;;;;N;;;;043D;
+041E;CYRILLIC CAPITAL LETTER O;Lu;0;L;;;;;N;;;;043E;
+041F;CYRILLIC CAPITAL LETTER PE;Lu;0;L;;;;;N;;;;043F;
+0420;CYRILLIC CAPITAL LETTER ER;Lu;0;L;;;;;N;;;;0440;
+0421;CYRILLIC CAPITAL LETTER ES;Lu;0;L;;;;;N;;;;0441;
+0422;CYRILLIC CAPITAL LETTER TE;Lu;0;L;;;;;N;;;;0442;
+0423;CYRILLIC CAPITAL LETTER U;Lu;0;L;;;;;N;;;;0443;
+0424;CYRILLIC CAPITAL LETTER EF;Lu;0;L;;;;;N;;;;0444;
+0425;CYRILLIC CAPITAL LETTER HA;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER KHA;;;0445;
+0426;CYRILLIC CAPITAL LETTER TSE;Lu;0;L;;;;;N;;;;0446;
+0427;CYRILLIC CAPITAL LETTER CHE;Lu;0;L;;;;;N;;;;0447;
+0428;CYRILLIC CAPITAL LETTER SHA;Lu;0;L;;;;;N;;;;0448;
+0429;CYRILLIC CAPITAL LETTER SHCHA;Lu;0;L;;;;;N;;;;0449;
+042A;CYRILLIC CAPITAL LETTER HARD SIGN;Lu;0;L;;;;;N;;;;044A;
+042B;CYRILLIC CAPITAL LETTER YERU;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER YERI;;;044B;
+042C;CYRILLIC CAPITAL LETTER SOFT SIGN;Lu;0;L;;;;;N;;;;044C;
+042D;CYRILLIC CAPITAL LETTER E;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER REVERSED E;;;044D;
+042E;CYRILLIC CAPITAL LETTER YU;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER IU;;;044E;
+042F;CYRILLIC CAPITAL LETTER YA;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER IA;;;044F;
+0430;CYRILLIC SMALL LETTER A;Ll;0;L;;;;;N;;;0410;;0410
+0431;CYRILLIC SMALL LETTER BE;Ll;0;L;;;;;N;;;0411;;0411
+0432;CYRILLIC SMALL LETTER VE;Ll;0;L;;;;;N;;;0412;;0412
+0433;CYRILLIC SMALL LETTER GHE;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER GE;;0413;;0413
+0434;CYRILLIC SMALL LETTER DE;Ll;0;L;;;;;N;;;0414;;0414
+0435;CYRILLIC SMALL LETTER IE;Ll;0;L;;;;;N;;;0415;;0415
+0436;CYRILLIC SMALL LETTER ZHE;Ll;0;L;;;;;N;;;0416;;0416
+0437;CYRILLIC SMALL LETTER ZE;Ll;0;L;;;;;N;;;0417;;0417
+0438;CYRILLIC SMALL LETTER I;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER II;;0418;;0418
+0439;CYRILLIC SMALL LETTER SHORT I;Ll;0;L;0438 0306;;;;N;CYRILLIC SMALL LETTER SHORT II;;0419;;0419
+043A;CYRILLIC SMALL LETTER KA;Ll;0;L;;;;;N;;;041A;;041A
+043B;CYRILLIC SMALL LETTER EL;Ll;0;L;;;;;N;;;041B;;041B
+043C;CYRILLIC SMALL LETTER EM;Ll;0;L;;;;;N;;;041C;;041C
+043D;CYRILLIC SMALL LETTER EN;Ll;0;L;;;;;N;;;041D;;041D
+043E;CYRILLIC SMALL LETTER O;Ll;0;L;;;;;N;;;041E;;041E
+043F;CYRILLIC SMALL LETTER PE;Ll;0;L;;;;;N;;;041F;;041F
+0440;CYRILLIC SMALL LETTER ER;Ll;0;L;;;;;N;;;0420;;0420
+0441;CYRILLIC SMALL LETTER ES;Ll;0;L;;;;;N;;;0421;;0421
+0442;CYRILLIC SMALL LETTER TE;Ll;0;L;;;;;N;;;0422;;0422
+0443;CYRILLIC SMALL LETTER U;Ll;0;L;;;;;N;;;0423;;0423
+0444;CYRILLIC SMALL LETTER EF;Ll;0;L;;;;;N;;;0424;;0424
+0445;CYRILLIC SMALL LETTER HA;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER KHA;;0425;;0425
+0446;CYRILLIC SMALL LETTER TSE;Ll;0;L;;;;;N;;;0426;;0426
+0447;CYRILLIC SMALL LETTER CHE;Ll;0;L;;;;;N;;;0427;;0427
+0448;CYRILLIC SMALL LETTER SHA;Ll;0;L;;;;;N;;;0428;;0428
+0449;CYRILLIC SMALL LETTER SHCHA;Ll;0;L;;;;;N;;;0429;;0429
+044A;CYRILLIC SMALL LETTER HARD SIGN;Ll;0;L;;;;;N;;;042A;;042A
+044B;CYRILLIC SMALL LETTER YERU;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER YERI;;042B;;042B
+044C;CYRILLIC SMALL LETTER SOFT SIGN;Ll;0;L;;;;;N;;;042C;;042C
+044D;CYRILLIC SMALL LETTER E;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER REVERSED E;;042D;;042D
+044E;CYRILLIC SMALL LETTER YU;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER IU;;042E;;042E
+044F;CYRILLIC SMALL LETTER YA;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER IA;;042F;;042F
+0450;CYRILLIC SMALL LETTER IE WITH GRAVE;Ll;0;L;0435 0300;;;;N;;;0400;;0400
+0451;CYRILLIC SMALL LETTER IO;Ll;0;L;0435 0308;;;;N;;;0401;;0401
+0452;CYRILLIC SMALL LETTER DJE;Ll;0;L;;;;;N;;;0402;;0402
+0453;CYRILLIC SMALL LETTER GJE;Ll;0;L;0433 0301;;;;N;;;0403;;0403
+0454;CYRILLIC SMALL LETTER UKRAINIAN IE;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER E;;0404;;0404
+0455;CYRILLIC SMALL LETTER DZE;Ll;0;L;;;;;N;;;0405;;0405
+0456;CYRILLIC SMALL LETTER BYELORUSSIAN-UKRAINIAN I;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER I;;0406;;0406
+0457;CYRILLIC SMALL LETTER YI;Ll;0;L;0456 0308;;;;N;;;0407;;0407
+0458;CYRILLIC SMALL LETTER JE;Ll;0;L;;;;;N;;;0408;;0408
+0459;CYRILLIC SMALL LETTER LJE;Ll;0;L;;;;;N;;;0409;;0409
+045A;CYRILLIC SMALL LETTER NJE;Ll;0;L;;;;;N;;;040A;;040A
+045B;CYRILLIC SMALL LETTER TSHE;Ll;0;L;;;;;N;;;040B;;040B
+045C;CYRILLIC SMALL LETTER KJE;Ll;0;L;043A 0301;;;;N;;;040C;;040C
+045D;CYRILLIC SMALL LETTER I WITH GRAVE;Ll;0;L;0438 0300;;;;N;;;040D;;040D
+045E;CYRILLIC SMALL LETTER SHORT U;Ll;0;L;0443 0306;;;;N;;;040E;;040E
+045F;CYRILLIC SMALL LETTER DZHE;Ll;0;L;;;;;N;;;040F;;040F
+0460;CYRILLIC CAPITAL LETTER OMEGA;Lu;0;L;;;;;N;;;;0461;
+0461;CYRILLIC SMALL LETTER OMEGA;Ll;0;L;;;;;N;;;0460;;0460
+0462;CYRILLIC CAPITAL LETTER YAT;Lu;0;L;;;;;N;;;;0463;
+0463;CYRILLIC SMALL LETTER YAT;Ll;0;L;;;;;N;;;0462;;0462
+0464;CYRILLIC CAPITAL LETTER IOTIFIED E;Lu;0;L;;;;;N;;;;0465;
+0465;CYRILLIC SMALL LETTER IOTIFIED E;Ll;0;L;;;;;N;;;0464;;0464
+0466;CYRILLIC CAPITAL LETTER LITTLE YUS;Lu;0;L;;;;;N;;;;0467;
+0467;CYRILLIC SMALL LETTER LITTLE YUS;Ll;0;L;;;;;N;;;0466;;0466
+0468;CYRILLIC CAPITAL LETTER IOTIFIED LITTLE YUS;Lu;0;L;;;;;N;;;;0469;
+0469;CYRILLIC SMALL LETTER IOTIFIED LITTLE YUS;Ll;0;L;;;;;N;;;0468;;0468
+046A;CYRILLIC CAPITAL LETTER BIG YUS;Lu;0;L;;;;;N;;;;046B;
+046B;CYRILLIC SMALL LETTER BIG YUS;Ll;0;L;;;;;N;;;046A;;046A
+046C;CYRILLIC CAPITAL LETTER IOTIFIED BIG YUS;Lu;0;L;;;;;N;;;;046D;
+046D;CYRILLIC SMALL LETTER IOTIFIED BIG YUS;Ll;0;L;;;;;N;;;046C;;046C
+046E;CYRILLIC CAPITAL LETTER KSI;Lu;0;L;;;;;N;;;;046F;
+046F;CYRILLIC SMALL LETTER KSI;Ll;0;L;;;;;N;;;046E;;046E
+0470;CYRILLIC CAPITAL LETTER PSI;Lu;0;L;;;;;N;;;;0471;
+0471;CYRILLIC SMALL LETTER PSI;Ll;0;L;;;;;N;;;0470;;0470
+0472;CYRILLIC CAPITAL LETTER FITA;Lu;0;L;;;;;N;;;;0473;
+0473;CYRILLIC SMALL LETTER FITA;Ll;0;L;;;;;N;;;0472;;0472
+0474;CYRILLIC CAPITAL LETTER IZHITSA;Lu;0;L;;;;;N;;;;0475;
+0475;CYRILLIC SMALL LETTER IZHITSA;Ll;0;L;;;;;N;;;0474;;0474
+0476;CYRILLIC CAPITAL LETTER IZHITSA WITH DOUBLE GRAVE ACCENT;Lu;0;L;0474 030F;;;;N;CYRILLIC CAPITAL LETTER IZHITSA DOUBLE GRAVE;;;0477;
+0477;CYRILLIC SMALL LETTER IZHITSA WITH DOUBLE GRAVE ACCENT;Ll;0;L;0475 030F;;;;N;CYRILLIC SMALL LETTER IZHITSA DOUBLE GRAVE;;0476;;0476
+0478;CYRILLIC CAPITAL LETTER UK;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER UK DIGRAPH;;;0479;
+0479;CYRILLIC SMALL LETTER UK;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER UK DIGRAPH;;0478;;0478
+047A;CYRILLIC CAPITAL LETTER ROUND OMEGA;Lu;0;L;;;;;N;;;;047B;
+047B;CYRILLIC SMALL LETTER ROUND OMEGA;Ll;0;L;;;;;N;;;047A;;047A
+047C;CYRILLIC CAPITAL LETTER OMEGA WITH TITLO;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER OMEGA TITLO;;;047D;
+047D;CYRILLIC SMALL LETTER OMEGA WITH TITLO;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER OMEGA TITLO;;047C;;047C
+047E;CYRILLIC CAPITAL LETTER OT;Lu;0;L;;;;;N;;;;047F;
+047F;CYRILLIC SMALL LETTER OT;Ll;0;L;;;;;N;;;047E;;047E
+0480;CYRILLIC CAPITAL LETTER KOPPA;Lu;0;L;;;;;N;;;;0481;
+0481;CYRILLIC SMALL LETTER KOPPA;Ll;0;L;;;;;N;;;0480;;0480
+0482;CYRILLIC THOUSANDS SIGN;So;0;L;;;;;N;;;;;
+0483;COMBINING CYRILLIC TITLO;Mn;230;NSM;;;;;N;CYRILLIC NON-SPACING TITLO;;;;
+0484;COMBINING CYRILLIC PALATALIZATION;Mn;230;NSM;;;;;N;CYRILLIC NON-SPACING PALATALIZATION;;;;
+0485;COMBINING CYRILLIC DASIA PNEUMATA;Mn;230;NSM;;;;;N;CYRILLIC NON-SPACING DASIA PNEUMATA;;;;
+0486;COMBINING CYRILLIC PSILI PNEUMATA;Mn;230;NSM;;;;;N;CYRILLIC NON-SPACING PSILI PNEUMATA;;;;
+0487;COMBINING CYRILLIC POKRYTIE;Mn;230;NSM;;;;;N;;;;;
+0488;COMBINING CYRILLIC HUNDRED THOUSANDS SIGN;Me;0;NSM;;;;;N;;;;;
+0489;COMBINING CYRILLIC MILLIONS SIGN;Me;0;NSM;;;;;N;;;;;
+048A;CYRILLIC CAPITAL LETTER SHORT I WITH TAIL;Lu;0;L;;;;;N;;;;048B;
+048B;CYRILLIC SMALL LETTER SHORT I WITH TAIL;Ll;0;L;;;;;N;;;048A;;048A
+048C;CYRILLIC CAPITAL LETTER SEMISOFT SIGN;Lu;0;L;;;;;N;;;;048D;
+048D;CYRILLIC SMALL LETTER SEMISOFT SIGN;Ll;0;L;;;;;N;;;048C;;048C
+048E;CYRILLIC CAPITAL LETTER ER WITH TICK;Lu;0;L;;;;;N;;;;048F;
+048F;CYRILLIC SMALL LETTER ER WITH TICK;Ll;0;L;;;;;N;;;048E;;048E
+0490;CYRILLIC CAPITAL LETTER GHE WITH UPTURN;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER GE WITH UPTURN;;;0491;
+0491;CYRILLIC SMALL LETTER GHE WITH UPTURN;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER GE WITH UPTURN;;0490;;0490
+0492;CYRILLIC CAPITAL LETTER GHE WITH STROKE;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER GE BAR;;;0493;
+0493;CYRILLIC SMALL LETTER GHE WITH STROKE;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER GE BAR;;0492;;0492
+0494;CYRILLIC CAPITAL LETTER GHE WITH MIDDLE HOOK;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER GE HOOK;;;0495;
+0495;CYRILLIC SMALL LETTER GHE WITH MIDDLE HOOK;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER GE HOOK;;0494;;0494
+0496;CYRILLIC CAPITAL LETTER ZHE WITH DESCENDER;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER ZHE WITH RIGHT DESCENDER;;;0497;
+0497;CYRILLIC SMALL LETTER ZHE WITH DESCENDER;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER ZHE WITH RIGHT DESCENDER;;0496;;0496
+0498;CYRILLIC CAPITAL LETTER ZE WITH DESCENDER;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER ZE CEDILLA;;;0499;
+0499;CYRILLIC SMALL LETTER ZE WITH DESCENDER;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER ZE CEDILLA;;0498;;0498
+049A;CYRILLIC CAPITAL LETTER KA WITH DESCENDER;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER KA WITH RIGHT DESCENDER;;;049B;
+049B;CYRILLIC SMALL LETTER KA WITH DESCENDER;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER KA WITH RIGHT DESCENDER;;049A;;049A
+049C;CYRILLIC CAPITAL LETTER KA WITH VERTICAL STROKE;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER KA VERTICAL BAR;;;049D;
+049D;CYRILLIC SMALL LETTER KA WITH VERTICAL STROKE;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER KA VERTICAL BAR;;049C;;049C
+049E;CYRILLIC CAPITAL LETTER KA WITH STROKE;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER KA BAR;;;049F;
+049F;CYRILLIC SMALL LETTER KA WITH STROKE;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER KA BAR;;049E;;049E
+04A0;CYRILLIC CAPITAL LETTER BASHKIR KA;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER REVERSED GE KA;;;04A1;
+04A1;CYRILLIC SMALL LETTER BASHKIR KA;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER REVERSED GE KA;;04A0;;04A0
+04A2;CYRILLIC CAPITAL LETTER EN WITH DESCENDER;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER EN WITH RIGHT DESCENDER;;;04A3;
+04A3;CYRILLIC SMALL LETTER EN WITH DESCENDER;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER EN WITH RIGHT DESCENDER;;04A2;;04A2
+04A4;CYRILLIC CAPITAL LIGATURE EN GHE;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER EN GE;;;04A5;
+04A5;CYRILLIC SMALL LIGATURE EN GHE;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER EN GE;;04A4;;04A4
+04A6;CYRILLIC CAPITAL LETTER PE WITH MIDDLE HOOK;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER PE HOOK;;;04A7;
+04A7;CYRILLIC SMALL LETTER PE WITH MIDDLE HOOK;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER PE HOOK;;04A6;;04A6
+04A8;CYRILLIC CAPITAL LETTER ABKHASIAN HA;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER O HOOK;;;04A9;
+04A9;CYRILLIC SMALL LETTER ABKHASIAN HA;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER O HOOK;;04A8;;04A8
+04AA;CYRILLIC CAPITAL LETTER ES WITH DESCENDER;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER ES CEDILLA;;;04AB;
+04AB;CYRILLIC SMALL LETTER ES WITH DESCENDER;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER ES CEDILLA;;04AA;;04AA
+04AC;CYRILLIC CAPITAL LETTER TE WITH DESCENDER;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER TE WITH RIGHT DESCENDER;;;04AD;
+04AD;CYRILLIC SMALL LETTER TE WITH DESCENDER;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER TE WITH RIGHT DESCENDER;;04AC;;04AC
+04AE;CYRILLIC CAPITAL LETTER STRAIGHT U;Lu;0;L;;;;;N;;;;04AF;
+04AF;CYRILLIC SMALL LETTER STRAIGHT U;Ll;0;L;;;;;N;;;04AE;;04AE
+04B0;CYRILLIC CAPITAL LETTER STRAIGHT U WITH STROKE;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER STRAIGHT U BAR;;;04B1;
+04B1;CYRILLIC SMALL LETTER STRAIGHT U WITH STROKE;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER STRAIGHT U BAR;;04B0;;04B0
+04B2;CYRILLIC CAPITAL LETTER HA WITH DESCENDER;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER KHA WITH RIGHT DESCENDER;;;04B3;
+04B3;CYRILLIC SMALL LETTER HA WITH DESCENDER;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER KHA WITH RIGHT DESCENDER;;04B2;;04B2
+04B4;CYRILLIC CAPITAL LIGATURE TE TSE;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER TE TSE;;;04B5;
+04B5;CYRILLIC SMALL LIGATURE TE TSE;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER TE TSE;;04B4;;04B4
+04B6;CYRILLIC CAPITAL LETTER CHE WITH DESCENDER;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER CHE WITH RIGHT DESCENDER;;;04B7;
+04B7;CYRILLIC SMALL LETTER CHE WITH DESCENDER;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER CHE WITH RIGHT DESCENDER;;04B6;;04B6
+04B8;CYRILLIC CAPITAL LETTER CHE WITH VERTICAL STROKE;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER CHE VERTICAL BAR;;;04B9;
+04B9;CYRILLIC SMALL LETTER CHE WITH VERTICAL STROKE;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER CHE VERTICAL BAR;;04B8;;04B8
+04BA;CYRILLIC CAPITAL LETTER SHHA;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER H;;;04BB;
+04BB;CYRILLIC SMALL LETTER SHHA;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER H;;04BA;;04BA
+04BC;CYRILLIC CAPITAL LETTER ABKHASIAN CHE;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER IE HOOK;;;04BD;
+04BD;CYRILLIC SMALL LETTER ABKHASIAN CHE;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER IE HOOK;;04BC;;04BC
+04BE;CYRILLIC CAPITAL LETTER ABKHASIAN CHE WITH DESCENDER;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER IE HOOK OGONEK;;;04BF;
+04BF;CYRILLIC SMALL LETTER ABKHASIAN CHE WITH DESCENDER;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER IE HOOK OGONEK;;04BE;;04BE
+04C0;CYRILLIC LETTER PALOCHKA;Lu;0;L;;;;;N;CYRILLIC LETTER I;;;04CF;
+04C1;CYRILLIC CAPITAL LETTER ZHE WITH BREVE;Lu;0;L;0416 0306;;;;N;CYRILLIC CAPITAL LETTER SHORT ZHE;;;04C2;
+04C2;CYRILLIC SMALL LETTER ZHE WITH BREVE;Ll;0;L;0436 0306;;;;N;CYRILLIC SMALL LETTER SHORT ZHE;;04C1;;04C1
+04C3;CYRILLIC CAPITAL LETTER KA WITH HOOK;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER KA HOOK;;;04C4;
+04C4;CYRILLIC SMALL LETTER KA WITH HOOK;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER KA HOOK;;04C3;;04C3
+04C5;CYRILLIC CAPITAL LETTER EL WITH TAIL;Lu;0;L;;;;;N;;;;04C6;
+04C6;CYRILLIC SMALL LETTER EL WITH TAIL;Ll;0;L;;;;;N;;;04C5;;04C5
+04C7;CYRILLIC CAPITAL LETTER EN WITH HOOK;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER EN HOOK;;;04C8;
+04C8;CYRILLIC SMALL LETTER EN WITH HOOK;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER EN HOOK;;04C7;;04C7
+04C9;CYRILLIC CAPITAL LETTER EN WITH TAIL;Lu;0;L;;;;;N;;;;04CA;
+04CA;CYRILLIC SMALL LETTER EN WITH TAIL;Ll;0;L;;;;;N;;;04C9;;04C9
+04CB;CYRILLIC CAPITAL LETTER KHAKASSIAN CHE;Lu;0;L;;;;;N;CYRILLIC CAPITAL LETTER CHE WITH LEFT DESCENDER;;;04CC;
+04CC;CYRILLIC SMALL LETTER KHAKASSIAN CHE;Ll;0;L;;;;;N;CYRILLIC SMALL LETTER CHE WITH LEFT DESCENDER;;04CB;;04CB
+04CD;CYRILLIC CAPITAL LETTER EM WITH TAIL;Lu;0;L;;;;;N;;;;04CE;
+04CE;CYRILLIC SMALL LETTER EM WITH TAIL;Ll;0;L;;;;;N;;;04CD;;04CD
+04CF;CYRILLIC SMALL LETTER PALOCHKA;Ll;0;L;;;;;N;;;04C0;;04C0
+04D0;CYRILLIC CAPITAL LETTER A WITH BREVE;Lu;0;L;0410 0306;;;;N;;;;04D1;
+04D1;CYRILLIC SMALL LETTER A WITH BREVE;Ll;0;L;0430 0306;;;;N;;;04D0;;04D0
+04D2;CYRILLIC CAPITAL LETTER A WITH DIAERESIS;Lu;0;L;0410 0308;;;;N;;;;04D3;
+04D3;CYRILLIC SMALL LETTER A WITH DIAERESIS;Ll;0;L;0430 0308;;;;N;;;04D2;;04D2
+04D4;CYRILLIC CAPITAL LIGATURE A IE;Lu;0;L;;;;;N;;;;04D5;
+04D5;CYRILLIC SMALL LIGATURE A IE;Ll;0;L;;;;;N;;;04D4;;04D4
+04D6;CYRILLIC CAPITAL LETTER IE WITH BREVE;Lu;0;L;0415 0306;;;;N;;;;04D7;
+04D7;CYRILLIC SMALL LETTER IE WITH BREVE;Ll;0;L;0435 0306;;;;N;;;04D6;;04D6
+04D8;CYRILLIC CAPITAL LETTER SCHWA;Lu;0;L;;;;;N;;;;04D9;
+04D9;CYRILLIC SMALL LETTER SCHWA;Ll;0;L;;;;;N;;;04D8;;04D8
+04DA;CYRILLIC CAPITAL LETTER SCHWA WITH DIAERESIS;Lu;0;L;04D8 0308;;;;N;;;;04DB;
+04DB;CYRILLIC SMALL LETTER SCHWA WITH DIAERESIS;Ll;0;L;04D9 0308;;;;N;;;04DA;;04DA
+04DC;CYRILLIC CAPITAL LETTER ZHE WITH DIAERESIS;Lu;0;L;0416 0308;;;;N;;;;04DD;
+04DD;CYRILLIC SMALL LETTER ZHE WITH DIAERESIS;Ll;0;L;0436 0308;;;;N;;;04DC;;04DC
+04DE;CYRILLIC CAPITAL LETTER ZE WITH DIAERESIS;Lu;0;L;0417 0308;;;;N;;;;04DF;
+04DF;CYRILLIC SMALL LETTER ZE WITH DIAERESIS;Ll;0;L;0437 0308;;;;N;;;04DE;;04DE
+04E0;CYRILLIC CAPITAL LETTER ABKHASIAN DZE;Lu;0;L;;;;;N;;;;04E1;
+04E1;CYRILLIC SMALL LETTER ABKHASIAN DZE;Ll;0;L;;;;;N;;;04E0;;04E0
+04E2;CYRILLIC CAPITAL LETTER I WITH MACRON;Lu;0;L;0418 0304;;;;N;;;;04E3;
+04E3;CYRILLIC SMALL LETTER I WITH MACRON;Ll;0;L;0438 0304;;;;N;;;04E2;;04E2
+04E4;CYRILLIC CAPITAL LETTER I WITH DIAERESIS;Lu;0;L;0418 0308;;;;N;;;;04E5;
+04E5;CYRILLIC SMALL LETTER I WITH DIAERESIS;Ll;0;L;0438 0308;;;;N;;;04E4;;04E4
+04E6;CYRILLIC CAPITAL LETTER O WITH DIAERESIS;Lu;0;L;041E 0308;;;;N;;;;04E7;
+04E7;CYRILLIC SMALL LETTER O WITH DIAERESIS;Ll;0;L;043E 0308;;;;N;;;04E6;;04E6
+04E8;CYRILLIC CAPITAL LETTER BARRED O;Lu;0;L;;;;;N;;;;04E9;
+04E9;CYRILLIC SMALL LETTER BARRED O;Ll;0;L;;;;;N;;;04E8;;04E8
+04EA;CYRILLIC CAPITAL LETTER BARRED O WITH DIAERESIS;Lu;0;L;04E8 0308;;;;N;;;;04EB;
+04EB;CYRILLIC SMALL LETTER BARRED O WITH DIAERESIS;Ll;0;L;04E9 0308;;;;N;;;04EA;;04EA
+04EC;CYRILLIC CAPITAL LETTER E WITH DIAERESIS;Lu;0;L;042D 0308;;;;N;;;;04ED;
+04ED;CYRILLIC SMALL LETTER E WITH DIAERESIS;Ll;0;L;044D 0308;;;;N;;;04EC;;04EC
+04EE;CYRILLIC CAPITAL LETTER U WITH MACRON;Lu;0;L;0423 0304;;;;N;;;;04EF;
+04EF;CYRILLIC SMALL LETTER U WITH MACRON;Ll;0;L;0443 0304;;;;N;;;04EE;;04EE
+04F0;CYRILLIC CAPITAL LETTER U WITH DIAERESIS;Lu;0;L;0423 0308;;;;N;;;;04F1;
+04F1;CYRILLIC SMALL LETTER U WITH DIAERESIS;Ll;0;L;0443 0308;;;;N;;;04F0;;04F0
+04F2;CYRILLIC CAPITAL LETTER U WITH DOUBLE ACUTE;Lu;0;L;0423 030B;;;;N;;;;04F3;
+04F3;CYRILLIC SMALL LETTER U WITH DOUBLE ACUTE;Ll;0;L;0443 030B;;;;N;;;04F2;;04F2
+04F4;CYRILLIC CAPITAL LETTER CHE WITH DIAERESIS;Lu;0;L;0427 0308;;;;N;;;;04F5;
+04F5;CYRILLIC SMALL LETTER CHE WITH DIAERESIS;Ll;0;L;0447 0308;;;;N;;;04F4;;04F4
+04F6;CYRILLIC CAPITAL LETTER GHE WITH DESCENDER;Lu;0;L;;;;;N;;;;04F7;
+04F7;CYRILLIC SMALL LETTER GHE WITH DESCENDER;Ll;0;L;;;;;N;;;04F6;;04F6
+04F8;CYRILLIC CAPITAL LETTER YERU WITH DIAERESIS;Lu;0;L;042B 0308;;;;N;;;;04F9;
+04F9;CYRILLIC SMALL LETTER YERU WITH DIAERESIS;Ll;0;L;044B 0308;;;;N;;;04F8;;04F8
+04FA;CYRILLIC CAPITAL LETTER GHE WITH STROKE AND HOOK;Lu;0;L;;;;;N;;;;04FB;
+04FB;CYRILLIC SMALL LETTER GHE WITH STROKE AND HOOK;Ll;0;L;;;;;N;;;04FA;;04FA
+04FC;CYRILLIC CAPITAL LETTER HA WITH HOOK;Lu;0;L;;;;;N;;;;04FD;
+04FD;CYRILLIC SMALL LETTER HA WITH HOOK;Ll;0;L;;;;;N;;;04FC;;04FC
+04FE;CYRILLIC CAPITAL LETTER HA WITH STROKE;Lu;0;L;;;;;N;;;;04FF;
+04FF;CYRILLIC SMALL LETTER HA WITH STROKE;Ll;0;L;;;;;N;;;04FE;;04FE
+0500;CYRILLIC CAPITAL LETTER KOMI DE;Lu;0;L;;;;;N;;;;0501;
+0501;CYRILLIC SMALL LETTER KOMI DE;Ll;0;L;;;;;N;;;0500;;0500
+0502;CYRILLIC CAPITAL LETTER KOMI DJE;Lu;0;L;;;;;N;;;;0503;
+0503;CYRILLIC SMALL LETTER KOMI DJE;Ll;0;L;;;;;N;;;0502;;0502
+0504;CYRILLIC CAPITAL LETTER KOMI ZJE;Lu;0;L;;;;;N;;;;0505;
+0505;CYRILLIC SMALL LETTER KOMI ZJE;Ll;0;L;;;;;N;;;0504;;0504
+0506;CYRILLIC CAPITAL LETTER KOMI DZJE;Lu;0;L;;;;;N;;;;0507;
+0507;CYRILLIC SMALL LETTER KOMI DZJE;Ll;0;L;;;;;N;;;0506;;0506
+0508;CYRILLIC CAPITAL LETTER KOMI LJE;Lu;0;L;;;;;N;;;;0509;
+0509;CYRILLIC SMALL LETTER KOMI LJE;Ll;0;L;;;;;N;;;0508;;0508
+050A;CYRILLIC CAPITAL LETTER KOMI NJE;Lu;0;L;;;;;N;;;;050B;
+050B;CYRILLIC SMALL LETTER KOMI NJE;Ll;0;L;;;;;N;;;050A;;050A
+050C;CYRILLIC CAPITAL LETTER KOMI SJE;Lu;0;L;;;;;N;;;;050D;
+050D;CYRILLIC SMALL LETTER KOMI SJE;Ll;0;L;;;;;N;;;050C;;050C
+050E;CYRILLIC CAPITAL LETTER KOMI TJE;Lu;0;L;;;;;N;;;;050F;
+050F;CYRILLIC SMALL LETTER KOMI TJE;Ll;0;L;;;;;N;;;050E;;050E
+0510;CYRILLIC CAPITAL LETTER REVERSED ZE;Lu;0;L;;;;;N;;;;0511;
+0511;CYRILLIC SMALL LETTER REVERSED ZE;Ll;0;L;;;;;N;;;0510;;0510
+0512;CYRILLIC CAPITAL LETTER EL WITH HOOK;Lu;0;L;;;;;N;;;;0513;
+0513;CYRILLIC SMALL LETTER EL WITH HOOK;Ll;0;L;;;;;N;;;0512;;0512
+0514;CYRILLIC CAPITAL LETTER LHA;Lu;0;L;;;;;N;;;;0515;
+0515;CYRILLIC SMALL LETTER LHA;Ll;0;L;;;;;N;;;0514;;0514
+0516;CYRILLIC CAPITAL LETTER RHA;Lu;0;L;;;;;N;;;;0517;
+0517;CYRILLIC SMALL LETTER RHA;Ll;0;L;;;;;N;;;0516;;0516
+0518;CYRILLIC CAPITAL LETTER YAE;Lu;0;L;;;;;N;;;;0519;
+0519;CYRILLIC SMALL LETTER YAE;Ll;0;L;;;;;N;;;0518;;0518
+051A;CYRILLIC CAPITAL LETTER QA;Lu;0;L;;;;;N;;;;051B;
+051B;CYRILLIC SMALL LETTER QA;Ll;0;L;;;;;N;;;051A;;051A
+051C;CYRILLIC CAPITAL LETTER WE;Lu;0;L;;;;;N;;;;051D;
+051D;CYRILLIC SMALL LETTER WE;Ll;0;L;;;;;N;;;051C;;051C
+051E;CYRILLIC CAPITAL LETTER ALEUT KA;Lu;0;L;;;;;N;;;;051F;
+051F;CYRILLIC SMALL LETTER ALEUT KA;Ll;0;L;;;;;N;;;051E;;051E
+0520;CYRILLIC CAPITAL LETTER EL WITH MIDDLE HOOK;Lu;0;L;;;;;N;;;;0521;
+0521;CYRILLIC SMALL LETTER EL WITH MIDDLE HOOK;Ll;0;L;;;;;N;;;0520;;0520
+0522;CYRILLIC CAPITAL LETTER EN WITH MIDDLE HOOK;Lu;0;L;;;;;N;;;;0523;
+0523;CYRILLIC SMALL LETTER EN WITH MIDDLE HOOK;Ll;0;L;;;;;N;;;0522;;0522
+0524;CYRILLIC CAPITAL LETTER PE WITH DESCENDER;Lu;0;L;;;;;N;;;;0525;
+0525;CYRILLIC SMALL LETTER PE WITH DESCENDER;Ll;0;L;;;;;N;;;0524;;0524
+0526;CYRILLIC CAPITAL LETTER SHHA WITH DESCENDER;Lu;0;L;;;;;N;;;;0527;
+0527;CYRILLIC SMALL LETTER SHHA WITH DESCENDER;Ll;0;L;;;;;N;;;0526;;0526
+0528;CYRILLIC CAPITAL LETTER EN WITH LEFT HOOK;Lu;0;L;;;;;N;;;;0529;
+0529;CYRILLIC SMALL LETTER EN WITH LEFT HOOK;Ll;0;L;;;;;N;;;0528;;0528
+052A;CYRILLIC CAPITAL LETTER DZZHE;Lu;0;L;;;;;N;;;;052B;
+052B;CYRILLIC SMALL LETTER DZZHE;Ll;0;L;;;;;N;;;052A;;052A
+052C;CYRILLIC CAPITAL LETTER DCHE;Lu;0;L;;;;;N;;;;052D;
+052D;CYRILLIC SMALL LETTER DCHE;Ll;0;L;;;;;N;;;052C;;052C
+052E;CYRILLIC CAPITAL LETTER EL WITH DESCENDER;Lu;0;L;;;;;N;;;;052F;
+052F;CYRILLIC SMALL LETTER EL WITH DESCENDER;Ll;0;L;;;;;N;;;052E;;052E
+0531;ARMENIAN CAPITAL LETTER AYB;Lu;0;L;;;;;N;;;;0561;
+0532;ARMENIAN CAPITAL LETTER BEN;Lu;0;L;;;;;N;;;;0562;
+0533;ARMENIAN CAPITAL LETTER GIM;Lu;0;L;;;;;N;;;;0563;
+0534;ARMENIAN CAPITAL LETTER DA;Lu;0;L;;;;;N;;;;0564;
+0535;ARMENIAN CAPITAL LETTER ECH;Lu;0;L;;;;;N;;;;0565;
+0536;ARMENIAN CAPITAL LETTER ZA;Lu;0;L;;;;;N;;;;0566;
+0537;ARMENIAN CAPITAL LETTER EH;Lu;0;L;;;;;N;;;;0567;
+0538;ARMENIAN CAPITAL LETTER ET;Lu;0;L;;;;;N;;;;0568;
+0539;ARMENIAN CAPITAL LETTER TO;Lu;0;L;;;;;N;;;;0569;
+053A;ARMENIAN CAPITAL LETTER ZHE;Lu;0;L;;;;;N;;;;056A;
+053B;ARMENIAN CAPITAL LETTER INI;Lu;0;L;;;;;N;;;;056B;
+053C;ARMENIAN CAPITAL LETTER LIWN;Lu;0;L;;;;;N;;;;056C;
+053D;ARMENIAN CAPITAL LETTER XEH;Lu;0;L;;;;;N;;;;056D;
+053E;ARMENIAN CAPITAL LETTER CA;Lu;0;L;;;;;N;;;;056E;
+053F;ARMENIAN CAPITAL LETTER KEN;Lu;0;L;;;;;N;;;;056F;
+0540;ARMENIAN CAPITAL LETTER HO;Lu;0;L;;;;;N;;;;0570;
+0541;ARMENIAN CAPITAL LETTER JA;Lu;0;L;;;;;N;;;;0571;
+0542;ARMENIAN CAPITAL LETTER GHAD;Lu;0;L;;;;;N;ARMENIAN CAPITAL LETTER LAD;;;0572;
+0543;ARMENIAN CAPITAL LETTER CHEH;Lu;0;L;;;;;N;;;;0573;
+0544;ARMENIAN CAPITAL LETTER MEN;Lu;0;L;;;;;N;;;;0574;
+0545;ARMENIAN CAPITAL LETTER YI;Lu;0;L;;;;;N;;;;0575;
+0546;ARMENIAN CAPITAL LETTER NOW;Lu;0;L;;;;;N;;;;0576;
+0547;ARMENIAN CAPITAL LETTER SHA;Lu;0;L;;;;;N;;;;0577;
+0548;ARMENIAN CAPITAL LETTER VO;Lu;0;L;;;;;N;;;;0578;
+0549;ARMENIAN CAPITAL LETTER CHA;Lu;0;L;;;;;N;;;;0579;
+054A;ARMENIAN CAPITAL LETTER PEH;Lu;0;L;;;;;N;;;;057A;
+054B;ARMENIAN CAPITAL LETTER JHEH;Lu;0;L;;;;;N;;;;057B;
+054C;ARMENIAN CAPITAL LETTER RA;Lu;0;L;;;;;N;;;;057C;
+054D;ARMENIAN CAPITAL LETTER SEH;Lu;0;L;;;;;N;;;;057D;
+054E;ARMENIAN CAPITAL LETTER VEW;Lu;0;L;;;;;N;;;;057E;
+054F;ARMENIAN CAPITAL LETTER TIWN;Lu;0;L;;;;;N;;;;057F;
+0550;ARMENIAN CAPITAL LETTER REH;Lu;0;L;;;;;N;;;;0580;
+0551;ARMENIAN CAPITAL LETTER CO;Lu;0;L;;;;;N;;;;0581;
+0552;ARMENIAN CAPITAL LETTER YIWN;Lu;0;L;;;;;N;;;;0582;
+0553;ARMENIAN CAPITAL LETTER PIWR;Lu;0;L;;;;;N;;;;0583;
+0554;ARMENIAN CAPITAL LETTER KEH;Lu;0;L;;;;;N;;;;0584;
+0555;ARMENIAN CAPITAL LETTER OH;Lu;0;L;;;;;N;;;;0585;
+0556;ARMENIAN CAPITAL LETTER FEH;Lu;0;L;;;;;N;;;;0586;
+0559;ARMENIAN MODIFIER LETTER LEFT HALF RING;Lm;0;L;;;;;N;;;;;
+055A;ARMENIAN APOSTROPHE;Po;0;L;;;;;N;ARMENIAN MODIFIER LETTER RIGHT HALF RING;;;;
+055B;ARMENIAN EMPHASIS MARK;Po;0;L;;;;;N;;;;;
+055C;ARMENIAN EXCLAMATION MARK;Po;0;L;;;;;N;;;;;
+055D;ARMENIAN COMMA;Po;0;L;;;;;N;;;;;
+055E;ARMENIAN QUESTION MARK;Po;0;L;;;;;N;;;;;
+055F;ARMENIAN ABBREVIATION MARK;Po;0;L;;;;;N;;;;;
+0561;ARMENIAN SMALL LETTER AYB;Ll;0;L;;;;;N;;;0531;;0531
+0562;ARMENIAN SMALL LETTER BEN;Ll;0;L;;;;;N;;;0532;;0532
+0563;ARMENIAN SMALL LETTER GIM;Ll;0;L;;;;;N;;;0533;;0533
+0564;ARMENIAN SMALL LETTER DA;Ll;0;L;;;;;N;;;0534;;0534
+0565;ARMENIAN SMALL LETTER ECH;Ll;0;L;;;;;N;;;0535;;0535
+0566;ARMENIAN SMALL LETTER ZA;Ll;0;L;;;;;N;;;0536;;0536
+0567;ARMENIAN SMALL LETTER EH;Ll;0;L;;;;;N;;;0537;;0537
+0568;ARMENIAN SMALL LETTER ET;Ll;0;L;;;;;N;;;0538;;0538
+0569;ARMENIAN SMALL LETTER TO;Ll;0;L;;;;;N;;;0539;;0539
+056A;ARMENIAN SMALL LETTER ZHE;Ll;0;L;;;;;N;;;053A;;053A
+056B;ARMENIAN SMALL LETTER INI;Ll;0;L;;;;;N;;;053B;;053B
+056C;ARMENIAN SMALL LETTER LIWN;Ll;0;L;;;;;N;;;053C;;053C
+056D;ARMENIAN SMALL LETTER XEH;Ll;0;L;;;;;N;;;053D;;053D
+056E;ARMENIAN SMALL LETTER CA;Ll;0;L;;;;;N;;;053E;;053E
+056F;ARMENIAN SMALL LETTER KEN;Ll;0;L;;;;;N;;;053F;;053F
+0570;ARMENIAN SMALL LETTER HO;Ll;0;L;;;;;N;;;0540;;0540
+0571;ARMENIAN SMALL LETTER JA;Ll;0;L;;;;;N;;;0541;;0541
+0572;ARMENIAN SMALL LETTER GHAD;Ll;0;L;;;;;N;ARMENIAN SMALL LETTER LAD;;0542;;0542
+0573;ARMENIAN SMALL LETTER CHEH;Ll;0;L;;;;;N;;;0543;;0543
+0574;ARMENIAN SMALL LETTER MEN;Ll;0;L;;;;;N;;;0544;;0544
+0575;ARMENIAN SMALL LETTER YI;Ll;0;L;;;;;N;;;0545;;0545
+0576;ARMENIAN SMALL LETTER NOW;Ll;0;L;;;;;N;;;0546;;0546
+0577;ARMENIAN SMALL LETTER SHA;Ll;0;L;;;;;N;;;0547;;0547
+0578;ARMENIAN SMALL LETTER VO;Ll;0;L;;;;;N;;;0548;;0548
+0579;ARMENIAN SMALL LETTER CHA;Ll;0;L;;;;;N;;;0549;;0549
+057A;ARMENIAN SMALL LETTER PEH;Ll;0;L;;;;;N;;;054A;;054A
+057B;ARMENIAN SMALL LETTER JHEH;Ll;0;L;;;;;N;;;054B;;054B
+057C;ARMENIAN SMALL LETTER RA;Ll;0;L;;;;;N;;;054C;;054C
+057D;ARMENIAN SMALL LETTER SEH;Ll;0;L;;;;;N;;;054D;;054D
+057E;ARMENIAN SMALL LETTER VEW;Ll;0;L;;;;;N;;;054E;;054E
+057F;ARMENIAN SMALL LETTER TIWN;Ll;0;L;;;;;N;;;054F;;054F
+0580;ARMENIAN SMALL LETTER REH;Ll;0;L;;;;;N;;;0550;;0550
+0581;ARMENIAN SMALL LETTER CO;Ll;0;L;;;;;N;;;0551;;0551
+0582;ARMENIAN SMALL LETTER YIWN;Ll;0;L;;;;;N;;;0552;;0552
+0583;ARMENIAN SMALL LETTER PIWR;Ll;0;L;;;;;N;;;0553;;0553
+0584;ARMENIAN SMALL LETTER KEH;Ll;0;L;;;;;N;;;0554;;0554
+0585;ARMENIAN SMALL LETTER OH;Ll;0;L;;;;;N;;;0555;;0555
+0586;ARMENIAN SMALL LETTER FEH;Ll;0;L;;;;;N;;;0556;;0556
+0587;ARMENIAN SMALL LIGATURE ECH YIWN;Ll;0;L;<compat> 0565 0582;;;;N;;;;;
+0589;ARMENIAN FULL STOP;Po;0;L;;;;;N;ARMENIAN PERIOD;;;;
+058A;ARMENIAN HYPHEN;Pd;0;ON;;;;;N;;;;;
+058D;RIGHT-FACING ARMENIAN ETERNITY SIGN;So;0;ON;;;;;N;;;;;
+058E;LEFT-FACING ARMENIAN ETERNITY SIGN;So;0;ON;;;;;N;;;;;
+058F;ARMENIAN DRAM SIGN;Sc;0;ET;;;;;N;;;;;
+0591;HEBREW ACCENT ETNAHTA;Mn;220;NSM;;;;;N;;;;;
+0592;HEBREW ACCENT SEGOL;Mn;230;NSM;;;;;N;;;;;
+0593;HEBREW ACCENT SHALSHELET;Mn;230;NSM;;;;;N;;;;;
+0594;HEBREW ACCENT ZAQEF QATAN;Mn;230;NSM;;;;;N;;;;;
+0595;HEBREW ACCENT ZAQEF GADOL;Mn;230;NSM;;;;;N;;;;;
+0596;HEBREW ACCENT TIPEHA;Mn;220;NSM;;;;;N;;;;;
+0597;HEBREW ACCENT REVIA;Mn;230;NSM;;;;;N;;;;;
+0598;HEBREW ACCENT ZARQA;Mn;230;NSM;;;;;N;;;;;
+0599;HEBREW ACCENT PASHTA;Mn;230;NSM;;;;;N;;;;;
+059A;HEBREW ACCENT YETIV;Mn;222;NSM;;;;;N;;;;;
+059B;HEBREW ACCENT TEVIR;Mn;220;NSM;;;;;N;;;;;
+059C;HEBREW ACCENT GERESH;Mn;230;NSM;;;;;N;;;;;
+059D;HEBREW ACCENT GERESH MUQDAM;Mn;230;NSM;;;;;N;;;;;
+059E;HEBREW ACCENT GERSHAYIM;Mn;230;NSM;;;;;N;;;;;
+059F;HEBREW ACCENT QARNEY PARA;Mn;230;NSM;;;;;N;;;;;
+05A0;HEBREW ACCENT TELISHA GEDOLA;Mn;230;NSM;;;;;N;;;;;
+05A1;HEBREW ACCENT PAZER;Mn;230;NSM;;;;;N;;;;;
+05A2;HEBREW ACCENT ATNAH HAFUKH;Mn;220;NSM;;;;;N;;;;;
+05A3;HEBREW ACCENT MUNAH;Mn;220;NSM;;;;;N;;;;;
+05A4;HEBREW ACCENT MAHAPAKH;Mn;220;NSM;;;;;N;;;;;
+05A5;HEBREW ACCENT MERKHA;Mn;220;NSM;;;;;N;;;;;
+05A6;HEBREW ACCENT MERKHA KEFULA;Mn;220;NSM;;;;;N;;;;;
+05A7;HEBREW ACCENT DARGA;Mn;220;NSM;;;;;N;;;;;
+05A8;HEBREW ACCENT QADMA;Mn;230;NSM;;;;;N;;;;;
+05A9;HEBREW ACCENT TELISHA QETANA;Mn;230;NSM;;;;;N;;;;;
+05AA;HEBREW ACCENT YERAH BEN YOMO;Mn;220;NSM;;;;;N;;;;;
+05AB;HEBREW ACCENT OLE;Mn;230;NSM;;;;;N;;;;;
+05AC;HEBREW ACCENT ILUY;Mn;230;NSM;;;;;N;;;;;
+05AD;HEBREW ACCENT DEHI;Mn;222;NSM;;;;;N;;;;;
+05AE;HEBREW ACCENT ZINOR;Mn;228;NSM;;;;;N;;;;;
+05AF;HEBREW MARK MASORA CIRCLE;Mn;230;NSM;;;;;N;;;;;
+05B0;HEBREW POINT SHEVA;Mn;10;NSM;;;;;N;;;;;
+05B1;HEBREW POINT HATAF SEGOL;Mn;11;NSM;;;;;N;;;;;
+05B2;HEBREW POINT HATAF PATAH;Mn;12;NSM;;;;;N;;;;;
+05B3;HEBREW POINT HATAF QAMATS;Mn;13;NSM;;;;;N;;;;;
+05B4;HEBREW POINT HIRIQ;Mn;14;NSM;;;;;N;;;;;
+05B5;HEBREW POINT TSERE;Mn;15;NSM;;;;;N;;;;;
+05B6;HEBREW POINT SEGOL;Mn;16;NSM;;;;;N;;;;;
+05B7;HEBREW POINT PATAH;Mn;17;NSM;;;;;N;;;;;
+05B8;HEBREW POINT QAMATS;Mn;18;NSM;;;;;N;;;;;
+05B9;HEBREW POINT HOLAM;Mn;19;NSM;;;;;N;;;;;
+05BA;HEBREW POINT HOLAM HASER FOR VAV;Mn;19;NSM;;;;;N;;;;;
+05BB;HEBREW POINT QUBUTS;Mn;20;NSM;;;;;N;;;;;
+05BC;HEBREW POINT DAGESH OR MAPIQ;Mn;21;NSM;;;;;N;HEBREW POINT DAGESH;;;;
+05BD;HEBREW POINT METEG;Mn;22;NSM;;;;;N;;;;;
+05BE;HEBREW PUNCTUATION MAQAF;Pd;0;R;;;;;N;;;;;
+05BF;HEBREW POINT RAFE;Mn;23;NSM;;;;;N;;;;;
+05C0;HEBREW PUNCTUATION PASEQ;Po;0;R;;;;;N;HEBREW POINT PASEQ;;;;
+05C1;HEBREW POINT SHIN DOT;Mn;24;NSM;;;;;N;;;;;
+05C2;HEBREW POINT SIN DOT;Mn;25;NSM;;;;;N;;;;;
+05C3;HEBREW PUNCTUATION SOF PASUQ;Po;0;R;;;;;N;;;;;
+05C4;HEBREW MARK UPPER DOT;Mn;230;NSM;;;;;N;;;;;
+05C5;HEBREW MARK LOWER DOT;Mn;220;NSM;;;;;N;;;;;
+05C6;HEBREW PUNCTUATION NUN HAFUKHA;Po;0;R;;;;;N;;;;;
+05C7;HEBREW POINT QAMATS QATAN;Mn;18;NSM;;;;;N;;;;;
+05D0;HEBREW LETTER ALEF;Lo;0;R;;;;;N;;;;;
+05D1;HEBREW LETTER BET;Lo;0;R;;;;;N;;;;;
+05D2;HEBREW LETTER GIMEL;Lo;0;R;;;;;N;;;;;
+05D3;HEBREW LETTER DALET;Lo;0;R;;;;;N;;;;;
+05D4;HEBREW LETTER HE;Lo;0;R;;;;;N;;;;;
+05D5;HEBREW LETTER VAV;Lo;0;R;;;;;N;;;;;
+05D6;HEBREW LETTER ZAYIN;Lo;0;R;;;;;N;;;;;
+05D7;HEBREW LETTER HET;Lo;0;R;;;;;N;;;;;
+05D8;HEBREW LETTER TET;Lo;0;R;;;;;N;;;;;
+05D9;HEBREW LETTER YOD;Lo;0;R;;;;;N;;;;;
+05DA;HEBREW LETTER FINAL KAF;Lo;0;R;;;;;N;;;;;
+05DB;HEBREW LETTER KAF;Lo;0;R;;;;;N;;;;;
+05DC;HEBREW LETTER LAMED;Lo;0;R;;;;;N;;;;;
+05DD;HEBREW LETTER FINAL MEM;Lo;0;R;;;;;N;;;;;
+05DE;HEBREW LETTER MEM;Lo;0;R;;;;;N;;;;;
+05DF;HEBREW LETTER FINAL NUN;Lo;0;R;;;;;N;;;;;
+05E0;HEBREW LETTER NUN;Lo;0;R;;;;;N;;;;;
+05E1;HEBREW LETTER SAMEKH;Lo;0;R;;;;;N;;;;;
+05E2;HEBREW LETTER AYIN;Lo;0;R;;;;;N;;;;;
+05E3;HEBREW LETTER FINAL PE;Lo;0;R;;;;;N;;;;;
+05E4;HEBREW LETTER PE;Lo;0;R;;;;;N;;;;;
+05E5;HEBREW LETTER FINAL TSADI;Lo;0;R;;;;;N;;;;;
+05E6;HEBREW LETTER TSADI;Lo;0;R;;;;;N;;;;;
+05E7;HEBREW LETTER QOF;Lo;0;R;;;;;N;;;;;
+05E8;HEBREW LETTER RESH;Lo;0;R;;;;;N;;;;;
+05E9;HEBREW LETTER SHIN;Lo;0;R;;;;;N;;;;;
+05EA;HEBREW LETTER TAV;Lo;0;R;;;;;N;;;;;
+05F0;HEBREW LIGATURE YIDDISH DOUBLE VAV;Lo;0;R;;;;;N;HEBREW LETTER DOUBLE VAV;;;;
+05F1;HEBREW LIGATURE YIDDISH VAV YOD;Lo;0;R;;;;;N;HEBREW LETTER VAV YOD;;;;
+05F2;HEBREW LIGATURE YIDDISH DOUBLE YOD;Lo;0;R;;;;;N;HEBREW LETTER DOUBLE YOD;;;;
+05F3;HEBREW PUNCTUATION GERESH;Po;0;R;;;;;N;;;;;
+05F4;HEBREW PUNCTUATION GERSHAYIM;Po;0;R;;;;;N;;;;;
+0600;ARABIC NUMBER SIGN;Cf;0;AN;;;;;N;;;;;
+0601;ARABIC SIGN SANAH;Cf;0;AN;;;;;N;;;;;
+0602;ARABIC FOOTNOTE MARKER;Cf;0;AN;;;;;N;;;;;
+0603;ARABIC SIGN SAFHA;Cf;0;AN;;;;;N;;;;;
+0604;ARABIC SIGN SAMVAT;Cf;0;AN;;;;;N;;;;;
+0605;ARABIC NUMBER MARK ABOVE;Cf;0;AN;;;;;N;;;;;
+0606;ARABIC-INDIC CUBE ROOT;Sm;0;ON;;;;;N;;;;;
+0607;ARABIC-INDIC FOURTH ROOT;Sm;0;ON;;;;;N;;;;;
+0608;ARABIC RAY;Sm;0;AL;;;;;N;;;;;
+0609;ARABIC-INDIC PER MILLE SIGN;Po;0;ET;;;;;N;;;;;
+060A;ARABIC-INDIC PER TEN THOUSAND SIGN;Po;0;ET;;;;;N;;;;;
+060B;AFGHANI SIGN;Sc;0;AL;;;;;N;;;;;
+060C;ARABIC COMMA;Po;0;CS;;;;;N;;;;;
+060D;ARABIC DATE SEPARATOR;Po;0;AL;;;;;N;;;;;
+060E;ARABIC POETIC VERSE SIGN;So;0;ON;;;;;N;;;;;
+060F;ARABIC SIGN MISRA;So;0;ON;;;;;N;;;;;
+0610;ARABIC SIGN SALLALLAHOU ALAYHE WASSALLAM;Mn;230;NSM;;;;;N;;;;;
+0611;ARABIC SIGN ALAYHE ASSALLAM;Mn;230;NSM;;;;;N;;;;;
+0612;ARABIC SIGN RAHMATULLAH ALAYHE;Mn;230;NSM;;;;;N;;;;;
+0613;ARABIC SIGN RADI ALLAHOU ANHU;Mn;230;NSM;;;;;N;;;;;
+0614;ARABIC SIGN TAKHALLUS;Mn;230;NSM;;;;;N;;;;;
+0615;ARABIC SMALL HIGH TAH;Mn;230;NSM;;;;;N;;;;;
+0616;ARABIC SMALL HIGH LIGATURE ALEF WITH LAM WITH YEH;Mn;230;NSM;;;;;N;;;;;
+0617;ARABIC SMALL HIGH ZAIN;Mn;230;NSM;;;;;N;;;;;
+0618;ARABIC SMALL FATHA;Mn;30;NSM;;;;;N;;;;;
+0619;ARABIC SMALL DAMMA;Mn;31;NSM;;;;;N;;;;;
+061A;ARABIC SMALL KASRA;Mn;32;NSM;;;;;N;;;;;
+061B;ARABIC SEMICOLON;Po;0;AL;;;;;N;;;;;
+061C;ARABIC LETTER MARK;Cf;0;AL;;;;;N;;;;;
+061E;ARABIC TRIPLE DOT PUNCTUATION MARK;Po;0;AL;;;;;N;;;;;
+061F;ARABIC QUESTION MARK;Po;0;AL;;;;;N;;;;;
+0620;ARABIC LETTER KASHMIRI YEH;Lo;0;AL;;;;;N;;;;;
+0621;ARABIC LETTER HAMZA;Lo;0;AL;;;;;N;ARABIC LETTER HAMZAH;;;;
+0622;ARABIC LETTER ALEF WITH MADDA ABOVE;Lo;0;AL;0627 0653;;;;N;ARABIC LETTER MADDAH ON ALEF;;;;
+0623;ARABIC LETTER ALEF WITH HAMZA ABOVE;Lo;0;AL;0627 0654;;;;N;ARABIC LETTER HAMZAH ON ALEF;;;;
+0624;ARABIC LETTER WAW WITH HAMZA ABOVE;Lo;0;AL;0648 0654;;;;N;ARABIC LETTER HAMZAH ON WAW;;;;
+0625;ARABIC LETTER ALEF WITH HAMZA BELOW;Lo;0;AL;0627 0655;;;;N;ARABIC LETTER HAMZAH UNDER ALEF;;;;
+0626;ARABIC LETTER YEH WITH HAMZA ABOVE;Lo;0;AL;064A 0654;;;;N;ARABIC LETTER HAMZAH ON YA;;;;
+0627;ARABIC LETTER ALEF;Lo;0;AL;;;;;N;;;;;
+0628;ARABIC LETTER BEH;Lo;0;AL;;;;;N;ARABIC LETTER BAA;;;;
+0629;ARABIC LETTER TEH MARBUTA;Lo;0;AL;;;;;N;ARABIC LETTER TAA MARBUTAH;;;;
+062A;ARABIC LETTER TEH;Lo;0;AL;;;;;N;ARABIC LETTER TAA;;;;
+062B;ARABIC LETTER THEH;Lo;0;AL;;;;;N;ARABIC LETTER THAA;;;;
+062C;ARABIC LETTER JEEM;Lo;0;AL;;;;;N;;;;;
+062D;ARABIC LETTER HAH;Lo;0;AL;;;;;N;ARABIC LETTER HAA;;;;
+062E;ARABIC LETTER KHAH;Lo;0;AL;;;;;N;ARABIC LETTER KHAA;;;;
+062F;ARABIC LETTER DAL;Lo;0;AL;;;;;N;;;;;
+0630;ARABIC LETTER THAL;Lo;0;AL;;;;;N;;;;;
+0631;ARABIC LETTER REH;Lo;0;AL;;;;;N;ARABIC LETTER RA;;;;
+0632;ARABIC LETTER ZAIN;Lo;0;AL;;;;;N;;;;;
+0633;ARABIC LETTER SEEN;Lo;0;AL;;;;;N;;;;;
+0634;ARABIC LETTER SHEEN;Lo;0;AL;;;;;N;;;;;
+0635;ARABIC LETTER SAD;Lo;0;AL;;;;;N;;;;;
+0636;ARABIC LETTER DAD;Lo;0;AL;;;;;N;;;;;
+0637;ARABIC LETTER TAH;Lo;0;AL;;;;;N;;;;;
+0638;ARABIC LETTER ZAH;Lo;0;AL;;;;;N;ARABIC LETTER DHAH;;;;
+0639;ARABIC LETTER AIN;Lo;0;AL;;;;;N;;;;;
+063A;ARABIC LETTER GHAIN;Lo;0;AL;;;;;N;;;;;
+063B;ARABIC LETTER KEHEH WITH TWO DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+063C;ARABIC LETTER KEHEH WITH THREE DOTS BELOW;Lo;0;AL;;;;;N;;;;;
+063D;ARABIC LETTER FARSI YEH WITH INVERTED V;Lo;0;AL;;;;;N;;;;;
+063E;ARABIC LETTER FARSI YEH WITH TWO DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+063F;ARABIC LETTER FARSI YEH WITH THREE DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+0640;ARABIC TATWEEL;Lm;0;AL;;;;;N;;;;;
+0641;ARABIC LETTER FEH;Lo;0;AL;;;;;N;ARABIC LETTER FA;;;;
+0642;ARABIC LETTER QAF;Lo;0;AL;;;;;N;;;;;
+0643;ARABIC LETTER KAF;Lo;0;AL;;;;;N;ARABIC LETTER CAF;;;;
+0644;ARABIC LETTER LAM;Lo;0;AL;;;;;N;;;;;
+0645;ARABIC LETTER MEEM;Lo;0;AL;;;;;N;;;;;
+0646;ARABIC LETTER NOON;Lo;0;AL;;;;;N;;;;;
+0647;ARABIC LETTER HEH;Lo;0;AL;;;;;N;ARABIC LETTER HA;;;;
+0648;ARABIC LETTER WAW;Lo;0;AL;;;;;N;;;;;
+0649;ARABIC LETTER ALEF MAKSURA;Lo;0;AL;;;;;N;ARABIC LETTER ALEF MAQSURAH;;;;
+064A;ARABIC LETTER YEH;Lo;0;AL;;;;;N;ARABIC LETTER YA;;;;
+064B;ARABIC FATHATAN;Mn;27;NSM;;;;;N;;;;;
+064C;ARABIC DAMMATAN;Mn;28;NSM;;;;;N;;;;;
+064D;ARABIC KASRATAN;Mn;29;NSM;;;;;N;;;;;
+064E;ARABIC FATHA;Mn;30;NSM;;;;;N;ARABIC FATHAH;;;;
+064F;ARABIC DAMMA;Mn;31;NSM;;;;;N;ARABIC DAMMAH;;;;
+0650;ARABIC KASRA;Mn;32;NSM;;;;;N;ARABIC KASRAH;;;;
+0651;ARABIC SHADDA;Mn;33;NSM;;;;;N;ARABIC SHADDAH;;;;
+0652;ARABIC SUKUN;Mn;34;NSM;;;;;N;;;;;
+0653;ARABIC MADDAH ABOVE;Mn;230;NSM;;;;;N;;;;;
+0654;ARABIC HAMZA ABOVE;Mn;230;NSM;;;;;N;;;;;
+0655;ARABIC HAMZA BELOW;Mn;220;NSM;;;;;N;;;;;
+0656;ARABIC SUBSCRIPT ALEF;Mn;220;NSM;;;;;N;;;;;
+0657;ARABIC INVERTED DAMMA;Mn;230;NSM;;;;;N;;;;;
+0658;ARABIC MARK NOON GHUNNA;Mn;230;NSM;;;;;N;;;;;
+0659;ARABIC ZWARAKAY;Mn;230;NSM;;;;;N;;;;;
+065A;ARABIC VOWEL SIGN SMALL V ABOVE;Mn;230;NSM;;;;;N;;;;;
+065B;ARABIC VOWEL SIGN INVERTED SMALL V ABOVE;Mn;230;NSM;;;;;N;;;;;
+065C;ARABIC VOWEL SIGN DOT BELOW;Mn;220;NSM;;;;;N;;;;;
+065D;ARABIC REVERSED DAMMA;Mn;230;NSM;;;;;N;;;;;
+065E;ARABIC FATHA WITH TWO DOTS;Mn;230;NSM;;;;;N;;;;;
+065F;ARABIC WAVY HAMZA BELOW;Mn;220;NSM;;;;;N;;;;;
+0660;ARABIC-INDIC DIGIT ZERO;Nd;0;AN;;0;0;0;N;;;;;
+0661;ARABIC-INDIC DIGIT ONE;Nd;0;AN;;1;1;1;N;;;;;
+0662;ARABIC-INDIC DIGIT TWO;Nd;0;AN;;2;2;2;N;;;;;
+0663;ARABIC-INDIC DIGIT THREE;Nd;0;AN;;3;3;3;N;;;;;
+0664;ARABIC-INDIC DIGIT FOUR;Nd;0;AN;;4;4;4;N;;;;;
+0665;ARABIC-INDIC DIGIT FIVE;Nd;0;AN;;5;5;5;N;;;;;
+0666;ARABIC-INDIC DIGIT SIX;Nd;0;AN;;6;6;6;N;;;;;
+0667;ARABIC-INDIC DIGIT SEVEN;Nd;0;AN;;7;7;7;N;;;;;
+0668;ARABIC-INDIC DIGIT EIGHT;Nd;0;AN;;8;8;8;N;;;;;
+0669;ARABIC-INDIC DIGIT NINE;Nd;0;AN;;9;9;9;N;;;;;
+066A;ARABIC PERCENT SIGN;Po;0;ET;;;;;N;;;;;
+066B;ARABIC DECIMAL SEPARATOR;Po;0;AN;;;;;N;;;;;
+066C;ARABIC THOUSANDS SEPARATOR;Po;0;AN;;;;;N;;;;;
+066D;ARABIC FIVE POINTED STAR;Po;0;AL;;;;;N;;;;;
+066E;ARABIC LETTER DOTLESS BEH;Lo;0;AL;;;;;N;;;;;
+066F;ARABIC LETTER DOTLESS QAF;Lo;0;AL;;;;;N;;;;;
+0670;ARABIC LETTER SUPERSCRIPT ALEF;Mn;35;NSM;;;;;N;ARABIC ALEF ABOVE;;;;
+0671;ARABIC LETTER ALEF WASLA;Lo;0;AL;;;;;N;ARABIC LETTER HAMZAT WASL ON ALEF;;;;
+0672;ARABIC LETTER ALEF WITH WAVY HAMZA ABOVE;Lo;0;AL;;;;;N;ARABIC LETTER WAVY HAMZAH ON ALEF;;;;
+0673;ARABIC LETTER ALEF WITH WAVY HAMZA BELOW;Lo;0;AL;;;;;N;ARABIC LETTER WAVY HAMZAH UNDER ALEF;;;;
+0674;ARABIC LETTER HIGH HAMZA;Lo;0;AL;;;;;N;ARABIC LETTER HIGH HAMZAH;;;;
+0675;ARABIC LETTER HIGH HAMZA ALEF;Lo;0;AL;<compat> 0627 0674;;;;N;ARABIC LETTER HIGH HAMZAH ALEF;;;;
+0676;ARABIC LETTER HIGH HAMZA WAW;Lo;0;AL;<compat> 0648 0674;;;;N;ARABIC LETTER HIGH HAMZAH WAW;;;;
+0677;ARABIC LETTER U WITH HAMZA ABOVE;Lo;0;AL;<compat> 06C7 0674;;;;N;ARABIC LETTER HIGH HAMZAH WAW WITH DAMMAH;;;;
+0678;ARABIC LETTER HIGH HAMZA YEH;Lo;0;AL;<compat> 064A 0674;;;;N;ARABIC LETTER HIGH HAMZAH YA;;;;
+0679;ARABIC LETTER TTEH;Lo;0;AL;;;;;N;ARABIC LETTER TAA WITH SMALL TAH;;;;
+067A;ARABIC LETTER TTEHEH;Lo;0;AL;;;;;N;ARABIC LETTER TAA WITH TWO DOTS VERTICAL ABOVE;;;;
+067B;ARABIC LETTER BEEH;Lo;0;AL;;;;;N;ARABIC LETTER BAA WITH TWO DOTS VERTICAL BELOW;;;;
+067C;ARABIC LETTER TEH WITH RING;Lo;0;AL;;;;;N;ARABIC LETTER TAA WITH RING;;;;
+067D;ARABIC LETTER TEH WITH THREE DOTS ABOVE DOWNWARDS;Lo;0;AL;;;;;N;ARABIC LETTER TAA WITH THREE DOTS ABOVE DOWNWARD;;;;
+067E;ARABIC LETTER PEH;Lo;0;AL;;;;;N;ARABIC LETTER TAA WITH THREE DOTS BELOW;;;;
+067F;ARABIC LETTER TEHEH;Lo;0;AL;;;;;N;ARABIC LETTER TAA WITH FOUR DOTS ABOVE;;;;
+0680;ARABIC LETTER BEHEH;Lo;0;AL;;;;;N;ARABIC LETTER BAA WITH FOUR DOTS BELOW;;;;
+0681;ARABIC LETTER HAH WITH HAMZA ABOVE;Lo;0;AL;;;;;N;ARABIC LETTER HAMZAH ON HAA;;;;
+0682;ARABIC LETTER HAH WITH TWO DOTS VERTICAL ABOVE;Lo;0;AL;;;;;N;ARABIC LETTER HAA WITH TWO DOTS VERTICAL ABOVE;;;;
+0683;ARABIC LETTER NYEH;Lo;0;AL;;;;;N;ARABIC LETTER HAA WITH MIDDLE TWO DOTS;;;;
+0684;ARABIC LETTER DYEH;Lo;0;AL;;;;;N;ARABIC LETTER HAA WITH MIDDLE TWO DOTS VERTICAL;;;;
+0685;ARABIC LETTER HAH WITH THREE DOTS ABOVE;Lo;0;AL;;;;;N;ARABIC LETTER HAA WITH THREE DOTS ABOVE;;;;
+0686;ARABIC LETTER TCHEH;Lo;0;AL;;;;;N;ARABIC LETTER HAA WITH MIDDLE THREE DOTS DOWNWARD;;;;
+0687;ARABIC LETTER TCHEHEH;Lo;0;AL;;;;;N;ARABIC LETTER HAA WITH MIDDLE FOUR DOTS;;;;
+0688;ARABIC LETTER DDAL;Lo;0;AL;;;;;N;ARABIC LETTER DAL WITH SMALL TAH;;;;
+0689;ARABIC LETTER DAL WITH RING;Lo;0;AL;;;;;N;;;;;
+068A;ARABIC LETTER DAL WITH DOT BELOW;Lo;0;AL;;;;;N;;;;;
+068B;ARABIC LETTER DAL WITH DOT BELOW AND SMALL TAH;Lo;0;AL;;;;;N;;;;;
+068C;ARABIC LETTER DAHAL;Lo;0;AL;;;;;N;ARABIC LETTER DAL WITH TWO DOTS ABOVE;;;;
+068D;ARABIC LETTER DDAHAL;Lo;0;AL;;;;;N;ARABIC LETTER DAL WITH TWO DOTS BELOW;;;;
+068E;ARABIC LETTER DUL;Lo;0;AL;;;;;N;ARABIC LETTER DAL WITH THREE DOTS ABOVE;;;;
+068F;ARABIC LETTER DAL WITH THREE DOTS ABOVE DOWNWARDS;Lo;0;AL;;;;;N;ARABIC LETTER DAL WITH THREE DOTS ABOVE DOWNWARD;;;;
+0690;ARABIC LETTER DAL WITH FOUR DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+0691;ARABIC LETTER RREH;Lo;0;AL;;;;;N;ARABIC LETTER RA WITH SMALL TAH;;;;
+0692;ARABIC LETTER REH WITH SMALL V;Lo;0;AL;;;;;N;ARABIC LETTER RA WITH SMALL V;;;;
+0693;ARABIC LETTER REH WITH RING;Lo;0;AL;;;;;N;ARABIC LETTER RA WITH RING;;;;
+0694;ARABIC LETTER REH WITH DOT BELOW;Lo;0;AL;;;;;N;ARABIC LETTER RA WITH DOT BELOW;;;;
+0695;ARABIC LETTER REH WITH SMALL V BELOW;Lo;0;AL;;;;;N;ARABIC LETTER RA WITH SMALL V BELOW;;;;
+0696;ARABIC LETTER REH WITH DOT BELOW AND DOT ABOVE;Lo;0;AL;;;;;N;ARABIC LETTER RA WITH DOT BELOW AND DOT ABOVE;;;;
+0697;ARABIC LETTER REH WITH TWO DOTS ABOVE;Lo;0;AL;;;;;N;ARABIC LETTER RA WITH TWO DOTS ABOVE;;;;
+0698;ARABIC LETTER JEH;Lo;0;AL;;;;;N;ARABIC LETTER RA WITH THREE DOTS ABOVE;;;;
+0699;ARABIC LETTER REH WITH FOUR DOTS ABOVE;Lo;0;AL;;;;;N;ARABIC LETTER RA WITH FOUR DOTS ABOVE;;;;
+069A;ARABIC LETTER SEEN WITH DOT BELOW AND DOT ABOVE;Lo;0;AL;;;;;N;;;;;
+069B;ARABIC LETTER SEEN WITH THREE DOTS BELOW;Lo;0;AL;;;;;N;;;;;
+069C;ARABIC LETTER SEEN WITH THREE DOTS BELOW AND THREE DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+069D;ARABIC LETTER SAD WITH TWO DOTS BELOW;Lo;0;AL;;;;;N;;;;;
+069E;ARABIC LETTER SAD WITH THREE DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+069F;ARABIC LETTER TAH WITH THREE DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+06A0;ARABIC LETTER AIN WITH THREE DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+06A1;ARABIC LETTER DOTLESS FEH;Lo;0;AL;;;;;N;ARABIC LETTER DOTLESS FA;;;;
+06A2;ARABIC LETTER FEH WITH DOT MOVED BELOW;Lo;0;AL;;;;;N;ARABIC LETTER FA WITH DOT MOVED BELOW;;;;
+06A3;ARABIC LETTER FEH WITH DOT BELOW;Lo;0;AL;;;;;N;ARABIC LETTER FA WITH DOT BELOW;;;;
+06A4;ARABIC LETTER VEH;Lo;0;AL;;;;;N;ARABIC LETTER FA WITH THREE DOTS ABOVE;;;;
+06A5;ARABIC LETTER FEH WITH THREE DOTS BELOW;Lo;0;AL;;;;;N;ARABIC LETTER FA WITH THREE DOTS BELOW;;;;
+06A6;ARABIC LETTER PEHEH;Lo;0;AL;;;;;N;ARABIC LETTER FA WITH FOUR DOTS ABOVE;;;;
+06A7;ARABIC LETTER QAF WITH DOT ABOVE;Lo;0;AL;;;;;N;;;;;
+06A8;ARABIC LETTER QAF WITH THREE DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+06A9;ARABIC LETTER KEHEH;Lo;0;AL;;;;;N;ARABIC LETTER OPEN CAF;;;;
+06AA;ARABIC LETTER SWASH KAF;Lo;0;AL;;;;;N;ARABIC LETTER SWASH CAF;;;;
+06AB;ARABIC LETTER KAF WITH RING;Lo;0;AL;;;;;N;ARABIC LETTER CAF WITH RING;;;;
+06AC;ARABIC LETTER KAF WITH DOT ABOVE;Lo;0;AL;;;;;N;ARABIC LETTER CAF WITH DOT ABOVE;;;;
+06AD;ARABIC LETTER NG;Lo;0;AL;;;;;N;ARABIC LETTER CAF WITH THREE DOTS ABOVE;;;;
+06AE;ARABIC LETTER KAF WITH THREE DOTS BELOW;Lo;0;AL;;;;;N;ARABIC LETTER CAF WITH THREE DOTS BELOW;;;;
+06AF;ARABIC LETTER GAF;Lo;0;AL;;;;;N;;;;;
+06B0;ARABIC LETTER GAF WITH RING;Lo;0;AL;;;;;N;;;;;
+06B1;ARABIC LETTER NGOEH;Lo;0;AL;;;;;N;ARABIC LETTER GAF WITH TWO DOTS ABOVE;;;;
+06B2;ARABIC LETTER GAF WITH TWO DOTS BELOW;Lo;0;AL;;;;;N;;;;;
+06B3;ARABIC LETTER GUEH;Lo;0;AL;;;;;N;ARABIC LETTER GAF WITH TWO DOTS VERTICAL BELOW;;;;
+06B4;ARABIC LETTER GAF WITH THREE DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+06B5;ARABIC LETTER LAM WITH SMALL V;Lo;0;AL;;;;;N;;;;;
+06B6;ARABIC LETTER LAM WITH DOT ABOVE;Lo;0;AL;;;;;N;;;;;
+06B7;ARABIC LETTER LAM WITH THREE DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+06B8;ARABIC LETTER LAM WITH THREE DOTS BELOW;Lo;0;AL;;;;;N;;;;;
+06B9;ARABIC LETTER NOON WITH DOT BELOW;Lo;0;AL;;;;;N;;;;;
+06BA;ARABIC LETTER NOON GHUNNA;Lo;0;AL;;;;;N;ARABIC LETTER DOTLESS NOON;;;;
+06BB;ARABIC LETTER RNOON;Lo;0;AL;;;;;N;ARABIC LETTER DOTLESS NOON WITH SMALL TAH;;;;
+06BC;ARABIC LETTER NOON WITH RING;Lo;0;AL;;;;;N;;;;;
+06BD;ARABIC LETTER NOON WITH THREE DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+06BE;ARABIC LETTER HEH DOACHASHMEE;Lo;0;AL;;;;;N;ARABIC LETTER KNOTTED HA;;;;
+06BF;ARABIC LETTER TCHEH WITH DOT ABOVE;Lo;0;AL;;;;;N;;;;;
+06C0;ARABIC LETTER HEH WITH YEH ABOVE;Lo;0;AL;06D5 0654;;;;N;ARABIC LETTER HAMZAH ON HA;;;;
+06C1;ARABIC LETTER HEH GOAL;Lo;0;AL;;;;;N;ARABIC LETTER HA GOAL;;;;
+06C2;ARABIC LETTER HEH GOAL WITH HAMZA ABOVE;Lo;0;AL;06C1 0654;;;;N;ARABIC LETTER HAMZAH ON HA GOAL;;;;
+06C3;ARABIC LETTER TEH MARBUTA GOAL;Lo;0;AL;;;;;N;ARABIC LETTER TAA MARBUTAH GOAL;;;;
+06C4;ARABIC LETTER WAW WITH RING;Lo;0;AL;;;;;N;;;;;
+06C5;ARABIC LETTER KIRGHIZ OE;Lo;0;AL;;;;;N;ARABIC LETTER WAW WITH BAR;;;;
+06C6;ARABIC LETTER OE;Lo;0;AL;;;;;N;ARABIC LETTER WAW WITH SMALL V;;;;
+06C7;ARABIC LETTER U;Lo;0;AL;;;;;N;ARABIC LETTER WAW WITH DAMMAH;;;;
+06C8;ARABIC LETTER YU;Lo;0;AL;;;;;N;ARABIC LETTER WAW WITH ALEF ABOVE;;;;
+06C9;ARABIC LETTER KIRGHIZ YU;Lo;0;AL;;;;;N;ARABIC LETTER WAW WITH INVERTED SMALL V;;;;
+06CA;ARABIC LETTER WAW WITH TWO DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+06CB;ARABIC LETTER VE;Lo;0;AL;;;;;N;ARABIC LETTER WAW WITH THREE DOTS ABOVE;;;;
+06CC;ARABIC LETTER FARSI YEH;Lo;0;AL;;;;;N;ARABIC LETTER DOTLESS YA;;;;
+06CD;ARABIC LETTER YEH WITH TAIL;Lo;0;AL;;;;;N;ARABIC LETTER YA WITH TAIL;;;;
+06CE;ARABIC LETTER YEH WITH SMALL V;Lo;0;AL;;;;;N;ARABIC LETTER YA WITH SMALL V;;;;
+06CF;ARABIC LETTER WAW WITH DOT ABOVE;Lo;0;AL;;;;;N;;;;;
+06D0;ARABIC LETTER E;Lo;0;AL;;;;;N;ARABIC LETTER YA WITH TWO DOTS VERTICAL BELOW;;;;
+06D1;ARABIC LETTER YEH WITH THREE DOTS BELOW;Lo;0;AL;;;;;N;ARABIC LETTER YA WITH THREE DOTS BELOW;;;;
+06D2;ARABIC LETTER YEH BARREE;Lo;0;AL;;;;;N;ARABIC LETTER YA BARREE;;;;
+06D3;ARABIC LETTER YEH BARREE WITH HAMZA ABOVE;Lo;0;AL;06D2 0654;;;;N;ARABIC LETTER HAMZAH ON YA BARREE;;;;
+06D4;ARABIC FULL STOP;Po;0;AL;;;;;N;ARABIC PERIOD;;;;
+06D5;ARABIC LETTER AE;Lo;0;AL;;;;;N;;;;;
+06D6;ARABIC SMALL HIGH LIGATURE SAD WITH LAM WITH ALEF MAKSURA;Mn;230;NSM;;;;;N;;;;;
+06D7;ARABIC SMALL HIGH LIGATURE QAF WITH LAM WITH ALEF MAKSURA;Mn;230;NSM;;;;;N;;;;;
+06D8;ARABIC SMALL HIGH MEEM INITIAL FORM;Mn;230;NSM;;;;;N;;;;;
+06D9;ARABIC SMALL HIGH LAM ALEF;Mn;230;NSM;;;;;N;;;;;
+06DA;ARABIC SMALL HIGH JEEM;Mn;230;NSM;;;;;N;;;;;
+06DB;ARABIC SMALL HIGH THREE DOTS;Mn;230;NSM;;;;;N;;;;;
+06DC;ARABIC SMALL HIGH SEEN;Mn;230;NSM;;;;;N;;;;;
+06DD;ARABIC END OF AYAH;Cf;0;AN;;;;;N;;;;;
+06DE;ARABIC START OF RUB EL HIZB;So;0;ON;;;;;N;;;;;
+06DF;ARABIC SMALL HIGH ROUNDED ZERO;Mn;230;NSM;;;;;N;;;;;
+06E0;ARABIC SMALL HIGH UPRIGHT RECTANGULAR ZERO;Mn;230;NSM;;;;;N;;;;;
+06E1;ARABIC SMALL HIGH DOTLESS HEAD OF KHAH;Mn;230;NSM;;;;;N;;;;;
+06E2;ARABIC SMALL HIGH MEEM ISOLATED FORM;Mn;230;NSM;;;;;N;;;;;
+06E3;ARABIC SMALL LOW SEEN;Mn;220;NSM;;;;;N;;;;;
+06E4;ARABIC SMALL HIGH MADDA;Mn;230;NSM;;;;;N;;;;;
+06E5;ARABIC SMALL WAW;Lm;0;AL;;;;;N;;;;;
+06E6;ARABIC SMALL YEH;Lm;0;AL;;;;;N;;;;;
+06E7;ARABIC SMALL HIGH YEH;Mn;230;NSM;;;;;N;;;;;
+06E8;ARABIC SMALL HIGH NOON;Mn;230;NSM;;;;;N;;;;;
+06E9;ARABIC PLACE OF SAJDAH;So;0;ON;;;;;N;;;;;
+06EA;ARABIC EMPTY CENTRE LOW STOP;Mn;220;NSM;;;;;N;;;;;
+06EB;ARABIC EMPTY CENTRE HIGH STOP;Mn;230;NSM;;;;;N;;;;;
+06EC;ARABIC ROUNDED HIGH STOP WITH FILLED CENTRE;Mn;230;NSM;;;;;N;;;;;
+06ED;ARABIC SMALL LOW MEEM;Mn;220;NSM;;;;;N;;;;;
+06EE;ARABIC LETTER DAL WITH INVERTED V;Lo;0;AL;;;;;N;;;;;
+06EF;ARABIC LETTER REH WITH INVERTED V;Lo;0;AL;;;;;N;;;;;
+06F0;EXTENDED ARABIC-INDIC DIGIT ZERO;Nd;0;EN;;0;0;0;N;EASTERN ARABIC-INDIC DIGIT ZERO;;;;
+06F1;EXTENDED ARABIC-INDIC DIGIT ONE;Nd;0;EN;;1;1;1;N;EASTERN ARABIC-INDIC DIGIT ONE;;;;
+06F2;EXTENDED ARABIC-INDIC DIGIT TWO;Nd;0;EN;;2;2;2;N;EASTERN ARABIC-INDIC DIGIT TWO;;;;
+06F3;EXTENDED ARABIC-INDIC DIGIT THREE;Nd;0;EN;;3;3;3;N;EASTERN ARABIC-INDIC DIGIT THREE;;;;
+06F4;EXTENDED ARABIC-INDIC DIGIT FOUR;Nd;0;EN;;4;4;4;N;EASTERN ARABIC-INDIC DIGIT FOUR;;;;
+06F5;EXTENDED ARABIC-INDIC DIGIT FIVE;Nd;0;EN;;5;5;5;N;EASTERN ARABIC-INDIC DIGIT FIVE;;;;
+06F6;EXTENDED ARABIC-INDIC DIGIT SIX;Nd;0;EN;;6;6;6;N;EASTERN ARABIC-INDIC DIGIT SIX;;;;
+06F7;EXTENDED ARABIC-INDIC DIGIT SEVEN;Nd;0;EN;;7;7;7;N;EASTERN ARABIC-INDIC DIGIT SEVEN;;;;
+06F8;EXTENDED ARABIC-INDIC DIGIT EIGHT;Nd;0;EN;;8;8;8;N;EASTERN ARABIC-INDIC DIGIT EIGHT;;;;
+06F9;EXTENDED ARABIC-INDIC DIGIT NINE;Nd;0;EN;;9;9;9;N;EASTERN ARABIC-INDIC DIGIT NINE;;;;
+06FA;ARABIC LETTER SHEEN WITH DOT BELOW;Lo;0;AL;;;;;N;;;;;
+06FB;ARABIC LETTER DAD WITH DOT BELOW;Lo;0;AL;;;;;N;;;;;
+06FC;ARABIC LETTER GHAIN WITH DOT BELOW;Lo;0;AL;;;;;N;;;;;
+06FD;ARABIC SIGN SINDHI AMPERSAND;So;0;AL;;;;;N;;;;;
+06FE;ARABIC SIGN SINDHI POSTPOSITION MEN;So;0;AL;;;;;N;;;;;
+06FF;ARABIC LETTER HEH WITH INVERTED V;Lo;0;AL;;;;;N;;;;;
+0700;SYRIAC END OF PARAGRAPH;Po;0;AL;;;;;N;;;;;
+0701;SYRIAC SUPRALINEAR FULL STOP;Po;0;AL;;;;;N;;;;;
+0702;SYRIAC SUBLINEAR FULL STOP;Po;0;AL;;;;;N;;;;;
+0703;SYRIAC SUPRALINEAR COLON;Po;0;AL;;;;;N;;;;;
+0704;SYRIAC SUBLINEAR COLON;Po;0;AL;;;;;N;;;;;
+0705;SYRIAC HORIZONTAL COLON;Po;0;AL;;;;;N;;;;;
+0706;SYRIAC COLON SKEWED LEFT;Po;0;AL;;;;;N;;;;;
+0707;SYRIAC COLON SKEWED RIGHT;Po;0;AL;;;;;N;;;;;
+0708;SYRIAC SUPRALINEAR COLON SKEWED LEFT;Po;0;AL;;;;;N;;;;;
+0709;SYRIAC SUBLINEAR COLON SKEWED RIGHT;Po;0;AL;;;;;N;;;;;
+070A;SYRIAC CONTRACTION;Po;0;AL;;;;;N;;;;;
+070B;SYRIAC HARKLEAN OBELUS;Po;0;AL;;;;;N;;;;;
+070C;SYRIAC HARKLEAN METOBELUS;Po;0;AL;;;;;N;;;;;
+070D;SYRIAC HARKLEAN ASTERISCUS;Po;0;AL;;;;;N;;;;;
+070F;SYRIAC ABBREVIATION MARK;Cf;0;AL;;;;;N;;;;;
+0710;SYRIAC LETTER ALAPH;Lo;0;AL;;;;;N;;;;;
+0711;SYRIAC LETTER SUPERSCRIPT ALAPH;Mn;36;NSM;;;;;N;;;;;
+0712;SYRIAC LETTER BETH;Lo;0;AL;;;;;N;;;;;
+0713;SYRIAC LETTER GAMAL;Lo;0;AL;;;;;N;;;;;
+0714;SYRIAC LETTER GAMAL GARSHUNI;Lo;0;AL;;;;;N;;;;;
+0715;SYRIAC LETTER DALATH;Lo;0;AL;;;;;N;;;;;
+0716;SYRIAC LETTER DOTLESS DALATH RISH;Lo;0;AL;;;;;N;;;;;
+0717;SYRIAC LETTER HE;Lo;0;AL;;;;;N;;;;;
+0718;SYRIAC LETTER WAW;Lo;0;AL;;;;;N;;;;;
+0719;SYRIAC LETTER ZAIN;Lo;0;AL;;;;;N;;;;;
+071A;SYRIAC LETTER HETH;Lo;0;AL;;;;;N;;;;;
+071B;SYRIAC LETTER TETH;Lo;0;AL;;;;;N;;;;;
+071C;SYRIAC LETTER TETH GARSHUNI;Lo;0;AL;;;;;N;;;;;
+071D;SYRIAC LETTER YUDH;Lo;0;AL;;;;;N;;;;;
+071E;SYRIAC LETTER YUDH HE;Lo;0;AL;;;;;N;;;;;
+071F;SYRIAC LETTER KAPH;Lo;0;AL;;;;;N;;;;;
+0720;SYRIAC LETTER LAMADH;Lo;0;AL;;;;;N;;;;;
+0721;SYRIAC LETTER MIM;Lo;0;AL;;;;;N;;;;;
+0722;SYRIAC LETTER NUN;Lo;0;AL;;;;;N;;;;;
+0723;SYRIAC LETTER SEMKATH;Lo;0;AL;;;;;N;;;;;
+0724;SYRIAC LETTER FINAL SEMKATH;Lo;0;AL;;;;;N;;;;;
+0725;SYRIAC LETTER E;Lo;0;AL;;;;;N;;;;;
+0726;SYRIAC LETTER PE;Lo;0;AL;;;;;N;;;;;
+0727;SYRIAC LETTER REVERSED PE;Lo;0;AL;;;;;N;;;;;
+0728;SYRIAC LETTER SADHE;Lo;0;AL;;;;;N;;;;;
+0729;SYRIAC LETTER QAPH;Lo;0;AL;;;;;N;;;;;
+072A;SYRIAC LETTER RISH;Lo;0;AL;;;;;N;;;;;
+072B;SYRIAC LETTER SHIN;Lo;0;AL;;;;;N;;;;;
+072C;SYRIAC LETTER TAW;Lo;0;AL;;;;;N;;;;;
+072D;SYRIAC LETTER PERSIAN BHETH;Lo;0;AL;;;;;N;;;;;
+072E;SYRIAC LETTER PERSIAN GHAMAL;Lo;0;AL;;;;;N;;;;;
+072F;SYRIAC LETTER PERSIAN DHALATH;Lo;0;AL;;;;;N;;;;;
+0730;SYRIAC PTHAHA ABOVE;Mn;230;NSM;;;;;N;;;;;
+0731;SYRIAC PTHAHA BELOW;Mn;220;NSM;;;;;N;;;;;
+0732;SYRIAC PTHAHA DOTTED;Mn;230;NSM;;;;;N;;;;;
+0733;SYRIAC ZQAPHA ABOVE;Mn;230;NSM;;;;;N;;;;;
+0734;SYRIAC ZQAPHA BELOW;Mn;220;NSM;;;;;N;;;;;
+0735;SYRIAC ZQAPHA DOTTED;Mn;230;NSM;;;;;N;;;;;
+0736;SYRIAC RBASA ABOVE;Mn;230;NSM;;;;;N;;;;;
+0737;SYRIAC RBASA BELOW;Mn;220;NSM;;;;;N;;;;;
+0738;SYRIAC DOTTED ZLAMA HORIZONTAL;Mn;220;NSM;;;;;N;;;;;
+0739;SYRIAC DOTTED ZLAMA ANGULAR;Mn;220;NSM;;;;;N;;;;;
+073A;SYRIAC HBASA ABOVE;Mn;230;NSM;;;;;N;;;;;
+073B;SYRIAC HBASA BELOW;Mn;220;NSM;;;;;N;;;;;
+073C;SYRIAC HBASA-ESASA DOTTED;Mn;220;NSM;;;;;N;;;;;
+073D;SYRIAC ESASA ABOVE;Mn;230;NSM;;;;;N;;;;;
+073E;SYRIAC ESASA BELOW;Mn;220;NSM;;;;;N;;;;;
+073F;SYRIAC RWAHA;Mn;230;NSM;;;;;N;;;;;
+0740;SYRIAC FEMININE DOT;Mn;230;NSM;;;;;N;;;;;
+0741;SYRIAC QUSHSHAYA;Mn;230;NSM;;;;;N;;;;;
+0742;SYRIAC RUKKAKHA;Mn;220;NSM;;;;;N;;;;;
+0743;SYRIAC TWO VERTICAL DOTS ABOVE;Mn;230;NSM;;;;;N;;;;;
+0744;SYRIAC TWO VERTICAL DOTS BELOW;Mn;220;NSM;;;;;N;;;;;
+0745;SYRIAC THREE DOTS ABOVE;Mn;230;NSM;;;;;N;;;;;
+0746;SYRIAC THREE DOTS BELOW;Mn;220;NSM;;;;;N;;;;;
+0747;SYRIAC OBLIQUE LINE ABOVE;Mn;230;NSM;;;;;N;;;;;
+0748;SYRIAC OBLIQUE LINE BELOW;Mn;220;NSM;;;;;N;;;;;
+0749;SYRIAC MUSIC;Mn;230;NSM;;;;;N;;;;;
+074A;SYRIAC BARREKH;Mn;230;NSM;;;;;N;;;;;
+074D;SYRIAC LETTER SOGDIAN ZHAIN;Lo;0;AL;;;;;N;;;;;
+074E;SYRIAC LETTER SOGDIAN KHAPH;Lo;0;AL;;;;;N;;;;;
+074F;SYRIAC LETTER SOGDIAN FE;Lo;0;AL;;;;;N;;;;;
+0750;ARABIC LETTER BEH WITH THREE DOTS HORIZONTALLY BELOW;Lo;0;AL;;;;;N;;;;;
+0751;ARABIC LETTER BEH WITH DOT BELOW AND THREE DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+0752;ARABIC LETTER BEH WITH THREE DOTS POINTING UPWARDS BELOW;Lo;0;AL;;;;;N;;;;;
+0753;ARABIC LETTER BEH WITH THREE DOTS POINTING UPWARDS BELOW AND TWO DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+0754;ARABIC LETTER BEH WITH TWO DOTS BELOW AND DOT ABOVE;Lo;0;AL;;;;;N;;;;;
+0755;ARABIC LETTER BEH WITH INVERTED SMALL V BELOW;Lo;0;AL;;;;;N;;;;;
+0756;ARABIC LETTER BEH WITH SMALL V;Lo;0;AL;;;;;N;;;;;
+0757;ARABIC LETTER HAH WITH TWO DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+0758;ARABIC LETTER HAH WITH THREE DOTS POINTING UPWARDS BELOW;Lo;0;AL;;;;;N;;;;;
+0759;ARABIC LETTER DAL WITH TWO DOTS VERTICALLY BELOW AND SMALL TAH;Lo;0;AL;;;;;N;;;;;
+075A;ARABIC LETTER DAL WITH INVERTED SMALL V BELOW;Lo;0;AL;;;;;N;;;;;
+075B;ARABIC LETTER REH WITH STROKE;Lo;0;AL;;;;;N;;;;;
+075C;ARABIC LETTER SEEN WITH FOUR DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+075D;ARABIC LETTER AIN WITH TWO DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+075E;ARABIC LETTER AIN WITH THREE DOTS POINTING DOWNWARDS ABOVE;Lo;0;AL;;;;;N;;;;;
+075F;ARABIC LETTER AIN WITH TWO DOTS VERTICALLY ABOVE;Lo;0;AL;;;;;N;;;;;
+0760;ARABIC LETTER FEH WITH TWO DOTS BELOW;Lo;0;AL;;;;;N;;;;;
+0761;ARABIC LETTER FEH WITH THREE DOTS POINTING UPWARDS BELOW;Lo;0;AL;;;;;N;;;;;
+0762;ARABIC LETTER KEHEH WITH DOT ABOVE;Lo;0;AL;;;;;N;;;;;
+0763;ARABIC LETTER KEHEH WITH THREE DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+0764;ARABIC LETTER KEHEH WITH THREE DOTS POINTING UPWARDS BELOW;Lo;0;AL;;;;;N;;;;;
+0765;ARABIC LETTER MEEM WITH DOT ABOVE;Lo;0;AL;;;;;N;;;;;
+0766;ARABIC LETTER MEEM WITH DOT BELOW;Lo;0;AL;;;;;N;;;;;
+0767;ARABIC LETTER NOON WITH TWO DOTS BELOW;Lo;0;AL;;;;;N;;;;;
+0768;ARABIC LETTER NOON WITH SMALL TAH;Lo;0;AL;;;;;N;;;;;
+0769;ARABIC LETTER NOON WITH SMALL V;Lo;0;AL;;;;;N;;;;;
+076A;ARABIC LETTER LAM WITH BAR;Lo;0;AL;;;;;N;;;;;
+076B;ARABIC LETTER REH WITH TWO DOTS VERTICALLY ABOVE;Lo;0;AL;;;;;N;;;;;
+076C;ARABIC LETTER REH WITH HAMZA ABOVE;Lo;0;AL;;;;;N;;;;;
+076D;ARABIC LETTER SEEN WITH TWO DOTS VERTICALLY ABOVE;Lo;0;AL;;;;;N;;;;;
+076E;ARABIC LETTER HAH WITH SMALL ARABIC LETTER TAH BELOW;Lo;0;AL;;;;;N;;;;;
+076F;ARABIC LETTER HAH WITH SMALL ARABIC LETTER TAH AND TWO DOTS;Lo;0;AL;;;;;N;;;;;
+0770;ARABIC LETTER SEEN WITH SMALL ARABIC LETTER TAH AND TWO DOTS;Lo;0;AL;;;;;N;;;;;
+0771;ARABIC LETTER REH WITH SMALL ARABIC LETTER TAH AND TWO DOTS;Lo;0;AL;;;;;N;;;;;
+0772;ARABIC LETTER HAH WITH SMALL ARABIC LETTER TAH ABOVE;Lo;0;AL;;;;;N;;;;;
+0773;ARABIC LETTER ALEF WITH EXTENDED ARABIC-INDIC DIGIT TWO ABOVE;Lo;0;AL;;;;;N;;;;;
+0774;ARABIC LETTER ALEF WITH EXTENDED ARABIC-INDIC DIGIT THREE ABOVE;Lo;0;AL;;;;;N;;;;;
+0775;ARABIC LETTER FARSI YEH WITH EXTENDED ARABIC-INDIC DIGIT TWO ABOVE;Lo;0;AL;;;;;N;;;;;
+0776;ARABIC LETTER FARSI YEH WITH EXTENDED ARABIC-INDIC DIGIT THREE ABOVE;Lo;0;AL;;;;;N;;;;;
+0777;ARABIC LETTER FARSI YEH WITH EXTENDED ARABIC-INDIC DIGIT FOUR BELOW;Lo;0;AL;;;;;N;;;;;
+0778;ARABIC LETTER WAW WITH EXTENDED ARABIC-INDIC DIGIT TWO ABOVE;Lo;0;AL;;;;;N;;;;;
+0779;ARABIC LETTER WAW WITH EXTENDED ARABIC-INDIC DIGIT THREE ABOVE;Lo;0;AL;;;;;N;;;;;
+077A;ARABIC LETTER YEH BARREE WITH EXTENDED ARABIC-INDIC DIGIT TWO ABOVE;Lo;0;AL;;;;;N;;;;;
+077B;ARABIC LETTER YEH BARREE WITH EXTENDED ARABIC-INDIC DIGIT THREE ABOVE;Lo;0;AL;;;;;N;;;;;
+077C;ARABIC LETTER HAH WITH EXTENDED ARABIC-INDIC DIGIT FOUR BELOW;Lo;0;AL;;;;;N;;;;;
+077D;ARABIC LETTER SEEN WITH EXTENDED ARABIC-INDIC DIGIT FOUR ABOVE;Lo;0;AL;;;;;N;;;;;
+077E;ARABIC LETTER SEEN WITH INVERTED V;Lo;0;AL;;;;;N;;;;;
+077F;ARABIC LETTER KAF WITH TWO DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+0780;THAANA LETTER HAA;Lo;0;AL;;;;;N;;;;;
+0781;THAANA LETTER SHAVIYANI;Lo;0;AL;;;;;N;;;;;
+0782;THAANA LETTER NOONU;Lo;0;AL;;;;;N;;;;;
+0783;THAANA LETTER RAA;Lo;0;AL;;;;;N;;;;;
+0784;THAANA LETTER BAA;Lo;0;AL;;;;;N;;;;;
+0785;THAANA LETTER LHAVIYANI;Lo;0;AL;;;;;N;;;;;
+0786;THAANA LETTER KAAFU;Lo;0;AL;;;;;N;;;;;
+0787;THAANA LETTER ALIFU;Lo;0;AL;;;;;N;;;;;
+0788;THAANA LETTER VAAVU;Lo;0;AL;;;;;N;;;;;
+0789;THAANA LETTER MEEMU;Lo;0;AL;;;;;N;;;;;
+078A;THAANA LETTER FAAFU;Lo;0;AL;;;;;N;;;;;
+078B;THAANA LETTER DHAALU;Lo;0;AL;;;;;N;;;;;
+078C;THAANA LETTER THAA;Lo;0;AL;;;;;N;;;;;
+078D;THAANA LETTER LAAMU;Lo;0;AL;;;;;N;;;;;
+078E;THAANA LETTER GAAFU;Lo;0;AL;;;;;N;;;;;
+078F;THAANA LETTER GNAVIYANI;Lo;0;AL;;;;;N;;;;;
+0790;THAANA LETTER SEENU;Lo;0;AL;;;;;N;;;;;
+0791;THAANA LETTER DAVIYANI;Lo;0;AL;;;;;N;;;;;
+0792;THAANA LETTER ZAVIYANI;Lo;0;AL;;;;;N;;;;;
+0793;THAANA LETTER TAVIYANI;Lo;0;AL;;;;;N;;;;;
+0794;THAANA LETTER YAA;Lo;0;AL;;;;;N;;;;;
+0795;THAANA LETTER PAVIYANI;Lo;0;AL;;;;;N;;;;;
+0796;THAANA LETTER JAVIYANI;Lo;0;AL;;;;;N;;;;;
+0797;THAANA LETTER CHAVIYANI;Lo;0;AL;;;;;N;;;;;
+0798;THAANA LETTER TTAA;Lo;0;AL;;;;;N;;;;;
+0799;THAANA LETTER HHAA;Lo;0;AL;;;;;N;;;;;
+079A;THAANA LETTER KHAA;Lo;0;AL;;;;;N;;;;;
+079B;THAANA LETTER THAALU;Lo;0;AL;;;;;N;;;;;
+079C;THAANA LETTER ZAA;Lo;0;AL;;;;;N;;;;;
+079D;THAANA LETTER SHEENU;Lo;0;AL;;;;;N;;;;;
+079E;THAANA LETTER SAADHU;Lo;0;AL;;;;;N;;;;;
+079F;THAANA LETTER DAADHU;Lo;0;AL;;;;;N;;;;;
+07A0;THAANA LETTER TO;Lo;0;AL;;;;;N;;;;;
+07A1;THAANA LETTER ZO;Lo;0;AL;;;;;N;;;;;
+07A2;THAANA LETTER AINU;Lo;0;AL;;;;;N;;;;;
+07A3;THAANA LETTER GHAINU;Lo;0;AL;;;;;N;;;;;
+07A4;THAANA LETTER QAAFU;Lo;0;AL;;;;;N;;;;;
+07A5;THAANA LETTER WAAVU;Lo;0;AL;;;;;N;;;;;
+07A6;THAANA ABAFILI;Mn;0;NSM;;;;;N;;;;;
+07A7;THAANA AABAAFILI;Mn;0;NSM;;;;;N;;;;;
+07A8;THAANA IBIFILI;Mn;0;NSM;;;;;N;;;;;
+07A9;THAANA EEBEEFILI;Mn;0;NSM;;;;;N;;;;;
+07AA;THAANA UBUFILI;Mn;0;NSM;;;;;N;;;;;
+07AB;THAANA OOBOOFILI;Mn;0;NSM;;;;;N;;;;;
+07AC;THAANA EBEFILI;Mn;0;NSM;;;;;N;;;;;
+07AD;THAANA EYBEYFILI;Mn;0;NSM;;;;;N;;;;;
+07AE;THAANA OBOFILI;Mn;0;NSM;;;;;N;;;;;
+07AF;THAANA OABOAFILI;Mn;0;NSM;;;;;N;;;;;
+07B0;THAANA SUKUN;Mn;0;NSM;;;;;N;;;;;
+07B1;THAANA LETTER NAA;Lo;0;AL;;;;;N;;;;;
+07C0;NKO DIGIT ZERO;Nd;0;R;;0;0;0;N;;;;;
+07C1;NKO DIGIT ONE;Nd;0;R;;1;1;1;N;;;;;
+07C2;NKO DIGIT TWO;Nd;0;R;;2;2;2;N;;;;;
+07C3;NKO DIGIT THREE;Nd;0;R;;3;3;3;N;;;;;
+07C4;NKO DIGIT FOUR;Nd;0;R;;4;4;4;N;;;;;
+07C5;NKO DIGIT FIVE;Nd;0;R;;5;5;5;N;;;;;
+07C6;NKO DIGIT SIX;Nd;0;R;;6;6;6;N;;;;;
+07C7;NKO DIGIT SEVEN;Nd;0;R;;7;7;7;N;;;;;
+07C8;NKO DIGIT EIGHT;Nd;0;R;;8;8;8;N;;;;;
+07C9;NKO DIGIT NINE;Nd;0;R;;9;9;9;N;;;;;
+07CA;NKO LETTER A;Lo;0;R;;;;;N;;;;;
+07CB;NKO LETTER EE;Lo;0;R;;;;;N;;;;;
+07CC;NKO LETTER I;Lo;0;R;;;;;N;;;;;
+07CD;NKO LETTER E;Lo;0;R;;;;;N;;;;;
+07CE;NKO LETTER U;Lo;0;R;;;;;N;;;;;
+07CF;NKO LETTER OO;Lo;0;R;;;;;N;;;;;
+07D0;NKO LETTER O;Lo;0;R;;;;;N;;;;;
+07D1;NKO LETTER DAGBASINNA;Lo;0;R;;;;;N;;;;;
+07D2;NKO LETTER N;Lo;0;R;;;;;N;;;;;
+07D3;NKO LETTER BA;Lo;0;R;;;;;N;;;;;
+07D4;NKO LETTER PA;Lo;0;R;;;;;N;;;;;
+07D5;NKO LETTER TA;Lo;0;R;;;;;N;;;;;
+07D6;NKO LETTER JA;Lo;0;R;;;;;N;;;;;
+07D7;NKO LETTER CHA;Lo;0;R;;;;;N;;;;;
+07D8;NKO LETTER DA;Lo;0;R;;;;;N;;;;;
+07D9;NKO LETTER RA;Lo;0;R;;;;;N;;;;;
+07DA;NKO LETTER RRA;Lo;0;R;;;;;N;;;;;
+07DB;NKO LETTER SA;Lo;0;R;;;;;N;;;;;
+07DC;NKO LETTER GBA;Lo;0;R;;;;;N;;;;;
+07DD;NKO LETTER FA;Lo;0;R;;;;;N;;;;;
+07DE;NKO LETTER KA;Lo;0;R;;;;;N;;;;;
+07DF;NKO LETTER LA;Lo;0;R;;;;;N;;;;;
+07E0;NKO LETTER NA WOLOSO;Lo;0;R;;;;;N;;;;;
+07E1;NKO LETTER MA;Lo;0;R;;;;;N;;;;;
+07E2;NKO LETTER NYA;Lo;0;R;;;;;N;;;;;
+07E3;NKO LETTER NA;Lo;0;R;;;;;N;;;;;
+07E4;NKO LETTER HA;Lo;0;R;;;;;N;;;;;
+07E5;NKO LETTER WA;Lo;0;R;;;;;N;;;;;
+07E6;NKO LETTER YA;Lo;0;R;;;;;N;;;;;
+07E7;NKO LETTER NYA WOLOSO;Lo;0;R;;;;;N;;;;;
+07E8;NKO LETTER JONA JA;Lo;0;R;;;;;N;;;;;
+07E9;NKO LETTER JONA CHA;Lo;0;R;;;;;N;;;;;
+07EA;NKO LETTER JONA RA;Lo;0;R;;;;;N;;;;;
+07EB;NKO COMBINING SHORT HIGH TONE;Mn;230;NSM;;;;;N;;;;;
+07EC;NKO COMBINING SHORT LOW TONE;Mn;230;NSM;;;;;N;;;;;
+07ED;NKO COMBINING SHORT RISING TONE;Mn;230;NSM;;;;;N;;;;;
+07EE;NKO COMBINING LONG DESCENDING TONE;Mn;230;NSM;;;;;N;;;;;
+07EF;NKO COMBINING LONG HIGH TONE;Mn;230;NSM;;;;;N;;;;;
+07F0;NKO COMBINING LONG LOW TONE;Mn;230;NSM;;;;;N;;;;;
+07F1;NKO COMBINING LONG RISING TONE;Mn;230;NSM;;;;;N;;;;;
+07F2;NKO COMBINING NASALIZATION MARK;Mn;220;NSM;;;;;N;;;;;
+07F3;NKO COMBINING DOUBLE DOT ABOVE;Mn;230;NSM;;;;;N;;;;;
+07F4;NKO HIGH TONE APOSTROPHE;Lm;0;R;;;;;N;;;;;
+07F5;NKO LOW TONE APOSTROPHE;Lm;0;R;;;;;N;;;;;
+07F6;NKO SYMBOL OO DENNEN;So;0;ON;;;;;N;;;;;
+07F7;NKO SYMBOL GBAKURUNEN;Po;0;ON;;;;;N;;;;;
+07F8;NKO COMMA;Po;0;ON;;;;;N;;;;;
+07F9;NKO EXCLAMATION MARK;Po;0;ON;;;;;N;;;;;
+07FA;NKO LAJANYALAN;Lm;0;R;;;;;N;;;;;
+0800;SAMARITAN LETTER ALAF;Lo;0;R;;;;;N;;;;;
+0801;SAMARITAN LETTER BIT;Lo;0;R;;;;;N;;;;;
+0802;SAMARITAN LETTER GAMAN;Lo;0;R;;;;;N;;;;;
+0803;SAMARITAN LETTER DALAT;Lo;0;R;;;;;N;;;;;
+0804;SAMARITAN LETTER IY;Lo;0;R;;;;;N;;;;;
+0805;SAMARITAN LETTER BAA;Lo;0;R;;;;;N;;;;;
+0806;SAMARITAN LETTER ZEN;Lo;0;R;;;;;N;;;;;
+0807;SAMARITAN LETTER IT;Lo;0;R;;;;;N;;;;;
+0808;SAMARITAN LETTER TIT;Lo;0;R;;;;;N;;;;;
+0809;SAMARITAN LETTER YUT;Lo;0;R;;;;;N;;;;;
+080A;SAMARITAN LETTER KAAF;Lo;0;R;;;;;N;;;;;
+080B;SAMARITAN LETTER LABAT;Lo;0;R;;;;;N;;;;;
+080C;SAMARITAN LETTER MIM;Lo;0;R;;;;;N;;;;;
+080D;SAMARITAN LETTER NUN;Lo;0;R;;;;;N;;;;;
+080E;SAMARITAN LETTER SINGAAT;Lo;0;R;;;;;N;;;;;
+080F;SAMARITAN LETTER IN;Lo;0;R;;;;;N;;;;;
+0810;SAMARITAN LETTER FI;Lo;0;R;;;;;N;;;;;
+0811;SAMARITAN LETTER TSAADIY;Lo;0;R;;;;;N;;;;;
+0812;SAMARITAN LETTER QUF;Lo;0;R;;;;;N;;;;;
+0813;SAMARITAN LETTER RISH;Lo;0;R;;;;;N;;;;;
+0814;SAMARITAN LETTER SHAN;Lo;0;R;;;;;N;;;;;
+0815;SAMARITAN LETTER TAAF;Lo;0;R;;;;;N;;;;;
+0816;SAMARITAN MARK IN;Mn;230;NSM;;;;;N;;;;;
+0817;SAMARITAN MARK IN-ALAF;Mn;230;NSM;;;;;N;;;;;
+0818;SAMARITAN MARK OCCLUSION;Mn;230;NSM;;;;;N;;;;;
+0819;SAMARITAN MARK DAGESH;Mn;230;NSM;;;;;N;;;;;
+081A;SAMARITAN MODIFIER LETTER EPENTHETIC YUT;Lm;0;R;;;;;N;;;;;
+081B;SAMARITAN MARK EPENTHETIC YUT;Mn;230;NSM;;;;;N;;;;;
+081C;SAMARITAN VOWEL SIGN LONG E;Mn;230;NSM;;;;;N;;;;;
+081D;SAMARITAN VOWEL SIGN E;Mn;230;NSM;;;;;N;;;;;
+081E;SAMARITAN VOWEL SIGN OVERLONG AA;Mn;230;NSM;;;;;N;;;;;
+081F;SAMARITAN VOWEL SIGN LONG AA;Mn;230;NSM;;;;;N;;;;;
+0820;SAMARITAN VOWEL SIGN AA;Mn;230;NSM;;;;;N;;;;;
+0821;SAMARITAN VOWEL SIGN OVERLONG A;Mn;230;NSM;;;;;N;;;;;
+0822;SAMARITAN VOWEL SIGN LONG A;Mn;230;NSM;;;;;N;;;;;
+0823;SAMARITAN VOWEL SIGN A;Mn;230;NSM;;;;;N;;;;;
+0824;SAMARITAN MODIFIER LETTER SHORT A;Lm;0;R;;;;;N;;;;;
+0825;SAMARITAN VOWEL SIGN SHORT A;Mn;230;NSM;;;;;N;;;;;
+0826;SAMARITAN VOWEL SIGN LONG U;Mn;230;NSM;;;;;N;;;;;
+0827;SAMARITAN VOWEL SIGN U;Mn;230;NSM;;;;;N;;;;;
+0828;SAMARITAN MODIFIER LETTER I;Lm;0;R;;;;;N;;;;;
+0829;SAMARITAN VOWEL SIGN LONG I;Mn;230;NSM;;;;;N;;;;;
+082A;SAMARITAN VOWEL SIGN I;Mn;230;NSM;;;;;N;;;;;
+082B;SAMARITAN VOWEL SIGN O;Mn;230;NSM;;;;;N;;;;;
+082C;SAMARITAN VOWEL SIGN SUKUN;Mn;230;NSM;;;;;N;;;;;
+082D;SAMARITAN MARK NEQUDAA;Mn;230;NSM;;;;;N;;;;;
+0830;SAMARITAN PUNCTUATION NEQUDAA;Po;0;R;;;;;N;;;;;
+0831;SAMARITAN PUNCTUATION AFSAAQ;Po;0;R;;;;;N;;;;;
+0832;SAMARITAN PUNCTUATION ANGED;Po;0;R;;;;;N;;;;;
+0833;SAMARITAN PUNCTUATION BAU;Po;0;R;;;;;N;;;;;
+0834;SAMARITAN PUNCTUATION ATMAAU;Po;0;R;;;;;N;;;;;
+0835;SAMARITAN PUNCTUATION SHIYYAALAA;Po;0;R;;;;;N;;;;;
+0836;SAMARITAN ABBREVIATION MARK;Po;0;R;;;;;N;;;;;
+0837;SAMARITAN PUNCTUATION MELODIC QITSA;Po;0;R;;;;;N;;;;;
+0838;SAMARITAN PUNCTUATION ZIQAA;Po;0;R;;;;;N;;;;;
+0839;SAMARITAN PUNCTUATION QITSA;Po;0;R;;;;;N;;;;;
+083A;SAMARITAN PUNCTUATION ZAEF;Po;0;R;;;;;N;;;;;
+083B;SAMARITAN PUNCTUATION TURU;Po;0;R;;;;;N;;;;;
+083C;SAMARITAN PUNCTUATION ARKAANU;Po;0;R;;;;;N;;;;;
+083D;SAMARITAN PUNCTUATION SOF MASHFAAT;Po;0;R;;;;;N;;;;;
+083E;SAMARITAN PUNCTUATION ANNAAU;Po;0;R;;;;;N;;;;;
+0840;MANDAIC LETTER HALQA;Lo;0;R;;;;;N;;;;;
+0841;MANDAIC LETTER AB;Lo;0;R;;;;;N;;;;;
+0842;MANDAIC LETTER AG;Lo;0;R;;;;;N;;;;;
+0843;MANDAIC LETTER AD;Lo;0;R;;;;;N;;;;;
+0844;MANDAIC LETTER AH;Lo;0;R;;;;;N;;;;;
+0845;MANDAIC LETTER USHENNA;Lo;0;R;;;;;N;;;;;
+0846;MANDAIC LETTER AZ;Lo;0;R;;;;;N;;;;;
+0847;MANDAIC LETTER IT;Lo;0;R;;;;;N;;;;;
+0848;MANDAIC LETTER ATT;Lo;0;R;;;;;N;;;;;
+0849;MANDAIC LETTER AKSA;Lo;0;R;;;;;N;;;;;
+084A;MANDAIC LETTER AK;Lo;0;R;;;;;N;;;;;
+084B;MANDAIC LETTER AL;Lo;0;R;;;;;N;;;;;
+084C;MANDAIC LETTER AM;Lo;0;R;;;;;N;;;;;
+084D;MANDAIC LETTER AN;Lo;0;R;;;;;N;;;;;
+084E;MANDAIC LETTER AS;Lo;0;R;;;;;N;;;;;
+084F;MANDAIC LETTER IN;Lo;0;R;;;;;N;;;;;
+0850;MANDAIC LETTER AP;Lo;0;R;;;;;N;;;;;
+0851;MANDAIC LETTER ASZ;Lo;0;R;;;;;N;;;;;
+0852;MANDAIC LETTER AQ;Lo;0;R;;;;;N;;;;;
+0853;MANDAIC LETTER AR;Lo;0;R;;;;;N;;;;;
+0854;MANDAIC LETTER ASH;Lo;0;R;;;;;N;;;;;
+0855;MANDAIC LETTER AT;Lo;0;R;;;;;N;;;;;
+0856;MANDAIC LETTER DUSHENNA;Lo;0;R;;;;;N;;;;;
+0857;MANDAIC LETTER KAD;Lo;0;R;;;;;N;;;;;
+0858;MANDAIC LETTER AIN;Lo;0;R;;;;;N;;;;;
+0859;MANDAIC AFFRICATION MARK;Mn;220;NSM;;;;;N;;;;;
+085A;MANDAIC VOCALIZATION MARK;Mn;220;NSM;;;;;N;;;;;
+085B;MANDAIC GEMINATION MARK;Mn;220;NSM;;;;;N;;;;;
+085E;MANDAIC PUNCTUATION;Po;0;R;;;;;N;;;;;
+0860;SYRIAC LETTER MALAYALAM NGA;Lo;0;AL;;;;;N;;;;;
+0861;SYRIAC LETTER MALAYALAM JA;Lo;0;AL;;;;;N;;;;;
+0862;SYRIAC LETTER MALAYALAM NYA;Lo;0;AL;;;;;N;;;;;
+0863;SYRIAC LETTER MALAYALAM TTA;Lo;0;AL;;;;;N;;;;;
+0864;SYRIAC LETTER MALAYALAM NNA;Lo;0;AL;;;;;N;;;;;
+0865;SYRIAC LETTER MALAYALAM NNNA;Lo;0;AL;;;;;N;;;;;
+0866;SYRIAC LETTER MALAYALAM BHA;Lo;0;AL;;;;;N;;;;;
+0867;SYRIAC LETTER MALAYALAM RA;Lo;0;AL;;;;;N;;;;;
+0868;SYRIAC LETTER MALAYALAM LLA;Lo;0;AL;;;;;N;;;;;
+0869;SYRIAC LETTER MALAYALAM LLLA;Lo;0;AL;;;;;N;;;;;
+086A;SYRIAC LETTER MALAYALAM SSA;Lo;0;AL;;;;;N;;;;;
+08A0;ARABIC LETTER BEH WITH SMALL V BELOW;Lo;0;AL;;;;;N;;;;;
+08A1;ARABIC LETTER BEH WITH HAMZA ABOVE;Lo;0;AL;;;;;N;;;;;
+08A2;ARABIC LETTER JEEM WITH TWO DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+08A3;ARABIC LETTER TAH WITH TWO DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+08A4;ARABIC LETTER FEH WITH DOT BELOW AND THREE DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+08A5;ARABIC LETTER QAF WITH DOT BELOW;Lo;0;AL;;;;;N;;;;;
+08A6;ARABIC LETTER LAM WITH DOUBLE BAR;Lo;0;AL;;;;;N;;;;;
+08A7;ARABIC LETTER MEEM WITH THREE DOTS ABOVE;Lo;0;AL;;;;;N;;;;;
+08A8;ARABIC LETTER YEH WITH TWO DOTS BELOW AND HAMZA ABOVE;Lo;0;AL;;;;;N;;;;;
+08A9;ARABIC LETTER YEH WITH TWO DOTS BELOW AND DOT ABOVE;Lo;0;AL;;;;;N;;;;;
+08AA;ARABIC LETTER REH WITH LOOP;Lo;0;AL;;;;;N;;;;;
+08AB;ARABIC LETTER WAW WITH DOT WITHIN;Lo;0;AL;;;;;N;;;;;
+08AC;ARABIC LETTER ROHINGYA YEH;Lo;0;AL;;;;;N;;;;;
+08AD;ARABIC LETTER LOW ALEF;Lo;0;AL;;;;;N;;;;;
+08AE;ARABIC LETTER DAL WITH THREE DOTS BELOW;Lo;0;AL;;;;;N;;;;;
+08AF;ARABIC LETTER SAD WITH THREE DOTS BELOW;Lo;0;AL;;;;;N;;;;;
+08B0;ARABIC LETTER GAF WITH INVERTED STROKE;Lo;0;AL;;;;;N;;;;;
+08B1;ARABIC LETTER STRAIGHT WAW;Lo;0;AL;;;;;N;;;;;
+08B2;ARABIC LETTER ZAIN WITH INVERTED V ABOVE;Lo;0;AL;;;;;N;;;;;
+08B3;ARABIC LETTER AIN WITH THREE DOTS BELOW;Lo;0;AL;;;;;N;;;;;
+08B4;ARABIC LETTER KAF WITH DOT BELOW;Lo;0;AL;;;;;N;;;;;
+08B6;ARABIC LETTER BEH WITH SMALL MEEM ABOVE;Lo;0;AL;;;;;N;;;;;
+08B7;ARABIC LETTER PEH WITH SMALL MEEM ABOVE;Lo;0;AL;;;;;N;;;;;
+08B8;ARABIC LETTER TEH WITH SMALL TEH ABOVE;Lo;0;AL;;;;;N;;;;;
+08B9;ARABIC LETTER REH WITH SMALL NOON ABOVE;Lo;0;AL;;;;;N;;;;;
+08BA;ARABIC LETTER YEH WITH TWO DOTS BELOW AND SMALL NOON ABOVE;Lo;0;AL;;;;;N;;;;;
+08BB;ARABIC LETTER AFRICAN FEH;Lo;0;AL;;;;;N;;;;;
+08BC;ARABIC LETTER AFRICAN QAF;Lo;0;AL;;;;;N;;;;;
+08BD;ARABIC LETTER AFRICAN NOON;Lo;0;AL;;;;;N;;;;;
+08D4;ARABIC SMALL HIGH WORD AR-RUB;Mn;230;NSM;;;;;N;;;;;
+08D5;ARABIC SMALL HIGH SAD;Mn;230;NSM;;;;;N;;;;;
+08D6;ARABIC SMALL HIGH AIN;Mn;230;NSM;;;;;N;;;;;
+08D7;ARABIC SMALL HIGH QAF;Mn;230;NSM;;;;;N;;;;;
+08D8;ARABIC SMALL HIGH NOON WITH KASRA;Mn;230;NSM;;;;;N;;;;;
+08D9;ARABIC SMALL LOW NOON WITH KASRA;Mn;230;NSM;;;;;N;;;;;
+08DA;ARABIC SMALL HIGH WORD ATH-THALATHA;Mn;230;NSM;;;;;N;;;;;
+08DB;ARABIC SMALL HIGH WORD AS-SAJDA;Mn;230;NSM;;;;;N;;;;;
+08DC;ARABIC SMALL HIGH WORD AN-NISF;Mn;230;NSM;;;;;N;;;;;
+08DD;ARABIC SMALL HIGH WORD SAKTA;Mn;230;NSM;;;;;N;;;;;
+08DE;ARABIC SMALL HIGH WORD QIF;Mn;230;NSM;;;;;N;;;;;
+08DF;ARABIC SMALL HIGH WORD WAQFA;Mn;230;NSM;;;;;N;;;;;
+08E0;ARABIC SMALL HIGH FOOTNOTE MARKER;Mn;230;NSM;;;;;N;;;;;
+08E1;ARABIC SMALL HIGH SIGN SAFHA;Mn;230;NSM;;;;;N;;;;;
+08E2;ARABIC DISPUTED END OF AYAH;Cf;0;AN;;;;;N;;;;;
+08E3;ARABIC TURNED DAMMA BELOW;Mn;220;NSM;;;;;N;;;;;
+08E4;ARABIC CURLY FATHA;Mn;230;NSM;;;;;N;;;;;
+08E5;ARABIC CURLY DAMMA;Mn;230;NSM;;;;;N;;;;;
+08E6;ARABIC CURLY KASRA;Mn;220;NSM;;;;;N;;;;;
+08E7;ARABIC CURLY FATHATAN;Mn;230;NSM;;;;;N;;;;;
+08E8;ARABIC CURLY DAMMATAN;Mn;230;NSM;;;;;N;;;;;
+08E9;ARABIC CURLY KASRATAN;Mn;220;NSM;;;;;N;;;;;
+08EA;ARABIC TONE ONE DOT ABOVE;Mn;230;NSM;;;;;N;;;;;
+08EB;ARABIC TONE TWO DOTS ABOVE;Mn;230;NSM;;;;;N;;;;;
+08EC;ARABIC TONE LOOP ABOVE;Mn;230;NSM;;;;;N;;;;;
+08ED;ARABIC TONE ONE DOT BELOW;Mn;220;NSM;;;;;N;;;;;
+08EE;ARABIC TONE TWO DOTS BELOW;Mn;220;NSM;;;;;N;;;;;
+08EF;ARABIC TONE LOOP BELOW;Mn;220;NSM;;;;;N;;;;;
+08F0;ARABIC OPEN FATHATAN;Mn;27;NSM;;;;;N;;;;;
+08F1;ARABIC OPEN DAMMATAN;Mn;28;NSM;;;;;N;;;;;
+08F2;ARABIC OPEN KASRATAN;Mn;29;NSM;;;;;N;;;;;
+08F3;ARABIC SMALL HIGH WAW;Mn;230;NSM;;;;;N;;;;;
+08F4;ARABIC FATHA WITH RING;Mn;230;NSM;;;;;N;;;;;
+08F5;ARABIC FATHA WITH DOT ABOVE;Mn;230;NSM;;;;;N;;;;;
+08F6;ARABIC KASRA WITH DOT BELOW;Mn;220;NSM;;;;;N;;;;;
+08F7;ARABIC LEFT ARROWHEAD ABOVE;Mn;230;NSM;;;;;N;;;;;
+08F8;ARABIC RIGHT ARROWHEAD ABOVE;Mn;230;NSM;;;;;N;;;;;
+08F9;ARABIC LEFT ARROWHEAD BELOW;Mn;220;NSM;;;;;N;;;;;
+08FA;ARABIC RIGHT ARROWHEAD BELOW;Mn;220;NSM;;;;;N;;;;;
+08FB;ARABIC DOUBLE RIGHT ARROWHEAD ABOVE;Mn;230;NSM;;;;;N;;;;;
+08FC;ARABIC DOUBLE RIGHT ARROWHEAD ABOVE WITH DOT;Mn;230;NSM;;;;;N;;;;;
+08FD;ARABIC RIGHT ARROWHEAD ABOVE WITH DOT;Mn;230;NSM;;;;;N;;;;;
+08FE;ARABIC DAMMA WITH DOT;Mn;230;NSM;;;;;N;;;;;
+08FF;ARABIC MARK SIDEWAYS NOON GHUNNA;Mn;230;NSM;;;;;N;;;;;
+0900;DEVANAGARI SIGN INVERTED CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+0901;DEVANAGARI SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+0902;DEVANAGARI SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+0903;DEVANAGARI SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+0904;DEVANAGARI LETTER SHORT A;Lo;0;L;;;;;N;;;;;
+0905;DEVANAGARI LETTER A;Lo;0;L;;;;;N;;;;;
+0906;DEVANAGARI LETTER AA;Lo;0;L;;;;;N;;;;;
+0907;DEVANAGARI LETTER I;Lo;0;L;;;;;N;;;;;
+0908;DEVANAGARI LETTER II;Lo;0;L;;;;;N;;;;;
+0909;DEVANAGARI LETTER U;Lo;0;L;;;;;N;;;;;
+090A;DEVANAGARI LETTER UU;Lo;0;L;;;;;N;;;;;
+090B;DEVANAGARI LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+090C;DEVANAGARI LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+090D;DEVANAGARI LETTER CANDRA E;Lo;0;L;;;;;N;;;;;
+090E;DEVANAGARI LETTER SHORT E;Lo;0;L;;;;;N;;;;;
+090F;DEVANAGARI LETTER E;Lo;0;L;;;;;N;;;;;
+0910;DEVANAGARI LETTER AI;Lo;0;L;;;;;N;;;;;
+0911;DEVANAGARI LETTER CANDRA O;Lo;0;L;;;;;N;;;;;
+0912;DEVANAGARI LETTER SHORT O;Lo;0;L;;;;;N;;;;;
+0913;DEVANAGARI LETTER O;Lo;0;L;;;;;N;;;;;
+0914;DEVANAGARI LETTER AU;Lo;0;L;;;;;N;;;;;
+0915;DEVANAGARI LETTER KA;Lo;0;L;;;;;N;;;;;
+0916;DEVANAGARI LETTER KHA;Lo;0;L;;;;;N;;;;;
+0917;DEVANAGARI LETTER GA;Lo;0;L;;;;;N;;;;;
+0918;DEVANAGARI LETTER GHA;Lo;0;L;;;;;N;;;;;
+0919;DEVANAGARI LETTER NGA;Lo;0;L;;;;;N;;;;;
+091A;DEVANAGARI LETTER CA;Lo;0;L;;;;;N;;;;;
+091B;DEVANAGARI LETTER CHA;Lo;0;L;;;;;N;;;;;
+091C;DEVANAGARI LETTER JA;Lo;0;L;;;;;N;;;;;
+091D;DEVANAGARI LETTER JHA;Lo;0;L;;;;;N;;;;;
+091E;DEVANAGARI LETTER NYA;Lo;0;L;;;;;N;;;;;
+091F;DEVANAGARI LETTER TTA;Lo;0;L;;;;;N;;;;;
+0920;DEVANAGARI LETTER TTHA;Lo;0;L;;;;;N;;;;;
+0921;DEVANAGARI LETTER DDA;Lo;0;L;;;;;N;;;;;
+0922;DEVANAGARI LETTER DDHA;Lo;0;L;;;;;N;;;;;
+0923;DEVANAGARI LETTER NNA;Lo;0;L;;;;;N;;;;;
+0924;DEVANAGARI LETTER TA;Lo;0;L;;;;;N;;;;;
+0925;DEVANAGARI LETTER THA;Lo;0;L;;;;;N;;;;;
+0926;DEVANAGARI LETTER DA;Lo;0;L;;;;;N;;;;;
+0927;DEVANAGARI LETTER DHA;Lo;0;L;;;;;N;;;;;
+0928;DEVANAGARI LETTER NA;Lo;0;L;;;;;N;;;;;
+0929;DEVANAGARI LETTER NNNA;Lo;0;L;0928 093C;;;;N;;;;;
+092A;DEVANAGARI LETTER PA;Lo;0;L;;;;;N;;;;;
+092B;DEVANAGARI LETTER PHA;Lo;0;L;;;;;N;;;;;
+092C;DEVANAGARI LETTER BA;Lo;0;L;;;;;N;;;;;
+092D;DEVANAGARI LETTER BHA;Lo;0;L;;;;;N;;;;;
+092E;DEVANAGARI LETTER MA;Lo;0;L;;;;;N;;;;;
+092F;DEVANAGARI LETTER YA;Lo;0;L;;;;;N;;;;;
+0930;DEVANAGARI LETTER RA;Lo;0;L;;;;;N;;;;;
+0931;DEVANAGARI LETTER RRA;Lo;0;L;0930 093C;;;;N;;;;;
+0932;DEVANAGARI LETTER LA;Lo;0;L;;;;;N;;;;;
+0933;DEVANAGARI LETTER LLA;Lo;0;L;;;;;N;;;;;
+0934;DEVANAGARI LETTER LLLA;Lo;0;L;0933 093C;;;;N;;;;;
+0935;DEVANAGARI LETTER VA;Lo;0;L;;;;;N;;;;;
+0936;DEVANAGARI LETTER SHA;Lo;0;L;;;;;N;;;;;
+0937;DEVANAGARI LETTER SSA;Lo;0;L;;;;;N;;;;;
+0938;DEVANAGARI LETTER SA;Lo;0;L;;;;;N;;;;;
+0939;DEVANAGARI LETTER HA;Lo;0;L;;;;;N;;;;;
+093A;DEVANAGARI VOWEL SIGN OE;Mn;0;NSM;;;;;N;;;;;
+093B;DEVANAGARI VOWEL SIGN OOE;Mc;0;L;;;;;N;;;;;
+093C;DEVANAGARI SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+093D;DEVANAGARI SIGN AVAGRAHA;Lo;0;L;;;;;N;;;;;
+093E;DEVANAGARI VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+093F;DEVANAGARI VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+0940;DEVANAGARI VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+0941;DEVANAGARI VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+0942;DEVANAGARI VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+0943;DEVANAGARI VOWEL SIGN VOCALIC R;Mn;0;NSM;;;;;N;;;;;
+0944;DEVANAGARI VOWEL SIGN VOCALIC RR;Mn;0;NSM;;;;;N;;;;;
+0945;DEVANAGARI VOWEL SIGN CANDRA E;Mn;0;NSM;;;;;N;;;;;
+0946;DEVANAGARI VOWEL SIGN SHORT E;Mn;0;NSM;;;;;N;;;;;
+0947;DEVANAGARI VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+0948;DEVANAGARI VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+0949;DEVANAGARI VOWEL SIGN CANDRA O;Mc;0;L;;;;;N;;;;;
+094A;DEVANAGARI VOWEL SIGN SHORT O;Mc;0;L;;;;;N;;;;;
+094B;DEVANAGARI VOWEL SIGN O;Mc;0;L;;;;;N;;;;;
+094C;DEVANAGARI VOWEL SIGN AU;Mc;0;L;;;;;N;;;;;
+094D;DEVANAGARI SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+094E;DEVANAGARI VOWEL SIGN PRISHTHAMATRA E;Mc;0;L;;;;;N;;;;;
+094F;DEVANAGARI VOWEL SIGN AW;Mc;0;L;;;;;N;;;;;
+0950;DEVANAGARI OM;Lo;0;L;;;;;N;;;;;
+0951;DEVANAGARI STRESS SIGN UDATTA;Mn;230;NSM;;;;;N;;;;;
+0952;DEVANAGARI STRESS SIGN ANUDATTA;Mn;220;NSM;;;;;N;;;;;
+0953;DEVANAGARI GRAVE ACCENT;Mn;230;NSM;;;;;N;;;;;
+0954;DEVANAGARI ACUTE ACCENT;Mn;230;NSM;;;;;N;;;;;
+0955;DEVANAGARI VOWEL SIGN CANDRA LONG E;Mn;0;NSM;;;;;N;;;;;
+0956;DEVANAGARI VOWEL SIGN UE;Mn;0;NSM;;;;;N;;;;;
+0957;DEVANAGARI VOWEL SIGN UUE;Mn;0;NSM;;;;;N;;;;;
+0958;DEVANAGARI LETTER QA;Lo;0;L;0915 093C;;;;N;;;;;
+0959;DEVANAGARI LETTER KHHA;Lo;0;L;0916 093C;;;;N;;;;;
+095A;DEVANAGARI LETTER GHHA;Lo;0;L;0917 093C;;;;N;;;;;
+095B;DEVANAGARI LETTER ZA;Lo;0;L;091C 093C;;;;N;;;;;
+095C;DEVANAGARI LETTER DDDHA;Lo;0;L;0921 093C;;;;N;;;;;
+095D;DEVANAGARI LETTER RHA;Lo;0;L;0922 093C;;;;N;;;;;
+095E;DEVANAGARI LETTER FA;Lo;0;L;092B 093C;;;;N;;;;;
+095F;DEVANAGARI LETTER YYA;Lo;0;L;092F 093C;;;;N;;;;;
+0960;DEVANAGARI LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+0961;DEVANAGARI LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+0962;DEVANAGARI VOWEL SIGN VOCALIC L;Mn;0;NSM;;;;;N;;;;;
+0963;DEVANAGARI VOWEL SIGN VOCALIC LL;Mn;0;NSM;;;;;N;;;;;
+0964;DEVANAGARI DANDA;Po;0;L;;;;;N;;;;;
+0965;DEVANAGARI DOUBLE DANDA;Po;0;L;;;;;N;;;;;
+0966;DEVANAGARI DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+0967;DEVANAGARI DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+0968;DEVANAGARI DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+0969;DEVANAGARI DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+096A;DEVANAGARI DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+096B;DEVANAGARI DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+096C;DEVANAGARI DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+096D;DEVANAGARI DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+096E;DEVANAGARI DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+096F;DEVANAGARI DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+0970;DEVANAGARI ABBREVIATION SIGN;Po;0;L;;;;;N;;;;;
+0971;DEVANAGARI SIGN HIGH SPACING DOT;Lm;0;L;;;;;N;;;;;
+0972;DEVANAGARI LETTER CANDRA A;Lo;0;L;;;;;N;;;;;
+0973;DEVANAGARI LETTER OE;Lo;0;L;;;;;N;;;;;
+0974;DEVANAGARI LETTER OOE;Lo;0;L;;;;;N;;;;;
+0975;DEVANAGARI LETTER AW;Lo;0;L;;;;;N;;;;;
+0976;DEVANAGARI LETTER UE;Lo;0;L;;;;;N;;;;;
+0977;DEVANAGARI LETTER UUE;Lo;0;L;;;;;N;;;;;
+0978;DEVANAGARI LETTER MARWARI DDA;Lo;0;L;;;;;N;;;;;
+0979;DEVANAGARI LETTER ZHA;Lo;0;L;;;;;N;;;;;
+097A;DEVANAGARI LETTER HEAVY YA;Lo;0;L;;;;;N;;;;;
+097B;DEVANAGARI LETTER GGA;Lo;0;L;;;;;N;;;;;
+097C;DEVANAGARI LETTER JJA;Lo;0;L;;;;;N;;;;;
+097D;DEVANAGARI LETTER GLOTTAL STOP;Lo;0;L;;;;;N;;;;;
+097E;DEVANAGARI LETTER DDDA;Lo;0;L;;;;;N;;;;;
+097F;DEVANAGARI LETTER BBA;Lo;0;L;;;;;N;;;;;
+0980;BENGALI ANJI;Lo;0;L;;;;;N;;;;;
+0981;BENGALI SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+0982;BENGALI SIGN ANUSVARA;Mc;0;L;;;;;N;;;;;
+0983;BENGALI SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+0985;BENGALI LETTER A;Lo;0;L;;;;;N;;;;;
+0986;BENGALI LETTER AA;Lo;0;L;;;;;N;;;;;
+0987;BENGALI LETTER I;Lo;0;L;;;;;N;;;;;
+0988;BENGALI LETTER II;Lo;0;L;;;;;N;;;;;
+0989;BENGALI LETTER U;Lo;0;L;;;;;N;;;;;
+098A;BENGALI LETTER UU;Lo;0;L;;;;;N;;;;;
+098B;BENGALI LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+098C;BENGALI LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+098F;BENGALI LETTER E;Lo;0;L;;;;;N;;;;;
+0990;BENGALI LETTER AI;Lo;0;L;;;;;N;;;;;
+0993;BENGALI LETTER O;Lo;0;L;;;;;N;;;;;
+0994;BENGALI LETTER AU;Lo;0;L;;;;;N;;;;;
+0995;BENGALI LETTER KA;Lo;0;L;;;;;N;;;;;
+0996;BENGALI LETTER KHA;Lo;0;L;;;;;N;;;;;
+0997;BENGALI LETTER GA;Lo;0;L;;;;;N;;;;;
+0998;BENGALI LETTER GHA;Lo;0;L;;;;;N;;;;;
+0999;BENGALI LETTER NGA;Lo;0;L;;;;;N;;;;;
+099A;BENGALI LETTER CA;Lo;0;L;;;;;N;;;;;
+099B;BENGALI LETTER CHA;Lo;0;L;;;;;N;;;;;
+099C;BENGALI LETTER JA;Lo;0;L;;;;;N;;;;;
+099D;BENGALI LETTER JHA;Lo;0;L;;;;;N;;;;;
+099E;BENGALI LETTER NYA;Lo;0;L;;;;;N;;;;;
+099F;BENGALI LETTER TTA;Lo;0;L;;;;;N;;;;;
+09A0;BENGALI LETTER TTHA;Lo;0;L;;;;;N;;;;;
+09A1;BENGALI LETTER DDA;Lo;0;L;;;;;N;;;;;
+09A2;BENGALI LETTER DDHA;Lo;0;L;;;;;N;;;;;
+09A3;BENGALI LETTER NNA;Lo;0;L;;;;;N;;;;;
+09A4;BENGALI LETTER TA;Lo;0;L;;;;;N;;;;;
+09A5;BENGALI LETTER THA;Lo;0;L;;;;;N;;;;;
+09A6;BENGALI LETTER DA;Lo;0;L;;;;;N;;;;;
+09A7;BENGALI LETTER DHA;Lo;0;L;;;;;N;;;;;
+09A8;BENGALI LETTER NA;Lo;0;L;;;;;N;;;;;
+09AA;BENGALI LETTER PA;Lo;0;L;;;;;N;;;;;
+09AB;BENGALI LETTER PHA;Lo;0;L;;;;;N;;;;;
+09AC;BENGALI LETTER BA;Lo;0;L;;;;;N;;;;;
+09AD;BENGALI LETTER BHA;Lo;0;L;;;;;N;;;;;
+09AE;BENGALI LETTER MA;Lo;0;L;;;;;N;;;;;
+09AF;BENGALI LETTER YA;Lo;0;L;;;;;N;;;;;
+09B0;BENGALI LETTER RA;Lo;0;L;;;;;N;;;;;
+09B2;BENGALI LETTER LA;Lo;0;L;;;;;N;;;;;
+09B6;BENGALI LETTER SHA;Lo;0;L;;;;;N;;;;;
+09B7;BENGALI LETTER SSA;Lo;0;L;;;;;N;;;;;
+09B8;BENGALI LETTER SA;Lo;0;L;;;;;N;;;;;
+09B9;BENGALI LETTER HA;Lo;0;L;;;;;N;;;;;
+09BC;BENGALI SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+09BD;BENGALI SIGN AVAGRAHA;Lo;0;L;;;;;N;;;;;
+09BE;BENGALI VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+09BF;BENGALI VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+09C0;BENGALI VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+09C1;BENGALI VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+09C2;BENGALI VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+09C3;BENGALI VOWEL SIGN VOCALIC R;Mn;0;NSM;;;;;N;;;;;
+09C4;BENGALI VOWEL SIGN VOCALIC RR;Mn;0;NSM;;;;;N;;;;;
+09C7;BENGALI VOWEL SIGN E;Mc;0;L;;;;;N;;;;;
+09C8;BENGALI VOWEL SIGN AI;Mc;0;L;;;;;N;;;;;
+09CB;BENGALI VOWEL SIGN O;Mc;0;L;09C7 09BE;;;;N;;;;;
+09CC;BENGALI VOWEL SIGN AU;Mc;0;L;09C7 09D7;;;;N;;;;;
+09CD;BENGALI SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+09CE;BENGALI LETTER KHANDA TA;Lo;0;L;;;;;N;;;;;
+09D7;BENGALI AU LENGTH MARK;Mc;0;L;;;;;N;;;;;
+09DC;BENGALI LETTER RRA;Lo;0;L;09A1 09BC;;;;N;;;;;
+09DD;BENGALI LETTER RHA;Lo;0;L;09A2 09BC;;;;N;;;;;
+09DF;BENGALI LETTER YYA;Lo;0;L;09AF 09BC;;;;N;;;;;
+09E0;BENGALI LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+09E1;BENGALI LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+09E2;BENGALI VOWEL SIGN VOCALIC L;Mn;0;NSM;;;;;N;;;;;
+09E3;BENGALI VOWEL SIGN VOCALIC LL;Mn;0;NSM;;;;;N;;;;;
+09E6;BENGALI DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+09E7;BENGALI DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+09E8;BENGALI DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+09E9;BENGALI DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+09EA;BENGALI DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+09EB;BENGALI DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+09EC;BENGALI DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+09ED;BENGALI DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+09EE;BENGALI DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+09EF;BENGALI DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+09F0;BENGALI LETTER RA WITH MIDDLE DIAGONAL;Lo;0;L;;;;;N;;;;;
+09F1;BENGALI LETTER RA WITH LOWER DIAGONAL;Lo;0;L;;;;;N;BENGALI LETTER VA WITH LOWER DIAGONAL;;;;
+09F2;BENGALI RUPEE MARK;Sc;0;ET;;;;;N;;;;;
+09F3;BENGALI RUPEE SIGN;Sc;0;ET;;;;;N;;;;;
+09F4;BENGALI CURRENCY NUMERATOR ONE;No;0;L;;;;1/16;N;;;;;
+09F5;BENGALI CURRENCY NUMERATOR TWO;No;0;L;;;;1/8;N;;;;;
+09F6;BENGALI CURRENCY NUMERATOR THREE;No;0;L;;;;3/16;N;;;;;
+09F7;BENGALI CURRENCY NUMERATOR FOUR;No;0;L;;;;1/4;N;;;;;
+09F8;BENGALI CURRENCY NUMERATOR ONE LESS THAN THE DENOMINATOR;No;0;L;;;;3/4;N;;;;;
+09F9;BENGALI CURRENCY DENOMINATOR SIXTEEN;No;0;L;;;;16;N;;;;;
+09FA;BENGALI ISSHAR;So;0;L;;;;;N;;;;;
+09FB;BENGALI GANDA MARK;Sc;0;ET;;;;;N;;;;;
+09FC;BENGALI LETTER VEDIC ANUSVARA;Lo;0;L;;;;;N;;;;;
+09FD;BENGALI ABBREVIATION SIGN;Po;0;L;;;;;N;;;;;
+0A01;GURMUKHI SIGN ADAK BINDI;Mn;0;NSM;;;;;N;;;;;
+0A02;GURMUKHI SIGN BINDI;Mn;0;NSM;;;;;N;;;;;
+0A03;GURMUKHI SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+0A05;GURMUKHI LETTER A;Lo;0;L;;;;;N;;;;;
+0A06;GURMUKHI LETTER AA;Lo;0;L;;;;;N;;;;;
+0A07;GURMUKHI LETTER I;Lo;0;L;;;;;N;;;;;
+0A08;GURMUKHI LETTER II;Lo;0;L;;;;;N;;;;;
+0A09;GURMUKHI LETTER U;Lo;0;L;;;;;N;;;;;
+0A0A;GURMUKHI LETTER UU;Lo;0;L;;;;;N;;;;;
+0A0F;GURMUKHI LETTER EE;Lo;0;L;;;;;N;;;;;
+0A10;GURMUKHI LETTER AI;Lo;0;L;;;;;N;;;;;
+0A13;GURMUKHI LETTER OO;Lo;0;L;;;;;N;;;;;
+0A14;GURMUKHI LETTER AU;Lo;0;L;;;;;N;;;;;
+0A15;GURMUKHI LETTER KA;Lo;0;L;;;;;N;;;;;
+0A16;GURMUKHI LETTER KHA;Lo;0;L;;;;;N;;;;;
+0A17;GURMUKHI LETTER GA;Lo;0;L;;;;;N;;;;;
+0A18;GURMUKHI LETTER GHA;Lo;0;L;;;;;N;;;;;
+0A19;GURMUKHI LETTER NGA;Lo;0;L;;;;;N;;;;;
+0A1A;GURMUKHI LETTER CA;Lo;0;L;;;;;N;;;;;
+0A1B;GURMUKHI LETTER CHA;Lo;0;L;;;;;N;;;;;
+0A1C;GURMUKHI LETTER JA;Lo;0;L;;;;;N;;;;;
+0A1D;GURMUKHI LETTER JHA;Lo;0;L;;;;;N;;;;;
+0A1E;GURMUKHI LETTER NYA;Lo;0;L;;;;;N;;;;;
+0A1F;GURMUKHI LETTER TTA;Lo;0;L;;;;;N;;;;;
+0A20;GURMUKHI LETTER TTHA;Lo;0;L;;;;;N;;;;;
+0A21;GURMUKHI LETTER DDA;Lo;0;L;;;;;N;;;;;
+0A22;GURMUKHI LETTER DDHA;Lo;0;L;;;;;N;;;;;
+0A23;GURMUKHI LETTER NNA;Lo;0;L;;;;;N;;;;;
+0A24;GURMUKHI LETTER TA;Lo;0;L;;;;;N;;;;;
+0A25;GURMUKHI LETTER THA;Lo;0;L;;;;;N;;;;;
+0A26;GURMUKHI LETTER DA;Lo;0;L;;;;;N;;;;;
+0A27;GURMUKHI LETTER DHA;Lo;0;L;;;;;N;;;;;
+0A28;GURMUKHI LETTER NA;Lo;0;L;;;;;N;;;;;
+0A2A;GURMUKHI LETTER PA;Lo;0;L;;;;;N;;;;;
+0A2B;GURMUKHI LETTER PHA;Lo;0;L;;;;;N;;;;;
+0A2C;GURMUKHI LETTER BA;Lo;0;L;;;;;N;;;;;
+0A2D;GURMUKHI LETTER BHA;Lo;0;L;;;;;N;;;;;
+0A2E;GURMUKHI LETTER MA;Lo;0;L;;;;;N;;;;;
+0A2F;GURMUKHI LETTER YA;Lo;0;L;;;;;N;;;;;
+0A30;GURMUKHI LETTER RA;Lo;0;L;;;;;N;;;;;
+0A32;GURMUKHI LETTER LA;Lo;0;L;;;;;N;;;;;
+0A33;GURMUKHI LETTER LLA;Lo;0;L;0A32 0A3C;;;;N;;;;;
+0A35;GURMUKHI LETTER VA;Lo;0;L;;;;;N;;;;;
+0A36;GURMUKHI LETTER SHA;Lo;0;L;0A38 0A3C;;;;N;;;;;
+0A38;GURMUKHI LETTER SA;Lo;0;L;;;;;N;;;;;
+0A39;GURMUKHI LETTER HA;Lo;0;L;;;;;N;;;;;
+0A3C;GURMUKHI SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+0A3E;GURMUKHI VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+0A3F;GURMUKHI VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+0A40;GURMUKHI VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+0A41;GURMUKHI VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+0A42;GURMUKHI VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+0A47;GURMUKHI VOWEL SIGN EE;Mn;0;NSM;;;;;N;;;;;
+0A48;GURMUKHI VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+0A4B;GURMUKHI VOWEL SIGN OO;Mn;0;NSM;;;;;N;;;;;
+0A4C;GURMUKHI VOWEL SIGN AU;Mn;0;NSM;;;;;N;;;;;
+0A4D;GURMUKHI SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+0A51;GURMUKHI SIGN UDAAT;Mn;0;NSM;;;;;N;;;;;
+0A59;GURMUKHI LETTER KHHA;Lo;0;L;0A16 0A3C;;;;N;;;;;
+0A5A;GURMUKHI LETTER GHHA;Lo;0;L;0A17 0A3C;;;;N;;;;;
+0A5B;GURMUKHI LETTER ZA;Lo;0;L;0A1C 0A3C;;;;N;;;;;
+0A5C;GURMUKHI LETTER RRA;Lo;0;L;;;;;N;;;;;
+0A5E;GURMUKHI LETTER FA;Lo;0;L;0A2B 0A3C;;;;N;;;;;
+0A66;GURMUKHI DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+0A67;GURMUKHI DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+0A68;GURMUKHI DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+0A69;GURMUKHI DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+0A6A;GURMUKHI DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+0A6B;GURMUKHI DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+0A6C;GURMUKHI DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+0A6D;GURMUKHI DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+0A6E;GURMUKHI DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+0A6F;GURMUKHI DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+0A70;GURMUKHI TIPPI;Mn;0;NSM;;;;;N;;;;;
+0A71;GURMUKHI ADDAK;Mn;0;NSM;;;;;N;;;;;
+0A72;GURMUKHI IRI;Lo;0;L;;;;;N;;;;;
+0A73;GURMUKHI URA;Lo;0;L;;;;;N;;;;;
+0A74;GURMUKHI EK ONKAR;Lo;0;L;;;;;N;;;;;
+0A75;GURMUKHI SIGN YAKASH;Mn;0;NSM;;;;;N;;;;;
+0A81;GUJARATI SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+0A82;GUJARATI SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+0A83;GUJARATI SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+0A85;GUJARATI LETTER A;Lo;0;L;;;;;N;;;;;
+0A86;GUJARATI LETTER AA;Lo;0;L;;;;;N;;;;;
+0A87;GUJARATI LETTER I;Lo;0;L;;;;;N;;;;;
+0A88;GUJARATI LETTER II;Lo;0;L;;;;;N;;;;;
+0A89;GUJARATI LETTER U;Lo;0;L;;;;;N;;;;;
+0A8A;GUJARATI LETTER UU;Lo;0;L;;;;;N;;;;;
+0A8B;GUJARATI LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+0A8C;GUJARATI LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+0A8D;GUJARATI VOWEL CANDRA E;Lo;0;L;;;;;N;;;;;
+0A8F;GUJARATI LETTER E;Lo;0;L;;;;;N;;;;;
+0A90;GUJARATI LETTER AI;Lo;0;L;;;;;N;;;;;
+0A91;GUJARATI VOWEL CANDRA O;Lo;0;L;;;;;N;;;;;
+0A93;GUJARATI LETTER O;Lo;0;L;;;;;N;;;;;
+0A94;GUJARATI LETTER AU;Lo;0;L;;;;;N;;;;;
+0A95;GUJARATI LETTER KA;Lo;0;L;;;;;N;;;;;
+0A96;GUJARATI LETTER KHA;Lo;0;L;;;;;N;;;;;
+0A97;GUJARATI LETTER GA;Lo;0;L;;;;;N;;;;;
+0A98;GUJARATI LETTER GHA;Lo;0;L;;;;;N;;;;;
+0A99;GUJARATI LETTER NGA;Lo;0;L;;;;;N;;;;;
+0A9A;GUJARATI LETTER CA;Lo;0;L;;;;;N;;;;;
+0A9B;GUJARATI LETTER CHA;Lo;0;L;;;;;N;;;;;
+0A9C;GUJARATI LETTER JA;Lo;0;L;;;;;N;;;;;
+0A9D;GUJARATI LETTER JHA;Lo;0;L;;;;;N;;;;;
+0A9E;GUJARATI LETTER NYA;Lo;0;L;;;;;N;;;;;
+0A9F;GUJARATI LETTER TTA;Lo;0;L;;;;;N;;;;;
+0AA0;GUJARATI LETTER TTHA;Lo;0;L;;;;;N;;;;;
+0AA1;GUJARATI LETTER DDA;Lo;0;L;;;;;N;;;;;
+0AA2;GUJARATI LETTER DDHA;Lo;0;L;;;;;N;;;;;
+0AA3;GUJARATI LETTER NNA;Lo;0;L;;;;;N;;;;;
+0AA4;GUJARATI LETTER TA;Lo;0;L;;;;;N;;;;;
+0AA5;GUJARATI LETTER THA;Lo;0;L;;;;;N;;;;;
+0AA6;GUJARATI LETTER DA;Lo;0;L;;;;;N;;;;;
+0AA7;GUJARATI LETTER DHA;Lo;0;L;;;;;N;;;;;
+0AA8;GUJARATI LETTER NA;Lo;0;L;;;;;N;;;;;
+0AAA;GUJARATI LETTER PA;Lo;0;L;;;;;N;;;;;
+0AAB;GUJARATI LETTER PHA;Lo;0;L;;;;;N;;;;;
+0AAC;GUJARATI LETTER BA;Lo;0;L;;;;;N;;;;;
+0AAD;GUJARATI LETTER BHA;Lo;0;L;;;;;N;;;;;
+0AAE;GUJARATI LETTER MA;Lo;0;L;;;;;N;;;;;
+0AAF;GUJARATI LETTER YA;Lo;0;L;;;;;N;;;;;
+0AB0;GUJARATI LETTER RA;Lo;0;L;;;;;N;;;;;
+0AB2;GUJARATI LETTER LA;Lo;0;L;;;;;N;;;;;
+0AB3;GUJARATI LETTER LLA;Lo;0;L;;;;;N;;;;;
+0AB5;GUJARATI LETTER VA;Lo;0;L;;;;;N;;;;;
+0AB6;GUJARATI LETTER SHA;Lo;0;L;;;;;N;;;;;
+0AB7;GUJARATI LETTER SSA;Lo;0;L;;;;;N;;;;;
+0AB8;GUJARATI LETTER SA;Lo;0;L;;;;;N;;;;;
+0AB9;GUJARATI LETTER HA;Lo;0;L;;;;;N;;;;;
+0ABC;GUJARATI SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+0ABD;GUJARATI SIGN AVAGRAHA;Lo;0;L;;;;;N;;;;;
+0ABE;GUJARATI VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+0ABF;GUJARATI VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+0AC0;GUJARATI VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+0AC1;GUJARATI VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+0AC2;GUJARATI VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+0AC3;GUJARATI VOWEL SIGN VOCALIC R;Mn;0;NSM;;;;;N;;;;;
+0AC4;GUJARATI VOWEL SIGN VOCALIC RR;Mn;0;NSM;;;;;N;;;;;
+0AC5;GUJARATI VOWEL SIGN CANDRA E;Mn;0;NSM;;;;;N;;;;;
+0AC7;GUJARATI VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+0AC8;GUJARATI VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+0AC9;GUJARATI VOWEL SIGN CANDRA O;Mc;0;L;;;;;N;;;;;
+0ACB;GUJARATI VOWEL SIGN O;Mc;0;L;;;;;N;;;;;
+0ACC;GUJARATI VOWEL SIGN AU;Mc;0;L;;;;;N;;;;;
+0ACD;GUJARATI SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+0AD0;GUJARATI OM;Lo;0;L;;;;;N;;;;;
+0AE0;GUJARATI LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+0AE1;GUJARATI LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+0AE2;GUJARATI VOWEL SIGN VOCALIC L;Mn;0;NSM;;;;;N;;;;;
+0AE3;GUJARATI VOWEL SIGN VOCALIC LL;Mn;0;NSM;;;;;N;;;;;
+0AE6;GUJARATI DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+0AE7;GUJARATI DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+0AE8;GUJARATI DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+0AE9;GUJARATI DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+0AEA;GUJARATI DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+0AEB;GUJARATI DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+0AEC;GUJARATI DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+0AED;GUJARATI DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+0AEE;GUJARATI DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+0AEF;GUJARATI DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+0AF0;GUJARATI ABBREVIATION SIGN;Po;0;L;;;;;N;;;;;
+0AF1;GUJARATI RUPEE SIGN;Sc;0;ET;;;;;N;;;;;
+0AF9;GUJARATI LETTER ZHA;Lo;0;L;;;;;N;;;;;
+0AFA;GUJARATI SIGN SUKUN;Mn;0;NSM;;;;;N;;;;;
+0AFB;GUJARATI SIGN SHADDA;Mn;0;NSM;;;;;N;;;;;
+0AFC;GUJARATI SIGN MADDAH;Mn;0;NSM;;;;;N;;;;;
+0AFD;GUJARATI SIGN THREE-DOT NUKTA ABOVE;Mn;0;NSM;;;;;N;;;;;
+0AFE;GUJARATI SIGN CIRCLE NUKTA ABOVE;Mn;0;NSM;;;;;N;;;;;
+0AFF;GUJARATI SIGN TWO-CIRCLE NUKTA ABOVE;Mn;0;NSM;;;;;N;;;;;
+0B01;ORIYA SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+0B02;ORIYA SIGN ANUSVARA;Mc;0;L;;;;;N;;;;;
+0B03;ORIYA SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+0B05;ORIYA LETTER A;Lo;0;L;;;;;N;;;;;
+0B06;ORIYA LETTER AA;Lo;0;L;;;;;N;;;;;
+0B07;ORIYA LETTER I;Lo;0;L;;;;;N;;;;;
+0B08;ORIYA LETTER II;Lo;0;L;;;;;N;;;;;
+0B09;ORIYA LETTER U;Lo;0;L;;;;;N;;;;;
+0B0A;ORIYA LETTER UU;Lo;0;L;;;;;N;;;;;
+0B0B;ORIYA LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+0B0C;ORIYA LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+0B0F;ORIYA LETTER E;Lo;0;L;;;;;N;;;;;
+0B10;ORIYA LETTER AI;Lo;0;L;;;;;N;;;;;
+0B13;ORIYA LETTER O;Lo;0;L;;;;;N;;;;;
+0B14;ORIYA LETTER AU;Lo;0;L;;;;;N;;;;;
+0B15;ORIYA LETTER KA;Lo;0;L;;;;;N;;;;;
+0B16;ORIYA LETTER KHA;Lo;0;L;;;;;N;;;;;
+0B17;ORIYA LETTER GA;Lo;0;L;;;;;N;;;;;
+0B18;ORIYA LETTER GHA;Lo;0;L;;;;;N;;;;;
+0B19;ORIYA LETTER NGA;Lo;0;L;;;;;N;;;;;
+0B1A;ORIYA LETTER CA;Lo;0;L;;;;;N;;;;;
+0B1B;ORIYA LETTER CHA;Lo;0;L;;;;;N;;;;;
+0B1C;ORIYA LETTER JA;Lo;0;L;;;;;N;;;;;
+0B1D;ORIYA LETTER JHA;Lo;0;L;;;;;N;;;;;
+0B1E;ORIYA LETTER NYA;Lo;0;L;;;;;N;;;;;
+0B1F;ORIYA LETTER TTA;Lo;0;L;;;;;N;;;;;
+0B20;ORIYA LETTER TTHA;Lo;0;L;;;;;N;;;;;
+0B21;ORIYA LETTER DDA;Lo;0;L;;;;;N;;;;;
+0B22;ORIYA LETTER DDHA;Lo;0;L;;;;;N;;;;;
+0B23;ORIYA LETTER NNA;Lo;0;L;;;;;N;;;;;
+0B24;ORIYA LETTER TA;Lo;0;L;;;;;N;;;;;
+0B25;ORIYA LETTER THA;Lo;0;L;;;;;N;;;;;
+0B26;ORIYA LETTER DA;Lo;0;L;;;;;N;;;;;
+0B27;ORIYA LETTER DHA;Lo;0;L;;;;;N;;;;;
+0B28;ORIYA LETTER NA;Lo;0;L;;;;;N;;;;;
+0B2A;ORIYA LETTER PA;Lo;0;L;;;;;N;;;;;
+0B2B;ORIYA LETTER PHA;Lo;0;L;;;;;N;;;;;
+0B2C;ORIYA LETTER BA;Lo;0;L;;;;;N;;;;;
+0B2D;ORIYA LETTER BHA;Lo;0;L;;;;;N;;;;;
+0B2E;ORIYA LETTER MA;Lo;0;L;;;;;N;;;;;
+0B2F;ORIYA LETTER YA;Lo;0;L;;;;;N;;;;;
+0B30;ORIYA LETTER RA;Lo;0;L;;;;;N;;;;;
+0B32;ORIYA LETTER LA;Lo;0;L;;;;;N;;;;;
+0B33;ORIYA LETTER LLA;Lo;0;L;;;;;N;;;;;
+0B35;ORIYA LETTER VA;Lo;0;L;;;;;N;;;;;
+0B36;ORIYA LETTER SHA;Lo;0;L;;;;;N;;;;;
+0B37;ORIYA LETTER SSA;Lo;0;L;;;;;N;;;;;
+0B38;ORIYA LETTER SA;Lo;0;L;;;;;N;;;;;
+0B39;ORIYA LETTER HA;Lo;0;L;;;;;N;;;;;
+0B3C;ORIYA SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+0B3D;ORIYA SIGN AVAGRAHA;Lo;0;L;;;;;N;;;;;
+0B3E;ORIYA VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+0B3F;ORIYA VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+0B40;ORIYA VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+0B41;ORIYA VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+0B42;ORIYA VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+0B43;ORIYA VOWEL SIGN VOCALIC R;Mn;0;NSM;;;;;N;;;;;
+0B44;ORIYA VOWEL SIGN VOCALIC RR;Mn;0;NSM;;;;;N;;;;;
+0B47;ORIYA VOWEL SIGN E;Mc;0;L;;;;;N;;;;;
+0B48;ORIYA VOWEL SIGN AI;Mc;0;L;0B47 0B56;;;;N;;;;;
+0B4B;ORIYA VOWEL SIGN O;Mc;0;L;0B47 0B3E;;;;N;;;;;
+0B4C;ORIYA VOWEL SIGN AU;Mc;0;L;0B47 0B57;;;;N;;;;;
+0B4D;ORIYA SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+0B56;ORIYA AI LENGTH MARK;Mn;0;NSM;;;;;N;;;;;
+0B57;ORIYA AU LENGTH MARK;Mc;0;L;;;;;N;;;;;
+0B5C;ORIYA LETTER RRA;Lo;0;L;0B21 0B3C;;;;N;;;;;
+0B5D;ORIYA LETTER RHA;Lo;0;L;0B22 0B3C;;;;N;;;;;
+0B5F;ORIYA LETTER YYA;Lo;0;L;;;;;N;;;;;
+0B60;ORIYA LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+0B61;ORIYA LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+0B62;ORIYA VOWEL SIGN VOCALIC L;Mn;0;NSM;;;;;N;;;;;
+0B63;ORIYA VOWEL SIGN VOCALIC LL;Mn;0;NSM;;;;;N;;;;;
+0B66;ORIYA DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+0B67;ORIYA DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+0B68;ORIYA DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+0B69;ORIYA DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+0B6A;ORIYA DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+0B6B;ORIYA DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+0B6C;ORIYA DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+0B6D;ORIYA DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+0B6E;ORIYA DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+0B6F;ORIYA DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+0B70;ORIYA ISSHAR;So;0;L;;;;;N;;;;;
+0B71;ORIYA LETTER WA;Lo;0;L;;;;;N;;;;;
+0B72;ORIYA FRACTION ONE QUARTER;No;0;L;;;;1/4;N;;;;;
+0B73;ORIYA FRACTION ONE HALF;No;0;L;;;;1/2;N;;;;;
+0B74;ORIYA FRACTION THREE QUARTERS;No;0;L;;;;3/4;N;;;;;
+0B75;ORIYA FRACTION ONE SIXTEENTH;No;0;L;;;;1/16;N;;;;;
+0B76;ORIYA FRACTION ONE EIGHTH;No;0;L;;;;1/8;N;;;;;
+0B77;ORIYA FRACTION THREE SIXTEENTHS;No;0;L;;;;3/16;N;;;;;
+0B82;TAMIL SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+0B83;TAMIL SIGN VISARGA;Lo;0;L;;;;;N;;;;;
+0B85;TAMIL LETTER A;Lo;0;L;;;;;N;;;;;
+0B86;TAMIL LETTER AA;Lo;0;L;;;;;N;;;;;
+0B87;TAMIL LETTER I;Lo;0;L;;;;;N;;;;;
+0B88;TAMIL LETTER II;Lo;0;L;;;;;N;;;;;
+0B89;TAMIL LETTER U;Lo;0;L;;;;;N;;;;;
+0B8A;TAMIL LETTER UU;Lo;0;L;;;;;N;;;;;
+0B8E;TAMIL LETTER E;Lo;0;L;;;;;N;;;;;
+0B8F;TAMIL LETTER EE;Lo;0;L;;;;;N;;;;;
+0B90;TAMIL LETTER AI;Lo;0;L;;;;;N;;;;;
+0B92;TAMIL LETTER O;Lo;0;L;;;;;N;;;;;
+0B93;TAMIL LETTER OO;Lo;0;L;;;;;N;;;;;
+0B94;TAMIL LETTER AU;Lo;0;L;0B92 0BD7;;;;N;;;;;
+0B95;TAMIL LETTER KA;Lo;0;L;;;;;N;;;;;
+0B99;TAMIL LETTER NGA;Lo;0;L;;;;;N;;;;;
+0B9A;TAMIL LETTER CA;Lo;0;L;;;;;N;;;;;
+0B9C;TAMIL LETTER JA;Lo;0;L;;;;;N;;;;;
+0B9E;TAMIL LETTER NYA;Lo;0;L;;;;;N;;;;;
+0B9F;TAMIL LETTER TTA;Lo;0;L;;;;;N;;;;;
+0BA3;TAMIL LETTER NNA;Lo;0;L;;;;;N;;;;;
+0BA4;TAMIL LETTER TA;Lo;0;L;;;;;N;;;;;
+0BA8;TAMIL LETTER NA;Lo;0;L;;;;;N;;;;;
+0BA9;TAMIL LETTER NNNA;Lo;0;L;;;;;N;;;;;
+0BAA;TAMIL LETTER PA;Lo;0;L;;;;;N;;;;;
+0BAE;TAMIL LETTER MA;Lo;0;L;;;;;N;;;;;
+0BAF;TAMIL LETTER YA;Lo;0;L;;;;;N;;;;;
+0BB0;TAMIL LETTER RA;Lo;0;L;;;;;N;;;;;
+0BB1;TAMIL LETTER RRA;Lo;0;L;;;;;N;;;;;
+0BB2;TAMIL LETTER LA;Lo;0;L;;;;;N;;;;;
+0BB3;TAMIL LETTER LLA;Lo;0;L;;;;;N;;;;;
+0BB4;TAMIL LETTER LLLA;Lo;0;L;;;;;N;;;;;
+0BB5;TAMIL LETTER VA;Lo;0;L;;;;;N;;;;;
+0BB6;TAMIL LETTER SHA;Lo;0;L;;;;;N;;;;;
+0BB7;TAMIL LETTER SSA;Lo;0;L;;;;;N;;;;;
+0BB8;TAMIL LETTER SA;Lo;0;L;;;;;N;;;;;
+0BB9;TAMIL LETTER HA;Lo;0;L;;;;;N;;;;;
+0BBE;TAMIL VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+0BBF;TAMIL VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+0BC0;TAMIL VOWEL SIGN II;Mn;0;NSM;;;;;N;;;;;
+0BC1;TAMIL VOWEL SIGN U;Mc;0;L;;;;;N;;;;;
+0BC2;TAMIL VOWEL SIGN UU;Mc;0;L;;;;;N;;;;;
+0BC6;TAMIL VOWEL SIGN E;Mc;0;L;;;;;N;;;;;
+0BC7;TAMIL VOWEL SIGN EE;Mc;0;L;;;;;N;;;;;
+0BC8;TAMIL VOWEL SIGN AI;Mc;0;L;;;;;N;;;;;
+0BCA;TAMIL VOWEL SIGN O;Mc;0;L;0BC6 0BBE;;;;N;;;;;
+0BCB;TAMIL VOWEL SIGN OO;Mc;0;L;0BC7 0BBE;;;;N;;;;;
+0BCC;TAMIL VOWEL SIGN AU;Mc;0;L;0BC6 0BD7;;;;N;;;;;
+0BCD;TAMIL SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+0BD0;TAMIL OM;Lo;0;L;;;;;N;;;;;
+0BD7;TAMIL AU LENGTH MARK;Mc;0;L;;;;;N;;;;;
+0BE6;TAMIL DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+0BE7;TAMIL DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+0BE8;TAMIL DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+0BE9;TAMIL DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+0BEA;TAMIL DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+0BEB;TAMIL DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+0BEC;TAMIL DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+0BED;TAMIL DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+0BEE;TAMIL DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+0BEF;TAMIL DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+0BF0;TAMIL NUMBER TEN;No;0;L;;;;10;N;;;;;
+0BF1;TAMIL NUMBER ONE HUNDRED;No;0;L;;;;100;N;;;;;
+0BF2;TAMIL NUMBER ONE THOUSAND;No;0;L;;;;1000;N;;;;;
+0BF3;TAMIL DAY SIGN;So;0;ON;;;;;N;;;;;
+0BF4;TAMIL MONTH SIGN;So;0;ON;;;;;N;;;;;
+0BF5;TAMIL YEAR SIGN;So;0;ON;;;;;N;;;;;
+0BF6;TAMIL DEBIT SIGN;So;0;ON;;;;;N;;;;;
+0BF7;TAMIL CREDIT SIGN;So;0;ON;;;;;N;;;;;
+0BF8;TAMIL AS ABOVE SIGN;So;0;ON;;;;;N;;;;;
+0BF9;TAMIL RUPEE SIGN;Sc;0;ET;;;;;N;;;;;
+0BFA;TAMIL NUMBER SIGN;So;0;ON;;;;;N;;;;;
+0C00;TELUGU SIGN COMBINING CANDRABINDU ABOVE;Mn;0;NSM;;;;;N;;;;;
+0C01;TELUGU SIGN CANDRABINDU;Mc;0;L;;;;;N;;;;;
+0C02;TELUGU SIGN ANUSVARA;Mc;0;L;;;;;N;;;;;
+0C03;TELUGU SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+0C05;TELUGU LETTER A;Lo;0;L;;;;;N;;;;;
+0C06;TELUGU LETTER AA;Lo;0;L;;;;;N;;;;;
+0C07;TELUGU LETTER I;Lo;0;L;;;;;N;;;;;
+0C08;TELUGU LETTER II;Lo;0;L;;;;;N;;;;;
+0C09;TELUGU LETTER U;Lo;0;L;;;;;N;;;;;
+0C0A;TELUGU LETTER UU;Lo;0;L;;;;;N;;;;;
+0C0B;TELUGU LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+0C0C;TELUGU LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+0C0E;TELUGU LETTER E;Lo;0;L;;;;;N;;;;;
+0C0F;TELUGU LETTER EE;Lo;0;L;;;;;N;;;;;
+0C10;TELUGU LETTER AI;Lo;0;L;;;;;N;;;;;
+0C12;TELUGU LETTER O;Lo;0;L;;;;;N;;;;;
+0C13;TELUGU LETTER OO;Lo;0;L;;;;;N;;;;;
+0C14;TELUGU LETTER AU;Lo;0;L;;;;;N;;;;;
+0C15;TELUGU LETTER KA;Lo;0;L;;;;;N;;;;;
+0C16;TELUGU LETTER KHA;Lo;0;L;;;;;N;;;;;
+0C17;TELUGU LETTER GA;Lo;0;L;;;;;N;;;;;
+0C18;TELUGU LETTER GHA;Lo;0;L;;;;;N;;;;;
+0C19;TELUGU LETTER NGA;Lo;0;L;;;;;N;;;;;
+0C1A;TELUGU LETTER CA;Lo;0;L;;;;;N;;;;;
+0C1B;TELUGU LETTER CHA;Lo;0;L;;;;;N;;;;;
+0C1C;TELUGU LETTER JA;Lo;0;L;;;;;N;;;;;
+0C1D;TELUGU LETTER JHA;Lo;0;L;;;;;N;;;;;
+0C1E;TELUGU LETTER NYA;Lo;0;L;;;;;N;;;;;
+0C1F;TELUGU LETTER TTA;Lo;0;L;;;;;N;;;;;
+0C20;TELUGU LETTER TTHA;Lo;0;L;;;;;N;;;;;
+0C21;TELUGU LETTER DDA;Lo;0;L;;;;;N;;;;;
+0C22;TELUGU LETTER DDHA;Lo;0;L;;;;;N;;;;;
+0C23;TELUGU LETTER NNA;Lo;0;L;;;;;N;;;;;
+0C24;TELUGU LETTER TA;Lo;0;L;;;;;N;;;;;
+0C25;TELUGU LETTER THA;Lo;0;L;;;;;N;;;;;
+0C26;TELUGU LETTER DA;Lo;0;L;;;;;N;;;;;
+0C27;TELUGU LETTER DHA;Lo;0;L;;;;;N;;;;;
+0C28;TELUGU LETTER NA;Lo;0;L;;;;;N;;;;;
+0C2A;TELUGU LETTER PA;Lo;0;L;;;;;N;;;;;
+0C2B;TELUGU LETTER PHA;Lo;0;L;;;;;N;;;;;
+0C2C;TELUGU LETTER BA;Lo;0;L;;;;;N;;;;;
+0C2D;TELUGU LETTER BHA;Lo;0;L;;;;;N;;;;;
+0C2E;TELUGU LETTER MA;Lo;0;L;;;;;N;;;;;
+0C2F;TELUGU LETTER YA;Lo;0;L;;;;;N;;;;;
+0C30;TELUGU LETTER RA;Lo;0;L;;;;;N;;;;;
+0C31;TELUGU LETTER RRA;Lo;0;L;;;;;N;;;;;
+0C32;TELUGU LETTER LA;Lo;0;L;;;;;N;;;;;
+0C33;TELUGU LETTER LLA;Lo;0;L;;;;;N;;;;;
+0C34;TELUGU LETTER LLLA;Lo;0;L;;;;;N;;;;;
+0C35;TELUGU LETTER VA;Lo;0;L;;;;;N;;;;;
+0C36;TELUGU LETTER SHA;Lo;0;L;;;;;N;;;;;
+0C37;TELUGU LETTER SSA;Lo;0;L;;;;;N;;;;;
+0C38;TELUGU LETTER SA;Lo;0;L;;;;;N;;;;;
+0C39;TELUGU LETTER HA;Lo;0;L;;;;;N;;;;;
+0C3D;TELUGU SIGN AVAGRAHA;Lo;0;L;;;;;N;;;;;
+0C3E;TELUGU VOWEL SIGN AA;Mn;0;NSM;;;;;N;;;;;
+0C3F;TELUGU VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+0C40;TELUGU VOWEL SIGN II;Mn;0;NSM;;;;;N;;;;;
+0C41;TELUGU VOWEL SIGN U;Mc;0;L;;;;;N;;;;;
+0C42;TELUGU VOWEL SIGN UU;Mc;0;L;;;;;N;;;;;
+0C43;TELUGU VOWEL SIGN VOCALIC R;Mc;0;L;;;;;N;;;;;
+0C44;TELUGU VOWEL SIGN VOCALIC RR;Mc;0;L;;;;;N;;;;;
+0C46;TELUGU VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+0C47;TELUGU VOWEL SIGN EE;Mn;0;NSM;;;;;N;;;;;
+0C48;TELUGU VOWEL SIGN AI;Mn;0;NSM;0C46 0C56;;;;N;;;;;
+0C4A;TELUGU VOWEL SIGN O;Mn;0;NSM;;;;;N;;;;;
+0C4B;TELUGU VOWEL SIGN OO;Mn;0;NSM;;;;;N;;;;;
+0C4C;TELUGU VOWEL SIGN AU;Mn;0;NSM;;;;;N;;;;;
+0C4D;TELUGU SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+0C55;TELUGU LENGTH MARK;Mn;84;NSM;;;;;N;;;;;
+0C56;TELUGU AI LENGTH MARK;Mn;91;NSM;;;;;N;;;;;
+0C58;TELUGU LETTER TSA;Lo;0;L;;;;;N;;;;;
+0C59;TELUGU LETTER DZA;Lo;0;L;;;;;N;;;;;
+0C5A;TELUGU LETTER RRRA;Lo;0;L;;;;;N;;;;;
+0C60;TELUGU LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+0C61;TELUGU LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+0C62;TELUGU VOWEL SIGN VOCALIC L;Mn;0;NSM;;;;;N;;;;;
+0C63;TELUGU VOWEL SIGN VOCALIC LL;Mn;0;NSM;;;;;N;;;;;
+0C66;TELUGU DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+0C67;TELUGU DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+0C68;TELUGU DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+0C69;TELUGU DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+0C6A;TELUGU DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+0C6B;TELUGU DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+0C6C;TELUGU DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+0C6D;TELUGU DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+0C6E;TELUGU DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+0C6F;TELUGU DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+0C78;TELUGU FRACTION DIGIT ZERO FOR ODD POWERS OF FOUR;No;0;ON;;;;0;N;;;;;
+0C79;TELUGU FRACTION DIGIT ONE FOR ODD POWERS OF FOUR;No;0;ON;;;;1;N;;;;;
+0C7A;TELUGU FRACTION DIGIT TWO FOR ODD POWERS OF FOUR;No;0;ON;;;;2;N;;;;;
+0C7B;TELUGU FRACTION DIGIT THREE FOR ODD POWERS OF FOUR;No;0;ON;;;;3;N;;;;;
+0C7C;TELUGU FRACTION DIGIT ONE FOR EVEN POWERS OF FOUR;No;0;ON;;;;1;N;;;;;
+0C7D;TELUGU FRACTION DIGIT TWO FOR EVEN POWERS OF FOUR;No;0;ON;;;;2;N;;;;;
+0C7E;TELUGU FRACTION DIGIT THREE FOR EVEN POWERS OF FOUR;No;0;ON;;;;3;N;;;;;
+0C7F;TELUGU SIGN TUUMU;So;0;L;;;;;N;;;;;
+0C80;KANNADA SIGN SPACING CANDRABINDU;Lo;0;L;;;;;N;;;;;
+0C81;KANNADA SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+0C82;KANNADA SIGN ANUSVARA;Mc;0;L;;;;;N;;;;;
+0C83;KANNADA SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+0C85;KANNADA LETTER A;Lo;0;L;;;;;N;;;;;
+0C86;KANNADA LETTER AA;Lo;0;L;;;;;N;;;;;
+0C87;KANNADA LETTER I;Lo;0;L;;;;;N;;;;;
+0C88;KANNADA LETTER II;Lo;0;L;;;;;N;;;;;
+0C89;KANNADA LETTER U;Lo;0;L;;;;;N;;;;;
+0C8A;KANNADA LETTER UU;Lo;0;L;;;;;N;;;;;
+0C8B;KANNADA LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+0C8C;KANNADA LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+0C8E;KANNADA LETTER E;Lo;0;L;;;;;N;;;;;
+0C8F;KANNADA LETTER EE;Lo;0;L;;;;;N;;;;;
+0C90;KANNADA LETTER AI;Lo;0;L;;;;;N;;;;;
+0C92;KANNADA LETTER O;Lo;0;L;;;;;N;;;;;
+0C93;KANNADA LETTER OO;Lo;0;L;;;;;N;;;;;
+0C94;KANNADA LETTER AU;Lo;0;L;;;;;N;;;;;
+0C95;KANNADA LETTER KA;Lo;0;L;;;;;N;;;;;
+0C96;KANNADA LETTER KHA;Lo;0;L;;;;;N;;;;;
+0C97;KANNADA LETTER GA;Lo;0;L;;;;;N;;;;;
+0C98;KANNADA LETTER GHA;Lo;0;L;;;;;N;;;;;
+0C99;KANNADA LETTER NGA;Lo;0;L;;;;;N;;;;;
+0C9A;KANNADA LETTER CA;Lo;0;L;;;;;N;;;;;
+0C9B;KANNADA LETTER CHA;Lo;0;L;;;;;N;;;;;
+0C9C;KANNADA LETTER JA;Lo;0;L;;;;;N;;;;;
+0C9D;KANNADA LETTER JHA;Lo;0;L;;;;;N;;;;;
+0C9E;KANNADA LETTER NYA;Lo;0;L;;;;;N;;;;;
+0C9F;KANNADA LETTER TTA;Lo;0;L;;;;;N;;;;;
+0CA0;KANNADA LETTER TTHA;Lo;0;L;;;;;N;;;;;
+0CA1;KANNADA LETTER DDA;Lo;0;L;;;;;N;;;;;
+0CA2;KANNADA LETTER DDHA;Lo;0;L;;;;;N;;;;;
+0CA3;KANNADA LETTER NNA;Lo;0;L;;;;;N;;;;;
+0CA4;KANNADA LETTER TA;Lo;0;L;;;;;N;;;;;
+0CA5;KANNADA LETTER THA;Lo;0;L;;;;;N;;;;;
+0CA6;KANNADA LETTER DA;Lo;0;L;;;;;N;;;;;
+0CA7;KANNADA LETTER DHA;Lo;0;L;;;;;N;;;;;
+0CA8;KANNADA LETTER NA;Lo;0;L;;;;;N;;;;;
+0CAA;KANNADA LETTER PA;Lo;0;L;;;;;N;;;;;
+0CAB;KANNADA LETTER PHA;Lo;0;L;;;;;N;;;;;
+0CAC;KANNADA LETTER BA;Lo;0;L;;;;;N;;;;;
+0CAD;KANNADA LETTER BHA;Lo;0;L;;;;;N;;;;;
+0CAE;KANNADA LETTER MA;Lo;0;L;;;;;N;;;;;
+0CAF;KANNADA LETTER YA;Lo;0;L;;;;;N;;;;;
+0CB0;KANNADA LETTER RA;Lo;0;L;;;;;N;;;;;
+0CB1;KANNADA LETTER RRA;Lo;0;L;;;;;N;;;;;
+0CB2;KANNADA LETTER LA;Lo;0;L;;;;;N;;;;;
+0CB3;KANNADA LETTER LLA;Lo;0;L;;;;;N;;;;;
+0CB5;KANNADA LETTER VA;Lo;0;L;;;;;N;;;;;
+0CB6;KANNADA LETTER SHA;Lo;0;L;;;;;N;;;;;
+0CB7;KANNADA LETTER SSA;Lo;0;L;;;;;N;;;;;
+0CB8;KANNADA LETTER SA;Lo;0;L;;;;;N;;;;;
+0CB9;KANNADA LETTER HA;Lo;0;L;;;;;N;;;;;
+0CBC;KANNADA SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+0CBD;KANNADA SIGN AVAGRAHA;Lo;0;L;;;;;N;;;;;
+0CBE;KANNADA VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+0CBF;KANNADA VOWEL SIGN I;Mn;0;L;;;;;N;;;;;
+0CC0;KANNADA VOWEL SIGN II;Mc;0;L;0CBF 0CD5;;;;N;;;;;
+0CC1;KANNADA VOWEL SIGN U;Mc;0;L;;;;;N;;;;;
+0CC2;KANNADA VOWEL SIGN UU;Mc;0;L;;;;;N;;;;;
+0CC3;KANNADA VOWEL SIGN VOCALIC R;Mc;0;L;;;;;N;;;;;
+0CC4;KANNADA VOWEL SIGN VOCALIC RR;Mc;0;L;;;;;N;;;;;
+0CC6;KANNADA VOWEL SIGN E;Mn;0;L;;;;;N;;;;;
+0CC7;KANNADA VOWEL SIGN EE;Mc;0;L;0CC6 0CD5;;;;N;;;;;
+0CC8;KANNADA VOWEL SIGN AI;Mc;0;L;0CC6 0CD6;;;;N;;;;;
+0CCA;KANNADA VOWEL SIGN O;Mc;0;L;0CC6 0CC2;;;;N;;;;;
+0CCB;KANNADA VOWEL SIGN OO;Mc;0;L;0CCA 0CD5;;;;N;;;;;
+0CCC;KANNADA VOWEL SIGN AU;Mn;0;NSM;;;;;N;;;;;
+0CCD;KANNADA SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+0CD5;KANNADA LENGTH MARK;Mc;0;L;;;;;N;;;;;
+0CD6;KANNADA AI LENGTH MARK;Mc;0;L;;;;;N;;;;;
+0CDE;KANNADA LETTER FA;Lo;0;L;;;;;N;;;;;
+0CE0;KANNADA LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+0CE1;KANNADA LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+0CE2;KANNADA VOWEL SIGN VOCALIC L;Mn;0;NSM;;;;;N;;;;;
+0CE3;KANNADA VOWEL SIGN VOCALIC LL;Mn;0;NSM;;;;;N;;;;;
+0CE6;KANNADA DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+0CE7;KANNADA DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+0CE8;KANNADA DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+0CE9;KANNADA DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+0CEA;KANNADA DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+0CEB;KANNADA DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+0CEC;KANNADA DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+0CED;KANNADA DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+0CEE;KANNADA DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+0CEF;KANNADA DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+0CF1;KANNADA SIGN JIHVAMULIYA;Lo;0;L;;;;;N;;;;;
+0CF2;KANNADA SIGN UPADHMANIYA;Lo;0;L;;;;;N;;;;;
+0D00;MALAYALAM SIGN COMBINING ANUSVARA ABOVE;Mn;0;NSM;;;;;N;;;;;
+0D01;MALAYALAM SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+0D02;MALAYALAM SIGN ANUSVARA;Mc;0;L;;;;;N;;;;;
+0D03;MALAYALAM SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+0D05;MALAYALAM LETTER A;Lo;0;L;;;;;N;;;;;
+0D06;MALAYALAM LETTER AA;Lo;0;L;;;;;N;;;;;
+0D07;MALAYALAM LETTER I;Lo;0;L;;;;;N;;;;;
+0D08;MALAYALAM LETTER II;Lo;0;L;;;;;N;;;;;
+0D09;MALAYALAM LETTER U;Lo;0;L;;;;;N;;;;;
+0D0A;MALAYALAM LETTER UU;Lo;0;L;;;;;N;;;;;
+0D0B;MALAYALAM LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+0D0C;MALAYALAM LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+0D0E;MALAYALAM LETTER E;Lo;0;L;;;;;N;;;;;
+0D0F;MALAYALAM LETTER EE;Lo;0;L;;;;;N;;;;;
+0D10;MALAYALAM LETTER AI;Lo;0;L;;;;;N;;;;;
+0D12;MALAYALAM LETTER O;Lo;0;L;;;;;N;;;;;
+0D13;MALAYALAM LETTER OO;Lo;0;L;;;;;N;;;;;
+0D14;MALAYALAM LETTER AU;Lo;0;L;;;;;N;;;;;
+0D15;MALAYALAM LETTER KA;Lo;0;L;;;;;N;;;;;
+0D16;MALAYALAM LETTER KHA;Lo;0;L;;;;;N;;;;;
+0D17;MALAYALAM LETTER GA;Lo;0;L;;;;;N;;;;;
+0D18;MALAYALAM LETTER GHA;Lo;0;L;;;;;N;;;;;
+0D19;MALAYALAM LETTER NGA;Lo;0;L;;;;;N;;;;;
+0D1A;MALAYALAM LETTER CA;Lo;0;L;;;;;N;;;;;
+0D1B;MALAYALAM LETTER CHA;Lo;0;L;;;;;N;;;;;
+0D1C;MALAYALAM LETTER JA;Lo;0;L;;;;;N;;;;;
+0D1D;MALAYALAM LETTER JHA;Lo;0;L;;;;;N;;;;;
+0D1E;MALAYALAM LETTER NYA;Lo;0;L;;;;;N;;;;;
+0D1F;MALAYALAM LETTER TTA;Lo;0;L;;;;;N;;;;;
+0D20;MALAYALAM LETTER TTHA;Lo;0;L;;;;;N;;;;;
+0D21;MALAYALAM LETTER DDA;Lo;0;L;;;;;N;;;;;
+0D22;MALAYALAM LETTER DDHA;Lo;0;L;;;;;N;;;;;
+0D23;MALAYALAM LETTER NNA;Lo;0;L;;;;;N;;;;;
+0D24;MALAYALAM LETTER TA;Lo;0;L;;;;;N;;;;;
+0D25;MALAYALAM LETTER THA;Lo;0;L;;;;;N;;;;;
+0D26;MALAYALAM LETTER DA;Lo;0;L;;;;;N;;;;;
+0D27;MALAYALAM LETTER DHA;Lo;0;L;;;;;N;;;;;
+0D28;MALAYALAM LETTER NA;Lo;0;L;;;;;N;;;;;
+0D29;MALAYALAM LETTER NNNA;Lo;0;L;;;;;N;;;;;
+0D2A;MALAYALAM LETTER PA;Lo;0;L;;;;;N;;;;;
+0D2B;MALAYALAM LETTER PHA;Lo;0;L;;;;;N;;;;;
+0D2C;MALAYALAM LETTER BA;Lo;0;L;;;;;N;;;;;
+0D2D;MALAYALAM LETTER BHA;Lo;0;L;;;;;N;;;;;
+0D2E;MALAYALAM LETTER MA;Lo;0;L;;;;;N;;;;;
+0D2F;MALAYALAM LETTER YA;Lo;0;L;;;;;N;;;;;
+0D30;MALAYALAM LETTER RA;Lo;0;L;;;;;N;;;;;
+0D31;MALAYALAM LETTER RRA;Lo;0;L;;;;;N;;;;;
+0D32;MALAYALAM LETTER LA;Lo;0;L;;;;;N;;;;;
+0D33;MALAYALAM LETTER LLA;Lo;0;L;;;;;N;;;;;
+0D34;MALAYALAM LETTER LLLA;Lo;0;L;;;;;N;;;;;
+0D35;MALAYALAM LETTER VA;Lo;0;L;;;;;N;;;;;
+0D36;MALAYALAM LETTER SHA;Lo;0;L;;;;;N;;;;;
+0D37;MALAYALAM LETTER SSA;Lo;0;L;;;;;N;;;;;
+0D38;MALAYALAM LETTER SA;Lo;0;L;;;;;N;;;;;
+0D39;MALAYALAM LETTER HA;Lo;0;L;;;;;N;;;;;
+0D3A;MALAYALAM LETTER TTTA;Lo;0;L;;;;;N;;;;;
+0D3B;MALAYALAM SIGN VERTICAL BAR VIRAMA;Mn;9;NSM;;;;;N;;;;;
+0D3C;MALAYALAM SIGN CIRCULAR VIRAMA;Mn;9;NSM;;;;;N;;;;;
+0D3D;MALAYALAM SIGN AVAGRAHA;Lo;0;L;;;;;N;;;;;
+0D3E;MALAYALAM VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+0D3F;MALAYALAM VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+0D40;MALAYALAM VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+0D41;MALAYALAM VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+0D42;MALAYALAM VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+0D43;MALAYALAM VOWEL SIGN VOCALIC R;Mn;0;NSM;;;;;N;;;;;
+0D44;MALAYALAM VOWEL SIGN VOCALIC RR;Mn;0;NSM;;;;;N;;;;;
+0D46;MALAYALAM VOWEL SIGN E;Mc;0;L;;;;;N;;;;;
+0D47;MALAYALAM VOWEL SIGN EE;Mc;0;L;;;;;N;;;;;
+0D48;MALAYALAM VOWEL SIGN AI;Mc;0;L;;;;;N;;;;;
+0D4A;MALAYALAM VOWEL SIGN O;Mc;0;L;0D46 0D3E;;;;N;;;;;
+0D4B;MALAYALAM VOWEL SIGN OO;Mc;0;L;0D47 0D3E;;;;N;;;;;
+0D4C;MALAYALAM VOWEL SIGN AU;Mc;0;L;0D46 0D57;;;;N;;;;;
+0D4D;MALAYALAM SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+0D4E;MALAYALAM LETTER DOT REPH;Lo;0;L;;;;;N;;;;;
+0D4F;MALAYALAM SIGN PARA;So;0;L;;;;;N;;;;;
+0D54;MALAYALAM LETTER CHILLU M;Lo;0;L;;;;;N;;;;;
+0D55;MALAYALAM LETTER CHILLU Y;Lo;0;L;;;;;N;;;;;
+0D56;MALAYALAM LETTER CHILLU LLL;Lo;0;L;;;;;N;;;;;
+0D57;MALAYALAM AU LENGTH MARK;Mc;0;L;;;;;N;;;;;
+0D58;MALAYALAM FRACTION ONE ONE-HUNDRED-AND-SIXTIETH;No;0;L;;;;1/160;N;;;;;
+0D59;MALAYALAM FRACTION ONE FORTIETH;No;0;L;;;;1/40;N;;;;;
+0D5A;MALAYALAM FRACTION THREE EIGHTIETHS;No;0;L;;;;3/80;N;;;;;
+0D5B;MALAYALAM FRACTION ONE TWENTIETH;No;0;L;;;;1/20;N;;;;;
+0D5C;MALAYALAM FRACTION ONE TENTH;No;0;L;;;;1/10;N;;;;;
+0D5D;MALAYALAM FRACTION THREE TWENTIETHS;No;0;L;;;;3/20;N;;;;;
+0D5E;MALAYALAM FRACTION ONE FIFTH;No;0;L;;;;1/5;N;;;;;
+0D5F;MALAYALAM LETTER ARCHAIC II;Lo;0;L;;;;;N;;;;;
+0D60;MALAYALAM LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+0D61;MALAYALAM LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+0D62;MALAYALAM VOWEL SIGN VOCALIC L;Mn;0;NSM;;;;;N;;;;;
+0D63;MALAYALAM VOWEL SIGN VOCALIC LL;Mn;0;NSM;;;;;N;;;;;
+0D66;MALAYALAM DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+0D67;MALAYALAM DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+0D68;MALAYALAM DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+0D69;MALAYALAM DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+0D6A;MALAYALAM DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+0D6B;MALAYALAM DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+0D6C;MALAYALAM DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+0D6D;MALAYALAM DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+0D6E;MALAYALAM DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+0D6F;MALAYALAM DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+0D70;MALAYALAM NUMBER TEN;No;0;L;;;;10;N;;;;;
+0D71;MALAYALAM NUMBER ONE HUNDRED;No;0;L;;;;100;N;;;;;
+0D72;MALAYALAM NUMBER ONE THOUSAND;No;0;L;;;;1000;N;;;;;
+0D73;MALAYALAM FRACTION ONE QUARTER;No;0;L;;;;1/4;N;;;;;
+0D74;MALAYALAM FRACTION ONE HALF;No;0;L;;;;1/2;N;;;;;
+0D75;MALAYALAM FRACTION THREE QUARTERS;No;0;L;;;;3/4;N;;;;;
+0D76;MALAYALAM FRACTION ONE SIXTEENTH;No;0;L;;;;1/16;N;;;;;
+0D77;MALAYALAM FRACTION ONE EIGHTH;No;0;L;;;;1/8;N;;;;;
+0D78;MALAYALAM FRACTION THREE SIXTEENTHS;No;0;L;;;;3/16;N;;;;;
+0D79;MALAYALAM DATE MARK;So;0;L;;;;;N;;;;;
+0D7A;MALAYALAM LETTER CHILLU NN;Lo;0;L;;;;;N;;;;;
+0D7B;MALAYALAM LETTER CHILLU N;Lo;0;L;;;;;N;;;;;
+0D7C;MALAYALAM LETTER CHILLU RR;Lo;0;L;;;;;N;;;;;
+0D7D;MALAYALAM LETTER CHILLU L;Lo;0;L;;;;;N;;;;;
+0D7E;MALAYALAM LETTER CHILLU LL;Lo;0;L;;;;;N;;;;;
+0D7F;MALAYALAM LETTER CHILLU K;Lo;0;L;;;;;N;;;;;
+0D82;SINHALA SIGN ANUSVARAYA;Mc;0;L;;;;;N;;;;;
+0D83;SINHALA SIGN VISARGAYA;Mc;0;L;;;;;N;;;;;
+0D85;SINHALA LETTER AYANNA;Lo;0;L;;;;;N;;;;;
+0D86;SINHALA LETTER AAYANNA;Lo;0;L;;;;;N;;;;;
+0D87;SINHALA LETTER AEYANNA;Lo;0;L;;;;;N;;;;;
+0D88;SINHALA LETTER AEEYANNA;Lo;0;L;;;;;N;;;;;
+0D89;SINHALA LETTER IYANNA;Lo;0;L;;;;;N;;;;;
+0D8A;SINHALA LETTER IIYANNA;Lo;0;L;;;;;N;;;;;
+0D8B;SINHALA LETTER UYANNA;Lo;0;L;;;;;N;;;;;
+0D8C;SINHALA LETTER UUYANNA;Lo;0;L;;;;;N;;;;;
+0D8D;SINHALA LETTER IRUYANNA;Lo;0;L;;;;;N;;;;;
+0D8E;SINHALA LETTER IRUUYANNA;Lo;0;L;;;;;N;;;;;
+0D8F;SINHALA LETTER ILUYANNA;Lo;0;L;;;;;N;;;;;
+0D90;SINHALA LETTER ILUUYANNA;Lo;0;L;;;;;N;;;;;
+0D91;SINHALA LETTER EYANNA;Lo;0;L;;;;;N;;;;;
+0D92;SINHALA LETTER EEYANNA;Lo;0;L;;;;;N;;;;;
+0D93;SINHALA LETTER AIYANNA;Lo;0;L;;;;;N;;;;;
+0D94;SINHALA LETTER OYANNA;Lo;0;L;;;;;N;;;;;
+0D95;SINHALA LETTER OOYANNA;Lo;0;L;;;;;N;;;;;
+0D96;SINHALA LETTER AUYANNA;Lo;0;L;;;;;N;;;;;
+0D9A;SINHALA LETTER ALPAPRAANA KAYANNA;Lo;0;L;;;;;N;;;;;
+0D9B;SINHALA LETTER MAHAAPRAANA KAYANNA;Lo;0;L;;;;;N;;;;;
+0D9C;SINHALA LETTER ALPAPRAANA GAYANNA;Lo;0;L;;;;;N;;;;;
+0D9D;SINHALA LETTER MAHAAPRAANA GAYANNA;Lo;0;L;;;;;N;;;;;
+0D9E;SINHALA LETTER KANTAJA NAASIKYAYA;Lo;0;L;;;;;N;;;;;
+0D9F;SINHALA LETTER SANYAKA GAYANNA;Lo;0;L;;;;;N;;;;;
+0DA0;SINHALA LETTER ALPAPRAANA CAYANNA;Lo;0;L;;;;;N;;;;;
+0DA1;SINHALA LETTER MAHAAPRAANA CAYANNA;Lo;0;L;;;;;N;;;;;
+0DA2;SINHALA LETTER ALPAPRAANA JAYANNA;Lo;0;L;;;;;N;;;;;
+0DA3;SINHALA LETTER MAHAAPRAANA JAYANNA;Lo;0;L;;;;;N;;;;;
+0DA4;SINHALA LETTER TAALUJA NAASIKYAYA;Lo;0;L;;;;;N;;;;;
+0DA5;SINHALA LETTER TAALUJA SANYOOGA NAAKSIKYAYA;Lo;0;L;;;;;N;;;;;
+0DA6;SINHALA LETTER SANYAKA JAYANNA;Lo;0;L;;;;;N;;;;;
+0DA7;SINHALA LETTER ALPAPRAANA TTAYANNA;Lo;0;L;;;;;N;;;;;
+0DA8;SINHALA LETTER MAHAAPRAANA TTAYANNA;Lo;0;L;;;;;N;;;;;
+0DA9;SINHALA LETTER ALPAPRAANA DDAYANNA;Lo;0;L;;;;;N;;;;;
+0DAA;SINHALA LETTER MAHAAPRAANA DDAYANNA;Lo;0;L;;;;;N;;;;;
+0DAB;SINHALA LETTER MUURDHAJA NAYANNA;Lo;0;L;;;;;N;;;;;
+0DAC;SINHALA LETTER SANYAKA DDAYANNA;Lo;0;L;;;;;N;;;;;
+0DAD;SINHALA LETTER ALPAPRAANA TAYANNA;Lo;0;L;;;;;N;;;;;
+0DAE;SINHALA LETTER MAHAAPRAANA TAYANNA;Lo;0;L;;;;;N;;;;;
+0DAF;SINHALA LETTER ALPAPRAANA DAYANNA;Lo;0;L;;;;;N;;;;;
+0DB0;SINHALA LETTER MAHAAPRAANA DAYANNA;Lo;0;L;;;;;N;;;;;
+0DB1;SINHALA LETTER DANTAJA NAYANNA;Lo;0;L;;;;;N;;;;;
+0DB3;SINHALA LETTER SANYAKA DAYANNA;Lo;0;L;;;;;N;;;;;
+0DB4;SINHALA LETTER ALPAPRAANA PAYANNA;Lo;0;L;;;;;N;;;;;
+0DB5;SINHALA LETTER MAHAAPRAANA PAYANNA;Lo;0;L;;;;;N;;;;;
+0DB6;SINHALA LETTER ALPAPRAANA BAYANNA;Lo;0;L;;;;;N;;;;;
+0DB7;SINHALA LETTER MAHAAPRAANA BAYANNA;Lo;0;L;;;;;N;;;;;
+0DB8;SINHALA LETTER MAYANNA;Lo;0;L;;;;;N;;;;;
+0DB9;SINHALA LETTER AMBA BAYANNA;Lo;0;L;;;;;N;;;;;
+0DBA;SINHALA LETTER YAYANNA;Lo;0;L;;;;;N;;;;;
+0DBB;SINHALA LETTER RAYANNA;Lo;0;L;;;;;N;;;;;
+0DBD;SINHALA LETTER DANTAJA LAYANNA;Lo;0;L;;;;;N;;;;;
+0DC0;SINHALA LETTER VAYANNA;Lo;0;L;;;;;N;;;;;
+0DC1;SINHALA LETTER TAALUJA SAYANNA;Lo;0;L;;;;;N;;;;;
+0DC2;SINHALA LETTER MUURDHAJA SAYANNA;Lo;0;L;;;;;N;;;;;
+0DC3;SINHALA LETTER DANTAJA SAYANNA;Lo;0;L;;;;;N;;;;;
+0DC4;SINHALA LETTER HAYANNA;Lo;0;L;;;;;N;;;;;
+0DC5;SINHALA LETTER MUURDHAJA LAYANNA;Lo;0;L;;;;;N;;;;;
+0DC6;SINHALA LETTER FAYANNA;Lo;0;L;;;;;N;;;;;
+0DCA;SINHALA SIGN AL-LAKUNA;Mn;9;NSM;;;;;N;;;;;
+0DCF;SINHALA VOWEL SIGN AELA-PILLA;Mc;0;L;;;;;N;;;;;
+0DD0;SINHALA VOWEL SIGN KETTI AEDA-PILLA;Mc;0;L;;;;;N;;;;;
+0DD1;SINHALA VOWEL SIGN DIGA AEDA-PILLA;Mc;0;L;;;;;N;;;;;
+0DD2;SINHALA VOWEL SIGN KETTI IS-PILLA;Mn;0;NSM;;;;;N;;;;;
+0DD3;SINHALA VOWEL SIGN DIGA IS-PILLA;Mn;0;NSM;;;;;N;;;;;
+0DD4;SINHALA VOWEL SIGN KETTI PAA-PILLA;Mn;0;NSM;;;;;N;;;;;
+0DD6;SINHALA VOWEL SIGN DIGA PAA-PILLA;Mn;0;NSM;;;;;N;;;;;
+0DD8;SINHALA VOWEL SIGN GAETTA-PILLA;Mc;0;L;;;;;N;;;;;
+0DD9;SINHALA VOWEL SIGN KOMBUVA;Mc;0;L;;;;;N;;;;;
+0DDA;SINHALA VOWEL SIGN DIGA KOMBUVA;Mc;0;L;0DD9 0DCA;;;;N;;;;;
+0DDB;SINHALA VOWEL SIGN KOMBU DEKA;Mc;0;L;;;;;N;;;;;
+0DDC;SINHALA VOWEL SIGN KOMBUVA HAA AELA-PILLA;Mc;0;L;0DD9 0DCF;;;;N;;;;;
+0DDD;SINHALA VOWEL SIGN KOMBUVA HAA DIGA AELA-PILLA;Mc;0;L;0DDC 0DCA;;;;N;;;;;
+0DDE;SINHALA VOWEL SIGN KOMBUVA HAA GAYANUKITTA;Mc;0;L;0DD9 0DDF;;;;N;;;;;
+0DDF;SINHALA VOWEL SIGN GAYANUKITTA;Mc;0;L;;;;;N;;;;;
+0DE6;SINHALA LITH DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+0DE7;SINHALA LITH DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+0DE8;SINHALA LITH DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+0DE9;SINHALA LITH DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+0DEA;SINHALA LITH DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+0DEB;SINHALA LITH DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+0DEC;SINHALA LITH DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+0DED;SINHALA LITH DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+0DEE;SINHALA LITH DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+0DEF;SINHALA LITH DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+0DF2;SINHALA VOWEL SIGN DIGA GAETTA-PILLA;Mc;0;L;;;;;N;;;;;
+0DF3;SINHALA VOWEL SIGN DIGA GAYANUKITTA;Mc;0;L;;;;;N;;;;;
+0DF4;SINHALA PUNCTUATION KUNDDALIYA;Po;0;L;;;;;N;;;;;
+0E01;THAI CHARACTER KO KAI;Lo;0;L;;;;;N;THAI LETTER KO KAI;;;;
+0E02;THAI CHARACTER KHO KHAI;Lo;0;L;;;;;N;THAI LETTER KHO KHAI;;;;
+0E03;THAI CHARACTER KHO KHUAT;Lo;0;L;;;;;N;THAI LETTER KHO KHUAT;;;;
+0E04;THAI CHARACTER KHO KHWAI;Lo;0;L;;;;;N;THAI LETTER KHO KHWAI;;;;
+0E05;THAI CHARACTER KHO KHON;Lo;0;L;;;;;N;THAI LETTER KHO KHON;;;;
+0E06;THAI CHARACTER KHO RAKHANG;Lo;0;L;;;;;N;THAI LETTER KHO RAKHANG;;;;
+0E07;THAI CHARACTER NGO NGU;Lo;0;L;;;;;N;THAI LETTER NGO NGU;;;;
+0E08;THAI CHARACTER CHO CHAN;Lo;0;L;;;;;N;THAI LETTER CHO CHAN;;;;
+0E09;THAI CHARACTER CHO CHING;Lo;0;L;;;;;N;THAI LETTER CHO CHING;;;;
+0E0A;THAI CHARACTER CHO CHANG;Lo;0;L;;;;;N;THAI LETTER CHO CHANG;;;;
+0E0B;THAI CHARACTER SO SO;Lo;0;L;;;;;N;THAI LETTER SO SO;;;;
+0E0C;THAI CHARACTER CHO CHOE;Lo;0;L;;;;;N;THAI LETTER CHO CHOE;;;;
+0E0D;THAI CHARACTER YO YING;Lo;0;L;;;;;N;THAI LETTER YO YING;;;;
+0E0E;THAI CHARACTER DO CHADA;Lo;0;L;;;;;N;THAI LETTER DO CHADA;;;;
+0E0F;THAI CHARACTER TO PATAK;Lo;0;L;;;;;N;THAI LETTER TO PATAK;;;;
+0E10;THAI CHARACTER THO THAN;Lo;0;L;;;;;N;THAI LETTER THO THAN;;;;
+0E11;THAI CHARACTER THO NANGMONTHO;Lo;0;L;;;;;N;THAI LETTER THO NANGMONTHO;;;;
+0E12;THAI CHARACTER THO PHUTHAO;Lo;0;L;;;;;N;THAI LETTER THO PHUTHAO;;;;
+0E13;THAI CHARACTER NO NEN;Lo;0;L;;;;;N;THAI LETTER NO NEN;;;;
+0E14;THAI CHARACTER DO DEK;Lo;0;L;;;;;N;THAI LETTER DO DEK;;;;
+0E15;THAI CHARACTER TO TAO;Lo;0;L;;;;;N;THAI LETTER TO TAO;;;;
+0E16;THAI CHARACTER THO THUNG;Lo;0;L;;;;;N;THAI LETTER THO THUNG;;;;
+0E17;THAI CHARACTER THO THAHAN;Lo;0;L;;;;;N;THAI LETTER THO THAHAN;;;;
+0E18;THAI CHARACTER THO THONG;Lo;0;L;;;;;N;THAI LETTER THO THONG;;;;
+0E19;THAI CHARACTER NO NU;Lo;0;L;;;;;N;THAI LETTER NO NU;;;;
+0E1A;THAI CHARACTER BO BAIMAI;Lo;0;L;;;;;N;THAI LETTER BO BAIMAI;;;;
+0E1B;THAI CHARACTER PO PLA;Lo;0;L;;;;;N;THAI LETTER PO PLA;;;;
+0E1C;THAI CHARACTER PHO PHUNG;Lo;0;L;;;;;N;THAI LETTER PHO PHUNG;;;;
+0E1D;THAI CHARACTER FO FA;Lo;0;L;;;;;N;THAI LETTER FO FA;;;;
+0E1E;THAI CHARACTER PHO PHAN;Lo;0;L;;;;;N;THAI LETTER PHO PHAN;;;;
+0E1F;THAI CHARACTER FO FAN;Lo;0;L;;;;;N;THAI LETTER FO FAN;;;;
+0E20;THAI CHARACTER PHO SAMPHAO;Lo;0;L;;;;;N;THAI LETTER PHO SAMPHAO;;;;
+0E21;THAI CHARACTER MO MA;Lo;0;L;;;;;N;THAI LETTER MO MA;;;;
+0E22;THAI CHARACTER YO YAK;Lo;0;L;;;;;N;THAI LETTER YO YAK;;;;
+0E23;THAI CHARACTER RO RUA;Lo;0;L;;;;;N;THAI LETTER RO RUA;;;;
+0E24;THAI CHARACTER RU;Lo;0;L;;;;;N;THAI LETTER RU;;;;
+0E25;THAI CHARACTER LO LING;Lo;0;L;;;;;N;THAI LETTER LO LING;;;;
+0E26;THAI CHARACTER LU;Lo;0;L;;;;;N;THAI LETTER LU;;;;
+0E27;THAI CHARACTER WO WAEN;Lo;0;L;;;;;N;THAI LETTER WO WAEN;;;;
+0E28;THAI CHARACTER SO SALA;Lo;0;L;;;;;N;THAI LETTER SO SALA;;;;
+0E29;THAI CHARACTER SO RUSI;Lo;0;L;;;;;N;THAI LETTER SO RUSI;;;;
+0E2A;THAI CHARACTER SO SUA;Lo;0;L;;;;;N;THAI LETTER SO SUA;;;;
+0E2B;THAI CHARACTER HO HIP;Lo;0;L;;;;;N;THAI LETTER HO HIP;;;;
+0E2C;THAI CHARACTER LO CHULA;Lo;0;L;;;;;N;THAI LETTER LO CHULA;;;;
+0E2D;THAI CHARACTER O ANG;Lo;0;L;;;;;N;THAI LETTER O ANG;;;;
+0E2E;THAI CHARACTER HO NOKHUK;Lo;0;L;;;;;N;THAI LETTER HO NOK HUK;;;;
+0E2F;THAI CHARACTER PAIYANNOI;Lo;0;L;;;;;N;THAI PAI YAN NOI;;;;
+0E30;THAI CHARACTER SARA A;Lo;0;L;;;;;N;THAI VOWEL SIGN SARA A;;;;
+0E31;THAI CHARACTER MAI HAN-AKAT;Mn;0;NSM;;;;;N;THAI VOWEL SIGN MAI HAN-AKAT;;;;
+0E32;THAI CHARACTER SARA AA;Lo;0;L;;;;;N;THAI VOWEL SIGN SARA AA;;;;
+0E33;THAI CHARACTER SARA AM;Lo;0;L;<compat> 0E4D 0E32;;;;N;THAI VOWEL SIGN SARA AM;;;;
+0E34;THAI CHARACTER SARA I;Mn;0;NSM;;;;;N;THAI VOWEL SIGN SARA I;;;;
+0E35;THAI CHARACTER SARA II;Mn;0;NSM;;;;;N;THAI VOWEL SIGN SARA II;;;;
+0E36;THAI CHARACTER SARA UE;Mn;0;NSM;;;;;N;THAI VOWEL SIGN SARA UE;;;;
+0E37;THAI CHARACTER SARA UEE;Mn;0;NSM;;;;;N;THAI VOWEL SIGN SARA UEE;;;;
+0E38;THAI CHARACTER SARA U;Mn;103;NSM;;;;;N;THAI VOWEL SIGN SARA U;;;;
+0E39;THAI CHARACTER SARA UU;Mn;103;NSM;;;;;N;THAI VOWEL SIGN SARA UU;;;;
+0E3A;THAI CHARACTER PHINTHU;Mn;9;NSM;;;;;N;THAI VOWEL SIGN PHINTHU;;;;
+0E3F;THAI CURRENCY SYMBOL BAHT;Sc;0;ET;;;;;N;THAI BAHT SIGN;;;;
+0E40;THAI CHARACTER SARA E;Lo;0;L;;;;;N;THAI VOWEL SIGN SARA E;;;;
+0E41;THAI CHARACTER SARA AE;Lo;0;L;;;;;N;THAI VOWEL SIGN SARA AE;;;;
+0E42;THAI CHARACTER SARA O;Lo;0;L;;;;;N;THAI VOWEL SIGN SARA O;;;;
+0E43;THAI CHARACTER SARA AI MAIMUAN;Lo;0;L;;;;;N;THAI VOWEL SIGN SARA MAI MUAN;;;;
+0E44;THAI CHARACTER SARA AI MAIMALAI;Lo;0;L;;;;;N;THAI VOWEL SIGN SARA MAI MALAI;;;;
+0E45;THAI CHARACTER LAKKHANGYAO;Lo;0;L;;;;;N;THAI LAK KHANG YAO;;;;
+0E46;THAI CHARACTER MAIYAMOK;Lm;0;L;;;;;N;THAI MAI YAMOK;;;;
+0E47;THAI CHARACTER MAITAIKHU;Mn;0;NSM;;;;;N;THAI VOWEL SIGN MAI TAI KHU;;;;
+0E48;THAI CHARACTER MAI EK;Mn;107;NSM;;;;;N;THAI TONE MAI EK;;;;
+0E49;THAI CHARACTER MAI THO;Mn;107;NSM;;;;;N;THAI TONE MAI THO;;;;
+0E4A;THAI CHARACTER MAI TRI;Mn;107;NSM;;;;;N;THAI TONE MAI TRI;;;;
+0E4B;THAI CHARACTER MAI CHATTAWA;Mn;107;NSM;;;;;N;THAI TONE MAI CHATTAWA;;;;
+0E4C;THAI CHARACTER THANTHAKHAT;Mn;0;NSM;;;;;N;THAI THANTHAKHAT;;;;
+0E4D;THAI CHARACTER NIKHAHIT;Mn;0;NSM;;;;;N;THAI NIKKHAHIT;;;;
+0E4E;THAI CHARACTER YAMAKKAN;Mn;0;NSM;;;;;N;THAI YAMAKKAN;;;;
+0E4F;THAI CHARACTER FONGMAN;Po;0;L;;;;;N;THAI FONGMAN;;;;
+0E50;THAI DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+0E51;THAI DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+0E52;THAI DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+0E53;THAI DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+0E54;THAI DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+0E55;THAI DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+0E56;THAI DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+0E57;THAI DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+0E58;THAI DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+0E59;THAI DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+0E5A;THAI CHARACTER ANGKHANKHU;Po;0;L;;;;;N;THAI ANGKHANKHU;;;;
+0E5B;THAI CHARACTER KHOMUT;Po;0;L;;;;;N;THAI KHOMUT;;;;
+0E81;LAO LETTER KO;Lo;0;L;;;;;N;;;;;
+0E82;LAO LETTER KHO SUNG;Lo;0;L;;;;;N;;;;;
+0E84;LAO LETTER KHO TAM;Lo;0;L;;;;;N;;;;;
+0E87;LAO LETTER NGO;Lo;0;L;;;;;N;;;;;
+0E88;LAO LETTER CO;Lo;0;L;;;;;N;;;;;
+0E8A;LAO LETTER SO TAM;Lo;0;L;;;;;N;;;;;
+0E8D;LAO LETTER NYO;Lo;0;L;;;;;N;;;;;
+0E94;LAO LETTER DO;Lo;0;L;;;;;N;;;;;
+0E95;LAO LETTER TO;Lo;0;L;;;;;N;;;;;
+0E96;LAO LETTER THO SUNG;Lo;0;L;;;;;N;;;;;
+0E97;LAO LETTER THO TAM;Lo;0;L;;;;;N;;;;;
+0E99;LAO LETTER NO;Lo;0;L;;;;;N;;;;;
+0E9A;LAO LETTER BO;Lo;0;L;;;;;N;;;;;
+0E9B;LAO LETTER PO;Lo;0;L;;;;;N;;;;;
+0E9C;LAO LETTER PHO SUNG;Lo;0;L;;;;;N;;;;;
+0E9D;LAO LETTER FO TAM;Lo;0;L;;;;;N;;;;;
+0E9E;LAO LETTER PHO TAM;Lo;0;L;;;;;N;;;;;
+0E9F;LAO LETTER FO SUNG;Lo;0;L;;;;;N;;;;;
+0EA1;LAO LETTER MO;Lo;0;L;;;;;N;;;;;
+0EA2;LAO LETTER YO;Lo;0;L;;;;;N;;;;;
+0EA3;LAO LETTER LO LING;Lo;0;L;;;;;N;;;;;
+0EA5;LAO LETTER LO LOOT;Lo;0;L;;;;;N;;;;;
+0EA7;LAO LETTER WO;Lo;0;L;;;;;N;;;;;
+0EAA;LAO LETTER SO SUNG;Lo;0;L;;;;;N;;;;;
+0EAB;LAO LETTER HO SUNG;Lo;0;L;;;;;N;;;;;
+0EAD;LAO LETTER O;Lo;0;L;;;;;N;;;;;
+0EAE;LAO LETTER HO TAM;Lo;0;L;;;;;N;;;;;
+0EAF;LAO ELLIPSIS;Lo;0;L;;;;;N;;;;;
+0EB0;LAO VOWEL SIGN A;Lo;0;L;;;;;N;;;;;
+0EB1;LAO VOWEL SIGN MAI KAN;Mn;0;NSM;;;;;N;;;;;
+0EB2;LAO VOWEL SIGN AA;Lo;0;L;;;;;N;;;;;
+0EB3;LAO VOWEL SIGN AM;Lo;0;L;<compat> 0ECD 0EB2;;;;N;;;;;
+0EB4;LAO VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+0EB5;LAO VOWEL SIGN II;Mn;0;NSM;;;;;N;;;;;
+0EB6;LAO VOWEL SIGN Y;Mn;0;NSM;;;;;N;;;;;
+0EB7;LAO VOWEL SIGN YY;Mn;0;NSM;;;;;N;;;;;
+0EB8;LAO VOWEL SIGN U;Mn;118;NSM;;;;;N;;;;;
+0EB9;LAO VOWEL SIGN UU;Mn;118;NSM;;;;;N;;;;;
+0EBB;LAO VOWEL SIGN MAI KON;Mn;0;NSM;;;;;N;;;;;
+0EBC;LAO SEMIVOWEL SIGN LO;Mn;0;NSM;;;;;N;;;;;
+0EBD;LAO SEMIVOWEL SIGN NYO;Lo;0;L;;;;;N;;;;;
+0EC0;LAO VOWEL SIGN E;Lo;0;L;;;;;N;;;;;
+0EC1;LAO VOWEL SIGN EI;Lo;0;L;;;;;N;;;;;
+0EC2;LAO VOWEL SIGN O;Lo;0;L;;;;;N;;;;;
+0EC3;LAO VOWEL SIGN AY;Lo;0;L;;;;;N;;;;;
+0EC4;LAO VOWEL SIGN AI;Lo;0;L;;;;;N;;;;;
+0EC6;LAO KO LA;Lm;0;L;;;;;N;;;;;
+0EC8;LAO TONE MAI EK;Mn;122;NSM;;;;;N;;;;;
+0EC9;LAO TONE MAI THO;Mn;122;NSM;;;;;N;;;;;
+0ECA;LAO TONE MAI TI;Mn;122;NSM;;;;;N;;;;;
+0ECB;LAO TONE MAI CATAWA;Mn;122;NSM;;;;;N;;;;;
+0ECC;LAO CANCELLATION MARK;Mn;0;NSM;;;;;N;;;;;
+0ECD;LAO NIGGAHITA;Mn;0;NSM;;;;;N;;;;;
+0ED0;LAO DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+0ED1;LAO DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+0ED2;LAO DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+0ED3;LAO DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+0ED4;LAO DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+0ED5;LAO DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+0ED6;LAO DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+0ED7;LAO DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+0ED8;LAO DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+0ED9;LAO DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+0EDC;LAO HO NO;Lo;0;L;<compat> 0EAB 0E99;;;;N;;;;;
+0EDD;LAO HO MO;Lo;0;L;<compat> 0EAB 0EA1;;;;N;;;;;
+0EDE;LAO LETTER KHMU GO;Lo;0;L;;;;;N;;;;;
+0EDF;LAO LETTER KHMU NYO;Lo;0;L;;;;;N;;;;;
+0F00;TIBETAN SYLLABLE OM;Lo;0;L;;;;;N;;;;;
+0F01;TIBETAN MARK GTER YIG MGO TRUNCATED A;So;0;L;;;;;N;;;;;
+0F02;TIBETAN MARK GTER YIG MGO -UM RNAM BCAD MA;So;0;L;;;;;N;;;;;
+0F03;TIBETAN MARK GTER YIG MGO -UM GTER TSHEG MA;So;0;L;;;;;N;;;;;
+0F04;TIBETAN MARK INITIAL YIG MGO MDUN MA;Po;0;L;;;;;N;TIBETAN SINGLE ORNAMENT;;;;
+0F05;TIBETAN MARK CLOSING YIG MGO SGAB MA;Po;0;L;;;;;N;;;;;
+0F06;TIBETAN MARK CARET YIG MGO PHUR SHAD MA;Po;0;L;;;;;N;;;;;
+0F07;TIBETAN MARK YIG MGO TSHEG SHAD MA;Po;0;L;;;;;N;;;;;
+0F08;TIBETAN MARK SBRUL SHAD;Po;0;L;;;;;N;TIBETAN RGYANSHAD;;;;
+0F09;TIBETAN MARK BSKUR YIG MGO;Po;0;L;;;;;N;;;;;
+0F0A;TIBETAN MARK BKA- SHOG YIG MGO;Po;0;L;;;;;N;;;;;
+0F0B;TIBETAN MARK INTERSYLLABIC TSHEG;Po;0;L;;;;;N;TIBETAN TSEG;;;;
+0F0C;TIBETAN MARK DELIMITER TSHEG BSTAR;Po;0;L;<noBreak> 0F0B;;;;N;;;;;
+0F0D;TIBETAN MARK SHAD;Po;0;L;;;;;N;TIBETAN SHAD;;;;
+0F0E;TIBETAN MARK NYIS SHAD;Po;0;L;;;;;N;TIBETAN DOUBLE SHAD;;;;
+0F0F;TIBETAN MARK TSHEG SHAD;Po;0;L;;;;;N;;;;;
+0F10;TIBETAN MARK NYIS TSHEG SHAD;Po;0;L;;;;;N;;;;;
+0F11;TIBETAN MARK RIN CHEN SPUNGS SHAD;Po;0;L;;;;;N;TIBETAN RINCHANPHUNGSHAD;;;;
+0F12;TIBETAN MARK RGYA GRAM SHAD;Po;0;L;;;;;N;;;;;
+0F13;TIBETAN MARK CARET -DZUD RTAGS ME LONG CAN;So;0;L;;;;;N;;;;;
+0F14;TIBETAN MARK GTER TSHEG;Po;0;L;;;;;N;TIBETAN COMMA;;;;
+0F15;TIBETAN LOGOTYPE SIGN CHAD RTAGS;So;0;L;;;;;N;;;;;
+0F16;TIBETAN LOGOTYPE SIGN LHAG RTAGS;So;0;L;;;;;N;;;;;
+0F17;TIBETAN ASTROLOGICAL SIGN SGRA GCAN -CHAR RTAGS;So;0;L;;;;;N;;;;;
+0F18;TIBETAN ASTROLOGICAL SIGN -KHYUD PA;Mn;220;NSM;;;;;N;;;;;
+0F19;TIBETAN ASTROLOGICAL SIGN SDONG TSHUGS;Mn;220;NSM;;;;;N;;;;;
+0F1A;TIBETAN SIGN RDEL DKAR GCIG;So;0;L;;;;;N;;;;;
+0F1B;TIBETAN SIGN RDEL DKAR GNYIS;So;0;L;;;;;N;;;;;
+0F1C;TIBETAN SIGN RDEL DKAR GSUM;So;0;L;;;;;N;;;;;
+0F1D;TIBETAN SIGN RDEL NAG GCIG;So;0;L;;;;;N;;;;;
+0F1E;TIBETAN SIGN RDEL NAG GNYIS;So;0;L;;;;;N;;;;;
+0F1F;TIBETAN SIGN RDEL DKAR RDEL NAG;So;0;L;;;;;N;;;;;
+0F20;TIBETAN DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+0F21;TIBETAN DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+0F22;TIBETAN DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+0F23;TIBETAN DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+0F24;TIBETAN DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+0F25;TIBETAN DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+0F26;TIBETAN DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+0F27;TIBETAN DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+0F28;TIBETAN DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+0F29;TIBETAN DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+0F2A;TIBETAN DIGIT HALF ONE;No;0;L;;;;1/2;N;;;;;
+0F2B;TIBETAN DIGIT HALF TWO;No;0;L;;;;3/2;N;;;;;
+0F2C;TIBETAN DIGIT HALF THREE;No;0;L;;;;5/2;N;;;;;
+0F2D;TIBETAN DIGIT HALF FOUR;No;0;L;;;;7/2;N;;;;;
+0F2E;TIBETAN DIGIT HALF FIVE;No;0;L;;;;9/2;N;;;;;
+0F2F;TIBETAN DIGIT HALF SIX;No;0;L;;;;11/2;N;;;;;
+0F30;TIBETAN DIGIT HALF SEVEN;No;0;L;;;;13/2;N;;;;;
+0F31;TIBETAN DIGIT HALF EIGHT;No;0;L;;;;15/2;N;;;;;
+0F32;TIBETAN DIGIT HALF NINE;No;0;L;;;;17/2;N;;;;;
+0F33;TIBETAN DIGIT HALF ZERO;No;0;L;;;;-1/2;N;;;;;
+0F34;TIBETAN MARK BSDUS RTAGS;So;0;L;;;;;N;;;;;
+0F35;TIBETAN MARK NGAS BZUNG NYI ZLA;Mn;220;NSM;;;;;N;TIBETAN HONORIFIC UNDER RING;;;;
+0F36;TIBETAN MARK CARET -DZUD RTAGS BZHI MIG CAN;So;0;L;;;;;N;;;;;
+0F37;TIBETAN MARK NGAS BZUNG SGOR RTAGS;Mn;220;NSM;;;;;N;TIBETAN UNDER RING;;;;
+0F38;TIBETAN MARK CHE MGO;So;0;L;;;;;N;;;;;
+0F39;TIBETAN MARK TSA -PHRU;Mn;216;NSM;;;;;N;TIBETAN LENITION MARK;;;;
+0F3A;TIBETAN MARK GUG RTAGS GYON;Ps;0;ON;;;;;Y;;;;;
+0F3B;TIBETAN MARK GUG RTAGS GYAS;Pe;0;ON;;;;;Y;;;;;
+0F3C;TIBETAN MARK ANG KHANG GYON;Ps;0;ON;;;;;Y;TIBETAN LEFT BRACE;;;;
+0F3D;TIBETAN MARK ANG KHANG GYAS;Pe;0;ON;;;;;Y;TIBETAN RIGHT BRACE;;;;
+0F3E;TIBETAN SIGN YAR TSHES;Mc;0;L;;;;;N;;;;;
+0F3F;TIBETAN SIGN MAR TSHES;Mc;0;L;;;;;N;;;;;
+0F40;TIBETAN LETTER KA;Lo;0;L;;;;;N;;;;;
+0F41;TIBETAN LETTER KHA;Lo;0;L;;;;;N;;;;;
+0F42;TIBETAN LETTER GA;Lo;0;L;;;;;N;;;;;
+0F43;TIBETAN LETTER GHA;Lo;0;L;0F42 0FB7;;;;N;;;;;
+0F44;TIBETAN LETTER NGA;Lo;0;L;;;;;N;;;;;
+0F45;TIBETAN LETTER CA;Lo;0;L;;;;;N;;;;;
+0F46;TIBETAN LETTER CHA;Lo;0;L;;;;;N;;;;;
+0F47;TIBETAN LETTER JA;Lo;0;L;;;;;N;;;;;
+0F49;TIBETAN LETTER NYA;Lo;0;L;;;;;N;;;;;
+0F4A;TIBETAN LETTER TTA;Lo;0;L;;;;;N;TIBETAN LETTER REVERSED TA;;;;
+0F4B;TIBETAN LETTER TTHA;Lo;0;L;;;;;N;TIBETAN LETTER REVERSED THA;;;;
+0F4C;TIBETAN LETTER DDA;Lo;0;L;;;;;N;TIBETAN LETTER REVERSED DA;;;;
+0F4D;TIBETAN LETTER DDHA;Lo;0;L;0F4C 0FB7;;;;N;;;;;
+0F4E;TIBETAN LETTER NNA;Lo;0;L;;;;;N;TIBETAN LETTER REVERSED NA;;;;
+0F4F;TIBETAN LETTER TA;Lo;0;L;;;;;N;;;;;
+0F50;TIBETAN LETTER THA;Lo;0;L;;;;;N;;;;;
+0F51;TIBETAN LETTER DA;Lo;0;L;;;;;N;;;;;
+0F52;TIBETAN LETTER DHA;Lo;0;L;0F51 0FB7;;;;N;;;;;
+0F53;TIBETAN LETTER NA;Lo;0;L;;;;;N;;;;;
+0F54;TIBETAN LETTER PA;Lo;0;L;;;;;N;;;;;
+0F55;TIBETAN LETTER PHA;Lo;0;L;;;;;N;;;;;
+0F56;TIBETAN LETTER BA;Lo;0;L;;;;;N;;;;;
+0F57;TIBETAN LETTER BHA;Lo;0;L;0F56 0FB7;;;;N;;;;;
+0F58;TIBETAN LETTER MA;Lo;0;L;;;;;N;;;;;
+0F59;TIBETAN LETTER TSA;Lo;0;L;;;;;N;;;;;
+0F5A;TIBETAN LETTER TSHA;Lo;0;L;;;;;N;;;;;
+0F5B;TIBETAN LETTER DZA;Lo;0;L;;;;;N;;;;;
+0F5C;TIBETAN LETTER DZHA;Lo;0;L;0F5B 0FB7;;;;N;;;;;
+0F5D;TIBETAN LETTER WA;Lo;0;L;;;;;N;;;;;
+0F5E;TIBETAN LETTER ZHA;Lo;0;L;;;;;N;;;;;
+0F5F;TIBETAN LETTER ZA;Lo;0;L;;;;;N;;;;;
+0F60;TIBETAN LETTER -A;Lo;0;L;;;;;N;TIBETAN LETTER AA;;;;
+0F61;TIBETAN LETTER YA;Lo;0;L;;;;;N;;;;;
+0F62;TIBETAN LETTER RA;Lo;0;L;;;;;N;;;;;
+0F63;TIBETAN LETTER LA;Lo;0;L;;;;;N;;;;;
+0F64;TIBETAN LETTER SHA;Lo;0;L;;;;;N;;;;;
+0F65;TIBETAN LETTER SSA;Lo;0;L;;;;;N;TIBETAN LETTER REVERSED SHA;;;;
+0F66;TIBETAN LETTER SA;Lo;0;L;;;;;N;;;;;
+0F67;TIBETAN LETTER HA;Lo;0;L;;;;;N;;;;;
+0F68;TIBETAN LETTER A;Lo;0;L;;;;;N;;;;;
+0F69;TIBETAN LETTER KSSA;Lo;0;L;0F40 0FB5;;;;N;;;;;
+0F6A;TIBETAN LETTER FIXED-FORM RA;Lo;0;L;;;;;N;;;;;
+0F6B;TIBETAN LETTER KKA;Lo;0;L;;;;;N;;;;;
+0F6C;TIBETAN LETTER RRA;Lo;0;L;;;;;N;;;;;
+0F71;TIBETAN VOWEL SIGN AA;Mn;129;NSM;;;;;N;;;;;
+0F72;TIBETAN VOWEL SIGN I;Mn;130;NSM;;;;;N;;;;;
+0F73;TIBETAN VOWEL SIGN II;Mn;0;NSM;0F71 0F72;;;;N;;;;;
+0F74;TIBETAN VOWEL SIGN U;Mn;132;NSM;;;;;N;;;;;
+0F75;TIBETAN VOWEL SIGN UU;Mn;0;NSM;0F71 0F74;;;;N;;;;;
+0F76;TIBETAN VOWEL SIGN VOCALIC R;Mn;0;NSM;0FB2 0F80;;;;N;;;;;
+0F77;TIBETAN VOWEL SIGN VOCALIC RR;Mn;0;NSM;<compat> 0FB2 0F81;;;;N;;;;;
+0F78;TIBETAN VOWEL SIGN VOCALIC L;Mn;0;NSM;0FB3 0F80;;;;N;;;;;
+0F79;TIBETAN VOWEL SIGN VOCALIC LL;Mn;0;NSM;<compat> 0FB3 0F81;;;;N;;;;;
+0F7A;TIBETAN VOWEL SIGN E;Mn;130;NSM;;;;;N;;;;;
+0F7B;TIBETAN VOWEL SIGN EE;Mn;130;NSM;;;;;N;TIBETAN VOWEL SIGN AI;;;;
+0F7C;TIBETAN VOWEL SIGN O;Mn;130;NSM;;;;;N;;;;;
+0F7D;TIBETAN VOWEL SIGN OO;Mn;130;NSM;;;;;N;TIBETAN VOWEL SIGN AU;;;;
+0F7E;TIBETAN SIGN RJES SU NGA RO;Mn;0;NSM;;;;;N;TIBETAN ANUSVARA;;;;
+0F7F;TIBETAN SIGN RNAM BCAD;Mc;0;L;;;;;N;TIBETAN VISARGA;;;;
+0F80;TIBETAN VOWEL SIGN REVERSED I;Mn;130;NSM;;;;;N;TIBETAN VOWEL SIGN SHORT I;;;;
+0F81;TIBETAN VOWEL SIGN REVERSED II;Mn;0;NSM;0F71 0F80;;;;N;;;;;
+0F82;TIBETAN SIGN NYI ZLA NAA DA;Mn;230;NSM;;;;;N;TIBETAN CANDRABINDU WITH ORNAMENT;;;;
+0F83;TIBETAN SIGN SNA LDAN;Mn;230;NSM;;;;;N;TIBETAN CANDRABINDU;;;;
+0F84;TIBETAN MARK HALANTA;Mn;9;NSM;;;;;N;TIBETAN VIRAMA;;;;
+0F85;TIBETAN MARK PALUTA;Po;0;L;;;;;N;TIBETAN CHUCHENYIGE;;;;
+0F86;TIBETAN SIGN LCI RTAGS;Mn;230;NSM;;;;;N;;;;;
+0F87;TIBETAN SIGN YANG RTAGS;Mn;230;NSM;;;;;N;;;;;
+0F88;TIBETAN SIGN LCE TSA CAN;Lo;0;L;;;;;N;;;;;
+0F89;TIBETAN SIGN MCHU CAN;Lo;0;L;;;;;N;;;;;
+0F8A;TIBETAN SIGN GRU CAN RGYINGS;Lo;0;L;;;;;N;;;;;
+0F8B;TIBETAN SIGN GRU MED RGYINGS;Lo;0;L;;;;;N;;;;;
+0F8C;TIBETAN SIGN INVERTED MCHU CAN;Lo;0;L;;;;;N;;;;;
+0F8D;TIBETAN SUBJOINED SIGN LCE TSA CAN;Mn;0;NSM;;;;;N;;;;;
+0F8E;TIBETAN SUBJOINED SIGN MCHU CAN;Mn;0;NSM;;;;;N;;;;;
+0F8F;TIBETAN SUBJOINED SIGN INVERTED MCHU CAN;Mn;0;NSM;;;;;N;;;;;
+0F90;TIBETAN SUBJOINED LETTER KA;Mn;0;NSM;;;;;N;;;;;
+0F91;TIBETAN SUBJOINED LETTER KHA;Mn;0;NSM;;;;;N;;;;;
+0F92;TIBETAN SUBJOINED LETTER GA;Mn;0;NSM;;;;;N;;;;;
+0F93;TIBETAN SUBJOINED LETTER GHA;Mn;0;NSM;0F92 0FB7;;;;N;;;;;
+0F94;TIBETAN SUBJOINED LETTER NGA;Mn;0;NSM;;;;;N;;;;;
+0F95;TIBETAN SUBJOINED LETTER CA;Mn;0;NSM;;;;;N;;;;;
+0F96;TIBETAN SUBJOINED LETTER CHA;Mn;0;NSM;;;;;N;;;;;
+0F97;TIBETAN SUBJOINED LETTER JA;Mn;0;NSM;;;;;N;;;;;
+0F99;TIBETAN SUBJOINED LETTER NYA;Mn;0;NSM;;;;;N;;;;;
+0F9A;TIBETAN SUBJOINED LETTER TTA;Mn;0;NSM;;;;;N;;;;;
+0F9B;TIBETAN SUBJOINED LETTER TTHA;Mn;0;NSM;;;;;N;;;;;
+0F9C;TIBETAN SUBJOINED LETTER DDA;Mn;0;NSM;;;;;N;;;;;
+0F9D;TIBETAN SUBJOINED LETTER DDHA;Mn;0;NSM;0F9C 0FB7;;;;N;;;;;
+0F9E;TIBETAN SUBJOINED LETTER NNA;Mn;0;NSM;;;;;N;;;;;
+0F9F;TIBETAN SUBJOINED LETTER TA;Mn;0;NSM;;;;;N;;;;;
+0FA0;TIBETAN SUBJOINED LETTER THA;Mn;0;NSM;;;;;N;;;;;
+0FA1;TIBETAN SUBJOINED LETTER DA;Mn;0;NSM;;;;;N;;;;;
+0FA2;TIBETAN SUBJOINED LETTER DHA;Mn;0;NSM;0FA1 0FB7;;;;N;;;;;
+0FA3;TIBETAN SUBJOINED LETTER NA;Mn;0;NSM;;;;;N;;;;;
+0FA4;TIBETAN SUBJOINED LETTER PA;Mn;0;NSM;;;;;N;;;;;
+0FA5;TIBETAN SUBJOINED LETTER PHA;Mn;0;NSM;;;;;N;;;;;
+0FA6;TIBETAN SUBJOINED LETTER BA;Mn;0;NSM;;;;;N;;;;;
+0FA7;TIBETAN SUBJOINED LETTER BHA;Mn;0;NSM;0FA6 0FB7;;;;N;;;;;
+0FA8;TIBETAN SUBJOINED LETTER MA;Mn;0;NSM;;;;;N;;;;;
+0FA9;TIBETAN SUBJOINED LETTER TSA;Mn;0;NSM;;;;;N;;;;;
+0FAA;TIBETAN SUBJOINED LETTER TSHA;Mn;0;NSM;;;;;N;;;;;
+0FAB;TIBETAN SUBJOINED LETTER DZA;Mn;0;NSM;;;;;N;;;;;
+0FAC;TIBETAN SUBJOINED LETTER DZHA;Mn;0;NSM;0FAB 0FB7;;;;N;;;;;
+0FAD;TIBETAN SUBJOINED LETTER WA;Mn;0;NSM;;;;;N;;;;;
+0FAE;TIBETAN SUBJOINED LETTER ZHA;Mn;0;NSM;;;;;N;;;;;
+0FAF;TIBETAN SUBJOINED LETTER ZA;Mn;0;NSM;;;;;N;;;;;
+0FB0;TIBETAN SUBJOINED LETTER -A;Mn;0;NSM;;;;;N;;;;;
+0FB1;TIBETAN SUBJOINED LETTER YA;Mn;0;NSM;;;;;N;;;;;
+0FB2;TIBETAN SUBJOINED LETTER RA;Mn;0;NSM;;;;;N;;;;;
+0FB3;TIBETAN SUBJOINED LETTER LA;Mn;0;NSM;;;;;N;;;;;
+0FB4;TIBETAN SUBJOINED LETTER SHA;Mn;0;NSM;;;;;N;;;;;
+0FB5;TIBETAN SUBJOINED LETTER SSA;Mn;0;NSM;;;;;N;;;;;
+0FB6;TIBETAN SUBJOINED LETTER SA;Mn;0;NSM;;;;;N;;;;;
+0FB7;TIBETAN SUBJOINED LETTER HA;Mn;0;NSM;;;;;N;;;;;
+0FB8;TIBETAN SUBJOINED LETTER A;Mn;0;NSM;;;;;N;;;;;
+0FB9;TIBETAN SUBJOINED LETTER KSSA;Mn;0;NSM;0F90 0FB5;;;;N;;;;;
+0FBA;TIBETAN SUBJOINED LETTER FIXED-FORM WA;Mn;0;NSM;;;;;N;;;;;
+0FBB;TIBETAN SUBJOINED LETTER FIXED-FORM YA;Mn;0;NSM;;;;;N;;;;;
+0FBC;TIBETAN SUBJOINED LETTER FIXED-FORM RA;Mn;0;NSM;;;;;N;;;;;
+0FBE;TIBETAN KU RU KHA;So;0;L;;;;;N;;;;;
+0FBF;TIBETAN KU RU KHA BZHI MIG CAN;So;0;L;;;;;N;;;;;
+0FC0;TIBETAN CANTILLATION SIGN HEAVY BEAT;So;0;L;;;;;N;;;;;
+0FC1;TIBETAN CANTILLATION SIGN LIGHT BEAT;So;0;L;;;;;N;;;;;
+0FC2;TIBETAN CANTILLATION SIGN CANG TE-U;So;0;L;;;;;N;;;;;
+0FC3;TIBETAN CANTILLATION SIGN SBUB -CHAL;So;0;L;;;;;N;;;;;
+0FC4;TIBETAN SYMBOL DRIL BU;So;0;L;;;;;N;;;;;
+0FC5;TIBETAN SYMBOL RDO RJE;So;0;L;;;;;N;;;;;
+0FC6;TIBETAN SYMBOL PADMA GDAN;Mn;220;NSM;;;;;N;;;;;
+0FC7;TIBETAN SYMBOL RDO RJE RGYA GRAM;So;0;L;;;;;N;;;;;
+0FC8;TIBETAN SYMBOL PHUR PA;So;0;L;;;;;N;;;;;
+0FC9;TIBETAN SYMBOL NOR BU;So;0;L;;;;;N;;;;;
+0FCA;TIBETAN SYMBOL NOR BU NYIS -KHYIL;So;0;L;;;;;N;;;;;
+0FCB;TIBETAN SYMBOL NOR BU GSUM -KHYIL;So;0;L;;;;;N;;;;;
+0FCC;TIBETAN SYMBOL NOR BU BZHI -KHYIL;So;0;L;;;;;N;;;;;
+0FCE;TIBETAN SIGN RDEL NAG RDEL DKAR;So;0;L;;;;;N;;;;;
+0FCF;TIBETAN SIGN RDEL NAG GSUM;So;0;L;;;;;N;;;;;
+0FD0;TIBETAN MARK BSKA- SHOG GI MGO RGYAN;Po;0;L;;;;;N;;;;;
+0FD1;TIBETAN MARK MNYAM YIG GI MGO RGYAN;Po;0;L;;;;;N;;;;;
+0FD2;TIBETAN MARK NYIS TSHEG;Po;0;L;;;;;N;;;;;
+0FD3;TIBETAN MARK INITIAL BRDA RNYING YIG MGO MDUN MA;Po;0;L;;;;;N;;;;;
+0FD4;TIBETAN MARK CLOSING BRDA RNYING YIG MGO SGAB MA;Po;0;L;;;;;N;;;;;
+0FD5;RIGHT-FACING SVASTI SIGN;So;0;L;;;;;N;;;;;
+0FD6;LEFT-FACING SVASTI SIGN;So;0;L;;;;;N;;;;;
+0FD7;RIGHT-FACING SVASTI SIGN WITH DOTS;So;0;L;;;;;N;;;;;
+0FD8;LEFT-FACING SVASTI SIGN WITH DOTS;So;0;L;;;;;N;;;;;
+0FD9;TIBETAN MARK LEADING MCHAN RTAGS;Po;0;L;;;;;N;;;;;
+0FDA;TIBETAN MARK TRAILING MCHAN RTAGS;Po;0;L;;;;;N;;;;;
+1000;MYANMAR LETTER KA;Lo;0;L;;;;;N;;;;;
+1001;MYANMAR LETTER KHA;Lo;0;L;;;;;N;;;;;
+1002;MYANMAR LETTER GA;Lo;0;L;;;;;N;;;;;
+1003;MYANMAR LETTER GHA;Lo;0;L;;;;;N;;;;;
+1004;MYANMAR LETTER NGA;Lo;0;L;;;;;N;;;;;
+1005;MYANMAR LETTER CA;Lo;0;L;;;;;N;;;;;
+1006;MYANMAR LETTER CHA;Lo;0;L;;;;;N;;;;;
+1007;MYANMAR LETTER JA;Lo;0;L;;;;;N;;;;;
+1008;MYANMAR LETTER JHA;Lo;0;L;;;;;N;;;;;
+1009;MYANMAR LETTER NYA;Lo;0;L;;;;;N;;;;;
+100A;MYANMAR LETTER NNYA;Lo;0;L;;;;;N;;;;;
+100B;MYANMAR LETTER TTA;Lo;0;L;;;;;N;;;;;
+100C;MYANMAR LETTER TTHA;Lo;0;L;;;;;N;;;;;
+100D;MYANMAR LETTER DDA;Lo;0;L;;;;;N;;;;;
+100E;MYANMAR LETTER DDHA;Lo;0;L;;;;;N;;;;;
+100F;MYANMAR LETTER NNA;Lo;0;L;;;;;N;;;;;
+1010;MYANMAR LETTER TA;Lo;0;L;;;;;N;;;;;
+1011;MYANMAR LETTER THA;Lo;0;L;;;;;N;;;;;
+1012;MYANMAR LETTER DA;Lo;0;L;;;;;N;;;;;
+1013;MYANMAR LETTER DHA;Lo;0;L;;;;;N;;;;;
+1014;MYANMAR LETTER NA;Lo;0;L;;;;;N;;;;;
+1015;MYANMAR LETTER PA;Lo;0;L;;;;;N;;;;;
+1016;MYANMAR LETTER PHA;Lo;0;L;;;;;N;;;;;
+1017;MYANMAR LETTER BA;Lo;0;L;;;;;N;;;;;
+1018;MYANMAR LETTER BHA;Lo;0;L;;;;;N;;;;;
+1019;MYANMAR LETTER MA;Lo;0;L;;;;;N;;;;;
+101A;MYANMAR LETTER YA;Lo;0;L;;;;;N;;;;;
+101B;MYANMAR LETTER RA;Lo;0;L;;;;;N;;;;;
+101C;MYANMAR LETTER LA;Lo;0;L;;;;;N;;;;;
+101D;MYANMAR LETTER WA;Lo;0;L;;;;;N;;;;;
+101E;MYANMAR LETTER SA;Lo;0;L;;;;;N;;;;;
+101F;MYANMAR LETTER HA;Lo;0;L;;;;;N;;;;;
+1020;MYANMAR LETTER LLA;Lo;0;L;;;;;N;;;;;
+1021;MYANMAR LETTER A;Lo;0;L;;;;;N;;;;;
+1022;MYANMAR LETTER SHAN A;Lo;0;L;;;;;N;;;;;
+1023;MYANMAR LETTER I;Lo;0;L;;;;;N;;;;;
+1024;MYANMAR LETTER II;Lo;0;L;;;;;N;;;;;
+1025;MYANMAR LETTER U;Lo;0;L;;;;;N;;;;;
+1026;MYANMAR LETTER UU;Lo;0;L;1025 102E;;;;N;;;;;
+1027;MYANMAR LETTER E;Lo;0;L;;;;;N;;;;;
+1028;MYANMAR LETTER MON E;Lo;0;L;;;;;N;;;;;
+1029;MYANMAR LETTER O;Lo;0;L;;;;;N;;;;;
+102A;MYANMAR LETTER AU;Lo;0;L;;;;;N;;;;;
+102B;MYANMAR VOWEL SIGN TALL AA;Mc;0;L;;;;;N;;;;;
+102C;MYANMAR VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+102D;MYANMAR VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+102E;MYANMAR VOWEL SIGN II;Mn;0;NSM;;;;;N;;;;;
+102F;MYANMAR VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+1030;MYANMAR VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+1031;MYANMAR VOWEL SIGN E;Mc;0;L;;;;;N;;;;;
+1032;MYANMAR VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+1033;MYANMAR VOWEL SIGN MON II;Mn;0;NSM;;;;;N;;;;;
+1034;MYANMAR VOWEL SIGN MON O;Mn;0;NSM;;;;;N;;;;;
+1035;MYANMAR VOWEL SIGN E ABOVE;Mn;0;NSM;;;;;N;;;;;
+1036;MYANMAR SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+1037;MYANMAR SIGN DOT BELOW;Mn;7;NSM;;;;;N;;;;;
+1038;MYANMAR SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+1039;MYANMAR SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+103A;MYANMAR SIGN ASAT;Mn;9;NSM;;;;;N;;;;;
+103B;MYANMAR CONSONANT SIGN MEDIAL YA;Mc;0;L;;;;;N;;;;;
+103C;MYANMAR CONSONANT SIGN MEDIAL RA;Mc;0;L;;;;;N;;;;;
+103D;MYANMAR CONSONANT SIGN MEDIAL WA;Mn;0;NSM;;;;;N;;;;;
+103E;MYANMAR CONSONANT SIGN MEDIAL HA;Mn;0;NSM;;;;;N;;;;;
+103F;MYANMAR LETTER GREAT SA;Lo;0;L;;;;;N;;;;;
+1040;MYANMAR DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+1041;MYANMAR DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+1042;MYANMAR DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+1043;MYANMAR DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+1044;MYANMAR DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+1045;MYANMAR DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+1046;MYANMAR DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+1047;MYANMAR DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+1048;MYANMAR DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+1049;MYANMAR DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+104A;MYANMAR SIGN LITTLE SECTION;Po;0;L;;;;;N;;;;;
+104B;MYANMAR SIGN SECTION;Po;0;L;;;;;N;;;;;
+104C;MYANMAR SYMBOL LOCATIVE;Po;0;L;;;;;N;;;;;
+104D;MYANMAR SYMBOL COMPLETED;Po;0;L;;;;;N;;;;;
+104E;MYANMAR SYMBOL AFOREMENTIONED;Po;0;L;;;;;N;;;;;
+104F;MYANMAR SYMBOL GENITIVE;Po;0;L;;;;;N;;;;;
+1050;MYANMAR LETTER SHA;Lo;0;L;;;;;N;;;;;
+1051;MYANMAR LETTER SSA;Lo;0;L;;;;;N;;;;;
+1052;MYANMAR LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+1053;MYANMAR LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+1054;MYANMAR LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+1055;MYANMAR LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+1056;MYANMAR VOWEL SIGN VOCALIC R;Mc;0;L;;;;;N;;;;;
+1057;MYANMAR VOWEL SIGN VOCALIC RR;Mc;0;L;;;;;N;;;;;
+1058;MYANMAR VOWEL SIGN VOCALIC L;Mn;0;NSM;;;;;N;;;;;
+1059;MYANMAR VOWEL SIGN VOCALIC LL;Mn;0;NSM;;;;;N;;;;;
+105A;MYANMAR LETTER MON NGA;Lo;0;L;;;;;N;;;;;
+105B;MYANMAR LETTER MON JHA;Lo;0;L;;;;;N;;;;;
+105C;MYANMAR LETTER MON BBA;Lo;0;L;;;;;N;;;;;
+105D;MYANMAR LETTER MON BBE;Lo;0;L;;;;;N;;;;;
+105E;MYANMAR CONSONANT SIGN MON MEDIAL NA;Mn;0;NSM;;;;;N;;;;;
+105F;MYANMAR CONSONANT SIGN MON MEDIAL MA;Mn;0;NSM;;;;;N;;;;;
+1060;MYANMAR CONSONANT SIGN MON MEDIAL LA;Mn;0;NSM;;;;;N;;;;;
+1061;MYANMAR LETTER SGAW KAREN SHA;Lo;0;L;;;;;N;;;;;
+1062;MYANMAR VOWEL SIGN SGAW KAREN EU;Mc;0;L;;;;;N;;;;;
+1063;MYANMAR TONE MARK SGAW KAREN HATHI;Mc;0;L;;;;;N;;;;;
+1064;MYANMAR TONE MARK SGAW KAREN KE PHO;Mc;0;L;;;;;N;;;;;
+1065;MYANMAR LETTER WESTERN PWO KAREN THA;Lo;0;L;;;;;N;;;;;
+1066;MYANMAR LETTER WESTERN PWO KAREN PWA;Lo;0;L;;;;;N;;;;;
+1067;MYANMAR VOWEL SIGN WESTERN PWO KAREN EU;Mc;0;L;;;;;N;;;;;
+1068;MYANMAR VOWEL SIGN WESTERN PWO KAREN UE;Mc;0;L;;;;;N;;;;;
+1069;MYANMAR SIGN WESTERN PWO KAREN TONE-1;Mc;0;L;;;;;N;;;;;
+106A;MYANMAR SIGN WESTERN PWO KAREN TONE-2;Mc;0;L;;;;;N;;;;;
+106B;MYANMAR SIGN WESTERN PWO KAREN TONE-3;Mc;0;L;;;;;N;;;;;
+106C;MYANMAR SIGN WESTERN PWO KAREN TONE-4;Mc;0;L;;;;;N;;;;;
+106D;MYANMAR SIGN WESTERN PWO KAREN TONE-5;Mc;0;L;;;;;N;;;;;
+106E;MYANMAR LETTER EASTERN PWO KAREN NNA;Lo;0;L;;;;;N;;;;;
+106F;MYANMAR LETTER EASTERN PWO KAREN YWA;Lo;0;L;;;;;N;;;;;
+1070;MYANMAR LETTER EASTERN PWO KAREN GHWA;Lo;0;L;;;;;N;;;;;
+1071;MYANMAR VOWEL SIGN GEBA KAREN I;Mn;0;NSM;;;;;N;;;;;
+1072;MYANMAR VOWEL SIGN KAYAH OE;Mn;0;NSM;;;;;N;;;;;
+1073;MYANMAR VOWEL SIGN KAYAH U;Mn;0;NSM;;;;;N;;;;;
+1074;MYANMAR VOWEL SIGN KAYAH EE;Mn;0;NSM;;;;;N;;;;;
+1075;MYANMAR LETTER SHAN KA;Lo;0;L;;;;;N;;;;;
+1076;MYANMAR LETTER SHAN KHA;Lo;0;L;;;;;N;;;;;
+1077;MYANMAR LETTER SHAN GA;Lo;0;L;;;;;N;;;;;
+1078;MYANMAR LETTER SHAN CA;Lo;0;L;;;;;N;;;;;
+1079;MYANMAR LETTER SHAN ZA;Lo;0;L;;;;;N;;;;;
+107A;MYANMAR LETTER SHAN NYA;Lo;0;L;;;;;N;;;;;
+107B;MYANMAR LETTER SHAN DA;Lo;0;L;;;;;N;;;;;
+107C;MYANMAR LETTER SHAN NA;Lo;0;L;;;;;N;;;;;
+107D;MYANMAR LETTER SHAN PHA;Lo;0;L;;;;;N;;;;;
+107E;MYANMAR LETTER SHAN FA;Lo;0;L;;;;;N;;;;;
+107F;MYANMAR LETTER SHAN BA;Lo;0;L;;;;;N;;;;;
+1080;MYANMAR LETTER SHAN THA;Lo;0;L;;;;;N;;;;;
+1081;MYANMAR LETTER SHAN HA;Lo;0;L;;;;;N;;;;;
+1082;MYANMAR CONSONANT SIGN SHAN MEDIAL WA;Mn;0;NSM;;;;;N;;;;;
+1083;MYANMAR VOWEL SIGN SHAN AA;Mc;0;L;;;;;N;;;;;
+1084;MYANMAR VOWEL SIGN SHAN E;Mc;0;L;;;;;N;;;;;
+1085;MYANMAR VOWEL SIGN SHAN E ABOVE;Mn;0;NSM;;;;;N;;;;;
+1086;MYANMAR VOWEL SIGN SHAN FINAL Y;Mn;0;NSM;;;;;N;;;;;
+1087;MYANMAR SIGN SHAN TONE-2;Mc;0;L;;;;;N;;;;;
+1088;MYANMAR SIGN SHAN TONE-3;Mc;0;L;;;;;N;;;;;
+1089;MYANMAR SIGN SHAN TONE-5;Mc;0;L;;;;;N;;;;;
+108A;MYANMAR SIGN SHAN TONE-6;Mc;0;L;;;;;N;;;;;
+108B;MYANMAR SIGN SHAN COUNCIL TONE-2;Mc;0;L;;;;;N;;;;;
+108C;MYANMAR SIGN SHAN COUNCIL TONE-3;Mc;0;L;;;;;N;;;;;
+108D;MYANMAR SIGN SHAN COUNCIL EMPHATIC TONE;Mn;220;NSM;;;;;N;;;;;
+108E;MYANMAR LETTER RUMAI PALAUNG FA;Lo;0;L;;;;;N;;;;;
+108F;MYANMAR SIGN RUMAI PALAUNG TONE-5;Mc;0;L;;;;;N;;;;;
+1090;MYANMAR SHAN DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+1091;MYANMAR SHAN DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+1092;MYANMAR SHAN DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+1093;MYANMAR SHAN DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+1094;MYANMAR SHAN DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+1095;MYANMAR SHAN DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+1096;MYANMAR SHAN DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+1097;MYANMAR SHAN DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+1098;MYANMAR SHAN DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+1099;MYANMAR SHAN DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+109A;MYANMAR SIGN KHAMTI TONE-1;Mc;0;L;;;;;N;;;;;
+109B;MYANMAR SIGN KHAMTI TONE-3;Mc;0;L;;;;;N;;;;;
+109C;MYANMAR VOWEL SIGN AITON A;Mc;0;L;;;;;N;;;;;
+109D;MYANMAR VOWEL SIGN AITON AI;Mn;0;NSM;;;;;N;;;;;
+109E;MYANMAR SYMBOL SHAN ONE;So;0;L;;;;;N;;;;;
+109F;MYANMAR SYMBOL SHAN EXCLAMATION;So;0;L;;;;;N;;;;;
+10A0;GEORGIAN CAPITAL LETTER AN;Lu;0;L;;;;;N;;;;2D00;
+10A1;GEORGIAN CAPITAL LETTER BAN;Lu;0;L;;;;;N;;;;2D01;
+10A2;GEORGIAN CAPITAL LETTER GAN;Lu;0;L;;;;;N;;;;2D02;
+10A3;GEORGIAN CAPITAL LETTER DON;Lu;0;L;;;;;N;;;;2D03;
+10A4;GEORGIAN CAPITAL LETTER EN;Lu;0;L;;;;;N;;;;2D04;
+10A5;GEORGIAN CAPITAL LETTER VIN;Lu;0;L;;;;;N;;;;2D05;
+10A6;GEORGIAN CAPITAL LETTER ZEN;Lu;0;L;;;;;N;;;;2D06;
+10A7;GEORGIAN CAPITAL LETTER TAN;Lu;0;L;;;;;N;;;;2D07;
+10A8;GEORGIAN CAPITAL LETTER IN;Lu;0;L;;;;;N;;;;2D08;
+10A9;GEORGIAN CAPITAL LETTER KAN;Lu;0;L;;;;;N;;;;2D09;
+10AA;GEORGIAN CAPITAL LETTER LAS;Lu;0;L;;;;;N;;;;2D0A;
+10AB;GEORGIAN CAPITAL LETTER MAN;Lu;0;L;;;;;N;;;;2D0B;
+10AC;GEORGIAN CAPITAL LETTER NAR;Lu;0;L;;;;;N;;;;2D0C;
+10AD;GEORGIAN CAPITAL LETTER ON;Lu;0;L;;;;;N;;;;2D0D;
+10AE;GEORGIAN CAPITAL LETTER PAR;Lu;0;L;;;;;N;;;;2D0E;
+10AF;GEORGIAN CAPITAL LETTER ZHAR;Lu;0;L;;;;;N;;;;2D0F;
+10B0;GEORGIAN CAPITAL LETTER RAE;Lu;0;L;;;;;N;;;;2D10;
+10B1;GEORGIAN CAPITAL LETTER SAN;Lu;0;L;;;;;N;;;;2D11;
+10B2;GEORGIAN CAPITAL LETTER TAR;Lu;0;L;;;;;N;;;;2D12;
+10B3;GEORGIAN CAPITAL LETTER UN;Lu;0;L;;;;;N;;;;2D13;
+10B4;GEORGIAN CAPITAL LETTER PHAR;Lu;0;L;;;;;N;;;;2D14;
+10B5;GEORGIAN CAPITAL LETTER KHAR;Lu;0;L;;;;;N;;;;2D15;
+10B6;GEORGIAN CAPITAL LETTER GHAN;Lu;0;L;;;;;N;;;;2D16;
+10B7;GEORGIAN CAPITAL LETTER QAR;Lu;0;L;;;;;N;;;;2D17;
+10B8;GEORGIAN CAPITAL LETTER SHIN;Lu;0;L;;;;;N;;;;2D18;
+10B9;GEORGIAN CAPITAL LETTER CHIN;Lu;0;L;;;;;N;;;;2D19;
+10BA;GEORGIAN CAPITAL LETTER CAN;Lu;0;L;;;;;N;;;;2D1A;
+10BB;GEORGIAN CAPITAL LETTER JIL;Lu;0;L;;;;;N;;;;2D1B;
+10BC;GEORGIAN CAPITAL LETTER CIL;Lu;0;L;;;;;N;;;;2D1C;
+10BD;GEORGIAN CAPITAL LETTER CHAR;Lu;0;L;;;;;N;;;;2D1D;
+10BE;GEORGIAN CAPITAL LETTER XAN;Lu;0;L;;;;;N;;;;2D1E;
+10BF;GEORGIAN CAPITAL LETTER JHAN;Lu;0;L;;;;;N;;;;2D1F;
+10C0;GEORGIAN CAPITAL LETTER HAE;Lu;0;L;;;;;N;;;;2D20;
+10C1;GEORGIAN CAPITAL LETTER HE;Lu;0;L;;;;;N;;;;2D21;
+10C2;GEORGIAN CAPITAL LETTER HIE;Lu;0;L;;;;;N;;;;2D22;
+10C3;GEORGIAN CAPITAL LETTER WE;Lu;0;L;;;;;N;;;;2D23;
+10C4;GEORGIAN CAPITAL LETTER HAR;Lu;0;L;;;;;N;;;;2D24;
+10C5;GEORGIAN CAPITAL LETTER HOE;Lu;0;L;;;;;N;;;;2D25;
+10C7;GEORGIAN CAPITAL LETTER YN;Lu;0;L;;;;;N;;;;2D27;
+10CD;GEORGIAN CAPITAL LETTER AEN;Lu;0;L;;;;;N;;;;2D2D;
+10D0;GEORGIAN LETTER AN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER AN;;;;
+10D1;GEORGIAN LETTER BAN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER BAN;;;;
+10D2;GEORGIAN LETTER GAN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER GAN;;;;
+10D3;GEORGIAN LETTER DON;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER DON;;;;
+10D4;GEORGIAN LETTER EN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER EN;;;;
+10D5;GEORGIAN LETTER VIN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER VIN;;;;
+10D6;GEORGIAN LETTER ZEN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER ZEN;;;;
+10D7;GEORGIAN LETTER TAN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER TAN;;;;
+10D8;GEORGIAN LETTER IN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER IN;;;;
+10D9;GEORGIAN LETTER KAN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER KAN;;;;
+10DA;GEORGIAN LETTER LAS;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER LAS;;;;
+10DB;GEORGIAN LETTER MAN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER MAN;;;;
+10DC;GEORGIAN LETTER NAR;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER NAR;;;;
+10DD;GEORGIAN LETTER ON;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER ON;;;;
+10DE;GEORGIAN LETTER PAR;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER PAR;;;;
+10DF;GEORGIAN LETTER ZHAR;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER ZHAR;;;;
+10E0;GEORGIAN LETTER RAE;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER RAE;;;;
+10E1;GEORGIAN LETTER SAN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER SAN;;;;
+10E2;GEORGIAN LETTER TAR;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER TAR;;;;
+10E3;GEORGIAN LETTER UN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER UN;;;;
+10E4;GEORGIAN LETTER PHAR;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER PHAR;;;;
+10E5;GEORGIAN LETTER KHAR;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER KHAR;;;;
+10E6;GEORGIAN LETTER GHAN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER GHAN;;;;
+10E7;GEORGIAN LETTER QAR;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER QAR;;;;
+10E8;GEORGIAN LETTER SHIN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER SHIN;;;;
+10E9;GEORGIAN LETTER CHIN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER CHIN;;;;
+10EA;GEORGIAN LETTER CAN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER CAN;;;;
+10EB;GEORGIAN LETTER JIL;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER JIL;;;;
+10EC;GEORGIAN LETTER CIL;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER CIL;;;;
+10ED;GEORGIAN LETTER CHAR;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER CHAR;;;;
+10EE;GEORGIAN LETTER XAN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER XAN;;;;
+10EF;GEORGIAN LETTER JHAN;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER JHAN;;;;
+10F0;GEORGIAN LETTER HAE;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER HAE;;;;
+10F1;GEORGIAN LETTER HE;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER HE;;;;
+10F2;GEORGIAN LETTER HIE;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER HIE;;;;
+10F3;GEORGIAN LETTER WE;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER WE;;;;
+10F4;GEORGIAN LETTER HAR;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER HAR;;;;
+10F5;GEORGIAN LETTER HOE;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER HOE;;;;
+10F6;GEORGIAN LETTER FI;Lo;0;L;;;;;N;GEORGIAN SMALL LETTER FI;;;;
+10F7;GEORGIAN LETTER YN;Lo;0;L;;;;;N;;;;;
+10F8;GEORGIAN LETTER ELIFI;Lo;0;L;;;;;N;;;;;
+10F9;GEORGIAN LETTER TURNED GAN;Lo;0;L;;;;;N;;;;;
+10FA;GEORGIAN LETTER AIN;Lo;0;L;;;;;N;;;;;
+10FB;GEORGIAN PARAGRAPH SEPARATOR;Po;0;L;;;;;N;;;;;
+10FC;MODIFIER LETTER GEORGIAN NAR;Lm;0;L;<super> 10DC;;;;N;;;;;
+10FD;GEORGIAN LETTER AEN;Lo;0;L;;;;;N;;;;;
+10FE;GEORGIAN LETTER HARD SIGN;Lo;0;L;;;;;N;;;;;
+10FF;GEORGIAN LETTER LABIAL SIGN;Lo;0;L;;;;;N;;;;;
+1100;HANGUL CHOSEONG KIYEOK;Lo;0;L;;;;;N;;;;;
+1101;HANGUL CHOSEONG SSANGKIYEOK;Lo;0;L;;;;;N;;;;;
+1102;HANGUL CHOSEONG NIEUN;Lo;0;L;;;;;N;;;;;
+1103;HANGUL CHOSEONG TIKEUT;Lo;0;L;;;;;N;;;;;
+1104;HANGUL CHOSEONG SSANGTIKEUT;Lo;0;L;;;;;N;;;;;
+1105;HANGUL CHOSEONG RIEUL;Lo;0;L;;;;;N;;;;;
+1106;HANGUL CHOSEONG MIEUM;Lo;0;L;;;;;N;;;;;
+1107;HANGUL CHOSEONG PIEUP;Lo;0;L;;;;;N;;;;;
+1108;HANGUL CHOSEONG SSANGPIEUP;Lo;0;L;;;;;N;;;;;
+1109;HANGUL CHOSEONG SIOS;Lo;0;L;;;;;N;;;;;
+110A;HANGUL CHOSEONG SSANGSIOS;Lo;0;L;;;;;N;;;;;
+110B;HANGUL CHOSEONG IEUNG;Lo;0;L;;;;;N;;;;;
+110C;HANGUL CHOSEONG CIEUC;Lo;0;L;;;;;N;;;;;
+110D;HANGUL CHOSEONG SSANGCIEUC;Lo;0;L;;;;;N;;;;;
+110E;HANGUL CHOSEONG CHIEUCH;Lo;0;L;;;;;N;;;;;
+110F;HANGUL CHOSEONG KHIEUKH;Lo;0;L;;;;;N;;;;;
+1110;HANGUL CHOSEONG THIEUTH;Lo;0;L;;;;;N;;;;;
+1111;HANGUL CHOSEONG PHIEUPH;Lo;0;L;;;;;N;;;;;
+1112;HANGUL CHOSEONG HIEUH;Lo;0;L;;;;;N;;;;;
+1113;HANGUL CHOSEONG NIEUN-KIYEOK;Lo;0;L;;;;;N;;;;;
+1114;HANGUL CHOSEONG SSANGNIEUN;Lo;0;L;;;;;N;;;;;
+1115;HANGUL CHOSEONG NIEUN-TIKEUT;Lo;0;L;;;;;N;;;;;
+1116;HANGUL CHOSEONG NIEUN-PIEUP;Lo;0;L;;;;;N;;;;;
+1117;HANGUL CHOSEONG TIKEUT-KIYEOK;Lo;0;L;;;;;N;;;;;
+1118;HANGUL CHOSEONG RIEUL-NIEUN;Lo;0;L;;;;;N;;;;;
+1119;HANGUL CHOSEONG SSANGRIEUL;Lo;0;L;;;;;N;;;;;
+111A;HANGUL CHOSEONG RIEUL-HIEUH;Lo;0;L;;;;;N;;;;;
+111B;HANGUL CHOSEONG KAPYEOUNRIEUL;Lo;0;L;;;;;N;;;;;
+111C;HANGUL CHOSEONG MIEUM-PIEUP;Lo;0;L;;;;;N;;;;;
+111D;HANGUL CHOSEONG KAPYEOUNMIEUM;Lo;0;L;;;;;N;;;;;
+111E;HANGUL CHOSEONG PIEUP-KIYEOK;Lo;0;L;;;;;N;;;;;
+111F;HANGUL CHOSEONG PIEUP-NIEUN;Lo;0;L;;;;;N;;;;;
+1120;HANGUL CHOSEONG PIEUP-TIKEUT;Lo;0;L;;;;;N;;;;;
+1121;HANGUL CHOSEONG PIEUP-SIOS;Lo;0;L;;;;;N;;;;;
+1122;HANGUL CHOSEONG PIEUP-SIOS-KIYEOK;Lo;0;L;;;;;N;;;;;
+1123;HANGUL CHOSEONG PIEUP-SIOS-TIKEUT;Lo;0;L;;;;;N;;;;;
+1124;HANGUL CHOSEONG PIEUP-SIOS-PIEUP;Lo;0;L;;;;;N;;;;;
+1125;HANGUL CHOSEONG PIEUP-SSANGSIOS;Lo;0;L;;;;;N;;;;;
+1126;HANGUL CHOSEONG PIEUP-SIOS-CIEUC;Lo;0;L;;;;;N;;;;;
+1127;HANGUL CHOSEONG PIEUP-CIEUC;Lo;0;L;;;;;N;;;;;
+1128;HANGUL CHOSEONG PIEUP-CHIEUCH;Lo;0;L;;;;;N;;;;;
+1129;HANGUL CHOSEONG PIEUP-THIEUTH;Lo;0;L;;;;;N;;;;;
+112A;HANGUL CHOSEONG PIEUP-PHIEUPH;Lo;0;L;;;;;N;;;;;
+112B;HANGUL CHOSEONG KAPYEOUNPIEUP;Lo;0;L;;;;;N;;;;;
+112C;HANGUL CHOSEONG KAPYEOUNSSANGPIEUP;Lo;0;L;;;;;N;;;;;
+112D;HANGUL CHOSEONG SIOS-KIYEOK;Lo;0;L;;;;;N;;;;;
+112E;HANGUL CHOSEONG SIOS-NIEUN;Lo;0;L;;;;;N;;;;;
+112F;HANGUL CHOSEONG SIOS-TIKEUT;Lo;0;L;;;;;N;;;;;
+1130;HANGUL CHOSEONG SIOS-RIEUL;Lo;0;L;;;;;N;;;;;
+1131;HANGUL CHOSEONG SIOS-MIEUM;Lo;0;L;;;;;N;;;;;
+1132;HANGUL CHOSEONG SIOS-PIEUP;Lo;0;L;;;;;N;;;;;
+1133;HANGUL CHOSEONG SIOS-PIEUP-KIYEOK;Lo;0;L;;;;;N;;;;;
+1134;HANGUL CHOSEONG SIOS-SSANGSIOS;Lo;0;L;;;;;N;;;;;
+1135;HANGUL CHOSEONG SIOS-IEUNG;Lo;0;L;;;;;N;;;;;
+1136;HANGUL CHOSEONG SIOS-CIEUC;Lo;0;L;;;;;N;;;;;
+1137;HANGUL CHOSEONG SIOS-CHIEUCH;Lo;0;L;;;;;N;;;;;
+1138;HANGUL CHOSEONG SIOS-KHIEUKH;Lo;0;L;;;;;N;;;;;
+1139;HANGUL CHOSEONG SIOS-THIEUTH;Lo;0;L;;;;;N;;;;;
+113A;HANGUL CHOSEONG SIOS-PHIEUPH;Lo;0;L;;;;;N;;;;;
+113B;HANGUL CHOSEONG SIOS-HIEUH;Lo;0;L;;;;;N;;;;;
+113C;HANGUL CHOSEONG CHITUEUMSIOS;Lo;0;L;;;;;N;;;;;
+113D;HANGUL CHOSEONG CHITUEUMSSANGSIOS;Lo;0;L;;;;;N;;;;;
+113E;HANGUL CHOSEONG CEONGCHIEUMSIOS;Lo;0;L;;;;;N;;;;;
+113F;HANGUL CHOSEONG CEONGCHIEUMSSANGSIOS;Lo;0;L;;;;;N;;;;;
+1140;HANGUL CHOSEONG PANSIOS;Lo;0;L;;;;;N;;;;;
+1141;HANGUL CHOSEONG IEUNG-KIYEOK;Lo;0;L;;;;;N;;;;;
+1142;HANGUL CHOSEONG IEUNG-TIKEUT;Lo;0;L;;;;;N;;;;;
+1143;HANGUL CHOSEONG IEUNG-MIEUM;Lo;0;L;;;;;N;;;;;
+1144;HANGUL CHOSEONG IEUNG-PIEUP;Lo;0;L;;;;;N;;;;;
+1145;HANGUL CHOSEONG IEUNG-SIOS;Lo;0;L;;;;;N;;;;;
+1146;HANGUL CHOSEONG IEUNG-PANSIOS;Lo;0;L;;;;;N;;;;;
+1147;HANGUL CHOSEONG SSANGIEUNG;Lo;0;L;;;;;N;;;;;
+1148;HANGUL CHOSEONG IEUNG-CIEUC;Lo;0;L;;;;;N;;;;;
+1149;HANGUL CHOSEONG IEUNG-CHIEUCH;Lo;0;L;;;;;N;;;;;
+114A;HANGUL CHOSEONG IEUNG-THIEUTH;Lo;0;L;;;;;N;;;;;
+114B;HANGUL CHOSEONG IEUNG-PHIEUPH;Lo;0;L;;;;;N;;;;;
+114C;HANGUL CHOSEONG YESIEUNG;Lo;0;L;;;;;N;;;;;
+114D;HANGUL CHOSEONG CIEUC-IEUNG;Lo;0;L;;;;;N;;;;;
+114E;HANGUL CHOSEONG CHITUEUMCIEUC;Lo;0;L;;;;;N;;;;;
+114F;HANGUL CHOSEONG CHITUEUMSSANGCIEUC;Lo;0;L;;;;;N;;;;;
+1150;HANGUL CHOSEONG CEONGCHIEUMCIEUC;Lo;0;L;;;;;N;;;;;
+1151;HANGUL CHOSEONG CEONGCHIEUMSSANGCIEUC;Lo;0;L;;;;;N;;;;;
+1152;HANGUL CHOSEONG CHIEUCH-KHIEUKH;Lo;0;L;;;;;N;;;;;
+1153;HANGUL CHOSEONG CHIEUCH-HIEUH;Lo;0;L;;;;;N;;;;;
+1154;HANGUL CHOSEONG CHITUEUMCHIEUCH;Lo;0;L;;;;;N;;;;;
+1155;HANGUL CHOSEONG CEONGCHIEUMCHIEUCH;Lo;0;L;;;;;N;;;;;
+1156;HANGUL CHOSEONG PHIEUPH-PIEUP;Lo;0;L;;;;;N;;;;;
+1157;HANGUL CHOSEONG KAPYEOUNPHIEUPH;Lo;0;L;;;;;N;;;;;
+1158;HANGUL CHOSEONG SSANGHIEUH;Lo;0;L;;;;;N;;;;;
+1159;HANGUL CHOSEONG YEORINHIEUH;Lo;0;L;;;;;N;;;;;
+115A;HANGUL CHOSEONG KIYEOK-TIKEUT;Lo;0;L;;;;;N;;;;;
+115B;HANGUL CHOSEONG NIEUN-SIOS;Lo;0;L;;;;;N;;;;;
+115C;HANGUL CHOSEONG NIEUN-CIEUC;Lo;0;L;;;;;N;;;;;
+115D;HANGUL CHOSEONG NIEUN-HIEUH;Lo;0;L;;;;;N;;;;;
+115E;HANGUL CHOSEONG TIKEUT-RIEUL;Lo;0;L;;;;;N;;;;;
+115F;HANGUL CHOSEONG FILLER;Lo;0;L;;;;;N;;;;;
+1160;HANGUL JUNGSEONG FILLER;Lo;0;L;;;;;N;;;;;
+1161;HANGUL JUNGSEONG A;Lo;0;L;;;;;N;;;;;
+1162;HANGUL JUNGSEONG AE;Lo;0;L;;;;;N;;;;;
+1163;HANGUL JUNGSEONG YA;Lo;0;L;;;;;N;;;;;
+1164;HANGUL JUNGSEONG YAE;Lo;0;L;;;;;N;;;;;
+1165;HANGUL JUNGSEONG EO;Lo;0;L;;;;;N;;;;;
+1166;HANGUL JUNGSEONG E;Lo;0;L;;;;;N;;;;;
+1167;HANGUL JUNGSEONG YEO;Lo;0;L;;;;;N;;;;;
+1168;HANGUL JUNGSEONG YE;Lo;0;L;;;;;N;;;;;
+1169;HANGUL JUNGSEONG O;Lo;0;L;;;;;N;;;;;
+116A;HANGUL JUNGSEONG WA;Lo;0;L;;;;;N;;;;;
+116B;HANGUL JUNGSEONG WAE;Lo;0;L;;;;;N;;;;;
+116C;HANGUL JUNGSEONG OE;Lo;0;L;;;;;N;;;;;
+116D;HANGUL JUNGSEONG YO;Lo;0;L;;;;;N;;;;;
+116E;HANGUL JUNGSEONG U;Lo;0;L;;;;;N;;;;;
+116F;HANGUL JUNGSEONG WEO;Lo;0;L;;;;;N;;;;;
+1170;HANGUL JUNGSEONG WE;Lo;0;L;;;;;N;;;;;
+1171;HANGUL JUNGSEONG WI;Lo;0;L;;;;;N;;;;;
+1172;HANGUL JUNGSEONG YU;Lo;0;L;;;;;N;;;;;
+1173;HANGUL JUNGSEONG EU;Lo;0;L;;;;;N;;;;;
+1174;HANGUL JUNGSEONG YI;Lo;0;L;;;;;N;;;;;
+1175;HANGUL JUNGSEONG I;Lo;0;L;;;;;N;;;;;
+1176;HANGUL JUNGSEONG A-O;Lo;0;L;;;;;N;;;;;
+1177;HANGUL JUNGSEONG A-U;Lo;0;L;;;;;N;;;;;
+1178;HANGUL JUNGSEONG YA-O;Lo;0;L;;;;;N;;;;;
+1179;HANGUL JUNGSEONG YA-YO;Lo;0;L;;;;;N;;;;;
+117A;HANGUL JUNGSEONG EO-O;Lo;0;L;;;;;N;;;;;
+117B;HANGUL JUNGSEONG EO-U;Lo;0;L;;;;;N;;;;;
+117C;HANGUL JUNGSEONG EO-EU;Lo;0;L;;;;;N;;;;;
+117D;HANGUL JUNGSEONG YEO-O;Lo;0;L;;;;;N;;;;;
+117E;HANGUL JUNGSEONG YEO-U;Lo;0;L;;;;;N;;;;;
+117F;HANGUL JUNGSEONG O-EO;Lo;0;L;;;;;N;;;;;
+1180;HANGUL JUNGSEONG O-E;Lo;0;L;;;;;N;;;;;
+1181;HANGUL JUNGSEONG O-YE;Lo;0;L;;;;;N;;;;;
+1182;HANGUL JUNGSEONG O-O;Lo;0;L;;;;;N;;;;;
+1183;HANGUL JUNGSEONG O-U;Lo;0;L;;;;;N;;;;;
+1184;HANGUL JUNGSEONG YO-YA;Lo;0;L;;;;;N;;;;;
+1185;HANGUL JUNGSEONG YO-YAE;Lo;0;L;;;;;N;;;;;
+1186;HANGUL JUNGSEONG YO-YEO;Lo;0;L;;;;;N;;;;;
+1187;HANGUL JUNGSEONG YO-O;Lo;0;L;;;;;N;;;;;
+1188;HANGUL JUNGSEONG YO-I;Lo;0;L;;;;;N;;;;;
+1189;HANGUL JUNGSEONG U-A;Lo;0;L;;;;;N;;;;;
+118A;HANGUL JUNGSEONG U-AE;Lo;0;L;;;;;N;;;;;
+118B;HANGUL JUNGSEONG U-EO-EU;Lo;0;L;;;;;N;;;;;
+118C;HANGUL JUNGSEONG U-YE;Lo;0;L;;;;;N;;;;;
+118D;HANGUL JUNGSEONG U-U;Lo;0;L;;;;;N;;;;;
+118E;HANGUL JUNGSEONG YU-A;Lo;0;L;;;;;N;;;;;
+118F;HANGUL JUNGSEONG YU-EO;Lo;0;L;;;;;N;;;;;
+1190;HANGUL JUNGSEONG YU-E;Lo;0;L;;;;;N;;;;;
+1191;HANGUL JUNGSEONG YU-YEO;Lo;0;L;;;;;N;;;;;
+1192;HANGUL JUNGSEONG YU-YE;Lo;0;L;;;;;N;;;;;
+1193;HANGUL JUNGSEONG YU-U;Lo;0;L;;;;;N;;;;;
+1194;HANGUL JUNGSEONG YU-I;Lo;0;L;;;;;N;;;;;
+1195;HANGUL JUNGSEONG EU-U;Lo;0;L;;;;;N;;;;;
+1196;HANGUL JUNGSEONG EU-EU;Lo;0;L;;;;;N;;;;;
+1197;HANGUL JUNGSEONG YI-U;Lo;0;L;;;;;N;;;;;
+1198;HANGUL JUNGSEONG I-A;Lo;0;L;;;;;N;;;;;
+1199;HANGUL JUNGSEONG I-YA;Lo;0;L;;;;;N;;;;;
+119A;HANGUL JUNGSEONG I-O;Lo;0;L;;;;;N;;;;;
+119B;HANGUL JUNGSEONG I-U;Lo;0;L;;;;;N;;;;;
+119C;HANGUL JUNGSEONG I-EU;Lo;0;L;;;;;N;;;;;
+119D;HANGUL JUNGSEONG I-ARAEA;Lo;0;L;;;;;N;;;;;
+119E;HANGUL JUNGSEONG ARAEA;Lo;0;L;;;;;N;;;;;
+119F;HANGUL JUNGSEONG ARAEA-EO;Lo;0;L;;;;;N;;;;;
+11A0;HANGUL JUNGSEONG ARAEA-U;Lo;0;L;;;;;N;;;;;
+11A1;HANGUL JUNGSEONG ARAEA-I;Lo;0;L;;;;;N;;;;;
+11A2;HANGUL JUNGSEONG SSANGARAEA;Lo;0;L;;;;;N;;;;;
+11A3;HANGUL JUNGSEONG A-EU;Lo;0;L;;;;;N;;;;;
+11A4;HANGUL JUNGSEONG YA-U;Lo;0;L;;;;;N;;;;;
+11A5;HANGUL JUNGSEONG YEO-YA;Lo;0;L;;;;;N;;;;;
+11A6;HANGUL JUNGSEONG O-YA;Lo;0;L;;;;;N;;;;;
+11A7;HANGUL JUNGSEONG O-YAE;Lo;0;L;;;;;N;;;;;
+11A8;HANGUL JONGSEONG KIYEOK;Lo;0;L;;;;;N;;;;;
+11A9;HANGUL JONGSEONG SSANGKIYEOK;Lo;0;L;;;;;N;;;;;
+11AA;HANGUL JONGSEONG KIYEOK-SIOS;Lo;0;L;;;;;N;;;;;
+11AB;HANGUL JONGSEONG NIEUN;Lo;0;L;;;;;N;;;;;
+11AC;HANGUL JONGSEONG NIEUN-CIEUC;Lo;0;L;;;;;N;;;;;
+11AD;HANGUL JONGSEONG NIEUN-HIEUH;Lo;0;L;;;;;N;;;;;
+11AE;HANGUL JONGSEONG TIKEUT;Lo;0;L;;;;;N;;;;;
+11AF;HANGUL JONGSEONG RIEUL;Lo;0;L;;;;;N;;;;;
+11B0;HANGUL JONGSEONG RIEUL-KIYEOK;Lo;0;L;;;;;N;;;;;
+11B1;HANGUL JONGSEONG RIEUL-MIEUM;Lo;0;L;;;;;N;;;;;
+11B2;HANGUL JONGSEONG RIEUL-PIEUP;Lo;0;L;;;;;N;;;;;
+11B3;HANGUL JONGSEONG RIEUL-SIOS;Lo;0;L;;;;;N;;;;;
+11B4;HANGUL JONGSEONG RIEUL-THIEUTH;Lo;0;L;;;;;N;;;;;
+11B5;HANGUL JONGSEONG RIEUL-PHIEUPH;Lo;0;L;;;;;N;;;;;
+11B6;HANGUL JONGSEONG RIEUL-HIEUH;Lo;0;L;;;;;N;;;;;
+11B7;HANGUL JONGSEONG MIEUM;Lo;0;L;;;;;N;;;;;
+11B8;HANGUL JONGSEONG PIEUP;Lo;0;L;;;;;N;;;;;
+11B9;HANGUL JONGSEONG PIEUP-SIOS;Lo;0;L;;;;;N;;;;;
+11BA;HANGUL JONGSEONG SIOS;Lo;0;L;;;;;N;;;;;
+11BB;HANGUL JONGSEONG SSANGSIOS;Lo;0;L;;;;;N;;;;;
+11BC;HANGUL JONGSEONG IEUNG;Lo;0;L;;;;;N;;;;;
+11BD;HANGUL JONGSEONG CIEUC;Lo;0;L;;;;;N;;;;;
+11BE;HANGUL JONGSEONG CHIEUCH;Lo;0;L;;;;;N;;;;;
+11BF;HANGUL JONGSEONG KHIEUKH;Lo;0;L;;;;;N;;;;;
+11C0;HANGUL JONGSEONG THIEUTH;Lo;0;L;;;;;N;;;;;
+11C1;HANGUL JONGSEONG PHIEUPH;Lo;0;L;;;;;N;;;;;
+11C2;HANGUL JONGSEONG HIEUH;Lo;0;L;;;;;N;;;;;
+11C3;HANGUL JONGSEONG KIYEOK-RIEUL;Lo;0;L;;;;;N;;;;;
+11C4;HANGUL JONGSEONG KIYEOK-SIOS-KIYEOK;Lo;0;L;;;;;N;;;;;
+11C5;HANGUL JONGSEONG NIEUN-KIYEOK;Lo;0;L;;;;;N;;;;;
+11C6;HANGUL JONGSEONG NIEUN-TIKEUT;Lo;0;L;;;;;N;;;;;
+11C7;HANGUL JONGSEONG NIEUN-SIOS;Lo;0;L;;;;;N;;;;;
+11C8;HANGUL JONGSEONG NIEUN-PANSIOS;Lo;0;L;;;;;N;;;;;
+11C9;HANGUL JONGSEONG NIEUN-THIEUTH;Lo;0;L;;;;;N;;;;;
+11CA;HANGUL JONGSEONG TIKEUT-KIYEOK;Lo;0;L;;;;;N;;;;;
+11CB;HANGUL JONGSEONG TIKEUT-RIEUL;Lo;0;L;;;;;N;;;;;
+11CC;HANGUL JONGSEONG RIEUL-KIYEOK-SIOS;Lo;0;L;;;;;N;;;;;
+11CD;HANGUL JONGSEONG RIEUL-NIEUN;Lo;0;L;;;;;N;;;;;
+11CE;HANGUL JONGSEONG RIEUL-TIKEUT;Lo;0;L;;;;;N;;;;;
+11CF;HANGUL JONGSEONG RIEUL-TIKEUT-HIEUH;Lo;0;L;;;;;N;;;;;
+11D0;HANGUL JONGSEONG SSANGRIEUL;Lo;0;L;;;;;N;;;;;
+11D1;HANGUL JONGSEONG RIEUL-MIEUM-KIYEOK;Lo;0;L;;;;;N;;;;;
+11D2;HANGUL JONGSEONG RIEUL-MIEUM-SIOS;Lo;0;L;;;;;N;;;;;
+11D3;HANGUL JONGSEONG RIEUL-PIEUP-SIOS;Lo;0;L;;;;;N;;;;;
+11D4;HANGUL JONGSEONG RIEUL-PIEUP-HIEUH;Lo;0;L;;;;;N;;;;;
+11D5;HANGUL JONGSEONG RIEUL-KAPYEOUNPIEUP;Lo;0;L;;;;;N;;;;;
+11D6;HANGUL JONGSEONG RIEUL-SSANGSIOS;Lo;0;L;;;;;N;;;;;
+11D7;HANGUL JONGSEONG RIEUL-PANSIOS;Lo;0;L;;;;;N;;;;;
+11D8;HANGUL JONGSEONG RIEUL-KHIEUKH;Lo;0;L;;;;;N;;;;;
+11D9;HANGUL JONGSEONG RIEUL-YEORINHIEUH;Lo;0;L;;;;;N;;;;;
+11DA;HANGUL JONGSEONG MIEUM-KIYEOK;Lo;0;L;;;;;N;;;;;
+11DB;HANGUL JONGSEONG MIEUM-RIEUL;Lo;0;L;;;;;N;;;;;
+11DC;HANGUL JONGSEONG MIEUM-PIEUP;Lo;0;L;;;;;N;;;;;
+11DD;HANGUL JONGSEONG MIEUM-SIOS;Lo;0;L;;;;;N;;;;;
+11DE;HANGUL JONGSEONG MIEUM-SSANGSIOS;Lo;0;L;;;;;N;;;;;
+11DF;HANGUL JONGSEONG MIEUM-PANSIOS;Lo;0;L;;;;;N;;;;;
+11E0;HANGUL JONGSEONG MIEUM-CHIEUCH;Lo;0;L;;;;;N;;;;;
+11E1;HANGUL JONGSEONG MIEUM-HIEUH;Lo;0;L;;;;;N;;;;;
+11E2;HANGUL JONGSEONG KAPYEOUNMIEUM;Lo;0;L;;;;;N;;;;;
+11E3;HANGUL JONGSEONG PIEUP-RIEUL;Lo;0;L;;;;;N;;;;;
+11E4;HANGUL JONGSEONG PIEUP-PHIEUPH;Lo;0;L;;;;;N;;;;;
+11E5;HANGUL JONGSEONG PIEUP-HIEUH;Lo;0;L;;;;;N;;;;;
+11E6;HANGUL JONGSEONG KAPYEOUNPIEUP;Lo;0;L;;;;;N;;;;;
+11E7;HANGUL JONGSEONG SIOS-KIYEOK;Lo;0;L;;;;;N;;;;;
+11E8;HANGUL JONGSEONG SIOS-TIKEUT;Lo;0;L;;;;;N;;;;;
+11E9;HANGUL JONGSEONG SIOS-RIEUL;Lo;0;L;;;;;N;;;;;
+11EA;HANGUL JONGSEONG SIOS-PIEUP;Lo;0;L;;;;;N;;;;;
+11EB;HANGUL JONGSEONG PANSIOS;Lo;0;L;;;;;N;;;;;
+11EC;HANGUL JONGSEONG IEUNG-KIYEOK;Lo;0;L;;;;;N;;;;;
+11ED;HANGUL JONGSEONG IEUNG-SSANGKIYEOK;Lo;0;L;;;;;N;;;;;
+11EE;HANGUL JONGSEONG SSANGIEUNG;Lo;0;L;;;;;N;;;;;
+11EF;HANGUL JONGSEONG IEUNG-KHIEUKH;Lo;0;L;;;;;N;;;;;
+11F0;HANGUL JONGSEONG YESIEUNG;Lo;0;L;;;;;N;;;;;
+11F1;HANGUL JONGSEONG YESIEUNG-SIOS;Lo;0;L;;;;;N;;;;;
+11F2;HANGUL JONGSEONG YESIEUNG-PANSIOS;Lo;0;L;;;;;N;;;;;
+11F3;HANGUL JONGSEONG PHIEUPH-PIEUP;Lo;0;L;;;;;N;;;;;
+11F4;HANGUL JONGSEONG KAPYEOUNPHIEUPH;Lo;0;L;;;;;N;;;;;
+11F5;HANGUL JONGSEONG HIEUH-NIEUN;Lo;0;L;;;;;N;;;;;
+11F6;HANGUL JONGSEONG HIEUH-RIEUL;Lo;0;L;;;;;N;;;;;
+11F7;HANGUL JONGSEONG HIEUH-MIEUM;Lo;0;L;;;;;N;;;;;
+11F8;HANGUL JONGSEONG HIEUH-PIEUP;Lo;0;L;;;;;N;;;;;
+11F9;HANGUL JONGSEONG YEORINHIEUH;Lo;0;L;;;;;N;;;;;
+11FA;HANGUL JONGSEONG KIYEOK-NIEUN;Lo;0;L;;;;;N;;;;;
+11FB;HANGUL JONGSEONG KIYEOK-PIEUP;Lo;0;L;;;;;N;;;;;
+11FC;HANGUL JONGSEONG KIYEOK-CHIEUCH;Lo;0;L;;;;;N;;;;;
+11FD;HANGUL JONGSEONG KIYEOK-KHIEUKH;Lo;0;L;;;;;N;;;;;
+11FE;HANGUL JONGSEONG KIYEOK-HIEUH;Lo;0;L;;;;;N;;;;;
+11FF;HANGUL JONGSEONG SSANGNIEUN;Lo;0;L;;;;;N;;;;;
+1200;ETHIOPIC SYLLABLE HA;Lo;0;L;;;;;N;;;;;
+1201;ETHIOPIC SYLLABLE HU;Lo;0;L;;;;;N;;;;;
+1202;ETHIOPIC SYLLABLE HI;Lo;0;L;;;;;N;;;;;
+1203;ETHIOPIC SYLLABLE HAA;Lo;0;L;;;;;N;;;;;
+1204;ETHIOPIC SYLLABLE HEE;Lo;0;L;;;;;N;;;;;
+1205;ETHIOPIC SYLLABLE HE;Lo;0;L;;;;;N;;;;;
+1206;ETHIOPIC SYLLABLE HO;Lo;0;L;;;;;N;;;;;
+1207;ETHIOPIC SYLLABLE HOA;Lo;0;L;;;;;N;;;;;
+1208;ETHIOPIC SYLLABLE LA;Lo;0;L;;;;;N;;;;;
+1209;ETHIOPIC SYLLABLE LU;Lo;0;L;;;;;N;;;;;
+120A;ETHIOPIC SYLLABLE LI;Lo;0;L;;;;;N;;;;;
+120B;ETHIOPIC SYLLABLE LAA;Lo;0;L;;;;;N;;;;;
+120C;ETHIOPIC SYLLABLE LEE;Lo;0;L;;;;;N;;;;;
+120D;ETHIOPIC SYLLABLE LE;Lo;0;L;;;;;N;;;;;
+120E;ETHIOPIC SYLLABLE LO;Lo;0;L;;;;;N;;;;;
+120F;ETHIOPIC SYLLABLE LWA;Lo;0;L;;;;;N;;;;;
+1210;ETHIOPIC SYLLABLE HHA;Lo;0;L;;;;;N;;;;;
+1211;ETHIOPIC SYLLABLE HHU;Lo;0;L;;;;;N;;;;;
+1212;ETHIOPIC SYLLABLE HHI;Lo;0;L;;;;;N;;;;;
+1213;ETHIOPIC SYLLABLE HHAA;Lo;0;L;;;;;N;;;;;
+1214;ETHIOPIC SYLLABLE HHEE;Lo;0;L;;;;;N;;;;;
+1215;ETHIOPIC SYLLABLE HHE;Lo;0;L;;;;;N;;;;;
+1216;ETHIOPIC SYLLABLE HHO;Lo;0;L;;;;;N;;;;;
+1217;ETHIOPIC SYLLABLE HHWA;Lo;0;L;;;;;N;;;;;
+1218;ETHIOPIC SYLLABLE MA;Lo;0;L;;;;;N;;;;;
+1219;ETHIOPIC SYLLABLE MU;Lo;0;L;;;;;N;;;;;
+121A;ETHIOPIC SYLLABLE MI;Lo;0;L;;;;;N;;;;;
+121B;ETHIOPIC SYLLABLE MAA;Lo;0;L;;;;;N;;;;;
+121C;ETHIOPIC SYLLABLE MEE;Lo;0;L;;;;;N;;;;;
+121D;ETHIOPIC SYLLABLE ME;Lo;0;L;;;;;N;;;;;
+121E;ETHIOPIC SYLLABLE MO;Lo;0;L;;;;;N;;;;;
+121F;ETHIOPIC SYLLABLE MWA;Lo;0;L;;;;;N;;;;;
+1220;ETHIOPIC SYLLABLE SZA;Lo;0;L;;;;;N;;;;;
+1221;ETHIOPIC SYLLABLE SZU;Lo;0;L;;;;;N;;;;;
+1222;ETHIOPIC SYLLABLE SZI;Lo;0;L;;;;;N;;;;;
+1223;ETHIOPIC SYLLABLE SZAA;Lo;0;L;;;;;N;;;;;
+1224;ETHIOPIC SYLLABLE SZEE;Lo;0;L;;;;;N;;;;;
+1225;ETHIOPIC SYLLABLE SZE;Lo;0;L;;;;;N;;;;;
+1226;ETHIOPIC SYLLABLE SZO;Lo;0;L;;;;;N;;;;;
+1227;ETHIOPIC SYLLABLE SZWA;Lo;0;L;;;;;N;;;;;
+1228;ETHIOPIC SYLLABLE RA;Lo;0;L;;;;;N;;;;;
+1229;ETHIOPIC SYLLABLE RU;Lo;0;L;;;;;N;;;;;
+122A;ETHIOPIC SYLLABLE RI;Lo;0;L;;;;;N;;;;;
+122B;ETHIOPIC SYLLABLE RAA;Lo;0;L;;;;;N;;;;;
+122C;ETHIOPIC SYLLABLE REE;Lo;0;L;;;;;N;;;;;
+122D;ETHIOPIC SYLLABLE RE;Lo;0;L;;;;;N;;;;;
+122E;ETHIOPIC SYLLABLE RO;Lo;0;L;;;;;N;;;;;
+122F;ETHIOPIC SYLLABLE RWA;Lo;0;L;;;;;N;;;;;
+1230;ETHIOPIC SYLLABLE SA;Lo;0;L;;;;;N;;;;;
+1231;ETHIOPIC SYLLABLE SU;Lo;0;L;;;;;N;;;;;
+1232;ETHIOPIC SYLLABLE SI;Lo;0;L;;;;;N;;;;;
+1233;ETHIOPIC SYLLABLE SAA;Lo;0;L;;;;;N;;;;;
+1234;ETHIOPIC SYLLABLE SEE;Lo;0;L;;;;;N;;;;;
+1235;ETHIOPIC SYLLABLE SE;Lo;0;L;;;;;N;;;;;
+1236;ETHIOPIC SYLLABLE SO;Lo;0;L;;;;;N;;;;;
+1237;ETHIOPIC SYLLABLE SWA;Lo;0;L;;;;;N;;;;;
+1238;ETHIOPIC SYLLABLE SHA;Lo;0;L;;;;;N;;;;;
+1239;ETHIOPIC SYLLABLE SHU;Lo;0;L;;;;;N;;;;;
+123A;ETHIOPIC SYLLABLE SHI;Lo;0;L;;;;;N;;;;;
+123B;ETHIOPIC SYLLABLE SHAA;Lo;0;L;;;;;N;;;;;
+123C;ETHIOPIC SYLLABLE SHEE;Lo;0;L;;;;;N;;;;;
+123D;ETHIOPIC SYLLABLE SHE;Lo;0;L;;;;;N;;;;;
+123E;ETHIOPIC SYLLABLE SHO;Lo;0;L;;;;;N;;;;;
+123F;ETHIOPIC SYLLABLE SHWA;Lo;0;L;;;;;N;;;;;
+1240;ETHIOPIC SYLLABLE QA;Lo;0;L;;;;;N;;;;;
+1241;ETHIOPIC SYLLABLE QU;Lo;0;L;;;;;N;;;;;
+1242;ETHIOPIC SYLLABLE QI;Lo;0;L;;;;;N;;;;;
+1243;ETHIOPIC SYLLABLE QAA;Lo;0;L;;;;;N;;;;;
+1244;ETHIOPIC SYLLABLE QEE;Lo;0;L;;;;;N;;;;;
+1245;ETHIOPIC SYLLABLE QE;Lo;0;L;;;;;N;;;;;
+1246;ETHIOPIC SYLLABLE QO;Lo;0;L;;;;;N;;;;;
+1247;ETHIOPIC SYLLABLE QOA;Lo;0;L;;;;;N;;;;;
+1248;ETHIOPIC SYLLABLE QWA;Lo;0;L;;;;;N;;;;;
+124A;ETHIOPIC SYLLABLE QWI;Lo;0;L;;;;;N;;;;;
+124B;ETHIOPIC SYLLABLE QWAA;Lo;0;L;;;;;N;;;;;
+124C;ETHIOPIC SYLLABLE QWEE;Lo;0;L;;;;;N;;;;;
+124D;ETHIOPIC SYLLABLE QWE;Lo;0;L;;;;;N;;;;;
+1250;ETHIOPIC SYLLABLE QHA;Lo;0;L;;;;;N;;;;;
+1251;ETHIOPIC SYLLABLE QHU;Lo;0;L;;;;;N;;;;;
+1252;ETHIOPIC SYLLABLE QHI;Lo;0;L;;;;;N;;;;;
+1253;ETHIOPIC SYLLABLE QHAA;Lo;0;L;;;;;N;;;;;
+1254;ETHIOPIC SYLLABLE QHEE;Lo;0;L;;;;;N;;;;;
+1255;ETHIOPIC SYLLABLE QHE;Lo;0;L;;;;;N;;;;;
+1256;ETHIOPIC SYLLABLE QHO;Lo;0;L;;;;;N;;;;;
+1258;ETHIOPIC SYLLABLE QHWA;Lo;0;L;;;;;N;;;;;
+125A;ETHIOPIC SYLLABLE QHWI;Lo;0;L;;;;;N;;;;;
+125B;ETHIOPIC SYLLABLE QHWAA;Lo;0;L;;;;;N;;;;;
+125C;ETHIOPIC SYLLABLE QHWEE;Lo;0;L;;;;;N;;;;;
+125D;ETHIOPIC SYLLABLE QHWE;Lo;0;L;;;;;N;;;;;
+1260;ETHIOPIC SYLLABLE BA;Lo;0;L;;;;;N;;;;;
+1261;ETHIOPIC SYLLABLE BU;Lo;0;L;;;;;N;;;;;
+1262;ETHIOPIC SYLLABLE BI;Lo;0;L;;;;;N;;;;;
+1263;ETHIOPIC SYLLABLE BAA;Lo;0;L;;;;;N;;;;;
+1264;ETHIOPIC SYLLABLE BEE;Lo;0;L;;;;;N;;;;;
+1265;ETHIOPIC SYLLABLE BE;Lo;0;L;;;;;N;;;;;
+1266;ETHIOPIC SYLLABLE BO;Lo;0;L;;;;;N;;;;;
+1267;ETHIOPIC SYLLABLE BWA;Lo;0;L;;;;;N;;;;;
+1268;ETHIOPIC SYLLABLE VA;Lo;0;L;;;;;N;;;;;
+1269;ETHIOPIC SYLLABLE VU;Lo;0;L;;;;;N;;;;;
+126A;ETHIOPIC SYLLABLE VI;Lo;0;L;;;;;N;;;;;
+126B;ETHIOPIC SYLLABLE VAA;Lo;0;L;;;;;N;;;;;
+126C;ETHIOPIC SYLLABLE VEE;Lo;0;L;;;;;N;;;;;
+126D;ETHIOPIC SYLLABLE VE;Lo;0;L;;;;;N;;;;;
+126E;ETHIOPIC SYLLABLE VO;Lo;0;L;;;;;N;;;;;
+126F;ETHIOPIC SYLLABLE VWA;Lo;0;L;;;;;N;;;;;
+1270;ETHIOPIC SYLLABLE TA;Lo;0;L;;;;;N;;;;;
+1271;ETHIOPIC SYLLABLE TU;Lo;0;L;;;;;N;;;;;
+1272;ETHIOPIC SYLLABLE TI;Lo;0;L;;;;;N;;;;;
+1273;ETHIOPIC SYLLABLE TAA;Lo;0;L;;;;;N;;;;;
+1274;ETHIOPIC SYLLABLE TEE;Lo;0;L;;;;;N;;;;;
+1275;ETHIOPIC SYLLABLE TE;Lo;0;L;;;;;N;;;;;
+1276;ETHIOPIC SYLLABLE TO;Lo;0;L;;;;;N;;;;;
+1277;ETHIOPIC SYLLABLE TWA;Lo;0;L;;;;;N;;;;;
+1278;ETHIOPIC SYLLABLE CA;Lo;0;L;;;;;N;;;;;
+1279;ETHIOPIC SYLLABLE CU;Lo;0;L;;;;;N;;;;;
+127A;ETHIOPIC SYLLABLE CI;Lo;0;L;;;;;N;;;;;
+127B;ETHIOPIC SYLLABLE CAA;Lo;0;L;;;;;N;;;;;
+127C;ETHIOPIC SYLLABLE CEE;Lo;0;L;;;;;N;;;;;
+127D;ETHIOPIC SYLLABLE CE;Lo;0;L;;;;;N;;;;;
+127E;ETHIOPIC SYLLABLE CO;Lo;0;L;;;;;N;;;;;
+127F;ETHIOPIC SYLLABLE CWA;Lo;0;L;;;;;N;;;;;
+1280;ETHIOPIC SYLLABLE XA;Lo;0;L;;;;;N;;;;;
+1281;ETHIOPIC SYLLABLE XU;Lo;0;L;;;;;N;;;;;
+1282;ETHIOPIC SYLLABLE XI;Lo;0;L;;;;;N;;;;;
+1283;ETHIOPIC SYLLABLE XAA;Lo;0;L;;;;;N;;;;;
+1284;ETHIOPIC SYLLABLE XEE;Lo;0;L;;;;;N;;;;;
+1285;ETHIOPIC SYLLABLE XE;Lo;0;L;;;;;N;;;;;
+1286;ETHIOPIC SYLLABLE XO;Lo;0;L;;;;;N;;;;;
+1287;ETHIOPIC SYLLABLE XOA;Lo;0;L;;;;;N;;;;;
+1288;ETHIOPIC SYLLABLE XWA;Lo;0;L;;;;;N;;;;;
+128A;ETHIOPIC SYLLABLE XWI;Lo;0;L;;;;;N;;;;;
+128B;ETHIOPIC SYLLABLE XWAA;Lo;0;L;;;;;N;;;;;
+128C;ETHIOPIC SYLLABLE XWEE;Lo;0;L;;;;;N;;;;;
+128D;ETHIOPIC SYLLABLE XWE;Lo;0;L;;;;;N;;;;;
+1290;ETHIOPIC SYLLABLE NA;Lo;0;L;;;;;N;;;;;
+1291;ETHIOPIC SYLLABLE NU;Lo;0;L;;;;;N;;;;;
+1292;ETHIOPIC SYLLABLE NI;Lo;0;L;;;;;N;;;;;
+1293;ETHIOPIC SYLLABLE NAA;Lo;0;L;;;;;N;;;;;
+1294;ETHIOPIC SYLLABLE NEE;Lo;0;L;;;;;N;;;;;
+1295;ETHIOPIC SYLLABLE NE;Lo;0;L;;;;;N;;;;;
+1296;ETHIOPIC SYLLABLE NO;Lo;0;L;;;;;N;;;;;
+1297;ETHIOPIC SYLLABLE NWA;Lo;0;L;;;;;N;;;;;
+1298;ETHIOPIC SYLLABLE NYA;Lo;0;L;;;;;N;;;;;
+1299;ETHIOPIC SYLLABLE NYU;Lo;0;L;;;;;N;;;;;
+129A;ETHIOPIC SYLLABLE NYI;Lo;0;L;;;;;N;;;;;
+129B;ETHIOPIC SYLLABLE NYAA;Lo;0;L;;;;;N;;;;;
+129C;ETHIOPIC SYLLABLE NYEE;Lo;0;L;;;;;N;;;;;
+129D;ETHIOPIC SYLLABLE NYE;Lo;0;L;;;;;N;;;;;
+129E;ETHIOPIC SYLLABLE NYO;Lo;0;L;;;;;N;;;;;
+129F;ETHIOPIC SYLLABLE NYWA;Lo;0;L;;;;;N;;;;;
+12A0;ETHIOPIC SYLLABLE GLOTTAL A;Lo;0;L;;;;;N;;;;;
+12A1;ETHIOPIC SYLLABLE GLOTTAL U;Lo;0;L;;;;;N;;;;;
+12A2;ETHIOPIC SYLLABLE GLOTTAL I;Lo;0;L;;;;;N;;;;;
+12A3;ETHIOPIC SYLLABLE GLOTTAL AA;Lo;0;L;;;;;N;;;;;
+12A4;ETHIOPIC SYLLABLE GLOTTAL EE;Lo;0;L;;;;;N;;;;;
+12A5;ETHIOPIC SYLLABLE GLOTTAL E;Lo;0;L;;;;;N;;;;;
+12A6;ETHIOPIC SYLLABLE GLOTTAL O;Lo;0;L;;;;;N;;;;;
+12A7;ETHIOPIC SYLLABLE GLOTTAL WA;Lo;0;L;;;;;N;;;;;
+12A8;ETHIOPIC SYLLABLE KA;Lo;0;L;;;;;N;;;;;
+12A9;ETHIOPIC SYLLABLE KU;Lo;0;L;;;;;N;;;;;
+12AA;ETHIOPIC SYLLABLE KI;Lo;0;L;;;;;N;;;;;
+12AB;ETHIOPIC SYLLABLE KAA;Lo;0;L;;;;;N;;;;;
+12AC;ETHIOPIC SYLLABLE KEE;Lo;0;L;;;;;N;;;;;
+12AD;ETHIOPIC SYLLABLE KE;Lo;0;L;;;;;N;;;;;
+12AE;ETHIOPIC SYLLABLE KO;Lo;0;L;;;;;N;;;;;
+12AF;ETHIOPIC SYLLABLE KOA;Lo;0;L;;;;;N;;;;;
+12B0;ETHIOPIC SYLLABLE KWA;Lo;0;L;;;;;N;;;;;
+12B2;ETHIOPIC SYLLABLE KWI;Lo;0;L;;;;;N;;;;;
+12B3;ETHIOPIC SYLLABLE KWAA;Lo;0;L;;;;;N;;;;;
+12B4;ETHIOPIC SYLLABLE KWEE;Lo;0;L;;;;;N;;;;;
+12B5;ETHIOPIC SYLLABLE KWE;Lo;0;L;;;;;N;;;;;
+12B8;ETHIOPIC SYLLABLE KXA;Lo;0;L;;;;;N;;;;;
+12B9;ETHIOPIC SYLLABLE KXU;Lo;0;L;;;;;N;;;;;
+12BA;ETHIOPIC SYLLABLE KXI;Lo;0;L;;;;;N;;;;;
+12BB;ETHIOPIC SYLLABLE KXAA;Lo;0;L;;;;;N;;;;;
+12BC;ETHIOPIC SYLLABLE KXEE;Lo;0;L;;;;;N;;;;;
+12BD;ETHIOPIC SYLLABLE KXE;Lo;0;L;;;;;N;;;;;
+12BE;ETHIOPIC SYLLABLE KXO;Lo;0;L;;;;;N;;;;;
+12C0;ETHIOPIC SYLLABLE KXWA;Lo;0;L;;;;;N;;;;;
+12C2;ETHIOPIC SYLLABLE KXWI;Lo;0;L;;;;;N;;;;;
+12C3;ETHIOPIC SYLLABLE KXWAA;Lo;0;L;;;;;N;;;;;
+12C4;ETHIOPIC SYLLABLE KXWEE;Lo;0;L;;;;;N;;;;;
+12C5;ETHIOPIC SYLLABLE KXWE;Lo;0;L;;;;;N;;;;;
+12C8;ETHIOPIC SYLLABLE WA;Lo;0;L;;;;;N;;;;;
+12C9;ETHIOPIC SYLLABLE WU;Lo;0;L;;;;;N;;;;;
+12CA;ETHIOPIC SYLLABLE WI;Lo;0;L;;;;;N;;;;;
+12CB;ETHIOPIC SYLLABLE WAA;Lo;0;L;;;;;N;;;;;
+12CC;ETHIOPIC SYLLABLE WEE;Lo;0;L;;;;;N;;;;;
+12CD;ETHIOPIC SYLLABLE WE;Lo;0;L;;;;;N;;;;;
+12CE;ETHIOPIC SYLLABLE WO;Lo;0;L;;;;;N;;;;;
+12CF;ETHIOPIC SYLLABLE WOA;Lo;0;L;;;;;N;;;;;
+12D0;ETHIOPIC SYLLABLE PHARYNGEAL A;Lo;0;L;;;;;N;;;;;
+12D1;ETHIOPIC SYLLABLE PHARYNGEAL U;Lo;0;L;;;;;N;;;;;
+12D2;ETHIOPIC SYLLABLE PHARYNGEAL I;Lo;0;L;;;;;N;;;;;
+12D3;ETHIOPIC SYLLABLE PHARYNGEAL AA;Lo;0;L;;;;;N;;;;;
+12D4;ETHIOPIC SYLLABLE PHARYNGEAL EE;Lo;0;L;;;;;N;;;;;
+12D5;ETHIOPIC SYLLABLE PHARYNGEAL E;Lo;0;L;;;;;N;;;;;
+12D6;ETHIOPIC SYLLABLE PHARYNGEAL O;Lo;0;L;;;;;N;;;;;
+12D8;ETHIOPIC SYLLABLE ZA;Lo;0;L;;;;;N;;;;;
+12D9;ETHIOPIC SYLLABLE ZU;Lo;0;L;;;;;N;;;;;
+12DA;ETHIOPIC SYLLABLE ZI;Lo;0;L;;;;;N;;;;;
+12DB;ETHIOPIC SYLLABLE ZAA;Lo;0;L;;;;;N;;;;;
+12DC;ETHIOPIC SYLLABLE ZEE;Lo;0;L;;;;;N;;;;;
+12DD;ETHIOPIC SYLLABLE ZE;Lo;0;L;;;;;N;;;;;
+12DE;ETHIOPIC SYLLABLE ZO;Lo;0;L;;;;;N;;;;;
+12DF;ETHIOPIC SYLLABLE ZWA;Lo;0;L;;;;;N;;;;;
+12E0;ETHIOPIC SYLLABLE ZHA;Lo;0;L;;;;;N;;;;;
+12E1;ETHIOPIC SYLLABLE ZHU;Lo;0;L;;;;;N;;;;;
+12E2;ETHIOPIC SYLLABLE ZHI;Lo;0;L;;;;;N;;;;;
+12E3;ETHIOPIC SYLLABLE ZHAA;Lo;0;L;;;;;N;;;;;
+12E4;ETHIOPIC SYLLABLE ZHEE;Lo;0;L;;;;;N;;;;;
+12E5;ETHIOPIC SYLLABLE ZHE;Lo;0;L;;;;;N;;;;;
+12E6;ETHIOPIC SYLLABLE ZHO;Lo;0;L;;;;;N;;;;;
+12E7;ETHIOPIC SYLLABLE ZHWA;Lo;0;L;;;;;N;;;;;
+12E8;ETHIOPIC SYLLABLE YA;Lo;0;L;;;;;N;;;;;
+12E9;ETHIOPIC SYLLABLE YU;Lo;0;L;;;;;N;;;;;
+12EA;ETHIOPIC SYLLABLE YI;Lo;0;L;;;;;N;;;;;
+12EB;ETHIOPIC SYLLABLE YAA;Lo;0;L;;;;;N;;;;;
+12EC;ETHIOPIC SYLLABLE YEE;Lo;0;L;;;;;N;;;;;
+12ED;ETHIOPIC SYLLABLE YE;Lo;0;L;;;;;N;;;;;
+12EE;ETHIOPIC SYLLABLE YO;Lo;0;L;;;;;N;;;;;
+12EF;ETHIOPIC SYLLABLE YOA;Lo;0;L;;;;;N;;;;;
+12F0;ETHIOPIC SYLLABLE DA;Lo;0;L;;;;;N;;;;;
+12F1;ETHIOPIC SYLLABLE DU;Lo;0;L;;;;;N;;;;;
+12F2;ETHIOPIC SYLLABLE DI;Lo;0;L;;;;;N;;;;;
+12F3;ETHIOPIC SYLLABLE DAA;Lo;0;L;;;;;N;;;;;
+12F4;ETHIOPIC SYLLABLE DEE;Lo;0;L;;;;;N;;;;;
+12F5;ETHIOPIC SYLLABLE DE;Lo;0;L;;;;;N;;;;;
+12F6;ETHIOPIC SYLLABLE DO;Lo;0;L;;;;;N;;;;;
+12F7;ETHIOPIC SYLLABLE DWA;Lo;0;L;;;;;N;;;;;
+12F8;ETHIOPIC SYLLABLE DDA;Lo;0;L;;;;;N;;;;;
+12F9;ETHIOPIC SYLLABLE DDU;Lo;0;L;;;;;N;;;;;
+12FA;ETHIOPIC SYLLABLE DDI;Lo;0;L;;;;;N;;;;;
+12FB;ETHIOPIC SYLLABLE DDAA;Lo;0;L;;;;;N;;;;;
+12FC;ETHIOPIC SYLLABLE DDEE;Lo;0;L;;;;;N;;;;;
+12FD;ETHIOPIC SYLLABLE DDE;Lo;0;L;;;;;N;;;;;
+12FE;ETHIOPIC SYLLABLE DDO;Lo;0;L;;;;;N;;;;;
+12FF;ETHIOPIC SYLLABLE DDWA;Lo;0;L;;;;;N;;;;;
+1300;ETHIOPIC SYLLABLE JA;Lo;0;L;;;;;N;;;;;
+1301;ETHIOPIC SYLLABLE JU;Lo;0;L;;;;;N;;;;;
+1302;ETHIOPIC SYLLABLE JI;Lo;0;L;;;;;N;;;;;
+1303;ETHIOPIC SYLLABLE JAA;Lo;0;L;;;;;N;;;;;
+1304;ETHIOPIC SYLLABLE JEE;Lo;0;L;;;;;N;;;;;
+1305;ETHIOPIC SYLLABLE JE;Lo;0;L;;;;;N;;;;;
+1306;ETHIOPIC SYLLABLE JO;Lo;0;L;;;;;N;;;;;
+1307;ETHIOPIC SYLLABLE JWA;Lo;0;L;;;;;N;;;;;
+1308;ETHIOPIC SYLLABLE GA;Lo;0;L;;;;;N;;;;;
+1309;ETHIOPIC SYLLABLE GU;Lo;0;L;;;;;N;;;;;
+130A;ETHIOPIC SYLLABLE GI;Lo;0;L;;;;;N;;;;;
+130B;ETHIOPIC SYLLABLE GAA;Lo;0;L;;;;;N;;;;;
+130C;ETHIOPIC SYLLABLE GEE;Lo;0;L;;;;;N;;;;;
+130D;ETHIOPIC SYLLABLE GE;Lo;0;L;;;;;N;;;;;
+130E;ETHIOPIC SYLLABLE GO;Lo;0;L;;;;;N;;;;;
+130F;ETHIOPIC SYLLABLE GOA;Lo;0;L;;;;;N;;;;;
+1310;ETHIOPIC SYLLABLE GWA;Lo;0;L;;;;;N;;;;;
+1312;ETHIOPIC SYLLABLE GWI;Lo;0;L;;;;;N;;;;;
+1313;ETHIOPIC SYLLABLE GWAA;Lo;0;L;;;;;N;;;;;
+1314;ETHIOPIC SYLLABLE GWEE;Lo;0;L;;;;;N;;;;;
+1315;ETHIOPIC SYLLABLE GWE;Lo;0;L;;;;;N;;;;;
+1318;ETHIOPIC SYLLABLE GGA;Lo;0;L;;;;;N;;;;;
+1319;ETHIOPIC SYLLABLE GGU;Lo;0;L;;;;;N;;;;;
+131A;ETHIOPIC SYLLABLE GGI;Lo;0;L;;;;;N;;;;;
+131B;ETHIOPIC SYLLABLE GGAA;Lo;0;L;;;;;N;;;;;
+131C;ETHIOPIC SYLLABLE GGEE;Lo;0;L;;;;;N;;;;;
+131D;ETHIOPIC SYLLABLE GGE;Lo;0;L;;;;;N;;;;;
+131E;ETHIOPIC SYLLABLE GGO;Lo;0;L;;;;;N;;;;;
+131F;ETHIOPIC SYLLABLE GGWAA;Lo;0;L;;;;;N;;;;;
+1320;ETHIOPIC SYLLABLE THA;Lo;0;L;;;;;N;;;;;
+1321;ETHIOPIC SYLLABLE THU;Lo;0;L;;;;;N;;;;;
+1322;ETHIOPIC SYLLABLE THI;Lo;0;L;;;;;N;;;;;
+1323;ETHIOPIC SYLLABLE THAA;Lo;0;L;;;;;N;;;;;
+1324;ETHIOPIC SYLLABLE THEE;Lo;0;L;;;;;N;;;;;
+1325;ETHIOPIC SYLLABLE THE;Lo;0;L;;;;;N;;;;;
+1326;ETHIOPIC SYLLABLE THO;Lo;0;L;;;;;N;;;;;
+1327;ETHIOPIC SYLLABLE THWA;Lo;0;L;;;;;N;;;;;
+1328;ETHIOPIC SYLLABLE CHA;Lo;0;L;;;;;N;;;;;
+1329;ETHIOPIC SYLLABLE CHU;Lo;0;L;;;;;N;;;;;
+132A;ETHIOPIC SYLLABLE CHI;Lo;0;L;;;;;N;;;;;
+132B;ETHIOPIC SYLLABLE CHAA;Lo;0;L;;;;;N;;;;;
+132C;ETHIOPIC SYLLABLE CHEE;Lo;0;L;;;;;N;;;;;
+132D;ETHIOPIC SYLLABLE CHE;Lo;0;L;;;;;N;;;;;
+132E;ETHIOPIC SYLLABLE CHO;Lo;0;L;;;;;N;;;;;
+132F;ETHIOPIC SYLLABLE CHWA;Lo;0;L;;;;;N;;;;;
+1330;ETHIOPIC SYLLABLE PHA;Lo;0;L;;;;;N;;;;;
+1331;ETHIOPIC SYLLABLE PHU;Lo;0;L;;;;;N;;;;;
+1332;ETHIOPIC SYLLABLE PHI;Lo;0;L;;;;;N;;;;;
+1333;ETHIOPIC SYLLABLE PHAA;Lo;0;L;;;;;N;;;;;
+1334;ETHIOPIC SYLLABLE PHEE;Lo;0;L;;;;;N;;;;;
+1335;ETHIOPIC SYLLABLE PHE;Lo;0;L;;;;;N;;;;;
+1336;ETHIOPIC SYLLABLE PHO;Lo;0;L;;;;;N;;;;;
+1337;ETHIOPIC SYLLABLE PHWA;Lo;0;L;;;;;N;;;;;
+1338;ETHIOPIC SYLLABLE TSA;Lo;0;L;;;;;N;;;;;
+1339;ETHIOPIC SYLLABLE TSU;Lo;0;L;;;;;N;;;;;
+133A;ETHIOPIC SYLLABLE TSI;Lo;0;L;;;;;N;;;;;
+133B;ETHIOPIC SYLLABLE TSAA;Lo;0;L;;;;;N;;;;;
+133C;ETHIOPIC SYLLABLE TSEE;Lo;0;L;;;;;N;;;;;
+133D;ETHIOPIC SYLLABLE TSE;Lo;0;L;;;;;N;;;;;
+133E;ETHIOPIC SYLLABLE TSO;Lo;0;L;;;;;N;;;;;
+133F;ETHIOPIC SYLLABLE TSWA;Lo;0;L;;;;;N;;;;;
+1340;ETHIOPIC SYLLABLE TZA;Lo;0;L;;;;;N;;;;;
+1341;ETHIOPIC SYLLABLE TZU;Lo;0;L;;;;;N;;;;;
+1342;ETHIOPIC SYLLABLE TZI;Lo;0;L;;;;;N;;;;;
+1343;ETHIOPIC SYLLABLE TZAA;Lo;0;L;;;;;N;;;;;
+1344;ETHIOPIC SYLLABLE TZEE;Lo;0;L;;;;;N;;;;;
+1345;ETHIOPIC SYLLABLE TZE;Lo;0;L;;;;;N;;;;;
+1346;ETHIOPIC SYLLABLE TZO;Lo;0;L;;;;;N;;;;;
+1347;ETHIOPIC SYLLABLE TZOA;Lo;0;L;;;;;N;;;;;
+1348;ETHIOPIC SYLLABLE FA;Lo;0;L;;;;;N;;;;;
+1349;ETHIOPIC SYLLABLE FU;Lo;0;L;;;;;N;;;;;
+134A;ETHIOPIC SYLLABLE FI;Lo;0;L;;;;;N;;;;;
+134B;ETHIOPIC SYLLABLE FAA;Lo;0;L;;;;;N;;;;;
+134C;ETHIOPIC SYLLABLE FEE;Lo;0;L;;;;;N;;;;;
+134D;ETHIOPIC SYLLABLE FE;Lo;0;L;;;;;N;;;;;
+134E;ETHIOPIC SYLLABLE FO;Lo;0;L;;;;;N;;;;;
+134F;ETHIOPIC SYLLABLE FWA;Lo;0;L;;;;;N;;;;;
+1350;ETHIOPIC SYLLABLE PA;Lo;0;L;;;;;N;;;;;
+1351;ETHIOPIC SYLLABLE PU;Lo;0;L;;;;;N;;;;;
+1352;ETHIOPIC SYLLABLE PI;Lo;0;L;;;;;N;;;;;
+1353;ETHIOPIC SYLLABLE PAA;Lo;0;L;;;;;N;;;;;
+1354;ETHIOPIC SYLLABLE PEE;Lo;0;L;;;;;N;;;;;
+1355;ETHIOPIC SYLLABLE PE;Lo;0;L;;;;;N;;;;;
+1356;ETHIOPIC SYLLABLE PO;Lo;0;L;;;;;N;;;;;
+1357;ETHIOPIC SYLLABLE PWA;Lo;0;L;;;;;N;;;;;
+1358;ETHIOPIC SYLLABLE RYA;Lo;0;L;;;;;N;;;;;
+1359;ETHIOPIC SYLLABLE MYA;Lo;0;L;;;;;N;;;;;
+135A;ETHIOPIC SYLLABLE FYA;Lo;0;L;;;;;N;;;;;
+135D;ETHIOPIC COMBINING GEMINATION AND VOWEL LENGTH MARK;Mn;230;NSM;;;;;N;;;;;
+135E;ETHIOPIC COMBINING VOWEL LENGTH MARK;Mn;230;NSM;;;;;N;;;;;
+135F;ETHIOPIC COMBINING GEMINATION MARK;Mn;230;NSM;;;;;N;;;;;
+1360;ETHIOPIC SECTION MARK;Po;0;L;;;;;N;;;;;
+1361;ETHIOPIC WORDSPACE;Po;0;L;;;;;N;;;;;
+1362;ETHIOPIC FULL STOP;Po;0;L;;;;;N;;;;;
+1363;ETHIOPIC COMMA;Po;0;L;;;;;N;;;;;
+1364;ETHIOPIC SEMICOLON;Po;0;L;;;;;N;;;;;
+1365;ETHIOPIC COLON;Po;0;L;;;;;N;;;;;
+1366;ETHIOPIC PREFACE COLON;Po;0;L;;;;;N;;;;;
+1367;ETHIOPIC QUESTION MARK;Po;0;L;;;;;N;;;;;
+1368;ETHIOPIC PARAGRAPH SEPARATOR;Po;0;L;;;;;N;;;;;
+1369;ETHIOPIC DIGIT ONE;No;0;L;;;1;1;N;;;;;
+136A;ETHIOPIC DIGIT TWO;No;0;L;;;2;2;N;;;;;
+136B;ETHIOPIC DIGIT THREE;No;0;L;;;3;3;N;;;;;
+136C;ETHIOPIC DIGIT FOUR;No;0;L;;;4;4;N;;;;;
+136D;ETHIOPIC DIGIT FIVE;No;0;L;;;5;5;N;;;;;
+136E;ETHIOPIC DIGIT SIX;No;0;L;;;6;6;N;;;;;
+136F;ETHIOPIC DIGIT SEVEN;No;0;L;;;7;7;N;;;;;
+1370;ETHIOPIC DIGIT EIGHT;No;0;L;;;8;8;N;;;;;
+1371;ETHIOPIC DIGIT NINE;No;0;L;;;9;9;N;;;;;
+1372;ETHIOPIC NUMBER TEN;No;0;L;;;;10;N;;;;;
+1373;ETHIOPIC NUMBER TWENTY;No;0;L;;;;20;N;;;;;
+1374;ETHIOPIC NUMBER THIRTY;No;0;L;;;;30;N;;;;;
+1375;ETHIOPIC NUMBER FORTY;No;0;L;;;;40;N;;;;;
+1376;ETHIOPIC NUMBER FIFTY;No;0;L;;;;50;N;;;;;
+1377;ETHIOPIC NUMBER SIXTY;No;0;L;;;;60;N;;;;;
+1378;ETHIOPIC NUMBER SEVENTY;No;0;L;;;;70;N;;;;;
+1379;ETHIOPIC NUMBER EIGHTY;No;0;L;;;;80;N;;;;;
+137A;ETHIOPIC NUMBER NINETY;No;0;L;;;;90;N;;;;;
+137B;ETHIOPIC NUMBER HUNDRED;No;0;L;;;;100;N;;;;;
+137C;ETHIOPIC NUMBER TEN THOUSAND;No;0;L;;;;10000;N;;;;;
+1380;ETHIOPIC SYLLABLE SEBATBEIT MWA;Lo;0;L;;;;;N;;;;;
+1381;ETHIOPIC SYLLABLE MWI;Lo;0;L;;;;;N;;;;;
+1382;ETHIOPIC SYLLABLE MWEE;Lo;0;L;;;;;N;;;;;
+1383;ETHIOPIC SYLLABLE MWE;Lo;0;L;;;;;N;;;;;
+1384;ETHIOPIC SYLLABLE SEBATBEIT BWA;Lo;0;L;;;;;N;;;;;
+1385;ETHIOPIC SYLLABLE BWI;Lo;0;L;;;;;N;;;;;
+1386;ETHIOPIC SYLLABLE BWEE;Lo;0;L;;;;;N;;;;;
+1387;ETHIOPIC SYLLABLE BWE;Lo;0;L;;;;;N;;;;;
+1388;ETHIOPIC SYLLABLE SEBATBEIT FWA;Lo;0;L;;;;;N;;;;;
+1389;ETHIOPIC SYLLABLE FWI;Lo;0;L;;;;;N;;;;;
+138A;ETHIOPIC SYLLABLE FWEE;Lo;0;L;;;;;N;;;;;
+138B;ETHIOPIC SYLLABLE FWE;Lo;0;L;;;;;N;;;;;
+138C;ETHIOPIC SYLLABLE SEBATBEIT PWA;Lo;0;L;;;;;N;;;;;
+138D;ETHIOPIC SYLLABLE PWI;Lo;0;L;;;;;N;;;;;
+138E;ETHIOPIC SYLLABLE PWEE;Lo;0;L;;;;;N;;;;;
+138F;ETHIOPIC SYLLABLE PWE;Lo;0;L;;;;;N;;;;;
+1390;ETHIOPIC TONAL MARK YIZET;So;0;ON;;;;;N;;;;;
+1391;ETHIOPIC TONAL MARK DERET;So;0;ON;;;;;N;;;;;
+1392;ETHIOPIC TONAL MARK RIKRIK;So;0;ON;;;;;N;;;;;
+1393;ETHIOPIC TONAL MARK SHORT RIKRIK;So;0;ON;;;;;N;;;;;
+1394;ETHIOPIC TONAL MARK DIFAT;So;0;ON;;;;;N;;;;;
+1395;ETHIOPIC TONAL MARK KENAT;So;0;ON;;;;;N;;;;;
+1396;ETHIOPIC TONAL MARK CHIRET;So;0;ON;;;;;N;;;;;
+1397;ETHIOPIC TONAL MARK HIDET;So;0;ON;;;;;N;;;;;
+1398;ETHIOPIC TONAL MARK DERET-HIDET;So;0;ON;;;;;N;;;;;
+1399;ETHIOPIC TONAL MARK KURT;So;0;ON;;;;;N;;;;;
+13A0;CHEROKEE LETTER A;Lu;0;L;;;;;N;;;;AB70;
+13A1;CHEROKEE LETTER E;Lu;0;L;;;;;N;;;;AB71;
+13A2;CHEROKEE LETTER I;Lu;0;L;;;;;N;;;;AB72;
+13A3;CHEROKEE LETTER O;Lu;0;L;;;;;N;;;;AB73;
+13A4;CHEROKEE LETTER U;Lu;0;L;;;;;N;;;;AB74;
+13A5;CHEROKEE LETTER V;Lu;0;L;;;;;N;;;;AB75;
+13A6;CHEROKEE LETTER GA;Lu;0;L;;;;;N;;;;AB76;
+13A7;CHEROKEE LETTER KA;Lu;0;L;;;;;N;;;;AB77;
+13A8;CHEROKEE LETTER GE;Lu;0;L;;;;;N;;;;AB78;
+13A9;CHEROKEE LETTER GI;Lu;0;L;;;;;N;;;;AB79;
+13AA;CHEROKEE LETTER GO;Lu;0;L;;;;;N;;;;AB7A;
+13AB;CHEROKEE LETTER GU;Lu;0;L;;;;;N;;;;AB7B;
+13AC;CHEROKEE LETTER GV;Lu;0;L;;;;;N;;;;AB7C;
+13AD;CHEROKEE LETTER HA;Lu;0;L;;;;;N;;;;AB7D;
+13AE;CHEROKEE LETTER HE;Lu;0;L;;;;;N;;;;AB7E;
+13AF;CHEROKEE LETTER HI;Lu;0;L;;;;;N;;;;AB7F;
+13B0;CHEROKEE LETTER HO;Lu;0;L;;;;;N;;;;AB80;
+13B1;CHEROKEE LETTER HU;Lu;0;L;;;;;N;;;;AB81;
+13B2;CHEROKEE LETTER HV;Lu;0;L;;;;;N;;;;AB82;
+13B3;CHEROKEE LETTER LA;Lu;0;L;;;;;N;;;;AB83;
+13B4;CHEROKEE LETTER LE;Lu;0;L;;;;;N;;;;AB84;
+13B5;CHEROKEE LETTER LI;Lu;0;L;;;;;N;;;;AB85;
+13B6;CHEROKEE LETTER LO;Lu;0;L;;;;;N;;;;AB86;
+13B7;CHEROKEE LETTER LU;Lu;0;L;;;;;N;;;;AB87;
+13B8;CHEROKEE LETTER LV;Lu;0;L;;;;;N;;;;AB88;
+13B9;CHEROKEE LETTER MA;Lu;0;L;;;;;N;;;;AB89;
+13BA;CHEROKEE LETTER ME;Lu;0;L;;;;;N;;;;AB8A;
+13BB;CHEROKEE LETTER MI;Lu;0;L;;;;;N;;;;AB8B;
+13BC;CHEROKEE LETTER MO;Lu;0;L;;;;;N;;;;AB8C;
+13BD;CHEROKEE LETTER MU;Lu;0;L;;;;;N;;;;AB8D;
+13BE;CHEROKEE LETTER NA;Lu;0;L;;;;;N;;;;AB8E;
+13BF;CHEROKEE LETTER HNA;Lu;0;L;;;;;N;;;;AB8F;
+13C0;CHEROKEE LETTER NAH;Lu;0;L;;;;;N;;;;AB90;
+13C1;CHEROKEE LETTER NE;Lu;0;L;;;;;N;;;;AB91;
+13C2;CHEROKEE LETTER NI;Lu;0;L;;;;;N;;;;AB92;
+13C3;CHEROKEE LETTER NO;Lu;0;L;;;;;N;;;;AB93;
+13C4;CHEROKEE LETTER NU;Lu;0;L;;;;;N;;;;AB94;
+13C5;CHEROKEE LETTER NV;Lu;0;L;;;;;N;;;;AB95;
+13C6;CHEROKEE LETTER QUA;Lu;0;L;;;;;N;;;;AB96;
+13C7;CHEROKEE LETTER QUE;Lu;0;L;;;;;N;;;;AB97;
+13C8;CHEROKEE LETTER QUI;Lu;0;L;;;;;N;;;;AB98;
+13C9;CHEROKEE LETTER QUO;Lu;0;L;;;;;N;;;;AB99;
+13CA;CHEROKEE LETTER QUU;Lu;0;L;;;;;N;;;;AB9A;
+13CB;CHEROKEE LETTER QUV;Lu;0;L;;;;;N;;;;AB9B;
+13CC;CHEROKEE LETTER SA;Lu;0;L;;;;;N;;;;AB9C;
+13CD;CHEROKEE LETTER S;Lu;0;L;;;;;N;;;;AB9D;
+13CE;CHEROKEE LETTER SE;Lu;0;L;;;;;N;;;;AB9E;
+13CF;CHEROKEE LETTER SI;Lu;0;L;;;;;N;;;;AB9F;
+13D0;CHEROKEE LETTER SO;Lu;0;L;;;;;N;;;;ABA0;
+13D1;CHEROKEE LETTER SU;Lu;0;L;;;;;N;;;;ABA1;
+13D2;CHEROKEE LETTER SV;Lu;0;L;;;;;N;;;;ABA2;
+13D3;CHEROKEE LETTER DA;Lu;0;L;;;;;N;;;;ABA3;
+13D4;CHEROKEE LETTER TA;Lu;0;L;;;;;N;;;;ABA4;
+13D5;CHEROKEE LETTER DE;Lu;0;L;;;;;N;;;;ABA5;
+13D6;CHEROKEE LETTER TE;Lu;0;L;;;;;N;;;;ABA6;
+13D7;CHEROKEE LETTER DI;Lu;0;L;;;;;N;;;;ABA7;
+13D8;CHEROKEE LETTER TI;Lu;0;L;;;;;N;;;;ABA8;
+13D9;CHEROKEE LETTER DO;Lu;0;L;;;;;N;;;;ABA9;
+13DA;CHEROKEE LETTER DU;Lu;0;L;;;;;N;;;;ABAA;
+13DB;CHEROKEE LETTER DV;Lu;0;L;;;;;N;;;;ABAB;
+13DC;CHEROKEE LETTER DLA;Lu;0;L;;;;;N;;;;ABAC;
+13DD;CHEROKEE LETTER TLA;Lu;0;L;;;;;N;;;;ABAD;
+13DE;CHEROKEE LETTER TLE;Lu;0;L;;;;;N;;;;ABAE;
+13DF;CHEROKEE LETTER TLI;Lu;0;L;;;;;N;;;;ABAF;
+13E0;CHEROKEE LETTER TLO;Lu;0;L;;;;;N;;;;ABB0;
+13E1;CHEROKEE LETTER TLU;Lu;0;L;;;;;N;;;;ABB1;
+13E2;CHEROKEE LETTER TLV;Lu;0;L;;;;;N;;;;ABB2;
+13E3;CHEROKEE LETTER TSA;Lu;0;L;;;;;N;;;;ABB3;
+13E4;CHEROKEE LETTER TSE;Lu;0;L;;;;;N;;;;ABB4;
+13E5;CHEROKEE LETTER TSI;Lu;0;L;;;;;N;;;;ABB5;
+13E6;CHEROKEE LETTER TSO;Lu;0;L;;;;;N;;;;ABB6;
+13E7;CHEROKEE LETTER TSU;Lu;0;L;;;;;N;;;;ABB7;
+13E8;CHEROKEE LETTER TSV;Lu;0;L;;;;;N;;;;ABB8;
+13E9;CHEROKEE LETTER WA;Lu;0;L;;;;;N;;;;ABB9;
+13EA;CHEROKEE LETTER WE;Lu;0;L;;;;;N;;;;ABBA;
+13EB;CHEROKEE LETTER WI;Lu;0;L;;;;;N;;;;ABBB;
+13EC;CHEROKEE LETTER WO;Lu;0;L;;;;;N;;;;ABBC;
+13ED;CHEROKEE LETTER WU;Lu;0;L;;;;;N;;;;ABBD;
+13EE;CHEROKEE LETTER WV;Lu;0;L;;;;;N;;;;ABBE;
+13EF;CHEROKEE LETTER YA;Lu;0;L;;;;;N;;;;ABBF;
+13F0;CHEROKEE LETTER YE;Lu;0;L;;;;;N;;;;13F8;
+13F1;CHEROKEE LETTER YI;Lu;0;L;;;;;N;;;;13F9;
+13F2;CHEROKEE LETTER YO;Lu;0;L;;;;;N;;;;13FA;
+13F3;CHEROKEE LETTER YU;Lu;0;L;;;;;N;;;;13FB;
+13F4;CHEROKEE LETTER YV;Lu;0;L;;;;;N;;;;13FC;
+13F5;CHEROKEE LETTER MV;Lu;0;L;;;;;N;;;;13FD;
+13F8;CHEROKEE SMALL LETTER YE;Ll;0;L;;;;;N;;;13F0;;13F0
+13F9;CHEROKEE SMALL LETTER YI;Ll;0;L;;;;;N;;;13F1;;13F1
+13FA;CHEROKEE SMALL LETTER YO;Ll;0;L;;;;;N;;;13F2;;13F2
+13FB;CHEROKEE SMALL LETTER YU;Ll;0;L;;;;;N;;;13F3;;13F3
+13FC;CHEROKEE SMALL LETTER YV;Ll;0;L;;;;;N;;;13F4;;13F4
+13FD;CHEROKEE SMALL LETTER MV;Ll;0;L;;;;;N;;;13F5;;13F5
+1400;CANADIAN SYLLABICS HYPHEN;Pd;0;ON;;;;;N;;;;;
+1401;CANADIAN SYLLABICS E;Lo;0;L;;;;;N;;;;;
+1402;CANADIAN SYLLABICS AAI;Lo;0;L;;;;;N;;;;;
+1403;CANADIAN SYLLABICS I;Lo;0;L;;;;;N;;;;;
+1404;CANADIAN SYLLABICS II;Lo;0;L;;;;;N;;;;;
+1405;CANADIAN SYLLABICS O;Lo;0;L;;;;;N;;;;;
+1406;CANADIAN SYLLABICS OO;Lo;0;L;;;;;N;;;;;
+1407;CANADIAN SYLLABICS Y-CREE OO;Lo;0;L;;;;;N;;;;;
+1408;CANADIAN SYLLABICS CARRIER EE;Lo;0;L;;;;;N;;;;;
+1409;CANADIAN SYLLABICS CARRIER I;Lo;0;L;;;;;N;;;;;
+140A;CANADIAN SYLLABICS A;Lo;0;L;;;;;N;;;;;
+140B;CANADIAN SYLLABICS AA;Lo;0;L;;;;;N;;;;;
+140C;CANADIAN SYLLABICS WE;Lo;0;L;;;;;N;;;;;
+140D;CANADIAN SYLLABICS WEST-CREE WE;Lo;0;L;;;;;N;;;;;
+140E;CANADIAN SYLLABICS WI;Lo;0;L;;;;;N;;;;;
+140F;CANADIAN SYLLABICS WEST-CREE WI;Lo;0;L;;;;;N;;;;;
+1410;CANADIAN SYLLABICS WII;Lo;0;L;;;;;N;;;;;
+1411;CANADIAN SYLLABICS WEST-CREE WII;Lo;0;L;;;;;N;;;;;
+1412;CANADIAN SYLLABICS WO;Lo;0;L;;;;;N;;;;;
+1413;CANADIAN SYLLABICS WEST-CREE WO;Lo;0;L;;;;;N;;;;;
+1414;CANADIAN SYLLABICS WOO;Lo;0;L;;;;;N;;;;;
+1415;CANADIAN SYLLABICS WEST-CREE WOO;Lo;0;L;;;;;N;;;;;
+1416;CANADIAN SYLLABICS NASKAPI WOO;Lo;0;L;;;;;N;;;;;
+1417;CANADIAN SYLLABICS WA;Lo;0;L;;;;;N;;;;;
+1418;CANADIAN SYLLABICS WEST-CREE WA;Lo;0;L;;;;;N;;;;;
+1419;CANADIAN SYLLABICS WAA;Lo;0;L;;;;;N;;;;;
+141A;CANADIAN SYLLABICS WEST-CREE WAA;Lo;0;L;;;;;N;;;;;
+141B;CANADIAN SYLLABICS NASKAPI WAA;Lo;0;L;;;;;N;;;;;
+141C;CANADIAN SYLLABICS AI;Lo;0;L;;;;;N;;;;;
+141D;CANADIAN SYLLABICS Y-CREE W;Lo;0;L;;;;;N;;;;;
+141E;CANADIAN SYLLABICS GLOTTAL STOP;Lo;0;L;;;;;N;;;;;
+141F;CANADIAN SYLLABICS FINAL ACUTE;Lo;0;L;;;;;N;;;;;
+1420;CANADIAN SYLLABICS FINAL GRAVE;Lo;0;L;;;;;N;;;;;
+1421;CANADIAN SYLLABICS FINAL BOTTOM HALF RING;Lo;0;L;;;;;N;;;;;
+1422;CANADIAN SYLLABICS FINAL TOP HALF RING;Lo;0;L;;;;;N;;;;;
+1423;CANADIAN SYLLABICS FINAL RIGHT HALF RING;Lo;0;L;;;;;N;;;;;
+1424;CANADIAN SYLLABICS FINAL RING;Lo;0;L;;;;;N;;;;;
+1425;CANADIAN SYLLABICS FINAL DOUBLE ACUTE;Lo;0;L;;;;;N;;;;;
+1426;CANADIAN SYLLABICS FINAL DOUBLE SHORT VERTICAL STROKES;Lo;0;L;;;;;N;;;;;
+1427;CANADIAN SYLLABICS FINAL MIDDLE DOT;Lo;0;L;;;;;N;;;;;
+1428;CANADIAN SYLLABICS FINAL SHORT HORIZONTAL STROKE;Lo;0;L;;;;;N;;;;;
+1429;CANADIAN SYLLABICS FINAL PLUS;Lo;0;L;;;;;N;;;;;
+142A;CANADIAN SYLLABICS FINAL DOWN TACK;Lo;0;L;;;;;N;;;;;
+142B;CANADIAN SYLLABICS EN;Lo;0;L;;;;;N;;;;;
+142C;CANADIAN SYLLABICS IN;Lo;0;L;;;;;N;;;;;
+142D;CANADIAN SYLLABICS ON;Lo;0;L;;;;;N;;;;;
+142E;CANADIAN SYLLABICS AN;Lo;0;L;;;;;N;;;;;
+142F;CANADIAN SYLLABICS PE;Lo;0;L;;;;;N;;;;;
+1430;CANADIAN SYLLABICS PAAI;Lo;0;L;;;;;N;;;;;
+1431;CANADIAN SYLLABICS PI;Lo;0;L;;;;;N;;;;;
+1432;CANADIAN SYLLABICS PII;Lo;0;L;;;;;N;;;;;
+1433;CANADIAN SYLLABICS PO;Lo;0;L;;;;;N;;;;;
+1434;CANADIAN SYLLABICS POO;Lo;0;L;;;;;N;;;;;
+1435;CANADIAN SYLLABICS Y-CREE POO;Lo;0;L;;;;;N;;;;;
+1436;CANADIAN SYLLABICS CARRIER HEE;Lo;0;L;;;;;N;;;;;
+1437;CANADIAN SYLLABICS CARRIER HI;Lo;0;L;;;;;N;;;;;
+1438;CANADIAN SYLLABICS PA;Lo;0;L;;;;;N;;;;;
+1439;CANADIAN SYLLABICS PAA;Lo;0;L;;;;;N;;;;;
+143A;CANADIAN SYLLABICS PWE;Lo;0;L;;;;;N;;;;;
+143B;CANADIAN SYLLABICS WEST-CREE PWE;Lo;0;L;;;;;N;;;;;
+143C;CANADIAN SYLLABICS PWI;Lo;0;L;;;;;N;;;;;
+143D;CANADIAN SYLLABICS WEST-CREE PWI;Lo;0;L;;;;;N;;;;;
+143E;CANADIAN SYLLABICS PWII;Lo;0;L;;;;;N;;;;;
+143F;CANADIAN SYLLABICS WEST-CREE PWII;Lo;0;L;;;;;N;;;;;
+1440;CANADIAN SYLLABICS PWO;Lo;0;L;;;;;N;;;;;
+1441;CANADIAN SYLLABICS WEST-CREE PWO;Lo;0;L;;;;;N;;;;;
+1442;CANADIAN SYLLABICS PWOO;Lo;0;L;;;;;N;;;;;
+1443;CANADIAN SYLLABICS WEST-CREE PWOO;Lo;0;L;;;;;N;;;;;
+1444;CANADIAN SYLLABICS PWA;Lo;0;L;;;;;N;;;;;
+1445;CANADIAN SYLLABICS WEST-CREE PWA;Lo;0;L;;;;;N;;;;;
+1446;CANADIAN SYLLABICS PWAA;Lo;0;L;;;;;N;;;;;
+1447;CANADIAN SYLLABICS WEST-CREE PWAA;Lo;0;L;;;;;N;;;;;
+1448;CANADIAN SYLLABICS Y-CREE PWAA;Lo;0;L;;;;;N;;;;;
+1449;CANADIAN SYLLABICS P;Lo;0;L;;;;;N;;;;;
+144A;CANADIAN SYLLABICS WEST-CREE P;Lo;0;L;;;;;N;;;;;
+144B;CANADIAN SYLLABICS CARRIER H;Lo;0;L;;;;;N;;;;;
+144C;CANADIAN SYLLABICS TE;Lo;0;L;;;;;N;;;;;
+144D;CANADIAN SYLLABICS TAAI;Lo;0;L;;;;;N;;;;;
+144E;CANADIAN SYLLABICS TI;Lo;0;L;;;;;N;;;;;
+144F;CANADIAN SYLLABICS TII;Lo;0;L;;;;;N;;;;;
+1450;CANADIAN SYLLABICS TO;Lo;0;L;;;;;N;;;;;
+1451;CANADIAN SYLLABICS TOO;Lo;0;L;;;;;N;;;;;
+1452;CANADIAN SYLLABICS Y-CREE TOO;Lo;0;L;;;;;N;;;;;
+1453;CANADIAN SYLLABICS CARRIER DEE;Lo;0;L;;;;;N;;;;;
+1454;CANADIAN SYLLABICS CARRIER DI;Lo;0;L;;;;;N;;;;;
+1455;CANADIAN SYLLABICS TA;Lo;0;L;;;;;N;;;;;
+1456;CANADIAN SYLLABICS TAA;Lo;0;L;;;;;N;;;;;
+1457;CANADIAN SYLLABICS TWE;Lo;0;L;;;;;N;;;;;
+1458;CANADIAN SYLLABICS WEST-CREE TWE;Lo;0;L;;;;;N;;;;;
+1459;CANADIAN SYLLABICS TWI;Lo;0;L;;;;;N;;;;;
+145A;CANADIAN SYLLABICS WEST-CREE TWI;Lo;0;L;;;;;N;;;;;
+145B;CANADIAN SYLLABICS TWII;Lo;0;L;;;;;N;;;;;
+145C;CANADIAN SYLLABICS WEST-CREE TWII;Lo;0;L;;;;;N;;;;;
+145D;CANADIAN SYLLABICS TWO;Lo;0;L;;;;;N;;;;;
+145E;CANADIAN SYLLABICS WEST-CREE TWO;Lo;0;L;;;;;N;;;;;
+145F;CANADIAN SYLLABICS TWOO;Lo;0;L;;;;;N;;;;;
+1460;CANADIAN SYLLABICS WEST-CREE TWOO;Lo;0;L;;;;;N;;;;;
+1461;CANADIAN SYLLABICS TWA;Lo;0;L;;;;;N;;;;;
+1462;CANADIAN SYLLABICS WEST-CREE TWA;Lo;0;L;;;;;N;;;;;
+1463;CANADIAN SYLLABICS TWAA;Lo;0;L;;;;;N;;;;;
+1464;CANADIAN SYLLABICS WEST-CREE TWAA;Lo;0;L;;;;;N;;;;;
+1465;CANADIAN SYLLABICS NASKAPI TWAA;Lo;0;L;;;;;N;;;;;
+1466;CANADIAN SYLLABICS T;Lo;0;L;;;;;N;;;;;
+1467;CANADIAN SYLLABICS TTE;Lo;0;L;;;;;N;;;;;
+1468;CANADIAN SYLLABICS TTI;Lo;0;L;;;;;N;;;;;
+1469;CANADIAN SYLLABICS TTO;Lo;0;L;;;;;N;;;;;
+146A;CANADIAN SYLLABICS TTA;Lo;0;L;;;;;N;;;;;
+146B;CANADIAN SYLLABICS KE;Lo;0;L;;;;;N;;;;;
+146C;CANADIAN SYLLABICS KAAI;Lo;0;L;;;;;N;;;;;
+146D;CANADIAN SYLLABICS KI;Lo;0;L;;;;;N;;;;;
+146E;CANADIAN SYLLABICS KII;Lo;0;L;;;;;N;;;;;
+146F;CANADIAN SYLLABICS KO;Lo;0;L;;;;;N;;;;;
+1470;CANADIAN SYLLABICS KOO;Lo;0;L;;;;;N;;;;;
+1471;CANADIAN SYLLABICS Y-CREE KOO;Lo;0;L;;;;;N;;;;;
+1472;CANADIAN SYLLABICS KA;Lo;0;L;;;;;N;;;;;
+1473;CANADIAN SYLLABICS KAA;Lo;0;L;;;;;N;;;;;
+1474;CANADIAN SYLLABICS KWE;Lo;0;L;;;;;N;;;;;
+1475;CANADIAN SYLLABICS WEST-CREE KWE;Lo;0;L;;;;;N;;;;;
+1476;CANADIAN SYLLABICS KWI;Lo;0;L;;;;;N;;;;;
+1477;CANADIAN SYLLABICS WEST-CREE KWI;Lo;0;L;;;;;N;;;;;
+1478;CANADIAN SYLLABICS KWII;Lo;0;L;;;;;N;;;;;
+1479;CANADIAN SYLLABICS WEST-CREE KWII;Lo;0;L;;;;;N;;;;;
+147A;CANADIAN SYLLABICS KWO;Lo;0;L;;;;;N;;;;;
+147B;CANADIAN SYLLABICS WEST-CREE KWO;Lo;0;L;;;;;N;;;;;
+147C;CANADIAN SYLLABICS KWOO;Lo;0;L;;;;;N;;;;;
+147D;CANADIAN SYLLABICS WEST-CREE KWOO;Lo;0;L;;;;;N;;;;;
+147E;CANADIAN SYLLABICS KWA;Lo;0;L;;;;;N;;;;;
+147F;CANADIAN SYLLABICS WEST-CREE KWA;Lo;0;L;;;;;N;;;;;
+1480;CANADIAN SYLLABICS KWAA;Lo;0;L;;;;;N;;;;;
+1481;CANADIAN SYLLABICS WEST-CREE KWAA;Lo;0;L;;;;;N;;;;;
+1482;CANADIAN SYLLABICS NASKAPI KWAA;Lo;0;L;;;;;N;;;;;
+1483;CANADIAN SYLLABICS K;Lo;0;L;;;;;N;;;;;
+1484;CANADIAN SYLLABICS KW;Lo;0;L;;;;;N;;;;;
+1485;CANADIAN SYLLABICS SOUTH-SLAVEY KEH;Lo;0;L;;;;;N;;;;;
+1486;CANADIAN SYLLABICS SOUTH-SLAVEY KIH;Lo;0;L;;;;;N;;;;;
+1487;CANADIAN SYLLABICS SOUTH-SLAVEY KOH;Lo;0;L;;;;;N;;;;;
+1488;CANADIAN SYLLABICS SOUTH-SLAVEY KAH;Lo;0;L;;;;;N;;;;;
+1489;CANADIAN SYLLABICS CE;Lo;0;L;;;;;N;;;;;
+148A;CANADIAN SYLLABICS CAAI;Lo;0;L;;;;;N;;;;;
+148B;CANADIAN SYLLABICS CI;Lo;0;L;;;;;N;;;;;
+148C;CANADIAN SYLLABICS CII;Lo;0;L;;;;;N;;;;;
+148D;CANADIAN SYLLABICS CO;Lo;0;L;;;;;N;;;;;
+148E;CANADIAN SYLLABICS COO;Lo;0;L;;;;;N;;;;;
+148F;CANADIAN SYLLABICS Y-CREE COO;Lo;0;L;;;;;N;;;;;
+1490;CANADIAN SYLLABICS CA;Lo;0;L;;;;;N;;;;;
+1491;CANADIAN SYLLABICS CAA;Lo;0;L;;;;;N;;;;;
+1492;CANADIAN SYLLABICS CWE;Lo;0;L;;;;;N;;;;;
+1493;CANADIAN SYLLABICS WEST-CREE CWE;Lo;0;L;;;;;N;;;;;
+1494;CANADIAN SYLLABICS CWI;Lo;0;L;;;;;N;;;;;
+1495;CANADIAN SYLLABICS WEST-CREE CWI;Lo;0;L;;;;;N;;;;;
+1496;CANADIAN SYLLABICS CWII;Lo;0;L;;;;;N;;;;;
+1497;CANADIAN SYLLABICS WEST-CREE CWII;Lo;0;L;;;;;N;;;;;
+1498;CANADIAN SYLLABICS CWO;Lo;0;L;;;;;N;;;;;
+1499;CANADIAN SYLLABICS WEST-CREE CWO;Lo;0;L;;;;;N;;;;;
+149A;CANADIAN SYLLABICS CWOO;Lo;0;L;;;;;N;;;;;
+149B;CANADIAN SYLLABICS WEST-CREE CWOO;Lo;0;L;;;;;N;;;;;
+149C;CANADIAN SYLLABICS CWA;Lo;0;L;;;;;N;;;;;
+149D;CANADIAN SYLLABICS WEST-CREE CWA;Lo;0;L;;;;;N;;;;;
+149E;CANADIAN SYLLABICS CWAA;Lo;0;L;;;;;N;;;;;
+149F;CANADIAN SYLLABICS WEST-CREE CWAA;Lo;0;L;;;;;N;;;;;
+14A0;CANADIAN SYLLABICS NASKAPI CWAA;Lo;0;L;;;;;N;;;;;
+14A1;CANADIAN SYLLABICS C;Lo;0;L;;;;;N;;;;;
+14A2;CANADIAN SYLLABICS SAYISI TH;Lo;0;L;;;;;N;;;;;
+14A3;CANADIAN SYLLABICS ME;Lo;0;L;;;;;N;;;;;
+14A4;CANADIAN SYLLABICS MAAI;Lo;0;L;;;;;N;;;;;
+14A5;CANADIAN SYLLABICS MI;Lo;0;L;;;;;N;;;;;
+14A6;CANADIAN SYLLABICS MII;Lo;0;L;;;;;N;;;;;
+14A7;CANADIAN SYLLABICS MO;Lo;0;L;;;;;N;;;;;
+14A8;CANADIAN SYLLABICS MOO;Lo;0;L;;;;;N;;;;;
+14A9;CANADIAN SYLLABICS Y-CREE MOO;Lo;0;L;;;;;N;;;;;
+14AA;CANADIAN SYLLABICS MA;Lo;0;L;;;;;N;;;;;
+14AB;CANADIAN SYLLABICS MAA;Lo;0;L;;;;;N;;;;;
+14AC;CANADIAN SYLLABICS MWE;Lo;0;L;;;;;N;;;;;
+14AD;CANADIAN SYLLABICS WEST-CREE MWE;Lo;0;L;;;;;N;;;;;
+14AE;CANADIAN SYLLABICS MWI;Lo;0;L;;;;;N;;;;;
+14AF;CANADIAN SYLLABICS WEST-CREE MWI;Lo;0;L;;;;;N;;;;;
+14B0;CANADIAN SYLLABICS MWII;Lo;0;L;;;;;N;;;;;
+14B1;CANADIAN SYLLABICS WEST-CREE MWII;Lo;0;L;;;;;N;;;;;
+14B2;CANADIAN SYLLABICS MWO;Lo;0;L;;;;;N;;;;;
+14B3;CANADIAN SYLLABICS WEST-CREE MWO;Lo;0;L;;;;;N;;;;;
+14B4;CANADIAN SYLLABICS MWOO;Lo;0;L;;;;;N;;;;;
+14B5;CANADIAN SYLLABICS WEST-CREE MWOO;Lo;0;L;;;;;N;;;;;
+14B6;CANADIAN SYLLABICS MWA;Lo;0;L;;;;;N;;;;;
+14B7;CANADIAN SYLLABICS WEST-CREE MWA;Lo;0;L;;;;;N;;;;;
+14B8;CANADIAN SYLLABICS MWAA;Lo;0;L;;;;;N;;;;;
+14B9;CANADIAN SYLLABICS WEST-CREE MWAA;Lo;0;L;;;;;N;;;;;
+14BA;CANADIAN SYLLABICS NASKAPI MWAA;Lo;0;L;;;;;N;;;;;
+14BB;CANADIAN SYLLABICS M;Lo;0;L;;;;;N;;;;;
+14BC;CANADIAN SYLLABICS WEST-CREE M;Lo;0;L;;;;;N;;;;;
+14BD;CANADIAN SYLLABICS MH;Lo;0;L;;;;;N;;;;;
+14BE;CANADIAN SYLLABICS ATHAPASCAN M;Lo;0;L;;;;;N;;;;;
+14BF;CANADIAN SYLLABICS SAYISI M;Lo;0;L;;;;;N;;;;;
+14C0;CANADIAN SYLLABICS NE;Lo;0;L;;;;;N;;;;;
+14C1;CANADIAN SYLLABICS NAAI;Lo;0;L;;;;;N;;;;;
+14C2;CANADIAN SYLLABICS NI;Lo;0;L;;;;;N;;;;;
+14C3;CANADIAN SYLLABICS NII;Lo;0;L;;;;;N;;;;;
+14C4;CANADIAN SYLLABICS NO;Lo;0;L;;;;;N;;;;;
+14C5;CANADIAN SYLLABICS NOO;Lo;0;L;;;;;N;;;;;
+14C6;CANADIAN SYLLABICS Y-CREE NOO;Lo;0;L;;;;;N;;;;;
+14C7;CANADIAN SYLLABICS NA;Lo;0;L;;;;;N;;;;;
+14C8;CANADIAN SYLLABICS NAA;Lo;0;L;;;;;N;;;;;
+14C9;CANADIAN SYLLABICS NWE;Lo;0;L;;;;;N;;;;;
+14CA;CANADIAN SYLLABICS WEST-CREE NWE;Lo;0;L;;;;;N;;;;;
+14CB;CANADIAN SYLLABICS NWA;Lo;0;L;;;;;N;;;;;
+14CC;CANADIAN SYLLABICS WEST-CREE NWA;Lo;0;L;;;;;N;;;;;
+14CD;CANADIAN SYLLABICS NWAA;Lo;0;L;;;;;N;;;;;
+14CE;CANADIAN SYLLABICS WEST-CREE NWAA;Lo;0;L;;;;;N;;;;;
+14CF;CANADIAN SYLLABICS NASKAPI NWAA;Lo;0;L;;;;;N;;;;;
+14D0;CANADIAN SYLLABICS N;Lo;0;L;;;;;N;;;;;
+14D1;CANADIAN SYLLABICS CARRIER NG;Lo;0;L;;;;;N;;;;;
+14D2;CANADIAN SYLLABICS NH;Lo;0;L;;;;;N;;;;;
+14D3;CANADIAN SYLLABICS LE;Lo;0;L;;;;;N;;;;;
+14D4;CANADIAN SYLLABICS LAAI;Lo;0;L;;;;;N;;;;;
+14D5;CANADIAN SYLLABICS LI;Lo;0;L;;;;;N;;;;;
+14D6;CANADIAN SYLLABICS LII;Lo;0;L;;;;;N;;;;;
+14D7;CANADIAN SYLLABICS LO;Lo;0;L;;;;;N;;;;;
+14D8;CANADIAN SYLLABICS LOO;Lo;0;L;;;;;N;;;;;
+14D9;CANADIAN SYLLABICS Y-CREE LOO;Lo;0;L;;;;;N;;;;;
+14DA;CANADIAN SYLLABICS LA;Lo;0;L;;;;;N;;;;;
+14DB;CANADIAN SYLLABICS LAA;Lo;0;L;;;;;N;;;;;
+14DC;CANADIAN SYLLABICS LWE;Lo;0;L;;;;;N;;;;;
+14DD;CANADIAN SYLLABICS WEST-CREE LWE;Lo;0;L;;;;;N;;;;;
+14DE;CANADIAN SYLLABICS LWI;Lo;0;L;;;;;N;;;;;
+14DF;CANADIAN SYLLABICS WEST-CREE LWI;Lo;0;L;;;;;N;;;;;
+14E0;CANADIAN SYLLABICS LWII;Lo;0;L;;;;;N;;;;;
+14E1;CANADIAN SYLLABICS WEST-CREE LWII;Lo;0;L;;;;;N;;;;;
+14E2;CANADIAN SYLLABICS LWO;Lo;0;L;;;;;N;;;;;
+14E3;CANADIAN SYLLABICS WEST-CREE LWO;Lo;0;L;;;;;N;;;;;
+14E4;CANADIAN SYLLABICS LWOO;Lo;0;L;;;;;N;;;;;
+14E5;CANADIAN SYLLABICS WEST-CREE LWOO;Lo;0;L;;;;;N;;;;;
+14E6;CANADIAN SYLLABICS LWA;Lo;0;L;;;;;N;;;;;
+14E7;CANADIAN SYLLABICS WEST-CREE LWA;Lo;0;L;;;;;N;;;;;
+14E8;CANADIAN SYLLABICS LWAA;Lo;0;L;;;;;N;;;;;
+14E9;CANADIAN SYLLABICS WEST-CREE LWAA;Lo;0;L;;;;;N;;;;;
+14EA;CANADIAN SYLLABICS L;Lo;0;L;;;;;N;;;;;
+14EB;CANADIAN SYLLABICS WEST-CREE L;Lo;0;L;;;;;N;;;;;
+14EC;CANADIAN SYLLABICS MEDIAL L;Lo;0;L;;;;;N;;;;;
+14ED;CANADIAN SYLLABICS SE;Lo;0;L;;;;;N;;;;;
+14EE;CANADIAN SYLLABICS SAAI;Lo;0;L;;;;;N;;;;;
+14EF;CANADIAN SYLLABICS SI;Lo;0;L;;;;;N;;;;;
+14F0;CANADIAN SYLLABICS SII;Lo;0;L;;;;;N;;;;;
+14F1;CANADIAN SYLLABICS SO;Lo;0;L;;;;;N;;;;;
+14F2;CANADIAN SYLLABICS SOO;Lo;0;L;;;;;N;;;;;
+14F3;CANADIAN SYLLABICS Y-CREE SOO;Lo;0;L;;;;;N;;;;;
+14F4;CANADIAN SYLLABICS SA;Lo;0;L;;;;;N;;;;;
+14F5;CANADIAN SYLLABICS SAA;Lo;0;L;;;;;N;;;;;
+14F6;CANADIAN SYLLABICS SWE;Lo;0;L;;;;;N;;;;;
+14F7;CANADIAN SYLLABICS WEST-CREE SWE;Lo;0;L;;;;;N;;;;;
+14F8;CANADIAN SYLLABICS SWI;Lo;0;L;;;;;N;;;;;
+14F9;CANADIAN SYLLABICS WEST-CREE SWI;Lo;0;L;;;;;N;;;;;
+14FA;CANADIAN SYLLABICS SWII;Lo;0;L;;;;;N;;;;;
+14FB;CANADIAN SYLLABICS WEST-CREE SWII;Lo;0;L;;;;;N;;;;;
+14FC;CANADIAN SYLLABICS SWO;Lo;0;L;;;;;N;;;;;
+14FD;CANADIAN SYLLABICS WEST-CREE SWO;Lo;0;L;;;;;N;;;;;
+14FE;CANADIAN SYLLABICS SWOO;Lo;0;L;;;;;N;;;;;
+14FF;CANADIAN SYLLABICS WEST-CREE SWOO;Lo;0;L;;;;;N;;;;;
+1500;CANADIAN SYLLABICS SWA;Lo;0;L;;;;;N;;;;;
+1501;CANADIAN SYLLABICS WEST-CREE SWA;Lo;0;L;;;;;N;;;;;
+1502;CANADIAN SYLLABICS SWAA;Lo;0;L;;;;;N;;;;;
+1503;CANADIAN SYLLABICS WEST-CREE SWAA;Lo;0;L;;;;;N;;;;;
+1504;CANADIAN SYLLABICS NASKAPI SWAA;Lo;0;L;;;;;N;;;;;
+1505;CANADIAN SYLLABICS S;Lo;0;L;;;;;N;;;;;
+1506;CANADIAN SYLLABICS ATHAPASCAN S;Lo;0;L;;;;;N;;;;;
+1507;CANADIAN SYLLABICS SW;Lo;0;L;;;;;N;;;;;
+1508;CANADIAN SYLLABICS BLACKFOOT S;Lo;0;L;;;;;N;;;;;
+1509;CANADIAN SYLLABICS MOOSE-CREE SK;Lo;0;L;;;;;N;;;;;
+150A;CANADIAN SYLLABICS NASKAPI SKW;Lo;0;L;;;;;N;;;;;
+150B;CANADIAN SYLLABICS NASKAPI S-W;Lo;0;L;;;;;N;;;;;
+150C;CANADIAN SYLLABICS NASKAPI SPWA;Lo;0;L;;;;;N;;;;;
+150D;CANADIAN SYLLABICS NASKAPI STWA;Lo;0;L;;;;;N;;;;;
+150E;CANADIAN SYLLABICS NASKAPI SKWA;Lo;0;L;;;;;N;;;;;
+150F;CANADIAN SYLLABICS NASKAPI SCWA;Lo;0;L;;;;;N;;;;;
+1510;CANADIAN SYLLABICS SHE;Lo;0;L;;;;;N;;;;;
+1511;CANADIAN SYLLABICS SHI;Lo;0;L;;;;;N;;;;;
+1512;CANADIAN SYLLABICS SHII;Lo;0;L;;;;;N;;;;;
+1513;CANADIAN SYLLABICS SHO;Lo;0;L;;;;;N;;;;;
+1514;CANADIAN SYLLABICS SHOO;Lo;0;L;;;;;N;;;;;
+1515;CANADIAN SYLLABICS SHA;Lo;0;L;;;;;N;;;;;
+1516;CANADIAN SYLLABICS SHAA;Lo;0;L;;;;;N;;;;;
+1517;CANADIAN SYLLABICS SHWE;Lo;0;L;;;;;N;;;;;
+1518;CANADIAN SYLLABICS WEST-CREE SHWE;Lo;0;L;;;;;N;;;;;
+1519;CANADIAN SYLLABICS SHWI;Lo;0;L;;;;;N;;;;;
+151A;CANADIAN SYLLABICS WEST-CREE SHWI;Lo;0;L;;;;;N;;;;;
+151B;CANADIAN SYLLABICS SHWII;Lo;0;L;;;;;N;;;;;
+151C;CANADIAN SYLLABICS WEST-CREE SHWII;Lo;0;L;;;;;N;;;;;
+151D;CANADIAN SYLLABICS SHWO;Lo;0;L;;;;;N;;;;;
+151E;CANADIAN SYLLABICS WEST-CREE SHWO;Lo;0;L;;;;;N;;;;;
+151F;CANADIAN SYLLABICS SHWOO;Lo;0;L;;;;;N;;;;;
+1520;CANADIAN SYLLABICS WEST-CREE SHWOO;Lo;0;L;;;;;N;;;;;
+1521;CANADIAN SYLLABICS SHWA;Lo;0;L;;;;;N;;;;;
+1522;CANADIAN SYLLABICS WEST-CREE SHWA;Lo;0;L;;;;;N;;;;;
+1523;CANADIAN SYLLABICS SHWAA;Lo;0;L;;;;;N;;;;;
+1524;CANADIAN SYLLABICS WEST-CREE SHWAA;Lo;0;L;;;;;N;;;;;
+1525;CANADIAN SYLLABICS SH;Lo;0;L;;;;;N;;;;;
+1526;CANADIAN SYLLABICS YE;Lo;0;L;;;;;N;;;;;
+1527;CANADIAN SYLLABICS YAAI;Lo;0;L;;;;;N;;;;;
+1528;CANADIAN SYLLABICS YI;Lo;0;L;;;;;N;;;;;
+1529;CANADIAN SYLLABICS YII;Lo;0;L;;;;;N;;;;;
+152A;CANADIAN SYLLABICS YO;Lo;0;L;;;;;N;;;;;
+152B;CANADIAN SYLLABICS YOO;Lo;0;L;;;;;N;;;;;
+152C;CANADIAN SYLLABICS Y-CREE YOO;Lo;0;L;;;;;N;;;;;
+152D;CANADIAN SYLLABICS YA;Lo;0;L;;;;;N;;;;;
+152E;CANADIAN SYLLABICS YAA;Lo;0;L;;;;;N;;;;;
+152F;CANADIAN SYLLABICS YWE;Lo;0;L;;;;;N;;;;;
+1530;CANADIAN SYLLABICS WEST-CREE YWE;Lo;0;L;;;;;N;;;;;
+1531;CANADIAN SYLLABICS YWI;Lo;0;L;;;;;N;;;;;
+1532;CANADIAN SYLLABICS WEST-CREE YWI;Lo;0;L;;;;;N;;;;;
+1533;CANADIAN SYLLABICS YWII;Lo;0;L;;;;;N;;;;;
+1534;CANADIAN SYLLABICS WEST-CREE YWII;Lo;0;L;;;;;N;;;;;
+1535;CANADIAN SYLLABICS YWO;Lo;0;L;;;;;N;;;;;
+1536;CANADIAN SYLLABICS WEST-CREE YWO;Lo;0;L;;;;;N;;;;;
+1537;CANADIAN SYLLABICS YWOO;Lo;0;L;;;;;N;;;;;
+1538;CANADIAN SYLLABICS WEST-CREE YWOO;Lo;0;L;;;;;N;;;;;
+1539;CANADIAN SYLLABICS YWA;Lo;0;L;;;;;N;;;;;
+153A;CANADIAN SYLLABICS WEST-CREE YWA;Lo;0;L;;;;;N;;;;;
+153B;CANADIAN SYLLABICS YWAA;Lo;0;L;;;;;N;;;;;
+153C;CANADIAN SYLLABICS WEST-CREE YWAA;Lo;0;L;;;;;N;;;;;
+153D;CANADIAN SYLLABICS NASKAPI YWAA;Lo;0;L;;;;;N;;;;;
+153E;CANADIAN SYLLABICS Y;Lo;0;L;;;;;N;;;;;
+153F;CANADIAN SYLLABICS BIBLE-CREE Y;Lo;0;L;;;;;N;;;;;
+1540;CANADIAN SYLLABICS WEST-CREE Y;Lo;0;L;;;;;N;;;;;
+1541;CANADIAN SYLLABICS SAYISI YI;Lo;0;L;;;;;N;;;;;
+1542;CANADIAN SYLLABICS RE;Lo;0;L;;;;;N;;;;;
+1543;CANADIAN SYLLABICS R-CREE RE;Lo;0;L;;;;;N;;;;;
+1544;CANADIAN SYLLABICS WEST-CREE LE;Lo;0;L;;;;;N;;;;;
+1545;CANADIAN SYLLABICS RAAI;Lo;0;L;;;;;N;;;;;
+1546;CANADIAN SYLLABICS RI;Lo;0;L;;;;;N;;;;;
+1547;CANADIAN SYLLABICS RII;Lo;0;L;;;;;N;;;;;
+1548;CANADIAN SYLLABICS RO;Lo;0;L;;;;;N;;;;;
+1549;CANADIAN SYLLABICS ROO;Lo;0;L;;;;;N;;;;;
+154A;CANADIAN SYLLABICS WEST-CREE LO;Lo;0;L;;;;;N;;;;;
+154B;CANADIAN SYLLABICS RA;Lo;0;L;;;;;N;;;;;
+154C;CANADIAN SYLLABICS RAA;Lo;0;L;;;;;N;;;;;
+154D;CANADIAN SYLLABICS WEST-CREE LA;Lo;0;L;;;;;N;;;;;
+154E;CANADIAN SYLLABICS RWAA;Lo;0;L;;;;;N;;;;;
+154F;CANADIAN SYLLABICS WEST-CREE RWAA;Lo;0;L;;;;;N;;;;;
+1550;CANADIAN SYLLABICS R;Lo;0;L;;;;;N;;;;;
+1551;CANADIAN SYLLABICS WEST-CREE R;Lo;0;L;;;;;N;;;;;
+1552;CANADIAN SYLLABICS MEDIAL R;Lo;0;L;;;;;N;;;;;
+1553;CANADIAN SYLLABICS FE;Lo;0;L;;;;;N;;;;;
+1554;CANADIAN SYLLABICS FAAI;Lo;0;L;;;;;N;;;;;
+1555;CANADIAN SYLLABICS FI;Lo;0;L;;;;;N;;;;;
+1556;CANADIAN SYLLABICS FII;Lo;0;L;;;;;N;;;;;
+1557;CANADIAN SYLLABICS FO;Lo;0;L;;;;;N;;;;;
+1558;CANADIAN SYLLABICS FOO;Lo;0;L;;;;;N;;;;;
+1559;CANADIAN SYLLABICS FA;Lo;0;L;;;;;N;;;;;
+155A;CANADIAN SYLLABICS FAA;Lo;0;L;;;;;N;;;;;
+155B;CANADIAN SYLLABICS FWAA;Lo;0;L;;;;;N;;;;;
+155C;CANADIAN SYLLABICS WEST-CREE FWAA;Lo;0;L;;;;;N;;;;;
+155D;CANADIAN SYLLABICS F;Lo;0;L;;;;;N;;;;;
+155E;CANADIAN SYLLABICS THE;Lo;0;L;;;;;N;;;;;
+155F;CANADIAN SYLLABICS N-CREE THE;Lo;0;L;;;;;N;;;;;
+1560;CANADIAN SYLLABICS THI;Lo;0;L;;;;;N;;;;;
+1561;CANADIAN SYLLABICS N-CREE THI;Lo;0;L;;;;;N;;;;;
+1562;CANADIAN SYLLABICS THII;Lo;0;L;;;;;N;;;;;
+1563;CANADIAN SYLLABICS N-CREE THII;Lo;0;L;;;;;N;;;;;
+1564;CANADIAN SYLLABICS THO;Lo;0;L;;;;;N;;;;;
+1565;CANADIAN SYLLABICS THOO;Lo;0;L;;;;;N;;;;;
+1566;CANADIAN SYLLABICS THA;Lo;0;L;;;;;N;;;;;
+1567;CANADIAN SYLLABICS THAA;Lo;0;L;;;;;N;;;;;
+1568;CANADIAN SYLLABICS THWAA;Lo;0;L;;;;;N;;;;;
+1569;CANADIAN SYLLABICS WEST-CREE THWAA;Lo;0;L;;;;;N;;;;;
+156A;CANADIAN SYLLABICS TH;Lo;0;L;;;;;N;;;;;
+156B;CANADIAN SYLLABICS TTHE;Lo;0;L;;;;;N;;;;;
+156C;CANADIAN SYLLABICS TTHI;Lo;0;L;;;;;N;;;;;
+156D;CANADIAN SYLLABICS TTHO;Lo;0;L;;;;;N;;;;;
+156E;CANADIAN SYLLABICS TTHA;Lo;0;L;;;;;N;;;;;
+156F;CANADIAN SYLLABICS TTH;Lo;0;L;;;;;N;;;;;
+1570;CANADIAN SYLLABICS TYE;Lo;0;L;;;;;N;;;;;
+1571;CANADIAN SYLLABICS TYI;Lo;0;L;;;;;N;;;;;
+1572;CANADIAN SYLLABICS TYO;Lo;0;L;;;;;N;;;;;
+1573;CANADIAN SYLLABICS TYA;Lo;0;L;;;;;N;;;;;
+1574;CANADIAN SYLLABICS NUNAVIK HE;Lo;0;L;;;;;N;;;;;
+1575;CANADIAN SYLLABICS NUNAVIK HI;Lo;0;L;;;;;N;;;;;
+1576;CANADIAN SYLLABICS NUNAVIK HII;Lo;0;L;;;;;N;;;;;
+1577;CANADIAN SYLLABICS NUNAVIK HO;Lo;0;L;;;;;N;;;;;
+1578;CANADIAN SYLLABICS NUNAVIK HOO;Lo;0;L;;;;;N;;;;;
+1579;CANADIAN SYLLABICS NUNAVIK HA;Lo;0;L;;;;;N;;;;;
+157A;CANADIAN SYLLABICS NUNAVIK HAA;Lo;0;L;;;;;N;;;;;
+157B;CANADIAN SYLLABICS NUNAVIK H;Lo;0;L;;;;;N;;;;;
+157C;CANADIAN SYLLABICS NUNAVUT H;Lo;0;L;;;;;N;;;;;
+157D;CANADIAN SYLLABICS HK;Lo;0;L;;;;;N;;;;;
+157E;CANADIAN SYLLABICS QAAI;Lo;0;L;;;;;N;;;;;
+157F;CANADIAN SYLLABICS QI;Lo;0;L;;;;;N;;;;;
+1580;CANADIAN SYLLABICS QII;Lo;0;L;;;;;N;;;;;
+1581;CANADIAN SYLLABICS QO;Lo;0;L;;;;;N;;;;;
+1582;CANADIAN SYLLABICS QOO;Lo;0;L;;;;;N;;;;;
+1583;CANADIAN SYLLABICS QA;Lo;0;L;;;;;N;;;;;
+1584;CANADIAN SYLLABICS QAA;Lo;0;L;;;;;N;;;;;
+1585;CANADIAN SYLLABICS Q;Lo;0;L;;;;;N;;;;;
+1586;CANADIAN SYLLABICS TLHE;Lo;0;L;;;;;N;;;;;
+1587;CANADIAN SYLLABICS TLHI;Lo;0;L;;;;;N;;;;;
+1588;CANADIAN SYLLABICS TLHO;Lo;0;L;;;;;N;;;;;
+1589;CANADIAN SYLLABICS TLHA;Lo;0;L;;;;;N;;;;;
+158A;CANADIAN SYLLABICS WEST-CREE RE;Lo;0;L;;;;;N;;;;;
+158B;CANADIAN SYLLABICS WEST-CREE RI;Lo;0;L;;;;;N;;;;;
+158C;CANADIAN SYLLABICS WEST-CREE RO;Lo;0;L;;;;;N;;;;;
+158D;CANADIAN SYLLABICS WEST-CREE RA;Lo;0;L;;;;;N;;;;;
+158E;CANADIAN SYLLABICS NGAAI;Lo;0;L;;;;;N;;;;;
+158F;CANADIAN SYLLABICS NGI;Lo;0;L;;;;;N;;;;;
+1590;CANADIAN SYLLABICS NGII;Lo;0;L;;;;;N;;;;;
+1591;CANADIAN SYLLABICS NGO;Lo;0;L;;;;;N;;;;;
+1592;CANADIAN SYLLABICS NGOO;Lo;0;L;;;;;N;;;;;
+1593;CANADIAN SYLLABICS NGA;Lo;0;L;;;;;N;;;;;
+1594;CANADIAN SYLLABICS NGAA;Lo;0;L;;;;;N;;;;;
+1595;CANADIAN SYLLABICS NG;Lo;0;L;;;;;N;;;;;
+1596;CANADIAN SYLLABICS NNG;Lo;0;L;;;;;N;;;;;
+1597;CANADIAN SYLLABICS SAYISI SHE;Lo;0;L;;;;;N;;;;;
+1598;CANADIAN SYLLABICS SAYISI SHI;Lo;0;L;;;;;N;;;;;
+1599;CANADIAN SYLLABICS SAYISI SHO;Lo;0;L;;;;;N;;;;;
+159A;CANADIAN SYLLABICS SAYISI SHA;Lo;0;L;;;;;N;;;;;
+159B;CANADIAN SYLLABICS WOODS-CREE THE;Lo;0;L;;;;;N;;;;;
+159C;CANADIAN SYLLABICS WOODS-CREE THI;Lo;0;L;;;;;N;;;;;
+159D;CANADIAN SYLLABICS WOODS-CREE THO;Lo;0;L;;;;;N;;;;;
+159E;CANADIAN SYLLABICS WOODS-CREE THA;Lo;0;L;;;;;N;;;;;
+159F;CANADIAN SYLLABICS WOODS-CREE TH;Lo;0;L;;;;;N;;;;;
+15A0;CANADIAN SYLLABICS LHI;Lo;0;L;;;;;N;;;;;
+15A1;CANADIAN SYLLABICS LHII;Lo;0;L;;;;;N;;;;;
+15A2;CANADIAN SYLLABICS LHO;Lo;0;L;;;;;N;;;;;
+15A3;CANADIAN SYLLABICS LHOO;Lo;0;L;;;;;N;;;;;
+15A4;CANADIAN SYLLABICS LHA;Lo;0;L;;;;;N;;;;;
+15A5;CANADIAN SYLLABICS LHAA;Lo;0;L;;;;;N;;;;;
+15A6;CANADIAN SYLLABICS LH;Lo;0;L;;;;;N;;;;;
+15A7;CANADIAN SYLLABICS TH-CREE THE;Lo;0;L;;;;;N;;;;;
+15A8;CANADIAN SYLLABICS TH-CREE THI;Lo;0;L;;;;;N;;;;;
+15A9;CANADIAN SYLLABICS TH-CREE THII;Lo;0;L;;;;;N;;;;;
+15AA;CANADIAN SYLLABICS TH-CREE THO;Lo;0;L;;;;;N;;;;;
+15AB;CANADIAN SYLLABICS TH-CREE THOO;Lo;0;L;;;;;N;;;;;
+15AC;CANADIAN SYLLABICS TH-CREE THA;Lo;0;L;;;;;N;;;;;
+15AD;CANADIAN SYLLABICS TH-CREE THAA;Lo;0;L;;;;;N;;;;;
+15AE;CANADIAN SYLLABICS TH-CREE TH;Lo;0;L;;;;;N;;;;;
+15AF;CANADIAN SYLLABICS AIVILIK B;Lo;0;L;;;;;N;;;;;
+15B0;CANADIAN SYLLABICS BLACKFOOT E;Lo;0;L;;;;;N;;;;;
+15B1;CANADIAN SYLLABICS BLACKFOOT I;Lo;0;L;;;;;N;;;;;
+15B2;CANADIAN SYLLABICS BLACKFOOT O;Lo;0;L;;;;;N;;;;;
+15B3;CANADIAN SYLLABICS BLACKFOOT A;Lo;0;L;;;;;N;;;;;
+15B4;CANADIAN SYLLABICS BLACKFOOT WE;Lo;0;L;;;;;N;;;;;
+15B5;CANADIAN SYLLABICS BLACKFOOT WI;Lo;0;L;;;;;N;;;;;
+15B6;CANADIAN SYLLABICS BLACKFOOT WO;Lo;0;L;;;;;N;;;;;
+15B7;CANADIAN SYLLABICS BLACKFOOT WA;Lo;0;L;;;;;N;;;;;
+15B8;CANADIAN SYLLABICS BLACKFOOT NE;Lo;0;L;;;;;N;;;;;
+15B9;CANADIAN SYLLABICS BLACKFOOT NI;Lo;0;L;;;;;N;;;;;
+15BA;CANADIAN SYLLABICS BLACKFOOT NO;Lo;0;L;;;;;N;;;;;
+15BB;CANADIAN SYLLABICS BLACKFOOT NA;Lo;0;L;;;;;N;;;;;
+15BC;CANADIAN SYLLABICS BLACKFOOT KE;Lo;0;L;;;;;N;;;;;
+15BD;CANADIAN SYLLABICS BLACKFOOT KI;Lo;0;L;;;;;N;;;;;
+15BE;CANADIAN SYLLABICS BLACKFOOT KO;Lo;0;L;;;;;N;;;;;
+15BF;CANADIAN SYLLABICS BLACKFOOT KA;Lo;0;L;;;;;N;;;;;
+15C0;CANADIAN SYLLABICS SAYISI HE;Lo;0;L;;;;;N;;;;;
+15C1;CANADIAN SYLLABICS SAYISI HI;Lo;0;L;;;;;N;;;;;
+15C2;CANADIAN SYLLABICS SAYISI HO;Lo;0;L;;;;;N;;;;;
+15C3;CANADIAN SYLLABICS SAYISI HA;Lo;0;L;;;;;N;;;;;
+15C4;CANADIAN SYLLABICS CARRIER GHU;Lo;0;L;;;;;N;;;;;
+15C5;CANADIAN SYLLABICS CARRIER GHO;Lo;0;L;;;;;N;;;;;
+15C6;CANADIAN SYLLABICS CARRIER GHE;Lo;0;L;;;;;N;;;;;
+15C7;CANADIAN SYLLABICS CARRIER GHEE;Lo;0;L;;;;;N;;;;;
+15C8;CANADIAN SYLLABICS CARRIER GHI;Lo;0;L;;;;;N;;;;;
+15C9;CANADIAN SYLLABICS CARRIER GHA;Lo;0;L;;;;;N;;;;;
+15CA;CANADIAN SYLLABICS CARRIER RU;Lo;0;L;;;;;N;;;;;
+15CB;CANADIAN SYLLABICS CARRIER RO;Lo;0;L;;;;;N;;;;;
+15CC;CANADIAN SYLLABICS CARRIER RE;Lo;0;L;;;;;N;;;;;
+15CD;CANADIAN SYLLABICS CARRIER REE;Lo;0;L;;;;;N;;;;;
+15CE;CANADIAN SYLLABICS CARRIER RI;Lo;0;L;;;;;N;;;;;
+15CF;CANADIAN SYLLABICS CARRIER RA;Lo;0;L;;;;;N;;;;;
+15D0;CANADIAN SYLLABICS CARRIER WU;Lo;0;L;;;;;N;;;;;
+15D1;CANADIAN SYLLABICS CARRIER WO;Lo;0;L;;;;;N;;;;;
+15D2;CANADIAN SYLLABICS CARRIER WE;Lo;0;L;;;;;N;;;;;
+15D3;CANADIAN SYLLABICS CARRIER WEE;Lo;0;L;;;;;N;;;;;
+15D4;CANADIAN SYLLABICS CARRIER WI;Lo;0;L;;;;;N;;;;;
+15D5;CANADIAN SYLLABICS CARRIER WA;Lo;0;L;;;;;N;;;;;
+15D6;CANADIAN SYLLABICS CARRIER HWU;Lo;0;L;;;;;N;;;;;
+15D7;CANADIAN SYLLABICS CARRIER HWO;Lo;0;L;;;;;N;;;;;
+15D8;CANADIAN SYLLABICS CARRIER HWE;Lo;0;L;;;;;N;;;;;
+15D9;CANADIAN SYLLABICS CARRIER HWEE;Lo;0;L;;;;;N;;;;;
+15DA;CANADIAN SYLLABICS CARRIER HWI;Lo;0;L;;;;;N;;;;;
+15DB;CANADIAN SYLLABICS CARRIER HWA;Lo;0;L;;;;;N;;;;;
+15DC;CANADIAN SYLLABICS CARRIER THU;Lo;0;L;;;;;N;;;;;
+15DD;CANADIAN SYLLABICS CARRIER THO;Lo;0;L;;;;;N;;;;;
+15DE;CANADIAN SYLLABICS CARRIER THE;Lo;0;L;;;;;N;;;;;
+15DF;CANADIAN SYLLABICS CARRIER THEE;Lo;0;L;;;;;N;;;;;
+15E0;CANADIAN SYLLABICS CARRIER THI;Lo;0;L;;;;;N;;;;;
+15E1;CANADIAN SYLLABICS CARRIER THA;Lo;0;L;;;;;N;;;;;
+15E2;CANADIAN SYLLABICS CARRIER TTU;Lo;0;L;;;;;N;;;;;
+15E3;CANADIAN SYLLABICS CARRIER TTO;Lo;0;L;;;;;N;;;;;
+15E4;CANADIAN SYLLABICS CARRIER TTE;Lo;0;L;;;;;N;;;;;
+15E5;CANADIAN SYLLABICS CARRIER TTEE;Lo;0;L;;;;;N;;;;;
+15E6;CANADIAN SYLLABICS CARRIER TTI;Lo;0;L;;;;;N;;;;;
+15E7;CANADIAN SYLLABICS CARRIER TTA;Lo;0;L;;;;;N;;;;;
+15E8;CANADIAN SYLLABICS CARRIER PU;Lo;0;L;;;;;N;;;;;
+15E9;CANADIAN SYLLABICS CARRIER PO;Lo;0;L;;;;;N;;;;;
+15EA;CANADIAN SYLLABICS CARRIER PE;Lo;0;L;;;;;N;;;;;
+15EB;CANADIAN SYLLABICS CARRIER PEE;Lo;0;L;;;;;N;;;;;
+15EC;CANADIAN SYLLABICS CARRIER PI;Lo;0;L;;;;;N;;;;;
+15ED;CANADIAN SYLLABICS CARRIER PA;Lo;0;L;;;;;N;;;;;
+15EE;CANADIAN SYLLABICS CARRIER P;Lo;0;L;;;;;N;;;;;
+15EF;CANADIAN SYLLABICS CARRIER GU;Lo;0;L;;;;;N;;;;;
+15F0;CANADIAN SYLLABICS CARRIER GO;Lo;0;L;;;;;N;;;;;
+15F1;CANADIAN SYLLABICS CARRIER GE;Lo;0;L;;;;;N;;;;;
+15F2;CANADIAN SYLLABICS CARRIER GEE;Lo;0;L;;;;;N;;;;;
+15F3;CANADIAN SYLLABICS CARRIER GI;Lo;0;L;;;;;N;;;;;
+15F4;CANADIAN SYLLABICS CARRIER GA;Lo;0;L;;;;;N;;;;;
+15F5;CANADIAN SYLLABICS CARRIER KHU;Lo;0;L;;;;;N;;;;;
+15F6;CANADIAN SYLLABICS CARRIER KHO;Lo;0;L;;;;;N;;;;;
+15F7;CANADIAN SYLLABICS CARRIER KHE;Lo;0;L;;;;;N;;;;;
+15F8;CANADIAN SYLLABICS CARRIER KHEE;Lo;0;L;;;;;N;;;;;
+15F9;CANADIAN SYLLABICS CARRIER KHI;Lo;0;L;;;;;N;;;;;
+15FA;CANADIAN SYLLABICS CARRIER KHA;Lo;0;L;;;;;N;;;;;
+15FB;CANADIAN SYLLABICS CARRIER KKU;Lo;0;L;;;;;N;;;;;
+15FC;CANADIAN SYLLABICS CARRIER KKO;Lo;0;L;;;;;N;;;;;
+15FD;CANADIAN SYLLABICS CARRIER KKE;Lo;0;L;;;;;N;;;;;
+15FE;CANADIAN SYLLABICS CARRIER KKEE;Lo;0;L;;;;;N;;;;;
+15FF;CANADIAN SYLLABICS CARRIER KKI;Lo;0;L;;;;;N;;;;;
+1600;CANADIAN SYLLABICS CARRIER KKA;Lo;0;L;;;;;N;;;;;
+1601;CANADIAN SYLLABICS CARRIER KK;Lo;0;L;;;;;N;;;;;
+1602;CANADIAN SYLLABICS CARRIER NU;Lo;0;L;;;;;N;;;;;
+1603;CANADIAN SYLLABICS CARRIER NO;Lo;0;L;;;;;N;;;;;
+1604;CANADIAN SYLLABICS CARRIER NE;Lo;0;L;;;;;N;;;;;
+1605;CANADIAN SYLLABICS CARRIER NEE;Lo;0;L;;;;;N;;;;;
+1606;CANADIAN SYLLABICS CARRIER NI;Lo;0;L;;;;;N;;;;;
+1607;CANADIAN SYLLABICS CARRIER NA;Lo;0;L;;;;;N;;;;;
+1608;CANADIAN SYLLABICS CARRIER MU;Lo;0;L;;;;;N;;;;;
+1609;CANADIAN SYLLABICS CARRIER MO;Lo;0;L;;;;;N;;;;;
+160A;CANADIAN SYLLABICS CARRIER ME;Lo;0;L;;;;;N;;;;;
+160B;CANADIAN SYLLABICS CARRIER MEE;Lo;0;L;;;;;N;;;;;
+160C;CANADIAN SYLLABICS CARRIER MI;Lo;0;L;;;;;N;;;;;
+160D;CANADIAN SYLLABICS CARRIER MA;Lo;0;L;;;;;N;;;;;
+160E;CANADIAN SYLLABICS CARRIER YU;Lo;0;L;;;;;N;;;;;
+160F;CANADIAN SYLLABICS CARRIER YO;Lo;0;L;;;;;N;;;;;
+1610;CANADIAN SYLLABICS CARRIER YE;Lo;0;L;;;;;N;;;;;
+1611;CANADIAN SYLLABICS CARRIER YEE;Lo;0;L;;;;;N;;;;;
+1612;CANADIAN SYLLABICS CARRIER YI;Lo;0;L;;;;;N;;;;;
+1613;CANADIAN SYLLABICS CARRIER YA;Lo;0;L;;;;;N;;;;;
+1614;CANADIAN SYLLABICS CARRIER JU;Lo;0;L;;;;;N;;;;;
+1615;CANADIAN SYLLABICS SAYISI JU;Lo;0;L;;;;;N;;;;;
+1616;CANADIAN SYLLABICS CARRIER JO;Lo;0;L;;;;;N;;;;;
+1617;CANADIAN SYLLABICS CARRIER JE;Lo;0;L;;;;;N;;;;;
+1618;CANADIAN SYLLABICS CARRIER JEE;Lo;0;L;;;;;N;;;;;
+1619;CANADIAN SYLLABICS CARRIER JI;Lo;0;L;;;;;N;;;;;
+161A;CANADIAN SYLLABICS SAYISI JI;Lo;0;L;;;;;N;;;;;
+161B;CANADIAN SYLLABICS CARRIER JA;Lo;0;L;;;;;N;;;;;
+161C;CANADIAN SYLLABICS CARRIER JJU;Lo;0;L;;;;;N;;;;;
+161D;CANADIAN SYLLABICS CARRIER JJO;Lo;0;L;;;;;N;;;;;
+161E;CANADIAN SYLLABICS CARRIER JJE;Lo;0;L;;;;;N;;;;;
+161F;CANADIAN SYLLABICS CARRIER JJEE;Lo;0;L;;;;;N;;;;;
+1620;CANADIAN SYLLABICS CARRIER JJI;Lo;0;L;;;;;N;;;;;
+1621;CANADIAN SYLLABICS CARRIER JJA;Lo;0;L;;;;;N;;;;;
+1622;CANADIAN SYLLABICS CARRIER LU;Lo;0;L;;;;;N;;;;;
+1623;CANADIAN SYLLABICS CARRIER LO;Lo;0;L;;;;;N;;;;;
+1624;CANADIAN SYLLABICS CARRIER LE;Lo;0;L;;;;;N;;;;;
+1625;CANADIAN SYLLABICS CARRIER LEE;Lo;0;L;;;;;N;;;;;
+1626;CANADIAN SYLLABICS CARRIER LI;Lo;0;L;;;;;N;;;;;
+1627;CANADIAN SYLLABICS CARRIER LA;Lo;0;L;;;;;N;;;;;
+1628;CANADIAN SYLLABICS CARRIER DLU;Lo;0;L;;;;;N;;;;;
+1629;CANADIAN SYLLABICS CARRIER DLO;Lo;0;L;;;;;N;;;;;
+162A;CANADIAN SYLLABICS CARRIER DLE;Lo;0;L;;;;;N;;;;;
+162B;CANADIAN SYLLABICS CARRIER DLEE;Lo;0;L;;;;;N;;;;;
+162C;CANADIAN SYLLABICS CARRIER DLI;Lo;0;L;;;;;N;;;;;
+162D;CANADIAN SYLLABICS CARRIER DLA;Lo;0;L;;;;;N;;;;;
+162E;CANADIAN SYLLABICS CARRIER LHU;Lo;0;L;;;;;N;;;;;
+162F;CANADIAN SYLLABICS CARRIER LHO;Lo;0;L;;;;;N;;;;;
+1630;CANADIAN SYLLABICS CARRIER LHE;Lo;0;L;;;;;N;;;;;
+1631;CANADIAN SYLLABICS CARRIER LHEE;Lo;0;L;;;;;N;;;;;
+1632;CANADIAN SYLLABICS CARRIER LHI;Lo;0;L;;;;;N;;;;;
+1633;CANADIAN SYLLABICS CARRIER LHA;Lo;0;L;;;;;N;;;;;
+1634;CANADIAN SYLLABICS CARRIER TLHU;Lo;0;L;;;;;N;;;;;
+1635;CANADIAN SYLLABICS CARRIER TLHO;Lo;0;L;;;;;N;;;;;
+1636;CANADIAN SYLLABICS CARRIER TLHE;Lo;0;L;;;;;N;;;;;
+1637;CANADIAN SYLLABICS CARRIER TLHEE;Lo;0;L;;;;;N;;;;;
+1638;CANADIAN SYLLABICS CARRIER TLHI;Lo;0;L;;;;;N;;;;;
+1639;CANADIAN SYLLABICS CARRIER TLHA;Lo;0;L;;;;;N;;;;;
+163A;CANADIAN SYLLABICS CARRIER TLU;Lo;0;L;;;;;N;;;;;
+163B;CANADIAN SYLLABICS CARRIER TLO;Lo;0;L;;;;;N;;;;;
+163C;CANADIAN SYLLABICS CARRIER TLE;Lo;0;L;;;;;N;;;;;
+163D;CANADIAN SYLLABICS CARRIER TLEE;Lo;0;L;;;;;N;;;;;
+163E;CANADIAN SYLLABICS CARRIER TLI;Lo;0;L;;;;;N;;;;;
+163F;CANADIAN SYLLABICS CARRIER TLA;Lo;0;L;;;;;N;;;;;
+1640;CANADIAN SYLLABICS CARRIER ZU;Lo;0;L;;;;;N;;;;;
+1641;CANADIAN SYLLABICS CARRIER ZO;Lo;0;L;;;;;N;;;;;
+1642;CANADIAN SYLLABICS CARRIER ZE;Lo;0;L;;;;;N;;;;;
+1643;CANADIAN SYLLABICS CARRIER ZEE;Lo;0;L;;;;;N;;;;;
+1644;CANADIAN SYLLABICS CARRIER ZI;Lo;0;L;;;;;N;;;;;
+1645;CANADIAN SYLLABICS CARRIER ZA;Lo;0;L;;;;;N;;;;;
+1646;CANADIAN SYLLABICS CARRIER Z;Lo;0;L;;;;;N;;;;;
+1647;CANADIAN SYLLABICS CARRIER INITIAL Z;Lo;0;L;;;;;N;;;;;
+1648;CANADIAN SYLLABICS CARRIER DZU;Lo;0;L;;;;;N;;;;;
+1649;CANADIAN SYLLABICS CARRIER DZO;Lo;0;L;;;;;N;;;;;
+164A;CANADIAN SYLLABICS CARRIER DZE;Lo;0;L;;;;;N;;;;;
+164B;CANADIAN SYLLABICS CARRIER DZEE;Lo;0;L;;;;;N;;;;;
+164C;CANADIAN SYLLABICS CARRIER DZI;Lo;0;L;;;;;N;;;;;
+164D;CANADIAN SYLLABICS CARRIER DZA;Lo;0;L;;;;;N;;;;;
+164E;CANADIAN SYLLABICS CARRIER SU;Lo;0;L;;;;;N;;;;;
+164F;CANADIAN SYLLABICS CARRIER SO;Lo;0;L;;;;;N;;;;;
+1650;CANADIAN SYLLABICS CARRIER SE;Lo;0;L;;;;;N;;;;;
+1651;CANADIAN SYLLABICS CARRIER SEE;Lo;0;L;;;;;N;;;;;
+1652;CANADIAN SYLLABICS CARRIER SI;Lo;0;L;;;;;N;;;;;
+1653;CANADIAN SYLLABICS CARRIER SA;Lo;0;L;;;;;N;;;;;
+1654;CANADIAN SYLLABICS CARRIER SHU;Lo;0;L;;;;;N;;;;;
+1655;CANADIAN SYLLABICS CARRIER SHO;Lo;0;L;;;;;N;;;;;
+1656;CANADIAN SYLLABICS CARRIER SHE;Lo;0;L;;;;;N;;;;;
+1657;CANADIAN SYLLABICS CARRIER SHEE;Lo;0;L;;;;;N;;;;;
+1658;CANADIAN SYLLABICS CARRIER SHI;Lo;0;L;;;;;N;;;;;
+1659;CANADIAN SYLLABICS CARRIER SHA;Lo;0;L;;;;;N;;;;;
+165A;CANADIAN SYLLABICS CARRIER SH;Lo;0;L;;;;;N;;;;;
+165B;CANADIAN SYLLABICS CARRIER TSU;Lo;0;L;;;;;N;;;;;
+165C;CANADIAN SYLLABICS CARRIER TSO;Lo;0;L;;;;;N;;;;;
+165D;CANADIAN SYLLABICS CARRIER TSE;Lo;0;L;;;;;N;;;;;
+165E;CANADIAN SYLLABICS CARRIER TSEE;Lo;0;L;;;;;N;;;;;
+165F;CANADIAN SYLLABICS CARRIER TSI;Lo;0;L;;;;;N;;;;;
+1660;CANADIAN SYLLABICS CARRIER TSA;Lo;0;L;;;;;N;;;;;
+1661;CANADIAN SYLLABICS CARRIER CHU;Lo;0;L;;;;;N;;;;;
+1662;CANADIAN SYLLABICS CARRIER CHO;Lo;0;L;;;;;N;;;;;
+1663;CANADIAN SYLLABICS CARRIER CHE;Lo;0;L;;;;;N;;;;;
+1664;CANADIAN SYLLABICS CARRIER CHEE;Lo;0;L;;;;;N;;;;;
+1665;CANADIAN SYLLABICS CARRIER CHI;Lo;0;L;;;;;N;;;;;
+1666;CANADIAN SYLLABICS CARRIER CHA;Lo;0;L;;;;;N;;;;;
+1667;CANADIAN SYLLABICS CARRIER TTSU;Lo;0;L;;;;;N;;;;;
+1668;CANADIAN SYLLABICS CARRIER TTSO;Lo;0;L;;;;;N;;;;;
+1669;CANADIAN SYLLABICS CARRIER TTSE;Lo;0;L;;;;;N;;;;;
+166A;CANADIAN SYLLABICS CARRIER TTSEE;Lo;0;L;;;;;N;;;;;
+166B;CANADIAN SYLLABICS CARRIER TTSI;Lo;0;L;;;;;N;;;;;
+166C;CANADIAN SYLLABICS CARRIER TTSA;Lo;0;L;;;;;N;;;;;
+166D;CANADIAN SYLLABICS CHI SIGN;Po;0;L;;;;;N;;;;;
+166E;CANADIAN SYLLABICS FULL STOP;Po;0;L;;;;;N;;;;;
+166F;CANADIAN SYLLABICS QAI;Lo;0;L;;;;;N;;;;;
+1670;CANADIAN SYLLABICS NGAI;Lo;0;L;;;;;N;;;;;
+1671;CANADIAN SYLLABICS NNGI;Lo;0;L;;;;;N;;;;;
+1672;CANADIAN SYLLABICS NNGII;Lo;0;L;;;;;N;;;;;
+1673;CANADIAN SYLLABICS NNGO;Lo;0;L;;;;;N;;;;;
+1674;CANADIAN SYLLABICS NNGOO;Lo;0;L;;;;;N;;;;;
+1675;CANADIAN SYLLABICS NNGA;Lo;0;L;;;;;N;;;;;
+1676;CANADIAN SYLLABICS NNGAA;Lo;0;L;;;;;N;;;;;
+1677;CANADIAN SYLLABICS WOODS-CREE THWEE;Lo;0;L;;;;;N;;;;;
+1678;CANADIAN SYLLABICS WOODS-CREE THWI;Lo;0;L;;;;;N;;;;;
+1679;CANADIAN SYLLABICS WOODS-CREE THWII;Lo;0;L;;;;;N;;;;;
+167A;CANADIAN SYLLABICS WOODS-CREE THWO;Lo;0;L;;;;;N;;;;;
+167B;CANADIAN SYLLABICS WOODS-CREE THWOO;Lo;0;L;;;;;N;;;;;
+167C;CANADIAN SYLLABICS WOODS-CREE THWA;Lo;0;L;;;;;N;;;;;
+167D;CANADIAN SYLLABICS WOODS-CREE THWAA;Lo;0;L;;;;;N;;;;;
+167E;CANADIAN SYLLABICS WOODS-CREE FINAL TH;Lo;0;L;;;;;N;;;;;
+167F;CANADIAN SYLLABICS BLACKFOOT W;Lo;0;L;;;;;N;;;;;
+1680;OGHAM SPACE MARK;Zs;0;WS;;;;;N;;;;;
+1681;OGHAM LETTER BEITH;Lo;0;L;;;;;N;;;;;
+1682;OGHAM LETTER LUIS;Lo;0;L;;;;;N;;;;;
+1683;OGHAM LETTER FEARN;Lo;0;L;;;;;N;;;;;
+1684;OGHAM LETTER SAIL;Lo;0;L;;;;;N;;;;;
+1685;OGHAM LETTER NION;Lo;0;L;;;;;N;;;;;
+1686;OGHAM LETTER UATH;Lo;0;L;;;;;N;;;;;
+1687;OGHAM LETTER DAIR;Lo;0;L;;;;;N;;;;;
+1688;OGHAM LETTER TINNE;Lo;0;L;;;;;N;;;;;
+1689;OGHAM LETTER COLL;Lo;0;L;;;;;N;;;;;
+168A;OGHAM LETTER CEIRT;Lo;0;L;;;;;N;;;;;
+168B;OGHAM LETTER MUIN;Lo;0;L;;;;;N;;;;;
+168C;OGHAM LETTER GORT;Lo;0;L;;;;;N;;;;;
+168D;OGHAM LETTER NGEADAL;Lo;0;L;;;;;N;;;;;
+168E;OGHAM LETTER STRAIF;Lo;0;L;;;;;N;;;;;
+168F;OGHAM LETTER RUIS;Lo;0;L;;;;;N;;;;;
+1690;OGHAM LETTER AILM;Lo;0;L;;;;;N;;;;;
+1691;OGHAM LETTER ONN;Lo;0;L;;;;;N;;;;;
+1692;OGHAM LETTER UR;Lo;0;L;;;;;N;;;;;
+1693;OGHAM LETTER EADHADH;Lo;0;L;;;;;N;;;;;
+1694;OGHAM LETTER IODHADH;Lo;0;L;;;;;N;;;;;
+1695;OGHAM LETTER EABHADH;Lo;0;L;;;;;N;;;;;
+1696;OGHAM LETTER OR;Lo;0;L;;;;;N;;;;;
+1697;OGHAM LETTER UILLEANN;Lo;0;L;;;;;N;;;;;
+1698;OGHAM LETTER IFIN;Lo;0;L;;;;;N;;;;;
+1699;OGHAM LETTER EAMHANCHOLL;Lo;0;L;;;;;N;;;;;
+169A;OGHAM LETTER PEITH;Lo;0;L;;;;;N;;;;;
+169B;OGHAM FEATHER MARK;Ps;0;ON;;;;;Y;;;;;
+169C;OGHAM REVERSED FEATHER MARK;Pe;0;ON;;;;;Y;;;;;
+16A0;RUNIC LETTER FEHU FEOH FE F;Lo;0;L;;;;;N;;;;;
+16A1;RUNIC LETTER V;Lo;0;L;;;;;N;;;;;
+16A2;RUNIC LETTER URUZ UR U;Lo;0;L;;;;;N;;;;;
+16A3;RUNIC LETTER YR;Lo;0;L;;;;;N;;;;;
+16A4;RUNIC LETTER Y;Lo;0;L;;;;;N;;;;;
+16A5;RUNIC LETTER W;Lo;0;L;;;;;N;;;;;
+16A6;RUNIC LETTER THURISAZ THURS THORN;Lo;0;L;;;;;N;;;;;
+16A7;RUNIC LETTER ETH;Lo;0;L;;;;;N;;;;;
+16A8;RUNIC LETTER ANSUZ A;Lo;0;L;;;;;N;;;;;
+16A9;RUNIC LETTER OS O;Lo;0;L;;;;;N;;;;;
+16AA;RUNIC LETTER AC A;Lo;0;L;;;;;N;;;;;
+16AB;RUNIC LETTER AESC;Lo;0;L;;;;;N;;;;;
+16AC;RUNIC LETTER LONG-BRANCH-OSS O;Lo;0;L;;;;;N;;;;;
+16AD;RUNIC LETTER SHORT-TWIG-OSS O;Lo;0;L;;;;;N;;;;;
+16AE;RUNIC LETTER O;Lo;0;L;;;;;N;;;;;
+16AF;RUNIC LETTER OE;Lo;0;L;;;;;N;;;;;
+16B0;RUNIC LETTER ON;Lo;0;L;;;;;N;;;;;
+16B1;RUNIC LETTER RAIDO RAD REID R;Lo;0;L;;;;;N;;;;;
+16B2;RUNIC LETTER KAUNA;Lo;0;L;;;;;N;;;;;
+16B3;RUNIC LETTER CEN;Lo;0;L;;;;;N;;;;;
+16B4;RUNIC LETTER KAUN K;Lo;0;L;;;;;N;;;;;
+16B5;RUNIC LETTER G;Lo;0;L;;;;;N;;;;;
+16B6;RUNIC LETTER ENG;Lo;0;L;;;;;N;;;;;
+16B7;RUNIC LETTER GEBO GYFU G;Lo;0;L;;;;;N;;;;;
+16B8;RUNIC LETTER GAR;Lo;0;L;;;;;N;;;;;
+16B9;RUNIC LETTER WUNJO WYNN W;Lo;0;L;;;;;N;;;;;
+16BA;RUNIC LETTER HAGLAZ H;Lo;0;L;;;;;N;;;;;
+16BB;RUNIC LETTER HAEGL H;Lo;0;L;;;;;N;;;;;
+16BC;RUNIC LETTER LONG-BRANCH-HAGALL H;Lo;0;L;;;;;N;;;;;
+16BD;RUNIC LETTER SHORT-TWIG-HAGALL H;Lo;0;L;;;;;N;;;;;
+16BE;RUNIC LETTER NAUDIZ NYD NAUD N;Lo;0;L;;;;;N;;;;;
+16BF;RUNIC LETTER SHORT-TWIG-NAUD N;Lo;0;L;;;;;N;;;;;
+16C0;RUNIC LETTER DOTTED-N;Lo;0;L;;;;;N;;;;;
+16C1;RUNIC LETTER ISAZ IS ISS I;Lo;0;L;;;;;N;;;;;
+16C2;RUNIC LETTER E;Lo;0;L;;;;;N;;;;;
+16C3;RUNIC LETTER JERAN J;Lo;0;L;;;;;N;;;;;
+16C4;RUNIC LETTER GER;Lo;0;L;;;;;N;;;;;
+16C5;RUNIC LETTER LONG-BRANCH-AR AE;Lo;0;L;;;;;N;;;;;
+16C6;RUNIC LETTER SHORT-TWIG-AR A;Lo;0;L;;;;;N;;;;;
+16C7;RUNIC LETTER IWAZ EOH;Lo;0;L;;;;;N;;;;;
+16C8;RUNIC LETTER PERTHO PEORTH P;Lo;0;L;;;;;N;;;;;
+16C9;RUNIC LETTER ALGIZ EOLHX;Lo;0;L;;;;;N;;;;;
+16CA;RUNIC LETTER SOWILO S;Lo;0;L;;;;;N;;;;;
+16CB;RUNIC LETTER SIGEL LONG-BRANCH-SOL S;Lo;0;L;;;;;N;;;;;
+16CC;RUNIC LETTER SHORT-TWIG-SOL S;Lo;0;L;;;;;N;;;;;
+16CD;RUNIC LETTER C;Lo;0;L;;;;;N;;;;;
+16CE;RUNIC LETTER Z;Lo;0;L;;;;;N;;;;;
+16CF;RUNIC LETTER TIWAZ TIR TYR T;Lo;0;L;;;;;N;;;;;
+16D0;RUNIC LETTER SHORT-TWIG-TYR T;Lo;0;L;;;;;N;;;;;
+16D1;RUNIC LETTER D;Lo;0;L;;;;;N;;;;;
+16D2;RUNIC LETTER BERKANAN BEORC BJARKAN B;Lo;0;L;;;;;N;;;;;
+16D3;RUNIC LETTER SHORT-TWIG-BJARKAN B;Lo;0;L;;;;;N;;;;;
+16D4;RUNIC LETTER DOTTED-P;Lo;0;L;;;;;N;;;;;
+16D5;RUNIC LETTER OPEN-P;Lo;0;L;;;;;N;;;;;
+16D6;RUNIC LETTER EHWAZ EH E;Lo;0;L;;;;;N;;;;;
+16D7;RUNIC LETTER MANNAZ MAN M;Lo;0;L;;;;;N;;;;;
+16D8;RUNIC LETTER LONG-BRANCH-MADR M;Lo;0;L;;;;;N;;;;;
+16D9;RUNIC LETTER SHORT-TWIG-MADR M;Lo;0;L;;;;;N;;;;;
+16DA;RUNIC LETTER LAUKAZ LAGU LOGR L;Lo;0;L;;;;;N;;;;;
+16DB;RUNIC LETTER DOTTED-L;Lo;0;L;;;;;N;;;;;
+16DC;RUNIC LETTER INGWAZ;Lo;0;L;;;;;N;;;;;
+16DD;RUNIC LETTER ING;Lo;0;L;;;;;N;;;;;
+16DE;RUNIC LETTER DAGAZ DAEG D;Lo;0;L;;;;;N;;;;;
+16DF;RUNIC LETTER OTHALAN ETHEL O;Lo;0;L;;;;;N;;;;;
+16E0;RUNIC LETTER EAR;Lo;0;L;;;;;N;;;;;
+16E1;RUNIC LETTER IOR;Lo;0;L;;;;;N;;;;;
+16E2;RUNIC LETTER CWEORTH;Lo;0;L;;;;;N;;;;;
+16E3;RUNIC LETTER CALC;Lo;0;L;;;;;N;;;;;
+16E4;RUNIC LETTER CEALC;Lo;0;L;;;;;N;;;;;
+16E5;RUNIC LETTER STAN;Lo;0;L;;;;;N;;;;;
+16E6;RUNIC LETTER LONG-BRANCH-YR;Lo;0;L;;;;;N;;;;;
+16E7;RUNIC LETTER SHORT-TWIG-YR;Lo;0;L;;;;;N;;;;;
+16E8;RUNIC LETTER ICELANDIC-YR;Lo;0;L;;;;;N;;;;;
+16E9;RUNIC LETTER Q;Lo;0;L;;;;;N;;;;;
+16EA;RUNIC LETTER X;Lo;0;L;;;;;N;;;;;
+16EB;RUNIC SINGLE PUNCTUATION;Po;0;L;;;;;N;;;;;
+16EC;RUNIC MULTIPLE PUNCTUATION;Po;0;L;;;;;N;;;;;
+16ED;RUNIC CROSS PUNCTUATION;Po;0;L;;;;;N;;;;;
+16EE;RUNIC ARLAUG SYMBOL;Nl;0;L;;;;17;N;;;;;
+16EF;RUNIC TVIMADUR SYMBOL;Nl;0;L;;;;18;N;;;;;
+16F0;RUNIC BELGTHOR SYMBOL;Nl;0;L;;;;19;N;;;;;
+16F1;RUNIC LETTER K;Lo;0;L;;;;;N;;;;;
+16F2;RUNIC LETTER SH;Lo;0;L;;;;;N;;;;;
+16F3;RUNIC LETTER OO;Lo;0;L;;;;;N;;;;;
+16F4;RUNIC LETTER FRANKS CASKET OS;Lo;0;L;;;;;N;;;;;
+16F5;RUNIC LETTER FRANKS CASKET IS;Lo;0;L;;;;;N;;;;;
+16F6;RUNIC LETTER FRANKS CASKET EH;Lo;0;L;;;;;N;;;;;
+16F7;RUNIC LETTER FRANKS CASKET AC;Lo;0;L;;;;;N;;;;;
+16F8;RUNIC LETTER FRANKS CASKET AESC;Lo;0;L;;;;;N;;;;;
+1700;TAGALOG LETTER A;Lo;0;L;;;;;N;;;;;
+1701;TAGALOG LETTER I;Lo;0;L;;;;;N;;;;;
+1702;TAGALOG LETTER U;Lo;0;L;;;;;N;;;;;
+1703;TAGALOG LETTER KA;Lo;0;L;;;;;N;;;;;
+1704;TAGALOG LETTER GA;Lo;0;L;;;;;N;;;;;
+1705;TAGALOG LETTER NGA;Lo;0;L;;;;;N;;;;;
+1706;TAGALOG LETTER TA;Lo;0;L;;;;;N;;;;;
+1707;TAGALOG LETTER DA;Lo;0;L;;;;;N;;;;;
+1708;TAGALOG LETTER NA;Lo;0;L;;;;;N;;;;;
+1709;TAGALOG LETTER PA;Lo;0;L;;;;;N;;;;;
+170A;TAGALOG LETTER BA;Lo;0;L;;;;;N;;;;;
+170B;TAGALOG LETTER MA;Lo;0;L;;;;;N;;;;;
+170C;TAGALOG LETTER YA;Lo;0;L;;;;;N;;;;;
+170E;TAGALOG LETTER LA;Lo;0;L;;;;;N;;;;;
+170F;TAGALOG LETTER WA;Lo;0;L;;;;;N;;;;;
+1710;TAGALOG LETTER SA;Lo;0;L;;;;;N;;;;;
+1711;TAGALOG LETTER HA;Lo;0;L;;;;;N;;;;;
+1712;TAGALOG VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+1713;TAGALOG VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+1714;TAGALOG SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+1720;HANUNOO LETTER A;Lo;0;L;;;;;N;;;;;
+1721;HANUNOO LETTER I;Lo;0;L;;;;;N;;;;;
+1722;HANUNOO LETTER U;Lo;0;L;;;;;N;;;;;
+1723;HANUNOO LETTER KA;Lo;0;L;;;;;N;;;;;
+1724;HANUNOO LETTER GA;Lo;0;L;;;;;N;;;;;
+1725;HANUNOO LETTER NGA;Lo;0;L;;;;;N;;;;;
+1726;HANUNOO LETTER TA;Lo;0;L;;;;;N;;;;;
+1727;HANUNOO LETTER DA;Lo;0;L;;;;;N;;;;;
+1728;HANUNOO LETTER NA;Lo;0;L;;;;;N;;;;;
+1729;HANUNOO LETTER PA;Lo;0;L;;;;;N;;;;;
+172A;HANUNOO LETTER BA;Lo;0;L;;;;;N;;;;;
+172B;HANUNOO LETTER MA;Lo;0;L;;;;;N;;;;;
+172C;HANUNOO LETTER YA;Lo;0;L;;;;;N;;;;;
+172D;HANUNOO LETTER RA;Lo;0;L;;;;;N;;;;;
+172E;HANUNOO LETTER LA;Lo;0;L;;;;;N;;;;;
+172F;HANUNOO LETTER WA;Lo;0;L;;;;;N;;;;;
+1730;HANUNOO LETTER SA;Lo;0;L;;;;;N;;;;;
+1731;HANUNOO LETTER HA;Lo;0;L;;;;;N;;;;;
+1732;HANUNOO VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+1733;HANUNOO VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+1734;HANUNOO SIGN PAMUDPOD;Mn;9;NSM;;;;;N;;;;;
+1735;PHILIPPINE SINGLE PUNCTUATION;Po;0;L;;;;;N;;;;;
+1736;PHILIPPINE DOUBLE PUNCTUATION;Po;0;L;;;;;N;;;;;
+1740;BUHID LETTER A;Lo;0;L;;;;;N;;;;;
+1741;BUHID LETTER I;Lo;0;L;;;;;N;;;;;
+1742;BUHID LETTER U;Lo;0;L;;;;;N;;;;;
+1743;BUHID LETTER KA;Lo;0;L;;;;;N;;;;;
+1744;BUHID LETTER GA;Lo;0;L;;;;;N;;;;;
+1745;BUHID LETTER NGA;Lo;0;L;;;;;N;;;;;
+1746;BUHID LETTER TA;Lo;0;L;;;;;N;;;;;
+1747;BUHID LETTER DA;Lo;0;L;;;;;N;;;;;
+1748;BUHID LETTER NA;Lo;0;L;;;;;N;;;;;
+1749;BUHID LETTER PA;Lo;0;L;;;;;N;;;;;
+174A;BUHID LETTER BA;Lo;0;L;;;;;N;;;;;
+174B;BUHID LETTER MA;Lo;0;L;;;;;N;;;;;
+174C;BUHID LETTER YA;Lo;0;L;;;;;N;;;;;
+174D;BUHID LETTER RA;Lo;0;L;;;;;N;;;;;
+174E;BUHID LETTER LA;Lo;0;L;;;;;N;;;;;
+174F;BUHID LETTER WA;Lo;0;L;;;;;N;;;;;
+1750;BUHID LETTER SA;Lo;0;L;;;;;N;;;;;
+1751;BUHID LETTER HA;Lo;0;L;;;;;N;;;;;
+1752;BUHID VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+1753;BUHID VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+1760;TAGBANWA LETTER A;Lo;0;L;;;;;N;;;;;
+1761;TAGBANWA LETTER I;Lo;0;L;;;;;N;;;;;
+1762;TAGBANWA LETTER U;Lo;0;L;;;;;N;;;;;
+1763;TAGBANWA LETTER KA;Lo;0;L;;;;;N;;;;;
+1764;TAGBANWA LETTER GA;Lo;0;L;;;;;N;;;;;
+1765;TAGBANWA LETTER NGA;Lo;0;L;;;;;N;;;;;
+1766;TAGBANWA LETTER TA;Lo;0;L;;;;;N;;;;;
+1767;TAGBANWA LETTER DA;Lo;0;L;;;;;N;;;;;
+1768;TAGBANWA LETTER NA;Lo;0;L;;;;;N;;;;;
+1769;TAGBANWA LETTER PA;Lo;0;L;;;;;N;;;;;
+176A;TAGBANWA LETTER BA;Lo;0;L;;;;;N;;;;;
+176B;TAGBANWA LETTER MA;Lo;0;L;;;;;N;;;;;
+176C;TAGBANWA LETTER YA;Lo;0;L;;;;;N;;;;;
+176E;TAGBANWA LETTER LA;Lo;0;L;;;;;N;;;;;
+176F;TAGBANWA LETTER WA;Lo;0;L;;;;;N;;;;;
+1770;TAGBANWA LETTER SA;Lo;0;L;;;;;N;;;;;
+1772;TAGBANWA VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+1773;TAGBANWA VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+1780;KHMER LETTER KA;Lo;0;L;;;;;N;;;;;
+1781;KHMER LETTER KHA;Lo;0;L;;;;;N;;;;;
+1782;KHMER LETTER KO;Lo;0;L;;;;;N;;;;;
+1783;KHMER LETTER KHO;Lo;0;L;;;;;N;;;;;
+1784;KHMER LETTER NGO;Lo;0;L;;;;;N;;;;;
+1785;KHMER LETTER CA;Lo;0;L;;;;;N;;;;;
+1786;KHMER LETTER CHA;Lo;0;L;;;;;N;;;;;
+1787;KHMER LETTER CO;Lo;0;L;;;;;N;;;;;
+1788;KHMER LETTER CHO;Lo;0;L;;;;;N;;;;;
+1789;KHMER LETTER NYO;Lo;0;L;;;;;N;;;;;
+178A;KHMER LETTER DA;Lo;0;L;;;;;N;;;;;
+178B;KHMER LETTER TTHA;Lo;0;L;;;;;N;;;;;
+178C;KHMER LETTER DO;Lo;0;L;;;;;N;;;;;
+178D;KHMER LETTER TTHO;Lo;0;L;;;;;N;;;;;
+178E;KHMER LETTER NNO;Lo;0;L;;;;;N;;;;;
+178F;KHMER LETTER TA;Lo;0;L;;;;;N;;;;;
+1790;KHMER LETTER THA;Lo;0;L;;;;;N;;;;;
+1791;KHMER LETTER TO;Lo;0;L;;;;;N;;;;;
+1792;KHMER LETTER THO;Lo;0;L;;;;;N;;;;;
+1793;KHMER LETTER NO;Lo;0;L;;;;;N;;;;;
+1794;KHMER LETTER BA;Lo;0;L;;;;;N;;;;;
+1795;KHMER LETTER PHA;Lo;0;L;;;;;N;;;;;
+1796;KHMER LETTER PO;Lo;0;L;;;;;N;;;;;
+1797;KHMER LETTER PHO;Lo;0;L;;;;;N;;;;;
+1798;KHMER LETTER MO;Lo;0;L;;;;;N;;;;;
+1799;KHMER LETTER YO;Lo;0;L;;;;;N;;;;;
+179A;KHMER LETTER RO;Lo;0;L;;;;;N;;;;;
+179B;KHMER LETTER LO;Lo;0;L;;;;;N;;;;;
+179C;KHMER LETTER VO;Lo;0;L;;;;;N;;;;;
+179D;KHMER LETTER SHA;Lo;0;L;;;;;N;;;;;
+179E;KHMER LETTER SSO;Lo;0;L;;;;;N;;;;;
+179F;KHMER LETTER SA;Lo;0;L;;;;;N;;;;;
+17A0;KHMER LETTER HA;Lo;0;L;;;;;N;;;;;
+17A1;KHMER LETTER LA;Lo;0;L;;;;;N;;;;;
+17A2;KHMER LETTER QA;Lo;0;L;;;;;N;;;;;
+17A3;KHMER INDEPENDENT VOWEL QAQ;Lo;0;L;;;;;N;;;;;
+17A4;KHMER INDEPENDENT VOWEL QAA;Lo;0;L;;;;;N;;;;;
+17A5;KHMER INDEPENDENT VOWEL QI;Lo;0;L;;;;;N;;;;;
+17A6;KHMER INDEPENDENT VOWEL QII;Lo;0;L;;;;;N;;;;;
+17A7;KHMER INDEPENDENT VOWEL QU;Lo;0;L;;;;;N;;;;;
+17A8;KHMER INDEPENDENT VOWEL QUK;Lo;0;L;;;;;N;;;;;
+17A9;KHMER INDEPENDENT VOWEL QUU;Lo;0;L;;;;;N;;;;;
+17AA;KHMER INDEPENDENT VOWEL QUUV;Lo;0;L;;;;;N;;;;;
+17AB;KHMER INDEPENDENT VOWEL RY;Lo;0;L;;;;;N;;;;;
+17AC;KHMER INDEPENDENT VOWEL RYY;Lo;0;L;;;;;N;;;;;
+17AD;KHMER INDEPENDENT VOWEL LY;Lo;0;L;;;;;N;;;;;
+17AE;KHMER INDEPENDENT VOWEL LYY;Lo;0;L;;;;;N;;;;;
+17AF;KHMER INDEPENDENT VOWEL QE;Lo;0;L;;;;;N;;;;;
+17B0;KHMER INDEPENDENT VOWEL QAI;Lo;0;L;;;;;N;;;;;
+17B1;KHMER INDEPENDENT VOWEL QOO TYPE ONE;Lo;0;L;;;;;N;;;;;
+17B2;KHMER INDEPENDENT VOWEL QOO TYPE TWO;Lo;0;L;;;;;N;;;;;
+17B3;KHMER INDEPENDENT VOWEL QAU;Lo;0;L;;;;;N;;;;;
+17B4;KHMER VOWEL INHERENT AQ;Mn;0;NSM;;;;;N;;;;;
+17B5;KHMER VOWEL INHERENT AA;Mn;0;NSM;;;;;N;;;;;
+17B6;KHMER VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+17B7;KHMER VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+17B8;KHMER VOWEL SIGN II;Mn;0;NSM;;;;;N;;;;;
+17B9;KHMER VOWEL SIGN Y;Mn;0;NSM;;;;;N;;;;;
+17BA;KHMER VOWEL SIGN YY;Mn;0;NSM;;;;;N;;;;;
+17BB;KHMER VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+17BC;KHMER VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+17BD;KHMER VOWEL SIGN UA;Mn;0;NSM;;;;;N;;;;;
+17BE;KHMER VOWEL SIGN OE;Mc;0;L;;;;;N;;;;;
+17BF;KHMER VOWEL SIGN YA;Mc;0;L;;;;;N;;;;;
+17C0;KHMER VOWEL SIGN IE;Mc;0;L;;;;;N;;;;;
+17C1;KHMER VOWEL SIGN E;Mc;0;L;;;;;N;;;;;
+17C2;KHMER VOWEL SIGN AE;Mc;0;L;;;;;N;;;;;
+17C3;KHMER VOWEL SIGN AI;Mc;0;L;;;;;N;;;;;
+17C4;KHMER VOWEL SIGN OO;Mc;0;L;;;;;N;;;;;
+17C5;KHMER VOWEL SIGN AU;Mc;0;L;;;;;N;;;;;
+17C6;KHMER SIGN NIKAHIT;Mn;0;NSM;;;;;N;;;;;
+17C7;KHMER SIGN REAHMUK;Mc;0;L;;;;;N;;;;;
+17C8;KHMER SIGN YUUKALEAPINTU;Mc;0;L;;;;;N;;;;;
+17C9;KHMER SIGN MUUSIKATOAN;Mn;0;NSM;;;;;N;;;;;
+17CA;KHMER SIGN TRIISAP;Mn;0;NSM;;;;;N;;;;;
+17CB;KHMER SIGN BANTOC;Mn;0;NSM;;;;;N;;;;;
+17CC;KHMER SIGN ROBAT;Mn;0;NSM;;;;;N;;;;;
+17CD;KHMER SIGN TOANDAKHIAT;Mn;0;NSM;;;;;N;;;;;
+17CE;KHMER SIGN KAKABAT;Mn;0;NSM;;;;;N;;;;;
+17CF;KHMER SIGN AHSDA;Mn;0;NSM;;;;;N;;;;;
+17D0;KHMER SIGN SAMYOK SANNYA;Mn;0;NSM;;;;;N;;;;;
+17D1;KHMER SIGN VIRIAM;Mn;0;NSM;;;;;N;;;;;
+17D2;KHMER SIGN COENG;Mn;9;NSM;;;;;N;;;;;
+17D3;KHMER SIGN BATHAMASAT;Mn;0;NSM;;;;;N;;;;;
+17D4;KHMER SIGN KHAN;Po;0;L;;;;;N;;;;;
+17D5;KHMER SIGN BARIYOOSAN;Po;0;L;;;;;N;;;;;
+17D6;KHMER SIGN CAMNUC PII KUUH;Po;0;L;;;;;N;;;;;
+17D7;KHMER SIGN LEK TOO;Lm;0;L;;;;;N;;;;;
+17D8;KHMER SIGN BEYYAL;Po;0;L;;;;;N;;;;;
+17D9;KHMER SIGN PHNAEK MUAN;Po;0;L;;;;;N;;;;;
+17DA;KHMER SIGN KOOMUUT;Po;0;L;;;;;N;;;;;
+17DB;KHMER CURRENCY SYMBOL RIEL;Sc;0;ET;;;;;N;;;;;
+17DC;KHMER SIGN AVAKRAHASANYA;Lo;0;L;;;;;N;;;;;
+17DD;KHMER SIGN ATTHACAN;Mn;230;NSM;;;;;N;;;;;
+17E0;KHMER DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+17E1;KHMER DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+17E2;KHMER DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+17E3;KHMER DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+17E4;KHMER DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+17E5;KHMER DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+17E6;KHMER DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+17E7;KHMER DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+17E8;KHMER DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+17E9;KHMER DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+17F0;KHMER SYMBOL LEK ATTAK SON;No;0;ON;;;;0;N;;;;;
+17F1;KHMER SYMBOL LEK ATTAK MUOY;No;0;ON;;;;1;N;;;;;
+17F2;KHMER SYMBOL LEK ATTAK PII;No;0;ON;;;;2;N;;;;;
+17F3;KHMER SYMBOL LEK ATTAK BEI;No;0;ON;;;;3;N;;;;;
+17F4;KHMER SYMBOL LEK ATTAK BUON;No;0;ON;;;;4;N;;;;;
+17F5;KHMER SYMBOL LEK ATTAK PRAM;No;0;ON;;;;5;N;;;;;
+17F6;KHMER SYMBOL LEK ATTAK PRAM-MUOY;No;0;ON;;;;6;N;;;;;
+17F7;KHMER SYMBOL LEK ATTAK PRAM-PII;No;0;ON;;;;7;N;;;;;
+17F8;KHMER SYMBOL LEK ATTAK PRAM-BEI;No;0;ON;;;;8;N;;;;;
+17F9;KHMER SYMBOL LEK ATTAK PRAM-BUON;No;0;ON;;;;9;N;;;;;
+1800;MONGOLIAN BIRGA;Po;0;ON;;;;;N;;;;;
+1801;MONGOLIAN ELLIPSIS;Po;0;ON;;;;;N;;;;;
+1802;MONGOLIAN COMMA;Po;0;ON;;;;;N;;;;;
+1803;MONGOLIAN FULL STOP;Po;0;ON;;;;;N;;;;;
+1804;MONGOLIAN COLON;Po;0;ON;;;;;N;;;;;
+1805;MONGOLIAN FOUR DOTS;Po;0;ON;;;;;N;;;;;
+1806;MONGOLIAN TODO SOFT HYPHEN;Pd;0;ON;;;;;N;;;;;
+1807;MONGOLIAN SIBE SYLLABLE BOUNDARY MARKER;Po;0;ON;;;;;N;;;;;
+1808;MONGOLIAN MANCHU COMMA;Po;0;ON;;;;;N;;;;;
+1809;MONGOLIAN MANCHU FULL STOP;Po;0;ON;;;;;N;;;;;
+180A;MONGOLIAN NIRUGU;Po;0;ON;;;;;N;;;;;
+180B;MONGOLIAN FREE VARIATION SELECTOR ONE;Mn;0;NSM;;;;;N;;;;;
+180C;MONGOLIAN FREE VARIATION SELECTOR TWO;Mn;0;NSM;;;;;N;;;;;
+180D;MONGOLIAN FREE VARIATION SELECTOR THREE;Mn;0;NSM;;;;;N;;;;;
+180E;MONGOLIAN VOWEL SEPARATOR;Cf;0;BN;;;;;N;;;;;
+1810;MONGOLIAN DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+1811;MONGOLIAN DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+1812;MONGOLIAN DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+1813;MONGOLIAN DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+1814;MONGOLIAN DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+1815;MONGOLIAN DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+1816;MONGOLIAN DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+1817;MONGOLIAN DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+1818;MONGOLIAN DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+1819;MONGOLIAN DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+1820;MONGOLIAN LETTER A;Lo;0;L;;;;;N;;;;;
+1821;MONGOLIAN LETTER E;Lo;0;L;;;;;N;;;;;
+1822;MONGOLIAN LETTER I;Lo;0;L;;;;;N;;;;;
+1823;MONGOLIAN LETTER O;Lo;0;L;;;;;N;;;;;
+1824;MONGOLIAN LETTER U;Lo;0;L;;;;;N;;;;;
+1825;MONGOLIAN LETTER OE;Lo;0;L;;;;;N;;;;;
+1826;MONGOLIAN LETTER UE;Lo;0;L;;;;;N;;;;;
+1827;MONGOLIAN LETTER EE;Lo;0;L;;;;;N;;;;;
+1828;MONGOLIAN LETTER NA;Lo;0;L;;;;;N;;;;;
+1829;MONGOLIAN LETTER ANG;Lo;0;L;;;;;N;;;;;
+182A;MONGOLIAN LETTER BA;Lo;0;L;;;;;N;;;;;
+182B;MONGOLIAN LETTER PA;Lo;0;L;;;;;N;;;;;
+182C;MONGOLIAN LETTER QA;Lo;0;L;;;;;N;;;;;
+182D;MONGOLIAN LETTER GA;Lo;0;L;;;;;N;;;;;
+182E;MONGOLIAN LETTER MA;Lo;0;L;;;;;N;;;;;
+182F;MONGOLIAN LETTER LA;Lo;0;L;;;;;N;;;;;
+1830;MONGOLIAN LETTER SA;Lo;0;L;;;;;N;;;;;
+1831;MONGOLIAN LETTER SHA;Lo;0;L;;;;;N;;;;;
+1832;MONGOLIAN LETTER TA;Lo;0;L;;;;;N;;;;;
+1833;MONGOLIAN LETTER DA;Lo;0;L;;;;;N;;;;;
+1834;MONGOLIAN LETTER CHA;Lo;0;L;;;;;N;;;;;
+1835;MONGOLIAN LETTER JA;Lo;0;L;;;;;N;;;;;
+1836;MONGOLIAN LETTER YA;Lo;0;L;;;;;N;;;;;
+1837;MONGOLIAN LETTER RA;Lo;0;L;;;;;N;;;;;
+1838;MONGOLIAN LETTER WA;Lo;0;L;;;;;N;;;;;
+1839;MONGOLIAN LETTER FA;Lo;0;L;;;;;N;;;;;
+183A;MONGOLIAN LETTER KA;Lo;0;L;;;;;N;;;;;
+183B;MONGOLIAN LETTER KHA;Lo;0;L;;;;;N;;;;;
+183C;MONGOLIAN LETTER TSA;Lo;0;L;;;;;N;;;;;
+183D;MONGOLIAN LETTER ZA;Lo;0;L;;;;;N;;;;;
+183E;MONGOLIAN LETTER HAA;Lo;0;L;;;;;N;;;;;
+183F;MONGOLIAN LETTER ZRA;Lo;0;L;;;;;N;;;;;
+1840;MONGOLIAN LETTER LHA;Lo;0;L;;;;;N;;;;;
+1841;MONGOLIAN LETTER ZHI;Lo;0;L;;;;;N;;;;;
+1842;MONGOLIAN LETTER CHI;Lo;0;L;;;;;N;;;;;
+1843;MONGOLIAN LETTER TODO LONG VOWEL SIGN;Lm;0;L;;;;;N;;;;;
+1844;MONGOLIAN LETTER TODO E;Lo;0;L;;;;;N;;;;;
+1845;MONGOLIAN LETTER TODO I;Lo;0;L;;;;;N;;;;;
+1846;MONGOLIAN LETTER TODO O;Lo;0;L;;;;;N;;;;;
+1847;MONGOLIAN LETTER TODO U;Lo;0;L;;;;;N;;;;;
+1848;MONGOLIAN LETTER TODO OE;Lo;0;L;;;;;N;;;;;
+1849;MONGOLIAN LETTER TODO UE;Lo;0;L;;;;;N;;;;;
+184A;MONGOLIAN LETTER TODO ANG;Lo;0;L;;;;;N;;;;;
+184B;MONGOLIAN LETTER TODO BA;Lo;0;L;;;;;N;;;;;
+184C;MONGOLIAN LETTER TODO PA;Lo;0;L;;;;;N;;;;;
+184D;MONGOLIAN LETTER TODO QA;Lo;0;L;;;;;N;;;;;
+184E;MONGOLIAN LETTER TODO GA;Lo;0;L;;;;;N;;;;;
+184F;MONGOLIAN LETTER TODO MA;Lo;0;L;;;;;N;;;;;
+1850;MONGOLIAN LETTER TODO TA;Lo;0;L;;;;;N;;;;;
+1851;MONGOLIAN LETTER TODO DA;Lo;0;L;;;;;N;;;;;
+1852;MONGOLIAN LETTER TODO CHA;Lo;0;L;;;;;N;;;;;
+1853;MONGOLIAN LETTER TODO JA;Lo;0;L;;;;;N;;;;;
+1854;MONGOLIAN LETTER TODO TSA;Lo;0;L;;;;;N;;;;;
+1855;MONGOLIAN LETTER TODO YA;Lo;0;L;;;;;N;;;;;
+1856;MONGOLIAN LETTER TODO WA;Lo;0;L;;;;;N;;;;;
+1857;MONGOLIAN LETTER TODO KA;Lo;0;L;;;;;N;;;;;
+1858;MONGOLIAN LETTER TODO GAA;Lo;0;L;;;;;N;;;;;
+1859;MONGOLIAN LETTER TODO HAA;Lo;0;L;;;;;N;;;;;
+185A;MONGOLIAN LETTER TODO JIA;Lo;0;L;;;;;N;;;;;
+185B;MONGOLIAN LETTER TODO NIA;Lo;0;L;;;;;N;;;;;
+185C;MONGOLIAN LETTER TODO DZA;Lo;0;L;;;;;N;;;;;
+185D;MONGOLIAN LETTER SIBE E;Lo;0;L;;;;;N;;;;;
+185E;MONGOLIAN LETTER SIBE I;Lo;0;L;;;;;N;;;;;
+185F;MONGOLIAN LETTER SIBE IY;Lo;0;L;;;;;N;;;;;
+1860;MONGOLIAN LETTER SIBE UE;Lo;0;L;;;;;N;;;;;
+1861;MONGOLIAN LETTER SIBE U;Lo;0;L;;;;;N;;;;;
+1862;MONGOLIAN LETTER SIBE ANG;Lo;0;L;;;;;N;;;;;
+1863;MONGOLIAN LETTER SIBE KA;Lo;0;L;;;;;N;;;;;
+1864;MONGOLIAN LETTER SIBE GA;Lo;0;L;;;;;N;;;;;
+1865;MONGOLIAN LETTER SIBE HA;Lo;0;L;;;;;N;;;;;
+1866;MONGOLIAN LETTER SIBE PA;Lo;0;L;;;;;N;;;;;
+1867;MONGOLIAN LETTER SIBE SHA;Lo;0;L;;;;;N;;;;;
+1868;MONGOLIAN LETTER SIBE TA;Lo;0;L;;;;;N;;;;;
+1869;MONGOLIAN LETTER SIBE DA;Lo;0;L;;;;;N;;;;;
+186A;MONGOLIAN LETTER SIBE JA;Lo;0;L;;;;;N;;;;;
+186B;MONGOLIAN LETTER SIBE FA;Lo;0;L;;;;;N;;;;;
+186C;MONGOLIAN LETTER SIBE GAA;Lo;0;L;;;;;N;;;;;
+186D;MONGOLIAN LETTER SIBE HAA;Lo;0;L;;;;;N;;;;;
+186E;MONGOLIAN LETTER SIBE TSA;Lo;0;L;;;;;N;;;;;
+186F;MONGOLIAN LETTER SIBE ZA;Lo;0;L;;;;;N;;;;;
+1870;MONGOLIAN LETTER SIBE RAA;Lo;0;L;;;;;N;;;;;
+1871;MONGOLIAN LETTER SIBE CHA;Lo;0;L;;;;;N;;;;;
+1872;MONGOLIAN LETTER SIBE ZHA;Lo;0;L;;;;;N;;;;;
+1873;MONGOLIAN LETTER MANCHU I;Lo;0;L;;;;;N;;;;;
+1874;MONGOLIAN LETTER MANCHU KA;Lo;0;L;;;;;N;;;;;
+1875;MONGOLIAN LETTER MANCHU RA;Lo;0;L;;;;;N;;;;;
+1876;MONGOLIAN LETTER MANCHU FA;Lo;0;L;;;;;N;;;;;
+1877;MONGOLIAN LETTER MANCHU ZHA;Lo;0;L;;;;;N;;;;;
+1880;MONGOLIAN LETTER ALI GALI ANUSVARA ONE;Lo;0;L;;;;;N;;;;;
+1881;MONGOLIAN LETTER ALI GALI VISARGA ONE;Lo;0;L;;;;;N;;;;;
+1882;MONGOLIAN LETTER ALI GALI DAMARU;Lo;0;L;;;;;N;;;;;
+1883;MONGOLIAN LETTER ALI GALI UBADAMA;Lo;0;L;;;;;N;;;;;
+1884;MONGOLIAN LETTER ALI GALI INVERTED UBADAMA;Lo;0;L;;;;;N;;;;;
+1885;MONGOLIAN LETTER ALI GALI BALUDA;Mn;0;NSM;;;;;N;;;;;
+1886;MONGOLIAN LETTER ALI GALI THREE BALUDA;Mn;0;NSM;;;;;N;;;;;
+1887;MONGOLIAN LETTER ALI GALI A;Lo;0;L;;;;;N;;;;;
+1888;MONGOLIAN LETTER ALI GALI I;Lo;0;L;;;;;N;;;;;
+1889;MONGOLIAN LETTER ALI GALI KA;Lo;0;L;;;;;N;;;;;
+188A;MONGOLIAN LETTER ALI GALI NGA;Lo;0;L;;;;;N;;;;;
+188B;MONGOLIAN LETTER ALI GALI CA;Lo;0;L;;;;;N;;;;;
+188C;MONGOLIAN LETTER ALI GALI TTA;Lo;0;L;;;;;N;;;;;
+188D;MONGOLIAN LETTER ALI GALI TTHA;Lo;0;L;;;;;N;;;;;
+188E;MONGOLIAN LETTER ALI GALI DDA;Lo;0;L;;;;;N;;;;;
+188F;MONGOLIAN LETTER ALI GALI NNA;Lo;0;L;;;;;N;;;;;
+1890;MONGOLIAN LETTER ALI GALI TA;Lo;0;L;;;;;N;;;;;
+1891;MONGOLIAN LETTER ALI GALI DA;Lo;0;L;;;;;N;;;;;
+1892;MONGOLIAN LETTER ALI GALI PA;Lo;0;L;;;;;N;;;;;
+1893;MONGOLIAN LETTER ALI GALI PHA;Lo;0;L;;;;;N;;;;;
+1894;MONGOLIAN LETTER ALI GALI SSA;Lo;0;L;;;;;N;;;;;
+1895;MONGOLIAN LETTER ALI GALI ZHA;Lo;0;L;;;;;N;;;;;
+1896;MONGOLIAN LETTER ALI GALI ZA;Lo;0;L;;;;;N;;;;;
+1897;MONGOLIAN LETTER ALI GALI AH;Lo;0;L;;;;;N;;;;;
+1898;MONGOLIAN LETTER TODO ALI GALI TA;Lo;0;L;;;;;N;;;;;
+1899;MONGOLIAN LETTER TODO ALI GALI ZHA;Lo;0;L;;;;;N;;;;;
+189A;MONGOLIAN LETTER MANCHU ALI GALI GHA;Lo;0;L;;;;;N;;;;;
+189B;MONGOLIAN LETTER MANCHU ALI GALI NGA;Lo;0;L;;;;;N;;;;;
+189C;MONGOLIAN LETTER MANCHU ALI GALI CA;Lo;0;L;;;;;N;;;;;
+189D;MONGOLIAN LETTER MANCHU ALI GALI JHA;Lo;0;L;;;;;N;;;;;
+189E;MONGOLIAN LETTER MANCHU ALI GALI TTA;Lo;0;L;;;;;N;;;;;
+189F;MONGOLIAN LETTER MANCHU ALI GALI DDHA;Lo;0;L;;;;;N;;;;;
+18A0;MONGOLIAN LETTER MANCHU ALI GALI TA;Lo;0;L;;;;;N;;;;;
+18A1;MONGOLIAN LETTER MANCHU ALI GALI DHA;Lo;0;L;;;;;N;;;;;
+18A2;MONGOLIAN LETTER MANCHU ALI GALI SSA;Lo;0;L;;;;;N;;;;;
+18A3;MONGOLIAN LETTER MANCHU ALI GALI CYA;Lo;0;L;;;;;N;;;;;
+18A4;MONGOLIAN LETTER MANCHU ALI GALI ZHA;Lo;0;L;;;;;N;;;;;
+18A5;MONGOLIAN LETTER MANCHU ALI GALI ZA;Lo;0;L;;;;;N;;;;;
+18A6;MONGOLIAN LETTER ALI GALI HALF U;Lo;0;L;;;;;N;;;;;
+18A7;MONGOLIAN LETTER ALI GALI HALF YA;Lo;0;L;;;;;N;;;;;
+18A8;MONGOLIAN LETTER MANCHU ALI GALI BHA;Lo;0;L;;;;;N;;;;;
+18A9;MONGOLIAN LETTER ALI GALI DAGALGA;Mn;228;NSM;;;;;N;;;;;
+18AA;MONGOLIAN LETTER MANCHU ALI GALI LHA;Lo;0;L;;;;;N;;;;;
+18B0;CANADIAN SYLLABICS OY;Lo;0;L;;;;;N;;;;;
+18B1;CANADIAN SYLLABICS AY;Lo;0;L;;;;;N;;;;;
+18B2;CANADIAN SYLLABICS AAY;Lo;0;L;;;;;N;;;;;
+18B3;CANADIAN SYLLABICS WAY;Lo;0;L;;;;;N;;;;;
+18B4;CANADIAN SYLLABICS POY;Lo;0;L;;;;;N;;;;;
+18B5;CANADIAN SYLLABICS PAY;Lo;0;L;;;;;N;;;;;
+18B6;CANADIAN SYLLABICS PWOY;Lo;0;L;;;;;N;;;;;
+18B7;CANADIAN SYLLABICS TAY;Lo;0;L;;;;;N;;;;;
+18B8;CANADIAN SYLLABICS KAY;Lo;0;L;;;;;N;;;;;
+18B9;CANADIAN SYLLABICS KWAY;Lo;0;L;;;;;N;;;;;
+18BA;CANADIAN SYLLABICS MAY;Lo;0;L;;;;;N;;;;;
+18BB;CANADIAN SYLLABICS NOY;Lo;0;L;;;;;N;;;;;
+18BC;CANADIAN SYLLABICS NAY;Lo;0;L;;;;;N;;;;;
+18BD;CANADIAN SYLLABICS LAY;Lo;0;L;;;;;N;;;;;
+18BE;CANADIAN SYLLABICS SOY;Lo;0;L;;;;;N;;;;;
+18BF;CANADIAN SYLLABICS SAY;Lo;0;L;;;;;N;;;;;
+18C0;CANADIAN SYLLABICS SHOY;Lo;0;L;;;;;N;;;;;
+18C1;CANADIAN SYLLABICS SHAY;Lo;0;L;;;;;N;;;;;
+18C2;CANADIAN SYLLABICS SHWOY;Lo;0;L;;;;;N;;;;;
+18C3;CANADIAN SYLLABICS YOY;Lo;0;L;;;;;N;;;;;
+18C4;CANADIAN SYLLABICS YAY;Lo;0;L;;;;;N;;;;;
+18C5;CANADIAN SYLLABICS RAY;Lo;0;L;;;;;N;;;;;
+18C6;CANADIAN SYLLABICS NWI;Lo;0;L;;;;;N;;;;;
+18C7;CANADIAN SYLLABICS OJIBWAY NWI;Lo;0;L;;;;;N;;;;;
+18C8;CANADIAN SYLLABICS NWII;Lo;0;L;;;;;N;;;;;
+18C9;CANADIAN SYLLABICS OJIBWAY NWII;Lo;0;L;;;;;N;;;;;
+18CA;CANADIAN SYLLABICS NWO;Lo;0;L;;;;;N;;;;;
+18CB;CANADIAN SYLLABICS OJIBWAY NWO;Lo;0;L;;;;;N;;;;;
+18CC;CANADIAN SYLLABICS NWOO;Lo;0;L;;;;;N;;;;;
+18CD;CANADIAN SYLLABICS OJIBWAY NWOO;Lo;0;L;;;;;N;;;;;
+18CE;CANADIAN SYLLABICS RWEE;Lo;0;L;;;;;N;;;;;
+18CF;CANADIAN SYLLABICS RWI;Lo;0;L;;;;;N;;;;;
+18D0;CANADIAN SYLLABICS RWII;Lo;0;L;;;;;N;;;;;
+18D1;CANADIAN SYLLABICS RWO;Lo;0;L;;;;;N;;;;;
+18D2;CANADIAN SYLLABICS RWOO;Lo;0;L;;;;;N;;;;;
+18D3;CANADIAN SYLLABICS RWA;Lo;0;L;;;;;N;;;;;
+18D4;CANADIAN SYLLABICS OJIBWAY P;Lo;0;L;;;;;N;;;;;
+18D5;CANADIAN SYLLABICS OJIBWAY T;Lo;0;L;;;;;N;;;;;
+18D6;CANADIAN SYLLABICS OJIBWAY K;Lo;0;L;;;;;N;;;;;
+18D7;CANADIAN SYLLABICS OJIBWAY C;Lo;0;L;;;;;N;;;;;
+18D8;CANADIAN SYLLABICS OJIBWAY M;Lo;0;L;;;;;N;;;;;
+18D9;CANADIAN SYLLABICS OJIBWAY N;Lo;0;L;;;;;N;;;;;
+18DA;CANADIAN SYLLABICS OJIBWAY S;Lo;0;L;;;;;N;;;;;
+18DB;CANADIAN SYLLABICS OJIBWAY SH;Lo;0;L;;;;;N;;;;;
+18DC;CANADIAN SYLLABICS EASTERN W;Lo;0;L;;;;;N;;;;;
+18DD;CANADIAN SYLLABICS WESTERN W;Lo;0;L;;;;;N;;;;;
+18DE;CANADIAN SYLLABICS FINAL SMALL RING;Lo;0;L;;;;;N;;;;;
+18DF;CANADIAN SYLLABICS FINAL RAISED DOT;Lo;0;L;;;;;N;;;;;
+18E0;CANADIAN SYLLABICS R-CREE RWE;Lo;0;L;;;;;N;;;;;
+18E1;CANADIAN SYLLABICS WEST-CREE LOO;Lo;0;L;;;;;N;;;;;
+18E2;CANADIAN SYLLABICS WEST-CREE LAA;Lo;0;L;;;;;N;;;;;
+18E3;CANADIAN SYLLABICS THWE;Lo;0;L;;;;;N;;;;;
+18E4;CANADIAN SYLLABICS THWA;Lo;0;L;;;;;N;;;;;
+18E5;CANADIAN SYLLABICS TTHWE;Lo;0;L;;;;;N;;;;;
+18E6;CANADIAN SYLLABICS TTHOO;Lo;0;L;;;;;N;;;;;
+18E7;CANADIAN SYLLABICS TTHAA;Lo;0;L;;;;;N;;;;;
+18E8;CANADIAN SYLLABICS TLHWE;Lo;0;L;;;;;N;;;;;
+18E9;CANADIAN SYLLABICS TLHOO;Lo;0;L;;;;;N;;;;;
+18EA;CANADIAN SYLLABICS SAYISI SHWE;Lo;0;L;;;;;N;;;;;
+18EB;CANADIAN SYLLABICS SAYISI SHOO;Lo;0;L;;;;;N;;;;;
+18EC;CANADIAN SYLLABICS SAYISI HOO;Lo;0;L;;;;;N;;;;;
+18ED;CANADIAN SYLLABICS CARRIER GWU;Lo;0;L;;;;;N;;;;;
+18EE;CANADIAN SYLLABICS CARRIER DENE GEE;Lo;0;L;;;;;N;;;;;
+18EF;CANADIAN SYLLABICS CARRIER GAA;Lo;0;L;;;;;N;;;;;
+18F0;CANADIAN SYLLABICS CARRIER GWA;Lo;0;L;;;;;N;;;;;
+18F1;CANADIAN SYLLABICS SAYISI JUU;Lo;0;L;;;;;N;;;;;
+18F2;CANADIAN SYLLABICS CARRIER JWA;Lo;0;L;;;;;N;;;;;
+18F3;CANADIAN SYLLABICS BEAVER DENE L;Lo;0;L;;;;;N;;;;;
+18F4;CANADIAN SYLLABICS BEAVER DENE R;Lo;0;L;;;;;N;;;;;
+18F5;CANADIAN SYLLABICS CARRIER DENTAL S;Lo;0;L;;;;;N;;;;;
+1900;LIMBU VOWEL-CARRIER LETTER;Lo;0;L;;;;;N;;;;;
+1901;LIMBU LETTER KA;Lo;0;L;;;;;N;;;;;
+1902;LIMBU LETTER KHA;Lo;0;L;;;;;N;;;;;
+1903;LIMBU LETTER GA;Lo;0;L;;;;;N;;;;;
+1904;LIMBU LETTER GHA;Lo;0;L;;;;;N;;;;;
+1905;LIMBU LETTER NGA;Lo;0;L;;;;;N;;;;;
+1906;LIMBU LETTER CA;Lo;0;L;;;;;N;;;;;
+1907;LIMBU LETTER CHA;Lo;0;L;;;;;N;;;;;
+1908;LIMBU LETTER JA;Lo;0;L;;;;;N;;;;;
+1909;LIMBU LETTER JHA;Lo;0;L;;;;;N;;;;;
+190A;LIMBU LETTER YAN;Lo;0;L;;;;;N;;;;;
+190B;LIMBU LETTER TA;Lo;0;L;;;;;N;;;;;
+190C;LIMBU LETTER THA;Lo;0;L;;;;;N;;;;;
+190D;LIMBU LETTER DA;Lo;0;L;;;;;N;;;;;
+190E;LIMBU LETTER DHA;Lo;0;L;;;;;N;;;;;
+190F;LIMBU LETTER NA;Lo;0;L;;;;;N;;;;;
+1910;LIMBU LETTER PA;Lo;0;L;;;;;N;;;;;
+1911;LIMBU LETTER PHA;Lo;0;L;;;;;N;;;;;
+1912;LIMBU LETTER BA;Lo;0;L;;;;;N;;;;;
+1913;LIMBU LETTER BHA;Lo;0;L;;;;;N;;;;;
+1914;LIMBU LETTER MA;Lo;0;L;;;;;N;;;;;
+1915;LIMBU LETTER YA;Lo;0;L;;;;;N;;;;;
+1916;LIMBU LETTER RA;Lo;0;L;;;;;N;;;;;
+1917;LIMBU LETTER LA;Lo;0;L;;;;;N;;;;;
+1918;LIMBU LETTER WA;Lo;0;L;;;;;N;;;;;
+1919;LIMBU LETTER SHA;Lo;0;L;;;;;N;;;;;
+191A;LIMBU LETTER SSA;Lo;0;L;;;;;N;;;;;
+191B;LIMBU LETTER SA;Lo;0;L;;;;;N;;;;;
+191C;LIMBU LETTER HA;Lo;0;L;;;;;N;;;;;
+191D;LIMBU LETTER GYAN;Lo;0;L;;;;;N;;;;;
+191E;LIMBU LETTER TRA;Lo;0;L;;;;;N;;;;;
+1920;LIMBU VOWEL SIGN A;Mn;0;NSM;;;;;N;;;;;
+1921;LIMBU VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+1922;LIMBU VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+1923;LIMBU VOWEL SIGN EE;Mc;0;L;;;;;N;;;;;
+1924;LIMBU VOWEL SIGN AI;Mc;0;L;;;;;N;;;;;
+1925;LIMBU VOWEL SIGN OO;Mc;0;L;;;;;N;;;;;
+1926;LIMBU VOWEL SIGN AU;Mc;0;L;;;;;N;;;;;
+1927;LIMBU VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+1928;LIMBU VOWEL SIGN O;Mn;0;NSM;;;;;N;;;;;
+1929;LIMBU SUBJOINED LETTER YA;Mc;0;L;;;;;N;;;;;
+192A;LIMBU SUBJOINED LETTER RA;Mc;0;L;;;;;N;;;;;
+192B;LIMBU SUBJOINED LETTER WA;Mc;0;L;;;;;N;;;;;
+1930;LIMBU SMALL LETTER KA;Mc;0;L;;;;;N;;;;;
+1931;LIMBU SMALL LETTER NGA;Mc;0;L;;;;;N;;;;;
+1932;LIMBU SMALL LETTER ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+1933;LIMBU SMALL LETTER TA;Mc;0;L;;;;;N;;;;;
+1934;LIMBU SMALL LETTER NA;Mc;0;L;;;;;N;;;;;
+1935;LIMBU SMALL LETTER PA;Mc;0;L;;;;;N;;;;;
+1936;LIMBU SMALL LETTER MA;Mc;0;L;;;;;N;;;;;
+1937;LIMBU SMALL LETTER RA;Mc;0;L;;;;;N;;;;;
+1938;LIMBU SMALL LETTER LA;Mc;0;L;;;;;N;;;;;
+1939;LIMBU SIGN MUKPHRENG;Mn;222;NSM;;;;;N;;;;;
+193A;LIMBU SIGN KEMPHRENG;Mn;230;NSM;;;;;N;;;;;
+193B;LIMBU SIGN SA-I;Mn;220;NSM;;;;;N;;;;;
+1940;LIMBU SIGN LOO;So;0;ON;;;;;N;;;;;
+1944;LIMBU EXCLAMATION MARK;Po;0;ON;;;;;N;;;;;
+1945;LIMBU QUESTION MARK;Po;0;ON;;;;;N;;;;;
+1946;LIMBU DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+1947;LIMBU DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+1948;LIMBU DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+1949;LIMBU DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+194A;LIMBU DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+194B;LIMBU DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+194C;LIMBU DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+194D;LIMBU DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+194E;LIMBU DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+194F;LIMBU DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+1950;TAI LE LETTER KA;Lo;0;L;;;;;N;;;;;
+1951;TAI LE LETTER XA;Lo;0;L;;;;;N;;;;;
+1952;TAI LE LETTER NGA;Lo;0;L;;;;;N;;;;;
+1953;TAI LE LETTER TSA;Lo;0;L;;;;;N;;;;;
+1954;TAI LE LETTER SA;Lo;0;L;;;;;N;;;;;
+1955;TAI LE LETTER YA;Lo;0;L;;;;;N;;;;;
+1956;TAI LE LETTER TA;Lo;0;L;;;;;N;;;;;
+1957;TAI LE LETTER THA;Lo;0;L;;;;;N;;;;;
+1958;TAI LE LETTER LA;Lo;0;L;;;;;N;;;;;
+1959;TAI LE LETTER PA;Lo;0;L;;;;;N;;;;;
+195A;TAI LE LETTER PHA;Lo;0;L;;;;;N;;;;;
+195B;TAI LE LETTER MA;Lo;0;L;;;;;N;;;;;
+195C;TAI LE LETTER FA;Lo;0;L;;;;;N;;;;;
+195D;TAI LE LETTER VA;Lo;0;L;;;;;N;;;;;
+195E;TAI LE LETTER HA;Lo;0;L;;;;;N;;;;;
+195F;TAI LE LETTER QA;Lo;0;L;;;;;N;;;;;
+1960;TAI LE LETTER KHA;Lo;0;L;;;;;N;;;;;
+1961;TAI LE LETTER TSHA;Lo;0;L;;;;;N;;;;;
+1962;TAI LE LETTER NA;Lo;0;L;;;;;N;;;;;
+1963;TAI LE LETTER A;Lo;0;L;;;;;N;;;;;
+1964;TAI LE LETTER I;Lo;0;L;;;;;N;;;;;
+1965;TAI LE LETTER EE;Lo;0;L;;;;;N;;;;;
+1966;TAI LE LETTER EH;Lo;0;L;;;;;N;;;;;
+1967;TAI LE LETTER U;Lo;0;L;;;;;N;;;;;
+1968;TAI LE LETTER OO;Lo;0;L;;;;;N;;;;;
+1969;TAI LE LETTER O;Lo;0;L;;;;;N;;;;;
+196A;TAI LE LETTER UE;Lo;0;L;;;;;N;;;;;
+196B;TAI LE LETTER E;Lo;0;L;;;;;N;;;;;
+196C;TAI LE LETTER AUE;Lo;0;L;;;;;N;;;;;
+196D;TAI LE LETTER AI;Lo;0;L;;;;;N;;;;;
+1970;TAI LE LETTER TONE-2;Lo;0;L;;;;;N;;;;;
+1971;TAI LE LETTER TONE-3;Lo;0;L;;;;;N;;;;;
+1972;TAI LE LETTER TONE-4;Lo;0;L;;;;;N;;;;;
+1973;TAI LE LETTER TONE-5;Lo;0;L;;;;;N;;;;;
+1974;TAI LE LETTER TONE-6;Lo;0;L;;;;;N;;;;;
+1980;NEW TAI LUE LETTER HIGH QA;Lo;0;L;;;;;N;;;;;
+1981;NEW TAI LUE LETTER LOW QA;Lo;0;L;;;;;N;;;;;
+1982;NEW TAI LUE LETTER HIGH KA;Lo;0;L;;;;;N;;;;;
+1983;NEW TAI LUE LETTER HIGH XA;Lo;0;L;;;;;N;;;;;
+1984;NEW TAI LUE LETTER HIGH NGA;Lo;0;L;;;;;N;;;;;
+1985;NEW TAI LUE LETTER LOW KA;Lo;0;L;;;;;N;;;;;
+1986;NEW TAI LUE LETTER LOW XA;Lo;0;L;;;;;N;;;;;
+1987;NEW TAI LUE LETTER LOW NGA;Lo;0;L;;;;;N;;;;;
+1988;NEW TAI LUE LETTER HIGH TSA;Lo;0;L;;;;;N;;;;;
+1989;NEW TAI LUE LETTER HIGH SA;Lo;0;L;;;;;N;;;;;
+198A;NEW TAI LUE LETTER HIGH YA;Lo;0;L;;;;;N;;;;;
+198B;NEW TAI LUE LETTER LOW TSA;Lo;0;L;;;;;N;;;;;
+198C;NEW TAI LUE LETTER LOW SA;Lo;0;L;;;;;N;;;;;
+198D;NEW TAI LUE LETTER LOW YA;Lo;0;L;;;;;N;;;;;
+198E;NEW TAI LUE LETTER HIGH TA;Lo;0;L;;;;;N;;;;;
+198F;NEW TAI LUE LETTER HIGH THA;Lo;0;L;;;;;N;;;;;
+1990;NEW TAI LUE LETTER HIGH NA;Lo;0;L;;;;;N;;;;;
+1991;NEW TAI LUE LETTER LOW TA;Lo;0;L;;;;;N;;;;;
+1992;NEW TAI LUE LETTER LOW THA;Lo;0;L;;;;;N;;;;;
+1993;NEW TAI LUE LETTER LOW NA;Lo;0;L;;;;;N;;;;;
+1994;NEW TAI LUE LETTER HIGH PA;Lo;0;L;;;;;N;;;;;
+1995;NEW TAI LUE LETTER HIGH PHA;Lo;0;L;;;;;N;;;;;
+1996;NEW TAI LUE LETTER HIGH MA;Lo;0;L;;;;;N;;;;;
+1997;NEW TAI LUE LETTER LOW PA;Lo;0;L;;;;;N;;;;;
+1998;NEW TAI LUE LETTER LOW PHA;Lo;0;L;;;;;N;;;;;
+1999;NEW TAI LUE LETTER LOW MA;Lo;0;L;;;;;N;;;;;
+199A;NEW TAI LUE LETTER HIGH FA;Lo;0;L;;;;;N;;;;;
+199B;NEW TAI LUE LETTER HIGH VA;Lo;0;L;;;;;N;;;;;
+199C;NEW TAI LUE LETTER HIGH LA;Lo;0;L;;;;;N;;;;;
+199D;NEW TAI LUE LETTER LOW FA;Lo;0;L;;;;;N;;;;;
+199E;NEW TAI LUE LETTER LOW VA;Lo;0;L;;;;;N;;;;;
+199F;NEW TAI LUE LETTER LOW LA;Lo;0;L;;;;;N;;;;;
+19A0;NEW TAI LUE LETTER HIGH HA;Lo;0;L;;;;;N;;;;;
+19A1;NEW TAI LUE LETTER HIGH DA;Lo;0;L;;;;;N;;;;;
+19A2;NEW TAI LUE LETTER HIGH BA;Lo;0;L;;;;;N;;;;;
+19A3;NEW TAI LUE LETTER LOW HA;Lo;0;L;;;;;N;;;;;
+19A4;NEW TAI LUE LETTER LOW DA;Lo;0;L;;;;;N;;;;;
+19A5;NEW TAI LUE LETTER LOW BA;Lo;0;L;;;;;N;;;;;
+19A6;NEW TAI LUE LETTER HIGH KVA;Lo;0;L;;;;;N;;;;;
+19A7;NEW TAI LUE LETTER HIGH XVA;Lo;0;L;;;;;N;;;;;
+19A8;NEW TAI LUE LETTER LOW KVA;Lo;0;L;;;;;N;;;;;
+19A9;NEW TAI LUE LETTER LOW XVA;Lo;0;L;;;;;N;;;;;
+19AA;NEW TAI LUE LETTER HIGH SUA;Lo;0;L;;;;;N;;;;;
+19AB;NEW TAI LUE LETTER LOW SUA;Lo;0;L;;;;;N;;;;;
+19B0;NEW TAI LUE VOWEL SIGN VOWEL SHORTENER;Lo;0;L;;;;;N;;;;;
+19B1;NEW TAI LUE VOWEL SIGN AA;Lo;0;L;;;;;N;;;;;
+19B2;NEW TAI LUE VOWEL SIGN II;Lo;0;L;;;;;N;;;;;
+19B3;NEW TAI LUE VOWEL SIGN U;Lo;0;L;;;;;N;;;;;
+19B4;NEW TAI LUE VOWEL SIGN UU;Lo;0;L;;;;;N;;;;;
+19B5;NEW TAI LUE VOWEL SIGN E;Lo;0;L;;;;;N;;;;;
+19B6;NEW TAI LUE VOWEL SIGN AE;Lo;0;L;;;;;N;;;;;
+19B7;NEW TAI LUE VOWEL SIGN O;Lo;0;L;;;;;N;;;;;
+19B8;NEW TAI LUE VOWEL SIGN OA;Lo;0;L;;;;;N;;;;;
+19B9;NEW TAI LUE VOWEL SIGN UE;Lo;0;L;;;;;N;;;;;
+19BA;NEW TAI LUE VOWEL SIGN AY;Lo;0;L;;;;;N;;;;;
+19BB;NEW TAI LUE VOWEL SIGN AAY;Lo;0;L;;;;;N;;;;;
+19BC;NEW TAI LUE VOWEL SIGN UY;Lo;0;L;;;;;N;;;;;
+19BD;NEW TAI LUE VOWEL SIGN OY;Lo;0;L;;;;;N;;;;;
+19BE;NEW TAI LUE VOWEL SIGN OAY;Lo;0;L;;;;;N;;;;;
+19BF;NEW TAI LUE VOWEL SIGN UEY;Lo;0;L;;;;;N;;;;;
+19C0;NEW TAI LUE VOWEL SIGN IY;Lo;0;L;;;;;N;;;;;
+19C1;NEW TAI LUE LETTER FINAL V;Lo;0;L;;;;;N;;;;;
+19C2;NEW TAI LUE LETTER FINAL NG;Lo;0;L;;;;;N;;;;;
+19C3;NEW TAI LUE LETTER FINAL N;Lo;0;L;;;;;N;;;;;
+19C4;NEW TAI LUE LETTER FINAL M;Lo;0;L;;;;;N;;;;;
+19C5;NEW TAI LUE LETTER FINAL K;Lo;0;L;;;;;N;;;;;
+19C6;NEW TAI LUE LETTER FINAL D;Lo;0;L;;;;;N;;;;;
+19C7;NEW TAI LUE LETTER FINAL B;Lo;0;L;;;;;N;;;;;
+19C8;NEW TAI LUE TONE MARK-1;Lo;0;L;;;;;N;;;;;
+19C9;NEW TAI LUE TONE MARK-2;Lo;0;L;;;;;N;;;;;
+19D0;NEW TAI LUE DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+19D1;NEW TAI LUE DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+19D2;NEW TAI LUE DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+19D3;NEW TAI LUE DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+19D4;NEW TAI LUE DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+19D5;NEW TAI LUE DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+19D6;NEW TAI LUE DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+19D7;NEW TAI LUE DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+19D8;NEW TAI LUE DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+19D9;NEW TAI LUE DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+19DA;NEW TAI LUE THAM DIGIT ONE;No;0;L;;;1;1;N;;;;;
+19DE;NEW TAI LUE SIGN LAE;So;0;ON;;;;;N;;;;;
+19DF;NEW TAI LUE SIGN LAEV;So;0;ON;;;;;N;;;;;
+19E0;KHMER SYMBOL PATHAMASAT;So;0;ON;;;;;N;;;;;
+19E1;KHMER SYMBOL MUOY KOET;So;0;ON;;;;;N;;;;;
+19E2;KHMER SYMBOL PII KOET;So;0;ON;;;;;N;;;;;
+19E3;KHMER SYMBOL BEI KOET;So;0;ON;;;;;N;;;;;
+19E4;KHMER SYMBOL BUON KOET;So;0;ON;;;;;N;;;;;
+19E5;KHMER SYMBOL PRAM KOET;So;0;ON;;;;;N;;;;;
+19E6;KHMER SYMBOL PRAM-MUOY KOET;So;0;ON;;;;;N;;;;;
+19E7;KHMER SYMBOL PRAM-PII KOET;So;0;ON;;;;;N;;;;;
+19E8;KHMER SYMBOL PRAM-BEI KOET;So;0;ON;;;;;N;;;;;
+19E9;KHMER SYMBOL PRAM-BUON KOET;So;0;ON;;;;;N;;;;;
+19EA;KHMER SYMBOL DAP KOET;So;0;ON;;;;;N;;;;;
+19EB;KHMER SYMBOL DAP-MUOY KOET;So;0;ON;;;;;N;;;;;
+19EC;KHMER SYMBOL DAP-PII KOET;So;0;ON;;;;;N;;;;;
+19ED;KHMER SYMBOL DAP-BEI KOET;So;0;ON;;;;;N;;;;;
+19EE;KHMER SYMBOL DAP-BUON KOET;So;0;ON;;;;;N;;;;;
+19EF;KHMER SYMBOL DAP-PRAM KOET;So;0;ON;;;;;N;;;;;
+19F0;KHMER SYMBOL TUTEYASAT;So;0;ON;;;;;N;;;;;
+19F1;KHMER SYMBOL MUOY ROC;So;0;ON;;;;;N;;;;;
+19F2;KHMER SYMBOL PII ROC;So;0;ON;;;;;N;;;;;
+19F3;KHMER SYMBOL BEI ROC;So;0;ON;;;;;N;;;;;
+19F4;KHMER SYMBOL BUON ROC;So;0;ON;;;;;N;;;;;
+19F5;KHMER SYMBOL PRAM ROC;So;0;ON;;;;;N;;;;;
+19F6;KHMER SYMBOL PRAM-MUOY ROC;So;0;ON;;;;;N;;;;;
+19F7;KHMER SYMBOL PRAM-PII ROC;So;0;ON;;;;;N;;;;;
+19F8;KHMER SYMBOL PRAM-BEI ROC;So;0;ON;;;;;N;;;;;
+19F9;KHMER SYMBOL PRAM-BUON ROC;So;0;ON;;;;;N;;;;;
+19FA;KHMER SYMBOL DAP ROC;So;0;ON;;;;;N;;;;;
+19FB;KHMER SYMBOL DAP-MUOY ROC;So;0;ON;;;;;N;;;;;
+19FC;KHMER SYMBOL DAP-PII ROC;So;0;ON;;;;;N;;;;;
+19FD;KHMER SYMBOL DAP-BEI ROC;So;0;ON;;;;;N;;;;;
+19FE;KHMER SYMBOL DAP-BUON ROC;So;0;ON;;;;;N;;;;;
+19FF;KHMER SYMBOL DAP-PRAM ROC;So;0;ON;;;;;N;;;;;
+1A00;BUGINESE LETTER KA;Lo;0;L;;;;;N;;;;;
+1A01;BUGINESE LETTER GA;Lo;0;L;;;;;N;;;;;
+1A02;BUGINESE LETTER NGA;Lo;0;L;;;;;N;;;;;
+1A03;BUGINESE LETTER NGKA;Lo;0;L;;;;;N;;;;;
+1A04;BUGINESE LETTER PA;Lo;0;L;;;;;N;;;;;
+1A05;BUGINESE LETTER BA;Lo;0;L;;;;;N;;;;;
+1A06;BUGINESE LETTER MA;Lo;0;L;;;;;N;;;;;
+1A07;BUGINESE LETTER MPA;Lo;0;L;;;;;N;;;;;
+1A08;BUGINESE LETTER TA;Lo;0;L;;;;;N;;;;;
+1A09;BUGINESE LETTER DA;Lo;0;L;;;;;N;;;;;
+1A0A;BUGINESE LETTER NA;Lo;0;L;;;;;N;;;;;
+1A0B;BUGINESE LETTER NRA;Lo;0;L;;;;;N;;;;;
+1A0C;BUGINESE LETTER CA;Lo;0;L;;;;;N;;;;;
+1A0D;BUGINESE LETTER JA;Lo;0;L;;;;;N;;;;;
+1A0E;BUGINESE LETTER NYA;Lo;0;L;;;;;N;;;;;
+1A0F;BUGINESE LETTER NYCA;Lo;0;L;;;;;N;;;;;
+1A10;BUGINESE LETTER YA;Lo;0;L;;;;;N;;;;;
+1A11;BUGINESE LETTER RA;Lo;0;L;;;;;N;;;;;
+1A12;BUGINESE LETTER LA;Lo;0;L;;;;;N;;;;;
+1A13;BUGINESE LETTER VA;Lo;0;L;;;;;N;;;;;
+1A14;BUGINESE LETTER SA;Lo;0;L;;;;;N;;;;;
+1A15;BUGINESE LETTER A;Lo;0;L;;;;;N;;;;;
+1A16;BUGINESE LETTER HA;Lo;0;L;;;;;N;;;;;
+1A17;BUGINESE VOWEL SIGN I;Mn;230;NSM;;;;;N;;;;;
+1A18;BUGINESE VOWEL SIGN U;Mn;220;NSM;;;;;N;;;;;
+1A19;BUGINESE VOWEL SIGN E;Mc;0;L;;;;;N;;;;;
+1A1A;BUGINESE VOWEL SIGN O;Mc;0;L;;;;;N;;;;;
+1A1B;BUGINESE VOWEL SIGN AE;Mn;0;NSM;;;;;N;;;;;
+1A1E;BUGINESE PALLAWA;Po;0;L;;;;;N;;;;;
+1A1F;BUGINESE END OF SECTION;Po;0;L;;;;;N;;;;;
+1A20;TAI THAM LETTER HIGH KA;Lo;0;L;;;;;N;;;;;
+1A21;TAI THAM LETTER HIGH KHA;Lo;0;L;;;;;N;;;;;
+1A22;TAI THAM LETTER HIGH KXA;Lo;0;L;;;;;N;;;;;
+1A23;TAI THAM LETTER LOW KA;Lo;0;L;;;;;N;;;;;
+1A24;TAI THAM LETTER LOW KXA;Lo;0;L;;;;;N;;;;;
+1A25;TAI THAM LETTER LOW KHA;Lo;0;L;;;;;N;;;;;
+1A26;TAI THAM LETTER NGA;Lo;0;L;;;;;N;;;;;
+1A27;TAI THAM LETTER HIGH CA;Lo;0;L;;;;;N;;;;;
+1A28;TAI THAM LETTER HIGH CHA;Lo;0;L;;;;;N;;;;;
+1A29;TAI THAM LETTER LOW CA;Lo;0;L;;;;;N;;;;;
+1A2A;TAI THAM LETTER LOW SA;Lo;0;L;;;;;N;;;;;
+1A2B;TAI THAM LETTER LOW CHA;Lo;0;L;;;;;N;;;;;
+1A2C;TAI THAM LETTER NYA;Lo;0;L;;;;;N;;;;;
+1A2D;TAI THAM LETTER RATA;Lo;0;L;;;;;N;;;;;
+1A2E;TAI THAM LETTER HIGH RATHA;Lo;0;L;;;;;N;;;;;
+1A2F;TAI THAM LETTER DA;Lo;0;L;;;;;N;;;;;
+1A30;TAI THAM LETTER LOW RATHA;Lo;0;L;;;;;N;;;;;
+1A31;TAI THAM LETTER RANA;Lo;0;L;;;;;N;;;;;
+1A32;TAI THAM LETTER HIGH TA;Lo;0;L;;;;;N;;;;;
+1A33;TAI THAM LETTER HIGH THA;Lo;0;L;;;;;N;;;;;
+1A34;TAI THAM LETTER LOW TA;Lo;0;L;;;;;N;;;;;
+1A35;TAI THAM LETTER LOW THA;Lo;0;L;;;;;N;;;;;
+1A36;TAI THAM LETTER NA;Lo;0;L;;;;;N;;;;;
+1A37;TAI THAM LETTER BA;Lo;0;L;;;;;N;;;;;
+1A38;TAI THAM LETTER HIGH PA;Lo;0;L;;;;;N;;;;;
+1A39;TAI THAM LETTER HIGH PHA;Lo;0;L;;;;;N;;;;;
+1A3A;TAI THAM LETTER HIGH FA;Lo;0;L;;;;;N;;;;;
+1A3B;TAI THAM LETTER LOW PA;Lo;0;L;;;;;N;;;;;
+1A3C;TAI THAM LETTER LOW FA;Lo;0;L;;;;;N;;;;;
+1A3D;TAI THAM LETTER LOW PHA;Lo;0;L;;;;;N;;;;;
+1A3E;TAI THAM LETTER MA;Lo;0;L;;;;;N;;;;;
+1A3F;TAI THAM LETTER LOW YA;Lo;0;L;;;;;N;;;;;
+1A40;TAI THAM LETTER HIGH YA;Lo;0;L;;;;;N;;;;;
+1A41;TAI THAM LETTER RA;Lo;0;L;;;;;N;;;;;
+1A42;TAI THAM LETTER RUE;Lo;0;L;;;;;N;;;;;
+1A43;TAI THAM LETTER LA;Lo;0;L;;;;;N;;;;;
+1A44;TAI THAM LETTER LUE;Lo;0;L;;;;;N;;;;;
+1A45;TAI THAM LETTER WA;Lo;0;L;;;;;N;;;;;
+1A46;TAI THAM LETTER HIGH SHA;Lo;0;L;;;;;N;;;;;
+1A47;TAI THAM LETTER HIGH SSA;Lo;0;L;;;;;N;;;;;
+1A48;TAI THAM LETTER HIGH SA;Lo;0;L;;;;;N;;;;;
+1A49;TAI THAM LETTER HIGH HA;Lo;0;L;;;;;N;;;;;
+1A4A;TAI THAM LETTER LLA;Lo;0;L;;;;;N;;;;;
+1A4B;TAI THAM LETTER A;Lo;0;L;;;;;N;;;;;
+1A4C;TAI THAM LETTER LOW HA;Lo;0;L;;;;;N;;;;;
+1A4D;TAI THAM LETTER I;Lo;0;L;;;;;N;;;;;
+1A4E;TAI THAM LETTER II;Lo;0;L;;;;;N;;;;;
+1A4F;TAI THAM LETTER U;Lo;0;L;;;;;N;;;;;
+1A50;TAI THAM LETTER UU;Lo;0;L;;;;;N;;;;;
+1A51;TAI THAM LETTER EE;Lo;0;L;;;;;N;;;;;
+1A52;TAI THAM LETTER OO;Lo;0;L;;;;;N;;;;;
+1A53;TAI THAM LETTER LAE;Lo;0;L;;;;;N;;;;;
+1A54;TAI THAM LETTER GREAT SA;Lo;0;L;;;;;N;;;;;
+1A55;TAI THAM CONSONANT SIGN MEDIAL RA;Mc;0;L;;;;;N;;;;;
+1A56;TAI THAM CONSONANT SIGN MEDIAL LA;Mn;0;NSM;;;;;N;;;;;
+1A57;TAI THAM CONSONANT SIGN LA TANG LAI;Mc;0;L;;;;;N;;;;;
+1A58;TAI THAM SIGN MAI KANG LAI;Mn;0;NSM;;;;;N;;;;;
+1A59;TAI THAM CONSONANT SIGN FINAL NGA;Mn;0;NSM;;;;;N;;;;;
+1A5A;TAI THAM CONSONANT SIGN LOW PA;Mn;0;NSM;;;;;N;;;;;
+1A5B;TAI THAM CONSONANT SIGN HIGH RATHA OR LOW PA;Mn;0;NSM;;;;;N;;;;;
+1A5C;TAI THAM CONSONANT SIGN MA;Mn;0;NSM;;;;;N;;;;;
+1A5D;TAI THAM CONSONANT SIGN BA;Mn;0;NSM;;;;;N;;;;;
+1A5E;TAI THAM CONSONANT SIGN SA;Mn;0;NSM;;;;;N;;;;;
+1A60;TAI THAM SIGN SAKOT;Mn;9;NSM;;;;;N;;;;;
+1A61;TAI THAM VOWEL SIGN A;Mc;0;L;;;;;N;;;;;
+1A62;TAI THAM VOWEL SIGN MAI SAT;Mn;0;NSM;;;;;N;;;;;
+1A63;TAI THAM VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+1A64;TAI THAM VOWEL SIGN TALL AA;Mc;0;L;;;;;N;;;;;
+1A65;TAI THAM VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+1A66;TAI THAM VOWEL SIGN II;Mn;0;NSM;;;;;N;;;;;
+1A67;TAI THAM VOWEL SIGN UE;Mn;0;NSM;;;;;N;;;;;
+1A68;TAI THAM VOWEL SIGN UUE;Mn;0;NSM;;;;;N;;;;;
+1A69;TAI THAM VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+1A6A;TAI THAM VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+1A6B;TAI THAM VOWEL SIGN O;Mn;0;NSM;;;;;N;;;;;
+1A6C;TAI THAM VOWEL SIGN OA BELOW;Mn;0;NSM;;;;;N;;;;;
+1A6D;TAI THAM VOWEL SIGN OY;Mc;0;L;;;;;N;;;;;
+1A6E;TAI THAM VOWEL SIGN E;Mc;0;L;;;;;N;;;;;
+1A6F;TAI THAM VOWEL SIGN AE;Mc;0;L;;;;;N;;;;;
+1A70;TAI THAM VOWEL SIGN OO;Mc;0;L;;;;;N;;;;;
+1A71;TAI THAM VOWEL SIGN AI;Mc;0;L;;;;;N;;;;;
+1A72;TAI THAM VOWEL SIGN THAM AI;Mc;0;L;;;;;N;;;;;
+1A73;TAI THAM VOWEL SIGN OA ABOVE;Mn;0;NSM;;;;;N;;;;;
+1A74;TAI THAM SIGN MAI KANG;Mn;0;NSM;;;;;N;;;;;
+1A75;TAI THAM SIGN TONE-1;Mn;230;NSM;;;;;N;;;;;
+1A76;TAI THAM SIGN TONE-2;Mn;230;NSM;;;;;N;;;;;
+1A77;TAI THAM SIGN KHUEN TONE-3;Mn;230;NSM;;;;;N;;;;;
+1A78;TAI THAM SIGN KHUEN TONE-4;Mn;230;NSM;;;;;N;;;;;
+1A79;TAI THAM SIGN KHUEN TONE-5;Mn;230;NSM;;;;;N;;;;;
+1A7A;TAI THAM SIGN RA HAAM;Mn;230;NSM;;;;;N;;;;;
+1A7B;TAI THAM SIGN MAI SAM;Mn;230;NSM;;;;;N;;;;;
+1A7C;TAI THAM SIGN KHUEN-LUE KARAN;Mn;230;NSM;;;;;N;;;;;
+1A7F;TAI THAM COMBINING CRYPTOGRAMMIC DOT;Mn;220;NSM;;;;;N;;;;;
+1A80;TAI THAM HORA DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+1A81;TAI THAM HORA DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+1A82;TAI THAM HORA DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+1A83;TAI THAM HORA DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+1A84;TAI THAM HORA DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+1A85;TAI THAM HORA DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+1A86;TAI THAM HORA DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+1A87;TAI THAM HORA DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+1A88;TAI THAM HORA DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+1A89;TAI THAM HORA DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+1A90;TAI THAM THAM DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+1A91;TAI THAM THAM DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+1A92;TAI THAM THAM DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+1A93;TAI THAM THAM DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+1A94;TAI THAM THAM DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+1A95;TAI THAM THAM DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+1A96;TAI THAM THAM DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+1A97;TAI THAM THAM DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+1A98;TAI THAM THAM DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+1A99;TAI THAM THAM DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+1AA0;TAI THAM SIGN WIANG;Po;0;L;;;;;N;;;;;
+1AA1;TAI THAM SIGN WIANGWAAK;Po;0;L;;;;;N;;;;;
+1AA2;TAI THAM SIGN SAWAN;Po;0;L;;;;;N;;;;;
+1AA3;TAI THAM SIGN KEOW;Po;0;L;;;;;N;;;;;
+1AA4;TAI THAM SIGN HOY;Po;0;L;;;;;N;;;;;
+1AA5;TAI THAM SIGN DOKMAI;Po;0;L;;;;;N;;;;;
+1AA6;TAI THAM SIGN REVERSED ROTATED RANA;Po;0;L;;;;;N;;;;;
+1AA7;TAI THAM SIGN MAI YAMOK;Lm;0;L;;;;;N;;;;;
+1AA8;TAI THAM SIGN KAAN;Po;0;L;;;;;N;;;;;
+1AA9;TAI THAM SIGN KAANKUU;Po;0;L;;;;;N;;;;;
+1AAA;TAI THAM SIGN SATKAAN;Po;0;L;;;;;N;;;;;
+1AAB;TAI THAM SIGN SATKAANKUU;Po;0;L;;;;;N;;;;;
+1AAC;TAI THAM SIGN HANG;Po;0;L;;;;;N;;;;;
+1AAD;TAI THAM SIGN CAANG;Po;0;L;;;;;N;;;;;
+1AB0;COMBINING DOUBLED CIRCUMFLEX ACCENT;Mn;230;NSM;;;;;N;;;;;
+1AB1;COMBINING DIAERESIS-RING;Mn;230;NSM;;;;;N;;;;;
+1AB2;COMBINING INFINITY;Mn;230;NSM;;;;;N;;;;;
+1AB3;COMBINING DOWNWARDS ARROW;Mn;230;NSM;;;;;N;;;;;
+1AB4;COMBINING TRIPLE DOT;Mn;230;NSM;;;;;N;;;;;
+1AB5;COMBINING X-X BELOW;Mn;220;NSM;;;;;N;;;;;
+1AB6;COMBINING WIGGLY LINE BELOW;Mn;220;NSM;;;;;N;;;;;
+1AB7;COMBINING OPEN MARK BELOW;Mn;220;NSM;;;;;N;;;;;
+1AB8;COMBINING DOUBLE OPEN MARK BELOW;Mn;220;NSM;;;;;N;;;;;
+1AB9;COMBINING LIGHT CENTRALIZATION STROKE BELOW;Mn;220;NSM;;;;;N;;;;;
+1ABA;COMBINING STRONG CENTRALIZATION STROKE BELOW;Mn;220;NSM;;;;;N;;;;;
+1ABB;COMBINING PARENTHESES ABOVE;Mn;230;NSM;;;;;N;;;;;
+1ABC;COMBINING DOUBLE PARENTHESES ABOVE;Mn;230;NSM;;;;;N;;;;;
+1ABD;COMBINING PARENTHESES BELOW;Mn;220;NSM;;;;;N;;;;;
+1ABE;COMBINING PARENTHESES OVERLAY;Me;0;NSM;;;;;N;;;;;
+1B00;BALINESE SIGN ULU RICEM;Mn;0;NSM;;;;;N;;;;;
+1B01;BALINESE SIGN ULU CANDRA;Mn;0;NSM;;;;;N;;;;;
+1B02;BALINESE SIGN CECEK;Mn;0;NSM;;;;;N;;;;;
+1B03;BALINESE SIGN SURANG;Mn;0;NSM;;;;;N;;;;;
+1B04;BALINESE SIGN BISAH;Mc;0;L;;;;;N;;;;;
+1B05;BALINESE LETTER AKARA;Lo;0;L;;;;;N;;;;;
+1B06;BALINESE LETTER AKARA TEDUNG;Lo;0;L;1B05 1B35;;;;N;;;;;
+1B07;BALINESE LETTER IKARA;Lo;0;L;;;;;N;;;;;
+1B08;BALINESE LETTER IKARA TEDUNG;Lo;0;L;1B07 1B35;;;;N;;;;;
+1B09;BALINESE LETTER UKARA;Lo;0;L;;;;;N;;;;;
+1B0A;BALINESE LETTER UKARA TEDUNG;Lo;0;L;1B09 1B35;;;;N;;;;;
+1B0B;BALINESE LETTER RA REPA;Lo;0;L;;;;;N;;;;;
+1B0C;BALINESE LETTER RA REPA TEDUNG;Lo;0;L;1B0B 1B35;;;;N;;;;;
+1B0D;BALINESE LETTER LA LENGA;Lo;0;L;;;;;N;;;;;
+1B0E;BALINESE LETTER LA LENGA TEDUNG;Lo;0;L;1B0D 1B35;;;;N;;;;;
+1B0F;BALINESE LETTER EKARA;Lo;0;L;;;;;N;;;;;
+1B10;BALINESE LETTER AIKARA;Lo;0;L;;;;;N;;;;;
+1B11;BALINESE LETTER OKARA;Lo;0;L;;;;;N;;;;;
+1B12;BALINESE LETTER OKARA TEDUNG;Lo;0;L;1B11 1B35;;;;N;;;;;
+1B13;BALINESE LETTER KA;Lo;0;L;;;;;N;;;;;
+1B14;BALINESE LETTER KA MAHAPRANA;Lo;0;L;;;;;N;;;;;
+1B15;BALINESE LETTER GA;Lo;0;L;;;;;N;;;;;
+1B16;BALINESE LETTER GA GORA;Lo;0;L;;;;;N;;;;;
+1B17;BALINESE LETTER NGA;Lo;0;L;;;;;N;;;;;
+1B18;BALINESE LETTER CA;Lo;0;L;;;;;N;;;;;
+1B19;BALINESE LETTER CA LACA;Lo;0;L;;;;;N;;;;;
+1B1A;BALINESE LETTER JA;Lo;0;L;;;;;N;;;;;
+1B1B;BALINESE LETTER JA JERA;Lo;0;L;;;;;N;;;;;
+1B1C;BALINESE LETTER NYA;Lo;0;L;;;;;N;;;;;
+1B1D;BALINESE LETTER TA LATIK;Lo;0;L;;;;;N;;;;;
+1B1E;BALINESE LETTER TA MURDA MAHAPRANA;Lo;0;L;;;;;N;;;;;
+1B1F;BALINESE LETTER DA MURDA ALPAPRANA;Lo;0;L;;;;;N;;;;;
+1B20;BALINESE LETTER DA MURDA MAHAPRANA;Lo;0;L;;;;;N;;;;;
+1B21;BALINESE LETTER NA RAMBAT;Lo;0;L;;;;;N;;;;;
+1B22;BALINESE LETTER TA;Lo;0;L;;;;;N;;;;;
+1B23;BALINESE LETTER TA TAWA;Lo;0;L;;;;;N;;;;;
+1B24;BALINESE LETTER DA;Lo;0;L;;;;;N;;;;;
+1B25;BALINESE LETTER DA MADU;Lo;0;L;;;;;N;;;;;
+1B26;BALINESE LETTER NA;Lo;0;L;;;;;N;;;;;
+1B27;BALINESE LETTER PA;Lo;0;L;;;;;N;;;;;
+1B28;BALINESE LETTER PA KAPAL;Lo;0;L;;;;;N;;;;;
+1B29;BALINESE LETTER BA;Lo;0;L;;;;;N;;;;;
+1B2A;BALINESE LETTER BA KEMBANG;Lo;0;L;;;;;N;;;;;
+1B2B;BALINESE LETTER MA;Lo;0;L;;;;;N;;;;;
+1B2C;BALINESE LETTER YA;Lo;0;L;;;;;N;;;;;
+1B2D;BALINESE LETTER RA;Lo;0;L;;;;;N;;;;;
+1B2E;BALINESE LETTER LA;Lo;0;L;;;;;N;;;;;
+1B2F;BALINESE LETTER WA;Lo;0;L;;;;;N;;;;;
+1B30;BALINESE LETTER SA SAGA;Lo;0;L;;;;;N;;;;;
+1B31;BALINESE LETTER SA SAPA;Lo;0;L;;;;;N;;;;;
+1B32;BALINESE LETTER SA;Lo;0;L;;;;;N;;;;;
+1B33;BALINESE LETTER HA;Lo;0;L;;;;;N;;;;;
+1B34;BALINESE SIGN REREKAN;Mn;7;NSM;;;;;N;;;;;
+1B35;BALINESE VOWEL SIGN TEDUNG;Mc;0;L;;;;;N;;;;;
+1B36;BALINESE VOWEL SIGN ULU;Mn;0;NSM;;;;;N;;;;;
+1B37;BALINESE VOWEL SIGN ULU SARI;Mn;0;NSM;;;;;N;;;;;
+1B38;BALINESE VOWEL SIGN SUKU;Mn;0;NSM;;;;;N;;;;;
+1B39;BALINESE VOWEL SIGN SUKU ILUT;Mn;0;NSM;;;;;N;;;;;
+1B3A;BALINESE VOWEL SIGN RA REPA;Mn;0;NSM;;;;;N;;;;;
+1B3B;BALINESE VOWEL SIGN RA REPA TEDUNG;Mc;0;L;1B3A 1B35;;;;N;;;;;
+1B3C;BALINESE VOWEL SIGN LA LENGA;Mn;0;NSM;;;;;N;;;;;
+1B3D;BALINESE VOWEL SIGN LA LENGA TEDUNG;Mc;0;L;1B3C 1B35;;;;N;;;;;
+1B3E;BALINESE VOWEL SIGN TALING;Mc;0;L;;;;;N;;;;;
+1B3F;BALINESE VOWEL SIGN TALING REPA;Mc;0;L;;;;;N;;;;;
+1B40;BALINESE VOWEL SIGN TALING TEDUNG;Mc;0;L;1B3E 1B35;;;;N;;;;;
+1B41;BALINESE VOWEL SIGN TALING REPA TEDUNG;Mc;0;L;1B3F 1B35;;;;N;;;;;
+1B42;BALINESE VOWEL SIGN PEPET;Mn;0;NSM;;;;;N;;;;;
+1B43;BALINESE VOWEL SIGN PEPET TEDUNG;Mc;0;L;1B42 1B35;;;;N;;;;;
+1B44;BALINESE ADEG ADEG;Mc;9;L;;;;;N;;;;;
+1B45;BALINESE LETTER KAF SASAK;Lo;0;L;;;;;N;;;;;
+1B46;BALINESE LETTER KHOT SASAK;Lo;0;L;;;;;N;;;;;
+1B47;BALINESE LETTER TZIR SASAK;Lo;0;L;;;;;N;;;;;
+1B48;BALINESE LETTER EF SASAK;Lo;0;L;;;;;N;;;;;
+1B49;BALINESE LETTER VE SASAK;Lo;0;L;;;;;N;;;;;
+1B4A;BALINESE LETTER ZAL SASAK;Lo;0;L;;;;;N;;;;;
+1B4B;BALINESE LETTER ASYURA SASAK;Lo;0;L;;;;;N;;;;;
+1B50;BALINESE DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+1B51;BALINESE DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+1B52;BALINESE DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+1B53;BALINESE DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+1B54;BALINESE DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+1B55;BALINESE DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+1B56;BALINESE DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+1B57;BALINESE DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+1B58;BALINESE DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+1B59;BALINESE DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+1B5A;BALINESE PANTI;Po;0;L;;;;;N;;;;;
+1B5B;BALINESE PAMADA;Po;0;L;;;;;N;;;;;
+1B5C;BALINESE WINDU;Po;0;L;;;;;N;;;;;
+1B5D;BALINESE CARIK PAMUNGKAH;Po;0;L;;;;;N;;;;;
+1B5E;BALINESE CARIK SIKI;Po;0;L;;;;;N;;;;;
+1B5F;BALINESE CARIK PAREREN;Po;0;L;;;;;N;;;;;
+1B60;BALINESE PAMENENG;Po;0;L;;;;;N;;;;;
+1B61;BALINESE MUSICAL SYMBOL DONG;So;0;L;;;;;N;;;;;
+1B62;BALINESE MUSICAL SYMBOL DENG;So;0;L;;;;;N;;;;;
+1B63;BALINESE MUSICAL SYMBOL DUNG;So;0;L;;;;;N;;;;;
+1B64;BALINESE MUSICAL SYMBOL DANG;So;0;L;;;;;N;;;;;
+1B65;BALINESE MUSICAL SYMBOL DANG SURANG;So;0;L;;;;;N;;;;;
+1B66;BALINESE MUSICAL SYMBOL DING;So;0;L;;;;;N;;;;;
+1B67;BALINESE MUSICAL SYMBOL DAENG;So;0;L;;;;;N;;;;;
+1B68;BALINESE MUSICAL SYMBOL DEUNG;So;0;L;;;;;N;;;;;
+1B69;BALINESE MUSICAL SYMBOL DAING;So;0;L;;;;;N;;;;;
+1B6A;BALINESE MUSICAL SYMBOL DANG GEDE;So;0;L;;;;;N;;;;;
+1B6B;BALINESE MUSICAL SYMBOL COMBINING TEGEH;Mn;230;NSM;;;;;N;;;;;
+1B6C;BALINESE MUSICAL SYMBOL COMBINING ENDEP;Mn;220;NSM;;;;;N;;;;;
+1B6D;BALINESE MUSICAL SYMBOL COMBINING KEMPUL;Mn;230;NSM;;;;;N;;;;;
+1B6E;BALINESE MUSICAL SYMBOL COMBINING KEMPLI;Mn;230;NSM;;;;;N;;;;;
+1B6F;BALINESE MUSICAL SYMBOL COMBINING JEGOGAN;Mn;230;NSM;;;;;N;;;;;
+1B70;BALINESE MUSICAL SYMBOL COMBINING KEMPUL WITH JEGOGAN;Mn;230;NSM;;;;;N;;;;;
+1B71;BALINESE MUSICAL SYMBOL COMBINING KEMPLI WITH JEGOGAN;Mn;230;NSM;;;;;N;;;;;
+1B72;BALINESE MUSICAL SYMBOL COMBINING BENDE;Mn;230;NSM;;;;;N;;;;;
+1B73;BALINESE MUSICAL SYMBOL COMBINING GONG;Mn;230;NSM;;;;;N;;;;;
+1B74;BALINESE MUSICAL SYMBOL RIGHT-HAND OPEN DUG;So;0;L;;;;;N;;;;;
+1B75;BALINESE MUSICAL SYMBOL RIGHT-HAND OPEN DAG;So;0;L;;;;;N;;;;;
+1B76;BALINESE MUSICAL SYMBOL RIGHT-HAND CLOSED TUK;So;0;L;;;;;N;;;;;
+1B77;BALINESE MUSICAL SYMBOL RIGHT-HAND CLOSED TAK;So;0;L;;;;;N;;;;;
+1B78;BALINESE MUSICAL SYMBOL LEFT-HAND OPEN PANG;So;0;L;;;;;N;;;;;
+1B79;BALINESE MUSICAL SYMBOL LEFT-HAND OPEN PUNG;So;0;L;;;;;N;;;;;
+1B7A;BALINESE MUSICAL SYMBOL LEFT-HAND CLOSED PLAK;So;0;L;;;;;N;;;;;
+1B7B;BALINESE MUSICAL SYMBOL LEFT-HAND CLOSED PLUK;So;0;L;;;;;N;;;;;
+1B7C;BALINESE MUSICAL SYMBOL LEFT-HAND OPEN PING;So;0;L;;;;;N;;;;;
+1B80;SUNDANESE SIGN PANYECEK;Mn;0;NSM;;;;;N;;;;;
+1B81;SUNDANESE SIGN PANGLAYAR;Mn;0;NSM;;;;;N;;;;;
+1B82;SUNDANESE SIGN PANGWISAD;Mc;0;L;;;;;N;;;;;
+1B83;SUNDANESE LETTER A;Lo;0;L;;;;;N;;;;;
+1B84;SUNDANESE LETTER I;Lo;0;L;;;;;N;;;;;
+1B85;SUNDANESE LETTER U;Lo;0;L;;;;;N;;;;;
+1B86;SUNDANESE LETTER AE;Lo;0;L;;;;;N;;;;;
+1B87;SUNDANESE LETTER O;Lo;0;L;;;;;N;;;;;
+1B88;SUNDANESE LETTER E;Lo;0;L;;;;;N;;;;;
+1B89;SUNDANESE LETTER EU;Lo;0;L;;;;;N;;;;;
+1B8A;SUNDANESE LETTER KA;Lo;0;L;;;;;N;;;;;
+1B8B;SUNDANESE LETTER QA;Lo;0;L;;;;;N;;;;;
+1B8C;SUNDANESE LETTER GA;Lo;0;L;;;;;N;;;;;
+1B8D;SUNDANESE LETTER NGA;Lo;0;L;;;;;N;;;;;
+1B8E;SUNDANESE LETTER CA;Lo;0;L;;;;;N;;;;;
+1B8F;SUNDANESE LETTER JA;Lo;0;L;;;;;N;;;;;
+1B90;SUNDANESE LETTER ZA;Lo;0;L;;;;;N;;;;;
+1B91;SUNDANESE LETTER NYA;Lo;0;L;;;;;N;;;;;
+1B92;SUNDANESE LETTER TA;Lo;0;L;;;;;N;;;;;
+1B93;SUNDANESE LETTER DA;Lo;0;L;;;;;N;;;;;
+1B94;SUNDANESE LETTER NA;Lo;0;L;;;;;N;;;;;
+1B95;SUNDANESE LETTER PA;Lo;0;L;;;;;N;;;;;
+1B96;SUNDANESE LETTER FA;Lo;0;L;;;;;N;;;;;
+1B97;SUNDANESE LETTER VA;Lo;0;L;;;;;N;;;;;
+1B98;SUNDANESE LETTER BA;Lo;0;L;;;;;N;;;;;
+1B99;SUNDANESE LETTER MA;Lo;0;L;;;;;N;;;;;
+1B9A;SUNDANESE LETTER YA;Lo;0;L;;;;;N;;;;;
+1B9B;SUNDANESE LETTER RA;Lo;0;L;;;;;N;;;;;
+1B9C;SUNDANESE LETTER LA;Lo;0;L;;;;;N;;;;;
+1B9D;SUNDANESE LETTER WA;Lo;0;L;;;;;N;;;;;
+1B9E;SUNDANESE LETTER SA;Lo;0;L;;;;;N;;;;;
+1B9F;SUNDANESE LETTER XA;Lo;0;L;;;;;N;;;;;
+1BA0;SUNDANESE LETTER HA;Lo;0;L;;;;;N;;;;;
+1BA1;SUNDANESE CONSONANT SIGN PAMINGKAL;Mc;0;L;;;;;N;;;;;
+1BA2;SUNDANESE CONSONANT SIGN PANYAKRA;Mn;0;NSM;;;;;N;;;;;
+1BA3;SUNDANESE CONSONANT SIGN PANYIKU;Mn;0;NSM;;;;;N;;;;;
+1BA4;SUNDANESE VOWEL SIGN PANGHULU;Mn;0;NSM;;;;;N;;;;;
+1BA5;SUNDANESE VOWEL SIGN PANYUKU;Mn;0;NSM;;;;;N;;;;;
+1BA6;SUNDANESE VOWEL SIGN PANAELAENG;Mc;0;L;;;;;N;;;;;
+1BA7;SUNDANESE VOWEL SIGN PANOLONG;Mc;0;L;;;;;N;;;;;
+1BA8;SUNDANESE VOWEL SIGN PAMEPET;Mn;0;NSM;;;;;N;;;;;
+1BA9;SUNDANESE VOWEL SIGN PANEULEUNG;Mn;0;NSM;;;;;N;;;;;
+1BAA;SUNDANESE SIGN PAMAAEH;Mc;9;L;;;;;N;;;;;
+1BAB;SUNDANESE SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+1BAC;SUNDANESE CONSONANT SIGN PASANGAN MA;Mn;0;NSM;;;;;N;;;;;
+1BAD;SUNDANESE CONSONANT SIGN PASANGAN WA;Mn;0;NSM;;;;;N;;;;;
+1BAE;SUNDANESE LETTER KHA;Lo;0;L;;;;;N;;;;;
+1BAF;SUNDANESE LETTER SYA;Lo;0;L;;;;;N;;;;;
+1BB0;SUNDANESE DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+1BB1;SUNDANESE DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+1BB2;SUNDANESE DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+1BB3;SUNDANESE DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+1BB4;SUNDANESE DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+1BB5;SUNDANESE DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+1BB6;SUNDANESE DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+1BB7;SUNDANESE DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+1BB8;SUNDANESE DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+1BB9;SUNDANESE DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+1BBA;SUNDANESE AVAGRAHA;Lo;0;L;;;;;N;;;;;
+1BBB;SUNDANESE LETTER REU;Lo;0;L;;;;;N;;;;;
+1BBC;SUNDANESE LETTER LEU;Lo;0;L;;;;;N;;;;;
+1BBD;SUNDANESE LETTER BHA;Lo;0;L;;;;;N;;;;;
+1BBE;SUNDANESE LETTER FINAL K;Lo;0;L;;;;;N;;;;;
+1BBF;SUNDANESE LETTER FINAL M;Lo;0;L;;;;;N;;;;;
+1BC0;BATAK LETTER A;Lo;0;L;;;;;N;;;;;
+1BC1;BATAK LETTER SIMALUNGUN A;Lo;0;L;;;;;N;;;;;
+1BC2;BATAK LETTER HA;Lo;0;L;;;;;N;;;;;
+1BC3;BATAK LETTER SIMALUNGUN HA;Lo;0;L;;;;;N;;;;;
+1BC4;BATAK LETTER MANDAILING HA;Lo;0;L;;;;;N;;;;;
+1BC5;BATAK LETTER BA;Lo;0;L;;;;;N;;;;;
+1BC6;BATAK LETTER KARO BA;Lo;0;L;;;;;N;;;;;
+1BC7;BATAK LETTER PA;Lo;0;L;;;;;N;;;;;
+1BC8;BATAK LETTER SIMALUNGUN PA;Lo;0;L;;;;;N;;;;;
+1BC9;BATAK LETTER NA;Lo;0;L;;;;;N;;;;;
+1BCA;BATAK LETTER MANDAILING NA;Lo;0;L;;;;;N;;;;;
+1BCB;BATAK LETTER WA;Lo;0;L;;;;;N;;;;;
+1BCC;BATAK LETTER SIMALUNGUN WA;Lo;0;L;;;;;N;;;;;
+1BCD;BATAK LETTER PAKPAK WA;Lo;0;L;;;;;N;;;;;
+1BCE;BATAK LETTER GA;Lo;0;L;;;;;N;;;;;
+1BCF;BATAK LETTER SIMALUNGUN GA;Lo;0;L;;;;;N;;;;;
+1BD0;BATAK LETTER JA;Lo;0;L;;;;;N;;;;;
+1BD1;BATAK LETTER DA;Lo;0;L;;;;;N;;;;;
+1BD2;BATAK LETTER RA;Lo;0;L;;;;;N;;;;;
+1BD3;BATAK LETTER SIMALUNGUN RA;Lo;0;L;;;;;N;;;;;
+1BD4;BATAK LETTER MA;Lo;0;L;;;;;N;;;;;
+1BD5;BATAK LETTER SIMALUNGUN MA;Lo;0;L;;;;;N;;;;;
+1BD6;BATAK LETTER SOUTHERN TA;Lo;0;L;;;;;N;;;;;
+1BD7;BATAK LETTER NORTHERN TA;Lo;0;L;;;;;N;;;;;
+1BD8;BATAK LETTER SA;Lo;0;L;;;;;N;;;;;
+1BD9;BATAK LETTER SIMALUNGUN SA;Lo;0;L;;;;;N;;;;;
+1BDA;BATAK LETTER MANDAILING SA;Lo;0;L;;;;;N;;;;;
+1BDB;BATAK LETTER YA;Lo;0;L;;;;;N;;;;;
+1BDC;BATAK LETTER SIMALUNGUN YA;Lo;0;L;;;;;N;;;;;
+1BDD;BATAK LETTER NGA;Lo;0;L;;;;;N;;;;;
+1BDE;BATAK LETTER LA;Lo;0;L;;;;;N;;;;;
+1BDF;BATAK LETTER SIMALUNGUN LA;Lo;0;L;;;;;N;;;;;
+1BE0;BATAK LETTER NYA;Lo;0;L;;;;;N;;;;;
+1BE1;BATAK LETTER CA;Lo;0;L;;;;;N;;;;;
+1BE2;BATAK LETTER NDA;Lo;0;L;;;;;N;;;;;
+1BE3;BATAK LETTER MBA;Lo;0;L;;;;;N;;;;;
+1BE4;BATAK LETTER I;Lo;0;L;;;;;N;;;;;
+1BE5;BATAK LETTER U;Lo;0;L;;;;;N;;;;;
+1BE6;BATAK SIGN TOMPI;Mn;7;NSM;;;;;N;;;;;
+1BE7;BATAK VOWEL SIGN E;Mc;0;L;;;;;N;;;;;
+1BE8;BATAK VOWEL SIGN PAKPAK E;Mn;0;NSM;;;;;N;;;;;
+1BE9;BATAK VOWEL SIGN EE;Mn;0;NSM;;;;;N;;;;;
+1BEA;BATAK VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+1BEB;BATAK VOWEL SIGN KARO I;Mc;0;L;;;;;N;;;;;
+1BEC;BATAK VOWEL SIGN O;Mc;0;L;;;;;N;;;;;
+1BED;BATAK VOWEL SIGN KARO O;Mn;0;NSM;;;;;N;;;;;
+1BEE;BATAK VOWEL SIGN U;Mc;0;L;;;;;N;;;;;
+1BEF;BATAK VOWEL SIGN U FOR SIMALUNGUN SA;Mn;0;NSM;;;;;N;;;;;
+1BF0;BATAK CONSONANT SIGN NG;Mn;0;NSM;;;;;N;;;;;
+1BF1;BATAK CONSONANT SIGN H;Mn;0;NSM;;;;;N;;;;;
+1BF2;BATAK PANGOLAT;Mc;9;L;;;;;N;;;;;
+1BF3;BATAK PANONGONAN;Mc;9;L;;;;;N;;;;;
+1BFC;BATAK SYMBOL BINDU NA METEK;Po;0;L;;;;;N;;;;;
+1BFD;BATAK SYMBOL BINDU PINARBORAS;Po;0;L;;;;;N;;;;;
+1BFE;BATAK SYMBOL BINDU JUDUL;Po;0;L;;;;;N;;;;;
+1BFF;BATAK SYMBOL BINDU PANGOLAT;Po;0;L;;;;;N;;;;;
+1C00;LEPCHA LETTER KA;Lo;0;L;;;;;N;;;;;
+1C01;LEPCHA LETTER KLA;Lo;0;L;;;;;N;;;;;
+1C02;LEPCHA LETTER KHA;Lo;0;L;;;;;N;;;;;
+1C03;LEPCHA LETTER GA;Lo;0;L;;;;;N;;;;;
+1C04;LEPCHA LETTER GLA;Lo;0;L;;;;;N;;;;;
+1C05;LEPCHA LETTER NGA;Lo;0;L;;;;;N;;;;;
+1C06;LEPCHA LETTER CA;Lo;0;L;;;;;N;;;;;
+1C07;LEPCHA LETTER CHA;Lo;0;L;;;;;N;;;;;
+1C08;LEPCHA LETTER JA;Lo;0;L;;;;;N;;;;;
+1C09;LEPCHA LETTER NYA;Lo;0;L;;;;;N;;;;;
+1C0A;LEPCHA LETTER TA;Lo;0;L;;;;;N;;;;;
+1C0B;LEPCHA LETTER THA;Lo;0;L;;;;;N;;;;;
+1C0C;LEPCHA LETTER DA;Lo;0;L;;;;;N;;;;;
+1C0D;LEPCHA LETTER NA;Lo;0;L;;;;;N;;;;;
+1C0E;LEPCHA LETTER PA;Lo;0;L;;;;;N;;;;;
+1C0F;LEPCHA LETTER PLA;Lo;0;L;;;;;N;;;;;
+1C10;LEPCHA LETTER PHA;Lo;0;L;;;;;N;;;;;
+1C11;LEPCHA LETTER FA;Lo;0;L;;;;;N;;;;;
+1C12;LEPCHA LETTER FLA;Lo;0;L;;;;;N;;;;;
+1C13;LEPCHA LETTER BA;Lo;0;L;;;;;N;;;;;
+1C14;LEPCHA LETTER BLA;Lo;0;L;;;;;N;;;;;
+1C15;LEPCHA LETTER MA;Lo;0;L;;;;;N;;;;;
+1C16;LEPCHA LETTER MLA;Lo;0;L;;;;;N;;;;;
+1C17;LEPCHA LETTER TSA;Lo;0;L;;;;;N;;;;;
+1C18;LEPCHA LETTER TSHA;Lo;0;L;;;;;N;;;;;
+1C19;LEPCHA LETTER DZA;Lo;0;L;;;;;N;;;;;
+1C1A;LEPCHA LETTER YA;Lo;0;L;;;;;N;;;;;
+1C1B;LEPCHA LETTER RA;Lo;0;L;;;;;N;;;;;
+1C1C;LEPCHA LETTER LA;Lo;0;L;;;;;N;;;;;
+1C1D;LEPCHA LETTER HA;Lo;0;L;;;;;N;;;;;
+1C1E;LEPCHA LETTER HLA;Lo;0;L;;;;;N;;;;;
+1C1F;LEPCHA LETTER VA;Lo;0;L;;;;;N;;;;;
+1C20;LEPCHA LETTER SA;Lo;0;L;;;;;N;;;;;
+1C21;LEPCHA LETTER SHA;Lo;0;L;;;;;N;;;;;
+1C22;LEPCHA LETTER WA;Lo;0;L;;;;;N;;;;;
+1C23;LEPCHA LETTER A;Lo;0;L;;;;;N;;;;;
+1C24;LEPCHA SUBJOINED LETTER YA;Mc;0;L;;;;;N;;;;;
+1C25;LEPCHA SUBJOINED LETTER RA;Mc;0;L;;;;;N;;;;;
+1C26;LEPCHA VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+1C27;LEPCHA VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+1C28;LEPCHA VOWEL SIGN O;Mc;0;L;;;;;N;;;;;
+1C29;LEPCHA VOWEL SIGN OO;Mc;0;L;;;;;N;;;;;
+1C2A;LEPCHA VOWEL SIGN U;Mc;0;L;;;;;N;;;;;
+1C2B;LEPCHA VOWEL SIGN UU;Mc;0;L;;;;;N;;;;;
+1C2C;LEPCHA VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+1C2D;LEPCHA CONSONANT SIGN K;Mn;0;NSM;;;;;N;;;;;
+1C2E;LEPCHA CONSONANT SIGN M;Mn;0;NSM;;;;;N;;;;;
+1C2F;LEPCHA CONSONANT SIGN L;Mn;0;NSM;;;;;N;;;;;
+1C30;LEPCHA CONSONANT SIGN N;Mn;0;NSM;;;;;N;;;;;
+1C31;LEPCHA CONSONANT SIGN P;Mn;0;NSM;;;;;N;;;;;
+1C32;LEPCHA CONSONANT SIGN R;Mn;0;NSM;;;;;N;;;;;
+1C33;LEPCHA CONSONANT SIGN T;Mn;0;NSM;;;;;N;;;;;
+1C34;LEPCHA CONSONANT SIGN NYIN-DO;Mc;0;L;;;;;N;;;;;
+1C35;LEPCHA CONSONANT SIGN KANG;Mc;0;L;;;;;N;;;;;
+1C36;LEPCHA SIGN RAN;Mn;0;NSM;;;;;N;;;;;
+1C37;LEPCHA SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+1C3B;LEPCHA PUNCTUATION TA-ROL;Po;0;L;;;;;N;;;;;
+1C3C;LEPCHA PUNCTUATION NYET THYOOM TA-ROL;Po;0;L;;;;;N;;;;;
+1C3D;LEPCHA PUNCTUATION CER-WA;Po;0;L;;;;;N;;;;;
+1C3E;LEPCHA PUNCTUATION TSHOOK CER-WA;Po;0;L;;;;;N;;;;;
+1C3F;LEPCHA PUNCTUATION TSHOOK;Po;0;L;;;;;N;;;;;
+1C40;LEPCHA DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+1C41;LEPCHA DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+1C42;LEPCHA DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+1C43;LEPCHA DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+1C44;LEPCHA DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+1C45;LEPCHA DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+1C46;LEPCHA DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+1C47;LEPCHA DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+1C48;LEPCHA DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+1C49;LEPCHA DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+1C4D;LEPCHA LETTER TTA;Lo;0;L;;;;;N;;;;;
+1C4E;LEPCHA LETTER TTHA;Lo;0;L;;;;;N;;;;;
+1C4F;LEPCHA LETTER DDA;Lo;0;L;;;;;N;;;;;
+1C50;OL CHIKI DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+1C51;OL CHIKI DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+1C52;OL CHIKI DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+1C53;OL CHIKI DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+1C54;OL CHIKI DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+1C55;OL CHIKI DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+1C56;OL CHIKI DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+1C57;OL CHIKI DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+1C58;OL CHIKI DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+1C59;OL CHIKI DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+1C5A;OL CHIKI LETTER LA;Lo;0;L;;;;;N;;;;;
+1C5B;OL CHIKI LETTER AT;Lo;0;L;;;;;N;;;;;
+1C5C;OL CHIKI LETTER AG;Lo;0;L;;;;;N;;;;;
+1C5D;OL CHIKI LETTER ANG;Lo;0;L;;;;;N;;;;;
+1C5E;OL CHIKI LETTER AL;Lo;0;L;;;;;N;;;;;
+1C5F;OL CHIKI LETTER LAA;Lo;0;L;;;;;N;;;;;
+1C60;OL CHIKI LETTER AAK;Lo;0;L;;;;;N;;;;;
+1C61;OL CHIKI LETTER AAJ;Lo;0;L;;;;;N;;;;;
+1C62;OL CHIKI LETTER AAM;Lo;0;L;;;;;N;;;;;
+1C63;OL CHIKI LETTER AAW;Lo;0;L;;;;;N;;;;;
+1C64;OL CHIKI LETTER LI;Lo;0;L;;;;;N;;;;;
+1C65;OL CHIKI LETTER IS;Lo;0;L;;;;;N;;;;;
+1C66;OL CHIKI LETTER IH;Lo;0;L;;;;;N;;;;;
+1C67;OL CHIKI LETTER INY;Lo;0;L;;;;;N;;;;;
+1C68;OL CHIKI LETTER IR;Lo;0;L;;;;;N;;;;;
+1C69;OL CHIKI LETTER LU;Lo;0;L;;;;;N;;;;;
+1C6A;OL CHIKI LETTER UC;Lo;0;L;;;;;N;;;;;
+1C6B;OL CHIKI LETTER UD;Lo;0;L;;;;;N;;;;;
+1C6C;OL CHIKI LETTER UNN;Lo;0;L;;;;;N;;;;;
+1C6D;OL CHIKI LETTER UY;Lo;0;L;;;;;N;;;;;
+1C6E;OL CHIKI LETTER LE;Lo;0;L;;;;;N;;;;;
+1C6F;OL CHIKI LETTER EP;Lo;0;L;;;;;N;;;;;
+1C70;OL CHIKI LETTER EDD;Lo;0;L;;;;;N;;;;;
+1C71;OL CHIKI LETTER EN;Lo;0;L;;;;;N;;;;;
+1C72;OL CHIKI LETTER ERR;Lo;0;L;;;;;N;;;;;
+1C73;OL CHIKI LETTER LO;Lo;0;L;;;;;N;;;;;
+1C74;OL CHIKI LETTER OTT;Lo;0;L;;;;;N;;;;;
+1C75;OL CHIKI LETTER OB;Lo;0;L;;;;;N;;;;;
+1C76;OL CHIKI LETTER OV;Lo;0;L;;;;;N;;;;;
+1C77;OL CHIKI LETTER OH;Lo;0;L;;;;;N;;;;;
+1C78;OL CHIKI MU TTUDDAG;Lm;0;L;;;;;N;;;;;
+1C79;OL CHIKI GAAHLAA TTUDDAAG;Lm;0;L;;;;;N;;;;;
+1C7A;OL CHIKI MU-GAAHLAA TTUDDAAG;Lm;0;L;;;;;N;;;;;
+1C7B;OL CHIKI RELAA;Lm;0;L;;;;;N;;;;;
+1C7C;OL CHIKI PHAARKAA;Lm;0;L;;;;;N;;;;;
+1C7D;OL CHIKI AHAD;Lm;0;L;;;;;N;;;;;
+1C7E;OL CHIKI PUNCTUATION MUCAAD;Po;0;L;;;;;N;;;;;
+1C7F;OL CHIKI PUNCTUATION DOUBLE MUCAAD;Po;0;L;;;;;N;;;;;
+1C80;CYRILLIC SMALL LETTER ROUNDED VE;Ll;0;L;;;;;N;;;0412;;0412
+1C81;CYRILLIC SMALL LETTER LONG-LEGGED DE;Ll;0;L;;;;;N;;;0414;;0414
+1C82;CYRILLIC SMALL LETTER NARROW O;Ll;0;L;;;;;N;;;041E;;041E
+1C83;CYRILLIC SMALL LETTER WIDE ES;Ll;0;L;;;;;N;;;0421;;0421
+1C84;CYRILLIC SMALL LETTER TALL TE;Ll;0;L;;;;;N;;;0422;;0422
+1C85;CYRILLIC SMALL LETTER THREE-LEGGED TE;Ll;0;L;;;;;N;;;0422;;0422
+1C86;CYRILLIC SMALL LETTER TALL HARD SIGN;Ll;0;L;;;;;N;;;042A;;042A
+1C87;CYRILLIC SMALL LETTER TALL YAT;Ll;0;L;;;;;N;;;0462;;0462
+1C88;CYRILLIC SMALL LETTER UNBLENDED UK;Ll;0;L;;;;;N;;;A64A;;A64A
+1CC0;SUNDANESE PUNCTUATION BINDU SURYA;Po;0;L;;;;;N;;;;;
+1CC1;SUNDANESE PUNCTUATION BINDU PANGLONG;Po;0;L;;;;;N;;;;;
+1CC2;SUNDANESE PUNCTUATION BINDU PURNAMA;Po;0;L;;;;;N;;;;;
+1CC3;SUNDANESE PUNCTUATION BINDU CAKRA;Po;0;L;;;;;N;;;;;
+1CC4;SUNDANESE PUNCTUATION BINDU LEU SATANGA;Po;0;L;;;;;N;;;;;
+1CC5;SUNDANESE PUNCTUATION BINDU KA SATANGA;Po;0;L;;;;;N;;;;;
+1CC6;SUNDANESE PUNCTUATION BINDU DA SATANGA;Po;0;L;;;;;N;;;;;
+1CC7;SUNDANESE PUNCTUATION BINDU BA SATANGA;Po;0;L;;;;;N;;;;;
+1CD0;VEDIC TONE KARSHANA;Mn;230;NSM;;;;;N;;;;;
+1CD1;VEDIC TONE SHARA;Mn;230;NSM;;;;;N;;;;;
+1CD2;VEDIC TONE PRENKHA;Mn;230;NSM;;;;;N;;;;;
+1CD3;VEDIC SIGN NIHSHVASA;Po;0;L;;;;;N;;;;;
+1CD4;VEDIC SIGN YAJURVEDIC MIDLINE SVARITA;Mn;1;NSM;;;;;N;;;;;
+1CD5;VEDIC TONE YAJURVEDIC AGGRAVATED INDEPENDENT SVARITA;Mn;220;NSM;;;;;N;;;;;
+1CD6;VEDIC TONE YAJURVEDIC INDEPENDENT SVARITA;Mn;220;NSM;;;;;N;;;;;
+1CD7;VEDIC TONE YAJURVEDIC KATHAKA INDEPENDENT SVARITA;Mn;220;NSM;;;;;N;;;;;
+1CD8;VEDIC TONE CANDRA BELOW;Mn;220;NSM;;;;;N;;;;;
+1CD9;VEDIC TONE YAJURVEDIC KATHAKA INDEPENDENT SVARITA SCHROEDER;Mn;220;NSM;;;;;N;;;;;
+1CDA;VEDIC TONE DOUBLE SVARITA;Mn;230;NSM;;;;;N;;;;;
+1CDB;VEDIC TONE TRIPLE SVARITA;Mn;230;NSM;;;;;N;;;;;
+1CDC;VEDIC TONE KATHAKA ANUDATTA;Mn;220;NSM;;;;;N;;;;;
+1CDD;VEDIC TONE DOT BELOW;Mn;220;NSM;;;;;N;;;;;
+1CDE;VEDIC TONE TWO DOTS BELOW;Mn;220;NSM;;;;;N;;;;;
+1CDF;VEDIC TONE THREE DOTS BELOW;Mn;220;NSM;;;;;N;;;;;
+1CE0;VEDIC TONE RIGVEDIC KASHMIRI INDEPENDENT SVARITA;Mn;230;NSM;;;;;N;;;;;
+1CE1;VEDIC TONE ATHARVAVEDIC INDEPENDENT SVARITA;Mc;0;L;;;;;N;;;;;
+1CE2;VEDIC SIGN VISARGA SVARITA;Mn;1;NSM;;;;;N;;;;;
+1CE3;VEDIC SIGN VISARGA UDATTA;Mn;1;NSM;;;;;N;;;;;
+1CE4;VEDIC SIGN REVERSED VISARGA UDATTA;Mn;1;NSM;;;;;N;;;;;
+1CE5;VEDIC SIGN VISARGA ANUDATTA;Mn;1;NSM;;;;;N;;;;;
+1CE6;VEDIC SIGN REVERSED VISARGA ANUDATTA;Mn;1;NSM;;;;;N;;;;;
+1CE7;VEDIC SIGN VISARGA UDATTA WITH TAIL;Mn;1;NSM;;;;;N;;;;;
+1CE8;VEDIC SIGN VISARGA ANUDATTA WITH TAIL;Mn;1;NSM;;;;;N;;;;;
+1CE9;VEDIC SIGN ANUSVARA ANTARGOMUKHA;Lo;0;L;;;;;N;;;;;
+1CEA;VEDIC SIGN ANUSVARA BAHIRGOMUKHA;Lo;0;L;;;;;N;;;;;
+1CEB;VEDIC SIGN ANUSVARA VAMAGOMUKHA;Lo;0;L;;;;;N;;;;;
+1CEC;VEDIC SIGN ANUSVARA VAMAGOMUKHA WITH TAIL;Lo;0;L;;;;;N;;;;;
+1CED;VEDIC SIGN TIRYAK;Mn;220;NSM;;;;;N;;;;;
+1CEE;VEDIC SIGN HEXIFORM LONG ANUSVARA;Lo;0;L;;;;;N;;;;;
+1CEF;VEDIC SIGN LONG ANUSVARA;Lo;0;L;;;;;N;;;;;
+1CF0;VEDIC SIGN RTHANG LONG ANUSVARA;Lo;0;L;;;;;N;;;;;
+1CF1;VEDIC SIGN ANUSVARA UBHAYATO MUKHA;Lo;0;L;;;;;N;;;;;
+1CF2;VEDIC SIGN ARDHAVISARGA;Mc;0;L;;;;;N;;;;;
+1CF3;VEDIC SIGN ROTATED ARDHAVISARGA;Mc;0;L;;;;;N;;;;;
+1CF4;VEDIC TONE CANDRA ABOVE;Mn;230;NSM;;;;;N;;;;;
+1CF5;VEDIC SIGN JIHVAMULIYA;Lo;0;L;;;;;N;;;;;
+1CF6;VEDIC SIGN UPADHMANIYA;Lo;0;L;;;;;N;;;;;
+1CF7;VEDIC SIGN ATIKRAMA;Mc;0;L;;;;;N;;;;;
+1CF8;VEDIC TONE RING ABOVE;Mn;230;NSM;;;;;N;;;;;
+1CF9;VEDIC TONE DOUBLE RING ABOVE;Mn;230;NSM;;;;;N;;;;;
+1D00;LATIN LETTER SMALL CAPITAL A;Ll;0;L;;;;;N;;;;;
+1D01;LATIN LETTER SMALL CAPITAL AE;Ll;0;L;;;;;N;;;;;
+1D02;LATIN SMALL LETTER TURNED AE;Ll;0;L;;;;;N;;;;;
+1D03;LATIN LETTER SMALL CAPITAL BARRED B;Ll;0;L;;;;;N;;;;;
+1D04;LATIN LETTER SMALL CAPITAL C;Ll;0;L;;;;;N;;;;;
+1D05;LATIN LETTER SMALL CAPITAL D;Ll;0;L;;;;;N;;;;;
+1D06;LATIN LETTER SMALL CAPITAL ETH;Ll;0;L;;;;;N;;;;;
+1D07;LATIN LETTER SMALL CAPITAL E;Ll;0;L;;;;;N;;;;;
+1D08;LATIN SMALL LETTER TURNED OPEN E;Ll;0;L;;;;;N;;;;;
+1D09;LATIN SMALL LETTER TURNED I;Ll;0;L;;;;;N;;;;;
+1D0A;LATIN LETTER SMALL CAPITAL J;Ll;0;L;;;;;N;;;;;
+1D0B;LATIN LETTER SMALL CAPITAL K;Ll;0;L;;;;;N;;;;;
+1D0C;LATIN LETTER SMALL CAPITAL L WITH STROKE;Ll;0;L;;;;;N;;;;;
+1D0D;LATIN LETTER SMALL CAPITAL M;Ll;0;L;;;;;N;;;;;
+1D0E;LATIN LETTER SMALL CAPITAL REVERSED N;Ll;0;L;;;;;N;;;;;
+1D0F;LATIN LETTER SMALL CAPITAL O;Ll;0;L;;;;;N;;;;;
+1D10;LATIN LETTER SMALL CAPITAL OPEN O;Ll;0;L;;;;;N;;;;;
+1D11;LATIN SMALL LETTER SIDEWAYS O;Ll;0;L;;;;;N;;;;;
+1D12;LATIN SMALL LETTER SIDEWAYS OPEN O;Ll;0;L;;;;;N;;;;;
+1D13;LATIN SMALL LETTER SIDEWAYS O WITH STROKE;Ll;0;L;;;;;N;;;;;
+1D14;LATIN SMALL LETTER TURNED OE;Ll;0;L;;;;;N;;;;;
+1D15;LATIN LETTER SMALL CAPITAL OU;Ll;0;L;;;;;N;;;;;
+1D16;LATIN SMALL LETTER TOP HALF O;Ll;0;L;;;;;N;;;;;
+1D17;LATIN SMALL LETTER BOTTOM HALF O;Ll;0;L;;;;;N;;;;;
+1D18;LATIN LETTER SMALL CAPITAL P;Ll;0;L;;;;;N;;;;;
+1D19;LATIN LETTER SMALL CAPITAL REVERSED R;Ll;0;L;;;;;N;;;;;
+1D1A;LATIN LETTER SMALL CAPITAL TURNED R;Ll;0;L;;;;;N;;;;;
+1D1B;LATIN LETTER SMALL CAPITAL T;Ll;0;L;;;;;N;;;;;
+1D1C;LATIN LETTER SMALL CAPITAL U;Ll;0;L;;;;;N;;;;;
+1D1D;LATIN SMALL LETTER SIDEWAYS U;Ll;0;L;;;;;N;;;;;
+1D1E;LATIN SMALL LETTER SIDEWAYS DIAERESIZED U;Ll;0;L;;;;;N;;;;;
+1D1F;LATIN SMALL LETTER SIDEWAYS TURNED M;Ll;0;L;;;;;N;;;;;
+1D20;LATIN LETTER SMALL CAPITAL V;Ll;0;L;;;;;N;;;;;
+1D21;LATIN LETTER SMALL CAPITAL W;Ll;0;L;;;;;N;;;;;
+1D22;LATIN LETTER SMALL CAPITAL Z;Ll;0;L;;;;;N;;;;;
+1D23;LATIN LETTER SMALL CAPITAL EZH;Ll;0;L;;;;;N;;;;;
+1D24;LATIN LETTER VOICED LARYNGEAL SPIRANT;Ll;0;L;;;;;N;;;;;
+1D25;LATIN LETTER AIN;Ll;0;L;;;;;N;;;;;
+1D26;GREEK LETTER SMALL CAPITAL GAMMA;Ll;0;L;;;;;N;;;;;
+1D27;GREEK LETTER SMALL CAPITAL LAMDA;Ll;0;L;;;;;N;;;;;
+1D28;GREEK LETTER SMALL CAPITAL PI;Ll;0;L;;;;;N;;;;;
+1D29;GREEK LETTER SMALL CAPITAL RHO;Ll;0;L;;;;;N;;;;;
+1D2A;GREEK LETTER SMALL CAPITAL PSI;Ll;0;L;;;;;N;;;;;
+1D2B;CYRILLIC LETTER SMALL CAPITAL EL;Ll;0;L;;;;;N;;;;;
+1D2C;MODIFIER LETTER CAPITAL A;Lm;0;L;<super> 0041;;;;N;;;;;
+1D2D;MODIFIER LETTER CAPITAL AE;Lm;0;L;<super> 00C6;;;;N;;;;;
+1D2E;MODIFIER LETTER CAPITAL B;Lm;0;L;<super> 0042;;;;N;;;;;
+1D2F;MODIFIER LETTER CAPITAL BARRED B;Lm;0;L;;;;;N;;;;;
+1D30;MODIFIER LETTER CAPITAL D;Lm;0;L;<super> 0044;;;;N;;;;;
+1D31;MODIFIER LETTER CAPITAL E;Lm;0;L;<super> 0045;;;;N;;;;;
+1D32;MODIFIER LETTER CAPITAL REVERSED E;Lm;0;L;<super> 018E;;;;N;;;;;
+1D33;MODIFIER LETTER CAPITAL G;Lm;0;L;<super> 0047;;;;N;;;;;
+1D34;MODIFIER LETTER CAPITAL H;Lm;0;L;<super> 0048;;;;N;;;;;
+1D35;MODIFIER LETTER CAPITAL I;Lm;0;L;<super> 0049;;;;N;;;;;
+1D36;MODIFIER LETTER CAPITAL J;Lm;0;L;<super> 004A;;;;N;;;;;
+1D37;MODIFIER LETTER CAPITAL K;Lm;0;L;<super> 004B;;;;N;;;;;
+1D38;MODIFIER LETTER CAPITAL L;Lm;0;L;<super> 004C;;;;N;;;;;
+1D39;MODIFIER LETTER CAPITAL M;Lm;0;L;<super> 004D;;;;N;;;;;
+1D3A;MODIFIER LETTER CAPITAL N;Lm;0;L;<super> 004E;;;;N;;;;;
+1D3B;MODIFIER LETTER CAPITAL REVERSED N;Lm;0;L;;;;;N;;;;;
+1D3C;MODIFIER LETTER CAPITAL O;Lm;0;L;<super> 004F;;;;N;;;;;
+1D3D;MODIFIER LETTER CAPITAL OU;Lm;0;L;<super> 0222;;;;N;;;;;
+1D3E;MODIFIER LETTER CAPITAL P;Lm;0;L;<super> 0050;;;;N;;;;;
+1D3F;MODIFIER LETTER CAPITAL R;Lm;0;L;<super> 0052;;;;N;;;;;
+1D40;MODIFIER LETTER CAPITAL T;Lm;0;L;<super> 0054;;;;N;;;;;
+1D41;MODIFIER LETTER CAPITAL U;Lm;0;L;<super> 0055;;;;N;;;;;
+1D42;MODIFIER LETTER CAPITAL W;Lm;0;L;<super> 0057;;;;N;;;;;
+1D43;MODIFIER LETTER SMALL A;Lm;0;L;<super> 0061;;;;N;;;;;
+1D44;MODIFIER LETTER SMALL TURNED A;Lm;0;L;<super> 0250;;;;N;;;;;
+1D45;MODIFIER LETTER SMALL ALPHA;Lm;0;L;<super> 0251;;;;N;;;;;
+1D46;MODIFIER LETTER SMALL TURNED AE;Lm;0;L;<super> 1D02;;;;N;;;;;
+1D47;MODIFIER LETTER SMALL B;Lm;0;L;<super> 0062;;;;N;;;;;
+1D48;MODIFIER LETTER SMALL D;Lm;0;L;<super> 0064;;;;N;;;;;
+1D49;MODIFIER LETTER SMALL E;Lm;0;L;<super> 0065;;;;N;;;;;
+1D4A;MODIFIER LETTER SMALL SCHWA;Lm;0;L;<super> 0259;;;;N;;;;;
+1D4B;MODIFIER LETTER SMALL OPEN E;Lm;0;L;<super> 025B;;;;N;;;;;
+1D4C;MODIFIER LETTER SMALL TURNED OPEN E;Lm;0;L;<super> 025C;;;;N;;;;;
+1D4D;MODIFIER LETTER SMALL G;Lm;0;L;<super> 0067;;;;N;;;;;
+1D4E;MODIFIER LETTER SMALL TURNED I;Lm;0;L;;;;;N;;;;;
+1D4F;MODIFIER LETTER SMALL K;Lm;0;L;<super> 006B;;;;N;;;;;
+1D50;MODIFIER LETTER SMALL M;Lm;0;L;<super> 006D;;;;N;;;;;
+1D51;MODIFIER LETTER SMALL ENG;Lm;0;L;<super> 014B;;;;N;;;;;
+1D52;MODIFIER LETTER SMALL O;Lm;0;L;<super> 006F;;;;N;;;;;
+1D53;MODIFIER LETTER SMALL OPEN O;Lm;0;L;<super> 0254;;;;N;;;;;
+1D54;MODIFIER LETTER SMALL TOP HALF O;Lm;0;L;<super> 1D16;;;;N;;;;;
+1D55;MODIFIER LETTER SMALL BOTTOM HALF O;Lm;0;L;<super> 1D17;;;;N;;;;;
+1D56;MODIFIER LETTER SMALL P;Lm;0;L;<super> 0070;;;;N;;;;;
+1D57;MODIFIER LETTER SMALL T;Lm;0;L;<super> 0074;;;;N;;;;;
+1D58;MODIFIER LETTER SMALL U;Lm;0;L;<super> 0075;;;;N;;;;;
+1D59;MODIFIER LETTER SMALL SIDEWAYS U;Lm;0;L;<super> 1D1D;;;;N;;;;;
+1D5A;MODIFIER LETTER SMALL TURNED M;Lm;0;L;<super> 026F;;;;N;;;;;
+1D5B;MODIFIER LETTER SMALL V;Lm;0;L;<super> 0076;;;;N;;;;;
+1D5C;MODIFIER LETTER SMALL AIN;Lm;0;L;<super> 1D25;;;;N;;;;;
+1D5D;MODIFIER LETTER SMALL BETA;Lm;0;L;<super> 03B2;;;;N;;;;;
+1D5E;MODIFIER LETTER SMALL GREEK GAMMA;Lm;0;L;<super> 03B3;;;;N;;;;;
+1D5F;MODIFIER LETTER SMALL DELTA;Lm;0;L;<super> 03B4;;;;N;;;;;
+1D60;MODIFIER LETTER SMALL GREEK PHI;Lm;0;L;<super> 03C6;;;;N;;;;;
+1D61;MODIFIER LETTER SMALL CHI;Lm;0;L;<super> 03C7;;;;N;;;;;
+1D62;LATIN SUBSCRIPT SMALL LETTER I;Lm;0;L; 0069;;;;N;;;;;
+1D63;LATIN SUBSCRIPT SMALL LETTER R;Lm;0;L; 0072;;;;N;;;;;
+1D64;LATIN SUBSCRIPT SMALL LETTER U;Lm;0;L; 0075;;;;N;;;;;
+1D65;LATIN SUBSCRIPT SMALL LETTER V;Lm;0;L; 0076;;;;N;;;;;
+1D66;GREEK SUBSCRIPT SMALL LETTER BETA;Lm;0;L; 03B2;;;;N;;;;;
+1D67;GREEK SUBSCRIPT SMALL LETTER GAMMA;Lm;0;L; 03B3;;;;N;;;;;
+1D68;GREEK SUBSCRIPT SMALL LETTER RHO;Lm;0;L; 03C1;;;;N;;;;;
+1D69;GREEK SUBSCRIPT SMALL LETTER PHI;Lm;0;L; 03C6;;;;N;;;;;
+1D6A;GREEK SUBSCRIPT SMALL LETTER CHI;Lm;0;L; 03C7;;;;N;;;;;
+1D6B;LATIN SMALL LETTER UE;Ll;0;L;;;;;N;;;;;
+1D6C;LATIN SMALL LETTER B WITH MIDDLE TILDE;Ll;0;L;;;;;N;;;;;
+1D6D;LATIN SMALL LETTER D WITH MIDDLE TILDE;Ll;0;L;;;;;N;;;;;
+1D6E;LATIN SMALL LETTER F WITH MIDDLE TILDE;Ll;0;L;;;;;N;;;;;
+1D6F;LATIN SMALL LETTER M WITH MIDDLE TILDE;Ll;0;L;;;;;N;;;;;
+1D70;LATIN SMALL LETTER N WITH MIDDLE TILDE;Ll;0;L;;;;;N;;;;;
+1D71;LATIN SMALL LETTER P WITH MIDDLE TILDE;Ll;0;L;;;;;N;;;;;
+1D72;LATIN SMALL LETTER R WITH MIDDLE TILDE;Ll;0;L;;;;;N;;;;;
+1D73;LATIN SMALL LETTER R WITH FISHHOOK AND MIDDLE TILDE;Ll;0;L;;;;;N;;;;;
+1D74;LATIN SMALL LETTER S WITH MIDDLE TILDE;Ll;0;L;;;;;N;;;;;
+1D75;LATIN SMALL LETTER T WITH MIDDLE TILDE;Ll;0;L;;;;;N;;;;;
+1D76;LATIN SMALL LETTER Z WITH MIDDLE TILDE;Ll;0;L;;;;;N;;;;;
+1D77;LATIN SMALL LETTER TURNED G;Ll;0;L;;;;;N;;;;;
+1D78;MODIFIER LETTER CYRILLIC EN;Lm;0;L;<super> 043D;;;;N;;;;;
+1D79;LATIN SMALL LETTER INSULAR G;Ll;0;L;;;;;N;;;A77D;;A77D
+1D7A;LATIN SMALL LETTER TH WITH STRIKETHROUGH;Ll;0;L;;;;;N;;;;;
+1D7B;LATIN SMALL CAPITAL LETTER I WITH STROKE;Ll;0;L;;;;;N;;;;;
+1D7C;LATIN SMALL LETTER IOTA WITH STROKE;Ll;0;L;;;;;N;;;;;
+1D7D;LATIN SMALL LETTER P WITH STROKE;Ll;0;L;;;;;N;;;2C63;;2C63
+1D7E;LATIN SMALL CAPITAL LETTER U WITH STROKE;Ll;0;L;;;;;N;;;;;
+1D7F;LATIN SMALL LETTER UPSILON WITH STROKE;Ll;0;L;;;;;N;;;;;
+1D80;LATIN SMALL LETTER B WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+1D81;LATIN SMALL LETTER D WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+1D82;LATIN SMALL LETTER F WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+1D83;LATIN SMALL LETTER G WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+1D84;LATIN SMALL LETTER K WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+1D85;LATIN SMALL LETTER L WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+1D86;LATIN SMALL LETTER M WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+1D87;LATIN SMALL LETTER N WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+1D88;LATIN SMALL LETTER P WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+1D89;LATIN SMALL LETTER R WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+1D8A;LATIN SMALL LETTER S WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+1D8B;LATIN SMALL LETTER ESH WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+1D8C;LATIN SMALL LETTER V WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+1D8D;LATIN SMALL LETTER X WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+1D8E;LATIN SMALL LETTER Z WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+1D8F;LATIN SMALL LETTER A WITH RETROFLEX HOOK;Ll;0;L;;;;;N;;;;;
+1D90;LATIN SMALL LETTER ALPHA WITH RETROFLEX HOOK;Ll;0;L;;;;;N;;;;;
+1D91;LATIN SMALL LETTER D WITH HOOK AND TAIL;Ll;0;L;;;;;N;;;;;
+1D92;LATIN SMALL LETTER E WITH RETROFLEX HOOK;Ll;0;L;;;;;N;;;;;
+1D93;LATIN SMALL LETTER OPEN E WITH RETROFLEX HOOK;Ll;0;L;;;;;N;;;;;
+1D94;LATIN SMALL LETTER REVERSED OPEN E WITH RETROFLEX HOOK;Ll;0;L;;;;;N;;;;;
+1D95;LATIN SMALL LETTER SCHWA WITH RETROFLEX HOOK;Ll;0;L;;;;;N;;;;;
+1D96;LATIN SMALL LETTER I WITH RETROFLEX HOOK;Ll;0;L;;;;;N;;;;;
+1D97;LATIN SMALL LETTER OPEN O WITH RETROFLEX HOOK;Ll;0;L;;;;;N;;;;;
+1D98;LATIN SMALL LETTER ESH WITH RETROFLEX HOOK;Ll;0;L;;;;;N;;;;;
+1D99;LATIN SMALL LETTER U WITH RETROFLEX HOOK;Ll;0;L;;;;;N;;;;;
+1D9A;LATIN SMALL LETTER EZH WITH RETROFLEX HOOK;Ll;0;L;;;;;N;;;;;
+1D9B;MODIFIER LETTER SMALL TURNED ALPHA;Lm;0;L;<super> 0252;;;;N;;;;;
+1D9C;MODIFIER LETTER SMALL C;Lm;0;L;<super> 0063;;;;N;;;;;
+1D9D;MODIFIER LETTER SMALL C WITH CURL;Lm;0;L;<super> 0255;;;;N;;;;;
+1D9E;MODIFIER LETTER SMALL ETH;Lm;0;L;<super> 00F0;;;;N;;;;;
+1D9F;MODIFIER LETTER SMALL REVERSED OPEN E;Lm;0;L;<super> 025C;;;;N;;;;;
+1DA0;MODIFIER LETTER SMALL F;Lm;0;L;<super> 0066;;;;N;;;;;
+1DA1;MODIFIER LETTER SMALL DOTLESS J WITH STROKE;Lm;0;L;<super> 025F;;;;N;;;;;
+1DA2;MODIFIER LETTER SMALL SCRIPT G;Lm;0;L;<super> 0261;;;;N;;;;;
+1DA3;MODIFIER LETTER SMALL TURNED H;Lm;0;L;<super> 0265;;;;N;;;;;
+1DA4;MODIFIER LETTER SMALL I WITH STROKE;Lm;0;L;<super> 0268;;;;N;;;;;
+1DA5;MODIFIER LETTER SMALL IOTA;Lm;0;L;<super> 0269;;;;N;;;;;
+1DA6;MODIFIER LETTER SMALL CAPITAL I;Lm;0;L;<super> 026A;;;;N;;;;;
+1DA7;MODIFIER LETTER SMALL CAPITAL I WITH STROKE;Lm;0;L;<super> 1D7B;;;;N;;;;;
+1DA8;MODIFIER LETTER SMALL J WITH CROSSED-TAIL;Lm;0;L;<super> 029D;;;;N;;;;;
+1DA9;MODIFIER LETTER SMALL L WITH RETROFLEX HOOK;Lm;0;L;<super> 026D;;;;N;;;;;
+1DAA;MODIFIER LETTER SMALL L WITH PALATAL HOOK;Lm;0;L;<super> 1D85;;;;N;;;;;
+1DAB;MODIFIER LETTER SMALL CAPITAL L;Lm;0;L;<super> 029F;;;;N;;;;;
+1DAC;MODIFIER LETTER SMALL M WITH HOOK;Lm;0;L;<super> 0271;;;;N;;;;;
+1DAD;MODIFIER LETTER SMALL TURNED M WITH LONG LEG;Lm;0;L;<super> 0270;;;;N;;;;;
+1DAE;MODIFIER LETTER SMALL N WITH LEFT HOOK;Lm;0;L;<super> 0272;;;;N;;;;;
+1DAF;MODIFIER LETTER SMALL N WITH RETROFLEX HOOK;Lm;0;L;<super> 0273;;;;N;;;;;
+1DB0;MODIFIER LETTER SMALL CAPITAL N;Lm;0;L;<super> 0274;;;;N;;;;;
+1DB1;MODIFIER LETTER SMALL BARRED O;Lm;0;L;<super> 0275;;;;N;;;;;
+1DB2;MODIFIER LETTER SMALL PHI;Lm;0;L;<super> 0278;;;;N;;;;;
+1DB3;MODIFIER LETTER SMALL S WITH HOOK;Lm;0;L;<super> 0282;;;;N;;;;;
+1DB4;MODIFIER LETTER SMALL ESH;Lm;0;L;<super> 0283;;;;N;;;;;
+1DB5;MODIFIER LETTER SMALL T WITH PALATAL HOOK;Lm;0;L;<super> 01AB;;;;N;;;;;
+1DB6;MODIFIER LETTER SMALL U BAR;Lm;0;L;<super> 0289;;;;N;;;;;
+1DB7;MODIFIER LETTER SMALL UPSILON;Lm;0;L;<super> 028A;;;;N;;;;;
+1DB8;MODIFIER LETTER SMALL CAPITAL U;Lm;0;L;<super> 1D1C;;;;N;;;;;
+1DB9;MODIFIER LETTER SMALL V WITH HOOK;Lm;0;L;<super> 028B;;;;N;;;;;
+1DBA;MODIFIER LETTER SMALL TURNED V;Lm;0;L;<super> 028C;;;;N;;;;;
+1DBB;MODIFIER LETTER SMALL Z;Lm;0;L;<super> 007A;;;;N;;;;;
+1DBC;MODIFIER LETTER SMALL Z WITH RETROFLEX HOOK;Lm;0;L;<super> 0290;;;;N;;;;;
+1DBD;MODIFIER LETTER SMALL Z WITH CURL;Lm;0;L;<super> 0291;;;;N;;;;;
+1DBE;MODIFIER LETTER SMALL EZH;Lm;0;L;<super> 0292;;;;N;;;;;
+1DBF;MODIFIER LETTER SMALL THETA;Lm;0;L;<super> 03B8;;;;N;;;;;
+1DC0;COMBINING DOTTED GRAVE ACCENT;Mn;230;NSM;;;;;N;;;;;
+1DC1;COMBINING DOTTED ACUTE ACCENT;Mn;230;NSM;;;;;N;;;;;
+1DC2;COMBINING SNAKE BELOW;Mn;220;NSM;;;;;N;;;;;
+1DC3;COMBINING SUSPENSION MARK;Mn;230;NSM;;;;;N;;;;;
+1DC4;COMBINING MACRON-ACUTE;Mn;230;NSM;;;;;N;;;;;
+1DC5;COMBINING GRAVE-MACRON;Mn;230;NSM;;;;;N;;;;;
+1DC6;COMBINING MACRON-GRAVE;Mn;230;NSM;;;;;N;;;;;
+1DC7;COMBINING ACUTE-MACRON;Mn;230;NSM;;;;;N;;;;;
+1DC8;COMBINING GRAVE-ACUTE-GRAVE;Mn;230;NSM;;;;;N;;;;;
+1DC9;COMBINING ACUTE-GRAVE-ACUTE;Mn;230;NSM;;;;;N;;;;;
+1DCA;COMBINING LATIN SMALL LETTER R BELOW;Mn;220;NSM;;;;;N;;;;;
+1DCB;COMBINING BREVE-MACRON;Mn;230;NSM;;;;;N;;;;;
+1DCC;COMBINING MACRON-BREVE;Mn;230;NSM;;;;;N;;;;;
+1DCD;COMBINING DOUBLE CIRCUMFLEX ABOVE;Mn;234;NSM;;;;;N;;;;;
+1DCE;COMBINING OGONEK ABOVE;Mn;214;NSM;;;;;N;;;;;
+1DCF;COMBINING ZIGZAG BELOW;Mn;220;NSM;;;;;N;;;;;
+1DD0;COMBINING IS BELOW;Mn;202;NSM;;;;;N;;;;;
+1DD1;COMBINING UR ABOVE;Mn;230;NSM;;;;;N;;;;;
+1DD2;COMBINING US ABOVE;Mn;230;NSM;;;;;N;;;;;
+1DD3;COMBINING LATIN SMALL LETTER FLATTENED OPEN A ABOVE;Mn;230;NSM;;;;;N;;;;;
+1DD4;COMBINING LATIN SMALL LETTER AE;Mn;230;NSM;;;;;N;;;;;
+1DD5;COMBINING LATIN SMALL LETTER AO;Mn;230;NSM;;;;;N;;;;;
+1DD6;COMBINING LATIN SMALL LETTER AV;Mn;230;NSM;;;;;N;;;;;
+1DD7;COMBINING LATIN SMALL LETTER C CEDILLA;Mn;230;NSM;;;;;N;;;;;
+1DD8;COMBINING LATIN SMALL LETTER INSULAR D;Mn;230;NSM;;;;;N;;;;;
+1DD9;COMBINING LATIN SMALL LETTER ETH;Mn;230;NSM;;;;;N;;;;;
+1DDA;COMBINING LATIN SMALL LETTER G;Mn;230;NSM;;;;;N;;;;;
+1DDB;COMBINING LATIN LETTER SMALL CAPITAL G;Mn;230;NSM;;;;;N;;;;;
+1DDC;COMBINING LATIN SMALL LETTER K;Mn;230;NSM;;;;;N;;;;;
+1DDD;COMBINING LATIN SMALL LETTER L;Mn;230;NSM;;;;;N;;;;;
+1DDE;COMBINING LATIN LETTER SMALL CAPITAL L;Mn;230;NSM;;;;;N;;;;;
+1DDF;COMBINING LATIN LETTER SMALL CAPITAL M;Mn;230;NSM;;;;;N;;;;;
+1DE0;COMBINING LATIN SMALL LETTER N;Mn;230;NSM;;;;;N;;;;;
+1DE1;COMBINING LATIN LETTER SMALL CAPITAL N;Mn;230;NSM;;;;;N;;;;;
+1DE2;COMBINING LATIN LETTER SMALL CAPITAL R;Mn;230;NSM;;;;;N;;;;;
+1DE3;COMBINING LATIN SMALL LETTER R ROTUNDA;Mn;230;NSM;;;;;N;;;;;
+1DE4;COMBINING LATIN SMALL LETTER S;Mn;230;NSM;;;;;N;;;;;
+1DE5;COMBINING LATIN SMALL LETTER LONG S;Mn;230;NSM;;;;;N;;;;;
+1DE6;COMBINING LATIN SMALL LETTER Z;Mn;230;NSM;;;;;N;;;;;
+1DE7;COMBINING LATIN SMALL LETTER ALPHA;Mn;230;NSM;;;;;N;;;;;
+1DE8;COMBINING LATIN SMALL LETTER B;Mn;230;NSM;;;;;N;;;;;
+1DE9;COMBINING LATIN SMALL LETTER BETA;Mn;230;NSM;;;;;N;;;;;
+1DEA;COMBINING LATIN SMALL LETTER SCHWA;Mn;230;NSM;;;;;N;;;;;
+1DEB;COMBINING LATIN SMALL LETTER F;Mn;230;NSM;;;;;N;;;;;
+1DEC;COMBINING LATIN SMALL LETTER L WITH DOUBLE MIDDLE TILDE;Mn;230;NSM;;;;;N;;;;;
+1DED;COMBINING LATIN SMALL LETTER O WITH LIGHT CENTRALIZATION STROKE;Mn;230;NSM;;;;;N;;;;;
+1DEE;COMBINING LATIN SMALL LETTER P;Mn;230;NSM;;;;;N;;;;;
+1DEF;COMBINING LATIN SMALL LETTER ESH;Mn;230;NSM;;;;;N;;;;;
+1DF0;COMBINING LATIN SMALL LETTER U WITH LIGHT CENTRALIZATION STROKE;Mn;230;NSM;;;;;N;;;;;
+1DF1;COMBINING LATIN SMALL LETTER W;Mn;230;NSM;;;;;N;;;;;
+1DF2;COMBINING LATIN SMALL LETTER A WITH DIAERESIS;Mn;230;NSM;;;;;N;;;;;
+1DF3;COMBINING LATIN SMALL LETTER O WITH DIAERESIS;Mn;230;NSM;;;;;N;;;;;
+1DF4;COMBINING LATIN SMALL LETTER U WITH DIAERESIS;Mn;230;NSM;;;;;N;;;;;
+1DF5;COMBINING UP TACK ABOVE;Mn;230;NSM;;;;;N;;;;;
+1DF6;COMBINING KAVYKA ABOVE RIGHT;Mn;232;NSM;;;;;N;;;;;
+1DF7;COMBINING KAVYKA ABOVE LEFT;Mn;228;NSM;;;;;N;;;;;
+1DF8;COMBINING DOT ABOVE LEFT;Mn;228;NSM;;;;;N;;;;;
+1DF9;COMBINING WIDE INVERTED BRIDGE BELOW;Mn;220;NSM;;;;;N;;;;;
+1DFB;COMBINING DELETION MARK;Mn;230;NSM;;;;;N;;;;;
+1DFC;COMBINING DOUBLE INVERTED BREVE BELOW;Mn;233;NSM;;;;;N;;;;;
+1DFD;COMBINING ALMOST EQUAL TO BELOW;Mn;220;NSM;;;;;N;;;;;
+1DFE;COMBINING LEFT ARROWHEAD ABOVE;Mn;230;NSM;;;;;N;;;;;
+1DFF;COMBINING RIGHT ARROWHEAD AND DOWN ARROWHEAD BELOW;Mn;220;NSM;;;;;N;;;;;
+1E00;LATIN CAPITAL LETTER A WITH RING BELOW;Lu;0;L;0041 0325;;;;N;;;;1E01;
+1E01;LATIN SMALL LETTER A WITH RING BELOW;Ll;0;L;0061 0325;;;;N;;;1E00;;1E00
+1E02;LATIN CAPITAL LETTER B WITH DOT ABOVE;Lu;0;L;0042 0307;;;;N;;;;1E03;
+1E03;LATIN SMALL LETTER B WITH DOT ABOVE;Ll;0;L;0062 0307;;;;N;;;1E02;;1E02
+1E04;LATIN CAPITAL LETTER B WITH DOT BELOW;Lu;0;L;0042 0323;;;;N;;;;1E05;
+1E05;LATIN SMALL LETTER B WITH DOT BELOW;Ll;0;L;0062 0323;;;;N;;;1E04;;1E04
+1E06;LATIN CAPITAL LETTER B WITH LINE BELOW;Lu;0;L;0042 0331;;;;N;;;;1E07;
+1E07;LATIN SMALL LETTER B WITH LINE BELOW;Ll;0;L;0062 0331;;;;N;;;1E06;;1E06
+1E08;LATIN CAPITAL LETTER C WITH CEDILLA AND ACUTE;Lu;0;L;00C7 0301;;;;N;;;;1E09;
+1E09;LATIN SMALL LETTER C WITH CEDILLA AND ACUTE;Ll;0;L;00E7 0301;;;;N;;;1E08;;1E08
+1E0A;LATIN CAPITAL LETTER D WITH DOT ABOVE;Lu;0;L;0044 0307;;;;N;;;;1E0B;
+1E0B;LATIN SMALL LETTER D WITH DOT ABOVE;Ll;0;L;0064 0307;;;;N;;;1E0A;;1E0A
+1E0C;LATIN CAPITAL LETTER D WITH DOT BELOW;Lu;0;L;0044 0323;;;;N;;;;1E0D;
+1E0D;LATIN SMALL LETTER D WITH DOT BELOW;Ll;0;L;0064 0323;;;;N;;;1E0C;;1E0C
+1E0E;LATIN CAPITAL LETTER D WITH LINE BELOW;Lu;0;L;0044 0331;;;;N;;;;1E0F;
+1E0F;LATIN SMALL LETTER D WITH LINE BELOW;Ll;0;L;0064 0331;;;;N;;;1E0E;;1E0E
+1E10;LATIN CAPITAL LETTER D WITH CEDILLA;Lu;0;L;0044 0327;;;;N;;;;1E11;
+1E11;LATIN SMALL LETTER D WITH CEDILLA;Ll;0;L;0064 0327;;;;N;;;1E10;;1E10
+1E12;LATIN CAPITAL LETTER D WITH CIRCUMFLEX BELOW;Lu;0;L;0044 032D;;;;N;;;;1E13;
+1E13;LATIN SMALL LETTER D WITH CIRCUMFLEX BELOW;Ll;0;L;0064 032D;;;;N;;;1E12;;1E12
+1E14;LATIN CAPITAL LETTER E WITH MACRON AND GRAVE;Lu;0;L;0112 0300;;;;N;;;;1E15;
+1E15;LATIN SMALL LETTER E WITH MACRON AND GRAVE;Ll;0;L;0113 0300;;;;N;;;1E14;;1E14
+1E16;LATIN CAPITAL LETTER E WITH MACRON AND ACUTE;Lu;0;L;0112 0301;;;;N;;;;1E17;
+1E17;LATIN SMALL LETTER E WITH MACRON AND ACUTE;Ll;0;L;0113 0301;;;;N;;;1E16;;1E16
+1E18;LATIN CAPITAL LETTER E WITH CIRCUMFLEX BELOW;Lu;0;L;0045 032D;;;;N;;;;1E19;
+1E19;LATIN SMALL LETTER E WITH CIRCUMFLEX BELOW;Ll;0;L;0065 032D;;;;N;;;1E18;;1E18
+1E1A;LATIN CAPITAL LETTER E WITH TILDE BELOW;Lu;0;L;0045 0330;;;;N;;;;1E1B;
+1E1B;LATIN SMALL LETTER E WITH TILDE BELOW;Ll;0;L;0065 0330;;;;N;;;1E1A;;1E1A
+1E1C;LATIN CAPITAL LETTER E WITH CEDILLA AND BREVE;Lu;0;L;0228 0306;;;;N;;;;1E1D;
+1E1D;LATIN SMALL LETTER E WITH CEDILLA AND BREVE;Ll;0;L;0229 0306;;;;N;;;1E1C;;1E1C
+1E1E;LATIN CAPITAL LETTER F WITH DOT ABOVE;Lu;0;L;0046 0307;;;;N;;;;1E1F;
+1E1F;LATIN SMALL LETTER F WITH DOT ABOVE;Ll;0;L;0066 0307;;;;N;;;1E1E;;1E1E
+1E20;LATIN CAPITAL LETTER G WITH MACRON;Lu;0;L;0047 0304;;;;N;;;;1E21;
+1E21;LATIN SMALL LETTER G WITH MACRON;Ll;0;L;0067 0304;;;;N;;;1E20;;1E20
+1E22;LATIN CAPITAL LETTER H WITH DOT ABOVE;Lu;0;L;0048 0307;;;;N;;;;1E23;
+1E23;LATIN SMALL LETTER H WITH DOT ABOVE;Ll;0;L;0068 0307;;;;N;;;1E22;;1E22
+1E24;LATIN CAPITAL LETTER H WITH DOT BELOW;Lu;0;L;0048 0323;;;;N;;;;1E25;
+1E25;LATIN SMALL LETTER H WITH DOT BELOW;Ll;0;L;0068 0323;;;;N;;;1E24;;1E24
+1E26;LATIN CAPITAL LETTER H WITH DIAERESIS;Lu;0;L;0048 0308;;;;N;;;;1E27;
+1E27;LATIN SMALL LETTER H WITH DIAERESIS;Ll;0;L;0068 0308;;;;N;;;1E26;;1E26
+1E28;LATIN CAPITAL LETTER H WITH CEDILLA;Lu;0;L;0048 0327;;;;N;;;;1E29;
+1E29;LATIN SMALL LETTER H WITH CEDILLA;Ll;0;L;0068 0327;;;;N;;;1E28;;1E28
+1E2A;LATIN CAPITAL LETTER H WITH BREVE BELOW;Lu;0;L;0048 032E;;;;N;;;;1E2B;
+1E2B;LATIN SMALL LETTER H WITH BREVE BELOW;Ll;0;L;0068 032E;;;;N;;;1E2A;;1E2A
+1E2C;LATIN CAPITAL LETTER I WITH TILDE BELOW;Lu;0;L;0049 0330;;;;N;;;;1E2D;
+1E2D;LATIN SMALL LETTER I WITH TILDE BELOW;Ll;0;L;0069 0330;;;;N;;;1E2C;;1E2C
+1E2E;LATIN CAPITAL LETTER I WITH DIAERESIS AND ACUTE;Lu;0;L;00CF 0301;;;;N;;;;1E2F;
+1E2F;LATIN SMALL LETTER I WITH DIAERESIS AND ACUTE;Ll;0;L;00EF 0301;;;;N;;;1E2E;;1E2E
+1E30;LATIN CAPITAL LETTER K WITH ACUTE;Lu;0;L;004B 0301;;;;N;;;;1E31;
+1E31;LATIN SMALL LETTER K WITH ACUTE;Ll;0;L;006B 0301;;;;N;;;1E30;;1E30
+1E32;LATIN CAPITAL LETTER K WITH DOT BELOW;Lu;0;L;004B 0323;;;;N;;;;1E33;
+1E33;LATIN SMALL LETTER K WITH DOT BELOW;Ll;0;L;006B 0323;;;;N;;;1E32;;1E32
+1E34;LATIN CAPITAL LETTER K WITH LINE BELOW;Lu;0;L;004B 0331;;;;N;;;;1E35;
+1E35;LATIN SMALL LETTER K WITH LINE BELOW;Ll;0;L;006B 0331;;;;N;;;1E34;;1E34
+1E36;LATIN CAPITAL LETTER L WITH DOT BELOW;Lu;0;L;004C 0323;;;;N;;;;1E37;
+1E37;LATIN SMALL LETTER L WITH DOT BELOW;Ll;0;L;006C 0323;;;;N;;;1E36;;1E36
+1E38;LATIN CAPITAL LETTER L WITH DOT BELOW AND MACRON;Lu;0;L;1E36 0304;;;;N;;;;1E39;
+1E39;LATIN SMALL LETTER L WITH DOT BELOW AND MACRON;Ll;0;L;1E37 0304;;;;N;;;1E38;;1E38
+1E3A;LATIN CAPITAL LETTER L WITH LINE BELOW;Lu;0;L;004C 0331;;;;N;;;;1E3B;
+1E3B;LATIN SMALL LETTER L WITH LINE BELOW;Ll;0;L;006C 0331;;;;N;;;1E3A;;1E3A
+1E3C;LATIN CAPITAL LETTER L WITH CIRCUMFLEX BELOW;Lu;0;L;004C 032D;;;;N;;;;1E3D;
+1E3D;LATIN SMALL LETTER L WITH CIRCUMFLEX BELOW;Ll;0;L;006C 032D;;;;N;;;1E3C;;1E3C
+1E3E;LATIN CAPITAL LETTER M WITH ACUTE;Lu;0;L;004D 0301;;;;N;;;;1E3F;
+1E3F;LATIN SMALL LETTER M WITH ACUTE;Ll;0;L;006D 0301;;;;N;;;1E3E;;1E3E
+1E40;LATIN CAPITAL LETTER M WITH DOT ABOVE;Lu;0;L;004D 0307;;;;N;;;;1E41;
+1E41;LATIN SMALL LETTER M WITH DOT ABOVE;Ll;0;L;006D 0307;;;;N;;;1E40;;1E40
+1E42;LATIN CAPITAL LETTER M WITH DOT BELOW;Lu;0;L;004D 0323;;;;N;;;;1E43;
+1E43;LATIN SMALL LETTER M WITH DOT BELOW;Ll;0;L;006D 0323;;;;N;;;1E42;;1E42
+1E44;LATIN CAPITAL LETTER N WITH DOT ABOVE;Lu;0;L;004E 0307;;;;N;;;;1E45;
+1E45;LATIN SMALL LETTER N WITH DOT ABOVE;Ll;0;L;006E 0307;;;;N;;;1E44;;1E44
+1E46;LATIN CAPITAL LETTER N WITH DOT BELOW;Lu;0;L;004E 0323;;;;N;;;;1E47;
+1E47;LATIN SMALL LETTER N WITH DOT BELOW;Ll;0;L;006E 0323;;;;N;;;1E46;;1E46
+1E48;LATIN CAPITAL LETTER N WITH LINE BELOW;Lu;0;L;004E 0331;;;;N;;;;1E49;
+1E49;LATIN SMALL LETTER N WITH LINE BELOW;Ll;0;L;006E 0331;;;;N;;;1E48;;1E48
+1E4A;LATIN CAPITAL LETTER N WITH CIRCUMFLEX BELOW;Lu;0;L;004E 032D;;;;N;;;;1E4B;
+1E4B;LATIN SMALL LETTER N WITH CIRCUMFLEX BELOW;Ll;0;L;006E 032D;;;;N;;;1E4A;;1E4A
+1E4C;LATIN CAPITAL LETTER O WITH TILDE AND ACUTE;Lu;0;L;00D5 0301;;;;N;;;;1E4D;
+1E4D;LATIN SMALL LETTER O WITH TILDE AND ACUTE;Ll;0;L;00F5 0301;;;;N;;;1E4C;;1E4C
+1E4E;LATIN CAPITAL LETTER O WITH TILDE AND DIAERESIS;Lu;0;L;00D5 0308;;;;N;;;;1E4F;
+1E4F;LATIN SMALL LETTER O WITH TILDE AND DIAERESIS;Ll;0;L;00F5 0308;;;;N;;;1E4E;;1E4E
+1E50;LATIN CAPITAL LETTER O WITH MACRON AND GRAVE;Lu;0;L;014C 0300;;;;N;;;;1E51;
+1E51;LATIN SMALL LETTER O WITH MACRON AND GRAVE;Ll;0;L;014D 0300;;;;N;;;1E50;;1E50
+1E52;LATIN CAPITAL LETTER O WITH MACRON AND ACUTE;Lu;0;L;014C 0301;;;;N;;;;1E53;
+1E53;LATIN SMALL LETTER O WITH MACRON AND ACUTE;Ll;0;L;014D 0301;;;;N;;;1E52;;1E52
+1E54;LATIN CAPITAL LETTER P WITH ACUTE;Lu;0;L;0050 0301;;;;N;;;;1E55;
+1E55;LATIN SMALL LETTER P WITH ACUTE;Ll;0;L;0070 0301;;;;N;;;1E54;;1E54
+1E56;LATIN CAPITAL LETTER P WITH DOT ABOVE;Lu;0;L;0050 0307;;;;N;;;;1E57;
+1E57;LATIN SMALL LETTER P WITH DOT ABOVE;Ll;0;L;0070 0307;;;;N;;;1E56;;1E56
+1E58;LATIN CAPITAL LETTER R WITH DOT ABOVE;Lu;0;L;0052 0307;;;;N;;;;1E59;
+1E59;LATIN SMALL LETTER R WITH DOT ABOVE;Ll;0;L;0072 0307;;;;N;;;1E58;;1E58
+1E5A;LATIN CAPITAL LETTER R WITH DOT BELOW;Lu;0;L;0052 0323;;;;N;;;;1E5B;
+1E5B;LATIN SMALL LETTER R WITH DOT BELOW;Ll;0;L;0072 0323;;;;N;;;1E5A;;1E5A
+1E5C;LATIN CAPITAL LETTER R WITH DOT BELOW AND MACRON;Lu;0;L;1E5A 0304;;;;N;;;;1E5D;
+1E5D;LATIN SMALL LETTER R WITH DOT BELOW AND MACRON;Ll;0;L;1E5B 0304;;;;N;;;1E5C;;1E5C
+1E5E;LATIN CAPITAL LETTER R WITH LINE BELOW;Lu;0;L;0052 0331;;;;N;;;;1E5F;
+1E5F;LATIN SMALL LETTER R WITH LINE BELOW;Ll;0;L;0072 0331;;;;N;;;1E5E;;1E5E
+1E60;LATIN CAPITAL LETTER S WITH DOT ABOVE;Lu;0;L;0053 0307;;;;N;;;;1E61;
+1E61;LATIN SMALL LETTER S WITH DOT ABOVE;Ll;0;L;0073 0307;;;;N;;;1E60;;1E60
+1E62;LATIN CAPITAL LETTER S WITH DOT BELOW;Lu;0;L;0053 0323;;;;N;;;;1E63;
+1E63;LATIN SMALL LETTER S WITH DOT BELOW;Ll;0;L;0073 0323;;;;N;;;1E62;;1E62
+1E64;LATIN CAPITAL LETTER S WITH ACUTE AND DOT ABOVE;Lu;0;L;015A 0307;;;;N;;;;1E65;
+1E65;LATIN SMALL LETTER S WITH ACUTE AND DOT ABOVE;Ll;0;L;015B 0307;;;;N;;;1E64;;1E64
+1E66;LATIN CAPITAL LETTER S WITH CARON AND DOT ABOVE;Lu;0;L;0160 0307;;;;N;;;;1E67;
+1E67;LATIN SMALL LETTER S WITH CARON AND DOT ABOVE;Ll;0;L;0161 0307;;;;N;;;1E66;;1E66
+1E68;LATIN CAPITAL LETTER S WITH DOT BELOW AND DOT ABOVE;Lu;0;L;1E62 0307;;;;N;;;;1E69;
+1E69;LATIN SMALL LETTER S WITH DOT BELOW AND DOT ABOVE;Ll;0;L;1E63 0307;;;;N;;;1E68;;1E68
+1E6A;LATIN CAPITAL LETTER T WITH DOT ABOVE;Lu;0;L;0054 0307;;;;N;;;;1E6B;
+1E6B;LATIN SMALL LETTER T WITH DOT ABOVE;Ll;0;L;0074 0307;;;;N;;;1E6A;;1E6A
+1E6C;LATIN CAPITAL LETTER T WITH DOT BELOW;Lu;0;L;0054 0323;;;;N;;;;1E6D;
+1E6D;LATIN SMALL LETTER T WITH DOT BELOW;Ll;0;L;0074 0323;;;;N;;;1E6C;;1E6C
+1E6E;LATIN CAPITAL LETTER T WITH LINE BELOW;Lu;0;L;0054 0331;;;;N;;;;1E6F;
+1E6F;LATIN SMALL LETTER T WITH LINE BELOW;Ll;0;L;0074 0331;;;;N;;;1E6E;;1E6E
+1E70;LATIN CAPITAL LETTER T WITH CIRCUMFLEX BELOW;Lu;0;L;0054 032D;;;;N;;;;1E71;
+1E71;LATIN SMALL LETTER T WITH CIRCUMFLEX BELOW;Ll;0;L;0074 032D;;;;N;;;1E70;;1E70
+1E72;LATIN CAPITAL LETTER U WITH DIAERESIS BELOW;Lu;0;L;0055 0324;;;;N;;;;1E73;
+1E73;LATIN SMALL LETTER U WITH DIAERESIS BELOW;Ll;0;L;0075 0324;;;;N;;;1E72;;1E72
+1E74;LATIN CAPITAL LETTER U WITH TILDE BELOW;Lu;0;L;0055 0330;;;;N;;;;1E75;
+1E75;LATIN SMALL LETTER U WITH TILDE BELOW;Ll;0;L;0075 0330;;;;N;;;1E74;;1E74
+1E76;LATIN CAPITAL LETTER U WITH CIRCUMFLEX BELOW;Lu;0;L;0055 032D;;;;N;;;;1E77;
+1E77;LATIN SMALL LETTER U WITH CIRCUMFLEX BELOW;Ll;0;L;0075 032D;;;;N;;;1E76;;1E76
+1E78;LATIN CAPITAL LETTER U WITH TILDE AND ACUTE;Lu;0;L;0168 0301;;;;N;;;;1E79;
+1E79;LATIN SMALL LETTER U WITH TILDE AND ACUTE;Ll;0;L;0169 0301;;;;N;;;1E78;;1E78
+1E7A;LATIN CAPITAL LETTER U WITH MACRON AND DIAERESIS;Lu;0;L;016A 0308;;;;N;;;;1E7B;
+1E7B;LATIN SMALL LETTER U WITH MACRON AND DIAERESIS;Ll;0;L;016B 0308;;;;N;;;1E7A;;1E7A
+1E7C;LATIN CAPITAL LETTER V WITH TILDE;Lu;0;L;0056 0303;;;;N;;;;1E7D;
+1E7D;LATIN SMALL LETTER V WITH TILDE;Ll;0;L;0076 0303;;;;N;;;1E7C;;1E7C
+1E7E;LATIN CAPITAL LETTER V WITH DOT BELOW;Lu;0;L;0056 0323;;;;N;;;;1E7F;
+1E7F;LATIN SMALL LETTER V WITH DOT BELOW;Ll;0;L;0076 0323;;;;N;;;1E7E;;1E7E
+1E80;LATIN CAPITAL LETTER W WITH GRAVE;Lu;0;L;0057 0300;;;;N;;;;1E81;
+1E81;LATIN SMALL LETTER W WITH GRAVE;Ll;0;L;0077 0300;;;;N;;;1E80;;1E80
+1E82;LATIN CAPITAL LETTER W WITH ACUTE;Lu;0;L;0057 0301;;;;N;;;;1E83;
+1E83;LATIN SMALL LETTER W WITH ACUTE;Ll;0;L;0077 0301;;;;N;;;1E82;;1E82
+1E84;LATIN CAPITAL LETTER W WITH DIAERESIS;Lu;0;L;0057 0308;;;;N;;;;1E85;
+1E85;LATIN SMALL LETTER W WITH DIAERESIS;Ll;0;L;0077 0308;;;;N;;;1E84;;1E84
+1E86;LATIN CAPITAL LETTER W WITH DOT ABOVE;Lu;0;L;0057 0307;;;;N;;;;1E87;
+1E87;LATIN SMALL LETTER W WITH DOT ABOVE;Ll;0;L;0077 0307;;;;N;;;1E86;;1E86
+1E88;LATIN CAPITAL LETTER W WITH DOT BELOW;Lu;0;L;0057 0323;;;;N;;;;1E89;
+1E89;LATIN SMALL LETTER W WITH DOT BELOW;Ll;0;L;0077 0323;;;;N;;;1E88;;1E88
+1E8A;LATIN CAPITAL LETTER X WITH DOT ABOVE;Lu;0;L;0058 0307;;;;N;;;;1E8B;
+1E8B;LATIN SMALL LETTER X WITH DOT ABOVE;Ll;0;L;0078 0307;;;;N;;;1E8A;;1E8A
+1E8C;LATIN CAPITAL LETTER X WITH DIAERESIS;Lu;0;L;0058 0308;;;;N;;;;1E8D;
+1E8D;LATIN SMALL LETTER X WITH DIAERESIS;Ll;0;L;0078 0308;;;;N;;;1E8C;;1E8C
+1E8E;LATIN CAPITAL LETTER Y WITH DOT ABOVE;Lu;0;L;0059 0307;;;;N;;;;1E8F;
+1E8F;LATIN SMALL LETTER Y WITH DOT ABOVE;Ll;0;L;0079 0307;;;;N;;;1E8E;;1E8E
+1E90;LATIN CAPITAL LETTER Z WITH CIRCUMFLEX;Lu;0;L;005A 0302;;;;N;;;;1E91;
+1E91;LATIN SMALL LETTER Z WITH CIRCUMFLEX;Ll;0;L;007A 0302;;;;N;;;1E90;;1E90
+1E92;LATIN CAPITAL LETTER Z WITH DOT BELOW;Lu;0;L;005A 0323;;;;N;;;;1E93;
+1E93;LATIN SMALL LETTER Z WITH DOT BELOW;Ll;0;L;007A 0323;;;;N;;;1E92;;1E92
+1E94;LATIN CAPITAL LETTER Z WITH LINE BELOW;Lu;0;L;005A 0331;;;;N;;;;1E95;
+1E95;LATIN SMALL LETTER Z WITH LINE BELOW;Ll;0;L;007A 0331;;;;N;;;1E94;;1E94
+1E96;LATIN SMALL LETTER H WITH LINE BELOW;Ll;0;L;0068 0331;;;;N;;;;;
+1E97;LATIN SMALL LETTER T WITH DIAERESIS;Ll;0;L;0074 0308;;;;N;;;;;
+1E98;LATIN SMALL LETTER W WITH RING ABOVE;Ll;0;L;0077 030A;;;;N;;;;;
+1E99;LATIN SMALL LETTER Y WITH RING ABOVE;Ll;0;L;0079 030A;;;;N;;;;;
+1E9A;LATIN SMALL LETTER A WITH RIGHT HALF RING;Ll;0;L;<compat> 0061 02BE;;;;N;;;;;
+1E9B;LATIN SMALL LETTER LONG S WITH DOT ABOVE;Ll;0;L;017F 0307;;;;N;;;1E60;;1E60
+1E9C;LATIN SMALL LETTER LONG S WITH DIAGONAL STROKE;Ll;0;L;;;;;N;;;;;
+1E9D;LATIN SMALL LETTER LONG S WITH HIGH STROKE;Ll;0;L;;;;;N;;;;;
+1E9E;LATIN CAPITAL LETTER SHARP S;Lu;0;L;;;;;N;;;;00DF;
+1E9F;LATIN SMALL LETTER DELTA;Ll;0;L;;;;;N;;;;;
+1EA0;LATIN CAPITAL LETTER A WITH DOT BELOW;Lu;0;L;0041 0323;;;;N;;;;1EA1;
+1EA1;LATIN SMALL LETTER A WITH DOT BELOW;Ll;0;L;0061 0323;;;;N;;;1EA0;;1EA0
+1EA2;LATIN CAPITAL LETTER A WITH HOOK ABOVE;Lu;0;L;0041 0309;;;;N;;;;1EA3;
+1EA3;LATIN SMALL LETTER A WITH HOOK ABOVE;Ll;0;L;0061 0309;;;;N;;;1EA2;;1EA2
+1EA4;LATIN CAPITAL LETTER A WITH CIRCUMFLEX AND ACUTE;Lu;0;L;00C2 0301;;;;N;;;;1EA5;
+1EA5;LATIN SMALL LETTER A WITH CIRCUMFLEX AND ACUTE;Ll;0;L;00E2 0301;;;;N;;;1EA4;;1EA4
+1EA6;LATIN CAPITAL LETTER A WITH CIRCUMFLEX AND GRAVE;Lu;0;L;00C2 0300;;;;N;;;;1EA7;
+1EA7;LATIN SMALL LETTER A WITH CIRCUMFLEX AND GRAVE;Ll;0;L;00E2 0300;;;;N;;;1EA6;;1EA6
+1EA8;LATIN CAPITAL LETTER A WITH CIRCUMFLEX AND HOOK ABOVE;Lu;0;L;00C2 0309;;;;N;;;;1EA9;
+1EA9;LATIN SMALL LETTER A WITH CIRCUMFLEX AND HOOK ABOVE;Ll;0;L;00E2 0309;;;;N;;;1EA8;;1EA8
+1EAA;LATIN CAPITAL LETTER A WITH CIRCUMFLEX AND TILDE;Lu;0;L;00C2 0303;;;;N;;;;1EAB;
+1EAB;LATIN SMALL LETTER A WITH CIRCUMFLEX AND TILDE;Ll;0;L;00E2 0303;;;;N;;;1EAA;;1EAA
+1EAC;LATIN CAPITAL LETTER A WITH CIRCUMFLEX AND DOT BELOW;Lu;0;L;1EA0 0302;;;;N;;;;1EAD;
+1EAD;LATIN SMALL LETTER A WITH CIRCUMFLEX AND DOT BELOW;Ll;0;L;1EA1 0302;;;;N;;;1EAC;;1EAC
+1EAE;LATIN CAPITAL LETTER A WITH BREVE AND ACUTE;Lu;0;L;0102 0301;;;;N;;;;1EAF;
+1EAF;LATIN SMALL LETTER A WITH BREVE AND ACUTE;Ll;0;L;0103 0301;;;;N;;;1EAE;;1EAE
+1EB0;LATIN CAPITAL LETTER A WITH BREVE AND GRAVE;Lu;0;L;0102 0300;;;;N;;;;1EB1;
+1EB1;LATIN SMALL LETTER A WITH BREVE AND GRAVE;Ll;0;L;0103 0300;;;;N;;;1EB0;;1EB0
+1EB2;LATIN CAPITAL LETTER A WITH BREVE AND HOOK ABOVE;Lu;0;L;0102 0309;;;;N;;;;1EB3;
+1EB3;LATIN SMALL LETTER A WITH BREVE AND HOOK ABOVE;Ll;0;L;0103 0309;;;;N;;;1EB2;;1EB2
+1EB4;LATIN CAPITAL LETTER A WITH BREVE AND TILDE;Lu;0;L;0102 0303;;;;N;;;;1EB5;
+1EB5;LATIN SMALL LETTER A WITH BREVE AND TILDE;Ll;0;L;0103 0303;;;;N;;;1EB4;;1EB4
+1EB6;LATIN CAPITAL LETTER A WITH BREVE AND DOT BELOW;Lu;0;L;1EA0 0306;;;;N;;;;1EB7;
+1EB7;LATIN SMALL LETTER A WITH BREVE AND DOT BELOW;Ll;0;L;1EA1 0306;;;;N;;;1EB6;;1EB6
+1EB8;LATIN CAPITAL LETTER E WITH DOT BELOW;Lu;0;L;0045 0323;;;;N;;;;1EB9;
+1EB9;LATIN SMALL LETTER E WITH DOT BELOW;Ll;0;L;0065 0323;;;;N;;;1EB8;;1EB8
+1EBA;LATIN CAPITAL LETTER E WITH HOOK ABOVE;Lu;0;L;0045 0309;;;;N;;;;1EBB;
+1EBB;LATIN SMALL LETTER E WITH HOOK ABOVE;Ll;0;L;0065 0309;;;;N;;;1EBA;;1EBA
+1EBC;LATIN CAPITAL LETTER E WITH TILDE;Lu;0;L;0045 0303;;;;N;;;;1EBD;
+1EBD;LATIN SMALL LETTER E WITH TILDE;Ll;0;L;0065 0303;;;;N;;;1EBC;;1EBC
+1EBE;LATIN CAPITAL LETTER E WITH CIRCUMFLEX AND ACUTE;Lu;0;L;00CA 0301;;;;N;;;;1EBF;
+1EBF;LATIN SMALL LETTER E WITH CIRCUMFLEX AND ACUTE;Ll;0;L;00EA 0301;;;;N;;;1EBE;;1EBE
+1EC0;LATIN CAPITAL LETTER E WITH CIRCUMFLEX AND GRAVE;Lu;0;L;00CA 0300;;;;N;;;;1EC1;
+1EC1;LATIN SMALL LETTER E WITH CIRCUMFLEX AND GRAVE;Ll;0;L;00EA 0300;;;;N;;;1EC0;;1EC0
+1EC2;LATIN CAPITAL LETTER E WITH CIRCUMFLEX AND HOOK ABOVE;Lu;0;L;00CA 0309;;;;N;;;;1EC3;
+1EC3;LATIN SMALL LETTER E WITH CIRCUMFLEX AND HOOK ABOVE;Ll;0;L;00EA 0309;;;;N;;;1EC2;;1EC2
+1EC4;LATIN CAPITAL LETTER E WITH CIRCUMFLEX AND TILDE;Lu;0;L;00CA 0303;;;;N;;;;1EC5;
+1EC5;LATIN SMALL LETTER E WITH CIRCUMFLEX AND TILDE;Ll;0;L;00EA 0303;;;;N;;;1EC4;;1EC4
+1EC6;LATIN CAPITAL LETTER E WITH CIRCUMFLEX AND DOT BELOW;Lu;0;L;1EB8 0302;;;;N;;;;1EC7;
+1EC7;LATIN SMALL LETTER E WITH CIRCUMFLEX AND DOT BELOW;Ll;0;L;1EB9 0302;;;;N;;;1EC6;;1EC6
+1EC8;LATIN CAPITAL LETTER I WITH HOOK ABOVE;Lu;0;L;0049 0309;;;;N;;;;1EC9;
+1EC9;LATIN SMALL LETTER I WITH HOOK ABOVE;Ll;0;L;0069 0309;;;;N;;;1EC8;;1EC8
+1ECA;LATIN CAPITAL LETTER I WITH DOT BELOW;Lu;0;L;0049 0323;;;;N;;;;1ECB;
+1ECB;LATIN SMALL LETTER I WITH DOT BELOW;Ll;0;L;0069 0323;;;;N;;;1ECA;;1ECA
+1ECC;LATIN CAPITAL LETTER O WITH DOT BELOW;Lu;0;L;004F 0323;;;;N;;;;1ECD;
+1ECD;LATIN SMALL LETTER O WITH DOT BELOW;Ll;0;L;006F 0323;;;;N;;;1ECC;;1ECC
+1ECE;LATIN CAPITAL LETTER O WITH HOOK ABOVE;Lu;0;L;004F 0309;;;;N;;;;1ECF;
+1ECF;LATIN SMALL LETTER O WITH HOOK ABOVE;Ll;0;L;006F 0309;;;;N;;;1ECE;;1ECE
+1ED0;LATIN CAPITAL LETTER O WITH CIRCUMFLEX AND ACUTE;Lu;0;L;00D4 0301;;;;N;;;;1ED1;
+1ED1;LATIN SMALL LETTER O WITH CIRCUMFLEX AND ACUTE;Ll;0;L;00F4 0301;;;;N;;;1ED0;;1ED0
+1ED2;LATIN CAPITAL LETTER O WITH CIRCUMFLEX AND GRAVE;Lu;0;L;00D4 0300;;;;N;;;;1ED3;
+1ED3;LATIN SMALL LETTER O WITH CIRCUMFLEX AND GRAVE;Ll;0;L;00F4 0300;;;;N;;;1ED2;;1ED2
+1ED4;LATIN CAPITAL LETTER O WITH CIRCUMFLEX AND HOOK ABOVE;Lu;0;L;00D4 0309;;;;N;;;;1ED5;
+1ED5;LATIN SMALL LETTER O WITH CIRCUMFLEX AND HOOK ABOVE;Ll;0;L;00F4 0309;;;;N;;;1ED4;;1ED4
+1ED6;LATIN CAPITAL LETTER O WITH CIRCUMFLEX AND TILDE;Lu;0;L;00D4 0303;;;;N;;;;1ED7;
+1ED7;LATIN SMALL LETTER O WITH CIRCUMFLEX AND TILDE;Ll;0;L;00F4 0303;;;;N;;;1ED6;;1ED6
+1ED8;LATIN CAPITAL LETTER O WITH CIRCUMFLEX AND DOT BELOW;Lu;0;L;1ECC 0302;;;;N;;;;1ED9;
+1ED9;LATIN SMALL LETTER O WITH CIRCUMFLEX AND DOT BELOW;Ll;0;L;1ECD 0302;;;;N;;;1ED8;;1ED8
+1EDA;LATIN CAPITAL LETTER O WITH HORN AND ACUTE;Lu;0;L;01A0 0301;;;;N;;;;1EDB;
+1EDB;LATIN SMALL LETTER O WITH HORN AND ACUTE;Ll;0;L;01A1 0301;;;;N;;;1EDA;;1EDA
+1EDC;LATIN CAPITAL LETTER O WITH HORN AND GRAVE;Lu;0;L;01A0 0300;;;;N;;;;1EDD;
+1EDD;LATIN SMALL LETTER O WITH HORN AND GRAVE;Ll;0;L;01A1 0300;;;;N;;;1EDC;;1EDC
+1EDE;LATIN CAPITAL LETTER O WITH HORN AND HOOK ABOVE;Lu;0;L;01A0 0309;;;;N;;;;1EDF;
+1EDF;LATIN SMALL LETTER O WITH HORN AND HOOK ABOVE;Ll;0;L;01A1 0309;;;;N;;;1EDE;;1EDE
+1EE0;LATIN CAPITAL LETTER O WITH HORN AND TILDE;Lu;0;L;01A0 0303;;;;N;;;;1EE1;
+1EE1;LATIN SMALL LETTER O WITH HORN AND TILDE;Ll;0;L;01A1 0303;;;;N;;;1EE0;;1EE0
+1EE2;LATIN CAPITAL LETTER O WITH HORN AND DOT BELOW;Lu;0;L;01A0 0323;;;;N;;;;1EE3;
+1EE3;LATIN SMALL LETTER O WITH HORN AND DOT BELOW;Ll;0;L;01A1 0323;;;;N;;;1EE2;;1EE2
+1EE4;LATIN CAPITAL LETTER U WITH DOT BELOW;Lu;0;L;0055 0323;;;;N;;;;1EE5;
+1EE5;LATIN SMALL LETTER U WITH DOT BELOW;Ll;0;L;0075 0323;;;;N;;;1EE4;;1EE4
+1EE6;LATIN CAPITAL LETTER U WITH HOOK ABOVE;Lu;0;L;0055 0309;;;;N;;;;1EE7;
+1EE7;LATIN SMALL LETTER U WITH HOOK ABOVE;Ll;0;L;0075 0309;;;;N;;;1EE6;;1EE6
+1EE8;LATIN CAPITAL LETTER U WITH HORN AND ACUTE;Lu;0;L;01AF 0301;;;;N;;;;1EE9;
+1EE9;LATIN SMALL LETTER U WITH HORN AND ACUTE;Ll;0;L;01B0 0301;;;;N;;;1EE8;;1EE8
+1EEA;LATIN CAPITAL LETTER U WITH HORN AND GRAVE;Lu;0;L;01AF 0300;;;;N;;;;1EEB;
+1EEB;LATIN SMALL LETTER U WITH HORN AND GRAVE;Ll;0;L;01B0 0300;;;;N;;;1EEA;;1EEA
+1EEC;LATIN CAPITAL LETTER U WITH HORN AND HOOK ABOVE;Lu;0;L;01AF 0309;;;;N;;;;1EED;
+1EED;LATIN SMALL LETTER U WITH HORN AND HOOK ABOVE;Ll;0;L;01B0 0309;;;;N;;;1EEC;;1EEC
+1EEE;LATIN CAPITAL LETTER U WITH HORN AND TILDE;Lu;0;L;01AF 0303;;;;N;;;;1EEF;
+1EEF;LATIN SMALL LETTER U WITH HORN AND TILDE;Ll;0;L;01B0 0303;;;;N;;;1EEE;;1EEE
+1EF0;LATIN CAPITAL LETTER U WITH HORN AND DOT BELOW;Lu;0;L;01AF 0323;;;;N;;;;1EF1;
+1EF1;LATIN SMALL LETTER U WITH HORN AND DOT BELOW;Ll;0;L;01B0 0323;;;;N;;;1EF0;;1EF0
+1EF2;LATIN CAPITAL LETTER Y WITH GRAVE;Lu;0;L;0059 0300;;;;N;;;;1EF3;
+1EF3;LATIN SMALL LETTER Y WITH GRAVE;Ll;0;L;0079 0300;;;;N;;;1EF2;;1EF2
+1EF4;LATIN CAPITAL LETTER Y WITH DOT BELOW;Lu;0;L;0059 0323;;;;N;;;;1EF5;
+1EF5;LATIN SMALL LETTER Y WITH DOT BELOW;Ll;0;L;0079 0323;;;;N;;;1EF4;;1EF4
+1EF6;LATIN CAPITAL LETTER Y WITH HOOK ABOVE;Lu;0;L;0059 0309;;;;N;;;;1EF7;
+1EF7;LATIN SMALL LETTER Y WITH HOOK ABOVE;Ll;0;L;0079 0309;;;;N;;;1EF6;;1EF6
+1EF8;LATIN CAPITAL LETTER Y WITH TILDE;Lu;0;L;0059 0303;;;;N;;;;1EF9;
+1EF9;LATIN SMALL LETTER Y WITH TILDE;Ll;0;L;0079 0303;;;;N;;;1EF8;;1EF8
+1EFA;LATIN CAPITAL LETTER MIDDLE-WELSH LL;Lu;0;L;;;;;N;;;;1EFB;
+1EFB;LATIN SMALL LETTER MIDDLE-WELSH LL;Ll;0;L;;;;;N;;;1EFA;;1EFA
+1EFC;LATIN CAPITAL LETTER MIDDLE-WELSH V;Lu;0;L;;;;;N;;;;1EFD;
+1EFD;LATIN SMALL LETTER MIDDLE-WELSH V;Ll;0;L;;;;;N;;;1EFC;;1EFC
+1EFE;LATIN CAPITAL LETTER Y WITH LOOP;Lu;0;L;;;;;N;;;;1EFF;
+1EFF;LATIN SMALL LETTER Y WITH LOOP;Ll;0;L;;;;;N;;;1EFE;;1EFE
+1F00;GREEK SMALL LETTER ALPHA WITH PSILI;Ll;0;L;03B1 0313;;;;N;;;1F08;;1F08
+1F01;GREEK SMALL LETTER ALPHA WITH DASIA;Ll;0;L;03B1 0314;;;;N;;;1F09;;1F09
+1F02;GREEK SMALL LETTER ALPHA WITH PSILI AND VARIA;Ll;0;L;1F00 0300;;;;N;;;1F0A;;1F0A
+1F03;GREEK SMALL LETTER ALPHA WITH DASIA AND VARIA;Ll;0;L;1F01 0300;;;;N;;;1F0B;;1F0B
+1F04;GREEK SMALL LETTER ALPHA WITH PSILI AND OXIA;Ll;0;L;1F00 0301;;;;N;;;1F0C;;1F0C
+1F05;GREEK SMALL LETTER ALPHA WITH DASIA AND OXIA;Ll;0;L;1F01 0301;;;;N;;;1F0D;;1F0D
+1F06;GREEK SMALL LETTER ALPHA WITH PSILI AND PERISPOMENI;Ll;0;L;1F00 0342;;;;N;;;1F0E;;1F0E
+1F07;GREEK SMALL LETTER ALPHA WITH DASIA AND PERISPOMENI;Ll;0;L;1F01 0342;;;;N;;;1F0F;;1F0F
+1F08;GREEK CAPITAL LETTER ALPHA WITH PSILI;Lu;0;L;0391 0313;;;;N;;;;1F00;
+1F09;GREEK CAPITAL LETTER ALPHA WITH DASIA;Lu;0;L;0391 0314;;;;N;;;;1F01;
+1F0A;GREEK CAPITAL LETTER ALPHA WITH PSILI AND VARIA;Lu;0;L;1F08 0300;;;;N;;;;1F02;
+1F0B;GREEK CAPITAL LETTER ALPHA WITH DASIA AND VARIA;Lu;0;L;1F09 0300;;;;N;;;;1F03;
+1F0C;GREEK CAPITAL LETTER ALPHA WITH PSILI AND OXIA;Lu;0;L;1F08 0301;;;;N;;;;1F04;
+1F0D;GREEK CAPITAL LETTER ALPHA WITH DASIA AND OXIA;Lu;0;L;1F09 0301;;;;N;;;;1F05;
+1F0E;GREEK CAPITAL LETTER ALPHA WITH PSILI AND PERISPOMENI;Lu;0;L;1F08 0342;;;;N;;;;1F06;
+1F0F;GREEK CAPITAL LETTER ALPHA WITH DASIA AND PERISPOMENI;Lu;0;L;1F09 0342;;;;N;;;;1F07;
+1F10;GREEK SMALL LETTER EPSILON WITH PSILI;Ll;0;L;03B5 0313;;;;N;;;1F18;;1F18
+1F11;GREEK SMALL LETTER EPSILON WITH DASIA;Ll;0;L;03B5 0314;;;;N;;;1F19;;1F19
+1F12;GREEK SMALL LETTER EPSILON WITH PSILI AND VARIA;Ll;0;L;1F10 0300;;;;N;;;1F1A;;1F1A
+1F13;GREEK SMALL LETTER EPSILON WITH DASIA AND VARIA;Ll;0;L;1F11 0300;;;;N;;;1F1B;;1F1B
+1F14;GREEK SMALL LETTER EPSILON WITH PSILI AND OXIA;Ll;0;L;1F10 0301;;;;N;;;1F1C;;1F1C
+1F15;GREEK SMALL LETTER EPSILON WITH DASIA AND OXIA;Ll;0;L;1F11 0301;;;;N;;;1F1D;;1F1D
+1F18;GREEK CAPITAL LETTER EPSILON WITH PSILI;Lu;0;L;0395 0313;;;;N;;;;1F10;
+1F19;GREEK CAPITAL LETTER EPSILON WITH DASIA;Lu;0;L;0395 0314;;;;N;;;;1F11;
+1F1A;GREEK CAPITAL LETTER EPSILON WITH PSILI AND VARIA;Lu;0;L;1F18 0300;;;;N;;;;1F12;
+1F1B;GREEK CAPITAL LETTER EPSILON WITH DASIA AND VARIA;Lu;0;L;1F19 0300;;;;N;;;;1F13;
+1F1C;GREEK CAPITAL LETTER EPSILON WITH PSILI AND OXIA;Lu;0;L;1F18 0301;;;;N;;;;1F14;
+1F1D;GREEK CAPITAL LETTER EPSILON WITH DASIA AND OXIA;Lu;0;L;1F19 0301;;;;N;;;;1F15;
+1F20;GREEK SMALL LETTER ETA WITH PSILI;Ll;0;L;03B7 0313;;;;N;;;1F28;;1F28
+1F21;GREEK SMALL LETTER ETA WITH DASIA;Ll;0;L;03B7 0314;;;;N;;;1F29;;1F29
+1F22;GREEK SMALL LETTER ETA WITH PSILI AND VARIA;Ll;0;L;1F20 0300;;;;N;;;1F2A;;1F2A
+1F23;GREEK SMALL LETTER ETA WITH DASIA AND VARIA;Ll;0;L;1F21 0300;;;;N;;;1F2B;;1F2B
+1F24;GREEK SMALL LETTER ETA WITH PSILI AND OXIA;Ll;0;L;1F20 0301;;;;N;;;1F2C;;1F2C
+1F25;GREEK SMALL LETTER ETA WITH DASIA AND OXIA;Ll;0;L;1F21 0301;;;;N;;;1F2D;;1F2D
+1F26;GREEK SMALL LETTER ETA WITH PSILI AND PERISPOMENI;Ll;0;L;1F20 0342;;;;N;;;1F2E;;1F2E
+1F27;GREEK SMALL LETTER ETA WITH DASIA AND PERISPOMENI;Ll;0;L;1F21 0342;;;;N;;;1F2F;;1F2F
+1F28;GREEK CAPITAL LETTER ETA WITH PSILI;Lu;0;L;0397 0313;;;;N;;;;1F20;
+1F29;GREEK CAPITAL LETTER ETA WITH DASIA;Lu;0;L;0397 0314;;;;N;;;;1F21;
+1F2A;GREEK CAPITAL LETTER ETA WITH PSILI AND VARIA;Lu;0;L;1F28 0300;;;;N;;;;1F22;
+1F2B;GREEK CAPITAL LETTER ETA WITH DASIA AND VARIA;Lu;0;L;1F29 0300;;;;N;;;;1F23;
+1F2C;GREEK CAPITAL LETTER ETA WITH PSILI AND OXIA;Lu;0;L;1F28 0301;;;;N;;;;1F24;
+1F2D;GREEK CAPITAL LETTER ETA WITH DASIA AND OXIA;Lu;0;L;1F29 0301;;;;N;;;;1F25;
+1F2E;GREEK CAPITAL LETTER ETA WITH PSILI AND PERISPOMENI;Lu;0;L;1F28 0342;;;;N;;;;1F26;
+1F2F;GREEK CAPITAL LETTER ETA WITH DASIA AND PERISPOMENI;Lu;0;L;1F29 0342;;;;N;;;;1F27;
+1F30;GREEK SMALL LETTER IOTA WITH PSILI;Ll;0;L;03B9 0313;;;;N;;;1F38;;1F38
+1F31;GREEK SMALL LETTER IOTA WITH DASIA;Ll;0;L;03B9 0314;;;;N;;;1F39;;1F39
+1F32;GREEK SMALL LETTER IOTA WITH PSILI AND VARIA;Ll;0;L;1F30 0300;;;;N;;;1F3A;;1F3A
+1F33;GREEK SMALL LETTER IOTA WITH DASIA AND VARIA;Ll;0;L;1F31 0300;;;;N;;;1F3B;;1F3B
+1F34;GREEK SMALL LETTER IOTA WITH PSILI AND OXIA;Ll;0;L;1F30 0301;;;;N;;;1F3C;;1F3C
+1F35;GREEK SMALL LETTER IOTA WITH DASIA AND OXIA;Ll;0;L;1F31 0301;;;;N;;;1F3D;;1F3D
+1F36;GREEK SMALL LETTER IOTA WITH PSILI AND PERISPOMENI;Ll;0;L;1F30 0342;;;;N;;;1F3E;;1F3E
+1F37;GREEK SMALL LETTER IOTA WITH DASIA AND PERISPOMENI;Ll;0;L;1F31 0342;;;;N;;;1F3F;;1F3F
+1F38;GREEK CAPITAL LETTER IOTA WITH PSILI;Lu;0;L;0399 0313;;;;N;;;;1F30;
+1F39;GREEK CAPITAL LETTER IOTA WITH DASIA;Lu;0;L;0399 0314;;;;N;;;;1F31;
+1F3A;GREEK CAPITAL LETTER IOTA WITH PSILI AND VARIA;Lu;0;L;1F38 0300;;;;N;;;;1F32;
+1F3B;GREEK CAPITAL LETTER IOTA WITH DASIA AND VARIA;Lu;0;L;1F39 0300;;;;N;;;;1F33;
+1F3C;GREEK CAPITAL LETTER IOTA WITH PSILI AND OXIA;Lu;0;L;1F38 0301;;;;N;;;;1F34;
+1F3D;GREEK CAPITAL LETTER IOTA WITH DASIA AND OXIA;Lu;0;L;1F39 0301;;;;N;;;;1F35;
+1F3E;GREEK CAPITAL LETTER IOTA WITH PSILI AND PERISPOMENI;Lu;0;L;1F38 0342;;;;N;;;;1F36;
+1F3F;GREEK CAPITAL LETTER IOTA WITH DASIA AND PERISPOMENI;Lu;0;L;1F39 0342;;;;N;;;;1F37;
+1F40;GREEK SMALL LETTER OMICRON WITH PSILI;Ll;0;L;03BF 0313;;;;N;;;1F48;;1F48
+1F41;GREEK SMALL LETTER OMICRON WITH DASIA;Ll;0;L;03BF 0314;;;;N;;;1F49;;1F49
+1F42;GREEK SMALL LETTER OMICRON WITH PSILI AND VARIA;Ll;0;L;1F40 0300;;;;N;;;1F4A;;1F4A
+1F43;GREEK SMALL LETTER OMICRON WITH DASIA AND VARIA;Ll;0;L;1F41 0300;;;;N;;;1F4B;;1F4B
+1F44;GREEK SMALL LETTER OMICRON WITH PSILI AND OXIA;Ll;0;L;1F40 0301;;;;N;;;1F4C;;1F4C
+1F45;GREEK SMALL LETTER OMICRON WITH DASIA AND OXIA;Ll;0;L;1F41 0301;;;;N;;;1F4D;;1F4D
+1F48;GREEK CAPITAL LETTER OMICRON WITH PSILI;Lu;0;L;039F 0313;;;;N;;;;1F40;
+1F49;GREEK CAPITAL LETTER OMICRON WITH DASIA;Lu;0;L;039F 0314;;;;N;;;;1F41;
+1F4A;GREEK CAPITAL LETTER OMICRON WITH PSILI AND VARIA;Lu;0;L;1F48 0300;;;;N;;;;1F42;
+1F4B;GREEK CAPITAL LETTER OMICRON WITH DASIA AND VARIA;Lu;0;L;1F49 0300;;;;N;;;;1F43;
+1F4C;GREEK CAPITAL LETTER OMICRON WITH PSILI AND OXIA;Lu;0;L;1F48 0301;;;;N;;;;1F44;
+1F4D;GREEK CAPITAL LETTER OMICRON WITH DASIA AND OXIA;Lu;0;L;1F49 0301;;;;N;;;;1F45;
+1F50;GREEK SMALL LETTER UPSILON WITH PSILI;Ll;0;L;03C5 0313;;;;N;;;;;
+1F51;GREEK SMALL LETTER UPSILON WITH DASIA;Ll;0;L;03C5 0314;;;;N;;;1F59;;1F59
+1F52;GREEK SMALL LETTER UPSILON WITH PSILI AND VARIA;Ll;0;L;1F50 0300;;;;N;;;;;
+1F53;GREEK SMALL LETTER UPSILON WITH DASIA AND VARIA;Ll;0;L;1F51 0300;;;;N;;;1F5B;;1F5B
+1F54;GREEK SMALL LETTER UPSILON WITH PSILI AND OXIA;Ll;0;L;1F50 0301;;;;N;;;;;
+1F55;GREEK SMALL LETTER UPSILON WITH DASIA AND OXIA;Ll;0;L;1F51 0301;;;;N;;;1F5D;;1F5D
+1F56;GREEK SMALL LETTER UPSILON WITH PSILI AND PERISPOMENI;Ll;0;L;1F50 0342;;;;N;;;;;
+1F57;GREEK SMALL LETTER UPSILON WITH DASIA AND PERISPOMENI;Ll;0;L;1F51 0342;;;;N;;;1F5F;;1F5F
+1F59;GREEK CAPITAL LETTER UPSILON WITH DASIA;Lu;0;L;03A5 0314;;;;N;;;;1F51;
+1F5B;GREEK CAPITAL LETTER UPSILON WITH DASIA AND VARIA;Lu;0;L;1F59 0300;;;;N;;;;1F53;
+1F5D;GREEK CAPITAL LETTER UPSILON WITH DASIA AND OXIA;Lu;0;L;1F59 0301;;;;N;;;;1F55;
+1F5F;GREEK CAPITAL LETTER UPSILON WITH DASIA AND PERISPOMENI;Lu;0;L;1F59 0342;;;;N;;;;1F57;
+1F60;GREEK SMALL LETTER OMEGA WITH PSILI;Ll;0;L;03C9 0313;;;;N;;;1F68;;1F68
+1F61;GREEK SMALL LETTER OMEGA WITH DASIA;Ll;0;L;03C9 0314;;;;N;;;1F69;;1F69
+1F62;GREEK SMALL LETTER OMEGA WITH PSILI AND VARIA;Ll;0;L;1F60 0300;;;;N;;;1F6A;;1F6A
+1F63;GREEK SMALL LETTER OMEGA WITH DASIA AND VARIA;Ll;0;L;1F61 0300;;;;N;;;1F6B;;1F6B
+1F64;GREEK SMALL LETTER OMEGA WITH PSILI AND OXIA;Ll;0;L;1F60 0301;;;;N;;;1F6C;;1F6C
+1F65;GREEK SMALL LETTER OMEGA WITH DASIA AND OXIA;Ll;0;L;1F61 0301;;;;N;;;1F6D;;1F6D
+1F66;GREEK SMALL LETTER OMEGA WITH PSILI AND PERISPOMENI;Ll;0;L;1F60 0342;;;;N;;;1F6E;;1F6E
+1F67;GREEK SMALL LETTER OMEGA WITH DASIA AND PERISPOMENI;Ll;0;L;1F61 0342;;;;N;;;1F6F;;1F6F
+1F68;GREEK CAPITAL LETTER OMEGA WITH PSILI;Lu;0;L;03A9 0313;;;;N;;;;1F60;
+1F69;GREEK CAPITAL LETTER OMEGA WITH DASIA;Lu;0;L;03A9 0314;;;;N;;;;1F61;
+1F6A;GREEK CAPITAL LETTER OMEGA WITH PSILI AND VARIA;Lu;0;L;1F68 0300;;;;N;;;;1F62;
+1F6B;GREEK CAPITAL LETTER OMEGA WITH DASIA AND VARIA;Lu;0;L;1F69 0300;;;;N;;;;1F63;
+1F6C;GREEK CAPITAL LETTER OMEGA WITH PSILI AND OXIA;Lu;0;L;1F68 0301;;;;N;;;;1F64;
+1F6D;GREEK CAPITAL LETTER OMEGA WITH DASIA AND OXIA;Lu;0;L;1F69 0301;;;;N;;;;1F65;
+1F6E;GREEK CAPITAL LETTER OMEGA WITH PSILI AND PERISPOMENI;Lu;0;L;1F68 0342;;;;N;;;;1F66;
+1F6F;GREEK CAPITAL LETTER OMEGA WITH DASIA AND PERISPOMENI;Lu;0;L;1F69 0342;;;;N;;;;1F67;
+1F70;GREEK SMALL LETTER ALPHA WITH VARIA;Ll;0;L;03B1 0300;;;;N;;;1FBA;;1FBA
+1F71;GREEK SMALL LETTER ALPHA WITH OXIA;Ll;0;L;03AC;;;;N;;;1FBB;;1FBB
+1F72;GREEK SMALL LETTER EPSILON WITH VARIA;Ll;0;L;03B5 0300;;;;N;;;1FC8;;1FC8
+1F73;GREEK SMALL LETTER EPSILON WITH OXIA;Ll;0;L;03AD;;;;N;;;1FC9;;1FC9
+1F74;GREEK SMALL LETTER ETA WITH VARIA;Ll;0;L;03B7 0300;;;;N;;;1FCA;;1FCA
+1F75;GREEK SMALL LETTER ETA WITH OXIA;Ll;0;L;03AE;;;;N;;;1FCB;;1FCB
+1F76;GREEK SMALL LETTER IOTA WITH VARIA;Ll;0;L;03B9 0300;;;;N;;;1FDA;;1FDA
+1F77;GREEK SMALL LETTER IOTA WITH OXIA;Ll;0;L;03AF;;;;N;;;1FDB;;1FDB
+1F78;GREEK SMALL LETTER OMICRON WITH VARIA;Ll;0;L;03BF 0300;;;;N;;;1FF8;;1FF8
+1F79;GREEK SMALL LETTER OMICRON WITH OXIA;Ll;0;L;03CC;;;;N;;;1FF9;;1FF9
+1F7A;GREEK SMALL LETTER UPSILON WITH VARIA;Ll;0;L;03C5 0300;;;;N;;;1FEA;;1FEA
+1F7B;GREEK SMALL LETTER UPSILON WITH OXIA;Ll;0;L;03CD;;;;N;;;1FEB;;1FEB
+1F7C;GREEK SMALL LETTER OMEGA WITH VARIA;Ll;0;L;03C9 0300;;;;N;;;1FFA;;1FFA
+1F7D;GREEK SMALL LETTER OMEGA WITH OXIA;Ll;0;L;03CE;;;;N;;;1FFB;;1FFB
+1F80;GREEK SMALL LETTER ALPHA WITH PSILI AND YPOGEGRAMMENI;Ll;0;L;1F00 0345;;;;N;;;1F88;;1F88
+1F81;GREEK SMALL LETTER ALPHA WITH DASIA AND YPOGEGRAMMENI;Ll;0;L;1F01 0345;;;;N;;;1F89;;1F89
+1F82;GREEK SMALL LETTER ALPHA WITH PSILI AND VARIA AND YPOGEGRAMMENI;Ll;0;L;1F02 0345;;;;N;;;1F8A;;1F8A
+1F83;GREEK SMALL LETTER ALPHA WITH DASIA AND VARIA AND YPOGEGRAMMENI;Ll;0;L;1F03 0345;;;;N;;;1F8B;;1F8B
+1F84;GREEK SMALL LETTER ALPHA WITH PSILI AND OXIA AND YPOGEGRAMMENI;Ll;0;L;1F04 0345;;;;N;;;1F8C;;1F8C
+1F85;GREEK SMALL LETTER ALPHA WITH DASIA AND OXIA AND YPOGEGRAMMENI;Ll;0;L;1F05 0345;;;;N;;;1F8D;;1F8D
+1F86;GREEK SMALL LETTER ALPHA WITH PSILI AND PERISPOMENI AND YPOGEGRAMMENI;Ll;0;L;1F06 0345;;;;N;;;1F8E;;1F8E
+1F87;GREEK SMALL LETTER ALPHA WITH DASIA AND PERISPOMENI AND YPOGEGRAMMENI;Ll;0;L;1F07 0345;;;;N;;;1F8F;;1F8F
+1F88;GREEK CAPITAL LETTER ALPHA WITH PSILI AND PROSGEGRAMMENI;Lt;0;L;1F08 0345;;;;N;;;;1F80;
+1F89;GREEK CAPITAL LETTER ALPHA WITH DASIA AND PROSGEGRAMMENI;Lt;0;L;1F09 0345;;;;N;;;;1F81;
+1F8A;GREEK CAPITAL LETTER ALPHA WITH PSILI AND VARIA AND PROSGEGRAMMENI;Lt;0;L;1F0A 0345;;;;N;;;;1F82;
+1F8B;GREEK CAPITAL LETTER ALPHA WITH DASIA AND VARIA AND PROSGEGRAMMENI;Lt;0;L;1F0B 0345;;;;N;;;;1F83;
+1F8C;GREEK CAPITAL LETTER ALPHA WITH PSILI AND OXIA AND PROSGEGRAMMENI;Lt;0;L;1F0C 0345;;;;N;;;;1F84;
+1F8D;GREEK CAPITAL LETTER ALPHA WITH DASIA AND OXIA AND PROSGEGRAMMENI;Lt;0;L;1F0D 0345;;;;N;;;;1F85;
+1F8E;GREEK CAPITAL LETTER ALPHA WITH PSILI AND PERISPOMENI AND PROSGEGRAMMENI;Lt;0;L;1F0E 0345;;;;N;;;;1F86;
+1F8F;GREEK CAPITAL LETTER ALPHA WITH DASIA AND PERISPOMENI AND PROSGEGRAMMENI;Lt;0;L;1F0F 0345;;;;N;;;;1F87;
+1F90;GREEK SMALL LETTER ETA WITH PSILI AND YPOGEGRAMMENI;Ll;0;L;1F20 0345;;;;N;;;1F98;;1F98
+1F91;GREEK SMALL LETTER ETA WITH DASIA AND YPOGEGRAMMENI;Ll;0;L;1F21 0345;;;;N;;;1F99;;1F99
+1F92;GREEK SMALL LETTER ETA WITH PSILI AND VARIA AND YPOGEGRAMMENI;Ll;0;L;1F22 0345;;;;N;;;1F9A;;1F9A
+1F93;GREEK SMALL LETTER ETA WITH DASIA AND VARIA AND YPOGEGRAMMENI;Ll;0;L;1F23 0345;;;;N;;;1F9B;;1F9B
+1F94;GREEK SMALL LETTER ETA WITH PSILI AND OXIA AND YPOGEGRAMMENI;Ll;0;L;1F24 0345;;;;N;;;1F9C;;1F9C
+1F95;GREEK SMALL LETTER ETA WITH DASIA AND OXIA AND YPOGEGRAMMENI;Ll;0;L;1F25 0345;;;;N;;;1F9D;;1F9D
+1F96;GREEK SMALL LETTER ETA WITH PSILI AND PERISPOMENI AND YPOGEGRAMMENI;Ll;0;L;1F26 0345;;;;N;;;1F9E;;1F9E
+1F97;GREEK SMALL LETTER ETA WITH DASIA AND PERISPOMENI AND YPOGEGRAMMENI;Ll;0;L;1F27 0345;;;;N;;;1F9F;;1F9F
+1F98;GREEK CAPITAL LETTER ETA WITH PSILI AND PROSGEGRAMMENI;Lt;0;L;1F28 0345;;;;N;;;;1F90;
+1F99;GREEK CAPITAL LETTER ETA WITH DASIA AND PROSGEGRAMMENI;Lt;0;L;1F29 0345;;;;N;;;;1F91;
+1F9A;GREEK CAPITAL LETTER ETA WITH PSILI AND VARIA AND PROSGEGRAMMENI;Lt;0;L;1F2A 0345;;;;N;;;;1F92;
+1F9B;GREEK CAPITAL LETTER ETA WITH DASIA AND VARIA AND PROSGEGRAMMENI;Lt;0;L;1F2B 0345;;;;N;;;;1F93;
+1F9C;GREEK CAPITAL LETTER ETA WITH PSILI AND OXIA AND PROSGEGRAMMENI;Lt;0;L;1F2C 0345;;;;N;;;;1F94;
+1F9D;GREEK CAPITAL LETTER ETA WITH DASIA AND OXIA AND PROSGEGRAMMENI;Lt;0;L;1F2D 0345;;;;N;;;;1F95;
+1F9E;GREEK CAPITAL LETTER ETA WITH PSILI AND PERISPOMENI AND PROSGEGRAMMENI;Lt;0;L;1F2E 0345;;;;N;;;;1F96;
+1F9F;GREEK CAPITAL LETTER ETA WITH DASIA AND PERISPOMENI AND PROSGEGRAMMENI;Lt;0;L;1F2F 0345;;;;N;;;;1F97;
+1FA0;GREEK SMALL LETTER OMEGA WITH PSILI AND YPOGEGRAMMENI;Ll;0;L;1F60 0345;;;;N;;;1FA8;;1FA8
+1FA1;GREEK SMALL LETTER OMEGA WITH DASIA AND YPOGEGRAMMENI;Ll;0;L;1F61 0345;;;;N;;;1FA9;;1FA9
+1FA2;GREEK SMALL LETTER OMEGA WITH PSILI AND VARIA AND YPOGEGRAMMENI;Ll;0;L;1F62 0345;;;;N;;;1FAA;;1FAA
+1FA3;GREEK SMALL LETTER OMEGA WITH DASIA AND VARIA AND YPOGEGRAMMENI;Ll;0;L;1F63 0345;;;;N;;;1FAB;;1FAB
+1FA4;GREEK SMALL LETTER OMEGA WITH PSILI AND OXIA AND YPOGEGRAMMENI;Ll;0;L;1F64 0345;;;;N;;;1FAC;;1FAC
+1FA5;GREEK SMALL LETTER OMEGA WITH DASIA AND OXIA AND YPOGEGRAMMENI;Ll;0;L;1F65 0345;;;;N;;;1FAD;;1FAD
+1FA6;GREEK SMALL LETTER OMEGA WITH PSILI AND PERISPOMENI AND YPOGEGRAMMENI;Ll;0;L;1F66 0345;;;;N;;;1FAE;;1FAE
+1FA7;GREEK SMALL LETTER OMEGA WITH DASIA AND PERISPOMENI AND YPOGEGRAMMENI;Ll;0;L;1F67 0345;;;;N;;;1FAF;;1FAF
+1FA8;GREEK CAPITAL LETTER OMEGA WITH PSILI AND PROSGEGRAMMENI;Lt;0;L;1F68 0345;;;;N;;;;1FA0;
+1FA9;GREEK CAPITAL LETTER OMEGA WITH DASIA AND PROSGEGRAMMENI;Lt;0;L;1F69 0345;;;;N;;;;1FA1;
+1FAA;GREEK CAPITAL LETTER OMEGA WITH PSILI AND VARIA AND PROSGEGRAMMENI;Lt;0;L;1F6A 0345;;;;N;;;;1FA2;
+1FAB;GREEK CAPITAL LETTER OMEGA WITH DASIA AND VARIA AND PROSGEGRAMMENI;Lt;0;L;1F6B 0345;;;;N;;;;1FA3;
+1FAC;GREEK CAPITAL LETTER OMEGA WITH PSILI AND OXIA AND PROSGEGRAMMENI;Lt;0;L;1F6C 0345;;;;N;;;;1FA4;
+1FAD;GREEK CAPITAL LETTER OMEGA WITH DASIA AND OXIA AND PROSGEGRAMMENI;Lt;0;L;1F6D 0345;;;;N;;;;1FA5;
+1FAE;GREEK CAPITAL LETTER OMEGA WITH PSILI AND PERISPOMENI AND PROSGEGRAMMENI;Lt;0;L;1F6E 0345;;;;N;;;;1FA6;
+1FAF;GREEK CAPITAL LETTER OMEGA WITH DASIA AND PERISPOMENI AND PROSGEGRAMMENI;Lt;0;L;1F6F 0345;;;;N;;;;1FA7;
+1FB0;GREEK SMALL LETTER ALPHA WITH VRACHY;Ll;0;L;03B1 0306;;;;N;;;1FB8;;1FB8
+1FB1;GREEK SMALL LETTER ALPHA WITH MACRON;Ll;0;L;03B1 0304;;;;N;;;1FB9;;1FB9
+1FB2;GREEK SMALL LETTER ALPHA WITH VARIA AND YPOGEGRAMMENI;Ll;0;L;1F70 0345;;;;N;;;;;
+1FB3;GREEK SMALL LETTER ALPHA WITH YPOGEGRAMMENI;Ll;0;L;03B1 0345;;;;N;;;1FBC;;1FBC
+1FB4;GREEK SMALL LETTER ALPHA WITH OXIA AND YPOGEGRAMMENI;Ll;0;L;03AC 0345;;;;N;;;;;
+1FB6;GREEK SMALL LETTER ALPHA WITH PERISPOMENI;Ll;0;L;03B1 0342;;;;N;;;;;
+1FB7;GREEK SMALL LETTER ALPHA WITH PERISPOMENI AND YPOGEGRAMMENI;Ll;0;L;1FB6 0345;;;;N;;;;;
+1FB8;GREEK CAPITAL LETTER ALPHA WITH VRACHY;Lu;0;L;0391 0306;;;;N;;;;1FB0;
+1FB9;GREEK CAPITAL LETTER ALPHA WITH MACRON;Lu;0;L;0391 0304;;;;N;;;;1FB1;
+1FBA;GREEK CAPITAL LETTER ALPHA WITH VARIA;Lu;0;L;0391 0300;;;;N;;;;1F70;
+1FBB;GREEK CAPITAL LETTER ALPHA WITH OXIA;Lu;0;L;0386;;;;N;;;;1F71;
+1FBC;GREEK CAPITAL LETTER ALPHA WITH PROSGEGRAMMENI;Lt;0;L;0391 0345;;;;N;;;;1FB3;
+1FBD;GREEK KORONIS;Sk;0;ON;<compat> 0020 0313;;;;N;;;;;
+1FBE;GREEK PROSGEGRAMMENI;Ll;0;L;03B9;;;;N;;;0399;;0399
+1FBF;GREEK PSILI;Sk;0;ON;<compat> 0020 0313;;;;N;;;;;
+1FC0;GREEK PERISPOMENI;Sk;0;ON;<compat> 0020 0342;;;;N;;;;;
+1FC1;GREEK DIALYTIKA AND PERISPOMENI;Sk;0;ON;00A8 0342;;;;N;;;;;
+1FC2;GREEK SMALL LETTER ETA WITH VARIA AND YPOGEGRAMMENI;Ll;0;L;1F74 0345;;;;N;;;;;
+1FC3;GREEK SMALL LETTER ETA WITH YPOGEGRAMMENI;Ll;0;L;03B7 0345;;;;N;;;1FCC;;1FCC
+1FC4;GREEK SMALL LETTER ETA WITH OXIA AND YPOGEGRAMMENI;Ll;0;L;03AE 0345;;;;N;;;;;
+1FC6;GREEK SMALL LETTER ETA WITH PERISPOMENI;Ll;0;L;03B7 0342;;;;N;;;;;
+1FC7;GREEK SMALL LETTER ETA WITH PERISPOMENI AND YPOGEGRAMMENI;Ll;0;L;1FC6 0345;;;;N;;;;;
+1FC8;GREEK CAPITAL LETTER EPSILON WITH VARIA;Lu;0;L;0395 0300;;;;N;;;;1F72;
+1FC9;GREEK CAPITAL LETTER EPSILON WITH OXIA;Lu;0;L;0388;;;;N;;;;1F73;
+1FCA;GREEK CAPITAL LETTER ETA WITH VARIA;Lu;0;L;0397 0300;;;;N;;;;1F74;
+1FCB;GREEK CAPITAL LETTER ETA WITH OXIA;Lu;0;L;0389;;;;N;;;;1F75;
+1FCC;GREEK CAPITAL LETTER ETA WITH PROSGEGRAMMENI;Lt;0;L;0397 0345;;;;N;;;;1FC3;
+1FCD;GREEK PSILI AND VARIA;Sk;0;ON;1FBF 0300;;;;N;;;;;
+1FCE;GREEK PSILI AND OXIA;Sk;0;ON;1FBF 0301;;;;N;;;;;
+1FCF;GREEK PSILI AND PERISPOMENI;Sk;0;ON;1FBF 0342;;;;N;;;;;
+1FD0;GREEK SMALL LETTER IOTA WITH VRACHY;Ll;0;L;03B9 0306;;;;N;;;1FD8;;1FD8
+1FD1;GREEK SMALL LETTER IOTA WITH MACRON;Ll;0;L;03B9 0304;;;;N;;;1FD9;;1FD9
+1FD2;GREEK SMALL LETTER IOTA WITH DIALYTIKA AND VARIA;Ll;0;L;03CA 0300;;;;N;;;;;
+1FD3;GREEK SMALL LETTER IOTA WITH DIALYTIKA AND OXIA;Ll;0;L;0390;;;;N;;;;;
+1FD6;GREEK SMALL LETTER IOTA WITH PERISPOMENI;Ll;0;L;03B9 0342;;;;N;;;;;
+1FD7;GREEK SMALL LETTER IOTA WITH DIALYTIKA AND PERISPOMENI;Ll;0;L;03CA 0342;;;;N;;;;;
+1FD8;GREEK CAPITAL LETTER IOTA WITH VRACHY;Lu;0;L;0399 0306;;;;N;;;;1FD0;
+1FD9;GREEK CAPITAL LETTER IOTA WITH MACRON;Lu;0;L;0399 0304;;;;N;;;;1FD1;
+1FDA;GREEK CAPITAL LETTER IOTA WITH VARIA;Lu;0;L;0399 0300;;;;N;;;;1F76;
+1FDB;GREEK CAPITAL LETTER IOTA WITH OXIA;Lu;0;L;038A;;;;N;;;;1F77;
+1FDD;GREEK DASIA AND VARIA;Sk;0;ON;1FFE 0300;;;;N;;;;;
+1FDE;GREEK DASIA AND OXIA;Sk;0;ON;1FFE 0301;;;;N;;;;;
+1FDF;GREEK DASIA AND PERISPOMENI;Sk;0;ON;1FFE 0342;;;;N;;;;;
+1FE0;GREEK SMALL LETTER UPSILON WITH VRACHY;Ll;0;L;03C5 0306;;;;N;;;1FE8;;1FE8
+1FE1;GREEK SMALL LETTER UPSILON WITH MACRON;Ll;0;L;03C5 0304;;;;N;;;1FE9;;1FE9
+1FE2;GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND VARIA;Ll;0;L;03CB 0300;;;;N;;;;;
+1FE3;GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND OXIA;Ll;0;L;03B0;;;;N;;;;;
+1FE4;GREEK SMALL LETTER RHO WITH PSILI;Ll;0;L;03C1 0313;;;;N;;;;;
+1FE5;GREEK SMALL LETTER RHO WITH DASIA;Ll;0;L;03C1 0314;;;;N;;;1FEC;;1FEC
+1FE6;GREEK SMALL LETTER UPSILON WITH PERISPOMENI;Ll;0;L;03C5 0342;;;;N;;;;;
+1FE7;GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND PERISPOMENI;Ll;0;L;03CB 0342;;;;N;;;;;
+1FE8;GREEK CAPITAL LETTER UPSILON WITH VRACHY;Lu;0;L;03A5 0306;;;;N;;;;1FE0;
+1FE9;GREEK CAPITAL LETTER UPSILON WITH MACRON;Lu;0;L;03A5 0304;;;;N;;;;1FE1;
+1FEA;GREEK CAPITAL LETTER UPSILON WITH VARIA;Lu;0;L;03A5 0300;;;;N;;;;1F7A;
+1FEB;GREEK CAPITAL LETTER UPSILON WITH OXIA;Lu;0;L;038E;;;;N;;;;1F7B;
+1FEC;GREEK CAPITAL LETTER RHO WITH DASIA;Lu;0;L;03A1 0314;;;;N;;;;1FE5;
+1FED;GREEK DIALYTIKA AND VARIA;Sk;0;ON;00A8 0300;;;;N;;;;;
+1FEE;GREEK DIALYTIKA AND OXIA;Sk;0;ON;0385;;;;N;;;;;
+1FEF;GREEK VARIA;Sk;0;ON;0060;;;;N;;;;;
+1FF2;GREEK SMALL LETTER OMEGA WITH VARIA AND YPOGEGRAMMENI;Ll;0;L;1F7C 0345;;;;N;;;;;
+1FF3;GREEK SMALL LETTER OMEGA WITH YPOGEGRAMMENI;Ll;0;L;03C9 0345;;;;N;;;1FFC;;1FFC
+1FF4;GREEK SMALL LETTER OMEGA WITH OXIA AND YPOGEGRAMMENI;Ll;0;L;03CE 0345;;;;N;;;;;
+1FF6;GREEK SMALL LETTER OMEGA WITH PERISPOMENI;Ll;0;L;03C9 0342;;;;N;;;;;
+1FF7;GREEK SMALL LETTER OMEGA WITH PERISPOMENI AND YPOGEGRAMMENI;Ll;0;L;1FF6 0345;;;;N;;;;;
+1FF8;GREEK CAPITAL LETTER OMICRON WITH VARIA;Lu;0;L;039F 0300;;;;N;;;;1F78;
+1FF9;GREEK CAPITAL LETTER OMICRON WITH OXIA;Lu;0;L;038C;;;;N;;;;1F79;
+1FFA;GREEK CAPITAL LETTER OMEGA WITH VARIA;Lu;0;L;03A9 0300;;;;N;;;;1F7C;
+1FFB;GREEK CAPITAL LETTER OMEGA WITH OXIA;Lu;0;L;038F;;;;N;;;;1F7D;
+1FFC;GREEK CAPITAL LETTER OMEGA WITH PROSGEGRAMMENI;Lt;0;L;03A9 0345;;;;N;;;;1FF3;
+1FFD;GREEK OXIA;Sk;0;ON;00B4;;;;N;;;;;
+1FFE;GREEK DASIA;Sk;0;ON;<compat> 0020 0314;;;;N;;;;;
+2000;EN QUAD;Zs;0;WS;2002;;;;N;;;;;
+2001;EM QUAD;Zs;0;WS;2003;;;;N;;;;;
+2002;EN SPACE;Zs;0;WS;<compat> 0020;;;;N;;;;;
+2003;EM SPACE;Zs;0;WS;<compat> 0020;;;;N;;;;;
+2004;THREE-PER-EM SPACE;Zs;0;WS;<compat> 0020;;;;N;;;;;
+2005;FOUR-PER-EM SPACE;Zs;0;WS;<compat> 0020;;;;N;;;;;
+2006;SIX-PER-EM SPACE;Zs;0;WS;<compat> 0020;;;;N;;;;;
+2007;FIGURE SPACE;Zs;0;WS;<noBreak> 0020;;;;N;;;;;
+2008;PUNCTUATION SPACE;Zs;0;WS;<compat> 0020;;;;N;;;;;
+2009;THIN SPACE;Zs;0;WS;<compat> 0020;;;;N;;;;;
+200A;HAIR SPACE;Zs;0;WS;<compat> 0020;;;;N;;;;;
+200B;ZERO WIDTH SPACE;Cf;0;BN;;;;;N;;;;;
+200C;ZERO WIDTH NON-JOINER;Cf;0;BN;;;;;N;;;;;
+200D;ZERO WIDTH JOINER;Cf;0;BN;;;;;N;;;;;
+200E;LEFT-TO-RIGHT MARK;Cf;0;L;;;;;N;;;;;
+200F;RIGHT-TO-LEFT MARK;Cf;0;R;;;;;N;;;;;
+2010;HYPHEN;Pd;0;ON;;;;;N;;;;;
+2011;NON-BREAKING HYPHEN;Pd;0;ON;<noBreak> 2010;;;;N;;;;;
+2012;FIGURE DASH;Pd;0;ON;;;;;N;;;;;
+2013;EN DASH;Pd;0;ON;;;;;N;;;;;
+2014;EM DASH;Pd;0;ON;;;;;N;;;;;
+2015;HORIZONTAL BAR;Pd;0;ON;;;;;N;QUOTATION DASH;;;;
+2016;DOUBLE VERTICAL LINE;Po;0;ON;;;;;N;DOUBLE VERTICAL BAR;;;;
+2017;DOUBLE LOW LINE;Po;0;ON;<compat> 0020 0333;;;;N;SPACING DOUBLE UNDERSCORE;;;;
+2018;LEFT SINGLE QUOTATION MARK;Pi;0;ON;;;;;N;SINGLE TURNED COMMA QUOTATION MARK;;;;
+2019;RIGHT SINGLE QUOTATION MARK;Pf;0;ON;;;;;N;SINGLE COMMA QUOTATION MARK;;;;
+201A;SINGLE LOW-9 QUOTATION MARK;Ps;0;ON;;;;;N;LOW SINGLE COMMA QUOTATION MARK;;;;
+201B;SINGLE HIGH-REVERSED-9 QUOTATION MARK;Pi;0;ON;;;;;N;SINGLE REVERSED COMMA QUOTATION MARK;;;;
+201C;LEFT DOUBLE QUOTATION MARK;Pi;0;ON;;;;;N;DOUBLE TURNED COMMA QUOTATION MARK;;;;
+201D;RIGHT DOUBLE QUOTATION MARK;Pf;0;ON;;;;;N;DOUBLE COMMA QUOTATION MARK;;;;
+201E;DOUBLE LOW-9 QUOTATION MARK;Ps;0;ON;;;;;N;LOW DOUBLE COMMA QUOTATION MARK;;;;
+201F;DOUBLE HIGH-REVERSED-9 QUOTATION MARK;Pi;0;ON;;;;;N;DOUBLE REVERSED COMMA QUOTATION MARK;;;;
+2020;DAGGER;Po;0;ON;;;;;N;;;;;
+2021;DOUBLE DAGGER;Po;0;ON;;;;;N;;;;;
+2022;BULLET;Po;0;ON;;;;;N;;;;;
+2023;TRIANGULAR BULLET;Po;0;ON;;;;;N;;;;;
+2024;ONE DOT LEADER;Po;0;ON;<compat> 002E;;;;N;;;;;
+2025;TWO DOT LEADER;Po;0;ON;<compat> 002E 002E;;;;N;;;;;
+2026;HORIZONTAL ELLIPSIS;Po;0;ON;<compat> 002E 002E 002E;;;;N;;;;;
+2027;HYPHENATION POINT;Po;0;ON;;;;;N;;;;;
+2028;LINE SEPARATOR;Zl;0;WS;;;;;N;;;;;
+2029;PARAGRAPH SEPARATOR;Zp;0;B;;;;;N;;;;;
+202A;LEFT-TO-RIGHT EMBEDDING;Cf;0;LRE;;;;;N;;;;;
+202B;RIGHT-TO-LEFT EMBEDDING;Cf;0;RLE;;;;;N;;;;;
+202C;POP DIRECTIONAL FORMATTING;Cf;0;PDF;;;;;N;;;;;
+202D;LEFT-TO-RIGHT OVERRIDE;Cf;0;LRO;;;;;N;;;;;
+202E;RIGHT-TO-LEFT OVERRIDE;Cf;0;RLO;;;;;N;;;;;
+202F;NARROW NO-BREAK SPACE;Zs;0;CS;<noBreak> 0020;;;;N;;;;;
+2030;PER MILLE SIGN;Po;0;ET;;;;;N;;;;;
+2031;PER TEN THOUSAND SIGN;Po;0;ET;;;;;N;;;;;
+2032;PRIME;Po;0;ET;;;;;N;;;;;
+2033;DOUBLE PRIME;Po;0;ET;<compat> 2032 2032;;;;N;;;;;
+2034;TRIPLE PRIME;Po;0;ET;<compat> 2032 2032 2032;;;;N;;;;;
+2035;REVERSED PRIME;Po;0;ON;;;;;N;;;;;
+2036;REVERSED DOUBLE PRIME;Po;0;ON;<compat> 2035 2035;;;;N;;;;;
+2037;REVERSED TRIPLE PRIME;Po;0;ON;<compat> 2035 2035 2035;;;;N;;;;;
+2038;CARET;Po;0;ON;;;;;N;;;;;
+2039;SINGLE LEFT-POINTING ANGLE QUOTATION MARK;Pi;0;ON;;;;;Y;LEFT POINTING SINGLE GUILLEMET;;;;
+203A;SINGLE RIGHT-POINTING ANGLE QUOTATION MARK;Pf;0;ON;;;;;Y;RIGHT POINTING SINGLE GUILLEMET;;;;
+203B;REFERENCE MARK;Po;0;ON;;;;;N;;;;;
+203C;DOUBLE EXCLAMATION MARK;Po;0;ON;<compat> 0021 0021;;;;N;;;;;
+203D;INTERROBANG;Po;0;ON;;;;;N;;;;;
+203E;OVERLINE;Po;0;ON;<compat> 0020 0305;;;;N;SPACING OVERSCORE;;;;
+203F;UNDERTIE;Pc;0;ON;;;;;N;;;;;
+2040;CHARACTER TIE;Pc;0;ON;;;;;N;;;;;
+2041;CARET INSERTION POINT;Po;0;ON;;;;;N;;;;;
+2042;ASTERISM;Po;0;ON;;;;;N;;;;;
+2043;HYPHEN BULLET;Po;0;ON;;;;;N;;;;;
+2044;FRACTION SLASH;Sm;0;CS;;;;;N;;;;;
+2045;LEFT SQUARE BRACKET WITH QUILL;Ps;0;ON;;;;;Y;;;;;
+2046;RIGHT SQUARE BRACKET WITH QUILL;Pe;0;ON;;;;;Y;;;;;
+2047;DOUBLE QUESTION MARK;Po;0;ON;<compat> 003F 003F;;;;N;;;;;
+2048;QUESTION EXCLAMATION MARK;Po;0;ON;<compat> 003F 0021;;;;N;;;;;
+2049;EXCLAMATION QUESTION MARK;Po;0;ON;<compat> 0021 003F;;;;N;;;;;
+204A;TIRONIAN SIGN ET;Po;0;ON;;;;;N;;;;;
+204B;REVERSED PILCROW SIGN;Po;0;ON;;;;;N;;;;;
+204C;BLACK LEFTWARDS BULLET;Po;0;ON;;;;;N;;;;;
+204D;BLACK RIGHTWARDS BULLET;Po;0;ON;;;;;N;;;;;
+204E;LOW ASTERISK;Po;0;ON;;;;;N;;;;;
+204F;REVERSED SEMICOLON;Po;0;ON;;;;;N;;;;;
+2050;CLOSE UP;Po;0;ON;;;;;N;;;;;
+2051;TWO ASTERISKS ALIGNED VERTICALLY;Po;0;ON;;;;;N;;;;;
+2052;COMMERCIAL MINUS SIGN;Sm;0;ON;;;;;N;;;;;
+2053;SWUNG DASH;Po;0;ON;;;;;N;;;;;
+2054;INVERTED UNDERTIE;Pc;0;ON;;;;;N;;;;;
+2055;FLOWER PUNCTUATION MARK;Po;0;ON;;;;;N;;;;;
+2056;THREE DOT PUNCTUATION;Po;0;ON;;;;;N;;;;;
+2057;QUADRUPLE PRIME;Po;0;ON;<compat> 2032 2032 2032 2032;;;;N;;;;;
+2058;FOUR DOT PUNCTUATION;Po;0;ON;;;;;N;;;;;
+2059;FIVE DOT PUNCTUATION;Po;0;ON;;;;;N;;;;;
+205A;TWO DOT PUNCTUATION;Po;0;ON;;;;;N;;;;;
+205B;FOUR DOT MARK;Po;0;ON;;;;;N;;;;;
+205C;DOTTED CROSS;Po;0;ON;;;;;N;;;;;
+205D;TRICOLON;Po;0;ON;;;;;N;;;;;
+205E;VERTICAL FOUR DOTS;Po;0;ON;;;;;N;;;;;
+205F;MEDIUM MATHEMATICAL SPACE;Zs;0;WS;<compat> 0020;;;;N;;;;;
+2060;WORD JOINER;Cf;0;BN;;;;;N;;;;;
+2061;FUNCTION APPLICATION;Cf;0;BN;;;;;N;;;;;
+2062;INVISIBLE TIMES;Cf;0;BN;;;;;N;;;;;
+2063;INVISIBLE SEPARATOR;Cf;0;BN;;;;;N;;;;;
+2064;INVISIBLE PLUS;Cf;0;BN;;;;;N;;;;;
+2066;LEFT-TO-RIGHT ISOLATE;Cf;0;LRI;;;;;N;;;;;
+2067;RIGHT-TO-LEFT ISOLATE;Cf;0;RLI;;;;;N;;;;;
+2068;FIRST STRONG ISOLATE;Cf;0;FSI;;;;;N;;;;;
+2069;POP DIRECTIONAL ISOLATE;Cf;0;PDI;;;;;N;;;;;
+206A;INHIBIT SYMMETRIC SWAPPING;Cf;0;BN;;;;;N;;;;;
+206B;ACTIVATE SYMMETRIC SWAPPING;Cf;0;BN;;;;;N;;;;;
+206C;INHIBIT ARABIC FORM SHAPING;Cf;0;BN;;;;;N;;;;;
+206D;ACTIVATE ARABIC FORM SHAPING;Cf;0;BN;;;;;N;;;;;
+206E;NATIONAL DIGIT SHAPES;Cf;0;BN;;;;;N;;;;;
+206F;NOMINAL DIGIT SHAPES;Cf;0;BN;;;;;N;;;;;
+2070;SUPERSCRIPT ZERO;No;0;EN;<super> 0030;;0;0;N;SUPERSCRIPT DIGIT ZERO;;;;
+2071;SUPERSCRIPT LATIN SMALL LETTER I;Lm;0;L;<super> 0069;;;;N;;;;;
+2074;SUPERSCRIPT FOUR;No;0;EN;<super> 0034;;4;4;N;SUPERSCRIPT DIGIT FOUR;;;;
+2075;SUPERSCRIPT FIVE;No;0;EN;<super> 0035;;5;5;N;SUPERSCRIPT DIGIT FIVE;;;;
+2076;SUPERSCRIPT SIX;No;0;EN;<super> 0036;;6;6;N;SUPERSCRIPT DIGIT SIX;;;;
+2077;SUPERSCRIPT SEVEN;No;0;EN;<super> 0037;;7;7;N;SUPERSCRIPT DIGIT SEVEN;;;;
+2078;SUPERSCRIPT EIGHT;No;0;EN;<super> 0038;;8;8;N;SUPERSCRIPT DIGIT EIGHT;;;;
+2079;SUPERSCRIPT NINE;No;0;EN;<super> 0039;;9;9;N;SUPERSCRIPT DIGIT NINE;;;;
+207A;SUPERSCRIPT PLUS SIGN;Sm;0;ES;<super> 002B;;;;N;;;;;
+207B;SUPERSCRIPT MINUS;Sm;0;ES;<super> 2212;;;;N;SUPERSCRIPT HYPHEN-MINUS;;;;
+207C;SUPERSCRIPT EQUALS SIGN;Sm;0;ON;<super> 003D;;;;N;;;;;
+207D;SUPERSCRIPT LEFT PARENTHESIS;Ps;0;ON;<super> 0028;;;;Y;SUPERSCRIPT OPENING PARENTHESIS;;;;
+207E;SUPERSCRIPT RIGHT PARENTHESIS;Pe;0;ON;<super> 0029;;;;Y;SUPERSCRIPT CLOSING PARENTHESIS;;;;
+207F;SUPERSCRIPT LATIN SMALL LETTER N;Lm;0;L;<super> 006E;;;;N;;;;;
+2080;SUBSCRIPT ZERO;No;0;EN; 0030;;0;0;N;SUBSCRIPT DIGIT ZERO;;;;
+2081;SUBSCRIPT ONE;No;0;EN; 0031;;1;1;N;SUBSCRIPT DIGIT ONE;;;;
+2082;SUBSCRIPT TWO;No;0;EN; 0032;;2;2;N;SUBSCRIPT DIGIT TWO;;;;
+2083;SUBSCRIPT THREE;No;0;EN; 0033;;3;3;N;SUBSCRIPT DIGIT THREE;;;;
+2084;SUBSCRIPT FOUR;No;0;EN; 0034;;4;4;N;SUBSCRIPT DIGIT FOUR;;;;
+2085;SUBSCRIPT FIVE;No;0;EN; 0035;;5;5;N;SUBSCRIPT DIGIT FIVE;;;;
+2086;SUBSCRIPT SIX;No;0;EN; 0036;;6;6;N;SUBSCRIPT DIGIT SIX;;;;
+2087;SUBSCRIPT SEVEN;No;0;EN; 0037;;7;7;N;SUBSCRIPT DIGIT SEVEN;;;;
+2088;SUBSCRIPT EIGHT;No;0;EN; 0038;;8;8;N;SUBSCRIPT DIGIT EIGHT;;;;
+2089;SUBSCRIPT NINE;No;0;EN; 0039;;9;9;N;SUBSCRIPT DIGIT NINE;;;;
+208A;SUBSCRIPT PLUS SIGN;Sm;0;ES; 002B;;;;N;;;;;
+208B;SUBSCRIPT MINUS;Sm;0;ES; 2212;;;;N;SUBSCRIPT HYPHEN-MINUS;;;;
+208C;SUBSCRIPT EQUALS SIGN;Sm;0;ON; 003D;;;;N;;;;;
+208D;SUBSCRIPT LEFT PARENTHESIS;Ps;0;ON; 0028;;;;Y;SUBSCRIPT OPENING PARENTHESIS;;;;
+208E;SUBSCRIPT RIGHT PARENTHESIS;Pe;0;ON; 0029;;;;Y;SUBSCRIPT CLOSING PARENTHESIS;;;;
+2090;LATIN SUBSCRIPT SMALL LETTER A;Lm;0;L; 0061;;;;N;;;;;
+2091;LATIN SUBSCRIPT SMALL LETTER E;Lm;0;L; 0065;;;;N;;;;;
+2092;LATIN SUBSCRIPT SMALL LETTER O;Lm;0;L; 006F;;;;N;;;;;
+2093;LATIN SUBSCRIPT SMALL LETTER X;Lm;0;L; 0078;;;;N;;;;;
+2094;LATIN SUBSCRIPT SMALL LETTER SCHWA;Lm;0;L; 0259;;;;N;;;;;
+2095;LATIN SUBSCRIPT SMALL LETTER H;Lm;0;L; 0068;;;;N;;;;;
+2096;LATIN SUBSCRIPT SMALL LETTER K;Lm;0;L; 006B;;;;N;;;;;
+2097;LATIN SUBSCRIPT SMALL LETTER L;Lm;0;L; 006C;;;;N;;;;;
+2098;LATIN SUBSCRIPT SMALL LETTER M;Lm;0;L; 006D;;;;N;;;;;
+2099;LATIN SUBSCRIPT SMALL LETTER N;Lm;0;L; 006E;;;;N;;;;;
+209A;LATIN SUBSCRIPT SMALL LETTER P;Lm;0;L; 0070;;;;N;;;;;
+209B;LATIN SUBSCRIPT SMALL LETTER S;Lm;0;L; 0073;;;;N;;;;;
+209C;LATIN SUBSCRIPT SMALL LETTER T;Lm;0;L; 0074;;;;N;;;;;
+20A0;EURO-CURRENCY SIGN;Sc;0;ET;;;;;N;;;;;
+20A1;COLON SIGN;Sc;0;ET;;;;;N;;;;;
+20A2;CRUZEIRO SIGN;Sc;0;ET;;;;;N;;;;;
+20A3;FRENCH FRANC SIGN;Sc;0;ET;;;;;N;;;;;
+20A4;LIRA SIGN;Sc;0;ET;;;;;N;;;;;
+20A5;MILL SIGN;Sc;0;ET;;;;;N;;;;;
+20A6;NAIRA SIGN;Sc;0;ET;;;;;N;;;;;
+20A7;PESETA SIGN;Sc;0;ET;;;;;N;;;;;
+20A8;RUPEE SIGN;Sc;0;ET;<compat> 0052 0073;;;;N;;;;;
+20A9;WON SIGN;Sc;0;ET;;;;;N;;;;;
+20AA;NEW SHEQEL SIGN;Sc;0;ET;;;;;N;;;;;
+20AB;DONG SIGN;Sc;0;ET;;;;;N;;;;;
+20AC;EURO SIGN;Sc;0;ET;;;;;N;;;;;
+20AD;KIP SIGN;Sc;0;ET;;;;;N;;;;;
+20AE;TUGRIK SIGN;Sc;0;ET;;;;;N;;;;;
+20AF;DRACHMA SIGN;Sc;0;ET;;;;;N;;;;;
+20B0;GERMAN PENNY SIGN;Sc;0;ET;;;;;N;;;;;
+20B1;PESO SIGN;Sc;0;ET;;;;;N;;;;;
+20B2;GUARANI SIGN;Sc;0;ET;;;;;N;;;;;
+20B3;AUSTRAL SIGN;Sc;0;ET;;;;;N;;;;;
+20B4;HRYVNIA SIGN;Sc;0;ET;;;;;N;;;;;
+20B5;CEDI SIGN;Sc;0;ET;;;;;N;;;;;
+20B6;LIVRE TOURNOIS SIGN;Sc;0;ET;;;;;N;;;;;
+20B7;SPESMILO SIGN;Sc;0;ET;;;;;N;;;;;
+20B8;TENGE SIGN;Sc;0;ET;;;;;N;;;;;
+20B9;INDIAN RUPEE SIGN;Sc;0;ET;;;;;N;;;;;
+20BA;TURKISH LIRA SIGN;Sc;0;ET;;;;;N;;;;;
+20BB;NORDIC MARK SIGN;Sc;0;ET;;;;;N;;;;;
+20BC;MANAT SIGN;Sc;0;ET;;;;;N;;;;;
+20BD;RUBLE SIGN;Sc;0;ET;;;;;N;;;;;
+20BE;LARI SIGN;Sc;0;ET;;;;;N;;;;;
+20BF;BITCOIN SIGN;Sc;0;ET;;;;;N;;;;;
+20D0;COMBINING LEFT HARPOON ABOVE;Mn;230;NSM;;;;;N;NON-SPACING LEFT HARPOON ABOVE;;;;
+20D1;COMBINING RIGHT HARPOON ABOVE;Mn;230;NSM;;;;;N;NON-SPACING RIGHT HARPOON ABOVE;;;;
+20D2;COMBINING LONG VERTICAL LINE OVERLAY;Mn;1;NSM;;;;;N;NON-SPACING LONG VERTICAL BAR OVERLAY;;;;
+20D3;COMBINING SHORT VERTICAL LINE OVERLAY;Mn;1;NSM;;;;;N;NON-SPACING SHORT VERTICAL BAR OVERLAY;;;;
+20D4;COMBINING ANTICLOCKWISE ARROW ABOVE;Mn;230;NSM;;;;;N;NON-SPACING ANTICLOCKWISE ARROW ABOVE;;;;
+20D5;COMBINING CLOCKWISE ARROW ABOVE;Mn;230;NSM;;;;;N;NON-SPACING CLOCKWISE ARROW ABOVE;;;;
+20D6;COMBINING LEFT ARROW ABOVE;Mn;230;NSM;;;;;N;NON-SPACING LEFT ARROW ABOVE;;;;
+20D7;COMBINING RIGHT ARROW ABOVE;Mn;230;NSM;;;;;N;NON-SPACING RIGHT ARROW ABOVE;;;;
+20D8;COMBINING RING OVERLAY;Mn;1;NSM;;;;;N;NON-SPACING RING OVERLAY;;;;
+20D9;COMBINING CLOCKWISE RING OVERLAY;Mn;1;NSM;;;;;N;NON-SPACING CLOCKWISE RING OVERLAY;;;;
+20DA;COMBINING ANTICLOCKWISE RING OVERLAY;Mn;1;NSM;;;;;N;NON-SPACING ANTICLOCKWISE RING OVERLAY;;;;
+20DB;COMBINING THREE DOTS ABOVE;Mn;230;NSM;;;;;N;NON-SPACING THREE DOTS ABOVE;;;;
+20DC;COMBINING FOUR DOTS ABOVE;Mn;230;NSM;;;;;N;NON-SPACING FOUR DOTS ABOVE;;;;
+20DD;COMBINING ENCLOSING CIRCLE;Me;0;NSM;;;;;N;ENCLOSING CIRCLE;;;;
+20DE;COMBINING ENCLOSING SQUARE;Me;0;NSM;;;;;N;ENCLOSING SQUARE;;;;
+20DF;COMBINING ENCLOSING DIAMOND;Me;0;NSM;;;;;N;ENCLOSING DIAMOND;;;;
+20E0;COMBINING ENCLOSING CIRCLE BACKSLASH;Me;0;NSM;;;;;N;ENCLOSING CIRCLE SLASH;;;;
+20E1;COMBINING LEFT RIGHT ARROW ABOVE;Mn;230;NSM;;;;;N;NON-SPACING LEFT RIGHT ARROW ABOVE;;;;
+20E2;COMBINING ENCLOSING SCREEN;Me;0;NSM;;;;;N;;;;;
+20E3;COMBINING ENCLOSING KEYCAP;Me;0;NSM;;;;;N;;;;;
+20E4;COMBINING ENCLOSING UPWARD POINTING TRIANGLE;Me;0;NSM;;;;;N;;;;;
+20E5;COMBINING REVERSE SOLIDUS OVERLAY;Mn;1;NSM;;;;;N;;;;;
+20E6;COMBINING DOUBLE VERTICAL STROKE OVERLAY;Mn;1;NSM;;;;;N;;;;;
+20E7;COMBINING ANNUITY SYMBOL;Mn;230;NSM;;;;;N;;;;;
+20E8;COMBINING TRIPLE UNDERDOT;Mn;220;NSM;;;;;N;;;;;
+20E9;COMBINING WIDE BRIDGE ABOVE;Mn;230;NSM;;;;;N;;;;;
+20EA;COMBINING LEFTWARDS ARROW OVERLAY;Mn;1;NSM;;;;;N;;;;;
+20EB;COMBINING LONG DOUBLE SOLIDUS OVERLAY;Mn;1;NSM;;;;;N;;;;;
+20EC;COMBINING RIGHTWARDS HARPOON WITH BARB DOWNWARDS;Mn;220;NSM;;;;;N;;;;;
+20ED;COMBINING LEFTWARDS HARPOON WITH BARB DOWNWARDS;Mn;220;NSM;;;;;N;;;;;
+20EE;COMBINING LEFT ARROW BELOW;Mn;220;NSM;;;;;N;;;;;
+20EF;COMBINING RIGHT ARROW BELOW;Mn;220;NSM;;;;;N;;;;;
+20F0;COMBINING ASTERISK ABOVE;Mn;230;NSM;;;;;N;;;;;
+2100;ACCOUNT OF;So;0;ON;<compat> 0061 002F 0063;;;;N;;;;;
+2101;ADDRESSED TO THE SUBJECT;So;0;ON;<compat> 0061 002F 0073;;;;N;;;;;
+2102;DOUBLE-STRUCK CAPITAL C;Lu;0;L; 0043;;;;N;DOUBLE-STRUCK C;;;;
+2103;DEGREE CELSIUS;So;0;ON;<compat> 00B0 0043;;;;N;DEGREES CENTIGRADE;;;;
+2104;CENTRE LINE SYMBOL;So;0;ON;;;;;N;C L SYMBOL;;;;
+2105;CARE OF;So;0;ON;<compat> 0063 002F 006F;;;;N;;;;;
+2106;CADA UNA;So;0;ON;<compat> 0063 002F 0075;;;;N;;;;;
+2107;EULER CONSTANT;Lu;0;L;<compat> 0190;;;;N;EULERS;;;;
+2108;SCRUPLE;So;0;ON;;;;;N;;;;;
+2109;DEGREE FAHRENHEIT;So;0;ON;<compat> 00B0 0046;;;;N;DEGREES FAHRENHEIT;;;;
+210A;SCRIPT SMALL G;Ll;0;L; 0067;;;;N;;;;;
+210B;SCRIPT CAPITAL H;Lu;0;L; 0048;;;;N;SCRIPT H;;;;
+210C;BLACK-LETTER CAPITAL H;Lu;0;L; 0048;;;;N;BLACK-LETTER H;;;;
+210D;DOUBLE-STRUCK CAPITAL H;Lu;0;L; 0048;;;;N;DOUBLE-STRUCK H;;;;
+210E;PLANCK CONSTANT;Ll;0;L; 0068;;;;N;;;;;
+210F;PLANCK CONSTANT OVER TWO PI;Ll;0;L; 0127;;;;N;PLANCK CONSTANT OVER 2 PI;;;;
+2110;SCRIPT CAPITAL I;Lu;0;L; 0049;;;;N;SCRIPT I;;;;
+2111;BLACK-LETTER CAPITAL I;Lu;0;L; 0049;;;;N;BLACK-LETTER I;;;;
+2112;SCRIPT CAPITAL L;Lu;0;L; 004C;;;;N;SCRIPT L;;;;
+2113;SCRIPT SMALL L;Ll;0;L; 006C;;;;N;;;;;
+2114;L B BAR SYMBOL;So;0;ON;;;;;N;;;;;
+2115;DOUBLE-STRUCK CAPITAL N;Lu;0;L; 004E;;;;N;DOUBLE-STRUCK N;;;;
+2116;NUMERO SIGN;So;0;ON;<compat> 004E 006F;;;;N;NUMERO;;;;
+2117;SOUND RECORDING COPYRIGHT;So;0;ON;;;;;N;;;;;
+2118;SCRIPT CAPITAL P;Sm;0;ON;;;;;N;SCRIPT P;;;;
+2119;DOUBLE-STRUCK CAPITAL P;Lu;0;L; 0050;;;;N;DOUBLE-STRUCK P;;;;
+211A;DOUBLE-STRUCK CAPITAL Q;Lu;0;L; 0051;;;;N;DOUBLE-STRUCK Q;;;;
+211B;SCRIPT CAPITAL R;Lu;0;L; 0052;;;;N;SCRIPT R;;;;
+211C;BLACK-LETTER CAPITAL R;Lu;0;L; 0052;;;;N;BLACK-LETTER R;;;;
+211D;DOUBLE-STRUCK CAPITAL R;Lu;0;L; 0052;;;;N;DOUBLE-STRUCK R;;;;
+211E;PRESCRIPTION TAKE;So;0;ON;;;;;N;;;;;
+211F;RESPONSE;So;0;ON;;;;;N;;;;;
+2120;SERVICE MARK;So;0;ON;<super> 0053 004D;;;;N;;;;;
+2121;TELEPHONE SIGN;So;0;ON;<compat> 0054 0045 004C;;;;N;T E L SYMBOL;;;;
+2122;TRADE MARK SIGN;So;0;ON;<super> 0054 004D;;;;N;TRADEMARK;;;;
+2123;VERSICLE;So;0;ON;;;;;N;;;;;
+2124;DOUBLE-STRUCK CAPITAL Z;Lu;0;L; 005A;;;;N;DOUBLE-STRUCK Z;;;;
+2125;OUNCE SIGN;So;0;ON;;;;;N;OUNCE;;;;
+2126;OHM SIGN;Lu;0;L;03A9;;;;N;OHM;;;03C9;
+2127;INVERTED OHM SIGN;So;0;ON;;;;;N;MHO;;;;
+2128;BLACK-LETTER CAPITAL Z;Lu;0;L; 005A;;;;N;BLACK-LETTER Z;;;;
+2129;TURNED GREEK SMALL LETTER IOTA;So;0;ON;;;;;N;;;;;
+212A;KELVIN SIGN;Lu;0;L;004B;;;;N;DEGREES KELVIN;;;006B;
+212B;ANGSTROM SIGN;Lu;0;L;00C5;;;;N;ANGSTROM UNIT;;;00E5;
+212C;SCRIPT CAPITAL B;Lu;0;L; 0042;;;;N;SCRIPT B;;;;
+212D;BLACK-LETTER CAPITAL C;Lu;0;L; 0043;;;;N;BLACK-LETTER C;;;;
+212E;ESTIMATED SYMBOL;So;0;ET;;;;;N;;;;;
+212F;SCRIPT SMALL E;Ll;0;L; 0065;;;;N;;;;;
+2130;SCRIPT CAPITAL E;Lu;0;L; 0045;;;;N;SCRIPT E;;;;
+2131;SCRIPT CAPITAL F;Lu;0;L; 0046;;;;N;SCRIPT F;;;;
+2132;TURNED CAPITAL F;Lu;0;L;;;;;N;TURNED F;;;214E;
+2133;SCRIPT CAPITAL M;Lu;0;L; 004D;;;;N;SCRIPT M;;;;
+2134;SCRIPT SMALL O;Ll;0;L; 006F;;;;N;;;;;
+2135;ALEF SYMBOL;Lo;0;L;<compat> 05D0;;;;N;FIRST TRANSFINITE CARDINAL;;;;
+2136;BET SYMBOL;Lo;0;L;<compat> 05D1;;;;N;SECOND TRANSFINITE CARDINAL;;;;
+2137;GIMEL SYMBOL;Lo;0;L;<compat> 05D2;;;;N;THIRD TRANSFINITE CARDINAL;;;;
+2138;DALET SYMBOL;Lo;0;L;<compat> 05D3;;;;N;FOURTH TRANSFINITE CARDINAL;;;;
+2139;INFORMATION SOURCE;Ll;0;L; 0069;;;;N;;;;;
+213A;ROTATED CAPITAL Q;So;0;ON;;;;;N;;;;;
+213B;FACSIMILE SIGN;So;0;ON;<compat> 0046 0041 0058;;;;N;;;;;
+213C;DOUBLE-STRUCK SMALL PI;Ll;0;L; 03C0;;;;N;;;;;
+213D;DOUBLE-STRUCK SMALL GAMMA;Ll;0;L; 03B3;;;;N;;;;;
+213E;DOUBLE-STRUCK CAPITAL GAMMA;Lu;0;L; 0393;;;;N;;;;;
+213F;DOUBLE-STRUCK CAPITAL PI;Lu;0;L; 03A0;;;;N;;;;;
+2140;DOUBLE-STRUCK N-ARY SUMMATION;Sm;0;ON; 2211;;;;Y;;;;;
+2141;TURNED SANS-SERIF CAPITAL G;Sm;0;ON;;;;;N;;;;;
+2142;TURNED SANS-SERIF CAPITAL L;Sm;0;ON;;;;;N;;;;;
+2143;REVERSED SANS-SERIF CAPITAL L;Sm;0;ON;;;;;N;;;;;
+2144;TURNED SANS-SERIF CAPITAL Y;Sm;0;ON;;;;;N;;;;;
+2145;DOUBLE-STRUCK ITALIC CAPITAL D;Lu;0;L; 0044;;;;N;;;;;
+2146;DOUBLE-STRUCK ITALIC SMALL D;Ll;0;L; 0064;;;;N;;;;;
+2147;DOUBLE-STRUCK ITALIC SMALL E;Ll;0;L; 0065;;;;N;;;;;
+2148;DOUBLE-STRUCK ITALIC SMALL I;Ll;0;L; 0069;;;;N;;;;;
+2149;DOUBLE-STRUCK ITALIC SMALL J;Ll;0;L; 006A;;;;N;;;;;
+214A;PROPERTY LINE;So;0;ON;;;;;N;;;;;
+214B;TURNED AMPERSAND;Sm;0;ON;;;;;N;;;;;
+214C;PER SIGN;So;0;ON;;;;;N;;;;;
+214D;AKTIESELSKAB;So;0;ON;;;;;N;;;;;
+214E;TURNED SMALL F;Ll;0;L;;;;;N;;;2132;;2132
+214F;SYMBOL FOR SAMARITAN SOURCE;So;0;L;;;;;N;;;;;
+2150;VULGAR FRACTION ONE SEVENTH;No;0;ON;<fraction> 0031 2044 0037;;;1/7;N;;;;;
+2151;VULGAR FRACTION ONE NINTH;No;0;ON;<fraction> 0031 2044 0039;;;1/9;N;;;;;
+2152;VULGAR FRACTION ONE TENTH;No;0;ON;<fraction> 0031 2044 0031 0030;;;1/10;N;;;;;
+2153;VULGAR FRACTION ONE THIRD;No;0;ON;<fraction> 0031 2044 0033;;;1/3;N;FRACTION ONE THIRD;;;;
+2154;VULGAR FRACTION TWO THIRDS;No;0;ON;<fraction> 0032 2044 0033;;;2/3;N;FRACTION TWO THIRDS;;;;
+2155;VULGAR FRACTION ONE FIFTH;No;0;ON;<fraction> 0031 2044 0035;;;1/5;N;FRACTION ONE FIFTH;;;;
+2156;VULGAR FRACTION TWO FIFTHS;No;0;ON;<fraction> 0032 2044 0035;;;2/5;N;FRACTION TWO FIFTHS;;;;
+2157;VULGAR FRACTION THREE FIFTHS;No;0;ON;<fraction> 0033 2044 0035;;;3/5;N;FRACTION THREE FIFTHS;;;;
+2158;VULGAR FRACTION FOUR FIFTHS;No;0;ON;<fraction> 0034 2044 0035;;;4/5;N;FRACTION FOUR FIFTHS;;;;
+2159;VULGAR FRACTION ONE SIXTH;No;0;ON;<fraction> 0031 2044 0036;;;1/6;N;FRACTION ONE SIXTH;;;;
+215A;VULGAR FRACTION FIVE SIXTHS;No;0;ON;<fraction> 0035 2044 0036;;;5/6;N;FRACTION FIVE SIXTHS;;;;
+215B;VULGAR FRACTION ONE EIGHTH;No;0;ON;<fraction> 0031 2044 0038;;;1/8;N;FRACTION ONE EIGHTH;;;;
+215C;VULGAR FRACTION THREE EIGHTHS;No;0;ON;<fraction> 0033 2044 0038;;;3/8;N;FRACTION THREE EIGHTHS;;;;
+215D;VULGAR FRACTION FIVE EIGHTHS;No;0;ON;<fraction> 0035 2044 0038;;;5/8;N;FRACTION FIVE EIGHTHS;;;;
+215E;VULGAR FRACTION SEVEN EIGHTHS;No;0;ON;<fraction> 0037 2044 0038;;;7/8;N;FRACTION SEVEN EIGHTHS;;;;
+215F;FRACTION NUMERATOR ONE;No;0;ON;<fraction> 0031 2044;;;1;N;;;;;
+2160;ROMAN NUMERAL ONE;Nl;0;L;<compat> 0049;;;1;N;;;;2170;
+2161;ROMAN NUMERAL TWO;Nl;0;L;<compat> 0049 0049;;;2;N;;;;2171;
+2162;ROMAN NUMERAL THREE;Nl;0;L;<compat> 0049 0049 0049;;;3;N;;;;2172;
+2163;ROMAN NUMERAL FOUR;Nl;0;L;<compat> 0049 0056;;;4;N;;;;2173;
+2164;ROMAN NUMERAL FIVE;Nl;0;L;<compat> 0056;;;5;N;;;;2174;
+2165;ROMAN NUMERAL SIX;Nl;0;L;<compat> 0056 0049;;;6;N;;;;2175;
+2166;ROMAN NUMERAL SEVEN;Nl;0;L;<compat> 0056 0049 0049;;;7;N;;;;2176;
+2167;ROMAN NUMERAL EIGHT;Nl;0;L;<compat> 0056 0049 0049 0049;;;8;N;;;;2177;
+2168;ROMAN NUMERAL NINE;Nl;0;L;<compat> 0049 0058;;;9;N;;;;2178;
+2169;ROMAN NUMERAL TEN;Nl;0;L;<compat> 0058;;;10;N;;;;2179;
+216A;ROMAN NUMERAL ELEVEN;Nl;0;L;<compat> 0058 0049;;;11;N;;;;217A;
+216B;ROMAN NUMERAL TWELVE;Nl;0;L;<compat> 0058 0049 0049;;;12;N;;;;217B;
+216C;ROMAN NUMERAL FIFTY;Nl;0;L;<compat> 004C;;;50;N;;;;217C;
+216D;ROMAN NUMERAL ONE HUNDRED;Nl;0;L;<compat> 0043;;;100;N;;;;217D;
+216E;ROMAN NUMERAL FIVE HUNDRED;Nl;0;L;<compat> 0044;;;500;N;;;;217E;
+216F;ROMAN NUMERAL ONE THOUSAND;Nl;0;L;<compat> 004D;;;1000;N;;;;217F;
+2170;SMALL ROMAN NUMERAL ONE;Nl;0;L;<compat> 0069;;;1;N;;;2160;;2160
+2171;SMALL ROMAN NUMERAL TWO;Nl;0;L;<compat> 0069 0069;;;2;N;;;2161;;2161
+2172;SMALL ROMAN NUMERAL THREE;Nl;0;L;<compat> 0069 0069 0069;;;3;N;;;2162;;2162
+2173;SMALL ROMAN NUMERAL FOUR;Nl;0;L;<compat> 0069 0076;;;4;N;;;2163;;2163
+2174;SMALL ROMAN NUMERAL FIVE;Nl;0;L;<compat> 0076;;;5;N;;;2164;;2164
+2175;SMALL ROMAN NUMERAL SIX;Nl;0;L;<compat> 0076 0069;;;6;N;;;2165;;2165
+2176;SMALL ROMAN NUMERAL SEVEN;Nl;0;L;<compat> 0076 0069 0069;;;7;N;;;2166;;2166
+2177;SMALL ROMAN NUMERAL EIGHT;Nl;0;L;<compat> 0076 0069 0069 0069;;;8;N;;;2167;;2167
+2178;SMALL ROMAN NUMERAL NINE;Nl;0;L;<compat> 0069 0078;;;9;N;;;2168;;2168
+2179;SMALL ROMAN NUMERAL TEN;Nl;0;L;<compat> 0078;;;10;N;;;2169;;2169
+217A;SMALL ROMAN NUMERAL ELEVEN;Nl;0;L;<compat> 0078 0069;;;11;N;;;216A;;216A
+217B;SMALL ROMAN NUMERAL TWELVE;Nl;0;L;<compat> 0078 0069 0069;;;12;N;;;216B;;216B
+217C;SMALL ROMAN NUMERAL FIFTY;Nl;0;L;<compat> 006C;;;50;N;;;216C;;216C
+217D;SMALL ROMAN NUMERAL ONE HUNDRED;Nl;0;L;<compat> 0063;;;100;N;;;216D;;216D
+217E;SMALL ROMAN NUMERAL FIVE HUNDRED;Nl;0;L;<compat> 0064;;;500;N;;;216E;;216E
+217F;SMALL ROMAN NUMERAL ONE THOUSAND;Nl;0;L;<compat> 006D;;;1000;N;;;216F;;216F
+2180;ROMAN NUMERAL ONE THOUSAND C D;Nl;0;L;;;;1000;N;;;;;
+2181;ROMAN NUMERAL FIVE THOUSAND;Nl;0;L;;;;5000;N;;;;;
+2182;ROMAN NUMERAL TEN THOUSAND;Nl;0;L;;;;10000;N;;;;;
+2183;ROMAN NUMERAL REVERSED ONE HUNDRED;Lu;0;L;;;;;N;;;;2184;
+2184;LATIN SMALL LETTER REVERSED C;Ll;0;L;;;;;N;;;2183;;2183
+2185;ROMAN NUMERAL SIX LATE FORM;Nl;0;L;;;;6;N;;;;;
+2186;ROMAN NUMERAL FIFTY EARLY FORM;Nl;0;L;;;;50;N;;;;;
+2187;ROMAN NUMERAL FIFTY THOUSAND;Nl;0;L;;;;50000;N;;;;;
+2188;ROMAN NUMERAL ONE HUNDRED THOUSAND;Nl;0;L;;;;100000;N;;;;;
+2189;VULGAR FRACTION ZERO THIRDS;No;0;ON;<fraction> 0030 2044 0033;;;0;N;;;;;
+218A;TURNED DIGIT TWO;So;0;ON;;;;;N;;;;;
+218B;TURNED DIGIT THREE;So;0;ON;;;;;N;;;;;
+2190;LEFTWARDS ARROW;Sm;0;ON;;;;;N;LEFT ARROW;;;;
+2191;UPWARDS ARROW;Sm;0;ON;;;;;N;UP ARROW;;;;
+2192;RIGHTWARDS ARROW;Sm;0;ON;;;;;N;RIGHT ARROW;;;;
+2193;DOWNWARDS ARROW;Sm;0;ON;;;;;N;DOWN ARROW;;;;
+2194;LEFT RIGHT ARROW;Sm;0;ON;;;;;N;;;;;
+2195;UP DOWN ARROW;So;0;ON;;;;;N;;;;;
+2196;NORTH WEST ARROW;So;0;ON;;;;;N;UPPER LEFT ARROW;;;;
+2197;NORTH EAST ARROW;So;0;ON;;;;;N;UPPER RIGHT ARROW;;;;
+2198;SOUTH EAST ARROW;So;0;ON;;;;;N;LOWER RIGHT ARROW;;;;
+2199;SOUTH WEST ARROW;So;0;ON;;;;;N;LOWER LEFT ARROW;;;;
+219A;LEFTWARDS ARROW WITH STROKE;Sm;0;ON;2190 0338;;;;N;LEFT ARROW WITH STROKE;;;;
+219B;RIGHTWARDS ARROW WITH STROKE;Sm;0;ON;2192 0338;;;;N;RIGHT ARROW WITH STROKE;;;;
+219C;LEFTWARDS WAVE ARROW;So;0;ON;;;;;N;LEFT WAVE ARROW;;;;
+219D;RIGHTWARDS WAVE ARROW;So;0;ON;;;;;N;RIGHT WAVE ARROW;;;;
+219E;LEFTWARDS TWO HEADED ARROW;So;0;ON;;;;;N;LEFT TWO HEADED ARROW;;;;
+219F;UPWARDS TWO HEADED ARROW;So;0;ON;;;;;N;UP TWO HEADED ARROW;;;;
+21A0;RIGHTWARDS TWO HEADED ARROW;Sm;0;ON;;;;;N;RIGHT TWO HEADED ARROW;;;;
+21A1;DOWNWARDS TWO HEADED ARROW;So;0;ON;;;;;N;DOWN TWO HEADED ARROW;;;;
+21A2;LEFTWARDS ARROW WITH TAIL;So;0;ON;;;;;N;LEFT ARROW WITH TAIL;;;;
+21A3;RIGHTWARDS ARROW WITH TAIL;Sm;0;ON;;;;;N;RIGHT ARROW WITH TAIL;;;;
+21A4;LEFTWARDS ARROW FROM BAR;So;0;ON;;;;;N;LEFT ARROW FROM BAR;;;;
+21A5;UPWARDS ARROW FROM BAR;So;0;ON;;;;;N;UP ARROW FROM BAR;;;;
+21A6;RIGHTWARDS ARROW FROM BAR;Sm;0;ON;;;;;N;RIGHT ARROW FROM BAR;;;;
+21A7;DOWNWARDS ARROW FROM BAR;So;0;ON;;;;;N;DOWN ARROW FROM BAR;;;;
+21A8;UP DOWN ARROW WITH BASE;So;0;ON;;;;;N;;;;;
+21A9;LEFTWARDS ARROW WITH HOOK;So;0;ON;;;;;N;LEFT ARROW WITH HOOK;;;;
+21AA;RIGHTWARDS ARROW WITH HOOK;So;0;ON;;;;;N;RIGHT ARROW WITH HOOK;;;;
+21AB;LEFTWARDS ARROW WITH LOOP;So;0;ON;;;;;N;LEFT ARROW WITH LOOP;;;;
+21AC;RIGHTWARDS ARROW WITH LOOP;So;0;ON;;;;;N;RIGHT ARROW WITH LOOP;;;;
+21AD;LEFT RIGHT WAVE ARROW;So;0;ON;;;;;N;;;;;
+21AE;LEFT RIGHT ARROW WITH STROKE;Sm;0;ON;2194 0338;;;;N;;;;;
+21AF;DOWNWARDS ZIGZAG ARROW;So;0;ON;;;;;N;DOWN ZIGZAG ARROW;;;;
+21B0;UPWARDS ARROW WITH TIP LEFTWARDS;So;0;ON;;;;;N;UP ARROW WITH TIP LEFT;;;;
+21B1;UPWARDS ARROW WITH TIP RIGHTWARDS;So;0;ON;;;;;N;UP ARROW WITH TIP RIGHT;;;;
+21B2;DOWNWARDS ARROW WITH TIP LEFTWARDS;So;0;ON;;;;;N;DOWN ARROW WITH TIP LEFT;;;;
+21B3;DOWNWARDS ARROW WITH TIP RIGHTWARDS;So;0;ON;;;;;N;DOWN ARROW WITH TIP RIGHT;;;;
+21B4;RIGHTWARDS ARROW WITH CORNER DOWNWARDS;So;0;ON;;;;;N;RIGHT ARROW WITH CORNER DOWN;;;;
+21B5;DOWNWARDS ARROW WITH CORNER LEFTWARDS;So;0;ON;;;;;N;DOWN ARROW WITH CORNER LEFT;;;;
+21B6;ANTICLOCKWISE TOP SEMICIRCLE ARROW;So;0;ON;;;;;N;;;;;
+21B7;CLOCKWISE TOP SEMICIRCLE ARROW;So;0;ON;;;;;N;;;;;
+21B8;NORTH WEST ARROW TO LONG BAR;So;0;ON;;;;;N;UPPER LEFT ARROW TO LONG BAR;;;;
+21B9;LEFTWARDS ARROW TO BAR OVER RIGHTWARDS ARROW TO BAR;So;0;ON;;;;;N;LEFT ARROW TO BAR OVER RIGHT ARROW TO BAR;;;;
+21BA;ANTICLOCKWISE OPEN CIRCLE ARROW;So;0;ON;;;;;N;;;;;
+21BB;CLOCKWISE OPEN CIRCLE ARROW;So;0;ON;;;;;N;;;;;
+21BC;LEFTWARDS HARPOON WITH BARB UPWARDS;So;0;ON;;;;;N;LEFT HARPOON WITH BARB UP;;;;
+21BD;LEFTWARDS HARPOON WITH BARB DOWNWARDS;So;0;ON;;;;;N;LEFT HARPOON WITH BARB DOWN;;;;
+21BE;UPWARDS HARPOON WITH BARB RIGHTWARDS;So;0;ON;;;;;N;UP HARPOON WITH BARB RIGHT;;;;
+21BF;UPWARDS HARPOON WITH BARB LEFTWARDS;So;0;ON;;;;;N;UP HARPOON WITH BARB LEFT;;;;
+21C0;RIGHTWARDS HARPOON WITH BARB UPWARDS;So;0;ON;;;;;N;RIGHT HARPOON WITH BARB UP;;;;
+21C1;RIGHTWARDS HARPOON WITH BARB DOWNWARDS;So;0;ON;;;;;N;RIGHT HARPOON WITH BARB DOWN;;;;
+21C2;DOWNWARDS HARPOON WITH BARB RIGHTWARDS;So;0;ON;;;;;N;DOWN HARPOON WITH BARB RIGHT;;;;
+21C3;DOWNWARDS HARPOON WITH BARB LEFTWARDS;So;0;ON;;;;;N;DOWN HARPOON WITH BARB LEFT;;;;
+21C4;RIGHTWARDS ARROW OVER LEFTWARDS ARROW;So;0;ON;;;;;N;RIGHT ARROW OVER LEFT ARROW;;;;
+21C5;UPWARDS ARROW LEFTWARDS OF DOWNWARDS ARROW;So;0;ON;;;;;N;UP ARROW LEFT OF DOWN ARROW;;;;
+21C6;LEFTWARDS ARROW OVER RIGHTWARDS ARROW;So;0;ON;;;;;N;LEFT ARROW OVER RIGHT ARROW;;;;
+21C7;LEFTWARDS PAIRED ARROWS;So;0;ON;;;;;N;LEFT PAIRED ARROWS;;;;
+21C8;UPWARDS PAIRED ARROWS;So;0;ON;;;;;N;UP PAIRED ARROWS;;;;
+21C9;RIGHTWARDS PAIRED ARROWS;So;0;ON;;;;;N;RIGHT PAIRED ARROWS;;;;
+21CA;DOWNWARDS PAIRED ARROWS;So;0;ON;;;;;N;DOWN PAIRED ARROWS;;;;
+21CB;LEFTWARDS HARPOON OVER RIGHTWARDS HARPOON;So;0;ON;;;;;N;LEFT HARPOON OVER RIGHT HARPOON;;;;
+21CC;RIGHTWARDS HARPOON OVER LEFTWARDS HARPOON;So;0;ON;;;;;N;RIGHT HARPOON OVER LEFT HARPOON;;;;
+21CD;LEFTWARDS DOUBLE ARROW WITH STROKE;So;0;ON;21D0 0338;;;;N;LEFT DOUBLE ARROW WITH STROKE;;;;
+21CE;LEFT RIGHT DOUBLE ARROW WITH STROKE;Sm;0;ON;21D4 0338;;;;N;;;;;
+21CF;RIGHTWARDS DOUBLE ARROW WITH STROKE;Sm;0;ON;21D2 0338;;;;N;RIGHT DOUBLE ARROW WITH STROKE;;;;
+21D0;LEFTWARDS DOUBLE ARROW;So;0;ON;;;;;N;LEFT DOUBLE ARROW;;;;
+21D1;UPWARDS DOUBLE ARROW;So;0;ON;;;;;N;UP DOUBLE ARROW;;;;
+21D2;RIGHTWARDS DOUBLE ARROW;Sm;0;ON;;;;;N;RIGHT DOUBLE ARROW;;;;
+21D3;DOWNWARDS DOUBLE ARROW;So;0;ON;;;;;N;DOWN DOUBLE ARROW;;;;
+21D4;LEFT RIGHT DOUBLE ARROW;Sm;0;ON;;;;;N;;;;;
+21D5;UP DOWN DOUBLE ARROW;So;0;ON;;;;;N;;;;;
+21D6;NORTH WEST DOUBLE ARROW;So;0;ON;;;;;N;UPPER LEFT DOUBLE ARROW;;;;
+21D7;NORTH EAST DOUBLE ARROW;So;0;ON;;;;;N;UPPER RIGHT DOUBLE ARROW;;;;
+21D8;SOUTH EAST DOUBLE ARROW;So;0;ON;;;;;N;LOWER RIGHT DOUBLE ARROW;;;;
+21D9;SOUTH WEST DOUBLE ARROW;So;0;ON;;;;;N;LOWER LEFT DOUBLE ARROW;;;;
+21DA;LEFTWARDS TRIPLE ARROW;So;0;ON;;;;;N;LEFT TRIPLE ARROW;;;;
+21DB;RIGHTWARDS TRIPLE ARROW;So;0;ON;;;;;N;RIGHT TRIPLE ARROW;;;;
+21DC;LEFTWARDS SQUIGGLE ARROW;So;0;ON;;;;;N;LEFT SQUIGGLE ARROW;;;;
+21DD;RIGHTWARDS SQUIGGLE ARROW;So;0;ON;;;;;N;RIGHT SQUIGGLE ARROW;;;;
+21DE;UPWARDS ARROW WITH DOUBLE STROKE;So;0;ON;;;;;N;UP ARROW WITH DOUBLE STROKE;;;;
+21DF;DOWNWARDS ARROW WITH DOUBLE STROKE;So;0;ON;;;;;N;DOWN ARROW WITH DOUBLE STROKE;;;;
+21E0;LEFTWARDS DASHED ARROW;So;0;ON;;;;;N;LEFT DASHED ARROW;;;;
+21E1;UPWARDS DASHED ARROW;So;0;ON;;;;;N;UP DASHED ARROW;;;;
+21E2;RIGHTWARDS DASHED ARROW;So;0;ON;;;;;N;RIGHT DASHED ARROW;;;;
+21E3;DOWNWARDS DASHED ARROW;So;0;ON;;;;;N;DOWN DASHED ARROW;;;;
+21E4;LEFTWARDS ARROW TO BAR;So;0;ON;;;;;N;LEFT ARROW TO BAR;;;;
+21E5;RIGHTWARDS ARROW TO BAR;So;0;ON;;;;;N;RIGHT ARROW TO BAR;;;;
+21E6;LEFTWARDS WHITE ARROW;So;0;ON;;;;;N;WHITE LEFT ARROW;;;;
+21E7;UPWARDS WHITE ARROW;So;0;ON;;;;;N;WHITE UP ARROW;;;;
+21E8;RIGHTWARDS WHITE ARROW;So;0;ON;;;;;N;WHITE RIGHT ARROW;;;;
+21E9;DOWNWARDS WHITE ARROW;So;0;ON;;;;;N;WHITE DOWN ARROW;;;;
+21EA;UPWARDS WHITE ARROW FROM BAR;So;0;ON;;;;;N;WHITE UP ARROW FROM BAR;;;;
+21EB;UPWARDS WHITE ARROW ON PEDESTAL;So;0;ON;;;;;N;;;;;
+21EC;UPWARDS WHITE ARROW ON PEDESTAL WITH HORIZONTAL BAR;So;0;ON;;;;;N;;;;;
+21ED;UPWARDS WHITE ARROW ON PEDESTAL WITH VERTICAL BAR;So;0;ON;;;;;N;;;;;
+21EE;UPWARDS WHITE DOUBLE ARROW;So;0;ON;;;;;N;;;;;
+21EF;UPWARDS WHITE DOUBLE ARROW ON PEDESTAL;So;0;ON;;;;;N;;;;;
+21F0;RIGHTWARDS WHITE ARROW FROM WALL;So;0;ON;;;;;N;;;;;
+21F1;NORTH WEST ARROW TO CORNER;So;0;ON;;;;;N;;;;;
+21F2;SOUTH EAST ARROW TO CORNER;So;0;ON;;;;;N;;;;;
+21F3;UP DOWN WHITE ARROW;So;0;ON;;;;;N;;;;;
+21F4;RIGHT ARROW WITH SMALL CIRCLE;Sm;0;ON;;;;;N;;;;;
+21F5;DOWNWARDS ARROW LEFTWARDS OF UPWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+21F6;THREE RIGHTWARDS ARROWS;Sm;0;ON;;;;;N;;;;;
+21F7;LEFTWARDS ARROW WITH VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+21F8;RIGHTWARDS ARROW WITH VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+21F9;LEFT RIGHT ARROW WITH VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+21FA;LEFTWARDS ARROW WITH DOUBLE VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+21FB;RIGHTWARDS ARROW WITH DOUBLE VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+21FC;LEFT RIGHT ARROW WITH DOUBLE VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+21FD;LEFTWARDS OPEN-HEADED ARROW;Sm;0;ON;;;;;N;;;;;
+21FE;RIGHTWARDS OPEN-HEADED ARROW;Sm;0;ON;;;;;N;;;;;
+21FF;LEFT RIGHT OPEN-HEADED ARROW;Sm;0;ON;;;;;N;;;;;
+2200;FOR ALL;Sm;0;ON;;;;;N;;;;;
+2201;COMPLEMENT;Sm;0;ON;;;;;Y;;;;;
+2202;PARTIAL DIFFERENTIAL;Sm;0;ON;;;;;Y;;;;;
+2203;THERE EXISTS;Sm;0;ON;;;;;Y;;;;;
+2204;THERE DOES NOT EXIST;Sm;0;ON;2203 0338;;;;Y;;;;;
+2205;EMPTY SET;Sm;0;ON;;;;;N;;;;;
+2206;INCREMENT;Sm;0;ON;;;;;N;;;;;
+2207;NABLA;Sm;0;ON;;;;;N;;;;;
+2208;ELEMENT OF;Sm;0;ON;;;;;Y;;;;;
+2209;NOT AN ELEMENT OF;Sm;0;ON;2208 0338;;;;Y;;;;;
+220A;SMALL ELEMENT OF;Sm;0;ON;;;;;Y;;;;;
+220B;CONTAINS AS MEMBER;Sm;0;ON;;;;;Y;;;;;
+220C;DOES NOT CONTAIN AS MEMBER;Sm;0;ON;220B 0338;;;;Y;;;;;
+220D;SMALL CONTAINS AS MEMBER;Sm;0;ON;;;;;Y;;;;;
+220E;END OF PROOF;Sm;0;ON;;;;;N;;;;;
+220F;N-ARY PRODUCT;Sm;0;ON;;;;;N;;;;;
+2210;N-ARY COPRODUCT;Sm;0;ON;;;;;N;;;;;
+2211;N-ARY SUMMATION;Sm;0;ON;;;;;Y;;;;;
+2212;MINUS SIGN;Sm;0;ES;;;;;N;;;;;
+2213;MINUS-OR-PLUS SIGN;Sm;0;ET;;;;;N;;;;;
+2214;DOT PLUS;Sm;0;ON;;;;;N;;;;;
+2215;DIVISION SLASH;Sm;0;ON;;;;;Y;;;;;
+2216;SET MINUS;Sm;0;ON;;;;;Y;;;;;
+2217;ASTERISK OPERATOR;Sm;0;ON;;;;;N;;;;;
+2218;RING OPERATOR;Sm;0;ON;;;;;N;;;;;
+2219;BULLET OPERATOR;Sm;0;ON;;;;;N;;;;;
+221A;SQUARE ROOT;Sm;0;ON;;;;;Y;;;;;
+221B;CUBE ROOT;Sm;0;ON;;;;;Y;;;;;
+221C;FOURTH ROOT;Sm;0;ON;;;;;Y;;;;;
+221D;PROPORTIONAL TO;Sm;0;ON;;;;;Y;;;;;
+221E;INFINITY;Sm;0;ON;;;;;N;;;;;
+221F;RIGHT ANGLE;Sm;0;ON;;;;;Y;;;;;
+2220;ANGLE;Sm;0;ON;;;;;Y;;;;;
+2221;MEASURED ANGLE;Sm;0;ON;;;;;Y;;;;;
+2222;SPHERICAL ANGLE;Sm;0;ON;;;;;Y;;;;;
+2223;DIVIDES;Sm;0;ON;;;;;N;;;;;
+2224;DOES NOT DIVIDE;Sm;0;ON;2223 0338;;;;Y;;;;;
+2225;PARALLEL TO;Sm;0;ON;;;;;N;;;;;
+2226;NOT PARALLEL TO;Sm;0;ON;2225 0338;;;;Y;;;;;
+2227;LOGICAL AND;Sm;0;ON;;;;;N;;;;;
+2228;LOGICAL OR;Sm;0;ON;;;;;N;;;;;
+2229;INTERSECTION;Sm;0;ON;;;;;N;;;;;
+222A;UNION;Sm;0;ON;;;;;N;;;;;
+222B;INTEGRAL;Sm;0;ON;;;;;Y;;;;;
+222C;DOUBLE INTEGRAL;Sm;0;ON;<compat> 222B 222B;;;;Y;;;;;
+222D;TRIPLE INTEGRAL;Sm;0;ON;<compat> 222B 222B 222B;;;;Y;;;;;
+222E;CONTOUR INTEGRAL;Sm;0;ON;;;;;Y;;;;;
+222F;SURFACE INTEGRAL;Sm;0;ON;<compat> 222E 222E;;;;Y;;;;;
+2230;VOLUME INTEGRAL;Sm;0;ON;<compat> 222E 222E 222E;;;;Y;;;;;
+2231;CLOCKWISE INTEGRAL;Sm;0;ON;;;;;Y;;;;;
+2232;CLOCKWISE CONTOUR INTEGRAL;Sm;0;ON;;;;;Y;;;;;
+2233;ANTICLOCKWISE CONTOUR INTEGRAL;Sm;0;ON;;;;;Y;;;;;
+2234;THEREFORE;Sm;0;ON;;;;;N;;;;;
+2235;BECAUSE;Sm;0;ON;;;;;N;;;;;
+2236;RATIO;Sm;0;ON;;;;;N;;;;;
+2237;PROPORTION;Sm;0;ON;;;;;N;;;;;
+2238;DOT MINUS;Sm;0;ON;;;;;N;;;;;
+2239;EXCESS;Sm;0;ON;;;;;Y;;;;;
+223A;GEOMETRIC PROPORTION;Sm;0;ON;;;;;N;;;;;
+223B;HOMOTHETIC;Sm;0;ON;;;;;Y;;;;;
+223C;TILDE OPERATOR;Sm;0;ON;;;;;Y;;;;;
+223D;REVERSED TILDE;Sm;0;ON;;;;;Y;;;;;
+223E;INVERTED LAZY S;Sm;0;ON;;;;;Y;;;;;
+223F;SINE WAVE;Sm;0;ON;;;;;Y;;;;;
+2240;WREATH PRODUCT;Sm;0;ON;;;;;Y;;;;;
+2241;NOT TILDE;Sm;0;ON;223C 0338;;;;Y;;;;;
+2242;MINUS TILDE;Sm;0;ON;;;;;Y;;;;;
+2243;ASYMPTOTICALLY EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2244;NOT ASYMPTOTICALLY EQUAL TO;Sm;0;ON;2243 0338;;;;Y;;;;;
+2245;APPROXIMATELY EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2246;APPROXIMATELY BUT NOT ACTUALLY EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2247;NEITHER APPROXIMATELY NOR ACTUALLY EQUAL TO;Sm;0;ON;2245 0338;;;;Y;;;;;
+2248;ALMOST EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2249;NOT ALMOST EQUAL TO;Sm;0;ON;2248 0338;;;;Y;;;;;
+224A;ALMOST EQUAL OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+224B;TRIPLE TILDE;Sm;0;ON;;;;;Y;;;;;
+224C;ALL EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+224D;EQUIVALENT TO;Sm;0;ON;;;;;N;;;;;
+224E;GEOMETRICALLY EQUIVALENT TO;Sm;0;ON;;;;;N;;;;;
+224F;DIFFERENCE BETWEEN;Sm;0;ON;;;;;N;;;;;
+2250;APPROACHES THE LIMIT;Sm;0;ON;;;;;N;;;;;
+2251;GEOMETRICALLY EQUAL TO;Sm;0;ON;;;;;N;;;;;
+2252;APPROXIMATELY EQUAL TO OR THE IMAGE OF;Sm;0;ON;;;;;Y;;;;;
+2253;IMAGE OF OR APPROXIMATELY EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2254;COLON EQUALS;Sm;0;ON;;;;;Y;COLON EQUAL;;;;
+2255;EQUALS COLON;Sm;0;ON;;;;;Y;EQUAL COLON;;;;
+2256;RING IN EQUAL TO;Sm;0;ON;;;;;N;;;;;
+2257;RING EQUAL TO;Sm;0;ON;;;;;N;;;;;
+2258;CORRESPONDS TO;Sm;0;ON;;;;;N;;;;;
+2259;ESTIMATES;Sm;0;ON;;;;;N;;;;;
+225A;EQUIANGULAR TO;Sm;0;ON;;;;;N;;;;;
+225B;STAR EQUALS;Sm;0;ON;;;;;N;;;;;
+225C;DELTA EQUAL TO;Sm;0;ON;;;;;N;;;;;
+225D;EQUAL TO BY DEFINITION;Sm;0;ON;;;;;N;;;;;
+225E;MEASURED BY;Sm;0;ON;;;;;N;;;;;
+225F;QUESTIONED EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2260;NOT EQUAL TO;Sm;0;ON;003D 0338;;;;Y;;;;;
+2261;IDENTICAL TO;Sm;0;ON;;;;;N;;;;;
+2262;NOT IDENTICAL TO;Sm;0;ON;2261 0338;;;;Y;;;;;
+2263;STRICTLY EQUIVALENT TO;Sm;0;ON;;;;;N;;;;;
+2264;LESS-THAN OR EQUAL TO;Sm;0;ON;;;;;Y;LESS THAN OR EQUAL TO;;;;
+2265;GREATER-THAN OR EQUAL TO;Sm;0;ON;;;;;Y;GREATER THAN OR EQUAL TO;;;;
+2266;LESS-THAN OVER EQUAL TO;Sm;0;ON;;;;;Y;LESS THAN OVER EQUAL TO;;;;
+2267;GREATER-THAN OVER EQUAL TO;Sm;0;ON;;;;;Y;GREATER THAN OVER EQUAL TO;;;;
+2268;LESS-THAN BUT NOT EQUAL TO;Sm;0;ON;;;;;Y;LESS THAN BUT NOT EQUAL TO;;;;
+2269;GREATER-THAN BUT NOT EQUAL TO;Sm;0;ON;;;;;Y;GREATER THAN BUT NOT EQUAL TO;;;;
+226A;MUCH LESS-THAN;Sm;0;ON;;;;;Y;MUCH LESS THAN;;;;
+226B;MUCH GREATER-THAN;Sm;0;ON;;;;;Y;MUCH GREATER THAN;;;;
+226C;BETWEEN;Sm;0;ON;;;;;N;;;;;
+226D;NOT EQUIVALENT TO;Sm;0;ON;224D 0338;;;;N;;;;;
+226E;NOT LESS-THAN;Sm;0;ON;003C 0338;;;;Y;NOT LESS THAN;;;;
+226F;NOT GREATER-THAN;Sm;0;ON;003E 0338;;;;Y;NOT GREATER THAN;;;;
+2270;NEITHER LESS-THAN NOR EQUAL TO;Sm;0;ON;2264 0338;;;;Y;NEITHER LESS THAN NOR EQUAL TO;;;;
+2271;NEITHER GREATER-THAN NOR EQUAL TO;Sm;0;ON;2265 0338;;;;Y;NEITHER GREATER THAN NOR EQUAL TO;;;;
+2272;LESS-THAN OR EQUIVALENT TO;Sm;0;ON;;;;;Y;LESS THAN OR EQUIVALENT TO;;;;
+2273;GREATER-THAN OR EQUIVALENT TO;Sm;0;ON;;;;;Y;GREATER THAN OR EQUIVALENT TO;;;;
+2274;NEITHER LESS-THAN NOR EQUIVALENT TO;Sm;0;ON;2272 0338;;;;Y;NEITHER LESS THAN NOR EQUIVALENT TO;;;;
+2275;NEITHER GREATER-THAN NOR EQUIVALENT TO;Sm;0;ON;2273 0338;;;;Y;NEITHER GREATER THAN NOR EQUIVALENT TO;;;;
+2276;LESS-THAN OR GREATER-THAN;Sm;0;ON;;;;;Y;LESS THAN OR GREATER THAN;;;;
+2277;GREATER-THAN OR LESS-THAN;Sm;0;ON;;;;;Y;GREATER THAN OR LESS THAN;;;;
+2278;NEITHER LESS-THAN NOR GREATER-THAN;Sm;0;ON;2276 0338;;;;Y;NEITHER LESS THAN NOR GREATER THAN;;;;
+2279;NEITHER GREATER-THAN NOR LESS-THAN;Sm;0;ON;2277 0338;;;;Y;NEITHER GREATER THAN NOR LESS THAN;;;;
+227A;PRECEDES;Sm;0;ON;;;;;Y;;;;;
+227B;SUCCEEDS;Sm;0;ON;;;;;Y;;;;;
+227C;PRECEDES OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+227D;SUCCEEDS OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+227E;PRECEDES OR EQUIVALENT TO;Sm;0;ON;;;;;Y;;;;;
+227F;SUCCEEDS OR EQUIVALENT TO;Sm;0;ON;;;;;Y;;;;;
+2280;DOES NOT PRECEDE;Sm;0;ON;227A 0338;;;;Y;;;;;
+2281;DOES NOT SUCCEED;Sm;0;ON;227B 0338;;;;Y;;;;;
+2282;SUBSET OF;Sm;0;ON;;;;;Y;;;;;
+2283;SUPERSET OF;Sm;0;ON;;;;;Y;;;;;
+2284;NOT A SUBSET OF;Sm;0;ON;2282 0338;;;;Y;;;;;
+2285;NOT A SUPERSET OF;Sm;0;ON;2283 0338;;;;Y;;;;;
+2286;SUBSET OF OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2287;SUPERSET OF OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2288;NEITHER A SUBSET OF NOR EQUAL TO;Sm;0;ON;2286 0338;;;;Y;;;;;
+2289;NEITHER A SUPERSET OF NOR EQUAL TO;Sm;0;ON;2287 0338;;;;Y;;;;;
+228A;SUBSET OF WITH NOT EQUAL TO;Sm;0;ON;;;;;Y;SUBSET OF OR NOT EQUAL TO;;;;
+228B;SUPERSET OF WITH NOT EQUAL TO;Sm;0;ON;;;;;Y;SUPERSET OF OR NOT EQUAL TO;;;;
+228C;MULTISET;Sm;0;ON;;;;;Y;;;;;
+228D;MULTISET MULTIPLICATION;Sm;0;ON;;;;;N;;;;;
+228E;MULTISET UNION;Sm;0;ON;;;;;N;;;;;
+228F;SQUARE IMAGE OF;Sm;0;ON;;;;;Y;;;;;
+2290;SQUARE ORIGINAL OF;Sm;0;ON;;;;;Y;;;;;
+2291;SQUARE IMAGE OF OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2292;SQUARE ORIGINAL OF OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2293;SQUARE CAP;Sm;0;ON;;;;;N;;;;;
+2294;SQUARE CUP;Sm;0;ON;;;;;N;;;;;
+2295;CIRCLED PLUS;Sm;0;ON;;;;;N;;;;;
+2296;CIRCLED MINUS;Sm;0;ON;;;;;N;;;;;
+2297;CIRCLED TIMES;Sm;0;ON;;;;;N;;;;;
+2298;CIRCLED DIVISION SLASH;Sm;0;ON;;;;;Y;;;;;
+2299;CIRCLED DOT OPERATOR;Sm;0;ON;;;;;N;;;;;
+229A;CIRCLED RING OPERATOR;Sm;0;ON;;;;;N;;;;;
+229B;CIRCLED ASTERISK OPERATOR;Sm;0;ON;;;;;N;;;;;
+229C;CIRCLED EQUALS;Sm;0;ON;;;;;N;;;;;
+229D;CIRCLED DASH;Sm;0;ON;;;;;N;;;;;
+229E;SQUARED PLUS;Sm;0;ON;;;;;N;;;;;
+229F;SQUARED MINUS;Sm;0;ON;;;;;N;;;;;
+22A0;SQUARED TIMES;Sm;0;ON;;;;;N;;;;;
+22A1;SQUARED DOT OPERATOR;Sm;0;ON;;;;;N;;;;;
+22A2;RIGHT TACK;Sm;0;ON;;;;;Y;;;;;
+22A3;LEFT TACK;Sm;0;ON;;;;;Y;;;;;
+22A4;DOWN TACK;Sm;0;ON;;;;;N;;;;;
+22A5;UP TACK;Sm;0;ON;;;;;N;;;;;
+22A6;ASSERTION;Sm;0;ON;;;;;Y;;;;;
+22A7;MODELS;Sm;0;ON;;;;;Y;;;;;
+22A8;TRUE;Sm;0;ON;;;;;Y;;;;;
+22A9;FORCES;Sm;0;ON;;;;;Y;;;;;
+22AA;TRIPLE VERTICAL BAR RIGHT TURNSTILE;Sm;0;ON;;;;;Y;;;;;
+22AB;DOUBLE VERTICAL BAR DOUBLE RIGHT TURNSTILE;Sm;0;ON;;;;;Y;;;;;
+22AC;DOES NOT PROVE;Sm;0;ON;22A2 0338;;;;Y;;;;;
+22AD;NOT TRUE;Sm;0;ON;22A8 0338;;;;Y;;;;;
+22AE;DOES NOT FORCE;Sm;0;ON;22A9 0338;;;;Y;;;;;
+22AF;NEGATED DOUBLE VERTICAL BAR DOUBLE RIGHT TURNSTILE;Sm;0;ON;22AB 0338;;;;Y;;;;;
+22B0;PRECEDES UNDER RELATION;Sm;0;ON;;;;;Y;;;;;
+22B1;SUCCEEDS UNDER RELATION;Sm;0;ON;;;;;Y;;;;;
+22B2;NORMAL SUBGROUP OF;Sm;0;ON;;;;;Y;;;;;
+22B3;CONTAINS AS NORMAL SUBGROUP;Sm;0;ON;;;;;Y;;;;;
+22B4;NORMAL SUBGROUP OF OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+22B5;CONTAINS AS NORMAL SUBGROUP OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+22B6;ORIGINAL OF;Sm;0;ON;;;;;Y;;;;;
+22B7;IMAGE OF;Sm;0;ON;;;;;Y;;;;;
+22B8;MULTIMAP;Sm;0;ON;;;;;Y;;;;;
+22B9;HERMITIAN CONJUGATE MATRIX;Sm;0;ON;;;;;N;;;;;
+22BA;INTERCALATE;Sm;0;ON;;;;;N;;;;;
+22BB;XOR;Sm;0;ON;;;;;N;;;;;
+22BC;NAND;Sm;0;ON;;;;;N;;;;;
+22BD;NOR;Sm;0;ON;;;;;N;;;;;
+22BE;RIGHT ANGLE WITH ARC;Sm;0;ON;;;;;Y;;;;;
+22BF;RIGHT TRIANGLE;Sm;0;ON;;;;;Y;;;;;
+22C0;N-ARY LOGICAL AND;Sm;0;ON;;;;;N;;;;;
+22C1;N-ARY LOGICAL OR;Sm;0;ON;;;;;N;;;;;
+22C2;N-ARY INTERSECTION;Sm;0;ON;;;;;N;;;;;
+22C3;N-ARY UNION;Sm;0;ON;;;;;N;;;;;
+22C4;DIAMOND OPERATOR;Sm;0;ON;;;;;N;;;;;
+22C5;DOT OPERATOR;Sm;0;ON;;;;;N;;;;;
+22C6;STAR OPERATOR;Sm;0;ON;;;;;N;;;;;
+22C7;DIVISION TIMES;Sm;0;ON;;;;;N;;;;;
+22C8;BOWTIE;Sm;0;ON;;;;;N;;;;;
+22C9;LEFT NORMAL FACTOR SEMIDIRECT PRODUCT;Sm;0;ON;;;;;Y;;;;;
+22CA;RIGHT NORMAL FACTOR SEMIDIRECT PRODUCT;Sm;0;ON;;;;;Y;;;;;
+22CB;LEFT SEMIDIRECT PRODUCT;Sm;0;ON;;;;;Y;;;;;
+22CC;RIGHT SEMIDIRECT PRODUCT;Sm;0;ON;;;;;Y;;;;;
+22CD;REVERSED TILDE EQUALS;Sm;0;ON;;;;;Y;;;;;
+22CE;CURLY LOGICAL OR;Sm;0;ON;;;;;N;;;;;
+22CF;CURLY LOGICAL AND;Sm;0;ON;;;;;N;;;;;
+22D0;DOUBLE SUBSET;Sm;0;ON;;;;;Y;;;;;
+22D1;DOUBLE SUPERSET;Sm;0;ON;;;;;Y;;;;;
+22D2;DOUBLE INTERSECTION;Sm;0;ON;;;;;N;;;;;
+22D3;DOUBLE UNION;Sm;0;ON;;;;;N;;;;;
+22D4;PITCHFORK;Sm;0;ON;;;;;N;;;;;
+22D5;EQUAL AND PARALLEL TO;Sm;0;ON;;;;;N;;;;;
+22D6;LESS-THAN WITH DOT;Sm;0;ON;;;;;Y;LESS THAN WITH DOT;;;;
+22D7;GREATER-THAN WITH DOT;Sm;0;ON;;;;;Y;GREATER THAN WITH DOT;;;;
+22D8;VERY MUCH LESS-THAN;Sm;0;ON;;;;;Y;VERY MUCH LESS THAN;;;;
+22D9;VERY MUCH GREATER-THAN;Sm;0;ON;;;;;Y;VERY MUCH GREATER THAN;;;;
+22DA;LESS-THAN EQUAL TO OR GREATER-THAN;Sm;0;ON;;;;;Y;LESS THAN EQUAL TO OR GREATER THAN;;;;
+22DB;GREATER-THAN EQUAL TO OR LESS-THAN;Sm;0;ON;;;;;Y;GREATER THAN EQUAL TO OR LESS THAN;;;;
+22DC;EQUAL TO OR LESS-THAN;Sm;0;ON;;;;;Y;EQUAL TO OR LESS THAN;;;;
+22DD;EQUAL TO OR GREATER-THAN;Sm;0;ON;;;;;Y;EQUAL TO OR GREATER THAN;;;;
+22DE;EQUAL TO OR PRECEDES;Sm;0;ON;;;;;Y;;;;;
+22DF;EQUAL TO OR SUCCEEDS;Sm;0;ON;;;;;Y;;;;;
+22E0;DOES NOT PRECEDE OR EQUAL;Sm;0;ON;227C 0338;;;;Y;;;;;
+22E1;DOES NOT SUCCEED OR EQUAL;Sm;0;ON;227D 0338;;;;Y;;;;;
+22E2;NOT SQUARE IMAGE OF OR EQUAL TO;Sm;0;ON;2291 0338;;;;Y;;;;;
+22E3;NOT SQUARE ORIGINAL OF OR EQUAL TO;Sm;0;ON;2292 0338;;;;Y;;;;;
+22E4;SQUARE IMAGE OF OR NOT EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+22E5;SQUARE ORIGINAL OF OR NOT EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+22E6;LESS-THAN BUT NOT EQUIVALENT TO;Sm;0;ON;;;;;Y;LESS THAN BUT NOT EQUIVALENT TO;;;;
+22E7;GREATER-THAN BUT NOT EQUIVALENT TO;Sm;0;ON;;;;;Y;GREATER THAN BUT NOT EQUIVALENT TO;;;;
+22E8;PRECEDES BUT NOT EQUIVALENT TO;Sm;0;ON;;;;;Y;;;;;
+22E9;SUCCEEDS BUT NOT EQUIVALENT TO;Sm;0;ON;;;;;Y;;;;;
+22EA;NOT NORMAL SUBGROUP OF;Sm;0;ON;22B2 0338;;;;Y;;;;;
+22EB;DOES NOT CONTAIN AS NORMAL SUBGROUP;Sm;0;ON;22B3 0338;;;;Y;;;;;
+22EC;NOT NORMAL SUBGROUP OF OR EQUAL TO;Sm;0;ON;22B4 0338;;;;Y;;;;;
+22ED;DOES NOT CONTAIN AS NORMAL SUBGROUP OR EQUAL;Sm;0;ON;22B5 0338;;;;Y;;;;;
+22EE;VERTICAL ELLIPSIS;Sm;0;ON;;;;;N;;;;;
+22EF;MIDLINE HORIZONTAL ELLIPSIS;Sm;0;ON;;;;;N;;;;;
+22F0;UP RIGHT DIAGONAL ELLIPSIS;Sm;0;ON;;;;;Y;;;;;
+22F1;DOWN RIGHT DIAGONAL ELLIPSIS;Sm;0;ON;;;;;Y;;;;;
+22F2;ELEMENT OF WITH LONG HORIZONTAL STROKE;Sm;0;ON;;;;;Y;;;;;
+22F3;ELEMENT OF WITH VERTICAL BAR AT END OF HORIZONTAL STROKE;Sm;0;ON;;;;;Y;;;;;
+22F4;SMALL ELEMENT OF WITH VERTICAL BAR AT END OF HORIZONTAL STROKE;Sm;0;ON;;;;;Y;;;;;
+22F5;ELEMENT OF WITH DOT ABOVE;Sm;0;ON;;;;;Y;;;;;
+22F6;ELEMENT OF WITH OVERBAR;Sm;0;ON;;;;;Y;;;;;
+22F7;SMALL ELEMENT OF WITH OVERBAR;Sm;0;ON;;;;;Y;;;;;
+22F8;ELEMENT OF WITH UNDERBAR;Sm;0;ON;;;;;Y;;;;;
+22F9;ELEMENT OF WITH TWO HORIZONTAL STROKES;Sm;0;ON;;;;;Y;;;;;
+22FA;CONTAINS WITH LONG HORIZONTAL STROKE;Sm;0;ON;;;;;Y;;;;;
+22FB;CONTAINS WITH VERTICAL BAR AT END OF HORIZONTAL STROKE;Sm;0;ON;;;;;Y;;;;;
+22FC;SMALL CONTAINS WITH VERTICAL BAR AT END OF HORIZONTAL STROKE;Sm;0;ON;;;;;Y;;;;;
+22FD;CONTAINS WITH OVERBAR;Sm;0;ON;;;;;Y;;;;;
+22FE;SMALL CONTAINS WITH OVERBAR;Sm;0;ON;;;;;Y;;;;;
+22FF;Z NOTATION BAG MEMBERSHIP;Sm;0;ON;;;;;Y;;;;;
+2300;DIAMETER SIGN;So;0;ON;;;;;N;;;;;
+2301;ELECTRIC ARROW;So;0;ON;;;;;N;;;;;
+2302;HOUSE;So;0;ON;;;;;N;;;;;
+2303;UP ARROWHEAD;So;0;ON;;;;;N;;;;;
+2304;DOWN ARROWHEAD;So;0;ON;;;;;N;;;;;
+2305;PROJECTIVE;So;0;ON;;;;;N;;;;;
+2306;PERSPECTIVE;So;0;ON;;;;;N;;;;;
+2307;WAVY LINE;So;0;ON;;;;;N;;;;;
+2308;LEFT CEILING;Ps;0;ON;;;;;Y;;;;;
+2309;RIGHT CEILING;Pe;0;ON;;;;;Y;;;;;
+230A;LEFT FLOOR;Ps;0;ON;;;;;Y;;;;;
+230B;RIGHT FLOOR;Pe;0;ON;;;;;Y;;;;;
+230C;BOTTOM RIGHT CROP;So;0;ON;;;;;N;;;;;
+230D;BOTTOM LEFT CROP;So;0;ON;;;;;N;;;;;
+230E;TOP RIGHT CROP;So;0;ON;;;;;N;;;;;
+230F;TOP LEFT CROP;So;0;ON;;;;;N;;;;;
+2310;REVERSED NOT SIGN;So;0;ON;;;;;N;;;;;
+2311;SQUARE LOZENGE;So;0;ON;;;;;N;;;;;
+2312;ARC;So;0;ON;;;;;N;;;;;
+2313;SEGMENT;So;0;ON;;;;;N;;;;;
+2314;SECTOR;So;0;ON;;;;;N;;;;;
+2315;TELEPHONE RECORDER;So;0;ON;;;;;N;;;;;
+2316;POSITION INDICATOR;So;0;ON;;;;;N;;;;;
+2317;VIEWDATA SQUARE;So;0;ON;;;;;N;;;;;
+2318;PLACE OF INTEREST SIGN;So;0;ON;;;;;N;COMMAND KEY;;;;
+2319;TURNED NOT SIGN;So;0;ON;;;;;N;;;;;
+231A;WATCH;So;0;ON;;;;;N;;;;;
+231B;HOURGLASS;So;0;ON;;;;;N;;;;;
+231C;TOP LEFT CORNER;So;0;ON;;;;;N;;;;;
+231D;TOP RIGHT CORNER;So;0;ON;;;;;N;;;;;
+231E;BOTTOM LEFT CORNER;So;0;ON;;;;;N;;;;;
+231F;BOTTOM RIGHT CORNER;So;0;ON;;;;;N;;;;;
+2320;TOP HALF INTEGRAL;Sm;0;ON;;;;;Y;;;;;
+2321;BOTTOM HALF INTEGRAL;Sm;0;ON;;;;;Y;;;;;
+2322;FROWN;So;0;ON;;;;;N;;;;;
+2323;SMILE;So;0;ON;;;;;N;;;;;
+2324;UP ARROWHEAD BETWEEN TWO HORIZONTAL BARS;So;0;ON;;;;;N;ENTER KEY;;;;
+2325;OPTION KEY;So;0;ON;;;;;N;;;;;
+2326;ERASE TO THE RIGHT;So;0;ON;;;;;N;DELETE TO THE RIGHT KEY;;;;
+2327;X IN A RECTANGLE BOX;So;0;ON;;;;;N;CLEAR KEY;;;;
+2328;KEYBOARD;So;0;ON;;;;;N;;;;;
+2329;LEFT-POINTING ANGLE BRACKET;Ps;0;ON;3008;;;;Y;BRA;;;;
+232A;RIGHT-POINTING ANGLE BRACKET;Pe;0;ON;3009;;;;Y;KET;;;;
+232B;ERASE TO THE LEFT;So;0;ON;;;;;N;DELETE TO THE LEFT KEY;;;;
+232C;BENZENE RING;So;0;ON;;;;;N;;;;;
+232D;CYLINDRICITY;So;0;ON;;;;;N;;;;;
+232E;ALL AROUND-PROFILE;So;0;ON;;;;;N;;;;;
+232F;SYMMETRY;So;0;ON;;;;;N;;;;;
+2330;TOTAL RUNOUT;So;0;ON;;;;;N;;;;;
+2331;DIMENSION ORIGIN;So;0;ON;;;;;N;;;;;
+2332;CONICAL TAPER;So;0;ON;;;;;N;;;;;
+2333;SLOPE;So;0;ON;;;;;N;;;;;
+2334;COUNTERBORE;So;0;ON;;;;;N;;;;;
+2335;COUNTERSINK;So;0;ON;;;;;N;;;;;
+2336;APL FUNCTIONAL SYMBOL I-BEAM;So;0;L;;;;;N;;;;;
+2337;APL FUNCTIONAL SYMBOL SQUISH QUAD;So;0;L;;;;;N;;;;;
+2338;APL FUNCTIONAL SYMBOL QUAD EQUAL;So;0;L;;;;;N;;;;;
+2339;APL FUNCTIONAL SYMBOL QUAD DIVIDE;So;0;L;;;;;N;;;;;
+233A;APL FUNCTIONAL SYMBOL QUAD DIAMOND;So;0;L;;;;;N;;;;;
+233B;APL FUNCTIONAL SYMBOL QUAD JOT;So;0;L;;;;;N;;;;;
+233C;APL FUNCTIONAL SYMBOL QUAD CIRCLE;So;0;L;;;;;N;;;;;
+233D;APL FUNCTIONAL SYMBOL CIRCLE STILE;So;0;L;;;;;N;;;;;
+233E;APL FUNCTIONAL SYMBOL CIRCLE JOT;So;0;L;;;;;N;;;;;
+233F;APL FUNCTIONAL SYMBOL SLASH BAR;So;0;L;;;;;N;;;;;
+2340;APL FUNCTIONAL SYMBOL BACKSLASH BAR;So;0;L;;;;;N;;;;;
+2341;APL FUNCTIONAL SYMBOL QUAD SLASH;So;0;L;;;;;N;;;;;
+2342;APL FUNCTIONAL SYMBOL QUAD BACKSLASH;So;0;L;;;;;N;;;;;
+2343;APL FUNCTIONAL SYMBOL QUAD LESS-THAN;So;0;L;;;;;N;;;;;
+2344;APL FUNCTIONAL SYMBOL QUAD GREATER-THAN;So;0;L;;;;;N;;;;;
+2345;APL FUNCTIONAL SYMBOL LEFTWARDS VANE;So;0;L;;;;;N;;;;;
+2346;APL FUNCTIONAL SYMBOL RIGHTWARDS VANE;So;0;L;;;;;N;;;;;
+2347;APL FUNCTIONAL SYMBOL QUAD LEFTWARDS ARROW;So;0;L;;;;;N;;;;;
+2348;APL FUNCTIONAL SYMBOL QUAD RIGHTWARDS ARROW;So;0;L;;;;;N;;;;;
+2349;APL FUNCTIONAL SYMBOL CIRCLE BACKSLASH;So;0;L;;;;;N;;;;;
+234A;APL FUNCTIONAL SYMBOL DOWN TACK UNDERBAR;So;0;L;;;;;N;;;;;
+234B;APL FUNCTIONAL SYMBOL DELTA STILE;So;0;L;;;;;N;;;;;
+234C;APL FUNCTIONAL SYMBOL QUAD DOWN CARET;So;0;L;;;;;N;;;;;
+234D;APL FUNCTIONAL SYMBOL QUAD DELTA;So;0;L;;;;;N;;;;;
+234E;APL FUNCTIONAL SYMBOL DOWN TACK JOT;So;0;L;;;;;N;;;;;
+234F;APL FUNCTIONAL SYMBOL UPWARDS VANE;So;0;L;;;;;N;;;;;
+2350;APL FUNCTIONAL SYMBOL QUAD UPWARDS ARROW;So;0;L;;;;;N;;;;;
+2351;APL FUNCTIONAL SYMBOL UP TACK OVERBAR;So;0;L;;;;;N;;;;;
+2352;APL FUNCTIONAL SYMBOL DEL STILE;So;0;L;;;;;N;;;;;
+2353;APL FUNCTIONAL SYMBOL QUAD UP CARET;So;0;L;;;;;N;;;;;
+2354;APL FUNCTIONAL SYMBOL QUAD DEL;So;0;L;;;;;N;;;;;
+2355;APL FUNCTIONAL SYMBOL UP TACK JOT;So;0;L;;;;;N;;;;;
+2356;APL FUNCTIONAL SYMBOL DOWNWARDS VANE;So;0;L;;;;;N;;;;;
+2357;APL FUNCTIONAL SYMBOL QUAD DOWNWARDS ARROW;So;0;L;;;;;N;;;;;
+2358;APL FUNCTIONAL SYMBOL QUOTE UNDERBAR;So;0;L;;;;;N;;;;;
+2359;APL FUNCTIONAL SYMBOL DELTA UNDERBAR;So;0;L;;;;;N;;;;;
+235A;APL FUNCTIONAL SYMBOL DIAMOND UNDERBAR;So;0;L;;;;;N;;;;;
+235B;APL FUNCTIONAL SYMBOL JOT UNDERBAR;So;0;L;;;;;N;;;;;
+235C;APL FUNCTIONAL SYMBOL CIRCLE UNDERBAR;So;0;L;;;;;N;;;;;
+235D;APL FUNCTIONAL SYMBOL UP SHOE JOT;So;0;L;;;;;N;;;;;
+235E;APL FUNCTIONAL SYMBOL QUOTE QUAD;So;0;L;;;;;N;;;;;
+235F;APL FUNCTIONAL SYMBOL CIRCLE STAR;So;0;L;;;;;N;;;;;
+2360;APL FUNCTIONAL SYMBOL QUAD COLON;So;0;L;;;;;N;;;;;
+2361;APL FUNCTIONAL SYMBOL UP TACK DIAERESIS;So;0;L;;;;;N;;;;;
+2362;APL FUNCTIONAL SYMBOL DEL DIAERESIS;So;0;L;;;;;N;;;;;
+2363;APL FUNCTIONAL SYMBOL STAR DIAERESIS;So;0;L;;;;;N;;;;;
+2364;APL FUNCTIONAL SYMBOL JOT DIAERESIS;So;0;L;;;;;N;;;;;
+2365;APL FUNCTIONAL SYMBOL CIRCLE DIAERESIS;So;0;L;;;;;N;;;;;
+2366;APL FUNCTIONAL SYMBOL DOWN SHOE STILE;So;0;L;;;;;N;;;;;
+2367;APL FUNCTIONAL SYMBOL LEFT SHOE STILE;So;0;L;;;;;N;;;;;
+2368;APL FUNCTIONAL SYMBOL TILDE DIAERESIS;So;0;L;;;;;N;;;;;
+2369;APL FUNCTIONAL SYMBOL GREATER-THAN DIAERESIS;So;0;L;;;;;N;;;;;
+236A;APL FUNCTIONAL SYMBOL COMMA BAR;So;0;L;;;;;N;;;;;
+236B;APL FUNCTIONAL SYMBOL DEL TILDE;So;0;L;;;;;N;;;;;
+236C;APL FUNCTIONAL SYMBOL ZILDE;So;0;L;;;;;N;;;;;
+236D;APL FUNCTIONAL SYMBOL STILE TILDE;So;0;L;;;;;N;;;;;
+236E;APL FUNCTIONAL SYMBOL SEMICOLON UNDERBAR;So;0;L;;;;;N;;;;;
+236F;APL FUNCTIONAL SYMBOL QUAD NOT EQUAL;So;0;L;;;;;N;;;;;
+2370;APL FUNCTIONAL SYMBOL QUAD QUESTION;So;0;L;;;;;N;;;;;
+2371;APL FUNCTIONAL SYMBOL DOWN CARET TILDE;So;0;L;;;;;N;;;;;
+2372;APL FUNCTIONAL SYMBOL UP CARET TILDE;So;0;L;;;;;N;;;;;
+2373;APL FUNCTIONAL SYMBOL IOTA;So;0;L;;;;;N;;;;;
+2374;APL FUNCTIONAL SYMBOL RHO;So;0;L;;;;;N;;;;;
+2375;APL FUNCTIONAL SYMBOL OMEGA;So;0;L;;;;;N;;;;;
+2376;APL FUNCTIONAL SYMBOL ALPHA UNDERBAR;So;0;L;;;;;N;;;;;
+2377;APL FUNCTIONAL SYMBOL EPSILON UNDERBAR;So;0;L;;;;;N;;;;;
+2378;APL FUNCTIONAL SYMBOL IOTA UNDERBAR;So;0;L;;;;;N;;;;;
+2379;APL FUNCTIONAL SYMBOL OMEGA UNDERBAR;So;0;L;;;;;N;;;;;
+237A;APL FUNCTIONAL SYMBOL ALPHA;So;0;L;;;;;N;;;;;
+237B;NOT CHECK MARK;So;0;ON;;;;;N;;;;;
+237C;RIGHT ANGLE WITH DOWNWARDS ZIGZAG ARROW;Sm;0;ON;;;;;N;;;;;
+237D;SHOULDERED OPEN BOX;So;0;ON;;;;;N;;;;;
+237E;BELL SYMBOL;So;0;ON;;;;;N;;;;;
+237F;VERTICAL LINE WITH MIDDLE DOT;So;0;ON;;;;;N;;;;;
+2380;INSERTION SYMBOL;So;0;ON;;;;;N;;;;;
+2381;CONTINUOUS UNDERLINE SYMBOL;So;0;ON;;;;;N;;;;;
+2382;DISCONTINUOUS UNDERLINE SYMBOL;So;0;ON;;;;;N;;;;;
+2383;EMPHASIS SYMBOL;So;0;ON;;;;;N;;;;;
+2384;COMPOSITION SYMBOL;So;0;ON;;;;;N;;;;;
+2385;WHITE SQUARE WITH CENTRE VERTICAL LINE;So;0;ON;;;;;N;;;;;
+2386;ENTER SYMBOL;So;0;ON;;;;;N;;;;;
+2387;ALTERNATIVE KEY SYMBOL;So;0;ON;;;;;N;;;;;
+2388;HELM SYMBOL;So;0;ON;;;;;N;;;;;
+2389;CIRCLED HORIZONTAL BAR WITH NOTCH;So;0;ON;;;;;N;;;;;
+238A;CIRCLED TRIANGLE DOWN;So;0;ON;;;;;N;;;;;
+238B;BROKEN CIRCLE WITH NORTHWEST ARROW;So;0;ON;;;;;N;;;;;
+238C;UNDO SYMBOL;So;0;ON;;;;;N;;;;;
+238D;MONOSTABLE SYMBOL;So;0;ON;;;;;N;;;;;
+238E;HYSTERESIS SYMBOL;So;0;ON;;;;;N;;;;;
+238F;OPEN-CIRCUIT-OUTPUT H-TYPE SYMBOL;So;0;ON;;;;;N;;;;;
+2390;OPEN-CIRCUIT-OUTPUT L-TYPE SYMBOL;So;0;ON;;;;;N;;;;;
+2391;PASSIVE-PULL-DOWN-OUTPUT SYMBOL;So;0;ON;;;;;N;;;;;
+2392;PASSIVE-PULL-UP-OUTPUT SYMBOL;So;0;ON;;;;;N;;;;;
+2393;DIRECT CURRENT SYMBOL FORM TWO;So;0;ON;;;;;N;;;;;
+2394;SOFTWARE-FUNCTION SYMBOL;So;0;ON;;;;;N;;;;;
+2395;APL FUNCTIONAL SYMBOL QUAD;So;0;L;;;;;N;;;;;
+2396;DECIMAL SEPARATOR KEY SYMBOL;So;0;ON;;;;;N;;;;;
+2397;PREVIOUS PAGE;So;0;ON;;;;;N;;;;;
+2398;NEXT PAGE;So;0;ON;;;;;N;;;;;
+2399;PRINT SCREEN SYMBOL;So;0;ON;;;;;N;;;;;
+239A;CLEAR SCREEN SYMBOL;So;0;ON;;;;;N;;;;;
+239B;LEFT PARENTHESIS UPPER HOOK;Sm;0;ON;;;;;N;;;;;
+239C;LEFT PARENTHESIS EXTENSION;Sm;0;ON;;;;;N;;;;;
+239D;LEFT PARENTHESIS LOWER HOOK;Sm;0;ON;;;;;N;;;;;
+239E;RIGHT PARENTHESIS UPPER HOOK;Sm;0;ON;;;;;N;;;;;
+239F;RIGHT PARENTHESIS EXTENSION;Sm;0;ON;;;;;N;;;;;
+23A0;RIGHT PARENTHESIS LOWER HOOK;Sm;0;ON;;;;;N;;;;;
+23A1;LEFT SQUARE BRACKET UPPER CORNER;Sm;0;ON;;;;;N;;;;;
+23A2;LEFT SQUARE BRACKET EXTENSION;Sm;0;ON;;;;;N;;;;;
+23A3;LEFT SQUARE BRACKET LOWER CORNER;Sm;0;ON;;;;;N;;;;;
+23A4;RIGHT SQUARE BRACKET UPPER CORNER;Sm;0;ON;;;;;N;;;;;
+23A5;RIGHT SQUARE BRACKET EXTENSION;Sm;0;ON;;;;;N;;;;;
+23A6;RIGHT SQUARE BRACKET LOWER CORNER;Sm;0;ON;;;;;N;;;;;
+23A7;LEFT CURLY BRACKET UPPER HOOK;Sm;0;ON;;;;;N;;;;;
+23A8;LEFT CURLY BRACKET MIDDLE PIECE;Sm;0;ON;;;;;N;;;;;
+23A9;LEFT CURLY BRACKET LOWER HOOK;Sm;0;ON;;;;;N;;;;;
+23AA;CURLY BRACKET EXTENSION;Sm;0;ON;;;;;N;;;;;
+23AB;RIGHT CURLY BRACKET UPPER HOOK;Sm;0;ON;;;;;N;;;;;
+23AC;RIGHT CURLY BRACKET MIDDLE PIECE;Sm;0;ON;;;;;N;;;;;
+23AD;RIGHT CURLY BRACKET LOWER HOOK;Sm;0;ON;;;;;N;;;;;
+23AE;INTEGRAL EXTENSION;Sm;0;ON;;;;;N;;;;;
+23AF;HORIZONTAL LINE EXTENSION;Sm;0;ON;;;;;N;;;;;
+23B0;UPPER LEFT OR LOWER RIGHT CURLY BRACKET SECTION;Sm;0;ON;;;;;N;;;;;
+23B1;UPPER RIGHT OR LOWER LEFT CURLY BRACKET SECTION;Sm;0;ON;;;;;N;;;;;
+23B2;SUMMATION TOP;Sm;0;ON;;;;;N;;;;;
+23B3;SUMMATION BOTTOM;Sm;0;ON;;;;;N;;;;;
+23B4;TOP SQUARE BRACKET;So;0;ON;;;;;N;;;;;
+23B5;BOTTOM SQUARE BRACKET;So;0;ON;;;;;N;;;;;
+23B6;BOTTOM SQUARE BRACKET OVER TOP SQUARE BRACKET;So;0;ON;;;;;N;;;;;
+23B7;RADICAL SYMBOL BOTTOM;So;0;ON;;;;;N;;;;;
+23B8;LEFT VERTICAL BOX LINE;So;0;ON;;;;;N;;;;;
+23B9;RIGHT VERTICAL BOX LINE;So;0;ON;;;;;N;;;;;
+23BA;HORIZONTAL SCAN LINE-1;So;0;ON;;;;;N;;;;;
+23BB;HORIZONTAL SCAN LINE-3;So;0;ON;;;;;N;;;;;
+23BC;HORIZONTAL SCAN LINE-7;So;0;ON;;;;;N;;;;;
+23BD;HORIZONTAL SCAN LINE-9;So;0;ON;;;;;N;;;;;
+23BE;DENTISTRY SYMBOL LIGHT VERTICAL AND TOP RIGHT;So;0;ON;;;;;N;;;;;
+23BF;DENTISTRY SYMBOL LIGHT VERTICAL AND BOTTOM RIGHT;So;0;ON;;;;;N;;;;;
+23C0;DENTISTRY SYMBOL LIGHT VERTICAL WITH CIRCLE;So;0;ON;;;;;N;;;;;
+23C1;DENTISTRY SYMBOL LIGHT DOWN AND HORIZONTAL WITH CIRCLE;So;0;ON;;;;;N;;;;;
+23C2;DENTISTRY SYMBOL LIGHT UP AND HORIZONTAL WITH CIRCLE;So;0;ON;;;;;N;;;;;
+23C3;DENTISTRY SYMBOL LIGHT VERTICAL WITH TRIANGLE;So;0;ON;;;;;N;;;;;
+23C4;DENTISTRY SYMBOL LIGHT DOWN AND HORIZONTAL WITH TRIANGLE;So;0;ON;;;;;N;;;;;
+23C5;DENTISTRY SYMBOL LIGHT UP AND HORIZONTAL WITH TRIANGLE;So;0;ON;;;;;N;;;;;
+23C6;DENTISTRY SYMBOL LIGHT VERTICAL AND WAVE;So;0;ON;;;;;N;;;;;
+23C7;DENTISTRY SYMBOL LIGHT DOWN AND HORIZONTAL WITH WAVE;So;0;ON;;;;;N;;;;;
+23C8;DENTISTRY SYMBOL LIGHT UP AND HORIZONTAL WITH WAVE;So;0;ON;;;;;N;;;;;
+23C9;DENTISTRY SYMBOL LIGHT DOWN AND HORIZONTAL;So;0;ON;;;;;N;;;;;
+23CA;DENTISTRY SYMBOL LIGHT UP AND HORIZONTAL;So;0;ON;;;;;N;;;;;
+23CB;DENTISTRY SYMBOL LIGHT VERTICAL AND TOP LEFT;So;0;ON;;;;;N;;;;;
+23CC;DENTISTRY SYMBOL LIGHT VERTICAL AND BOTTOM LEFT;So;0;ON;;;;;N;;;;;
+23CD;SQUARE FOOT;So;0;ON;;;;;N;;;;;
+23CE;RETURN SYMBOL;So;0;ON;;;;;N;;;;;
+23CF;EJECT SYMBOL;So;0;ON;;;;;N;;;;;
+23D0;VERTICAL LINE EXTENSION;So;0;ON;;;;;N;;;;;
+23D1;METRICAL BREVE;So;0;ON;;;;;N;;;;;
+23D2;METRICAL LONG OVER SHORT;So;0;ON;;;;;N;;;;;
+23D3;METRICAL SHORT OVER LONG;So;0;ON;;;;;N;;;;;
+23D4;METRICAL LONG OVER TWO SHORTS;So;0;ON;;;;;N;;;;;
+23D5;METRICAL TWO SHORTS OVER LONG;So;0;ON;;;;;N;;;;;
+23D6;METRICAL TWO SHORTS JOINED;So;0;ON;;;;;N;;;;;
+23D7;METRICAL TRISEME;So;0;ON;;;;;N;;;;;
+23D8;METRICAL TETRASEME;So;0;ON;;;;;N;;;;;
+23D9;METRICAL PENTASEME;So;0;ON;;;;;N;;;;;
+23DA;EARTH GROUND;So;0;ON;;;;;N;;;;;
+23DB;FUSE;So;0;ON;;;;;N;;;;;
+23DC;TOP PARENTHESIS;Sm;0;ON;;;;;N;;;;;
+23DD;BOTTOM PARENTHESIS;Sm;0;ON;;;;;N;;;;;
+23DE;TOP CURLY BRACKET;Sm;0;ON;;;;;N;;;;;
+23DF;BOTTOM CURLY BRACKET;Sm;0;ON;;;;;N;;;;;
+23E0;TOP TORTOISE SHELL BRACKET;Sm;0;ON;;;;;N;;;;;
+23E1;BOTTOM TORTOISE SHELL BRACKET;Sm;0;ON;;;;;N;;;;;
+23E2;WHITE TRAPEZIUM;So;0;ON;;;;;N;;;;;
+23E3;BENZENE RING WITH CIRCLE;So;0;ON;;;;;N;;;;;
+23E4;STRAIGHTNESS;So;0;ON;;;;;N;;;;;
+23E5;FLATNESS;So;0;ON;;;;;N;;;;;
+23E6;AC CURRENT;So;0;ON;;;;;N;;;;;
+23E7;ELECTRICAL INTERSECTION;So;0;ON;;;;;N;;;;;
+23E8;DECIMAL EXPONENT SYMBOL;So;0;ON;;;;;N;;;;;
+23E9;BLACK RIGHT-POINTING DOUBLE TRIANGLE;So;0;ON;;;;;N;;;;;
+23EA;BLACK LEFT-POINTING DOUBLE TRIANGLE;So;0;ON;;;;;N;;;;;
+23EB;BLACK UP-POINTING DOUBLE TRIANGLE;So;0;ON;;;;;N;;;;;
+23EC;BLACK DOWN-POINTING DOUBLE TRIANGLE;So;0;ON;;;;;N;;;;;
+23ED;BLACK RIGHT-POINTING DOUBLE TRIANGLE WITH VERTICAL BAR;So;0;ON;;;;;N;;;;;
+23EE;BLACK LEFT-POINTING DOUBLE TRIANGLE WITH VERTICAL BAR;So;0;ON;;;;;N;;;;;
+23EF;BLACK RIGHT-POINTING TRIANGLE WITH DOUBLE VERTICAL BAR;So;0;ON;;;;;N;;;;;
+23F0;ALARM CLOCK;So;0;ON;;;;;N;;;;;
+23F1;STOPWATCH;So;0;ON;;;;;N;;;;;
+23F2;TIMER CLOCK;So;0;ON;;;;;N;;;;;
+23F3;HOURGLASS WITH FLOWING SAND;So;0;ON;;;;;N;;;;;
+23F4;BLACK MEDIUM LEFT-POINTING TRIANGLE;So;0;ON;;;;;N;;;;;
+23F5;BLACK MEDIUM RIGHT-POINTING TRIANGLE;So;0;ON;;;;;N;;;;;
+23F6;BLACK MEDIUM UP-POINTING TRIANGLE;So;0;ON;;;;;N;;;;;
+23F7;BLACK MEDIUM DOWN-POINTING TRIANGLE;So;0;ON;;;;;N;;;;;
+23F8;DOUBLE VERTICAL BAR;So;0;ON;;;;;N;;;;;
+23F9;BLACK SQUARE FOR STOP;So;0;ON;;;;;N;;;;;
+23FA;BLACK CIRCLE FOR RECORD;So;0;ON;;;;;N;;;;;
+23FB;POWER SYMBOL;So;0;ON;;;;;N;;;;;
+23FC;POWER ON-OFF SYMBOL;So;0;ON;;;;;N;;;;;
+23FD;POWER ON SYMBOL;So;0;ON;;;;;N;;;;;
+23FE;POWER SLEEP SYMBOL;So;0;ON;;;;;N;;;;;
+23FF;OBSERVER EYE SYMBOL;So;0;ON;;;;;N;;;;;
+2400;SYMBOL FOR NULL;So;0;ON;;;;;N;GRAPHIC FOR NULL;;;;
+2401;SYMBOL FOR START OF HEADING;So;0;ON;;;;;N;GRAPHIC FOR START OF HEADING;;;;
+2402;SYMBOL FOR START OF TEXT;So;0;ON;;;;;N;GRAPHIC FOR START OF TEXT;;;;
+2403;SYMBOL FOR END OF TEXT;So;0;ON;;;;;N;GRAPHIC FOR END OF TEXT;;;;
+2404;SYMBOL FOR END OF TRANSMISSION;So;0;ON;;;;;N;GRAPHIC FOR END OF TRANSMISSION;;;;
+2405;SYMBOL FOR ENQUIRY;So;0;ON;;;;;N;GRAPHIC FOR ENQUIRY;;;;
+2406;SYMBOL FOR ACKNOWLEDGE;So;0;ON;;;;;N;GRAPHIC FOR ACKNOWLEDGE;;;;
+2407;SYMBOL FOR BELL;So;0;ON;;;;;N;GRAPHIC FOR BELL;;;;
+2408;SYMBOL FOR BACKSPACE;So;0;ON;;;;;N;GRAPHIC FOR BACKSPACE;;;;
+2409;SYMBOL FOR HORIZONTAL TABULATION;So;0;ON;;;;;N;GRAPHIC FOR HORIZONTAL TABULATION;;;;
+240A;SYMBOL FOR LINE FEED;So;0;ON;;;;;N;GRAPHIC FOR LINE FEED;;;;
+240B;SYMBOL FOR VERTICAL TABULATION;So;0;ON;;;;;N;GRAPHIC FOR VERTICAL TABULATION;;;;
+240C;SYMBOL FOR FORM FEED;So;0;ON;;;;;N;GRAPHIC FOR FORM FEED;;;;
+240D;SYMBOL FOR CARRIAGE RETURN;So;0;ON;;;;;N;GRAPHIC FOR CARRIAGE RETURN;;;;
+240E;SYMBOL FOR SHIFT OUT;So;0;ON;;;;;N;GRAPHIC FOR SHIFT OUT;;;;
+240F;SYMBOL FOR SHIFT IN;So;0;ON;;;;;N;GRAPHIC FOR SHIFT IN;;;;
+2410;SYMBOL FOR DATA LINK ESCAPE;So;0;ON;;;;;N;GRAPHIC FOR DATA LINK ESCAPE;;;;
+2411;SYMBOL FOR DEVICE CONTROL ONE;So;0;ON;;;;;N;GRAPHIC FOR DEVICE CONTROL ONE;;;;
+2412;SYMBOL FOR DEVICE CONTROL TWO;So;0;ON;;;;;N;GRAPHIC FOR DEVICE CONTROL TWO;;;;
+2413;SYMBOL FOR DEVICE CONTROL THREE;So;0;ON;;;;;N;GRAPHIC FOR DEVICE CONTROL THREE;;;;
+2414;SYMBOL FOR DEVICE CONTROL FOUR;So;0;ON;;;;;N;GRAPHIC FOR DEVICE CONTROL FOUR;;;;
+2415;SYMBOL FOR NEGATIVE ACKNOWLEDGE;So;0;ON;;;;;N;GRAPHIC FOR NEGATIVE ACKNOWLEDGE;;;;
+2416;SYMBOL FOR SYNCHRONOUS IDLE;So;0;ON;;;;;N;GRAPHIC FOR SYNCHRONOUS IDLE;;;;
+2417;SYMBOL FOR END OF TRANSMISSION BLOCK;So;0;ON;;;;;N;GRAPHIC FOR END OF TRANSMISSION BLOCK;;;;
+2418;SYMBOL FOR CANCEL;So;0;ON;;;;;N;GRAPHIC FOR CANCEL;;;;
+2419;SYMBOL FOR END OF MEDIUM;So;0;ON;;;;;N;GRAPHIC FOR END OF MEDIUM;;;;
+241A;SYMBOL FOR SUBSTITUTE;So;0;ON;;;;;N;GRAPHIC FOR SUBSTITUTE;;;;
+241B;SYMBOL FOR ESCAPE;So;0;ON;;;;;N;GRAPHIC FOR ESCAPE;;;;
+241C;SYMBOL FOR FILE SEPARATOR;So;0;ON;;;;;N;GRAPHIC FOR FILE SEPARATOR;;;;
+241D;SYMBOL FOR GROUP SEPARATOR;So;0;ON;;;;;N;GRAPHIC FOR GROUP SEPARATOR;;;;
+241E;SYMBOL FOR RECORD SEPARATOR;So;0;ON;;;;;N;GRAPHIC FOR RECORD SEPARATOR;;;;
+241F;SYMBOL FOR UNIT SEPARATOR;So;0;ON;;;;;N;GRAPHIC FOR UNIT SEPARATOR;;;;
+2420;SYMBOL FOR SPACE;So;0;ON;;;;;N;GRAPHIC FOR SPACE;;;;
+2421;SYMBOL FOR DELETE;So;0;ON;;;;;N;GRAPHIC FOR DELETE;;;;
+2422;BLANK SYMBOL;So;0;ON;;;;;N;BLANK;;;;
+2423;OPEN BOX;So;0;ON;;;;;N;;;;;
+2424;SYMBOL FOR NEWLINE;So;0;ON;;;;;N;GRAPHIC FOR NEWLINE;;;;
+2425;SYMBOL FOR DELETE FORM TWO;So;0;ON;;;;;N;;;;;
+2426;SYMBOL FOR SUBSTITUTE FORM TWO;So;0;ON;;;;;N;;;;;
+2440;OCR HOOK;So;0;ON;;;;;N;;;;;
+2441;OCR CHAIR;So;0;ON;;;;;N;;;;;
+2442;OCR FORK;So;0;ON;;;;;N;;;;;
+2443;OCR INVERTED FORK;So;0;ON;;;;;N;;;;;
+2444;OCR BELT BUCKLE;So;0;ON;;;;;N;;;;;
+2445;OCR BOW TIE;So;0;ON;;;;;N;;;;;
+2446;OCR BRANCH BANK IDENTIFICATION;So;0;ON;;;;;N;;;;;
+2447;OCR AMOUNT OF CHECK;So;0;ON;;;;;N;;;;;
+2448;OCR DASH;So;0;ON;;;;;N;;;;;
+2449;OCR CUSTOMER ACCOUNT NUMBER;So;0;ON;;;;;N;;;;;
+244A;OCR DOUBLE BACKSLASH;So;0;ON;;;;;N;;;;;
+2460;CIRCLED DIGIT ONE;No;0;ON;<circle> 0031;;1;1;N;;;;;
+2461;CIRCLED DIGIT TWO;No;0;ON;<circle> 0032;;2;2;N;;;;;
+2462;CIRCLED DIGIT THREE;No;0;ON;<circle> 0033;;3;3;N;;;;;
+2463;CIRCLED DIGIT FOUR;No;0;ON;<circle> 0034;;4;4;N;;;;;
+2464;CIRCLED DIGIT FIVE;No;0;ON;<circle> 0035;;5;5;N;;;;;
+2465;CIRCLED DIGIT SIX;No;0;ON;<circle> 0036;;6;6;N;;;;;
+2466;CIRCLED DIGIT SEVEN;No;0;ON;<circle> 0037;;7;7;N;;;;;
+2467;CIRCLED DIGIT EIGHT;No;0;ON;<circle> 0038;;8;8;N;;;;;
+2468;CIRCLED DIGIT NINE;No;0;ON;<circle> 0039;;9;9;N;;;;;
+2469;CIRCLED NUMBER TEN;No;0;ON;<circle> 0031 0030;;;10;N;;;;;
+246A;CIRCLED NUMBER ELEVEN;No;0;ON;<circle> 0031 0031;;;11;N;;;;;
+246B;CIRCLED NUMBER TWELVE;No;0;ON;<circle> 0031 0032;;;12;N;;;;;
+246C;CIRCLED NUMBER THIRTEEN;No;0;ON;<circle> 0031 0033;;;13;N;;;;;
+246D;CIRCLED NUMBER FOURTEEN;No;0;ON;<circle> 0031 0034;;;14;N;;;;;
+246E;CIRCLED NUMBER FIFTEEN;No;0;ON;<circle> 0031 0035;;;15;N;;;;;
+246F;CIRCLED NUMBER SIXTEEN;No;0;ON;<circle> 0031 0036;;;16;N;;;;;
+2470;CIRCLED NUMBER SEVENTEEN;No;0;ON;<circle> 0031 0037;;;17;N;;;;;
+2471;CIRCLED NUMBER EIGHTEEN;No;0;ON;<circle> 0031 0038;;;18;N;;;;;
+2472;CIRCLED NUMBER NINETEEN;No;0;ON;<circle> 0031 0039;;;19;N;;;;;
+2473;CIRCLED NUMBER TWENTY;No;0;ON;<circle> 0032 0030;;;20;N;;;;;
+2474;PARENTHESIZED DIGIT ONE;No;0;ON;<compat> 0028 0031 0029;;1;1;N;;;;;
+2475;PARENTHESIZED DIGIT TWO;No;0;ON;<compat> 0028 0032 0029;;2;2;N;;;;;
+2476;PARENTHESIZED DIGIT THREE;No;0;ON;<compat> 0028 0033 0029;;3;3;N;;;;;
+2477;PARENTHESIZED DIGIT FOUR;No;0;ON;<compat> 0028 0034 0029;;4;4;N;;;;;
+2478;PARENTHESIZED DIGIT FIVE;No;0;ON;<compat> 0028 0035 0029;;5;5;N;;;;;
+2479;PARENTHESIZED DIGIT SIX;No;0;ON;<compat> 0028 0036 0029;;6;6;N;;;;;
+247A;PARENTHESIZED DIGIT SEVEN;No;0;ON;<compat> 0028 0037 0029;;7;7;N;;;;;
+247B;PARENTHESIZED DIGIT EIGHT;No;0;ON;<compat> 0028 0038 0029;;8;8;N;;;;;
+247C;PARENTHESIZED DIGIT NINE;No;0;ON;<compat> 0028 0039 0029;;9;9;N;;;;;
+247D;PARENTHESIZED NUMBER TEN;No;0;ON;<compat> 0028 0031 0030 0029;;;10;N;;;;;
+247E;PARENTHESIZED NUMBER ELEVEN;No;0;ON;<compat> 0028 0031 0031 0029;;;11;N;;;;;
+247F;PARENTHESIZED NUMBER TWELVE;No;0;ON;<compat> 0028 0031 0032 0029;;;12;N;;;;;
+2480;PARENTHESIZED NUMBER THIRTEEN;No;0;ON;<compat> 0028 0031 0033 0029;;;13;N;;;;;
+2481;PARENTHESIZED NUMBER FOURTEEN;No;0;ON;<compat> 0028 0031 0034 0029;;;14;N;;;;;
+2482;PARENTHESIZED NUMBER FIFTEEN;No;0;ON;<compat> 0028 0031 0035 0029;;;15;N;;;;;
+2483;PARENTHESIZED NUMBER SIXTEEN;No;0;ON;<compat> 0028 0031 0036 0029;;;16;N;;;;;
+2484;PARENTHESIZED NUMBER SEVENTEEN;No;0;ON;<compat> 0028 0031 0037 0029;;;17;N;;;;;
+2485;PARENTHESIZED NUMBER EIGHTEEN;No;0;ON;<compat> 0028 0031 0038 0029;;;18;N;;;;;
+2486;PARENTHESIZED NUMBER NINETEEN;No;0;ON;<compat> 0028 0031 0039 0029;;;19;N;;;;;
+2487;PARENTHESIZED NUMBER TWENTY;No;0;ON;<compat> 0028 0032 0030 0029;;;20;N;;;;;
+2488;DIGIT ONE FULL STOP;No;0;EN;<compat> 0031 002E;;1;1;N;DIGIT ONE PERIOD;;;;
+2489;DIGIT TWO FULL STOP;No;0;EN;<compat> 0032 002E;;2;2;N;DIGIT TWO PERIOD;;;;
+248A;DIGIT THREE FULL STOP;No;0;EN;<compat> 0033 002E;;3;3;N;DIGIT THREE PERIOD;;;;
+248B;DIGIT FOUR FULL STOP;No;0;EN;<compat> 0034 002E;;4;4;N;DIGIT FOUR PERIOD;;;;
+248C;DIGIT FIVE FULL STOP;No;0;EN;<compat> 0035 002E;;5;5;N;DIGIT FIVE PERIOD;;;;
+248D;DIGIT SIX FULL STOP;No;0;EN;<compat> 0036 002E;;6;6;N;DIGIT SIX PERIOD;;;;
+248E;DIGIT SEVEN FULL STOP;No;0;EN;<compat> 0037 002E;;7;7;N;DIGIT SEVEN PERIOD;;;;
+248F;DIGIT EIGHT FULL STOP;No;0;EN;<compat> 0038 002E;;8;8;N;DIGIT EIGHT PERIOD;;;;
+2490;DIGIT NINE FULL STOP;No;0;EN;<compat> 0039 002E;;9;9;N;DIGIT NINE PERIOD;;;;
+2491;NUMBER TEN FULL STOP;No;0;EN;<compat> 0031 0030 002E;;;10;N;NUMBER TEN PERIOD;;;;
+2492;NUMBER ELEVEN FULL STOP;No;0;EN;<compat> 0031 0031 002E;;;11;N;NUMBER ELEVEN PERIOD;;;;
+2493;NUMBER TWELVE FULL STOP;No;0;EN;<compat> 0031 0032 002E;;;12;N;NUMBER TWELVE PERIOD;;;;
+2494;NUMBER THIRTEEN FULL STOP;No;0;EN;<compat> 0031 0033 002E;;;13;N;NUMBER THIRTEEN PERIOD;;;;
+2495;NUMBER FOURTEEN FULL STOP;No;0;EN;<compat> 0031 0034 002E;;;14;N;NUMBER FOURTEEN PERIOD;;;;
+2496;NUMBER FIFTEEN FULL STOP;No;0;EN;<compat> 0031 0035 002E;;;15;N;NUMBER FIFTEEN PERIOD;;;;
+2497;NUMBER SIXTEEN FULL STOP;No;0;EN;<compat> 0031 0036 002E;;;16;N;NUMBER SIXTEEN PERIOD;;;;
+2498;NUMBER SEVENTEEN FULL STOP;No;0;EN;<compat> 0031 0037 002E;;;17;N;NUMBER SEVENTEEN PERIOD;;;;
+2499;NUMBER EIGHTEEN FULL STOP;No;0;EN;<compat> 0031 0038 002E;;;18;N;NUMBER EIGHTEEN PERIOD;;;;
+249A;NUMBER NINETEEN FULL STOP;No;0;EN;<compat> 0031 0039 002E;;;19;N;NUMBER NINETEEN PERIOD;;;;
+249B;NUMBER TWENTY FULL STOP;No;0;EN;<compat> 0032 0030 002E;;;20;N;NUMBER TWENTY PERIOD;;;;
+249C;PARENTHESIZED LATIN SMALL LETTER A;So;0;L;<compat> 0028 0061 0029;;;;N;;;;;
+249D;PARENTHESIZED LATIN SMALL LETTER B;So;0;L;<compat> 0028 0062 0029;;;;N;;;;;
+249E;PARENTHESIZED LATIN SMALL LETTER C;So;0;L;<compat> 0028 0063 0029;;;;N;;;;;
+249F;PARENTHESIZED LATIN SMALL LETTER D;So;0;L;<compat> 0028 0064 0029;;;;N;;;;;
+24A0;PARENTHESIZED LATIN SMALL LETTER E;So;0;L;<compat> 0028 0065 0029;;;;N;;;;;
+24A1;PARENTHESIZED LATIN SMALL LETTER F;So;0;L;<compat> 0028 0066 0029;;;;N;;;;;
+24A2;PARENTHESIZED LATIN SMALL LETTER G;So;0;L;<compat> 0028 0067 0029;;;;N;;;;;
+24A3;PARENTHESIZED LATIN SMALL LETTER H;So;0;L;<compat> 0028 0068 0029;;;;N;;;;;
+24A4;PARENTHESIZED LATIN SMALL LETTER I;So;0;L;<compat> 0028 0069 0029;;;;N;;;;;
+24A5;PARENTHESIZED LATIN SMALL LETTER J;So;0;L;<compat> 0028 006A 0029;;;;N;;;;;
+24A6;PARENTHESIZED LATIN SMALL LETTER K;So;0;L;<compat> 0028 006B 0029;;;;N;;;;;
+24A7;PARENTHESIZED LATIN SMALL LETTER L;So;0;L;<compat> 0028 006C 0029;;;;N;;;;;
+24A8;PARENTHESIZED LATIN SMALL LETTER M;So;0;L;<compat> 0028 006D 0029;;;;N;;;;;
+24A9;PARENTHESIZED LATIN SMALL LETTER N;So;0;L;<compat> 0028 006E 0029;;;;N;;;;;
+24AA;PARENTHESIZED LATIN SMALL LETTER O;So;0;L;<compat> 0028 006F 0029;;;;N;;;;;
+24AB;PARENTHESIZED LATIN SMALL LETTER P;So;0;L;<compat> 0028 0070 0029;;;;N;;;;;
+24AC;PARENTHESIZED LATIN SMALL LETTER Q;So;0;L;<compat> 0028 0071 0029;;;;N;;;;;
+24AD;PARENTHESIZED LATIN SMALL LETTER R;So;0;L;<compat> 0028 0072 0029;;;;N;;;;;
+24AE;PARENTHESIZED LATIN SMALL LETTER S;So;0;L;<compat> 0028 0073 0029;;;;N;;;;;
+24AF;PARENTHESIZED LATIN SMALL LETTER T;So;0;L;<compat> 0028 0074 0029;;;;N;;;;;
+24B0;PARENTHESIZED LATIN SMALL LETTER U;So;0;L;<compat> 0028 0075 0029;;;;N;;;;;
+24B1;PARENTHESIZED LATIN SMALL LETTER V;So;0;L;<compat> 0028 0076 0029;;;;N;;;;;
+24B2;PARENTHESIZED LATIN SMALL LETTER W;So;0;L;<compat> 0028 0077 0029;;;;N;;;;;
+24B3;PARENTHESIZED LATIN SMALL LETTER X;So;0;L;<compat> 0028 0078 0029;;;;N;;;;;
+24B4;PARENTHESIZED LATIN SMALL LETTER Y;So;0;L;<compat> 0028 0079 0029;;;;N;;;;;
+24B5;PARENTHESIZED LATIN SMALL LETTER Z;So;0;L;<compat> 0028 007A 0029;;;;N;;;;;
+24B6;CIRCLED LATIN CAPITAL LETTER A;So;0;L;<circle> 0041;;;;N;;;;24D0;
+24B7;CIRCLED LATIN CAPITAL LETTER B;So;0;L;<circle> 0042;;;;N;;;;24D1;
+24B8;CIRCLED LATIN CAPITAL LETTER C;So;0;L;<circle> 0043;;;;N;;;;24D2;
+24B9;CIRCLED LATIN CAPITAL LETTER D;So;0;L;<circle> 0044;;;;N;;;;24D3;
+24BA;CIRCLED LATIN CAPITAL LETTER E;So;0;L;<circle> 0045;;;;N;;;;24D4;
+24BB;CIRCLED LATIN CAPITAL LETTER F;So;0;L;<circle> 0046;;;;N;;;;24D5;
+24BC;CIRCLED LATIN CAPITAL LETTER G;So;0;L;<circle> 0047;;;;N;;;;24D6;
+24BD;CIRCLED LATIN CAPITAL LETTER H;So;0;L;<circle> 0048;;;;N;;;;24D7;
+24BE;CIRCLED LATIN CAPITAL LETTER I;So;0;L;<circle> 0049;;;;N;;;;24D8;
+24BF;CIRCLED LATIN CAPITAL LETTER J;So;0;L;<circle> 004A;;;;N;;;;24D9;
+24C0;CIRCLED LATIN CAPITAL LETTER K;So;0;L;<circle> 004B;;;;N;;;;24DA;
+24C1;CIRCLED LATIN CAPITAL LETTER L;So;0;L;<circle> 004C;;;;N;;;;24DB;
+24C2;CIRCLED LATIN CAPITAL LETTER M;So;0;L;<circle> 004D;;;;N;;;;24DC;
+24C3;CIRCLED LATIN CAPITAL LETTER N;So;0;L;<circle> 004E;;;;N;;;;24DD;
+24C4;CIRCLED LATIN CAPITAL LETTER O;So;0;L;<circle> 004F;;;;N;;;;24DE;
+24C5;CIRCLED LATIN CAPITAL LETTER P;So;0;L;<circle> 0050;;;;N;;;;24DF;
+24C6;CIRCLED LATIN CAPITAL LETTER Q;So;0;L;<circle> 0051;;;;N;;;;24E0;
+24C7;CIRCLED LATIN CAPITAL LETTER R;So;0;L;<circle> 0052;;;;N;;;;24E1;
+24C8;CIRCLED LATIN CAPITAL LETTER S;So;0;L;<circle> 0053;;;;N;;;;24E2;
+24C9;CIRCLED LATIN CAPITAL LETTER T;So;0;L;<circle> 0054;;;;N;;;;24E3;
+24CA;CIRCLED LATIN CAPITAL LETTER U;So;0;L;<circle> 0055;;;;N;;;;24E4;
+24CB;CIRCLED LATIN CAPITAL LETTER V;So;0;L;<circle> 0056;;;;N;;;;24E5;
+24CC;CIRCLED LATIN CAPITAL LETTER W;So;0;L;<circle> 0057;;;;N;;;;24E6;
+24CD;CIRCLED LATIN CAPITAL LETTER X;So;0;L;<circle> 0058;;;;N;;;;24E7;
+24CE;CIRCLED LATIN CAPITAL LETTER Y;So;0;L;<circle> 0059;;;;N;;;;24E8;
+24CF;CIRCLED LATIN CAPITAL LETTER Z;So;0;L;<circle> 005A;;;;N;;;;24E9;
+24D0;CIRCLED LATIN SMALL LETTER A;So;0;L;<circle> 0061;;;;N;;;24B6;;24B6
+24D1;CIRCLED LATIN SMALL LETTER B;So;0;L;<circle> 0062;;;;N;;;24B7;;24B7
+24D2;CIRCLED LATIN SMALL LETTER C;So;0;L;<circle> 0063;;;;N;;;24B8;;24B8
+24D3;CIRCLED LATIN SMALL LETTER D;So;0;L;<circle> 0064;;;;N;;;24B9;;24B9
+24D4;CIRCLED LATIN SMALL LETTER E;So;0;L;<circle> 0065;;;;N;;;24BA;;24BA
+24D5;CIRCLED LATIN SMALL LETTER F;So;0;L;<circle> 0066;;;;N;;;24BB;;24BB
+24D6;CIRCLED LATIN SMALL LETTER G;So;0;L;<circle> 0067;;;;N;;;24BC;;24BC
+24D7;CIRCLED LATIN SMALL LETTER H;So;0;L;<circle> 0068;;;;N;;;24BD;;24BD
+24D8;CIRCLED LATIN SMALL LETTER I;So;0;L;<circle> 0069;;;;N;;;24BE;;24BE
+24D9;CIRCLED LATIN SMALL LETTER J;So;0;L;<circle> 006A;;;;N;;;24BF;;24BF
+24DA;CIRCLED LATIN SMALL LETTER K;So;0;L;<circle> 006B;;;;N;;;24C0;;24C0
+24DB;CIRCLED LATIN SMALL LETTER L;So;0;L;<circle> 006C;;;;N;;;24C1;;24C1
+24DC;CIRCLED LATIN SMALL LETTER M;So;0;L;<circle> 006D;;;;N;;;24C2;;24C2
+24DD;CIRCLED LATIN SMALL LETTER N;So;0;L;<circle> 006E;;;;N;;;24C3;;24C3
+24DE;CIRCLED LATIN SMALL LETTER O;So;0;L;<circle> 006F;;;;N;;;24C4;;24C4
+24DF;CIRCLED LATIN SMALL LETTER P;So;0;L;<circle> 0070;;;;N;;;24C5;;24C5
+24E0;CIRCLED LATIN SMALL LETTER Q;So;0;L;<circle> 0071;;;;N;;;24C6;;24C6
+24E1;CIRCLED LATIN SMALL LETTER R;So;0;L;<circle> 0072;;;;N;;;24C7;;24C7
+24E2;CIRCLED LATIN SMALL LETTER S;So;0;L;<circle> 0073;;;;N;;;24C8;;24C8
+24E3;CIRCLED LATIN SMALL LETTER T;So;0;L;<circle> 0074;;;;N;;;24C9;;24C9
+24E4;CIRCLED LATIN SMALL LETTER U;So;0;L;<circle> 0075;;;;N;;;24CA;;24CA
+24E5;CIRCLED LATIN SMALL LETTER V;So;0;L;<circle> 0076;;;;N;;;24CB;;24CB
+24E6;CIRCLED LATIN SMALL LETTER W;So;0;L;<circle> 0077;;;;N;;;24CC;;24CC
+24E7;CIRCLED LATIN SMALL LETTER X;So;0;L;<circle> 0078;;;;N;;;24CD;;24CD
+24E8;CIRCLED LATIN SMALL LETTER Y;So;0;L;<circle> 0079;;;;N;;;24CE;;24CE
+24E9;CIRCLED LATIN SMALL LETTER Z;So;0;L;<circle> 007A;;;;N;;;24CF;;24CF
+24EA;CIRCLED DIGIT ZERO;No;0;ON;<circle> 0030;;0;0;N;;;;;
+24EB;NEGATIVE CIRCLED NUMBER ELEVEN;No;0;ON;;;;11;N;;;;;
+24EC;NEGATIVE CIRCLED NUMBER TWELVE;No;0;ON;;;;12;N;;;;;
+24ED;NEGATIVE CIRCLED NUMBER THIRTEEN;No;0;ON;;;;13;N;;;;;
+24EE;NEGATIVE CIRCLED NUMBER FOURTEEN;No;0;ON;;;;14;N;;;;;
+24EF;NEGATIVE CIRCLED NUMBER FIFTEEN;No;0;ON;;;;15;N;;;;;
+24F0;NEGATIVE CIRCLED NUMBER SIXTEEN;No;0;ON;;;;16;N;;;;;
+24F1;NEGATIVE CIRCLED NUMBER SEVENTEEN;No;0;ON;;;;17;N;;;;;
+24F2;NEGATIVE CIRCLED NUMBER EIGHTEEN;No;0;ON;;;;18;N;;;;;
+24F3;NEGATIVE CIRCLED NUMBER NINETEEN;No;0;ON;;;;19;N;;;;;
+24F4;NEGATIVE CIRCLED NUMBER TWENTY;No;0;ON;;;;20;N;;;;;
+24F5;DOUBLE CIRCLED DIGIT ONE;No;0;ON;;;1;1;N;;;;;
+24F6;DOUBLE CIRCLED DIGIT TWO;No;0;ON;;;2;2;N;;;;;
+24F7;DOUBLE CIRCLED DIGIT THREE;No;0;ON;;;3;3;N;;;;;
+24F8;DOUBLE CIRCLED DIGIT FOUR;No;0;ON;;;4;4;N;;;;;
+24F9;DOUBLE CIRCLED DIGIT FIVE;No;0;ON;;;5;5;N;;;;;
+24FA;DOUBLE CIRCLED DIGIT SIX;No;0;ON;;;6;6;N;;;;;
+24FB;DOUBLE CIRCLED DIGIT SEVEN;No;0;ON;;;7;7;N;;;;;
+24FC;DOUBLE CIRCLED DIGIT EIGHT;No;0;ON;;;8;8;N;;;;;
+24FD;DOUBLE CIRCLED DIGIT NINE;No;0;ON;;;9;9;N;;;;;
+24FE;DOUBLE CIRCLED NUMBER TEN;No;0;ON;;;;10;N;;;;;
+24FF;NEGATIVE CIRCLED DIGIT ZERO;No;0;ON;;;0;0;N;;;;;
+2500;BOX DRAWINGS LIGHT HORIZONTAL;So;0;ON;;;;;N;FORMS LIGHT HORIZONTAL;;;;
+2501;BOX DRAWINGS HEAVY HORIZONTAL;So;0;ON;;;;;N;FORMS HEAVY HORIZONTAL;;;;
+2502;BOX DRAWINGS LIGHT VERTICAL;So;0;ON;;;;;N;FORMS LIGHT VERTICAL;;;;
+2503;BOX DRAWINGS HEAVY VERTICAL;So;0;ON;;;;;N;FORMS HEAVY VERTICAL;;;;
+2504;BOX DRAWINGS LIGHT TRIPLE DASH HORIZONTAL;So;0;ON;;;;;N;FORMS LIGHT TRIPLE DASH HORIZONTAL;;;;
+2505;BOX DRAWINGS HEAVY TRIPLE DASH HORIZONTAL;So;0;ON;;;;;N;FORMS HEAVY TRIPLE DASH HORIZONTAL;;;;
+2506;BOX DRAWINGS LIGHT TRIPLE DASH VERTICAL;So;0;ON;;;;;N;FORMS LIGHT TRIPLE DASH VERTICAL;;;;
+2507;BOX DRAWINGS HEAVY TRIPLE DASH VERTICAL;So;0;ON;;;;;N;FORMS HEAVY TRIPLE DASH VERTICAL;;;;
+2508;BOX DRAWINGS LIGHT QUADRUPLE DASH HORIZONTAL;So;0;ON;;;;;N;FORMS LIGHT QUADRUPLE DASH HORIZONTAL;;;;
+2509;BOX DRAWINGS HEAVY QUADRUPLE DASH HORIZONTAL;So;0;ON;;;;;N;FORMS HEAVY QUADRUPLE DASH HORIZONTAL;;;;
+250A;BOX DRAWINGS LIGHT QUADRUPLE DASH VERTICAL;So;0;ON;;;;;N;FORMS LIGHT QUADRUPLE DASH VERTICAL;;;;
+250B;BOX DRAWINGS HEAVY QUADRUPLE DASH VERTICAL;So;0;ON;;;;;N;FORMS HEAVY QUADRUPLE DASH VERTICAL;;;;
+250C;BOX DRAWINGS LIGHT DOWN AND RIGHT;So;0;ON;;;;;N;FORMS LIGHT DOWN AND RIGHT;;;;
+250D;BOX DRAWINGS DOWN LIGHT AND RIGHT HEAVY;So;0;ON;;;;;N;FORMS DOWN LIGHT AND RIGHT HEAVY;;;;
+250E;BOX DRAWINGS DOWN HEAVY AND RIGHT LIGHT;So;0;ON;;;;;N;FORMS DOWN HEAVY AND RIGHT LIGHT;;;;
+250F;BOX DRAWINGS HEAVY DOWN AND RIGHT;So;0;ON;;;;;N;FORMS HEAVY DOWN AND RIGHT;;;;
+2510;BOX DRAWINGS LIGHT DOWN AND LEFT;So;0;ON;;;;;N;FORMS LIGHT DOWN AND LEFT;;;;
+2511;BOX DRAWINGS DOWN LIGHT AND LEFT HEAVY;So;0;ON;;;;;N;FORMS DOWN LIGHT AND LEFT HEAVY;;;;
+2512;BOX DRAWINGS DOWN HEAVY AND LEFT LIGHT;So;0;ON;;;;;N;FORMS DOWN HEAVY AND LEFT LIGHT;;;;
+2513;BOX DRAWINGS HEAVY DOWN AND LEFT;So;0;ON;;;;;N;FORMS HEAVY DOWN AND LEFT;;;;
+2514;BOX DRAWINGS LIGHT UP AND RIGHT;So;0;ON;;;;;N;FORMS LIGHT UP AND RIGHT;;;;
+2515;BOX DRAWINGS UP LIGHT AND RIGHT HEAVY;So;0;ON;;;;;N;FORMS UP LIGHT AND RIGHT HEAVY;;;;
+2516;BOX DRAWINGS UP HEAVY AND RIGHT LIGHT;So;0;ON;;;;;N;FORMS UP HEAVY AND RIGHT LIGHT;;;;
+2517;BOX DRAWINGS HEAVY UP AND RIGHT;So;0;ON;;;;;N;FORMS HEAVY UP AND RIGHT;;;;
+2518;BOX DRAWINGS LIGHT UP AND LEFT;So;0;ON;;;;;N;FORMS LIGHT UP AND LEFT;;;;
+2519;BOX DRAWINGS UP LIGHT AND LEFT HEAVY;So;0;ON;;;;;N;FORMS UP LIGHT AND LEFT HEAVY;;;;
+251A;BOX DRAWINGS UP HEAVY AND LEFT LIGHT;So;0;ON;;;;;N;FORMS UP HEAVY AND LEFT LIGHT;;;;
+251B;BOX DRAWINGS HEAVY UP AND LEFT;So;0;ON;;;;;N;FORMS HEAVY UP AND LEFT;;;;
+251C;BOX DRAWINGS LIGHT VERTICAL AND RIGHT;So;0;ON;;;;;N;FORMS LIGHT VERTICAL AND RIGHT;;;;
+251D;BOX DRAWINGS VERTICAL LIGHT AND RIGHT HEAVY;So;0;ON;;;;;N;FORMS VERTICAL LIGHT AND RIGHT HEAVY;;;;
+251E;BOX DRAWINGS UP HEAVY AND RIGHT DOWN LIGHT;So;0;ON;;;;;N;FORMS UP HEAVY AND RIGHT DOWN LIGHT;;;;
+251F;BOX DRAWINGS DOWN HEAVY AND RIGHT UP LIGHT;So;0;ON;;;;;N;FORMS DOWN HEAVY AND RIGHT UP LIGHT;;;;
+2520;BOX DRAWINGS VERTICAL HEAVY AND RIGHT LIGHT;So;0;ON;;;;;N;FORMS VERTICAL HEAVY AND RIGHT LIGHT;;;;
+2521;BOX DRAWINGS DOWN LIGHT AND RIGHT UP HEAVY;So;0;ON;;;;;N;FORMS DOWN LIGHT AND RIGHT UP HEAVY;;;;
+2522;BOX DRAWINGS UP LIGHT AND RIGHT DOWN HEAVY;So;0;ON;;;;;N;FORMS UP LIGHT AND RIGHT DOWN HEAVY;;;;
+2523;BOX DRAWINGS HEAVY VERTICAL AND RIGHT;So;0;ON;;;;;N;FORMS HEAVY VERTICAL AND RIGHT;;;;
+2524;BOX DRAWINGS LIGHT VERTICAL AND LEFT;So;0;ON;;;;;N;FORMS LIGHT VERTICAL AND LEFT;;;;
+2525;BOX DRAWINGS VERTICAL LIGHT AND LEFT HEAVY;So;0;ON;;;;;N;FORMS VERTICAL LIGHT AND LEFT HEAVY;;;;
+2526;BOX DRAWINGS UP HEAVY AND LEFT DOWN LIGHT;So;0;ON;;;;;N;FORMS UP HEAVY AND LEFT DOWN LIGHT;;;;
+2527;BOX DRAWINGS DOWN HEAVY AND LEFT UP LIGHT;So;0;ON;;;;;N;FORMS DOWN HEAVY AND LEFT UP LIGHT;;;;
+2528;BOX DRAWINGS VERTICAL HEAVY AND LEFT LIGHT;So;0;ON;;;;;N;FORMS VERTICAL HEAVY AND LEFT LIGHT;;;;
+2529;BOX DRAWINGS DOWN LIGHT AND LEFT UP HEAVY;So;0;ON;;;;;N;FORMS DOWN LIGHT AND LEFT UP HEAVY;;;;
+252A;BOX DRAWINGS UP LIGHT AND LEFT DOWN HEAVY;So;0;ON;;;;;N;FORMS UP LIGHT AND LEFT DOWN HEAVY;;;;
+252B;BOX DRAWINGS HEAVY VERTICAL AND LEFT;So;0;ON;;;;;N;FORMS HEAVY VERTICAL AND LEFT;;;;
+252C;BOX DRAWINGS LIGHT DOWN AND HORIZONTAL;So;0;ON;;;;;N;FORMS LIGHT DOWN AND HORIZONTAL;;;;
+252D;BOX DRAWINGS LEFT HEAVY AND RIGHT DOWN LIGHT;So;0;ON;;;;;N;FORMS LEFT HEAVY AND RIGHT DOWN LIGHT;;;;
+252E;BOX DRAWINGS RIGHT HEAVY AND LEFT DOWN LIGHT;So;0;ON;;;;;N;FORMS RIGHT HEAVY AND LEFT DOWN LIGHT;;;;
+252F;BOX DRAWINGS DOWN LIGHT AND HORIZONTAL HEAVY;So;0;ON;;;;;N;FORMS DOWN LIGHT AND HORIZONTAL HEAVY;;;;
+2530;BOX DRAWINGS DOWN HEAVY AND HORIZONTAL LIGHT;So;0;ON;;;;;N;FORMS DOWN HEAVY AND HORIZONTAL LIGHT;;;;
+2531;BOX DRAWINGS RIGHT LIGHT AND LEFT DOWN HEAVY;So;0;ON;;;;;N;FORMS RIGHT LIGHT AND LEFT DOWN HEAVY;;;;
+2532;BOX DRAWINGS LEFT LIGHT AND RIGHT DOWN HEAVY;So;0;ON;;;;;N;FORMS LEFT LIGHT AND RIGHT DOWN HEAVY;;;;
+2533;BOX DRAWINGS HEAVY DOWN AND HORIZONTAL;So;0;ON;;;;;N;FORMS HEAVY DOWN AND HORIZONTAL;;;;
+2534;BOX DRAWINGS LIGHT UP AND HORIZONTAL;So;0;ON;;;;;N;FORMS LIGHT UP AND HORIZONTAL;;;;
+2535;BOX DRAWINGS LEFT HEAVY AND RIGHT UP LIGHT;So;0;ON;;;;;N;FORMS LEFT HEAVY AND RIGHT UP LIGHT;;;;
+2536;BOX DRAWINGS RIGHT HEAVY AND LEFT UP LIGHT;So;0;ON;;;;;N;FORMS RIGHT HEAVY AND LEFT UP LIGHT;;;;
+2537;BOX DRAWINGS UP LIGHT AND HORIZONTAL HEAVY;So;0;ON;;;;;N;FORMS UP LIGHT AND HORIZONTAL HEAVY;;;;
+2538;BOX DRAWINGS UP HEAVY AND HORIZONTAL LIGHT;So;0;ON;;;;;N;FORMS UP HEAVY AND HORIZONTAL LIGHT;;;;
+2539;BOX DRAWINGS RIGHT LIGHT AND LEFT UP HEAVY;So;0;ON;;;;;N;FORMS RIGHT LIGHT AND LEFT UP HEAVY;;;;
+253A;BOX DRAWINGS LEFT LIGHT AND RIGHT UP HEAVY;So;0;ON;;;;;N;FORMS LEFT LIGHT AND RIGHT UP HEAVY;;;;
+253B;BOX DRAWINGS HEAVY UP AND HORIZONTAL;So;0;ON;;;;;N;FORMS HEAVY UP AND HORIZONTAL;;;;
+253C;BOX DRAWINGS LIGHT VERTICAL AND HORIZONTAL;So;0;ON;;;;;N;FORMS LIGHT VERTICAL AND HORIZONTAL;;;;
+253D;BOX DRAWINGS LEFT HEAVY AND RIGHT VERTICAL LIGHT;So;0;ON;;;;;N;FORMS LEFT HEAVY AND RIGHT VERTICAL LIGHT;;;;
+253E;BOX DRAWINGS RIGHT HEAVY AND LEFT VERTICAL LIGHT;So;0;ON;;;;;N;FORMS RIGHT HEAVY AND LEFT VERTICAL LIGHT;;;;
+253F;BOX DRAWINGS VERTICAL LIGHT AND HORIZONTAL HEAVY;So;0;ON;;;;;N;FORMS VERTICAL LIGHT AND HORIZONTAL HEAVY;;;;
+2540;BOX DRAWINGS UP HEAVY AND DOWN HORIZONTAL LIGHT;So;0;ON;;;;;N;FORMS UP HEAVY AND DOWN HORIZONTAL LIGHT;;;;
+2541;BOX DRAWINGS DOWN HEAVY AND UP HORIZONTAL LIGHT;So;0;ON;;;;;N;FORMS DOWN HEAVY AND UP HORIZONTAL LIGHT;;;;
+2542;BOX DRAWINGS VERTICAL HEAVY AND HORIZONTAL LIGHT;So;0;ON;;;;;N;FORMS VERTICAL HEAVY AND HORIZONTAL LIGHT;;;;
+2543;BOX DRAWINGS LEFT UP HEAVY AND RIGHT DOWN LIGHT;So;0;ON;;;;;N;FORMS LEFT UP HEAVY AND RIGHT DOWN LIGHT;;;;
+2544;BOX DRAWINGS RIGHT UP HEAVY AND LEFT DOWN LIGHT;So;0;ON;;;;;N;FORMS RIGHT UP HEAVY AND LEFT DOWN LIGHT;;;;
+2545;BOX DRAWINGS LEFT DOWN HEAVY AND RIGHT UP LIGHT;So;0;ON;;;;;N;FORMS LEFT DOWN HEAVY AND RIGHT UP LIGHT;;;;
+2546;BOX DRAWINGS RIGHT DOWN HEAVY AND LEFT UP LIGHT;So;0;ON;;;;;N;FORMS RIGHT DOWN HEAVY AND LEFT UP LIGHT;;;;
+2547;BOX DRAWINGS DOWN LIGHT AND UP HORIZONTAL HEAVY;So;0;ON;;;;;N;FORMS DOWN LIGHT AND UP HORIZONTAL HEAVY;;;;
+2548;BOX DRAWINGS UP LIGHT AND DOWN HORIZONTAL HEAVY;So;0;ON;;;;;N;FORMS UP LIGHT AND DOWN HORIZONTAL HEAVY;;;;
+2549;BOX DRAWINGS RIGHT LIGHT AND LEFT VERTICAL HEAVY;So;0;ON;;;;;N;FORMS RIGHT LIGHT AND LEFT VERTICAL HEAVY;;;;
+254A;BOX DRAWINGS LEFT LIGHT AND RIGHT VERTICAL HEAVY;So;0;ON;;;;;N;FORMS LEFT LIGHT AND RIGHT VERTICAL HEAVY;;;;
+254B;BOX DRAWINGS HEAVY VERTICAL AND HORIZONTAL;So;0;ON;;;;;N;FORMS HEAVY VERTICAL AND HORIZONTAL;;;;
+254C;BOX DRAWINGS LIGHT DOUBLE DASH HORIZONTAL;So;0;ON;;;;;N;FORMS LIGHT DOUBLE DASH HORIZONTAL;;;;
+254D;BOX DRAWINGS HEAVY DOUBLE DASH HORIZONTAL;So;0;ON;;;;;N;FORMS HEAVY DOUBLE DASH HORIZONTAL;;;;
+254E;BOX DRAWINGS LIGHT DOUBLE DASH VERTICAL;So;0;ON;;;;;N;FORMS LIGHT DOUBLE DASH VERTICAL;;;;
+254F;BOX DRAWINGS HEAVY DOUBLE DASH VERTICAL;So;0;ON;;;;;N;FORMS HEAVY DOUBLE DASH VERTICAL;;;;
+2550;BOX DRAWINGS DOUBLE HORIZONTAL;So;0;ON;;;;;N;FORMS DOUBLE HORIZONTAL;;;;
+2551;BOX DRAWINGS DOUBLE VERTICAL;So;0;ON;;;;;N;FORMS DOUBLE VERTICAL;;;;
+2552;BOX DRAWINGS DOWN SINGLE AND RIGHT DOUBLE;So;0;ON;;;;;N;FORMS DOWN SINGLE AND RIGHT DOUBLE;;;;
+2553;BOX DRAWINGS DOWN DOUBLE AND RIGHT SINGLE;So;0;ON;;;;;N;FORMS DOWN DOUBLE AND RIGHT SINGLE;;;;
+2554;BOX DRAWINGS DOUBLE DOWN AND RIGHT;So;0;ON;;;;;N;FORMS DOUBLE DOWN AND RIGHT;;;;
+2555;BOX DRAWINGS DOWN SINGLE AND LEFT DOUBLE;So;0;ON;;;;;N;FORMS DOWN SINGLE AND LEFT DOUBLE;;;;
+2556;BOX DRAWINGS DOWN DOUBLE AND LEFT SINGLE;So;0;ON;;;;;N;FORMS DOWN DOUBLE AND LEFT SINGLE;;;;
+2557;BOX DRAWINGS DOUBLE DOWN AND LEFT;So;0;ON;;;;;N;FORMS DOUBLE DOWN AND LEFT;;;;
+2558;BOX DRAWINGS UP SINGLE AND RIGHT DOUBLE;So;0;ON;;;;;N;FORMS UP SINGLE AND RIGHT DOUBLE;;;;
+2559;BOX DRAWINGS UP DOUBLE AND RIGHT SINGLE;So;0;ON;;;;;N;FORMS UP DOUBLE AND RIGHT SINGLE;;;;
+255A;BOX DRAWINGS DOUBLE UP AND RIGHT;So;0;ON;;;;;N;FORMS DOUBLE UP AND RIGHT;;;;
+255B;BOX DRAWINGS UP SINGLE AND LEFT DOUBLE;So;0;ON;;;;;N;FORMS UP SINGLE AND LEFT DOUBLE;;;;
+255C;BOX DRAWINGS UP DOUBLE AND LEFT SINGLE;So;0;ON;;;;;N;FORMS UP DOUBLE AND LEFT SINGLE;;;;
+255D;BOX DRAWINGS DOUBLE UP AND LEFT;So;0;ON;;;;;N;FORMS DOUBLE UP AND LEFT;;;;
+255E;BOX DRAWINGS VERTICAL SINGLE AND RIGHT DOUBLE;So;0;ON;;;;;N;FORMS VERTICAL SINGLE AND RIGHT DOUBLE;;;;
+255F;BOX DRAWINGS VERTICAL DOUBLE AND RIGHT SINGLE;So;0;ON;;;;;N;FORMS VERTICAL DOUBLE AND RIGHT SINGLE;;;;
+2560;BOX DRAWINGS DOUBLE VERTICAL AND RIGHT;So;0;ON;;;;;N;FORMS DOUBLE VERTICAL AND RIGHT;;;;
+2561;BOX DRAWINGS VERTICAL SINGLE AND LEFT DOUBLE;So;0;ON;;;;;N;FORMS VERTICAL SINGLE AND LEFT DOUBLE;;;;
+2562;BOX DRAWINGS VERTICAL DOUBLE AND LEFT SINGLE;So;0;ON;;;;;N;FORMS VERTICAL DOUBLE AND LEFT SINGLE;;;;
+2563;BOX DRAWINGS DOUBLE VERTICAL AND LEFT;So;0;ON;;;;;N;FORMS DOUBLE VERTICAL AND LEFT;;;;
+2564;BOX DRAWINGS DOWN SINGLE AND HORIZONTAL DOUBLE;So;0;ON;;;;;N;FORMS DOWN SINGLE AND HORIZONTAL DOUBLE;;;;
+2565;BOX DRAWINGS DOWN DOUBLE AND HORIZONTAL SINGLE;So;0;ON;;;;;N;FORMS DOWN DOUBLE AND HORIZONTAL SINGLE;;;;
+2566;BOX DRAWINGS DOUBLE DOWN AND HORIZONTAL;So;0;ON;;;;;N;FORMS DOUBLE DOWN AND HORIZONTAL;;;;
+2567;BOX DRAWINGS UP SINGLE AND HORIZONTAL DOUBLE;So;0;ON;;;;;N;FORMS UP SINGLE AND HORIZONTAL DOUBLE;;;;
+2568;BOX DRAWINGS UP DOUBLE AND HORIZONTAL SINGLE;So;0;ON;;;;;N;FORMS UP DOUBLE AND HORIZONTAL SINGLE;;;;
+2569;BOX DRAWINGS DOUBLE UP AND HORIZONTAL;So;0;ON;;;;;N;FORMS DOUBLE UP AND HORIZONTAL;;;;
+256A;BOX DRAWINGS VERTICAL SINGLE AND HORIZONTAL DOUBLE;So;0;ON;;;;;N;FORMS VERTICAL SINGLE AND HORIZONTAL DOUBLE;;;;
+256B;BOX DRAWINGS VERTICAL DOUBLE AND HORIZONTAL SINGLE;So;0;ON;;;;;N;FORMS VERTICAL DOUBLE AND HORIZONTAL SINGLE;;;;
+256C;BOX DRAWINGS DOUBLE VERTICAL AND HORIZONTAL;So;0;ON;;;;;N;FORMS DOUBLE VERTICAL AND HORIZONTAL;;;;
+256D;BOX DRAWINGS LIGHT ARC DOWN AND RIGHT;So;0;ON;;;;;N;FORMS LIGHT ARC DOWN AND RIGHT;;;;
+256E;BOX DRAWINGS LIGHT ARC DOWN AND LEFT;So;0;ON;;;;;N;FORMS LIGHT ARC DOWN AND LEFT;;;;
+256F;BOX DRAWINGS LIGHT ARC UP AND LEFT;So;0;ON;;;;;N;FORMS LIGHT ARC UP AND LEFT;;;;
+2570;BOX DRAWINGS LIGHT ARC UP AND RIGHT;So;0;ON;;;;;N;FORMS LIGHT ARC UP AND RIGHT;;;;
+2571;BOX DRAWINGS LIGHT DIAGONAL UPPER RIGHT TO LOWER LEFT;So;0;ON;;;;;N;FORMS LIGHT DIAGONAL UPPER RIGHT TO LOWER LEFT;;;;
+2572;BOX DRAWINGS LIGHT DIAGONAL UPPER LEFT TO LOWER RIGHT;So;0;ON;;;;;N;FORMS LIGHT DIAGONAL UPPER LEFT TO LOWER RIGHT;;;;
+2573;BOX DRAWINGS LIGHT DIAGONAL CROSS;So;0;ON;;;;;N;FORMS LIGHT DIAGONAL CROSS;;;;
+2574;BOX DRAWINGS LIGHT LEFT;So;0;ON;;;;;N;FORMS LIGHT LEFT;;;;
+2575;BOX DRAWINGS LIGHT UP;So;0;ON;;;;;N;FORMS LIGHT UP;;;;
+2576;BOX DRAWINGS LIGHT RIGHT;So;0;ON;;;;;N;FORMS LIGHT RIGHT;;;;
+2577;BOX DRAWINGS LIGHT DOWN;So;0;ON;;;;;N;FORMS LIGHT DOWN;;;;
+2578;BOX DRAWINGS HEAVY LEFT;So;0;ON;;;;;N;FORMS HEAVY LEFT;;;;
+2579;BOX DRAWINGS HEAVY UP;So;0;ON;;;;;N;FORMS HEAVY UP;;;;
+257A;BOX DRAWINGS HEAVY RIGHT;So;0;ON;;;;;N;FORMS HEAVY RIGHT;;;;
+257B;BOX DRAWINGS HEAVY DOWN;So;0;ON;;;;;N;FORMS HEAVY DOWN;;;;
+257C;BOX DRAWINGS LIGHT LEFT AND HEAVY RIGHT;So;0;ON;;;;;N;FORMS LIGHT LEFT AND HEAVY RIGHT;;;;
+257D;BOX DRAWINGS LIGHT UP AND HEAVY DOWN;So;0;ON;;;;;N;FORMS LIGHT UP AND HEAVY DOWN;;;;
+257E;BOX DRAWINGS HEAVY LEFT AND LIGHT RIGHT;So;0;ON;;;;;N;FORMS HEAVY LEFT AND LIGHT RIGHT;;;;
+257F;BOX DRAWINGS HEAVY UP AND LIGHT DOWN;So;0;ON;;;;;N;FORMS HEAVY UP AND LIGHT DOWN;;;;
+2580;UPPER HALF BLOCK;So;0;ON;;;;;N;;;;;
+2581;LOWER ONE EIGHTH BLOCK;So;0;ON;;;;;N;;;;;
+2582;LOWER ONE QUARTER BLOCK;So;0;ON;;;;;N;;;;;
+2583;LOWER THREE EIGHTHS BLOCK;So;0;ON;;;;;N;;;;;
+2584;LOWER HALF BLOCK;So;0;ON;;;;;N;;;;;
+2585;LOWER FIVE EIGHTHS BLOCK;So;0;ON;;;;;N;;;;;
+2586;LOWER THREE QUARTERS BLOCK;So;0;ON;;;;;N;LOWER THREE QUARTER BLOCK;;;;
+2587;LOWER SEVEN EIGHTHS BLOCK;So;0;ON;;;;;N;;;;;
+2588;FULL BLOCK;So;0;ON;;;;;N;;;;;
+2589;LEFT SEVEN EIGHTHS BLOCK;So;0;ON;;;;;N;;;;;
+258A;LEFT THREE QUARTERS BLOCK;So;0;ON;;;;;N;LEFT THREE QUARTER BLOCK;;;;
+258B;LEFT FIVE EIGHTHS BLOCK;So;0;ON;;;;;N;;;;;
+258C;LEFT HALF BLOCK;So;0;ON;;;;;N;;;;;
+258D;LEFT THREE EIGHTHS BLOCK;So;0;ON;;;;;N;;;;;
+258E;LEFT ONE QUARTER BLOCK;So;0;ON;;;;;N;;;;;
+258F;LEFT ONE EIGHTH BLOCK;So;0;ON;;;;;N;;;;;
+2590;RIGHT HALF BLOCK;So;0;ON;;;;;N;;;;;
+2591;LIGHT SHADE;So;0;ON;;;;;N;;;;;
+2592;MEDIUM SHADE;So;0;ON;;;;;N;;;;;
+2593;DARK SHADE;So;0;ON;;;;;N;;;;;
+2594;UPPER ONE EIGHTH BLOCK;So;0;ON;;;;;N;;;;;
+2595;RIGHT ONE EIGHTH BLOCK;So;0;ON;;;;;N;;;;;
+2596;QUADRANT LOWER LEFT;So;0;ON;;;;;N;;;;;
+2597;QUADRANT LOWER RIGHT;So;0;ON;;;;;N;;;;;
+2598;QUADRANT UPPER LEFT;So;0;ON;;;;;N;;;;;
+2599;QUADRANT UPPER LEFT AND LOWER LEFT AND LOWER RIGHT;So;0;ON;;;;;N;;;;;
+259A;QUADRANT UPPER LEFT AND LOWER RIGHT;So;0;ON;;;;;N;;;;;
+259B;QUADRANT UPPER LEFT AND UPPER RIGHT AND LOWER LEFT;So;0;ON;;;;;N;;;;;
+259C;QUADRANT UPPER LEFT AND UPPER RIGHT AND LOWER RIGHT;So;0;ON;;;;;N;;;;;
+259D;QUADRANT UPPER RIGHT;So;0;ON;;;;;N;;;;;
+259E;QUADRANT UPPER RIGHT AND LOWER LEFT;So;0;ON;;;;;N;;;;;
+259F;QUADRANT UPPER RIGHT AND LOWER LEFT AND LOWER RIGHT;So;0;ON;;;;;N;;;;;
+25A0;BLACK SQUARE;So;0;ON;;;;;N;;;;;
+25A1;WHITE SQUARE;So;0;ON;;;;;N;;;;;
+25A2;WHITE SQUARE WITH ROUNDED CORNERS;So;0;ON;;;;;N;;;;;
+25A3;WHITE SQUARE CONTAINING BLACK SMALL SQUARE;So;0;ON;;;;;N;;;;;
+25A4;SQUARE WITH HORIZONTAL FILL;So;0;ON;;;;;N;;;;;
+25A5;SQUARE WITH VERTICAL FILL;So;0;ON;;;;;N;;;;;
+25A6;SQUARE WITH ORTHOGONAL CROSSHATCH FILL;So;0;ON;;;;;N;;;;;
+25A7;SQUARE WITH UPPER LEFT TO LOWER RIGHT FILL;So;0;ON;;;;;N;;;;;
+25A8;SQUARE WITH UPPER RIGHT TO LOWER LEFT FILL;So;0;ON;;;;;N;;;;;
+25A9;SQUARE WITH DIAGONAL CROSSHATCH FILL;So;0;ON;;;;;N;;;;;
+25AA;BLACK SMALL SQUARE;So;0;ON;;;;;N;;;;;
+25AB;WHITE SMALL SQUARE;So;0;ON;;;;;N;;;;;
+25AC;BLACK RECTANGLE;So;0;ON;;;;;N;;;;;
+25AD;WHITE RECTANGLE;So;0;ON;;;;;N;;;;;
+25AE;BLACK VERTICAL RECTANGLE;So;0;ON;;;;;N;;;;;
+25AF;WHITE VERTICAL RECTANGLE;So;0;ON;;;;;N;;;;;
+25B0;BLACK PARALLELOGRAM;So;0;ON;;;;;N;;;;;
+25B1;WHITE PARALLELOGRAM;So;0;ON;;;;;N;;;;;
+25B2;BLACK UP-POINTING TRIANGLE;So;0;ON;;;;;N;BLACK UP POINTING TRIANGLE;;;;
+25B3;WHITE UP-POINTING TRIANGLE;So;0;ON;;;;;N;WHITE UP POINTING TRIANGLE;;;;
+25B4;BLACK UP-POINTING SMALL TRIANGLE;So;0;ON;;;;;N;BLACK UP POINTING SMALL TRIANGLE;;;;
+25B5;WHITE UP-POINTING SMALL TRIANGLE;So;0;ON;;;;;N;WHITE UP POINTING SMALL TRIANGLE;;;;
+25B6;BLACK RIGHT-POINTING TRIANGLE;So;0;ON;;;;;N;BLACK RIGHT POINTING TRIANGLE;;;;
+25B7;WHITE RIGHT-POINTING TRIANGLE;Sm;0;ON;;;;;N;WHITE RIGHT POINTING TRIANGLE;;;;
+25B8;BLACK RIGHT-POINTING SMALL TRIANGLE;So;0;ON;;;;;N;BLACK RIGHT POINTING SMALL TRIANGLE;;;;
+25B9;WHITE RIGHT-POINTING SMALL TRIANGLE;So;0;ON;;;;;N;WHITE RIGHT POINTING SMALL TRIANGLE;;;;
+25BA;BLACK RIGHT-POINTING POINTER;So;0;ON;;;;;N;BLACK RIGHT POINTING POINTER;;;;
+25BB;WHITE RIGHT-POINTING POINTER;So;0;ON;;;;;N;WHITE RIGHT POINTING POINTER;;;;
+25BC;BLACK DOWN-POINTING TRIANGLE;So;0;ON;;;;;N;BLACK DOWN POINTING TRIANGLE;;;;
+25BD;WHITE DOWN-POINTING TRIANGLE;So;0;ON;;;;;N;WHITE DOWN POINTING TRIANGLE;;;;
+25BE;BLACK DOWN-POINTING SMALL TRIANGLE;So;0;ON;;;;;N;BLACK DOWN POINTING SMALL TRIANGLE;;;;
+25BF;WHITE DOWN-POINTING SMALL TRIANGLE;So;0;ON;;;;;N;WHITE DOWN POINTING SMALL TRIANGLE;;;;
+25C0;BLACK LEFT-POINTING TRIANGLE;So;0;ON;;;;;N;BLACK LEFT POINTING TRIANGLE;;;;
+25C1;WHITE LEFT-POINTING TRIANGLE;Sm;0;ON;;;;;N;WHITE LEFT POINTING TRIANGLE;;;;
+25C2;BLACK LEFT-POINTING SMALL TRIANGLE;So;0;ON;;;;;N;BLACK LEFT POINTING SMALL TRIANGLE;;;;
+25C3;WHITE LEFT-POINTING SMALL TRIANGLE;So;0;ON;;;;;N;WHITE LEFT POINTING SMALL TRIANGLE;;;;
+25C4;BLACK LEFT-POINTING POINTER;So;0;ON;;;;;N;BLACK LEFT POINTING POINTER;;;;
+25C5;WHITE LEFT-POINTING POINTER;So;0;ON;;;;;N;WHITE LEFT POINTING POINTER;;;;
+25C6;BLACK DIAMOND;So;0;ON;;;;;N;;;;;
+25C7;WHITE DIAMOND;So;0;ON;;;;;N;;;;;
+25C8;WHITE DIAMOND CONTAINING BLACK SMALL DIAMOND;So;0;ON;;;;;N;;;;;
+25C9;FISHEYE;So;0;ON;;;;;N;;;;;
+25CA;LOZENGE;So;0;ON;;;;;N;;;;;
+25CB;WHITE CIRCLE;So;0;ON;;;;;N;;;;;
+25CC;DOTTED CIRCLE;So;0;ON;;;;;N;;;;;
+25CD;CIRCLE WITH VERTICAL FILL;So;0;ON;;;;;N;;;;;
+25CE;BULLSEYE;So;0;ON;;;;;N;;;;;
+25CF;BLACK CIRCLE;So;0;ON;;;;;N;;;;;
+25D0;CIRCLE WITH LEFT HALF BLACK;So;0;ON;;;;;N;;;;;
+25D1;CIRCLE WITH RIGHT HALF BLACK;So;0;ON;;;;;N;;;;;
+25D2;CIRCLE WITH LOWER HALF BLACK;So;0;ON;;;;;N;;;;;
+25D3;CIRCLE WITH UPPER HALF BLACK;So;0;ON;;;;;N;;;;;
+25D4;CIRCLE WITH UPPER RIGHT QUADRANT BLACK;So;0;ON;;;;;N;;;;;
+25D5;CIRCLE WITH ALL BUT UPPER LEFT QUADRANT BLACK;So;0;ON;;;;;N;;;;;
+25D6;LEFT HALF BLACK CIRCLE;So;0;ON;;;;;N;;;;;
+25D7;RIGHT HALF BLACK CIRCLE;So;0;ON;;;;;N;;;;;
+25D8;INVERSE BULLET;So;0;ON;;;;;N;;;;;
+25D9;INVERSE WHITE CIRCLE;So;0;ON;;;;;N;;;;;
+25DA;UPPER HALF INVERSE WHITE CIRCLE;So;0;ON;;;;;N;;;;;
+25DB;LOWER HALF INVERSE WHITE CIRCLE;So;0;ON;;;;;N;;;;;
+25DC;UPPER LEFT QUADRANT CIRCULAR ARC;So;0;ON;;;;;N;;;;;
+25DD;UPPER RIGHT QUADRANT CIRCULAR ARC;So;0;ON;;;;;N;;;;;
+25DE;LOWER RIGHT QUADRANT CIRCULAR ARC;So;0;ON;;;;;N;;;;;
+25DF;LOWER LEFT QUADRANT CIRCULAR ARC;So;0;ON;;;;;N;;;;;
+25E0;UPPER HALF CIRCLE;So;0;ON;;;;;N;;;;;
+25E1;LOWER HALF CIRCLE;So;0;ON;;;;;N;;;;;
+25E2;BLACK LOWER RIGHT TRIANGLE;So;0;ON;;;;;N;;;;;
+25E3;BLACK LOWER LEFT TRIANGLE;So;0;ON;;;;;N;;;;;
+25E4;BLACK UPPER LEFT TRIANGLE;So;0;ON;;;;;N;;;;;
+25E5;BLACK UPPER RIGHT TRIANGLE;So;0;ON;;;;;N;;;;;
+25E6;WHITE BULLET;So;0;ON;;;;;N;;;;;
+25E7;SQUARE WITH LEFT HALF BLACK;So;0;ON;;;;;N;;;;;
+25E8;SQUARE WITH RIGHT HALF BLACK;So;0;ON;;;;;N;;;;;
+25E9;SQUARE WITH UPPER LEFT DIAGONAL HALF BLACK;So;0;ON;;;;;N;;;;;
+25EA;SQUARE WITH LOWER RIGHT DIAGONAL HALF BLACK;So;0;ON;;;;;N;;;;;
+25EB;WHITE SQUARE WITH VERTICAL BISECTING LINE;So;0;ON;;;;;N;;;;;
+25EC;WHITE UP-POINTING TRIANGLE WITH DOT;So;0;ON;;;;;N;WHITE UP POINTING TRIANGLE WITH DOT;;;;
+25ED;UP-POINTING TRIANGLE WITH LEFT HALF BLACK;So;0;ON;;;;;N;UP POINTING TRIANGLE WITH LEFT HALF BLACK;;;;
+25EE;UP-POINTING TRIANGLE WITH RIGHT HALF BLACK;So;0;ON;;;;;N;UP POINTING TRIANGLE WITH RIGHT HALF BLACK;;;;
+25EF;LARGE CIRCLE;So;0;ON;;;;;N;;;;;
+25F0;WHITE SQUARE WITH UPPER LEFT QUADRANT;So;0;ON;;;;;N;;;;;
+25F1;WHITE SQUARE WITH LOWER LEFT QUADRANT;So;0;ON;;;;;N;;;;;
+25F2;WHITE SQUARE WITH LOWER RIGHT QUADRANT;So;0;ON;;;;;N;;;;;
+25F3;WHITE SQUARE WITH UPPER RIGHT QUADRANT;So;0;ON;;;;;N;;;;;
+25F4;WHITE CIRCLE WITH UPPER LEFT QUADRANT;So;0;ON;;;;;N;;;;;
+25F5;WHITE CIRCLE WITH LOWER LEFT QUADRANT;So;0;ON;;;;;N;;;;;
+25F6;WHITE CIRCLE WITH LOWER RIGHT QUADRANT;So;0;ON;;;;;N;;;;;
+25F7;WHITE CIRCLE WITH UPPER RIGHT QUADRANT;So;0;ON;;;;;N;;;;;
+25F8;UPPER LEFT TRIANGLE;Sm;0;ON;;;;;N;;;;;
+25F9;UPPER RIGHT TRIANGLE;Sm;0;ON;;;;;N;;;;;
+25FA;LOWER LEFT TRIANGLE;Sm;0;ON;;;;;N;;;;;
+25FB;WHITE MEDIUM SQUARE;Sm;0;ON;;;;;N;;;;;
+25FC;BLACK MEDIUM SQUARE;Sm;0;ON;;;;;N;;;;;
+25FD;WHITE MEDIUM SMALL SQUARE;Sm;0;ON;;;;;N;;;;;
+25FE;BLACK MEDIUM SMALL SQUARE;Sm;0;ON;;;;;N;;;;;
+25FF;LOWER RIGHT TRIANGLE;Sm;0;ON;;;;;N;;;;;
+2600;BLACK SUN WITH RAYS;So;0;ON;;;;;N;;;;;
+2601;CLOUD;So;0;ON;;;;;N;;;;;
+2602;UMBRELLA;So;0;ON;;;;;N;;;;;
+2603;SNOWMAN;So;0;ON;;;;;N;;;;;
+2604;COMET;So;0;ON;;;;;N;;;;;
+2605;BLACK STAR;So;0;ON;;;;;N;;;;;
+2606;WHITE STAR;So;0;ON;;;;;N;;;;;
+2607;LIGHTNING;So;0;ON;;;;;N;;;;;
+2608;THUNDERSTORM;So;0;ON;;;;;N;;;;;
+2609;SUN;So;0;ON;;;;;N;;;;;
+260A;ASCENDING NODE;So;0;ON;;;;;N;;;;;
+260B;DESCENDING NODE;So;0;ON;;;;;N;;;;;
+260C;CONJUNCTION;So;0;ON;;;;;N;;;;;
+260D;OPPOSITION;So;0;ON;;;;;N;;;;;
+260E;BLACK TELEPHONE;So;0;ON;;;;;N;;;;;
+260F;WHITE TELEPHONE;So;0;ON;;;;;N;;;;;
+2610;BALLOT BOX;So;0;ON;;;;;N;;;;;
+2611;BALLOT BOX WITH CHECK;So;0;ON;;;;;N;;;;;
+2612;BALLOT BOX WITH X;So;0;ON;;;;;N;;;;;
+2613;SALTIRE;So;0;ON;;;;;N;;;;;
+2614;UMBRELLA WITH RAIN DROPS;So;0;ON;;;;;N;;;;;
+2615;HOT BEVERAGE;So;0;ON;;;;;N;;;;;
+2616;WHITE SHOGI PIECE;So;0;ON;;;;;N;;;;;
+2617;BLACK SHOGI PIECE;So;0;ON;;;;;N;;;;;
+2618;SHAMROCK;So;0;ON;;;;;N;;;;;
+2619;REVERSED ROTATED FLORAL HEART BULLET;So;0;ON;;;;;N;;;;;
+261A;BLACK LEFT POINTING INDEX;So;0;ON;;;;;N;;;;;
+261B;BLACK RIGHT POINTING INDEX;So;0;ON;;;;;N;;;;;
+261C;WHITE LEFT POINTING INDEX;So;0;ON;;;;;N;;;;;
+261D;WHITE UP POINTING INDEX;So;0;ON;;;;;N;;;;;
+261E;WHITE RIGHT POINTING INDEX;So;0;ON;;;;;N;;;;;
+261F;WHITE DOWN POINTING INDEX;So;0;ON;;;;;N;;;;;
+2620;SKULL AND CROSSBONES;So;0;ON;;;;;N;;;;;
+2621;CAUTION SIGN;So;0;ON;;;;;N;;;;;
+2622;RADIOACTIVE SIGN;So;0;ON;;;;;N;;;;;
+2623;BIOHAZARD SIGN;So;0;ON;;;;;N;;;;;
+2624;CADUCEUS;So;0;ON;;;;;N;;;;;
+2625;ANKH;So;0;ON;;;;;N;;;;;
+2626;ORTHODOX CROSS;So;0;ON;;;;;N;;;;;
+2627;CHI RHO;So;0;ON;;;;;N;;;;;
+2628;CROSS OF LORRAINE;So;0;ON;;;;;N;;;;;
+2629;CROSS OF JERUSALEM;So;0;ON;;;;;N;;;;;
+262A;STAR AND CRESCENT;So;0;ON;;;;;N;;;;;
+262B;FARSI SYMBOL;So;0;ON;;;;;N;SYMBOL OF IRAN;;;;
+262C;ADI SHAKTI;So;0;ON;;;;;N;;;;;
+262D;HAMMER AND SICKLE;So;0;ON;;;;;N;;;;;
+262E;PEACE SYMBOL;So;0;ON;;;;;N;;;;;
+262F;YIN YANG;So;0;ON;;;;;N;;;;;
+2630;TRIGRAM FOR HEAVEN;So;0;ON;;;;;N;;;;;
+2631;TRIGRAM FOR LAKE;So;0;ON;;;;;N;;;;;
+2632;TRIGRAM FOR FIRE;So;0;ON;;;;;N;;;;;
+2633;TRIGRAM FOR THUNDER;So;0;ON;;;;;N;;;;;
+2634;TRIGRAM FOR WIND;So;0;ON;;;;;N;;;;;
+2635;TRIGRAM FOR WATER;So;0;ON;;;;;N;;;;;
+2636;TRIGRAM FOR MOUNTAIN;So;0;ON;;;;;N;;;;;
+2637;TRIGRAM FOR EARTH;So;0;ON;;;;;N;;;;;
+2638;WHEEL OF DHARMA;So;0;ON;;;;;N;;;;;
+2639;WHITE FROWNING FACE;So;0;ON;;;;;N;;;;;
+263A;WHITE SMILING FACE;So;0;ON;;;;;N;;;;;
+263B;BLACK SMILING FACE;So;0;ON;;;;;N;;;;;
+263C;WHITE SUN WITH RAYS;So;0;ON;;;;;N;;;;;
+263D;FIRST QUARTER MOON;So;0;ON;;;;;N;;;;;
+263E;LAST QUARTER MOON;So;0;ON;;;;;N;;;;;
+263F;MERCURY;So;0;ON;;;;;N;;;;;
+2640;FEMALE SIGN;So;0;ON;;;;;N;;;;;
+2641;EARTH;So;0;ON;;;;;N;;;;;
+2642;MALE SIGN;So;0;ON;;;;;N;;;;;
+2643;JUPITER;So;0;ON;;;;;N;;;;;
+2644;SATURN;So;0;ON;;;;;N;;;;;
+2645;URANUS;So;0;ON;;;;;N;;;;;
+2646;NEPTUNE;So;0;ON;;;;;N;;;;;
+2647;PLUTO;So;0;ON;;;;;N;;;;;
+2648;ARIES;So;0;ON;;;;;N;;;;;
+2649;TAURUS;So;0;ON;;;;;N;;;;;
+264A;GEMINI;So;0;ON;;;;;N;;;;;
+264B;CANCER;So;0;ON;;;;;N;;;;;
+264C;LEO;So;0;ON;;;;;N;;;;;
+264D;VIRGO;So;0;ON;;;;;N;;;;;
+264E;LIBRA;So;0;ON;;;;;N;;;;;
+264F;SCORPIUS;So;0;ON;;;;;N;;;;;
+2650;SAGITTARIUS;So;0;ON;;;;;N;;;;;
+2651;CAPRICORN;So;0;ON;;;;;N;;;;;
+2652;AQUARIUS;So;0;ON;;;;;N;;;;;
+2653;PISCES;So;0;ON;;;;;N;;;;;
+2654;WHITE CHESS KING;So;0;ON;;;;;N;;;;;
+2655;WHITE CHESS QUEEN;So;0;ON;;;;;N;;;;;
+2656;WHITE CHESS ROOK;So;0;ON;;;;;N;;;;;
+2657;WHITE CHESS BISHOP;So;0;ON;;;;;N;;;;;
+2658;WHITE CHESS KNIGHT;So;0;ON;;;;;N;;;;;
+2659;WHITE CHESS PAWN;So;0;ON;;;;;N;;;;;
+265A;BLACK CHESS KING;So;0;ON;;;;;N;;;;;
+265B;BLACK CHESS QUEEN;So;0;ON;;;;;N;;;;;
+265C;BLACK CHESS ROOK;So;0;ON;;;;;N;;;;;
+265D;BLACK CHESS BISHOP;So;0;ON;;;;;N;;;;;
+265E;BLACK CHESS KNIGHT;So;0;ON;;;;;N;;;;;
+265F;BLACK CHESS PAWN;So;0;ON;;;;;N;;;;;
+2660;BLACK SPADE SUIT;So;0;ON;;;;;N;;;;;
+2661;WHITE HEART SUIT;So;0;ON;;;;;N;;;;;
+2662;WHITE DIAMOND SUIT;So;0;ON;;;;;N;;;;;
+2663;BLACK CLUB SUIT;So;0;ON;;;;;N;;;;;
+2664;WHITE SPADE SUIT;So;0;ON;;;;;N;;;;;
+2665;BLACK HEART SUIT;So;0;ON;;;;;N;;;;;
+2666;BLACK DIAMOND SUIT;So;0;ON;;;;;N;;;;;
+2667;WHITE CLUB SUIT;So;0;ON;;;;;N;;;;;
+2668;HOT SPRINGS;So;0;ON;;;;;N;;;;;
+2669;QUARTER NOTE;So;0;ON;;;;;N;;;;;
+266A;EIGHTH NOTE;So;0;ON;;;;;N;;;;;
+266B;BEAMED EIGHTH NOTES;So;0;ON;;;;;N;BARRED EIGHTH NOTES;;;;
+266C;BEAMED SIXTEENTH NOTES;So;0;ON;;;;;N;BARRED SIXTEENTH NOTES;;;;
+266D;MUSIC FLAT SIGN;So;0;ON;;;;;N;FLAT;;;;
+266E;MUSIC NATURAL SIGN;So;0;ON;;;;;N;NATURAL;;;;
+266F;MUSIC SHARP SIGN;Sm;0;ON;;;;;N;SHARP;;;;
+2670;WEST SYRIAC CROSS;So;0;ON;;;;;N;;;;;
+2671;EAST SYRIAC CROSS;So;0;ON;;;;;N;;;;;
+2672;UNIVERSAL RECYCLING SYMBOL;So;0;ON;;;;;N;;;;;
+2673;RECYCLING SYMBOL FOR TYPE-1 PLASTICS;So;0;ON;;;;;N;;;;;
+2674;RECYCLING SYMBOL FOR TYPE-2 PLASTICS;So;0;ON;;;;;N;;;;;
+2675;RECYCLING SYMBOL FOR TYPE-3 PLASTICS;So;0;ON;;;;;N;;;;;
+2676;RECYCLING SYMBOL FOR TYPE-4 PLASTICS;So;0;ON;;;;;N;;;;;
+2677;RECYCLING SYMBOL FOR TYPE-5 PLASTICS;So;0;ON;;;;;N;;;;;
+2678;RECYCLING SYMBOL FOR TYPE-6 PLASTICS;So;0;ON;;;;;N;;;;;
+2679;RECYCLING SYMBOL FOR TYPE-7 PLASTICS;So;0;ON;;;;;N;;;;;
+267A;RECYCLING SYMBOL FOR GENERIC MATERIALS;So;0;ON;;;;;N;;;;;
+267B;BLACK UNIVERSAL RECYCLING SYMBOL;So;0;ON;;;;;N;;;;;
+267C;RECYCLED PAPER SYMBOL;So;0;ON;;;;;N;;;;;
+267D;PARTIALLY-RECYCLED PAPER SYMBOL;So;0;ON;;;;;N;;;;;
+267E;PERMANENT PAPER SIGN;So;0;ON;;;;;N;;;;;
+267F;WHEELCHAIR SYMBOL;So;0;ON;;;;;N;;;;;
+2680;DIE FACE-1;So;0;ON;;;;;N;;;;;
+2681;DIE FACE-2;So;0;ON;;;;;N;;;;;
+2682;DIE FACE-3;So;0;ON;;;;;N;;;;;
+2683;DIE FACE-4;So;0;ON;;;;;N;;;;;
+2684;DIE FACE-5;So;0;ON;;;;;N;;;;;
+2685;DIE FACE-6;So;0;ON;;;;;N;;;;;
+2686;WHITE CIRCLE WITH DOT RIGHT;So;0;ON;;;;;N;;;;;
+2687;WHITE CIRCLE WITH TWO DOTS;So;0;ON;;;;;N;;;;;
+2688;BLACK CIRCLE WITH WHITE DOT RIGHT;So;0;ON;;;;;N;;;;;
+2689;BLACK CIRCLE WITH TWO WHITE DOTS;So;0;ON;;;;;N;;;;;
+268A;MONOGRAM FOR YANG;So;0;ON;;;;;N;;;;;
+268B;MONOGRAM FOR YIN;So;0;ON;;;;;N;;;;;
+268C;DIGRAM FOR GREATER YANG;So;0;ON;;;;;N;;;;;
+268D;DIGRAM FOR LESSER YIN;So;0;ON;;;;;N;;;;;
+268E;DIGRAM FOR LESSER YANG;So;0;ON;;;;;N;;;;;
+268F;DIGRAM FOR GREATER YIN;So;0;ON;;;;;N;;;;;
+2690;WHITE FLAG;So;0;ON;;;;;N;;;;;
+2691;BLACK FLAG;So;0;ON;;;;;N;;;;;
+2692;HAMMER AND PICK;So;0;ON;;;;;N;;;;;
+2693;ANCHOR;So;0;ON;;;;;N;;;;;
+2694;CROSSED SWORDS;So;0;ON;;;;;N;;;;;
+2695;STAFF OF AESCULAPIUS;So;0;ON;;;;;N;;;;;
+2696;SCALES;So;0;ON;;;;;N;;;;;
+2697;ALEMBIC;So;0;ON;;;;;N;;;;;
+2698;FLOWER;So;0;ON;;;;;N;;;;;
+2699;GEAR;So;0;ON;;;;;N;;;;;
+269A;STAFF OF HERMES;So;0;ON;;;;;N;;;;;
+269B;ATOM SYMBOL;So;0;ON;;;;;N;;;;;
+269C;FLEUR-DE-LIS;So;0;ON;;;;;N;;;;;
+269D;OUTLINED WHITE STAR;So;0;ON;;;;;N;;;;;
+269E;THREE LINES CONVERGING RIGHT;So;0;ON;;;;;N;;;;;
+269F;THREE LINES CONVERGING LEFT;So;0;ON;;;;;N;;;;;
+26A0;WARNING SIGN;So;0;ON;;;;;N;;;;;
+26A1;HIGH VOLTAGE SIGN;So;0;ON;;;;;N;;;;;
+26A2;DOUBLED FEMALE SIGN;So;0;ON;;;;;N;;;;;
+26A3;DOUBLED MALE SIGN;So;0;ON;;;;;N;;;;;
+26A4;INTERLOCKED FEMALE AND MALE SIGN;So;0;ON;;;;;N;;;;;
+26A5;MALE AND FEMALE SIGN;So;0;ON;;;;;N;;;;;
+26A6;MALE WITH STROKE SIGN;So;0;ON;;;;;N;;;;;
+26A7;MALE WITH STROKE AND MALE AND FEMALE SIGN;So;0;ON;;;;;N;;;;;
+26A8;VERTICAL MALE WITH STROKE SIGN;So;0;ON;;;;;N;;;;;
+26A9;HORIZONTAL MALE WITH STROKE SIGN;So;0;ON;;;;;N;;;;;
+26AA;MEDIUM WHITE CIRCLE;So;0;ON;;;;;N;;;;;
+26AB;MEDIUM BLACK CIRCLE;So;0;ON;;;;;N;;;;;
+26AC;MEDIUM SMALL WHITE CIRCLE;So;0;L;;;;;N;;;;;
+26AD;MARRIAGE SYMBOL;So;0;ON;;;;;N;;;;;
+26AE;DIVORCE SYMBOL;So;0;ON;;;;;N;;;;;
+26AF;UNMARRIED PARTNERSHIP SYMBOL;So;0;ON;;;;;N;;;;;
+26B0;COFFIN;So;0;ON;;;;;N;;;;;
+26B1;FUNERAL URN;So;0;ON;;;;;N;;;;;
+26B2;NEUTER;So;0;ON;;;;;N;;;;;
+26B3;CERES;So;0;ON;;;;;N;;;;;
+26B4;PALLAS;So;0;ON;;;;;N;;;;;
+26B5;JUNO;So;0;ON;;;;;N;;;;;
+26B6;VESTA;So;0;ON;;;;;N;;;;;
+26B7;CHIRON;So;0;ON;;;;;N;;;;;
+26B8;BLACK MOON LILITH;So;0;ON;;;;;N;;;;;
+26B9;SEXTILE;So;0;ON;;;;;N;;;;;
+26BA;SEMISEXTILE;So;0;ON;;;;;N;;;;;
+26BB;QUINCUNX;So;0;ON;;;;;N;;;;;
+26BC;SESQUIQUADRATE;So;0;ON;;;;;N;;;;;
+26BD;SOCCER BALL;So;0;ON;;;;;N;;;;;
+26BE;BASEBALL;So;0;ON;;;;;N;;;;;
+26BF;SQUARED KEY;So;0;ON;;;;;N;;;;;
+26C0;WHITE DRAUGHTS MAN;So;0;ON;;;;;N;;;;;
+26C1;WHITE DRAUGHTS KING;So;0;ON;;;;;N;;;;;
+26C2;BLACK DRAUGHTS MAN;So;0;ON;;;;;N;;;;;
+26C3;BLACK DRAUGHTS KING;So;0;ON;;;;;N;;;;;
+26C4;SNOWMAN WITHOUT SNOW;So;0;ON;;;;;N;;;;;
+26C5;SUN BEHIND CLOUD;So;0;ON;;;;;N;;;;;
+26C6;RAIN;So;0;ON;;;;;N;;;;;
+26C7;BLACK SNOWMAN;So;0;ON;;;;;N;;;;;
+26C8;THUNDER CLOUD AND RAIN;So;0;ON;;;;;N;;;;;
+26C9;TURNED WHITE SHOGI PIECE;So;0;ON;;;;;N;;;;;
+26CA;TURNED BLACK SHOGI PIECE;So;0;ON;;;;;N;;;;;
+26CB;WHITE DIAMOND IN SQUARE;So;0;ON;;;;;N;;;;;
+26CC;CROSSING LANES;So;0;ON;;;;;N;;;;;
+26CD;DISABLED CAR;So;0;ON;;;;;N;;;;;
+26CE;OPHIUCHUS;So;0;ON;;;;;N;;;;;
+26CF;PICK;So;0;ON;;;;;N;;;;;
+26D0;CAR SLIDING;So;0;ON;;;;;N;;;;;
+26D1;HELMET WITH WHITE CROSS;So;0;ON;;;;;N;;;;;
+26D2;CIRCLED CROSSING LANES;So;0;ON;;;;;N;;;;;
+26D3;CHAINS;So;0;ON;;;;;N;;;;;
+26D4;NO ENTRY;So;0;ON;;;;;N;;;;;
+26D5;ALTERNATE ONE-WAY LEFT WAY TRAFFIC;So;0;ON;;;;;N;;;;;
+26D6;BLACK TWO-WAY LEFT WAY TRAFFIC;So;0;ON;;;;;N;;;;;
+26D7;WHITE TWO-WAY LEFT WAY TRAFFIC;So;0;ON;;;;;N;;;;;
+26D8;BLACK LEFT LANE MERGE;So;0;ON;;;;;N;;;;;
+26D9;WHITE LEFT LANE MERGE;So;0;ON;;;;;N;;;;;
+26DA;DRIVE SLOW SIGN;So;0;ON;;;;;N;;;;;
+26DB;HEAVY WHITE DOWN-POINTING TRIANGLE;So;0;ON;;;;;N;;;;;
+26DC;LEFT CLOSED ENTRY;So;0;ON;;;;;N;;;;;
+26DD;SQUARED SALTIRE;So;0;ON;;;;;N;;;;;
+26DE;FALLING DIAGONAL IN WHITE CIRCLE IN BLACK SQUARE;So;0;ON;;;;;N;;;;;
+26DF;BLACK TRUCK;So;0;ON;;;;;N;;;;;
+26E0;RESTRICTED LEFT ENTRY-1;So;0;ON;;;;;N;;;;;
+26E1;RESTRICTED LEFT ENTRY-2;So;0;ON;;;;;N;;;;;
+26E2;ASTRONOMICAL SYMBOL FOR URANUS;So;0;ON;;;;;N;;;;;
+26E3;HEAVY CIRCLE WITH STROKE AND TWO DOTS ABOVE;So;0;ON;;;;;N;;;;;
+26E4;PENTAGRAM;So;0;ON;;;;;N;;;;;
+26E5;RIGHT-HANDED INTERLACED PENTAGRAM;So;0;ON;;;;;N;;;;;
+26E6;LEFT-HANDED INTERLACED PENTAGRAM;So;0;ON;;;;;N;;;;;
+26E7;INVERTED PENTAGRAM;So;0;ON;;;;;N;;;;;
+26E8;BLACK CROSS ON SHIELD;So;0;ON;;;;;N;;;;;
+26E9;SHINTO SHRINE;So;0;ON;;;;;N;;;;;
+26EA;CHURCH;So;0;ON;;;;;N;;;;;
+26EB;CASTLE;So;0;ON;;;;;N;;;;;
+26EC;HISTORIC SITE;So;0;ON;;;;;N;;;;;
+26ED;GEAR WITHOUT HUB;So;0;ON;;;;;N;;;;;
+26EE;GEAR WITH HANDLES;So;0;ON;;;;;N;;;;;
+26EF;MAP SYMBOL FOR LIGHTHOUSE;So;0;ON;;;;;N;;;;;
+26F0;MOUNTAIN;So;0;ON;;;;;N;;;;;
+26F1;UMBRELLA ON GROUND;So;0;ON;;;;;N;;;;;
+26F2;FOUNTAIN;So;0;ON;;;;;N;;;;;
+26F3;FLAG IN HOLE;So;0;ON;;;;;N;;;;;
+26F4;FERRY;So;0;ON;;;;;N;;;;;
+26F5;SAILBOAT;So;0;ON;;;;;N;;;;;
+26F6;SQUARE FOUR CORNERS;So;0;ON;;;;;N;;;;;
+26F7;SKIER;So;0;ON;;;;;N;;;;;
+26F8;ICE SKATE;So;0;ON;;;;;N;;;;;
+26F9;PERSON WITH BALL;So;0;ON;;;;;N;;;;;
+26FA;TENT;So;0;ON;;;;;N;;;;;
+26FB;JAPANESE BANK SYMBOL;So;0;ON;;;;;N;;;;;
+26FC;HEADSTONE GRAVEYARD SYMBOL;So;0;ON;;;;;N;;;;;
+26FD;FUEL PUMP;So;0;ON;;;;;N;;;;;
+26FE;CUP ON BLACK SQUARE;So;0;ON;;;;;N;;;;;
+26FF;WHITE FLAG WITH HORIZONTAL MIDDLE BLACK STRIPE;So;0;ON;;;;;N;;;;;
+2700;BLACK SAFETY SCISSORS;So;0;ON;;;;;N;;;;;
+2701;UPPER BLADE SCISSORS;So;0;ON;;;;;N;;;;;
+2702;BLACK SCISSORS;So;0;ON;;;;;N;;;;;
+2703;LOWER BLADE SCISSORS;So;0;ON;;;;;N;;;;;
+2704;WHITE SCISSORS;So;0;ON;;;;;N;;;;;
+2705;WHITE HEAVY CHECK MARK;So;0;ON;;;;;N;;;;;
+2706;TELEPHONE LOCATION SIGN;So;0;ON;;;;;N;;;;;
+2707;TAPE DRIVE;So;0;ON;;;;;N;;;;;
+2708;AIRPLANE;So;0;ON;;;;;N;;;;;
+2709;ENVELOPE;So;0;ON;;;;;N;;;;;
+270A;RAISED FIST;So;0;ON;;;;;N;;;;;
+270B;RAISED HAND;So;0;ON;;;;;N;;;;;
+270C;VICTORY HAND;So;0;ON;;;;;N;;;;;
+270D;WRITING HAND;So;0;ON;;;;;N;;;;;
+270E;LOWER RIGHT PENCIL;So;0;ON;;;;;N;;;;;
+270F;PENCIL;So;0;ON;;;;;N;;;;;
+2710;UPPER RIGHT PENCIL;So;0;ON;;;;;N;;;;;
+2711;WHITE NIB;So;0;ON;;;;;N;;;;;
+2712;BLACK NIB;So;0;ON;;;;;N;;;;;
+2713;CHECK MARK;So;0;ON;;;;;N;;;;;
+2714;HEAVY CHECK MARK;So;0;ON;;;;;N;;;;;
+2715;MULTIPLICATION X;So;0;ON;;;;;N;;;;;
+2716;HEAVY MULTIPLICATION X;So;0;ON;;;;;N;;;;;
+2717;BALLOT X;So;0;ON;;;;;N;;;;;
+2718;HEAVY BALLOT X;So;0;ON;;;;;N;;;;;
+2719;OUTLINED GREEK CROSS;So;0;ON;;;;;N;;;;;
+271A;HEAVY GREEK CROSS;So;0;ON;;;;;N;;;;;
+271B;OPEN CENTRE CROSS;So;0;ON;;;;;N;OPEN CENTER CROSS;;;;
+271C;HEAVY OPEN CENTRE CROSS;So;0;ON;;;;;N;HEAVY OPEN CENTER CROSS;;;;
+271D;LATIN CROSS;So;0;ON;;;;;N;;;;;
+271E;SHADOWED WHITE LATIN CROSS;So;0;ON;;;;;N;;;;;
+271F;OUTLINED LATIN CROSS;So;0;ON;;;;;N;;;;;
+2720;MALTESE CROSS;So;0;ON;;;;;N;;;;;
+2721;STAR OF DAVID;So;0;ON;;;;;N;;;;;
+2722;FOUR TEARDROP-SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+2723;FOUR BALLOON-SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+2724;HEAVY FOUR BALLOON-SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+2725;FOUR CLUB-SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+2726;BLACK FOUR POINTED STAR;So;0;ON;;;;;N;;;;;
+2727;WHITE FOUR POINTED STAR;So;0;ON;;;;;N;;;;;
+2728;SPARKLES;So;0;ON;;;;;N;;;;;
+2729;STRESS OUTLINED WHITE STAR;So;0;ON;;;;;N;;;;;
+272A;CIRCLED WHITE STAR;So;0;ON;;;;;N;;;;;
+272B;OPEN CENTRE BLACK STAR;So;0;ON;;;;;N;OPEN CENTER BLACK STAR;;;;
+272C;BLACK CENTRE WHITE STAR;So;0;ON;;;;;N;BLACK CENTER WHITE STAR;;;;
+272D;OUTLINED BLACK STAR;So;0;ON;;;;;N;;;;;
+272E;HEAVY OUTLINED BLACK STAR;So;0;ON;;;;;N;;;;;
+272F;PINWHEEL STAR;So;0;ON;;;;;N;;;;;
+2730;SHADOWED WHITE STAR;So;0;ON;;;;;N;;;;;
+2731;HEAVY ASTERISK;So;0;ON;;;;;N;;;;;
+2732;OPEN CENTRE ASTERISK;So;0;ON;;;;;N;OPEN CENTER ASTERISK;;;;
+2733;EIGHT SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+2734;EIGHT POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+2735;EIGHT POINTED PINWHEEL STAR;So;0;ON;;;;;N;;;;;
+2736;SIX POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+2737;EIGHT POINTED RECTILINEAR BLACK STAR;So;0;ON;;;;;N;;;;;
+2738;HEAVY EIGHT POINTED RECTILINEAR BLACK STAR;So;0;ON;;;;;N;;;;;
+2739;TWELVE POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+273A;SIXTEEN POINTED ASTERISK;So;0;ON;;;;;N;;;;;
+273B;TEARDROP-SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+273C;OPEN CENTRE TEARDROP-SPOKED ASTERISK;So;0;ON;;;;;N;OPEN CENTER TEARDROP-SPOKED ASTERISK;;;;
+273D;HEAVY TEARDROP-SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+273E;SIX PETALLED BLACK AND WHITE FLORETTE;So;0;ON;;;;;N;;;;;
+273F;BLACK FLORETTE;So;0;ON;;;;;N;;;;;
+2740;WHITE FLORETTE;So;0;ON;;;;;N;;;;;
+2741;EIGHT PETALLED OUTLINED BLACK FLORETTE;So;0;ON;;;;;N;;;;;
+2742;CIRCLED OPEN CENTRE EIGHT POINTED STAR;So;0;ON;;;;;N;CIRCLED OPEN CENTER EIGHT POINTED STAR;;;;
+2743;HEAVY TEARDROP-SPOKED PINWHEEL ASTERISK;So;0;ON;;;;;N;;;;;
+2744;SNOWFLAKE;So;0;ON;;;;;N;;;;;
+2745;TIGHT TRIFOLIATE SNOWFLAKE;So;0;ON;;;;;N;;;;;
+2746;HEAVY CHEVRON SNOWFLAKE;So;0;ON;;;;;N;;;;;
+2747;SPARKLE;So;0;ON;;;;;N;;;;;
+2748;HEAVY SPARKLE;So;0;ON;;;;;N;;;;;
+2749;BALLOON-SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+274A;EIGHT TEARDROP-SPOKED PROPELLER ASTERISK;So;0;ON;;;;;N;;;;;
+274B;HEAVY EIGHT TEARDROP-SPOKED PROPELLER ASTERISK;So;0;ON;;;;;N;;;;;
+274C;CROSS MARK;So;0;ON;;;;;N;;;;;
+274D;SHADOWED WHITE CIRCLE;So;0;ON;;;;;N;;;;;
+274E;NEGATIVE SQUARED CROSS MARK;So;0;ON;;;;;N;;;;;
+274F;LOWER RIGHT DROP-SHADOWED WHITE SQUARE;So;0;ON;;;;;N;;;;;
+2750;UPPER RIGHT DROP-SHADOWED WHITE SQUARE;So;0;ON;;;;;N;;;;;
+2751;LOWER RIGHT SHADOWED WHITE SQUARE;So;0;ON;;;;;N;;;;;
+2752;UPPER RIGHT SHADOWED WHITE SQUARE;So;0;ON;;;;;N;;;;;
+2753;BLACK QUESTION MARK ORNAMENT;So;0;ON;;;;;N;;;;;
+2754;WHITE QUESTION MARK ORNAMENT;So;0;ON;;;;;N;;;;;
+2755;WHITE EXCLAMATION MARK ORNAMENT;So;0;ON;;;;;N;;;;;
+2756;BLACK DIAMOND MINUS WHITE X;So;0;ON;;;;;N;;;;;
+2757;HEAVY EXCLAMATION MARK SYMBOL;So;0;ON;;;;;N;;;;;
+2758;LIGHT VERTICAL BAR;So;0;ON;;;;;N;;;;;
+2759;MEDIUM VERTICAL BAR;So;0;ON;;;;;N;;;;;
+275A;HEAVY VERTICAL BAR;So;0;ON;;;;;N;;;;;
+275B;HEAVY SINGLE TURNED COMMA QUOTATION MARK ORNAMENT;So;0;ON;;;;;N;;;;;
+275C;HEAVY SINGLE COMMA QUOTATION MARK ORNAMENT;So;0;ON;;;;;N;;;;;
+275D;HEAVY DOUBLE TURNED COMMA QUOTATION MARK ORNAMENT;So;0;ON;;;;;N;;;;;
+275E;HEAVY DOUBLE COMMA QUOTATION MARK ORNAMENT;So;0;ON;;;;;N;;;;;
+275F;HEAVY LOW SINGLE COMMA QUOTATION MARK ORNAMENT;So;0;ON;;;;;N;;;;;
+2760;HEAVY LOW DOUBLE COMMA QUOTATION MARK ORNAMENT;So;0;ON;;;;;N;;;;;
+2761;CURVED STEM PARAGRAPH SIGN ORNAMENT;So;0;ON;;;;;N;;;;;
+2762;HEAVY EXCLAMATION MARK ORNAMENT;So;0;ON;;;;;N;;;;;
+2763;HEAVY HEART EXCLAMATION MARK ORNAMENT;So;0;ON;;;;;N;;;;;
+2764;HEAVY BLACK HEART;So;0;ON;;;;;N;;;;;
+2765;ROTATED HEAVY BLACK HEART BULLET;So;0;ON;;;;;N;;;;;
+2766;FLORAL HEART;So;0;ON;;;;;N;;;;;
+2767;ROTATED FLORAL HEART BULLET;So;0;ON;;;;;N;;;;;
+2768;MEDIUM LEFT PARENTHESIS ORNAMENT;Ps;0;ON;;;;;Y;;;;;
+2769;MEDIUM RIGHT PARENTHESIS ORNAMENT;Pe;0;ON;;;;;Y;;;;;
+276A;MEDIUM FLATTENED LEFT PARENTHESIS ORNAMENT;Ps;0;ON;;;;;Y;;;;;
+276B;MEDIUM FLATTENED RIGHT PARENTHESIS ORNAMENT;Pe;0;ON;;;;;Y;;;;;
+276C;MEDIUM LEFT-POINTING ANGLE BRACKET ORNAMENT;Ps;0;ON;;;;;Y;;;;;
+276D;MEDIUM RIGHT-POINTING ANGLE BRACKET ORNAMENT;Pe;0;ON;;;;;Y;;;;;
+276E;HEAVY LEFT-POINTING ANGLE QUOTATION MARK ORNAMENT;Ps;0;ON;;;;;Y;;;;;
+276F;HEAVY RIGHT-POINTING ANGLE QUOTATION MARK ORNAMENT;Pe;0;ON;;;;;Y;;;;;
+2770;HEAVY LEFT-POINTING ANGLE BRACKET ORNAMENT;Ps;0;ON;;;;;Y;;;;;
+2771;HEAVY RIGHT-POINTING ANGLE BRACKET ORNAMENT;Pe;0;ON;;;;;Y;;;;;
+2772;LIGHT LEFT TORTOISE SHELL BRACKET ORNAMENT;Ps;0;ON;;;;;Y;;;;;
+2773;LIGHT RIGHT TORTOISE SHELL BRACKET ORNAMENT;Pe;0;ON;;;;;Y;;;;;
+2774;MEDIUM LEFT CURLY BRACKET ORNAMENT;Ps;0;ON;;;;;Y;;;;;
+2775;MEDIUM RIGHT CURLY BRACKET ORNAMENT;Pe;0;ON;;;;;Y;;;;;
+2776;DINGBAT NEGATIVE CIRCLED DIGIT ONE;No;0;ON;;;1;1;N;INVERSE CIRCLED DIGIT ONE;;;;
+2777;DINGBAT NEGATIVE CIRCLED DIGIT TWO;No;0;ON;;;2;2;N;INVERSE CIRCLED DIGIT TWO;;;;
+2778;DINGBAT NEGATIVE CIRCLED DIGIT THREE;No;0;ON;;;3;3;N;INVERSE CIRCLED DIGIT THREE;;;;
+2779;DINGBAT NEGATIVE CIRCLED DIGIT FOUR;No;0;ON;;;4;4;N;INVERSE CIRCLED DIGIT FOUR;;;;
+277A;DINGBAT NEGATIVE CIRCLED DIGIT FIVE;No;0;ON;;;5;5;N;INVERSE CIRCLED DIGIT FIVE;;;;
+277B;DINGBAT NEGATIVE CIRCLED DIGIT SIX;No;0;ON;;;6;6;N;INVERSE CIRCLED DIGIT SIX;;;;
+277C;DINGBAT NEGATIVE CIRCLED DIGIT SEVEN;No;0;ON;;;7;7;N;INVERSE CIRCLED DIGIT SEVEN;;;;
+277D;DINGBAT NEGATIVE CIRCLED DIGIT EIGHT;No;0;ON;;;8;8;N;INVERSE CIRCLED DIGIT EIGHT;;;;
+277E;DINGBAT NEGATIVE CIRCLED DIGIT NINE;No;0;ON;;;9;9;N;INVERSE CIRCLED DIGIT NINE;;;;
+277F;DINGBAT NEGATIVE CIRCLED NUMBER TEN;No;0;ON;;;;10;N;INVERSE CIRCLED NUMBER TEN;;;;
+2780;DINGBAT CIRCLED SANS-SERIF DIGIT ONE;No;0;ON;;;1;1;N;CIRCLED SANS-SERIF DIGIT ONE;;;;
+2781;DINGBAT CIRCLED SANS-SERIF DIGIT TWO;No;0;ON;;;2;2;N;CIRCLED SANS-SERIF DIGIT TWO;;;;
+2782;DINGBAT CIRCLED SANS-SERIF DIGIT THREE;No;0;ON;;;3;3;N;CIRCLED SANS-SERIF DIGIT THREE;;;;
+2783;DINGBAT CIRCLED SANS-SERIF DIGIT FOUR;No;0;ON;;;4;4;N;CIRCLED SANS-SERIF DIGIT FOUR;;;;
+2784;DINGBAT CIRCLED SANS-SERIF DIGIT FIVE;No;0;ON;;;5;5;N;CIRCLED SANS-SERIF DIGIT FIVE;;;;
+2785;DINGBAT CIRCLED SANS-SERIF DIGIT SIX;No;0;ON;;;6;6;N;CIRCLED SANS-SERIF DIGIT SIX;;;;
+2786;DINGBAT CIRCLED SANS-SERIF DIGIT SEVEN;No;0;ON;;;7;7;N;CIRCLED SANS-SERIF DIGIT SEVEN;;;;
+2787;DINGBAT CIRCLED SANS-SERIF DIGIT EIGHT;No;0;ON;;;8;8;N;CIRCLED SANS-SERIF DIGIT EIGHT;;;;
+2788;DINGBAT CIRCLED SANS-SERIF DIGIT NINE;No;0;ON;;;9;9;N;CIRCLED SANS-SERIF DIGIT NINE;;;;
+2789;DINGBAT CIRCLED SANS-SERIF NUMBER TEN;No;0;ON;;;;10;N;CIRCLED SANS-SERIF NUMBER TEN;;;;
+278A;DINGBAT NEGATIVE CIRCLED SANS-SERIF DIGIT ONE;No;0;ON;;;1;1;N;INVERSE CIRCLED SANS-SERIF DIGIT ONE;;;;
+278B;DINGBAT NEGATIVE CIRCLED SANS-SERIF DIGIT TWO;No;0;ON;;;2;2;N;INVERSE CIRCLED SANS-SERIF DIGIT TWO;;;;
+278C;DINGBAT NEGATIVE CIRCLED SANS-SERIF DIGIT THREE;No;0;ON;;;3;3;N;INVERSE CIRCLED SANS-SERIF DIGIT THREE;;;;
+278D;DINGBAT NEGATIVE CIRCLED SANS-SERIF DIGIT FOUR;No;0;ON;;;4;4;N;INVERSE CIRCLED SANS-SERIF DIGIT FOUR;;;;
+278E;DINGBAT NEGATIVE CIRCLED SANS-SERIF DIGIT FIVE;No;0;ON;;;5;5;N;INVERSE CIRCLED SANS-SERIF DIGIT FIVE;;;;
+278F;DINGBAT NEGATIVE CIRCLED SANS-SERIF DIGIT SIX;No;0;ON;;;6;6;N;INVERSE CIRCLED SANS-SERIF DIGIT SIX;;;;
+2790;DINGBAT NEGATIVE CIRCLED SANS-SERIF DIGIT SEVEN;No;0;ON;;;7;7;N;INVERSE CIRCLED SANS-SERIF DIGIT SEVEN;;;;
+2791;DINGBAT NEGATIVE CIRCLED SANS-SERIF DIGIT EIGHT;No;0;ON;;;8;8;N;INVERSE CIRCLED SANS-SERIF DIGIT EIGHT;;;;
+2792;DINGBAT NEGATIVE CIRCLED SANS-SERIF DIGIT NINE;No;0;ON;;;9;9;N;INVERSE CIRCLED SANS-SERIF DIGIT NINE;;;;
+2793;DINGBAT NEGATIVE CIRCLED SANS-SERIF NUMBER TEN;No;0;ON;;;;10;N;INVERSE CIRCLED SANS-SERIF NUMBER TEN;;;;
+2794;HEAVY WIDE-HEADED RIGHTWARDS ARROW;So;0;ON;;;;;N;HEAVY WIDE-HEADED RIGHT ARROW;;;;
+2795;HEAVY PLUS SIGN;So;0;ON;;;;;N;;;;;
+2796;HEAVY MINUS SIGN;So;0;ON;;;;;N;;;;;
+2797;HEAVY DIVISION SIGN;So;0;ON;;;;;N;;;;;
+2798;HEAVY SOUTH EAST ARROW;So;0;ON;;;;;N;HEAVY LOWER RIGHT ARROW;;;;
+2799;HEAVY RIGHTWARDS ARROW;So;0;ON;;;;;N;HEAVY RIGHT ARROW;;;;
+279A;HEAVY NORTH EAST ARROW;So;0;ON;;;;;N;HEAVY UPPER RIGHT ARROW;;;;
+279B;DRAFTING POINT RIGHTWARDS ARROW;So;0;ON;;;;;N;DRAFTING POINT RIGHT ARROW;;;;
+279C;HEAVY ROUND-TIPPED RIGHTWARDS ARROW;So;0;ON;;;;;N;HEAVY ROUND-TIPPED RIGHT ARROW;;;;
+279D;TRIANGLE-HEADED RIGHTWARDS ARROW;So;0;ON;;;;;N;TRIANGLE-HEADED RIGHT ARROW;;;;
+279E;HEAVY TRIANGLE-HEADED RIGHTWARDS ARROW;So;0;ON;;;;;N;HEAVY TRIANGLE-HEADED RIGHT ARROW;;;;
+279F;DASHED TRIANGLE-HEADED RIGHTWARDS ARROW;So;0;ON;;;;;N;DASHED TRIANGLE-HEADED RIGHT ARROW;;;;
+27A0;HEAVY DASHED TRIANGLE-HEADED RIGHTWARDS ARROW;So;0;ON;;;;;N;HEAVY DASHED TRIANGLE-HEADED RIGHT ARROW;;;;
+27A1;BLACK RIGHTWARDS ARROW;So;0;ON;;;;;N;BLACK RIGHT ARROW;;;;
+27A2;THREE-D TOP-LIGHTED RIGHTWARDS ARROWHEAD;So;0;ON;;;;;N;THREE-D TOP-LIGHTED RIGHT ARROWHEAD;;;;
+27A3;THREE-D BOTTOM-LIGHTED RIGHTWARDS ARROWHEAD;So;0;ON;;;;;N;THREE-D BOTTOM-LIGHTED RIGHT ARROWHEAD;;;;
+27A4;BLACK RIGHTWARDS ARROWHEAD;So;0;ON;;;;;N;BLACK RIGHT ARROWHEAD;;;;
+27A5;HEAVY BLACK CURVED DOWNWARDS AND RIGHTWARDS ARROW;So;0;ON;;;;;N;HEAVY BLACK CURVED DOWN AND RIGHT ARROW;;;;
+27A6;HEAVY BLACK CURVED UPWARDS AND RIGHTWARDS ARROW;So;0;ON;;;;;N;HEAVY BLACK CURVED UP AND RIGHT ARROW;;;;
+27A7;SQUAT BLACK RIGHTWARDS ARROW;So;0;ON;;;;;N;SQUAT BLACK RIGHT ARROW;;;;
+27A8;HEAVY CONCAVE-POINTED BLACK RIGHTWARDS ARROW;So;0;ON;;;;;N;HEAVY CONCAVE-POINTED BLACK RIGHT ARROW;;;;
+27A9;RIGHT-SHADED WHITE RIGHTWARDS ARROW;So;0;ON;;;;;N;RIGHT-SHADED WHITE RIGHT ARROW;;;;
+27AA;LEFT-SHADED WHITE RIGHTWARDS ARROW;So;0;ON;;;;;N;LEFT-SHADED WHITE RIGHT ARROW;;;;
+27AB;BACK-TILTED SHADOWED WHITE RIGHTWARDS ARROW;So;0;ON;;;;;N;BACK-TILTED SHADOWED WHITE RIGHT ARROW;;;;
+27AC;FRONT-TILTED SHADOWED WHITE RIGHTWARDS ARROW;So;0;ON;;;;;N;FRONT-TILTED SHADOWED WHITE RIGHT ARROW;;;;
+27AD;HEAVY LOWER RIGHT-SHADOWED WHITE RIGHTWARDS ARROW;So;0;ON;;;;;N;HEAVY LOWER RIGHT-SHADOWED WHITE RIGHT ARROW;;;;
+27AE;HEAVY UPPER RIGHT-SHADOWED WHITE RIGHTWARDS ARROW;So;0;ON;;;;;N;HEAVY UPPER RIGHT-SHADOWED WHITE RIGHT ARROW;;;;
+27AF;NOTCHED LOWER RIGHT-SHADOWED WHITE RIGHTWARDS ARROW;So;0;ON;;;;;N;NOTCHED LOWER RIGHT-SHADOWED WHITE RIGHT ARROW;;;;
+27B0;CURLY LOOP;So;0;ON;;;;;N;;;;;
+27B1;NOTCHED UPPER RIGHT-SHADOWED WHITE RIGHTWARDS ARROW;So;0;ON;;;;;N;NOTCHED UPPER RIGHT-SHADOWED WHITE RIGHT ARROW;;;;
+27B2;CIRCLED HEAVY WHITE RIGHTWARDS ARROW;So;0;ON;;;;;N;CIRCLED HEAVY WHITE RIGHT ARROW;;;;
+27B3;WHITE-FEATHERED RIGHTWARDS ARROW;So;0;ON;;;;;N;WHITE-FEATHERED RIGHT ARROW;;;;
+27B4;BLACK-FEATHERED SOUTH EAST ARROW;So;0;ON;;;;;N;BLACK-FEATHERED LOWER RIGHT ARROW;;;;
+27B5;BLACK-FEATHERED RIGHTWARDS ARROW;So;0;ON;;;;;N;BLACK-FEATHERED RIGHT ARROW;;;;
+27B6;BLACK-FEATHERED NORTH EAST ARROW;So;0;ON;;;;;N;BLACK-FEATHERED UPPER RIGHT ARROW;;;;
+27B7;HEAVY BLACK-FEATHERED SOUTH EAST ARROW;So;0;ON;;;;;N;HEAVY BLACK-FEATHERED LOWER RIGHT ARROW;;;;
+27B8;HEAVY BLACK-FEATHERED RIGHTWARDS ARROW;So;0;ON;;;;;N;HEAVY BLACK-FEATHERED RIGHT ARROW;;;;
+27B9;HEAVY BLACK-FEATHERED NORTH EAST ARROW;So;0;ON;;;;;N;HEAVY BLACK-FEATHERED UPPER RIGHT ARROW;;;;
+27BA;TEARDROP-BARBED RIGHTWARDS ARROW;So;0;ON;;;;;N;TEARDROP-BARBED RIGHT ARROW;;;;
+27BB;HEAVY TEARDROP-SHANKED RIGHTWARDS ARROW;So;0;ON;;;;;N;HEAVY TEARDROP-SHANKED RIGHT ARROW;;;;
+27BC;WEDGE-TAILED RIGHTWARDS ARROW;So;0;ON;;;;;N;WEDGE-TAILED RIGHT ARROW;;;;
+27BD;HEAVY WEDGE-TAILED RIGHTWARDS ARROW;So;0;ON;;;;;N;HEAVY WEDGE-TAILED RIGHT ARROW;;;;
+27BE;OPEN-OUTLINED RIGHTWARDS ARROW;So;0;ON;;;;;N;OPEN-OUTLINED RIGHT ARROW;;;;
+27BF;DOUBLE CURLY LOOP;So;0;ON;;;;;N;;;;;
+27C0;THREE DIMENSIONAL ANGLE;Sm;0;ON;;;;;Y;;;;;
+27C1;WHITE TRIANGLE CONTAINING SMALL WHITE TRIANGLE;Sm;0;ON;;;;;N;;;;;
+27C2;PERPENDICULAR;Sm;0;ON;;;;;N;;;;;
+27C3;OPEN SUBSET;Sm;0;ON;;;;;Y;;;;;
+27C4;OPEN SUPERSET;Sm;0;ON;;;;;Y;;;;;
+27C5;LEFT S-SHAPED BAG DELIMITER;Ps;0;ON;;;;;Y;;;;;
+27C6;RIGHT S-SHAPED BAG DELIMITER;Pe;0;ON;;;;;Y;;;;;
+27C7;OR WITH DOT INSIDE;Sm;0;ON;;;;;N;;;;;
+27C8;REVERSE SOLIDUS PRECEDING SUBSET;Sm;0;ON;;;;;Y;;;;;
+27C9;SUPERSET PRECEDING SOLIDUS;Sm;0;ON;;;;;Y;;;;;
+27CA;VERTICAL BAR WITH HORIZONTAL STROKE;Sm;0;ON;;;;;N;;;;;
+27CB;MATHEMATICAL RISING DIAGONAL;Sm;0;ON;;;;;Y;;;;;
+27CC;LONG DIVISION;Sm;0;ON;;;;;Y;;;;;
+27CD;MATHEMATICAL FALLING DIAGONAL;Sm;0;ON;;;;;Y;;;;;
+27CE;SQUARED LOGICAL AND;Sm;0;ON;;;;;N;;;;;
+27CF;SQUARED LOGICAL OR;Sm;0;ON;;;;;N;;;;;
+27D0;WHITE DIAMOND WITH CENTRED DOT;Sm;0;ON;;;;;N;;;;;
+27D1;AND WITH DOT;Sm;0;ON;;;;;N;;;;;
+27D2;ELEMENT OF OPENING UPWARDS;Sm;0;ON;;;;;N;;;;;
+27D3;LOWER RIGHT CORNER WITH DOT;Sm;0;ON;;;;;Y;;;;;
+27D4;UPPER LEFT CORNER WITH DOT;Sm;0;ON;;;;;Y;;;;;
+27D5;LEFT OUTER JOIN;Sm;0;ON;;;;;Y;;;;;
+27D6;RIGHT OUTER JOIN;Sm;0;ON;;;;;Y;;;;;
+27D7;FULL OUTER JOIN;Sm;0;ON;;;;;N;;;;;
+27D8;LARGE UP TACK;Sm;0;ON;;;;;N;;;;;
+27D9;LARGE DOWN TACK;Sm;0;ON;;;;;N;;;;;
+27DA;LEFT AND RIGHT DOUBLE TURNSTILE;Sm;0;ON;;;;;N;;;;;
+27DB;LEFT AND RIGHT TACK;Sm;0;ON;;;;;N;;;;;
+27DC;LEFT MULTIMAP;Sm;0;ON;;;;;Y;;;;;
+27DD;LONG RIGHT TACK;Sm;0;ON;;;;;Y;;;;;
+27DE;LONG LEFT TACK;Sm;0;ON;;;;;Y;;;;;
+27DF;UP TACK WITH CIRCLE ABOVE;Sm;0;ON;;;;;N;;;;;
+27E0;LOZENGE DIVIDED BY HORIZONTAL RULE;Sm;0;ON;;;;;N;;;;;
+27E1;WHITE CONCAVE-SIDED DIAMOND;Sm;0;ON;;;;;N;;;;;
+27E2;WHITE CONCAVE-SIDED DIAMOND WITH LEFTWARDS TICK;Sm;0;ON;;;;;Y;;;;;
+27E3;WHITE CONCAVE-SIDED DIAMOND WITH RIGHTWARDS TICK;Sm;0;ON;;;;;Y;;;;;
+27E4;WHITE SQUARE WITH LEFTWARDS TICK;Sm;0;ON;;;;;Y;;;;;
+27E5;WHITE SQUARE WITH RIGHTWARDS TICK;Sm;0;ON;;;;;Y;;;;;
+27E6;MATHEMATICAL LEFT WHITE SQUARE BRACKET;Ps;0;ON;;;;;Y;;;;;
+27E7;MATHEMATICAL RIGHT WHITE SQUARE BRACKET;Pe;0;ON;;;;;Y;;;;;
+27E8;MATHEMATICAL LEFT ANGLE BRACKET;Ps;0;ON;;;;;Y;;;;;
+27E9;MATHEMATICAL RIGHT ANGLE BRACKET;Pe;0;ON;;;;;Y;;;;;
+27EA;MATHEMATICAL LEFT DOUBLE ANGLE BRACKET;Ps;0;ON;;;;;Y;;;;;
+27EB;MATHEMATICAL RIGHT DOUBLE ANGLE BRACKET;Pe;0;ON;;;;;Y;;;;;
+27EC;MATHEMATICAL LEFT WHITE TORTOISE SHELL BRACKET;Ps;0;ON;;;;;Y;;;;;
+27ED;MATHEMATICAL RIGHT WHITE TORTOISE SHELL BRACKET;Pe;0;ON;;;;;Y;;;;;
+27EE;MATHEMATICAL LEFT FLATTENED PARENTHESIS;Ps;0;ON;;;;;Y;;;;;
+27EF;MATHEMATICAL RIGHT FLATTENED PARENTHESIS;Pe;0;ON;;;;;Y;;;;;
+27F0;UPWARDS QUADRUPLE ARROW;Sm;0;ON;;;;;N;;;;;
+27F1;DOWNWARDS QUADRUPLE ARROW;Sm;0;ON;;;;;N;;;;;
+27F2;ANTICLOCKWISE GAPPED CIRCLE ARROW;Sm;0;ON;;;;;N;;;;;
+27F3;CLOCKWISE GAPPED CIRCLE ARROW;Sm;0;ON;;;;;N;;;;;
+27F4;RIGHT ARROW WITH CIRCLED PLUS;Sm;0;ON;;;;;N;;;;;
+27F5;LONG LEFTWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+27F6;LONG RIGHTWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+27F7;LONG LEFT RIGHT ARROW;Sm;0;ON;;;;;N;;;;;
+27F8;LONG LEFTWARDS DOUBLE ARROW;Sm;0;ON;;;;;N;;;;;
+27F9;LONG RIGHTWARDS DOUBLE ARROW;Sm;0;ON;;;;;N;;;;;
+27FA;LONG LEFT RIGHT DOUBLE ARROW;Sm;0;ON;;;;;N;;;;;
+27FB;LONG LEFTWARDS ARROW FROM BAR;Sm;0;ON;;;;;N;;;;;
+27FC;LONG RIGHTWARDS ARROW FROM BAR;Sm;0;ON;;;;;N;;;;;
+27FD;LONG LEFTWARDS DOUBLE ARROW FROM BAR;Sm;0;ON;;;;;N;;;;;
+27FE;LONG RIGHTWARDS DOUBLE ARROW FROM BAR;Sm;0;ON;;;;;N;;;;;
+27FF;LONG RIGHTWARDS SQUIGGLE ARROW;Sm;0;ON;;;;;N;;;;;
+2800;BRAILLE PATTERN BLANK;So;0;L;;;;;N;;;;;
+2801;BRAILLE PATTERN DOTS-1;So;0;L;;;;;N;;;;;
+2802;BRAILLE PATTERN DOTS-2;So;0;L;;;;;N;;;;;
+2803;BRAILLE PATTERN DOTS-12;So;0;L;;;;;N;;;;;
+2804;BRAILLE PATTERN DOTS-3;So;0;L;;;;;N;;;;;
+2805;BRAILLE PATTERN DOTS-13;So;0;L;;;;;N;;;;;
+2806;BRAILLE PATTERN DOTS-23;So;0;L;;;;;N;;;;;
+2807;BRAILLE PATTERN DOTS-123;So;0;L;;;;;N;;;;;
+2808;BRAILLE PATTERN DOTS-4;So;0;L;;;;;N;;;;;
+2809;BRAILLE PATTERN DOTS-14;So;0;L;;;;;N;;;;;
+280A;BRAILLE PATTERN DOTS-24;So;0;L;;;;;N;;;;;
+280B;BRAILLE PATTERN DOTS-124;So;0;L;;;;;N;;;;;
+280C;BRAILLE PATTERN DOTS-34;So;0;L;;;;;N;;;;;
+280D;BRAILLE PATTERN DOTS-134;So;0;L;;;;;N;;;;;
+280E;BRAILLE PATTERN DOTS-234;So;0;L;;;;;N;;;;;
+280F;BRAILLE PATTERN DOTS-1234;So;0;L;;;;;N;;;;;
+2810;BRAILLE PATTERN DOTS-5;So;0;L;;;;;N;;;;;
+2811;BRAILLE PATTERN DOTS-15;So;0;L;;;;;N;;;;;
+2812;BRAILLE PATTERN DOTS-25;So;0;L;;;;;N;;;;;
+2813;BRAILLE PATTERN DOTS-125;So;0;L;;;;;N;;;;;
+2814;BRAILLE PATTERN DOTS-35;So;0;L;;;;;N;;;;;
+2815;BRAILLE PATTERN DOTS-135;So;0;L;;;;;N;;;;;
+2816;BRAILLE PATTERN DOTS-235;So;0;L;;;;;N;;;;;
+2817;BRAILLE PATTERN DOTS-1235;So;0;L;;;;;N;;;;;
+2818;BRAILLE PATTERN DOTS-45;So;0;L;;;;;N;;;;;
+2819;BRAILLE PATTERN DOTS-145;So;0;L;;;;;N;;;;;
+281A;BRAILLE PATTERN DOTS-245;So;0;L;;;;;N;;;;;
+281B;BRAILLE PATTERN DOTS-1245;So;0;L;;;;;N;;;;;
+281C;BRAILLE PATTERN DOTS-345;So;0;L;;;;;N;;;;;
+281D;BRAILLE PATTERN DOTS-1345;So;0;L;;;;;N;;;;;
+281E;BRAILLE PATTERN DOTS-2345;So;0;L;;;;;N;;;;;
+281F;BRAILLE PATTERN DOTS-12345;So;0;L;;;;;N;;;;;
+2820;BRAILLE PATTERN DOTS-6;So;0;L;;;;;N;;;;;
+2821;BRAILLE PATTERN DOTS-16;So;0;L;;;;;N;;;;;
+2822;BRAILLE PATTERN DOTS-26;So;0;L;;;;;N;;;;;
+2823;BRAILLE PATTERN DOTS-126;So;0;L;;;;;N;;;;;
+2824;BRAILLE PATTERN DOTS-36;So;0;L;;;;;N;;;;;
+2825;BRAILLE PATTERN DOTS-136;So;0;L;;;;;N;;;;;
+2826;BRAILLE PATTERN DOTS-236;So;0;L;;;;;N;;;;;
+2827;BRAILLE PATTERN DOTS-1236;So;0;L;;;;;N;;;;;
+2828;BRAILLE PATTERN DOTS-46;So;0;L;;;;;N;;;;;
+2829;BRAILLE PATTERN DOTS-146;So;0;L;;;;;N;;;;;
+282A;BRAILLE PATTERN DOTS-246;So;0;L;;;;;N;;;;;
+282B;BRAILLE PATTERN DOTS-1246;So;0;L;;;;;N;;;;;
+282C;BRAILLE PATTERN DOTS-346;So;0;L;;;;;N;;;;;
+282D;BRAILLE PATTERN DOTS-1346;So;0;L;;;;;N;;;;;
+282E;BRAILLE PATTERN DOTS-2346;So;0;L;;;;;N;;;;;
+282F;BRAILLE PATTERN DOTS-12346;So;0;L;;;;;N;;;;;
+2830;BRAILLE PATTERN DOTS-56;So;0;L;;;;;N;;;;;
+2831;BRAILLE PATTERN DOTS-156;So;0;L;;;;;N;;;;;
+2832;BRAILLE PATTERN DOTS-256;So;0;L;;;;;N;;;;;
+2833;BRAILLE PATTERN DOTS-1256;So;0;L;;;;;N;;;;;
+2834;BRAILLE PATTERN DOTS-356;So;0;L;;;;;N;;;;;
+2835;BRAILLE PATTERN DOTS-1356;So;0;L;;;;;N;;;;;
+2836;BRAILLE PATTERN DOTS-2356;So;0;L;;;;;N;;;;;
+2837;BRAILLE PATTERN DOTS-12356;So;0;L;;;;;N;;;;;
+2838;BRAILLE PATTERN DOTS-456;So;0;L;;;;;N;;;;;
+2839;BRAILLE PATTERN DOTS-1456;So;0;L;;;;;N;;;;;
+283A;BRAILLE PATTERN DOTS-2456;So;0;L;;;;;N;;;;;
+283B;BRAILLE PATTERN DOTS-12456;So;0;L;;;;;N;;;;;
+283C;BRAILLE PATTERN DOTS-3456;So;0;L;;;;;N;;;;;
+283D;BRAILLE PATTERN DOTS-13456;So;0;L;;;;;N;;;;;
+283E;BRAILLE PATTERN DOTS-23456;So;0;L;;;;;N;;;;;
+283F;BRAILLE PATTERN DOTS-123456;So;0;L;;;;;N;;;;;
+2840;BRAILLE PATTERN DOTS-7;So;0;L;;;;;N;;;;;
+2841;BRAILLE PATTERN DOTS-17;So;0;L;;;;;N;;;;;
+2842;BRAILLE PATTERN DOTS-27;So;0;L;;;;;N;;;;;
+2843;BRAILLE PATTERN DOTS-127;So;0;L;;;;;N;;;;;
+2844;BRAILLE PATTERN DOTS-37;So;0;L;;;;;N;;;;;
+2845;BRAILLE PATTERN DOTS-137;So;0;L;;;;;N;;;;;
+2846;BRAILLE PATTERN DOTS-237;So;0;L;;;;;N;;;;;
+2847;BRAILLE PATTERN DOTS-1237;So;0;L;;;;;N;;;;;
+2848;BRAILLE PATTERN DOTS-47;So;0;L;;;;;N;;;;;
+2849;BRAILLE PATTERN DOTS-147;So;0;L;;;;;N;;;;;
+284A;BRAILLE PATTERN DOTS-247;So;0;L;;;;;N;;;;;
+284B;BRAILLE PATTERN DOTS-1247;So;0;L;;;;;N;;;;;
+284C;BRAILLE PATTERN DOTS-347;So;0;L;;;;;N;;;;;
+284D;BRAILLE PATTERN DOTS-1347;So;0;L;;;;;N;;;;;
+284E;BRAILLE PATTERN DOTS-2347;So;0;L;;;;;N;;;;;
+284F;BRAILLE PATTERN DOTS-12347;So;0;L;;;;;N;;;;;
+2850;BRAILLE PATTERN DOTS-57;So;0;L;;;;;N;;;;;
+2851;BRAILLE PATTERN DOTS-157;So;0;L;;;;;N;;;;;
+2852;BRAILLE PATTERN DOTS-257;So;0;L;;;;;N;;;;;
+2853;BRAILLE PATTERN DOTS-1257;So;0;L;;;;;N;;;;;
+2854;BRAILLE PATTERN DOTS-357;So;0;L;;;;;N;;;;;
+2855;BRAILLE PATTERN DOTS-1357;So;0;L;;;;;N;;;;;
+2856;BRAILLE PATTERN DOTS-2357;So;0;L;;;;;N;;;;;
+2857;BRAILLE PATTERN DOTS-12357;So;0;L;;;;;N;;;;;
+2858;BRAILLE PATTERN DOTS-457;So;0;L;;;;;N;;;;;
+2859;BRAILLE PATTERN DOTS-1457;So;0;L;;;;;N;;;;;
+285A;BRAILLE PATTERN DOTS-2457;So;0;L;;;;;N;;;;;
+285B;BRAILLE PATTERN DOTS-12457;So;0;L;;;;;N;;;;;
+285C;BRAILLE PATTERN DOTS-3457;So;0;L;;;;;N;;;;;
+285D;BRAILLE PATTERN DOTS-13457;So;0;L;;;;;N;;;;;
+285E;BRAILLE PATTERN DOTS-23457;So;0;L;;;;;N;;;;;
+285F;BRAILLE PATTERN DOTS-123457;So;0;L;;;;;N;;;;;
+2860;BRAILLE PATTERN DOTS-67;So;0;L;;;;;N;;;;;
+2861;BRAILLE PATTERN DOTS-167;So;0;L;;;;;N;;;;;
+2862;BRAILLE PATTERN DOTS-267;So;0;L;;;;;N;;;;;
+2863;BRAILLE PATTERN DOTS-1267;So;0;L;;;;;N;;;;;
+2864;BRAILLE PATTERN DOTS-367;So;0;L;;;;;N;;;;;
+2865;BRAILLE PATTERN DOTS-1367;So;0;L;;;;;N;;;;;
+2866;BRAILLE PATTERN DOTS-2367;So;0;L;;;;;N;;;;;
+2867;BRAILLE PATTERN DOTS-12367;So;0;L;;;;;N;;;;;
+2868;BRAILLE PATTERN DOTS-467;So;0;L;;;;;N;;;;;
+2869;BRAILLE PATTERN DOTS-1467;So;0;L;;;;;N;;;;;
+286A;BRAILLE PATTERN DOTS-2467;So;0;L;;;;;N;;;;;
+286B;BRAILLE PATTERN DOTS-12467;So;0;L;;;;;N;;;;;
+286C;BRAILLE PATTERN DOTS-3467;So;0;L;;;;;N;;;;;
+286D;BRAILLE PATTERN DOTS-13467;So;0;L;;;;;N;;;;;
+286E;BRAILLE PATTERN DOTS-23467;So;0;L;;;;;N;;;;;
+286F;BRAILLE PATTERN DOTS-123467;So;0;L;;;;;N;;;;;
+2870;BRAILLE PATTERN DOTS-567;So;0;L;;;;;N;;;;;
+2871;BRAILLE PATTERN DOTS-1567;So;0;L;;;;;N;;;;;
+2872;BRAILLE PATTERN DOTS-2567;So;0;L;;;;;N;;;;;
+2873;BRAILLE PATTERN DOTS-12567;So;0;L;;;;;N;;;;;
+2874;BRAILLE PATTERN DOTS-3567;So;0;L;;;;;N;;;;;
+2875;BRAILLE PATTERN DOTS-13567;So;0;L;;;;;N;;;;;
+2876;BRAILLE PATTERN DOTS-23567;So;0;L;;;;;N;;;;;
+2877;BRAILLE PATTERN DOTS-123567;So;0;L;;;;;N;;;;;
+2878;BRAILLE PATTERN DOTS-4567;So;0;L;;;;;N;;;;;
+2879;BRAILLE PATTERN DOTS-14567;So;0;L;;;;;N;;;;;
+287A;BRAILLE PATTERN DOTS-24567;So;0;L;;;;;N;;;;;
+287B;BRAILLE PATTERN DOTS-124567;So;0;L;;;;;N;;;;;
+287C;BRAILLE PATTERN DOTS-34567;So;0;L;;;;;N;;;;;
+287D;BRAILLE PATTERN DOTS-134567;So;0;L;;;;;N;;;;;
+287E;BRAILLE PATTERN DOTS-234567;So;0;L;;;;;N;;;;;
+287F;BRAILLE PATTERN DOTS-1234567;So;0;L;;;;;N;;;;;
+2880;BRAILLE PATTERN DOTS-8;So;0;L;;;;;N;;;;;
+2881;BRAILLE PATTERN DOTS-18;So;0;L;;;;;N;;;;;
+2882;BRAILLE PATTERN DOTS-28;So;0;L;;;;;N;;;;;
+2883;BRAILLE PATTERN DOTS-128;So;0;L;;;;;N;;;;;
+2884;BRAILLE PATTERN DOTS-38;So;0;L;;;;;N;;;;;
+2885;BRAILLE PATTERN DOTS-138;So;0;L;;;;;N;;;;;
+2886;BRAILLE PATTERN DOTS-238;So;0;L;;;;;N;;;;;
+2887;BRAILLE PATTERN DOTS-1238;So;0;L;;;;;N;;;;;
+2888;BRAILLE PATTERN DOTS-48;So;0;L;;;;;N;;;;;
+2889;BRAILLE PATTERN DOTS-148;So;0;L;;;;;N;;;;;
+288A;BRAILLE PATTERN DOTS-248;So;0;L;;;;;N;;;;;
+288B;BRAILLE PATTERN DOTS-1248;So;0;L;;;;;N;;;;;
+288C;BRAILLE PATTERN DOTS-348;So;0;L;;;;;N;;;;;
+288D;BRAILLE PATTERN DOTS-1348;So;0;L;;;;;N;;;;;
+288E;BRAILLE PATTERN DOTS-2348;So;0;L;;;;;N;;;;;
+288F;BRAILLE PATTERN DOTS-12348;So;0;L;;;;;N;;;;;
+2890;BRAILLE PATTERN DOTS-58;So;0;L;;;;;N;;;;;
+2891;BRAILLE PATTERN DOTS-158;So;0;L;;;;;N;;;;;
+2892;BRAILLE PATTERN DOTS-258;So;0;L;;;;;N;;;;;
+2893;BRAILLE PATTERN DOTS-1258;So;0;L;;;;;N;;;;;
+2894;BRAILLE PATTERN DOTS-358;So;0;L;;;;;N;;;;;
+2895;BRAILLE PATTERN DOTS-1358;So;0;L;;;;;N;;;;;
+2896;BRAILLE PATTERN DOTS-2358;So;0;L;;;;;N;;;;;
+2897;BRAILLE PATTERN DOTS-12358;So;0;L;;;;;N;;;;;
+2898;BRAILLE PATTERN DOTS-458;So;0;L;;;;;N;;;;;
+2899;BRAILLE PATTERN DOTS-1458;So;0;L;;;;;N;;;;;
+289A;BRAILLE PATTERN DOTS-2458;So;0;L;;;;;N;;;;;
+289B;BRAILLE PATTERN DOTS-12458;So;0;L;;;;;N;;;;;
+289C;BRAILLE PATTERN DOTS-3458;So;0;L;;;;;N;;;;;
+289D;BRAILLE PATTERN DOTS-13458;So;0;L;;;;;N;;;;;
+289E;BRAILLE PATTERN DOTS-23458;So;0;L;;;;;N;;;;;
+289F;BRAILLE PATTERN DOTS-123458;So;0;L;;;;;N;;;;;
+28A0;BRAILLE PATTERN DOTS-68;So;0;L;;;;;N;;;;;
+28A1;BRAILLE PATTERN DOTS-168;So;0;L;;;;;N;;;;;
+28A2;BRAILLE PATTERN DOTS-268;So;0;L;;;;;N;;;;;
+28A3;BRAILLE PATTERN DOTS-1268;So;0;L;;;;;N;;;;;
+28A4;BRAILLE PATTERN DOTS-368;So;0;L;;;;;N;;;;;
+28A5;BRAILLE PATTERN DOTS-1368;So;0;L;;;;;N;;;;;
+28A6;BRAILLE PATTERN DOTS-2368;So;0;L;;;;;N;;;;;
+28A7;BRAILLE PATTERN DOTS-12368;So;0;L;;;;;N;;;;;
+28A8;BRAILLE PATTERN DOTS-468;So;0;L;;;;;N;;;;;
+28A9;BRAILLE PATTERN DOTS-1468;So;0;L;;;;;N;;;;;
+28AA;BRAILLE PATTERN DOTS-2468;So;0;L;;;;;N;;;;;
+28AB;BRAILLE PATTERN DOTS-12468;So;0;L;;;;;N;;;;;
+28AC;BRAILLE PATTERN DOTS-3468;So;0;L;;;;;N;;;;;
+28AD;BRAILLE PATTERN DOTS-13468;So;0;L;;;;;N;;;;;
+28AE;BRAILLE PATTERN DOTS-23468;So;0;L;;;;;N;;;;;
+28AF;BRAILLE PATTERN DOTS-123468;So;0;L;;;;;N;;;;;
+28B0;BRAILLE PATTERN DOTS-568;So;0;L;;;;;N;;;;;
+28B1;BRAILLE PATTERN DOTS-1568;So;0;L;;;;;N;;;;;
+28B2;BRAILLE PATTERN DOTS-2568;So;0;L;;;;;N;;;;;
+28B3;BRAILLE PATTERN DOTS-12568;So;0;L;;;;;N;;;;;
+28B4;BRAILLE PATTERN DOTS-3568;So;0;L;;;;;N;;;;;
+28B5;BRAILLE PATTERN DOTS-13568;So;0;L;;;;;N;;;;;
+28B6;BRAILLE PATTERN DOTS-23568;So;0;L;;;;;N;;;;;
+28B7;BRAILLE PATTERN DOTS-123568;So;0;L;;;;;N;;;;;
+28B8;BRAILLE PATTERN DOTS-4568;So;0;L;;;;;N;;;;;
+28B9;BRAILLE PATTERN DOTS-14568;So;0;L;;;;;N;;;;;
+28BA;BRAILLE PATTERN DOTS-24568;So;0;L;;;;;N;;;;;
+28BB;BRAILLE PATTERN DOTS-124568;So;0;L;;;;;N;;;;;
+28BC;BRAILLE PATTERN DOTS-34568;So;0;L;;;;;N;;;;;
+28BD;BRAILLE PATTERN DOTS-134568;So;0;L;;;;;N;;;;;
+28BE;BRAILLE PATTERN DOTS-234568;So;0;L;;;;;N;;;;;
+28BF;BRAILLE PATTERN DOTS-1234568;So;0;L;;;;;N;;;;;
+28C0;BRAILLE PATTERN DOTS-78;So;0;L;;;;;N;;;;;
+28C1;BRAILLE PATTERN DOTS-178;So;0;L;;;;;N;;;;;
+28C2;BRAILLE PATTERN DOTS-278;So;0;L;;;;;N;;;;;
+28C3;BRAILLE PATTERN DOTS-1278;So;0;L;;;;;N;;;;;
+28C4;BRAILLE PATTERN DOTS-378;So;0;L;;;;;N;;;;;
+28C5;BRAILLE PATTERN DOTS-1378;So;0;L;;;;;N;;;;;
+28C6;BRAILLE PATTERN DOTS-2378;So;0;L;;;;;N;;;;;
+28C7;BRAILLE PATTERN DOTS-12378;So;0;L;;;;;N;;;;;
+28C8;BRAILLE PATTERN DOTS-478;So;0;L;;;;;N;;;;;
+28C9;BRAILLE PATTERN DOTS-1478;So;0;L;;;;;N;;;;;
+28CA;BRAILLE PATTERN DOTS-2478;So;0;L;;;;;N;;;;;
+28CB;BRAILLE PATTERN DOTS-12478;So;0;L;;;;;N;;;;;
+28CC;BRAILLE PATTERN DOTS-3478;So;0;L;;;;;N;;;;;
+28CD;BRAILLE PATTERN DOTS-13478;So;0;L;;;;;N;;;;;
+28CE;BRAILLE PATTERN DOTS-23478;So;0;L;;;;;N;;;;;
+28CF;BRAILLE PATTERN DOTS-123478;So;0;L;;;;;N;;;;;
+28D0;BRAILLE PATTERN DOTS-578;So;0;L;;;;;N;;;;;
+28D1;BRAILLE PATTERN DOTS-1578;So;0;L;;;;;N;;;;;
+28D2;BRAILLE PATTERN DOTS-2578;So;0;L;;;;;N;;;;;
+28D3;BRAILLE PATTERN DOTS-12578;So;0;L;;;;;N;;;;;
+28D4;BRAILLE PATTERN DOTS-3578;So;0;L;;;;;N;;;;;
+28D5;BRAILLE PATTERN DOTS-13578;So;0;L;;;;;N;;;;;
+28D6;BRAILLE PATTERN DOTS-23578;So;0;L;;;;;N;;;;;
+28D7;BRAILLE PATTERN DOTS-123578;So;0;L;;;;;N;;;;;
+28D8;BRAILLE PATTERN DOTS-4578;So;0;L;;;;;N;;;;;
+28D9;BRAILLE PATTERN DOTS-14578;So;0;L;;;;;N;;;;;
+28DA;BRAILLE PATTERN DOTS-24578;So;0;L;;;;;N;;;;;
+28DB;BRAILLE PATTERN DOTS-124578;So;0;L;;;;;N;;;;;
+28DC;BRAILLE PATTERN DOTS-34578;So;0;L;;;;;N;;;;;
+28DD;BRAILLE PATTERN DOTS-134578;So;0;L;;;;;N;;;;;
+28DE;BRAILLE PATTERN DOTS-234578;So;0;L;;;;;N;;;;;
+28DF;BRAILLE PATTERN DOTS-1234578;So;0;L;;;;;N;;;;;
+28E0;BRAILLE PATTERN DOTS-678;So;0;L;;;;;N;;;;;
+28E1;BRAILLE PATTERN DOTS-1678;So;0;L;;;;;N;;;;;
+28E2;BRAILLE PATTERN DOTS-2678;So;0;L;;;;;N;;;;;
+28E3;BRAILLE PATTERN DOTS-12678;So;0;L;;;;;N;;;;;
+28E4;BRAILLE PATTERN DOTS-3678;So;0;L;;;;;N;;;;;
+28E5;BRAILLE PATTERN DOTS-13678;So;0;L;;;;;N;;;;;
+28E6;BRAILLE PATTERN DOTS-23678;So;0;L;;;;;N;;;;;
+28E7;BRAILLE PATTERN DOTS-123678;So;0;L;;;;;N;;;;;
+28E8;BRAILLE PATTERN DOTS-4678;So;0;L;;;;;N;;;;;
+28E9;BRAILLE PATTERN DOTS-14678;So;0;L;;;;;N;;;;;
+28EA;BRAILLE PATTERN DOTS-24678;So;0;L;;;;;N;;;;;
+28EB;BRAILLE PATTERN DOTS-124678;So;0;L;;;;;N;;;;;
+28EC;BRAILLE PATTERN DOTS-34678;So;0;L;;;;;N;;;;;
+28ED;BRAILLE PATTERN DOTS-134678;So;0;L;;;;;N;;;;;
+28EE;BRAILLE PATTERN DOTS-234678;So;0;L;;;;;N;;;;;
+28EF;BRAILLE PATTERN DOTS-1234678;So;0;L;;;;;N;;;;;
+28F0;BRAILLE PATTERN DOTS-5678;So;0;L;;;;;N;;;;;
+28F1;BRAILLE PATTERN DOTS-15678;So;0;L;;;;;N;;;;;
+28F2;BRAILLE PATTERN DOTS-25678;So;0;L;;;;;N;;;;;
+28F3;BRAILLE PATTERN DOTS-125678;So;0;L;;;;;N;;;;;
+28F4;BRAILLE PATTERN DOTS-35678;So;0;L;;;;;N;;;;;
+28F5;BRAILLE PATTERN DOTS-135678;So;0;L;;;;;N;;;;;
+28F6;BRAILLE PATTERN DOTS-235678;So;0;L;;;;;N;;;;;
+28F7;BRAILLE PATTERN DOTS-1235678;So;0;L;;;;;N;;;;;
+28F8;BRAILLE PATTERN DOTS-45678;So;0;L;;;;;N;;;;;
+28F9;BRAILLE PATTERN DOTS-145678;So;0;L;;;;;N;;;;;
+28FA;BRAILLE PATTERN DOTS-245678;So;0;L;;;;;N;;;;;
+28FB;BRAILLE PATTERN DOTS-1245678;So;0;L;;;;;N;;;;;
+28FC;BRAILLE PATTERN DOTS-345678;So;0;L;;;;;N;;;;;
+28FD;BRAILLE PATTERN DOTS-1345678;So;0;L;;;;;N;;;;;
+28FE;BRAILLE PATTERN DOTS-2345678;So;0;L;;;;;N;;;;;
+28FF;BRAILLE PATTERN DOTS-12345678;So;0;L;;;;;N;;;;;
+2900;RIGHTWARDS TWO-HEADED ARROW WITH VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2901;RIGHTWARDS TWO-HEADED ARROW WITH DOUBLE VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2902;LEFTWARDS DOUBLE ARROW WITH VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2903;RIGHTWARDS DOUBLE ARROW WITH VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2904;LEFT RIGHT DOUBLE ARROW WITH VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2905;RIGHTWARDS TWO-HEADED ARROW FROM BAR;Sm;0;ON;;;;;N;;;;;
+2906;LEFTWARDS DOUBLE ARROW FROM BAR;Sm;0;ON;;;;;N;;;;;
+2907;RIGHTWARDS DOUBLE ARROW FROM BAR;Sm;0;ON;;;;;N;;;;;
+2908;DOWNWARDS ARROW WITH HORIZONTAL STROKE;Sm;0;ON;;;;;N;;;;;
+2909;UPWARDS ARROW WITH HORIZONTAL STROKE;Sm;0;ON;;;;;N;;;;;
+290A;UPWARDS TRIPLE ARROW;Sm;0;ON;;;;;N;;;;;
+290B;DOWNWARDS TRIPLE ARROW;Sm;0;ON;;;;;N;;;;;
+290C;LEFTWARDS DOUBLE DASH ARROW;Sm;0;ON;;;;;N;;;;;
+290D;RIGHTWARDS DOUBLE DASH ARROW;Sm;0;ON;;;;;N;;;;;
+290E;LEFTWARDS TRIPLE DASH ARROW;Sm;0;ON;;;;;N;;;;;
+290F;RIGHTWARDS TRIPLE DASH ARROW;Sm;0;ON;;;;;N;;;;;
+2910;RIGHTWARDS TWO-HEADED TRIPLE DASH ARROW;Sm;0;ON;;;;;N;;;;;
+2911;RIGHTWARDS ARROW WITH DOTTED STEM;Sm;0;ON;;;;;N;;;;;
+2912;UPWARDS ARROW TO BAR;Sm;0;ON;;;;;N;;;;;
+2913;DOWNWARDS ARROW TO BAR;Sm;0;ON;;;;;N;;;;;
+2914;RIGHTWARDS ARROW WITH TAIL WITH VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2915;RIGHTWARDS ARROW WITH TAIL WITH DOUBLE VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2916;RIGHTWARDS TWO-HEADED ARROW WITH TAIL;Sm;0;ON;;;;;N;;;;;
+2917;RIGHTWARDS TWO-HEADED ARROW WITH TAIL WITH VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2918;RIGHTWARDS TWO-HEADED ARROW WITH TAIL WITH DOUBLE VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2919;LEFTWARDS ARROW-TAIL;Sm;0;ON;;;;;N;;;;;
+291A;RIGHTWARDS ARROW-TAIL;Sm;0;ON;;;;;N;;;;;
+291B;LEFTWARDS DOUBLE ARROW-TAIL;Sm;0;ON;;;;;N;;;;;
+291C;RIGHTWARDS DOUBLE ARROW-TAIL;Sm;0;ON;;;;;N;;;;;
+291D;LEFTWARDS ARROW TO BLACK DIAMOND;Sm;0;ON;;;;;N;;;;;
+291E;RIGHTWARDS ARROW TO BLACK DIAMOND;Sm;0;ON;;;;;N;;;;;
+291F;LEFTWARDS ARROW FROM BAR TO BLACK DIAMOND;Sm;0;ON;;;;;N;;;;;
+2920;RIGHTWARDS ARROW FROM BAR TO BLACK DIAMOND;Sm;0;ON;;;;;N;;;;;
+2921;NORTH WEST AND SOUTH EAST ARROW;Sm;0;ON;;;;;N;;;;;
+2922;NORTH EAST AND SOUTH WEST ARROW;Sm;0;ON;;;;;N;;;;;
+2923;NORTH WEST ARROW WITH HOOK;Sm;0;ON;;;;;N;;;;;
+2924;NORTH EAST ARROW WITH HOOK;Sm;0;ON;;;;;N;;;;;
+2925;SOUTH EAST ARROW WITH HOOK;Sm;0;ON;;;;;N;;;;;
+2926;SOUTH WEST ARROW WITH HOOK;Sm;0;ON;;;;;N;;;;;
+2927;NORTH WEST ARROW AND NORTH EAST ARROW;Sm;0;ON;;;;;N;;;;;
+2928;NORTH EAST ARROW AND SOUTH EAST ARROW;Sm;0;ON;;;;;N;;;;;
+2929;SOUTH EAST ARROW AND SOUTH WEST ARROW;Sm;0;ON;;;;;N;;;;;
+292A;SOUTH WEST ARROW AND NORTH WEST ARROW;Sm;0;ON;;;;;N;;;;;
+292B;RISING DIAGONAL CROSSING FALLING DIAGONAL;Sm;0;ON;;;;;N;;;;;
+292C;FALLING DIAGONAL CROSSING RISING DIAGONAL;Sm;0;ON;;;;;N;;;;;
+292D;SOUTH EAST ARROW CROSSING NORTH EAST ARROW;Sm;0;ON;;;;;N;;;;;
+292E;NORTH EAST ARROW CROSSING SOUTH EAST ARROW;Sm;0;ON;;;;;N;;;;;
+292F;FALLING DIAGONAL CROSSING NORTH EAST ARROW;Sm;0;ON;;;;;N;;;;;
+2930;RISING DIAGONAL CROSSING SOUTH EAST ARROW;Sm;0;ON;;;;;N;;;;;
+2931;NORTH EAST ARROW CROSSING NORTH WEST ARROW;Sm;0;ON;;;;;N;;;;;
+2932;NORTH WEST ARROW CROSSING NORTH EAST ARROW;Sm;0;ON;;;;;N;;;;;
+2933;WAVE ARROW POINTING DIRECTLY RIGHT;Sm;0;ON;;;;;N;;;;;
+2934;ARROW POINTING RIGHTWARDS THEN CURVING UPWARDS;Sm;0;ON;;;;;N;;;;;
+2935;ARROW POINTING RIGHTWARDS THEN CURVING DOWNWARDS;Sm;0;ON;;;;;N;;;;;
+2936;ARROW POINTING DOWNWARDS THEN CURVING LEFTWARDS;Sm;0;ON;;;;;N;;;;;
+2937;ARROW POINTING DOWNWARDS THEN CURVING RIGHTWARDS;Sm;0;ON;;;;;N;;;;;
+2938;RIGHT-SIDE ARC CLOCKWISE ARROW;Sm;0;ON;;;;;N;;;;;
+2939;LEFT-SIDE ARC ANTICLOCKWISE ARROW;Sm;0;ON;;;;;N;;;;;
+293A;TOP ARC ANTICLOCKWISE ARROW;Sm;0;ON;;;;;N;;;;;
+293B;BOTTOM ARC ANTICLOCKWISE ARROW;Sm;0;ON;;;;;N;;;;;
+293C;TOP ARC CLOCKWISE ARROW WITH MINUS;Sm;0;ON;;;;;N;;;;;
+293D;TOP ARC ANTICLOCKWISE ARROW WITH PLUS;Sm;0;ON;;;;;N;;;;;
+293E;LOWER RIGHT SEMICIRCULAR CLOCKWISE ARROW;Sm;0;ON;;;;;N;;;;;
+293F;LOWER LEFT SEMICIRCULAR ANTICLOCKWISE ARROW;Sm;0;ON;;;;;N;;;;;
+2940;ANTICLOCKWISE CLOSED CIRCLE ARROW;Sm;0;ON;;;;;N;;;;;
+2941;CLOCKWISE CLOSED CIRCLE ARROW;Sm;0;ON;;;;;N;;;;;
+2942;RIGHTWARDS ARROW ABOVE SHORT LEFTWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+2943;LEFTWARDS ARROW ABOVE SHORT RIGHTWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+2944;SHORT RIGHTWARDS ARROW ABOVE LEFTWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+2945;RIGHTWARDS ARROW WITH PLUS BELOW;Sm;0;ON;;;;;N;;;;;
+2946;LEFTWARDS ARROW WITH PLUS BELOW;Sm;0;ON;;;;;N;;;;;
+2947;RIGHTWARDS ARROW THROUGH X;Sm;0;ON;;;;;N;;;;;
+2948;LEFT RIGHT ARROW THROUGH SMALL CIRCLE;Sm;0;ON;;;;;N;;;;;
+2949;UPWARDS TWO-HEADED ARROW FROM SMALL CIRCLE;Sm;0;ON;;;;;N;;;;;
+294A;LEFT BARB UP RIGHT BARB DOWN HARPOON;Sm;0;ON;;;;;N;;;;;
+294B;LEFT BARB DOWN RIGHT BARB UP HARPOON;Sm;0;ON;;;;;N;;;;;
+294C;UP BARB RIGHT DOWN BARB LEFT HARPOON;Sm;0;ON;;;;;N;;;;;
+294D;UP BARB LEFT DOWN BARB RIGHT HARPOON;Sm;0;ON;;;;;N;;;;;
+294E;LEFT BARB UP RIGHT BARB UP HARPOON;Sm;0;ON;;;;;N;;;;;
+294F;UP BARB RIGHT DOWN BARB RIGHT HARPOON;Sm;0;ON;;;;;N;;;;;
+2950;LEFT BARB DOWN RIGHT BARB DOWN HARPOON;Sm;0;ON;;;;;N;;;;;
+2951;UP BARB LEFT DOWN BARB LEFT HARPOON;Sm;0;ON;;;;;N;;;;;
+2952;LEFTWARDS HARPOON WITH BARB UP TO BAR;Sm;0;ON;;;;;N;;;;;
+2953;RIGHTWARDS HARPOON WITH BARB UP TO BAR;Sm;0;ON;;;;;N;;;;;
+2954;UPWARDS HARPOON WITH BARB RIGHT TO BAR;Sm;0;ON;;;;;N;;;;;
+2955;DOWNWARDS HARPOON WITH BARB RIGHT TO BAR;Sm;0;ON;;;;;N;;;;;
+2956;LEFTWARDS HARPOON WITH BARB DOWN TO BAR;Sm;0;ON;;;;;N;;;;;
+2957;RIGHTWARDS HARPOON WITH BARB DOWN TO BAR;Sm;0;ON;;;;;N;;;;;
+2958;UPWARDS HARPOON WITH BARB LEFT TO BAR;Sm;0;ON;;;;;N;;;;;
+2959;DOWNWARDS HARPOON WITH BARB LEFT TO BAR;Sm;0;ON;;;;;N;;;;;
+295A;LEFTWARDS HARPOON WITH BARB UP FROM BAR;Sm;0;ON;;;;;N;;;;;
+295B;RIGHTWARDS HARPOON WITH BARB UP FROM BAR;Sm;0;ON;;;;;N;;;;;
+295C;UPWARDS HARPOON WITH BARB RIGHT FROM BAR;Sm;0;ON;;;;;N;;;;;
+295D;DOWNWARDS HARPOON WITH BARB RIGHT FROM BAR;Sm;0;ON;;;;;N;;;;;
+295E;LEFTWARDS HARPOON WITH BARB DOWN FROM BAR;Sm;0;ON;;;;;N;;;;;
+295F;RIGHTWARDS HARPOON WITH BARB DOWN FROM BAR;Sm;0;ON;;;;;N;;;;;
+2960;UPWARDS HARPOON WITH BARB LEFT FROM BAR;Sm;0;ON;;;;;N;;;;;
+2961;DOWNWARDS HARPOON WITH BARB LEFT FROM BAR;Sm;0;ON;;;;;N;;;;;
+2962;LEFTWARDS HARPOON WITH BARB UP ABOVE LEFTWARDS HARPOON WITH BARB DOWN;Sm;0;ON;;;;;N;;;;;
+2963;UPWARDS HARPOON WITH BARB LEFT BESIDE UPWARDS HARPOON WITH BARB RIGHT;Sm;0;ON;;;;;N;;;;;
+2964;RIGHTWARDS HARPOON WITH BARB UP ABOVE RIGHTWARDS HARPOON WITH BARB DOWN;Sm;0;ON;;;;;N;;;;;
+2965;DOWNWARDS HARPOON WITH BARB LEFT BESIDE DOWNWARDS HARPOON WITH BARB RIGHT;Sm;0;ON;;;;;N;;;;;
+2966;LEFTWARDS HARPOON WITH BARB UP ABOVE RIGHTWARDS HARPOON WITH BARB UP;Sm;0;ON;;;;;N;;;;;
+2967;LEFTWARDS HARPOON WITH BARB DOWN ABOVE RIGHTWARDS HARPOON WITH BARB DOWN;Sm;0;ON;;;;;N;;;;;
+2968;RIGHTWARDS HARPOON WITH BARB UP ABOVE LEFTWARDS HARPOON WITH BARB UP;Sm;0;ON;;;;;N;;;;;
+2969;RIGHTWARDS HARPOON WITH BARB DOWN ABOVE LEFTWARDS HARPOON WITH BARB DOWN;Sm;0;ON;;;;;N;;;;;
+296A;LEFTWARDS HARPOON WITH BARB UP ABOVE LONG DASH;Sm;0;ON;;;;;N;;;;;
+296B;LEFTWARDS HARPOON WITH BARB DOWN BELOW LONG DASH;Sm;0;ON;;;;;N;;;;;
+296C;RIGHTWARDS HARPOON WITH BARB UP ABOVE LONG DASH;Sm;0;ON;;;;;N;;;;;
+296D;RIGHTWARDS HARPOON WITH BARB DOWN BELOW LONG DASH;Sm;0;ON;;;;;N;;;;;
+296E;UPWARDS HARPOON WITH BARB LEFT BESIDE DOWNWARDS HARPOON WITH BARB RIGHT;Sm;0;ON;;;;;N;;;;;
+296F;DOWNWARDS HARPOON WITH BARB LEFT BESIDE UPWARDS HARPOON WITH BARB RIGHT;Sm;0;ON;;;;;N;;;;;
+2970;RIGHT DOUBLE ARROW WITH ROUNDED HEAD;Sm;0;ON;;;;;N;;;;;
+2971;EQUALS SIGN ABOVE RIGHTWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+2972;TILDE OPERATOR ABOVE RIGHTWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+2973;LEFTWARDS ARROW ABOVE TILDE OPERATOR;Sm;0;ON;;;;;N;;;;;
+2974;RIGHTWARDS ARROW ABOVE TILDE OPERATOR;Sm;0;ON;;;;;N;;;;;
+2975;RIGHTWARDS ARROW ABOVE ALMOST EQUAL TO;Sm;0;ON;;;;;N;;;;;
+2976;LESS-THAN ABOVE LEFTWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+2977;LEFTWARDS ARROW THROUGH LESS-THAN;Sm;0;ON;;;;;N;;;;;
+2978;GREATER-THAN ABOVE RIGHTWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+2979;SUBSET ABOVE RIGHTWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+297A;LEFTWARDS ARROW THROUGH SUBSET;Sm;0;ON;;;;;N;;;;;
+297B;SUPERSET ABOVE LEFTWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+297C;LEFT FISH TAIL;Sm;0;ON;;;;;N;;;;;
+297D;RIGHT FISH TAIL;Sm;0;ON;;;;;N;;;;;
+297E;UP FISH TAIL;Sm;0;ON;;;;;N;;;;;
+297F;DOWN FISH TAIL;Sm;0;ON;;;;;N;;;;;
+2980;TRIPLE VERTICAL BAR DELIMITER;Sm;0;ON;;;;;N;;;;;
+2981;Z NOTATION SPOT;Sm;0;ON;;;;;N;;;;;
+2982;Z NOTATION TYPE COLON;Sm;0;ON;;;;;N;;;;;
+2983;LEFT WHITE CURLY BRACKET;Ps;0;ON;;;;;Y;;;;;
+2984;RIGHT WHITE CURLY BRACKET;Pe;0;ON;;;;;Y;;;;;
+2985;LEFT WHITE PARENTHESIS;Ps;0;ON;;;;;Y;;;;;
+2986;RIGHT WHITE PARENTHESIS;Pe;0;ON;;;;;Y;;;;;
+2987;Z NOTATION LEFT IMAGE BRACKET;Ps;0;ON;;;;;Y;;;;;
+2988;Z NOTATION RIGHT IMAGE BRACKET;Pe;0;ON;;;;;Y;;;;;
+2989;Z NOTATION LEFT BINDING BRACKET;Ps;0;ON;;;;;Y;;;;;
+298A;Z NOTATION RIGHT BINDING BRACKET;Pe;0;ON;;;;;Y;;;;;
+298B;LEFT SQUARE BRACKET WITH UNDERBAR;Ps;0;ON;;;;;Y;;;;;
+298C;RIGHT SQUARE BRACKET WITH UNDERBAR;Pe;0;ON;;;;;Y;;;;;
+298D;LEFT SQUARE BRACKET WITH TICK IN TOP CORNER;Ps;0;ON;;;;;Y;;;;;
+298E;RIGHT SQUARE BRACKET WITH TICK IN BOTTOM CORNER;Pe;0;ON;;;;;Y;;;;;
+298F;LEFT SQUARE BRACKET WITH TICK IN BOTTOM CORNER;Ps;0;ON;;;;;Y;;;;;
+2990;RIGHT SQUARE BRACKET WITH TICK IN TOP CORNER;Pe;0;ON;;;;;Y;;;;;
+2991;LEFT ANGLE BRACKET WITH DOT;Ps;0;ON;;;;;Y;;;;;
+2992;RIGHT ANGLE BRACKET WITH DOT;Pe;0;ON;;;;;Y;;;;;
+2993;LEFT ARC LESS-THAN BRACKET;Ps;0;ON;;;;;Y;;;;;
+2994;RIGHT ARC GREATER-THAN BRACKET;Pe;0;ON;;;;;Y;;;;;
+2995;DOUBLE LEFT ARC GREATER-THAN BRACKET;Ps;0;ON;;;;;Y;;;;;
+2996;DOUBLE RIGHT ARC LESS-THAN BRACKET;Pe;0;ON;;;;;Y;;;;;
+2997;LEFT BLACK TORTOISE SHELL BRACKET;Ps;0;ON;;;;;Y;;;;;
+2998;RIGHT BLACK TORTOISE SHELL BRACKET;Pe;0;ON;;;;;Y;;;;;
+2999;DOTTED FENCE;Sm;0;ON;;;;;N;;;;;
+299A;VERTICAL ZIGZAG LINE;Sm;0;ON;;;;;N;;;;;
+299B;MEASURED ANGLE OPENING LEFT;Sm;0;ON;;;;;Y;;;;;
+299C;RIGHT ANGLE VARIANT WITH SQUARE;Sm;0;ON;;;;;Y;;;;;
+299D;MEASURED RIGHT ANGLE WITH DOT;Sm;0;ON;;;;;Y;;;;;
+299E;ANGLE WITH S INSIDE;Sm;0;ON;;;;;Y;;;;;
+299F;ACUTE ANGLE;Sm;0;ON;;;;;Y;;;;;
+29A0;SPHERICAL ANGLE OPENING LEFT;Sm;0;ON;;;;;Y;;;;;
+29A1;SPHERICAL ANGLE OPENING UP;Sm;0;ON;;;;;Y;;;;;
+29A2;TURNED ANGLE;Sm;0;ON;;;;;Y;;;;;
+29A3;REVERSED ANGLE;Sm;0;ON;;;;;Y;;;;;
+29A4;ANGLE WITH UNDERBAR;Sm;0;ON;;;;;Y;;;;;
+29A5;REVERSED ANGLE WITH UNDERBAR;Sm;0;ON;;;;;Y;;;;;
+29A6;OBLIQUE ANGLE OPENING UP;Sm;0;ON;;;;;Y;;;;;
+29A7;OBLIQUE ANGLE OPENING DOWN;Sm;0;ON;;;;;Y;;;;;
+29A8;MEASURED ANGLE WITH OPEN ARM ENDING IN ARROW POINTING UP AND RIGHT;Sm;0;ON;;;;;Y;;;;;
+29A9;MEASURED ANGLE WITH OPEN ARM ENDING IN ARROW POINTING UP AND LEFT;Sm;0;ON;;;;;Y;;;;;
+29AA;MEASURED ANGLE WITH OPEN ARM ENDING IN ARROW POINTING DOWN AND RIGHT;Sm;0;ON;;;;;Y;;;;;
+29AB;MEASURED ANGLE WITH OPEN ARM ENDING IN ARROW POINTING DOWN AND LEFT;Sm;0;ON;;;;;Y;;;;;
+29AC;MEASURED ANGLE WITH OPEN ARM ENDING IN ARROW POINTING RIGHT AND UP;Sm;0;ON;;;;;Y;;;;;
+29AD;MEASURED ANGLE WITH OPEN ARM ENDING IN ARROW POINTING LEFT AND UP;Sm;0;ON;;;;;Y;;;;;
+29AE;MEASURED ANGLE WITH OPEN ARM ENDING IN ARROW POINTING RIGHT AND DOWN;Sm;0;ON;;;;;Y;;;;;
+29AF;MEASURED ANGLE WITH OPEN ARM ENDING IN ARROW POINTING LEFT AND DOWN;Sm;0;ON;;;;;Y;;;;;
+29B0;REVERSED EMPTY SET;Sm;0;ON;;;;;N;;;;;
+29B1;EMPTY SET WITH OVERBAR;Sm;0;ON;;;;;N;;;;;
+29B2;EMPTY SET WITH SMALL CIRCLE ABOVE;Sm;0;ON;;;;;N;;;;;
+29B3;EMPTY SET WITH RIGHT ARROW ABOVE;Sm;0;ON;;;;;N;;;;;
+29B4;EMPTY SET WITH LEFT ARROW ABOVE;Sm;0;ON;;;;;N;;;;;
+29B5;CIRCLE WITH HORIZONTAL BAR;Sm;0;ON;;;;;N;;;;;
+29B6;CIRCLED VERTICAL BAR;Sm;0;ON;;;;;N;;;;;
+29B7;CIRCLED PARALLEL;Sm;0;ON;;;;;N;;;;;
+29B8;CIRCLED REVERSE SOLIDUS;Sm;0;ON;;;;;Y;;;;;
+29B9;CIRCLED PERPENDICULAR;Sm;0;ON;;;;;N;;;;;
+29BA;CIRCLE DIVIDED BY HORIZONTAL BAR AND TOP HALF DIVIDED BY VERTICAL BAR;Sm;0;ON;;;;;N;;;;;
+29BB;CIRCLE WITH SUPERIMPOSED X;Sm;0;ON;;;;;N;;;;;
+29BC;CIRCLED ANTICLOCKWISE-ROTATED DIVISION SIGN;Sm;0;ON;;;;;N;;;;;
+29BD;UP ARROW THROUGH CIRCLE;Sm;0;ON;;;;;N;;;;;
+29BE;CIRCLED WHITE BULLET;Sm;0;ON;;;;;N;;;;;
+29BF;CIRCLED BULLET;Sm;0;ON;;;;;N;;;;;
+29C0;CIRCLED LESS-THAN;Sm;0;ON;;;;;Y;;;;;
+29C1;CIRCLED GREATER-THAN;Sm;0;ON;;;;;Y;;;;;
+29C2;CIRCLE WITH SMALL CIRCLE TO THE RIGHT;Sm;0;ON;;;;;Y;;;;;
+29C3;CIRCLE WITH TWO HORIZONTAL STROKES TO THE RIGHT;Sm;0;ON;;;;;Y;;;;;
+29C4;SQUARED RISING DIAGONAL SLASH;Sm;0;ON;;;;;Y;;;;;
+29C5;SQUARED FALLING DIAGONAL SLASH;Sm;0;ON;;;;;Y;;;;;
+29C6;SQUARED ASTERISK;Sm;0;ON;;;;;N;;;;;
+29C7;SQUARED SMALL CIRCLE;Sm;0;ON;;;;;N;;;;;
+29C8;SQUARED SQUARE;Sm;0;ON;;;;;N;;;;;
+29C9;TWO JOINED SQUARES;Sm;0;ON;;;;;Y;;;;;
+29CA;TRIANGLE WITH DOT ABOVE;Sm;0;ON;;;;;N;;;;;
+29CB;TRIANGLE WITH UNDERBAR;Sm;0;ON;;;;;N;;;;;
+29CC;S IN TRIANGLE;Sm;0;ON;;;;;N;;;;;
+29CD;TRIANGLE WITH SERIFS AT BOTTOM;Sm;0;ON;;;;;N;;;;;
+29CE;RIGHT TRIANGLE ABOVE LEFT TRIANGLE;Sm;0;ON;;;;;Y;;;;;
+29CF;LEFT TRIANGLE BESIDE VERTICAL BAR;Sm;0;ON;;;;;Y;;;;;
+29D0;VERTICAL BAR BESIDE RIGHT TRIANGLE;Sm;0;ON;;;;;Y;;;;;
+29D1;BOWTIE WITH LEFT HALF BLACK;Sm;0;ON;;;;;Y;;;;;
+29D2;BOWTIE WITH RIGHT HALF BLACK;Sm;0;ON;;;;;Y;;;;;
+29D3;BLACK BOWTIE;Sm;0;ON;;;;;N;;;;;
+29D4;TIMES WITH LEFT HALF BLACK;Sm;0;ON;;;;;Y;;;;;
+29D5;TIMES WITH RIGHT HALF BLACK;Sm;0;ON;;;;;Y;;;;;
+29D6;WHITE HOURGLASS;Sm;0;ON;;;;;N;;;;;
+29D7;BLACK HOURGLASS;Sm;0;ON;;;;;N;;;;;
+29D8;LEFT WIGGLY FENCE;Ps;0;ON;;;;;Y;;;;;
+29D9;RIGHT WIGGLY FENCE;Pe;0;ON;;;;;Y;;;;;
+29DA;LEFT DOUBLE WIGGLY FENCE;Ps;0;ON;;;;;Y;;;;;
+29DB;RIGHT DOUBLE WIGGLY FENCE;Pe;0;ON;;;;;Y;;;;;
+29DC;INCOMPLETE INFINITY;Sm;0;ON;;;;;Y;;;;;
+29DD;TIE OVER INFINITY;Sm;0;ON;;;;;N;;;;;
+29DE;INFINITY NEGATED WITH VERTICAL BAR;Sm;0;ON;;;;;N;;;;;
+29DF;DOUBLE-ENDED MULTIMAP;Sm;0;ON;;;;;N;;;;;
+29E0;SQUARE WITH CONTOURED OUTLINE;Sm;0;ON;;;;;N;;;;;
+29E1;INCREASES AS;Sm;0;ON;;;;;Y;;;;;
+29E2;SHUFFLE PRODUCT;Sm;0;ON;;;;;N;;;;;
+29E3;EQUALS SIGN AND SLANTED PARALLEL;Sm;0;ON;;;;;Y;;;;;
+29E4;EQUALS SIGN AND SLANTED PARALLEL WITH TILDE ABOVE;Sm;0;ON;;;;;Y;;;;;
+29E5;IDENTICAL TO AND SLANTED PARALLEL;Sm;0;ON;;;;;Y;;;;;
+29E6;GLEICH STARK;Sm;0;ON;;;;;N;;;;;
+29E7;THERMODYNAMIC;Sm;0;ON;;;;;N;;;;;
+29E8;DOWN-POINTING TRIANGLE WITH LEFT HALF BLACK;Sm;0;ON;;;;;Y;;;;;
+29E9;DOWN-POINTING TRIANGLE WITH RIGHT HALF BLACK;Sm;0;ON;;;;;Y;;;;;
+29EA;BLACK DIAMOND WITH DOWN ARROW;Sm;0;ON;;;;;N;;;;;
+29EB;BLACK LOZENGE;Sm;0;ON;;;;;N;;;;;
+29EC;WHITE CIRCLE WITH DOWN ARROW;Sm;0;ON;;;;;N;;;;;
+29ED;BLACK CIRCLE WITH DOWN ARROW;Sm;0;ON;;;;;N;;;;;
+29EE;ERROR-BARRED WHITE SQUARE;Sm;0;ON;;;;;N;;;;;
+29EF;ERROR-BARRED BLACK SQUARE;Sm;0;ON;;;;;N;;;;;
+29F0;ERROR-BARRED WHITE DIAMOND;Sm;0;ON;;;;;N;;;;;
+29F1;ERROR-BARRED BLACK DIAMOND;Sm;0;ON;;;;;N;;;;;
+29F2;ERROR-BARRED WHITE CIRCLE;Sm;0;ON;;;;;N;;;;;
+29F3;ERROR-BARRED BLACK CIRCLE;Sm;0;ON;;;;;N;;;;;
+29F4;RULE-DELAYED;Sm;0;ON;;;;;Y;;;;;
+29F5;REVERSE SOLIDUS OPERATOR;Sm;0;ON;;;;;Y;;;;;
+29F6;SOLIDUS WITH OVERBAR;Sm;0;ON;;;;;Y;;;;;
+29F7;REVERSE SOLIDUS WITH HORIZONTAL STROKE;Sm;0;ON;;;;;Y;;;;;
+29F8;BIG SOLIDUS;Sm;0;ON;;;;;Y;;;;;
+29F9;BIG REVERSE SOLIDUS;Sm;0;ON;;;;;Y;;;;;
+29FA;DOUBLE PLUS;Sm;0;ON;;;;;N;;;;;
+29FB;TRIPLE PLUS;Sm;0;ON;;;;;N;;;;;
+29FC;LEFT-POINTING CURVED ANGLE BRACKET;Ps;0;ON;;;;;Y;;;;;
+29FD;RIGHT-POINTING CURVED ANGLE BRACKET;Pe;0;ON;;;;;Y;;;;;
+29FE;TINY;Sm;0;ON;;;;;N;;;;;
+29FF;MINY;Sm;0;ON;;;;;N;;;;;
+2A00;N-ARY CIRCLED DOT OPERATOR;Sm;0;ON;;;;;N;;;;;
+2A01;N-ARY CIRCLED PLUS OPERATOR;Sm;0;ON;;;;;N;;;;;
+2A02;N-ARY CIRCLED TIMES OPERATOR;Sm;0;ON;;;;;N;;;;;
+2A03;N-ARY UNION OPERATOR WITH DOT;Sm;0;ON;;;;;N;;;;;
+2A04;N-ARY UNION OPERATOR WITH PLUS;Sm;0;ON;;;;;N;;;;;
+2A05;N-ARY SQUARE INTERSECTION OPERATOR;Sm;0;ON;;;;;N;;;;;
+2A06;N-ARY SQUARE UNION OPERATOR;Sm;0;ON;;;;;N;;;;;
+2A07;TWO LOGICAL AND OPERATOR;Sm;0;ON;;;;;N;;;;;
+2A08;TWO LOGICAL OR OPERATOR;Sm;0;ON;;;;;N;;;;;
+2A09;N-ARY TIMES OPERATOR;Sm;0;ON;;;;;N;;;;;
+2A0A;MODULO TWO SUM;Sm;0;ON;;;;;Y;;;;;
+2A0B;SUMMATION WITH INTEGRAL;Sm;0;ON;;;;;Y;;;;;
+2A0C;QUADRUPLE INTEGRAL OPERATOR;Sm;0;ON;<compat> 222B 222B 222B 222B;;;;Y;;;;;
+2A0D;FINITE PART INTEGRAL;Sm;0;ON;;;;;Y;;;;;
+2A0E;INTEGRAL WITH DOUBLE STROKE;Sm;0;ON;;;;;Y;;;;;
+2A0F;INTEGRAL AVERAGE WITH SLASH;Sm;0;ON;;;;;Y;;;;;
+2A10;CIRCULATION FUNCTION;Sm;0;ON;;;;;Y;;;;;
+2A11;ANTICLOCKWISE INTEGRATION;Sm;0;ON;;;;;Y;;;;;
+2A12;LINE INTEGRATION WITH RECTANGULAR PATH AROUND POLE;Sm;0;ON;;;;;Y;;;;;
+2A13;LINE INTEGRATION WITH SEMICIRCULAR PATH AROUND POLE;Sm;0;ON;;;;;Y;;;;;
+2A14;LINE INTEGRATION NOT INCLUDING THE POLE;Sm;0;ON;;;;;Y;;;;;
+2A15;INTEGRAL AROUND A POINT OPERATOR;Sm;0;ON;;;;;Y;;;;;
+2A16;QUATERNION INTEGRAL OPERATOR;Sm;0;ON;;;;;Y;;;;;
+2A17;INTEGRAL WITH LEFTWARDS ARROW WITH HOOK;Sm;0;ON;;;;;Y;;;;;
+2A18;INTEGRAL WITH TIMES SIGN;Sm;0;ON;;;;;Y;;;;;
+2A19;INTEGRAL WITH INTERSECTION;Sm;0;ON;;;;;Y;;;;;
+2A1A;INTEGRAL WITH UNION;Sm;0;ON;;;;;Y;;;;;
+2A1B;INTEGRAL WITH OVERBAR;Sm;0;ON;;;;;Y;;;;;
+2A1C;INTEGRAL WITH UNDERBAR;Sm;0;ON;;;;;Y;;;;;
+2A1D;JOIN;Sm;0;ON;;;;;N;;;;;
+2A1E;LARGE LEFT TRIANGLE OPERATOR;Sm;0;ON;;;;;Y;;;;;
+2A1F;Z NOTATION SCHEMA COMPOSITION;Sm;0;ON;;;;;Y;;;;;
+2A20;Z NOTATION SCHEMA PIPING;Sm;0;ON;;;;;Y;;;;;
+2A21;Z NOTATION SCHEMA PROJECTION;Sm;0;ON;;;;;Y;;;;;
+2A22;PLUS SIGN WITH SMALL CIRCLE ABOVE;Sm;0;ON;;;;;N;;;;;
+2A23;PLUS SIGN WITH CIRCUMFLEX ACCENT ABOVE;Sm;0;ON;;;;;N;;;;;
+2A24;PLUS SIGN WITH TILDE ABOVE;Sm;0;ON;;;;;Y;;;;;
+2A25;PLUS SIGN WITH DOT BELOW;Sm;0;ON;;;;;N;;;;;
+2A26;PLUS SIGN WITH TILDE BELOW;Sm;0;ON;;;;;Y;;;;;
+2A27;PLUS SIGN WITH SUBSCRIPT TWO;Sm;0;ON;;;;;N;;;;;
+2A28;PLUS SIGN WITH BLACK TRIANGLE;Sm;0;ON;;;;;N;;;;;
+2A29;MINUS SIGN WITH COMMA ABOVE;Sm;0;ON;;;;;Y;;;;;
+2A2A;MINUS SIGN WITH DOT BELOW;Sm;0;ON;;;;;N;;;;;
+2A2B;MINUS SIGN WITH FALLING DOTS;Sm;0;ON;;;;;Y;;;;;
+2A2C;MINUS SIGN WITH RISING DOTS;Sm;0;ON;;;;;Y;;;;;
+2A2D;PLUS SIGN IN LEFT HALF CIRCLE;Sm;0;ON;;;;;Y;;;;;
+2A2E;PLUS SIGN IN RIGHT HALF CIRCLE;Sm;0;ON;;;;;Y;;;;;
+2A2F;VECTOR OR CROSS PRODUCT;Sm;0;ON;;;;;N;;;;;
+2A30;MULTIPLICATION SIGN WITH DOT ABOVE;Sm;0;ON;;;;;N;;;;;
+2A31;MULTIPLICATION SIGN WITH UNDERBAR;Sm;0;ON;;;;;N;;;;;
+2A32;SEMIDIRECT PRODUCT WITH BOTTOM CLOSED;Sm;0;ON;;;;;N;;;;;
+2A33;SMASH PRODUCT;Sm;0;ON;;;;;N;;;;;
+2A34;MULTIPLICATION SIGN IN LEFT HALF CIRCLE;Sm;0;ON;;;;;Y;;;;;
+2A35;MULTIPLICATION SIGN IN RIGHT HALF CIRCLE;Sm;0;ON;;;;;Y;;;;;
+2A36;CIRCLED MULTIPLICATION SIGN WITH CIRCUMFLEX ACCENT;Sm;0;ON;;;;;N;;;;;
+2A37;MULTIPLICATION SIGN IN DOUBLE CIRCLE;Sm;0;ON;;;;;N;;;;;
+2A38;CIRCLED DIVISION SIGN;Sm;0;ON;;;;;N;;;;;
+2A39;PLUS SIGN IN TRIANGLE;Sm;0;ON;;;;;N;;;;;
+2A3A;MINUS SIGN IN TRIANGLE;Sm;0;ON;;;;;N;;;;;
+2A3B;MULTIPLICATION SIGN IN TRIANGLE;Sm;0;ON;;;;;N;;;;;
+2A3C;INTERIOR PRODUCT;Sm;0;ON;;;;;Y;;;;;
+2A3D;RIGHTHAND INTERIOR PRODUCT;Sm;0;ON;;;;;Y;;;;;
+2A3E;Z NOTATION RELATIONAL COMPOSITION;Sm;0;ON;;;;;Y;;;;;
+2A3F;AMALGAMATION OR COPRODUCT;Sm;0;ON;;;;;N;;;;;
+2A40;INTERSECTION WITH DOT;Sm;0;ON;;;;;N;;;;;
+2A41;UNION WITH MINUS SIGN;Sm;0;ON;;;;;N;;;;;
+2A42;UNION WITH OVERBAR;Sm;0;ON;;;;;N;;;;;
+2A43;INTERSECTION WITH OVERBAR;Sm;0;ON;;;;;N;;;;;
+2A44;INTERSECTION WITH LOGICAL AND;Sm;0;ON;;;;;N;;;;;
+2A45;UNION WITH LOGICAL OR;Sm;0;ON;;;;;N;;;;;
+2A46;UNION ABOVE INTERSECTION;Sm;0;ON;;;;;N;;;;;
+2A47;INTERSECTION ABOVE UNION;Sm;0;ON;;;;;N;;;;;
+2A48;UNION ABOVE BAR ABOVE INTERSECTION;Sm;0;ON;;;;;N;;;;;
+2A49;INTERSECTION ABOVE BAR ABOVE UNION;Sm;0;ON;;;;;N;;;;;
+2A4A;UNION BESIDE AND JOINED WITH UNION;Sm;0;ON;;;;;N;;;;;
+2A4B;INTERSECTION BESIDE AND JOINED WITH INTERSECTION;Sm;0;ON;;;;;N;;;;;
+2A4C;CLOSED UNION WITH SERIFS;Sm;0;ON;;;;;N;;;;;
+2A4D;CLOSED INTERSECTION WITH SERIFS;Sm;0;ON;;;;;N;;;;;
+2A4E;DOUBLE SQUARE INTERSECTION;Sm;0;ON;;;;;N;;;;;
+2A4F;DOUBLE SQUARE UNION;Sm;0;ON;;;;;N;;;;;
+2A50;CLOSED UNION WITH SERIFS AND SMASH PRODUCT;Sm;0;ON;;;;;N;;;;;
+2A51;LOGICAL AND WITH DOT ABOVE;Sm;0;ON;;;;;N;;;;;
+2A52;LOGICAL OR WITH DOT ABOVE;Sm;0;ON;;;;;N;;;;;
+2A53;DOUBLE LOGICAL AND;Sm;0;ON;;;;;N;;;;;
+2A54;DOUBLE LOGICAL OR;Sm;0;ON;;;;;N;;;;;
+2A55;TWO INTERSECTING LOGICAL AND;Sm;0;ON;;;;;N;;;;;
+2A56;TWO INTERSECTING LOGICAL OR;Sm;0;ON;;;;;N;;;;;
+2A57;SLOPING LARGE OR;Sm;0;ON;;;;;Y;;;;;
+2A58;SLOPING LARGE AND;Sm;0;ON;;;;;Y;;;;;
+2A59;LOGICAL OR OVERLAPPING LOGICAL AND;Sm;0;ON;;;;;N;;;;;
+2A5A;LOGICAL AND WITH MIDDLE STEM;Sm;0;ON;;;;;N;;;;;
+2A5B;LOGICAL OR WITH MIDDLE STEM;Sm;0;ON;;;;;N;;;;;
+2A5C;LOGICAL AND WITH HORIZONTAL DASH;Sm;0;ON;;;;;N;;;;;
+2A5D;LOGICAL OR WITH HORIZONTAL DASH;Sm;0;ON;;;;;N;;;;;
+2A5E;LOGICAL AND WITH DOUBLE OVERBAR;Sm;0;ON;;;;;N;;;;;
+2A5F;LOGICAL AND WITH UNDERBAR;Sm;0;ON;;;;;N;;;;;
+2A60;LOGICAL AND WITH DOUBLE UNDERBAR;Sm;0;ON;;;;;N;;;;;
+2A61;SMALL VEE WITH UNDERBAR;Sm;0;ON;;;;;N;;;;;
+2A62;LOGICAL OR WITH DOUBLE OVERBAR;Sm;0;ON;;;;;N;;;;;
+2A63;LOGICAL OR WITH DOUBLE UNDERBAR;Sm;0;ON;;;;;N;;;;;
+2A64;Z NOTATION DOMAIN ANTIRESTRICTION;Sm;0;ON;;;;;Y;;;;;
+2A65;Z NOTATION RANGE ANTIRESTRICTION;Sm;0;ON;;;;;Y;;;;;
+2A66;EQUALS SIGN WITH DOT BELOW;Sm;0;ON;;;;;N;;;;;
+2A67;IDENTICAL WITH DOT ABOVE;Sm;0;ON;;;;;N;;;;;
+2A68;TRIPLE HORIZONTAL BAR WITH DOUBLE VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2A69;TRIPLE HORIZONTAL BAR WITH TRIPLE VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2A6A;TILDE OPERATOR WITH DOT ABOVE;Sm;0;ON;;;;;Y;;;;;
+2A6B;TILDE OPERATOR WITH RISING DOTS;Sm;0;ON;;;;;Y;;;;;
+2A6C;SIMILAR MINUS SIMILAR;Sm;0;ON;;;;;Y;;;;;
+2A6D;CONGRUENT WITH DOT ABOVE;Sm;0;ON;;;;;Y;;;;;
+2A6E;EQUALS WITH ASTERISK;Sm;0;ON;;;;;N;;;;;
+2A6F;ALMOST EQUAL TO WITH CIRCUMFLEX ACCENT;Sm;0;ON;;;;;Y;;;;;
+2A70;APPROXIMATELY EQUAL OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2A71;EQUALS SIGN ABOVE PLUS SIGN;Sm;0;ON;;;;;N;;;;;
+2A72;PLUS SIGN ABOVE EQUALS SIGN;Sm;0;ON;;;;;N;;;;;
+2A73;EQUALS SIGN ABOVE TILDE OPERATOR;Sm;0;ON;;;;;Y;;;;;
+2A74;DOUBLE COLON EQUAL;Sm;0;ON;<compat> 003A 003A 003D;;;;Y;;;;;
+2A75;TWO CONSECUTIVE EQUALS SIGNS;Sm;0;ON;<compat> 003D 003D;;;;N;;;;;
+2A76;THREE CONSECUTIVE EQUALS SIGNS;Sm;0;ON;<compat> 003D 003D 003D;;;;N;;;;;
+2A77;EQUALS SIGN WITH TWO DOTS ABOVE AND TWO DOTS BELOW;Sm;0;ON;;;;;N;;;;;
+2A78;EQUIVALENT WITH FOUR DOTS ABOVE;Sm;0;ON;;;;;N;;;;;
+2A79;LESS-THAN WITH CIRCLE INSIDE;Sm;0;ON;;;;;Y;;;;;
+2A7A;GREATER-THAN WITH CIRCLE INSIDE;Sm;0;ON;;;;;Y;;;;;
+2A7B;LESS-THAN WITH QUESTION MARK ABOVE;Sm;0;ON;;;;;Y;;;;;
+2A7C;GREATER-THAN WITH QUESTION MARK ABOVE;Sm;0;ON;;;;;Y;;;;;
+2A7D;LESS-THAN OR SLANTED EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2A7E;GREATER-THAN OR SLANTED EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2A7F;LESS-THAN OR SLANTED EQUAL TO WITH DOT INSIDE;Sm;0;ON;;;;;Y;;;;;
+2A80;GREATER-THAN OR SLANTED EQUAL TO WITH DOT INSIDE;Sm;0;ON;;;;;Y;;;;;
+2A81;LESS-THAN OR SLANTED EQUAL TO WITH DOT ABOVE;Sm;0;ON;;;;;Y;;;;;
+2A82;GREATER-THAN OR SLANTED EQUAL TO WITH DOT ABOVE;Sm;0;ON;;;;;Y;;;;;
+2A83;LESS-THAN OR SLANTED EQUAL TO WITH DOT ABOVE RIGHT;Sm;0;ON;;;;;Y;;;;;
+2A84;GREATER-THAN OR SLANTED EQUAL TO WITH DOT ABOVE LEFT;Sm;0;ON;;;;;Y;;;;;
+2A85;LESS-THAN OR APPROXIMATE;Sm;0;ON;;;;;Y;;;;;
+2A86;GREATER-THAN OR APPROXIMATE;Sm;0;ON;;;;;Y;;;;;
+2A87;LESS-THAN AND SINGLE-LINE NOT EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2A88;GREATER-THAN AND SINGLE-LINE NOT EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2A89;LESS-THAN AND NOT APPROXIMATE;Sm;0;ON;;;;;Y;;;;;
+2A8A;GREATER-THAN AND NOT APPROXIMATE;Sm;0;ON;;;;;Y;;;;;
+2A8B;LESS-THAN ABOVE DOUBLE-LINE EQUAL ABOVE GREATER-THAN;Sm;0;ON;;;;;Y;;;;;
+2A8C;GREATER-THAN ABOVE DOUBLE-LINE EQUAL ABOVE LESS-THAN;Sm;0;ON;;;;;Y;;;;;
+2A8D;LESS-THAN ABOVE SIMILAR OR EQUAL;Sm;0;ON;;;;;Y;;;;;
+2A8E;GREATER-THAN ABOVE SIMILAR OR EQUAL;Sm;0;ON;;;;;Y;;;;;
+2A8F;LESS-THAN ABOVE SIMILAR ABOVE GREATER-THAN;Sm;0;ON;;;;;Y;;;;;
+2A90;GREATER-THAN ABOVE SIMILAR ABOVE LESS-THAN;Sm;0;ON;;;;;Y;;;;;
+2A91;LESS-THAN ABOVE GREATER-THAN ABOVE DOUBLE-LINE EQUAL;Sm;0;ON;;;;;Y;;;;;
+2A92;GREATER-THAN ABOVE LESS-THAN ABOVE DOUBLE-LINE EQUAL;Sm;0;ON;;;;;Y;;;;;
+2A93;LESS-THAN ABOVE SLANTED EQUAL ABOVE GREATER-THAN ABOVE SLANTED EQUAL;Sm;0;ON;;;;;Y;;;;;
+2A94;GREATER-THAN ABOVE SLANTED EQUAL ABOVE LESS-THAN ABOVE SLANTED EQUAL;Sm;0;ON;;;;;Y;;;;;
+2A95;SLANTED EQUAL TO OR LESS-THAN;Sm;0;ON;;;;;Y;;;;;
+2A96;SLANTED EQUAL TO OR GREATER-THAN;Sm;0;ON;;;;;Y;;;;;
+2A97;SLANTED EQUAL TO OR LESS-THAN WITH DOT INSIDE;Sm;0;ON;;;;;Y;;;;;
+2A98;SLANTED EQUAL TO OR GREATER-THAN WITH DOT INSIDE;Sm;0;ON;;;;;Y;;;;;
+2A99;DOUBLE-LINE EQUAL TO OR LESS-THAN;Sm;0;ON;;;;;Y;;;;;
+2A9A;DOUBLE-LINE EQUAL TO OR GREATER-THAN;Sm;0;ON;;;;;Y;;;;;
+2A9B;DOUBLE-LINE SLANTED EQUAL TO OR LESS-THAN;Sm;0;ON;;;;;Y;;;;;
+2A9C;DOUBLE-LINE SLANTED EQUAL TO OR GREATER-THAN;Sm;0;ON;;;;;Y;;;;;
+2A9D;SIMILAR OR LESS-THAN;Sm;0;ON;;;;;Y;;;;;
+2A9E;SIMILAR OR GREATER-THAN;Sm;0;ON;;;;;Y;;;;;
+2A9F;SIMILAR ABOVE LESS-THAN ABOVE EQUALS SIGN;Sm;0;ON;;;;;Y;;;;;
+2AA0;SIMILAR ABOVE GREATER-THAN ABOVE EQUALS SIGN;Sm;0;ON;;;;;Y;;;;;
+2AA1;DOUBLE NESTED LESS-THAN;Sm;0;ON;;;;;Y;;;;;
+2AA2;DOUBLE NESTED GREATER-THAN;Sm;0;ON;;;;;Y;;;;;
+2AA3;DOUBLE NESTED LESS-THAN WITH UNDERBAR;Sm;0;ON;;;;;Y;;;;;
+2AA4;GREATER-THAN OVERLAPPING LESS-THAN;Sm;0;ON;;;;;N;;;;;
+2AA5;GREATER-THAN BESIDE LESS-THAN;Sm;0;ON;;;;;N;;;;;
+2AA6;LESS-THAN CLOSED BY CURVE;Sm;0;ON;;;;;Y;;;;;
+2AA7;GREATER-THAN CLOSED BY CURVE;Sm;0;ON;;;;;Y;;;;;
+2AA8;LESS-THAN CLOSED BY CURVE ABOVE SLANTED EQUAL;Sm;0;ON;;;;;Y;;;;;
+2AA9;GREATER-THAN CLOSED BY CURVE ABOVE SLANTED EQUAL;Sm;0;ON;;;;;Y;;;;;
+2AAA;SMALLER THAN;Sm;0;ON;;;;;Y;;;;;
+2AAB;LARGER THAN;Sm;0;ON;;;;;Y;;;;;
+2AAC;SMALLER THAN OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2AAD;LARGER THAN OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2AAE;EQUALS SIGN WITH BUMPY ABOVE;Sm;0;ON;;;;;N;;;;;
+2AAF;PRECEDES ABOVE SINGLE-LINE EQUALS SIGN;Sm;0;ON;;;;;Y;;;;;
+2AB0;SUCCEEDS ABOVE SINGLE-LINE EQUALS SIGN;Sm;0;ON;;;;;Y;;;;;
+2AB1;PRECEDES ABOVE SINGLE-LINE NOT EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2AB2;SUCCEEDS ABOVE SINGLE-LINE NOT EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2AB3;PRECEDES ABOVE EQUALS SIGN;Sm;0;ON;;;;;Y;;;;;
+2AB4;SUCCEEDS ABOVE EQUALS SIGN;Sm;0;ON;;;;;Y;;;;;
+2AB5;PRECEDES ABOVE NOT EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2AB6;SUCCEEDS ABOVE NOT EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2AB7;PRECEDES ABOVE ALMOST EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2AB8;SUCCEEDS ABOVE ALMOST EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2AB9;PRECEDES ABOVE NOT ALMOST EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2ABA;SUCCEEDS ABOVE NOT ALMOST EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2ABB;DOUBLE PRECEDES;Sm;0;ON;;;;;Y;;;;;
+2ABC;DOUBLE SUCCEEDS;Sm;0;ON;;;;;Y;;;;;
+2ABD;SUBSET WITH DOT;Sm;0;ON;;;;;Y;;;;;
+2ABE;SUPERSET WITH DOT;Sm;0;ON;;;;;Y;;;;;
+2ABF;SUBSET WITH PLUS SIGN BELOW;Sm;0;ON;;;;;Y;;;;;
+2AC0;SUPERSET WITH PLUS SIGN BELOW;Sm;0;ON;;;;;Y;;;;;
+2AC1;SUBSET WITH MULTIPLICATION SIGN BELOW;Sm;0;ON;;;;;Y;;;;;
+2AC2;SUPERSET WITH MULTIPLICATION SIGN BELOW;Sm;0;ON;;;;;Y;;;;;
+2AC3;SUBSET OF OR EQUAL TO WITH DOT ABOVE;Sm;0;ON;;;;;Y;;;;;
+2AC4;SUPERSET OF OR EQUAL TO WITH DOT ABOVE;Sm;0;ON;;;;;Y;;;;;
+2AC5;SUBSET OF ABOVE EQUALS SIGN;Sm;0;ON;;;;;Y;;;;;
+2AC6;SUPERSET OF ABOVE EQUALS SIGN;Sm;0;ON;;;;;Y;;;;;
+2AC7;SUBSET OF ABOVE TILDE OPERATOR;Sm;0;ON;;;;;Y;;;;;
+2AC8;SUPERSET OF ABOVE TILDE OPERATOR;Sm;0;ON;;;;;Y;;;;;
+2AC9;SUBSET OF ABOVE ALMOST EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2ACA;SUPERSET OF ABOVE ALMOST EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2ACB;SUBSET OF ABOVE NOT EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2ACC;SUPERSET OF ABOVE NOT EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2ACD;SQUARE LEFT OPEN BOX OPERATOR;Sm;0;ON;;;;;Y;;;;;
+2ACE;SQUARE RIGHT OPEN BOX OPERATOR;Sm;0;ON;;;;;Y;;;;;
+2ACF;CLOSED SUBSET;Sm;0;ON;;;;;Y;;;;;
+2AD0;CLOSED SUPERSET;Sm;0;ON;;;;;Y;;;;;
+2AD1;CLOSED SUBSET OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2AD2;CLOSED SUPERSET OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2AD3;SUBSET ABOVE SUPERSET;Sm;0;ON;;;;;Y;;;;;
+2AD4;SUPERSET ABOVE SUBSET;Sm;0;ON;;;;;Y;;;;;
+2AD5;SUBSET ABOVE SUBSET;Sm;0;ON;;;;;Y;;;;;
+2AD6;SUPERSET ABOVE SUPERSET;Sm;0;ON;;;;;Y;;;;;
+2AD7;SUPERSET BESIDE SUBSET;Sm;0;ON;;;;;N;;;;;
+2AD8;SUPERSET BESIDE AND JOINED BY DASH WITH SUBSET;Sm;0;ON;;;;;N;;;;;
+2AD9;ELEMENT OF OPENING DOWNWARDS;Sm;0;ON;;;;;N;;;;;
+2ADA;PITCHFORK WITH TEE TOP;Sm;0;ON;;;;;N;;;;;
+2ADB;TRANSVERSAL INTERSECTION;Sm;0;ON;;;;;N;;;;;
+2ADC;FORKING;Sm;0;ON;2ADD 0338;;;;Y;;;;;
+2ADD;NONFORKING;Sm;0;ON;;;;;N;;;;;
+2ADE;SHORT LEFT TACK;Sm;0;ON;;;;;Y;;;;;
+2ADF;SHORT DOWN TACK;Sm;0;ON;;;;;N;;;;;
+2AE0;SHORT UP TACK;Sm;0;ON;;;;;N;;;;;
+2AE1;PERPENDICULAR WITH S;Sm;0;ON;;;;;N;;;;;
+2AE2;VERTICAL BAR TRIPLE RIGHT TURNSTILE;Sm;0;ON;;;;;Y;;;;;
+2AE3;DOUBLE VERTICAL BAR LEFT TURNSTILE;Sm;0;ON;;;;;Y;;;;;
+2AE4;VERTICAL BAR DOUBLE LEFT TURNSTILE;Sm;0;ON;;;;;Y;;;;;
+2AE5;DOUBLE VERTICAL BAR DOUBLE LEFT TURNSTILE;Sm;0;ON;;;;;Y;;;;;
+2AE6;LONG DASH FROM LEFT MEMBER OF DOUBLE VERTICAL;Sm;0;ON;;;;;Y;;;;;
+2AE7;SHORT DOWN TACK WITH OVERBAR;Sm;0;ON;;;;;N;;;;;
+2AE8;SHORT UP TACK WITH UNDERBAR;Sm;0;ON;;;;;N;;;;;
+2AE9;SHORT UP TACK ABOVE SHORT DOWN TACK;Sm;0;ON;;;;;N;;;;;
+2AEA;DOUBLE DOWN TACK;Sm;0;ON;;;;;N;;;;;
+2AEB;DOUBLE UP TACK;Sm;0;ON;;;;;N;;;;;
+2AEC;DOUBLE STROKE NOT SIGN;Sm;0;ON;;;;;Y;;;;;
+2AED;REVERSED DOUBLE STROKE NOT SIGN;Sm;0;ON;;;;;Y;;;;;
+2AEE;DOES NOT DIVIDE WITH REVERSED NEGATION SLASH;Sm;0;ON;;;;;Y;;;;;
+2AEF;VERTICAL LINE WITH CIRCLE ABOVE;Sm;0;ON;;;;;N;;;;;
+2AF0;VERTICAL LINE WITH CIRCLE BELOW;Sm;0;ON;;;;;N;;;;;
+2AF1;DOWN TACK WITH CIRCLE BELOW;Sm;0;ON;;;;;N;;;;;
+2AF2;PARALLEL WITH HORIZONTAL STROKE;Sm;0;ON;;;;;N;;;;;
+2AF3;PARALLEL WITH TILDE OPERATOR;Sm;0;ON;;;;;Y;;;;;
+2AF4;TRIPLE VERTICAL BAR BINARY RELATION;Sm;0;ON;;;;;N;;;;;
+2AF5;TRIPLE VERTICAL BAR WITH HORIZONTAL STROKE;Sm;0;ON;;;;;N;;;;;
+2AF6;TRIPLE COLON OPERATOR;Sm;0;ON;;;;;N;;;;;
+2AF7;TRIPLE NESTED LESS-THAN;Sm;0;ON;;;;;Y;;;;;
+2AF8;TRIPLE NESTED GREATER-THAN;Sm;0;ON;;;;;Y;;;;;
+2AF9;DOUBLE-LINE SLANTED LESS-THAN OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2AFA;DOUBLE-LINE SLANTED GREATER-THAN OR EQUAL TO;Sm;0;ON;;;;;Y;;;;;
+2AFB;TRIPLE SOLIDUS BINARY RELATION;Sm;0;ON;;;;;Y;;;;;
+2AFC;LARGE TRIPLE VERTICAL BAR OPERATOR;Sm;0;ON;;;;;N;;;;;
+2AFD;DOUBLE SOLIDUS OPERATOR;Sm;0;ON;;;;;Y;;;;;
+2AFE;WHITE VERTICAL BAR;Sm;0;ON;;;;;N;;;;;
+2AFF;N-ARY WHITE VERTICAL BAR;Sm;0;ON;;;;;N;;;;;
+2B00;NORTH EAST WHITE ARROW;So;0;ON;;;;;N;;;;;
+2B01;NORTH WEST WHITE ARROW;So;0;ON;;;;;N;;;;;
+2B02;SOUTH EAST WHITE ARROW;So;0;ON;;;;;N;;;;;
+2B03;SOUTH WEST WHITE ARROW;So;0;ON;;;;;N;;;;;
+2B04;LEFT RIGHT WHITE ARROW;So;0;ON;;;;;N;;;;;
+2B05;LEFTWARDS BLACK ARROW;So;0;ON;;;;;N;;;;;
+2B06;UPWARDS BLACK ARROW;So;0;ON;;;;;N;;;;;
+2B07;DOWNWARDS BLACK ARROW;So;0;ON;;;;;N;;;;;
+2B08;NORTH EAST BLACK ARROW;So;0;ON;;;;;N;;;;;
+2B09;NORTH WEST BLACK ARROW;So;0;ON;;;;;N;;;;;
+2B0A;SOUTH EAST BLACK ARROW;So;0;ON;;;;;N;;;;;
+2B0B;SOUTH WEST BLACK ARROW;So;0;ON;;;;;N;;;;;
+2B0C;LEFT RIGHT BLACK ARROW;So;0;ON;;;;;N;;;;;
+2B0D;UP DOWN BLACK ARROW;So;0;ON;;;;;N;;;;;
+2B0E;RIGHTWARDS ARROW WITH TIP DOWNWARDS;So;0;ON;;;;;N;;;;;
+2B0F;RIGHTWARDS ARROW WITH TIP UPWARDS;So;0;ON;;;;;N;;;;;
+2B10;LEFTWARDS ARROW WITH TIP DOWNWARDS;So;0;ON;;;;;N;;;;;
+2B11;LEFTWARDS ARROW WITH TIP UPWARDS;So;0;ON;;;;;N;;;;;
+2B12;SQUARE WITH TOP HALF BLACK;So;0;ON;;;;;N;;;;;
+2B13;SQUARE WITH BOTTOM HALF BLACK;So;0;ON;;;;;N;;;;;
+2B14;SQUARE WITH UPPER RIGHT DIAGONAL HALF BLACK;So;0;ON;;;;;N;;;;;
+2B15;SQUARE WITH LOWER LEFT DIAGONAL HALF BLACK;So;0;ON;;;;;N;;;;;
+2B16;DIAMOND WITH LEFT HALF BLACK;So;0;ON;;;;;N;;;;;
+2B17;DIAMOND WITH RIGHT HALF BLACK;So;0;ON;;;;;N;;;;;
+2B18;DIAMOND WITH TOP HALF BLACK;So;0;ON;;;;;N;;;;;
+2B19;DIAMOND WITH BOTTOM HALF BLACK;So;0;ON;;;;;N;;;;;
+2B1A;DOTTED SQUARE;So;0;ON;;;;;N;;;;;
+2B1B;BLACK LARGE SQUARE;So;0;ON;;;;;N;;;;;
+2B1C;WHITE LARGE SQUARE;So;0;ON;;;;;N;;;;;
+2B1D;BLACK VERY SMALL SQUARE;So;0;ON;;;;;N;;;;;
+2B1E;WHITE VERY SMALL SQUARE;So;0;ON;;;;;N;;;;;
+2B1F;BLACK PENTAGON;So;0;ON;;;;;N;;;;;
+2B20;WHITE PENTAGON;So;0;ON;;;;;N;;;;;
+2B21;WHITE HEXAGON;So;0;ON;;;;;N;;;;;
+2B22;BLACK HEXAGON;So;0;ON;;;;;N;;;;;
+2B23;HORIZONTAL BLACK HEXAGON;So;0;ON;;;;;N;;;;;
+2B24;BLACK LARGE CIRCLE;So;0;ON;;;;;N;;;;;
+2B25;BLACK MEDIUM DIAMOND;So;0;ON;;;;;N;;;;;
+2B26;WHITE MEDIUM DIAMOND;So;0;ON;;;;;N;;;;;
+2B27;BLACK MEDIUM LOZENGE;So;0;ON;;;;;N;;;;;
+2B28;WHITE MEDIUM LOZENGE;So;0;ON;;;;;N;;;;;
+2B29;BLACK SMALL DIAMOND;So;0;ON;;;;;N;;;;;
+2B2A;BLACK SMALL LOZENGE;So;0;ON;;;;;N;;;;;
+2B2B;WHITE SMALL LOZENGE;So;0;ON;;;;;N;;;;;
+2B2C;BLACK HORIZONTAL ELLIPSE;So;0;ON;;;;;N;;;;;
+2B2D;WHITE HORIZONTAL ELLIPSE;So;0;ON;;;;;N;;;;;
+2B2E;BLACK VERTICAL ELLIPSE;So;0;ON;;;;;N;;;;;
+2B2F;WHITE VERTICAL ELLIPSE;So;0;ON;;;;;N;;;;;
+2B30;LEFT ARROW WITH SMALL CIRCLE;Sm;0;ON;;;;;N;;;;;
+2B31;THREE LEFTWARDS ARROWS;Sm;0;ON;;;;;N;;;;;
+2B32;LEFT ARROW WITH CIRCLED PLUS;Sm;0;ON;;;;;N;;;;;
+2B33;LONG LEFTWARDS SQUIGGLE ARROW;Sm;0;ON;;;;;N;;;;;
+2B34;LEFTWARDS TWO-HEADED ARROW WITH VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2B35;LEFTWARDS TWO-HEADED ARROW WITH DOUBLE VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2B36;LEFTWARDS TWO-HEADED ARROW FROM BAR;Sm;0;ON;;;;;N;;;;;
+2B37;LEFTWARDS TWO-HEADED TRIPLE DASH ARROW;Sm;0;ON;;;;;N;;;;;
+2B38;LEFTWARDS ARROW WITH DOTTED STEM;Sm;0;ON;;;;;N;;;;;
+2B39;LEFTWARDS ARROW WITH TAIL WITH VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2B3A;LEFTWARDS ARROW WITH TAIL WITH DOUBLE VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2B3B;LEFTWARDS TWO-HEADED ARROW WITH TAIL;Sm;0;ON;;;;;N;;;;;
+2B3C;LEFTWARDS TWO-HEADED ARROW WITH TAIL WITH VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2B3D;LEFTWARDS TWO-HEADED ARROW WITH TAIL WITH DOUBLE VERTICAL STROKE;Sm;0;ON;;;;;N;;;;;
+2B3E;LEFTWARDS ARROW THROUGH X;Sm;0;ON;;;;;N;;;;;
+2B3F;WAVE ARROW POINTING DIRECTLY LEFT;Sm;0;ON;;;;;N;;;;;
+2B40;EQUALS SIGN ABOVE LEFTWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+2B41;REVERSE TILDE OPERATOR ABOVE LEFTWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+2B42;LEFTWARDS ARROW ABOVE REVERSE ALMOST EQUAL TO;Sm;0;ON;;;;;N;;;;;
+2B43;RIGHTWARDS ARROW THROUGH GREATER-THAN;Sm;0;ON;;;;;N;;;;;
+2B44;RIGHTWARDS ARROW THROUGH SUPERSET;Sm;0;ON;;;;;N;;;;;
+2B45;LEFTWARDS QUADRUPLE ARROW;So;0;ON;;;;;N;;;;;
+2B46;RIGHTWARDS QUADRUPLE ARROW;So;0;ON;;;;;N;;;;;
+2B47;REVERSE TILDE OPERATOR ABOVE RIGHTWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+2B48;RIGHTWARDS ARROW ABOVE REVERSE ALMOST EQUAL TO;Sm;0;ON;;;;;N;;;;;
+2B49;TILDE OPERATOR ABOVE LEFTWARDS ARROW;Sm;0;ON;;;;;N;;;;;
+2B4A;LEFTWARDS ARROW ABOVE ALMOST EQUAL TO;Sm;0;ON;;;;;N;;;;;
+2B4B;LEFTWARDS ARROW ABOVE REVERSE TILDE OPERATOR;Sm;0;ON;;;;;N;;;;;
+2B4C;RIGHTWARDS ARROW ABOVE REVERSE TILDE OPERATOR;Sm;0;ON;;;;;N;;;;;
+2B4D;DOWNWARDS TRIANGLE-HEADED ZIGZAG ARROW;So;0;ON;;;;;N;;;;;
+2B4E;SHORT SLANTED NORTH ARROW;So;0;ON;;;;;N;;;;;
+2B4F;SHORT BACKSLANTED SOUTH ARROW;So;0;ON;;;;;N;;;;;
+2B50;WHITE MEDIUM STAR;So;0;ON;;;;;N;;;;;
+2B51;BLACK SMALL STAR;So;0;ON;;;;;N;;;;;
+2B52;WHITE SMALL STAR;So;0;ON;;;;;N;;;;;
+2B53;BLACK RIGHT-POINTING PENTAGON;So;0;ON;;;;;N;;;;;
+2B54;WHITE RIGHT-POINTING PENTAGON;So;0;ON;;;;;N;;;;;
+2B55;HEAVY LARGE CIRCLE;So;0;ON;;;;;N;;;;;
+2B56;HEAVY OVAL WITH OVAL INSIDE;So;0;ON;;;;;N;;;;;
+2B57;HEAVY CIRCLE WITH CIRCLE INSIDE;So;0;ON;;;;;N;;;;;
+2B58;HEAVY CIRCLE;So;0;ON;;;;;N;;;;;
+2B59;HEAVY CIRCLED SALTIRE;So;0;ON;;;;;N;;;;;
+2B5A;SLANTED NORTH ARROW WITH HOOKED HEAD;So;0;ON;;;;;N;;;;;
+2B5B;BACKSLANTED SOUTH ARROW WITH HOOKED TAIL;So;0;ON;;;;;N;;;;;
+2B5C;SLANTED NORTH ARROW WITH HORIZONTAL TAIL;So;0;ON;;;;;N;;;;;
+2B5D;BACKSLANTED SOUTH ARROW WITH HORIZONTAL TAIL;So;0;ON;;;;;N;;;;;
+2B5E;BENT ARROW POINTING DOWNWARDS THEN NORTH EAST;So;0;ON;;;;;N;;;;;
+2B5F;SHORT BENT ARROW POINTING DOWNWARDS THEN NORTH EAST;So;0;ON;;;;;N;;;;;
+2B60;LEFTWARDS TRIANGLE-HEADED ARROW;So;0;ON;;;;;N;;;;;
+2B61;UPWARDS TRIANGLE-HEADED ARROW;So;0;ON;;;;;N;;;;;
+2B62;RIGHTWARDS TRIANGLE-HEADED ARROW;So;0;ON;;;;;N;;;;;
+2B63;DOWNWARDS TRIANGLE-HEADED ARROW;So;0;ON;;;;;N;;;;;
+2B64;LEFT RIGHT TRIANGLE-HEADED ARROW;So;0;ON;;;;;N;;;;;
+2B65;UP DOWN TRIANGLE-HEADED ARROW;So;0;ON;;;;;N;;;;;
+2B66;NORTH WEST TRIANGLE-HEADED ARROW;So;0;ON;;;;;N;;;;;
+2B67;NORTH EAST TRIANGLE-HEADED ARROW;So;0;ON;;;;;N;;;;;
+2B68;SOUTH EAST TRIANGLE-HEADED ARROW;So;0;ON;;;;;N;;;;;
+2B69;SOUTH WEST TRIANGLE-HEADED ARROW;So;0;ON;;;;;N;;;;;
+2B6A;LEFTWARDS TRIANGLE-HEADED DASHED ARROW;So;0;ON;;;;;N;;;;;
+2B6B;UPWARDS TRIANGLE-HEADED DASHED ARROW;So;0;ON;;;;;N;;;;;
+2B6C;RIGHTWARDS TRIANGLE-HEADED DASHED ARROW;So;0;ON;;;;;N;;;;;
+2B6D;DOWNWARDS TRIANGLE-HEADED DASHED ARROW;So;0;ON;;;;;N;;;;;
+2B6E;CLOCKWISE TRIANGLE-HEADED OPEN CIRCLE ARROW;So;0;ON;;;;;N;;;;;
+2B6F;ANTICLOCKWISE TRIANGLE-HEADED OPEN CIRCLE ARROW;So;0;ON;;;;;N;;;;;
+2B70;LEFTWARDS TRIANGLE-HEADED ARROW TO BAR;So;0;ON;;;;;N;;;;;
+2B71;UPWARDS TRIANGLE-HEADED ARROW TO BAR;So;0;ON;;;;;N;;;;;
+2B72;RIGHTWARDS TRIANGLE-HEADED ARROW TO BAR;So;0;ON;;;;;N;;;;;
+2B73;DOWNWARDS TRIANGLE-HEADED ARROW TO BAR;So;0;ON;;;;;N;;;;;
+2B76;NORTH WEST TRIANGLE-HEADED ARROW TO BAR;So;0;ON;;;;;N;;;;;
+2B77;NORTH EAST TRIANGLE-HEADED ARROW TO BAR;So;0;ON;;;;;N;;;;;
+2B78;SOUTH EAST TRIANGLE-HEADED ARROW TO BAR;So;0;ON;;;;;N;;;;;
+2B79;SOUTH WEST TRIANGLE-HEADED ARROW TO BAR;So;0;ON;;;;;N;;;;;
+2B7A;LEFTWARDS TRIANGLE-HEADED ARROW WITH DOUBLE HORIZONTAL STROKE;So;0;ON;;;;;N;;;;;
+2B7B;UPWARDS TRIANGLE-HEADED ARROW WITH DOUBLE HORIZONTAL STROKE;So;0;ON;;;;;N;;;;;
+2B7C;RIGHTWARDS TRIANGLE-HEADED ARROW WITH DOUBLE HORIZONTAL STROKE;So;0;ON;;;;;N;;;;;
+2B7D;DOWNWARDS TRIANGLE-HEADED ARROW WITH DOUBLE HORIZONTAL STROKE;So;0;ON;;;;;N;;;;;
+2B7E;HORIZONTAL TAB KEY;So;0;ON;;;;;N;;;;;
+2B7F;VERTICAL TAB KEY;So;0;ON;;;;;N;;;;;
+2B80;LEFTWARDS TRIANGLE-HEADED ARROW OVER RIGHTWARDS TRIANGLE-HEADED ARROW;So;0;ON;;;;;N;;;;;
+2B81;UPWARDS TRIANGLE-HEADED ARROW LEFTWARDS OF DOWNWARDS TRIANGLE-HEADED ARROW;So;0;ON;;;;;N;;;;;
+2B82;RIGHTWARDS TRIANGLE-HEADED ARROW OVER LEFTWARDS TRIANGLE-HEADED ARROW;So;0;ON;;;;;N;;;;;
+2B83;DOWNWARDS TRIANGLE-HEADED ARROW LEFTWARDS OF UPWARDS TRIANGLE-HEADED ARROW;So;0;ON;;;;;N;;;;;
+2B84;LEFTWARDS TRIANGLE-HEADED PAIRED ARROWS;So;0;ON;;;;;N;;;;;
+2B85;UPWARDS TRIANGLE-HEADED PAIRED ARROWS;So;0;ON;;;;;N;;;;;
+2B86;RIGHTWARDS TRIANGLE-HEADED PAIRED ARROWS;So;0;ON;;;;;N;;;;;
+2B87;DOWNWARDS TRIANGLE-HEADED PAIRED ARROWS;So;0;ON;;;;;N;;;;;
+2B88;LEFTWARDS BLACK CIRCLED WHITE ARROW;So;0;ON;;;;;N;;;;;
+2B89;UPWARDS BLACK CIRCLED WHITE ARROW;So;0;ON;;;;;N;;;;;
+2B8A;RIGHTWARDS BLACK CIRCLED WHITE ARROW;So;0;ON;;;;;N;;;;;
+2B8B;DOWNWARDS BLACK CIRCLED WHITE ARROW;So;0;ON;;;;;N;;;;;
+2B8C;ANTICLOCKWISE TRIANGLE-HEADED RIGHT U-SHAPED ARROW;So;0;ON;;;;;N;;;;;
+2B8D;ANTICLOCKWISE TRIANGLE-HEADED BOTTOM U-SHAPED ARROW;So;0;ON;;;;;N;;;;;
+2B8E;ANTICLOCKWISE TRIANGLE-HEADED LEFT U-SHAPED ARROW;So;0;ON;;;;;N;;;;;
+2B8F;ANTICLOCKWISE TRIANGLE-HEADED TOP U-SHAPED ARROW;So;0;ON;;;;;N;;;;;
+2B90;RETURN LEFT;So;0;ON;;;;;N;;;;;
+2B91;RETURN RIGHT;So;0;ON;;;;;N;;;;;
+2B92;NEWLINE LEFT;So;0;ON;;;;;N;;;;;
+2B93;NEWLINE RIGHT;So;0;ON;;;;;N;;;;;
+2B94;FOUR CORNER ARROWS CIRCLING ANTICLOCKWISE;So;0;ON;;;;;N;;;;;
+2B95;RIGHTWARDS BLACK ARROW;So;0;ON;;;;;N;;;;;
+2B98;THREE-D TOP-LIGHTED LEFTWARDS EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+2B99;THREE-D RIGHT-LIGHTED UPWARDS EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+2B9A;THREE-D TOP-LIGHTED RIGHTWARDS EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+2B9B;THREE-D LEFT-LIGHTED DOWNWARDS EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+2B9C;BLACK LEFTWARDS EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+2B9D;BLACK UPWARDS EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+2B9E;BLACK RIGHTWARDS EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+2B9F;BLACK DOWNWARDS EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+2BA0;DOWNWARDS TRIANGLE-HEADED ARROW WITH LONG TIP LEFTWARDS;So;0;ON;;;;;N;;;;;
+2BA1;DOWNWARDS TRIANGLE-HEADED ARROW WITH LONG TIP RIGHTWARDS;So;0;ON;;;;;N;;;;;
+2BA2;UPWARDS TRIANGLE-HEADED ARROW WITH LONG TIP LEFTWARDS;So;0;ON;;;;;N;;;;;
+2BA3;UPWARDS TRIANGLE-HEADED ARROW WITH LONG TIP RIGHTWARDS;So;0;ON;;;;;N;;;;;
+2BA4;LEFTWARDS TRIANGLE-HEADED ARROW WITH LONG TIP UPWARDS;So;0;ON;;;;;N;;;;;
+2BA5;RIGHTWARDS TRIANGLE-HEADED ARROW WITH LONG TIP UPWARDS;So;0;ON;;;;;N;;;;;
+2BA6;LEFTWARDS TRIANGLE-HEADED ARROW WITH LONG TIP DOWNWARDS;So;0;ON;;;;;N;;;;;
+2BA7;RIGHTWARDS TRIANGLE-HEADED ARROW WITH LONG TIP DOWNWARDS;So;0;ON;;;;;N;;;;;
+2BA8;BLACK CURVED DOWNWARDS AND LEFTWARDS ARROW;So;0;ON;;;;;N;;;;;
+2BA9;BLACK CURVED DOWNWARDS AND RIGHTWARDS ARROW;So;0;ON;;;;;N;;;;;
+2BAA;BLACK CURVED UPWARDS AND LEFTWARDS ARROW;So;0;ON;;;;;N;;;;;
+2BAB;BLACK CURVED UPWARDS AND RIGHTWARDS ARROW;So;0;ON;;;;;N;;;;;
+2BAC;BLACK CURVED LEFTWARDS AND UPWARDS ARROW;So;0;ON;;;;;N;;;;;
+2BAD;BLACK CURVED RIGHTWARDS AND UPWARDS ARROW;So;0;ON;;;;;N;;;;;
+2BAE;BLACK CURVED LEFTWARDS AND DOWNWARDS ARROW;So;0;ON;;;;;N;;;;;
+2BAF;BLACK CURVED RIGHTWARDS AND DOWNWARDS ARROW;So;0;ON;;;;;N;;;;;
+2BB0;RIBBON ARROW DOWN LEFT;So;0;ON;;;;;N;;;;;
+2BB1;RIBBON ARROW DOWN RIGHT;So;0;ON;;;;;N;;;;;
+2BB2;RIBBON ARROW UP LEFT;So;0;ON;;;;;N;;;;;
+2BB3;RIBBON ARROW UP RIGHT;So;0;ON;;;;;N;;;;;
+2BB4;RIBBON ARROW LEFT UP;So;0;ON;;;;;N;;;;;
+2BB5;RIBBON ARROW RIGHT UP;So;0;ON;;;;;N;;;;;
+2BB6;RIBBON ARROW LEFT DOWN;So;0;ON;;;;;N;;;;;
+2BB7;RIBBON ARROW RIGHT DOWN;So;0;ON;;;;;N;;;;;
+2BB8;UPWARDS WHITE ARROW FROM BAR WITH HORIZONTAL BAR;So;0;ON;;;;;N;;;;;
+2BB9;UP ARROWHEAD IN A RECTANGLE BOX;So;0;ON;;;;;N;;;;;
+2BBD;BALLOT BOX WITH LIGHT X;So;0;ON;;;;;N;;;;;
+2BBE;CIRCLED X;So;0;ON;;;;;N;;;;;
+2BBF;CIRCLED BOLD X;So;0;ON;;;;;N;;;;;
+2BC0;BLACK SQUARE CENTRED;So;0;ON;;;;;N;;;;;
+2BC1;BLACK DIAMOND CENTRED;So;0;ON;;;;;N;;;;;
+2BC2;TURNED BLACK PENTAGON;So;0;ON;;;;;N;;;;;
+2BC3;HORIZONTAL BLACK OCTAGON;So;0;ON;;;;;N;;;;;
+2BC4;BLACK OCTAGON;So;0;ON;;;;;N;;;;;
+2BC5;BLACK MEDIUM UP-POINTING TRIANGLE CENTRED;So;0;ON;;;;;N;;;;;
+2BC6;BLACK MEDIUM DOWN-POINTING TRIANGLE CENTRED;So;0;ON;;;;;N;;;;;
+2BC7;BLACK MEDIUM LEFT-POINTING TRIANGLE CENTRED;So;0;ON;;;;;N;;;;;
+2BC8;BLACK MEDIUM RIGHT-POINTING TRIANGLE CENTRED;So;0;ON;;;;;N;;;;;
+2BCA;TOP HALF BLACK CIRCLE;So;0;ON;;;;;N;;;;;
+2BCB;BOTTOM HALF BLACK CIRCLE;So;0;ON;;;;;N;;;;;
+2BCC;LIGHT FOUR POINTED BLACK CUSP;So;0;ON;;;;;N;;;;;
+2BCD;ROTATED LIGHT FOUR POINTED BLACK CUSP;So;0;ON;;;;;N;;;;;
+2BCE;WHITE FOUR POINTED CUSP;So;0;ON;;;;;N;;;;;
+2BCF;ROTATED WHITE FOUR POINTED CUSP;So;0;ON;;;;;N;;;;;
+2BD0;SQUARE POSITION INDICATOR;So;0;ON;;;;;N;;;;;
+2BD1;UNCERTAINTY SIGN;So;0;ON;;;;;N;;;;;
+2BD2;GROUP MARK;So;0;ON;;;;;N;;;;;
+2BEC;LEFTWARDS TWO-HEADED ARROW WITH TRIANGLE ARROWHEADS;So;0;ON;;;;;N;;;;;
+2BED;UPWARDS TWO-HEADED ARROW WITH TRIANGLE ARROWHEADS;So;0;ON;;;;;N;;;;;
+2BEE;RIGHTWARDS TWO-HEADED ARROW WITH TRIANGLE ARROWHEADS;So;0;ON;;;;;N;;;;;
+2BEF;DOWNWARDS TWO-HEADED ARROW WITH TRIANGLE ARROWHEADS;So;0;ON;;;;;N;;;;;
+2C00;GLAGOLITIC CAPITAL LETTER AZU;Lu;0;L;;;;;N;;;;2C30;
+2C01;GLAGOLITIC CAPITAL LETTER BUKY;Lu;0;L;;;;;N;;;;2C31;
+2C02;GLAGOLITIC CAPITAL LETTER VEDE;Lu;0;L;;;;;N;;;;2C32;
+2C03;GLAGOLITIC CAPITAL LETTER GLAGOLI;Lu;0;L;;;;;N;;;;2C33;
+2C04;GLAGOLITIC CAPITAL LETTER DOBRO;Lu;0;L;;;;;N;;;;2C34;
+2C05;GLAGOLITIC CAPITAL LETTER YESTU;Lu;0;L;;;;;N;;;;2C35;
+2C06;GLAGOLITIC CAPITAL LETTER ZHIVETE;Lu;0;L;;;;;N;;;;2C36;
+2C07;GLAGOLITIC CAPITAL LETTER DZELO;Lu;0;L;;;;;N;;;;2C37;
+2C08;GLAGOLITIC CAPITAL LETTER ZEMLJA;Lu;0;L;;;;;N;;;;2C38;
+2C09;GLAGOLITIC CAPITAL LETTER IZHE;Lu;0;L;;;;;N;;;;2C39;
+2C0A;GLAGOLITIC CAPITAL LETTER INITIAL IZHE;Lu;0;L;;;;;N;;;;2C3A;
+2C0B;GLAGOLITIC CAPITAL LETTER I;Lu;0;L;;;;;N;;;;2C3B;
+2C0C;GLAGOLITIC CAPITAL LETTER DJERVI;Lu;0;L;;;;;N;;;;2C3C;
+2C0D;GLAGOLITIC CAPITAL LETTER KAKO;Lu;0;L;;;;;N;;;;2C3D;
+2C0E;GLAGOLITIC CAPITAL LETTER LJUDIJE;Lu;0;L;;;;;N;;;;2C3E;
+2C0F;GLAGOLITIC CAPITAL LETTER MYSLITE;Lu;0;L;;;;;N;;;;2C3F;
+2C10;GLAGOLITIC CAPITAL LETTER NASHI;Lu;0;L;;;;;N;;;;2C40;
+2C11;GLAGOLITIC CAPITAL LETTER ONU;Lu;0;L;;;;;N;;;;2C41;
+2C12;GLAGOLITIC CAPITAL LETTER POKOJI;Lu;0;L;;;;;N;;;;2C42;
+2C13;GLAGOLITIC CAPITAL LETTER RITSI;Lu;0;L;;;;;N;;;;2C43;
+2C14;GLAGOLITIC CAPITAL LETTER SLOVO;Lu;0;L;;;;;N;;;;2C44;
+2C15;GLAGOLITIC CAPITAL LETTER TVRIDO;Lu;0;L;;;;;N;;;;2C45;
+2C16;GLAGOLITIC CAPITAL LETTER UKU;Lu;0;L;;;;;N;;;;2C46;
+2C17;GLAGOLITIC CAPITAL LETTER FRITU;Lu;0;L;;;;;N;;;;2C47;
+2C18;GLAGOLITIC CAPITAL LETTER HERU;Lu;0;L;;;;;N;;;;2C48;
+2C19;GLAGOLITIC CAPITAL LETTER OTU;Lu;0;L;;;;;N;;;;2C49;
+2C1A;GLAGOLITIC CAPITAL LETTER PE;Lu;0;L;;;;;N;;;;2C4A;
+2C1B;GLAGOLITIC CAPITAL LETTER SHTA;Lu;0;L;;;;;N;;;;2C4B;
+2C1C;GLAGOLITIC CAPITAL LETTER TSI;Lu;0;L;;;;;N;;;;2C4C;
+2C1D;GLAGOLITIC CAPITAL LETTER CHRIVI;Lu;0;L;;;;;N;;;;2C4D;
+2C1E;GLAGOLITIC CAPITAL LETTER SHA;Lu;0;L;;;;;N;;;;2C4E;
+2C1F;GLAGOLITIC CAPITAL LETTER YERU;Lu;0;L;;;;;N;;;;2C4F;
+2C20;GLAGOLITIC CAPITAL LETTER YERI;Lu;0;L;;;;;N;;;;2C50;
+2C21;GLAGOLITIC CAPITAL LETTER YATI;Lu;0;L;;;;;N;;;;2C51;
+2C22;GLAGOLITIC CAPITAL LETTER SPIDERY HA;Lu;0;L;;;;;N;;;;2C52;
+2C23;GLAGOLITIC CAPITAL LETTER YU;Lu;0;L;;;;;N;;;;2C53;
+2C24;GLAGOLITIC CAPITAL LETTER SMALL YUS;Lu;0;L;;;;;N;;;;2C54;
+2C25;GLAGOLITIC CAPITAL LETTER SMALL YUS WITH TAIL;Lu;0;L;;;;;N;;;;2C55;
+2C26;GLAGOLITIC CAPITAL LETTER YO;Lu;0;L;;;;;N;;;;2C56;
+2C27;GLAGOLITIC CAPITAL LETTER IOTATED SMALL YUS;Lu;0;L;;;;;N;;;;2C57;
+2C28;GLAGOLITIC CAPITAL LETTER BIG YUS;Lu;0;L;;;;;N;;;;2C58;
+2C29;GLAGOLITIC CAPITAL LETTER IOTATED BIG YUS;Lu;0;L;;;;;N;;;;2C59;
+2C2A;GLAGOLITIC CAPITAL LETTER FITA;Lu;0;L;;;;;N;;;;2C5A;
+2C2B;GLAGOLITIC CAPITAL LETTER IZHITSA;Lu;0;L;;;;;N;;;;2C5B;
+2C2C;GLAGOLITIC CAPITAL LETTER SHTAPIC;Lu;0;L;;;;;N;;;;2C5C;
+2C2D;GLAGOLITIC CAPITAL LETTER TROKUTASTI A;Lu;0;L;;;;;N;;;;2C5D;
+2C2E;GLAGOLITIC CAPITAL LETTER LATINATE MYSLITE;Lu;0;L;;;;;N;;;;2C5E;
+2C30;GLAGOLITIC SMALL LETTER AZU;Ll;0;L;;;;;N;;;2C00;;2C00
+2C31;GLAGOLITIC SMALL LETTER BUKY;Ll;0;L;;;;;N;;;2C01;;2C01
+2C32;GLAGOLITIC SMALL LETTER VEDE;Ll;0;L;;;;;N;;;2C02;;2C02
+2C33;GLAGOLITIC SMALL LETTER GLAGOLI;Ll;0;L;;;;;N;;;2C03;;2C03
+2C34;GLAGOLITIC SMALL LETTER DOBRO;Ll;0;L;;;;;N;;;2C04;;2C04
+2C35;GLAGOLITIC SMALL LETTER YESTU;Ll;0;L;;;;;N;;;2C05;;2C05
+2C36;GLAGOLITIC SMALL LETTER ZHIVETE;Ll;0;L;;;;;N;;;2C06;;2C06
+2C37;GLAGOLITIC SMALL LETTER DZELO;Ll;0;L;;;;;N;;;2C07;;2C07
+2C38;GLAGOLITIC SMALL LETTER ZEMLJA;Ll;0;L;;;;;N;;;2C08;;2C08
+2C39;GLAGOLITIC SMALL LETTER IZHE;Ll;0;L;;;;;N;;;2C09;;2C09
+2C3A;GLAGOLITIC SMALL LETTER INITIAL IZHE;Ll;0;L;;;;;N;;;2C0A;;2C0A
+2C3B;GLAGOLITIC SMALL LETTER I;Ll;0;L;;;;;N;;;2C0B;;2C0B
+2C3C;GLAGOLITIC SMALL LETTER DJERVI;Ll;0;L;;;;;N;;;2C0C;;2C0C
+2C3D;GLAGOLITIC SMALL LETTER KAKO;Ll;0;L;;;;;N;;;2C0D;;2C0D
+2C3E;GLAGOLITIC SMALL LETTER LJUDIJE;Ll;0;L;;;;;N;;;2C0E;;2C0E
+2C3F;GLAGOLITIC SMALL LETTER MYSLITE;Ll;0;L;;;;;N;;;2C0F;;2C0F
+2C40;GLAGOLITIC SMALL LETTER NASHI;Ll;0;L;;;;;N;;;2C10;;2C10
+2C41;GLAGOLITIC SMALL LETTER ONU;Ll;0;L;;;;;N;;;2C11;;2C11
+2C42;GLAGOLITIC SMALL LETTER POKOJI;Ll;0;L;;;;;N;;;2C12;;2C12
+2C43;GLAGOLITIC SMALL LETTER RITSI;Ll;0;L;;;;;N;;;2C13;;2C13
+2C44;GLAGOLITIC SMALL LETTER SLOVO;Ll;0;L;;;;;N;;;2C14;;2C14
+2C45;GLAGOLITIC SMALL LETTER TVRIDO;Ll;0;L;;;;;N;;;2C15;;2C15
+2C46;GLAGOLITIC SMALL LETTER UKU;Ll;0;L;;;;;N;;;2C16;;2C16
+2C47;GLAGOLITIC SMALL LETTER FRITU;Ll;0;L;;;;;N;;;2C17;;2C17
+2C48;GLAGOLITIC SMALL LETTER HERU;Ll;0;L;;;;;N;;;2C18;;2C18
+2C49;GLAGOLITIC SMALL LETTER OTU;Ll;0;L;;;;;N;;;2C19;;2C19
+2C4A;GLAGOLITIC SMALL LETTER PE;Ll;0;L;;;;;N;;;2C1A;;2C1A
+2C4B;GLAGOLITIC SMALL LETTER SHTA;Ll;0;L;;;;;N;;;2C1B;;2C1B
+2C4C;GLAGOLITIC SMALL LETTER TSI;Ll;0;L;;;;;N;;;2C1C;;2C1C
+2C4D;GLAGOLITIC SMALL LETTER CHRIVI;Ll;0;L;;;;;N;;;2C1D;;2C1D
+2C4E;GLAGOLITIC SMALL LETTER SHA;Ll;0;L;;;;;N;;;2C1E;;2C1E
+2C4F;GLAGOLITIC SMALL LETTER YERU;Ll;0;L;;;;;N;;;2C1F;;2C1F
+2C50;GLAGOLITIC SMALL LETTER YERI;Ll;0;L;;;;;N;;;2C20;;2C20
+2C51;GLAGOLITIC SMALL LETTER YATI;Ll;0;L;;;;;N;;;2C21;;2C21
+2C52;GLAGOLITIC SMALL LETTER SPIDERY HA;Ll;0;L;;;;;N;;;2C22;;2C22
+2C53;GLAGOLITIC SMALL LETTER YU;Ll;0;L;;;;;N;;;2C23;;2C23
+2C54;GLAGOLITIC SMALL LETTER SMALL YUS;Ll;0;L;;;;;N;;;2C24;;2C24
+2C55;GLAGOLITIC SMALL LETTER SMALL YUS WITH TAIL;Ll;0;L;;;;;N;;;2C25;;2C25
+2C56;GLAGOLITIC SMALL LETTER YO;Ll;0;L;;;;;N;;;2C26;;2C26
+2C57;GLAGOLITIC SMALL LETTER IOTATED SMALL YUS;Ll;0;L;;;;;N;;;2C27;;2C27
+2C58;GLAGOLITIC SMALL LETTER BIG YUS;Ll;0;L;;;;;N;;;2C28;;2C28
+2C59;GLAGOLITIC SMALL LETTER IOTATED BIG YUS;Ll;0;L;;;;;N;;;2C29;;2C29
+2C5A;GLAGOLITIC SMALL LETTER FITA;Ll;0;L;;;;;N;;;2C2A;;2C2A
+2C5B;GLAGOLITIC SMALL LETTER IZHITSA;Ll;0;L;;;;;N;;;2C2B;;2C2B
+2C5C;GLAGOLITIC SMALL LETTER SHTAPIC;Ll;0;L;;;;;N;;;2C2C;;2C2C
+2C5D;GLAGOLITIC SMALL LETTER TROKUTASTI A;Ll;0;L;;;;;N;;;2C2D;;2C2D
+2C5E;GLAGOLITIC SMALL LETTER LATINATE MYSLITE;Ll;0;L;;;;;N;;;2C2E;;2C2E
+2C60;LATIN CAPITAL LETTER L WITH DOUBLE BAR;Lu;0;L;;;;;N;;;;2C61;
+2C61;LATIN SMALL LETTER L WITH DOUBLE BAR;Ll;0;L;;;;;N;;;2C60;;2C60
+2C62;LATIN CAPITAL LETTER L WITH MIDDLE TILDE;Lu;0;L;;;;;N;;;;026B;
+2C63;LATIN CAPITAL LETTER P WITH STROKE;Lu;0;L;;;;;N;;;;1D7D;
+2C64;LATIN CAPITAL LETTER R WITH TAIL;Lu;0;L;;;;;N;;;;027D;
+2C65;LATIN SMALL LETTER A WITH STROKE;Ll;0;L;;;;;N;;;023A;;023A
+2C66;LATIN SMALL LETTER T WITH DIAGONAL STROKE;Ll;0;L;;;;;N;;;023E;;023E
+2C67;LATIN CAPITAL LETTER H WITH DESCENDER;Lu;0;L;;;;;N;;;;2C68;
+2C68;LATIN SMALL LETTER H WITH DESCENDER;Ll;0;L;;;;;N;;;2C67;;2C67
+2C69;LATIN CAPITAL LETTER K WITH DESCENDER;Lu;0;L;;;;;N;;;;2C6A;
+2C6A;LATIN SMALL LETTER K WITH DESCENDER;Ll;0;L;;;;;N;;;2C69;;2C69
+2C6B;LATIN CAPITAL LETTER Z WITH DESCENDER;Lu;0;L;;;;;N;;;;2C6C;
+2C6C;LATIN SMALL LETTER Z WITH DESCENDER;Ll;0;L;;;;;N;;;2C6B;;2C6B
+2C6D;LATIN CAPITAL LETTER ALPHA;Lu;0;L;;;;;N;;;;0251;
+2C6E;LATIN CAPITAL LETTER M WITH HOOK;Lu;0;L;;;;;N;;;;0271;
+2C6F;LATIN CAPITAL LETTER TURNED A;Lu;0;L;;;;;N;;;;0250;
+2C70;LATIN CAPITAL LETTER TURNED ALPHA;Lu;0;L;;;;;N;;;;0252;
+2C71;LATIN SMALL LETTER V WITH RIGHT HOOK;Ll;0;L;;;;;N;;;;;
+2C72;LATIN CAPITAL LETTER W WITH HOOK;Lu;0;L;;;;;N;;;;2C73;
+2C73;LATIN SMALL LETTER W WITH HOOK;Ll;0;L;;;;;N;;;2C72;;2C72
+2C74;LATIN SMALL LETTER V WITH CURL;Ll;0;L;;;;;N;;;;;
+2C75;LATIN CAPITAL LETTER HALF H;Lu;0;L;;;;;N;;;;2C76;
+2C76;LATIN SMALL LETTER HALF H;Ll;0;L;;;;;N;;;2C75;;2C75
+2C77;LATIN SMALL LETTER TAILLESS PHI;Ll;0;L;;;;;N;;;;;
+2C78;LATIN SMALL LETTER E WITH NOTCH;Ll;0;L;;;;;N;;;;;
+2C79;LATIN SMALL LETTER TURNED R WITH TAIL;Ll;0;L;;;;;N;;;;;
+2C7A;LATIN SMALL LETTER O WITH LOW RING INSIDE;Ll;0;L;;;;;N;;;;;
+2C7B;LATIN LETTER SMALL CAPITAL TURNED E;Ll;0;L;;;;;N;;;;;
+2C7C;LATIN SUBSCRIPT SMALL LETTER J;Lm;0;L; 006A;;;;N;;;;;
+2C7D;MODIFIER LETTER CAPITAL V;Lm;0;L;<super> 0056;;;;N;;;;;
+2C7E;LATIN CAPITAL LETTER S WITH SWASH TAIL;Lu;0;L;;;;;N;;;;023F;
+2C7F;LATIN CAPITAL LETTER Z WITH SWASH TAIL;Lu;0;L;;;;;N;;;;0240;
+2C80;COPTIC CAPITAL LETTER ALFA;Lu;0;L;;;;;N;;;;2C81;
+2C81;COPTIC SMALL LETTER ALFA;Ll;0;L;;;;;N;;;2C80;;2C80
+2C82;COPTIC CAPITAL LETTER VIDA;Lu;0;L;;;;;N;;;;2C83;
+2C83;COPTIC SMALL LETTER VIDA;Ll;0;L;;;;;N;;;2C82;;2C82
+2C84;COPTIC CAPITAL LETTER GAMMA;Lu;0;L;;;;;N;;;;2C85;
+2C85;COPTIC SMALL LETTER GAMMA;Ll;0;L;;;;;N;;;2C84;;2C84
+2C86;COPTIC CAPITAL LETTER DALDA;Lu;0;L;;;;;N;;;;2C87;
+2C87;COPTIC SMALL LETTER DALDA;Ll;0;L;;;;;N;;;2C86;;2C86
+2C88;COPTIC CAPITAL LETTER EIE;Lu;0;L;;;;;N;;;;2C89;
+2C89;COPTIC SMALL LETTER EIE;Ll;0;L;;;;;N;;;2C88;;2C88
+2C8A;COPTIC CAPITAL LETTER SOU;Lu;0;L;;;;;N;;;;2C8B;
+2C8B;COPTIC SMALL LETTER SOU;Ll;0;L;;;;;N;;;2C8A;;2C8A
+2C8C;COPTIC CAPITAL LETTER ZATA;Lu;0;L;;;;;N;;;;2C8D;
+2C8D;COPTIC SMALL LETTER ZATA;Ll;0;L;;;;;N;;;2C8C;;2C8C
+2C8E;COPTIC CAPITAL LETTER HATE;Lu;0;L;;;;;N;;;;2C8F;
+2C8F;COPTIC SMALL LETTER HATE;Ll;0;L;;;;;N;;;2C8E;;2C8E
+2C90;COPTIC CAPITAL LETTER THETHE;Lu;0;L;;;;;N;;;;2C91;
+2C91;COPTIC SMALL LETTER THETHE;Ll;0;L;;;;;N;;;2C90;;2C90
+2C92;COPTIC CAPITAL LETTER IAUDA;Lu;0;L;;;;;N;;;;2C93;
+2C93;COPTIC SMALL LETTER IAUDA;Ll;0;L;;;;;N;;;2C92;;2C92
+2C94;COPTIC CAPITAL LETTER KAPA;Lu;0;L;;;;;N;;;;2C95;
+2C95;COPTIC SMALL LETTER KAPA;Ll;0;L;;;;;N;;;2C94;;2C94
+2C96;COPTIC CAPITAL LETTER LAULA;Lu;0;L;;;;;N;;;;2C97;
+2C97;COPTIC SMALL LETTER LAULA;Ll;0;L;;;;;N;;;2C96;;2C96
+2C98;COPTIC CAPITAL LETTER MI;Lu;0;L;;;;;N;;;;2C99;
+2C99;COPTIC SMALL LETTER MI;Ll;0;L;;;;;N;;;2C98;;2C98
+2C9A;COPTIC CAPITAL LETTER NI;Lu;0;L;;;;;N;;;;2C9B;
+2C9B;COPTIC SMALL LETTER NI;Ll;0;L;;;;;N;;;2C9A;;2C9A
+2C9C;COPTIC CAPITAL LETTER KSI;Lu;0;L;;;;;N;;;;2C9D;
+2C9D;COPTIC SMALL LETTER KSI;Ll;0;L;;;;;N;;;2C9C;;2C9C
+2C9E;COPTIC CAPITAL LETTER O;Lu;0;L;;;;;N;;;;2C9F;
+2C9F;COPTIC SMALL LETTER O;Ll;0;L;;;;;N;;;2C9E;;2C9E
+2CA0;COPTIC CAPITAL LETTER PI;Lu;0;L;;;;;N;;;;2CA1;
+2CA1;COPTIC SMALL LETTER PI;Ll;0;L;;;;;N;;;2CA0;;2CA0
+2CA2;COPTIC CAPITAL LETTER RO;Lu;0;L;;;;;N;;;;2CA3;
+2CA3;COPTIC SMALL LETTER RO;Ll;0;L;;;;;N;;;2CA2;;2CA2
+2CA4;COPTIC CAPITAL LETTER SIMA;Lu;0;L;;;;;N;;;;2CA5;
+2CA5;COPTIC SMALL LETTER SIMA;Ll;0;L;;;;;N;;;2CA4;;2CA4
+2CA6;COPTIC CAPITAL LETTER TAU;Lu;0;L;;;;;N;;;;2CA7;
+2CA7;COPTIC SMALL LETTER TAU;Ll;0;L;;;;;N;;;2CA6;;2CA6
+2CA8;COPTIC CAPITAL LETTER UA;Lu;0;L;;;;;N;;;;2CA9;
+2CA9;COPTIC SMALL LETTER UA;Ll;0;L;;;;;N;;;2CA8;;2CA8
+2CAA;COPTIC CAPITAL LETTER FI;Lu;0;L;;;;;N;;;;2CAB;
+2CAB;COPTIC SMALL LETTER FI;Ll;0;L;;;;;N;;;2CAA;;2CAA
+2CAC;COPTIC CAPITAL LETTER KHI;Lu;0;L;;;;;N;;;;2CAD;
+2CAD;COPTIC SMALL LETTER KHI;Ll;0;L;;;;;N;;;2CAC;;2CAC
+2CAE;COPTIC CAPITAL LETTER PSI;Lu;0;L;;;;;N;;;;2CAF;
+2CAF;COPTIC SMALL LETTER PSI;Ll;0;L;;;;;N;;;2CAE;;2CAE
+2CB0;COPTIC CAPITAL LETTER OOU;Lu;0;L;;;;;N;;;;2CB1;
+2CB1;COPTIC SMALL LETTER OOU;Ll;0;L;;;;;N;;;2CB0;;2CB0
+2CB2;COPTIC CAPITAL LETTER DIALECT-P ALEF;Lu;0;L;;;;;N;;;;2CB3;
+2CB3;COPTIC SMALL LETTER DIALECT-P ALEF;Ll;0;L;;;;;N;;;2CB2;;2CB2
+2CB4;COPTIC CAPITAL LETTER OLD COPTIC AIN;Lu;0;L;;;;;N;;;;2CB5;
+2CB5;COPTIC SMALL LETTER OLD COPTIC AIN;Ll;0;L;;;;;N;;;2CB4;;2CB4
+2CB6;COPTIC CAPITAL LETTER CRYPTOGRAMMIC EIE;Lu;0;L;;;;;N;;;;2CB7;
+2CB7;COPTIC SMALL LETTER CRYPTOGRAMMIC EIE;Ll;0;L;;;;;N;;;2CB6;;2CB6
+2CB8;COPTIC CAPITAL LETTER DIALECT-P KAPA;Lu;0;L;;;;;N;;;;2CB9;
+2CB9;COPTIC SMALL LETTER DIALECT-P KAPA;Ll;0;L;;;;;N;;;2CB8;;2CB8
+2CBA;COPTIC CAPITAL LETTER DIALECT-P NI;Lu;0;L;;;;;N;;;;2CBB;
+2CBB;COPTIC SMALL LETTER DIALECT-P NI;Ll;0;L;;;;;N;;;2CBA;;2CBA
+2CBC;COPTIC CAPITAL LETTER CRYPTOGRAMMIC NI;Lu;0;L;;;;;N;;;;2CBD;
+2CBD;COPTIC SMALL LETTER CRYPTOGRAMMIC NI;Ll;0;L;;;;;N;;;2CBC;;2CBC
+2CBE;COPTIC CAPITAL LETTER OLD COPTIC OOU;Lu;0;L;;;;;N;;;;2CBF;
+2CBF;COPTIC SMALL LETTER OLD COPTIC OOU;Ll;0;L;;;;;N;;;2CBE;;2CBE
+2CC0;COPTIC CAPITAL LETTER SAMPI;Lu;0;L;;;;;N;;;;2CC1;
+2CC1;COPTIC SMALL LETTER SAMPI;Ll;0;L;;;;;N;;;2CC0;;2CC0
+2CC2;COPTIC CAPITAL LETTER CROSSED SHEI;Lu;0;L;;;;;N;;;;2CC3;
+2CC3;COPTIC SMALL LETTER CROSSED SHEI;Ll;0;L;;;;;N;;;2CC2;;2CC2
+2CC4;COPTIC CAPITAL LETTER OLD COPTIC SHEI;Lu;0;L;;;;;N;;;;2CC5;
+2CC5;COPTIC SMALL LETTER OLD COPTIC SHEI;Ll;0;L;;;;;N;;;2CC4;;2CC4
+2CC6;COPTIC CAPITAL LETTER OLD COPTIC ESH;Lu;0;L;;;;;N;;;;2CC7;
+2CC7;COPTIC SMALL LETTER OLD COPTIC ESH;Ll;0;L;;;;;N;;;2CC6;;2CC6
+2CC8;COPTIC CAPITAL LETTER AKHMIMIC KHEI;Lu;0;L;;;;;N;;;;2CC9;
+2CC9;COPTIC SMALL LETTER AKHMIMIC KHEI;Ll;0;L;;;;;N;;;2CC8;;2CC8
+2CCA;COPTIC CAPITAL LETTER DIALECT-P HORI;Lu;0;L;;;;;N;;;;2CCB;
+2CCB;COPTIC SMALL LETTER DIALECT-P HORI;Ll;0;L;;;;;N;;;2CCA;;2CCA
+2CCC;COPTIC CAPITAL LETTER OLD COPTIC HORI;Lu;0;L;;;;;N;;;;2CCD;
+2CCD;COPTIC SMALL LETTER OLD COPTIC HORI;Ll;0;L;;;;;N;;;2CCC;;2CCC
+2CCE;COPTIC CAPITAL LETTER OLD COPTIC HA;Lu;0;L;;;;;N;;;;2CCF;
+2CCF;COPTIC SMALL LETTER OLD COPTIC HA;Ll;0;L;;;;;N;;;2CCE;;2CCE
+2CD0;COPTIC CAPITAL LETTER L-SHAPED HA;Lu;0;L;;;;;N;;;;2CD1;
+2CD1;COPTIC SMALL LETTER L-SHAPED HA;Ll;0;L;;;;;N;;;2CD0;;2CD0
+2CD2;COPTIC CAPITAL LETTER OLD COPTIC HEI;Lu;0;L;;;;;N;;;;2CD3;
+2CD3;COPTIC SMALL LETTER OLD COPTIC HEI;Ll;0;L;;;;;N;;;2CD2;;2CD2
+2CD4;COPTIC CAPITAL LETTER OLD COPTIC HAT;Lu;0;L;;;;;N;;;;2CD5;
+2CD5;COPTIC SMALL LETTER OLD COPTIC HAT;Ll;0;L;;;;;N;;;2CD4;;2CD4
+2CD6;COPTIC CAPITAL LETTER OLD COPTIC GANGIA;Lu;0;L;;;;;N;;;;2CD7;
+2CD7;COPTIC SMALL LETTER OLD COPTIC GANGIA;Ll;0;L;;;;;N;;;2CD6;;2CD6
+2CD8;COPTIC CAPITAL LETTER OLD COPTIC DJA;Lu;0;L;;;;;N;;;;2CD9;
+2CD9;COPTIC SMALL LETTER OLD COPTIC DJA;Ll;0;L;;;;;N;;;2CD8;;2CD8
+2CDA;COPTIC CAPITAL LETTER OLD COPTIC SHIMA;Lu;0;L;;;;;N;;;;2CDB;
+2CDB;COPTIC SMALL LETTER OLD COPTIC SHIMA;Ll;0;L;;;;;N;;;2CDA;;2CDA
+2CDC;COPTIC CAPITAL LETTER OLD NUBIAN SHIMA;Lu;0;L;;;;;N;;;;2CDD;
+2CDD;COPTIC SMALL LETTER OLD NUBIAN SHIMA;Ll;0;L;;;;;N;;;2CDC;;2CDC
+2CDE;COPTIC CAPITAL LETTER OLD NUBIAN NGI;Lu;0;L;;;;;N;;;;2CDF;
+2CDF;COPTIC SMALL LETTER OLD NUBIAN NGI;Ll;0;L;;;;;N;;;2CDE;;2CDE
+2CE0;COPTIC CAPITAL LETTER OLD NUBIAN NYI;Lu;0;L;;;;;N;;;;2CE1;
+2CE1;COPTIC SMALL LETTER OLD NUBIAN NYI;Ll;0;L;;;;;N;;;2CE0;;2CE0
+2CE2;COPTIC CAPITAL LETTER OLD NUBIAN WAU;Lu;0;L;;;;;N;;;;2CE3;
+2CE3;COPTIC SMALL LETTER OLD NUBIAN WAU;Ll;0;L;;;;;N;;;2CE2;;2CE2
+2CE4;COPTIC SYMBOL KAI;Ll;0;L;;;;;N;;;;;
+2CE5;COPTIC SYMBOL MI RO;So;0;ON;;;;;N;;;;;
+2CE6;COPTIC SYMBOL PI RO;So;0;ON;;;;;N;;;;;
+2CE7;COPTIC SYMBOL STAUROS;So;0;ON;;;;;N;;;;;
+2CE8;COPTIC SYMBOL TAU RO;So;0;ON;;;;;N;;;;;
+2CE9;COPTIC SYMBOL KHI RO;So;0;ON;;;;;N;;;;;
+2CEA;COPTIC SYMBOL SHIMA SIMA;So;0;ON;;;;;N;;;;;
+2CEB;COPTIC CAPITAL LETTER CRYPTOGRAMMIC SHEI;Lu;0;L;;;;;N;;;;2CEC;
+2CEC;COPTIC SMALL LETTER CRYPTOGRAMMIC SHEI;Ll;0;L;;;;;N;;;2CEB;;2CEB
+2CED;COPTIC CAPITAL LETTER CRYPTOGRAMMIC GANGIA;Lu;0;L;;;;;N;;;;2CEE;
+2CEE;COPTIC SMALL LETTER CRYPTOGRAMMIC GANGIA;Ll;0;L;;;;;N;;;2CED;;2CED
+2CEF;COPTIC COMBINING NI ABOVE;Mn;230;NSM;;;;;N;;;;;
+2CF0;COPTIC COMBINING SPIRITUS ASPER;Mn;230;NSM;;;;;N;;;;;
+2CF1;COPTIC COMBINING SPIRITUS LENIS;Mn;230;NSM;;;;;N;;;;;
+2CF2;COPTIC CAPITAL LETTER BOHAIRIC KHEI;Lu;0;L;;;;;N;;;;2CF3;
+2CF3;COPTIC SMALL LETTER BOHAIRIC KHEI;Ll;0;L;;;;;N;;;2CF2;;2CF2
+2CF9;COPTIC OLD NUBIAN FULL STOP;Po;0;ON;;;;;N;;;;;
+2CFA;COPTIC OLD NUBIAN DIRECT QUESTION MARK;Po;0;ON;;;;;N;;;;;
+2CFB;COPTIC OLD NUBIAN INDIRECT QUESTION MARK;Po;0;ON;;;;;N;;;;;
+2CFC;COPTIC OLD NUBIAN VERSE DIVIDER;Po;0;ON;;;;;N;;;;;
+2CFD;COPTIC FRACTION ONE HALF;No;0;ON;;;;1/2;N;;;;;
+2CFE;COPTIC FULL STOP;Po;0;ON;;;;;N;;;;;
+2CFF;COPTIC MORPHOLOGICAL DIVIDER;Po;0;ON;;;;;N;;;;;
+2D00;GEORGIAN SMALL LETTER AN;Ll;0;L;;;;;N;;;10A0;;10A0
+2D01;GEORGIAN SMALL LETTER BAN;Ll;0;L;;;;;N;;;10A1;;10A1
+2D02;GEORGIAN SMALL LETTER GAN;Ll;0;L;;;;;N;;;10A2;;10A2
+2D03;GEORGIAN SMALL LETTER DON;Ll;0;L;;;;;N;;;10A3;;10A3
+2D04;GEORGIAN SMALL LETTER EN;Ll;0;L;;;;;N;;;10A4;;10A4
+2D05;GEORGIAN SMALL LETTER VIN;Ll;0;L;;;;;N;;;10A5;;10A5
+2D06;GEORGIAN SMALL LETTER ZEN;Ll;0;L;;;;;N;;;10A6;;10A6
+2D07;GEORGIAN SMALL LETTER TAN;Ll;0;L;;;;;N;;;10A7;;10A7
+2D08;GEORGIAN SMALL LETTER IN;Ll;0;L;;;;;N;;;10A8;;10A8
+2D09;GEORGIAN SMALL LETTER KAN;Ll;0;L;;;;;N;;;10A9;;10A9
+2D0A;GEORGIAN SMALL LETTER LAS;Ll;0;L;;;;;N;;;10AA;;10AA
+2D0B;GEORGIAN SMALL LETTER MAN;Ll;0;L;;;;;N;;;10AB;;10AB
+2D0C;GEORGIAN SMALL LETTER NAR;Ll;0;L;;;;;N;;;10AC;;10AC
+2D0D;GEORGIAN SMALL LETTER ON;Ll;0;L;;;;;N;;;10AD;;10AD
+2D0E;GEORGIAN SMALL LETTER PAR;Ll;0;L;;;;;N;;;10AE;;10AE
+2D0F;GEORGIAN SMALL LETTER ZHAR;Ll;0;L;;;;;N;;;10AF;;10AF
+2D10;GEORGIAN SMALL LETTER RAE;Ll;0;L;;;;;N;;;10B0;;10B0
+2D11;GEORGIAN SMALL LETTER SAN;Ll;0;L;;;;;N;;;10B1;;10B1
+2D12;GEORGIAN SMALL LETTER TAR;Ll;0;L;;;;;N;;;10B2;;10B2
+2D13;GEORGIAN SMALL LETTER UN;Ll;0;L;;;;;N;;;10B3;;10B3
+2D14;GEORGIAN SMALL LETTER PHAR;Ll;0;L;;;;;N;;;10B4;;10B4
+2D15;GEORGIAN SMALL LETTER KHAR;Ll;0;L;;;;;N;;;10B5;;10B5
+2D16;GEORGIAN SMALL LETTER GHAN;Ll;0;L;;;;;N;;;10B6;;10B6
+2D17;GEORGIAN SMALL LETTER QAR;Ll;0;L;;;;;N;;;10B7;;10B7
+2D18;GEORGIAN SMALL LETTER SHIN;Ll;0;L;;;;;N;;;10B8;;10B8
+2D19;GEORGIAN SMALL LETTER CHIN;Ll;0;L;;;;;N;;;10B9;;10B9
+2D1A;GEORGIAN SMALL LETTER CAN;Ll;0;L;;;;;N;;;10BA;;10BA
+2D1B;GEORGIAN SMALL LETTER JIL;Ll;0;L;;;;;N;;;10BB;;10BB
+2D1C;GEORGIAN SMALL LETTER CIL;Ll;0;L;;;;;N;;;10BC;;10BC
+2D1D;GEORGIAN SMALL LETTER CHAR;Ll;0;L;;;;;N;;;10BD;;10BD
+2D1E;GEORGIAN SMALL LETTER XAN;Ll;0;L;;;;;N;;;10BE;;10BE
+2D1F;GEORGIAN SMALL LETTER JHAN;Ll;0;L;;;;;N;;;10BF;;10BF
+2D20;GEORGIAN SMALL LETTER HAE;Ll;0;L;;;;;N;;;10C0;;10C0
+2D21;GEORGIAN SMALL LETTER HE;Ll;0;L;;;;;N;;;10C1;;10C1
+2D22;GEORGIAN SMALL LETTER HIE;Ll;0;L;;;;;N;;;10C2;;10C2
+2D23;GEORGIAN SMALL LETTER WE;Ll;0;L;;;;;N;;;10C3;;10C3
+2D24;GEORGIAN SMALL LETTER HAR;Ll;0;L;;;;;N;;;10C4;;10C4
+2D25;GEORGIAN SMALL LETTER HOE;Ll;0;L;;;;;N;;;10C5;;10C5
+2D27;GEORGIAN SMALL LETTER YN;Ll;0;L;;;;;N;;;10C7;;10C7
+2D2D;GEORGIAN SMALL LETTER AEN;Ll;0;L;;;;;N;;;10CD;;10CD
+2D30;TIFINAGH LETTER YA;Lo;0;L;;;;;N;;;;;
+2D31;TIFINAGH LETTER YAB;Lo;0;L;;;;;N;;;;;
+2D32;TIFINAGH LETTER YABH;Lo;0;L;;;;;N;;;;;
+2D33;TIFINAGH LETTER YAG;Lo;0;L;;;;;N;;;;;
+2D34;TIFINAGH LETTER YAGHH;Lo;0;L;;;;;N;;;;;
+2D35;TIFINAGH LETTER BERBER ACADEMY YAJ;Lo;0;L;;;;;N;;;;;
+2D36;TIFINAGH LETTER YAJ;Lo;0;L;;;;;N;;;;;
+2D37;TIFINAGH LETTER YAD;Lo;0;L;;;;;N;;;;;
+2D38;TIFINAGH LETTER YADH;Lo;0;L;;;;;N;;;;;
+2D39;TIFINAGH LETTER YADD;Lo;0;L;;;;;N;;;;;
+2D3A;TIFINAGH LETTER YADDH;Lo;0;L;;;;;N;;;;;
+2D3B;TIFINAGH LETTER YEY;Lo;0;L;;;;;N;;;;;
+2D3C;TIFINAGH LETTER YAF;Lo;0;L;;;;;N;;;;;
+2D3D;TIFINAGH LETTER YAK;Lo;0;L;;;;;N;;;;;
+2D3E;TIFINAGH LETTER TUAREG YAK;Lo;0;L;;;;;N;;;;;
+2D3F;TIFINAGH LETTER YAKHH;Lo;0;L;;;;;N;;;;;
+2D40;TIFINAGH LETTER YAH;Lo;0;L;;;;;N;;;;;
+2D41;TIFINAGH LETTER BERBER ACADEMY YAH;Lo;0;L;;;;;N;;;;;
+2D42;TIFINAGH LETTER TUAREG YAH;Lo;0;L;;;;;N;;;;;
+2D43;TIFINAGH LETTER YAHH;Lo;0;L;;;;;N;;;;;
+2D44;TIFINAGH LETTER YAA;Lo;0;L;;;;;N;;;;;
+2D45;TIFINAGH LETTER YAKH;Lo;0;L;;;;;N;;;;;
+2D46;TIFINAGH LETTER TUAREG YAKH;Lo;0;L;;;;;N;;;;;
+2D47;TIFINAGH LETTER YAQ;Lo;0;L;;;;;N;;;;;
+2D48;TIFINAGH LETTER TUAREG YAQ;Lo;0;L;;;;;N;;;;;
+2D49;TIFINAGH LETTER YI;Lo;0;L;;;;;N;;;;;
+2D4A;TIFINAGH LETTER YAZH;Lo;0;L;;;;;N;;;;;
+2D4B;TIFINAGH LETTER AHAGGAR YAZH;Lo;0;L;;;;;N;;;;;
+2D4C;TIFINAGH LETTER TUAREG YAZH;Lo;0;L;;;;;N;;;;;
+2D4D;TIFINAGH LETTER YAL;Lo;0;L;;;;;N;;;;;
+2D4E;TIFINAGH LETTER YAM;Lo;0;L;;;;;N;;;;;
+2D4F;TIFINAGH LETTER YAN;Lo;0;L;;;;;N;;;;;
+2D50;TIFINAGH LETTER TUAREG YAGN;Lo;0;L;;;;;N;;;;;
+2D51;TIFINAGH LETTER TUAREG YANG;Lo;0;L;;;;;N;;;;;
+2D52;TIFINAGH LETTER YAP;Lo;0;L;;;;;N;;;;;
+2D53;TIFINAGH LETTER YU;Lo;0;L;;;;;N;;;;;
+2D54;TIFINAGH LETTER YAR;Lo;0;L;;;;;N;;;;;
+2D55;TIFINAGH LETTER YARR;Lo;0;L;;;;;N;;;;;
+2D56;TIFINAGH LETTER YAGH;Lo;0;L;;;;;N;;;;;
+2D57;TIFINAGH LETTER TUAREG YAGH;Lo;0;L;;;;;N;;;;;
+2D58;TIFINAGH LETTER AYER YAGH;Lo;0;L;;;;;N;;;;;
+2D59;TIFINAGH LETTER YAS;Lo;0;L;;;;;N;;;;;
+2D5A;TIFINAGH LETTER YASS;Lo;0;L;;;;;N;;;;;
+2D5B;TIFINAGH LETTER YASH;Lo;0;L;;;;;N;;;;;
+2D5C;TIFINAGH LETTER YAT;Lo;0;L;;;;;N;;;;;
+2D5D;TIFINAGH LETTER YATH;Lo;0;L;;;;;N;;;;;
+2D5E;TIFINAGH LETTER YACH;Lo;0;L;;;;;N;;;;;
+2D5F;TIFINAGH LETTER YATT;Lo;0;L;;;;;N;;;;;
+2D60;TIFINAGH LETTER YAV;Lo;0;L;;;;;N;;;;;
+2D61;TIFINAGH LETTER YAW;Lo;0;L;;;;;N;;;;;
+2D62;TIFINAGH LETTER YAY;Lo;0;L;;;;;N;;;;;
+2D63;TIFINAGH LETTER YAZ;Lo;0;L;;;;;N;;;;;
+2D64;TIFINAGH LETTER TAWELLEMET YAZ;Lo;0;L;;;;;N;;;;;
+2D65;TIFINAGH LETTER YAZZ;Lo;0;L;;;;;N;;;;;
+2D66;TIFINAGH LETTER YE;Lo;0;L;;;;;N;;;;;
+2D67;TIFINAGH LETTER YO;Lo;0;L;;;;;N;;;;;
+2D6F;TIFINAGH MODIFIER LETTER LABIALIZATION MARK;Lm;0;L;<super> 2D61;;;;N;;;;;
+2D70;TIFINAGH SEPARATOR MARK;Po;0;L;;;;;N;;;;;
+2D7F;TIFINAGH CONSONANT JOINER;Mn;9;NSM;;;;;N;;;;;
+2D80;ETHIOPIC SYLLABLE LOA;Lo;0;L;;;;;N;;;;;
+2D81;ETHIOPIC SYLLABLE MOA;Lo;0;L;;;;;N;;;;;
+2D82;ETHIOPIC SYLLABLE ROA;Lo;0;L;;;;;N;;;;;
+2D83;ETHIOPIC SYLLABLE SOA;Lo;0;L;;;;;N;;;;;
+2D84;ETHIOPIC SYLLABLE SHOA;Lo;0;L;;;;;N;;;;;
+2D85;ETHIOPIC SYLLABLE BOA;Lo;0;L;;;;;N;;;;;
+2D86;ETHIOPIC SYLLABLE TOA;Lo;0;L;;;;;N;;;;;
+2D87;ETHIOPIC SYLLABLE COA;Lo;0;L;;;;;N;;;;;
+2D88;ETHIOPIC SYLLABLE NOA;Lo;0;L;;;;;N;;;;;
+2D89;ETHIOPIC SYLLABLE NYOA;Lo;0;L;;;;;N;;;;;
+2D8A;ETHIOPIC SYLLABLE GLOTTAL OA;Lo;0;L;;;;;N;;;;;
+2D8B;ETHIOPIC SYLLABLE ZOA;Lo;0;L;;;;;N;;;;;
+2D8C;ETHIOPIC SYLLABLE DOA;Lo;0;L;;;;;N;;;;;
+2D8D;ETHIOPIC SYLLABLE DDOA;Lo;0;L;;;;;N;;;;;
+2D8E;ETHIOPIC SYLLABLE JOA;Lo;0;L;;;;;N;;;;;
+2D8F;ETHIOPIC SYLLABLE THOA;Lo;0;L;;;;;N;;;;;
+2D90;ETHIOPIC SYLLABLE CHOA;Lo;0;L;;;;;N;;;;;
+2D91;ETHIOPIC SYLLABLE PHOA;Lo;0;L;;;;;N;;;;;
+2D92;ETHIOPIC SYLLABLE POA;Lo;0;L;;;;;N;;;;;
+2D93;ETHIOPIC SYLLABLE GGWA;Lo;0;L;;;;;N;;;;;
+2D94;ETHIOPIC SYLLABLE GGWI;Lo;0;L;;;;;N;;;;;
+2D95;ETHIOPIC SYLLABLE GGWEE;Lo;0;L;;;;;N;;;;;
+2D96;ETHIOPIC SYLLABLE GGWE;Lo;0;L;;;;;N;;;;;
+2DA0;ETHIOPIC SYLLABLE SSA;Lo;0;L;;;;;N;;;;;
+2DA1;ETHIOPIC SYLLABLE SSU;Lo;0;L;;;;;N;;;;;
+2DA2;ETHIOPIC SYLLABLE SSI;Lo;0;L;;;;;N;;;;;
+2DA3;ETHIOPIC SYLLABLE SSAA;Lo;0;L;;;;;N;;;;;
+2DA4;ETHIOPIC SYLLABLE SSEE;Lo;0;L;;;;;N;;;;;
+2DA5;ETHIOPIC SYLLABLE SSE;Lo;0;L;;;;;N;;;;;
+2DA6;ETHIOPIC SYLLABLE SSO;Lo;0;L;;;;;N;;;;;
+2DA8;ETHIOPIC SYLLABLE CCA;Lo;0;L;;;;;N;;;;;
+2DA9;ETHIOPIC SYLLABLE CCU;Lo;0;L;;;;;N;;;;;
+2DAA;ETHIOPIC SYLLABLE CCI;Lo;0;L;;;;;N;;;;;
+2DAB;ETHIOPIC SYLLABLE CCAA;Lo;0;L;;;;;N;;;;;
+2DAC;ETHIOPIC SYLLABLE CCEE;Lo;0;L;;;;;N;;;;;
+2DAD;ETHIOPIC SYLLABLE CCE;Lo;0;L;;;;;N;;;;;
+2DAE;ETHIOPIC SYLLABLE CCO;Lo;0;L;;;;;N;;;;;
+2DB0;ETHIOPIC SYLLABLE ZZA;Lo;0;L;;;;;N;;;;;
+2DB1;ETHIOPIC SYLLABLE ZZU;Lo;0;L;;;;;N;;;;;
+2DB2;ETHIOPIC SYLLABLE ZZI;Lo;0;L;;;;;N;;;;;
+2DB3;ETHIOPIC SYLLABLE ZZAA;Lo;0;L;;;;;N;;;;;
+2DB4;ETHIOPIC SYLLABLE ZZEE;Lo;0;L;;;;;N;;;;;
+2DB5;ETHIOPIC SYLLABLE ZZE;Lo;0;L;;;;;N;;;;;
+2DB6;ETHIOPIC SYLLABLE ZZO;Lo;0;L;;;;;N;;;;;
+2DB8;ETHIOPIC SYLLABLE CCHA;Lo;0;L;;;;;N;;;;;
+2DB9;ETHIOPIC SYLLABLE CCHU;Lo;0;L;;;;;N;;;;;
+2DBA;ETHIOPIC SYLLABLE CCHI;Lo;0;L;;;;;N;;;;;
+2DBB;ETHIOPIC SYLLABLE CCHAA;Lo;0;L;;;;;N;;;;;
+2DBC;ETHIOPIC SYLLABLE CCHEE;Lo;0;L;;;;;N;;;;;
+2DBD;ETHIOPIC SYLLABLE CCHE;Lo;0;L;;;;;N;;;;;
+2DBE;ETHIOPIC SYLLABLE CCHO;Lo;0;L;;;;;N;;;;;
+2DC0;ETHIOPIC SYLLABLE QYA;Lo;0;L;;;;;N;;;;;
+2DC1;ETHIOPIC SYLLABLE QYU;Lo;0;L;;;;;N;;;;;
+2DC2;ETHIOPIC SYLLABLE QYI;Lo;0;L;;;;;N;;;;;
+2DC3;ETHIOPIC SYLLABLE QYAA;Lo;0;L;;;;;N;;;;;
+2DC4;ETHIOPIC SYLLABLE QYEE;Lo;0;L;;;;;N;;;;;
+2DC5;ETHIOPIC SYLLABLE QYE;Lo;0;L;;;;;N;;;;;
+2DC6;ETHIOPIC SYLLABLE QYO;Lo;0;L;;;;;N;;;;;
+2DC8;ETHIOPIC SYLLABLE KYA;Lo;0;L;;;;;N;;;;;
+2DC9;ETHIOPIC SYLLABLE KYU;Lo;0;L;;;;;N;;;;;
+2DCA;ETHIOPIC SYLLABLE KYI;Lo;0;L;;;;;N;;;;;
+2DCB;ETHIOPIC SYLLABLE KYAA;Lo;0;L;;;;;N;;;;;
+2DCC;ETHIOPIC SYLLABLE KYEE;Lo;0;L;;;;;N;;;;;
+2DCD;ETHIOPIC SYLLABLE KYE;Lo;0;L;;;;;N;;;;;
+2DCE;ETHIOPIC SYLLABLE KYO;Lo;0;L;;;;;N;;;;;
+2DD0;ETHIOPIC SYLLABLE XYA;Lo;0;L;;;;;N;;;;;
+2DD1;ETHIOPIC SYLLABLE XYU;Lo;0;L;;;;;N;;;;;
+2DD2;ETHIOPIC SYLLABLE XYI;Lo;0;L;;;;;N;;;;;
+2DD3;ETHIOPIC SYLLABLE XYAA;Lo;0;L;;;;;N;;;;;
+2DD4;ETHIOPIC SYLLABLE XYEE;Lo;0;L;;;;;N;;;;;
+2DD5;ETHIOPIC SYLLABLE XYE;Lo;0;L;;;;;N;;;;;
+2DD6;ETHIOPIC SYLLABLE XYO;Lo;0;L;;;;;N;;;;;
+2DD8;ETHIOPIC SYLLABLE GYA;Lo;0;L;;;;;N;;;;;
+2DD9;ETHIOPIC SYLLABLE GYU;Lo;0;L;;;;;N;;;;;
+2DDA;ETHIOPIC SYLLABLE GYI;Lo;0;L;;;;;N;;;;;
+2DDB;ETHIOPIC SYLLABLE GYAA;Lo;0;L;;;;;N;;;;;
+2DDC;ETHIOPIC SYLLABLE GYEE;Lo;0;L;;;;;N;;;;;
+2DDD;ETHIOPIC SYLLABLE GYE;Lo;0;L;;;;;N;;;;;
+2DDE;ETHIOPIC SYLLABLE GYO;Lo;0;L;;;;;N;;;;;
+2DE0;COMBINING CYRILLIC LETTER BE;Mn;230;NSM;;;;;N;;;;;
+2DE1;COMBINING CYRILLIC LETTER VE;Mn;230;NSM;;;;;N;;;;;
+2DE2;COMBINING CYRILLIC LETTER GHE;Mn;230;NSM;;;;;N;;;;;
+2DE3;COMBINING CYRILLIC LETTER DE;Mn;230;NSM;;;;;N;;;;;
+2DE4;COMBINING CYRILLIC LETTER ZHE;Mn;230;NSM;;;;;N;;;;;
+2DE5;COMBINING CYRILLIC LETTER ZE;Mn;230;NSM;;;;;N;;;;;
+2DE6;COMBINING CYRILLIC LETTER KA;Mn;230;NSM;;;;;N;;;;;
+2DE7;COMBINING CYRILLIC LETTER EL;Mn;230;NSM;;;;;N;;;;;
+2DE8;COMBINING CYRILLIC LETTER EM;Mn;230;NSM;;;;;N;;;;;
+2DE9;COMBINING CYRILLIC LETTER EN;Mn;230;NSM;;;;;N;;;;;
+2DEA;COMBINING CYRILLIC LETTER O;Mn;230;NSM;;;;;N;;;;;
+2DEB;COMBINING CYRILLIC LETTER PE;Mn;230;NSM;;;;;N;;;;;
+2DEC;COMBINING CYRILLIC LETTER ER;Mn;230;NSM;;;;;N;;;;;
+2DED;COMBINING CYRILLIC LETTER ES;Mn;230;NSM;;;;;N;;;;;
+2DEE;COMBINING CYRILLIC LETTER TE;Mn;230;NSM;;;;;N;;;;;
+2DEF;COMBINING CYRILLIC LETTER HA;Mn;230;NSM;;;;;N;;;;;
+2DF0;COMBINING CYRILLIC LETTER TSE;Mn;230;NSM;;;;;N;;;;;
+2DF1;COMBINING CYRILLIC LETTER CHE;Mn;230;NSM;;;;;N;;;;;
+2DF2;COMBINING CYRILLIC LETTER SHA;Mn;230;NSM;;;;;N;;;;;
+2DF3;COMBINING CYRILLIC LETTER SHCHA;Mn;230;NSM;;;;;N;;;;;
+2DF4;COMBINING CYRILLIC LETTER FITA;Mn;230;NSM;;;;;N;;;;;
+2DF5;COMBINING CYRILLIC LETTER ES-TE;Mn;230;NSM;;;;;N;;;;;
+2DF6;COMBINING CYRILLIC LETTER A;Mn;230;NSM;;;;;N;;;;;
+2DF7;COMBINING CYRILLIC LETTER IE;Mn;230;NSM;;;;;N;;;;;
+2DF8;COMBINING CYRILLIC LETTER DJERV;Mn;230;NSM;;;;;N;;;;;
+2DF9;COMBINING CYRILLIC LETTER MONOGRAPH UK;Mn;230;NSM;;;;;N;;;;;
+2DFA;COMBINING CYRILLIC LETTER YAT;Mn;230;NSM;;;;;N;;;;;
+2DFB;COMBINING CYRILLIC LETTER YU;Mn;230;NSM;;;;;N;;;;;
+2DFC;COMBINING CYRILLIC LETTER IOTIFIED A;Mn;230;NSM;;;;;N;;;;;
+2DFD;COMBINING CYRILLIC LETTER LITTLE YUS;Mn;230;NSM;;;;;N;;;;;
+2DFE;COMBINING CYRILLIC LETTER BIG YUS;Mn;230;NSM;;;;;N;;;;;
+2DFF;COMBINING CYRILLIC LETTER IOTIFIED BIG YUS;Mn;230;NSM;;;;;N;;;;;
+2E00;RIGHT ANGLE SUBSTITUTION MARKER;Po;0;ON;;;;;N;;;;;
+2E01;RIGHT ANGLE DOTTED SUBSTITUTION MARKER;Po;0;ON;;;;;N;;;;;
+2E02;LEFT SUBSTITUTION BRACKET;Pi;0;ON;;;;;Y;;;;;
+2E03;RIGHT SUBSTITUTION BRACKET;Pf;0;ON;;;;;Y;;;;;
+2E04;LEFT DOTTED SUBSTITUTION BRACKET;Pi;0;ON;;;;;Y;;;;;
+2E05;RIGHT DOTTED SUBSTITUTION BRACKET;Pf;0;ON;;;;;Y;;;;;
+2E06;RAISED INTERPOLATION MARKER;Po;0;ON;;;;;N;;;;;
+2E07;RAISED DOTTED INTERPOLATION MARKER;Po;0;ON;;;;;N;;;;;
+2E08;DOTTED TRANSPOSITION MARKER;Po;0;ON;;;;;N;;;;;
+2E09;LEFT TRANSPOSITION BRACKET;Pi;0;ON;;;;;Y;;;;;
+2E0A;RIGHT TRANSPOSITION BRACKET;Pf;0;ON;;;;;Y;;;;;
+2E0B;RAISED SQUARE;Po;0;ON;;;;;N;;;;;
+2E0C;LEFT RAISED OMISSION BRACKET;Pi;0;ON;;;;;Y;;;;;
+2E0D;RIGHT RAISED OMISSION BRACKET;Pf;0;ON;;;;;Y;;;;;
+2E0E;EDITORIAL CORONIS;Po;0;ON;;;;;N;;;;;
+2E0F;PARAGRAPHOS;Po;0;ON;;;;;N;;;;;
+2E10;FORKED PARAGRAPHOS;Po;0;ON;;;;;N;;;;;
+2E11;REVERSED FORKED PARAGRAPHOS;Po;0;ON;;;;;N;;;;;
+2E12;HYPODIASTOLE;Po;0;ON;;;;;N;;;;;
+2E13;DOTTED OBELOS;Po;0;ON;;;;;N;;;;;
+2E14;DOWNWARDS ANCORA;Po;0;ON;;;;;N;;;;;
+2E15;UPWARDS ANCORA;Po;0;ON;;;;;N;;;;;
+2E16;DOTTED RIGHT-POINTING ANGLE;Po;0;ON;;;;;N;;;;;
+2E17;DOUBLE OBLIQUE HYPHEN;Pd;0;ON;;;;;N;;;;;
+2E18;INVERTED INTERROBANG;Po;0;ON;;;;;N;;;;;
+2E19;PALM BRANCH;Po;0;ON;;;;;N;;;;;
+2E1A;HYPHEN WITH DIAERESIS;Pd;0;ON;;;;;N;;;;;
+2E1B;TILDE WITH RING ABOVE;Po;0;ON;;;;;N;;;;;
+2E1C;LEFT LOW PARAPHRASE BRACKET;Pi;0;ON;;;;;Y;;;;;
+2E1D;RIGHT LOW PARAPHRASE BRACKET;Pf;0;ON;;;;;Y;;;;;
+2E1E;TILDE WITH DOT ABOVE;Po;0;ON;;;;;N;;;;;
+2E1F;TILDE WITH DOT BELOW;Po;0;ON;;;;;N;;;;;
+2E20;LEFT VERTICAL BAR WITH QUILL;Pi;0;ON;;;;;Y;;;;;
+2E21;RIGHT VERTICAL BAR WITH QUILL;Pf;0;ON;;;;;Y;;;;;
+2E22;TOP LEFT HALF BRACKET;Ps;0;ON;;;;;Y;;;;;
+2E23;TOP RIGHT HALF BRACKET;Pe;0;ON;;;;;Y;;;;;
+2E24;BOTTOM LEFT HALF BRACKET;Ps;0;ON;;;;;Y;;;;;
+2E25;BOTTOM RIGHT HALF BRACKET;Pe;0;ON;;;;;Y;;;;;
+2E26;LEFT SIDEWAYS U BRACKET;Ps;0;ON;;;;;Y;;;;;
+2E27;RIGHT SIDEWAYS U BRACKET;Pe;0;ON;;;;;Y;;;;;
+2E28;LEFT DOUBLE PARENTHESIS;Ps;0;ON;;;;;Y;;;;;
+2E29;RIGHT DOUBLE PARENTHESIS;Pe;0;ON;;;;;Y;;;;;
+2E2A;TWO DOTS OVER ONE DOT PUNCTUATION;Po;0;ON;;;;;N;;;;;
+2E2B;ONE DOT OVER TWO DOTS PUNCTUATION;Po;0;ON;;;;;N;;;;;
+2E2C;SQUARED FOUR DOT PUNCTUATION;Po;0;ON;;;;;N;;;;;
+2E2D;FIVE DOT MARK;Po;0;ON;;;;;N;;;;;
+2E2E;REVERSED QUESTION MARK;Po;0;ON;;;;;N;;;;;
+2E2F;VERTICAL TILDE;Lm;0;ON;;;;;N;;;;;
+2E30;RING POINT;Po;0;ON;;;;;N;;;;;
+2E31;WORD SEPARATOR MIDDLE DOT;Po;0;ON;;;;;N;;;;;
+2E32;TURNED COMMA;Po;0;ON;;;;;N;;;;;
+2E33;RAISED DOT;Po;0;ON;;;;;N;;;;;
+2E34;RAISED COMMA;Po;0;ON;;;;;N;;;;;
+2E35;TURNED SEMICOLON;Po;0;ON;;;;;N;;;;;
+2E36;DAGGER WITH LEFT GUARD;Po;0;ON;;;;;N;;;;;
+2E37;DAGGER WITH RIGHT GUARD;Po;0;ON;;;;;N;;;;;
+2E38;TURNED DAGGER;Po;0;ON;;;;;N;;;;;
+2E39;TOP HALF SECTION SIGN;Po;0;ON;;;;;N;;;;;
+2E3A;TWO-EM DASH;Pd;0;ON;;;;;N;;;;;
+2E3B;THREE-EM DASH;Pd;0;ON;;;;;N;;;;;
+2E3C;STENOGRAPHIC FULL STOP;Po;0;ON;;;;;N;;;;;
+2E3D;VERTICAL SIX DOTS;Po;0;ON;;;;;N;;;;;
+2E3E;WIGGLY VERTICAL LINE;Po;0;ON;;;;;N;;;;;
+2E3F;CAPITULUM;Po;0;ON;;;;;N;;;;;
+2E40;DOUBLE HYPHEN;Pd;0;ON;;;;;N;;;;;
+2E41;REVERSED COMMA;Po;0;ON;;;;;N;;;;;
+2E42;DOUBLE LOW-REVERSED-9 QUOTATION MARK;Ps;0;ON;;;;;N;;;;;
+2E43;DASH WITH LEFT UPTURN;Po;0;ON;;;;;N;;;;;
+2E44;DOUBLE SUSPENSION MARK;Po;0;ON;;;;;N;;;;;
+2E45;INVERTED LOW KAVYKA;Po;0;ON;;;;;N;;;;;
+2E46;INVERTED LOW KAVYKA WITH KAVYKA ABOVE;Po;0;ON;;;;;N;;;;;
+2E47;LOW KAVYKA;Po;0;ON;;;;;N;;;;;
+2E48;LOW KAVYKA WITH DOT;Po;0;ON;;;;;N;;;;;
+2E49;DOUBLE STACKED COMMA;Po;0;ON;;;;;N;;;;;
+2E80;CJK RADICAL REPEAT;So;0;ON;;;;;N;;;;;
+2E81;CJK RADICAL CLIFF;So;0;ON;;;;;N;;;;;
+2E82;CJK RADICAL SECOND ONE;So;0;ON;;;;;N;;;;;
+2E83;CJK RADICAL SECOND TWO;So;0;ON;;;;;N;;;;;
+2E84;CJK RADICAL SECOND THREE;So;0;ON;;;;;N;;;;;
+2E85;CJK RADICAL PERSON;So;0;ON;;;;;N;;;;;
+2E86;CJK RADICAL BOX;So;0;ON;;;;;N;;;;;
+2E87;CJK RADICAL TABLE;So;0;ON;;;;;N;;;;;
+2E88;CJK RADICAL KNIFE ONE;So;0;ON;;;;;N;;;;;
+2E89;CJK RADICAL KNIFE TWO;So;0;ON;;;;;N;;;;;
+2E8A;CJK RADICAL DIVINATION;So;0;ON;;;;;N;;;;;
+2E8B;CJK RADICAL SEAL;So;0;ON;;;;;N;;;;;
+2E8C;CJK RADICAL SMALL ONE;So;0;ON;;;;;N;;;;;
+2E8D;CJK RADICAL SMALL TWO;So;0;ON;;;;;N;;;;;
+2E8E;CJK RADICAL LAME ONE;So;0;ON;;;;;N;;;;;
+2E8F;CJK RADICAL LAME TWO;So;0;ON;;;;;N;;;;;
+2E90;CJK RADICAL LAME THREE;So;0;ON;;;;;N;;;;;
+2E91;CJK RADICAL LAME FOUR;So;0;ON;;;;;N;;;;;
+2E92;CJK RADICAL SNAKE;So;0;ON;;;;;N;;;;;
+2E93;CJK RADICAL THREAD;So;0;ON;;;;;N;;;;;
+2E94;CJK RADICAL SNOUT ONE;So;0;ON;;;;;N;;;;;
+2E95;CJK RADICAL SNOUT TWO;So;0;ON;;;;;N;;;;;
+2E96;CJK RADICAL HEART ONE;So;0;ON;;;;;N;;;;;
+2E97;CJK RADICAL HEART TWO;So;0;ON;;;;;N;;;;;
+2E98;CJK RADICAL HAND;So;0;ON;;;;;N;;;;;
+2E99;CJK RADICAL RAP;So;0;ON;;;;;N;;;;;
+2E9B;CJK RADICAL CHOKE;So;0;ON;;;;;N;;;;;
+2E9C;CJK RADICAL SUN;So;0;ON;;;;;N;;;;;
+2E9D;CJK RADICAL MOON;So;0;ON;;;;;N;;;;;
+2E9E;CJK RADICAL DEATH;So;0;ON;;;;;N;;;;;
+2E9F;CJK RADICAL MOTHER;So;0;ON;<compat> 6BCD;;;;N;;;;;
+2EA0;CJK RADICAL CIVILIAN;So;0;ON;;;;;N;;;;;
+2EA1;CJK RADICAL WATER ONE;So;0;ON;;;;;N;;;;;
+2EA2;CJK RADICAL WATER TWO;So;0;ON;;;;;N;;;;;
+2EA3;CJK RADICAL FIRE;So;0;ON;;;;;N;;;;;
+2EA4;CJK RADICAL PAW ONE;So;0;ON;;;;;N;;;;;
+2EA5;CJK RADICAL PAW TWO;So;0;ON;;;;;N;;;;;
+2EA6;CJK RADICAL SIMPLIFIED HALF TREE TRUNK;So;0;ON;;;;;N;;;;;
+2EA7;CJK RADICAL COW;So;0;ON;;;;;N;;;;;
+2EA8;CJK RADICAL DOG;So;0;ON;;;;;N;;;;;
+2EA9;CJK RADICAL JADE;So;0;ON;;;;;N;;;;;
+2EAA;CJK RADICAL BOLT OF CLOTH;So;0;ON;;;;;N;;;;;
+2EAB;CJK RADICAL EYE;So;0;ON;;;;;N;;;;;
+2EAC;CJK RADICAL SPIRIT ONE;So;0;ON;;;;;N;;;;;
+2EAD;CJK RADICAL SPIRIT TWO;So;0;ON;;;;;N;;;;;
+2EAE;CJK RADICAL BAMBOO;So;0;ON;;;;;N;;;;;
+2EAF;CJK RADICAL SILK;So;0;ON;;;;;N;;;;;
+2EB0;CJK RADICAL C-SIMPLIFIED SILK;So;0;ON;;;;;N;;;;;
+2EB1;CJK RADICAL NET ONE;So;0;ON;;;;;N;;;;;
+2EB2;CJK RADICAL NET TWO;So;0;ON;;;;;N;;;;;
+2EB3;CJK RADICAL NET THREE;So;0;ON;;;;;N;;;;;
+2EB4;CJK RADICAL NET FOUR;So;0;ON;;;;;N;;;;;
+2EB5;CJK RADICAL MESH;So;0;ON;;;;;N;;;;;
+2EB6;CJK RADICAL SHEEP;So;0;ON;;;;;N;;;;;
+2EB7;CJK RADICAL RAM;So;0;ON;;;;;N;;;;;
+2EB8;CJK RADICAL EWE;So;0;ON;;;;;N;;;;;
+2EB9;CJK RADICAL OLD;So;0;ON;;;;;N;;;;;
+2EBA;CJK RADICAL BRUSH ONE;So;0;ON;;;;;N;;;;;
+2EBB;CJK RADICAL BRUSH TWO;So;0;ON;;;;;N;;;;;
+2EBC;CJK RADICAL MEAT;So;0;ON;;;;;N;;;;;
+2EBD;CJK RADICAL MORTAR;So;0;ON;;;;;N;;;;;
+2EBE;CJK RADICAL GRASS ONE;So;0;ON;;;;;N;;;;;
+2EBF;CJK RADICAL GRASS TWO;So;0;ON;;;;;N;;;;;
+2EC0;CJK RADICAL GRASS THREE;So;0;ON;;;;;N;;;;;
+2EC1;CJK RADICAL TIGER;So;0;ON;;;;;N;;;;;
+2EC2;CJK RADICAL CLOTHES;So;0;ON;;;;;N;;;;;
+2EC3;CJK RADICAL WEST ONE;So;0;ON;;;;;N;;;;;
+2EC4;CJK RADICAL WEST TWO;So;0;ON;;;;;N;;;;;
+2EC5;CJK RADICAL C-SIMPLIFIED SEE;So;0;ON;;;;;N;;;;;
+2EC6;CJK RADICAL SIMPLIFIED HORN;So;0;ON;;;;;N;;;;;
+2EC7;CJK RADICAL HORN;So;0;ON;;;;;N;;;;;
+2EC8;CJK RADICAL C-SIMPLIFIED SPEECH;So;0;ON;;;;;N;;;;;
+2EC9;CJK RADICAL C-SIMPLIFIED SHELL;So;0;ON;;;;;N;;;;;
+2ECA;CJK RADICAL FOOT;So;0;ON;;;;;N;;;;;
+2ECB;CJK RADICAL C-SIMPLIFIED CART;So;0;ON;;;;;N;;;;;
+2ECC;CJK RADICAL SIMPLIFIED WALK;So;0;ON;;;;;N;;;;;
+2ECD;CJK RADICAL WALK ONE;So;0;ON;;;;;N;;;;;
+2ECE;CJK RADICAL WALK TWO;So;0;ON;;;;;N;;;;;
+2ECF;CJK RADICAL CITY;So;0;ON;;;;;N;;;;;
+2ED0;CJK RADICAL C-SIMPLIFIED GOLD;So;0;ON;;;;;N;;;;;
+2ED1;CJK RADICAL LONG ONE;So;0;ON;;;;;N;;;;;
+2ED2;CJK RADICAL LONG TWO;So;0;ON;;;;;N;;;;;
+2ED3;CJK RADICAL C-SIMPLIFIED LONG;So;0;ON;;;;;N;;;;;
+2ED4;CJK RADICAL C-SIMPLIFIED GATE;So;0;ON;;;;;N;;;;;
+2ED5;CJK RADICAL MOUND ONE;So;0;ON;;;;;N;;;;;
+2ED6;CJK RADICAL MOUND TWO;So;0;ON;;;;;N;;;;;
+2ED7;CJK RADICAL RAIN;So;0;ON;;;;;N;;;;;
+2ED8;CJK RADICAL BLUE;So;0;ON;;;;;N;;;;;
+2ED9;CJK RADICAL C-SIMPLIFIED TANNED LEATHER;So;0;ON;;;;;N;;;;;
+2EDA;CJK RADICAL C-SIMPLIFIED LEAF;So;0;ON;;;;;N;;;;;
+2EDB;CJK RADICAL C-SIMPLIFIED WIND;So;0;ON;;;;;N;;;;;
+2EDC;CJK RADICAL C-SIMPLIFIED FLY;So;0;ON;;;;;N;;;;;
+2EDD;CJK RADICAL EAT ONE;So;0;ON;;;;;N;;;;;
+2EDE;CJK RADICAL EAT TWO;So;0;ON;;;;;N;;;;;
+2EDF;CJK RADICAL EAT THREE;So;0;ON;;;;;N;;;;;
+2EE0;CJK RADICAL C-SIMPLIFIED EAT;So;0;ON;;;;;N;;;;;
+2EE1;CJK RADICAL HEAD;So;0;ON;;;;;N;;;;;
+2EE2;CJK RADICAL C-SIMPLIFIED HORSE;So;0;ON;;;;;N;;;;;
+2EE3;CJK RADICAL BONE;So;0;ON;;;;;N;;;;;
+2EE4;CJK RADICAL GHOST;So;0;ON;;;;;N;;;;;
+2EE5;CJK RADICAL C-SIMPLIFIED FISH;So;0;ON;;;;;N;;;;;
+2EE6;CJK RADICAL C-SIMPLIFIED BIRD;So;0;ON;;;;;N;;;;;
+2EE7;CJK RADICAL C-SIMPLIFIED SALT;So;0;ON;;;;;N;;;;;
+2EE8;CJK RADICAL SIMPLIFIED WHEAT;So;0;ON;;;;;N;;;;;
+2EE9;CJK RADICAL SIMPLIFIED YELLOW;So;0;ON;;;;;N;;;;;
+2EEA;CJK RADICAL C-SIMPLIFIED FROG;So;0;ON;;;;;N;;;;;
+2EEB;CJK RADICAL J-SIMPLIFIED EVEN;So;0;ON;;;;;N;;;;;
+2EEC;CJK RADICAL C-SIMPLIFIED EVEN;So;0;ON;;;;;N;;;;;
+2EED;CJK RADICAL J-SIMPLIFIED TOOTH;So;0;ON;;;;;N;;;;;
+2EEE;CJK RADICAL C-SIMPLIFIED TOOTH;So;0;ON;;;;;N;;;;;
+2EEF;CJK RADICAL J-SIMPLIFIED DRAGON;So;0;ON;;;;;N;;;;;
+2EF0;CJK RADICAL C-SIMPLIFIED DRAGON;So;0;ON;;;;;N;;;;;
+2EF1;CJK RADICAL TURTLE;So;0;ON;;;;;N;;;;;
+2EF2;CJK RADICAL J-SIMPLIFIED TURTLE;So;0;ON;;;;;N;;;;;
+2EF3;CJK RADICAL C-SIMPLIFIED TURTLE;So;0;ON;<compat> 9F9F;;;;N;;;;;
+2F00;KANGXI RADICAL ONE;So;0;ON;<compat> 4E00;;;;N;;;;;
+2F01;KANGXI RADICAL LINE;So;0;ON;<compat> 4E28;;;;N;;;;;
+2F02;KANGXI RADICAL DOT;So;0;ON;<compat> 4E36;;;;N;;;;;
+2F03;KANGXI RADICAL SLASH;So;0;ON;<compat> 4E3F;;;;N;;;;;
+2F04;KANGXI RADICAL SECOND;So;0;ON;<compat> 4E59;;;;N;;;;;
+2F05;KANGXI RADICAL HOOK;So;0;ON;<compat> 4E85;;;;N;;;;;
+2F06;KANGXI RADICAL TWO;So;0;ON;<compat> 4E8C;;;;N;;;;;
+2F07;KANGXI RADICAL LID;So;0;ON;<compat> 4EA0;;;;N;;;;;
+2F08;KANGXI RADICAL MAN;So;0;ON;<compat> 4EBA;;;;N;;;;;
+2F09;KANGXI RADICAL LEGS;So;0;ON;<compat> 513F;;;;N;;;;;
+2F0A;KANGXI RADICAL ENTER;So;0;ON;<compat> 5165;;;;N;;;;;
+2F0B;KANGXI RADICAL EIGHT;So;0;ON;<compat> 516B;;;;N;;;;;
+2F0C;KANGXI RADICAL DOWN BOX;So;0;ON;<compat> 5182;;;;N;;;;;
+2F0D;KANGXI RADICAL COVER;So;0;ON;<compat> 5196;;;;N;;;;;
+2F0E;KANGXI RADICAL ICE;So;0;ON;<compat> 51AB;;;;N;;;;;
+2F0F;KANGXI RADICAL TABLE;So;0;ON;<compat> 51E0;;;;N;;;;;
+2F10;KANGXI RADICAL OPEN BOX;So;0;ON;<compat> 51F5;;;;N;;;;;
+2F11;KANGXI RADICAL KNIFE;So;0;ON;<compat> 5200;;;;N;;;;;
+2F12;KANGXI RADICAL POWER;So;0;ON;<compat> 529B;;;;N;;;;;
+2F13;KANGXI RADICAL WRAP;So;0;ON;<compat> 52F9;;;;N;;;;;
+2F14;KANGXI RADICAL SPOON;So;0;ON;<compat> 5315;;;;N;;;;;
+2F15;KANGXI RADICAL RIGHT OPEN BOX;So;0;ON;<compat> 531A;;;;N;;;;;
+2F16;KANGXI RADICAL HIDING ENCLOSURE;So;0;ON;<compat> 5338;;;;N;;;;;
+2F17;KANGXI RADICAL TEN;So;0;ON;<compat> 5341;;;;N;;;;;
+2F18;KANGXI RADICAL DIVINATION;So;0;ON;<compat> 535C;;;;N;;;;;
+2F19;KANGXI RADICAL SEAL;So;0;ON;<compat> 5369;;;;N;;;;;
+2F1A;KANGXI RADICAL CLIFF;So;0;ON;<compat> 5382;;;;N;;;;;
+2F1B;KANGXI RADICAL PRIVATE;So;0;ON;<compat> 53B6;;;;N;;;;;
+2F1C;KANGXI RADICAL AGAIN;So;0;ON;<compat> 53C8;;;;N;;;;;
+2F1D;KANGXI RADICAL MOUTH;So;0;ON;<compat> 53E3;;;;N;;;;;
+2F1E;KANGXI RADICAL ENCLOSURE;So;0;ON;<compat> 56D7;;;;N;;;;;
+2F1F;KANGXI RADICAL EARTH;So;0;ON;<compat> 571F;;;;N;;;;;
+2F20;KANGXI RADICAL SCHOLAR;So;0;ON;<compat> 58EB;;;;N;;;;;
+2F21;KANGXI RADICAL GO;So;0;ON;<compat> 5902;;;;N;;;;;
+2F22;KANGXI RADICAL GO SLOWLY;So;0;ON;<compat> 590A;;;;N;;;;;
+2F23;KANGXI RADICAL EVENING;So;0;ON;<compat> 5915;;;;N;;;;;
+2F24;KANGXI RADICAL BIG;So;0;ON;<compat> 5927;;;;N;;;;;
+2F25;KANGXI RADICAL WOMAN;So;0;ON;<compat> 5973;;;;N;;;;;
+2F26;KANGXI RADICAL CHILD;So;0;ON;<compat> 5B50;;;;N;;;;;
+2F27;KANGXI RADICAL ROOF;So;0;ON;<compat> 5B80;;;;N;;;;;
+2F28;KANGXI RADICAL INCH;So;0;ON;<compat> 5BF8;;;;N;;;;;
+2F29;KANGXI RADICAL SMALL;So;0;ON;<compat> 5C0F;;;;N;;;;;
+2F2A;KANGXI RADICAL LAME;So;0;ON;<compat> 5C22;;;;N;;;;;
+2F2B;KANGXI RADICAL CORPSE;So;0;ON;<compat> 5C38;;;;N;;;;;
+2F2C;KANGXI RADICAL SPROUT;So;0;ON;<compat> 5C6E;;;;N;;;;;
+2F2D;KANGXI RADICAL MOUNTAIN;So;0;ON;<compat> 5C71;;;;N;;;;;
+2F2E;KANGXI RADICAL RIVER;So;0;ON;<compat> 5DDB;;;;N;;;;;
+2F2F;KANGXI RADICAL WORK;So;0;ON;<compat> 5DE5;;;;N;;;;;
+2F30;KANGXI RADICAL ONESELF;So;0;ON;<compat> 5DF1;;;;N;;;;;
+2F31;KANGXI RADICAL TURBAN;So;0;ON;<compat> 5DFE;;;;N;;;;;
+2F32;KANGXI RADICAL DRY;So;0;ON;<compat> 5E72;;;;N;;;;;
+2F33;KANGXI RADICAL SHORT THREAD;So;0;ON;<compat> 5E7A;;;;N;;;;;
+2F34;KANGXI RADICAL DOTTED CLIFF;So;0;ON;<compat> 5E7F;;;;N;;;;;
+2F35;KANGXI RADICAL LONG STRIDE;So;0;ON;<compat> 5EF4;;;;N;;;;;
+2F36;KANGXI RADICAL TWO HANDS;So;0;ON;<compat> 5EFE;;;;N;;;;;
+2F37;KANGXI RADICAL SHOOT;So;0;ON;<compat> 5F0B;;;;N;;;;;
+2F38;KANGXI RADICAL BOW;So;0;ON;<compat> 5F13;;;;N;;;;;
+2F39;KANGXI RADICAL SNOUT;So;0;ON;<compat> 5F50;;;;N;;;;;
+2F3A;KANGXI RADICAL BRISTLE;So;0;ON;<compat> 5F61;;;;N;;;;;
+2F3B;KANGXI RADICAL STEP;So;0;ON;<compat> 5F73;;;;N;;;;;
+2F3C;KANGXI RADICAL HEART;So;0;ON;<compat> 5FC3;;;;N;;;;;
+2F3D;KANGXI RADICAL HALBERD;So;0;ON;<compat> 6208;;;;N;;;;;
+2F3E;KANGXI RADICAL DOOR;So;0;ON;<compat> 6236;;;;N;;;;;
+2F3F;KANGXI RADICAL HAND;So;0;ON;<compat> 624B;;;;N;;;;;
+2F40;KANGXI RADICAL BRANCH;So;0;ON;<compat> 652F;;;;N;;;;;
+2F41;KANGXI RADICAL RAP;So;0;ON;<compat> 6534;;;;N;;;;;
+2F42;KANGXI RADICAL SCRIPT;So;0;ON;<compat> 6587;;;;N;;;;;
+2F43;KANGXI RADICAL DIPPER;So;0;ON;<compat> 6597;;;;N;;;;;
+2F44;KANGXI RADICAL AXE;So;0;ON;<compat> 65A4;;;;N;;;;;
+2F45;KANGXI RADICAL SQUARE;So;0;ON;<compat> 65B9;;;;N;;;;;
+2F46;KANGXI RADICAL NOT;So;0;ON;<compat> 65E0;;;;N;;;;;
+2F47;KANGXI RADICAL SUN;So;0;ON;<compat> 65E5;;;;N;;;;;
+2F48;KANGXI RADICAL SAY;So;0;ON;<compat> 66F0;;;;N;;;;;
+2F49;KANGXI RADICAL MOON;So;0;ON;<compat> 6708;;;;N;;;;;
+2F4A;KANGXI RADICAL TREE;So;0;ON;<compat> 6728;;;;N;;;;;
+2F4B;KANGXI RADICAL LACK;So;0;ON;<compat> 6B20;;;;N;;;;;
+2F4C;KANGXI RADICAL STOP;So;0;ON;<compat> 6B62;;;;N;;;;;
+2F4D;KANGXI RADICAL DEATH;So;0;ON;<compat> 6B79;;;;N;;;;;
+2F4E;KANGXI RADICAL WEAPON;So;0;ON;<compat> 6BB3;;;;N;;;;;
+2F4F;KANGXI RADICAL DO NOT;So;0;ON;<compat> 6BCB;;;;N;;;;;
+2F50;KANGXI RADICAL COMPARE;So;0;ON;<compat> 6BD4;;;;N;;;;;
+2F51;KANGXI RADICAL FUR;So;0;ON;<compat> 6BDB;;;;N;;;;;
+2F52;KANGXI RADICAL CLAN;So;0;ON;<compat> 6C0F;;;;N;;;;;
+2F53;KANGXI RADICAL STEAM;So;0;ON;<compat> 6C14;;;;N;;;;;
+2F54;KANGXI RADICAL WATER;So;0;ON;<compat> 6C34;;;;N;;;;;
+2F55;KANGXI RADICAL FIRE;So;0;ON;<compat> 706B;;;;N;;;;;
+2F56;KANGXI RADICAL CLAW;So;0;ON;<compat> 722A;;;;N;;;;;
+2F57;KANGXI RADICAL FATHER;So;0;ON;<compat> 7236;;;;N;;;;;
+2F58;KANGXI RADICAL DOUBLE X;So;0;ON;<compat> 723B;;;;N;;;;;
+2F59;KANGXI RADICAL HALF TREE TRUNK;So;0;ON;<compat> 723F;;;;N;;;;;
+2F5A;KANGXI RADICAL SLICE;So;0;ON;<compat> 7247;;;;N;;;;;
+2F5B;KANGXI RADICAL FANG;So;0;ON;<compat> 7259;;;;N;;;;;
+2F5C;KANGXI RADICAL COW;So;0;ON;<compat> 725B;;;;N;;;;;
+2F5D;KANGXI RADICAL DOG;So;0;ON;<compat> 72AC;;;;N;;;;;
+2F5E;KANGXI RADICAL PROFOUND;So;0;ON;<compat> 7384;;;;N;;;;;
+2F5F;KANGXI RADICAL JADE;So;0;ON;<compat> 7389;;;;N;;;;;
+2F60;KANGXI RADICAL MELON;So;0;ON;<compat> 74DC;;;;N;;;;;
+2F61;KANGXI RADICAL TILE;So;0;ON;<compat> 74E6;;;;N;;;;;
+2F62;KANGXI RADICAL SWEET;So;0;ON;<compat> 7518;;;;N;;;;;
+2F63;KANGXI RADICAL LIFE;So;0;ON;<compat> 751F;;;;N;;;;;
+2F64;KANGXI RADICAL USE;So;0;ON;<compat> 7528;;;;N;;;;;
+2F65;KANGXI RADICAL FIELD;So;0;ON;<compat> 7530;;;;N;;;;;
+2F66;KANGXI RADICAL BOLT OF CLOTH;So;0;ON;<compat> 758B;;;;N;;;;;
+2F67;KANGXI RADICAL SICKNESS;So;0;ON;<compat> 7592;;;;N;;;;;
+2F68;KANGXI RADICAL DOTTED TENT;So;0;ON;<compat> 7676;;;;N;;;;;
+2F69;KANGXI RADICAL WHITE;So;0;ON;<compat> 767D;;;;N;;;;;
+2F6A;KANGXI RADICAL SKIN;So;0;ON;<compat> 76AE;;;;N;;;;;
+2F6B;KANGXI RADICAL DISH;So;0;ON;<compat> 76BF;;;;N;;;;;
+2F6C;KANGXI RADICAL EYE;So;0;ON;<compat> 76EE;;;;N;;;;;
+2F6D;KANGXI RADICAL SPEAR;So;0;ON;<compat> 77DB;;;;N;;;;;
+2F6E;KANGXI RADICAL ARROW;So;0;ON;<compat> 77E2;;;;N;;;;;
+2F6F;KANGXI RADICAL STONE;So;0;ON;<compat> 77F3;;;;N;;;;;
+2F70;KANGXI RADICAL SPIRIT;So;0;ON;<compat> 793A;;;;N;;;;;
+2F71;KANGXI RADICAL TRACK;So;0;ON;<compat> 79B8;;;;N;;;;;
+2F72;KANGXI RADICAL GRAIN;So;0;ON;<compat> 79BE;;;;N;;;;;
+2F73;KANGXI RADICAL CAVE;So;0;ON;<compat> 7A74;;;;N;;;;;
+2F74;KANGXI RADICAL STAND;So;0;ON;<compat> 7ACB;;;;N;;;;;
+2F75;KANGXI RADICAL BAMBOO;So;0;ON;<compat> 7AF9;;;;N;;;;;
+2F76;KANGXI RADICAL RICE;So;0;ON;<compat> 7C73;;;;N;;;;;
+2F77;KANGXI RADICAL SILK;So;0;ON;<compat> 7CF8;;;;N;;;;;
+2F78;KANGXI RADICAL JAR;So;0;ON;<compat> 7F36;;;;N;;;;;
+2F79;KANGXI RADICAL NET;So;0;ON;<compat> 7F51;;;;N;;;;;
+2F7A;KANGXI RADICAL SHEEP;So;0;ON;<compat> 7F8A;;;;N;;;;;
+2F7B;KANGXI RADICAL FEATHER;So;0;ON;<compat> 7FBD;;;;N;;;;;
+2F7C;KANGXI RADICAL OLD;So;0;ON;<compat> 8001;;;;N;;;;;
+2F7D;KANGXI RADICAL AND;So;0;ON;<compat> 800C;;;;N;;;;;
+2F7E;KANGXI RADICAL PLOW;So;0;ON;<compat> 8012;;;;N;;;;;
+2F7F;KANGXI RADICAL EAR;So;0;ON;<compat> 8033;;;;N;;;;;
+2F80;KANGXI RADICAL BRUSH;So;0;ON;<compat> 807F;;;;N;;;;;
+2F81;KANGXI RADICAL MEAT;So;0;ON;<compat> 8089;;;;N;;;;;
+2F82;KANGXI RADICAL MINISTER;So;0;ON;<compat> 81E3;;;;N;;;;;
+2F83;KANGXI RADICAL SELF;So;0;ON;<compat> 81EA;;;;N;;;;;
+2F84;KANGXI RADICAL ARRIVE;So;0;ON;<compat> 81F3;;;;N;;;;;
+2F85;KANGXI RADICAL MORTAR;So;0;ON;<compat> 81FC;;;;N;;;;;
+2F86;KANGXI RADICAL TONGUE;So;0;ON;<compat> 820C;;;;N;;;;;
+2F87;KANGXI RADICAL OPPOSE;So;0;ON;<compat> 821B;;;;N;;;;;
+2F88;KANGXI RADICAL BOAT;So;0;ON;<compat> 821F;;;;N;;;;;
+2F89;KANGXI RADICAL STOPPING;So;0;ON;<compat> 826E;;;;N;;;;;
+2F8A;KANGXI RADICAL COLOR;So;0;ON;<compat> 8272;;;;N;;;;;
+2F8B;KANGXI RADICAL GRASS;So;0;ON;<compat> 8278;;;;N;;;;;
+2F8C;KANGXI RADICAL TIGER;So;0;ON;<compat> 864D;;;;N;;;;;
+2F8D;KANGXI RADICAL INSECT;So;0;ON;<compat> 866B;;;;N;;;;;
+2F8E;KANGXI RADICAL BLOOD;So;0;ON;<compat> 8840;;;;N;;;;;
+2F8F;KANGXI RADICAL WALK ENCLOSURE;So;0;ON;<compat> 884C;;;;N;;;;;
+2F90;KANGXI RADICAL CLOTHES;So;0;ON;<compat> 8863;;;;N;;;;;
+2F91;KANGXI RADICAL WEST;So;0;ON;<compat> 897E;;;;N;;;;;
+2F92;KANGXI RADICAL SEE;So;0;ON;<compat> 898B;;;;N;;;;;
+2F93;KANGXI RADICAL HORN;So;0;ON;<compat> 89D2;;;;N;;;;;
+2F94;KANGXI RADICAL SPEECH;So;0;ON;<compat> 8A00;;;;N;;;;;
+2F95;KANGXI RADICAL VALLEY;So;0;ON;<compat> 8C37;;;;N;;;;;
+2F96;KANGXI RADICAL BEAN;So;0;ON;<compat> 8C46;;;;N;;;;;
+2F97;KANGXI RADICAL PIG;So;0;ON;<compat> 8C55;;;;N;;;;;
+2F98;KANGXI RADICAL BADGER;So;0;ON;<compat> 8C78;;;;N;;;;;
+2F99;KANGXI RADICAL SHELL;So;0;ON;<compat> 8C9D;;;;N;;;;;
+2F9A;KANGXI RADICAL RED;So;0;ON;<compat> 8D64;;;;N;;;;;
+2F9B;KANGXI RADICAL RUN;So;0;ON;<compat> 8D70;;;;N;;;;;
+2F9C;KANGXI RADICAL FOOT;So;0;ON;<compat> 8DB3;;;;N;;;;;
+2F9D;KANGXI RADICAL BODY;So;0;ON;<compat> 8EAB;;;;N;;;;;
+2F9E;KANGXI RADICAL CART;So;0;ON;<compat> 8ECA;;;;N;;;;;
+2F9F;KANGXI RADICAL BITTER;So;0;ON;<compat> 8F9B;;;;N;;;;;
+2FA0;KANGXI RADICAL MORNING;So;0;ON;<compat> 8FB0;;;;N;;;;;
+2FA1;KANGXI RADICAL WALK;So;0;ON;<compat> 8FB5;;;;N;;;;;
+2FA2;KANGXI RADICAL CITY;So;0;ON;<compat> 9091;;;;N;;;;;
+2FA3;KANGXI RADICAL WINE;So;0;ON;<compat> 9149;;;;N;;;;;
+2FA4;KANGXI RADICAL DISTINGUISH;So;0;ON;<compat> 91C6;;;;N;;;;;
+2FA5;KANGXI RADICAL VILLAGE;So;0;ON;<compat> 91CC;;;;N;;;;;
+2FA6;KANGXI RADICAL GOLD;So;0;ON;<compat> 91D1;;;;N;;;;;
+2FA7;KANGXI RADICAL LONG;So;0;ON;<compat> 9577;;;;N;;;;;
+2FA8;KANGXI RADICAL GATE;So;0;ON;<compat> 9580;;;;N;;;;;
+2FA9;KANGXI RADICAL MOUND;So;0;ON;<compat> 961C;;;;N;;;;;
+2FAA;KANGXI RADICAL SLAVE;So;0;ON;<compat> 96B6;;;;N;;;;;
+2FAB;KANGXI RADICAL SHORT TAILED BIRD;So;0;ON;<compat> 96B9;;;;N;;;;;
+2FAC;KANGXI RADICAL RAIN;So;0;ON;<compat> 96E8;;;;N;;;;;
+2FAD;KANGXI RADICAL BLUE;So;0;ON;<compat> 9751;;;;N;;;;;
+2FAE;KANGXI RADICAL WRONG;So;0;ON;<compat> 975E;;;;N;;;;;
+2FAF;KANGXI RADICAL FACE;So;0;ON;<compat> 9762;;;;N;;;;;
+2FB0;KANGXI RADICAL LEATHER;So;0;ON;<compat> 9769;;;;N;;;;;
+2FB1;KANGXI RADICAL TANNED LEATHER;So;0;ON;<compat> 97CB;;;;N;;;;;
+2FB2;KANGXI RADICAL LEEK;So;0;ON;<compat> 97ED;;;;N;;;;;
+2FB3;KANGXI RADICAL SOUND;So;0;ON;<compat> 97F3;;;;N;;;;;
+2FB4;KANGXI RADICAL LEAF;So;0;ON;<compat> 9801;;;;N;;;;;
+2FB5;KANGXI RADICAL WIND;So;0;ON;<compat> 98A8;;;;N;;;;;
+2FB6;KANGXI RADICAL FLY;So;0;ON;<compat> 98DB;;;;N;;;;;
+2FB7;KANGXI RADICAL EAT;So;0;ON;<compat> 98DF;;;;N;;;;;
+2FB8;KANGXI RADICAL HEAD;So;0;ON;<compat> 9996;;;;N;;;;;
+2FB9;KANGXI RADICAL FRAGRANT;So;0;ON;<compat> 9999;;;;N;;;;;
+2FBA;KANGXI RADICAL HORSE;So;0;ON;<compat> 99AC;;;;N;;;;;
+2FBB;KANGXI RADICAL BONE;So;0;ON;<compat> 9AA8;;;;N;;;;;
+2FBC;KANGXI RADICAL TALL;So;0;ON;<compat> 9AD8;;;;N;;;;;
+2FBD;KANGXI RADICAL HAIR;So;0;ON;<compat> 9ADF;;;;N;;;;;
+2FBE;KANGXI RADICAL FIGHT;So;0;ON;<compat> 9B25;;;;N;;;;;
+2FBF;KANGXI RADICAL SACRIFICIAL WINE;So;0;ON;<compat> 9B2F;;;;N;;;;;
+2FC0;KANGXI RADICAL CAULDRON;So;0;ON;<compat> 9B32;;;;N;;;;;
+2FC1;KANGXI RADICAL GHOST;So;0;ON;<compat> 9B3C;;;;N;;;;;
+2FC2;KANGXI RADICAL FISH;So;0;ON;<compat> 9B5A;;;;N;;;;;
+2FC3;KANGXI RADICAL BIRD;So;0;ON;<compat> 9CE5;;;;N;;;;;
+2FC4;KANGXI RADICAL SALT;So;0;ON;<compat> 9E75;;;;N;;;;;
+2FC5;KANGXI RADICAL DEER;So;0;ON;<compat> 9E7F;;;;N;;;;;
+2FC6;KANGXI RADICAL WHEAT;So;0;ON;<compat> 9EA5;;;;N;;;;;
+2FC7;KANGXI RADICAL HEMP;So;0;ON;<compat> 9EBB;;;;N;;;;;
+2FC8;KANGXI RADICAL YELLOW;So;0;ON;<compat> 9EC3;;;;N;;;;;
+2FC9;KANGXI RADICAL MILLET;So;0;ON;<compat> 9ECD;;;;N;;;;;
+2FCA;KANGXI RADICAL BLACK;So;0;ON;<compat> 9ED1;;;;N;;;;;
+2FCB;KANGXI RADICAL EMBROIDERY;So;0;ON;<compat> 9EF9;;;;N;;;;;
+2FCC;KANGXI RADICAL FROG;So;0;ON;<compat> 9EFD;;;;N;;;;;
+2FCD;KANGXI RADICAL TRIPOD;So;0;ON;<compat> 9F0E;;;;N;;;;;
+2FCE;KANGXI RADICAL DRUM;So;0;ON;<compat> 9F13;;;;N;;;;;
+2FCF;KANGXI RADICAL RAT;So;0;ON;<compat> 9F20;;;;N;;;;;
+2FD0;KANGXI RADICAL NOSE;So;0;ON;<compat> 9F3B;;;;N;;;;;
+2FD1;KANGXI RADICAL EVEN;So;0;ON;<compat> 9F4A;;;;N;;;;;
+2FD2;KANGXI RADICAL TOOTH;So;0;ON;<compat> 9F52;;;;N;;;;;
+2FD3;KANGXI RADICAL DRAGON;So;0;ON;<compat> 9F8D;;;;N;;;;;
+2FD4;KANGXI RADICAL TURTLE;So;0;ON;<compat> 9F9C;;;;N;;;;;
+2FD5;KANGXI RADICAL FLUTE;So;0;ON;<compat> 9FA0;;;;N;;;;;
+2FF0;IDEOGRAPHIC DESCRIPTION CHARACTER LEFT TO RIGHT;So;0;ON;;;;;N;;;;;
+2FF1;IDEOGRAPHIC DESCRIPTION CHARACTER ABOVE TO BELOW;So;0;ON;;;;;N;;;;;
+2FF2;IDEOGRAPHIC DESCRIPTION CHARACTER LEFT TO MIDDLE AND RIGHT;So;0;ON;;;;;N;;;;;
+2FF3;IDEOGRAPHIC DESCRIPTION CHARACTER ABOVE TO MIDDLE AND BELOW;So;0;ON;;;;;N;;;;;
+2FF4;IDEOGRAPHIC DESCRIPTION CHARACTER FULL SURROUND;So;0;ON;;;;;N;;;;;
+2FF5;IDEOGRAPHIC DESCRIPTION CHARACTER SURROUND FROM ABOVE;So;0;ON;;;;;N;;;;;
+2FF6;IDEOGRAPHIC DESCRIPTION CHARACTER SURROUND FROM BELOW;So;0;ON;;;;;N;;;;;
+2FF7;IDEOGRAPHIC DESCRIPTION CHARACTER SURROUND FROM LEFT;So;0;ON;;;;;N;;;;;
+2FF8;IDEOGRAPHIC DESCRIPTION CHARACTER SURROUND FROM UPPER LEFT;So;0;ON;;;;;N;;;;;
+2FF9;IDEOGRAPHIC DESCRIPTION CHARACTER SURROUND FROM UPPER RIGHT;So;0;ON;;;;;N;;;;;
+2FFA;IDEOGRAPHIC DESCRIPTION CHARACTER SURROUND FROM LOWER LEFT;So;0;ON;;;;;N;;;;;
+2FFB;IDEOGRAPHIC DESCRIPTION CHARACTER OVERLAID;So;0;ON;;;;;N;;;;;
+3000;IDEOGRAPHIC SPACE;Zs;0;WS;<wide> 0020;;;;N;;;;;
+3001;IDEOGRAPHIC COMMA;Po;0;ON;;;;;N;;;;;
+3002;IDEOGRAPHIC FULL STOP;Po;0;ON;;;;;N;IDEOGRAPHIC PERIOD;;;;
+3003;DITTO MARK;Po;0;ON;;;;;N;;;;;
+3004;JAPANESE INDUSTRIAL STANDARD SYMBOL;So;0;ON;;;;;N;;;;;
+3005;IDEOGRAPHIC ITERATION MARK;Lm;0;L;;;;;N;;;;;
+3006;IDEOGRAPHIC CLOSING MARK;Lo;0;L;;;;;N;;;;;
+3007;IDEOGRAPHIC NUMBER ZERO;Nl;0;L;;;;0;N;;;;;
+3008;LEFT ANGLE BRACKET;Ps;0;ON;;;;;Y;OPENING ANGLE BRACKET;;;;
+3009;RIGHT ANGLE BRACKET;Pe;0;ON;;;;;Y;CLOSING ANGLE BRACKET;;;;
+300A;LEFT DOUBLE ANGLE BRACKET;Ps;0;ON;;;;;Y;OPENING DOUBLE ANGLE BRACKET;;;;
+300B;RIGHT DOUBLE ANGLE BRACKET;Pe;0;ON;;;;;Y;CLOSING DOUBLE ANGLE BRACKET;;;;
+300C;LEFT CORNER BRACKET;Ps;0;ON;;;;;Y;OPENING CORNER BRACKET;;;;
+300D;RIGHT CORNER BRACKET;Pe;0;ON;;;;;Y;CLOSING CORNER BRACKET;;;;
+300E;LEFT WHITE CORNER BRACKET;Ps;0;ON;;;;;Y;OPENING WHITE CORNER BRACKET;;;;
+300F;RIGHT WHITE CORNER BRACKET;Pe;0;ON;;;;;Y;CLOSING WHITE CORNER BRACKET;;;;
+3010;LEFT BLACK LENTICULAR BRACKET;Ps;0;ON;;;;;Y;OPENING BLACK LENTICULAR BRACKET;;;;
+3011;RIGHT BLACK LENTICULAR BRACKET;Pe;0;ON;;;;;Y;CLOSING BLACK LENTICULAR BRACKET;;;;
+3012;POSTAL MARK;So;0;ON;;;;;N;;;;;
+3013;GETA MARK;So;0;ON;;;;;N;;;;;
+3014;LEFT TORTOISE SHELL BRACKET;Ps;0;ON;;;;;Y;OPENING TORTOISE SHELL BRACKET;;;;
+3015;RIGHT TORTOISE SHELL BRACKET;Pe;0;ON;;;;;Y;CLOSING TORTOISE SHELL BRACKET;;;;
+3016;LEFT WHITE LENTICULAR BRACKET;Ps;0;ON;;;;;Y;OPENING WHITE LENTICULAR BRACKET;;;;
+3017;RIGHT WHITE LENTICULAR BRACKET;Pe;0;ON;;;;;Y;CLOSING WHITE LENTICULAR BRACKET;;;;
+3018;LEFT WHITE TORTOISE SHELL BRACKET;Ps;0;ON;;;;;Y;OPENING WHITE TORTOISE SHELL BRACKET;;;;
+3019;RIGHT WHITE TORTOISE SHELL BRACKET;Pe;0;ON;;;;;Y;CLOSING WHITE TORTOISE SHELL BRACKET;;;;
+301A;LEFT WHITE SQUARE BRACKET;Ps;0;ON;;;;;Y;OPENING WHITE SQUARE BRACKET;;;;
+301B;RIGHT WHITE SQUARE BRACKET;Pe;0;ON;;;;;Y;CLOSING WHITE SQUARE BRACKET;;;;
+301C;WAVE DASH;Pd;0;ON;;;;;N;;;;;
+301D;REVERSED DOUBLE PRIME QUOTATION MARK;Ps;0;ON;;;;;N;;;;;
+301E;DOUBLE PRIME QUOTATION MARK;Pe;0;ON;;;;;N;;;;;
+301F;LOW DOUBLE PRIME QUOTATION MARK;Pe;0;ON;;;;;N;;;;;
+3020;POSTAL MARK FACE;So;0;ON;;;;;N;;;;;
+3021;HANGZHOU NUMERAL ONE;Nl;0;L;;;;1;N;;;;;
+3022;HANGZHOU NUMERAL TWO;Nl;0;L;;;;2;N;;;;;
+3023;HANGZHOU NUMERAL THREE;Nl;0;L;;;;3;N;;;;;
+3024;HANGZHOU NUMERAL FOUR;Nl;0;L;;;;4;N;;;;;
+3025;HANGZHOU NUMERAL FIVE;Nl;0;L;;;;5;N;;;;;
+3026;HANGZHOU NUMERAL SIX;Nl;0;L;;;;6;N;;;;;
+3027;HANGZHOU NUMERAL SEVEN;Nl;0;L;;;;7;N;;;;;
+3028;HANGZHOU NUMERAL EIGHT;Nl;0;L;;;;8;N;;;;;
+3029;HANGZHOU NUMERAL NINE;Nl;0;L;;;;9;N;;;;;
+302A;IDEOGRAPHIC LEVEL TONE MARK;Mn;218;NSM;;;;;N;;;;;
+302B;IDEOGRAPHIC RISING TONE MARK;Mn;228;NSM;;;;;N;;;;;
+302C;IDEOGRAPHIC DEPARTING TONE MARK;Mn;232;NSM;;;;;N;;;;;
+302D;IDEOGRAPHIC ENTERING TONE MARK;Mn;222;NSM;;;;;N;;;;;
+302E;HANGUL SINGLE DOT TONE MARK;Mc;224;L;;;;;N;;;;;
+302F;HANGUL DOUBLE DOT TONE MARK;Mc;224;L;;;;;N;;;;;
+3030;WAVY DASH;Pd;0;ON;;;;;N;;;;;
+3031;VERTICAL KANA REPEAT MARK;Lm;0;L;;;;;N;;;;;
+3032;VERTICAL KANA REPEAT WITH VOICED SOUND MARK;Lm;0;L;;;;;N;;;;;
+3033;VERTICAL KANA REPEAT MARK UPPER HALF;Lm;0;L;;;;;N;;;;;
+3034;VERTICAL KANA REPEAT WITH VOICED SOUND MARK UPPER HALF;Lm;0;L;;;;;N;;;;;
+3035;VERTICAL KANA REPEAT MARK LOWER HALF;Lm;0;L;;;;;N;;;;;
+3036;CIRCLED POSTAL MARK;So;0;ON;<compat> 3012;;;;N;;;;;
+3037;IDEOGRAPHIC TELEGRAPH LINE FEED SEPARATOR SYMBOL;So;0;ON;;;;;N;;;;;
+3038;HANGZHOU NUMERAL TEN;Nl;0;L;<compat> 5341;;;10;N;;;;;
+3039;HANGZHOU NUMERAL TWENTY;Nl;0;L;<compat> 5344;;;20;N;;;;;
+303A;HANGZHOU NUMERAL THIRTY;Nl;0;L;<compat> 5345;;;30;N;;;;;
+303B;VERTICAL IDEOGRAPHIC ITERATION MARK;Lm;0;L;;;;;N;;;;;
+303C;MASU MARK;Lo;0;L;;;;;N;;;;;
+303D;PART ALTERNATION MARK;Po;0;ON;;;;;N;;;;;
+303E;IDEOGRAPHIC VARIATION INDICATOR;So;0;ON;;;;;N;;;;;
+303F;IDEOGRAPHIC HALF FILL SPACE;So;0;ON;;;;;N;;;;;
+3041;HIRAGANA LETTER SMALL A;Lo;0;L;;;;;N;;;;;
+3042;HIRAGANA LETTER A;Lo;0;L;;;;;N;;;;;
+3043;HIRAGANA LETTER SMALL I;Lo;0;L;;;;;N;;;;;
+3044;HIRAGANA LETTER I;Lo;0;L;;;;;N;;;;;
+3045;HIRAGANA LETTER SMALL U;Lo;0;L;;;;;N;;;;;
+3046;HIRAGANA LETTER U;Lo;0;L;;;;;N;;;;;
+3047;HIRAGANA LETTER SMALL E;Lo;0;L;;;;;N;;;;;
+3048;HIRAGANA LETTER E;Lo;0;L;;;;;N;;;;;
+3049;HIRAGANA LETTER SMALL O;Lo;0;L;;;;;N;;;;;
+304A;HIRAGANA LETTER O;Lo;0;L;;;;;N;;;;;
+304B;HIRAGANA LETTER KA;Lo;0;L;;;;;N;;;;;
+304C;HIRAGANA LETTER GA;Lo;0;L;304B 3099;;;;N;;;;;
+304D;HIRAGANA LETTER KI;Lo;0;L;;;;;N;;;;;
+304E;HIRAGANA LETTER GI;Lo;0;L;304D 3099;;;;N;;;;;
+304F;HIRAGANA LETTER KU;Lo;0;L;;;;;N;;;;;
+3050;HIRAGANA LETTER GU;Lo;0;L;304F 3099;;;;N;;;;;
+3051;HIRAGANA LETTER KE;Lo;0;L;;;;;N;;;;;
+3052;HIRAGANA LETTER GE;Lo;0;L;3051 3099;;;;N;;;;;
+3053;HIRAGANA LETTER KO;Lo;0;L;;;;;N;;;;;
+3054;HIRAGANA LETTER GO;Lo;0;L;3053 3099;;;;N;;;;;
+3055;HIRAGANA LETTER SA;Lo;0;L;;;;;N;;;;;
+3056;HIRAGANA LETTER ZA;Lo;0;L;3055 3099;;;;N;;;;;
+3057;HIRAGANA LETTER SI;Lo;0;L;;;;;N;;;;;
+3058;HIRAGANA LETTER ZI;Lo;0;L;3057 3099;;;;N;;;;;
+3059;HIRAGANA LETTER SU;Lo;0;L;;;;;N;;;;;
+305A;HIRAGANA LETTER ZU;Lo;0;L;3059 3099;;;;N;;;;;
+305B;HIRAGANA LETTER SE;Lo;0;L;;;;;N;;;;;
+305C;HIRAGANA LETTER ZE;Lo;0;L;305B 3099;;;;N;;;;;
+305D;HIRAGANA LETTER SO;Lo;0;L;;;;;N;;;;;
+305E;HIRAGANA LETTER ZO;Lo;0;L;305D 3099;;;;N;;;;;
+305F;HIRAGANA LETTER TA;Lo;0;L;;;;;N;;;;;
+3060;HIRAGANA LETTER DA;Lo;0;L;305F 3099;;;;N;;;;;
+3061;HIRAGANA LETTER TI;Lo;0;L;;;;;N;;;;;
+3062;HIRAGANA LETTER DI;Lo;0;L;3061 3099;;;;N;;;;;
+3063;HIRAGANA LETTER SMALL TU;Lo;0;L;;;;;N;;;;;
+3064;HIRAGANA LETTER TU;Lo;0;L;;;;;N;;;;;
+3065;HIRAGANA LETTER DU;Lo;0;L;3064 3099;;;;N;;;;;
+3066;HIRAGANA LETTER TE;Lo;0;L;;;;;N;;;;;
+3067;HIRAGANA LETTER DE;Lo;0;L;3066 3099;;;;N;;;;;
+3068;HIRAGANA LETTER TO;Lo;0;L;;;;;N;;;;;
+3069;HIRAGANA LETTER DO;Lo;0;L;3068 3099;;;;N;;;;;
+306A;HIRAGANA LETTER NA;Lo;0;L;;;;;N;;;;;
+306B;HIRAGANA LETTER NI;Lo;0;L;;;;;N;;;;;
+306C;HIRAGANA LETTER NU;Lo;0;L;;;;;N;;;;;
+306D;HIRAGANA LETTER NE;Lo;0;L;;;;;N;;;;;
+306E;HIRAGANA LETTER NO;Lo;0;L;;;;;N;;;;;
+306F;HIRAGANA LETTER HA;Lo;0;L;;;;;N;;;;;
+3070;HIRAGANA LETTER BA;Lo;0;L;306F 3099;;;;N;;;;;
+3071;HIRAGANA LETTER PA;Lo;0;L;306F 309A;;;;N;;;;;
+3072;HIRAGANA LETTER HI;Lo;0;L;;;;;N;;;;;
+3073;HIRAGANA LETTER BI;Lo;0;L;3072 3099;;;;N;;;;;
+3074;HIRAGANA LETTER PI;Lo;0;L;3072 309A;;;;N;;;;;
+3075;HIRAGANA LETTER HU;Lo;0;L;;;;;N;;;;;
+3076;HIRAGANA LETTER BU;Lo;0;L;3075 3099;;;;N;;;;;
+3077;HIRAGANA LETTER PU;Lo;0;L;3075 309A;;;;N;;;;;
+3078;HIRAGANA LETTER HE;Lo;0;L;;;;;N;;;;;
+3079;HIRAGANA LETTER BE;Lo;0;L;3078 3099;;;;N;;;;;
+307A;HIRAGANA LETTER PE;Lo;0;L;3078 309A;;;;N;;;;;
+307B;HIRAGANA LETTER HO;Lo;0;L;;;;;N;;;;;
+307C;HIRAGANA LETTER BO;Lo;0;L;307B 3099;;;;N;;;;;
+307D;HIRAGANA LETTER PO;Lo;0;L;307B 309A;;;;N;;;;;
+307E;HIRAGANA LETTER MA;Lo;0;L;;;;;N;;;;;
+307F;HIRAGANA LETTER MI;Lo;0;L;;;;;N;;;;;
+3080;HIRAGANA LETTER MU;Lo;0;L;;;;;N;;;;;
+3081;HIRAGANA LETTER ME;Lo;0;L;;;;;N;;;;;
+3082;HIRAGANA LETTER MO;Lo;0;L;;;;;N;;;;;
+3083;HIRAGANA LETTER SMALL YA;Lo;0;L;;;;;N;;;;;
+3084;HIRAGANA LETTER YA;Lo;0;L;;;;;N;;;;;
+3085;HIRAGANA LETTER SMALL YU;Lo;0;L;;;;;N;;;;;
+3086;HIRAGANA LETTER YU;Lo;0;L;;;;;N;;;;;
+3087;HIRAGANA LETTER SMALL YO;Lo;0;L;;;;;N;;;;;
+3088;HIRAGANA LETTER YO;Lo;0;L;;;;;N;;;;;
+3089;HIRAGANA LETTER RA;Lo;0;L;;;;;N;;;;;
+308A;HIRAGANA LETTER RI;Lo;0;L;;;;;N;;;;;
+308B;HIRAGANA LETTER RU;Lo;0;L;;;;;N;;;;;
+308C;HIRAGANA LETTER RE;Lo;0;L;;;;;N;;;;;
+308D;HIRAGANA LETTER RO;Lo;0;L;;;;;N;;;;;
+308E;HIRAGANA LETTER SMALL WA;Lo;0;L;;;;;N;;;;;
+308F;HIRAGANA LETTER WA;Lo;0;L;;;;;N;;;;;
+3090;HIRAGANA LETTER WI;Lo;0;L;;;;;N;;;;;
+3091;HIRAGANA LETTER WE;Lo;0;L;;;;;N;;;;;
+3092;HIRAGANA LETTER WO;Lo;0;L;;;;;N;;;;;
+3093;HIRAGANA LETTER N;Lo;0;L;;;;;N;;;;;
+3094;HIRAGANA LETTER VU;Lo;0;L;3046 3099;;;;N;;;;;
+3095;HIRAGANA LETTER SMALL KA;Lo;0;L;;;;;N;;;;;
+3096;HIRAGANA LETTER SMALL KE;Lo;0;L;;;;;N;;;;;
+3099;COMBINING KATAKANA-HIRAGANA VOICED SOUND MARK;Mn;8;NSM;;;;;N;NON-SPACING KATAKANA-HIRAGANA VOICED SOUND MARK;;;;
+309A;COMBINING KATAKANA-HIRAGANA SEMI-VOICED SOUND MARK;Mn;8;NSM;;;;;N;NON-SPACING KATAKANA-HIRAGANA SEMI-VOICED SOUND MARK;;;;
+309B;KATAKANA-HIRAGANA VOICED SOUND MARK;Sk;0;ON;<compat> 0020 3099;;;;N;;;;;
+309C;KATAKANA-HIRAGANA SEMI-VOICED SOUND MARK;Sk;0;ON;<compat> 0020 309A;;;;N;;;;;
+309D;HIRAGANA ITERATION MARK;Lm;0;L;;;;;N;;;;;
+309E;HIRAGANA VOICED ITERATION MARK;Lm;0;L;309D 3099;;;;N;;;;;
+309F;HIRAGANA DIGRAPH YORI;Lo;0;L;<vertical> 3088 308A;;;;N;;;;;
+30A0;KATAKANA-HIRAGANA DOUBLE HYPHEN;Pd;0;ON;;;;;N;;;;;
+30A1;KATAKANA LETTER SMALL A;Lo;0;L;;;;;N;;;;;
+30A2;KATAKANA LETTER A;Lo;0;L;;;;;N;;;;;
+30A3;KATAKANA LETTER SMALL I;Lo;0;L;;;;;N;;;;;
+30A4;KATAKANA LETTER I;Lo;0;L;;;;;N;;;;;
+30A5;KATAKANA LETTER SMALL U;Lo;0;L;;;;;N;;;;;
+30A6;KATAKANA LETTER U;Lo;0;L;;;;;N;;;;;
+30A7;KATAKANA LETTER SMALL E;Lo;0;L;;;;;N;;;;;
+30A8;KATAKANA LETTER E;Lo;0;L;;;;;N;;;;;
+30A9;KATAKANA LETTER SMALL O;Lo;0;L;;;;;N;;;;;
+30AA;KATAKANA LETTER O;Lo;0;L;;;;;N;;;;;
+30AB;KATAKANA LETTER KA;Lo;0;L;;;;;N;;;;;
+30AC;KATAKANA LETTER GA;Lo;0;L;30AB 3099;;;;N;;;;;
+30AD;KATAKANA LETTER KI;Lo;0;L;;;;;N;;;;;
+30AE;KATAKANA LETTER GI;Lo;0;L;30AD 3099;;;;N;;;;;
+30AF;KATAKANA LETTER KU;Lo;0;L;;;;;N;;;;;
+30B0;KATAKANA LETTER GU;Lo;0;L;30AF 3099;;;;N;;;;;
+30B1;KATAKANA LETTER KE;Lo;0;L;;;;;N;;;;;
+30B2;KATAKANA LETTER GE;Lo;0;L;30B1 3099;;;;N;;;;;
+30B3;KATAKANA LETTER KO;Lo;0;L;;;;;N;;;;;
+30B4;KATAKANA LETTER GO;Lo;0;L;30B3 3099;;;;N;;;;;
+30B5;KATAKANA LETTER SA;Lo;0;L;;;;;N;;;;;
+30B6;KATAKANA LETTER ZA;Lo;0;L;30B5 3099;;;;N;;;;;
+30B7;KATAKANA LETTER SI;Lo;0;L;;;;;N;;;;;
+30B8;KATAKANA LETTER ZI;Lo;0;L;30B7 3099;;;;N;;;;;
+30B9;KATAKANA LETTER SU;Lo;0;L;;;;;N;;;;;
+30BA;KATAKANA LETTER ZU;Lo;0;L;30B9 3099;;;;N;;;;;
+30BB;KATAKANA LETTER SE;Lo;0;L;;;;;N;;;;;
+30BC;KATAKANA LETTER ZE;Lo;0;L;30BB 3099;;;;N;;;;;
+30BD;KATAKANA LETTER SO;Lo;0;L;;;;;N;;;;;
+30BE;KATAKANA LETTER ZO;Lo;0;L;30BD 3099;;;;N;;;;;
+30BF;KATAKANA LETTER TA;Lo;0;L;;;;;N;;;;;
+30C0;KATAKANA LETTER DA;Lo;0;L;30BF 3099;;;;N;;;;;
+30C1;KATAKANA LETTER TI;Lo;0;L;;;;;N;;;;;
+30C2;KATAKANA LETTER DI;Lo;0;L;30C1 3099;;;;N;;;;;
+30C3;KATAKANA LETTER SMALL TU;Lo;0;L;;;;;N;;;;;
+30C4;KATAKANA LETTER TU;Lo;0;L;;;;;N;;;;;
+30C5;KATAKANA LETTER DU;Lo;0;L;30C4 3099;;;;N;;;;;
+30C6;KATAKANA LETTER TE;Lo;0;L;;;;;N;;;;;
+30C7;KATAKANA LETTER DE;Lo;0;L;30C6 3099;;;;N;;;;;
+30C8;KATAKANA LETTER TO;Lo;0;L;;;;;N;;;;;
+30C9;KATAKANA LETTER DO;Lo;0;L;30C8 3099;;;;N;;;;;
+30CA;KATAKANA LETTER NA;Lo;0;L;;;;;N;;;;;
+30CB;KATAKANA LETTER NI;Lo;0;L;;;;;N;;;;;
+30CC;KATAKANA LETTER NU;Lo;0;L;;;;;N;;;;;
+30CD;KATAKANA LETTER NE;Lo;0;L;;;;;N;;;;;
+30CE;KATAKANA LETTER NO;Lo;0;L;;;;;N;;;;;
+30CF;KATAKANA LETTER HA;Lo;0;L;;;;;N;;;;;
+30D0;KATAKANA LETTER BA;Lo;0;L;30CF 3099;;;;N;;;;;
+30D1;KATAKANA LETTER PA;Lo;0;L;30CF 309A;;;;N;;;;;
+30D2;KATAKANA LETTER HI;Lo;0;L;;;;;N;;;;;
+30D3;KATAKANA LETTER BI;Lo;0;L;30D2 3099;;;;N;;;;;
+30D4;KATAKANA LETTER PI;Lo;0;L;30D2 309A;;;;N;;;;;
+30D5;KATAKANA LETTER HU;Lo;0;L;;;;;N;;;;;
+30D6;KATAKANA LETTER BU;Lo;0;L;30D5 3099;;;;N;;;;;
+30D7;KATAKANA LETTER PU;Lo;0;L;30D5 309A;;;;N;;;;;
+30D8;KATAKANA LETTER HE;Lo;0;L;;;;;N;;;;;
+30D9;KATAKANA LETTER BE;Lo;0;L;30D8 3099;;;;N;;;;;
+30DA;KATAKANA LETTER PE;Lo;0;L;30D8 309A;;;;N;;;;;
+30DB;KATAKANA LETTER HO;Lo;0;L;;;;;N;;;;;
+30DC;KATAKANA LETTER BO;Lo;0;L;30DB 3099;;;;N;;;;;
+30DD;KATAKANA LETTER PO;Lo;0;L;30DB 309A;;;;N;;;;;
+30DE;KATAKANA LETTER MA;Lo;0;L;;;;;N;;;;;
+30DF;KATAKANA LETTER MI;Lo;0;L;;;;;N;;;;;
+30E0;KATAKANA LETTER MU;Lo;0;L;;;;;N;;;;;
+30E1;KATAKANA LETTER ME;Lo;0;L;;;;;N;;;;;
+30E2;KATAKANA LETTER MO;Lo;0;L;;;;;N;;;;;
+30E3;KATAKANA LETTER SMALL YA;Lo;0;L;;;;;N;;;;;
+30E4;KATAKANA LETTER YA;Lo;0;L;;;;;N;;;;;
+30E5;KATAKANA LETTER SMALL YU;Lo;0;L;;;;;N;;;;;
+30E6;KATAKANA LETTER YU;Lo;0;L;;;;;N;;;;;
+30E7;KATAKANA LETTER SMALL YO;Lo;0;L;;;;;N;;;;;
+30E8;KATAKANA LETTER YO;Lo;0;L;;;;;N;;;;;
+30E9;KATAKANA LETTER RA;Lo;0;L;;;;;N;;;;;
+30EA;KATAKANA LETTER RI;Lo;0;L;;;;;N;;;;;
+30EB;KATAKANA LETTER RU;Lo;0;L;;;;;N;;;;;
+30EC;KATAKANA LETTER RE;Lo;0;L;;;;;N;;;;;
+30ED;KATAKANA LETTER RO;Lo;0;L;;;;;N;;;;;
+30EE;KATAKANA LETTER SMALL WA;Lo;0;L;;;;;N;;;;;
+30EF;KATAKANA LETTER WA;Lo;0;L;;;;;N;;;;;
+30F0;KATAKANA LETTER WI;Lo;0;L;;;;;N;;;;;
+30F1;KATAKANA LETTER WE;Lo;0;L;;;;;N;;;;;
+30F2;KATAKANA LETTER WO;Lo;0;L;;;;;N;;;;;
+30F3;KATAKANA LETTER N;Lo;0;L;;;;;N;;;;;
+30F4;KATAKANA LETTER VU;Lo;0;L;30A6 3099;;;;N;;;;;
+30F5;KATAKANA LETTER SMALL KA;Lo;0;L;;;;;N;;;;;
+30F6;KATAKANA LETTER SMALL KE;Lo;0;L;;;;;N;;;;;
+30F7;KATAKANA LETTER VA;Lo;0;L;30EF 3099;;;;N;;;;;
+30F8;KATAKANA LETTER VI;Lo;0;L;30F0 3099;;;;N;;;;;
+30F9;KATAKANA LETTER VE;Lo;0;L;30F1 3099;;;;N;;;;;
+30FA;KATAKANA LETTER VO;Lo;0;L;30F2 3099;;;;N;;;;;
+30FB;KATAKANA MIDDLE DOT;Po;0;ON;;;;;N;;;;;
+30FC;KATAKANA-HIRAGANA PROLONGED SOUND MARK;Lm;0;L;;;;;N;;;;;
+30FD;KATAKANA ITERATION MARK;Lm;0;L;;;;;N;;;;;
+30FE;KATAKANA VOICED ITERATION MARK;Lm;0;L;30FD 3099;;;;N;;;;;
+30FF;KATAKANA DIGRAPH KOTO;Lo;0;L;<vertical> 30B3 30C8;;;;N;;;;;
+3105;BOPOMOFO LETTER B;Lo;0;L;;;;;N;;;;;
+3106;BOPOMOFO LETTER P;Lo;0;L;;;;;N;;;;;
+3107;BOPOMOFO LETTER M;Lo;0;L;;;;;N;;;;;
+3108;BOPOMOFO LETTER F;Lo;0;L;;;;;N;;;;;
+3109;BOPOMOFO LETTER D;Lo;0;L;;;;;N;;;;;
+310A;BOPOMOFO LETTER T;Lo;0;L;;;;;N;;;;;
+310B;BOPOMOFO LETTER N;Lo;0;L;;;;;N;;;;;
+310C;BOPOMOFO LETTER L;Lo;0;L;;;;;N;;;;;
+310D;BOPOMOFO LETTER G;Lo;0;L;;;;;N;;;;;
+310E;BOPOMOFO LETTER K;Lo;0;L;;;;;N;;;;;
+310F;BOPOMOFO LETTER H;Lo;0;L;;;;;N;;;;;
+3110;BOPOMOFO LETTER J;Lo;0;L;;;;;N;;;;;
+3111;BOPOMOFO LETTER Q;Lo;0;L;;;;;N;;;;;
+3112;BOPOMOFO LETTER X;Lo;0;L;;;;;N;;;;;
+3113;BOPOMOFO LETTER ZH;Lo;0;L;;;;;N;;;;;
+3114;BOPOMOFO LETTER CH;Lo;0;L;;;;;N;;;;;
+3115;BOPOMOFO LETTER SH;Lo;0;L;;;;;N;;;;;
+3116;BOPOMOFO LETTER R;Lo;0;L;;;;;N;;;;;
+3117;BOPOMOFO LETTER Z;Lo;0;L;;;;;N;;;;;
+3118;BOPOMOFO LETTER C;Lo;0;L;;;;;N;;;;;
+3119;BOPOMOFO LETTER S;Lo;0;L;;;;;N;;;;;
+311A;BOPOMOFO LETTER A;Lo;0;L;;;;;N;;;;;
+311B;BOPOMOFO LETTER O;Lo;0;L;;;;;N;;;;;
+311C;BOPOMOFO LETTER E;Lo;0;L;;;;;N;;;;;
+311D;BOPOMOFO LETTER EH;Lo;0;L;;;;;N;;;;;
+311E;BOPOMOFO LETTER AI;Lo;0;L;;;;;N;;;;;
+311F;BOPOMOFO LETTER EI;Lo;0;L;;;;;N;;;;;
+3120;BOPOMOFO LETTER AU;Lo;0;L;;;;;N;;;;;
+3121;BOPOMOFO LETTER OU;Lo;0;L;;;;;N;;;;;
+3122;BOPOMOFO LETTER AN;Lo;0;L;;;;;N;;;;;
+3123;BOPOMOFO LETTER EN;Lo;0;L;;;;;N;;;;;
+3124;BOPOMOFO LETTER ANG;Lo;0;L;;;;;N;;;;;
+3125;BOPOMOFO LETTER ENG;Lo;0;L;;;;;N;;;;;
+3126;BOPOMOFO LETTER ER;Lo;0;L;;;;;N;;;;;
+3127;BOPOMOFO LETTER I;Lo;0;L;;;;;N;;;;;
+3128;BOPOMOFO LETTER U;Lo;0;L;;;;;N;;;;;
+3129;BOPOMOFO LETTER IU;Lo;0;L;;;;;N;;;;;
+312A;BOPOMOFO LETTER V;Lo;0;L;;;;;N;;;;;
+312B;BOPOMOFO LETTER NG;Lo;0;L;;;;;N;;;;;
+312C;BOPOMOFO LETTER GN;Lo;0;L;;;;;N;;;;;
+312D;BOPOMOFO LETTER IH;Lo;0;L;;;;;N;;;;;
+312E;BOPOMOFO LETTER O WITH DOT ABOVE;Lo;0;L;;;;;N;;;;;
+3131;HANGUL LETTER KIYEOK;Lo;0;L;<compat> 1100;;;;N;HANGUL LETTER GIYEOG;;;;
+3132;HANGUL LETTER SSANGKIYEOK;Lo;0;L;<compat> 1101;;;;N;HANGUL LETTER SSANG GIYEOG;;;;
+3133;HANGUL LETTER KIYEOK-SIOS;Lo;0;L;<compat> 11AA;;;;N;HANGUL LETTER GIYEOG SIOS;;;;
+3134;HANGUL LETTER NIEUN;Lo;0;L;<compat> 1102;;;;N;;;;;
+3135;HANGUL LETTER NIEUN-CIEUC;Lo;0;L;<compat> 11AC;;;;N;HANGUL LETTER NIEUN JIEUJ;;;;
+3136;HANGUL LETTER NIEUN-HIEUH;Lo;0;L;<compat> 11AD;;;;N;HANGUL LETTER NIEUN HIEUH;;;;
+3137;HANGUL LETTER TIKEUT;Lo;0;L;<compat> 1103;;;;N;HANGUL LETTER DIGEUD;;;;
+3138;HANGUL LETTER SSANGTIKEUT;Lo;0;L;<compat> 1104;;;;N;HANGUL LETTER SSANG DIGEUD;;;;
+3139;HANGUL LETTER RIEUL;Lo;0;L;<compat> 1105;;;;N;HANGUL LETTER LIEUL;;;;
+313A;HANGUL LETTER RIEUL-KIYEOK;Lo;0;L;<compat> 11B0;;;;N;HANGUL LETTER LIEUL GIYEOG;;;;
+313B;HANGUL LETTER RIEUL-MIEUM;Lo;0;L;<compat> 11B1;;;;N;HANGUL LETTER LIEUL MIEUM;;;;
+313C;HANGUL LETTER RIEUL-PIEUP;Lo;0;L;<compat> 11B2;;;;N;HANGUL LETTER LIEUL BIEUB;;;;
+313D;HANGUL LETTER RIEUL-SIOS;Lo;0;L;<compat> 11B3;;;;N;HANGUL LETTER LIEUL SIOS;;;;
+313E;HANGUL LETTER RIEUL-THIEUTH;Lo;0;L;<compat> 11B4;;;;N;HANGUL LETTER LIEUL TIEUT;;;;
+313F;HANGUL LETTER RIEUL-PHIEUPH;Lo;0;L;<compat> 11B5;;;;N;HANGUL LETTER LIEUL PIEUP;;;;
+3140;HANGUL LETTER RIEUL-HIEUH;Lo;0;L;<compat> 111A;;;;N;HANGUL LETTER LIEUL HIEUH;;;;
+3141;HANGUL LETTER MIEUM;Lo;0;L;<compat> 1106;;;;N;;;;;
+3142;HANGUL LETTER PIEUP;Lo;0;L;<compat> 1107;;;;N;HANGUL LETTER BIEUB;;;;
+3143;HANGUL LETTER SSANGPIEUP;Lo;0;L;<compat> 1108;;;;N;HANGUL LETTER SSANG BIEUB;;;;
+3144;HANGUL LETTER PIEUP-SIOS;Lo;0;L;<compat> 1121;;;;N;HANGUL LETTER BIEUB SIOS;;;;
+3145;HANGUL LETTER SIOS;Lo;0;L;<compat> 1109;;;;N;;;;;
+3146;HANGUL LETTER SSANGSIOS;Lo;0;L;<compat> 110A;;;;N;HANGUL LETTER SSANG SIOS;;;;
+3147;HANGUL LETTER IEUNG;Lo;0;L;<compat> 110B;;;;N;;;;;
+3148;HANGUL LETTER CIEUC;Lo;0;L;<compat> 110C;;;;N;HANGUL LETTER JIEUJ;;;;
+3149;HANGUL LETTER SSANGCIEUC;Lo;0;L;<compat> 110D;;;;N;HANGUL LETTER SSANG JIEUJ;;;;
+314A;HANGUL LETTER CHIEUCH;Lo;0;L;<compat> 110E;;;;N;HANGUL LETTER CIEUC;;;;
+314B;HANGUL LETTER KHIEUKH;Lo;0;L;<compat> 110F;;;;N;HANGUL LETTER KIYEOK;;;;
+314C;HANGUL LETTER THIEUTH;Lo;0;L;<compat> 1110;;;;N;HANGUL LETTER TIEUT;;;;
+314D;HANGUL LETTER PHIEUPH;Lo;0;L;<compat> 1111;;;;N;HANGUL LETTER PIEUP;;;;
+314E;HANGUL LETTER HIEUH;Lo;0;L;<compat> 1112;;;;N;;;;;
+314F;HANGUL LETTER A;Lo;0;L;<compat> 1161;;;;N;;;;;
+3150;HANGUL LETTER AE;Lo;0;L;<compat> 1162;;;;N;;;;;
+3151;HANGUL LETTER YA;Lo;0;L;<compat> 1163;;;;N;;;;;
+3152;HANGUL LETTER YAE;Lo;0;L;<compat> 1164;;;;N;;;;;
+3153;HANGUL LETTER EO;Lo;0;L;<compat> 1165;;;;N;;;;;
+3154;HANGUL LETTER E;Lo;0;L;<compat> 1166;;;;N;;;;;
+3155;HANGUL LETTER YEO;Lo;0;L;<compat> 1167;;;;N;;;;;
+3156;HANGUL LETTER YE;Lo;0;L;<compat> 1168;;;;N;;;;;
+3157;HANGUL LETTER O;Lo;0;L;<compat> 1169;;;;N;;;;;
+3158;HANGUL LETTER WA;Lo;0;L;<compat> 116A;;;;N;;;;;
+3159;HANGUL LETTER WAE;Lo;0;L;<compat> 116B;;;;N;;;;;
+315A;HANGUL LETTER OE;Lo;0;L;<compat> 116C;;;;N;;;;;
+315B;HANGUL LETTER YO;Lo;0;L;<compat> 116D;;;;N;;;;;
+315C;HANGUL LETTER U;Lo;0;L;<compat> 116E;;;;N;;;;;
+315D;HANGUL LETTER WEO;Lo;0;L;<compat> 116F;;;;N;;;;;
+315E;HANGUL LETTER WE;Lo;0;L;<compat> 1170;;;;N;;;;;
+315F;HANGUL LETTER WI;Lo;0;L;<compat> 1171;;;;N;;;;;
+3160;HANGUL LETTER YU;Lo;0;L;<compat> 1172;;;;N;;;;;
+3161;HANGUL LETTER EU;Lo;0;L;<compat> 1173;;;;N;;;;;
+3162;HANGUL LETTER YI;Lo;0;L;<compat> 1174;;;;N;;;;;
+3163;HANGUL LETTER I;Lo;0;L;<compat> 1175;;;;N;;;;;
+3164;HANGUL FILLER;Lo;0;L;<compat> 1160;;;;N;HANGUL CAE OM;;;;
+3165;HANGUL LETTER SSANGNIEUN;Lo;0;L;<compat> 1114;;;;N;HANGUL LETTER SSANG NIEUN;;;;
+3166;HANGUL LETTER NIEUN-TIKEUT;Lo;0;L;<compat> 1115;;;;N;HANGUL LETTER NIEUN DIGEUD;;;;
+3167;HANGUL LETTER NIEUN-SIOS;Lo;0;L;<compat> 11C7;;;;N;HANGUL LETTER NIEUN SIOS;;;;
+3168;HANGUL LETTER NIEUN-PANSIOS;Lo;0;L;<compat> 11C8;;;;N;HANGUL LETTER NIEUN BAN CHI EUM;;;;
+3169;HANGUL LETTER RIEUL-KIYEOK-SIOS;Lo;0;L;<compat> 11CC;;;;N;HANGUL LETTER LIEUL GIYEOG SIOS;;;;
+316A;HANGUL LETTER RIEUL-TIKEUT;Lo;0;L;<compat> 11CE;;;;N;HANGUL LETTER LIEUL DIGEUD;;;;
+316B;HANGUL LETTER RIEUL-PIEUP-SIOS;Lo;0;L;<compat> 11D3;;;;N;HANGUL LETTER LIEUL BIEUB SIOS;;;;
+316C;HANGUL LETTER RIEUL-PANSIOS;Lo;0;L;<compat> 11D7;;;;N;HANGUL LETTER LIEUL BAN CHI EUM;;;;
+316D;HANGUL LETTER RIEUL-YEORINHIEUH;Lo;0;L;<compat> 11D9;;;;N;HANGUL LETTER LIEUL YEOLIN HIEUH;;;;
+316E;HANGUL LETTER MIEUM-PIEUP;Lo;0;L;<compat> 111C;;;;N;HANGUL LETTER MIEUM BIEUB;;;;
+316F;HANGUL LETTER MIEUM-SIOS;Lo;0;L;<compat> 11DD;;;;N;HANGUL LETTER MIEUM SIOS;;;;
+3170;HANGUL LETTER MIEUM-PANSIOS;Lo;0;L;<compat> 11DF;;;;N;HANGUL LETTER BIEUB BAN CHI EUM;;;;
+3171;HANGUL LETTER KAPYEOUNMIEUM;Lo;0;L;<compat> 111D;;;;N;HANGUL LETTER MIEUM SUN GYEONG EUM;;;;
+3172;HANGUL LETTER PIEUP-KIYEOK;Lo;0;L;<compat> 111E;;;;N;HANGUL LETTER BIEUB GIYEOG;;;;
+3173;HANGUL LETTER PIEUP-TIKEUT;Lo;0;L;<compat> 1120;;;;N;HANGUL LETTER BIEUB DIGEUD;;;;
+3174;HANGUL LETTER PIEUP-SIOS-KIYEOK;Lo;0;L;<compat> 1122;;;;N;HANGUL LETTER BIEUB SIOS GIYEOG;;;;
+3175;HANGUL LETTER PIEUP-SIOS-TIKEUT;Lo;0;L;<compat> 1123;;;;N;HANGUL LETTER BIEUB SIOS DIGEUD;;;;
+3176;HANGUL LETTER PIEUP-CIEUC;Lo;0;L;<compat> 1127;;;;N;HANGUL LETTER BIEUB JIEUJ;;;;
+3177;HANGUL LETTER PIEUP-THIEUTH;Lo;0;L;<compat> 1129;;;;N;HANGUL LETTER BIEUB TIEUT;;;;
+3178;HANGUL LETTER KAPYEOUNPIEUP;Lo;0;L;<compat> 112B;;;;N;HANGUL LETTER BIEUB SUN GYEONG EUM;;;;
+3179;HANGUL LETTER KAPYEOUNSSANGPIEUP;Lo;0;L;<compat> 112C;;;;N;HANGUL LETTER SSANG BIEUB SUN GYEONG EUM;;;;
+317A;HANGUL LETTER SIOS-KIYEOK;Lo;0;L;<compat> 112D;;;;N;HANGUL LETTER SIOS GIYEOG;;;;
+317B;HANGUL LETTER SIOS-NIEUN;Lo;0;L;<compat> 112E;;;;N;HANGUL LETTER SIOS NIEUN;;;;
+317C;HANGUL LETTER SIOS-TIKEUT;Lo;0;L;<compat> 112F;;;;N;HANGUL LETTER SIOS DIGEUD;;;;
+317D;HANGUL LETTER SIOS-PIEUP;Lo;0;L;<compat> 1132;;;;N;HANGUL LETTER SIOS BIEUB;;;;
+317E;HANGUL LETTER SIOS-CIEUC;Lo;0;L;<compat> 1136;;;;N;HANGUL LETTER SIOS JIEUJ;;;;
+317F;HANGUL LETTER PANSIOS;Lo;0;L;<compat> 1140;;;;N;HANGUL LETTER BAN CHI EUM;;;;
+3180;HANGUL LETTER SSANGIEUNG;Lo;0;L;<compat> 1147;;;;N;HANGUL LETTER SSANG IEUNG;;;;
+3181;HANGUL LETTER YESIEUNG;Lo;0;L;<compat> 114C;;;;N;HANGUL LETTER NGIEUNG;;;;
+3182;HANGUL LETTER YESIEUNG-SIOS;Lo;0;L;<compat> 11F1;;;;N;HANGUL LETTER NGIEUNG SIOS;;;;
+3183;HANGUL LETTER YESIEUNG-PANSIOS;Lo;0;L;<compat> 11F2;;;;N;HANGUL LETTER NGIEUNG BAN CHI EUM;;;;
+3184;HANGUL LETTER KAPYEOUNPHIEUPH;Lo;0;L;<compat> 1157;;;;N;HANGUL LETTER PIEUP SUN GYEONG EUM;;;;
+3185;HANGUL LETTER SSANGHIEUH;Lo;0;L;<compat> 1158;;;;N;HANGUL LETTER SSANG HIEUH;;;;
+3186;HANGUL LETTER YEORINHIEUH;Lo;0;L;<compat> 1159;;;;N;HANGUL LETTER YEOLIN HIEUH;;;;
+3187;HANGUL LETTER YO-YA;Lo;0;L;<compat> 1184;;;;N;HANGUL LETTER YOYA;;;;
+3188;HANGUL LETTER YO-YAE;Lo;0;L;<compat> 1185;;;;N;HANGUL LETTER YOYAE;;;;
+3189;HANGUL LETTER YO-I;Lo;0;L;<compat> 1188;;;;N;HANGUL LETTER YOI;;;;
+318A;HANGUL LETTER YU-YEO;Lo;0;L;<compat> 1191;;;;N;HANGUL LETTER YUYEO;;;;
+318B;HANGUL LETTER YU-YE;Lo;0;L;<compat> 1192;;;;N;HANGUL LETTER YUYE;;;;
+318C;HANGUL LETTER YU-I;Lo;0;L;<compat> 1194;;;;N;HANGUL LETTER YUI;;;;
+318D;HANGUL LETTER ARAEA;Lo;0;L;<compat> 119E;;;;N;HANGUL LETTER ALAE A;;;;
+318E;HANGUL LETTER ARAEAE;Lo;0;L;<compat> 11A1;;;;N;HANGUL LETTER ALAE AE;;;;
+3190;IDEOGRAPHIC ANNOTATION LINKING MARK;So;0;L;;;;;N;KANBUN TATETEN;;;;
+3191;IDEOGRAPHIC ANNOTATION REVERSE MARK;So;0;L;;;;;N;KAERITEN RE;;;;
+3192;IDEOGRAPHIC ANNOTATION ONE MARK;No;0;L;<super> 4E00;;;1;N;KAERITEN ITI;;;;
+3193;IDEOGRAPHIC ANNOTATION TWO MARK;No;0;L;<super> 4E8C;;;2;N;KAERITEN NI;;;;
+3194;IDEOGRAPHIC ANNOTATION THREE MARK;No;0;L;<super> 4E09;;;3;N;KAERITEN SAN;;;;
+3195;IDEOGRAPHIC ANNOTATION FOUR MARK;No;0;L;<super> 56DB;;;4;N;KAERITEN SI;;;;
+3196;IDEOGRAPHIC ANNOTATION TOP MARK;So;0;L;<super> 4E0A;;;;N;KAERITEN ZYOU;;;;
+3197;IDEOGRAPHIC ANNOTATION MIDDLE MARK;So;0;L;<super> 4E2D;;;;N;KAERITEN TYUU;;;;
+3198;IDEOGRAPHIC ANNOTATION BOTTOM MARK;So;0;L;<super> 4E0B;;;;N;KAERITEN GE;;;;
+3199;IDEOGRAPHIC ANNOTATION FIRST MARK;So;0;L;<super> 7532;;;;N;KAERITEN KOU;;;;
+319A;IDEOGRAPHIC ANNOTATION SECOND MARK;So;0;L;<super> 4E59;;;;N;KAERITEN OTU;;;;
+319B;IDEOGRAPHIC ANNOTATION THIRD MARK;So;0;L;<super> 4E19;;;;N;KAERITEN HEI;;;;
+319C;IDEOGRAPHIC ANNOTATION FOURTH MARK;So;0;L;<super> 4E01;;;;N;KAERITEN TEI;;;;
+319D;IDEOGRAPHIC ANNOTATION HEAVEN MARK;So;0;L;<super> 5929;;;;N;KAERITEN TEN;;;;
+319E;IDEOGRAPHIC ANNOTATION EARTH MARK;So;0;L;<super> 5730;;;;N;KAERITEN TI;;;;
+319F;IDEOGRAPHIC ANNOTATION MAN MARK;So;0;L;<super> 4EBA;;;;N;KAERITEN ZIN;;;;
+31A0;BOPOMOFO LETTER BU;Lo;0;L;;;;;N;;;;;
+31A1;BOPOMOFO LETTER ZI;Lo;0;L;;;;;N;;;;;
+31A2;BOPOMOFO LETTER JI;Lo;0;L;;;;;N;;;;;
+31A3;BOPOMOFO LETTER GU;Lo;0;L;;;;;N;;;;;
+31A4;BOPOMOFO LETTER EE;Lo;0;L;;;;;N;;;;;
+31A5;BOPOMOFO LETTER ENN;Lo;0;L;;;;;N;;;;;
+31A6;BOPOMOFO LETTER OO;Lo;0;L;;;;;N;;;;;
+31A7;BOPOMOFO LETTER ONN;Lo;0;L;;;;;N;;;;;
+31A8;BOPOMOFO LETTER IR;Lo;0;L;;;;;N;;;;;
+31A9;BOPOMOFO LETTER ANN;Lo;0;L;;;;;N;;;;;
+31AA;BOPOMOFO LETTER INN;Lo;0;L;;;;;N;;;;;
+31AB;BOPOMOFO LETTER UNN;Lo;0;L;;;;;N;;;;;
+31AC;BOPOMOFO LETTER IM;Lo;0;L;;;;;N;;;;;
+31AD;BOPOMOFO LETTER NGG;Lo;0;L;;;;;N;;;;;
+31AE;BOPOMOFO LETTER AINN;Lo;0;L;;;;;N;;;;;
+31AF;BOPOMOFO LETTER AUNN;Lo;0;L;;;;;N;;;;;
+31B0;BOPOMOFO LETTER AM;Lo;0;L;;;;;N;;;;;
+31B1;BOPOMOFO LETTER OM;Lo;0;L;;;;;N;;;;;
+31B2;BOPOMOFO LETTER ONG;Lo;0;L;;;;;N;;;;;
+31B3;BOPOMOFO LETTER INNN;Lo;0;L;;;;;N;;;;;
+31B4;BOPOMOFO FINAL LETTER P;Lo;0;L;;;;;N;;;;;
+31B5;BOPOMOFO FINAL LETTER T;Lo;0;L;;;;;N;;;;;
+31B6;BOPOMOFO FINAL LETTER K;Lo;0;L;;;;;N;;;;;
+31B7;BOPOMOFO FINAL LETTER H;Lo;0;L;;;;;N;;;;;
+31B8;BOPOMOFO LETTER GH;Lo;0;L;;;;;N;;;;;
+31B9;BOPOMOFO LETTER LH;Lo;0;L;;;;;N;;;;;
+31BA;BOPOMOFO LETTER ZY;Lo;0;L;;;;;N;;;;;
+31C0;CJK STROKE T;So;0;ON;;;;;N;;;;;
+31C1;CJK STROKE WG;So;0;ON;;;;;N;;;;;
+31C2;CJK STROKE XG;So;0;ON;;;;;N;;;;;
+31C3;CJK STROKE BXG;So;0;ON;;;;;N;;;;;
+31C4;CJK STROKE SW;So;0;ON;;;;;N;;;;;
+31C5;CJK STROKE HZZ;So;0;ON;;;;;N;;;;;
+31C6;CJK STROKE HZG;So;0;ON;;;;;N;;;;;
+31C7;CJK STROKE HP;So;0;ON;;;;;N;;;;;
+31C8;CJK STROKE HZWG;So;0;ON;;;;;N;;;;;
+31C9;CJK STROKE SZWG;So;0;ON;;;;;N;;;;;
+31CA;CJK STROKE HZT;So;0;ON;;;;;N;;;;;
+31CB;CJK STROKE HZZP;So;0;ON;;;;;N;;;;;
+31CC;CJK STROKE HPWG;So;0;ON;;;;;N;;;;;
+31CD;CJK STROKE HZW;So;0;ON;;;;;N;;;;;
+31CE;CJK STROKE HZZZ;So;0;ON;;;;;N;;;;;
+31CF;CJK STROKE N;So;0;ON;;;;;N;;;;;
+31D0;CJK STROKE H;So;0;ON;;;;;N;;;;;
+31D1;CJK STROKE S;So;0;ON;;;;;N;;;;;
+31D2;CJK STROKE P;So;0;ON;;;;;N;;;;;
+31D3;CJK STROKE SP;So;0;ON;;;;;N;;;;;
+31D4;CJK STROKE D;So;0;ON;;;;;N;;;;;
+31D5;CJK STROKE HZ;So;0;ON;;;;;N;;;;;
+31D6;CJK STROKE HG;So;0;ON;;;;;N;;;;;
+31D7;CJK STROKE SZ;So;0;ON;;;;;N;;;;;
+31D8;CJK STROKE SWZ;So;0;ON;;;;;N;;;;;
+31D9;CJK STROKE ST;So;0;ON;;;;;N;;;;;
+31DA;CJK STROKE SG;So;0;ON;;;;;N;;;;;
+31DB;CJK STROKE PD;So;0;ON;;;;;N;;;;;
+31DC;CJK STROKE PZ;So;0;ON;;;;;N;;;;;
+31DD;CJK STROKE TN;So;0;ON;;;;;N;;;;;
+31DE;CJK STROKE SZZ;So;0;ON;;;;;N;;;;;
+31DF;CJK STROKE SWG;So;0;ON;;;;;N;;;;;
+31E0;CJK STROKE HXWG;So;0;ON;;;;;N;;;;;
+31E1;CJK STROKE HZZZG;So;0;ON;;;;;N;;;;;
+31E2;CJK STROKE PG;So;0;ON;;;;;N;;;;;
+31E3;CJK STROKE Q;So;0;ON;;;;;N;;;;;
+31F0;KATAKANA LETTER SMALL KU;Lo;0;L;;;;;N;;;;;
+31F1;KATAKANA LETTER SMALL SI;Lo;0;L;;;;;N;;;;;
+31F2;KATAKANA LETTER SMALL SU;Lo;0;L;;;;;N;;;;;
+31F3;KATAKANA LETTER SMALL TO;Lo;0;L;;;;;N;;;;;
+31F4;KATAKANA LETTER SMALL NU;Lo;0;L;;;;;N;;;;;
+31F5;KATAKANA LETTER SMALL HA;Lo;0;L;;;;;N;;;;;
+31F6;KATAKANA LETTER SMALL HI;Lo;0;L;;;;;N;;;;;
+31F7;KATAKANA LETTER SMALL HU;Lo;0;L;;;;;N;;;;;
+31F8;KATAKANA LETTER SMALL HE;Lo;0;L;;;;;N;;;;;
+31F9;KATAKANA LETTER SMALL HO;Lo;0;L;;;;;N;;;;;
+31FA;KATAKANA LETTER SMALL MU;Lo;0;L;;;;;N;;;;;
+31FB;KATAKANA LETTER SMALL RA;Lo;0;L;;;;;N;;;;;
+31FC;KATAKANA LETTER SMALL RI;Lo;0;L;;;;;N;;;;;
+31FD;KATAKANA LETTER SMALL RU;Lo;0;L;;;;;N;;;;;
+31FE;KATAKANA LETTER SMALL RE;Lo;0;L;;;;;N;;;;;
+31FF;KATAKANA LETTER SMALL RO;Lo;0;L;;;;;N;;;;;
+3200;PARENTHESIZED HANGUL KIYEOK;So;0;L;<compat> 0028 1100 0029;;;;N;PARENTHESIZED HANGUL GIYEOG;;;;
+3201;PARENTHESIZED HANGUL NIEUN;So;0;L;<compat> 0028 1102 0029;;;;N;;;;;
+3202;PARENTHESIZED HANGUL TIKEUT;So;0;L;<compat> 0028 1103 0029;;;;N;PARENTHESIZED HANGUL DIGEUD;;;;
+3203;PARENTHESIZED HANGUL RIEUL;So;0;L;<compat> 0028 1105 0029;;;;N;PARENTHESIZED HANGUL LIEUL;;;;
+3204;PARENTHESIZED HANGUL MIEUM;So;0;L;<compat> 0028 1106 0029;;;;N;;;;;
+3205;PARENTHESIZED HANGUL PIEUP;So;0;L;<compat> 0028 1107 0029;;;;N;PARENTHESIZED HANGUL BIEUB;;;;
+3206;PARENTHESIZED HANGUL SIOS;So;0;L;<compat> 0028 1109 0029;;;;N;;;;;
+3207;PARENTHESIZED HANGUL IEUNG;So;0;L;<compat> 0028 110B 0029;;;;N;;;;;
+3208;PARENTHESIZED HANGUL CIEUC;So;0;L;<compat> 0028 110C 0029;;;;N;PARENTHESIZED HANGUL JIEUJ;;;;
+3209;PARENTHESIZED HANGUL CHIEUCH;So;0;L;<compat> 0028 110E 0029;;;;N;PARENTHESIZED HANGUL CIEUC;;;;
+320A;PARENTHESIZED HANGUL KHIEUKH;So;0;L;<compat> 0028 110F 0029;;;;N;PARENTHESIZED HANGUL KIYEOK;;;;
+320B;PARENTHESIZED HANGUL THIEUTH;So;0;L;<compat> 0028 1110 0029;;;;N;PARENTHESIZED HANGUL TIEUT;;;;
+320C;PARENTHESIZED HANGUL PHIEUPH;So;0;L;<compat> 0028 1111 0029;;;;N;PARENTHESIZED HANGUL PIEUP;;;;
+320D;PARENTHESIZED HANGUL HIEUH;So;0;L;<compat> 0028 1112 0029;;;;N;;;;;
+320E;PARENTHESIZED HANGUL KIYEOK A;So;0;L;<compat> 0028 1100 1161 0029;;;;N;PARENTHESIZED HANGUL GA;;;;
+320F;PARENTHESIZED HANGUL NIEUN A;So;0;L;<compat> 0028 1102 1161 0029;;;;N;PARENTHESIZED HANGUL NA;;;;
+3210;PARENTHESIZED HANGUL TIKEUT A;So;0;L;<compat> 0028 1103 1161 0029;;;;N;PARENTHESIZED HANGUL DA;;;;
+3211;PARENTHESIZED HANGUL RIEUL A;So;0;L;<compat> 0028 1105 1161 0029;;;;N;PARENTHESIZED HANGUL LA;;;;
+3212;PARENTHESIZED HANGUL MIEUM A;So;0;L;<compat> 0028 1106 1161 0029;;;;N;PARENTHESIZED HANGUL MA;;;;
+3213;PARENTHESIZED HANGUL PIEUP A;So;0;L;<compat> 0028 1107 1161 0029;;;;N;PARENTHESIZED HANGUL BA;;;;
+3214;PARENTHESIZED HANGUL SIOS A;So;0;L;<compat> 0028 1109 1161 0029;;;;N;PARENTHESIZED HANGUL SA;;;;
+3215;PARENTHESIZED HANGUL IEUNG A;So;0;L;<compat> 0028 110B 1161 0029;;;;N;PARENTHESIZED HANGUL A;;;;
+3216;PARENTHESIZED HANGUL CIEUC A;So;0;L;<compat> 0028 110C 1161 0029;;;;N;PARENTHESIZED HANGUL JA;;;;
+3217;PARENTHESIZED HANGUL CHIEUCH A;So;0;L;<compat> 0028 110E 1161 0029;;;;N;PARENTHESIZED HANGUL CA;;;;
+3218;PARENTHESIZED HANGUL KHIEUKH A;So;0;L;<compat> 0028 110F 1161 0029;;;;N;PARENTHESIZED HANGUL KA;;;;
+3219;PARENTHESIZED HANGUL THIEUTH A;So;0;L;<compat> 0028 1110 1161 0029;;;;N;PARENTHESIZED HANGUL TA;;;;
+321A;PARENTHESIZED HANGUL PHIEUPH A;So;0;L;<compat> 0028 1111 1161 0029;;;;N;PARENTHESIZED HANGUL PA;;;;
+321B;PARENTHESIZED HANGUL HIEUH A;So;0;L;<compat> 0028 1112 1161 0029;;;;N;PARENTHESIZED HANGUL HA;;;;
+321C;PARENTHESIZED HANGUL CIEUC U;So;0;L;<compat> 0028 110C 116E 0029;;;;N;PARENTHESIZED HANGUL JU;;;;
+321D;PARENTHESIZED KOREAN CHARACTER OJEON;So;0;ON;<compat> 0028 110B 1169 110C 1165 11AB 0029;;;;N;;;;;
+321E;PARENTHESIZED KOREAN CHARACTER O HU;So;0;ON;<compat> 0028 110B 1169 1112 116E 0029;;;;N;;;;;
+3220;PARENTHESIZED IDEOGRAPH ONE;No;0;L;<compat> 0028 4E00 0029;;;1;N;;;;;
+3221;PARENTHESIZED IDEOGRAPH TWO;No;0;L;<compat> 0028 4E8C 0029;;;2;N;;;;;
+3222;PARENTHESIZED IDEOGRAPH THREE;No;0;L;<compat> 0028 4E09 0029;;;3;N;;;;;
+3223;PARENTHESIZED IDEOGRAPH FOUR;No;0;L;<compat> 0028 56DB 0029;;;4;N;;;;;
+3224;PARENTHESIZED IDEOGRAPH FIVE;No;0;L;<compat> 0028 4E94 0029;;;5;N;;;;;
+3225;PARENTHESIZED IDEOGRAPH SIX;No;0;L;<compat> 0028 516D 0029;;;6;N;;;;;
+3226;PARENTHESIZED IDEOGRAPH SEVEN;No;0;L;<compat> 0028 4E03 0029;;;7;N;;;;;
+3227;PARENTHESIZED IDEOGRAPH EIGHT;No;0;L;<compat> 0028 516B 0029;;;8;N;;;;;
+3228;PARENTHESIZED IDEOGRAPH NINE;No;0;L;<compat> 0028 4E5D 0029;;;9;N;;;;;
+3229;PARENTHESIZED IDEOGRAPH TEN;No;0;L;<compat> 0028 5341 0029;;;10;N;;;;;
+322A;PARENTHESIZED IDEOGRAPH MOON;So;0;L;<compat> 0028 6708 0029;;;;N;;;;;
+322B;PARENTHESIZED IDEOGRAPH FIRE;So;0;L;<compat> 0028 706B 0029;;;;N;;;;;
+322C;PARENTHESIZED IDEOGRAPH WATER;So;0;L;<compat> 0028 6C34 0029;;;;N;;;;;
+322D;PARENTHESIZED IDEOGRAPH WOOD;So;0;L;<compat> 0028 6728 0029;;;;N;;;;;
+322E;PARENTHESIZED IDEOGRAPH METAL;So;0;L;<compat> 0028 91D1 0029;;;;N;;;;;
+322F;PARENTHESIZED IDEOGRAPH EARTH;So;0;L;<compat> 0028 571F 0029;;;;N;;;;;
+3230;PARENTHESIZED IDEOGRAPH SUN;So;0;L;<compat> 0028 65E5 0029;;;;N;;;;;
+3231;PARENTHESIZED IDEOGRAPH STOCK;So;0;L;<compat> 0028 682A 0029;;;;N;;;;;
+3232;PARENTHESIZED IDEOGRAPH HAVE;So;0;L;<compat> 0028 6709 0029;;;;N;;;;;
+3233;PARENTHESIZED IDEOGRAPH SOCIETY;So;0;L;<compat> 0028 793E 0029;;;;N;;;;;
+3234;PARENTHESIZED IDEOGRAPH NAME;So;0;L;<compat> 0028 540D 0029;;;;N;;;;;
+3235;PARENTHESIZED IDEOGRAPH SPECIAL;So;0;L;<compat> 0028 7279 0029;;;;N;;;;;
+3236;PARENTHESIZED IDEOGRAPH FINANCIAL;So;0;L;<compat> 0028 8CA1 0029;;;;N;;;;;
+3237;PARENTHESIZED IDEOGRAPH CONGRATULATION;So;0;L;<compat> 0028 795D 0029;;;;N;;;;;
+3238;PARENTHESIZED IDEOGRAPH LABOR;So;0;L;<compat> 0028 52B4 0029;;;;N;;;;;
+3239;PARENTHESIZED IDEOGRAPH REPRESENT;So;0;L;<compat> 0028 4EE3 0029;;;;N;;;;;
+323A;PARENTHESIZED IDEOGRAPH CALL;So;0;L;<compat> 0028 547C 0029;;;;N;;;;;
+323B;PARENTHESIZED IDEOGRAPH STUDY;So;0;L;<compat> 0028 5B66 0029;;;;N;;;;;
+323C;PARENTHESIZED IDEOGRAPH SUPERVISE;So;0;L;<compat> 0028 76E3 0029;;;;N;;;;;
+323D;PARENTHESIZED IDEOGRAPH ENTERPRISE;So;0;L;<compat> 0028 4F01 0029;;;;N;;;;;
+323E;PARENTHESIZED IDEOGRAPH RESOURCE;So;0;L;<compat> 0028 8CC7 0029;;;;N;;;;;
+323F;PARENTHESIZED IDEOGRAPH ALLIANCE;So;0;L;<compat> 0028 5354 0029;;;;N;;;;;
+3240;PARENTHESIZED IDEOGRAPH FESTIVAL;So;0;L;<compat> 0028 796D 0029;;;;N;;;;;
+3241;PARENTHESIZED IDEOGRAPH REST;So;0;L;<compat> 0028 4F11 0029;;;;N;;;;;
+3242;PARENTHESIZED IDEOGRAPH SELF;So;0;L;<compat> 0028 81EA 0029;;;;N;;;;;
+3243;PARENTHESIZED IDEOGRAPH REACH;So;0;L;<compat> 0028 81F3 0029;;;;N;;;;;
+3244;CIRCLED IDEOGRAPH QUESTION;So;0;L;<circle> 554F;;;;N;;;;;
+3245;CIRCLED IDEOGRAPH KINDERGARTEN;So;0;L;<circle> 5E7C;;;;N;;;;;
+3246;CIRCLED IDEOGRAPH SCHOOL;So;0;L;<circle> 6587;;;;N;;;;;
+3247;CIRCLED IDEOGRAPH KOTO;So;0;L;<circle> 7B8F;;;;N;;;;;
+3248;CIRCLED NUMBER TEN ON BLACK SQUARE;No;0;L;;;;10;N;;;;;
+3249;CIRCLED NUMBER TWENTY ON BLACK SQUARE;No;0;L;;;;20;N;;;;;
+324A;CIRCLED NUMBER THIRTY ON BLACK SQUARE;No;0;L;;;;30;N;;;;;
+324B;CIRCLED NUMBER FORTY ON BLACK SQUARE;No;0;L;;;;40;N;;;;;
+324C;CIRCLED NUMBER FIFTY ON BLACK SQUARE;No;0;L;;;;50;N;;;;;
+324D;CIRCLED NUMBER SIXTY ON BLACK SQUARE;No;0;L;;;;60;N;;;;;
+324E;CIRCLED NUMBER SEVENTY ON BLACK SQUARE;No;0;L;;;;70;N;;;;;
+324F;CIRCLED NUMBER EIGHTY ON BLACK SQUARE;No;0;L;;;;80;N;;;;;
+3250;PARTNERSHIP SIGN;So;0;ON;<square> 0050 0054 0045;;;;N;;;;;
+3251;CIRCLED NUMBER TWENTY ONE;No;0;ON;<circle> 0032 0031;;;21;N;;;;;
+3252;CIRCLED NUMBER TWENTY TWO;No;0;ON;<circle> 0032 0032;;;22;N;;;;;
+3253;CIRCLED NUMBER TWENTY THREE;No;0;ON;<circle> 0032 0033;;;23;N;;;;;
+3254;CIRCLED NUMBER TWENTY FOUR;No;0;ON;<circle> 0032 0034;;;24;N;;;;;
+3255;CIRCLED NUMBER TWENTY FIVE;No;0;ON;<circle> 0032 0035;;;25;N;;;;;
+3256;CIRCLED NUMBER TWENTY SIX;No;0;ON;<circle> 0032 0036;;;26;N;;;;;
+3257;CIRCLED NUMBER TWENTY SEVEN;No;0;ON;<circle> 0032 0037;;;27;N;;;;;
+3258;CIRCLED NUMBER TWENTY EIGHT;No;0;ON;<circle> 0032 0038;;;28;N;;;;;
+3259;CIRCLED NUMBER TWENTY NINE;No;0;ON;<circle> 0032 0039;;;29;N;;;;;
+325A;CIRCLED NUMBER THIRTY;No;0;ON;<circle> 0033 0030;;;30;N;;;;;
+325B;CIRCLED NUMBER THIRTY ONE;No;0;ON;<circle> 0033 0031;;;31;N;;;;;
+325C;CIRCLED NUMBER THIRTY TWO;No;0;ON;<circle> 0033 0032;;;32;N;;;;;
+325D;CIRCLED NUMBER THIRTY THREE;No;0;ON;<circle> 0033 0033;;;33;N;;;;;
+325E;CIRCLED NUMBER THIRTY FOUR;No;0;ON;<circle> 0033 0034;;;34;N;;;;;
+325F;CIRCLED NUMBER THIRTY FIVE;No;0;ON;<circle> 0033 0035;;;35;N;;;;;
+3260;CIRCLED HANGUL KIYEOK;So;0;L;<circle> 1100;;;;N;CIRCLED HANGUL GIYEOG;;;;
+3261;CIRCLED HANGUL NIEUN;So;0;L;<circle> 1102;;;;N;;;;;
+3262;CIRCLED HANGUL TIKEUT;So;0;L;<circle> 1103;;;;N;CIRCLED HANGUL DIGEUD;;;;
+3263;CIRCLED HANGUL RIEUL;So;0;L;<circle> 1105;;;;N;CIRCLED HANGUL LIEUL;;;;
+3264;CIRCLED HANGUL MIEUM;So;0;L;<circle> 1106;;;;N;;;;;
+3265;CIRCLED HANGUL PIEUP;So;0;L;<circle> 1107;;;;N;CIRCLED HANGUL BIEUB;;;;
+3266;CIRCLED HANGUL SIOS;So;0;L;<circle> 1109;;;;N;;;;;
+3267;CIRCLED HANGUL IEUNG;So;0;L;<circle> 110B;;;;N;;;;;
+3268;CIRCLED HANGUL CIEUC;So;0;L;<circle> 110C;;;;N;CIRCLED HANGUL JIEUJ;;;;
+3269;CIRCLED HANGUL CHIEUCH;So;0;L;<circle> 110E;;;;N;CIRCLED HANGUL CIEUC;;;;
+326A;CIRCLED HANGUL KHIEUKH;So;0;L;<circle> 110F;;;;N;CIRCLED HANGUL KIYEOK;;;;
+326B;CIRCLED HANGUL THIEUTH;So;0;L;<circle> 1110;;;;N;CIRCLED HANGUL TIEUT;;;;
+326C;CIRCLED HANGUL PHIEUPH;So;0;L;<circle> 1111;;;;N;CIRCLED HANGUL PIEUP;;;;
+326D;CIRCLED HANGUL HIEUH;So;0;L;<circle> 1112;;;;N;;;;;
+326E;CIRCLED HANGUL KIYEOK A;So;0;L;<circle> 1100 1161;;;;N;CIRCLED HANGUL GA;;;;
+326F;CIRCLED HANGUL NIEUN A;So;0;L;<circle> 1102 1161;;;;N;CIRCLED HANGUL NA;;;;
+3270;CIRCLED HANGUL TIKEUT A;So;0;L;<circle> 1103 1161;;;;N;CIRCLED HANGUL DA;;;;
+3271;CIRCLED HANGUL RIEUL A;So;0;L;<circle> 1105 1161;;;;N;CIRCLED HANGUL LA;;;;
+3272;CIRCLED HANGUL MIEUM A;So;0;L;<circle> 1106 1161;;;;N;CIRCLED HANGUL MA;;;;
+3273;CIRCLED HANGUL PIEUP A;So;0;L;<circle> 1107 1161;;;;N;CIRCLED HANGUL BA;;;;
+3274;CIRCLED HANGUL SIOS A;So;0;L;<circle> 1109 1161;;;;N;CIRCLED HANGUL SA;;;;
+3275;CIRCLED HANGUL IEUNG A;So;0;L;<circle> 110B 1161;;;;N;CIRCLED HANGUL A;;;;
+3276;CIRCLED HANGUL CIEUC A;So;0;L;<circle> 110C 1161;;;;N;CIRCLED HANGUL JA;;;;
+3277;CIRCLED HANGUL CHIEUCH A;So;0;L;<circle> 110E 1161;;;;N;CIRCLED HANGUL CA;;;;
+3278;CIRCLED HANGUL KHIEUKH A;So;0;L;<circle> 110F 1161;;;;N;CIRCLED HANGUL KA;;;;
+3279;CIRCLED HANGUL THIEUTH A;So;0;L;<circle> 1110 1161;;;;N;CIRCLED HANGUL TA;;;;
+327A;CIRCLED HANGUL PHIEUPH A;So;0;L;<circle> 1111 1161;;;;N;CIRCLED HANGUL PA;;;;
+327B;CIRCLED HANGUL HIEUH A;So;0;L;<circle> 1112 1161;;;;N;CIRCLED HANGUL HA;;;;
+327C;CIRCLED KOREAN CHARACTER CHAMKO;So;0;ON;<circle> 110E 1161 11B7 1100 1169;;;;N;;;;;
+327D;CIRCLED KOREAN CHARACTER JUEUI;So;0;ON;<circle> 110C 116E 110B 1174;;;;N;;;;;
+327E;CIRCLED HANGUL IEUNG U;So;0;ON;<circle> 110B 116E;;;;N;;;;;
+327F;KOREAN STANDARD SYMBOL;So;0;L;;;;;N;;;;;
+3280;CIRCLED IDEOGRAPH ONE;No;0;L;<circle> 4E00;;;1;N;;;;;
+3281;CIRCLED IDEOGRAPH TWO;No;0;L;<circle> 4E8C;;;2;N;;;;;
+3282;CIRCLED IDEOGRAPH THREE;No;0;L;<circle> 4E09;;;3;N;;;;;
+3283;CIRCLED IDEOGRAPH FOUR;No;0;L;<circle> 56DB;;;4;N;;;;;
+3284;CIRCLED IDEOGRAPH FIVE;No;0;L;<circle> 4E94;;;5;N;;;;;
+3285;CIRCLED IDEOGRAPH SIX;No;0;L;<circle> 516D;;;6;N;;;;;
+3286;CIRCLED IDEOGRAPH SEVEN;No;0;L;<circle> 4E03;;;7;N;;;;;
+3287;CIRCLED IDEOGRAPH EIGHT;No;0;L;<circle> 516B;;;8;N;;;;;
+3288;CIRCLED IDEOGRAPH NINE;No;0;L;<circle> 4E5D;;;9;N;;;;;
+3289;CIRCLED IDEOGRAPH TEN;No;0;L;<circle> 5341;;;10;N;;;;;
+328A;CIRCLED IDEOGRAPH MOON;So;0;L;<circle> 6708;;;;N;;;;;
+328B;CIRCLED IDEOGRAPH FIRE;So;0;L;<circle> 706B;;;;N;;;;;
+328C;CIRCLED IDEOGRAPH WATER;So;0;L;<circle> 6C34;;;;N;;;;;
+328D;CIRCLED IDEOGRAPH WOOD;So;0;L;<circle> 6728;;;;N;;;;;
+328E;CIRCLED IDEOGRAPH METAL;So;0;L;<circle> 91D1;;;;N;;;;;
+328F;CIRCLED IDEOGRAPH EARTH;So;0;L;<circle> 571F;;;;N;;;;;
+3290;CIRCLED IDEOGRAPH SUN;So;0;L;<circle> 65E5;;;;N;;;;;
+3291;CIRCLED IDEOGRAPH STOCK;So;0;L;<circle> 682A;;;;N;;;;;
+3292;CIRCLED IDEOGRAPH HAVE;So;0;L;<circle> 6709;;;;N;;;;;
+3293;CIRCLED IDEOGRAPH SOCIETY;So;0;L;<circle> 793E;;;;N;;;;;
+3294;CIRCLED IDEOGRAPH NAME;So;0;L;<circle> 540D;;;;N;;;;;
+3295;CIRCLED IDEOGRAPH SPECIAL;So;0;L;<circle> 7279;;;;N;;;;;
+3296;CIRCLED IDEOGRAPH FINANCIAL;So;0;L;<circle> 8CA1;;;;N;;;;;
+3297;CIRCLED IDEOGRAPH CONGRATULATION;So;0;L;<circle> 795D;;;;N;;;;;
+3298;CIRCLED IDEOGRAPH LABOR;So;0;L;<circle> 52B4;;;;N;;;;;
+3299;CIRCLED IDEOGRAPH SECRET;So;0;L;<circle> 79D8;;;;N;;;;;
+329A;CIRCLED IDEOGRAPH MALE;So;0;L;<circle> 7537;;;;N;;;;;
+329B;CIRCLED IDEOGRAPH FEMALE;So;0;L;<circle> 5973;;;;N;;;;;
+329C;CIRCLED IDEOGRAPH SUITABLE;So;0;L;<circle> 9069;;;;N;;;;;
+329D;CIRCLED IDEOGRAPH EXCELLENT;So;0;L;<circle> 512A;;;;N;;;;;
+329E;CIRCLED IDEOGRAPH PRINT;So;0;L;<circle> 5370;;;;N;;;;;
+329F;CIRCLED IDEOGRAPH ATTENTION;So;0;L;<circle> 6CE8;;;;N;;;;;
+32A0;CIRCLED IDEOGRAPH ITEM;So;0;L;<circle> 9805;;;;N;;;;;
+32A1;CIRCLED IDEOGRAPH REST;So;0;L;<circle> 4F11;;;;N;;;;;
+32A2;CIRCLED IDEOGRAPH COPY;So;0;L;<circle> 5199;;;;N;;;;;
+32A3;CIRCLED IDEOGRAPH CORRECT;So;0;L;<circle> 6B63;;;;N;;;;;
+32A4;CIRCLED IDEOGRAPH HIGH;So;0;L;<circle> 4E0A;;;;N;;;;;
+32A5;CIRCLED IDEOGRAPH CENTRE;So;0;L;<circle> 4E2D;;;;N;CIRCLED IDEOGRAPH CENTER;;;;
+32A6;CIRCLED IDEOGRAPH LOW;So;0;L;<circle> 4E0B;;;;N;;;;;
+32A7;CIRCLED IDEOGRAPH LEFT;So;0;L;<circle> 5DE6;;;;N;;;;;
+32A8;CIRCLED IDEOGRAPH RIGHT;So;0;L;<circle> 53F3;;;;N;;;;;
+32A9;CIRCLED IDEOGRAPH MEDICINE;So;0;L;<circle> 533B;;;;N;;;;;
+32AA;CIRCLED IDEOGRAPH RELIGION;So;0;L;<circle> 5B97;;;;N;;;;;
+32AB;CIRCLED IDEOGRAPH STUDY;So;0;L;<circle> 5B66;;;;N;;;;;
+32AC;CIRCLED IDEOGRAPH SUPERVISE;So;0;L;<circle> 76E3;;;;N;;;;;
+32AD;CIRCLED IDEOGRAPH ENTERPRISE;So;0;L;<circle> 4F01;;;;N;;;;;
+32AE;CIRCLED IDEOGRAPH RESOURCE;So;0;L;<circle> 8CC7;;;;N;;;;;
+32AF;CIRCLED IDEOGRAPH ALLIANCE;So;0;L;<circle> 5354;;;;N;;;;;
+32B0;CIRCLED IDEOGRAPH NIGHT;So;0;L;<circle> 591C;;;;N;;;;;
+32B1;CIRCLED NUMBER THIRTY SIX;No;0;ON;<circle> 0033 0036;;;36;N;;;;;
+32B2;CIRCLED NUMBER THIRTY SEVEN;No;0;ON;<circle> 0033 0037;;;37;N;;;;;
+32B3;CIRCLED NUMBER THIRTY EIGHT;No;0;ON;<circle> 0033 0038;;;38;N;;;;;
+32B4;CIRCLED NUMBER THIRTY NINE;No;0;ON;<circle> 0033 0039;;;39;N;;;;;
+32B5;CIRCLED NUMBER FORTY;No;0;ON;<circle> 0034 0030;;;40;N;;;;;
+32B6;CIRCLED NUMBER FORTY ONE;No;0;ON;<circle> 0034 0031;;;41;N;;;;;
+32B7;CIRCLED NUMBER FORTY TWO;No;0;ON;<circle> 0034 0032;;;42;N;;;;;
+32B8;CIRCLED NUMBER FORTY THREE;No;0;ON;<circle> 0034 0033;;;43;N;;;;;
+32B9;CIRCLED NUMBER FORTY FOUR;No;0;ON;<circle> 0034 0034;;;44;N;;;;;
+32BA;CIRCLED NUMBER FORTY FIVE;No;0;ON;<circle> 0034 0035;;;45;N;;;;;
+32BB;CIRCLED NUMBER FORTY SIX;No;0;ON;<circle> 0034 0036;;;46;N;;;;;
+32BC;CIRCLED NUMBER FORTY SEVEN;No;0;ON;<circle> 0034 0037;;;47;N;;;;;
+32BD;CIRCLED NUMBER FORTY EIGHT;No;0;ON;<circle> 0034 0038;;;48;N;;;;;
+32BE;CIRCLED NUMBER FORTY NINE;No;0;ON;<circle> 0034 0039;;;49;N;;;;;
+32BF;CIRCLED NUMBER FIFTY;No;0;ON;<circle> 0035 0030;;;50;N;;;;;
+32C0;IDEOGRAPHIC TELEGRAPH SYMBOL FOR JANUARY;So;0;L;<compat> 0031 6708;;;;N;;;;;
+32C1;IDEOGRAPHIC TELEGRAPH SYMBOL FOR FEBRUARY;So;0;L;<compat> 0032 6708;;;;N;;;;;
+32C2;IDEOGRAPHIC TELEGRAPH SYMBOL FOR MARCH;So;0;L;<compat> 0033 6708;;;;N;;;;;
+32C3;IDEOGRAPHIC TELEGRAPH SYMBOL FOR APRIL;So;0;L;<compat> 0034 6708;;;;N;;;;;
+32C4;IDEOGRAPHIC TELEGRAPH SYMBOL FOR MAY;So;0;L;<compat> 0035 6708;;;;N;;;;;
+32C5;IDEOGRAPHIC TELEGRAPH SYMBOL FOR JUNE;So;0;L;<compat> 0036 6708;;;;N;;;;;
+32C6;IDEOGRAPHIC TELEGRAPH SYMBOL FOR JULY;So;0;L;<compat> 0037 6708;;;;N;;;;;
+32C7;IDEOGRAPHIC TELEGRAPH SYMBOL FOR AUGUST;So;0;L;<compat> 0038 6708;;;;N;;;;;
+32C8;IDEOGRAPHIC TELEGRAPH SYMBOL FOR SEPTEMBER;So;0;L;<compat> 0039 6708;;;;N;;;;;
+32C9;IDEOGRAPHIC TELEGRAPH SYMBOL FOR OCTOBER;So;0;L;<compat> 0031 0030 6708;;;;N;;;;;
+32CA;IDEOGRAPHIC TELEGRAPH SYMBOL FOR NOVEMBER;So;0;L;<compat> 0031 0031 6708;;;;N;;;;;
+32CB;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DECEMBER;So;0;L;<compat> 0031 0032 6708;;;;N;;;;;
+32CC;SQUARE HG;So;0;ON;<square> 0048 0067;;;;N;;;;;
+32CD;SQUARE ERG;So;0;ON;<square> 0065 0072 0067;;;;N;;;;;
+32CE;SQUARE EV;So;0;ON;<square> 0065 0056;;;;N;;;;;
+32CF;LIMITED LIABILITY SIGN;So;0;ON;<square> 004C 0054 0044;;;;N;;;;;
+32D0;CIRCLED KATAKANA A;So;0;L;<circle> 30A2;;;;N;;;;;
+32D1;CIRCLED KATAKANA I;So;0;L;<circle> 30A4;;;;N;;;;;
+32D2;CIRCLED KATAKANA U;So;0;L;<circle> 30A6;;;;N;;;;;
+32D3;CIRCLED KATAKANA E;So;0;L;<circle> 30A8;;;;N;;;;;
+32D4;CIRCLED KATAKANA O;So;0;L;<circle> 30AA;;;;N;;;;;
+32D5;CIRCLED KATAKANA KA;So;0;L;<circle> 30AB;;;;N;;;;;
+32D6;CIRCLED KATAKANA KI;So;0;L;<circle> 30AD;;;;N;;;;;
+32D7;CIRCLED KATAKANA KU;So;0;L;<circle> 30AF;;;;N;;;;;
+32D8;CIRCLED KATAKANA KE;So;0;L;<circle> 30B1;;;;N;;;;;
+32D9;CIRCLED KATAKANA KO;So;0;L;<circle> 30B3;;;;N;;;;;
+32DA;CIRCLED KATAKANA SA;So;0;L;<circle> 30B5;;;;N;;;;;
+32DB;CIRCLED KATAKANA SI;So;0;L;<circle> 30B7;;;;N;;;;;
+32DC;CIRCLED KATAKANA SU;So;0;L;<circle> 30B9;;;;N;;;;;
+32DD;CIRCLED KATAKANA SE;So;0;L;<circle> 30BB;;;;N;;;;;
+32DE;CIRCLED KATAKANA SO;So;0;L;<circle> 30BD;;;;N;;;;;
+32DF;CIRCLED KATAKANA TA;So;0;L;<circle> 30BF;;;;N;;;;;
+32E0;CIRCLED KATAKANA TI;So;0;L;<circle> 30C1;;;;N;;;;;
+32E1;CIRCLED KATAKANA TU;So;0;L;<circle> 30C4;;;;N;;;;;
+32E2;CIRCLED KATAKANA TE;So;0;L;<circle> 30C6;;;;N;;;;;
+32E3;CIRCLED KATAKANA TO;So;0;L;<circle> 30C8;;;;N;;;;;
+32E4;CIRCLED KATAKANA NA;So;0;L;<circle> 30CA;;;;N;;;;;
+32E5;CIRCLED KATAKANA NI;So;0;L;<circle> 30CB;;;;N;;;;;
+32E6;CIRCLED KATAKANA NU;So;0;L;<circle> 30CC;;;;N;;;;;
+32E7;CIRCLED KATAKANA NE;So;0;L;<circle> 30CD;;;;N;;;;;
+32E8;CIRCLED KATAKANA NO;So;0;L;<circle> 30CE;;;;N;;;;;
+32E9;CIRCLED KATAKANA HA;So;0;L;<circle> 30CF;;;;N;;;;;
+32EA;CIRCLED KATAKANA HI;So;0;L;<circle> 30D2;;;;N;;;;;
+32EB;CIRCLED KATAKANA HU;So;0;L;<circle> 30D5;;;;N;;;;;
+32EC;CIRCLED KATAKANA HE;So;0;L;<circle> 30D8;;;;N;;;;;
+32ED;CIRCLED KATAKANA HO;So;0;L;<circle> 30DB;;;;N;;;;;
+32EE;CIRCLED KATAKANA MA;So;0;L;<circle> 30DE;;;;N;;;;;
+32EF;CIRCLED KATAKANA MI;So;0;L;<circle> 30DF;;;;N;;;;;
+32F0;CIRCLED KATAKANA MU;So;0;L;<circle> 30E0;;;;N;;;;;
+32F1;CIRCLED KATAKANA ME;So;0;L;<circle> 30E1;;;;N;;;;;
+32F2;CIRCLED KATAKANA MO;So;0;L;<circle> 30E2;;;;N;;;;;
+32F3;CIRCLED KATAKANA YA;So;0;L;<circle> 30E4;;;;N;;;;;
+32F4;CIRCLED KATAKANA YU;So;0;L;<circle> 30E6;;;;N;;;;;
+32F5;CIRCLED KATAKANA YO;So;0;L;<circle> 30E8;;;;N;;;;;
+32F6;CIRCLED KATAKANA RA;So;0;L;<circle> 30E9;;;;N;;;;;
+32F7;CIRCLED KATAKANA RI;So;0;L;<circle> 30EA;;;;N;;;;;
+32F8;CIRCLED KATAKANA RU;So;0;L;<circle> 30EB;;;;N;;;;;
+32F9;CIRCLED KATAKANA RE;So;0;L;<circle> 30EC;;;;N;;;;;
+32FA;CIRCLED KATAKANA RO;So;0;L;<circle> 30ED;;;;N;;;;;
+32FB;CIRCLED KATAKANA WA;So;0;L;<circle> 30EF;;;;N;;;;;
+32FC;CIRCLED KATAKANA WI;So;0;L;<circle> 30F0;;;;N;;;;;
+32FD;CIRCLED KATAKANA WE;So;0;L;<circle> 30F1;;;;N;;;;;
+32FE;CIRCLED KATAKANA WO;So;0;L;<circle> 30F2;;;;N;;;;;
+3300;SQUARE APAATO;So;0;L;<square> 30A2 30D1 30FC 30C8;;;;N;SQUARED APAATO;;;;
+3301;SQUARE ARUHUA;So;0;L;<square> 30A2 30EB 30D5 30A1;;;;N;SQUARED ARUHUA;;;;
+3302;SQUARE ANPEA;So;0;L;<square> 30A2 30F3 30DA 30A2;;;;N;SQUARED ANPEA;;;;
+3303;SQUARE AARU;So;0;L;<square> 30A2 30FC 30EB;;;;N;SQUARED AARU;;;;
+3304;SQUARE ININGU;So;0;L;<square> 30A4 30CB 30F3 30B0;;;;N;SQUARED ININGU;;;;
+3305;SQUARE INTI;So;0;L;<square> 30A4 30F3 30C1;;;;N;SQUARED INTI;;;;
+3306;SQUARE UON;So;0;L;<square> 30A6 30A9 30F3;;;;N;SQUARED UON;;;;
+3307;SQUARE ESUKUUDO;So;0;L;<square> 30A8 30B9 30AF 30FC 30C9;;;;N;SQUARED ESUKUUDO;;;;
+3308;SQUARE EEKAA;So;0;L;<square> 30A8 30FC 30AB 30FC;;;;N;SQUARED EEKAA;;;;
+3309;SQUARE ONSU;So;0;L;<square> 30AA 30F3 30B9;;;;N;SQUARED ONSU;;;;
+330A;SQUARE OOMU;So;0;L;<square> 30AA 30FC 30E0;;;;N;SQUARED OOMU;;;;
+330B;SQUARE KAIRI;So;0;L;<square> 30AB 30A4 30EA;;;;N;SQUARED KAIRI;;;;
+330C;SQUARE KARATTO;So;0;L;<square> 30AB 30E9 30C3 30C8;;;;N;SQUARED KARATTO;;;;
+330D;SQUARE KARORII;So;0;L;<square> 30AB 30ED 30EA 30FC;;;;N;SQUARED KARORII;;;;
+330E;SQUARE GARON;So;0;L;<square> 30AC 30ED 30F3;;;;N;SQUARED GARON;;;;
+330F;SQUARE GANMA;So;0;L;<square> 30AC 30F3 30DE;;;;N;SQUARED GANMA;;;;
+3310;SQUARE GIGA;So;0;L;<square> 30AE 30AC;;;;N;SQUARED GIGA;;;;
+3311;SQUARE GINII;So;0;L;<square> 30AE 30CB 30FC;;;;N;SQUARED GINII;;;;
+3312;SQUARE KYURII;So;0;L;<square> 30AD 30E5 30EA 30FC;;;;N;SQUARED KYURII;;;;
+3313;SQUARE GIRUDAA;So;0;L;<square> 30AE 30EB 30C0 30FC;;;;N;SQUARED GIRUDAA;;;;
+3314;SQUARE KIRO;So;0;L;<square> 30AD 30ED;;;;N;SQUARED KIRO;;;;
+3315;SQUARE KIROGURAMU;So;0;L;<square> 30AD 30ED 30B0 30E9 30E0;;;;N;SQUARED KIROGURAMU;;;;
+3316;SQUARE KIROMEETORU;So;0;L;<square> 30AD 30ED 30E1 30FC 30C8 30EB;;;;N;SQUARED KIROMEETORU;;;;
+3317;SQUARE KIROWATTO;So;0;L;<square> 30AD 30ED 30EF 30C3 30C8;;;;N;SQUARED KIROWATTO;;;;
+3318;SQUARE GURAMU;So;0;L;<square> 30B0 30E9 30E0;;;;N;SQUARED GURAMU;;;;
+3319;SQUARE GURAMUTON;So;0;L;<square> 30B0 30E9 30E0 30C8 30F3;;;;N;SQUARED GURAMUTON;;;;
+331A;SQUARE KURUZEIRO;So;0;L;<square> 30AF 30EB 30BC 30A4 30ED;;;;N;SQUARED KURUZEIRO;;;;
+331B;SQUARE KUROONE;So;0;L;<square> 30AF 30ED 30FC 30CD;;;;N;SQUARED KUROONE;;;;
+331C;SQUARE KEESU;So;0;L;<square> 30B1 30FC 30B9;;;;N;SQUARED KEESU;;;;
+331D;SQUARE KORUNA;So;0;L;<square> 30B3 30EB 30CA;;;;N;SQUARED KORUNA;;;;
+331E;SQUARE KOOPO;So;0;L;<square> 30B3 30FC 30DD;;;;N;SQUARED KOOPO;;;;
+331F;SQUARE SAIKURU;So;0;L;<square> 30B5 30A4 30AF 30EB;;;;N;SQUARED SAIKURU;;;;
+3320;SQUARE SANTIIMU;So;0;L;<square> 30B5 30F3 30C1 30FC 30E0;;;;N;SQUARED SANTIIMU;;;;
+3321;SQUARE SIRINGU;So;0;L;<square> 30B7 30EA 30F3 30B0;;;;N;SQUARED SIRINGU;;;;
+3322;SQUARE SENTI;So;0;L;<square> 30BB 30F3 30C1;;;;N;SQUARED SENTI;;;;
+3323;SQUARE SENTO;So;0;L;<square> 30BB 30F3 30C8;;;;N;SQUARED SENTO;;;;
+3324;SQUARE DAASU;So;0;L;<square> 30C0 30FC 30B9;;;;N;SQUARED DAASU;;;;
+3325;SQUARE DESI;So;0;L;<square> 30C7 30B7;;;;N;SQUARED DESI;;;;
+3326;SQUARE DORU;So;0;L;<square> 30C9 30EB;;;;N;SQUARED DORU;;;;
+3327;SQUARE TON;So;0;L;<square> 30C8 30F3;;;;N;SQUARED TON;;;;
+3328;SQUARE NANO;So;0;L;<square> 30CA 30CE;;;;N;SQUARED NANO;;;;
+3329;SQUARE NOTTO;So;0;L;<square> 30CE 30C3 30C8;;;;N;SQUARED NOTTO;;;;
+332A;SQUARE HAITU;So;0;L;<square> 30CF 30A4 30C4;;;;N;SQUARED HAITU;;;;
+332B;SQUARE PAASENTO;So;0;L;<square> 30D1 30FC 30BB 30F3 30C8;;;;N;SQUARED PAASENTO;;;;
+332C;SQUARE PAATU;So;0;L;<square> 30D1 30FC 30C4;;;;N;SQUARED PAATU;;;;
+332D;SQUARE BAARERU;So;0;L;<square> 30D0 30FC 30EC 30EB;;;;N;SQUARED BAARERU;;;;
+332E;SQUARE PIASUTORU;So;0;L;<square> 30D4 30A2 30B9 30C8 30EB;;;;N;SQUARED PIASUTORU;;;;
+332F;SQUARE PIKURU;So;0;L;<square> 30D4 30AF 30EB;;;;N;SQUARED PIKURU;;;;
+3330;SQUARE PIKO;So;0;L;<square> 30D4 30B3;;;;N;SQUARED PIKO;;;;
+3331;SQUARE BIRU;So;0;L;<square> 30D3 30EB;;;;N;SQUARED BIRU;;;;
+3332;SQUARE HUARADDO;So;0;L;<square> 30D5 30A1 30E9 30C3 30C9;;;;N;SQUARED HUARADDO;;;;
+3333;SQUARE HUIITO;So;0;L;<square> 30D5 30A3 30FC 30C8;;;;N;SQUARED HUIITO;;;;
+3334;SQUARE BUSSYERU;So;0;L;<square> 30D6 30C3 30B7 30A7 30EB;;;;N;SQUARED BUSSYERU;;;;
+3335;SQUARE HURAN;So;0;L;<square> 30D5 30E9 30F3;;;;N;SQUARED HURAN;;;;
+3336;SQUARE HEKUTAARU;So;0;L;<square> 30D8 30AF 30BF 30FC 30EB;;;;N;SQUARED HEKUTAARU;;;;
+3337;SQUARE PESO;So;0;L;<square> 30DA 30BD;;;;N;SQUARED PESO;;;;
+3338;SQUARE PENIHI;So;0;L;<square> 30DA 30CB 30D2;;;;N;SQUARED PENIHI;;;;
+3339;SQUARE HERUTU;So;0;L;<square> 30D8 30EB 30C4;;;;N;SQUARED HERUTU;;;;
+333A;SQUARE PENSU;So;0;L;<square> 30DA 30F3 30B9;;;;N;SQUARED PENSU;;;;
+333B;SQUARE PEEZI;So;0;L;<square> 30DA 30FC 30B8;;;;N;SQUARED PEEZI;;;;
+333C;SQUARE BEETA;So;0;L;<square> 30D9 30FC 30BF;;;;N;SQUARED BEETA;;;;
+333D;SQUARE POINTO;So;0;L;<square> 30DD 30A4 30F3 30C8;;;;N;SQUARED POINTO;;;;
+333E;SQUARE BORUTO;So;0;L;<square> 30DC 30EB 30C8;;;;N;SQUARED BORUTO;;;;
+333F;SQUARE HON;So;0;L;<square> 30DB 30F3;;;;N;SQUARED HON;;;;
+3340;SQUARE PONDO;So;0;L;<square> 30DD 30F3 30C9;;;;N;SQUARED PONDO;;;;
+3341;SQUARE HOORU;So;0;L;<square> 30DB 30FC 30EB;;;;N;SQUARED HOORU;;;;
+3342;SQUARE HOON;So;0;L;<square> 30DB 30FC 30F3;;;;N;SQUARED HOON;;;;
+3343;SQUARE MAIKURO;So;0;L;<square> 30DE 30A4 30AF 30ED;;;;N;SQUARED MAIKURO;;;;
+3344;SQUARE MAIRU;So;0;L;<square> 30DE 30A4 30EB;;;;N;SQUARED MAIRU;;;;
+3345;SQUARE MAHHA;So;0;L;<square> 30DE 30C3 30CF;;;;N;SQUARED MAHHA;;;;
+3346;SQUARE MARUKU;So;0;L;<square> 30DE 30EB 30AF;;;;N;SQUARED MARUKU;;;;
+3347;SQUARE MANSYON;So;0;L;<square> 30DE 30F3 30B7 30E7 30F3;;;;N;SQUARED MANSYON;;;;
+3348;SQUARE MIKURON;So;0;L;<square> 30DF 30AF 30ED 30F3;;;;N;SQUARED MIKURON;;;;
+3349;SQUARE MIRI;So;0;L;<square> 30DF 30EA;;;;N;SQUARED MIRI;;;;
+334A;SQUARE MIRIBAARU;So;0;L;<square> 30DF 30EA 30D0 30FC 30EB;;;;N;SQUARED MIRIBAARU;;;;
+334B;SQUARE MEGA;So;0;L;<square> 30E1 30AC;;;;N;SQUARED MEGA;;;;
+334C;SQUARE MEGATON;So;0;L;<square> 30E1 30AC 30C8 30F3;;;;N;SQUARED MEGATON;;;;
+334D;SQUARE MEETORU;So;0;L;<square> 30E1 30FC 30C8 30EB;;;;N;SQUARED MEETORU;;;;
+334E;SQUARE YAADO;So;0;L;<square> 30E4 30FC 30C9;;;;N;SQUARED YAADO;;;;
+334F;SQUARE YAARU;So;0;L;<square> 30E4 30FC 30EB;;;;N;SQUARED YAARU;;;;
+3350;SQUARE YUAN;So;0;L;<square> 30E6 30A2 30F3;;;;N;SQUARED YUAN;;;;
+3351;SQUARE RITTORU;So;0;L;<square> 30EA 30C3 30C8 30EB;;;;N;SQUARED RITTORU;;;;
+3352;SQUARE RIRA;So;0;L;<square> 30EA 30E9;;;;N;SQUARED RIRA;;;;
+3353;SQUARE RUPII;So;0;L;<square> 30EB 30D4 30FC;;;;N;SQUARED RUPII;;;;
+3354;SQUARE RUUBURU;So;0;L;<square> 30EB 30FC 30D6 30EB;;;;N;SQUARED RUUBURU;;;;
+3355;SQUARE REMU;So;0;L;<square> 30EC 30E0;;;;N;SQUARED REMU;;;;
+3356;SQUARE RENTOGEN;So;0;L;<square> 30EC 30F3 30C8 30B2 30F3;;;;N;SQUARED RENTOGEN;;;;
+3357;SQUARE WATTO;So;0;L;<square> 30EF 30C3 30C8;;;;N;SQUARED WATTO;;;;
+3358;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR ZERO;So;0;L;<compat> 0030 70B9;;;;N;;;;;
+3359;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR ONE;So;0;L;<compat> 0031 70B9;;;;N;;;;;
+335A;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR TWO;So;0;L;<compat> 0032 70B9;;;;N;;;;;
+335B;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR THREE;So;0;L;<compat> 0033 70B9;;;;N;;;;;
+335C;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR FOUR;So;0;L;<compat> 0034 70B9;;;;N;;;;;
+335D;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR FIVE;So;0;L;<compat> 0035 70B9;;;;N;;;;;
+335E;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR SIX;So;0;L;<compat> 0036 70B9;;;;N;;;;;
+335F;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR SEVEN;So;0;L;<compat> 0037 70B9;;;;N;;;;;
+3360;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR EIGHT;So;0;L;<compat> 0038 70B9;;;;N;;;;;
+3361;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR NINE;So;0;L;<compat> 0039 70B9;;;;N;;;;;
+3362;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR TEN;So;0;L;<compat> 0031 0030 70B9;;;;N;;;;;
+3363;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR ELEVEN;So;0;L;<compat> 0031 0031 70B9;;;;N;;;;;
+3364;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR TWELVE;So;0;L;<compat> 0031 0032 70B9;;;;N;;;;;
+3365;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR THIRTEEN;So;0;L;<compat> 0031 0033 70B9;;;;N;;;;;
+3366;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR FOURTEEN;So;0;L;<compat> 0031 0034 70B9;;;;N;;;;;
+3367;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR FIFTEEN;So;0;L;<compat> 0031 0035 70B9;;;;N;;;;;
+3368;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR SIXTEEN;So;0;L;<compat> 0031 0036 70B9;;;;N;;;;;
+3369;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR SEVENTEEN;So;0;L;<compat> 0031 0037 70B9;;;;N;;;;;
+336A;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR EIGHTEEN;So;0;L;<compat> 0031 0038 70B9;;;;N;;;;;
+336B;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR NINETEEN;So;0;L;<compat> 0031 0039 70B9;;;;N;;;;;
+336C;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR TWENTY;So;0;L;<compat> 0032 0030 70B9;;;;N;;;;;
+336D;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR TWENTY-ONE;So;0;L;<compat> 0032 0031 70B9;;;;N;;;;;
+336E;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR TWENTY-TWO;So;0;L;<compat> 0032 0032 70B9;;;;N;;;;;
+336F;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR TWENTY-THREE;So;0;L;<compat> 0032 0033 70B9;;;;N;;;;;
+3370;IDEOGRAPHIC TELEGRAPH SYMBOL FOR HOUR TWENTY-FOUR;So;0;L;<compat> 0032 0034 70B9;;;;N;;;;;
+3371;SQUARE HPA;So;0;L;<square> 0068 0050 0061;;;;N;;;;;
+3372;SQUARE DA;So;0;L;<square> 0064 0061;;;;N;;;;;
+3373;SQUARE AU;So;0;L;<square> 0041 0055;;;;N;;;;;
+3374;SQUARE BAR;So;0;L;<square> 0062 0061 0072;;;;N;;;;;
+3375;SQUARE OV;So;0;L;<square> 006F 0056;;;;N;;;;;
+3376;SQUARE PC;So;0;L;<square> 0070 0063;;;;N;;;;;
+3377;SQUARE DM;So;0;ON;<square> 0064 006D;;;;N;;;;;
+3378;SQUARE DM SQUARED;So;0;ON;<square> 0064 006D 00B2;;;;N;;;;;
+3379;SQUARE DM CUBED;So;0;ON;<square> 0064 006D 00B3;;;;N;;;;;
+337A;SQUARE IU;So;0;ON;<square> 0049 0055;;;;N;;;;;
+337B;SQUARE ERA NAME HEISEI;So;0;L;<square> 5E73 6210;;;;N;SQUARED TWO IDEOGRAPHS ERA NAME HEISEI;;;;
+337C;SQUARE ERA NAME SYOUWA;So;0;L;<square> 662D 548C;;;;N;SQUARED TWO IDEOGRAPHS ERA NAME SYOUWA;;;;
+337D;SQUARE ERA NAME TAISYOU;So;0;L;<square> 5927 6B63;;;;N;SQUARED TWO IDEOGRAPHS ERA NAME TAISYOU;;;;
+337E;SQUARE ERA NAME MEIZI;So;0;L;<square> 660E 6CBB;;;;N;SQUARED TWO IDEOGRAPHS ERA NAME MEIZI;;;;
+337F;SQUARE CORPORATION;So;0;L;<square> 682A 5F0F 4F1A 793E;;;;N;SQUARED FOUR IDEOGRAPHS CORPORATION;;;;
+3380;SQUARE PA AMPS;So;0;L;<square> 0070 0041;;;;N;SQUARED PA AMPS;;;;
+3381;SQUARE NA;So;0;L;<square> 006E 0041;;;;N;SQUARED NA;;;;
+3382;SQUARE MU A;So;0;L;<square> 03BC 0041;;;;N;SQUARED MU A;;;;
+3383;SQUARE MA;So;0;L;<square> 006D 0041;;;;N;SQUARED MA;;;;
+3384;SQUARE KA;So;0;L;<square> 006B 0041;;;;N;SQUARED KA;;;;
+3385;SQUARE KB;So;0;L;<square> 004B 0042;;;;N;SQUARED KB;;;;
+3386;SQUARE MB;So;0;L;<square> 004D 0042;;;;N;SQUARED MB;;;;
+3387;SQUARE GB;So;0;L;<square> 0047 0042;;;;N;SQUARED GB;;;;
+3388;SQUARE CAL;So;0;L;<square> 0063 0061 006C;;;;N;SQUARED CAL;;;;
+3389;SQUARE KCAL;So;0;L;<square> 006B 0063 0061 006C;;;;N;SQUARED KCAL;;;;
+338A;SQUARE PF;So;0;L;<square> 0070 0046;;;;N;SQUARED PF;;;;
+338B;SQUARE NF;So;0;L;<square> 006E 0046;;;;N;SQUARED NF;;;;
+338C;SQUARE MU F;So;0;L;<square> 03BC 0046;;;;N;SQUARED MU F;;;;
+338D;SQUARE MU G;So;0;L;<square> 03BC 0067;;;;N;SQUARED MU G;;;;
+338E;SQUARE MG;So;0;L;<square> 006D 0067;;;;N;SQUARED MG;;;;
+338F;SQUARE KG;So;0;L;<square> 006B 0067;;;;N;SQUARED KG;;;;
+3390;SQUARE HZ;So;0;L;<square> 0048 007A;;;;N;SQUARED HZ;;;;
+3391;SQUARE KHZ;So;0;L;<square> 006B 0048 007A;;;;N;SQUARED KHZ;;;;
+3392;SQUARE MHZ;So;0;L;<square> 004D 0048 007A;;;;N;SQUARED MHZ;;;;
+3393;SQUARE GHZ;So;0;L;<square> 0047 0048 007A;;;;N;SQUARED GHZ;;;;
+3394;SQUARE THZ;So;0;L;<square> 0054 0048 007A;;;;N;SQUARED THZ;;;;
+3395;SQUARE MU L;So;0;L;<square> 03BC 2113;;;;N;SQUARED MU L;;;;
+3396;SQUARE ML;So;0;L;<square> 006D 2113;;;;N;SQUARED ML;;;;
+3397;SQUARE DL;So;0;L;<square> 0064 2113;;;;N;SQUARED DL;;;;
+3398;SQUARE KL;So;0;L;<square> 006B 2113;;;;N;SQUARED KL;;;;
+3399;SQUARE FM;So;0;L;<square> 0066 006D;;;;N;SQUARED FM;;;;
+339A;SQUARE NM;So;0;L;<square> 006E 006D;;;;N;SQUARED NM;;;;
+339B;SQUARE MU M;So;0;L;<square> 03BC 006D;;;;N;SQUARED MU M;;;;
+339C;SQUARE MM;So;0;L;<square> 006D 006D;;;;N;SQUARED MM;;;;
+339D;SQUARE CM;So;0;L;<square> 0063 006D;;;;N;SQUARED CM;;;;
+339E;SQUARE KM;So;0;L;<square> 006B 006D;;;;N;SQUARED KM;;;;
+339F;SQUARE MM SQUARED;So;0;L;<square> 006D 006D 00B2;;;;N;SQUARED MM SQUARED;;;;
+33A0;SQUARE CM SQUARED;So;0;L;<square> 0063 006D 00B2;;;;N;SQUARED CM SQUARED;;;;
+33A1;SQUARE M SQUARED;So;0;L;<square> 006D 00B2;;;;N;SQUARED M SQUARED;;;;
+33A2;SQUARE KM SQUARED;So;0;L;<square> 006B 006D 00B2;;;;N;SQUARED KM SQUARED;;;;
+33A3;SQUARE MM CUBED;So;0;L;<square> 006D 006D 00B3;;;;N;SQUARED MM CUBED;;;;
+33A4;SQUARE CM CUBED;So;0;L;<square> 0063 006D 00B3;;;;N;SQUARED CM CUBED;;;;
+33A5;SQUARE M CUBED;So;0;L;<square> 006D 00B3;;;;N;SQUARED M CUBED;;;;
+33A6;SQUARE KM CUBED;So;0;L;<square> 006B 006D 00B3;;;;N;SQUARED KM CUBED;;;;
+33A7;SQUARE M OVER S;So;0;L;<square> 006D 2215 0073;;;;N;SQUARED M OVER S;;;;
+33A8;SQUARE M OVER S SQUARED;So;0;L;<square> 006D 2215 0073 00B2;;;;N;SQUARED M OVER S SQUARED;;;;
+33A9;SQUARE PA;So;0;L;<square> 0050 0061;;;;N;SQUARED PA;;;;
+33AA;SQUARE KPA;So;0;L;<square> 006B 0050 0061;;;;N;SQUARED KPA;;;;
+33AB;SQUARE MPA;So;0;L;<square> 004D 0050 0061;;;;N;SQUARED MPA;;;;
+33AC;SQUARE GPA;So;0;L;<square> 0047 0050 0061;;;;N;SQUARED GPA;;;;
+33AD;SQUARE RAD;So;0;L;<square> 0072 0061 0064;;;;N;SQUARED RAD;;;;
+33AE;SQUARE RAD OVER S;So;0;L;<square> 0072 0061 0064 2215 0073;;;;N;SQUARED RAD OVER S;;;;
+33AF;SQUARE RAD OVER S SQUARED;So;0;L;<square> 0072 0061 0064 2215 0073 00B2;;;;N;SQUARED RAD OVER S SQUARED;;;;
+33B0;SQUARE PS;So;0;L;<square> 0070 0073;;;;N;SQUARED PS;;;;
+33B1;SQUARE NS;So;0;L;<square> 006E 0073;;;;N;SQUARED NS;;;;
+33B2;SQUARE MU S;So;0;L;<square> 03BC 0073;;;;N;SQUARED MU S;;;;
+33B3;SQUARE MS;So;0;L;<square> 006D 0073;;;;N;SQUARED MS;;;;
+33B4;SQUARE PV;So;0;L;<square> 0070 0056;;;;N;SQUARED PV;;;;
+33B5;SQUARE NV;So;0;L;<square> 006E 0056;;;;N;SQUARED NV;;;;
+33B6;SQUARE MU V;So;0;L;<square> 03BC 0056;;;;N;SQUARED MU V;;;;
+33B7;SQUARE MV;So;0;L;<square> 006D 0056;;;;N;SQUARED MV;;;;
+33B8;SQUARE KV;So;0;L;<square> 006B 0056;;;;N;SQUARED KV;;;;
+33B9;SQUARE MV MEGA;So;0;L;<square> 004D 0056;;;;N;SQUARED MV MEGA;;;;
+33BA;SQUARE PW;So;0;L;<square> 0070 0057;;;;N;SQUARED PW;;;;
+33BB;SQUARE NW;So;0;L;<square> 006E 0057;;;;N;SQUARED NW;;;;
+33BC;SQUARE MU W;So;0;L;<square> 03BC 0057;;;;N;SQUARED MU W;;;;
+33BD;SQUARE MW;So;0;L;<square> 006D 0057;;;;N;SQUARED MW;;;;
+33BE;SQUARE KW;So;0;L;<square> 006B 0057;;;;N;SQUARED KW;;;;
+33BF;SQUARE MW MEGA;So;0;L;<square> 004D 0057;;;;N;SQUARED MW MEGA;;;;
+33C0;SQUARE K OHM;So;0;L;<square> 006B 03A9;;;;N;SQUARED K OHM;;;;
+33C1;SQUARE M OHM;So;0;L;<square> 004D 03A9;;;;N;SQUARED M OHM;;;;
+33C2;SQUARE AM;So;0;L;<square> 0061 002E 006D 002E;;;;N;SQUARED AM;;;;
+33C3;SQUARE BQ;So;0;L;<square> 0042 0071;;;;N;SQUARED BQ;;;;
+33C4;SQUARE CC;So;0;L;<square> 0063 0063;;;;N;SQUARED CC;;;;
+33C5;SQUARE CD;So;0;L;<square> 0063 0064;;;;N;SQUARED CD;;;;
+33C6;SQUARE C OVER KG;So;0;L;<square> 0043 2215 006B 0067;;;;N;SQUARED C OVER KG;;;;
+33C7;SQUARE CO;So;0;L;<square> 0043 006F 002E;;;;N;SQUARED CO;;;;
+33C8;SQUARE DB;So;0;L;<square> 0064 0042;;;;N;SQUARED DB;;;;
+33C9;SQUARE GY;So;0;L;<square> 0047 0079;;;;N;SQUARED GY;;;;
+33CA;SQUARE HA;So;0;L;<square> 0068 0061;;;;N;SQUARED HA;;;;
+33CB;SQUARE HP;So;0;L;<square> 0048 0050;;;;N;SQUARED HP;;;;
+33CC;SQUARE IN;So;0;L;<square> 0069 006E;;;;N;SQUARED IN;;;;
+33CD;SQUARE KK;So;0;L;<square> 004B 004B;;;;N;SQUARED KK;;;;
+33CE;SQUARE KM CAPITAL;So;0;L;<square> 004B 004D;;;;N;SQUARED KM CAPITAL;;;;
+33CF;SQUARE KT;So;0;L;<square> 006B 0074;;;;N;SQUARED KT;;;;
+33D0;SQUARE LM;So;0;L;<square> 006C 006D;;;;N;SQUARED LM;;;;
+33D1;SQUARE LN;So;0;L;<square> 006C 006E;;;;N;SQUARED LN;;;;
+33D2;SQUARE LOG;So;0;L;<square> 006C 006F 0067;;;;N;SQUARED LOG;;;;
+33D3;SQUARE LX;So;0;L;<square> 006C 0078;;;;N;SQUARED LX;;;;
+33D4;SQUARE MB SMALL;So;0;L;<square> 006D 0062;;;;N;SQUARED MB SMALL;;;;
+33D5;SQUARE MIL;So;0;L;<square> 006D 0069 006C;;;;N;SQUARED MIL;;;;
+33D6;SQUARE MOL;So;0;L;<square> 006D 006F 006C;;;;N;SQUARED MOL;;;;
+33D7;SQUARE PH;So;0;L;<square> 0050 0048;;;;N;SQUARED PH;;;;
+33D8;SQUARE PM;So;0;L;<square> 0070 002E 006D 002E;;;;N;SQUARED PM;;;;
+33D9;SQUARE PPM;So;0;L;<square> 0050 0050 004D;;;;N;SQUARED PPM;;;;
+33DA;SQUARE PR;So;0;L;<square> 0050 0052;;;;N;SQUARED PR;;;;
+33DB;SQUARE SR;So;0;L;<square> 0073 0072;;;;N;SQUARED SR;;;;
+33DC;SQUARE SV;So;0;L;<square> 0053 0076;;;;N;SQUARED SV;;;;
+33DD;SQUARE WB;So;0;L;<square> 0057 0062;;;;N;SQUARED WB;;;;
+33DE;SQUARE V OVER M;So;0;ON;<square> 0056 2215 006D;;;;N;;;;;
+33DF;SQUARE A OVER M;So;0;ON;<square> 0041 2215 006D;;;;N;;;;;
+33E0;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY ONE;So;0;L;<compat> 0031 65E5;;;;N;;;;;
+33E1;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY TWO;So;0;L;<compat> 0032 65E5;;;;N;;;;;
+33E2;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY THREE;So;0;L;<compat> 0033 65E5;;;;N;;;;;
+33E3;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY FOUR;So;0;L;<compat> 0034 65E5;;;;N;;;;;
+33E4;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY FIVE;So;0;L;<compat> 0035 65E5;;;;N;;;;;
+33E5;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY SIX;So;0;L;<compat> 0036 65E5;;;;N;;;;;
+33E6;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY SEVEN;So;0;L;<compat> 0037 65E5;;;;N;;;;;
+33E7;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY EIGHT;So;0;L;<compat> 0038 65E5;;;;N;;;;;
+33E8;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY NINE;So;0;L;<compat> 0039 65E5;;;;N;;;;;
+33E9;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY TEN;So;0;L;<compat> 0031 0030 65E5;;;;N;;;;;
+33EA;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY ELEVEN;So;0;L;<compat> 0031 0031 65E5;;;;N;;;;;
+33EB;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY TWELVE;So;0;L;<compat> 0031 0032 65E5;;;;N;;;;;
+33EC;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY THIRTEEN;So;0;L;<compat> 0031 0033 65E5;;;;N;;;;;
+33ED;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY FOURTEEN;So;0;L;<compat> 0031 0034 65E5;;;;N;;;;;
+33EE;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY FIFTEEN;So;0;L;<compat> 0031 0035 65E5;;;;N;;;;;
+33EF;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY SIXTEEN;So;0;L;<compat> 0031 0036 65E5;;;;N;;;;;
+33F0;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY SEVENTEEN;So;0;L;<compat> 0031 0037 65E5;;;;N;;;;;
+33F1;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY EIGHTEEN;So;0;L;<compat> 0031 0038 65E5;;;;N;;;;;
+33F2;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY NINETEEN;So;0;L;<compat> 0031 0039 65E5;;;;N;;;;;
+33F3;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY TWENTY;So;0;L;<compat> 0032 0030 65E5;;;;N;;;;;
+33F4;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY TWENTY-ONE;So;0;L;<compat> 0032 0031 65E5;;;;N;;;;;
+33F5;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY TWENTY-TWO;So;0;L;<compat> 0032 0032 65E5;;;;N;;;;;
+33F6;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY TWENTY-THREE;So;0;L;<compat> 0032 0033 65E5;;;;N;;;;;
+33F7;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY TWENTY-FOUR;So;0;L;<compat> 0032 0034 65E5;;;;N;;;;;
+33F8;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY TWENTY-FIVE;So;0;L;<compat> 0032 0035 65E5;;;;N;;;;;
+33F9;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY TWENTY-SIX;So;0;L;<compat> 0032 0036 65E5;;;;N;;;;;
+33FA;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY TWENTY-SEVEN;So;0;L;<compat> 0032 0037 65E5;;;;N;;;;;
+33FB;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY TWENTY-EIGHT;So;0;L;<compat> 0032 0038 65E5;;;;N;;;;;
+33FC;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY TWENTY-NINE;So;0;L;<compat> 0032 0039 65E5;;;;N;;;;;
+33FD;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY THIRTY;So;0;L;<compat> 0033 0030 65E5;;;;N;;;;;
+33FE;IDEOGRAPHIC TELEGRAPH SYMBOL FOR DAY THIRTY-ONE;So;0;L;<compat> 0033 0031 65E5;;;;N;;;;;
+33FF;SQUARE GAL;So;0;ON;<square> 0067 0061 006C;;;;N;;;;;
+3400;<CJK Ideograph Extension A, First>;Lo;0;L;;;;;N;;;;;
+4DB5;<CJK Ideograph Extension A, Last>;Lo;0;L;;;;;N;;;;;
+4DC0;HEXAGRAM FOR THE CREATIVE HEAVEN;So;0;ON;;;;;N;;;;;
+4DC1;HEXAGRAM FOR THE RECEPTIVE EARTH;So;0;ON;;;;;N;;;;;
+4DC2;HEXAGRAM FOR DIFFICULTY AT THE BEGINNING;So;0;ON;;;;;N;;;;;
+4DC3;HEXAGRAM FOR YOUTHFUL FOLLY;So;0;ON;;;;;N;;;;;
+4DC4;HEXAGRAM FOR WAITING;So;0;ON;;;;;N;;;;;
+4DC5;HEXAGRAM FOR CONFLICT;So;0;ON;;;;;N;;;;;
+4DC6;HEXAGRAM FOR THE ARMY;So;0;ON;;;;;N;;;;;
+4DC7;HEXAGRAM FOR HOLDING TOGETHER;So;0;ON;;;;;N;;;;;
+4DC8;HEXAGRAM FOR SMALL TAMING;So;0;ON;;;;;N;;;;;
+4DC9;HEXAGRAM FOR TREADING;So;0;ON;;;;;N;;;;;
+4DCA;HEXAGRAM FOR PEACE;So;0;ON;;;;;N;;;;;
+4DCB;HEXAGRAM FOR STANDSTILL;So;0;ON;;;;;N;;;;;
+4DCC;HEXAGRAM FOR FELLOWSHIP;So;0;ON;;;;;N;;;;;
+4DCD;HEXAGRAM FOR GREAT POSSESSION;So;0;ON;;;;;N;;;;;
+4DCE;HEXAGRAM FOR MODESTY;So;0;ON;;;;;N;;;;;
+4DCF;HEXAGRAM FOR ENTHUSIASM;So;0;ON;;;;;N;;;;;
+4DD0;HEXAGRAM FOR FOLLOWING;So;0;ON;;;;;N;;;;;
+4DD1;HEXAGRAM FOR WORK ON THE DECAYED;So;0;ON;;;;;N;;;;;
+4DD2;HEXAGRAM FOR APPROACH;So;0;ON;;;;;N;;;;;
+4DD3;HEXAGRAM FOR CONTEMPLATION;So;0;ON;;;;;N;;;;;
+4DD4;HEXAGRAM FOR BITING THROUGH;So;0;ON;;;;;N;;;;;
+4DD5;HEXAGRAM FOR GRACE;So;0;ON;;;;;N;;;;;
+4DD6;HEXAGRAM FOR SPLITTING APART;So;0;ON;;;;;N;;;;;
+4DD7;HEXAGRAM FOR RETURN;So;0;ON;;;;;N;;;;;
+4DD8;HEXAGRAM FOR INNOCENCE;So;0;ON;;;;;N;;;;;
+4DD9;HEXAGRAM FOR GREAT TAMING;So;0;ON;;;;;N;;;;;
+4DDA;HEXAGRAM FOR MOUTH CORNERS;So;0;ON;;;;;N;;;;;
+4DDB;HEXAGRAM FOR GREAT PREPONDERANCE;So;0;ON;;;;;N;;;;;
+4DDC;HEXAGRAM FOR THE ABYSMAL WATER;So;0;ON;;;;;N;;;;;
+4DDD;HEXAGRAM FOR THE CLINGING FIRE;So;0;ON;;;;;N;;;;;
+4DDE;HEXAGRAM FOR INFLUENCE;So;0;ON;;;;;N;;;;;
+4DDF;HEXAGRAM FOR DURATION;So;0;ON;;;;;N;;;;;
+4DE0;HEXAGRAM FOR RETREAT;So;0;ON;;;;;N;;;;;
+4DE1;HEXAGRAM FOR GREAT POWER;So;0;ON;;;;;N;;;;;
+4DE2;HEXAGRAM FOR PROGRESS;So;0;ON;;;;;N;;;;;
+4DE3;HEXAGRAM FOR DARKENING OF THE LIGHT;So;0;ON;;;;;N;;;;;
+4DE4;HEXAGRAM FOR THE FAMILY;So;0;ON;;;;;N;;;;;
+4DE5;HEXAGRAM FOR OPPOSITION;So;0;ON;;;;;N;;;;;
+4DE6;HEXAGRAM FOR OBSTRUCTION;So;0;ON;;;;;N;;;;;
+4DE7;HEXAGRAM FOR DELIVERANCE;So;0;ON;;;;;N;;;;;
+4DE8;HEXAGRAM FOR DECREASE;So;0;ON;;;;;N;;;;;
+4DE9;HEXAGRAM FOR INCREASE;So;0;ON;;;;;N;;;;;
+4DEA;HEXAGRAM FOR BREAKTHROUGH;So;0;ON;;;;;N;;;;;
+4DEB;HEXAGRAM FOR COMING TO MEET;So;0;ON;;;;;N;;;;;
+4DEC;HEXAGRAM FOR GATHERING TOGETHER;So;0;ON;;;;;N;;;;;
+4DED;HEXAGRAM FOR PUSHING UPWARD;So;0;ON;;;;;N;;;;;
+4DEE;HEXAGRAM FOR OPPRESSION;So;0;ON;;;;;N;;;;;
+4DEF;HEXAGRAM FOR THE WELL;So;0;ON;;;;;N;;;;;
+4DF0;HEXAGRAM FOR REVOLUTION;So;0;ON;;;;;N;;;;;
+4DF1;HEXAGRAM FOR THE CAULDRON;So;0;ON;;;;;N;;;;;
+4DF2;HEXAGRAM FOR THE AROUSING THUNDER;So;0;ON;;;;;N;;;;;
+4DF3;HEXAGRAM FOR THE KEEPING STILL MOUNTAIN;So;0;ON;;;;;N;;;;;
+4DF4;HEXAGRAM FOR DEVELOPMENT;So;0;ON;;;;;N;;;;;
+4DF5;HEXAGRAM FOR THE MARRYING MAIDEN;So;0;ON;;;;;N;;;;;
+4DF6;HEXAGRAM FOR ABUNDANCE;So;0;ON;;;;;N;;;;;
+4DF7;HEXAGRAM FOR THE WANDERER;So;0;ON;;;;;N;;;;;
+4DF8;HEXAGRAM FOR THE GENTLE WIND;So;0;ON;;;;;N;;;;;
+4DF9;HEXAGRAM FOR THE JOYOUS LAKE;So;0;ON;;;;;N;;;;;
+4DFA;HEXAGRAM FOR DISPERSION;So;0;ON;;;;;N;;;;;
+4DFB;HEXAGRAM FOR LIMITATION;So;0;ON;;;;;N;;;;;
+4DFC;HEXAGRAM FOR INNER TRUTH;So;0;ON;;;;;N;;;;;
+4DFD;HEXAGRAM FOR SMALL PREPONDERANCE;So;0;ON;;;;;N;;;;;
+4DFE;HEXAGRAM FOR AFTER COMPLETION;So;0;ON;;;;;N;;;;;
+4DFF;HEXAGRAM FOR BEFORE COMPLETION;So;0;ON;;;;;N;;;;;
+4E00;<CJK Ideograph, First>;Lo;0;L;;;;;N;;;;;
+9FEA;<CJK Ideograph, Last>;Lo;0;L;;;;;N;;;;;
+A000;YI SYLLABLE IT;Lo;0;L;;;;;N;;;;;
+A001;YI SYLLABLE IX;Lo;0;L;;;;;N;;;;;
+A002;YI SYLLABLE I;Lo;0;L;;;;;N;;;;;
+A003;YI SYLLABLE IP;Lo;0;L;;;;;N;;;;;
+A004;YI SYLLABLE IET;Lo;0;L;;;;;N;;;;;
+A005;YI SYLLABLE IEX;Lo;0;L;;;;;N;;;;;
+A006;YI SYLLABLE IE;Lo;0;L;;;;;N;;;;;
+A007;YI SYLLABLE IEP;Lo;0;L;;;;;N;;;;;
+A008;YI SYLLABLE AT;Lo;0;L;;;;;N;;;;;
+A009;YI SYLLABLE AX;Lo;0;L;;;;;N;;;;;
+A00A;YI SYLLABLE A;Lo;0;L;;;;;N;;;;;
+A00B;YI SYLLABLE AP;Lo;0;L;;;;;N;;;;;
+A00C;YI SYLLABLE UOX;Lo;0;L;;;;;N;;;;;
+A00D;YI SYLLABLE UO;Lo;0;L;;;;;N;;;;;
+A00E;YI SYLLABLE UOP;Lo;0;L;;;;;N;;;;;
+A00F;YI SYLLABLE OT;Lo;0;L;;;;;N;;;;;
+A010;YI SYLLABLE OX;Lo;0;L;;;;;N;;;;;
+A011;YI SYLLABLE O;Lo;0;L;;;;;N;;;;;
+A012;YI SYLLABLE OP;Lo;0;L;;;;;N;;;;;
+A013;YI SYLLABLE EX;Lo;0;L;;;;;N;;;;;
+A014;YI SYLLABLE E;Lo;0;L;;;;;N;;;;;
+A015;YI SYLLABLE WU;Lm;0;L;;;;;N;;;;;
+A016;YI SYLLABLE BIT;Lo;0;L;;;;;N;;;;;
+A017;YI SYLLABLE BIX;Lo;0;L;;;;;N;;;;;
+A018;YI SYLLABLE BI;Lo;0;L;;;;;N;;;;;
+A019;YI SYLLABLE BIP;Lo;0;L;;;;;N;;;;;
+A01A;YI SYLLABLE BIET;Lo;0;L;;;;;N;;;;;
+A01B;YI SYLLABLE BIEX;Lo;0;L;;;;;N;;;;;
+A01C;YI SYLLABLE BIE;Lo;0;L;;;;;N;;;;;
+A01D;YI SYLLABLE BIEP;Lo;0;L;;;;;N;;;;;
+A01E;YI SYLLABLE BAT;Lo;0;L;;;;;N;;;;;
+A01F;YI SYLLABLE BAX;Lo;0;L;;;;;N;;;;;
+A020;YI SYLLABLE BA;Lo;0;L;;;;;N;;;;;
+A021;YI SYLLABLE BAP;Lo;0;L;;;;;N;;;;;
+A022;YI SYLLABLE BUOX;Lo;0;L;;;;;N;;;;;
+A023;YI SYLLABLE BUO;Lo;0;L;;;;;N;;;;;
+A024;YI SYLLABLE BUOP;Lo;0;L;;;;;N;;;;;
+A025;YI SYLLABLE BOT;Lo;0;L;;;;;N;;;;;
+A026;YI SYLLABLE BOX;Lo;0;L;;;;;N;;;;;
+A027;YI SYLLABLE BO;Lo;0;L;;;;;N;;;;;
+A028;YI SYLLABLE BOP;Lo;0;L;;;;;N;;;;;
+A029;YI SYLLABLE BEX;Lo;0;L;;;;;N;;;;;
+A02A;YI SYLLABLE BE;Lo;0;L;;;;;N;;;;;
+A02B;YI SYLLABLE BEP;Lo;0;L;;;;;N;;;;;
+A02C;YI SYLLABLE BUT;Lo;0;L;;;;;N;;;;;
+A02D;YI SYLLABLE BUX;Lo;0;L;;;;;N;;;;;
+A02E;YI SYLLABLE BU;Lo;0;L;;;;;N;;;;;
+A02F;YI SYLLABLE BUP;Lo;0;L;;;;;N;;;;;
+A030;YI SYLLABLE BURX;Lo;0;L;;;;;N;;;;;
+A031;YI SYLLABLE BUR;Lo;0;L;;;;;N;;;;;
+A032;YI SYLLABLE BYT;Lo;0;L;;;;;N;;;;;
+A033;YI SYLLABLE BYX;Lo;0;L;;;;;N;;;;;
+A034;YI SYLLABLE BY;Lo;0;L;;;;;N;;;;;
+A035;YI SYLLABLE BYP;Lo;0;L;;;;;N;;;;;
+A036;YI SYLLABLE BYRX;Lo;0;L;;;;;N;;;;;
+A037;YI SYLLABLE BYR;Lo;0;L;;;;;N;;;;;
+A038;YI SYLLABLE PIT;Lo;0;L;;;;;N;;;;;
+A039;YI SYLLABLE PIX;Lo;0;L;;;;;N;;;;;
+A03A;YI SYLLABLE PI;Lo;0;L;;;;;N;;;;;
+A03B;YI SYLLABLE PIP;Lo;0;L;;;;;N;;;;;
+A03C;YI SYLLABLE PIEX;Lo;0;L;;;;;N;;;;;
+A03D;YI SYLLABLE PIE;Lo;0;L;;;;;N;;;;;
+A03E;YI SYLLABLE PIEP;Lo;0;L;;;;;N;;;;;
+A03F;YI SYLLABLE PAT;Lo;0;L;;;;;N;;;;;
+A040;YI SYLLABLE PAX;Lo;0;L;;;;;N;;;;;
+A041;YI SYLLABLE PA;Lo;0;L;;;;;N;;;;;
+A042;YI SYLLABLE PAP;Lo;0;L;;;;;N;;;;;
+A043;YI SYLLABLE PUOX;Lo;0;L;;;;;N;;;;;
+A044;YI SYLLABLE PUO;Lo;0;L;;;;;N;;;;;
+A045;YI SYLLABLE PUOP;Lo;0;L;;;;;N;;;;;
+A046;YI SYLLABLE POT;Lo;0;L;;;;;N;;;;;
+A047;YI SYLLABLE POX;Lo;0;L;;;;;N;;;;;
+A048;YI SYLLABLE PO;Lo;0;L;;;;;N;;;;;
+A049;YI SYLLABLE POP;Lo;0;L;;;;;N;;;;;
+A04A;YI SYLLABLE PUT;Lo;0;L;;;;;N;;;;;
+A04B;YI SYLLABLE PUX;Lo;0;L;;;;;N;;;;;
+A04C;YI SYLLABLE PU;Lo;0;L;;;;;N;;;;;
+A04D;YI SYLLABLE PUP;Lo;0;L;;;;;N;;;;;
+A04E;YI SYLLABLE PURX;Lo;0;L;;;;;N;;;;;
+A04F;YI SYLLABLE PUR;Lo;0;L;;;;;N;;;;;
+A050;YI SYLLABLE PYT;Lo;0;L;;;;;N;;;;;
+A051;YI SYLLABLE PYX;Lo;0;L;;;;;N;;;;;
+A052;YI SYLLABLE PY;Lo;0;L;;;;;N;;;;;
+A053;YI SYLLABLE PYP;Lo;0;L;;;;;N;;;;;
+A054;YI SYLLABLE PYRX;Lo;0;L;;;;;N;;;;;
+A055;YI SYLLABLE PYR;Lo;0;L;;;;;N;;;;;
+A056;YI SYLLABLE BBIT;Lo;0;L;;;;;N;;;;;
+A057;YI SYLLABLE BBIX;Lo;0;L;;;;;N;;;;;
+A058;YI SYLLABLE BBI;Lo;0;L;;;;;N;;;;;
+A059;YI SYLLABLE BBIP;Lo;0;L;;;;;N;;;;;
+A05A;YI SYLLABLE BBIET;Lo;0;L;;;;;N;;;;;
+A05B;YI SYLLABLE BBIEX;Lo;0;L;;;;;N;;;;;
+A05C;YI SYLLABLE BBIE;Lo;0;L;;;;;N;;;;;
+A05D;YI SYLLABLE BBIEP;Lo;0;L;;;;;N;;;;;
+A05E;YI SYLLABLE BBAT;Lo;0;L;;;;;N;;;;;
+A05F;YI SYLLABLE BBAX;Lo;0;L;;;;;N;;;;;
+A060;YI SYLLABLE BBA;Lo;0;L;;;;;N;;;;;
+A061;YI SYLLABLE BBAP;Lo;0;L;;;;;N;;;;;
+A062;YI SYLLABLE BBUOX;Lo;0;L;;;;;N;;;;;
+A063;YI SYLLABLE BBUO;Lo;0;L;;;;;N;;;;;
+A064;YI SYLLABLE BBUOP;Lo;0;L;;;;;N;;;;;
+A065;YI SYLLABLE BBOT;Lo;0;L;;;;;N;;;;;
+A066;YI SYLLABLE BBOX;Lo;0;L;;;;;N;;;;;
+A067;YI SYLLABLE BBO;Lo;0;L;;;;;N;;;;;
+A068;YI SYLLABLE BBOP;Lo;0;L;;;;;N;;;;;
+A069;YI SYLLABLE BBEX;Lo;0;L;;;;;N;;;;;
+A06A;YI SYLLABLE BBE;Lo;0;L;;;;;N;;;;;
+A06B;YI SYLLABLE BBEP;Lo;0;L;;;;;N;;;;;
+A06C;YI SYLLABLE BBUT;Lo;0;L;;;;;N;;;;;
+A06D;YI SYLLABLE BBUX;Lo;0;L;;;;;N;;;;;
+A06E;YI SYLLABLE BBU;Lo;0;L;;;;;N;;;;;
+A06F;YI SYLLABLE BBUP;Lo;0;L;;;;;N;;;;;
+A070;YI SYLLABLE BBURX;Lo;0;L;;;;;N;;;;;
+A071;YI SYLLABLE BBUR;Lo;0;L;;;;;N;;;;;
+A072;YI SYLLABLE BBYT;Lo;0;L;;;;;N;;;;;
+A073;YI SYLLABLE BBYX;Lo;0;L;;;;;N;;;;;
+A074;YI SYLLABLE BBY;Lo;0;L;;;;;N;;;;;
+A075;YI SYLLABLE BBYP;Lo;0;L;;;;;N;;;;;
+A076;YI SYLLABLE NBIT;Lo;0;L;;;;;N;;;;;
+A077;YI SYLLABLE NBIX;Lo;0;L;;;;;N;;;;;
+A078;YI SYLLABLE NBI;Lo;0;L;;;;;N;;;;;
+A079;YI SYLLABLE NBIP;Lo;0;L;;;;;N;;;;;
+A07A;YI SYLLABLE NBIEX;Lo;0;L;;;;;N;;;;;
+A07B;YI SYLLABLE NBIE;Lo;0;L;;;;;N;;;;;
+A07C;YI SYLLABLE NBIEP;Lo;0;L;;;;;N;;;;;
+A07D;YI SYLLABLE NBAT;Lo;0;L;;;;;N;;;;;
+A07E;YI SYLLABLE NBAX;Lo;0;L;;;;;N;;;;;
+A07F;YI SYLLABLE NBA;Lo;0;L;;;;;N;;;;;
+A080;YI SYLLABLE NBAP;Lo;0;L;;;;;N;;;;;
+A081;YI SYLLABLE NBOT;Lo;0;L;;;;;N;;;;;
+A082;YI SYLLABLE NBOX;Lo;0;L;;;;;N;;;;;
+A083;YI SYLLABLE NBO;Lo;0;L;;;;;N;;;;;
+A084;YI SYLLABLE NBOP;Lo;0;L;;;;;N;;;;;
+A085;YI SYLLABLE NBUT;Lo;0;L;;;;;N;;;;;
+A086;YI SYLLABLE NBUX;Lo;0;L;;;;;N;;;;;
+A087;YI SYLLABLE NBU;Lo;0;L;;;;;N;;;;;
+A088;YI SYLLABLE NBUP;Lo;0;L;;;;;N;;;;;
+A089;YI SYLLABLE NBURX;Lo;0;L;;;;;N;;;;;
+A08A;YI SYLLABLE NBUR;Lo;0;L;;;;;N;;;;;
+A08B;YI SYLLABLE NBYT;Lo;0;L;;;;;N;;;;;
+A08C;YI SYLLABLE NBYX;Lo;0;L;;;;;N;;;;;
+A08D;YI SYLLABLE NBY;Lo;0;L;;;;;N;;;;;
+A08E;YI SYLLABLE NBYP;Lo;0;L;;;;;N;;;;;
+A08F;YI SYLLABLE NBYRX;Lo;0;L;;;;;N;;;;;
+A090;YI SYLLABLE NBYR;Lo;0;L;;;;;N;;;;;
+A091;YI SYLLABLE HMIT;Lo;0;L;;;;;N;;;;;
+A092;YI SYLLABLE HMIX;Lo;0;L;;;;;N;;;;;
+A093;YI SYLLABLE HMI;Lo;0;L;;;;;N;;;;;
+A094;YI SYLLABLE HMIP;Lo;0;L;;;;;N;;;;;
+A095;YI SYLLABLE HMIEX;Lo;0;L;;;;;N;;;;;
+A096;YI SYLLABLE HMIE;Lo;0;L;;;;;N;;;;;
+A097;YI SYLLABLE HMIEP;Lo;0;L;;;;;N;;;;;
+A098;YI SYLLABLE HMAT;Lo;0;L;;;;;N;;;;;
+A099;YI SYLLABLE HMAX;Lo;0;L;;;;;N;;;;;
+A09A;YI SYLLABLE HMA;Lo;0;L;;;;;N;;;;;
+A09B;YI SYLLABLE HMAP;Lo;0;L;;;;;N;;;;;
+A09C;YI SYLLABLE HMUOX;Lo;0;L;;;;;N;;;;;
+A09D;YI SYLLABLE HMUO;Lo;0;L;;;;;N;;;;;
+A09E;YI SYLLABLE HMUOP;Lo;0;L;;;;;N;;;;;
+A09F;YI SYLLABLE HMOT;Lo;0;L;;;;;N;;;;;
+A0A0;YI SYLLABLE HMOX;Lo;0;L;;;;;N;;;;;
+A0A1;YI SYLLABLE HMO;Lo;0;L;;;;;N;;;;;
+A0A2;YI SYLLABLE HMOP;Lo;0;L;;;;;N;;;;;
+A0A3;YI SYLLABLE HMUT;Lo;0;L;;;;;N;;;;;
+A0A4;YI SYLLABLE HMUX;Lo;0;L;;;;;N;;;;;
+A0A5;YI SYLLABLE HMU;Lo;0;L;;;;;N;;;;;
+A0A6;YI SYLLABLE HMUP;Lo;0;L;;;;;N;;;;;
+A0A7;YI SYLLABLE HMURX;Lo;0;L;;;;;N;;;;;
+A0A8;YI SYLLABLE HMUR;Lo;0;L;;;;;N;;;;;
+A0A9;YI SYLLABLE HMYX;Lo;0;L;;;;;N;;;;;
+A0AA;YI SYLLABLE HMY;Lo;0;L;;;;;N;;;;;
+A0AB;YI SYLLABLE HMYP;Lo;0;L;;;;;N;;;;;
+A0AC;YI SYLLABLE HMYRX;Lo;0;L;;;;;N;;;;;
+A0AD;YI SYLLABLE HMYR;Lo;0;L;;;;;N;;;;;
+A0AE;YI SYLLABLE MIT;Lo;0;L;;;;;N;;;;;
+A0AF;YI SYLLABLE MIX;Lo;0;L;;;;;N;;;;;
+A0B0;YI SYLLABLE MI;Lo;0;L;;;;;N;;;;;
+A0B1;YI SYLLABLE MIP;Lo;0;L;;;;;N;;;;;
+A0B2;YI SYLLABLE MIEX;Lo;0;L;;;;;N;;;;;
+A0B3;YI SYLLABLE MIE;Lo;0;L;;;;;N;;;;;
+A0B4;YI SYLLABLE MIEP;Lo;0;L;;;;;N;;;;;
+A0B5;YI SYLLABLE MAT;Lo;0;L;;;;;N;;;;;
+A0B6;YI SYLLABLE MAX;Lo;0;L;;;;;N;;;;;
+A0B7;YI SYLLABLE MA;Lo;0;L;;;;;N;;;;;
+A0B8;YI SYLLABLE MAP;Lo;0;L;;;;;N;;;;;
+A0B9;YI SYLLABLE MUOT;Lo;0;L;;;;;N;;;;;
+A0BA;YI SYLLABLE MUOX;Lo;0;L;;;;;N;;;;;
+A0BB;YI SYLLABLE MUO;Lo;0;L;;;;;N;;;;;
+A0BC;YI SYLLABLE MUOP;Lo;0;L;;;;;N;;;;;
+A0BD;YI SYLLABLE MOT;Lo;0;L;;;;;N;;;;;
+A0BE;YI SYLLABLE MOX;Lo;0;L;;;;;N;;;;;
+A0BF;YI SYLLABLE MO;Lo;0;L;;;;;N;;;;;
+A0C0;YI SYLLABLE MOP;Lo;0;L;;;;;N;;;;;
+A0C1;YI SYLLABLE MEX;Lo;0;L;;;;;N;;;;;
+A0C2;YI SYLLABLE ME;Lo;0;L;;;;;N;;;;;
+A0C3;YI SYLLABLE MUT;Lo;0;L;;;;;N;;;;;
+A0C4;YI SYLLABLE MUX;Lo;0;L;;;;;N;;;;;
+A0C5;YI SYLLABLE MU;Lo;0;L;;;;;N;;;;;
+A0C6;YI SYLLABLE MUP;Lo;0;L;;;;;N;;;;;
+A0C7;YI SYLLABLE MURX;Lo;0;L;;;;;N;;;;;
+A0C8;YI SYLLABLE MUR;Lo;0;L;;;;;N;;;;;
+A0C9;YI SYLLABLE MYT;Lo;0;L;;;;;N;;;;;
+A0CA;YI SYLLABLE MYX;Lo;0;L;;;;;N;;;;;
+A0CB;YI SYLLABLE MY;Lo;0;L;;;;;N;;;;;
+A0CC;YI SYLLABLE MYP;Lo;0;L;;;;;N;;;;;
+A0CD;YI SYLLABLE FIT;Lo;0;L;;;;;N;;;;;
+A0CE;YI SYLLABLE FIX;Lo;0;L;;;;;N;;;;;
+A0CF;YI SYLLABLE FI;Lo;0;L;;;;;N;;;;;
+A0D0;YI SYLLABLE FIP;Lo;0;L;;;;;N;;;;;
+A0D1;YI SYLLABLE FAT;Lo;0;L;;;;;N;;;;;
+A0D2;YI SYLLABLE FAX;Lo;0;L;;;;;N;;;;;
+A0D3;YI SYLLABLE FA;Lo;0;L;;;;;N;;;;;
+A0D4;YI SYLLABLE FAP;Lo;0;L;;;;;N;;;;;
+A0D5;YI SYLLABLE FOX;Lo;0;L;;;;;N;;;;;
+A0D6;YI SYLLABLE FO;Lo;0;L;;;;;N;;;;;
+A0D7;YI SYLLABLE FOP;Lo;0;L;;;;;N;;;;;
+A0D8;YI SYLLABLE FUT;Lo;0;L;;;;;N;;;;;
+A0D9;YI SYLLABLE FUX;Lo;0;L;;;;;N;;;;;
+A0DA;YI SYLLABLE FU;Lo;0;L;;;;;N;;;;;
+A0DB;YI SYLLABLE FUP;Lo;0;L;;;;;N;;;;;
+A0DC;YI SYLLABLE FURX;Lo;0;L;;;;;N;;;;;
+A0DD;YI SYLLABLE FUR;Lo;0;L;;;;;N;;;;;
+A0DE;YI SYLLABLE FYT;Lo;0;L;;;;;N;;;;;
+A0DF;YI SYLLABLE FYX;Lo;0;L;;;;;N;;;;;
+A0E0;YI SYLLABLE FY;Lo;0;L;;;;;N;;;;;
+A0E1;YI SYLLABLE FYP;Lo;0;L;;;;;N;;;;;
+A0E2;YI SYLLABLE VIT;Lo;0;L;;;;;N;;;;;
+A0E3;YI SYLLABLE VIX;Lo;0;L;;;;;N;;;;;
+A0E4;YI SYLLABLE VI;Lo;0;L;;;;;N;;;;;
+A0E5;YI SYLLABLE VIP;Lo;0;L;;;;;N;;;;;
+A0E6;YI SYLLABLE VIET;Lo;0;L;;;;;N;;;;;
+A0E7;YI SYLLABLE VIEX;Lo;0;L;;;;;N;;;;;
+A0E8;YI SYLLABLE VIE;Lo;0;L;;;;;N;;;;;
+A0E9;YI SYLLABLE VIEP;Lo;0;L;;;;;N;;;;;
+A0EA;YI SYLLABLE VAT;Lo;0;L;;;;;N;;;;;
+A0EB;YI SYLLABLE VAX;Lo;0;L;;;;;N;;;;;
+A0EC;YI SYLLABLE VA;Lo;0;L;;;;;N;;;;;
+A0ED;YI SYLLABLE VAP;Lo;0;L;;;;;N;;;;;
+A0EE;YI SYLLABLE VOT;Lo;0;L;;;;;N;;;;;
+A0EF;YI SYLLABLE VOX;Lo;0;L;;;;;N;;;;;
+A0F0;YI SYLLABLE VO;Lo;0;L;;;;;N;;;;;
+A0F1;YI SYLLABLE VOP;Lo;0;L;;;;;N;;;;;
+A0F2;YI SYLLABLE VEX;Lo;0;L;;;;;N;;;;;
+A0F3;YI SYLLABLE VEP;Lo;0;L;;;;;N;;;;;
+A0F4;YI SYLLABLE VUT;Lo;0;L;;;;;N;;;;;
+A0F5;YI SYLLABLE VUX;Lo;0;L;;;;;N;;;;;
+A0F6;YI SYLLABLE VU;Lo;0;L;;;;;N;;;;;
+A0F7;YI SYLLABLE VUP;Lo;0;L;;;;;N;;;;;
+A0F8;YI SYLLABLE VURX;Lo;0;L;;;;;N;;;;;
+A0F9;YI SYLLABLE VUR;Lo;0;L;;;;;N;;;;;
+A0FA;YI SYLLABLE VYT;Lo;0;L;;;;;N;;;;;
+A0FB;YI SYLLABLE VYX;Lo;0;L;;;;;N;;;;;
+A0FC;YI SYLLABLE VY;Lo;0;L;;;;;N;;;;;
+A0FD;YI SYLLABLE VYP;Lo;0;L;;;;;N;;;;;
+A0FE;YI SYLLABLE VYRX;Lo;0;L;;;;;N;;;;;
+A0FF;YI SYLLABLE VYR;Lo;0;L;;;;;N;;;;;
+A100;YI SYLLABLE DIT;Lo;0;L;;;;;N;;;;;
+A101;YI SYLLABLE DIX;Lo;0;L;;;;;N;;;;;
+A102;YI SYLLABLE DI;Lo;0;L;;;;;N;;;;;
+A103;YI SYLLABLE DIP;Lo;0;L;;;;;N;;;;;
+A104;YI SYLLABLE DIEX;Lo;0;L;;;;;N;;;;;
+A105;YI SYLLABLE DIE;Lo;0;L;;;;;N;;;;;
+A106;YI SYLLABLE DIEP;Lo;0;L;;;;;N;;;;;
+A107;YI SYLLABLE DAT;Lo;0;L;;;;;N;;;;;
+A108;YI SYLLABLE DAX;Lo;0;L;;;;;N;;;;;
+A109;YI SYLLABLE DA;Lo;0;L;;;;;N;;;;;
+A10A;YI SYLLABLE DAP;Lo;0;L;;;;;N;;;;;
+A10B;YI SYLLABLE DUOX;Lo;0;L;;;;;N;;;;;
+A10C;YI SYLLABLE DUO;Lo;0;L;;;;;N;;;;;
+A10D;YI SYLLABLE DOT;Lo;0;L;;;;;N;;;;;
+A10E;YI SYLLABLE DOX;Lo;0;L;;;;;N;;;;;
+A10F;YI SYLLABLE DO;Lo;0;L;;;;;N;;;;;
+A110;YI SYLLABLE DOP;Lo;0;L;;;;;N;;;;;
+A111;YI SYLLABLE DEX;Lo;0;L;;;;;N;;;;;
+A112;YI SYLLABLE DE;Lo;0;L;;;;;N;;;;;
+A113;YI SYLLABLE DEP;Lo;0;L;;;;;N;;;;;
+A114;YI SYLLABLE DUT;Lo;0;L;;;;;N;;;;;
+A115;YI SYLLABLE DUX;Lo;0;L;;;;;N;;;;;
+A116;YI SYLLABLE DU;Lo;0;L;;;;;N;;;;;
+A117;YI SYLLABLE DUP;Lo;0;L;;;;;N;;;;;
+A118;YI SYLLABLE DURX;Lo;0;L;;;;;N;;;;;
+A119;YI SYLLABLE DUR;Lo;0;L;;;;;N;;;;;
+A11A;YI SYLLABLE TIT;Lo;0;L;;;;;N;;;;;
+A11B;YI SYLLABLE TIX;Lo;0;L;;;;;N;;;;;
+A11C;YI SYLLABLE TI;Lo;0;L;;;;;N;;;;;
+A11D;YI SYLLABLE TIP;Lo;0;L;;;;;N;;;;;
+A11E;YI SYLLABLE TIEX;Lo;0;L;;;;;N;;;;;
+A11F;YI SYLLABLE TIE;Lo;0;L;;;;;N;;;;;
+A120;YI SYLLABLE TIEP;Lo;0;L;;;;;N;;;;;
+A121;YI SYLLABLE TAT;Lo;0;L;;;;;N;;;;;
+A122;YI SYLLABLE TAX;Lo;0;L;;;;;N;;;;;
+A123;YI SYLLABLE TA;Lo;0;L;;;;;N;;;;;
+A124;YI SYLLABLE TAP;Lo;0;L;;;;;N;;;;;
+A125;YI SYLLABLE TUOT;Lo;0;L;;;;;N;;;;;
+A126;YI SYLLABLE TUOX;Lo;0;L;;;;;N;;;;;
+A127;YI SYLLABLE TUO;Lo;0;L;;;;;N;;;;;
+A128;YI SYLLABLE TUOP;Lo;0;L;;;;;N;;;;;
+A129;YI SYLLABLE TOT;Lo;0;L;;;;;N;;;;;
+A12A;YI SYLLABLE TOX;Lo;0;L;;;;;N;;;;;
+A12B;YI SYLLABLE TO;Lo;0;L;;;;;N;;;;;
+A12C;YI SYLLABLE TOP;Lo;0;L;;;;;N;;;;;
+A12D;YI SYLLABLE TEX;Lo;0;L;;;;;N;;;;;
+A12E;YI SYLLABLE TE;Lo;0;L;;;;;N;;;;;
+A12F;YI SYLLABLE TEP;Lo;0;L;;;;;N;;;;;
+A130;YI SYLLABLE TUT;Lo;0;L;;;;;N;;;;;
+A131;YI SYLLABLE TUX;Lo;0;L;;;;;N;;;;;
+A132;YI SYLLABLE TU;Lo;0;L;;;;;N;;;;;
+A133;YI SYLLABLE TUP;Lo;0;L;;;;;N;;;;;
+A134;YI SYLLABLE TURX;Lo;0;L;;;;;N;;;;;
+A135;YI SYLLABLE TUR;Lo;0;L;;;;;N;;;;;
+A136;YI SYLLABLE DDIT;Lo;0;L;;;;;N;;;;;
+A137;YI SYLLABLE DDIX;Lo;0;L;;;;;N;;;;;
+A138;YI SYLLABLE DDI;Lo;0;L;;;;;N;;;;;
+A139;YI SYLLABLE DDIP;Lo;0;L;;;;;N;;;;;
+A13A;YI SYLLABLE DDIEX;Lo;0;L;;;;;N;;;;;
+A13B;YI SYLLABLE DDIE;Lo;0;L;;;;;N;;;;;
+A13C;YI SYLLABLE DDIEP;Lo;0;L;;;;;N;;;;;
+A13D;YI SYLLABLE DDAT;Lo;0;L;;;;;N;;;;;
+A13E;YI SYLLABLE DDAX;Lo;0;L;;;;;N;;;;;
+A13F;YI SYLLABLE DDA;Lo;0;L;;;;;N;;;;;
+A140;YI SYLLABLE DDAP;Lo;0;L;;;;;N;;;;;
+A141;YI SYLLABLE DDUOX;Lo;0;L;;;;;N;;;;;
+A142;YI SYLLABLE DDUO;Lo;0;L;;;;;N;;;;;
+A143;YI SYLLABLE DDUOP;Lo;0;L;;;;;N;;;;;
+A144;YI SYLLABLE DDOT;Lo;0;L;;;;;N;;;;;
+A145;YI SYLLABLE DDOX;Lo;0;L;;;;;N;;;;;
+A146;YI SYLLABLE DDO;Lo;0;L;;;;;N;;;;;
+A147;YI SYLLABLE DDOP;Lo;0;L;;;;;N;;;;;
+A148;YI SYLLABLE DDEX;Lo;0;L;;;;;N;;;;;
+A149;YI SYLLABLE DDE;Lo;0;L;;;;;N;;;;;
+A14A;YI SYLLABLE DDEP;Lo;0;L;;;;;N;;;;;
+A14B;YI SYLLABLE DDUT;Lo;0;L;;;;;N;;;;;
+A14C;YI SYLLABLE DDUX;Lo;0;L;;;;;N;;;;;
+A14D;YI SYLLABLE DDU;Lo;0;L;;;;;N;;;;;
+A14E;YI SYLLABLE DDUP;Lo;0;L;;;;;N;;;;;
+A14F;YI SYLLABLE DDURX;Lo;0;L;;;;;N;;;;;
+A150;YI SYLLABLE DDUR;Lo;0;L;;;;;N;;;;;
+A151;YI SYLLABLE NDIT;Lo;0;L;;;;;N;;;;;
+A152;YI SYLLABLE NDIX;Lo;0;L;;;;;N;;;;;
+A153;YI SYLLABLE NDI;Lo;0;L;;;;;N;;;;;
+A154;YI SYLLABLE NDIP;Lo;0;L;;;;;N;;;;;
+A155;YI SYLLABLE NDIEX;Lo;0;L;;;;;N;;;;;
+A156;YI SYLLABLE NDIE;Lo;0;L;;;;;N;;;;;
+A157;YI SYLLABLE NDAT;Lo;0;L;;;;;N;;;;;
+A158;YI SYLLABLE NDAX;Lo;0;L;;;;;N;;;;;
+A159;YI SYLLABLE NDA;Lo;0;L;;;;;N;;;;;
+A15A;YI SYLLABLE NDAP;Lo;0;L;;;;;N;;;;;
+A15B;YI SYLLABLE NDOT;Lo;0;L;;;;;N;;;;;
+A15C;YI SYLLABLE NDOX;Lo;0;L;;;;;N;;;;;
+A15D;YI SYLLABLE NDO;Lo;0;L;;;;;N;;;;;
+A15E;YI SYLLABLE NDOP;Lo;0;L;;;;;N;;;;;
+A15F;YI SYLLABLE NDEX;Lo;0;L;;;;;N;;;;;
+A160;YI SYLLABLE NDE;Lo;0;L;;;;;N;;;;;
+A161;YI SYLLABLE NDEP;Lo;0;L;;;;;N;;;;;
+A162;YI SYLLABLE NDUT;Lo;0;L;;;;;N;;;;;
+A163;YI SYLLABLE NDUX;Lo;0;L;;;;;N;;;;;
+A164;YI SYLLABLE NDU;Lo;0;L;;;;;N;;;;;
+A165;YI SYLLABLE NDUP;Lo;0;L;;;;;N;;;;;
+A166;YI SYLLABLE NDURX;Lo;0;L;;;;;N;;;;;
+A167;YI SYLLABLE NDUR;Lo;0;L;;;;;N;;;;;
+A168;YI SYLLABLE HNIT;Lo;0;L;;;;;N;;;;;
+A169;YI SYLLABLE HNIX;Lo;0;L;;;;;N;;;;;
+A16A;YI SYLLABLE HNI;Lo;0;L;;;;;N;;;;;
+A16B;YI SYLLABLE HNIP;Lo;0;L;;;;;N;;;;;
+A16C;YI SYLLABLE HNIET;Lo;0;L;;;;;N;;;;;
+A16D;YI SYLLABLE HNIEX;Lo;0;L;;;;;N;;;;;
+A16E;YI SYLLABLE HNIE;Lo;0;L;;;;;N;;;;;
+A16F;YI SYLLABLE HNIEP;Lo;0;L;;;;;N;;;;;
+A170;YI SYLLABLE HNAT;Lo;0;L;;;;;N;;;;;
+A171;YI SYLLABLE HNAX;Lo;0;L;;;;;N;;;;;
+A172;YI SYLLABLE HNA;Lo;0;L;;;;;N;;;;;
+A173;YI SYLLABLE HNAP;Lo;0;L;;;;;N;;;;;
+A174;YI SYLLABLE HNUOX;Lo;0;L;;;;;N;;;;;
+A175;YI SYLLABLE HNUO;Lo;0;L;;;;;N;;;;;
+A176;YI SYLLABLE HNOT;Lo;0;L;;;;;N;;;;;
+A177;YI SYLLABLE HNOX;Lo;0;L;;;;;N;;;;;
+A178;YI SYLLABLE HNOP;Lo;0;L;;;;;N;;;;;
+A179;YI SYLLABLE HNEX;Lo;0;L;;;;;N;;;;;
+A17A;YI SYLLABLE HNE;Lo;0;L;;;;;N;;;;;
+A17B;YI SYLLABLE HNEP;Lo;0;L;;;;;N;;;;;
+A17C;YI SYLLABLE HNUT;Lo;0;L;;;;;N;;;;;
+A17D;YI SYLLABLE NIT;Lo;0;L;;;;;N;;;;;
+A17E;YI SYLLABLE NIX;Lo;0;L;;;;;N;;;;;
+A17F;YI SYLLABLE NI;Lo;0;L;;;;;N;;;;;
+A180;YI SYLLABLE NIP;Lo;0;L;;;;;N;;;;;
+A181;YI SYLLABLE NIEX;Lo;0;L;;;;;N;;;;;
+A182;YI SYLLABLE NIE;Lo;0;L;;;;;N;;;;;
+A183;YI SYLLABLE NIEP;Lo;0;L;;;;;N;;;;;
+A184;YI SYLLABLE NAX;Lo;0;L;;;;;N;;;;;
+A185;YI SYLLABLE NA;Lo;0;L;;;;;N;;;;;
+A186;YI SYLLABLE NAP;Lo;0;L;;;;;N;;;;;
+A187;YI SYLLABLE NUOX;Lo;0;L;;;;;N;;;;;
+A188;YI SYLLABLE NUO;Lo;0;L;;;;;N;;;;;
+A189;YI SYLLABLE NUOP;Lo;0;L;;;;;N;;;;;
+A18A;YI SYLLABLE NOT;Lo;0;L;;;;;N;;;;;
+A18B;YI SYLLABLE NOX;Lo;0;L;;;;;N;;;;;
+A18C;YI SYLLABLE NO;Lo;0;L;;;;;N;;;;;
+A18D;YI SYLLABLE NOP;Lo;0;L;;;;;N;;;;;
+A18E;YI SYLLABLE NEX;Lo;0;L;;;;;N;;;;;
+A18F;YI SYLLABLE NE;Lo;0;L;;;;;N;;;;;
+A190;YI SYLLABLE NEP;Lo;0;L;;;;;N;;;;;
+A191;YI SYLLABLE NUT;Lo;0;L;;;;;N;;;;;
+A192;YI SYLLABLE NUX;Lo;0;L;;;;;N;;;;;
+A193;YI SYLLABLE NU;Lo;0;L;;;;;N;;;;;
+A194;YI SYLLABLE NUP;Lo;0;L;;;;;N;;;;;
+A195;YI SYLLABLE NURX;Lo;0;L;;;;;N;;;;;
+A196;YI SYLLABLE NUR;Lo;0;L;;;;;N;;;;;
+A197;YI SYLLABLE HLIT;Lo;0;L;;;;;N;;;;;
+A198;YI SYLLABLE HLIX;Lo;0;L;;;;;N;;;;;
+A199;YI SYLLABLE HLI;Lo;0;L;;;;;N;;;;;
+A19A;YI SYLLABLE HLIP;Lo;0;L;;;;;N;;;;;
+A19B;YI SYLLABLE HLIEX;Lo;0;L;;;;;N;;;;;
+A19C;YI SYLLABLE HLIE;Lo;0;L;;;;;N;;;;;
+A19D;YI SYLLABLE HLIEP;Lo;0;L;;;;;N;;;;;
+A19E;YI SYLLABLE HLAT;Lo;0;L;;;;;N;;;;;
+A19F;YI SYLLABLE HLAX;Lo;0;L;;;;;N;;;;;
+A1A0;YI SYLLABLE HLA;Lo;0;L;;;;;N;;;;;
+A1A1;YI SYLLABLE HLAP;Lo;0;L;;;;;N;;;;;
+A1A2;YI SYLLABLE HLUOX;Lo;0;L;;;;;N;;;;;
+A1A3;YI SYLLABLE HLUO;Lo;0;L;;;;;N;;;;;
+A1A4;YI SYLLABLE HLUOP;Lo;0;L;;;;;N;;;;;
+A1A5;YI SYLLABLE HLOX;Lo;0;L;;;;;N;;;;;
+A1A6;YI SYLLABLE HLO;Lo;0;L;;;;;N;;;;;
+A1A7;YI SYLLABLE HLOP;Lo;0;L;;;;;N;;;;;
+A1A8;YI SYLLABLE HLEX;Lo;0;L;;;;;N;;;;;
+A1A9;YI SYLLABLE HLE;Lo;0;L;;;;;N;;;;;
+A1AA;YI SYLLABLE HLEP;Lo;0;L;;;;;N;;;;;
+A1AB;YI SYLLABLE HLUT;Lo;0;L;;;;;N;;;;;
+A1AC;YI SYLLABLE HLUX;Lo;0;L;;;;;N;;;;;
+A1AD;YI SYLLABLE HLU;Lo;0;L;;;;;N;;;;;
+A1AE;YI SYLLABLE HLUP;Lo;0;L;;;;;N;;;;;
+A1AF;YI SYLLABLE HLURX;Lo;0;L;;;;;N;;;;;
+A1B0;YI SYLLABLE HLUR;Lo;0;L;;;;;N;;;;;
+A1B1;YI SYLLABLE HLYT;Lo;0;L;;;;;N;;;;;
+A1B2;YI SYLLABLE HLYX;Lo;0;L;;;;;N;;;;;
+A1B3;YI SYLLABLE HLY;Lo;0;L;;;;;N;;;;;
+A1B4;YI SYLLABLE HLYP;Lo;0;L;;;;;N;;;;;
+A1B5;YI SYLLABLE HLYRX;Lo;0;L;;;;;N;;;;;
+A1B6;YI SYLLABLE HLYR;Lo;0;L;;;;;N;;;;;
+A1B7;YI SYLLABLE LIT;Lo;0;L;;;;;N;;;;;
+A1B8;YI SYLLABLE LIX;Lo;0;L;;;;;N;;;;;
+A1B9;YI SYLLABLE LI;Lo;0;L;;;;;N;;;;;
+A1BA;YI SYLLABLE LIP;Lo;0;L;;;;;N;;;;;
+A1BB;YI SYLLABLE LIET;Lo;0;L;;;;;N;;;;;
+A1BC;YI SYLLABLE LIEX;Lo;0;L;;;;;N;;;;;
+A1BD;YI SYLLABLE LIE;Lo;0;L;;;;;N;;;;;
+A1BE;YI SYLLABLE LIEP;Lo;0;L;;;;;N;;;;;
+A1BF;YI SYLLABLE LAT;Lo;0;L;;;;;N;;;;;
+A1C0;YI SYLLABLE LAX;Lo;0;L;;;;;N;;;;;
+A1C1;YI SYLLABLE LA;Lo;0;L;;;;;N;;;;;
+A1C2;YI SYLLABLE LAP;Lo;0;L;;;;;N;;;;;
+A1C3;YI SYLLABLE LUOT;Lo;0;L;;;;;N;;;;;
+A1C4;YI SYLLABLE LUOX;Lo;0;L;;;;;N;;;;;
+A1C5;YI SYLLABLE LUO;Lo;0;L;;;;;N;;;;;
+A1C6;YI SYLLABLE LUOP;Lo;0;L;;;;;N;;;;;
+A1C7;YI SYLLABLE LOT;Lo;0;L;;;;;N;;;;;
+A1C8;YI SYLLABLE LOX;Lo;0;L;;;;;N;;;;;
+A1C9;YI SYLLABLE LO;Lo;0;L;;;;;N;;;;;
+A1CA;YI SYLLABLE LOP;Lo;0;L;;;;;N;;;;;
+A1CB;YI SYLLABLE LEX;Lo;0;L;;;;;N;;;;;
+A1CC;YI SYLLABLE LE;Lo;0;L;;;;;N;;;;;
+A1CD;YI SYLLABLE LEP;Lo;0;L;;;;;N;;;;;
+A1CE;YI SYLLABLE LUT;Lo;0;L;;;;;N;;;;;
+A1CF;YI SYLLABLE LUX;Lo;0;L;;;;;N;;;;;
+A1D0;YI SYLLABLE LU;Lo;0;L;;;;;N;;;;;
+A1D1;YI SYLLABLE LUP;Lo;0;L;;;;;N;;;;;
+A1D2;YI SYLLABLE LURX;Lo;0;L;;;;;N;;;;;
+A1D3;YI SYLLABLE LUR;Lo;0;L;;;;;N;;;;;
+A1D4;YI SYLLABLE LYT;Lo;0;L;;;;;N;;;;;
+A1D5;YI SYLLABLE LYX;Lo;0;L;;;;;N;;;;;
+A1D6;YI SYLLABLE LY;Lo;0;L;;;;;N;;;;;
+A1D7;YI SYLLABLE LYP;Lo;0;L;;;;;N;;;;;
+A1D8;YI SYLLABLE LYRX;Lo;0;L;;;;;N;;;;;
+A1D9;YI SYLLABLE LYR;Lo;0;L;;;;;N;;;;;
+A1DA;YI SYLLABLE GIT;Lo;0;L;;;;;N;;;;;
+A1DB;YI SYLLABLE GIX;Lo;0;L;;;;;N;;;;;
+A1DC;YI SYLLABLE GI;Lo;0;L;;;;;N;;;;;
+A1DD;YI SYLLABLE GIP;Lo;0;L;;;;;N;;;;;
+A1DE;YI SYLLABLE GIET;Lo;0;L;;;;;N;;;;;
+A1DF;YI SYLLABLE GIEX;Lo;0;L;;;;;N;;;;;
+A1E0;YI SYLLABLE GIE;Lo;0;L;;;;;N;;;;;
+A1E1;YI SYLLABLE GIEP;Lo;0;L;;;;;N;;;;;
+A1E2;YI SYLLABLE GAT;Lo;0;L;;;;;N;;;;;
+A1E3;YI SYLLABLE GAX;Lo;0;L;;;;;N;;;;;
+A1E4;YI SYLLABLE GA;Lo;0;L;;;;;N;;;;;
+A1E5;YI SYLLABLE GAP;Lo;0;L;;;;;N;;;;;
+A1E6;YI SYLLABLE GUOT;Lo;0;L;;;;;N;;;;;
+A1E7;YI SYLLABLE GUOX;Lo;0;L;;;;;N;;;;;
+A1E8;YI SYLLABLE GUO;Lo;0;L;;;;;N;;;;;
+A1E9;YI SYLLABLE GUOP;Lo;0;L;;;;;N;;;;;
+A1EA;YI SYLLABLE GOT;Lo;0;L;;;;;N;;;;;
+A1EB;YI SYLLABLE GOX;Lo;0;L;;;;;N;;;;;
+A1EC;YI SYLLABLE GO;Lo;0;L;;;;;N;;;;;
+A1ED;YI SYLLABLE GOP;Lo;0;L;;;;;N;;;;;
+A1EE;YI SYLLABLE GET;Lo;0;L;;;;;N;;;;;
+A1EF;YI SYLLABLE GEX;Lo;0;L;;;;;N;;;;;
+A1F0;YI SYLLABLE GE;Lo;0;L;;;;;N;;;;;
+A1F1;YI SYLLABLE GEP;Lo;0;L;;;;;N;;;;;
+A1F2;YI SYLLABLE GUT;Lo;0;L;;;;;N;;;;;
+A1F3;YI SYLLABLE GUX;Lo;0;L;;;;;N;;;;;
+A1F4;YI SYLLABLE GU;Lo;0;L;;;;;N;;;;;
+A1F5;YI SYLLABLE GUP;Lo;0;L;;;;;N;;;;;
+A1F6;YI SYLLABLE GURX;Lo;0;L;;;;;N;;;;;
+A1F7;YI SYLLABLE GUR;Lo;0;L;;;;;N;;;;;
+A1F8;YI SYLLABLE KIT;Lo;0;L;;;;;N;;;;;
+A1F9;YI SYLLABLE KIX;Lo;0;L;;;;;N;;;;;
+A1FA;YI SYLLABLE KI;Lo;0;L;;;;;N;;;;;
+A1FB;YI SYLLABLE KIP;Lo;0;L;;;;;N;;;;;
+A1FC;YI SYLLABLE KIEX;Lo;0;L;;;;;N;;;;;
+A1FD;YI SYLLABLE KIE;Lo;0;L;;;;;N;;;;;
+A1FE;YI SYLLABLE KIEP;Lo;0;L;;;;;N;;;;;
+A1FF;YI SYLLABLE KAT;Lo;0;L;;;;;N;;;;;
+A200;YI SYLLABLE KAX;Lo;0;L;;;;;N;;;;;
+A201;YI SYLLABLE KA;Lo;0;L;;;;;N;;;;;
+A202;YI SYLLABLE KAP;Lo;0;L;;;;;N;;;;;
+A203;YI SYLLABLE KUOX;Lo;0;L;;;;;N;;;;;
+A204;YI SYLLABLE KUO;Lo;0;L;;;;;N;;;;;
+A205;YI SYLLABLE KUOP;Lo;0;L;;;;;N;;;;;
+A206;YI SYLLABLE KOT;Lo;0;L;;;;;N;;;;;
+A207;YI SYLLABLE KOX;Lo;0;L;;;;;N;;;;;
+A208;YI SYLLABLE KO;Lo;0;L;;;;;N;;;;;
+A209;YI SYLLABLE KOP;Lo;0;L;;;;;N;;;;;
+A20A;YI SYLLABLE KET;Lo;0;L;;;;;N;;;;;
+A20B;YI SYLLABLE KEX;Lo;0;L;;;;;N;;;;;
+A20C;YI SYLLABLE KE;Lo;0;L;;;;;N;;;;;
+A20D;YI SYLLABLE KEP;Lo;0;L;;;;;N;;;;;
+A20E;YI SYLLABLE KUT;Lo;0;L;;;;;N;;;;;
+A20F;YI SYLLABLE KUX;Lo;0;L;;;;;N;;;;;
+A210;YI SYLLABLE KU;Lo;0;L;;;;;N;;;;;
+A211;YI SYLLABLE KUP;Lo;0;L;;;;;N;;;;;
+A212;YI SYLLABLE KURX;Lo;0;L;;;;;N;;;;;
+A213;YI SYLLABLE KUR;Lo;0;L;;;;;N;;;;;
+A214;YI SYLLABLE GGIT;Lo;0;L;;;;;N;;;;;
+A215;YI SYLLABLE GGIX;Lo;0;L;;;;;N;;;;;
+A216;YI SYLLABLE GGI;Lo;0;L;;;;;N;;;;;
+A217;YI SYLLABLE GGIEX;Lo;0;L;;;;;N;;;;;
+A218;YI SYLLABLE GGIE;Lo;0;L;;;;;N;;;;;
+A219;YI SYLLABLE GGIEP;Lo;0;L;;;;;N;;;;;
+A21A;YI SYLLABLE GGAT;Lo;0;L;;;;;N;;;;;
+A21B;YI SYLLABLE GGAX;Lo;0;L;;;;;N;;;;;
+A21C;YI SYLLABLE GGA;Lo;0;L;;;;;N;;;;;
+A21D;YI SYLLABLE GGAP;Lo;0;L;;;;;N;;;;;
+A21E;YI SYLLABLE GGUOT;Lo;0;L;;;;;N;;;;;
+A21F;YI SYLLABLE GGUOX;Lo;0;L;;;;;N;;;;;
+A220;YI SYLLABLE GGUO;Lo;0;L;;;;;N;;;;;
+A221;YI SYLLABLE GGUOP;Lo;0;L;;;;;N;;;;;
+A222;YI SYLLABLE GGOT;Lo;0;L;;;;;N;;;;;
+A223;YI SYLLABLE GGOX;Lo;0;L;;;;;N;;;;;
+A224;YI SYLLABLE GGO;Lo;0;L;;;;;N;;;;;
+A225;YI SYLLABLE GGOP;Lo;0;L;;;;;N;;;;;
+A226;YI SYLLABLE GGET;Lo;0;L;;;;;N;;;;;
+A227;YI SYLLABLE GGEX;Lo;0;L;;;;;N;;;;;
+A228;YI SYLLABLE GGE;Lo;0;L;;;;;N;;;;;
+A229;YI SYLLABLE GGEP;Lo;0;L;;;;;N;;;;;
+A22A;YI SYLLABLE GGUT;Lo;0;L;;;;;N;;;;;
+A22B;YI SYLLABLE GGUX;Lo;0;L;;;;;N;;;;;
+A22C;YI SYLLABLE GGU;Lo;0;L;;;;;N;;;;;
+A22D;YI SYLLABLE GGUP;Lo;0;L;;;;;N;;;;;
+A22E;YI SYLLABLE GGURX;Lo;0;L;;;;;N;;;;;
+A22F;YI SYLLABLE GGUR;Lo;0;L;;;;;N;;;;;
+A230;YI SYLLABLE MGIEX;Lo;0;L;;;;;N;;;;;
+A231;YI SYLLABLE MGIE;Lo;0;L;;;;;N;;;;;
+A232;YI SYLLABLE MGAT;Lo;0;L;;;;;N;;;;;
+A233;YI SYLLABLE MGAX;Lo;0;L;;;;;N;;;;;
+A234;YI SYLLABLE MGA;Lo;0;L;;;;;N;;;;;
+A235;YI SYLLABLE MGAP;Lo;0;L;;;;;N;;;;;
+A236;YI SYLLABLE MGUOX;Lo;0;L;;;;;N;;;;;
+A237;YI SYLLABLE MGUO;Lo;0;L;;;;;N;;;;;
+A238;YI SYLLABLE MGUOP;Lo;0;L;;;;;N;;;;;
+A239;YI SYLLABLE MGOT;Lo;0;L;;;;;N;;;;;
+A23A;YI SYLLABLE MGOX;Lo;0;L;;;;;N;;;;;
+A23B;YI SYLLABLE MGO;Lo;0;L;;;;;N;;;;;
+A23C;YI SYLLABLE MGOP;Lo;0;L;;;;;N;;;;;
+A23D;YI SYLLABLE MGEX;Lo;0;L;;;;;N;;;;;
+A23E;YI SYLLABLE MGE;Lo;0;L;;;;;N;;;;;
+A23F;YI SYLLABLE MGEP;Lo;0;L;;;;;N;;;;;
+A240;YI SYLLABLE MGUT;Lo;0;L;;;;;N;;;;;
+A241;YI SYLLABLE MGUX;Lo;0;L;;;;;N;;;;;
+A242;YI SYLLABLE MGU;Lo;0;L;;;;;N;;;;;
+A243;YI SYLLABLE MGUP;Lo;0;L;;;;;N;;;;;
+A244;YI SYLLABLE MGURX;Lo;0;L;;;;;N;;;;;
+A245;YI SYLLABLE MGUR;Lo;0;L;;;;;N;;;;;
+A246;YI SYLLABLE HXIT;Lo;0;L;;;;;N;;;;;
+A247;YI SYLLABLE HXIX;Lo;0;L;;;;;N;;;;;
+A248;YI SYLLABLE HXI;Lo;0;L;;;;;N;;;;;
+A249;YI SYLLABLE HXIP;Lo;0;L;;;;;N;;;;;
+A24A;YI SYLLABLE HXIET;Lo;0;L;;;;;N;;;;;
+A24B;YI SYLLABLE HXIEX;Lo;0;L;;;;;N;;;;;
+A24C;YI SYLLABLE HXIE;Lo;0;L;;;;;N;;;;;
+A24D;YI SYLLABLE HXIEP;Lo;0;L;;;;;N;;;;;
+A24E;YI SYLLABLE HXAT;Lo;0;L;;;;;N;;;;;
+A24F;YI SYLLABLE HXAX;Lo;0;L;;;;;N;;;;;
+A250;YI SYLLABLE HXA;Lo;0;L;;;;;N;;;;;
+A251;YI SYLLABLE HXAP;Lo;0;L;;;;;N;;;;;
+A252;YI SYLLABLE HXUOT;Lo;0;L;;;;;N;;;;;
+A253;YI SYLLABLE HXUOX;Lo;0;L;;;;;N;;;;;
+A254;YI SYLLABLE HXUO;Lo;0;L;;;;;N;;;;;
+A255;YI SYLLABLE HXUOP;Lo;0;L;;;;;N;;;;;
+A256;YI SYLLABLE HXOT;Lo;0;L;;;;;N;;;;;
+A257;YI SYLLABLE HXOX;Lo;0;L;;;;;N;;;;;
+A258;YI SYLLABLE HXO;Lo;0;L;;;;;N;;;;;
+A259;YI SYLLABLE HXOP;Lo;0;L;;;;;N;;;;;
+A25A;YI SYLLABLE HXEX;Lo;0;L;;;;;N;;;;;
+A25B;YI SYLLABLE HXE;Lo;0;L;;;;;N;;;;;
+A25C;YI SYLLABLE HXEP;Lo;0;L;;;;;N;;;;;
+A25D;YI SYLLABLE NGIEX;Lo;0;L;;;;;N;;;;;
+A25E;YI SYLLABLE NGIE;Lo;0;L;;;;;N;;;;;
+A25F;YI SYLLABLE NGIEP;Lo;0;L;;;;;N;;;;;
+A260;YI SYLLABLE NGAT;Lo;0;L;;;;;N;;;;;
+A261;YI SYLLABLE NGAX;Lo;0;L;;;;;N;;;;;
+A262;YI SYLLABLE NGA;Lo;0;L;;;;;N;;;;;
+A263;YI SYLLABLE NGAP;Lo;0;L;;;;;N;;;;;
+A264;YI SYLLABLE NGUOT;Lo;0;L;;;;;N;;;;;
+A265;YI SYLLABLE NGUOX;Lo;0;L;;;;;N;;;;;
+A266;YI SYLLABLE NGUO;Lo;0;L;;;;;N;;;;;
+A267;YI SYLLABLE NGOT;Lo;0;L;;;;;N;;;;;
+A268;YI SYLLABLE NGOX;Lo;0;L;;;;;N;;;;;
+A269;YI SYLLABLE NGO;Lo;0;L;;;;;N;;;;;
+A26A;YI SYLLABLE NGOP;Lo;0;L;;;;;N;;;;;
+A26B;YI SYLLABLE NGEX;Lo;0;L;;;;;N;;;;;
+A26C;YI SYLLABLE NGE;Lo;0;L;;;;;N;;;;;
+A26D;YI SYLLABLE NGEP;Lo;0;L;;;;;N;;;;;
+A26E;YI SYLLABLE HIT;Lo;0;L;;;;;N;;;;;
+A26F;YI SYLLABLE HIEX;Lo;0;L;;;;;N;;;;;
+A270;YI SYLLABLE HIE;Lo;0;L;;;;;N;;;;;
+A271;YI SYLLABLE HAT;Lo;0;L;;;;;N;;;;;
+A272;YI SYLLABLE HAX;Lo;0;L;;;;;N;;;;;
+A273;YI SYLLABLE HA;Lo;0;L;;;;;N;;;;;
+A274;YI SYLLABLE HAP;Lo;0;L;;;;;N;;;;;
+A275;YI SYLLABLE HUOT;Lo;0;L;;;;;N;;;;;
+A276;YI SYLLABLE HUOX;Lo;0;L;;;;;N;;;;;
+A277;YI SYLLABLE HUO;Lo;0;L;;;;;N;;;;;
+A278;YI SYLLABLE HUOP;Lo;0;L;;;;;N;;;;;
+A279;YI SYLLABLE HOT;Lo;0;L;;;;;N;;;;;
+A27A;YI SYLLABLE HOX;Lo;0;L;;;;;N;;;;;
+A27B;YI SYLLABLE HO;Lo;0;L;;;;;N;;;;;
+A27C;YI SYLLABLE HOP;Lo;0;L;;;;;N;;;;;
+A27D;YI SYLLABLE HEX;Lo;0;L;;;;;N;;;;;
+A27E;YI SYLLABLE HE;Lo;0;L;;;;;N;;;;;
+A27F;YI SYLLABLE HEP;Lo;0;L;;;;;N;;;;;
+A280;YI SYLLABLE WAT;Lo;0;L;;;;;N;;;;;
+A281;YI SYLLABLE WAX;Lo;0;L;;;;;N;;;;;
+A282;YI SYLLABLE WA;Lo;0;L;;;;;N;;;;;
+A283;YI SYLLABLE WAP;Lo;0;L;;;;;N;;;;;
+A284;YI SYLLABLE WUOX;Lo;0;L;;;;;N;;;;;
+A285;YI SYLLABLE WUO;Lo;0;L;;;;;N;;;;;
+A286;YI SYLLABLE WUOP;Lo;0;L;;;;;N;;;;;
+A287;YI SYLLABLE WOX;Lo;0;L;;;;;N;;;;;
+A288;YI SYLLABLE WO;Lo;0;L;;;;;N;;;;;
+A289;YI SYLLABLE WOP;Lo;0;L;;;;;N;;;;;
+A28A;YI SYLLABLE WEX;Lo;0;L;;;;;N;;;;;
+A28B;YI SYLLABLE WE;Lo;0;L;;;;;N;;;;;
+A28C;YI SYLLABLE WEP;Lo;0;L;;;;;N;;;;;
+A28D;YI SYLLABLE ZIT;Lo;0;L;;;;;N;;;;;
+A28E;YI SYLLABLE ZIX;Lo;0;L;;;;;N;;;;;
+A28F;YI SYLLABLE ZI;Lo;0;L;;;;;N;;;;;
+A290;YI SYLLABLE ZIP;Lo;0;L;;;;;N;;;;;
+A291;YI SYLLABLE ZIEX;Lo;0;L;;;;;N;;;;;
+A292;YI SYLLABLE ZIE;Lo;0;L;;;;;N;;;;;
+A293;YI SYLLABLE ZIEP;Lo;0;L;;;;;N;;;;;
+A294;YI SYLLABLE ZAT;Lo;0;L;;;;;N;;;;;
+A295;YI SYLLABLE ZAX;Lo;0;L;;;;;N;;;;;
+A296;YI SYLLABLE ZA;Lo;0;L;;;;;N;;;;;
+A297;YI SYLLABLE ZAP;Lo;0;L;;;;;N;;;;;
+A298;YI SYLLABLE ZUOX;Lo;0;L;;;;;N;;;;;
+A299;YI SYLLABLE ZUO;Lo;0;L;;;;;N;;;;;
+A29A;YI SYLLABLE ZUOP;Lo;0;L;;;;;N;;;;;
+A29B;YI SYLLABLE ZOT;Lo;0;L;;;;;N;;;;;
+A29C;YI SYLLABLE ZOX;Lo;0;L;;;;;N;;;;;
+A29D;YI SYLLABLE ZO;Lo;0;L;;;;;N;;;;;
+A29E;YI SYLLABLE ZOP;Lo;0;L;;;;;N;;;;;
+A29F;YI SYLLABLE ZEX;Lo;0;L;;;;;N;;;;;
+A2A0;YI SYLLABLE ZE;Lo;0;L;;;;;N;;;;;
+A2A1;YI SYLLABLE ZEP;Lo;0;L;;;;;N;;;;;
+A2A2;YI SYLLABLE ZUT;Lo;0;L;;;;;N;;;;;
+A2A3;YI SYLLABLE ZUX;Lo;0;L;;;;;N;;;;;
+A2A4;YI SYLLABLE ZU;Lo;0;L;;;;;N;;;;;
+A2A5;YI SYLLABLE ZUP;Lo;0;L;;;;;N;;;;;
+A2A6;YI SYLLABLE ZURX;Lo;0;L;;;;;N;;;;;
+A2A7;YI SYLLABLE ZUR;Lo;0;L;;;;;N;;;;;
+A2A8;YI SYLLABLE ZYT;Lo;0;L;;;;;N;;;;;
+A2A9;YI SYLLABLE ZYX;Lo;0;L;;;;;N;;;;;
+A2AA;YI SYLLABLE ZY;Lo;0;L;;;;;N;;;;;
+A2AB;YI SYLLABLE ZYP;Lo;0;L;;;;;N;;;;;
+A2AC;YI SYLLABLE ZYRX;Lo;0;L;;;;;N;;;;;
+A2AD;YI SYLLABLE ZYR;Lo;0;L;;;;;N;;;;;
+A2AE;YI SYLLABLE CIT;Lo;0;L;;;;;N;;;;;
+A2AF;YI SYLLABLE CIX;Lo;0;L;;;;;N;;;;;
+A2B0;YI SYLLABLE CI;Lo;0;L;;;;;N;;;;;
+A2B1;YI SYLLABLE CIP;Lo;0;L;;;;;N;;;;;
+A2B2;YI SYLLABLE CIET;Lo;0;L;;;;;N;;;;;
+A2B3;YI SYLLABLE CIEX;Lo;0;L;;;;;N;;;;;
+A2B4;YI SYLLABLE CIE;Lo;0;L;;;;;N;;;;;
+A2B5;YI SYLLABLE CIEP;Lo;0;L;;;;;N;;;;;
+A2B6;YI SYLLABLE CAT;Lo;0;L;;;;;N;;;;;
+A2B7;YI SYLLABLE CAX;Lo;0;L;;;;;N;;;;;
+A2B8;YI SYLLABLE CA;Lo;0;L;;;;;N;;;;;
+A2B9;YI SYLLABLE CAP;Lo;0;L;;;;;N;;;;;
+A2BA;YI SYLLABLE CUOX;Lo;0;L;;;;;N;;;;;
+A2BB;YI SYLLABLE CUO;Lo;0;L;;;;;N;;;;;
+A2BC;YI SYLLABLE CUOP;Lo;0;L;;;;;N;;;;;
+A2BD;YI SYLLABLE COT;Lo;0;L;;;;;N;;;;;
+A2BE;YI SYLLABLE COX;Lo;0;L;;;;;N;;;;;
+A2BF;YI SYLLABLE CO;Lo;0;L;;;;;N;;;;;
+A2C0;YI SYLLABLE COP;Lo;0;L;;;;;N;;;;;
+A2C1;YI SYLLABLE CEX;Lo;0;L;;;;;N;;;;;
+A2C2;YI SYLLABLE CE;Lo;0;L;;;;;N;;;;;
+A2C3;YI SYLLABLE CEP;Lo;0;L;;;;;N;;;;;
+A2C4;YI SYLLABLE CUT;Lo;0;L;;;;;N;;;;;
+A2C5;YI SYLLABLE CUX;Lo;0;L;;;;;N;;;;;
+A2C6;YI SYLLABLE CU;Lo;0;L;;;;;N;;;;;
+A2C7;YI SYLLABLE CUP;Lo;0;L;;;;;N;;;;;
+A2C8;YI SYLLABLE CURX;Lo;0;L;;;;;N;;;;;
+A2C9;YI SYLLABLE CUR;Lo;0;L;;;;;N;;;;;
+A2CA;YI SYLLABLE CYT;Lo;0;L;;;;;N;;;;;
+A2CB;YI SYLLABLE CYX;Lo;0;L;;;;;N;;;;;
+A2CC;YI SYLLABLE CY;Lo;0;L;;;;;N;;;;;
+A2CD;YI SYLLABLE CYP;Lo;0;L;;;;;N;;;;;
+A2CE;YI SYLLABLE CYRX;Lo;0;L;;;;;N;;;;;
+A2CF;YI SYLLABLE CYR;Lo;0;L;;;;;N;;;;;
+A2D0;YI SYLLABLE ZZIT;Lo;0;L;;;;;N;;;;;
+A2D1;YI SYLLABLE ZZIX;Lo;0;L;;;;;N;;;;;
+A2D2;YI SYLLABLE ZZI;Lo;0;L;;;;;N;;;;;
+A2D3;YI SYLLABLE ZZIP;Lo;0;L;;;;;N;;;;;
+A2D4;YI SYLLABLE ZZIET;Lo;0;L;;;;;N;;;;;
+A2D5;YI SYLLABLE ZZIEX;Lo;0;L;;;;;N;;;;;
+A2D6;YI SYLLABLE ZZIE;Lo;0;L;;;;;N;;;;;
+A2D7;YI SYLLABLE ZZIEP;Lo;0;L;;;;;N;;;;;
+A2D8;YI SYLLABLE ZZAT;Lo;0;L;;;;;N;;;;;
+A2D9;YI SYLLABLE ZZAX;Lo;0;L;;;;;N;;;;;
+A2DA;YI SYLLABLE ZZA;Lo;0;L;;;;;N;;;;;
+A2DB;YI SYLLABLE ZZAP;Lo;0;L;;;;;N;;;;;
+A2DC;YI SYLLABLE ZZOX;Lo;0;L;;;;;N;;;;;
+A2DD;YI SYLLABLE ZZO;Lo;0;L;;;;;N;;;;;
+A2DE;YI SYLLABLE ZZOP;Lo;0;L;;;;;N;;;;;
+A2DF;YI SYLLABLE ZZEX;Lo;0;L;;;;;N;;;;;
+A2E0;YI SYLLABLE ZZE;Lo;0;L;;;;;N;;;;;
+A2E1;YI SYLLABLE ZZEP;Lo;0;L;;;;;N;;;;;
+A2E2;YI SYLLABLE ZZUX;Lo;0;L;;;;;N;;;;;
+A2E3;YI SYLLABLE ZZU;Lo;0;L;;;;;N;;;;;
+A2E4;YI SYLLABLE ZZUP;Lo;0;L;;;;;N;;;;;
+A2E5;YI SYLLABLE ZZURX;Lo;0;L;;;;;N;;;;;
+A2E6;YI SYLLABLE ZZUR;Lo;0;L;;;;;N;;;;;
+A2E7;YI SYLLABLE ZZYT;Lo;0;L;;;;;N;;;;;
+A2E8;YI SYLLABLE ZZYX;Lo;0;L;;;;;N;;;;;
+A2E9;YI SYLLABLE ZZY;Lo;0;L;;;;;N;;;;;
+A2EA;YI SYLLABLE ZZYP;Lo;0;L;;;;;N;;;;;
+A2EB;YI SYLLABLE ZZYRX;Lo;0;L;;;;;N;;;;;
+A2EC;YI SYLLABLE ZZYR;Lo;0;L;;;;;N;;;;;
+A2ED;YI SYLLABLE NZIT;Lo;0;L;;;;;N;;;;;
+A2EE;YI SYLLABLE NZIX;Lo;0;L;;;;;N;;;;;
+A2EF;YI SYLLABLE NZI;Lo;0;L;;;;;N;;;;;
+A2F0;YI SYLLABLE NZIP;Lo;0;L;;;;;N;;;;;
+A2F1;YI SYLLABLE NZIEX;Lo;0;L;;;;;N;;;;;
+A2F2;YI SYLLABLE NZIE;Lo;0;L;;;;;N;;;;;
+A2F3;YI SYLLABLE NZIEP;Lo;0;L;;;;;N;;;;;
+A2F4;YI SYLLABLE NZAT;Lo;0;L;;;;;N;;;;;
+A2F5;YI SYLLABLE NZAX;Lo;0;L;;;;;N;;;;;
+A2F6;YI SYLLABLE NZA;Lo;0;L;;;;;N;;;;;
+A2F7;YI SYLLABLE NZAP;Lo;0;L;;;;;N;;;;;
+A2F8;YI SYLLABLE NZUOX;Lo;0;L;;;;;N;;;;;
+A2F9;YI SYLLABLE NZUO;Lo;0;L;;;;;N;;;;;
+A2FA;YI SYLLABLE NZOX;Lo;0;L;;;;;N;;;;;
+A2FB;YI SYLLABLE NZOP;Lo;0;L;;;;;N;;;;;
+A2FC;YI SYLLABLE NZEX;Lo;0;L;;;;;N;;;;;
+A2FD;YI SYLLABLE NZE;Lo;0;L;;;;;N;;;;;
+A2FE;YI SYLLABLE NZUX;Lo;0;L;;;;;N;;;;;
+A2FF;YI SYLLABLE NZU;Lo;0;L;;;;;N;;;;;
+A300;YI SYLLABLE NZUP;Lo;0;L;;;;;N;;;;;
+A301;YI SYLLABLE NZURX;Lo;0;L;;;;;N;;;;;
+A302;YI SYLLABLE NZUR;Lo;0;L;;;;;N;;;;;
+A303;YI SYLLABLE NZYT;Lo;0;L;;;;;N;;;;;
+A304;YI SYLLABLE NZYX;Lo;0;L;;;;;N;;;;;
+A305;YI SYLLABLE NZY;Lo;0;L;;;;;N;;;;;
+A306;YI SYLLABLE NZYP;Lo;0;L;;;;;N;;;;;
+A307;YI SYLLABLE NZYRX;Lo;0;L;;;;;N;;;;;
+A308;YI SYLLABLE NZYR;Lo;0;L;;;;;N;;;;;
+A309;YI SYLLABLE SIT;Lo;0;L;;;;;N;;;;;
+A30A;YI SYLLABLE SIX;Lo;0;L;;;;;N;;;;;
+A30B;YI SYLLABLE SI;Lo;0;L;;;;;N;;;;;
+A30C;YI SYLLABLE SIP;Lo;0;L;;;;;N;;;;;
+A30D;YI SYLLABLE SIEX;Lo;0;L;;;;;N;;;;;
+A30E;YI SYLLABLE SIE;Lo;0;L;;;;;N;;;;;
+A30F;YI SYLLABLE SIEP;Lo;0;L;;;;;N;;;;;
+A310;YI SYLLABLE SAT;Lo;0;L;;;;;N;;;;;
+A311;YI SYLLABLE SAX;Lo;0;L;;;;;N;;;;;
+A312;YI SYLLABLE SA;Lo;0;L;;;;;N;;;;;
+A313;YI SYLLABLE SAP;Lo;0;L;;;;;N;;;;;
+A314;YI SYLLABLE SUOX;Lo;0;L;;;;;N;;;;;
+A315;YI SYLLABLE SUO;Lo;0;L;;;;;N;;;;;
+A316;YI SYLLABLE SUOP;Lo;0;L;;;;;N;;;;;
+A317;YI SYLLABLE SOT;Lo;0;L;;;;;N;;;;;
+A318;YI SYLLABLE SOX;Lo;0;L;;;;;N;;;;;
+A319;YI SYLLABLE SO;Lo;0;L;;;;;N;;;;;
+A31A;YI SYLLABLE SOP;Lo;0;L;;;;;N;;;;;
+A31B;YI SYLLABLE SEX;Lo;0;L;;;;;N;;;;;
+A31C;YI SYLLABLE SE;Lo;0;L;;;;;N;;;;;
+A31D;YI SYLLABLE SEP;Lo;0;L;;;;;N;;;;;
+A31E;YI SYLLABLE SUT;Lo;0;L;;;;;N;;;;;
+A31F;YI SYLLABLE SUX;Lo;0;L;;;;;N;;;;;
+A320;YI SYLLABLE SU;Lo;0;L;;;;;N;;;;;
+A321;YI SYLLABLE SUP;Lo;0;L;;;;;N;;;;;
+A322;YI SYLLABLE SURX;Lo;0;L;;;;;N;;;;;
+A323;YI SYLLABLE SUR;Lo;0;L;;;;;N;;;;;
+A324;YI SYLLABLE SYT;Lo;0;L;;;;;N;;;;;
+A325;YI SYLLABLE SYX;Lo;0;L;;;;;N;;;;;
+A326;YI SYLLABLE SY;Lo;0;L;;;;;N;;;;;
+A327;YI SYLLABLE SYP;Lo;0;L;;;;;N;;;;;
+A328;YI SYLLABLE SYRX;Lo;0;L;;;;;N;;;;;
+A329;YI SYLLABLE SYR;Lo;0;L;;;;;N;;;;;
+A32A;YI SYLLABLE SSIT;Lo;0;L;;;;;N;;;;;
+A32B;YI SYLLABLE SSIX;Lo;0;L;;;;;N;;;;;
+A32C;YI SYLLABLE SSI;Lo;0;L;;;;;N;;;;;
+A32D;YI SYLLABLE SSIP;Lo;0;L;;;;;N;;;;;
+A32E;YI SYLLABLE SSIEX;Lo;0;L;;;;;N;;;;;
+A32F;YI SYLLABLE SSIE;Lo;0;L;;;;;N;;;;;
+A330;YI SYLLABLE SSIEP;Lo;0;L;;;;;N;;;;;
+A331;YI SYLLABLE SSAT;Lo;0;L;;;;;N;;;;;
+A332;YI SYLLABLE SSAX;Lo;0;L;;;;;N;;;;;
+A333;YI SYLLABLE SSA;Lo;0;L;;;;;N;;;;;
+A334;YI SYLLABLE SSAP;Lo;0;L;;;;;N;;;;;
+A335;YI SYLLABLE SSOT;Lo;0;L;;;;;N;;;;;
+A336;YI SYLLABLE SSOX;Lo;0;L;;;;;N;;;;;
+A337;YI SYLLABLE SSO;Lo;0;L;;;;;N;;;;;
+A338;YI SYLLABLE SSOP;Lo;0;L;;;;;N;;;;;
+A339;YI SYLLABLE SSEX;Lo;0;L;;;;;N;;;;;
+A33A;YI SYLLABLE SSE;Lo;0;L;;;;;N;;;;;
+A33B;YI SYLLABLE SSEP;Lo;0;L;;;;;N;;;;;
+A33C;YI SYLLABLE SSUT;Lo;0;L;;;;;N;;;;;
+A33D;YI SYLLABLE SSUX;Lo;0;L;;;;;N;;;;;
+A33E;YI SYLLABLE SSU;Lo;0;L;;;;;N;;;;;
+A33F;YI SYLLABLE SSUP;Lo;0;L;;;;;N;;;;;
+A340;YI SYLLABLE SSYT;Lo;0;L;;;;;N;;;;;
+A341;YI SYLLABLE SSYX;Lo;0;L;;;;;N;;;;;
+A342;YI SYLLABLE SSY;Lo;0;L;;;;;N;;;;;
+A343;YI SYLLABLE SSYP;Lo;0;L;;;;;N;;;;;
+A344;YI SYLLABLE SSYRX;Lo;0;L;;;;;N;;;;;
+A345;YI SYLLABLE SSYR;Lo;0;L;;;;;N;;;;;
+A346;YI SYLLABLE ZHAT;Lo;0;L;;;;;N;;;;;
+A347;YI SYLLABLE ZHAX;Lo;0;L;;;;;N;;;;;
+A348;YI SYLLABLE ZHA;Lo;0;L;;;;;N;;;;;
+A349;YI SYLLABLE ZHAP;Lo;0;L;;;;;N;;;;;
+A34A;YI SYLLABLE ZHUOX;Lo;0;L;;;;;N;;;;;
+A34B;YI SYLLABLE ZHUO;Lo;0;L;;;;;N;;;;;
+A34C;YI SYLLABLE ZHUOP;Lo;0;L;;;;;N;;;;;
+A34D;YI SYLLABLE ZHOT;Lo;0;L;;;;;N;;;;;
+A34E;YI SYLLABLE ZHOX;Lo;0;L;;;;;N;;;;;
+A34F;YI SYLLABLE ZHO;Lo;0;L;;;;;N;;;;;
+A350;YI SYLLABLE ZHOP;Lo;0;L;;;;;N;;;;;
+A351;YI SYLLABLE ZHET;Lo;0;L;;;;;N;;;;;
+A352;YI SYLLABLE ZHEX;Lo;0;L;;;;;N;;;;;
+A353;YI SYLLABLE ZHE;Lo;0;L;;;;;N;;;;;
+A354;YI SYLLABLE ZHEP;Lo;0;L;;;;;N;;;;;
+A355;YI SYLLABLE ZHUT;Lo;0;L;;;;;N;;;;;
+A356;YI SYLLABLE ZHUX;Lo;0;L;;;;;N;;;;;
+A357;YI SYLLABLE ZHU;Lo;0;L;;;;;N;;;;;
+A358;YI SYLLABLE ZHUP;Lo;0;L;;;;;N;;;;;
+A359;YI SYLLABLE ZHURX;Lo;0;L;;;;;N;;;;;
+A35A;YI SYLLABLE ZHUR;Lo;0;L;;;;;N;;;;;
+A35B;YI SYLLABLE ZHYT;Lo;0;L;;;;;N;;;;;
+A35C;YI SYLLABLE ZHYX;Lo;0;L;;;;;N;;;;;
+A35D;YI SYLLABLE ZHY;Lo;0;L;;;;;N;;;;;
+A35E;YI SYLLABLE ZHYP;Lo;0;L;;;;;N;;;;;
+A35F;YI SYLLABLE ZHYRX;Lo;0;L;;;;;N;;;;;
+A360;YI SYLLABLE ZHYR;Lo;0;L;;;;;N;;;;;
+A361;YI SYLLABLE CHAT;Lo;0;L;;;;;N;;;;;
+A362;YI SYLLABLE CHAX;Lo;0;L;;;;;N;;;;;
+A363;YI SYLLABLE CHA;Lo;0;L;;;;;N;;;;;
+A364;YI SYLLABLE CHAP;Lo;0;L;;;;;N;;;;;
+A365;YI SYLLABLE CHUOT;Lo;0;L;;;;;N;;;;;
+A366;YI SYLLABLE CHUOX;Lo;0;L;;;;;N;;;;;
+A367;YI SYLLABLE CHUO;Lo;0;L;;;;;N;;;;;
+A368;YI SYLLABLE CHUOP;Lo;0;L;;;;;N;;;;;
+A369;YI SYLLABLE CHOT;Lo;0;L;;;;;N;;;;;
+A36A;YI SYLLABLE CHOX;Lo;0;L;;;;;N;;;;;
+A36B;YI SYLLABLE CHO;Lo;0;L;;;;;N;;;;;
+A36C;YI SYLLABLE CHOP;Lo;0;L;;;;;N;;;;;
+A36D;YI SYLLABLE CHET;Lo;0;L;;;;;N;;;;;
+A36E;YI SYLLABLE CHEX;Lo;0;L;;;;;N;;;;;
+A36F;YI SYLLABLE CHE;Lo;0;L;;;;;N;;;;;
+A370;YI SYLLABLE CHEP;Lo;0;L;;;;;N;;;;;
+A371;YI SYLLABLE CHUX;Lo;0;L;;;;;N;;;;;
+A372;YI SYLLABLE CHU;Lo;0;L;;;;;N;;;;;
+A373;YI SYLLABLE CHUP;Lo;0;L;;;;;N;;;;;
+A374;YI SYLLABLE CHURX;Lo;0;L;;;;;N;;;;;
+A375;YI SYLLABLE CHUR;Lo;0;L;;;;;N;;;;;
+A376;YI SYLLABLE CHYT;Lo;0;L;;;;;N;;;;;
+A377;YI SYLLABLE CHYX;Lo;0;L;;;;;N;;;;;
+A378;YI SYLLABLE CHY;Lo;0;L;;;;;N;;;;;
+A379;YI SYLLABLE CHYP;Lo;0;L;;;;;N;;;;;
+A37A;YI SYLLABLE CHYRX;Lo;0;L;;;;;N;;;;;
+A37B;YI SYLLABLE CHYR;Lo;0;L;;;;;N;;;;;
+A37C;YI SYLLABLE RRAX;Lo;0;L;;;;;N;;;;;
+A37D;YI SYLLABLE RRA;Lo;0;L;;;;;N;;;;;
+A37E;YI SYLLABLE RRUOX;Lo;0;L;;;;;N;;;;;
+A37F;YI SYLLABLE RRUO;Lo;0;L;;;;;N;;;;;
+A380;YI SYLLABLE RROT;Lo;0;L;;;;;N;;;;;
+A381;YI SYLLABLE RROX;Lo;0;L;;;;;N;;;;;
+A382;YI SYLLABLE RRO;Lo;0;L;;;;;N;;;;;
+A383;YI SYLLABLE RROP;Lo;0;L;;;;;N;;;;;
+A384;YI SYLLABLE RRET;Lo;0;L;;;;;N;;;;;
+A385;YI SYLLABLE RREX;Lo;0;L;;;;;N;;;;;
+A386;YI SYLLABLE RRE;Lo;0;L;;;;;N;;;;;
+A387;YI SYLLABLE RREP;Lo;0;L;;;;;N;;;;;
+A388;YI SYLLABLE RRUT;Lo;0;L;;;;;N;;;;;
+A389;YI SYLLABLE RRUX;Lo;0;L;;;;;N;;;;;
+A38A;YI SYLLABLE RRU;Lo;0;L;;;;;N;;;;;
+A38B;YI SYLLABLE RRUP;Lo;0;L;;;;;N;;;;;
+A38C;YI SYLLABLE RRURX;Lo;0;L;;;;;N;;;;;
+A38D;YI SYLLABLE RRUR;Lo;0;L;;;;;N;;;;;
+A38E;YI SYLLABLE RRYT;Lo;0;L;;;;;N;;;;;
+A38F;YI SYLLABLE RRYX;Lo;0;L;;;;;N;;;;;
+A390;YI SYLLABLE RRY;Lo;0;L;;;;;N;;;;;
+A391;YI SYLLABLE RRYP;Lo;0;L;;;;;N;;;;;
+A392;YI SYLLABLE RRYRX;Lo;0;L;;;;;N;;;;;
+A393;YI SYLLABLE RRYR;Lo;0;L;;;;;N;;;;;
+A394;YI SYLLABLE NRAT;Lo;0;L;;;;;N;;;;;
+A395;YI SYLLABLE NRAX;Lo;0;L;;;;;N;;;;;
+A396;YI SYLLABLE NRA;Lo;0;L;;;;;N;;;;;
+A397;YI SYLLABLE NRAP;Lo;0;L;;;;;N;;;;;
+A398;YI SYLLABLE NROX;Lo;0;L;;;;;N;;;;;
+A399;YI SYLLABLE NRO;Lo;0;L;;;;;N;;;;;
+A39A;YI SYLLABLE NROP;Lo;0;L;;;;;N;;;;;
+A39B;YI SYLLABLE NRET;Lo;0;L;;;;;N;;;;;
+A39C;YI SYLLABLE NREX;Lo;0;L;;;;;N;;;;;
+A39D;YI SYLLABLE NRE;Lo;0;L;;;;;N;;;;;
+A39E;YI SYLLABLE NREP;Lo;0;L;;;;;N;;;;;
+A39F;YI SYLLABLE NRUT;Lo;0;L;;;;;N;;;;;
+A3A0;YI SYLLABLE NRUX;Lo;0;L;;;;;N;;;;;
+A3A1;YI SYLLABLE NRU;Lo;0;L;;;;;N;;;;;
+A3A2;YI SYLLABLE NRUP;Lo;0;L;;;;;N;;;;;
+A3A3;YI SYLLABLE NRURX;Lo;0;L;;;;;N;;;;;
+A3A4;YI SYLLABLE NRUR;Lo;0;L;;;;;N;;;;;
+A3A5;YI SYLLABLE NRYT;Lo;0;L;;;;;N;;;;;
+A3A6;YI SYLLABLE NRYX;Lo;0;L;;;;;N;;;;;
+A3A7;YI SYLLABLE NRY;Lo;0;L;;;;;N;;;;;
+A3A8;YI SYLLABLE NRYP;Lo;0;L;;;;;N;;;;;
+A3A9;YI SYLLABLE NRYRX;Lo;0;L;;;;;N;;;;;
+A3AA;YI SYLLABLE NRYR;Lo;0;L;;;;;N;;;;;
+A3AB;YI SYLLABLE SHAT;Lo;0;L;;;;;N;;;;;
+A3AC;YI SYLLABLE SHAX;Lo;0;L;;;;;N;;;;;
+A3AD;YI SYLLABLE SHA;Lo;0;L;;;;;N;;;;;
+A3AE;YI SYLLABLE SHAP;Lo;0;L;;;;;N;;;;;
+A3AF;YI SYLLABLE SHUOX;Lo;0;L;;;;;N;;;;;
+A3B0;YI SYLLABLE SHUO;Lo;0;L;;;;;N;;;;;
+A3B1;YI SYLLABLE SHUOP;Lo;0;L;;;;;N;;;;;
+A3B2;YI SYLLABLE SHOT;Lo;0;L;;;;;N;;;;;
+A3B3;YI SYLLABLE SHOX;Lo;0;L;;;;;N;;;;;
+A3B4;YI SYLLABLE SHO;Lo;0;L;;;;;N;;;;;
+A3B5;YI SYLLABLE SHOP;Lo;0;L;;;;;N;;;;;
+A3B6;YI SYLLABLE SHET;Lo;0;L;;;;;N;;;;;
+A3B7;YI SYLLABLE SHEX;Lo;0;L;;;;;N;;;;;
+A3B8;YI SYLLABLE SHE;Lo;0;L;;;;;N;;;;;
+A3B9;YI SYLLABLE SHEP;Lo;0;L;;;;;N;;;;;
+A3BA;YI SYLLABLE SHUT;Lo;0;L;;;;;N;;;;;
+A3BB;YI SYLLABLE SHUX;Lo;0;L;;;;;N;;;;;
+A3BC;YI SYLLABLE SHU;Lo;0;L;;;;;N;;;;;
+A3BD;YI SYLLABLE SHUP;Lo;0;L;;;;;N;;;;;
+A3BE;YI SYLLABLE SHURX;Lo;0;L;;;;;N;;;;;
+A3BF;YI SYLLABLE SHUR;Lo;0;L;;;;;N;;;;;
+A3C0;YI SYLLABLE SHYT;Lo;0;L;;;;;N;;;;;
+A3C1;YI SYLLABLE SHYX;Lo;0;L;;;;;N;;;;;
+A3C2;YI SYLLABLE SHY;Lo;0;L;;;;;N;;;;;
+A3C3;YI SYLLABLE SHYP;Lo;0;L;;;;;N;;;;;
+A3C4;YI SYLLABLE SHYRX;Lo;0;L;;;;;N;;;;;
+A3C5;YI SYLLABLE SHYR;Lo;0;L;;;;;N;;;;;
+A3C6;YI SYLLABLE RAT;Lo;0;L;;;;;N;;;;;
+A3C7;YI SYLLABLE RAX;Lo;0;L;;;;;N;;;;;
+A3C8;YI SYLLABLE RA;Lo;0;L;;;;;N;;;;;
+A3C9;YI SYLLABLE RAP;Lo;0;L;;;;;N;;;;;
+A3CA;YI SYLLABLE RUOX;Lo;0;L;;;;;N;;;;;
+A3CB;YI SYLLABLE RUO;Lo;0;L;;;;;N;;;;;
+A3CC;YI SYLLABLE RUOP;Lo;0;L;;;;;N;;;;;
+A3CD;YI SYLLABLE ROT;Lo;0;L;;;;;N;;;;;
+A3CE;YI SYLLABLE ROX;Lo;0;L;;;;;N;;;;;
+A3CF;YI SYLLABLE RO;Lo;0;L;;;;;N;;;;;
+A3D0;YI SYLLABLE ROP;Lo;0;L;;;;;N;;;;;
+A3D1;YI SYLLABLE REX;Lo;0;L;;;;;N;;;;;
+A3D2;YI SYLLABLE RE;Lo;0;L;;;;;N;;;;;
+A3D3;YI SYLLABLE REP;Lo;0;L;;;;;N;;;;;
+A3D4;YI SYLLABLE RUT;Lo;0;L;;;;;N;;;;;
+A3D5;YI SYLLABLE RUX;Lo;0;L;;;;;N;;;;;
+A3D6;YI SYLLABLE RU;Lo;0;L;;;;;N;;;;;
+A3D7;YI SYLLABLE RUP;Lo;0;L;;;;;N;;;;;
+A3D8;YI SYLLABLE RURX;Lo;0;L;;;;;N;;;;;
+A3D9;YI SYLLABLE RUR;Lo;0;L;;;;;N;;;;;
+A3DA;YI SYLLABLE RYT;Lo;0;L;;;;;N;;;;;
+A3DB;YI SYLLABLE RYX;Lo;0;L;;;;;N;;;;;
+A3DC;YI SYLLABLE RY;Lo;0;L;;;;;N;;;;;
+A3DD;YI SYLLABLE RYP;Lo;0;L;;;;;N;;;;;
+A3DE;YI SYLLABLE RYRX;Lo;0;L;;;;;N;;;;;
+A3DF;YI SYLLABLE RYR;Lo;0;L;;;;;N;;;;;
+A3E0;YI SYLLABLE JIT;Lo;0;L;;;;;N;;;;;
+A3E1;YI SYLLABLE JIX;Lo;0;L;;;;;N;;;;;
+A3E2;YI SYLLABLE JI;Lo;0;L;;;;;N;;;;;
+A3E3;YI SYLLABLE JIP;Lo;0;L;;;;;N;;;;;
+A3E4;YI SYLLABLE JIET;Lo;0;L;;;;;N;;;;;
+A3E5;YI SYLLABLE JIEX;Lo;0;L;;;;;N;;;;;
+A3E6;YI SYLLABLE JIE;Lo;0;L;;;;;N;;;;;
+A3E7;YI SYLLABLE JIEP;Lo;0;L;;;;;N;;;;;
+A3E8;YI SYLLABLE JUOT;Lo;0;L;;;;;N;;;;;
+A3E9;YI SYLLABLE JUOX;Lo;0;L;;;;;N;;;;;
+A3EA;YI SYLLABLE JUO;Lo;0;L;;;;;N;;;;;
+A3EB;YI SYLLABLE JUOP;Lo;0;L;;;;;N;;;;;
+A3EC;YI SYLLABLE JOT;Lo;0;L;;;;;N;;;;;
+A3ED;YI SYLLABLE JOX;Lo;0;L;;;;;N;;;;;
+A3EE;YI SYLLABLE JO;Lo;0;L;;;;;N;;;;;
+A3EF;YI SYLLABLE JOP;Lo;0;L;;;;;N;;;;;
+A3F0;YI SYLLABLE JUT;Lo;0;L;;;;;N;;;;;
+A3F1;YI SYLLABLE JUX;Lo;0;L;;;;;N;;;;;
+A3F2;YI SYLLABLE JU;Lo;0;L;;;;;N;;;;;
+A3F3;YI SYLLABLE JUP;Lo;0;L;;;;;N;;;;;
+A3F4;YI SYLLABLE JURX;Lo;0;L;;;;;N;;;;;
+A3F5;YI SYLLABLE JUR;Lo;0;L;;;;;N;;;;;
+A3F6;YI SYLLABLE JYT;Lo;0;L;;;;;N;;;;;
+A3F7;YI SYLLABLE JYX;Lo;0;L;;;;;N;;;;;
+A3F8;YI SYLLABLE JY;Lo;0;L;;;;;N;;;;;
+A3F9;YI SYLLABLE JYP;Lo;0;L;;;;;N;;;;;
+A3FA;YI SYLLABLE JYRX;Lo;0;L;;;;;N;;;;;
+A3FB;YI SYLLABLE JYR;Lo;0;L;;;;;N;;;;;
+A3FC;YI SYLLABLE QIT;Lo;0;L;;;;;N;;;;;
+A3FD;YI SYLLABLE QIX;Lo;0;L;;;;;N;;;;;
+A3FE;YI SYLLABLE QI;Lo;0;L;;;;;N;;;;;
+A3FF;YI SYLLABLE QIP;Lo;0;L;;;;;N;;;;;
+A400;YI SYLLABLE QIET;Lo;0;L;;;;;N;;;;;
+A401;YI SYLLABLE QIEX;Lo;0;L;;;;;N;;;;;
+A402;YI SYLLABLE QIE;Lo;0;L;;;;;N;;;;;
+A403;YI SYLLABLE QIEP;Lo;0;L;;;;;N;;;;;
+A404;YI SYLLABLE QUOT;Lo;0;L;;;;;N;;;;;
+A405;YI SYLLABLE QUOX;Lo;0;L;;;;;N;;;;;
+A406;YI SYLLABLE QUO;Lo;0;L;;;;;N;;;;;
+A407;YI SYLLABLE QUOP;Lo;0;L;;;;;N;;;;;
+A408;YI SYLLABLE QOT;Lo;0;L;;;;;N;;;;;
+A409;YI SYLLABLE QOX;Lo;0;L;;;;;N;;;;;
+A40A;YI SYLLABLE QO;Lo;0;L;;;;;N;;;;;
+A40B;YI SYLLABLE QOP;Lo;0;L;;;;;N;;;;;
+A40C;YI SYLLABLE QUT;Lo;0;L;;;;;N;;;;;
+A40D;YI SYLLABLE QUX;Lo;0;L;;;;;N;;;;;
+A40E;YI SYLLABLE QU;Lo;0;L;;;;;N;;;;;
+A40F;YI SYLLABLE QUP;Lo;0;L;;;;;N;;;;;
+A410;YI SYLLABLE QURX;Lo;0;L;;;;;N;;;;;
+A411;YI SYLLABLE QUR;Lo;0;L;;;;;N;;;;;
+A412;YI SYLLABLE QYT;Lo;0;L;;;;;N;;;;;
+A413;YI SYLLABLE QYX;Lo;0;L;;;;;N;;;;;
+A414;YI SYLLABLE QY;Lo;0;L;;;;;N;;;;;
+A415;YI SYLLABLE QYP;Lo;0;L;;;;;N;;;;;
+A416;YI SYLLABLE QYRX;Lo;0;L;;;;;N;;;;;
+A417;YI SYLLABLE QYR;Lo;0;L;;;;;N;;;;;
+A418;YI SYLLABLE JJIT;Lo;0;L;;;;;N;;;;;
+A419;YI SYLLABLE JJIX;Lo;0;L;;;;;N;;;;;
+A41A;YI SYLLABLE JJI;Lo;0;L;;;;;N;;;;;
+A41B;YI SYLLABLE JJIP;Lo;0;L;;;;;N;;;;;
+A41C;YI SYLLABLE JJIET;Lo;0;L;;;;;N;;;;;
+A41D;YI SYLLABLE JJIEX;Lo;0;L;;;;;N;;;;;
+A41E;YI SYLLABLE JJIE;Lo;0;L;;;;;N;;;;;
+A41F;YI SYLLABLE JJIEP;Lo;0;L;;;;;N;;;;;
+A420;YI SYLLABLE JJUOX;Lo;0;L;;;;;N;;;;;
+A421;YI SYLLABLE JJUO;Lo;0;L;;;;;N;;;;;
+A422;YI SYLLABLE JJUOP;Lo;0;L;;;;;N;;;;;
+A423;YI SYLLABLE JJOT;Lo;0;L;;;;;N;;;;;
+A424;YI SYLLABLE JJOX;Lo;0;L;;;;;N;;;;;
+A425;YI SYLLABLE JJO;Lo;0;L;;;;;N;;;;;
+A426;YI SYLLABLE JJOP;Lo;0;L;;;;;N;;;;;
+A427;YI SYLLABLE JJUT;Lo;0;L;;;;;N;;;;;
+A428;YI SYLLABLE JJUX;Lo;0;L;;;;;N;;;;;
+A429;YI SYLLABLE JJU;Lo;0;L;;;;;N;;;;;
+A42A;YI SYLLABLE JJUP;Lo;0;L;;;;;N;;;;;
+A42B;YI SYLLABLE JJURX;Lo;0;L;;;;;N;;;;;
+A42C;YI SYLLABLE JJUR;Lo;0;L;;;;;N;;;;;
+A42D;YI SYLLABLE JJYT;Lo;0;L;;;;;N;;;;;
+A42E;YI SYLLABLE JJYX;Lo;0;L;;;;;N;;;;;
+A42F;YI SYLLABLE JJY;Lo;0;L;;;;;N;;;;;
+A430;YI SYLLABLE JJYP;Lo;0;L;;;;;N;;;;;
+A431;YI SYLLABLE NJIT;Lo;0;L;;;;;N;;;;;
+A432;YI SYLLABLE NJIX;Lo;0;L;;;;;N;;;;;
+A433;YI SYLLABLE NJI;Lo;0;L;;;;;N;;;;;
+A434;YI SYLLABLE NJIP;Lo;0;L;;;;;N;;;;;
+A435;YI SYLLABLE NJIET;Lo;0;L;;;;;N;;;;;
+A436;YI SYLLABLE NJIEX;Lo;0;L;;;;;N;;;;;
+A437;YI SYLLABLE NJIE;Lo;0;L;;;;;N;;;;;
+A438;YI SYLLABLE NJIEP;Lo;0;L;;;;;N;;;;;
+A439;YI SYLLABLE NJUOX;Lo;0;L;;;;;N;;;;;
+A43A;YI SYLLABLE NJUO;Lo;0;L;;;;;N;;;;;
+A43B;YI SYLLABLE NJOT;Lo;0;L;;;;;N;;;;;
+A43C;YI SYLLABLE NJOX;Lo;0;L;;;;;N;;;;;
+A43D;YI SYLLABLE NJO;Lo;0;L;;;;;N;;;;;
+A43E;YI SYLLABLE NJOP;Lo;0;L;;;;;N;;;;;
+A43F;YI SYLLABLE NJUX;Lo;0;L;;;;;N;;;;;
+A440;YI SYLLABLE NJU;Lo;0;L;;;;;N;;;;;
+A441;YI SYLLABLE NJUP;Lo;0;L;;;;;N;;;;;
+A442;YI SYLLABLE NJURX;Lo;0;L;;;;;N;;;;;
+A443;YI SYLLABLE NJUR;Lo;0;L;;;;;N;;;;;
+A444;YI SYLLABLE NJYT;Lo;0;L;;;;;N;;;;;
+A445;YI SYLLABLE NJYX;Lo;0;L;;;;;N;;;;;
+A446;YI SYLLABLE NJY;Lo;0;L;;;;;N;;;;;
+A447;YI SYLLABLE NJYP;Lo;0;L;;;;;N;;;;;
+A448;YI SYLLABLE NJYRX;Lo;0;L;;;;;N;;;;;
+A449;YI SYLLABLE NJYR;Lo;0;L;;;;;N;;;;;
+A44A;YI SYLLABLE NYIT;Lo;0;L;;;;;N;;;;;
+A44B;YI SYLLABLE NYIX;Lo;0;L;;;;;N;;;;;
+A44C;YI SYLLABLE NYI;Lo;0;L;;;;;N;;;;;
+A44D;YI SYLLABLE NYIP;Lo;0;L;;;;;N;;;;;
+A44E;YI SYLLABLE NYIET;Lo;0;L;;;;;N;;;;;
+A44F;YI SYLLABLE NYIEX;Lo;0;L;;;;;N;;;;;
+A450;YI SYLLABLE NYIE;Lo;0;L;;;;;N;;;;;
+A451;YI SYLLABLE NYIEP;Lo;0;L;;;;;N;;;;;
+A452;YI SYLLABLE NYUOX;Lo;0;L;;;;;N;;;;;
+A453;YI SYLLABLE NYUO;Lo;0;L;;;;;N;;;;;
+A454;YI SYLLABLE NYUOP;Lo;0;L;;;;;N;;;;;
+A455;YI SYLLABLE NYOT;Lo;0;L;;;;;N;;;;;
+A456;YI SYLLABLE NYOX;Lo;0;L;;;;;N;;;;;
+A457;YI SYLLABLE NYO;Lo;0;L;;;;;N;;;;;
+A458;YI SYLLABLE NYOP;Lo;0;L;;;;;N;;;;;
+A459;YI SYLLABLE NYUT;Lo;0;L;;;;;N;;;;;
+A45A;YI SYLLABLE NYUX;Lo;0;L;;;;;N;;;;;
+A45B;YI SYLLABLE NYU;Lo;0;L;;;;;N;;;;;
+A45C;YI SYLLABLE NYUP;Lo;0;L;;;;;N;;;;;
+A45D;YI SYLLABLE XIT;Lo;0;L;;;;;N;;;;;
+A45E;YI SYLLABLE XIX;Lo;0;L;;;;;N;;;;;
+A45F;YI SYLLABLE XI;Lo;0;L;;;;;N;;;;;
+A460;YI SYLLABLE XIP;Lo;0;L;;;;;N;;;;;
+A461;YI SYLLABLE XIET;Lo;0;L;;;;;N;;;;;
+A462;YI SYLLABLE XIEX;Lo;0;L;;;;;N;;;;;
+A463;YI SYLLABLE XIE;Lo;0;L;;;;;N;;;;;
+A464;YI SYLLABLE XIEP;Lo;0;L;;;;;N;;;;;
+A465;YI SYLLABLE XUOX;Lo;0;L;;;;;N;;;;;
+A466;YI SYLLABLE XUO;Lo;0;L;;;;;N;;;;;
+A467;YI SYLLABLE XOT;Lo;0;L;;;;;N;;;;;
+A468;YI SYLLABLE XOX;Lo;0;L;;;;;N;;;;;
+A469;YI SYLLABLE XO;Lo;0;L;;;;;N;;;;;
+A46A;YI SYLLABLE XOP;Lo;0;L;;;;;N;;;;;
+A46B;YI SYLLABLE XYT;Lo;0;L;;;;;N;;;;;
+A46C;YI SYLLABLE XYX;Lo;0;L;;;;;N;;;;;
+A46D;YI SYLLABLE XY;Lo;0;L;;;;;N;;;;;
+A46E;YI SYLLABLE XYP;Lo;0;L;;;;;N;;;;;
+A46F;YI SYLLABLE XYRX;Lo;0;L;;;;;N;;;;;
+A470;YI SYLLABLE XYR;Lo;0;L;;;;;N;;;;;
+A471;YI SYLLABLE YIT;Lo;0;L;;;;;N;;;;;
+A472;YI SYLLABLE YIX;Lo;0;L;;;;;N;;;;;
+A473;YI SYLLABLE YI;Lo;0;L;;;;;N;;;;;
+A474;YI SYLLABLE YIP;Lo;0;L;;;;;N;;;;;
+A475;YI SYLLABLE YIET;Lo;0;L;;;;;N;;;;;
+A476;YI SYLLABLE YIEX;Lo;0;L;;;;;N;;;;;
+A477;YI SYLLABLE YIE;Lo;0;L;;;;;N;;;;;
+A478;YI SYLLABLE YIEP;Lo;0;L;;;;;N;;;;;
+A479;YI SYLLABLE YUOT;Lo;0;L;;;;;N;;;;;
+A47A;YI SYLLABLE YUOX;Lo;0;L;;;;;N;;;;;
+A47B;YI SYLLABLE YUO;Lo;0;L;;;;;N;;;;;
+A47C;YI SYLLABLE YUOP;Lo;0;L;;;;;N;;;;;
+A47D;YI SYLLABLE YOT;Lo;0;L;;;;;N;;;;;
+A47E;YI SYLLABLE YOX;Lo;0;L;;;;;N;;;;;
+A47F;YI SYLLABLE YO;Lo;0;L;;;;;N;;;;;
+A480;YI SYLLABLE YOP;Lo;0;L;;;;;N;;;;;
+A481;YI SYLLABLE YUT;Lo;0;L;;;;;N;;;;;
+A482;YI SYLLABLE YUX;Lo;0;L;;;;;N;;;;;
+A483;YI SYLLABLE YU;Lo;0;L;;;;;N;;;;;
+A484;YI SYLLABLE YUP;Lo;0;L;;;;;N;;;;;
+A485;YI SYLLABLE YURX;Lo;0;L;;;;;N;;;;;
+A486;YI SYLLABLE YUR;Lo;0;L;;;;;N;;;;;
+A487;YI SYLLABLE YYT;Lo;0;L;;;;;N;;;;;
+A488;YI SYLLABLE YYX;Lo;0;L;;;;;N;;;;;
+A489;YI SYLLABLE YY;Lo;0;L;;;;;N;;;;;
+A48A;YI SYLLABLE YYP;Lo;0;L;;;;;N;;;;;
+A48B;YI SYLLABLE YYRX;Lo;0;L;;;;;N;;;;;
+A48C;YI SYLLABLE YYR;Lo;0;L;;;;;N;;;;;
+A490;YI RADICAL QOT;So;0;ON;;;;;N;;;;;
+A491;YI RADICAL LI;So;0;ON;;;;;N;;;;;
+A492;YI RADICAL KIT;So;0;ON;;;;;N;;;;;
+A493;YI RADICAL NYIP;So;0;ON;;;;;N;;;;;
+A494;YI RADICAL CYP;So;0;ON;;;;;N;;;;;
+A495;YI RADICAL SSI;So;0;ON;;;;;N;;;;;
+A496;YI RADICAL GGOP;So;0;ON;;;;;N;;;;;
+A497;YI RADICAL GEP;So;0;ON;;;;;N;;;;;
+A498;YI RADICAL MI;So;0;ON;;;;;N;;;;;
+A499;YI RADICAL HXIT;So;0;ON;;;;;N;;;;;
+A49A;YI RADICAL LYR;So;0;ON;;;;;N;;;;;
+A49B;YI RADICAL BBUT;So;0;ON;;;;;N;;;;;
+A49C;YI RADICAL MOP;So;0;ON;;;;;N;;;;;
+A49D;YI RADICAL YO;So;0;ON;;;;;N;;;;;
+A49E;YI RADICAL PUT;So;0;ON;;;;;N;;;;;
+A49F;YI RADICAL HXUO;So;0;ON;;;;;N;;;;;
+A4A0;YI RADICAL TAT;So;0;ON;;;;;N;;;;;
+A4A1;YI RADICAL GA;So;0;ON;;;;;N;;;;;
+A4A2;YI RADICAL ZUP;So;0;ON;;;;;N;;;;;
+A4A3;YI RADICAL CYT;So;0;ON;;;;;N;;;;;
+A4A4;YI RADICAL DDUR;So;0;ON;;;;;N;;;;;
+A4A5;YI RADICAL BUR;So;0;ON;;;;;N;;;;;
+A4A6;YI RADICAL GGUO;So;0;ON;;;;;N;;;;;
+A4A7;YI RADICAL NYOP;So;0;ON;;;;;N;;;;;
+A4A8;YI RADICAL TU;So;0;ON;;;;;N;;;;;
+A4A9;YI RADICAL OP;So;0;ON;;;;;N;;;;;
+A4AA;YI RADICAL JJUT;So;0;ON;;;;;N;;;;;
+A4AB;YI RADICAL ZOT;So;0;ON;;;;;N;;;;;
+A4AC;YI RADICAL PYT;So;0;ON;;;;;N;;;;;
+A4AD;YI RADICAL HMO;So;0;ON;;;;;N;;;;;
+A4AE;YI RADICAL YIT;So;0;ON;;;;;N;;;;;
+A4AF;YI RADICAL VUR;So;0;ON;;;;;N;;;;;
+A4B0;YI RADICAL SHY;So;0;ON;;;;;N;;;;;
+A4B1;YI RADICAL VEP;So;0;ON;;;;;N;;;;;
+A4B2;YI RADICAL ZA;So;0;ON;;;;;N;;;;;
+A4B3;YI RADICAL JO;So;0;ON;;;;;N;;;;;
+A4B4;YI RADICAL NZUP;So;0;ON;;;;;N;;;;;
+A4B5;YI RADICAL JJY;So;0;ON;;;;;N;;;;;
+A4B6;YI RADICAL GOT;So;0;ON;;;;;N;;;;;
+A4B7;YI RADICAL JJIE;So;0;ON;;;;;N;;;;;
+A4B8;YI RADICAL WO;So;0;ON;;;;;N;;;;;
+A4B9;YI RADICAL DU;So;0;ON;;;;;N;;;;;
+A4BA;YI RADICAL SHUR;So;0;ON;;;;;N;;;;;
+A4BB;YI RADICAL LIE;So;0;ON;;;;;N;;;;;
+A4BC;YI RADICAL CY;So;0;ON;;;;;N;;;;;
+A4BD;YI RADICAL CUOP;So;0;ON;;;;;N;;;;;
+A4BE;YI RADICAL CIP;So;0;ON;;;;;N;;;;;
+A4BF;YI RADICAL HXOP;So;0;ON;;;;;N;;;;;
+A4C0;YI RADICAL SHAT;So;0;ON;;;;;N;;;;;
+A4C1;YI RADICAL ZUR;So;0;ON;;;;;N;;;;;
+A4C2;YI RADICAL SHOP;So;0;ON;;;;;N;;;;;
+A4C3;YI RADICAL CHE;So;0;ON;;;;;N;;;;;
+A4C4;YI RADICAL ZZIET;So;0;ON;;;;;N;;;;;
+A4C5;YI RADICAL NBIE;So;0;ON;;;;;N;;;;;
+A4C6;YI RADICAL KE;So;0;ON;;;;;N;;;;;
+A4D0;LISU LETTER BA;Lo;0;L;;;;;N;;;;;
+A4D1;LISU LETTER PA;Lo;0;L;;;;;N;;;;;
+A4D2;LISU LETTER PHA;Lo;0;L;;;;;N;;;;;
+A4D3;LISU LETTER DA;Lo;0;L;;;;;N;;;;;
+A4D4;LISU LETTER TA;Lo;0;L;;;;;N;;;;;
+A4D5;LISU LETTER THA;Lo;0;L;;;;;N;;;;;
+A4D6;LISU LETTER GA;Lo;0;L;;;;;N;;;;;
+A4D7;LISU LETTER KA;Lo;0;L;;;;;N;;;;;
+A4D8;LISU LETTER KHA;Lo;0;L;;;;;N;;;;;
+A4D9;LISU LETTER JA;Lo;0;L;;;;;N;;;;;
+A4DA;LISU LETTER CA;Lo;0;L;;;;;N;;;;;
+A4DB;LISU LETTER CHA;Lo;0;L;;;;;N;;;;;
+A4DC;LISU LETTER DZA;Lo;0;L;;;;;N;;;;;
+A4DD;LISU LETTER TSA;Lo;0;L;;;;;N;;;;;
+A4DE;LISU LETTER TSHA;Lo;0;L;;;;;N;;;;;
+A4DF;LISU LETTER MA;Lo;0;L;;;;;N;;;;;
+A4E0;LISU LETTER NA;Lo;0;L;;;;;N;;;;;
+A4E1;LISU LETTER LA;Lo;0;L;;;;;N;;;;;
+A4E2;LISU LETTER SA;Lo;0;L;;;;;N;;;;;
+A4E3;LISU LETTER ZHA;Lo;0;L;;;;;N;;;;;
+A4E4;LISU LETTER ZA;Lo;0;L;;;;;N;;;;;
+A4E5;LISU LETTER NGA;Lo;0;L;;;;;N;;;;;
+A4E6;LISU LETTER HA;Lo;0;L;;;;;N;;;;;
+A4E7;LISU LETTER XA;Lo;0;L;;;;;N;;;;;
+A4E8;LISU LETTER HHA;Lo;0;L;;;;;N;;;;;
+A4E9;LISU LETTER FA;Lo;0;L;;;;;N;;;;;
+A4EA;LISU LETTER WA;Lo;0;L;;;;;N;;;;;
+A4EB;LISU LETTER SHA;Lo;0;L;;;;;N;;;;;
+A4EC;LISU LETTER YA;Lo;0;L;;;;;N;;;;;
+A4ED;LISU LETTER GHA;Lo;0;L;;;;;N;;;;;
+A4EE;LISU LETTER A;Lo;0;L;;;;;N;;;;;
+A4EF;LISU LETTER AE;Lo;0;L;;;;;N;;;;;
+A4F0;LISU LETTER E;Lo;0;L;;;;;N;;;;;
+A4F1;LISU LETTER EU;Lo;0;L;;;;;N;;;;;
+A4F2;LISU LETTER I;Lo;0;L;;;;;N;;;;;
+A4F3;LISU LETTER O;Lo;0;L;;;;;N;;;;;
+A4F4;LISU LETTER U;Lo;0;L;;;;;N;;;;;
+A4F5;LISU LETTER UE;Lo;0;L;;;;;N;;;;;
+A4F6;LISU LETTER UH;Lo;0;L;;;;;N;;;;;
+A4F7;LISU LETTER OE;Lo;0;L;;;;;N;;;;;
+A4F8;LISU LETTER TONE MYA TI;Lm;0;L;;;;;N;;;;;
+A4F9;LISU LETTER TONE NA PO;Lm;0;L;;;;;N;;;;;
+A4FA;LISU LETTER TONE MYA CYA;Lm;0;L;;;;;N;;;;;
+A4FB;LISU LETTER TONE MYA BO;Lm;0;L;;;;;N;;;;;
+A4FC;LISU LETTER TONE MYA NA;Lm;0;L;;;;;N;;;;;
+A4FD;LISU LETTER TONE MYA JEU;Lm;0;L;;;;;N;;;;;
+A4FE;LISU PUNCTUATION COMMA;Po;0;L;;;;;N;;;;;
+A4FF;LISU PUNCTUATION FULL STOP;Po;0;L;;;;;N;;;;;
+A500;VAI SYLLABLE EE;Lo;0;L;;;;;N;;;;;
+A501;VAI SYLLABLE EEN;Lo;0;L;;;;;N;;;;;
+A502;VAI SYLLABLE HEE;Lo;0;L;;;;;N;;;;;
+A503;VAI SYLLABLE WEE;Lo;0;L;;;;;N;;;;;
+A504;VAI SYLLABLE WEEN;Lo;0;L;;;;;N;;;;;
+A505;VAI SYLLABLE PEE;Lo;0;L;;;;;N;;;;;
+A506;VAI SYLLABLE BHEE;Lo;0;L;;;;;N;;;;;
+A507;VAI SYLLABLE BEE;Lo;0;L;;;;;N;;;;;
+A508;VAI SYLLABLE MBEE;Lo;0;L;;;;;N;;;;;
+A509;VAI SYLLABLE KPEE;Lo;0;L;;;;;N;;;;;
+A50A;VAI SYLLABLE MGBEE;Lo;0;L;;;;;N;;;;;
+A50B;VAI SYLLABLE GBEE;Lo;0;L;;;;;N;;;;;
+A50C;VAI SYLLABLE FEE;Lo;0;L;;;;;N;;;;;
+A50D;VAI SYLLABLE VEE;Lo;0;L;;;;;N;;;;;
+A50E;VAI SYLLABLE TEE;Lo;0;L;;;;;N;;;;;
+A50F;VAI SYLLABLE THEE;Lo;0;L;;;;;N;;;;;
+A510;VAI SYLLABLE DHEE;Lo;0;L;;;;;N;;;;;
+A511;VAI SYLLABLE DHHEE;Lo;0;L;;;;;N;;;;;
+A512;VAI SYLLABLE LEE;Lo;0;L;;;;;N;;;;;
+A513;VAI SYLLABLE REE;Lo;0;L;;;;;N;;;;;
+A514;VAI SYLLABLE DEE;Lo;0;L;;;;;N;;;;;
+A515;VAI SYLLABLE NDEE;Lo;0;L;;;;;N;;;;;
+A516;VAI SYLLABLE SEE;Lo;0;L;;;;;N;;;;;
+A517;VAI SYLLABLE SHEE;Lo;0;L;;;;;N;;;;;
+A518;VAI SYLLABLE ZEE;Lo;0;L;;;;;N;;;;;
+A519;VAI SYLLABLE ZHEE;Lo;0;L;;;;;N;;;;;
+A51A;VAI SYLLABLE CEE;Lo;0;L;;;;;N;;;;;
+A51B;VAI SYLLABLE JEE;Lo;0;L;;;;;N;;;;;
+A51C;VAI SYLLABLE NJEE;Lo;0;L;;;;;N;;;;;
+A51D;VAI SYLLABLE YEE;Lo;0;L;;;;;N;;;;;
+A51E;VAI SYLLABLE KEE;Lo;0;L;;;;;N;;;;;
+A51F;VAI SYLLABLE NGGEE;Lo;0;L;;;;;N;;;;;
+A520;VAI SYLLABLE GEE;Lo;0;L;;;;;N;;;;;
+A521;VAI SYLLABLE MEE;Lo;0;L;;;;;N;;;;;
+A522;VAI SYLLABLE NEE;Lo;0;L;;;;;N;;;;;
+A523;VAI SYLLABLE NYEE;Lo;0;L;;;;;N;;;;;
+A524;VAI SYLLABLE I;Lo;0;L;;;;;N;;;;;
+A525;VAI SYLLABLE IN;Lo;0;L;;;;;N;;;;;
+A526;VAI SYLLABLE HI;Lo;0;L;;;;;N;;;;;
+A527;VAI SYLLABLE HIN;Lo;0;L;;;;;N;;;;;
+A528;VAI SYLLABLE WI;Lo;0;L;;;;;N;;;;;
+A529;VAI SYLLABLE WIN;Lo;0;L;;;;;N;;;;;
+A52A;VAI SYLLABLE PI;Lo;0;L;;;;;N;;;;;
+A52B;VAI SYLLABLE BHI;Lo;0;L;;;;;N;;;;;
+A52C;VAI SYLLABLE BI;Lo;0;L;;;;;N;;;;;
+A52D;VAI SYLLABLE MBI;Lo;0;L;;;;;N;;;;;
+A52E;VAI SYLLABLE KPI;Lo;0;L;;;;;N;;;;;
+A52F;VAI SYLLABLE MGBI;Lo;0;L;;;;;N;;;;;
+A530;VAI SYLLABLE GBI;Lo;0;L;;;;;N;;;;;
+A531;VAI SYLLABLE FI;Lo;0;L;;;;;N;;;;;
+A532;VAI SYLLABLE VI;Lo;0;L;;;;;N;;;;;
+A533;VAI SYLLABLE TI;Lo;0;L;;;;;N;;;;;
+A534;VAI SYLLABLE THI;Lo;0;L;;;;;N;;;;;
+A535;VAI SYLLABLE DHI;Lo;0;L;;;;;N;;;;;
+A536;VAI SYLLABLE DHHI;Lo;0;L;;;;;N;;;;;
+A537;VAI SYLLABLE LI;Lo;0;L;;;;;N;;;;;
+A538;VAI SYLLABLE RI;Lo;0;L;;;;;N;;;;;
+A539;VAI SYLLABLE DI;Lo;0;L;;;;;N;;;;;
+A53A;VAI SYLLABLE NDI;Lo;0;L;;;;;N;;;;;
+A53B;VAI SYLLABLE SI;Lo;0;L;;;;;N;;;;;
+A53C;VAI SYLLABLE SHI;Lo;0;L;;;;;N;;;;;
+A53D;VAI SYLLABLE ZI;Lo;0;L;;;;;N;;;;;
+A53E;VAI SYLLABLE ZHI;Lo;0;L;;;;;N;;;;;
+A53F;VAI SYLLABLE CI;Lo;0;L;;;;;N;;;;;
+A540;VAI SYLLABLE JI;Lo;0;L;;;;;N;;;;;
+A541;VAI SYLLABLE NJI;Lo;0;L;;;;;N;;;;;
+A542;VAI SYLLABLE YI;Lo;0;L;;;;;N;;;;;
+A543;VAI SYLLABLE KI;Lo;0;L;;;;;N;;;;;
+A544;VAI SYLLABLE NGGI;Lo;0;L;;;;;N;;;;;
+A545;VAI SYLLABLE GI;Lo;0;L;;;;;N;;;;;
+A546;VAI SYLLABLE MI;Lo;0;L;;;;;N;;;;;
+A547;VAI SYLLABLE NI;Lo;0;L;;;;;N;;;;;
+A548;VAI SYLLABLE NYI;Lo;0;L;;;;;N;;;;;
+A549;VAI SYLLABLE A;Lo;0;L;;;;;N;;;;;
+A54A;VAI SYLLABLE AN;Lo;0;L;;;;;N;;;;;
+A54B;VAI SYLLABLE NGAN;Lo;0;L;;;;;N;;;;;
+A54C;VAI SYLLABLE HA;Lo;0;L;;;;;N;;;;;
+A54D;VAI SYLLABLE HAN;Lo;0;L;;;;;N;;;;;
+A54E;VAI SYLLABLE WA;Lo;0;L;;;;;N;;;;;
+A54F;VAI SYLLABLE WAN;Lo;0;L;;;;;N;;;;;
+A550;VAI SYLLABLE PA;Lo;0;L;;;;;N;;;;;
+A551;VAI SYLLABLE BHA;Lo;0;L;;;;;N;;;;;
+A552;VAI SYLLABLE BA;Lo;0;L;;;;;N;;;;;
+A553;VAI SYLLABLE MBA;Lo;0;L;;;;;N;;;;;
+A554;VAI SYLLABLE KPA;Lo;0;L;;;;;N;;;;;
+A555;VAI SYLLABLE KPAN;Lo;0;L;;;;;N;;;;;
+A556;VAI SYLLABLE MGBA;Lo;0;L;;;;;N;;;;;
+A557;VAI SYLLABLE GBA;Lo;0;L;;;;;N;;;;;
+A558;VAI SYLLABLE FA;Lo;0;L;;;;;N;;;;;
+A559;VAI SYLLABLE VA;Lo;0;L;;;;;N;;;;;
+A55A;VAI SYLLABLE TA;Lo;0;L;;;;;N;;;;;
+A55B;VAI SYLLABLE THA;Lo;0;L;;;;;N;;;;;
+A55C;VAI SYLLABLE DHA;Lo;0;L;;;;;N;;;;;
+A55D;VAI SYLLABLE DHHA;Lo;0;L;;;;;N;;;;;
+A55E;VAI SYLLABLE LA;Lo;0;L;;;;;N;;;;;
+A55F;VAI SYLLABLE RA;Lo;0;L;;;;;N;;;;;
+A560;VAI SYLLABLE DA;Lo;0;L;;;;;N;;;;;
+A561;VAI SYLLABLE NDA;Lo;0;L;;;;;N;;;;;
+A562;VAI SYLLABLE SA;Lo;0;L;;;;;N;;;;;
+A563;VAI SYLLABLE SHA;Lo;0;L;;;;;N;;;;;
+A564;VAI SYLLABLE ZA;Lo;0;L;;;;;N;;;;;
+A565;VAI SYLLABLE ZHA;Lo;0;L;;;;;N;;;;;
+A566;VAI SYLLABLE CA;Lo;0;L;;;;;N;;;;;
+A567;VAI SYLLABLE JA;Lo;0;L;;;;;N;;;;;
+A568;VAI SYLLABLE NJA;Lo;0;L;;;;;N;;;;;
+A569;VAI SYLLABLE YA;Lo;0;L;;;;;N;;;;;
+A56A;VAI SYLLABLE KA;Lo;0;L;;;;;N;;;;;
+A56B;VAI SYLLABLE KAN;Lo;0;L;;;;;N;;;;;
+A56C;VAI SYLLABLE NGGA;Lo;0;L;;;;;N;;;;;
+A56D;VAI SYLLABLE GA;Lo;0;L;;;;;N;;;;;
+A56E;VAI SYLLABLE MA;Lo;0;L;;;;;N;;;;;
+A56F;VAI SYLLABLE NA;Lo;0;L;;;;;N;;;;;
+A570;VAI SYLLABLE NYA;Lo;0;L;;;;;N;;;;;
+A571;VAI SYLLABLE OO;Lo;0;L;;;;;N;;;;;
+A572;VAI SYLLABLE OON;Lo;0;L;;;;;N;;;;;
+A573;VAI SYLLABLE HOO;Lo;0;L;;;;;N;;;;;
+A574;VAI SYLLABLE WOO;Lo;0;L;;;;;N;;;;;
+A575;VAI SYLLABLE WOON;Lo;0;L;;;;;N;;;;;
+A576;VAI SYLLABLE POO;Lo;0;L;;;;;N;;;;;
+A577;VAI SYLLABLE BHOO;Lo;0;L;;;;;N;;;;;
+A578;VAI SYLLABLE BOO;Lo;0;L;;;;;N;;;;;
+A579;VAI SYLLABLE MBOO;Lo;0;L;;;;;N;;;;;
+A57A;VAI SYLLABLE KPOO;Lo;0;L;;;;;N;;;;;
+A57B;VAI SYLLABLE MGBOO;Lo;0;L;;;;;N;;;;;
+A57C;VAI SYLLABLE GBOO;Lo;0;L;;;;;N;;;;;
+A57D;VAI SYLLABLE FOO;Lo;0;L;;;;;N;;;;;
+A57E;VAI SYLLABLE VOO;Lo;0;L;;;;;N;;;;;
+A57F;VAI SYLLABLE TOO;Lo;0;L;;;;;N;;;;;
+A580;VAI SYLLABLE THOO;Lo;0;L;;;;;N;;;;;
+A581;VAI SYLLABLE DHOO;Lo;0;L;;;;;N;;;;;
+A582;VAI SYLLABLE DHHOO;Lo;0;L;;;;;N;;;;;
+A583;VAI SYLLABLE LOO;Lo;0;L;;;;;N;;;;;
+A584;VAI SYLLABLE ROO;Lo;0;L;;;;;N;;;;;
+A585;VAI SYLLABLE DOO;Lo;0;L;;;;;N;;;;;
+A586;VAI SYLLABLE NDOO;Lo;0;L;;;;;N;;;;;
+A587;VAI SYLLABLE SOO;Lo;0;L;;;;;N;;;;;
+A588;VAI SYLLABLE SHOO;Lo;0;L;;;;;N;;;;;
+A589;VAI SYLLABLE ZOO;Lo;0;L;;;;;N;;;;;
+A58A;VAI SYLLABLE ZHOO;Lo;0;L;;;;;N;;;;;
+A58B;VAI SYLLABLE COO;Lo;0;L;;;;;N;;;;;
+A58C;VAI SYLLABLE JOO;Lo;0;L;;;;;N;;;;;
+A58D;VAI SYLLABLE NJOO;Lo;0;L;;;;;N;;;;;
+A58E;VAI SYLLABLE YOO;Lo;0;L;;;;;N;;;;;
+A58F;VAI SYLLABLE KOO;Lo;0;L;;;;;N;;;;;
+A590;VAI SYLLABLE NGGOO;Lo;0;L;;;;;N;;;;;
+A591;VAI SYLLABLE GOO;Lo;0;L;;;;;N;;;;;
+A592;VAI SYLLABLE MOO;Lo;0;L;;;;;N;;;;;
+A593;VAI SYLLABLE NOO;Lo;0;L;;;;;N;;;;;
+A594;VAI SYLLABLE NYOO;Lo;0;L;;;;;N;;;;;
+A595;VAI SYLLABLE U;Lo;0;L;;;;;N;;;;;
+A596;VAI SYLLABLE UN;Lo;0;L;;;;;N;;;;;
+A597;VAI SYLLABLE HU;Lo;0;L;;;;;N;;;;;
+A598;VAI SYLLABLE HUN;Lo;0;L;;;;;N;;;;;
+A599;VAI SYLLABLE WU;Lo;0;L;;;;;N;;;;;
+A59A;VAI SYLLABLE WUN;Lo;0;L;;;;;N;;;;;
+A59B;VAI SYLLABLE PU;Lo;0;L;;;;;N;;;;;
+A59C;VAI SYLLABLE BHU;Lo;0;L;;;;;N;;;;;
+A59D;VAI SYLLABLE BU;Lo;0;L;;;;;N;;;;;
+A59E;VAI SYLLABLE MBU;Lo;0;L;;;;;N;;;;;
+A59F;VAI SYLLABLE KPU;Lo;0;L;;;;;N;;;;;
+A5A0;VAI SYLLABLE MGBU;Lo;0;L;;;;;N;;;;;
+A5A1;VAI SYLLABLE GBU;Lo;0;L;;;;;N;;;;;
+A5A2;VAI SYLLABLE FU;Lo;0;L;;;;;N;;;;;
+A5A3;VAI SYLLABLE VU;Lo;0;L;;;;;N;;;;;
+A5A4;VAI SYLLABLE TU;Lo;0;L;;;;;N;;;;;
+A5A5;VAI SYLLABLE THU;Lo;0;L;;;;;N;;;;;
+A5A6;VAI SYLLABLE DHU;Lo;0;L;;;;;N;;;;;
+A5A7;VAI SYLLABLE DHHU;Lo;0;L;;;;;N;;;;;
+A5A8;VAI SYLLABLE LU;Lo;0;L;;;;;N;;;;;
+A5A9;VAI SYLLABLE RU;Lo;0;L;;;;;N;;;;;
+A5AA;VAI SYLLABLE DU;Lo;0;L;;;;;N;;;;;
+A5AB;VAI SYLLABLE NDU;Lo;0;L;;;;;N;;;;;
+A5AC;VAI SYLLABLE SU;Lo;0;L;;;;;N;;;;;
+A5AD;VAI SYLLABLE SHU;Lo;0;L;;;;;N;;;;;
+A5AE;VAI SYLLABLE ZU;Lo;0;L;;;;;N;;;;;
+A5AF;VAI SYLLABLE ZHU;Lo;0;L;;;;;N;;;;;
+A5B0;VAI SYLLABLE CU;Lo;0;L;;;;;N;;;;;
+A5B1;VAI SYLLABLE JU;Lo;0;L;;;;;N;;;;;
+A5B2;VAI SYLLABLE NJU;Lo;0;L;;;;;N;;;;;
+A5B3;VAI SYLLABLE YU;Lo;0;L;;;;;N;;;;;
+A5B4;VAI SYLLABLE KU;Lo;0;L;;;;;N;;;;;
+A5B5;VAI SYLLABLE NGGU;Lo;0;L;;;;;N;;;;;
+A5B6;VAI SYLLABLE GU;Lo;0;L;;;;;N;;;;;
+A5B7;VAI SYLLABLE MU;Lo;0;L;;;;;N;;;;;
+A5B8;VAI SYLLABLE NU;Lo;0;L;;;;;N;;;;;
+A5B9;VAI SYLLABLE NYU;Lo;0;L;;;;;N;;;;;
+A5BA;VAI SYLLABLE O;Lo;0;L;;;;;N;;;;;
+A5BB;VAI SYLLABLE ON;Lo;0;L;;;;;N;;;;;
+A5BC;VAI SYLLABLE NGON;Lo;0;L;;;;;N;;;;;
+A5BD;VAI SYLLABLE HO;Lo;0;L;;;;;N;;;;;
+A5BE;VAI SYLLABLE HON;Lo;0;L;;;;;N;;;;;
+A5BF;VAI SYLLABLE WO;Lo;0;L;;;;;N;;;;;
+A5C0;VAI SYLLABLE WON;Lo;0;L;;;;;N;;;;;
+A5C1;VAI SYLLABLE PO;Lo;0;L;;;;;N;;;;;
+A5C2;VAI SYLLABLE BHO;Lo;0;L;;;;;N;;;;;
+A5C3;VAI SYLLABLE BO;Lo;0;L;;;;;N;;;;;
+A5C4;VAI SYLLABLE MBO;Lo;0;L;;;;;N;;;;;
+A5C5;VAI SYLLABLE KPO;Lo;0;L;;;;;N;;;;;
+A5C6;VAI SYLLABLE MGBO;Lo;0;L;;;;;N;;;;;
+A5C7;VAI SYLLABLE GBO;Lo;0;L;;;;;N;;;;;
+A5C8;VAI SYLLABLE GBON;Lo;0;L;;;;;N;;;;;
+A5C9;VAI SYLLABLE FO;Lo;0;L;;;;;N;;;;;
+A5CA;VAI SYLLABLE VO;Lo;0;L;;;;;N;;;;;
+A5CB;VAI SYLLABLE TO;Lo;0;L;;;;;N;;;;;
+A5CC;VAI SYLLABLE THO;Lo;0;L;;;;;N;;;;;
+A5CD;VAI SYLLABLE DHO;Lo;0;L;;;;;N;;;;;
+A5CE;VAI SYLLABLE DHHO;Lo;0;L;;;;;N;;;;;
+A5CF;VAI SYLLABLE LO;Lo;0;L;;;;;N;;;;;
+A5D0;VAI SYLLABLE RO;Lo;0;L;;;;;N;;;;;
+A5D1;VAI SYLLABLE DO;Lo;0;L;;;;;N;;;;;
+A5D2;VAI SYLLABLE NDO;Lo;0;L;;;;;N;;;;;
+A5D3;VAI SYLLABLE SO;Lo;0;L;;;;;N;;;;;
+A5D4;VAI SYLLABLE SHO;Lo;0;L;;;;;N;;;;;
+A5D5;VAI SYLLABLE ZO;Lo;0;L;;;;;N;;;;;
+A5D6;VAI SYLLABLE ZHO;Lo;0;L;;;;;N;;;;;
+A5D7;VAI SYLLABLE CO;Lo;0;L;;;;;N;;;;;
+A5D8;VAI SYLLABLE JO;Lo;0;L;;;;;N;;;;;
+A5D9;VAI SYLLABLE NJO;Lo;0;L;;;;;N;;;;;
+A5DA;VAI SYLLABLE YO;Lo;0;L;;;;;N;;;;;
+A5DB;VAI SYLLABLE KO;Lo;0;L;;;;;N;;;;;
+A5DC;VAI SYLLABLE NGGO;Lo;0;L;;;;;N;;;;;
+A5DD;VAI SYLLABLE GO;Lo;0;L;;;;;N;;;;;
+A5DE;VAI SYLLABLE MO;Lo;0;L;;;;;N;;;;;
+A5DF;VAI SYLLABLE NO;Lo;0;L;;;;;N;;;;;
+A5E0;VAI SYLLABLE NYO;Lo;0;L;;;;;N;;;;;
+A5E1;VAI SYLLABLE E;Lo;0;L;;;;;N;;;;;
+A5E2;VAI SYLLABLE EN;Lo;0;L;;;;;N;;;;;
+A5E3;VAI SYLLABLE NGEN;Lo;0;L;;;;;N;;;;;
+A5E4;VAI SYLLABLE HE;Lo;0;L;;;;;N;;;;;
+A5E5;VAI SYLLABLE HEN;Lo;0;L;;;;;N;;;;;
+A5E6;VAI SYLLABLE WE;Lo;0;L;;;;;N;;;;;
+A5E7;VAI SYLLABLE WEN;Lo;0;L;;;;;N;;;;;
+A5E8;VAI SYLLABLE PE;Lo;0;L;;;;;N;;;;;
+A5E9;VAI SYLLABLE BHE;Lo;0;L;;;;;N;;;;;
+A5EA;VAI SYLLABLE BE;Lo;0;L;;;;;N;;;;;
+A5EB;VAI SYLLABLE MBE;Lo;0;L;;;;;N;;;;;
+A5EC;VAI SYLLABLE KPE;Lo;0;L;;;;;N;;;;;
+A5ED;VAI SYLLABLE KPEN;Lo;0;L;;;;;N;;;;;
+A5EE;VAI SYLLABLE MGBE;Lo;0;L;;;;;N;;;;;
+A5EF;VAI SYLLABLE GBE;Lo;0;L;;;;;N;;;;;
+A5F0;VAI SYLLABLE GBEN;Lo;0;L;;;;;N;;;;;
+A5F1;VAI SYLLABLE FE;Lo;0;L;;;;;N;;;;;
+A5F2;VAI SYLLABLE VE;Lo;0;L;;;;;N;;;;;
+A5F3;VAI SYLLABLE TE;Lo;0;L;;;;;N;;;;;
+A5F4;VAI SYLLABLE THE;Lo;0;L;;;;;N;;;;;
+A5F5;VAI SYLLABLE DHE;Lo;0;L;;;;;N;;;;;
+A5F6;VAI SYLLABLE DHHE;Lo;0;L;;;;;N;;;;;
+A5F7;VAI SYLLABLE LE;Lo;0;L;;;;;N;;;;;
+A5F8;VAI SYLLABLE RE;Lo;0;L;;;;;N;;;;;
+A5F9;VAI SYLLABLE DE;Lo;0;L;;;;;N;;;;;
+A5FA;VAI SYLLABLE NDE;Lo;0;L;;;;;N;;;;;
+A5FB;VAI SYLLABLE SE;Lo;0;L;;;;;N;;;;;
+A5FC;VAI SYLLABLE SHE;Lo;0;L;;;;;N;;;;;
+A5FD;VAI SYLLABLE ZE;Lo;0;L;;;;;N;;;;;
+A5FE;VAI SYLLABLE ZHE;Lo;0;L;;;;;N;;;;;
+A5FF;VAI SYLLABLE CE;Lo;0;L;;;;;N;;;;;
+A600;VAI SYLLABLE JE;Lo;0;L;;;;;N;;;;;
+A601;VAI SYLLABLE NJE;Lo;0;L;;;;;N;;;;;
+A602;VAI SYLLABLE YE;Lo;0;L;;;;;N;;;;;
+A603;VAI SYLLABLE KE;Lo;0;L;;;;;N;;;;;
+A604;VAI SYLLABLE NGGE;Lo;0;L;;;;;N;;;;;
+A605;VAI SYLLABLE NGGEN;Lo;0;L;;;;;N;;;;;
+A606;VAI SYLLABLE GE;Lo;0;L;;;;;N;;;;;
+A607;VAI SYLLABLE GEN;Lo;0;L;;;;;N;;;;;
+A608;VAI SYLLABLE ME;Lo;0;L;;;;;N;;;;;
+A609;VAI SYLLABLE NE;Lo;0;L;;;;;N;;;;;
+A60A;VAI SYLLABLE NYE;Lo;0;L;;;;;N;;;;;
+A60B;VAI SYLLABLE NG;Lo;0;L;;;;;N;;;;;
+A60C;VAI SYLLABLE LENGTHENER;Lm;0;L;;;;;N;;;;;
+A60D;VAI COMMA;Po;0;ON;;;;;N;;;;;
+A60E;VAI FULL STOP;Po;0;ON;;;;;N;;;;;
+A60F;VAI QUESTION MARK;Po;0;ON;;;;;N;;;;;
+A610;VAI SYLLABLE NDOLE FA;Lo;0;L;;;;;N;;;;;
+A611;VAI SYLLABLE NDOLE KA;Lo;0;L;;;;;N;;;;;
+A612;VAI SYLLABLE NDOLE SOO;Lo;0;L;;;;;N;;;;;
+A613;VAI SYMBOL FEENG;Lo;0;L;;;;;N;;;;;
+A614;VAI SYMBOL KEENG;Lo;0;L;;;;;N;;;;;
+A615;VAI SYMBOL TING;Lo;0;L;;;;;N;;;;;
+A616;VAI SYMBOL NII;Lo;0;L;;;;;N;;;;;
+A617;VAI SYMBOL BANG;Lo;0;L;;;;;N;;;;;
+A618;VAI SYMBOL FAA;Lo;0;L;;;;;N;;;;;
+A619;VAI SYMBOL TAA;Lo;0;L;;;;;N;;;;;
+A61A;VAI SYMBOL DANG;Lo;0;L;;;;;N;;;;;
+A61B;VAI SYMBOL DOONG;Lo;0;L;;;;;N;;;;;
+A61C;VAI SYMBOL KUNG;Lo;0;L;;;;;N;;;;;
+A61D;VAI SYMBOL TONG;Lo;0;L;;;;;N;;;;;
+A61E;VAI SYMBOL DO-O;Lo;0;L;;;;;N;;;;;
+A61F;VAI SYMBOL JONG;Lo;0;L;;;;;N;;;;;
+A620;VAI DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+A621;VAI DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+A622;VAI DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+A623;VAI DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+A624;VAI DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+A625;VAI DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+A626;VAI DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+A627;VAI DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+A628;VAI DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+A629;VAI DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+A62A;VAI SYLLABLE NDOLE MA;Lo;0;L;;;;;N;;;;;
+A62B;VAI SYLLABLE NDOLE DO;Lo;0;L;;;;;N;;;;;
+A640;CYRILLIC CAPITAL LETTER ZEMLYA;Lu;0;L;;;;;N;;;;A641;
+A641;CYRILLIC SMALL LETTER ZEMLYA;Ll;0;L;;;;;N;;;A640;;A640
+A642;CYRILLIC CAPITAL LETTER DZELO;Lu;0;L;;;;;N;;;;A643;
+A643;CYRILLIC SMALL LETTER DZELO;Ll;0;L;;;;;N;;;A642;;A642
+A644;CYRILLIC CAPITAL LETTER REVERSED DZE;Lu;0;L;;;;;N;;;;A645;
+A645;CYRILLIC SMALL LETTER REVERSED DZE;Ll;0;L;;;;;N;;;A644;;A644
+A646;CYRILLIC CAPITAL LETTER IOTA;Lu;0;L;;;;;N;;;;A647;
+A647;CYRILLIC SMALL LETTER IOTA;Ll;0;L;;;;;N;;;A646;;A646
+A648;CYRILLIC CAPITAL LETTER DJERV;Lu;0;L;;;;;N;;;;A649;
+A649;CYRILLIC SMALL LETTER DJERV;Ll;0;L;;;;;N;;;A648;;A648
+A64A;CYRILLIC CAPITAL LETTER MONOGRAPH UK;Lu;0;L;;;;;N;;;;A64B;
+A64B;CYRILLIC SMALL LETTER MONOGRAPH UK;Ll;0;L;;;;;N;;;A64A;;A64A
+A64C;CYRILLIC CAPITAL LETTER BROAD OMEGA;Lu;0;L;;;;;N;;;;A64D;
+A64D;CYRILLIC SMALL LETTER BROAD OMEGA;Ll;0;L;;;;;N;;;A64C;;A64C
+A64E;CYRILLIC CAPITAL LETTER NEUTRAL YER;Lu;0;L;;;;;N;;;;A64F;
+A64F;CYRILLIC SMALL LETTER NEUTRAL YER;Ll;0;L;;;;;N;;;A64E;;A64E
+A650;CYRILLIC CAPITAL LETTER YERU WITH BACK YER;Lu;0;L;;;;;N;;;;A651;
+A651;CYRILLIC SMALL LETTER YERU WITH BACK YER;Ll;0;L;;;;;N;;;A650;;A650
+A652;CYRILLIC CAPITAL LETTER IOTIFIED YAT;Lu;0;L;;;;;N;;;;A653;
+A653;CYRILLIC SMALL LETTER IOTIFIED YAT;Ll;0;L;;;;;N;;;A652;;A652
+A654;CYRILLIC CAPITAL LETTER REVERSED YU;Lu;0;L;;;;;N;;;;A655;
+A655;CYRILLIC SMALL LETTER REVERSED YU;Ll;0;L;;;;;N;;;A654;;A654
+A656;CYRILLIC CAPITAL LETTER IOTIFIED A;Lu;0;L;;;;;N;;;;A657;
+A657;CYRILLIC SMALL LETTER IOTIFIED A;Ll;0;L;;;;;N;;;A656;;A656
+A658;CYRILLIC CAPITAL LETTER CLOSED LITTLE YUS;Lu;0;L;;;;;N;;;;A659;
+A659;CYRILLIC SMALL LETTER CLOSED LITTLE YUS;Ll;0;L;;;;;N;;;A658;;A658
+A65A;CYRILLIC CAPITAL LETTER BLENDED YUS;Lu;0;L;;;;;N;;;;A65B;
+A65B;CYRILLIC SMALL LETTER BLENDED YUS;Ll;0;L;;;;;N;;;A65A;;A65A
+A65C;CYRILLIC CAPITAL LETTER IOTIFIED CLOSED LITTLE YUS;Lu;0;L;;;;;N;;;;A65D;
+A65D;CYRILLIC SMALL LETTER IOTIFIED CLOSED LITTLE YUS;Ll;0;L;;;;;N;;;A65C;;A65C
+A65E;CYRILLIC CAPITAL LETTER YN;Lu;0;L;;;;;N;;;;A65F;
+A65F;CYRILLIC SMALL LETTER YN;Ll;0;L;;;;;N;;;A65E;;A65E
+A660;CYRILLIC CAPITAL LETTER REVERSED TSE;Lu;0;L;;;;;N;;;;A661;
+A661;CYRILLIC SMALL LETTER REVERSED TSE;Ll;0;L;;;;;N;;;A660;;A660
+A662;CYRILLIC CAPITAL LETTER SOFT DE;Lu;0;L;;;;;N;;;;A663;
+A663;CYRILLIC SMALL LETTER SOFT DE;Ll;0;L;;;;;N;;;A662;;A662
+A664;CYRILLIC CAPITAL LETTER SOFT EL;Lu;0;L;;;;;N;;;;A665;
+A665;CYRILLIC SMALL LETTER SOFT EL;Ll;0;L;;;;;N;;;A664;;A664
+A666;CYRILLIC CAPITAL LETTER SOFT EM;Lu;0;L;;;;;N;;;;A667;
+A667;CYRILLIC SMALL LETTER SOFT EM;Ll;0;L;;;;;N;;;A666;;A666
+A668;CYRILLIC CAPITAL LETTER MONOCULAR O;Lu;0;L;;;;;N;;;;A669;
+A669;CYRILLIC SMALL LETTER MONOCULAR O;Ll;0;L;;;;;N;;;A668;;A668
+A66A;CYRILLIC CAPITAL LETTER BINOCULAR O;Lu;0;L;;;;;N;;;;A66B;
+A66B;CYRILLIC SMALL LETTER BINOCULAR O;Ll;0;L;;;;;N;;;A66A;;A66A
+A66C;CYRILLIC CAPITAL LETTER DOUBLE MONOCULAR O;Lu;0;L;;;;;N;;;;A66D;
+A66D;CYRILLIC SMALL LETTER DOUBLE MONOCULAR O;Ll;0;L;;;;;N;;;A66C;;A66C
+A66E;CYRILLIC LETTER MULTIOCULAR O;Lo;0;L;;;;;N;;;;;
+A66F;COMBINING CYRILLIC VZMET;Mn;230;NSM;;;;;N;;;;;
+A670;COMBINING CYRILLIC TEN MILLIONS SIGN;Me;0;NSM;;;;;N;;;;;
+A671;COMBINING CYRILLIC HUNDRED MILLIONS SIGN;Me;0;NSM;;;;;N;;;;;
+A672;COMBINING CYRILLIC THOUSAND MILLIONS SIGN;Me;0;NSM;;;;;N;;;;;
+A673;SLAVONIC ASTERISK;Po;0;ON;;;;;N;;;;;
+A674;COMBINING CYRILLIC LETTER UKRAINIAN IE;Mn;230;NSM;;;;;N;;;;;
+A675;COMBINING CYRILLIC LETTER I;Mn;230;NSM;;;;;N;;;;;
+A676;COMBINING CYRILLIC LETTER YI;Mn;230;NSM;;;;;N;;;;;
+A677;COMBINING CYRILLIC LETTER U;Mn;230;NSM;;;;;N;;;;;
+A678;COMBINING CYRILLIC LETTER HARD SIGN;Mn;230;NSM;;;;;N;;;;;
+A679;COMBINING CYRILLIC LETTER YERU;Mn;230;NSM;;;;;N;;;;;
+A67A;COMBINING CYRILLIC LETTER SOFT SIGN;Mn;230;NSM;;;;;N;;;;;
+A67B;COMBINING CYRILLIC LETTER OMEGA;Mn;230;NSM;;;;;N;;;;;
+A67C;COMBINING CYRILLIC KAVYKA;Mn;230;NSM;;;;;N;;;;;
+A67D;COMBINING CYRILLIC PAYEROK;Mn;230;NSM;;;;;N;;;;;
+A67E;CYRILLIC KAVYKA;Po;0;ON;;;;;N;;;;;
+A67F;CYRILLIC PAYEROK;Lm;0;ON;;;;;N;;;;;
+A680;CYRILLIC CAPITAL LETTER DWE;Lu;0;L;;;;;N;;;;A681;
+A681;CYRILLIC SMALL LETTER DWE;Ll;0;L;;;;;N;;;A680;;A680
+A682;CYRILLIC CAPITAL LETTER DZWE;Lu;0;L;;;;;N;;;;A683;
+A683;CYRILLIC SMALL LETTER DZWE;Ll;0;L;;;;;N;;;A682;;A682
+A684;CYRILLIC CAPITAL LETTER ZHWE;Lu;0;L;;;;;N;;;;A685;
+A685;CYRILLIC SMALL LETTER ZHWE;Ll;0;L;;;;;N;;;A684;;A684
+A686;CYRILLIC CAPITAL LETTER CCHE;Lu;0;L;;;;;N;;;;A687;
+A687;CYRILLIC SMALL LETTER CCHE;Ll;0;L;;;;;N;;;A686;;A686
+A688;CYRILLIC CAPITAL LETTER DZZE;Lu;0;L;;;;;N;;;;A689;
+A689;CYRILLIC SMALL LETTER DZZE;Ll;0;L;;;;;N;;;A688;;A688
+A68A;CYRILLIC CAPITAL LETTER TE WITH MIDDLE HOOK;Lu;0;L;;;;;N;;;;A68B;
+A68B;CYRILLIC SMALL LETTER TE WITH MIDDLE HOOK;Ll;0;L;;;;;N;;;A68A;;A68A
+A68C;CYRILLIC CAPITAL LETTER TWE;Lu;0;L;;;;;N;;;;A68D;
+A68D;CYRILLIC SMALL LETTER TWE;Ll;0;L;;;;;N;;;A68C;;A68C
+A68E;CYRILLIC CAPITAL LETTER TSWE;Lu;0;L;;;;;N;;;;A68F;
+A68F;CYRILLIC SMALL LETTER TSWE;Ll;0;L;;;;;N;;;A68E;;A68E
+A690;CYRILLIC CAPITAL LETTER TSSE;Lu;0;L;;;;;N;;;;A691;
+A691;CYRILLIC SMALL LETTER TSSE;Ll;0;L;;;;;N;;;A690;;A690
+A692;CYRILLIC CAPITAL LETTER TCHE;Lu;0;L;;;;;N;;;;A693;
+A693;CYRILLIC SMALL LETTER TCHE;Ll;0;L;;;;;N;;;A692;;A692
+A694;CYRILLIC CAPITAL LETTER HWE;Lu;0;L;;;;;N;;;;A695;
+A695;CYRILLIC SMALL LETTER HWE;Ll;0;L;;;;;N;;;A694;;A694
+A696;CYRILLIC CAPITAL LETTER SHWE;Lu;0;L;;;;;N;;;;A697;
+A697;CYRILLIC SMALL LETTER SHWE;Ll;0;L;;;;;N;;;A696;;A696
+A698;CYRILLIC CAPITAL LETTER DOUBLE O;Lu;0;L;;;;;N;;;;A699;
+A699;CYRILLIC SMALL LETTER DOUBLE O;Ll;0;L;;;;;N;;;A698;;A698
+A69A;CYRILLIC CAPITAL LETTER CROSSED O;Lu;0;L;;;;;N;;;;A69B;
+A69B;CYRILLIC SMALL LETTER CROSSED O;Ll;0;L;;;;;N;;;A69A;;A69A
+A69C;MODIFIER LETTER CYRILLIC HARD SIGN;Lm;0;L;<super> 044A;;;;N;;;;;
+A69D;MODIFIER LETTER CYRILLIC SOFT SIGN;Lm;0;L;<super> 044C;;;;N;;;;;
+A69E;COMBINING CYRILLIC LETTER EF;Mn;230;NSM;;;;;N;;;;;
+A69F;COMBINING CYRILLIC LETTER IOTIFIED E;Mn;230;NSM;;;;;N;;;;;
+A6A0;BAMUM LETTER A;Lo;0;L;;;;;N;;;;;
+A6A1;BAMUM LETTER KA;Lo;0;L;;;;;N;;;;;
+A6A2;BAMUM LETTER U;Lo;0;L;;;;;N;;;;;
+A6A3;BAMUM LETTER KU;Lo;0;L;;;;;N;;;;;
+A6A4;BAMUM LETTER EE;Lo;0;L;;;;;N;;;;;
+A6A5;BAMUM LETTER REE;Lo;0;L;;;;;N;;;;;
+A6A6;BAMUM LETTER TAE;Lo;0;L;;;;;N;;;;;
+A6A7;BAMUM LETTER O;Lo;0;L;;;;;N;;;;;
+A6A8;BAMUM LETTER NYI;Lo;0;L;;;;;N;;;;;
+A6A9;BAMUM LETTER I;Lo;0;L;;;;;N;;;;;
+A6AA;BAMUM LETTER LA;Lo;0;L;;;;;N;;;;;
+A6AB;BAMUM LETTER PA;Lo;0;L;;;;;N;;;;;
+A6AC;BAMUM LETTER RII;Lo;0;L;;;;;N;;;;;
+A6AD;BAMUM LETTER RIEE;Lo;0;L;;;;;N;;;;;
+A6AE;BAMUM LETTER LEEEE;Lo;0;L;;;;;N;;;;;
+A6AF;BAMUM LETTER MEEEE;Lo;0;L;;;;;N;;;;;
+A6B0;BAMUM LETTER TAA;Lo;0;L;;;;;N;;;;;
+A6B1;BAMUM LETTER NDAA;Lo;0;L;;;;;N;;;;;
+A6B2;BAMUM LETTER NJAEM;Lo;0;L;;;;;N;;;;;
+A6B3;BAMUM LETTER M;Lo;0;L;;;;;N;;;;;
+A6B4;BAMUM LETTER SUU;Lo;0;L;;;;;N;;;;;
+A6B5;BAMUM LETTER MU;Lo;0;L;;;;;N;;;;;
+A6B6;BAMUM LETTER SHII;Lo;0;L;;;;;N;;;;;
+A6B7;BAMUM LETTER SI;Lo;0;L;;;;;N;;;;;
+A6B8;BAMUM LETTER SHEUX;Lo;0;L;;;;;N;;;;;
+A6B9;BAMUM LETTER SEUX;Lo;0;L;;;;;N;;;;;
+A6BA;BAMUM LETTER KYEE;Lo;0;L;;;;;N;;;;;
+A6BB;BAMUM LETTER KET;Lo;0;L;;;;;N;;;;;
+A6BC;BAMUM LETTER NUAE;Lo;0;L;;;;;N;;;;;
+A6BD;BAMUM LETTER NU;Lo;0;L;;;;;N;;;;;
+A6BE;BAMUM LETTER NJUAE;Lo;0;L;;;;;N;;;;;
+A6BF;BAMUM LETTER YOQ;Lo;0;L;;;;;N;;;;;
+A6C0;BAMUM LETTER SHU;Lo;0;L;;;;;N;;;;;
+A6C1;BAMUM LETTER YUQ;Lo;0;L;;;;;N;;;;;
+A6C2;BAMUM LETTER YA;Lo;0;L;;;;;N;;;;;
+A6C3;BAMUM LETTER NSHA;Lo;0;L;;;;;N;;;;;
+A6C4;BAMUM LETTER KEUX;Lo;0;L;;;;;N;;;;;
+A6C5;BAMUM LETTER PEUX;Lo;0;L;;;;;N;;;;;
+A6C6;BAMUM LETTER NJEE;Lo;0;L;;;;;N;;;;;
+A6C7;BAMUM LETTER NTEE;Lo;0;L;;;;;N;;;;;
+A6C8;BAMUM LETTER PUE;Lo;0;L;;;;;N;;;;;
+A6C9;BAMUM LETTER WUE;Lo;0;L;;;;;N;;;;;
+A6CA;BAMUM LETTER PEE;Lo;0;L;;;;;N;;;;;
+A6CB;BAMUM LETTER FEE;Lo;0;L;;;;;N;;;;;
+A6CC;BAMUM LETTER RU;Lo;0;L;;;;;N;;;;;
+A6CD;BAMUM LETTER LU;Lo;0;L;;;;;N;;;;;
+A6CE;BAMUM LETTER MI;Lo;0;L;;;;;N;;;;;
+A6CF;BAMUM LETTER NI;Lo;0;L;;;;;N;;;;;
+A6D0;BAMUM LETTER REUX;Lo;0;L;;;;;N;;;;;
+A6D1;BAMUM LETTER RAE;Lo;0;L;;;;;N;;;;;
+A6D2;BAMUM LETTER KEN;Lo;0;L;;;;;N;;;;;
+A6D3;BAMUM LETTER NGKWAEN;Lo;0;L;;;;;N;;;;;
+A6D4;BAMUM LETTER NGGA;Lo;0;L;;;;;N;;;;;
+A6D5;BAMUM LETTER NGA;Lo;0;L;;;;;N;;;;;
+A6D6;BAMUM LETTER SHO;Lo;0;L;;;;;N;;;;;
+A6D7;BAMUM LETTER PUAE;Lo;0;L;;;;;N;;;;;
+A6D8;BAMUM LETTER FU;Lo;0;L;;;;;N;;;;;
+A6D9;BAMUM LETTER FOM;Lo;0;L;;;;;N;;;;;
+A6DA;BAMUM LETTER WA;Lo;0;L;;;;;N;;;;;
+A6DB;BAMUM LETTER NA;Lo;0;L;;;;;N;;;;;
+A6DC;BAMUM LETTER LI;Lo;0;L;;;;;N;;;;;
+A6DD;BAMUM LETTER PI;Lo;0;L;;;;;N;;;;;
+A6DE;BAMUM LETTER LOQ;Lo;0;L;;;;;N;;;;;
+A6DF;BAMUM LETTER KO;Lo;0;L;;;;;N;;;;;
+A6E0;BAMUM LETTER MBEN;Lo;0;L;;;;;N;;;;;
+A6E1;BAMUM LETTER REN;Lo;0;L;;;;;N;;;;;
+A6E2;BAMUM LETTER MEN;Lo;0;L;;;;;N;;;;;
+A6E3;BAMUM LETTER MA;Lo;0;L;;;;;N;;;;;
+A6E4;BAMUM LETTER TI;Lo;0;L;;;;;N;;;;;
+A6E5;BAMUM LETTER KI;Lo;0;L;;;;;N;;;;;
+A6E6;BAMUM LETTER MO;Nl;0;L;;;;1;N;;;;;
+A6E7;BAMUM LETTER MBAA;Nl;0;L;;;;2;N;;;;;
+A6E8;BAMUM LETTER TET;Nl;0;L;;;;3;N;;;;;
+A6E9;BAMUM LETTER KPA;Nl;0;L;;;;4;N;;;;;
+A6EA;BAMUM LETTER TEN;Nl;0;L;;;;5;N;;;;;
+A6EB;BAMUM LETTER NTUU;Nl;0;L;;;;6;N;;;;;
+A6EC;BAMUM LETTER SAMBA;Nl;0;L;;;;7;N;;;;;
+A6ED;BAMUM LETTER FAAMAE;Nl;0;L;;;;8;N;;;;;
+A6EE;BAMUM LETTER KOVUU;Nl;0;L;;;;9;N;;;;;
+A6EF;BAMUM LETTER KOGHOM;Nl;0;L;;;;0;N;;;;;
+A6F0;BAMUM COMBINING MARK KOQNDON;Mn;230;NSM;;;;;N;;;;;
+A6F1;BAMUM COMBINING MARK TUKWENTIS;Mn;230;NSM;;;;;N;;;;;
+A6F2;BAMUM NJAEMLI;Po;0;L;;;;;N;;;;;
+A6F3;BAMUM FULL STOP;Po;0;L;;;;;N;;;;;
+A6F4;BAMUM COLON;Po;0;L;;;;;N;;;;;
+A6F5;BAMUM COMMA;Po;0;L;;;;;N;;;;;
+A6F6;BAMUM SEMICOLON;Po;0;L;;;;;N;;;;;
+A6F7;BAMUM QUESTION MARK;Po;0;L;;;;;N;;;;;
+A700;MODIFIER LETTER CHINESE TONE YIN PING;Sk;0;ON;;;;;N;;;;;
+A701;MODIFIER LETTER CHINESE TONE YANG PING;Sk;0;ON;;;;;N;;;;;
+A702;MODIFIER LETTER CHINESE TONE YIN SHANG;Sk;0;ON;;;;;N;;;;;
+A703;MODIFIER LETTER CHINESE TONE YANG SHANG;Sk;0;ON;;;;;N;;;;;
+A704;MODIFIER LETTER CHINESE TONE YIN QU;Sk;0;ON;;;;;N;;;;;
+A705;MODIFIER LETTER CHINESE TONE YANG QU;Sk;0;ON;;;;;N;;;;;
+A706;MODIFIER LETTER CHINESE TONE YIN RU;Sk;0;ON;;;;;N;;;;;
+A707;MODIFIER LETTER CHINESE TONE YANG RU;Sk;0;ON;;;;;N;;;;;
+A708;MODIFIER LETTER EXTRA-HIGH DOTTED TONE BAR;Sk;0;ON;;;;;N;;;;;
+A709;MODIFIER LETTER HIGH DOTTED TONE BAR;Sk;0;ON;;;;;N;;;;;
+A70A;MODIFIER LETTER MID DOTTED TONE BAR;Sk;0;ON;;;;;N;;;;;
+A70B;MODIFIER LETTER LOW DOTTED TONE BAR;Sk;0;ON;;;;;N;;;;;
+A70C;MODIFIER LETTER EXTRA-LOW DOTTED TONE BAR;Sk;0;ON;;;;;N;;;;;
+A70D;MODIFIER LETTER EXTRA-HIGH DOTTED LEFT-STEM TONE BAR;Sk;0;ON;;;;;N;;;;;
+A70E;MODIFIER LETTER HIGH DOTTED LEFT-STEM TONE BAR;Sk;0;ON;;;;;N;;;;;
+A70F;MODIFIER LETTER MID DOTTED LEFT-STEM TONE BAR;Sk;0;ON;;;;;N;;;;;
+A710;MODIFIER LETTER LOW DOTTED LEFT-STEM TONE BAR;Sk;0;ON;;;;;N;;;;;
+A711;MODIFIER LETTER EXTRA-LOW DOTTED LEFT-STEM TONE BAR;Sk;0;ON;;;;;N;;;;;
+A712;MODIFIER LETTER EXTRA-HIGH LEFT-STEM TONE BAR;Sk;0;ON;;;;;N;;;;;
+A713;MODIFIER LETTER HIGH LEFT-STEM TONE BAR;Sk;0;ON;;;;;N;;;;;
+A714;MODIFIER LETTER MID LEFT-STEM TONE BAR;Sk;0;ON;;;;;N;;;;;
+A715;MODIFIER LETTER LOW LEFT-STEM TONE BAR;Sk;0;ON;;;;;N;;;;;
+A716;MODIFIER LETTER EXTRA-LOW LEFT-STEM TONE BAR;Sk;0;ON;;;;;N;;;;;
+A717;MODIFIER LETTER DOT VERTICAL BAR;Lm;0;ON;;;;;N;;;;;
+A718;MODIFIER LETTER DOT SLASH;Lm;0;ON;;;;;N;;;;;
+A719;MODIFIER LETTER DOT HORIZONTAL BAR;Lm;0;ON;;;;;N;;;;;
+A71A;MODIFIER LETTER LOWER RIGHT CORNER ANGLE;Lm;0;ON;;;;;N;;;;;
+A71B;MODIFIER LETTER RAISED UP ARROW;Lm;0;ON;;;;;N;;;;;
+A71C;MODIFIER LETTER RAISED DOWN ARROW;Lm;0;ON;;;;;N;;;;;
+A71D;MODIFIER LETTER RAISED EXCLAMATION MARK;Lm;0;ON;;;;;N;;;;;
+A71E;MODIFIER LETTER RAISED INVERTED EXCLAMATION MARK;Lm;0;ON;;;;;N;;;;;
+A71F;MODIFIER LETTER LOW INVERTED EXCLAMATION MARK;Lm;0;ON;;;;;N;;;;;
+A720;MODIFIER LETTER STRESS AND HIGH TONE;Sk;0;ON;;;;;N;;;;;
+A721;MODIFIER LETTER STRESS AND LOW TONE;Sk;0;ON;;;;;N;;;;;
+A722;LATIN CAPITAL LETTER EGYPTOLOGICAL ALEF;Lu;0;L;;;;;N;;;;A723;
+A723;LATIN SMALL LETTER EGYPTOLOGICAL ALEF;Ll;0;L;;;;;N;;;A722;;A722
+A724;LATIN CAPITAL LETTER EGYPTOLOGICAL AIN;Lu;0;L;;;;;N;;;;A725;
+A725;LATIN SMALL LETTER EGYPTOLOGICAL AIN;Ll;0;L;;;;;N;;;A724;;A724
+A726;LATIN CAPITAL LETTER HENG;Lu;0;L;;;;;N;;;;A727;
+A727;LATIN SMALL LETTER HENG;Ll;0;L;;;;;N;;;A726;;A726
+A728;LATIN CAPITAL LETTER TZ;Lu;0;L;;;;;N;;;;A729;
+A729;LATIN SMALL LETTER TZ;Ll;0;L;;;;;N;;;A728;;A728
+A72A;LATIN CAPITAL LETTER TRESILLO;Lu;0;L;;;;;N;;;;A72B;
+A72B;LATIN SMALL LETTER TRESILLO;Ll;0;L;;;;;N;;;A72A;;A72A
+A72C;LATIN CAPITAL LETTER CUATRILLO;Lu;0;L;;;;;N;;;;A72D;
+A72D;LATIN SMALL LETTER CUATRILLO;Ll;0;L;;;;;N;;;A72C;;A72C
+A72E;LATIN CAPITAL LETTER CUATRILLO WITH COMMA;Lu;0;L;;;;;N;;;;A72F;
+A72F;LATIN SMALL LETTER CUATRILLO WITH COMMA;Ll;0;L;;;;;N;;;A72E;;A72E
+A730;LATIN LETTER SMALL CAPITAL F;Ll;0;L;;;;;N;;;;;
+A731;LATIN LETTER SMALL CAPITAL S;Ll;0;L;;;;;N;;;;;
+A732;LATIN CAPITAL LETTER AA;Lu;0;L;;;;;N;;;;A733;
+A733;LATIN SMALL LETTER AA;Ll;0;L;;;;;N;;;A732;;A732
+A734;LATIN CAPITAL LETTER AO;Lu;0;L;;;;;N;;;;A735;
+A735;LATIN SMALL LETTER AO;Ll;0;L;;;;;N;;;A734;;A734
+A736;LATIN CAPITAL LETTER AU;Lu;0;L;;;;;N;;;;A737;
+A737;LATIN SMALL LETTER AU;Ll;0;L;;;;;N;;;A736;;A736
+A738;LATIN CAPITAL LETTER AV;Lu;0;L;;;;;N;;;;A739;
+A739;LATIN SMALL LETTER AV;Ll;0;L;;;;;N;;;A738;;A738
+A73A;LATIN CAPITAL LETTER AV WITH HORIZONTAL BAR;Lu;0;L;;;;;N;;;;A73B;
+A73B;LATIN SMALL LETTER AV WITH HORIZONTAL BAR;Ll;0;L;;;;;N;;;A73A;;A73A
+A73C;LATIN CAPITAL LETTER AY;Lu;0;L;;;;;N;;;;A73D;
+A73D;LATIN SMALL LETTER AY;Ll;0;L;;;;;N;;;A73C;;A73C
+A73E;LATIN CAPITAL LETTER REVERSED C WITH DOT;Lu;0;L;;;;;N;;;;A73F;
+A73F;LATIN SMALL LETTER REVERSED C WITH DOT;Ll;0;L;;;;;N;;;A73E;;A73E
+A740;LATIN CAPITAL LETTER K WITH STROKE;Lu;0;L;;;;;N;;;;A741;
+A741;LATIN SMALL LETTER K WITH STROKE;Ll;0;L;;;;;N;;;A740;;A740
+A742;LATIN CAPITAL LETTER K WITH DIAGONAL STROKE;Lu;0;L;;;;;N;;;;A743;
+A743;LATIN SMALL LETTER K WITH DIAGONAL STROKE;Ll;0;L;;;;;N;;;A742;;A742
+A744;LATIN CAPITAL LETTER K WITH STROKE AND DIAGONAL STROKE;Lu;0;L;;;;;N;;;;A745;
+A745;LATIN SMALL LETTER K WITH STROKE AND DIAGONAL STROKE;Ll;0;L;;;;;N;;;A744;;A744
+A746;LATIN CAPITAL LETTER BROKEN L;Lu;0;L;;;;;N;;;;A747;
+A747;LATIN SMALL LETTER BROKEN L;Ll;0;L;;;;;N;;;A746;;A746
+A748;LATIN CAPITAL LETTER L WITH HIGH STROKE;Lu;0;L;;;;;N;;;;A749;
+A749;LATIN SMALL LETTER L WITH HIGH STROKE;Ll;0;L;;;;;N;;;A748;;A748
+A74A;LATIN CAPITAL LETTER O WITH LONG STROKE OVERLAY;Lu;0;L;;;;;N;;;;A74B;
+A74B;LATIN SMALL LETTER O WITH LONG STROKE OVERLAY;Ll;0;L;;;;;N;;;A74A;;A74A
+A74C;LATIN CAPITAL LETTER O WITH LOOP;Lu;0;L;;;;;N;;;;A74D;
+A74D;LATIN SMALL LETTER O WITH LOOP;Ll;0;L;;;;;N;;;A74C;;A74C
+A74E;LATIN CAPITAL LETTER OO;Lu;0;L;;;;;N;;;;A74F;
+A74F;LATIN SMALL LETTER OO;Ll;0;L;;;;;N;;;A74E;;A74E
+A750;LATIN CAPITAL LETTER P WITH STROKE THROUGH DESCENDER;Lu;0;L;;;;;N;;;;A751;
+A751;LATIN SMALL LETTER P WITH STROKE THROUGH DESCENDER;Ll;0;L;;;;;N;;;A750;;A750
+A752;LATIN CAPITAL LETTER P WITH FLOURISH;Lu;0;L;;;;;N;;;;A753;
+A753;LATIN SMALL LETTER P WITH FLOURISH;Ll;0;L;;;;;N;;;A752;;A752
+A754;LATIN CAPITAL LETTER P WITH SQUIRREL TAIL;Lu;0;L;;;;;N;;;;A755;
+A755;LATIN SMALL LETTER P WITH SQUIRREL TAIL;Ll;0;L;;;;;N;;;A754;;A754
+A756;LATIN CAPITAL LETTER Q WITH STROKE THROUGH DESCENDER;Lu;0;L;;;;;N;;;;A757;
+A757;LATIN SMALL LETTER Q WITH STROKE THROUGH DESCENDER;Ll;0;L;;;;;N;;;A756;;A756
+A758;LATIN CAPITAL LETTER Q WITH DIAGONAL STROKE;Lu;0;L;;;;;N;;;;A759;
+A759;LATIN SMALL LETTER Q WITH DIAGONAL STROKE;Ll;0;L;;;;;N;;;A758;;A758
+A75A;LATIN CAPITAL LETTER R ROTUNDA;Lu;0;L;;;;;N;;;;A75B;
+A75B;LATIN SMALL LETTER R ROTUNDA;Ll;0;L;;;;;N;;;A75A;;A75A
+A75C;LATIN CAPITAL LETTER RUM ROTUNDA;Lu;0;L;;;;;N;;;;A75D;
+A75D;LATIN SMALL LETTER RUM ROTUNDA;Ll;0;L;;;;;N;;;A75C;;A75C
+A75E;LATIN CAPITAL LETTER V WITH DIAGONAL STROKE;Lu;0;L;;;;;N;;;;A75F;
+A75F;LATIN SMALL LETTER V WITH DIAGONAL STROKE;Ll;0;L;;;;;N;;;A75E;;A75E
+A760;LATIN CAPITAL LETTER VY;Lu;0;L;;;;;N;;;;A761;
+A761;LATIN SMALL LETTER VY;Ll;0;L;;;;;N;;;A760;;A760
+A762;LATIN CAPITAL LETTER VISIGOTHIC Z;Lu;0;L;;;;;N;;;;A763;
+A763;LATIN SMALL LETTER VISIGOTHIC Z;Ll;0;L;;;;;N;;;A762;;A762
+A764;LATIN CAPITAL LETTER THORN WITH STROKE;Lu;0;L;;;;;N;;;;A765;
+A765;LATIN SMALL LETTER THORN WITH STROKE;Ll;0;L;;;;;N;;;A764;;A764
+A766;LATIN CAPITAL LETTER THORN WITH STROKE THROUGH DESCENDER;Lu;0;L;;;;;N;;;;A767;
+A767;LATIN SMALL LETTER THORN WITH STROKE THROUGH DESCENDER;Ll;0;L;;;;;N;;;A766;;A766
+A768;LATIN CAPITAL LETTER VEND;Lu;0;L;;;;;N;;;;A769;
+A769;LATIN SMALL LETTER VEND;Ll;0;L;;;;;N;;;A768;;A768
+A76A;LATIN CAPITAL LETTER ET;Lu;0;L;;;;;N;;;;A76B;
+A76B;LATIN SMALL LETTER ET;Ll;0;L;;;;;N;;;A76A;;A76A
+A76C;LATIN CAPITAL LETTER IS;Lu;0;L;;;;;N;;;;A76D;
+A76D;LATIN SMALL LETTER IS;Ll;0;L;;;;;N;;;A76C;;A76C
+A76E;LATIN CAPITAL LETTER CON;Lu;0;L;;;;;N;;;;A76F;
+A76F;LATIN SMALL LETTER CON;Ll;0;L;;;;;N;;;A76E;;A76E
+A770;MODIFIER LETTER US;Lm;0;L;<super> A76F;;;;N;;;;;
+A771;LATIN SMALL LETTER DUM;Ll;0;L;;;;;N;;;;;
+A772;LATIN SMALL LETTER LUM;Ll;0;L;;;;;N;;;;;
+A773;LATIN SMALL LETTER MUM;Ll;0;L;;;;;N;;;;;
+A774;LATIN SMALL LETTER NUM;Ll;0;L;;;;;N;;;;;
+A775;LATIN SMALL LETTER RUM;Ll;0;L;;;;;N;;;;;
+A776;LATIN LETTER SMALL CAPITAL RUM;Ll;0;L;;;;;N;;;;;
+A777;LATIN SMALL LETTER TUM;Ll;0;L;;;;;N;;;;;
+A778;LATIN SMALL LETTER UM;Ll;0;L;;;;;N;;;;;
+A779;LATIN CAPITAL LETTER INSULAR D;Lu;0;L;;;;;N;;;;A77A;
+A77A;LATIN SMALL LETTER INSULAR D;Ll;0;L;;;;;N;;;A779;;A779
+A77B;LATIN CAPITAL LETTER INSULAR F;Lu;0;L;;;;;N;;;;A77C;
+A77C;LATIN SMALL LETTER INSULAR F;Ll;0;L;;;;;N;;;A77B;;A77B
+A77D;LATIN CAPITAL LETTER INSULAR G;Lu;0;L;;;;;N;;;;1D79;
+A77E;LATIN CAPITAL LETTER TURNED INSULAR G;Lu;0;L;;;;;N;;;;A77F;
+A77F;LATIN SMALL LETTER TURNED INSULAR G;Ll;0;L;;;;;N;;;A77E;;A77E
+A780;LATIN CAPITAL LETTER TURNED L;Lu;0;L;;;;;N;;;;A781;
+A781;LATIN SMALL LETTER TURNED L;Ll;0;L;;;;;N;;;A780;;A780
+A782;LATIN CAPITAL LETTER INSULAR R;Lu;0;L;;;;;N;;;;A783;
+A783;LATIN SMALL LETTER INSULAR R;Ll;0;L;;;;;N;;;A782;;A782
+A784;LATIN CAPITAL LETTER INSULAR S;Lu;0;L;;;;;N;;;;A785;
+A785;LATIN SMALL LETTER INSULAR S;Ll;0;L;;;;;N;;;A784;;A784
+A786;LATIN CAPITAL LETTER INSULAR T;Lu;0;L;;;;;N;;;;A787;
+A787;LATIN SMALL LETTER INSULAR T;Ll;0;L;;;;;N;;;A786;;A786
+A788;MODIFIER LETTER LOW CIRCUMFLEX ACCENT;Lm;0;ON;;;;;N;;;;;
+A789;MODIFIER LETTER COLON;Sk;0;L;;;;;N;;;;;
+A78A;MODIFIER LETTER SHORT EQUALS SIGN;Sk;0;L;;;;;N;;;;;
+A78B;LATIN CAPITAL LETTER SALTILLO;Lu;0;L;;;;;N;;;;A78C;
+A78C;LATIN SMALL LETTER SALTILLO;Ll;0;L;;;;;N;;;A78B;;A78B
+A78D;LATIN CAPITAL LETTER TURNED H;Lu;0;L;;;;;N;;;;0265;
+A78E;LATIN SMALL LETTER L WITH RETROFLEX HOOK AND BELT;Ll;0;L;;;;;N;;;;;
+A78F;LATIN LETTER SINOLOGICAL DOT;Lo;0;L;;;;;N;;;;;
+A790;LATIN CAPITAL LETTER N WITH DESCENDER;Lu;0;L;;;;;N;;;;A791;
+A791;LATIN SMALL LETTER N WITH DESCENDER;Ll;0;L;;;;;N;;;A790;;A790
+A792;LATIN CAPITAL LETTER C WITH BAR;Lu;0;L;;;;;N;;;;A793;
+A793;LATIN SMALL LETTER C WITH BAR;Ll;0;L;;;;;N;;;A792;;A792
+A794;LATIN SMALL LETTER C WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+A795;LATIN SMALL LETTER H WITH PALATAL HOOK;Ll;0;L;;;;;N;;;;;
+A796;LATIN CAPITAL LETTER B WITH FLOURISH;Lu;0;L;;;;;N;;;;A797;
+A797;LATIN SMALL LETTER B WITH FLOURISH;Ll;0;L;;;;;N;;;A796;;A796
+A798;LATIN CAPITAL LETTER F WITH STROKE;Lu;0;L;;;;;N;;;;A799;
+A799;LATIN SMALL LETTER F WITH STROKE;Ll;0;L;;;;;N;;;A798;;A798
+A79A;LATIN CAPITAL LETTER VOLAPUK AE;Lu;0;L;;;;;N;;;;A79B;
+A79B;LATIN SMALL LETTER VOLAPUK AE;Ll;0;L;;;;;N;;;A79A;;A79A
+A79C;LATIN CAPITAL LETTER VOLAPUK OE;Lu;0;L;;;;;N;;;;A79D;
+A79D;LATIN SMALL LETTER VOLAPUK OE;Ll;0;L;;;;;N;;;A79C;;A79C
+A79E;LATIN CAPITAL LETTER VOLAPUK UE;Lu;0;L;;;;;N;;;;A79F;
+A79F;LATIN SMALL LETTER VOLAPUK UE;Ll;0;L;;;;;N;;;A79E;;A79E
+A7A0;LATIN CAPITAL LETTER G WITH OBLIQUE STROKE;Lu;0;L;;;;;N;;;;A7A1;
+A7A1;LATIN SMALL LETTER G WITH OBLIQUE STROKE;Ll;0;L;;;;;N;;;A7A0;;A7A0
+A7A2;LATIN CAPITAL LETTER K WITH OBLIQUE STROKE;Lu;0;L;;;;;N;;;;A7A3;
+A7A3;LATIN SMALL LETTER K WITH OBLIQUE STROKE;Ll;0;L;;;;;N;;;A7A2;;A7A2
+A7A4;LATIN CAPITAL LETTER N WITH OBLIQUE STROKE;Lu;0;L;;;;;N;;;;A7A5;
+A7A5;LATIN SMALL LETTER N WITH OBLIQUE STROKE;Ll;0;L;;;;;N;;;A7A4;;A7A4
+A7A6;LATIN CAPITAL LETTER R WITH OBLIQUE STROKE;Lu;0;L;;;;;N;;;;A7A7;
+A7A7;LATIN SMALL LETTER R WITH OBLIQUE STROKE;Ll;0;L;;;;;N;;;A7A6;;A7A6
+A7A8;LATIN CAPITAL LETTER S WITH OBLIQUE STROKE;Lu;0;L;;;;;N;;;;A7A9;
+A7A9;LATIN SMALL LETTER S WITH OBLIQUE STROKE;Ll;0;L;;;;;N;;;A7A8;;A7A8
+A7AA;LATIN CAPITAL LETTER H WITH HOOK;Lu;0;L;;;;;N;;;;0266;
+A7AB;LATIN CAPITAL LETTER REVERSED OPEN E;Lu;0;L;;;;;N;;;;025C;
+A7AC;LATIN CAPITAL LETTER SCRIPT G;Lu;0;L;;;;;N;;;;0261;
+A7AD;LATIN CAPITAL LETTER L WITH BELT;Lu;0;L;;;;;N;;;;026C;
+A7AE;LATIN CAPITAL LETTER SMALL CAPITAL I;Lu;0;L;;;;;N;;;;026A;
+A7B0;LATIN CAPITAL LETTER TURNED K;Lu;0;L;;;;;N;;;;029E;
+A7B1;LATIN CAPITAL LETTER TURNED T;Lu;0;L;;;;;N;;;;0287;
+A7B2;LATIN CAPITAL LETTER J WITH CROSSED-TAIL;Lu;0;L;;;;;N;;;;029D;
+A7B3;LATIN CAPITAL LETTER CHI;Lu;0;L;;;;;N;;;;AB53;
+A7B4;LATIN CAPITAL LETTER BETA;Lu;0;L;;;;;N;;;;A7B5;
+A7B5;LATIN SMALL LETTER BETA;Ll;0;L;;;;;N;;;A7B4;;A7B4
+A7B6;LATIN CAPITAL LETTER OMEGA;Lu;0;L;;;;;N;;;;A7B7;
+A7B7;LATIN SMALL LETTER OMEGA;Ll;0;L;;;;;N;;;A7B6;;A7B6
+A7F7;LATIN EPIGRAPHIC LETTER SIDEWAYS I;Lo;0;L;;;;;N;;;;;
+A7F8;MODIFIER LETTER CAPITAL H WITH STROKE;Lm;0;L;<super> 0126;;;;N;;;;;
+A7F9;MODIFIER LETTER SMALL LIGATURE OE;Lm;0;L;<super> 0153;;;;N;;;;;
+A7FA;LATIN LETTER SMALL CAPITAL TURNED M;Ll;0;L;;;;;N;;;;;
+A7FB;LATIN EPIGRAPHIC LETTER REVERSED F;Lo;0;L;;;;;N;;;;;
+A7FC;LATIN EPIGRAPHIC LETTER REVERSED P;Lo;0;L;;;;;N;;;;;
+A7FD;LATIN EPIGRAPHIC LETTER INVERTED M;Lo;0;L;;;;;N;;;;;
+A7FE;LATIN EPIGRAPHIC LETTER I LONGA;Lo;0;L;;;;;N;;;;;
+A7FF;LATIN EPIGRAPHIC LETTER ARCHAIC M;Lo;0;L;;;;;N;;;;;
+A800;SYLOTI NAGRI LETTER A;Lo;0;L;;;;;N;;;;;
+A801;SYLOTI NAGRI LETTER I;Lo;0;L;;;;;N;;;;;
+A802;SYLOTI NAGRI SIGN DVISVARA;Mn;0;NSM;;;;;N;;;;;
+A803;SYLOTI NAGRI LETTER U;Lo;0;L;;;;;N;;;;;
+A804;SYLOTI NAGRI LETTER E;Lo;0;L;;;;;N;;;;;
+A805;SYLOTI NAGRI LETTER O;Lo;0;L;;;;;N;;;;;
+A806;SYLOTI NAGRI SIGN HASANTA;Mn;9;NSM;;;;;N;;;;;
+A807;SYLOTI NAGRI LETTER KO;Lo;0;L;;;;;N;;;;;
+A808;SYLOTI NAGRI LETTER KHO;Lo;0;L;;;;;N;;;;;
+A809;SYLOTI NAGRI LETTER GO;Lo;0;L;;;;;N;;;;;
+A80A;SYLOTI NAGRI LETTER GHO;Lo;0;L;;;;;N;;;;;
+A80B;SYLOTI NAGRI SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+A80C;SYLOTI NAGRI LETTER CO;Lo;0;L;;;;;N;;;;;
+A80D;SYLOTI NAGRI LETTER CHO;Lo;0;L;;;;;N;;;;;
+A80E;SYLOTI NAGRI LETTER JO;Lo;0;L;;;;;N;;;;;
+A80F;SYLOTI NAGRI LETTER JHO;Lo;0;L;;;;;N;;;;;
+A810;SYLOTI NAGRI LETTER TTO;Lo;0;L;;;;;N;;;;;
+A811;SYLOTI NAGRI LETTER TTHO;Lo;0;L;;;;;N;;;;;
+A812;SYLOTI NAGRI LETTER DDO;Lo;0;L;;;;;N;;;;;
+A813;SYLOTI NAGRI LETTER DDHO;Lo;0;L;;;;;N;;;;;
+A814;SYLOTI NAGRI LETTER TO;Lo;0;L;;;;;N;;;;;
+A815;SYLOTI NAGRI LETTER THO;Lo;0;L;;;;;N;;;;;
+A816;SYLOTI NAGRI LETTER DO;Lo;0;L;;;;;N;;;;;
+A817;SYLOTI NAGRI LETTER DHO;Lo;0;L;;;;;N;;;;;
+A818;SYLOTI NAGRI LETTER NO;Lo;0;L;;;;;N;;;;;
+A819;SYLOTI NAGRI LETTER PO;Lo;0;L;;;;;N;;;;;
+A81A;SYLOTI NAGRI LETTER PHO;Lo;0;L;;;;;N;;;;;
+A81B;SYLOTI NAGRI LETTER BO;Lo;0;L;;;;;N;;;;;
+A81C;SYLOTI NAGRI LETTER BHO;Lo;0;L;;;;;N;;;;;
+A81D;SYLOTI NAGRI LETTER MO;Lo;0;L;;;;;N;;;;;
+A81E;SYLOTI NAGRI LETTER RO;Lo;0;L;;;;;N;;;;;
+A81F;SYLOTI NAGRI LETTER LO;Lo;0;L;;;;;N;;;;;
+A820;SYLOTI NAGRI LETTER RRO;Lo;0;L;;;;;N;;;;;
+A821;SYLOTI NAGRI LETTER SO;Lo;0;L;;;;;N;;;;;
+A822;SYLOTI NAGRI LETTER HO;Lo;0;L;;;;;N;;;;;
+A823;SYLOTI NAGRI VOWEL SIGN A;Mc;0;L;;;;;N;;;;;
+A824;SYLOTI NAGRI VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+A825;SYLOTI NAGRI VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+A826;SYLOTI NAGRI VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+A827;SYLOTI NAGRI VOWEL SIGN OO;Mc;0;L;;;;;N;;;;;
+A828;SYLOTI NAGRI POETRY MARK-1;So;0;ON;;;;;N;;;;;
+A829;SYLOTI NAGRI POETRY MARK-2;So;0;ON;;;;;N;;;;;
+A82A;SYLOTI NAGRI POETRY MARK-3;So;0;ON;;;;;N;;;;;
+A82B;SYLOTI NAGRI POETRY MARK-4;So;0;ON;;;;;N;;;;;
+A830;NORTH INDIC FRACTION ONE QUARTER;No;0;L;;;;1/4;N;;;;;
+A831;NORTH INDIC FRACTION ONE HALF;No;0;L;;;;1/2;N;;;;;
+A832;NORTH INDIC FRACTION THREE QUARTERS;No;0;L;;;;3/4;N;;;;;
+A833;NORTH INDIC FRACTION ONE SIXTEENTH;No;0;L;;;;1/16;N;;;;;
+A834;NORTH INDIC FRACTION ONE EIGHTH;No;0;L;;;;1/8;N;;;;;
+A835;NORTH INDIC FRACTION THREE SIXTEENTHS;No;0;L;;;;3/16;N;;;;;
+A836;NORTH INDIC QUARTER MARK;So;0;L;;;;;N;;;;;
+A837;NORTH INDIC PLACEHOLDER MARK;So;0;L;;;;;N;;;;;
+A838;NORTH INDIC RUPEE MARK;Sc;0;ET;;;;;N;;;;;
+A839;NORTH INDIC QUANTITY MARK;So;0;ET;;;;;N;;;;;
+A840;PHAGS-PA LETTER KA;Lo;0;L;;;;;N;;;;;
+A841;PHAGS-PA LETTER KHA;Lo;0;L;;;;;N;;;;;
+A842;PHAGS-PA LETTER GA;Lo;0;L;;;;;N;;;;;
+A843;PHAGS-PA LETTER NGA;Lo;0;L;;;;;N;;;;;
+A844;PHAGS-PA LETTER CA;Lo;0;L;;;;;N;;;;;
+A845;PHAGS-PA LETTER CHA;Lo;0;L;;;;;N;;;;;
+A846;PHAGS-PA LETTER JA;Lo;0;L;;;;;N;;;;;
+A847;PHAGS-PA LETTER NYA;Lo;0;L;;;;;N;;;;;
+A848;PHAGS-PA LETTER TA;Lo;0;L;;;;;N;;;;;
+A849;PHAGS-PA LETTER THA;Lo;0;L;;;;;N;;;;;
+A84A;PHAGS-PA LETTER DA;Lo;0;L;;;;;N;;;;;
+A84B;PHAGS-PA LETTER NA;Lo;0;L;;;;;N;;;;;
+A84C;PHAGS-PA LETTER PA;Lo;0;L;;;;;N;;;;;
+A84D;PHAGS-PA LETTER PHA;Lo;0;L;;;;;N;;;;;
+A84E;PHAGS-PA LETTER BA;Lo;0;L;;;;;N;;;;;
+A84F;PHAGS-PA LETTER MA;Lo;0;L;;;;;N;;;;;
+A850;PHAGS-PA LETTER TSA;Lo;0;L;;;;;N;;;;;
+A851;PHAGS-PA LETTER TSHA;Lo;0;L;;;;;N;;;;;
+A852;PHAGS-PA LETTER DZA;Lo;0;L;;;;;N;;;;;
+A853;PHAGS-PA LETTER WA;Lo;0;L;;;;;N;;;;;
+A854;PHAGS-PA LETTER ZHA;Lo;0;L;;;;;N;;;;;
+A855;PHAGS-PA LETTER ZA;Lo;0;L;;;;;N;;;;;
+A856;PHAGS-PA LETTER SMALL A;Lo;0;L;;;;;N;;;;;
+A857;PHAGS-PA LETTER YA;Lo;0;L;;;;;N;;;;;
+A858;PHAGS-PA LETTER RA;Lo;0;L;;;;;N;;;;;
+A859;PHAGS-PA LETTER LA;Lo;0;L;;;;;N;;;;;
+A85A;PHAGS-PA LETTER SHA;Lo;0;L;;;;;N;;;;;
+A85B;PHAGS-PA LETTER SA;Lo;0;L;;;;;N;;;;;
+A85C;PHAGS-PA LETTER HA;Lo;0;L;;;;;N;;;;;
+A85D;PHAGS-PA LETTER A;Lo;0;L;;;;;N;;;;;
+A85E;PHAGS-PA LETTER I;Lo;0;L;;;;;N;;;;;
+A85F;PHAGS-PA LETTER U;Lo;0;L;;;;;N;;;;;
+A860;PHAGS-PA LETTER E;Lo;0;L;;;;;N;;;;;
+A861;PHAGS-PA LETTER O;Lo;0;L;;;;;N;;;;;
+A862;PHAGS-PA LETTER QA;Lo;0;L;;;;;N;;;;;
+A863;PHAGS-PA LETTER XA;Lo;0;L;;;;;N;;;;;
+A864;PHAGS-PA LETTER FA;Lo;0;L;;;;;N;;;;;
+A865;PHAGS-PA LETTER GGA;Lo;0;L;;;;;N;;;;;
+A866;PHAGS-PA LETTER EE;Lo;0;L;;;;;N;;;;;
+A867;PHAGS-PA SUBJOINED LETTER WA;Lo;0;L;;;;;N;;;;;
+A868;PHAGS-PA SUBJOINED LETTER YA;Lo;0;L;;;;;N;;;;;
+A869;PHAGS-PA LETTER TTA;Lo;0;L;;;;;N;;;;;
+A86A;PHAGS-PA LETTER TTHA;Lo;0;L;;;;;N;;;;;
+A86B;PHAGS-PA LETTER DDA;Lo;0;L;;;;;N;;;;;
+A86C;PHAGS-PA LETTER NNA;Lo;0;L;;;;;N;;;;;
+A86D;PHAGS-PA LETTER ALTERNATE YA;Lo;0;L;;;;;N;;;;;
+A86E;PHAGS-PA LETTER VOICELESS SHA;Lo;0;L;;;;;N;;;;;
+A86F;PHAGS-PA LETTER VOICED HA;Lo;0;L;;;;;N;;;;;
+A870;PHAGS-PA LETTER ASPIRATED FA;Lo;0;L;;;;;N;;;;;
+A871;PHAGS-PA SUBJOINED LETTER RA;Lo;0;L;;;;;N;;;;;
+A872;PHAGS-PA SUPERFIXED LETTER RA;Lo;0;L;;;;;N;;;;;
+A873;PHAGS-PA LETTER CANDRABINDU;Lo;0;L;;;;;N;;;;;
+A874;PHAGS-PA SINGLE HEAD MARK;Po;0;ON;;;;;N;;;;;
+A875;PHAGS-PA DOUBLE HEAD MARK;Po;0;ON;;;;;N;;;;;
+A876;PHAGS-PA MARK SHAD;Po;0;ON;;;;;N;;;;;
+A877;PHAGS-PA MARK DOUBLE SHAD;Po;0;ON;;;;;N;;;;;
+A880;SAURASHTRA SIGN ANUSVARA;Mc;0;L;;;;;N;;;;;
+A881;SAURASHTRA SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+A882;SAURASHTRA LETTER A;Lo;0;L;;;;;N;;;;;
+A883;SAURASHTRA LETTER AA;Lo;0;L;;;;;N;;;;;
+A884;SAURASHTRA LETTER I;Lo;0;L;;;;;N;;;;;
+A885;SAURASHTRA LETTER II;Lo;0;L;;;;;N;;;;;
+A886;SAURASHTRA LETTER U;Lo;0;L;;;;;N;;;;;
+A887;SAURASHTRA LETTER UU;Lo;0;L;;;;;N;;;;;
+A888;SAURASHTRA LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+A889;SAURASHTRA LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+A88A;SAURASHTRA LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+A88B;SAURASHTRA LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+A88C;SAURASHTRA LETTER E;Lo;0;L;;;;;N;;;;;
+A88D;SAURASHTRA LETTER EE;Lo;0;L;;;;;N;;;;;
+A88E;SAURASHTRA LETTER AI;Lo;0;L;;;;;N;;;;;
+A88F;SAURASHTRA LETTER O;Lo;0;L;;;;;N;;;;;
+A890;SAURASHTRA LETTER OO;Lo;0;L;;;;;N;;;;;
+A891;SAURASHTRA LETTER AU;Lo;0;L;;;;;N;;;;;
+A892;SAURASHTRA LETTER KA;Lo;0;L;;;;;N;;;;;
+A893;SAURASHTRA LETTER KHA;Lo;0;L;;;;;N;;;;;
+A894;SAURASHTRA LETTER GA;Lo;0;L;;;;;N;;;;;
+A895;SAURASHTRA LETTER GHA;Lo;0;L;;;;;N;;;;;
+A896;SAURASHTRA LETTER NGA;Lo;0;L;;;;;N;;;;;
+A897;SAURASHTRA LETTER CA;Lo;0;L;;;;;N;;;;;
+A898;SAURASHTRA LETTER CHA;Lo;0;L;;;;;N;;;;;
+A899;SAURASHTRA LETTER JA;Lo;0;L;;;;;N;;;;;
+A89A;SAURASHTRA LETTER JHA;Lo;0;L;;;;;N;;;;;
+A89B;SAURASHTRA LETTER NYA;Lo;0;L;;;;;N;;;;;
+A89C;SAURASHTRA LETTER TTA;Lo;0;L;;;;;N;;;;;
+A89D;SAURASHTRA LETTER TTHA;Lo;0;L;;;;;N;;;;;
+A89E;SAURASHTRA LETTER DDA;Lo;0;L;;;;;N;;;;;
+A89F;SAURASHTRA LETTER DDHA;Lo;0;L;;;;;N;;;;;
+A8A0;SAURASHTRA LETTER NNA;Lo;0;L;;;;;N;;;;;
+A8A1;SAURASHTRA LETTER TA;Lo;0;L;;;;;N;;;;;
+A8A2;SAURASHTRA LETTER THA;Lo;0;L;;;;;N;;;;;
+A8A3;SAURASHTRA LETTER DA;Lo;0;L;;;;;N;;;;;
+A8A4;SAURASHTRA LETTER DHA;Lo;0;L;;;;;N;;;;;
+A8A5;SAURASHTRA LETTER NA;Lo;0;L;;;;;N;;;;;
+A8A6;SAURASHTRA LETTER PA;Lo;0;L;;;;;N;;;;;
+A8A7;SAURASHTRA LETTER PHA;Lo;0;L;;;;;N;;;;;
+A8A8;SAURASHTRA LETTER BA;Lo;0;L;;;;;N;;;;;
+A8A9;SAURASHTRA LETTER BHA;Lo;0;L;;;;;N;;;;;
+A8AA;SAURASHTRA LETTER MA;Lo;0;L;;;;;N;;;;;
+A8AB;SAURASHTRA LETTER YA;Lo;0;L;;;;;N;;;;;
+A8AC;SAURASHTRA LETTER RA;Lo;0;L;;;;;N;;;;;
+A8AD;SAURASHTRA LETTER LA;Lo;0;L;;;;;N;;;;;
+A8AE;SAURASHTRA LETTER VA;Lo;0;L;;;;;N;;;;;
+A8AF;SAURASHTRA LETTER SHA;Lo;0;L;;;;;N;;;;;
+A8B0;SAURASHTRA LETTER SSA;Lo;0;L;;;;;N;;;;;
+A8B1;SAURASHTRA LETTER SA;Lo;0;L;;;;;N;;;;;
+A8B2;SAURASHTRA LETTER HA;Lo;0;L;;;;;N;;;;;
+A8B3;SAURASHTRA LETTER LLA;Lo;0;L;;;;;N;;;;;
+A8B4;SAURASHTRA CONSONANT SIGN HAARU;Mc;0;L;;;;;N;;;;;
+A8B5;SAURASHTRA VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+A8B6;SAURASHTRA VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+A8B7;SAURASHTRA VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+A8B8;SAURASHTRA VOWEL SIGN U;Mc;0;L;;;;;N;;;;;
+A8B9;SAURASHTRA VOWEL SIGN UU;Mc;0;L;;;;;N;;;;;
+A8BA;SAURASHTRA VOWEL SIGN VOCALIC R;Mc;0;L;;;;;N;;;;;
+A8BB;SAURASHTRA VOWEL SIGN VOCALIC RR;Mc;0;L;;;;;N;;;;;
+A8BC;SAURASHTRA VOWEL SIGN VOCALIC L;Mc;0;L;;;;;N;;;;;
+A8BD;SAURASHTRA VOWEL SIGN VOCALIC LL;Mc;0;L;;;;;N;;;;;
+A8BE;SAURASHTRA VOWEL SIGN E;Mc;0;L;;;;;N;;;;;
+A8BF;SAURASHTRA VOWEL SIGN EE;Mc;0;L;;;;;N;;;;;
+A8C0;SAURASHTRA VOWEL SIGN AI;Mc;0;L;;;;;N;;;;;
+A8C1;SAURASHTRA VOWEL SIGN O;Mc;0;L;;;;;N;;;;;
+A8C2;SAURASHTRA VOWEL SIGN OO;Mc;0;L;;;;;N;;;;;
+A8C3;SAURASHTRA VOWEL SIGN AU;Mc;0;L;;;;;N;;;;;
+A8C4;SAURASHTRA SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+A8C5;SAURASHTRA SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+A8CE;SAURASHTRA DANDA;Po;0;L;;;;;N;;;;;
+A8CF;SAURASHTRA DOUBLE DANDA;Po;0;L;;;;;N;;;;;
+A8D0;SAURASHTRA DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+A8D1;SAURASHTRA DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+A8D2;SAURASHTRA DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+A8D3;SAURASHTRA DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+A8D4;SAURASHTRA DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+A8D5;SAURASHTRA DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+A8D6;SAURASHTRA DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+A8D7;SAURASHTRA DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+A8D8;SAURASHTRA DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+A8D9;SAURASHTRA DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+A8E0;COMBINING DEVANAGARI DIGIT ZERO;Mn;230;NSM;;;;;N;;;;;
+A8E1;COMBINING DEVANAGARI DIGIT ONE;Mn;230;NSM;;;;;N;;;;;
+A8E2;COMBINING DEVANAGARI DIGIT TWO;Mn;230;NSM;;;;;N;;;;;
+A8E3;COMBINING DEVANAGARI DIGIT THREE;Mn;230;NSM;;;;;N;;;;;
+A8E4;COMBINING DEVANAGARI DIGIT FOUR;Mn;230;NSM;;;;;N;;;;;
+A8E5;COMBINING DEVANAGARI DIGIT FIVE;Mn;230;NSM;;;;;N;;;;;
+A8E6;COMBINING DEVANAGARI DIGIT SIX;Mn;230;NSM;;;;;N;;;;;
+A8E7;COMBINING DEVANAGARI DIGIT SEVEN;Mn;230;NSM;;;;;N;;;;;
+A8E8;COMBINING DEVANAGARI DIGIT EIGHT;Mn;230;NSM;;;;;N;;;;;
+A8E9;COMBINING DEVANAGARI DIGIT NINE;Mn;230;NSM;;;;;N;;;;;
+A8EA;COMBINING DEVANAGARI LETTER A;Mn;230;NSM;;;;;N;;;;;
+A8EB;COMBINING DEVANAGARI LETTER U;Mn;230;NSM;;;;;N;;;;;
+A8EC;COMBINING DEVANAGARI LETTER KA;Mn;230;NSM;;;;;N;;;;;
+A8ED;COMBINING DEVANAGARI LETTER NA;Mn;230;NSM;;;;;N;;;;;
+A8EE;COMBINING DEVANAGARI LETTER PA;Mn;230;NSM;;;;;N;;;;;
+A8EF;COMBINING DEVANAGARI LETTER RA;Mn;230;NSM;;;;;N;;;;;
+A8F0;COMBINING DEVANAGARI LETTER VI;Mn;230;NSM;;;;;N;;;;;
+A8F1;COMBINING DEVANAGARI SIGN AVAGRAHA;Mn;230;NSM;;;;;N;;;;;
+A8F2;DEVANAGARI SIGN SPACING CANDRABINDU;Lo;0;L;;;;;N;;;;;
+A8F3;DEVANAGARI SIGN CANDRABINDU VIRAMA;Lo;0;L;;;;;N;;;;;
+A8F4;DEVANAGARI SIGN DOUBLE CANDRABINDU VIRAMA;Lo;0;L;;;;;N;;;;;
+A8F5;DEVANAGARI SIGN CANDRABINDU TWO;Lo;0;L;;;;;N;;;;;
+A8F6;DEVANAGARI SIGN CANDRABINDU THREE;Lo;0;L;;;;;N;;;;;
+A8F7;DEVANAGARI SIGN CANDRABINDU AVAGRAHA;Lo;0;L;;;;;N;;;;;
+A8F8;DEVANAGARI SIGN PUSHPIKA;Po;0;L;;;;;N;;;;;
+A8F9;DEVANAGARI GAP FILLER;Po;0;L;;;;;N;;;;;
+A8FA;DEVANAGARI CARET;Po;0;L;;;;;N;;;;;
+A8FB;DEVANAGARI HEADSTROKE;Lo;0;L;;;;;N;;;;;
+A8FC;DEVANAGARI SIGN SIDDHAM;Po;0;L;;;;;N;;;;;
+A8FD;DEVANAGARI JAIN OM;Lo;0;L;;;;;N;;;;;
+A900;KAYAH LI DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+A901;KAYAH LI DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+A902;KAYAH LI DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+A903;KAYAH LI DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+A904;KAYAH LI DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+A905;KAYAH LI DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+A906;KAYAH LI DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+A907;KAYAH LI DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+A908;KAYAH LI DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+A909;KAYAH LI DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+A90A;KAYAH LI LETTER KA;Lo;0;L;;;;;N;;;;;
+A90B;KAYAH LI LETTER KHA;Lo;0;L;;;;;N;;;;;
+A90C;KAYAH LI LETTER GA;Lo;0;L;;;;;N;;;;;
+A90D;KAYAH LI LETTER NGA;Lo;0;L;;;;;N;;;;;
+A90E;KAYAH LI LETTER SA;Lo;0;L;;;;;N;;;;;
+A90F;KAYAH LI LETTER SHA;Lo;0;L;;;;;N;;;;;
+A910;KAYAH LI LETTER ZA;Lo;0;L;;;;;N;;;;;
+A911;KAYAH LI LETTER NYA;Lo;0;L;;;;;N;;;;;
+A912;KAYAH LI LETTER TA;Lo;0;L;;;;;N;;;;;
+A913;KAYAH LI LETTER HTA;Lo;0;L;;;;;N;;;;;
+A914;KAYAH LI LETTER NA;Lo;0;L;;;;;N;;;;;
+A915;KAYAH LI LETTER PA;Lo;0;L;;;;;N;;;;;
+A916;KAYAH LI LETTER PHA;Lo;0;L;;;;;N;;;;;
+A917;KAYAH LI LETTER MA;Lo;0;L;;;;;N;;;;;
+A918;KAYAH LI LETTER DA;Lo;0;L;;;;;N;;;;;
+A919;KAYAH LI LETTER BA;Lo;0;L;;;;;N;;;;;
+A91A;KAYAH LI LETTER RA;Lo;0;L;;;;;N;;;;;
+A91B;KAYAH LI LETTER YA;Lo;0;L;;;;;N;;;;;
+A91C;KAYAH LI LETTER LA;Lo;0;L;;;;;N;;;;;
+A91D;KAYAH LI LETTER WA;Lo;0;L;;;;;N;;;;;
+A91E;KAYAH LI LETTER THA;Lo;0;L;;;;;N;;;;;
+A91F;KAYAH LI LETTER HA;Lo;0;L;;;;;N;;;;;
+A920;KAYAH LI LETTER VA;Lo;0;L;;;;;N;;;;;
+A921;KAYAH LI LETTER CA;Lo;0;L;;;;;N;;;;;
+A922;KAYAH LI LETTER A;Lo;0;L;;;;;N;;;;;
+A923;KAYAH LI LETTER OE;Lo;0;L;;;;;N;;;;;
+A924;KAYAH LI LETTER I;Lo;0;L;;;;;N;;;;;
+A925;KAYAH LI LETTER OO;Lo;0;L;;;;;N;;;;;
+A926;KAYAH LI VOWEL UE;Mn;0;NSM;;;;;N;;;;;
+A927;KAYAH LI VOWEL E;Mn;0;NSM;;;;;N;;;;;
+A928;KAYAH LI VOWEL U;Mn;0;NSM;;;;;N;;;;;
+A929;KAYAH LI VOWEL EE;Mn;0;NSM;;;;;N;;;;;
+A92A;KAYAH LI VOWEL O;Mn;0;NSM;;;;;N;;;;;
+A92B;KAYAH LI TONE PLOPHU;Mn;220;NSM;;;;;N;;;;;
+A92C;KAYAH LI TONE CALYA;Mn;220;NSM;;;;;N;;;;;
+A92D;KAYAH LI TONE CALYA PLOPHU;Mn;220;NSM;;;;;N;;;;;
+A92E;KAYAH LI SIGN CWI;Po;0;L;;;;;N;;;;;
+A92F;KAYAH LI SIGN SHYA;Po;0;L;;;;;N;;;;;
+A930;REJANG LETTER KA;Lo;0;L;;;;;N;;;;;
+A931;REJANG LETTER GA;Lo;0;L;;;;;N;;;;;
+A932;REJANG LETTER NGA;Lo;0;L;;;;;N;;;;;
+A933;REJANG LETTER TA;Lo;0;L;;;;;N;;;;;
+A934;REJANG LETTER DA;Lo;0;L;;;;;N;;;;;
+A935;REJANG LETTER NA;Lo;0;L;;;;;N;;;;;
+A936;REJANG LETTER PA;Lo;0;L;;;;;N;;;;;
+A937;REJANG LETTER BA;Lo;0;L;;;;;N;;;;;
+A938;REJANG LETTER MA;Lo;0;L;;;;;N;;;;;
+A939;REJANG LETTER CA;Lo;0;L;;;;;N;;;;;
+A93A;REJANG LETTER JA;Lo;0;L;;;;;N;;;;;
+A93B;REJANG LETTER NYA;Lo;0;L;;;;;N;;;;;
+A93C;REJANG LETTER SA;Lo;0;L;;;;;N;;;;;
+A93D;REJANG LETTER RA;Lo;0;L;;;;;N;;;;;
+A93E;REJANG LETTER LA;Lo;0;L;;;;;N;;;;;
+A93F;REJANG LETTER YA;Lo;0;L;;;;;N;;;;;
+A940;REJANG LETTER WA;Lo;0;L;;;;;N;;;;;
+A941;REJANG LETTER HA;Lo;0;L;;;;;N;;;;;
+A942;REJANG LETTER MBA;Lo;0;L;;;;;N;;;;;
+A943;REJANG LETTER NGGA;Lo;0;L;;;;;N;;;;;
+A944;REJANG LETTER NDA;Lo;0;L;;;;;N;;;;;
+A945;REJANG LETTER NYJA;Lo;0;L;;;;;N;;;;;
+A946;REJANG LETTER A;Lo;0;L;;;;;N;;;;;
+A947;REJANG VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+A948;REJANG VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+A949;REJANG VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+A94A;REJANG VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+A94B;REJANG VOWEL SIGN O;Mn;0;NSM;;;;;N;;;;;
+A94C;REJANG VOWEL SIGN AU;Mn;0;NSM;;;;;N;;;;;
+A94D;REJANG VOWEL SIGN EU;Mn;0;NSM;;;;;N;;;;;
+A94E;REJANG VOWEL SIGN EA;Mn;0;NSM;;;;;N;;;;;
+A94F;REJANG CONSONANT SIGN NG;Mn;0;NSM;;;;;N;;;;;
+A950;REJANG CONSONANT SIGN N;Mn;0;NSM;;;;;N;;;;;
+A951;REJANG CONSONANT SIGN R;Mn;0;NSM;;;;;N;;;;;
+A952;REJANG CONSONANT SIGN H;Mc;0;L;;;;;N;;;;;
+A953;REJANG VIRAMA;Mc;9;L;;;;;N;;;;;
+A95F;REJANG SECTION MARK;Po;0;L;;;;;N;;;;;
+A960;HANGUL CHOSEONG TIKEUT-MIEUM;Lo;0;L;;;;;N;;;;;
+A961;HANGUL CHOSEONG TIKEUT-PIEUP;Lo;0;L;;;;;N;;;;;
+A962;HANGUL CHOSEONG TIKEUT-SIOS;Lo;0;L;;;;;N;;;;;
+A963;HANGUL CHOSEONG TIKEUT-CIEUC;Lo;0;L;;;;;N;;;;;
+A964;HANGUL CHOSEONG RIEUL-KIYEOK;Lo;0;L;;;;;N;;;;;
+A965;HANGUL CHOSEONG RIEUL-SSANGKIYEOK;Lo;0;L;;;;;N;;;;;
+A966;HANGUL CHOSEONG RIEUL-TIKEUT;Lo;0;L;;;;;N;;;;;
+A967;HANGUL CHOSEONG RIEUL-SSANGTIKEUT;Lo;0;L;;;;;N;;;;;
+A968;HANGUL CHOSEONG RIEUL-MIEUM;Lo;0;L;;;;;N;;;;;
+A969;HANGUL CHOSEONG RIEUL-PIEUP;Lo;0;L;;;;;N;;;;;
+A96A;HANGUL CHOSEONG RIEUL-SSANGPIEUP;Lo;0;L;;;;;N;;;;;
+A96B;HANGUL CHOSEONG RIEUL-KAPYEOUNPIEUP;Lo;0;L;;;;;N;;;;;
+A96C;HANGUL CHOSEONG RIEUL-SIOS;Lo;0;L;;;;;N;;;;;
+A96D;HANGUL CHOSEONG RIEUL-CIEUC;Lo;0;L;;;;;N;;;;;
+A96E;HANGUL CHOSEONG RIEUL-KHIEUKH;Lo;0;L;;;;;N;;;;;
+A96F;HANGUL CHOSEONG MIEUM-KIYEOK;Lo;0;L;;;;;N;;;;;
+A970;HANGUL CHOSEONG MIEUM-TIKEUT;Lo;0;L;;;;;N;;;;;
+A971;HANGUL CHOSEONG MIEUM-SIOS;Lo;0;L;;;;;N;;;;;
+A972;HANGUL CHOSEONG PIEUP-SIOS-THIEUTH;Lo;0;L;;;;;N;;;;;
+A973;HANGUL CHOSEONG PIEUP-KHIEUKH;Lo;0;L;;;;;N;;;;;
+A974;HANGUL CHOSEONG PIEUP-HIEUH;Lo;0;L;;;;;N;;;;;
+A975;HANGUL CHOSEONG SSANGSIOS-PIEUP;Lo;0;L;;;;;N;;;;;
+A976;HANGUL CHOSEONG IEUNG-RIEUL;Lo;0;L;;;;;N;;;;;
+A977;HANGUL CHOSEONG IEUNG-HIEUH;Lo;0;L;;;;;N;;;;;
+A978;HANGUL CHOSEONG SSANGCIEUC-HIEUH;Lo;0;L;;;;;N;;;;;
+A979;HANGUL CHOSEONG SSANGTHIEUTH;Lo;0;L;;;;;N;;;;;
+A97A;HANGUL CHOSEONG PHIEUPH-HIEUH;Lo;0;L;;;;;N;;;;;
+A97B;HANGUL CHOSEONG HIEUH-SIOS;Lo;0;L;;;;;N;;;;;
+A97C;HANGUL CHOSEONG SSANGYEORINHIEUH;Lo;0;L;;;;;N;;;;;
+A980;JAVANESE SIGN PANYANGGA;Mn;0;NSM;;;;;N;;;;;
+A981;JAVANESE SIGN CECAK;Mn;0;NSM;;;;;N;;;;;
+A982;JAVANESE SIGN LAYAR;Mn;0;NSM;;;;;N;;;;;
+A983;JAVANESE SIGN WIGNYAN;Mc;0;L;;;;;N;;;;;
+A984;JAVANESE LETTER A;Lo;0;L;;;;;N;;;;;
+A985;JAVANESE LETTER I KAWI;Lo;0;L;;;;;N;;;;;
+A986;JAVANESE LETTER I;Lo;0;L;;;;;N;;;;;
+A987;JAVANESE LETTER II;Lo;0;L;;;;;N;;;;;
+A988;JAVANESE LETTER U;Lo;0;L;;;;;N;;;;;
+A989;JAVANESE LETTER PA CEREK;Lo;0;L;;;;;N;;;;;
+A98A;JAVANESE LETTER NGA LELET;Lo;0;L;;;;;N;;;;;
+A98B;JAVANESE LETTER NGA LELET RASWADI;Lo;0;L;;;;;N;;;;;
+A98C;JAVANESE LETTER E;Lo;0;L;;;;;N;;;;;
+A98D;JAVANESE LETTER AI;Lo;0;L;;;;;N;;;;;
+A98E;JAVANESE LETTER O;Lo;0;L;;;;;N;;;;;
+A98F;JAVANESE LETTER KA;Lo;0;L;;;;;N;;;;;
+A990;JAVANESE LETTER KA SASAK;Lo;0;L;;;;;N;;;;;
+A991;JAVANESE LETTER KA MURDA;Lo;0;L;;;;;N;;;;;
+A992;JAVANESE LETTER GA;Lo;0;L;;;;;N;;;;;
+A993;JAVANESE LETTER GA MURDA;Lo;0;L;;;;;N;;;;;
+A994;JAVANESE LETTER NGA;Lo;0;L;;;;;N;;;;;
+A995;JAVANESE LETTER CA;Lo;0;L;;;;;N;;;;;
+A996;JAVANESE LETTER CA MURDA;Lo;0;L;;;;;N;;;;;
+A997;JAVANESE LETTER JA;Lo;0;L;;;;;N;;;;;
+A998;JAVANESE LETTER NYA MURDA;Lo;0;L;;;;;N;;;;;
+A999;JAVANESE LETTER JA MAHAPRANA;Lo;0;L;;;;;N;;;;;
+A99A;JAVANESE LETTER NYA;Lo;0;L;;;;;N;;;;;
+A99B;JAVANESE LETTER TTA;Lo;0;L;;;;;N;;;;;
+A99C;JAVANESE LETTER TTA MAHAPRANA;Lo;0;L;;;;;N;;;;;
+A99D;JAVANESE LETTER DDA;Lo;0;L;;;;;N;;;;;
+A99E;JAVANESE LETTER DDA MAHAPRANA;Lo;0;L;;;;;N;;;;;
+A99F;JAVANESE LETTER NA MURDA;Lo;0;L;;;;;N;;;;;
+A9A0;JAVANESE LETTER TA;Lo;0;L;;;;;N;;;;;
+A9A1;JAVANESE LETTER TA MURDA;Lo;0;L;;;;;N;;;;;
+A9A2;JAVANESE LETTER DA;Lo;0;L;;;;;N;;;;;
+A9A3;JAVANESE LETTER DA MAHAPRANA;Lo;0;L;;;;;N;;;;;
+A9A4;JAVANESE LETTER NA;Lo;0;L;;;;;N;;;;;
+A9A5;JAVANESE LETTER PA;Lo;0;L;;;;;N;;;;;
+A9A6;JAVANESE LETTER PA MURDA;Lo;0;L;;;;;N;;;;;
+A9A7;JAVANESE LETTER BA;Lo;0;L;;;;;N;;;;;
+A9A8;JAVANESE LETTER BA MURDA;Lo;0;L;;;;;N;;;;;
+A9A9;JAVANESE LETTER MA;Lo;0;L;;;;;N;;;;;
+A9AA;JAVANESE LETTER YA;Lo;0;L;;;;;N;;;;;
+A9AB;JAVANESE LETTER RA;Lo;0;L;;;;;N;;;;;
+A9AC;JAVANESE LETTER RA AGUNG;Lo;0;L;;;;;N;;;;;
+A9AD;JAVANESE LETTER LA;Lo;0;L;;;;;N;;;;;
+A9AE;JAVANESE LETTER WA;Lo;0;L;;;;;N;;;;;
+A9AF;JAVANESE LETTER SA MURDA;Lo;0;L;;;;;N;;;;;
+A9B0;JAVANESE LETTER SA MAHAPRANA;Lo;0;L;;;;;N;;;;;
+A9B1;JAVANESE LETTER SA;Lo;0;L;;;;;N;;;;;
+A9B2;JAVANESE LETTER HA;Lo;0;L;;;;;N;;;;;
+A9B3;JAVANESE SIGN CECAK TELU;Mn;7;NSM;;;;;N;;;;;
+A9B4;JAVANESE VOWEL SIGN TARUNG;Mc;0;L;;;;;N;;;;;
+A9B5;JAVANESE VOWEL SIGN TOLONG;Mc;0;L;;;;;N;;;;;
+A9B6;JAVANESE VOWEL SIGN WULU;Mn;0;NSM;;;;;N;;;;;
+A9B7;JAVANESE VOWEL SIGN WULU MELIK;Mn;0;NSM;;;;;N;;;;;
+A9B8;JAVANESE VOWEL SIGN SUKU;Mn;0;NSM;;;;;N;;;;;
+A9B9;JAVANESE VOWEL SIGN SUKU MENDUT;Mn;0;NSM;;;;;N;;;;;
+A9BA;JAVANESE VOWEL SIGN TALING;Mc;0;L;;;;;N;;;;;
+A9BB;JAVANESE VOWEL SIGN DIRGA MURE;Mc;0;L;;;;;N;;;;;
+A9BC;JAVANESE VOWEL SIGN PEPET;Mn;0;NSM;;;;;N;;;;;
+A9BD;JAVANESE CONSONANT SIGN KERET;Mc;0;L;;;;;N;;;;;
+A9BE;JAVANESE CONSONANT SIGN PENGKAL;Mc;0;L;;;;;N;;;;;
+A9BF;JAVANESE CONSONANT SIGN CAKRA;Mc;0;L;;;;;N;;;;;
+A9C0;JAVANESE PANGKON;Mc;9;L;;;;;N;;;;;
+A9C1;JAVANESE LEFT RERENGGAN;Po;0;L;;;;;N;;;;;
+A9C2;JAVANESE RIGHT RERENGGAN;Po;0;L;;;;;N;;;;;
+A9C3;JAVANESE PADA ANDAP;Po;0;L;;;;;N;;;;;
+A9C4;JAVANESE PADA MADYA;Po;0;L;;;;;N;;;;;
+A9C5;JAVANESE PADA LUHUR;Po;0;L;;;;;N;;;;;
+A9C6;JAVANESE PADA WINDU;Po;0;L;;;;;N;;;;;
+A9C7;JAVANESE PADA PANGKAT;Po;0;L;;;;;N;;;;;
+A9C8;JAVANESE PADA LINGSA;Po;0;L;;;;;N;;;;;
+A9C9;JAVANESE PADA LUNGSI;Po;0;L;;;;;N;;;;;
+A9CA;JAVANESE PADA ADEG;Po;0;L;;;;;N;;;;;
+A9CB;JAVANESE PADA ADEG ADEG;Po;0;L;;;;;N;;;;;
+A9CC;JAVANESE PADA PISELEH;Po;0;L;;;;;N;;;;;
+A9CD;JAVANESE TURNED PADA PISELEH;Po;0;L;;;;;N;;;;;
+A9CF;JAVANESE PANGRANGKEP;Lm;0;L;;;;;N;;;;;
+A9D0;JAVANESE DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+A9D1;JAVANESE DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+A9D2;JAVANESE DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+A9D3;JAVANESE DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+A9D4;JAVANESE DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+A9D5;JAVANESE DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+A9D6;JAVANESE DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+A9D7;JAVANESE DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+A9D8;JAVANESE DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+A9D9;JAVANESE DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+A9DE;JAVANESE PADA TIRTA TUMETES;Po;0;L;;;;;N;;;;;
+A9DF;JAVANESE PADA ISEN-ISEN;Po;0;L;;;;;N;;;;;
+A9E0;MYANMAR LETTER SHAN GHA;Lo;0;L;;;;;N;;;;;
+A9E1;MYANMAR LETTER SHAN CHA;Lo;0;L;;;;;N;;;;;
+A9E2;MYANMAR LETTER SHAN JHA;Lo;0;L;;;;;N;;;;;
+A9E3;MYANMAR LETTER SHAN NNA;Lo;0;L;;;;;N;;;;;
+A9E4;MYANMAR LETTER SHAN BHA;Lo;0;L;;;;;N;;;;;
+A9E5;MYANMAR SIGN SHAN SAW;Mn;0;NSM;;;;;N;;;;;
+A9E6;MYANMAR MODIFIER LETTER SHAN REDUPLICATION;Lm;0;L;;;;;N;;;;;
+A9E7;MYANMAR LETTER TAI LAING NYA;Lo;0;L;;;;;N;;;;;
+A9E8;MYANMAR LETTER TAI LAING FA;Lo;0;L;;;;;N;;;;;
+A9E9;MYANMAR LETTER TAI LAING GA;Lo;0;L;;;;;N;;;;;
+A9EA;MYANMAR LETTER TAI LAING GHA;Lo;0;L;;;;;N;;;;;
+A9EB;MYANMAR LETTER TAI LAING JA;Lo;0;L;;;;;N;;;;;
+A9EC;MYANMAR LETTER TAI LAING JHA;Lo;0;L;;;;;N;;;;;
+A9ED;MYANMAR LETTER TAI LAING DDA;Lo;0;L;;;;;N;;;;;
+A9EE;MYANMAR LETTER TAI LAING DDHA;Lo;0;L;;;;;N;;;;;
+A9EF;MYANMAR LETTER TAI LAING NNA;Lo;0;L;;;;;N;;;;;
+A9F0;MYANMAR TAI LAING DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+A9F1;MYANMAR TAI LAING DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+A9F2;MYANMAR TAI LAING DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+A9F3;MYANMAR TAI LAING DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+A9F4;MYANMAR TAI LAING DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+A9F5;MYANMAR TAI LAING DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+A9F6;MYANMAR TAI LAING DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+A9F7;MYANMAR TAI LAING DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+A9F8;MYANMAR TAI LAING DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+A9F9;MYANMAR TAI LAING DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+A9FA;MYANMAR LETTER TAI LAING LLA;Lo;0;L;;;;;N;;;;;
+A9FB;MYANMAR LETTER TAI LAING DA;Lo;0;L;;;;;N;;;;;
+A9FC;MYANMAR LETTER TAI LAING DHA;Lo;0;L;;;;;N;;;;;
+A9FD;MYANMAR LETTER TAI LAING BA;Lo;0;L;;;;;N;;;;;
+A9FE;MYANMAR LETTER TAI LAING BHA;Lo;0;L;;;;;N;;;;;
+AA00;CHAM LETTER A;Lo;0;L;;;;;N;;;;;
+AA01;CHAM LETTER I;Lo;0;L;;;;;N;;;;;
+AA02;CHAM LETTER U;Lo;0;L;;;;;N;;;;;
+AA03;CHAM LETTER E;Lo;0;L;;;;;N;;;;;
+AA04;CHAM LETTER AI;Lo;0;L;;;;;N;;;;;
+AA05;CHAM LETTER O;Lo;0;L;;;;;N;;;;;
+AA06;CHAM LETTER KA;Lo;0;L;;;;;N;;;;;
+AA07;CHAM LETTER KHA;Lo;0;L;;;;;N;;;;;
+AA08;CHAM LETTER GA;Lo;0;L;;;;;N;;;;;
+AA09;CHAM LETTER GHA;Lo;0;L;;;;;N;;;;;
+AA0A;CHAM LETTER NGUE;Lo;0;L;;;;;N;;;;;
+AA0B;CHAM LETTER NGA;Lo;0;L;;;;;N;;;;;
+AA0C;CHAM LETTER CHA;Lo;0;L;;;;;N;;;;;
+AA0D;CHAM LETTER CHHA;Lo;0;L;;;;;N;;;;;
+AA0E;CHAM LETTER JA;Lo;0;L;;;;;N;;;;;
+AA0F;CHAM LETTER JHA;Lo;0;L;;;;;N;;;;;
+AA10;CHAM LETTER NHUE;Lo;0;L;;;;;N;;;;;
+AA11;CHAM LETTER NHA;Lo;0;L;;;;;N;;;;;
+AA12;CHAM LETTER NHJA;Lo;0;L;;;;;N;;;;;
+AA13;CHAM LETTER TA;Lo;0;L;;;;;N;;;;;
+AA14;CHAM LETTER THA;Lo;0;L;;;;;N;;;;;
+AA15;CHAM LETTER DA;Lo;0;L;;;;;N;;;;;
+AA16;CHAM LETTER DHA;Lo;0;L;;;;;N;;;;;
+AA17;CHAM LETTER NUE;Lo;0;L;;;;;N;;;;;
+AA18;CHAM LETTER NA;Lo;0;L;;;;;N;;;;;
+AA19;CHAM LETTER DDA;Lo;0;L;;;;;N;;;;;
+AA1A;CHAM LETTER PA;Lo;0;L;;;;;N;;;;;
+AA1B;CHAM LETTER PPA;Lo;0;L;;;;;N;;;;;
+AA1C;CHAM LETTER PHA;Lo;0;L;;;;;N;;;;;
+AA1D;CHAM LETTER BA;Lo;0;L;;;;;N;;;;;
+AA1E;CHAM LETTER BHA;Lo;0;L;;;;;N;;;;;
+AA1F;CHAM LETTER MUE;Lo;0;L;;;;;N;;;;;
+AA20;CHAM LETTER MA;Lo;0;L;;;;;N;;;;;
+AA21;CHAM LETTER BBA;Lo;0;L;;;;;N;;;;;
+AA22;CHAM LETTER YA;Lo;0;L;;;;;N;;;;;
+AA23;CHAM LETTER RA;Lo;0;L;;;;;N;;;;;
+AA24;CHAM LETTER LA;Lo;0;L;;;;;N;;;;;
+AA25;CHAM LETTER VA;Lo;0;L;;;;;N;;;;;
+AA26;CHAM LETTER SSA;Lo;0;L;;;;;N;;;;;
+AA27;CHAM LETTER SA;Lo;0;L;;;;;N;;;;;
+AA28;CHAM LETTER HA;Lo;0;L;;;;;N;;;;;
+AA29;CHAM VOWEL SIGN AA;Mn;0;NSM;;;;;N;;;;;
+AA2A;CHAM VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+AA2B;CHAM VOWEL SIGN II;Mn;0;NSM;;;;;N;;;;;
+AA2C;CHAM VOWEL SIGN EI;Mn;0;NSM;;;;;N;;;;;
+AA2D;CHAM VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+AA2E;CHAM VOWEL SIGN OE;Mn;0;NSM;;;;;N;;;;;
+AA2F;CHAM VOWEL SIGN O;Mc;0;L;;;;;N;;;;;
+AA30;CHAM VOWEL SIGN AI;Mc;0;L;;;;;N;;;;;
+AA31;CHAM VOWEL SIGN AU;Mn;0;NSM;;;;;N;;;;;
+AA32;CHAM VOWEL SIGN UE;Mn;0;NSM;;;;;N;;;;;
+AA33;CHAM CONSONANT SIGN YA;Mc;0;L;;;;;N;;;;;
+AA34;CHAM CONSONANT SIGN RA;Mc;0;L;;;;;N;;;;;
+AA35;CHAM CONSONANT SIGN LA;Mn;0;NSM;;;;;N;;;;;
+AA36;CHAM CONSONANT SIGN WA;Mn;0;NSM;;;;;N;;;;;
+AA40;CHAM LETTER FINAL K;Lo;0;L;;;;;N;;;;;
+AA41;CHAM LETTER FINAL G;Lo;0;L;;;;;N;;;;;
+AA42;CHAM LETTER FINAL NG;Lo;0;L;;;;;N;;;;;
+AA43;CHAM CONSONANT SIGN FINAL NG;Mn;0;NSM;;;;;N;;;;;
+AA44;CHAM LETTER FINAL CH;Lo;0;L;;;;;N;;;;;
+AA45;CHAM LETTER FINAL T;Lo;0;L;;;;;N;;;;;
+AA46;CHAM LETTER FINAL N;Lo;0;L;;;;;N;;;;;
+AA47;CHAM LETTER FINAL P;Lo;0;L;;;;;N;;;;;
+AA48;CHAM LETTER FINAL Y;Lo;0;L;;;;;N;;;;;
+AA49;CHAM LETTER FINAL R;Lo;0;L;;;;;N;;;;;
+AA4A;CHAM LETTER FINAL L;Lo;0;L;;;;;N;;;;;
+AA4B;CHAM LETTER FINAL SS;Lo;0;L;;;;;N;;;;;
+AA4C;CHAM CONSONANT SIGN FINAL M;Mn;0;NSM;;;;;N;;;;;
+AA4D;CHAM CONSONANT SIGN FINAL H;Mc;0;L;;;;;N;;;;;
+AA50;CHAM DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+AA51;CHAM DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+AA52;CHAM DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+AA53;CHAM DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+AA54;CHAM DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+AA55;CHAM DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+AA56;CHAM DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+AA57;CHAM DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+AA58;CHAM DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+AA59;CHAM DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+AA5C;CHAM PUNCTUATION SPIRAL;Po;0;L;;;;;N;;;;;
+AA5D;CHAM PUNCTUATION DANDA;Po;0;L;;;;;N;;;;;
+AA5E;CHAM PUNCTUATION DOUBLE DANDA;Po;0;L;;;;;N;;;;;
+AA5F;CHAM PUNCTUATION TRIPLE DANDA;Po;0;L;;;;;N;;;;;
+AA60;MYANMAR LETTER KHAMTI GA;Lo;0;L;;;;;N;;;;;
+AA61;MYANMAR LETTER KHAMTI CA;Lo;0;L;;;;;N;;;;;
+AA62;MYANMAR LETTER KHAMTI CHA;Lo;0;L;;;;;N;;;;;
+AA63;MYANMAR LETTER KHAMTI JA;Lo;0;L;;;;;N;;;;;
+AA64;MYANMAR LETTER KHAMTI JHA;Lo;0;L;;;;;N;;;;;
+AA65;MYANMAR LETTER KHAMTI NYA;Lo;0;L;;;;;N;;;;;
+AA66;MYANMAR LETTER KHAMTI TTA;Lo;0;L;;;;;N;;;;;
+AA67;MYANMAR LETTER KHAMTI TTHA;Lo;0;L;;;;;N;;;;;
+AA68;MYANMAR LETTER KHAMTI DDA;Lo;0;L;;;;;N;;;;;
+AA69;MYANMAR LETTER KHAMTI DDHA;Lo;0;L;;;;;N;;;;;
+AA6A;MYANMAR LETTER KHAMTI DHA;Lo;0;L;;;;;N;;;;;
+AA6B;MYANMAR LETTER KHAMTI NA;Lo;0;L;;;;;N;;;;;
+AA6C;MYANMAR LETTER KHAMTI SA;Lo;0;L;;;;;N;;;;;
+AA6D;MYANMAR LETTER KHAMTI HA;Lo;0;L;;;;;N;;;;;
+AA6E;MYANMAR LETTER KHAMTI HHA;Lo;0;L;;;;;N;;;;;
+AA6F;MYANMAR LETTER KHAMTI FA;Lo;0;L;;;;;N;;;;;
+AA70;MYANMAR MODIFIER LETTER KHAMTI REDUPLICATION;Lm;0;L;;;;;N;;;;;
+AA71;MYANMAR LETTER KHAMTI XA;Lo;0;L;;;;;N;;;;;
+AA72;MYANMAR LETTER KHAMTI ZA;Lo;0;L;;;;;N;;;;;
+AA73;MYANMAR LETTER KHAMTI RA;Lo;0;L;;;;;N;;;;;
+AA74;MYANMAR LOGOGRAM KHAMTI OAY;Lo;0;L;;;;;N;;;;;
+AA75;MYANMAR LOGOGRAM KHAMTI QN;Lo;0;L;;;;;N;;;;;
+AA76;MYANMAR LOGOGRAM KHAMTI HM;Lo;0;L;;;;;N;;;;;
+AA77;MYANMAR SYMBOL AITON EXCLAMATION;So;0;L;;;;;N;;;;;
+AA78;MYANMAR SYMBOL AITON ONE;So;0;L;;;;;N;;;;;
+AA79;MYANMAR SYMBOL AITON TWO;So;0;L;;;;;N;;;;;
+AA7A;MYANMAR LETTER AITON RA;Lo;0;L;;;;;N;;;;;
+AA7B;MYANMAR SIGN PAO KAREN TONE;Mc;0;L;;;;;N;;;;;
+AA7C;MYANMAR SIGN TAI LAING TONE-2;Mn;0;NSM;;;;;N;;;;;
+AA7D;MYANMAR SIGN TAI LAING TONE-5;Mc;0;L;;;;;N;;;;;
+AA7E;MYANMAR LETTER SHWE PALAUNG CHA;Lo;0;L;;;;;N;;;;;
+AA7F;MYANMAR LETTER SHWE PALAUNG SHA;Lo;0;L;;;;;N;;;;;
+AA80;TAI VIET LETTER LOW KO;Lo;0;L;;;;;N;;;;;
+AA81;TAI VIET LETTER HIGH KO;Lo;0;L;;;;;N;;;;;
+AA82;TAI VIET LETTER LOW KHO;Lo;0;L;;;;;N;;;;;
+AA83;TAI VIET LETTER HIGH KHO;Lo;0;L;;;;;N;;;;;
+AA84;TAI VIET LETTER LOW KHHO;Lo;0;L;;;;;N;;;;;
+AA85;TAI VIET LETTER HIGH KHHO;Lo;0;L;;;;;N;;;;;
+AA86;TAI VIET LETTER LOW GO;Lo;0;L;;;;;N;;;;;
+AA87;TAI VIET LETTER HIGH GO;Lo;0;L;;;;;N;;;;;
+AA88;TAI VIET LETTER LOW NGO;Lo;0;L;;;;;N;;;;;
+AA89;TAI VIET LETTER HIGH NGO;Lo;0;L;;;;;N;;;;;
+AA8A;TAI VIET LETTER LOW CO;Lo;0;L;;;;;N;;;;;
+AA8B;TAI VIET LETTER HIGH CO;Lo;0;L;;;;;N;;;;;
+AA8C;TAI VIET LETTER LOW CHO;Lo;0;L;;;;;N;;;;;
+AA8D;TAI VIET LETTER HIGH CHO;Lo;0;L;;;;;N;;;;;
+AA8E;TAI VIET LETTER LOW SO;Lo;0;L;;;;;N;;;;;
+AA8F;TAI VIET LETTER HIGH SO;Lo;0;L;;;;;N;;;;;
+AA90;TAI VIET LETTER LOW NYO;Lo;0;L;;;;;N;;;;;
+AA91;TAI VIET LETTER HIGH NYO;Lo;0;L;;;;;N;;;;;
+AA92;TAI VIET LETTER LOW DO;Lo;0;L;;;;;N;;;;;
+AA93;TAI VIET LETTER HIGH DO;Lo;0;L;;;;;N;;;;;
+AA94;TAI VIET LETTER LOW TO;Lo;0;L;;;;;N;;;;;
+AA95;TAI VIET LETTER HIGH TO;Lo;0;L;;;;;N;;;;;
+AA96;TAI VIET LETTER LOW THO;Lo;0;L;;;;;N;;;;;
+AA97;TAI VIET LETTER HIGH THO;Lo;0;L;;;;;N;;;;;
+AA98;TAI VIET LETTER LOW NO;Lo;0;L;;;;;N;;;;;
+AA99;TAI VIET LETTER HIGH NO;Lo;0;L;;;;;N;;;;;
+AA9A;TAI VIET LETTER LOW BO;Lo;0;L;;;;;N;;;;;
+AA9B;TAI VIET LETTER HIGH BO;Lo;0;L;;;;;N;;;;;
+AA9C;TAI VIET LETTER LOW PO;Lo;0;L;;;;;N;;;;;
+AA9D;TAI VIET LETTER HIGH PO;Lo;0;L;;;;;N;;;;;
+AA9E;TAI VIET LETTER LOW PHO;Lo;0;L;;;;;N;;;;;
+AA9F;TAI VIET LETTER HIGH PHO;Lo;0;L;;;;;N;;;;;
+AAA0;TAI VIET LETTER LOW FO;Lo;0;L;;;;;N;;;;;
+AAA1;TAI VIET LETTER HIGH FO;Lo;0;L;;;;;N;;;;;
+AAA2;TAI VIET LETTER LOW MO;Lo;0;L;;;;;N;;;;;
+AAA3;TAI VIET LETTER HIGH MO;Lo;0;L;;;;;N;;;;;
+AAA4;TAI VIET LETTER LOW YO;Lo;0;L;;;;;N;;;;;
+AAA5;TAI VIET LETTER HIGH YO;Lo;0;L;;;;;N;;;;;
+AAA6;TAI VIET LETTER LOW RO;Lo;0;L;;;;;N;;;;;
+AAA7;TAI VIET LETTER HIGH RO;Lo;0;L;;;;;N;;;;;
+AAA8;TAI VIET LETTER LOW LO;Lo;0;L;;;;;N;;;;;
+AAA9;TAI VIET LETTER HIGH LO;Lo;0;L;;;;;N;;;;;
+AAAA;TAI VIET LETTER LOW VO;Lo;0;L;;;;;N;;;;;
+AAAB;TAI VIET LETTER HIGH VO;Lo;0;L;;;;;N;;;;;
+AAAC;TAI VIET LETTER LOW HO;Lo;0;L;;;;;N;;;;;
+AAAD;TAI VIET LETTER HIGH HO;Lo;0;L;;;;;N;;;;;
+AAAE;TAI VIET LETTER LOW O;Lo;0;L;;;;;N;;;;;
+AAAF;TAI VIET LETTER HIGH O;Lo;0;L;;;;;N;;;;;
+AAB0;TAI VIET MAI KANG;Mn;230;NSM;;;;;N;;;;;
+AAB1;TAI VIET VOWEL AA;Lo;0;L;;;;;N;;;;;
+AAB2;TAI VIET VOWEL I;Mn;230;NSM;;;;;N;;;;;
+AAB3;TAI VIET VOWEL UE;Mn;230;NSM;;;;;N;;;;;
+AAB4;TAI VIET VOWEL U;Mn;220;NSM;;;;;N;;;;;
+AAB5;TAI VIET VOWEL E;Lo;0;L;;;;;N;;;;;
+AAB6;TAI VIET VOWEL O;Lo;0;L;;;;;N;;;;;
+AAB7;TAI VIET MAI KHIT;Mn;230;NSM;;;;;N;;;;;
+AAB8;TAI VIET VOWEL IA;Mn;230;NSM;;;;;N;;;;;
+AAB9;TAI VIET VOWEL UEA;Lo;0;L;;;;;N;;;;;
+AABA;TAI VIET VOWEL UA;Lo;0;L;;;;;N;;;;;
+AABB;TAI VIET VOWEL AUE;Lo;0;L;;;;;N;;;;;
+AABC;TAI VIET VOWEL AY;Lo;0;L;;;;;N;;;;;
+AABD;TAI VIET VOWEL AN;Lo;0;L;;;;;N;;;;;
+AABE;TAI VIET VOWEL AM;Mn;230;NSM;;;;;N;;;;;
+AABF;TAI VIET TONE MAI EK;Mn;230;NSM;;;;;N;;;;;
+AAC0;TAI VIET TONE MAI NUENG;Lo;0;L;;;;;N;;;;;
+AAC1;TAI VIET TONE MAI THO;Mn;230;NSM;;;;;N;;;;;
+AAC2;TAI VIET TONE MAI SONG;Lo;0;L;;;;;N;;;;;
+AADB;TAI VIET SYMBOL KON;Lo;0;L;;;;;N;;;;;
+AADC;TAI VIET SYMBOL NUENG;Lo;0;L;;;;;N;;;;;
+AADD;TAI VIET SYMBOL SAM;Lm;0;L;;;;;N;;;;;
+AADE;TAI VIET SYMBOL HO HOI;Po;0;L;;;;;N;;;;;
+AADF;TAI VIET SYMBOL KOI KOI;Po;0;L;;;;;N;;;;;
+AAE0;MEETEI MAYEK LETTER E;Lo;0;L;;;;;N;;;;;
+AAE1;MEETEI MAYEK LETTER O;Lo;0;L;;;;;N;;;;;
+AAE2;MEETEI MAYEK LETTER CHA;Lo;0;L;;;;;N;;;;;
+AAE3;MEETEI MAYEK LETTER NYA;Lo;0;L;;;;;N;;;;;
+AAE4;MEETEI MAYEK LETTER TTA;Lo;0;L;;;;;N;;;;;
+AAE5;MEETEI MAYEK LETTER TTHA;Lo;0;L;;;;;N;;;;;
+AAE6;MEETEI MAYEK LETTER DDA;Lo;0;L;;;;;N;;;;;
+AAE7;MEETEI MAYEK LETTER DDHA;Lo;0;L;;;;;N;;;;;
+AAE8;MEETEI MAYEK LETTER NNA;Lo;0;L;;;;;N;;;;;
+AAE9;MEETEI MAYEK LETTER SHA;Lo;0;L;;;;;N;;;;;
+AAEA;MEETEI MAYEK LETTER SSA;Lo;0;L;;;;;N;;;;;
+AAEB;MEETEI MAYEK VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+AAEC;MEETEI MAYEK VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+AAED;MEETEI MAYEK VOWEL SIGN AAI;Mn;0;NSM;;;;;N;;;;;
+AAEE;MEETEI MAYEK VOWEL SIGN AU;Mc;0;L;;;;;N;;;;;
+AAEF;MEETEI MAYEK VOWEL SIGN AAU;Mc;0;L;;;;;N;;;;;
+AAF0;MEETEI MAYEK CHEIKHAN;Po;0;L;;;;;N;;;;;
+AAF1;MEETEI MAYEK AHANG KHUDAM;Po;0;L;;;;;N;;;;;
+AAF2;MEETEI MAYEK ANJI;Lo;0;L;;;;;N;;;;;
+AAF3;MEETEI MAYEK SYLLABLE REPETITION MARK;Lm;0;L;;;;;N;;;;;
+AAF4;MEETEI MAYEK WORD REPETITION MARK;Lm;0;L;;;;;N;;;;;
+AAF5;MEETEI MAYEK VOWEL SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+AAF6;MEETEI MAYEK VIRAMA;Mn;9;NSM;;;;;N;;;;;
+AB01;ETHIOPIC SYLLABLE TTHU;Lo;0;L;;;;;N;;;;;
+AB02;ETHIOPIC SYLLABLE TTHI;Lo;0;L;;;;;N;;;;;
+AB03;ETHIOPIC SYLLABLE TTHAA;Lo;0;L;;;;;N;;;;;
+AB04;ETHIOPIC SYLLABLE TTHEE;Lo;0;L;;;;;N;;;;;
+AB05;ETHIOPIC SYLLABLE TTHE;Lo;0;L;;;;;N;;;;;
+AB06;ETHIOPIC SYLLABLE TTHO;Lo;0;L;;;;;N;;;;;
+AB09;ETHIOPIC SYLLABLE DDHU;Lo;0;L;;;;;N;;;;;
+AB0A;ETHIOPIC SYLLABLE DDHI;Lo;0;L;;;;;N;;;;;
+AB0B;ETHIOPIC SYLLABLE DDHAA;Lo;0;L;;;;;N;;;;;
+AB0C;ETHIOPIC SYLLABLE DDHEE;Lo;0;L;;;;;N;;;;;
+AB0D;ETHIOPIC SYLLABLE DDHE;Lo;0;L;;;;;N;;;;;
+AB0E;ETHIOPIC SYLLABLE DDHO;Lo;0;L;;;;;N;;;;;
+AB11;ETHIOPIC SYLLABLE DZU;Lo;0;L;;;;;N;;;;;
+AB12;ETHIOPIC SYLLABLE DZI;Lo;0;L;;;;;N;;;;;
+AB13;ETHIOPIC SYLLABLE DZAA;Lo;0;L;;;;;N;;;;;
+AB14;ETHIOPIC SYLLABLE DZEE;Lo;0;L;;;;;N;;;;;
+AB15;ETHIOPIC SYLLABLE DZE;Lo;0;L;;;;;N;;;;;
+AB16;ETHIOPIC SYLLABLE DZO;Lo;0;L;;;;;N;;;;;
+AB20;ETHIOPIC SYLLABLE CCHHA;Lo;0;L;;;;;N;;;;;
+AB21;ETHIOPIC SYLLABLE CCHHU;Lo;0;L;;;;;N;;;;;
+AB22;ETHIOPIC SYLLABLE CCHHI;Lo;0;L;;;;;N;;;;;
+AB23;ETHIOPIC SYLLABLE CCHHAA;Lo;0;L;;;;;N;;;;;
+AB24;ETHIOPIC SYLLABLE CCHHEE;Lo;0;L;;;;;N;;;;;
+AB25;ETHIOPIC SYLLABLE CCHHE;Lo;0;L;;;;;N;;;;;
+AB26;ETHIOPIC SYLLABLE CCHHO;Lo;0;L;;;;;N;;;;;
+AB28;ETHIOPIC SYLLABLE BBA;Lo;0;L;;;;;N;;;;;
+AB29;ETHIOPIC SYLLABLE BBU;Lo;0;L;;;;;N;;;;;
+AB2A;ETHIOPIC SYLLABLE BBI;Lo;0;L;;;;;N;;;;;
+AB2B;ETHIOPIC SYLLABLE BBAA;Lo;0;L;;;;;N;;;;;
+AB2C;ETHIOPIC SYLLABLE BBEE;Lo;0;L;;;;;N;;;;;
+AB2D;ETHIOPIC SYLLABLE BBE;Lo;0;L;;;;;N;;;;;
+AB2E;ETHIOPIC SYLLABLE BBO;Lo;0;L;;;;;N;;;;;
+AB30;LATIN SMALL LETTER BARRED ALPHA;Ll;0;L;;;;;N;;;;;
+AB31;LATIN SMALL LETTER A REVERSED-SCHWA;Ll;0;L;;;;;N;;;;;
+AB32;LATIN SMALL LETTER BLACKLETTER E;Ll;0;L;;;;;N;;;;;
+AB33;LATIN SMALL LETTER BARRED E;Ll;0;L;;;;;N;;;;;
+AB34;LATIN SMALL LETTER E WITH FLOURISH;Ll;0;L;;;;;N;;;;;
+AB35;LATIN SMALL LETTER LENIS F;Ll;0;L;;;;;N;;;;;
+AB36;LATIN SMALL LETTER SCRIPT G WITH CROSSED-TAIL;Ll;0;L;;;;;N;;;;;
+AB37;LATIN SMALL LETTER L WITH INVERTED LAZY S;Ll;0;L;;;;;N;;;;;
+AB38;LATIN SMALL LETTER L WITH DOUBLE MIDDLE TILDE;Ll;0;L;;;;;N;;;;;
+AB39;LATIN SMALL LETTER L WITH MIDDLE RING;Ll;0;L;;;;;N;;;;;
+AB3A;LATIN SMALL LETTER M WITH CROSSED-TAIL;Ll;0;L;;;;;N;;;;;
+AB3B;LATIN SMALL LETTER N WITH CROSSED-TAIL;Ll;0;L;;;;;N;;;;;
+AB3C;LATIN SMALL LETTER ENG WITH CROSSED-TAIL;Ll;0;L;;;;;N;;;;;
+AB3D;LATIN SMALL LETTER BLACKLETTER O;Ll;0;L;;;;;N;;;;;
+AB3E;LATIN SMALL LETTER BLACKLETTER O WITH STROKE;Ll;0;L;;;;;N;;;;;
+AB3F;LATIN SMALL LETTER OPEN O WITH STROKE;Ll;0;L;;;;;N;;;;;
+AB40;LATIN SMALL LETTER INVERTED OE;Ll;0;L;;;;;N;;;;;
+AB41;LATIN SMALL LETTER TURNED OE WITH STROKE;Ll;0;L;;;;;N;;;;;
+AB42;LATIN SMALL LETTER TURNED OE WITH HORIZONTAL STROKE;Ll;0;L;;;;;N;;;;;
+AB43;LATIN SMALL LETTER TURNED O OPEN-O;Ll;0;L;;;;;N;;;;;
+AB44;LATIN SMALL LETTER TURNED O OPEN-O WITH STROKE;Ll;0;L;;;;;N;;;;;
+AB45;LATIN SMALL LETTER STIRRUP R;Ll;0;L;;;;;N;;;;;
+AB46;LATIN LETTER SMALL CAPITAL R WITH RIGHT LEG;Ll;0;L;;;;;N;;;;;
+AB47;LATIN SMALL LETTER R WITHOUT HANDLE;Ll;0;L;;;;;N;;;;;
+AB48;LATIN SMALL LETTER DOUBLE R;Ll;0;L;;;;;N;;;;;
+AB49;LATIN SMALL LETTER R WITH CROSSED-TAIL;Ll;0;L;;;;;N;;;;;
+AB4A;LATIN SMALL LETTER DOUBLE R WITH CROSSED-TAIL;Ll;0;L;;;;;N;;;;;
+AB4B;LATIN SMALL LETTER SCRIPT R;Ll;0;L;;;;;N;;;;;
+AB4C;LATIN SMALL LETTER SCRIPT R WITH RING;Ll;0;L;;;;;N;;;;;
+AB4D;LATIN SMALL LETTER BASELINE ESH;Ll;0;L;;;;;N;;;;;
+AB4E;LATIN SMALL LETTER U WITH SHORT RIGHT LEG;Ll;0;L;;;;;N;;;;;
+AB4F;LATIN SMALL LETTER U BAR WITH SHORT RIGHT LEG;Ll;0;L;;;;;N;;;;;
+AB50;LATIN SMALL LETTER UI;Ll;0;L;;;;;N;;;;;
+AB51;LATIN SMALL LETTER TURNED UI;Ll;0;L;;;;;N;;;;;
+AB52;LATIN SMALL LETTER U WITH LEFT HOOK;Ll;0;L;;;;;N;;;;;
+AB53;LATIN SMALL LETTER CHI;Ll;0;L;;;;;N;;;A7B3;;A7B3
+AB54;LATIN SMALL LETTER CHI WITH LOW RIGHT RING;Ll;0;L;;;;;N;;;;;
+AB55;LATIN SMALL LETTER CHI WITH LOW LEFT SERIF;Ll;0;L;;;;;N;;;;;
+AB56;LATIN SMALL LETTER X WITH LOW RIGHT RING;Ll;0;L;;;;;N;;;;;
+AB57;LATIN SMALL LETTER X WITH LONG LEFT LEG;Ll;0;L;;;;;N;;;;;
+AB58;LATIN SMALL LETTER X WITH LONG LEFT LEG AND LOW RIGHT RING;Ll;0;L;;;;;N;;;;;
+AB59;LATIN SMALL LETTER X WITH LONG LEFT LEG WITH SERIF;Ll;0;L;;;;;N;;;;;
+AB5A;LATIN SMALL LETTER Y WITH SHORT RIGHT LEG;Ll;0;L;;;;;N;;;;;
+AB5B;MODIFIER BREVE WITH INVERTED BREVE;Sk;0;L;;;;;N;;;;;
+AB5C;MODIFIER LETTER SMALL HENG;Lm;0;L;<super> A727;;;;N;;;;;
+AB5D;MODIFIER LETTER SMALL L WITH INVERTED LAZY S;Lm;0;L;<super> AB37;;;;N;;;;;
+AB5E;MODIFIER LETTER SMALL L WITH MIDDLE TILDE;Lm;0;L;<super> 026B;;;;N;;;;;
+AB5F;MODIFIER LETTER SMALL U WITH LEFT HOOK;Lm;0;L;<super> AB52;;;;N;;;;;
+AB60;LATIN SMALL LETTER SAKHA YAT;Ll;0;L;;;;;N;;;;;
+AB61;LATIN SMALL LETTER IOTIFIED E;Ll;0;L;;;;;N;;;;;
+AB62;LATIN SMALL LETTER OPEN OE;Ll;0;L;;;;;N;;;;;
+AB63;LATIN SMALL LETTER UO;Ll;0;L;;;;;N;;;;;
+AB64;LATIN SMALL LETTER INVERTED ALPHA;Ll;0;L;;;;;N;;;;;
+AB65;GREEK LETTER SMALL CAPITAL OMEGA;Ll;0;L;;;;;N;;;;;
+AB70;CHEROKEE SMALL LETTER A;Ll;0;L;;;;;N;;;13A0;;13A0
+AB71;CHEROKEE SMALL LETTER E;Ll;0;L;;;;;N;;;13A1;;13A1
+AB72;CHEROKEE SMALL LETTER I;Ll;0;L;;;;;N;;;13A2;;13A2
+AB73;CHEROKEE SMALL LETTER O;Ll;0;L;;;;;N;;;13A3;;13A3
+AB74;CHEROKEE SMALL LETTER U;Ll;0;L;;;;;N;;;13A4;;13A4
+AB75;CHEROKEE SMALL LETTER V;Ll;0;L;;;;;N;;;13A5;;13A5
+AB76;CHEROKEE SMALL LETTER GA;Ll;0;L;;;;;N;;;13A6;;13A6
+AB77;CHEROKEE SMALL LETTER KA;Ll;0;L;;;;;N;;;13A7;;13A7
+AB78;CHEROKEE SMALL LETTER GE;Ll;0;L;;;;;N;;;13A8;;13A8
+AB79;CHEROKEE SMALL LETTER GI;Ll;0;L;;;;;N;;;13A9;;13A9
+AB7A;CHEROKEE SMALL LETTER GO;Ll;0;L;;;;;N;;;13AA;;13AA
+AB7B;CHEROKEE SMALL LETTER GU;Ll;0;L;;;;;N;;;13AB;;13AB
+AB7C;CHEROKEE SMALL LETTER GV;Ll;0;L;;;;;N;;;13AC;;13AC
+AB7D;CHEROKEE SMALL LETTER HA;Ll;0;L;;;;;N;;;13AD;;13AD
+AB7E;CHEROKEE SMALL LETTER HE;Ll;0;L;;;;;N;;;13AE;;13AE
+AB7F;CHEROKEE SMALL LETTER HI;Ll;0;L;;;;;N;;;13AF;;13AF
+AB80;CHEROKEE SMALL LETTER HO;Ll;0;L;;;;;N;;;13B0;;13B0
+AB81;CHEROKEE SMALL LETTER HU;Ll;0;L;;;;;N;;;13B1;;13B1
+AB82;CHEROKEE SMALL LETTER HV;Ll;0;L;;;;;N;;;13B2;;13B2
+AB83;CHEROKEE SMALL LETTER LA;Ll;0;L;;;;;N;;;13B3;;13B3
+AB84;CHEROKEE SMALL LETTER LE;Ll;0;L;;;;;N;;;13B4;;13B4
+AB85;CHEROKEE SMALL LETTER LI;Ll;0;L;;;;;N;;;13B5;;13B5
+AB86;CHEROKEE SMALL LETTER LO;Ll;0;L;;;;;N;;;13B6;;13B6
+AB87;CHEROKEE SMALL LETTER LU;Ll;0;L;;;;;N;;;13B7;;13B7
+AB88;CHEROKEE SMALL LETTER LV;Ll;0;L;;;;;N;;;13B8;;13B8
+AB89;CHEROKEE SMALL LETTER MA;Ll;0;L;;;;;N;;;13B9;;13B9
+AB8A;CHEROKEE SMALL LETTER ME;Ll;0;L;;;;;N;;;13BA;;13BA
+AB8B;CHEROKEE SMALL LETTER MI;Ll;0;L;;;;;N;;;13BB;;13BB
+AB8C;CHEROKEE SMALL LETTER MO;Ll;0;L;;;;;N;;;13BC;;13BC
+AB8D;CHEROKEE SMALL LETTER MU;Ll;0;L;;;;;N;;;13BD;;13BD
+AB8E;CHEROKEE SMALL LETTER NA;Ll;0;L;;;;;N;;;13BE;;13BE
+AB8F;CHEROKEE SMALL LETTER HNA;Ll;0;L;;;;;N;;;13BF;;13BF
+AB90;CHEROKEE SMALL LETTER NAH;Ll;0;L;;;;;N;;;13C0;;13C0
+AB91;CHEROKEE SMALL LETTER NE;Ll;0;L;;;;;N;;;13C1;;13C1
+AB92;CHEROKEE SMALL LETTER NI;Ll;0;L;;;;;N;;;13C2;;13C2
+AB93;CHEROKEE SMALL LETTER NO;Ll;0;L;;;;;N;;;13C3;;13C3
+AB94;CHEROKEE SMALL LETTER NU;Ll;0;L;;;;;N;;;13C4;;13C4
+AB95;CHEROKEE SMALL LETTER NV;Ll;0;L;;;;;N;;;13C5;;13C5
+AB96;CHEROKEE SMALL LETTER QUA;Ll;0;L;;;;;N;;;13C6;;13C6
+AB97;CHEROKEE SMALL LETTER QUE;Ll;0;L;;;;;N;;;13C7;;13C7
+AB98;CHEROKEE SMALL LETTER QUI;Ll;0;L;;;;;N;;;13C8;;13C8
+AB99;CHEROKEE SMALL LETTER QUO;Ll;0;L;;;;;N;;;13C9;;13C9
+AB9A;CHEROKEE SMALL LETTER QUU;Ll;0;L;;;;;N;;;13CA;;13CA
+AB9B;CHEROKEE SMALL LETTER QUV;Ll;0;L;;;;;N;;;13CB;;13CB
+AB9C;CHEROKEE SMALL LETTER SA;Ll;0;L;;;;;N;;;13CC;;13CC
+AB9D;CHEROKEE SMALL LETTER S;Ll;0;L;;;;;N;;;13CD;;13CD
+AB9E;CHEROKEE SMALL LETTER SE;Ll;0;L;;;;;N;;;13CE;;13CE
+AB9F;CHEROKEE SMALL LETTER SI;Ll;0;L;;;;;N;;;13CF;;13CF
+ABA0;CHEROKEE SMALL LETTER SO;Ll;0;L;;;;;N;;;13D0;;13D0
+ABA1;CHEROKEE SMALL LETTER SU;Ll;0;L;;;;;N;;;13D1;;13D1
+ABA2;CHEROKEE SMALL LETTER SV;Ll;0;L;;;;;N;;;13D2;;13D2
+ABA3;CHEROKEE SMALL LETTER DA;Ll;0;L;;;;;N;;;13D3;;13D3
+ABA4;CHEROKEE SMALL LETTER TA;Ll;0;L;;;;;N;;;13D4;;13D4
+ABA5;CHEROKEE SMALL LETTER DE;Ll;0;L;;;;;N;;;13D5;;13D5
+ABA6;CHEROKEE SMALL LETTER TE;Ll;0;L;;;;;N;;;13D6;;13D6
+ABA7;CHEROKEE SMALL LETTER DI;Ll;0;L;;;;;N;;;13D7;;13D7
+ABA8;CHEROKEE SMALL LETTER TI;Ll;0;L;;;;;N;;;13D8;;13D8
+ABA9;CHEROKEE SMALL LETTER DO;Ll;0;L;;;;;N;;;13D9;;13D9
+ABAA;CHEROKEE SMALL LETTER DU;Ll;0;L;;;;;N;;;13DA;;13DA
+ABAB;CHEROKEE SMALL LETTER DV;Ll;0;L;;;;;N;;;13DB;;13DB
+ABAC;CHEROKEE SMALL LETTER DLA;Ll;0;L;;;;;N;;;13DC;;13DC
+ABAD;CHEROKEE SMALL LETTER TLA;Ll;0;L;;;;;N;;;13DD;;13DD
+ABAE;CHEROKEE SMALL LETTER TLE;Ll;0;L;;;;;N;;;13DE;;13DE
+ABAF;CHEROKEE SMALL LETTER TLI;Ll;0;L;;;;;N;;;13DF;;13DF
+ABB0;CHEROKEE SMALL LETTER TLO;Ll;0;L;;;;;N;;;13E0;;13E0
+ABB1;CHEROKEE SMALL LETTER TLU;Ll;0;L;;;;;N;;;13E1;;13E1
+ABB2;CHEROKEE SMALL LETTER TLV;Ll;0;L;;;;;N;;;13E2;;13E2
+ABB3;CHEROKEE SMALL LETTER TSA;Ll;0;L;;;;;N;;;13E3;;13E3
+ABB4;CHEROKEE SMALL LETTER TSE;Ll;0;L;;;;;N;;;13E4;;13E4
+ABB5;CHEROKEE SMALL LETTER TSI;Ll;0;L;;;;;N;;;13E5;;13E5
+ABB6;CHEROKEE SMALL LETTER TSO;Ll;0;L;;;;;N;;;13E6;;13E6
+ABB7;CHEROKEE SMALL LETTER TSU;Ll;0;L;;;;;N;;;13E7;;13E7
+ABB8;CHEROKEE SMALL LETTER TSV;Ll;0;L;;;;;N;;;13E8;;13E8
+ABB9;CHEROKEE SMALL LETTER WA;Ll;0;L;;;;;N;;;13E9;;13E9
+ABBA;CHEROKEE SMALL LETTER WE;Ll;0;L;;;;;N;;;13EA;;13EA
+ABBB;CHEROKEE SMALL LETTER WI;Ll;0;L;;;;;N;;;13EB;;13EB
+ABBC;CHEROKEE SMALL LETTER WO;Ll;0;L;;;;;N;;;13EC;;13EC
+ABBD;CHEROKEE SMALL LETTER WU;Ll;0;L;;;;;N;;;13ED;;13ED
+ABBE;CHEROKEE SMALL LETTER WV;Ll;0;L;;;;;N;;;13EE;;13EE
+ABBF;CHEROKEE SMALL LETTER YA;Ll;0;L;;;;;N;;;13EF;;13EF
+ABC0;MEETEI MAYEK LETTER KOK;Lo;0;L;;;;;N;;;;;
+ABC1;MEETEI MAYEK LETTER SAM;Lo;0;L;;;;;N;;;;;
+ABC2;MEETEI MAYEK LETTER LAI;Lo;0;L;;;;;N;;;;;
+ABC3;MEETEI MAYEK LETTER MIT;Lo;0;L;;;;;N;;;;;
+ABC4;MEETEI MAYEK LETTER PA;Lo;0;L;;;;;N;;;;;
+ABC5;MEETEI MAYEK LETTER NA;Lo;0;L;;;;;N;;;;;
+ABC6;MEETEI MAYEK LETTER CHIL;Lo;0;L;;;;;N;;;;;
+ABC7;MEETEI MAYEK LETTER TIL;Lo;0;L;;;;;N;;;;;
+ABC8;MEETEI MAYEK LETTER KHOU;Lo;0;L;;;;;N;;;;;
+ABC9;MEETEI MAYEK LETTER NGOU;Lo;0;L;;;;;N;;;;;
+ABCA;MEETEI MAYEK LETTER THOU;Lo;0;L;;;;;N;;;;;
+ABCB;MEETEI MAYEK LETTER WAI;Lo;0;L;;;;;N;;;;;
+ABCC;MEETEI MAYEK LETTER YANG;Lo;0;L;;;;;N;;;;;
+ABCD;MEETEI MAYEK LETTER HUK;Lo;0;L;;;;;N;;;;;
+ABCE;MEETEI MAYEK LETTER UN;Lo;0;L;;;;;N;;;;;
+ABCF;MEETEI MAYEK LETTER I;Lo;0;L;;;;;N;;;;;
+ABD0;MEETEI MAYEK LETTER PHAM;Lo;0;L;;;;;N;;;;;
+ABD1;MEETEI MAYEK LETTER ATIYA;Lo;0;L;;;;;N;;;;;
+ABD2;MEETEI MAYEK LETTER GOK;Lo;0;L;;;;;N;;;;;
+ABD3;MEETEI MAYEK LETTER JHAM;Lo;0;L;;;;;N;;;;;
+ABD4;MEETEI MAYEK LETTER RAI;Lo;0;L;;;;;N;;;;;
+ABD5;MEETEI MAYEK LETTER BA;Lo;0;L;;;;;N;;;;;
+ABD6;MEETEI MAYEK LETTER JIL;Lo;0;L;;;;;N;;;;;
+ABD7;MEETEI MAYEK LETTER DIL;Lo;0;L;;;;;N;;;;;
+ABD8;MEETEI MAYEK LETTER GHOU;Lo;0;L;;;;;N;;;;;
+ABD9;MEETEI MAYEK LETTER DHOU;Lo;0;L;;;;;N;;;;;
+ABDA;MEETEI MAYEK LETTER BHAM;Lo;0;L;;;;;N;;;;;
+ABDB;MEETEI MAYEK LETTER KOK LONSUM;Lo;0;L;;;;;N;;;;;
+ABDC;MEETEI MAYEK LETTER LAI LONSUM;Lo;0;L;;;;;N;;;;;
+ABDD;MEETEI MAYEK LETTER MIT LONSUM;Lo;0;L;;;;;N;;;;;
+ABDE;MEETEI MAYEK LETTER PA LONSUM;Lo;0;L;;;;;N;;;;;
+ABDF;MEETEI MAYEK LETTER NA LONSUM;Lo;0;L;;;;;N;;;;;
+ABE0;MEETEI MAYEK LETTER TIL LONSUM;Lo;0;L;;;;;N;;;;;
+ABE1;MEETEI MAYEK LETTER NGOU LONSUM;Lo;0;L;;;;;N;;;;;
+ABE2;MEETEI MAYEK LETTER I LONSUM;Lo;0;L;;;;;N;;;;;
+ABE3;MEETEI MAYEK VOWEL SIGN ONAP;Mc;0;L;;;;;N;;;;;
+ABE4;MEETEI MAYEK VOWEL SIGN INAP;Mc;0;L;;;;;N;;;;;
+ABE5;MEETEI MAYEK VOWEL SIGN ANAP;Mn;0;NSM;;;;;N;;;;;
+ABE6;MEETEI MAYEK VOWEL SIGN YENAP;Mc;0;L;;;;;N;;;;;
+ABE7;MEETEI MAYEK VOWEL SIGN SOUNAP;Mc;0;L;;;;;N;;;;;
+ABE8;MEETEI MAYEK VOWEL SIGN UNAP;Mn;0;NSM;;;;;N;;;;;
+ABE9;MEETEI MAYEK VOWEL SIGN CHEINAP;Mc;0;L;;;;;N;;;;;
+ABEA;MEETEI MAYEK VOWEL SIGN NUNG;Mc;0;L;;;;;N;;;;;
+ABEB;MEETEI MAYEK CHEIKHEI;Po;0;L;;;;;N;;;;;
+ABEC;MEETEI MAYEK LUM IYEK;Mc;0;L;;;;;N;;;;;
+ABED;MEETEI MAYEK APUN IYEK;Mn;9;NSM;;;;;N;;;;;
+ABF0;MEETEI MAYEK DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+ABF1;MEETEI MAYEK DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+ABF2;MEETEI MAYEK DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+ABF3;MEETEI MAYEK DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+ABF4;MEETEI MAYEK DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+ABF5;MEETEI MAYEK DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+ABF6;MEETEI MAYEK DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+ABF7;MEETEI MAYEK DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+ABF8;MEETEI MAYEK DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+ABF9;MEETEI MAYEK DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+AC00;<Hangul Syllable, First>;Lo;0;L;;;;;N;;;;;
+D7A3;<Hangul Syllable, Last>;Lo;0;L;;;;;N;;;;;
+D7B0;HANGUL JUNGSEONG O-YEO;Lo;0;L;;;;;N;;;;;
+D7B1;HANGUL JUNGSEONG O-O-I;Lo;0;L;;;;;N;;;;;
+D7B2;HANGUL JUNGSEONG YO-A;Lo;0;L;;;;;N;;;;;
+D7B3;HANGUL JUNGSEONG YO-AE;Lo;0;L;;;;;N;;;;;
+D7B4;HANGUL JUNGSEONG YO-EO;Lo;0;L;;;;;N;;;;;
+D7B5;HANGUL JUNGSEONG U-YEO;Lo;0;L;;;;;N;;;;;
+D7B6;HANGUL JUNGSEONG U-I-I;Lo;0;L;;;;;N;;;;;
+D7B7;HANGUL JUNGSEONG YU-AE;Lo;0;L;;;;;N;;;;;
+D7B8;HANGUL JUNGSEONG YU-O;Lo;0;L;;;;;N;;;;;
+D7B9;HANGUL JUNGSEONG EU-A;Lo;0;L;;;;;N;;;;;
+D7BA;HANGUL JUNGSEONG EU-EO;Lo;0;L;;;;;N;;;;;
+D7BB;HANGUL JUNGSEONG EU-E;Lo;0;L;;;;;N;;;;;
+D7BC;HANGUL JUNGSEONG EU-O;Lo;0;L;;;;;N;;;;;
+D7BD;HANGUL JUNGSEONG I-YA-O;Lo;0;L;;;;;N;;;;;
+D7BE;HANGUL JUNGSEONG I-YAE;Lo;0;L;;;;;N;;;;;
+D7BF;HANGUL JUNGSEONG I-YEO;Lo;0;L;;;;;N;;;;;
+D7C0;HANGUL JUNGSEONG I-YE;Lo;0;L;;;;;N;;;;;
+D7C1;HANGUL JUNGSEONG I-O-I;Lo;0;L;;;;;N;;;;;
+D7C2;HANGUL JUNGSEONG I-YO;Lo;0;L;;;;;N;;;;;
+D7C3;HANGUL JUNGSEONG I-YU;Lo;0;L;;;;;N;;;;;
+D7C4;HANGUL JUNGSEONG I-I;Lo;0;L;;;;;N;;;;;
+D7C5;HANGUL JUNGSEONG ARAEA-A;Lo;0;L;;;;;N;;;;;
+D7C6;HANGUL JUNGSEONG ARAEA-E;Lo;0;L;;;;;N;;;;;
+D7CB;HANGUL JONGSEONG NIEUN-RIEUL;Lo;0;L;;;;;N;;;;;
+D7CC;HANGUL JONGSEONG NIEUN-CHIEUCH;Lo;0;L;;;;;N;;;;;
+D7CD;HANGUL JONGSEONG SSANGTIKEUT;Lo;0;L;;;;;N;;;;;
+D7CE;HANGUL JONGSEONG SSANGTIKEUT-PIEUP;Lo;0;L;;;;;N;;;;;
+D7CF;HANGUL JONGSEONG TIKEUT-PIEUP;Lo;0;L;;;;;N;;;;;
+D7D0;HANGUL JONGSEONG TIKEUT-SIOS;Lo;0;L;;;;;N;;;;;
+D7D1;HANGUL JONGSEONG TIKEUT-SIOS-KIYEOK;Lo;0;L;;;;;N;;;;;
+D7D2;HANGUL JONGSEONG TIKEUT-CIEUC;Lo;0;L;;;;;N;;;;;
+D7D3;HANGUL JONGSEONG TIKEUT-CHIEUCH;Lo;0;L;;;;;N;;;;;
+D7D4;HANGUL JONGSEONG TIKEUT-THIEUTH;Lo;0;L;;;;;N;;;;;
+D7D5;HANGUL JONGSEONG RIEUL-SSANGKIYEOK;Lo;0;L;;;;;N;;;;;
+D7D6;HANGUL JONGSEONG RIEUL-KIYEOK-HIEUH;Lo;0;L;;;;;N;;;;;
+D7D7;HANGUL JONGSEONG SSANGRIEUL-KHIEUKH;Lo;0;L;;;;;N;;;;;
+D7D8;HANGUL JONGSEONG RIEUL-MIEUM-HIEUH;Lo;0;L;;;;;N;;;;;
+D7D9;HANGUL JONGSEONG RIEUL-PIEUP-TIKEUT;Lo;0;L;;;;;N;;;;;
+D7DA;HANGUL JONGSEONG RIEUL-PIEUP-PHIEUPH;Lo;0;L;;;;;N;;;;;
+D7DB;HANGUL JONGSEONG RIEUL-YESIEUNG;Lo;0;L;;;;;N;;;;;
+D7DC;HANGUL JONGSEONG RIEUL-YEORINHIEUH-HIEUH;Lo;0;L;;;;;N;;;;;
+D7DD;HANGUL JONGSEONG KAPYEOUNRIEUL;Lo;0;L;;;;;N;;;;;
+D7DE;HANGUL JONGSEONG MIEUM-NIEUN;Lo;0;L;;;;;N;;;;;
+D7DF;HANGUL JONGSEONG MIEUM-SSANGNIEUN;Lo;0;L;;;;;N;;;;;
+D7E0;HANGUL JONGSEONG SSANGMIEUM;Lo;0;L;;;;;N;;;;;
+D7E1;HANGUL JONGSEONG MIEUM-PIEUP-SIOS;Lo;0;L;;;;;N;;;;;
+D7E2;HANGUL JONGSEONG MIEUM-CIEUC;Lo;0;L;;;;;N;;;;;
+D7E3;HANGUL JONGSEONG PIEUP-TIKEUT;Lo;0;L;;;;;N;;;;;
+D7E4;HANGUL JONGSEONG PIEUP-RIEUL-PHIEUPH;Lo;0;L;;;;;N;;;;;
+D7E5;HANGUL JONGSEONG PIEUP-MIEUM;Lo;0;L;;;;;N;;;;;
+D7E6;HANGUL JONGSEONG SSANGPIEUP;Lo;0;L;;;;;N;;;;;
+D7E7;HANGUL JONGSEONG PIEUP-SIOS-TIKEUT;Lo;0;L;;;;;N;;;;;
+D7E8;HANGUL JONGSEONG PIEUP-CIEUC;Lo;0;L;;;;;N;;;;;
+D7E9;HANGUL JONGSEONG PIEUP-CHIEUCH;Lo;0;L;;;;;N;;;;;
+D7EA;HANGUL JONGSEONG SIOS-MIEUM;Lo;0;L;;;;;N;;;;;
+D7EB;HANGUL JONGSEONG SIOS-KAPYEOUNPIEUP;Lo;0;L;;;;;N;;;;;
+D7EC;HANGUL JONGSEONG SSANGSIOS-KIYEOK;Lo;0;L;;;;;N;;;;;
+D7ED;HANGUL JONGSEONG SSANGSIOS-TIKEUT;Lo;0;L;;;;;N;;;;;
+D7EE;HANGUL JONGSEONG SIOS-PANSIOS;Lo;0;L;;;;;N;;;;;
+D7EF;HANGUL JONGSEONG SIOS-CIEUC;Lo;0;L;;;;;N;;;;;
+D7F0;HANGUL JONGSEONG SIOS-CHIEUCH;Lo;0;L;;;;;N;;;;;
+D7F1;HANGUL JONGSEONG SIOS-THIEUTH;Lo;0;L;;;;;N;;;;;
+D7F2;HANGUL JONGSEONG SIOS-HIEUH;Lo;0;L;;;;;N;;;;;
+D7F3;HANGUL JONGSEONG PANSIOS-PIEUP;Lo;0;L;;;;;N;;;;;
+D7F4;HANGUL JONGSEONG PANSIOS-KAPYEOUNPIEUP;Lo;0;L;;;;;N;;;;;
+D7F5;HANGUL JONGSEONG YESIEUNG-MIEUM;Lo;0;L;;;;;N;;;;;
+D7F6;HANGUL JONGSEONG YESIEUNG-HIEUH;Lo;0;L;;;;;N;;;;;
+D7F7;HANGUL JONGSEONG CIEUC-PIEUP;Lo;0;L;;;;;N;;;;;
+D7F8;HANGUL JONGSEONG CIEUC-SSANGPIEUP;Lo;0;L;;;;;N;;;;;
+D7F9;HANGUL JONGSEONG SSANGCIEUC;Lo;0;L;;;;;N;;;;;
+D7FA;HANGUL JONGSEONG PHIEUPH-SIOS;Lo;0;L;;;;;N;;;;;
+D7FB;HANGUL JONGSEONG PHIEUPH-THIEUTH;Lo;0;L;;;;;N;;;;;
+D800;<Non Private Use High Surrogate, First>;Cs;0;L;;;;;N;;;;;
+DB7F;<Non Private Use High Surrogate, Last>;Cs;0;L;;;;;N;;;;;
+DB80;<Private Use High Surrogate, First>;Cs;0;L;;;;;N;;;;;
+DBFF;<Private Use High Surrogate, Last>;Cs;0;L;;;;;N;;;;;
+DC00;<Low Surrogate, First>;Cs;0;L;;;;;N;;;;;
+DFFF;<Low Surrogate, Last>;Cs;0;L;;;;;N;;;;;
+E000;<Private Use, First>;Co;0;L;;;;;N;;;;;
+F8FF;<Private Use, Last>;Co;0;L;;;;;N;;;;;
+F900;CJK COMPATIBILITY IDEOGRAPH-F900;Lo;0;L;8C48;;;;N;;;;;
+F901;CJK COMPATIBILITY IDEOGRAPH-F901;Lo;0;L;66F4;;;;N;;;;;
+F902;CJK COMPATIBILITY IDEOGRAPH-F902;Lo;0;L;8ECA;;;;N;;;;;
+F903;CJK COMPATIBILITY IDEOGRAPH-F903;Lo;0;L;8CC8;;;;N;;;;;
+F904;CJK COMPATIBILITY IDEOGRAPH-F904;Lo;0;L;6ED1;;;;N;;;;;
+F905;CJK COMPATIBILITY IDEOGRAPH-F905;Lo;0;L;4E32;;;;N;;;;;
+F906;CJK COMPATIBILITY IDEOGRAPH-F906;Lo;0;L;53E5;;;;N;;;;;
+F907;CJK COMPATIBILITY IDEOGRAPH-F907;Lo;0;L;9F9C;;;;N;;;;;
+F908;CJK COMPATIBILITY IDEOGRAPH-F908;Lo;0;L;9F9C;;;;N;;;;;
+F909;CJK COMPATIBILITY IDEOGRAPH-F909;Lo;0;L;5951;;;;N;;;;;
+F90A;CJK COMPATIBILITY IDEOGRAPH-F90A;Lo;0;L;91D1;;;;N;;;;;
+F90B;CJK COMPATIBILITY IDEOGRAPH-F90B;Lo;0;L;5587;;;;N;;;;;
+F90C;CJK COMPATIBILITY IDEOGRAPH-F90C;Lo;0;L;5948;;;;N;;;;;
+F90D;CJK COMPATIBILITY IDEOGRAPH-F90D;Lo;0;L;61F6;;;;N;;;;;
+F90E;CJK COMPATIBILITY IDEOGRAPH-F90E;Lo;0;L;7669;;;;N;;;;;
+F90F;CJK COMPATIBILITY IDEOGRAPH-F90F;Lo;0;L;7F85;;;;N;;;;;
+F910;CJK COMPATIBILITY IDEOGRAPH-F910;Lo;0;L;863F;;;;N;;;;;
+F911;CJK COMPATIBILITY IDEOGRAPH-F911;Lo;0;L;87BA;;;;N;;;;;
+F912;CJK COMPATIBILITY IDEOGRAPH-F912;Lo;0;L;88F8;;;;N;;;;;
+F913;CJK COMPATIBILITY IDEOGRAPH-F913;Lo;0;L;908F;;;;N;;;;;
+F914;CJK COMPATIBILITY IDEOGRAPH-F914;Lo;0;L;6A02;;;;N;;;;;
+F915;CJK COMPATIBILITY IDEOGRAPH-F915;Lo;0;L;6D1B;;;;N;;;;;
+F916;CJK COMPATIBILITY IDEOGRAPH-F916;Lo;0;L;70D9;;;;N;;;;;
+F917;CJK COMPATIBILITY IDEOGRAPH-F917;Lo;0;L;73DE;;;;N;;;;;
+F918;CJK COMPATIBILITY IDEOGRAPH-F918;Lo;0;L;843D;;;;N;;;;;
+F919;CJK COMPATIBILITY IDEOGRAPH-F919;Lo;0;L;916A;;;;N;;;;;
+F91A;CJK COMPATIBILITY IDEOGRAPH-F91A;Lo;0;L;99F1;;;;N;;;;;
+F91B;CJK COMPATIBILITY IDEOGRAPH-F91B;Lo;0;L;4E82;;;;N;;;;;
+F91C;CJK COMPATIBILITY IDEOGRAPH-F91C;Lo;0;L;5375;;;;N;;;;;
+F91D;CJK COMPATIBILITY IDEOGRAPH-F91D;Lo;0;L;6B04;;;;N;;;;;
+F91E;CJK COMPATIBILITY IDEOGRAPH-F91E;Lo;0;L;721B;;;;N;;;;;
+F91F;CJK COMPATIBILITY IDEOGRAPH-F91F;Lo;0;L;862D;;;;N;;;;;
+F920;CJK COMPATIBILITY IDEOGRAPH-F920;Lo;0;L;9E1E;;;;N;;;;;
+F921;CJK COMPATIBILITY IDEOGRAPH-F921;Lo;0;L;5D50;;;;N;;;;;
+F922;CJK COMPATIBILITY IDEOGRAPH-F922;Lo;0;L;6FEB;;;;N;;;;;
+F923;CJK COMPATIBILITY IDEOGRAPH-F923;Lo;0;L;85CD;;;;N;;;;;
+F924;CJK COMPATIBILITY IDEOGRAPH-F924;Lo;0;L;8964;;;;N;;;;;
+F925;CJK COMPATIBILITY IDEOGRAPH-F925;Lo;0;L;62C9;;;;N;;;;;
+F926;CJK COMPATIBILITY IDEOGRAPH-F926;Lo;0;L;81D8;;;;N;;;;;
+F927;CJK COMPATIBILITY IDEOGRAPH-F927;Lo;0;L;881F;;;;N;;;;;
+F928;CJK COMPATIBILITY IDEOGRAPH-F928;Lo;0;L;5ECA;;;;N;;;;;
+F929;CJK COMPATIBILITY IDEOGRAPH-F929;Lo;0;L;6717;;;;N;;;;;
+F92A;CJK COMPATIBILITY IDEOGRAPH-F92A;Lo;0;L;6D6A;;;;N;;;;;
+F92B;CJK COMPATIBILITY IDEOGRAPH-F92B;Lo;0;L;72FC;;;;N;;;;;
+F92C;CJK COMPATIBILITY IDEOGRAPH-F92C;Lo;0;L;90CE;;;;N;;;;;
+F92D;CJK COMPATIBILITY IDEOGRAPH-F92D;Lo;0;L;4F86;;;;N;;;;;
+F92E;CJK COMPATIBILITY IDEOGRAPH-F92E;Lo;0;L;51B7;;;;N;;;;;
+F92F;CJK COMPATIBILITY IDEOGRAPH-F92F;Lo;0;L;52DE;;;;N;;;;;
+F930;CJK COMPATIBILITY IDEOGRAPH-F930;Lo;0;L;64C4;;;;N;;;;;
+F931;CJK COMPATIBILITY IDEOGRAPH-F931;Lo;0;L;6AD3;;;;N;;;;;
+F932;CJK COMPATIBILITY IDEOGRAPH-F932;Lo;0;L;7210;;;;N;;;;;
+F933;CJK COMPATIBILITY IDEOGRAPH-F933;Lo;0;L;76E7;;;;N;;;;;
+F934;CJK COMPATIBILITY IDEOGRAPH-F934;Lo;0;L;8001;;;;N;;;;;
+F935;CJK COMPATIBILITY IDEOGRAPH-F935;Lo;0;L;8606;;;;N;;;;;
+F936;CJK COMPATIBILITY IDEOGRAPH-F936;Lo;0;L;865C;;;;N;;;;;
+F937;CJK COMPATIBILITY IDEOGRAPH-F937;Lo;0;L;8DEF;;;;N;;;;;
+F938;CJK COMPATIBILITY IDEOGRAPH-F938;Lo;0;L;9732;;;;N;;;;;
+F939;CJK COMPATIBILITY IDEOGRAPH-F939;Lo;0;L;9B6F;;;;N;;;;;
+F93A;CJK COMPATIBILITY IDEOGRAPH-F93A;Lo;0;L;9DFA;;;;N;;;;;
+F93B;CJK COMPATIBILITY IDEOGRAPH-F93B;Lo;0;L;788C;;;;N;;;;;
+F93C;CJK COMPATIBILITY IDEOGRAPH-F93C;Lo;0;L;797F;;;;N;;;;;
+F93D;CJK COMPATIBILITY IDEOGRAPH-F93D;Lo;0;L;7DA0;;;;N;;;;;
+F93E;CJK COMPATIBILITY IDEOGRAPH-F93E;Lo;0;L;83C9;;;;N;;;;;
+F93F;CJK COMPATIBILITY IDEOGRAPH-F93F;Lo;0;L;9304;;;;N;;;;;
+F940;CJK COMPATIBILITY IDEOGRAPH-F940;Lo;0;L;9E7F;;;;N;;;;;
+F941;CJK COMPATIBILITY IDEOGRAPH-F941;Lo;0;L;8AD6;;;;N;;;;;
+F942;CJK COMPATIBILITY IDEOGRAPH-F942;Lo;0;L;58DF;;;;N;;;;;
+F943;CJK COMPATIBILITY IDEOGRAPH-F943;Lo;0;L;5F04;;;;N;;;;;
+F944;CJK COMPATIBILITY IDEOGRAPH-F944;Lo;0;L;7C60;;;;N;;;;;
+F945;CJK COMPATIBILITY IDEOGRAPH-F945;Lo;0;L;807E;;;;N;;;;;
+F946;CJK COMPATIBILITY IDEOGRAPH-F946;Lo;0;L;7262;;;;N;;;;;
+F947;CJK COMPATIBILITY IDEOGRAPH-F947;Lo;0;L;78CA;;;;N;;;;;
+F948;CJK COMPATIBILITY IDEOGRAPH-F948;Lo;0;L;8CC2;;;;N;;;;;
+F949;CJK COMPATIBILITY IDEOGRAPH-F949;Lo;0;L;96F7;;;;N;;;;;
+F94A;CJK COMPATIBILITY IDEOGRAPH-F94A;Lo;0;L;58D8;;;;N;;;;;
+F94B;CJK COMPATIBILITY IDEOGRAPH-F94B;Lo;0;L;5C62;;;;N;;;;;
+F94C;CJK COMPATIBILITY IDEOGRAPH-F94C;Lo;0;L;6A13;;;;N;;;;;
+F94D;CJK COMPATIBILITY IDEOGRAPH-F94D;Lo;0;L;6DDA;;;;N;;;;;
+F94E;CJK COMPATIBILITY IDEOGRAPH-F94E;Lo;0;L;6F0F;;;;N;;;;;
+F94F;CJK COMPATIBILITY IDEOGRAPH-F94F;Lo;0;L;7D2F;;;;N;;;;;
+F950;CJK COMPATIBILITY IDEOGRAPH-F950;Lo;0;L;7E37;;;;N;;;;;
+F951;CJK COMPATIBILITY IDEOGRAPH-F951;Lo;0;L;964B;;;;N;;;;;
+F952;CJK COMPATIBILITY IDEOGRAPH-F952;Lo;0;L;52D2;;;;N;;;;;
+F953;CJK COMPATIBILITY IDEOGRAPH-F953;Lo;0;L;808B;;;;N;;;;;
+F954;CJK COMPATIBILITY IDEOGRAPH-F954;Lo;0;L;51DC;;;;N;;;;;
+F955;CJK COMPATIBILITY IDEOGRAPH-F955;Lo;0;L;51CC;;;;N;;;;;
+F956;CJK COMPATIBILITY IDEOGRAPH-F956;Lo;0;L;7A1C;;;;N;;;;;
+F957;CJK COMPATIBILITY IDEOGRAPH-F957;Lo;0;L;7DBE;;;;N;;;;;
+F958;CJK COMPATIBILITY IDEOGRAPH-F958;Lo;0;L;83F1;;;;N;;;;;
+F959;CJK COMPATIBILITY IDEOGRAPH-F959;Lo;0;L;9675;;;;N;;;;;
+F95A;CJK COMPATIBILITY IDEOGRAPH-F95A;Lo;0;L;8B80;;;;N;;;;;
+F95B;CJK COMPATIBILITY IDEOGRAPH-F95B;Lo;0;L;62CF;;;;N;;;;;
+F95C;CJK COMPATIBILITY IDEOGRAPH-F95C;Lo;0;L;6A02;;;;N;;;;;
+F95D;CJK COMPATIBILITY IDEOGRAPH-F95D;Lo;0;L;8AFE;;;;N;;;;;
+F95E;CJK COMPATIBILITY IDEOGRAPH-F95E;Lo;0;L;4E39;;;;N;;;;;
+F95F;CJK COMPATIBILITY IDEOGRAPH-F95F;Lo;0;L;5BE7;;;;N;;;;;
+F960;CJK COMPATIBILITY IDEOGRAPH-F960;Lo;0;L;6012;;;;N;;;;;
+F961;CJK COMPATIBILITY IDEOGRAPH-F961;Lo;0;L;7387;;;;N;;;;;
+F962;CJK COMPATIBILITY IDEOGRAPH-F962;Lo;0;L;7570;;;;N;;;;;
+F963;CJK COMPATIBILITY IDEOGRAPH-F963;Lo;0;L;5317;;;;N;;;;;
+F964;CJK COMPATIBILITY IDEOGRAPH-F964;Lo;0;L;78FB;;;;N;;;;;
+F965;CJK COMPATIBILITY IDEOGRAPH-F965;Lo;0;L;4FBF;;;;N;;;;;
+F966;CJK COMPATIBILITY IDEOGRAPH-F966;Lo;0;L;5FA9;;;;N;;;;;
+F967;CJK COMPATIBILITY IDEOGRAPH-F967;Lo;0;L;4E0D;;;;N;;;;;
+F968;CJK COMPATIBILITY IDEOGRAPH-F968;Lo;0;L;6CCC;;;;N;;;;;
+F969;CJK COMPATIBILITY IDEOGRAPH-F969;Lo;0;L;6578;;;;N;;;;;
+F96A;CJK COMPATIBILITY IDEOGRAPH-F96A;Lo;0;L;7D22;;;;N;;;;;
+F96B;CJK COMPATIBILITY IDEOGRAPH-F96B;Lo;0;L;53C3;;;3;N;;;;;
+F96C;CJK COMPATIBILITY IDEOGRAPH-F96C;Lo;0;L;585E;;;;N;;;;;
+F96D;CJK COMPATIBILITY IDEOGRAPH-F96D;Lo;0;L;7701;;;;N;;;;;
+F96E;CJK COMPATIBILITY IDEOGRAPH-F96E;Lo;0;L;8449;;;;N;;;;;
+F96F;CJK COMPATIBILITY IDEOGRAPH-F96F;Lo;0;L;8AAA;;;;N;;;;;
+F970;CJK COMPATIBILITY IDEOGRAPH-F970;Lo;0;L;6BBA;;;;N;;;;;
+F971;CJK COMPATIBILITY IDEOGRAPH-F971;Lo;0;L;8FB0;;;;N;;;;;
+F972;CJK COMPATIBILITY IDEOGRAPH-F972;Lo;0;L;6C88;;;;N;;;;;
+F973;CJK COMPATIBILITY IDEOGRAPH-F973;Lo;0;L;62FE;;;10;N;;;;;
+F974;CJK COMPATIBILITY IDEOGRAPH-F974;Lo;0;L;82E5;;;;N;;;;;
+F975;CJK COMPATIBILITY IDEOGRAPH-F975;Lo;0;L;63A0;;;;N;;;;;
+F976;CJK COMPATIBILITY IDEOGRAPH-F976;Lo;0;L;7565;;;;N;;;;;
+F977;CJK COMPATIBILITY IDEOGRAPH-F977;Lo;0;L;4EAE;;;;N;;;;;
+F978;CJK COMPATIBILITY IDEOGRAPH-F978;Lo;0;L;5169;;;2;N;;;;;
+F979;CJK COMPATIBILITY IDEOGRAPH-F979;Lo;0;L;51C9;;;;N;;;;;
+F97A;CJK COMPATIBILITY IDEOGRAPH-F97A;Lo;0;L;6881;;;;N;;;;;
+F97B;CJK COMPATIBILITY IDEOGRAPH-F97B;Lo;0;L;7CE7;;;;N;;;;;
+F97C;CJK COMPATIBILITY IDEOGRAPH-F97C;Lo;0;L;826F;;;;N;;;;;
+F97D;CJK COMPATIBILITY IDEOGRAPH-F97D;Lo;0;L;8AD2;;;;N;;;;;
+F97E;CJK COMPATIBILITY IDEOGRAPH-F97E;Lo;0;L;91CF;;;;N;;;;;
+F97F;CJK COMPATIBILITY IDEOGRAPH-F97F;Lo;0;L;52F5;;;;N;;;;;
+F980;CJK COMPATIBILITY IDEOGRAPH-F980;Lo;0;L;5442;;;;N;;;;;
+F981;CJK COMPATIBILITY IDEOGRAPH-F981;Lo;0;L;5973;;;;N;;;;;
+F982;CJK COMPATIBILITY IDEOGRAPH-F982;Lo;0;L;5EEC;;;;N;;;;;
+F983;CJK COMPATIBILITY IDEOGRAPH-F983;Lo;0;L;65C5;;;;N;;;;;
+F984;CJK COMPATIBILITY IDEOGRAPH-F984;Lo;0;L;6FFE;;;;N;;;;;
+F985;CJK COMPATIBILITY IDEOGRAPH-F985;Lo;0;L;792A;;;;N;;;;;
+F986;CJK COMPATIBILITY IDEOGRAPH-F986;Lo;0;L;95AD;;;;N;;;;;
+F987;CJK COMPATIBILITY IDEOGRAPH-F987;Lo;0;L;9A6A;;;;N;;;;;
+F988;CJK COMPATIBILITY IDEOGRAPH-F988;Lo;0;L;9E97;;;;N;;;;;
+F989;CJK COMPATIBILITY IDEOGRAPH-F989;Lo;0;L;9ECE;;;;N;;;;;
+F98A;CJK COMPATIBILITY IDEOGRAPH-F98A;Lo;0;L;529B;;;;N;;;;;
+F98B;CJK COMPATIBILITY IDEOGRAPH-F98B;Lo;0;L;66C6;;;;N;;;;;
+F98C;CJK COMPATIBILITY IDEOGRAPH-F98C;Lo;0;L;6B77;;;;N;;;;;
+F98D;CJK COMPATIBILITY IDEOGRAPH-F98D;Lo;0;L;8F62;;;;N;;;;;
+F98E;CJK COMPATIBILITY IDEOGRAPH-F98E;Lo;0;L;5E74;;;;N;;;;;
+F98F;CJK COMPATIBILITY IDEOGRAPH-F98F;Lo;0;L;6190;;;;N;;;;;
+F990;CJK COMPATIBILITY IDEOGRAPH-F990;Lo;0;L;6200;;;;N;;;;;
+F991;CJK COMPATIBILITY IDEOGRAPH-F991;Lo;0;L;649A;;;;N;;;;;
+F992;CJK COMPATIBILITY IDEOGRAPH-F992;Lo;0;L;6F23;;;;N;;;;;
+F993;CJK COMPATIBILITY IDEOGRAPH-F993;Lo;0;L;7149;;;;N;;;;;
+F994;CJK COMPATIBILITY IDEOGRAPH-F994;Lo;0;L;7489;;;;N;;;;;
+F995;CJK COMPATIBILITY IDEOGRAPH-F995;Lo;0;L;79CA;;;;N;;;;;
+F996;CJK COMPATIBILITY IDEOGRAPH-F996;Lo;0;L;7DF4;;;;N;;;;;
+F997;CJK COMPATIBILITY IDEOGRAPH-F997;Lo;0;L;806F;;;;N;;;;;
+F998;CJK COMPATIBILITY IDEOGRAPH-F998;Lo;0;L;8F26;;;;N;;;;;
+F999;CJK COMPATIBILITY IDEOGRAPH-F999;Lo;0;L;84EE;;;;N;;;;;
+F99A;CJK COMPATIBILITY IDEOGRAPH-F99A;Lo;0;L;9023;;;;N;;;;;
+F99B;CJK COMPATIBILITY IDEOGRAPH-F99B;Lo;0;L;934A;;;;N;;;;;
+F99C;CJK COMPATIBILITY IDEOGRAPH-F99C;Lo;0;L;5217;;;;N;;;;;
+F99D;CJK COMPATIBILITY IDEOGRAPH-F99D;Lo;0;L;52A3;;;;N;;;;;
+F99E;CJK COMPATIBILITY IDEOGRAPH-F99E;Lo;0;L;54BD;;;;N;;;;;
+F99F;CJK COMPATIBILITY IDEOGRAPH-F99F;Lo;0;L;70C8;;;;N;;;;;
+F9A0;CJK COMPATIBILITY IDEOGRAPH-F9A0;Lo;0;L;88C2;;;;N;;;;;
+F9A1;CJK COMPATIBILITY IDEOGRAPH-F9A1;Lo;0;L;8AAA;;;;N;;;;;
+F9A2;CJK COMPATIBILITY IDEOGRAPH-F9A2;Lo;0;L;5EC9;;;;N;;;;;
+F9A3;CJK COMPATIBILITY IDEOGRAPH-F9A3;Lo;0;L;5FF5;;;;N;;;;;
+F9A4;CJK COMPATIBILITY IDEOGRAPH-F9A4;Lo;0;L;637B;;;;N;;;;;
+F9A5;CJK COMPATIBILITY IDEOGRAPH-F9A5;Lo;0;L;6BAE;;;;N;;;;;
+F9A6;CJK COMPATIBILITY IDEOGRAPH-F9A6;Lo;0;L;7C3E;;;;N;;;;;
+F9A7;CJK COMPATIBILITY IDEOGRAPH-F9A7;Lo;0;L;7375;;;;N;;;;;
+F9A8;CJK COMPATIBILITY IDEOGRAPH-F9A8;Lo;0;L;4EE4;;;;N;;;;;
+F9A9;CJK COMPATIBILITY IDEOGRAPH-F9A9;Lo;0;L;56F9;;;;N;;;;;
+F9AA;CJK COMPATIBILITY IDEOGRAPH-F9AA;Lo;0;L;5BE7;;;;N;;;;;
+F9AB;CJK COMPATIBILITY IDEOGRAPH-F9AB;Lo;0;L;5DBA;;;;N;;;;;
+F9AC;CJK COMPATIBILITY IDEOGRAPH-F9AC;Lo;0;L;601C;;;;N;;;;;
+F9AD;CJK COMPATIBILITY IDEOGRAPH-F9AD;Lo;0;L;73B2;;;;N;;;;;
+F9AE;CJK COMPATIBILITY IDEOGRAPH-F9AE;Lo;0;L;7469;;;;N;;;;;
+F9AF;CJK COMPATIBILITY IDEOGRAPH-F9AF;Lo;0;L;7F9A;;;;N;;;;;
+F9B0;CJK COMPATIBILITY IDEOGRAPH-F9B0;Lo;0;L;8046;;;;N;;;;;
+F9B1;CJK COMPATIBILITY IDEOGRAPH-F9B1;Lo;0;L;9234;;;;N;;;;;
+F9B2;CJK COMPATIBILITY IDEOGRAPH-F9B2;Lo;0;L;96F6;;;0;N;;;;;
+F9B3;CJK COMPATIBILITY IDEOGRAPH-F9B3;Lo;0;L;9748;;;;N;;;;;
+F9B4;CJK COMPATIBILITY IDEOGRAPH-F9B4;Lo;0;L;9818;;;;N;;;;;
+F9B5;CJK COMPATIBILITY IDEOGRAPH-F9B5;Lo;0;L;4F8B;;;;N;;;;;
+F9B6;CJK COMPATIBILITY IDEOGRAPH-F9B6;Lo;0;L;79AE;;;;N;;;;;
+F9B7;CJK COMPATIBILITY IDEOGRAPH-F9B7;Lo;0;L;91B4;;;;N;;;;;
+F9B8;CJK COMPATIBILITY IDEOGRAPH-F9B8;Lo;0;L;96B8;;;;N;;;;;
+F9B9;CJK COMPATIBILITY IDEOGRAPH-F9B9;Lo;0;L;60E1;;;;N;;;;;
+F9BA;CJK COMPATIBILITY IDEOGRAPH-F9BA;Lo;0;L;4E86;;;;N;;;;;
+F9BB;CJK COMPATIBILITY IDEOGRAPH-F9BB;Lo;0;L;50DA;;;;N;;;;;
+F9BC;CJK COMPATIBILITY IDEOGRAPH-F9BC;Lo;0;L;5BEE;;;;N;;;;;
+F9BD;CJK COMPATIBILITY IDEOGRAPH-F9BD;Lo;0;L;5C3F;;;;N;;;;;
+F9BE;CJK COMPATIBILITY IDEOGRAPH-F9BE;Lo;0;L;6599;;;;N;;;;;
+F9BF;CJK COMPATIBILITY IDEOGRAPH-F9BF;Lo;0;L;6A02;;;;N;;;;;
+F9C0;CJK COMPATIBILITY IDEOGRAPH-F9C0;Lo;0;L;71CE;;;;N;;;;;
+F9C1;CJK COMPATIBILITY IDEOGRAPH-F9C1;Lo;0;L;7642;;;;N;;;;;
+F9C2;CJK COMPATIBILITY IDEOGRAPH-F9C2;Lo;0;L;84FC;;;;N;;;;;
+F9C3;CJK COMPATIBILITY IDEOGRAPH-F9C3;Lo;0;L;907C;;;;N;;;;;
+F9C4;CJK COMPATIBILITY IDEOGRAPH-F9C4;Lo;0;L;9F8D;;;;N;;;;;
+F9C5;CJK COMPATIBILITY IDEOGRAPH-F9C5;Lo;0;L;6688;;;;N;;;;;
+F9C6;CJK COMPATIBILITY IDEOGRAPH-F9C6;Lo;0;L;962E;;;;N;;;;;
+F9C7;CJK COMPATIBILITY IDEOGRAPH-F9C7;Lo;0;L;5289;;;;N;;;;;
+F9C8;CJK COMPATIBILITY IDEOGRAPH-F9C8;Lo;0;L;677B;;;;N;;;;;
+F9C9;CJK COMPATIBILITY IDEOGRAPH-F9C9;Lo;0;L;67F3;;;;N;;;;;
+F9CA;CJK COMPATIBILITY IDEOGRAPH-F9CA;Lo;0;L;6D41;;;;N;;;;;
+F9CB;CJK COMPATIBILITY IDEOGRAPH-F9CB;Lo;0;L;6E9C;;;;N;;;;;
+F9CC;CJK COMPATIBILITY IDEOGRAPH-F9CC;Lo;0;L;7409;;;;N;;;;;
+F9CD;CJK COMPATIBILITY IDEOGRAPH-F9CD;Lo;0;L;7559;;;;N;;;;;
+F9CE;CJK COMPATIBILITY IDEOGRAPH-F9CE;Lo;0;L;786B;;;;N;;;;;
+F9CF;CJK COMPATIBILITY IDEOGRAPH-F9CF;Lo;0;L;7D10;;;;N;;;;;
+F9D0;CJK COMPATIBILITY IDEOGRAPH-F9D0;Lo;0;L;985E;;;;N;;;;;
+F9D1;CJK COMPATIBILITY IDEOGRAPH-F9D1;Lo;0;L;516D;;;6;N;;;;;
+F9D2;CJK COMPATIBILITY IDEOGRAPH-F9D2;Lo;0;L;622E;;;;N;;;;;
+F9D3;CJK COMPATIBILITY IDEOGRAPH-F9D3;Lo;0;L;9678;;;6;N;;;;;
+F9D4;CJK COMPATIBILITY IDEOGRAPH-F9D4;Lo;0;L;502B;;;;N;;;;;
+F9D5;CJK COMPATIBILITY IDEOGRAPH-F9D5;Lo;0;L;5D19;;;;N;;;;;
+F9D6;CJK COMPATIBILITY IDEOGRAPH-F9D6;Lo;0;L;6DEA;;;;N;;;;;
+F9D7;CJK COMPATIBILITY IDEOGRAPH-F9D7;Lo;0;L;8F2A;;;;N;;;;;
+F9D8;CJK COMPATIBILITY IDEOGRAPH-F9D8;Lo;0;L;5F8B;;;;N;;;;;
+F9D9;CJK COMPATIBILITY IDEOGRAPH-F9D9;Lo;0;L;6144;;;;N;;;;;
+F9DA;CJK COMPATIBILITY IDEOGRAPH-F9DA;Lo;0;L;6817;;;;N;;;;;
+F9DB;CJK COMPATIBILITY IDEOGRAPH-F9DB;Lo;0;L;7387;;;;N;;;;;
+F9DC;CJK COMPATIBILITY IDEOGRAPH-F9DC;Lo;0;L;9686;;;;N;;;;;
+F9DD;CJK COMPATIBILITY IDEOGRAPH-F9DD;Lo;0;L;5229;;;;N;;;;;
+F9DE;CJK COMPATIBILITY IDEOGRAPH-F9DE;Lo;0;L;540F;;;;N;;;;;
+F9DF;CJK COMPATIBILITY IDEOGRAPH-F9DF;Lo;0;L;5C65;;;;N;;;;;
+F9E0;CJK COMPATIBILITY IDEOGRAPH-F9E0;Lo;0;L;6613;;;;N;;;;;
+F9E1;CJK COMPATIBILITY IDEOGRAPH-F9E1;Lo;0;L;674E;;;;N;;;;;
+F9E2;CJK COMPATIBILITY IDEOGRAPH-F9E2;Lo;0;L;68A8;;;;N;;;;;
+F9E3;CJK COMPATIBILITY IDEOGRAPH-F9E3;Lo;0;L;6CE5;;;;N;;;;;
+F9E4;CJK COMPATIBILITY IDEOGRAPH-F9E4;Lo;0;L;7406;;;;N;;;;;
+F9E5;CJK COMPATIBILITY IDEOGRAPH-F9E5;Lo;0;L;75E2;;;;N;;;;;
+F9E6;CJK COMPATIBILITY IDEOGRAPH-F9E6;Lo;0;L;7F79;;;;N;;;;;
+F9E7;CJK COMPATIBILITY IDEOGRAPH-F9E7;Lo;0;L;88CF;;;;N;;;;;
+F9E8;CJK COMPATIBILITY IDEOGRAPH-F9E8;Lo;0;L;88E1;;;;N;;;;;
+F9E9;CJK COMPATIBILITY IDEOGRAPH-F9E9;Lo;0;L;91CC;;;;N;;;;;
+F9EA;CJK COMPATIBILITY IDEOGRAPH-F9EA;Lo;0;L;96E2;;;;N;;;;;
+F9EB;CJK COMPATIBILITY IDEOGRAPH-F9EB;Lo;0;L;533F;;;;N;;;;;
+F9EC;CJK COMPATIBILITY IDEOGRAPH-F9EC;Lo;0;L;6EBA;;;;N;;;;;
+F9ED;CJK COMPATIBILITY IDEOGRAPH-F9ED;Lo;0;L;541D;;;;N;;;;;
+F9EE;CJK COMPATIBILITY IDEOGRAPH-F9EE;Lo;0;L;71D0;;;;N;;;;;
+F9EF;CJK COMPATIBILITY IDEOGRAPH-F9EF;Lo;0;L;7498;;;;N;;;;;
+F9F0;CJK COMPATIBILITY IDEOGRAPH-F9F0;Lo;0;L;85FA;;;;N;;;;;
+F9F1;CJK COMPATIBILITY IDEOGRAPH-F9F1;Lo;0;L;96A3;;;;N;;;;;
+F9F2;CJK COMPATIBILITY IDEOGRAPH-F9F2;Lo;0;L;9C57;;;;N;;;;;
+F9F3;CJK COMPATIBILITY IDEOGRAPH-F9F3;Lo;0;L;9E9F;;;;N;;;;;
+F9F4;CJK COMPATIBILITY IDEOGRAPH-F9F4;Lo;0;L;6797;;;;N;;;;;
+F9F5;CJK COMPATIBILITY IDEOGRAPH-F9F5;Lo;0;L;6DCB;;;;N;;;;;
+F9F6;CJK COMPATIBILITY IDEOGRAPH-F9F6;Lo;0;L;81E8;;;;N;;;;;
+F9F7;CJK COMPATIBILITY IDEOGRAPH-F9F7;Lo;0;L;7ACB;;;;N;;;;;
+F9F8;CJK COMPATIBILITY IDEOGRAPH-F9F8;Lo;0;L;7B20;;;;N;;;;;
+F9F9;CJK COMPATIBILITY IDEOGRAPH-F9F9;Lo;0;L;7C92;;;;N;;;;;
+F9FA;CJK COMPATIBILITY IDEOGRAPH-F9FA;Lo;0;L;72C0;;;;N;;;;;
+F9FB;CJK COMPATIBILITY IDEOGRAPH-F9FB;Lo;0;L;7099;;;;N;;;;;
+F9FC;CJK COMPATIBILITY IDEOGRAPH-F9FC;Lo;0;L;8B58;;;;N;;;;;
+F9FD;CJK COMPATIBILITY IDEOGRAPH-F9FD;Lo;0;L;4EC0;;;10;N;;;;;
+F9FE;CJK COMPATIBILITY IDEOGRAPH-F9FE;Lo;0;L;8336;;;;N;;;;;
+F9FF;CJK COMPATIBILITY IDEOGRAPH-F9FF;Lo;0;L;523A;;;;N;;;;;
+FA00;CJK COMPATIBILITY IDEOGRAPH-FA00;Lo;0;L;5207;;;;N;;;;;
+FA01;CJK COMPATIBILITY IDEOGRAPH-FA01;Lo;0;L;5EA6;;;;N;;;;;
+FA02;CJK COMPATIBILITY IDEOGRAPH-FA02;Lo;0;L;62D3;;;;N;;;;;
+FA03;CJK COMPATIBILITY IDEOGRAPH-FA03;Lo;0;L;7CD6;;;;N;;;;;
+FA04;CJK COMPATIBILITY IDEOGRAPH-FA04;Lo;0;L;5B85;;;;N;;;;;
+FA05;CJK COMPATIBILITY IDEOGRAPH-FA05;Lo;0;L;6D1E;;;;N;;;;;
+FA06;CJK COMPATIBILITY IDEOGRAPH-FA06;Lo;0;L;66B4;;;;N;;;;;
+FA07;CJK COMPATIBILITY IDEOGRAPH-FA07;Lo;0;L;8F3B;;;;N;;;;;
+FA08;CJK COMPATIBILITY IDEOGRAPH-FA08;Lo;0;L;884C;;;;N;;;;;
+FA09;CJK COMPATIBILITY IDEOGRAPH-FA09;Lo;0;L;964D;;;;N;;;;;
+FA0A;CJK COMPATIBILITY IDEOGRAPH-FA0A;Lo;0;L;898B;;;;N;;;;;
+FA0B;CJK COMPATIBILITY IDEOGRAPH-FA0B;Lo;0;L;5ED3;;;;N;;;;;
+FA0C;CJK COMPATIBILITY IDEOGRAPH-FA0C;Lo;0;L;5140;;;;N;;;;;
+FA0D;CJK COMPATIBILITY IDEOGRAPH-FA0D;Lo;0;L;55C0;;;;N;;;;;
+FA0E;CJK COMPATIBILITY IDEOGRAPH-FA0E;Lo;0;L;;;;;N;;;;;
+FA0F;CJK COMPATIBILITY IDEOGRAPH-FA0F;Lo;0;L;;;;;N;;;;;
+FA10;CJK COMPATIBILITY IDEOGRAPH-FA10;Lo;0;L;585A;;;;N;;;;;
+FA11;CJK COMPATIBILITY IDEOGRAPH-FA11;Lo;0;L;;;;;N;;;;;
+FA12;CJK COMPATIBILITY IDEOGRAPH-FA12;Lo;0;L;6674;;;;N;;;;;
+FA13;CJK COMPATIBILITY IDEOGRAPH-FA13;Lo;0;L;;;;;N;;;;;
+FA14;CJK COMPATIBILITY IDEOGRAPH-FA14;Lo;0;L;;;;;N;;;;;
+FA15;CJK COMPATIBILITY IDEOGRAPH-FA15;Lo;0;L;51DE;;;;N;;;;;
+FA16;CJK COMPATIBILITY IDEOGRAPH-FA16;Lo;0;L;732A;;;;N;;;;;
+FA17;CJK COMPATIBILITY IDEOGRAPH-FA17;Lo;0;L;76CA;;;;N;;;;;
+FA18;CJK COMPATIBILITY IDEOGRAPH-FA18;Lo;0;L;793C;;;;N;;;;;
+FA19;CJK COMPATIBILITY IDEOGRAPH-FA19;Lo;0;L;795E;;;;N;;;;;
+FA1A;CJK COMPATIBILITY IDEOGRAPH-FA1A;Lo;0;L;7965;;;;N;;;;;
+FA1B;CJK COMPATIBILITY IDEOGRAPH-FA1B;Lo;0;L;798F;;;;N;;;;;
+FA1C;CJK COMPATIBILITY IDEOGRAPH-FA1C;Lo;0;L;9756;;;;N;;;;;
+FA1D;CJK COMPATIBILITY IDEOGRAPH-FA1D;Lo;0;L;7CBE;;;;N;;;;;
+FA1E;CJK COMPATIBILITY IDEOGRAPH-FA1E;Lo;0;L;7FBD;;;;N;;;;;
+FA1F;CJK COMPATIBILITY IDEOGRAPH-FA1F;Lo;0;L;;;;;N;;;;;
+FA20;CJK COMPATIBILITY IDEOGRAPH-FA20;Lo;0;L;8612;;;;N;;;;;
+FA21;CJK COMPATIBILITY IDEOGRAPH-FA21;Lo;0;L;;;;;N;;;;;
+FA22;CJK COMPATIBILITY IDEOGRAPH-FA22;Lo;0;L;8AF8;;;;N;;;;;
+FA23;CJK COMPATIBILITY IDEOGRAPH-FA23;Lo;0;L;;;;;N;;;;;
+FA24;CJK COMPATIBILITY IDEOGRAPH-FA24;Lo;0;L;;;;;N;;;;;
+FA25;CJK COMPATIBILITY IDEOGRAPH-FA25;Lo;0;L;9038;;;;N;;;;;
+FA26;CJK COMPATIBILITY IDEOGRAPH-FA26;Lo;0;L;90FD;;;;N;;;;;
+FA27;CJK COMPATIBILITY IDEOGRAPH-FA27;Lo;0;L;;;;;N;;;;;
+FA28;CJK COMPATIBILITY IDEOGRAPH-FA28;Lo;0;L;;;;;N;;;;;
+FA29;CJK COMPATIBILITY IDEOGRAPH-FA29;Lo;0;L;;;;;N;;;;;
+FA2A;CJK COMPATIBILITY IDEOGRAPH-FA2A;Lo;0;L;98EF;;;;N;;;;;
+FA2B;CJK COMPATIBILITY IDEOGRAPH-FA2B;Lo;0;L;98FC;;;;N;;;;;
+FA2C;CJK COMPATIBILITY IDEOGRAPH-FA2C;Lo;0;L;9928;;;;N;;;;;
+FA2D;CJK COMPATIBILITY IDEOGRAPH-FA2D;Lo;0;L;9DB4;;;;N;;;;;
+FA2E;CJK COMPATIBILITY IDEOGRAPH-FA2E;Lo;0;L;90DE;;;;N;;;;;
+FA2F;CJK COMPATIBILITY IDEOGRAPH-FA2F;Lo;0;L;96B7;;;;N;;;;;
+FA30;CJK COMPATIBILITY IDEOGRAPH-FA30;Lo;0;L;4FAE;;;;N;;;;;
+FA31;CJK COMPATIBILITY IDEOGRAPH-FA31;Lo;0;L;50E7;;;;N;;;;;
+FA32;CJK COMPATIBILITY IDEOGRAPH-FA32;Lo;0;L;514D;;;;N;;;;;
+FA33;CJK COMPATIBILITY IDEOGRAPH-FA33;Lo;0;L;52C9;;;;N;;;;;
+FA34;CJK COMPATIBILITY IDEOGRAPH-FA34;Lo;0;L;52E4;;;;N;;;;;
+FA35;CJK COMPATIBILITY IDEOGRAPH-FA35;Lo;0;L;5351;;;;N;;;;;
+FA36;CJK COMPATIBILITY IDEOGRAPH-FA36;Lo;0;L;559D;;;;N;;;;;
+FA37;CJK COMPATIBILITY IDEOGRAPH-FA37;Lo;0;L;5606;;;;N;;;;;
+FA38;CJK COMPATIBILITY IDEOGRAPH-FA38;Lo;0;L;5668;;;;N;;;;;
+FA39;CJK COMPATIBILITY IDEOGRAPH-FA39;Lo;0;L;5840;;;;N;;;;;
+FA3A;CJK COMPATIBILITY IDEOGRAPH-FA3A;Lo;0;L;58A8;;;;N;;;;;
+FA3B;CJK COMPATIBILITY IDEOGRAPH-FA3B;Lo;0;L;5C64;;;;N;;;;;
+FA3C;CJK COMPATIBILITY IDEOGRAPH-FA3C;Lo;0;L;5C6E;;;;N;;;;;
+FA3D;CJK COMPATIBILITY IDEOGRAPH-FA3D;Lo;0;L;6094;;;;N;;;;;
+FA3E;CJK COMPATIBILITY IDEOGRAPH-FA3E;Lo;0;L;6168;;;;N;;;;;
+FA3F;CJK COMPATIBILITY IDEOGRAPH-FA3F;Lo;0;L;618E;;;;N;;;;;
+FA40;CJK COMPATIBILITY IDEOGRAPH-FA40;Lo;0;L;61F2;;;;N;;;;;
+FA41;CJK COMPATIBILITY IDEOGRAPH-FA41;Lo;0;L;654F;;;;N;;;;;
+FA42;CJK COMPATIBILITY IDEOGRAPH-FA42;Lo;0;L;65E2;;;;N;;;;;
+FA43;CJK COMPATIBILITY IDEOGRAPH-FA43;Lo;0;L;6691;;;;N;;;;;
+FA44;CJK COMPATIBILITY IDEOGRAPH-FA44;Lo;0;L;6885;;;;N;;;;;
+FA45;CJK COMPATIBILITY IDEOGRAPH-FA45;Lo;0;L;6D77;;;;N;;;;;
+FA46;CJK COMPATIBILITY IDEOGRAPH-FA46;Lo;0;L;6E1A;;;;N;;;;;
+FA47;CJK COMPATIBILITY IDEOGRAPH-FA47;Lo;0;L;6F22;;;;N;;;;;
+FA48;CJK COMPATIBILITY IDEOGRAPH-FA48;Lo;0;L;716E;;;;N;;;;;
+FA49;CJK COMPATIBILITY IDEOGRAPH-FA49;Lo;0;L;722B;;;;N;;;;;
+FA4A;CJK COMPATIBILITY IDEOGRAPH-FA4A;Lo;0;L;7422;;;;N;;;;;
+FA4B;CJK COMPATIBILITY IDEOGRAPH-FA4B;Lo;0;L;7891;;;;N;;;;;
+FA4C;CJK COMPATIBILITY IDEOGRAPH-FA4C;Lo;0;L;793E;;;;N;;;;;
+FA4D;CJK COMPATIBILITY IDEOGRAPH-FA4D;Lo;0;L;7949;;;;N;;;;;
+FA4E;CJK COMPATIBILITY IDEOGRAPH-FA4E;Lo;0;L;7948;;;;N;;;;;
+FA4F;CJK COMPATIBILITY IDEOGRAPH-FA4F;Lo;0;L;7950;;;;N;;;;;
+FA50;CJK COMPATIBILITY IDEOGRAPH-FA50;Lo;0;L;7956;;;;N;;;;;
+FA51;CJK COMPATIBILITY IDEOGRAPH-FA51;Lo;0;L;795D;;;;N;;;;;
+FA52;CJK COMPATIBILITY IDEOGRAPH-FA52;Lo;0;L;798D;;;;N;;;;;
+FA53;CJK COMPATIBILITY IDEOGRAPH-FA53;Lo;0;L;798E;;;;N;;;;;
+FA54;CJK COMPATIBILITY IDEOGRAPH-FA54;Lo;0;L;7A40;;;;N;;;;;
+FA55;CJK COMPATIBILITY IDEOGRAPH-FA55;Lo;0;L;7A81;;;;N;;;;;
+FA56;CJK COMPATIBILITY IDEOGRAPH-FA56;Lo;0;L;7BC0;;;;N;;;;;
+FA57;CJK COMPATIBILITY IDEOGRAPH-FA57;Lo;0;L;7DF4;;;;N;;;;;
+FA58;CJK COMPATIBILITY IDEOGRAPH-FA58;Lo;0;L;7E09;;;;N;;;;;
+FA59;CJK COMPATIBILITY IDEOGRAPH-FA59;Lo;0;L;7E41;;;;N;;;;;
+FA5A;CJK COMPATIBILITY IDEOGRAPH-FA5A;Lo;0;L;7F72;;;;N;;;;;
+FA5B;CJK COMPATIBILITY IDEOGRAPH-FA5B;Lo;0;L;8005;;;;N;;;;;
+FA5C;CJK COMPATIBILITY IDEOGRAPH-FA5C;Lo;0;L;81ED;;;;N;;;;;
+FA5D;CJK COMPATIBILITY IDEOGRAPH-FA5D;Lo;0;L;8279;;;;N;;;;;
+FA5E;CJK COMPATIBILITY IDEOGRAPH-FA5E;Lo;0;L;8279;;;;N;;;;;
+FA5F;CJK COMPATIBILITY IDEOGRAPH-FA5F;Lo;0;L;8457;;;;N;;;;;
+FA60;CJK COMPATIBILITY IDEOGRAPH-FA60;Lo;0;L;8910;;;;N;;;;;
+FA61;CJK COMPATIBILITY IDEOGRAPH-FA61;Lo;0;L;8996;;;;N;;;;;
+FA62;CJK COMPATIBILITY IDEOGRAPH-FA62;Lo;0;L;8B01;;;;N;;;;;
+FA63;CJK COMPATIBILITY IDEOGRAPH-FA63;Lo;0;L;8B39;;;;N;;;;;
+FA64;CJK COMPATIBILITY IDEOGRAPH-FA64;Lo;0;L;8CD3;;;;N;;;;;
+FA65;CJK COMPATIBILITY IDEOGRAPH-FA65;Lo;0;L;8D08;;;;N;;;;;
+FA66;CJK COMPATIBILITY IDEOGRAPH-FA66;Lo;0;L;8FB6;;;;N;;;;;
+FA67;CJK COMPATIBILITY IDEOGRAPH-FA67;Lo;0;L;9038;;;;N;;;;;
+FA68;CJK COMPATIBILITY IDEOGRAPH-FA68;Lo;0;L;96E3;;;;N;;;;;
+FA69;CJK COMPATIBILITY IDEOGRAPH-FA69;Lo;0;L;97FF;;;;N;;;;;
+FA6A;CJK COMPATIBILITY IDEOGRAPH-FA6A;Lo;0;L;983B;;;;N;;;;;
+FA6B;CJK COMPATIBILITY IDEOGRAPH-FA6B;Lo;0;L;6075;;;;N;;;;;
+FA6C;CJK COMPATIBILITY IDEOGRAPH-FA6C;Lo;0;L;242EE;;;;N;;;;;
+FA6D;CJK COMPATIBILITY IDEOGRAPH-FA6D;Lo;0;L;8218;;;;N;;;;;
+FA70;CJK COMPATIBILITY IDEOGRAPH-FA70;Lo;0;L;4E26;;;;N;;;;;
+FA71;CJK COMPATIBILITY IDEOGRAPH-FA71;Lo;0;L;51B5;;;;N;;;;;
+FA72;CJK COMPATIBILITY IDEOGRAPH-FA72;Lo;0;L;5168;;;;N;;;;;
+FA73;CJK COMPATIBILITY IDEOGRAPH-FA73;Lo;0;L;4F80;;;;N;;;;;
+FA74;CJK COMPATIBILITY IDEOGRAPH-FA74;Lo;0;L;5145;;;;N;;;;;
+FA75;CJK COMPATIBILITY IDEOGRAPH-FA75;Lo;0;L;5180;;;;N;;;;;
+FA76;CJK COMPATIBILITY IDEOGRAPH-FA76;Lo;0;L;52C7;;;;N;;;;;
+FA77;CJK COMPATIBILITY IDEOGRAPH-FA77;Lo;0;L;52FA;;;;N;;;;;
+FA78;CJK COMPATIBILITY IDEOGRAPH-FA78;Lo;0;L;559D;;;;N;;;;;
+FA79;CJK COMPATIBILITY IDEOGRAPH-FA79;Lo;0;L;5555;;;;N;;;;;
+FA7A;CJK COMPATIBILITY IDEOGRAPH-FA7A;Lo;0;L;5599;;;;N;;;;;
+FA7B;CJK COMPATIBILITY IDEOGRAPH-FA7B;Lo;0;L;55E2;;;;N;;;;;
+FA7C;CJK COMPATIBILITY IDEOGRAPH-FA7C;Lo;0;L;585A;;;;N;;;;;
+FA7D;CJK COMPATIBILITY IDEOGRAPH-FA7D;Lo;0;L;58B3;;;;N;;;;;
+FA7E;CJK COMPATIBILITY IDEOGRAPH-FA7E;Lo;0;L;5944;;;;N;;;;;
+FA7F;CJK COMPATIBILITY IDEOGRAPH-FA7F;Lo;0;L;5954;;;;N;;;;;
+FA80;CJK COMPATIBILITY IDEOGRAPH-FA80;Lo;0;L;5A62;;;;N;;;;;
+FA81;CJK COMPATIBILITY IDEOGRAPH-FA81;Lo;0;L;5B28;;;;N;;;;;
+FA82;CJK COMPATIBILITY IDEOGRAPH-FA82;Lo;0;L;5ED2;;;;N;;;;;
+FA83;CJK COMPATIBILITY IDEOGRAPH-FA83;Lo;0;L;5ED9;;;;N;;;;;
+FA84;CJK COMPATIBILITY IDEOGRAPH-FA84;Lo;0;L;5F69;;;;N;;;;;
+FA85;CJK COMPATIBILITY IDEOGRAPH-FA85;Lo;0;L;5FAD;;;;N;;;;;
+FA86;CJK COMPATIBILITY IDEOGRAPH-FA86;Lo;0;L;60D8;;;;N;;;;;
+FA87;CJK COMPATIBILITY IDEOGRAPH-FA87;Lo;0;L;614E;;;;N;;;;;
+FA88;CJK COMPATIBILITY IDEOGRAPH-FA88;Lo;0;L;6108;;;;N;;;;;
+FA89;CJK COMPATIBILITY IDEOGRAPH-FA89;Lo;0;L;618E;;;;N;;;;;
+FA8A;CJK COMPATIBILITY IDEOGRAPH-FA8A;Lo;0;L;6160;;;;N;;;;;
+FA8B;CJK COMPATIBILITY IDEOGRAPH-FA8B;Lo;0;L;61F2;;;;N;;;;;
+FA8C;CJK COMPATIBILITY IDEOGRAPH-FA8C;Lo;0;L;6234;;;;N;;;;;
+FA8D;CJK COMPATIBILITY IDEOGRAPH-FA8D;Lo;0;L;63C4;;;;N;;;;;
+FA8E;CJK COMPATIBILITY IDEOGRAPH-FA8E;Lo;0;L;641C;;;;N;;;;;
+FA8F;CJK COMPATIBILITY IDEOGRAPH-FA8F;Lo;0;L;6452;;;;N;;;;;
+FA90;CJK COMPATIBILITY IDEOGRAPH-FA90;Lo;0;L;6556;;;;N;;;;;
+FA91;CJK COMPATIBILITY IDEOGRAPH-FA91;Lo;0;L;6674;;;;N;;;;;
+FA92;CJK COMPATIBILITY IDEOGRAPH-FA92;Lo;0;L;6717;;;;N;;;;;
+FA93;CJK COMPATIBILITY IDEOGRAPH-FA93;Lo;0;L;671B;;;;N;;;;;
+FA94;CJK COMPATIBILITY IDEOGRAPH-FA94;Lo;0;L;6756;;;;N;;;;;
+FA95;CJK COMPATIBILITY IDEOGRAPH-FA95;Lo;0;L;6B79;;;;N;;;;;
+FA96;CJK COMPATIBILITY IDEOGRAPH-FA96;Lo;0;L;6BBA;;;;N;;;;;
+FA97;CJK COMPATIBILITY IDEOGRAPH-FA97;Lo;0;L;6D41;;;;N;;;;;
+FA98;CJK COMPATIBILITY IDEOGRAPH-FA98;Lo;0;L;6EDB;;;;N;;;;;
+FA99;CJK COMPATIBILITY IDEOGRAPH-FA99;Lo;0;L;6ECB;;;;N;;;;;
+FA9A;CJK COMPATIBILITY IDEOGRAPH-FA9A;Lo;0;L;6F22;;;;N;;;;;
+FA9B;CJK COMPATIBILITY IDEOGRAPH-FA9B;Lo;0;L;701E;;;;N;;;;;
+FA9C;CJK COMPATIBILITY IDEOGRAPH-FA9C;Lo;0;L;716E;;;;N;;;;;
+FA9D;CJK COMPATIBILITY IDEOGRAPH-FA9D;Lo;0;L;77A7;;;;N;;;;;
+FA9E;CJK COMPATIBILITY IDEOGRAPH-FA9E;Lo;0;L;7235;;;;N;;;;;
+FA9F;CJK COMPATIBILITY IDEOGRAPH-FA9F;Lo;0;L;72AF;;;;N;;;;;
+FAA0;CJK COMPATIBILITY IDEOGRAPH-FAA0;Lo;0;L;732A;;;;N;;;;;
+FAA1;CJK COMPATIBILITY IDEOGRAPH-FAA1;Lo;0;L;7471;;;;N;;;;;
+FAA2;CJK COMPATIBILITY IDEOGRAPH-FAA2;Lo;0;L;7506;;;;N;;;;;
+FAA3;CJK COMPATIBILITY IDEOGRAPH-FAA3;Lo;0;L;753B;;;;N;;;;;
+FAA4;CJK COMPATIBILITY IDEOGRAPH-FAA4;Lo;0;L;761D;;;;N;;;;;
+FAA5;CJK COMPATIBILITY IDEOGRAPH-FAA5;Lo;0;L;761F;;;;N;;;;;
+FAA6;CJK COMPATIBILITY IDEOGRAPH-FAA6;Lo;0;L;76CA;;;;N;;;;;
+FAA7;CJK COMPATIBILITY IDEOGRAPH-FAA7;Lo;0;L;76DB;;;;N;;;;;
+FAA8;CJK COMPATIBILITY IDEOGRAPH-FAA8;Lo;0;L;76F4;;;;N;;;;;
+FAA9;CJK COMPATIBILITY IDEOGRAPH-FAA9;Lo;0;L;774A;;;;N;;;;;
+FAAA;CJK COMPATIBILITY IDEOGRAPH-FAAA;Lo;0;L;7740;;;;N;;;;;
+FAAB;CJK COMPATIBILITY IDEOGRAPH-FAAB;Lo;0;L;78CC;;;;N;;;;;
+FAAC;CJK COMPATIBILITY IDEOGRAPH-FAAC;Lo;0;L;7AB1;;;;N;;;;;
+FAAD;CJK COMPATIBILITY IDEOGRAPH-FAAD;Lo;0;L;7BC0;;;;N;;;;;
+FAAE;CJK COMPATIBILITY IDEOGRAPH-FAAE;Lo;0;L;7C7B;;;;N;;;;;
+FAAF;CJK COMPATIBILITY IDEOGRAPH-FAAF;Lo;0;L;7D5B;;;;N;;;;;
+FAB0;CJK COMPATIBILITY IDEOGRAPH-FAB0;Lo;0;L;7DF4;;;;N;;;;;
+FAB1;CJK COMPATIBILITY IDEOGRAPH-FAB1;Lo;0;L;7F3E;;;;N;;;;;
+FAB2;CJK COMPATIBILITY IDEOGRAPH-FAB2;Lo;0;L;8005;;;;N;;;;;
+FAB3;CJK COMPATIBILITY IDEOGRAPH-FAB3;Lo;0;L;8352;;;;N;;;;;
+FAB4;CJK COMPATIBILITY IDEOGRAPH-FAB4;Lo;0;L;83EF;;;;N;;;;;
+FAB5;CJK COMPATIBILITY IDEOGRAPH-FAB5;Lo;0;L;8779;;;;N;;;;;
+FAB6;CJK COMPATIBILITY IDEOGRAPH-FAB6;Lo;0;L;8941;;;;N;;;;;
+FAB7;CJK COMPATIBILITY IDEOGRAPH-FAB7;Lo;0;L;8986;;;;N;;;;;
+FAB8;CJK COMPATIBILITY IDEOGRAPH-FAB8;Lo;0;L;8996;;;;N;;;;;
+FAB9;CJK COMPATIBILITY IDEOGRAPH-FAB9;Lo;0;L;8ABF;;;;N;;;;;
+FABA;CJK COMPATIBILITY IDEOGRAPH-FABA;Lo;0;L;8AF8;;;;N;;;;;
+FABB;CJK COMPATIBILITY IDEOGRAPH-FABB;Lo;0;L;8ACB;;;;N;;;;;
+FABC;CJK COMPATIBILITY IDEOGRAPH-FABC;Lo;0;L;8B01;;;;N;;;;;
+FABD;CJK COMPATIBILITY IDEOGRAPH-FABD;Lo;0;L;8AFE;;;;N;;;;;
+FABE;CJK COMPATIBILITY IDEOGRAPH-FABE;Lo;0;L;8AED;;;;N;;;;;
+FABF;CJK COMPATIBILITY IDEOGRAPH-FABF;Lo;0;L;8B39;;;;N;;;;;
+FAC0;CJK COMPATIBILITY IDEOGRAPH-FAC0;Lo;0;L;8B8A;;;;N;;;;;
+FAC1;CJK COMPATIBILITY IDEOGRAPH-FAC1;Lo;0;L;8D08;;;;N;;;;;
+FAC2;CJK COMPATIBILITY IDEOGRAPH-FAC2;Lo;0;L;8F38;;;;N;;;;;
+FAC3;CJK COMPATIBILITY IDEOGRAPH-FAC3;Lo;0;L;9072;;;;N;;;;;
+FAC4;CJK COMPATIBILITY IDEOGRAPH-FAC4;Lo;0;L;9199;;;;N;;;;;
+FAC5;CJK COMPATIBILITY IDEOGRAPH-FAC5;Lo;0;L;9276;;;;N;;;;;
+FAC6;CJK COMPATIBILITY IDEOGRAPH-FAC6;Lo;0;L;967C;;;;N;;;;;
+FAC7;CJK COMPATIBILITY IDEOGRAPH-FAC7;Lo;0;L;96E3;;;;N;;;;;
+FAC8;CJK COMPATIBILITY IDEOGRAPH-FAC8;Lo;0;L;9756;;;;N;;;;;
+FAC9;CJK COMPATIBILITY IDEOGRAPH-FAC9;Lo;0;L;97DB;;;;N;;;;;
+FACA;CJK COMPATIBILITY IDEOGRAPH-FACA;Lo;0;L;97FF;;;;N;;;;;
+FACB;CJK COMPATIBILITY IDEOGRAPH-FACB;Lo;0;L;980B;;;;N;;;;;
+FACC;CJK COMPATIBILITY IDEOGRAPH-FACC;Lo;0;L;983B;;;;N;;;;;
+FACD;CJK COMPATIBILITY IDEOGRAPH-FACD;Lo;0;L;9B12;;;;N;;;;;
+FACE;CJK COMPATIBILITY IDEOGRAPH-FACE;Lo;0;L;9F9C;;;;N;;;;;
+FACF;CJK COMPATIBILITY IDEOGRAPH-FACF;Lo;0;L;2284A;;;;N;;;;;
+FAD0;CJK COMPATIBILITY IDEOGRAPH-FAD0;Lo;0;L;22844;;;;N;;;;;
+FAD1;CJK COMPATIBILITY IDEOGRAPH-FAD1;Lo;0;L;233D5;;;;N;;;;;
+FAD2;CJK COMPATIBILITY IDEOGRAPH-FAD2;Lo;0;L;3B9D;;;;N;;;;;
+FAD3;CJK COMPATIBILITY IDEOGRAPH-FAD3;Lo;0;L;4018;;;;N;;;;;
+FAD4;CJK COMPATIBILITY IDEOGRAPH-FAD4;Lo;0;L;4039;;;;N;;;;;
+FAD5;CJK COMPATIBILITY IDEOGRAPH-FAD5;Lo;0;L;25249;;;;N;;;;;
+FAD6;CJK COMPATIBILITY IDEOGRAPH-FAD6;Lo;0;L;25CD0;;;;N;;;;;
+FAD7;CJK COMPATIBILITY IDEOGRAPH-FAD7;Lo;0;L;27ED3;;;;N;;;;;
+FAD8;CJK COMPATIBILITY IDEOGRAPH-FAD8;Lo;0;L;9F43;;;;N;;;;;
+FAD9;CJK COMPATIBILITY IDEOGRAPH-FAD9;Lo;0;L;9F8E;;;;N;;;;;
+FB00;LATIN SMALL LIGATURE FF;Ll;0;L;<compat> 0066 0066;;;;N;;;;;
+FB01;LATIN SMALL LIGATURE FI;Ll;0;L;<compat> 0066 0069;;;;N;;;;;
+FB02;LATIN SMALL LIGATURE FL;Ll;0;L;<compat> 0066 006C;;;;N;;;;;
+FB03;LATIN SMALL LIGATURE FFI;Ll;0;L;<compat> 0066 0066 0069;;;;N;;;;;
+FB04;LATIN SMALL LIGATURE FFL;Ll;0;L;<compat> 0066 0066 006C;;;;N;;;;;
+FB05;LATIN SMALL LIGATURE LONG S T;Ll;0;L;<compat> 017F 0074;;;;N;;;;;
+FB06;LATIN SMALL LIGATURE ST;Ll;0;L;<compat> 0073 0074;;;;N;;;;;
+FB13;ARMENIAN SMALL LIGATURE MEN NOW;Ll;0;L;<compat> 0574 0576;;;;N;;;;;
+FB14;ARMENIAN SMALL LIGATURE MEN ECH;Ll;0;L;<compat> 0574 0565;;;;N;;;;;
+FB15;ARMENIAN SMALL LIGATURE MEN INI;Ll;0;L;<compat> 0574 056B;;;;N;;;;;
+FB16;ARMENIAN SMALL LIGATURE VEW NOW;Ll;0;L;<compat> 057E 0576;;;;N;;;;;
+FB17;ARMENIAN SMALL LIGATURE MEN XEH;Ll;0;L;<compat> 0574 056D;;;;N;;;;;
+FB1D;HEBREW LETTER YOD WITH HIRIQ;Lo;0;R;05D9 05B4;;;;N;;;;;
+FB1E;HEBREW POINT JUDEO-SPANISH VARIKA;Mn;26;NSM;;;;;N;HEBREW POINT VARIKA;;;;
+FB1F;HEBREW LIGATURE YIDDISH YOD YOD PATAH;Lo;0;R;05F2 05B7;;;;N;;;;;
+FB20;HEBREW LETTER ALTERNATIVE AYIN;Lo;0;R; 05E2;;;;N;;;;;
+FB21;HEBREW LETTER WIDE ALEF;Lo;0;R; 05D0;;;;N;;;;;
+FB22;HEBREW LETTER WIDE DALET;Lo;0;R; 05D3;;;;N;;;;;
+FB23;HEBREW LETTER WIDE HE;Lo;0;R; 05D4;;;;N;;;;;
+FB24;HEBREW LETTER WIDE KAF;Lo;0;R; 05DB;;;;N;;;;;
+FB25;HEBREW LETTER WIDE LAMED;Lo;0;R; 05DC;;;;N;;;;;
+FB26;HEBREW LETTER WIDE FINAL MEM;Lo;0;R; 05DD;;;;N;;;;;
+FB27;HEBREW LETTER WIDE RESH;Lo;0;R; 05E8;;;;N;;;;;
+FB28;HEBREW LETTER WIDE TAV;Lo;0;R; 05EA;;;;N;;;;;
+FB29;HEBREW LETTER ALTERNATIVE PLUS SIGN;Sm;0;ES; 002B;;;;N;;;;;
+FB2A;HEBREW LETTER SHIN WITH SHIN DOT;Lo;0;R;05E9 05C1;;;;N;;;;;
+FB2B;HEBREW LETTER SHIN WITH SIN DOT;Lo;0;R;05E9 05C2;;;;N;;;;;
+FB2C;HEBREW LETTER SHIN WITH DAGESH AND SHIN DOT;Lo;0;R;FB49 05C1;;;;N;;;;;
+FB2D;HEBREW LETTER SHIN WITH DAGESH AND SIN DOT;Lo;0;R;FB49 05C2;;;;N;;;;;
+FB2E;HEBREW LETTER ALEF WITH PATAH;Lo;0;R;05D0 05B7;;;;N;;;;;
+FB2F;HEBREW LETTER ALEF WITH QAMATS;Lo;0;R;05D0 05B8;;;;N;;;;;
+FB30;HEBREW LETTER ALEF WITH MAPIQ;Lo;0;R;05D0 05BC;;;;N;;;;;
+FB31;HEBREW LETTER BET WITH DAGESH;Lo;0;R;05D1 05BC;;;;N;;;;;
+FB32;HEBREW LETTER GIMEL WITH DAGESH;Lo;0;R;05D2 05BC;;;;N;;;;;
+FB33;HEBREW LETTER DALET WITH DAGESH;Lo;0;R;05D3 05BC;;;;N;;;;;
+FB34;HEBREW LETTER HE WITH MAPIQ;Lo;0;R;05D4 05BC;;;;N;;;;;
+FB35;HEBREW LETTER VAV WITH DAGESH;Lo;0;R;05D5 05BC;;;;N;;;;;
+FB36;HEBREW LETTER ZAYIN WITH DAGESH;Lo;0;R;05D6 05BC;;;;N;;;;;
+FB38;HEBREW LETTER TET WITH DAGESH;Lo;0;R;05D8 05BC;;;;N;;;;;
+FB39;HEBREW LETTER YOD WITH DAGESH;Lo;0;R;05D9 05BC;;;;N;;;;;
+FB3A;HEBREW LETTER FINAL KAF WITH DAGESH;Lo;0;R;05DA 05BC;;;;N;;;;;
+FB3B;HEBREW LETTER KAF WITH DAGESH;Lo;0;R;05DB 05BC;;;;N;;;;;
+FB3C;HEBREW LETTER LAMED WITH DAGESH;Lo;0;R;05DC 05BC;;;;N;;;;;
+FB3E;HEBREW LETTER MEM WITH DAGESH;Lo;0;R;05DE 05BC;;;;N;;;;;
+FB40;HEBREW LETTER NUN WITH DAGESH;Lo;0;R;05E0 05BC;;;;N;;;;;
+FB41;HEBREW LETTER SAMEKH WITH DAGESH;Lo;0;R;05E1 05BC;;;;N;;;;;
+FB43;HEBREW LETTER FINAL PE WITH DAGESH;Lo;0;R;05E3 05BC;;;;N;;;;;
+FB44;HEBREW LETTER PE WITH DAGESH;Lo;0;R;05E4 05BC;;;;N;;;;;
+FB46;HEBREW LETTER TSADI WITH DAGESH;Lo;0;R;05E6 05BC;;;;N;;;;;
+FB47;HEBREW LETTER QOF WITH DAGESH;Lo;0;R;05E7 05BC;;;;N;;;;;
+FB48;HEBREW LETTER RESH WITH DAGESH;Lo;0;R;05E8 05BC;;;;N;;;;;
+FB49;HEBREW LETTER SHIN WITH DAGESH;Lo;0;R;05E9 05BC;;;;N;;;;;
+FB4A;HEBREW LETTER TAV WITH DAGESH;Lo;0;R;05EA 05BC;;;;N;;;;;
+FB4B;HEBREW LETTER VAV WITH HOLAM;Lo;0;R;05D5 05B9;;;;N;;;;;
+FB4C;HEBREW LETTER BET WITH RAFE;Lo;0;R;05D1 05BF;;;;N;;;;;
+FB4D;HEBREW LETTER KAF WITH RAFE;Lo;0;R;05DB 05BF;;;;N;;;;;
+FB4E;HEBREW LETTER PE WITH RAFE;Lo;0;R;05E4 05BF;;;;N;;;;;
+FB4F;HEBREW LIGATURE ALEF LAMED;Lo;0;R;<compat> 05D0 05DC;;;;N;;;;;
+FB50;ARABIC LETTER ALEF WASLA ISOLATED FORM;Lo;0;AL;<isolated> 0671;;;;N;;;;;
+FB51;ARABIC LETTER ALEF WASLA FINAL FORM;Lo;0;AL;<final> 0671;;;;N;;;;;
+FB52;ARABIC LETTER BEEH ISOLATED FORM;Lo;0;AL;<isolated> 067B;;;;N;;;;;
+FB53;ARABIC LETTER BEEH FINAL FORM;Lo;0;AL;<final> 067B;;;;N;;;;;
+FB54;ARABIC LETTER BEEH INITIAL FORM;Lo;0;AL;<initial> 067B;;;;N;;;;;
+FB55;ARABIC LETTER BEEH MEDIAL FORM;Lo;0;AL;<medial> 067B;;;;N;;;;;
+FB56;ARABIC LETTER PEH ISOLATED FORM;Lo;0;AL;<isolated> 067E;;;;N;;;;;
+FB57;ARABIC LETTER PEH FINAL FORM;Lo;0;AL;<final> 067E;;;;N;;;;;
+FB58;ARABIC LETTER PEH INITIAL FORM;Lo;0;AL;<initial> 067E;;;;N;;;;;
+FB59;ARABIC LETTER PEH MEDIAL FORM;Lo;0;AL;<medial> 067E;;;;N;;;;;
+FB5A;ARABIC LETTER BEHEH ISOLATED FORM;Lo;0;AL;<isolated> 0680;;;;N;;;;;
+FB5B;ARABIC LETTER BEHEH FINAL FORM;Lo;0;AL;<final> 0680;;;;N;;;;;
+FB5C;ARABIC LETTER BEHEH INITIAL FORM;Lo;0;AL;<initial> 0680;;;;N;;;;;
+FB5D;ARABIC LETTER BEHEH MEDIAL FORM;Lo;0;AL;<medial> 0680;;;;N;;;;;
+FB5E;ARABIC LETTER TTEHEH ISOLATED FORM;Lo;0;AL;<isolated> 067A;;;;N;;;;;
+FB5F;ARABIC LETTER TTEHEH FINAL FORM;Lo;0;AL;<final> 067A;;;;N;;;;;
+FB60;ARABIC LETTER TTEHEH INITIAL FORM;Lo;0;AL;<initial> 067A;;;;N;;;;;
+FB61;ARABIC LETTER TTEHEH MEDIAL FORM;Lo;0;AL;<medial> 067A;;;;N;;;;;
+FB62;ARABIC LETTER TEHEH ISOLATED FORM;Lo;0;AL;<isolated> 067F;;;;N;;;;;
+FB63;ARABIC LETTER TEHEH FINAL FORM;Lo;0;AL;<final> 067F;;;;N;;;;;
+FB64;ARABIC LETTER TEHEH INITIAL FORM;Lo;0;AL;<initial> 067F;;;;N;;;;;
+FB65;ARABIC LETTER TEHEH MEDIAL FORM;Lo;0;AL;<medial> 067F;;;;N;;;;;
+FB66;ARABIC LETTER TTEH ISOLATED FORM;Lo;0;AL;<isolated> 0679;;;;N;;;;;
+FB67;ARABIC LETTER TTEH FINAL FORM;Lo;0;AL;<final> 0679;;;;N;;;;;
+FB68;ARABIC LETTER TTEH INITIAL FORM;Lo;0;AL;<initial> 0679;;;;N;;;;;
+FB69;ARABIC LETTER TTEH MEDIAL FORM;Lo;0;AL;<medial> 0679;;;;N;;;;;
+FB6A;ARABIC LETTER VEH ISOLATED FORM;Lo;0;AL;<isolated> 06A4;;;;N;;;;;
+FB6B;ARABIC LETTER VEH FINAL FORM;Lo;0;AL;<final> 06A4;;;;N;;;;;
+FB6C;ARABIC LETTER VEH INITIAL FORM;Lo;0;AL;<initial> 06A4;;;;N;;;;;
+FB6D;ARABIC LETTER VEH MEDIAL FORM;Lo;0;AL;<medial> 06A4;;;;N;;;;;
+FB6E;ARABIC LETTER PEHEH ISOLATED FORM;Lo;0;AL;<isolated> 06A6;;;;N;;;;;
+FB6F;ARABIC LETTER PEHEH FINAL FORM;Lo;0;AL;<final> 06A6;;;;N;;;;;
+FB70;ARABIC LETTER PEHEH INITIAL FORM;Lo;0;AL;<initial> 06A6;;;;N;;;;;
+FB71;ARABIC LETTER PEHEH MEDIAL FORM;Lo;0;AL;<medial> 06A6;;;;N;;;;;
+FB72;ARABIC LETTER DYEH ISOLATED FORM;Lo;0;AL;<isolated> 0684;;;;N;;;;;
+FB73;ARABIC LETTER DYEH FINAL FORM;Lo;0;AL;<final> 0684;;;;N;;;;;
+FB74;ARABIC LETTER DYEH INITIAL FORM;Lo;0;AL;<initial> 0684;;;;N;;;;;
+FB75;ARABIC LETTER DYEH MEDIAL FORM;Lo;0;AL;<medial> 0684;;;;N;;;;;
+FB76;ARABIC LETTER NYEH ISOLATED FORM;Lo;0;AL;<isolated> 0683;;;;N;;;;;
+FB77;ARABIC LETTER NYEH FINAL FORM;Lo;0;AL;<final> 0683;;;;N;;;;;
+FB78;ARABIC LETTER NYEH INITIAL FORM;Lo;0;AL;<initial> 0683;;;;N;;;;;
+FB79;ARABIC LETTER NYEH MEDIAL FORM;Lo;0;AL;<medial> 0683;;;;N;;;;;
+FB7A;ARABIC LETTER TCHEH ISOLATED FORM;Lo;0;AL;<isolated> 0686;;;;N;;;;;
+FB7B;ARABIC LETTER TCHEH FINAL FORM;Lo;0;AL;<final> 0686;;;;N;;;;;
+FB7C;ARABIC LETTER TCHEH INITIAL FORM;Lo;0;AL;<initial> 0686;;;;N;;;;;
+FB7D;ARABIC LETTER TCHEH MEDIAL FORM;Lo;0;AL;<medial> 0686;;;;N;;;;;
+FB7E;ARABIC LETTER TCHEHEH ISOLATED FORM;Lo;0;AL;<isolated> 0687;;;;N;;;;;
+FB7F;ARABIC LETTER TCHEHEH FINAL FORM;Lo;0;AL;<final> 0687;;;;N;;;;;
+FB80;ARABIC LETTER TCHEHEH INITIAL FORM;Lo;0;AL;<initial> 0687;;;;N;;;;;
+FB81;ARABIC LETTER TCHEHEH MEDIAL FORM;Lo;0;AL;<medial> 0687;;;;N;;;;;
+FB82;ARABIC LETTER DDAHAL ISOLATED FORM;Lo;0;AL;<isolated> 068D;;;;N;;;;;
+FB83;ARABIC LETTER DDAHAL FINAL FORM;Lo;0;AL;<final> 068D;;;;N;;;;;
+FB84;ARABIC LETTER DAHAL ISOLATED FORM;Lo;0;AL;<isolated> 068C;;;;N;;;;;
+FB85;ARABIC LETTER DAHAL FINAL FORM;Lo;0;AL;<final> 068C;;;;N;;;;;
+FB86;ARABIC LETTER DUL ISOLATED FORM;Lo;0;AL;<isolated> 068E;;;;N;;;;;
+FB87;ARABIC LETTER DUL FINAL FORM;Lo;0;AL;<final> 068E;;;;N;;;;;
+FB88;ARABIC LETTER DDAL ISOLATED FORM;Lo;0;AL;<isolated> 0688;;;;N;;;;;
+FB89;ARABIC LETTER DDAL FINAL FORM;Lo;0;AL;<final> 0688;;;;N;;;;;
+FB8A;ARABIC LETTER JEH ISOLATED FORM;Lo;0;AL;<isolated> 0698;;;;N;;;;;
+FB8B;ARABIC LETTER JEH FINAL FORM;Lo;0;AL;<final> 0698;;;;N;;;;;
+FB8C;ARABIC LETTER RREH ISOLATED FORM;Lo;0;AL;<isolated> 0691;;;;N;;;;;
+FB8D;ARABIC LETTER RREH FINAL FORM;Lo;0;AL;<final> 0691;;;;N;;;;;
+FB8E;ARABIC LETTER KEHEH ISOLATED FORM;Lo;0;AL;<isolated> 06A9;;;;N;;;;;
+FB8F;ARABIC LETTER KEHEH FINAL FORM;Lo;0;AL;<final> 06A9;;;;N;;;;;
+FB90;ARABIC LETTER KEHEH INITIAL FORM;Lo;0;AL;<initial> 06A9;;;;N;;;;;
+FB91;ARABIC LETTER KEHEH MEDIAL FORM;Lo;0;AL;<medial> 06A9;;;;N;;;;;
+FB92;ARABIC LETTER GAF ISOLATED FORM;Lo;0;AL;<isolated> 06AF;;;;N;;;;;
+FB93;ARABIC LETTER GAF FINAL FORM;Lo;0;AL;<final> 06AF;;;;N;;;;;
+FB94;ARABIC LETTER GAF INITIAL FORM;Lo;0;AL;<initial> 06AF;;;;N;;;;;
+FB95;ARABIC LETTER GAF MEDIAL FORM;Lo;0;AL;<medial> 06AF;;;;N;;;;;
+FB96;ARABIC LETTER GUEH ISOLATED FORM;Lo;0;AL;<isolated> 06B3;;;;N;;;;;
+FB97;ARABIC LETTER GUEH FINAL FORM;Lo;0;AL;<final> 06B3;;;;N;;;;;
+FB98;ARABIC LETTER GUEH INITIAL FORM;Lo;0;AL;<initial> 06B3;;;;N;;;;;
+FB99;ARABIC LETTER GUEH MEDIAL FORM;Lo;0;AL;<medial> 06B3;;;;N;;;;;
+FB9A;ARABIC LETTER NGOEH ISOLATED FORM;Lo;0;AL;<isolated> 06B1;;;;N;;;;;
+FB9B;ARABIC LETTER NGOEH FINAL FORM;Lo;0;AL;<final> 06B1;;;;N;;;;;
+FB9C;ARABIC LETTER NGOEH INITIAL FORM;Lo;0;AL;<initial> 06B1;;;;N;;;;;
+FB9D;ARABIC LETTER NGOEH MEDIAL FORM;Lo;0;AL;<medial> 06B1;;;;N;;;;;
+FB9E;ARABIC LETTER NOON GHUNNA ISOLATED FORM;Lo;0;AL;<isolated> 06BA;;;;N;;;;;
+FB9F;ARABIC LETTER NOON GHUNNA FINAL FORM;Lo;0;AL;<final> 06BA;;;;N;;;;;
+FBA0;ARABIC LETTER RNOON ISOLATED FORM;Lo;0;AL;<isolated> 06BB;;;;N;;;;;
+FBA1;ARABIC LETTER RNOON FINAL FORM;Lo;0;AL;<final> 06BB;;;;N;;;;;
+FBA2;ARABIC LETTER RNOON INITIAL FORM;Lo;0;AL;<initial> 06BB;;;;N;;;;;
+FBA3;ARABIC LETTER RNOON MEDIAL FORM;Lo;0;AL;<medial> 06BB;;;;N;;;;;
+FBA4;ARABIC LETTER HEH WITH YEH ABOVE ISOLATED FORM;Lo;0;AL;<isolated> 06C0;;;;N;;;;;
+FBA5;ARABIC LETTER HEH WITH YEH ABOVE FINAL FORM;Lo;0;AL;<final> 06C0;;;;N;;;;;
+FBA6;ARABIC LETTER HEH GOAL ISOLATED FORM;Lo;0;AL;<isolated> 06C1;;;;N;;;;;
+FBA7;ARABIC LETTER HEH GOAL FINAL FORM;Lo;0;AL;<final> 06C1;;;;N;;;;;
+FBA8;ARABIC LETTER HEH GOAL INITIAL FORM;Lo;0;AL;<initial> 06C1;;;;N;;;;;
+FBA9;ARABIC LETTER HEH GOAL MEDIAL FORM;Lo;0;AL;<medial> 06C1;;;;N;;;;;
+FBAA;ARABIC LETTER HEH DOACHASHMEE ISOLATED FORM;Lo;0;AL;<isolated> 06BE;;;;N;;;;;
+FBAB;ARABIC LETTER HEH DOACHASHMEE FINAL FORM;Lo;0;AL;<final> 06BE;;;;N;;;;;
+FBAC;ARABIC LETTER HEH DOACHASHMEE INITIAL FORM;Lo;0;AL;<initial> 06BE;;;;N;;;;;
+FBAD;ARABIC LETTER HEH DOACHASHMEE MEDIAL FORM;Lo;0;AL;<medial> 06BE;;;;N;;;;;
+FBAE;ARABIC LETTER YEH BARREE ISOLATED FORM;Lo;0;AL;<isolated> 06D2;;;;N;;;;;
+FBAF;ARABIC LETTER YEH BARREE FINAL FORM;Lo;0;AL;<final> 06D2;;;;N;;;;;
+FBB0;ARABIC LETTER YEH BARREE WITH HAMZA ABOVE ISOLATED FORM;Lo;0;AL;<isolated> 06D3;;;;N;;;;;
+FBB1;ARABIC LETTER YEH BARREE WITH HAMZA ABOVE FINAL FORM;Lo;0;AL;<final> 06D3;;;;N;;;;;
+FBB2;ARABIC SYMBOL DOT ABOVE;Sk;0;AL;;;;;N;;;;;
+FBB3;ARABIC SYMBOL DOT BELOW;Sk;0;AL;;;;;N;;;;;
+FBB4;ARABIC SYMBOL TWO DOTS ABOVE;Sk;0;AL;;;;;N;;;;;
+FBB5;ARABIC SYMBOL TWO DOTS BELOW;Sk;0;AL;;;;;N;;;;;
+FBB6;ARABIC SYMBOL THREE DOTS ABOVE;Sk;0;AL;;;;;N;;;;;
+FBB7;ARABIC SYMBOL THREE DOTS BELOW;Sk;0;AL;;;;;N;;;;;
+FBB8;ARABIC SYMBOL THREE DOTS POINTING DOWNWARDS ABOVE;Sk;0;AL;;;;;N;;;;;
+FBB9;ARABIC SYMBOL THREE DOTS POINTING DOWNWARDS BELOW;Sk;0;AL;;;;;N;;;;;
+FBBA;ARABIC SYMBOL FOUR DOTS ABOVE;Sk;0;AL;;;;;N;;;;;
+FBBB;ARABIC SYMBOL FOUR DOTS BELOW;Sk;0;AL;;;;;N;;;;;
+FBBC;ARABIC SYMBOL DOUBLE VERTICAL BAR BELOW;Sk;0;AL;;;;;N;;;;;
+FBBD;ARABIC SYMBOL TWO DOTS VERTICALLY ABOVE;Sk;0;AL;;;;;N;;;;;
+FBBE;ARABIC SYMBOL TWO DOTS VERTICALLY BELOW;Sk;0;AL;;;;;N;;;;;
+FBBF;ARABIC SYMBOL RING;Sk;0;AL;;;;;N;;;;;
+FBC0;ARABIC SYMBOL SMALL TAH ABOVE;Sk;0;AL;;;;;N;;;;;
+FBC1;ARABIC SYMBOL SMALL TAH BELOW;Sk;0;AL;;;;;N;;;;;
+FBD3;ARABIC LETTER NG ISOLATED FORM;Lo;0;AL;<isolated> 06AD;;;;N;;;;;
+FBD4;ARABIC LETTER NG FINAL FORM;Lo;0;AL;<final> 06AD;;;;N;;;;;
+FBD5;ARABIC LETTER NG INITIAL FORM;Lo;0;AL;<initial> 06AD;;;;N;;;;;
+FBD6;ARABIC LETTER NG MEDIAL FORM;Lo;0;AL;<medial> 06AD;;;;N;;;;;
+FBD7;ARABIC LETTER U ISOLATED FORM;Lo;0;AL;<isolated> 06C7;;;;N;;;;;
+FBD8;ARABIC LETTER U FINAL FORM;Lo;0;AL;<final> 06C7;;;;N;;;;;
+FBD9;ARABIC LETTER OE ISOLATED FORM;Lo;0;AL;<isolated> 06C6;;;;N;;;;;
+FBDA;ARABIC LETTER OE FINAL FORM;Lo;0;AL;<final> 06C6;;;;N;;;;;
+FBDB;ARABIC LETTER YU ISOLATED FORM;Lo;0;AL;<isolated> 06C8;;;;N;;;;;
+FBDC;ARABIC LETTER YU FINAL FORM;Lo;0;AL;<final> 06C8;;;;N;;;;;
+FBDD;ARABIC LETTER U WITH HAMZA ABOVE ISOLATED FORM;Lo;0;AL;<isolated> 0677;;;;N;;;;;
+FBDE;ARABIC LETTER VE ISOLATED FORM;Lo;0;AL;<isolated> 06CB;;;;N;;;;;
+FBDF;ARABIC LETTER VE FINAL FORM;Lo;0;AL;<final> 06CB;;;;N;;;;;
+FBE0;ARABIC LETTER KIRGHIZ OE ISOLATED FORM;Lo;0;AL;<isolated> 06C5;;;;N;;;;;
+FBE1;ARABIC LETTER KIRGHIZ OE FINAL FORM;Lo;0;AL;<final> 06C5;;;;N;;;;;
+FBE2;ARABIC LETTER KIRGHIZ YU ISOLATED FORM;Lo;0;AL;<isolated> 06C9;;;;N;;;;;
+FBE3;ARABIC LETTER KIRGHIZ YU FINAL FORM;Lo;0;AL;<final> 06C9;;;;N;;;;;
+FBE4;ARABIC LETTER E ISOLATED FORM;Lo;0;AL;<isolated> 06D0;;;;N;;;;;
+FBE5;ARABIC LETTER E FINAL FORM;Lo;0;AL;<final> 06D0;;;;N;;;;;
+FBE6;ARABIC LETTER E INITIAL FORM;Lo;0;AL;<initial> 06D0;;;;N;;;;;
+FBE7;ARABIC LETTER E MEDIAL FORM;Lo;0;AL;<medial> 06D0;;;;N;;;;;
+FBE8;ARABIC LETTER UIGHUR KAZAKH KIRGHIZ ALEF MAKSURA INITIAL FORM;Lo;0;AL;<initial> 0649;;;;N;;;;;
+FBE9;ARABIC LETTER UIGHUR KAZAKH KIRGHIZ ALEF MAKSURA MEDIAL FORM;Lo;0;AL;<medial> 0649;;;;N;;;;;
+FBEA;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH ALEF ISOLATED FORM;Lo;0;AL;<isolated> 0626 0627;;;;N;;;;;
+FBEB;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH ALEF FINAL FORM;Lo;0;AL;<final> 0626 0627;;;;N;;;;;
+FBEC;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH AE ISOLATED FORM;Lo;0;AL;<isolated> 0626 06D5;;;;N;;;;;
+FBED;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH AE FINAL FORM;Lo;0;AL;<final> 0626 06D5;;;;N;;;;;
+FBEE;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH WAW ISOLATED FORM;Lo;0;AL;<isolated> 0626 0648;;;;N;;;;;
+FBEF;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH WAW FINAL FORM;Lo;0;AL;<final> 0626 0648;;;;N;;;;;
+FBF0;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH U ISOLATED FORM;Lo;0;AL;<isolated> 0626 06C7;;;;N;;;;;
+FBF1;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH U FINAL FORM;Lo;0;AL;<final> 0626 06C7;;;;N;;;;;
+FBF2;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH OE ISOLATED FORM;Lo;0;AL;<isolated> 0626 06C6;;;;N;;;;;
+FBF3;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH OE FINAL FORM;Lo;0;AL;<final> 0626 06C6;;;;N;;;;;
+FBF4;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH YU ISOLATED FORM;Lo;0;AL;<isolated> 0626 06C8;;;;N;;;;;
+FBF5;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH YU FINAL FORM;Lo;0;AL;<final> 0626 06C8;;;;N;;;;;
+FBF6;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH E ISOLATED FORM;Lo;0;AL;<isolated> 0626 06D0;;;;N;;;;;
+FBF7;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH E FINAL FORM;Lo;0;AL;<final> 0626 06D0;;;;N;;;;;
+FBF8;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH E INITIAL FORM;Lo;0;AL;<initial> 0626 06D0;;;;N;;;;;
+FBF9;ARABIC LIGATURE UIGHUR KIRGHIZ YEH WITH HAMZA ABOVE WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0626 0649;;;;N;;;;;
+FBFA;ARABIC LIGATURE UIGHUR KIRGHIZ YEH WITH HAMZA ABOVE WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0626 0649;;;;N;;;;;
+FBFB;ARABIC LIGATURE UIGHUR KIRGHIZ YEH WITH HAMZA ABOVE WITH ALEF MAKSURA INITIAL FORM;Lo;0;AL;<initial> 0626 0649;;;;N;;;;;
+FBFC;ARABIC LETTER FARSI YEH ISOLATED FORM;Lo;0;AL;<isolated> 06CC;;;;N;;;;;
+FBFD;ARABIC LETTER FARSI YEH FINAL FORM;Lo;0;AL;<final> 06CC;;;;N;;;;;
+FBFE;ARABIC LETTER FARSI YEH INITIAL FORM;Lo;0;AL;<initial> 06CC;;;;N;;;;;
+FBFF;ARABIC LETTER FARSI YEH MEDIAL FORM;Lo;0;AL;<medial> 06CC;;;;N;;;;;
+FC00;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 0626 062C;;;;N;;;;;
+FC01;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 0626 062D;;;;N;;;;;
+FC02;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0626 0645;;;;N;;;;;
+FC03;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0626 0649;;;;N;;;;;
+FC04;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 0626 064A;;;;N;;;;;
+FC05;ARABIC LIGATURE BEH WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 0628 062C;;;;N;;;;;
+FC06;ARABIC LIGATURE BEH WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 0628 062D;;;;N;;;;;
+FC07;ARABIC LIGATURE BEH WITH KHAH ISOLATED FORM;Lo;0;AL;<isolated> 0628 062E;;;;N;;;;;
+FC08;ARABIC LIGATURE BEH WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0628 0645;;;;N;;;;;
+FC09;ARABIC LIGATURE BEH WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0628 0649;;;;N;;;;;
+FC0A;ARABIC LIGATURE BEH WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 0628 064A;;;;N;;;;;
+FC0B;ARABIC LIGATURE TEH WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 062A 062C;;;;N;;;;;
+FC0C;ARABIC LIGATURE TEH WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 062A 062D;;;;N;;;;;
+FC0D;ARABIC LIGATURE TEH WITH KHAH ISOLATED FORM;Lo;0;AL;<isolated> 062A 062E;;;;N;;;;;
+FC0E;ARABIC LIGATURE TEH WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 062A 0645;;;;N;;;;;
+FC0F;ARABIC LIGATURE TEH WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 062A 0649;;;;N;;;;;
+FC10;ARABIC LIGATURE TEH WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 062A 064A;;;;N;;;;;
+FC11;ARABIC LIGATURE THEH WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 062B 062C;;;;N;;;;;
+FC12;ARABIC LIGATURE THEH WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 062B 0645;;;;N;;;;;
+FC13;ARABIC LIGATURE THEH WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 062B 0649;;;;N;;;;;
+FC14;ARABIC LIGATURE THEH WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 062B 064A;;;;N;;;;;
+FC15;ARABIC LIGATURE JEEM WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 062C 062D;;;;N;;;;;
+FC16;ARABIC LIGATURE JEEM WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 062C 0645;;;;N;;;;;
+FC17;ARABIC LIGATURE HAH WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 062D 062C;;;;N;;;;;
+FC18;ARABIC LIGATURE HAH WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 062D 0645;;;;N;;;;;
+FC19;ARABIC LIGATURE KHAH WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 062E 062C;;;;N;;;;;
+FC1A;ARABIC LIGATURE KHAH WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 062E 062D;;;;N;;;;;
+FC1B;ARABIC LIGATURE KHAH WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 062E 0645;;;;N;;;;;
+FC1C;ARABIC LIGATURE SEEN WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 0633 062C;;;;N;;;;;
+FC1D;ARABIC LIGATURE SEEN WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 0633 062D;;;;N;;;;;
+FC1E;ARABIC LIGATURE SEEN WITH KHAH ISOLATED FORM;Lo;0;AL;<isolated> 0633 062E;;;;N;;;;;
+FC1F;ARABIC LIGATURE SEEN WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0633 0645;;;;N;;;;;
+FC20;ARABIC LIGATURE SAD WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 0635 062D;;;;N;;;;;
+FC21;ARABIC LIGATURE SAD WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0635 0645;;;;N;;;;;
+FC22;ARABIC LIGATURE DAD WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 0636 062C;;;;N;;;;;
+FC23;ARABIC LIGATURE DAD WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 0636 062D;;;;N;;;;;
+FC24;ARABIC LIGATURE DAD WITH KHAH ISOLATED FORM;Lo;0;AL;<isolated> 0636 062E;;;;N;;;;;
+FC25;ARABIC LIGATURE DAD WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0636 0645;;;;N;;;;;
+FC26;ARABIC LIGATURE TAH WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 0637 062D;;;;N;;;;;
+FC27;ARABIC LIGATURE TAH WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0637 0645;;;;N;;;;;
+FC28;ARABIC LIGATURE ZAH WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0638 0645;;;;N;;;;;
+FC29;ARABIC LIGATURE AIN WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 0639 062C;;;;N;;;;;
+FC2A;ARABIC LIGATURE AIN WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0639 0645;;;;N;;;;;
+FC2B;ARABIC LIGATURE GHAIN WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 063A 062C;;;;N;;;;;
+FC2C;ARABIC LIGATURE GHAIN WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 063A 0645;;;;N;;;;;
+FC2D;ARABIC LIGATURE FEH WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 0641 062C;;;;N;;;;;
+FC2E;ARABIC LIGATURE FEH WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 0641 062D;;;;N;;;;;
+FC2F;ARABIC LIGATURE FEH WITH KHAH ISOLATED FORM;Lo;0;AL;<isolated> 0641 062E;;;;N;;;;;
+FC30;ARABIC LIGATURE FEH WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0641 0645;;;;N;;;;;
+FC31;ARABIC LIGATURE FEH WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0641 0649;;;;N;;;;;
+FC32;ARABIC LIGATURE FEH WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 0641 064A;;;;N;;;;;
+FC33;ARABIC LIGATURE QAF WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 0642 062D;;;;N;;;;;
+FC34;ARABIC LIGATURE QAF WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0642 0645;;;;N;;;;;
+FC35;ARABIC LIGATURE QAF WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0642 0649;;;;N;;;;;
+FC36;ARABIC LIGATURE QAF WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 0642 064A;;;;N;;;;;
+FC37;ARABIC LIGATURE KAF WITH ALEF ISOLATED FORM;Lo;0;AL;<isolated> 0643 0627;;;;N;;;;;
+FC38;ARABIC LIGATURE KAF WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 0643 062C;;;;N;;;;;
+FC39;ARABIC LIGATURE KAF WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 0643 062D;;;;N;;;;;
+FC3A;ARABIC LIGATURE KAF WITH KHAH ISOLATED FORM;Lo;0;AL;<isolated> 0643 062E;;;;N;;;;;
+FC3B;ARABIC LIGATURE KAF WITH LAM ISOLATED FORM;Lo;0;AL;<isolated> 0643 0644;;;;N;;;;;
+FC3C;ARABIC LIGATURE KAF WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0643 0645;;;;N;;;;;
+FC3D;ARABIC LIGATURE KAF WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0643 0649;;;;N;;;;;
+FC3E;ARABIC LIGATURE KAF WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 0643 064A;;;;N;;;;;
+FC3F;ARABIC LIGATURE LAM WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 0644 062C;;;;N;;;;;
+FC40;ARABIC LIGATURE LAM WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 0644 062D;;;;N;;;;;
+FC41;ARABIC LIGATURE LAM WITH KHAH ISOLATED FORM;Lo;0;AL;<isolated> 0644 062E;;;;N;;;;;
+FC42;ARABIC LIGATURE LAM WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0644 0645;;;;N;;;;;
+FC43;ARABIC LIGATURE LAM WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0644 0649;;;;N;;;;;
+FC44;ARABIC LIGATURE LAM WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 0644 064A;;;;N;;;;;
+FC45;ARABIC LIGATURE MEEM WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 0645 062C;;;;N;;;;;
+FC46;ARABIC LIGATURE MEEM WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 0645 062D;;;;N;;;;;
+FC47;ARABIC LIGATURE MEEM WITH KHAH ISOLATED FORM;Lo;0;AL;<isolated> 0645 062E;;;;N;;;;;
+FC48;ARABIC LIGATURE MEEM WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0645 0645;;;;N;;;;;
+FC49;ARABIC LIGATURE MEEM WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0645 0649;;;;N;;;;;
+FC4A;ARABIC LIGATURE MEEM WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 0645 064A;;;;N;;;;;
+FC4B;ARABIC LIGATURE NOON WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 0646 062C;;;;N;;;;;
+FC4C;ARABIC LIGATURE NOON WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 0646 062D;;;;N;;;;;
+FC4D;ARABIC LIGATURE NOON WITH KHAH ISOLATED FORM;Lo;0;AL;<isolated> 0646 062E;;;;N;;;;;
+FC4E;ARABIC LIGATURE NOON WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0646 0645;;;;N;;;;;
+FC4F;ARABIC LIGATURE NOON WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0646 0649;;;;N;;;;;
+FC50;ARABIC LIGATURE NOON WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 0646 064A;;;;N;;;;;
+FC51;ARABIC LIGATURE HEH WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 0647 062C;;;;N;;;;;
+FC52;ARABIC LIGATURE HEH WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0647 0645;;;;N;;;;;
+FC53;ARABIC LIGATURE HEH WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0647 0649;;;;N;;;;;
+FC54;ARABIC LIGATURE HEH WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 0647 064A;;;;N;;;;;
+FC55;ARABIC LIGATURE YEH WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 064A 062C;;;;N;;;;;
+FC56;ARABIC LIGATURE YEH WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 064A 062D;;;;N;;;;;
+FC57;ARABIC LIGATURE YEH WITH KHAH ISOLATED FORM;Lo;0;AL;<isolated> 064A 062E;;;;N;;;;;
+FC58;ARABIC LIGATURE YEH WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 064A 0645;;;;N;;;;;
+FC59;ARABIC LIGATURE YEH WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 064A 0649;;;;N;;;;;
+FC5A;ARABIC LIGATURE YEH WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 064A 064A;;;;N;;;;;
+FC5B;ARABIC LIGATURE THAL WITH SUPERSCRIPT ALEF ISOLATED FORM;Lo;0;AL;<isolated> 0630 0670;;;;N;;;;;
+FC5C;ARABIC LIGATURE REH WITH SUPERSCRIPT ALEF ISOLATED FORM;Lo;0;AL;<isolated> 0631 0670;;;;N;;;;;
+FC5D;ARABIC LIGATURE ALEF MAKSURA WITH SUPERSCRIPT ALEF ISOLATED FORM;Lo;0;AL;<isolated> 0649 0670;;;;N;;;;;
+FC5E;ARABIC LIGATURE SHADDA WITH DAMMATAN ISOLATED FORM;Lo;0;AL;<isolated> 0020 064C 0651;;;;N;;;;;
+FC5F;ARABIC LIGATURE SHADDA WITH KASRATAN ISOLATED FORM;Lo;0;AL;<isolated> 0020 064D 0651;;;;N;;;;;
+FC60;ARABIC LIGATURE SHADDA WITH FATHA ISOLATED FORM;Lo;0;AL;<isolated> 0020 064E 0651;;;;N;;;;;
+FC61;ARABIC LIGATURE SHADDA WITH DAMMA ISOLATED FORM;Lo;0;AL;<isolated> 0020 064F 0651;;;;N;;;;;
+FC62;ARABIC LIGATURE SHADDA WITH KASRA ISOLATED FORM;Lo;0;AL;<isolated> 0020 0650 0651;;;;N;;;;;
+FC63;ARABIC LIGATURE SHADDA WITH SUPERSCRIPT ALEF ISOLATED FORM;Lo;0;AL;<isolated> 0020 0651 0670;;;;N;;;;;
+FC64;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH REH FINAL FORM;Lo;0;AL;<final> 0626 0631;;;;N;;;;;
+FC65;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH ZAIN FINAL FORM;Lo;0;AL;<final> 0626 0632;;;;N;;;;;
+FC66;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH MEEM FINAL FORM;Lo;0;AL;<final> 0626 0645;;;;N;;;;;
+FC67;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH NOON FINAL FORM;Lo;0;AL;<final> 0626 0646;;;;N;;;;;
+FC68;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0626 0649;;;;N;;;;;
+FC69;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH YEH FINAL FORM;Lo;0;AL;<final> 0626 064A;;;;N;;;;;
+FC6A;ARABIC LIGATURE BEH WITH REH FINAL FORM;Lo;0;AL;<final> 0628 0631;;;;N;;;;;
+FC6B;ARABIC LIGATURE BEH WITH ZAIN FINAL FORM;Lo;0;AL;<final> 0628 0632;;;;N;;;;;
+FC6C;ARABIC LIGATURE BEH WITH MEEM FINAL FORM;Lo;0;AL;<final> 0628 0645;;;;N;;;;;
+FC6D;ARABIC LIGATURE BEH WITH NOON FINAL FORM;Lo;0;AL;<final> 0628 0646;;;;N;;;;;
+FC6E;ARABIC LIGATURE BEH WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0628 0649;;;;N;;;;;
+FC6F;ARABIC LIGATURE BEH WITH YEH FINAL FORM;Lo;0;AL;<final> 0628 064A;;;;N;;;;;
+FC70;ARABIC LIGATURE TEH WITH REH FINAL FORM;Lo;0;AL;<final> 062A 0631;;;;N;;;;;
+FC71;ARABIC LIGATURE TEH WITH ZAIN FINAL FORM;Lo;0;AL;<final> 062A 0632;;;;N;;;;;
+FC72;ARABIC LIGATURE TEH WITH MEEM FINAL FORM;Lo;0;AL;<final> 062A 0645;;;;N;;;;;
+FC73;ARABIC LIGATURE TEH WITH NOON FINAL FORM;Lo;0;AL;<final> 062A 0646;;;;N;;;;;
+FC74;ARABIC LIGATURE TEH WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 062A 0649;;;;N;;;;;
+FC75;ARABIC LIGATURE TEH WITH YEH FINAL FORM;Lo;0;AL;<final> 062A 064A;;;;N;;;;;
+FC76;ARABIC LIGATURE THEH WITH REH FINAL FORM;Lo;0;AL;<final> 062B 0631;;;;N;;;;;
+FC77;ARABIC LIGATURE THEH WITH ZAIN FINAL FORM;Lo;0;AL;<final> 062B 0632;;;;N;;;;;
+FC78;ARABIC LIGATURE THEH WITH MEEM FINAL FORM;Lo;0;AL;<final> 062B 0645;;;;N;;;;;
+FC79;ARABIC LIGATURE THEH WITH NOON FINAL FORM;Lo;0;AL;<final> 062B 0646;;;;N;;;;;
+FC7A;ARABIC LIGATURE THEH WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 062B 0649;;;;N;;;;;
+FC7B;ARABIC LIGATURE THEH WITH YEH FINAL FORM;Lo;0;AL;<final> 062B 064A;;;;N;;;;;
+FC7C;ARABIC LIGATURE FEH WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0641 0649;;;;N;;;;;
+FC7D;ARABIC LIGATURE FEH WITH YEH FINAL FORM;Lo;0;AL;<final> 0641 064A;;;;N;;;;;
+FC7E;ARABIC LIGATURE QAF WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0642 0649;;;;N;;;;;
+FC7F;ARABIC LIGATURE QAF WITH YEH FINAL FORM;Lo;0;AL;<final> 0642 064A;;;;N;;;;;
+FC80;ARABIC LIGATURE KAF WITH ALEF FINAL FORM;Lo;0;AL;<final> 0643 0627;;;;N;;;;;
+FC81;ARABIC LIGATURE KAF WITH LAM FINAL FORM;Lo;0;AL;<final> 0643 0644;;;;N;;;;;
+FC82;ARABIC LIGATURE KAF WITH MEEM FINAL FORM;Lo;0;AL;<final> 0643 0645;;;;N;;;;;
+FC83;ARABIC LIGATURE KAF WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0643 0649;;;;N;;;;;
+FC84;ARABIC LIGATURE KAF WITH YEH FINAL FORM;Lo;0;AL;<final> 0643 064A;;;;N;;;;;
+FC85;ARABIC LIGATURE LAM WITH MEEM FINAL FORM;Lo;0;AL;<final> 0644 0645;;;;N;;;;;
+FC86;ARABIC LIGATURE LAM WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0644 0649;;;;N;;;;;
+FC87;ARABIC LIGATURE LAM WITH YEH FINAL FORM;Lo;0;AL;<final> 0644 064A;;;;N;;;;;
+FC88;ARABIC LIGATURE MEEM WITH ALEF FINAL FORM;Lo;0;AL;<final> 0645 0627;;;;N;;;;;
+FC89;ARABIC LIGATURE MEEM WITH MEEM FINAL FORM;Lo;0;AL;<final> 0645 0645;;;;N;;;;;
+FC8A;ARABIC LIGATURE NOON WITH REH FINAL FORM;Lo;0;AL;<final> 0646 0631;;;;N;;;;;
+FC8B;ARABIC LIGATURE NOON WITH ZAIN FINAL FORM;Lo;0;AL;<final> 0646 0632;;;;N;;;;;
+FC8C;ARABIC LIGATURE NOON WITH MEEM FINAL FORM;Lo;0;AL;<final> 0646 0645;;;;N;;;;;
+FC8D;ARABIC LIGATURE NOON WITH NOON FINAL FORM;Lo;0;AL;<final> 0646 0646;;;;N;;;;;
+FC8E;ARABIC LIGATURE NOON WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0646 0649;;;;N;;;;;
+FC8F;ARABIC LIGATURE NOON WITH YEH FINAL FORM;Lo;0;AL;<final> 0646 064A;;;;N;;;;;
+FC90;ARABIC LIGATURE ALEF MAKSURA WITH SUPERSCRIPT ALEF FINAL FORM;Lo;0;AL;<final> 0649 0670;;;;N;;;;;
+FC91;ARABIC LIGATURE YEH WITH REH FINAL FORM;Lo;0;AL;<final> 064A 0631;;;;N;;;;;
+FC92;ARABIC LIGATURE YEH WITH ZAIN FINAL FORM;Lo;0;AL;<final> 064A 0632;;;;N;;;;;
+FC93;ARABIC LIGATURE YEH WITH MEEM FINAL FORM;Lo;0;AL;<final> 064A 0645;;;;N;;;;;
+FC94;ARABIC LIGATURE YEH WITH NOON FINAL FORM;Lo;0;AL;<final> 064A 0646;;;;N;;;;;
+FC95;ARABIC LIGATURE YEH WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 064A 0649;;;;N;;;;;
+FC96;ARABIC LIGATURE YEH WITH YEH FINAL FORM;Lo;0;AL;<final> 064A 064A;;;;N;;;;;
+FC97;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0626 062C;;;;N;;;;;
+FC98;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0626 062D;;;;N;;;;;
+FC99;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 0626 062E;;;;N;;;;;
+FC9A;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0626 0645;;;;N;;;;;
+FC9B;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH HEH INITIAL FORM;Lo;0;AL;<initial> 0626 0647;;;;N;;;;;
+FC9C;ARABIC LIGATURE BEH WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0628 062C;;;;N;;;;;
+FC9D;ARABIC LIGATURE BEH WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0628 062D;;;;N;;;;;
+FC9E;ARABIC LIGATURE BEH WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 0628 062E;;;;N;;;;;
+FC9F;ARABIC LIGATURE BEH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0628 0645;;;;N;;;;;
+FCA0;ARABIC LIGATURE BEH WITH HEH INITIAL FORM;Lo;0;AL;<initial> 0628 0647;;;;N;;;;;
+FCA1;ARABIC LIGATURE TEH WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 062A 062C;;;;N;;;;;
+FCA2;ARABIC LIGATURE TEH WITH HAH INITIAL FORM;Lo;0;AL;<initial> 062A 062D;;;;N;;;;;
+FCA3;ARABIC LIGATURE TEH WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 062A 062E;;;;N;;;;;
+FCA4;ARABIC LIGATURE TEH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 062A 0645;;;;N;;;;;
+FCA5;ARABIC LIGATURE TEH WITH HEH INITIAL FORM;Lo;0;AL;<initial> 062A 0647;;;;N;;;;;
+FCA6;ARABIC LIGATURE THEH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 062B 0645;;;;N;;;;;
+FCA7;ARABIC LIGATURE JEEM WITH HAH INITIAL FORM;Lo;0;AL;<initial> 062C 062D;;;;N;;;;;
+FCA8;ARABIC LIGATURE JEEM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 062C 0645;;;;N;;;;;
+FCA9;ARABIC LIGATURE HAH WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 062D 062C;;;;N;;;;;
+FCAA;ARABIC LIGATURE HAH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 062D 0645;;;;N;;;;;
+FCAB;ARABIC LIGATURE KHAH WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 062E 062C;;;;N;;;;;
+FCAC;ARABIC LIGATURE KHAH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 062E 0645;;;;N;;;;;
+FCAD;ARABIC LIGATURE SEEN WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0633 062C;;;;N;;;;;
+FCAE;ARABIC LIGATURE SEEN WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0633 062D;;;;N;;;;;
+FCAF;ARABIC LIGATURE SEEN WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 0633 062E;;;;N;;;;;
+FCB0;ARABIC LIGATURE SEEN WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0633 0645;;;;N;;;;;
+FCB1;ARABIC LIGATURE SAD WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0635 062D;;;;N;;;;;
+FCB2;ARABIC LIGATURE SAD WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 0635 062E;;;;N;;;;;
+FCB3;ARABIC LIGATURE SAD WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0635 0645;;;;N;;;;;
+FCB4;ARABIC LIGATURE DAD WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0636 062C;;;;N;;;;;
+FCB5;ARABIC LIGATURE DAD WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0636 062D;;;;N;;;;;
+FCB6;ARABIC LIGATURE DAD WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 0636 062E;;;;N;;;;;
+FCB7;ARABIC LIGATURE DAD WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0636 0645;;;;N;;;;;
+FCB8;ARABIC LIGATURE TAH WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0637 062D;;;;N;;;;;
+FCB9;ARABIC LIGATURE ZAH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0638 0645;;;;N;;;;;
+FCBA;ARABIC LIGATURE AIN WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0639 062C;;;;N;;;;;
+FCBB;ARABIC LIGATURE AIN WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0639 0645;;;;N;;;;;
+FCBC;ARABIC LIGATURE GHAIN WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 063A 062C;;;;N;;;;;
+FCBD;ARABIC LIGATURE GHAIN WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 063A 0645;;;;N;;;;;
+FCBE;ARABIC LIGATURE FEH WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0641 062C;;;;N;;;;;
+FCBF;ARABIC LIGATURE FEH WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0641 062D;;;;N;;;;;
+FCC0;ARABIC LIGATURE FEH WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 0641 062E;;;;N;;;;;
+FCC1;ARABIC LIGATURE FEH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0641 0645;;;;N;;;;;
+FCC2;ARABIC LIGATURE QAF WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0642 062D;;;;N;;;;;
+FCC3;ARABIC LIGATURE QAF WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0642 0645;;;;N;;;;;
+FCC4;ARABIC LIGATURE KAF WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0643 062C;;;;N;;;;;
+FCC5;ARABIC LIGATURE KAF WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0643 062D;;;;N;;;;;
+FCC6;ARABIC LIGATURE KAF WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 0643 062E;;;;N;;;;;
+FCC7;ARABIC LIGATURE KAF WITH LAM INITIAL FORM;Lo;0;AL;<initial> 0643 0644;;;;N;;;;;
+FCC8;ARABIC LIGATURE KAF WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0643 0645;;;;N;;;;;
+FCC9;ARABIC LIGATURE LAM WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0644 062C;;;;N;;;;;
+FCCA;ARABIC LIGATURE LAM WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0644 062D;;;;N;;;;;
+FCCB;ARABIC LIGATURE LAM WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 0644 062E;;;;N;;;;;
+FCCC;ARABIC LIGATURE LAM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0644 0645;;;;N;;;;;
+FCCD;ARABIC LIGATURE LAM WITH HEH INITIAL FORM;Lo;0;AL;<initial> 0644 0647;;;;N;;;;;
+FCCE;ARABIC LIGATURE MEEM WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0645 062C;;;;N;;;;;
+FCCF;ARABIC LIGATURE MEEM WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0645 062D;;;;N;;;;;
+FCD0;ARABIC LIGATURE MEEM WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 0645 062E;;;;N;;;;;
+FCD1;ARABIC LIGATURE MEEM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0645 0645;;;;N;;;;;
+FCD2;ARABIC LIGATURE NOON WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0646 062C;;;;N;;;;;
+FCD3;ARABIC LIGATURE NOON WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0646 062D;;;;N;;;;;
+FCD4;ARABIC LIGATURE NOON WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 0646 062E;;;;N;;;;;
+FCD5;ARABIC LIGATURE NOON WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0646 0645;;;;N;;;;;
+FCD6;ARABIC LIGATURE NOON WITH HEH INITIAL FORM;Lo;0;AL;<initial> 0646 0647;;;;N;;;;;
+FCD7;ARABIC LIGATURE HEH WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0647 062C;;;;N;;;;;
+FCD8;ARABIC LIGATURE HEH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0647 0645;;;;N;;;;;
+FCD9;ARABIC LIGATURE HEH WITH SUPERSCRIPT ALEF INITIAL FORM;Lo;0;AL;<initial> 0647 0670;;;;N;;;;;
+FCDA;ARABIC LIGATURE YEH WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 064A 062C;;;;N;;;;;
+FCDB;ARABIC LIGATURE YEH WITH HAH INITIAL FORM;Lo;0;AL;<initial> 064A 062D;;;;N;;;;;
+FCDC;ARABIC LIGATURE YEH WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 064A 062E;;;;N;;;;;
+FCDD;ARABIC LIGATURE YEH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 064A 0645;;;;N;;;;;
+FCDE;ARABIC LIGATURE YEH WITH HEH INITIAL FORM;Lo;0;AL;<initial> 064A 0647;;;;N;;;;;
+FCDF;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH MEEM MEDIAL FORM;Lo;0;AL;<medial> 0626 0645;;;;N;;;;;
+FCE0;ARABIC LIGATURE YEH WITH HAMZA ABOVE WITH HEH MEDIAL FORM;Lo;0;AL;<medial> 0626 0647;;;;N;;;;;
+FCE1;ARABIC LIGATURE BEH WITH MEEM MEDIAL FORM;Lo;0;AL;<medial> 0628 0645;;;;N;;;;;
+FCE2;ARABIC LIGATURE BEH WITH HEH MEDIAL FORM;Lo;0;AL;<medial> 0628 0647;;;;N;;;;;
+FCE3;ARABIC LIGATURE TEH WITH MEEM MEDIAL FORM;Lo;0;AL;<medial> 062A 0645;;;;N;;;;;
+FCE4;ARABIC LIGATURE TEH WITH HEH MEDIAL FORM;Lo;0;AL;<medial> 062A 0647;;;;N;;;;;
+FCE5;ARABIC LIGATURE THEH WITH MEEM MEDIAL FORM;Lo;0;AL;<medial> 062B 0645;;;;N;;;;;
+FCE6;ARABIC LIGATURE THEH WITH HEH MEDIAL FORM;Lo;0;AL;<medial> 062B 0647;;;;N;;;;;
+FCE7;ARABIC LIGATURE SEEN WITH MEEM MEDIAL FORM;Lo;0;AL;<medial> 0633 0645;;;;N;;;;;
+FCE8;ARABIC LIGATURE SEEN WITH HEH MEDIAL FORM;Lo;0;AL;<medial> 0633 0647;;;;N;;;;;
+FCE9;ARABIC LIGATURE SHEEN WITH MEEM MEDIAL FORM;Lo;0;AL;<medial> 0634 0645;;;;N;;;;;
+FCEA;ARABIC LIGATURE SHEEN WITH HEH MEDIAL FORM;Lo;0;AL;<medial> 0634 0647;;;;N;;;;;
+FCEB;ARABIC LIGATURE KAF WITH LAM MEDIAL FORM;Lo;0;AL;<medial> 0643 0644;;;;N;;;;;
+FCEC;ARABIC LIGATURE KAF WITH MEEM MEDIAL FORM;Lo;0;AL;<medial> 0643 0645;;;;N;;;;;
+FCED;ARABIC LIGATURE LAM WITH MEEM MEDIAL FORM;Lo;0;AL;<medial> 0644 0645;;;;N;;;;;
+FCEE;ARABIC LIGATURE NOON WITH MEEM MEDIAL FORM;Lo;0;AL;<medial> 0646 0645;;;;N;;;;;
+FCEF;ARABIC LIGATURE NOON WITH HEH MEDIAL FORM;Lo;0;AL;<medial> 0646 0647;;;;N;;;;;
+FCF0;ARABIC LIGATURE YEH WITH MEEM MEDIAL FORM;Lo;0;AL;<medial> 064A 0645;;;;N;;;;;
+FCF1;ARABIC LIGATURE YEH WITH HEH MEDIAL FORM;Lo;0;AL;<medial> 064A 0647;;;;N;;;;;
+FCF2;ARABIC LIGATURE SHADDA WITH FATHA MEDIAL FORM;Lo;0;AL;<medial> 0640 064E 0651;;;;N;;;;;
+FCF3;ARABIC LIGATURE SHADDA WITH DAMMA MEDIAL FORM;Lo;0;AL;<medial> 0640 064F 0651;;;;N;;;;;
+FCF4;ARABIC LIGATURE SHADDA WITH KASRA MEDIAL FORM;Lo;0;AL;<medial> 0640 0650 0651;;;;N;;;;;
+FCF5;ARABIC LIGATURE TAH WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0637 0649;;;;N;;;;;
+FCF6;ARABIC LIGATURE TAH WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 0637 064A;;;;N;;;;;
+FCF7;ARABIC LIGATURE AIN WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0639 0649;;;;N;;;;;
+FCF8;ARABIC LIGATURE AIN WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 0639 064A;;;;N;;;;;
+FCF9;ARABIC LIGATURE GHAIN WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 063A 0649;;;;N;;;;;
+FCFA;ARABIC LIGATURE GHAIN WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 063A 064A;;;;N;;;;;
+FCFB;ARABIC LIGATURE SEEN WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0633 0649;;;;N;;;;;
+FCFC;ARABIC LIGATURE SEEN WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 0633 064A;;;;N;;;;;
+FCFD;ARABIC LIGATURE SHEEN WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0634 0649;;;;N;;;;;
+FCFE;ARABIC LIGATURE SHEEN WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 0634 064A;;;;N;;;;;
+FCFF;ARABIC LIGATURE HAH WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 062D 0649;;;;N;;;;;
+FD00;ARABIC LIGATURE HAH WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 062D 064A;;;;N;;;;;
+FD01;ARABIC LIGATURE JEEM WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 062C 0649;;;;N;;;;;
+FD02;ARABIC LIGATURE JEEM WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 062C 064A;;;;N;;;;;
+FD03;ARABIC LIGATURE KHAH WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 062E 0649;;;;N;;;;;
+FD04;ARABIC LIGATURE KHAH WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 062E 064A;;;;N;;;;;
+FD05;ARABIC LIGATURE SAD WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0635 0649;;;;N;;;;;
+FD06;ARABIC LIGATURE SAD WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 0635 064A;;;;N;;;;;
+FD07;ARABIC LIGATURE DAD WITH ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0636 0649;;;;N;;;;;
+FD08;ARABIC LIGATURE DAD WITH YEH ISOLATED FORM;Lo;0;AL;<isolated> 0636 064A;;;;N;;;;;
+FD09;ARABIC LIGATURE SHEEN WITH JEEM ISOLATED FORM;Lo;0;AL;<isolated> 0634 062C;;;;N;;;;;
+FD0A;ARABIC LIGATURE SHEEN WITH HAH ISOLATED FORM;Lo;0;AL;<isolated> 0634 062D;;;;N;;;;;
+FD0B;ARABIC LIGATURE SHEEN WITH KHAH ISOLATED FORM;Lo;0;AL;<isolated> 0634 062E;;;;N;;;;;
+FD0C;ARABIC LIGATURE SHEEN WITH MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0634 0645;;;;N;;;;;
+FD0D;ARABIC LIGATURE SHEEN WITH REH ISOLATED FORM;Lo;0;AL;<isolated> 0634 0631;;;;N;;;;;
+FD0E;ARABIC LIGATURE SEEN WITH REH ISOLATED FORM;Lo;0;AL;<isolated> 0633 0631;;;;N;;;;;
+FD0F;ARABIC LIGATURE SAD WITH REH ISOLATED FORM;Lo;0;AL;<isolated> 0635 0631;;;;N;;;;;
+FD10;ARABIC LIGATURE DAD WITH REH ISOLATED FORM;Lo;0;AL;<isolated> 0636 0631;;;;N;;;;;
+FD11;ARABIC LIGATURE TAH WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0637 0649;;;;N;;;;;
+FD12;ARABIC LIGATURE TAH WITH YEH FINAL FORM;Lo;0;AL;<final> 0637 064A;;;;N;;;;;
+FD13;ARABIC LIGATURE AIN WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0639 0649;;;;N;;;;;
+FD14;ARABIC LIGATURE AIN WITH YEH FINAL FORM;Lo;0;AL;<final> 0639 064A;;;;N;;;;;
+FD15;ARABIC LIGATURE GHAIN WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 063A 0649;;;;N;;;;;
+FD16;ARABIC LIGATURE GHAIN WITH YEH FINAL FORM;Lo;0;AL;<final> 063A 064A;;;;N;;;;;
+FD17;ARABIC LIGATURE SEEN WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0633 0649;;;;N;;;;;
+FD18;ARABIC LIGATURE SEEN WITH YEH FINAL FORM;Lo;0;AL;<final> 0633 064A;;;;N;;;;;
+FD19;ARABIC LIGATURE SHEEN WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0634 0649;;;;N;;;;;
+FD1A;ARABIC LIGATURE SHEEN WITH YEH FINAL FORM;Lo;0;AL;<final> 0634 064A;;;;N;;;;;
+FD1B;ARABIC LIGATURE HAH WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 062D 0649;;;;N;;;;;
+FD1C;ARABIC LIGATURE HAH WITH YEH FINAL FORM;Lo;0;AL;<final> 062D 064A;;;;N;;;;;
+FD1D;ARABIC LIGATURE JEEM WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 062C 0649;;;;N;;;;;
+FD1E;ARABIC LIGATURE JEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 062C 064A;;;;N;;;;;
+FD1F;ARABIC LIGATURE KHAH WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 062E 0649;;;;N;;;;;
+FD20;ARABIC LIGATURE KHAH WITH YEH FINAL FORM;Lo;0;AL;<final> 062E 064A;;;;N;;;;;
+FD21;ARABIC LIGATURE SAD WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0635 0649;;;;N;;;;;
+FD22;ARABIC LIGATURE SAD WITH YEH FINAL FORM;Lo;0;AL;<final> 0635 064A;;;;N;;;;;
+FD23;ARABIC LIGATURE DAD WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0636 0649;;;;N;;;;;
+FD24;ARABIC LIGATURE DAD WITH YEH FINAL FORM;Lo;0;AL;<final> 0636 064A;;;;N;;;;;
+FD25;ARABIC LIGATURE SHEEN WITH JEEM FINAL FORM;Lo;0;AL;<final> 0634 062C;;;;N;;;;;
+FD26;ARABIC LIGATURE SHEEN WITH HAH FINAL FORM;Lo;0;AL;<final> 0634 062D;;;;N;;;;;
+FD27;ARABIC LIGATURE SHEEN WITH KHAH FINAL FORM;Lo;0;AL;<final> 0634 062E;;;;N;;;;;
+FD28;ARABIC LIGATURE SHEEN WITH MEEM FINAL FORM;Lo;0;AL;<final> 0634 0645;;;;N;;;;;
+FD29;ARABIC LIGATURE SHEEN WITH REH FINAL FORM;Lo;0;AL;<final> 0634 0631;;;;N;;;;;
+FD2A;ARABIC LIGATURE SEEN WITH REH FINAL FORM;Lo;0;AL;<final> 0633 0631;;;;N;;;;;
+FD2B;ARABIC LIGATURE SAD WITH REH FINAL FORM;Lo;0;AL;<final> 0635 0631;;;;N;;;;;
+FD2C;ARABIC LIGATURE DAD WITH REH FINAL FORM;Lo;0;AL;<final> 0636 0631;;;;N;;;;;
+FD2D;ARABIC LIGATURE SHEEN WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0634 062C;;;;N;;;;;
+FD2E;ARABIC LIGATURE SHEEN WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0634 062D;;;;N;;;;;
+FD2F;ARABIC LIGATURE SHEEN WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 0634 062E;;;;N;;;;;
+FD30;ARABIC LIGATURE SHEEN WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0634 0645;;;;N;;;;;
+FD31;ARABIC LIGATURE SEEN WITH HEH INITIAL FORM;Lo;0;AL;<initial> 0633 0647;;;;N;;;;;
+FD32;ARABIC LIGATURE SHEEN WITH HEH INITIAL FORM;Lo;0;AL;<initial> 0634 0647;;;;N;;;;;
+FD33;ARABIC LIGATURE TAH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0637 0645;;;;N;;;;;
+FD34;ARABIC LIGATURE SEEN WITH JEEM MEDIAL FORM;Lo;0;AL;<medial> 0633 062C;;;;N;;;;;
+FD35;ARABIC LIGATURE SEEN WITH HAH MEDIAL FORM;Lo;0;AL;<medial> 0633 062D;;;;N;;;;;
+FD36;ARABIC LIGATURE SEEN WITH KHAH MEDIAL FORM;Lo;0;AL;<medial> 0633 062E;;;;N;;;;;
+FD37;ARABIC LIGATURE SHEEN WITH JEEM MEDIAL FORM;Lo;0;AL;<medial> 0634 062C;;;;N;;;;;
+FD38;ARABIC LIGATURE SHEEN WITH HAH MEDIAL FORM;Lo;0;AL;<medial> 0634 062D;;;;N;;;;;
+FD39;ARABIC LIGATURE SHEEN WITH KHAH MEDIAL FORM;Lo;0;AL;<medial> 0634 062E;;;;N;;;;;
+FD3A;ARABIC LIGATURE TAH WITH MEEM MEDIAL FORM;Lo;0;AL;<medial> 0637 0645;;;;N;;;;;
+FD3B;ARABIC LIGATURE ZAH WITH MEEM MEDIAL FORM;Lo;0;AL;<medial> 0638 0645;;;;N;;;;;
+FD3C;ARABIC LIGATURE ALEF WITH FATHATAN FINAL FORM;Lo;0;AL;<final> 0627 064B;;;;N;;;;;
+FD3D;ARABIC LIGATURE ALEF WITH FATHATAN ISOLATED FORM;Lo;0;AL;<isolated> 0627 064B;;;;N;;;;;
+FD3E;ORNATE LEFT PARENTHESIS;Pe;0;ON;;;;;N;;;;;
+FD3F;ORNATE RIGHT PARENTHESIS;Ps;0;ON;;;;;N;;;;;
+FD50;ARABIC LIGATURE TEH WITH JEEM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 062A 062C 0645;;;;N;;;;;
+FD51;ARABIC LIGATURE TEH WITH HAH WITH JEEM FINAL FORM;Lo;0;AL;<final> 062A 062D 062C;;;;N;;;;;
+FD52;ARABIC LIGATURE TEH WITH HAH WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 062A 062D 062C;;;;N;;;;;
+FD53;ARABIC LIGATURE TEH WITH HAH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 062A 062D 0645;;;;N;;;;;
+FD54;ARABIC LIGATURE TEH WITH KHAH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 062A 062E 0645;;;;N;;;;;
+FD55;ARABIC LIGATURE TEH WITH MEEM WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 062A 0645 062C;;;;N;;;;;
+FD56;ARABIC LIGATURE TEH WITH MEEM WITH HAH INITIAL FORM;Lo;0;AL;<initial> 062A 0645 062D;;;;N;;;;;
+FD57;ARABIC LIGATURE TEH WITH MEEM WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 062A 0645 062E;;;;N;;;;;
+FD58;ARABIC LIGATURE JEEM WITH MEEM WITH HAH FINAL FORM;Lo;0;AL;<final> 062C 0645 062D;;;;N;;;;;
+FD59;ARABIC LIGATURE JEEM WITH MEEM WITH HAH INITIAL FORM;Lo;0;AL;<initial> 062C 0645 062D;;;;N;;;;;
+FD5A;ARABIC LIGATURE HAH WITH MEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 062D 0645 064A;;;;N;;;;;
+FD5B;ARABIC LIGATURE HAH WITH MEEM WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 062D 0645 0649;;;;N;;;;;
+FD5C;ARABIC LIGATURE SEEN WITH HAH WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0633 062D 062C;;;;N;;;;;
+FD5D;ARABIC LIGATURE SEEN WITH JEEM WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0633 062C 062D;;;;N;;;;;
+FD5E;ARABIC LIGATURE SEEN WITH JEEM WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0633 062C 0649;;;;N;;;;;
+FD5F;ARABIC LIGATURE SEEN WITH MEEM WITH HAH FINAL FORM;Lo;0;AL;<final> 0633 0645 062D;;;;N;;;;;
+FD60;ARABIC LIGATURE SEEN WITH MEEM WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0633 0645 062D;;;;N;;;;;
+FD61;ARABIC LIGATURE SEEN WITH MEEM WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0633 0645 062C;;;;N;;;;;
+FD62;ARABIC LIGATURE SEEN WITH MEEM WITH MEEM FINAL FORM;Lo;0;AL;<final> 0633 0645 0645;;;;N;;;;;
+FD63;ARABIC LIGATURE SEEN WITH MEEM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0633 0645 0645;;;;N;;;;;
+FD64;ARABIC LIGATURE SAD WITH HAH WITH HAH FINAL FORM;Lo;0;AL;<final> 0635 062D 062D;;;;N;;;;;
+FD65;ARABIC LIGATURE SAD WITH HAH WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0635 062D 062D;;;;N;;;;;
+FD66;ARABIC LIGATURE SAD WITH MEEM WITH MEEM FINAL FORM;Lo;0;AL;<final> 0635 0645 0645;;;;N;;;;;
+FD67;ARABIC LIGATURE SHEEN WITH HAH WITH MEEM FINAL FORM;Lo;0;AL;<final> 0634 062D 0645;;;;N;;;;;
+FD68;ARABIC LIGATURE SHEEN WITH HAH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0634 062D 0645;;;;N;;;;;
+FD69;ARABIC LIGATURE SHEEN WITH JEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 0634 062C 064A;;;;N;;;;;
+FD6A;ARABIC LIGATURE SHEEN WITH MEEM WITH KHAH FINAL FORM;Lo;0;AL;<final> 0634 0645 062E;;;;N;;;;;
+FD6B;ARABIC LIGATURE SHEEN WITH MEEM WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 0634 0645 062E;;;;N;;;;;
+FD6C;ARABIC LIGATURE SHEEN WITH MEEM WITH MEEM FINAL FORM;Lo;0;AL;<final> 0634 0645 0645;;;;N;;;;;
+FD6D;ARABIC LIGATURE SHEEN WITH MEEM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0634 0645 0645;;;;N;;;;;
+FD6E;ARABIC LIGATURE DAD WITH HAH WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0636 062D 0649;;;;N;;;;;
+FD6F;ARABIC LIGATURE DAD WITH KHAH WITH MEEM FINAL FORM;Lo;0;AL;<final> 0636 062E 0645;;;;N;;;;;
+FD70;ARABIC LIGATURE DAD WITH KHAH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0636 062E 0645;;;;N;;;;;
+FD71;ARABIC LIGATURE TAH WITH MEEM WITH HAH FINAL FORM;Lo;0;AL;<final> 0637 0645 062D;;;;N;;;;;
+FD72;ARABIC LIGATURE TAH WITH MEEM WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0637 0645 062D;;;;N;;;;;
+FD73;ARABIC LIGATURE TAH WITH MEEM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0637 0645 0645;;;;N;;;;;
+FD74;ARABIC LIGATURE TAH WITH MEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 0637 0645 064A;;;;N;;;;;
+FD75;ARABIC LIGATURE AIN WITH JEEM WITH MEEM FINAL FORM;Lo;0;AL;<final> 0639 062C 0645;;;;N;;;;;
+FD76;ARABIC LIGATURE AIN WITH MEEM WITH MEEM FINAL FORM;Lo;0;AL;<final> 0639 0645 0645;;;;N;;;;;
+FD77;ARABIC LIGATURE AIN WITH MEEM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0639 0645 0645;;;;N;;;;;
+FD78;ARABIC LIGATURE AIN WITH MEEM WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0639 0645 0649;;;;N;;;;;
+FD79;ARABIC LIGATURE GHAIN WITH MEEM WITH MEEM FINAL FORM;Lo;0;AL;<final> 063A 0645 0645;;;;N;;;;;
+FD7A;ARABIC LIGATURE GHAIN WITH MEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 063A 0645 064A;;;;N;;;;;
+FD7B;ARABIC LIGATURE GHAIN WITH MEEM WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 063A 0645 0649;;;;N;;;;;
+FD7C;ARABIC LIGATURE FEH WITH KHAH WITH MEEM FINAL FORM;Lo;0;AL;<final> 0641 062E 0645;;;;N;;;;;
+FD7D;ARABIC LIGATURE FEH WITH KHAH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0641 062E 0645;;;;N;;;;;
+FD7E;ARABIC LIGATURE QAF WITH MEEM WITH HAH FINAL FORM;Lo;0;AL;<final> 0642 0645 062D;;;;N;;;;;
+FD7F;ARABIC LIGATURE QAF WITH MEEM WITH MEEM FINAL FORM;Lo;0;AL;<final> 0642 0645 0645;;;;N;;;;;
+FD80;ARABIC LIGATURE LAM WITH HAH WITH MEEM FINAL FORM;Lo;0;AL;<final> 0644 062D 0645;;;;N;;;;;
+FD81;ARABIC LIGATURE LAM WITH HAH WITH YEH FINAL FORM;Lo;0;AL;<final> 0644 062D 064A;;;;N;;;;;
+FD82;ARABIC LIGATURE LAM WITH HAH WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0644 062D 0649;;;;N;;;;;
+FD83;ARABIC LIGATURE LAM WITH JEEM WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0644 062C 062C;;;;N;;;;;
+FD84;ARABIC LIGATURE LAM WITH JEEM WITH JEEM FINAL FORM;Lo;0;AL;<final> 0644 062C 062C;;;;N;;;;;
+FD85;ARABIC LIGATURE LAM WITH KHAH WITH MEEM FINAL FORM;Lo;0;AL;<final> 0644 062E 0645;;;;N;;;;;
+FD86;ARABIC LIGATURE LAM WITH KHAH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0644 062E 0645;;;;N;;;;;
+FD87;ARABIC LIGATURE LAM WITH MEEM WITH HAH FINAL FORM;Lo;0;AL;<final> 0644 0645 062D;;;;N;;;;;
+FD88;ARABIC LIGATURE LAM WITH MEEM WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0644 0645 062D;;;;N;;;;;
+FD89;ARABIC LIGATURE MEEM WITH HAH WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0645 062D 062C;;;;N;;;;;
+FD8A;ARABIC LIGATURE MEEM WITH HAH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0645 062D 0645;;;;N;;;;;
+FD8B;ARABIC LIGATURE MEEM WITH HAH WITH YEH FINAL FORM;Lo;0;AL;<final> 0645 062D 064A;;;;N;;;;;
+FD8C;ARABIC LIGATURE MEEM WITH JEEM WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0645 062C 062D;;;;N;;;;;
+FD8D;ARABIC LIGATURE MEEM WITH JEEM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0645 062C 0645;;;;N;;;;;
+FD8E;ARABIC LIGATURE MEEM WITH KHAH WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0645 062E 062C;;;;N;;;;;
+FD8F;ARABIC LIGATURE MEEM WITH KHAH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0645 062E 0645;;;;N;;;;;
+FD92;ARABIC LIGATURE MEEM WITH JEEM WITH KHAH INITIAL FORM;Lo;0;AL;<initial> 0645 062C 062E;;;;N;;;;;
+FD93;ARABIC LIGATURE HEH WITH MEEM WITH JEEM INITIAL FORM;Lo;0;AL;<initial> 0647 0645 062C;;;;N;;;;;
+FD94;ARABIC LIGATURE HEH WITH MEEM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0647 0645 0645;;;;N;;;;;
+FD95;ARABIC LIGATURE NOON WITH HAH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0646 062D 0645;;;;N;;;;;
+FD96;ARABIC LIGATURE NOON WITH HAH WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0646 062D 0649;;;;N;;;;;
+FD97;ARABIC LIGATURE NOON WITH JEEM WITH MEEM FINAL FORM;Lo;0;AL;<final> 0646 062C 0645;;;;N;;;;;
+FD98;ARABIC LIGATURE NOON WITH JEEM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0646 062C 0645;;;;N;;;;;
+FD99;ARABIC LIGATURE NOON WITH JEEM WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0646 062C 0649;;;;N;;;;;
+FD9A;ARABIC LIGATURE NOON WITH MEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 0646 0645 064A;;;;N;;;;;
+FD9B;ARABIC LIGATURE NOON WITH MEEM WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0646 0645 0649;;;;N;;;;;
+FD9C;ARABIC LIGATURE YEH WITH MEEM WITH MEEM FINAL FORM;Lo;0;AL;<final> 064A 0645 0645;;;;N;;;;;
+FD9D;ARABIC LIGATURE YEH WITH MEEM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 064A 0645 0645;;;;N;;;;;
+FD9E;ARABIC LIGATURE BEH WITH KHAH WITH YEH FINAL FORM;Lo;0;AL;<final> 0628 062E 064A;;;;N;;;;;
+FD9F;ARABIC LIGATURE TEH WITH JEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 062A 062C 064A;;;;N;;;;;
+FDA0;ARABIC LIGATURE TEH WITH JEEM WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 062A 062C 0649;;;;N;;;;;
+FDA1;ARABIC LIGATURE TEH WITH KHAH WITH YEH FINAL FORM;Lo;0;AL;<final> 062A 062E 064A;;;;N;;;;;
+FDA2;ARABIC LIGATURE TEH WITH KHAH WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 062A 062E 0649;;;;N;;;;;
+FDA3;ARABIC LIGATURE TEH WITH MEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 062A 0645 064A;;;;N;;;;;
+FDA4;ARABIC LIGATURE TEH WITH MEEM WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 062A 0645 0649;;;;N;;;;;
+FDA5;ARABIC LIGATURE JEEM WITH MEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 062C 0645 064A;;;;N;;;;;
+FDA6;ARABIC LIGATURE JEEM WITH HAH WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 062C 062D 0649;;;;N;;;;;
+FDA7;ARABIC LIGATURE JEEM WITH MEEM WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 062C 0645 0649;;;;N;;;;;
+FDA8;ARABIC LIGATURE SEEN WITH KHAH WITH ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0633 062E 0649;;;;N;;;;;
+FDA9;ARABIC LIGATURE SAD WITH HAH WITH YEH FINAL FORM;Lo;0;AL;<final> 0635 062D 064A;;;;N;;;;;
+FDAA;ARABIC LIGATURE SHEEN WITH HAH WITH YEH FINAL FORM;Lo;0;AL;<final> 0634 062D 064A;;;;N;;;;;
+FDAB;ARABIC LIGATURE DAD WITH HAH WITH YEH FINAL FORM;Lo;0;AL;<final> 0636 062D 064A;;;;N;;;;;
+FDAC;ARABIC LIGATURE LAM WITH JEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 0644 062C 064A;;;;N;;;;;
+FDAD;ARABIC LIGATURE LAM WITH MEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 0644 0645 064A;;;;N;;;;;
+FDAE;ARABIC LIGATURE YEH WITH HAH WITH YEH FINAL FORM;Lo;0;AL;<final> 064A 062D 064A;;;;N;;;;;
+FDAF;ARABIC LIGATURE YEH WITH JEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 064A 062C 064A;;;;N;;;;;
+FDB0;ARABIC LIGATURE YEH WITH MEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 064A 0645 064A;;;;N;;;;;
+FDB1;ARABIC LIGATURE MEEM WITH MEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 0645 0645 064A;;;;N;;;;;
+FDB2;ARABIC LIGATURE QAF WITH MEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 0642 0645 064A;;;;N;;;;;
+FDB3;ARABIC LIGATURE NOON WITH HAH WITH YEH FINAL FORM;Lo;0;AL;<final> 0646 062D 064A;;;;N;;;;;
+FDB4;ARABIC LIGATURE QAF WITH MEEM WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0642 0645 062D;;;;N;;;;;
+FDB5;ARABIC LIGATURE LAM WITH HAH WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0644 062D 0645;;;;N;;;;;
+FDB6;ARABIC LIGATURE AIN WITH MEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 0639 0645 064A;;;;N;;;;;
+FDB7;ARABIC LIGATURE KAF WITH MEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 0643 0645 064A;;;;N;;;;;
+FDB8;ARABIC LIGATURE NOON WITH JEEM WITH HAH INITIAL FORM;Lo;0;AL;<initial> 0646 062C 062D;;;;N;;;;;
+FDB9;ARABIC LIGATURE MEEM WITH KHAH WITH YEH FINAL FORM;Lo;0;AL;<final> 0645 062E 064A;;;;N;;;;;
+FDBA;ARABIC LIGATURE LAM WITH JEEM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0644 062C 0645;;;;N;;;;;
+FDBB;ARABIC LIGATURE KAF WITH MEEM WITH MEEM FINAL FORM;Lo;0;AL;<final> 0643 0645 0645;;;;N;;;;;
+FDBC;ARABIC LIGATURE LAM WITH JEEM WITH MEEM FINAL FORM;Lo;0;AL;<final> 0644 062C 0645;;;;N;;;;;
+FDBD;ARABIC LIGATURE NOON WITH JEEM WITH HAH FINAL FORM;Lo;0;AL;<final> 0646 062C 062D;;;;N;;;;;
+FDBE;ARABIC LIGATURE JEEM WITH HAH WITH YEH FINAL FORM;Lo;0;AL;<final> 062C 062D 064A;;;;N;;;;;
+FDBF;ARABIC LIGATURE HAH WITH JEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 062D 062C 064A;;;;N;;;;;
+FDC0;ARABIC LIGATURE MEEM WITH JEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 0645 062C 064A;;;;N;;;;;
+FDC1;ARABIC LIGATURE FEH WITH MEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 0641 0645 064A;;;;N;;;;;
+FDC2;ARABIC LIGATURE BEH WITH HAH WITH YEH FINAL FORM;Lo;0;AL;<final> 0628 062D 064A;;;;N;;;;;
+FDC3;ARABIC LIGATURE KAF WITH MEEM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0643 0645 0645;;;;N;;;;;
+FDC4;ARABIC LIGATURE AIN WITH JEEM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0639 062C 0645;;;;N;;;;;
+FDC5;ARABIC LIGATURE SAD WITH MEEM WITH MEEM INITIAL FORM;Lo;0;AL;<initial> 0635 0645 0645;;;;N;;;;;
+FDC6;ARABIC LIGATURE SEEN WITH KHAH WITH YEH FINAL FORM;Lo;0;AL;<final> 0633 062E 064A;;;;N;;;;;
+FDC7;ARABIC LIGATURE NOON WITH JEEM WITH YEH FINAL FORM;Lo;0;AL;<final> 0646 062C 064A;;;;N;;;;;
+FDF0;ARABIC LIGATURE SALLA USED AS KORANIC STOP SIGN ISOLATED FORM;Lo;0;AL;<isolated> 0635 0644 06D2;;;;N;;;;;
+FDF1;ARABIC LIGATURE QALA USED AS KORANIC STOP SIGN ISOLATED FORM;Lo;0;AL;<isolated> 0642 0644 06D2;;;;N;;;;;
+FDF2;ARABIC LIGATURE ALLAH ISOLATED FORM;Lo;0;AL;<isolated> 0627 0644 0644 0647;;;;N;;;;;
+FDF3;ARABIC LIGATURE AKBAR ISOLATED FORM;Lo;0;AL;<isolated> 0627 0643 0628 0631;;;;N;;;;;
+FDF4;ARABIC LIGATURE MOHAMMAD ISOLATED FORM;Lo;0;AL;<isolated> 0645 062D 0645 062F;;;;N;;;;;
+FDF5;ARABIC LIGATURE SALAM ISOLATED FORM;Lo;0;AL;<isolated> 0635 0644 0639 0645;;;;N;;;;;
+FDF6;ARABIC LIGATURE RASOUL ISOLATED FORM;Lo;0;AL;<isolated> 0631 0633 0648 0644;;;;N;;;;;
+FDF7;ARABIC LIGATURE ALAYHE ISOLATED FORM;Lo;0;AL;<isolated> 0639 0644 064A 0647;;;;N;;;;;
+FDF8;ARABIC LIGATURE WASALLAM ISOLATED FORM;Lo;0;AL;<isolated> 0648 0633 0644 0645;;;;N;;;;;
+FDF9;ARABIC LIGATURE SALLA ISOLATED FORM;Lo;0;AL;<isolated> 0635 0644 0649;;;;N;;;;;
+FDFA;ARABIC LIGATURE SALLALLAHOU ALAYHE WASALLAM;Lo;0;AL;<isolated> 0635 0644 0649 0020 0627 0644 0644 0647 0020 0639 0644 064A 0647 0020 0648 0633 0644 0645;;;;N;ARABIC LETTER SALLALLAHOU ALAYHE WASALLAM;;;;
+FDFB;ARABIC LIGATURE JALLAJALALOUHOU;Lo;0;AL;<isolated> 062C 0644 0020 062C 0644 0627 0644 0647;;;;N;ARABIC LETTER JALLAJALALOUHOU;;;;
+FDFC;RIAL SIGN;Sc;0;AL;<isolated> 0631 06CC 0627 0644;;;;N;;;;;
+FDFD;ARABIC LIGATURE BISMILLAH AR-RAHMAN AR-RAHEEM;So;0;ON;;;;;N;;;;;
+FE00;VARIATION SELECTOR-1;Mn;0;NSM;;;;;N;;;;;
+FE01;VARIATION SELECTOR-2;Mn;0;NSM;;;;;N;;;;;
+FE02;VARIATION SELECTOR-3;Mn;0;NSM;;;;;N;;;;;
+FE03;VARIATION SELECTOR-4;Mn;0;NSM;;;;;N;;;;;
+FE04;VARIATION SELECTOR-5;Mn;0;NSM;;;;;N;;;;;
+FE05;VARIATION SELECTOR-6;Mn;0;NSM;;;;;N;;;;;
+FE06;VARIATION SELECTOR-7;Mn;0;NSM;;;;;N;;;;;
+FE07;VARIATION SELECTOR-8;Mn;0;NSM;;;;;N;;;;;
+FE08;VARIATION SELECTOR-9;Mn;0;NSM;;;;;N;;;;;
+FE09;VARIATION SELECTOR-10;Mn;0;NSM;;;;;N;;;;;
+FE0A;VARIATION SELECTOR-11;Mn;0;NSM;;;;;N;;;;;
+FE0B;VARIATION SELECTOR-12;Mn;0;NSM;;;;;N;;;;;
+FE0C;VARIATION SELECTOR-13;Mn;0;NSM;;;;;N;;;;;
+FE0D;VARIATION SELECTOR-14;Mn;0;NSM;;;;;N;;;;;
+FE0E;VARIATION SELECTOR-15;Mn;0;NSM;;;;;N;;;;;
+FE0F;VARIATION SELECTOR-16;Mn;0;NSM;;;;;N;;;;;
+FE10;PRESENTATION FORM FOR VERTICAL COMMA;Po;0;ON;<vertical> 002C;;;;N;;;;;
+FE11;PRESENTATION FORM FOR VERTICAL IDEOGRAPHIC COMMA;Po;0;ON;<vertical> 3001;;;;N;;;;;
+FE12;PRESENTATION FORM FOR VERTICAL IDEOGRAPHIC FULL STOP;Po;0;ON;<vertical> 3002;;;;N;;;;;
+FE13;PRESENTATION FORM FOR VERTICAL COLON;Po;0;ON;<vertical> 003A;;;;N;;;;;
+FE14;PRESENTATION FORM FOR VERTICAL SEMICOLON;Po;0;ON;<vertical> 003B;;;;N;;;;;
+FE15;PRESENTATION FORM FOR VERTICAL EXCLAMATION MARK;Po;0;ON;<vertical> 0021;;;;N;;;;;
+FE16;PRESENTATION FORM FOR VERTICAL QUESTION MARK;Po;0;ON;<vertical> 003F;;;;N;;;;;
+FE17;PRESENTATION FORM FOR VERTICAL LEFT WHITE LENTICULAR BRACKET;Ps;0;ON;<vertical> 3016;;;;N;;;;;
+FE18;PRESENTATION FORM FOR VERTICAL RIGHT WHITE LENTICULAR BRAKCET;Pe;0;ON;<vertical> 3017;;;;N;;;;;
+FE19;PRESENTATION FORM FOR VERTICAL HORIZONTAL ELLIPSIS;Po;0;ON;<vertical> 2026;;;;N;;;;;
+FE20;COMBINING LIGATURE LEFT HALF;Mn;230;NSM;;;;;N;;;;;
+FE21;COMBINING LIGATURE RIGHT HALF;Mn;230;NSM;;;;;N;;;;;
+FE22;COMBINING DOUBLE TILDE LEFT HALF;Mn;230;NSM;;;;;N;;;;;
+FE23;COMBINING DOUBLE TILDE RIGHT HALF;Mn;230;NSM;;;;;N;;;;;
+FE24;COMBINING MACRON LEFT HALF;Mn;230;NSM;;;;;N;;;;;
+FE25;COMBINING MACRON RIGHT HALF;Mn;230;NSM;;;;;N;;;;;
+FE26;COMBINING CONJOINING MACRON;Mn;230;NSM;;;;;N;;;;;
+FE27;COMBINING LIGATURE LEFT HALF BELOW;Mn;220;NSM;;;;;N;;;;;
+FE28;COMBINING LIGATURE RIGHT HALF BELOW;Mn;220;NSM;;;;;N;;;;;
+FE29;COMBINING TILDE LEFT HALF BELOW;Mn;220;NSM;;;;;N;;;;;
+FE2A;COMBINING TILDE RIGHT HALF BELOW;Mn;220;NSM;;;;;N;;;;;
+FE2B;COMBINING MACRON LEFT HALF BELOW;Mn;220;NSM;;;;;N;;;;;
+FE2C;COMBINING MACRON RIGHT HALF BELOW;Mn;220;NSM;;;;;N;;;;;
+FE2D;COMBINING CONJOINING MACRON BELOW;Mn;220;NSM;;;;;N;;;;;
+FE2E;COMBINING CYRILLIC TITLO LEFT HALF;Mn;230;NSM;;;;;N;;;;;
+FE2F;COMBINING CYRILLIC TITLO RIGHT HALF;Mn;230;NSM;;;;;N;;;;;
+FE30;PRESENTATION FORM FOR VERTICAL TWO DOT LEADER;Po;0;ON;<vertical> 2025;;;;N;GLYPH FOR VERTICAL TWO DOT LEADER;;;;
+FE31;PRESENTATION FORM FOR VERTICAL EM DASH;Pd;0;ON;<vertical> 2014;;;;N;GLYPH FOR VERTICAL EM DASH;;;;
+FE32;PRESENTATION FORM FOR VERTICAL EN DASH;Pd;0;ON;<vertical> 2013;;;;N;GLYPH FOR VERTICAL EN DASH;;;;
+FE33;PRESENTATION FORM FOR VERTICAL LOW LINE;Pc;0;ON;<vertical> 005F;;;;N;GLYPH FOR VERTICAL SPACING UNDERSCORE;;;;
+FE34;PRESENTATION FORM FOR VERTICAL WAVY LOW LINE;Pc;0;ON;<vertical> 005F;;;;N;GLYPH FOR VERTICAL SPACING WAVY UNDERSCORE;;;;
+FE35;PRESENTATION FORM FOR VERTICAL LEFT PARENTHESIS;Ps;0;ON;<vertical> 0028;;;;N;GLYPH FOR VERTICAL OPENING PARENTHESIS;;;;
+FE36;PRESENTATION FORM FOR VERTICAL RIGHT PARENTHESIS;Pe;0;ON;<vertical> 0029;;;;N;GLYPH FOR VERTICAL CLOSING PARENTHESIS;;;;
+FE37;PRESENTATION FORM FOR VERTICAL LEFT CURLY BRACKET;Ps;0;ON;<vertical> 007B;;;;N;GLYPH FOR VERTICAL OPENING CURLY BRACKET;;;;
+FE38;PRESENTATION FORM FOR VERTICAL RIGHT CURLY BRACKET;Pe;0;ON;<vertical> 007D;;;;N;GLYPH FOR VERTICAL CLOSING CURLY BRACKET;;;;
+FE39;PRESENTATION FORM FOR VERTICAL LEFT TORTOISE SHELL BRACKET;Ps;0;ON;<vertical> 3014;;;;N;GLYPH FOR VERTICAL OPENING TORTOISE SHELL BRACKET;;;;
+FE3A;PRESENTATION FORM FOR VERTICAL RIGHT TORTOISE SHELL BRACKET;Pe;0;ON;<vertical> 3015;;;;N;GLYPH FOR VERTICAL CLOSING TORTOISE SHELL BRACKET;;;;
+FE3B;PRESENTATION FORM FOR VERTICAL LEFT BLACK LENTICULAR BRACKET;Ps;0;ON;<vertical> 3010;;;;N;GLYPH FOR VERTICAL OPENING BLACK LENTICULAR BRACKET;;;;
+FE3C;PRESENTATION FORM FOR VERTICAL RIGHT BLACK LENTICULAR BRACKET;Pe;0;ON;<vertical> 3011;;;;N;GLYPH FOR VERTICAL CLOSING BLACK LENTICULAR BRACKET;;;;
+FE3D;PRESENTATION FORM FOR VERTICAL LEFT DOUBLE ANGLE BRACKET;Ps;0;ON;<vertical> 300A;;;;N;GLYPH FOR VERTICAL OPENING DOUBLE ANGLE BRACKET;;;;
+FE3E;PRESENTATION FORM FOR VERTICAL RIGHT DOUBLE ANGLE BRACKET;Pe;0;ON;<vertical> 300B;;;;N;GLYPH FOR VERTICAL CLOSING DOUBLE ANGLE BRACKET;;;;
+FE3F;PRESENTATION FORM FOR VERTICAL LEFT ANGLE BRACKET;Ps;0;ON;<vertical> 3008;;;;N;GLYPH FOR VERTICAL OPENING ANGLE BRACKET;;;;
+FE40;PRESENTATION FORM FOR VERTICAL RIGHT ANGLE BRACKET;Pe;0;ON;<vertical> 3009;;;;N;GLYPH FOR VERTICAL CLOSING ANGLE BRACKET;;;;
+FE41;PRESENTATION FORM FOR VERTICAL LEFT CORNER BRACKET;Ps;0;ON;<vertical> 300C;;;;N;GLYPH FOR VERTICAL OPENING CORNER BRACKET;;;;
+FE42;PRESENTATION FORM FOR VERTICAL RIGHT CORNER BRACKET;Pe;0;ON;<vertical> 300D;;;;N;GLYPH FOR VERTICAL CLOSING CORNER BRACKET;;;;
+FE43;PRESENTATION FORM FOR VERTICAL LEFT WHITE CORNER BRACKET;Ps;0;ON;<vertical> 300E;;;;N;GLYPH FOR VERTICAL OPENING WHITE CORNER BRACKET;;;;
+FE44;PRESENTATION FORM FOR VERTICAL RIGHT WHITE CORNER BRACKET;Pe;0;ON;<vertical> 300F;;;;N;GLYPH FOR VERTICAL CLOSING WHITE CORNER BRACKET;;;;
+FE45;SESAME DOT;Po;0;ON;;;;;N;;;;;
+FE46;WHITE SESAME DOT;Po;0;ON;;;;;N;;;;;
+FE47;PRESENTATION FORM FOR VERTICAL LEFT SQUARE BRACKET;Ps;0;ON;<vertical> 005B;;;;N;;;;;
+FE48;PRESENTATION FORM FOR VERTICAL RIGHT SQUARE BRACKET;Pe;0;ON;<vertical> 005D;;;;N;;;;;
+FE49;DASHED OVERLINE;Po;0;ON;<compat> 203E;;;;N;SPACING DASHED OVERSCORE;;;;
+FE4A;CENTRELINE OVERLINE;Po;0;ON;<compat> 203E;;;;N;SPACING CENTERLINE OVERSCORE;;;;
+FE4B;WAVY OVERLINE;Po;0;ON;<compat> 203E;;;;N;SPACING WAVY OVERSCORE;;;;
+FE4C;DOUBLE WAVY OVERLINE;Po;0;ON;<compat> 203E;;;;N;SPACING DOUBLE WAVY OVERSCORE;;;;
+FE4D;DASHED LOW LINE;Pc;0;ON;<compat> 005F;;;;N;SPACING DASHED UNDERSCORE;;;;
+FE4E;CENTRELINE LOW LINE;Pc;0;ON;<compat> 005F;;;;N;SPACING CENTERLINE UNDERSCORE;;;;
+FE4F;WAVY LOW LINE;Pc;0;ON;<compat> 005F;;;;N;SPACING WAVY UNDERSCORE;;;;
+FE50;SMALL COMMA;Po;0;CS; 002C;;;;N;;;;;
+FE51;SMALL IDEOGRAPHIC COMMA;Po;0;ON; 3001;;;;N;;;;;
+FE52;SMALL FULL STOP;Po;0;CS; 002E;;;;N;SMALL PERIOD;;;;
+FE54;SMALL SEMICOLON;Po;0;ON; 003B;;;;N;;;;;
+FE55;SMALL COLON;Po;0;CS; 003A;;;;N;;;;;
+FE56;SMALL QUESTION MARK;Po;0;ON; 003F;;;;N;;;;;
+FE57;SMALL EXCLAMATION MARK;Po;0;ON; 0021;;;;N;;;;;
+FE58;SMALL EM DASH;Pd;0;ON; 2014;;;;N;;;;;
+FE59;SMALL LEFT PARENTHESIS;Ps;0;ON; 0028;;;;Y;SMALL OPENING PARENTHESIS;;;;
+FE5A;SMALL RIGHT PARENTHESIS;Pe;0;ON; 0029;;;;Y;SMALL CLOSING PARENTHESIS;;;;
+FE5B;SMALL LEFT CURLY BRACKET;Ps;0;ON; 007B;;;;Y;SMALL OPENING CURLY BRACKET;;;;
+FE5C;SMALL RIGHT CURLY BRACKET;Pe;0;ON; 007D;;;;Y;SMALL CLOSING CURLY BRACKET;;;;
+FE5D;SMALL LEFT TORTOISE SHELL BRACKET;Ps;0;ON; 3014;;;;Y;SMALL OPENING TORTOISE SHELL BRACKET;;;;
+FE5E;SMALL RIGHT TORTOISE SHELL BRACKET;Pe;0;ON; 3015;;;;Y;SMALL CLOSING TORTOISE SHELL BRACKET;;;;
+FE5F;SMALL NUMBER SIGN;Po;0;ET; 0023;;;;N;;;;;
+FE60;SMALL AMPERSAND;Po;0;ON; 0026;;;;N;;;;;
+FE61;SMALL ASTERISK;Po;0;ON; 002A;;;;N;;;;;
+FE62;SMALL PLUS SIGN;Sm;0;ES; 002B;;;;N;;;;;
+FE63;SMALL HYPHEN-MINUS;Pd;0;ES; 002D;;;;N;;;;;
+FE64;SMALL LESS-THAN SIGN;Sm;0;ON; 003C;;;;Y;;;;;
+FE65;SMALL GREATER-THAN SIGN;Sm;0;ON; 003E;;;;Y;;;;;
+FE66;SMALL EQUALS SIGN;Sm;0;ON; 003D;;;;N;;;;;
+FE68;SMALL REVERSE SOLIDUS;Po;0;ON; 005C;;;;N;SMALL BACKSLASH;;;;
+FE69;SMALL DOLLAR SIGN;Sc;0;ET; 0024;;;;N;;;;;
+FE6A;SMALL PERCENT SIGN;Po;0;ET; 0025;;;;N;;;;;
+FE6B;SMALL COMMERCIAL AT;Po;0;ON; 0040;;;;N;;;;;
+FE70;ARABIC FATHATAN ISOLATED FORM;Lo;0;AL;<isolated> 0020 064B;;;;N;ARABIC SPACING FATHATAN;;;;
+FE71;ARABIC TATWEEL WITH FATHATAN ABOVE;Lo;0;AL;<medial> 0640 064B;;;;N;ARABIC FATHATAN ON TATWEEL;;;;
+FE72;ARABIC DAMMATAN ISOLATED FORM;Lo;0;AL;<isolated> 0020 064C;;;;N;ARABIC SPACING DAMMATAN;;;;
+FE73;ARABIC TAIL FRAGMENT;Lo;0;AL;;;;;N;;;;;
+FE74;ARABIC KASRATAN ISOLATED FORM;Lo;0;AL;<isolated> 0020 064D;;;;N;ARABIC SPACING KASRATAN;;;;
+FE76;ARABIC FATHA ISOLATED FORM;Lo;0;AL;<isolated> 0020 064E;;;;N;ARABIC SPACING FATHAH;;;;
+FE77;ARABIC FATHA MEDIAL FORM;Lo;0;AL;<medial> 0640 064E;;;;N;ARABIC FATHAH ON TATWEEL;;;;
+FE78;ARABIC DAMMA ISOLATED FORM;Lo;0;AL;<isolated> 0020 064F;;;;N;ARABIC SPACING DAMMAH;;;;
+FE79;ARABIC DAMMA MEDIAL FORM;Lo;0;AL;<medial> 0640 064F;;;;N;ARABIC DAMMAH ON TATWEEL;;;;
+FE7A;ARABIC KASRA ISOLATED FORM;Lo;0;AL;<isolated> 0020 0650;;;;N;ARABIC SPACING KASRAH;;;;
+FE7B;ARABIC KASRA MEDIAL FORM;Lo;0;AL;<medial> 0640 0650;;;;N;ARABIC KASRAH ON TATWEEL;;;;
+FE7C;ARABIC SHADDA ISOLATED FORM;Lo;0;AL;<isolated> 0020 0651;;;;N;ARABIC SPACING SHADDAH;;;;
+FE7D;ARABIC SHADDA MEDIAL FORM;Lo;0;AL;<medial> 0640 0651;;;;N;ARABIC SHADDAH ON TATWEEL;;;;
+FE7E;ARABIC SUKUN ISOLATED FORM;Lo;0;AL;<isolated> 0020 0652;;;;N;ARABIC SPACING SUKUN;;;;
+FE7F;ARABIC SUKUN MEDIAL FORM;Lo;0;AL;<medial> 0640 0652;;;;N;ARABIC SUKUN ON TATWEEL;;;;
+FE80;ARABIC LETTER HAMZA ISOLATED FORM;Lo;0;AL;<isolated> 0621;;;;N;GLYPH FOR ISOLATE ARABIC HAMZAH;;;;
+FE81;ARABIC LETTER ALEF WITH MADDA ABOVE ISOLATED FORM;Lo;0;AL;<isolated> 0622;;;;N;GLYPH FOR ISOLATE ARABIC MADDAH ON ALEF;;;;
+FE82;ARABIC LETTER ALEF WITH MADDA ABOVE FINAL FORM;Lo;0;AL;<final> 0622;;;;N;GLYPH FOR FINAL ARABIC MADDAH ON ALEF;;;;
+FE83;ARABIC LETTER ALEF WITH HAMZA ABOVE ISOLATED FORM;Lo;0;AL;<isolated> 0623;;;;N;GLYPH FOR ISOLATE ARABIC HAMZAH ON ALEF;;;;
+FE84;ARABIC LETTER ALEF WITH HAMZA ABOVE FINAL FORM;Lo;0;AL;<final> 0623;;;;N;GLYPH FOR FINAL ARABIC HAMZAH ON ALEF;;;;
+FE85;ARABIC LETTER WAW WITH HAMZA ABOVE ISOLATED FORM;Lo;0;AL;<isolated> 0624;;;;N;GLYPH FOR ISOLATE ARABIC HAMZAH ON WAW;;;;
+FE86;ARABIC LETTER WAW WITH HAMZA ABOVE FINAL FORM;Lo;0;AL;<final> 0624;;;;N;GLYPH FOR FINAL ARABIC HAMZAH ON WAW;;;;
+FE87;ARABIC LETTER ALEF WITH HAMZA BELOW ISOLATED FORM;Lo;0;AL;<isolated> 0625;;;;N;GLYPH FOR ISOLATE ARABIC HAMZAH UNDER ALEF;;;;
+FE88;ARABIC LETTER ALEF WITH HAMZA BELOW FINAL FORM;Lo;0;AL;<final> 0625;;;;N;GLYPH FOR FINAL ARABIC HAMZAH UNDER ALEF;;;;
+FE89;ARABIC LETTER YEH WITH HAMZA ABOVE ISOLATED FORM;Lo;0;AL;<isolated> 0626;;;;N;GLYPH FOR ISOLATE ARABIC HAMZAH ON YA;;;;
+FE8A;ARABIC LETTER YEH WITH HAMZA ABOVE FINAL FORM;Lo;0;AL;<final> 0626;;;;N;GLYPH FOR FINAL ARABIC HAMZAH ON YA;;;;
+FE8B;ARABIC LETTER YEH WITH HAMZA ABOVE INITIAL FORM;Lo;0;AL;<initial> 0626;;;;N;GLYPH FOR INITIAL ARABIC HAMZAH ON YA;;;;
+FE8C;ARABIC LETTER YEH WITH HAMZA ABOVE MEDIAL FORM;Lo;0;AL;<medial> 0626;;;;N;GLYPH FOR MEDIAL ARABIC HAMZAH ON YA;;;;
+FE8D;ARABIC LETTER ALEF ISOLATED FORM;Lo;0;AL;<isolated> 0627;;;;N;GLYPH FOR ISOLATE ARABIC ALEF;;;;
+FE8E;ARABIC LETTER ALEF FINAL FORM;Lo;0;AL;<final> 0627;;;;N;GLYPH FOR FINAL ARABIC ALEF;;;;
+FE8F;ARABIC LETTER BEH ISOLATED FORM;Lo;0;AL;<isolated> 0628;;;;N;GLYPH FOR ISOLATE ARABIC BAA;;;;
+FE90;ARABIC LETTER BEH FINAL FORM;Lo;0;AL;<final> 0628;;;;N;GLYPH FOR FINAL ARABIC BAA;;;;
+FE91;ARABIC LETTER BEH INITIAL FORM;Lo;0;AL;<initial> 0628;;;;N;GLYPH FOR INITIAL ARABIC BAA;;;;
+FE92;ARABIC LETTER BEH MEDIAL FORM;Lo;0;AL;<medial> 0628;;;;N;GLYPH FOR MEDIAL ARABIC BAA;;;;
+FE93;ARABIC LETTER TEH MARBUTA ISOLATED FORM;Lo;0;AL;<isolated> 0629;;;;N;GLYPH FOR ISOLATE ARABIC TAA MARBUTAH;;;;
+FE94;ARABIC LETTER TEH MARBUTA FINAL FORM;Lo;0;AL;<final> 0629;;;;N;GLYPH FOR FINAL ARABIC TAA MARBUTAH;;;;
+FE95;ARABIC LETTER TEH ISOLATED FORM;Lo;0;AL;<isolated> 062A;;;;N;GLYPH FOR ISOLATE ARABIC TAA;;;;
+FE96;ARABIC LETTER TEH FINAL FORM;Lo;0;AL;<final> 062A;;;;N;GLYPH FOR FINAL ARABIC TAA;;;;
+FE97;ARABIC LETTER TEH INITIAL FORM;Lo;0;AL;<initial> 062A;;;;N;GLYPH FOR INITIAL ARABIC TAA;;;;
+FE98;ARABIC LETTER TEH MEDIAL FORM;Lo;0;AL;<medial> 062A;;;;N;GLYPH FOR MEDIAL ARABIC TAA;;;;
+FE99;ARABIC LETTER THEH ISOLATED FORM;Lo;0;AL;<isolated> 062B;;;;N;GLYPH FOR ISOLATE ARABIC THAA;;;;
+FE9A;ARABIC LETTER THEH FINAL FORM;Lo;0;AL;<final> 062B;;;;N;GLYPH FOR FINAL ARABIC THAA;;;;
+FE9B;ARABIC LETTER THEH INITIAL FORM;Lo;0;AL;<initial> 062B;;;;N;GLYPH FOR INITIAL ARABIC THAA;;;;
+FE9C;ARABIC LETTER THEH MEDIAL FORM;Lo;0;AL;<medial> 062B;;;;N;GLYPH FOR MEDIAL ARABIC THAA;;;;
+FE9D;ARABIC LETTER JEEM ISOLATED FORM;Lo;0;AL;<isolated> 062C;;;;N;GLYPH FOR ISOLATE ARABIC JEEM;;;;
+FE9E;ARABIC LETTER JEEM FINAL FORM;Lo;0;AL;<final> 062C;;;;N;GLYPH FOR FINAL ARABIC JEEM;;;;
+FE9F;ARABIC LETTER JEEM INITIAL FORM;Lo;0;AL;<initial> 062C;;;;N;GLYPH FOR INITIAL ARABIC JEEM;;;;
+FEA0;ARABIC LETTER JEEM MEDIAL FORM;Lo;0;AL;<medial> 062C;;;;N;GLYPH FOR MEDIAL ARABIC JEEM;;;;
+FEA1;ARABIC LETTER HAH ISOLATED FORM;Lo;0;AL;<isolated> 062D;;;;N;GLYPH FOR ISOLATE ARABIC HAA;;;;
+FEA2;ARABIC LETTER HAH FINAL FORM;Lo;0;AL;<final> 062D;;;;N;GLYPH FOR FINAL ARABIC HAA;;;;
+FEA3;ARABIC LETTER HAH INITIAL FORM;Lo;0;AL;<initial> 062D;;;;N;GLYPH FOR INITIAL ARABIC HAA;;;;
+FEA4;ARABIC LETTER HAH MEDIAL FORM;Lo;0;AL;<medial> 062D;;;;N;GLYPH FOR MEDIAL ARABIC HAA;;;;
+FEA5;ARABIC LETTER KHAH ISOLATED FORM;Lo;0;AL;<isolated> 062E;;;;N;GLYPH FOR ISOLATE ARABIC KHAA;;;;
+FEA6;ARABIC LETTER KHAH FINAL FORM;Lo;0;AL;<final> 062E;;;;N;GLYPH FOR FINAL ARABIC KHAA;;;;
+FEA7;ARABIC LETTER KHAH INITIAL FORM;Lo;0;AL;<initial> 062E;;;;N;GLYPH FOR INITIAL ARABIC KHAA;;;;
+FEA8;ARABIC LETTER KHAH MEDIAL FORM;Lo;0;AL;<medial> 062E;;;;N;GLYPH FOR MEDIAL ARABIC KHAA;;;;
+FEA9;ARABIC LETTER DAL ISOLATED FORM;Lo;0;AL;<isolated> 062F;;;;N;GLYPH FOR ISOLATE ARABIC DAL;;;;
+FEAA;ARABIC LETTER DAL FINAL FORM;Lo;0;AL;<final> 062F;;;;N;GLYPH FOR FINAL ARABIC DAL;;;;
+FEAB;ARABIC LETTER THAL ISOLATED FORM;Lo;0;AL;<isolated> 0630;;;;N;GLYPH FOR ISOLATE ARABIC THAL;;;;
+FEAC;ARABIC LETTER THAL FINAL FORM;Lo;0;AL;<final> 0630;;;;N;GLYPH FOR FINAL ARABIC THAL;;;;
+FEAD;ARABIC LETTER REH ISOLATED FORM;Lo;0;AL;<isolated> 0631;;;;N;GLYPH FOR ISOLATE ARABIC RA;;;;
+FEAE;ARABIC LETTER REH FINAL FORM;Lo;0;AL;<final> 0631;;;;N;GLYPH FOR FINAL ARABIC RA;;;;
+FEAF;ARABIC LETTER ZAIN ISOLATED FORM;Lo;0;AL;<isolated> 0632;;;;N;GLYPH FOR ISOLATE ARABIC ZAIN;;;;
+FEB0;ARABIC LETTER ZAIN FINAL FORM;Lo;0;AL;<final> 0632;;;;N;GLYPH FOR FINAL ARABIC ZAIN;;;;
+FEB1;ARABIC LETTER SEEN ISOLATED FORM;Lo;0;AL;<isolated> 0633;;;;N;GLYPH FOR ISOLATE ARABIC SEEN;;;;
+FEB2;ARABIC LETTER SEEN FINAL FORM;Lo;0;AL;<final> 0633;;;;N;GLYPH FOR FINAL ARABIC SEEN;;;;
+FEB3;ARABIC LETTER SEEN INITIAL FORM;Lo;0;AL;<initial> 0633;;;;N;GLYPH FOR INITIAL ARABIC SEEN;;;;
+FEB4;ARABIC LETTER SEEN MEDIAL FORM;Lo;0;AL;<medial> 0633;;;;N;GLYPH FOR MEDIAL ARABIC SEEN;;;;
+FEB5;ARABIC LETTER SHEEN ISOLATED FORM;Lo;0;AL;<isolated> 0634;;;;N;GLYPH FOR ISOLATE ARABIC SHEEN;;;;
+FEB6;ARABIC LETTER SHEEN FINAL FORM;Lo;0;AL;<final> 0634;;;;N;GLYPH FOR FINAL ARABIC SHEEN;;;;
+FEB7;ARABIC LETTER SHEEN INITIAL FORM;Lo;0;AL;<initial> 0634;;;;N;GLYPH FOR INITIAL ARABIC SHEEN;;;;
+FEB8;ARABIC LETTER SHEEN MEDIAL FORM;Lo;0;AL;<medial> 0634;;;;N;GLYPH FOR MEDIAL ARABIC SHEEN;;;;
+FEB9;ARABIC LETTER SAD ISOLATED FORM;Lo;0;AL;<isolated> 0635;;;;N;GLYPH FOR ISOLATE ARABIC SAD;;;;
+FEBA;ARABIC LETTER SAD FINAL FORM;Lo;0;AL;<final> 0635;;;;N;GLYPH FOR FINAL ARABIC SAD;;;;
+FEBB;ARABIC LETTER SAD INITIAL FORM;Lo;0;AL;<initial> 0635;;;;N;GLYPH FOR INITIAL ARABIC SAD;;;;
+FEBC;ARABIC LETTER SAD MEDIAL FORM;Lo;0;AL;<medial> 0635;;;;N;GLYPH FOR MEDIAL ARABIC SAD;;;;
+FEBD;ARABIC LETTER DAD ISOLATED FORM;Lo;0;AL;<isolated> 0636;;;;N;GLYPH FOR ISOLATE ARABIC DAD;;;;
+FEBE;ARABIC LETTER DAD FINAL FORM;Lo;0;AL;<final> 0636;;;;N;GLYPH FOR FINAL ARABIC DAD;;;;
+FEBF;ARABIC LETTER DAD INITIAL FORM;Lo;0;AL;<initial> 0636;;;;N;GLYPH FOR INITIAL ARABIC DAD;;;;
+FEC0;ARABIC LETTER DAD MEDIAL FORM;Lo;0;AL;<medial> 0636;;;;N;GLYPH FOR MEDIAL ARABIC DAD;;;;
+FEC1;ARABIC LETTER TAH ISOLATED FORM;Lo;0;AL;<isolated> 0637;;;;N;GLYPH FOR ISOLATE ARABIC TAH;;;;
+FEC2;ARABIC LETTER TAH FINAL FORM;Lo;0;AL;<final> 0637;;;;N;GLYPH FOR FINAL ARABIC TAH;;;;
+FEC3;ARABIC LETTER TAH INITIAL FORM;Lo;0;AL;<initial> 0637;;;;N;GLYPH FOR INITIAL ARABIC TAH;;;;
+FEC4;ARABIC LETTER TAH MEDIAL FORM;Lo;0;AL;<medial> 0637;;;;N;GLYPH FOR MEDIAL ARABIC TAH;;;;
+FEC5;ARABIC LETTER ZAH ISOLATED FORM;Lo;0;AL;<isolated> 0638;;;;N;GLYPH FOR ISOLATE ARABIC DHAH;;;;
+FEC6;ARABIC LETTER ZAH FINAL FORM;Lo;0;AL;<final> 0638;;;;N;GLYPH FOR FINAL ARABIC DHAH;;;;
+FEC7;ARABIC LETTER ZAH INITIAL FORM;Lo;0;AL;<initial> 0638;;;;N;GLYPH FOR INITIAL ARABIC DHAH;;;;
+FEC8;ARABIC LETTER ZAH MEDIAL FORM;Lo;0;AL;<medial> 0638;;;;N;GLYPH FOR MEDIAL ARABIC DHAH;;;;
+FEC9;ARABIC LETTER AIN ISOLATED FORM;Lo;0;AL;<isolated> 0639;;;;N;GLYPH FOR ISOLATE ARABIC AIN;;;;
+FECA;ARABIC LETTER AIN FINAL FORM;Lo;0;AL;<final> 0639;;;;N;GLYPH FOR FINAL ARABIC AIN;;;;
+FECB;ARABIC LETTER AIN INITIAL FORM;Lo;0;AL;<initial> 0639;;;;N;GLYPH FOR INITIAL ARABIC AIN;;;;
+FECC;ARABIC LETTER AIN MEDIAL FORM;Lo;0;AL;<medial> 0639;;;;N;GLYPH FOR MEDIAL ARABIC AIN;;;;
+FECD;ARABIC LETTER GHAIN ISOLATED FORM;Lo;0;AL;<isolated> 063A;;;;N;GLYPH FOR ISOLATE ARABIC GHAIN;;;;
+FECE;ARABIC LETTER GHAIN FINAL FORM;Lo;0;AL;<final> 063A;;;;N;GLYPH FOR FINAL ARABIC GHAIN;;;;
+FECF;ARABIC LETTER GHAIN INITIAL FORM;Lo;0;AL;<initial> 063A;;;;N;GLYPH FOR INITIAL ARABIC GHAIN;;;;
+FED0;ARABIC LETTER GHAIN MEDIAL FORM;Lo;0;AL;<medial> 063A;;;;N;GLYPH FOR MEDIAL ARABIC GHAIN;;;;
+FED1;ARABIC LETTER FEH ISOLATED FORM;Lo;0;AL;<isolated> 0641;;;;N;GLYPH FOR ISOLATE ARABIC FA;;;;
+FED2;ARABIC LETTER FEH FINAL FORM;Lo;0;AL;<final> 0641;;;;N;GLYPH FOR FINAL ARABIC FA;;;;
+FED3;ARABIC LETTER FEH INITIAL FORM;Lo;0;AL;<initial> 0641;;;;N;GLYPH FOR INITIAL ARABIC FA;;;;
+FED4;ARABIC LETTER FEH MEDIAL FORM;Lo;0;AL;<medial> 0641;;;;N;GLYPH FOR MEDIAL ARABIC FA;;;;
+FED5;ARABIC LETTER QAF ISOLATED FORM;Lo;0;AL;<isolated> 0642;;;;N;GLYPH FOR ISOLATE ARABIC QAF;;;;
+FED6;ARABIC LETTER QAF FINAL FORM;Lo;0;AL;<final> 0642;;;;N;GLYPH FOR FINAL ARABIC QAF;;;;
+FED7;ARABIC LETTER QAF INITIAL FORM;Lo;0;AL;<initial> 0642;;;;N;GLYPH FOR INITIAL ARABIC QAF;;;;
+FED8;ARABIC LETTER QAF MEDIAL FORM;Lo;0;AL;<medial> 0642;;;;N;GLYPH FOR MEDIAL ARABIC QAF;;;;
+FED9;ARABIC LETTER KAF ISOLATED FORM;Lo;0;AL;<isolated> 0643;;;;N;GLYPH FOR ISOLATE ARABIC CAF;;;;
+FEDA;ARABIC LETTER KAF FINAL FORM;Lo;0;AL;<final> 0643;;;;N;GLYPH FOR FINAL ARABIC CAF;;;;
+FEDB;ARABIC LETTER KAF INITIAL FORM;Lo;0;AL;<initial> 0643;;;;N;GLYPH FOR INITIAL ARABIC CAF;;;;
+FEDC;ARABIC LETTER KAF MEDIAL FORM;Lo;0;AL;<medial> 0643;;;;N;GLYPH FOR MEDIAL ARABIC CAF;;;;
+FEDD;ARABIC LETTER LAM ISOLATED FORM;Lo;0;AL;<isolated> 0644;;;;N;GLYPH FOR ISOLATE ARABIC LAM;;;;
+FEDE;ARABIC LETTER LAM FINAL FORM;Lo;0;AL;<final> 0644;;;;N;GLYPH FOR FINAL ARABIC LAM;;;;
+FEDF;ARABIC LETTER LAM INITIAL FORM;Lo;0;AL;<initial> 0644;;;;N;GLYPH FOR INITIAL ARABIC LAM;;;;
+FEE0;ARABIC LETTER LAM MEDIAL FORM;Lo;0;AL;<medial> 0644;;;;N;GLYPH FOR MEDIAL ARABIC LAM;;;;
+FEE1;ARABIC LETTER MEEM ISOLATED FORM;Lo;0;AL;<isolated> 0645;;;;N;GLYPH FOR ISOLATE ARABIC MEEM;;;;
+FEE2;ARABIC LETTER MEEM FINAL FORM;Lo;0;AL;<final> 0645;;;;N;GLYPH FOR FINAL ARABIC MEEM;;;;
+FEE3;ARABIC LETTER MEEM INITIAL FORM;Lo;0;AL;<initial> 0645;;;;N;GLYPH FOR INITIAL ARABIC MEEM;;;;
+FEE4;ARABIC LETTER MEEM MEDIAL FORM;Lo;0;AL;<medial> 0645;;;;N;GLYPH FOR MEDIAL ARABIC MEEM;;;;
+FEE5;ARABIC LETTER NOON ISOLATED FORM;Lo;0;AL;<isolated> 0646;;;;N;GLYPH FOR ISOLATE ARABIC NOON;;;;
+FEE6;ARABIC LETTER NOON FINAL FORM;Lo;0;AL;<final> 0646;;;;N;GLYPH FOR FINAL ARABIC NOON;;;;
+FEE7;ARABIC LETTER NOON INITIAL FORM;Lo;0;AL;<initial> 0646;;;;N;GLYPH FOR INITIAL ARABIC NOON;;;;
+FEE8;ARABIC LETTER NOON MEDIAL FORM;Lo;0;AL;<medial> 0646;;;;N;GLYPH FOR MEDIAL ARABIC NOON;;;;
+FEE9;ARABIC LETTER HEH ISOLATED FORM;Lo;0;AL;<isolated> 0647;;;;N;GLYPH FOR ISOLATE ARABIC HA;;;;
+FEEA;ARABIC LETTER HEH FINAL FORM;Lo;0;AL;<final> 0647;;;;N;GLYPH FOR FINAL ARABIC HA;;;;
+FEEB;ARABIC LETTER HEH INITIAL FORM;Lo;0;AL;<initial> 0647;;;;N;GLYPH FOR INITIAL ARABIC HA;;;;
+FEEC;ARABIC LETTER HEH MEDIAL FORM;Lo;0;AL;<medial> 0647;;;;N;GLYPH FOR MEDIAL ARABIC HA;;;;
+FEED;ARABIC LETTER WAW ISOLATED FORM;Lo;0;AL;<isolated> 0648;;;;N;GLYPH FOR ISOLATE ARABIC WAW;;;;
+FEEE;ARABIC LETTER WAW FINAL FORM;Lo;0;AL;<final> 0648;;;;N;GLYPH FOR FINAL ARABIC WAW;;;;
+FEEF;ARABIC LETTER ALEF MAKSURA ISOLATED FORM;Lo;0;AL;<isolated> 0649;;;;N;GLYPH FOR ISOLATE ARABIC ALEF MAQSURAH;;;;
+FEF0;ARABIC LETTER ALEF MAKSURA FINAL FORM;Lo;0;AL;<final> 0649;;;;N;GLYPH FOR FINAL ARABIC ALEF MAQSURAH;;;;
+FEF1;ARABIC LETTER YEH ISOLATED FORM;Lo;0;AL;<isolated> 064A;;;;N;GLYPH FOR ISOLATE ARABIC YA;;;;
+FEF2;ARABIC LETTER YEH FINAL FORM;Lo;0;AL;<final> 064A;;;;N;GLYPH FOR FINAL ARABIC YA;;;;
+FEF3;ARABIC LETTER YEH INITIAL FORM;Lo;0;AL;<initial> 064A;;;;N;GLYPH FOR INITIAL ARABIC YA;;;;
+FEF4;ARABIC LETTER YEH MEDIAL FORM;Lo;0;AL;<medial> 064A;;;;N;GLYPH FOR MEDIAL ARABIC YA;;;;
+FEF5;ARABIC LIGATURE LAM WITH ALEF WITH MADDA ABOVE ISOLATED FORM;Lo;0;AL;<isolated> 0644 0622;;;;N;GLYPH FOR ISOLATE ARABIC MADDAH ON LIGATURE LAM ALEF;;;;
+FEF6;ARABIC LIGATURE LAM WITH ALEF WITH MADDA ABOVE FINAL FORM;Lo;0;AL;<final> 0644 0622;;;;N;GLYPH FOR FINAL ARABIC MADDAH ON LIGATURE LAM ALEF;;;;
+FEF7;ARABIC LIGATURE LAM WITH ALEF WITH HAMZA ABOVE ISOLATED FORM;Lo;0;AL;<isolated> 0644 0623;;;;N;GLYPH FOR ISOLATE ARABIC HAMZAH ON LIGATURE LAM ALEF;;;;
+FEF8;ARABIC LIGATURE LAM WITH ALEF WITH HAMZA ABOVE FINAL FORM;Lo;0;AL;<final> 0644 0623;;;;N;GLYPH FOR FINAL ARABIC HAMZAH ON LIGATURE LAM ALEF;;;;
+FEF9;ARABIC LIGATURE LAM WITH ALEF WITH HAMZA BELOW ISOLATED FORM;Lo;0;AL;<isolated> 0644 0625;;;;N;GLYPH FOR ISOLATE ARABIC HAMZAH UNDER LIGATURE LAM ALEF;;;;
+FEFA;ARABIC LIGATURE LAM WITH ALEF WITH HAMZA BELOW FINAL FORM;Lo;0;AL;<final> 0644 0625;;;;N;GLYPH FOR FINAL ARABIC HAMZAH UNDER LIGATURE LAM ALEF;;;;
+FEFB;ARABIC LIGATURE LAM WITH ALEF ISOLATED FORM;Lo;0;AL;<isolated> 0644 0627;;;;N;GLYPH FOR ISOLATE ARABIC LIGATURE LAM ALEF;;;;
+FEFC;ARABIC LIGATURE LAM WITH ALEF FINAL FORM;Lo;0;AL;<final> 0644 0627;;;;N;GLYPH FOR FINAL ARABIC LIGATURE LAM ALEF;;;;
+FEFF;ZERO WIDTH NO-BREAK SPACE;Cf;0;BN;;;;;N;BYTE ORDER MARK;;;;
+FF01;FULLWIDTH EXCLAMATION MARK;Po;0;ON;<wide> 0021;;;;N;;;;;
+FF02;FULLWIDTH QUOTATION MARK;Po;0;ON;<wide> 0022;;;;N;;;;;
+FF03;FULLWIDTH NUMBER SIGN;Po;0;ET;<wide> 0023;;;;N;;;;;
+FF04;FULLWIDTH DOLLAR SIGN;Sc;0;ET;<wide> 0024;;;;N;;;;;
+FF05;FULLWIDTH PERCENT SIGN;Po;0;ET;<wide> 0025;;;;N;;;;;
+FF06;FULLWIDTH AMPERSAND;Po;0;ON;<wide> 0026;;;;N;;;;;
+FF07;FULLWIDTH APOSTROPHE;Po;0;ON;<wide> 0027;;;;N;;;;;
+FF08;FULLWIDTH LEFT PARENTHESIS;Ps;0;ON;<wide> 0028;;;;Y;FULLWIDTH OPENING PARENTHESIS;;;;
+FF09;FULLWIDTH RIGHT PARENTHESIS;Pe;0;ON;<wide> 0029;;;;Y;FULLWIDTH CLOSING PARENTHESIS;;;;
+FF0A;FULLWIDTH ASTERISK;Po;0;ON;<wide> 002A;;;;N;;;;;
+FF0B;FULLWIDTH PLUS SIGN;Sm;0;ES;<wide> 002B;;;;N;;;;;
+FF0C;FULLWIDTH COMMA;Po;0;CS;<wide> 002C;;;;N;;;;;
+FF0D;FULLWIDTH HYPHEN-MINUS;Pd;0;ES;<wide> 002D;;;;N;;;;;
+FF0E;FULLWIDTH FULL STOP;Po;0;CS;<wide> 002E;;;;N;FULLWIDTH PERIOD;;;;
+FF0F;FULLWIDTH SOLIDUS;Po;0;CS;<wide> 002F;;;;N;FULLWIDTH SLASH;;;;
+FF10;FULLWIDTH DIGIT ZERO;Nd;0;EN;<wide> 0030;0;0;0;N;;;;;
+FF11;FULLWIDTH DIGIT ONE;Nd;0;EN;<wide> 0031;1;1;1;N;;;;;
+FF12;FULLWIDTH DIGIT TWO;Nd;0;EN;<wide> 0032;2;2;2;N;;;;;
+FF13;FULLWIDTH DIGIT THREE;Nd;0;EN;<wide> 0033;3;3;3;N;;;;;
+FF14;FULLWIDTH DIGIT FOUR;Nd;0;EN;<wide> 0034;4;4;4;N;;;;;
+FF15;FULLWIDTH DIGIT FIVE;Nd;0;EN;<wide> 0035;5;5;5;N;;;;;
+FF16;FULLWIDTH DIGIT SIX;Nd;0;EN;<wide> 0036;6;6;6;N;;;;;
+FF17;FULLWIDTH DIGIT SEVEN;Nd;0;EN;<wide> 0037;7;7;7;N;;;;;
+FF18;FULLWIDTH DIGIT EIGHT;Nd;0;EN;<wide> 0038;8;8;8;N;;;;;
+FF19;FULLWIDTH DIGIT NINE;Nd;0;EN;<wide> 0039;9;9;9;N;;;;;
+FF1A;FULLWIDTH COLON;Po;0;CS;<wide> 003A;;;;N;;;;;
+FF1B;FULLWIDTH SEMICOLON;Po;0;ON;<wide> 003B;;;;N;;;;;
+FF1C;FULLWIDTH LESS-THAN SIGN;Sm;0;ON;<wide> 003C;;;;Y;;;;;
+FF1D;FULLWIDTH EQUALS SIGN;Sm;0;ON;<wide> 003D;;;;N;;;;;
+FF1E;FULLWIDTH GREATER-THAN SIGN;Sm;0;ON;<wide> 003E;;;;Y;;;;;
+FF1F;FULLWIDTH QUESTION MARK;Po;0;ON;<wide> 003F;;;;N;;;;;
+FF20;FULLWIDTH COMMERCIAL AT;Po;0;ON;<wide> 0040;;;;N;;;;;
+FF21;FULLWIDTH LATIN CAPITAL LETTER A;Lu;0;L;<wide> 0041;;;;N;;;;FF41;
+FF22;FULLWIDTH LATIN CAPITAL LETTER B;Lu;0;L;<wide> 0042;;;;N;;;;FF42;
+FF23;FULLWIDTH LATIN CAPITAL LETTER C;Lu;0;L;<wide> 0043;;;;N;;;;FF43;
+FF24;FULLWIDTH LATIN CAPITAL LETTER D;Lu;0;L;<wide> 0044;;;;N;;;;FF44;
+FF25;FULLWIDTH LATIN CAPITAL LETTER E;Lu;0;L;<wide> 0045;;;;N;;;;FF45;
+FF26;FULLWIDTH LATIN CAPITAL LETTER F;Lu;0;L;<wide> 0046;;;;N;;;;FF46;
+FF27;FULLWIDTH LATIN CAPITAL LETTER G;Lu;0;L;<wide> 0047;;;;N;;;;FF47;
+FF28;FULLWIDTH LATIN CAPITAL LETTER H;Lu;0;L;<wide> 0048;;;;N;;;;FF48;
+FF29;FULLWIDTH LATIN CAPITAL LETTER I;Lu;0;L;<wide> 0049;;;;N;;;;FF49;
+FF2A;FULLWIDTH LATIN CAPITAL LETTER J;Lu;0;L;<wide> 004A;;;;N;;;;FF4A;
+FF2B;FULLWIDTH LATIN CAPITAL LETTER K;Lu;0;L;<wide> 004B;;;;N;;;;FF4B;
+FF2C;FULLWIDTH LATIN CAPITAL LETTER L;Lu;0;L;<wide> 004C;;;;N;;;;FF4C;
+FF2D;FULLWIDTH LATIN CAPITAL LETTER M;Lu;0;L;<wide> 004D;;;;N;;;;FF4D;
+FF2E;FULLWIDTH LATIN CAPITAL LETTER N;Lu;0;L;<wide> 004E;;;;N;;;;FF4E;
+FF2F;FULLWIDTH LATIN CAPITAL LETTER O;Lu;0;L;<wide> 004F;;;;N;;;;FF4F;
+FF30;FULLWIDTH LATIN CAPITAL LETTER P;Lu;0;L;<wide> 0050;;;;N;;;;FF50;
+FF31;FULLWIDTH LATIN CAPITAL LETTER Q;Lu;0;L;<wide> 0051;;;;N;;;;FF51;
+FF32;FULLWIDTH LATIN CAPITAL LETTER R;Lu;0;L;<wide> 0052;;;;N;;;;FF52;
+FF33;FULLWIDTH LATIN CAPITAL LETTER S;Lu;0;L;<wide> 0053;;;;N;;;;FF53;
+FF34;FULLWIDTH LATIN CAPITAL LETTER T;Lu;0;L;<wide> 0054;;;;N;;;;FF54;
+FF35;FULLWIDTH LATIN CAPITAL LETTER U;Lu;0;L;<wide> 0055;;;;N;;;;FF55;
+FF36;FULLWIDTH LATIN CAPITAL LETTER V;Lu;0;L;<wide> 0056;;;;N;;;;FF56;
+FF37;FULLWIDTH LATIN CAPITAL LETTER W;Lu;0;L;<wide> 0057;;;;N;;;;FF57;
+FF38;FULLWIDTH LATIN CAPITAL LETTER X;Lu;0;L;<wide> 0058;;;;N;;;;FF58;
+FF39;FULLWIDTH LATIN CAPITAL LETTER Y;Lu;0;L;<wide> 0059;;;;N;;;;FF59;
+FF3A;FULLWIDTH LATIN CAPITAL LETTER Z;Lu;0;L;<wide> 005A;;;;N;;;;FF5A;
+FF3B;FULLWIDTH LEFT SQUARE BRACKET;Ps;0;ON;<wide> 005B;;;;Y;FULLWIDTH OPENING SQUARE BRACKET;;;;
+FF3C;FULLWIDTH REVERSE SOLIDUS;Po;0;ON;<wide> 005C;;;;N;FULLWIDTH BACKSLASH;;;;
+FF3D;FULLWIDTH RIGHT SQUARE BRACKET;Pe;0;ON;<wide> 005D;;;;Y;FULLWIDTH CLOSING SQUARE BRACKET;;;;
+FF3E;FULLWIDTH CIRCUMFLEX ACCENT;Sk;0;ON;<wide> 005E;;;;N;FULLWIDTH SPACING CIRCUMFLEX;;;;
+FF3F;FULLWIDTH LOW LINE;Pc;0;ON;<wide> 005F;;;;N;FULLWIDTH SPACING UNDERSCORE;;;;
+FF40;FULLWIDTH GRAVE ACCENT;Sk;0;ON;<wide> 0060;;;;N;FULLWIDTH SPACING GRAVE;;;;
+FF41;FULLWIDTH LATIN SMALL LETTER A;Ll;0;L;<wide> 0061;;;;N;;;FF21;;FF21
+FF42;FULLWIDTH LATIN SMALL LETTER B;Ll;0;L;<wide> 0062;;;;N;;;FF22;;FF22
+FF43;FULLWIDTH LATIN SMALL LETTER C;Ll;0;L;<wide> 0063;;;;N;;;FF23;;FF23
+FF44;FULLWIDTH LATIN SMALL LETTER D;Ll;0;L;<wide> 0064;;;;N;;;FF24;;FF24
+FF45;FULLWIDTH LATIN SMALL LETTER E;Ll;0;L;<wide> 0065;;;;N;;;FF25;;FF25
+FF46;FULLWIDTH LATIN SMALL LETTER F;Ll;0;L;<wide> 0066;;;;N;;;FF26;;FF26
+FF47;FULLWIDTH LATIN SMALL LETTER G;Ll;0;L;<wide> 0067;;;;N;;;FF27;;FF27
+FF48;FULLWIDTH LATIN SMALL LETTER H;Ll;0;L;<wide> 0068;;;;N;;;FF28;;FF28
+FF49;FULLWIDTH LATIN SMALL LETTER I;Ll;0;L;<wide> 0069;;;;N;;;FF29;;FF29
+FF4A;FULLWIDTH LATIN SMALL LETTER J;Ll;0;L;<wide> 006A;;;;N;;;FF2A;;FF2A
+FF4B;FULLWIDTH LATIN SMALL LETTER K;Ll;0;L;<wide> 006B;;;;N;;;FF2B;;FF2B
+FF4C;FULLWIDTH LATIN SMALL LETTER L;Ll;0;L;<wide> 006C;;;;N;;;FF2C;;FF2C
+FF4D;FULLWIDTH LATIN SMALL LETTER M;Ll;0;L;<wide> 006D;;;;N;;;FF2D;;FF2D
+FF4E;FULLWIDTH LATIN SMALL LETTER N;Ll;0;L;<wide> 006E;;;;N;;;FF2E;;FF2E
+FF4F;FULLWIDTH LATIN SMALL LETTER O;Ll;0;L;<wide> 006F;;;;N;;;FF2F;;FF2F
+FF50;FULLWIDTH LATIN SMALL LETTER P;Ll;0;L;<wide> 0070;;;;N;;;FF30;;FF30
+FF51;FULLWIDTH LATIN SMALL LETTER Q;Ll;0;L;<wide> 0071;;;;N;;;FF31;;FF31
+FF52;FULLWIDTH LATIN SMALL LETTER R;Ll;0;L;<wide> 0072;;;;N;;;FF32;;FF32
+FF53;FULLWIDTH LATIN SMALL LETTER S;Ll;0;L;<wide> 0073;;;;N;;;FF33;;FF33
+FF54;FULLWIDTH LATIN SMALL LETTER T;Ll;0;L;<wide> 0074;;;;N;;;FF34;;FF34
+FF55;FULLWIDTH LATIN SMALL LETTER U;Ll;0;L;<wide> 0075;;;;N;;;FF35;;FF35
+FF56;FULLWIDTH LATIN SMALL LETTER V;Ll;0;L;<wide> 0076;;;;N;;;FF36;;FF36
+FF57;FULLWIDTH LATIN SMALL LETTER W;Ll;0;L;<wide> 0077;;;;N;;;FF37;;FF37
+FF58;FULLWIDTH LATIN SMALL LETTER X;Ll;0;L;<wide> 0078;;;;N;;;FF38;;FF38
+FF59;FULLWIDTH LATIN SMALL LETTER Y;Ll;0;L;<wide> 0079;;;;N;;;FF39;;FF39
+FF5A;FULLWIDTH LATIN SMALL LETTER Z;Ll;0;L;<wide> 007A;;;;N;;;FF3A;;FF3A
+FF5B;FULLWIDTH LEFT CURLY BRACKET;Ps;0;ON;<wide> 007B;;;;Y;FULLWIDTH OPENING CURLY BRACKET;;;;
+FF5C;FULLWIDTH VERTICAL LINE;Sm;0;ON;<wide> 007C;;;;N;FULLWIDTH VERTICAL BAR;;;;
+FF5D;FULLWIDTH RIGHT CURLY BRACKET;Pe;0;ON;<wide> 007D;;;;Y;FULLWIDTH CLOSING CURLY BRACKET;;;;
+FF5E;FULLWIDTH TILDE;Sm;0;ON;<wide> 007E;;;;N;FULLWIDTH SPACING TILDE;;;;
+FF5F;FULLWIDTH LEFT WHITE PARENTHESIS;Ps;0;ON;<wide> 2985;;;;Y;;;;;
+FF60;FULLWIDTH RIGHT WHITE PARENTHESIS;Pe;0;ON;<wide> 2986;;;;Y;;;;;
+FF61;HALFWIDTH IDEOGRAPHIC FULL STOP;Po;0;ON;<narrow> 3002;;;;N;HALFWIDTH IDEOGRAPHIC PERIOD;;;;
+FF62;HALFWIDTH LEFT CORNER BRACKET;Ps;0;ON;<narrow> 300C;;;;Y;HALFWIDTH OPENING CORNER BRACKET;;;;
+FF63;HALFWIDTH RIGHT CORNER BRACKET;Pe;0;ON;<narrow> 300D;;;;Y;HALFWIDTH CLOSING CORNER BRACKET;;;;
+FF64;HALFWIDTH IDEOGRAPHIC COMMA;Po;0;ON;<narrow> 3001;;;;N;;;;;
+FF65;HALFWIDTH KATAKANA MIDDLE DOT;Po;0;ON;<narrow> 30FB;;;;N;;;;;
+FF66;HALFWIDTH KATAKANA LETTER WO;Lo;0;L;<narrow> 30F2;;;;N;;;;;
+FF67;HALFWIDTH KATAKANA LETTER SMALL A;Lo;0;L;<narrow> 30A1;;;;N;;;;;
+FF68;HALFWIDTH KATAKANA LETTER SMALL I;Lo;0;L;<narrow> 30A3;;;;N;;;;;
+FF69;HALFWIDTH KATAKANA LETTER SMALL U;Lo;0;L;<narrow> 30A5;;;;N;;;;;
+FF6A;HALFWIDTH KATAKANA LETTER SMALL E;Lo;0;L;<narrow> 30A7;;;;N;;;;;
+FF6B;HALFWIDTH KATAKANA LETTER SMALL O;Lo;0;L;<narrow> 30A9;;;;N;;;;;
+FF6C;HALFWIDTH KATAKANA LETTER SMALL YA;Lo;0;L;<narrow> 30E3;;;;N;;;;;
+FF6D;HALFWIDTH KATAKANA LETTER SMALL YU;Lo;0;L;<narrow> 30E5;;;;N;;;;;
+FF6E;HALFWIDTH KATAKANA LETTER SMALL YO;Lo;0;L;<narrow> 30E7;;;;N;;;;;
+FF6F;HALFWIDTH KATAKANA LETTER SMALL TU;Lo;0;L;<narrow> 30C3;;;;N;;;;;
+FF70;HALFWIDTH KATAKANA-HIRAGANA PROLONGED SOUND MARK;Lm;0;L;<narrow> 30FC;;;;N;;;;;
+FF71;HALFWIDTH KATAKANA LETTER A;Lo;0;L;<narrow> 30A2;;;;N;;;;;
+FF72;HALFWIDTH KATAKANA LETTER I;Lo;0;L;<narrow> 30A4;;;;N;;;;;
+FF73;HALFWIDTH KATAKANA LETTER U;Lo;0;L;<narrow> 30A6;;;;N;;;;;
+FF74;HALFWIDTH KATAKANA LETTER E;Lo;0;L;<narrow> 30A8;;;;N;;;;;
+FF75;HALFWIDTH KATAKANA LETTER O;Lo;0;L;<narrow> 30AA;;;;N;;;;;
+FF76;HALFWIDTH KATAKANA LETTER KA;Lo;0;L;<narrow> 30AB;;;;N;;;;;
+FF77;HALFWIDTH KATAKANA LETTER KI;Lo;0;L;<narrow> 30AD;;;;N;;;;;
+FF78;HALFWIDTH KATAKANA LETTER KU;Lo;0;L;<narrow> 30AF;;;;N;;;;;
+FF79;HALFWIDTH KATAKANA LETTER KE;Lo;0;L;<narrow> 30B1;;;;N;;;;;
+FF7A;HALFWIDTH KATAKANA LETTER KO;Lo;0;L;<narrow> 30B3;;;;N;;;;;
+FF7B;HALFWIDTH KATAKANA LETTER SA;Lo;0;L;<narrow> 30B5;;;;N;;;;;
+FF7C;HALFWIDTH KATAKANA LETTER SI;Lo;0;L;<narrow> 30B7;;;;N;;;;;
+FF7D;HALFWIDTH KATAKANA LETTER SU;Lo;0;L;<narrow> 30B9;;;;N;;;;;
+FF7E;HALFWIDTH KATAKANA LETTER SE;Lo;0;L;<narrow> 30BB;;;;N;;;;;
+FF7F;HALFWIDTH KATAKANA LETTER SO;Lo;0;L;<narrow> 30BD;;;;N;;;;;
+FF80;HALFWIDTH KATAKANA LETTER TA;Lo;0;L;<narrow> 30BF;;;;N;;;;;
+FF81;HALFWIDTH KATAKANA LETTER TI;Lo;0;L;<narrow> 30C1;;;;N;;;;;
+FF82;HALFWIDTH KATAKANA LETTER TU;Lo;0;L;<narrow> 30C4;;;;N;;;;;
+FF83;HALFWIDTH KATAKANA LETTER TE;Lo;0;L;<narrow> 30C6;;;;N;;;;;
+FF84;HALFWIDTH KATAKANA LETTER TO;Lo;0;L;<narrow> 30C8;;;;N;;;;;
+FF85;HALFWIDTH KATAKANA LETTER NA;Lo;0;L;<narrow> 30CA;;;;N;;;;;
+FF86;HALFWIDTH KATAKANA LETTER NI;Lo;0;L;<narrow> 30CB;;;;N;;;;;
+FF87;HALFWIDTH KATAKANA LETTER NU;Lo;0;L;<narrow> 30CC;;;;N;;;;;
+FF88;HALFWIDTH KATAKANA LETTER NE;Lo;0;L;<narrow> 30CD;;;;N;;;;;
+FF89;HALFWIDTH KATAKANA LETTER NO;Lo;0;L;<narrow> 30CE;;;;N;;;;;
+FF8A;HALFWIDTH KATAKANA LETTER HA;Lo;0;L;<narrow> 30CF;;;;N;;;;;
+FF8B;HALFWIDTH KATAKANA LETTER HI;Lo;0;L;<narrow> 30D2;;;;N;;;;;
+FF8C;HALFWIDTH KATAKANA LETTER HU;Lo;0;L;<narrow> 30D5;;;;N;;;;;
+FF8D;HALFWIDTH KATAKANA LETTER HE;Lo;0;L;<narrow> 30D8;;;;N;;;;;
+FF8E;HALFWIDTH KATAKANA LETTER HO;Lo;0;L;<narrow> 30DB;;;;N;;;;;
+FF8F;HALFWIDTH KATAKANA LETTER MA;Lo;0;L;<narrow> 30DE;;;;N;;;;;
+FF90;HALFWIDTH KATAKANA LETTER MI;Lo;0;L;<narrow> 30DF;;;;N;;;;;
+FF91;HALFWIDTH KATAKANA LETTER MU;Lo;0;L;<narrow> 30E0;;;;N;;;;;
+FF92;HALFWIDTH KATAKANA LETTER ME;Lo;0;L;<narrow> 30E1;;;;N;;;;;
+FF93;HALFWIDTH KATAKANA LETTER MO;Lo;0;L;<narrow> 30E2;;;;N;;;;;
+FF94;HALFWIDTH KATAKANA LETTER YA;Lo;0;L;<narrow> 30E4;;;;N;;;;;
+FF95;HALFWIDTH KATAKANA LETTER YU;Lo;0;L;<narrow> 30E6;;;;N;;;;;
+FF96;HALFWIDTH KATAKANA LETTER YO;Lo;0;L;<narrow> 30E8;;;;N;;;;;
+FF97;HALFWIDTH KATAKANA LETTER RA;Lo;0;L;<narrow> 30E9;;;;N;;;;;
+FF98;HALFWIDTH KATAKANA LETTER RI;Lo;0;L;<narrow> 30EA;;;;N;;;;;
+FF99;HALFWIDTH KATAKANA LETTER RU;Lo;0;L;<narrow> 30EB;;;;N;;;;;
+FF9A;HALFWIDTH KATAKANA LETTER RE;Lo;0;L;<narrow> 30EC;;;;N;;;;;
+FF9B;HALFWIDTH KATAKANA LETTER RO;Lo;0;L;<narrow> 30ED;;;;N;;;;;
+FF9C;HALFWIDTH KATAKANA LETTER WA;Lo;0;L;<narrow> 30EF;;;;N;;;;;
+FF9D;HALFWIDTH KATAKANA LETTER N;Lo;0;L;<narrow> 30F3;;;;N;;;;;
+FF9E;HALFWIDTH KATAKANA VOICED SOUND MARK;Lm;0;L;<narrow> 3099;;;;N;;;;;
+FF9F;HALFWIDTH KATAKANA SEMI-VOICED SOUND MARK;Lm;0;L;<narrow> 309A;;;;N;;;;;
+FFA0;HALFWIDTH HANGUL FILLER;Lo;0;L;<narrow> 3164;;;;N;HALFWIDTH HANGUL CAE OM;;;;
+FFA1;HALFWIDTH HANGUL LETTER KIYEOK;Lo;0;L;<narrow> 3131;;;;N;HALFWIDTH HANGUL LETTER GIYEOG;;;;
+FFA2;HALFWIDTH HANGUL LETTER SSANGKIYEOK;Lo;0;L;<narrow> 3132;;;;N;HALFWIDTH HANGUL LETTER SSANG GIYEOG;;;;
+FFA3;HALFWIDTH HANGUL LETTER KIYEOK-SIOS;Lo;0;L;<narrow> 3133;;;;N;HALFWIDTH HANGUL LETTER GIYEOG SIOS;;;;
+FFA4;HALFWIDTH HANGUL LETTER NIEUN;Lo;0;L;<narrow> 3134;;;;N;;;;;
+FFA5;HALFWIDTH HANGUL LETTER NIEUN-CIEUC;Lo;0;L;<narrow> 3135;;;;N;HALFWIDTH HANGUL LETTER NIEUN JIEUJ;;;;
+FFA6;HALFWIDTH HANGUL LETTER NIEUN-HIEUH;Lo;0;L;<narrow> 3136;;;;N;HALFWIDTH HANGUL LETTER NIEUN HIEUH;;;;
+FFA7;HALFWIDTH HANGUL LETTER TIKEUT;Lo;0;L;<narrow> 3137;;;;N;HALFWIDTH HANGUL LETTER DIGEUD;;;;
+FFA8;HALFWIDTH HANGUL LETTER SSANGTIKEUT;Lo;0;L;<narrow> 3138;;;;N;HALFWIDTH HANGUL LETTER SSANG DIGEUD;;;;
+FFA9;HALFWIDTH HANGUL LETTER RIEUL;Lo;0;L;<narrow> 3139;;;;N;HALFWIDTH HANGUL LETTER LIEUL;;;;
+FFAA;HALFWIDTH HANGUL LETTER RIEUL-KIYEOK;Lo;0;L;<narrow> 313A;;;;N;HALFWIDTH HANGUL LETTER LIEUL GIYEOG;;;;
+FFAB;HALFWIDTH HANGUL LETTER RIEUL-MIEUM;Lo;0;L;<narrow> 313B;;;;N;HALFWIDTH HANGUL LETTER LIEUL MIEUM;;;;
+FFAC;HALFWIDTH HANGUL LETTER RIEUL-PIEUP;Lo;0;L;<narrow> 313C;;;;N;HALFWIDTH HANGUL LETTER LIEUL BIEUB;;;;
+FFAD;HALFWIDTH HANGUL LETTER RIEUL-SIOS;Lo;0;L;<narrow> 313D;;;;N;HALFWIDTH HANGUL LETTER LIEUL SIOS;;;;
+FFAE;HALFWIDTH HANGUL LETTER RIEUL-THIEUTH;Lo;0;L;<narrow> 313E;;;;N;HALFWIDTH HANGUL LETTER LIEUL TIEUT;;;;
+FFAF;HALFWIDTH HANGUL LETTER RIEUL-PHIEUPH;Lo;0;L;<narrow> 313F;;;;N;HALFWIDTH HANGUL LETTER LIEUL PIEUP;;;;
+FFB0;HALFWIDTH HANGUL LETTER RIEUL-HIEUH;Lo;0;L;<narrow> 3140;;;;N;HALFWIDTH HANGUL LETTER LIEUL HIEUH;;;;
+FFB1;HALFWIDTH HANGUL LETTER MIEUM;Lo;0;L;<narrow> 3141;;;;N;;;;;
+FFB2;HALFWIDTH HANGUL LETTER PIEUP;Lo;0;L;<narrow> 3142;;;;N;HALFWIDTH HANGUL LETTER BIEUB;;;;
+FFB3;HALFWIDTH HANGUL LETTER SSANGPIEUP;Lo;0;L;<narrow> 3143;;;;N;HALFWIDTH HANGUL LETTER SSANG BIEUB;;;;
+FFB4;HALFWIDTH HANGUL LETTER PIEUP-SIOS;Lo;0;L;<narrow> 3144;;;;N;HALFWIDTH HANGUL LETTER BIEUB SIOS;;;;
+FFB5;HALFWIDTH HANGUL LETTER SIOS;Lo;0;L;<narrow> 3145;;;;N;;;;;
+FFB6;HALFWIDTH HANGUL LETTER SSANGSIOS;Lo;0;L;<narrow> 3146;;;;N;HALFWIDTH HANGUL LETTER SSANG SIOS;;;;
+FFB7;HALFWIDTH HANGUL LETTER IEUNG;Lo;0;L;<narrow> 3147;;;;N;;;;;
+FFB8;HALFWIDTH HANGUL LETTER CIEUC;Lo;0;L;<narrow> 3148;;;;N;HALFWIDTH HANGUL LETTER JIEUJ;;;;
+FFB9;HALFWIDTH HANGUL LETTER SSANGCIEUC;Lo;0;L;<narrow> 3149;;;;N;HALFWIDTH HANGUL LETTER SSANG JIEUJ;;;;
+FFBA;HALFWIDTH HANGUL LETTER CHIEUCH;Lo;0;L;<narrow> 314A;;;;N;HALFWIDTH HANGUL LETTER CIEUC;;;;
+FFBB;HALFWIDTH HANGUL LETTER KHIEUKH;Lo;0;L;<narrow> 314B;;;;N;HALFWIDTH HANGUL LETTER KIYEOK;;;;
+FFBC;HALFWIDTH HANGUL LETTER THIEUTH;Lo;0;L;<narrow> 314C;;;;N;HALFWIDTH HANGUL LETTER TIEUT;;;;
+FFBD;HALFWIDTH HANGUL LETTER PHIEUPH;Lo;0;L;<narrow> 314D;;;;N;HALFWIDTH HANGUL LETTER PIEUP;;;;
+FFBE;HALFWIDTH HANGUL LETTER HIEUH;Lo;0;L;<narrow> 314E;;;;N;;;;;
+FFC2;HALFWIDTH HANGUL LETTER A;Lo;0;L;<narrow> 314F;;;;N;;;;;
+FFC3;HALFWIDTH HANGUL LETTER AE;Lo;0;L;<narrow> 3150;;;;N;;;;;
+FFC4;HALFWIDTH HANGUL LETTER YA;Lo;0;L;<narrow> 3151;;;;N;;;;;
+FFC5;HALFWIDTH HANGUL LETTER YAE;Lo;0;L;<narrow> 3152;;;;N;;;;;
+FFC6;HALFWIDTH HANGUL LETTER EO;Lo;0;L;<narrow> 3153;;;;N;;;;;
+FFC7;HALFWIDTH HANGUL LETTER E;Lo;0;L;<narrow> 3154;;;;N;;;;;
+FFCA;HALFWIDTH HANGUL LETTER YEO;Lo;0;L;<narrow> 3155;;;;N;;;;;
+FFCB;HALFWIDTH HANGUL LETTER YE;Lo;0;L;<narrow> 3156;;;;N;;;;;
+FFCC;HALFWIDTH HANGUL LETTER O;Lo;0;L;<narrow> 3157;;;;N;;;;;
+FFCD;HALFWIDTH HANGUL LETTER WA;Lo;0;L;<narrow> 3158;;;;N;;;;;
+FFCE;HALFWIDTH HANGUL LETTER WAE;Lo;0;L;<narrow> 3159;;;;N;;;;;
+FFCF;HALFWIDTH HANGUL LETTER OE;Lo;0;L;<narrow> 315A;;;;N;;;;;
+FFD2;HALFWIDTH HANGUL LETTER YO;Lo;0;L;<narrow> 315B;;;;N;;;;;
+FFD3;HALFWIDTH HANGUL LETTER U;Lo;0;L;<narrow> 315C;;;;N;;;;;
+FFD4;HALFWIDTH HANGUL LETTER WEO;Lo;0;L;<narrow> 315D;;;;N;;;;;
+FFD5;HALFWIDTH HANGUL LETTER WE;Lo;0;L;<narrow> 315E;;;;N;;;;;
+FFD6;HALFWIDTH HANGUL LETTER WI;Lo;0;L;<narrow> 315F;;;;N;;;;;
+FFD7;HALFWIDTH HANGUL LETTER YU;Lo;0;L;<narrow> 3160;;;;N;;;;;
+FFDA;HALFWIDTH HANGUL LETTER EU;Lo;0;L;<narrow> 3161;;;;N;;;;;
+FFDB;HALFWIDTH HANGUL LETTER YI;Lo;0;L;<narrow> 3162;;;;N;;;;;
+FFDC;HALFWIDTH HANGUL LETTER I;Lo;0;L;<narrow> 3163;;;;N;;;;;
+FFE0;FULLWIDTH CENT SIGN;Sc;0;ET;<wide> 00A2;;;;N;;;;;
+FFE1;FULLWIDTH POUND SIGN;Sc;0;ET;<wide> 00A3;;;;N;;;;;
+FFE2;FULLWIDTH NOT SIGN;Sm;0;ON;<wide> 00AC;;;;N;;;;;
+FFE3;FULLWIDTH MACRON;Sk;0;ON;<wide> 00AF;;;;N;FULLWIDTH SPACING MACRON;;;;
+FFE4;FULLWIDTH BROKEN BAR;So;0;ON;<wide> 00A6;;;;N;FULLWIDTH BROKEN VERTICAL BAR;;;;
+FFE5;FULLWIDTH YEN SIGN;Sc;0;ET;<wide> 00A5;;;;N;;;;;
+FFE6;FULLWIDTH WON SIGN;Sc;0;ET;<wide> 20A9;;;;N;;;;;
+FFE8;HALFWIDTH FORMS LIGHT VERTICAL;So;0;ON;<narrow> 2502;;;;N;;;;;
+FFE9;HALFWIDTH LEFTWARDS ARROW;Sm;0;ON;<narrow> 2190;;;;N;;;;;
+FFEA;HALFWIDTH UPWARDS ARROW;Sm;0;ON;<narrow> 2191;;;;N;;;;;
+FFEB;HALFWIDTH RIGHTWARDS ARROW;Sm;0;ON;<narrow> 2192;;;;N;;;;;
+FFEC;HALFWIDTH DOWNWARDS ARROW;Sm;0;ON;<narrow> 2193;;;;N;;;;;
+FFED;HALFWIDTH BLACK SQUARE;So;0;ON;<narrow> 25A0;;;;N;;;;;
+FFEE;HALFWIDTH WHITE CIRCLE;So;0;ON;<narrow> 25CB;;;;N;;;;;
+FFF9;INTERLINEAR ANNOTATION ANCHOR;Cf;0;ON;;;;;N;;;;;
+FFFA;INTERLINEAR ANNOTATION SEPARATOR;Cf;0;ON;;;;;N;;;;;
+FFFB;INTERLINEAR ANNOTATION TERMINATOR;Cf;0;ON;;;;;N;;;;;
+FFFC;OBJECT REPLACEMENT CHARACTER;So;0;ON;;;;;N;;;;;
+FFFD;REPLACEMENT CHARACTER;So;0;ON;;;;;N;;;;;
+10000;LINEAR B SYLLABLE B008 A;Lo;0;L;;;;;N;;;;;
+10001;LINEAR B SYLLABLE B038 E;Lo;0;L;;;;;N;;;;;
+10002;LINEAR B SYLLABLE B028 I;Lo;0;L;;;;;N;;;;;
+10003;LINEAR B SYLLABLE B061 O;Lo;0;L;;;;;N;;;;;
+10004;LINEAR B SYLLABLE B010 U;Lo;0;L;;;;;N;;;;;
+10005;LINEAR B SYLLABLE B001 DA;Lo;0;L;;;;;N;;;;;
+10006;LINEAR B SYLLABLE B045 DE;Lo;0;L;;;;;N;;;;;
+10007;LINEAR B SYLLABLE B007 DI;Lo;0;L;;;;;N;;;;;
+10008;LINEAR B SYLLABLE B014 DO;Lo;0;L;;;;;N;;;;;
+10009;LINEAR B SYLLABLE B051 DU;Lo;0;L;;;;;N;;;;;
+1000A;LINEAR B SYLLABLE B057 JA;Lo;0;L;;;;;N;;;;;
+1000B;LINEAR B SYLLABLE B046 JE;Lo;0;L;;;;;N;;;;;
+1000D;LINEAR B SYLLABLE B036 JO;Lo;0;L;;;;;N;;;;;
+1000E;LINEAR B SYLLABLE B065 JU;Lo;0;L;;;;;N;;;;;
+1000F;LINEAR B SYLLABLE B077 KA;Lo;0;L;;;;;N;;;;;
+10010;LINEAR B SYLLABLE B044 KE;Lo;0;L;;;;;N;;;;;
+10011;LINEAR B SYLLABLE B067 KI;Lo;0;L;;;;;N;;;;;
+10012;LINEAR B SYLLABLE B070 KO;Lo;0;L;;;;;N;;;;;
+10013;LINEAR B SYLLABLE B081 KU;Lo;0;L;;;;;N;;;;;
+10014;LINEAR B SYLLABLE B080 MA;Lo;0;L;;;;;N;;;;;
+10015;LINEAR B SYLLABLE B013 ME;Lo;0;L;;;;;N;;;;;
+10016;LINEAR B SYLLABLE B073 MI;Lo;0;L;;;;;N;;;;;
+10017;LINEAR B SYLLABLE B015 MO;Lo;0;L;;;;;N;;;;;
+10018;LINEAR B SYLLABLE B023 MU;Lo;0;L;;;;;N;;;;;
+10019;LINEAR B SYLLABLE B006 NA;Lo;0;L;;;;;N;;;;;
+1001A;LINEAR B SYLLABLE B024 NE;Lo;0;L;;;;;N;;;;;
+1001B;LINEAR B SYLLABLE B030 NI;Lo;0;L;;;;;N;;;;;
+1001C;LINEAR B SYLLABLE B052 NO;Lo;0;L;;;;;N;;;;;
+1001D;LINEAR B SYLLABLE B055 NU;Lo;0;L;;;;;N;;;;;
+1001E;LINEAR B SYLLABLE B003 PA;Lo;0;L;;;;;N;;;;;
+1001F;LINEAR B SYLLABLE B072 PE;Lo;0;L;;;;;N;;;;;
+10020;LINEAR B SYLLABLE B039 PI;Lo;0;L;;;;;N;;;;;
+10021;LINEAR B SYLLABLE B011 PO;Lo;0;L;;;;;N;;;;;
+10022;LINEAR B SYLLABLE B050 PU;Lo;0;L;;;;;N;;;;;
+10023;LINEAR B SYLLABLE B016 QA;Lo;0;L;;;;;N;;;;;
+10024;LINEAR B SYLLABLE B078 QE;Lo;0;L;;;;;N;;;;;
+10025;LINEAR B SYLLABLE B021 QI;Lo;0;L;;;;;N;;;;;
+10026;LINEAR B SYLLABLE B032 QO;Lo;0;L;;;;;N;;;;;
+10028;LINEAR B SYLLABLE B060 RA;Lo;0;L;;;;;N;;;;;
+10029;LINEAR B SYLLABLE B027 RE;Lo;0;L;;;;;N;;;;;
+1002A;LINEAR B SYLLABLE B053 RI;Lo;0;L;;;;;N;;;;;
+1002B;LINEAR B SYLLABLE B002 RO;Lo;0;L;;;;;N;;;;;
+1002C;LINEAR B SYLLABLE B026 RU;Lo;0;L;;;;;N;;;;;
+1002D;LINEAR B SYLLABLE B031 SA;Lo;0;L;;;;;N;;;;;
+1002E;LINEAR B SYLLABLE B009 SE;Lo;0;L;;;;;N;;;;;
+1002F;LINEAR B SYLLABLE B041 SI;Lo;0;L;;;;;N;;;;;
+10030;LINEAR B SYLLABLE B012 SO;Lo;0;L;;;;;N;;;;;
+10031;LINEAR B SYLLABLE B058 SU;Lo;0;L;;;;;N;;;;;
+10032;LINEAR B SYLLABLE B059 TA;Lo;0;L;;;;;N;;;;;
+10033;LINEAR B SYLLABLE B004 TE;Lo;0;L;;;;;N;;;;;
+10034;LINEAR B SYLLABLE B037 TI;Lo;0;L;;;;;N;;;;;
+10035;LINEAR B SYLLABLE B005 TO;Lo;0;L;;;;;N;;;;;
+10036;LINEAR B SYLLABLE B069 TU;Lo;0;L;;;;;N;;;;;
+10037;LINEAR B SYLLABLE B054 WA;Lo;0;L;;;;;N;;;;;
+10038;LINEAR B SYLLABLE B075 WE;Lo;0;L;;;;;N;;;;;
+10039;LINEAR B SYLLABLE B040 WI;Lo;0;L;;;;;N;;;;;
+1003A;LINEAR B SYLLABLE B042 WO;Lo;0;L;;;;;N;;;;;
+1003C;LINEAR B SYLLABLE B017 ZA;Lo;0;L;;;;;N;;;;;
+1003D;LINEAR B SYLLABLE B074 ZE;Lo;0;L;;;;;N;;;;;
+1003F;LINEAR B SYLLABLE B020 ZO;Lo;0;L;;;;;N;;;;;
+10040;LINEAR B SYLLABLE B025 A2;Lo;0;L;;;;;N;;;;;
+10041;LINEAR B SYLLABLE B043 A3;Lo;0;L;;;;;N;;;;;
+10042;LINEAR B SYLLABLE B085 AU;Lo;0;L;;;;;N;;;;;
+10043;LINEAR B SYLLABLE B071 DWE;Lo;0;L;;;;;N;;;;;
+10044;LINEAR B SYLLABLE B090 DWO;Lo;0;L;;;;;N;;;;;
+10045;LINEAR B SYLLABLE B048 NWA;Lo;0;L;;;;;N;;;;;
+10046;LINEAR B SYLLABLE B029 PU2;Lo;0;L;;;;;N;;;;;
+10047;LINEAR B SYLLABLE B062 PTE;Lo;0;L;;;;;N;;;;;
+10048;LINEAR B SYLLABLE B076 RA2;Lo;0;L;;;;;N;;;;;
+10049;LINEAR B SYLLABLE B033 RA3;Lo;0;L;;;;;N;;;;;
+1004A;LINEAR B SYLLABLE B068 RO2;Lo;0;L;;;;;N;;;;;
+1004B;LINEAR B SYLLABLE B066 TA2;Lo;0;L;;;;;N;;;;;
+1004C;LINEAR B SYLLABLE B087 TWE;Lo;0;L;;;;;N;;;;;
+1004D;LINEAR B SYLLABLE B091 TWO;Lo;0;L;;;;;N;;;;;
+10050;LINEAR B SYMBOL B018;Lo;0;L;;;;;N;;;;;
+10051;LINEAR B SYMBOL B019;Lo;0;L;;;;;N;;;;;
+10052;LINEAR B SYMBOL B022;Lo;0;L;;;;;N;;;;;
+10053;LINEAR B SYMBOL B034;Lo;0;L;;;;;N;;;;;
+10054;LINEAR B SYMBOL B047;Lo;0;L;;;;;N;;;;;
+10055;LINEAR B SYMBOL B049;Lo;0;L;;;;;N;;;;;
+10056;LINEAR B SYMBOL B056;Lo;0;L;;;;;N;;;;;
+10057;LINEAR B SYMBOL B063;Lo;0;L;;;;;N;;;;;
+10058;LINEAR B SYMBOL B064;Lo;0;L;;;;;N;;;;;
+10059;LINEAR B SYMBOL B079;Lo;0;L;;;;;N;;;;;
+1005A;LINEAR B SYMBOL B082;Lo;0;L;;;;;N;;;;;
+1005B;LINEAR B SYMBOL B083;Lo;0;L;;;;;N;;;;;
+1005C;LINEAR B SYMBOL B086;Lo;0;L;;;;;N;;;;;
+1005D;LINEAR B SYMBOL B089;Lo;0;L;;;;;N;;;;;
+10080;LINEAR B IDEOGRAM B100 MAN;Lo;0;L;;;;;N;;;;;
+10081;LINEAR B IDEOGRAM B102 WOMAN;Lo;0;L;;;;;N;;;;;
+10082;LINEAR B IDEOGRAM B104 DEER;Lo;0;L;;;;;N;;;;;
+10083;LINEAR B IDEOGRAM B105 EQUID;Lo;0;L;;;;;N;;;;;
+10084;LINEAR B IDEOGRAM B105F MARE;Lo;0;L;;;;;N;;;;;
+10085;LINEAR B IDEOGRAM B105M STALLION;Lo;0;L;;;;;N;;;;;
+10086;LINEAR B IDEOGRAM B106F EWE;Lo;0;L;;;;;N;;;;;
+10087;LINEAR B IDEOGRAM B106M RAM;Lo;0;L;;;;;N;;;;;
+10088;LINEAR B IDEOGRAM B107F SHE-GOAT;Lo;0;L;;;;;N;;;;;
+10089;LINEAR B IDEOGRAM B107M HE-GOAT;Lo;0;L;;;;;N;;;;;
+1008A;LINEAR B IDEOGRAM B108F SOW;Lo;0;L;;;;;N;;;;;
+1008B;LINEAR B IDEOGRAM B108M BOAR;Lo;0;L;;;;;N;;;;;
+1008C;LINEAR B IDEOGRAM B109F COW;Lo;0;L;;;;;N;;;;;
+1008D;LINEAR B IDEOGRAM B109M BULL;Lo;0;L;;;;;N;;;;;
+1008E;LINEAR B IDEOGRAM B120 WHEAT;Lo;0;L;;;;;N;;;;;
+1008F;LINEAR B IDEOGRAM B121 BARLEY;Lo;0;L;;;;;N;;;;;
+10090;LINEAR B IDEOGRAM B122 OLIVE;Lo;0;L;;;;;N;;;;;
+10091;LINEAR B IDEOGRAM B123 SPICE;Lo;0;L;;;;;N;;;;;
+10092;LINEAR B IDEOGRAM B125 CYPERUS;Lo;0;L;;;;;N;;;;;
+10093;LINEAR B MONOGRAM B127 KAPO;Lo;0;L;;;;;N;;;;;
+10094;LINEAR B MONOGRAM B128 KANAKO;Lo;0;L;;;;;N;;;;;
+10095;LINEAR B IDEOGRAM B130 OIL;Lo;0;L;;;;;N;;;;;
+10096;LINEAR B IDEOGRAM B131 WINE;Lo;0;L;;;;;N;;;;;
+10097;LINEAR B IDEOGRAM B132;Lo;0;L;;;;;N;;;;;
+10098;LINEAR B MONOGRAM B133 AREPA;Lo;0;L;;;;;N;;;;;
+10099;LINEAR B MONOGRAM B135 MERI;Lo;0;L;;;;;N;;;;;
+1009A;LINEAR B IDEOGRAM B140 BRONZE;Lo;0;L;;;;;N;;;;;
+1009B;LINEAR B IDEOGRAM B141 GOLD;Lo;0;L;;;;;N;;;;;
+1009C;LINEAR B IDEOGRAM B142;Lo;0;L;;;;;N;;;;;
+1009D;LINEAR B IDEOGRAM B145 WOOL;Lo;0;L;;;;;N;;;;;
+1009E;LINEAR B IDEOGRAM B146;Lo;0;L;;;;;N;;;;;
+1009F;LINEAR B IDEOGRAM B150;Lo;0;L;;;;;N;;;;;
+100A0;LINEAR B IDEOGRAM B151 HORN;Lo;0;L;;;;;N;;;;;
+100A1;LINEAR B IDEOGRAM B152;Lo;0;L;;;;;N;;;;;
+100A2;LINEAR B IDEOGRAM B153;Lo;0;L;;;;;N;;;;;
+100A3;LINEAR B IDEOGRAM B154;Lo;0;L;;;;;N;;;;;
+100A4;LINEAR B MONOGRAM B156 TURO2;Lo;0;L;;;;;N;;;;;
+100A5;LINEAR B IDEOGRAM B157;Lo;0;L;;;;;N;;;;;
+100A6;LINEAR B IDEOGRAM B158;Lo;0;L;;;;;N;;;;;
+100A7;LINEAR B IDEOGRAM B159 CLOTH;Lo;0;L;;;;;N;;;;;
+100A8;LINEAR B IDEOGRAM B160;Lo;0;L;;;;;N;;;;;
+100A9;LINEAR B IDEOGRAM B161;Lo;0;L;;;;;N;;;;;
+100AA;LINEAR B IDEOGRAM B162 GARMENT;Lo;0;L;;;;;N;;;;;
+100AB;LINEAR B IDEOGRAM B163 ARMOUR;Lo;0;L;;;;;N;;;;;
+100AC;LINEAR B IDEOGRAM B164;Lo;0;L;;;;;N;;;;;
+100AD;LINEAR B IDEOGRAM B165;Lo;0;L;;;;;N;;;;;
+100AE;LINEAR B IDEOGRAM B166;Lo;0;L;;;;;N;;;;;
+100AF;LINEAR B IDEOGRAM B167;Lo;0;L;;;;;N;;;;;
+100B0;LINEAR B IDEOGRAM B168;Lo;0;L;;;;;N;;;;;
+100B1;LINEAR B IDEOGRAM B169;Lo;0;L;;;;;N;;;;;
+100B2;LINEAR B IDEOGRAM B170;Lo;0;L;;;;;N;;;;;
+100B3;LINEAR B IDEOGRAM B171;Lo;0;L;;;;;N;;;;;
+100B4;LINEAR B IDEOGRAM B172;Lo;0;L;;;;;N;;;;;
+100B5;LINEAR B IDEOGRAM B173 MONTH;Lo;0;L;;;;;N;;;;;
+100B6;LINEAR B IDEOGRAM B174;Lo;0;L;;;;;N;;;;;
+100B7;LINEAR B IDEOGRAM B176 TREE;Lo;0;L;;;;;N;;;;;
+100B8;LINEAR B IDEOGRAM B177;Lo;0;L;;;;;N;;;;;
+100B9;LINEAR B IDEOGRAM B178;Lo;0;L;;;;;N;;;;;
+100BA;LINEAR B IDEOGRAM B179;Lo;0;L;;;;;N;;;;;
+100BB;LINEAR B IDEOGRAM B180;Lo;0;L;;;;;N;;;;;
+100BC;LINEAR B IDEOGRAM B181;Lo;0;L;;;;;N;;;;;
+100BD;LINEAR B IDEOGRAM B182;Lo;0;L;;;;;N;;;;;
+100BE;LINEAR B IDEOGRAM B183;Lo;0;L;;;;;N;;;;;
+100BF;LINEAR B IDEOGRAM B184;Lo;0;L;;;;;N;;;;;
+100C0;LINEAR B IDEOGRAM B185;Lo;0;L;;;;;N;;;;;
+100C1;LINEAR B IDEOGRAM B189;Lo;0;L;;;;;N;;;;;
+100C2;LINEAR B IDEOGRAM B190;Lo;0;L;;;;;N;;;;;
+100C3;LINEAR B IDEOGRAM B191 HELMET;Lo;0;L;;;;;N;;;;;
+100C4;LINEAR B IDEOGRAM B220 FOOTSTOOL;Lo;0;L;;;;;N;;;;;
+100C5;LINEAR B IDEOGRAM B225 BATHTUB;Lo;0;L;;;;;N;;;;;
+100C6;LINEAR B IDEOGRAM B230 SPEAR;Lo;0;L;;;;;N;;;;;
+100C7;LINEAR B IDEOGRAM B231 ARROW;Lo;0;L;;;;;N;;;;;
+100C8;LINEAR B IDEOGRAM B232;Lo;0;L;;;;;N;;;;;
+100C9;LINEAR B IDEOGRAM B233 SWORD;Lo;0;L;;;;;N;;;;;
+100CA;LINEAR B IDEOGRAM B234;Lo;0;L;;;;;N;;;;;
+100CB;LINEAR B IDEOGRAM B236;Lo;0;L;;;;;N;;;;;
+100CC;LINEAR B IDEOGRAM B240 WHEELED CHARIOT;Lo;0;L;;;;;N;;;;;
+100CD;LINEAR B IDEOGRAM B241 CHARIOT;Lo;0;L;;;;;N;;;;;
+100CE;LINEAR B IDEOGRAM B242 CHARIOT FRAME;Lo;0;L;;;;;N;;;;;
+100CF;LINEAR B IDEOGRAM B243 WHEEL;Lo;0;L;;;;;N;;;;;
+100D0;LINEAR B IDEOGRAM B245;Lo;0;L;;;;;N;;;;;
+100D1;LINEAR B IDEOGRAM B246;Lo;0;L;;;;;N;;;;;
+100D2;LINEAR B MONOGRAM B247 DIPTE;Lo;0;L;;;;;N;;;;;
+100D3;LINEAR B IDEOGRAM B248;Lo;0;L;;;;;N;;;;;
+100D4;LINEAR B IDEOGRAM B249;Lo;0;L;;;;;N;;;;;
+100D5;LINEAR B IDEOGRAM B251;Lo;0;L;;;;;N;;;;;
+100D6;LINEAR B IDEOGRAM B252;Lo;0;L;;;;;N;;;;;
+100D7;LINEAR B IDEOGRAM B253;Lo;0;L;;;;;N;;;;;
+100D8;LINEAR B IDEOGRAM B254 DART;Lo;0;L;;;;;N;;;;;
+100D9;LINEAR B IDEOGRAM B255;Lo;0;L;;;;;N;;;;;
+100DA;LINEAR B IDEOGRAM B256;Lo;0;L;;;;;N;;;;;
+100DB;LINEAR B IDEOGRAM B257;Lo;0;L;;;;;N;;;;;
+100DC;LINEAR B IDEOGRAM B258;Lo;0;L;;;;;N;;;;;
+100DD;LINEAR B IDEOGRAM B259;Lo;0;L;;;;;N;;;;;
+100DE;LINEAR B IDEOGRAM VESSEL B155;Lo;0;L;;;;;N;;;;;
+100DF;LINEAR B IDEOGRAM VESSEL B200;Lo;0;L;;;;;N;;;;;
+100E0;LINEAR B IDEOGRAM VESSEL B201;Lo;0;L;;;;;N;;;;;
+100E1;LINEAR B IDEOGRAM VESSEL B202;Lo;0;L;;;;;N;;;;;
+100E2;LINEAR B IDEOGRAM VESSEL B203;Lo;0;L;;;;;N;;;;;
+100E3;LINEAR B IDEOGRAM VESSEL B204;Lo;0;L;;;;;N;;;;;
+100E4;LINEAR B IDEOGRAM VESSEL B205;Lo;0;L;;;;;N;;;;;
+100E5;LINEAR B IDEOGRAM VESSEL B206;Lo;0;L;;;;;N;;;;;
+100E6;LINEAR B IDEOGRAM VESSEL B207;Lo;0;L;;;;;N;;;;;
+100E7;LINEAR B IDEOGRAM VESSEL B208;Lo;0;L;;;;;N;;;;;
+100E8;LINEAR B IDEOGRAM VESSEL B209;Lo;0;L;;;;;N;;;;;
+100E9;LINEAR B IDEOGRAM VESSEL B210;Lo;0;L;;;;;N;;;;;
+100EA;LINEAR B IDEOGRAM VESSEL B211;Lo;0;L;;;;;N;;;;;
+100EB;LINEAR B IDEOGRAM VESSEL B212;Lo;0;L;;;;;N;;;;;
+100EC;LINEAR B IDEOGRAM VESSEL B213;Lo;0;L;;;;;N;;;;;
+100ED;LINEAR B IDEOGRAM VESSEL B214;Lo;0;L;;;;;N;;;;;
+100EE;LINEAR B IDEOGRAM VESSEL B215;Lo;0;L;;;;;N;;;;;
+100EF;LINEAR B IDEOGRAM VESSEL B216;Lo;0;L;;;;;N;;;;;
+100F0;LINEAR B IDEOGRAM VESSEL B217;Lo;0;L;;;;;N;;;;;
+100F1;LINEAR B IDEOGRAM VESSEL B218;Lo;0;L;;;;;N;;;;;
+100F2;LINEAR B IDEOGRAM VESSEL B219;Lo;0;L;;;;;N;;;;;
+100F3;LINEAR B IDEOGRAM VESSEL B221;Lo;0;L;;;;;N;;;;;
+100F4;LINEAR B IDEOGRAM VESSEL B222;Lo;0;L;;;;;N;;;;;
+100F5;LINEAR B IDEOGRAM VESSEL B226;Lo;0;L;;;;;N;;;;;
+100F6;LINEAR B IDEOGRAM VESSEL B227;Lo;0;L;;;;;N;;;;;
+100F7;LINEAR B IDEOGRAM VESSEL B228;Lo;0;L;;;;;N;;;;;
+100F8;LINEAR B IDEOGRAM VESSEL B229;Lo;0;L;;;;;N;;;;;
+100F9;LINEAR B IDEOGRAM VESSEL B250;Lo;0;L;;;;;N;;;;;
+100FA;LINEAR B IDEOGRAM VESSEL B305;Lo;0;L;;;;;N;;;;;
+10100;AEGEAN WORD SEPARATOR LINE;Po;0;L;;;;;N;;;;;
+10101;AEGEAN WORD SEPARATOR DOT;Po;0;ON;;;;;N;;;;;
+10102;AEGEAN CHECK MARK;Po;0;L;;;;;N;;;;;
+10107;AEGEAN NUMBER ONE;No;0;L;;;;1;N;;;;;
+10108;AEGEAN NUMBER TWO;No;0;L;;;;2;N;;;;;
+10109;AEGEAN NUMBER THREE;No;0;L;;;;3;N;;;;;
+1010A;AEGEAN NUMBER FOUR;No;0;L;;;;4;N;;;;;
+1010B;AEGEAN NUMBER FIVE;No;0;L;;;;5;N;;;;;
+1010C;AEGEAN NUMBER SIX;No;0;L;;;;6;N;;;;;
+1010D;AEGEAN NUMBER SEVEN;No;0;L;;;;7;N;;;;;
+1010E;AEGEAN NUMBER EIGHT;No;0;L;;;;8;N;;;;;
+1010F;AEGEAN NUMBER NINE;No;0;L;;;;9;N;;;;;
+10110;AEGEAN NUMBER TEN;No;0;L;;;;10;N;;;;;
+10111;AEGEAN NUMBER TWENTY;No;0;L;;;;20;N;;;;;
+10112;AEGEAN NUMBER THIRTY;No;0;L;;;;30;N;;;;;
+10113;AEGEAN NUMBER FORTY;No;0;L;;;;40;N;;;;;
+10114;AEGEAN NUMBER FIFTY;No;0;L;;;;50;N;;;;;
+10115;AEGEAN NUMBER SIXTY;No;0;L;;;;60;N;;;;;
+10116;AEGEAN NUMBER SEVENTY;No;0;L;;;;70;N;;;;;
+10117;AEGEAN NUMBER EIGHTY;No;0;L;;;;80;N;;;;;
+10118;AEGEAN NUMBER NINETY;No;0;L;;;;90;N;;;;;
+10119;AEGEAN NUMBER ONE HUNDRED;No;0;L;;;;100;N;;;;;
+1011A;AEGEAN NUMBER TWO HUNDRED;No;0;L;;;;200;N;;;;;
+1011B;AEGEAN NUMBER THREE HUNDRED;No;0;L;;;;300;N;;;;;
+1011C;AEGEAN NUMBER FOUR HUNDRED;No;0;L;;;;400;N;;;;;
+1011D;AEGEAN NUMBER FIVE HUNDRED;No;0;L;;;;500;N;;;;;
+1011E;AEGEAN NUMBER SIX HUNDRED;No;0;L;;;;600;N;;;;;
+1011F;AEGEAN NUMBER SEVEN HUNDRED;No;0;L;;;;700;N;;;;;
+10120;AEGEAN NUMBER EIGHT HUNDRED;No;0;L;;;;800;N;;;;;
+10121;AEGEAN NUMBER NINE HUNDRED;No;0;L;;;;900;N;;;;;
+10122;AEGEAN NUMBER ONE THOUSAND;No;0;L;;;;1000;N;;;;;
+10123;AEGEAN NUMBER TWO THOUSAND;No;0;L;;;;2000;N;;;;;
+10124;AEGEAN NUMBER THREE THOUSAND;No;0;L;;;;3000;N;;;;;
+10125;AEGEAN NUMBER FOUR THOUSAND;No;0;L;;;;4000;N;;;;;
+10126;AEGEAN NUMBER FIVE THOUSAND;No;0;L;;;;5000;N;;;;;
+10127;AEGEAN NUMBER SIX THOUSAND;No;0;L;;;;6000;N;;;;;
+10128;AEGEAN NUMBER SEVEN THOUSAND;No;0;L;;;;7000;N;;;;;
+10129;AEGEAN NUMBER EIGHT THOUSAND;No;0;L;;;;8000;N;;;;;
+1012A;AEGEAN NUMBER NINE THOUSAND;No;0;L;;;;9000;N;;;;;
+1012B;AEGEAN NUMBER TEN THOUSAND;No;0;L;;;;10000;N;;;;;
+1012C;AEGEAN NUMBER TWENTY THOUSAND;No;0;L;;;;20000;N;;;;;
+1012D;AEGEAN NUMBER THIRTY THOUSAND;No;0;L;;;;30000;N;;;;;
+1012E;AEGEAN NUMBER FORTY THOUSAND;No;0;L;;;;40000;N;;;;;
+1012F;AEGEAN NUMBER FIFTY THOUSAND;No;0;L;;;;50000;N;;;;;
+10130;AEGEAN NUMBER SIXTY THOUSAND;No;0;L;;;;60000;N;;;;;
+10131;AEGEAN NUMBER SEVENTY THOUSAND;No;0;L;;;;70000;N;;;;;
+10132;AEGEAN NUMBER EIGHTY THOUSAND;No;0;L;;;;80000;N;;;;;
+10133;AEGEAN NUMBER NINETY THOUSAND;No;0;L;;;;90000;N;;;;;
+10137;AEGEAN WEIGHT BASE UNIT;So;0;L;;;;;N;;;;;
+10138;AEGEAN WEIGHT FIRST SUBUNIT;So;0;L;;;;;N;;;;;
+10139;AEGEAN WEIGHT SECOND SUBUNIT;So;0;L;;;;;N;;;;;
+1013A;AEGEAN WEIGHT THIRD SUBUNIT;So;0;L;;;;;N;;;;;
+1013B;AEGEAN WEIGHT FOURTH SUBUNIT;So;0;L;;;;;N;;;;;
+1013C;AEGEAN DRY MEASURE FIRST SUBUNIT;So;0;L;;;;;N;;;;;
+1013D;AEGEAN LIQUID MEASURE FIRST SUBUNIT;So;0;L;;;;;N;;;;;
+1013E;AEGEAN MEASURE SECOND SUBUNIT;So;0;L;;;;;N;;;;;
+1013F;AEGEAN MEASURE THIRD SUBUNIT;So;0;L;;;;;N;;;;;
+10140;GREEK ACROPHONIC ATTIC ONE QUARTER;Nl;0;ON;;;;1/4;N;;;;;
+10141;GREEK ACROPHONIC ATTIC ONE HALF;Nl;0;ON;;;;1/2;N;;;;;
+10142;GREEK ACROPHONIC ATTIC ONE DRACHMA;Nl;0;ON;;;;1;N;;;;;
+10143;GREEK ACROPHONIC ATTIC FIVE;Nl;0;ON;;;;5;N;;;;;
+10144;GREEK ACROPHONIC ATTIC FIFTY;Nl;0;ON;;;;50;N;;;;;
+10145;GREEK ACROPHONIC ATTIC FIVE HUNDRED;Nl;0;ON;;;;500;N;;;;;
+10146;GREEK ACROPHONIC ATTIC FIVE THOUSAND;Nl;0;ON;;;;5000;N;;;;;
+10147;GREEK ACROPHONIC ATTIC FIFTY THOUSAND;Nl;0;ON;;;;50000;N;;;;;
+10148;GREEK ACROPHONIC ATTIC FIVE TALENTS;Nl;0;ON;;;;5;N;;;;;
+10149;GREEK ACROPHONIC ATTIC TEN TALENTS;Nl;0;ON;;;;10;N;;;;;
+1014A;GREEK ACROPHONIC ATTIC FIFTY TALENTS;Nl;0;ON;;;;50;N;;;;;
+1014B;GREEK ACROPHONIC ATTIC ONE HUNDRED TALENTS;Nl;0;ON;;;;100;N;;;;;
+1014C;GREEK ACROPHONIC ATTIC FIVE HUNDRED TALENTS;Nl;0;ON;;;;500;N;;;;;
+1014D;GREEK ACROPHONIC ATTIC ONE THOUSAND TALENTS;Nl;0;ON;;;;1000;N;;;;;
+1014E;GREEK ACROPHONIC ATTIC FIVE THOUSAND TALENTS;Nl;0;ON;;;;5000;N;;;;;
+1014F;GREEK ACROPHONIC ATTIC FIVE STATERS;Nl;0;ON;;;;5;N;;;;;
+10150;GREEK ACROPHONIC ATTIC TEN STATERS;Nl;0;ON;;;;10;N;;;;;
+10151;GREEK ACROPHONIC ATTIC FIFTY STATERS;Nl;0;ON;;;;50;N;;;;;
+10152;GREEK ACROPHONIC ATTIC ONE HUNDRED STATERS;Nl;0;ON;;;;100;N;;;;;
+10153;GREEK ACROPHONIC ATTIC FIVE HUNDRED STATERS;Nl;0;ON;;;;500;N;;;;;
+10154;GREEK ACROPHONIC ATTIC ONE THOUSAND STATERS;Nl;0;ON;;;;1000;N;;;;;
+10155;GREEK ACROPHONIC ATTIC TEN THOUSAND STATERS;Nl;0;ON;;;;10000;N;;;;;
+10156;GREEK ACROPHONIC ATTIC FIFTY THOUSAND STATERS;Nl;0;ON;;;;50000;N;;;;;
+10157;GREEK ACROPHONIC ATTIC TEN MNAS;Nl;0;ON;;;;10;N;;;;;
+10158;GREEK ACROPHONIC HERAEUM ONE PLETHRON;Nl;0;ON;;;;1;N;;;;;
+10159;GREEK ACROPHONIC THESPIAN ONE;Nl;0;ON;;;;1;N;;;;;
+1015A;GREEK ACROPHONIC HERMIONIAN ONE;Nl;0;ON;;;;1;N;;;;;
+1015B;GREEK ACROPHONIC EPIDAUREAN TWO;Nl;0;ON;;;;2;N;;;;;
+1015C;GREEK ACROPHONIC THESPIAN TWO;Nl;0;ON;;;;2;N;;;;;
+1015D;GREEK ACROPHONIC CYRENAIC TWO DRACHMAS;Nl;0;ON;;;;2;N;;;;;
+1015E;GREEK ACROPHONIC EPIDAUREAN TWO DRACHMAS;Nl;0;ON;;;;2;N;;;;;
+1015F;GREEK ACROPHONIC TROEZENIAN FIVE;Nl;0;ON;;;;5;N;;;;;
+10160;GREEK ACROPHONIC TROEZENIAN TEN;Nl;0;ON;;;;10;N;;;;;
+10161;GREEK ACROPHONIC TROEZENIAN TEN ALTERNATE FORM;Nl;0;ON;;;;10;N;;;;;
+10162;GREEK ACROPHONIC HERMIONIAN TEN;Nl;0;ON;;;;10;N;;;;;
+10163;GREEK ACROPHONIC MESSENIAN TEN;Nl;0;ON;;;;10;N;;;;;
+10164;GREEK ACROPHONIC THESPIAN TEN;Nl;0;ON;;;;10;N;;;;;
+10165;GREEK ACROPHONIC THESPIAN THIRTY;Nl;0;ON;;;;30;N;;;;;
+10166;GREEK ACROPHONIC TROEZENIAN FIFTY;Nl;0;ON;;;;50;N;;;;;
+10167;GREEK ACROPHONIC TROEZENIAN FIFTY ALTERNATE FORM;Nl;0;ON;;;;50;N;;;;;
+10168;GREEK ACROPHONIC HERMIONIAN FIFTY;Nl;0;ON;;;;50;N;;;;;
+10169;GREEK ACROPHONIC THESPIAN FIFTY;Nl;0;ON;;;;50;N;;;;;
+1016A;GREEK ACROPHONIC THESPIAN ONE HUNDRED;Nl;0;ON;;;;100;N;;;;;
+1016B;GREEK ACROPHONIC THESPIAN THREE HUNDRED;Nl;0;ON;;;;300;N;;;;;
+1016C;GREEK ACROPHONIC EPIDAUREAN FIVE HUNDRED;Nl;0;ON;;;;500;N;;;;;
+1016D;GREEK ACROPHONIC TROEZENIAN FIVE HUNDRED;Nl;0;ON;;;;500;N;;;;;
+1016E;GREEK ACROPHONIC THESPIAN FIVE HUNDRED;Nl;0;ON;;;;500;N;;;;;
+1016F;GREEK ACROPHONIC CARYSTIAN FIVE HUNDRED;Nl;0;ON;;;;500;N;;;;;
+10170;GREEK ACROPHONIC NAXIAN FIVE HUNDRED;Nl;0;ON;;;;500;N;;;;;
+10171;GREEK ACROPHONIC THESPIAN ONE THOUSAND;Nl;0;ON;;;;1000;N;;;;;
+10172;GREEK ACROPHONIC THESPIAN FIVE THOUSAND;Nl;0;ON;;;;5000;N;;;;;
+10173;GREEK ACROPHONIC DELPHIC FIVE MNAS;Nl;0;ON;;;;5;N;;;;;
+10174;GREEK ACROPHONIC STRATIAN FIFTY MNAS;Nl;0;ON;;;;50;N;;;;;
+10175;GREEK ONE HALF SIGN;No;0;ON;;;;1/2;N;;;;;
+10176;GREEK ONE HALF SIGN ALTERNATE FORM;No;0;ON;;;;1/2;N;;;;;
+10177;GREEK TWO THIRDS SIGN;No;0;ON;;;;2/3;N;;;;;
+10178;GREEK THREE QUARTERS SIGN;No;0;ON;;;;3/4;N;;;;;
+10179;GREEK YEAR SIGN;So;0;ON;;;;;N;;;;;
+1017A;GREEK TALENT SIGN;So;0;ON;;;;;N;;;;;
+1017B;GREEK DRACHMA SIGN;So;0;ON;;;;;N;;;;;
+1017C;GREEK OBOL SIGN;So;0;ON;;;;;N;;;;;
+1017D;GREEK TWO OBOLS SIGN;So;0;ON;;;;;N;;;;;
+1017E;GREEK THREE OBOLS SIGN;So;0;ON;;;;;N;;;;;
+1017F;GREEK FOUR OBOLS SIGN;So;0;ON;;;;;N;;;;;
+10180;GREEK FIVE OBOLS SIGN;So;0;ON;;;;;N;;;;;
+10181;GREEK METRETES SIGN;So;0;ON;;;;;N;;;;;
+10182;GREEK KYATHOS BASE SIGN;So;0;ON;;;;;N;;;;;
+10183;GREEK LITRA SIGN;So;0;ON;;;;;N;;;;;
+10184;GREEK OUNKIA SIGN;So;0;ON;;;;;N;;;;;
+10185;GREEK XESTES SIGN;So;0;ON;;;;;N;;;;;
+10186;GREEK ARTABE SIGN;So;0;ON;;;;;N;;;;;
+10187;GREEK AROURA SIGN;So;0;ON;;;;;N;;;;;
+10188;GREEK GRAMMA SIGN;So;0;ON;;;;;N;;;;;
+10189;GREEK TRYBLION BASE SIGN;So;0;ON;;;;;N;;;;;
+1018A;GREEK ZERO SIGN;No;0;ON;;;;0;N;;;;;
+1018B;GREEK ONE QUARTER SIGN;No;0;ON;;;;1/4;N;;;;;
+1018C;GREEK SINUSOID SIGN;So;0;ON;;;;;N;;;;;
+1018D;GREEK INDICTION SIGN;So;0;L;;;;;N;;;;;
+1018E;NOMISMA SIGN;So;0;L;;;;;N;;;;;
+10190;ROMAN SEXTANS SIGN;So;0;ON;;;;;N;;;;;
+10191;ROMAN UNCIA SIGN;So;0;ON;;;;;N;;;;;
+10192;ROMAN SEMUNCIA SIGN;So;0;ON;;;;;N;;;;;
+10193;ROMAN SEXTULA SIGN;So;0;ON;;;;;N;;;;;
+10194;ROMAN DIMIDIA SEXTULA SIGN;So;0;ON;;;;;N;;;;;
+10195;ROMAN SILIQUA SIGN;So;0;ON;;;;;N;;;;;
+10196;ROMAN DENARIUS SIGN;So;0;ON;;;;;N;;;;;
+10197;ROMAN QUINARIUS SIGN;So;0;ON;;;;;N;;;;;
+10198;ROMAN SESTERTIUS SIGN;So;0;ON;;;;;N;;;;;
+10199;ROMAN DUPONDIUS SIGN;So;0;ON;;;;;N;;;;;
+1019A;ROMAN AS SIGN;So;0;ON;;;;;N;;;;;
+1019B;ROMAN CENTURIAL SIGN;So;0;ON;;;;;N;;;;;
+101A0;GREEK SYMBOL TAU RHO;So;0;ON;;;;;N;;;;;
+101D0;PHAISTOS DISC SIGN PEDESTRIAN;So;0;L;;;;;N;;;;;
+101D1;PHAISTOS DISC SIGN PLUMED HEAD;So;0;L;;;;;N;;;;;
+101D2;PHAISTOS DISC SIGN TATTOOED HEAD;So;0;L;;;;;N;;;;;
+101D3;PHAISTOS DISC SIGN CAPTIVE;So;0;L;;;;;N;;;;;
+101D4;PHAISTOS DISC SIGN CHILD;So;0;L;;;;;N;;;;;
+101D5;PHAISTOS DISC SIGN WOMAN;So;0;L;;;;;N;;;;;
+101D6;PHAISTOS DISC SIGN HELMET;So;0;L;;;;;N;;;;;
+101D7;PHAISTOS DISC SIGN GAUNTLET;So;0;L;;;;;N;;;;;
+101D8;PHAISTOS DISC SIGN TIARA;So;0;L;;;;;N;;;;;
+101D9;PHAISTOS DISC SIGN ARROW;So;0;L;;;;;N;;;;;
+101DA;PHAISTOS DISC SIGN BOW;So;0;L;;;;;N;;;;;
+101DB;PHAISTOS DISC SIGN SHIELD;So;0;L;;;;;N;;;;;
+101DC;PHAISTOS DISC SIGN CLUB;So;0;L;;;;;N;;;;;
+101DD;PHAISTOS DISC SIGN MANACLES;So;0;L;;;;;N;;;;;
+101DE;PHAISTOS DISC SIGN MATTOCK;So;0;L;;;;;N;;;;;
+101DF;PHAISTOS DISC SIGN SAW;So;0;L;;;;;N;;;;;
+101E0;PHAISTOS DISC SIGN LID;So;0;L;;;;;N;;;;;
+101E1;PHAISTOS DISC SIGN BOOMERANG;So;0;L;;;;;N;;;;;
+101E2;PHAISTOS DISC SIGN CARPENTRY PLANE;So;0;L;;;;;N;;;;;
+101E3;PHAISTOS DISC SIGN DOLIUM;So;0;L;;;;;N;;;;;
+101E4;PHAISTOS DISC SIGN COMB;So;0;L;;;;;N;;;;;
+101E5;PHAISTOS DISC SIGN SLING;So;0;L;;;;;N;;;;;
+101E6;PHAISTOS DISC SIGN COLUMN;So;0;L;;;;;N;;;;;
+101E7;PHAISTOS DISC SIGN BEEHIVE;So;0;L;;;;;N;;;;;
+101E8;PHAISTOS DISC SIGN SHIP;So;0;L;;;;;N;;;;;
+101E9;PHAISTOS DISC SIGN HORN;So;0;L;;;;;N;;;;;
+101EA;PHAISTOS DISC SIGN HIDE;So;0;L;;;;;N;;;;;
+101EB;PHAISTOS DISC SIGN BULLS LEG;So;0;L;;;;;N;;;;;
+101EC;PHAISTOS DISC SIGN CAT;So;0;L;;;;;N;;;;;
+101ED;PHAISTOS DISC SIGN RAM;So;0;L;;;;;N;;;;;
+101EE;PHAISTOS DISC SIGN EAGLE;So;0;L;;;;;N;;;;;
+101EF;PHAISTOS DISC SIGN DOVE;So;0;L;;;;;N;;;;;
+101F0;PHAISTOS DISC SIGN TUNNY;So;0;L;;;;;N;;;;;
+101F1;PHAISTOS DISC SIGN BEE;So;0;L;;;;;N;;;;;
+101F2;PHAISTOS DISC SIGN PLANE TREE;So;0;L;;;;;N;;;;;
+101F3;PHAISTOS DISC SIGN VINE;So;0;L;;;;;N;;;;;
+101F4;PHAISTOS DISC SIGN PAPYRUS;So;0;L;;;;;N;;;;;
+101F5;PHAISTOS DISC SIGN ROSETTE;So;0;L;;;;;N;;;;;
+101F6;PHAISTOS DISC SIGN LILY;So;0;L;;;;;N;;;;;
+101F7;PHAISTOS DISC SIGN OX BACK;So;0;L;;;;;N;;;;;
+101F8;PHAISTOS DISC SIGN FLUTE;So;0;L;;;;;N;;;;;
+101F9;PHAISTOS DISC SIGN GRATER;So;0;L;;;;;N;;;;;
+101FA;PHAISTOS DISC SIGN STRAINER;So;0;L;;;;;N;;;;;
+101FB;PHAISTOS DISC SIGN SMALL AXE;So;0;L;;;;;N;;;;;
+101FC;PHAISTOS DISC SIGN WAVY BAND;So;0;L;;;;;N;;;;;
+101FD;PHAISTOS DISC SIGN COMBINING OBLIQUE STROKE;Mn;220;NSM;;;;;N;;;;;
+10280;LYCIAN LETTER A;Lo;0;L;;;;;N;;;;;
+10281;LYCIAN LETTER E;Lo;0;L;;;;;N;;;;;
+10282;LYCIAN LETTER B;Lo;0;L;;;;;N;;;;;
+10283;LYCIAN LETTER BH;Lo;0;L;;;;;N;;;;;
+10284;LYCIAN LETTER G;Lo;0;L;;;;;N;;;;;
+10285;LYCIAN LETTER D;Lo;0;L;;;;;N;;;;;
+10286;LYCIAN LETTER I;Lo;0;L;;;;;N;;;;;
+10287;LYCIAN LETTER W;Lo;0;L;;;;;N;;;;;
+10288;LYCIAN LETTER Z;Lo;0;L;;;;;N;;;;;
+10289;LYCIAN LETTER TH;Lo;0;L;;;;;N;;;;;
+1028A;LYCIAN LETTER J;Lo;0;L;;;;;N;;;;;
+1028B;LYCIAN LETTER K;Lo;0;L;;;;;N;;;;;
+1028C;LYCIAN LETTER Q;Lo;0;L;;;;;N;;;;;
+1028D;LYCIAN LETTER L;Lo;0;L;;;;;N;;;;;
+1028E;LYCIAN LETTER M;Lo;0;L;;;;;N;;;;;
+1028F;LYCIAN LETTER N;Lo;0;L;;;;;N;;;;;
+10290;LYCIAN LETTER MM;Lo;0;L;;;;;N;;;;;
+10291;LYCIAN LETTER NN;Lo;0;L;;;;;N;;;;;
+10292;LYCIAN LETTER U;Lo;0;L;;;;;N;;;;;
+10293;LYCIAN LETTER P;Lo;0;L;;;;;N;;;;;
+10294;LYCIAN LETTER KK;Lo;0;L;;;;;N;;;;;
+10295;LYCIAN LETTER R;Lo;0;L;;;;;N;;;;;
+10296;LYCIAN LETTER S;Lo;0;L;;;;;N;;;;;
+10297;LYCIAN LETTER T;Lo;0;L;;;;;N;;;;;
+10298;LYCIAN LETTER TT;Lo;0;L;;;;;N;;;;;
+10299;LYCIAN LETTER AN;Lo;0;L;;;;;N;;;;;
+1029A;LYCIAN LETTER EN;Lo;0;L;;;;;N;;;;;
+1029B;LYCIAN LETTER H;Lo;0;L;;;;;N;;;;;
+1029C;LYCIAN LETTER X;Lo;0;L;;;;;N;;;;;
+102A0;CARIAN LETTER A;Lo;0;L;;;;;N;;;;;
+102A1;CARIAN LETTER P2;Lo;0;L;;;;;N;;;;;
+102A2;CARIAN LETTER D;Lo;0;L;;;;;N;;;;;
+102A3;CARIAN LETTER L;Lo;0;L;;;;;N;;;;;
+102A4;CARIAN LETTER UUU;Lo;0;L;;;;;N;;;;;
+102A5;CARIAN LETTER R;Lo;0;L;;;;;N;;;;;
+102A6;CARIAN LETTER LD;Lo;0;L;;;;;N;;;;;
+102A7;CARIAN LETTER A2;Lo;0;L;;;;;N;;;;;
+102A8;CARIAN LETTER Q;Lo;0;L;;;;;N;;;;;
+102A9;CARIAN LETTER B;Lo;0;L;;;;;N;;;;;
+102AA;CARIAN LETTER M;Lo;0;L;;;;;N;;;;;
+102AB;CARIAN LETTER O;Lo;0;L;;;;;N;;;;;
+102AC;CARIAN LETTER D2;Lo;0;L;;;;;N;;;;;
+102AD;CARIAN LETTER T;Lo;0;L;;;;;N;;;;;
+102AE;CARIAN LETTER SH;Lo;0;L;;;;;N;;;;;
+102AF;CARIAN LETTER SH2;Lo;0;L;;;;;N;;;;;
+102B0;CARIAN LETTER S;Lo;0;L;;;;;N;;;;;
+102B1;CARIAN LETTER C-18;Lo;0;L;;;;;N;;;;;
+102B2;CARIAN LETTER U;Lo;0;L;;;;;N;;;;;
+102B3;CARIAN LETTER NN;Lo;0;L;;;;;N;;;;;
+102B4;CARIAN LETTER X;Lo;0;L;;;;;N;;;;;
+102B5;CARIAN LETTER N;Lo;0;L;;;;;N;;;;;
+102B6;CARIAN LETTER TT2;Lo;0;L;;;;;N;;;;;
+102B7;CARIAN LETTER P;Lo;0;L;;;;;N;;;;;
+102B8;CARIAN LETTER SS;Lo;0;L;;;;;N;;;;;
+102B9;CARIAN LETTER I;Lo;0;L;;;;;N;;;;;
+102BA;CARIAN LETTER E;Lo;0;L;;;;;N;;;;;
+102BB;CARIAN LETTER UUUU;Lo;0;L;;;;;N;;;;;
+102BC;CARIAN LETTER K;Lo;0;L;;;;;N;;;;;
+102BD;CARIAN LETTER K2;Lo;0;L;;;;;N;;;;;
+102BE;CARIAN LETTER ND;Lo;0;L;;;;;N;;;;;
+102BF;CARIAN LETTER UU;Lo;0;L;;;;;N;;;;;
+102C0;CARIAN LETTER G;Lo;0;L;;;;;N;;;;;
+102C1;CARIAN LETTER G2;Lo;0;L;;;;;N;;;;;
+102C2;CARIAN LETTER ST;Lo;0;L;;;;;N;;;;;
+102C3;CARIAN LETTER ST2;Lo;0;L;;;;;N;;;;;
+102C4;CARIAN LETTER NG;Lo;0;L;;;;;N;;;;;
+102C5;CARIAN LETTER II;Lo;0;L;;;;;N;;;;;
+102C6;CARIAN LETTER C-39;Lo;0;L;;;;;N;;;;;
+102C7;CARIAN LETTER TT;Lo;0;L;;;;;N;;;;;
+102C8;CARIAN LETTER UUU2;Lo;0;L;;;;;N;;;;;
+102C9;CARIAN LETTER RR;Lo;0;L;;;;;N;;;;;
+102CA;CARIAN LETTER MB;Lo;0;L;;;;;N;;;;;
+102CB;CARIAN LETTER MB2;Lo;0;L;;;;;N;;;;;
+102CC;CARIAN LETTER MB3;Lo;0;L;;;;;N;;;;;
+102CD;CARIAN LETTER MB4;Lo;0;L;;;;;N;;;;;
+102CE;CARIAN LETTER LD2;Lo;0;L;;;;;N;;;;;
+102CF;CARIAN LETTER E2;Lo;0;L;;;;;N;;;;;
+102D0;CARIAN LETTER UUU3;Lo;0;L;;;;;N;;;;;
+102E0;COPTIC EPACT THOUSANDS MARK;Mn;220;NSM;;;;;N;;;;;
+102E1;COPTIC EPACT DIGIT ONE;No;0;EN;;;;1;N;;;;;
+102E2;COPTIC EPACT DIGIT TWO;No;0;EN;;;;2;N;;;;;
+102E3;COPTIC EPACT DIGIT THREE;No;0;EN;;;;3;N;;;;;
+102E4;COPTIC EPACT DIGIT FOUR;No;0;EN;;;;4;N;;;;;
+102E5;COPTIC EPACT DIGIT FIVE;No;0;EN;;;;5;N;;;;;
+102E6;COPTIC EPACT DIGIT SIX;No;0;EN;;;;6;N;;;;;
+102E7;COPTIC EPACT DIGIT SEVEN;No;0;EN;;;;7;N;;;;;
+102E8;COPTIC EPACT DIGIT EIGHT;No;0;EN;;;;8;N;;;;;
+102E9;COPTIC EPACT DIGIT NINE;No;0;EN;;;;9;N;;;;;
+102EA;COPTIC EPACT NUMBER TEN;No;0;EN;;;;10;N;;;;;
+102EB;COPTIC EPACT NUMBER TWENTY;No;0;EN;;;;20;N;;;;;
+102EC;COPTIC EPACT NUMBER THIRTY;No;0;EN;;;;30;N;;;;;
+102ED;COPTIC EPACT NUMBER FORTY;No;0;EN;;;;40;N;;;;;
+102EE;COPTIC EPACT NUMBER FIFTY;No;0;EN;;;;50;N;;;;;
+102EF;COPTIC EPACT NUMBER SIXTY;No;0;EN;;;;60;N;;;;;
+102F0;COPTIC EPACT NUMBER SEVENTY;No;0;EN;;;;70;N;;;;;
+102F1;COPTIC EPACT NUMBER EIGHTY;No;0;EN;;;;80;N;;;;;
+102F2;COPTIC EPACT NUMBER NINETY;No;0;EN;;;;90;N;;;;;
+102F3;COPTIC EPACT NUMBER ONE HUNDRED;No;0;EN;;;;100;N;;;;;
+102F4;COPTIC EPACT NUMBER TWO HUNDRED;No;0;EN;;;;200;N;;;;;
+102F5;COPTIC EPACT NUMBER THREE HUNDRED;No;0;EN;;;;300;N;;;;;
+102F6;COPTIC EPACT NUMBER FOUR HUNDRED;No;0;EN;;;;400;N;;;;;
+102F7;COPTIC EPACT NUMBER FIVE HUNDRED;No;0;EN;;;;500;N;;;;;
+102F8;COPTIC EPACT NUMBER SIX HUNDRED;No;0;EN;;;;600;N;;;;;
+102F9;COPTIC EPACT NUMBER SEVEN HUNDRED;No;0;EN;;;;700;N;;;;;
+102FA;COPTIC EPACT NUMBER EIGHT HUNDRED;No;0;EN;;;;800;N;;;;;
+102FB;COPTIC EPACT NUMBER NINE HUNDRED;No;0;EN;;;;900;N;;;;;
+10300;OLD ITALIC LETTER A;Lo;0;L;;;;;N;;;;;
+10301;OLD ITALIC LETTER BE;Lo;0;L;;;;;N;;;;;
+10302;OLD ITALIC LETTER KE;Lo;0;L;;;;;N;;;;;
+10303;OLD ITALIC LETTER DE;Lo;0;L;;;;;N;;;;;
+10304;OLD ITALIC LETTER E;Lo;0;L;;;;;N;;;;;
+10305;OLD ITALIC LETTER VE;Lo;0;L;;;;;N;;;;;
+10306;OLD ITALIC LETTER ZE;Lo;0;L;;;;;N;;;;;
+10307;OLD ITALIC LETTER HE;Lo;0;L;;;;;N;;;;;
+10308;OLD ITALIC LETTER THE;Lo;0;L;;;;;N;;;;;
+10309;OLD ITALIC LETTER I;Lo;0;L;;;;;N;;;;;
+1030A;OLD ITALIC LETTER KA;Lo;0;L;;;;;N;;;;;
+1030B;OLD ITALIC LETTER EL;Lo;0;L;;;;;N;;;;;
+1030C;OLD ITALIC LETTER EM;Lo;0;L;;;;;N;;;;;
+1030D;OLD ITALIC LETTER EN;Lo;0;L;;;;;N;;;;;
+1030E;OLD ITALIC LETTER ESH;Lo;0;L;;;;;N;;;;;
+1030F;OLD ITALIC LETTER O;Lo;0;L;;;;;N;;;;;
+10310;OLD ITALIC LETTER PE;Lo;0;L;;;;;N;;;;;
+10311;OLD ITALIC LETTER SHE;Lo;0;L;;;;;N;;;;;
+10312;OLD ITALIC LETTER KU;Lo;0;L;;;;;N;;;;;
+10313;OLD ITALIC LETTER ER;Lo;0;L;;;;;N;;;;;
+10314;OLD ITALIC LETTER ES;Lo;0;L;;;;;N;;;;;
+10315;OLD ITALIC LETTER TE;Lo;0;L;;;;;N;;;;;
+10316;OLD ITALIC LETTER U;Lo;0;L;;;;;N;;;;;
+10317;OLD ITALIC LETTER EKS;Lo;0;L;;;;;N;;;;;
+10318;OLD ITALIC LETTER PHE;Lo;0;L;;;;;N;;;;;
+10319;OLD ITALIC LETTER KHE;Lo;0;L;;;;;N;;;;;
+1031A;OLD ITALIC LETTER EF;Lo;0;L;;;;;N;;;;;
+1031B;OLD ITALIC LETTER ERS;Lo;0;L;;;;;N;;;;;
+1031C;OLD ITALIC LETTER CHE;Lo;0;L;;;;;N;;;;;
+1031D;OLD ITALIC LETTER II;Lo;0;L;;;;;N;;;;;
+1031E;OLD ITALIC LETTER UU;Lo;0;L;;;;;N;;;;;
+1031F;OLD ITALIC LETTER ESS;Lo;0;L;;;;;N;;;;;
+10320;OLD ITALIC NUMERAL ONE;No;0;L;;;;1;N;;;;;
+10321;OLD ITALIC NUMERAL FIVE;No;0;L;;;;5;N;;;;;
+10322;OLD ITALIC NUMERAL TEN;No;0;L;;;;10;N;;;;;
+10323;OLD ITALIC NUMERAL FIFTY;No;0;L;;;;50;N;;;;;
+1032D;OLD ITALIC LETTER YE;Lo;0;L;;;;;N;;;;;
+1032E;OLD ITALIC LETTER NORTHERN TSE;Lo;0;L;;;;;N;;;;;
+1032F;OLD ITALIC LETTER SOUTHERN TSE;Lo;0;L;;;;;N;;;;;
+10330;GOTHIC LETTER AHSA;Lo;0;L;;;;;N;;;;;
+10331;GOTHIC LETTER BAIRKAN;Lo;0;L;;;;;N;;;;;
+10332;GOTHIC LETTER GIBA;Lo;0;L;;;;;N;;;;;
+10333;GOTHIC LETTER DAGS;Lo;0;L;;;;;N;;;;;
+10334;GOTHIC LETTER AIHVUS;Lo;0;L;;;;;N;;;;;
+10335;GOTHIC LETTER QAIRTHRA;Lo;0;L;;;;;N;;;;;
+10336;GOTHIC LETTER IUJA;Lo;0;L;;;;;N;;;;;
+10337;GOTHIC LETTER HAGL;Lo;0;L;;;;;N;;;;;
+10338;GOTHIC LETTER THIUTH;Lo;0;L;;;;;N;;;;;
+10339;GOTHIC LETTER EIS;Lo;0;L;;;;;N;;;;;
+1033A;GOTHIC LETTER KUSMA;Lo;0;L;;;;;N;;;;;
+1033B;GOTHIC LETTER LAGUS;Lo;0;L;;;;;N;;;;;
+1033C;GOTHIC LETTER MANNA;Lo;0;L;;;;;N;;;;;
+1033D;GOTHIC LETTER NAUTHS;Lo;0;L;;;;;N;;;;;
+1033E;GOTHIC LETTER JER;Lo;0;L;;;;;N;;;;;
+1033F;GOTHIC LETTER URUS;Lo;0;L;;;;;N;;;;;
+10340;GOTHIC LETTER PAIRTHRA;Lo;0;L;;;;;N;;;;;
+10341;GOTHIC LETTER NINETY;Nl;0;L;;;;90;N;;;;;
+10342;GOTHIC LETTER RAIDA;Lo;0;L;;;;;N;;;;;
+10343;GOTHIC LETTER SAUIL;Lo;0;L;;;;;N;;;;;
+10344;GOTHIC LETTER TEIWS;Lo;0;L;;;;;N;;;;;
+10345;GOTHIC LETTER WINJA;Lo;0;L;;;;;N;;;;;
+10346;GOTHIC LETTER FAIHU;Lo;0;L;;;;;N;;;;;
+10347;GOTHIC LETTER IGGWS;Lo;0;L;;;;;N;;;;;
+10348;GOTHIC LETTER HWAIR;Lo;0;L;;;;;N;;;;;
+10349;GOTHIC LETTER OTHAL;Lo;0;L;;;;;N;;;;;
+1034A;GOTHIC LETTER NINE HUNDRED;Nl;0;L;;;;900;N;;;;;
+10350;OLD PERMIC LETTER AN;Lo;0;L;;;;;N;;;;;
+10351;OLD PERMIC LETTER BUR;Lo;0;L;;;;;N;;;;;
+10352;OLD PERMIC LETTER GAI;Lo;0;L;;;;;N;;;;;
+10353;OLD PERMIC LETTER DOI;Lo;0;L;;;;;N;;;;;
+10354;OLD PERMIC LETTER E;Lo;0;L;;;;;N;;;;;
+10355;OLD PERMIC LETTER ZHOI;Lo;0;L;;;;;N;;;;;
+10356;OLD PERMIC LETTER DZHOI;Lo;0;L;;;;;N;;;;;
+10357;OLD PERMIC LETTER ZATA;Lo;0;L;;;;;N;;;;;
+10358;OLD PERMIC LETTER DZITA;Lo;0;L;;;;;N;;;;;
+10359;OLD PERMIC LETTER I;Lo;0;L;;;;;N;;;;;
+1035A;OLD PERMIC LETTER KOKE;Lo;0;L;;;;;N;;;;;
+1035B;OLD PERMIC LETTER LEI;Lo;0;L;;;;;N;;;;;
+1035C;OLD PERMIC LETTER MENOE;Lo;0;L;;;;;N;;;;;
+1035D;OLD PERMIC LETTER NENOE;Lo;0;L;;;;;N;;;;;
+1035E;OLD PERMIC LETTER VOOI;Lo;0;L;;;;;N;;;;;
+1035F;OLD PERMIC LETTER PEEI;Lo;0;L;;;;;N;;;;;
+10360;OLD PERMIC LETTER REI;Lo;0;L;;;;;N;;;;;
+10361;OLD PERMIC LETTER SII;Lo;0;L;;;;;N;;;;;
+10362;OLD PERMIC LETTER TAI;Lo;0;L;;;;;N;;;;;
+10363;OLD PERMIC LETTER U;Lo;0;L;;;;;N;;;;;
+10364;OLD PERMIC LETTER CHERY;Lo;0;L;;;;;N;;;;;
+10365;OLD PERMIC LETTER SHOOI;Lo;0;L;;;;;N;;;;;
+10366;OLD PERMIC LETTER SHCHOOI;Lo;0;L;;;;;N;;;;;
+10367;OLD PERMIC LETTER YRY;Lo;0;L;;;;;N;;;;;
+10368;OLD PERMIC LETTER YERU;Lo;0;L;;;;;N;;;;;
+10369;OLD PERMIC LETTER O;Lo;0;L;;;;;N;;;;;
+1036A;OLD PERMIC LETTER OO;Lo;0;L;;;;;N;;;;;
+1036B;OLD PERMIC LETTER EF;Lo;0;L;;;;;N;;;;;
+1036C;OLD PERMIC LETTER HA;Lo;0;L;;;;;N;;;;;
+1036D;OLD PERMIC LETTER TSIU;Lo;0;L;;;;;N;;;;;
+1036E;OLD PERMIC LETTER VER;Lo;0;L;;;;;N;;;;;
+1036F;OLD PERMIC LETTER YER;Lo;0;L;;;;;N;;;;;
+10370;OLD PERMIC LETTER YERI;Lo;0;L;;;;;N;;;;;
+10371;OLD PERMIC LETTER YAT;Lo;0;L;;;;;N;;;;;
+10372;OLD PERMIC LETTER IE;Lo;0;L;;;;;N;;;;;
+10373;OLD PERMIC LETTER YU;Lo;0;L;;;;;N;;;;;
+10374;OLD PERMIC LETTER YA;Lo;0;L;;;;;N;;;;;
+10375;OLD PERMIC LETTER IA;Lo;0;L;;;;;N;;;;;
+10376;COMBINING OLD PERMIC LETTER AN;Mn;230;NSM;;;;;N;;;;;
+10377;COMBINING OLD PERMIC LETTER DOI;Mn;230;NSM;;;;;N;;;;;
+10378;COMBINING OLD PERMIC LETTER ZATA;Mn;230;NSM;;;;;N;;;;;
+10379;COMBINING OLD PERMIC LETTER NENOE;Mn;230;NSM;;;;;N;;;;;
+1037A;COMBINING OLD PERMIC LETTER SII;Mn;230;NSM;;;;;N;;;;;
+10380;UGARITIC LETTER ALPA;Lo;0;L;;;;;N;;;;;
+10381;UGARITIC LETTER BETA;Lo;0;L;;;;;N;;;;;
+10382;UGARITIC LETTER GAMLA;Lo;0;L;;;;;N;;;;;
+10383;UGARITIC LETTER KHA;Lo;0;L;;;;;N;;;;;
+10384;UGARITIC LETTER DELTA;Lo;0;L;;;;;N;;;;;
+10385;UGARITIC LETTER HO;Lo;0;L;;;;;N;;;;;
+10386;UGARITIC LETTER WO;Lo;0;L;;;;;N;;;;;
+10387;UGARITIC LETTER ZETA;Lo;0;L;;;;;N;;;;;
+10388;UGARITIC LETTER HOTA;Lo;0;L;;;;;N;;;;;
+10389;UGARITIC LETTER TET;Lo;0;L;;;;;N;;;;;
+1038A;UGARITIC LETTER YOD;Lo;0;L;;;;;N;;;;;
+1038B;UGARITIC LETTER KAF;Lo;0;L;;;;;N;;;;;
+1038C;UGARITIC LETTER SHIN;Lo;0;L;;;;;N;;;;;
+1038D;UGARITIC LETTER LAMDA;Lo;0;L;;;;;N;;;;;
+1038E;UGARITIC LETTER MEM;Lo;0;L;;;;;N;;;;;
+1038F;UGARITIC LETTER DHAL;Lo;0;L;;;;;N;;;;;
+10390;UGARITIC LETTER NUN;Lo;0;L;;;;;N;;;;;
+10391;UGARITIC LETTER ZU;Lo;0;L;;;;;N;;;;;
+10392;UGARITIC LETTER SAMKA;Lo;0;L;;;;;N;;;;;
+10393;UGARITIC LETTER AIN;Lo;0;L;;;;;N;;;;;
+10394;UGARITIC LETTER PU;Lo;0;L;;;;;N;;;;;
+10395;UGARITIC LETTER SADE;Lo;0;L;;;;;N;;;;;
+10396;UGARITIC LETTER QOPA;Lo;0;L;;;;;N;;;;;
+10397;UGARITIC LETTER RASHA;Lo;0;L;;;;;N;;;;;
+10398;UGARITIC LETTER THANNA;Lo;0;L;;;;;N;;;;;
+10399;UGARITIC LETTER GHAIN;Lo;0;L;;;;;N;;;;;
+1039A;UGARITIC LETTER TO;Lo;0;L;;;;;N;;;;;
+1039B;UGARITIC LETTER I;Lo;0;L;;;;;N;;;;;
+1039C;UGARITIC LETTER U;Lo;0;L;;;;;N;;;;;
+1039D;UGARITIC LETTER SSU;Lo;0;L;;;;;N;;;;;
+1039F;UGARITIC WORD DIVIDER;Po;0;L;;;;;N;;;;;
+103A0;OLD PERSIAN SIGN A;Lo;0;L;;;;;N;;;;;
+103A1;OLD PERSIAN SIGN I;Lo;0;L;;;;;N;;;;;
+103A2;OLD PERSIAN SIGN U;Lo;0;L;;;;;N;;;;;
+103A3;OLD PERSIAN SIGN KA;Lo;0;L;;;;;N;;;;;
+103A4;OLD PERSIAN SIGN KU;Lo;0;L;;;;;N;;;;;
+103A5;OLD PERSIAN SIGN GA;Lo;0;L;;;;;N;;;;;
+103A6;OLD PERSIAN SIGN GU;Lo;0;L;;;;;N;;;;;
+103A7;OLD PERSIAN SIGN XA;Lo;0;L;;;;;N;;;;;
+103A8;OLD PERSIAN SIGN CA;Lo;0;L;;;;;N;;;;;
+103A9;OLD PERSIAN SIGN JA;Lo;0;L;;;;;N;;;;;
+103AA;OLD PERSIAN SIGN JI;Lo;0;L;;;;;N;;;;;
+103AB;OLD PERSIAN SIGN TA;Lo;0;L;;;;;N;;;;;
+103AC;OLD PERSIAN SIGN TU;Lo;0;L;;;;;N;;;;;
+103AD;OLD PERSIAN SIGN DA;Lo;0;L;;;;;N;;;;;
+103AE;OLD PERSIAN SIGN DI;Lo;0;L;;;;;N;;;;;
+103AF;OLD PERSIAN SIGN DU;Lo;0;L;;;;;N;;;;;
+103B0;OLD PERSIAN SIGN THA;Lo;0;L;;;;;N;;;;;
+103B1;OLD PERSIAN SIGN PA;Lo;0;L;;;;;N;;;;;
+103B2;OLD PERSIAN SIGN BA;Lo;0;L;;;;;N;;;;;
+103B3;OLD PERSIAN SIGN FA;Lo;0;L;;;;;N;;;;;
+103B4;OLD PERSIAN SIGN NA;Lo;0;L;;;;;N;;;;;
+103B5;OLD PERSIAN SIGN NU;Lo;0;L;;;;;N;;;;;
+103B6;OLD PERSIAN SIGN MA;Lo;0;L;;;;;N;;;;;
+103B7;OLD PERSIAN SIGN MI;Lo;0;L;;;;;N;;;;;
+103B8;OLD PERSIAN SIGN MU;Lo;0;L;;;;;N;;;;;
+103B9;OLD PERSIAN SIGN YA;Lo;0;L;;;;;N;;;;;
+103BA;OLD PERSIAN SIGN VA;Lo;0;L;;;;;N;;;;;
+103BB;OLD PERSIAN SIGN VI;Lo;0;L;;;;;N;;;;;
+103BC;OLD PERSIAN SIGN RA;Lo;0;L;;;;;N;;;;;
+103BD;OLD PERSIAN SIGN RU;Lo;0;L;;;;;N;;;;;
+103BE;OLD PERSIAN SIGN LA;Lo;0;L;;;;;N;;;;;
+103BF;OLD PERSIAN SIGN SA;Lo;0;L;;;;;N;;;;;
+103C0;OLD PERSIAN SIGN ZA;Lo;0;L;;;;;N;;;;;
+103C1;OLD PERSIAN SIGN SHA;Lo;0;L;;;;;N;;;;;
+103C2;OLD PERSIAN SIGN SSA;Lo;0;L;;;;;N;;;;;
+103C3;OLD PERSIAN SIGN HA;Lo;0;L;;;;;N;;;;;
+103C8;OLD PERSIAN SIGN AURAMAZDAA;Lo;0;L;;;;;N;;;;;
+103C9;OLD PERSIAN SIGN AURAMAZDAA-2;Lo;0;L;;;;;N;;;;;
+103CA;OLD PERSIAN SIGN AURAMAZDAAHA;Lo;0;L;;;;;N;;;;;
+103CB;OLD PERSIAN SIGN XSHAAYATHIYA;Lo;0;L;;;;;N;;;;;
+103CC;OLD PERSIAN SIGN DAHYAAUSH;Lo;0;L;;;;;N;;;;;
+103CD;OLD PERSIAN SIGN DAHYAAUSH-2;Lo;0;L;;;;;N;;;;;
+103CE;OLD PERSIAN SIGN BAGA;Lo;0;L;;;;;N;;;;;
+103CF;OLD PERSIAN SIGN BUUMISH;Lo;0;L;;;;;N;;;;;
+103D0;OLD PERSIAN WORD DIVIDER;Po;0;L;;;;;N;;;;;
+103D1;OLD PERSIAN NUMBER ONE;Nl;0;L;;;;1;N;;;;;
+103D2;OLD PERSIAN NUMBER TWO;Nl;0;L;;;;2;N;;;;;
+103D3;OLD PERSIAN NUMBER TEN;Nl;0;L;;;;10;N;;;;;
+103D4;OLD PERSIAN NUMBER TWENTY;Nl;0;L;;;;20;N;;;;;
+103D5;OLD PERSIAN NUMBER HUNDRED;Nl;0;L;;;;100;N;;;;;
+10400;DESERET CAPITAL LETTER LONG I;Lu;0;L;;;;;N;;;;10428;
+10401;DESERET CAPITAL LETTER LONG E;Lu;0;L;;;;;N;;;;10429;
+10402;DESERET CAPITAL LETTER LONG A;Lu;0;L;;;;;N;;;;1042A;
+10403;DESERET CAPITAL LETTER LONG AH;Lu;0;L;;;;;N;;;;1042B;
+10404;DESERET CAPITAL LETTER LONG O;Lu;0;L;;;;;N;;;;1042C;
+10405;DESERET CAPITAL LETTER LONG OO;Lu;0;L;;;;;N;;;;1042D;
+10406;DESERET CAPITAL LETTER SHORT I;Lu;0;L;;;;;N;;;;1042E;
+10407;DESERET CAPITAL LETTER SHORT E;Lu;0;L;;;;;N;;;;1042F;
+10408;DESERET CAPITAL LETTER SHORT A;Lu;0;L;;;;;N;;;;10430;
+10409;DESERET CAPITAL LETTER SHORT AH;Lu;0;L;;;;;N;;;;10431;
+1040A;DESERET CAPITAL LETTER SHORT O;Lu;0;L;;;;;N;;;;10432;
+1040B;DESERET CAPITAL LETTER SHORT OO;Lu;0;L;;;;;N;;;;10433;
+1040C;DESERET CAPITAL LETTER AY;Lu;0;L;;;;;N;;;;10434;
+1040D;DESERET CAPITAL LETTER OW;Lu;0;L;;;;;N;;;;10435;
+1040E;DESERET CAPITAL LETTER WU;Lu;0;L;;;;;N;;;;10436;
+1040F;DESERET CAPITAL LETTER YEE;Lu;0;L;;;;;N;;;;10437;
+10410;DESERET CAPITAL LETTER H;Lu;0;L;;;;;N;;;;10438;
+10411;DESERET CAPITAL LETTER PEE;Lu;0;L;;;;;N;;;;10439;
+10412;DESERET CAPITAL LETTER BEE;Lu;0;L;;;;;N;;;;1043A;
+10413;DESERET CAPITAL LETTER TEE;Lu;0;L;;;;;N;;;;1043B;
+10414;DESERET CAPITAL LETTER DEE;Lu;0;L;;;;;N;;;;1043C;
+10415;DESERET CAPITAL LETTER CHEE;Lu;0;L;;;;;N;;;;1043D;
+10416;DESERET CAPITAL LETTER JEE;Lu;0;L;;;;;N;;;;1043E;
+10417;DESERET CAPITAL LETTER KAY;Lu;0;L;;;;;N;;;;1043F;
+10418;DESERET CAPITAL LETTER GAY;Lu;0;L;;;;;N;;;;10440;
+10419;DESERET CAPITAL LETTER EF;Lu;0;L;;;;;N;;;;10441;
+1041A;DESERET CAPITAL LETTER VEE;Lu;0;L;;;;;N;;;;10442;
+1041B;DESERET CAPITAL LETTER ETH;Lu;0;L;;;;;N;;;;10443;
+1041C;DESERET CAPITAL LETTER THEE;Lu;0;L;;;;;N;;;;10444;
+1041D;DESERET CAPITAL LETTER ES;Lu;0;L;;;;;N;;;;10445;
+1041E;DESERET CAPITAL LETTER ZEE;Lu;0;L;;;;;N;;;;10446;
+1041F;DESERET CAPITAL LETTER ESH;Lu;0;L;;;;;N;;;;10447;
+10420;DESERET CAPITAL LETTER ZHEE;Lu;0;L;;;;;N;;;;10448;
+10421;DESERET CAPITAL LETTER ER;Lu;0;L;;;;;N;;;;10449;
+10422;DESERET CAPITAL LETTER EL;Lu;0;L;;;;;N;;;;1044A;
+10423;DESERET CAPITAL LETTER EM;Lu;0;L;;;;;N;;;;1044B;
+10424;DESERET CAPITAL LETTER EN;Lu;0;L;;;;;N;;;;1044C;
+10425;DESERET CAPITAL LETTER ENG;Lu;0;L;;;;;N;;;;1044D;
+10426;DESERET CAPITAL LETTER OI;Lu;0;L;;;;;N;;;;1044E;
+10427;DESERET CAPITAL LETTER EW;Lu;0;L;;;;;N;;;;1044F;
+10428;DESERET SMALL LETTER LONG I;Ll;0;L;;;;;N;;;10400;;10400
+10429;DESERET SMALL LETTER LONG E;Ll;0;L;;;;;N;;;10401;;10401
+1042A;DESERET SMALL LETTER LONG A;Ll;0;L;;;;;N;;;10402;;10402
+1042B;DESERET SMALL LETTER LONG AH;Ll;0;L;;;;;N;;;10403;;10403
+1042C;DESERET SMALL LETTER LONG O;Ll;0;L;;;;;N;;;10404;;10404
+1042D;DESERET SMALL LETTER LONG OO;Ll;0;L;;;;;N;;;10405;;10405
+1042E;DESERET SMALL LETTER SHORT I;Ll;0;L;;;;;N;;;10406;;10406
+1042F;DESERET SMALL LETTER SHORT E;Ll;0;L;;;;;N;;;10407;;10407
+10430;DESERET SMALL LETTER SHORT A;Ll;0;L;;;;;N;;;10408;;10408
+10431;DESERET SMALL LETTER SHORT AH;Ll;0;L;;;;;N;;;10409;;10409
+10432;DESERET SMALL LETTER SHORT O;Ll;0;L;;;;;N;;;1040A;;1040A
+10433;DESERET SMALL LETTER SHORT OO;Ll;0;L;;;;;N;;;1040B;;1040B
+10434;DESERET SMALL LETTER AY;Ll;0;L;;;;;N;;;1040C;;1040C
+10435;DESERET SMALL LETTER OW;Ll;0;L;;;;;N;;;1040D;;1040D
+10436;DESERET SMALL LETTER WU;Ll;0;L;;;;;N;;;1040E;;1040E
+10437;DESERET SMALL LETTER YEE;Ll;0;L;;;;;N;;;1040F;;1040F
+10438;DESERET SMALL LETTER H;Ll;0;L;;;;;N;;;10410;;10410
+10439;DESERET SMALL LETTER PEE;Ll;0;L;;;;;N;;;10411;;10411
+1043A;DESERET SMALL LETTER BEE;Ll;0;L;;;;;N;;;10412;;10412
+1043B;DESERET SMALL LETTER TEE;Ll;0;L;;;;;N;;;10413;;10413
+1043C;DESERET SMALL LETTER DEE;Ll;0;L;;;;;N;;;10414;;10414
+1043D;DESERET SMALL LETTER CHEE;Ll;0;L;;;;;N;;;10415;;10415
+1043E;DESERET SMALL LETTER JEE;Ll;0;L;;;;;N;;;10416;;10416
+1043F;DESERET SMALL LETTER KAY;Ll;0;L;;;;;N;;;10417;;10417
+10440;DESERET SMALL LETTER GAY;Ll;0;L;;;;;N;;;10418;;10418
+10441;DESERET SMALL LETTER EF;Ll;0;L;;;;;N;;;10419;;10419
+10442;DESERET SMALL LETTER VEE;Ll;0;L;;;;;N;;;1041A;;1041A
+10443;DESERET SMALL LETTER ETH;Ll;0;L;;;;;N;;;1041B;;1041B
+10444;DESERET SMALL LETTER THEE;Ll;0;L;;;;;N;;;1041C;;1041C
+10445;DESERET SMALL LETTER ES;Ll;0;L;;;;;N;;;1041D;;1041D
+10446;DESERET SMALL LETTER ZEE;Ll;0;L;;;;;N;;;1041E;;1041E
+10447;DESERET SMALL LETTER ESH;Ll;0;L;;;;;N;;;1041F;;1041F
+10448;DESERET SMALL LETTER ZHEE;Ll;0;L;;;;;N;;;10420;;10420
+10449;DESERET SMALL LETTER ER;Ll;0;L;;;;;N;;;10421;;10421
+1044A;DESERET SMALL LETTER EL;Ll;0;L;;;;;N;;;10422;;10422
+1044B;DESERET SMALL LETTER EM;Ll;0;L;;;;;N;;;10423;;10423
+1044C;DESERET SMALL LETTER EN;Ll;0;L;;;;;N;;;10424;;10424
+1044D;DESERET SMALL LETTER ENG;Ll;0;L;;;;;N;;;10425;;10425
+1044E;DESERET SMALL LETTER OI;Ll;0;L;;;;;N;;;10426;;10426
+1044F;DESERET SMALL LETTER EW;Ll;0;L;;;;;N;;;10427;;10427
+10450;SHAVIAN LETTER PEEP;Lo;0;L;;;;;N;;;;;
+10451;SHAVIAN LETTER TOT;Lo;0;L;;;;;N;;;;;
+10452;SHAVIAN LETTER KICK;Lo;0;L;;;;;N;;;;;
+10453;SHAVIAN LETTER FEE;Lo;0;L;;;;;N;;;;;
+10454;SHAVIAN LETTER THIGH;Lo;0;L;;;;;N;;;;;
+10455;SHAVIAN LETTER SO;Lo;0;L;;;;;N;;;;;
+10456;SHAVIAN LETTER SURE;Lo;0;L;;;;;N;;;;;
+10457;SHAVIAN LETTER CHURCH;Lo;0;L;;;;;N;;;;;
+10458;SHAVIAN LETTER YEA;Lo;0;L;;;;;N;;;;;
+10459;SHAVIAN LETTER HUNG;Lo;0;L;;;;;N;;;;;
+1045A;SHAVIAN LETTER BIB;Lo;0;L;;;;;N;;;;;
+1045B;SHAVIAN LETTER DEAD;Lo;0;L;;;;;N;;;;;
+1045C;SHAVIAN LETTER GAG;Lo;0;L;;;;;N;;;;;
+1045D;SHAVIAN LETTER VOW;Lo;0;L;;;;;N;;;;;
+1045E;SHAVIAN LETTER THEY;Lo;0;L;;;;;N;;;;;
+1045F;SHAVIAN LETTER ZOO;Lo;0;L;;;;;N;;;;;
+10460;SHAVIAN LETTER MEASURE;Lo;0;L;;;;;N;;;;;
+10461;SHAVIAN LETTER JUDGE;Lo;0;L;;;;;N;;;;;
+10462;SHAVIAN LETTER WOE;Lo;0;L;;;;;N;;;;;
+10463;SHAVIAN LETTER HA-HA;Lo;0;L;;;;;N;;;;;
+10464;SHAVIAN LETTER LOLL;Lo;0;L;;;;;N;;;;;
+10465;SHAVIAN LETTER MIME;Lo;0;L;;;;;N;;;;;
+10466;SHAVIAN LETTER IF;Lo;0;L;;;;;N;;;;;
+10467;SHAVIAN LETTER EGG;Lo;0;L;;;;;N;;;;;
+10468;SHAVIAN LETTER ASH;Lo;0;L;;;;;N;;;;;
+10469;SHAVIAN LETTER ADO;Lo;0;L;;;;;N;;;;;
+1046A;SHAVIAN LETTER ON;Lo;0;L;;;;;N;;;;;
+1046B;SHAVIAN LETTER WOOL;Lo;0;L;;;;;N;;;;;
+1046C;SHAVIAN LETTER OUT;Lo;0;L;;;;;N;;;;;
+1046D;SHAVIAN LETTER AH;Lo;0;L;;;;;N;;;;;
+1046E;SHAVIAN LETTER ROAR;Lo;0;L;;;;;N;;;;;
+1046F;SHAVIAN LETTER NUN;Lo;0;L;;;;;N;;;;;
+10470;SHAVIAN LETTER EAT;Lo;0;L;;;;;N;;;;;
+10471;SHAVIAN LETTER AGE;Lo;0;L;;;;;N;;;;;
+10472;SHAVIAN LETTER ICE;Lo;0;L;;;;;N;;;;;
+10473;SHAVIAN LETTER UP;Lo;0;L;;;;;N;;;;;
+10474;SHAVIAN LETTER OAK;Lo;0;L;;;;;N;;;;;
+10475;SHAVIAN LETTER OOZE;Lo;0;L;;;;;N;;;;;
+10476;SHAVIAN LETTER OIL;Lo;0;L;;;;;N;;;;;
+10477;SHAVIAN LETTER AWE;Lo;0;L;;;;;N;;;;;
+10478;SHAVIAN LETTER ARE;Lo;0;L;;;;;N;;;;;
+10479;SHAVIAN LETTER OR;Lo;0;L;;;;;N;;;;;
+1047A;SHAVIAN LETTER AIR;Lo;0;L;;;;;N;;;;;
+1047B;SHAVIAN LETTER ERR;Lo;0;L;;;;;N;;;;;
+1047C;SHAVIAN LETTER ARRAY;Lo;0;L;;;;;N;;;;;
+1047D;SHAVIAN LETTER EAR;Lo;0;L;;;;;N;;;;;
+1047E;SHAVIAN LETTER IAN;Lo;0;L;;;;;N;;;;;
+1047F;SHAVIAN LETTER YEW;Lo;0;L;;;;;N;;;;;
+10480;OSMANYA LETTER ALEF;Lo;0;L;;;;;N;;;;;
+10481;OSMANYA LETTER BA;Lo;0;L;;;;;N;;;;;
+10482;OSMANYA LETTER TA;Lo;0;L;;;;;N;;;;;
+10483;OSMANYA LETTER JA;Lo;0;L;;;;;N;;;;;
+10484;OSMANYA LETTER XA;Lo;0;L;;;;;N;;;;;
+10485;OSMANYA LETTER KHA;Lo;0;L;;;;;N;;;;;
+10486;OSMANYA LETTER DEEL;Lo;0;L;;;;;N;;;;;
+10487;OSMANYA LETTER RA;Lo;0;L;;;;;N;;;;;
+10488;OSMANYA LETTER SA;Lo;0;L;;;;;N;;;;;
+10489;OSMANYA LETTER SHIIN;Lo;0;L;;;;;N;;;;;
+1048A;OSMANYA LETTER DHA;Lo;0;L;;;;;N;;;;;
+1048B;OSMANYA LETTER CAYN;Lo;0;L;;;;;N;;;;;
+1048C;OSMANYA LETTER GA;Lo;0;L;;;;;N;;;;;
+1048D;OSMANYA LETTER FA;Lo;0;L;;;;;N;;;;;
+1048E;OSMANYA LETTER QAAF;Lo;0;L;;;;;N;;;;;
+1048F;OSMANYA LETTER KAAF;Lo;0;L;;;;;N;;;;;
+10490;OSMANYA LETTER LAAN;Lo;0;L;;;;;N;;;;;
+10491;OSMANYA LETTER MIIN;Lo;0;L;;;;;N;;;;;
+10492;OSMANYA LETTER NUUN;Lo;0;L;;;;;N;;;;;
+10493;OSMANYA LETTER WAW;Lo;0;L;;;;;N;;;;;
+10494;OSMANYA LETTER HA;Lo;0;L;;;;;N;;;;;
+10495;OSMANYA LETTER YA;Lo;0;L;;;;;N;;;;;
+10496;OSMANYA LETTER A;Lo;0;L;;;;;N;;;;;
+10497;OSMANYA LETTER E;Lo;0;L;;;;;N;;;;;
+10498;OSMANYA LETTER I;Lo;0;L;;;;;N;;;;;
+10499;OSMANYA LETTER O;Lo;0;L;;;;;N;;;;;
+1049A;OSMANYA LETTER U;Lo;0;L;;;;;N;;;;;
+1049B;OSMANYA LETTER AA;Lo;0;L;;;;;N;;;;;
+1049C;OSMANYA LETTER EE;Lo;0;L;;;;;N;;;;;
+1049D;OSMANYA LETTER OO;Lo;0;L;;;;;N;;;;;
+104A0;OSMANYA DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+104A1;OSMANYA DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+104A2;OSMANYA DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+104A3;OSMANYA DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+104A4;OSMANYA DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+104A5;OSMANYA DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+104A6;OSMANYA DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+104A7;OSMANYA DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+104A8;OSMANYA DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+104A9;OSMANYA DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+104B0;OSAGE CAPITAL LETTER A;Lu;0;L;;;;;N;;;;104D8;
+104B1;OSAGE CAPITAL LETTER AI;Lu;0;L;;;;;N;;;;104D9;
+104B2;OSAGE CAPITAL LETTER AIN;Lu;0;L;;;;;N;;;;104DA;
+104B3;OSAGE CAPITAL LETTER AH;Lu;0;L;;;;;N;;;;104DB;
+104B4;OSAGE CAPITAL LETTER BRA;Lu;0;L;;;;;N;;;;104DC;
+104B5;OSAGE CAPITAL LETTER CHA;Lu;0;L;;;;;N;;;;104DD;
+104B6;OSAGE CAPITAL LETTER EHCHA;Lu;0;L;;;;;N;;;;104DE;
+104B7;OSAGE CAPITAL LETTER E;Lu;0;L;;;;;N;;;;104DF;
+104B8;OSAGE CAPITAL LETTER EIN;Lu;0;L;;;;;N;;;;104E0;
+104B9;OSAGE CAPITAL LETTER HA;Lu;0;L;;;;;N;;;;104E1;
+104BA;OSAGE CAPITAL LETTER HYA;Lu;0;L;;;;;N;;;;104E2;
+104BB;OSAGE CAPITAL LETTER I;Lu;0;L;;;;;N;;;;104E3;
+104BC;OSAGE CAPITAL LETTER KA;Lu;0;L;;;;;N;;;;104E4;
+104BD;OSAGE CAPITAL LETTER EHKA;Lu;0;L;;;;;N;;;;104E5;
+104BE;OSAGE CAPITAL LETTER KYA;Lu;0;L;;;;;N;;;;104E6;
+104BF;OSAGE CAPITAL LETTER LA;Lu;0;L;;;;;N;;;;104E7;
+104C0;OSAGE CAPITAL LETTER MA;Lu;0;L;;;;;N;;;;104E8;
+104C1;OSAGE CAPITAL LETTER NA;Lu;0;L;;;;;N;;;;104E9;
+104C2;OSAGE CAPITAL LETTER O;Lu;0;L;;;;;N;;;;104EA;
+104C3;OSAGE CAPITAL LETTER OIN;Lu;0;L;;;;;N;;;;104EB;
+104C4;OSAGE CAPITAL LETTER PA;Lu;0;L;;;;;N;;;;104EC;
+104C5;OSAGE CAPITAL LETTER EHPA;Lu;0;L;;;;;N;;;;104ED;
+104C6;OSAGE CAPITAL LETTER SA;Lu;0;L;;;;;N;;;;104EE;
+104C7;OSAGE CAPITAL LETTER SHA;Lu;0;L;;;;;N;;;;104EF;
+104C8;OSAGE CAPITAL LETTER TA;Lu;0;L;;;;;N;;;;104F0;
+104C9;OSAGE CAPITAL LETTER EHTA;Lu;0;L;;;;;N;;;;104F1;
+104CA;OSAGE CAPITAL LETTER TSA;Lu;0;L;;;;;N;;;;104F2;
+104CB;OSAGE CAPITAL LETTER EHTSA;Lu;0;L;;;;;N;;;;104F3;
+104CC;OSAGE CAPITAL LETTER TSHA;Lu;0;L;;;;;N;;;;104F4;
+104CD;OSAGE CAPITAL LETTER DHA;Lu;0;L;;;;;N;;;;104F5;
+104CE;OSAGE CAPITAL LETTER U;Lu;0;L;;;;;N;;;;104F6;
+104CF;OSAGE CAPITAL LETTER WA;Lu;0;L;;;;;N;;;;104F7;
+104D0;OSAGE CAPITAL LETTER KHA;Lu;0;L;;;;;N;;;;104F8;
+104D1;OSAGE CAPITAL LETTER GHA;Lu;0;L;;;;;N;;;;104F9;
+104D2;OSAGE CAPITAL LETTER ZA;Lu;0;L;;;;;N;;;;104FA;
+104D3;OSAGE CAPITAL LETTER ZHA;Lu;0;L;;;;;N;;;;104FB;
+104D8;OSAGE SMALL LETTER A;Ll;0;L;;;;;N;;;104B0;;104B0
+104D9;OSAGE SMALL LETTER AI;Ll;0;L;;;;;N;;;104B1;;104B1
+104DA;OSAGE SMALL LETTER AIN;Ll;0;L;;;;;N;;;104B2;;104B2
+104DB;OSAGE SMALL LETTER AH;Ll;0;L;;;;;N;;;104B3;;104B3
+104DC;OSAGE SMALL LETTER BRA;Ll;0;L;;;;;N;;;104B4;;104B4
+104DD;OSAGE SMALL LETTER CHA;Ll;0;L;;;;;N;;;104B5;;104B5
+104DE;OSAGE SMALL LETTER EHCHA;Ll;0;L;;;;;N;;;104B6;;104B6
+104DF;OSAGE SMALL LETTER E;Ll;0;L;;;;;N;;;104B7;;104B7
+104E0;OSAGE SMALL LETTER EIN;Ll;0;L;;;;;N;;;104B8;;104B8
+104E1;OSAGE SMALL LETTER HA;Ll;0;L;;;;;N;;;104B9;;104B9
+104E2;OSAGE SMALL LETTER HYA;Ll;0;L;;;;;N;;;104BA;;104BA
+104E3;OSAGE SMALL LETTER I;Ll;0;L;;;;;N;;;104BB;;104BB
+104E4;OSAGE SMALL LETTER KA;Ll;0;L;;;;;N;;;104BC;;104BC
+104E5;OSAGE SMALL LETTER EHKA;Ll;0;L;;;;;N;;;104BD;;104BD
+104E6;OSAGE SMALL LETTER KYA;Ll;0;L;;;;;N;;;104BE;;104BE
+104E7;OSAGE SMALL LETTER LA;Ll;0;L;;;;;N;;;104BF;;104BF
+104E8;OSAGE SMALL LETTER MA;Ll;0;L;;;;;N;;;104C0;;104C0
+104E9;OSAGE SMALL LETTER NA;Ll;0;L;;;;;N;;;104C1;;104C1
+104EA;OSAGE SMALL LETTER O;Ll;0;L;;;;;N;;;104C2;;104C2
+104EB;OSAGE SMALL LETTER OIN;Ll;0;L;;;;;N;;;104C3;;104C3
+104EC;OSAGE SMALL LETTER PA;Ll;0;L;;;;;N;;;104C4;;104C4
+104ED;OSAGE SMALL LETTER EHPA;Ll;0;L;;;;;N;;;104C5;;104C5
+104EE;OSAGE SMALL LETTER SA;Ll;0;L;;;;;N;;;104C6;;104C6
+104EF;OSAGE SMALL LETTER SHA;Ll;0;L;;;;;N;;;104C7;;104C7
+104F0;OSAGE SMALL LETTER TA;Ll;0;L;;;;;N;;;104C8;;104C8
+104F1;OSAGE SMALL LETTER EHTA;Ll;0;L;;;;;N;;;104C9;;104C9
+104F2;OSAGE SMALL LETTER TSA;Ll;0;L;;;;;N;;;104CA;;104CA
+104F3;OSAGE SMALL LETTER EHTSA;Ll;0;L;;;;;N;;;104CB;;104CB
+104F4;OSAGE SMALL LETTER TSHA;Ll;0;L;;;;;N;;;104CC;;104CC
+104F5;OSAGE SMALL LETTER DHA;Ll;0;L;;;;;N;;;104CD;;104CD
+104F6;OSAGE SMALL LETTER U;Ll;0;L;;;;;N;;;104CE;;104CE
+104F7;OSAGE SMALL LETTER WA;Ll;0;L;;;;;N;;;104CF;;104CF
+104F8;OSAGE SMALL LETTER KHA;Ll;0;L;;;;;N;;;104D0;;104D0
+104F9;OSAGE SMALL LETTER GHA;Ll;0;L;;;;;N;;;104D1;;104D1
+104FA;OSAGE SMALL LETTER ZA;Ll;0;L;;;;;N;;;104D2;;104D2
+104FB;OSAGE SMALL LETTER ZHA;Ll;0;L;;;;;N;;;104D3;;104D3
+10500;ELBASAN LETTER A;Lo;0;L;;;;;N;;;;;
+10501;ELBASAN LETTER BE;Lo;0;L;;;;;N;;;;;
+10502;ELBASAN LETTER CE;Lo;0;L;;;;;N;;;;;
+10503;ELBASAN LETTER CHE;Lo;0;L;;;;;N;;;;;
+10504;ELBASAN LETTER DE;Lo;0;L;;;;;N;;;;;
+10505;ELBASAN LETTER NDE;Lo;0;L;;;;;N;;;;;
+10506;ELBASAN LETTER DHE;Lo;0;L;;;;;N;;;;;
+10507;ELBASAN LETTER EI;Lo;0;L;;;;;N;;;;;
+10508;ELBASAN LETTER E;Lo;0;L;;;;;N;;;;;
+10509;ELBASAN LETTER FE;Lo;0;L;;;;;N;;;;;
+1050A;ELBASAN LETTER GE;Lo;0;L;;;;;N;;;;;
+1050B;ELBASAN LETTER GJE;Lo;0;L;;;;;N;;;;;
+1050C;ELBASAN LETTER HE;Lo;0;L;;;;;N;;;;;
+1050D;ELBASAN LETTER I;Lo;0;L;;;;;N;;;;;
+1050E;ELBASAN LETTER JE;Lo;0;L;;;;;N;;;;;
+1050F;ELBASAN LETTER KE;Lo;0;L;;;;;N;;;;;
+10510;ELBASAN LETTER LE;Lo;0;L;;;;;N;;;;;
+10511;ELBASAN LETTER LLE;Lo;0;L;;;;;N;;;;;
+10512;ELBASAN LETTER ME;Lo;0;L;;;;;N;;;;;
+10513;ELBASAN LETTER NE;Lo;0;L;;;;;N;;;;;
+10514;ELBASAN LETTER NA;Lo;0;L;;;;;N;;;;;
+10515;ELBASAN LETTER NJE;Lo;0;L;;;;;N;;;;;
+10516;ELBASAN LETTER O;Lo;0;L;;;;;N;;;;;
+10517;ELBASAN LETTER PE;Lo;0;L;;;;;N;;;;;
+10518;ELBASAN LETTER QE;Lo;0;L;;;;;N;;;;;
+10519;ELBASAN LETTER RE;Lo;0;L;;;;;N;;;;;
+1051A;ELBASAN LETTER RRE;Lo;0;L;;;;;N;;;;;
+1051B;ELBASAN LETTER SE;Lo;0;L;;;;;N;;;;;
+1051C;ELBASAN LETTER SHE;Lo;0;L;;;;;N;;;;;
+1051D;ELBASAN LETTER TE;Lo;0;L;;;;;N;;;;;
+1051E;ELBASAN LETTER THE;Lo;0;L;;;;;N;;;;;
+1051F;ELBASAN LETTER U;Lo;0;L;;;;;N;;;;;
+10520;ELBASAN LETTER VE;Lo;0;L;;;;;N;;;;;
+10521;ELBASAN LETTER XE;Lo;0;L;;;;;N;;;;;
+10522;ELBASAN LETTER Y;Lo;0;L;;;;;N;;;;;
+10523;ELBASAN LETTER ZE;Lo;0;L;;;;;N;;;;;
+10524;ELBASAN LETTER ZHE;Lo;0;L;;;;;N;;;;;
+10525;ELBASAN LETTER GHE;Lo;0;L;;;;;N;;;;;
+10526;ELBASAN LETTER GHAMMA;Lo;0;L;;;;;N;;;;;
+10527;ELBASAN LETTER KHE;Lo;0;L;;;;;N;;;;;
+10530;CAUCASIAN ALBANIAN LETTER ALT;Lo;0;L;;;;;N;;;;;
+10531;CAUCASIAN ALBANIAN LETTER BET;Lo;0;L;;;;;N;;;;;
+10532;CAUCASIAN ALBANIAN LETTER GIM;Lo;0;L;;;;;N;;;;;
+10533;CAUCASIAN ALBANIAN LETTER DAT;Lo;0;L;;;;;N;;;;;
+10534;CAUCASIAN ALBANIAN LETTER EB;Lo;0;L;;;;;N;;;;;
+10535;CAUCASIAN ALBANIAN LETTER ZARL;Lo;0;L;;;;;N;;;;;
+10536;CAUCASIAN ALBANIAN LETTER EYN;Lo;0;L;;;;;N;;;;;
+10537;CAUCASIAN ALBANIAN LETTER ZHIL;Lo;0;L;;;;;N;;;;;
+10538;CAUCASIAN ALBANIAN LETTER TAS;Lo;0;L;;;;;N;;;;;
+10539;CAUCASIAN ALBANIAN LETTER CHA;Lo;0;L;;;;;N;;;;;
+1053A;CAUCASIAN ALBANIAN LETTER YOWD;Lo;0;L;;;;;N;;;;;
+1053B;CAUCASIAN ALBANIAN LETTER ZHA;Lo;0;L;;;;;N;;;;;
+1053C;CAUCASIAN ALBANIAN LETTER IRB;Lo;0;L;;;;;N;;;;;
+1053D;CAUCASIAN ALBANIAN LETTER SHA;Lo;0;L;;;;;N;;;;;
+1053E;CAUCASIAN ALBANIAN LETTER LAN;Lo;0;L;;;;;N;;;;;
+1053F;CAUCASIAN ALBANIAN LETTER INYA;Lo;0;L;;;;;N;;;;;
+10540;CAUCASIAN ALBANIAN LETTER XEYN;Lo;0;L;;;;;N;;;;;
+10541;CAUCASIAN ALBANIAN LETTER DYAN;Lo;0;L;;;;;N;;;;;
+10542;CAUCASIAN ALBANIAN LETTER CAR;Lo;0;L;;;;;N;;;;;
+10543;CAUCASIAN ALBANIAN LETTER JHOX;Lo;0;L;;;;;N;;;;;
+10544;CAUCASIAN ALBANIAN LETTER KAR;Lo;0;L;;;;;N;;;;;
+10545;CAUCASIAN ALBANIAN LETTER LYIT;Lo;0;L;;;;;N;;;;;
+10546;CAUCASIAN ALBANIAN LETTER HEYT;Lo;0;L;;;;;N;;;;;
+10547;CAUCASIAN ALBANIAN LETTER QAY;Lo;0;L;;;;;N;;;;;
+10548;CAUCASIAN ALBANIAN LETTER AOR;Lo;0;L;;;;;N;;;;;
+10549;CAUCASIAN ALBANIAN LETTER CHOY;Lo;0;L;;;;;N;;;;;
+1054A;CAUCASIAN ALBANIAN LETTER CHI;Lo;0;L;;;;;N;;;;;
+1054B;CAUCASIAN ALBANIAN LETTER CYAY;Lo;0;L;;;;;N;;;;;
+1054C;CAUCASIAN ALBANIAN LETTER MAQ;Lo;0;L;;;;;N;;;;;
+1054D;CAUCASIAN ALBANIAN LETTER QAR;Lo;0;L;;;;;N;;;;;
+1054E;CAUCASIAN ALBANIAN LETTER NOWC;Lo;0;L;;;;;N;;;;;
+1054F;CAUCASIAN ALBANIAN LETTER DZYAY;Lo;0;L;;;;;N;;;;;
+10550;CAUCASIAN ALBANIAN LETTER SHAK;Lo;0;L;;;;;N;;;;;
+10551;CAUCASIAN ALBANIAN LETTER JAYN;Lo;0;L;;;;;N;;;;;
+10552;CAUCASIAN ALBANIAN LETTER ON;Lo;0;L;;;;;N;;;;;
+10553;CAUCASIAN ALBANIAN LETTER TYAY;Lo;0;L;;;;;N;;;;;
+10554;CAUCASIAN ALBANIAN LETTER FAM;Lo;0;L;;;;;N;;;;;
+10555;CAUCASIAN ALBANIAN LETTER DZAY;Lo;0;L;;;;;N;;;;;
+10556;CAUCASIAN ALBANIAN LETTER CHAT;Lo;0;L;;;;;N;;;;;
+10557;CAUCASIAN ALBANIAN LETTER PEN;Lo;0;L;;;;;N;;;;;
+10558;CAUCASIAN ALBANIAN LETTER GHEYS;Lo;0;L;;;;;N;;;;;
+10559;CAUCASIAN ALBANIAN LETTER RAT;Lo;0;L;;;;;N;;;;;
+1055A;CAUCASIAN ALBANIAN LETTER SEYK;Lo;0;L;;;;;N;;;;;
+1055B;CAUCASIAN ALBANIAN LETTER VEYZ;Lo;0;L;;;;;N;;;;;
+1055C;CAUCASIAN ALBANIAN LETTER TIWR;Lo;0;L;;;;;N;;;;;
+1055D;CAUCASIAN ALBANIAN LETTER SHOY;Lo;0;L;;;;;N;;;;;
+1055E;CAUCASIAN ALBANIAN LETTER IWN;Lo;0;L;;;;;N;;;;;
+1055F;CAUCASIAN ALBANIAN LETTER CYAW;Lo;0;L;;;;;N;;;;;
+10560;CAUCASIAN ALBANIAN LETTER CAYN;Lo;0;L;;;;;N;;;;;
+10561;CAUCASIAN ALBANIAN LETTER YAYD;Lo;0;L;;;;;N;;;;;
+10562;CAUCASIAN ALBANIAN LETTER PIWR;Lo;0;L;;;;;N;;;;;
+10563;CAUCASIAN ALBANIAN LETTER KIW;Lo;0;L;;;;;N;;;;;
+1056F;CAUCASIAN ALBANIAN CITATION MARK;Po;0;L;;;;;N;;;;;
+10600;LINEAR A SIGN AB001;Lo;0;L;;;;;N;;;;;
+10601;LINEAR A SIGN AB002;Lo;0;L;;;;;N;;;;;
+10602;LINEAR A SIGN AB003;Lo;0;L;;;;;N;;;;;
+10603;LINEAR A SIGN AB004;Lo;0;L;;;;;N;;;;;
+10604;LINEAR A SIGN AB005;Lo;0;L;;;;;N;;;;;
+10605;LINEAR A SIGN AB006;Lo;0;L;;;;;N;;;;;
+10606;LINEAR A SIGN AB007;Lo;0;L;;;;;N;;;;;
+10607;LINEAR A SIGN AB008;Lo;0;L;;;;;N;;;;;
+10608;LINEAR A SIGN AB009;Lo;0;L;;;;;N;;;;;
+10609;LINEAR A SIGN AB010;Lo;0;L;;;;;N;;;;;
+1060A;LINEAR A SIGN AB011;Lo;0;L;;;;;N;;;;;
+1060B;LINEAR A SIGN AB013;Lo;0;L;;;;;N;;;;;
+1060C;LINEAR A SIGN AB016;Lo;0;L;;;;;N;;;;;
+1060D;LINEAR A SIGN AB017;Lo;0;L;;;;;N;;;;;
+1060E;LINEAR A SIGN AB020;Lo;0;L;;;;;N;;;;;
+1060F;LINEAR A SIGN AB021;Lo;0;L;;;;;N;;;;;
+10610;LINEAR A SIGN AB021F;Lo;0;L;;;;;N;;;;;
+10611;LINEAR A SIGN AB021M;Lo;0;L;;;;;N;;;;;
+10612;LINEAR A SIGN AB022;Lo;0;L;;;;;N;;;;;
+10613;LINEAR A SIGN AB022F;Lo;0;L;;;;;N;;;;;
+10614;LINEAR A SIGN AB022M;Lo;0;L;;;;;N;;;;;
+10615;LINEAR A SIGN AB023;Lo;0;L;;;;;N;;;;;
+10616;LINEAR A SIGN AB023M;Lo;0;L;;;;;N;;;;;
+10617;LINEAR A SIGN AB024;Lo;0;L;;;;;N;;;;;
+10618;LINEAR A SIGN AB026;Lo;0;L;;;;;N;;;;;
+10619;LINEAR A SIGN AB027;Lo;0;L;;;;;N;;;;;
+1061A;LINEAR A SIGN AB028;Lo;0;L;;;;;N;;;;;
+1061B;LINEAR A SIGN A028B;Lo;0;L;;;;;N;;;;;
+1061C;LINEAR A SIGN AB029;Lo;0;L;;;;;N;;;;;
+1061D;LINEAR A SIGN AB030;Lo;0;L;;;;;N;;;;;
+1061E;LINEAR A SIGN AB031;Lo;0;L;;;;;N;;;;;
+1061F;LINEAR A SIGN AB034;Lo;0;L;;;;;N;;;;;
+10620;LINEAR A SIGN AB037;Lo;0;L;;;;;N;;;;;
+10621;LINEAR A SIGN AB038;Lo;0;L;;;;;N;;;;;
+10622;LINEAR A SIGN AB039;Lo;0;L;;;;;N;;;;;
+10623;LINEAR A SIGN AB040;Lo;0;L;;;;;N;;;;;
+10624;LINEAR A SIGN AB041;Lo;0;L;;;;;N;;;;;
+10625;LINEAR A SIGN AB044;Lo;0;L;;;;;N;;;;;
+10626;LINEAR A SIGN AB045;Lo;0;L;;;;;N;;;;;
+10627;LINEAR A SIGN AB046;Lo;0;L;;;;;N;;;;;
+10628;LINEAR A SIGN AB047;Lo;0;L;;;;;N;;;;;
+10629;LINEAR A SIGN AB048;Lo;0;L;;;;;N;;;;;
+1062A;LINEAR A SIGN AB049;Lo;0;L;;;;;N;;;;;
+1062B;LINEAR A SIGN AB050;Lo;0;L;;;;;N;;;;;
+1062C;LINEAR A SIGN AB051;Lo;0;L;;;;;N;;;;;
+1062D;LINEAR A SIGN AB053;Lo;0;L;;;;;N;;;;;
+1062E;LINEAR A SIGN AB054;Lo;0;L;;;;;N;;;;;
+1062F;LINEAR A SIGN AB055;Lo;0;L;;;;;N;;;;;
+10630;LINEAR A SIGN AB056;Lo;0;L;;;;;N;;;;;
+10631;LINEAR A SIGN AB057;Lo;0;L;;;;;N;;;;;
+10632;LINEAR A SIGN AB058;Lo;0;L;;;;;N;;;;;
+10633;LINEAR A SIGN AB059;Lo;0;L;;;;;N;;;;;
+10634;LINEAR A SIGN AB060;Lo;0;L;;;;;N;;;;;
+10635;LINEAR A SIGN AB061;Lo;0;L;;;;;N;;;;;
+10636;LINEAR A SIGN AB065;Lo;0;L;;;;;N;;;;;
+10637;LINEAR A SIGN AB066;Lo;0;L;;;;;N;;;;;
+10638;LINEAR A SIGN AB067;Lo;0;L;;;;;N;;;;;
+10639;LINEAR A SIGN AB069;Lo;0;L;;;;;N;;;;;
+1063A;LINEAR A SIGN AB070;Lo;0;L;;;;;N;;;;;
+1063B;LINEAR A SIGN AB073;Lo;0;L;;;;;N;;;;;
+1063C;LINEAR A SIGN AB074;Lo;0;L;;;;;N;;;;;
+1063D;LINEAR A SIGN AB076;Lo;0;L;;;;;N;;;;;
+1063E;LINEAR A SIGN AB077;Lo;0;L;;;;;N;;;;;
+1063F;LINEAR A SIGN AB078;Lo;0;L;;;;;N;;;;;
+10640;LINEAR A SIGN AB079;Lo;0;L;;;;;N;;;;;
+10641;LINEAR A SIGN AB080;Lo;0;L;;;;;N;;;;;
+10642;LINEAR A SIGN AB081;Lo;0;L;;;;;N;;;;;
+10643;LINEAR A SIGN AB082;Lo;0;L;;;;;N;;;;;
+10644;LINEAR A SIGN AB085;Lo;0;L;;;;;N;;;;;
+10645;LINEAR A SIGN AB086;Lo;0;L;;;;;N;;;;;
+10646;LINEAR A SIGN AB087;Lo;0;L;;;;;N;;;;;
+10647;LINEAR A SIGN A100-102;Lo;0;L;;;;;N;;;;;
+10648;LINEAR A SIGN AB118;Lo;0;L;;;;;N;;;;;
+10649;LINEAR A SIGN AB120;Lo;0;L;;;;;N;;;;;
+1064A;LINEAR A SIGN A120B;Lo;0;L;;;;;N;;;;;
+1064B;LINEAR A SIGN AB122;Lo;0;L;;;;;N;;;;;
+1064C;LINEAR A SIGN AB123;Lo;0;L;;;;;N;;;;;
+1064D;LINEAR A SIGN AB131A;Lo;0;L;;;;;N;;;;;
+1064E;LINEAR A SIGN AB131B;Lo;0;L;;;;;N;;;;;
+1064F;LINEAR A SIGN A131C;Lo;0;L;;;;;N;;;;;
+10650;LINEAR A SIGN AB164;Lo;0;L;;;;;N;;;;;
+10651;LINEAR A SIGN AB171;Lo;0;L;;;;;N;;;;;
+10652;LINEAR A SIGN AB180;Lo;0;L;;;;;N;;;;;
+10653;LINEAR A SIGN AB188;Lo;0;L;;;;;N;;;;;
+10654;LINEAR A SIGN AB191;Lo;0;L;;;;;N;;;;;
+10655;LINEAR A SIGN A301;Lo;0;L;;;;;N;;;;;
+10656;LINEAR A SIGN A302;Lo;0;L;;;;;N;;;;;
+10657;LINEAR A SIGN A303;Lo;0;L;;;;;N;;;;;
+10658;LINEAR A SIGN A304;Lo;0;L;;;;;N;;;;;
+10659;LINEAR A SIGN A305;Lo;0;L;;;;;N;;;;;
+1065A;LINEAR A SIGN A306;Lo;0;L;;;;;N;;;;;
+1065B;LINEAR A SIGN A307;Lo;0;L;;;;;N;;;;;
+1065C;LINEAR A SIGN A308;Lo;0;L;;;;;N;;;;;
+1065D;LINEAR A SIGN A309A;Lo;0;L;;;;;N;;;;;
+1065E;LINEAR A SIGN A309B;Lo;0;L;;;;;N;;;;;
+1065F;LINEAR A SIGN A309C;Lo;0;L;;;;;N;;;;;
+10660;LINEAR A SIGN A310;Lo;0;L;;;;;N;;;;;
+10661;LINEAR A SIGN A311;Lo;0;L;;;;;N;;;;;
+10662;LINEAR A SIGN A312;Lo;0;L;;;;;N;;;;;
+10663;LINEAR A SIGN A313A;Lo;0;L;;;;;N;;;;;
+10664;LINEAR A SIGN A313B;Lo;0;L;;;;;N;;;;;
+10665;LINEAR A SIGN A313C;Lo;0;L;;;;;N;;;;;
+10666;LINEAR A SIGN A314;Lo;0;L;;;;;N;;;;;
+10667;LINEAR A SIGN A315;Lo;0;L;;;;;N;;;;;
+10668;LINEAR A SIGN A316;Lo;0;L;;;;;N;;;;;
+10669;LINEAR A SIGN A317;Lo;0;L;;;;;N;;;;;
+1066A;LINEAR A SIGN A318;Lo;0;L;;;;;N;;;;;
+1066B;LINEAR A SIGN A319;Lo;0;L;;;;;N;;;;;
+1066C;LINEAR A SIGN A320;Lo;0;L;;;;;N;;;;;
+1066D;LINEAR A SIGN A321;Lo;0;L;;;;;N;;;;;
+1066E;LINEAR A SIGN A322;Lo;0;L;;;;;N;;;;;
+1066F;LINEAR A SIGN A323;Lo;0;L;;;;;N;;;;;
+10670;LINEAR A SIGN A324;Lo;0;L;;;;;N;;;;;
+10671;LINEAR A SIGN A325;Lo;0;L;;;;;N;;;;;
+10672;LINEAR A SIGN A326;Lo;0;L;;;;;N;;;;;
+10673;LINEAR A SIGN A327;Lo;0;L;;;;;N;;;;;
+10674;LINEAR A SIGN A328;Lo;0;L;;;;;N;;;;;
+10675;LINEAR A SIGN A329;Lo;0;L;;;;;N;;;;;
+10676;LINEAR A SIGN A330;Lo;0;L;;;;;N;;;;;
+10677;LINEAR A SIGN A331;Lo;0;L;;;;;N;;;;;
+10678;LINEAR A SIGN A332;Lo;0;L;;;;;N;;;;;
+10679;LINEAR A SIGN A333;Lo;0;L;;;;;N;;;;;
+1067A;LINEAR A SIGN A334;Lo;0;L;;;;;N;;;;;
+1067B;LINEAR A SIGN A335;Lo;0;L;;;;;N;;;;;
+1067C;LINEAR A SIGN A336;Lo;0;L;;;;;N;;;;;
+1067D;LINEAR A SIGN A337;Lo;0;L;;;;;N;;;;;
+1067E;LINEAR A SIGN A338;Lo;0;L;;;;;N;;;;;
+1067F;LINEAR A SIGN A339;Lo;0;L;;;;;N;;;;;
+10680;LINEAR A SIGN A340;Lo;0;L;;;;;N;;;;;
+10681;LINEAR A SIGN A341;Lo;0;L;;;;;N;;;;;
+10682;LINEAR A SIGN A342;Lo;0;L;;;;;N;;;;;
+10683;LINEAR A SIGN A343;Lo;0;L;;;;;N;;;;;
+10684;LINEAR A SIGN A344;Lo;0;L;;;;;N;;;;;
+10685;LINEAR A SIGN A345;Lo;0;L;;;;;N;;;;;
+10686;LINEAR A SIGN A346;Lo;0;L;;;;;N;;;;;
+10687;LINEAR A SIGN A347;Lo;0;L;;;;;N;;;;;
+10688;LINEAR A SIGN A348;Lo;0;L;;;;;N;;;;;
+10689;LINEAR A SIGN A349;Lo;0;L;;;;;N;;;;;
+1068A;LINEAR A SIGN A350;Lo;0;L;;;;;N;;;;;
+1068B;LINEAR A SIGN A351;Lo;0;L;;;;;N;;;;;
+1068C;LINEAR A SIGN A352;Lo;0;L;;;;;N;;;;;
+1068D;LINEAR A SIGN A353;Lo;0;L;;;;;N;;;;;
+1068E;LINEAR A SIGN A354;Lo;0;L;;;;;N;;;;;
+1068F;LINEAR A SIGN A355;Lo;0;L;;;;;N;;;;;
+10690;LINEAR A SIGN A356;Lo;0;L;;;;;N;;;;;
+10691;LINEAR A SIGN A357;Lo;0;L;;;;;N;;;;;
+10692;LINEAR A SIGN A358;Lo;0;L;;;;;N;;;;;
+10693;LINEAR A SIGN A359;Lo;0;L;;;;;N;;;;;
+10694;LINEAR A SIGN A360;Lo;0;L;;;;;N;;;;;
+10695;LINEAR A SIGN A361;Lo;0;L;;;;;N;;;;;
+10696;LINEAR A SIGN A362;Lo;0;L;;;;;N;;;;;
+10697;LINEAR A SIGN A363;Lo;0;L;;;;;N;;;;;
+10698;LINEAR A SIGN A364;Lo;0;L;;;;;N;;;;;
+10699;LINEAR A SIGN A365;Lo;0;L;;;;;N;;;;;
+1069A;LINEAR A SIGN A366;Lo;0;L;;;;;N;;;;;
+1069B;LINEAR A SIGN A367;Lo;0;L;;;;;N;;;;;
+1069C;LINEAR A SIGN A368;Lo;0;L;;;;;N;;;;;
+1069D;LINEAR A SIGN A369;Lo;0;L;;;;;N;;;;;
+1069E;LINEAR A SIGN A370;Lo;0;L;;;;;N;;;;;
+1069F;LINEAR A SIGN A371;Lo;0;L;;;;;N;;;;;
+106A0;LINEAR A SIGN A400-VAS;Lo;0;L;;;;;N;;;;;
+106A1;LINEAR A SIGN A401-VAS;Lo;0;L;;;;;N;;;;;
+106A2;LINEAR A SIGN A402-VAS;Lo;0;L;;;;;N;;;;;
+106A3;LINEAR A SIGN A403-VAS;Lo;0;L;;;;;N;;;;;
+106A4;LINEAR A SIGN A404-VAS;Lo;0;L;;;;;N;;;;;
+106A5;LINEAR A SIGN A405-VAS;Lo;0;L;;;;;N;;;;;
+106A6;LINEAR A SIGN A406-VAS;Lo;0;L;;;;;N;;;;;
+106A7;LINEAR A SIGN A407-VAS;Lo;0;L;;;;;N;;;;;
+106A8;LINEAR A SIGN A408-VAS;Lo;0;L;;;;;N;;;;;
+106A9;LINEAR A SIGN A409-VAS;Lo;0;L;;;;;N;;;;;
+106AA;LINEAR A SIGN A410-VAS;Lo;0;L;;;;;N;;;;;
+106AB;LINEAR A SIGN A411-VAS;Lo;0;L;;;;;N;;;;;
+106AC;LINEAR A SIGN A412-VAS;Lo;0;L;;;;;N;;;;;
+106AD;LINEAR A SIGN A413-VAS;Lo;0;L;;;;;N;;;;;
+106AE;LINEAR A SIGN A414-VAS;Lo;0;L;;;;;N;;;;;
+106AF;LINEAR A SIGN A415-VAS;Lo;0;L;;;;;N;;;;;
+106B0;LINEAR A SIGN A416-VAS;Lo;0;L;;;;;N;;;;;
+106B1;LINEAR A SIGN A417-VAS;Lo;0;L;;;;;N;;;;;
+106B2;LINEAR A SIGN A418-VAS;Lo;0;L;;;;;N;;;;;
+106B3;LINEAR A SIGN A501;Lo;0;L;;;;;N;;;;;
+106B4;LINEAR A SIGN A502;Lo;0;L;;;;;N;;;;;
+106B5;LINEAR A SIGN A503;Lo;0;L;;;;;N;;;;;
+106B6;LINEAR A SIGN A504;Lo;0;L;;;;;N;;;;;
+106B7;LINEAR A SIGN A505;Lo;0;L;;;;;N;;;;;
+106B8;LINEAR A SIGN A506;Lo;0;L;;;;;N;;;;;
+106B9;LINEAR A SIGN A508;Lo;0;L;;;;;N;;;;;
+106BA;LINEAR A SIGN A509;Lo;0;L;;;;;N;;;;;
+106BB;LINEAR A SIGN A510;Lo;0;L;;;;;N;;;;;
+106BC;LINEAR A SIGN A511;Lo;0;L;;;;;N;;;;;
+106BD;LINEAR A SIGN A512;Lo;0;L;;;;;N;;;;;
+106BE;LINEAR A SIGN A513;Lo;0;L;;;;;N;;;;;
+106BF;LINEAR A SIGN A515;Lo;0;L;;;;;N;;;;;
+106C0;LINEAR A SIGN A516;Lo;0;L;;;;;N;;;;;
+106C1;LINEAR A SIGN A520;Lo;0;L;;;;;N;;;;;
+106C2;LINEAR A SIGN A521;Lo;0;L;;;;;N;;;;;
+106C3;LINEAR A SIGN A523;Lo;0;L;;;;;N;;;;;
+106C4;LINEAR A SIGN A524;Lo;0;L;;;;;N;;;;;
+106C5;LINEAR A SIGN A525;Lo;0;L;;;;;N;;;;;
+106C6;LINEAR A SIGN A526;Lo;0;L;;;;;N;;;;;
+106C7;LINEAR A SIGN A527;Lo;0;L;;;;;N;;;;;
+106C8;LINEAR A SIGN A528;Lo;0;L;;;;;N;;;;;
+106C9;LINEAR A SIGN A529;Lo;0;L;;;;;N;;;;;
+106CA;LINEAR A SIGN A530;Lo;0;L;;;;;N;;;;;
+106CB;LINEAR A SIGN A531;Lo;0;L;;;;;N;;;;;
+106CC;LINEAR A SIGN A532;Lo;0;L;;;;;N;;;;;
+106CD;LINEAR A SIGN A534;Lo;0;L;;;;;N;;;;;
+106CE;LINEAR A SIGN A535;Lo;0;L;;;;;N;;;;;
+106CF;LINEAR A SIGN A536;Lo;0;L;;;;;N;;;;;
+106D0;LINEAR A SIGN A537;Lo;0;L;;;;;N;;;;;
+106D1;LINEAR A SIGN A538;Lo;0;L;;;;;N;;;;;
+106D2;LINEAR A SIGN A539;Lo;0;L;;;;;N;;;;;
+106D3;LINEAR A SIGN A540;Lo;0;L;;;;;N;;;;;
+106D4;LINEAR A SIGN A541;Lo;0;L;;;;;N;;;;;
+106D5;LINEAR A SIGN A542;Lo;0;L;;;;;N;;;;;
+106D6;LINEAR A SIGN A545;Lo;0;L;;;;;N;;;;;
+106D7;LINEAR A SIGN A547;Lo;0;L;;;;;N;;;;;
+106D8;LINEAR A SIGN A548;Lo;0;L;;;;;N;;;;;
+106D9;LINEAR A SIGN A549;Lo;0;L;;;;;N;;;;;
+106DA;LINEAR A SIGN A550;Lo;0;L;;;;;N;;;;;
+106DB;LINEAR A SIGN A551;Lo;0;L;;;;;N;;;;;
+106DC;LINEAR A SIGN A552;Lo;0;L;;;;;N;;;;;
+106DD;LINEAR A SIGN A553;Lo;0;L;;;;;N;;;;;
+106DE;LINEAR A SIGN A554;Lo;0;L;;;;;N;;;;;
+106DF;LINEAR A SIGN A555;Lo;0;L;;;;;N;;;;;
+106E0;LINEAR A SIGN A556;Lo;0;L;;;;;N;;;;;
+106E1;LINEAR A SIGN A557;Lo;0;L;;;;;N;;;;;
+106E2;LINEAR A SIGN A559;Lo;0;L;;;;;N;;;;;
+106E3;LINEAR A SIGN A563;Lo;0;L;;;;;N;;;;;
+106E4;LINEAR A SIGN A564;Lo;0;L;;;;;N;;;;;
+106E5;LINEAR A SIGN A565;Lo;0;L;;;;;N;;;;;
+106E6;LINEAR A SIGN A566;Lo;0;L;;;;;N;;;;;
+106E7;LINEAR A SIGN A568;Lo;0;L;;;;;N;;;;;
+106E8;LINEAR A SIGN A569;Lo;0;L;;;;;N;;;;;
+106E9;LINEAR A SIGN A570;Lo;0;L;;;;;N;;;;;
+106EA;LINEAR A SIGN A571;Lo;0;L;;;;;N;;;;;
+106EB;LINEAR A SIGN A572;Lo;0;L;;;;;N;;;;;
+106EC;LINEAR A SIGN A573;Lo;0;L;;;;;N;;;;;
+106ED;LINEAR A SIGN A574;Lo;0;L;;;;;N;;;;;
+106EE;LINEAR A SIGN A575;Lo;0;L;;;;;N;;;;;
+106EF;LINEAR A SIGN A576;Lo;0;L;;;;;N;;;;;
+106F0;LINEAR A SIGN A577;Lo;0;L;;;;;N;;;;;
+106F1;LINEAR A SIGN A578;Lo;0;L;;;;;N;;;;;
+106F2;LINEAR A SIGN A579;Lo;0;L;;;;;N;;;;;
+106F3;LINEAR A SIGN A580;Lo;0;L;;;;;N;;;;;
+106F4;LINEAR A SIGN A581;Lo;0;L;;;;;N;;;;;
+106F5;LINEAR A SIGN A582;Lo;0;L;;;;;N;;;;;
+106F6;LINEAR A SIGN A583;Lo;0;L;;;;;N;;;;;
+106F7;LINEAR A SIGN A584;Lo;0;L;;;;;N;;;;;
+106F8;LINEAR A SIGN A585;Lo;0;L;;;;;N;;;;;
+106F9;LINEAR A SIGN A586;Lo;0;L;;;;;N;;;;;
+106FA;LINEAR A SIGN A587;Lo;0;L;;;;;N;;;;;
+106FB;LINEAR A SIGN A588;Lo;0;L;;;;;N;;;;;
+106FC;LINEAR A SIGN A589;Lo;0;L;;;;;N;;;;;
+106FD;LINEAR A SIGN A591;Lo;0;L;;;;;N;;;;;
+106FE;LINEAR A SIGN A592;Lo;0;L;;;;;N;;;;;
+106FF;LINEAR A SIGN A594;Lo;0;L;;;;;N;;;;;
+10700;LINEAR A SIGN A595;Lo;0;L;;;;;N;;;;;
+10701;LINEAR A SIGN A596;Lo;0;L;;;;;N;;;;;
+10702;LINEAR A SIGN A598;Lo;0;L;;;;;N;;;;;
+10703;LINEAR A SIGN A600;Lo;0;L;;;;;N;;;;;
+10704;LINEAR A SIGN A601;Lo;0;L;;;;;N;;;;;
+10705;LINEAR A SIGN A602;Lo;0;L;;;;;N;;;;;
+10706;LINEAR A SIGN A603;Lo;0;L;;;;;N;;;;;
+10707;LINEAR A SIGN A604;Lo;0;L;;;;;N;;;;;
+10708;LINEAR A SIGN A606;Lo;0;L;;;;;N;;;;;
+10709;LINEAR A SIGN A608;Lo;0;L;;;;;N;;;;;
+1070A;LINEAR A SIGN A609;Lo;0;L;;;;;N;;;;;
+1070B;LINEAR A SIGN A610;Lo;0;L;;;;;N;;;;;
+1070C;LINEAR A SIGN A611;Lo;0;L;;;;;N;;;;;
+1070D;LINEAR A SIGN A612;Lo;0;L;;;;;N;;;;;
+1070E;LINEAR A SIGN A613;Lo;0;L;;;;;N;;;;;
+1070F;LINEAR A SIGN A614;Lo;0;L;;;;;N;;;;;
+10710;LINEAR A SIGN A615;Lo;0;L;;;;;N;;;;;
+10711;LINEAR A SIGN A616;Lo;0;L;;;;;N;;;;;
+10712;LINEAR A SIGN A617;Lo;0;L;;;;;N;;;;;
+10713;LINEAR A SIGN A618;Lo;0;L;;;;;N;;;;;
+10714;LINEAR A SIGN A619;Lo;0;L;;;;;N;;;;;
+10715;LINEAR A SIGN A620;Lo;0;L;;;;;N;;;;;
+10716;LINEAR A SIGN A621;Lo;0;L;;;;;N;;;;;
+10717;LINEAR A SIGN A622;Lo;0;L;;;;;N;;;;;
+10718;LINEAR A SIGN A623;Lo;0;L;;;;;N;;;;;
+10719;LINEAR A SIGN A624;Lo;0;L;;;;;N;;;;;
+1071A;LINEAR A SIGN A626;Lo;0;L;;;;;N;;;;;
+1071B;LINEAR A SIGN A627;Lo;0;L;;;;;N;;;;;
+1071C;LINEAR A SIGN A628;Lo;0;L;;;;;N;;;;;
+1071D;LINEAR A SIGN A629;Lo;0;L;;;;;N;;;;;
+1071E;LINEAR A SIGN A634;Lo;0;L;;;;;N;;;;;
+1071F;LINEAR A SIGN A637;Lo;0;L;;;;;N;;;;;
+10720;LINEAR A SIGN A638;Lo;0;L;;;;;N;;;;;
+10721;LINEAR A SIGN A640;Lo;0;L;;;;;N;;;;;
+10722;LINEAR A SIGN A642;Lo;0;L;;;;;N;;;;;
+10723;LINEAR A SIGN A643;Lo;0;L;;;;;N;;;;;
+10724;LINEAR A SIGN A644;Lo;0;L;;;;;N;;;;;
+10725;LINEAR A SIGN A645;Lo;0;L;;;;;N;;;;;
+10726;LINEAR A SIGN A646;Lo;0;L;;;;;N;;;;;
+10727;LINEAR A SIGN A648;Lo;0;L;;;;;N;;;;;
+10728;LINEAR A SIGN A649;Lo;0;L;;;;;N;;;;;
+10729;LINEAR A SIGN A651;Lo;0;L;;;;;N;;;;;
+1072A;LINEAR A SIGN A652;Lo;0;L;;;;;N;;;;;
+1072B;LINEAR A SIGN A653;Lo;0;L;;;;;N;;;;;
+1072C;LINEAR A SIGN A654;Lo;0;L;;;;;N;;;;;
+1072D;LINEAR A SIGN A655;Lo;0;L;;;;;N;;;;;
+1072E;LINEAR A SIGN A656;Lo;0;L;;;;;N;;;;;
+1072F;LINEAR A SIGN A657;Lo;0;L;;;;;N;;;;;
+10730;LINEAR A SIGN A658;Lo;0;L;;;;;N;;;;;
+10731;LINEAR A SIGN A659;Lo;0;L;;;;;N;;;;;
+10732;LINEAR A SIGN A660;Lo;0;L;;;;;N;;;;;
+10733;LINEAR A SIGN A661;Lo;0;L;;;;;N;;;;;
+10734;LINEAR A SIGN A662;Lo;0;L;;;;;N;;;;;
+10735;LINEAR A SIGN A663;Lo;0;L;;;;;N;;;;;
+10736;LINEAR A SIGN A664;Lo;0;L;;;;;N;;;;;
+10740;LINEAR A SIGN A701 A;Lo;0;L;;;;;N;;;;;
+10741;LINEAR A SIGN A702 B;Lo;0;L;;;;;N;;;;;
+10742;LINEAR A SIGN A703 D;Lo;0;L;;;;;N;;;;;
+10743;LINEAR A SIGN A704 E;Lo;0;L;;;;;N;;;;;
+10744;LINEAR A SIGN A705 F;Lo;0;L;;;;;N;;;;;
+10745;LINEAR A SIGN A706 H;Lo;0;L;;;;;N;;;;;
+10746;LINEAR A SIGN A707 J;Lo;0;L;;;;;N;;;;;
+10747;LINEAR A SIGN A708 K;Lo;0;L;;;;;N;;;;;
+10748;LINEAR A SIGN A709 L;Lo;0;L;;;;;N;;;;;
+10749;LINEAR A SIGN A709-2 L2;Lo;0;L;;;;;N;;;;;
+1074A;LINEAR A SIGN A709-3 L3;Lo;0;L;;;;;N;;;;;
+1074B;LINEAR A SIGN A709-4 L4;Lo;0;L;;;;;N;;;;;
+1074C;LINEAR A SIGN A709-6 L6;Lo;0;L;;;;;N;;;;;
+1074D;LINEAR A SIGN A710 W;Lo;0;L;;;;;N;;;;;
+1074E;LINEAR A SIGN A711 X;Lo;0;L;;;;;N;;;;;
+1074F;LINEAR A SIGN A712 Y;Lo;0;L;;;;;N;;;;;
+10750;LINEAR A SIGN A713 OMEGA;Lo;0;L;;;;;N;;;;;
+10751;LINEAR A SIGN A714 ABB;Lo;0;L;;;;;N;;;;;
+10752;LINEAR A SIGN A715 BB;Lo;0;L;;;;;N;;;;;
+10753;LINEAR A SIGN A717 DD;Lo;0;L;;;;;N;;;;;
+10754;LINEAR A SIGN A726 EYYY;Lo;0;L;;;;;N;;;;;
+10755;LINEAR A SIGN A732 JE;Lo;0;L;;;;;N;;;;;
+10760;LINEAR A SIGN A800;Lo;0;L;;;;;N;;;;;
+10761;LINEAR A SIGN A801;Lo;0;L;;;;;N;;;;;
+10762;LINEAR A SIGN A802;Lo;0;L;;;;;N;;;;;
+10763;LINEAR A SIGN A803;Lo;0;L;;;;;N;;;;;
+10764;LINEAR A SIGN A804;Lo;0;L;;;;;N;;;;;
+10765;LINEAR A SIGN A805;Lo;0;L;;;;;N;;;;;
+10766;LINEAR A SIGN A806;Lo;0;L;;;;;N;;;;;
+10767;LINEAR A SIGN A807;Lo;0;L;;;;;N;;;;;
+10800;CYPRIOT SYLLABLE A;Lo;0;R;;;;;N;;;;;
+10801;CYPRIOT SYLLABLE E;Lo;0;R;;;;;N;;;;;
+10802;CYPRIOT SYLLABLE I;Lo;0;R;;;;;N;;;;;
+10803;CYPRIOT SYLLABLE O;Lo;0;R;;;;;N;;;;;
+10804;CYPRIOT SYLLABLE U;Lo;0;R;;;;;N;;;;;
+10805;CYPRIOT SYLLABLE JA;Lo;0;R;;;;;N;;;;;
+10808;CYPRIOT SYLLABLE JO;Lo;0;R;;;;;N;;;;;
+1080A;CYPRIOT SYLLABLE KA;Lo;0;R;;;;;N;;;;;
+1080B;CYPRIOT SYLLABLE KE;Lo;0;R;;;;;N;;;;;
+1080C;CYPRIOT SYLLABLE KI;Lo;0;R;;;;;N;;;;;
+1080D;CYPRIOT SYLLABLE KO;Lo;0;R;;;;;N;;;;;
+1080E;CYPRIOT SYLLABLE KU;Lo;0;R;;;;;N;;;;;
+1080F;CYPRIOT SYLLABLE LA;Lo;0;R;;;;;N;;;;;
+10810;CYPRIOT SYLLABLE LE;Lo;0;R;;;;;N;;;;;
+10811;CYPRIOT SYLLABLE LI;Lo;0;R;;;;;N;;;;;
+10812;CYPRIOT SYLLABLE LO;Lo;0;R;;;;;N;;;;;
+10813;CYPRIOT SYLLABLE LU;Lo;0;R;;;;;N;;;;;
+10814;CYPRIOT SYLLABLE MA;Lo;0;R;;;;;N;;;;;
+10815;CYPRIOT SYLLABLE ME;Lo;0;R;;;;;N;;;;;
+10816;CYPRIOT SYLLABLE MI;Lo;0;R;;;;;N;;;;;
+10817;CYPRIOT SYLLABLE MO;Lo;0;R;;;;;N;;;;;
+10818;CYPRIOT SYLLABLE MU;Lo;0;R;;;;;N;;;;;
+10819;CYPRIOT SYLLABLE NA;Lo;0;R;;;;;N;;;;;
+1081A;CYPRIOT SYLLABLE NE;Lo;0;R;;;;;N;;;;;
+1081B;CYPRIOT SYLLABLE NI;Lo;0;R;;;;;N;;;;;
+1081C;CYPRIOT SYLLABLE NO;Lo;0;R;;;;;N;;;;;
+1081D;CYPRIOT SYLLABLE NU;Lo;0;R;;;;;N;;;;;
+1081E;CYPRIOT SYLLABLE PA;Lo;0;R;;;;;N;;;;;
+1081F;CYPRIOT SYLLABLE PE;Lo;0;R;;;;;N;;;;;
+10820;CYPRIOT SYLLABLE PI;Lo;0;R;;;;;N;;;;;
+10821;CYPRIOT SYLLABLE PO;Lo;0;R;;;;;N;;;;;
+10822;CYPRIOT SYLLABLE PU;Lo;0;R;;;;;N;;;;;
+10823;CYPRIOT SYLLABLE RA;Lo;0;R;;;;;N;;;;;
+10824;CYPRIOT SYLLABLE RE;Lo;0;R;;;;;N;;;;;
+10825;CYPRIOT SYLLABLE RI;Lo;0;R;;;;;N;;;;;
+10826;CYPRIOT SYLLABLE RO;Lo;0;R;;;;;N;;;;;
+10827;CYPRIOT SYLLABLE RU;Lo;0;R;;;;;N;;;;;
+10828;CYPRIOT SYLLABLE SA;Lo;0;R;;;;;N;;;;;
+10829;CYPRIOT SYLLABLE SE;Lo;0;R;;;;;N;;;;;
+1082A;CYPRIOT SYLLABLE SI;Lo;0;R;;;;;N;;;;;
+1082B;CYPRIOT SYLLABLE SO;Lo;0;R;;;;;N;;;;;
+1082C;CYPRIOT SYLLABLE SU;Lo;0;R;;;;;N;;;;;
+1082D;CYPRIOT SYLLABLE TA;Lo;0;R;;;;;N;;;;;
+1082E;CYPRIOT SYLLABLE TE;Lo;0;R;;;;;N;;;;;
+1082F;CYPRIOT SYLLABLE TI;Lo;0;R;;;;;N;;;;;
+10830;CYPRIOT SYLLABLE TO;Lo;0;R;;;;;N;;;;;
+10831;CYPRIOT SYLLABLE TU;Lo;0;R;;;;;N;;;;;
+10832;CYPRIOT SYLLABLE WA;Lo;0;R;;;;;N;;;;;
+10833;CYPRIOT SYLLABLE WE;Lo;0;R;;;;;N;;;;;
+10834;CYPRIOT SYLLABLE WI;Lo;0;R;;;;;N;;;;;
+10835;CYPRIOT SYLLABLE WO;Lo;0;R;;;;;N;;;;;
+10837;CYPRIOT SYLLABLE XA;Lo;0;R;;;;;N;;;;;
+10838;CYPRIOT SYLLABLE XE;Lo;0;R;;;;;N;;;;;
+1083C;CYPRIOT SYLLABLE ZA;Lo;0;R;;;;;N;;;;;
+1083F;CYPRIOT SYLLABLE ZO;Lo;0;R;;;;;N;;;;;
+10840;IMPERIAL ARAMAIC LETTER ALEPH;Lo;0;R;;;;;N;;;;;
+10841;IMPERIAL ARAMAIC LETTER BETH;Lo;0;R;;;;;N;;;;;
+10842;IMPERIAL ARAMAIC LETTER GIMEL;Lo;0;R;;;;;N;;;;;
+10843;IMPERIAL ARAMAIC LETTER DALETH;Lo;0;R;;;;;N;;;;;
+10844;IMPERIAL ARAMAIC LETTER HE;Lo;0;R;;;;;N;;;;;
+10845;IMPERIAL ARAMAIC LETTER WAW;Lo;0;R;;;;;N;;;;;
+10846;IMPERIAL ARAMAIC LETTER ZAYIN;Lo;0;R;;;;;N;;;;;
+10847;IMPERIAL ARAMAIC LETTER HETH;Lo;0;R;;;;;N;;;;;
+10848;IMPERIAL ARAMAIC LETTER TETH;Lo;0;R;;;;;N;;;;;
+10849;IMPERIAL ARAMAIC LETTER YODH;Lo;0;R;;;;;N;;;;;
+1084A;IMPERIAL ARAMAIC LETTER KAPH;Lo;0;R;;;;;N;;;;;
+1084B;IMPERIAL ARAMAIC LETTER LAMEDH;Lo;0;R;;;;;N;;;;;
+1084C;IMPERIAL ARAMAIC LETTER MEM;Lo;0;R;;;;;N;;;;;
+1084D;IMPERIAL ARAMAIC LETTER NUN;Lo;0;R;;;;;N;;;;;
+1084E;IMPERIAL ARAMAIC LETTER SAMEKH;Lo;0;R;;;;;N;;;;;
+1084F;IMPERIAL ARAMAIC LETTER AYIN;Lo;0;R;;;;;N;;;;;
+10850;IMPERIAL ARAMAIC LETTER PE;Lo;0;R;;;;;N;;;;;
+10851;IMPERIAL ARAMAIC LETTER SADHE;Lo;0;R;;;;;N;;;;;
+10852;IMPERIAL ARAMAIC LETTER QOPH;Lo;0;R;;;;;N;;;;;
+10853;IMPERIAL ARAMAIC LETTER RESH;Lo;0;R;;;;;N;;;;;
+10854;IMPERIAL ARAMAIC LETTER SHIN;Lo;0;R;;;;;N;;;;;
+10855;IMPERIAL ARAMAIC LETTER TAW;Lo;0;R;;;;;N;;;;;
+10857;IMPERIAL ARAMAIC SECTION SIGN;Po;0;R;;;;;N;;;;;
+10858;IMPERIAL ARAMAIC NUMBER ONE;No;0;R;;;;1;N;;;;;
+10859;IMPERIAL ARAMAIC NUMBER TWO;No;0;R;;;;2;N;;;;;
+1085A;IMPERIAL ARAMAIC NUMBER THREE;No;0;R;;;;3;N;;;;;
+1085B;IMPERIAL ARAMAIC NUMBER TEN;No;0;R;;;;10;N;;;;;
+1085C;IMPERIAL ARAMAIC NUMBER TWENTY;No;0;R;;;;20;N;;;;;
+1085D;IMPERIAL ARAMAIC NUMBER ONE HUNDRED;No;0;R;;;;100;N;;;;;
+1085E;IMPERIAL ARAMAIC NUMBER ONE THOUSAND;No;0;R;;;;1000;N;;;;;
+1085F;IMPERIAL ARAMAIC NUMBER TEN THOUSAND;No;0;R;;;;10000;N;;;;;
+10860;PALMYRENE LETTER ALEPH;Lo;0;R;;;;;N;;;;;
+10861;PALMYRENE LETTER BETH;Lo;0;R;;;;;N;;;;;
+10862;PALMYRENE LETTER GIMEL;Lo;0;R;;;;;N;;;;;
+10863;PALMYRENE LETTER DALETH;Lo;0;R;;;;;N;;;;;
+10864;PALMYRENE LETTER HE;Lo;0;R;;;;;N;;;;;
+10865;PALMYRENE LETTER WAW;Lo;0;R;;;;;N;;;;;
+10866;PALMYRENE LETTER ZAYIN;Lo;0;R;;;;;N;;;;;
+10867;PALMYRENE LETTER HETH;Lo;0;R;;;;;N;;;;;
+10868;PALMYRENE LETTER TETH;Lo;0;R;;;;;N;;;;;
+10869;PALMYRENE LETTER YODH;Lo;0;R;;;;;N;;;;;
+1086A;PALMYRENE LETTER KAPH;Lo;0;R;;;;;N;;;;;
+1086B;PALMYRENE LETTER LAMEDH;Lo;0;R;;;;;N;;;;;
+1086C;PALMYRENE LETTER MEM;Lo;0;R;;;;;N;;;;;
+1086D;PALMYRENE LETTER FINAL NUN;Lo;0;R;;;;;N;;;;;
+1086E;PALMYRENE LETTER NUN;Lo;0;R;;;;;N;;;;;
+1086F;PALMYRENE LETTER SAMEKH;Lo;0;R;;;;;N;;;;;
+10870;PALMYRENE LETTER AYIN;Lo;0;R;;;;;N;;;;;
+10871;PALMYRENE LETTER PE;Lo;0;R;;;;;N;;;;;
+10872;PALMYRENE LETTER SADHE;Lo;0;R;;;;;N;;;;;
+10873;PALMYRENE LETTER QOPH;Lo;0;R;;;;;N;;;;;
+10874;PALMYRENE LETTER RESH;Lo;0;R;;;;;N;;;;;
+10875;PALMYRENE LETTER SHIN;Lo;0;R;;;;;N;;;;;
+10876;PALMYRENE LETTER TAW;Lo;0;R;;;;;N;;;;;
+10877;PALMYRENE LEFT-POINTING FLEURON;So;0;R;;;;;N;;;;;
+10878;PALMYRENE RIGHT-POINTING FLEURON;So;0;R;;;;;N;;;;;
+10879;PALMYRENE NUMBER ONE;No;0;R;;;;1;N;;;;;
+1087A;PALMYRENE NUMBER TWO;No;0;R;;;;2;N;;;;;
+1087B;PALMYRENE NUMBER THREE;No;0;R;;;;3;N;;;;;
+1087C;PALMYRENE NUMBER FOUR;No;0;R;;;;4;N;;;;;
+1087D;PALMYRENE NUMBER FIVE;No;0;R;;;;5;N;;;;;
+1087E;PALMYRENE NUMBER TEN;No;0;R;;;;10;N;;;;;
+1087F;PALMYRENE NUMBER TWENTY;No;0;R;;;;20;N;;;;;
+10880;NABATAEAN LETTER FINAL ALEPH;Lo;0;R;;;;;N;;;;;
+10881;NABATAEAN LETTER ALEPH;Lo;0;R;;;;;N;;;;;
+10882;NABATAEAN LETTER FINAL BETH;Lo;0;R;;;;;N;;;;;
+10883;NABATAEAN LETTER BETH;Lo;0;R;;;;;N;;;;;
+10884;NABATAEAN LETTER GIMEL;Lo;0;R;;;;;N;;;;;
+10885;NABATAEAN LETTER DALETH;Lo;0;R;;;;;N;;;;;
+10886;NABATAEAN LETTER FINAL HE;Lo;0;R;;;;;N;;;;;
+10887;NABATAEAN LETTER HE;Lo;0;R;;;;;N;;;;;
+10888;NABATAEAN LETTER WAW;Lo;0;R;;;;;N;;;;;
+10889;NABATAEAN LETTER ZAYIN;Lo;0;R;;;;;N;;;;;
+1088A;NABATAEAN LETTER HETH;Lo;0;R;;;;;N;;;;;
+1088B;NABATAEAN LETTER TETH;Lo;0;R;;;;;N;;;;;
+1088C;NABATAEAN LETTER FINAL YODH;Lo;0;R;;;;;N;;;;;
+1088D;NABATAEAN LETTER YODH;Lo;0;R;;;;;N;;;;;
+1088E;NABATAEAN LETTER FINAL KAPH;Lo;0;R;;;;;N;;;;;
+1088F;NABATAEAN LETTER KAPH;Lo;0;R;;;;;N;;;;;
+10890;NABATAEAN LETTER FINAL LAMEDH;Lo;0;R;;;;;N;;;;;
+10891;NABATAEAN LETTER LAMEDH;Lo;0;R;;;;;N;;;;;
+10892;NABATAEAN LETTER FINAL MEM;Lo;0;R;;;;;N;;;;;
+10893;NABATAEAN LETTER MEM;Lo;0;R;;;;;N;;;;;
+10894;NABATAEAN LETTER FINAL NUN;Lo;0;R;;;;;N;;;;;
+10895;NABATAEAN LETTER NUN;Lo;0;R;;;;;N;;;;;
+10896;NABATAEAN LETTER SAMEKH;Lo;0;R;;;;;N;;;;;
+10897;NABATAEAN LETTER AYIN;Lo;0;R;;;;;N;;;;;
+10898;NABATAEAN LETTER PE;Lo;0;R;;;;;N;;;;;
+10899;NABATAEAN LETTER SADHE;Lo;0;R;;;;;N;;;;;
+1089A;NABATAEAN LETTER QOPH;Lo;0;R;;;;;N;;;;;
+1089B;NABATAEAN LETTER RESH;Lo;0;R;;;;;N;;;;;
+1089C;NABATAEAN LETTER FINAL SHIN;Lo;0;R;;;;;N;;;;;
+1089D;NABATAEAN LETTER SHIN;Lo;0;R;;;;;N;;;;;
+1089E;NABATAEAN LETTER TAW;Lo;0;R;;;;;N;;;;;
+108A7;NABATAEAN NUMBER ONE;No;0;R;;;;1;N;;;;;
+108A8;NABATAEAN NUMBER TWO;No;0;R;;;;2;N;;;;;
+108A9;NABATAEAN NUMBER THREE;No;0;R;;;;3;N;;;;;
+108AA;NABATAEAN NUMBER FOUR;No;0;R;;;;4;N;;;;;
+108AB;NABATAEAN CRUCIFORM NUMBER FOUR;No;0;R;;;;4;N;;;;;
+108AC;NABATAEAN NUMBER FIVE;No;0;R;;;;5;N;;;;;
+108AD;NABATAEAN NUMBER TEN;No;0;R;;;;10;N;;;;;
+108AE;NABATAEAN NUMBER TWENTY;No;0;R;;;;20;N;;;;;
+108AF;NABATAEAN NUMBER ONE HUNDRED;No;0;R;;;;100;N;;;;;
+108E0;HATRAN LETTER ALEPH;Lo;0;R;;;;;N;;;;;
+108E1;HATRAN LETTER BETH;Lo;0;R;;;;;N;;;;;
+108E2;HATRAN LETTER GIMEL;Lo;0;R;;;;;N;;;;;
+108E3;HATRAN LETTER DALETH-RESH;Lo;0;R;;;;;N;;;;;
+108E4;HATRAN LETTER HE;Lo;0;R;;;;;N;;;;;
+108E5;HATRAN LETTER WAW;Lo;0;R;;;;;N;;;;;
+108E6;HATRAN LETTER ZAYN;Lo;0;R;;;;;N;;;;;
+108E7;HATRAN LETTER HETH;Lo;0;R;;;;;N;;;;;
+108E8;HATRAN LETTER TETH;Lo;0;R;;;;;N;;;;;
+108E9;HATRAN LETTER YODH;Lo;0;R;;;;;N;;;;;
+108EA;HATRAN LETTER KAPH;Lo;0;R;;;;;N;;;;;
+108EB;HATRAN LETTER LAMEDH;Lo;0;R;;;;;N;;;;;
+108EC;HATRAN LETTER MEM;Lo;0;R;;;;;N;;;;;
+108ED;HATRAN LETTER NUN;Lo;0;R;;;;;N;;;;;
+108EE;HATRAN LETTER SAMEKH;Lo;0;R;;;;;N;;;;;
+108EF;HATRAN LETTER AYN;Lo;0;R;;;;;N;;;;;
+108F0;HATRAN LETTER PE;Lo;0;R;;;;;N;;;;;
+108F1;HATRAN LETTER SADHE;Lo;0;R;;;;;N;;;;;
+108F2;HATRAN LETTER QOPH;Lo;0;R;;;;;N;;;;;
+108F4;HATRAN LETTER SHIN;Lo;0;R;;;;;N;;;;;
+108F5;HATRAN LETTER TAW;Lo;0;R;;;;;N;;;;;
+108FB;HATRAN NUMBER ONE;No;0;R;;;;1;N;;;;;
+108FC;HATRAN NUMBER FIVE;No;0;R;;;;5;N;;;;;
+108FD;HATRAN NUMBER TEN;No;0;R;;;;10;N;;;;;
+108FE;HATRAN NUMBER TWENTY;No;0;R;;;;20;N;;;;;
+108FF;HATRAN NUMBER ONE HUNDRED;No;0;R;;;;100;N;;;;;
+10900;PHOENICIAN LETTER ALF;Lo;0;R;;;;;N;;;;;
+10901;PHOENICIAN LETTER BET;Lo;0;R;;;;;N;;;;;
+10902;PHOENICIAN LETTER GAML;Lo;0;R;;;;;N;;;;;
+10903;PHOENICIAN LETTER DELT;Lo;0;R;;;;;N;;;;;
+10904;PHOENICIAN LETTER HE;Lo;0;R;;;;;N;;;;;
+10905;PHOENICIAN LETTER WAU;Lo;0;R;;;;;N;;;;;
+10906;PHOENICIAN LETTER ZAI;Lo;0;R;;;;;N;;;;;
+10907;PHOENICIAN LETTER HET;Lo;0;R;;;;;N;;;;;
+10908;PHOENICIAN LETTER TET;Lo;0;R;;;;;N;;;;;
+10909;PHOENICIAN LETTER YOD;Lo;0;R;;;;;N;;;;;
+1090A;PHOENICIAN LETTER KAF;Lo;0;R;;;;;N;;;;;
+1090B;PHOENICIAN LETTER LAMD;Lo;0;R;;;;;N;;;;;
+1090C;PHOENICIAN LETTER MEM;Lo;0;R;;;;;N;;;;;
+1090D;PHOENICIAN LETTER NUN;Lo;0;R;;;;;N;;;;;
+1090E;PHOENICIAN LETTER SEMK;Lo;0;R;;;;;N;;;;;
+1090F;PHOENICIAN LETTER AIN;Lo;0;R;;;;;N;;;;;
+10910;PHOENICIAN LETTER PE;Lo;0;R;;;;;N;;;;;
+10911;PHOENICIAN LETTER SADE;Lo;0;R;;;;;N;;;;;
+10912;PHOENICIAN LETTER QOF;Lo;0;R;;;;;N;;;;;
+10913;PHOENICIAN LETTER ROSH;Lo;0;R;;;;;N;;;;;
+10914;PHOENICIAN LETTER SHIN;Lo;0;R;;;;;N;;;;;
+10915;PHOENICIAN LETTER TAU;Lo;0;R;;;;;N;;;;;
+10916;PHOENICIAN NUMBER ONE;No;0;R;;;;1;N;;;;;
+10917;PHOENICIAN NUMBER TEN;No;0;R;;;;10;N;;;;;
+10918;PHOENICIAN NUMBER TWENTY;No;0;R;;;;20;N;;;;;
+10919;PHOENICIAN NUMBER ONE HUNDRED;No;0;R;;;;100;N;;;;;
+1091A;PHOENICIAN NUMBER TWO;No;0;R;;;;2;N;;;;;
+1091B;PHOENICIAN NUMBER THREE;No;0;R;;;;3;N;;;;;
+1091F;PHOENICIAN WORD SEPARATOR;Po;0;ON;;;;;N;;;;;
+10920;LYDIAN LETTER A;Lo;0;R;;;;;N;;;;;
+10921;LYDIAN LETTER B;Lo;0;R;;;;;N;;;;;
+10922;LYDIAN LETTER G;Lo;0;R;;;;;N;;;;;
+10923;LYDIAN LETTER D;Lo;0;R;;;;;N;;;;;
+10924;LYDIAN LETTER E;Lo;0;R;;;;;N;;;;;
+10925;LYDIAN LETTER V;Lo;0;R;;;;;N;;;;;
+10926;LYDIAN LETTER I;Lo;0;R;;;;;N;;;;;
+10927;LYDIAN LETTER Y;Lo;0;R;;;;;N;;;;;
+10928;LYDIAN LETTER K;Lo;0;R;;;;;N;;;;;
+10929;LYDIAN LETTER L;Lo;0;R;;;;;N;;;;;
+1092A;LYDIAN LETTER M;Lo;0;R;;;;;N;;;;;
+1092B;LYDIAN LETTER N;Lo;0;R;;;;;N;;;;;
+1092C;LYDIAN LETTER O;Lo;0;R;;;;;N;;;;;
+1092D;LYDIAN LETTER R;Lo;0;R;;;;;N;;;;;
+1092E;LYDIAN LETTER SS;Lo;0;R;;;;;N;;;;;
+1092F;LYDIAN LETTER T;Lo;0;R;;;;;N;;;;;
+10930;LYDIAN LETTER U;Lo;0;R;;;;;N;;;;;
+10931;LYDIAN LETTER F;Lo;0;R;;;;;N;;;;;
+10932;LYDIAN LETTER Q;Lo;0;R;;;;;N;;;;;
+10933;LYDIAN LETTER S;Lo;0;R;;;;;N;;;;;
+10934;LYDIAN LETTER TT;Lo;0;R;;;;;N;;;;;
+10935;LYDIAN LETTER AN;Lo;0;R;;;;;N;;;;;
+10936;LYDIAN LETTER EN;Lo;0;R;;;;;N;;;;;
+10937;LYDIAN LETTER LY;Lo;0;R;;;;;N;;;;;
+10938;LYDIAN LETTER NN;Lo;0;R;;;;;N;;;;;
+10939;LYDIAN LETTER C;Lo;0;R;;;;;N;;;;;
+1093F;LYDIAN TRIANGULAR MARK;Po;0;R;;;;;N;;;;;
+10980;MEROITIC HIEROGLYPHIC LETTER A;Lo;0;R;;;;;N;;;;;
+10981;MEROITIC HIEROGLYPHIC LETTER E;Lo;0;R;;;;;N;;;;;
+10982;MEROITIC HIEROGLYPHIC LETTER I;Lo;0;R;;;;;N;;;;;
+10983;MEROITIC HIEROGLYPHIC LETTER O;Lo;0;R;;;;;N;;;;;
+10984;MEROITIC HIEROGLYPHIC LETTER YA;Lo;0;R;;;;;N;;;;;
+10985;MEROITIC HIEROGLYPHIC LETTER WA;Lo;0;R;;;;;N;;;;;
+10986;MEROITIC HIEROGLYPHIC LETTER BA;Lo;0;R;;;;;N;;;;;
+10987;MEROITIC HIEROGLYPHIC LETTER BA-2;Lo;0;R;;;;;N;;;;;
+10988;MEROITIC HIEROGLYPHIC LETTER PA;Lo;0;R;;;;;N;;;;;
+10989;MEROITIC HIEROGLYPHIC LETTER MA;Lo;0;R;;;;;N;;;;;
+1098A;MEROITIC HIEROGLYPHIC LETTER NA;Lo;0;R;;;;;N;;;;;
+1098B;MEROITIC HIEROGLYPHIC LETTER NA-2;Lo;0;R;;;;;N;;;;;
+1098C;MEROITIC HIEROGLYPHIC LETTER NE;Lo;0;R;;;;;N;;;;;
+1098D;MEROITIC HIEROGLYPHIC LETTER NE-2;Lo;0;R;;;;;N;;;;;
+1098E;MEROITIC HIEROGLYPHIC LETTER RA;Lo;0;R;;;;;N;;;;;
+1098F;MEROITIC HIEROGLYPHIC LETTER RA-2;Lo;0;R;;;;;N;;;;;
+10990;MEROITIC HIEROGLYPHIC LETTER LA;Lo;0;R;;;;;N;;;;;
+10991;MEROITIC HIEROGLYPHIC LETTER KHA;Lo;0;R;;;;;N;;;;;
+10992;MEROITIC HIEROGLYPHIC LETTER HHA;Lo;0;R;;;;;N;;;;;
+10993;MEROITIC HIEROGLYPHIC LETTER SA;Lo;0;R;;;;;N;;;;;
+10994;MEROITIC HIEROGLYPHIC LETTER SA-2;Lo;0;R;;;;;N;;;;;
+10995;MEROITIC HIEROGLYPHIC LETTER SE;Lo;0;R;;;;;N;;;;;
+10996;MEROITIC HIEROGLYPHIC LETTER KA;Lo;0;R;;;;;N;;;;;
+10997;MEROITIC HIEROGLYPHIC LETTER QA;Lo;0;R;;;;;N;;;;;
+10998;MEROITIC HIEROGLYPHIC LETTER TA;Lo;0;R;;;;;N;;;;;
+10999;MEROITIC HIEROGLYPHIC LETTER TA-2;Lo;0;R;;;;;N;;;;;
+1099A;MEROITIC HIEROGLYPHIC LETTER TE;Lo;0;R;;;;;N;;;;;
+1099B;MEROITIC HIEROGLYPHIC LETTER TE-2;Lo;0;R;;;;;N;;;;;
+1099C;MEROITIC HIEROGLYPHIC LETTER TO;Lo;0;R;;;;;N;;;;;
+1099D;MEROITIC HIEROGLYPHIC LETTER DA;Lo;0;R;;;;;N;;;;;
+1099E;MEROITIC HIEROGLYPHIC SYMBOL VIDJ;Lo;0;R;;;;;N;;;;;
+1099F;MEROITIC HIEROGLYPHIC SYMBOL VIDJ-2;Lo;0;R;;;;;N;;;;;
+109A0;MEROITIC CURSIVE LETTER A;Lo;0;R;;;;;N;;;;;
+109A1;MEROITIC CURSIVE LETTER E;Lo;0;R;;;;;N;;;;;
+109A2;MEROITIC CURSIVE LETTER I;Lo;0;R;;;;;N;;;;;
+109A3;MEROITIC CURSIVE LETTER O;Lo;0;R;;;;;N;;;;;
+109A4;MEROITIC CURSIVE LETTER YA;Lo;0;R;;;;;N;;;;;
+109A5;MEROITIC CURSIVE LETTER WA;Lo;0;R;;;;;N;;;;;
+109A6;MEROITIC CURSIVE LETTER BA;Lo;0;R;;;;;N;;;;;
+109A7;MEROITIC CURSIVE LETTER PA;Lo;0;R;;;;;N;;;;;
+109A8;MEROITIC CURSIVE LETTER MA;Lo;0;R;;;;;N;;;;;
+109A9;MEROITIC CURSIVE LETTER NA;Lo;0;R;;;;;N;;;;;
+109AA;MEROITIC CURSIVE LETTER NE;Lo;0;R;;;;;N;;;;;
+109AB;MEROITIC CURSIVE LETTER RA;Lo;0;R;;;;;N;;;;;
+109AC;MEROITIC CURSIVE LETTER LA;Lo;0;R;;;;;N;;;;;
+109AD;MEROITIC CURSIVE LETTER KHA;Lo;0;R;;;;;N;;;;;
+109AE;MEROITIC CURSIVE LETTER HHA;Lo;0;R;;;;;N;;;;;
+109AF;MEROITIC CURSIVE LETTER SA;Lo;0;R;;;;;N;;;;;
+109B0;MEROITIC CURSIVE LETTER ARCHAIC SA;Lo;0;R;;;;;N;;;;;
+109B1;MEROITIC CURSIVE LETTER SE;Lo;0;R;;;;;N;;;;;
+109B2;MEROITIC CURSIVE LETTER KA;Lo;0;R;;;;;N;;;;;
+109B3;MEROITIC CURSIVE LETTER QA;Lo;0;R;;;;;N;;;;;
+109B4;MEROITIC CURSIVE LETTER TA;Lo;0;R;;;;;N;;;;;
+109B5;MEROITIC CURSIVE LETTER TE;Lo;0;R;;;;;N;;;;;
+109B6;MEROITIC CURSIVE LETTER TO;Lo;0;R;;;;;N;;;;;
+109B7;MEROITIC CURSIVE LETTER DA;Lo;0;R;;;;;N;;;;;
+109BC;MEROITIC CURSIVE FRACTION ELEVEN TWELFTHS;No;0;R;;;;11/12;N;;;;;
+109BD;MEROITIC CURSIVE FRACTION ONE HALF;No;0;R;;;;1/2;N;;;;;
+109BE;MEROITIC CURSIVE LOGOGRAM RMT;Lo;0;R;;;;;N;;;;;
+109BF;MEROITIC CURSIVE LOGOGRAM IMN;Lo;0;R;;;;;N;;;;;
+109C0;MEROITIC CURSIVE NUMBER ONE;No;0;R;;;;1;N;;;;;
+109C1;MEROITIC CURSIVE NUMBER TWO;No;0;R;;;;2;N;;;;;
+109C2;MEROITIC CURSIVE NUMBER THREE;No;0;R;;;;3;N;;;;;
+109C3;MEROITIC CURSIVE NUMBER FOUR;No;0;R;;;;4;N;;;;;
+109C4;MEROITIC CURSIVE NUMBER FIVE;No;0;R;;;;5;N;;;;;
+109C5;MEROITIC CURSIVE NUMBER SIX;No;0;R;;;;6;N;;;;;
+109C6;MEROITIC CURSIVE NUMBER SEVEN;No;0;R;;;;7;N;;;;;
+109C7;MEROITIC CURSIVE NUMBER EIGHT;No;0;R;;;;8;N;;;;;
+109C8;MEROITIC CURSIVE NUMBER NINE;No;0;R;;;;9;N;;;;;
+109C9;MEROITIC CURSIVE NUMBER TEN;No;0;R;;;;10;N;;;;;
+109CA;MEROITIC CURSIVE NUMBER TWENTY;No;0;R;;;;20;N;;;;;
+109CB;MEROITIC CURSIVE NUMBER THIRTY;No;0;R;;;;30;N;;;;;
+109CC;MEROITIC CURSIVE NUMBER FORTY;No;0;R;;;;40;N;;;;;
+109CD;MEROITIC CURSIVE NUMBER FIFTY;No;0;R;;;;50;N;;;;;
+109CE;MEROITIC CURSIVE NUMBER SIXTY;No;0;R;;;;60;N;;;;;
+109CF;MEROITIC CURSIVE NUMBER SEVENTY;No;0;R;;;;70;N;;;;;
+109D2;MEROITIC CURSIVE NUMBER ONE HUNDRED;No;0;R;;;;100;N;;;;;
+109D3;MEROITIC CURSIVE NUMBER TWO HUNDRED;No;0;R;;;;200;N;;;;;
+109D4;MEROITIC CURSIVE NUMBER THREE HUNDRED;No;0;R;;;;300;N;;;;;
+109D5;MEROITIC CURSIVE NUMBER FOUR HUNDRED;No;0;R;;;;400;N;;;;;
+109D6;MEROITIC CURSIVE NUMBER FIVE HUNDRED;No;0;R;;;;500;N;;;;;
+109D7;MEROITIC CURSIVE NUMBER SIX HUNDRED;No;0;R;;;;600;N;;;;;
+109D8;MEROITIC CURSIVE NUMBER SEVEN HUNDRED;No;0;R;;;;700;N;;;;;
+109D9;MEROITIC CURSIVE NUMBER EIGHT HUNDRED;No;0;R;;;;800;N;;;;;
+109DA;MEROITIC CURSIVE NUMBER NINE HUNDRED;No;0;R;;;;900;N;;;;;
+109DB;MEROITIC CURSIVE NUMBER ONE THOUSAND;No;0;R;;;;1000;N;;;;;
+109DC;MEROITIC CURSIVE NUMBER TWO THOUSAND;No;0;R;;;;2000;N;;;;;
+109DD;MEROITIC CURSIVE NUMBER THREE THOUSAND;No;0;R;;;;3000;N;;;;;
+109DE;MEROITIC CURSIVE NUMBER FOUR THOUSAND;No;0;R;;;;4000;N;;;;;
+109DF;MEROITIC CURSIVE NUMBER FIVE THOUSAND;No;0;R;;;;5000;N;;;;;
+109E0;MEROITIC CURSIVE NUMBER SIX THOUSAND;No;0;R;;;;6000;N;;;;;
+109E1;MEROITIC CURSIVE NUMBER SEVEN THOUSAND;No;0;R;;;;7000;N;;;;;
+109E2;MEROITIC CURSIVE NUMBER EIGHT THOUSAND;No;0;R;;;;8000;N;;;;;
+109E3;MEROITIC CURSIVE NUMBER NINE THOUSAND;No;0;R;;;;9000;N;;;;;
+109E4;MEROITIC CURSIVE NUMBER TEN THOUSAND;No;0;R;;;;10000;N;;;;;
+109E5;MEROITIC CURSIVE NUMBER TWENTY THOUSAND;No;0;R;;;;20000;N;;;;;
+109E6;MEROITIC CURSIVE NUMBER THIRTY THOUSAND;No;0;R;;;;30000;N;;;;;
+109E7;MEROITIC CURSIVE NUMBER FORTY THOUSAND;No;0;R;;;;40000;N;;;;;
+109E8;MEROITIC CURSIVE NUMBER FIFTY THOUSAND;No;0;R;;;;50000;N;;;;;
+109E9;MEROITIC CURSIVE NUMBER SIXTY THOUSAND;No;0;R;;;;60000;N;;;;;
+109EA;MEROITIC CURSIVE NUMBER SEVENTY THOUSAND;No;0;R;;;;70000;N;;;;;
+109EB;MEROITIC CURSIVE NUMBER EIGHTY THOUSAND;No;0;R;;;;80000;N;;;;;
+109EC;MEROITIC CURSIVE NUMBER NINETY THOUSAND;No;0;R;;;;90000;N;;;;;
+109ED;MEROITIC CURSIVE NUMBER ONE HUNDRED THOUSAND;No;0;R;;;;100000;N;;;;;
+109EE;MEROITIC CURSIVE NUMBER TWO HUNDRED THOUSAND;No;0;R;;;;200000;N;;;;;
+109EF;MEROITIC CURSIVE NUMBER THREE HUNDRED THOUSAND;No;0;R;;;;300000;N;;;;;
+109F0;MEROITIC CURSIVE NUMBER FOUR HUNDRED THOUSAND;No;0;R;;;;400000;N;;;;;
+109F1;MEROITIC CURSIVE NUMBER FIVE HUNDRED THOUSAND;No;0;R;;;;500000;N;;;;;
+109F2;MEROITIC CURSIVE NUMBER SIX HUNDRED THOUSAND;No;0;R;;;;600000;N;;;;;
+109F3;MEROITIC CURSIVE NUMBER SEVEN HUNDRED THOUSAND;No;0;R;;;;700000;N;;;;;
+109F4;MEROITIC CURSIVE NUMBER EIGHT HUNDRED THOUSAND;No;0;R;;;;800000;N;;;;;
+109F5;MEROITIC CURSIVE NUMBER NINE HUNDRED THOUSAND;No;0;R;;;;900000;N;;;;;
+109F6;MEROITIC CURSIVE FRACTION ONE TWELFTH;No;0;R;;;;1/12;N;;;;;
+109F7;MEROITIC CURSIVE FRACTION TWO TWELFTHS;No;0;R;;;;2/12;N;;;;;
+109F8;MEROITIC CURSIVE FRACTION THREE TWELFTHS;No;0;R;;;;3/12;N;;;;;
+109F9;MEROITIC CURSIVE FRACTION FOUR TWELFTHS;No;0;R;;;;4/12;N;;;;;
+109FA;MEROITIC CURSIVE FRACTION FIVE TWELFTHS;No;0;R;;;;5/12;N;;;;;
+109FB;MEROITIC CURSIVE FRACTION SIX TWELFTHS;No;0;R;;;;6/12;N;;;;;
+109FC;MEROITIC CURSIVE FRACTION SEVEN TWELFTHS;No;0;R;;;;7/12;N;;;;;
+109FD;MEROITIC CURSIVE FRACTION EIGHT TWELFTHS;No;0;R;;;;8/12;N;;;;;
+109FE;MEROITIC CURSIVE FRACTION NINE TWELFTHS;No;0;R;;;;9/12;N;;;;;
+109FF;MEROITIC CURSIVE FRACTION TEN TWELFTHS;No;0;R;;;;10/12;N;;;;;
+10A00;KHAROSHTHI LETTER A;Lo;0;R;;;;;N;;;;;
+10A01;KHAROSHTHI VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+10A02;KHAROSHTHI VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+10A03;KHAROSHTHI VOWEL SIGN VOCALIC R;Mn;0;NSM;;;;;N;;;;;
+10A05;KHAROSHTHI VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+10A06;KHAROSHTHI VOWEL SIGN O;Mn;0;NSM;;;;;N;;;;;
+10A0C;KHAROSHTHI VOWEL LENGTH MARK;Mn;0;NSM;;;;;N;;;;;
+10A0D;KHAROSHTHI SIGN DOUBLE RING BELOW;Mn;220;NSM;;;;;N;;;;;
+10A0E;KHAROSHTHI SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+10A0F;KHAROSHTHI SIGN VISARGA;Mn;230;NSM;;;;;N;;;;;
+10A10;KHAROSHTHI LETTER KA;Lo;0;R;;;;;N;;;;;
+10A11;KHAROSHTHI LETTER KHA;Lo;0;R;;;;;N;;;;;
+10A12;KHAROSHTHI LETTER GA;Lo;0;R;;;;;N;;;;;
+10A13;KHAROSHTHI LETTER GHA;Lo;0;R;;;;;N;;;;;
+10A15;KHAROSHTHI LETTER CA;Lo;0;R;;;;;N;;;;;
+10A16;KHAROSHTHI LETTER CHA;Lo;0;R;;;;;N;;;;;
+10A17;KHAROSHTHI LETTER JA;Lo;0;R;;;;;N;;;;;
+10A19;KHAROSHTHI LETTER NYA;Lo;0;R;;;;;N;;;;;
+10A1A;KHAROSHTHI LETTER TTA;Lo;0;R;;;;;N;;;;;
+10A1B;KHAROSHTHI LETTER TTHA;Lo;0;R;;;;;N;;;;;
+10A1C;KHAROSHTHI LETTER DDA;Lo;0;R;;;;;N;;;;;
+10A1D;KHAROSHTHI LETTER DDHA;Lo;0;R;;;;;N;;;;;
+10A1E;KHAROSHTHI LETTER NNA;Lo;0;R;;;;;N;;;;;
+10A1F;KHAROSHTHI LETTER TA;Lo;0;R;;;;;N;;;;;
+10A20;KHAROSHTHI LETTER THA;Lo;0;R;;;;;N;;;;;
+10A21;KHAROSHTHI LETTER DA;Lo;0;R;;;;;N;;;;;
+10A22;KHAROSHTHI LETTER DHA;Lo;0;R;;;;;N;;;;;
+10A23;KHAROSHTHI LETTER NA;Lo;0;R;;;;;N;;;;;
+10A24;KHAROSHTHI LETTER PA;Lo;0;R;;;;;N;;;;;
+10A25;KHAROSHTHI LETTER PHA;Lo;0;R;;;;;N;;;;;
+10A26;KHAROSHTHI LETTER BA;Lo;0;R;;;;;N;;;;;
+10A27;KHAROSHTHI LETTER BHA;Lo;0;R;;;;;N;;;;;
+10A28;KHAROSHTHI LETTER MA;Lo;0;R;;;;;N;;;;;
+10A29;KHAROSHTHI LETTER YA;Lo;0;R;;;;;N;;;;;
+10A2A;KHAROSHTHI LETTER RA;Lo;0;R;;;;;N;;;;;
+10A2B;KHAROSHTHI LETTER LA;Lo;0;R;;;;;N;;;;;
+10A2C;KHAROSHTHI LETTER VA;Lo;0;R;;;;;N;;;;;
+10A2D;KHAROSHTHI LETTER SHA;Lo;0;R;;;;;N;;;;;
+10A2E;KHAROSHTHI LETTER SSA;Lo;0;R;;;;;N;;;;;
+10A2F;KHAROSHTHI LETTER SA;Lo;0;R;;;;;N;;;;;
+10A30;KHAROSHTHI LETTER ZA;Lo;0;R;;;;;N;;;;;
+10A31;KHAROSHTHI LETTER HA;Lo;0;R;;;;;N;;;;;
+10A32;KHAROSHTHI LETTER KKA;Lo;0;R;;;;;N;;;;;
+10A33;KHAROSHTHI LETTER TTTHA;Lo;0;R;;;;;N;;;;;
+10A38;KHAROSHTHI SIGN BAR ABOVE;Mn;230;NSM;;;;;N;;;;;
+10A39;KHAROSHTHI SIGN CAUDA;Mn;1;NSM;;;;;N;;;;;
+10A3A;KHAROSHTHI SIGN DOT BELOW;Mn;220;NSM;;;;;N;;;;;
+10A3F;KHAROSHTHI VIRAMA;Mn;9;NSM;;;;;N;;;;;
+10A40;KHAROSHTHI DIGIT ONE;No;0;R;;;1;1;N;;;;;
+10A41;KHAROSHTHI DIGIT TWO;No;0;R;;;2;2;N;;;;;
+10A42;KHAROSHTHI DIGIT THREE;No;0;R;;;3;3;N;;;;;
+10A43;KHAROSHTHI DIGIT FOUR;No;0;R;;;4;4;N;;;;;
+10A44;KHAROSHTHI NUMBER TEN;No;0;R;;;;10;N;;;;;
+10A45;KHAROSHTHI NUMBER TWENTY;No;0;R;;;;20;N;;;;;
+10A46;KHAROSHTHI NUMBER ONE HUNDRED;No;0;R;;;;100;N;;;;;
+10A47;KHAROSHTHI NUMBER ONE THOUSAND;No;0;R;;;;1000;N;;;;;
+10A50;KHAROSHTHI PUNCTUATION DOT;Po;0;R;;;;;N;;;;;
+10A51;KHAROSHTHI PUNCTUATION SMALL CIRCLE;Po;0;R;;;;;N;;;;;
+10A52;KHAROSHTHI PUNCTUATION CIRCLE;Po;0;R;;;;;N;;;;;
+10A53;KHAROSHTHI PUNCTUATION CRESCENT BAR;Po;0;R;;;;;N;;;;;
+10A54;KHAROSHTHI PUNCTUATION MANGALAM;Po;0;R;;;;;N;;;;;
+10A55;KHAROSHTHI PUNCTUATION LOTUS;Po;0;R;;;;;N;;;;;
+10A56;KHAROSHTHI PUNCTUATION DANDA;Po;0;R;;;;;N;;;;;
+10A57;KHAROSHTHI PUNCTUATION DOUBLE DANDA;Po;0;R;;;;;N;;;;;
+10A58;KHAROSHTHI PUNCTUATION LINES;Po;0;R;;;;;N;;;;;
+10A60;OLD SOUTH ARABIAN LETTER HE;Lo;0;R;;;;;N;;;;;
+10A61;OLD SOUTH ARABIAN LETTER LAMEDH;Lo;0;R;;;;;N;;;;;
+10A62;OLD SOUTH ARABIAN LETTER HETH;Lo;0;R;;;;;N;;;;;
+10A63;OLD SOUTH ARABIAN LETTER MEM;Lo;0;R;;;;;N;;;;;
+10A64;OLD SOUTH ARABIAN LETTER QOPH;Lo;0;R;;;;;N;;;;;
+10A65;OLD SOUTH ARABIAN LETTER WAW;Lo;0;R;;;;;N;;;;;
+10A66;OLD SOUTH ARABIAN LETTER SHIN;Lo;0;R;;;;;N;;;;;
+10A67;OLD SOUTH ARABIAN LETTER RESH;Lo;0;R;;;;;N;;;;;
+10A68;OLD SOUTH ARABIAN LETTER BETH;Lo;0;R;;;;;N;;;;;
+10A69;OLD SOUTH ARABIAN LETTER TAW;Lo;0;R;;;;;N;;;;;
+10A6A;OLD SOUTH ARABIAN LETTER SAT;Lo;0;R;;;;;N;;;;;
+10A6B;OLD SOUTH ARABIAN LETTER KAPH;Lo;0;R;;;;;N;;;;;
+10A6C;OLD SOUTH ARABIAN LETTER NUN;Lo;0;R;;;;;N;;;;;
+10A6D;OLD SOUTH ARABIAN LETTER KHETH;Lo;0;R;;;;;N;;;;;
+10A6E;OLD SOUTH ARABIAN LETTER SADHE;Lo;0;R;;;;;N;;;;;
+10A6F;OLD SOUTH ARABIAN LETTER SAMEKH;Lo;0;R;;;;;N;;;;;
+10A70;OLD SOUTH ARABIAN LETTER FE;Lo;0;R;;;;;N;;;;;
+10A71;OLD SOUTH ARABIAN LETTER ALEF;Lo;0;R;;;;;N;;;;;
+10A72;OLD SOUTH ARABIAN LETTER AYN;Lo;0;R;;;;;N;;;;;
+10A73;OLD SOUTH ARABIAN LETTER DHADHE;Lo;0;R;;;;;N;;;;;
+10A74;OLD SOUTH ARABIAN LETTER GIMEL;Lo;0;R;;;;;N;;;;;
+10A75;OLD SOUTH ARABIAN LETTER DALETH;Lo;0;R;;;;;N;;;;;
+10A76;OLD SOUTH ARABIAN LETTER GHAYN;Lo;0;R;;;;;N;;;;;
+10A77;OLD SOUTH ARABIAN LETTER TETH;Lo;0;R;;;;;N;;;;;
+10A78;OLD SOUTH ARABIAN LETTER ZAYN;Lo;0;R;;;;;N;;;;;
+10A79;OLD SOUTH ARABIAN LETTER DHALETH;Lo;0;R;;;;;N;;;;;
+10A7A;OLD SOUTH ARABIAN LETTER YODH;Lo;0;R;;;;;N;;;;;
+10A7B;OLD SOUTH ARABIAN LETTER THAW;Lo;0;R;;;;;N;;;;;
+10A7C;OLD SOUTH ARABIAN LETTER THETH;Lo;0;R;;;;;N;;;;;
+10A7D;OLD SOUTH ARABIAN NUMBER ONE;No;0;R;;;;1;N;;;;;
+10A7E;OLD SOUTH ARABIAN NUMBER FIFTY;No;0;R;;;;50;N;;;;;
+10A7F;OLD SOUTH ARABIAN NUMERIC INDICATOR;Po;0;R;;;;;N;;;;;
+10A80;OLD NORTH ARABIAN LETTER HEH;Lo;0;R;;;;;N;;;;;
+10A81;OLD NORTH ARABIAN LETTER LAM;Lo;0;R;;;;;N;;;;;
+10A82;OLD NORTH ARABIAN LETTER HAH;Lo;0;R;;;;;N;;;;;
+10A83;OLD NORTH ARABIAN LETTER MEEM;Lo;0;R;;;;;N;;;;;
+10A84;OLD NORTH ARABIAN LETTER QAF;Lo;0;R;;;;;N;;;;;
+10A85;OLD NORTH ARABIAN LETTER WAW;Lo;0;R;;;;;N;;;;;
+10A86;OLD NORTH ARABIAN LETTER ES-2;Lo;0;R;;;;;N;;;;;
+10A87;OLD NORTH ARABIAN LETTER REH;Lo;0;R;;;;;N;;;;;
+10A88;OLD NORTH ARABIAN LETTER BEH;Lo;0;R;;;;;N;;;;;
+10A89;OLD NORTH ARABIAN LETTER TEH;Lo;0;R;;;;;N;;;;;
+10A8A;OLD NORTH ARABIAN LETTER ES-1;Lo;0;R;;;;;N;;;;;
+10A8B;OLD NORTH ARABIAN LETTER KAF;Lo;0;R;;;;;N;;;;;
+10A8C;OLD NORTH ARABIAN LETTER NOON;Lo;0;R;;;;;N;;;;;
+10A8D;OLD NORTH ARABIAN LETTER KHAH;Lo;0;R;;;;;N;;;;;
+10A8E;OLD NORTH ARABIAN LETTER SAD;Lo;0;R;;;;;N;;;;;
+10A8F;OLD NORTH ARABIAN LETTER ES-3;Lo;0;R;;;;;N;;;;;
+10A90;OLD NORTH ARABIAN LETTER FEH;Lo;0;R;;;;;N;;;;;
+10A91;OLD NORTH ARABIAN LETTER ALEF;Lo;0;R;;;;;N;;;;;
+10A92;OLD NORTH ARABIAN LETTER AIN;Lo;0;R;;;;;N;;;;;
+10A93;OLD NORTH ARABIAN LETTER DAD;Lo;0;R;;;;;N;;;;;
+10A94;OLD NORTH ARABIAN LETTER GEEM;Lo;0;R;;;;;N;;;;;
+10A95;OLD NORTH ARABIAN LETTER DAL;Lo;0;R;;;;;N;;;;;
+10A96;OLD NORTH ARABIAN LETTER GHAIN;Lo;0;R;;;;;N;;;;;
+10A97;OLD NORTH ARABIAN LETTER TAH;Lo;0;R;;;;;N;;;;;
+10A98;OLD NORTH ARABIAN LETTER ZAIN;Lo;0;R;;;;;N;;;;;
+10A99;OLD NORTH ARABIAN LETTER THAL;Lo;0;R;;;;;N;;;;;
+10A9A;OLD NORTH ARABIAN LETTER YEH;Lo;0;R;;;;;N;;;;;
+10A9B;OLD NORTH ARABIAN LETTER THEH;Lo;0;R;;;;;N;;;;;
+10A9C;OLD NORTH ARABIAN LETTER ZAH;Lo;0;R;;;;;N;;;;;
+10A9D;OLD NORTH ARABIAN NUMBER ONE;No;0;R;;;;1;N;;;;;
+10A9E;OLD NORTH ARABIAN NUMBER TEN;No;0;R;;;;10;N;;;;;
+10A9F;OLD NORTH ARABIAN NUMBER TWENTY;No;0;R;;;;20;N;;;;;
+10AC0;MANICHAEAN LETTER ALEPH;Lo;0;R;;;;;N;;;;;
+10AC1;MANICHAEAN LETTER BETH;Lo;0;R;;;;;N;;;;;
+10AC2;MANICHAEAN LETTER BHETH;Lo;0;R;;;;;N;;;;;
+10AC3;MANICHAEAN LETTER GIMEL;Lo;0;R;;;;;N;;;;;
+10AC4;MANICHAEAN LETTER GHIMEL;Lo;0;R;;;;;N;;;;;
+10AC5;MANICHAEAN LETTER DALETH;Lo;0;R;;;;;N;;;;;
+10AC6;MANICHAEAN LETTER HE;Lo;0;R;;;;;N;;;;;
+10AC7;MANICHAEAN LETTER WAW;Lo;0;R;;;;;N;;;;;
+10AC8;MANICHAEAN SIGN UD;So;0;R;;;;;N;;;;;
+10AC9;MANICHAEAN LETTER ZAYIN;Lo;0;R;;;;;N;;;;;
+10ACA;MANICHAEAN LETTER ZHAYIN;Lo;0;R;;;;;N;;;;;
+10ACB;MANICHAEAN LETTER JAYIN;Lo;0;R;;;;;N;;;;;
+10ACC;MANICHAEAN LETTER JHAYIN;Lo;0;R;;;;;N;;;;;
+10ACD;MANICHAEAN LETTER HETH;Lo;0;R;;;;;N;;;;;
+10ACE;MANICHAEAN LETTER TETH;Lo;0;R;;;;;N;;;;;
+10ACF;MANICHAEAN LETTER YODH;Lo;0;R;;;;;N;;;;;
+10AD0;MANICHAEAN LETTER KAPH;Lo;0;R;;;;;N;;;;;
+10AD1;MANICHAEAN LETTER XAPH;Lo;0;R;;;;;N;;;;;
+10AD2;MANICHAEAN LETTER KHAPH;Lo;0;R;;;;;N;;;;;
+10AD3;MANICHAEAN LETTER LAMEDH;Lo;0;R;;;;;N;;;;;
+10AD4;MANICHAEAN LETTER DHAMEDH;Lo;0;R;;;;;N;;;;;
+10AD5;MANICHAEAN LETTER THAMEDH;Lo;0;R;;;;;N;;;;;
+10AD6;MANICHAEAN LETTER MEM;Lo;0;R;;;;;N;;;;;
+10AD7;MANICHAEAN LETTER NUN;Lo;0;R;;;;;N;;;;;
+10AD8;MANICHAEAN LETTER SAMEKH;Lo;0;R;;;;;N;;;;;
+10AD9;MANICHAEAN LETTER AYIN;Lo;0;R;;;;;N;;;;;
+10ADA;MANICHAEAN LETTER AAYIN;Lo;0;R;;;;;N;;;;;
+10ADB;MANICHAEAN LETTER PE;Lo;0;R;;;;;N;;;;;
+10ADC;MANICHAEAN LETTER FE;Lo;0;R;;;;;N;;;;;
+10ADD;MANICHAEAN LETTER SADHE;Lo;0;R;;;;;N;;;;;
+10ADE;MANICHAEAN LETTER QOPH;Lo;0;R;;;;;N;;;;;
+10ADF;MANICHAEAN LETTER XOPH;Lo;0;R;;;;;N;;;;;
+10AE0;MANICHAEAN LETTER QHOPH;Lo;0;R;;;;;N;;;;;
+10AE1;MANICHAEAN LETTER RESH;Lo;0;R;;;;;N;;;;;
+10AE2;MANICHAEAN LETTER SHIN;Lo;0;R;;;;;N;;;;;
+10AE3;MANICHAEAN LETTER SSHIN;Lo;0;R;;;;;N;;;;;
+10AE4;MANICHAEAN LETTER TAW;Lo;0;R;;;;;N;;;;;
+10AE5;MANICHAEAN ABBREVIATION MARK ABOVE;Mn;230;NSM;;;;;N;;;;;
+10AE6;MANICHAEAN ABBREVIATION MARK BELOW;Mn;220;NSM;;;;;N;;;;;
+10AEB;MANICHAEAN NUMBER ONE;No;0;R;;;;1;N;;;;;
+10AEC;MANICHAEAN NUMBER FIVE;No;0;R;;;;5;N;;;;;
+10AED;MANICHAEAN NUMBER TEN;No;0;R;;;;10;N;;;;;
+10AEE;MANICHAEAN NUMBER TWENTY;No;0;R;;;;20;N;;;;;
+10AEF;MANICHAEAN NUMBER ONE HUNDRED;No;0;R;;;;100;N;;;;;
+10AF0;MANICHAEAN PUNCTUATION STAR;Po;0;R;;;;;N;;;;;
+10AF1;MANICHAEAN PUNCTUATION FLEURON;Po;0;R;;;;;N;;;;;
+10AF2;MANICHAEAN PUNCTUATION DOUBLE DOT WITHIN DOT;Po;0;R;;;;;N;;;;;
+10AF3;MANICHAEAN PUNCTUATION DOT WITHIN DOT;Po;0;R;;;;;N;;;;;
+10AF4;MANICHAEAN PUNCTUATION DOT;Po;0;R;;;;;N;;;;;
+10AF5;MANICHAEAN PUNCTUATION TWO DOTS;Po;0;R;;;;;N;;;;;
+10AF6;MANICHAEAN PUNCTUATION LINE FILLER;Po;0;R;;;;;N;;;;;
+10B00;AVESTAN LETTER A;Lo;0;R;;;;;N;;;;;
+10B01;AVESTAN LETTER AA;Lo;0;R;;;;;N;;;;;
+10B02;AVESTAN LETTER AO;Lo;0;R;;;;;N;;;;;
+10B03;AVESTAN LETTER AAO;Lo;0;R;;;;;N;;;;;
+10B04;AVESTAN LETTER AN;Lo;0;R;;;;;N;;;;;
+10B05;AVESTAN LETTER AAN;Lo;0;R;;;;;N;;;;;
+10B06;AVESTAN LETTER AE;Lo;0;R;;;;;N;;;;;
+10B07;AVESTAN LETTER AEE;Lo;0;R;;;;;N;;;;;
+10B08;AVESTAN LETTER E;Lo;0;R;;;;;N;;;;;
+10B09;AVESTAN LETTER EE;Lo;0;R;;;;;N;;;;;
+10B0A;AVESTAN LETTER O;Lo;0;R;;;;;N;;;;;
+10B0B;AVESTAN LETTER OO;Lo;0;R;;;;;N;;;;;
+10B0C;AVESTAN LETTER I;Lo;0;R;;;;;N;;;;;
+10B0D;AVESTAN LETTER II;Lo;0;R;;;;;N;;;;;
+10B0E;AVESTAN LETTER U;Lo;0;R;;;;;N;;;;;
+10B0F;AVESTAN LETTER UU;Lo;0;R;;;;;N;;;;;
+10B10;AVESTAN LETTER KE;Lo;0;R;;;;;N;;;;;
+10B11;AVESTAN LETTER XE;Lo;0;R;;;;;N;;;;;
+10B12;AVESTAN LETTER XYE;Lo;0;R;;;;;N;;;;;
+10B13;AVESTAN LETTER XVE;Lo;0;R;;;;;N;;;;;
+10B14;AVESTAN LETTER GE;Lo;0;R;;;;;N;;;;;
+10B15;AVESTAN LETTER GGE;Lo;0;R;;;;;N;;;;;
+10B16;AVESTAN LETTER GHE;Lo;0;R;;;;;N;;;;;
+10B17;AVESTAN LETTER CE;Lo;0;R;;;;;N;;;;;
+10B18;AVESTAN LETTER JE;Lo;0;R;;;;;N;;;;;
+10B19;AVESTAN LETTER TE;Lo;0;R;;;;;N;;;;;
+10B1A;AVESTAN LETTER THE;Lo;0;R;;;;;N;;;;;
+10B1B;AVESTAN LETTER DE;Lo;0;R;;;;;N;;;;;
+10B1C;AVESTAN LETTER DHE;Lo;0;R;;;;;N;;;;;
+10B1D;AVESTAN LETTER TTE;Lo;0;R;;;;;N;;;;;
+10B1E;AVESTAN LETTER PE;Lo;0;R;;;;;N;;;;;
+10B1F;AVESTAN LETTER FE;Lo;0;R;;;;;N;;;;;
+10B20;AVESTAN LETTER BE;Lo;0;R;;;;;N;;;;;
+10B21;AVESTAN LETTER BHE;Lo;0;R;;;;;N;;;;;
+10B22;AVESTAN LETTER NGE;Lo;0;R;;;;;N;;;;;
+10B23;AVESTAN LETTER NGYE;Lo;0;R;;;;;N;;;;;
+10B24;AVESTAN LETTER NGVE;Lo;0;R;;;;;N;;;;;
+10B25;AVESTAN LETTER NE;Lo;0;R;;;;;N;;;;;
+10B26;AVESTAN LETTER NYE;Lo;0;R;;;;;N;;;;;
+10B27;AVESTAN LETTER NNE;Lo;0;R;;;;;N;;;;;
+10B28;AVESTAN LETTER ME;Lo;0;R;;;;;N;;;;;
+10B29;AVESTAN LETTER HME;Lo;0;R;;;;;N;;;;;
+10B2A;AVESTAN LETTER YYE;Lo;0;R;;;;;N;;;;;
+10B2B;AVESTAN LETTER YE;Lo;0;R;;;;;N;;;;;
+10B2C;AVESTAN LETTER VE;Lo;0;R;;;;;N;;;;;
+10B2D;AVESTAN LETTER RE;Lo;0;R;;;;;N;;;;;
+10B2E;AVESTAN LETTER LE;Lo;0;R;;;;;N;;;;;
+10B2F;AVESTAN LETTER SE;Lo;0;R;;;;;N;;;;;
+10B30;AVESTAN LETTER ZE;Lo;0;R;;;;;N;;;;;
+10B31;AVESTAN LETTER SHE;Lo;0;R;;;;;N;;;;;
+10B32;AVESTAN LETTER ZHE;Lo;0;R;;;;;N;;;;;
+10B33;AVESTAN LETTER SHYE;Lo;0;R;;;;;N;;;;;
+10B34;AVESTAN LETTER SSHE;Lo;0;R;;;;;N;;;;;
+10B35;AVESTAN LETTER HE;Lo;0;R;;;;;N;;;;;
+10B39;AVESTAN ABBREVIATION MARK;Po;0;ON;;;;;N;;;;;
+10B3A;TINY TWO DOTS OVER ONE DOT PUNCTUATION;Po;0;ON;;;;;N;;;;;
+10B3B;SMALL TWO DOTS OVER ONE DOT PUNCTUATION;Po;0;ON;;;;;N;;;;;
+10B3C;LARGE TWO DOTS OVER ONE DOT PUNCTUATION;Po;0;ON;;;;;N;;;;;
+10B3D;LARGE ONE DOT OVER TWO DOTS PUNCTUATION;Po;0;ON;;;;;N;;;;;
+10B3E;LARGE TWO RINGS OVER ONE RING PUNCTUATION;Po;0;ON;;;;;N;;;;;
+10B3F;LARGE ONE RING OVER TWO RINGS PUNCTUATION;Po;0;ON;;;;;N;;;;;
+10B40;INSCRIPTIONAL PARTHIAN LETTER ALEPH;Lo;0;R;;;;;N;;;;;
+10B41;INSCRIPTIONAL PARTHIAN LETTER BETH;Lo;0;R;;;;;N;;;;;
+10B42;INSCRIPTIONAL PARTHIAN LETTER GIMEL;Lo;0;R;;;;;N;;;;;
+10B43;INSCRIPTIONAL PARTHIAN LETTER DALETH;Lo;0;R;;;;;N;;;;;
+10B44;INSCRIPTIONAL PARTHIAN LETTER HE;Lo;0;R;;;;;N;;;;;
+10B45;INSCRIPTIONAL PARTHIAN LETTER WAW;Lo;0;R;;;;;N;;;;;
+10B46;INSCRIPTIONAL PARTHIAN LETTER ZAYIN;Lo;0;R;;;;;N;;;;;
+10B47;INSCRIPTIONAL PARTHIAN LETTER HETH;Lo;0;R;;;;;N;;;;;
+10B48;INSCRIPTIONAL PARTHIAN LETTER TETH;Lo;0;R;;;;;N;;;;;
+10B49;INSCRIPTIONAL PARTHIAN LETTER YODH;Lo;0;R;;;;;N;;;;;
+10B4A;INSCRIPTIONAL PARTHIAN LETTER KAPH;Lo;0;R;;;;;N;;;;;
+10B4B;INSCRIPTIONAL PARTHIAN LETTER LAMEDH;Lo;0;R;;;;;N;;;;;
+10B4C;INSCRIPTIONAL PARTHIAN LETTER MEM;Lo;0;R;;;;;N;;;;;
+10B4D;INSCRIPTIONAL PARTHIAN LETTER NUN;Lo;0;R;;;;;N;;;;;
+10B4E;INSCRIPTIONAL PARTHIAN LETTER SAMEKH;Lo;0;R;;;;;N;;;;;
+10B4F;INSCRIPTIONAL PARTHIAN LETTER AYIN;Lo;0;R;;;;;N;;;;;
+10B50;INSCRIPTIONAL PARTHIAN LETTER PE;Lo;0;R;;;;;N;;;;;
+10B51;INSCRIPTIONAL PARTHIAN LETTER SADHE;Lo;0;R;;;;;N;;;;;
+10B52;INSCRIPTIONAL PARTHIAN LETTER QOPH;Lo;0;R;;;;;N;;;;;
+10B53;INSCRIPTIONAL PARTHIAN LETTER RESH;Lo;0;R;;;;;N;;;;;
+10B54;INSCRIPTIONAL PARTHIAN LETTER SHIN;Lo;0;R;;;;;N;;;;;
+10B55;INSCRIPTIONAL PARTHIAN LETTER TAW;Lo;0;R;;;;;N;;;;;
+10B58;INSCRIPTIONAL PARTHIAN NUMBER ONE;No;0;R;;;;1;N;;;;;
+10B59;INSCRIPTIONAL PARTHIAN NUMBER TWO;No;0;R;;;;2;N;;;;;
+10B5A;INSCRIPTIONAL PARTHIAN NUMBER THREE;No;0;R;;;;3;N;;;;;
+10B5B;INSCRIPTIONAL PARTHIAN NUMBER FOUR;No;0;R;;;;4;N;;;;;
+10B5C;INSCRIPTIONAL PARTHIAN NUMBER TEN;No;0;R;;;;10;N;;;;;
+10B5D;INSCRIPTIONAL PARTHIAN NUMBER TWENTY;No;0;R;;;;20;N;;;;;
+10B5E;INSCRIPTIONAL PARTHIAN NUMBER ONE HUNDRED;No;0;R;;;;100;N;;;;;
+10B5F;INSCRIPTIONAL PARTHIAN NUMBER ONE THOUSAND;No;0;R;;;;1000;N;;;;;
+10B60;INSCRIPTIONAL PAHLAVI LETTER ALEPH;Lo;0;R;;;;;N;;;;;
+10B61;INSCRIPTIONAL PAHLAVI LETTER BETH;Lo;0;R;;;;;N;;;;;
+10B62;INSCRIPTIONAL PAHLAVI LETTER GIMEL;Lo;0;R;;;;;N;;;;;
+10B63;INSCRIPTIONAL PAHLAVI LETTER DALETH;Lo;0;R;;;;;N;;;;;
+10B64;INSCRIPTIONAL PAHLAVI LETTER HE;Lo;0;R;;;;;N;;;;;
+10B65;INSCRIPTIONAL PAHLAVI LETTER WAW-AYIN-RESH;Lo;0;R;;;;;N;;;;;
+10B66;INSCRIPTIONAL PAHLAVI LETTER ZAYIN;Lo;0;R;;;;;N;;;;;
+10B67;INSCRIPTIONAL PAHLAVI LETTER HETH;Lo;0;R;;;;;N;;;;;
+10B68;INSCRIPTIONAL PAHLAVI LETTER TETH;Lo;0;R;;;;;N;;;;;
+10B69;INSCRIPTIONAL PAHLAVI LETTER YODH;Lo;0;R;;;;;N;;;;;
+10B6A;INSCRIPTIONAL PAHLAVI LETTER KAPH;Lo;0;R;;;;;N;;;;;
+10B6B;INSCRIPTIONAL PAHLAVI LETTER LAMEDH;Lo;0;R;;;;;N;;;;;
+10B6C;INSCRIPTIONAL PAHLAVI LETTER MEM-QOPH;Lo;0;R;;;;;N;;;;;
+10B6D;INSCRIPTIONAL PAHLAVI LETTER NUN;Lo;0;R;;;;;N;;;;;
+10B6E;INSCRIPTIONAL PAHLAVI LETTER SAMEKH;Lo;0;R;;;;;N;;;;;
+10B6F;INSCRIPTIONAL PAHLAVI LETTER PE;Lo;0;R;;;;;N;;;;;
+10B70;INSCRIPTIONAL PAHLAVI LETTER SADHE;Lo;0;R;;;;;N;;;;;
+10B71;INSCRIPTIONAL PAHLAVI LETTER SHIN;Lo;0;R;;;;;N;;;;;
+10B72;INSCRIPTIONAL PAHLAVI LETTER TAW;Lo;0;R;;;;;N;;;;;
+10B78;INSCRIPTIONAL PAHLAVI NUMBER ONE;No;0;R;;;;1;N;;;;;
+10B79;INSCRIPTIONAL PAHLAVI NUMBER TWO;No;0;R;;;;2;N;;;;;
+10B7A;INSCRIPTIONAL PAHLAVI NUMBER THREE;No;0;R;;;;3;N;;;;;
+10B7B;INSCRIPTIONAL PAHLAVI NUMBER FOUR;No;0;R;;;;4;N;;;;;
+10B7C;INSCRIPTIONAL PAHLAVI NUMBER TEN;No;0;R;;;;10;N;;;;;
+10B7D;INSCRIPTIONAL PAHLAVI NUMBER TWENTY;No;0;R;;;;20;N;;;;;
+10B7E;INSCRIPTIONAL PAHLAVI NUMBER ONE HUNDRED;No;0;R;;;;100;N;;;;;
+10B7F;INSCRIPTIONAL PAHLAVI NUMBER ONE THOUSAND;No;0;R;;;;1000;N;;;;;
+10B80;PSALTER PAHLAVI LETTER ALEPH;Lo;0;R;;;;;N;;;;;
+10B81;PSALTER PAHLAVI LETTER BETH;Lo;0;R;;;;;N;;;;;
+10B82;PSALTER PAHLAVI LETTER GIMEL;Lo;0;R;;;;;N;;;;;
+10B83;PSALTER PAHLAVI LETTER DALETH;Lo;0;R;;;;;N;;;;;
+10B84;PSALTER PAHLAVI LETTER HE;Lo;0;R;;;;;N;;;;;
+10B85;PSALTER PAHLAVI LETTER WAW-AYIN-RESH;Lo;0;R;;;;;N;;;;;
+10B86;PSALTER PAHLAVI LETTER ZAYIN;Lo;0;R;;;;;N;;;;;
+10B87;PSALTER PAHLAVI LETTER HETH;Lo;0;R;;;;;N;;;;;
+10B88;PSALTER PAHLAVI LETTER YODH;Lo;0;R;;;;;N;;;;;
+10B89;PSALTER PAHLAVI LETTER KAPH;Lo;0;R;;;;;N;;;;;
+10B8A;PSALTER PAHLAVI LETTER LAMEDH;Lo;0;R;;;;;N;;;;;
+10B8B;PSALTER PAHLAVI LETTER MEM-QOPH;Lo;0;R;;;;;N;;;;;
+10B8C;PSALTER PAHLAVI LETTER NUN;Lo;0;R;;;;;N;;;;;
+10B8D;PSALTER PAHLAVI LETTER SAMEKH;Lo;0;R;;;;;N;;;;;
+10B8E;PSALTER PAHLAVI LETTER PE;Lo;0;R;;;;;N;;;;;
+10B8F;PSALTER PAHLAVI LETTER SADHE;Lo;0;R;;;;;N;;;;;
+10B90;PSALTER PAHLAVI LETTER SHIN;Lo;0;R;;;;;N;;;;;
+10B91;PSALTER PAHLAVI LETTER TAW;Lo;0;R;;;;;N;;;;;
+10B99;PSALTER PAHLAVI SECTION MARK;Po;0;R;;;;;N;;;;;
+10B9A;PSALTER PAHLAVI TURNED SECTION MARK;Po;0;R;;;;;N;;;;;
+10B9B;PSALTER PAHLAVI FOUR DOTS WITH CROSS;Po;0;R;;;;;N;;;;;
+10B9C;PSALTER PAHLAVI FOUR DOTS WITH DOT;Po;0;R;;;;;N;;;;;
+10BA9;PSALTER PAHLAVI NUMBER ONE;No;0;R;;;;1;N;;;;;
+10BAA;PSALTER PAHLAVI NUMBER TWO;No;0;R;;;;2;N;;;;;
+10BAB;PSALTER PAHLAVI NUMBER THREE;No;0;R;;;;3;N;;;;;
+10BAC;PSALTER PAHLAVI NUMBER FOUR;No;0;R;;;;4;N;;;;;
+10BAD;PSALTER PAHLAVI NUMBER TEN;No;0;R;;;;10;N;;;;;
+10BAE;PSALTER PAHLAVI NUMBER TWENTY;No;0;R;;;;20;N;;;;;
+10BAF;PSALTER PAHLAVI NUMBER ONE HUNDRED;No;0;R;;;;100;N;;;;;
+10C00;OLD TURKIC LETTER ORKHON A;Lo;0;R;;;;;N;;;;;
+10C01;OLD TURKIC LETTER YENISEI A;Lo;0;R;;;;;N;;;;;
+10C02;OLD TURKIC LETTER YENISEI AE;Lo;0;R;;;;;N;;;;;
+10C03;OLD TURKIC LETTER ORKHON I;Lo;0;R;;;;;N;;;;;
+10C04;OLD TURKIC LETTER YENISEI I;Lo;0;R;;;;;N;;;;;
+10C05;OLD TURKIC LETTER YENISEI E;Lo;0;R;;;;;N;;;;;
+10C06;OLD TURKIC LETTER ORKHON O;Lo;0;R;;;;;N;;;;;
+10C07;OLD TURKIC LETTER ORKHON OE;Lo;0;R;;;;;N;;;;;
+10C08;OLD TURKIC LETTER YENISEI OE;Lo;0;R;;;;;N;;;;;
+10C09;OLD TURKIC LETTER ORKHON AB;Lo;0;R;;;;;N;;;;;
+10C0A;OLD TURKIC LETTER YENISEI AB;Lo;0;R;;;;;N;;;;;
+10C0B;OLD TURKIC LETTER ORKHON AEB;Lo;0;R;;;;;N;;;;;
+10C0C;OLD TURKIC LETTER YENISEI AEB;Lo;0;R;;;;;N;;;;;
+10C0D;OLD TURKIC LETTER ORKHON AG;Lo;0;R;;;;;N;;;;;
+10C0E;OLD TURKIC LETTER YENISEI AG;Lo;0;R;;;;;N;;;;;
+10C0F;OLD TURKIC LETTER ORKHON AEG;Lo;0;R;;;;;N;;;;;
+10C10;OLD TURKIC LETTER YENISEI AEG;Lo;0;R;;;;;N;;;;;
+10C11;OLD TURKIC LETTER ORKHON AD;Lo;0;R;;;;;N;;;;;
+10C12;OLD TURKIC LETTER YENISEI AD;Lo;0;R;;;;;N;;;;;
+10C13;OLD TURKIC LETTER ORKHON AED;Lo;0;R;;;;;N;;;;;
+10C14;OLD TURKIC LETTER ORKHON EZ;Lo;0;R;;;;;N;;;;;
+10C15;OLD TURKIC LETTER YENISEI EZ;Lo;0;R;;;;;N;;;;;
+10C16;OLD TURKIC LETTER ORKHON AY;Lo;0;R;;;;;N;;;;;
+10C17;OLD TURKIC LETTER YENISEI AY;Lo;0;R;;;;;N;;;;;
+10C18;OLD TURKIC LETTER ORKHON AEY;Lo;0;R;;;;;N;;;;;
+10C19;OLD TURKIC LETTER YENISEI AEY;Lo;0;R;;;;;N;;;;;
+10C1A;OLD TURKIC LETTER ORKHON AEK;Lo;0;R;;;;;N;;;;;
+10C1B;OLD TURKIC LETTER YENISEI AEK;Lo;0;R;;;;;N;;;;;
+10C1C;OLD TURKIC LETTER ORKHON OEK;Lo;0;R;;;;;N;;;;;
+10C1D;OLD TURKIC LETTER YENISEI OEK;Lo;0;R;;;;;N;;;;;
+10C1E;OLD TURKIC LETTER ORKHON AL;Lo;0;R;;;;;N;;;;;
+10C1F;OLD TURKIC LETTER YENISEI AL;Lo;0;R;;;;;N;;;;;
+10C20;OLD TURKIC LETTER ORKHON AEL;Lo;0;R;;;;;N;;;;;
+10C21;OLD TURKIC LETTER ORKHON ELT;Lo;0;R;;;;;N;;;;;
+10C22;OLD TURKIC LETTER ORKHON EM;Lo;0;R;;;;;N;;;;;
+10C23;OLD TURKIC LETTER ORKHON AN;Lo;0;R;;;;;N;;;;;
+10C24;OLD TURKIC LETTER ORKHON AEN;Lo;0;R;;;;;N;;;;;
+10C25;OLD TURKIC LETTER YENISEI AEN;Lo;0;R;;;;;N;;;;;
+10C26;OLD TURKIC LETTER ORKHON ENT;Lo;0;R;;;;;N;;;;;
+10C27;OLD TURKIC LETTER YENISEI ENT;Lo;0;R;;;;;N;;;;;
+10C28;OLD TURKIC LETTER ORKHON ENC;Lo;0;R;;;;;N;;;;;
+10C29;OLD TURKIC LETTER YENISEI ENC;Lo;0;R;;;;;N;;;;;
+10C2A;OLD TURKIC LETTER ORKHON ENY;Lo;0;R;;;;;N;;;;;
+10C2B;OLD TURKIC LETTER YENISEI ENY;Lo;0;R;;;;;N;;;;;
+10C2C;OLD TURKIC LETTER YENISEI ANG;Lo;0;R;;;;;N;;;;;
+10C2D;OLD TURKIC LETTER ORKHON ENG;Lo;0;R;;;;;N;;;;;
+10C2E;OLD TURKIC LETTER YENISEI AENG;Lo;0;R;;;;;N;;;;;
+10C2F;OLD TURKIC LETTER ORKHON EP;Lo;0;R;;;;;N;;;;;
+10C30;OLD TURKIC LETTER ORKHON OP;Lo;0;R;;;;;N;;;;;
+10C31;OLD TURKIC LETTER ORKHON IC;Lo;0;R;;;;;N;;;;;
+10C32;OLD TURKIC LETTER ORKHON EC;Lo;0;R;;;;;N;;;;;
+10C33;OLD TURKIC LETTER YENISEI EC;Lo;0;R;;;;;N;;;;;
+10C34;OLD TURKIC LETTER ORKHON AQ;Lo;0;R;;;;;N;;;;;
+10C35;OLD TURKIC LETTER YENISEI AQ;Lo;0;R;;;;;N;;;;;
+10C36;OLD TURKIC LETTER ORKHON IQ;Lo;0;R;;;;;N;;;;;
+10C37;OLD TURKIC LETTER YENISEI IQ;Lo;0;R;;;;;N;;;;;
+10C38;OLD TURKIC LETTER ORKHON OQ;Lo;0;R;;;;;N;;;;;
+10C39;OLD TURKIC LETTER YENISEI OQ;Lo;0;R;;;;;N;;;;;
+10C3A;OLD TURKIC LETTER ORKHON AR;Lo;0;R;;;;;N;;;;;
+10C3B;OLD TURKIC LETTER YENISEI AR;Lo;0;R;;;;;N;;;;;
+10C3C;OLD TURKIC LETTER ORKHON AER;Lo;0;R;;;;;N;;;;;
+10C3D;OLD TURKIC LETTER ORKHON AS;Lo;0;R;;;;;N;;;;;
+10C3E;OLD TURKIC LETTER ORKHON AES;Lo;0;R;;;;;N;;;;;
+10C3F;OLD TURKIC LETTER ORKHON ASH;Lo;0;R;;;;;N;;;;;
+10C40;OLD TURKIC LETTER YENISEI ASH;Lo;0;R;;;;;N;;;;;
+10C41;OLD TURKIC LETTER ORKHON ESH;Lo;0;R;;;;;N;;;;;
+10C42;OLD TURKIC LETTER YENISEI ESH;Lo;0;R;;;;;N;;;;;
+10C43;OLD TURKIC LETTER ORKHON AT;Lo;0;R;;;;;N;;;;;
+10C44;OLD TURKIC LETTER YENISEI AT;Lo;0;R;;;;;N;;;;;
+10C45;OLD TURKIC LETTER ORKHON AET;Lo;0;R;;;;;N;;;;;
+10C46;OLD TURKIC LETTER YENISEI AET;Lo;0;R;;;;;N;;;;;
+10C47;OLD TURKIC LETTER ORKHON OT;Lo;0;R;;;;;N;;;;;
+10C48;OLD TURKIC LETTER ORKHON BASH;Lo;0;R;;;;;N;;;;;
+10C80;OLD HUNGARIAN CAPITAL LETTER A;Lu;0;R;;;;;N;;;;10CC0;
+10C81;OLD HUNGARIAN CAPITAL LETTER AA;Lu;0;R;;;;;N;;;;10CC1;
+10C82;OLD HUNGARIAN CAPITAL LETTER EB;Lu;0;R;;;;;N;;;;10CC2;
+10C83;OLD HUNGARIAN CAPITAL LETTER AMB;Lu;0;R;;;;;N;;;;10CC3;
+10C84;OLD HUNGARIAN CAPITAL LETTER EC;Lu;0;R;;;;;N;;;;10CC4;
+10C85;OLD HUNGARIAN CAPITAL LETTER ENC;Lu;0;R;;;;;N;;;;10CC5;
+10C86;OLD HUNGARIAN CAPITAL LETTER ECS;Lu;0;R;;;;;N;;;;10CC6;
+10C87;OLD HUNGARIAN CAPITAL LETTER ED;Lu;0;R;;;;;N;;;;10CC7;
+10C88;OLD HUNGARIAN CAPITAL LETTER AND;Lu;0;R;;;;;N;;;;10CC8;
+10C89;OLD HUNGARIAN CAPITAL LETTER E;Lu;0;R;;;;;N;;;;10CC9;
+10C8A;OLD HUNGARIAN CAPITAL LETTER CLOSE E;Lu;0;R;;;;;N;;;;10CCA;
+10C8B;OLD HUNGARIAN CAPITAL LETTER EE;Lu;0;R;;;;;N;;;;10CCB;
+10C8C;OLD HUNGARIAN CAPITAL LETTER EF;Lu;0;R;;;;;N;;;;10CCC;
+10C8D;OLD HUNGARIAN CAPITAL LETTER EG;Lu;0;R;;;;;N;;;;10CCD;
+10C8E;OLD HUNGARIAN CAPITAL LETTER EGY;Lu;0;R;;;;;N;;;;10CCE;
+10C8F;OLD HUNGARIAN CAPITAL LETTER EH;Lu;0;R;;;;;N;;;;10CCF;
+10C90;OLD HUNGARIAN CAPITAL LETTER I;Lu;0;R;;;;;N;;;;10CD0;
+10C91;OLD HUNGARIAN CAPITAL LETTER II;Lu;0;R;;;;;N;;;;10CD1;
+10C92;OLD HUNGARIAN CAPITAL LETTER EJ;Lu;0;R;;;;;N;;;;10CD2;
+10C93;OLD HUNGARIAN CAPITAL LETTER EK;Lu;0;R;;;;;N;;;;10CD3;
+10C94;OLD HUNGARIAN CAPITAL LETTER AK;Lu;0;R;;;;;N;;;;10CD4;
+10C95;OLD HUNGARIAN CAPITAL LETTER UNK;Lu;0;R;;;;;N;;;;10CD5;
+10C96;OLD HUNGARIAN CAPITAL LETTER EL;Lu;0;R;;;;;N;;;;10CD6;
+10C97;OLD HUNGARIAN CAPITAL LETTER ELY;Lu;0;R;;;;;N;;;;10CD7;
+10C98;OLD HUNGARIAN CAPITAL LETTER EM;Lu;0;R;;;;;N;;;;10CD8;
+10C99;OLD HUNGARIAN CAPITAL LETTER EN;Lu;0;R;;;;;N;;;;10CD9;
+10C9A;OLD HUNGARIAN CAPITAL LETTER ENY;Lu;0;R;;;;;N;;;;10CDA;
+10C9B;OLD HUNGARIAN CAPITAL LETTER O;Lu;0;R;;;;;N;;;;10CDB;
+10C9C;OLD HUNGARIAN CAPITAL LETTER OO;Lu;0;R;;;;;N;;;;10CDC;
+10C9D;OLD HUNGARIAN CAPITAL LETTER NIKOLSBURG OE;Lu;0;R;;;;;N;;;;10CDD;
+10C9E;OLD HUNGARIAN CAPITAL LETTER RUDIMENTA OE;Lu;0;R;;;;;N;;;;10CDE;
+10C9F;OLD HUNGARIAN CAPITAL LETTER OEE;Lu;0;R;;;;;N;;;;10CDF;
+10CA0;OLD HUNGARIAN CAPITAL LETTER EP;Lu;0;R;;;;;N;;;;10CE0;
+10CA1;OLD HUNGARIAN CAPITAL LETTER EMP;Lu;0;R;;;;;N;;;;10CE1;
+10CA2;OLD HUNGARIAN CAPITAL LETTER ER;Lu;0;R;;;;;N;;;;10CE2;
+10CA3;OLD HUNGARIAN CAPITAL LETTER SHORT ER;Lu;0;R;;;;;N;;;;10CE3;
+10CA4;OLD HUNGARIAN CAPITAL LETTER ES;Lu;0;R;;;;;N;;;;10CE4;
+10CA5;OLD HUNGARIAN CAPITAL LETTER ESZ;Lu;0;R;;;;;N;;;;10CE5;
+10CA6;OLD HUNGARIAN CAPITAL LETTER ET;Lu;0;R;;;;;N;;;;10CE6;
+10CA7;OLD HUNGARIAN CAPITAL LETTER ENT;Lu;0;R;;;;;N;;;;10CE7;
+10CA8;OLD HUNGARIAN CAPITAL LETTER ETY;Lu;0;R;;;;;N;;;;10CE8;
+10CA9;OLD HUNGARIAN CAPITAL LETTER ECH;Lu;0;R;;;;;N;;;;10CE9;
+10CAA;OLD HUNGARIAN CAPITAL LETTER U;Lu;0;R;;;;;N;;;;10CEA;
+10CAB;OLD HUNGARIAN CAPITAL LETTER UU;Lu;0;R;;;;;N;;;;10CEB;
+10CAC;OLD HUNGARIAN CAPITAL LETTER NIKOLSBURG UE;Lu;0;R;;;;;N;;;;10CEC;
+10CAD;OLD HUNGARIAN CAPITAL LETTER RUDIMENTA UE;Lu;0;R;;;;;N;;;;10CED;
+10CAE;OLD HUNGARIAN CAPITAL LETTER EV;Lu;0;R;;;;;N;;;;10CEE;
+10CAF;OLD HUNGARIAN CAPITAL LETTER EZ;Lu;0;R;;;;;N;;;;10CEF;
+10CB0;OLD HUNGARIAN CAPITAL LETTER EZS;Lu;0;R;;;;;N;;;;10CF0;
+10CB1;OLD HUNGARIAN CAPITAL LETTER ENT-SHAPED SIGN;Lu;0;R;;;;;N;;;;10CF1;
+10CB2;OLD HUNGARIAN CAPITAL LETTER US;Lu;0;R;;;;;N;;;;10CF2;
+10CC0;OLD HUNGARIAN SMALL LETTER A;Ll;0;R;;;;;N;;;10C80;;10C80
+10CC1;OLD HUNGARIAN SMALL LETTER AA;Ll;0;R;;;;;N;;;10C81;;10C81
+10CC2;OLD HUNGARIAN SMALL LETTER EB;Ll;0;R;;;;;N;;;10C82;;10C82
+10CC3;OLD HUNGARIAN SMALL LETTER AMB;Ll;0;R;;;;;N;;;10C83;;10C83
+10CC4;OLD HUNGARIAN SMALL LETTER EC;Ll;0;R;;;;;N;;;10C84;;10C84
+10CC5;OLD HUNGARIAN SMALL LETTER ENC;Ll;0;R;;;;;N;;;10C85;;10C85
+10CC6;OLD HUNGARIAN SMALL LETTER ECS;Ll;0;R;;;;;N;;;10C86;;10C86
+10CC7;OLD HUNGARIAN SMALL LETTER ED;Ll;0;R;;;;;N;;;10C87;;10C87
+10CC8;OLD HUNGARIAN SMALL LETTER AND;Ll;0;R;;;;;N;;;10C88;;10C88
+10CC9;OLD HUNGARIAN SMALL LETTER E;Ll;0;R;;;;;N;;;10C89;;10C89
+10CCA;OLD HUNGARIAN SMALL LETTER CLOSE E;Ll;0;R;;;;;N;;;10C8A;;10C8A
+10CCB;OLD HUNGARIAN SMALL LETTER EE;Ll;0;R;;;;;N;;;10C8B;;10C8B
+10CCC;OLD HUNGARIAN SMALL LETTER EF;Ll;0;R;;;;;N;;;10C8C;;10C8C
+10CCD;OLD HUNGARIAN SMALL LETTER EG;Ll;0;R;;;;;N;;;10C8D;;10C8D
+10CCE;OLD HUNGARIAN SMALL LETTER EGY;Ll;0;R;;;;;N;;;10C8E;;10C8E
+10CCF;OLD HUNGARIAN SMALL LETTER EH;Ll;0;R;;;;;N;;;10C8F;;10C8F
+10CD0;OLD HUNGARIAN SMALL LETTER I;Ll;0;R;;;;;N;;;10C90;;10C90
+10CD1;OLD HUNGARIAN SMALL LETTER II;Ll;0;R;;;;;N;;;10C91;;10C91
+10CD2;OLD HUNGARIAN SMALL LETTER EJ;Ll;0;R;;;;;N;;;10C92;;10C92
+10CD3;OLD HUNGARIAN SMALL LETTER EK;Ll;0;R;;;;;N;;;10C93;;10C93
+10CD4;OLD HUNGARIAN SMALL LETTER AK;Ll;0;R;;;;;N;;;10C94;;10C94
+10CD5;OLD HUNGARIAN SMALL LETTER UNK;Ll;0;R;;;;;N;;;10C95;;10C95
+10CD6;OLD HUNGARIAN SMALL LETTER EL;Ll;0;R;;;;;N;;;10C96;;10C96
+10CD7;OLD HUNGARIAN SMALL LETTER ELY;Ll;0;R;;;;;N;;;10C97;;10C97
+10CD8;OLD HUNGARIAN SMALL LETTER EM;Ll;0;R;;;;;N;;;10C98;;10C98
+10CD9;OLD HUNGARIAN SMALL LETTER EN;Ll;0;R;;;;;N;;;10C99;;10C99
+10CDA;OLD HUNGARIAN SMALL LETTER ENY;Ll;0;R;;;;;N;;;10C9A;;10C9A
+10CDB;OLD HUNGARIAN SMALL LETTER O;Ll;0;R;;;;;N;;;10C9B;;10C9B
+10CDC;OLD HUNGARIAN SMALL LETTER OO;Ll;0;R;;;;;N;;;10C9C;;10C9C
+10CDD;OLD HUNGARIAN SMALL LETTER NIKOLSBURG OE;Ll;0;R;;;;;N;;;10C9D;;10C9D
+10CDE;OLD HUNGARIAN SMALL LETTER RUDIMENTA OE;Ll;0;R;;;;;N;;;10C9E;;10C9E
+10CDF;OLD HUNGARIAN SMALL LETTER OEE;Ll;0;R;;;;;N;;;10C9F;;10C9F
+10CE0;OLD HUNGARIAN SMALL LETTER EP;Ll;0;R;;;;;N;;;10CA0;;10CA0
+10CE1;OLD HUNGARIAN SMALL LETTER EMP;Ll;0;R;;;;;N;;;10CA1;;10CA1
+10CE2;OLD HUNGARIAN SMALL LETTER ER;Ll;0;R;;;;;N;;;10CA2;;10CA2
+10CE3;OLD HUNGARIAN SMALL LETTER SHORT ER;Ll;0;R;;;;;N;;;10CA3;;10CA3
+10CE4;OLD HUNGARIAN SMALL LETTER ES;Ll;0;R;;;;;N;;;10CA4;;10CA4
+10CE5;OLD HUNGARIAN SMALL LETTER ESZ;Ll;0;R;;;;;N;;;10CA5;;10CA5
+10CE6;OLD HUNGARIAN SMALL LETTER ET;Ll;0;R;;;;;N;;;10CA6;;10CA6
+10CE7;OLD HUNGARIAN SMALL LETTER ENT;Ll;0;R;;;;;N;;;10CA7;;10CA7
+10CE8;OLD HUNGARIAN SMALL LETTER ETY;Ll;0;R;;;;;N;;;10CA8;;10CA8
+10CE9;OLD HUNGARIAN SMALL LETTER ECH;Ll;0;R;;;;;N;;;10CA9;;10CA9
+10CEA;OLD HUNGARIAN SMALL LETTER U;Ll;0;R;;;;;N;;;10CAA;;10CAA
+10CEB;OLD HUNGARIAN SMALL LETTER UU;Ll;0;R;;;;;N;;;10CAB;;10CAB
+10CEC;OLD HUNGARIAN SMALL LETTER NIKOLSBURG UE;Ll;0;R;;;;;N;;;10CAC;;10CAC
+10CED;OLD HUNGARIAN SMALL LETTER RUDIMENTA UE;Ll;0;R;;;;;N;;;10CAD;;10CAD
+10CEE;OLD HUNGARIAN SMALL LETTER EV;Ll;0;R;;;;;N;;;10CAE;;10CAE
+10CEF;OLD HUNGARIAN SMALL LETTER EZ;Ll;0;R;;;;;N;;;10CAF;;10CAF
+10CF0;OLD HUNGARIAN SMALL LETTER EZS;Ll;0;R;;;;;N;;;10CB0;;10CB0
+10CF1;OLD HUNGARIAN SMALL LETTER ENT-SHAPED SIGN;Ll;0;R;;;;;N;;;10CB1;;10CB1
+10CF2;OLD HUNGARIAN SMALL LETTER US;Ll;0;R;;;;;N;;;10CB2;;10CB2
+10CFA;OLD HUNGARIAN NUMBER ONE;No;0;R;;;;1;N;;;;;
+10CFB;OLD HUNGARIAN NUMBER FIVE;No;0;R;;;;5;N;;;;;
+10CFC;OLD HUNGARIAN NUMBER TEN;No;0;R;;;;10;N;;;;;
+10CFD;OLD HUNGARIAN NUMBER FIFTY;No;0;R;;;;50;N;;;;;
+10CFE;OLD HUNGARIAN NUMBER ONE HUNDRED;No;0;R;;;;100;N;;;;;
+10CFF;OLD HUNGARIAN NUMBER ONE THOUSAND;No;0;R;;;;1000;N;;;;;
+10E60;RUMI DIGIT ONE;No;0;AN;;;1;1;N;;;;;
+10E61;RUMI DIGIT TWO;No;0;AN;;;2;2;N;;;;;
+10E62;RUMI DIGIT THREE;No;0;AN;;;3;3;N;;;;;
+10E63;RUMI DIGIT FOUR;No;0;AN;;;4;4;N;;;;;
+10E64;RUMI DIGIT FIVE;No;0;AN;;;5;5;N;;;;;
+10E65;RUMI DIGIT SIX;No;0;AN;;;6;6;N;;;;;
+10E66;RUMI DIGIT SEVEN;No;0;AN;;;7;7;N;;;;;
+10E67;RUMI DIGIT EIGHT;No;0;AN;;;8;8;N;;;;;
+10E68;RUMI DIGIT NINE;No;0;AN;;;9;9;N;;;;;
+10E69;RUMI NUMBER TEN;No;0;AN;;;;10;N;;;;;
+10E6A;RUMI NUMBER TWENTY;No;0;AN;;;;20;N;;;;;
+10E6B;RUMI NUMBER THIRTY;No;0;AN;;;;30;N;;;;;
+10E6C;RUMI NUMBER FORTY;No;0;AN;;;;40;N;;;;;
+10E6D;RUMI NUMBER FIFTY;No;0;AN;;;;50;N;;;;;
+10E6E;RUMI NUMBER SIXTY;No;0;AN;;;;60;N;;;;;
+10E6F;RUMI NUMBER SEVENTY;No;0;AN;;;;70;N;;;;;
+10E70;RUMI NUMBER EIGHTY;No;0;AN;;;;80;N;;;;;
+10E71;RUMI NUMBER NINETY;No;0;AN;;;;90;N;;;;;
+10E72;RUMI NUMBER ONE HUNDRED;No;0;AN;;;;100;N;;;;;
+10E73;RUMI NUMBER TWO HUNDRED;No;0;AN;;;;200;N;;;;;
+10E74;RUMI NUMBER THREE HUNDRED;No;0;AN;;;;300;N;;;;;
+10E75;RUMI NUMBER FOUR HUNDRED;No;0;AN;;;;400;N;;;;;
+10E76;RUMI NUMBER FIVE HUNDRED;No;0;AN;;;;500;N;;;;;
+10E77;RUMI NUMBER SIX HUNDRED;No;0;AN;;;;600;N;;;;;
+10E78;RUMI NUMBER SEVEN HUNDRED;No;0;AN;;;;700;N;;;;;
+10E79;RUMI NUMBER EIGHT HUNDRED;No;0;AN;;;;800;N;;;;;
+10E7A;RUMI NUMBER NINE HUNDRED;No;0;AN;;;;900;N;;;;;
+10E7B;RUMI FRACTION ONE HALF;No;0;AN;;;;1/2;N;;;;;
+10E7C;RUMI FRACTION ONE QUARTER;No;0;AN;;;;1/4;N;;;;;
+10E7D;RUMI FRACTION ONE THIRD;No;0;AN;;;;1/3;N;;;;;
+10E7E;RUMI FRACTION TWO THIRDS;No;0;AN;;;;2/3;N;;;;;
+11000;BRAHMI SIGN CANDRABINDU;Mc;0;L;;;;;N;;;;;
+11001;BRAHMI SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+11002;BRAHMI SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+11003;BRAHMI SIGN JIHVAMULIYA;Lo;0;L;;;;;N;;;;;
+11004;BRAHMI SIGN UPADHMANIYA;Lo;0;L;;;;;N;;;;;
+11005;BRAHMI LETTER A;Lo;0;L;;;;;N;;;;;
+11006;BRAHMI LETTER AA;Lo;0;L;;;;;N;;;;;
+11007;BRAHMI LETTER I;Lo;0;L;;;;;N;;;;;
+11008;BRAHMI LETTER II;Lo;0;L;;;;;N;;;;;
+11009;BRAHMI LETTER U;Lo;0;L;;;;;N;;;;;
+1100A;BRAHMI LETTER UU;Lo;0;L;;;;;N;;;;;
+1100B;BRAHMI LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+1100C;BRAHMI LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+1100D;BRAHMI LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+1100E;BRAHMI LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+1100F;BRAHMI LETTER E;Lo;0;L;;;;;N;;;;;
+11010;BRAHMI LETTER AI;Lo;0;L;;;;;N;;;;;
+11011;BRAHMI LETTER O;Lo;0;L;;;;;N;;;;;
+11012;BRAHMI LETTER AU;Lo;0;L;;;;;N;;;;;
+11013;BRAHMI LETTER KA;Lo;0;L;;;;;N;;;;;
+11014;BRAHMI LETTER KHA;Lo;0;L;;;;;N;;;;;
+11015;BRAHMI LETTER GA;Lo;0;L;;;;;N;;;;;
+11016;BRAHMI LETTER GHA;Lo;0;L;;;;;N;;;;;
+11017;BRAHMI LETTER NGA;Lo;0;L;;;;;N;;;;;
+11018;BRAHMI LETTER CA;Lo;0;L;;;;;N;;;;;
+11019;BRAHMI LETTER CHA;Lo;0;L;;;;;N;;;;;
+1101A;BRAHMI LETTER JA;Lo;0;L;;;;;N;;;;;
+1101B;BRAHMI LETTER JHA;Lo;0;L;;;;;N;;;;;
+1101C;BRAHMI LETTER NYA;Lo;0;L;;;;;N;;;;;
+1101D;BRAHMI LETTER TTA;Lo;0;L;;;;;N;;;;;
+1101E;BRAHMI LETTER TTHA;Lo;0;L;;;;;N;;;;;
+1101F;BRAHMI LETTER DDA;Lo;0;L;;;;;N;;;;;
+11020;BRAHMI LETTER DDHA;Lo;0;L;;;;;N;;;;;
+11021;BRAHMI LETTER NNA;Lo;0;L;;;;;N;;;;;
+11022;BRAHMI LETTER TA;Lo;0;L;;;;;N;;;;;
+11023;BRAHMI LETTER THA;Lo;0;L;;;;;N;;;;;
+11024;BRAHMI LETTER DA;Lo;0;L;;;;;N;;;;;
+11025;BRAHMI LETTER DHA;Lo;0;L;;;;;N;;;;;
+11026;BRAHMI LETTER NA;Lo;0;L;;;;;N;;;;;
+11027;BRAHMI LETTER PA;Lo;0;L;;;;;N;;;;;
+11028;BRAHMI LETTER PHA;Lo;0;L;;;;;N;;;;;
+11029;BRAHMI LETTER BA;Lo;0;L;;;;;N;;;;;
+1102A;BRAHMI LETTER BHA;Lo;0;L;;;;;N;;;;;
+1102B;BRAHMI LETTER MA;Lo;0;L;;;;;N;;;;;
+1102C;BRAHMI LETTER YA;Lo;0;L;;;;;N;;;;;
+1102D;BRAHMI LETTER RA;Lo;0;L;;;;;N;;;;;
+1102E;BRAHMI LETTER LA;Lo;0;L;;;;;N;;;;;
+1102F;BRAHMI LETTER VA;Lo;0;L;;;;;N;;;;;
+11030;BRAHMI LETTER SHA;Lo;0;L;;;;;N;;;;;
+11031;BRAHMI LETTER SSA;Lo;0;L;;;;;N;;;;;
+11032;BRAHMI LETTER SA;Lo;0;L;;;;;N;;;;;
+11033;BRAHMI LETTER HA;Lo;0;L;;;;;N;;;;;
+11034;BRAHMI LETTER LLA;Lo;0;L;;;;;N;;;;;
+11035;BRAHMI LETTER OLD TAMIL LLLA;Lo;0;L;;;;;N;;;;;
+11036;BRAHMI LETTER OLD TAMIL RRA;Lo;0;L;;;;;N;;;;;
+11037;BRAHMI LETTER OLD TAMIL NNNA;Lo;0;L;;;;;N;;;;;
+11038;BRAHMI VOWEL SIGN AA;Mn;0;NSM;;;;;N;;;;;
+11039;BRAHMI VOWEL SIGN BHATTIPROLU AA;Mn;0;NSM;;;;;N;;;;;
+1103A;BRAHMI VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+1103B;BRAHMI VOWEL SIGN II;Mn;0;NSM;;;;;N;;;;;
+1103C;BRAHMI VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+1103D;BRAHMI VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+1103E;BRAHMI VOWEL SIGN VOCALIC R;Mn;0;NSM;;;;;N;;;;;
+1103F;BRAHMI VOWEL SIGN VOCALIC RR;Mn;0;NSM;;;;;N;;;;;
+11040;BRAHMI VOWEL SIGN VOCALIC L;Mn;0;NSM;;;;;N;;;;;
+11041;BRAHMI VOWEL SIGN VOCALIC LL;Mn;0;NSM;;;;;N;;;;;
+11042;BRAHMI VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+11043;BRAHMI VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+11044;BRAHMI VOWEL SIGN O;Mn;0;NSM;;;;;N;;;;;
+11045;BRAHMI VOWEL SIGN AU;Mn;0;NSM;;;;;N;;;;;
+11046;BRAHMI VIRAMA;Mn;9;NSM;;;;;N;;;;;
+11047;BRAHMI DANDA;Po;0;L;;;;;N;;;;;
+11048;BRAHMI DOUBLE DANDA;Po;0;L;;;;;N;;;;;
+11049;BRAHMI PUNCTUATION DOT;Po;0;L;;;;;N;;;;;
+1104A;BRAHMI PUNCTUATION DOUBLE DOT;Po;0;L;;;;;N;;;;;
+1104B;BRAHMI PUNCTUATION LINE;Po;0;L;;;;;N;;;;;
+1104C;BRAHMI PUNCTUATION CRESCENT BAR;Po;0;L;;;;;N;;;;;
+1104D;BRAHMI PUNCTUATION LOTUS;Po;0;L;;;;;N;;;;;
+11052;BRAHMI NUMBER ONE;No;0;ON;;;1;1;N;;;;;
+11053;BRAHMI NUMBER TWO;No;0;ON;;;2;2;N;;;;;
+11054;BRAHMI NUMBER THREE;No;0;ON;;;3;3;N;;;;;
+11055;BRAHMI NUMBER FOUR;No;0;ON;;;4;4;N;;;;;
+11056;BRAHMI NUMBER FIVE;No;0;ON;;;5;5;N;;;;;
+11057;BRAHMI NUMBER SIX;No;0;ON;;;6;6;N;;;;;
+11058;BRAHMI NUMBER SEVEN;No;0;ON;;;7;7;N;;;;;
+11059;BRAHMI NUMBER EIGHT;No;0;ON;;;8;8;N;;;;;
+1105A;BRAHMI NUMBER NINE;No;0;ON;;;9;9;N;;;;;
+1105B;BRAHMI NUMBER TEN;No;0;ON;;;;10;N;;;;;
+1105C;BRAHMI NUMBER TWENTY;No;0;ON;;;;20;N;;;;;
+1105D;BRAHMI NUMBER THIRTY;No;0;ON;;;;30;N;;;;;
+1105E;BRAHMI NUMBER FORTY;No;0;ON;;;;40;N;;;;;
+1105F;BRAHMI NUMBER FIFTY;No;0;ON;;;;50;N;;;;;
+11060;BRAHMI NUMBER SIXTY;No;0;ON;;;;60;N;;;;;
+11061;BRAHMI NUMBER SEVENTY;No;0;ON;;;;70;N;;;;;
+11062;BRAHMI NUMBER EIGHTY;No;0;ON;;;;80;N;;;;;
+11063;BRAHMI NUMBER NINETY;No;0;ON;;;;90;N;;;;;
+11064;BRAHMI NUMBER ONE HUNDRED;No;0;ON;;;;100;N;;;;;
+11065;BRAHMI NUMBER ONE THOUSAND;No;0;ON;;;;1000;N;;;;;
+11066;BRAHMI DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+11067;BRAHMI DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+11068;BRAHMI DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+11069;BRAHMI DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+1106A;BRAHMI DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+1106B;BRAHMI DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+1106C;BRAHMI DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+1106D;BRAHMI DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+1106E;BRAHMI DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+1106F;BRAHMI DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+1107F;BRAHMI NUMBER JOINER;Mn;9;NSM;;;;;N;;;;;
+11080;KAITHI SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+11081;KAITHI SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+11082;KAITHI SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+11083;KAITHI LETTER A;Lo;0;L;;;;;N;;;;;
+11084;KAITHI LETTER AA;Lo;0;L;;;;;N;;;;;
+11085;KAITHI LETTER I;Lo;0;L;;;;;N;;;;;
+11086;KAITHI LETTER II;Lo;0;L;;;;;N;;;;;
+11087;KAITHI LETTER U;Lo;0;L;;;;;N;;;;;
+11088;KAITHI LETTER UU;Lo;0;L;;;;;N;;;;;
+11089;KAITHI LETTER E;Lo;0;L;;;;;N;;;;;
+1108A;KAITHI LETTER AI;Lo;0;L;;;;;N;;;;;
+1108B;KAITHI LETTER O;Lo;0;L;;;;;N;;;;;
+1108C;KAITHI LETTER AU;Lo;0;L;;;;;N;;;;;
+1108D;KAITHI LETTER KA;Lo;0;L;;;;;N;;;;;
+1108E;KAITHI LETTER KHA;Lo;0;L;;;;;N;;;;;
+1108F;KAITHI LETTER GA;Lo;0;L;;;;;N;;;;;
+11090;KAITHI LETTER GHA;Lo;0;L;;;;;N;;;;;
+11091;KAITHI LETTER NGA;Lo;0;L;;;;;N;;;;;
+11092;KAITHI LETTER CA;Lo;0;L;;;;;N;;;;;
+11093;KAITHI LETTER CHA;Lo;0;L;;;;;N;;;;;
+11094;KAITHI LETTER JA;Lo;0;L;;;;;N;;;;;
+11095;KAITHI LETTER JHA;Lo;0;L;;;;;N;;;;;
+11096;KAITHI LETTER NYA;Lo;0;L;;;;;N;;;;;
+11097;KAITHI LETTER TTA;Lo;0;L;;;;;N;;;;;
+11098;KAITHI LETTER TTHA;Lo;0;L;;;;;N;;;;;
+11099;KAITHI LETTER DDA;Lo;0;L;;;;;N;;;;;
+1109A;KAITHI LETTER DDDHA;Lo;0;L;11099 110BA;;;;N;;;;;
+1109B;KAITHI LETTER DDHA;Lo;0;L;;;;;N;;;;;
+1109C;KAITHI LETTER RHA;Lo;0;L;1109B 110BA;;;;N;;;;;
+1109D;KAITHI LETTER NNA;Lo;0;L;;;;;N;;;;;
+1109E;KAITHI LETTER TA;Lo;0;L;;;;;N;;;;;
+1109F;KAITHI LETTER THA;Lo;0;L;;;;;N;;;;;
+110A0;KAITHI LETTER DA;Lo;0;L;;;;;N;;;;;
+110A1;KAITHI LETTER DHA;Lo;0;L;;;;;N;;;;;
+110A2;KAITHI LETTER NA;Lo;0;L;;;;;N;;;;;
+110A3;KAITHI LETTER PA;Lo;0;L;;;;;N;;;;;
+110A4;KAITHI LETTER PHA;Lo;0;L;;;;;N;;;;;
+110A5;KAITHI LETTER BA;Lo;0;L;;;;;N;;;;;
+110A6;KAITHI LETTER BHA;Lo;0;L;;;;;N;;;;;
+110A7;KAITHI LETTER MA;Lo;0;L;;;;;N;;;;;
+110A8;KAITHI LETTER YA;Lo;0;L;;;;;N;;;;;
+110A9;KAITHI LETTER RA;Lo;0;L;;;;;N;;;;;
+110AA;KAITHI LETTER LA;Lo;0;L;;;;;N;;;;;
+110AB;KAITHI LETTER VA;Lo;0;L;110A5 110BA;;;;N;;;;;
+110AC;KAITHI LETTER SHA;Lo;0;L;;;;;N;;;;;
+110AD;KAITHI LETTER SSA;Lo;0;L;;;;;N;;;;;
+110AE;KAITHI LETTER SA;Lo;0;L;;;;;N;;;;;
+110AF;KAITHI LETTER HA;Lo;0;L;;;;;N;;;;;
+110B0;KAITHI VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+110B1;KAITHI VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+110B2;KAITHI VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+110B3;KAITHI VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+110B4;KAITHI VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+110B5;KAITHI VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+110B6;KAITHI VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+110B7;KAITHI VOWEL SIGN O;Mc;0;L;;;;;N;;;;;
+110B8;KAITHI VOWEL SIGN AU;Mc;0;L;;;;;N;;;;;
+110B9;KAITHI SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+110BA;KAITHI SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+110BB;KAITHI ABBREVIATION SIGN;Po;0;L;;;;;N;;;;;
+110BC;KAITHI ENUMERATION SIGN;Po;0;L;;;;;N;;;;;
+110BD;KAITHI NUMBER SIGN;Cf;0;L;;;;;N;;;;;
+110BE;KAITHI SECTION MARK;Po;0;L;;;;;N;;;;;
+110BF;KAITHI DOUBLE SECTION MARK;Po;0;L;;;;;N;;;;;
+110C0;KAITHI DANDA;Po;0;L;;;;;N;;;;;
+110C1;KAITHI DOUBLE DANDA;Po;0;L;;;;;N;;;;;
+110D0;SORA SOMPENG LETTER SAH;Lo;0;L;;;;;N;;;;;
+110D1;SORA SOMPENG LETTER TAH;Lo;0;L;;;;;N;;;;;
+110D2;SORA SOMPENG LETTER BAH;Lo;0;L;;;;;N;;;;;
+110D3;SORA SOMPENG LETTER CAH;Lo;0;L;;;;;N;;;;;
+110D4;SORA SOMPENG LETTER DAH;Lo;0;L;;;;;N;;;;;
+110D5;SORA SOMPENG LETTER GAH;Lo;0;L;;;;;N;;;;;
+110D6;SORA SOMPENG LETTER MAH;Lo;0;L;;;;;N;;;;;
+110D7;SORA SOMPENG LETTER NGAH;Lo;0;L;;;;;N;;;;;
+110D8;SORA SOMPENG LETTER LAH;Lo;0;L;;;;;N;;;;;
+110D9;SORA SOMPENG LETTER NAH;Lo;0;L;;;;;N;;;;;
+110DA;SORA SOMPENG LETTER VAH;Lo;0;L;;;;;N;;;;;
+110DB;SORA SOMPENG LETTER PAH;Lo;0;L;;;;;N;;;;;
+110DC;SORA SOMPENG LETTER YAH;Lo;0;L;;;;;N;;;;;
+110DD;SORA SOMPENG LETTER RAH;Lo;0;L;;;;;N;;;;;
+110DE;SORA SOMPENG LETTER HAH;Lo;0;L;;;;;N;;;;;
+110DF;SORA SOMPENG LETTER KAH;Lo;0;L;;;;;N;;;;;
+110E0;SORA SOMPENG LETTER JAH;Lo;0;L;;;;;N;;;;;
+110E1;SORA SOMPENG LETTER NYAH;Lo;0;L;;;;;N;;;;;
+110E2;SORA SOMPENG LETTER AH;Lo;0;L;;;;;N;;;;;
+110E3;SORA SOMPENG LETTER EEH;Lo;0;L;;;;;N;;;;;
+110E4;SORA SOMPENG LETTER IH;Lo;0;L;;;;;N;;;;;
+110E5;SORA SOMPENG LETTER UH;Lo;0;L;;;;;N;;;;;
+110E6;SORA SOMPENG LETTER OH;Lo;0;L;;;;;N;;;;;
+110E7;SORA SOMPENG LETTER EH;Lo;0;L;;;;;N;;;;;
+110E8;SORA SOMPENG LETTER MAE;Lo;0;L;;;;;N;;;;;
+110F0;SORA SOMPENG DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+110F1;SORA SOMPENG DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+110F2;SORA SOMPENG DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+110F3;SORA SOMPENG DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+110F4;SORA SOMPENG DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+110F5;SORA SOMPENG DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+110F6;SORA SOMPENG DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+110F7;SORA SOMPENG DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+110F8;SORA SOMPENG DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+110F9;SORA SOMPENG DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+11100;CHAKMA SIGN CANDRABINDU;Mn;230;NSM;;;;;N;;;;;
+11101;CHAKMA SIGN ANUSVARA;Mn;230;NSM;;;;;N;;;;;
+11102;CHAKMA SIGN VISARGA;Mn;230;NSM;;;;;N;;;;;
+11103;CHAKMA LETTER AA;Lo;0;L;;;;;N;;;;;
+11104;CHAKMA LETTER I;Lo;0;L;;;;;N;;;;;
+11105;CHAKMA LETTER U;Lo;0;L;;;;;N;;;;;
+11106;CHAKMA LETTER E;Lo;0;L;;;;;N;;;;;
+11107;CHAKMA LETTER KAA;Lo;0;L;;;;;N;;;;;
+11108;CHAKMA LETTER KHAA;Lo;0;L;;;;;N;;;;;
+11109;CHAKMA LETTER GAA;Lo;0;L;;;;;N;;;;;
+1110A;CHAKMA LETTER GHAA;Lo;0;L;;;;;N;;;;;
+1110B;CHAKMA LETTER NGAA;Lo;0;L;;;;;N;;;;;
+1110C;CHAKMA LETTER CAA;Lo;0;L;;;;;N;;;;;
+1110D;CHAKMA LETTER CHAA;Lo;0;L;;;;;N;;;;;
+1110E;CHAKMA LETTER JAA;Lo;0;L;;;;;N;;;;;
+1110F;CHAKMA LETTER JHAA;Lo;0;L;;;;;N;;;;;
+11110;CHAKMA LETTER NYAA;Lo;0;L;;;;;N;;;;;
+11111;CHAKMA LETTER TTAA;Lo;0;L;;;;;N;;;;;
+11112;CHAKMA LETTER TTHAA;Lo;0;L;;;;;N;;;;;
+11113;CHAKMA LETTER DDAA;Lo;0;L;;;;;N;;;;;
+11114;CHAKMA LETTER DDHAA;Lo;0;L;;;;;N;;;;;
+11115;CHAKMA LETTER NNAA;Lo;0;L;;;;;N;;;;;
+11116;CHAKMA LETTER TAA;Lo;0;L;;;;;N;;;;;
+11117;CHAKMA LETTER THAA;Lo;0;L;;;;;N;;;;;
+11118;CHAKMA LETTER DAA;Lo;0;L;;;;;N;;;;;
+11119;CHAKMA LETTER DHAA;Lo;0;L;;;;;N;;;;;
+1111A;CHAKMA LETTER NAA;Lo;0;L;;;;;N;;;;;
+1111B;CHAKMA LETTER PAA;Lo;0;L;;;;;N;;;;;
+1111C;CHAKMA LETTER PHAA;Lo;0;L;;;;;N;;;;;
+1111D;CHAKMA LETTER BAA;Lo;0;L;;;;;N;;;;;
+1111E;CHAKMA LETTER BHAA;Lo;0;L;;;;;N;;;;;
+1111F;CHAKMA LETTER MAA;Lo;0;L;;;;;N;;;;;
+11120;CHAKMA LETTER YYAA;Lo;0;L;;;;;N;;;;;
+11121;CHAKMA LETTER YAA;Lo;0;L;;;;;N;;;;;
+11122;CHAKMA LETTER RAA;Lo;0;L;;;;;N;;;;;
+11123;CHAKMA LETTER LAA;Lo;0;L;;;;;N;;;;;
+11124;CHAKMA LETTER WAA;Lo;0;L;;;;;N;;;;;
+11125;CHAKMA LETTER SAA;Lo;0;L;;;;;N;;;;;
+11126;CHAKMA LETTER HAA;Lo;0;L;;;;;N;;;;;
+11127;CHAKMA VOWEL SIGN A;Mn;0;NSM;;;;;N;;;;;
+11128;CHAKMA VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+11129;CHAKMA VOWEL SIGN II;Mn;0;NSM;;;;;N;;;;;
+1112A;CHAKMA VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+1112B;CHAKMA VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+1112C;CHAKMA VOWEL SIGN E;Mc;0;L;;;;;N;;;;;
+1112D;CHAKMA VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+1112E;CHAKMA VOWEL SIGN O;Mn;0;NSM;11131 11127;;;;N;;;;;
+1112F;CHAKMA VOWEL SIGN AU;Mn;0;NSM;11132 11127;;;;N;;;;;
+11130;CHAKMA VOWEL SIGN OI;Mn;0;NSM;;;;;N;;;;;
+11131;CHAKMA O MARK;Mn;0;NSM;;;;;N;;;;;
+11132;CHAKMA AU MARK;Mn;0;NSM;;;;;N;;;;;
+11133;CHAKMA VIRAMA;Mn;9;NSM;;;;;N;;;;;
+11134;CHAKMA MAAYYAA;Mn;9;NSM;;;;;N;;;;;
+11136;CHAKMA DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+11137;CHAKMA DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+11138;CHAKMA DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+11139;CHAKMA DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+1113A;CHAKMA DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+1113B;CHAKMA DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+1113C;CHAKMA DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+1113D;CHAKMA DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+1113E;CHAKMA DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+1113F;CHAKMA DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+11140;CHAKMA SECTION MARK;Po;0;L;;;;;N;;;;;
+11141;CHAKMA DANDA;Po;0;L;;;;;N;;;;;
+11142;CHAKMA DOUBLE DANDA;Po;0;L;;;;;N;;;;;
+11143;CHAKMA QUESTION MARK;Po;0;L;;;;;N;;;;;
+11150;MAHAJANI LETTER A;Lo;0;L;;;;;N;;;;;
+11151;MAHAJANI LETTER I;Lo;0;L;;;;;N;;;;;
+11152;MAHAJANI LETTER U;Lo;0;L;;;;;N;;;;;
+11153;MAHAJANI LETTER E;Lo;0;L;;;;;N;;;;;
+11154;MAHAJANI LETTER O;Lo;0;L;;;;;N;;;;;
+11155;MAHAJANI LETTER KA;Lo;0;L;;;;;N;;;;;
+11156;MAHAJANI LETTER KHA;Lo;0;L;;;;;N;;;;;
+11157;MAHAJANI LETTER GA;Lo;0;L;;;;;N;;;;;
+11158;MAHAJANI LETTER GHA;Lo;0;L;;;;;N;;;;;
+11159;MAHAJANI LETTER CA;Lo;0;L;;;;;N;;;;;
+1115A;MAHAJANI LETTER CHA;Lo;0;L;;;;;N;;;;;
+1115B;MAHAJANI LETTER JA;Lo;0;L;;;;;N;;;;;
+1115C;MAHAJANI LETTER JHA;Lo;0;L;;;;;N;;;;;
+1115D;MAHAJANI LETTER NYA;Lo;0;L;;;;;N;;;;;
+1115E;MAHAJANI LETTER TTA;Lo;0;L;;;;;N;;;;;
+1115F;MAHAJANI LETTER TTHA;Lo;0;L;;;;;N;;;;;
+11160;MAHAJANI LETTER DDA;Lo;0;L;;;;;N;;;;;
+11161;MAHAJANI LETTER DDHA;Lo;0;L;;;;;N;;;;;
+11162;MAHAJANI LETTER NNA;Lo;0;L;;;;;N;;;;;
+11163;MAHAJANI LETTER TA;Lo;0;L;;;;;N;;;;;
+11164;MAHAJANI LETTER THA;Lo;0;L;;;;;N;;;;;
+11165;MAHAJANI LETTER DA;Lo;0;L;;;;;N;;;;;
+11166;MAHAJANI LETTER DHA;Lo;0;L;;;;;N;;;;;
+11167;MAHAJANI LETTER NA;Lo;0;L;;;;;N;;;;;
+11168;MAHAJANI LETTER PA;Lo;0;L;;;;;N;;;;;
+11169;MAHAJANI LETTER PHA;Lo;0;L;;;;;N;;;;;
+1116A;MAHAJANI LETTER BA;Lo;0;L;;;;;N;;;;;
+1116B;MAHAJANI LETTER BHA;Lo;0;L;;;;;N;;;;;
+1116C;MAHAJANI LETTER MA;Lo;0;L;;;;;N;;;;;
+1116D;MAHAJANI LETTER RA;Lo;0;L;;;;;N;;;;;
+1116E;MAHAJANI LETTER LA;Lo;0;L;;;;;N;;;;;
+1116F;MAHAJANI LETTER VA;Lo;0;L;;;;;N;;;;;
+11170;MAHAJANI LETTER SA;Lo;0;L;;;;;N;;;;;
+11171;MAHAJANI LETTER HA;Lo;0;L;;;;;N;;;;;
+11172;MAHAJANI LETTER RRA;Lo;0;L;;;;;N;;;;;
+11173;MAHAJANI SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+11174;MAHAJANI ABBREVIATION SIGN;Po;0;L;;;;;N;;;;;
+11175;MAHAJANI SECTION MARK;Po;0;L;;;;;N;;;;;
+11176;MAHAJANI LIGATURE SHRI;Lo;0;L;;;;;N;;;;;
+11180;SHARADA SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+11181;SHARADA SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+11182;SHARADA SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+11183;SHARADA LETTER A;Lo;0;L;;;;;N;;;;;
+11184;SHARADA LETTER AA;Lo;0;L;;;;;N;;;;;
+11185;SHARADA LETTER I;Lo;0;L;;;;;N;;;;;
+11186;SHARADA LETTER II;Lo;0;L;;;;;N;;;;;
+11187;SHARADA LETTER U;Lo;0;L;;;;;N;;;;;
+11188;SHARADA LETTER UU;Lo;0;L;;;;;N;;;;;
+11189;SHARADA LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+1118A;SHARADA LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+1118B;SHARADA LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+1118C;SHARADA LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+1118D;SHARADA LETTER E;Lo;0;L;;;;;N;;;;;
+1118E;SHARADA LETTER AI;Lo;0;L;;;;;N;;;;;
+1118F;SHARADA LETTER O;Lo;0;L;;;;;N;;;;;
+11190;SHARADA LETTER AU;Lo;0;L;;;;;N;;;;;
+11191;SHARADA LETTER KA;Lo;0;L;;;;;N;;;;;
+11192;SHARADA LETTER KHA;Lo;0;L;;;;;N;;;;;
+11193;SHARADA LETTER GA;Lo;0;L;;;;;N;;;;;
+11194;SHARADA LETTER GHA;Lo;0;L;;;;;N;;;;;
+11195;SHARADA LETTER NGA;Lo;0;L;;;;;N;;;;;
+11196;SHARADA LETTER CA;Lo;0;L;;;;;N;;;;;
+11197;SHARADA LETTER CHA;Lo;0;L;;;;;N;;;;;
+11198;SHARADA LETTER JA;Lo;0;L;;;;;N;;;;;
+11199;SHARADA LETTER JHA;Lo;0;L;;;;;N;;;;;
+1119A;SHARADA LETTER NYA;Lo;0;L;;;;;N;;;;;
+1119B;SHARADA LETTER TTA;Lo;0;L;;;;;N;;;;;
+1119C;SHARADA LETTER TTHA;Lo;0;L;;;;;N;;;;;
+1119D;SHARADA LETTER DDA;Lo;0;L;;;;;N;;;;;
+1119E;SHARADA LETTER DDHA;Lo;0;L;;;;;N;;;;;
+1119F;SHARADA LETTER NNA;Lo;0;L;;;;;N;;;;;
+111A0;SHARADA LETTER TA;Lo;0;L;;;;;N;;;;;
+111A1;SHARADA LETTER THA;Lo;0;L;;;;;N;;;;;
+111A2;SHARADA LETTER DA;Lo;0;L;;;;;N;;;;;
+111A3;SHARADA LETTER DHA;Lo;0;L;;;;;N;;;;;
+111A4;SHARADA LETTER NA;Lo;0;L;;;;;N;;;;;
+111A5;SHARADA LETTER PA;Lo;0;L;;;;;N;;;;;
+111A6;SHARADA LETTER PHA;Lo;0;L;;;;;N;;;;;
+111A7;SHARADA LETTER BA;Lo;0;L;;;;;N;;;;;
+111A8;SHARADA LETTER BHA;Lo;0;L;;;;;N;;;;;
+111A9;SHARADA LETTER MA;Lo;0;L;;;;;N;;;;;
+111AA;SHARADA LETTER YA;Lo;0;L;;;;;N;;;;;
+111AB;SHARADA LETTER RA;Lo;0;L;;;;;N;;;;;
+111AC;SHARADA LETTER LA;Lo;0;L;;;;;N;;;;;
+111AD;SHARADA LETTER LLA;Lo;0;L;;;;;N;;;;;
+111AE;SHARADA LETTER VA;Lo;0;L;;;;;N;;;;;
+111AF;SHARADA LETTER SHA;Lo;0;L;;;;;N;;;;;
+111B0;SHARADA LETTER SSA;Lo;0;L;;;;;N;;;;;
+111B1;SHARADA LETTER SA;Lo;0;L;;;;;N;;;;;
+111B2;SHARADA LETTER HA;Lo;0;L;;;;;N;;;;;
+111B3;SHARADA VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+111B4;SHARADA VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+111B5;SHARADA VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+111B6;SHARADA VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+111B7;SHARADA VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+111B8;SHARADA VOWEL SIGN VOCALIC R;Mn;0;NSM;;;;;N;;;;;
+111B9;SHARADA VOWEL SIGN VOCALIC RR;Mn;0;NSM;;;;;N;;;;;
+111BA;SHARADA VOWEL SIGN VOCALIC L;Mn;0;NSM;;;;;N;;;;;
+111BB;SHARADA VOWEL SIGN VOCALIC LL;Mn;0;NSM;;;;;N;;;;;
+111BC;SHARADA VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+111BD;SHARADA VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+111BE;SHARADA VOWEL SIGN O;Mn;0;NSM;;;;;N;;;;;
+111BF;SHARADA VOWEL SIGN AU;Mc;0;L;;;;;N;;;;;
+111C0;SHARADA SIGN VIRAMA;Mc;9;L;;;;;N;;;;;
+111C1;SHARADA SIGN AVAGRAHA;Lo;0;L;;;;;N;;;;;
+111C2;SHARADA SIGN JIHVAMULIYA;Lo;0;L;;;;;N;;;;;
+111C3;SHARADA SIGN UPADHMANIYA;Lo;0;L;;;;;N;;;;;
+111C4;SHARADA OM;Lo;0;L;;;;;N;;;;;
+111C5;SHARADA DANDA;Po;0;L;;;;;N;;;;;
+111C6;SHARADA DOUBLE DANDA;Po;0;L;;;;;N;;;;;
+111C7;SHARADA ABBREVIATION SIGN;Po;0;L;;;;;N;;;;;
+111C8;SHARADA SEPARATOR;Po;0;L;;;;;N;;;;;
+111C9;SHARADA SANDHI MARK;Po;0;L;;;;;N;;;;;
+111CA;SHARADA SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+111CB;SHARADA VOWEL MODIFIER MARK;Mn;0;NSM;;;;;N;;;;;
+111CC;SHARADA EXTRA SHORT VOWEL MARK;Mn;0;NSM;;;;;N;;;;;
+111CD;SHARADA SUTRA MARK;Po;0;L;;;;;N;;;;;
+111D0;SHARADA DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+111D1;SHARADA DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+111D2;SHARADA DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+111D3;SHARADA DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+111D4;SHARADA DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+111D5;SHARADA DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+111D6;SHARADA DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+111D7;SHARADA DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+111D8;SHARADA DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+111D9;SHARADA DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+111DA;SHARADA EKAM;Lo;0;L;;;;;N;;;;;
+111DB;SHARADA SIGN SIDDHAM;Po;0;L;;;;;N;;;;;
+111DC;SHARADA HEADSTROKE;Lo;0;L;;;;;N;;;;;
+111DD;SHARADA CONTINUATION SIGN;Po;0;L;;;;;N;;;;;
+111DE;SHARADA SECTION MARK-1;Po;0;L;;;;;N;;;;;
+111DF;SHARADA SECTION MARK-2;Po;0;L;;;;;N;;;;;
+111E1;SINHALA ARCHAIC DIGIT ONE;No;0;L;;;;1;N;;;;;
+111E2;SINHALA ARCHAIC DIGIT TWO;No;0;L;;;;2;N;;;;;
+111E3;SINHALA ARCHAIC DIGIT THREE;No;0;L;;;;3;N;;;;;
+111E4;SINHALA ARCHAIC DIGIT FOUR;No;0;L;;;;4;N;;;;;
+111E5;SINHALA ARCHAIC DIGIT FIVE;No;0;L;;;;5;N;;;;;
+111E6;SINHALA ARCHAIC DIGIT SIX;No;0;L;;;;6;N;;;;;
+111E7;SINHALA ARCHAIC DIGIT SEVEN;No;0;L;;;;7;N;;;;;
+111E8;SINHALA ARCHAIC DIGIT EIGHT;No;0;L;;;;8;N;;;;;
+111E9;SINHALA ARCHAIC DIGIT NINE;No;0;L;;;;9;N;;;;;
+111EA;SINHALA ARCHAIC NUMBER TEN;No;0;L;;;;10;N;;;;;
+111EB;SINHALA ARCHAIC NUMBER TWENTY;No;0;L;;;;20;N;;;;;
+111EC;SINHALA ARCHAIC NUMBER THIRTY;No;0;L;;;;30;N;;;;;
+111ED;SINHALA ARCHAIC NUMBER FORTY;No;0;L;;;;40;N;;;;;
+111EE;SINHALA ARCHAIC NUMBER FIFTY;No;0;L;;;;50;N;;;;;
+111EF;SINHALA ARCHAIC NUMBER SIXTY;No;0;L;;;;60;N;;;;;
+111F0;SINHALA ARCHAIC NUMBER SEVENTY;No;0;L;;;;70;N;;;;;
+111F1;SINHALA ARCHAIC NUMBER EIGHTY;No;0;L;;;;80;N;;;;;
+111F2;SINHALA ARCHAIC NUMBER NINETY;No;0;L;;;;90;N;;;;;
+111F3;SINHALA ARCHAIC NUMBER ONE HUNDRED;No;0;L;;;;100;N;;;;;
+111F4;SINHALA ARCHAIC NUMBER ONE THOUSAND;No;0;L;;;;1000;N;;;;;
+11200;KHOJKI LETTER A;Lo;0;L;;;;;N;;;;;
+11201;KHOJKI LETTER AA;Lo;0;L;;;;;N;;;;;
+11202;KHOJKI LETTER I;Lo;0;L;;;;;N;;;;;
+11203;KHOJKI LETTER U;Lo;0;L;;;;;N;;;;;
+11204;KHOJKI LETTER E;Lo;0;L;;;;;N;;;;;
+11205;KHOJKI LETTER AI;Lo;0;L;;;;;N;;;;;
+11206;KHOJKI LETTER O;Lo;0;L;;;;;N;;;;;
+11207;KHOJKI LETTER AU;Lo;0;L;;;;;N;;;;;
+11208;KHOJKI LETTER KA;Lo;0;L;;;;;N;;;;;
+11209;KHOJKI LETTER KHA;Lo;0;L;;;;;N;;;;;
+1120A;KHOJKI LETTER GA;Lo;0;L;;;;;N;;;;;
+1120B;KHOJKI LETTER GGA;Lo;0;L;;;;;N;;;;;
+1120C;KHOJKI LETTER GHA;Lo;0;L;;;;;N;;;;;
+1120D;KHOJKI LETTER NGA;Lo;0;L;;;;;N;;;;;
+1120E;KHOJKI LETTER CA;Lo;0;L;;;;;N;;;;;
+1120F;KHOJKI LETTER CHA;Lo;0;L;;;;;N;;;;;
+11210;KHOJKI LETTER JA;Lo;0;L;;;;;N;;;;;
+11211;KHOJKI LETTER JJA;Lo;0;L;;;;;N;;;;;
+11213;KHOJKI LETTER NYA;Lo;0;L;;;;;N;;;;;
+11214;KHOJKI LETTER TTA;Lo;0;L;;;;;N;;;;;
+11215;KHOJKI LETTER TTHA;Lo;0;L;;;;;N;;;;;
+11216;KHOJKI LETTER DDA;Lo;0;L;;;;;N;;;;;
+11217;KHOJKI LETTER DDHA;Lo;0;L;;;;;N;;;;;
+11218;KHOJKI LETTER NNA;Lo;0;L;;;;;N;;;;;
+11219;KHOJKI LETTER TA;Lo;0;L;;;;;N;;;;;
+1121A;KHOJKI LETTER THA;Lo;0;L;;;;;N;;;;;
+1121B;KHOJKI LETTER DA;Lo;0;L;;;;;N;;;;;
+1121C;KHOJKI LETTER DDDA;Lo;0;L;;;;;N;;;;;
+1121D;KHOJKI LETTER DHA;Lo;0;L;;;;;N;;;;;
+1121E;KHOJKI LETTER NA;Lo;0;L;;;;;N;;;;;
+1121F;KHOJKI LETTER PA;Lo;0;L;;;;;N;;;;;
+11220;KHOJKI LETTER PHA;Lo;0;L;;;;;N;;;;;
+11221;KHOJKI LETTER BA;Lo;0;L;;;;;N;;;;;
+11222;KHOJKI LETTER BBA;Lo;0;L;;;;;N;;;;;
+11223;KHOJKI LETTER BHA;Lo;0;L;;;;;N;;;;;
+11224;KHOJKI LETTER MA;Lo;0;L;;;;;N;;;;;
+11225;KHOJKI LETTER YA;Lo;0;L;;;;;N;;;;;
+11226;KHOJKI LETTER RA;Lo;0;L;;;;;N;;;;;
+11227;KHOJKI LETTER LA;Lo;0;L;;;;;N;;;;;
+11228;KHOJKI LETTER VA;Lo;0;L;;;;;N;;;;;
+11229;KHOJKI LETTER SA;Lo;0;L;;;;;N;;;;;
+1122A;KHOJKI LETTER HA;Lo;0;L;;;;;N;;;;;
+1122B;KHOJKI LETTER LLA;Lo;0;L;;;;;N;;;;;
+1122C;KHOJKI VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+1122D;KHOJKI VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+1122E;KHOJKI VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+1122F;KHOJKI VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+11230;KHOJKI VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+11231;KHOJKI VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+11232;KHOJKI VOWEL SIGN O;Mc;0;L;;;;;N;;;;;
+11233;KHOJKI VOWEL SIGN AU;Mc;0;L;;;;;N;;;;;
+11234;KHOJKI SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+11235;KHOJKI SIGN VIRAMA;Mc;9;L;;;;;N;;;;;
+11236;KHOJKI SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+11237;KHOJKI SIGN SHADDA;Mn;0;NSM;;;;;N;;;;;
+11238;KHOJKI DANDA;Po;0;L;;;;;N;;;;;
+11239;KHOJKI DOUBLE DANDA;Po;0;L;;;;;N;;;;;
+1123A;KHOJKI WORD SEPARATOR;Po;0;L;;;;;N;;;;;
+1123B;KHOJKI SECTION MARK;Po;0;L;;;;;N;;;;;
+1123C;KHOJKI DOUBLE SECTION MARK;Po;0;L;;;;;N;;;;;
+1123D;KHOJKI ABBREVIATION SIGN;Po;0;L;;;;;N;;;;;
+1123E;KHOJKI SIGN SUKUN;Mn;0;NSM;;;;;N;;;;;
+11280;MULTANI LETTER A;Lo;0;L;;;;;N;;;;;
+11281;MULTANI LETTER I;Lo;0;L;;;;;N;;;;;
+11282;MULTANI LETTER U;Lo;0;L;;;;;N;;;;;
+11283;MULTANI LETTER E;Lo;0;L;;;;;N;;;;;
+11284;MULTANI LETTER KA;Lo;0;L;;;;;N;;;;;
+11285;MULTANI LETTER KHA;Lo;0;L;;;;;N;;;;;
+11286;MULTANI LETTER GA;Lo;0;L;;;;;N;;;;;
+11288;MULTANI LETTER GHA;Lo;0;L;;;;;N;;;;;
+1128A;MULTANI LETTER CA;Lo;0;L;;;;;N;;;;;
+1128B;MULTANI LETTER CHA;Lo;0;L;;;;;N;;;;;
+1128C;MULTANI LETTER JA;Lo;0;L;;;;;N;;;;;
+1128D;MULTANI LETTER JJA;Lo;0;L;;;;;N;;;;;
+1128F;MULTANI LETTER NYA;Lo;0;L;;;;;N;;;;;
+11290;MULTANI LETTER TTA;Lo;0;L;;;;;N;;;;;
+11291;MULTANI LETTER TTHA;Lo;0;L;;;;;N;;;;;
+11292;MULTANI LETTER DDA;Lo;0;L;;;;;N;;;;;
+11293;MULTANI LETTER DDDA;Lo;0;L;;;;;N;;;;;
+11294;MULTANI LETTER DDHA;Lo;0;L;;;;;N;;;;;
+11295;MULTANI LETTER NNA;Lo;0;L;;;;;N;;;;;
+11296;MULTANI LETTER TA;Lo;0;L;;;;;N;;;;;
+11297;MULTANI LETTER THA;Lo;0;L;;;;;N;;;;;
+11298;MULTANI LETTER DA;Lo;0;L;;;;;N;;;;;
+11299;MULTANI LETTER DHA;Lo;0;L;;;;;N;;;;;
+1129A;MULTANI LETTER NA;Lo;0;L;;;;;N;;;;;
+1129B;MULTANI LETTER PA;Lo;0;L;;;;;N;;;;;
+1129C;MULTANI LETTER PHA;Lo;0;L;;;;;N;;;;;
+1129D;MULTANI LETTER BA;Lo;0;L;;;;;N;;;;;
+1129F;MULTANI LETTER BHA;Lo;0;L;;;;;N;;;;;
+112A0;MULTANI LETTER MA;Lo;0;L;;;;;N;;;;;
+112A1;MULTANI LETTER YA;Lo;0;L;;;;;N;;;;;
+112A2;MULTANI LETTER RA;Lo;0;L;;;;;N;;;;;
+112A3;MULTANI LETTER LA;Lo;0;L;;;;;N;;;;;
+112A4;MULTANI LETTER VA;Lo;0;L;;;;;N;;;;;
+112A5;MULTANI LETTER SA;Lo;0;L;;;;;N;;;;;
+112A6;MULTANI LETTER HA;Lo;0;L;;;;;N;;;;;
+112A7;MULTANI LETTER RRA;Lo;0;L;;;;;N;;;;;
+112A8;MULTANI LETTER RHA;Lo;0;L;;;;;N;;;;;
+112A9;MULTANI SECTION MARK;Po;0;L;;;;;N;;;;;
+112B0;KHUDAWADI LETTER A;Lo;0;L;;;;;N;;;;;
+112B1;KHUDAWADI LETTER AA;Lo;0;L;;;;;N;;;;;
+112B2;KHUDAWADI LETTER I;Lo;0;L;;;;;N;;;;;
+112B3;KHUDAWADI LETTER II;Lo;0;L;;;;;N;;;;;
+112B4;KHUDAWADI LETTER U;Lo;0;L;;;;;N;;;;;
+112B5;KHUDAWADI LETTER UU;Lo;0;L;;;;;N;;;;;
+112B6;KHUDAWADI LETTER E;Lo;0;L;;;;;N;;;;;
+112B7;KHUDAWADI LETTER AI;Lo;0;L;;;;;N;;;;;
+112B8;KHUDAWADI LETTER O;Lo;0;L;;;;;N;;;;;
+112B9;KHUDAWADI LETTER AU;Lo;0;L;;;;;N;;;;;
+112BA;KHUDAWADI LETTER KA;Lo;0;L;;;;;N;;;;;
+112BB;KHUDAWADI LETTER KHA;Lo;0;L;;;;;N;;;;;
+112BC;KHUDAWADI LETTER GA;Lo;0;L;;;;;N;;;;;
+112BD;KHUDAWADI LETTER GGA;Lo;0;L;;;;;N;;;;;
+112BE;KHUDAWADI LETTER GHA;Lo;0;L;;;;;N;;;;;
+112BF;KHUDAWADI LETTER NGA;Lo;0;L;;;;;N;;;;;
+112C0;KHUDAWADI LETTER CA;Lo;0;L;;;;;N;;;;;
+112C1;KHUDAWADI LETTER CHA;Lo;0;L;;;;;N;;;;;
+112C2;KHUDAWADI LETTER JA;Lo;0;L;;;;;N;;;;;
+112C3;KHUDAWADI LETTER JJA;Lo;0;L;;;;;N;;;;;
+112C4;KHUDAWADI LETTER JHA;Lo;0;L;;;;;N;;;;;
+112C5;KHUDAWADI LETTER NYA;Lo;0;L;;;;;N;;;;;
+112C6;KHUDAWADI LETTER TTA;Lo;0;L;;;;;N;;;;;
+112C7;KHUDAWADI LETTER TTHA;Lo;0;L;;;;;N;;;;;
+112C8;KHUDAWADI LETTER DDA;Lo;0;L;;;;;N;;;;;
+112C9;KHUDAWADI LETTER DDDA;Lo;0;L;;;;;N;;;;;
+112CA;KHUDAWADI LETTER RRA;Lo;0;L;;;;;N;;;;;
+112CB;KHUDAWADI LETTER DDHA;Lo;0;L;;;;;N;;;;;
+112CC;KHUDAWADI LETTER NNA;Lo;0;L;;;;;N;;;;;
+112CD;KHUDAWADI LETTER TA;Lo;0;L;;;;;N;;;;;
+112CE;KHUDAWADI LETTER THA;Lo;0;L;;;;;N;;;;;
+112CF;KHUDAWADI LETTER DA;Lo;0;L;;;;;N;;;;;
+112D0;KHUDAWADI LETTER DHA;Lo;0;L;;;;;N;;;;;
+112D1;KHUDAWADI LETTER NA;Lo;0;L;;;;;N;;;;;
+112D2;KHUDAWADI LETTER PA;Lo;0;L;;;;;N;;;;;
+112D3;KHUDAWADI LETTER PHA;Lo;0;L;;;;;N;;;;;
+112D4;KHUDAWADI LETTER BA;Lo;0;L;;;;;N;;;;;
+112D5;KHUDAWADI LETTER BBA;Lo;0;L;;;;;N;;;;;
+112D6;KHUDAWADI LETTER BHA;Lo;0;L;;;;;N;;;;;
+112D7;KHUDAWADI LETTER MA;Lo;0;L;;;;;N;;;;;
+112D8;KHUDAWADI LETTER YA;Lo;0;L;;;;;N;;;;;
+112D9;KHUDAWADI LETTER RA;Lo;0;L;;;;;N;;;;;
+112DA;KHUDAWADI LETTER LA;Lo;0;L;;;;;N;;;;;
+112DB;KHUDAWADI LETTER VA;Lo;0;L;;;;;N;;;;;
+112DC;KHUDAWADI LETTER SHA;Lo;0;L;;;;;N;;;;;
+112DD;KHUDAWADI LETTER SA;Lo;0;L;;;;;N;;;;;
+112DE;KHUDAWADI LETTER HA;Lo;0;L;;;;;N;;;;;
+112DF;KHUDAWADI SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+112E0;KHUDAWADI VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+112E1;KHUDAWADI VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+112E2;KHUDAWADI VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+112E3;KHUDAWADI VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+112E4;KHUDAWADI VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+112E5;KHUDAWADI VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+112E6;KHUDAWADI VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+112E7;KHUDAWADI VOWEL SIGN O;Mn;0;NSM;;;;;N;;;;;
+112E8;KHUDAWADI VOWEL SIGN AU;Mn;0;NSM;;;;;N;;;;;
+112E9;KHUDAWADI SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+112EA;KHUDAWADI SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+112F0;KHUDAWADI DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+112F1;KHUDAWADI DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+112F2;KHUDAWADI DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+112F3;KHUDAWADI DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+112F4;KHUDAWADI DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+112F5;KHUDAWADI DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+112F6;KHUDAWADI DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+112F7;KHUDAWADI DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+112F8;KHUDAWADI DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+112F9;KHUDAWADI DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+11300;GRANTHA SIGN COMBINING ANUSVARA ABOVE;Mn;0;NSM;;;;;N;;;;;
+11301;GRANTHA SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+11302;GRANTHA SIGN ANUSVARA;Mc;0;L;;;;;N;;;;;
+11303;GRANTHA SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+11305;GRANTHA LETTER A;Lo;0;L;;;;;N;;;;;
+11306;GRANTHA LETTER AA;Lo;0;L;;;;;N;;;;;
+11307;GRANTHA LETTER I;Lo;0;L;;;;;N;;;;;
+11308;GRANTHA LETTER II;Lo;0;L;;;;;N;;;;;
+11309;GRANTHA LETTER U;Lo;0;L;;;;;N;;;;;
+1130A;GRANTHA LETTER UU;Lo;0;L;;;;;N;;;;;
+1130B;GRANTHA LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+1130C;GRANTHA LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+1130F;GRANTHA LETTER EE;Lo;0;L;;;;;N;;;;;
+11310;GRANTHA LETTER AI;Lo;0;L;;;;;N;;;;;
+11313;GRANTHA LETTER OO;Lo;0;L;;;;;N;;;;;
+11314;GRANTHA LETTER AU;Lo;0;L;;;;;N;;;;;
+11315;GRANTHA LETTER KA;Lo;0;L;;;;;N;;;;;
+11316;GRANTHA LETTER KHA;Lo;0;L;;;;;N;;;;;
+11317;GRANTHA LETTER GA;Lo;0;L;;;;;N;;;;;
+11318;GRANTHA LETTER GHA;Lo;0;L;;;;;N;;;;;
+11319;GRANTHA LETTER NGA;Lo;0;L;;;;;N;;;;;
+1131A;GRANTHA LETTER CA;Lo;0;L;;;;;N;;;;;
+1131B;GRANTHA LETTER CHA;Lo;0;L;;;;;N;;;;;
+1131C;GRANTHA LETTER JA;Lo;0;L;;;;;N;;;;;
+1131D;GRANTHA LETTER JHA;Lo;0;L;;;;;N;;;;;
+1131E;GRANTHA LETTER NYA;Lo;0;L;;;;;N;;;;;
+1131F;GRANTHA LETTER TTA;Lo;0;L;;;;;N;;;;;
+11320;GRANTHA LETTER TTHA;Lo;0;L;;;;;N;;;;;
+11321;GRANTHA LETTER DDA;Lo;0;L;;;;;N;;;;;
+11322;GRANTHA LETTER DDHA;Lo;0;L;;;;;N;;;;;
+11323;GRANTHA LETTER NNA;Lo;0;L;;;;;N;;;;;
+11324;GRANTHA LETTER TA;Lo;0;L;;;;;N;;;;;
+11325;GRANTHA LETTER THA;Lo;0;L;;;;;N;;;;;
+11326;GRANTHA LETTER DA;Lo;0;L;;;;;N;;;;;
+11327;GRANTHA LETTER DHA;Lo;0;L;;;;;N;;;;;
+11328;GRANTHA LETTER NA;Lo;0;L;;;;;N;;;;;
+1132A;GRANTHA LETTER PA;Lo;0;L;;;;;N;;;;;
+1132B;GRANTHA LETTER PHA;Lo;0;L;;;;;N;;;;;
+1132C;GRANTHA LETTER BA;Lo;0;L;;;;;N;;;;;
+1132D;GRANTHA LETTER BHA;Lo;0;L;;;;;N;;;;;
+1132E;GRANTHA LETTER MA;Lo;0;L;;;;;N;;;;;
+1132F;GRANTHA LETTER YA;Lo;0;L;;;;;N;;;;;
+11330;GRANTHA LETTER RA;Lo;0;L;;;;;N;;;;;
+11332;GRANTHA LETTER LA;Lo;0;L;;;;;N;;;;;
+11333;GRANTHA LETTER LLA;Lo;0;L;;;;;N;;;;;
+11335;GRANTHA LETTER VA;Lo;0;L;;;;;N;;;;;
+11336;GRANTHA LETTER SHA;Lo;0;L;;;;;N;;;;;
+11337;GRANTHA LETTER SSA;Lo;0;L;;;;;N;;;;;
+11338;GRANTHA LETTER SA;Lo;0;L;;;;;N;;;;;
+11339;GRANTHA LETTER HA;Lo;0;L;;;;;N;;;;;
+1133C;GRANTHA SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+1133D;GRANTHA SIGN AVAGRAHA;Lo;0;L;;;;;N;;;;;
+1133E;GRANTHA VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+1133F;GRANTHA VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+11340;GRANTHA VOWEL SIGN II;Mn;0;NSM;;;;;N;;;;;
+11341;GRANTHA VOWEL SIGN U;Mc;0;L;;;;;N;;;;;
+11342;GRANTHA VOWEL SIGN UU;Mc;0;L;;;;;N;;;;;
+11343;GRANTHA VOWEL SIGN VOCALIC R;Mc;0;L;;;;;N;;;;;
+11344;GRANTHA VOWEL SIGN VOCALIC RR;Mc;0;L;;;;;N;;;;;
+11347;GRANTHA VOWEL SIGN EE;Mc;0;L;;;;;N;;;;;
+11348;GRANTHA VOWEL SIGN AI;Mc;0;L;;;;;N;;;;;
+1134B;GRANTHA VOWEL SIGN OO;Mc;0;L;11347 1133E;;;;N;;;;;
+1134C;GRANTHA VOWEL SIGN AU;Mc;0;L;11347 11357;;;;N;;;;;
+1134D;GRANTHA SIGN VIRAMA;Mc;9;L;;;;;N;;;;;
+11350;GRANTHA OM;Lo;0;L;;;;;N;;;;;
+11357;GRANTHA AU LENGTH MARK;Mc;0;L;;;;;N;;;;;
+1135D;GRANTHA SIGN PLUTA;Lo;0;L;;;;;N;;;;;
+1135E;GRANTHA LETTER VEDIC ANUSVARA;Lo;0;L;;;;;N;;;;;
+1135F;GRANTHA LETTER VEDIC DOUBLE ANUSVARA;Lo;0;L;;;;;N;;;;;
+11360;GRANTHA LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+11361;GRANTHA LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+11362;GRANTHA VOWEL SIGN VOCALIC L;Mc;0;L;;;;;N;;;;;
+11363;GRANTHA VOWEL SIGN VOCALIC LL;Mc;0;L;;;;;N;;;;;
+11366;COMBINING GRANTHA DIGIT ZERO;Mn;230;NSM;;;;;N;;;;;
+11367;COMBINING GRANTHA DIGIT ONE;Mn;230;NSM;;;;;N;;;;;
+11368;COMBINING GRANTHA DIGIT TWO;Mn;230;NSM;;;;;N;;;;;
+11369;COMBINING GRANTHA DIGIT THREE;Mn;230;NSM;;;;;N;;;;;
+1136A;COMBINING GRANTHA DIGIT FOUR;Mn;230;NSM;;;;;N;;;;;
+1136B;COMBINING GRANTHA DIGIT FIVE;Mn;230;NSM;;;;;N;;;;;
+1136C;COMBINING GRANTHA DIGIT SIX;Mn;230;NSM;;;;;N;;;;;
+11370;COMBINING GRANTHA LETTER A;Mn;230;NSM;;;;;N;;;;;
+11371;COMBINING GRANTHA LETTER KA;Mn;230;NSM;;;;;N;;;;;
+11372;COMBINING GRANTHA LETTER NA;Mn;230;NSM;;;;;N;;;;;
+11373;COMBINING GRANTHA LETTER VI;Mn;230;NSM;;;;;N;;;;;
+11374;COMBINING GRANTHA LETTER PA;Mn;230;NSM;;;;;N;;;;;
+11400;NEWA LETTER A;Lo;0;L;;;;;N;;;;;
+11401;NEWA LETTER AA;Lo;0;L;;;;;N;;;;;
+11402;NEWA LETTER I;Lo;0;L;;;;;N;;;;;
+11403;NEWA LETTER II;Lo;0;L;;;;;N;;;;;
+11404;NEWA LETTER U;Lo;0;L;;;;;N;;;;;
+11405;NEWA LETTER UU;Lo;0;L;;;;;N;;;;;
+11406;NEWA LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+11407;NEWA LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+11408;NEWA LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+11409;NEWA LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+1140A;NEWA LETTER E;Lo;0;L;;;;;N;;;;;
+1140B;NEWA LETTER AI;Lo;0;L;;;;;N;;;;;
+1140C;NEWA LETTER O;Lo;0;L;;;;;N;;;;;
+1140D;NEWA LETTER AU;Lo;0;L;;;;;N;;;;;
+1140E;NEWA LETTER KA;Lo;0;L;;;;;N;;;;;
+1140F;NEWA LETTER KHA;Lo;0;L;;;;;N;;;;;
+11410;NEWA LETTER GA;Lo;0;L;;;;;N;;;;;
+11411;NEWA LETTER GHA;Lo;0;L;;;;;N;;;;;
+11412;NEWA LETTER NGA;Lo;0;L;;;;;N;;;;;
+11413;NEWA LETTER NGHA;Lo;0;L;;;;;N;;;;;
+11414;NEWA LETTER CA;Lo;0;L;;;;;N;;;;;
+11415;NEWA LETTER CHA;Lo;0;L;;;;;N;;;;;
+11416;NEWA LETTER JA;Lo;0;L;;;;;N;;;;;
+11417;NEWA LETTER JHA;Lo;0;L;;;;;N;;;;;
+11418;NEWA LETTER NYA;Lo;0;L;;;;;N;;;;;
+11419;NEWA LETTER NYHA;Lo;0;L;;;;;N;;;;;
+1141A;NEWA LETTER TTA;Lo;0;L;;;;;N;;;;;
+1141B;NEWA LETTER TTHA;Lo;0;L;;;;;N;;;;;
+1141C;NEWA LETTER DDA;Lo;0;L;;;;;N;;;;;
+1141D;NEWA LETTER DDHA;Lo;0;L;;;;;N;;;;;
+1141E;NEWA LETTER NNA;Lo;0;L;;;;;N;;;;;
+1141F;NEWA LETTER TA;Lo;0;L;;;;;N;;;;;
+11420;NEWA LETTER THA;Lo;0;L;;;;;N;;;;;
+11421;NEWA LETTER DA;Lo;0;L;;;;;N;;;;;
+11422;NEWA LETTER DHA;Lo;0;L;;;;;N;;;;;
+11423;NEWA LETTER NA;Lo;0;L;;;;;N;;;;;
+11424;NEWA LETTER NHA;Lo;0;L;;;;;N;;;;;
+11425;NEWA LETTER PA;Lo;0;L;;;;;N;;;;;
+11426;NEWA LETTER PHA;Lo;0;L;;;;;N;;;;;
+11427;NEWA LETTER BA;Lo;0;L;;;;;N;;;;;
+11428;NEWA LETTER BHA;Lo;0;L;;;;;N;;;;;
+11429;NEWA LETTER MA;Lo;0;L;;;;;N;;;;;
+1142A;NEWA LETTER MHA;Lo;0;L;;;;;N;;;;;
+1142B;NEWA LETTER YA;Lo;0;L;;;;;N;;;;;
+1142C;NEWA LETTER RA;Lo;0;L;;;;;N;;;;;
+1142D;NEWA LETTER RHA;Lo;0;L;;;;;N;;;;;
+1142E;NEWA LETTER LA;Lo;0;L;;;;;N;;;;;
+1142F;NEWA LETTER LHA;Lo;0;L;;;;;N;;;;;
+11430;NEWA LETTER WA;Lo;0;L;;;;;N;;;;;
+11431;NEWA LETTER SHA;Lo;0;L;;;;;N;;;;;
+11432;NEWA LETTER SSA;Lo;0;L;;;;;N;;;;;
+11433;NEWA LETTER SA;Lo;0;L;;;;;N;;;;;
+11434;NEWA LETTER HA;Lo;0;L;;;;;N;;;;;
+11435;NEWA VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+11436;NEWA VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+11437;NEWA VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+11438;NEWA VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+11439;NEWA VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+1143A;NEWA VOWEL SIGN VOCALIC R;Mn;0;NSM;;;;;N;;;;;
+1143B;NEWA VOWEL SIGN VOCALIC RR;Mn;0;NSM;;;;;N;;;;;
+1143C;NEWA VOWEL SIGN VOCALIC L;Mn;0;NSM;;;;;N;;;;;
+1143D;NEWA VOWEL SIGN VOCALIC LL;Mn;0;NSM;;;;;N;;;;;
+1143E;NEWA VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+1143F;NEWA VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+11440;NEWA VOWEL SIGN O;Mc;0;L;;;;;N;;;;;
+11441;NEWA VOWEL SIGN AU;Mc;0;L;;;;;N;;;;;
+11442;NEWA SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+11443;NEWA SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+11444;NEWA SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+11445;NEWA SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+11446;NEWA SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+11447;NEWA SIGN AVAGRAHA;Lo;0;L;;;;;N;;;;;
+11448;NEWA SIGN FINAL ANUSVARA;Lo;0;L;;;;;N;;;;;
+11449;NEWA OM;Lo;0;L;;;;;N;;;;;
+1144A;NEWA SIDDHI;Lo;0;L;;;;;N;;;;;
+1144B;NEWA DANDA;Po;0;L;;;;;N;;;;;
+1144C;NEWA DOUBLE DANDA;Po;0;L;;;;;N;;;;;
+1144D;NEWA COMMA;Po;0;L;;;;;N;;;;;
+1144E;NEWA GAP FILLER;Po;0;L;;;;;N;;;;;
+1144F;NEWA ABBREVIATION SIGN;Po;0;L;;;;;N;;;;;
+11450;NEWA DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+11451;NEWA DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+11452;NEWA DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+11453;NEWA DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+11454;NEWA DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+11455;NEWA DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+11456;NEWA DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+11457;NEWA DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+11458;NEWA DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+11459;NEWA DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+1145B;NEWA PLACEHOLDER MARK;Po;0;L;;;;;N;;;;;
+1145D;NEWA INSERTION SIGN;Po;0;L;;;;;N;;;;;
+11480;TIRHUTA ANJI;Lo;0;L;;;;;N;;;;;
+11481;TIRHUTA LETTER A;Lo;0;L;;;;;N;;;;;
+11482;TIRHUTA LETTER AA;Lo;0;L;;;;;N;;;;;
+11483;TIRHUTA LETTER I;Lo;0;L;;;;;N;;;;;
+11484;TIRHUTA LETTER II;Lo;0;L;;;;;N;;;;;
+11485;TIRHUTA LETTER U;Lo;0;L;;;;;N;;;;;
+11486;TIRHUTA LETTER UU;Lo;0;L;;;;;N;;;;;
+11487;TIRHUTA LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+11488;TIRHUTA LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+11489;TIRHUTA LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+1148A;TIRHUTA LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+1148B;TIRHUTA LETTER E;Lo;0;L;;;;;N;;;;;
+1148C;TIRHUTA LETTER AI;Lo;0;L;;;;;N;;;;;
+1148D;TIRHUTA LETTER O;Lo;0;L;;;;;N;;;;;
+1148E;TIRHUTA LETTER AU;Lo;0;L;;;;;N;;;;;
+1148F;TIRHUTA LETTER KA;Lo;0;L;;;;;N;;;;;
+11490;TIRHUTA LETTER KHA;Lo;0;L;;;;;N;;;;;
+11491;TIRHUTA LETTER GA;Lo;0;L;;;;;N;;;;;
+11492;TIRHUTA LETTER GHA;Lo;0;L;;;;;N;;;;;
+11493;TIRHUTA LETTER NGA;Lo;0;L;;;;;N;;;;;
+11494;TIRHUTA LETTER CA;Lo;0;L;;;;;N;;;;;
+11495;TIRHUTA LETTER CHA;Lo;0;L;;;;;N;;;;;
+11496;TIRHUTA LETTER JA;Lo;0;L;;;;;N;;;;;
+11497;TIRHUTA LETTER JHA;Lo;0;L;;;;;N;;;;;
+11498;TIRHUTA LETTER NYA;Lo;0;L;;;;;N;;;;;
+11499;TIRHUTA LETTER TTA;Lo;0;L;;;;;N;;;;;
+1149A;TIRHUTA LETTER TTHA;Lo;0;L;;;;;N;;;;;
+1149B;TIRHUTA LETTER DDA;Lo;0;L;;;;;N;;;;;
+1149C;TIRHUTA LETTER DDHA;Lo;0;L;;;;;N;;;;;
+1149D;TIRHUTA LETTER NNA;Lo;0;L;;;;;N;;;;;
+1149E;TIRHUTA LETTER TA;Lo;0;L;;;;;N;;;;;
+1149F;TIRHUTA LETTER THA;Lo;0;L;;;;;N;;;;;
+114A0;TIRHUTA LETTER DA;Lo;0;L;;;;;N;;;;;
+114A1;TIRHUTA LETTER DHA;Lo;0;L;;;;;N;;;;;
+114A2;TIRHUTA LETTER NA;Lo;0;L;;;;;N;;;;;
+114A3;TIRHUTA LETTER PA;Lo;0;L;;;;;N;;;;;
+114A4;TIRHUTA LETTER PHA;Lo;0;L;;;;;N;;;;;
+114A5;TIRHUTA LETTER BA;Lo;0;L;;;;;N;;;;;
+114A6;TIRHUTA LETTER BHA;Lo;0;L;;;;;N;;;;;
+114A7;TIRHUTA LETTER MA;Lo;0;L;;;;;N;;;;;
+114A8;TIRHUTA LETTER YA;Lo;0;L;;;;;N;;;;;
+114A9;TIRHUTA LETTER RA;Lo;0;L;;;;;N;;;;;
+114AA;TIRHUTA LETTER LA;Lo;0;L;;;;;N;;;;;
+114AB;TIRHUTA LETTER VA;Lo;0;L;;;;;N;;;;;
+114AC;TIRHUTA LETTER SHA;Lo;0;L;;;;;N;;;;;
+114AD;TIRHUTA LETTER SSA;Lo;0;L;;;;;N;;;;;
+114AE;TIRHUTA LETTER SA;Lo;0;L;;;;;N;;;;;
+114AF;TIRHUTA LETTER HA;Lo;0;L;;;;;N;;;;;
+114B0;TIRHUTA VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+114B1;TIRHUTA VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+114B2;TIRHUTA VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+114B3;TIRHUTA VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+114B4;TIRHUTA VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+114B5;TIRHUTA VOWEL SIGN VOCALIC R;Mn;0;NSM;;;;;N;;;;;
+114B6;TIRHUTA VOWEL SIGN VOCALIC RR;Mn;0;NSM;;;;;N;;;;;
+114B7;TIRHUTA VOWEL SIGN VOCALIC L;Mn;0;NSM;;;;;N;;;;;
+114B8;TIRHUTA VOWEL SIGN VOCALIC LL;Mn;0;NSM;;;;;N;;;;;
+114B9;TIRHUTA VOWEL SIGN E;Mc;0;L;;;;;N;;;;;
+114BA;TIRHUTA VOWEL SIGN SHORT E;Mn;0;NSM;;;;;N;;;;;
+114BB;TIRHUTA VOWEL SIGN AI;Mc;0;L;114B9 114BA;;;;N;;;;;
+114BC;TIRHUTA VOWEL SIGN O;Mc;0;L;114B9 114B0;;;;N;;;;;
+114BD;TIRHUTA VOWEL SIGN SHORT O;Mc;0;L;;;;;N;;;;;
+114BE;TIRHUTA VOWEL SIGN AU;Mc;0;L;114B9 114BD;;;;N;;;;;
+114BF;TIRHUTA SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+114C0;TIRHUTA SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+114C1;TIRHUTA SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+114C2;TIRHUTA SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+114C3;TIRHUTA SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+114C4;TIRHUTA SIGN AVAGRAHA;Lo;0;L;;;;;N;;;;;
+114C5;TIRHUTA GVANG;Lo;0;L;;;;;N;;;;;
+114C6;TIRHUTA ABBREVIATION SIGN;Po;0;L;;;;;N;;;;;
+114C7;TIRHUTA OM;Lo;0;L;;;;;N;;;;;
+114D0;TIRHUTA DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+114D1;TIRHUTA DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+114D2;TIRHUTA DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+114D3;TIRHUTA DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+114D4;TIRHUTA DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+114D5;TIRHUTA DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+114D6;TIRHUTA DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+114D7;TIRHUTA DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+114D8;TIRHUTA DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+114D9;TIRHUTA DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+11580;SIDDHAM LETTER A;Lo;0;L;;;;;N;;;;;
+11581;SIDDHAM LETTER AA;Lo;0;L;;;;;N;;;;;
+11582;SIDDHAM LETTER I;Lo;0;L;;;;;N;;;;;
+11583;SIDDHAM LETTER II;Lo;0;L;;;;;N;;;;;
+11584;SIDDHAM LETTER U;Lo;0;L;;;;;N;;;;;
+11585;SIDDHAM LETTER UU;Lo;0;L;;;;;N;;;;;
+11586;SIDDHAM LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+11587;SIDDHAM LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+11588;SIDDHAM LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+11589;SIDDHAM LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+1158A;SIDDHAM LETTER E;Lo;0;L;;;;;N;;;;;
+1158B;SIDDHAM LETTER AI;Lo;0;L;;;;;N;;;;;
+1158C;SIDDHAM LETTER O;Lo;0;L;;;;;N;;;;;
+1158D;SIDDHAM LETTER AU;Lo;0;L;;;;;N;;;;;
+1158E;SIDDHAM LETTER KA;Lo;0;L;;;;;N;;;;;
+1158F;SIDDHAM LETTER KHA;Lo;0;L;;;;;N;;;;;
+11590;SIDDHAM LETTER GA;Lo;0;L;;;;;N;;;;;
+11591;SIDDHAM LETTER GHA;Lo;0;L;;;;;N;;;;;
+11592;SIDDHAM LETTER NGA;Lo;0;L;;;;;N;;;;;
+11593;SIDDHAM LETTER CA;Lo;0;L;;;;;N;;;;;
+11594;SIDDHAM LETTER CHA;Lo;0;L;;;;;N;;;;;
+11595;SIDDHAM LETTER JA;Lo;0;L;;;;;N;;;;;
+11596;SIDDHAM LETTER JHA;Lo;0;L;;;;;N;;;;;
+11597;SIDDHAM LETTER NYA;Lo;0;L;;;;;N;;;;;
+11598;SIDDHAM LETTER TTA;Lo;0;L;;;;;N;;;;;
+11599;SIDDHAM LETTER TTHA;Lo;0;L;;;;;N;;;;;
+1159A;SIDDHAM LETTER DDA;Lo;0;L;;;;;N;;;;;
+1159B;SIDDHAM LETTER DDHA;Lo;0;L;;;;;N;;;;;
+1159C;SIDDHAM LETTER NNA;Lo;0;L;;;;;N;;;;;
+1159D;SIDDHAM LETTER TA;Lo;0;L;;;;;N;;;;;
+1159E;SIDDHAM LETTER THA;Lo;0;L;;;;;N;;;;;
+1159F;SIDDHAM LETTER DA;Lo;0;L;;;;;N;;;;;
+115A0;SIDDHAM LETTER DHA;Lo;0;L;;;;;N;;;;;
+115A1;SIDDHAM LETTER NA;Lo;0;L;;;;;N;;;;;
+115A2;SIDDHAM LETTER PA;Lo;0;L;;;;;N;;;;;
+115A3;SIDDHAM LETTER PHA;Lo;0;L;;;;;N;;;;;
+115A4;SIDDHAM LETTER BA;Lo;0;L;;;;;N;;;;;
+115A5;SIDDHAM LETTER BHA;Lo;0;L;;;;;N;;;;;
+115A6;SIDDHAM LETTER MA;Lo;0;L;;;;;N;;;;;
+115A7;SIDDHAM LETTER YA;Lo;0;L;;;;;N;;;;;
+115A8;SIDDHAM LETTER RA;Lo;0;L;;;;;N;;;;;
+115A9;SIDDHAM LETTER LA;Lo;0;L;;;;;N;;;;;
+115AA;SIDDHAM LETTER VA;Lo;0;L;;;;;N;;;;;
+115AB;SIDDHAM LETTER SHA;Lo;0;L;;;;;N;;;;;
+115AC;SIDDHAM LETTER SSA;Lo;0;L;;;;;N;;;;;
+115AD;SIDDHAM LETTER SA;Lo;0;L;;;;;N;;;;;
+115AE;SIDDHAM LETTER HA;Lo;0;L;;;;;N;;;;;
+115AF;SIDDHAM VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+115B0;SIDDHAM VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+115B1;SIDDHAM VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+115B2;SIDDHAM VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+115B3;SIDDHAM VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+115B4;SIDDHAM VOWEL SIGN VOCALIC R;Mn;0;NSM;;;;;N;;;;;
+115B5;SIDDHAM VOWEL SIGN VOCALIC RR;Mn;0;NSM;;;;;N;;;;;
+115B8;SIDDHAM VOWEL SIGN E;Mc;0;L;;;;;N;;;;;
+115B9;SIDDHAM VOWEL SIGN AI;Mc;0;L;;;;;N;;;;;
+115BA;SIDDHAM VOWEL SIGN O;Mc;0;L;115B8 115AF;;;;N;;;;;
+115BB;SIDDHAM VOWEL SIGN AU;Mc;0;L;115B9 115AF;;;;N;;;;;
+115BC;SIDDHAM SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+115BD;SIDDHAM SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+115BE;SIDDHAM SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+115BF;SIDDHAM SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+115C0;SIDDHAM SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+115C1;SIDDHAM SIGN SIDDHAM;Po;0;L;;;;;N;;;;;
+115C2;SIDDHAM DANDA;Po;0;L;;;;;N;;;;;
+115C3;SIDDHAM DOUBLE DANDA;Po;0;L;;;;;N;;;;;
+115C4;SIDDHAM SEPARATOR DOT;Po;0;L;;;;;N;;;;;
+115C5;SIDDHAM SEPARATOR BAR;Po;0;L;;;;;N;;;;;
+115C6;SIDDHAM REPETITION MARK-1;Po;0;L;;;;;N;;;;;
+115C7;SIDDHAM REPETITION MARK-2;Po;0;L;;;;;N;;;;;
+115C8;SIDDHAM REPETITION MARK-3;Po;0;L;;;;;N;;;;;
+115C9;SIDDHAM END OF TEXT MARK;Po;0;L;;;;;N;;;;;
+115CA;SIDDHAM SECTION MARK WITH TRIDENT AND U-SHAPED ORNAMENTS;Po;0;L;;;;;N;;;;;
+115CB;SIDDHAM SECTION MARK WITH TRIDENT AND DOTTED CRESCENTS;Po;0;L;;;;;N;;;;;
+115CC;SIDDHAM SECTION MARK WITH RAYS AND DOTTED CRESCENTS;Po;0;L;;;;;N;;;;;
+115CD;SIDDHAM SECTION MARK WITH RAYS AND DOTTED DOUBLE CRESCENTS;Po;0;L;;;;;N;;;;;
+115CE;SIDDHAM SECTION MARK WITH RAYS AND DOTTED TRIPLE CRESCENTS;Po;0;L;;;;;N;;;;;
+115CF;SIDDHAM SECTION MARK DOUBLE RING;Po;0;L;;;;;N;;;;;
+115D0;SIDDHAM SECTION MARK DOUBLE RING WITH RAYS;Po;0;L;;;;;N;;;;;
+115D1;SIDDHAM SECTION MARK WITH DOUBLE CRESCENTS;Po;0;L;;;;;N;;;;;
+115D2;SIDDHAM SECTION MARK WITH TRIPLE CRESCENTS;Po;0;L;;;;;N;;;;;
+115D3;SIDDHAM SECTION MARK WITH QUADRUPLE CRESCENTS;Po;0;L;;;;;N;;;;;
+115D4;SIDDHAM SECTION MARK WITH SEPTUPLE CRESCENTS;Po;0;L;;;;;N;;;;;
+115D5;SIDDHAM SECTION MARK WITH CIRCLES AND RAYS;Po;0;L;;;;;N;;;;;
+115D6;SIDDHAM SECTION MARK WITH CIRCLES AND TWO ENCLOSURES;Po;0;L;;;;;N;;;;;
+115D7;SIDDHAM SECTION MARK WITH CIRCLES AND FOUR ENCLOSURES;Po;0;L;;;;;N;;;;;
+115D8;SIDDHAM LETTER THREE-CIRCLE ALTERNATE I;Lo;0;L;;;;;N;;;;;
+115D9;SIDDHAM LETTER TWO-CIRCLE ALTERNATE I;Lo;0;L;;;;;N;;;;;
+115DA;SIDDHAM LETTER TWO-CIRCLE ALTERNATE II;Lo;0;L;;;;;N;;;;;
+115DB;SIDDHAM LETTER ALTERNATE U;Lo;0;L;;;;;N;;;;;
+115DC;SIDDHAM VOWEL SIGN ALTERNATE U;Mn;0;NSM;;;;;N;;;;;
+115DD;SIDDHAM VOWEL SIGN ALTERNATE UU;Mn;0;NSM;;;;;N;;;;;
+11600;MODI LETTER A;Lo;0;L;;;;;N;;;;;
+11601;MODI LETTER AA;Lo;0;L;;;;;N;;;;;
+11602;MODI LETTER I;Lo;0;L;;;;;N;;;;;
+11603;MODI LETTER II;Lo;0;L;;;;;N;;;;;
+11604;MODI LETTER U;Lo;0;L;;;;;N;;;;;
+11605;MODI LETTER UU;Lo;0;L;;;;;N;;;;;
+11606;MODI LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+11607;MODI LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+11608;MODI LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+11609;MODI LETTER VOCALIC LL;Lo;0;L;;;;;N;;;;;
+1160A;MODI LETTER E;Lo;0;L;;;;;N;;;;;
+1160B;MODI LETTER AI;Lo;0;L;;;;;N;;;;;
+1160C;MODI LETTER O;Lo;0;L;;;;;N;;;;;
+1160D;MODI LETTER AU;Lo;0;L;;;;;N;;;;;
+1160E;MODI LETTER KA;Lo;0;L;;;;;N;;;;;
+1160F;MODI LETTER KHA;Lo;0;L;;;;;N;;;;;
+11610;MODI LETTER GA;Lo;0;L;;;;;N;;;;;
+11611;MODI LETTER GHA;Lo;0;L;;;;;N;;;;;
+11612;MODI LETTER NGA;Lo;0;L;;;;;N;;;;;
+11613;MODI LETTER CA;Lo;0;L;;;;;N;;;;;
+11614;MODI LETTER CHA;Lo;0;L;;;;;N;;;;;
+11615;MODI LETTER JA;Lo;0;L;;;;;N;;;;;
+11616;MODI LETTER JHA;Lo;0;L;;;;;N;;;;;
+11617;MODI LETTER NYA;Lo;0;L;;;;;N;;;;;
+11618;MODI LETTER TTA;Lo;0;L;;;;;N;;;;;
+11619;MODI LETTER TTHA;Lo;0;L;;;;;N;;;;;
+1161A;MODI LETTER DDA;Lo;0;L;;;;;N;;;;;
+1161B;MODI LETTER DDHA;Lo;0;L;;;;;N;;;;;
+1161C;MODI LETTER NNA;Lo;0;L;;;;;N;;;;;
+1161D;MODI LETTER TA;Lo;0;L;;;;;N;;;;;
+1161E;MODI LETTER THA;Lo;0;L;;;;;N;;;;;
+1161F;MODI LETTER DA;Lo;0;L;;;;;N;;;;;
+11620;MODI LETTER DHA;Lo;0;L;;;;;N;;;;;
+11621;MODI LETTER NA;Lo;0;L;;;;;N;;;;;
+11622;MODI LETTER PA;Lo;0;L;;;;;N;;;;;
+11623;MODI LETTER PHA;Lo;0;L;;;;;N;;;;;
+11624;MODI LETTER BA;Lo;0;L;;;;;N;;;;;
+11625;MODI LETTER BHA;Lo;0;L;;;;;N;;;;;
+11626;MODI LETTER MA;Lo;0;L;;;;;N;;;;;
+11627;MODI LETTER YA;Lo;0;L;;;;;N;;;;;
+11628;MODI LETTER RA;Lo;0;L;;;;;N;;;;;
+11629;MODI LETTER LA;Lo;0;L;;;;;N;;;;;
+1162A;MODI LETTER VA;Lo;0;L;;;;;N;;;;;
+1162B;MODI LETTER SHA;Lo;0;L;;;;;N;;;;;
+1162C;MODI LETTER SSA;Lo;0;L;;;;;N;;;;;
+1162D;MODI LETTER SA;Lo;0;L;;;;;N;;;;;
+1162E;MODI LETTER HA;Lo;0;L;;;;;N;;;;;
+1162F;MODI LETTER LLA;Lo;0;L;;;;;N;;;;;
+11630;MODI VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+11631;MODI VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+11632;MODI VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+11633;MODI VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+11634;MODI VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+11635;MODI VOWEL SIGN VOCALIC R;Mn;0;NSM;;;;;N;;;;;
+11636;MODI VOWEL SIGN VOCALIC RR;Mn;0;NSM;;;;;N;;;;;
+11637;MODI VOWEL SIGN VOCALIC L;Mn;0;NSM;;;;;N;;;;;
+11638;MODI VOWEL SIGN VOCALIC LL;Mn;0;NSM;;;;;N;;;;;
+11639;MODI VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+1163A;MODI VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+1163B;MODI VOWEL SIGN O;Mc;0;L;;;;;N;;;;;
+1163C;MODI VOWEL SIGN AU;Mc;0;L;;;;;N;;;;;
+1163D;MODI SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+1163E;MODI SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+1163F;MODI SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+11640;MODI SIGN ARDHACANDRA;Mn;0;NSM;;;;;N;;;;;
+11641;MODI DANDA;Po;0;L;;;;;N;;;;;
+11642;MODI DOUBLE DANDA;Po;0;L;;;;;N;;;;;
+11643;MODI ABBREVIATION SIGN;Po;0;L;;;;;N;;;;;
+11644;MODI SIGN HUVA;Lo;0;L;;;;;N;;;;;
+11650;MODI DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+11651;MODI DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+11652;MODI DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+11653;MODI DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+11654;MODI DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+11655;MODI DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+11656;MODI DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+11657;MODI DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+11658;MODI DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+11659;MODI DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+11660;MONGOLIAN BIRGA WITH ORNAMENT;Po;0;ON;;;;;N;;;;;
+11661;MONGOLIAN ROTATED BIRGA;Po;0;ON;;;;;N;;;;;
+11662;MONGOLIAN DOUBLE BIRGA WITH ORNAMENT;Po;0;ON;;;;;N;;;;;
+11663;MONGOLIAN TRIPLE BIRGA WITH ORNAMENT;Po;0;ON;;;;;N;;;;;
+11664;MONGOLIAN BIRGA WITH DOUBLE ORNAMENT;Po;0;ON;;;;;N;;;;;
+11665;MONGOLIAN ROTATED BIRGA WITH ORNAMENT;Po;0;ON;;;;;N;;;;;
+11666;MONGOLIAN ROTATED BIRGA WITH DOUBLE ORNAMENT;Po;0;ON;;;;;N;;;;;
+11667;MONGOLIAN INVERTED BIRGA;Po;0;ON;;;;;N;;;;;
+11668;MONGOLIAN INVERTED BIRGA WITH DOUBLE ORNAMENT;Po;0;ON;;;;;N;;;;;
+11669;MONGOLIAN SWIRL BIRGA;Po;0;ON;;;;;N;;;;;
+1166A;MONGOLIAN SWIRL BIRGA WITH ORNAMENT;Po;0;ON;;;;;N;;;;;
+1166B;MONGOLIAN SWIRL BIRGA WITH DOUBLE ORNAMENT;Po;0;ON;;;;;N;;;;;
+1166C;MONGOLIAN TURNED SWIRL BIRGA WITH DOUBLE ORNAMENT;Po;0;ON;;;;;N;;;;;
+11680;TAKRI LETTER A;Lo;0;L;;;;;N;;;;;
+11681;TAKRI LETTER AA;Lo;0;L;;;;;N;;;;;
+11682;TAKRI LETTER I;Lo;0;L;;;;;N;;;;;
+11683;TAKRI LETTER II;Lo;0;L;;;;;N;;;;;
+11684;TAKRI LETTER U;Lo;0;L;;;;;N;;;;;
+11685;TAKRI LETTER UU;Lo;0;L;;;;;N;;;;;
+11686;TAKRI LETTER E;Lo;0;L;;;;;N;;;;;
+11687;TAKRI LETTER AI;Lo;0;L;;;;;N;;;;;
+11688;TAKRI LETTER O;Lo;0;L;;;;;N;;;;;
+11689;TAKRI LETTER AU;Lo;0;L;;;;;N;;;;;
+1168A;TAKRI LETTER KA;Lo;0;L;;;;;N;;;;;
+1168B;TAKRI LETTER KHA;Lo;0;L;;;;;N;;;;;
+1168C;TAKRI LETTER GA;Lo;0;L;;;;;N;;;;;
+1168D;TAKRI LETTER GHA;Lo;0;L;;;;;N;;;;;
+1168E;TAKRI LETTER NGA;Lo;0;L;;;;;N;;;;;
+1168F;TAKRI LETTER CA;Lo;0;L;;;;;N;;;;;
+11690;TAKRI LETTER CHA;Lo;0;L;;;;;N;;;;;
+11691;TAKRI LETTER JA;Lo;0;L;;;;;N;;;;;
+11692;TAKRI LETTER JHA;Lo;0;L;;;;;N;;;;;
+11693;TAKRI LETTER NYA;Lo;0;L;;;;;N;;;;;
+11694;TAKRI LETTER TTA;Lo;0;L;;;;;N;;;;;
+11695;TAKRI LETTER TTHA;Lo;0;L;;;;;N;;;;;
+11696;TAKRI LETTER DDA;Lo;0;L;;;;;N;;;;;
+11697;TAKRI LETTER DDHA;Lo;0;L;;;;;N;;;;;
+11698;TAKRI LETTER NNA;Lo;0;L;;;;;N;;;;;
+11699;TAKRI LETTER TA;Lo;0;L;;;;;N;;;;;
+1169A;TAKRI LETTER THA;Lo;0;L;;;;;N;;;;;
+1169B;TAKRI LETTER DA;Lo;0;L;;;;;N;;;;;
+1169C;TAKRI LETTER DHA;Lo;0;L;;;;;N;;;;;
+1169D;TAKRI LETTER NA;Lo;0;L;;;;;N;;;;;
+1169E;TAKRI LETTER PA;Lo;0;L;;;;;N;;;;;
+1169F;TAKRI LETTER PHA;Lo;0;L;;;;;N;;;;;
+116A0;TAKRI LETTER BA;Lo;0;L;;;;;N;;;;;
+116A1;TAKRI LETTER BHA;Lo;0;L;;;;;N;;;;;
+116A2;TAKRI LETTER MA;Lo;0;L;;;;;N;;;;;
+116A3;TAKRI LETTER YA;Lo;0;L;;;;;N;;;;;
+116A4;TAKRI LETTER RA;Lo;0;L;;;;;N;;;;;
+116A5;TAKRI LETTER LA;Lo;0;L;;;;;N;;;;;
+116A6;TAKRI LETTER VA;Lo;0;L;;;;;N;;;;;
+116A7;TAKRI LETTER SHA;Lo;0;L;;;;;N;;;;;
+116A8;TAKRI LETTER SA;Lo;0;L;;;;;N;;;;;
+116A9;TAKRI LETTER HA;Lo;0;L;;;;;N;;;;;
+116AA;TAKRI LETTER RRA;Lo;0;L;;;;;N;;;;;
+116AB;TAKRI SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+116AC;TAKRI SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+116AD;TAKRI VOWEL SIGN AA;Mn;0;NSM;;;;;N;;;;;
+116AE;TAKRI VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+116AF;TAKRI VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+116B0;TAKRI VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+116B1;TAKRI VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+116B2;TAKRI VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+116B3;TAKRI VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+116B4;TAKRI VOWEL SIGN O;Mn;0;NSM;;;;;N;;;;;
+116B5;TAKRI VOWEL SIGN AU;Mn;0;NSM;;;;;N;;;;;
+116B6;TAKRI SIGN VIRAMA;Mc;9;L;;;;;N;;;;;
+116B7;TAKRI SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+116C0;TAKRI DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+116C1;TAKRI DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+116C2;TAKRI DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+116C3;TAKRI DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+116C4;TAKRI DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+116C5;TAKRI DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+116C6;TAKRI DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+116C7;TAKRI DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+116C8;TAKRI DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+116C9;TAKRI DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+11700;AHOM LETTER KA;Lo;0;L;;;;;N;;;;;
+11701;AHOM LETTER KHA;Lo;0;L;;;;;N;;;;;
+11702;AHOM LETTER NGA;Lo;0;L;;;;;N;;;;;
+11703;AHOM LETTER NA;Lo;0;L;;;;;N;;;;;
+11704;AHOM LETTER TA;Lo;0;L;;;;;N;;;;;
+11705;AHOM LETTER ALTERNATE TA;Lo;0;L;;;;;N;;;;;
+11706;AHOM LETTER PA;Lo;0;L;;;;;N;;;;;
+11707;AHOM LETTER PHA;Lo;0;L;;;;;N;;;;;
+11708;AHOM LETTER BA;Lo;0;L;;;;;N;;;;;
+11709;AHOM LETTER MA;Lo;0;L;;;;;N;;;;;
+1170A;AHOM LETTER JA;Lo;0;L;;;;;N;;;;;
+1170B;AHOM LETTER CHA;Lo;0;L;;;;;N;;;;;
+1170C;AHOM LETTER THA;Lo;0;L;;;;;N;;;;;
+1170D;AHOM LETTER RA;Lo;0;L;;;;;N;;;;;
+1170E;AHOM LETTER LA;Lo;0;L;;;;;N;;;;;
+1170F;AHOM LETTER SA;Lo;0;L;;;;;N;;;;;
+11710;AHOM LETTER NYA;Lo;0;L;;;;;N;;;;;
+11711;AHOM LETTER HA;Lo;0;L;;;;;N;;;;;
+11712;AHOM LETTER A;Lo;0;L;;;;;N;;;;;
+11713;AHOM LETTER DA;Lo;0;L;;;;;N;;;;;
+11714;AHOM LETTER DHA;Lo;0;L;;;;;N;;;;;
+11715;AHOM LETTER GA;Lo;0;L;;;;;N;;;;;
+11716;AHOM LETTER ALTERNATE GA;Lo;0;L;;;;;N;;;;;
+11717;AHOM LETTER GHA;Lo;0;L;;;;;N;;;;;
+11718;AHOM LETTER BHA;Lo;0;L;;;;;N;;;;;
+11719;AHOM LETTER JHA;Lo;0;L;;;;;N;;;;;
+1171D;AHOM CONSONANT SIGN MEDIAL LA;Mn;0;NSM;;;;;N;;;;;
+1171E;AHOM CONSONANT SIGN MEDIAL RA;Mn;0;NSM;;;;;N;;;;;
+1171F;AHOM CONSONANT SIGN MEDIAL LIGATING RA;Mn;0;NSM;;;;;N;;;;;
+11720;AHOM VOWEL SIGN A;Mc;0;L;;;;;N;;;;;
+11721;AHOM VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+11722;AHOM VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+11723;AHOM VOWEL SIGN II;Mn;0;NSM;;;;;N;;;;;
+11724;AHOM VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+11725;AHOM VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+11726;AHOM VOWEL SIGN E;Mc;0;L;;;;;N;;;;;
+11727;AHOM VOWEL SIGN AW;Mn;0;NSM;;;;;N;;;;;
+11728;AHOM VOWEL SIGN O;Mn;0;NSM;;;;;N;;;;;
+11729;AHOM VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+1172A;AHOM VOWEL SIGN AM;Mn;0;NSM;;;;;N;;;;;
+1172B;AHOM SIGN KILLER;Mn;9;NSM;;;;;N;;;;;
+11730;AHOM DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+11731;AHOM DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+11732;AHOM DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+11733;AHOM DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+11734;AHOM DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+11735;AHOM DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+11736;AHOM DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+11737;AHOM DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+11738;AHOM DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+11739;AHOM DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+1173A;AHOM NUMBER TEN;No;0;L;;;;10;N;;;;;
+1173B;AHOM NUMBER TWENTY;No;0;L;;;;20;N;;;;;
+1173C;AHOM SIGN SMALL SECTION;Po;0;L;;;;;N;;;;;
+1173D;AHOM SIGN SECTION;Po;0;L;;;;;N;;;;;
+1173E;AHOM SIGN RULAI;Po;0;L;;;;;N;;;;;
+1173F;AHOM SYMBOL VI;So;0;L;;;;;N;;;;;
+118A0;WARANG CITI CAPITAL LETTER NGAA;Lu;0;L;;;;;N;;;;118C0;
+118A1;WARANG CITI CAPITAL LETTER A;Lu;0;L;;;;;N;;;;118C1;
+118A2;WARANG CITI CAPITAL LETTER WI;Lu;0;L;;;;;N;;;;118C2;
+118A3;WARANG CITI CAPITAL LETTER YU;Lu;0;L;;;;;N;;;;118C3;
+118A4;WARANG CITI CAPITAL LETTER YA;Lu;0;L;;;;;N;;;;118C4;
+118A5;WARANG CITI CAPITAL LETTER YO;Lu;0;L;;;;;N;;;;118C5;
+118A6;WARANG CITI CAPITAL LETTER II;Lu;0;L;;;;;N;;;;118C6;
+118A7;WARANG CITI CAPITAL LETTER UU;Lu;0;L;;;;;N;;;;118C7;
+118A8;WARANG CITI CAPITAL LETTER E;Lu;0;L;;;;;N;;;;118C8;
+118A9;WARANG CITI CAPITAL LETTER O;Lu;0;L;;;;;N;;;;118C9;
+118AA;WARANG CITI CAPITAL LETTER ANG;Lu;0;L;;;;;N;;;;118CA;
+118AB;WARANG CITI CAPITAL LETTER GA;Lu;0;L;;;;;N;;;;118CB;
+118AC;WARANG CITI CAPITAL LETTER KO;Lu;0;L;;;;;N;;;;118CC;
+118AD;WARANG CITI CAPITAL LETTER ENY;Lu;0;L;;;;;N;;;;118CD;
+118AE;WARANG CITI CAPITAL LETTER YUJ;Lu;0;L;;;;;N;;;;118CE;
+118AF;WARANG CITI CAPITAL LETTER UC;Lu;0;L;;;;;N;;;;118CF;
+118B0;WARANG CITI CAPITAL LETTER ENN;Lu;0;L;;;;;N;;;;118D0;
+118B1;WARANG CITI CAPITAL LETTER ODD;Lu;0;L;;;;;N;;;;118D1;
+118B2;WARANG CITI CAPITAL LETTER TTE;Lu;0;L;;;;;N;;;;118D2;
+118B3;WARANG CITI CAPITAL LETTER NUNG;Lu;0;L;;;;;N;;;;118D3;
+118B4;WARANG CITI CAPITAL LETTER DA;Lu;0;L;;;;;N;;;;118D4;
+118B5;WARANG CITI CAPITAL LETTER AT;Lu;0;L;;;;;N;;;;118D5;
+118B6;WARANG CITI CAPITAL LETTER AM;Lu;0;L;;;;;N;;;;118D6;
+118B7;WARANG CITI CAPITAL LETTER BU;Lu;0;L;;;;;N;;;;118D7;
+118B8;WARANG CITI CAPITAL LETTER PU;Lu;0;L;;;;;N;;;;118D8;
+118B9;WARANG CITI CAPITAL LETTER HIYO;Lu;0;L;;;;;N;;;;118D9;
+118BA;WARANG CITI CAPITAL LETTER HOLO;Lu;0;L;;;;;N;;;;118DA;
+118BB;WARANG CITI CAPITAL LETTER HORR;Lu;0;L;;;;;N;;;;118DB;
+118BC;WARANG CITI CAPITAL LETTER HAR;Lu;0;L;;;;;N;;;;118DC;
+118BD;WARANG CITI CAPITAL LETTER SSUU;Lu;0;L;;;;;N;;;;118DD;
+118BE;WARANG CITI CAPITAL LETTER SII;Lu;0;L;;;;;N;;;;118DE;
+118BF;WARANG CITI CAPITAL LETTER VIYO;Lu;0;L;;;;;N;;;;118DF;
+118C0;WARANG CITI SMALL LETTER NGAA;Ll;0;L;;;;;N;;;118A0;;118A0
+118C1;WARANG CITI SMALL LETTER A;Ll;0;L;;;;;N;;;118A1;;118A1
+118C2;WARANG CITI SMALL LETTER WI;Ll;0;L;;;;;N;;;118A2;;118A2
+118C3;WARANG CITI SMALL LETTER YU;Ll;0;L;;;;;N;;;118A3;;118A3
+118C4;WARANG CITI SMALL LETTER YA;Ll;0;L;;;;;N;;;118A4;;118A4
+118C5;WARANG CITI SMALL LETTER YO;Ll;0;L;;;;;N;;;118A5;;118A5
+118C6;WARANG CITI SMALL LETTER II;Ll;0;L;;;;;N;;;118A6;;118A6
+118C7;WARANG CITI SMALL LETTER UU;Ll;0;L;;;;;N;;;118A7;;118A7
+118C8;WARANG CITI SMALL LETTER E;Ll;0;L;;;;;N;;;118A8;;118A8
+118C9;WARANG CITI SMALL LETTER O;Ll;0;L;;;;;N;;;118A9;;118A9
+118CA;WARANG CITI SMALL LETTER ANG;Ll;0;L;;;;;N;;;118AA;;118AA
+118CB;WARANG CITI SMALL LETTER GA;Ll;0;L;;;;;N;;;118AB;;118AB
+118CC;WARANG CITI SMALL LETTER KO;Ll;0;L;;;;;N;;;118AC;;118AC
+118CD;WARANG CITI SMALL LETTER ENY;Ll;0;L;;;;;N;;;118AD;;118AD
+118CE;WARANG CITI SMALL LETTER YUJ;Ll;0;L;;;;;N;;;118AE;;118AE
+118CF;WARANG CITI SMALL LETTER UC;Ll;0;L;;;;;N;;;118AF;;118AF
+118D0;WARANG CITI SMALL LETTER ENN;Ll;0;L;;;;;N;;;118B0;;118B0
+118D1;WARANG CITI SMALL LETTER ODD;Ll;0;L;;;;;N;;;118B1;;118B1
+118D2;WARANG CITI SMALL LETTER TTE;Ll;0;L;;;;;N;;;118B2;;118B2
+118D3;WARANG CITI SMALL LETTER NUNG;Ll;0;L;;;;;N;;;118B3;;118B3
+118D4;WARANG CITI SMALL LETTER DA;Ll;0;L;;;;;N;;;118B4;;118B4
+118D5;WARANG CITI SMALL LETTER AT;Ll;0;L;;;;;N;;;118B5;;118B5
+118D6;WARANG CITI SMALL LETTER AM;Ll;0;L;;;;;N;;;118B6;;118B6
+118D7;WARANG CITI SMALL LETTER BU;Ll;0;L;;;;;N;;;118B7;;118B7
+118D8;WARANG CITI SMALL LETTER PU;Ll;0;L;;;;;N;;;118B8;;118B8
+118D9;WARANG CITI SMALL LETTER HIYO;Ll;0;L;;;;;N;;;118B9;;118B9
+118DA;WARANG CITI SMALL LETTER HOLO;Ll;0;L;;;;;N;;;118BA;;118BA
+118DB;WARANG CITI SMALL LETTER HORR;Ll;0;L;;;;;N;;;118BB;;118BB
+118DC;WARANG CITI SMALL LETTER HAR;Ll;0;L;;;;;N;;;118BC;;118BC
+118DD;WARANG CITI SMALL LETTER SSUU;Ll;0;L;;;;;N;;;118BD;;118BD
+118DE;WARANG CITI SMALL LETTER SII;Ll;0;L;;;;;N;;;118BE;;118BE
+118DF;WARANG CITI SMALL LETTER VIYO;Ll;0;L;;;;;N;;;118BF;;118BF
+118E0;WARANG CITI DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+118E1;WARANG CITI DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+118E2;WARANG CITI DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+118E3;WARANG CITI DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+118E4;WARANG CITI DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+118E5;WARANG CITI DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+118E6;WARANG CITI DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+118E7;WARANG CITI DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+118E8;WARANG CITI DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+118E9;WARANG CITI DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+118EA;WARANG CITI NUMBER TEN;No;0;L;;;;10;N;;;;;
+118EB;WARANG CITI NUMBER TWENTY;No;0;L;;;;20;N;;;;;
+118EC;WARANG CITI NUMBER THIRTY;No;0;L;;;;30;N;;;;;
+118ED;WARANG CITI NUMBER FORTY;No;0;L;;;;40;N;;;;;
+118EE;WARANG CITI NUMBER FIFTY;No;0;L;;;;50;N;;;;;
+118EF;WARANG CITI NUMBER SIXTY;No;0;L;;;;60;N;;;;;
+118F0;WARANG CITI NUMBER SEVENTY;No;0;L;;;;70;N;;;;;
+118F1;WARANG CITI NUMBER EIGHTY;No;0;L;;;;80;N;;;;;
+118F2;WARANG CITI NUMBER NINETY;No;0;L;;;;90;N;;;;;
+118FF;WARANG CITI OM;Lo;0;L;;;;;N;;;;;
+11A00;ZANABAZAR SQUARE LETTER A;Lo;0;L;;;;;N;;;;;
+11A01;ZANABAZAR SQUARE VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+11A02;ZANABAZAR SQUARE VOWEL SIGN UE;Mn;0;NSM;;;;;N;;;;;
+11A03;ZANABAZAR SQUARE VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+11A04;ZANABAZAR SQUARE VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+11A05;ZANABAZAR SQUARE VOWEL SIGN OE;Mn;0;NSM;;;;;N;;;;;
+11A06;ZANABAZAR SQUARE VOWEL SIGN O;Mn;0;NSM;;;;;N;;;;;
+11A07;ZANABAZAR SQUARE VOWEL SIGN AI;Mc;0;L;;;;;N;;;;;
+11A08;ZANABAZAR SQUARE VOWEL SIGN AU;Mc;0;L;;;;;N;;;;;
+11A09;ZANABAZAR SQUARE VOWEL SIGN REVERSED I;Mn;0;NSM;;;;;N;;;;;
+11A0A;ZANABAZAR SQUARE VOWEL LENGTH MARK;Mn;0;NSM;;;;;N;;;;;
+11A0B;ZANABAZAR SQUARE LETTER KA;Lo;0;L;;;;;N;;;;;
+11A0C;ZANABAZAR SQUARE LETTER KHA;Lo;0;L;;;;;N;;;;;
+11A0D;ZANABAZAR SQUARE LETTER GA;Lo;0;L;;;;;N;;;;;
+11A0E;ZANABAZAR SQUARE LETTER GHA;Lo;0;L;;;;;N;;;;;
+11A0F;ZANABAZAR SQUARE LETTER NGA;Lo;0;L;;;;;N;;;;;
+11A10;ZANABAZAR SQUARE LETTER CA;Lo;0;L;;;;;N;;;;;
+11A11;ZANABAZAR SQUARE LETTER CHA;Lo;0;L;;;;;N;;;;;
+11A12;ZANABAZAR SQUARE LETTER JA;Lo;0;L;;;;;N;;;;;
+11A13;ZANABAZAR SQUARE LETTER NYA;Lo;0;L;;;;;N;;;;;
+11A14;ZANABAZAR SQUARE LETTER TTA;Lo;0;L;;;;;N;;;;;
+11A15;ZANABAZAR SQUARE LETTER TTHA;Lo;0;L;;;;;N;;;;;
+11A16;ZANABAZAR SQUARE LETTER DDA;Lo;0;L;;;;;N;;;;;
+11A17;ZANABAZAR SQUARE LETTER DDHA;Lo;0;L;;;;;N;;;;;
+11A18;ZANABAZAR SQUARE LETTER NNA;Lo;0;L;;;;;N;;;;;
+11A19;ZANABAZAR SQUARE LETTER TA;Lo;0;L;;;;;N;;;;;
+11A1A;ZANABAZAR SQUARE LETTER THA;Lo;0;L;;;;;N;;;;;
+11A1B;ZANABAZAR SQUARE LETTER DA;Lo;0;L;;;;;N;;;;;
+11A1C;ZANABAZAR SQUARE LETTER DHA;Lo;0;L;;;;;N;;;;;
+11A1D;ZANABAZAR SQUARE LETTER NA;Lo;0;L;;;;;N;;;;;
+11A1E;ZANABAZAR SQUARE LETTER PA;Lo;0;L;;;;;N;;;;;
+11A1F;ZANABAZAR SQUARE LETTER PHA;Lo;0;L;;;;;N;;;;;
+11A20;ZANABAZAR SQUARE LETTER BA;Lo;0;L;;;;;N;;;;;
+11A21;ZANABAZAR SQUARE LETTER BHA;Lo;0;L;;;;;N;;;;;
+11A22;ZANABAZAR SQUARE LETTER MA;Lo;0;L;;;;;N;;;;;
+11A23;ZANABAZAR SQUARE LETTER TSA;Lo;0;L;;;;;N;;;;;
+11A24;ZANABAZAR SQUARE LETTER TSHA;Lo;0;L;;;;;N;;;;;
+11A25;ZANABAZAR SQUARE LETTER DZA;Lo;0;L;;;;;N;;;;;
+11A26;ZANABAZAR SQUARE LETTER DZHA;Lo;0;L;;;;;N;;;;;
+11A27;ZANABAZAR SQUARE LETTER ZHA;Lo;0;L;;;;;N;;;;;
+11A28;ZANABAZAR SQUARE LETTER ZA;Lo;0;L;;;;;N;;;;;
+11A29;ZANABAZAR SQUARE LETTER -A;Lo;0;L;;;;;N;;;;;
+11A2A;ZANABAZAR SQUARE LETTER YA;Lo;0;L;;;;;N;;;;;
+11A2B;ZANABAZAR SQUARE LETTER RA;Lo;0;L;;;;;N;;;;;
+11A2C;ZANABAZAR SQUARE LETTER LA;Lo;0;L;;;;;N;;;;;
+11A2D;ZANABAZAR SQUARE LETTER VA;Lo;0;L;;;;;N;;;;;
+11A2E;ZANABAZAR SQUARE LETTER SHA;Lo;0;L;;;;;N;;;;;
+11A2F;ZANABAZAR SQUARE LETTER SSA;Lo;0;L;;;;;N;;;;;
+11A30;ZANABAZAR SQUARE LETTER SA;Lo;0;L;;;;;N;;;;;
+11A31;ZANABAZAR SQUARE LETTER HA;Lo;0;L;;;;;N;;;;;
+11A32;ZANABAZAR SQUARE LETTER KSSA;Lo;0;L;;;;;N;;;;;
+11A33;ZANABAZAR SQUARE FINAL CONSONANT MARK;Mn;0;NSM;;;;;N;;;;;
+11A34;ZANABAZAR SQUARE SIGN VIRAMA;Mn;9;NSM;;;;;N;;;;;
+11A35;ZANABAZAR SQUARE SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+11A36;ZANABAZAR SQUARE SIGN CANDRABINDU WITH ORNAMENT;Mn;0;NSM;;;;;N;;;;;
+11A37;ZANABAZAR SQUARE SIGN CANDRA WITH ORNAMENT;Mn;0;NSM;;;;;N;;;;;
+11A38;ZANABAZAR SQUARE SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+11A39;ZANABAZAR SQUARE SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+11A3A;ZANABAZAR SQUARE CLUSTER-INITIAL LETTER RA;Lo;0;L;;;;;N;;;;;
+11A3B;ZANABAZAR SQUARE CLUSTER-FINAL LETTER YA;Mn;0;NSM;;;;;N;;;;;
+11A3C;ZANABAZAR SQUARE CLUSTER-FINAL LETTER RA;Mn;0;NSM;;;;;N;;;;;
+11A3D;ZANABAZAR SQUARE CLUSTER-FINAL LETTER LA;Mn;0;NSM;;;;;N;;;;;
+11A3E;ZANABAZAR SQUARE CLUSTER-FINAL LETTER VA;Mn;0;NSM;;;;;N;;;;;
+11A3F;ZANABAZAR SQUARE INITIAL HEAD MARK;Po;0;L;;;;;N;;;;;
+11A40;ZANABAZAR SQUARE CLOSING HEAD MARK;Po;0;L;;;;;N;;;;;
+11A41;ZANABAZAR SQUARE MARK TSHEG;Po;0;L;;;;;N;;;;;
+11A42;ZANABAZAR SQUARE MARK SHAD;Po;0;L;;;;;N;;;;;
+11A43;ZANABAZAR SQUARE MARK DOUBLE SHAD;Po;0;L;;;;;N;;;;;
+11A44;ZANABAZAR SQUARE MARK LONG TSHEG;Po;0;L;;;;;N;;;;;
+11A45;ZANABAZAR SQUARE INITIAL DOUBLE-LINED HEAD MARK;Po;0;L;;;;;N;;;;;
+11A46;ZANABAZAR SQUARE CLOSING DOUBLE-LINED HEAD MARK;Po;0;L;;;;;N;;;;;
+11A47;ZANABAZAR SQUARE SUBJOINER;Mn;9;NSM;;;;;N;;;;;
+11A50;SOYOMBO LETTER A;Lo;0;L;;;;;N;;;;;
+11A51;SOYOMBO VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+11A52;SOYOMBO VOWEL SIGN UE;Mn;0;NSM;;;;;N;;;;;
+11A53;SOYOMBO VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+11A54;SOYOMBO VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+11A55;SOYOMBO VOWEL SIGN O;Mn;0;NSM;;;;;N;;;;;
+11A56;SOYOMBO VOWEL SIGN OE;Mn;0;NSM;;;;;N;;;;;
+11A57;SOYOMBO VOWEL SIGN AI;Mc;0;L;;;;;N;;;;;
+11A58;SOYOMBO VOWEL SIGN AU;Mc;0;L;;;;;N;;;;;
+11A59;SOYOMBO VOWEL SIGN VOCALIC R;Mn;0;NSM;;;;;N;;;;;
+11A5A;SOYOMBO VOWEL SIGN VOCALIC L;Mn;0;NSM;;;;;N;;;;;
+11A5B;SOYOMBO VOWEL LENGTH MARK;Mn;0;NSM;;;;;N;;;;;
+11A5C;SOYOMBO LETTER KA;Lo;0;L;;;;;N;;;;;
+11A5D;SOYOMBO LETTER KHA;Lo;0;L;;;;;N;;;;;
+11A5E;SOYOMBO LETTER GA;Lo;0;L;;;;;N;;;;;
+11A5F;SOYOMBO LETTER GHA;Lo;0;L;;;;;N;;;;;
+11A60;SOYOMBO LETTER NGA;Lo;0;L;;;;;N;;;;;
+11A61;SOYOMBO LETTER CA;Lo;0;L;;;;;N;;;;;
+11A62;SOYOMBO LETTER CHA;Lo;0;L;;;;;N;;;;;
+11A63;SOYOMBO LETTER JA;Lo;0;L;;;;;N;;;;;
+11A64;SOYOMBO LETTER JHA;Lo;0;L;;;;;N;;;;;
+11A65;SOYOMBO LETTER NYA;Lo;0;L;;;;;N;;;;;
+11A66;SOYOMBO LETTER TTA;Lo;0;L;;;;;N;;;;;
+11A67;SOYOMBO LETTER TTHA;Lo;0;L;;;;;N;;;;;
+11A68;SOYOMBO LETTER DDA;Lo;0;L;;;;;N;;;;;
+11A69;SOYOMBO LETTER DDHA;Lo;0;L;;;;;N;;;;;
+11A6A;SOYOMBO LETTER NNA;Lo;0;L;;;;;N;;;;;
+11A6B;SOYOMBO LETTER TA;Lo;0;L;;;;;N;;;;;
+11A6C;SOYOMBO LETTER THA;Lo;0;L;;;;;N;;;;;
+11A6D;SOYOMBO LETTER DA;Lo;0;L;;;;;N;;;;;
+11A6E;SOYOMBO LETTER DHA;Lo;0;L;;;;;N;;;;;
+11A6F;SOYOMBO LETTER NA;Lo;0;L;;;;;N;;;;;
+11A70;SOYOMBO LETTER PA;Lo;0;L;;;;;N;;;;;
+11A71;SOYOMBO LETTER PHA;Lo;0;L;;;;;N;;;;;
+11A72;SOYOMBO LETTER BA;Lo;0;L;;;;;N;;;;;
+11A73;SOYOMBO LETTER BHA;Lo;0;L;;;;;N;;;;;
+11A74;SOYOMBO LETTER MA;Lo;0;L;;;;;N;;;;;
+11A75;SOYOMBO LETTER TSA;Lo;0;L;;;;;N;;;;;
+11A76;SOYOMBO LETTER TSHA;Lo;0;L;;;;;N;;;;;
+11A77;SOYOMBO LETTER DZA;Lo;0;L;;;;;N;;;;;
+11A78;SOYOMBO LETTER ZHA;Lo;0;L;;;;;N;;;;;
+11A79;SOYOMBO LETTER ZA;Lo;0;L;;;;;N;;;;;
+11A7A;SOYOMBO LETTER -A;Lo;0;L;;;;;N;;;;;
+11A7B;SOYOMBO LETTER YA;Lo;0;L;;;;;N;;;;;
+11A7C;SOYOMBO LETTER RA;Lo;0;L;;;;;N;;;;;
+11A7D;SOYOMBO LETTER LA;Lo;0;L;;;;;N;;;;;
+11A7E;SOYOMBO LETTER VA;Lo;0;L;;;;;N;;;;;
+11A7F;SOYOMBO LETTER SHA;Lo;0;L;;;;;N;;;;;
+11A80;SOYOMBO LETTER SSA;Lo;0;L;;;;;N;;;;;
+11A81;SOYOMBO LETTER SA;Lo;0;L;;;;;N;;;;;
+11A82;SOYOMBO LETTER HA;Lo;0;L;;;;;N;;;;;
+11A83;SOYOMBO LETTER KSSA;Lo;0;L;;;;;N;;;;;
+11A86;SOYOMBO CLUSTER-INITIAL LETTER RA;Lo;0;L;;;;;N;;;;;
+11A87;SOYOMBO CLUSTER-INITIAL LETTER LA;Lo;0;L;;;;;N;;;;;
+11A88;SOYOMBO CLUSTER-INITIAL LETTER SHA;Lo;0;L;;;;;N;;;;;
+11A89;SOYOMBO CLUSTER-INITIAL LETTER SA;Lo;0;L;;;;;N;;;;;
+11A8A;SOYOMBO FINAL CONSONANT SIGN G;Mn;0;NSM;;;;;N;;;;;
+11A8B;SOYOMBO FINAL CONSONANT SIGN K;Mn;0;NSM;;;;;N;;;;;
+11A8C;SOYOMBO FINAL CONSONANT SIGN NG;Mn;0;NSM;;;;;N;;;;;
+11A8D;SOYOMBO FINAL CONSONANT SIGN D;Mn;0;NSM;;;;;N;;;;;
+11A8E;SOYOMBO FINAL CONSONANT SIGN N;Mn;0;NSM;;;;;N;;;;;
+11A8F;SOYOMBO FINAL CONSONANT SIGN B;Mn;0;NSM;;;;;N;;;;;
+11A90;SOYOMBO FINAL CONSONANT SIGN M;Mn;0;NSM;;;;;N;;;;;
+11A91;SOYOMBO FINAL CONSONANT SIGN R;Mn;0;NSM;;;;;N;;;;;
+11A92;SOYOMBO FINAL CONSONANT SIGN L;Mn;0;NSM;;;;;N;;;;;
+11A93;SOYOMBO FINAL CONSONANT SIGN SH;Mn;0;NSM;;;;;N;;;;;
+11A94;SOYOMBO FINAL CONSONANT SIGN S;Mn;0;NSM;;;;;N;;;;;
+11A95;SOYOMBO FINAL CONSONANT SIGN -A;Mn;0;NSM;;;;;N;;;;;
+11A96;SOYOMBO SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+11A97;SOYOMBO SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+11A98;SOYOMBO GEMINATION MARK;Mn;0;NSM;;;;;N;;;;;
+11A99;SOYOMBO SUBJOINER;Mn;9;NSM;;;;;N;;;;;
+11A9A;SOYOMBO MARK TSHEG;Po;0;L;;;;;N;;;;;
+11A9B;SOYOMBO MARK SHAD;Po;0;L;;;;;N;;;;;
+11A9C;SOYOMBO MARK DOUBLE SHAD;Po;0;L;;;;;N;;;;;
+11A9E;SOYOMBO HEAD MARK WITH MOON AND SUN AND TRIPLE FLAME;Po;0;L;;;;;N;;;;;
+11A9F;SOYOMBO HEAD MARK WITH MOON AND SUN AND FLAME;Po;0;L;;;;;N;;;;;
+11AA0;SOYOMBO HEAD MARK WITH MOON AND SUN;Po;0;L;;;;;N;;;;;
+11AA1;SOYOMBO TERMINAL MARK-1;Po;0;L;;;;;N;;;;;
+11AA2;SOYOMBO TERMINAL MARK-2;Po;0;L;;;;;N;;;;;
+11AC0;PAU CIN HAU LETTER PA;Lo;0;L;;;;;N;;;;;
+11AC1;PAU CIN HAU LETTER KA;Lo;0;L;;;;;N;;;;;
+11AC2;PAU CIN HAU LETTER LA;Lo;0;L;;;;;N;;;;;
+11AC3;PAU CIN HAU LETTER MA;Lo;0;L;;;;;N;;;;;
+11AC4;PAU CIN HAU LETTER DA;Lo;0;L;;;;;N;;;;;
+11AC5;PAU CIN HAU LETTER ZA;Lo;0;L;;;;;N;;;;;
+11AC6;PAU CIN HAU LETTER VA;Lo;0;L;;;;;N;;;;;
+11AC7;PAU CIN HAU LETTER NGA;Lo;0;L;;;;;N;;;;;
+11AC8;PAU CIN HAU LETTER HA;Lo;0;L;;;;;N;;;;;
+11AC9;PAU CIN HAU LETTER GA;Lo;0;L;;;;;N;;;;;
+11ACA;PAU CIN HAU LETTER KHA;Lo;0;L;;;;;N;;;;;
+11ACB;PAU CIN HAU LETTER SA;Lo;0;L;;;;;N;;;;;
+11ACC;PAU CIN HAU LETTER BA;Lo;0;L;;;;;N;;;;;
+11ACD;PAU CIN HAU LETTER CA;Lo;0;L;;;;;N;;;;;
+11ACE;PAU CIN HAU LETTER TA;Lo;0;L;;;;;N;;;;;
+11ACF;PAU CIN HAU LETTER THA;Lo;0;L;;;;;N;;;;;
+11AD0;PAU CIN HAU LETTER NA;Lo;0;L;;;;;N;;;;;
+11AD1;PAU CIN HAU LETTER PHA;Lo;0;L;;;;;N;;;;;
+11AD2;PAU CIN HAU LETTER RA;Lo;0;L;;;;;N;;;;;
+11AD3;PAU CIN HAU LETTER FA;Lo;0;L;;;;;N;;;;;
+11AD4;PAU CIN HAU LETTER CHA;Lo;0;L;;;;;N;;;;;
+11AD5;PAU CIN HAU LETTER A;Lo;0;L;;;;;N;;;;;
+11AD6;PAU CIN HAU LETTER E;Lo;0;L;;;;;N;;;;;
+11AD7;PAU CIN HAU LETTER I;Lo;0;L;;;;;N;;;;;
+11AD8;PAU CIN HAU LETTER O;Lo;0;L;;;;;N;;;;;
+11AD9;PAU CIN HAU LETTER U;Lo;0;L;;;;;N;;;;;
+11ADA;PAU CIN HAU LETTER UA;Lo;0;L;;;;;N;;;;;
+11ADB;PAU CIN HAU LETTER IA;Lo;0;L;;;;;N;;;;;
+11ADC;PAU CIN HAU LETTER FINAL P;Lo;0;L;;;;;N;;;;;
+11ADD;PAU CIN HAU LETTER FINAL K;Lo;0;L;;;;;N;;;;;
+11ADE;PAU CIN HAU LETTER FINAL T;Lo;0;L;;;;;N;;;;;
+11ADF;PAU CIN HAU LETTER FINAL M;Lo;0;L;;;;;N;;;;;
+11AE0;PAU CIN HAU LETTER FINAL N;Lo;0;L;;;;;N;;;;;
+11AE1;PAU CIN HAU LETTER FINAL L;Lo;0;L;;;;;N;;;;;
+11AE2;PAU CIN HAU LETTER FINAL W;Lo;0;L;;;;;N;;;;;
+11AE3;PAU CIN HAU LETTER FINAL NG;Lo;0;L;;;;;N;;;;;
+11AE4;PAU CIN HAU LETTER FINAL Y;Lo;0;L;;;;;N;;;;;
+11AE5;PAU CIN HAU RISING TONE LONG;Lo;0;L;;;;;N;;;;;
+11AE6;PAU CIN HAU RISING TONE;Lo;0;L;;;;;N;;;;;
+11AE7;PAU CIN HAU SANDHI GLOTTAL STOP;Lo;0;L;;;;;N;;;;;
+11AE8;PAU CIN HAU RISING TONE LONG FINAL;Lo;0;L;;;;;N;;;;;
+11AE9;PAU CIN HAU RISING TONE FINAL;Lo;0;L;;;;;N;;;;;
+11AEA;PAU CIN HAU SANDHI GLOTTAL STOP FINAL;Lo;0;L;;;;;N;;;;;
+11AEB;PAU CIN HAU SANDHI TONE LONG;Lo;0;L;;;;;N;;;;;
+11AEC;PAU CIN HAU SANDHI TONE;Lo;0;L;;;;;N;;;;;
+11AED;PAU CIN HAU SANDHI TONE LONG FINAL;Lo;0;L;;;;;N;;;;;
+11AEE;PAU CIN HAU SANDHI TONE FINAL;Lo;0;L;;;;;N;;;;;
+11AEF;PAU CIN HAU MID-LEVEL TONE;Lo;0;L;;;;;N;;;;;
+11AF0;PAU CIN HAU GLOTTAL STOP VARIANT;Lo;0;L;;;;;N;;;;;
+11AF1;PAU CIN HAU MID-LEVEL TONE LONG FINAL;Lo;0;L;;;;;N;;;;;
+11AF2;PAU CIN HAU MID-LEVEL TONE FINAL;Lo;0;L;;;;;N;;;;;
+11AF3;PAU CIN HAU LOW-FALLING TONE LONG;Lo;0;L;;;;;N;;;;;
+11AF4;PAU CIN HAU LOW-FALLING TONE;Lo;0;L;;;;;N;;;;;
+11AF5;PAU CIN HAU GLOTTAL STOP;Lo;0;L;;;;;N;;;;;
+11AF6;PAU CIN HAU LOW-FALLING TONE LONG FINAL;Lo;0;L;;;;;N;;;;;
+11AF7;PAU CIN HAU LOW-FALLING TONE FINAL;Lo;0;L;;;;;N;;;;;
+11AF8;PAU CIN HAU GLOTTAL STOP FINAL;Lo;0;L;;;;;N;;;;;
+11C00;BHAIKSUKI LETTER A;Lo;0;L;;;;;N;;;;;
+11C01;BHAIKSUKI LETTER AA;Lo;0;L;;;;;N;;;;;
+11C02;BHAIKSUKI LETTER I;Lo;0;L;;;;;N;;;;;
+11C03;BHAIKSUKI LETTER II;Lo;0;L;;;;;N;;;;;
+11C04;BHAIKSUKI LETTER U;Lo;0;L;;;;;N;;;;;
+11C05;BHAIKSUKI LETTER UU;Lo;0;L;;;;;N;;;;;
+11C06;BHAIKSUKI LETTER VOCALIC R;Lo;0;L;;;;;N;;;;;
+11C07;BHAIKSUKI LETTER VOCALIC RR;Lo;0;L;;;;;N;;;;;
+11C08;BHAIKSUKI LETTER VOCALIC L;Lo;0;L;;;;;N;;;;;
+11C0A;BHAIKSUKI LETTER E;Lo;0;L;;;;;N;;;;;
+11C0B;BHAIKSUKI LETTER AI;Lo;0;L;;;;;N;;;;;
+11C0C;BHAIKSUKI LETTER O;Lo;0;L;;;;;N;;;;;
+11C0D;BHAIKSUKI LETTER AU;Lo;0;L;;;;;N;;;;;
+11C0E;BHAIKSUKI LETTER KA;Lo;0;L;;;;;N;;;;;
+11C0F;BHAIKSUKI LETTER KHA;Lo;0;L;;;;;N;;;;;
+11C10;BHAIKSUKI LETTER GA;Lo;0;L;;;;;N;;;;;
+11C11;BHAIKSUKI LETTER GHA;Lo;0;L;;;;;N;;;;;
+11C12;BHAIKSUKI LETTER NGA;Lo;0;L;;;;;N;;;;;
+11C13;BHAIKSUKI LETTER CA;Lo;0;L;;;;;N;;;;;
+11C14;BHAIKSUKI LETTER CHA;Lo;0;L;;;;;N;;;;;
+11C15;BHAIKSUKI LETTER JA;Lo;0;L;;;;;N;;;;;
+11C16;BHAIKSUKI LETTER JHA;Lo;0;L;;;;;N;;;;;
+11C17;BHAIKSUKI LETTER NYA;Lo;0;L;;;;;N;;;;;
+11C18;BHAIKSUKI LETTER TTA;Lo;0;L;;;;;N;;;;;
+11C19;BHAIKSUKI LETTER TTHA;Lo;0;L;;;;;N;;;;;
+11C1A;BHAIKSUKI LETTER DDA;Lo;0;L;;;;;N;;;;;
+11C1B;BHAIKSUKI LETTER DDHA;Lo;0;L;;;;;N;;;;;
+11C1C;BHAIKSUKI LETTER NNA;Lo;0;L;;;;;N;;;;;
+11C1D;BHAIKSUKI LETTER TA;Lo;0;L;;;;;N;;;;;
+11C1E;BHAIKSUKI LETTER THA;Lo;0;L;;;;;N;;;;;
+11C1F;BHAIKSUKI LETTER DA;Lo;0;L;;;;;N;;;;;
+11C20;BHAIKSUKI LETTER DHA;Lo;0;L;;;;;N;;;;;
+11C21;BHAIKSUKI LETTER NA;Lo;0;L;;;;;N;;;;;
+11C22;BHAIKSUKI LETTER PA;Lo;0;L;;;;;N;;;;;
+11C23;BHAIKSUKI LETTER PHA;Lo;0;L;;;;;N;;;;;
+11C24;BHAIKSUKI LETTER BA;Lo;0;L;;;;;N;;;;;
+11C25;BHAIKSUKI LETTER BHA;Lo;0;L;;;;;N;;;;;
+11C26;BHAIKSUKI LETTER MA;Lo;0;L;;;;;N;;;;;
+11C27;BHAIKSUKI LETTER YA;Lo;0;L;;;;;N;;;;;
+11C28;BHAIKSUKI LETTER RA;Lo;0;L;;;;;N;;;;;
+11C29;BHAIKSUKI LETTER LA;Lo;0;L;;;;;N;;;;;
+11C2A;BHAIKSUKI LETTER VA;Lo;0;L;;;;;N;;;;;
+11C2B;BHAIKSUKI LETTER SHA;Lo;0;L;;;;;N;;;;;
+11C2C;BHAIKSUKI LETTER SSA;Lo;0;L;;;;;N;;;;;
+11C2D;BHAIKSUKI LETTER SA;Lo;0;L;;;;;N;;;;;
+11C2E;BHAIKSUKI LETTER HA;Lo;0;L;;;;;N;;;;;
+11C2F;BHAIKSUKI VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+11C30;BHAIKSUKI VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+11C31;BHAIKSUKI VOWEL SIGN II;Mn;0;NSM;;;;;N;;;;;
+11C32;BHAIKSUKI VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+11C33;BHAIKSUKI VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+11C34;BHAIKSUKI VOWEL SIGN VOCALIC R;Mn;0;NSM;;;;;N;;;;;
+11C35;BHAIKSUKI VOWEL SIGN VOCALIC RR;Mn;0;NSM;;;;;N;;;;;
+11C36;BHAIKSUKI VOWEL SIGN VOCALIC L;Mn;0;NSM;;;;;N;;;;;
+11C38;BHAIKSUKI VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+11C39;BHAIKSUKI VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+11C3A;BHAIKSUKI VOWEL SIGN O;Mn;0;NSM;;;;;N;;;;;
+11C3B;BHAIKSUKI VOWEL SIGN AU;Mn;0;NSM;;;;;N;;;;;
+11C3C;BHAIKSUKI SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+11C3D;BHAIKSUKI SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+11C3E;BHAIKSUKI SIGN VISARGA;Mc;0;L;;;;;N;;;;;
+11C3F;BHAIKSUKI SIGN VIRAMA;Mn;9;L;;;;;N;;;;;
+11C40;BHAIKSUKI SIGN AVAGRAHA;Lo;0;L;;;;;N;;;;;
+11C41;BHAIKSUKI DANDA;Po;0;L;;;;;N;;;;;
+11C42;BHAIKSUKI DOUBLE DANDA;Po;0;L;;;;;N;;;;;
+11C43;BHAIKSUKI WORD SEPARATOR;Po;0;L;;;;;N;;;;;
+11C44;BHAIKSUKI GAP FILLER-1;Po;0;L;;;;;N;;;;;
+11C45;BHAIKSUKI GAP FILLER-2;Po;0;L;;;;;N;;;;;
+11C50;BHAIKSUKI DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+11C51;BHAIKSUKI DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+11C52;BHAIKSUKI DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+11C53;BHAIKSUKI DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+11C54;BHAIKSUKI DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+11C55;BHAIKSUKI DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+11C56;BHAIKSUKI DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+11C57;BHAIKSUKI DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+11C58;BHAIKSUKI DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+11C59;BHAIKSUKI DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+11C5A;BHAIKSUKI NUMBER ONE;No;0;L;;;;1;N;;;;;
+11C5B;BHAIKSUKI NUMBER TWO;No;0;L;;;;2;N;;;;;
+11C5C;BHAIKSUKI NUMBER THREE;No;0;L;;;;3;N;;;;;
+11C5D;BHAIKSUKI NUMBER FOUR;No;0;L;;;;4;N;;;;;
+11C5E;BHAIKSUKI NUMBER FIVE;No;0;L;;;;5;N;;;;;
+11C5F;BHAIKSUKI NUMBER SIX;No;0;L;;;;6;N;;;;;
+11C60;BHAIKSUKI NUMBER SEVEN;No;0;L;;;;7;N;;;;;
+11C61;BHAIKSUKI NUMBER EIGHT;No;0;L;;;;8;N;;;;;
+11C62;BHAIKSUKI NUMBER NINE;No;0;L;;;;9;N;;;;;
+11C63;BHAIKSUKI NUMBER TEN;No;0;L;;;;10;N;;;;;
+11C64;BHAIKSUKI NUMBER TWENTY;No;0;L;;;;20;N;;;;;
+11C65;BHAIKSUKI NUMBER THIRTY;No;0;L;;;;30;N;;;;;
+11C66;BHAIKSUKI NUMBER FORTY;No;0;L;;;;40;N;;;;;
+11C67;BHAIKSUKI NUMBER FIFTY;No;0;L;;;;50;N;;;;;
+11C68;BHAIKSUKI NUMBER SIXTY;No;0;L;;;;60;N;;;;;
+11C69;BHAIKSUKI NUMBER SEVENTY;No;0;L;;;;70;N;;;;;
+11C6A;BHAIKSUKI NUMBER EIGHTY;No;0;L;;;;80;N;;;;;
+11C6B;BHAIKSUKI NUMBER NINETY;No;0;L;;;;90;N;;;;;
+11C6C;BHAIKSUKI HUNDREDS UNIT MARK;No;0;L;;;;100;N;;;;;
+11C70;MARCHEN HEAD MARK;Po;0;L;;;;;N;;;;;
+11C71;MARCHEN MARK SHAD;Po;0;L;;;;;N;;;;;
+11C72;MARCHEN LETTER KA;Lo;0;L;;;;;N;;;;;
+11C73;MARCHEN LETTER KHA;Lo;0;L;;;;;N;;;;;
+11C74;MARCHEN LETTER GA;Lo;0;L;;;;;N;;;;;
+11C75;MARCHEN LETTER NGA;Lo;0;L;;;;;N;;;;;
+11C76;MARCHEN LETTER CA;Lo;0;L;;;;;N;;;;;
+11C77;MARCHEN LETTER CHA;Lo;0;L;;;;;N;;;;;
+11C78;MARCHEN LETTER JA;Lo;0;L;;;;;N;;;;;
+11C79;MARCHEN LETTER NYA;Lo;0;L;;;;;N;;;;;
+11C7A;MARCHEN LETTER TA;Lo;0;L;;;;;N;;;;;
+11C7B;MARCHEN LETTER THA;Lo;0;L;;;;;N;;;;;
+11C7C;MARCHEN LETTER DA;Lo;0;L;;;;;N;;;;;
+11C7D;MARCHEN LETTER NA;Lo;0;L;;;;;N;;;;;
+11C7E;MARCHEN LETTER PA;Lo;0;L;;;;;N;;;;;
+11C7F;MARCHEN LETTER PHA;Lo;0;L;;;;;N;;;;;
+11C80;MARCHEN LETTER BA;Lo;0;L;;;;;N;;;;;
+11C81;MARCHEN LETTER MA;Lo;0;L;;;;;N;;;;;
+11C82;MARCHEN LETTER TSA;Lo;0;L;;;;;N;;;;;
+11C83;MARCHEN LETTER TSHA;Lo;0;L;;;;;N;;;;;
+11C84;MARCHEN LETTER DZA;Lo;0;L;;;;;N;;;;;
+11C85;MARCHEN LETTER WA;Lo;0;L;;;;;N;;;;;
+11C86;MARCHEN LETTER ZHA;Lo;0;L;;;;;N;;;;;
+11C87;MARCHEN LETTER ZA;Lo;0;L;;;;;N;;;;;
+11C88;MARCHEN LETTER -A;Lo;0;L;;;;;N;;;;;
+11C89;MARCHEN LETTER YA;Lo;0;L;;;;;N;;;;;
+11C8A;MARCHEN LETTER RA;Lo;0;L;;;;;N;;;;;
+11C8B;MARCHEN LETTER LA;Lo;0;L;;;;;N;;;;;
+11C8C;MARCHEN LETTER SHA;Lo;0;L;;;;;N;;;;;
+11C8D;MARCHEN LETTER SA;Lo;0;L;;;;;N;;;;;
+11C8E;MARCHEN LETTER HA;Lo;0;L;;;;;N;;;;;
+11C8F;MARCHEN LETTER A;Lo;0;L;;;;;N;;;;;
+11C92;MARCHEN SUBJOINED LETTER KA;Mn;0;NSM;;;;;N;;;;;
+11C93;MARCHEN SUBJOINED LETTER KHA;Mn;0;NSM;;;;;N;;;;;
+11C94;MARCHEN SUBJOINED LETTER GA;Mn;0;NSM;;;;;N;;;;;
+11C95;MARCHEN SUBJOINED LETTER NGA;Mn;0;NSM;;;;;N;;;;;
+11C96;MARCHEN SUBJOINED LETTER CA;Mn;0;NSM;;;;;N;;;;;
+11C97;MARCHEN SUBJOINED LETTER CHA;Mn;0;NSM;;;;;N;;;;;
+11C98;MARCHEN SUBJOINED LETTER JA;Mn;0;NSM;;;;;N;;;;;
+11C99;MARCHEN SUBJOINED LETTER NYA;Mn;0;NSM;;;;;N;;;;;
+11C9A;MARCHEN SUBJOINED LETTER TA;Mn;0;NSM;;;;;N;;;;;
+11C9B;MARCHEN SUBJOINED LETTER THA;Mn;0;NSM;;;;;N;;;;;
+11C9C;MARCHEN SUBJOINED LETTER DA;Mn;0;NSM;;;;;N;;;;;
+11C9D;MARCHEN SUBJOINED LETTER NA;Mn;0;NSM;;;;;N;;;;;
+11C9E;MARCHEN SUBJOINED LETTER PA;Mn;0;NSM;;;;;N;;;;;
+11C9F;MARCHEN SUBJOINED LETTER PHA;Mn;0;NSM;;;;;N;;;;;
+11CA0;MARCHEN SUBJOINED LETTER BA;Mn;0;NSM;;;;;N;;;;;
+11CA1;MARCHEN SUBJOINED LETTER MA;Mn;0;NSM;;;;;N;;;;;
+11CA2;MARCHEN SUBJOINED LETTER TSA;Mn;0;NSM;;;;;N;;;;;
+11CA3;MARCHEN SUBJOINED LETTER TSHA;Mn;0;NSM;;;;;N;;;;;
+11CA4;MARCHEN SUBJOINED LETTER DZA;Mn;0;NSM;;;;;N;;;;;
+11CA5;MARCHEN SUBJOINED LETTER WA;Mn;0;NSM;;;;;N;;;;;
+11CA6;MARCHEN SUBJOINED LETTER ZHA;Mn;0;NSM;;;;;N;;;;;
+11CA7;MARCHEN SUBJOINED LETTER ZA;Mn;0;NSM;;;;;N;;;;;
+11CA9;MARCHEN SUBJOINED LETTER YA;Mc;0;L;;;;;N;;;;;
+11CAA;MARCHEN SUBJOINED LETTER RA;Mn;0;NSM;;;;;N;;;;;
+11CAB;MARCHEN SUBJOINED LETTER LA;Mn;0;NSM;;;;;N;;;;;
+11CAC;MARCHEN SUBJOINED LETTER SHA;Mn;0;NSM;;;;;N;;;;;
+11CAD;MARCHEN SUBJOINED LETTER SA;Mn;0;NSM;;;;;N;;;;;
+11CAE;MARCHEN SUBJOINED LETTER HA;Mn;0;NSM;;;;;N;;;;;
+11CAF;MARCHEN SUBJOINED LETTER A;Mn;0;NSM;;;;;N;;;;;
+11CB0;MARCHEN VOWEL SIGN AA;Mn;0;NSM;;;;;N;;;;;
+11CB1;MARCHEN VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+11CB2;MARCHEN VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+11CB3;MARCHEN VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+11CB4;MARCHEN VOWEL SIGN O;Mc;0;L;;;;;N;;;;;
+11CB5;MARCHEN SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+11CB6;MARCHEN SIGN CANDRABINDU;Mn;0;NSM;;;;;N;;;;;
+11D00;MASARAM GONDI LETTER A;Lo;0;L;;;;;N;;;;;
+11D01;MASARAM GONDI LETTER AA;Lo;0;L;;;;;N;;;;;
+11D02;MASARAM GONDI LETTER I;Lo;0;L;;;;;N;;;;;
+11D03;MASARAM GONDI LETTER II;Lo;0;L;;;;;N;;;;;
+11D04;MASARAM GONDI LETTER U;Lo;0;L;;;;;N;;;;;
+11D05;MASARAM GONDI LETTER UU;Lo;0;L;;;;;N;;;;;
+11D06;MASARAM GONDI LETTER E;Lo;0;L;;;;;N;;;;;
+11D08;MASARAM GONDI LETTER AI;Lo;0;L;;;;;N;;;;;
+11D09;MASARAM GONDI LETTER O;Lo;0;L;;;;;N;;;;;
+11D0B;MASARAM GONDI LETTER AU;Lo;0;L;;;;;N;;;;;
+11D0C;MASARAM GONDI LETTER KA;Lo;0;L;;;;;N;;;;;
+11D0D;MASARAM GONDI LETTER KHA;Lo;0;L;;;;;N;;;;;
+11D0E;MASARAM GONDI LETTER GA;Lo;0;L;;;;;N;;;;;
+11D0F;MASARAM GONDI LETTER GHA;Lo;0;L;;;;;N;;;;;
+11D10;MASARAM GONDI LETTER NGA;Lo;0;L;;;;;N;;;;;
+11D11;MASARAM GONDI LETTER CA;Lo;0;L;;;;;N;;;;;
+11D12;MASARAM GONDI LETTER CHA;Lo;0;L;;;;;N;;;;;
+11D13;MASARAM GONDI LETTER JA;Lo;0;L;;;;;N;;;;;
+11D14;MASARAM GONDI LETTER JHA;Lo;0;L;;;;;N;;;;;
+11D15;MASARAM GONDI LETTER NYA;Lo;0;L;;;;;N;;;;;
+11D16;MASARAM GONDI LETTER TTA;Lo;0;L;;;;;N;;;;;
+11D17;MASARAM GONDI LETTER TTHA;Lo;0;L;;;;;N;;;;;
+11D18;MASARAM GONDI LETTER DDA;Lo;0;L;;;;;N;;;;;
+11D19;MASARAM GONDI LETTER DDHA;Lo;0;L;;;;;N;;;;;
+11D1A;MASARAM GONDI LETTER NNA;Lo;0;L;;;;;N;;;;;
+11D1B;MASARAM GONDI LETTER TA;Lo;0;L;;;;;N;;;;;
+11D1C;MASARAM GONDI LETTER THA;Lo;0;L;;;;;N;;;;;
+11D1D;MASARAM GONDI LETTER DA;Lo;0;L;;;;;N;;;;;
+11D1E;MASARAM GONDI LETTER DHA;Lo;0;L;;;;;N;;;;;
+11D1F;MASARAM GONDI LETTER NA;Lo;0;L;;;;;N;;;;;
+11D20;MASARAM GONDI LETTER PA;Lo;0;L;;;;;N;;;;;
+11D21;MASARAM GONDI LETTER PHA;Lo;0;L;;;;;N;;;;;
+11D22;MASARAM GONDI LETTER BA;Lo;0;L;;;;;N;;;;;
+11D23;MASARAM GONDI LETTER BHA;Lo;0;L;;;;;N;;;;;
+11D24;MASARAM GONDI LETTER MA;Lo;0;L;;;;;N;;;;;
+11D25;MASARAM GONDI LETTER YA;Lo;0;L;;;;;N;;;;;
+11D26;MASARAM GONDI LETTER RA;Lo;0;L;;;;;N;;;;;
+11D27;MASARAM GONDI LETTER LA;Lo;0;L;;;;;N;;;;;
+11D28;MASARAM GONDI LETTER VA;Lo;0;L;;;;;N;;;;;
+11D29;MASARAM GONDI LETTER SHA;Lo;0;L;;;;;N;;;;;
+11D2A;MASARAM GONDI LETTER SSA;Lo;0;L;;;;;N;;;;;
+11D2B;MASARAM GONDI LETTER SA;Lo;0;L;;;;;N;;;;;
+11D2C;MASARAM GONDI LETTER HA;Lo;0;L;;;;;N;;;;;
+11D2D;MASARAM GONDI LETTER LLA;Lo;0;L;;;;;N;;;;;
+11D2E;MASARAM GONDI LETTER KSSA;Lo;0;L;;;;;N;;;;;
+11D2F;MASARAM GONDI LETTER JNYA;Lo;0;L;;;;;N;;;;;
+11D30;MASARAM GONDI LETTER TRA;Lo;0;L;;;;;N;;;;;
+11D31;MASARAM GONDI VOWEL SIGN AA;Mn;0;NSM;;;;;N;;;;;
+11D32;MASARAM GONDI VOWEL SIGN I;Mn;0;NSM;;;;;N;;;;;
+11D33;MASARAM GONDI VOWEL SIGN II;Mn;0;NSM;;;;;N;;;;;
+11D34;MASARAM GONDI VOWEL SIGN U;Mn;0;NSM;;;;;N;;;;;
+11D35;MASARAM GONDI VOWEL SIGN UU;Mn;0;NSM;;;;;N;;;;;
+11D36;MASARAM GONDI VOWEL SIGN VOCALIC R;Mn;0;NSM;;;;;N;;;;;
+11D3A;MASARAM GONDI VOWEL SIGN E;Mn;0;NSM;;;;;N;;;;;
+11D3C;MASARAM GONDI VOWEL SIGN AI;Mn;0;NSM;;;;;N;;;;;
+11D3D;MASARAM GONDI VOWEL SIGN O;Mn;0;NSM;;;;;N;;;;;
+11D3F;MASARAM GONDI VOWEL SIGN AU;Mn;0;NSM;;;;;N;;;;;
+11D40;MASARAM GONDI SIGN ANUSVARA;Mn;0;NSM;;;;;N;;;;;
+11D41;MASARAM GONDI SIGN VISARGA;Mn;0;NSM;;;;;N;;;;;
+11D42;MASARAM GONDI SIGN NUKTA;Mn;7;NSM;;;;;N;;;;;
+11D43;MASARAM GONDI SIGN CANDRA;Mn;0;NSM;;;;;N;;;;;
+11D44;MASARAM GONDI SIGN HALANTA;Mn;9;NSM;;;;;N;;;;;
+11D45;MASARAM GONDI VIRAMA;Mn;9;NSM;;;;;N;;;;;
+11D46;MASARAM GONDI REPHA;Lo;0;L;;;;;N;;;;;
+11D47;MASARAM GONDI RA-KARA;Mn;0;NSM;;;;;N;;;;;
+11D50;MASARAM GONDI DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+11D51;MASARAM GONDI DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+11D52;MASARAM GONDI DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+11D53;MASARAM GONDI DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+11D54;MASARAM GONDI DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+11D55;MASARAM GONDI DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+11D56;MASARAM GONDI DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+11D57;MASARAM GONDI DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+11D58;MASARAM GONDI DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+11D59;MASARAM GONDI DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+12000;CUNEIFORM SIGN A;Lo;0;L;;;;;N;;;;;
+12001;CUNEIFORM SIGN A TIMES A;Lo;0;L;;;;;N;;;;;
+12002;CUNEIFORM SIGN A TIMES BAD;Lo;0;L;;;;;N;;;;;
+12003;CUNEIFORM SIGN A TIMES GAN2 TENU;Lo;0;L;;;;;N;;;;;
+12004;CUNEIFORM SIGN A TIMES HA;Lo;0;L;;;;;N;;;;;
+12005;CUNEIFORM SIGN A TIMES IGI;Lo;0;L;;;;;N;;;;;
+12006;CUNEIFORM SIGN A TIMES LAGAR GUNU;Lo;0;L;;;;;N;;;;;
+12007;CUNEIFORM SIGN A TIMES MUSH;Lo;0;L;;;;;N;;;;;
+12008;CUNEIFORM SIGN A TIMES SAG;Lo;0;L;;;;;N;;;;;
+12009;CUNEIFORM SIGN A2;Lo;0;L;;;;;N;;;;;
+1200A;CUNEIFORM SIGN AB;Lo;0;L;;;;;N;;;;;
+1200B;CUNEIFORM SIGN AB TIMES ASH2;Lo;0;L;;;;;N;;;;;
+1200C;CUNEIFORM SIGN AB TIMES DUN3 GUNU;Lo;0;L;;;;;N;;;;;
+1200D;CUNEIFORM SIGN AB TIMES GAL;Lo;0;L;;;;;N;;;;;
+1200E;CUNEIFORM SIGN AB TIMES GAN2 TENU;Lo;0;L;;;;;N;;;;;
+1200F;CUNEIFORM SIGN AB TIMES HA;Lo;0;L;;;;;N;;;;;
+12010;CUNEIFORM SIGN AB TIMES IGI GUNU;Lo;0;L;;;;;N;;;;;
+12011;CUNEIFORM SIGN AB TIMES IMIN;Lo;0;L;;;;;N;;;;;
+12012;CUNEIFORM SIGN AB TIMES LAGAB;Lo;0;L;;;;;N;;;;;
+12013;CUNEIFORM SIGN AB TIMES SHESH;Lo;0;L;;;;;N;;;;;
+12014;CUNEIFORM SIGN AB TIMES U PLUS U PLUS U;Lo;0;L;;;;;N;;;;;
+12015;CUNEIFORM SIGN AB GUNU;Lo;0;L;;;;;N;;;;;
+12016;CUNEIFORM SIGN AB2;Lo;0;L;;;;;N;;;;;
+12017;CUNEIFORM SIGN AB2 TIMES BALAG;Lo;0;L;;;;;N;;;;;
+12018;CUNEIFORM SIGN AB2 TIMES GAN2 TENU;Lo;0;L;;;;;N;;;;;
+12019;CUNEIFORM SIGN AB2 TIMES ME PLUS EN;Lo;0;L;;;;;N;;;;;
+1201A;CUNEIFORM SIGN AB2 TIMES SHA3;Lo;0;L;;;;;N;;;;;
+1201B;CUNEIFORM SIGN AB2 TIMES TAK4;Lo;0;L;;;;;N;;;;;
+1201C;CUNEIFORM SIGN AD;Lo;0;L;;;;;N;;;;;
+1201D;CUNEIFORM SIGN AK;Lo;0;L;;;;;N;;;;;
+1201E;CUNEIFORM SIGN AK TIMES ERIN2;Lo;0;L;;;;;N;;;;;
+1201F;CUNEIFORM SIGN AK TIMES SHITA PLUS GISH;Lo;0;L;;;;;N;;;;;
+12020;CUNEIFORM SIGN AL;Lo;0;L;;;;;N;;;;;
+12021;CUNEIFORM SIGN AL TIMES AL;Lo;0;L;;;;;N;;;;;
+12022;CUNEIFORM SIGN AL TIMES DIM2;Lo;0;L;;;;;N;;;;;
+12023;CUNEIFORM SIGN AL TIMES GISH;Lo;0;L;;;;;N;;;;;
+12024;CUNEIFORM SIGN AL TIMES HA;Lo;0;L;;;;;N;;;;;
+12025;CUNEIFORM SIGN AL TIMES KAD3;Lo;0;L;;;;;N;;;;;
+12026;CUNEIFORM SIGN AL TIMES KI;Lo;0;L;;;;;N;;;;;
+12027;CUNEIFORM SIGN AL TIMES SHE;Lo;0;L;;;;;N;;;;;
+12028;CUNEIFORM SIGN AL TIMES USH;Lo;0;L;;;;;N;;;;;
+12029;CUNEIFORM SIGN ALAN;Lo;0;L;;;;;N;;;;;
+1202A;CUNEIFORM SIGN ALEPH;Lo;0;L;;;;;N;;;;;
+1202B;CUNEIFORM SIGN AMAR;Lo;0;L;;;;;N;;;;;
+1202C;CUNEIFORM SIGN AMAR TIMES SHE;Lo;0;L;;;;;N;;;;;
+1202D;CUNEIFORM SIGN AN;Lo;0;L;;;;;N;;;;;
+1202E;CUNEIFORM SIGN AN OVER AN;Lo;0;L;;;;;N;;;;;
+1202F;CUNEIFORM SIGN AN THREE TIMES;Lo;0;L;;;;;N;;;;;
+12030;CUNEIFORM SIGN AN PLUS NAGA OPPOSING AN PLUS NAGA;Lo;0;L;;;;;N;;;;;
+12031;CUNEIFORM SIGN AN PLUS NAGA SQUARED;Lo;0;L;;;;;N;;;;;
+12032;CUNEIFORM SIGN ANSHE;Lo;0;L;;;;;N;;;;;
+12033;CUNEIFORM SIGN APIN;Lo;0;L;;;;;N;;;;;
+12034;CUNEIFORM SIGN ARAD;Lo;0;L;;;;;N;;;;;
+12035;CUNEIFORM SIGN ARAD TIMES KUR;Lo;0;L;;;;;N;;;;;
+12036;CUNEIFORM SIGN ARKAB;Lo;0;L;;;;;N;;;;;
+12037;CUNEIFORM SIGN ASAL2;Lo;0;L;;;;;N;;;;;
+12038;CUNEIFORM SIGN ASH;Lo;0;L;;;;;N;;;;;
+12039;CUNEIFORM SIGN ASH ZIDA TENU;Lo;0;L;;;;;N;;;;;
+1203A;CUNEIFORM SIGN ASH KABA TENU;Lo;0;L;;;;;N;;;;;
+1203B;CUNEIFORM SIGN ASH OVER ASH TUG2 OVER TUG2 TUG2 OVER TUG2 PAP;Lo;0;L;;;;;N;;;;;
+1203C;CUNEIFORM SIGN ASH OVER ASH OVER ASH;Lo;0;L;;;;;N;;;;;
+1203D;CUNEIFORM SIGN ASH OVER ASH OVER ASH CROSSING ASH OVER ASH OVER ASH;Lo;0;L;;;;;N;;;;;
+1203E;CUNEIFORM SIGN ASH2;Lo;0;L;;;;;N;;;;;
+1203F;CUNEIFORM SIGN ASHGAB;Lo;0;L;;;;;N;;;;;
+12040;CUNEIFORM SIGN BA;Lo;0;L;;;;;N;;;;;
+12041;CUNEIFORM SIGN BAD;Lo;0;L;;;;;N;;;;;
+12042;CUNEIFORM SIGN BAG3;Lo;0;L;;;;;N;;;;;
+12043;CUNEIFORM SIGN BAHAR2;Lo;0;L;;;;;N;;;;;
+12044;CUNEIFORM SIGN BAL;Lo;0;L;;;;;N;;;;;
+12045;CUNEIFORM SIGN BAL OVER BAL;Lo;0;L;;;;;N;;;;;
+12046;CUNEIFORM SIGN BALAG;Lo;0;L;;;;;N;;;;;
+12047;CUNEIFORM SIGN BAR;Lo;0;L;;;;;N;;;;;
+12048;CUNEIFORM SIGN BARA2;Lo;0;L;;;;;N;;;;;
+12049;CUNEIFORM SIGN BI;Lo;0;L;;;;;N;;;;;
+1204A;CUNEIFORM SIGN BI TIMES A;Lo;0;L;;;;;N;;;;;
+1204B;CUNEIFORM SIGN BI TIMES GAR;Lo;0;L;;;;;N;;;;;
+1204C;CUNEIFORM SIGN BI TIMES IGI GUNU;Lo;0;L;;;;;N;;;;;
+1204D;CUNEIFORM SIGN BU;Lo;0;L;;;;;N;;;;;
+1204E;CUNEIFORM SIGN BU OVER BU AB;Lo;0;L;;;;;N;;;;;
+1204F;CUNEIFORM SIGN BU OVER BU UN;Lo;0;L;;;;;N;;;;;
+12050;CUNEIFORM SIGN BU CROSSING BU;Lo;0;L;;;;;N;;;;;
+12051;CUNEIFORM SIGN BULUG;Lo;0;L;;;;;N;;;;;
+12052;CUNEIFORM SIGN BULUG OVER BULUG;Lo;0;L;;;;;N;;;;;
+12053;CUNEIFORM SIGN BUR;Lo;0;L;;;;;N;;;;;
+12054;CUNEIFORM SIGN BUR2;Lo;0;L;;;;;N;;;;;
+12055;CUNEIFORM SIGN DA;Lo;0;L;;;;;N;;;;;
+12056;CUNEIFORM SIGN DAG;Lo;0;L;;;;;N;;;;;
+12057;CUNEIFORM SIGN DAG KISIM5 TIMES A PLUS MASH;Lo;0;L;;;;;N;;;;;
+12058;CUNEIFORM SIGN DAG KISIM5 TIMES AMAR;Lo;0;L;;;;;N;;;;;
+12059;CUNEIFORM SIGN DAG KISIM5 TIMES BALAG;Lo;0;L;;;;;N;;;;;
+1205A;CUNEIFORM SIGN DAG KISIM5 TIMES BI;Lo;0;L;;;;;N;;;;;
+1205B;CUNEIFORM SIGN DAG KISIM5 TIMES GA;Lo;0;L;;;;;N;;;;;
+1205C;CUNEIFORM SIGN DAG KISIM5 TIMES GA PLUS MASH;Lo;0;L;;;;;N;;;;;
+1205D;CUNEIFORM SIGN DAG KISIM5 TIMES GI;Lo;0;L;;;;;N;;;;;
+1205E;CUNEIFORM SIGN DAG KISIM5 TIMES GIR2;Lo;0;L;;;;;N;;;;;
+1205F;CUNEIFORM SIGN DAG KISIM5 TIMES GUD;Lo;0;L;;;;;N;;;;;
+12060;CUNEIFORM SIGN DAG KISIM5 TIMES HA;Lo;0;L;;;;;N;;;;;
+12061;CUNEIFORM SIGN DAG KISIM5 TIMES IR;Lo;0;L;;;;;N;;;;;
+12062;CUNEIFORM SIGN DAG KISIM5 TIMES IR PLUS LU;Lo;0;L;;;;;N;;;;;
+12063;CUNEIFORM SIGN DAG KISIM5 TIMES KAK;Lo;0;L;;;;;N;;;;;
+12064;CUNEIFORM SIGN DAG KISIM5 TIMES LA;Lo;0;L;;;;;N;;;;;
+12065;CUNEIFORM SIGN DAG KISIM5 TIMES LU;Lo;0;L;;;;;N;;;;;
+12066;CUNEIFORM SIGN DAG KISIM5 TIMES LU PLUS MASH2;Lo;0;L;;;;;N;;;;;
+12067;CUNEIFORM SIGN DAG KISIM5 TIMES LUM;Lo;0;L;;;;;N;;;;;
+12068;CUNEIFORM SIGN DAG KISIM5 TIMES NE;Lo;0;L;;;;;N;;;;;
+12069;CUNEIFORM SIGN DAG KISIM5 TIMES PAP PLUS PAP;Lo;0;L;;;;;N;;;;;
+1206A;CUNEIFORM SIGN DAG KISIM5 TIMES SI;Lo;0;L;;;;;N;;;;;
+1206B;CUNEIFORM SIGN DAG KISIM5 TIMES TAK4;Lo;0;L;;;;;N;;;;;
+1206C;CUNEIFORM SIGN DAG KISIM5 TIMES U2 PLUS GIR2;Lo;0;L;;;;;N;;;;;
+1206D;CUNEIFORM SIGN DAG KISIM5 TIMES USH;Lo;0;L;;;;;N;;;;;
+1206E;CUNEIFORM SIGN DAM;Lo;0;L;;;;;N;;;;;
+1206F;CUNEIFORM SIGN DAR;Lo;0;L;;;;;N;;;;;
+12070;CUNEIFORM SIGN DARA3;Lo;0;L;;;;;N;;;;;
+12071;CUNEIFORM SIGN DARA4;Lo;0;L;;;;;N;;;;;
+12072;CUNEIFORM SIGN DI;Lo;0;L;;;;;N;;;;;
+12073;CUNEIFORM SIGN DIB;Lo;0;L;;;;;N;;;;;
+12074;CUNEIFORM SIGN DIM;Lo;0;L;;;;;N;;;;;
+12075;CUNEIFORM SIGN DIM TIMES SHE;Lo;0;L;;;;;N;;;;;
+12076;CUNEIFORM SIGN DIM2;Lo;0;L;;;;;N;;;;;
+12077;CUNEIFORM SIGN DIN;Lo;0;L;;;;;N;;;;;
+12078;CUNEIFORM SIGN DIN KASKAL U GUNU DISH;Lo;0;L;;;;;N;;;;;
+12079;CUNEIFORM SIGN DISH;Lo;0;L;;;;;N;;;;;
+1207A;CUNEIFORM SIGN DU;Lo;0;L;;;;;N;;;;;
+1207B;CUNEIFORM SIGN DU OVER DU;Lo;0;L;;;;;N;;;;;
+1207C;CUNEIFORM SIGN DU GUNU;Lo;0;L;;;;;N;;;;;
+1207D;CUNEIFORM SIGN DU SHESHIG;Lo;0;L;;;;;N;;;;;
+1207E;CUNEIFORM SIGN DUB;Lo;0;L;;;;;N;;;;;
+1207F;CUNEIFORM SIGN DUB TIMES ESH2;Lo;0;L;;;;;N;;;;;
+12080;CUNEIFORM SIGN DUB2;Lo;0;L;;;;;N;;;;;
+12081;CUNEIFORM SIGN DUG;Lo;0;L;;;;;N;;;;;
+12082;CUNEIFORM SIGN DUGUD;Lo;0;L;;;;;N;;;;;
+12083;CUNEIFORM SIGN DUH;Lo;0;L;;;;;N;;;;;
+12084;CUNEIFORM SIGN DUN;Lo;0;L;;;;;N;;;;;
+12085;CUNEIFORM SIGN DUN3;Lo;0;L;;;;;N;;;;;
+12086;CUNEIFORM SIGN DUN3 GUNU;Lo;0;L;;;;;N;;;;;
+12087;CUNEIFORM SIGN DUN3 GUNU GUNU;Lo;0;L;;;;;N;;;;;
+12088;CUNEIFORM SIGN DUN4;Lo;0;L;;;;;N;;;;;
+12089;CUNEIFORM SIGN DUR2;Lo;0;L;;;;;N;;;;;
+1208A;CUNEIFORM SIGN E;Lo;0;L;;;;;N;;;;;
+1208B;CUNEIFORM SIGN E TIMES PAP;Lo;0;L;;;;;N;;;;;
+1208C;CUNEIFORM SIGN E OVER E NUN OVER NUN;Lo;0;L;;;;;N;;;;;
+1208D;CUNEIFORM SIGN E2;Lo;0;L;;;;;N;;;;;
+1208E;CUNEIFORM SIGN E2 TIMES A PLUS HA PLUS DA;Lo;0;L;;;;;N;;;;;
+1208F;CUNEIFORM SIGN E2 TIMES GAR;Lo;0;L;;;;;N;;;;;
+12090;CUNEIFORM SIGN E2 TIMES MI;Lo;0;L;;;;;N;;;;;
+12091;CUNEIFORM SIGN E2 TIMES SAL;Lo;0;L;;;;;N;;;;;
+12092;CUNEIFORM SIGN E2 TIMES SHE;Lo;0;L;;;;;N;;;;;
+12093;CUNEIFORM SIGN E2 TIMES U;Lo;0;L;;;;;N;;;;;
+12094;CUNEIFORM SIGN EDIN;Lo;0;L;;;;;N;;;;;
+12095;CUNEIFORM SIGN EGIR;Lo;0;L;;;;;N;;;;;
+12096;CUNEIFORM SIGN EL;Lo;0;L;;;;;N;;;;;
+12097;CUNEIFORM SIGN EN;Lo;0;L;;;;;N;;;;;
+12098;CUNEIFORM SIGN EN TIMES GAN2;Lo;0;L;;;;;N;;;;;
+12099;CUNEIFORM SIGN EN TIMES GAN2 TENU;Lo;0;L;;;;;N;;;;;
+1209A;CUNEIFORM SIGN EN TIMES ME;Lo;0;L;;;;;N;;;;;
+1209B;CUNEIFORM SIGN EN CROSSING EN;Lo;0;L;;;;;N;;;;;
+1209C;CUNEIFORM SIGN EN OPPOSING EN;Lo;0;L;;;;;N;;;;;
+1209D;CUNEIFORM SIGN EN SQUARED;Lo;0;L;;;;;N;;;;;
+1209E;CUNEIFORM SIGN EREN;Lo;0;L;;;;;N;;;;;
+1209F;CUNEIFORM SIGN ERIN2;Lo;0;L;;;;;N;;;;;
+120A0;CUNEIFORM SIGN ESH2;Lo;0;L;;;;;N;;;;;
+120A1;CUNEIFORM SIGN EZEN;Lo;0;L;;;;;N;;;;;
+120A2;CUNEIFORM SIGN EZEN TIMES A;Lo;0;L;;;;;N;;;;;
+120A3;CUNEIFORM SIGN EZEN TIMES A PLUS LAL;Lo;0;L;;;;;N;;;;;
+120A4;CUNEIFORM SIGN EZEN TIMES A PLUS LAL TIMES LAL;Lo;0;L;;;;;N;;;;;
+120A5;CUNEIFORM SIGN EZEN TIMES AN;Lo;0;L;;;;;N;;;;;
+120A6;CUNEIFORM SIGN EZEN TIMES BAD;Lo;0;L;;;;;N;;;;;
+120A7;CUNEIFORM SIGN EZEN TIMES DUN3 GUNU;Lo;0;L;;;;;N;;;;;
+120A8;CUNEIFORM SIGN EZEN TIMES DUN3 GUNU GUNU;Lo;0;L;;;;;N;;;;;
+120A9;CUNEIFORM SIGN EZEN TIMES HA;Lo;0;L;;;;;N;;;;;
+120AA;CUNEIFORM SIGN EZEN TIMES HA GUNU;Lo;0;L;;;;;N;;;;;
+120AB;CUNEIFORM SIGN EZEN TIMES IGI GUNU;Lo;0;L;;;;;N;;;;;
+120AC;CUNEIFORM SIGN EZEN TIMES KASKAL;Lo;0;L;;;;;N;;;;;
+120AD;CUNEIFORM SIGN EZEN TIMES KASKAL SQUARED;Lo;0;L;;;;;N;;;;;
+120AE;CUNEIFORM SIGN EZEN TIMES KU3;Lo;0;L;;;;;N;;;;;
+120AF;CUNEIFORM SIGN EZEN TIMES LA;Lo;0;L;;;;;N;;;;;
+120B0;CUNEIFORM SIGN EZEN TIMES LAL TIMES LAL;Lo;0;L;;;;;N;;;;;
+120B1;CUNEIFORM SIGN EZEN TIMES LI;Lo;0;L;;;;;N;;;;;
+120B2;CUNEIFORM SIGN EZEN TIMES LU;Lo;0;L;;;;;N;;;;;
+120B3;CUNEIFORM SIGN EZEN TIMES U2;Lo;0;L;;;;;N;;;;;
+120B4;CUNEIFORM SIGN EZEN TIMES UD;Lo;0;L;;;;;N;;;;;
+120B5;CUNEIFORM SIGN GA;Lo;0;L;;;;;N;;;;;
+120B6;CUNEIFORM SIGN GA GUNU;Lo;0;L;;;;;N;;;;;
+120B7;CUNEIFORM SIGN GA2;Lo;0;L;;;;;N;;;;;
+120B8;CUNEIFORM SIGN GA2 TIMES A PLUS DA PLUS HA;Lo;0;L;;;;;N;;;;;
+120B9;CUNEIFORM SIGN GA2 TIMES A PLUS HA;Lo;0;L;;;;;N;;;;;
+120BA;CUNEIFORM SIGN GA2 TIMES A PLUS IGI;Lo;0;L;;;;;N;;;;;
+120BB;CUNEIFORM SIGN GA2 TIMES AB2 TENU PLUS TAB;Lo;0;L;;;;;N;;;;;
+120BC;CUNEIFORM SIGN GA2 TIMES AN;Lo;0;L;;;;;N;;;;;
+120BD;CUNEIFORM SIGN GA2 TIMES ASH;Lo;0;L;;;;;N;;;;;
+120BE;CUNEIFORM SIGN GA2 TIMES ASH2 PLUS GAL;Lo;0;L;;;;;N;;;;;
+120BF;CUNEIFORM SIGN GA2 TIMES BAD;Lo;0;L;;;;;N;;;;;
+120C0;CUNEIFORM SIGN GA2 TIMES BAR PLUS RA;Lo;0;L;;;;;N;;;;;
+120C1;CUNEIFORM SIGN GA2 TIMES BUR;Lo;0;L;;;;;N;;;;;
+120C2;CUNEIFORM SIGN GA2 TIMES BUR PLUS RA;Lo;0;L;;;;;N;;;;;
+120C3;CUNEIFORM SIGN GA2 TIMES DA;Lo;0;L;;;;;N;;;;;
+120C4;CUNEIFORM SIGN GA2 TIMES DI;Lo;0;L;;;;;N;;;;;
+120C5;CUNEIFORM SIGN GA2 TIMES DIM TIMES SHE;Lo;0;L;;;;;N;;;;;
+120C6;CUNEIFORM SIGN GA2 TIMES DUB;Lo;0;L;;;;;N;;;;;
+120C7;CUNEIFORM SIGN GA2 TIMES EL;Lo;0;L;;;;;N;;;;;
+120C8;CUNEIFORM SIGN GA2 TIMES EL PLUS LA;Lo;0;L;;;;;N;;;;;
+120C9;CUNEIFORM SIGN GA2 TIMES EN;Lo;0;L;;;;;N;;;;;
+120CA;CUNEIFORM SIGN GA2 TIMES EN TIMES GAN2 TENU;Lo;0;L;;;;;N;;;;;
+120CB;CUNEIFORM SIGN GA2 TIMES GAN2 TENU;Lo;0;L;;;;;N;;;;;
+120CC;CUNEIFORM SIGN GA2 TIMES GAR;Lo;0;L;;;;;N;;;;;
+120CD;CUNEIFORM SIGN GA2 TIMES GI;Lo;0;L;;;;;N;;;;;
+120CE;CUNEIFORM SIGN GA2 TIMES GI4;Lo;0;L;;;;;N;;;;;
+120CF;CUNEIFORM SIGN GA2 TIMES GI4 PLUS A;Lo;0;L;;;;;N;;;;;
+120D0;CUNEIFORM SIGN GA2 TIMES GIR2 PLUS SU;Lo;0;L;;;;;N;;;;;
+120D1;CUNEIFORM SIGN GA2 TIMES HA PLUS LU PLUS ESH2;Lo;0;L;;;;;N;;;;;
+120D2;CUNEIFORM SIGN GA2 TIMES HAL;Lo;0;L;;;;;N;;;;;
+120D3;CUNEIFORM SIGN GA2 TIMES HAL PLUS LA;Lo;0;L;;;;;N;;;;;
+120D4;CUNEIFORM SIGN GA2 TIMES HI PLUS LI;Lo;0;L;;;;;N;;;;;
+120D5;CUNEIFORM SIGN GA2 TIMES HUB2;Lo;0;L;;;;;N;;;;;
+120D6;CUNEIFORM SIGN GA2 TIMES IGI GUNU;Lo;0;L;;;;;N;;;;;
+120D7;CUNEIFORM SIGN GA2 TIMES ISH PLUS HU PLUS ASH;Lo;0;L;;;;;N;;;;;
+120D8;CUNEIFORM SIGN GA2 TIMES KAK;Lo;0;L;;;;;N;;;;;
+120D9;CUNEIFORM SIGN GA2 TIMES KASKAL;Lo;0;L;;;;;N;;;;;
+120DA;CUNEIFORM SIGN GA2 TIMES KID;Lo;0;L;;;;;N;;;;;
+120DB;CUNEIFORM SIGN GA2 TIMES KID PLUS LAL;Lo;0;L;;;;;N;;;;;
+120DC;CUNEIFORM SIGN GA2 TIMES KU3 PLUS AN;Lo;0;L;;;;;N;;;;;
+120DD;CUNEIFORM SIGN GA2 TIMES LA;Lo;0;L;;;;;N;;;;;
+120DE;CUNEIFORM SIGN GA2 TIMES ME PLUS EN;Lo;0;L;;;;;N;;;;;
+120DF;CUNEIFORM SIGN GA2 TIMES MI;Lo;0;L;;;;;N;;;;;
+120E0;CUNEIFORM SIGN GA2 TIMES NUN;Lo;0;L;;;;;N;;;;;
+120E1;CUNEIFORM SIGN GA2 TIMES NUN OVER NUN;Lo;0;L;;;;;N;;;;;
+120E2;CUNEIFORM SIGN GA2 TIMES PA;Lo;0;L;;;;;N;;;;;
+120E3;CUNEIFORM SIGN GA2 TIMES SAL;Lo;0;L;;;;;N;;;;;
+120E4;CUNEIFORM SIGN GA2 TIMES SAR;Lo;0;L;;;;;N;;;;;
+120E5;CUNEIFORM SIGN GA2 TIMES SHE;Lo;0;L;;;;;N;;;;;
+120E6;CUNEIFORM SIGN GA2 TIMES SHE PLUS TUR;Lo;0;L;;;;;N;;;;;
+120E7;CUNEIFORM SIGN GA2 TIMES SHID;Lo;0;L;;;;;N;;;;;
+120E8;CUNEIFORM SIGN GA2 TIMES SUM;Lo;0;L;;;;;N;;;;;
+120E9;CUNEIFORM SIGN GA2 TIMES TAK4;Lo;0;L;;;;;N;;;;;
+120EA;CUNEIFORM SIGN GA2 TIMES U;Lo;0;L;;;;;N;;;;;
+120EB;CUNEIFORM SIGN GA2 TIMES UD;Lo;0;L;;;;;N;;;;;
+120EC;CUNEIFORM SIGN GA2 TIMES UD PLUS DU;Lo;0;L;;;;;N;;;;;
+120ED;CUNEIFORM SIGN GA2 OVER GA2;Lo;0;L;;;;;N;;;;;
+120EE;CUNEIFORM SIGN GABA;Lo;0;L;;;;;N;;;;;
+120EF;CUNEIFORM SIGN GABA CROSSING GABA;Lo;0;L;;;;;N;;;;;
+120F0;CUNEIFORM SIGN GAD;Lo;0;L;;;;;N;;;;;
+120F1;CUNEIFORM SIGN GAD OVER GAD GAR OVER GAR;Lo;0;L;;;;;N;;;;;
+120F2;CUNEIFORM SIGN GAL;Lo;0;L;;;;;N;;;;;
+120F3;CUNEIFORM SIGN GAL GAD OVER GAD GAR OVER GAR;Lo;0;L;;;;;N;;;;;
+120F4;CUNEIFORM SIGN GALAM;Lo;0;L;;;;;N;;;;;
+120F5;CUNEIFORM SIGN GAM;Lo;0;L;;;;;N;;;;;
+120F6;CUNEIFORM SIGN GAN;Lo;0;L;;;;;N;;;;;
+120F7;CUNEIFORM SIGN GAN2;Lo;0;L;;;;;N;;;;;
+120F8;CUNEIFORM SIGN GAN2 TENU;Lo;0;L;;;;;N;;;;;
+120F9;CUNEIFORM SIGN GAN2 OVER GAN2;Lo;0;L;;;;;N;;;;;
+120FA;CUNEIFORM SIGN GAN2 CROSSING GAN2;Lo;0;L;;;;;N;;;;;
+120FB;CUNEIFORM SIGN GAR;Lo;0;L;;;;;N;;;;;
+120FC;CUNEIFORM SIGN GAR3;Lo;0;L;;;;;N;;;;;
+120FD;CUNEIFORM SIGN GASHAN;Lo;0;L;;;;;N;;;;;
+120FE;CUNEIFORM SIGN GESHTIN;Lo;0;L;;;;;N;;;;;
+120FF;CUNEIFORM SIGN GESHTIN TIMES KUR;Lo;0;L;;;;;N;;;;;
+12100;CUNEIFORM SIGN GI;Lo;0;L;;;;;N;;;;;
+12101;CUNEIFORM SIGN GI TIMES E;Lo;0;L;;;;;N;;;;;
+12102;CUNEIFORM SIGN GI TIMES U;Lo;0;L;;;;;N;;;;;
+12103;CUNEIFORM SIGN GI CROSSING GI;Lo;0;L;;;;;N;;;;;
+12104;CUNEIFORM SIGN GI4;Lo;0;L;;;;;N;;;;;
+12105;CUNEIFORM SIGN GI4 OVER GI4;Lo;0;L;;;;;N;;;;;
+12106;CUNEIFORM SIGN GI4 CROSSING GI4;Lo;0;L;;;;;N;;;;;
+12107;CUNEIFORM SIGN GIDIM;Lo;0;L;;;;;N;;;;;
+12108;CUNEIFORM SIGN GIR2;Lo;0;L;;;;;N;;;;;
+12109;CUNEIFORM SIGN GIR2 GUNU;Lo;0;L;;;;;N;;;;;
+1210A;CUNEIFORM SIGN GIR3;Lo;0;L;;;;;N;;;;;
+1210B;CUNEIFORM SIGN GIR3 TIMES A PLUS IGI;Lo;0;L;;;;;N;;;;;
+1210C;CUNEIFORM SIGN GIR3 TIMES GAN2 TENU;Lo;0;L;;;;;N;;;;;
+1210D;CUNEIFORM SIGN GIR3 TIMES IGI;Lo;0;L;;;;;N;;;;;
+1210E;CUNEIFORM SIGN GIR3 TIMES LU PLUS IGI;Lo;0;L;;;;;N;;;;;
+1210F;CUNEIFORM SIGN GIR3 TIMES PA;Lo;0;L;;;;;N;;;;;
+12110;CUNEIFORM SIGN GISAL;Lo;0;L;;;;;N;;;;;
+12111;CUNEIFORM SIGN GISH;Lo;0;L;;;;;N;;;;;
+12112;CUNEIFORM SIGN GISH CROSSING GISH;Lo;0;L;;;;;N;;;;;
+12113;CUNEIFORM SIGN GISH TIMES BAD;Lo;0;L;;;;;N;;;;;
+12114;CUNEIFORM SIGN GISH TIMES TAK4;Lo;0;L;;;;;N;;;;;
+12115;CUNEIFORM SIGN GISH TENU;Lo;0;L;;;;;N;;;;;
+12116;CUNEIFORM SIGN GU;Lo;0;L;;;;;N;;;;;
+12117;CUNEIFORM SIGN GU CROSSING GU;Lo;0;L;;;;;N;;;;;
+12118;CUNEIFORM SIGN GU2;Lo;0;L;;;;;N;;;;;
+12119;CUNEIFORM SIGN GU2 TIMES KAK;Lo;0;L;;;;;N;;;;;
+1211A;CUNEIFORM SIGN GU2 TIMES KAK TIMES IGI GUNU;Lo;0;L;;;;;N;;;;;
+1211B;CUNEIFORM SIGN GU2 TIMES NUN;Lo;0;L;;;;;N;;;;;
+1211C;CUNEIFORM SIGN GU2 TIMES SAL PLUS TUG2;Lo;0;L;;;;;N;;;;;
+1211D;CUNEIFORM SIGN GU2 GUNU;Lo;0;L;;;;;N;;;;;
+1211E;CUNEIFORM SIGN GUD;Lo;0;L;;;;;N;;;;;
+1211F;CUNEIFORM SIGN GUD TIMES A PLUS KUR;Lo;0;L;;;;;N;;;;;
+12120;CUNEIFORM SIGN GUD TIMES KUR;Lo;0;L;;;;;N;;;;;
+12121;CUNEIFORM SIGN GUD OVER GUD LUGAL;Lo;0;L;;;;;N;;;;;
+12122;CUNEIFORM SIGN GUL;Lo;0;L;;;;;N;;;;;
+12123;CUNEIFORM SIGN GUM;Lo;0;L;;;;;N;;;;;
+12124;CUNEIFORM SIGN GUM TIMES SHE;Lo;0;L;;;;;N;;;;;
+12125;CUNEIFORM SIGN GUR;Lo;0;L;;;;;N;;;;;
+12126;CUNEIFORM SIGN GUR7;Lo;0;L;;;;;N;;;;;
+12127;CUNEIFORM SIGN GURUN;Lo;0;L;;;;;N;;;;;
+12128;CUNEIFORM SIGN GURUSH;Lo;0;L;;;;;N;;;;;
+12129;CUNEIFORM SIGN HA;Lo;0;L;;;;;N;;;;;
+1212A;CUNEIFORM SIGN HA TENU;Lo;0;L;;;;;N;;;;;
+1212B;CUNEIFORM SIGN HA GUNU;Lo;0;L;;;;;N;;;;;
+1212C;CUNEIFORM SIGN HAL;Lo;0;L;;;;;N;;;;;
+1212D;CUNEIFORM SIGN HI;Lo;0;L;;;;;N;;;;;
+1212E;CUNEIFORM SIGN HI TIMES ASH;Lo;0;L;;;;;N;;;;;
+1212F;CUNEIFORM SIGN HI TIMES ASH2;Lo;0;L;;;;;N;;;;;
+12130;CUNEIFORM SIGN HI TIMES BAD;Lo;0;L;;;;;N;;;;;
+12131;CUNEIFORM SIGN HI TIMES DISH;Lo;0;L;;;;;N;;;;;
+12132;CUNEIFORM SIGN HI TIMES GAD;Lo;0;L;;;;;N;;;;;
+12133;CUNEIFORM SIGN HI TIMES KIN;Lo;0;L;;;;;N;;;;;
+12134;CUNEIFORM SIGN HI TIMES NUN;Lo;0;L;;;;;N;;;;;
+12135;CUNEIFORM SIGN HI TIMES SHE;Lo;0;L;;;;;N;;;;;
+12136;CUNEIFORM SIGN HI TIMES U;Lo;0;L;;;;;N;;;;;
+12137;CUNEIFORM SIGN HU;Lo;0;L;;;;;N;;;;;
+12138;CUNEIFORM SIGN HUB2;Lo;0;L;;;;;N;;;;;
+12139;CUNEIFORM SIGN HUB2 TIMES AN;Lo;0;L;;;;;N;;;;;
+1213A;CUNEIFORM SIGN HUB2 TIMES HAL;Lo;0;L;;;;;N;;;;;
+1213B;CUNEIFORM SIGN HUB2 TIMES KASKAL;Lo;0;L;;;;;N;;;;;
+1213C;CUNEIFORM SIGN HUB2 TIMES LISH;Lo;0;L;;;;;N;;;;;
+1213D;CUNEIFORM SIGN HUB2 TIMES UD;Lo;0;L;;;;;N;;;;;
+1213E;CUNEIFORM SIGN HUL2;Lo;0;L;;;;;N;;;;;
+1213F;CUNEIFORM SIGN I;Lo;0;L;;;;;N;;;;;
+12140;CUNEIFORM SIGN I A;Lo;0;L;;;;;N;;;;;
+12141;CUNEIFORM SIGN IB;Lo;0;L;;;;;N;;;;;
+12142;CUNEIFORM SIGN IDIM;Lo;0;L;;;;;N;;;;;
+12143;CUNEIFORM SIGN IDIM OVER IDIM BUR;Lo;0;L;;;;;N;;;;;
+12144;CUNEIFORM SIGN IDIM OVER IDIM SQUARED;Lo;0;L;;;;;N;;;;;
+12145;CUNEIFORM SIGN IG;Lo;0;L;;;;;N;;;;;
+12146;CUNEIFORM SIGN IGI;Lo;0;L;;;;;N;;;;;
+12147;CUNEIFORM SIGN IGI DIB;Lo;0;L;;;;;N;;;;;
+12148;CUNEIFORM SIGN IGI RI;Lo;0;L;;;;;N;;;;;
+12149;CUNEIFORM SIGN IGI OVER IGI SHIR OVER SHIR UD OVER UD;Lo;0;L;;;;;N;;;;;
+1214A;CUNEIFORM SIGN IGI GUNU;Lo;0;L;;;;;N;;;;;
+1214B;CUNEIFORM SIGN IL;Lo;0;L;;;;;N;;;;;
+1214C;CUNEIFORM SIGN IL TIMES GAN2 TENU;Lo;0;L;;;;;N;;;;;
+1214D;CUNEIFORM SIGN IL2;Lo;0;L;;;;;N;;;;;
+1214E;CUNEIFORM SIGN IM;Lo;0;L;;;;;N;;;;;
+1214F;CUNEIFORM SIGN IM TIMES TAK4;Lo;0;L;;;;;N;;;;;
+12150;CUNEIFORM SIGN IM CROSSING IM;Lo;0;L;;;;;N;;;;;
+12151;CUNEIFORM SIGN IM OPPOSING IM;Lo;0;L;;;;;N;;;;;
+12152;CUNEIFORM SIGN IM SQUARED;Lo;0;L;;;;;N;;;;;
+12153;CUNEIFORM SIGN IMIN;Lo;0;L;;;;;N;;;;;
+12154;CUNEIFORM SIGN IN;Lo;0;L;;;;;N;;;;;
+12155;CUNEIFORM SIGN IR;Lo;0;L;;;;;N;;;;;
+12156;CUNEIFORM SIGN ISH;Lo;0;L;;;;;N;;;;;
+12157;CUNEIFORM SIGN KA;Lo;0;L;;;;;N;;;;;
+12158;CUNEIFORM SIGN KA TIMES A;Lo;0;L;;;;;N;;;;;
+12159;CUNEIFORM SIGN KA TIMES AD;Lo;0;L;;;;;N;;;;;
+1215A;CUNEIFORM SIGN KA TIMES AD PLUS KU3;Lo;0;L;;;;;N;;;;;
+1215B;CUNEIFORM SIGN KA TIMES ASH2;Lo;0;L;;;;;N;;;;;
+1215C;CUNEIFORM SIGN KA TIMES BAD;Lo;0;L;;;;;N;;;;;
+1215D;CUNEIFORM SIGN KA TIMES BALAG;Lo;0;L;;;;;N;;;;;
+1215E;CUNEIFORM SIGN KA TIMES BAR;Lo;0;L;;;;;N;;;;;
+1215F;CUNEIFORM SIGN KA TIMES BI;Lo;0;L;;;;;N;;;;;
+12160;CUNEIFORM SIGN KA TIMES ERIN2;Lo;0;L;;;;;N;;;;;
+12161;CUNEIFORM SIGN KA TIMES ESH2;Lo;0;L;;;;;N;;;;;
+12162;CUNEIFORM SIGN KA TIMES GA;Lo;0;L;;;;;N;;;;;
+12163;CUNEIFORM SIGN KA TIMES GAL;Lo;0;L;;;;;N;;;;;
+12164;CUNEIFORM SIGN KA TIMES GAN2 TENU;Lo;0;L;;;;;N;;;;;
+12165;CUNEIFORM SIGN KA TIMES GAR;Lo;0;L;;;;;N;;;;;
+12166;CUNEIFORM SIGN KA TIMES GAR PLUS SHA3 PLUS A;Lo;0;L;;;;;N;;;;;
+12167;CUNEIFORM SIGN KA TIMES GI;Lo;0;L;;;;;N;;;;;
+12168;CUNEIFORM SIGN KA TIMES GIR2;Lo;0;L;;;;;N;;;;;
+12169;CUNEIFORM SIGN KA TIMES GISH PLUS SAR;Lo;0;L;;;;;N;;;;;
+1216A;CUNEIFORM SIGN KA TIMES GISH CROSSING GISH;Lo;0;L;;;;;N;;;;;
+1216B;CUNEIFORM SIGN KA TIMES GU;Lo;0;L;;;;;N;;;;;
+1216C;CUNEIFORM SIGN KA TIMES GUR7;Lo;0;L;;;;;N;;;;;
+1216D;CUNEIFORM SIGN KA TIMES IGI;Lo;0;L;;;;;N;;;;;
+1216E;CUNEIFORM SIGN KA TIMES IM;Lo;0;L;;;;;N;;;;;
+1216F;CUNEIFORM SIGN KA TIMES KAK;Lo;0;L;;;;;N;;;;;
+12170;CUNEIFORM SIGN KA TIMES KI;Lo;0;L;;;;;N;;;;;
+12171;CUNEIFORM SIGN KA TIMES KID;Lo;0;L;;;;;N;;;;;
+12172;CUNEIFORM SIGN KA TIMES LI;Lo;0;L;;;;;N;;;;;
+12173;CUNEIFORM SIGN KA TIMES LU;Lo;0;L;;;;;N;;;;;
+12174;CUNEIFORM SIGN KA TIMES ME;Lo;0;L;;;;;N;;;;;
+12175;CUNEIFORM SIGN KA TIMES ME PLUS DU;Lo;0;L;;;;;N;;;;;
+12176;CUNEIFORM SIGN KA TIMES ME PLUS GI;Lo;0;L;;;;;N;;;;;
+12177;CUNEIFORM SIGN KA TIMES ME PLUS TE;Lo;0;L;;;;;N;;;;;
+12178;CUNEIFORM SIGN KA TIMES MI;Lo;0;L;;;;;N;;;;;
+12179;CUNEIFORM SIGN KA TIMES MI PLUS NUNUZ;Lo;0;L;;;;;N;;;;;
+1217A;CUNEIFORM SIGN KA TIMES NE;Lo;0;L;;;;;N;;;;;
+1217B;CUNEIFORM SIGN KA TIMES NUN;Lo;0;L;;;;;N;;;;;
+1217C;CUNEIFORM SIGN KA TIMES PI;Lo;0;L;;;;;N;;;;;
+1217D;CUNEIFORM SIGN KA TIMES RU;Lo;0;L;;;;;N;;;;;
+1217E;CUNEIFORM SIGN KA TIMES SA;Lo;0;L;;;;;N;;;;;
+1217F;CUNEIFORM SIGN KA TIMES SAR;Lo;0;L;;;;;N;;;;;
+12180;CUNEIFORM SIGN KA TIMES SHA;Lo;0;L;;;;;N;;;;;
+12181;CUNEIFORM SIGN KA TIMES SHE;Lo;0;L;;;;;N;;;;;
+12182;CUNEIFORM SIGN KA TIMES SHID;Lo;0;L;;;;;N;;;;;
+12183;CUNEIFORM SIGN KA TIMES SHU;Lo;0;L;;;;;N;;;;;
+12184;CUNEIFORM SIGN KA TIMES SIG;Lo;0;L;;;;;N;;;;;
+12185;CUNEIFORM SIGN KA TIMES SUHUR;Lo;0;L;;;;;N;;;;;
+12186;CUNEIFORM SIGN KA TIMES TAR;Lo;0;L;;;;;N;;;;;
+12187;CUNEIFORM SIGN KA TIMES U;Lo;0;L;;;;;N;;;;;
+12188;CUNEIFORM SIGN KA TIMES U2;Lo;0;L;;;;;N;;;;;
+12189;CUNEIFORM SIGN KA TIMES UD;Lo;0;L;;;;;N;;;;;
+1218A;CUNEIFORM SIGN KA TIMES UMUM TIMES PA;Lo;0;L;;;;;N;;;;;
+1218B;CUNEIFORM SIGN KA TIMES USH;Lo;0;L;;;;;N;;;;;
+1218C;CUNEIFORM SIGN KA TIMES ZI;Lo;0;L;;;;;N;;;;;
+1218D;CUNEIFORM SIGN KA2;Lo;0;L;;;;;N;;;;;
+1218E;CUNEIFORM SIGN KA2 CROSSING KA2;Lo;0;L;;;;;N;;;;;
+1218F;CUNEIFORM SIGN KAB;Lo;0;L;;;;;N;;;;;
+12190;CUNEIFORM SIGN KAD2;Lo;0;L;;;;;N;;;;;
+12191;CUNEIFORM SIGN KAD3;Lo;0;L;;;;;N;;;;;
+12192;CUNEIFORM SIGN KAD4;Lo;0;L;;;;;N;;;;;
+12193;CUNEIFORM SIGN KAD5;Lo;0;L;;;;;N;;;;;
+12194;CUNEIFORM SIGN KAD5 OVER KAD5;Lo;0;L;;;;;N;;;;;
+12195;CUNEIFORM SIGN KAK;Lo;0;L;;;;;N;;;;;
+12196;CUNEIFORM SIGN KAK TIMES IGI GUNU;Lo;0;L;;;;;N;;;;;
+12197;CUNEIFORM SIGN KAL;Lo;0;L;;;;;N;;;;;
+12198;CUNEIFORM SIGN KAL TIMES BAD;Lo;0;L;;;;;N;;;;;
+12199;CUNEIFORM SIGN KAL CROSSING KAL;Lo;0;L;;;;;N;;;;;
+1219A;CUNEIFORM SIGN KAM2;Lo;0;L;;;;;N;;;;;
+1219B;CUNEIFORM SIGN KAM4;Lo;0;L;;;;;N;;;;;
+1219C;CUNEIFORM SIGN KASKAL;Lo;0;L;;;;;N;;;;;
+1219D;CUNEIFORM SIGN KASKAL LAGAB TIMES U OVER LAGAB TIMES U;Lo;0;L;;;;;N;;;;;
+1219E;CUNEIFORM SIGN KASKAL OVER KASKAL LAGAB TIMES U OVER LAGAB TIMES U;Lo;0;L;;;;;N;;;;;
+1219F;CUNEIFORM SIGN KESH2;Lo;0;L;;;;;N;;;;;
+121A0;CUNEIFORM SIGN KI;Lo;0;L;;;;;N;;;;;
+121A1;CUNEIFORM SIGN KI TIMES BAD;Lo;0;L;;;;;N;;;;;
+121A2;CUNEIFORM SIGN KI TIMES U;Lo;0;L;;;;;N;;;;;
+121A3;CUNEIFORM SIGN KI TIMES UD;Lo;0;L;;;;;N;;;;;
+121A4;CUNEIFORM SIGN KID;Lo;0;L;;;;;N;;;;;
+121A5;CUNEIFORM SIGN KIN;Lo;0;L;;;;;N;;;;;
+121A6;CUNEIFORM SIGN KISAL;Lo;0;L;;;;;N;;;;;
+121A7;CUNEIFORM SIGN KISH;Lo;0;L;;;;;N;;;;;
+121A8;CUNEIFORM SIGN KISIM5;Lo;0;L;;;;;N;;;;;
+121A9;CUNEIFORM SIGN KISIM5 OVER KISIM5;Lo;0;L;;;;;N;;;;;
+121AA;CUNEIFORM SIGN KU;Lo;0;L;;;;;N;;;;;
+121AB;CUNEIFORM SIGN KU OVER HI TIMES ASH2 KU OVER HI TIMES ASH2;Lo;0;L;;;;;N;;;;;
+121AC;CUNEIFORM SIGN KU3;Lo;0;L;;;;;N;;;;;
+121AD;CUNEIFORM SIGN KU4;Lo;0;L;;;;;N;;;;;
+121AE;CUNEIFORM SIGN KU4 VARIANT FORM;Lo;0;L;;;;;N;;;;;
+121AF;CUNEIFORM SIGN KU7;Lo;0;L;;;;;N;;;;;
+121B0;CUNEIFORM SIGN KUL;Lo;0;L;;;;;N;;;;;
+121B1;CUNEIFORM SIGN KUL GUNU;Lo;0;L;;;;;N;;;;;
+121B2;CUNEIFORM SIGN KUN;Lo;0;L;;;;;N;;;;;
+121B3;CUNEIFORM SIGN KUR;Lo;0;L;;;;;N;;;;;
+121B4;CUNEIFORM SIGN KUR OPPOSING KUR;Lo;0;L;;;;;N;;;;;
+121B5;CUNEIFORM SIGN KUSHU2;Lo;0;L;;;;;N;;;;;
+121B6;CUNEIFORM SIGN KWU318;Lo;0;L;;;;;N;;;;;
+121B7;CUNEIFORM SIGN LA;Lo;0;L;;;;;N;;;;;
+121B8;CUNEIFORM SIGN LAGAB;Lo;0;L;;;;;N;;;;;
+121B9;CUNEIFORM SIGN LAGAB TIMES A;Lo;0;L;;;;;N;;;;;
+121BA;CUNEIFORM SIGN LAGAB TIMES A PLUS DA PLUS HA;Lo;0;L;;;;;N;;;;;
+121BB;CUNEIFORM SIGN LAGAB TIMES A PLUS GAR;Lo;0;L;;;;;N;;;;;
+121BC;CUNEIFORM SIGN LAGAB TIMES A PLUS LAL;Lo;0;L;;;;;N;;;;;
+121BD;CUNEIFORM SIGN LAGAB TIMES AL;Lo;0;L;;;;;N;;;;;
+121BE;CUNEIFORM SIGN LAGAB TIMES AN;Lo;0;L;;;;;N;;;;;
+121BF;CUNEIFORM SIGN LAGAB TIMES ASH ZIDA TENU;Lo;0;L;;;;;N;;;;;
+121C0;CUNEIFORM SIGN LAGAB TIMES BAD;Lo;0;L;;;;;N;;;;;
+121C1;CUNEIFORM SIGN LAGAB TIMES BI;Lo;0;L;;;;;N;;;;;
+121C2;CUNEIFORM SIGN LAGAB TIMES DAR;Lo;0;L;;;;;N;;;;;
+121C3;CUNEIFORM SIGN LAGAB TIMES EN;Lo;0;L;;;;;N;;;;;
+121C4;CUNEIFORM SIGN LAGAB TIMES GA;Lo;0;L;;;;;N;;;;;
+121C5;CUNEIFORM SIGN LAGAB TIMES GAR;Lo;0;L;;;;;N;;;;;
+121C6;CUNEIFORM SIGN LAGAB TIMES GUD;Lo;0;L;;;;;N;;;;;
+121C7;CUNEIFORM SIGN LAGAB TIMES GUD PLUS GUD;Lo;0;L;;;;;N;;;;;
+121C8;CUNEIFORM SIGN LAGAB TIMES HA;Lo;0;L;;;;;N;;;;;
+121C9;CUNEIFORM SIGN LAGAB TIMES HAL;Lo;0;L;;;;;N;;;;;
+121CA;CUNEIFORM SIGN LAGAB TIMES HI TIMES NUN;Lo;0;L;;;;;N;;;;;
+121CB;CUNEIFORM SIGN LAGAB TIMES IGI GUNU;Lo;0;L;;;;;N;;;;;
+121CC;CUNEIFORM SIGN LAGAB TIMES IM;Lo;0;L;;;;;N;;;;;
+121CD;CUNEIFORM SIGN LAGAB TIMES IM PLUS HA;Lo;0;L;;;;;N;;;;;
+121CE;CUNEIFORM SIGN LAGAB TIMES IM PLUS LU;Lo;0;L;;;;;N;;;;;
+121CF;CUNEIFORM SIGN LAGAB TIMES KI;Lo;0;L;;;;;N;;;;;
+121D0;CUNEIFORM SIGN LAGAB TIMES KIN;Lo;0;L;;;;;N;;;;;
+121D1;CUNEIFORM SIGN LAGAB TIMES KU3;Lo;0;L;;;;;N;;;;;
+121D2;CUNEIFORM SIGN LAGAB TIMES KUL;Lo;0;L;;;;;N;;;;;
+121D3;CUNEIFORM SIGN LAGAB TIMES KUL PLUS HI PLUS A;Lo;0;L;;;;;N;;;;;
+121D4;CUNEIFORM SIGN LAGAB TIMES LAGAB;Lo;0;L;;;;;N;;;;;
+121D5;CUNEIFORM SIGN LAGAB TIMES LISH;Lo;0;L;;;;;N;;;;;
+121D6;CUNEIFORM SIGN LAGAB TIMES LU;Lo;0;L;;;;;N;;;;;
+121D7;CUNEIFORM SIGN LAGAB TIMES LUL;Lo;0;L;;;;;N;;;;;
+121D8;CUNEIFORM SIGN LAGAB TIMES ME;Lo;0;L;;;;;N;;;;;
+121D9;CUNEIFORM SIGN LAGAB TIMES ME PLUS EN;Lo;0;L;;;;;N;;;;;
+121DA;CUNEIFORM SIGN LAGAB TIMES MUSH;Lo;0;L;;;;;N;;;;;
+121DB;CUNEIFORM SIGN LAGAB TIMES NE;Lo;0;L;;;;;N;;;;;
+121DC;CUNEIFORM SIGN LAGAB TIMES SHE PLUS SUM;Lo;0;L;;;;;N;;;;;
+121DD;CUNEIFORM SIGN LAGAB TIMES SHITA PLUS GISH PLUS ERIN2;Lo;0;L;;;;;N;;;;;
+121DE;CUNEIFORM SIGN LAGAB TIMES SHITA PLUS GISH TENU;Lo;0;L;;;;;N;;;;;
+121DF;CUNEIFORM SIGN LAGAB TIMES SHU2;Lo;0;L;;;;;N;;;;;
+121E0;CUNEIFORM SIGN LAGAB TIMES SHU2 PLUS SHU2;Lo;0;L;;;;;N;;;;;
+121E1;CUNEIFORM SIGN LAGAB TIMES SUM;Lo;0;L;;;;;N;;;;;
+121E2;CUNEIFORM SIGN LAGAB TIMES TAG;Lo;0;L;;;;;N;;;;;
+121E3;CUNEIFORM SIGN LAGAB TIMES TAK4;Lo;0;L;;;;;N;;;;;
+121E4;CUNEIFORM SIGN LAGAB TIMES TE PLUS A PLUS SU PLUS NA;Lo;0;L;;;;;N;;;;;
+121E5;CUNEIFORM SIGN LAGAB TIMES U;Lo;0;L;;;;;N;;;;;
+121E6;CUNEIFORM SIGN LAGAB TIMES U PLUS A;Lo;0;L;;;;;N;;;;;
+121E7;CUNEIFORM SIGN LAGAB TIMES U PLUS U PLUS U;Lo;0;L;;;;;N;;;;;
+121E8;CUNEIFORM SIGN LAGAB TIMES U2 PLUS ASH;Lo;0;L;;;;;N;;;;;
+121E9;CUNEIFORM SIGN LAGAB TIMES UD;Lo;0;L;;;;;N;;;;;
+121EA;CUNEIFORM SIGN LAGAB TIMES USH;Lo;0;L;;;;;N;;;;;
+121EB;CUNEIFORM SIGN LAGAB SQUARED;Lo;0;L;;;;;N;;;;;
+121EC;CUNEIFORM SIGN LAGAR;Lo;0;L;;;;;N;;;;;
+121ED;CUNEIFORM SIGN LAGAR TIMES SHE;Lo;0;L;;;;;N;;;;;
+121EE;CUNEIFORM SIGN LAGAR TIMES SHE PLUS SUM;Lo;0;L;;;;;N;;;;;
+121EF;CUNEIFORM SIGN LAGAR GUNU;Lo;0;L;;;;;N;;;;;
+121F0;CUNEIFORM SIGN LAGAR GUNU OVER LAGAR GUNU SHE;Lo;0;L;;;;;N;;;;;
+121F1;CUNEIFORM SIGN LAHSHU;Lo;0;L;;;;;N;;;;;
+121F2;CUNEIFORM SIGN LAL;Lo;0;L;;;;;N;;;;;
+121F3;CUNEIFORM SIGN LAL TIMES LAL;Lo;0;L;;;;;N;;;;;
+121F4;CUNEIFORM SIGN LAM;Lo;0;L;;;;;N;;;;;
+121F5;CUNEIFORM SIGN LAM TIMES KUR;Lo;0;L;;;;;N;;;;;
+121F6;CUNEIFORM SIGN LAM TIMES KUR PLUS RU;Lo;0;L;;;;;N;;;;;
+121F7;CUNEIFORM SIGN LI;Lo;0;L;;;;;N;;;;;
+121F8;CUNEIFORM SIGN LIL;Lo;0;L;;;;;N;;;;;
+121F9;CUNEIFORM SIGN LIMMU2;Lo;0;L;;;;;N;;;;;
+121FA;CUNEIFORM SIGN LISH;Lo;0;L;;;;;N;;;;;
+121FB;CUNEIFORM SIGN LU;Lo;0;L;;;;;N;;;;;
+121FC;CUNEIFORM SIGN LU TIMES BAD;Lo;0;L;;;;;N;;;;;
+121FD;CUNEIFORM SIGN LU2;Lo;0;L;;;;;N;;;;;
+121FE;CUNEIFORM SIGN LU2 TIMES AL;Lo;0;L;;;;;N;;;;;
+121FF;CUNEIFORM SIGN LU2 TIMES BAD;Lo;0;L;;;;;N;;;;;
+12200;CUNEIFORM SIGN LU2 TIMES ESH2;Lo;0;L;;;;;N;;;;;
+12201;CUNEIFORM SIGN LU2 TIMES ESH2 TENU;Lo;0;L;;;;;N;;;;;
+12202;CUNEIFORM SIGN LU2 TIMES GAN2 TENU;Lo;0;L;;;;;N;;;;;
+12203;CUNEIFORM SIGN LU2 TIMES HI TIMES BAD;Lo;0;L;;;;;N;;;;;
+12204;CUNEIFORM SIGN LU2 TIMES IM;Lo;0;L;;;;;N;;;;;
+12205;CUNEIFORM SIGN LU2 TIMES KAD2;Lo;0;L;;;;;N;;;;;
+12206;CUNEIFORM SIGN LU2 TIMES KAD3;Lo;0;L;;;;;N;;;;;
+12207;CUNEIFORM SIGN LU2 TIMES KAD3 PLUS ASH;Lo;0;L;;;;;N;;;;;
+12208;CUNEIFORM SIGN LU2 TIMES KI;Lo;0;L;;;;;N;;;;;
+12209;CUNEIFORM SIGN LU2 TIMES LA PLUS ASH;Lo;0;L;;;;;N;;;;;
+1220A;CUNEIFORM SIGN LU2 TIMES LAGAB;Lo;0;L;;;;;N;;;;;
+1220B;CUNEIFORM SIGN LU2 TIMES ME PLUS EN;Lo;0;L;;;;;N;;;;;
+1220C;CUNEIFORM SIGN LU2 TIMES NE;Lo;0;L;;;;;N;;;;;
+1220D;CUNEIFORM SIGN LU2 TIMES NU;Lo;0;L;;;;;N;;;;;
+1220E;CUNEIFORM SIGN LU2 TIMES SI PLUS ASH;Lo;0;L;;;;;N;;;;;
+1220F;CUNEIFORM SIGN LU2 TIMES SIK2 PLUS BU;Lo;0;L;;;;;N;;;;;
+12210;CUNEIFORM SIGN LU2 TIMES TUG2;Lo;0;L;;;;;N;;;;;
+12211;CUNEIFORM SIGN LU2 TENU;Lo;0;L;;;;;N;;;;;
+12212;CUNEIFORM SIGN LU2 CROSSING LU2;Lo;0;L;;;;;N;;;;;
+12213;CUNEIFORM SIGN LU2 OPPOSING LU2;Lo;0;L;;;;;N;;;;;
+12214;CUNEIFORM SIGN LU2 SQUARED;Lo;0;L;;;;;N;;;;;
+12215;CUNEIFORM SIGN LU2 SHESHIG;Lo;0;L;;;;;N;;;;;
+12216;CUNEIFORM SIGN LU3;Lo;0;L;;;;;N;;;;;
+12217;CUNEIFORM SIGN LUGAL;Lo;0;L;;;;;N;;;;;
+12218;CUNEIFORM SIGN LUGAL OVER LUGAL;Lo;0;L;;;;;N;;;;;
+12219;CUNEIFORM SIGN LUGAL OPPOSING LUGAL;Lo;0;L;;;;;N;;;;;
+1221A;CUNEIFORM SIGN LUGAL SHESHIG;Lo;0;L;;;;;N;;;;;
+1221B;CUNEIFORM SIGN LUH;Lo;0;L;;;;;N;;;;;
+1221C;CUNEIFORM SIGN LUL;Lo;0;L;;;;;N;;;;;
+1221D;CUNEIFORM SIGN LUM;Lo;0;L;;;;;N;;;;;
+1221E;CUNEIFORM SIGN LUM OVER LUM;Lo;0;L;;;;;N;;;;;
+1221F;CUNEIFORM SIGN LUM OVER LUM GAR OVER GAR;Lo;0;L;;;;;N;;;;;
+12220;CUNEIFORM SIGN MA;Lo;0;L;;;;;N;;;;;
+12221;CUNEIFORM SIGN MA TIMES TAK4;Lo;0;L;;;;;N;;;;;
+12222;CUNEIFORM SIGN MA GUNU;Lo;0;L;;;;;N;;;;;
+12223;CUNEIFORM SIGN MA2;Lo;0;L;;;;;N;;;;;
+12224;CUNEIFORM SIGN MAH;Lo;0;L;;;;;N;;;;;
+12225;CUNEIFORM SIGN MAR;Lo;0;L;;;;;N;;;;;
+12226;CUNEIFORM SIGN MASH;Lo;0;L;;;;;N;;;;;
+12227;CUNEIFORM SIGN MASH2;Lo;0;L;;;;;N;;;;;
+12228;CUNEIFORM SIGN ME;Lo;0;L;;;;;N;;;;;
+12229;CUNEIFORM SIGN MES;Lo;0;L;;;;;N;;;;;
+1222A;CUNEIFORM SIGN MI;Lo;0;L;;;;;N;;;;;
+1222B;CUNEIFORM SIGN MIN;Lo;0;L;;;;;N;;;;;
+1222C;CUNEIFORM SIGN MU;Lo;0;L;;;;;N;;;;;
+1222D;CUNEIFORM SIGN MU OVER MU;Lo;0;L;;;;;N;;;;;
+1222E;CUNEIFORM SIGN MUG;Lo;0;L;;;;;N;;;;;
+1222F;CUNEIFORM SIGN MUG GUNU;Lo;0;L;;;;;N;;;;;
+12230;CUNEIFORM SIGN MUNSUB;Lo;0;L;;;;;N;;;;;
+12231;CUNEIFORM SIGN MURGU2;Lo;0;L;;;;;N;;;;;
+12232;CUNEIFORM SIGN MUSH;Lo;0;L;;;;;N;;;;;
+12233;CUNEIFORM SIGN MUSH TIMES A;Lo;0;L;;;;;N;;;;;
+12234;CUNEIFORM SIGN MUSH TIMES KUR;Lo;0;L;;;;;N;;;;;
+12235;CUNEIFORM SIGN MUSH TIMES ZA;Lo;0;L;;;;;N;;;;;
+12236;CUNEIFORM SIGN MUSH OVER MUSH;Lo;0;L;;;;;N;;;;;
+12237;CUNEIFORM SIGN MUSH OVER MUSH TIMES A PLUS NA;Lo;0;L;;;;;N;;;;;
+12238;CUNEIFORM SIGN MUSH CROSSING MUSH;Lo;0;L;;;;;N;;;;;
+12239;CUNEIFORM SIGN MUSH3;Lo;0;L;;;;;N;;;;;
+1223A;CUNEIFORM SIGN MUSH3 TIMES A;Lo;0;L;;;;;N;;;;;
+1223B;CUNEIFORM SIGN MUSH3 TIMES A PLUS DI;Lo;0;L;;;;;N;;;;;
+1223C;CUNEIFORM SIGN MUSH3 TIMES DI;Lo;0;L;;;;;N;;;;;
+1223D;CUNEIFORM SIGN MUSH3 GUNU;Lo;0;L;;;;;N;;;;;
+1223E;CUNEIFORM SIGN NA;Lo;0;L;;;;;N;;;;;
+1223F;CUNEIFORM SIGN NA2;Lo;0;L;;;;;N;;;;;
+12240;CUNEIFORM SIGN NAGA;Lo;0;L;;;;;N;;;;;
+12241;CUNEIFORM SIGN NAGA INVERTED;Lo;0;L;;;;;N;;;;;
+12242;CUNEIFORM SIGN NAGA TIMES SHU TENU;Lo;0;L;;;;;N;;;;;
+12243;CUNEIFORM SIGN NAGA OPPOSING NAGA;Lo;0;L;;;;;N;;;;;
+12244;CUNEIFORM SIGN NAGAR;Lo;0;L;;;;;N;;;;;
+12245;CUNEIFORM SIGN NAM NUTILLU;Lo;0;L;;;;;N;;;;;
+12246;CUNEIFORM SIGN NAM;Lo;0;L;;;;;N;;;;;
+12247;CUNEIFORM SIGN NAM2;Lo;0;L;;;;;N;;;;;
+12248;CUNEIFORM SIGN NE;Lo;0;L;;;;;N;;;;;
+12249;CUNEIFORM SIGN NE TIMES A;Lo;0;L;;;;;N;;;;;
+1224A;CUNEIFORM SIGN NE TIMES UD;Lo;0;L;;;;;N;;;;;
+1224B;CUNEIFORM SIGN NE SHESHIG;Lo;0;L;;;;;N;;;;;
+1224C;CUNEIFORM SIGN NI;Lo;0;L;;;;;N;;;;;
+1224D;CUNEIFORM SIGN NI TIMES E;Lo;0;L;;;;;N;;;;;
+1224E;CUNEIFORM SIGN NI2;Lo;0;L;;;;;N;;;;;
+1224F;CUNEIFORM SIGN NIM;Lo;0;L;;;;;N;;;;;
+12250;CUNEIFORM SIGN NIM TIMES GAN2 TENU;Lo;0;L;;;;;N;;;;;
+12251;CUNEIFORM SIGN NIM TIMES GAR PLUS GAN2 TENU;Lo;0;L;;;;;N;;;;;
+12252;CUNEIFORM SIGN NINDA2;Lo;0;L;;;;;N;;;;;
+12253;CUNEIFORM SIGN NINDA2 TIMES AN;Lo;0;L;;;;;N;;;;;
+12254;CUNEIFORM SIGN NINDA2 TIMES ASH;Lo;0;L;;;;;N;;;;;
+12255;CUNEIFORM SIGN NINDA2 TIMES ASH PLUS ASH;Lo;0;L;;;;;N;;;;;
+12256;CUNEIFORM SIGN NINDA2 TIMES GUD;Lo;0;L;;;;;N;;;;;
+12257;CUNEIFORM SIGN NINDA2 TIMES ME PLUS GAN2 TENU;Lo;0;L;;;;;N;;;;;
+12258;CUNEIFORM SIGN NINDA2 TIMES NE;Lo;0;L;;;;;N;;;;;
+12259;CUNEIFORM SIGN NINDA2 TIMES NUN;Lo;0;L;;;;;N;;;;;
+1225A;CUNEIFORM SIGN NINDA2 TIMES SHE;Lo;0;L;;;;;N;;;;;
+1225B;CUNEIFORM SIGN NINDA2 TIMES SHE PLUS A AN;Lo;0;L;;;;;N;;;;;
+1225C;CUNEIFORM SIGN NINDA2 TIMES SHE PLUS ASH;Lo;0;L;;;;;N;;;;;
+1225D;CUNEIFORM SIGN NINDA2 TIMES SHE PLUS ASH PLUS ASH;Lo;0;L;;;;;N;;;;;
+1225E;CUNEIFORM SIGN NINDA2 TIMES U2 PLUS ASH;Lo;0;L;;;;;N;;;;;
+1225F;CUNEIFORM SIGN NINDA2 TIMES USH;Lo;0;L;;;;;N;;;;;
+12260;CUNEIFORM SIGN NISAG;Lo;0;L;;;;;N;;;;;
+12261;CUNEIFORM SIGN NU;Lo;0;L;;;;;N;;;;;
+12262;CUNEIFORM SIGN NU11;Lo;0;L;;;;;N;;;;;
+12263;CUNEIFORM SIGN NUN;Lo;0;L;;;;;N;;;;;
+12264;CUNEIFORM SIGN NUN LAGAR TIMES GAR;Lo;0;L;;;;;N;;;;;
+12265;CUNEIFORM SIGN NUN LAGAR TIMES MASH;Lo;0;L;;;;;N;;;;;
+12266;CUNEIFORM SIGN NUN LAGAR TIMES SAL;Lo;0;L;;;;;N;;;;;
+12267;CUNEIFORM SIGN NUN LAGAR TIMES SAL OVER NUN LAGAR TIMES SAL;Lo;0;L;;;;;N;;;;;
+12268;CUNEIFORM SIGN NUN LAGAR TIMES USH;Lo;0;L;;;;;N;;;;;
+12269;CUNEIFORM SIGN NUN TENU;Lo;0;L;;;;;N;;;;;
+1226A;CUNEIFORM SIGN NUN OVER NUN;Lo;0;L;;;;;N;;;;;
+1226B;CUNEIFORM SIGN NUN CROSSING NUN;Lo;0;L;;;;;N;;;;;
+1226C;CUNEIFORM SIGN NUN CROSSING NUN LAGAR OVER LAGAR;Lo;0;L;;;;;N;;;;;
+1226D;CUNEIFORM SIGN NUNUZ;Lo;0;L;;;;;N;;;;;
+1226E;CUNEIFORM SIGN NUNUZ AB2 TIMES ASHGAB;Lo;0;L;;;;;N;;;;;
+1226F;CUNEIFORM SIGN NUNUZ AB2 TIMES BI;Lo;0;L;;;;;N;;;;;
+12270;CUNEIFORM SIGN NUNUZ AB2 TIMES DUG;Lo;0;L;;;;;N;;;;;
+12271;CUNEIFORM SIGN NUNUZ AB2 TIMES GUD;Lo;0;L;;;;;N;;;;;
+12272;CUNEIFORM SIGN NUNUZ AB2 TIMES IGI GUNU;Lo;0;L;;;;;N;;;;;
+12273;CUNEIFORM SIGN NUNUZ AB2 TIMES KAD3;Lo;0;L;;;;;N;;;;;
+12274;CUNEIFORM SIGN NUNUZ AB2 TIMES LA;Lo;0;L;;;;;N;;;;;
+12275;CUNEIFORM SIGN NUNUZ AB2 TIMES NE;Lo;0;L;;;;;N;;;;;
+12276;CUNEIFORM SIGN NUNUZ AB2 TIMES SILA3;Lo;0;L;;;;;N;;;;;
+12277;CUNEIFORM SIGN NUNUZ AB2 TIMES U2;Lo;0;L;;;;;N;;;;;
+12278;CUNEIFORM SIGN NUNUZ KISIM5 TIMES BI;Lo;0;L;;;;;N;;;;;
+12279;CUNEIFORM SIGN NUNUZ KISIM5 TIMES BI U;Lo;0;L;;;;;N;;;;;
+1227A;CUNEIFORM SIGN PA;Lo;0;L;;;;;N;;;;;
+1227B;CUNEIFORM SIGN PAD;Lo;0;L;;;;;N;;;;;
+1227C;CUNEIFORM SIGN PAN;Lo;0;L;;;;;N;;;;;
+1227D;CUNEIFORM SIGN PAP;Lo;0;L;;;;;N;;;;;
+1227E;CUNEIFORM SIGN PESH2;Lo;0;L;;;;;N;;;;;
+1227F;CUNEIFORM SIGN PI;Lo;0;L;;;;;N;;;;;
+12280;CUNEIFORM SIGN PI TIMES A;Lo;0;L;;;;;N;;;;;
+12281;CUNEIFORM SIGN PI TIMES AB;Lo;0;L;;;;;N;;;;;
+12282;CUNEIFORM SIGN PI TIMES BI;Lo;0;L;;;;;N;;;;;
+12283;CUNEIFORM SIGN PI TIMES BU;Lo;0;L;;;;;N;;;;;
+12284;CUNEIFORM SIGN PI TIMES E;Lo;0;L;;;;;N;;;;;
+12285;CUNEIFORM SIGN PI TIMES I;Lo;0;L;;;;;N;;;;;
+12286;CUNEIFORM SIGN PI TIMES IB;Lo;0;L;;;;;N;;;;;
+12287;CUNEIFORM SIGN PI TIMES U;Lo;0;L;;;;;N;;;;;
+12288;CUNEIFORM SIGN PI TIMES U2;Lo;0;L;;;;;N;;;;;
+12289;CUNEIFORM SIGN PI CROSSING PI;Lo;0;L;;;;;N;;;;;
+1228A;CUNEIFORM SIGN PIRIG;Lo;0;L;;;;;N;;;;;
+1228B;CUNEIFORM SIGN PIRIG TIMES KAL;Lo;0;L;;;;;N;;;;;
+1228C;CUNEIFORM SIGN PIRIG TIMES UD;Lo;0;L;;;;;N;;;;;
+1228D;CUNEIFORM SIGN PIRIG TIMES ZA;Lo;0;L;;;;;N;;;;;
+1228E;CUNEIFORM SIGN PIRIG OPPOSING PIRIG;Lo;0;L;;;;;N;;;;;
+1228F;CUNEIFORM SIGN RA;Lo;0;L;;;;;N;;;;;
+12290;CUNEIFORM SIGN RAB;Lo;0;L;;;;;N;;;;;
+12291;CUNEIFORM SIGN RI;Lo;0;L;;;;;N;;;;;
+12292;CUNEIFORM SIGN RU;Lo;0;L;;;;;N;;;;;
+12293;CUNEIFORM SIGN SA;Lo;0;L;;;;;N;;;;;
+12294;CUNEIFORM SIGN SAG NUTILLU;Lo;0;L;;;;;N;;;;;
+12295;CUNEIFORM SIGN SAG;Lo;0;L;;;;;N;;;;;
+12296;CUNEIFORM SIGN SAG TIMES A;Lo;0;L;;;;;N;;;;;
+12297;CUNEIFORM SIGN SAG TIMES DU;Lo;0;L;;;;;N;;;;;
+12298;CUNEIFORM SIGN SAG TIMES DUB;Lo;0;L;;;;;N;;;;;
+12299;CUNEIFORM SIGN SAG TIMES HA;Lo;0;L;;;;;N;;;;;
+1229A;CUNEIFORM SIGN SAG TIMES KAK;Lo;0;L;;;;;N;;;;;
+1229B;CUNEIFORM SIGN SAG TIMES KUR;Lo;0;L;;;;;N;;;;;
+1229C;CUNEIFORM SIGN SAG TIMES LUM;Lo;0;L;;;;;N;;;;;
+1229D;CUNEIFORM SIGN SAG TIMES MI;Lo;0;L;;;;;N;;;;;
+1229E;CUNEIFORM SIGN SAG TIMES NUN;Lo;0;L;;;;;N;;;;;
+1229F;CUNEIFORM SIGN SAG TIMES SAL;Lo;0;L;;;;;N;;;;;
+122A0;CUNEIFORM SIGN SAG TIMES SHID;Lo;0;L;;;;;N;;;;;
+122A1;CUNEIFORM SIGN SAG TIMES TAB;Lo;0;L;;;;;N;;;;;
+122A2;CUNEIFORM SIGN SAG TIMES U2;Lo;0;L;;;;;N;;;;;
+122A3;CUNEIFORM SIGN SAG TIMES UB;Lo;0;L;;;;;N;;;;;
+122A4;CUNEIFORM SIGN SAG TIMES UM;Lo;0;L;;;;;N;;;;;
+122A5;CUNEIFORM SIGN SAG TIMES UR;Lo;0;L;;;;;N;;;;;
+122A6;CUNEIFORM SIGN SAG TIMES USH;Lo;0;L;;;;;N;;;;;
+122A7;CUNEIFORM SIGN SAG OVER SAG;Lo;0;L;;;;;N;;;;;
+122A8;CUNEIFORM SIGN SAG GUNU;Lo;0;L;;;;;N;;;;;
+122A9;CUNEIFORM SIGN SAL;Lo;0;L;;;;;N;;;;;
+122AA;CUNEIFORM SIGN SAL LAGAB TIMES ASH2;Lo;0;L;;;;;N;;;;;
+122AB;CUNEIFORM SIGN SANGA2;Lo;0;L;;;;;N;;;;;
+122AC;CUNEIFORM SIGN SAR;Lo;0;L;;;;;N;;;;;
+122AD;CUNEIFORM SIGN SHA;Lo;0;L;;;;;N;;;;;
+122AE;CUNEIFORM SIGN SHA3;Lo;0;L;;;;;N;;;;;
+122AF;CUNEIFORM SIGN SHA3 TIMES A;Lo;0;L;;;;;N;;;;;
+122B0;CUNEIFORM SIGN SHA3 TIMES BAD;Lo;0;L;;;;;N;;;;;
+122B1;CUNEIFORM SIGN SHA3 TIMES GISH;Lo;0;L;;;;;N;;;;;
+122B2;CUNEIFORM SIGN SHA3 TIMES NE;Lo;0;L;;;;;N;;;;;
+122B3;CUNEIFORM SIGN SHA3 TIMES SHU2;Lo;0;L;;;;;N;;;;;
+122B4;CUNEIFORM SIGN SHA3 TIMES TUR;Lo;0;L;;;;;N;;;;;
+122B5;CUNEIFORM SIGN SHA3 TIMES U;Lo;0;L;;;;;N;;;;;
+122B6;CUNEIFORM SIGN SHA3 TIMES U PLUS A;Lo;0;L;;;;;N;;;;;
+122B7;CUNEIFORM SIGN SHA6;Lo;0;L;;;;;N;;;;;
+122B8;CUNEIFORM SIGN SHAB6;Lo;0;L;;;;;N;;;;;
+122B9;CUNEIFORM SIGN SHAR2;Lo;0;L;;;;;N;;;;;
+122BA;CUNEIFORM SIGN SHE;Lo;0;L;;;;;N;;;;;
+122BB;CUNEIFORM SIGN SHE HU;Lo;0;L;;;;;N;;;;;
+122BC;CUNEIFORM SIGN SHE OVER SHE GAD OVER GAD GAR OVER GAR;Lo;0;L;;;;;N;;;;;
+122BD;CUNEIFORM SIGN SHE OVER SHE TAB OVER TAB GAR OVER GAR;Lo;0;L;;;;;N;;;;;
+122BE;CUNEIFORM SIGN SHEG9;Lo;0;L;;;;;N;;;;;
+122BF;CUNEIFORM SIGN SHEN;Lo;0;L;;;;;N;;;;;
+122C0;CUNEIFORM SIGN SHESH;Lo;0;L;;;;;N;;;;;
+122C1;CUNEIFORM SIGN SHESH2;Lo;0;L;;;;;N;;;;;
+122C2;CUNEIFORM SIGN SHESHLAM;Lo;0;L;;;;;N;;;;;
+122C3;CUNEIFORM SIGN SHID;Lo;0;L;;;;;N;;;;;
+122C4;CUNEIFORM SIGN SHID TIMES A;Lo;0;L;;;;;N;;;;;
+122C5;CUNEIFORM SIGN SHID TIMES IM;Lo;0;L;;;;;N;;;;;
+122C6;CUNEIFORM SIGN SHIM;Lo;0;L;;;;;N;;;;;
+122C7;CUNEIFORM SIGN SHIM TIMES A;Lo;0;L;;;;;N;;;;;
+122C8;CUNEIFORM SIGN SHIM TIMES BAL;Lo;0;L;;;;;N;;;;;
+122C9;CUNEIFORM SIGN SHIM TIMES BULUG;Lo;0;L;;;;;N;;;;;
+122CA;CUNEIFORM SIGN SHIM TIMES DIN;Lo;0;L;;;;;N;;;;;
+122CB;CUNEIFORM SIGN SHIM TIMES GAR;Lo;0;L;;;;;N;;;;;
+122CC;CUNEIFORM SIGN SHIM TIMES IGI;Lo;0;L;;;;;N;;;;;
+122CD;CUNEIFORM SIGN SHIM TIMES IGI GUNU;Lo;0;L;;;;;N;;;;;
+122CE;CUNEIFORM SIGN SHIM TIMES KUSHU2;Lo;0;L;;;;;N;;;;;
+122CF;CUNEIFORM SIGN SHIM TIMES LUL;Lo;0;L;;;;;N;;;;;
+122D0;CUNEIFORM SIGN SHIM TIMES MUG;Lo;0;L;;;;;N;;;;;
+122D1;CUNEIFORM SIGN SHIM TIMES SAL;Lo;0;L;;;;;N;;;;;
+122D2;CUNEIFORM SIGN SHINIG;Lo;0;L;;;;;N;;;;;
+122D3;CUNEIFORM SIGN SHIR;Lo;0;L;;;;;N;;;;;
+122D4;CUNEIFORM SIGN SHIR TENU;Lo;0;L;;;;;N;;;;;
+122D5;CUNEIFORM SIGN SHIR OVER SHIR BUR OVER BUR;Lo;0;L;;;;;N;;;;;
+122D6;CUNEIFORM SIGN SHITA;Lo;0;L;;;;;N;;;;;
+122D7;CUNEIFORM SIGN SHU;Lo;0;L;;;;;N;;;;;
+122D8;CUNEIFORM SIGN SHU OVER INVERTED SHU;Lo;0;L;;;;;N;;;;;
+122D9;CUNEIFORM SIGN SHU2;Lo;0;L;;;;;N;;;;;
+122DA;CUNEIFORM SIGN SHUBUR;Lo;0;L;;;;;N;;;;;
+122DB;CUNEIFORM SIGN SI;Lo;0;L;;;;;N;;;;;
+122DC;CUNEIFORM SIGN SI GUNU;Lo;0;L;;;;;N;;;;;
+122DD;CUNEIFORM SIGN SIG;Lo;0;L;;;;;N;;;;;
+122DE;CUNEIFORM SIGN SIG4;Lo;0;L;;;;;N;;;;;
+122DF;CUNEIFORM SIGN SIG4 OVER SIG4 SHU2;Lo;0;L;;;;;N;;;;;
+122E0;CUNEIFORM SIGN SIK2;Lo;0;L;;;;;N;;;;;
+122E1;CUNEIFORM SIGN SILA3;Lo;0;L;;;;;N;;;;;
+122E2;CUNEIFORM SIGN SU;Lo;0;L;;;;;N;;;;;
+122E3;CUNEIFORM SIGN SU OVER SU;Lo;0;L;;;;;N;;;;;
+122E4;CUNEIFORM SIGN SUD;Lo;0;L;;;;;N;;;;;
+122E5;CUNEIFORM SIGN SUD2;Lo;0;L;;;;;N;;;;;
+122E6;CUNEIFORM SIGN SUHUR;Lo;0;L;;;;;N;;;;;
+122E7;CUNEIFORM SIGN SUM;Lo;0;L;;;;;N;;;;;
+122E8;CUNEIFORM SIGN SUMASH;Lo;0;L;;;;;N;;;;;
+122E9;CUNEIFORM SIGN SUR;Lo;0;L;;;;;N;;;;;
+122EA;CUNEIFORM SIGN SUR9;Lo;0;L;;;;;N;;;;;
+122EB;CUNEIFORM SIGN TA;Lo;0;L;;;;;N;;;;;
+122EC;CUNEIFORM SIGN TA ASTERISK;Lo;0;L;;;;;N;;;;;
+122ED;CUNEIFORM SIGN TA TIMES HI;Lo;0;L;;;;;N;;;;;
+122EE;CUNEIFORM SIGN TA TIMES MI;Lo;0;L;;;;;N;;;;;
+122EF;CUNEIFORM SIGN TA GUNU;Lo;0;L;;;;;N;;;;;
+122F0;CUNEIFORM SIGN TAB;Lo;0;L;;;;;N;;;;;
+122F1;CUNEIFORM SIGN TAB OVER TAB NI OVER NI DISH OVER DISH;Lo;0;L;;;;;N;;;;;
+122F2;CUNEIFORM SIGN TAB SQUARED;Lo;0;L;;;;;N;;;;;
+122F3;CUNEIFORM SIGN TAG;Lo;0;L;;;;;N;;;;;
+122F4;CUNEIFORM SIGN TAG TIMES BI;Lo;0;L;;;;;N;;;;;
+122F5;CUNEIFORM SIGN TAG TIMES GUD;Lo;0;L;;;;;N;;;;;
+122F6;CUNEIFORM SIGN TAG TIMES SHE;Lo;0;L;;;;;N;;;;;
+122F7;CUNEIFORM SIGN TAG TIMES SHU;Lo;0;L;;;;;N;;;;;
+122F8;CUNEIFORM SIGN TAG TIMES TUG2;Lo;0;L;;;;;N;;;;;
+122F9;CUNEIFORM SIGN TAG TIMES UD;Lo;0;L;;;;;N;;;;;
+122FA;CUNEIFORM SIGN TAK4;Lo;0;L;;;;;N;;;;;
+122FB;CUNEIFORM SIGN TAR;Lo;0;L;;;;;N;;;;;
+122FC;CUNEIFORM SIGN TE;Lo;0;L;;;;;N;;;;;
+122FD;CUNEIFORM SIGN TE GUNU;Lo;0;L;;;;;N;;;;;
+122FE;CUNEIFORM SIGN TI;Lo;0;L;;;;;N;;;;;
+122FF;CUNEIFORM SIGN TI TENU;Lo;0;L;;;;;N;;;;;
+12300;CUNEIFORM SIGN TIL;Lo;0;L;;;;;N;;;;;
+12301;CUNEIFORM SIGN TIR;Lo;0;L;;;;;N;;;;;
+12302;CUNEIFORM SIGN TIR TIMES TAK4;Lo;0;L;;;;;N;;;;;
+12303;CUNEIFORM SIGN TIR OVER TIR;Lo;0;L;;;;;N;;;;;
+12304;CUNEIFORM SIGN TIR OVER TIR GAD OVER GAD GAR OVER GAR;Lo;0;L;;;;;N;;;;;
+12305;CUNEIFORM SIGN TU;Lo;0;L;;;;;N;;;;;
+12306;CUNEIFORM SIGN TUG2;Lo;0;L;;;;;N;;;;;
+12307;CUNEIFORM SIGN TUK;Lo;0;L;;;;;N;;;;;
+12308;CUNEIFORM SIGN TUM;Lo;0;L;;;;;N;;;;;
+12309;CUNEIFORM SIGN TUR;Lo;0;L;;;;;N;;;;;
+1230A;CUNEIFORM SIGN TUR OVER TUR ZA OVER ZA;Lo;0;L;;;;;N;;;;;
+1230B;CUNEIFORM SIGN U;Lo;0;L;;;;;N;;;;;
+1230C;CUNEIFORM SIGN U GUD;Lo;0;L;;;;;N;;;;;
+1230D;CUNEIFORM SIGN U U U;Lo;0;L;;;;;N;;;;;
+1230E;CUNEIFORM SIGN U OVER U PA OVER PA GAR OVER GAR;Lo;0;L;;;;;N;;;;;
+1230F;CUNEIFORM SIGN U OVER U SUR OVER SUR;Lo;0;L;;;;;N;;;;;
+12310;CUNEIFORM SIGN U OVER U U REVERSED OVER U REVERSED;Lo;0;L;;;;;N;;;;;
+12311;CUNEIFORM SIGN U2;Lo;0;L;;;;;N;;;;;
+12312;CUNEIFORM SIGN UB;Lo;0;L;;;;;N;;;;;
+12313;CUNEIFORM SIGN UD;Lo;0;L;;;;;N;;;;;
+12314;CUNEIFORM SIGN UD KUSHU2;Lo;0;L;;;;;N;;;;;
+12315;CUNEIFORM SIGN UD TIMES BAD;Lo;0;L;;;;;N;;;;;
+12316;CUNEIFORM SIGN UD TIMES MI;Lo;0;L;;;;;N;;;;;
+12317;CUNEIFORM SIGN UD TIMES U PLUS U PLUS U;Lo;0;L;;;;;N;;;;;
+12318;CUNEIFORM SIGN UD TIMES U PLUS U PLUS U GUNU;Lo;0;L;;;;;N;;;;;
+12319;CUNEIFORM SIGN UD GUNU;Lo;0;L;;;;;N;;;;;
+1231A;CUNEIFORM SIGN UD SHESHIG;Lo;0;L;;;;;N;;;;;
+1231B;CUNEIFORM SIGN UD SHESHIG TIMES BAD;Lo;0;L;;;;;N;;;;;
+1231C;CUNEIFORM SIGN UDUG;Lo;0;L;;;;;N;;;;;
+1231D;CUNEIFORM SIGN UM;Lo;0;L;;;;;N;;;;;
+1231E;CUNEIFORM SIGN UM TIMES LAGAB;Lo;0;L;;;;;N;;;;;
+1231F;CUNEIFORM SIGN UM TIMES ME PLUS DA;Lo;0;L;;;;;N;;;;;
+12320;CUNEIFORM SIGN UM TIMES SHA3;Lo;0;L;;;;;N;;;;;
+12321;CUNEIFORM SIGN UM TIMES U;Lo;0;L;;;;;N;;;;;
+12322;CUNEIFORM SIGN UMBIN;Lo;0;L;;;;;N;;;;;
+12323;CUNEIFORM SIGN UMUM;Lo;0;L;;;;;N;;;;;
+12324;CUNEIFORM SIGN UMUM TIMES KASKAL;Lo;0;L;;;;;N;;;;;
+12325;CUNEIFORM SIGN UMUM TIMES PA;Lo;0;L;;;;;N;;;;;
+12326;CUNEIFORM SIGN UN;Lo;0;L;;;;;N;;;;;
+12327;CUNEIFORM SIGN UN GUNU;Lo;0;L;;;;;N;;;;;
+12328;CUNEIFORM SIGN UR;Lo;0;L;;;;;N;;;;;
+12329;CUNEIFORM SIGN UR CROSSING UR;Lo;0;L;;;;;N;;;;;
+1232A;CUNEIFORM SIGN UR SHESHIG;Lo;0;L;;;;;N;;;;;
+1232B;CUNEIFORM SIGN UR2;Lo;0;L;;;;;N;;;;;
+1232C;CUNEIFORM SIGN UR2 TIMES A PLUS HA;Lo;0;L;;;;;N;;;;;
+1232D;CUNEIFORM SIGN UR2 TIMES A PLUS NA;Lo;0;L;;;;;N;;;;;
+1232E;CUNEIFORM SIGN UR2 TIMES AL;Lo;0;L;;;;;N;;;;;
+1232F;CUNEIFORM SIGN UR2 TIMES HA;Lo;0;L;;;;;N;;;;;
+12330;CUNEIFORM SIGN UR2 TIMES NUN;Lo;0;L;;;;;N;;;;;
+12331;CUNEIFORM SIGN UR2 TIMES U2;Lo;0;L;;;;;N;;;;;
+12332;CUNEIFORM SIGN UR2 TIMES U2 PLUS ASH;Lo;0;L;;;;;N;;;;;
+12333;CUNEIFORM SIGN UR2 TIMES U2 PLUS BI;Lo;0;L;;;;;N;;;;;
+12334;CUNEIFORM SIGN UR4;Lo;0;L;;;;;N;;;;;
+12335;CUNEIFORM SIGN URI;Lo;0;L;;;;;N;;;;;
+12336;CUNEIFORM SIGN URI3;Lo;0;L;;;;;N;;;;;
+12337;CUNEIFORM SIGN URU;Lo;0;L;;;;;N;;;;;
+12338;CUNEIFORM SIGN URU TIMES A;Lo;0;L;;;;;N;;;;;
+12339;CUNEIFORM SIGN URU TIMES ASHGAB;Lo;0;L;;;;;N;;;;;
+1233A;CUNEIFORM SIGN URU TIMES BAR;Lo;0;L;;;;;N;;;;;
+1233B;CUNEIFORM SIGN URU TIMES DUN;Lo;0;L;;;;;N;;;;;
+1233C;CUNEIFORM SIGN URU TIMES GA;Lo;0;L;;;;;N;;;;;
+1233D;CUNEIFORM SIGN URU TIMES GAL;Lo;0;L;;;;;N;;;;;
+1233E;CUNEIFORM SIGN URU TIMES GAN2 TENU;Lo;0;L;;;;;N;;;;;
+1233F;CUNEIFORM SIGN URU TIMES GAR;Lo;0;L;;;;;N;;;;;
+12340;CUNEIFORM SIGN URU TIMES GU;Lo;0;L;;;;;N;;;;;
+12341;CUNEIFORM SIGN URU TIMES HA;Lo;0;L;;;;;N;;;;;
+12342;CUNEIFORM SIGN URU TIMES IGI;Lo;0;L;;;;;N;;;;;
+12343;CUNEIFORM SIGN URU TIMES IM;Lo;0;L;;;;;N;;;;;
+12344;CUNEIFORM SIGN URU TIMES ISH;Lo;0;L;;;;;N;;;;;
+12345;CUNEIFORM SIGN URU TIMES KI;Lo;0;L;;;;;N;;;;;
+12346;CUNEIFORM SIGN URU TIMES LUM;Lo;0;L;;;;;N;;;;;
+12347;CUNEIFORM SIGN URU TIMES MIN;Lo;0;L;;;;;N;;;;;
+12348;CUNEIFORM SIGN URU TIMES PA;Lo;0;L;;;;;N;;;;;
+12349;CUNEIFORM SIGN URU TIMES SHE;Lo;0;L;;;;;N;;;;;
+1234A;CUNEIFORM SIGN URU TIMES SIG4;Lo;0;L;;;;;N;;;;;
+1234B;CUNEIFORM SIGN URU TIMES TU;Lo;0;L;;;;;N;;;;;
+1234C;CUNEIFORM SIGN URU TIMES U PLUS GUD;Lo;0;L;;;;;N;;;;;
+1234D;CUNEIFORM SIGN URU TIMES UD;Lo;0;L;;;;;N;;;;;
+1234E;CUNEIFORM SIGN URU TIMES URUDA;Lo;0;L;;;;;N;;;;;
+1234F;CUNEIFORM SIGN URUDA;Lo;0;L;;;;;N;;;;;
+12350;CUNEIFORM SIGN URUDA TIMES U;Lo;0;L;;;;;N;;;;;
+12351;CUNEIFORM SIGN USH;Lo;0;L;;;;;N;;;;;
+12352;CUNEIFORM SIGN USH TIMES A;Lo;0;L;;;;;N;;;;;
+12353;CUNEIFORM SIGN USH TIMES KU;Lo;0;L;;;;;N;;;;;
+12354;CUNEIFORM SIGN USH TIMES KUR;Lo;0;L;;;;;N;;;;;
+12355;CUNEIFORM SIGN USH TIMES TAK4;Lo;0;L;;;;;N;;;;;
+12356;CUNEIFORM SIGN USHX;Lo;0;L;;;;;N;;;;;
+12357;CUNEIFORM SIGN USH2;Lo;0;L;;;;;N;;;;;
+12358;CUNEIFORM SIGN USHUMX;Lo;0;L;;;;;N;;;;;
+12359;CUNEIFORM SIGN UTUKI;Lo;0;L;;;;;N;;;;;
+1235A;CUNEIFORM SIGN UZ3;Lo;0;L;;;;;N;;;;;
+1235B;CUNEIFORM SIGN UZ3 TIMES KASKAL;Lo;0;L;;;;;N;;;;;
+1235C;CUNEIFORM SIGN UZU;Lo;0;L;;;;;N;;;;;
+1235D;CUNEIFORM SIGN ZA;Lo;0;L;;;;;N;;;;;
+1235E;CUNEIFORM SIGN ZA TENU;Lo;0;L;;;;;N;;;;;
+1235F;CUNEIFORM SIGN ZA SQUARED TIMES KUR;Lo;0;L;;;;;N;;;;;
+12360;CUNEIFORM SIGN ZAG;Lo;0;L;;;;;N;;;;;
+12361;CUNEIFORM SIGN ZAMX;Lo;0;L;;;;;N;;;;;
+12362;CUNEIFORM SIGN ZE2;Lo;0;L;;;;;N;;;;;
+12363;CUNEIFORM SIGN ZI;Lo;0;L;;;;;N;;;;;
+12364;CUNEIFORM SIGN ZI OVER ZI;Lo;0;L;;;;;N;;;;;
+12365;CUNEIFORM SIGN ZI3;Lo;0;L;;;;;N;;;;;
+12366;CUNEIFORM SIGN ZIB;Lo;0;L;;;;;N;;;;;
+12367;CUNEIFORM SIGN ZIB KABA TENU;Lo;0;L;;;;;N;;;;;
+12368;CUNEIFORM SIGN ZIG;Lo;0;L;;;;;N;;;;;
+12369;CUNEIFORM SIGN ZIZ2;Lo;0;L;;;;;N;;;;;
+1236A;CUNEIFORM SIGN ZU;Lo;0;L;;;;;N;;;;;
+1236B;CUNEIFORM SIGN ZU5;Lo;0;L;;;;;N;;;;;
+1236C;CUNEIFORM SIGN ZU5 TIMES A;Lo;0;L;;;;;N;;;;;
+1236D;CUNEIFORM SIGN ZUBUR;Lo;0;L;;;;;N;;;;;
+1236E;CUNEIFORM SIGN ZUM;Lo;0;L;;;;;N;;;;;
+1236F;CUNEIFORM SIGN KAP ELAMITE;Lo;0;L;;;;;N;;;;;
+12370;CUNEIFORM SIGN AB TIMES NUN;Lo;0;L;;;;;N;;;;;
+12371;CUNEIFORM SIGN AB2 TIMES A;Lo;0;L;;;;;N;;;;;
+12372;CUNEIFORM SIGN AMAR TIMES KUG;Lo;0;L;;;;;N;;;;;
+12373;CUNEIFORM SIGN DAG KISIM5 TIMES U2 PLUS MASH;Lo;0;L;;;;;N;;;;;
+12374;CUNEIFORM SIGN DAG3;Lo;0;L;;;;;N;;;;;
+12375;CUNEIFORM SIGN DISH PLUS SHU;Lo;0;L;;;;;N;;;;;
+12376;CUNEIFORM SIGN DUB TIMES SHE;Lo;0;L;;;;;N;;;;;
+12377;CUNEIFORM SIGN EZEN TIMES GUD;Lo;0;L;;;;;N;;;;;
+12378;CUNEIFORM SIGN EZEN TIMES SHE;Lo;0;L;;;;;N;;;;;
+12379;CUNEIFORM SIGN GA2 TIMES AN PLUS KAK PLUS A;Lo;0;L;;;;;N;;;;;
+1237A;CUNEIFORM SIGN GA2 TIMES ASH2;Lo;0;L;;;;;N;;;;;
+1237B;CUNEIFORM SIGN GE22;Lo;0;L;;;;;N;;;;;
+1237C;CUNEIFORM SIGN GIG;Lo;0;L;;;;;N;;;;;
+1237D;CUNEIFORM SIGN HUSH;Lo;0;L;;;;;N;;;;;
+1237E;CUNEIFORM SIGN KA TIMES ANSHE;Lo;0;L;;;;;N;;;;;
+1237F;CUNEIFORM SIGN KA TIMES ASH3;Lo;0;L;;;;;N;;;;;
+12380;CUNEIFORM SIGN KA TIMES GISH;Lo;0;L;;;;;N;;;;;
+12381;CUNEIFORM SIGN KA TIMES GUD;Lo;0;L;;;;;N;;;;;
+12382;CUNEIFORM SIGN KA TIMES HI TIMES ASH2;Lo;0;L;;;;;N;;;;;
+12383;CUNEIFORM SIGN KA TIMES LUM;Lo;0;L;;;;;N;;;;;
+12384;CUNEIFORM SIGN KA TIMES PA;Lo;0;L;;;;;N;;;;;
+12385;CUNEIFORM SIGN KA TIMES SHUL;Lo;0;L;;;;;N;;;;;
+12386;CUNEIFORM SIGN KA TIMES TU;Lo;0;L;;;;;N;;;;;
+12387;CUNEIFORM SIGN KA TIMES UR2;Lo;0;L;;;;;N;;;;;
+12388;CUNEIFORM SIGN LAGAB TIMES GI;Lo;0;L;;;;;N;;;;;
+12389;CUNEIFORM SIGN LU2 SHESHIG TIMES BAD;Lo;0;L;;;;;N;;;;;
+1238A;CUNEIFORM SIGN LU2 TIMES ESH2 PLUS LAL;Lo;0;L;;;;;N;;;;;
+1238B;CUNEIFORM SIGN LU2 TIMES SHU;Lo;0;L;;;;;N;;;;;
+1238C;CUNEIFORM SIGN MESH;Lo;0;L;;;;;N;;;;;
+1238D;CUNEIFORM SIGN MUSH3 TIMES ZA;Lo;0;L;;;;;N;;;;;
+1238E;CUNEIFORM SIGN NA4;Lo;0;L;;;;;N;;;;;
+1238F;CUNEIFORM SIGN NIN;Lo;0;L;;;;;N;;;;;
+12390;CUNEIFORM SIGN NIN9;Lo;0;L;;;;;N;;;;;
+12391;CUNEIFORM SIGN NINDA2 TIMES BAL;Lo;0;L;;;;;N;;;;;
+12392;CUNEIFORM SIGN NINDA2 TIMES GI;Lo;0;L;;;;;N;;;;;
+12393;CUNEIFORM SIGN NU11 ROTATED NINETY DEGREES;Lo;0;L;;;;;N;;;;;
+12394;CUNEIFORM SIGN PESH2 ASTERISK;Lo;0;L;;;;;N;;;;;
+12395;CUNEIFORM SIGN PIR2;Lo;0;L;;;;;N;;;;;
+12396;CUNEIFORM SIGN SAG TIMES IGI GUNU;Lo;0;L;;;;;N;;;;;
+12397;CUNEIFORM SIGN TI2;Lo;0;L;;;;;N;;;;;
+12398;CUNEIFORM SIGN UM TIMES ME;Lo;0;L;;;;;N;;;;;
+12399;CUNEIFORM SIGN U U;Lo;0;L;;;;;N;;;;;
+12400;CUNEIFORM NUMERIC SIGN TWO ASH;Nl;0;L;;;;2;N;;;;;
+12401;CUNEIFORM NUMERIC SIGN THREE ASH;Nl;0;L;;;;3;N;;;;;
+12402;CUNEIFORM NUMERIC SIGN FOUR ASH;Nl;0;L;;;;4;N;;;;;
+12403;CUNEIFORM NUMERIC SIGN FIVE ASH;Nl;0;L;;;;5;N;;;;;
+12404;CUNEIFORM NUMERIC SIGN SIX ASH;Nl;0;L;;;;6;N;;;;;
+12405;CUNEIFORM NUMERIC SIGN SEVEN ASH;Nl;0;L;;;;7;N;;;;;
+12406;CUNEIFORM NUMERIC SIGN EIGHT ASH;Nl;0;L;;;;8;N;;;;;
+12407;CUNEIFORM NUMERIC SIGN NINE ASH;Nl;0;L;;;;9;N;;;;;
+12408;CUNEIFORM NUMERIC SIGN THREE DISH;Nl;0;L;;;;3;N;;;;;
+12409;CUNEIFORM NUMERIC SIGN FOUR DISH;Nl;0;L;;;;4;N;;;;;
+1240A;CUNEIFORM NUMERIC SIGN FIVE DISH;Nl;0;L;;;;5;N;;;;;
+1240B;CUNEIFORM NUMERIC SIGN SIX DISH;Nl;0;L;;;;6;N;;;;;
+1240C;CUNEIFORM NUMERIC SIGN SEVEN DISH;Nl;0;L;;;;7;N;;;;;
+1240D;CUNEIFORM NUMERIC SIGN EIGHT DISH;Nl;0;L;;;;8;N;;;;;
+1240E;CUNEIFORM NUMERIC SIGN NINE DISH;Nl;0;L;;;;9;N;;;;;
+1240F;CUNEIFORM NUMERIC SIGN FOUR U;Nl;0;L;;;;4;N;;;;;
+12410;CUNEIFORM NUMERIC SIGN FIVE U;Nl;0;L;;;;5;N;;;;;
+12411;CUNEIFORM NUMERIC SIGN SIX U;Nl;0;L;;;;6;N;;;;;
+12412;CUNEIFORM NUMERIC SIGN SEVEN U;Nl;0;L;;;;7;N;;;;;
+12413;CUNEIFORM NUMERIC SIGN EIGHT U;Nl;0;L;;;;8;N;;;;;
+12414;CUNEIFORM NUMERIC SIGN NINE U;Nl;0;L;;;;9;N;;;;;
+12415;CUNEIFORM NUMERIC SIGN ONE GESH2;Nl;0;L;;;;1;N;;;;;
+12416;CUNEIFORM NUMERIC SIGN TWO GESH2;Nl;0;L;;;;2;N;;;;;
+12417;CUNEIFORM NUMERIC SIGN THREE GESH2;Nl;0;L;;;;3;N;;;;;
+12418;CUNEIFORM NUMERIC SIGN FOUR GESH2;Nl;0;L;;;;4;N;;;;;
+12419;CUNEIFORM NUMERIC SIGN FIVE GESH2;Nl;0;L;;;;5;N;;;;;
+1241A;CUNEIFORM NUMERIC SIGN SIX GESH2;Nl;0;L;;;;6;N;;;;;
+1241B;CUNEIFORM NUMERIC SIGN SEVEN GESH2;Nl;0;L;;;;7;N;;;;;
+1241C;CUNEIFORM NUMERIC SIGN EIGHT GESH2;Nl;0;L;;;;8;N;;;;;
+1241D;CUNEIFORM NUMERIC SIGN NINE GESH2;Nl;0;L;;;;9;N;;;;;
+1241E;CUNEIFORM NUMERIC SIGN ONE GESHU;Nl;0;L;;;;1;N;;;;;
+1241F;CUNEIFORM NUMERIC SIGN TWO GESHU;Nl;0;L;;;;2;N;;;;;
+12420;CUNEIFORM NUMERIC SIGN THREE GESHU;Nl;0;L;;;;3;N;;;;;
+12421;CUNEIFORM NUMERIC SIGN FOUR GESHU;Nl;0;L;;;;4;N;;;;;
+12422;CUNEIFORM NUMERIC SIGN FIVE GESHU;Nl;0;L;;;;5;N;;;;;
+12423;CUNEIFORM NUMERIC SIGN TWO SHAR2;Nl;0;L;;;;2;N;;;;;
+12424;CUNEIFORM NUMERIC SIGN THREE SHAR2;Nl;0;L;;;;3;N;;;;;
+12425;CUNEIFORM NUMERIC SIGN THREE SHAR2 VARIANT FORM;Nl;0;L;;;;3;N;;;;;
+12426;CUNEIFORM NUMERIC SIGN FOUR SHAR2;Nl;0;L;;;;4;N;;;;;
+12427;CUNEIFORM NUMERIC SIGN FIVE SHAR2;Nl;0;L;;;;5;N;;;;;
+12428;CUNEIFORM NUMERIC SIGN SIX SHAR2;Nl;0;L;;;;6;N;;;;;
+12429;CUNEIFORM NUMERIC SIGN SEVEN SHAR2;Nl;0;L;;;;7;N;;;;;
+1242A;CUNEIFORM NUMERIC SIGN EIGHT SHAR2;Nl;0;L;;;;8;N;;;;;
+1242B;CUNEIFORM NUMERIC SIGN NINE SHAR2;Nl;0;L;;;;9;N;;;;;
+1242C;CUNEIFORM NUMERIC SIGN ONE SHARU;Nl;0;L;;;;1;N;;;;;
+1242D;CUNEIFORM NUMERIC SIGN TWO SHARU;Nl;0;L;;;;2;N;;;;;
+1242E;CUNEIFORM NUMERIC SIGN THREE SHARU;Nl;0;L;;;;3;N;;;;;
+1242F;CUNEIFORM NUMERIC SIGN THREE SHARU VARIANT FORM;Nl;0;L;;;;3;N;;;;;
+12430;CUNEIFORM NUMERIC SIGN FOUR SHARU;Nl;0;L;;;;4;N;;;;;
+12431;CUNEIFORM NUMERIC SIGN FIVE SHARU;Nl;0;L;;;;5;N;;;;;
+12432;CUNEIFORM NUMERIC SIGN SHAR2 TIMES GAL PLUS DISH;Nl;0;L;;;;216000;N;;;;;
+12433;CUNEIFORM NUMERIC SIGN SHAR2 TIMES GAL PLUS MIN;Nl;0;L;;;;432000;N;;;;;
+12434;CUNEIFORM NUMERIC SIGN ONE BURU;Nl;0;L;;;;1;N;;;;;
+12435;CUNEIFORM NUMERIC SIGN TWO BURU;Nl;0;L;;;;2;N;;;;;
+12436;CUNEIFORM NUMERIC SIGN THREE BURU;Nl;0;L;;;;3;N;;;;;
+12437;CUNEIFORM NUMERIC SIGN THREE BURU VARIANT FORM;Nl;0;L;;;;3;N;;;;;
+12438;CUNEIFORM NUMERIC SIGN FOUR BURU;Nl;0;L;;;;4;N;;;;;
+12439;CUNEIFORM NUMERIC SIGN FIVE BURU;Nl;0;L;;;;5;N;;;;;
+1243A;CUNEIFORM NUMERIC SIGN THREE VARIANT FORM ESH16;Nl;0;L;;;;3;N;;;;;
+1243B;CUNEIFORM NUMERIC SIGN THREE VARIANT FORM ESH21;Nl;0;L;;;;3;N;;;;;
+1243C;CUNEIFORM NUMERIC SIGN FOUR VARIANT FORM LIMMU;Nl;0;L;;;;4;N;;;;;
+1243D;CUNEIFORM NUMERIC SIGN FOUR VARIANT FORM LIMMU4;Nl;0;L;;;;4;N;;;;;
+1243E;CUNEIFORM NUMERIC SIGN FOUR VARIANT FORM LIMMU A;Nl;0;L;;;;4;N;;;;;
+1243F;CUNEIFORM NUMERIC SIGN FOUR VARIANT FORM LIMMU B;Nl;0;L;;;;4;N;;;;;
+12440;CUNEIFORM NUMERIC SIGN SIX VARIANT FORM ASH9;Nl;0;L;;;;6;N;;;;;
+12441;CUNEIFORM NUMERIC SIGN SEVEN VARIANT FORM IMIN3;Nl;0;L;;;;7;N;;;;;
+12442;CUNEIFORM NUMERIC SIGN SEVEN VARIANT FORM IMIN A;Nl;0;L;;;;7;N;;;;;
+12443;CUNEIFORM NUMERIC SIGN SEVEN VARIANT FORM IMIN B;Nl;0;L;;;;7;N;;;;;
+12444;CUNEIFORM NUMERIC SIGN EIGHT VARIANT FORM USSU;Nl;0;L;;;;8;N;;;;;
+12445;CUNEIFORM NUMERIC SIGN EIGHT VARIANT FORM USSU3;Nl;0;L;;;;8;N;;;;;
+12446;CUNEIFORM NUMERIC SIGN NINE VARIANT FORM ILIMMU;Nl;0;L;;;;9;N;;;;;
+12447;CUNEIFORM NUMERIC SIGN NINE VARIANT FORM ILIMMU3;Nl;0;L;;;;9;N;;;;;
+12448;CUNEIFORM NUMERIC SIGN NINE VARIANT FORM ILIMMU4;Nl;0;L;;;;9;N;;;;;
+12449;CUNEIFORM NUMERIC SIGN NINE VARIANT FORM ILIMMU A;Nl;0;L;;;;9;N;;;;;
+1244A;CUNEIFORM NUMERIC SIGN TWO ASH TENU;Nl;0;L;;;;2;N;;;;;
+1244B;CUNEIFORM NUMERIC SIGN THREE ASH TENU;Nl;0;L;;;;3;N;;;;;
+1244C;CUNEIFORM NUMERIC SIGN FOUR ASH TENU;Nl;0;L;;;;4;N;;;;;
+1244D;CUNEIFORM NUMERIC SIGN FIVE ASH TENU;Nl;0;L;;;;5;N;;;;;
+1244E;CUNEIFORM NUMERIC SIGN SIX ASH TENU;Nl;0;L;;;;6;N;;;;;
+1244F;CUNEIFORM NUMERIC SIGN ONE BAN2;Nl;0;L;;;;1;N;;;;;
+12450;CUNEIFORM NUMERIC SIGN TWO BAN2;Nl;0;L;;;;2;N;;;;;
+12451;CUNEIFORM NUMERIC SIGN THREE BAN2;Nl;0;L;;;;3;N;;;;;
+12452;CUNEIFORM NUMERIC SIGN FOUR BAN2;Nl;0;L;;;;4;N;;;;;
+12453;CUNEIFORM NUMERIC SIGN FOUR BAN2 VARIANT FORM;Nl;0;L;;;;4;N;;;;;
+12454;CUNEIFORM NUMERIC SIGN FIVE BAN2;Nl;0;L;;;;5;N;;;;;
+12455;CUNEIFORM NUMERIC SIGN FIVE BAN2 VARIANT FORM;Nl;0;L;;;;5;N;;;;;
+12456;CUNEIFORM NUMERIC SIGN NIGIDAMIN;Nl;0;L;;;;2;N;;;;;
+12457;CUNEIFORM NUMERIC SIGN NIGIDAESH;Nl;0;L;;;;3;N;;;;;
+12458;CUNEIFORM NUMERIC SIGN ONE ESHE3;Nl;0;L;;;;1;N;;;;;
+12459;CUNEIFORM NUMERIC SIGN TWO ESHE3;Nl;0;L;;;;2;N;;;;;
+1245A;CUNEIFORM NUMERIC SIGN ONE THIRD DISH;Nl;0;L;;;;1/3;N;;;;;
+1245B;CUNEIFORM NUMERIC SIGN TWO THIRDS DISH;Nl;0;L;;;;2/3;N;;;;;
+1245C;CUNEIFORM NUMERIC SIGN FIVE SIXTHS DISH;Nl;0;L;;;;5/6;N;;;;;
+1245D;CUNEIFORM NUMERIC SIGN ONE THIRD VARIANT FORM A;Nl;0;L;;;;1/3;N;;;;;
+1245E;CUNEIFORM NUMERIC SIGN TWO THIRDS VARIANT FORM A;Nl;0;L;;;;2/3;N;;;;;
+1245F;CUNEIFORM NUMERIC SIGN ONE EIGHTH ASH;Nl;0;L;;;;1/8;N;;;;;
+12460;CUNEIFORM NUMERIC SIGN ONE QUARTER ASH;Nl;0;L;;;;1/4;N;;;;;
+12461;CUNEIFORM NUMERIC SIGN OLD ASSYRIAN ONE SIXTH;Nl;0;L;;;;1/6;N;;;;;
+12462;CUNEIFORM NUMERIC SIGN OLD ASSYRIAN ONE QUARTER;Nl;0;L;;;;1/4;N;;;;;
+12463;CUNEIFORM NUMERIC SIGN ONE QUARTER GUR;Nl;0;L;;;;1/4;N;;;;;
+12464;CUNEIFORM NUMERIC SIGN ONE HALF GUR;Nl;0;L;;;;1/2;N;;;;;
+12465;CUNEIFORM NUMERIC SIGN ELAMITE ONE THIRD;Nl;0;L;;;;1/3;N;;;;;
+12466;CUNEIFORM NUMERIC SIGN ELAMITE TWO THIRDS;Nl;0;L;;;;2/3;N;;;;;
+12467;CUNEIFORM NUMERIC SIGN ELAMITE FORTY;Nl;0;L;;;;40;N;;;;;
+12468;CUNEIFORM NUMERIC SIGN ELAMITE FIFTY;Nl;0;L;;;;50;N;;;;;
+12469;CUNEIFORM NUMERIC SIGN FOUR U VARIANT FORM;Nl;0;L;;;;4;N;;;;;
+1246A;CUNEIFORM NUMERIC SIGN FIVE U VARIANT FORM;Nl;0;L;;;;5;N;;;;;
+1246B;CUNEIFORM NUMERIC SIGN SIX U VARIANT FORM;Nl;0;L;;;;6;N;;;;;
+1246C;CUNEIFORM NUMERIC SIGN SEVEN U VARIANT FORM;Nl;0;L;;;;7;N;;;;;
+1246D;CUNEIFORM NUMERIC SIGN EIGHT U VARIANT FORM;Nl;0;L;;;;8;N;;;;;
+1246E;CUNEIFORM NUMERIC SIGN NINE U VARIANT FORM;Nl;0;L;;;;9;N;;;;;
+12470;CUNEIFORM PUNCTUATION SIGN OLD ASSYRIAN WORD DIVIDER;Po;0;L;;;;;N;;;;;
+12471;CUNEIFORM PUNCTUATION SIGN VERTICAL COLON;Po;0;L;;;;;N;;;;;
+12472;CUNEIFORM PUNCTUATION SIGN DIAGONAL COLON;Po;0;L;;;;;N;;;;;
+12473;CUNEIFORM PUNCTUATION SIGN DIAGONAL TRICOLON;Po;0;L;;;;;N;;;;;
+12474;CUNEIFORM PUNCTUATION SIGN DIAGONAL QUADCOLON;Po;0;L;;;;;N;;;;;
+12480;CUNEIFORM SIGN AB TIMES NUN TENU;Lo;0;L;;;;;N;;;;;
+12481;CUNEIFORM SIGN AB TIMES SHU2;Lo;0;L;;;;;N;;;;;
+12482;CUNEIFORM SIGN AD TIMES ESH2;Lo;0;L;;;;;N;;;;;
+12483;CUNEIFORM SIGN BAD TIMES DISH TENU;Lo;0;L;;;;;N;;;;;
+12484;CUNEIFORM SIGN BAHAR2 TIMES AB2;Lo;0;L;;;;;N;;;;;
+12485;CUNEIFORM SIGN BAHAR2 TIMES NI;Lo;0;L;;;;;N;;;;;
+12486;CUNEIFORM SIGN BAHAR2 TIMES ZA;Lo;0;L;;;;;N;;;;;
+12487;CUNEIFORM SIGN BU OVER BU TIMES NA2;Lo;0;L;;;;;N;;;;;
+12488;CUNEIFORM SIGN DA TIMES TAK4;Lo;0;L;;;;;N;;;;;
+12489;CUNEIFORM SIGN DAG TIMES KUR;Lo;0;L;;;;;N;;;;;
+1248A;CUNEIFORM SIGN DIM TIMES IGI;Lo;0;L;;;;;N;;;;;
+1248B;CUNEIFORM SIGN DIM TIMES U U U;Lo;0;L;;;;;N;;;;;
+1248C;CUNEIFORM SIGN DIM2 TIMES UD;Lo;0;L;;;;;N;;;;;
+1248D;CUNEIFORM SIGN DUG TIMES ANSHE;Lo;0;L;;;;;N;;;;;
+1248E;CUNEIFORM SIGN DUG TIMES ASH;Lo;0;L;;;;;N;;;;;
+1248F;CUNEIFORM SIGN DUG TIMES ASH AT LEFT;Lo;0;L;;;;;N;;;;;
+12490;CUNEIFORM SIGN DUG TIMES DIN;Lo;0;L;;;;;N;;;;;
+12491;CUNEIFORM SIGN DUG TIMES DUN;Lo;0;L;;;;;N;;;;;
+12492;CUNEIFORM SIGN DUG TIMES ERIN2;Lo;0;L;;;;;N;;;;;
+12493;CUNEIFORM SIGN DUG TIMES GA;Lo;0;L;;;;;N;;;;;
+12494;CUNEIFORM SIGN DUG TIMES GI;Lo;0;L;;;;;N;;;;;
+12495;CUNEIFORM SIGN DUG TIMES GIR2 GUNU;Lo;0;L;;;;;N;;;;;
+12496;CUNEIFORM SIGN DUG TIMES GISH;Lo;0;L;;;;;N;;;;;
+12497;CUNEIFORM SIGN DUG TIMES HA;Lo;0;L;;;;;N;;;;;
+12498;CUNEIFORM SIGN DUG TIMES HI;Lo;0;L;;;;;N;;;;;
+12499;CUNEIFORM SIGN DUG TIMES IGI GUNU;Lo;0;L;;;;;N;;;;;
+1249A;CUNEIFORM SIGN DUG TIMES KASKAL;Lo;0;L;;;;;N;;;;;
+1249B;CUNEIFORM SIGN DUG TIMES KUR;Lo;0;L;;;;;N;;;;;
+1249C;CUNEIFORM SIGN DUG TIMES KUSHU2;Lo;0;L;;;;;N;;;;;
+1249D;CUNEIFORM SIGN DUG TIMES KUSHU2 PLUS KASKAL;Lo;0;L;;;;;N;;;;;
+1249E;CUNEIFORM SIGN DUG TIMES LAK-020;Lo;0;L;;;;;N;;;;;
+1249F;CUNEIFORM SIGN DUG TIMES LAM;Lo;0;L;;;;;N;;;;;
+124A0;CUNEIFORM SIGN DUG TIMES LAM TIMES KUR;Lo;0;L;;;;;N;;;;;
+124A1;CUNEIFORM SIGN DUG TIMES LUH PLUS GISH;Lo;0;L;;;;;N;;;;;
+124A2;CUNEIFORM SIGN DUG TIMES MASH;Lo;0;L;;;;;N;;;;;
+124A3;CUNEIFORM SIGN DUG TIMES MES;Lo;0;L;;;;;N;;;;;
+124A4;CUNEIFORM SIGN DUG TIMES MI;Lo;0;L;;;;;N;;;;;
+124A5;CUNEIFORM SIGN DUG TIMES NI;Lo;0;L;;;;;N;;;;;
+124A6;CUNEIFORM SIGN DUG TIMES PI;Lo;0;L;;;;;N;;;;;
+124A7;CUNEIFORM SIGN DUG TIMES SHE;Lo;0;L;;;;;N;;;;;
+124A8;CUNEIFORM SIGN DUG TIMES SI GUNU;Lo;0;L;;;;;N;;;;;
+124A9;CUNEIFORM SIGN E2 TIMES KUR;Lo;0;L;;;;;N;;;;;
+124AA;CUNEIFORM SIGN E2 TIMES PAP;Lo;0;L;;;;;N;;;;;
+124AB;CUNEIFORM SIGN ERIN2 X;Lo;0;L;;;;;N;;;;;
+124AC;CUNEIFORM SIGN ESH2 CROSSING ESH2;Lo;0;L;;;;;N;;;;;
+124AD;CUNEIFORM SIGN EZEN SHESHIG TIMES ASH;Lo;0;L;;;;;N;;;;;
+124AE;CUNEIFORM SIGN EZEN SHESHIG TIMES HI;Lo;0;L;;;;;N;;;;;
+124AF;CUNEIFORM SIGN EZEN SHESHIG TIMES IGI GUNU;Lo;0;L;;;;;N;;;;;
+124B0;CUNEIFORM SIGN EZEN SHESHIG TIMES LA;Lo;0;L;;;;;N;;;;;
+124B1;CUNEIFORM SIGN EZEN SHESHIG TIMES LAL;Lo;0;L;;;;;N;;;;;
+124B2;CUNEIFORM SIGN EZEN SHESHIG TIMES ME;Lo;0;L;;;;;N;;;;;
+124B3;CUNEIFORM SIGN EZEN SHESHIG TIMES MES;Lo;0;L;;;;;N;;;;;
+124B4;CUNEIFORM SIGN EZEN SHESHIG TIMES SU;Lo;0;L;;;;;N;;;;;
+124B5;CUNEIFORM SIGN EZEN TIMES SU;Lo;0;L;;;;;N;;;;;
+124B6;CUNEIFORM SIGN GA2 TIMES BAHAR2;Lo;0;L;;;;;N;;;;;
+124B7;CUNEIFORM SIGN GA2 TIMES DIM GUNU;Lo;0;L;;;;;N;;;;;
+124B8;CUNEIFORM SIGN GA2 TIMES DUG TIMES IGI GUNU;Lo;0;L;;;;;N;;;;;
+124B9;CUNEIFORM SIGN GA2 TIMES DUG TIMES KASKAL;Lo;0;L;;;;;N;;;;;
+124BA;CUNEIFORM SIGN GA2 TIMES EREN;Lo;0;L;;;;;N;;;;;
+124BB;CUNEIFORM SIGN GA2 TIMES GA;Lo;0;L;;;;;N;;;;;
+124BC;CUNEIFORM SIGN GA2 TIMES GAR PLUS DI;Lo;0;L;;;;;N;;;;;
+124BD;CUNEIFORM SIGN GA2 TIMES GAR PLUS NE;Lo;0;L;;;;;N;;;;;
+124BE;CUNEIFORM SIGN GA2 TIMES HA PLUS A;Lo;0;L;;;;;N;;;;;
+124BF;CUNEIFORM SIGN GA2 TIMES KUSHU2 PLUS KASKAL;Lo;0;L;;;;;N;;;;;
+124C0;CUNEIFORM SIGN GA2 TIMES LAM;Lo;0;L;;;;;N;;;;;
+124C1;CUNEIFORM SIGN GA2 TIMES LAM TIMES KUR;Lo;0;L;;;;;N;;;;;
+124C2;CUNEIFORM SIGN GA2 TIMES LUH;Lo;0;L;;;;;N;;;;;
+124C3;CUNEIFORM SIGN GA2 TIMES MUSH;Lo;0;L;;;;;N;;;;;
+124C4;CUNEIFORM SIGN GA2 TIMES NE;Lo;0;L;;;;;N;;;;;
+124C5;CUNEIFORM SIGN GA2 TIMES NE PLUS E2;Lo;0;L;;;;;N;;;;;
+124C6;CUNEIFORM SIGN GA2 TIMES NE PLUS GI;Lo;0;L;;;;;N;;;;;
+124C7;CUNEIFORM SIGN GA2 TIMES SHIM;Lo;0;L;;;;;N;;;;;
+124C8;CUNEIFORM SIGN GA2 TIMES ZIZ2;Lo;0;L;;;;;N;;;;;
+124C9;CUNEIFORM SIGN GABA ROTATED NINETY DEGREES;Lo;0;L;;;;;N;;;;;
+124CA;CUNEIFORM SIGN GESHTIN TIMES U;Lo;0;L;;;;;N;;;;;
+124CB;CUNEIFORM SIGN GISH TIMES GISH CROSSING GISH;Lo;0;L;;;;;N;;;;;
+124CC;CUNEIFORM SIGN GU2 TIMES IGI GUNU;Lo;0;L;;;;;N;;;;;
+124CD;CUNEIFORM SIGN GUD PLUS GISH TIMES TAK4;Lo;0;L;;;;;N;;;;;
+124CE;CUNEIFORM SIGN HA TENU GUNU;Lo;0;L;;;;;N;;;;;
+124CF;CUNEIFORM SIGN HI TIMES ASH OVER HI TIMES ASH;Lo;0;L;;;;;N;;;;;
+124D0;CUNEIFORM SIGN KA TIMES BU;Lo;0;L;;;;;N;;;;;
+124D1;CUNEIFORM SIGN KA TIMES KA;Lo;0;L;;;;;N;;;;;
+124D2;CUNEIFORM SIGN KA TIMES U U U;Lo;0;L;;;;;N;;;;;
+124D3;CUNEIFORM SIGN KA TIMES UR;Lo;0;L;;;;;N;;;;;
+124D4;CUNEIFORM SIGN LAGAB TIMES ZU OVER ZU;Lo;0;L;;;;;N;;;;;
+124D5;CUNEIFORM SIGN LAK-003;Lo;0;L;;;;;N;;;;;
+124D6;CUNEIFORM SIGN LAK-021;Lo;0;L;;;;;N;;;;;
+124D7;CUNEIFORM SIGN LAK-025;Lo;0;L;;;;;N;;;;;
+124D8;CUNEIFORM SIGN LAK-030;Lo;0;L;;;;;N;;;;;
+124D9;CUNEIFORM SIGN LAK-050;Lo;0;L;;;;;N;;;;;
+124DA;CUNEIFORM SIGN LAK-051;Lo;0;L;;;;;N;;;;;
+124DB;CUNEIFORM SIGN LAK-062;Lo;0;L;;;;;N;;;;;
+124DC;CUNEIFORM SIGN LAK-079 OVER LAK-079 GUNU;Lo;0;L;;;;;N;;;;;
+124DD;CUNEIFORM SIGN LAK-080;Lo;0;L;;;;;N;;;;;
+124DE;CUNEIFORM SIGN LAK-081 OVER LAK-081;Lo;0;L;;;;;N;;;;;
+124DF;CUNEIFORM SIGN LAK-092;Lo;0;L;;;;;N;;;;;
+124E0;CUNEIFORM SIGN LAK-130;Lo;0;L;;;;;N;;;;;
+124E1;CUNEIFORM SIGN LAK-142;Lo;0;L;;;;;N;;;;;
+124E2;CUNEIFORM SIGN LAK-210;Lo;0;L;;;;;N;;;;;
+124E3;CUNEIFORM SIGN LAK-219;Lo;0;L;;;;;N;;;;;
+124E4;CUNEIFORM SIGN LAK-220;Lo;0;L;;;;;N;;;;;
+124E5;CUNEIFORM SIGN LAK-225;Lo;0;L;;;;;N;;;;;
+124E6;CUNEIFORM SIGN LAK-228;Lo;0;L;;;;;N;;;;;
+124E7;CUNEIFORM SIGN LAK-238;Lo;0;L;;;;;N;;;;;
+124E8;CUNEIFORM SIGN LAK-265;Lo;0;L;;;;;N;;;;;
+124E9;CUNEIFORM SIGN LAK-266;Lo;0;L;;;;;N;;;;;
+124EA;CUNEIFORM SIGN LAK-343;Lo;0;L;;;;;N;;;;;
+124EB;CUNEIFORM SIGN LAK-347;Lo;0;L;;;;;N;;;;;
+124EC;CUNEIFORM SIGN LAK-348;Lo;0;L;;;;;N;;;;;
+124ED;CUNEIFORM SIGN LAK-383;Lo;0;L;;;;;N;;;;;
+124EE;CUNEIFORM SIGN LAK-384;Lo;0;L;;;;;N;;;;;
+124EF;CUNEIFORM SIGN LAK-390;Lo;0;L;;;;;N;;;;;
+124F0;CUNEIFORM SIGN LAK-441;Lo;0;L;;;;;N;;;;;
+124F1;CUNEIFORM SIGN LAK-449;Lo;0;L;;;;;N;;;;;
+124F2;CUNEIFORM SIGN LAK-449 TIMES GU;Lo;0;L;;;;;N;;;;;
+124F3;CUNEIFORM SIGN LAK-449 TIMES IGI;Lo;0;L;;;;;N;;;;;
+124F4;CUNEIFORM SIGN LAK-449 TIMES PAP PLUS LU3;Lo;0;L;;;;;N;;;;;
+124F5;CUNEIFORM SIGN LAK-449 TIMES PAP PLUS PAP PLUS LU3;Lo;0;L;;;;;N;;;;;
+124F6;CUNEIFORM SIGN LAK-449 TIMES U2 PLUS BA;Lo;0;L;;;;;N;;;;;
+124F7;CUNEIFORM SIGN LAK-450;Lo;0;L;;;;;N;;;;;
+124F8;CUNEIFORM SIGN LAK-457;Lo;0;L;;;;;N;;;;;
+124F9;CUNEIFORM SIGN LAK-470;Lo;0;L;;;;;N;;;;;
+124FA;CUNEIFORM SIGN LAK-483;Lo;0;L;;;;;N;;;;;
+124FB;CUNEIFORM SIGN LAK-490;Lo;0;L;;;;;N;;;;;
+124FC;CUNEIFORM SIGN LAK-492;Lo;0;L;;;;;N;;;;;
+124FD;CUNEIFORM SIGN LAK-493;Lo;0;L;;;;;N;;;;;
+124FE;CUNEIFORM SIGN LAK-495;Lo;0;L;;;;;N;;;;;
+124FF;CUNEIFORM SIGN LAK-550;Lo;0;L;;;;;N;;;;;
+12500;CUNEIFORM SIGN LAK-608;Lo;0;L;;;;;N;;;;;
+12501;CUNEIFORM SIGN LAK-617;Lo;0;L;;;;;N;;;;;
+12502;CUNEIFORM SIGN LAK-617 TIMES ASH;Lo;0;L;;;;;N;;;;;
+12503;CUNEIFORM SIGN LAK-617 TIMES BAD;Lo;0;L;;;;;N;;;;;
+12504;CUNEIFORM SIGN LAK-617 TIMES DUN3 GUNU GUNU;Lo;0;L;;;;;N;;;;;
+12505;CUNEIFORM SIGN LAK-617 TIMES KU3;Lo;0;L;;;;;N;;;;;
+12506;CUNEIFORM SIGN LAK-617 TIMES LA;Lo;0;L;;;;;N;;;;;
+12507;CUNEIFORM SIGN LAK-617 TIMES TAR;Lo;0;L;;;;;N;;;;;
+12508;CUNEIFORM SIGN LAK-617 TIMES TE;Lo;0;L;;;;;N;;;;;
+12509;CUNEIFORM SIGN LAK-617 TIMES U2;Lo;0;L;;;;;N;;;;;
+1250A;CUNEIFORM SIGN LAK-617 TIMES UD;Lo;0;L;;;;;N;;;;;
+1250B;CUNEIFORM SIGN LAK-617 TIMES URUDA;Lo;0;L;;;;;N;;;;;
+1250C;CUNEIFORM SIGN LAK-636;Lo;0;L;;;;;N;;;;;
+1250D;CUNEIFORM SIGN LAK-648;Lo;0;L;;;;;N;;;;;
+1250E;CUNEIFORM SIGN LAK-648 TIMES DUB;Lo;0;L;;;;;N;;;;;
+1250F;CUNEIFORM SIGN LAK-648 TIMES GA;Lo;0;L;;;;;N;;;;;
+12510;CUNEIFORM SIGN LAK-648 TIMES IGI;Lo;0;L;;;;;N;;;;;
+12511;CUNEIFORM SIGN LAK-648 TIMES IGI GUNU;Lo;0;L;;;;;N;;;;;
+12512;CUNEIFORM SIGN LAK-648 TIMES NI;Lo;0;L;;;;;N;;;;;
+12513;CUNEIFORM SIGN LAK-648 TIMES PAP PLUS PAP PLUS LU3;Lo;0;L;;;;;N;;;;;
+12514;CUNEIFORM SIGN LAK-648 TIMES SHESH PLUS KI;Lo;0;L;;;;;N;;;;;
+12515;CUNEIFORM SIGN LAK-648 TIMES UD;Lo;0;L;;;;;N;;;;;
+12516;CUNEIFORM SIGN LAK-648 TIMES URUDA;Lo;0;L;;;;;N;;;;;
+12517;CUNEIFORM SIGN LAK-724;Lo;0;L;;;;;N;;;;;
+12518;CUNEIFORM SIGN LAK-749;Lo;0;L;;;;;N;;;;;
+12519;CUNEIFORM SIGN LU2 GUNU TIMES ASH;Lo;0;L;;;;;N;;;;;
+1251A;CUNEIFORM SIGN LU2 TIMES DISH;Lo;0;L;;;;;N;;;;;
+1251B;CUNEIFORM SIGN LU2 TIMES HAL;Lo;0;L;;;;;N;;;;;
+1251C;CUNEIFORM SIGN LU2 TIMES PAP;Lo;0;L;;;;;N;;;;;
+1251D;CUNEIFORM SIGN LU2 TIMES PAP PLUS PAP PLUS LU3;Lo;0;L;;;;;N;;;;;
+1251E;CUNEIFORM SIGN LU2 TIMES TAK4;Lo;0;L;;;;;N;;;;;
+1251F;CUNEIFORM SIGN MI PLUS ZA7;Lo;0;L;;;;;N;;;;;
+12520;CUNEIFORM SIGN MUSH OVER MUSH TIMES GA;Lo;0;L;;;;;N;;;;;
+12521;CUNEIFORM SIGN MUSH OVER MUSH TIMES KAK;Lo;0;L;;;;;N;;;;;
+12522;CUNEIFORM SIGN NINDA2 TIMES DIM GUNU;Lo;0;L;;;;;N;;;;;
+12523;CUNEIFORM SIGN NINDA2 TIMES GISH;Lo;0;L;;;;;N;;;;;
+12524;CUNEIFORM SIGN NINDA2 TIMES GUL;Lo;0;L;;;;;N;;;;;
+12525;CUNEIFORM SIGN NINDA2 TIMES HI;Lo;0;L;;;;;N;;;;;
+12526;CUNEIFORM SIGN NINDA2 TIMES KESH2;Lo;0;L;;;;;N;;;;;
+12527;CUNEIFORM SIGN NINDA2 TIMES LAK-050;Lo;0;L;;;;;N;;;;;
+12528;CUNEIFORM SIGN NINDA2 TIMES MASH;Lo;0;L;;;;;N;;;;;
+12529;CUNEIFORM SIGN NINDA2 TIMES PAP PLUS PAP;Lo;0;L;;;;;N;;;;;
+1252A;CUNEIFORM SIGN NINDA2 TIMES U;Lo;0;L;;;;;N;;;;;
+1252B;CUNEIFORM SIGN NINDA2 TIMES U PLUS U;Lo;0;L;;;;;N;;;;;
+1252C;CUNEIFORM SIGN NINDA2 TIMES URUDA;Lo;0;L;;;;;N;;;;;
+1252D;CUNEIFORM SIGN SAG GUNU TIMES HA;Lo;0;L;;;;;N;;;;;
+1252E;CUNEIFORM SIGN SAG TIMES EN;Lo;0;L;;;;;N;;;;;
+1252F;CUNEIFORM SIGN SAG TIMES SHE AT LEFT;Lo;0;L;;;;;N;;;;;
+12530;CUNEIFORM SIGN SAG TIMES TAK4;Lo;0;L;;;;;N;;;;;
+12531;CUNEIFORM SIGN SHA6 TENU;Lo;0;L;;;;;N;;;;;
+12532;CUNEIFORM SIGN SHE OVER SHE;Lo;0;L;;;;;N;;;;;
+12533;CUNEIFORM SIGN SHE PLUS HUB2;Lo;0;L;;;;;N;;;;;
+12534;CUNEIFORM SIGN SHE PLUS NAM2;Lo;0;L;;;;;N;;;;;
+12535;CUNEIFORM SIGN SHE PLUS SAR;Lo;0;L;;;;;N;;;;;
+12536;CUNEIFORM SIGN SHU2 PLUS DUG TIMES NI;Lo;0;L;;;;;N;;;;;
+12537;CUNEIFORM SIGN SHU2 PLUS E2 TIMES AN;Lo;0;L;;;;;N;;;;;
+12538;CUNEIFORM SIGN SI TIMES TAK4;Lo;0;L;;;;;N;;;;;
+12539;CUNEIFORM SIGN TAK4 PLUS SAG;Lo;0;L;;;;;N;;;;;
+1253A;CUNEIFORM SIGN TUM TIMES GAN2 TENU;Lo;0;L;;;;;N;;;;;
+1253B;CUNEIFORM SIGN TUM TIMES THREE DISH;Lo;0;L;;;;;N;;;;;
+1253C;CUNEIFORM SIGN UR2 INVERTED;Lo;0;L;;;;;N;;;;;
+1253D;CUNEIFORM SIGN UR2 TIMES UD;Lo;0;L;;;;;N;;;;;
+1253E;CUNEIFORM SIGN URU TIMES DARA3;Lo;0;L;;;;;N;;;;;
+1253F;CUNEIFORM SIGN URU TIMES LAK-668;Lo;0;L;;;;;N;;;;;
+12540;CUNEIFORM SIGN URU TIMES LU3;Lo;0;L;;;;;N;;;;;
+12541;CUNEIFORM SIGN ZA7;Lo;0;L;;;;;N;;;;;
+12542;CUNEIFORM SIGN ZU OVER ZU PLUS SAR;Lo;0;L;;;;;N;;;;;
+12543;CUNEIFORM SIGN ZU5 TIMES THREE DISH TENU;Lo;0;L;;;;;N;;;;;
+13000;EGYPTIAN HIEROGLYPH A001;Lo;0;L;;;;;N;;;;;
+13001;EGYPTIAN HIEROGLYPH A002;Lo;0;L;;;;;N;;;;;
+13002;EGYPTIAN HIEROGLYPH A003;Lo;0;L;;;;;N;;;;;
+13003;EGYPTIAN HIEROGLYPH A004;Lo;0;L;;;;;N;;;;;
+13004;EGYPTIAN HIEROGLYPH A005;Lo;0;L;;;;;N;;;;;
+13005;EGYPTIAN HIEROGLYPH A005A;Lo;0;L;;;;;N;;;;;
+13006;EGYPTIAN HIEROGLYPH A006;Lo;0;L;;;;;N;;;;;
+13007;EGYPTIAN HIEROGLYPH A006A;Lo;0;L;;;;;N;;;;;
+13008;EGYPTIAN HIEROGLYPH A006B;Lo;0;L;;;;;N;;;;;
+13009;EGYPTIAN HIEROGLYPH A007;Lo;0;L;;;;;N;;;;;
+1300A;EGYPTIAN HIEROGLYPH A008;Lo;0;L;;;;;N;;;;;
+1300B;EGYPTIAN HIEROGLYPH A009;Lo;0;L;;;;;N;;;;;
+1300C;EGYPTIAN HIEROGLYPH A010;Lo;0;L;;;;;N;;;;;
+1300D;EGYPTIAN HIEROGLYPH A011;Lo;0;L;;;;;N;;;;;
+1300E;EGYPTIAN HIEROGLYPH A012;Lo;0;L;;;;;N;;;;;
+1300F;EGYPTIAN HIEROGLYPH A013;Lo;0;L;;;;;N;;;;;
+13010;EGYPTIAN HIEROGLYPH A014;Lo;0;L;;;;;N;;;;;
+13011;EGYPTIAN HIEROGLYPH A014A;Lo;0;L;;;;;N;;;;;
+13012;EGYPTIAN HIEROGLYPH A015;Lo;0;L;;;;;N;;;;;
+13013;EGYPTIAN HIEROGLYPH A016;Lo;0;L;;;;;N;;;;;
+13014;EGYPTIAN HIEROGLYPH A017;Lo;0;L;;;;;N;;;;;
+13015;EGYPTIAN HIEROGLYPH A017A;Lo;0;L;;;;;N;;;;;
+13016;EGYPTIAN HIEROGLYPH A018;Lo;0;L;;;;;N;;;;;
+13017;EGYPTIAN HIEROGLYPH A019;Lo;0;L;;;;;N;;;;;
+13018;EGYPTIAN HIEROGLYPH A020;Lo;0;L;;;;;N;;;;;
+13019;EGYPTIAN HIEROGLYPH A021;Lo;0;L;;;;;N;;;;;
+1301A;EGYPTIAN HIEROGLYPH A022;Lo;0;L;;;;;N;;;;;
+1301B;EGYPTIAN HIEROGLYPH A023;Lo;0;L;;;;;N;;;;;
+1301C;EGYPTIAN HIEROGLYPH A024;Lo;0;L;;;;;N;;;;;
+1301D;EGYPTIAN HIEROGLYPH A025;Lo;0;L;;;;;N;;;;;
+1301E;EGYPTIAN HIEROGLYPH A026;Lo;0;L;;;;;N;;;;;
+1301F;EGYPTIAN HIEROGLYPH A027;Lo;0;L;;;;;N;;;;;
+13020;EGYPTIAN HIEROGLYPH A028;Lo;0;L;;;;;N;;;;;
+13021;EGYPTIAN HIEROGLYPH A029;Lo;0;L;;;;;N;;;;;
+13022;EGYPTIAN HIEROGLYPH A030;Lo;0;L;;;;;N;;;;;
+13023;EGYPTIAN HIEROGLYPH A031;Lo;0;L;;;;;N;;;;;
+13024;EGYPTIAN HIEROGLYPH A032;Lo;0;L;;;;;N;;;;;
+13025;EGYPTIAN HIEROGLYPH A032A;Lo;0;L;;;;;N;;;;;
+13026;EGYPTIAN HIEROGLYPH A033;Lo;0;L;;;;;N;;;;;
+13027;EGYPTIAN HIEROGLYPH A034;Lo;0;L;;;;;N;;;;;
+13028;EGYPTIAN HIEROGLYPH A035;Lo;0;L;;;;;N;;;;;
+13029;EGYPTIAN HIEROGLYPH A036;Lo;0;L;;;;;N;;;;;
+1302A;EGYPTIAN HIEROGLYPH A037;Lo;0;L;;;;;N;;;;;
+1302B;EGYPTIAN HIEROGLYPH A038;Lo;0;L;;;;;N;;;;;
+1302C;EGYPTIAN HIEROGLYPH A039;Lo;0;L;;;;;N;;;;;
+1302D;EGYPTIAN HIEROGLYPH A040;Lo;0;L;;;;;N;;;;;
+1302E;EGYPTIAN HIEROGLYPH A040A;Lo;0;L;;;;;N;;;;;
+1302F;EGYPTIAN HIEROGLYPH A041;Lo;0;L;;;;;N;;;;;
+13030;EGYPTIAN HIEROGLYPH A042;Lo;0;L;;;;;N;;;;;
+13031;EGYPTIAN HIEROGLYPH A042A;Lo;0;L;;;;;N;;;;;
+13032;EGYPTIAN HIEROGLYPH A043;Lo;0;L;;;;;N;;;;;
+13033;EGYPTIAN HIEROGLYPH A043A;Lo;0;L;;;;;N;;;;;
+13034;EGYPTIAN HIEROGLYPH A044;Lo;0;L;;;;;N;;;;;
+13035;EGYPTIAN HIEROGLYPH A045;Lo;0;L;;;;;N;;;;;
+13036;EGYPTIAN HIEROGLYPH A045A;Lo;0;L;;;;;N;;;;;
+13037;EGYPTIAN HIEROGLYPH A046;Lo;0;L;;;;;N;;;;;
+13038;EGYPTIAN HIEROGLYPH A047;Lo;0;L;;;;;N;;;;;
+13039;EGYPTIAN HIEROGLYPH A048;Lo;0;L;;;;;N;;;;;
+1303A;EGYPTIAN HIEROGLYPH A049;Lo;0;L;;;;;N;;;;;
+1303B;EGYPTIAN HIEROGLYPH A050;Lo;0;L;;;;;N;;;;;
+1303C;EGYPTIAN HIEROGLYPH A051;Lo;0;L;;;;;N;;;;;
+1303D;EGYPTIAN HIEROGLYPH A052;Lo;0;L;;;;;N;;;;;
+1303E;EGYPTIAN HIEROGLYPH A053;Lo;0;L;;;;;N;;;;;
+1303F;EGYPTIAN HIEROGLYPH A054;Lo;0;L;;;;;N;;;;;
+13040;EGYPTIAN HIEROGLYPH A055;Lo;0;L;;;;;N;;;;;
+13041;EGYPTIAN HIEROGLYPH A056;Lo;0;L;;;;;N;;;;;
+13042;EGYPTIAN HIEROGLYPH A057;Lo;0;L;;;;;N;;;;;
+13043;EGYPTIAN HIEROGLYPH A058;Lo;0;L;;;;;N;;;;;
+13044;EGYPTIAN HIEROGLYPH A059;Lo;0;L;;;;;N;;;;;
+13045;EGYPTIAN HIEROGLYPH A060;Lo;0;L;;;;;N;;;;;
+13046;EGYPTIAN HIEROGLYPH A061;Lo;0;L;;;;;N;;;;;
+13047;EGYPTIAN HIEROGLYPH A062;Lo;0;L;;;;;N;;;;;
+13048;EGYPTIAN HIEROGLYPH A063;Lo;0;L;;;;;N;;;;;
+13049;EGYPTIAN HIEROGLYPH A064;Lo;0;L;;;;;N;;;;;
+1304A;EGYPTIAN HIEROGLYPH A065;Lo;0;L;;;;;N;;;;;
+1304B;EGYPTIAN HIEROGLYPH A066;Lo;0;L;;;;;N;;;;;
+1304C;EGYPTIAN HIEROGLYPH A067;Lo;0;L;;;;;N;;;;;
+1304D;EGYPTIAN HIEROGLYPH A068;Lo;0;L;;;;;N;;;;;
+1304E;EGYPTIAN HIEROGLYPH A069;Lo;0;L;;;;;N;;;;;
+1304F;EGYPTIAN HIEROGLYPH A070;Lo;0;L;;;;;N;;;;;
+13050;EGYPTIAN HIEROGLYPH B001;Lo;0;L;;;;;N;;;;;
+13051;EGYPTIAN HIEROGLYPH B002;Lo;0;L;;;;;N;;;;;
+13052;EGYPTIAN HIEROGLYPH B003;Lo;0;L;;;;;N;;;;;
+13053;EGYPTIAN HIEROGLYPH B004;Lo;0;L;;;;;N;;;;;
+13054;EGYPTIAN HIEROGLYPH B005;Lo;0;L;;;;;N;;;;;
+13055;EGYPTIAN HIEROGLYPH B005A;Lo;0;L;;;;;N;;;;;
+13056;EGYPTIAN HIEROGLYPH B006;Lo;0;L;;;;;N;;;;;
+13057;EGYPTIAN HIEROGLYPH B007;Lo;0;L;;;;;N;;;;;
+13058;EGYPTIAN HIEROGLYPH B008;Lo;0;L;;;;;N;;;;;
+13059;EGYPTIAN HIEROGLYPH B009;Lo;0;L;;;;;N;;;;;
+1305A;EGYPTIAN HIEROGLYPH C001;Lo;0;L;;;;;N;;;;;
+1305B;EGYPTIAN HIEROGLYPH C002;Lo;0;L;;;;;N;;;;;
+1305C;EGYPTIAN HIEROGLYPH C002A;Lo;0;L;;;;;N;;;;;
+1305D;EGYPTIAN HIEROGLYPH C002B;Lo;0;L;;;;;N;;;;;
+1305E;EGYPTIAN HIEROGLYPH C002C;Lo;0;L;;;;;N;;;;;
+1305F;EGYPTIAN HIEROGLYPH C003;Lo;0;L;;;;;N;;;;;
+13060;EGYPTIAN HIEROGLYPH C004;Lo;0;L;;;;;N;;;;;
+13061;EGYPTIAN HIEROGLYPH C005;Lo;0;L;;;;;N;;;;;
+13062;EGYPTIAN HIEROGLYPH C006;Lo;0;L;;;;;N;;;;;
+13063;EGYPTIAN HIEROGLYPH C007;Lo;0;L;;;;;N;;;;;
+13064;EGYPTIAN HIEROGLYPH C008;Lo;0;L;;;;;N;;;;;
+13065;EGYPTIAN HIEROGLYPH C009;Lo;0;L;;;;;N;;;;;
+13066;EGYPTIAN HIEROGLYPH C010;Lo;0;L;;;;;N;;;;;
+13067;EGYPTIAN HIEROGLYPH C010A;Lo;0;L;;;;;N;;;;;
+13068;EGYPTIAN HIEROGLYPH C011;Lo;0;L;;;;;N;;;;;
+13069;EGYPTIAN HIEROGLYPH C012;Lo;0;L;;;;;N;;;;;
+1306A;EGYPTIAN HIEROGLYPH C013;Lo;0;L;;;;;N;;;;;
+1306B;EGYPTIAN HIEROGLYPH C014;Lo;0;L;;;;;N;;;;;
+1306C;EGYPTIAN HIEROGLYPH C015;Lo;0;L;;;;;N;;;;;
+1306D;EGYPTIAN HIEROGLYPH C016;Lo;0;L;;;;;N;;;;;
+1306E;EGYPTIAN HIEROGLYPH C017;Lo;0;L;;;;;N;;;;;
+1306F;EGYPTIAN HIEROGLYPH C018;Lo;0;L;;;;;N;;;;;
+13070;EGYPTIAN HIEROGLYPH C019;Lo;0;L;;;;;N;;;;;
+13071;EGYPTIAN HIEROGLYPH C020;Lo;0;L;;;;;N;;;;;
+13072;EGYPTIAN HIEROGLYPH C021;Lo;0;L;;;;;N;;;;;
+13073;EGYPTIAN HIEROGLYPH C022;Lo;0;L;;;;;N;;;;;
+13074;EGYPTIAN HIEROGLYPH C023;Lo;0;L;;;;;N;;;;;
+13075;EGYPTIAN HIEROGLYPH C024;Lo;0;L;;;;;N;;;;;
+13076;EGYPTIAN HIEROGLYPH D001;Lo;0;L;;;;;N;;;;;
+13077;EGYPTIAN HIEROGLYPH D002;Lo;0;L;;;;;N;;;;;
+13078;EGYPTIAN HIEROGLYPH D003;Lo;0;L;;;;;N;;;;;
+13079;EGYPTIAN HIEROGLYPH D004;Lo;0;L;;;;;N;;;;;
+1307A;EGYPTIAN HIEROGLYPH D005;Lo;0;L;;;;;N;;;;;
+1307B;EGYPTIAN HIEROGLYPH D006;Lo;0;L;;;;;N;;;;;
+1307C;EGYPTIAN HIEROGLYPH D007;Lo;0;L;;;;;N;;;;;
+1307D;EGYPTIAN HIEROGLYPH D008;Lo;0;L;;;;;N;;;;;
+1307E;EGYPTIAN HIEROGLYPH D008A;Lo;0;L;;;;;N;;;;;
+1307F;EGYPTIAN HIEROGLYPH D009;Lo;0;L;;;;;N;;;;;
+13080;EGYPTIAN HIEROGLYPH D010;Lo;0;L;;;;;N;;;;;
+13081;EGYPTIAN HIEROGLYPH D011;Lo;0;L;;;;;N;;;;;
+13082;EGYPTIAN HIEROGLYPH D012;Lo;0;L;;;;;N;;;;;
+13083;EGYPTIAN HIEROGLYPH D013;Lo;0;L;;;;;N;;;;;
+13084;EGYPTIAN HIEROGLYPH D014;Lo;0;L;;;;;N;;;;;
+13085;EGYPTIAN HIEROGLYPH D015;Lo;0;L;;;;;N;;;;;
+13086;EGYPTIAN HIEROGLYPH D016;Lo;0;L;;;;;N;;;;;
+13087;EGYPTIAN HIEROGLYPH D017;Lo;0;L;;;;;N;;;;;
+13088;EGYPTIAN HIEROGLYPH D018;Lo;0;L;;;;;N;;;;;
+13089;EGYPTIAN HIEROGLYPH D019;Lo;0;L;;;;;N;;;;;
+1308A;EGYPTIAN HIEROGLYPH D020;Lo;0;L;;;;;N;;;;;
+1308B;EGYPTIAN HIEROGLYPH D021;Lo;0;L;;;;;N;;;;;
+1308C;EGYPTIAN HIEROGLYPH D022;Lo;0;L;;;;;N;;;;;
+1308D;EGYPTIAN HIEROGLYPH D023;Lo;0;L;;;;;N;;;;;
+1308E;EGYPTIAN HIEROGLYPH D024;Lo;0;L;;;;;N;;;;;
+1308F;EGYPTIAN HIEROGLYPH D025;Lo;0;L;;;;;N;;;;;
+13090;EGYPTIAN HIEROGLYPH D026;Lo;0;L;;;;;N;;;;;
+13091;EGYPTIAN HIEROGLYPH D027;Lo;0;L;;;;;N;;;;;
+13092;EGYPTIAN HIEROGLYPH D027A;Lo;0;L;;;;;N;;;;;
+13093;EGYPTIAN HIEROGLYPH D028;Lo;0;L;;;;;N;;;;;
+13094;EGYPTIAN HIEROGLYPH D029;Lo;0;L;;;;;N;;;;;
+13095;EGYPTIAN HIEROGLYPH D030;Lo;0;L;;;;;N;;;;;
+13096;EGYPTIAN HIEROGLYPH D031;Lo;0;L;;;;;N;;;;;
+13097;EGYPTIAN HIEROGLYPH D031A;Lo;0;L;;;;;N;;;;;
+13098;EGYPTIAN HIEROGLYPH D032;Lo;0;L;;;;;N;;;;;
+13099;EGYPTIAN HIEROGLYPH D033;Lo;0;L;;;;;N;;;;;
+1309A;EGYPTIAN HIEROGLYPH D034;Lo;0;L;;;;;N;;;;;
+1309B;EGYPTIAN HIEROGLYPH D034A;Lo;0;L;;;;;N;;;;;
+1309C;EGYPTIAN HIEROGLYPH D035;Lo;0;L;;;;;N;;;;;
+1309D;EGYPTIAN HIEROGLYPH D036;Lo;0;L;;;;;N;;;;;
+1309E;EGYPTIAN HIEROGLYPH D037;Lo;0;L;;;;;N;;;;;
+1309F;EGYPTIAN HIEROGLYPH D038;Lo;0;L;;;;;N;;;;;
+130A0;EGYPTIAN HIEROGLYPH D039;Lo;0;L;;;;;N;;;;;
+130A1;EGYPTIAN HIEROGLYPH D040;Lo;0;L;;;;;N;;;;;
+130A2;EGYPTIAN HIEROGLYPH D041;Lo;0;L;;;;;N;;;;;
+130A3;EGYPTIAN HIEROGLYPH D042;Lo;0;L;;;;;N;;;;;
+130A4;EGYPTIAN HIEROGLYPH D043;Lo;0;L;;;;;N;;;;;
+130A5;EGYPTIAN HIEROGLYPH D044;Lo;0;L;;;;;N;;;;;
+130A6;EGYPTIAN HIEROGLYPH D045;Lo;0;L;;;;;N;;;;;
+130A7;EGYPTIAN HIEROGLYPH D046;Lo;0;L;;;;;N;;;;;
+130A8;EGYPTIAN HIEROGLYPH D046A;Lo;0;L;;;;;N;;;;;
+130A9;EGYPTIAN HIEROGLYPH D047;Lo;0;L;;;;;N;;;;;
+130AA;EGYPTIAN HIEROGLYPH D048;Lo;0;L;;;;;N;;;;;
+130AB;EGYPTIAN HIEROGLYPH D048A;Lo;0;L;;;;;N;;;;;
+130AC;EGYPTIAN HIEROGLYPH D049;Lo;0;L;;;;;N;;;;;
+130AD;EGYPTIAN HIEROGLYPH D050;Lo;0;L;;;;;N;;;;;
+130AE;EGYPTIAN HIEROGLYPH D050A;Lo;0;L;;;;;N;;;;;
+130AF;EGYPTIAN HIEROGLYPH D050B;Lo;0;L;;;;;N;;;;;
+130B0;EGYPTIAN HIEROGLYPH D050C;Lo;0;L;;;;;N;;;;;
+130B1;EGYPTIAN HIEROGLYPH D050D;Lo;0;L;;;;;N;;;;;
+130B2;EGYPTIAN HIEROGLYPH D050E;Lo;0;L;;;;;N;;;;;
+130B3;EGYPTIAN HIEROGLYPH D050F;Lo;0;L;;;;;N;;;;;
+130B4;EGYPTIAN HIEROGLYPH D050G;Lo;0;L;;;;;N;;;;;
+130B5;EGYPTIAN HIEROGLYPH D050H;Lo;0;L;;;;;N;;;;;
+130B6;EGYPTIAN HIEROGLYPH D050I;Lo;0;L;;;;;N;;;;;
+130B7;EGYPTIAN HIEROGLYPH D051;Lo;0;L;;;;;N;;;;;
+130B8;EGYPTIAN HIEROGLYPH D052;Lo;0;L;;;;;N;;;;;
+130B9;EGYPTIAN HIEROGLYPH D052A;Lo;0;L;;;;;N;;;;;
+130BA;EGYPTIAN HIEROGLYPH D053;Lo;0;L;;;;;N;;;;;
+130BB;EGYPTIAN HIEROGLYPH D054;Lo;0;L;;;;;N;;;;;
+130BC;EGYPTIAN HIEROGLYPH D054A;Lo;0;L;;;;;N;;;;;
+130BD;EGYPTIAN HIEROGLYPH D055;Lo;0;L;;;;;N;;;;;
+130BE;EGYPTIAN HIEROGLYPH D056;Lo;0;L;;;;;N;;;;;
+130BF;EGYPTIAN HIEROGLYPH D057;Lo;0;L;;;;;N;;;;;
+130C0;EGYPTIAN HIEROGLYPH D058;Lo;0;L;;;;;N;;;;;
+130C1;EGYPTIAN HIEROGLYPH D059;Lo;0;L;;;;;N;;;;;
+130C2;EGYPTIAN HIEROGLYPH D060;Lo;0;L;;;;;N;;;;;
+130C3;EGYPTIAN HIEROGLYPH D061;Lo;0;L;;;;;N;;;;;
+130C4;EGYPTIAN HIEROGLYPH D062;Lo;0;L;;;;;N;;;;;
+130C5;EGYPTIAN HIEROGLYPH D063;Lo;0;L;;;;;N;;;;;
+130C6;EGYPTIAN HIEROGLYPH D064;Lo;0;L;;;;;N;;;;;
+130C7;EGYPTIAN HIEROGLYPH D065;Lo;0;L;;;;;N;;;;;
+130C8;EGYPTIAN HIEROGLYPH D066;Lo;0;L;;;;;N;;;;;
+130C9;EGYPTIAN HIEROGLYPH D067;Lo;0;L;;;;;N;;;;;
+130CA;EGYPTIAN HIEROGLYPH D067A;Lo;0;L;;;;;N;;;;;
+130CB;EGYPTIAN HIEROGLYPH D067B;Lo;0;L;;;;;N;;;;;
+130CC;EGYPTIAN HIEROGLYPH D067C;Lo;0;L;;;;;N;;;;;
+130CD;EGYPTIAN HIEROGLYPH D067D;Lo;0;L;;;;;N;;;;;
+130CE;EGYPTIAN HIEROGLYPH D067E;Lo;0;L;;;;;N;;;;;
+130CF;EGYPTIAN HIEROGLYPH D067F;Lo;0;L;;;;;N;;;;;
+130D0;EGYPTIAN HIEROGLYPH D067G;Lo;0;L;;;;;N;;;;;
+130D1;EGYPTIAN HIEROGLYPH D067H;Lo;0;L;;;;;N;;;;;
+130D2;EGYPTIAN HIEROGLYPH E001;Lo;0;L;;;;;N;;;;;
+130D3;EGYPTIAN HIEROGLYPH E002;Lo;0;L;;;;;N;;;;;
+130D4;EGYPTIAN HIEROGLYPH E003;Lo;0;L;;;;;N;;;;;
+130D5;EGYPTIAN HIEROGLYPH E004;Lo;0;L;;;;;N;;;;;
+130D6;EGYPTIAN HIEROGLYPH E005;Lo;0;L;;;;;N;;;;;
+130D7;EGYPTIAN HIEROGLYPH E006;Lo;0;L;;;;;N;;;;;
+130D8;EGYPTIAN HIEROGLYPH E007;Lo;0;L;;;;;N;;;;;
+130D9;EGYPTIAN HIEROGLYPH E008;Lo;0;L;;;;;N;;;;;
+130DA;EGYPTIAN HIEROGLYPH E008A;Lo;0;L;;;;;N;;;;;
+130DB;EGYPTIAN HIEROGLYPH E009;Lo;0;L;;;;;N;;;;;
+130DC;EGYPTIAN HIEROGLYPH E009A;Lo;0;L;;;;;N;;;;;
+130DD;EGYPTIAN HIEROGLYPH E010;Lo;0;L;;;;;N;;;;;
+130DE;EGYPTIAN HIEROGLYPH E011;Lo;0;L;;;;;N;;;;;
+130DF;EGYPTIAN HIEROGLYPH E012;Lo;0;L;;;;;N;;;;;
+130E0;EGYPTIAN HIEROGLYPH E013;Lo;0;L;;;;;N;;;;;
+130E1;EGYPTIAN HIEROGLYPH E014;Lo;0;L;;;;;N;;;;;
+130E2;EGYPTIAN HIEROGLYPH E015;Lo;0;L;;;;;N;;;;;
+130E3;EGYPTIAN HIEROGLYPH E016;Lo;0;L;;;;;N;;;;;
+130E4;EGYPTIAN HIEROGLYPH E016A;Lo;0;L;;;;;N;;;;;
+130E5;EGYPTIAN HIEROGLYPH E017;Lo;0;L;;;;;N;;;;;
+130E6;EGYPTIAN HIEROGLYPH E017A;Lo;0;L;;;;;N;;;;;
+130E7;EGYPTIAN HIEROGLYPH E018;Lo;0;L;;;;;N;;;;;
+130E8;EGYPTIAN HIEROGLYPH E019;Lo;0;L;;;;;N;;;;;
+130E9;EGYPTIAN HIEROGLYPH E020;Lo;0;L;;;;;N;;;;;
+130EA;EGYPTIAN HIEROGLYPH E020A;Lo;0;L;;;;;N;;;;;
+130EB;EGYPTIAN HIEROGLYPH E021;Lo;0;L;;;;;N;;;;;
+130EC;EGYPTIAN HIEROGLYPH E022;Lo;0;L;;;;;N;;;;;
+130ED;EGYPTIAN HIEROGLYPH E023;Lo;0;L;;;;;N;;;;;
+130EE;EGYPTIAN HIEROGLYPH E024;Lo;0;L;;;;;N;;;;;
+130EF;EGYPTIAN HIEROGLYPH E025;Lo;0;L;;;;;N;;;;;
+130F0;EGYPTIAN HIEROGLYPH E026;Lo;0;L;;;;;N;;;;;
+130F1;EGYPTIAN HIEROGLYPH E027;Lo;0;L;;;;;N;;;;;
+130F2;EGYPTIAN HIEROGLYPH E028;Lo;0;L;;;;;N;;;;;
+130F3;EGYPTIAN HIEROGLYPH E028A;Lo;0;L;;;;;N;;;;;
+130F4;EGYPTIAN HIEROGLYPH E029;Lo;0;L;;;;;N;;;;;
+130F5;EGYPTIAN HIEROGLYPH E030;Lo;0;L;;;;;N;;;;;
+130F6;EGYPTIAN HIEROGLYPH E031;Lo;0;L;;;;;N;;;;;
+130F7;EGYPTIAN HIEROGLYPH E032;Lo;0;L;;;;;N;;;;;
+130F8;EGYPTIAN HIEROGLYPH E033;Lo;0;L;;;;;N;;;;;
+130F9;EGYPTIAN HIEROGLYPH E034;Lo;0;L;;;;;N;;;;;
+130FA;EGYPTIAN HIEROGLYPH E034A;Lo;0;L;;;;;N;;;;;
+130FB;EGYPTIAN HIEROGLYPH E036;Lo;0;L;;;;;N;;;;;
+130FC;EGYPTIAN HIEROGLYPH E037;Lo;0;L;;;;;N;;;;;
+130FD;EGYPTIAN HIEROGLYPH E038;Lo;0;L;;;;;N;;;;;
+130FE;EGYPTIAN HIEROGLYPH F001;Lo;0;L;;;;;N;;;;;
+130FF;EGYPTIAN HIEROGLYPH F001A;Lo;0;L;;;;;N;;;;;
+13100;EGYPTIAN HIEROGLYPH F002;Lo;0;L;;;;;N;;;;;
+13101;EGYPTIAN HIEROGLYPH F003;Lo;0;L;;;;;N;;;;;
+13102;EGYPTIAN HIEROGLYPH F004;Lo;0;L;;;;;N;;;;;
+13103;EGYPTIAN HIEROGLYPH F005;Lo;0;L;;;;;N;;;;;
+13104;EGYPTIAN HIEROGLYPH F006;Lo;0;L;;;;;N;;;;;
+13105;EGYPTIAN HIEROGLYPH F007;Lo;0;L;;;;;N;;;;;
+13106;EGYPTIAN HIEROGLYPH F008;Lo;0;L;;;;;N;;;;;
+13107;EGYPTIAN HIEROGLYPH F009;Lo;0;L;;;;;N;;;;;
+13108;EGYPTIAN HIEROGLYPH F010;Lo;0;L;;;;;N;;;;;
+13109;EGYPTIAN HIEROGLYPH F011;Lo;0;L;;;;;N;;;;;
+1310A;EGYPTIAN HIEROGLYPH F012;Lo;0;L;;;;;N;;;;;
+1310B;EGYPTIAN HIEROGLYPH F013;Lo;0;L;;;;;N;;;;;
+1310C;EGYPTIAN HIEROGLYPH F013A;Lo;0;L;;;;;N;;;;;
+1310D;EGYPTIAN HIEROGLYPH F014;Lo;0;L;;;;;N;;;;;
+1310E;EGYPTIAN HIEROGLYPH F015;Lo;0;L;;;;;N;;;;;
+1310F;EGYPTIAN HIEROGLYPH F016;Lo;0;L;;;;;N;;;;;
+13110;EGYPTIAN HIEROGLYPH F017;Lo;0;L;;;;;N;;;;;
+13111;EGYPTIAN HIEROGLYPH F018;Lo;0;L;;;;;N;;;;;
+13112;EGYPTIAN HIEROGLYPH F019;Lo;0;L;;;;;N;;;;;
+13113;EGYPTIAN HIEROGLYPH F020;Lo;0;L;;;;;N;;;;;
+13114;EGYPTIAN HIEROGLYPH F021;Lo;0;L;;;;;N;;;;;
+13115;EGYPTIAN HIEROGLYPH F021A;Lo;0;L;;;;;N;;;;;
+13116;EGYPTIAN HIEROGLYPH F022;Lo;0;L;;;;;N;;;;;
+13117;EGYPTIAN HIEROGLYPH F023;Lo;0;L;;;;;N;;;;;
+13118;EGYPTIAN HIEROGLYPH F024;Lo;0;L;;;;;N;;;;;
+13119;EGYPTIAN HIEROGLYPH F025;Lo;0;L;;;;;N;;;;;
+1311A;EGYPTIAN HIEROGLYPH F026;Lo;0;L;;;;;N;;;;;
+1311B;EGYPTIAN HIEROGLYPH F027;Lo;0;L;;;;;N;;;;;
+1311C;EGYPTIAN HIEROGLYPH F028;Lo;0;L;;;;;N;;;;;
+1311D;EGYPTIAN HIEROGLYPH F029;Lo;0;L;;;;;N;;;;;
+1311E;EGYPTIAN HIEROGLYPH F030;Lo;0;L;;;;;N;;;;;
+1311F;EGYPTIAN HIEROGLYPH F031;Lo;0;L;;;;;N;;;;;
+13120;EGYPTIAN HIEROGLYPH F031A;Lo;0;L;;;;;N;;;;;
+13121;EGYPTIAN HIEROGLYPH F032;Lo;0;L;;;;;N;;;;;
+13122;EGYPTIAN HIEROGLYPH F033;Lo;0;L;;;;;N;;;;;
+13123;EGYPTIAN HIEROGLYPH F034;Lo;0;L;;;;;N;;;;;
+13124;EGYPTIAN HIEROGLYPH F035;Lo;0;L;;;;;N;;;;;
+13125;EGYPTIAN HIEROGLYPH F036;Lo;0;L;;;;;N;;;;;
+13126;EGYPTIAN HIEROGLYPH F037;Lo;0;L;;;;;N;;;;;
+13127;EGYPTIAN HIEROGLYPH F037A;Lo;0;L;;;;;N;;;;;
+13128;EGYPTIAN HIEROGLYPH F038;Lo;0;L;;;;;N;;;;;
+13129;EGYPTIAN HIEROGLYPH F038A;Lo;0;L;;;;;N;;;;;
+1312A;EGYPTIAN HIEROGLYPH F039;Lo;0;L;;;;;N;;;;;
+1312B;EGYPTIAN HIEROGLYPH F040;Lo;0;L;;;;;N;;;;;
+1312C;EGYPTIAN HIEROGLYPH F041;Lo;0;L;;;;;N;;;;;
+1312D;EGYPTIAN HIEROGLYPH F042;Lo;0;L;;;;;N;;;;;
+1312E;EGYPTIAN HIEROGLYPH F043;Lo;0;L;;;;;N;;;;;
+1312F;EGYPTIAN HIEROGLYPH F044;Lo;0;L;;;;;N;;;;;
+13130;EGYPTIAN HIEROGLYPH F045;Lo;0;L;;;;;N;;;;;
+13131;EGYPTIAN HIEROGLYPH F045A;Lo;0;L;;;;;N;;;;;
+13132;EGYPTIAN HIEROGLYPH F046;Lo;0;L;;;;;N;;;;;
+13133;EGYPTIAN HIEROGLYPH F046A;Lo;0;L;;;;;N;;;;;
+13134;EGYPTIAN HIEROGLYPH F047;Lo;0;L;;;;;N;;;;;
+13135;EGYPTIAN HIEROGLYPH F047A;Lo;0;L;;;;;N;;;;;
+13136;EGYPTIAN HIEROGLYPH F048;Lo;0;L;;;;;N;;;;;
+13137;EGYPTIAN HIEROGLYPH F049;Lo;0;L;;;;;N;;;;;
+13138;EGYPTIAN HIEROGLYPH F050;Lo;0;L;;;;;N;;;;;
+13139;EGYPTIAN HIEROGLYPH F051;Lo;0;L;;;;;N;;;;;
+1313A;EGYPTIAN HIEROGLYPH F051A;Lo;0;L;;;;;N;;;;;
+1313B;EGYPTIAN HIEROGLYPH F051B;Lo;0;L;;;;;N;;;;;
+1313C;EGYPTIAN HIEROGLYPH F051C;Lo;0;L;;;;;N;;;;;
+1313D;EGYPTIAN HIEROGLYPH F052;Lo;0;L;;;;;N;;;;;
+1313E;EGYPTIAN HIEROGLYPH F053;Lo;0;L;;;;;N;;;;;
+1313F;EGYPTIAN HIEROGLYPH G001;Lo;0;L;;;;;N;;;;;
+13140;EGYPTIAN HIEROGLYPH G002;Lo;0;L;;;;;N;;;;;
+13141;EGYPTIAN HIEROGLYPH G003;Lo;0;L;;;;;N;;;;;
+13142;EGYPTIAN HIEROGLYPH G004;Lo;0;L;;;;;N;;;;;
+13143;EGYPTIAN HIEROGLYPH G005;Lo;0;L;;;;;N;;;;;
+13144;EGYPTIAN HIEROGLYPH G006;Lo;0;L;;;;;N;;;;;
+13145;EGYPTIAN HIEROGLYPH G006A;Lo;0;L;;;;;N;;;;;
+13146;EGYPTIAN HIEROGLYPH G007;Lo;0;L;;;;;N;;;;;
+13147;EGYPTIAN HIEROGLYPH G007A;Lo;0;L;;;;;N;;;;;
+13148;EGYPTIAN HIEROGLYPH G007B;Lo;0;L;;;;;N;;;;;
+13149;EGYPTIAN HIEROGLYPH G008;Lo;0;L;;;;;N;;;;;
+1314A;EGYPTIAN HIEROGLYPH G009;Lo;0;L;;;;;N;;;;;
+1314B;EGYPTIAN HIEROGLYPH G010;Lo;0;L;;;;;N;;;;;
+1314C;EGYPTIAN HIEROGLYPH G011;Lo;0;L;;;;;N;;;;;
+1314D;EGYPTIAN HIEROGLYPH G011A;Lo;0;L;;;;;N;;;;;
+1314E;EGYPTIAN HIEROGLYPH G012;Lo;0;L;;;;;N;;;;;
+1314F;EGYPTIAN HIEROGLYPH G013;Lo;0;L;;;;;N;;;;;
+13150;EGYPTIAN HIEROGLYPH G014;Lo;0;L;;;;;N;;;;;
+13151;EGYPTIAN HIEROGLYPH G015;Lo;0;L;;;;;N;;;;;
+13152;EGYPTIAN HIEROGLYPH G016;Lo;0;L;;;;;N;;;;;
+13153;EGYPTIAN HIEROGLYPH G017;Lo;0;L;;;;;N;;;;;
+13154;EGYPTIAN HIEROGLYPH G018;Lo;0;L;;;;;N;;;;;
+13155;EGYPTIAN HIEROGLYPH G019;Lo;0;L;;;;;N;;;;;
+13156;EGYPTIAN HIEROGLYPH G020;Lo;0;L;;;;;N;;;;;
+13157;EGYPTIAN HIEROGLYPH G020A;Lo;0;L;;;;;N;;;;;
+13158;EGYPTIAN HIEROGLYPH G021;Lo;0;L;;;;;N;;;;;
+13159;EGYPTIAN HIEROGLYPH G022;Lo;0;L;;;;;N;;;;;
+1315A;EGYPTIAN HIEROGLYPH G023;Lo;0;L;;;;;N;;;;;
+1315B;EGYPTIAN HIEROGLYPH G024;Lo;0;L;;;;;N;;;;;
+1315C;EGYPTIAN HIEROGLYPH G025;Lo;0;L;;;;;N;;;;;
+1315D;EGYPTIAN HIEROGLYPH G026;Lo;0;L;;;;;N;;;;;
+1315E;EGYPTIAN HIEROGLYPH G026A;Lo;0;L;;;;;N;;;;;
+1315F;EGYPTIAN HIEROGLYPH G027;Lo;0;L;;;;;N;;;;;
+13160;EGYPTIAN HIEROGLYPH G028;Lo;0;L;;;;;N;;;;;
+13161;EGYPTIAN HIEROGLYPH G029;Lo;0;L;;;;;N;;;;;
+13162;EGYPTIAN HIEROGLYPH G030;Lo;0;L;;;;;N;;;;;
+13163;EGYPTIAN HIEROGLYPH G031;Lo;0;L;;;;;N;;;;;
+13164;EGYPTIAN HIEROGLYPH G032;Lo;0;L;;;;;N;;;;;
+13165;EGYPTIAN HIEROGLYPH G033;Lo;0;L;;;;;N;;;;;
+13166;EGYPTIAN HIEROGLYPH G034;Lo;0;L;;;;;N;;;;;
+13167;EGYPTIAN HIEROGLYPH G035;Lo;0;L;;;;;N;;;;;
+13168;EGYPTIAN HIEROGLYPH G036;Lo;0;L;;;;;N;;;;;
+13169;EGYPTIAN HIEROGLYPH G036A;Lo;0;L;;;;;N;;;;;
+1316A;EGYPTIAN HIEROGLYPH G037;Lo;0;L;;;;;N;;;;;
+1316B;EGYPTIAN HIEROGLYPH G037A;Lo;0;L;;;;;N;;;;;
+1316C;EGYPTIAN HIEROGLYPH G038;Lo;0;L;;;;;N;;;;;
+1316D;EGYPTIAN HIEROGLYPH G039;Lo;0;L;;;;;N;;;;;
+1316E;EGYPTIAN HIEROGLYPH G040;Lo;0;L;;;;;N;;;;;
+1316F;EGYPTIAN HIEROGLYPH G041;Lo;0;L;;;;;N;;;;;
+13170;EGYPTIAN HIEROGLYPH G042;Lo;0;L;;;;;N;;;;;
+13171;EGYPTIAN HIEROGLYPH G043;Lo;0;L;;;;;N;;;;;
+13172;EGYPTIAN HIEROGLYPH G043A;Lo;0;L;;;;;N;;;;;
+13173;EGYPTIAN HIEROGLYPH G044;Lo;0;L;;;;;N;;;;;
+13174;EGYPTIAN HIEROGLYPH G045;Lo;0;L;;;;;N;;;;;
+13175;EGYPTIAN HIEROGLYPH G045A;Lo;0;L;;;;;N;;;;;
+13176;EGYPTIAN HIEROGLYPH G046;Lo;0;L;;;;;N;;;;;
+13177;EGYPTIAN HIEROGLYPH G047;Lo;0;L;;;;;N;;;;;
+13178;EGYPTIAN HIEROGLYPH G048;Lo;0;L;;;;;N;;;;;
+13179;EGYPTIAN HIEROGLYPH G049;Lo;0;L;;;;;N;;;;;
+1317A;EGYPTIAN HIEROGLYPH G050;Lo;0;L;;;;;N;;;;;
+1317B;EGYPTIAN HIEROGLYPH G051;Lo;0;L;;;;;N;;;;;
+1317C;EGYPTIAN HIEROGLYPH G052;Lo;0;L;;;;;N;;;;;
+1317D;EGYPTIAN HIEROGLYPH G053;Lo;0;L;;;;;N;;;;;
+1317E;EGYPTIAN HIEROGLYPH G054;Lo;0;L;;;;;N;;;;;
+1317F;EGYPTIAN HIEROGLYPH H001;Lo;0;L;;;;;N;;;;;
+13180;EGYPTIAN HIEROGLYPH H002;Lo;0;L;;;;;N;;;;;
+13181;EGYPTIAN HIEROGLYPH H003;Lo;0;L;;;;;N;;;;;
+13182;EGYPTIAN HIEROGLYPH H004;Lo;0;L;;;;;N;;;;;
+13183;EGYPTIAN HIEROGLYPH H005;Lo;0;L;;;;;N;;;;;
+13184;EGYPTIAN HIEROGLYPH H006;Lo;0;L;;;;;N;;;;;
+13185;EGYPTIAN HIEROGLYPH H006A;Lo;0;L;;;;;N;;;;;
+13186;EGYPTIAN HIEROGLYPH H007;Lo;0;L;;;;;N;;;;;
+13187;EGYPTIAN HIEROGLYPH H008;Lo;0;L;;;;;N;;;;;
+13188;EGYPTIAN HIEROGLYPH I001;Lo;0;L;;;;;N;;;;;
+13189;EGYPTIAN HIEROGLYPH I002;Lo;0;L;;;;;N;;;;;
+1318A;EGYPTIAN HIEROGLYPH I003;Lo;0;L;;;;;N;;;;;
+1318B;EGYPTIAN HIEROGLYPH I004;Lo;0;L;;;;;N;;;;;
+1318C;EGYPTIAN HIEROGLYPH I005;Lo;0;L;;;;;N;;;;;
+1318D;EGYPTIAN HIEROGLYPH I005A;Lo;0;L;;;;;N;;;;;
+1318E;EGYPTIAN HIEROGLYPH I006;Lo;0;L;;;;;N;;;;;
+1318F;EGYPTIAN HIEROGLYPH I007;Lo;0;L;;;;;N;;;;;
+13190;EGYPTIAN HIEROGLYPH I008;Lo;0;L;;;;;N;;;;;
+13191;EGYPTIAN HIEROGLYPH I009;Lo;0;L;;;;;N;;;;;
+13192;EGYPTIAN HIEROGLYPH I009A;Lo;0;L;;;;;N;;;;;
+13193;EGYPTIAN HIEROGLYPH I010;Lo;0;L;;;;;N;;;;;
+13194;EGYPTIAN HIEROGLYPH I010A;Lo;0;L;;;;;N;;;;;
+13195;EGYPTIAN HIEROGLYPH I011;Lo;0;L;;;;;N;;;;;
+13196;EGYPTIAN HIEROGLYPH I011A;Lo;0;L;;;;;N;;;;;
+13197;EGYPTIAN HIEROGLYPH I012;Lo;0;L;;;;;N;;;;;
+13198;EGYPTIAN HIEROGLYPH I013;Lo;0;L;;;;;N;;;;;
+13199;EGYPTIAN HIEROGLYPH I014;Lo;0;L;;;;;N;;;;;
+1319A;EGYPTIAN HIEROGLYPH I015;Lo;0;L;;;;;N;;;;;
+1319B;EGYPTIAN HIEROGLYPH K001;Lo;0;L;;;;;N;;;;;
+1319C;EGYPTIAN HIEROGLYPH K002;Lo;0;L;;;;;N;;;;;
+1319D;EGYPTIAN HIEROGLYPH K003;Lo;0;L;;;;;N;;;;;
+1319E;EGYPTIAN HIEROGLYPH K004;Lo;0;L;;;;;N;;;;;
+1319F;EGYPTIAN HIEROGLYPH K005;Lo;0;L;;;;;N;;;;;
+131A0;EGYPTIAN HIEROGLYPH K006;Lo;0;L;;;;;N;;;;;
+131A1;EGYPTIAN HIEROGLYPH K007;Lo;0;L;;;;;N;;;;;
+131A2;EGYPTIAN HIEROGLYPH K008;Lo;0;L;;;;;N;;;;;
+131A3;EGYPTIAN HIEROGLYPH L001;Lo;0;L;;;;;N;;;;;
+131A4;EGYPTIAN HIEROGLYPH L002;Lo;0;L;;;;;N;;;;;
+131A5;EGYPTIAN HIEROGLYPH L002A;Lo;0;L;;;;;N;;;;;
+131A6;EGYPTIAN HIEROGLYPH L003;Lo;0;L;;;;;N;;;;;
+131A7;EGYPTIAN HIEROGLYPH L004;Lo;0;L;;;;;N;;;;;
+131A8;EGYPTIAN HIEROGLYPH L005;Lo;0;L;;;;;N;;;;;
+131A9;EGYPTIAN HIEROGLYPH L006;Lo;0;L;;;;;N;;;;;
+131AA;EGYPTIAN HIEROGLYPH L006A;Lo;0;L;;;;;N;;;;;
+131AB;EGYPTIAN HIEROGLYPH L007;Lo;0;L;;;;;N;;;;;
+131AC;EGYPTIAN HIEROGLYPH L008;Lo;0;L;;;;;N;;;;;
+131AD;EGYPTIAN HIEROGLYPH M001;Lo;0;L;;;;;N;;;;;
+131AE;EGYPTIAN HIEROGLYPH M001A;Lo;0;L;;;;;N;;;;;
+131AF;EGYPTIAN HIEROGLYPH M001B;Lo;0;L;;;;;N;;;;;
+131B0;EGYPTIAN HIEROGLYPH M002;Lo;0;L;;;;;N;;;;;
+131B1;EGYPTIAN HIEROGLYPH M003;Lo;0;L;;;;;N;;;;;
+131B2;EGYPTIAN HIEROGLYPH M003A;Lo;0;L;;;;;N;;;;;
+131B3;EGYPTIAN HIEROGLYPH M004;Lo;0;L;;;;;N;;;;;
+131B4;EGYPTIAN HIEROGLYPH M005;Lo;0;L;;;;;N;;;;;
+131B5;EGYPTIAN HIEROGLYPH M006;Lo;0;L;;;;;N;;;;;
+131B6;EGYPTIAN HIEROGLYPH M007;Lo;0;L;;;;;N;;;;;
+131B7;EGYPTIAN HIEROGLYPH M008;Lo;0;L;;;;;N;;;;;
+131B8;EGYPTIAN HIEROGLYPH M009;Lo;0;L;;;;;N;;;;;
+131B9;EGYPTIAN HIEROGLYPH M010;Lo;0;L;;;;;N;;;;;
+131BA;EGYPTIAN HIEROGLYPH M010A;Lo;0;L;;;;;N;;;;;
+131BB;EGYPTIAN HIEROGLYPH M011;Lo;0;L;;;;;N;;;;;
+131BC;EGYPTIAN HIEROGLYPH M012;Lo;0;L;;;;;N;;;;;
+131BD;EGYPTIAN HIEROGLYPH M012A;Lo;0;L;;;;;N;;;;;
+131BE;EGYPTIAN HIEROGLYPH M012B;Lo;0;L;;;;;N;;;;;
+131BF;EGYPTIAN HIEROGLYPH M012C;Lo;0;L;;;;;N;;;;;
+131C0;EGYPTIAN HIEROGLYPH M012D;Lo;0;L;;;;;N;;;;;
+131C1;EGYPTIAN HIEROGLYPH M012E;Lo;0;L;;;;;N;;;;;
+131C2;EGYPTIAN HIEROGLYPH M012F;Lo;0;L;;;;;N;;;;;
+131C3;EGYPTIAN HIEROGLYPH M012G;Lo;0;L;;;;;N;;;;;
+131C4;EGYPTIAN HIEROGLYPH M012H;Lo;0;L;;;;;N;;;;;
+131C5;EGYPTIAN HIEROGLYPH M013;Lo;0;L;;;;;N;;;;;
+131C6;EGYPTIAN HIEROGLYPH M014;Lo;0;L;;;;;N;;;;;
+131C7;EGYPTIAN HIEROGLYPH M015;Lo;0;L;;;;;N;;;;;
+131C8;EGYPTIAN HIEROGLYPH M015A;Lo;0;L;;;;;N;;;;;
+131C9;EGYPTIAN HIEROGLYPH M016;Lo;0;L;;;;;N;;;;;
+131CA;EGYPTIAN HIEROGLYPH M016A;Lo;0;L;;;;;N;;;;;
+131CB;EGYPTIAN HIEROGLYPH M017;Lo;0;L;;;;;N;;;;;
+131CC;EGYPTIAN HIEROGLYPH M017A;Lo;0;L;;;;;N;;;;;
+131CD;EGYPTIAN HIEROGLYPH M018;Lo;0;L;;;;;N;;;;;
+131CE;EGYPTIAN HIEROGLYPH M019;Lo;0;L;;;;;N;;;;;
+131CF;EGYPTIAN HIEROGLYPH M020;Lo;0;L;;;;;N;;;;;
+131D0;EGYPTIAN HIEROGLYPH M021;Lo;0;L;;;;;N;;;;;
+131D1;EGYPTIAN HIEROGLYPH M022;Lo;0;L;;;;;N;;;;;
+131D2;EGYPTIAN HIEROGLYPH M022A;Lo;0;L;;;;;N;;;;;
+131D3;EGYPTIAN HIEROGLYPH M023;Lo;0;L;;;;;N;;;;;
+131D4;EGYPTIAN HIEROGLYPH M024;Lo;0;L;;;;;N;;;;;
+131D5;EGYPTIAN HIEROGLYPH M024A;Lo;0;L;;;;;N;;;;;
+131D6;EGYPTIAN HIEROGLYPH M025;Lo;0;L;;;;;N;;;;;
+131D7;EGYPTIAN HIEROGLYPH M026;Lo;0;L;;;;;N;;;;;
+131D8;EGYPTIAN HIEROGLYPH M027;Lo;0;L;;;;;N;;;;;
+131D9;EGYPTIAN HIEROGLYPH M028;Lo;0;L;;;;;N;;;;;
+131DA;EGYPTIAN HIEROGLYPH M028A;Lo;0;L;;;;;N;;;;;
+131DB;EGYPTIAN HIEROGLYPH M029;Lo;0;L;;;;;N;;;;;
+131DC;EGYPTIAN HIEROGLYPH M030;Lo;0;L;;;;;N;;;;;
+131DD;EGYPTIAN HIEROGLYPH M031;Lo;0;L;;;;;N;;;;;
+131DE;EGYPTIAN HIEROGLYPH M031A;Lo;0;L;;;;;N;;;;;
+131DF;EGYPTIAN HIEROGLYPH M032;Lo;0;L;;;;;N;;;;;
+131E0;EGYPTIAN HIEROGLYPH M033;Lo;0;L;;;;;N;;;;;
+131E1;EGYPTIAN HIEROGLYPH M033A;Lo;0;L;;;;;N;;;;;
+131E2;EGYPTIAN HIEROGLYPH M033B;Lo;0;L;;;;;N;;;;;
+131E3;EGYPTIAN HIEROGLYPH M034;Lo;0;L;;;;;N;;;;;
+131E4;EGYPTIAN HIEROGLYPH M035;Lo;0;L;;;;;N;;;;;
+131E5;EGYPTIAN HIEROGLYPH M036;Lo;0;L;;;;;N;;;;;
+131E6;EGYPTIAN HIEROGLYPH M037;Lo;0;L;;;;;N;;;;;
+131E7;EGYPTIAN HIEROGLYPH M038;Lo;0;L;;;;;N;;;;;
+131E8;EGYPTIAN HIEROGLYPH M039;Lo;0;L;;;;;N;;;;;
+131E9;EGYPTIAN HIEROGLYPH M040;Lo;0;L;;;;;N;;;;;
+131EA;EGYPTIAN HIEROGLYPH M040A;Lo;0;L;;;;;N;;;;;
+131EB;EGYPTIAN HIEROGLYPH M041;Lo;0;L;;;;;N;;;;;
+131EC;EGYPTIAN HIEROGLYPH M042;Lo;0;L;;;;;N;;;;;
+131ED;EGYPTIAN HIEROGLYPH M043;Lo;0;L;;;;;N;;;;;
+131EE;EGYPTIAN HIEROGLYPH M044;Lo;0;L;;;;;N;;;;;
+131EF;EGYPTIAN HIEROGLYPH N001;Lo;0;L;;;;;N;;;;;
+131F0;EGYPTIAN HIEROGLYPH N002;Lo;0;L;;;;;N;;;;;
+131F1;EGYPTIAN HIEROGLYPH N003;Lo;0;L;;;;;N;;;;;
+131F2;EGYPTIAN HIEROGLYPH N004;Lo;0;L;;;;;N;;;;;
+131F3;EGYPTIAN HIEROGLYPH N005;Lo;0;L;;;;;N;;;;;
+131F4;EGYPTIAN HIEROGLYPH N006;Lo;0;L;;;;;N;;;;;
+131F5;EGYPTIAN HIEROGLYPH N007;Lo;0;L;;;;;N;;;;;
+131F6;EGYPTIAN HIEROGLYPH N008;Lo;0;L;;;;;N;;;;;
+131F7;EGYPTIAN HIEROGLYPH N009;Lo;0;L;;;;;N;;;;;
+131F8;EGYPTIAN HIEROGLYPH N010;Lo;0;L;;;;;N;;;;;
+131F9;EGYPTIAN HIEROGLYPH N011;Lo;0;L;;;;;N;;;;;
+131FA;EGYPTIAN HIEROGLYPH N012;Lo;0;L;;;;;N;;;;;
+131FB;EGYPTIAN HIEROGLYPH N013;Lo;0;L;;;;;N;;;;;
+131FC;EGYPTIAN HIEROGLYPH N014;Lo;0;L;;;;;N;;;;;
+131FD;EGYPTIAN HIEROGLYPH N015;Lo;0;L;;;;;N;;;;;
+131FE;EGYPTIAN HIEROGLYPH N016;Lo;0;L;;;;;N;;;;;
+131FF;EGYPTIAN HIEROGLYPH N017;Lo;0;L;;;;;N;;;;;
+13200;EGYPTIAN HIEROGLYPH N018;Lo;0;L;;;;;N;;;;;
+13201;EGYPTIAN HIEROGLYPH N018A;Lo;0;L;;;;;N;;;;;
+13202;EGYPTIAN HIEROGLYPH N018B;Lo;0;L;;;;;N;;;;;
+13203;EGYPTIAN HIEROGLYPH N019;Lo;0;L;;;;;N;;;;;
+13204;EGYPTIAN HIEROGLYPH N020;Lo;0;L;;;;;N;;;;;
+13205;EGYPTIAN HIEROGLYPH N021;Lo;0;L;;;;;N;;;;;
+13206;EGYPTIAN HIEROGLYPH N022;Lo;0;L;;;;;N;;;;;
+13207;EGYPTIAN HIEROGLYPH N023;Lo;0;L;;;;;N;;;;;
+13208;EGYPTIAN HIEROGLYPH N024;Lo;0;L;;;;;N;;;;;
+13209;EGYPTIAN HIEROGLYPH N025;Lo;0;L;;;;;N;;;;;
+1320A;EGYPTIAN HIEROGLYPH N025A;Lo;0;L;;;;;N;;;;;
+1320B;EGYPTIAN HIEROGLYPH N026;Lo;0;L;;;;;N;;;;;
+1320C;EGYPTIAN HIEROGLYPH N027;Lo;0;L;;;;;N;;;;;
+1320D;EGYPTIAN HIEROGLYPH N028;Lo;0;L;;;;;N;;;;;
+1320E;EGYPTIAN HIEROGLYPH N029;Lo;0;L;;;;;N;;;;;
+1320F;EGYPTIAN HIEROGLYPH N030;Lo;0;L;;;;;N;;;;;
+13210;EGYPTIAN HIEROGLYPH N031;Lo;0;L;;;;;N;;;;;
+13211;EGYPTIAN HIEROGLYPH N032;Lo;0;L;;;;;N;;;;;
+13212;EGYPTIAN HIEROGLYPH N033;Lo;0;L;;;;;N;;;;;
+13213;EGYPTIAN HIEROGLYPH N033A;Lo;0;L;;;;;N;;;;;
+13214;EGYPTIAN HIEROGLYPH N034;Lo;0;L;;;;;N;;;;;
+13215;EGYPTIAN HIEROGLYPH N034A;Lo;0;L;;;;;N;;;;;
+13216;EGYPTIAN HIEROGLYPH N035;Lo;0;L;;;;;N;;;;;
+13217;EGYPTIAN HIEROGLYPH N035A;Lo;0;L;;;;;N;;;;;
+13218;EGYPTIAN HIEROGLYPH N036;Lo;0;L;;;;;N;;;;;
+13219;EGYPTIAN HIEROGLYPH N037;Lo;0;L;;;;;N;;;;;
+1321A;EGYPTIAN HIEROGLYPH N037A;Lo;0;L;;;;;N;;;;;
+1321B;EGYPTIAN HIEROGLYPH N038;Lo;0;L;;;;;N;;;;;
+1321C;EGYPTIAN HIEROGLYPH N039;Lo;0;L;;;;;N;;;;;
+1321D;EGYPTIAN HIEROGLYPH N040;Lo;0;L;;;;;N;;;;;
+1321E;EGYPTIAN HIEROGLYPH N041;Lo;0;L;;;;;N;;;;;
+1321F;EGYPTIAN HIEROGLYPH N042;Lo;0;L;;;;;N;;;;;
+13220;EGYPTIAN HIEROGLYPH NL001;Lo;0;L;;;;;N;;;;;
+13221;EGYPTIAN HIEROGLYPH NL002;Lo;0;L;;;;;N;;;;;
+13222;EGYPTIAN HIEROGLYPH NL003;Lo;0;L;;;;;N;;;;;
+13223;EGYPTIAN HIEROGLYPH NL004;Lo;0;L;;;;;N;;;;;
+13224;EGYPTIAN HIEROGLYPH NL005;Lo;0;L;;;;;N;;;;;
+13225;EGYPTIAN HIEROGLYPH NL005A;Lo;0;L;;;;;N;;;;;
+13226;EGYPTIAN HIEROGLYPH NL006;Lo;0;L;;;;;N;;;;;
+13227;EGYPTIAN HIEROGLYPH NL007;Lo;0;L;;;;;N;;;;;
+13228;EGYPTIAN HIEROGLYPH NL008;Lo;0;L;;;;;N;;;;;
+13229;EGYPTIAN HIEROGLYPH NL009;Lo;0;L;;;;;N;;;;;
+1322A;EGYPTIAN HIEROGLYPH NL010;Lo;0;L;;;;;N;;;;;
+1322B;EGYPTIAN HIEROGLYPH NL011;Lo;0;L;;;;;N;;;;;
+1322C;EGYPTIAN HIEROGLYPH NL012;Lo;0;L;;;;;N;;;;;
+1322D;EGYPTIAN HIEROGLYPH NL013;Lo;0;L;;;;;N;;;;;
+1322E;EGYPTIAN HIEROGLYPH NL014;Lo;0;L;;;;;N;;;;;
+1322F;EGYPTIAN HIEROGLYPH NL015;Lo;0;L;;;;;N;;;;;
+13230;EGYPTIAN HIEROGLYPH NL016;Lo;0;L;;;;;N;;;;;
+13231;EGYPTIAN HIEROGLYPH NL017;Lo;0;L;;;;;N;;;;;
+13232;EGYPTIAN HIEROGLYPH NL017A;Lo;0;L;;;;;N;;;;;
+13233;EGYPTIAN HIEROGLYPH NL018;Lo;0;L;;;;;N;;;;;
+13234;EGYPTIAN HIEROGLYPH NL019;Lo;0;L;;;;;N;;;;;
+13235;EGYPTIAN HIEROGLYPH NL020;Lo;0;L;;;;;N;;;;;
+13236;EGYPTIAN HIEROGLYPH NU001;Lo;0;L;;;;;N;;;;;
+13237;EGYPTIAN HIEROGLYPH NU002;Lo;0;L;;;;;N;;;;;
+13238;EGYPTIAN HIEROGLYPH NU003;Lo;0;L;;;;;N;;;;;
+13239;EGYPTIAN HIEROGLYPH NU004;Lo;0;L;;;;;N;;;;;
+1323A;EGYPTIAN HIEROGLYPH NU005;Lo;0;L;;;;;N;;;;;
+1323B;EGYPTIAN HIEROGLYPH NU006;Lo;0;L;;;;;N;;;;;
+1323C;EGYPTIAN HIEROGLYPH NU007;Lo;0;L;;;;;N;;;;;
+1323D;EGYPTIAN HIEROGLYPH NU008;Lo;0;L;;;;;N;;;;;
+1323E;EGYPTIAN HIEROGLYPH NU009;Lo;0;L;;;;;N;;;;;
+1323F;EGYPTIAN HIEROGLYPH NU010;Lo;0;L;;;;;N;;;;;
+13240;EGYPTIAN HIEROGLYPH NU010A;Lo;0;L;;;;;N;;;;;
+13241;EGYPTIAN HIEROGLYPH NU011;Lo;0;L;;;;;N;;;;;
+13242;EGYPTIAN HIEROGLYPH NU011A;Lo;0;L;;;;;N;;;;;
+13243;EGYPTIAN HIEROGLYPH NU012;Lo;0;L;;;;;N;;;;;
+13244;EGYPTIAN HIEROGLYPH NU013;Lo;0;L;;;;;N;;;;;
+13245;EGYPTIAN HIEROGLYPH NU014;Lo;0;L;;;;;N;;;;;
+13246;EGYPTIAN HIEROGLYPH NU015;Lo;0;L;;;;;N;;;;;
+13247;EGYPTIAN HIEROGLYPH NU016;Lo;0;L;;;;;N;;;;;
+13248;EGYPTIAN HIEROGLYPH NU017;Lo;0;L;;;;;N;;;;;
+13249;EGYPTIAN HIEROGLYPH NU018;Lo;0;L;;;;;N;;;;;
+1324A;EGYPTIAN HIEROGLYPH NU018A;Lo;0;L;;;;;N;;;;;
+1324B;EGYPTIAN HIEROGLYPH NU019;Lo;0;L;;;;;N;;;;;
+1324C;EGYPTIAN HIEROGLYPH NU020;Lo;0;L;;;;;N;;;;;
+1324D;EGYPTIAN HIEROGLYPH NU021;Lo;0;L;;;;;N;;;;;
+1324E;EGYPTIAN HIEROGLYPH NU022;Lo;0;L;;;;;N;;;;;
+1324F;EGYPTIAN HIEROGLYPH NU022A;Lo;0;L;;;;;N;;;;;
+13250;EGYPTIAN HIEROGLYPH O001;Lo;0;L;;;;;N;;;;;
+13251;EGYPTIAN HIEROGLYPH O001A;Lo;0;L;;;;;N;;;;;
+13252;EGYPTIAN HIEROGLYPH O002;Lo;0;L;;;;;N;;;;;
+13253;EGYPTIAN HIEROGLYPH O003;Lo;0;L;;;;;N;;;;;
+13254;EGYPTIAN HIEROGLYPH O004;Lo;0;L;;;;;N;;;;;
+13255;EGYPTIAN HIEROGLYPH O005;Lo;0;L;;;;;N;;;;;
+13256;EGYPTIAN HIEROGLYPH O005A;Lo;0;L;;;;;N;;;;;
+13257;EGYPTIAN HIEROGLYPH O006;Lo;0;L;;;;;N;;;;;
+13258;EGYPTIAN HIEROGLYPH O006A;Lo;0;L;;;;;N;;;;;
+13259;EGYPTIAN HIEROGLYPH O006B;Lo;0;L;;;;;N;;;;;
+1325A;EGYPTIAN HIEROGLYPH O006C;Lo;0;L;;;;;N;;;;;
+1325B;EGYPTIAN HIEROGLYPH O006D;Lo;0;L;;;;;N;;;;;
+1325C;EGYPTIAN HIEROGLYPH O006E;Lo;0;L;;;;;N;;;;;
+1325D;EGYPTIAN HIEROGLYPH O006F;Lo;0;L;;;;;N;;;;;
+1325E;EGYPTIAN HIEROGLYPH O007;Lo;0;L;;;;;N;;;;;
+1325F;EGYPTIAN HIEROGLYPH O008;Lo;0;L;;;;;N;;;;;
+13260;EGYPTIAN HIEROGLYPH O009;Lo;0;L;;;;;N;;;;;
+13261;EGYPTIAN HIEROGLYPH O010;Lo;0;L;;;;;N;;;;;
+13262;EGYPTIAN HIEROGLYPH O010A;Lo;0;L;;;;;N;;;;;
+13263;EGYPTIAN HIEROGLYPH O010B;Lo;0;L;;;;;N;;;;;
+13264;EGYPTIAN HIEROGLYPH O010C;Lo;0;L;;;;;N;;;;;
+13265;EGYPTIAN HIEROGLYPH O011;Lo;0;L;;;;;N;;;;;
+13266;EGYPTIAN HIEROGLYPH O012;Lo;0;L;;;;;N;;;;;
+13267;EGYPTIAN HIEROGLYPH O013;Lo;0;L;;;;;N;;;;;
+13268;EGYPTIAN HIEROGLYPH O014;Lo;0;L;;;;;N;;;;;
+13269;EGYPTIAN HIEROGLYPH O015;Lo;0;L;;;;;N;;;;;
+1326A;EGYPTIAN HIEROGLYPH O016;Lo;0;L;;;;;N;;;;;
+1326B;EGYPTIAN HIEROGLYPH O017;Lo;0;L;;;;;N;;;;;
+1326C;EGYPTIAN HIEROGLYPH O018;Lo;0;L;;;;;N;;;;;
+1326D;EGYPTIAN HIEROGLYPH O019;Lo;0;L;;;;;N;;;;;
+1326E;EGYPTIAN HIEROGLYPH O019A;Lo;0;L;;;;;N;;;;;
+1326F;EGYPTIAN HIEROGLYPH O020;Lo;0;L;;;;;N;;;;;
+13270;EGYPTIAN HIEROGLYPH O020A;Lo;0;L;;;;;N;;;;;
+13271;EGYPTIAN HIEROGLYPH O021;Lo;0;L;;;;;N;;;;;
+13272;EGYPTIAN HIEROGLYPH O022;Lo;0;L;;;;;N;;;;;
+13273;EGYPTIAN HIEROGLYPH O023;Lo;0;L;;;;;N;;;;;
+13274;EGYPTIAN HIEROGLYPH O024;Lo;0;L;;;;;N;;;;;
+13275;EGYPTIAN HIEROGLYPH O024A;Lo;0;L;;;;;N;;;;;
+13276;EGYPTIAN HIEROGLYPH O025;Lo;0;L;;;;;N;;;;;
+13277;EGYPTIAN HIEROGLYPH O025A;Lo;0;L;;;;;N;;;;;
+13278;EGYPTIAN HIEROGLYPH O026;Lo;0;L;;;;;N;;;;;
+13279;EGYPTIAN HIEROGLYPH O027;Lo;0;L;;;;;N;;;;;
+1327A;EGYPTIAN HIEROGLYPH O028;Lo;0;L;;;;;N;;;;;
+1327B;EGYPTIAN HIEROGLYPH O029;Lo;0;L;;;;;N;;;;;
+1327C;EGYPTIAN HIEROGLYPH O029A;Lo;0;L;;;;;N;;;;;
+1327D;EGYPTIAN HIEROGLYPH O030;Lo;0;L;;;;;N;;;;;
+1327E;EGYPTIAN HIEROGLYPH O030A;Lo;0;L;;;;;N;;;;;
+1327F;EGYPTIAN HIEROGLYPH O031;Lo;0;L;;;;;N;;;;;
+13280;EGYPTIAN HIEROGLYPH O032;Lo;0;L;;;;;N;;;;;
+13281;EGYPTIAN HIEROGLYPH O033;Lo;0;L;;;;;N;;;;;
+13282;EGYPTIAN HIEROGLYPH O033A;Lo;0;L;;;;;N;;;;;
+13283;EGYPTIAN HIEROGLYPH O034;Lo;0;L;;;;;N;;;;;
+13284;EGYPTIAN HIEROGLYPH O035;Lo;0;L;;;;;N;;;;;
+13285;EGYPTIAN HIEROGLYPH O036;Lo;0;L;;;;;N;;;;;
+13286;EGYPTIAN HIEROGLYPH O036A;Lo;0;L;;;;;N;;;;;
+13287;EGYPTIAN HIEROGLYPH O036B;Lo;0;L;;;;;N;;;;;
+13288;EGYPTIAN HIEROGLYPH O036C;Lo;0;L;;;;;N;;;;;
+13289;EGYPTIAN HIEROGLYPH O036D;Lo;0;L;;;;;N;;;;;
+1328A;EGYPTIAN HIEROGLYPH O037;Lo;0;L;;;;;N;;;;;
+1328B;EGYPTIAN HIEROGLYPH O038;Lo;0;L;;;;;N;;;;;
+1328C;EGYPTIAN HIEROGLYPH O039;Lo;0;L;;;;;N;;;;;
+1328D;EGYPTIAN HIEROGLYPH O040;Lo;0;L;;;;;N;;;;;
+1328E;EGYPTIAN HIEROGLYPH O041;Lo;0;L;;;;;N;;;;;
+1328F;EGYPTIAN HIEROGLYPH O042;Lo;0;L;;;;;N;;;;;
+13290;EGYPTIAN HIEROGLYPH O043;Lo;0;L;;;;;N;;;;;
+13291;EGYPTIAN HIEROGLYPH O044;Lo;0;L;;;;;N;;;;;
+13292;EGYPTIAN HIEROGLYPH O045;Lo;0;L;;;;;N;;;;;
+13293;EGYPTIAN HIEROGLYPH O046;Lo;0;L;;;;;N;;;;;
+13294;EGYPTIAN HIEROGLYPH O047;Lo;0;L;;;;;N;;;;;
+13295;EGYPTIAN HIEROGLYPH O048;Lo;0;L;;;;;N;;;;;
+13296;EGYPTIAN HIEROGLYPH O049;Lo;0;L;;;;;N;;;;;
+13297;EGYPTIAN HIEROGLYPH O050;Lo;0;L;;;;;N;;;;;
+13298;EGYPTIAN HIEROGLYPH O050A;Lo;0;L;;;;;N;;;;;
+13299;EGYPTIAN HIEROGLYPH O050B;Lo;0;L;;;;;N;;;;;
+1329A;EGYPTIAN HIEROGLYPH O051;Lo;0;L;;;;;N;;;;;
+1329B;EGYPTIAN HIEROGLYPH P001;Lo;0;L;;;;;N;;;;;
+1329C;EGYPTIAN HIEROGLYPH P001A;Lo;0;L;;;;;N;;;;;
+1329D;EGYPTIAN HIEROGLYPH P002;Lo;0;L;;;;;N;;;;;
+1329E;EGYPTIAN HIEROGLYPH P003;Lo;0;L;;;;;N;;;;;
+1329F;EGYPTIAN HIEROGLYPH P003A;Lo;0;L;;;;;N;;;;;
+132A0;EGYPTIAN HIEROGLYPH P004;Lo;0;L;;;;;N;;;;;
+132A1;EGYPTIAN HIEROGLYPH P005;Lo;0;L;;;;;N;;;;;
+132A2;EGYPTIAN HIEROGLYPH P006;Lo;0;L;;;;;N;;;;;
+132A3;EGYPTIAN HIEROGLYPH P007;Lo;0;L;;;;;N;;;;;
+132A4;EGYPTIAN HIEROGLYPH P008;Lo;0;L;;;;;N;;;;;
+132A5;EGYPTIAN HIEROGLYPH P009;Lo;0;L;;;;;N;;;;;
+132A6;EGYPTIAN HIEROGLYPH P010;Lo;0;L;;;;;N;;;;;
+132A7;EGYPTIAN HIEROGLYPH P011;Lo;0;L;;;;;N;;;;;
+132A8;EGYPTIAN HIEROGLYPH Q001;Lo;0;L;;;;;N;;;;;
+132A9;EGYPTIAN HIEROGLYPH Q002;Lo;0;L;;;;;N;;;;;
+132AA;EGYPTIAN HIEROGLYPH Q003;Lo;0;L;;;;;N;;;;;
+132AB;EGYPTIAN HIEROGLYPH Q004;Lo;0;L;;;;;N;;;;;
+132AC;EGYPTIAN HIEROGLYPH Q005;Lo;0;L;;;;;N;;;;;
+132AD;EGYPTIAN HIEROGLYPH Q006;Lo;0;L;;;;;N;;;;;
+132AE;EGYPTIAN HIEROGLYPH Q007;Lo;0;L;;;;;N;;;;;
+132AF;EGYPTIAN HIEROGLYPH R001;Lo;0;L;;;;;N;;;;;
+132B0;EGYPTIAN HIEROGLYPH R002;Lo;0;L;;;;;N;;;;;
+132B1;EGYPTIAN HIEROGLYPH R002A;Lo;0;L;;;;;N;;;;;
+132B2;EGYPTIAN HIEROGLYPH R003;Lo;0;L;;;;;N;;;;;
+132B3;EGYPTIAN HIEROGLYPH R003A;Lo;0;L;;;;;N;;;;;
+132B4;EGYPTIAN HIEROGLYPH R003B;Lo;0;L;;;;;N;;;;;
+132B5;EGYPTIAN HIEROGLYPH R004;Lo;0;L;;;;;N;;;;;
+132B6;EGYPTIAN HIEROGLYPH R005;Lo;0;L;;;;;N;;;;;
+132B7;EGYPTIAN HIEROGLYPH R006;Lo;0;L;;;;;N;;;;;
+132B8;EGYPTIAN HIEROGLYPH R007;Lo;0;L;;;;;N;;;;;
+132B9;EGYPTIAN HIEROGLYPH R008;Lo;0;L;;;;;N;;;;;
+132BA;EGYPTIAN HIEROGLYPH R009;Lo;0;L;;;;;N;;;;;
+132BB;EGYPTIAN HIEROGLYPH R010;Lo;0;L;;;;;N;;;;;
+132BC;EGYPTIAN HIEROGLYPH R010A;Lo;0;L;;;;;N;;;;;
+132BD;EGYPTIAN HIEROGLYPH R011;Lo;0;L;;;;;N;;;;;
+132BE;EGYPTIAN HIEROGLYPH R012;Lo;0;L;;;;;N;;;;;
+132BF;EGYPTIAN HIEROGLYPH R013;Lo;0;L;;;;;N;;;;;
+132C0;EGYPTIAN HIEROGLYPH R014;Lo;0;L;;;;;N;;;;;
+132C1;EGYPTIAN HIEROGLYPH R015;Lo;0;L;;;;;N;;;;;
+132C2;EGYPTIAN HIEROGLYPH R016;Lo;0;L;;;;;N;;;;;
+132C3;EGYPTIAN HIEROGLYPH R016A;Lo;0;L;;;;;N;;;;;
+132C4;EGYPTIAN HIEROGLYPH R017;Lo;0;L;;;;;N;;;;;
+132C5;EGYPTIAN HIEROGLYPH R018;Lo;0;L;;;;;N;;;;;
+132C6;EGYPTIAN HIEROGLYPH R019;Lo;0;L;;;;;N;;;;;
+132C7;EGYPTIAN HIEROGLYPH R020;Lo;0;L;;;;;N;;;;;
+132C8;EGYPTIAN HIEROGLYPH R021;Lo;0;L;;;;;N;;;;;
+132C9;EGYPTIAN HIEROGLYPH R022;Lo;0;L;;;;;N;;;;;
+132CA;EGYPTIAN HIEROGLYPH R023;Lo;0;L;;;;;N;;;;;
+132CB;EGYPTIAN HIEROGLYPH R024;Lo;0;L;;;;;N;;;;;
+132CC;EGYPTIAN HIEROGLYPH R025;Lo;0;L;;;;;N;;;;;
+132CD;EGYPTIAN HIEROGLYPH R026;Lo;0;L;;;;;N;;;;;
+132CE;EGYPTIAN HIEROGLYPH R027;Lo;0;L;;;;;N;;;;;
+132CF;EGYPTIAN HIEROGLYPH R028;Lo;0;L;;;;;N;;;;;
+132D0;EGYPTIAN HIEROGLYPH R029;Lo;0;L;;;;;N;;;;;
+132D1;EGYPTIAN HIEROGLYPH S001;Lo;0;L;;;;;N;;;;;
+132D2;EGYPTIAN HIEROGLYPH S002;Lo;0;L;;;;;N;;;;;
+132D3;EGYPTIAN HIEROGLYPH S002A;Lo;0;L;;;;;N;;;;;
+132D4;EGYPTIAN HIEROGLYPH S003;Lo;0;L;;;;;N;;;;;
+132D5;EGYPTIAN HIEROGLYPH S004;Lo;0;L;;;;;N;;;;;
+132D6;EGYPTIAN HIEROGLYPH S005;Lo;0;L;;;;;N;;;;;
+132D7;EGYPTIAN HIEROGLYPH S006;Lo;0;L;;;;;N;;;;;
+132D8;EGYPTIAN HIEROGLYPH S006A;Lo;0;L;;;;;N;;;;;
+132D9;EGYPTIAN HIEROGLYPH S007;Lo;0;L;;;;;N;;;;;
+132DA;EGYPTIAN HIEROGLYPH S008;Lo;0;L;;;;;N;;;;;
+132DB;EGYPTIAN HIEROGLYPH S009;Lo;0;L;;;;;N;;;;;
+132DC;EGYPTIAN HIEROGLYPH S010;Lo;0;L;;;;;N;;;;;
+132DD;EGYPTIAN HIEROGLYPH S011;Lo;0;L;;;;;N;;;;;
+132DE;EGYPTIAN HIEROGLYPH S012;Lo;0;L;;;;;N;;;;;
+132DF;EGYPTIAN HIEROGLYPH S013;Lo;0;L;;;;;N;;;;;
+132E0;EGYPTIAN HIEROGLYPH S014;Lo;0;L;;;;;N;;;;;
+132E1;EGYPTIAN HIEROGLYPH S014A;Lo;0;L;;;;;N;;;;;
+132E2;EGYPTIAN HIEROGLYPH S014B;Lo;0;L;;;;;N;;;;;
+132E3;EGYPTIAN HIEROGLYPH S015;Lo;0;L;;;;;N;;;;;
+132E4;EGYPTIAN HIEROGLYPH S016;Lo;0;L;;;;;N;;;;;
+132E5;EGYPTIAN HIEROGLYPH S017;Lo;0;L;;;;;N;;;;;
+132E6;EGYPTIAN HIEROGLYPH S017A;Lo;0;L;;;;;N;;;;;
+132E7;EGYPTIAN HIEROGLYPH S018;Lo;0;L;;;;;N;;;;;
+132E8;EGYPTIAN HIEROGLYPH S019;Lo;0;L;;;;;N;;;;;
+132E9;EGYPTIAN HIEROGLYPH S020;Lo;0;L;;;;;N;;;;;
+132EA;EGYPTIAN HIEROGLYPH S021;Lo;0;L;;;;;N;;;;;
+132EB;EGYPTIAN HIEROGLYPH S022;Lo;0;L;;;;;N;;;;;
+132EC;EGYPTIAN HIEROGLYPH S023;Lo;0;L;;;;;N;;;;;
+132ED;EGYPTIAN HIEROGLYPH S024;Lo;0;L;;;;;N;;;;;
+132EE;EGYPTIAN HIEROGLYPH S025;Lo;0;L;;;;;N;;;;;
+132EF;EGYPTIAN HIEROGLYPH S026;Lo;0;L;;;;;N;;;;;
+132F0;EGYPTIAN HIEROGLYPH S026A;Lo;0;L;;;;;N;;;;;
+132F1;EGYPTIAN HIEROGLYPH S026B;Lo;0;L;;;;;N;;;;;
+132F2;EGYPTIAN HIEROGLYPH S027;Lo;0;L;;;;;N;;;;;
+132F3;EGYPTIAN HIEROGLYPH S028;Lo;0;L;;;;;N;;;;;
+132F4;EGYPTIAN HIEROGLYPH S029;Lo;0;L;;;;;N;;;;;
+132F5;EGYPTIAN HIEROGLYPH S030;Lo;0;L;;;;;N;;;;;
+132F6;EGYPTIAN HIEROGLYPH S031;Lo;0;L;;;;;N;;;;;
+132F7;EGYPTIAN HIEROGLYPH S032;Lo;0;L;;;;;N;;;;;
+132F8;EGYPTIAN HIEROGLYPH S033;Lo;0;L;;;;;N;;;;;
+132F9;EGYPTIAN HIEROGLYPH S034;Lo;0;L;;;;;N;;;;;
+132FA;EGYPTIAN HIEROGLYPH S035;Lo;0;L;;;;;N;;;;;
+132FB;EGYPTIAN HIEROGLYPH S035A;Lo;0;L;;;;;N;;;;;
+132FC;EGYPTIAN HIEROGLYPH S036;Lo;0;L;;;;;N;;;;;
+132FD;EGYPTIAN HIEROGLYPH S037;Lo;0;L;;;;;N;;;;;
+132FE;EGYPTIAN HIEROGLYPH S038;Lo;0;L;;;;;N;;;;;
+132FF;EGYPTIAN HIEROGLYPH S039;Lo;0;L;;;;;N;;;;;
+13300;EGYPTIAN HIEROGLYPH S040;Lo;0;L;;;;;N;;;;;
+13301;EGYPTIAN HIEROGLYPH S041;Lo;0;L;;;;;N;;;;;
+13302;EGYPTIAN HIEROGLYPH S042;Lo;0;L;;;;;N;;;;;
+13303;EGYPTIAN HIEROGLYPH S043;Lo;0;L;;;;;N;;;;;
+13304;EGYPTIAN HIEROGLYPH S044;Lo;0;L;;;;;N;;;;;
+13305;EGYPTIAN HIEROGLYPH S045;Lo;0;L;;;;;N;;;;;
+13306;EGYPTIAN HIEROGLYPH S046;Lo;0;L;;;;;N;;;;;
+13307;EGYPTIAN HIEROGLYPH T001;Lo;0;L;;;;;N;;;;;
+13308;EGYPTIAN HIEROGLYPH T002;Lo;0;L;;;;;N;;;;;
+13309;EGYPTIAN HIEROGLYPH T003;Lo;0;L;;;;;N;;;;;
+1330A;EGYPTIAN HIEROGLYPH T003A;Lo;0;L;;;;;N;;;;;
+1330B;EGYPTIAN HIEROGLYPH T004;Lo;0;L;;;;;N;;;;;
+1330C;EGYPTIAN HIEROGLYPH T005;Lo;0;L;;;;;N;;;;;
+1330D;EGYPTIAN HIEROGLYPH T006;Lo;0;L;;;;;N;;;;;
+1330E;EGYPTIAN HIEROGLYPH T007;Lo;0;L;;;;;N;;;;;
+1330F;EGYPTIAN HIEROGLYPH T007A;Lo;0;L;;;;;N;;;;;
+13310;EGYPTIAN HIEROGLYPH T008;Lo;0;L;;;;;N;;;;;
+13311;EGYPTIAN HIEROGLYPH T008A;Lo;0;L;;;;;N;;;;;
+13312;EGYPTIAN HIEROGLYPH T009;Lo;0;L;;;;;N;;;;;
+13313;EGYPTIAN HIEROGLYPH T009A;Lo;0;L;;;;;N;;;;;
+13314;EGYPTIAN HIEROGLYPH T010;Lo;0;L;;;;;N;;;;;
+13315;EGYPTIAN HIEROGLYPH T011;Lo;0;L;;;;;N;;;;;
+13316;EGYPTIAN HIEROGLYPH T011A;Lo;0;L;;;;;N;;;;;
+13317;EGYPTIAN HIEROGLYPH T012;Lo;0;L;;;;;N;;;;;
+13318;EGYPTIAN HIEROGLYPH T013;Lo;0;L;;;;;N;;;;;
+13319;EGYPTIAN HIEROGLYPH T014;Lo;0;L;;;;;N;;;;;
+1331A;EGYPTIAN HIEROGLYPH T015;Lo;0;L;;;;;N;;;;;
+1331B;EGYPTIAN HIEROGLYPH T016;Lo;0;L;;;;;N;;;;;
+1331C;EGYPTIAN HIEROGLYPH T016A;Lo;0;L;;;;;N;;;;;
+1331D;EGYPTIAN HIEROGLYPH T017;Lo;0;L;;;;;N;;;;;
+1331E;EGYPTIAN HIEROGLYPH T018;Lo;0;L;;;;;N;;;;;
+1331F;EGYPTIAN HIEROGLYPH T019;Lo;0;L;;;;;N;;;;;
+13320;EGYPTIAN HIEROGLYPH T020;Lo;0;L;;;;;N;;;;;
+13321;EGYPTIAN HIEROGLYPH T021;Lo;0;L;;;;;N;;;;;
+13322;EGYPTIAN HIEROGLYPH T022;Lo;0;L;;;;;N;;;;;
+13323;EGYPTIAN HIEROGLYPH T023;Lo;0;L;;;;;N;;;;;
+13324;EGYPTIAN HIEROGLYPH T024;Lo;0;L;;;;;N;;;;;
+13325;EGYPTIAN HIEROGLYPH T025;Lo;0;L;;;;;N;;;;;
+13326;EGYPTIAN HIEROGLYPH T026;Lo;0;L;;;;;N;;;;;
+13327;EGYPTIAN HIEROGLYPH T027;Lo;0;L;;;;;N;;;;;
+13328;EGYPTIAN HIEROGLYPH T028;Lo;0;L;;;;;N;;;;;
+13329;EGYPTIAN HIEROGLYPH T029;Lo;0;L;;;;;N;;;;;
+1332A;EGYPTIAN HIEROGLYPH T030;Lo;0;L;;;;;N;;;;;
+1332B;EGYPTIAN HIEROGLYPH T031;Lo;0;L;;;;;N;;;;;
+1332C;EGYPTIAN HIEROGLYPH T032;Lo;0;L;;;;;N;;;;;
+1332D;EGYPTIAN HIEROGLYPH T032A;Lo;0;L;;;;;N;;;;;
+1332E;EGYPTIAN HIEROGLYPH T033;Lo;0;L;;;;;N;;;;;
+1332F;EGYPTIAN HIEROGLYPH T033A;Lo;0;L;;;;;N;;;;;
+13330;EGYPTIAN HIEROGLYPH T034;Lo;0;L;;;;;N;;;;;
+13331;EGYPTIAN HIEROGLYPH T035;Lo;0;L;;;;;N;;;;;
+13332;EGYPTIAN HIEROGLYPH T036;Lo;0;L;;;;;N;;;;;
+13333;EGYPTIAN HIEROGLYPH U001;Lo;0;L;;;;;N;;;;;
+13334;EGYPTIAN HIEROGLYPH U002;Lo;0;L;;;;;N;;;;;
+13335;EGYPTIAN HIEROGLYPH U003;Lo;0;L;;;;;N;;;;;
+13336;EGYPTIAN HIEROGLYPH U004;Lo;0;L;;;;;N;;;;;
+13337;EGYPTIAN HIEROGLYPH U005;Lo;0;L;;;;;N;;;;;
+13338;EGYPTIAN HIEROGLYPH U006;Lo;0;L;;;;;N;;;;;
+13339;EGYPTIAN HIEROGLYPH U006A;Lo;0;L;;;;;N;;;;;
+1333A;EGYPTIAN HIEROGLYPH U006B;Lo;0;L;;;;;N;;;;;
+1333B;EGYPTIAN HIEROGLYPH U007;Lo;0;L;;;;;N;;;;;
+1333C;EGYPTIAN HIEROGLYPH U008;Lo;0;L;;;;;N;;;;;
+1333D;EGYPTIAN HIEROGLYPH U009;Lo;0;L;;;;;N;;;;;
+1333E;EGYPTIAN HIEROGLYPH U010;Lo;0;L;;;;;N;;;;;
+1333F;EGYPTIAN HIEROGLYPH U011;Lo;0;L;;;;;N;;;;;
+13340;EGYPTIAN HIEROGLYPH U012;Lo;0;L;;;;;N;;;;;
+13341;EGYPTIAN HIEROGLYPH U013;Lo;0;L;;;;;N;;;;;
+13342;EGYPTIAN HIEROGLYPH U014;Lo;0;L;;;;;N;;;;;
+13343;EGYPTIAN HIEROGLYPH U015;Lo;0;L;;;;;N;;;;;
+13344;EGYPTIAN HIEROGLYPH U016;Lo;0;L;;;;;N;;;;;
+13345;EGYPTIAN HIEROGLYPH U017;Lo;0;L;;;;;N;;;;;
+13346;EGYPTIAN HIEROGLYPH U018;Lo;0;L;;;;;N;;;;;
+13347;EGYPTIAN HIEROGLYPH U019;Lo;0;L;;;;;N;;;;;
+13348;EGYPTIAN HIEROGLYPH U020;Lo;0;L;;;;;N;;;;;
+13349;EGYPTIAN HIEROGLYPH U021;Lo;0;L;;;;;N;;;;;
+1334A;EGYPTIAN HIEROGLYPH U022;Lo;0;L;;;;;N;;;;;
+1334B;EGYPTIAN HIEROGLYPH U023;Lo;0;L;;;;;N;;;;;
+1334C;EGYPTIAN HIEROGLYPH U023A;Lo;0;L;;;;;N;;;;;
+1334D;EGYPTIAN HIEROGLYPH U024;Lo;0;L;;;;;N;;;;;
+1334E;EGYPTIAN HIEROGLYPH U025;Lo;0;L;;;;;N;;;;;
+1334F;EGYPTIAN HIEROGLYPH U026;Lo;0;L;;;;;N;;;;;
+13350;EGYPTIAN HIEROGLYPH U027;Lo;0;L;;;;;N;;;;;
+13351;EGYPTIAN HIEROGLYPH U028;Lo;0;L;;;;;N;;;;;
+13352;EGYPTIAN HIEROGLYPH U029;Lo;0;L;;;;;N;;;;;
+13353;EGYPTIAN HIEROGLYPH U029A;Lo;0;L;;;;;N;;;;;
+13354;EGYPTIAN HIEROGLYPH U030;Lo;0;L;;;;;N;;;;;
+13355;EGYPTIAN HIEROGLYPH U031;Lo;0;L;;;;;N;;;;;
+13356;EGYPTIAN HIEROGLYPH U032;Lo;0;L;;;;;N;;;;;
+13357;EGYPTIAN HIEROGLYPH U032A;Lo;0;L;;;;;N;;;;;
+13358;EGYPTIAN HIEROGLYPH U033;Lo;0;L;;;;;N;;;;;
+13359;EGYPTIAN HIEROGLYPH U034;Lo;0;L;;;;;N;;;;;
+1335A;EGYPTIAN HIEROGLYPH U035;Lo;0;L;;;;;N;;;;;
+1335B;EGYPTIAN HIEROGLYPH U036;Lo;0;L;;;;;N;;;;;
+1335C;EGYPTIAN HIEROGLYPH U037;Lo;0;L;;;;;N;;;;;
+1335D;EGYPTIAN HIEROGLYPH U038;Lo;0;L;;;;;N;;;;;
+1335E;EGYPTIAN HIEROGLYPH U039;Lo;0;L;;;;;N;;;;;
+1335F;EGYPTIAN HIEROGLYPH U040;Lo;0;L;;;;;N;;;;;
+13360;EGYPTIAN HIEROGLYPH U041;Lo;0;L;;;;;N;;;;;
+13361;EGYPTIAN HIEROGLYPH U042;Lo;0;L;;;;;N;;;;;
+13362;EGYPTIAN HIEROGLYPH V001;Lo;0;L;;;;;N;;;;;
+13363;EGYPTIAN HIEROGLYPH V001A;Lo;0;L;;;;;N;;;;;
+13364;EGYPTIAN HIEROGLYPH V001B;Lo;0;L;;;;;N;;;;;
+13365;EGYPTIAN HIEROGLYPH V001C;Lo;0;L;;;;;N;;;;;
+13366;EGYPTIAN HIEROGLYPH V001D;Lo;0;L;;;;;N;;;;;
+13367;EGYPTIAN HIEROGLYPH V001E;Lo;0;L;;;;;N;;;;;
+13368;EGYPTIAN HIEROGLYPH V001F;Lo;0;L;;;;;N;;;;;
+13369;EGYPTIAN HIEROGLYPH V001G;Lo;0;L;;;;;N;;;;;
+1336A;EGYPTIAN HIEROGLYPH V001H;Lo;0;L;;;;;N;;;;;
+1336B;EGYPTIAN HIEROGLYPH V001I;Lo;0;L;;;;;N;;;;;
+1336C;EGYPTIAN HIEROGLYPH V002;Lo;0;L;;;;;N;;;;;
+1336D;EGYPTIAN HIEROGLYPH V002A;Lo;0;L;;;;;N;;;;;
+1336E;EGYPTIAN HIEROGLYPH V003;Lo;0;L;;;;;N;;;;;
+1336F;EGYPTIAN HIEROGLYPH V004;Lo;0;L;;;;;N;;;;;
+13370;EGYPTIAN HIEROGLYPH V005;Lo;0;L;;;;;N;;;;;
+13371;EGYPTIAN HIEROGLYPH V006;Lo;0;L;;;;;N;;;;;
+13372;EGYPTIAN HIEROGLYPH V007;Lo;0;L;;;;;N;;;;;
+13373;EGYPTIAN HIEROGLYPH V007A;Lo;0;L;;;;;N;;;;;
+13374;EGYPTIAN HIEROGLYPH V007B;Lo;0;L;;;;;N;;;;;
+13375;EGYPTIAN HIEROGLYPH V008;Lo;0;L;;;;;N;;;;;
+13376;EGYPTIAN HIEROGLYPH V009;Lo;0;L;;;;;N;;;;;
+13377;EGYPTIAN HIEROGLYPH V010;Lo;0;L;;;;;N;;;;;
+13378;EGYPTIAN HIEROGLYPH V011;Lo;0;L;;;;;N;;;;;
+13379;EGYPTIAN HIEROGLYPH V011A;Lo;0;L;;;;;N;;;;;
+1337A;EGYPTIAN HIEROGLYPH V011B;Lo;0;L;;;;;N;;;;;
+1337B;EGYPTIAN HIEROGLYPH V011C;Lo;0;L;;;;;N;;;;;
+1337C;EGYPTIAN HIEROGLYPH V012;Lo;0;L;;;;;N;;;;;
+1337D;EGYPTIAN HIEROGLYPH V012A;Lo;0;L;;;;;N;;;;;
+1337E;EGYPTIAN HIEROGLYPH V012B;Lo;0;L;;;;;N;;;;;
+1337F;EGYPTIAN HIEROGLYPH V013;Lo;0;L;;;;;N;;;;;
+13380;EGYPTIAN HIEROGLYPH V014;Lo;0;L;;;;;N;;;;;
+13381;EGYPTIAN HIEROGLYPH V015;Lo;0;L;;;;;N;;;;;
+13382;EGYPTIAN HIEROGLYPH V016;Lo;0;L;;;;;N;;;;;
+13383;EGYPTIAN HIEROGLYPH V017;Lo;0;L;;;;;N;;;;;
+13384;EGYPTIAN HIEROGLYPH V018;Lo;0;L;;;;;N;;;;;
+13385;EGYPTIAN HIEROGLYPH V019;Lo;0;L;;;;;N;;;;;
+13386;EGYPTIAN HIEROGLYPH V020;Lo;0;L;;;;;N;;;;;
+13387;EGYPTIAN HIEROGLYPH V020A;Lo;0;L;;;;;N;;;;;
+13388;EGYPTIAN HIEROGLYPH V020B;Lo;0;L;;;;;N;;;;;
+13389;EGYPTIAN HIEROGLYPH V020C;Lo;0;L;;;;;N;;;;;
+1338A;EGYPTIAN HIEROGLYPH V020D;Lo;0;L;;;;;N;;;;;
+1338B;EGYPTIAN HIEROGLYPH V020E;Lo;0;L;;;;;N;;;;;
+1338C;EGYPTIAN HIEROGLYPH V020F;Lo;0;L;;;;;N;;;;;
+1338D;EGYPTIAN HIEROGLYPH V020G;Lo;0;L;;;;;N;;;;;
+1338E;EGYPTIAN HIEROGLYPH V020H;Lo;0;L;;;;;N;;;;;
+1338F;EGYPTIAN HIEROGLYPH V020I;Lo;0;L;;;;;N;;;;;
+13390;EGYPTIAN HIEROGLYPH V020J;Lo;0;L;;;;;N;;;;;
+13391;EGYPTIAN HIEROGLYPH V020K;Lo;0;L;;;;;N;;;;;
+13392;EGYPTIAN HIEROGLYPH V020L;Lo;0;L;;;;;N;;;;;
+13393;EGYPTIAN HIEROGLYPH V021;Lo;0;L;;;;;N;;;;;
+13394;EGYPTIAN HIEROGLYPH V022;Lo;0;L;;;;;N;;;;;
+13395;EGYPTIAN HIEROGLYPH V023;Lo;0;L;;;;;N;;;;;
+13396;EGYPTIAN HIEROGLYPH V023A;Lo;0;L;;;;;N;;;;;
+13397;EGYPTIAN HIEROGLYPH V024;Lo;0;L;;;;;N;;;;;
+13398;EGYPTIAN HIEROGLYPH V025;Lo;0;L;;;;;N;;;;;
+13399;EGYPTIAN HIEROGLYPH V026;Lo;0;L;;;;;N;;;;;
+1339A;EGYPTIAN HIEROGLYPH V027;Lo;0;L;;;;;N;;;;;
+1339B;EGYPTIAN HIEROGLYPH V028;Lo;0;L;;;;;N;;;;;
+1339C;EGYPTIAN HIEROGLYPH V028A;Lo;0;L;;;;;N;;;;;
+1339D;EGYPTIAN HIEROGLYPH V029;Lo;0;L;;;;;N;;;;;
+1339E;EGYPTIAN HIEROGLYPH V029A;Lo;0;L;;;;;N;;;;;
+1339F;EGYPTIAN HIEROGLYPH V030;Lo;0;L;;;;;N;;;;;
+133A0;EGYPTIAN HIEROGLYPH V030A;Lo;0;L;;;;;N;;;;;
+133A1;EGYPTIAN HIEROGLYPH V031;Lo;0;L;;;;;N;;;;;
+133A2;EGYPTIAN HIEROGLYPH V031A;Lo;0;L;;;;;N;;;;;
+133A3;EGYPTIAN HIEROGLYPH V032;Lo;0;L;;;;;N;;;;;
+133A4;EGYPTIAN HIEROGLYPH V033;Lo;0;L;;;;;N;;;;;
+133A5;EGYPTIAN HIEROGLYPH V033A;Lo;0;L;;;;;N;;;;;
+133A6;EGYPTIAN HIEROGLYPH V034;Lo;0;L;;;;;N;;;;;
+133A7;EGYPTIAN HIEROGLYPH V035;Lo;0;L;;;;;N;;;;;
+133A8;EGYPTIAN HIEROGLYPH V036;Lo;0;L;;;;;N;;;;;
+133A9;EGYPTIAN HIEROGLYPH V037;Lo;0;L;;;;;N;;;;;
+133AA;EGYPTIAN HIEROGLYPH V037A;Lo;0;L;;;;;N;;;;;
+133AB;EGYPTIAN HIEROGLYPH V038;Lo;0;L;;;;;N;;;;;
+133AC;EGYPTIAN HIEROGLYPH V039;Lo;0;L;;;;;N;;;;;
+133AD;EGYPTIAN HIEROGLYPH V040;Lo;0;L;;;;;N;;;;;
+133AE;EGYPTIAN HIEROGLYPH V040A;Lo;0;L;;;;;N;;;;;
+133AF;EGYPTIAN HIEROGLYPH W001;Lo;0;L;;;;;N;;;;;
+133B0;EGYPTIAN HIEROGLYPH W002;Lo;0;L;;;;;N;;;;;
+133B1;EGYPTIAN HIEROGLYPH W003;Lo;0;L;;;;;N;;;;;
+133B2;EGYPTIAN HIEROGLYPH W003A;Lo;0;L;;;;;N;;;;;
+133B3;EGYPTIAN HIEROGLYPH W004;Lo;0;L;;;;;N;;;;;
+133B4;EGYPTIAN HIEROGLYPH W005;Lo;0;L;;;;;N;;;;;
+133B5;EGYPTIAN HIEROGLYPH W006;Lo;0;L;;;;;N;;;;;
+133B6;EGYPTIAN HIEROGLYPH W007;Lo;0;L;;;;;N;;;;;
+133B7;EGYPTIAN HIEROGLYPH W008;Lo;0;L;;;;;N;;;;;
+133B8;EGYPTIAN HIEROGLYPH W009;Lo;0;L;;;;;N;;;;;
+133B9;EGYPTIAN HIEROGLYPH W009A;Lo;0;L;;;;;N;;;;;
+133BA;EGYPTIAN HIEROGLYPH W010;Lo;0;L;;;;;N;;;;;
+133BB;EGYPTIAN HIEROGLYPH W010A;Lo;0;L;;;;;N;;;;;
+133BC;EGYPTIAN HIEROGLYPH W011;Lo;0;L;;;;;N;;;;;
+133BD;EGYPTIAN HIEROGLYPH W012;Lo;0;L;;;;;N;;;;;
+133BE;EGYPTIAN HIEROGLYPH W013;Lo;0;L;;;;;N;;;;;
+133BF;EGYPTIAN HIEROGLYPH W014;Lo;0;L;;;;;N;;;;;
+133C0;EGYPTIAN HIEROGLYPH W014A;Lo;0;L;;;;;N;;;;;
+133C1;EGYPTIAN HIEROGLYPH W015;Lo;0;L;;;;;N;;;;;
+133C2;EGYPTIAN HIEROGLYPH W016;Lo;0;L;;;;;N;;;;;
+133C3;EGYPTIAN HIEROGLYPH W017;Lo;0;L;;;;;N;;;;;
+133C4;EGYPTIAN HIEROGLYPH W017A;Lo;0;L;;;;;N;;;;;
+133C5;EGYPTIAN HIEROGLYPH W018;Lo;0;L;;;;;N;;;;;
+133C6;EGYPTIAN HIEROGLYPH W018A;Lo;0;L;;;;;N;;;;;
+133C7;EGYPTIAN HIEROGLYPH W019;Lo;0;L;;;;;N;;;;;
+133C8;EGYPTIAN HIEROGLYPH W020;Lo;0;L;;;;;N;;;;;
+133C9;EGYPTIAN HIEROGLYPH W021;Lo;0;L;;;;;N;;;;;
+133CA;EGYPTIAN HIEROGLYPH W022;Lo;0;L;;;;;N;;;;;
+133CB;EGYPTIAN HIEROGLYPH W023;Lo;0;L;;;;;N;;;;;
+133CC;EGYPTIAN HIEROGLYPH W024;Lo;0;L;;;;;N;;;;;
+133CD;EGYPTIAN HIEROGLYPH W024A;Lo;0;L;;;;;N;;;;;
+133CE;EGYPTIAN HIEROGLYPH W025;Lo;0;L;;;;;N;;;;;
+133CF;EGYPTIAN HIEROGLYPH X001;Lo;0;L;;;;;N;;;;;
+133D0;EGYPTIAN HIEROGLYPH X002;Lo;0;L;;;;;N;;;;;
+133D1;EGYPTIAN HIEROGLYPH X003;Lo;0;L;;;;;N;;;;;
+133D2;EGYPTIAN HIEROGLYPH X004;Lo;0;L;;;;;N;;;;;
+133D3;EGYPTIAN HIEROGLYPH X004A;Lo;0;L;;;;;N;;;;;
+133D4;EGYPTIAN HIEROGLYPH X004B;Lo;0;L;;;;;N;;;;;
+133D5;EGYPTIAN HIEROGLYPH X005;Lo;0;L;;;;;N;;;;;
+133D6;EGYPTIAN HIEROGLYPH X006;Lo;0;L;;;;;N;;;;;
+133D7;EGYPTIAN HIEROGLYPH X006A;Lo;0;L;;;;;N;;;;;
+133D8;EGYPTIAN HIEROGLYPH X007;Lo;0;L;;;;;N;;;;;
+133D9;EGYPTIAN HIEROGLYPH X008;Lo;0;L;;;;;N;;;;;
+133DA;EGYPTIAN HIEROGLYPH X008A;Lo;0;L;;;;;N;;;;;
+133DB;EGYPTIAN HIEROGLYPH Y001;Lo;0;L;;;;;N;;;;;
+133DC;EGYPTIAN HIEROGLYPH Y001A;Lo;0;L;;;;;N;;;;;
+133DD;EGYPTIAN HIEROGLYPH Y002;Lo;0;L;;;;;N;;;;;
+133DE;EGYPTIAN HIEROGLYPH Y003;Lo;0;L;;;;;N;;;;;
+133DF;EGYPTIAN HIEROGLYPH Y004;Lo;0;L;;;;;N;;;;;
+133E0;EGYPTIAN HIEROGLYPH Y005;Lo;0;L;;;;;N;;;;;
+133E1;EGYPTIAN HIEROGLYPH Y006;Lo;0;L;;;;;N;;;;;
+133E2;EGYPTIAN HIEROGLYPH Y007;Lo;0;L;;;;;N;;;;;
+133E3;EGYPTIAN HIEROGLYPH Y008;Lo;0;L;;;;;N;;;;;
+133E4;EGYPTIAN HIEROGLYPH Z001;Lo;0;L;;;;;N;;;;;
+133E5;EGYPTIAN HIEROGLYPH Z002;Lo;0;L;;;;;N;;;;;
+133E6;EGYPTIAN HIEROGLYPH Z002A;Lo;0;L;;;;;N;;;;;
+133E7;EGYPTIAN HIEROGLYPH Z002B;Lo;0;L;;;;;N;;;;;
+133E8;EGYPTIAN HIEROGLYPH Z002C;Lo;0;L;;;;;N;;;;;
+133E9;EGYPTIAN HIEROGLYPH Z002D;Lo;0;L;;;;;N;;;;;
+133EA;EGYPTIAN HIEROGLYPH Z003;Lo;0;L;;;;;N;;;;;
+133EB;EGYPTIAN HIEROGLYPH Z003A;Lo;0;L;;;;;N;;;;;
+133EC;EGYPTIAN HIEROGLYPH Z003B;Lo;0;L;;;;;N;;;;;
+133ED;EGYPTIAN HIEROGLYPH Z004;Lo;0;L;;;;;N;;;;;
+133EE;EGYPTIAN HIEROGLYPH Z004A;Lo;0;L;;;;;N;;;;;
+133EF;EGYPTIAN HIEROGLYPH Z005;Lo;0;L;;;;;N;;;;;
+133F0;EGYPTIAN HIEROGLYPH Z005A;Lo;0;L;;;;;N;;;;;
+133F1;EGYPTIAN HIEROGLYPH Z006;Lo;0;L;;;;;N;;;;;
+133F2;EGYPTIAN HIEROGLYPH Z007;Lo;0;L;;;;;N;;;;;
+133F3;EGYPTIAN HIEROGLYPH Z008;Lo;0;L;;;;;N;;;;;
+133F4;EGYPTIAN HIEROGLYPH Z009;Lo;0;L;;;;;N;;;;;
+133F5;EGYPTIAN HIEROGLYPH Z010;Lo;0;L;;;;;N;;;;;
+133F6;EGYPTIAN HIEROGLYPH Z011;Lo;0;L;;;;;N;;;;;
+133F7;EGYPTIAN HIEROGLYPH Z012;Lo;0;L;;;;;N;;;;;
+133F8;EGYPTIAN HIEROGLYPH Z013;Lo;0;L;;;;;N;;;;;
+133F9;EGYPTIAN HIEROGLYPH Z014;Lo;0;L;;;;;N;;;;;
+133FA;EGYPTIAN HIEROGLYPH Z015;Lo;0;L;;;;;N;;;;;
+133FB;EGYPTIAN HIEROGLYPH Z015A;Lo;0;L;;;;;N;;;;;
+133FC;EGYPTIAN HIEROGLYPH Z015B;Lo;0;L;;;;;N;;;;;
+133FD;EGYPTIAN HIEROGLYPH Z015C;Lo;0;L;;;;;N;;;;;
+133FE;EGYPTIAN HIEROGLYPH Z015D;Lo;0;L;;;;;N;;;;;
+133FF;EGYPTIAN HIEROGLYPH Z015E;Lo;0;L;;;;;N;;;;;
+13400;EGYPTIAN HIEROGLYPH Z015F;Lo;0;L;;;;;N;;;;;
+13401;EGYPTIAN HIEROGLYPH Z015G;Lo;0;L;;;;;N;;;;;
+13402;EGYPTIAN HIEROGLYPH Z015H;Lo;0;L;;;;;N;;;;;
+13403;EGYPTIAN HIEROGLYPH Z015I;Lo;0;L;;;;;N;;;;;
+13404;EGYPTIAN HIEROGLYPH Z016;Lo;0;L;;;;;N;;;;;
+13405;EGYPTIAN HIEROGLYPH Z016A;Lo;0;L;;;;;N;;;;;
+13406;EGYPTIAN HIEROGLYPH Z016B;Lo;0;L;;;;;N;;;;;
+13407;EGYPTIAN HIEROGLYPH Z016C;Lo;0;L;;;;;N;;;;;
+13408;EGYPTIAN HIEROGLYPH Z016D;Lo;0;L;;;;;N;;;;;
+13409;EGYPTIAN HIEROGLYPH Z016E;Lo;0;L;;;;;N;;;;;
+1340A;EGYPTIAN HIEROGLYPH Z016F;Lo;0;L;;;;;N;;;;;
+1340B;EGYPTIAN HIEROGLYPH Z016G;Lo;0;L;;;;;N;;;;;
+1340C;EGYPTIAN HIEROGLYPH Z016H;Lo;0;L;;;;;N;;;;;
+1340D;EGYPTIAN HIEROGLYPH AA001;Lo;0;L;;;;;N;;;;;
+1340E;EGYPTIAN HIEROGLYPH AA002;Lo;0;L;;;;;N;;;;;
+1340F;EGYPTIAN HIEROGLYPH AA003;Lo;0;L;;;;;N;;;;;
+13410;EGYPTIAN HIEROGLYPH AA004;Lo;0;L;;;;;N;;;;;
+13411;EGYPTIAN HIEROGLYPH AA005;Lo;0;L;;;;;N;;;;;
+13412;EGYPTIAN HIEROGLYPH AA006;Lo;0;L;;;;;N;;;;;
+13413;EGYPTIAN HIEROGLYPH AA007;Lo;0;L;;;;;N;;;;;
+13414;EGYPTIAN HIEROGLYPH AA007A;Lo;0;L;;;;;N;;;;;
+13415;EGYPTIAN HIEROGLYPH AA007B;Lo;0;L;;;;;N;;;;;
+13416;EGYPTIAN HIEROGLYPH AA008;Lo;0;L;;;;;N;;;;;
+13417;EGYPTIAN HIEROGLYPH AA009;Lo;0;L;;;;;N;;;;;
+13418;EGYPTIAN HIEROGLYPH AA010;Lo;0;L;;;;;N;;;;;
+13419;EGYPTIAN HIEROGLYPH AA011;Lo;0;L;;;;;N;;;;;
+1341A;EGYPTIAN HIEROGLYPH AA012;Lo;0;L;;;;;N;;;;;
+1341B;EGYPTIAN HIEROGLYPH AA013;Lo;0;L;;;;;N;;;;;
+1341C;EGYPTIAN HIEROGLYPH AA014;Lo;0;L;;;;;N;;;;;
+1341D;EGYPTIAN HIEROGLYPH AA015;Lo;0;L;;;;;N;;;;;
+1341E;EGYPTIAN HIEROGLYPH AA016;Lo;0;L;;;;;N;;;;;
+1341F;EGYPTIAN HIEROGLYPH AA017;Lo;0;L;;;;;N;;;;;
+13420;EGYPTIAN HIEROGLYPH AA018;Lo;0;L;;;;;N;;;;;
+13421;EGYPTIAN HIEROGLYPH AA019;Lo;0;L;;;;;N;;;;;
+13422;EGYPTIAN HIEROGLYPH AA020;Lo;0;L;;;;;N;;;;;
+13423;EGYPTIAN HIEROGLYPH AA021;Lo;0;L;;;;;N;;;;;
+13424;EGYPTIAN HIEROGLYPH AA022;Lo;0;L;;;;;N;;;;;
+13425;EGYPTIAN HIEROGLYPH AA023;Lo;0;L;;;;;N;;;;;
+13426;EGYPTIAN HIEROGLYPH AA024;Lo;0;L;;;;;N;;;;;
+13427;EGYPTIAN HIEROGLYPH AA025;Lo;0;L;;;;;N;;;;;
+13428;EGYPTIAN HIEROGLYPH AA026;Lo;0;L;;;;;N;;;;;
+13429;EGYPTIAN HIEROGLYPH AA027;Lo;0;L;;;;;N;;;;;
+1342A;EGYPTIAN HIEROGLYPH AA028;Lo;0;L;;;;;N;;;;;
+1342B;EGYPTIAN HIEROGLYPH AA029;Lo;0;L;;;;;N;;;;;
+1342C;EGYPTIAN HIEROGLYPH AA030;Lo;0;L;;;;;N;;;;;
+1342D;EGYPTIAN HIEROGLYPH AA031;Lo;0;L;;;;;N;;;;;
+1342E;EGYPTIAN HIEROGLYPH AA032;Lo;0;L;;;;;N;;;;;
+14400;ANATOLIAN HIEROGLYPH A001;Lo;0;L;;;;;N;;;;;
+14401;ANATOLIAN HIEROGLYPH A002;Lo;0;L;;;;;N;;;;;
+14402;ANATOLIAN HIEROGLYPH A003;Lo;0;L;;;;;N;;;;;
+14403;ANATOLIAN HIEROGLYPH A004;Lo;0;L;;;;;N;;;;;
+14404;ANATOLIAN HIEROGLYPH A005;Lo;0;L;;;;;N;;;;;
+14405;ANATOLIAN HIEROGLYPH A006;Lo;0;L;;;;;N;;;;;
+14406;ANATOLIAN HIEROGLYPH A007;Lo;0;L;;;;;N;;;;;
+14407;ANATOLIAN HIEROGLYPH A008;Lo;0;L;;;;;N;;;;;
+14408;ANATOLIAN HIEROGLYPH A009;Lo;0;L;;;;;N;;;;;
+14409;ANATOLIAN HIEROGLYPH A010;Lo;0;L;;;;;N;;;;;
+1440A;ANATOLIAN HIEROGLYPH A010A;Lo;0;L;;;;;N;;;;;
+1440B;ANATOLIAN HIEROGLYPH A011;Lo;0;L;;;;;N;;;;;
+1440C;ANATOLIAN HIEROGLYPH A012;Lo;0;L;;;;;N;;;;;
+1440D;ANATOLIAN HIEROGLYPH A013;Lo;0;L;;;;;N;;;;;
+1440E;ANATOLIAN HIEROGLYPH A014;Lo;0;L;;;;;N;;;;;
+1440F;ANATOLIAN HIEROGLYPH A015;Lo;0;L;;;;;N;;;;;
+14410;ANATOLIAN HIEROGLYPH A016;Lo;0;L;;;;;N;;;;;
+14411;ANATOLIAN HIEROGLYPH A017;Lo;0;L;;;;;N;;;;;
+14412;ANATOLIAN HIEROGLYPH A018;Lo;0;L;;;;;N;;;;;
+14413;ANATOLIAN HIEROGLYPH A019;Lo;0;L;;;;;N;;;;;
+14414;ANATOLIAN HIEROGLYPH A020;Lo;0;L;;;;;N;;;;;
+14415;ANATOLIAN HIEROGLYPH A021;Lo;0;L;;;;;N;;;;;
+14416;ANATOLIAN HIEROGLYPH A022;Lo;0;L;;;;;N;;;;;
+14417;ANATOLIAN HIEROGLYPH A023;Lo;0;L;;;;;N;;;;;
+14418;ANATOLIAN HIEROGLYPH A024;Lo;0;L;;;;;N;;;;;
+14419;ANATOLIAN HIEROGLYPH A025;Lo;0;L;;;;;N;;;;;
+1441A;ANATOLIAN HIEROGLYPH A026;Lo;0;L;;;;;N;;;;;
+1441B;ANATOLIAN HIEROGLYPH A026A;Lo;0;L;;;;;N;;;;;
+1441C;ANATOLIAN HIEROGLYPH A027;Lo;0;L;;;;;N;;;;;
+1441D;ANATOLIAN HIEROGLYPH A028;Lo;0;L;;;;;N;;;;;
+1441E;ANATOLIAN HIEROGLYPH A029;Lo;0;L;;;;;N;;;;;
+1441F;ANATOLIAN HIEROGLYPH A030;Lo;0;L;;;;;N;;;;;
+14420;ANATOLIAN HIEROGLYPH A031;Lo;0;L;;;;;N;;;;;
+14421;ANATOLIAN HIEROGLYPH A032;Lo;0;L;;;;;N;;;;;
+14422;ANATOLIAN HIEROGLYPH A033;Lo;0;L;;;;;N;;;;;
+14423;ANATOLIAN HIEROGLYPH A034;Lo;0;L;;;;;N;;;;;
+14424;ANATOLIAN HIEROGLYPH A035;Lo;0;L;;;;;N;;;;;
+14425;ANATOLIAN HIEROGLYPH A036;Lo;0;L;;;;;N;;;;;
+14426;ANATOLIAN HIEROGLYPH A037;Lo;0;L;;;;;N;;;;;
+14427;ANATOLIAN HIEROGLYPH A038;Lo;0;L;;;;;N;;;;;
+14428;ANATOLIAN HIEROGLYPH A039;Lo;0;L;;;;;N;;;;;
+14429;ANATOLIAN HIEROGLYPH A039A;Lo;0;L;;;;;N;;;;;
+1442A;ANATOLIAN HIEROGLYPH A040;Lo;0;L;;;;;N;;;;;
+1442B;ANATOLIAN HIEROGLYPH A041;Lo;0;L;;;;;N;;;;;
+1442C;ANATOLIAN HIEROGLYPH A041A;Lo;0;L;;;;;N;;;;;
+1442D;ANATOLIAN HIEROGLYPH A042;Lo;0;L;;;;;N;;;;;
+1442E;ANATOLIAN HIEROGLYPH A043;Lo;0;L;;;;;N;;;;;
+1442F;ANATOLIAN HIEROGLYPH A044;Lo;0;L;;;;;N;;;;;
+14430;ANATOLIAN HIEROGLYPH A045;Lo;0;L;;;;;N;;;;;
+14431;ANATOLIAN HIEROGLYPH A045A;Lo;0;L;;;;;N;;;;;
+14432;ANATOLIAN HIEROGLYPH A046;Lo;0;L;;;;;N;;;;;
+14433;ANATOLIAN HIEROGLYPH A046A;Lo;0;L;;;;;N;;;;;
+14434;ANATOLIAN HIEROGLYPH A046B;Lo;0;L;;;;;N;;;;;
+14435;ANATOLIAN HIEROGLYPH A047;Lo;0;L;;;;;N;;;;;
+14436;ANATOLIAN HIEROGLYPH A048;Lo;0;L;;;;;N;;;;;
+14437;ANATOLIAN HIEROGLYPH A049;Lo;0;L;;;;;N;;;;;
+14438;ANATOLIAN HIEROGLYPH A050;Lo;0;L;;;;;N;;;;;
+14439;ANATOLIAN HIEROGLYPH A051;Lo;0;L;;;;;N;;;;;
+1443A;ANATOLIAN HIEROGLYPH A052;Lo;0;L;;;;;N;;;;;
+1443B;ANATOLIAN HIEROGLYPH A053;Lo;0;L;;;;;N;;;;;
+1443C;ANATOLIAN HIEROGLYPH A054;Lo;0;L;;;;;N;;;;;
+1443D;ANATOLIAN HIEROGLYPH A055;Lo;0;L;;;;;N;;;;;
+1443E;ANATOLIAN HIEROGLYPH A056;Lo;0;L;;;;;N;;;;;
+1443F;ANATOLIAN HIEROGLYPH A057;Lo;0;L;;;;;N;;;;;
+14440;ANATOLIAN HIEROGLYPH A058;Lo;0;L;;;;;N;;;;;
+14441;ANATOLIAN HIEROGLYPH A059;Lo;0;L;;;;;N;;;;;
+14442;ANATOLIAN HIEROGLYPH A060;Lo;0;L;;;;;N;;;;;
+14443;ANATOLIAN HIEROGLYPH A061;Lo;0;L;;;;;N;;;;;
+14444;ANATOLIAN HIEROGLYPH A062;Lo;0;L;;;;;N;;;;;
+14445;ANATOLIAN HIEROGLYPH A063;Lo;0;L;;;;;N;;;;;
+14446;ANATOLIAN HIEROGLYPH A064;Lo;0;L;;;;;N;;;;;
+14447;ANATOLIAN HIEROGLYPH A065;Lo;0;L;;;;;N;;;;;
+14448;ANATOLIAN HIEROGLYPH A066;Lo;0;L;;;;;N;;;;;
+14449;ANATOLIAN HIEROGLYPH A066A;Lo;0;L;;;;;N;;;;;
+1444A;ANATOLIAN HIEROGLYPH A066B;Lo;0;L;;;;;N;;;;;
+1444B;ANATOLIAN HIEROGLYPH A066C;Lo;0;L;;;;;N;;;;;
+1444C;ANATOLIAN HIEROGLYPH A067;Lo;0;L;;;;;N;;;;;
+1444D;ANATOLIAN HIEROGLYPH A068;Lo;0;L;;;;;N;;;;;
+1444E;ANATOLIAN HIEROGLYPH A069;Lo;0;L;;;;;N;;;;;
+1444F;ANATOLIAN HIEROGLYPH A070;Lo;0;L;;;;;N;;;;;
+14450;ANATOLIAN HIEROGLYPH A071;Lo;0;L;;;;;N;;;;;
+14451;ANATOLIAN HIEROGLYPH A072;Lo;0;L;;;;;N;;;;;
+14452;ANATOLIAN HIEROGLYPH A073;Lo;0;L;;;;;N;;;;;
+14453;ANATOLIAN HIEROGLYPH A074;Lo;0;L;;;;;N;;;;;
+14454;ANATOLIAN HIEROGLYPH A075;Lo;0;L;;;;;N;;;;;
+14455;ANATOLIAN HIEROGLYPH A076;Lo;0;L;;;;;N;;;;;
+14456;ANATOLIAN HIEROGLYPH A077;Lo;0;L;;;;;N;;;;;
+14457;ANATOLIAN HIEROGLYPH A078;Lo;0;L;;;;;N;;;;;
+14458;ANATOLIAN HIEROGLYPH A079;Lo;0;L;;;;;N;;;;;
+14459;ANATOLIAN HIEROGLYPH A080;Lo;0;L;;;;;N;;;;;
+1445A;ANATOLIAN HIEROGLYPH A081;Lo;0;L;;;;;N;;;;;
+1445B;ANATOLIAN HIEROGLYPH A082;Lo;0;L;;;;;N;;;;;
+1445C;ANATOLIAN HIEROGLYPH A083;Lo;0;L;;;;;N;;;;;
+1445D;ANATOLIAN HIEROGLYPH A084;Lo;0;L;;;;;N;;;;;
+1445E;ANATOLIAN HIEROGLYPH A085;Lo;0;L;;;;;N;;;;;
+1445F;ANATOLIAN HIEROGLYPH A086;Lo;0;L;;;;;N;;;;;
+14460;ANATOLIAN HIEROGLYPH A087;Lo;0;L;;;;;N;;;;;
+14461;ANATOLIAN HIEROGLYPH A088;Lo;0;L;;;;;N;;;;;
+14462;ANATOLIAN HIEROGLYPH A089;Lo;0;L;;;;;N;;;;;
+14463;ANATOLIAN HIEROGLYPH A090;Lo;0;L;;;;;N;;;;;
+14464;ANATOLIAN HIEROGLYPH A091;Lo;0;L;;;;;N;;;;;
+14465;ANATOLIAN HIEROGLYPH A092;Lo;0;L;;;;;N;;;;;
+14466;ANATOLIAN HIEROGLYPH A093;Lo;0;L;;;;;N;;;;;
+14467;ANATOLIAN HIEROGLYPH A094;Lo;0;L;;;;;N;;;;;
+14468;ANATOLIAN HIEROGLYPH A095;Lo;0;L;;;;;N;;;;;
+14469;ANATOLIAN HIEROGLYPH A096;Lo;0;L;;;;;N;;;;;
+1446A;ANATOLIAN HIEROGLYPH A097;Lo;0;L;;;;;N;;;;;
+1446B;ANATOLIAN HIEROGLYPH A097A;Lo;0;L;;;;;N;;;;;
+1446C;ANATOLIAN HIEROGLYPH A098;Lo;0;L;;;;;N;;;;;
+1446D;ANATOLIAN HIEROGLYPH A098A;Lo;0;L;;;;;N;;;;;
+1446E;ANATOLIAN HIEROGLYPH A099;Lo;0;L;;;;;N;;;;;
+1446F;ANATOLIAN HIEROGLYPH A100;Lo;0;L;;;;;N;;;;;
+14470;ANATOLIAN HIEROGLYPH A100A;Lo;0;L;;;;;N;;;;;
+14471;ANATOLIAN HIEROGLYPH A101;Lo;0;L;;;;;N;;;;;
+14472;ANATOLIAN HIEROGLYPH A101A;Lo;0;L;;;;;N;;;;;
+14473;ANATOLIAN HIEROGLYPH A102;Lo;0;L;;;;;N;;;;;
+14474;ANATOLIAN HIEROGLYPH A102A;Lo;0;L;;;;;N;;;;;
+14475;ANATOLIAN HIEROGLYPH A103;Lo;0;L;;;;;N;;;;;
+14476;ANATOLIAN HIEROGLYPH A104;Lo;0;L;;;;;N;;;;;
+14477;ANATOLIAN HIEROGLYPH A104A;Lo;0;L;;;;;N;;;;;
+14478;ANATOLIAN HIEROGLYPH A104B;Lo;0;L;;;;;N;;;;;
+14479;ANATOLIAN HIEROGLYPH A104C;Lo;0;L;;;;;N;;;;;
+1447A;ANATOLIAN HIEROGLYPH A105;Lo;0;L;;;;;N;;;;;
+1447B;ANATOLIAN HIEROGLYPH A105A;Lo;0;L;;;;;N;;;;;
+1447C;ANATOLIAN HIEROGLYPH A105B;Lo;0;L;;;;;N;;;;;
+1447D;ANATOLIAN HIEROGLYPH A106;Lo;0;L;;;;;N;;;;;
+1447E;ANATOLIAN HIEROGLYPH A107;Lo;0;L;;;;;N;;;;;
+1447F;ANATOLIAN HIEROGLYPH A107A;Lo;0;L;;;;;N;;;;;
+14480;ANATOLIAN HIEROGLYPH A107B;Lo;0;L;;;;;N;;;;;
+14481;ANATOLIAN HIEROGLYPH A107C;Lo;0;L;;;;;N;;;;;
+14482;ANATOLIAN HIEROGLYPH A108;Lo;0;L;;;;;N;;;;;
+14483;ANATOLIAN HIEROGLYPH A109;Lo;0;L;;;;;N;;;;;
+14484;ANATOLIAN HIEROGLYPH A110;Lo;0;L;;;;;N;;;;;
+14485;ANATOLIAN HIEROGLYPH A110A;Lo;0;L;;;;;N;;;;;
+14486;ANATOLIAN HIEROGLYPH A110B;Lo;0;L;;;;;N;;;;;
+14487;ANATOLIAN HIEROGLYPH A111;Lo;0;L;;;;;N;;;;;
+14488;ANATOLIAN HIEROGLYPH A112;Lo;0;L;;;;;N;;;;;
+14489;ANATOLIAN HIEROGLYPH A113;Lo;0;L;;;;;N;;;;;
+1448A;ANATOLIAN HIEROGLYPH A114;Lo;0;L;;;;;N;;;;;
+1448B;ANATOLIAN HIEROGLYPH A115;Lo;0;L;;;;;N;;;;;
+1448C;ANATOLIAN HIEROGLYPH A115A;Lo;0;L;;;;;N;;;;;
+1448D;ANATOLIAN HIEROGLYPH A116;Lo;0;L;;;;;N;;;;;
+1448E;ANATOLIAN HIEROGLYPH A117;Lo;0;L;;;;;N;;;;;
+1448F;ANATOLIAN HIEROGLYPH A118;Lo;0;L;;;;;N;;;;;
+14490;ANATOLIAN HIEROGLYPH A119;Lo;0;L;;;;;N;;;;;
+14491;ANATOLIAN HIEROGLYPH A120;Lo;0;L;;;;;N;;;;;
+14492;ANATOLIAN HIEROGLYPH A121;Lo;0;L;;;;;N;;;;;
+14493;ANATOLIAN HIEROGLYPH A122;Lo;0;L;;;;;N;;;;;
+14494;ANATOLIAN HIEROGLYPH A123;Lo;0;L;;;;;N;;;;;
+14495;ANATOLIAN HIEROGLYPH A124;Lo;0;L;;;;;N;;;;;
+14496;ANATOLIAN HIEROGLYPH A125;Lo;0;L;;;;;N;;;;;
+14497;ANATOLIAN HIEROGLYPH A125A;Lo;0;L;;;;;N;;;;;
+14498;ANATOLIAN HIEROGLYPH A126;Lo;0;L;;;;;N;;;;;
+14499;ANATOLIAN HIEROGLYPH A127;Lo;0;L;;;;;N;;;;;
+1449A;ANATOLIAN HIEROGLYPH A128;Lo;0;L;;;;;N;;;;;
+1449B;ANATOLIAN HIEROGLYPH A129;Lo;0;L;;;;;N;;;;;
+1449C;ANATOLIAN HIEROGLYPH A130;Lo;0;L;;;;;N;;;;;
+1449D;ANATOLIAN HIEROGLYPH A131;Lo;0;L;;;;;N;;;;;
+1449E;ANATOLIAN HIEROGLYPH A132;Lo;0;L;;;;;N;;;;;
+1449F;ANATOLIAN HIEROGLYPH A133;Lo;0;L;;;;;N;;;;;
+144A0;ANATOLIAN HIEROGLYPH A134;Lo;0;L;;;;;N;;;;;
+144A1;ANATOLIAN HIEROGLYPH A135;Lo;0;L;;;;;N;;;;;
+144A2;ANATOLIAN HIEROGLYPH A135A;Lo;0;L;;;;;N;;;;;
+144A3;ANATOLIAN HIEROGLYPH A136;Lo;0;L;;;;;N;;;;;
+144A4;ANATOLIAN HIEROGLYPH A137;Lo;0;L;;;;;N;;;;;
+144A5;ANATOLIAN HIEROGLYPH A138;Lo;0;L;;;;;N;;;;;
+144A6;ANATOLIAN HIEROGLYPH A139;Lo;0;L;;;;;N;;;;;
+144A7;ANATOLIAN HIEROGLYPH A140;Lo;0;L;;;;;N;;;;;
+144A8;ANATOLIAN HIEROGLYPH A141;Lo;0;L;;;;;N;;;;;
+144A9;ANATOLIAN HIEROGLYPH A142;Lo;0;L;;;;;N;;;;;
+144AA;ANATOLIAN HIEROGLYPH A143;Lo;0;L;;;;;N;;;;;
+144AB;ANATOLIAN HIEROGLYPH A144;Lo;0;L;;;;;N;;;;;
+144AC;ANATOLIAN HIEROGLYPH A145;Lo;0;L;;;;;N;;;;;
+144AD;ANATOLIAN HIEROGLYPH A146;Lo;0;L;;;;;N;;;;;
+144AE;ANATOLIAN HIEROGLYPH A147;Lo;0;L;;;;;N;;;;;
+144AF;ANATOLIAN HIEROGLYPH A148;Lo;0;L;;;;;N;;;;;
+144B0;ANATOLIAN HIEROGLYPH A149;Lo;0;L;;;;;N;;;;;
+144B1;ANATOLIAN HIEROGLYPH A150;Lo;0;L;;;;;N;;;;;
+144B2;ANATOLIAN HIEROGLYPH A151;Lo;0;L;;;;;N;;;;;
+144B3;ANATOLIAN HIEROGLYPH A152;Lo;0;L;;;;;N;;;;;
+144B4;ANATOLIAN HIEROGLYPH A153;Lo;0;L;;;;;N;;;;;
+144B5;ANATOLIAN HIEROGLYPH A154;Lo;0;L;;;;;N;;;;;
+144B6;ANATOLIAN HIEROGLYPH A155;Lo;0;L;;;;;N;;;;;
+144B7;ANATOLIAN HIEROGLYPH A156;Lo;0;L;;;;;N;;;;;
+144B8;ANATOLIAN HIEROGLYPH A157;Lo;0;L;;;;;N;;;;;
+144B9;ANATOLIAN HIEROGLYPH A158;Lo;0;L;;;;;N;;;;;
+144BA;ANATOLIAN HIEROGLYPH A159;Lo;0;L;;;;;N;;;;;
+144BB;ANATOLIAN HIEROGLYPH A160;Lo;0;L;;;;;N;;;;;
+144BC;ANATOLIAN HIEROGLYPH A161;Lo;0;L;;;;;N;;;;;
+144BD;ANATOLIAN HIEROGLYPH A162;Lo;0;L;;;;;N;;;;;
+144BE;ANATOLIAN HIEROGLYPH A163;Lo;0;L;;;;;N;;;;;
+144BF;ANATOLIAN HIEROGLYPH A164;Lo;0;L;;;;;N;;;;;
+144C0;ANATOLIAN HIEROGLYPH A165;Lo;0;L;;;;;N;;;;;
+144C1;ANATOLIAN HIEROGLYPH A166;Lo;0;L;;;;;N;;;;;
+144C2;ANATOLIAN HIEROGLYPH A167;Lo;0;L;;;;;N;;;;;
+144C3;ANATOLIAN HIEROGLYPH A168;Lo;0;L;;;;;N;;;;;
+144C4;ANATOLIAN HIEROGLYPH A169;Lo;0;L;;;;;N;;;;;
+144C5;ANATOLIAN HIEROGLYPH A170;Lo;0;L;;;;;N;;;;;
+144C6;ANATOLIAN HIEROGLYPH A171;Lo;0;L;;;;;N;;;;;
+144C7;ANATOLIAN HIEROGLYPH A172;Lo;0;L;;;;;N;;;;;
+144C8;ANATOLIAN HIEROGLYPH A173;Lo;0;L;;;;;N;;;;;
+144C9;ANATOLIAN HIEROGLYPH A174;Lo;0;L;;;;;N;;;;;
+144CA;ANATOLIAN HIEROGLYPH A175;Lo;0;L;;;;;N;;;;;
+144CB;ANATOLIAN HIEROGLYPH A176;Lo;0;L;;;;;N;;;;;
+144CC;ANATOLIAN HIEROGLYPH A177;Lo;0;L;;;;;N;;;;;
+144CD;ANATOLIAN HIEROGLYPH A178;Lo;0;L;;;;;N;;;;;
+144CE;ANATOLIAN HIEROGLYPH A179;Lo;0;L;;;;;N;;;;;
+144CF;ANATOLIAN HIEROGLYPH A180;Lo;0;L;;;;;N;;;;;
+144D0;ANATOLIAN HIEROGLYPH A181;Lo;0;L;;;;;N;;;;;
+144D1;ANATOLIAN HIEROGLYPH A182;Lo;0;L;;;;;N;;;;;
+144D2;ANATOLIAN HIEROGLYPH A183;Lo;0;L;;;;;N;;;;;
+144D3;ANATOLIAN HIEROGLYPH A184;Lo;0;L;;;;;N;;;;;
+144D4;ANATOLIAN HIEROGLYPH A185;Lo;0;L;;;;;N;;;;;
+144D5;ANATOLIAN HIEROGLYPH A186;Lo;0;L;;;;;N;;;;;
+144D6;ANATOLIAN HIEROGLYPH A187;Lo;0;L;;;;;N;;;;;
+144D7;ANATOLIAN HIEROGLYPH A188;Lo;0;L;;;;;N;;;;;
+144D8;ANATOLIAN HIEROGLYPH A189;Lo;0;L;;;;;N;;;;;
+144D9;ANATOLIAN HIEROGLYPH A190;Lo;0;L;;;;;N;;;;;
+144DA;ANATOLIAN HIEROGLYPH A191;Lo;0;L;;;;;N;;;;;
+144DB;ANATOLIAN HIEROGLYPH A192;Lo;0;L;;;;;N;;;;;
+144DC;ANATOLIAN HIEROGLYPH A193;Lo;0;L;;;;;N;;;;;
+144DD;ANATOLIAN HIEROGLYPH A194;Lo;0;L;;;;;N;;;;;
+144DE;ANATOLIAN HIEROGLYPH A195;Lo;0;L;;;;;N;;;;;
+144DF;ANATOLIAN HIEROGLYPH A196;Lo;0;L;;;;;N;;;;;
+144E0;ANATOLIAN HIEROGLYPH A197;Lo;0;L;;;;;N;;;;;
+144E1;ANATOLIAN HIEROGLYPH A198;Lo;0;L;;;;;N;;;;;
+144E2;ANATOLIAN HIEROGLYPH A199;Lo;0;L;;;;;N;;;;;
+144E3;ANATOLIAN HIEROGLYPH A200;Lo;0;L;;;;;N;;;;;
+144E4;ANATOLIAN HIEROGLYPH A201;Lo;0;L;;;;;N;;;;;
+144E5;ANATOLIAN HIEROGLYPH A202;Lo;0;L;;;;;N;;;;;
+144E6;ANATOLIAN HIEROGLYPH A202A;Lo;0;L;;;;;N;;;;;
+144E7;ANATOLIAN HIEROGLYPH A202B;Lo;0;L;;;;;N;;;;;
+144E8;ANATOLIAN HIEROGLYPH A203;Lo;0;L;;;;;N;;;;;
+144E9;ANATOLIAN HIEROGLYPH A204;Lo;0;L;;;;;N;;;;;
+144EA;ANATOLIAN HIEROGLYPH A205;Lo;0;L;;;;;N;;;;;
+144EB;ANATOLIAN HIEROGLYPH A206;Lo;0;L;;;;;N;;;;;
+144EC;ANATOLIAN HIEROGLYPH A207;Lo;0;L;;;;;N;;;;;
+144ED;ANATOLIAN HIEROGLYPH A207A;Lo;0;L;;;;;N;;;;;
+144EE;ANATOLIAN HIEROGLYPH A208;Lo;0;L;;;;;N;;;;;
+144EF;ANATOLIAN HIEROGLYPH A209;Lo;0;L;;;;;N;;;;;
+144F0;ANATOLIAN HIEROGLYPH A209A;Lo;0;L;;;;;N;;;;;
+144F1;ANATOLIAN HIEROGLYPH A210;Lo;0;L;;;;;N;;;;;
+144F2;ANATOLIAN HIEROGLYPH A211;Lo;0;L;;;;;N;;;;;
+144F3;ANATOLIAN HIEROGLYPH A212;Lo;0;L;;;;;N;;;;;
+144F4;ANATOLIAN HIEROGLYPH A213;Lo;0;L;;;;;N;;;;;
+144F5;ANATOLIAN HIEROGLYPH A214;Lo;0;L;;;;;N;;;;;
+144F6;ANATOLIAN HIEROGLYPH A215;Lo;0;L;;;;;N;;;;;
+144F7;ANATOLIAN HIEROGLYPH A215A;Lo;0;L;;;;;N;;;;;
+144F8;ANATOLIAN HIEROGLYPH A216;Lo;0;L;;;;;N;;;;;
+144F9;ANATOLIAN HIEROGLYPH A216A;Lo;0;L;;;;;N;;;;;
+144FA;ANATOLIAN HIEROGLYPH A217;Lo;0;L;;;;;N;;;;;
+144FB;ANATOLIAN HIEROGLYPH A218;Lo;0;L;;;;;N;;;;;
+144FC;ANATOLIAN HIEROGLYPH A219;Lo;0;L;;;;;N;;;;;
+144FD;ANATOLIAN HIEROGLYPH A220;Lo;0;L;;;;;N;;;;;
+144FE;ANATOLIAN HIEROGLYPH A221;Lo;0;L;;;;;N;;;;;
+144FF;ANATOLIAN HIEROGLYPH A222;Lo;0;L;;;;;N;;;;;
+14500;ANATOLIAN HIEROGLYPH A223;Lo;0;L;;;;;N;;;;;
+14501;ANATOLIAN HIEROGLYPH A224;Lo;0;L;;;;;N;;;;;
+14502;ANATOLIAN HIEROGLYPH A225;Lo;0;L;;;;;N;;;;;
+14503;ANATOLIAN HIEROGLYPH A226;Lo;0;L;;;;;N;;;;;
+14504;ANATOLIAN HIEROGLYPH A227;Lo;0;L;;;;;N;;;;;
+14505;ANATOLIAN HIEROGLYPH A227A;Lo;0;L;;;;;N;;;;;
+14506;ANATOLIAN HIEROGLYPH A228;Lo;0;L;;;;;N;;;;;
+14507;ANATOLIAN HIEROGLYPH A229;Lo;0;L;;;;;N;;;;;
+14508;ANATOLIAN HIEROGLYPH A230;Lo;0;L;;;;;N;;;;;
+14509;ANATOLIAN HIEROGLYPH A231;Lo;0;L;;;;;N;;;;;
+1450A;ANATOLIAN HIEROGLYPH A232;Lo;0;L;;;;;N;;;;;
+1450B;ANATOLIAN HIEROGLYPH A233;Lo;0;L;;;;;N;;;;;
+1450C;ANATOLIAN HIEROGLYPH A234;Lo;0;L;;;;;N;;;;;
+1450D;ANATOLIAN HIEROGLYPH A235;Lo;0;L;;;;;N;;;;;
+1450E;ANATOLIAN HIEROGLYPH A236;Lo;0;L;;;;;N;;;;;
+1450F;ANATOLIAN HIEROGLYPH A237;Lo;0;L;;;;;N;;;;;
+14510;ANATOLIAN HIEROGLYPH A238;Lo;0;L;;;;;N;;;;;
+14511;ANATOLIAN HIEROGLYPH A239;Lo;0;L;;;;;N;;;;;
+14512;ANATOLIAN HIEROGLYPH A240;Lo;0;L;;;;;N;;;;;
+14513;ANATOLIAN HIEROGLYPH A241;Lo;0;L;;;;;N;;;;;
+14514;ANATOLIAN HIEROGLYPH A242;Lo;0;L;;;;;N;;;;;
+14515;ANATOLIAN HIEROGLYPH A243;Lo;0;L;;;;;N;;;;;
+14516;ANATOLIAN HIEROGLYPH A244;Lo;0;L;;;;;N;;;;;
+14517;ANATOLIAN HIEROGLYPH A245;Lo;0;L;;;;;N;;;;;
+14518;ANATOLIAN HIEROGLYPH A246;Lo;0;L;;;;;N;;;;;
+14519;ANATOLIAN HIEROGLYPH A247;Lo;0;L;;;;;N;;;;;
+1451A;ANATOLIAN HIEROGLYPH A248;Lo;0;L;;;;;N;;;;;
+1451B;ANATOLIAN HIEROGLYPH A249;Lo;0;L;;;;;N;;;;;
+1451C;ANATOLIAN HIEROGLYPH A250;Lo;0;L;;;;;N;;;;;
+1451D;ANATOLIAN HIEROGLYPH A251;Lo;0;L;;;;;N;;;;;
+1451E;ANATOLIAN HIEROGLYPH A252;Lo;0;L;;;;;N;;;;;
+1451F;ANATOLIAN HIEROGLYPH A253;Lo;0;L;;;;;N;;;;;
+14520;ANATOLIAN HIEROGLYPH A254;Lo;0;L;;;;;N;;;;;
+14521;ANATOLIAN HIEROGLYPH A255;Lo;0;L;;;;;N;;;;;
+14522;ANATOLIAN HIEROGLYPH A256;Lo;0;L;;;;;N;;;;;
+14523;ANATOLIAN HIEROGLYPH A257;Lo;0;L;;;;;N;;;;;
+14524;ANATOLIAN HIEROGLYPH A258;Lo;0;L;;;;;N;;;;;
+14525;ANATOLIAN HIEROGLYPH A259;Lo;0;L;;;;;N;;;;;
+14526;ANATOLIAN HIEROGLYPH A260;Lo;0;L;;;;;N;;;;;
+14527;ANATOLIAN HIEROGLYPH A261;Lo;0;L;;;;;N;;;;;
+14528;ANATOLIAN HIEROGLYPH A262;Lo;0;L;;;;;N;;;;;
+14529;ANATOLIAN HIEROGLYPH A263;Lo;0;L;;;;;N;;;;;
+1452A;ANATOLIAN HIEROGLYPH A264;Lo;0;L;;;;;N;;;;;
+1452B;ANATOLIAN HIEROGLYPH A265;Lo;0;L;;;;;N;;;;;
+1452C;ANATOLIAN HIEROGLYPH A266;Lo;0;L;;;;;N;;;;;
+1452D;ANATOLIAN HIEROGLYPH A267;Lo;0;L;;;;;N;;;;;
+1452E;ANATOLIAN HIEROGLYPH A267A;Lo;0;L;;;;;N;;;;;
+1452F;ANATOLIAN HIEROGLYPH A268;Lo;0;L;;;;;N;;;;;
+14530;ANATOLIAN HIEROGLYPH A269;Lo;0;L;;;;;N;;;;;
+14531;ANATOLIAN HIEROGLYPH A270;Lo;0;L;;;;;N;;;;;
+14532;ANATOLIAN HIEROGLYPH A271;Lo;0;L;;;;;N;;;;;
+14533;ANATOLIAN HIEROGLYPH A272;Lo;0;L;;;;;N;;;;;
+14534;ANATOLIAN HIEROGLYPH A273;Lo;0;L;;;;;N;;;;;
+14535;ANATOLIAN HIEROGLYPH A274;Lo;0;L;;;;;N;;;;;
+14536;ANATOLIAN HIEROGLYPH A275;Lo;0;L;;;;;N;;;;;
+14537;ANATOLIAN HIEROGLYPH A276;Lo;0;L;;;;;N;;;;;
+14538;ANATOLIAN HIEROGLYPH A277;Lo;0;L;;;;;N;;;;;
+14539;ANATOLIAN HIEROGLYPH A278;Lo;0;L;;;;;N;;;;;
+1453A;ANATOLIAN HIEROGLYPH A279;Lo;0;L;;;;;N;;;;;
+1453B;ANATOLIAN HIEROGLYPH A280;Lo;0;L;;;;;N;;;;;
+1453C;ANATOLIAN HIEROGLYPH A281;Lo;0;L;;;;;N;;;;;
+1453D;ANATOLIAN HIEROGLYPH A282;Lo;0;L;;;;;N;;;;;
+1453E;ANATOLIAN HIEROGLYPH A283;Lo;0;L;;;;;N;;;;;
+1453F;ANATOLIAN HIEROGLYPH A284;Lo;0;L;;;;;N;;;;;
+14540;ANATOLIAN HIEROGLYPH A285;Lo;0;L;;;;;N;;;;;
+14541;ANATOLIAN HIEROGLYPH A286;Lo;0;L;;;;;N;;;;;
+14542;ANATOLIAN HIEROGLYPH A287;Lo;0;L;;;;;N;;;;;
+14543;ANATOLIAN HIEROGLYPH A288;Lo;0;L;;;;;N;;;;;
+14544;ANATOLIAN HIEROGLYPH A289;Lo;0;L;;;;;N;;;;;
+14545;ANATOLIAN HIEROGLYPH A289A;Lo;0;L;;;;;N;;;;;
+14546;ANATOLIAN HIEROGLYPH A290;Lo;0;L;;;;;N;;;;;
+14547;ANATOLIAN HIEROGLYPH A291;Lo;0;L;;;;;N;;;;;
+14548;ANATOLIAN HIEROGLYPH A292;Lo;0;L;;;;;N;;;;;
+14549;ANATOLIAN HIEROGLYPH A293;Lo;0;L;;;;;N;;;;;
+1454A;ANATOLIAN HIEROGLYPH A294;Lo;0;L;;;;;N;;;;;
+1454B;ANATOLIAN HIEROGLYPH A294A;Lo;0;L;;;;;N;;;;;
+1454C;ANATOLIAN HIEROGLYPH A295;Lo;0;L;;;;;N;;;;;
+1454D;ANATOLIAN HIEROGLYPH A296;Lo;0;L;;;;;N;;;;;
+1454E;ANATOLIAN HIEROGLYPH A297;Lo;0;L;;;;;N;;;;;
+1454F;ANATOLIAN HIEROGLYPH A298;Lo;0;L;;;;;N;;;;;
+14550;ANATOLIAN HIEROGLYPH A299;Lo;0;L;;;;;N;;;;;
+14551;ANATOLIAN HIEROGLYPH A299A;Lo;0;L;;;;;N;;;;;
+14552;ANATOLIAN HIEROGLYPH A300;Lo;0;L;;;;;N;;;;;
+14553;ANATOLIAN HIEROGLYPH A301;Lo;0;L;;;;;N;;;;;
+14554;ANATOLIAN HIEROGLYPH A302;Lo;0;L;;;;;N;;;;;
+14555;ANATOLIAN HIEROGLYPH A303;Lo;0;L;;;;;N;;;;;
+14556;ANATOLIAN HIEROGLYPH A304;Lo;0;L;;;;;N;;;;;
+14557;ANATOLIAN HIEROGLYPH A305;Lo;0;L;;;;;N;;;;;
+14558;ANATOLIAN HIEROGLYPH A306;Lo;0;L;;;;;N;;;;;
+14559;ANATOLIAN HIEROGLYPH A307;Lo;0;L;;;;;N;;;;;
+1455A;ANATOLIAN HIEROGLYPH A308;Lo;0;L;;;;;N;;;;;
+1455B;ANATOLIAN HIEROGLYPH A309;Lo;0;L;;;;;N;;;;;
+1455C;ANATOLIAN HIEROGLYPH A309A;Lo;0;L;;;;;N;;;;;
+1455D;ANATOLIAN HIEROGLYPH A310;Lo;0;L;;;;;N;;;;;
+1455E;ANATOLIAN HIEROGLYPH A311;Lo;0;L;;;;;N;;;;;
+1455F;ANATOLIAN HIEROGLYPH A312;Lo;0;L;;;;;N;;;;;
+14560;ANATOLIAN HIEROGLYPH A313;Lo;0;L;;;;;N;;;;;
+14561;ANATOLIAN HIEROGLYPH A314;Lo;0;L;;;;;N;;;;;
+14562;ANATOLIAN HIEROGLYPH A315;Lo;0;L;;;;;N;;;;;
+14563;ANATOLIAN HIEROGLYPH A316;Lo;0;L;;;;;N;;;;;
+14564;ANATOLIAN HIEROGLYPH A317;Lo;0;L;;;;;N;;;;;
+14565;ANATOLIAN HIEROGLYPH A318;Lo;0;L;;;;;N;;;;;
+14566;ANATOLIAN HIEROGLYPH A319;Lo;0;L;;;;;N;;;;;
+14567;ANATOLIAN HIEROGLYPH A320;Lo;0;L;;;;;N;;;;;
+14568;ANATOLIAN HIEROGLYPH A321;Lo;0;L;;;;;N;;;;;
+14569;ANATOLIAN HIEROGLYPH A322;Lo;0;L;;;;;N;;;;;
+1456A;ANATOLIAN HIEROGLYPH A323;Lo;0;L;;;;;N;;;;;
+1456B;ANATOLIAN HIEROGLYPH A324;Lo;0;L;;;;;N;;;;;
+1456C;ANATOLIAN HIEROGLYPH A325;Lo;0;L;;;;;N;;;;;
+1456D;ANATOLIAN HIEROGLYPH A326;Lo;0;L;;;;;N;;;;;
+1456E;ANATOLIAN HIEROGLYPH A327;Lo;0;L;;;;;N;;;;;
+1456F;ANATOLIAN HIEROGLYPH A328;Lo;0;L;;;;;N;;;;;
+14570;ANATOLIAN HIEROGLYPH A329;Lo;0;L;;;;;N;;;;;
+14571;ANATOLIAN HIEROGLYPH A329A;Lo;0;L;;;;;N;;;;;
+14572;ANATOLIAN HIEROGLYPH A330;Lo;0;L;;;;;N;;;;;
+14573;ANATOLIAN HIEROGLYPH A331;Lo;0;L;;;;;N;;;;;
+14574;ANATOLIAN HIEROGLYPH A332A;Lo;0;L;;;;;N;;;;;
+14575;ANATOLIAN HIEROGLYPH A332B;Lo;0;L;;;;;N;;;;;
+14576;ANATOLIAN HIEROGLYPH A332C;Lo;0;L;;;;;N;;;;;
+14577;ANATOLIAN HIEROGLYPH A333;Lo;0;L;;;;;N;;;;;
+14578;ANATOLIAN HIEROGLYPH A334;Lo;0;L;;;;;N;;;;;
+14579;ANATOLIAN HIEROGLYPH A335;Lo;0;L;;;;;N;;;;;
+1457A;ANATOLIAN HIEROGLYPH A336;Lo;0;L;;;;;N;;;;;
+1457B;ANATOLIAN HIEROGLYPH A336A;Lo;0;L;;;;;N;;;;;
+1457C;ANATOLIAN HIEROGLYPH A336B;Lo;0;L;;;;;N;;;;;
+1457D;ANATOLIAN HIEROGLYPH A336C;Lo;0;L;;;;;N;;;;;
+1457E;ANATOLIAN HIEROGLYPH A337;Lo;0;L;;;;;N;;;;;
+1457F;ANATOLIAN HIEROGLYPH A338;Lo;0;L;;;;;N;;;;;
+14580;ANATOLIAN HIEROGLYPH A339;Lo;0;L;;;;;N;;;;;
+14581;ANATOLIAN HIEROGLYPH A340;Lo;0;L;;;;;N;;;;;
+14582;ANATOLIAN HIEROGLYPH A341;Lo;0;L;;;;;N;;;;;
+14583;ANATOLIAN HIEROGLYPH A342;Lo;0;L;;;;;N;;;;;
+14584;ANATOLIAN HIEROGLYPH A343;Lo;0;L;;;;;N;;;;;
+14585;ANATOLIAN HIEROGLYPH A344;Lo;0;L;;;;;N;;;;;
+14586;ANATOLIAN HIEROGLYPH A345;Lo;0;L;;;;;N;;;;;
+14587;ANATOLIAN HIEROGLYPH A346;Lo;0;L;;;;;N;;;;;
+14588;ANATOLIAN HIEROGLYPH A347;Lo;0;L;;;;;N;;;;;
+14589;ANATOLIAN HIEROGLYPH A348;Lo;0;L;;;;;N;;;;;
+1458A;ANATOLIAN HIEROGLYPH A349;Lo;0;L;;;;;N;;;;;
+1458B;ANATOLIAN HIEROGLYPH A350;Lo;0;L;;;;;N;;;;;
+1458C;ANATOLIAN HIEROGLYPH A351;Lo;0;L;;;;;N;;;;;
+1458D;ANATOLIAN HIEROGLYPH A352;Lo;0;L;;;;;N;;;;;
+1458E;ANATOLIAN HIEROGLYPH A353;Lo;0;L;;;;;N;;;;;
+1458F;ANATOLIAN HIEROGLYPH A354;Lo;0;L;;;;;N;;;;;
+14590;ANATOLIAN HIEROGLYPH A355;Lo;0;L;;;;;N;;;;;
+14591;ANATOLIAN HIEROGLYPH A356;Lo;0;L;;;;;N;;;;;
+14592;ANATOLIAN HIEROGLYPH A357;Lo;0;L;;;;;N;;;;;
+14593;ANATOLIAN HIEROGLYPH A358;Lo;0;L;;;;;N;;;;;
+14594;ANATOLIAN HIEROGLYPH A359;Lo;0;L;;;;;N;;;;;
+14595;ANATOLIAN HIEROGLYPH A359A;Lo;0;L;;;;;N;;;;;
+14596;ANATOLIAN HIEROGLYPH A360;Lo;0;L;;;;;N;;;;;
+14597;ANATOLIAN HIEROGLYPH A361;Lo;0;L;;;;;N;;;;;
+14598;ANATOLIAN HIEROGLYPH A362;Lo;0;L;;;;;N;;;;;
+14599;ANATOLIAN HIEROGLYPH A363;Lo;0;L;;;;;N;;;;;
+1459A;ANATOLIAN HIEROGLYPH A364;Lo;0;L;;;;;N;;;;;
+1459B;ANATOLIAN HIEROGLYPH A364A;Lo;0;L;;;;;N;;;;;
+1459C;ANATOLIAN HIEROGLYPH A365;Lo;0;L;;;;;N;;;;;
+1459D;ANATOLIAN HIEROGLYPH A366;Lo;0;L;;;;;N;;;;;
+1459E;ANATOLIAN HIEROGLYPH A367;Lo;0;L;;;;;N;;;;;
+1459F;ANATOLIAN HIEROGLYPH A368;Lo;0;L;;;;;N;;;;;
+145A0;ANATOLIAN HIEROGLYPH A368A;Lo;0;L;;;;;N;;;;;
+145A1;ANATOLIAN HIEROGLYPH A369;Lo;0;L;;;;;N;;;;;
+145A2;ANATOLIAN HIEROGLYPH A370;Lo;0;L;;;;;N;;;;;
+145A3;ANATOLIAN HIEROGLYPH A371;Lo;0;L;;;;;N;;;;;
+145A4;ANATOLIAN HIEROGLYPH A371A;Lo;0;L;;;;;N;;;;;
+145A5;ANATOLIAN HIEROGLYPH A372;Lo;0;L;;;;;N;;;;;
+145A6;ANATOLIAN HIEROGLYPH A373;Lo;0;L;;;;;N;;;;;
+145A7;ANATOLIAN HIEROGLYPH A374;Lo;0;L;;;;;N;;;;;
+145A8;ANATOLIAN HIEROGLYPH A375;Lo;0;L;;;;;N;;;;;
+145A9;ANATOLIAN HIEROGLYPH A376;Lo;0;L;;;;;N;;;;;
+145AA;ANATOLIAN HIEROGLYPH A377;Lo;0;L;;;;;N;;;;;
+145AB;ANATOLIAN HIEROGLYPH A378;Lo;0;L;;;;;N;;;;;
+145AC;ANATOLIAN HIEROGLYPH A379;Lo;0;L;;;;;N;;;;;
+145AD;ANATOLIAN HIEROGLYPH A380;Lo;0;L;;;;;N;;;;;
+145AE;ANATOLIAN HIEROGLYPH A381;Lo;0;L;;;;;N;;;;;
+145AF;ANATOLIAN HIEROGLYPH A381A;Lo;0;L;;;;;N;;;;;
+145B0;ANATOLIAN HIEROGLYPH A382;Lo;0;L;;;;;N;;;;;
+145B1;ANATOLIAN HIEROGLYPH A383 RA OR RI;Lo;0;L;;;;;N;;;;;
+145B2;ANATOLIAN HIEROGLYPH A383A;Lo;0;L;;;;;N;;;;;
+145B3;ANATOLIAN HIEROGLYPH A384;Lo;0;L;;;;;N;;;;;
+145B4;ANATOLIAN HIEROGLYPH A385;Lo;0;L;;;;;N;;;;;
+145B5;ANATOLIAN HIEROGLYPH A386;Lo;0;L;;;;;N;;;;;
+145B6;ANATOLIAN HIEROGLYPH A386A;Lo;0;L;;;;;N;;;;;
+145B7;ANATOLIAN HIEROGLYPH A387;Lo;0;L;;;;;N;;;;;
+145B8;ANATOLIAN HIEROGLYPH A388;Lo;0;L;;;;;N;;;;;
+145B9;ANATOLIAN HIEROGLYPH A389;Lo;0;L;;;;;N;;;;;
+145BA;ANATOLIAN HIEROGLYPH A390;Lo;0;L;;;;;N;;;;;
+145BB;ANATOLIAN HIEROGLYPH A391;Lo;0;L;;;;;N;;;;;
+145BC;ANATOLIAN HIEROGLYPH A392;Lo;0;L;;;;;N;;;;;
+145BD;ANATOLIAN HIEROGLYPH A393 EIGHT;Lo;0;L;;;;;N;;;;;
+145BE;ANATOLIAN HIEROGLYPH A394;Lo;0;L;;;;;N;;;;;
+145BF;ANATOLIAN HIEROGLYPH A395;Lo;0;L;;;;;N;;;;;
+145C0;ANATOLIAN HIEROGLYPH A396;Lo;0;L;;;;;N;;;;;
+145C1;ANATOLIAN HIEROGLYPH A397;Lo;0;L;;;;;N;;;;;
+145C2;ANATOLIAN HIEROGLYPH A398;Lo;0;L;;;;;N;;;;;
+145C3;ANATOLIAN HIEROGLYPH A399;Lo;0;L;;;;;N;;;;;
+145C4;ANATOLIAN HIEROGLYPH A400;Lo;0;L;;;;;N;;;;;
+145C5;ANATOLIAN HIEROGLYPH A401;Lo;0;L;;;;;N;;;;;
+145C6;ANATOLIAN HIEROGLYPH A402;Lo;0;L;;;;;N;;;;;
+145C7;ANATOLIAN HIEROGLYPH A403;Lo;0;L;;;;;N;;;;;
+145C8;ANATOLIAN HIEROGLYPH A404;Lo;0;L;;;;;N;;;;;
+145C9;ANATOLIAN HIEROGLYPH A405;Lo;0;L;;;;;N;;;;;
+145CA;ANATOLIAN HIEROGLYPH A406;Lo;0;L;;;;;N;;;;;
+145CB;ANATOLIAN HIEROGLYPH A407;Lo;0;L;;;;;N;;;;;
+145CC;ANATOLIAN HIEROGLYPH A408;Lo;0;L;;;;;N;;;;;
+145CD;ANATOLIAN HIEROGLYPH A409;Lo;0;L;;;;;N;;;;;
+145CE;ANATOLIAN HIEROGLYPH A410 BEGIN LOGOGRAM MARK;Lo;0;L;;;;;N;;;;;
+145CF;ANATOLIAN HIEROGLYPH A410A END LOGOGRAM MARK;Lo;0;L;;;;;N;;;;;
+145D0;ANATOLIAN HIEROGLYPH A411;Lo;0;L;;;;;N;;;;;
+145D1;ANATOLIAN HIEROGLYPH A412;Lo;0;L;;;;;N;;;;;
+145D2;ANATOLIAN HIEROGLYPH A413;Lo;0;L;;;;;N;;;;;
+145D3;ANATOLIAN HIEROGLYPH A414;Lo;0;L;;;;;N;;;;;
+145D4;ANATOLIAN HIEROGLYPH A415;Lo;0;L;;;;;N;;;;;
+145D5;ANATOLIAN HIEROGLYPH A416;Lo;0;L;;;;;N;;;;;
+145D6;ANATOLIAN HIEROGLYPH A417;Lo;0;L;;;;;N;;;;;
+145D7;ANATOLIAN HIEROGLYPH A418;Lo;0;L;;;;;N;;;;;
+145D8;ANATOLIAN HIEROGLYPH A419;Lo;0;L;;;;;N;;;;;
+145D9;ANATOLIAN HIEROGLYPH A420;Lo;0;L;;;;;N;;;;;
+145DA;ANATOLIAN HIEROGLYPH A421;Lo;0;L;;;;;N;;;;;
+145DB;ANATOLIAN HIEROGLYPH A422;Lo;0;L;;;;;N;;;;;
+145DC;ANATOLIAN HIEROGLYPH A423;Lo;0;L;;;;;N;;;;;
+145DD;ANATOLIAN HIEROGLYPH A424;Lo;0;L;;;;;N;;;;;
+145DE;ANATOLIAN HIEROGLYPH A425;Lo;0;L;;;;;N;;;;;
+145DF;ANATOLIAN HIEROGLYPH A426;Lo;0;L;;;;;N;;;;;
+145E0;ANATOLIAN HIEROGLYPH A427;Lo;0;L;;;;;N;;;;;
+145E1;ANATOLIAN HIEROGLYPH A428;Lo;0;L;;;;;N;;;;;
+145E2;ANATOLIAN HIEROGLYPH A429;Lo;0;L;;;;;N;;;;;
+145E3;ANATOLIAN HIEROGLYPH A430;Lo;0;L;;;;;N;;;;;
+145E4;ANATOLIAN HIEROGLYPH A431;Lo;0;L;;;;;N;;;;;
+145E5;ANATOLIAN HIEROGLYPH A432;Lo;0;L;;;;;N;;;;;
+145E6;ANATOLIAN HIEROGLYPH A433;Lo;0;L;;;;;N;;;;;
+145E7;ANATOLIAN HIEROGLYPH A434;Lo;0;L;;;;;N;;;;;
+145E8;ANATOLIAN HIEROGLYPH A435;Lo;0;L;;;;;N;;;;;
+145E9;ANATOLIAN HIEROGLYPH A436;Lo;0;L;;;;;N;;;;;
+145EA;ANATOLIAN HIEROGLYPH A437;Lo;0;L;;;;;N;;;;;
+145EB;ANATOLIAN HIEROGLYPH A438;Lo;0;L;;;;;N;;;;;
+145EC;ANATOLIAN HIEROGLYPH A439;Lo;0;L;;;;;N;;;;;
+145ED;ANATOLIAN HIEROGLYPH A440;Lo;0;L;;;;;N;;;;;
+145EE;ANATOLIAN HIEROGLYPH A441;Lo;0;L;;;;;N;;;;;
+145EF;ANATOLIAN HIEROGLYPH A442;Lo;0;L;;;;;N;;;;;
+145F0;ANATOLIAN HIEROGLYPH A443;Lo;0;L;;;;;N;;;;;
+145F1;ANATOLIAN HIEROGLYPH A444;Lo;0;L;;;;;N;;;;;
+145F2;ANATOLIAN HIEROGLYPH A445;Lo;0;L;;;;;N;;;;;
+145F3;ANATOLIAN HIEROGLYPH A446;Lo;0;L;;;;;N;;;;;
+145F4;ANATOLIAN HIEROGLYPH A447;Lo;0;L;;;;;N;;;;;
+145F5;ANATOLIAN HIEROGLYPH A448;Lo;0;L;;;;;N;;;;;
+145F6;ANATOLIAN HIEROGLYPH A449;Lo;0;L;;;;;N;;;;;
+145F7;ANATOLIAN HIEROGLYPH A450;Lo;0;L;;;;;N;;;;;
+145F8;ANATOLIAN HIEROGLYPH A450A;Lo;0;L;;;;;N;;;;;
+145F9;ANATOLIAN HIEROGLYPH A451;Lo;0;L;;;;;N;;;;;
+145FA;ANATOLIAN HIEROGLYPH A452;Lo;0;L;;;;;N;;;;;
+145FB;ANATOLIAN HIEROGLYPH A453;Lo;0;L;;;;;N;;;;;
+145FC;ANATOLIAN HIEROGLYPH A454;Lo;0;L;;;;;N;;;;;
+145FD;ANATOLIAN HIEROGLYPH A455;Lo;0;L;;;;;N;;;;;
+145FE;ANATOLIAN HIEROGLYPH A456;Lo;0;L;;;;;N;;;;;
+145FF;ANATOLIAN HIEROGLYPH A457;Lo;0;L;;;;;N;;;;;
+14600;ANATOLIAN HIEROGLYPH A457A;Lo;0;L;;;;;N;;;;;
+14601;ANATOLIAN HIEROGLYPH A458;Lo;0;L;;;;;N;;;;;
+14602;ANATOLIAN HIEROGLYPH A459;Lo;0;L;;;;;N;;;;;
+14603;ANATOLIAN HIEROGLYPH A460;Lo;0;L;;;;;N;;;;;
+14604;ANATOLIAN HIEROGLYPH A461;Lo;0;L;;;;;N;;;;;
+14605;ANATOLIAN HIEROGLYPH A462;Lo;0;L;;;;;N;;;;;
+14606;ANATOLIAN HIEROGLYPH A463;Lo;0;L;;;;;N;;;;;
+14607;ANATOLIAN HIEROGLYPH A464;Lo;0;L;;;;;N;;;;;
+14608;ANATOLIAN HIEROGLYPH A465;Lo;0;L;;;;;N;;;;;
+14609;ANATOLIAN HIEROGLYPH A466;Lo;0;L;;;;;N;;;;;
+1460A;ANATOLIAN HIEROGLYPH A467;Lo;0;L;;;;;N;;;;;
+1460B;ANATOLIAN HIEROGLYPH A468;Lo;0;L;;;;;N;;;;;
+1460C;ANATOLIAN HIEROGLYPH A469;Lo;0;L;;;;;N;;;;;
+1460D;ANATOLIAN HIEROGLYPH A470;Lo;0;L;;;;;N;;;;;
+1460E;ANATOLIAN HIEROGLYPH A471;Lo;0;L;;;;;N;;;;;
+1460F;ANATOLIAN HIEROGLYPH A472;Lo;0;L;;;;;N;;;;;
+14610;ANATOLIAN HIEROGLYPH A473;Lo;0;L;;;;;N;;;;;
+14611;ANATOLIAN HIEROGLYPH A474;Lo;0;L;;;;;N;;;;;
+14612;ANATOLIAN HIEROGLYPH A475;Lo;0;L;;;;;N;;;;;
+14613;ANATOLIAN HIEROGLYPH A476;Lo;0;L;;;;;N;;;;;
+14614;ANATOLIAN HIEROGLYPH A477;Lo;0;L;;;;;N;;;;;
+14615;ANATOLIAN HIEROGLYPH A478;Lo;0;L;;;;;N;;;;;
+14616;ANATOLIAN HIEROGLYPH A479;Lo;0;L;;;;;N;;;;;
+14617;ANATOLIAN HIEROGLYPH A480;Lo;0;L;;;;;N;;;;;
+14618;ANATOLIAN HIEROGLYPH A481;Lo;0;L;;;;;N;;;;;
+14619;ANATOLIAN HIEROGLYPH A482;Lo;0;L;;;;;N;;;;;
+1461A;ANATOLIAN HIEROGLYPH A483;Lo;0;L;;;;;N;;;;;
+1461B;ANATOLIAN HIEROGLYPH A484;Lo;0;L;;;;;N;;;;;
+1461C;ANATOLIAN HIEROGLYPH A485;Lo;0;L;;;;;N;;;;;
+1461D;ANATOLIAN HIEROGLYPH A486;Lo;0;L;;;;;N;;;;;
+1461E;ANATOLIAN HIEROGLYPH A487;Lo;0;L;;;;;N;;;;;
+1461F;ANATOLIAN HIEROGLYPH A488;Lo;0;L;;;;;N;;;;;
+14620;ANATOLIAN HIEROGLYPH A489;Lo;0;L;;;;;N;;;;;
+14621;ANATOLIAN HIEROGLYPH A490;Lo;0;L;;;;;N;;;;;
+14622;ANATOLIAN HIEROGLYPH A491;Lo;0;L;;;;;N;;;;;
+14623;ANATOLIAN HIEROGLYPH A492;Lo;0;L;;;;;N;;;;;
+14624;ANATOLIAN HIEROGLYPH A493;Lo;0;L;;;;;N;;;;;
+14625;ANATOLIAN HIEROGLYPH A494;Lo;0;L;;;;;N;;;;;
+14626;ANATOLIAN HIEROGLYPH A495;Lo;0;L;;;;;N;;;;;
+14627;ANATOLIAN HIEROGLYPH A496;Lo;0;L;;;;;N;;;;;
+14628;ANATOLIAN HIEROGLYPH A497;Lo;0;L;;;;;N;;;;;
+14629;ANATOLIAN HIEROGLYPH A501;Lo;0;L;;;;;N;;;;;
+1462A;ANATOLIAN HIEROGLYPH A502;Lo;0;L;;;;;N;;;;;
+1462B;ANATOLIAN HIEROGLYPH A503;Lo;0;L;;;;;N;;;;;
+1462C;ANATOLIAN HIEROGLYPH A504;Lo;0;L;;;;;N;;;;;
+1462D;ANATOLIAN HIEROGLYPH A505;Lo;0;L;;;;;N;;;;;
+1462E;ANATOLIAN HIEROGLYPH A506;Lo;0;L;;;;;N;;;;;
+1462F;ANATOLIAN HIEROGLYPH A507;Lo;0;L;;;;;N;;;;;
+14630;ANATOLIAN HIEROGLYPH A508;Lo;0;L;;;;;N;;;;;
+14631;ANATOLIAN HIEROGLYPH A509;Lo;0;L;;;;;N;;;;;
+14632;ANATOLIAN HIEROGLYPH A510;Lo;0;L;;;;;N;;;;;
+14633;ANATOLIAN HIEROGLYPH A511;Lo;0;L;;;;;N;;;;;
+14634;ANATOLIAN HIEROGLYPH A512;Lo;0;L;;;;;N;;;;;
+14635;ANATOLIAN HIEROGLYPH A513;Lo;0;L;;;;;N;;;;;
+14636;ANATOLIAN HIEROGLYPH A514;Lo;0;L;;;;;N;;;;;
+14637;ANATOLIAN HIEROGLYPH A515;Lo;0;L;;;;;N;;;;;
+14638;ANATOLIAN HIEROGLYPH A516;Lo;0;L;;;;;N;;;;;
+14639;ANATOLIAN HIEROGLYPH A517;Lo;0;L;;;;;N;;;;;
+1463A;ANATOLIAN HIEROGLYPH A518;Lo;0;L;;;;;N;;;;;
+1463B;ANATOLIAN HIEROGLYPH A519;Lo;0;L;;;;;N;;;;;
+1463C;ANATOLIAN HIEROGLYPH A520;Lo;0;L;;;;;N;;;;;
+1463D;ANATOLIAN HIEROGLYPH A521;Lo;0;L;;;;;N;;;;;
+1463E;ANATOLIAN HIEROGLYPH A522;Lo;0;L;;;;;N;;;;;
+1463F;ANATOLIAN HIEROGLYPH A523;Lo;0;L;;;;;N;;;;;
+14640;ANATOLIAN HIEROGLYPH A524;Lo;0;L;;;;;N;;;;;
+14641;ANATOLIAN HIEROGLYPH A525;Lo;0;L;;;;;N;;;;;
+14642;ANATOLIAN HIEROGLYPH A526;Lo;0;L;;;;;N;;;;;
+14643;ANATOLIAN HIEROGLYPH A527;Lo;0;L;;;;;N;;;;;
+14644;ANATOLIAN HIEROGLYPH A528;Lo;0;L;;;;;N;;;;;
+14645;ANATOLIAN HIEROGLYPH A529;Lo;0;L;;;;;N;;;;;
+14646;ANATOLIAN HIEROGLYPH A530;Lo;0;L;;;;;N;;;;;
+16800;BAMUM LETTER PHASE-A NGKUE MFON;Lo;0;L;;;;;N;;;;;
+16801;BAMUM LETTER PHASE-A GBIEE FON;Lo;0;L;;;;;N;;;;;
+16802;BAMUM LETTER PHASE-A PON MFON PIPAEMGBIEE;Lo;0;L;;;;;N;;;;;
+16803;BAMUM LETTER PHASE-A PON MFON PIPAEMBA;Lo;0;L;;;;;N;;;;;
+16804;BAMUM LETTER PHASE-A NAA MFON;Lo;0;L;;;;;N;;;;;
+16805;BAMUM LETTER PHASE-A SHUENSHUET;Lo;0;L;;;;;N;;;;;
+16806;BAMUM LETTER PHASE-A TITA MFON;Lo;0;L;;;;;N;;;;;
+16807;BAMUM LETTER PHASE-A NZA MFON;Lo;0;L;;;;;N;;;;;
+16808;BAMUM LETTER PHASE-A SHINDA PA NJI;Lo;0;L;;;;;N;;;;;
+16809;BAMUM LETTER PHASE-A PON PA NJI PIPAEMGBIEE;Lo;0;L;;;;;N;;;;;
+1680A;BAMUM LETTER PHASE-A PON PA NJI PIPAEMBA;Lo;0;L;;;;;N;;;;;
+1680B;BAMUM LETTER PHASE-A MAEMBGBIEE;Lo;0;L;;;;;N;;;;;
+1680C;BAMUM LETTER PHASE-A TU MAEMBA;Lo;0;L;;;;;N;;;;;
+1680D;BAMUM LETTER PHASE-A NGANGU;Lo;0;L;;;;;N;;;;;
+1680E;BAMUM LETTER PHASE-A MAEMVEUX;Lo;0;L;;;;;N;;;;;
+1680F;BAMUM LETTER PHASE-A MANSUAE;Lo;0;L;;;;;N;;;;;
+16810;BAMUM LETTER PHASE-A MVEUAENGAM;Lo;0;L;;;;;N;;;;;
+16811;BAMUM LETTER PHASE-A SEUNYAM;Lo;0;L;;;;;N;;;;;
+16812;BAMUM LETTER PHASE-A NTOQPEN;Lo;0;L;;;;;N;;;;;
+16813;BAMUM LETTER PHASE-A KEUKEUTNDA;Lo;0;L;;;;;N;;;;;
+16814;BAMUM LETTER PHASE-A NKINDI;Lo;0;L;;;;;N;;;;;
+16815;BAMUM LETTER PHASE-A SUU;Lo;0;L;;;;;N;;;;;
+16816;BAMUM LETTER PHASE-A NGKUENZEUM;Lo;0;L;;;;;N;;;;;
+16817;BAMUM LETTER PHASE-A LAPAQ;Lo;0;L;;;;;N;;;;;
+16818;BAMUM LETTER PHASE-A LET KUT;Lo;0;L;;;;;N;;;;;
+16819;BAMUM LETTER PHASE-A NTAP MFAA;Lo;0;L;;;;;N;;;;;
+1681A;BAMUM LETTER PHASE-A MAEKEUP;Lo;0;L;;;;;N;;;;;
+1681B;BAMUM LETTER PHASE-A PASHAE;Lo;0;L;;;;;N;;;;;
+1681C;BAMUM LETTER PHASE-A GHEUAERAE;Lo;0;L;;;;;N;;;;;
+1681D;BAMUM LETTER PHASE-A PAMSHAE;Lo;0;L;;;;;N;;;;;
+1681E;BAMUM LETTER PHASE-A MON NGGEUAET;Lo;0;L;;;;;N;;;;;
+1681F;BAMUM LETTER PHASE-A NZUN MEUT;Lo;0;L;;;;;N;;;;;
+16820;BAMUM LETTER PHASE-A U YUQ NAE;Lo;0;L;;;;;N;;;;;
+16821;BAMUM LETTER PHASE-A GHEUAEGHEUAE;Lo;0;L;;;;;N;;;;;
+16822;BAMUM LETTER PHASE-A NTAP NTAA;Lo;0;L;;;;;N;;;;;
+16823;BAMUM LETTER PHASE-A SISA;Lo;0;L;;;;;N;;;;;
+16824;BAMUM LETTER PHASE-A MGBASA;Lo;0;L;;;;;N;;;;;
+16825;BAMUM LETTER PHASE-A MEUNJOMNDEUQ;Lo;0;L;;;;;N;;;;;
+16826;BAMUM LETTER PHASE-A MOOMPUQ;Lo;0;L;;;;;N;;;;;
+16827;BAMUM LETTER PHASE-A KAFA;Lo;0;L;;;;;N;;;;;
+16828;BAMUM LETTER PHASE-A PA LEERAEWA;Lo;0;L;;;;;N;;;;;
+16829;BAMUM LETTER PHASE-A NDA LEERAEWA;Lo;0;L;;;;;N;;;;;
+1682A;BAMUM LETTER PHASE-A PET;Lo;0;L;;;;;N;;;;;
+1682B;BAMUM LETTER PHASE-A MAEMKPEN;Lo;0;L;;;;;N;;;;;
+1682C;BAMUM LETTER PHASE-A NIKA;Lo;0;L;;;;;N;;;;;
+1682D;BAMUM LETTER PHASE-A PUP;Lo;0;L;;;;;N;;;;;
+1682E;BAMUM LETTER PHASE-A TUAEP;Lo;0;L;;;;;N;;;;;
+1682F;BAMUM LETTER PHASE-A LUAEP;Lo;0;L;;;;;N;;;;;
+16830;BAMUM LETTER PHASE-A SONJAM;Lo;0;L;;;;;N;;;;;
+16831;BAMUM LETTER PHASE-A TEUTEUWEN;Lo;0;L;;;;;N;;;;;
+16832;BAMUM LETTER PHASE-A MAENYI;Lo;0;L;;;;;N;;;;;
+16833;BAMUM LETTER PHASE-A KET;Lo;0;L;;;;;N;;;;;
+16834;BAMUM LETTER PHASE-A NDAANGGEUAET;Lo;0;L;;;;;N;;;;;
+16835;BAMUM LETTER PHASE-A KUOQ;Lo;0;L;;;;;N;;;;;
+16836;BAMUM LETTER PHASE-A MOOMEUT;Lo;0;L;;;;;N;;;;;
+16837;BAMUM LETTER PHASE-A SHUM;Lo;0;L;;;;;N;;;;;
+16838;BAMUM LETTER PHASE-A LOMMAE;Lo;0;L;;;;;N;;;;;
+16839;BAMUM LETTER PHASE-A FIRI;Lo;0;L;;;;;N;;;;;
+1683A;BAMUM LETTER PHASE-A ROM;Lo;0;L;;;;;N;;;;;
+1683B;BAMUM LETTER PHASE-A KPOQ;Lo;0;L;;;;;N;;;;;
+1683C;BAMUM LETTER PHASE-A SOQ;Lo;0;L;;;;;N;;;;;
+1683D;BAMUM LETTER PHASE-A MAP PIEET;Lo;0;L;;;;;N;;;;;
+1683E;BAMUM LETTER PHASE-A SHIRAE;Lo;0;L;;;;;N;;;;;
+1683F;BAMUM LETTER PHASE-A NTAP;Lo;0;L;;;;;N;;;;;
+16840;BAMUM LETTER PHASE-A SHOQ NSHUT YUM;Lo;0;L;;;;;N;;;;;
+16841;BAMUM LETTER PHASE-A NYIT MONGKEUAEQ;Lo;0;L;;;;;N;;;;;
+16842;BAMUM LETTER PHASE-A PAARAE;Lo;0;L;;;;;N;;;;;
+16843;BAMUM LETTER PHASE-A NKAARAE;Lo;0;L;;;;;N;;;;;
+16844;BAMUM LETTER PHASE-A UNKNOWN;Lo;0;L;;;;;N;;;;;
+16845;BAMUM LETTER PHASE-A NGGEN;Lo;0;L;;;;;N;;;;;
+16846;BAMUM LETTER PHASE-A MAESI;Lo;0;L;;;;;N;;;;;
+16847;BAMUM LETTER PHASE-A NJAM;Lo;0;L;;;;;N;;;;;
+16848;BAMUM LETTER PHASE-A MBANYI;Lo;0;L;;;;;N;;;;;
+16849;BAMUM LETTER PHASE-A NYET;Lo;0;L;;;;;N;;;;;
+1684A;BAMUM LETTER PHASE-A TEUAEN;Lo;0;L;;;;;N;;;;;
+1684B;BAMUM LETTER PHASE-A SOT;Lo;0;L;;;;;N;;;;;
+1684C;BAMUM LETTER PHASE-A PAAM;Lo;0;L;;;;;N;;;;;
+1684D;BAMUM LETTER PHASE-A NSHIEE;Lo;0;L;;;;;N;;;;;
+1684E;BAMUM LETTER PHASE-A MAEM;Lo;0;L;;;;;N;;;;;
+1684F;BAMUM LETTER PHASE-A NYI;Lo;0;L;;;;;N;;;;;
+16850;BAMUM LETTER PHASE-A KAQ;Lo;0;L;;;;;N;;;;;
+16851;BAMUM LETTER PHASE-A NSHA;Lo;0;L;;;;;N;;;;;
+16852;BAMUM LETTER PHASE-A VEE;Lo;0;L;;;;;N;;;;;
+16853;BAMUM LETTER PHASE-A LU;Lo;0;L;;;;;N;;;;;
+16854;BAMUM LETTER PHASE-A NEN;Lo;0;L;;;;;N;;;;;
+16855;BAMUM LETTER PHASE-A NAQ;Lo;0;L;;;;;N;;;;;
+16856;BAMUM LETTER PHASE-A MBAQ;Lo;0;L;;;;;N;;;;;
+16857;BAMUM LETTER PHASE-B NSHUET;Lo;0;L;;;;;N;;;;;
+16858;BAMUM LETTER PHASE-B TU MAEMGBIEE;Lo;0;L;;;;;N;;;;;
+16859;BAMUM LETTER PHASE-B SIEE;Lo;0;L;;;;;N;;;;;
+1685A;BAMUM LETTER PHASE-B SET TU;Lo;0;L;;;;;N;;;;;
+1685B;BAMUM LETTER PHASE-B LOM NTEUM;Lo;0;L;;;;;N;;;;;
+1685C;BAMUM LETTER PHASE-B MBA MAELEE;Lo;0;L;;;;;N;;;;;
+1685D;BAMUM LETTER PHASE-B KIEEM;Lo;0;L;;;;;N;;;;;
+1685E;BAMUM LETTER PHASE-B YEURAE;Lo;0;L;;;;;N;;;;;
+1685F;BAMUM LETTER PHASE-B MBAARAE;Lo;0;L;;;;;N;;;;;
+16860;BAMUM LETTER PHASE-B KAM;Lo;0;L;;;;;N;;;;;
+16861;BAMUM LETTER PHASE-B PEESHI;Lo;0;L;;;;;N;;;;;
+16862;BAMUM LETTER PHASE-B YAFU LEERAEWA;Lo;0;L;;;;;N;;;;;
+16863;BAMUM LETTER PHASE-B LAM NSHUT NYAM;Lo;0;L;;;;;N;;;;;
+16864;BAMUM LETTER PHASE-B NTIEE SHEUOQ;Lo;0;L;;;;;N;;;;;
+16865;BAMUM LETTER PHASE-B NDU NJAA;Lo;0;L;;;;;N;;;;;
+16866;BAMUM LETTER PHASE-B GHEUGHEUAEM;Lo;0;L;;;;;N;;;;;
+16867;BAMUM LETTER PHASE-B PIT;Lo;0;L;;;;;N;;;;;
+16868;BAMUM LETTER PHASE-B TU NSIEE;Lo;0;L;;;;;N;;;;;
+16869;BAMUM LETTER PHASE-B SHET NJAQ;Lo;0;L;;;;;N;;;;;
+1686A;BAMUM LETTER PHASE-B SHEUAEQTU;Lo;0;L;;;;;N;;;;;
+1686B;BAMUM LETTER PHASE-B MFON TEUAEQ;Lo;0;L;;;;;N;;;;;
+1686C;BAMUM LETTER PHASE-B MBIT MBAAKET;Lo;0;L;;;;;N;;;;;
+1686D;BAMUM LETTER PHASE-B NYI NTEUM;Lo;0;L;;;;;N;;;;;
+1686E;BAMUM LETTER PHASE-B KEUPUQ;Lo;0;L;;;;;N;;;;;
+1686F;BAMUM LETTER PHASE-B GHEUGHEN;Lo;0;L;;;;;N;;;;;
+16870;BAMUM LETTER PHASE-B KEUYEUX;Lo;0;L;;;;;N;;;;;
+16871;BAMUM LETTER PHASE-B LAANAE;Lo;0;L;;;;;N;;;;;
+16872;BAMUM LETTER PHASE-B PARUM;Lo;0;L;;;;;N;;;;;
+16873;BAMUM LETTER PHASE-B VEUM;Lo;0;L;;;;;N;;;;;
+16874;BAMUM LETTER PHASE-B NGKINDI MVOP;Lo;0;L;;;;;N;;;;;
+16875;BAMUM LETTER PHASE-B NGGEU MBU;Lo;0;L;;;;;N;;;;;
+16876;BAMUM LETTER PHASE-B WUAET;Lo;0;L;;;;;N;;;;;
+16877;BAMUM LETTER PHASE-B SAKEUAE;Lo;0;L;;;;;N;;;;;
+16878;BAMUM LETTER PHASE-B TAAM;Lo;0;L;;;;;N;;;;;
+16879;BAMUM LETTER PHASE-B MEUQ;Lo;0;L;;;;;N;;;;;
+1687A;BAMUM LETTER PHASE-B NGGUOQ;Lo;0;L;;;;;N;;;;;
+1687B;BAMUM LETTER PHASE-B NGGUOQ LARGE;Lo;0;L;;;;;N;;;;;
+1687C;BAMUM LETTER PHASE-B MFIYAQ;Lo;0;L;;;;;N;;;;;
+1687D;BAMUM LETTER PHASE-B SUE;Lo;0;L;;;;;N;;;;;
+1687E;BAMUM LETTER PHASE-B MBEURI;Lo;0;L;;;;;N;;;;;
+1687F;BAMUM LETTER PHASE-B MONTIEEN;Lo;0;L;;;;;N;;;;;
+16880;BAMUM LETTER PHASE-B NYAEMAE;Lo;0;L;;;;;N;;;;;
+16881;BAMUM LETTER PHASE-B PUNGAAM;Lo;0;L;;;;;N;;;;;
+16882;BAMUM LETTER PHASE-B MEUT NGGEET;Lo;0;L;;;;;N;;;;;
+16883;BAMUM LETTER PHASE-B FEUX;Lo;0;L;;;;;N;;;;;
+16884;BAMUM LETTER PHASE-B MBUOQ;Lo;0;L;;;;;N;;;;;
+16885;BAMUM LETTER PHASE-B FEE;Lo;0;L;;;;;N;;;;;
+16886;BAMUM LETTER PHASE-B KEUAEM;Lo;0;L;;;;;N;;;;;
+16887;BAMUM LETTER PHASE-B MA NJEUAENA;Lo;0;L;;;;;N;;;;;
+16888;BAMUM LETTER PHASE-B MA NJUQA;Lo;0;L;;;;;N;;;;;
+16889;BAMUM LETTER PHASE-B LET;Lo;0;L;;;;;N;;;;;
+1688A;BAMUM LETTER PHASE-B NGGAAM;Lo;0;L;;;;;N;;;;;
+1688B;BAMUM LETTER PHASE-B NSEN;Lo;0;L;;;;;N;;;;;
+1688C;BAMUM LETTER PHASE-B MA;Lo;0;L;;;;;N;;;;;
+1688D;BAMUM LETTER PHASE-B KIQ;Lo;0;L;;;;;N;;;;;
+1688E;BAMUM LETTER PHASE-B NGOM;Lo;0;L;;;;;N;;;;;
+1688F;BAMUM LETTER PHASE-C NGKUE MAEMBA;Lo;0;L;;;;;N;;;;;
+16890;BAMUM LETTER PHASE-C NZA;Lo;0;L;;;;;N;;;;;
+16891;BAMUM LETTER PHASE-C YUM;Lo;0;L;;;;;N;;;;;
+16892;BAMUM LETTER PHASE-C WANGKUOQ;Lo;0;L;;;;;N;;;;;
+16893;BAMUM LETTER PHASE-C NGGEN;Lo;0;L;;;;;N;;;;;
+16894;BAMUM LETTER PHASE-C NDEUAEREE;Lo;0;L;;;;;N;;;;;
+16895;BAMUM LETTER PHASE-C NGKAQ;Lo;0;L;;;;;N;;;;;
+16896;BAMUM LETTER PHASE-C GHARAE;Lo;0;L;;;;;N;;;;;
+16897;BAMUM LETTER PHASE-C MBEEKEET;Lo;0;L;;;;;N;;;;;
+16898;BAMUM LETTER PHASE-C GBAYI;Lo;0;L;;;;;N;;;;;
+16899;BAMUM LETTER PHASE-C NYIR MKPARAQ MEUN;Lo;0;L;;;;;N;;;;;
+1689A;BAMUM LETTER PHASE-C NTU MBIT;Lo;0;L;;;;;N;;;;;
+1689B;BAMUM LETTER PHASE-C MBEUM;Lo;0;L;;;;;N;;;;;
+1689C;BAMUM LETTER PHASE-C PIRIEEN;Lo;0;L;;;;;N;;;;;
+1689D;BAMUM LETTER PHASE-C NDOMBU;Lo;0;L;;;;;N;;;;;
+1689E;BAMUM LETTER PHASE-C MBAA CABBAGE-TREE;Lo;0;L;;;;;N;;;;;
+1689F;BAMUM LETTER PHASE-C KEUSHEUAEP;Lo;0;L;;;;;N;;;;;
+168A0;BAMUM LETTER PHASE-C GHAP;Lo;0;L;;;;;N;;;;;
+168A1;BAMUM LETTER PHASE-C KEUKAQ;Lo;0;L;;;;;N;;;;;
+168A2;BAMUM LETTER PHASE-C YU MUOMAE;Lo;0;L;;;;;N;;;;;
+168A3;BAMUM LETTER PHASE-C NZEUM;Lo;0;L;;;;;N;;;;;
+168A4;BAMUM LETTER PHASE-C MBUE;Lo;0;L;;;;;N;;;;;
+168A5;BAMUM LETTER PHASE-C NSEUAEN;Lo;0;L;;;;;N;;;;;
+168A6;BAMUM LETTER PHASE-C MBIT;Lo;0;L;;;;;N;;;;;
+168A7;BAMUM LETTER PHASE-C YEUQ;Lo;0;L;;;;;N;;;;;
+168A8;BAMUM LETTER PHASE-C KPARAQ;Lo;0;L;;;;;N;;;;;
+168A9;BAMUM LETTER PHASE-C KAA;Lo;0;L;;;;;N;;;;;
+168AA;BAMUM LETTER PHASE-C SEUX;Lo;0;L;;;;;N;;;;;
+168AB;BAMUM LETTER PHASE-C NDIDA;Lo;0;L;;;;;N;;;;;
+168AC;BAMUM LETTER PHASE-C TAASHAE;Lo;0;L;;;;;N;;;;;
+168AD;BAMUM LETTER PHASE-C NJUEQ;Lo;0;L;;;;;N;;;;;
+168AE;BAMUM LETTER PHASE-C TITA YUE;Lo;0;L;;;;;N;;;;;
+168AF;BAMUM LETTER PHASE-C SUAET;Lo;0;L;;;;;N;;;;;
+168B0;BAMUM LETTER PHASE-C NGGUAEN NYAM;Lo;0;L;;;;;N;;;;;
+168B1;BAMUM LETTER PHASE-C VEUX;Lo;0;L;;;;;N;;;;;
+168B2;BAMUM LETTER PHASE-C NANSANAQ;Lo;0;L;;;;;N;;;;;
+168B3;BAMUM LETTER PHASE-C MA KEUAERI;Lo;0;L;;;;;N;;;;;
+168B4;BAMUM LETTER PHASE-C NTAA;Lo;0;L;;;;;N;;;;;
+168B5;BAMUM LETTER PHASE-C NGGUON;Lo;0;L;;;;;N;;;;;
+168B6;BAMUM LETTER PHASE-C LAP;Lo;0;L;;;;;N;;;;;
+168B7;BAMUM LETTER PHASE-C MBIRIEEN;Lo;0;L;;;;;N;;;;;
+168B8;BAMUM LETTER PHASE-C MGBASAQ;Lo;0;L;;;;;N;;;;;
+168B9;BAMUM LETTER PHASE-C NTEUNGBA;Lo;0;L;;;;;N;;;;;
+168BA;BAMUM LETTER PHASE-C TEUTEUX;Lo;0;L;;;;;N;;;;;
+168BB;BAMUM LETTER PHASE-C NGGUM;Lo;0;L;;;;;N;;;;;
+168BC;BAMUM LETTER PHASE-C FUE;Lo;0;L;;;;;N;;;;;
+168BD;BAMUM LETTER PHASE-C NDEUT;Lo;0;L;;;;;N;;;;;
+168BE;BAMUM LETTER PHASE-C NSA;Lo;0;L;;;;;N;;;;;
+168BF;BAMUM LETTER PHASE-C NSHAQ;Lo;0;L;;;;;N;;;;;
+168C0;BAMUM LETTER PHASE-C BUNG;Lo;0;L;;;;;N;;;;;
+168C1;BAMUM LETTER PHASE-C VEUAEPEN;Lo;0;L;;;;;N;;;;;
+168C2;BAMUM LETTER PHASE-C MBERAE;Lo;0;L;;;;;N;;;;;
+168C3;BAMUM LETTER PHASE-C RU;Lo;0;L;;;;;N;;;;;
+168C4;BAMUM LETTER PHASE-C NJAEM;Lo;0;L;;;;;N;;;;;
+168C5;BAMUM LETTER PHASE-C LAM;Lo;0;L;;;;;N;;;;;
+168C6;BAMUM LETTER PHASE-C TITUAEP;Lo;0;L;;;;;N;;;;;
+168C7;BAMUM LETTER PHASE-C NSUOT NGOM;Lo;0;L;;;;;N;;;;;
+168C8;BAMUM LETTER PHASE-C NJEEEE;Lo;0;L;;;;;N;;;;;
+168C9;BAMUM LETTER PHASE-C KET;Lo;0;L;;;;;N;;;;;
+168CA;BAMUM LETTER PHASE-C NGGU;Lo;0;L;;;;;N;;;;;
+168CB;BAMUM LETTER PHASE-C MAESI;Lo;0;L;;;;;N;;;;;
+168CC;BAMUM LETTER PHASE-C MBUAEM;Lo;0;L;;;;;N;;;;;
+168CD;BAMUM LETTER PHASE-C LU;Lo;0;L;;;;;N;;;;;
+168CE;BAMUM LETTER PHASE-C KUT;Lo;0;L;;;;;N;;;;;
+168CF;BAMUM LETTER PHASE-C NJAM;Lo;0;L;;;;;N;;;;;
+168D0;BAMUM LETTER PHASE-C NGOM;Lo;0;L;;;;;N;;;;;
+168D1;BAMUM LETTER PHASE-C WUP;Lo;0;L;;;;;N;;;;;
+168D2;BAMUM LETTER PHASE-C NGGUEET;Lo;0;L;;;;;N;;;;;
+168D3;BAMUM LETTER PHASE-C NSOM;Lo;0;L;;;;;N;;;;;
+168D4;BAMUM LETTER PHASE-C NTEN;Lo;0;L;;;;;N;;;;;
+168D5;BAMUM LETTER PHASE-C KUOP NKAARAE;Lo;0;L;;;;;N;;;;;
+168D6;BAMUM LETTER PHASE-C NSUN;Lo;0;L;;;;;N;;;;;
+168D7;BAMUM LETTER PHASE-C NDAM;Lo;0;L;;;;;N;;;;;
+168D8;BAMUM LETTER PHASE-C MA NSIEE;Lo;0;L;;;;;N;;;;;
+168D9;BAMUM LETTER PHASE-C YAA;Lo;0;L;;;;;N;;;;;
+168DA;BAMUM LETTER PHASE-C NDAP;Lo;0;L;;;;;N;;;;;
+168DB;BAMUM LETTER PHASE-C SHUEQ;Lo;0;L;;;;;N;;;;;
+168DC;BAMUM LETTER PHASE-C SETFON;Lo;0;L;;;;;N;;;;;
+168DD;BAMUM LETTER PHASE-C MBI;Lo;0;L;;;;;N;;;;;
+168DE;BAMUM LETTER PHASE-C MAEMBA;Lo;0;L;;;;;N;;;;;
+168DF;BAMUM LETTER PHASE-C MBANYI;Lo;0;L;;;;;N;;;;;
+168E0;BAMUM LETTER PHASE-C KEUSEUX;Lo;0;L;;;;;N;;;;;
+168E1;BAMUM LETTER PHASE-C MBEUX;Lo;0;L;;;;;N;;;;;
+168E2;BAMUM LETTER PHASE-C KEUM;Lo;0;L;;;;;N;;;;;
+168E3;BAMUM LETTER PHASE-C MBAA PICKET;Lo;0;L;;;;;N;;;;;
+168E4;BAMUM LETTER PHASE-C YUWOQ;Lo;0;L;;;;;N;;;;;
+168E5;BAMUM LETTER PHASE-C NJEUX;Lo;0;L;;;;;N;;;;;
+168E6;BAMUM LETTER PHASE-C MIEE;Lo;0;L;;;;;N;;;;;
+168E7;BAMUM LETTER PHASE-C MUAE;Lo;0;L;;;;;N;;;;;
+168E8;BAMUM LETTER PHASE-C SHIQ;Lo;0;L;;;;;N;;;;;
+168E9;BAMUM LETTER PHASE-C KEN LAW;Lo;0;L;;;;;N;;;;;
+168EA;BAMUM LETTER PHASE-C KEN FATIGUE;Lo;0;L;;;;;N;;;;;
+168EB;BAMUM LETTER PHASE-C NGAQ;Lo;0;L;;;;;N;;;;;
+168EC;BAMUM LETTER PHASE-C NAQ;Lo;0;L;;;;;N;;;;;
+168ED;BAMUM LETTER PHASE-C LIQ;Lo;0;L;;;;;N;;;;;
+168EE;BAMUM LETTER PHASE-C PIN;Lo;0;L;;;;;N;;;;;
+168EF;BAMUM LETTER PHASE-C PEN;Lo;0;L;;;;;N;;;;;
+168F0;BAMUM LETTER PHASE-C TET;Lo;0;L;;;;;N;;;;;
+168F1;BAMUM LETTER PHASE-D MBUO;Lo;0;L;;;;;N;;;;;
+168F2;BAMUM LETTER PHASE-D WAP;Lo;0;L;;;;;N;;;;;
+168F3;BAMUM LETTER PHASE-D NJI;Lo;0;L;;;;;N;;;;;
+168F4;BAMUM LETTER PHASE-D MFON;Lo;0;L;;;;;N;;;;;
+168F5;BAMUM LETTER PHASE-D NJIEE;Lo;0;L;;;;;N;;;;;
+168F6;BAMUM LETTER PHASE-D LIEE;Lo;0;L;;;;;N;;;;;
+168F7;BAMUM LETTER PHASE-D NJEUT;Lo;0;L;;;;;N;;;;;
+168F8;BAMUM LETTER PHASE-D NSHEE;Lo;0;L;;;;;N;;;;;
+168F9;BAMUM LETTER PHASE-D NGGAAMAE;Lo;0;L;;;;;N;;;;;
+168FA;BAMUM LETTER PHASE-D NYAM;Lo;0;L;;;;;N;;;;;
+168FB;BAMUM LETTER PHASE-D WUAEN;Lo;0;L;;;;;N;;;;;
+168FC;BAMUM LETTER PHASE-D NGKUN;Lo;0;L;;;;;N;;;;;
+168FD;BAMUM LETTER PHASE-D SHEE;Lo;0;L;;;;;N;;;;;
+168FE;BAMUM LETTER PHASE-D NGKAP;Lo;0;L;;;;;N;;;;;
+168FF;BAMUM LETTER PHASE-D KEUAETMEUN;Lo;0;L;;;;;N;;;;;
+16900;BAMUM LETTER PHASE-D TEUT;Lo;0;L;;;;;N;;;;;
+16901;BAMUM LETTER PHASE-D SHEUAE;Lo;0;L;;;;;N;;;;;
+16902;BAMUM LETTER PHASE-D NJAP;Lo;0;L;;;;;N;;;;;
+16903;BAMUM LETTER PHASE-D SUE;Lo;0;L;;;;;N;;;;;
+16904;BAMUM LETTER PHASE-D KET;Lo;0;L;;;;;N;;;;;
+16905;BAMUM LETTER PHASE-D YAEMMAE;Lo;0;L;;;;;N;;;;;
+16906;BAMUM LETTER PHASE-D KUOM;Lo;0;L;;;;;N;;;;;
+16907;BAMUM LETTER PHASE-D SAP;Lo;0;L;;;;;N;;;;;
+16908;BAMUM LETTER PHASE-D MFEUT;Lo;0;L;;;;;N;;;;;
+16909;BAMUM LETTER PHASE-D NDEUX;Lo;0;L;;;;;N;;;;;
+1690A;BAMUM LETTER PHASE-D MALEERI;Lo;0;L;;;;;N;;;;;
+1690B;BAMUM LETTER PHASE-D MEUT;Lo;0;L;;;;;N;;;;;
+1690C;BAMUM LETTER PHASE-D SEUAEQ;Lo;0;L;;;;;N;;;;;
+1690D;BAMUM LETTER PHASE-D YEN;Lo;0;L;;;;;N;;;;;
+1690E;BAMUM LETTER PHASE-D NJEUAEM;Lo;0;L;;;;;N;;;;;
+1690F;BAMUM LETTER PHASE-D KEUOT MBUAE;Lo;0;L;;;;;N;;;;;
+16910;BAMUM LETTER PHASE-D NGKEURI;Lo;0;L;;;;;N;;;;;
+16911;BAMUM LETTER PHASE-D TU;Lo;0;L;;;;;N;;;;;
+16912;BAMUM LETTER PHASE-D GHAA;Lo;0;L;;;;;N;;;;;
+16913;BAMUM LETTER PHASE-D NGKYEE;Lo;0;L;;;;;N;;;;;
+16914;BAMUM LETTER PHASE-D FEUFEUAET;Lo;0;L;;;;;N;;;;;
+16915;BAMUM LETTER PHASE-D NDEE;Lo;0;L;;;;;N;;;;;
+16916;BAMUM LETTER PHASE-D MGBOFUM;Lo;0;L;;;;;N;;;;;
+16917;BAMUM LETTER PHASE-D LEUAEP;Lo;0;L;;;;;N;;;;;
+16918;BAMUM LETTER PHASE-D NDON;Lo;0;L;;;;;N;;;;;
+16919;BAMUM LETTER PHASE-D MONI;Lo;0;L;;;;;N;;;;;
+1691A;BAMUM LETTER PHASE-D MGBEUN;Lo;0;L;;;;;N;;;;;
+1691B;BAMUM LETTER PHASE-D PUUT;Lo;0;L;;;;;N;;;;;
+1691C;BAMUM LETTER PHASE-D MGBIEE;Lo;0;L;;;;;N;;;;;
+1691D;BAMUM LETTER PHASE-D MFO;Lo;0;L;;;;;N;;;;;
+1691E;BAMUM LETTER PHASE-D LUM;Lo;0;L;;;;;N;;;;;
+1691F;BAMUM LETTER PHASE-D NSIEEP;Lo;0;L;;;;;N;;;;;
+16920;BAMUM LETTER PHASE-D MBAA;Lo;0;L;;;;;N;;;;;
+16921;BAMUM LETTER PHASE-D KWAET;Lo;0;L;;;;;N;;;;;
+16922;BAMUM LETTER PHASE-D NYET;Lo;0;L;;;;;N;;;;;
+16923;BAMUM LETTER PHASE-D TEUAEN;Lo;0;L;;;;;N;;;;;
+16924;BAMUM LETTER PHASE-D SOT;Lo;0;L;;;;;N;;;;;
+16925;BAMUM LETTER PHASE-D YUWOQ;Lo;0;L;;;;;N;;;;;
+16926;BAMUM LETTER PHASE-D KEUM;Lo;0;L;;;;;N;;;;;
+16927;BAMUM LETTER PHASE-D RAEM;Lo;0;L;;;;;N;;;;;
+16928;BAMUM LETTER PHASE-D TEEEE;Lo;0;L;;;;;N;;;;;
+16929;BAMUM LETTER PHASE-D NGKEUAEQ;Lo;0;L;;;;;N;;;;;
+1692A;BAMUM LETTER PHASE-D MFEUAE;Lo;0;L;;;;;N;;;;;
+1692B;BAMUM LETTER PHASE-D NSIEET;Lo;0;L;;;;;N;;;;;
+1692C;BAMUM LETTER PHASE-D KEUP;Lo;0;L;;;;;N;;;;;
+1692D;BAMUM LETTER PHASE-D PIP;Lo;0;L;;;;;N;;;;;
+1692E;BAMUM LETTER PHASE-D PEUTAE;Lo;0;L;;;;;N;;;;;
+1692F;BAMUM LETTER PHASE-D NYUE;Lo;0;L;;;;;N;;;;;
+16930;BAMUM LETTER PHASE-D LET;Lo;0;L;;;;;N;;;;;
+16931;BAMUM LETTER PHASE-D NGGAAM;Lo;0;L;;;;;N;;;;;
+16932;BAMUM LETTER PHASE-D MFIEE;Lo;0;L;;;;;N;;;;;
+16933;BAMUM LETTER PHASE-D NGGWAEN;Lo;0;L;;;;;N;;;;;
+16934;BAMUM LETTER PHASE-D YUOM;Lo;0;L;;;;;N;;;;;
+16935;BAMUM LETTER PHASE-D PAP;Lo;0;L;;;;;N;;;;;
+16936;BAMUM LETTER PHASE-D YUOP;Lo;0;L;;;;;N;;;;;
+16937;BAMUM LETTER PHASE-D NDAM;Lo;0;L;;;;;N;;;;;
+16938;BAMUM LETTER PHASE-D NTEUM;Lo;0;L;;;;;N;;;;;
+16939;BAMUM LETTER PHASE-D SUAE;Lo;0;L;;;;;N;;;;;
+1693A;BAMUM LETTER PHASE-D KUN;Lo;0;L;;;;;N;;;;;
+1693B;BAMUM LETTER PHASE-D NGGEUX;Lo;0;L;;;;;N;;;;;
+1693C;BAMUM LETTER PHASE-D NGKIEE;Lo;0;L;;;;;N;;;;;
+1693D;BAMUM LETTER PHASE-D TUOT;Lo;0;L;;;;;N;;;;;
+1693E;BAMUM LETTER PHASE-D MEUN;Lo;0;L;;;;;N;;;;;
+1693F;BAMUM LETTER PHASE-D KUQ;Lo;0;L;;;;;N;;;;;
+16940;BAMUM LETTER PHASE-D NSUM;Lo;0;L;;;;;N;;;;;
+16941;BAMUM LETTER PHASE-D TEUN;Lo;0;L;;;;;N;;;;;
+16942;BAMUM LETTER PHASE-D MAENJET;Lo;0;L;;;;;N;;;;;
+16943;BAMUM LETTER PHASE-D NGGAP;Lo;0;L;;;;;N;;;;;
+16944;BAMUM LETTER PHASE-D LEUM;Lo;0;L;;;;;N;;;;;
+16945;BAMUM LETTER PHASE-D NGGUOM;Lo;0;L;;;;;N;;;;;
+16946;BAMUM LETTER PHASE-D NSHUT;Lo;0;L;;;;;N;;;;;
+16947;BAMUM LETTER PHASE-D NJUEQ;Lo;0;L;;;;;N;;;;;
+16948;BAMUM LETTER PHASE-D GHEUAE;Lo;0;L;;;;;N;;;;;
+16949;BAMUM LETTER PHASE-D KU;Lo;0;L;;;;;N;;;;;
+1694A;BAMUM LETTER PHASE-D REN OLD;Lo;0;L;;;;;N;;;;;
+1694B;BAMUM LETTER PHASE-D TAE;Lo;0;L;;;;;N;;;;;
+1694C;BAMUM LETTER PHASE-D TOQ;Lo;0;L;;;;;N;;;;;
+1694D;BAMUM LETTER PHASE-D NYI;Lo;0;L;;;;;N;;;;;
+1694E;BAMUM LETTER PHASE-D RII;Lo;0;L;;;;;N;;;;;
+1694F;BAMUM LETTER PHASE-D LEEEE;Lo;0;L;;;;;N;;;;;
+16950;BAMUM LETTER PHASE-D MEEEE;Lo;0;L;;;;;N;;;;;
+16951;BAMUM LETTER PHASE-D M;Lo;0;L;;;;;N;;;;;
+16952;BAMUM LETTER PHASE-D SUU;Lo;0;L;;;;;N;;;;;
+16953;BAMUM LETTER PHASE-D MU;Lo;0;L;;;;;N;;;;;
+16954;BAMUM LETTER PHASE-D SHII;Lo;0;L;;;;;N;;;;;
+16955;BAMUM LETTER PHASE-D SHEUX;Lo;0;L;;;;;N;;;;;
+16956;BAMUM LETTER PHASE-D KYEE;Lo;0;L;;;;;N;;;;;
+16957;BAMUM LETTER PHASE-D NU;Lo;0;L;;;;;N;;;;;
+16958;BAMUM LETTER PHASE-D SHU;Lo;0;L;;;;;N;;;;;
+16959;BAMUM LETTER PHASE-D NTEE;Lo;0;L;;;;;N;;;;;
+1695A;BAMUM LETTER PHASE-D PEE;Lo;0;L;;;;;N;;;;;
+1695B;BAMUM LETTER PHASE-D NI;Lo;0;L;;;;;N;;;;;
+1695C;BAMUM LETTER PHASE-D SHOQ;Lo;0;L;;;;;N;;;;;
+1695D;BAMUM LETTER PHASE-D PUQ;Lo;0;L;;;;;N;;;;;
+1695E;BAMUM LETTER PHASE-D MVOP;Lo;0;L;;;;;N;;;;;
+1695F;BAMUM LETTER PHASE-D LOQ;Lo;0;L;;;;;N;;;;;
+16960;BAMUM LETTER PHASE-D REN MUCH;Lo;0;L;;;;;N;;;;;
+16961;BAMUM LETTER PHASE-D TI;Lo;0;L;;;;;N;;;;;
+16962;BAMUM LETTER PHASE-D NTUU;Lo;0;L;;;;;N;;;;;
+16963;BAMUM LETTER PHASE-D MBAA SEVEN;Lo;0;L;;;;;N;;;;;
+16964;BAMUM LETTER PHASE-D SAQ;Lo;0;L;;;;;N;;;;;
+16965;BAMUM LETTER PHASE-D FAA;Lo;0;L;;;;;N;;;;;
+16966;BAMUM LETTER PHASE-E NDAP;Lo;0;L;;;;;N;;;;;
+16967;BAMUM LETTER PHASE-E TOON;Lo;0;L;;;;;N;;;;;
+16968;BAMUM LETTER PHASE-E MBEUM;Lo;0;L;;;;;N;;;;;
+16969;BAMUM LETTER PHASE-E LAP;Lo;0;L;;;;;N;;;;;
+1696A;BAMUM LETTER PHASE-E VOM;Lo;0;L;;;;;N;;;;;
+1696B;BAMUM LETTER PHASE-E LOON;Lo;0;L;;;;;N;;;;;
+1696C;BAMUM LETTER PHASE-E PAA;Lo;0;L;;;;;N;;;;;
+1696D;BAMUM LETTER PHASE-E SOM;Lo;0;L;;;;;N;;;;;
+1696E;BAMUM LETTER PHASE-E RAQ;Lo;0;L;;;;;N;;;;;
+1696F;BAMUM LETTER PHASE-E NSHUOP;Lo;0;L;;;;;N;;;;;
+16970;BAMUM LETTER PHASE-E NDUN;Lo;0;L;;;;;N;;;;;
+16971;BAMUM LETTER PHASE-E PUAE;Lo;0;L;;;;;N;;;;;
+16972;BAMUM LETTER PHASE-E TAM;Lo;0;L;;;;;N;;;;;
+16973;BAMUM LETTER PHASE-E NGKA;Lo;0;L;;;;;N;;;;;
+16974;BAMUM LETTER PHASE-E KPEUX;Lo;0;L;;;;;N;;;;;
+16975;BAMUM LETTER PHASE-E WUO;Lo;0;L;;;;;N;;;;;
+16976;BAMUM LETTER PHASE-E SEE;Lo;0;L;;;;;N;;;;;
+16977;BAMUM LETTER PHASE-E NGGEUAET;Lo;0;L;;;;;N;;;;;
+16978;BAMUM LETTER PHASE-E PAAM;Lo;0;L;;;;;N;;;;;
+16979;BAMUM LETTER PHASE-E TOO;Lo;0;L;;;;;N;;;;;
+1697A;BAMUM LETTER PHASE-E KUOP;Lo;0;L;;;;;N;;;;;
+1697B;BAMUM LETTER PHASE-E LOM;Lo;0;L;;;;;N;;;;;
+1697C;BAMUM LETTER PHASE-E NSHIEE;Lo;0;L;;;;;N;;;;;
+1697D;BAMUM LETTER PHASE-E NGOP;Lo;0;L;;;;;N;;;;;
+1697E;BAMUM LETTER PHASE-E MAEM;Lo;0;L;;;;;N;;;;;
+1697F;BAMUM LETTER PHASE-E NGKEUX;Lo;0;L;;;;;N;;;;;
+16980;BAMUM LETTER PHASE-E NGOQ;Lo;0;L;;;;;N;;;;;
+16981;BAMUM LETTER PHASE-E NSHUE;Lo;0;L;;;;;N;;;;;
+16982;BAMUM LETTER PHASE-E RIMGBA;Lo;0;L;;;;;N;;;;;
+16983;BAMUM LETTER PHASE-E NJEUX;Lo;0;L;;;;;N;;;;;
+16984;BAMUM LETTER PHASE-E PEEM;Lo;0;L;;;;;N;;;;;
+16985;BAMUM LETTER PHASE-E SAA;Lo;0;L;;;;;N;;;;;
+16986;BAMUM LETTER PHASE-E NGGURAE;Lo;0;L;;;;;N;;;;;
+16987;BAMUM LETTER PHASE-E MGBA;Lo;0;L;;;;;N;;;;;
+16988;BAMUM LETTER PHASE-E GHEUX;Lo;0;L;;;;;N;;;;;
+16989;BAMUM LETTER PHASE-E NGKEUAEM;Lo;0;L;;;;;N;;;;;
+1698A;BAMUM LETTER PHASE-E NJAEMLI;Lo;0;L;;;;;N;;;;;
+1698B;BAMUM LETTER PHASE-E MAP;Lo;0;L;;;;;N;;;;;
+1698C;BAMUM LETTER PHASE-E LOOT;Lo;0;L;;;;;N;;;;;
+1698D;BAMUM LETTER PHASE-E NGGEEEE;Lo;0;L;;;;;N;;;;;
+1698E;BAMUM LETTER PHASE-E NDIQ;Lo;0;L;;;;;N;;;;;
+1698F;BAMUM LETTER PHASE-E TAEN NTEUM;Lo;0;L;;;;;N;;;;;
+16990;BAMUM LETTER PHASE-E SET;Lo;0;L;;;;;N;;;;;
+16991;BAMUM LETTER PHASE-E PUM;Lo;0;L;;;;;N;;;;;
+16992;BAMUM LETTER PHASE-E NDAA SOFTNESS;Lo;0;L;;;;;N;;;;;
+16993;BAMUM LETTER PHASE-E NGGUAESHAE NYAM;Lo;0;L;;;;;N;;;;;
+16994;BAMUM LETTER PHASE-E YIEE;Lo;0;L;;;;;N;;;;;
+16995;BAMUM LETTER PHASE-E GHEUN;Lo;0;L;;;;;N;;;;;
+16996;BAMUM LETTER PHASE-E TUAE;Lo;0;L;;;;;N;;;;;
+16997;BAMUM LETTER PHASE-E YEUAE;Lo;0;L;;;;;N;;;;;
+16998;BAMUM LETTER PHASE-E PO;Lo;0;L;;;;;N;;;;;
+16999;BAMUM LETTER PHASE-E TUMAE;Lo;0;L;;;;;N;;;;;
+1699A;BAMUM LETTER PHASE-E KEUAE;Lo;0;L;;;;;N;;;;;
+1699B;BAMUM LETTER PHASE-E SUAEN;Lo;0;L;;;;;N;;;;;
+1699C;BAMUM LETTER PHASE-E TEUAEQ;Lo;0;L;;;;;N;;;;;
+1699D;BAMUM LETTER PHASE-E VEUAE;Lo;0;L;;;;;N;;;;;
+1699E;BAMUM LETTER PHASE-E WEUX;Lo;0;L;;;;;N;;;;;
+1699F;BAMUM LETTER PHASE-E LAAM;Lo;0;L;;;;;N;;;;;
+169A0;BAMUM LETTER PHASE-E PU;Lo;0;L;;;;;N;;;;;
+169A1;BAMUM LETTER PHASE-E TAAQ;Lo;0;L;;;;;N;;;;;
+169A2;BAMUM LETTER PHASE-E GHAAMAE;Lo;0;L;;;;;N;;;;;
+169A3;BAMUM LETTER PHASE-E NGEUREUT;Lo;0;L;;;;;N;;;;;
+169A4;BAMUM LETTER PHASE-E SHEUAEQ;Lo;0;L;;;;;N;;;;;
+169A5;BAMUM LETTER PHASE-E MGBEN;Lo;0;L;;;;;N;;;;;
+169A6;BAMUM LETTER PHASE-E MBEE;Lo;0;L;;;;;N;;;;;
+169A7;BAMUM LETTER PHASE-E NZAQ;Lo;0;L;;;;;N;;;;;
+169A8;BAMUM LETTER PHASE-E NKOM;Lo;0;L;;;;;N;;;;;
+169A9;BAMUM LETTER PHASE-E GBET;Lo;0;L;;;;;N;;;;;
+169AA;BAMUM LETTER PHASE-E TUM;Lo;0;L;;;;;N;;;;;
+169AB;BAMUM LETTER PHASE-E KUET;Lo;0;L;;;;;N;;;;;
+169AC;BAMUM LETTER PHASE-E YAP;Lo;0;L;;;;;N;;;;;
+169AD;BAMUM LETTER PHASE-E NYI CLEAVER;Lo;0;L;;;;;N;;;;;
+169AE;BAMUM LETTER PHASE-E YIT;Lo;0;L;;;;;N;;;;;
+169AF;BAMUM LETTER PHASE-E MFEUQ;Lo;0;L;;;;;N;;;;;
+169B0;BAMUM LETTER PHASE-E NDIAQ;Lo;0;L;;;;;N;;;;;
+169B1;BAMUM LETTER PHASE-E PIEEQ;Lo;0;L;;;;;N;;;;;
+169B2;BAMUM LETTER PHASE-E YUEQ;Lo;0;L;;;;;N;;;;;
+169B3;BAMUM LETTER PHASE-E LEUAEM;Lo;0;L;;;;;N;;;;;
+169B4;BAMUM LETTER PHASE-E FUE;Lo;0;L;;;;;N;;;;;
+169B5;BAMUM LETTER PHASE-E GBEUX;Lo;0;L;;;;;N;;;;;
+169B6;BAMUM LETTER PHASE-E NGKUP;Lo;0;L;;;;;N;;;;;
+169B7;BAMUM LETTER PHASE-E KET;Lo;0;L;;;;;N;;;;;
+169B8;BAMUM LETTER PHASE-E MAE;Lo;0;L;;;;;N;;;;;
+169B9;BAMUM LETTER PHASE-E NGKAAMI;Lo;0;L;;;;;N;;;;;
+169BA;BAMUM LETTER PHASE-E GHET;Lo;0;L;;;;;N;;;;;
+169BB;BAMUM LETTER PHASE-E FA;Lo;0;L;;;;;N;;;;;
+169BC;BAMUM LETTER PHASE-E NTUM;Lo;0;L;;;;;N;;;;;
+169BD;BAMUM LETTER PHASE-E PEUT;Lo;0;L;;;;;N;;;;;
+169BE;BAMUM LETTER PHASE-E YEUM;Lo;0;L;;;;;N;;;;;
+169BF;BAMUM LETTER PHASE-E NGGEUAE;Lo;0;L;;;;;N;;;;;
+169C0;BAMUM LETTER PHASE-E NYI BETWEEN;Lo;0;L;;;;;N;;;;;
+169C1;BAMUM LETTER PHASE-E NZUQ;Lo;0;L;;;;;N;;;;;
+169C2;BAMUM LETTER PHASE-E POON;Lo;0;L;;;;;N;;;;;
+169C3;BAMUM LETTER PHASE-E MIEE;Lo;0;L;;;;;N;;;;;
+169C4;BAMUM LETTER PHASE-E FUET;Lo;0;L;;;;;N;;;;;
+169C5;BAMUM LETTER PHASE-E NAE;Lo;0;L;;;;;N;;;;;
+169C6;BAMUM LETTER PHASE-E MUAE;Lo;0;L;;;;;N;;;;;
+169C7;BAMUM LETTER PHASE-E GHEUAE;Lo;0;L;;;;;N;;;;;
+169C8;BAMUM LETTER PHASE-E FU I;Lo;0;L;;;;;N;;;;;
+169C9;BAMUM LETTER PHASE-E MVI;Lo;0;L;;;;;N;;;;;
+169CA;BAMUM LETTER PHASE-E PUAQ;Lo;0;L;;;;;N;;;;;
+169CB;BAMUM LETTER PHASE-E NGKUM;Lo;0;L;;;;;N;;;;;
+169CC;BAMUM LETTER PHASE-E KUT;Lo;0;L;;;;;N;;;;;
+169CD;BAMUM LETTER PHASE-E PIET;Lo;0;L;;;;;N;;;;;
+169CE;BAMUM LETTER PHASE-E NTAP;Lo;0;L;;;;;N;;;;;
+169CF;BAMUM LETTER PHASE-E YEUAET;Lo;0;L;;;;;N;;;;;
+169D0;BAMUM LETTER PHASE-E NGGUP;Lo;0;L;;;;;N;;;;;
+169D1;BAMUM LETTER PHASE-E PA PEOPLE;Lo;0;L;;;;;N;;;;;
+169D2;BAMUM LETTER PHASE-E FU CALL;Lo;0;L;;;;;N;;;;;
+169D3;BAMUM LETTER PHASE-E FOM;Lo;0;L;;;;;N;;;;;
+169D4;BAMUM LETTER PHASE-E NJEE;Lo;0;L;;;;;N;;;;;
+169D5;BAMUM LETTER PHASE-E A;Lo;0;L;;;;;N;;;;;
+169D6;BAMUM LETTER PHASE-E TOQ;Lo;0;L;;;;;N;;;;;
+169D7;BAMUM LETTER PHASE-E O;Lo;0;L;;;;;N;;;;;
+169D8;BAMUM LETTER PHASE-E I;Lo;0;L;;;;;N;;;;;
+169D9;BAMUM LETTER PHASE-E LAQ;Lo;0;L;;;;;N;;;;;
+169DA;BAMUM LETTER PHASE-E PA PLURAL;Lo;0;L;;;;;N;;;;;
+169DB;BAMUM LETTER PHASE-E TAA;Lo;0;L;;;;;N;;;;;
+169DC;BAMUM LETTER PHASE-E TAQ;Lo;0;L;;;;;N;;;;;
+169DD;BAMUM LETTER PHASE-E NDAA MY HOUSE;Lo;0;L;;;;;N;;;;;
+169DE;BAMUM LETTER PHASE-E SHIQ;Lo;0;L;;;;;N;;;;;
+169DF;BAMUM LETTER PHASE-E YEUX;Lo;0;L;;;;;N;;;;;
+169E0;BAMUM LETTER PHASE-E NGUAE;Lo;0;L;;;;;N;;;;;
+169E1;BAMUM LETTER PHASE-E YUAEN;Lo;0;L;;;;;N;;;;;
+169E2;BAMUM LETTER PHASE-E YOQ SWIMMING;Lo;0;L;;;;;N;;;;;
+169E3;BAMUM LETTER PHASE-E YOQ COVER;Lo;0;L;;;;;N;;;;;
+169E4;BAMUM LETTER PHASE-E YUQ;Lo;0;L;;;;;N;;;;;
+169E5;BAMUM LETTER PHASE-E YUN;Lo;0;L;;;;;N;;;;;
+169E6;BAMUM LETTER PHASE-E KEUX;Lo;0;L;;;;;N;;;;;
+169E7;BAMUM LETTER PHASE-E PEUX;Lo;0;L;;;;;N;;;;;
+169E8;BAMUM LETTER PHASE-E NJEE EPOCH;Lo;0;L;;;;;N;;;;;
+169E9;BAMUM LETTER PHASE-E PUE;Lo;0;L;;;;;N;;;;;
+169EA;BAMUM LETTER PHASE-E WUE;Lo;0;L;;;;;N;;;;;
+169EB;BAMUM LETTER PHASE-E FEE;Lo;0;L;;;;;N;;;;;
+169EC;BAMUM LETTER PHASE-E VEE;Lo;0;L;;;;;N;;;;;
+169ED;BAMUM LETTER PHASE-E LU;Lo;0;L;;;;;N;;;;;
+169EE;BAMUM LETTER PHASE-E MI;Lo;0;L;;;;;N;;;;;
+169EF;BAMUM LETTER PHASE-E REUX;Lo;0;L;;;;;N;;;;;
+169F0;BAMUM LETTER PHASE-E RAE;Lo;0;L;;;;;N;;;;;
+169F1;BAMUM LETTER PHASE-E NGUAET;Lo;0;L;;;;;N;;;;;
+169F2;BAMUM LETTER PHASE-E NGA;Lo;0;L;;;;;N;;;;;
+169F3;BAMUM LETTER PHASE-E SHO;Lo;0;L;;;;;N;;;;;
+169F4;BAMUM LETTER PHASE-E SHOQ;Lo;0;L;;;;;N;;;;;
+169F5;BAMUM LETTER PHASE-E FU REMEDY;Lo;0;L;;;;;N;;;;;
+169F6;BAMUM LETTER PHASE-E NA;Lo;0;L;;;;;N;;;;;
+169F7;BAMUM LETTER PHASE-E PI;Lo;0;L;;;;;N;;;;;
+169F8;BAMUM LETTER PHASE-E LOQ;Lo;0;L;;;;;N;;;;;
+169F9;BAMUM LETTER PHASE-E KO;Lo;0;L;;;;;N;;;;;
+169FA;BAMUM LETTER PHASE-E MEN;Lo;0;L;;;;;N;;;;;
+169FB;BAMUM LETTER PHASE-E MA;Lo;0;L;;;;;N;;;;;
+169FC;BAMUM LETTER PHASE-E MAQ;Lo;0;L;;;;;N;;;;;
+169FD;BAMUM LETTER PHASE-E TEU;Lo;0;L;;;;;N;;;;;
+169FE;BAMUM LETTER PHASE-E KI;Lo;0;L;;;;;N;;;;;
+169FF;BAMUM LETTER PHASE-E MON;Lo;0;L;;;;;N;;;;;
+16A00;BAMUM LETTER PHASE-E TEN;Lo;0;L;;;;;N;;;;;
+16A01;BAMUM LETTER PHASE-E FAQ;Lo;0;L;;;;;N;;;;;
+16A02;BAMUM LETTER PHASE-E GHOM;Lo;0;L;;;;;N;;;;;
+16A03;BAMUM LETTER PHASE-F KA;Lo;0;L;;;;;N;;;;;
+16A04;BAMUM LETTER PHASE-F U;Lo;0;L;;;;;N;;;;;
+16A05;BAMUM LETTER PHASE-F KU;Lo;0;L;;;;;N;;;;;
+16A06;BAMUM LETTER PHASE-F EE;Lo;0;L;;;;;N;;;;;
+16A07;BAMUM LETTER PHASE-F REE;Lo;0;L;;;;;N;;;;;
+16A08;BAMUM LETTER PHASE-F TAE;Lo;0;L;;;;;N;;;;;
+16A09;BAMUM LETTER PHASE-F NYI;Lo;0;L;;;;;N;;;;;
+16A0A;BAMUM LETTER PHASE-F LA;Lo;0;L;;;;;N;;;;;
+16A0B;BAMUM LETTER PHASE-F RII;Lo;0;L;;;;;N;;;;;
+16A0C;BAMUM LETTER PHASE-F RIEE;Lo;0;L;;;;;N;;;;;
+16A0D;BAMUM LETTER PHASE-F MEEEE;Lo;0;L;;;;;N;;;;;
+16A0E;BAMUM LETTER PHASE-F TAA;Lo;0;L;;;;;N;;;;;
+16A0F;BAMUM LETTER PHASE-F NDAA;Lo;0;L;;;;;N;;;;;
+16A10;BAMUM LETTER PHASE-F NJAEM;Lo;0;L;;;;;N;;;;;
+16A11;BAMUM LETTER PHASE-F M;Lo;0;L;;;;;N;;;;;
+16A12;BAMUM LETTER PHASE-F SUU;Lo;0;L;;;;;N;;;;;
+16A13;BAMUM LETTER PHASE-F SHII;Lo;0;L;;;;;N;;;;;
+16A14;BAMUM LETTER PHASE-F SI;Lo;0;L;;;;;N;;;;;
+16A15;BAMUM LETTER PHASE-F SEUX;Lo;0;L;;;;;N;;;;;
+16A16;BAMUM LETTER PHASE-F KYEE;Lo;0;L;;;;;N;;;;;
+16A17;BAMUM LETTER PHASE-F KET;Lo;0;L;;;;;N;;;;;
+16A18;BAMUM LETTER PHASE-F NUAE;Lo;0;L;;;;;N;;;;;
+16A19;BAMUM LETTER PHASE-F NU;Lo;0;L;;;;;N;;;;;
+16A1A;BAMUM LETTER PHASE-F NJUAE;Lo;0;L;;;;;N;;;;;
+16A1B;BAMUM LETTER PHASE-F YOQ;Lo;0;L;;;;;N;;;;;
+16A1C;BAMUM LETTER PHASE-F SHU;Lo;0;L;;;;;N;;;;;
+16A1D;BAMUM LETTER PHASE-F YA;Lo;0;L;;;;;N;;;;;
+16A1E;BAMUM LETTER PHASE-F NSHA;Lo;0;L;;;;;N;;;;;
+16A1F;BAMUM LETTER PHASE-F PEUX;Lo;0;L;;;;;N;;;;;
+16A20;BAMUM LETTER PHASE-F NTEE;Lo;0;L;;;;;N;;;;;
+16A21;BAMUM LETTER PHASE-F WUE;Lo;0;L;;;;;N;;;;;
+16A22;BAMUM LETTER PHASE-F PEE;Lo;0;L;;;;;N;;;;;
+16A23;BAMUM LETTER PHASE-F RU;Lo;0;L;;;;;N;;;;;
+16A24;BAMUM LETTER PHASE-F NI;Lo;0;L;;;;;N;;;;;
+16A25;BAMUM LETTER PHASE-F REUX;Lo;0;L;;;;;N;;;;;
+16A26;BAMUM LETTER PHASE-F KEN;Lo;0;L;;;;;N;;;;;
+16A27;BAMUM LETTER PHASE-F NGKWAEN;Lo;0;L;;;;;N;;;;;
+16A28;BAMUM LETTER PHASE-F NGGA;Lo;0;L;;;;;N;;;;;
+16A29;BAMUM LETTER PHASE-F SHO;Lo;0;L;;;;;N;;;;;
+16A2A;BAMUM LETTER PHASE-F PUAE;Lo;0;L;;;;;N;;;;;
+16A2B;BAMUM LETTER PHASE-F FOM;Lo;0;L;;;;;N;;;;;
+16A2C;BAMUM LETTER PHASE-F WA;Lo;0;L;;;;;N;;;;;
+16A2D;BAMUM LETTER PHASE-F LI;Lo;0;L;;;;;N;;;;;
+16A2E;BAMUM LETTER PHASE-F LOQ;Lo;0;L;;;;;N;;;;;
+16A2F;BAMUM LETTER PHASE-F KO;Lo;0;L;;;;;N;;;;;
+16A30;BAMUM LETTER PHASE-F MBEN;Lo;0;L;;;;;N;;;;;
+16A31;BAMUM LETTER PHASE-F REN;Lo;0;L;;;;;N;;;;;
+16A32;BAMUM LETTER PHASE-F MA;Lo;0;L;;;;;N;;;;;
+16A33;BAMUM LETTER PHASE-F MO;Lo;0;L;;;;;N;;;;;
+16A34;BAMUM LETTER PHASE-F MBAA;Lo;0;L;;;;;N;;;;;
+16A35;BAMUM LETTER PHASE-F TET;Lo;0;L;;;;;N;;;;;
+16A36;BAMUM LETTER PHASE-F KPA;Lo;0;L;;;;;N;;;;;
+16A37;BAMUM LETTER PHASE-F SAMBA;Lo;0;L;;;;;N;;;;;
+16A38;BAMUM LETTER PHASE-F VUEQ;Lo;0;L;;;;;N;;;;;
+16A40;MRO LETTER TA;Lo;0;L;;;;;N;;;;;
+16A41;MRO LETTER NGI;Lo;0;L;;;;;N;;;;;
+16A42;MRO LETTER YO;Lo;0;L;;;;;N;;;;;
+16A43;MRO LETTER MIM;Lo;0;L;;;;;N;;;;;
+16A44;MRO LETTER BA;Lo;0;L;;;;;N;;;;;
+16A45;MRO LETTER DA;Lo;0;L;;;;;N;;;;;
+16A46;MRO LETTER A;Lo;0;L;;;;;N;;;;;
+16A47;MRO LETTER PHI;Lo;0;L;;;;;N;;;;;
+16A48;MRO LETTER KHAI;Lo;0;L;;;;;N;;;;;
+16A49;MRO LETTER HAO;Lo;0;L;;;;;N;;;;;
+16A4A;MRO LETTER DAI;Lo;0;L;;;;;N;;;;;
+16A4B;MRO LETTER CHU;Lo;0;L;;;;;N;;;;;
+16A4C;MRO LETTER KEAAE;Lo;0;L;;;;;N;;;;;
+16A4D;MRO LETTER OL;Lo;0;L;;;;;N;;;;;
+16A4E;MRO LETTER MAEM;Lo;0;L;;;;;N;;;;;
+16A4F;MRO LETTER NIN;Lo;0;L;;;;;N;;;;;
+16A50;MRO LETTER PA;Lo;0;L;;;;;N;;;;;
+16A51;MRO LETTER OO;Lo;0;L;;;;;N;;;;;
+16A52;MRO LETTER O;Lo;0;L;;;;;N;;;;;
+16A53;MRO LETTER RO;Lo;0;L;;;;;N;;;;;
+16A54;MRO LETTER SHI;Lo;0;L;;;;;N;;;;;
+16A55;MRO LETTER THEA;Lo;0;L;;;;;N;;;;;
+16A56;MRO LETTER EA;Lo;0;L;;;;;N;;;;;
+16A57;MRO LETTER WA;Lo;0;L;;;;;N;;;;;
+16A58;MRO LETTER E;Lo;0;L;;;;;N;;;;;
+16A59;MRO LETTER KO;Lo;0;L;;;;;N;;;;;
+16A5A;MRO LETTER LAN;Lo;0;L;;;;;N;;;;;
+16A5B;MRO LETTER LA;Lo;0;L;;;;;N;;;;;
+16A5C;MRO LETTER HAI;Lo;0;L;;;;;N;;;;;
+16A5D;MRO LETTER RI;Lo;0;L;;;;;N;;;;;
+16A5E;MRO LETTER TEK;Lo;0;L;;;;;N;;;;;
+16A60;MRO DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+16A61;MRO DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+16A62;MRO DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+16A63;MRO DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+16A64;MRO DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+16A65;MRO DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+16A66;MRO DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+16A67;MRO DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+16A68;MRO DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+16A69;MRO DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+16A6E;MRO DANDA;Po;0;L;;;;;N;;;;;
+16A6F;MRO DOUBLE DANDA;Po;0;L;;;;;N;;;;;
+16AD0;BASSA VAH LETTER ENNI;Lo;0;L;;;;;N;;;;;
+16AD1;BASSA VAH LETTER KA;Lo;0;L;;;;;N;;;;;
+16AD2;BASSA VAH LETTER SE;Lo;0;L;;;;;N;;;;;
+16AD3;BASSA VAH LETTER FA;Lo;0;L;;;;;N;;;;;
+16AD4;BASSA VAH LETTER MBE;Lo;0;L;;;;;N;;;;;
+16AD5;BASSA VAH LETTER YIE;Lo;0;L;;;;;N;;;;;
+16AD6;BASSA VAH LETTER GAH;Lo;0;L;;;;;N;;;;;
+16AD7;BASSA VAH LETTER DHII;Lo;0;L;;;;;N;;;;;
+16AD8;BASSA VAH LETTER KPAH;Lo;0;L;;;;;N;;;;;
+16AD9;BASSA VAH LETTER JO;Lo;0;L;;;;;N;;;;;
+16ADA;BASSA VAH LETTER HWAH;Lo;0;L;;;;;N;;;;;
+16ADB;BASSA VAH LETTER WA;Lo;0;L;;;;;N;;;;;
+16ADC;BASSA VAH LETTER ZO;Lo;0;L;;;;;N;;;;;
+16ADD;BASSA VAH LETTER GBU;Lo;0;L;;;;;N;;;;;
+16ADE;BASSA VAH LETTER DO;Lo;0;L;;;;;N;;;;;
+16ADF;BASSA VAH LETTER CE;Lo;0;L;;;;;N;;;;;
+16AE0;BASSA VAH LETTER UWU;Lo;0;L;;;;;N;;;;;
+16AE1;BASSA VAH LETTER TO;Lo;0;L;;;;;N;;;;;
+16AE2;BASSA VAH LETTER BA;Lo;0;L;;;;;N;;;;;
+16AE3;BASSA VAH LETTER VU;Lo;0;L;;;;;N;;;;;
+16AE4;BASSA VAH LETTER YEIN;Lo;0;L;;;;;N;;;;;
+16AE5;BASSA VAH LETTER PA;Lo;0;L;;;;;N;;;;;
+16AE6;BASSA VAH LETTER WADDA;Lo;0;L;;;;;N;;;;;
+16AE7;BASSA VAH LETTER A;Lo;0;L;;;;;N;;;;;
+16AE8;BASSA VAH LETTER O;Lo;0;L;;;;;N;;;;;
+16AE9;BASSA VAH LETTER OO;Lo;0;L;;;;;N;;;;;
+16AEA;BASSA VAH LETTER U;Lo;0;L;;;;;N;;;;;
+16AEB;BASSA VAH LETTER EE;Lo;0;L;;;;;N;;;;;
+16AEC;BASSA VAH LETTER E;Lo;0;L;;;;;N;;;;;
+16AED;BASSA VAH LETTER I;Lo;0;L;;;;;N;;;;;
+16AF0;BASSA VAH COMBINING HIGH TONE;Mn;1;NSM;;;;;N;;;;;
+16AF1;BASSA VAH COMBINING LOW TONE;Mn;1;NSM;;;;;N;;;;;
+16AF2;BASSA VAH COMBINING MID TONE;Mn;1;NSM;;;;;N;;;;;
+16AF3;BASSA VAH COMBINING LOW-MID TONE;Mn;1;NSM;;;;;N;;;;;
+16AF4;BASSA VAH COMBINING HIGH-LOW TONE;Mn;1;NSM;;;;;N;;;;;
+16AF5;BASSA VAH FULL STOP;Po;0;L;;;;;N;;;;;
+16B00;PAHAWH HMONG VOWEL KEEB;Lo;0;L;;;;;N;;;;;
+16B01;PAHAWH HMONG VOWEL KEEV;Lo;0;L;;;;;N;;;;;
+16B02;PAHAWH HMONG VOWEL KIB;Lo;0;L;;;;;N;;;;;
+16B03;PAHAWH HMONG VOWEL KIV;Lo;0;L;;;;;N;;;;;
+16B04;PAHAWH HMONG VOWEL KAUB;Lo;0;L;;;;;N;;;;;
+16B05;PAHAWH HMONG VOWEL KAUV;Lo;0;L;;;;;N;;;;;
+16B06;PAHAWH HMONG VOWEL KUB;Lo;0;L;;;;;N;;;;;
+16B07;PAHAWH HMONG VOWEL KUV;Lo;0;L;;;;;N;;;;;
+16B08;PAHAWH HMONG VOWEL KEB;Lo;0;L;;;;;N;;;;;
+16B09;PAHAWH HMONG VOWEL KEV;Lo;0;L;;;;;N;;;;;
+16B0A;PAHAWH HMONG VOWEL KAIB;Lo;0;L;;;;;N;;;;;
+16B0B;PAHAWH HMONG VOWEL KAIV;Lo;0;L;;;;;N;;;;;
+16B0C;PAHAWH HMONG VOWEL KOOB;Lo;0;L;;;;;N;;;;;
+16B0D;PAHAWH HMONG VOWEL KOOV;Lo;0;L;;;;;N;;;;;
+16B0E;PAHAWH HMONG VOWEL KAWB;Lo;0;L;;;;;N;;;;;
+16B0F;PAHAWH HMONG VOWEL KAWV;Lo;0;L;;;;;N;;;;;
+16B10;PAHAWH HMONG VOWEL KUAB;Lo;0;L;;;;;N;;;;;
+16B11;PAHAWH HMONG VOWEL KUAV;Lo;0;L;;;;;N;;;;;
+16B12;PAHAWH HMONG VOWEL KOB;Lo;0;L;;;;;N;;;;;
+16B13;PAHAWH HMONG VOWEL KOV;Lo;0;L;;;;;N;;;;;
+16B14;PAHAWH HMONG VOWEL KIAB;Lo;0;L;;;;;N;;;;;
+16B15;PAHAWH HMONG VOWEL KIAV;Lo;0;L;;;;;N;;;;;
+16B16;PAHAWH HMONG VOWEL KAB;Lo;0;L;;;;;N;;;;;
+16B17;PAHAWH HMONG VOWEL KAV;Lo;0;L;;;;;N;;;;;
+16B18;PAHAWH HMONG VOWEL KWB;Lo;0;L;;;;;N;;;;;
+16B19;PAHAWH HMONG VOWEL KWV;Lo;0;L;;;;;N;;;;;
+16B1A;PAHAWH HMONG VOWEL KAAB;Lo;0;L;;;;;N;;;;;
+16B1B;PAHAWH HMONG VOWEL KAAV;Lo;0;L;;;;;N;;;;;
+16B1C;PAHAWH HMONG CONSONANT VAU;Lo;0;L;;;;;N;;;;;
+16B1D;PAHAWH HMONG CONSONANT NTSAU;Lo;0;L;;;;;N;;;;;
+16B1E;PAHAWH HMONG CONSONANT LAU;Lo;0;L;;;;;N;;;;;
+16B1F;PAHAWH HMONG CONSONANT HAU;Lo;0;L;;;;;N;;;;;
+16B20;PAHAWH HMONG CONSONANT NLAU;Lo;0;L;;;;;N;;;;;
+16B21;PAHAWH HMONG CONSONANT RAU;Lo;0;L;;;;;N;;;;;
+16B22;PAHAWH HMONG CONSONANT NKAU;Lo;0;L;;;;;N;;;;;
+16B23;PAHAWH HMONG CONSONANT QHAU;Lo;0;L;;;;;N;;;;;
+16B24;PAHAWH HMONG CONSONANT YAU;Lo;0;L;;;;;N;;;;;
+16B25;PAHAWH HMONG CONSONANT HLAU;Lo;0;L;;;;;N;;;;;
+16B26;PAHAWH HMONG CONSONANT MAU;Lo;0;L;;;;;N;;;;;
+16B27;PAHAWH HMONG CONSONANT CHAU;Lo;0;L;;;;;N;;;;;
+16B28;PAHAWH HMONG CONSONANT NCHAU;Lo;0;L;;;;;N;;;;;
+16B29;PAHAWH HMONG CONSONANT HNAU;Lo;0;L;;;;;N;;;;;
+16B2A;PAHAWH HMONG CONSONANT PLHAU;Lo;0;L;;;;;N;;;;;
+16B2B;PAHAWH HMONG CONSONANT NTHAU;Lo;0;L;;;;;N;;;;;
+16B2C;PAHAWH HMONG CONSONANT NAU;Lo;0;L;;;;;N;;;;;
+16B2D;PAHAWH HMONG CONSONANT AU;Lo;0;L;;;;;N;;;;;
+16B2E;PAHAWH HMONG CONSONANT XAU;Lo;0;L;;;;;N;;;;;
+16B2F;PAHAWH HMONG CONSONANT CAU;Lo;0;L;;;;;N;;;;;
+16B30;PAHAWH HMONG MARK CIM TUB;Mn;230;NSM;;;;;N;;;;;
+16B31;PAHAWH HMONG MARK CIM SO;Mn;230;NSM;;;;;N;;;;;
+16B32;PAHAWH HMONG MARK CIM KES;Mn;230;NSM;;;;;N;;;;;
+16B33;PAHAWH HMONG MARK CIM KHAV;Mn;230;NSM;;;;;N;;;;;
+16B34;PAHAWH HMONG MARK CIM SUAM;Mn;230;NSM;;;;;N;;;;;
+16B35;PAHAWH HMONG MARK CIM HOM;Mn;230;NSM;;;;;N;;;;;
+16B36;PAHAWH HMONG MARK CIM TAUM;Mn;230;NSM;;;;;N;;;;;
+16B37;PAHAWH HMONG SIGN VOS THOM;Po;0;L;;;;;N;;;;;
+16B38;PAHAWH HMONG SIGN VOS TSHAB CEEB;Po;0;L;;;;;N;;;;;
+16B39;PAHAWH HMONG SIGN CIM CHEEM;Po;0;L;;;;;N;;;;;
+16B3A;PAHAWH HMONG SIGN VOS THIAB;Po;0;L;;;;;N;;;;;
+16B3B;PAHAWH HMONG SIGN VOS FEEM;Po;0;L;;;;;N;;;;;
+16B3C;PAHAWH HMONG SIGN XYEEM NTXIV;So;0;L;;;;;N;;;;;
+16B3D;PAHAWH HMONG SIGN XYEEM RHO;So;0;L;;;;;N;;;;;
+16B3E;PAHAWH HMONG SIGN XYEEM TOV;So;0;L;;;;;N;;;;;
+16B3F;PAHAWH HMONG SIGN XYEEM FAIB;So;0;L;;;;;N;;;;;
+16B40;PAHAWH HMONG SIGN VOS SEEV;Lm;0;L;;;;;N;;;;;
+16B41;PAHAWH HMONG SIGN MEEJ SUAB;Lm;0;L;;;;;N;;;;;
+16B42;PAHAWH HMONG SIGN VOS NRUA;Lm;0;L;;;;;N;;;;;
+16B43;PAHAWH HMONG SIGN IB YAM;Lm;0;L;;;;;N;;;;;
+16B44;PAHAWH HMONG SIGN XAUS;Po;0;L;;;;;N;;;;;
+16B45;PAHAWH HMONG SIGN CIM TSOV ROG;So;0;L;;;;;N;;;;;
+16B50;PAHAWH HMONG DIGIT ZERO;Nd;0;L;;0;0;0;N;;;;;
+16B51;PAHAWH HMONG DIGIT ONE;Nd;0;L;;1;1;1;N;;;;;
+16B52;PAHAWH HMONG DIGIT TWO;Nd;0;L;;2;2;2;N;;;;;
+16B53;PAHAWH HMONG DIGIT THREE;Nd;0;L;;3;3;3;N;;;;;
+16B54;PAHAWH HMONG DIGIT FOUR;Nd;0;L;;4;4;4;N;;;;;
+16B55;PAHAWH HMONG DIGIT FIVE;Nd;0;L;;5;5;5;N;;;;;
+16B56;PAHAWH HMONG DIGIT SIX;Nd;0;L;;6;6;6;N;;;;;
+16B57;PAHAWH HMONG DIGIT SEVEN;Nd;0;L;;7;7;7;N;;;;;
+16B58;PAHAWH HMONG DIGIT EIGHT;Nd;0;L;;8;8;8;N;;;;;
+16B59;PAHAWH HMONG DIGIT NINE;Nd;0;L;;9;9;9;N;;;;;
+16B5B;PAHAWH HMONG NUMBER TENS;No;0;L;;;;10;N;;;;;
+16B5C;PAHAWH HMONG NUMBER HUNDREDS;No;0;L;;;;100;N;;;;;
+16B5D;PAHAWH HMONG NUMBER TEN THOUSANDS;No;0;L;;;;10000;N;;;;;
+16B5E;PAHAWH HMONG NUMBER MILLIONS;No;0;L;;;;1000000;N;;;;;
+16B5F;PAHAWH HMONG NUMBER HUNDRED MILLIONS;No;0;L;;;;100000000;N;;;;;
+16B60;PAHAWH HMONG NUMBER TEN BILLIONS;No;0;L;;;;10000000000;N;;;;;
+16B61;PAHAWH HMONG NUMBER TRILLIONS;No;0;L;;;;1000000000000;N;;;;;
+16B63;PAHAWH HMONG SIGN VOS LUB;Lo;0;L;;;;;N;;;;;
+16B64;PAHAWH HMONG SIGN XYOO;Lo;0;L;;;;;N;;;;;
+16B65;PAHAWH HMONG SIGN HLI;Lo;0;L;;;;;N;;;;;
+16B66;PAHAWH HMONG SIGN THIRD-STAGE HLI;Lo;0;L;;;;;N;;;;;
+16B67;PAHAWH HMONG SIGN ZWJ THAJ;Lo;0;L;;;;;N;;;;;
+16B68;PAHAWH HMONG SIGN HNUB;Lo;0;L;;;;;N;;;;;
+16B69;PAHAWH HMONG SIGN NQIG;Lo;0;L;;;;;N;;;;;
+16B6A;PAHAWH HMONG SIGN XIAB;Lo;0;L;;;;;N;;;;;
+16B6B;PAHAWH HMONG SIGN NTUJ;Lo;0;L;;;;;N;;;;;
+16B6C;PAHAWH HMONG SIGN AV;Lo;0;L;;;;;N;;;;;
+16B6D;PAHAWH HMONG SIGN TXHEEJ CEEV;Lo;0;L;;;;;N;;;;;
+16B6E;PAHAWH HMONG SIGN MEEJ TSEEB;Lo;0;L;;;;;N;;;;;
+16B6F;PAHAWH HMONG SIGN TAU;Lo;0;L;;;;;N;;;;;
+16B70;PAHAWH HMONG SIGN LOS;Lo;0;L;;;;;N;;;;;
+16B71;PAHAWH HMONG SIGN MUS;Lo;0;L;;;;;N;;;;;
+16B72;PAHAWH HMONG SIGN CIM HAIS LUS NTOG NTOG;Lo;0;L;;;;;N;;;;;
+16B73;PAHAWH HMONG SIGN CIM CUAM TSHOOJ;Lo;0;L;;;;;N;;;;;
+16B74;PAHAWH HMONG SIGN CIM TXWV;Lo;0;L;;;;;N;;;;;
+16B75;PAHAWH HMONG SIGN CIM TXWV CHWV;Lo;0;L;;;;;N;;;;;
+16B76;PAHAWH HMONG SIGN CIM PUB DAWB;Lo;0;L;;;;;N;;;;;
+16B77;PAHAWH HMONG SIGN CIM NRES TOS;Lo;0;L;;;;;N;;;;;
+16B7D;PAHAWH HMONG CLAN SIGN TSHEEJ;Lo;0;L;;;;;N;;;;;
+16B7E;PAHAWH HMONG CLAN SIGN YEEG;Lo;0;L;;;;;N;;;;;
+16B7F;PAHAWH HMONG CLAN SIGN LIS;Lo;0;L;;;;;N;;;;;
+16B80;PAHAWH HMONG CLAN SIGN LAUJ;Lo;0;L;;;;;N;;;;;
+16B81;PAHAWH HMONG CLAN SIGN XYOOJ;Lo;0;L;;;;;N;;;;;
+16B82;PAHAWH HMONG CLAN SIGN KOO;Lo;0;L;;;;;N;;;;;
+16B83;PAHAWH HMONG CLAN SIGN HAWJ;Lo;0;L;;;;;N;;;;;
+16B84;PAHAWH HMONG CLAN SIGN MUAS;Lo;0;L;;;;;N;;;;;
+16B85;PAHAWH HMONG CLAN SIGN THOJ;Lo;0;L;;;;;N;;;;;
+16B86;PAHAWH HMONG CLAN SIGN TSAB;Lo;0;L;;;;;N;;;;;
+16B87;PAHAWH HMONG CLAN SIGN PHAB;Lo;0;L;;;;;N;;;;;
+16B88;PAHAWH HMONG CLAN SIGN KHAB;Lo;0;L;;;;;N;;;;;
+16B89;PAHAWH HMONG CLAN SIGN HAM;Lo;0;L;;;;;N;;;;;
+16B8A;PAHAWH HMONG CLAN SIGN VAJ;Lo;0;L;;;;;N;;;;;
+16B8B;PAHAWH HMONG CLAN SIGN FAJ;Lo;0;L;;;;;N;;;;;
+16B8C;PAHAWH HMONG CLAN SIGN YAJ;Lo;0;L;;;;;N;;;;;
+16B8D;PAHAWH HMONG CLAN SIGN TSWB;Lo;0;L;;;;;N;;;;;
+16B8E;PAHAWH HMONG CLAN SIGN KWM;Lo;0;L;;;;;N;;;;;
+16B8F;PAHAWH HMONG CLAN SIGN VWJ;Lo;0;L;;;;;N;;;;;
+16F00;MIAO LETTER PA;Lo;0;L;;;;;N;;;;;
+16F01;MIAO LETTER BA;Lo;0;L;;;;;N;;;;;
+16F02;MIAO LETTER YI PA;Lo;0;L;;;;;N;;;;;
+16F03;MIAO LETTER PLA;Lo;0;L;;;;;N;;;;;
+16F04;MIAO LETTER MA;Lo;0;L;;;;;N;;;;;
+16F05;MIAO LETTER MHA;Lo;0;L;;;;;N;;;;;
+16F06;MIAO LETTER ARCHAIC MA;Lo;0;L;;;;;N;;;;;
+16F07;MIAO LETTER FA;Lo;0;L;;;;;N;;;;;
+16F08;MIAO LETTER VA;Lo;0;L;;;;;N;;;;;
+16F09;MIAO LETTER VFA;Lo;0;L;;;;;N;;;;;
+16F0A;MIAO LETTER TA;Lo;0;L;;;;;N;;;;;
+16F0B;MIAO LETTER DA;Lo;0;L;;;;;N;;;;;
+16F0C;MIAO LETTER YI TTA;Lo;0;L;;;;;N;;;;;
+16F0D;MIAO LETTER YI TA;Lo;0;L;;;;;N;;;;;
+16F0E;MIAO LETTER TTA;Lo;0;L;;;;;N;;;;;
+16F0F;MIAO LETTER DDA;Lo;0;L;;;;;N;;;;;
+16F10;MIAO LETTER NA;Lo;0;L;;;;;N;;;;;
+16F11;MIAO LETTER NHA;Lo;0;L;;;;;N;;;;;
+16F12;MIAO LETTER YI NNA;Lo;0;L;;;;;N;;;;;
+16F13;MIAO LETTER ARCHAIC NA;Lo;0;L;;;;;N;;;;;
+16F14;MIAO LETTER NNA;Lo;0;L;;;;;N;;;;;
+16F15;MIAO LETTER NNHA;Lo;0;L;;;;;N;;;;;
+16F16;MIAO LETTER LA;Lo;0;L;;;;;N;;;;;
+16F17;MIAO LETTER LYA;Lo;0;L;;;;;N;;;;;
+16F18;MIAO LETTER LHA;Lo;0;L;;;;;N;;;;;
+16F19;MIAO LETTER LHYA;Lo;0;L;;;;;N;;;;;
+16F1A;MIAO LETTER TLHA;Lo;0;L;;;;;N;;;;;
+16F1B;MIAO LETTER DLHA;Lo;0;L;;;;;N;;;;;
+16F1C;MIAO LETTER TLHYA;Lo;0;L;;;;;N;;;;;
+16F1D;MIAO LETTER DLHYA;Lo;0;L;;;;;N;;;;;
+16F1E;MIAO LETTER KA;Lo;0;L;;;;;N;;;;;
+16F1F;MIAO LETTER GA;Lo;0;L;;;;;N;;;;;
+16F20;MIAO LETTER YI KA;Lo;0;L;;;;;N;;;;;
+16F21;MIAO LETTER QA;Lo;0;L;;;;;N;;;;;
+16F22;MIAO LETTER QGA;Lo;0;L;;;;;N;;;;;
+16F23;MIAO LETTER NGA;Lo;0;L;;;;;N;;;;;
+16F24;MIAO LETTER NGHA;Lo;0;L;;;;;N;;;;;
+16F25;MIAO LETTER ARCHAIC NGA;Lo;0;L;;;;;N;;;;;
+16F26;MIAO LETTER HA;Lo;0;L;;;;;N;;;;;
+16F27;MIAO LETTER XA;Lo;0;L;;;;;N;;;;;
+16F28;MIAO LETTER GHA;Lo;0;L;;;;;N;;;;;
+16F29;MIAO LETTER GHHA;Lo;0;L;;;;;N;;;;;
+16F2A;MIAO LETTER TSSA;Lo;0;L;;;;;N;;;;;
+16F2B;MIAO LETTER DZZA;Lo;0;L;;;;;N;;;;;
+16F2C;MIAO LETTER NYA;Lo;0;L;;;;;N;;;;;
+16F2D;MIAO LETTER NYHA;Lo;0;L;;;;;N;;;;;
+16F2E;MIAO LETTER TSHA;Lo;0;L;;;;;N;;;;;
+16F2F;MIAO LETTER DZHA;Lo;0;L;;;;;N;;;;;
+16F30;MIAO LETTER YI TSHA;Lo;0;L;;;;;N;;;;;
+16F31;MIAO LETTER YI DZHA;Lo;0;L;;;;;N;;;;;
+16F32;MIAO LETTER REFORMED TSHA;Lo;0;L;;;;;N;;;;;
+16F33;MIAO LETTER SHA;Lo;0;L;;;;;N;;;;;
+16F34;MIAO LETTER SSA;Lo;0;L;;;;;N;;;;;
+16F35;MIAO LETTER ZHA;Lo;0;L;;;;;N;;;;;
+16F36;MIAO LETTER ZSHA;Lo;0;L;;;;;N;;;;;
+16F37;MIAO LETTER TSA;Lo;0;L;;;;;N;;;;;
+16F38;MIAO LETTER DZA;Lo;0;L;;;;;N;;;;;
+16F39;MIAO LETTER YI TSA;Lo;0;L;;;;;N;;;;;
+16F3A;MIAO LETTER SA;Lo;0;L;;;;;N;;;;;
+16F3B;MIAO LETTER ZA;Lo;0;L;;;;;N;;;;;
+16F3C;MIAO LETTER ZSA;Lo;0;L;;;;;N;;;;;
+16F3D;MIAO LETTER ZZA;Lo;0;L;;;;;N;;;;;
+16F3E;MIAO LETTER ZZSA;Lo;0;L;;;;;N;;;;;
+16F3F;MIAO LETTER ARCHAIC ZZA;Lo;0;L;;;;;N;;;;;
+16F40;MIAO LETTER ZZYA;Lo;0;L;;;;;N;;;;;
+16F41;MIAO LETTER ZZSYA;Lo;0;L;;;;;N;;;;;
+16F42;MIAO LETTER WA;Lo;0;L;;;;;N;;;;;
+16F43;MIAO LETTER AH;Lo;0;L;;;;;N;;;;;
+16F44;MIAO LETTER HHA;Lo;0;L;;;;;N;;;;;
+16F50;MIAO LETTER NASALIZATION;Lo;0;L;;;;;N;;;;;
+16F51;MIAO SIGN ASPIRATION;Mc;0;L;;;;;N;;;;;
+16F52;MIAO SIGN REFORMED VOICING;Mc;0;L;;;;;N;;;;;
+16F53;MIAO SIGN REFORMED ASPIRATION;Mc;0;L;;;;;N;;;;;
+16F54;MIAO VOWEL SIGN A;Mc;0;L;;;;;N;;;;;
+16F55;MIAO VOWEL SIGN AA;Mc;0;L;;;;;N;;;;;
+16F56;MIAO VOWEL SIGN AHH;Mc;0;L;;;;;N;;;;;
+16F57;MIAO VOWEL SIGN AN;Mc;0;L;;;;;N;;;;;
+16F58;MIAO VOWEL SIGN ANG;Mc;0;L;;;;;N;;;;;
+16F59;MIAO VOWEL SIGN O;Mc;0;L;;;;;N;;;;;
+16F5A;MIAO VOWEL SIGN OO;Mc;0;L;;;;;N;;;;;
+16F5B;MIAO VOWEL SIGN WO;Mc;0;L;;;;;N;;;;;
+16F5C;MIAO VOWEL SIGN W;Mc;0;L;;;;;N;;;;;
+16F5D;MIAO VOWEL SIGN E;Mc;0;L;;;;;N;;;;;
+16F5E;MIAO VOWEL SIGN EN;Mc;0;L;;;;;N;;;;;
+16F5F;MIAO VOWEL SIGN ENG;Mc;0;L;;;;;N;;;;;
+16F60;MIAO VOWEL SIGN OEY;Mc;0;L;;;;;N;;;;;
+16F61;MIAO VOWEL SIGN I;Mc;0;L;;;;;N;;;;;
+16F62;MIAO VOWEL SIGN IA;Mc;0;L;;;;;N;;;;;
+16F63;MIAO VOWEL SIGN IAN;Mc;0;L;;;;;N;;;;;
+16F64;MIAO VOWEL SIGN IANG;Mc;0;L;;;;;N;;;;;
+16F65;MIAO VOWEL SIGN IO;Mc;0;L;;;;;N;;;;;
+16F66;MIAO VOWEL SIGN IE;Mc;0;L;;;;;N;;;;;
+16F67;MIAO VOWEL SIGN II;Mc;0;L;;;;;N;;;;;
+16F68;MIAO VOWEL SIGN IU;Mc;0;L;;;;;N;;;;;
+16F69;MIAO VOWEL SIGN ING;Mc;0;L;;;;;N;;;;;
+16F6A;MIAO VOWEL SIGN U;Mc;0;L;;;;;N;;;;;
+16F6B;MIAO VOWEL SIGN UA;Mc;0;L;;;;;N;;;;;
+16F6C;MIAO VOWEL SIGN UAN;Mc;0;L;;;;;N;;;;;
+16F6D;MIAO VOWEL SIGN UANG;Mc;0;L;;;;;N;;;;;
+16F6E;MIAO VOWEL SIGN UU;Mc;0;L;;;;;N;;;;;
+16F6F;MIAO VOWEL SIGN UEI;Mc;0;L;;;;;N;;;;;
+16F70;MIAO VOWEL SIGN UNG;Mc;0;L;;;;;N;;;;;
+16F71;MIAO VOWEL SIGN Y;Mc;0;L;;;;;N;;;;;
+16F72;MIAO VOWEL SIGN YI;Mc;0;L;;;;;N;;;;;
+16F73;MIAO VOWEL SIGN AE;Mc;0;L;;;;;N;;;;;
+16F74;MIAO VOWEL SIGN AEE;Mc;0;L;;;;;N;;;;;
+16F75;MIAO VOWEL SIGN ERR;Mc;0;L;;;;;N;;;;;
+16F76;MIAO VOWEL SIGN ROUNDED ERR;Mc;0;L;;;;;N;;;;;
+16F77;MIAO VOWEL SIGN ER;Mc;0;L;;;;;N;;;;;
+16F78;MIAO VOWEL SIGN ROUNDED ER;Mc;0;L;;;;;N;;;;;
+16F79;MIAO VOWEL SIGN AI;Mc;0;L;;;;;N;;;;;
+16F7A;MIAO VOWEL SIGN EI;Mc;0;L;;;;;N;;;;;
+16F7B;MIAO VOWEL SIGN AU;Mc;0;L;;;;;N;;;;;
+16F7C;MIAO VOWEL SIGN OU;Mc;0;L;;;;;N;;;;;
+16F7D;MIAO VOWEL SIGN N;Mc;0;L;;;;;N;;;;;
+16F7E;MIAO VOWEL SIGN NG;Mc;0;L;;;;;N;;;;;
+16F8F;MIAO TONE RIGHT;Mn;0;NSM;;;;;N;;;;;
+16F90;MIAO TONE TOP RIGHT;Mn;0;NSM;;;;;N;;;;;
+16F91;MIAO TONE ABOVE;Mn;0;NSM;;;;;N;;;;;
+16F92;MIAO TONE BELOW;Mn;0;NSM;;;;;N;;;;;
+16F93;MIAO LETTER TONE-2;Lm;0;L;;;;;N;;;;;
+16F94;MIAO LETTER TONE-3;Lm;0;L;;;;;N;;;;;
+16F95;MIAO LETTER TONE-4;Lm;0;L;;;;;N;;;;;
+16F96;MIAO LETTER TONE-5;Lm;0;L;;;;;N;;;;;
+16F97;MIAO LETTER TONE-6;Lm;0;L;;;;;N;;;;;
+16F98;MIAO LETTER TONE-7;Lm;0;L;;;;;N;;;;;
+16F99;MIAO LETTER TONE-8;Lm;0;L;;;;;N;;;;;
+16F9A;MIAO LETTER REFORMED TONE-1;Lm;0;L;;;;;N;;;;;
+16F9B;MIAO LETTER REFORMED TONE-2;Lm;0;L;;;;;N;;;;;
+16F9C;MIAO LETTER REFORMED TONE-4;Lm;0;L;;;;;N;;;;;
+16F9D;MIAO LETTER REFORMED TONE-5;Lm;0;L;;;;;N;;;;;
+16F9E;MIAO LETTER REFORMED TONE-6;Lm;0;L;;;;;N;;;;;
+16F9F;MIAO LETTER REFORMED TONE-8;Lm;0;L;;;;;N;;;;;
+16FE0;TANGUT ITERATION MARK;Lm;0;L;;;;;N;;;;;
+16FE1;NUSHU ITERATION MARK;Lm;0;L;;;;;N;;;;;
+17000;<Tangut Ideograph, First>;Lo;0;L;;;;;N;;;;;
+187EC;<Tangut Ideograph, Last>;Lo;0;L;;;;;N;;;;;
+18800;TANGUT COMPONENT-001;Lo;0;L;;;;;N;;;;;
+18801;TANGUT COMPONENT-002;Lo;0;L;;;;;N;;;;;
+18802;TANGUT COMPONENT-003;Lo;0;L;;;;;N;;;;;
+18803;TANGUT COMPONENT-004;Lo;0;L;;;;;N;;;;;
+18804;TANGUT COMPONENT-005;Lo;0;L;;;;;N;;;;;
+18805;TANGUT COMPONENT-006;Lo;0;L;;;;;N;;;;;
+18806;TANGUT COMPONENT-007;Lo;0;L;;;;;N;;;;;
+18807;TANGUT COMPONENT-008;Lo;0;L;;;;;N;;;;;
+18808;TANGUT COMPONENT-009;Lo;0;L;;;;;N;;;;;
+18809;TANGUT COMPONENT-010;Lo;0;L;;;;;N;;;;;
+1880A;TANGUT COMPONENT-011;Lo;0;L;;;;;N;;;;;
+1880B;TANGUT COMPONENT-012;Lo;0;L;;;;;N;;;;;
+1880C;TANGUT COMPONENT-013;Lo;0;L;;;;;N;;;;;
+1880D;TANGUT COMPONENT-014;Lo;0;L;;;;;N;;;;;
+1880E;TANGUT COMPONENT-015;Lo;0;L;;;;;N;;;;;
+1880F;TANGUT COMPONENT-016;Lo;0;L;;;;;N;;;;;
+18810;TANGUT COMPONENT-017;Lo;0;L;;;;;N;;;;;
+18811;TANGUT COMPONENT-018;Lo;0;L;;;;;N;;;;;
+18812;TANGUT COMPONENT-019;Lo;0;L;;;;;N;;;;;
+18813;TANGUT COMPONENT-020;Lo;0;L;;;;;N;;;;;
+18814;TANGUT COMPONENT-021;Lo;0;L;;;;;N;;;;;
+18815;TANGUT COMPONENT-022;Lo;0;L;;;;;N;;;;;
+18816;TANGUT COMPONENT-023;Lo;0;L;;;;;N;;;;;
+18817;TANGUT COMPONENT-024;Lo;0;L;;;;;N;;;;;
+18818;TANGUT COMPONENT-025;Lo;0;L;;;;;N;;;;;
+18819;TANGUT COMPONENT-026;Lo;0;L;;;;;N;;;;;
+1881A;TANGUT COMPONENT-027;Lo;0;L;;;;;N;;;;;
+1881B;TANGUT COMPONENT-028;Lo;0;L;;;;;N;;;;;
+1881C;TANGUT COMPONENT-029;Lo;0;L;;;;;N;;;;;
+1881D;TANGUT COMPONENT-030;Lo;0;L;;;;;N;;;;;
+1881E;TANGUT COMPONENT-031;Lo;0;L;;;;;N;;;;;
+1881F;TANGUT COMPONENT-032;Lo;0;L;;;;;N;;;;;
+18820;TANGUT COMPONENT-033;Lo;0;L;;;;;N;;;;;
+18821;TANGUT COMPONENT-034;Lo;0;L;;;;;N;;;;;
+18822;TANGUT COMPONENT-035;Lo;0;L;;;;;N;;;;;
+18823;TANGUT COMPONENT-036;Lo;0;L;;;;;N;;;;;
+18824;TANGUT COMPONENT-037;Lo;0;L;;;;;N;;;;;
+18825;TANGUT COMPONENT-038;Lo;0;L;;;;;N;;;;;
+18826;TANGUT COMPONENT-039;Lo;0;L;;;;;N;;;;;
+18827;TANGUT COMPONENT-040;Lo;0;L;;;;;N;;;;;
+18828;TANGUT COMPONENT-041;Lo;0;L;;;;;N;;;;;
+18829;TANGUT COMPONENT-042;Lo;0;L;;;;;N;;;;;
+1882A;TANGUT COMPONENT-043;Lo;0;L;;;;;N;;;;;
+1882B;TANGUT COMPONENT-044;Lo;0;L;;;;;N;;;;;
+1882C;TANGUT COMPONENT-045;Lo;0;L;;;;;N;;;;;
+1882D;TANGUT COMPONENT-046;Lo;0;L;;;;;N;;;;;
+1882E;TANGUT COMPONENT-047;Lo;0;L;;;;;N;;;;;
+1882F;TANGUT COMPONENT-048;Lo;0;L;;;;;N;;;;;
+18830;TANGUT COMPONENT-049;Lo;0;L;;;;;N;;;;;
+18831;TANGUT COMPONENT-050;Lo;0;L;;;;;N;;;;;
+18832;TANGUT COMPONENT-051;Lo;0;L;;;;;N;;;;;
+18833;TANGUT COMPONENT-052;Lo;0;L;;;;;N;;;;;
+18834;TANGUT COMPONENT-053;Lo;0;L;;;;;N;;;;;
+18835;TANGUT COMPONENT-054;Lo;0;L;;;;;N;;;;;
+18836;TANGUT COMPONENT-055;Lo;0;L;;;;;N;;;;;
+18837;TANGUT COMPONENT-056;Lo;0;L;;;;;N;;;;;
+18838;TANGUT COMPONENT-057;Lo;0;L;;;;;N;;;;;
+18839;TANGUT COMPONENT-058;Lo;0;L;;;;;N;;;;;
+1883A;TANGUT COMPONENT-059;Lo;0;L;;;;;N;;;;;
+1883B;TANGUT COMPONENT-060;Lo;0;L;;;;;N;;;;;
+1883C;TANGUT COMPONENT-061;Lo;0;L;;;;;N;;;;;
+1883D;TANGUT COMPONENT-062;Lo;0;L;;;;;N;;;;;
+1883E;TANGUT COMPONENT-063;Lo;0;L;;;;;N;;;;;
+1883F;TANGUT COMPONENT-064;Lo;0;L;;;;;N;;;;;
+18840;TANGUT COMPONENT-065;Lo;0;L;;;;;N;;;;;
+18841;TANGUT COMPONENT-066;Lo;0;L;;;;;N;;;;;
+18842;TANGUT COMPONENT-067;Lo;0;L;;;;;N;;;;;
+18843;TANGUT COMPONENT-068;Lo;0;L;;;;;N;;;;;
+18844;TANGUT COMPONENT-069;Lo;0;L;;;;;N;;;;;
+18845;TANGUT COMPONENT-070;Lo;0;L;;;;;N;;;;;
+18846;TANGUT COMPONENT-071;Lo;0;L;;;;;N;;;;;
+18847;TANGUT COMPONENT-072;Lo;0;L;;;;;N;;;;;
+18848;TANGUT COMPONENT-073;Lo;0;L;;;;;N;;;;;
+18849;TANGUT COMPONENT-074;Lo;0;L;;;;;N;;;;;
+1884A;TANGUT COMPONENT-075;Lo;0;L;;;;;N;;;;;
+1884B;TANGUT COMPONENT-076;Lo;0;L;;;;;N;;;;;
+1884C;TANGUT COMPONENT-077;Lo;0;L;;;;;N;;;;;
+1884D;TANGUT COMPONENT-078;Lo;0;L;;;;;N;;;;;
+1884E;TANGUT COMPONENT-079;Lo;0;L;;;;;N;;;;;
+1884F;TANGUT COMPONENT-080;Lo;0;L;;;;;N;;;;;
+18850;TANGUT COMPONENT-081;Lo;0;L;;;;;N;;;;;
+18851;TANGUT COMPONENT-082;Lo;0;L;;;;;N;;;;;
+18852;TANGUT COMPONENT-083;Lo;0;L;;;;;N;;;;;
+18853;TANGUT COMPONENT-084;Lo;0;L;;;;;N;;;;;
+18854;TANGUT COMPONENT-085;Lo;0;L;;;;;N;;;;;
+18855;TANGUT COMPONENT-086;Lo;0;L;;;;;N;;;;;
+18856;TANGUT COMPONENT-087;Lo;0;L;;;;;N;;;;;
+18857;TANGUT COMPONENT-088;Lo;0;L;;;;;N;;;;;
+18858;TANGUT COMPONENT-089;Lo;0;L;;;;;N;;;;;
+18859;TANGUT COMPONENT-090;Lo;0;L;;;;;N;;;;;
+1885A;TANGUT COMPONENT-091;Lo;0;L;;;;;N;;;;;
+1885B;TANGUT COMPONENT-092;Lo;0;L;;;;;N;;;;;
+1885C;TANGUT COMPONENT-093;Lo;0;L;;;;;N;;;;;
+1885D;TANGUT COMPONENT-094;Lo;0;L;;;;;N;;;;;
+1885E;TANGUT COMPONENT-095;Lo;0;L;;;;;N;;;;;
+1885F;TANGUT COMPONENT-096;Lo;0;L;;;;;N;;;;;
+18860;TANGUT COMPONENT-097;Lo;0;L;;;;;N;;;;;
+18861;TANGUT COMPONENT-098;Lo;0;L;;;;;N;;;;;
+18862;TANGUT COMPONENT-099;Lo;0;L;;;;;N;;;;;
+18863;TANGUT COMPONENT-100;Lo;0;L;;;;;N;;;;;
+18864;TANGUT COMPONENT-101;Lo;0;L;;;;;N;;;;;
+18865;TANGUT COMPONENT-102;Lo;0;L;;;;;N;;;;;
+18866;TANGUT COMPONENT-103;Lo;0;L;;;;;N;;;;;
+18867;TANGUT COMPONENT-104;Lo;0;L;;;;;N;;;;;
+18868;TANGUT COMPONENT-105;Lo;0;L;;;;;N;;;;;
+18869;TANGUT COMPONENT-106;Lo;0;L;;;;;N;;;;;
+1886A;TANGUT COMPONENT-107;Lo;0;L;;;;;N;;;;;
+1886B;TANGUT COMPONENT-108;Lo;0;L;;;;;N;;;;;
+1886C;TANGUT COMPONENT-109;Lo;0;L;;;;;N;;;;;
+1886D;TANGUT COMPONENT-110;Lo;0;L;;;;;N;;;;;
+1886E;TANGUT COMPONENT-111;Lo;0;L;;;;;N;;;;;
+1886F;TANGUT COMPONENT-112;Lo;0;L;;;;;N;;;;;
+18870;TANGUT COMPONENT-113;Lo;0;L;;;;;N;;;;;
+18871;TANGUT COMPONENT-114;Lo;0;L;;;;;N;;;;;
+18872;TANGUT COMPONENT-115;Lo;0;L;;;;;N;;;;;
+18873;TANGUT COMPONENT-116;Lo;0;L;;;;;N;;;;;
+18874;TANGUT COMPONENT-117;Lo;0;L;;;;;N;;;;;
+18875;TANGUT COMPONENT-118;Lo;0;L;;;;;N;;;;;
+18876;TANGUT COMPONENT-119;Lo;0;L;;;;;N;;;;;
+18877;TANGUT COMPONENT-120;Lo;0;L;;;;;N;;;;;
+18878;TANGUT COMPONENT-121;Lo;0;L;;;;;N;;;;;
+18879;TANGUT COMPONENT-122;Lo;0;L;;;;;N;;;;;
+1887A;TANGUT COMPONENT-123;Lo;0;L;;;;;N;;;;;
+1887B;TANGUT COMPONENT-124;Lo;0;L;;;;;N;;;;;
+1887C;TANGUT COMPONENT-125;Lo;0;L;;;;;N;;;;;
+1887D;TANGUT COMPONENT-126;Lo;0;L;;;;;N;;;;;
+1887E;TANGUT COMPONENT-127;Lo;0;L;;;;;N;;;;;
+1887F;TANGUT COMPONENT-128;Lo;0;L;;;;;N;;;;;
+18880;TANGUT COMPONENT-129;Lo;0;L;;;;;N;;;;;
+18881;TANGUT COMPONENT-130;Lo;0;L;;;;;N;;;;;
+18882;TANGUT COMPONENT-131;Lo;0;L;;;;;N;;;;;
+18883;TANGUT COMPONENT-132;Lo;0;L;;;;;N;;;;;
+18884;TANGUT COMPONENT-133;Lo;0;L;;;;;N;;;;;
+18885;TANGUT COMPONENT-134;Lo;0;L;;;;;N;;;;;
+18886;TANGUT COMPONENT-135;Lo;0;L;;;;;N;;;;;
+18887;TANGUT COMPONENT-136;Lo;0;L;;;;;N;;;;;
+18888;TANGUT COMPONENT-137;Lo;0;L;;;;;N;;;;;
+18889;TANGUT COMPONENT-138;Lo;0;L;;;;;N;;;;;
+1888A;TANGUT COMPONENT-139;Lo;0;L;;;;;N;;;;;
+1888B;TANGUT COMPONENT-140;Lo;0;L;;;;;N;;;;;
+1888C;TANGUT COMPONENT-141;Lo;0;L;;;;;N;;;;;
+1888D;TANGUT COMPONENT-142;Lo;0;L;;;;;N;;;;;
+1888E;TANGUT COMPONENT-143;Lo;0;L;;;;;N;;;;;
+1888F;TANGUT COMPONENT-144;Lo;0;L;;;;;N;;;;;
+18890;TANGUT COMPONENT-145;Lo;0;L;;;;;N;;;;;
+18891;TANGUT COMPONENT-146;Lo;0;L;;;;;N;;;;;
+18892;TANGUT COMPONENT-147;Lo;0;L;;;;;N;;;;;
+18893;TANGUT COMPONENT-148;Lo;0;L;;;;;N;;;;;
+18894;TANGUT COMPONENT-149;Lo;0;L;;;;;N;;;;;
+18895;TANGUT COMPONENT-150;Lo;0;L;;;;;N;;;;;
+18896;TANGUT COMPONENT-151;Lo;0;L;;;;;N;;;;;
+18897;TANGUT COMPONENT-152;Lo;0;L;;;;;N;;;;;
+18898;TANGUT COMPONENT-153;Lo;0;L;;;;;N;;;;;
+18899;TANGUT COMPONENT-154;Lo;0;L;;;;;N;;;;;
+1889A;TANGUT COMPONENT-155;Lo;0;L;;;;;N;;;;;
+1889B;TANGUT COMPONENT-156;Lo;0;L;;;;;N;;;;;
+1889C;TANGUT COMPONENT-157;Lo;0;L;;;;;N;;;;;
+1889D;TANGUT COMPONENT-158;Lo;0;L;;;;;N;;;;;
+1889E;TANGUT COMPONENT-159;Lo;0;L;;;;;N;;;;;
+1889F;TANGUT COMPONENT-160;Lo;0;L;;;;;N;;;;;
+188A0;TANGUT COMPONENT-161;Lo;0;L;;;;;N;;;;;
+188A1;TANGUT COMPONENT-162;Lo;0;L;;;;;N;;;;;
+188A2;TANGUT COMPONENT-163;Lo;0;L;;;;;N;;;;;
+188A3;TANGUT COMPONENT-164;Lo;0;L;;;;;N;;;;;
+188A4;TANGUT COMPONENT-165;Lo;0;L;;;;;N;;;;;
+188A5;TANGUT COMPONENT-166;Lo;0;L;;;;;N;;;;;
+188A6;TANGUT COMPONENT-167;Lo;0;L;;;;;N;;;;;
+188A7;TANGUT COMPONENT-168;Lo;0;L;;;;;N;;;;;
+188A8;TANGUT COMPONENT-169;Lo;0;L;;;;;N;;;;;
+188A9;TANGUT COMPONENT-170;Lo;0;L;;;;;N;;;;;
+188AA;TANGUT COMPONENT-171;Lo;0;L;;;;;N;;;;;
+188AB;TANGUT COMPONENT-172;Lo;0;L;;;;;N;;;;;
+188AC;TANGUT COMPONENT-173;Lo;0;L;;;;;N;;;;;
+188AD;TANGUT COMPONENT-174;Lo;0;L;;;;;N;;;;;
+188AE;TANGUT COMPONENT-175;Lo;0;L;;;;;N;;;;;
+188AF;TANGUT COMPONENT-176;Lo;0;L;;;;;N;;;;;
+188B0;TANGUT COMPONENT-177;Lo;0;L;;;;;N;;;;;
+188B1;TANGUT COMPONENT-178;Lo;0;L;;;;;N;;;;;
+188B2;TANGUT COMPONENT-179;Lo;0;L;;;;;N;;;;;
+188B3;TANGUT COMPONENT-180;Lo;0;L;;;;;N;;;;;
+188B4;TANGUT COMPONENT-181;Lo;0;L;;;;;N;;;;;
+188B5;TANGUT COMPONENT-182;Lo;0;L;;;;;N;;;;;
+188B6;TANGUT COMPONENT-183;Lo;0;L;;;;;N;;;;;
+188B7;TANGUT COMPONENT-184;Lo;0;L;;;;;N;;;;;
+188B8;TANGUT COMPONENT-185;Lo;0;L;;;;;N;;;;;
+188B9;TANGUT COMPONENT-186;Lo;0;L;;;;;N;;;;;
+188BA;TANGUT COMPONENT-187;Lo;0;L;;;;;N;;;;;
+188BB;TANGUT COMPONENT-188;Lo;0;L;;;;;N;;;;;
+188BC;TANGUT COMPONENT-189;Lo;0;L;;;;;N;;;;;
+188BD;TANGUT COMPONENT-190;Lo;0;L;;;;;N;;;;;
+188BE;TANGUT COMPONENT-191;Lo;0;L;;;;;N;;;;;
+188BF;TANGUT COMPONENT-192;Lo;0;L;;;;;N;;;;;
+188C0;TANGUT COMPONENT-193;Lo;0;L;;;;;N;;;;;
+188C1;TANGUT COMPONENT-194;Lo;0;L;;;;;N;;;;;
+188C2;TANGUT COMPONENT-195;Lo;0;L;;;;;N;;;;;
+188C3;TANGUT COMPONENT-196;Lo;0;L;;;;;N;;;;;
+188C4;TANGUT COMPONENT-197;Lo;0;L;;;;;N;;;;;
+188C5;TANGUT COMPONENT-198;Lo;0;L;;;;;N;;;;;
+188C6;TANGUT COMPONENT-199;Lo;0;L;;;;;N;;;;;
+188C7;TANGUT COMPONENT-200;Lo;0;L;;;;;N;;;;;
+188C8;TANGUT COMPONENT-201;Lo;0;L;;;;;N;;;;;
+188C9;TANGUT COMPONENT-202;Lo;0;L;;;;;N;;;;;
+188CA;TANGUT COMPONENT-203;Lo;0;L;;;;;N;;;;;
+188CB;TANGUT COMPONENT-204;Lo;0;L;;;;;N;;;;;
+188CC;TANGUT COMPONENT-205;Lo;0;L;;;;;N;;;;;
+188CD;TANGUT COMPONENT-206;Lo;0;L;;;;;N;;;;;
+188CE;TANGUT COMPONENT-207;Lo;0;L;;;;;N;;;;;
+188CF;TANGUT COMPONENT-208;Lo;0;L;;;;;N;;;;;
+188D0;TANGUT COMPONENT-209;Lo;0;L;;;;;N;;;;;
+188D1;TANGUT COMPONENT-210;Lo;0;L;;;;;N;;;;;
+188D2;TANGUT COMPONENT-211;Lo;0;L;;;;;N;;;;;
+188D3;TANGUT COMPONENT-212;Lo;0;L;;;;;N;;;;;
+188D4;TANGUT COMPONENT-213;Lo;0;L;;;;;N;;;;;
+188D5;TANGUT COMPONENT-214;Lo;0;L;;;;;N;;;;;
+188D6;TANGUT COMPONENT-215;Lo;0;L;;;;;N;;;;;
+188D7;TANGUT COMPONENT-216;Lo;0;L;;;;;N;;;;;
+188D8;TANGUT COMPONENT-217;Lo;0;L;;;;;N;;;;;
+188D9;TANGUT COMPONENT-218;Lo;0;L;;;;;N;;;;;
+188DA;TANGUT COMPONENT-219;Lo;0;L;;;;;N;;;;;
+188DB;TANGUT COMPONENT-220;Lo;0;L;;;;;N;;;;;
+188DC;TANGUT COMPONENT-221;Lo;0;L;;;;;N;;;;;
+188DD;TANGUT COMPONENT-222;Lo;0;L;;;;;N;;;;;
+188DE;TANGUT COMPONENT-223;Lo;0;L;;;;;N;;;;;
+188DF;TANGUT COMPONENT-224;Lo;0;L;;;;;N;;;;;
+188E0;TANGUT COMPONENT-225;Lo;0;L;;;;;N;;;;;
+188E1;TANGUT COMPONENT-226;Lo;0;L;;;;;N;;;;;
+188E2;TANGUT COMPONENT-227;Lo;0;L;;;;;N;;;;;
+188E3;TANGUT COMPONENT-228;Lo;0;L;;;;;N;;;;;
+188E4;TANGUT COMPONENT-229;Lo;0;L;;;;;N;;;;;
+188E5;TANGUT COMPONENT-230;Lo;0;L;;;;;N;;;;;
+188E6;TANGUT COMPONENT-231;Lo;0;L;;;;;N;;;;;
+188E7;TANGUT COMPONENT-232;Lo;0;L;;;;;N;;;;;
+188E8;TANGUT COMPONENT-233;Lo;0;L;;;;;N;;;;;
+188E9;TANGUT COMPONENT-234;Lo;0;L;;;;;N;;;;;
+188EA;TANGUT COMPONENT-235;Lo;0;L;;;;;N;;;;;
+188EB;TANGUT COMPONENT-236;Lo;0;L;;;;;N;;;;;
+188EC;TANGUT COMPONENT-237;Lo;0;L;;;;;N;;;;;
+188ED;TANGUT COMPONENT-238;Lo;0;L;;;;;N;;;;;
+188EE;TANGUT COMPONENT-239;Lo;0;L;;;;;N;;;;;
+188EF;TANGUT COMPONENT-240;Lo;0;L;;;;;N;;;;;
+188F0;TANGUT COMPONENT-241;Lo;0;L;;;;;N;;;;;
+188F1;TANGUT COMPONENT-242;Lo;0;L;;;;;N;;;;;
+188F2;TANGUT COMPONENT-243;Lo;0;L;;;;;N;;;;;
+188F3;TANGUT COMPONENT-244;Lo;0;L;;;;;N;;;;;
+188F4;TANGUT COMPONENT-245;Lo;0;L;;;;;N;;;;;
+188F5;TANGUT COMPONENT-246;Lo;0;L;;;;;N;;;;;
+188F6;TANGUT COMPONENT-247;Lo;0;L;;;;;N;;;;;
+188F7;TANGUT COMPONENT-248;Lo;0;L;;;;;N;;;;;
+188F8;TANGUT COMPONENT-249;Lo;0;L;;;;;N;;;;;
+188F9;TANGUT COMPONENT-250;Lo;0;L;;;;;N;;;;;
+188FA;TANGUT COMPONENT-251;Lo;0;L;;;;;N;;;;;
+188FB;TANGUT COMPONENT-252;Lo;0;L;;;;;N;;;;;
+188FC;TANGUT COMPONENT-253;Lo;0;L;;;;;N;;;;;
+188FD;TANGUT COMPONENT-254;Lo;0;L;;;;;N;;;;;
+188FE;TANGUT COMPONENT-255;Lo;0;L;;;;;N;;;;;
+188FF;TANGUT COMPONENT-256;Lo;0;L;;;;;N;;;;;
+18900;TANGUT COMPONENT-257;Lo;0;L;;;;;N;;;;;
+18901;TANGUT COMPONENT-258;Lo;0;L;;;;;N;;;;;
+18902;TANGUT COMPONENT-259;Lo;0;L;;;;;N;;;;;
+18903;TANGUT COMPONENT-260;Lo;0;L;;;;;N;;;;;
+18904;TANGUT COMPONENT-261;Lo;0;L;;;;;N;;;;;
+18905;TANGUT COMPONENT-262;Lo;0;L;;;;;N;;;;;
+18906;TANGUT COMPONENT-263;Lo;0;L;;;;;N;;;;;
+18907;TANGUT COMPONENT-264;Lo;0;L;;;;;N;;;;;
+18908;TANGUT COMPONENT-265;Lo;0;L;;;;;N;;;;;
+18909;TANGUT COMPONENT-266;Lo;0;L;;;;;N;;;;;
+1890A;TANGUT COMPONENT-267;Lo;0;L;;;;;N;;;;;
+1890B;TANGUT COMPONENT-268;Lo;0;L;;;;;N;;;;;
+1890C;TANGUT COMPONENT-269;Lo;0;L;;;;;N;;;;;
+1890D;TANGUT COMPONENT-270;Lo;0;L;;;;;N;;;;;
+1890E;TANGUT COMPONENT-271;Lo;0;L;;;;;N;;;;;
+1890F;TANGUT COMPONENT-272;Lo;0;L;;;;;N;;;;;
+18910;TANGUT COMPONENT-273;Lo;0;L;;;;;N;;;;;
+18911;TANGUT COMPONENT-274;Lo;0;L;;;;;N;;;;;
+18912;TANGUT COMPONENT-275;Lo;0;L;;;;;N;;;;;
+18913;TANGUT COMPONENT-276;Lo;0;L;;;;;N;;;;;
+18914;TANGUT COMPONENT-277;Lo;0;L;;;;;N;;;;;
+18915;TANGUT COMPONENT-278;Lo;0;L;;;;;N;;;;;
+18916;TANGUT COMPONENT-279;Lo;0;L;;;;;N;;;;;
+18917;TANGUT COMPONENT-280;Lo;0;L;;;;;N;;;;;
+18918;TANGUT COMPONENT-281;Lo;0;L;;;;;N;;;;;
+18919;TANGUT COMPONENT-282;Lo;0;L;;;;;N;;;;;
+1891A;TANGUT COMPONENT-283;Lo;0;L;;;;;N;;;;;
+1891B;TANGUT COMPONENT-284;Lo;0;L;;;;;N;;;;;
+1891C;TANGUT COMPONENT-285;Lo;0;L;;;;;N;;;;;
+1891D;TANGUT COMPONENT-286;Lo;0;L;;;;;N;;;;;
+1891E;TANGUT COMPONENT-287;Lo;0;L;;;;;N;;;;;
+1891F;TANGUT COMPONENT-288;Lo;0;L;;;;;N;;;;;
+18920;TANGUT COMPONENT-289;Lo;0;L;;;;;N;;;;;
+18921;TANGUT COMPONENT-290;Lo;0;L;;;;;N;;;;;
+18922;TANGUT COMPONENT-291;Lo;0;L;;;;;N;;;;;
+18923;TANGUT COMPONENT-292;Lo;0;L;;;;;N;;;;;
+18924;TANGUT COMPONENT-293;Lo;0;L;;;;;N;;;;;
+18925;TANGUT COMPONENT-294;Lo;0;L;;;;;N;;;;;
+18926;TANGUT COMPONENT-295;Lo;0;L;;;;;N;;;;;
+18927;TANGUT COMPONENT-296;Lo;0;L;;;;;N;;;;;
+18928;TANGUT COMPONENT-297;Lo;0;L;;;;;N;;;;;
+18929;TANGUT COMPONENT-298;Lo;0;L;;;;;N;;;;;
+1892A;TANGUT COMPONENT-299;Lo;0;L;;;;;N;;;;;
+1892B;TANGUT COMPONENT-300;Lo;0;L;;;;;N;;;;;
+1892C;TANGUT COMPONENT-301;Lo;0;L;;;;;N;;;;;
+1892D;TANGUT COMPONENT-302;Lo;0;L;;;;;N;;;;;
+1892E;TANGUT COMPONENT-303;Lo;0;L;;;;;N;;;;;
+1892F;TANGUT COMPONENT-304;Lo;0;L;;;;;N;;;;;
+18930;TANGUT COMPONENT-305;Lo;0;L;;;;;N;;;;;
+18931;TANGUT COMPONENT-306;Lo;0;L;;;;;N;;;;;
+18932;TANGUT COMPONENT-307;Lo;0;L;;;;;N;;;;;
+18933;TANGUT COMPONENT-308;Lo;0;L;;;;;N;;;;;
+18934;TANGUT COMPONENT-309;Lo;0;L;;;;;N;;;;;
+18935;TANGUT COMPONENT-310;Lo;0;L;;;;;N;;;;;
+18936;TANGUT COMPONENT-311;Lo;0;L;;;;;N;;;;;
+18937;TANGUT COMPONENT-312;Lo;0;L;;;;;N;;;;;
+18938;TANGUT COMPONENT-313;Lo;0;L;;;;;N;;;;;
+18939;TANGUT COMPONENT-314;Lo;0;L;;;;;N;;;;;
+1893A;TANGUT COMPONENT-315;Lo;0;L;;;;;N;;;;;
+1893B;TANGUT COMPONENT-316;Lo;0;L;;;;;N;;;;;
+1893C;TANGUT COMPONENT-317;Lo;0;L;;;;;N;;;;;
+1893D;TANGUT COMPONENT-318;Lo;0;L;;;;;N;;;;;
+1893E;TANGUT COMPONENT-319;Lo;0;L;;;;;N;;;;;
+1893F;TANGUT COMPONENT-320;Lo;0;L;;;;;N;;;;;
+18940;TANGUT COMPONENT-321;Lo;0;L;;;;;N;;;;;
+18941;TANGUT COMPONENT-322;Lo;0;L;;;;;N;;;;;
+18942;TANGUT COMPONENT-323;Lo;0;L;;;;;N;;;;;
+18943;TANGUT COMPONENT-324;Lo;0;L;;;;;N;;;;;
+18944;TANGUT COMPONENT-325;Lo;0;L;;;;;N;;;;;
+18945;TANGUT COMPONENT-326;Lo;0;L;;;;;N;;;;;
+18946;TANGUT COMPONENT-327;Lo;0;L;;;;;N;;;;;
+18947;TANGUT COMPONENT-328;Lo;0;L;;;;;N;;;;;
+18948;TANGUT COMPONENT-329;Lo;0;L;;;;;N;;;;;
+18949;TANGUT COMPONENT-330;Lo;0;L;;;;;N;;;;;
+1894A;TANGUT COMPONENT-331;Lo;0;L;;;;;N;;;;;
+1894B;TANGUT COMPONENT-332;Lo;0;L;;;;;N;;;;;
+1894C;TANGUT COMPONENT-333;Lo;0;L;;;;;N;;;;;
+1894D;TANGUT COMPONENT-334;Lo;0;L;;;;;N;;;;;
+1894E;TANGUT COMPONENT-335;Lo;0;L;;;;;N;;;;;
+1894F;TANGUT COMPONENT-336;Lo;0;L;;;;;N;;;;;
+18950;TANGUT COMPONENT-337;Lo;0;L;;;;;N;;;;;
+18951;TANGUT COMPONENT-338;Lo;0;L;;;;;N;;;;;
+18952;TANGUT COMPONENT-339;Lo;0;L;;;;;N;;;;;
+18953;TANGUT COMPONENT-340;Lo;0;L;;;;;N;;;;;
+18954;TANGUT COMPONENT-341;Lo;0;L;;;;;N;;;;;
+18955;TANGUT COMPONENT-342;Lo;0;L;;;;;N;;;;;
+18956;TANGUT COMPONENT-343;Lo;0;L;;;;;N;;;;;
+18957;TANGUT COMPONENT-344;Lo;0;L;;;;;N;;;;;
+18958;TANGUT COMPONENT-345;Lo;0;L;;;;;N;;;;;
+18959;TANGUT COMPONENT-346;Lo;0;L;;;;;N;;;;;
+1895A;TANGUT COMPONENT-347;Lo;0;L;;;;;N;;;;;
+1895B;TANGUT COMPONENT-348;Lo;0;L;;;;;N;;;;;
+1895C;TANGUT COMPONENT-349;Lo;0;L;;;;;N;;;;;
+1895D;TANGUT COMPONENT-350;Lo;0;L;;;;;N;;;;;
+1895E;TANGUT COMPONENT-351;Lo;0;L;;;;;N;;;;;
+1895F;TANGUT COMPONENT-352;Lo;0;L;;;;;N;;;;;
+18960;TANGUT COMPONENT-353;Lo;0;L;;;;;N;;;;;
+18961;TANGUT COMPONENT-354;Lo;0;L;;;;;N;;;;;
+18962;TANGUT COMPONENT-355;Lo;0;L;;;;;N;;;;;
+18963;TANGUT COMPONENT-356;Lo;0;L;;;;;N;;;;;
+18964;TANGUT COMPONENT-357;Lo;0;L;;;;;N;;;;;
+18965;TANGUT COMPONENT-358;Lo;0;L;;;;;N;;;;;
+18966;TANGUT COMPONENT-359;Lo;0;L;;;;;N;;;;;
+18967;TANGUT COMPONENT-360;Lo;0;L;;;;;N;;;;;
+18968;TANGUT COMPONENT-361;Lo;0;L;;;;;N;;;;;
+18969;TANGUT COMPONENT-362;Lo;0;L;;;;;N;;;;;
+1896A;TANGUT COMPONENT-363;Lo;0;L;;;;;N;;;;;
+1896B;TANGUT COMPONENT-364;Lo;0;L;;;;;N;;;;;
+1896C;TANGUT COMPONENT-365;Lo;0;L;;;;;N;;;;;
+1896D;TANGUT COMPONENT-366;Lo;0;L;;;;;N;;;;;
+1896E;TANGUT COMPONENT-367;Lo;0;L;;;;;N;;;;;
+1896F;TANGUT COMPONENT-368;Lo;0;L;;;;;N;;;;;
+18970;TANGUT COMPONENT-369;Lo;0;L;;;;;N;;;;;
+18971;TANGUT COMPONENT-370;Lo;0;L;;;;;N;;;;;
+18972;TANGUT COMPONENT-371;Lo;0;L;;;;;N;;;;;
+18973;TANGUT COMPONENT-372;Lo;0;L;;;;;N;;;;;
+18974;TANGUT COMPONENT-373;Lo;0;L;;;;;N;;;;;
+18975;TANGUT COMPONENT-374;Lo;0;L;;;;;N;;;;;
+18976;TANGUT COMPONENT-375;Lo;0;L;;;;;N;;;;;
+18977;TANGUT COMPONENT-376;Lo;0;L;;;;;N;;;;;
+18978;TANGUT COMPONENT-377;Lo;0;L;;;;;N;;;;;
+18979;TANGUT COMPONENT-378;Lo;0;L;;;;;N;;;;;
+1897A;TANGUT COMPONENT-379;Lo;0;L;;;;;N;;;;;
+1897B;TANGUT COMPONENT-380;Lo;0;L;;;;;N;;;;;
+1897C;TANGUT COMPONENT-381;Lo;0;L;;;;;N;;;;;
+1897D;TANGUT COMPONENT-382;Lo;0;L;;;;;N;;;;;
+1897E;TANGUT COMPONENT-383;Lo;0;L;;;;;N;;;;;
+1897F;TANGUT COMPONENT-384;Lo;0;L;;;;;N;;;;;
+18980;TANGUT COMPONENT-385;Lo;0;L;;;;;N;;;;;
+18981;TANGUT COMPONENT-386;Lo;0;L;;;;;N;;;;;
+18982;TANGUT COMPONENT-387;Lo;0;L;;;;;N;;;;;
+18983;TANGUT COMPONENT-388;Lo;0;L;;;;;N;;;;;
+18984;TANGUT COMPONENT-389;Lo;0;L;;;;;N;;;;;
+18985;TANGUT COMPONENT-390;Lo;0;L;;;;;N;;;;;
+18986;TANGUT COMPONENT-391;Lo;0;L;;;;;N;;;;;
+18987;TANGUT COMPONENT-392;Lo;0;L;;;;;N;;;;;
+18988;TANGUT COMPONENT-393;Lo;0;L;;;;;N;;;;;
+18989;TANGUT COMPONENT-394;Lo;0;L;;;;;N;;;;;
+1898A;TANGUT COMPONENT-395;Lo;0;L;;;;;N;;;;;
+1898B;TANGUT COMPONENT-396;Lo;0;L;;;;;N;;;;;
+1898C;TANGUT COMPONENT-397;Lo;0;L;;;;;N;;;;;
+1898D;TANGUT COMPONENT-398;Lo;0;L;;;;;N;;;;;
+1898E;TANGUT COMPONENT-399;Lo;0;L;;;;;N;;;;;
+1898F;TANGUT COMPONENT-400;Lo;0;L;;;;;N;;;;;
+18990;TANGUT COMPONENT-401;Lo;0;L;;;;;N;;;;;
+18991;TANGUT COMPONENT-402;Lo;0;L;;;;;N;;;;;
+18992;TANGUT COMPONENT-403;Lo;0;L;;;;;N;;;;;
+18993;TANGUT COMPONENT-404;Lo;0;L;;;;;N;;;;;
+18994;TANGUT COMPONENT-405;Lo;0;L;;;;;N;;;;;
+18995;TANGUT COMPONENT-406;Lo;0;L;;;;;N;;;;;
+18996;TANGUT COMPONENT-407;Lo;0;L;;;;;N;;;;;
+18997;TANGUT COMPONENT-408;Lo;0;L;;;;;N;;;;;
+18998;TANGUT COMPONENT-409;Lo;0;L;;;;;N;;;;;
+18999;TANGUT COMPONENT-410;Lo;0;L;;;;;N;;;;;
+1899A;TANGUT COMPONENT-411;Lo;0;L;;;;;N;;;;;
+1899B;TANGUT COMPONENT-412;Lo;0;L;;;;;N;;;;;
+1899C;TANGUT COMPONENT-413;Lo;0;L;;;;;N;;;;;
+1899D;TANGUT COMPONENT-414;Lo;0;L;;;;;N;;;;;
+1899E;TANGUT COMPONENT-415;Lo;0;L;;;;;N;;;;;
+1899F;TANGUT COMPONENT-416;Lo;0;L;;;;;N;;;;;
+189A0;TANGUT COMPONENT-417;Lo;0;L;;;;;N;;;;;
+189A1;TANGUT COMPONENT-418;Lo;0;L;;;;;N;;;;;
+189A2;TANGUT COMPONENT-419;Lo;0;L;;;;;N;;;;;
+189A3;TANGUT COMPONENT-420;Lo;0;L;;;;;N;;;;;
+189A4;TANGUT COMPONENT-421;Lo;0;L;;;;;N;;;;;
+189A5;TANGUT COMPONENT-422;Lo;0;L;;;;;N;;;;;
+189A6;TANGUT COMPONENT-423;Lo;0;L;;;;;N;;;;;
+189A7;TANGUT COMPONENT-424;Lo;0;L;;;;;N;;;;;
+189A8;TANGUT COMPONENT-425;Lo;0;L;;;;;N;;;;;
+189A9;TANGUT COMPONENT-426;Lo;0;L;;;;;N;;;;;
+189AA;TANGUT COMPONENT-427;Lo;0;L;;;;;N;;;;;
+189AB;TANGUT COMPONENT-428;Lo;0;L;;;;;N;;;;;
+189AC;TANGUT COMPONENT-429;Lo;0;L;;;;;N;;;;;
+189AD;TANGUT COMPONENT-430;Lo;0;L;;;;;N;;;;;
+189AE;TANGUT COMPONENT-431;Lo;0;L;;;;;N;;;;;
+189AF;TANGUT COMPONENT-432;Lo;0;L;;;;;N;;;;;
+189B0;TANGUT COMPONENT-433;Lo;0;L;;;;;N;;;;;
+189B1;TANGUT COMPONENT-434;Lo;0;L;;;;;N;;;;;
+189B2;TANGUT COMPONENT-435;Lo;0;L;;;;;N;;;;;
+189B3;TANGUT COMPONENT-436;Lo;0;L;;;;;N;;;;;
+189B4;TANGUT COMPONENT-437;Lo;0;L;;;;;N;;;;;
+189B5;TANGUT COMPONENT-438;Lo;0;L;;;;;N;;;;;
+189B6;TANGUT COMPONENT-439;Lo;0;L;;;;;N;;;;;
+189B7;TANGUT COMPONENT-440;Lo;0;L;;;;;N;;;;;
+189B8;TANGUT COMPONENT-441;Lo;0;L;;;;;N;;;;;
+189B9;TANGUT COMPONENT-442;Lo;0;L;;;;;N;;;;;
+189BA;TANGUT COMPONENT-443;Lo;0;L;;;;;N;;;;;
+189BB;TANGUT COMPONENT-444;Lo;0;L;;;;;N;;;;;
+189BC;TANGUT COMPONENT-445;Lo;0;L;;;;;N;;;;;
+189BD;TANGUT COMPONENT-446;Lo;0;L;;;;;N;;;;;
+189BE;TANGUT COMPONENT-447;Lo;0;L;;;;;N;;;;;
+189BF;TANGUT COMPONENT-448;Lo;0;L;;;;;N;;;;;
+189C0;TANGUT COMPONENT-449;Lo;0;L;;;;;N;;;;;
+189C1;TANGUT COMPONENT-450;Lo;0;L;;;;;N;;;;;
+189C2;TANGUT COMPONENT-451;Lo;0;L;;;;;N;;;;;
+189C3;TANGUT COMPONENT-452;Lo;0;L;;;;;N;;;;;
+189C4;TANGUT COMPONENT-453;Lo;0;L;;;;;N;;;;;
+189C5;TANGUT COMPONENT-454;Lo;0;L;;;;;N;;;;;
+189C6;TANGUT COMPONENT-455;Lo;0;L;;;;;N;;;;;
+189C7;TANGUT COMPONENT-456;Lo;0;L;;;;;N;;;;;
+189C8;TANGUT COMPONENT-457;Lo;0;L;;;;;N;;;;;
+189C9;TANGUT COMPONENT-458;Lo;0;L;;;;;N;;;;;
+189CA;TANGUT COMPONENT-459;Lo;0;L;;;;;N;;;;;
+189CB;TANGUT COMPONENT-460;Lo;0;L;;;;;N;;;;;
+189CC;TANGUT COMPONENT-461;Lo;0;L;;;;;N;;;;;
+189CD;TANGUT COMPONENT-462;Lo;0;L;;;;;N;;;;;
+189CE;TANGUT COMPONENT-463;Lo;0;L;;;;;N;;;;;
+189CF;TANGUT COMPONENT-464;Lo;0;L;;;;;N;;;;;
+189D0;TANGUT COMPONENT-465;Lo;0;L;;;;;N;;;;;
+189D1;TANGUT COMPONENT-466;Lo;0;L;;;;;N;;;;;
+189D2;TANGUT COMPONENT-467;Lo;0;L;;;;;N;;;;;
+189D3;TANGUT COMPONENT-468;Lo;0;L;;;;;N;;;;;
+189D4;TANGUT COMPONENT-469;Lo;0;L;;;;;N;;;;;
+189D5;TANGUT COMPONENT-470;Lo;0;L;;;;;N;;;;;
+189D6;TANGUT COMPONENT-471;Lo;0;L;;;;;N;;;;;
+189D7;TANGUT COMPONENT-472;Lo;0;L;;;;;N;;;;;
+189D8;TANGUT COMPONENT-473;Lo;0;L;;;;;N;;;;;
+189D9;TANGUT COMPONENT-474;Lo;0;L;;;;;N;;;;;
+189DA;TANGUT COMPONENT-475;Lo;0;L;;;;;N;;;;;
+189DB;TANGUT COMPONENT-476;Lo;0;L;;;;;N;;;;;
+189DC;TANGUT COMPONENT-477;Lo;0;L;;;;;N;;;;;
+189DD;TANGUT COMPONENT-478;Lo;0;L;;;;;N;;;;;
+189DE;TANGUT COMPONENT-479;Lo;0;L;;;;;N;;;;;
+189DF;TANGUT COMPONENT-480;Lo;0;L;;;;;N;;;;;
+189E0;TANGUT COMPONENT-481;Lo;0;L;;;;;N;;;;;
+189E1;TANGUT COMPONENT-482;Lo;0;L;;;;;N;;;;;
+189E2;TANGUT COMPONENT-483;Lo;0;L;;;;;N;;;;;
+189E3;TANGUT COMPONENT-484;Lo;0;L;;;;;N;;;;;
+189E4;TANGUT COMPONENT-485;Lo;0;L;;;;;N;;;;;
+189E5;TANGUT COMPONENT-486;Lo;0;L;;;;;N;;;;;
+189E6;TANGUT COMPONENT-487;Lo;0;L;;;;;N;;;;;
+189E7;TANGUT COMPONENT-488;Lo;0;L;;;;;N;;;;;
+189E8;TANGUT COMPONENT-489;Lo;0;L;;;;;N;;;;;
+189E9;TANGUT COMPONENT-490;Lo;0;L;;;;;N;;;;;
+189EA;TANGUT COMPONENT-491;Lo;0;L;;;;;N;;;;;
+189EB;TANGUT COMPONENT-492;Lo;0;L;;;;;N;;;;;
+189EC;TANGUT COMPONENT-493;Lo;0;L;;;;;N;;;;;
+189ED;TANGUT COMPONENT-494;Lo;0;L;;;;;N;;;;;
+189EE;TANGUT COMPONENT-495;Lo;0;L;;;;;N;;;;;
+189EF;TANGUT COMPONENT-496;Lo;0;L;;;;;N;;;;;
+189F0;TANGUT COMPONENT-497;Lo;0;L;;;;;N;;;;;
+189F1;TANGUT COMPONENT-498;Lo;0;L;;;;;N;;;;;
+189F2;TANGUT COMPONENT-499;Lo;0;L;;;;;N;;;;;
+189F3;TANGUT COMPONENT-500;Lo;0;L;;;;;N;;;;;
+189F4;TANGUT COMPONENT-501;Lo;0;L;;;;;N;;;;;
+189F5;TANGUT COMPONENT-502;Lo;0;L;;;;;N;;;;;
+189F6;TANGUT COMPONENT-503;Lo;0;L;;;;;N;;;;;
+189F7;TANGUT COMPONENT-504;Lo;0;L;;;;;N;;;;;
+189F8;TANGUT COMPONENT-505;Lo;0;L;;;;;N;;;;;
+189F9;TANGUT COMPONENT-506;Lo;0;L;;;;;N;;;;;
+189FA;TANGUT COMPONENT-507;Lo;0;L;;;;;N;;;;;
+189FB;TANGUT COMPONENT-508;Lo;0;L;;;;;N;;;;;
+189FC;TANGUT COMPONENT-509;Lo;0;L;;;;;N;;;;;
+189FD;TANGUT COMPONENT-510;Lo;0;L;;;;;N;;;;;
+189FE;TANGUT COMPONENT-511;Lo;0;L;;;;;N;;;;;
+189FF;TANGUT COMPONENT-512;Lo;0;L;;;;;N;;;;;
+18A00;TANGUT COMPONENT-513;Lo;0;L;;;;;N;;;;;
+18A01;TANGUT COMPONENT-514;Lo;0;L;;;;;N;;;;;
+18A02;TANGUT COMPONENT-515;Lo;0;L;;;;;N;;;;;
+18A03;TANGUT COMPONENT-516;Lo;0;L;;;;;N;;;;;
+18A04;TANGUT COMPONENT-517;Lo;0;L;;;;;N;;;;;
+18A05;TANGUT COMPONENT-518;Lo;0;L;;;;;N;;;;;
+18A06;TANGUT COMPONENT-519;Lo;0;L;;;;;N;;;;;
+18A07;TANGUT COMPONENT-520;Lo;0;L;;;;;N;;;;;
+18A08;TANGUT COMPONENT-521;Lo;0;L;;;;;N;;;;;
+18A09;TANGUT COMPONENT-522;Lo;0;L;;;;;N;;;;;
+18A0A;TANGUT COMPONENT-523;Lo;0;L;;;;;N;;;;;
+18A0B;TANGUT COMPONENT-524;Lo;0;L;;;;;N;;;;;
+18A0C;TANGUT COMPONENT-525;Lo;0;L;;;;;N;;;;;
+18A0D;TANGUT COMPONENT-526;Lo;0;L;;;;;N;;;;;
+18A0E;TANGUT COMPONENT-527;Lo;0;L;;;;;N;;;;;
+18A0F;TANGUT COMPONENT-528;Lo;0;L;;;;;N;;;;;
+18A10;TANGUT COMPONENT-529;Lo;0;L;;;;;N;;;;;
+18A11;TANGUT COMPONENT-530;Lo;0;L;;;;;N;;;;;
+18A12;TANGUT COMPONENT-531;Lo;0;L;;;;;N;;;;;
+18A13;TANGUT COMPONENT-532;Lo;0;L;;;;;N;;;;;
+18A14;TANGUT COMPONENT-533;Lo;0;L;;;;;N;;;;;
+18A15;TANGUT COMPONENT-534;Lo;0;L;;;;;N;;;;;
+18A16;TANGUT COMPONENT-535;Lo;0;L;;;;;N;;;;;
+18A17;TANGUT COMPONENT-536;Lo;0;L;;;;;N;;;;;
+18A18;TANGUT COMPONENT-537;Lo;0;L;;;;;N;;;;;
+18A19;TANGUT COMPONENT-538;Lo;0;L;;;;;N;;;;;
+18A1A;TANGUT COMPONENT-539;Lo;0;L;;;;;N;;;;;
+18A1B;TANGUT COMPONENT-540;Lo;0;L;;;;;N;;;;;
+18A1C;TANGUT COMPONENT-541;Lo;0;L;;;;;N;;;;;
+18A1D;TANGUT COMPONENT-542;Lo;0;L;;;;;N;;;;;
+18A1E;TANGUT COMPONENT-543;Lo;0;L;;;;;N;;;;;
+18A1F;TANGUT COMPONENT-544;Lo;0;L;;;;;N;;;;;
+18A20;TANGUT COMPONENT-545;Lo;0;L;;;;;N;;;;;
+18A21;TANGUT COMPONENT-546;Lo;0;L;;;;;N;;;;;
+18A22;TANGUT COMPONENT-547;Lo;0;L;;;;;N;;;;;
+18A23;TANGUT COMPONENT-548;Lo;0;L;;;;;N;;;;;
+18A24;TANGUT COMPONENT-549;Lo;0;L;;;;;N;;;;;
+18A25;TANGUT COMPONENT-550;Lo;0;L;;;;;N;;;;;
+18A26;TANGUT COMPONENT-551;Lo;0;L;;;;;N;;;;;
+18A27;TANGUT COMPONENT-552;Lo;0;L;;;;;N;;;;;
+18A28;TANGUT COMPONENT-553;Lo;0;L;;;;;N;;;;;
+18A29;TANGUT COMPONENT-554;Lo;0;L;;;;;N;;;;;
+18A2A;TANGUT COMPONENT-555;Lo;0;L;;;;;N;;;;;
+18A2B;TANGUT COMPONENT-556;Lo;0;L;;;;;N;;;;;
+18A2C;TANGUT COMPONENT-557;Lo;0;L;;;;;N;;;;;
+18A2D;TANGUT COMPONENT-558;Lo;0;L;;;;;N;;;;;
+18A2E;TANGUT COMPONENT-559;Lo;0;L;;;;;N;;;;;
+18A2F;TANGUT COMPONENT-560;Lo;0;L;;;;;N;;;;;
+18A30;TANGUT COMPONENT-561;Lo;0;L;;;;;N;;;;;
+18A31;TANGUT COMPONENT-562;Lo;0;L;;;;;N;;;;;
+18A32;TANGUT COMPONENT-563;Lo;0;L;;;;;N;;;;;
+18A33;TANGUT COMPONENT-564;Lo;0;L;;;;;N;;;;;
+18A34;TANGUT COMPONENT-565;Lo;0;L;;;;;N;;;;;
+18A35;TANGUT COMPONENT-566;Lo;0;L;;;;;N;;;;;
+18A36;TANGUT COMPONENT-567;Lo;0;L;;;;;N;;;;;
+18A37;TANGUT COMPONENT-568;Lo;0;L;;;;;N;;;;;
+18A38;TANGUT COMPONENT-569;Lo;0;L;;;;;N;;;;;
+18A39;TANGUT COMPONENT-570;Lo;0;L;;;;;N;;;;;
+18A3A;TANGUT COMPONENT-571;Lo;0;L;;;;;N;;;;;
+18A3B;TANGUT COMPONENT-572;Lo;0;L;;;;;N;;;;;
+18A3C;TANGUT COMPONENT-573;Lo;0;L;;;;;N;;;;;
+18A3D;TANGUT COMPONENT-574;Lo;0;L;;;;;N;;;;;
+18A3E;TANGUT COMPONENT-575;Lo;0;L;;;;;N;;;;;
+18A3F;TANGUT COMPONENT-576;Lo;0;L;;;;;N;;;;;
+18A40;TANGUT COMPONENT-577;Lo;0;L;;;;;N;;;;;
+18A41;TANGUT COMPONENT-578;Lo;0;L;;;;;N;;;;;
+18A42;TANGUT COMPONENT-579;Lo;0;L;;;;;N;;;;;
+18A43;TANGUT COMPONENT-580;Lo;0;L;;;;;N;;;;;
+18A44;TANGUT COMPONENT-581;Lo;0;L;;;;;N;;;;;
+18A45;TANGUT COMPONENT-582;Lo;0;L;;;;;N;;;;;
+18A46;TANGUT COMPONENT-583;Lo;0;L;;;;;N;;;;;
+18A47;TANGUT COMPONENT-584;Lo;0;L;;;;;N;;;;;
+18A48;TANGUT COMPONENT-585;Lo;0;L;;;;;N;;;;;
+18A49;TANGUT COMPONENT-586;Lo;0;L;;;;;N;;;;;
+18A4A;TANGUT COMPONENT-587;Lo;0;L;;;;;N;;;;;
+18A4B;TANGUT COMPONENT-588;Lo;0;L;;;;;N;;;;;
+18A4C;TANGUT COMPONENT-589;Lo;0;L;;;;;N;;;;;
+18A4D;TANGUT COMPONENT-590;Lo;0;L;;;;;N;;;;;
+18A4E;TANGUT COMPONENT-591;Lo;0;L;;;;;N;;;;;
+18A4F;TANGUT COMPONENT-592;Lo;0;L;;;;;N;;;;;
+18A50;TANGUT COMPONENT-593;Lo;0;L;;;;;N;;;;;
+18A51;TANGUT COMPONENT-594;Lo;0;L;;;;;N;;;;;
+18A52;TANGUT COMPONENT-595;Lo;0;L;;;;;N;;;;;
+18A53;TANGUT COMPONENT-596;Lo;0;L;;;;;N;;;;;
+18A54;TANGUT COMPONENT-597;Lo;0;L;;;;;N;;;;;
+18A55;TANGUT COMPONENT-598;Lo;0;L;;;;;N;;;;;
+18A56;TANGUT COMPONENT-599;Lo;0;L;;;;;N;;;;;
+18A57;TANGUT COMPONENT-600;Lo;0;L;;;;;N;;;;;
+18A58;TANGUT COMPONENT-601;Lo;0;L;;;;;N;;;;;
+18A59;TANGUT COMPONENT-602;Lo;0;L;;;;;N;;;;;
+18A5A;TANGUT COMPONENT-603;Lo;0;L;;;;;N;;;;;
+18A5B;TANGUT COMPONENT-604;Lo;0;L;;;;;N;;;;;
+18A5C;TANGUT COMPONENT-605;Lo;0;L;;;;;N;;;;;
+18A5D;TANGUT COMPONENT-606;Lo;0;L;;;;;N;;;;;
+18A5E;TANGUT COMPONENT-607;Lo;0;L;;;;;N;;;;;
+18A5F;TANGUT COMPONENT-608;Lo;0;L;;;;;N;;;;;
+18A60;TANGUT COMPONENT-609;Lo;0;L;;;;;N;;;;;
+18A61;TANGUT COMPONENT-610;Lo;0;L;;;;;N;;;;;
+18A62;TANGUT COMPONENT-611;Lo;0;L;;;;;N;;;;;
+18A63;TANGUT COMPONENT-612;Lo;0;L;;;;;N;;;;;
+18A64;TANGUT COMPONENT-613;Lo;0;L;;;;;N;;;;;
+18A65;TANGUT COMPONENT-614;Lo;0;L;;;;;N;;;;;
+18A66;TANGUT COMPONENT-615;Lo;0;L;;;;;N;;;;;
+18A67;TANGUT COMPONENT-616;Lo;0;L;;;;;N;;;;;
+18A68;TANGUT COMPONENT-617;Lo;0;L;;;;;N;;;;;
+18A69;TANGUT COMPONENT-618;Lo;0;L;;;;;N;;;;;
+18A6A;TANGUT COMPONENT-619;Lo;0;L;;;;;N;;;;;
+18A6B;TANGUT COMPONENT-620;Lo;0;L;;;;;N;;;;;
+18A6C;TANGUT COMPONENT-621;Lo;0;L;;;;;N;;;;;
+18A6D;TANGUT COMPONENT-622;Lo;0;L;;;;;N;;;;;
+18A6E;TANGUT COMPONENT-623;Lo;0;L;;;;;N;;;;;
+18A6F;TANGUT COMPONENT-624;Lo;0;L;;;;;N;;;;;
+18A70;TANGUT COMPONENT-625;Lo;0;L;;;;;N;;;;;
+18A71;TANGUT COMPONENT-626;Lo;0;L;;;;;N;;;;;
+18A72;TANGUT COMPONENT-627;Lo;0;L;;;;;N;;;;;
+18A73;TANGUT COMPONENT-628;Lo;0;L;;;;;N;;;;;
+18A74;TANGUT COMPONENT-629;Lo;0;L;;;;;N;;;;;
+18A75;TANGUT COMPONENT-630;Lo;0;L;;;;;N;;;;;
+18A76;TANGUT COMPONENT-631;Lo;0;L;;;;;N;;;;;
+18A77;TANGUT COMPONENT-632;Lo;0;L;;;;;N;;;;;
+18A78;TANGUT COMPONENT-633;Lo;0;L;;;;;N;;;;;
+18A79;TANGUT COMPONENT-634;Lo;0;L;;;;;N;;;;;
+18A7A;TANGUT COMPONENT-635;Lo;0;L;;;;;N;;;;;
+18A7B;TANGUT COMPONENT-636;Lo;0;L;;;;;N;;;;;
+18A7C;TANGUT COMPONENT-637;Lo;0;L;;;;;N;;;;;
+18A7D;TANGUT COMPONENT-638;Lo;0;L;;;;;N;;;;;
+18A7E;TANGUT COMPONENT-639;Lo;0;L;;;;;N;;;;;
+18A7F;TANGUT COMPONENT-640;Lo;0;L;;;;;N;;;;;
+18A80;TANGUT COMPONENT-641;Lo;0;L;;;;;N;;;;;
+18A81;TANGUT COMPONENT-642;Lo;0;L;;;;;N;;;;;
+18A82;TANGUT COMPONENT-643;Lo;0;L;;;;;N;;;;;
+18A83;TANGUT COMPONENT-644;Lo;0;L;;;;;N;;;;;
+18A84;TANGUT COMPONENT-645;Lo;0;L;;;;;N;;;;;
+18A85;TANGUT COMPONENT-646;Lo;0;L;;;;;N;;;;;
+18A86;TANGUT COMPONENT-647;Lo;0;L;;;;;N;;;;;
+18A87;TANGUT COMPONENT-648;Lo;0;L;;;;;N;;;;;
+18A88;TANGUT COMPONENT-649;Lo;0;L;;;;;N;;;;;
+18A89;TANGUT COMPONENT-650;Lo;0;L;;;;;N;;;;;
+18A8A;TANGUT COMPONENT-651;Lo;0;L;;;;;N;;;;;
+18A8B;TANGUT COMPONENT-652;Lo;0;L;;;;;N;;;;;
+18A8C;TANGUT COMPONENT-653;Lo;0;L;;;;;N;;;;;
+18A8D;TANGUT COMPONENT-654;Lo;0;L;;;;;N;;;;;
+18A8E;TANGUT COMPONENT-655;Lo;0;L;;;;;N;;;;;
+18A8F;TANGUT COMPONENT-656;Lo;0;L;;;;;N;;;;;
+18A90;TANGUT COMPONENT-657;Lo;0;L;;;;;N;;;;;
+18A91;TANGUT COMPONENT-658;Lo;0;L;;;;;N;;;;;
+18A92;TANGUT COMPONENT-659;Lo;0;L;;;;;N;;;;;
+18A93;TANGUT COMPONENT-660;Lo;0;L;;;;;N;;;;;
+18A94;TANGUT COMPONENT-661;Lo;0;L;;;;;N;;;;;
+18A95;TANGUT COMPONENT-662;Lo;0;L;;;;;N;;;;;
+18A96;TANGUT COMPONENT-663;Lo;0;L;;;;;N;;;;;
+18A97;TANGUT COMPONENT-664;Lo;0;L;;;;;N;;;;;
+18A98;TANGUT COMPONENT-665;Lo;0;L;;;;;N;;;;;
+18A99;TANGUT COMPONENT-666;Lo;0;L;;;;;N;;;;;
+18A9A;TANGUT COMPONENT-667;Lo;0;L;;;;;N;;;;;
+18A9B;TANGUT COMPONENT-668;Lo;0;L;;;;;N;;;;;
+18A9C;TANGUT COMPONENT-669;Lo;0;L;;;;;N;;;;;
+18A9D;TANGUT COMPONENT-670;Lo;0;L;;;;;N;;;;;
+18A9E;TANGUT COMPONENT-671;Lo;0;L;;;;;N;;;;;
+18A9F;TANGUT COMPONENT-672;Lo;0;L;;;;;N;;;;;
+18AA0;TANGUT COMPONENT-673;Lo;0;L;;;;;N;;;;;
+18AA1;TANGUT COMPONENT-674;Lo;0;L;;;;;N;;;;;
+18AA2;TANGUT COMPONENT-675;Lo;0;L;;;;;N;;;;;
+18AA3;TANGUT COMPONENT-676;Lo;0;L;;;;;N;;;;;
+18AA4;TANGUT COMPONENT-677;Lo;0;L;;;;;N;;;;;
+18AA5;TANGUT COMPONENT-678;Lo;0;L;;;;;N;;;;;
+18AA6;TANGUT COMPONENT-679;Lo;0;L;;;;;N;;;;;
+18AA7;TANGUT COMPONENT-680;Lo;0;L;;;;;N;;;;;
+18AA8;TANGUT COMPONENT-681;Lo;0;L;;;;;N;;;;;
+18AA9;TANGUT COMPONENT-682;Lo;0;L;;;;;N;;;;;
+18AAA;TANGUT COMPONENT-683;Lo;0;L;;;;;N;;;;;
+18AAB;TANGUT COMPONENT-684;Lo;0;L;;;;;N;;;;;
+18AAC;TANGUT COMPONENT-685;Lo;0;L;;;;;N;;;;;
+18AAD;TANGUT COMPONENT-686;Lo;0;L;;;;;N;;;;;
+18AAE;TANGUT COMPONENT-687;Lo;0;L;;;;;N;;;;;
+18AAF;TANGUT COMPONENT-688;Lo;0;L;;;;;N;;;;;
+18AB0;TANGUT COMPONENT-689;Lo;0;L;;;;;N;;;;;
+18AB1;TANGUT COMPONENT-690;Lo;0;L;;;;;N;;;;;
+18AB2;TANGUT COMPONENT-691;Lo;0;L;;;;;N;;;;;
+18AB3;TANGUT COMPONENT-692;Lo;0;L;;;;;N;;;;;
+18AB4;TANGUT COMPONENT-693;Lo;0;L;;;;;N;;;;;
+18AB5;TANGUT COMPONENT-694;Lo;0;L;;;;;N;;;;;
+18AB6;TANGUT COMPONENT-695;Lo;0;L;;;;;N;;;;;
+18AB7;TANGUT COMPONENT-696;Lo;0;L;;;;;N;;;;;
+18AB8;TANGUT COMPONENT-697;Lo;0;L;;;;;N;;;;;
+18AB9;TANGUT COMPONENT-698;Lo;0;L;;;;;N;;;;;
+18ABA;TANGUT COMPONENT-699;Lo;0;L;;;;;N;;;;;
+18ABB;TANGUT COMPONENT-700;Lo;0;L;;;;;N;;;;;
+18ABC;TANGUT COMPONENT-701;Lo;0;L;;;;;N;;;;;
+18ABD;TANGUT COMPONENT-702;Lo;0;L;;;;;N;;;;;
+18ABE;TANGUT COMPONENT-703;Lo;0;L;;;;;N;;;;;
+18ABF;TANGUT COMPONENT-704;Lo;0;L;;;;;N;;;;;
+18AC0;TANGUT COMPONENT-705;Lo;0;L;;;;;N;;;;;
+18AC1;TANGUT COMPONENT-706;Lo;0;L;;;;;N;;;;;
+18AC2;TANGUT COMPONENT-707;Lo;0;L;;;;;N;;;;;
+18AC3;TANGUT COMPONENT-708;Lo;0;L;;;;;N;;;;;
+18AC4;TANGUT COMPONENT-709;Lo;0;L;;;;;N;;;;;
+18AC5;TANGUT COMPONENT-710;Lo;0;L;;;;;N;;;;;
+18AC6;TANGUT COMPONENT-711;Lo;0;L;;;;;N;;;;;
+18AC7;TANGUT COMPONENT-712;Lo;0;L;;;;;N;;;;;
+18AC8;TANGUT COMPONENT-713;Lo;0;L;;;;;N;;;;;
+18AC9;TANGUT COMPONENT-714;Lo;0;L;;;;;N;;;;;
+18ACA;TANGUT COMPONENT-715;Lo;0;L;;;;;N;;;;;
+18ACB;TANGUT COMPONENT-716;Lo;0;L;;;;;N;;;;;
+18ACC;TANGUT COMPONENT-717;Lo;0;L;;;;;N;;;;;
+18ACD;TANGUT COMPONENT-718;Lo;0;L;;;;;N;;;;;
+18ACE;TANGUT COMPONENT-719;Lo;0;L;;;;;N;;;;;
+18ACF;TANGUT COMPONENT-720;Lo;0;L;;;;;N;;;;;
+18AD0;TANGUT COMPONENT-721;Lo;0;L;;;;;N;;;;;
+18AD1;TANGUT COMPONENT-722;Lo;0;L;;;;;N;;;;;
+18AD2;TANGUT COMPONENT-723;Lo;0;L;;;;;N;;;;;
+18AD3;TANGUT COMPONENT-724;Lo;0;L;;;;;N;;;;;
+18AD4;TANGUT COMPONENT-725;Lo;0;L;;;;;N;;;;;
+18AD5;TANGUT COMPONENT-726;Lo;0;L;;;;;N;;;;;
+18AD6;TANGUT COMPONENT-727;Lo;0;L;;;;;N;;;;;
+18AD7;TANGUT COMPONENT-728;Lo;0;L;;;;;N;;;;;
+18AD8;TANGUT COMPONENT-729;Lo;0;L;;;;;N;;;;;
+18AD9;TANGUT COMPONENT-730;Lo;0;L;;;;;N;;;;;
+18ADA;TANGUT COMPONENT-731;Lo;0;L;;;;;N;;;;;
+18ADB;TANGUT COMPONENT-732;Lo;0;L;;;;;N;;;;;
+18ADC;TANGUT COMPONENT-733;Lo;0;L;;;;;N;;;;;
+18ADD;TANGUT COMPONENT-734;Lo;0;L;;;;;N;;;;;
+18ADE;TANGUT COMPONENT-735;Lo;0;L;;;;;N;;;;;
+18ADF;TANGUT COMPONENT-736;Lo;0;L;;;;;N;;;;;
+18AE0;TANGUT COMPONENT-737;Lo;0;L;;;;;N;;;;;
+18AE1;TANGUT COMPONENT-738;Lo;0;L;;;;;N;;;;;
+18AE2;TANGUT COMPONENT-739;Lo;0;L;;;;;N;;;;;
+18AE3;TANGUT COMPONENT-740;Lo;0;L;;;;;N;;;;;
+18AE4;TANGUT COMPONENT-741;Lo;0;L;;;;;N;;;;;
+18AE5;TANGUT COMPONENT-742;Lo;0;L;;;;;N;;;;;
+18AE6;TANGUT COMPONENT-743;Lo;0;L;;;;;N;;;;;
+18AE7;TANGUT COMPONENT-744;Lo;0;L;;;;;N;;;;;
+18AE8;TANGUT COMPONENT-745;Lo;0;L;;;;;N;;;;;
+18AE9;TANGUT COMPONENT-746;Lo;0;L;;;;;N;;;;;
+18AEA;TANGUT COMPONENT-747;Lo;0;L;;;;;N;;;;;
+18AEB;TANGUT COMPONENT-748;Lo;0;L;;;;;N;;;;;
+18AEC;TANGUT COMPONENT-749;Lo;0;L;;;;;N;;;;;
+18AED;TANGUT COMPONENT-750;Lo;0;L;;;;;N;;;;;
+18AEE;TANGUT COMPONENT-751;Lo;0;L;;;;;N;;;;;
+18AEF;TANGUT COMPONENT-752;Lo;0;L;;;;;N;;;;;
+18AF0;TANGUT COMPONENT-753;Lo;0;L;;;;;N;;;;;
+18AF1;TANGUT COMPONENT-754;Lo;0;L;;;;;N;;;;;
+18AF2;TANGUT COMPONENT-755;Lo;0;L;;;;;N;;;;;
+1B000;KATAKANA LETTER ARCHAIC E;Lo;0;L;;;;;N;;;;;
+1B001;HIRAGANA LETTER ARCHAIC YE;Lo;0;L;;;;;N;;;;;
+1B002;HENTAIGANA LETTER A-1;Lo;0;L;;;;;N;;;;;
+1B003;HENTAIGANA LETTER A-2;Lo;0;L;;;;;N;;;;;
+1B004;HENTAIGANA LETTER A-3;Lo;0;L;;;;;N;;;;;
+1B005;HENTAIGANA LETTER A-WO;Lo;0;L;;;;;N;;;;;
+1B006;HENTAIGANA LETTER I-1;Lo;0;L;;;;;N;;;;;
+1B007;HENTAIGANA LETTER I-2;Lo;0;L;;;;;N;;;;;
+1B008;HENTAIGANA LETTER I-3;Lo;0;L;;;;;N;;;;;
+1B009;HENTAIGANA LETTER I-4;Lo;0;L;;;;;N;;;;;
+1B00A;HENTAIGANA LETTER U-1;Lo;0;L;;;;;N;;;;;
+1B00B;HENTAIGANA LETTER U-2;Lo;0;L;;;;;N;;;;;
+1B00C;HENTAIGANA LETTER U-3;Lo;0;L;;;;;N;;;;;
+1B00D;HENTAIGANA LETTER U-4;Lo;0;L;;;;;N;;;;;
+1B00E;HENTAIGANA LETTER U-5;Lo;0;L;;;;;N;;;;;
+1B00F;HENTAIGANA LETTER E-2;Lo;0;L;;;;;N;;;;;
+1B010;HENTAIGANA LETTER E-3;Lo;0;L;;;;;N;;;;;
+1B011;HENTAIGANA LETTER E-4;Lo;0;L;;;;;N;;;;;
+1B012;HENTAIGANA LETTER E-5;Lo;0;L;;;;;N;;;;;
+1B013;HENTAIGANA LETTER E-6;Lo;0;L;;;;;N;;;;;
+1B014;HENTAIGANA LETTER O-1;Lo;0;L;;;;;N;;;;;
+1B015;HENTAIGANA LETTER O-2;Lo;0;L;;;;;N;;;;;
+1B016;HENTAIGANA LETTER O-3;Lo;0;L;;;;;N;;;;;
+1B017;HENTAIGANA LETTER KA-1;Lo;0;L;;;;;N;;;;;
+1B018;HENTAIGANA LETTER KA-2;Lo;0;L;;;;;N;;;;;
+1B019;HENTAIGANA LETTER KA-3;Lo;0;L;;;;;N;;;;;
+1B01A;HENTAIGANA LETTER KA-4;Lo;0;L;;;;;N;;;;;
+1B01B;HENTAIGANA LETTER KA-5;Lo;0;L;;;;;N;;;;;
+1B01C;HENTAIGANA LETTER KA-6;Lo;0;L;;;;;N;;;;;
+1B01D;HENTAIGANA LETTER KA-7;Lo;0;L;;;;;N;;;;;
+1B01E;HENTAIGANA LETTER KA-8;Lo;0;L;;;;;N;;;;;
+1B01F;HENTAIGANA LETTER KA-9;Lo;0;L;;;;;N;;;;;
+1B020;HENTAIGANA LETTER KA-10;Lo;0;L;;;;;N;;;;;
+1B021;HENTAIGANA LETTER KA-11;Lo;0;L;;;;;N;;;;;
+1B022;HENTAIGANA LETTER KA-KE;Lo;0;L;;;;;N;;;;;
+1B023;HENTAIGANA LETTER KI-1;Lo;0;L;;;;;N;;;;;
+1B024;HENTAIGANA LETTER KI-2;Lo;0;L;;;;;N;;;;;
+1B025;HENTAIGANA LETTER KI-3;Lo;0;L;;;;;N;;;;;
+1B026;HENTAIGANA LETTER KI-4;Lo;0;L;;;;;N;;;;;
+1B027;HENTAIGANA LETTER KI-5;Lo;0;L;;;;;N;;;;;
+1B028;HENTAIGANA LETTER KI-6;Lo;0;L;;;;;N;;;;;
+1B029;HENTAIGANA LETTER KI-7;Lo;0;L;;;;;N;;;;;
+1B02A;HENTAIGANA LETTER KI-8;Lo;0;L;;;;;N;;;;;
+1B02B;HENTAIGANA LETTER KU-1;Lo;0;L;;;;;N;;;;;
+1B02C;HENTAIGANA LETTER KU-2;Lo;0;L;;;;;N;;;;;
+1B02D;HENTAIGANA LETTER KU-3;Lo;0;L;;;;;N;;;;;
+1B02E;HENTAIGANA LETTER KU-4;Lo;0;L;;;;;N;;;;;
+1B02F;HENTAIGANA LETTER KU-5;Lo;0;L;;;;;N;;;;;
+1B030;HENTAIGANA LETTER KU-6;Lo;0;L;;;;;N;;;;;
+1B031;HENTAIGANA LETTER KU-7;Lo;0;L;;;;;N;;;;;
+1B032;HENTAIGANA LETTER KE-1;Lo;0;L;;;;;N;;;;;
+1B033;HENTAIGANA LETTER KE-2;Lo;0;L;;;;;N;;;;;
+1B034;HENTAIGANA LETTER KE-3;Lo;0;L;;;;;N;;;;;
+1B035;HENTAIGANA LETTER KE-4;Lo;0;L;;;;;N;;;;;
+1B036;HENTAIGANA LETTER KE-5;Lo;0;L;;;;;N;;;;;
+1B037;HENTAIGANA LETTER KE-6;Lo;0;L;;;;;N;;;;;
+1B038;HENTAIGANA LETTER KO-1;Lo;0;L;;;;;N;;;;;
+1B039;HENTAIGANA LETTER KO-2;Lo;0;L;;;;;N;;;;;
+1B03A;HENTAIGANA LETTER KO-3;Lo;0;L;;;;;N;;;;;
+1B03B;HENTAIGANA LETTER KO-KI;Lo;0;L;;;;;N;;;;;
+1B03C;HENTAIGANA LETTER SA-1;Lo;0;L;;;;;N;;;;;
+1B03D;HENTAIGANA LETTER SA-2;Lo;0;L;;;;;N;;;;;
+1B03E;HENTAIGANA LETTER SA-3;Lo;0;L;;;;;N;;;;;
+1B03F;HENTAIGANA LETTER SA-4;Lo;0;L;;;;;N;;;;;
+1B040;HENTAIGANA LETTER SA-5;Lo;0;L;;;;;N;;;;;
+1B041;HENTAIGANA LETTER SA-6;Lo;0;L;;;;;N;;;;;
+1B042;HENTAIGANA LETTER SA-7;Lo;0;L;;;;;N;;;;;
+1B043;HENTAIGANA LETTER SA-8;Lo;0;L;;;;;N;;;;;
+1B044;HENTAIGANA LETTER SI-1;Lo;0;L;;;;;N;;;;;
+1B045;HENTAIGANA LETTER SI-2;Lo;0;L;;;;;N;;;;;
+1B046;HENTAIGANA LETTER SI-3;Lo;0;L;;;;;N;;;;;
+1B047;HENTAIGANA LETTER SI-4;Lo;0;L;;;;;N;;;;;
+1B048;HENTAIGANA LETTER SI-5;Lo;0;L;;;;;N;;;;;
+1B049;HENTAIGANA LETTER SI-6;Lo;0;L;;;;;N;;;;;
+1B04A;HENTAIGANA LETTER SU-1;Lo;0;L;;;;;N;;;;;
+1B04B;HENTAIGANA LETTER SU-2;Lo;0;L;;;;;N;;;;;
+1B04C;HENTAIGANA LETTER SU-3;Lo;0;L;;;;;N;;;;;
+1B04D;HENTAIGANA LETTER SU-4;Lo;0;L;;;;;N;;;;;
+1B04E;HENTAIGANA LETTER SU-5;Lo;0;L;;;;;N;;;;;
+1B04F;HENTAIGANA LETTER SU-6;Lo;0;L;;;;;N;;;;;
+1B050;HENTAIGANA LETTER SU-7;Lo;0;L;;;;;N;;;;;
+1B051;HENTAIGANA LETTER SU-8;Lo;0;L;;;;;N;;;;;
+1B052;HENTAIGANA LETTER SE-1;Lo;0;L;;;;;N;;;;;
+1B053;HENTAIGANA LETTER SE-2;Lo;0;L;;;;;N;;;;;
+1B054;HENTAIGANA LETTER SE-3;Lo;0;L;;;;;N;;;;;
+1B055;HENTAIGANA LETTER SE-4;Lo;0;L;;;;;N;;;;;
+1B056;HENTAIGANA LETTER SE-5;Lo;0;L;;;;;N;;;;;
+1B057;HENTAIGANA LETTER SO-1;Lo;0;L;;;;;N;;;;;
+1B058;HENTAIGANA LETTER SO-2;Lo;0;L;;;;;N;;;;;
+1B059;HENTAIGANA LETTER SO-3;Lo;0;L;;;;;N;;;;;
+1B05A;HENTAIGANA LETTER SO-4;Lo;0;L;;;;;N;;;;;
+1B05B;HENTAIGANA LETTER SO-5;Lo;0;L;;;;;N;;;;;
+1B05C;HENTAIGANA LETTER SO-6;Lo;0;L;;;;;N;;;;;
+1B05D;HENTAIGANA LETTER SO-7;Lo;0;L;;;;;N;;;;;
+1B05E;HENTAIGANA LETTER TA-1;Lo;0;L;;;;;N;;;;;
+1B05F;HENTAIGANA LETTER TA-2;Lo;0;L;;;;;N;;;;;
+1B060;HENTAIGANA LETTER TA-3;Lo;0;L;;;;;N;;;;;
+1B061;HENTAIGANA LETTER TA-4;Lo;0;L;;;;;N;;;;;
+1B062;HENTAIGANA LETTER TI-1;Lo;0;L;;;;;N;;;;;
+1B063;HENTAIGANA LETTER TI-2;Lo;0;L;;;;;N;;;;;
+1B064;HENTAIGANA LETTER TI-3;Lo;0;L;;;;;N;;;;;
+1B065;HENTAIGANA LETTER TI-4;Lo;0;L;;;;;N;;;;;
+1B066;HENTAIGANA LETTER TI-5;Lo;0;L;;;;;N;;;;;
+1B067;HENTAIGANA LETTER TI-6;Lo;0;L;;;;;N;;;;;
+1B068;HENTAIGANA LETTER TI-7;Lo;0;L;;;;;N;;;;;
+1B069;HENTAIGANA LETTER TU-1;Lo;0;L;;;;;N;;;;;
+1B06A;HENTAIGANA LETTER TU-2;Lo;0;L;;;;;N;;;;;
+1B06B;HENTAIGANA LETTER TU-3;Lo;0;L;;;;;N;;;;;
+1B06C;HENTAIGANA LETTER TU-4;Lo;0;L;;;;;N;;;;;
+1B06D;HENTAIGANA LETTER TU-TO;Lo;0;L;;;;;N;;;;;
+1B06E;HENTAIGANA LETTER TE-1;Lo;0;L;;;;;N;;;;;
+1B06F;HENTAIGANA LETTER TE-2;Lo;0;L;;;;;N;;;;;
+1B070;HENTAIGANA LETTER TE-3;Lo;0;L;;;;;N;;;;;
+1B071;HENTAIGANA LETTER TE-4;Lo;0;L;;;;;N;;;;;
+1B072;HENTAIGANA LETTER TE-5;Lo;0;L;;;;;N;;;;;
+1B073;HENTAIGANA LETTER TE-6;Lo;0;L;;;;;N;;;;;
+1B074;HENTAIGANA LETTER TE-7;Lo;0;L;;;;;N;;;;;
+1B075;HENTAIGANA LETTER TE-8;Lo;0;L;;;;;N;;;;;
+1B076;HENTAIGANA LETTER TE-9;Lo;0;L;;;;;N;;;;;
+1B077;HENTAIGANA LETTER TO-1;Lo;0;L;;;;;N;;;;;
+1B078;HENTAIGANA LETTER TO-2;Lo;0;L;;;;;N;;;;;
+1B079;HENTAIGANA LETTER TO-3;Lo;0;L;;;;;N;;;;;
+1B07A;HENTAIGANA LETTER TO-4;Lo;0;L;;;;;N;;;;;
+1B07B;HENTAIGANA LETTER TO-5;Lo;0;L;;;;;N;;;;;
+1B07C;HENTAIGANA LETTER TO-6;Lo;0;L;;;;;N;;;;;
+1B07D;HENTAIGANA LETTER TO-RA;Lo;0;L;;;;;N;;;;;
+1B07E;HENTAIGANA LETTER NA-1;Lo;0;L;;;;;N;;;;;
+1B07F;HENTAIGANA LETTER NA-2;Lo;0;L;;;;;N;;;;;
+1B080;HENTAIGANA LETTER NA-3;Lo;0;L;;;;;N;;;;;
+1B081;HENTAIGANA LETTER NA-4;Lo;0;L;;;;;N;;;;;
+1B082;HENTAIGANA LETTER NA-5;Lo;0;L;;;;;N;;;;;
+1B083;HENTAIGANA LETTER NA-6;Lo;0;L;;;;;N;;;;;
+1B084;HENTAIGANA LETTER NA-7;Lo;0;L;;;;;N;;;;;
+1B085;HENTAIGANA LETTER NA-8;Lo;0;L;;;;;N;;;;;
+1B086;HENTAIGANA LETTER NA-9;Lo;0;L;;;;;N;;;;;
+1B087;HENTAIGANA LETTER NI-1;Lo;0;L;;;;;N;;;;;
+1B088;HENTAIGANA LETTER NI-2;Lo;0;L;;;;;N;;;;;
+1B089;HENTAIGANA LETTER NI-3;Lo;0;L;;;;;N;;;;;
+1B08A;HENTAIGANA LETTER NI-4;Lo;0;L;;;;;N;;;;;
+1B08B;HENTAIGANA LETTER NI-5;Lo;0;L;;;;;N;;;;;
+1B08C;HENTAIGANA LETTER NI-6;Lo;0;L;;;;;N;;;;;
+1B08D;HENTAIGANA LETTER NI-7;Lo;0;L;;;;;N;;;;;
+1B08E;HENTAIGANA LETTER NI-TE;Lo;0;L;;;;;N;;;;;
+1B08F;HENTAIGANA LETTER NU-1;Lo;0;L;;;;;N;;;;;
+1B090;HENTAIGANA LETTER NU-2;Lo;0;L;;;;;N;;;;;
+1B091;HENTAIGANA LETTER NU-3;Lo;0;L;;;;;N;;;;;
+1B092;HENTAIGANA LETTER NE-1;Lo;0;L;;;;;N;;;;;
+1B093;HENTAIGANA LETTER NE-2;Lo;0;L;;;;;N;;;;;
+1B094;HENTAIGANA LETTER NE-3;Lo;0;L;;;;;N;;;;;
+1B095;HENTAIGANA LETTER NE-4;Lo;0;L;;;;;N;;;;;
+1B096;HENTAIGANA LETTER NE-5;Lo;0;L;;;;;N;;;;;
+1B097;HENTAIGANA LETTER NE-6;Lo;0;L;;;;;N;;;;;
+1B098;HENTAIGANA LETTER NE-KO;Lo;0;L;;;;;N;;;;;
+1B099;HENTAIGANA LETTER NO-1;Lo;0;L;;;;;N;;;;;
+1B09A;HENTAIGANA LETTER NO-2;Lo;0;L;;;;;N;;;;;
+1B09B;HENTAIGANA LETTER NO-3;Lo;0;L;;;;;N;;;;;
+1B09C;HENTAIGANA LETTER NO-4;Lo;0;L;;;;;N;;;;;
+1B09D;HENTAIGANA LETTER NO-5;Lo;0;L;;;;;N;;;;;
+1B09E;HENTAIGANA LETTER HA-1;Lo;0;L;;;;;N;;;;;
+1B09F;HENTAIGANA LETTER HA-2;Lo;0;L;;;;;N;;;;;
+1B0A0;HENTAIGANA LETTER HA-3;Lo;0;L;;;;;N;;;;;
+1B0A1;HENTAIGANA LETTER HA-4;Lo;0;L;;;;;N;;;;;
+1B0A2;HENTAIGANA LETTER HA-5;Lo;0;L;;;;;N;;;;;
+1B0A3;HENTAIGANA LETTER HA-6;Lo;0;L;;;;;N;;;;;
+1B0A4;HENTAIGANA LETTER HA-7;Lo;0;L;;;;;N;;;;;
+1B0A5;HENTAIGANA LETTER HA-8;Lo;0;L;;;;;N;;;;;
+1B0A6;HENTAIGANA LETTER HA-9;Lo;0;L;;;;;N;;;;;
+1B0A7;HENTAIGANA LETTER HA-10;Lo;0;L;;;;;N;;;;;
+1B0A8;HENTAIGANA LETTER HA-11;Lo;0;L;;;;;N;;;;;
+1B0A9;HENTAIGANA LETTER HI-1;Lo;0;L;;;;;N;;;;;
+1B0AA;HENTAIGANA LETTER HI-2;Lo;0;L;;;;;N;;;;;
+1B0AB;HENTAIGANA LETTER HI-3;Lo;0;L;;;;;N;;;;;
+1B0AC;HENTAIGANA LETTER HI-4;Lo;0;L;;;;;N;;;;;
+1B0AD;HENTAIGANA LETTER HI-5;Lo;0;L;;;;;N;;;;;
+1B0AE;HENTAIGANA LETTER HI-6;Lo;0;L;;;;;N;;;;;
+1B0AF;HENTAIGANA LETTER HI-7;Lo;0;L;;;;;N;;;;;
+1B0B0;HENTAIGANA LETTER HU-1;Lo;0;L;;;;;N;;;;;
+1B0B1;HENTAIGANA LETTER HU-2;Lo;0;L;;;;;N;;;;;
+1B0B2;HENTAIGANA LETTER HU-3;Lo;0;L;;;;;N;;;;;
+1B0B3;HENTAIGANA LETTER HE-1;Lo;0;L;;;;;N;;;;;
+1B0B4;HENTAIGANA LETTER HE-2;Lo;0;L;;;;;N;;;;;
+1B0B5;HENTAIGANA LETTER HE-3;Lo;0;L;;;;;N;;;;;
+1B0B6;HENTAIGANA LETTER HE-4;Lo;0;L;;;;;N;;;;;
+1B0B7;HENTAIGANA LETTER HE-5;Lo;0;L;;;;;N;;;;;
+1B0B8;HENTAIGANA LETTER HE-6;Lo;0;L;;;;;N;;;;;
+1B0B9;HENTAIGANA LETTER HE-7;Lo;0;L;;;;;N;;;;;
+1B0BA;HENTAIGANA LETTER HO-1;Lo;0;L;;;;;N;;;;;
+1B0BB;HENTAIGANA LETTER HO-2;Lo;0;L;;;;;N;;;;;
+1B0BC;HENTAIGANA LETTER HO-3;Lo;0;L;;;;;N;;;;;
+1B0BD;HENTAIGANA LETTER HO-4;Lo;0;L;;;;;N;;;;;
+1B0BE;HENTAIGANA LETTER HO-5;Lo;0;L;;;;;N;;;;;
+1B0BF;HENTAIGANA LETTER HO-6;Lo;0;L;;;;;N;;;;;
+1B0C0;HENTAIGANA LETTER HO-7;Lo;0;L;;;;;N;;;;;
+1B0C1;HENTAIGANA LETTER HO-8;Lo;0;L;;;;;N;;;;;
+1B0C2;HENTAIGANA LETTER MA-1;Lo;0;L;;;;;N;;;;;
+1B0C3;HENTAIGANA LETTER MA-2;Lo;0;L;;;;;N;;;;;
+1B0C4;HENTAIGANA LETTER MA-3;Lo;0;L;;;;;N;;;;;
+1B0C5;HENTAIGANA LETTER MA-4;Lo;0;L;;;;;N;;;;;
+1B0C6;HENTAIGANA LETTER MA-5;Lo;0;L;;;;;N;;;;;
+1B0C7;HENTAIGANA LETTER MA-6;Lo;0;L;;;;;N;;;;;
+1B0C8;HENTAIGANA LETTER MA-7;Lo;0;L;;;;;N;;;;;
+1B0C9;HENTAIGANA LETTER MI-1;Lo;0;L;;;;;N;;;;;
+1B0CA;HENTAIGANA LETTER MI-2;Lo;0;L;;;;;N;;;;;
+1B0CB;HENTAIGANA LETTER MI-3;Lo;0;L;;;;;N;;;;;
+1B0CC;HENTAIGANA LETTER MI-4;Lo;0;L;;;;;N;;;;;
+1B0CD;HENTAIGANA LETTER MI-5;Lo;0;L;;;;;N;;;;;
+1B0CE;HENTAIGANA LETTER MI-6;Lo;0;L;;;;;N;;;;;
+1B0CF;HENTAIGANA LETTER MI-7;Lo;0;L;;;;;N;;;;;
+1B0D0;HENTAIGANA LETTER MU-1;Lo;0;L;;;;;N;;;;;
+1B0D1;HENTAIGANA LETTER MU-2;Lo;0;L;;;;;N;;;;;
+1B0D2;HENTAIGANA LETTER MU-3;Lo;0;L;;;;;N;;;;;
+1B0D3;HENTAIGANA LETTER MU-4;Lo;0;L;;;;;N;;;;;
+1B0D4;HENTAIGANA LETTER ME-1;Lo;0;L;;;;;N;;;;;
+1B0D5;HENTAIGANA LETTER ME-2;Lo;0;L;;;;;N;;;;;
+1B0D6;HENTAIGANA LETTER ME-MA;Lo;0;L;;;;;N;;;;;
+1B0D7;HENTAIGANA LETTER MO-1;Lo;0;L;;;;;N;;;;;
+1B0D8;HENTAIGANA LETTER MO-2;Lo;0;L;;;;;N;;;;;
+1B0D9;HENTAIGANA LETTER MO-3;Lo;0;L;;;;;N;;;;;
+1B0DA;HENTAIGANA LETTER MO-4;Lo;0;L;;;;;N;;;;;
+1B0DB;HENTAIGANA LETTER MO-5;Lo;0;L;;;;;N;;;;;
+1B0DC;HENTAIGANA LETTER MO-6;Lo;0;L;;;;;N;;;;;
+1B0DD;HENTAIGANA LETTER YA-1;Lo;0;L;;;;;N;;;;;
+1B0DE;HENTAIGANA LETTER YA-2;Lo;0;L;;;;;N;;;;;
+1B0DF;HENTAIGANA LETTER YA-3;Lo;0;L;;;;;N;;;;;
+1B0E0;HENTAIGANA LETTER YA-4;Lo;0;L;;;;;N;;;;;
+1B0E1;HENTAIGANA LETTER YA-5;Lo;0;L;;;;;N;;;;;
+1B0E2;HENTAIGANA LETTER YA-YO;Lo;0;L;;;;;N;;;;;
+1B0E3;HENTAIGANA LETTER YU-1;Lo;0;L;;;;;N;;;;;
+1B0E4;HENTAIGANA LETTER YU-2;Lo;0;L;;;;;N;;;;;
+1B0E5;HENTAIGANA LETTER YU-3;Lo;0;L;;;;;N;;;;;
+1B0E6;HENTAIGANA LETTER YU-4;Lo;0;L;;;;;N;;;;;
+1B0E7;HENTAIGANA LETTER YO-1;Lo;0;L;;;;;N;;;;;
+1B0E8;HENTAIGANA LETTER YO-2;Lo;0;L;;;;;N;;;;;
+1B0E9;HENTAIGANA LETTER YO-3;Lo;0;L;;;;;N;;;;;
+1B0EA;HENTAIGANA LETTER YO-4;Lo;0;L;;;;;N;;;;;
+1B0EB;HENTAIGANA LETTER YO-5;Lo;0;L;;;;;N;;;;;
+1B0EC;HENTAIGANA LETTER YO-6;Lo;0;L;;;;;N;;;;;
+1B0ED;HENTAIGANA LETTER RA-1;Lo;0;L;;;;;N;;;;;
+1B0EE;HENTAIGANA LETTER RA-2;Lo;0;L;;;;;N;;;;;
+1B0EF;HENTAIGANA LETTER RA-3;Lo;0;L;;;;;N;;;;;
+1B0F0;HENTAIGANA LETTER RA-4;Lo;0;L;;;;;N;;;;;
+1B0F1;HENTAIGANA LETTER RI-1;Lo;0;L;;;;;N;;;;;
+1B0F2;HENTAIGANA LETTER RI-2;Lo;0;L;;;;;N;;;;;
+1B0F3;HENTAIGANA LETTER RI-3;Lo;0;L;;;;;N;;;;;
+1B0F4;HENTAIGANA LETTER RI-4;Lo;0;L;;;;;N;;;;;
+1B0F5;HENTAIGANA LETTER RI-5;Lo;0;L;;;;;N;;;;;
+1B0F6;HENTAIGANA LETTER RI-6;Lo;0;L;;;;;N;;;;;
+1B0F7;HENTAIGANA LETTER RI-7;Lo;0;L;;;;;N;;;;;
+1B0F8;HENTAIGANA LETTER RU-1;Lo;0;L;;;;;N;;;;;
+1B0F9;HENTAIGANA LETTER RU-2;Lo;0;L;;;;;N;;;;;
+1B0FA;HENTAIGANA LETTER RU-3;Lo;0;L;;;;;N;;;;;
+1B0FB;HENTAIGANA LETTER RU-4;Lo;0;L;;;;;N;;;;;
+1B0FC;HENTAIGANA LETTER RU-5;Lo;0;L;;;;;N;;;;;
+1B0FD;HENTAIGANA LETTER RU-6;Lo;0;L;;;;;N;;;;;
+1B0FE;HENTAIGANA LETTER RE-1;Lo;0;L;;;;;N;;;;;
+1B0FF;HENTAIGANA LETTER RE-2;Lo;0;L;;;;;N;;;;;
+1B100;HENTAIGANA LETTER RE-3;Lo;0;L;;;;;N;;;;;
+1B101;HENTAIGANA LETTER RE-4;Lo;0;L;;;;;N;;;;;
+1B102;HENTAIGANA LETTER RO-1;Lo;0;L;;;;;N;;;;;
+1B103;HENTAIGANA LETTER RO-2;Lo;0;L;;;;;N;;;;;
+1B104;HENTAIGANA LETTER RO-3;Lo;0;L;;;;;N;;;;;
+1B105;HENTAIGANA LETTER RO-4;Lo;0;L;;;;;N;;;;;
+1B106;HENTAIGANA LETTER RO-5;Lo;0;L;;;;;N;;;;;
+1B107;HENTAIGANA LETTER RO-6;Lo;0;L;;;;;N;;;;;
+1B108;HENTAIGANA LETTER WA-1;Lo;0;L;;;;;N;;;;;
+1B109;HENTAIGANA LETTER WA-2;Lo;0;L;;;;;N;;;;;
+1B10A;HENTAIGANA LETTER WA-3;Lo;0;L;;;;;N;;;;;
+1B10B;HENTAIGANA LETTER WA-4;Lo;0;L;;;;;N;;;;;
+1B10C;HENTAIGANA LETTER WA-5;Lo;0;L;;;;;N;;;;;
+1B10D;HENTAIGANA LETTER WI-1;Lo;0;L;;;;;N;;;;;
+1B10E;HENTAIGANA LETTER WI-2;Lo;0;L;;;;;N;;;;;
+1B10F;HENTAIGANA LETTER WI-3;Lo;0;L;;;;;N;;;;;
+1B110;HENTAIGANA LETTER WI-4;Lo;0;L;;;;;N;;;;;
+1B111;HENTAIGANA LETTER WI-5;Lo;0;L;;;;;N;;;;;
+1B112;HENTAIGANA LETTER WE-1;Lo;0;L;;;;;N;;;;;
+1B113;HENTAIGANA LETTER WE-2;Lo;0;L;;;;;N;;;;;
+1B114;HENTAIGANA LETTER WE-3;Lo;0;L;;;;;N;;;;;
+1B115;HENTAIGANA LETTER WE-4;Lo;0;L;;;;;N;;;;;
+1B116;HENTAIGANA LETTER WO-1;Lo;0;L;;;;;N;;;;;
+1B117;HENTAIGANA LETTER WO-2;Lo;0;L;;;;;N;;;;;
+1B118;HENTAIGANA LETTER WO-3;Lo;0;L;;;;;N;;;;;
+1B119;HENTAIGANA LETTER WO-4;Lo;0;L;;;;;N;;;;;
+1B11A;HENTAIGANA LETTER WO-5;Lo;0;L;;;;;N;;;;;
+1B11B;HENTAIGANA LETTER WO-6;Lo;0;L;;;;;N;;;;;
+1B11C;HENTAIGANA LETTER WO-7;Lo;0;L;;;;;N;;;;;
+1B11D;HENTAIGANA LETTER N-MU-MO-1;Lo;0;L;;;;;N;;;;;
+1B11E;HENTAIGANA LETTER N-MU-MO-2;Lo;0;L;;;;;N;;;;;
+1B170;NUSHU CHARACTER-1B170;Lo;0;L;;;;;N;;;;;
+1B171;NUSHU CHARACTER-1B171;Lo;0;L;;;;;N;;;;;
+1B172;NUSHU CHARACTER-1B172;Lo;0;L;;;;;N;;;;;
+1B173;NUSHU CHARACTER-1B173;Lo;0;L;;;;;N;;;;;
+1B174;NUSHU CHARACTER-1B174;Lo;0;L;;;;;N;;;;;
+1B175;NUSHU CHARACTER-1B175;Lo;0;L;;;;;N;;;;;
+1B176;NUSHU CHARACTER-1B176;Lo;0;L;;;;;N;;;;;
+1B177;NUSHU CHARACTER-1B177;Lo;0;L;;;;;N;;;;;
+1B178;NUSHU CHARACTER-1B178;Lo;0;L;;;;;N;;;;;
+1B179;NUSHU CHARACTER-1B179;Lo;0;L;;;;;N;;;;;
+1B17A;NUSHU CHARACTER-1B17A;Lo;0;L;;;;;N;;;;;
+1B17B;NUSHU CHARACTER-1B17B;Lo;0;L;;;;;N;;;;;
+1B17C;NUSHU CHARACTER-1B17C;Lo;0;L;;;;;N;;;;;
+1B17D;NUSHU CHARACTER-1B17D;Lo;0;L;;;;;N;;;;;
+1B17E;NUSHU CHARACTER-1B17E;Lo;0;L;;;;;N;;;;;
+1B17F;NUSHU CHARACTER-1B17F;Lo;0;L;;;;;N;;;;;
+1B180;NUSHU CHARACTER-1B180;Lo;0;L;;;;;N;;;;;
+1B181;NUSHU CHARACTER-1B181;Lo;0;L;;;;;N;;;;;
+1B182;NUSHU CHARACTER-1B182;Lo;0;L;;;;;N;;;;;
+1B183;NUSHU CHARACTER-1B183;Lo;0;L;;;;;N;;;;;
+1B184;NUSHU CHARACTER-1B184;Lo;0;L;;;;;N;;;;;
+1B185;NUSHU CHARACTER-1B185;Lo;0;L;;;;;N;;;;;
+1B186;NUSHU CHARACTER-1B186;Lo;0;L;;;;;N;;;;;
+1B187;NUSHU CHARACTER-1B187;Lo;0;L;;;;;N;;;;;
+1B188;NUSHU CHARACTER-1B188;Lo;0;L;;;;;N;;;;;
+1B189;NUSHU CHARACTER-1B189;Lo;0;L;;;;;N;;;;;
+1B18A;NUSHU CHARACTER-1B18A;Lo;0;L;;;;;N;;;;;
+1B18B;NUSHU CHARACTER-1B18B;Lo;0;L;;;;;N;;;;;
+1B18C;NUSHU CHARACTER-1B18C;Lo;0;L;;;;;N;;;;;
+1B18D;NUSHU CHARACTER-1B18D;Lo;0;L;;;;;N;;;;;
+1B18E;NUSHU CHARACTER-1B18E;Lo;0;L;;;;;N;;;;;
+1B18F;NUSHU CHARACTER-1B18F;Lo;0;L;;;;;N;;;;;
+1B190;NUSHU CHARACTER-1B190;Lo;0;L;;;;;N;;;;;
+1B191;NUSHU CHARACTER-1B191;Lo;0;L;;;;;N;;;;;
+1B192;NUSHU CHARACTER-1B192;Lo;0;L;;;;;N;;;;;
+1B193;NUSHU CHARACTER-1B193;Lo;0;L;;;;;N;;;;;
+1B194;NUSHU CHARACTER-1B194;Lo;0;L;;;;;N;;;;;
+1B195;NUSHU CHARACTER-1B195;Lo;0;L;;;;;N;;;;;
+1B196;NUSHU CHARACTER-1B196;Lo;0;L;;;;;N;;;;;
+1B197;NUSHU CHARACTER-1B197;Lo;0;L;;;;;N;;;;;
+1B198;NUSHU CHARACTER-1B198;Lo;0;L;;;;;N;;;;;
+1B199;NUSHU CHARACTER-1B199;Lo;0;L;;;;;N;;;;;
+1B19A;NUSHU CHARACTER-1B19A;Lo;0;L;;;;;N;;;;;
+1B19B;NUSHU CHARACTER-1B19B;Lo;0;L;;;;;N;;;;;
+1B19C;NUSHU CHARACTER-1B19C;Lo;0;L;;;;;N;;;;;
+1B19D;NUSHU CHARACTER-1B19D;Lo;0;L;;;;;N;;;;;
+1B19E;NUSHU CHARACTER-1B19E;Lo;0;L;;;;;N;;;;;
+1B19F;NUSHU CHARACTER-1B19F;Lo;0;L;;;;;N;;;;;
+1B1A0;NUSHU CHARACTER-1B1A0;Lo;0;L;;;;;N;;;;;
+1B1A1;NUSHU CHARACTER-1B1A1;Lo;0;L;;;;;N;;;;;
+1B1A2;NUSHU CHARACTER-1B1A2;Lo;0;L;;;;;N;;;;;
+1B1A3;NUSHU CHARACTER-1B1A3;Lo;0;L;;;;;N;;;;;
+1B1A4;NUSHU CHARACTER-1B1A4;Lo;0;L;;;;;N;;;;;
+1B1A5;NUSHU CHARACTER-1B1A5;Lo;0;L;;;;;N;;;;;
+1B1A6;NUSHU CHARACTER-1B1A6;Lo;0;L;;;;;N;;;;;
+1B1A7;NUSHU CHARACTER-1B1A7;Lo;0;L;;;;;N;;;;;
+1B1A8;NUSHU CHARACTER-1B1A8;Lo;0;L;;;;;N;;;;;
+1B1A9;NUSHU CHARACTER-1B1A9;Lo;0;L;;;;;N;;;;;
+1B1AA;NUSHU CHARACTER-1B1AA;Lo;0;L;;;;;N;;;;;
+1B1AB;NUSHU CHARACTER-1B1AB;Lo;0;L;;;;;N;;;;;
+1B1AC;NUSHU CHARACTER-1B1AC;Lo;0;L;;;;;N;;;;;
+1B1AD;NUSHU CHARACTER-1B1AD;Lo;0;L;;;;;N;;;;;
+1B1AE;NUSHU CHARACTER-1B1AE;Lo;0;L;;;;;N;;;;;
+1B1AF;NUSHU CHARACTER-1B1AF;Lo;0;L;;;;;N;;;;;
+1B1B0;NUSHU CHARACTER-1B1B0;Lo;0;L;;;;;N;;;;;
+1B1B1;NUSHU CHARACTER-1B1B1;Lo;0;L;;;;;N;;;;;
+1B1B2;NUSHU CHARACTER-1B1B2;Lo;0;L;;;;;N;;;;;
+1B1B3;NUSHU CHARACTER-1B1B3;Lo;0;L;;;;;N;;;;;
+1B1B4;NUSHU CHARACTER-1B1B4;Lo;0;L;;;;;N;;;;;
+1B1B5;NUSHU CHARACTER-1B1B5;Lo;0;L;;;;;N;;;;;
+1B1B6;NUSHU CHARACTER-1B1B6;Lo;0;L;;;;;N;;;;;
+1B1B7;NUSHU CHARACTER-1B1B7;Lo;0;L;;;;;N;;;;;
+1B1B8;NUSHU CHARACTER-1B1B8;Lo;0;L;;;;;N;;;;;
+1B1B9;NUSHU CHARACTER-1B1B9;Lo;0;L;;;;;N;;;;;
+1B1BA;NUSHU CHARACTER-1B1BA;Lo;0;L;;;;;N;;;;;
+1B1BB;NUSHU CHARACTER-1B1BB;Lo;0;L;;;;;N;;;;;
+1B1BC;NUSHU CHARACTER-1B1BC;Lo;0;L;;;;;N;;;;;
+1B1BD;NUSHU CHARACTER-1B1BD;Lo;0;L;;;;;N;;;;;
+1B1BE;NUSHU CHARACTER-1B1BE;Lo;0;L;;;;;N;;;;;
+1B1BF;NUSHU CHARACTER-1B1BF;Lo;0;L;;;;;N;;;;;
+1B1C0;NUSHU CHARACTER-1B1C0;Lo;0;L;;;;;N;;;;;
+1B1C1;NUSHU CHARACTER-1B1C1;Lo;0;L;;;;;N;;;;;
+1B1C2;NUSHU CHARACTER-1B1C2;Lo;0;L;;;;;N;;;;;
+1B1C3;NUSHU CHARACTER-1B1C3;Lo;0;L;;;;;N;;;;;
+1B1C4;NUSHU CHARACTER-1B1C4;Lo;0;L;;;;;N;;;;;
+1B1C5;NUSHU CHARACTER-1B1C5;Lo;0;L;;;;;N;;;;;
+1B1C6;NUSHU CHARACTER-1B1C6;Lo;0;L;;;;;N;;;;;
+1B1C7;NUSHU CHARACTER-1B1C7;Lo;0;L;;;;;N;;;;;
+1B1C8;NUSHU CHARACTER-1B1C8;Lo;0;L;;;;;N;;;;;
+1B1C9;NUSHU CHARACTER-1B1C9;Lo;0;L;;;;;N;;;;;
+1B1CA;NUSHU CHARACTER-1B1CA;Lo;0;L;;;;;N;;;;;
+1B1CB;NUSHU CHARACTER-1B1CB;Lo;0;L;;;;;N;;;;;
+1B1CC;NUSHU CHARACTER-1B1CC;Lo;0;L;;;;;N;;;;;
+1B1CD;NUSHU CHARACTER-1B1CD;Lo;0;L;;;;;N;;;;;
+1B1CE;NUSHU CHARACTER-1B1CE;Lo;0;L;;;;;N;;;;;
+1B1CF;NUSHU CHARACTER-1B1CF;Lo;0;L;;;;;N;;;;;
+1B1D0;NUSHU CHARACTER-1B1D0;Lo;0;L;;;;;N;;;;;
+1B1D1;NUSHU CHARACTER-1B1D1;Lo;0;L;;;;;N;;;;;
+1B1D2;NUSHU CHARACTER-1B1D2;Lo;0;L;;;;;N;;;;;
+1B1D3;NUSHU CHARACTER-1B1D3;Lo;0;L;;;;;N;;;;;
+1B1D4;NUSHU CHARACTER-1B1D4;Lo;0;L;;;;;N;;;;;
+1B1D5;NUSHU CHARACTER-1B1D5;Lo;0;L;;;;;N;;;;;
+1B1D6;NUSHU CHARACTER-1B1D6;Lo;0;L;;;;;N;;;;;
+1B1D7;NUSHU CHARACTER-1B1D7;Lo;0;L;;;;;N;;;;;
+1B1D8;NUSHU CHARACTER-1B1D8;Lo;0;L;;;;;N;;;;;
+1B1D9;NUSHU CHARACTER-1B1D9;Lo;0;L;;;;;N;;;;;
+1B1DA;NUSHU CHARACTER-1B1DA;Lo;0;L;;;;;N;;;;;
+1B1DB;NUSHU CHARACTER-1B1DB;Lo;0;L;;;;;N;;;;;
+1B1DC;NUSHU CHARACTER-1B1DC;Lo;0;L;;;;;N;;;;;
+1B1DD;NUSHU CHARACTER-1B1DD;Lo;0;L;;;;;N;;;;;
+1B1DE;NUSHU CHARACTER-1B1DE;Lo;0;L;;;;;N;;;;;
+1B1DF;NUSHU CHARACTER-1B1DF;Lo;0;L;;;;;N;;;;;
+1B1E0;NUSHU CHARACTER-1B1E0;Lo;0;L;;;;;N;;;;;
+1B1E1;NUSHU CHARACTER-1B1E1;Lo;0;L;;;;;N;;;;;
+1B1E2;NUSHU CHARACTER-1B1E2;Lo;0;L;;;;;N;;;;;
+1B1E3;NUSHU CHARACTER-1B1E3;Lo;0;L;;;;;N;;;;;
+1B1E4;NUSHU CHARACTER-1B1E4;Lo;0;L;;;;;N;;;;;
+1B1E5;NUSHU CHARACTER-1B1E5;Lo;0;L;;;;;N;;;;;
+1B1E6;NUSHU CHARACTER-1B1E6;Lo;0;L;;;;;N;;;;;
+1B1E7;NUSHU CHARACTER-1B1E7;Lo;0;L;;;;;N;;;;;
+1B1E8;NUSHU CHARACTER-1B1E8;Lo;0;L;;;;;N;;;;;
+1B1E9;NUSHU CHARACTER-1B1E9;Lo;0;L;;;;;N;;;;;
+1B1EA;NUSHU CHARACTER-1B1EA;Lo;0;L;;;;;N;;;;;
+1B1EB;NUSHU CHARACTER-1B1EB;Lo;0;L;;;;;N;;;;;
+1B1EC;NUSHU CHARACTER-1B1EC;Lo;0;L;;;;;N;;;;;
+1B1ED;NUSHU CHARACTER-1B1ED;Lo;0;L;;;;;N;;;;;
+1B1EE;NUSHU CHARACTER-1B1EE;Lo;0;L;;;;;N;;;;;
+1B1EF;NUSHU CHARACTER-1B1EF;Lo;0;L;;;;;N;;;;;
+1B1F0;NUSHU CHARACTER-1B1F0;Lo;0;L;;;;;N;;;;;
+1B1F1;NUSHU CHARACTER-1B1F1;Lo;0;L;;;;;N;;;;;
+1B1F2;NUSHU CHARACTER-1B1F2;Lo;0;L;;;;;N;;;;;
+1B1F3;NUSHU CHARACTER-1B1F3;Lo;0;L;;;;;N;;;;;
+1B1F4;NUSHU CHARACTER-1B1F4;Lo;0;L;;;;;N;;;;;
+1B1F5;NUSHU CHARACTER-1B1F5;Lo;0;L;;;;;N;;;;;
+1B1F6;NUSHU CHARACTER-1B1F6;Lo;0;L;;;;;N;;;;;
+1B1F7;NUSHU CHARACTER-1B1F7;Lo;0;L;;;;;N;;;;;
+1B1F8;NUSHU CHARACTER-1B1F8;Lo;0;L;;;;;N;;;;;
+1B1F9;NUSHU CHARACTER-1B1F9;Lo;0;L;;;;;N;;;;;
+1B1FA;NUSHU CHARACTER-1B1FA;Lo;0;L;;;;;N;;;;;
+1B1FB;NUSHU CHARACTER-1B1FB;Lo;0;L;;;;;N;;;;;
+1B1FC;NUSHU CHARACTER-1B1FC;Lo;0;L;;;;;N;;;;;
+1B1FD;NUSHU CHARACTER-1B1FD;Lo;0;L;;;;;N;;;;;
+1B1FE;NUSHU CHARACTER-1B1FE;Lo;0;L;;;;;N;;;;;
+1B1FF;NUSHU CHARACTER-1B1FF;Lo;0;L;;;;;N;;;;;
+1B200;NUSHU CHARACTER-1B200;Lo;0;L;;;;;N;;;;;
+1B201;NUSHU CHARACTER-1B201;Lo;0;L;;;;;N;;;;;
+1B202;NUSHU CHARACTER-1B202;Lo;0;L;;;;;N;;;;;
+1B203;NUSHU CHARACTER-1B203;Lo;0;L;;;;;N;;;;;
+1B204;NUSHU CHARACTER-1B204;Lo;0;L;;;;;N;;;;;
+1B205;NUSHU CHARACTER-1B205;Lo;0;L;;;;;N;;;;;
+1B206;NUSHU CHARACTER-1B206;Lo;0;L;;;;;N;;;;;
+1B207;NUSHU CHARACTER-1B207;Lo;0;L;;;;;N;;;;;
+1B208;NUSHU CHARACTER-1B208;Lo;0;L;;;;;N;;;;;
+1B209;NUSHU CHARACTER-1B209;Lo;0;L;;;;;N;;;;;
+1B20A;NUSHU CHARACTER-1B20A;Lo;0;L;;;;;N;;;;;
+1B20B;NUSHU CHARACTER-1B20B;Lo;0;L;;;;;N;;;;;
+1B20C;NUSHU CHARACTER-1B20C;Lo;0;L;;;;;N;;;;;
+1B20D;NUSHU CHARACTER-1B20D;Lo;0;L;;;;;N;;;;;
+1B20E;NUSHU CHARACTER-1B20E;Lo;0;L;;;;;N;;;;;
+1B20F;NUSHU CHARACTER-1B20F;Lo;0;L;;;;;N;;;;;
+1B210;NUSHU CHARACTER-1B210;Lo;0;L;;;;;N;;;;;
+1B211;NUSHU CHARACTER-1B211;Lo;0;L;;;;;N;;;;;
+1B212;NUSHU CHARACTER-1B212;Lo;0;L;;;;;N;;;;;
+1B213;NUSHU CHARACTER-1B213;Lo;0;L;;;;;N;;;;;
+1B214;NUSHU CHARACTER-1B214;Lo;0;L;;;;;N;;;;;
+1B215;NUSHU CHARACTER-1B215;Lo;0;L;;;;;N;;;;;
+1B216;NUSHU CHARACTER-1B216;Lo;0;L;;;;;N;;;;;
+1B217;NUSHU CHARACTER-1B217;Lo;0;L;;;;;N;;;;;
+1B218;NUSHU CHARACTER-1B218;Lo;0;L;;;;;N;;;;;
+1B219;NUSHU CHARACTER-1B219;Lo;0;L;;;;;N;;;;;
+1B21A;NUSHU CHARACTER-1B21A;Lo;0;L;;;;;N;;;;;
+1B21B;NUSHU CHARACTER-1B21B;Lo;0;L;;;;;N;;;;;
+1B21C;NUSHU CHARACTER-1B21C;Lo;0;L;;;;;N;;;;;
+1B21D;NUSHU CHARACTER-1B21D;Lo;0;L;;;;;N;;;;;
+1B21E;NUSHU CHARACTER-1B21E;Lo;0;L;;;;;N;;;;;
+1B21F;NUSHU CHARACTER-1B21F;Lo;0;L;;;;;N;;;;;
+1B220;NUSHU CHARACTER-1B220;Lo;0;L;;;;;N;;;;;
+1B221;NUSHU CHARACTER-1B221;Lo;0;L;;;;;N;;;;;
+1B222;NUSHU CHARACTER-1B222;Lo;0;L;;;;;N;;;;;
+1B223;NUSHU CHARACTER-1B223;Lo;0;L;;;;;N;;;;;
+1B224;NUSHU CHARACTER-1B224;Lo;0;L;;;;;N;;;;;
+1B225;NUSHU CHARACTER-1B225;Lo;0;L;;;;;N;;;;;
+1B226;NUSHU CHARACTER-1B226;Lo;0;L;;;;;N;;;;;
+1B227;NUSHU CHARACTER-1B227;Lo;0;L;;;;;N;;;;;
+1B228;NUSHU CHARACTER-1B228;Lo;0;L;;;;;N;;;;;
+1B229;NUSHU CHARACTER-1B229;Lo;0;L;;;;;N;;;;;
+1B22A;NUSHU CHARACTER-1B22A;Lo;0;L;;;;;N;;;;;
+1B22B;NUSHU CHARACTER-1B22B;Lo;0;L;;;;;N;;;;;
+1B22C;NUSHU CHARACTER-1B22C;Lo;0;L;;;;;N;;;;;
+1B22D;NUSHU CHARACTER-1B22D;Lo;0;L;;;;;N;;;;;
+1B22E;NUSHU CHARACTER-1B22E;Lo;0;L;;;;;N;;;;;
+1B22F;NUSHU CHARACTER-1B22F;Lo;0;L;;;;;N;;;;;
+1B230;NUSHU CHARACTER-1B230;Lo;0;L;;;;;N;;;;;
+1B231;NUSHU CHARACTER-1B231;Lo;0;L;;;;;N;;;;;
+1B232;NUSHU CHARACTER-1B232;Lo;0;L;;;;;N;;;;;
+1B233;NUSHU CHARACTER-1B233;Lo;0;L;;;;;N;;;;;
+1B234;NUSHU CHARACTER-1B234;Lo;0;L;;;;;N;;;;;
+1B235;NUSHU CHARACTER-1B235;Lo;0;L;;;;;N;;;;;
+1B236;NUSHU CHARACTER-1B236;Lo;0;L;;;;;N;;;;;
+1B237;NUSHU CHARACTER-1B237;Lo;0;L;;;;;N;;;;;
+1B238;NUSHU CHARACTER-1B238;Lo;0;L;;;;;N;;;;;
+1B239;NUSHU CHARACTER-1B239;Lo;0;L;;;;;N;;;;;
+1B23A;NUSHU CHARACTER-1B23A;Lo;0;L;;;;;N;;;;;
+1B23B;NUSHU CHARACTER-1B23B;Lo;0;L;;;;;N;;;;;
+1B23C;NUSHU CHARACTER-1B23C;Lo;0;L;;;;;N;;;;;
+1B23D;NUSHU CHARACTER-1B23D;Lo;0;L;;;;;N;;;;;
+1B23E;NUSHU CHARACTER-1B23E;Lo;0;L;;;;;N;;;;;
+1B23F;NUSHU CHARACTER-1B23F;Lo;0;L;;;;;N;;;;;
+1B240;NUSHU CHARACTER-1B240;Lo;0;L;;;;;N;;;;;
+1B241;NUSHU CHARACTER-1B241;Lo;0;L;;;;;N;;;;;
+1B242;NUSHU CHARACTER-1B242;Lo;0;L;;;;;N;;;;;
+1B243;NUSHU CHARACTER-1B243;Lo;0;L;;;;;N;;;;;
+1B244;NUSHU CHARACTER-1B244;Lo;0;L;;;;;N;;;;;
+1B245;NUSHU CHARACTER-1B245;Lo;0;L;;;;;N;;;;;
+1B246;NUSHU CHARACTER-1B246;Lo;0;L;;;;;N;;;;;
+1B247;NUSHU CHARACTER-1B247;Lo;0;L;;;;;N;;;;;
+1B248;NUSHU CHARACTER-1B248;Lo;0;L;;;;;N;;;;;
+1B249;NUSHU CHARACTER-1B249;Lo;0;L;;;;;N;;;;;
+1B24A;NUSHU CHARACTER-1B24A;Lo;0;L;;;;;N;;;;;
+1B24B;NUSHU CHARACTER-1B24B;Lo;0;L;;;;;N;;;;;
+1B24C;NUSHU CHARACTER-1B24C;Lo;0;L;;;;;N;;;;;
+1B24D;NUSHU CHARACTER-1B24D;Lo;0;L;;;;;N;;;;;
+1B24E;NUSHU CHARACTER-1B24E;Lo;0;L;;;;;N;;;;;
+1B24F;NUSHU CHARACTER-1B24F;Lo;0;L;;;;;N;;;;;
+1B250;NUSHU CHARACTER-1B250;Lo;0;L;;;;;N;;;;;
+1B251;NUSHU CHARACTER-1B251;Lo;0;L;;;;;N;;;;;
+1B252;NUSHU CHARACTER-1B252;Lo;0;L;;;;;N;;;;;
+1B253;NUSHU CHARACTER-1B253;Lo;0;L;;;;;N;;;;;
+1B254;NUSHU CHARACTER-1B254;Lo;0;L;;;;;N;;;;;
+1B255;NUSHU CHARACTER-1B255;Lo;0;L;;;;;N;;;;;
+1B256;NUSHU CHARACTER-1B256;Lo;0;L;;;;;N;;;;;
+1B257;NUSHU CHARACTER-1B257;Lo;0;L;;;;;N;;;;;
+1B258;NUSHU CHARACTER-1B258;Lo;0;L;;;;;N;;;;;
+1B259;NUSHU CHARACTER-1B259;Lo;0;L;;;;;N;;;;;
+1B25A;NUSHU CHARACTER-1B25A;Lo;0;L;;;;;N;;;;;
+1B25B;NUSHU CHARACTER-1B25B;Lo;0;L;;;;;N;;;;;
+1B25C;NUSHU CHARACTER-1B25C;Lo;0;L;;;;;N;;;;;
+1B25D;NUSHU CHARACTER-1B25D;Lo;0;L;;;;;N;;;;;
+1B25E;NUSHU CHARACTER-1B25E;Lo;0;L;;;;;N;;;;;
+1B25F;NUSHU CHARACTER-1B25F;Lo;0;L;;;;;N;;;;;
+1B260;NUSHU CHARACTER-1B260;Lo;0;L;;;;;N;;;;;
+1B261;NUSHU CHARACTER-1B261;Lo;0;L;;;;;N;;;;;
+1B262;NUSHU CHARACTER-1B262;Lo;0;L;;;;;N;;;;;
+1B263;NUSHU CHARACTER-1B263;Lo;0;L;;;;;N;;;;;
+1B264;NUSHU CHARACTER-1B264;Lo;0;L;;;;;N;;;;;
+1B265;NUSHU CHARACTER-1B265;Lo;0;L;;;;;N;;;;;
+1B266;NUSHU CHARACTER-1B266;Lo;0;L;;;;;N;;;;;
+1B267;NUSHU CHARACTER-1B267;Lo;0;L;;;;;N;;;;;
+1B268;NUSHU CHARACTER-1B268;Lo;0;L;;;;;N;;;;;
+1B269;NUSHU CHARACTER-1B269;Lo;0;L;;;;;N;;;;;
+1B26A;NUSHU CHARACTER-1B26A;Lo;0;L;;;;;N;;;;;
+1B26B;NUSHU CHARACTER-1B26B;Lo;0;L;;;;;N;;;;;
+1B26C;NUSHU CHARACTER-1B26C;Lo;0;L;;;;;N;;;;;
+1B26D;NUSHU CHARACTER-1B26D;Lo;0;L;;;;;N;;;;;
+1B26E;NUSHU CHARACTER-1B26E;Lo;0;L;;;;;N;;;;;
+1B26F;NUSHU CHARACTER-1B26F;Lo;0;L;;;;;N;;;;;
+1B270;NUSHU CHARACTER-1B270;Lo;0;L;;;;;N;;;;;
+1B271;NUSHU CHARACTER-1B271;Lo;0;L;;;;;N;;;;;
+1B272;NUSHU CHARACTER-1B272;Lo;0;L;;;;;N;;;;;
+1B273;NUSHU CHARACTER-1B273;Lo;0;L;;;;;N;;;;;
+1B274;NUSHU CHARACTER-1B274;Lo;0;L;;;;;N;;;;;
+1B275;NUSHU CHARACTER-1B275;Lo;0;L;;;;;N;;;;;
+1B276;NUSHU CHARACTER-1B276;Lo;0;L;;;;;N;;;;;
+1B277;NUSHU CHARACTER-1B277;Lo;0;L;;;;;N;;;;;
+1B278;NUSHU CHARACTER-1B278;Lo;0;L;;;;;N;;;;;
+1B279;NUSHU CHARACTER-1B279;Lo;0;L;;;;;N;;;;;
+1B27A;NUSHU CHARACTER-1B27A;Lo;0;L;;;;;N;;;;;
+1B27B;NUSHU CHARACTER-1B27B;Lo;0;L;;;;;N;;;;;
+1B27C;NUSHU CHARACTER-1B27C;Lo;0;L;;;;;N;;;;;
+1B27D;NUSHU CHARACTER-1B27D;Lo;0;L;;;;;N;;;;;
+1B27E;NUSHU CHARACTER-1B27E;Lo;0;L;;;;;N;;;;;
+1B27F;NUSHU CHARACTER-1B27F;Lo;0;L;;;;;N;;;;;
+1B280;NUSHU CHARACTER-1B280;Lo;0;L;;;;;N;;;;;
+1B281;NUSHU CHARACTER-1B281;Lo;0;L;;;;;N;;;;;
+1B282;NUSHU CHARACTER-1B282;Lo;0;L;;;;;N;;;;;
+1B283;NUSHU CHARACTER-1B283;Lo;0;L;;;;;N;;;;;
+1B284;NUSHU CHARACTER-1B284;Lo;0;L;;;;;N;;;;;
+1B285;NUSHU CHARACTER-1B285;Lo;0;L;;;;;N;;;;;
+1B286;NUSHU CHARACTER-1B286;Lo;0;L;;;;;N;;;;;
+1B287;NUSHU CHARACTER-1B287;Lo;0;L;;;;;N;;;;;
+1B288;NUSHU CHARACTER-1B288;Lo;0;L;;;;;N;;;;;
+1B289;NUSHU CHARACTER-1B289;Lo;0;L;;;;;N;;;;;
+1B28A;NUSHU CHARACTER-1B28A;Lo;0;L;;;;;N;;;;;
+1B28B;NUSHU CHARACTER-1B28B;Lo;0;L;;;;;N;;;;;
+1B28C;NUSHU CHARACTER-1B28C;Lo;0;L;;;;;N;;;;;
+1B28D;NUSHU CHARACTER-1B28D;Lo;0;L;;;;;N;;;;;
+1B28E;NUSHU CHARACTER-1B28E;Lo;0;L;;;;;N;;;;;
+1B28F;NUSHU CHARACTER-1B28F;Lo;0;L;;;;;N;;;;;
+1B290;NUSHU CHARACTER-1B290;Lo;0;L;;;;;N;;;;;
+1B291;NUSHU CHARACTER-1B291;Lo;0;L;;;;;N;;;;;
+1B292;NUSHU CHARACTER-1B292;Lo;0;L;;;;;N;;;;;
+1B293;NUSHU CHARACTER-1B293;Lo;0;L;;;;;N;;;;;
+1B294;NUSHU CHARACTER-1B294;Lo;0;L;;;;;N;;;;;
+1B295;NUSHU CHARACTER-1B295;Lo;0;L;;;;;N;;;;;
+1B296;NUSHU CHARACTER-1B296;Lo;0;L;;;;;N;;;;;
+1B297;NUSHU CHARACTER-1B297;Lo;0;L;;;;;N;;;;;
+1B298;NUSHU CHARACTER-1B298;Lo;0;L;;;;;N;;;;;
+1B299;NUSHU CHARACTER-1B299;Lo;0;L;;;;;N;;;;;
+1B29A;NUSHU CHARACTER-1B29A;Lo;0;L;;;;;N;;;;;
+1B29B;NUSHU CHARACTER-1B29B;Lo;0;L;;;;;N;;;;;
+1B29C;NUSHU CHARACTER-1B29C;Lo;0;L;;;;;N;;;;;
+1B29D;NUSHU CHARACTER-1B29D;Lo;0;L;;;;;N;;;;;
+1B29E;NUSHU CHARACTER-1B29E;Lo;0;L;;;;;N;;;;;
+1B29F;NUSHU CHARACTER-1B29F;Lo;0;L;;;;;N;;;;;
+1B2A0;NUSHU CHARACTER-1B2A0;Lo;0;L;;;;;N;;;;;
+1B2A1;NUSHU CHARACTER-1B2A1;Lo;0;L;;;;;N;;;;;
+1B2A2;NUSHU CHARACTER-1B2A2;Lo;0;L;;;;;N;;;;;
+1B2A3;NUSHU CHARACTER-1B2A3;Lo;0;L;;;;;N;;;;;
+1B2A4;NUSHU CHARACTER-1B2A4;Lo;0;L;;;;;N;;;;;
+1B2A5;NUSHU CHARACTER-1B2A5;Lo;0;L;;;;;N;;;;;
+1B2A6;NUSHU CHARACTER-1B2A6;Lo;0;L;;;;;N;;;;;
+1B2A7;NUSHU CHARACTER-1B2A7;Lo;0;L;;;;;N;;;;;
+1B2A8;NUSHU CHARACTER-1B2A8;Lo;0;L;;;;;N;;;;;
+1B2A9;NUSHU CHARACTER-1B2A9;Lo;0;L;;;;;N;;;;;
+1B2AA;NUSHU CHARACTER-1B2AA;Lo;0;L;;;;;N;;;;;
+1B2AB;NUSHU CHARACTER-1B2AB;Lo;0;L;;;;;N;;;;;
+1B2AC;NUSHU CHARACTER-1B2AC;Lo;0;L;;;;;N;;;;;
+1B2AD;NUSHU CHARACTER-1B2AD;Lo;0;L;;;;;N;;;;;
+1B2AE;NUSHU CHARACTER-1B2AE;Lo;0;L;;;;;N;;;;;
+1B2AF;NUSHU CHARACTER-1B2AF;Lo;0;L;;;;;N;;;;;
+1B2B0;NUSHU CHARACTER-1B2B0;Lo;0;L;;;;;N;;;;;
+1B2B1;NUSHU CHARACTER-1B2B1;Lo;0;L;;;;;N;;;;;
+1B2B2;NUSHU CHARACTER-1B2B2;Lo;0;L;;;;;N;;;;;
+1B2B3;NUSHU CHARACTER-1B2B3;Lo;0;L;;;;;N;;;;;
+1B2B4;NUSHU CHARACTER-1B2B4;Lo;0;L;;;;;N;;;;;
+1B2B5;NUSHU CHARACTER-1B2B5;Lo;0;L;;;;;N;;;;;
+1B2B6;NUSHU CHARACTER-1B2B6;Lo;0;L;;;;;N;;;;;
+1B2B7;NUSHU CHARACTER-1B2B7;Lo;0;L;;;;;N;;;;;
+1B2B8;NUSHU CHARACTER-1B2B8;Lo;0;L;;;;;N;;;;;
+1B2B9;NUSHU CHARACTER-1B2B9;Lo;0;L;;;;;N;;;;;
+1B2BA;NUSHU CHARACTER-1B2BA;Lo;0;L;;;;;N;;;;;
+1B2BB;NUSHU CHARACTER-1B2BB;Lo;0;L;;;;;N;;;;;
+1B2BC;NUSHU CHARACTER-1B2BC;Lo;0;L;;;;;N;;;;;
+1B2BD;NUSHU CHARACTER-1B2BD;Lo;0;L;;;;;N;;;;;
+1B2BE;NUSHU CHARACTER-1B2BE;Lo;0;L;;;;;N;;;;;
+1B2BF;NUSHU CHARACTER-1B2BF;Lo;0;L;;;;;N;;;;;
+1B2C0;NUSHU CHARACTER-1B2C0;Lo;0;L;;;;;N;;;;;
+1B2C1;NUSHU CHARACTER-1B2C1;Lo;0;L;;;;;N;;;;;
+1B2C2;NUSHU CHARACTER-1B2C2;Lo;0;L;;;;;N;;;;;
+1B2C3;NUSHU CHARACTER-1B2C3;Lo;0;L;;;;;N;;;;;
+1B2C4;NUSHU CHARACTER-1B2C4;Lo;0;L;;;;;N;;;;;
+1B2C5;NUSHU CHARACTER-1B2C5;Lo;0;L;;;;;N;;;;;
+1B2C6;NUSHU CHARACTER-1B2C6;Lo;0;L;;;;;N;;;;;
+1B2C7;NUSHU CHARACTER-1B2C7;Lo;0;L;;;;;N;;;;;
+1B2C8;NUSHU CHARACTER-1B2C8;Lo;0;L;;;;;N;;;;;
+1B2C9;NUSHU CHARACTER-1B2C9;Lo;0;L;;;;;N;;;;;
+1B2CA;NUSHU CHARACTER-1B2CA;Lo;0;L;;;;;N;;;;;
+1B2CB;NUSHU CHARACTER-1B2CB;Lo;0;L;;;;;N;;;;;
+1B2CC;NUSHU CHARACTER-1B2CC;Lo;0;L;;;;;N;;;;;
+1B2CD;NUSHU CHARACTER-1B2CD;Lo;0;L;;;;;N;;;;;
+1B2CE;NUSHU CHARACTER-1B2CE;Lo;0;L;;;;;N;;;;;
+1B2CF;NUSHU CHARACTER-1B2CF;Lo;0;L;;;;;N;;;;;
+1B2D0;NUSHU CHARACTER-1B2D0;Lo;0;L;;;;;N;;;;;
+1B2D1;NUSHU CHARACTER-1B2D1;Lo;0;L;;;;;N;;;;;
+1B2D2;NUSHU CHARACTER-1B2D2;Lo;0;L;;;;;N;;;;;
+1B2D3;NUSHU CHARACTER-1B2D3;Lo;0;L;;;;;N;;;;;
+1B2D4;NUSHU CHARACTER-1B2D4;Lo;0;L;;;;;N;;;;;
+1B2D5;NUSHU CHARACTER-1B2D5;Lo;0;L;;;;;N;;;;;
+1B2D6;NUSHU CHARACTER-1B2D6;Lo;0;L;;;;;N;;;;;
+1B2D7;NUSHU CHARACTER-1B2D7;Lo;0;L;;;;;N;;;;;
+1B2D8;NUSHU CHARACTER-1B2D8;Lo;0;L;;;;;N;;;;;
+1B2D9;NUSHU CHARACTER-1B2D9;Lo;0;L;;;;;N;;;;;
+1B2DA;NUSHU CHARACTER-1B2DA;Lo;0;L;;;;;N;;;;;
+1B2DB;NUSHU CHARACTER-1B2DB;Lo;0;L;;;;;N;;;;;
+1B2DC;NUSHU CHARACTER-1B2DC;Lo;0;L;;;;;N;;;;;
+1B2DD;NUSHU CHARACTER-1B2DD;Lo;0;L;;;;;N;;;;;
+1B2DE;NUSHU CHARACTER-1B2DE;Lo;0;L;;;;;N;;;;;
+1B2DF;NUSHU CHARACTER-1B2DF;Lo;0;L;;;;;N;;;;;
+1B2E0;NUSHU CHARACTER-1B2E0;Lo;0;L;;;;;N;;;;;
+1B2E1;NUSHU CHARACTER-1B2E1;Lo;0;L;;;;;N;;;;;
+1B2E2;NUSHU CHARACTER-1B2E2;Lo;0;L;;;;;N;;;;;
+1B2E3;NUSHU CHARACTER-1B2E3;Lo;0;L;;;;;N;;;;;
+1B2E4;NUSHU CHARACTER-1B2E4;Lo;0;L;;;;;N;;;;;
+1B2E5;NUSHU CHARACTER-1B2E5;Lo;0;L;;;;;N;;;;;
+1B2E6;NUSHU CHARACTER-1B2E6;Lo;0;L;;;;;N;;;;;
+1B2E7;NUSHU CHARACTER-1B2E7;Lo;0;L;;;;;N;;;;;
+1B2E8;NUSHU CHARACTER-1B2E8;Lo;0;L;;;;;N;;;;;
+1B2E9;NUSHU CHARACTER-1B2E9;Lo;0;L;;;;;N;;;;;
+1B2EA;NUSHU CHARACTER-1B2EA;Lo;0;L;;;;;N;;;;;
+1B2EB;NUSHU CHARACTER-1B2EB;Lo;0;L;;;;;N;;;;;
+1B2EC;NUSHU CHARACTER-1B2EC;Lo;0;L;;;;;N;;;;;
+1B2ED;NUSHU CHARACTER-1B2ED;Lo;0;L;;;;;N;;;;;
+1B2EE;NUSHU CHARACTER-1B2EE;Lo;0;L;;;;;N;;;;;
+1B2EF;NUSHU CHARACTER-1B2EF;Lo;0;L;;;;;N;;;;;
+1B2F0;NUSHU CHARACTER-1B2F0;Lo;0;L;;;;;N;;;;;
+1B2F1;NUSHU CHARACTER-1B2F1;Lo;0;L;;;;;N;;;;;
+1B2F2;NUSHU CHARACTER-1B2F2;Lo;0;L;;;;;N;;;;;
+1B2F3;NUSHU CHARACTER-1B2F3;Lo;0;L;;;;;N;;;;;
+1B2F4;NUSHU CHARACTER-1B2F4;Lo;0;L;;;;;N;;;;;
+1B2F5;NUSHU CHARACTER-1B2F5;Lo;0;L;;;;;N;;;;;
+1B2F6;NUSHU CHARACTER-1B2F6;Lo;0;L;;;;;N;;;;;
+1B2F7;NUSHU CHARACTER-1B2F7;Lo;0;L;;;;;N;;;;;
+1B2F8;NUSHU CHARACTER-1B2F8;Lo;0;L;;;;;N;;;;;
+1B2F9;NUSHU CHARACTER-1B2F9;Lo;0;L;;;;;N;;;;;
+1B2FA;NUSHU CHARACTER-1B2FA;Lo;0;L;;;;;N;;;;;
+1B2FB;NUSHU CHARACTER-1B2FB;Lo;0;L;;;;;N;;;;;
+1BC00;DUPLOYAN LETTER H;Lo;0;L;;;;;N;;;;;
+1BC01;DUPLOYAN LETTER X;Lo;0;L;;;;;N;;;;;
+1BC02;DUPLOYAN LETTER P;Lo;0;L;;;;;N;;;;;
+1BC03;DUPLOYAN LETTER T;Lo;0;L;;;;;N;;;;;
+1BC04;DUPLOYAN LETTER F;Lo;0;L;;;;;N;;;;;
+1BC05;DUPLOYAN LETTER K;Lo;0;L;;;;;N;;;;;
+1BC06;DUPLOYAN LETTER L;Lo;0;L;;;;;N;;;;;
+1BC07;DUPLOYAN LETTER B;Lo;0;L;;;;;N;;;;;
+1BC08;DUPLOYAN LETTER D;Lo;0;L;;;;;N;;;;;
+1BC09;DUPLOYAN LETTER V;Lo;0;L;;;;;N;;;;;
+1BC0A;DUPLOYAN LETTER G;Lo;0;L;;;;;N;;;;;
+1BC0B;DUPLOYAN LETTER R;Lo;0;L;;;;;N;;;;;
+1BC0C;DUPLOYAN LETTER P N;Lo;0;L;;;;;N;;;;;
+1BC0D;DUPLOYAN LETTER D S;Lo;0;L;;;;;N;;;;;
+1BC0E;DUPLOYAN LETTER F N;Lo;0;L;;;;;N;;;;;
+1BC0F;DUPLOYAN LETTER K M;Lo;0;L;;;;;N;;;;;
+1BC10;DUPLOYAN LETTER R S;Lo;0;L;;;;;N;;;;;
+1BC11;DUPLOYAN LETTER TH;Lo;0;L;;;;;N;;;;;
+1BC12;DUPLOYAN LETTER SLOAN DH;Lo;0;L;;;;;N;;;;;
+1BC13;DUPLOYAN LETTER DH;Lo;0;L;;;;;N;;;;;
+1BC14;DUPLOYAN LETTER KK;Lo;0;L;;;;;N;;;;;
+1BC15;DUPLOYAN LETTER SLOAN J;Lo;0;L;;;;;N;;;;;
+1BC16;DUPLOYAN LETTER HL;Lo;0;L;;;;;N;;;;;
+1BC17;DUPLOYAN LETTER LH;Lo;0;L;;;;;N;;;;;
+1BC18;DUPLOYAN LETTER RH;Lo;0;L;;;;;N;;;;;
+1BC19;DUPLOYAN LETTER M;Lo;0;L;;;;;N;;;;;
+1BC1A;DUPLOYAN LETTER N;Lo;0;L;;;;;N;;;;;
+1BC1B;DUPLOYAN LETTER J;Lo;0;L;;;;;N;;;;;
+1BC1C;DUPLOYAN LETTER S;Lo;0;L;;;;;N;;;;;
+1BC1D;DUPLOYAN LETTER M N;Lo;0;L;;;;;N;;;;;
+1BC1E;DUPLOYAN LETTER N M;Lo;0;L;;;;;N;;;;;
+1BC1F;DUPLOYAN LETTER J M;Lo;0;L;;;;;N;;;;;
+1BC20;DUPLOYAN LETTER S J;Lo;0;L;;;;;N;;;;;
+1BC21;DUPLOYAN LETTER M WITH DOT;Lo;0;L;;;;;N;;;;;
+1BC22;DUPLOYAN LETTER N WITH DOT;Lo;0;L;;;;;N;;;;;
+1BC23;DUPLOYAN LETTER J WITH DOT;Lo;0;L;;;;;N;;;;;
+1BC24;DUPLOYAN LETTER J WITH DOTS INSIDE AND ABOVE;Lo;0;L;;;;;N;;;;;
+1BC25;DUPLOYAN LETTER S WITH DOT;Lo;0;L;;;;;N;;;;;
+1BC26;DUPLOYAN LETTER S WITH DOT BELOW;Lo;0;L;;;;;N;;;;;
+1BC27;DUPLOYAN LETTER M S;Lo;0;L;;;;;N;;;;;
+1BC28;DUPLOYAN LETTER N S;Lo;0;L;;;;;N;;;;;
+1BC29;DUPLOYAN LETTER J S;Lo;0;L;;;;;N;;;;;
+1BC2A;DUPLOYAN LETTER S S;Lo;0;L;;;;;N;;;;;
+1BC2B;DUPLOYAN LETTER M N S;Lo;0;L;;;;;N;;;;;
+1BC2C;DUPLOYAN LETTER N M S;Lo;0;L;;;;;N;;;;;
+1BC2D;DUPLOYAN LETTER J M S;Lo;0;L;;;;;N;;;;;
+1BC2E;DUPLOYAN LETTER S J S;Lo;0;L;;;;;N;;;;;
+1BC2F;DUPLOYAN LETTER J S WITH DOT;Lo;0;L;;;;;N;;;;;
+1BC30;DUPLOYAN LETTER J N;Lo;0;L;;;;;N;;;;;
+1BC31;DUPLOYAN LETTER J N S;Lo;0;L;;;;;N;;;;;
+1BC32;DUPLOYAN LETTER S T;Lo;0;L;;;;;N;;;;;
+1BC33;DUPLOYAN LETTER S T R;Lo;0;L;;;;;N;;;;;
+1BC34;DUPLOYAN LETTER S P;Lo;0;L;;;;;N;;;;;
+1BC35;DUPLOYAN LETTER S P R;Lo;0;L;;;;;N;;;;;
+1BC36;DUPLOYAN LETTER T S;Lo;0;L;;;;;N;;;;;
+1BC37;DUPLOYAN LETTER T R S;Lo;0;L;;;;;N;;;;;
+1BC38;DUPLOYAN LETTER W;Lo;0;L;;;;;N;;;;;
+1BC39;DUPLOYAN LETTER WH;Lo;0;L;;;;;N;;;;;
+1BC3A;DUPLOYAN LETTER W R;Lo;0;L;;;;;N;;;;;
+1BC3B;DUPLOYAN LETTER S N;Lo;0;L;;;;;N;;;;;
+1BC3C;DUPLOYAN LETTER S M;Lo;0;L;;;;;N;;;;;
+1BC3D;DUPLOYAN LETTER K R S;Lo;0;L;;;;;N;;;;;
+1BC3E;DUPLOYAN LETTER G R S;Lo;0;L;;;;;N;;;;;
+1BC3F;DUPLOYAN LETTER S K;Lo;0;L;;;;;N;;;;;
+1BC40;DUPLOYAN LETTER S K R;Lo;0;L;;;;;N;;;;;
+1BC41;DUPLOYAN LETTER A;Lo;0;L;;;;;N;;;;;
+1BC42;DUPLOYAN LETTER SLOAN OW;Lo;0;L;;;;;N;;;;;
+1BC43;DUPLOYAN LETTER OA;Lo;0;L;;;;;N;;;;;
+1BC44;DUPLOYAN LETTER O;Lo;0;L;;;;;N;;;;;
+1BC45;DUPLOYAN LETTER AOU;Lo;0;L;;;;;N;;;;;
+1BC46;DUPLOYAN LETTER I;Lo;0;L;;;;;N;;;;;
+1BC47;DUPLOYAN LETTER E;Lo;0;L;;;;;N;;;;;
+1BC48;DUPLOYAN LETTER IE;Lo;0;L;;;;;N;;;;;
+1BC49;DUPLOYAN LETTER SHORT I;Lo;0;L;;;;;N;;;;;
+1BC4A;DUPLOYAN LETTER UI;Lo;0;L;;;;;N;;;;;
+1BC4B;DUPLOYAN LETTER EE;Lo;0;L;;;;;N;;;;;
+1BC4C;DUPLOYAN LETTER SLOAN EH;Lo;0;L;;;;;N;;;;;
+1BC4D;DUPLOYAN LETTER ROMANIAN I;Lo;0;L;;;;;N;;;;;
+1BC4E;DUPLOYAN LETTER SLOAN EE;Lo;0;L;;;;;N;;;;;
+1BC4F;DUPLOYAN LETTER LONG I;Lo;0;L;;;;;N;;;;;
+1BC50;DUPLOYAN LETTER YE;Lo;0;L;;;;;N;;;;;
+1BC51;DUPLOYAN LETTER U;Lo;0;L;;;;;N;;;;;
+1BC52;DUPLOYAN LETTER EU;Lo;0;L;;;;;N;;;;;
+1BC53;DUPLOYAN LETTER XW;Lo;0;L;;;;;N;;;;;
+1BC54;DUPLOYAN LETTER U N;Lo;0;L;;;;;N;;;;;
+1BC55;DUPLOYAN LETTER LONG U;Lo;0;L;;;;;N;;;;;
+1BC56;DUPLOYAN LETTER ROMANIAN U;Lo;0;L;;;;;N;;;;;
+1BC57;DUPLOYAN LETTER UH;Lo;0;L;;;;;N;;;;;
+1BC58;DUPLOYAN LETTER SLOAN U;Lo;0;L;;;;;N;;;;;
+1BC59;DUPLOYAN LETTER OOH;Lo;0;L;;;;;N;;;;;
+1BC5A;DUPLOYAN LETTER OW;Lo;0;L;;;;;N;;;;;
+1BC5B;DUPLOYAN LETTER OU;Lo;0;L;;;;;N;;;;;
+1BC5C;DUPLOYAN LETTER WA;Lo;0;L;;;;;N;;;;;
+1BC5D;DUPLOYAN LETTER WO;Lo;0;L;;;;;N;;;;;
+1BC5E;DUPLOYAN LETTER WI;Lo;0;L;;;;;N;;;;;
+1BC5F;DUPLOYAN LETTER WEI;Lo;0;L;;;;;N;;;;;
+1BC60;DUPLOYAN LETTER WOW;Lo;0;L;;;;;N;;;;;
+1BC61;DUPLOYAN LETTER NASAL U;Lo;0;L;;;;;N;;;;;
+1BC62;DUPLOYAN LETTER NASAL O;Lo;0;L;;;;;N;;;;;
+1BC63;DUPLOYAN LETTER NASAL I;Lo;0;L;;;;;N;;;;;
+1BC64;DUPLOYAN LETTER NASAL A;Lo;0;L;;;;;N;;;;;
+1BC65;DUPLOYAN LETTER PERNIN AN;Lo;0;L;;;;;N;;;;;
+1BC66;DUPLOYAN LETTER PERNIN AM;Lo;0;L;;;;;N;;;;;
+1BC67;DUPLOYAN LETTER SLOAN EN;Lo;0;L;;;;;N;;;;;
+1BC68;DUPLOYAN LETTER SLOAN AN;Lo;0;L;;;;;N;;;;;
+1BC69;DUPLOYAN LETTER SLOAN ON;Lo;0;L;;;;;N;;;;;
+1BC6A;DUPLOYAN LETTER VOCALIC M;Lo;0;L;;;;;N;;;;;
+1BC70;DUPLOYAN AFFIX LEFT HORIZONTAL SECANT;Lo;0;L;;;;;N;;;;;
+1BC71;DUPLOYAN AFFIX MID HORIZONTAL SECANT;Lo;0;L;;;;;N;;;;;
+1BC72;DUPLOYAN AFFIX RIGHT HORIZONTAL SECANT;Lo;0;L;;;;;N;;;;;
+1BC73;DUPLOYAN AFFIX LOW VERTICAL SECANT;Lo;0;L;;;;;N;;;;;
+1BC74;DUPLOYAN AFFIX MID VERTICAL SECANT;Lo;0;L;;;;;N;;;;;
+1BC75;DUPLOYAN AFFIX HIGH VERTICAL SECANT;Lo;0;L;;;;;N;;;;;
+1BC76;DUPLOYAN AFFIX ATTACHED SECANT;Lo;0;L;;;;;N;;;;;
+1BC77;DUPLOYAN AFFIX ATTACHED LEFT-TO-RIGHT SECANT;Lo;0;L;;;;;N;;;;;
+1BC78;DUPLOYAN AFFIX ATTACHED TANGENT;Lo;0;L;;;;;N;;;;;
+1BC79;DUPLOYAN AFFIX ATTACHED TAIL;Lo;0;L;;;;;N;;;;;
+1BC7A;DUPLOYAN AFFIX ATTACHED E HOOK;Lo;0;L;;;;;N;;;;;
+1BC7B;DUPLOYAN AFFIX ATTACHED I HOOK;Lo;0;L;;;;;N;;;;;
+1BC7C;DUPLOYAN AFFIX ATTACHED TANGENT HOOK;Lo;0;L;;;;;N;;;;;
+1BC80;DUPLOYAN AFFIX HIGH ACUTE;Lo;0;L;;;;;N;;;;;
+1BC81;DUPLOYAN AFFIX HIGH TIGHT ACUTE;Lo;0;L;;;;;N;;;;;
+1BC82;DUPLOYAN AFFIX HIGH GRAVE;Lo;0;L;;;;;N;;;;;
+1BC83;DUPLOYAN AFFIX HIGH LONG GRAVE;Lo;0;L;;;;;N;;;;;
+1BC84;DUPLOYAN AFFIX HIGH DOT;Lo;0;L;;;;;N;;;;;
+1BC85;DUPLOYAN AFFIX HIGH CIRCLE;Lo;0;L;;;;;N;;;;;
+1BC86;DUPLOYAN AFFIX HIGH LINE;Lo;0;L;;;;;N;;;;;
+1BC87;DUPLOYAN AFFIX HIGH WAVE;Lo;0;L;;;;;N;;;;;
+1BC88;DUPLOYAN AFFIX HIGH VERTICAL;Lo;0;L;;;;;N;;;;;
+1BC90;DUPLOYAN AFFIX LOW ACUTE;Lo;0;L;;;;;N;;;;;
+1BC91;DUPLOYAN AFFIX LOW TIGHT ACUTE;Lo;0;L;;;;;N;;;;;
+1BC92;DUPLOYAN AFFIX LOW GRAVE;Lo;0;L;;;;;N;;;;;
+1BC93;DUPLOYAN AFFIX LOW LONG GRAVE;Lo;0;L;;;;;N;;;;;
+1BC94;DUPLOYAN AFFIX LOW DOT;Lo;0;L;;;;;N;;;;;
+1BC95;DUPLOYAN AFFIX LOW CIRCLE;Lo;0;L;;;;;N;;;;;
+1BC96;DUPLOYAN AFFIX LOW LINE;Lo;0;L;;;;;N;;;;;
+1BC97;DUPLOYAN AFFIX LOW WAVE;Lo;0;L;;;;;N;;;;;
+1BC98;DUPLOYAN AFFIX LOW VERTICAL;Lo;0;L;;;;;N;;;;;
+1BC99;DUPLOYAN AFFIX LOW ARROW;Lo;0;L;;;;;N;;;;;
+1BC9C;DUPLOYAN SIGN O WITH CROSS;So;0;L;;;;;N;;;;;
+1BC9D;DUPLOYAN THICK LETTER SELECTOR;Mn;0;NSM;;;;;N;;;;;
+1BC9E;DUPLOYAN DOUBLE MARK;Mn;1;NSM;;;;;N;;;;;
+1BC9F;DUPLOYAN PUNCTUATION CHINOOK FULL STOP;Po;0;L;;;;;N;;;;;
+1BCA0;SHORTHAND FORMAT LETTER OVERLAP;Cf;0;BN;;;;;N;;;;;
+1BCA1;SHORTHAND FORMAT CONTINUING OVERLAP;Cf;0;BN;;;;;N;;;;;
+1BCA2;SHORTHAND FORMAT DOWN STEP;Cf;0;BN;;;;;N;;;;;
+1BCA3;SHORTHAND FORMAT UP STEP;Cf;0;BN;;;;;N;;;;;
+1D000;BYZANTINE MUSICAL SYMBOL PSILI;So;0;L;;;;;N;;;;;
+1D001;BYZANTINE MUSICAL SYMBOL DASEIA;So;0;L;;;;;N;;;;;
+1D002;BYZANTINE MUSICAL SYMBOL PERISPOMENI;So;0;L;;;;;N;;;;;
+1D003;BYZANTINE MUSICAL SYMBOL OXEIA EKFONITIKON;So;0;L;;;;;N;;;;;
+1D004;BYZANTINE MUSICAL SYMBOL OXEIA DIPLI;So;0;L;;;;;N;;;;;
+1D005;BYZANTINE MUSICAL SYMBOL VAREIA EKFONITIKON;So;0;L;;;;;N;;;;;
+1D006;BYZANTINE MUSICAL SYMBOL VAREIA DIPLI;So;0;L;;;;;N;;;;;
+1D007;BYZANTINE MUSICAL SYMBOL KATHISTI;So;0;L;;;;;N;;;;;
+1D008;BYZANTINE MUSICAL SYMBOL SYRMATIKI;So;0;L;;;;;N;;;;;
+1D009;BYZANTINE MUSICAL SYMBOL PARAKLITIKI;So;0;L;;;;;N;;;;;
+1D00A;BYZANTINE MUSICAL SYMBOL YPOKRISIS;So;0;L;;;;;N;;;;;
+1D00B;BYZANTINE MUSICAL SYMBOL YPOKRISIS DIPLI;So;0;L;;;;;N;;;;;
+1D00C;BYZANTINE MUSICAL SYMBOL KREMASTI;So;0;L;;;;;N;;;;;
+1D00D;BYZANTINE MUSICAL SYMBOL APESO EKFONITIKON;So;0;L;;;;;N;;;;;
+1D00E;BYZANTINE MUSICAL SYMBOL EXO EKFONITIKON;So;0;L;;;;;N;;;;;
+1D00F;BYZANTINE MUSICAL SYMBOL TELEIA;So;0;L;;;;;N;;;;;
+1D010;BYZANTINE MUSICAL SYMBOL KENTIMATA;So;0;L;;;;;N;;;;;
+1D011;BYZANTINE MUSICAL SYMBOL APOSTROFOS;So;0;L;;;;;N;;;;;
+1D012;BYZANTINE MUSICAL SYMBOL APOSTROFOS DIPLI;So;0;L;;;;;N;;;;;
+1D013;BYZANTINE MUSICAL SYMBOL SYNEVMA;So;0;L;;;;;N;;;;;
+1D014;BYZANTINE MUSICAL SYMBOL THITA;So;0;L;;;;;N;;;;;
+1D015;BYZANTINE MUSICAL SYMBOL OLIGON ARCHAION;So;0;L;;;;;N;;;;;
+1D016;BYZANTINE MUSICAL SYMBOL GORGON ARCHAION;So;0;L;;;;;N;;;;;
+1D017;BYZANTINE MUSICAL SYMBOL PSILON;So;0;L;;;;;N;;;;;
+1D018;BYZANTINE MUSICAL SYMBOL CHAMILON;So;0;L;;;;;N;;;;;
+1D019;BYZANTINE MUSICAL SYMBOL VATHY;So;0;L;;;;;N;;;;;
+1D01A;BYZANTINE MUSICAL SYMBOL ISON ARCHAION;So;0;L;;;;;N;;;;;
+1D01B;BYZANTINE MUSICAL SYMBOL KENTIMA ARCHAION;So;0;L;;;;;N;;;;;
+1D01C;BYZANTINE MUSICAL SYMBOL KENTIMATA ARCHAION;So;0;L;;;;;N;;;;;
+1D01D;BYZANTINE MUSICAL SYMBOL SAXIMATA;So;0;L;;;;;N;;;;;
+1D01E;BYZANTINE MUSICAL SYMBOL PARICHON;So;0;L;;;;;N;;;;;
+1D01F;BYZANTINE MUSICAL SYMBOL STAVROS APODEXIA;So;0;L;;;;;N;;;;;
+1D020;BYZANTINE MUSICAL SYMBOL OXEIAI ARCHAION;So;0;L;;;;;N;;;;;
+1D021;BYZANTINE MUSICAL SYMBOL VAREIAI ARCHAION;So;0;L;;;;;N;;;;;
+1D022;BYZANTINE MUSICAL SYMBOL APODERMA ARCHAION;So;0;L;;;;;N;;;;;
+1D023;BYZANTINE MUSICAL SYMBOL APOTHEMA;So;0;L;;;;;N;;;;;
+1D024;BYZANTINE MUSICAL SYMBOL KLASMA;So;0;L;;;;;N;;;;;
+1D025;BYZANTINE MUSICAL SYMBOL REVMA;So;0;L;;;;;N;;;;;
+1D026;BYZANTINE MUSICAL SYMBOL PIASMA ARCHAION;So;0;L;;;;;N;;;;;
+1D027;BYZANTINE MUSICAL SYMBOL TINAGMA;So;0;L;;;;;N;;;;;
+1D028;BYZANTINE MUSICAL SYMBOL ANATRICHISMA;So;0;L;;;;;N;;;;;
+1D029;BYZANTINE MUSICAL SYMBOL SEISMA;So;0;L;;;;;N;;;;;
+1D02A;BYZANTINE MUSICAL SYMBOL SYNAGMA ARCHAION;So;0;L;;;;;N;;;;;
+1D02B;BYZANTINE MUSICAL SYMBOL SYNAGMA META STAVROU;So;0;L;;;;;N;;;;;
+1D02C;BYZANTINE MUSICAL SYMBOL OYRANISMA ARCHAION;So;0;L;;;;;N;;;;;
+1D02D;BYZANTINE MUSICAL SYMBOL THEMA;So;0;L;;;;;N;;;;;
+1D02E;BYZANTINE MUSICAL SYMBOL LEMOI;So;0;L;;;;;N;;;;;
+1D02F;BYZANTINE MUSICAL SYMBOL DYO;So;0;L;;;;;N;;;;;
+1D030;BYZANTINE MUSICAL SYMBOL TRIA;So;0;L;;;;;N;;;;;
+1D031;BYZANTINE MUSICAL SYMBOL TESSERA;So;0;L;;;;;N;;;;;
+1D032;BYZANTINE MUSICAL SYMBOL KRATIMATA;So;0;L;;;;;N;;;;;
+1D033;BYZANTINE MUSICAL SYMBOL APESO EXO NEO;So;0;L;;;;;N;;;;;
+1D034;BYZANTINE MUSICAL SYMBOL FTHORA ARCHAION;So;0;L;;;;;N;;;;;
+1D035;BYZANTINE MUSICAL SYMBOL IMIFTHORA;So;0;L;;;;;N;;;;;
+1D036;BYZANTINE MUSICAL SYMBOL TROMIKON ARCHAION;So;0;L;;;;;N;;;;;
+1D037;BYZANTINE MUSICAL SYMBOL KATAVA TROMIKON;So;0;L;;;;;N;;;;;
+1D038;BYZANTINE MUSICAL SYMBOL PELASTON;So;0;L;;;;;N;;;;;
+1D039;BYZANTINE MUSICAL SYMBOL PSIFISTON;So;0;L;;;;;N;;;;;
+1D03A;BYZANTINE MUSICAL SYMBOL KONTEVMA;So;0;L;;;;;N;;;;;
+1D03B;BYZANTINE MUSICAL SYMBOL CHOREVMA ARCHAION;So;0;L;;;;;N;;;;;
+1D03C;BYZANTINE MUSICAL SYMBOL RAPISMA;So;0;L;;;;;N;;;;;
+1D03D;BYZANTINE MUSICAL SYMBOL PARAKALESMA ARCHAION;So;0;L;;;;;N;;;;;
+1D03E;BYZANTINE MUSICAL SYMBOL PARAKLITIKI ARCHAION;So;0;L;;;;;N;;;;;
+1D03F;BYZANTINE MUSICAL SYMBOL ICHADIN;So;0;L;;;;;N;;;;;
+1D040;BYZANTINE MUSICAL SYMBOL NANA;So;0;L;;;;;N;;;;;
+1D041;BYZANTINE MUSICAL SYMBOL PETASMA;So;0;L;;;;;N;;;;;
+1D042;BYZANTINE MUSICAL SYMBOL KONTEVMA ALLO;So;0;L;;;;;N;;;;;
+1D043;BYZANTINE MUSICAL SYMBOL TROMIKON ALLO;So;0;L;;;;;N;;;;;
+1D044;BYZANTINE MUSICAL SYMBOL STRAGGISMATA;So;0;L;;;;;N;;;;;
+1D045;BYZANTINE MUSICAL SYMBOL GRONTHISMATA;So;0;L;;;;;N;;;;;
+1D046;BYZANTINE MUSICAL SYMBOL ISON NEO;So;0;L;;;;;N;;;;;
+1D047;BYZANTINE MUSICAL SYMBOL OLIGON NEO;So;0;L;;;;;N;;;;;
+1D048;BYZANTINE MUSICAL SYMBOL OXEIA NEO;So;0;L;;;;;N;;;;;
+1D049;BYZANTINE MUSICAL SYMBOL PETASTI;So;0;L;;;;;N;;;;;
+1D04A;BYZANTINE MUSICAL SYMBOL KOUFISMA;So;0;L;;;;;N;;;;;
+1D04B;BYZANTINE MUSICAL SYMBOL PETASTOKOUFISMA;So;0;L;;;;;N;;;;;
+1D04C;BYZANTINE MUSICAL SYMBOL KRATIMOKOUFISMA;So;0;L;;;;;N;;;;;
+1D04D;BYZANTINE MUSICAL SYMBOL PELASTON NEO;So;0;L;;;;;N;;;;;
+1D04E;BYZANTINE MUSICAL SYMBOL KENTIMATA NEO ANO;So;0;L;;;;;N;;;;;
+1D04F;BYZANTINE MUSICAL SYMBOL KENTIMA NEO ANO;So;0;L;;;;;N;;;;;
+1D050;BYZANTINE MUSICAL SYMBOL YPSILI;So;0;L;;;;;N;;;;;
+1D051;BYZANTINE MUSICAL SYMBOL APOSTROFOS NEO;So;0;L;;;;;N;;;;;
+1D052;BYZANTINE MUSICAL SYMBOL APOSTROFOI SYNDESMOS NEO;So;0;L;;;;;N;;;;;
+1D053;BYZANTINE MUSICAL SYMBOL YPORROI;So;0;L;;;;;N;;;;;
+1D054;BYZANTINE MUSICAL SYMBOL KRATIMOYPORROON;So;0;L;;;;;N;;;;;
+1D055;BYZANTINE MUSICAL SYMBOL ELAFRON;So;0;L;;;;;N;;;;;
+1D056;BYZANTINE MUSICAL SYMBOL CHAMILI;So;0;L;;;;;N;;;;;
+1D057;BYZANTINE MUSICAL SYMBOL MIKRON ISON;So;0;L;;;;;N;;;;;
+1D058;BYZANTINE MUSICAL SYMBOL VAREIA NEO;So;0;L;;;;;N;;;;;
+1D059;BYZANTINE MUSICAL SYMBOL PIASMA NEO;So;0;L;;;;;N;;;;;
+1D05A;BYZANTINE MUSICAL SYMBOL PSIFISTON NEO;So;0;L;;;;;N;;;;;
+1D05B;BYZANTINE MUSICAL SYMBOL OMALON;So;0;L;;;;;N;;;;;
+1D05C;BYZANTINE MUSICAL SYMBOL ANTIKENOMA;So;0;L;;;;;N;;;;;
+1D05D;BYZANTINE MUSICAL SYMBOL LYGISMA;So;0;L;;;;;N;;;;;
+1D05E;BYZANTINE MUSICAL SYMBOL PARAKLITIKI NEO;So;0;L;;;;;N;;;;;
+1D05F;BYZANTINE MUSICAL SYMBOL PARAKALESMA NEO;So;0;L;;;;;N;;;;;
+1D060;BYZANTINE MUSICAL SYMBOL ETERON PARAKALESMA;So;0;L;;;;;N;;;;;
+1D061;BYZANTINE MUSICAL SYMBOL KYLISMA;So;0;L;;;;;N;;;;;
+1D062;BYZANTINE MUSICAL SYMBOL ANTIKENOKYLISMA;So;0;L;;;;;N;;;;;
+1D063;BYZANTINE MUSICAL SYMBOL TROMIKON NEO;So;0;L;;;;;N;;;;;
+1D064;BYZANTINE MUSICAL SYMBOL EKSTREPTON;So;0;L;;;;;N;;;;;
+1D065;BYZANTINE MUSICAL SYMBOL SYNAGMA NEO;So;0;L;;;;;N;;;;;
+1D066;BYZANTINE MUSICAL SYMBOL SYRMA;So;0;L;;;;;N;;;;;
+1D067;BYZANTINE MUSICAL SYMBOL CHOREVMA NEO;So;0;L;;;;;N;;;;;
+1D068;BYZANTINE MUSICAL SYMBOL EPEGERMA;So;0;L;;;;;N;;;;;
+1D069;BYZANTINE MUSICAL SYMBOL SEISMA NEO;So;0;L;;;;;N;;;;;
+1D06A;BYZANTINE MUSICAL SYMBOL XIRON KLASMA;So;0;L;;;;;N;;;;;
+1D06B;BYZANTINE MUSICAL SYMBOL TROMIKOPSIFISTON;So;0;L;;;;;N;;;;;
+1D06C;BYZANTINE MUSICAL SYMBOL PSIFISTOLYGISMA;So;0;L;;;;;N;;;;;
+1D06D;BYZANTINE MUSICAL SYMBOL TROMIKOLYGISMA;So;0;L;;;;;N;;;;;
+1D06E;BYZANTINE MUSICAL SYMBOL TROMIKOPARAKALESMA;So;0;L;;;;;N;;;;;
+1D06F;BYZANTINE MUSICAL SYMBOL PSIFISTOPARAKALESMA;So;0;L;;;;;N;;;;;
+1D070;BYZANTINE MUSICAL SYMBOL TROMIKOSYNAGMA;So;0;L;;;;;N;;;;;
+1D071;BYZANTINE MUSICAL SYMBOL PSIFISTOSYNAGMA;So;0;L;;;;;N;;;;;
+1D072;BYZANTINE MUSICAL SYMBOL GORGOSYNTHETON;So;0;L;;;;;N;;;;;
+1D073;BYZANTINE MUSICAL SYMBOL ARGOSYNTHETON;So;0;L;;;;;N;;;;;
+1D074;BYZANTINE MUSICAL SYMBOL ETERON ARGOSYNTHETON;So;0;L;;;;;N;;;;;
+1D075;BYZANTINE MUSICAL SYMBOL OYRANISMA NEO;So;0;L;;;;;N;;;;;
+1D076;BYZANTINE MUSICAL SYMBOL THEMATISMOS ESO;So;0;L;;;;;N;;;;;
+1D077;BYZANTINE MUSICAL SYMBOL THEMATISMOS EXO;So;0;L;;;;;N;;;;;
+1D078;BYZANTINE MUSICAL SYMBOL THEMA APLOUN;So;0;L;;;;;N;;;;;
+1D079;BYZANTINE MUSICAL SYMBOL THES KAI APOTHES;So;0;L;;;;;N;;;;;
+1D07A;BYZANTINE MUSICAL SYMBOL KATAVASMA;So;0;L;;;;;N;;;;;
+1D07B;BYZANTINE MUSICAL SYMBOL ENDOFONON;So;0;L;;;;;N;;;;;
+1D07C;BYZANTINE MUSICAL SYMBOL YFEN KATO;So;0;L;;;;;N;;;;;
+1D07D;BYZANTINE MUSICAL SYMBOL YFEN ANO;So;0;L;;;;;N;;;;;
+1D07E;BYZANTINE MUSICAL SYMBOL STAVROS;So;0;L;;;;;N;;;;;
+1D07F;BYZANTINE MUSICAL SYMBOL KLASMA ANO;So;0;L;;;;;N;;;;;
+1D080;BYZANTINE MUSICAL SYMBOL DIPLI ARCHAION;So;0;L;;;;;N;;;;;
+1D081;BYZANTINE MUSICAL SYMBOL KRATIMA ARCHAION;So;0;L;;;;;N;;;;;
+1D082;BYZANTINE MUSICAL SYMBOL KRATIMA ALLO;So;0;L;;;;;N;;;;;
+1D083;BYZANTINE MUSICAL SYMBOL KRATIMA NEO;So;0;L;;;;;N;;;;;
+1D084;BYZANTINE MUSICAL SYMBOL APODERMA NEO;So;0;L;;;;;N;;;;;
+1D085;BYZANTINE MUSICAL SYMBOL APLI;So;0;L;;;;;N;;;;;
+1D086;BYZANTINE MUSICAL SYMBOL DIPLI;So;0;L;;;;;N;;;;;
+1D087;BYZANTINE MUSICAL SYMBOL TRIPLI;So;0;L;;;;;N;;;;;
+1D088;BYZANTINE MUSICAL SYMBOL TETRAPLI;So;0;L;;;;;N;;;;;
+1D089;BYZANTINE MUSICAL SYMBOL KORONIS;So;0;L;;;;;N;;;;;
+1D08A;BYZANTINE MUSICAL SYMBOL LEIMMA ENOS CHRONOU;So;0;L;;;;;N;;;;;
+1D08B;BYZANTINE MUSICAL SYMBOL LEIMMA DYO CHRONON;So;0;L;;;;;N;;;;;
+1D08C;BYZANTINE MUSICAL SYMBOL LEIMMA TRION CHRONON;So;0;L;;;;;N;;;;;
+1D08D;BYZANTINE MUSICAL SYMBOL LEIMMA TESSARON CHRONON;So;0;L;;;;;N;;;;;
+1D08E;BYZANTINE MUSICAL SYMBOL LEIMMA IMISEOS CHRONOU;So;0;L;;;;;N;;;;;
+1D08F;BYZANTINE MUSICAL SYMBOL GORGON NEO ANO;So;0;L;;;;;N;;;;;
+1D090;BYZANTINE MUSICAL SYMBOL GORGON PARESTIGMENON ARISTERA;So;0;L;;;;;N;;;;;
+1D091;BYZANTINE MUSICAL SYMBOL GORGON PARESTIGMENON DEXIA;So;0;L;;;;;N;;;;;
+1D092;BYZANTINE MUSICAL SYMBOL DIGORGON;So;0;L;;;;;N;;;;;
+1D093;BYZANTINE MUSICAL SYMBOL DIGORGON PARESTIGMENON ARISTERA KATO;So;0;L;;;;;N;;;;;
+1D094;BYZANTINE MUSICAL SYMBOL DIGORGON PARESTIGMENON ARISTERA ANO;So;0;L;;;;;N;;;;;
+1D095;BYZANTINE MUSICAL SYMBOL DIGORGON PARESTIGMENON DEXIA;So;0;L;;;;;N;;;;;
+1D096;BYZANTINE MUSICAL SYMBOL TRIGORGON;So;0;L;;;;;N;;;;;
+1D097;BYZANTINE MUSICAL SYMBOL ARGON;So;0;L;;;;;N;;;;;
+1D098;BYZANTINE MUSICAL SYMBOL IMIDIARGON;So;0;L;;;;;N;;;;;
+1D099;BYZANTINE MUSICAL SYMBOL DIARGON;So;0;L;;;;;N;;;;;
+1D09A;BYZANTINE MUSICAL SYMBOL AGOGI POLI ARGI;So;0;L;;;;;N;;;;;
+1D09B;BYZANTINE MUSICAL SYMBOL AGOGI ARGOTERI;So;0;L;;;;;N;;;;;
+1D09C;BYZANTINE MUSICAL SYMBOL AGOGI ARGI;So;0;L;;;;;N;;;;;
+1D09D;BYZANTINE MUSICAL SYMBOL AGOGI METRIA;So;0;L;;;;;N;;;;;
+1D09E;BYZANTINE MUSICAL SYMBOL AGOGI MESI;So;0;L;;;;;N;;;;;
+1D09F;BYZANTINE MUSICAL SYMBOL AGOGI GORGI;So;0;L;;;;;N;;;;;
+1D0A0;BYZANTINE MUSICAL SYMBOL AGOGI GORGOTERI;So;0;L;;;;;N;;;;;
+1D0A1;BYZANTINE MUSICAL SYMBOL AGOGI POLI GORGI;So;0;L;;;;;N;;;;;
+1D0A2;BYZANTINE MUSICAL SYMBOL MARTYRIA PROTOS ICHOS;So;0;L;;;;;N;;;;;
+1D0A3;BYZANTINE MUSICAL SYMBOL MARTYRIA ALLI PROTOS ICHOS;So;0;L;;;;;N;;;;;
+1D0A4;BYZANTINE MUSICAL SYMBOL MARTYRIA DEYTEROS ICHOS;So;0;L;;;;;N;;;;;
+1D0A5;BYZANTINE MUSICAL SYMBOL MARTYRIA ALLI DEYTEROS ICHOS;So;0;L;;;;;N;;;;;
+1D0A6;BYZANTINE MUSICAL SYMBOL MARTYRIA TRITOS ICHOS;So;0;L;;;;;N;;;;;
+1D0A7;BYZANTINE MUSICAL SYMBOL MARTYRIA TRIFONIAS;So;0;L;;;;;N;;;;;
+1D0A8;BYZANTINE MUSICAL SYMBOL MARTYRIA TETARTOS ICHOS;So;0;L;;;;;N;;;;;
+1D0A9;BYZANTINE MUSICAL SYMBOL MARTYRIA TETARTOS LEGETOS ICHOS;So;0;L;;;;;N;;;;;
+1D0AA;BYZANTINE MUSICAL SYMBOL MARTYRIA LEGETOS ICHOS;So;0;L;;;;;N;;;;;
+1D0AB;BYZANTINE MUSICAL SYMBOL MARTYRIA PLAGIOS ICHOS;So;0;L;;;;;N;;;;;
+1D0AC;BYZANTINE MUSICAL SYMBOL ISAKIA TELOUS ICHIMATOS;So;0;L;;;;;N;;;;;
+1D0AD;BYZANTINE MUSICAL SYMBOL APOSTROFOI TELOUS ICHIMATOS;So;0;L;;;;;N;;;;;
+1D0AE;BYZANTINE MUSICAL SYMBOL FANEROSIS TETRAFONIAS;So;0;L;;;;;N;;;;;
+1D0AF;BYZANTINE MUSICAL SYMBOL FANEROSIS MONOFONIAS;So;0;L;;;;;N;;;;;
+1D0B0;BYZANTINE MUSICAL SYMBOL FANEROSIS DIFONIAS;So;0;L;;;;;N;;;;;
+1D0B1;BYZANTINE MUSICAL SYMBOL MARTYRIA VARYS ICHOS;So;0;L;;;;;N;;;;;
+1D0B2;BYZANTINE MUSICAL SYMBOL MARTYRIA PROTOVARYS ICHOS;So;0;L;;;;;N;;;;;
+1D0B3;BYZANTINE MUSICAL SYMBOL MARTYRIA PLAGIOS TETARTOS ICHOS;So;0;L;;;;;N;;;;;
+1D0B4;BYZANTINE MUSICAL SYMBOL GORTHMIKON N APLOUN;So;0;L;;;;;N;;;;;
+1D0B5;BYZANTINE MUSICAL SYMBOL GORTHMIKON N DIPLOUN;So;0;L;;;;;N;;;;;
+1D0B6;BYZANTINE MUSICAL SYMBOL ENARXIS KAI FTHORA VOU;So;0;L;;;;;N;;;;;
+1D0B7;BYZANTINE MUSICAL SYMBOL IMIFONON;So;0;L;;;;;N;;;;;
+1D0B8;BYZANTINE MUSICAL SYMBOL IMIFTHORON;So;0;L;;;;;N;;;;;
+1D0B9;BYZANTINE MUSICAL SYMBOL FTHORA ARCHAION DEYTEROU ICHOU;So;0;L;;;;;N;;;;;
+1D0BA;BYZANTINE MUSICAL SYMBOL FTHORA DIATONIKI PA;So;0;L;;;;;N;;;;;
+1D0BB;BYZANTINE MUSICAL SYMBOL FTHORA DIATONIKI NANA;So;0;L;;;;;N;;;;;
+1D0BC;BYZANTINE MUSICAL SYMBOL FTHORA NAOS ICHOS;So;0;L;;;;;N;;;;;
+1D0BD;BYZANTINE MUSICAL SYMBOL FTHORA DIATONIKI DI;So;0;L;;;;;N;;;;;
+1D0BE;BYZANTINE MUSICAL SYMBOL FTHORA SKLIRON DIATONON DI;So;0;L;;;;;N;;;;;
+1D0BF;BYZANTINE MUSICAL SYMBOL FTHORA DIATONIKI KE;So;0;L;;;;;N;;;;;
+1D0C0;BYZANTINE MUSICAL SYMBOL FTHORA DIATONIKI ZO;So;0;L;;;;;N;;;;;
+1D0C1;BYZANTINE MUSICAL SYMBOL FTHORA DIATONIKI NI KATO;So;0;L;;;;;N;;;;;
+1D0C2;BYZANTINE MUSICAL SYMBOL FTHORA DIATONIKI NI ANO;So;0;L;;;;;N;;;;;
+1D0C3;BYZANTINE MUSICAL SYMBOL FTHORA MALAKON CHROMA DIFONIAS;So;0;L;;;;;N;;;;;
+1D0C4;BYZANTINE MUSICAL SYMBOL FTHORA MALAKON CHROMA MONOFONIAS;So;0;L;;;;;N;;;;;
+1D0C5;BYZANTINE MUSICAL SYMBOL FHTORA SKLIRON CHROMA VASIS;So;0;L;;;;;N;;;;;
+1D0C6;BYZANTINE MUSICAL SYMBOL FTHORA SKLIRON CHROMA SYNAFI;So;0;L;;;;;N;;;;;
+1D0C7;BYZANTINE MUSICAL SYMBOL FTHORA NENANO;So;0;L;;;;;N;;;;;
+1D0C8;BYZANTINE MUSICAL SYMBOL CHROA ZYGOS;So;0;L;;;;;N;;;;;
+1D0C9;BYZANTINE MUSICAL SYMBOL CHROA KLITON;So;0;L;;;;;N;;;;;
+1D0CA;BYZANTINE MUSICAL SYMBOL CHROA SPATHI;So;0;L;;;;;N;;;;;
+1D0CB;BYZANTINE MUSICAL SYMBOL FTHORA I YFESIS TETARTIMORION;So;0;L;;;;;N;;;;;
+1D0CC;BYZANTINE MUSICAL SYMBOL FTHORA ENARMONIOS ANTIFONIA;So;0;L;;;;;N;;;;;
+1D0CD;BYZANTINE MUSICAL SYMBOL YFESIS TRITIMORION;So;0;L;;;;;N;;;;;
+1D0CE;BYZANTINE MUSICAL SYMBOL DIESIS TRITIMORION;So;0;L;;;;;N;;;;;
+1D0CF;BYZANTINE MUSICAL SYMBOL DIESIS TETARTIMORION;So;0;L;;;;;N;;;;;
+1D0D0;BYZANTINE MUSICAL SYMBOL DIESIS APLI DYO DODEKATA;So;0;L;;;;;N;;;;;
+1D0D1;BYZANTINE MUSICAL SYMBOL DIESIS MONOGRAMMOS TESSERA DODEKATA;So;0;L;;;;;N;;;;;
+1D0D2;BYZANTINE MUSICAL SYMBOL DIESIS DIGRAMMOS EX DODEKATA;So;0;L;;;;;N;;;;;
+1D0D3;BYZANTINE MUSICAL SYMBOL DIESIS TRIGRAMMOS OKTO DODEKATA;So;0;L;;;;;N;;;;;
+1D0D4;BYZANTINE MUSICAL SYMBOL YFESIS APLI DYO DODEKATA;So;0;L;;;;;N;;;;;
+1D0D5;BYZANTINE MUSICAL SYMBOL YFESIS MONOGRAMMOS TESSERA DODEKATA;So;0;L;;;;;N;;;;;
+1D0D6;BYZANTINE MUSICAL SYMBOL YFESIS DIGRAMMOS EX DODEKATA;So;0;L;;;;;N;;;;;
+1D0D7;BYZANTINE MUSICAL SYMBOL YFESIS TRIGRAMMOS OKTO DODEKATA;So;0;L;;;;;N;;;;;
+1D0D8;BYZANTINE MUSICAL SYMBOL GENIKI DIESIS;So;0;L;;;;;N;;;;;
+1D0D9;BYZANTINE MUSICAL SYMBOL GENIKI YFESIS;So;0;L;;;;;N;;;;;
+1D0DA;BYZANTINE MUSICAL SYMBOL DIASTOLI APLI MIKRI;So;0;L;;;;;N;;;;;
+1D0DB;BYZANTINE MUSICAL SYMBOL DIASTOLI APLI MEGALI;So;0;L;;;;;N;;;;;
+1D0DC;BYZANTINE MUSICAL SYMBOL DIASTOLI DIPLI;So;0;L;;;;;N;;;;;
+1D0DD;BYZANTINE MUSICAL SYMBOL DIASTOLI THESEOS;So;0;L;;;;;N;;;;;
+1D0DE;BYZANTINE MUSICAL SYMBOL SIMANSIS THESEOS;So;0;L;;;;;N;;;;;
+1D0DF;BYZANTINE MUSICAL SYMBOL SIMANSIS THESEOS DISIMOU;So;0;L;;;;;N;;;;;
+1D0E0;BYZANTINE MUSICAL SYMBOL SIMANSIS THESEOS TRISIMOU;So;0;L;;;;;N;;;;;
+1D0E1;BYZANTINE MUSICAL SYMBOL SIMANSIS THESEOS TETRASIMOU;So;0;L;;;;;N;;;;;
+1D0E2;BYZANTINE MUSICAL SYMBOL SIMANSIS ARSEOS;So;0;L;;;;;N;;;;;
+1D0E3;BYZANTINE MUSICAL SYMBOL SIMANSIS ARSEOS DISIMOU;So;0;L;;;;;N;;;;;
+1D0E4;BYZANTINE MUSICAL SYMBOL SIMANSIS ARSEOS TRISIMOU;So;0;L;;;;;N;;;;;
+1D0E5;BYZANTINE MUSICAL SYMBOL SIMANSIS ARSEOS TETRASIMOU;So;0;L;;;;;N;;;;;
+1D0E6;BYZANTINE MUSICAL SYMBOL DIGRAMMA GG;So;0;L;;;;;N;;;;;
+1D0E7;BYZANTINE MUSICAL SYMBOL DIFTOGGOS OU;So;0;L;;;;;N;;;;;
+1D0E8;BYZANTINE MUSICAL SYMBOL STIGMA;So;0;L;;;;;N;;;;;
+1D0E9;BYZANTINE MUSICAL SYMBOL ARKTIKO PA;So;0;L;;;;;N;;;;;
+1D0EA;BYZANTINE MUSICAL SYMBOL ARKTIKO VOU;So;0;L;;;;;N;;;;;
+1D0EB;BYZANTINE MUSICAL SYMBOL ARKTIKO GA;So;0;L;;;;;N;;;;;
+1D0EC;BYZANTINE MUSICAL SYMBOL ARKTIKO DI;So;0;L;;;;;N;;;;;
+1D0ED;BYZANTINE MUSICAL SYMBOL ARKTIKO KE;So;0;L;;;;;N;;;;;
+1D0EE;BYZANTINE MUSICAL SYMBOL ARKTIKO ZO;So;0;L;;;;;N;;;;;
+1D0EF;BYZANTINE MUSICAL SYMBOL ARKTIKO NI;So;0;L;;;;;N;;;;;
+1D0F0;BYZANTINE MUSICAL SYMBOL KENTIMATA NEO MESO;So;0;L;;;;;N;;;;;
+1D0F1;BYZANTINE MUSICAL SYMBOL KENTIMA NEO MESO;So;0;L;;;;;N;;;;;
+1D0F2;BYZANTINE MUSICAL SYMBOL KENTIMATA NEO KATO;So;0;L;;;;;N;;;;;
+1D0F3;BYZANTINE MUSICAL SYMBOL KENTIMA NEO KATO;So;0;L;;;;;N;;;;;
+1D0F4;BYZANTINE MUSICAL SYMBOL KLASMA KATO;So;0;L;;;;;N;;;;;
+1D0F5;BYZANTINE MUSICAL SYMBOL GORGON NEO KATO;So;0;L;;;;;N;;;;;
+1D100;MUSICAL SYMBOL SINGLE BARLINE;So;0;L;;;;;N;;;;;
+1D101;MUSICAL SYMBOL DOUBLE BARLINE;So;0;L;;;;;N;;;;;
+1D102;MUSICAL SYMBOL FINAL BARLINE;So;0;L;;;;;N;;;;;
+1D103;MUSICAL SYMBOL REVERSE FINAL BARLINE;So;0;L;;;;;N;;;;;
+1D104;MUSICAL SYMBOL DASHED BARLINE;So;0;L;;;;;N;;;;;
+1D105;MUSICAL SYMBOL SHORT BARLINE;So;0;L;;;;;N;;;;;
+1D106;MUSICAL SYMBOL LEFT REPEAT SIGN;So;0;L;;;;;N;;;;;
+1D107;MUSICAL SYMBOL RIGHT REPEAT SIGN;So;0;L;;;;;N;;;;;
+1D108;MUSICAL SYMBOL REPEAT DOTS;So;0;L;;;;;N;;;;;
+1D109;MUSICAL SYMBOL DAL SEGNO;So;0;L;;;;;N;;;;;
+1D10A;MUSICAL SYMBOL DA CAPO;So;0;L;;;;;N;;;;;
+1D10B;MUSICAL SYMBOL SEGNO;So;0;L;;;;;N;;;;;
+1D10C;MUSICAL SYMBOL CODA;So;0;L;;;;;N;;;;;
+1D10D;MUSICAL SYMBOL REPEATED FIGURE-1;So;0;L;;;;;N;;;;;
+1D10E;MUSICAL SYMBOL REPEATED FIGURE-2;So;0;L;;;;;N;;;;;
+1D10F;MUSICAL SYMBOL REPEATED FIGURE-3;So;0;L;;;;;N;;;;;
+1D110;MUSICAL SYMBOL FERMATA;So;0;L;;;;;N;;;;;
+1D111;MUSICAL SYMBOL FERMATA BELOW;So;0;L;;;;;N;;;;;
+1D112;MUSICAL SYMBOL BREATH MARK;So;0;L;;;;;N;;;;;
+1D113;MUSICAL SYMBOL CAESURA;So;0;L;;;;;N;;;;;
+1D114;MUSICAL SYMBOL BRACE;So;0;L;;;;;N;;;;;
+1D115;MUSICAL SYMBOL BRACKET;So;0;L;;;;;N;;;;;
+1D116;MUSICAL SYMBOL ONE-LINE STAFF;So;0;L;;;;;N;;;;;
+1D117;MUSICAL SYMBOL TWO-LINE STAFF;So;0;L;;;;;N;;;;;
+1D118;MUSICAL SYMBOL THREE-LINE STAFF;So;0;L;;;;;N;;;;;
+1D119;MUSICAL SYMBOL FOUR-LINE STAFF;So;0;L;;;;;N;;;;;
+1D11A;MUSICAL SYMBOL FIVE-LINE STAFF;So;0;L;;;;;N;;;;;
+1D11B;MUSICAL SYMBOL SIX-LINE STAFF;So;0;L;;;;;N;;;;;
+1D11C;MUSICAL SYMBOL SIX-STRING FRETBOARD;So;0;L;;;;;N;;;;;
+1D11D;MUSICAL SYMBOL FOUR-STRING FRETBOARD;So;0;L;;;;;N;;;;;
+1D11E;MUSICAL SYMBOL G CLEF;So;0;L;;;;;N;;;;;
+1D11F;MUSICAL SYMBOL G CLEF OTTAVA ALTA;So;0;L;;;;;N;;;;;
+1D120;MUSICAL SYMBOL G CLEF OTTAVA BASSA;So;0;L;;;;;N;;;;;
+1D121;MUSICAL SYMBOL C CLEF;So;0;L;;;;;N;;;;;
+1D122;MUSICAL SYMBOL F CLEF;So;0;L;;;;;N;;;;;
+1D123;MUSICAL SYMBOL F CLEF OTTAVA ALTA;So;0;L;;;;;N;;;;;
+1D124;MUSICAL SYMBOL F CLEF OTTAVA BASSA;So;0;L;;;;;N;;;;;
+1D125;MUSICAL SYMBOL DRUM CLEF-1;So;0;L;;;;;N;;;;;
+1D126;MUSICAL SYMBOL DRUM CLEF-2;So;0;L;;;;;N;;;;;
+1D129;MUSICAL SYMBOL MULTIPLE MEASURE REST;So;0;L;;;;;N;;;;;
+1D12A;MUSICAL SYMBOL DOUBLE SHARP;So;0;L;;;;;N;;;;;
+1D12B;MUSICAL SYMBOL DOUBLE FLAT;So;0;L;;;;;N;;;;;
+1D12C;MUSICAL SYMBOL FLAT UP;So;0;L;;;;;N;;;;;
+1D12D;MUSICAL SYMBOL FLAT DOWN;So;0;L;;;;;N;;;;;
+1D12E;MUSICAL SYMBOL NATURAL UP;So;0;L;;;;;N;;;;;
+1D12F;MUSICAL SYMBOL NATURAL DOWN;So;0;L;;;;;N;;;;;
+1D130;MUSICAL SYMBOL SHARP UP;So;0;L;;;;;N;;;;;
+1D131;MUSICAL SYMBOL SHARP DOWN;So;0;L;;;;;N;;;;;
+1D132;MUSICAL SYMBOL QUARTER TONE SHARP;So;0;L;;;;;N;;;;;
+1D133;MUSICAL SYMBOL QUARTER TONE FLAT;So;0;L;;;;;N;;;;;
+1D134;MUSICAL SYMBOL COMMON TIME;So;0;L;;;;;N;;;;;
+1D135;MUSICAL SYMBOL CUT TIME;So;0;L;;;;;N;;;;;
+1D136;MUSICAL SYMBOL OTTAVA ALTA;So;0;L;;;;;N;;;;;
+1D137;MUSICAL SYMBOL OTTAVA BASSA;So;0;L;;;;;N;;;;;
+1D138;MUSICAL SYMBOL QUINDICESIMA ALTA;So;0;L;;;;;N;;;;;
+1D139;MUSICAL SYMBOL QUINDICESIMA BASSA;So;0;L;;;;;N;;;;;
+1D13A;MUSICAL SYMBOL MULTI REST;So;0;L;;;;;N;;;;;
+1D13B;MUSICAL SYMBOL WHOLE REST;So;0;L;;;;;N;;;;;
+1D13C;MUSICAL SYMBOL HALF REST;So;0;L;;;;;N;;;;;
+1D13D;MUSICAL SYMBOL QUARTER REST;So;0;L;;;;;N;;;;;
+1D13E;MUSICAL SYMBOL EIGHTH REST;So;0;L;;;;;N;;;;;
+1D13F;MUSICAL SYMBOL SIXTEENTH REST;So;0;L;;;;;N;;;;;
+1D140;MUSICAL SYMBOL THIRTY-SECOND REST;So;0;L;;;;;N;;;;;
+1D141;MUSICAL SYMBOL SIXTY-FOURTH REST;So;0;L;;;;;N;;;;;
+1D142;MUSICAL SYMBOL ONE HUNDRED TWENTY-EIGHTH REST;So;0;L;;;;;N;;;;;
+1D143;MUSICAL SYMBOL X NOTEHEAD;So;0;L;;;;;N;;;;;
+1D144;MUSICAL SYMBOL PLUS NOTEHEAD;So;0;L;;;;;N;;;;;
+1D145;MUSICAL SYMBOL CIRCLE X NOTEHEAD;So;0;L;;;;;N;;;;;
+1D146;MUSICAL SYMBOL SQUARE NOTEHEAD WHITE;So;0;L;;;;;N;;;;;
+1D147;MUSICAL SYMBOL SQUARE NOTEHEAD BLACK;So;0;L;;;;;N;;;;;
+1D148;MUSICAL SYMBOL TRIANGLE NOTEHEAD UP WHITE;So;0;L;;;;;N;;;;;
+1D149;MUSICAL SYMBOL TRIANGLE NOTEHEAD UP BLACK;So;0;L;;;;;N;;;;;
+1D14A;MUSICAL SYMBOL TRIANGLE NOTEHEAD LEFT WHITE;So;0;L;;;;;N;;;;;
+1D14B;MUSICAL SYMBOL TRIANGLE NOTEHEAD LEFT BLACK;So;0;L;;;;;N;;;;;
+1D14C;MUSICAL SYMBOL TRIANGLE NOTEHEAD RIGHT WHITE;So;0;L;;;;;N;;;;;
+1D14D;MUSICAL SYMBOL TRIANGLE NOTEHEAD RIGHT BLACK;So;0;L;;;;;N;;;;;
+1D14E;MUSICAL SYMBOL TRIANGLE NOTEHEAD DOWN WHITE;So;0;L;;;;;N;;;;;
+1D14F;MUSICAL SYMBOL TRIANGLE NOTEHEAD DOWN BLACK;So;0;L;;;;;N;;;;;
+1D150;MUSICAL SYMBOL TRIANGLE NOTEHEAD UP RIGHT WHITE;So;0;L;;;;;N;;;;;
+1D151;MUSICAL SYMBOL TRIANGLE NOTEHEAD UP RIGHT BLACK;So;0;L;;;;;N;;;;;
+1D152;MUSICAL SYMBOL MOON NOTEHEAD WHITE;So;0;L;;;;;N;;;;;
+1D153;MUSICAL SYMBOL MOON NOTEHEAD BLACK;So;0;L;;;;;N;;;;;
+1D154;MUSICAL SYMBOL TRIANGLE-ROUND NOTEHEAD DOWN WHITE;So;0;L;;;;;N;;;;;
+1D155;MUSICAL SYMBOL TRIANGLE-ROUND NOTEHEAD DOWN BLACK;So;0;L;;;;;N;;;;;
+1D156;MUSICAL SYMBOL PARENTHESIS NOTEHEAD;So;0;L;;;;;N;;;;;
+1D157;MUSICAL SYMBOL VOID NOTEHEAD;So;0;L;;;;;N;;;;;
+1D158;MUSICAL SYMBOL NOTEHEAD BLACK;So;0;L;;;;;N;;;;;
+1D159;MUSICAL SYMBOL NULL NOTEHEAD;So;0;L;;;;;N;;;;;
+1D15A;MUSICAL SYMBOL CLUSTER NOTEHEAD WHITE;So;0;L;;;;;N;;;;;
+1D15B;MUSICAL SYMBOL CLUSTER NOTEHEAD BLACK;So;0;L;;;;;N;;;;;
+1D15C;MUSICAL SYMBOL BREVE;So;0;L;;;;;N;;;;;
+1D15D;MUSICAL SYMBOL WHOLE NOTE;So;0;L;;;;;N;;;;;
+1D15E;MUSICAL SYMBOL HALF NOTE;So;0;L;1D157 1D165;;;;N;;;;;
+1D15F;MUSICAL SYMBOL QUARTER NOTE;So;0;L;1D158 1D165;;;;N;;;;;
+1D160;MUSICAL SYMBOL EIGHTH NOTE;So;0;L;1D15F 1D16E;;;;N;;;;;
+1D161;MUSICAL SYMBOL SIXTEENTH NOTE;So;0;L;1D15F 1D16F;;;;N;;;;;
+1D162;MUSICAL SYMBOL THIRTY-SECOND NOTE;So;0;L;1D15F 1D170;;;;N;;;;;
+1D163;MUSICAL SYMBOL SIXTY-FOURTH NOTE;So;0;L;1D15F 1D171;;;;N;;;;;
+1D164;MUSICAL SYMBOL ONE HUNDRED TWENTY-EIGHTH NOTE;So;0;L;1D15F 1D172;;;;N;;;;;
+1D165;MUSICAL SYMBOL COMBINING STEM;Mc;216;L;;;;;N;;;;;
+1D166;MUSICAL SYMBOL COMBINING SPRECHGESANG STEM;Mc;216;L;;;;;N;;;;;
+1D167;MUSICAL SYMBOL COMBINING TREMOLO-1;Mn;1;NSM;;;;;N;;;;;
+1D168;MUSICAL SYMBOL COMBINING TREMOLO-2;Mn;1;NSM;;;;;N;;;;;
+1D169;MUSICAL SYMBOL COMBINING TREMOLO-3;Mn;1;NSM;;;;;N;;;;;
+1D16A;MUSICAL SYMBOL FINGERED TREMOLO-1;So;0;L;;;;;N;;;;;
+1D16B;MUSICAL SYMBOL FINGERED TREMOLO-2;So;0;L;;;;;N;;;;;
+1D16C;MUSICAL SYMBOL FINGERED TREMOLO-3;So;0;L;;;;;N;;;;;
+1D16D;MUSICAL SYMBOL COMBINING AUGMENTATION DOT;Mc;226;L;;;;;N;;;;;
+1D16E;MUSICAL SYMBOL COMBINING FLAG-1;Mc;216;L;;;;;N;;;;;
+1D16F;MUSICAL SYMBOL COMBINING FLAG-2;Mc;216;L;;;;;N;;;;;
+1D170;MUSICAL SYMBOL COMBINING FLAG-3;Mc;216;L;;;;;N;;;;;
+1D171;MUSICAL SYMBOL COMBINING FLAG-4;Mc;216;L;;;;;N;;;;;
+1D172;MUSICAL SYMBOL COMBINING FLAG-5;Mc;216;L;;;;;N;;;;;
+1D173;MUSICAL SYMBOL BEGIN BEAM;Cf;0;BN;;;;;N;;;;;
+1D174;MUSICAL SYMBOL END BEAM;Cf;0;BN;;;;;N;;;;;
+1D175;MUSICAL SYMBOL BEGIN TIE;Cf;0;BN;;;;;N;;;;;
+1D176;MUSICAL SYMBOL END TIE;Cf;0;BN;;;;;N;;;;;
+1D177;MUSICAL SYMBOL BEGIN SLUR;Cf;0;BN;;;;;N;;;;;
+1D178;MUSICAL SYMBOL END SLUR;Cf;0;BN;;;;;N;;;;;
+1D179;MUSICAL SYMBOL BEGIN PHRASE;Cf;0;BN;;;;;N;;;;;
+1D17A;MUSICAL SYMBOL END PHRASE;Cf;0;BN;;;;;N;;;;;
+1D17B;MUSICAL SYMBOL COMBINING ACCENT;Mn;220;NSM;;;;;N;;;;;
+1D17C;MUSICAL SYMBOL COMBINING STACCATO;Mn;220;NSM;;;;;N;;;;;
+1D17D;MUSICAL SYMBOL COMBINING TENUTO;Mn;220;NSM;;;;;N;;;;;
+1D17E;MUSICAL SYMBOL COMBINING STACCATISSIMO;Mn;220;NSM;;;;;N;;;;;
+1D17F;MUSICAL SYMBOL COMBINING MARCATO;Mn;220;NSM;;;;;N;;;;;
+1D180;MUSICAL SYMBOL COMBINING MARCATO-STACCATO;Mn;220;NSM;;;;;N;;;;;
+1D181;MUSICAL SYMBOL COMBINING ACCENT-STACCATO;Mn;220;NSM;;;;;N;;;;;
+1D182;MUSICAL SYMBOL COMBINING LOURE;Mn;220;NSM;;;;;N;;;;;
+1D183;MUSICAL SYMBOL ARPEGGIATO UP;So;0;L;;;;;N;;;;;
+1D184;MUSICAL SYMBOL ARPEGGIATO DOWN;So;0;L;;;;;N;;;;;
+1D185;MUSICAL SYMBOL COMBINING DOIT;Mn;230;NSM;;;;;N;;;;;
+1D186;MUSICAL SYMBOL COMBINING RIP;Mn;230;NSM;;;;;N;;;;;
+1D187;MUSICAL SYMBOL COMBINING FLIP;Mn;230;NSM;;;;;N;;;;;
+1D188;MUSICAL SYMBOL COMBINING SMEAR;Mn;230;NSM;;;;;N;;;;;
+1D189;MUSICAL SYMBOL COMBINING BEND;Mn;230;NSM;;;;;N;;;;;
+1D18A;MUSICAL SYMBOL COMBINING DOUBLE TONGUE;Mn;220;NSM;;;;;N;;;;;
+1D18B;MUSICAL SYMBOL COMBINING TRIPLE TONGUE;Mn;220;NSM;;;;;N;;;;;
+1D18C;MUSICAL SYMBOL RINFORZANDO;So;0;L;;;;;N;;;;;
+1D18D;MUSICAL SYMBOL SUBITO;So;0;L;;;;;N;;;;;
+1D18E;MUSICAL SYMBOL Z;So;0;L;;;;;N;;;;;
+1D18F;MUSICAL SYMBOL PIANO;So;0;L;;;;;N;;;;;
+1D190;MUSICAL SYMBOL MEZZO;So;0;L;;;;;N;;;;;
+1D191;MUSICAL SYMBOL FORTE;So;0;L;;;;;N;;;;;
+1D192;MUSICAL SYMBOL CRESCENDO;So;0;L;;;;;N;;;;;
+1D193;MUSICAL SYMBOL DECRESCENDO;So;0;L;;;;;N;;;;;
+1D194;MUSICAL SYMBOL GRACE NOTE SLASH;So;0;L;;;;;N;;;;;
+1D195;MUSICAL SYMBOL GRACE NOTE NO SLASH;So;0;L;;;;;N;;;;;
+1D196;MUSICAL SYMBOL TR;So;0;L;;;;;N;;;;;
+1D197;MUSICAL SYMBOL TURN;So;0;L;;;;;N;;;;;
+1D198;MUSICAL SYMBOL INVERTED TURN;So;0;L;;;;;N;;;;;
+1D199;MUSICAL SYMBOL TURN SLASH;So;0;L;;;;;N;;;;;
+1D19A;MUSICAL SYMBOL TURN UP;So;0;L;;;;;N;;;;;
+1D19B;MUSICAL SYMBOL ORNAMENT STROKE-1;So;0;L;;;;;N;;;;;
+1D19C;MUSICAL SYMBOL ORNAMENT STROKE-2;So;0;L;;;;;N;;;;;
+1D19D;MUSICAL SYMBOL ORNAMENT STROKE-3;So;0;L;;;;;N;;;;;
+1D19E;MUSICAL SYMBOL ORNAMENT STROKE-4;So;0;L;;;;;N;;;;;
+1D19F;MUSICAL SYMBOL ORNAMENT STROKE-5;So;0;L;;;;;N;;;;;
+1D1A0;MUSICAL SYMBOL ORNAMENT STROKE-6;So;0;L;;;;;N;;;;;
+1D1A1;MUSICAL SYMBOL ORNAMENT STROKE-7;So;0;L;;;;;N;;;;;
+1D1A2;MUSICAL SYMBOL ORNAMENT STROKE-8;So;0;L;;;;;N;;;;;
+1D1A3;MUSICAL SYMBOL ORNAMENT STROKE-9;So;0;L;;;;;N;;;;;
+1D1A4;MUSICAL SYMBOL ORNAMENT STROKE-10;So;0;L;;;;;N;;;;;
+1D1A5;MUSICAL SYMBOL ORNAMENT STROKE-11;So;0;L;;;;;N;;;;;
+1D1A6;MUSICAL SYMBOL HAUPTSTIMME;So;0;L;;;;;N;;;;;
+1D1A7;MUSICAL SYMBOL NEBENSTIMME;So;0;L;;;;;N;;;;;
+1D1A8;MUSICAL SYMBOL END OF STIMME;So;0;L;;;;;N;;;;;
+1D1A9;MUSICAL SYMBOL DEGREE SLASH;So;0;L;;;;;N;;;;;
+1D1AA;MUSICAL SYMBOL COMBINING DOWN BOW;Mn;230;NSM;;;;;N;;;;;
+1D1AB;MUSICAL SYMBOL COMBINING UP BOW;Mn;230;NSM;;;;;N;;;;;
+1D1AC;MUSICAL SYMBOL COMBINING HARMONIC;Mn;230;NSM;;;;;N;;;;;
+1D1AD;MUSICAL SYMBOL COMBINING SNAP PIZZICATO;Mn;230;NSM;;;;;N;;;;;
+1D1AE;MUSICAL SYMBOL PEDAL MARK;So;0;L;;;;;N;;;;;
+1D1AF;MUSICAL SYMBOL PEDAL UP MARK;So;0;L;;;;;N;;;;;
+1D1B0;MUSICAL SYMBOL HALF PEDAL MARK;So;0;L;;;;;N;;;;;
+1D1B1;MUSICAL SYMBOL GLISSANDO UP;So;0;L;;;;;N;;;;;
+1D1B2;MUSICAL SYMBOL GLISSANDO DOWN;So;0;L;;;;;N;;;;;
+1D1B3;MUSICAL SYMBOL WITH FINGERNAILS;So;0;L;;;;;N;;;;;
+1D1B4;MUSICAL SYMBOL DAMP;So;0;L;;;;;N;;;;;
+1D1B5;MUSICAL SYMBOL DAMP ALL;So;0;L;;;;;N;;;;;
+1D1B6;MUSICAL SYMBOL MAXIMA;So;0;L;;;;;N;;;;;
+1D1B7;MUSICAL SYMBOL LONGA;So;0;L;;;;;N;;;;;
+1D1B8;MUSICAL SYMBOL BREVIS;So;0;L;;;;;N;;;;;
+1D1B9;MUSICAL SYMBOL SEMIBREVIS WHITE;So;0;L;;;;;N;;;;;
+1D1BA;MUSICAL SYMBOL SEMIBREVIS BLACK;So;0;L;;;;;N;;;;;
+1D1BB;MUSICAL SYMBOL MINIMA;So;0;L;1D1B9 1D165;;;;N;;;;;
+1D1BC;MUSICAL SYMBOL MINIMA BLACK;So;0;L;1D1BA 1D165;;;;N;;;;;
+1D1BD;MUSICAL SYMBOL SEMIMINIMA WHITE;So;0;L;1D1BB 1D16E;;;;N;;;;;
+1D1BE;MUSICAL SYMBOL SEMIMINIMA BLACK;So;0;L;1D1BC 1D16E;;;;N;;;;;
+1D1BF;MUSICAL SYMBOL FUSA WHITE;So;0;L;1D1BB 1D16F;;;;N;;;;;
+1D1C0;MUSICAL SYMBOL FUSA BLACK;So;0;L;1D1BC 1D16F;;;;N;;;;;
+1D1C1;MUSICAL SYMBOL LONGA PERFECTA REST;So;0;L;;;;;N;;;;;
+1D1C2;MUSICAL SYMBOL LONGA IMPERFECTA REST;So;0;L;;;;;N;;;;;
+1D1C3;MUSICAL SYMBOL BREVIS REST;So;0;L;;;;;N;;;;;
+1D1C4;MUSICAL SYMBOL SEMIBREVIS REST;So;0;L;;;;;N;;;;;
+1D1C5;MUSICAL SYMBOL MINIMA REST;So;0;L;;;;;N;;;;;
+1D1C6;MUSICAL SYMBOL SEMIMINIMA REST;So;0;L;;;;;N;;;;;
+1D1C7;MUSICAL SYMBOL TEMPUS PERFECTUM CUM PROLATIONE PERFECTA;So;0;L;;;;;N;;;;;
+1D1C8;MUSICAL SYMBOL TEMPUS PERFECTUM CUM PROLATIONE IMPERFECTA;So;0;L;;;;;N;;;;;
+1D1C9;MUSICAL SYMBOL TEMPUS PERFECTUM CUM PROLATIONE PERFECTA DIMINUTION-1;So;0;L;;;;;N;;;;;
+1D1CA;MUSICAL SYMBOL TEMPUS IMPERFECTUM CUM PROLATIONE PERFECTA;So;0;L;;;;;N;;;;;
+1D1CB;MUSICAL SYMBOL TEMPUS IMPERFECTUM CUM PROLATIONE IMPERFECTA;So;0;L;;;;;N;;;;;
+1D1CC;MUSICAL SYMBOL TEMPUS IMPERFECTUM CUM PROLATIONE IMPERFECTA DIMINUTION-1;So;0;L;;;;;N;;;;;
+1D1CD;MUSICAL SYMBOL TEMPUS IMPERFECTUM CUM PROLATIONE IMPERFECTA DIMINUTION-2;So;0;L;;;;;N;;;;;
+1D1CE;MUSICAL SYMBOL TEMPUS IMPERFECTUM CUM PROLATIONE IMPERFECTA DIMINUTION-3;So;0;L;;;;;N;;;;;
+1D1CF;MUSICAL SYMBOL CROIX;So;0;L;;;;;N;;;;;
+1D1D0;MUSICAL SYMBOL GREGORIAN C CLEF;So;0;L;;;;;N;;;;;
+1D1D1;MUSICAL SYMBOL GREGORIAN F CLEF;So;0;L;;;;;N;;;;;
+1D1D2;MUSICAL SYMBOL SQUARE B;So;0;L;;;;;N;;;;;
+1D1D3;MUSICAL SYMBOL VIRGA;So;0;L;;;;;N;;;;;
+1D1D4;MUSICAL SYMBOL PODATUS;So;0;L;;;;;N;;;;;
+1D1D5;MUSICAL SYMBOL CLIVIS;So;0;L;;;;;N;;;;;
+1D1D6;MUSICAL SYMBOL SCANDICUS;So;0;L;;;;;N;;;;;
+1D1D7;MUSICAL SYMBOL CLIMACUS;So;0;L;;;;;N;;;;;
+1D1D8;MUSICAL SYMBOL TORCULUS;So;0;L;;;;;N;;;;;
+1D1D9;MUSICAL SYMBOL PORRECTUS;So;0;L;;;;;N;;;;;
+1D1DA;MUSICAL SYMBOL PORRECTUS FLEXUS;So;0;L;;;;;N;;;;;
+1D1DB;MUSICAL SYMBOL SCANDICUS FLEXUS;So;0;L;;;;;N;;;;;
+1D1DC;MUSICAL SYMBOL TORCULUS RESUPINUS;So;0;L;;;;;N;;;;;
+1D1DD;MUSICAL SYMBOL PES SUBPUNCTIS;So;0;L;;;;;N;;;;;
+1D1DE;MUSICAL SYMBOL KIEVAN C CLEF;So;0;L;;;;;N;;;;;
+1D1DF;MUSICAL SYMBOL KIEVAN END OF PIECE;So;0;L;;;;;N;;;;;
+1D1E0;MUSICAL SYMBOL KIEVAN FINAL NOTE;So;0;L;;;;;N;;;;;
+1D1E1;MUSICAL SYMBOL KIEVAN RECITATIVE MARK;So;0;L;;;;;N;;;;;
+1D1E2;MUSICAL SYMBOL KIEVAN WHOLE NOTE;So;0;L;;;;;N;;;;;
+1D1E3;MUSICAL SYMBOL KIEVAN HALF NOTE;So;0;L;;;;;N;;;;;
+1D1E4;MUSICAL SYMBOL KIEVAN QUARTER NOTE STEM DOWN;So;0;L;;;;;N;;;;;
+1D1E5;MUSICAL SYMBOL KIEVAN QUARTER NOTE STEM UP;So;0;L;;;;;N;;;;;
+1D1E6;MUSICAL SYMBOL KIEVAN EIGHTH NOTE STEM DOWN;So;0;L;;;;;N;;;;;
+1D1E7;MUSICAL SYMBOL KIEVAN EIGHTH NOTE STEM UP;So;0;L;;;;;N;;;;;
+1D1E8;MUSICAL SYMBOL KIEVAN FLAT SIGN;So;0;L;;;;;N;;;;;
+1D200;GREEK VOCAL NOTATION SYMBOL-1;So;0;ON;;;;;N;;;;;
+1D201;GREEK VOCAL NOTATION SYMBOL-2;So;0;ON;;;;;N;;;;;
+1D202;GREEK VOCAL NOTATION SYMBOL-3;So;0;ON;;;;;N;;;;;
+1D203;GREEK VOCAL NOTATION SYMBOL-4;So;0;ON;;;;;N;;;;;
+1D204;GREEK VOCAL NOTATION SYMBOL-5;So;0;ON;;;;;N;;;;;
+1D205;GREEK VOCAL NOTATION SYMBOL-6;So;0;ON;;;;;N;;;;;
+1D206;GREEK VOCAL NOTATION SYMBOL-7;So;0;ON;;;;;N;;;;;
+1D207;GREEK VOCAL NOTATION SYMBOL-8;So;0;ON;;;;;N;;;;;
+1D208;GREEK VOCAL NOTATION SYMBOL-9;So;0;ON;;;;;N;;;;;
+1D209;GREEK VOCAL NOTATION SYMBOL-10;So;0;ON;;;;;N;;;;;
+1D20A;GREEK VOCAL NOTATION SYMBOL-11;So;0;ON;;;;;N;;;;;
+1D20B;GREEK VOCAL NOTATION SYMBOL-12;So;0;ON;;;;;N;;;;;
+1D20C;GREEK VOCAL NOTATION SYMBOL-13;So;0;ON;;;;;N;;;;;
+1D20D;GREEK VOCAL NOTATION SYMBOL-14;So;0;ON;;;;;N;;;;;
+1D20E;GREEK VOCAL NOTATION SYMBOL-15;So;0;ON;;;;;N;;;;;
+1D20F;GREEK VOCAL NOTATION SYMBOL-16;So;0;ON;;;;;N;;;;;
+1D210;GREEK VOCAL NOTATION SYMBOL-17;So;0;ON;;;;;N;;;;;
+1D211;GREEK VOCAL NOTATION SYMBOL-18;So;0;ON;;;;;N;;;;;
+1D212;GREEK VOCAL NOTATION SYMBOL-19;So;0;ON;;;;;N;;;;;
+1D213;GREEK VOCAL NOTATION SYMBOL-20;So;0;ON;;;;;N;;;;;
+1D214;GREEK VOCAL NOTATION SYMBOL-21;So;0;ON;;;;;N;;;;;
+1D215;GREEK VOCAL NOTATION SYMBOL-22;So;0;ON;;;;;N;;;;;
+1D216;GREEK VOCAL NOTATION SYMBOL-23;So;0;ON;;;;;N;;;;;
+1D217;GREEK VOCAL NOTATION SYMBOL-24;So;0;ON;;;;;N;;;;;
+1D218;GREEK VOCAL NOTATION SYMBOL-50;So;0;ON;;;;;N;;;;;
+1D219;GREEK VOCAL NOTATION SYMBOL-51;So;0;ON;;;;;N;;;;;
+1D21A;GREEK VOCAL NOTATION SYMBOL-52;So;0;ON;;;;;N;;;;;
+1D21B;GREEK VOCAL NOTATION SYMBOL-53;So;0;ON;;;;;N;;;;;
+1D21C;GREEK VOCAL NOTATION SYMBOL-54;So;0;ON;;;;;N;;;;;
+1D21D;GREEK INSTRUMENTAL NOTATION SYMBOL-1;So;0;ON;;;;;N;;;;;
+1D21E;GREEK INSTRUMENTAL NOTATION SYMBOL-2;So;0;ON;;;;;N;;;;;
+1D21F;GREEK INSTRUMENTAL NOTATION SYMBOL-4;So;0;ON;;;;;N;;;;;
+1D220;GREEK INSTRUMENTAL NOTATION SYMBOL-5;So;0;ON;;;;;N;;;;;
+1D221;GREEK INSTRUMENTAL NOTATION SYMBOL-7;So;0;ON;;;;;N;;;;;
+1D222;GREEK INSTRUMENTAL NOTATION SYMBOL-8;So;0;ON;;;;;N;;;;;
+1D223;GREEK INSTRUMENTAL NOTATION SYMBOL-11;So;0;ON;;;;;N;;;;;
+1D224;GREEK INSTRUMENTAL NOTATION SYMBOL-12;So;0;ON;;;;;N;;;;;
+1D225;GREEK INSTRUMENTAL NOTATION SYMBOL-13;So;0;ON;;;;;N;;;;;
+1D226;GREEK INSTRUMENTAL NOTATION SYMBOL-14;So;0;ON;;;;;N;;;;;
+1D227;GREEK INSTRUMENTAL NOTATION SYMBOL-17;So;0;ON;;;;;N;;;;;
+1D228;GREEK INSTRUMENTAL NOTATION SYMBOL-18;So;0;ON;;;;;N;;;;;
+1D229;GREEK INSTRUMENTAL NOTATION SYMBOL-19;So;0;ON;;;;;N;;;;;
+1D22A;GREEK INSTRUMENTAL NOTATION SYMBOL-23;So;0;ON;;;;;N;;;;;
+1D22B;GREEK INSTRUMENTAL NOTATION SYMBOL-24;So;0;ON;;;;;N;;;;;
+1D22C;GREEK INSTRUMENTAL NOTATION SYMBOL-25;So;0;ON;;;;;N;;;;;
+1D22D;GREEK INSTRUMENTAL NOTATION SYMBOL-26;So;0;ON;;;;;N;;;;;
+1D22E;GREEK INSTRUMENTAL NOTATION SYMBOL-27;So;0;ON;;;;;N;;;;;
+1D22F;GREEK INSTRUMENTAL NOTATION SYMBOL-29;So;0;ON;;;;;N;;;;;
+1D230;GREEK INSTRUMENTAL NOTATION SYMBOL-30;So;0;ON;;;;;N;;;;;
+1D231;GREEK INSTRUMENTAL NOTATION SYMBOL-32;So;0;ON;;;;;N;;;;;
+1D232;GREEK INSTRUMENTAL NOTATION SYMBOL-36;So;0;ON;;;;;N;;;;;
+1D233;GREEK INSTRUMENTAL NOTATION SYMBOL-37;So;0;ON;;;;;N;;;;;
+1D234;GREEK INSTRUMENTAL NOTATION SYMBOL-38;So;0;ON;;;;;N;;;;;
+1D235;GREEK INSTRUMENTAL NOTATION SYMBOL-39;So;0;ON;;;;;N;;;;;
+1D236;GREEK INSTRUMENTAL NOTATION SYMBOL-40;So;0;ON;;;;;N;;;;;
+1D237;GREEK INSTRUMENTAL NOTATION SYMBOL-42;So;0;ON;;;;;N;;;;;
+1D238;GREEK INSTRUMENTAL NOTATION SYMBOL-43;So;0;ON;;;;;N;;;;;
+1D239;GREEK INSTRUMENTAL NOTATION SYMBOL-45;So;0;ON;;;;;N;;;;;
+1D23A;GREEK INSTRUMENTAL NOTATION SYMBOL-47;So;0;ON;;;;;N;;;;;
+1D23B;GREEK INSTRUMENTAL NOTATION SYMBOL-48;So;0;ON;;;;;N;;;;;
+1D23C;GREEK INSTRUMENTAL NOTATION SYMBOL-49;So;0;ON;;;;;N;;;;;
+1D23D;GREEK INSTRUMENTAL NOTATION SYMBOL-50;So;0;ON;;;;;N;;;;;
+1D23E;GREEK INSTRUMENTAL NOTATION SYMBOL-51;So;0;ON;;;;;N;;;;;
+1D23F;GREEK INSTRUMENTAL NOTATION SYMBOL-52;So;0;ON;;;;;N;;;;;
+1D240;GREEK INSTRUMENTAL NOTATION SYMBOL-53;So;0;ON;;;;;N;;;;;
+1D241;GREEK INSTRUMENTAL NOTATION SYMBOL-54;So;0;ON;;;;;N;;;;;
+1D242;COMBINING GREEK MUSICAL TRISEME;Mn;230;NSM;;;;;N;;;;;
+1D243;COMBINING GREEK MUSICAL TETRASEME;Mn;230;NSM;;;;;N;;;;;
+1D244;COMBINING GREEK MUSICAL PENTASEME;Mn;230;NSM;;;;;N;;;;;
+1D245;GREEK MUSICAL LEIMMA;So;0;ON;;;;;N;;;;;
+1D300;MONOGRAM FOR EARTH;So;0;ON;;;;;N;;;;;
+1D301;DIGRAM FOR HEAVENLY EARTH;So;0;ON;;;;;N;;;;;
+1D302;DIGRAM FOR HUMAN EARTH;So;0;ON;;;;;N;;;;;
+1D303;DIGRAM FOR EARTHLY HEAVEN;So;0;ON;;;;;N;;;;;
+1D304;DIGRAM FOR EARTHLY HUMAN;So;0;ON;;;;;N;;;;;
+1D305;DIGRAM FOR EARTH;So;0;ON;;;;;N;;;;;
+1D306;TETRAGRAM FOR CENTRE;So;0;ON;;;;;N;;;;;
+1D307;TETRAGRAM FOR FULL CIRCLE;So;0;ON;;;;;N;;;;;
+1D308;TETRAGRAM FOR MIRED;So;0;ON;;;;;N;;;;;
+1D309;TETRAGRAM FOR BARRIER;So;0;ON;;;;;N;;;;;
+1D30A;TETRAGRAM FOR KEEPING SMALL;So;0;ON;;;;;N;;;;;
+1D30B;TETRAGRAM FOR CONTRARIETY;So;0;ON;;;;;N;;;;;
+1D30C;TETRAGRAM FOR ASCENT;So;0;ON;;;;;N;;;;;
+1D30D;TETRAGRAM FOR OPPOSITION;So;0;ON;;;;;N;;;;;
+1D30E;TETRAGRAM FOR BRANCHING OUT;So;0;ON;;;;;N;;;;;
+1D30F;TETRAGRAM FOR DEFECTIVENESS OR DISTORTION;So;0;ON;;;;;N;;;;;
+1D310;TETRAGRAM FOR DIVERGENCE;So;0;ON;;;;;N;;;;;
+1D311;TETRAGRAM FOR YOUTHFULNESS;So;0;ON;;;;;N;;;;;
+1D312;TETRAGRAM FOR INCREASE;So;0;ON;;;;;N;;;;;
+1D313;TETRAGRAM FOR PENETRATION;So;0;ON;;;;;N;;;;;
+1D314;TETRAGRAM FOR REACH;So;0;ON;;;;;N;;;;;
+1D315;TETRAGRAM FOR CONTACT;So;0;ON;;;;;N;;;;;
+1D316;TETRAGRAM FOR HOLDING BACK;So;0;ON;;;;;N;;;;;
+1D317;TETRAGRAM FOR WAITING;So;0;ON;;;;;N;;;;;
+1D318;TETRAGRAM FOR FOLLOWING;So;0;ON;;;;;N;;;;;
+1D319;TETRAGRAM FOR ADVANCE;So;0;ON;;;;;N;;;;;
+1D31A;TETRAGRAM FOR RELEASE;So;0;ON;;;;;N;;;;;
+1D31B;TETRAGRAM FOR RESISTANCE;So;0;ON;;;;;N;;;;;
+1D31C;TETRAGRAM FOR EASE;So;0;ON;;;;;N;;;;;
+1D31D;TETRAGRAM FOR JOY;So;0;ON;;;;;N;;;;;
+1D31E;TETRAGRAM FOR CONTENTION;So;0;ON;;;;;N;;;;;
+1D31F;TETRAGRAM FOR ENDEAVOUR;So;0;ON;;;;;N;;;;;
+1D320;TETRAGRAM FOR DUTIES;So;0;ON;;;;;N;;;;;
+1D321;TETRAGRAM FOR CHANGE;So;0;ON;;;;;N;;;;;
+1D322;TETRAGRAM FOR DECISIVENESS;So;0;ON;;;;;N;;;;;
+1D323;TETRAGRAM FOR BOLD RESOLUTION;So;0;ON;;;;;N;;;;;
+1D324;TETRAGRAM FOR PACKING;So;0;ON;;;;;N;;;;;
+1D325;TETRAGRAM FOR LEGION;So;0;ON;;;;;N;;;;;
+1D326;TETRAGRAM FOR CLOSENESS;So;0;ON;;;;;N;;;;;
+1D327;TETRAGRAM FOR KINSHIP;So;0;ON;;;;;N;;;;;
+1D328;TETRAGRAM FOR GATHERING;So;0;ON;;;;;N;;;;;
+1D329;TETRAGRAM FOR STRENGTH;So;0;ON;;;;;N;;;;;
+1D32A;TETRAGRAM FOR PURITY;So;0;ON;;;;;N;;;;;
+1D32B;TETRAGRAM FOR FULLNESS;So;0;ON;;;;;N;;;;;
+1D32C;TETRAGRAM FOR RESIDENCE;So;0;ON;;;;;N;;;;;
+1D32D;TETRAGRAM FOR LAW OR MODEL;So;0;ON;;;;;N;;;;;
+1D32E;TETRAGRAM FOR RESPONSE;So;0;ON;;;;;N;;;;;
+1D32F;TETRAGRAM FOR GOING TO MEET;So;0;ON;;;;;N;;;;;
+1D330;TETRAGRAM FOR ENCOUNTERS;So;0;ON;;;;;N;;;;;
+1D331;TETRAGRAM FOR STOVE;So;0;ON;;;;;N;;;;;
+1D332;TETRAGRAM FOR GREATNESS;So;0;ON;;;;;N;;;;;
+1D333;TETRAGRAM FOR ENLARGEMENT;So;0;ON;;;;;N;;;;;
+1D334;TETRAGRAM FOR PATTERN;So;0;ON;;;;;N;;;;;
+1D335;TETRAGRAM FOR RITUAL;So;0;ON;;;;;N;;;;;
+1D336;TETRAGRAM FOR FLIGHT;So;0;ON;;;;;N;;;;;
+1D337;TETRAGRAM FOR VASTNESS OR WASTING;So;0;ON;;;;;N;;;;;
+1D338;TETRAGRAM FOR CONSTANCY;So;0;ON;;;;;N;;;;;
+1D339;TETRAGRAM FOR MEASURE;So;0;ON;;;;;N;;;;;
+1D33A;TETRAGRAM FOR ETERNITY;So;0;ON;;;;;N;;;;;
+1D33B;TETRAGRAM FOR UNITY;So;0;ON;;;;;N;;;;;
+1D33C;TETRAGRAM FOR DIMINISHMENT;So;0;ON;;;;;N;;;;;
+1D33D;TETRAGRAM FOR CLOSED MOUTH;So;0;ON;;;;;N;;;;;
+1D33E;TETRAGRAM FOR GUARDEDNESS;So;0;ON;;;;;N;;;;;
+1D33F;TETRAGRAM FOR GATHERING IN;So;0;ON;;;;;N;;;;;
+1D340;TETRAGRAM FOR MASSING;So;0;ON;;;;;N;;;;;
+1D341;TETRAGRAM FOR ACCUMULATION;So;0;ON;;;;;N;;;;;
+1D342;TETRAGRAM FOR EMBELLISHMENT;So;0;ON;;;;;N;;;;;
+1D343;TETRAGRAM FOR DOUBT;So;0;ON;;;;;N;;;;;
+1D344;TETRAGRAM FOR WATCH;So;0;ON;;;;;N;;;;;
+1D345;TETRAGRAM FOR SINKING;So;0;ON;;;;;N;;;;;
+1D346;TETRAGRAM FOR INNER;So;0;ON;;;;;N;;;;;
+1D347;TETRAGRAM FOR DEPARTURE;So;0;ON;;;;;N;;;;;
+1D348;TETRAGRAM FOR DARKENING;So;0;ON;;;;;N;;;;;
+1D349;TETRAGRAM FOR DIMMING;So;0;ON;;;;;N;;;;;
+1D34A;TETRAGRAM FOR EXHAUSTION;So;0;ON;;;;;N;;;;;
+1D34B;TETRAGRAM FOR SEVERANCE;So;0;ON;;;;;N;;;;;
+1D34C;TETRAGRAM FOR STOPPAGE;So;0;ON;;;;;N;;;;;
+1D34D;TETRAGRAM FOR HARDNESS;So;0;ON;;;;;N;;;;;
+1D34E;TETRAGRAM FOR COMPLETION;So;0;ON;;;;;N;;;;;
+1D34F;TETRAGRAM FOR CLOSURE;So;0;ON;;;;;N;;;;;
+1D350;TETRAGRAM FOR FAILURE;So;0;ON;;;;;N;;;;;
+1D351;TETRAGRAM FOR AGGRAVATION;So;0;ON;;;;;N;;;;;
+1D352;TETRAGRAM FOR COMPLIANCE;So;0;ON;;;;;N;;;;;
+1D353;TETRAGRAM FOR ON THE VERGE;So;0;ON;;;;;N;;;;;
+1D354;TETRAGRAM FOR DIFFICULTIES;So;0;ON;;;;;N;;;;;
+1D355;TETRAGRAM FOR LABOURING;So;0;ON;;;;;N;;;;;
+1D356;TETRAGRAM FOR FOSTERING;So;0;ON;;;;;N;;;;;
+1D360;COUNTING ROD UNIT DIGIT ONE;No;0;L;;;;1;N;;;;;
+1D361;COUNTING ROD UNIT DIGIT TWO;No;0;L;;;;2;N;;;;;
+1D362;COUNTING ROD UNIT DIGIT THREE;No;0;L;;;;3;N;;;;;
+1D363;COUNTING ROD UNIT DIGIT FOUR;No;0;L;;;;4;N;;;;;
+1D364;COUNTING ROD UNIT DIGIT FIVE;No;0;L;;;;5;N;;;;;
+1D365;COUNTING ROD UNIT DIGIT SIX;No;0;L;;;;6;N;;;;;
+1D366;COUNTING ROD UNIT DIGIT SEVEN;No;0;L;;;;7;N;;;;;
+1D367;COUNTING ROD UNIT DIGIT EIGHT;No;0;L;;;;8;N;;;;;
+1D368;COUNTING ROD UNIT DIGIT NINE;No;0;L;;;;9;N;;;;;
+1D369;COUNTING ROD TENS DIGIT ONE;No;0;L;;;;10;N;;;;;
+1D36A;COUNTING ROD TENS DIGIT TWO;No;0;L;;;;20;N;;;;;
+1D36B;COUNTING ROD TENS DIGIT THREE;No;0;L;;;;30;N;;;;;
+1D36C;COUNTING ROD TENS DIGIT FOUR;No;0;L;;;;40;N;;;;;
+1D36D;COUNTING ROD TENS DIGIT FIVE;No;0;L;;;;50;N;;;;;
+1D36E;COUNTING ROD TENS DIGIT SIX;No;0;L;;;;60;N;;;;;
+1D36F;COUNTING ROD TENS DIGIT SEVEN;No;0;L;;;;70;N;;;;;
+1D370;COUNTING ROD TENS DIGIT EIGHT;No;0;L;;;;80;N;;;;;
+1D371;COUNTING ROD TENS DIGIT NINE;No;0;L;;;;90;N;;;;;
+1D400;MATHEMATICAL BOLD CAPITAL A;Lu;0;L; 0041;;;;N;;;;;
+1D401;MATHEMATICAL BOLD CAPITAL B;Lu;0;L; 0042;;;;N;;;;;
+1D402;MATHEMATICAL BOLD CAPITAL C;Lu;0;L; 0043;;;;N;;;;;
+1D403;MATHEMATICAL BOLD CAPITAL D;Lu;0;L; 0044;;;;N;;;;;
+1D404;MATHEMATICAL BOLD CAPITAL E;Lu;0;L; 0045;;;;N;;;;;
+1D405;MATHEMATICAL BOLD CAPITAL F;Lu;0;L; 0046;;;;N;;;;;
+1D406;MATHEMATICAL BOLD CAPITAL G;Lu;0;L; 0047;;;;N;;;;;
+1D407;MATHEMATICAL BOLD CAPITAL H;Lu;0;L; 0048;;;;N;;;;;
+1D408;MATHEMATICAL BOLD CAPITAL I;Lu;0;L; 0049;;;;N;;;;;
+1D409;MATHEMATICAL BOLD CAPITAL J;Lu;0;L; 004A;;;;N;;;;;
+1D40A;MATHEMATICAL BOLD CAPITAL K;Lu;0;L; 004B;;;;N;;;;;
+1D40B;MATHEMATICAL BOLD CAPITAL L;Lu;0;L; 004C;;;;N;;;;;
+1D40C;MATHEMATICAL BOLD CAPITAL M;Lu;0;L; 004D;;;;N;;;;;
+1D40D;MATHEMATICAL BOLD CAPITAL N;Lu;0;L; 004E;;;;N;;;;;
+1D40E;MATHEMATICAL BOLD CAPITAL O;Lu;0;L; 004F;;;;N;;;;;
+1D40F;MATHEMATICAL BOLD CAPITAL P;Lu;0;L; 0050;;;;N;;;;;
+1D410;MATHEMATICAL BOLD CAPITAL Q;Lu;0;L; 0051;;;;N;;;;;
+1D411;MATHEMATICAL BOLD CAPITAL R;Lu;0;L; 0052;;;;N;;;;;
+1D412;MATHEMATICAL BOLD CAPITAL S;Lu;0;L; 0053;;;;N;;;;;
+1D413;MATHEMATICAL BOLD CAPITAL T;Lu;0;L; 0054;;;;N;;;;;
+1D414;MATHEMATICAL BOLD CAPITAL U;Lu;0;L; 0055;;;;N;;;;;
+1D415;MATHEMATICAL BOLD CAPITAL V;Lu;0;L; 0056;;;;N;;;;;
+1D416;MATHEMATICAL BOLD CAPITAL W;Lu;0;L; 0057;;;;N;;;;;
+1D417;MATHEMATICAL BOLD CAPITAL X;Lu;0;L; 0058;;;;N;;;;;
+1D418;MATHEMATICAL BOLD CAPITAL Y;Lu;0;L; 0059;;;;N;;;;;
+1D419;MATHEMATICAL BOLD CAPITAL Z;Lu;0;L; 005A;;;;N;;;;;
+1D41A;MATHEMATICAL BOLD SMALL A;Ll;0;L; 0061;;;;N;;;;;
+1D41B;MATHEMATICAL BOLD SMALL B;Ll;0;L; 0062;;;;N;;;;;
+1D41C;MATHEMATICAL BOLD SMALL C;Ll;0;L; 0063;;;;N;;;;;
+1D41D;MATHEMATICAL BOLD SMALL D;Ll;0;L; 0064;;;;N;;;;;
+1D41E;MATHEMATICAL BOLD SMALL E;Ll;0;L; 0065;;;;N;;;;;
+1D41F;MATHEMATICAL BOLD SMALL F;Ll;0;L; 0066;;;;N;;;;;
+1D420;MATHEMATICAL BOLD SMALL G;Ll;0;L; 0067;;;;N;;;;;
+1D421;MATHEMATICAL BOLD SMALL H;Ll;0;L; 0068;;;;N;;;;;
+1D422;MATHEMATICAL BOLD SMALL I;Ll;0;L; 0069;;;;N;;;;;
+1D423;MATHEMATICAL BOLD SMALL J;Ll;0;L; 006A;;;;N;;;;;
+1D424;MATHEMATICAL BOLD SMALL K;Ll;0;L; 006B;;;;N;;;;;
+1D425;MATHEMATICAL BOLD SMALL L;Ll;0;L; 006C;;;;N;;;;;
+1D426;MATHEMATICAL BOLD SMALL M;Ll;0;L; 006D;;;;N;;;;;
+1D427;MATHEMATICAL BOLD SMALL N;Ll;0;L; 006E;;;;N;;;;;
+1D428;MATHEMATICAL BOLD SMALL O;Ll;0;L; 006F;;;;N;;;;;
+1D429;MATHEMATICAL BOLD SMALL P;Ll;0;L; 0070;;;;N;;;;;
+1D42A;MATHEMATICAL BOLD SMALL Q;Ll;0;L; 0071;;;;N;;;;;
+1D42B;MATHEMATICAL BOLD SMALL R;Ll;0;L; 0072;;;;N;;;;;
+1D42C;MATHEMATICAL BOLD SMALL S;Ll;0;L; 0073;;;;N;;;;;
+1D42D;MATHEMATICAL BOLD SMALL T;Ll;0;L; 0074;;;;N;;;;;
+1D42E;MATHEMATICAL BOLD SMALL U;Ll;0;L; 0075;;;;N;;;;;
+1D42F;MATHEMATICAL BOLD SMALL V;Ll;0;L; 0076;;;;N;;;;;
+1D430;MATHEMATICAL BOLD SMALL W;Ll;0;L; 0077;;;;N;;;;;
+1D431;MATHEMATICAL BOLD SMALL X;Ll;0;L; 0078;;;;N;;;;;
+1D432;MATHEMATICAL BOLD SMALL Y;Ll;0;L; 0079;;;;N;;;;;
+1D433;MATHEMATICAL BOLD SMALL Z;Ll;0;L; 007A;;;;N;;;;;
+1D434;MATHEMATICAL ITALIC CAPITAL A;Lu;0;L; 0041;;;;N;;;;;
+1D435;MATHEMATICAL ITALIC CAPITAL B;Lu;0;L; 0042;;;;N;;;;;
+1D436;MATHEMATICAL ITALIC CAPITAL C;Lu;0;L; 0043;;;;N;;;;;
+1D437;MATHEMATICAL ITALIC CAPITAL D;Lu;0;L; 0044;;;;N;;;;;
+1D438;MATHEMATICAL ITALIC CAPITAL E;Lu;0;L; 0045;;;;N;;;;;
+1D439;MATHEMATICAL ITALIC CAPITAL F;Lu;0;L; 0046;;;;N;;;;;
+1D43A;MATHEMATICAL ITALIC CAPITAL G;Lu;0;L; 0047;;;;N;;;;;
+1D43B;MATHEMATICAL ITALIC CAPITAL H;Lu;0;L; 0048;;;;N;;;;;
+1D43C;MATHEMATICAL ITALIC CAPITAL I;Lu;0;L; 0049;;;;N;;;;;
+1D43D;MATHEMATICAL ITALIC CAPITAL J;Lu;0;L; 004A;;;;N;;;;;
+1D43E;MATHEMATICAL ITALIC CAPITAL K;Lu;0;L; 004B;;;;N;;;;;
+1D43F;MATHEMATICAL ITALIC CAPITAL L;Lu;0;L; 004C;;;;N;;;;;
+1D440;MATHEMATICAL ITALIC CAPITAL M;Lu;0;L; 004D;;;;N;;;;;
+1D441;MATHEMATICAL ITALIC CAPITAL N;Lu;0;L; 004E;;;;N;;;;;
+1D442;MATHEMATICAL ITALIC CAPITAL O;Lu;0;L; 004F;;;;N;;;;;
+1D443;MATHEMATICAL ITALIC CAPITAL P;Lu;0;L; 0050;;;;N;;;;;
+1D444;MATHEMATICAL ITALIC CAPITAL Q;Lu;0;L; 0051;;;;N;;;;;
+1D445;MATHEMATICAL ITALIC CAPITAL R;Lu;0;L; 0052;;;;N;;;;;
+1D446;MATHEMATICAL ITALIC CAPITAL S;Lu;0;L; 0053;;;;N;;;;;
+1D447;MATHEMATICAL ITALIC CAPITAL T;Lu;0;L; 0054;;;;N;;;;;
+1D448;MATHEMATICAL ITALIC CAPITAL U;Lu;0;L; 0055;;;;N;;;;;
+1D449;MATHEMATICAL ITALIC CAPITAL V;Lu;0;L; 0056;;;;N;;;;;
+1D44A;MATHEMATICAL ITALIC CAPITAL W;Lu;0;L; 0057;;;;N;;;;;
+1D44B;MATHEMATICAL ITALIC CAPITAL X;Lu;0;L; 0058;;;;N;;;;;
+1D44C;MATHEMATICAL ITALIC CAPITAL Y;Lu;0;L; 0059;;;;N;;;;;
+1D44D;MATHEMATICAL ITALIC CAPITAL Z;Lu;0;L; 005A;;;;N;;;;;
+1D44E;MATHEMATICAL ITALIC SMALL A;Ll;0;L; 0061;;;;N;;;;;
+1D44F;MATHEMATICAL ITALIC SMALL B;Ll;0;L; 0062;;;;N;;;;;
+1D450;MATHEMATICAL ITALIC SMALL C;Ll;0;L; 0063;;;;N;;;;;
+1D451;MATHEMATICAL ITALIC SMALL D;Ll;0;L; 0064;;;;N;;;;;
+1D452;MATHEMATICAL ITALIC SMALL E;Ll;0;L; 0065;;;;N;;;;;
+1D453;MATHEMATICAL ITALIC SMALL F;Ll;0;L; 0066;;;;N;;;;;
+1D454;MATHEMATICAL ITALIC SMALL G;Ll;0;L; 0067;;;;N;;;;;
+1D456;MATHEMATICAL ITALIC SMALL I;Ll;0;L; 0069;;;;N;;;;;
+1D457;MATHEMATICAL ITALIC SMALL J;Ll;0;L; 006A;;;;N;;;;;
+1D458;MATHEMATICAL ITALIC SMALL K;Ll;0;L; 006B;;;;N;;;;;
+1D459;MATHEMATICAL ITALIC SMALL L;Ll;0;L; 006C;;;;N;;;;;
+1D45A;MATHEMATICAL ITALIC SMALL M;Ll;0;L; 006D;;;;N;;;;;
+1D45B;MATHEMATICAL ITALIC SMALL N;Ll;0;L; 006E;;;;N;;;;;
+1D45C;MATHEMATICAL ITALIC SMALL O;Ll;0;L; 006F;;;;N;;;;;
+1D45D;MATHEMATICAL ITALIC SMALL P;Ll;0;L; 0070;;;;N;;;;;
+1D45E;MATHEMATICAL ITALIC SMALL Q;Ll;0;L; 0071;;;;N;;;;;
+1D45F;MATHEMATICAL ITALIC SMALL R;Ll;0;L; 0072;;;;N;;;;;
+1D460;MATHEMATICAL ITALIC SMALL S;Ll;0;L; 0073;;;;N;;;;;
+1D461;MATHEMATICAL ITALIC SMALL T;Ll;0;L; 0074;;;;N;;;;;
+1D462;MATHEMATICAL ITALIC SMALL U;Ll;0;L; 0075;;;;N;;;;;
+1D463;MATHEMATICAL ITALIC SMALL V;Ll;0;L; 0076;;;;N;;;;;
+1D464;MATHEMATICAL ITALIC SMALL W;Ll;0;L; 0077;;;;N;;;;;
+1D465;MATHEMATICAL ITALIC SMALL X;Ll;0;L; 0078;;;;N;;;;;
+1D466;MATHEMATICAL ITALIC SMALL Y;Ll;0;L; 0079;;;;N;;;;;
+1D467;MATHEMATICAL ITALIC SMALL Z;Ll;0;L; 007A;;;;N;;;;;
+1D468;MATHEMATICAL BOLD ITALIC CAPITAL A;Lu;0;L; 0041;;;;N;;;;;
+1D469;MATHEMATICAL BOLD ITALIC CAPITAL B;Lu;0;L; 0042;;;;N;;;;;
+1D46A;MATHEMATICAL BOLD ITALIC CAPITAL C;Lu;0;L; 0043;;;;N;;;;;
+1D46B;MATHEMATICAL BOLD ITALIC CAPITAL D;Lu;0;L; 0044;;;;N;;;;;
+1D46C;MATHEMATICAL BOLD ITALIC CAPITAL E;Lu;0;L; 0045;;;;N;;;;;
+1D46D;MATHEMATICAL BOLD ITALIC CAPITAL F;Lu;0;L; 0046;;;;N;;;;;
+1D46E;MATHEMATICAL BOLD ITALIC CAPITAL G;Lu;0;L; 0047;;;;N;;;;;
+1D46F;MATHEMATICAL BOLD ITALIC CAPITAL H;Lu;0;L; 0048;;;;N;;;;;
+1D470;MATHEMATICAL BOLD ITALIC CAPITAL I;Lu;0;L; 0049;;;;N;;;;;
+1D471;MATHEMATICAL BOLD ITALIC CAPITAL J;Lu;0;L; 004A;;;;N;;;;;
+1D472;MATHEMATICAL BOLD ITALIC CAPITAL K;Lu;0;L; 004B;;;;N;;;;;
+1D473;MATHEMATICAL BOLD ITALIC CAPITAL L;Lu;0;L; 004C;;;;N;;;;;
+1D474;MATHEMATICAL BOLD ITALIC CAPITAL M;Lu;0;L; 004D;;;;N;;;;;
+1D475;MATHEMATICAL BOLD ITALIC CAPITAL N;Lu;0;L; 004E;;;;N;;;;;
+1D476;MATHEMATICAL BOLD ITALIC CAPITAL O;Lu;0;L; 004F;;;;N;;;;;
+1D477;MATHEMATICAL BOLD ITALIC CAPITAL P;Lu;0;L; 0050;;;;N;;;;;
+1D478;MATHEMATICAL BOLD ITALIC CAPITAL Q;Lu;0;L; 0051;;;;N;;;;;
+1D479;MATHEMATICAL BOLD ITALIC CAPITAL R;Lu;0;L; 0052;;;;N;;;;;
+1D47A;MATHEMATICAL BOLD ITALIC CAPITAL S;Lu;0;L; 0053;;;;N;;;;;
+1D47B;MATHEMATICAL BOLD ITALIC CAPITAL T;Lu;0;L; 0054;;;;N;;;;;
+1D47C;MATHEMATICAL BOLD ITALIC CAPITAL U;Lu;0;L; 0055;;;;N;;;;;
+1D47D;MATHEMATICAL BOLD ITALIC CAPITAL V;Lu;0;L; 0056;;;;N;;;;;
+1D47E;MATHEMATICAL BOLD ITALIC CAPITAL W;Lu;0;L; 0057;;;;N;;;;;
+1D47F;MATHEMATICAL BOLD ITALIC CAPITAL X;Lu;0;L; 0058;;;;N;;;;;
+1D480;MATHEMATICAL BOLD ITALIC CAPITAL Y;Lu;0;L; 0059;;;;N;;;;;
+1D481;MATHEMATICAL BOLD ITALIC CAPITAL Z;Lu;0;L; 005A;;;;N;;;;;
+1D482;MATHEMATICAL BOLD ITALIC SMALL A;Ll;0;L; 0061;;;;N;;;;;
+1D483;MATHEMATICAL BOLD ITALIC SMALL B;Ll;0;L; 0062;;;;N;;;;;
+1D484;MATHEMATICAL BOLD ITALIC SMALL C;Ll;0;L; 0063;;;;N;;;;;
+1D485;MATHEMATICAL BOLD ITALIC SMALL D;Ll;0;L; 0064;;;;N;;;;;
+1D486;MATHEMATICAL BOLD ITALIC SMALL E;Ll;0;L; 0065;;;;N;;;;;
+1D487;MATHEMATICAL BOLD ITALIC SMALL F;Ll;0;L; 0066;;;;N;;;;;
+1D488;MATHEMATICAL BOLD ITALIC SMALL G;Ll;0;L; 0067;;;;N;;;;;
+1D489;MATHEMATICAL BOLD ITALIC SMALL H;Ll;0;L; 0068;;;;N;;;;;
+1D48A;MATHEMATICAL BOLD ITALIC SMALL I;Ll;0;L; 0069;;;;N;;;;;
+1D48B;MATHEMATICAL BOLD ITALIC SMALL J;Ll;0;L; 006A;;;;N;;;;;
+1D48C;MATHEMATICAL BOLD ITALIC SMALL K;Ll;0;L; 006B;;;;N;;;;;
+1D48D;MATHEMATICAL BOLD ITALIC SMALL L;Ll;0;L; 006C;;;;N;;;;;
+1D48E;MATHEMATICAL BOLD ITALIC SMALL M;Ll;0;L; 006D;;;;N;;;;;
+1D48F;MATHEMATICAL BOLD ITALIC SMALL N;Ll;0;L; 006E;;;;N;;;;;
+1D490;MATHEMATICAL BOLD ITALIC SMALL O;Ll;0;L; 006F;;;;N;;;;;
+1D491;MATHEMATICAL BOLD ITALIC SMALL P;Ll;0;L; 0070;;;;N;;;;;
+1D492;MATHEMATICAL BOLD ITALIC SMALL Q;Ll;0;L; 0071;;;;N;;;;;
+1D493;MATHEMATICAL BOLD ITALIC SMALL R;Ll;0;L; 0072;;;;N;;;;;
+1D494;MATHEMATICAL BOLD ITALIC SMALL S;Ll;0;L; 0073;;;;N;;;;;
+1D495;MATHEMATICAL BOLD ITALIC SMALL T;Ll;0;L; 0074;;;;N;;;;;
+1D496;MATHEMATICAL BOLD ITALIC SMALL U;Ll;0;L; 0075;;;;N;;;;;
+1D497;MATHEMATICAL BOLD ITALIC SMALL V;Ll;0;L; 0076;;;;N;;;;;
+1D498;MATHEMATICAL BOLD ITALIC SMALL W;Ll;0;L; 0077;;;;N;;;;;
+1D499;MATHEMATICAL BOLD ITALIC SMALL X;Ll;0;L; 0078;;;;N;;;;;
+1D49A;MATHEMATICAL BOLD ITALIC SMALL Y;Ll;0;L; 0079;;;;N;;;;;
+1D49B;MATHEMATICAL BOLD ITALIC SMALL Z;Ll;0;L; 007A;;;;N;;;;;
+1D49C;MATHEMATICAL SCRIPT CAPITAL A;Lu;0;L; 0041;;;;N;;;;;
+1D49E;MATHEMATICAL SCRIPT CAPITAL C;Lu;0;L; 0043;;;;N;;;;;
+1D49F;MATHEMATICAL SCRIPT CAPITAL D;Lu;0;L; 0044;;;;N;;;;;
+1D4A2;MATHEMATICAL SCRIPT CAPITAL G;Lu;0;L; 0047;;;;N;;;;;
+1D4A5;MATHEMATICAL SCRIPT CAPITAL J;Lu;0;L; 004A;;;;N;;;;;
+1D4A6;MATHEMATICAL SCRIPT CAPITAL K;Lu;0;L; 004B;;;;N;;;;;
+1D4A9;MATHEMATICAL SCRIPT CAPITAL N;Lu;0;L; 004E;;;;N;;;;;
+1D4AA;MATHEMATICAL SCRIPT CAPITAL O;Lu;0;L; 004F;;;;N;;;;;
+1D4AB;MATHEMATICAL SCRIPT CAPITAL P;Lu;0;L; 0050;;;;N;;;;;
+1D4AC;MATHEMATICAL SCRIPT CAPITAL Q;Lu;0;L; 0051;;;;N;;;;;
+1D4AE;MATHEMATICAL SCRIPT CAPITAL S;Lu;0;L; 0053;;;;N;;;;;
+1D4AF;MATHEMATICAL SCRIPT CAPITAL T;Lu;0;L; 0054;;;;N;;;;;
+1D4B0;MATHEMATICAL SCRIPT CAPITAL U;Lu;0;L; 0055;;;;N;;;;;
+1D4B1;MATHEMATICAL SCRIPT CAPITAL V;Lu;0;L; 0056;;;;N;;;;;
+1D4B2;MATHEMATICAL SCRIPT CAPITAL W;Lu;0;L; 0057;;;;N;;;;;
+1D4B3;MATHEMATICAL SCRIPT CAPITAL X;Lu;0;L; 0058;;;;N;;;;;
+1D4B4;MATHEMATICAL SCRIPT CAPITAL Y;Lu;0;L; 0059;;;;N;;;;;
+1D4B5;MATHEMATICAL SCRIPT CAPITAL Z;Lu;0;L; 005A;;;;N;;;;;
+1D4B6;MATHEMATICAL SCRIPT SMALL A;Ll;0;L; 0061;;;;N;;;;;
+1D4B7;MATHEMATICAL SCRIPT SMALL B;Ll;0;L; 0062;;;;N;;;;;
+1D4B8;MATHEMATICAL SCRIPT SMALL C;Ll;0;L; 0063;;;;N;;;;;
+1D4B9;MATHEMATICAL SCRIPT SMALL D;Ll;0;L; 0064;;;;N;;;;;
+1D4BB;MATHEMATICAL SCRIPT SMALL F;Ll;0;L; 0066;;;;N;;;;;
+1D4BD;MATHEMATICAL SCRIPT SMALL H;Ll;0;L; 0068;;;;N;;;;;
+1D4BE;MATHEMATICAL SCRIPT SMALL I;Ll;0;L; 0069;;;;N;;;;;
+1D4BF;MATHEMATICAL SCRIPT SMALL J;Ll;0;L; 006A;;;;N;;;;;
+1D4C0;MATHEMATICAL SCRIPT SMALL K;Ll;0;L; 006B;;;;N;;;;;
+1D4C1;MATHEMATICAL SCRIPT SMALL L;Ll;0;L; 006C;;;;N;;;;;
+1D4C2;MATHEMATICAL SCRIPT SMALL M;Ll;0;L; 006D;;;;N;;;;;
+1D4C3;MATHEMATICAL SCRIPT SMALL N;Ll;0;L; 006E;;;;N;;;;;
+1D4C5;MATHEMATICAL SCRIPT SMALL P;Ll;0;L; 0070;;;;N;;;;;
+1D4C6;MATHEMATICAL SCRIPT SMALL Q;Ll;0;L; 0071;;;;N;;;;;
+1D4C7;MATHEMATICAL SCRIPT SMALL R;Ll;0;L; 0072;;;;N;;;;;
+1D4C8;MATHEMATICAL SCRIPT SMALL S;Ll;0;L; 0073;;;;N;;;;;
+1D4C9;MATHEMATICAL SCRIPT SMALL T;Ll;0;L; 0074;;;;N;;;;;
+1D4CA;MATHEMATICAL SCRIPT SMALL U;Ll;0;L; 0075;;;;N;;;;;
+1D4CB;MATHEMATICAL SCRIPT SMALL V;Ll;0;L; 0076;;;;N;;;;;
+1D4CC;MATHEMATICAL SCRIPT SMALL W;Ll;0;L; 0077;;;;N;;;;;
+1D4CD;MATHEMATICAL SCRIPT SMALL X;Ll;0;L; 0078;;;;N;;;;;
+1D4CE;MATHEMATICAL SCRIPT SMALL Y;Ll;0;L; 0079;;;;N;;;;;
+1D4CF;MATHEMATICAL SCRIPT SMALL Z;Ll;0;L; 007A;;;;N;;;;;
+1D4D0;MATHEMATICAL BOLD SCRIPT CAPITAL A;Lu;0;L; 0041;;;;N;;;;;
+1D4D1;MATHEMATICAL BOLD SCRIPT CAPITAL B;Lu;0;L; 0042;;;;N;;;;;
+1D4D2;MATHEMATICAL BOLD SCRIPT CAPITAL C;Lu;0;L; 0043;;;;N;;;;;
+1D4D3;MATHEMATICAL BOLD SCRIPT CAPITAL D;Lu;0;L; 0044;;;;N;;;;;
+1D4D4;MATHEMATICAL BOLD SCRIPT CAPITAL E;Lu;0;L; 0045;;;;N;;;;;
+1D4D5;MATHEMATICAL BOLD SCRIPT CAPITAL F;Lu;0;L; 0046;;;;N;;;;;
+1D4D6;MATHEMATICAL BOLD SCRIPT CAPITAL G;Lu;0;L; 0047;;;;N;;;;;
+1D4D7;MATHEMATICAL BOLD SCRIPT CAPITAL H;Lu;0;L; 0048;;;;N;;;;;
+1D4D8;MATHEMATICAL BOLD SCRIPT CAPITAL I;Lu;0;L; 0049;;;;N;;;;;
+1D4D9;MATHEMATICAL BOLD SCRIPT CAPITAL J;Lu;0;L; 004A;;;;N;;;;;
+1D4DA;MATHEMATICAL BOLD SCRIPT CAPITAL K;Lu;0;L; 004B;;;;N;;;;;
+1D4DB;MATHEMATICAL BOLD SCRIPT CAPITAL L;Lu;0;L; 004C;;;;N;;;;;
+1D4DC;MATHEMATICAL BOLD SCRIPT CAPITAL M;Lu;0;L; 004D;;;;N;;;;;
+1D4DD;MATHEMATICAL BOLD SCRIPT CAPITAL N;Lu;0;L; 004E;;;;N;;;;;
+1D4DE;MATHEMATICAL BOLD SCRIPT CAPITAL O;Lu;0;L; 004F;;;;N;;;;;
+1D4DF;MATHEMATICAL BOLD SCRIPT CAPITAL P;Lu;0;L; 0050;;;;N;;;;;
+1D4E0;MATHEMATICAL BOLD SCRIPT CAPITAL Q;Lu;0;L; 0051;;;;N;;;;;
+1D4E1;MATHEMATICAL BOLD SCRIPT CAPITAL R;Lu;0;L; 0052;;;;N;;;;;
+1D4E2;MATHEMATICAL BOLD SCRIPT CAPITAL S;Lu;0;L; 0053;;;;N;;;;;
+1D4E3;MATHEMATICAL BOLD SCRIPT CAPITAL T;Lu;0;L; 0054;;;;N;;;;;
+1D4E4;MATHEMATICAL BOLD SCRIPT CAPITAL U;Lu;0;L; 0055;;;;N;;;;;
+1D4E5;MATHEMATICAL BOLD SCRIPT CAPITAL V;Lu;0;L; 0056;;;;N;;;;;
+1D4E6;MATHEMATICAL BOLD SCRIPT CAPITAL W;Lu;0;L; 0057;;;;N;;;;;
+1D4E7;MATHEMATICAL BOLD SCRIPT CAPITAL X;Lu;0;L; 0058;;;;N;;;;;
+1D4E8;MATHEMATICAL BOLD SCRIPT CAPITAL Y;Lu;0;L; 0059;;;;N;;;;;
+1D4E9;MATHEMATICAL BOLD SCRIPT CAPITAL Z;Lu;0;L; 005A;;;;N;;;;;
+1D4EA;MATHEMATICAL BOLD SCRIPT SMALL A;Ll;0;L; 0061;;;;N;;;;;
+1D4EB;MATHEMATICAL BOLD SCRIPT SMALL B;Ll;0;L; 0062;;;;N;;;;;
+1D4EC;MATHEMATICAL BOLD SCRIPT SMALL C;Ll;0;L; 0063;;;;N;;;;;
+1D4ED;MATHEMATICAL BOLD SCRIPT SMALL D;Ll;0;L; 0064;;;;N;;;;;
+1D4EE;MATHEMATICAL BOLD SCRIPT SMALL E;Ll;0;L; 0065;;;;N;;;;;
+1D4EF;MATHEMATICAL BOLD SCRIPT SMALL F;Ll;0;L; 0066;;;;N;;;;;
+1D4F0;MATHEMATICAL BOLD SCRIPT SMALL G;Ll;0;L; 0067;;;;N;;;;;
+1D4F1;MATHEMATICAL BOLD SCRIPT SMALL H;Ll;0;L; 0068;;;;N;;;;;
+1D4F2;MATHEMATICAL BOLD SCRIPT SMALL I;Ll;0;L; 0069;;;;N;;;;;
+1D4F3;MATHEMATICAL BOLD SCRIPT SMALL J;Ll;0;L; 006A;;;;N;;;;;
+1D4F4;MATHEMATICAL BOLD SCRIPT SMALL K;Ll;0;L; 006B;;;;N;;;;;
+1D4F5;MATHEMATICAL BOLD SCRIPT SMALL L;Ll;0;L; 006C;;;;N;;;;;
+1D4F6;MATHEMATICAL BOLD SCRIPT SMALL M;Ll;0;L; 006D;;;;N;;;;;
+1D4F7;MATHEMATICAL BOLD SCRIPT SMALL N;Ll;0;L; 006E;;;;N;;;;;
+1D4F8;MATHEMATICAL BOLD SCRIPT SMALL O;Ll;0;L; 006F;;;;N;;;;;
+1D4F9;MATHEMATICAL BOLD SCRIPT SMALL P;Ll;0;L; 0070;;;;N;;;;;
+1D4FA;MATHEMATICAL BOLD SCRIPT SMALL Q;Ll;0;L; 0071;;;;N;;;;;
+1D4FB;MATHEMATICAL BOLD SCRIPT SMALL R;Ll;0;L; 0072;;;;N;;;;;
+1D4FC;MATHEMATICAL BOLD SCRIPT SMALL S;Ll;0;L; 0073;;;;N;;;;;
+1D4FD;MATHEMATICAL BOLD SCRIPT SMALL T;Ll;0;L; 0074;;;;N;;;;;
+1D4FE;MATHEMATICAL BOLD SCRIPT SMALL U;Ll;0;L; 0075;;;;N;;;;;
+1D4FF;MATHEMATICAL BOLD SCRIPT SMALL V;Ll;0;L; 0076;;;;N;;;;;
+1D500;MATHEMATICAL BOLD SCRIPT SMALL W;Ll;0;L; 0077;;;;N;;;;;
+1D501;MATHEMATICAL BOLD SCRIPT SMALL X;Ll;0;L; 0078;;;;N;;;;;
+1D502;MATHEMATICAL BOLD SCRIPT SMALL Y;Ll;0;L; 0079;;;;N;;;;;
+1D503;MATHEMATICAL BOLD SCRIPT SMALL Z;Ll;0;L; 007A;;;;N;;;;;
+1D504;MATHEMATICAL FRAKTUR CAPITAL A;Lu;0;L; 0041;;;;N;;;;;
+1D505;MATHEMATICAL FRAKTUR CAPITAL B;Lu;0;L; 0042;;;;N;;;;;
+1D507;MATHEMATICAL FRAKTUR CAPITAL D;Lu;0;L; 0044;;;;N;;;;;
+1D508;MATHEMATICAL FRAKTUR CAPITAL E;Lu;0;L; 0045;;;;N;;;;;
+1D509;MATHEMATICAL FRAKTUR CAPITAL F;Lu;0;L; 0046;;;;N;;;;;
+1D50A;MATHEMATICAL FRAKTUR CAPITAL G;Lu;0;L; 0047;;;;N;;;;;
+1D50D;MATHEMATICAL FRAKTUR CAPITAL J;Lu;0;L; 004A;;;;N;;;;;
+1D50E;MATHEMATICAL FRAKTUR CAPITAL K;Lu;0;L; 004B;;;;N;;;;;
+1D50F;MATHEMATICAL FRAKTUR CAPITAL L;Lu;0;L; 004C;;;;N;;;;;
+1D510;MATHEMATICAL FRAKTUR CAPITAL M;Lu;0;L; 004D;;;;N;;;;;
+1D511;MATHEMATICAL FRAKTUR CAPITAL N;Lu;0;L; 004E;;;;N;;;;;
+1D512;MATHEMATICAL FRAKTUR CAPITAL O;Lu;0;L; 004F;;;;N;;;;;
+1D513;MATHEMATICAL FRAKTUR CAPITAL P;Lu;0;L; 0050;;;;N;;;;;
+1D514;MATHEMATICAL FRAKTUR CAPITAL Q;Lu;0;L; 0051;;;;N;;;;;
+1D516;MATHEMATICAL FRAKTUR CAPITAL S;Lu;0;L; 0053;;;;N;;;;;
+1D517;MATHEMATICAL FRAKTUR CAPITAL T;Lu;0;L; 0054;;;;N;;;;;
+1D518;MATHEMATICAL FRAKTUR CAPITAL U;Lu;0;L; 0055;;;;N;;;;;
+1D519;MATHEMATICAL FRAKTUR CAPITAL V;Lu;0;L; 0056;;;;N;;;;;
+1D51A;MATHEMATICAL FRAKTUR CAPITAL W;Lu;0;L; 0057;;;;N;;;;;
+1D51B;MATHEMATICAL FRAKTUR CAPITAL X;Lu;0;L; 0058;;;;N;;;;;
+1D51C;MATHEMATICAL FRAKTUR CAPITAL Y;Lu;0;L; 0059;;;;N;;;;;
+1D51E;MATHEMATICAL FRAKTUR SMALL A;Ll;0;L; 0061;;;;N;;;;;
+1D51F;MATHEMATICAL FRAKTUR SMALL B;Ll;0;L; 0062;;;;N;;;;;
+1D520;MATHEMATICAL FRAKTUR SMALL C;Ll;0;L; 0063;;;;N;;;;;
+1D521;MATHEMATICAL FRAKTUR SMALL D;Ll;0;L; 0064;;;;N;;;;;
+1D522;MATHEMATICAL FRAKTUR SMALL E;Ll;0;L; 0065;;;;N;;;;;
+1D523;MATHEMATICAL FRAKTUR SMALL F;Ll;0;L; 0066;;;;N;;;;;
+1D524;MATHEMATICAL FRAKTUR SMALL G;Ll;0;L; 0067;;;;N;;;;;
+1D525;MATHEMATICAL FRAKTUR SMALL H;Ll;0;L; 0068;;;;N;;;;;
+1D526;MATHEMATICAL FRAKTUR SMALL I;Ll;0;L; 0069;;;;N;;;;;
+1D527;MATHEMATICAL FRAKTUR SMALL J;Ll;0;L; 006A;;;;N;;;;;
+1D528;MATHEMATICAL FRAKTUR SMALL K;Ll;0;L; 006B;;;;N;;;;;
+1D529;MATHEMATICAL FRAKTUR SMALL L;Ll;0;L; 006C;;;;N;;;;;
+1D52A;MATHEMATICAL FRAKTUR SMALL M;Ll;0;L; 006D;;;;N;;;;;
+1D52B;MATHEMATICAL FRAKTUR SMALL N;Ll;0;L; 006E;;;;N;;;;;
+1D52C;MATHEMATICAL FRAKTUR SMALL O;Ll;0;L; 006F;;;;N;;;;;
+1D52D;MATHEMATICAL FRAKTUR SMALL P;Ll;0;L; 0070;;;;N;;;;;
+1D52E;MATHEMATICAL FRAKTUR SMALL Q;Ll;0;L; 0071;;;;N;;;;;
+1D52F;MATHEMATICAL FRAKTUR SMALL R;Ll;0;L; 0072;;;;N;;;;;
+1D530;MATHEMATICAL FRAKTUR SMALL S;Ll;0;L; 0073;;;;N;;;;;
+1D531;MATHEMATICAL FRAKTUR SMALL T;Ll;0;L; 0074;;;;N;;;;;
+1D532;MATHEMATICAL FRAKTUR SMALL U;Ll;0;L; 0075;;;;N;;;;;
+1D533;MATHEMATICAL FRAKTUR SMALL V;Ll;0;L; 0076;;;;N;;;;;
+1D534;MATHEMATICAL FRAKTUR SMALL W;Ll;0;L; 0077;;;;N;;;;;
+1D535;MATHEMATICAL FRAKTUR SMALL X;Ll;0;L; 0078;;;;N;;;;;
+1D536;MATHEMATICAL FRAKTUR SMALL Y;Ll;0;L; 0079;;;;N;;;;;
+1D537;MATHEMATICAL FRAKTUR SMALL Z;Ll;0;L; 007A;;;;N;;;;;
+1D538;MATHEMATICAL DOUBLE-STRUCK CAPITAL A;Lu;0;L; 0041;;;;N;;;;;
+1D539;MATHEMATICAL DOUBLE-STRUCK CAPITAL B;Lu;0;L; 0042;;;;N;;;;;
+1D53B;MATHEMATICAL DOUBLE-STRUCK CAPITAL D;Lu;0;L; 0044;;;;N;;;;;
+1D53C;MATHEMATICAL DOUBLE-STRUCK CAPITAL E;Lu;0;L; 0045;;;;N;;;;;
+1D53D;MATHEMATICAL DOUBLE-STRUCK CAPITAL F;Lu;0;L; 0046;;;;N;;;;;
+1D53E;MATHEMATICAL DOUBLE-STRUCK CAPITAL G;Lu;0;L; 0047;;;;N;;;;;
+1D540;MATHEMATICAL DOUBLE-STRUCK CAPITAL I;Lu;0;L; 0049;;;;N;;;;;
+1D541;MATHEMATICAL DOUBLE-STRUCK CAPITAL J;Lu;0;L; 004A;;;;N;;;;;
+1D542;MATHEMATICAL DOUBLE-STRUCK CAPITAL K;Lu;0;L; 004B;;;;N;;;;;
+1D543;MATHEMATICAL DOUBLE-STRUCK CAPITAL L;Lu;0;L; 004C;;;;N;;;;;
+1D544;MATHEMATICAL DOUBLE-STRUCK CAPITAL M;Lu;0;L; 004D;;;;N;;;;;
+1D546;MATHEMATICAL DOUBLE-STRUCK CAPITAL O;Lu;0;L; 004F;;;;N;;;;;
+1D54A;MATHEMATICAL DOUBLE-STRUCK CAPITAL S;Lu;0;L; 0053;;;;N;;;;;
+1D54B;MATHEMATICAL DOUBLE-STRUCK CAPITAL T;Lu;0;L; 0054;;;;N;;;;;
+1D54C;MATHEMATICAL DOUBLE-STRUCK CAPITAL U;Lu;0;L; 0055;;;;N;;;;;
+1D54D;MATHEMATICAL DOUBLE-STRUCK CAPITAL V;Lu;0;L; 0056;;;;N;;;;;
+1D54E;MATHEMATICAL DOUBLE-STRUCK CAPITAL W;Lu;0;L; 0057;;;;N;;;;;
+1D54F;MATHEMATICAL DOUBLE-STRUCK CAPITAL X;Lu;0;L; 0058;;;;N;;;;;
+1D550;MATHEMATICAL DOUBLE-STRUCK CAPITAL Y;Lu;0;L; 0059;;;;N;;;;;
+1D552;MATHEMATICAL DOUBLE-STRUCK SMALL A;Ll;0;L; 0061;;;;N;;;;;
+1D553;MATHEMATICAL DOUBLE-STRUCK SMALL B;Ll;0;L; 0062;;;;N;;;;;
+1D554;MATHEMATICAL DOUBLE-STRUCK SMALL C;Ll;0;L; 0063;;;;N;;;;;
+1D555;MATHEMATICAL DOUBLE-STRUCK SMALL D;Ll;0;L; 0064;;;;N;;;;;
+1D556;MATHEMATICAL DOUBLE-STRUCK SMALL E;Ll;0;L; 0065;;;;N;;;;;
+1D557;MATHEMATICAL DOUBLE-STRUCK SMALL F;Ll;0;L; 0066;;;;N;;;;;
+1D558;MATHEMATICAL DOUBLE-STRUCK SMALL G;Ll;0;L; 0067;;;;N;;;;;
+1D559;MATHEMATICAL DOUBLE-STRUCK SMALL H;Ll;0;L; 0068;;;;N;;;;;
+1D55A;MATHEMATICAL DOUBLE-STRUCK SMALL I;Ll;0;L; 0069;;;;N;;;;;
+1D55B;MATHEMATICAL DOUBLE-STRUCK SMALL J;Ll;0;L; 006A;;;;N;;;;;
+1D55C;MATHEMATICAL DOUBLE-STRUCK SMALL K;Ll;0;L; 006B;;;;N;;;;;
+1D55D;MATHEMATICAL DOUBLE-STRUCK SMALL L;Ll;0;L; 006C;;;;N;;;;;
+1D55E;MATHEMATICAL DOUBLE-STRUCK SMALL M;Ll;0;L; 006D;;;;N;;;;;
+1D55F;MATHEMATICAL DOUBLE-STRUCK SMALL N;Ll;0;L; 006E;;;;N;;;;;
+1D560;MATHEMATICAL DOUBLE-STRUCK SMALL O;Ll;0;L; 006F;;;;N;;;;;
+1D561;MATHEMATICAL DOUBLE-STRUCK SMALL P;Ll;0;L; 0070;;;;N;;;;;
+1D562;MATHEMATICAL DOUBLE-STRUCK SMALL Q;Ll;0;L; 0071;;;;N;;;;;
+1D563;MATHEMATICAL DOUBLE-STRUCK SMALL R;Ll;0;L; 0072;;;;N;;;;;
+1D564;MATHEMATICAL DOUBLE-STRUCK SMALL S;Ll;0;L; 0073;;;;N;;;;;
+1D565;MATHEMATICAL DOUBLE-STRUCK SMALL T;Ll;0;L; 0074;;;;N;;;;;
+1D566;MATHEMATICAL DOUBLE-STRUCK SMALL U;Ll;0;L; 0075;;;;N;;;;;
+1D567;MATHEMATICAL DOUBLE-STRUCK SMALL V;Ll;0;L; 0076;;;;N;;;;;
+1D568;MATHEMATICAL DOUBLE-STRUCK SMALL W;Ll;0;L; 0077;;;;N;;;;;
+1D569;MATHEMATICAL DOUBLE-STRUCK SMALL X;Ll;0;L; 0078;;;;N;;;;;
+1D56A;MATHEMATICAL DOUBLE-STRUCK SMALL Y;Ll;0;L; 0079;;;;N;;;;;
+1D56B;MATHEMATICAL DOUBLE-STRUCK SMALL Z;Ll;0;L; 007A;;;;N;;;;;
+1D56C;MATHEMATICAL BOLD FRAKTUR CAPITAL A;Lu;0;L; 0041;;;;N;;;;;
+1D56D;MATHEMATICAL BOLD FRAKTUR CAPITAL B;Lu;0;L; 0042;;;;N;;;;;
+1D56E;MATHEMATICAL BOLD FRAKTUR CAPITAL C;Lu;0;L; 0043;;;;N;;;;;
+1D56F;MATHEMATICAL BOLD FRAKTUR CAPITAL D;Lu;0;L; 0044;;;;N;;;;;
+1D570;MATHEMATICAL BOLD FRAKTUR CAPITAL E;Lu;0;L; 0045;;;;N;;;;;
+1D571;MATHEMATICAL BOLD FRAKTUR CAPITAL F;Lu;0;L; 0046;;;;N;;;;;
+1D572;MATHEMATICAL BOLD FRAKTUR CAPITAL G;Lu;0;L; 0047;;;;N;;;;;
+1D573;MATHEMATICAL BOLD FRAKTUR CAPITAL H;Lu;0;L; 0048;;;;N;;;;;
+1D574;MATHEMATICAL BOLD FRAKTUR CAPITAL I;Lu;0;L; 0049;;;;N;;;;;
+1D575;MATHEMATICAL BOLD FRAKTUR CAPITAL J;Lu;0;L; 004A;;;;N;;;;;
+1D576;MATHEMATICAL BOLD FRAKTUR CAPITAL K;Lu;0;L; 004B;;;;N;;;;;
+1D577;MATHEMATICAL BOLD FRAKTUR CAPITAL L;Lu;0;L; 004C;;;;N;;;;;
+1D578;MATHEMATICAL BOLD FRAKTUR CAPITAL M;Lu;0;L; 004D;;;;N;;;;;
+1D579;MATHEMATICAL BOLD FRAKTUR CAPITAL N;Lu;0;L; 004E;;;;N;;;;;
+1D57A;MATHEMATICAL BOLD FRAKTUR CAPITAL O;Lu;0;L; 004F;;;;N;;;;;
+1D57B;MATHEMATICAL BOLD FRAKTUR CAPITAL P;Lu;0;L; 0050;;;;N;;;;;
+1D57C;MATHEMATICAL BOLD FRAKTUR CAPITAL Q;Lu;0;L; 0051;;;;N;;;;;
+1D57D;MATHEMATICAL BOLD FRAKTUR CAPITAL R;Lu;0;L; 0052;;;;N;;;;;
+1D57E;MATHEMATICAL BOLD FRAKTUR CAPITAL S;Lu;0;L; 0053;;;;N;;;;;
+1D57F;MATHEMATICAL BOLD FRAKTUR CAPITAL T;Lu;0;L; 0054;;;;N;;;;;
+1D580;MATHEMATICAL BOLD FRAKTUR CAPITAL U;Lu;0;L; 0055;;;;N;;;;;
+1D581;MATHEMATICAL BOLD FRAKTUR CAPITAL V;Lu;0;L; 0056;;;;N;;;;;
+1D582;MATHEMATICAL BOLD FRAKTUR CAPITAL W;Lu;0;L; 0057;;;;N;;;;;
+1D583;MATHEMATICAL BOLD FRAKTUR CAPITAL X;Lu;0;L; 0058;;;;N;;;;;
+1D584;MATHEMATICAL BOLD FRAKTUR CAPITAL Y;Lu;0;L; 0059;;;;N;;;;;
+1D585;MATHEMATICAL BOLD FRAKTUR CAPITAL Z;Lu;0;L; 005A;;;;N;;;;;
+1D586;MATHEMATICAL BOLD FRAKTUR SMALL A;Ll;0;L; 0061;;;;N;;;;;
+1D587;MATHEMATICAL BOLD FRAKTUR SMALL B;Ll;0;L; 0062;;;;N;;;;;
+1D588;MATHEMATICAL BOLD FRAKTUR SMALL C;Ll;0;L; 0063;;;;N;;;;;
+1D589;MATHEMATICAL BOLD FRAKTUR SMALL D;Ll;0;L; 0064;;;;N;;;;;
+1D58A;MATHEMATICAL BOLD FRAKTUR SMALL E;Ll;0;L; 0065;;;;N;;;;;
+1D58B;MATHEMATICAL BOLD FRAKTUR SMALL F;Ll;0;L; 0066;;;;N;;;;;
+1D58C;MATHEMATICAL BOLD FRAKTUR SMALL G;Ll;0;L; 0067;;;;N;;;;;
+1D58D;MATHEMATICAL BOLD FRAKTUR SMALL H;Ll;0;L; 0068;;;;N;;;;;
+1D58E;MATHEMATICAL BOLD FRAKTUR SMALL I;Ll;0;L; 0069;;;;N;;;;;
+1D58F;MATHEMATICAL BOLD FRAKTUR SMALL J;Ll;0;L; 006A;;;;N;;;;;
+1D590;MATHEMATICAL BOLD FRAKTUR SMALL K;Ll;0;L; 006B;;;;N;;;;;
+1D591;MATHEMATICAL BOLD FRAKTUR SMALL L;Ll;0;L; 006C;;;;N;;;;;
+1D592;MATHEMATICAL BOLD FRAKTUR SMALL M;Ll;0;L; 006D;;;;N;;;;;
+1D593;MATHEMATICAL BOLD FRAKTUR SMALL N;Ll;0;L; 006E;;;;N;;;;;
+1D594;MATHEMATICAL BOLD FRAKTUR SMALL O;Ll;0;L; 006F;;;;N;;;;;
+1D595;MATHEMATICAL BOLD FRAKTUR SMALL P;Ll;0;L; 0070;;;;N;;;;;
+1D596;MATHEMATICAL BOLD FRAKTUR SMALL Q;Ll;0;L; 0071;;;;N;;;;;
+1D597;MATHEMATICAL BOLD FRAKTUR SMALL R;Ll;0;L; 0072;;;;N;;;;;
+1D598;MATHEMATICAL BOLD FRAKTUR SMALL S;Ll;0;L; 0073;;;;N;;;;;
+1D599;MATHEMATICAL BOLD FRAKTUR SMALL T;Ll;0;L; 0074;;;;N;;;;;
+1D59A;MATHEMATICAL BOLD FRAKTUR SMALL U;Ll;0;L; 0075;;;;N;;;;;
+1D59B;MATHEMATICAL BOLD FRAKTUR SMALL V;Ll;0;L; 0076;;;;N;;;;;
+1D59C;MATHEMATICAL BOLD FRAKTUR SMALL W;Ll;0;L; 0077;;;;N;;;;;
+1D59D;MATHEMATICAL BOLD FRAKTUR SMALL X;Ll;0;L; 0078;;;;N;;;;;
+1D59E;MATHEMATICAL BOLD FRAKTUR SMALL Y;Ll;0;L; 0079;;;;N;;;;;
+1D59F;MATHEMATICAL BOLD FRAKTUR SMALL Z;Ll;0;L; 007A;;;;N;;;;;
+1D5A0;MATHEMATICAL SANS-SERIF CAPITAL A;Lu;0;L; 0041;;;;N;;;;;
+1D5A1;MATHEMATICAL SANS-SERIF CAPITAL B;Lu;0;L; 0042;;;;N;;;;;
+1D5A2;MATHEMATICAL SANS-SERIF CAPITAL C;Lu;0;L; 0043;;;;N;;;;;
+1D5A3;MATHEMATICAL SANS-SERIF CAPITAL D;Lu;0;L; 0044;;;;N;;;;;
+1D5A4;MATHEMATICAL SANS-SERIF CAPITAL E;Lu;0;L; 0045;;;;N;;;;;
+1D5A5;MATHEMATICAL SANS-SERIF CAPITAL F;Lu;0;L; 0046;;;;N;;;;;
+1D5A6;MATHEMATICAL SANS-SERIF CAPITAL G;Lu;0;L; 0047;;;;N;;;;;
+1D5A7;MATHEMATICAL SANS-SERIF CAPITAL H;Lu;0;L; 0048;;;;N;;;;;
+1D5A8;MATHEMATICAL SANS-SERIF CAPITAL I;Lu;0;L; 0049;;;;N;;;;;
+1D5A9;MATHEMATICAL SANS-SERIF CAPITAL J;Lu;0;L; 004A;;;;N;;;;;
+1D5AA;MATHEMATICAL SANS-SERIF CAPITAL K;Lu;0;L; 004B;;;;N;;;;;
+1D5AB;MATHEMATICAL SANS-SERIF CAPITAL L;Lu;0;L; 004C;;;;N;;;;;
+1D5AC;MATHEMATICAL SANS-SERIF CAPITAL M;Lu;0;L; 004D;;;;N;;;;;
+1D5AD;MATHEMATICAL SANS-SERIF CAPITAL N;Lu;0;L; 004E;;;;N;;;;;
+1D5AE;MATHEMATICAL SANS-SERIF CAPITAL O;Lu;0;L; 004F;;;;N;;;;;
+1D5AF;MATHEMATICAL SANS-SERIF CAPITAL P;Lu;0;L; 0050;;;;N;;;;;
+1D5B0;MATHEMATICAL SANS-SERIF CAPITAL Q;Lu;0;L; 0051;;;;N;;;;;
+1D5B1;MATHEMATICAL SANS-SERIF CAPITAL R;Lu;0;L; 0052;;;;N;;;;;
+1D5B2;MATHEMATICAL SANS-SERIF CAPITAL S;Lu;0;L; 0053;;;;N;;;;;
+1D5B3;MATHEMATICAL SANS-SERIF CAPITAL T;Lu;0;L; 0054;;;;N;;;;;
+1D5B4;MATHEMATICAL SANS-SERIF CAPITAL U;Lu;0;L; 0055;;;;N;;;;;
+1D5B5;MATHEMATICAL SANS-SERIF CAPITAL V;Lu;0;L; 0056;;;;N;;;;;
+1D5B6;MATHEMATICAL SANS-SERIF CAPITAL W;Lu;0;L; 0057;;;;N;;;;;
+1D5B7;MATHEMATICAL SANS-SERIF CAPITAL X;Lu;0;L; 0058;;;;N;;;;;
+1D5B8;MATHEMATICAL SANS-SERIF CAPITAL Y;Lu;0;L; 0059;;;;N;;;;;
+1D5B9;MATHEMATICAL SANS-SERIF CAPITAL Z;Lu;0;L; 005A;;;;N;;;;;
+1D5BA;MATHEMATICAL SANS-SERIF SMALL A;Ll;0;L; 0061;;;;N;;;;;
+1D5BB;MATHEMATICAL SANS-SERIF SMALL B;Ll;0;L; 0062;;;;N;;;;;
+1D5BC;MATHEMATICAL SANS-SERIF SMALL C;Ll;0;L; 0063;;;;N;;;;;
+1D5BD;MATHEMATICAL SANS-SERIF SMALL D;Ll;0;L; 0064;;;;N;;;;;
+1D5BE;MATHEMATICAL SANS-SERIF SMALL E;Ll;0;L; 0065;;;;N;;;;;
+1D5BF;MATHEMATICAL SANS-SERIF SMALL F;Ll;0;L; 0066;;;;N;;;;;
+1D5C0;MATHEMATICAL SANS-SERIF SMALL G;Ll;0;L; 0067;;;;N;;;;;
+1D5C1;MATHEMATICAL SANS-SERIF SMALL H;Ll;0;L; 0068;;;;N;;;;;
+1D5C2;MATHEMATICAL SANS-SERIF SMALL I;Ll;0;L; 0069;;;;N;;;;;
+1D5C3;MATHEMATICAL SANS-SERIF SMALL J;Ll;0;L; 006A;;;;N;;;;;
+1D5C4;MATHEMATICAL SANS-SERIF SMALL K;Ll;0;L; 006B;;;;N;;;;;
+1D5C5;MATHEMATICAL SANS-SERIF SMALL L;Ll;0;L; 006C;;;;N;;;;;
+1D5C6;MATHEMATICAL SANS-SERIF SMALL M;Ll;0;L; 006D;;;;N;;;;;
+1D5C7;MATHEMATICAL SANS-SERIF SMALL N;Ll;0;L; 006E;;;;N;;;;;
+1D5C8;MATHEMATICAL SANS-SERIF SMALL O;Ll;0;L; 006F;;;;N;;;;;
+1D5C9;MATHEMATICAL SANS-SERIF SMALL P;Ll;0;L; 0070;;;;N;;;;;
+1D5CA;MATHEMATICAL SANS-SERIF SMALL Q;Ll;0;L; 0071;;;;N;;;;;
+1D5CB;MATHEMATICAL SANS-SERIF SMALL R;Ll;0;L; 0072;;;;N;;;;;
+1D5CC;MATHEMATICAL SANS-SERIF SMALL S;Ll;0;L; 0073;;;;N;;;;;
+1D5CD;MATHEMATICAL SANS-SERIF SMALL T;Ll;0;L; 0074;;;;N;;;;;
+1D5CE;MATHEMATICAL SANS-SERIF SMALL U;Ll;0;L; 0075;;;;N;;;;;
+1D5CF;MATHEMATICAL SANS-SERIF SMALL V;Ll;0;L; 0076;;;;N;;;;;
+1D5D0;MATHEMATICAL SANS-SERIF SMALL W;Ll;0;L; 0077;;;;N;;;;;
+1D5D1;MATHEMATICAL SANS-SERIF SMALL X;Ll;0;L; 0078;;;;N;;;;;
+1D5D2;MATHEMATICAL SANS-SERIF SMALL Y;Ll;0;L; 0079;;;;N;;;;;
+1D5D3;MATHEMATICAL SANS-SERIF SMALL Z;Ll;0;L; 007A;;;;N;;;;;
+1D5D4;MATHEMATICAL SANS-SERIF BOLD CAPITAL A;Lu;0;L; 0041;;;;N;;;;;
+1D5D5;MATHEMATICAL SANS-SERIF BOLD CAPITAL B;Lu;0;L; 0042;;;;N;;;;;
+1D5D6;MATHEMATICAL SANS-SERIF BOLD CAPITAL C;Lu;0;L; 0043;;;;N;;;;;
+1D5D7;MATHEMATICAL SANS-SERIF BOLD CAPITAL D;Lu;0;L; 0044;;;;N;;;;;
+1D5D8;MATHEMATICAL SANS-SERIF BOLD CAPITAL E;Lu;0;L; 0045;;;;N;;;;;
+1D5D9;MATHEMATICAL SANS-SERIF BOLD CAPITAL F;Lu;0;L; 0046;;;;N;;;;;
+1D5DA;MATHEMATICAL SANS-SERIF BOLD CAPITAL G;Lu;0;L; 0047;;;;N;;;;;
+1D5DB;MATHEMATICAL SANS-SERIF BOLD CAPITAL H;Lu;0;L; 0048;;;;N;;;;;
+1D5DC;MATHEMATICAL SANS-SERIF BOLD CAPITAL I;Lu;0;L; 0049;;;;N;;;;;
+1D5DD;MATHEMATICAL SANS-SERIF BOLD CAPITAL J;Lu;0;L; 004A;;;;N;;;;;
+1D5DE;MATHEMATICAL SANS-SERIF BOLD CAPITAL K;Lu;0;L; 004B;;;;N;;;;;
+1D5DF;MATHEMATICAL SANS-SERIF BOLD CAPITAL L;Lu;0;L; 004C;;;;N;;;;;
+1D5E0;MATHEMATICAL SANS-SERIF BOLD CAPITAL M;Lu;0;L; 004D;;;;N;;;;;
+1D5E1;MATHEMATICAL SANS-SERIF BOLD CAPITAL N;Lu;0;L; 004E;;;;N;;;;;
+1D5E2;MATHEMATICAL SANS-SERIF BOLD CAPITAL O;Lu;0;L; 004F;;;;N;;;;;
+1D5E3;MATHEMATICAL SANS-SERIF BOLD CAPITAL P;Lu;0;L; 0050;;;;N;;;;;
+1D5E4;MATHEMATICAL SANS-SERIF BOLD CAPITAL Q;Lu;0;L; 0051;;;;N;;;;;
+1D5E5;MATHEMATICAL SANS-SERIF BOLD CAPITAL R;Lu;0;L; 0052;;;;N;;;;;
+1D5E6;MATHEMATICAL SANS-SERIF BOLD CAPITAL S;Lu;0;L; 0053;;;;N;;;;;
+1D5E7;MATHEMATICAL SANS-SERIF BOLD CAPITAL T;Lu;0;L; 0054;;;;N;;;;;
+1D5E8;MATHEMATICAL SANS-SERIF BOLD CAPITAL U;Lu;0;L; 0055;;;;N;;;;;
+1D5E9;MATHEMATICAL SANS-SERIF BOLD CAPITAL V;Lu;0;L; 0056;;;;N;;;;;
+1D5EA;MATHEMATICAL SANS-SERIF BOLD CAPITAL W;Lu;0;L; 0057;;;;N;;;;;
+1D5EB;MATHEMATICAL SANS-SERIF BOLD CAPITAL X;Lu;0;L; 0058;;;;N;;;;;
+1D5EC;MATHEMATICAL SANS-SERIF BOLD CAPITAL Y;Lu;0;L; 0059;;;;N;;;;;
+1D5ED;MATHEMATICAL SANS-SERIF BOLD CAPITAL Z;Lu;0;L; 005A;;;;N;;;;;
+1D5EE;MATHEMATICAL SANS-SERIF BOLD SMALL A;Ll;0;L; 0061;;;;N;;;;;
+1D5EF;MATHEMATICAL SANS-SERIF BOLD SMALL B;Ll;0;L; 0062;;;;N;;;;;
+1D5F0;MATHEMATICAL SANS-SERIF BOLD SMALL C;Ll;0;L; 0063;;;;N;;;;;
+1D5F1;MATHEMATICAL SANS-SERIF BOLD SMALL D;Ll;0;L; 0064;;;;N;;;;;
+1D5F2;MATHEMATICAL SANS-SERIF BOLD SMALL E;Ll;0;L; 0065;;;;N;;;;;
+1D5F3;MATHEMATICAL SANS-SERIF BOLD SMALL F;Ll;0;L; 0066;;;;N;;;;;
+1D5F4;MATHEMATICAL SANS-SERIF BOLD SMALL G;Ll;0;L; 0067;;;;N;;;;;
+1D5F5;MATHEMATICAL SANS-SERIF BOLD SMALL H;Ll;0;L; 0068;;;;N;;;;;
+1D5F6;MATHEMATICAL SANS-SERIF BOLD SMALL I;Ll;0;L; 0069;;;;N;;;;;
+1D5F7;MATHEMATICAL SANS-SERIF BOLD SMALL J;Ll;0;L; 006A;;;;N;;;;;
+1D5F8;MATHEMATICAL SANS-SERIF BOLD SMALL K;Ll;0;L; 006B;;;;N;;;;;
+1D5F9;MATHEMATICAL SANS-SERIF BOLD SMALL L;Ll;0;L; 006C;;;;N;;;;;
+1D5FA;MATHEMATICAL SANS-SERIF BOLD SMALL M;Ll;0;L; 006D;;;;N;;;;;
+1D5FB;MATHEMATICAL SANS-SERIF BOLD SMALL N;Ll;0;L; 006E;;;;N;;;;;
+1D5FC;MATHEMATICAL SANS-SERIF BOLD SMALL O;Ll;0;L; 006F;;;;N;;;;;
+1D5FD;MATHEMATICAL SANS-SERIF BOLD SMALL P;Ll;0;L; 0070;;;;N;;;;;
+1D5FE;MATHEMATICAL SANS-SERIF BOLD SMALL Q;Ll;0;L; 0071;;;;N;;;;;
+1D5FF;MATHEMATICAL SANS-SERIF BOLD SMALL R;Ll;0;L; 0072;;;;N;;;;;
+1D600;MATHEMATICAL SANS-SERIF BOLD SMALL S;Ll;0;L; 0073;;;;N;;;;;
+1D601;MATHEMATICAL SANS-SERIF BOLD SMALL T;Ll;0;L; 0074;;;;N;;;;;
+1D602;MATHEMATICAL SANS-SERIF BOLD SMALL U;Ll;0;L; 0075;;;;N;;;;;
+1D603;MATHEMATICAL SANS-SERIF BOLD SMALL V;Ll;0;L; 0076;;;;N;;;;;
+1D604;MATHEMATICAL SANS-SERIF BOLD SMALL W;Ll;0;L; 0077;;;;N;;;;;
+1D605;MATHEMATICAL SANS-SERIF BOLD SMALL X;Ll;0;L; 0078;;;;N;;;;;
+1D606;MATHEMATICAL SANS-SERIF BOLD SMALL Y;Ll;0;L; 0079;;;;N;;;;;
+1D607;MATHEMATICAL SANS-SERIF BOLD SMALL Z;Ll;0;L; 007A;;;;N;;;;;
+1D608;MATHEMATICAL SANS-SERIF ITALIC CAPITAL A;Lu;0;L; 0041;;;;N;;;;;
+1D609;MATHEMATICAL SANS-SERIF ITALIC CAPITAL B;Lu;0;L; 0042;;;;N;;;;;
+1D60A;MATHEMATICAL SANS-SERIF ITALIC CAPITAL C;Lu;0;L; 0043;;;;N;;;;;
+1D60B;MATHEMATICAL SANS-SERIF ITALIC CAPITAL D;Lu;0;L; 0044;;;;N;;;;;
+1D60C;MATHEMATICAL SANS-SERIF ITALIC CAPITAL E;Lu;0;L; 0045;;;;N;;;;;
+1D60D;MATHEMATICAL SANS-SERIF ITALIC CAPITAL F;Lu;0;L; 0046;;;;N;;;;;
+1D60E;MATHEMATICAL SANS-SERIF ITALIC CAPITAL G;Lu;0;L; 0047;;;;N;;;;;
+1D60F;MATHEMATICAL SANS-SERIF ITALIC CAPITAL H;Lu;0;L; 0048;;;;N;;;;;
+1D610;MATHEMATICAL SANS-SERIF ITALIC CAPITAL I;Lu;0;L; 0049;;;;N;;;;;
+1D611;MATHEMATICAL SANS-SERIF ITALIC CAPITAL J;Lu;0;L; 004A;;;;N;;;;;
+1D612;MATHEMATICAL SANS-SERIF ITALIC CAPITAL K;Lu;0;L; 004B;;;;N;;;;;
+1D613;MATHEMATICAL SANS-SERIF ITALIC CAPITAL L;Lu;0;L; 004C;;;;N;;;;;
+1D614;MATHEMATICAL SANS-SERIF ITALIC CAPITAL M;Lu;0;L; 004D;;;;N;;;;;
+1D615;MATHEMATICAL SANS-SERIF ITALIC CAPITAL N;Lu;0;L; 004E;;;;N;;;;;
+1D616;MATHEMATICAL SANS-SERIF ITALIC CAPITAL O;Lu;0;L; 004F;;;;N;;;;;
+1D617;MATHEMATICAL SANS-SERIF ITALIC CAPITAL P;Lu;0;L; 0050;;;;N;;;;;
+1D618;MATHEMATICAL SANS-SERIF ITALIC CAPITAL Q;Lu;0;L; 0051;;;;N;;;;;
+1D619;MATHEMATICAL SANS-SERIF ITALIC CAPITAL R;Lu;0;L; 0052;;;;N;;;;;
+1D61A;MATHEMATICAL SANS-SERIF ITALIC CAPITAL S;Lu;0;L; 0053;;;;N;;;;;
+1D61B;MATHEMATICAL SANS-SERIF ITALIC CAPITAL T;Lu;0;L; 0054;;;;N;;;;;
+1D61C;MATHEMATICAL SANS-SERIF ITALIC CAPITAL U;Lu;0;L; 0055;;;;N;;;;;
+1D61D;MATHEMATICAL SANS-SERIF ITALIC CAPITAL V;Lu;0;L; 0056;;;;N;;;;;
+1D61E;MATHEMATICAL SANS-SERIF ITALIC CAPITAL W;Lu;0;L; 0057;;;;N;;;;;
+1D61F;MATHEMATICAL SANS-SERIF ITALIC CAPITAL X;Lu;0;L; 0058;;;;N;;;;;
+1D620;MATHEMATICAL SANS-SERIF ITALIC CAPITAL Y;Lu;0;L; 0059;;;;N;;;;;
+1D621;MATHEMATICAL SANS-SERIF ITALIC CAPITAL Z;Lu;0;L; 005A;;;;N;;;;;
+1D622;MATHEMATICAL SANS-SERIF ITALIC SMALL A;Ll;0;L; 0061;;;;N;;;;;
+1D623;MATHEMATICAL SANS-SERIF ITALIC SMALL B;Ll;0;L; 0062;;;;N;;;;;
+1D624;MATHEMATICAL SANS-SERIF ITALIC SMALL C;Ll;0;L; 0063;;;;N;;;;;
+1D625;MATHEMATICAL SANS-SERIF ITALIC SMALL D;Ll;0;L; 0064;;;;N;;;;;
+1D626;MATHEMATICAL SANS-SERIF ITALIC SMALL E;Ll;0;L; 0065;;;;N;;;;;
+1D627;MATHEMATICAL SANS-SERIF ITALIC SMALL F;Ll;0;L; 0066;;;;N;;;;;
+1D628;MATHEMATICAL SANS-SERIF ITALIC SMALL G;Ll;0;L; 0067;;;;N;;;;;
+1D629;MATHEMATICAL SANS-SERIF ITALIC SMALL H;Ll;0;L; 0068;;;;N;;;;;
+1D62A;MATHEMATICAL SANS-SERIF ITALIC SMALL I;Ll;0;L; 0069;;;;N;;;;;
+1D62B;MATHEMATICAL SANS-SERIF ITALIC SMALL J;Ll;0;L; 006A;;;;N;;;;;
+1D62C;MATHEMATICAL SANS-SERIF ITALIC SMALL K;Ll;0;L; 006B;;;;N;;;;;
+1D62D;MATHEMATICAL SANS-SERIF ITALIC SMALL L;Ll;0;L; 006C;;;;N;;;;;
+1D62E;MATHEMATICAL SANS-SERIF ITALIC SMALL M;Ll;0;L; 006D;;;;N;;;;;
+1D62F;MATHEMATICAL SANS-SERIF ITALIC SMALL N;Ll;0;L; 006E;;;;N;;;;;
+1D630;MATHEMATICAL SANS-SERIF ITALIC SMALL O;Ll;0;L; 006F;;;;N;;;;;
+1D631;MATHEMATICAL SANS-SERIF ITALIC SMALL P;Ll;0;L; 0070;;;;N;;;;;
+1D632;MATHEMATICAL SANS-SERIF ITALIC SMALL Q;Ll;0;L; 0071;;;;N;;;;;
+1D633;MATHEMATICAL SANS-SERIF ITALIC SMALL R;Ll;0;L; 0072;;;;N;;;;;
+1D634;MATHEMATICAL SANS-SERIF ITALIC SMALL S;Ll;0;L; 0073;;;;N;;;;;
+1D635;MATHEMATICAL SANS-SERIF ITALIC SMALL T;Ll;0;L; 0074;;;;N;;;;;
+1D636;MATHEMATICAL SANS-SERIF ITALIC SMALL U;Ll;0;L; 0075;;;;N;;;;;
+1D637;MATHEMATICAL SANS-SERIF ITALIC SMALL V;Ll;0;L; 0076;;;;N;;;;;
+1D638;MATHEMATICAL SANS-SERIF ITALIC SMALL W;Ll;0;L; 0077;;;;N;;;;;
+1D639;MATHEMATICAL SANS-SERIF ITALIC SMALL X;Ll;0;L; 0078;;;;N;;;;;
+1D63A;MATHEMATICAL SANS-SERIF ITALIC SMALL Y;Ll;0;L; 0079;;;;N;;;;;
+1D63B;MATHEMATICAL SANS-SERIF ITALIC SMALL Z;Ll;0;L; 007A;;;;N;;;;;
+1D63C;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL A;Lu;0;L; 0041;;;;N;;;;;
+1D63D;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL B;Lu;0;L; 0042;;;;N;;;;;
+1D63E;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL C;Lu;0;L; 0043;;;;N;;;;;
+1D63F;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL D;Lu;0;L; 0044;;;;N;;;;;
+1D640;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL E;Lu;0;L; 0045;;;;N;;;;;
+1D641;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL F;Lu;0;L; 0046;;;;N;;;;;
+1D642;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL G;Lu;0;L; 0047;;;;N;;;;;
+1D643;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL H;Lu;0;L; 0048;;;;N;;;;;
+1D644;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL I;Lu;0;L; 0049;;;;N;;;;;
+1D645;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL J;Lu;0;L; 004A;;;;N;;;;;
+1D646;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL K;Lu;0;L; 004B;;;;N;;;;;
+1D647;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL L;Lu;0;L; 004C;;;;N;;;;;
+1D648;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL M;Lu;0;L; 004D;;;;N;;;;;
+1D649;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL N;Lu;0;L; 004E;;;;N;;;;;
+1D64A;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL O;Lu;0;L; 004F;;;;N;;;;;
+1D64B;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL P;Lu;0;L; 0050;;;;N;;;;;
+1D64C;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL Q;Lu;0;L; 0051;;;;N;;;;;
+1D64D;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL R;Lu;0;L; 0052;;;;N;;;;;
+1D64E;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL S;Lu;0;L; 0053;;;;N;;;;;
+1D64F;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL T;Lu;0;L; 0054;;;;N;;;;;
+1D650;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL U;Lu;0;L; 0055;;;;N;;;;;
+1D651;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL V;Lu;0;L; 0056;;;;N;;;;;
+1D652;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL W;Lu;0;L; 0057;;;;N;;;;;
+1D653;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL X;Lu;0;L; 0058;;;;N;;;;;
+1D654;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL Y;Lu;0;L; 0059;;;;N;;;;;
+1D655;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL Z;Lu;0;L; 005A;;;;N;;;;;
+1D656;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL A;Ll;0;L; 0061;;;;N;;;;;
+1D657;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL B;Ll;0;L; 0062;;;;N;;;;;
+1D658;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL C;Ll;0;L; 0063;;;;N;;;;;
+1D659;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL D;Ll;0;L; 0064;;;;N;;;;;
+1D65A;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL E;Ll;0;L; 0065;;;;N;;;;;
+1D65B;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL F;Ll;0;L; 0066;;;;N;;;;;
+1D65C;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL G;Ll;0;L; 0067;;;;N;;;;;
+1D65D;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL H;Ll;0;L; 0068;;;;N;;;;;
+1D65E;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL I;Ll;0;L; 0069;;;;N;;;;;
+1D65F;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL J;Ll;0;L; 006A;;;;N;;;;;
+1D660;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL K;Ll;0;L; 006B;;;;N;;;;;
+1D661;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL L;Ll;0;L; 006C;;;;N;;;;;
+1D662;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL M;Ll;0;L; 006D;;;;N;;;;;
+1D663;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL N;Ll;0;L; 006E;;;;N;;;;;
+1D664;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL O;Ll;0;L; 006F;;;;N;;;;;
+1D665;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL P;Ll;0;L; 0070;;;;N;;;;;
+1D666;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL Q;Ll;0;L; 0071;;;;N;;;;;
+1D667;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL R;Ll;0;L; 0072;;;;N;;;;;
+1D668;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL S;Ll;0;L; 0073;;;;N;;;;;
+1D669;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL T;Ll;0;L; 0074;;;;N;;;;;
+1D66A;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL U;Ll;0;L; 0075;;;;N;;;;;
+1D66B;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL V;Ll;0;L; 0076;;;;N;;;;;
+1D66C;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL W;Ll;0;L; 0077;;;;N;;;;;
+1D66D;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL X;Ll;0;L; 0078;;;;N;;;;;
+1D66E;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL Y;Ll;0;L; 0079;;;;N;;;;;
+1D66F;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL Z;Ll;0;L; 007A;;;;N;;;;;
+1D670;MATHEMATICAL MONOSPACE CAPITAL A;Lu;0;L; 0041;;;;N;;;;;
+1D671;MATHEMATICAL MONOSPACE CAPITAL B;Lu;0;L; 0042;;;;N;;;;;
+1D672;MATHEMATICAL MONOSPACE CAPITAL C;Lu;0;L; 0043;;;;N;;;;;
+1D673;MATHEMATICAL MONOSPACE CAPITAL D;Lu;0;L; 0044;;;;N;;;;;
+1D674;MATHEMATICAL MONOSPACE CAPITAL E;Lu;0;L; 0045;;;;N;;;;;
+1D675;MATHEMATICAL MONOSPACE CAPITAL F;Lu;0;L; 0046;;;;N;;;;;
+1D676;MATHEMATICAL MONOSPACE CAPITAL G;Lu;0;L; 0047;;;;N;;;;;
+1D677;MATHEMATICAL MONOSPACE CAPITAL H;Lu;0;L; 0048;;;;N;;;;;
+1D678;MATHEMATICAL MONOSPACE CAPITAL I;Lu;0;L; 0049;;;;N;;;;;
+1D679;MATHEMATICAL MONOSPACE CAPITAL J;Lu;0;L; 004A;;;;N;;;;;
+1D67A;MATHEMATICAL MONOSPACE CAPITAL K;Lu;0;L; 004B;;;;N;;;;;
+1D67B;MATHEMATICAL MONOSPACE CAPITAL L;Lu;0;L; 004C;;;;N;;;;;
+1D67C;MATHEMATICAL MONOSPACE CAPITAL M;Lu;0;L; 004D;;;;N;;;;;
+1D67D;MATHEMATICAL MONOSPACE CAPITAL N;Lu;0;L; 004E;;;;N;;;;;
+1D67E;MATHEMATICAL MONOSPACE CAPITAL O;Lu;0;L; 004F;;;;N;;;;;
+1D67F;MATHEMATICAL MONOSPACE CAPITAL P;Lu;0;L; 0050;;;;N;;;;;
+1D680;MATHEMATICAL MONOSPACE CAPITAL Q;Lu;0;L; 0051;;;;N;;;;;
+1D681;MATHEMATICAL MONOSPACE CAPITAL R;Lu;0;L; 0052;;;;N;;;;;
+1D682;MATHEMATICAL MONOSPACE CAPITAL S;Lu;0;L; 0053;;;;N;;;;;
+1D683;MATHEMATICAL MONOSPACE CAPITAL T;Lu;0;L; 0054;;;;N;;;;;
+1D684;MATHEMATICAL MONOSPACE CAPITAL U;Lu;0;L; 0055;;;;N;;;;;
+1D685;MATHEMATICAL MONOSPACE CAPITAL V;Lu;0;L; 0056;;;;N;;;;;
+1D686;MATHEMATICAL MONOSPACE CAPITAL W;Lu;0;L; 0057;;;;N;;;;;
+1D687;MATHEMATICAL MONOSPACE CAPITAL X;Lu;0;L; 0058;;;;N;;;;;
+1D688;MATHEMATICAL MONOSPACE CAPITAL Y;Lu;0;L; 0059;;;;N;;;;;
+1D689;MATHEMATICAL MONOSPACE CAPITAL Z;Lu;0;L; 005A;;;;N;;;;;
+1D68A;MATHEMATICAL MONOSPACE SMALL A;Ll;0;L; 0061;;;;N;;;;;
+1D68B;MATHEMATICAL MONOSPACE SMALL B;Ll;0;L; 0062;;;;N;;;;;
+1D68C;MATHEMATICAL MONOSPACE SMALL C;Ll;0;L; 0063;;;;N;;;;;
+1D68D;MATHEMATICAL MONOSPACE SMALL D;Ll;0;L; 0064;;;;N;;;;;
+1D68E;MATHEMATICAL MONOSPACE SMALL E;Ll;0;L; 0065;;;;N;;;;;
+1D68F;MATHEMATICAL MONOSPACE SMALL F;Ll;0;L; 0066;;;;N;;;;;
+1D690;MATHEMATICAL MONOSPACE SMALL G;Ll;0;L; 0067;;;;N;;;;;
+1D691;MATHEMATICAL MONOSPACE SMALL H;Ll;0;L; 0068;;;;N;;;;;
+1D692;MATHEMATICAL MONOSPACE SMALL I;Ll;0;L; 0069;;;;N;;;;;
+1D693;MATHEMATICAL MONOSPACE SMALL J;Ll;0;L; 006A;;;;N;;;;;
+1D694;MATHEMATICAL MONOSPACE SMALL K;Ll;0;L; 006B;;;;N;;;;;
+1D695;MATHEMATICAL MONOSPACE SMALL L;Ll;0;L; 006C;;;;N;;;;;
+1D696;MATHEMATICAL MONOSPACE SMALL M;Ll;0;L; 006D;;;;N;;;;;
+1D697;MATHEMATICAL MONOSPACE SMALL N;Ll;0;L; 006E;;;;N;;;;;
+1D698;MATHEMATICAL MONOSPACE SMALL O;Ll;0;L; 006F;;;;N;;;;;
+1D699;MATHEMATICAL MONOSPACE SMALL P;Ll;0;L; 0070;;;;N;;;;;
+1D69A;MATHEMATICAL MONOSPACE SMALL Q;Ll;0;L; 0071;;;;N;;;;;
+1D69B;MATHEMATICAL MONOSPACE SMALL R;Ll;0;L; 0072;;;;N;;;;;
+1D69C;MATHEMATICAL MONOSPACE SMALL S;Ll;0;L; 0073;;;;N;;;;;
+1D69D;MATHEMATICAL MONOSPACE SMALL T;Ll;0;L; 0074;;;;N;;;;;
+1D69E;MATHEMATICAL MONOSPACE SMALL U;Ll;0;L; 0075;;;;N;;;;;
+1D69F;MATHEMATICAL MONOSPACE SMALL V;Ll;0;L; 0076;;;;N;;;;;
+1D6A0;MATHEMATICAL MONOSPACE SMALL W;Ll;0;L; 0077;;;;N;;;;;
+1D6A1;MATHEMATICAL MONOSPACE SMALL X;Ll;0;L; 0078;;;;N;;;;;
+1D6A2;MATHEMATICAL MONOSPACE SMALL Y;Ll;0;L; 0079;;;;N;;;;;
+1D6A3;MATHEMATICAL MONOSPACE SMALL Z;Ll;0;L; 007A;;;;N;;;;;
+1D6A4;MATHEMATICAL ITALIC SMALL DOTLESS I;Ll;0;L; 0131;;;;N;;;;;
+1D6A5;MATHEMATICAL ITALIC SMALL DOTLESS J;Ll;0;L; 0237;;;;N;;;;;
+1D6A8;MATHEMATICAL BOLD CAPITAL ALPHA;Lu;0;L; 0391;;;;N;;;;;
+1D6A9;MATHEMATICAL BOLD CAPITAL BETA;Lu;0;L; 0392;;;;N;;;;;
+1D6AA;MATHEMATICAL BOLD CAPITAL GAMMA;Lu;0;L; 0393;;;;N;;;;;
+1D6AB;MATHEMATICAL BOLD CAPITAL DELTA;Lu;0;L; 0394;;;;N;;;;;
+1D6AC;MATHEMATICAL BOLD CAPITAL EPSILON;Lu;0;L; 0395;;;;N;;;;;
+1D6AD;MATHEMATICAL BOLD CAPITAL ZETA;Lu;0;L; 0396;;;;N;;;;;
+1D6AE;MATHEMATICAL BOLD CAPITAL ETA;Lu;0;L; 0397;;;;N;;;;;
+1D6AF;MATHEMATICAL BOLD CAPITAL THETA;Lu;0;L; 0398;;;;N;;;;;
+1D6B0;MATHEMATICAL BOLD CAPITAL IOTA;Lu;0;L; 0399;;;;N;;;;;
+1D6B1;MATHEMATICAL BOLD CAPITAL KAPPA;Lu;0;L; 039A;;;;N;;;;;
+1D6B2;MATHEMATICAL BOLD CAPITAL LAMDA;Lu;0;L; 039B;;;;N;;;;;
+1D6B3;MATHEMATICAL BOLD CAPITAL MU;Lu;0;L; 039C;;;;N;;;;;
+1D6B4;MATHEMATICAL BOLD CAPITAL NU;Lu;0;L; 039D;;;;N;;;;;
+1D6B5;MATHEMATICAL BOLD CAPITAL XI;Lu;0;L; 039E;;;;N;;;;;
+1D6B6;MATHEMATICAL BOLD CAPITAL OMICRON;Lu;0;L; 039F;;;;N;;;;;
+1D6B7;MATHEMATICAL BOLD CAPITAL PI;Lu;0;L; 03A0;;;;N;;;;;
+1D6B8;MATHEMATICAL BOLD CAPITAL RHO;Lu;0;L; 03A1;;;;N;;;;;
+1D6B9;MATHEMATICAL BOLD CAPITAL THETA SYMBOL;Lu;0;L; 03F4;;;;N;;;;;
+1D6BA;MATHEMATICAL BOLD CAPITAL SIGMA;Lu;0;L; 03A3;;;;N;;;;;
+1D6BB;MATHEMATICAL BOLD CAPITAL TAU;Lu;0;L; 03A4;;;;N;;;;;
+1D6BC;MATHEMATICAL BOLD CAPITAL UPSILON;Lu;0;L; 03A5;;;;N;;;;;
+1D6BD;MATHEMATICAL BOLD CAPITAL PHI;Lu;0;L; 03A6;;;;N;;;;;
+1D6BE;MATHEMATICAL BOLD CAPITAL CHI;Lu;0;L; 03A7;;;;N;;;;;
+1D6BF;MATHEMATICAL BOLD CAPITAL PSI;Lu;0;L; 03A8;;;;N;;;;;
+1D6C0;MATHEMATICAL BOLD CAPITAL OMEGA;Lu;0;L; 03A9;;;;N;;;;;
+1D6C1;MATHEMATICAL BOLD NABLA;Sm;0;L; 2207;;;;N;;;;;
+1D6C2;MATHEMATICAL BOLD SMALL ALPHA;Ll;0;L; 03B1;;;;N;;;;;
+1D6C3;MATHEMATICAL BOLD SMALL BETA;Ll;0;L; 03B2;;;;N;;;;;
+1D6C4;MATHEMATICAL BOLD SMALL GAMMA;Ll;0;L; 03B3;;;;N;;;;;
+1D6C5;MATHEMATICAL BOLD SMALL DELTA;Ll;0;L; 03B4;;;;N;;;;;
+1D6C6;MATHEMATICAL BOLD SMALL EPSILON;Ll;0;L; 03B5;;;;N;;;;;
+1D6C7;MATHEMATICAL BOLD SMALL ZETA;Ll;0;L; 03B6;;;;N;;;;;
+1D6C8;MATHEMATICAL BOLD SMALL ETA;Ll;0;L; 03B7;;;;N;;;;;
+1D6C9;MATHEMATICAL BOLD SMALL THETA;Ll;0;L; 03B8;;;;N;;;;;
+1D6CA;MATHEMATICAL BOLD SMALL IOTA;Ll;0;L; 03B9;;;;N;;;;;
+1D6CB;MATHEMATICAL BOLD SMALL KAPPA;Ll;0;L; 03BA;;;;N;;;;;
+1D6CC;MATHEMATICAL BOLD SMALL LAMDA;Ll;0;L; 03BB;;;;N;;;;;
+1D6CD;MATHEMATICAL BOLD SMALL MU;Ll;0;L; 03BC;;;;N;;;;;
+1D6CE;MATHEMATICAL BOLD SMALL NU;Ll;0;L; 03BD;;;;N;;;;;
+1D6CF;MATHEMATICAL BOLD SMALL XI;Ll;0;L; 03BE;;;;N;;;;;
+1D6D0;MATHEMATICAL BOLD SMALL OMICRON;Ll;0;L; 03BF;;;;N;;;;;
+1D6D1;MATHEMATICAL BOLD SMALL PI;Ll;0;L; 03C0;;;;N;;;;;
+1D6D2;MATHEMATICAL BOLD SMALL RHO;Ll;0;L; 03C1;;;;N;;;;;
+1D6D3;MATHEMATICAL BOLD SMALL FINAL SIGMA;Ll;0;L; 03C2;;;;N;;;;;
+1D6D4;MATHEMATICAL BOLD SMALL SIGMA;Ll;0;L; 03C3;;;;N;;;;;
+1D6D5;MATHEMATICAL BOLD SMALL TAU;Ll;0;L; 03C4;;;;N;;;;;
+1D6D6;MATHEMATICAL BOLD SMALL UPSILON;Ll;0;L; 03C5;;;;N;;;;;
+1D6D7;MATHEMATICAL BOLD SMALL PHI;Ll;0;L; 03C6;;;;N;;;;;
+1D6D8;MATHEMATICAL BOLD SMALL CHI;Ll;0;L; 03C7;;;;N;;;;;
+1D6D9;MATHEMATICAL BOLD SMALL PSI;Ll;0;L; 03C8;;;;N;;;;;
+1D6DA;MATHEMATICAL BOLD SMALL OMEGA;Ll;0;L; 03C9;;;;N;;;;;
+1D6DB;MATHEMATICAL BOLD PARTIAL DIFFERENTIAL;Sm;0;ON; 2202;;;;Y;;;;;
+1D6DC;MATHEMATICAL BOLD EPSILON SYMBOL;Ll;0;L; 03F5;;;;N;;;;;
+1D6DD;MATHEMATICAL BOLD THETA SYMBOL;Ll;0;L; 03D1;;;;N;;;;;
+1D6DE;MATHEMATICAL BOLD KAPPA SYMBOL;Ll;0;L; 03F0;;;;N;;;;;
+1D6DF;MATHEMATICAL BOLD PHI SYMBOL;Ll;0;L; 03D5;;;;N;;;;;
+1D6E0;MATHEMATICAL BOLD RHO SYMBOL;Ll;0;L; 03F1;;;;N;;;;;
+1D6E1;MATHEMATICAL BOLD PI SYMBOL;Ll;0;L; 03D6;;;;N;;;;;
+1D6E2;MATHEMATICAL ITALIC CAPITAL ALPHA;Lu;0;L; 0391;;;;N;;;;;
+1D6E3;MATHEMATICAL ITALIC CAPITAL BETA;Lu;0;L; 0392;;;;N;;;;;
+1D6E4;MATHEMATICAL ITALIC CAPITAL GAMMA;Lu;0;L; 0393;;;;N;;;;;
+1D6E5;MATHEMATICAL ITALIC CAPITAL DELTA;Lu;0;L; 0394;;;;N;;;;;
+1D6E6;MATHEMATICAL ITALIC CAPITAL EPSILON;Lu;0;L; 0395;;;;N;;;;;
+1D6E7;MATHEMATICAL ITALIC CAPITAL ZETA;Lu;0;L; 0396;;;;N;;;;;
+1D6E8;MATHEMATICAL ITALIC CAPITAL ETA;Lu;0;L; 0397;;;;N;;;;;
+1D6E9;MATHEMATICAL ITALIC CAPITAL THETA;Lu;0;L; 0398;;;;N;;;;;
+1D6EA;MATHEMATICAL ITALIC CAPITAL IOTA;Lu;0;L; 0399;;;;N;;;;;
+1D6EB;MATHEMATICAL ITALIC CAPITAL KAPPA;Lu;0;L; 039A;;;;N;;;;;
+1D6EC;MATHEMATICAL ITALIC CAPITAL LAMDA;Lu;0;L; 039B;;;;N;;;;;
+1D6ED;MATHEMATICAL ITALIC CAPITAL MU;Lu;0;L; 039C;;;;N;;;;;
+1D6EE;MATHEMATICAL ITALIC CAPITAL NU;Lu;0;L; 039D;;;;N;;;;;
+1D6EF;MATHEMATICAL ITALIC CAPITAL XI;Lu;0;L; 039E;;;;N;;;;;
+1D6F0;MATHEMATICAL ITALIC CAPITAL OMICRON;Lu;0;L; 039F;;;;N;;;;;
+1D6F1;MATHEMATICAL ITALIC CAPITAL PI;Lu;0;L; 03A0;;;;N;;;;;
+1D6F2;MATHEMATICAL ITALIC CAPITAL RHO;Lu;0;L; 03A1;;;;N;;;;;
+1D6F3;MATHEMATICAL ITALIC CAPITAL THETA SYMBOL;Lu;0;L; 03F4;;;;N;;;;;
+1D6F4;MATHEMATICAL ITALIC CAPITAL SIGMA;Lu;0;L; 03A3;;;;N;;;;;
+1D6F5;MATHEMATICAL ITALIC CAPITAL TAU;Lu;0;L; 03A4;;;;N;;;;;
+1D6F6;MATHEMATICAL ITALIC CAPITAL UPSILON;Lu;0;L; 03A5;;;;N;;;;;
+1D6F7;MATHEMATICAL ITALIC CAPITAL PHI;Lu;0;L; 03A6;;;;N;;;;;
+1D6F8;MATHEMATICAL ITALIC CAPITAL CHI;Lu;0;L; 03A7;;;;N;;;;;
+1D6F9;MATHEMATICAL ITALIC CAPITAL PSI;Lu;0;L; 03A8;;;;N;;;;;
+1D6FA;MATHEMATICAL ITALIC CAPITAL OMEGA;Lu;0;L; 03A9;;;;N;;;;;
+1D6FB;MATHEMATICAL ITALIC NABLA;Sm;0;L; 2207;;;;N;;;;;
+1D6FC;MATHEMATICAL ITALIC SMALL ALPHA;Ll;0;L; 03B1;;;;N;;;;;
+1D6FD;MATHEMATICAL ITALIC SMALL BETA;Ll;0;L; 03B2;;;;N;;;;;
+1D6FE;MATHEMATICAL ITALIC SMALL GAMMA;Ll;0;L; 03B3;;;;N;;;;;
+1D6FF;MATHEMATICAL ITALIC SMALL DELTA;Ll;0;L; 03B4;;;;N;;;;;
+1D700;MATHEMATICAL ITALIC SMALL EPSILON;Ll;0;L; 03B5;;;;N;;;;;
+1D701;MATHEMATICAL ITALIC SMALL ZETA;Ll;0;L; 03B6;;;;N;;;;;
+1D702;MATHEMATICAL ITALIC SMALL ETA;Ll;0;L; 03B7;;;;N;;;;;
+1D703;MATHEMATICAL ITALIC SMALL THETA;Ll;0;L; 03B8;;;;N;;;;;
+1D704;MATHEMATICAL ITALIC SMALL IOTA;Ll;0;L; 03B9;;;;N;;;;;
+1D705;MATHEMATICAL ITALIC SMALL KAPPA;Ll;0;L; 03BA;;;;N;;;;;
+1D706;MATHEMATICAL ITALIC SMALL LAMDA;Ll;0;L; 03BB;;;;N;;;;;
+1D707;MATHEMATICAL ITALIC SMALL MU;Ll;0;L; 03BC;;;;N;;;;;
+1D708;MATHEMATICAL ITALIC SMALL NU;Ll;0;L; 03BD;;;;N;;;;;
+1D709;MATHEMATICAL ITALIC SMALL XI;Ll;0;L; 03BE;;;;N;;;;;
+1D70A;MATHEMATICAL ITALIC SMALL OMICRON;Ll;0;L; 03BF;;;;N;;;;;
+1D70B;MATHEMATICAL ITALIC SMALL PI;Ll;0;L; 03C0;;;;N;;;;;
+1D70C;MATHEMATICAL ITALIC SMALL RHO;Ll;0;L; 03C1;;;;N;;;;;
+1D70D;MATHEMATICAL ITALIC SMALL FINAL SIGMA;Ll;0;L; 03C2;;;;N;;;;;
+1D70E;MATHEMATICAL ITALIC SMALL SIGMA;Ll;0;L; 03C3;;;;N;;;;;
+1D70F;MATHEMATICAL ITALIC SMALL TAU;Ll;0;L; 03C4;;;;N;;;;;
+1D710;MATHEMATICAL ITALIC SMALL UPSILON;Ll;0;L; 03C5;;;;N;;;;;
+1D711;MATHEMATICAL ITALIC SMALL PHI;Ll;0;L; 03C6;;;;N;;;;;
+1D712;MATHEMATICAL ITALIC SMALL CHI;Ll;0;L; 03C7;;;;N;;;;;
+1D713;MATHEMATICAL ITALIC SMALL PSI;Ll;0;L; 03C8;;;;N;;;;;
+1D714;MATHEMATICAL ITALIC SMALL OMEGA;Ll;0;L; 03C9;;;;N;;;;;
+1D715;MATHEMATICAL ITALIC PARTIAL DIFFERENTIAL;Sm;0;ON; 2202;;;;Y;;;;;
+1D716;MATHEMATICAL ITALIC EPSILON SYMBOL;Ll;0;L; 03F5;;;;N;;;;;
+1D717;MATHEMATICAL ITALIC THETA SYMBOL;Ll;0;L; 03D1;;;;N;;;;;
+1D718;MATHEMATICAL ITALIC KAPPA SYMBOL;Ll;0;L; 03F0;;;;N;;;;;
+1D719;MATHEMATICAL ITALIC PHI SYMBOL;Ll;0;L; 03D5;;;;N;;;;;
+1D71A;MATHEMATICAL ITALIC RHO SYMBOL;Ll;0;L; 03F1;;;;N;;;;;
+1D71B;MATHEMATICAL ITALIC PI SYMBOL;Ll;0;L; 03D6;;;;N;;;;;
+1D71C;MATHEMATICAL BOLD ITALIC CAPITAL ALPHA;Lu;0;L; 0391;;;;N;;;;;
+1D71D;MATHEMATICAL BOLD ITALIC CAPITAL BETA;Lu;0;L; 0392;;;;N;;;;;
+1D71E;MATHEMATICAL BOLD ITALIC CAPITAL GAMMA;Lu;0;L; 0393;;;;N;;;;;
+1D71F;MATHEMATICAL BOLD ITALIC CAPITAL DELTA;Lu;0;L; 0394;;;;N;;;;;
+1D720;MATHEMATICAL BOLD ITALIC CAPITAL EPSILON;Lu;0;L; 0395;;;;N;;;;;
+1D721;MATHEMATICAL BOLD ITALIC CAPITAL ZETA;Lu;0;L; 0396;;;;N;;;;;
+1D722;MATHEMATICAL BOLD ITALIC CAPITAL ETA;Lu;0;L; 0397;;;;N;;;;;
+1D723;MATHEMATICAL BOLD ITALIC CAPITAL THETA;Lu;0;L; 0398;;;;N;;;;;
+1D724;MATHEMATICAL BOLD ITALIC CAPITAL IOTA;Lu;0;L; 0399;;;;N;;;;;
+1D725;MATHEMATICAL BOLD ITALIC CAPITAL KAPPA;Lu;0;L; 039A;;;;N;;;;;
+1D726;MATHEMATICAL BOLD ITALIC CAPITAL LAMDA;Lu;0;L; 039B;;;;N;;;;;
+1D727;MATHEMATICAL BOLD ITALIC CAPITAL MU;Lu;0;L; 039C;;;;N;;;;;
+1D728;MATHEMATICAL BOLD ITALIC CAPITAL NU;Lu;0;L; 039D;;;;N;;;;;
+1D729;MATHEMATICAL BOLD ITALIC CAPITAL XI;Lu;0;L; 039E;;;;N;;;;;
+1D72A;MATHEMATICAL BOLD ITALIC CAPITAL OMICRON;Lu;0;L; 039F;;;;N;;;;;
+1D72B;MATHEMATICAL BOLD ITALIC CAPITAL PI;Lu;0;L; 03A0;;;;N;;;;;
+1D72C;MATHEMATICAL BOLD ITALIC CAPITAL RHO;Lu;0;L; 03A1;;;;N;;;;;
+1D72D;MATHEMATICAL BOLD ITALIC CAPITAL THETA SYMBOL;Lu;0;L; 03F4;;;;N;;;;;
+1D72E;MATHEMATICAL BOLD ITALIC CAPITAL SIGMA;Lu;0;L; 03A3;;;;N;;;;;
+1D72F;MATHEMATICAL BOLD ITALIC CAPITAL TAU;Lu;0;L; 03A4;;;;N;;;;;
+1D730;MATHEMATICAL BOLD ITALIC CAPITAL UPSILON;Lu;0;L; 03A5;;;;N;;;;;
+1D731;MATHEMATICAL BOLD ITALIC CAPITAL PHI;Lu;0;L; 03A6;;;;N;;;;;
+1D732;MATHEMATICAL BOLD ITALIC CAPITAL CHI;Lu;0;L; 03A7;;;;N;;;;;
+1D733;MATHEMATICAL BOLD ITALIC CAPITAL PSI;Lu;0;L; 03A8;;;;N;;;;;
+1D734;MATHEMATICAL BOLD ITALIC CAPITAL OMEGA;Lu;0;L; 03A9;;;;N;;;;;
+1D735;MATHEMATICAL BOLD ITALIC NABLA;Sm;0;L; 2207;;;;N;;;;;
+1D736;MATHEMATICAL BOLD ITALIC SMALL ALPHA;Ll;0;L; 03B1;;;;N;;;;;
+1D737;MATHEMATICAL BOLD ITALIC SMALL BETA;Ll;0;L; 03B2;;;;N;;;;;
+1D738;MATHEMATICAL BOLD ITALIC SMALL GAMMA;Ll;0;L; 03B3;;;;N;;;;;
+1D739;MATHEMATICAL BOLD ITALIC SMALL DELTA;Ll;0;L; 03B4;;;;N;;;;;
+1D73A;MATHEMATICAL BOLD ITALIC SMALL EPSILON;Ll;0;L; 03B5;;;;N;;;;;
+1D73B;MATHEMATICAL BOLD ITALIC SMALL ZETA;Ll;0;L; 03B6;;;;N;;;;;
+1D73C;MATHEMATICAL BOLD ITALIC SMALL ETA;Ll;0;L; 03B7;;;;N;;;;;
+1D73D;MATHEMATICAL BOLD ITALIC SMALL THETA;Ll;0;L; 03B8;;;;N;;;;;
+1D73E;MATHEMATICAL BOLD ITALIC SMALL IOTA;Ll;0;L; 03B9;;;;N;;;;;
+1D73F;MATHEMATICAL BOLD ITALIC SMALL KAPPA;Ll;0;L; 03BA;;;;N;;;;;
+1D740;MATHEMATICAL BOLD ITALIC SMALL LAMDA;Ll;0;L; 03BB;;;;N;;;;;
+1D741;MATHEMATICAL BOLD ITALIC SMALL MU;Ll;0;L; 03BC;;;;N;;;;;
+1D742;MATHEMATICAL BOLD ITALIC SMALL NU;Ll;0;L; 03BD;;;;N;;;;;
+1D743;MATHEMATICAL BOLD ITALIC SMALL XI;Ll;0;L; 03BE;;;;N;;;;;
+1D744;MATHEMATICAL BOLD ITALIC SMALL OMICRON;Ll;0;L; 03BF;;;;N;;;;;
+1D745;MATHEMATICAL BOLD ITALIC SMALL PI;Ll;0;L; 03C0;;;;N;;;;;
+1D746;MATHEMATICAL BOLD ITALIC SMALL RHO;Ll;0;L; 03C1;;;;N;;;;;
+1D747;MATHEMATICAL BOLD ITALIC SMALL FINAL SIGMA;Ll;0;L; 03C2;;;;N;;;;;
+1D748;MATHEMATICAL BOLD ITALIC SMALL SIGMA;Ll;0;L; 03C3;;;;N;;;;;
+1D749;MATHEMATICAL BOLD ITALIC SMALL TAU;Ll;0;L; 03C4;;;;N;;;;;
+1D74A;MATHEMATICAL BOLD ITALIC SMALL UPSILON;Ll;0;L; 03C5;;;;N;;;;;
+1D74B;MATHEMATICAL BOLD ITALIC SMALL PHI;Ll;0;L; 03C6;;;;N;;;;;
+1D74C;MATHEMATICAL BOLD ITALIC SMALL CHI;Ll;0;L; 03C7;;;;N;;;;;
+1D74D;MATHEMATICAL BOLD ITALIC SMALL PSI;Ll;0;L; 03C8;;;;N;;;;;
+1D74E;MATHEMATICAL BOLD ITALIC SMALL OMEGA;Ll;0;L; 03C9;;;;N;;;;;
+1D74F;MATHEMATICAL BOLD ITALIC PARTIAL DIFFERENTIAL;Sm;0;ON; 2202;;;;Y;;;;;
+1D750;MATHEMATICAL BOLD ITALIC EPSILON SYMBOL;Ll;0;L; 03F5;;;;N;;;;;
+1D751;MATHEMATICAL BOLD ITALIC THETA SYMBOL;Ll;0;L; 03D1;;;;N;;;;;
+1D752;MATHEMATICAL BOLD ITALIC KAPPA SYMBOL;Ll;0;L; 03F0;;;;N;;;;;
+1D753;MATHEMATICAL BOLD ITALIC PHI SYMBOL;Ll;0;L; 03D5;;;;N;;;;;
+1D754;MATHEMATICAL BOLD ITALIC RHO SYMBOL;Ll;0;L; 03F1;;;;N;;;;;
+1D755;MATHEMATICAL BOLD ITALIC PI SYMBOL;Ll;0;L; 03D6;;;;N;;;;;
+1D756;MATHEMATICAL SANS-SERIF BOLD CAPITAL ALPHA;Lu;0;L; 0391;;;;N;;;;;
+1D757;MATHEMATICAL SANS-SERIF BOLD CAPITAL BETA;Lu;0;L; 0392;;;;N;;;;;
+1D758;MATHEMATICAL SANS-SERIF BOLD CAPITAL GAMMA;Lu;0;L; 0393;;;;N;;;;;
+1D759;MATHEMATICAL SANS-SERIF BOLD CAPITAL DELTA;Lu;0;L; 0394;;;;N;;;;;
+1D75A;MATHEMATICAL SANS-SERIF BOLD CAPITAL EPSILON;Lu;0;L; 0395;;;;N;;;;;
+1D75B;MATHEMATICAL SANS-SERIF BOLD CAPITAL ZETA;Lu;0;L; 0396;;;;N;;;;;
+1D75C;MATHEMATICAL SANS-SERIF BOLD CAPITAL ETA;Lu;0;L; 0397;;;;N;;;;;
+1D75D;MATHEMATICAL SANS-SERIF BOLD CAPITAL THETA;Lu;0;L; 0398;;;;N;;;;;
+1D75E;MATHEMATICAL SANS-SERIF BOLD CAPITAL IOTA;Lu;0;L; 0399;;;;N;;;;;
+1D75F;MATHEMATICAL SANS-SERIF BOLD CAPITAL KAPPA;Lu;0;L; 039A;;;;N;;;;;
+1D760;MATHEMATICAL SANS-SERIF BOLD CAPITAL LAMDA;Lu;0;L; 039B;;;;N;;;;;
+1D761;MATHEMATICAL SANS-SERIF BOLD CAPITAL MU;Lu;0;L; 039C;;;;N;;;;;
+1D762;MATHEMATICAL SANS-SERIF BOLD CAPITAL NU;Lu;0;L; 039D;;;;N;;;;;
+1D763;MATHEMATICAL SANS-SERIF BOLD CAPITAL XI;Lu;0;L; 039E;;;;N;;;;;
+1D764;MATHEMATICAL SANS-SERIF BOLD CAPITAL OMICRON;Lu;0;L; 039F;;;;N;;;;;
+1D765;MATHEMATICAL SANS-SERIF BOLD CAPITAL PI;Lu;0;L; 03A0;;;;N;;;;;
+1D766;MATHEMATICAL SANS-SERIF BOLD CAPITAL RHO;Lu;0;L; 03A1;;;;N;;;;;
+1D767;MATHEMATICAL SANS-SERIF BOLD CAPITAL THETA SYMBOL;Lu;0;L; 03F4;;;;N;;;;;
+1D768;MATHEMATICAL SANS-SERIF BOLD CAPITAL SIGMA;Lu;0;L; 03A3;;;;N;;;;;
+1D769;MATHEMATICAL SANS-SERIF BOLD CAPITAL TAU;Lu;0;L; 03A4;;;;N;;;;;
+1D76A;MATHEMATICAL SANS-SERIF BOLD CAPITAL UPSILON;Lu;0;L; 03A5;;;;N;;;;;
+1D76B;MATHEMATICAL SANS-SERIF BOLD CAPITAL PHI;Lu;0;L; 03A6;;;;N;;;;;
+1D76C;MATHEMATICAL SANS-SERIF BOLD CAPITAL CHI;Lu;0;L; 03A7;;;;N;;;;;
+1D76D;MATHEMATICAL SANS-SERIF BOLD CAPITAL PSI;Lu;0;L; 03A8;;;;N;;;;;
+1D76E;MATHEMATICAL SANS-SERIF BOLD CAPITAL OMEGA;Lu;0;L; 03A9;;;;N;;;;;
+1D76F;MATHEMATICAL SANS-SERIF BOLD NABLA;Sm;0;L; 2207;;;;N;;;;;
+1D770;MATHEMATICAL SANS-SERIF BOLD SMALL ALPHA;Ll;0;L; 03B1;;;;N;;;;;
+1D771;MATHEMATICAL SANS-SERIF BOLD SMALL BETA;Ll;0;L; 03B2;;;;N;;;;;
+1D772;MATHEMATICAL SANS-SERIF BOLD SMALL GAMMA;Ll;0;L; 03B3;;;;N;;;;;
+1D773;MATHEMATICAL SANS-SERIF BOLD SMALL DELTA;Ll;0;L; 03B4;;;;N;;;;;
+1D774;MATHEMATICAL SANS-SERIF BOLD SMALL EPSILON;Ll;0;L; 03B5;;;;N;;;;;
+1D775;MATHEMATICAL SANS-SERIF BOLD SMALL ZETA;Ll;0;L; 03B6;;;;N;;;;;
+1D776;MATHEMATICAL SANS-SERIF BOLD SMALL ETA;Ll;0;L; 03B7;;;;N;;;;;
+1D777;MATHEMATICAL SANS-SERIF BOLD SMALL THETA;Ll;0;L; 03B8;;;;N;;;;;
+1D778;MATHEMATICAL SANS-SERIF BOLD SMALL IOTA;Ll;0;L; 03B9;;;;N;;;;;
+1D779;MATHEMATICAL SANS-SERIF BOLD SMALL KAPPA;Ll;0;L; 03BA;;;;N;;;;;
+1D77A;MATHEMATICAL SANS-SERIF BOLD SMALL LAMDA;Ll;0;L; 03BB;;;;N;;;;;
+1D77B;MATHEMATICAL SANS-SERIF BOLD SMALL MU;Ll;0;L; 03BC;;;;N;;;;;
+1D77C;MATHEMATICAL SANS-SERIF BOLD SMALL NU;Ll;0;L; 03BD;;;;N;;;;;
+1D77D;MATHEMATICAL SANS-SERIF BOLD SMALL XI;Ll;0;L; 03BE;;;;N;;;;;
+1D77E;MATHEMATICAL SANS-SERIF BOLD SMALL OMICRON;Ll;0;L; 03BF;;;;N;;;;;
+1D77F;MATHEMATICAL SANS-SERIF BOLD SMALL PI;Ll;0;L; 03C0;;;;N;;;;;
+1D780;MATHEMATICAL SANS-SERIF BOLD SMALL RHO;Ll;0;L; 03C1;;;;N;;;;;
+1D781;MATHEMATICAL SANS-SERIF BOLD SMALL FINAL SIGMA;Ll;0;L; 03C2;;;;N;;;;;
+1D782;MATHEMATICAL SANS-SERIF BOLD SMALL SIGMA;Ll;0;L; 03C3;;;;N;;;;;
+1D783;MATHEMATICAL SANS-SERIF BOLD SMALL TAU;Ll;0;L; 03C4;;;;N;;;;;
+1D784;MATHEMATICAL SANS-SERIF BOLD SMALL UPSILON;Ll;0;L; 03C5;;;;N;;;;;
+1D785;MATHEMATICAL SANS-SERIF BOLD SMALL PHI;Ll;0;L; 03C6;;;;N;;;;;
+1D786;MATHEMATICAL SANS-SERIF BOLD SMALL CHI;Ll;0;L; 03C7;;;;N;;;;;
+1D787;MATHEMATICAL SANS-SERIF BOLD SMALL PSI;Ll;0;L; 03C8;;;;N;;;;;
+1D788;MATHEMATICAL SANS-SERIF BOLD SMALL OMEGA;Ll;0;L; 03C9;;;;N;;;;;
+1D789;MATHEMATICAL SANS-SERIF BOLD PARTIAL DIFFERENTIAL;Sm;0;ON; 2202;;;;Y;;;;;
+1D78A;MATHEMATICAL SANS-SERIF BOLD EPSILON SYMBOL;Ll;0;L; 03F5;;;;N;;;;;
+1D78B;MATHEMATICAL SANS-SERIF BOLD THETA SYMBOL;Ll;0;L; 03D1;;;;N;;;;;
+1D78C;MATHEMATICAL SANS-SERIF BOLD KAPPA SYMBOL;Ll;0;L; 03F0;;;;N;;;;;
+1D78D;MATHEMATICAL SANS-SERIF BOLD PHI SYMBOL;Ll;0;L; 03D5;;;;N;;;;;
+1D78E;MATHEMATICAL SANS-SERIF BOLD RHO SYMBOL;Ll;0;L; 03F1;;;;N;;;;;
+1D78F;MATHEMATICAL SANS-SERIF BOLD PI SYMBOL;Ll;0;L; 03D6;;;;N;;;;;
+1D790;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL ALPHA;Lu;0;L; 0391;;;;N;;;;;
+1D791;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL BETA;Lu;0;L; 0392;;;;N;;;;;
+1D792;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL GAMMA;Lu;0;L; 0393;;;;N;;;;;
+1D793;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL DELTA;Lu;0;L; 0394;;;;N;;;;;
+1D794;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL EPSILON;Lu;0;L; 0395;;;;N;;;;;
+1D795;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL ZETA;Lu;0;L; 0396;;;;N;;;;;
+1D796;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL ETA;Lu;0;L; 0397;;;;N;;;;;
+1D797;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL THETA;Lu;0;L; 0398;;;;N;;;;;
+1D798;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL IOTA;Lu;0;L; 0399;;;;N;;;;;
+1D799;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL KAPPA;Lu;0;L; 039A;;;;N;;;;;
+1D79A;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL LAMDA;Lu;0;L; 039B;;;;N;;;;;
+1D79B;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL MU;Lu;0;L; 039C;;;;N;;;;;
+1D79C;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL NU;Lu;0;L; 039D;;;;N;;;;;
+1D79D;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL XI;Lu;0;L; 039E;;;;N;;;;;
+1D79E;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL OMICRON;Lu;0;L; 039F;;;;N;;;;;
+1D79F;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL PI;Lu;0;L; 03A0;;;;N;;;;;
+1D7A0;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL RHO;Lu;0;L; 03A1;;;;N;;;;;
+1D7A1;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL THETA SYMBOL;Lu;0;L; 03F4;;;;N;;;;;
+1D7A2;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL SIGMA;Lu;0;L; 03A3;;;;N;;;;;
+1D7A3;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL TAU;Lu;0;L; 03A4;;;;N;;;;;
+1D7A4;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL UPSILON;Lu;0;L; 03A5;;;;N;;;;;
+1D7A5;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL PHI;Lu;0;L; 03A6;;;;N;;;;;
+1D7A6;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL CHI;Lu;0;L; 03A7;;;;N;;;;;
+1D7A7;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL PSI;Lu;0;L; 03A8;;;;N;;;;;
+1D7A8;MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL OMEGA;Lu;0;L; 03A9;;;;N;;;;;
+1D7A9;MATHEMATICAL SANS-SERIF BOLD ITALIC NABLA;Sm;0;L; 2207;;;;N;;;;;
+1D7AA;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL ALPHA;Ll;0;L; 03B1;;;;N;;;;;
+1D7AB;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL BETA;Ll;0;L; 03B2;;;;N;;;;;
+1D7AC;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL GAMMA;Ll;0;L; 03B3;;;;N;;;;;
+1D7AD;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL DELTA;Ll;0;L; 03B4;;;;N;;;;;
+1D7AE;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL EPSILON;Ll;0;L; 03B5;;;;N;;;;;
+1D7AF;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL ZETA;Ll;0;L; 03B6;;;;N;;;;;
+1D7B0;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL ETA;Ll;0;L; 03B7;;;;N;;;;;
+1D7B1;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL THETA;Ll;0;L; 03B8;;;;N;;;;;
+1D7B2;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL IOTA;Ll;0;L; 03B9;;;;N;;;;;
+1D7B3;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL KAPPA;Ll;0;L; 03BA;;;;N;;;;;
+1D7B4;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL LAMDA;Ll;0;L; 03BB;;;;N;;;;;
+1D7B5;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL MU;Ll;0;L; 03BC;;;;N;;;;;
+1D7B6;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL NU;Ll;0;L; 03BD;;;;N;;;;;
+1D7B7;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL XI;Ll;0;L; 03BE;;;;N;;;;;
+1D7B8;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL OMICRON;Ll;0;L; 03BF;;;;N;;;;;
+1D7B9;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL PI;Ll;0;L; 03C0;;;;N;;;;;
+1D7BA;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL RHO;Ll;0;L; 03C1;;;;N;;;;;
+1D7BB;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL FINAL SIGMA;Ll;0;L; 03C2;;;;N;;;;;
+1D7BC;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL SIGMA;Ll;0;L; 03C3;;;;N;;;;;
+1D7BD;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL TAU;Ll;0;L; 03C4;;;;N;;;;;
+1D7BE;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL UPSILON;Ll;0;L; 03C5;;;;N;;;;;
+1D7BF;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL PHI;Ll;0;L; 03C6;;;;N;;;;;
+1D7C0;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL CHI;Ll;0;L; 03C7;;;;N;;;;;
+1D7C1;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL PSI;Ll;0;L; 03C8;;;;N;;;;;
+1D7C2;MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL OMEGA;Ll;0;L; 03C9;;;;N;;;;;
+1D7C3;MATHEMATICAL SANS-SERIF BOLD ITALIC PARTIAL DIFFERENTIAL;Sm;0;ON; 2202;;;;Y;;;;;
+1D7C4;MATHEMATICAL SANS-SERIF BOLD ITALIC EPSILON SYMBOL;Ll;0;L; 03F5;;;;N;;;;;
+1D7C5;MATHEMATICAL SANS-SERIF BOLD ITALIC THETA SYMBOL;Ll;0;L; 03D1;;;;N;;;;;
+1D7C6;MATHEMATICAL SANS-SERIF BOLD ITALIC KAPPA SYMBOL;Ll;0;L; 03F0;;;;N;;;;;
+1D7C7;MATHEMATICAL SANS-SERIF BOLD ITALIC PHI SYMBOL;Ll;0;L; 03D5;;;;N;;;;;
+1D7C8;MATHEMATICAL SANS-SERIF BOLD ITALIC RHO SYMBOL;Ll;0;L; 03F1;;;;N;;;;;
+1D7C9;MATHEMATICAL SANS-SERIF BOLD ITALIC PI SYMBOL;Ll;0;L; 03D6;;;;N;;;;;
+1D7CA;MATHEMATICAL BOLD CAPITAL DIGAMMA;Lu;0;L; 03DC;;;;N;;;;;
+1D7CB;MATHEMATICAL BOLD SMALL DIGAMMA;Ll;0;L; 03DD;;;;N;;;;;
+1D7CE;MATHEMATICAL BOLD DIGIT ZERO;Nd;0;EN; 0030;0;0;0;N;;;;;
+1D7CF;MATHEMATICAL BOLD DIGIT ONE;Nd;0;EN; 0031;1;1;1;N;;;;;
+1D7D0;MATHEMATICAL BOLD DIGIT TWO;Nd;0;EN; 0032;2;2;2;N;;;;;
+1D7D1;MATHEMATICAL BOLD DIGIT THREE;Nd;0;EN; 0033;3;3;3;N;;;;;
+1D7D2;MATHEMATICAL BOLD DIGIT FOUR;Nd;0;EN; 0034;4;4;4;N;;;;;
+1D7D3;MATHEMATICAL BOLD DIGIT FIVE;Nd;0;EN; 0035;5;5;5;N;;;;;
+1D7D4;MATHEMATICAL BOLD DIGIT SIX;Nd;0;EN; 0036;6;6;6;N;;;;;
+1D7D5;MATHEMATICAL BOLD DIGIT SEVEN;Nd;0;EN; 0037;7;7;7;N;;;;;
+1D7D6;MATHEMATICAL BOLD DIGIT EIGHT;Nd;0;EN; 0038;8;8;8;N;;;;;
+1D7D7;MATHEMATICAL BOLD DIGIT NINE;Nd;0;EN; 0039;9;9;9;N;;;;;
+1D7D8;MATHEMATICAL DOUBLE-STRUCK DIGIT ZERO;Nd;0;EN; 0030;0;0;0;N;;;;;
+1D7D9;MATHEMATICAL DOUBLE-STRUCK DIGIT ONE;Nd;0;EN; 0031;1;1;1;N;;;;;
+1D7DA;MATHEMATICAL DOUBLE-STRUCK DIGIT TWO;Nd;0;EN; 0032;2;2;2;N;;;;;
+1D7DB;MATHEMATICAL DOUBLE-STRUCK DIGIT THREE;Nd;0;EN; 0033;3;3;3;N;;;;;
+1D7DC;MATHEMATICAL DOUBLE-STRUCK DIGIT FOUR;Nd;0;EN; 0034;4;4;4;N;;;;;
+1D7DD;MATHEMATICAL DOUBLE-STRUCK DIGIT FIVE;Nd;0;EN; 0035;5;5;5;N;;;;;
+1D7DE;MATHEMATICAL DOUBLE-STRUCK DIGIT SIX;Nd;0;EN; 0036;6;6;6;N;;;;;
+1D7DF;MATHEMATICAL DOUBLE-STRUCK DIGIT SEVEN;Nd;0;EN; 0037;7;7;7;N;;;;;
+1D7E0;MATHEMATICAL DOUBLE-STRUCK DIGIT EIGHT;Nd;0;EN; 0038;8;8;8;N;;;;;
+1D7E1;MATHEMATICAL DOUBLE-STRUCK DIGIT NINE;Nd;0;EN; 0039;9;9;9;N;;;;;
+1D7E2;MATHEMATICAL SANS-SERIF DIGIT ZERO;Nd;0;EN; 0030;0;0;0;N;;;;;
+1D7E3;MATHEMATICAL SANS-SERIF DIGIT ONE;Nd;0;EN; 0031;1;1;1;N;;;;;
+1D7E4;MATHEMATICAL SANS-SERIF DIGIT TWO;Nd;0;EN; 0032;2;2;2;N;;;;;
+1D7E5;MATHEMATICAL SANS-SERIF DIGIT THREE;Nd;0;EN; 0033;3;3;3;N;;;;;
+1D7E6;MATHEMATICAL SANS-SERIF DIGIT FOUR;Nd;0;EN; 0034;4;4;4;N;;;;;
+1D7E7;MATHEMATICAL SANS-SERIF DIGIT FIVE;Nd;0;EN; 0035;5;5;5;N;;;;;
+1D7E8;MATHEMATICAL SANS-SERIF DIGIT SIX;Nd;0;EN; 0036;6;6;6;N;;;;;
+1D7E9;MATHEMATICAL SANS-SERIF DIGIT SEVEN;Nd;0;EN; 0037;7;7;7;N;;;;;
+1D7EA;MATHEMATICAL SANS-SERIF DIGIT EIGHT;Nd;0;EN; 0038;8;8;8;N;;;;;
+1D7EB;MATHEMATICAL SANS-SERIF DIGIT NINE;Nd;0;EN; 0039;9;9;9;N;;;;;
+1D7EC;MATHEMATICAL SANS-SERIF BOLD DIGIT ZERO;Nd;0;EN; 0030;0;0;0;N;;;;;
+1D7ED;MATHEMATICAL SANS-SERIF BOLD DIGIT ONE;Nd;0;EN; 0031;1;1;1;N;;;;;
+1D7EE;MATHEMATICAL SANS-SERIF BOLD DIGIT TWO;Nd;0;EN; 0032;2;2;2;N;;;;;
+1D7EF;MATHEMATICAL SANS-SERIF BOLD DIGIT THREE;Nd;0;EN; 0033;3;3;3;N;;;;;
+1D7F0;MATHEMATICAL SANS-SERIF BOLD DIGIT FOUR;Nd;0;EN; 0034;4;4;4;N;;;;;
+1D7F1;MATHEMATICAL SANS-SERIF BOLD DIGIT FIVE;Nd;0;EN; 0035;5;5;5;N;;;;;
+1D7F2;MATHEMATICAL SANS-SERIF BOLD DIGIT SIX;Nd;0;EN; 0036;6;6;6;N;;;;;
+1D7F3;MATHEMATICAL SANS-SERIF BOLD DIGIT SEVEN;Nd;0;EN; 0037;7;7;7;N;;;;;
+1D7F4;MATHEMATICAL SANS-SERIF BOLD DIGIT EIGHT;Nd;0;EN; 0038;8;8;8;N;;;;;
+1D7F5;MATHEMATICAL SANS-SERIF BOLD DIGIT NINE;Nd;0;EN; 0039;9;9;9;N;;;;;
+1D7F6;MATHEMATICAL MONOSPACE DIGIT ZERO;Nd;0;EN; 0030;0;0;0;N;;;;;
+1D7F7;MATHEMATICAL MONOSPACE DIGIT ONE;Nd;0;EN; 0031;1;1;1;N;;;;;
+1D7F8;MATHEMATICAL MONOSPACE DIGIT TWO;Nd;0;EN; 0032;2;2;2;N;;;;;
+1D7F9;MATHEMATICAL MONOSPACE DIGIT THREE;Nd;0;EN; 0033;3;3;3;N;;;;;
+1D7FA;MATHEMATICAL MONOSPACE DIGIT FOUR;Nd;0;EN; 0034;4;4;4;N;;;;;
+1D7FB;MATHEMATICAL MONOSPACE DIGIT FIVE;Nd;0;EN; 0035;5;5;5;N;;;;;
+1D7FC;MATHEMATICAL MONOSPACE DIGIT SIX;Nd;0;EN; 0036;6;6;6;N;;;;;
+1D7FD;MATHEMATICAL MONOSPACE DIGIT SEVEN;Nd;0;EN; 0037;7;7;7;N;;;;;
+1D7FE;MATHEMATICAL MONOSPACE DIGIT EIGHT;Nd;0;EN; 0038;8;8;8;N;;;;;
+1D7FF;MATHEMATICAL MONOSPACE DIGIT NINE;Nd;0;EN; 0039;9;9;9;N;;;;;
+1D800;SIGNWRITING HAND-FIST INDEX;So;0;L;;;;;N;;;;;
+1D801;SIGNWRITING HAND-CIRCLE INDEX;So;0;L;;;;;N;;;;;
+1D802;SIGNWRITING HAND-CUP INDEX;So;0;L;;;;;N;;;;;
+1D803;SIGNWRITING HAND-OVAL INDEX;So;0;L;;;;;N;;;;;
+1D804;SIGNWRITING HAND-HINGE INDEX;So;0;L;;;;;N;;;;;
+1D805;SIGNWRITING HAND-ANGLE INDEX;So;0;L;;;;;N;;;;;
+1D806;SIGNWRITING HAND-FIST INDEX BENT;So;0;L;;;;;N;;;;;
+1D807;SIGNWRITING HAND-CIRCLE INDEX BENT;So;0;L;;;;;N;;;;;
+1D808;SIGNWRITING HAND-FIST THUMB UNDER INDEX BENT;So;0;L;;;;;N;;;;;
+1D809;SIGNWRITING HAND-FIST INDEX RAISED KNUCKLE;So;0;L;;;;;N;;;;;
+1D80A;SIGNWRITING HAND-FIST INDEX CUPPED;So;0;L;;;;;N;;;;;
+1D80B;SIGNWRITING HAND-FIST INDEX HINGED;So;0;L;;;;;N;;;;;
+1D80C;SIGNWRITING HAND-FIST INDEX HINGED LOW;So;0;L;;;;;N;;;;;
+1D80D;SIGNWRITING HAND-CIRCLE INDEX HINGE;So;0;L;;;;;N;;;;;
+1D80E;SIGNWRITING HAND-FIST INDEX MIDDLE;So;0;L;;;;;N;;;;;
+1D80F;SIGNWRITING HAND-CIRCLE INDEX MIDDLE;So;0;L;;;;;N;;;;;
+1D810;SIGNWRITING HAND-FIST INDEX MIDDLE BENT;So;0;L;;;;;N;;;;;
+1D811;SIGNWRITING HAND-FIST INDEX MIDDLE RAISED KNUCKLES;So;0;L;;;;;N;;;;;
+1D812;SIGNWRITING HAND-FIST INDEX MIDDLE HINGED;So;0;L;;;;;N;;;;;
+1D813;SIGNWRITING HAND-FIST INDEX UP MIDDLE HINGED;So;0;L;;;;;N;;;;;
+1D814;SIGNWRITING HAND-FIST INDEX HINGED MIDDLE UP;So;0;L;;;;;N;;;;;
+1D815;SIGNWRITING HAND-FIST INDEX MIDDLE CONJOINED;So;0;L;;;;;N;;;;;
+1D816;SIGNWRITING HAND-FIST INDEX MIDDLE CONJOINED INDEX BENT;So;0;L;;;;;N;;;;;
+1D817;SIGNWRITING HAND-FIST INDEX MIDDLE CONJOINED MIDDLE BENT;So;0;L;;;;;N;;;;;
+1D818;SIGNWRITING HAND-FIST INDEX MIDDLE CONJOINED CUPPED;So;0;L;;;;;N;;;;;
+1D819;SIGNWRITING HAND-FIST INDEX MIDDLE CONJOINED HINGED;So;0;L;;;;;N;;;;;
+1D81A;SIGNWRITING HAND-FIST INDEX MIDDLE CROSSED;So;0;L;;;;;N;;;;;
+1D81B;SIGNWRITING HAND-CIRCLE INDEX MIDDLE CROSSED;So;0;L;;;;;N;;;;;
+1D81C;SIGNWRITING HAND-FIST MIDDLE BENT OVER INDEX;So;0;L;;;;;N;;;;;
+1D81D;SIGNWRITING HAND-FIST INDEX BENT OVER MIDDLE;So;0;L;;;;;N;;;;;
+1D81E;SIGNWRITING HAND-FIST INDEX MIDDLE THUMB;So;0;L;;;;;N;;;;;
+1D81F;SIGNWRITING HAND-CIRCLE INDEX MIDDLE THUMB;So;0;L;;;;;N;;;;;
+1D820;SIGNWRITING HAND-FIST INDEX MIDDLE STRAIGHT THUMB BENT;So;0;L;;;;;N;;;;;
+1D821;SIGNWRITING HAND-FIST INDEX MIDDLE BENT THUMB STRAIGHT;So;0;L;;;;;N;;;;;
+1D822;SIGNWRITING HAND-FIST INDEX MIDDLE THUMB BENT;So;0;L;;;;;N;;;;;
+1D823;SIGNWRITING HAND-FIST INDEX MIDDLE HINGED SPREAD THUMB SIDE;So;0;L;;;;;N;;;;;
+1D824;SIGNWRITING HAND-FIST INDEX UP MIDDLE HINGED THUMB SIDE;So;0;L;;;;;N;;;;;
+1D825;SIGNWRITING HAND-FIST INDEX UP MIDDLE HINGED THUMB CONJOINED;So;0;L;;;;;N;;;;;
+1D826;SIGNWRITING HAND-FIST INDEX HINGED MIDDLE UP THUMB SIDE;So;0;L;;;;;N;;;;;
+1D827;SIGNWRITING HAND-FIST INDEX MIDDLE UP SPREAD THUMB FORWARD;So;0;L;;;;;N;;;;;
+1D828;SIGNWRITING HAND-FIST INDEX MIDDLE THUMB CUPPED;So;0;L;;;;;N;;;;;
+1D829;SIGNWRITING HAND-FIST INDEX MIDDLE THUMB CIRCLED;So;0;L;;;;;N;;;;;
+1D82A;SIGNWRITING HAND-FIST INDEX MIDDLE THUMB HOOKED;So;0;L;;;;;N;;;;;
+1D82B;SIGNWRITING HAND-FIST INDEX MIDDLE THUMB HINGED;So;0;L;;;;;N;;;;;
+1D82C;SIGNWRITING HAND-FIST THUMB BETWEEN INDEX MIDDLE STRAIGHT;So;0;L;;;;;N;;;;;
+1D82D;SIGNWRITING HAND-FIST INDEX MIDDLE CONJOINED THUMB SIDE;So;0;L;;;;;N;;;;;
+1D82E;SIGNWRITING HAND-FIST INDEX MIDDLE CONJOINED THUMB SIDE CONJOINED;So;0;L;;;;;N;;;;;
+1D82F;SIGNWRITING HAND-FIST INDEX MIDDLE CONJOINED THUMB SIDE BENT;So;0;L;;;;;N;;;;;
+1D830;SIGNWRITING HAND-FIST MIDDLE THUMB HOOKED INDEX UP;So;0;L;;;;;N;;;;;
+1D831;SIGNWRITING HAND-FIST INDEX THUMB HOOKED MIDDLE UP;So;0;L;;;;;N;;;;;
+1D832;SIGNWRITING HAND-FIST INDEX MIDDLE CONJOINED HINGED THUMB SIDE;So;0;L;;;;;N;;;;;
+1D833;SIGNWRITING HAND-FIST INDEX MIDDLE CROSSED THUMB SIDE;So;0;L;;;;;N;;;;;
+1D834;SIGNWRITING HAND-FIST INDEX MIDDLE CONJOINED THUMB FORWARD;So;0;L;;;;;N;;;;;
+1D835;SIGNWRITING HAND-FIST INDEX MIDDLE CONJOINED CUPPED THUMB FORWARD;So;0;L;;;;;N;;;;;
+1D836;SIGNWRITING HAND-FIST MIDDLE THUMB CUPPED INDEX UP;So;0;L;;;;;N;;;;;
+1D837;SIGNWRITING HAND-FIST INDEX THUMB CUPPED MIDDLE UP;So;0;L;;;;;N;;;;;
+1D838;SIGNWRITING HAND-FIST MIDDLE THUMB CIRCLED INDEX UP;So;0;L;;;;;N;;;;;
+1D839;SIGNWRITING HAND-FIST MIDDLE THUMB CIRCLED INDEX HINGED;So;0;L;;;;;N;;;;;
+1D83A;SIGNWRITING HAND-FIST INDEX THUMB ANGLED OUT MIDDLE UP;So;0;L;;;;;N;;;;;
+1D83B;SIGNWRITING HAND-FIST INDEX THUMB ANGLED IN MIDDLE UP;So;0;L;;;;;N;;;;;
+1D83C;SIGNWRITING HAND-FIST INDEX THUMB CIRCLED MIDDLE UP;So;0;L;;;;;N;;;;;
+1D83D;SIGNWRITING HAND-FIST INDEX MIDDLE THUMB CONJOINED HINGED;So;0;L;;;;;N;;;;;
+1D83E;SIGNWRITING HAND-FIST INDEX MIDDLE THUMB ANGLED OUT;So;0;L;;;;;N;;;;;
+1D83F;SIGNWRITING HAND-FIST INDEX MIDDLE THUMB ANGLED;So;0;L;;;;;N;;;;;
+1D840;SIGNWRITING HAND-FIST MIDDLE THUMB ANGLED OUT INDEX UP;So;0;L;;;;;N;;;;;
+1D841;SIGNWRITING HAND-FIST MIDDLE THUMB ANGLED OUT INDEX CROSSED;So;0;L;;;;;N;;;;;
+1D842;SIGNWRITING HAND-FIST MIDDLE THUMB ANGLED INDEX UP;So;0;L;;;;;N;;;;;
+1D843;SIGNWRITING HAND-FIST INDEX THUMB HOOKED MIDDLE HINGED;So;0;L;;;;;N;;;;;
+1D844;SIGNWRITING HAND-FLAT FOUR FINGERS;So;0;L;;;;;N;;;;;
+1D845;SIGNWRITING HAND-FLAT FOUR FINGERS BENT;So;0;L;;;;;N;;;;;
+1D846;SIGNWRITING HAND-FLAT FOUR FINGERS HINGED;So;0;L;;;;;N;;;;;
+1D847;SIGNWRITING HAND-FLAT FOUR FINGERS CONJOINED;So;0;L;;;;;N;;;;;
+1D848;SIGNWRITING HAND-FLAT FOUR FINGERS CONJOINED SPLIT;So;0;L;;;;;N;;;;;
+1D849;SIGNWRITING HAND-CLAW FOUR FINGERS CONJOINED;So;0;L;;;;;N;;;;;
+1D84A;SIGNWRITING HAND-FIST FOUR FINGERS CONJOINED BENT;So;0;L;;;;;N;;;;;
+1D84B;SIGNWRITING HAND-HINGE FOUR FINGERS CONJOINED;So;0;L;;;;;N;;;;;
+1D84C;SIGNWRITING HAND-FLAT FIVE FINGERS SPREAD;So;0;L;;;;;N;;;;;
+1D84D;SIGNWRITING HAND-FLAT HEEL FIVE FINGERS SPREAD;So;0;L;;;;;N;;;;;
+1D84E;SIGNWRITING HAND-FLAT FIVE FINGERS SPREAD FOUR BENT;So;0;L;;;;;N;;;;;
+1D84F;SIGNWRITING HAND-FLAT HEEL FIVE FINGERS SPREAD FOUR BENT;So;0;L;;;;;N;;;;;
+1D850;SIGNWRITING HAND-FLAT FIVE FINGERS SPREAD BENT;So;0;L;;;;;N;;;;;
+1D851;SIGNWRITING HAND-FLAT HEEL FIVE FINGERS SPREAD BENT;So;0;L;;;;;N;;;;;
+1D852;SIGNWRITING HAND-FLAT FIVE FINGERS SPREAD THUMB FORWARD;So;0;L;;;;;N;;;;;
+1D853;SIGNWRITING HAND-CUP FIVE FINGERS SPREAD;So;0;L;;;;;N;;;;;
+1D854;SIGNWRITING HAND-CUP FIVE FINGERS SPREAD OPEN;So;0;L;;;;;N;;;;;
+1D855;SIGNWRITING HAND-HINGE FIVE FINGERS SPREAD OPEN;So;0;L;;;;;N;;;;;
+1D856;SIGNWRITING HAND-OVAL FIVE FINGERS SPREAD;So;0;L;;;;;N;;;;;
+1D857;SIGNWRITING HAND-FLAT FIVE FINGERS SPREAD HINGED;So;0;L;;;;;N;;;;;
+1D858;SIGNWRITING HAND-FLAT FIVE FINGERS SPREAD HINGED THUMB SIDE;So;0;L;;;;;N;;;;;
+1D859;SIGNWRITING HAND-FLAT FIVE FINGERS SPREAD HINGED NO THUMB;So;0;L;;;;;N;;;;;
+1D85A;SIGNWRITING HAND-FLAT;So;0;L;;;;;N;;;;;
+1D85B;SIGNWRITING HAND-FLAT BETWEEN PALM FACINGS;So;0;L;;;;;N;;;;;
+1D85C;SIGNWRITING HAND-FLAT HEEL;So;0;L;;;;;N;;;;;
+1D85D;SIGNWRITING HAND-FLAT THUMB SIDE;So;0;L;;;;;N;;;;;
+1D85E;SIGNWRITING HAND-FLAT HEEL THUMB SIDE;So;0;L;;;;;N;;;;;
+1D85F;SIGNWRITING HAND-FLAT THUMB BENT;So;0;L;;;;;N;;;;;
+1D860;SIGNWRITING HAND-FLAT THUMB FORWARD;So;0;L;;;;;N;;;;;
+1D861;SIGNWRITING HAND-FLAT SPLIT INDEX THUMB SIDE;So;0;L;;;;;N;;;;;
+1D862;SIGNWRITING HAND-FLAT SPLIT CENTRE;So;0;L;;;;;N;;;;;
+1D863;SIGNWRITING HAND-FLAT SPLIT CENTRE THUMB SIDE;So;0;L;;;;;N;;;;;
+1D864;SIGNWRITING HAND-FLAT SPLIT CENTRE THUMB SIDE BENT;So;0;L;;;;;N;;;;;
+1D865;SIGNWRITING HAND-FLAT SPLIT LITTLE;So;0;L;;;;;N;;;;;
+1D866;SIGNWRITING HAND-CLAW;So;0;L;;;;;N;;;;;
+1D867;SIGNWRITING HAND-CLAW THUMB SIDE;So;0;L;;;;;N;;;;;
+1D868;SIGNWRITING HAND-CLAW NO THUMB;So;0;L;;;;;N;;;;;
+1D869;SIGNWRITING HAND-CLAW THUMB FORWARD;So;0;L;;;;;N;;;;;
+1D86A;SIGNWRITING HAND-HOOK CURLICUE;So;0;L;;;;;N;;;;;
+1D86B;SIGNWRITING HAND-HOOK;So;0;L;;;;;N;;;;;
+1D86C;SIGNWRITING HAND-CUP OPEN;So;0;L;;;;;N;;;;;
+1D86D;SIGNWRITING HAND-CUP;So;0;L;;;;;N;;;;;
+1D86E;SIGNWRITING HAND-CUP OPEN THUMB SIDE;So;0;L;;;;;N;;;;;
+1D86F;SIGNWRITING HAND-CUP THUMB SIDE;So;0;L;;;;;N;;;;;
+1D870;SIGNWRITING HAND-CUP OPEN NO THUMB;So;0;L;;;;;N;;;;;
+1D871;SIGNWRITING HAND-CUP NO THUMB;So;0;L;;;;;N;;;;;
+1D872;SIGNWRITING HAND-CUP OPEN THUMB FORWARD;So;0;L;;;;;N;;;;;
+1D873;SIGNWRITING HAND-CUP THUMB FORWARD;So;0;L;;;;;N;;;;;
+1D874;SIGNWRITING HAND-CURLICUE OPEN;So;0;L;;;;;N;;;;;
+1D875;SIGNWRITING HAND-CURLICUE;So;0;L;;;;;N;;;;;
+1D876;SIGNWRITING HAND-CIRCLE;So;0;L;;;;;N;;;;;
+1D877;SIGNWRITING HAND-OVAL;So;0;L;;;;;N;;;;;
+1D878;SIGNWRITING HAND-OVAL THUMB SIDE;So;0;L;;;;;N;;;;;
+1D879;SIGNWRITING HAND-OVAL NO THUMB;So;0;L;;;;;N;;;;;
+1D87A;SIGNWRITING HAND-OVAL THUMB FORWARD;So;0;L;;;;;N;;;;;
+1D87B;SIGNWRITING HAND-HINGE OPEN;So;0;L;;;;;N;;;;;
+1D87C;SIGNWRITING HAND-HINGE OPEN THUMB FORWARD;So;0;L;;;;;N;;;;;
+1D87D;SIGNWRITING HAND-HINGE;So;0;L;;;;;N;;;;;
+1D87E;SIGNWRITING HAND-HINGE SMALL;So;0;L;;;;;N;;;;;
+1D87F;SIGNWRITING HAND-HINGE OPEN THUMB SIDE;So;0;L;;;;;N;;;;;
+1D880;SIGNWRITING HAND-HINGE THUMB SIDE;So;0;L;;;;;N;;;;;
+1D881;SIGNWRITING HAND-HINGE OPEN NO THUMB;So;0;L;;;;;N;;;;;
+1D882;SIGNWRITING HAND-HINGE NO THUMB;So;0;L;;;;;N;;;;;
+1D883;SIGNWRITING HAND-HINGE THUMB SIDE TOUCHING INDEX;So;0;L;;;;;N;;;;;
+1D884;SIGNWRITING HAND-HINGE THUMB BETWEEN MIDDLE RING;So;0;L;;;;;N;;;;;
+1D885;SIGNWRITING HAND-ANGLE;So;0;L;;;;;N;;;;;
+1D886;SIGNWRITING HAND-FIST INDEX MIDDLE RING;So;0;L;;;;;N;;;;;
+1D887;SIGNWRITING HAND-CIRCLE INDEX MIDDLE RING;So;0;L;;;;;N;;;;;
+1D888;SIGNWRITING HAND-HINGE INDEX MIDDLE RING;So;0;L;;;;;N;;;;;
+1D889;SIGNWRITING HAND-ANGLE INDEX MIDDLE RING;So;0;L;;;;;N;;;;;
+1D88A;SIGNWRITING HAND-HINGE LITTLE;So;0;L;;;;;N;;;;;
+1D88B;SIGNWRITING HAND-FIST INDEX MIDDLE RING BENT;So;0;L;;;;;N;;;;;
+1D88C;SIGNWRITING HAND-FIST INDEX MIDDLE RING CONJOINED;So;0;L;;;;;N;;;;;
+1D88D;SIGNWRITING HAND-HINGE INDEX MIDDLE RING CONJOINED;So;0;L;;;;;N;;;;;
+1D88E;SIGNWRITING HAND-FIST LITTLE DOWN;So;0;L;;;;;N;;;;;
+1D88F;SIGNWRITING HAND-FIST LITTLE DOWN RIPPLE STRAIGHT;So;0;L;;;;;N;;;;;
+1D890;SIGNWRITING HAND-FIST LITTLE DOWN RIPPLE CURVED;So;0;L;;;;;N;;;;;
+1D891;SIGNWRITING HAND-FIST LITTLE DOWN OTHERS CIRCLED;So;0;L;;;;;N;;;;;
+1D892;SIGNWRITING HAND-FIST LITTLE UP;So;0;L;;;;;N;;;;;
+1D893;SIGNWRITING HAND-FIST THUMB UNDER LITTLE UP;So;0;L;;;;;N;;;;;
+1D894;SIGNWRITING HAND-CIRCLE LITTLE UP;So;0;L;;;;;N;;;;;
+1D895;SIGNWRITING HAND-OVAL LITTLE UP;So;0;L;;;;;N;;;;;
+1D896;SIGNWRITING HAND-ANGLE LITTLE UP;So;0;L;;;;;N;;;;;
+1D897;SIGNWRITING HAND-FIST LITTLE RAISED KNUCKLE;So;0;L;;;;;N;;;;;
+1D898;SIGNWRITING HAND-FIST LITTLE BENT;So;0;L;;;;;N;;;;;
+1D899;SIGNWRITING HAND-FIST LITTLE TOUCHES THUMB;So;0;L;;;;;N;;;;;
+1D89A;SIGNWRITING HAND-FIST LITTLE THUMB;So;0;L;;;;;N;;;;;
+1D89B;SIGNWRITING HAND-HINGE LITTLE THUMB;So;0;L;;;;;N;;;;;
+1D89C;SIGNWRITING HAND-FIST LITTLE INDEX THUMB;So;0;L;;;;;N;;;;;
+1D89D;SIGNWRITING HAND-HINGE LITTLE INDEX THUMB;So;0;L;;;;;N;;;;;
+1D89E;SIGNWRITING HAND-ANGLE LITTLE INDEX THUMB INDEX THUMB OUT;So;0;L;;;;;N;;;;;
+1D89F;SIGNWRITING HAND-ANGLE LITTLE INDEX THUMB INDEX THUMB;So;0;L;;;;;N;;;;;
+1D8A0;SIGNWRITING HAND-FIST LITTLE INDEX;So;0;L;;;;;N;;;;;
+1D8A1;SIGNWRITING HAND-CIRCLE LITTLE INDEX;So;0;L;;;;;N;;;;;
+1D8A2;SIGNWRITING HAND-HINGE LITTLE INDEX;So;0;L;;;;;N;;;;;
+1D8A3;SIGNWRITING HAND-ANGLE LITTLE INDEX;So;0;L;;;;;N;;;;;
+1D8A4;SIGNWRITING HAND-FIST INDEX MIDDLE LITTLE;So;0;L;;;;;N;;;;;
+1D8A5;SIGNWRITING HAND-CIRCLE INDEX MIDDLE LITTLE;So;0;L;;;;;N;;;;;
+1D8A6;SIGNWRITING HAND-HINGE INDEX MIDDLE LITTLE;So;0;L;;;;;N;;;;;
+1D8A7;SIGNWRITING HAND-HINGE RING;So;0;L;;;;;N;;;;;
+1D8A8;SIGNWRITING HAND-ANGLE INDEX MIDDLE LITTLE;So;0;L;;;;;N;;;;;
+1D8A9;SIGNWRITING HAND-FIST INDEX MIDDLE CROSS LITTLE;So;0;L;;;;;N;;;;;
+1D8AA;SIGNWRITING HAND-CIRCLE INDEX MIDDLE CROSS LITTLE;So;0;L;;;;;N;;;;;
+1D8AB;SIGNWRITING HAND-FIST RING DOWN;So;0;L;;;;;N;;;;;
+1D8AC;SIGNWRITING HAND-HINGE RING DOWN INDEX THUMB HOOK MIDDLE;So;0;L;;;;;N;;;;;
+1D8AD;SIGNWRITING HAND-ANGLE RING DOWN MIDDLE THUMB INDEX CROSS;So;0;L;;;;;N;;;;;
+1D8AE;SIGNWRITING HAND-FIST RING UP;So;0;L;;;;;N;;;;;
+1D8AF;SIGNWRITING HAND-FIST RING RAISED KNUCKLE;So;0;L;;;;;N;;;;;
+1D8B0;SIGNWRITING HAND-FIST RING LITTLE;So;0;L;;;;;N;;;;;
+1D8B1;SIGNWRITING HAND-CIRCLE RING LITTLE;So;0;L;;;;;N;;;;;
+1D8B2;SIGNWRITING HAND-OVAL RING LITTLE;So;0;L;;;;;N;;;;;
+1D8B3;SIGNWRITING HAND-ANGLE RING LITTLE;So;0;L;;;;;N;;;;;
+1D8B4;SIGNWRITING HAND-FIST RING MIDDLE;So;0;L;;;;;N;;;;;
+1D8B5;SIGNWRITING HAND-FIST RING MIDDLE CONJOINED;So;0;L;;;;;N;;;;;
+1D8B6;SIGNWRITING HAND-FIST RING MIDDLE RAISED KNUCKLES;So;0;L;;;;;N;;;;;
+1D8B7;SIGNWRITING HAND-FIST RING INDEX;So;0;L;;;;;N;;;;;
+1D8B8;SIGNWRITING HAND-FIST RING THUMB;So;0;L;;;;;N;;;;;
+1D8B9;SIGNWRITING HAND-HOOK RING THUMB;So;0;L;;;;;N;;;;;
+1D8BA;SIGNWRITING HAND-FIST INDEX RING LITTLE;So;0;L;;;;;N;;;;;
+1D8BB;SIGNWRITING HAND-CIRCLE INDEX RING LITTLE;So;0;L;;;;;N;;;;;
+1D8BC;SIGNWRITING HAND-CURLICUE INDEX RING LITTLE ON;So;0;L;;;;;N;;;;;
+1D8BD;SIGNWRITING HAND-HOOK INDEX RING LITTLE OUT;So;0;L;;;;;N;;;;;
+1D8BE;SIGNWRITING HAND-HOOK INDEX RING LITTLE IN;So;0;L;;;;;N;;;;;
+1D8BF;SIGNWRITING HAND-HOOK INDEX RING LITTLE UNDER;So;0;L;;;;;N;;;;;
+1D8C0;SIGNWRITING HAND-CUP INDEX RING LITTLE;So;0;L;;;;;N;;;;;
+1D8C1;SIGNWRITING HAND-HINGE INDEX RING LITTLE;So;0;L;;;;;N;;;;;
+1D8C2;SIGNWRITING HAND-ANGLE INDEX RING LITTLE OUT;So;0;L;;;;;N;;;;;
+1D8C3;SIGNWRITING HAND-ANGLE INDEX RING LITTLE;So;0;L;;;;;N;;;;;
+1D8C4;SIGNWRITING HAND-FIST MIDDLE DOWN;So;0;L;;;;;N;;;;;
+1D8C5;SIGNWRITING HAND-HINGE MIDDLE;So;0;L;;;;;N;;;;;
+1D8C6;SIGNWRITING HAND-FIST MIDDLE UP;So;0;L;;;;;N;;;;;
+1D8C7;SIGNWRITING HAND-CIRCLE MIDDLE UP;So;0;L;;;;;N;;;;;
+1D8C8;SIGNWRITING HAND-FIST MIDDLE RAISED KNUCKLE;So;0;L;;;;;N;;;;;
+1D8C9;SIGNWRITING HAND-FIST MIDDLE UP THUMB SIDE;So;0;L;;;;;N;;;;;
+1D8CA;SIGNWRITING HAND-HOOK MIDDLE THUMB;So;0;L;;;;;N;;;;;
+1D8CB;SIGNWRITING HAND-FIST MIDDLE THUMB LITTLE;So;0;L;;;;;N;;;;;
+1D8CC;SIGNWRITING HAND-FIST MIDDLE LITTLE;So;0;L;;;;;N;;;;;
+1D8CD;SIGNWRITING HAND-FIST MIDDLE RING LITTLE;So;0;L;;;;;N;;;;;
+1D8CE;SIGNWRITING HAND-CIRCLE MIDDLE RING LITTLE;So;0;L;;;;;N;;;;;
+1D8CF;SIGNWRITING HAND-CURLICUE MIDDLE RING LITTLE ON;So;0;L;;;;;N;;;;;
+1D8D0;SIGNWRITING HAND-CUP MIDDLE RING LITTLE;So;0;L;;;;;N;;;;;
+1D8D1;SIGNWRITING HAND-HINGE MIDDLE RING LITTLE;So;0;L;;;;;N;;;;;
+1D8D2;SIGNWRITING HAND-ANGLE MIDDLE RING LITTLE OUT;So;0;L;;;;;N;;;;;
+1D8D3;SIGNWRITING HAND-ANGLE MIDDLE RING LITTLE IN;So;0;L;;;;;N;;;;;
+1D8D4;SIGNWRITING HAND-ANGLE MIDDLE RING LITTLE;So;0;L;;;;;N;;;;;
+1D8D5;SIGNWRITING HAND-CIRCLE MIDDLE RING LITTLE BENT;So;0;L;;;;;N;;;;;
+1D8D6;SIGNWRITING HAND-CLAW MIDDLE RING LITTLE CONJOINED;So;0;L;;;;;N;;;;;
+1D8D7;SIGNWRITING HAND-CLAW MIDDLE RING LITTLE CONJOINED SIDE;So;0;L;;;;;N;;;;;
+1D8D8;SIGNWRITING HAND-HOOK MIDDLE RING LITTLE CONJOINED OUT;So;0;L;;;;;N;;;;;
+1D8D9;SIGNWRITING HAND-HOOK MIDDLE RING LITTLE CONJOINED IN;So;0;L;;;;;N;;;;;
+1D8DA;SIGNWRITING HAND-HOOK MIDDLE RING LITTLE CONJOINED;So;0;L;;;;;N;;;;;
+1D8DB;SIGNWRITING HAND-HINGE INDEX HINGED;So;0;L;;;;;N;;;;;
+1D8DC;SIGNWRITING HAND-FIST INDEX THUMB SIDE;So;0;L;;;;;N;;;;;
+1D8DD;SIGNWRITING HAND-HINGE INDEX THUMB SIDE;So;0;L;;;;;N;;;;;
+1D8DE;SIGNWRITING HAND-FIST INDEX THUMB SIDE THUMB DIAGONAL;So;0;L;;;;;N;;;;;
+1D8DF;SIGNWRITING HAND-FIST INDEX THUMB SIDE THUMB CONJOINED;So;0;L;;;;;N;;;;;
+1D8E0;SIGNWRITING HAND-FIST INDEX THUMB SIDE THUMB BENT;So;0;L;;;;;N;;;;;
+1D8E1;SIGNWRITING HAND-FIST INDEX THUMB SIDE INDEX BENT;So;0;L;;;;;N;;;;;
+1D8E2;SIGNWRITING HAND-FIST INDEX THUMB SIDE BOTH BENT;So;0;L;;;;;N;;;;;
+1D8E3;SIGNWRITING HAND-FIST INDEX THUMB SIDE INDEX HINGE;So;0;L;;;;;N;;;;;
+1D8E4;SIGNWRITING HAND-FIST INDEX THUMB FORWARD INDEX STRAIGHT;So;0;L;;;;;N;;;;;
+1D8E5;SIGNWRITING HAND-FIST INDEX THUMB FORWARD INDEX BENT;So;0;L;;;;;N;;;;;
+1D8E6;SIGNWRITING HAND-FIST INDEX THUMB HOOK;So;0;L;;;;;N;;;;;
+1D8E7;SIGNWRITING HAND-FIST INDEX THUMB CURLICUE;So;0;L;;;;;N;;;;;
+1D8E8;SIGNWRITING HAND-FIST INDEX THUMB CURVE THUMB INSIDE;So;0;L;;;;;N;;;;;
+1D8E9;SIGNWRITING HAND-CLAW INDEX THUMB CURVE THUMB INSIDE;So;0;L;;;;;N;;;;;
+1D8EA;SIGNWRITING HAND-FIST INDEX THUMB CURVE THUMB UNDER;So;0;L;;;;;N;;;;;
+1D8EB;SIGNWRITING HAND-FIST INDEX THUMB CIRCLE;So;0;L;;;;;N;;;;;
+1D8EC;SIGNWRITING HAND-CUP INDEX THUMB;So;0;L;;;;;N;;;;;
+1D8ED;SIGNWRITING HAND-CUP INDEX THUMB OPEN;So;0;L;;;;;N;;;;;
+1D8EE;SIGNWRITING HAND-HINGE INDEX THUMB OPEN;So;0;L;;;;;N;;;;;
+1D8EF;SIGNWRITING HAND-HINGE INDEX THUMB LARGE;So;0;L;;;;;N;;;;;
+1D8F0;SIGNWRITING HAND-HINGE INDEX THUMB;So;0;L;;;;;N;;;;;
+1D8F1;SIGNWRITING HAND-HINGE INDEX THUMB SMALL;So;0;L;;;;;N;;;;;
+1D8F2;SIGNWRITING HAND-ANGLE INDEX THUMB OUT;So;0;L;;;;;N;;;;;
+1D8F3;SIGNWRITING HAND-ANGLE INDEX THUMB IN;So;0;L;;;;;N;;;;;
+1D8F4;SIGNWRITING HAND-ANGLE INDEX THUMB;So;0;L;;;;;N;;;;;
+1D8F5;SIGNWRITING HAND-FIST THUMB;So;0;L;;;;;N;;;;;
+1D8F6;SIGNWRITING HAND-FIST THUMB HEEL;So;0;L;;;;;N;;;;;
+1D8F7;SIGNWRITING HAND-FIST THUMB SIDE DIAGONAL;So;0;L;;;;;N;;;;;
+1D8F8;SIGNWRITING HAND-FIST THUMB SIDE CONJOINED;So;0;L;;;;;N;;;;;
+1D8F9;SIGNWRITING HAND-FIST THUMB SIDE BENT;So;0;L;;;;;N;;;;;
+1D8FA;SIGNWRITING HAND-FIST THUMB FORWARD;So;0;L;;;;;N;;;;;
+1D8FB;SIGNWRITING HAND-FIST THUMB BETWEEN INDEX MIDDLE;So;0;L;;;;;N;;;;;
+1D8FC;SIGNWRITING HAND-FIST THUMB BETWEEN MIDDLE RING;So;0;L;;;;;N;;;;;
+1D8FD;SIGNWRITING HAND-FIST THUMB BETWEEN RING LITTLE;So;0;L;;;;;N;;;;;
+1D8FE;SIGNWRITING HAND-FIST THUMB UNDER TWO FINGERS;So;0;L;;;;;N;;;;;
+1D8FF;SIGNWRITING HAND-FIST THUMB OVER TWO FINGERS;So;0;L;;;;;N;;;;;
+1D900;SIGNWRITING HAND-FIST THUMB UNDER THREE FINGERS;So;0;L;;;;;N;;;;;
+1D901;SIGNWRITING HAND-FIST THUMB UNDER FOUR FINGERS;So;0;L;;;;;N;;;;;
+1D902;SIGNWRITING HAND-FIST THUMB OVER FOUR RAISED KNUCKLES;So;0;L;;;;;N;;;;;
+1D903;SIGNWRITING HAND-FIST;So;0;L;;;;;N;;;;;
+1D904;SIGNWRITING HAND-FIST HEEL;So;0;L;;;;;N;;;;;
+1D905;SIGNWRITING TOUCH SINGLE;So;0;L;;;;;N;;;;;
+1D906;SIGNWRITING TOUCH MULTIPLE;So;0;L;;;;;N;;;;;
+1D907;SIGNWRITING TOUCH BETWEEN;So;0;L;;;;;N;;;;;
+1D908;SIGNWRITING GRASP SINGLE;So;0;L;;;;;N;;;;;
+1D909;SIGNWRITING GRASP MULTIPLE;So;0;L;;;;;N;;;;;
+1D90A;SIGNWRITING GRASP BETWEEN;So;0;L;;;;;N;;;;;
+1D90B;SIGNWRITING STRIKE SINGLE;So;0;L;;;;;N;;;;;
+1D90C;SIGNWRITING STRIKE MULTIPLE;So;0;L;;;;;N;;;;;
+1D90D;SIGNWRITING STRIKE BETWEEN;So;0;L;;;;;N;;;;;
+1D90E;SIGNWRITING BRUSH SINGLE;So;0;L;;;;;N;;;;;
+1D90F;SIGNWRITING BRUSH MULTIPLE;So;0;L;;;;;N;;;;;
+1D910;SIGNWRITING BRUSH BETWEEN;So;0;L;;;;;N;;;;;
+1D911;SIGNWRITING RUB SINGLE;So;0;L;;;;;N;;;;;
+1D912;SIGNWRITING RUB MULTIPLE;So;0;L;;;;;N;;;;;
+1D913;SIGNWRITING RUB BETWEEN;So;0;L;;;;;N;;;;;
+1D914;SIGNWRITING SURFACE SYMBOLS;So;0;L;;;;;N;;;;;
+1D915;SIGNWRITING SURFACE BETWEEN;So;0;L;;;;;N;;;;;
+1D916;SIGNWRITING SQUEEZE LARGE SINGLE;So;0;L;;;;;N;;;;;
+1D917;SIGNWRITING SQUEEZE SMALL SINGLE;So;0;L;;;;;N;;;;;
+1D918;SIGNWRITING SQUEEZE LARGE MULTIPLE;So;0;L;;;;;N;;;;;
+1D919;SIGNWRITING SQUEEZE SMALL MULTIPLE;So;0;L;;;;;N;;;;;
+1D91A;SIGNWRITING SQUEEZE SEQUENTIAL;So;0;L;;;;;N;;;;;
+1D91B;SIGNWRITING FLICK LARGE SINGLE;So;0;L;;;;;N;;;;;
+1D91C;SIGNWRITING FLICK SMALL SINGLE;So;0;L;;;;;N;;;;;
+1D91D;SIGNWRITING FLICK LARGE MULTIPLE;So;0;L;;;;;N;;;;;
+1D91E;SIGNWRITING FLICK SMALL MULTIPLE;So;0;L;;;;;N;;;;;
+1D91F;SIGNWRITING FLICK SEQUENTIAL;So;0;L;;;;;N;;;;;
+1D920;SIGNWRITING SQUEEZE FLICK ALTERNATING;So;0;L;;;;;N;;;;;
+1D921;SIGNWRITING MOVEMENT-HINGE UP DOWN LARGE;So;0;L;;;;;N;;;;;
+1D922;SIGNWRITING MOVEMENT-HINGE UP DOWN SMALL;So;0;L;;;;;N;;;;;
+1D923;SIGNWRITING MOVEMENT-HINGE UP SEQUENTIAL;So;0;L;;;;;N;;;;;
+1D924;SIGNWRITING MOVEMENT-HINGE DOWN SEQUENTIAL;So;0;L;;;;;N;;;;;
+1D925;SIGNWRITING MOVEMENT-HINGE UP DOWN ALTERNATING LARGE;So;0;L;;;;;N;;;;;
+1D926;SIGNWRITING MOVEMENT-HINGE UP DOWN ALTERNATING SMALL;So;0;L;;;;;N;;;;;
+1D927;SIGNWRITING MOVEMENT-HINGE SIDE TO SIDE SCISSORS;So;0;L;;;;;N;;;;;
+1D928;SIGNWRITING MOVEMENT-WALLPLANE FINGER CONTACT;So;0;L;;;;;N;;;;;
+1D929;SIGNWRITING MOVEMENT-FLOORPLANE FINGER CONTACT;So;0;L;;;;;N;;;;;
+1D92A;SIGNWRITING MOVEMENT-WALLPLANE SINGLE STRAIGHT SMALL;So;0;L;;;;;N;;;;;
+1D92B;SIGNWRITING MOVEMENT-WALLPLANE SINGLE STRAIGHT MEDIUM;So;0;L;;;;;N;;;;;
+1D92C;SIGNWRITING MOVEMENT-WALLPLANE SINGLE STRAIGHT LARGE;So;0;L;;;;;N;;;;;
+1D92D;SIGNWRITING MOVEMENT-WALLPLANE SINGLE STRAIGHT LARGEST;So;0;L;;;;;N;;;;;
+1D92E;SIGNWRITING MOVEMENT-WALLPLANE SINGLE WRIST FLEX;So;0;L;;;;;N;;;;;
+1D92F;SIGNWRITING MOVEMENT-WALLPLANE DOUBLE STRAIGHT;So;0;L;;;;;N;;;;;
+1D930;SIGNWRITING MOVEMENT-WALLPLANE DOUBLE WRIST FLEX;So;0;L;;;;;N;;;;;
+1D931;SIGNWRITING MOVEMENT-WALLPLANE DOUBLE ALTERNATING;So;0;L;;;;;N;;;;;
+1D932;SIGNWRITING MOVEMENT-WALLPLANE DOUBLE ALTERNATING WRIST FLEX;So;0;L;;;;;N;;;;;
+1D933;SIGNWRITING MOVEMENT-WALLPLANE CROSS;So;0;L;;;;;N;;;;;
+1D934;SIGNWRITING MOVEMENT-WALLPLANE TRIPLE STRAIGHT MOVEMENT;So;0;L;;;;;N;;;;;
+1D935;SIGNWRITING MOVEMENT-WALLPLANE TRIPLE WRIST FLEX;So;0;L;;;;;N;;;;;
+1D936;SIGNWRITING MOVEMENT-WALLPLANE TRIPLE ALTERNATING;So;0;L;;;;;N;;;;;
+1D937;SIGNWRITING MOVEMENT-WALLPLANE TRIPLE ALTERNATING WRIST FLEX;So;0;L;;;;;N;;;;;
+1D938;SIGNWRITING MOVEMENT-WALLPLANE BEND SMALL;So;0;L;;;;;N;;;;;
+1D939;SIGNWRITING MOVEMENT-WALLPLANE BEND MEDIUM;So;0;L;;;;;N;;;;;
+1D93A;SIGNWRITING MOVEMENT-WALLPLANE BEND LARGE;So;0;L;;;;;N;;;;;
+1D93B;SIGNWRITING MOVEMENT-WALLPLANE CORNER SMALL;So;0;L;;;;;N;;;;;
+1D93C;SIGNWRITING MOVEMENT-WALLPLANE CORNER MEDIUM;So;0;L;;;;;N;;;;;
+1D93D;SIGNWRITING MOVEMENT-WALLPLANE CORNER LARGE;So;0;L;;;;;N;;;;;
+1D93E;SIGNWRITING MOVEMENT-WALLPLANE CORNER ROTATION;So;0;L;;;;;N;;;;;
+1D93F;SIGNWRITING MOVEMENT-WALLPLANE CHECK SMALL;So;0;L;;;;;N;;;;;
+1D940;SIGNWRITING MOVEMENT-WALLPLANE CHECK MEDIUM;So;0;L;;;;;N;;;;;
+1D941;SIGNWRITING MOVEMENT-WALLPLANE CHECK LARGE;So;0;L;;;;;N;;;;;
+1D942;SIGNWRITING MOVEMENT-WALLPLANE BOX SMALL;So;0;L;;;;;N;;;;;
+1D943;SIGNWRITING MOVEMENT-WALLPLANE BOX MEDIUM;So;0;L;;;;;N;;;;;
+1D944;SIGNWRITING MOVEMENT-WALLPLANE BOX LARGE;So;0;L;;;;;N;;;;;
+1D945;SIGNWRITING MOVEMENT-WALLPLANE ZIGZAG SMALL;So;0;L;;;;;N;;;;;
+1D946;SIGNWRITING MOVEMENT-WALLPLANE ZIGZAG MEDIUM;So;0;L;;;;;N;;;;;
+1D947;SIGNWRITING MOVEMENT-WALLPLANE ZIGZAG LARGE;So;0;L;;;;;N;;;;;
+1D948;SIGNWRITING MOVEMENT-WALLPLANE PEAKS SMALL;So;0;L;;;;;N;;;;;
+1D949;SIGNWRITING MOVEMENT-WALLPLANE PEAKS MEDIUM;So;0;L;;;;;N;;;;;
+1D94A;SIGNWRITING MOVEMENT-WALLPLANE PEAKS LARGE;So;0;L;;;;;N;;;;;
+1D94B;SIGNWRITING TRAVEL-WALLPLANE ROTATION-WALLPLANE SINGLE;So;0;L;;;;;N;;;;;
+1D94C;SIGNWRITING TRAVEL-WALLPLANE ROTATION-WALLPLANE DOUBLE;So;0;L;;;;;N;;;;;
+1D94D;SIGNWRITING TRAVEL-WALLPLANE ROTATION-WALLPLANE ALTERNATING;So;0;L;;;;;N;;;;;
+1D94E;SIGNWRITING TRAVEL-WALLPLANE ROTATION-FLOORPLANE SINGLE;So;0;L;;;;;N;;;;;
+1D94F;SIGNWRITING TRAVEL-WALLPLANE ROTATION-FLOORPLANE DOUBLE;So;0;L;;;;;N;;;;;
+1D950;SIGNWRITING TRAVEL-WALLPLANE ROTATION-FLOORPLANE ALTERNATING;So;0;L;;;;;N;;;;;
+1D951;SIGNWRITING TRAVEL-WALLPLANE SHAKING;So;0;L;;;;;N;;;;;
+1D952;SIGNWRITING TRAVEL-WALLPLANE ARM SPIRAL SINGLE;So;0;L;;;;;N;;;;;
+1D953;SIGNWRITING TRAVEL-WALLPLANE ARM SPIRAL DOUBLE;So;0;L;;;;;N;;;;;
+1D954;SIGNWRITING TRAVEL-WALLPLANE ARM SPIRAL TRIPLE;So;0;L;;;;;N;;;;;
+1D955;SIGNWRITING MOVEMENT-DIAGONAL AWAY SMALL;So;0;L;;;;;N;;;;;
+1D956;SIGNWRITING MOVEMENT-DIAGONAL AWAY MEDIUM;So;0;L;;;;;N;;;;;
+1D957;SIGNWRITING MOVEMENT-DIAGONAL AWAY LARGE;So;0;L;;;;;N;;;;;
+1D958;SIGNWRITING MOVEMENT-DIAGONAL AWAY LARGEST;So;0;L;;;;;N;;;;;
+1D959;SIGNWRITING MOVEMENT-DIAGONAL TOWARDS SMALL;So;0;L;;;;;N;;;;;
+1D95A;SIGNWRITING MOVEMENT-DIAGONAL TOWARDS MEDIUM;So;0;L;;;;;N;;;;;
+1D95B;SIGNWRITING MOVEMENT-DIAGONAL TOWARDS LARGE;So;0;L;;;;;N;;;;;
+1D95C;SIGNWRITING MOVEMENT-DIAGONAL TOWARDS LARGEST;So;0;L;;;;;N;;;;;
+1D95D;SIGNWRITING MOVEMENT-DIAGONAL BETWEEN AWAY SMALL;So;0;L;;;;;N;;;;;
+1D95E;SIGNWRITING MOVEMENT-DIAGONAL BETWEEN AWAY MEDIUM;So;0;L;;;;;N;;;;;
+1D95F;SIGNWRITING MOVEMENT-DIAGONAL BETWEEN AWAY LARGE;So;0;L;;;;;N;;;;;
+1D960;SIGNWRITING MOVEMENT-DIAGONAL BETWEEN AWAY LARGEST;So;0;L;;;;;N;;;;;
+1D961;SIGNWRITING MOVEMENT-DIAGONAL BETWEEN TOWARDS SMALL;So;0;L;;;;;N;;;;;
+1D962;SIGNWRITING MOVEMENT-DIAGONAL BETWEEN TOWARDS MEDIUM;So;0;L;;;;;N;;;;;
+1D963;SIGNWRITING MOVEMENT-DIAGONAL BETWEEN TOWARDS LARGE;So;0;L;;;;;N;;;;;
+1D964;SIGNWRITING MOVEMENT-DIAGONAL BETWEEN TOWARDS LARGEST;So;0;L;;;;;N;;;;;
+1D965;SIGNWRITING MOVEMENT-FLOORPLANE SINGLE STRAIGHT SMALL;So;0;L;;;;;N;;;;;
+1D966;SIGNWRITING MOVEMENT-FLOORPLANE SINGLE STRAIGHT MEDIUM;So;0;L;;;;;N;;;;;
+1D967;SIGNWRITING MOVEMENT-FLOORPLANE SINGLE STRAIGHT LARGE;So;0;L;;;;;N;;;;;
+1D968;SIGNWRITING MOVEMENT-FLOORPLANE SINGLE STRAIGHT LARGEST;So;0;L;;;;;N;;;;;
+1D969;SIGNWRITING MOVEMENT-FLOORPLANE SINGLE WRIST FLEX;So;0;L;;;;;N;;;;;
+1D96A;SIGNWRITING MOVEMENT-FLOORPLANE DOUBLE STRAIGHT;So;0;L;;;;;N;;;;;
+1D96B;SIGNWRITING MOVEMENT-FLOORPLANE DOUBLE WRIST FLEX;So;0;L;;;;;N;;;;;
+1D96C;SIGNWRITING MOVEMENT-FLOORPLANE DOUBLE ALTERNATING;So;0;L;;;;;N;;;;;
+1D96D;SIGNWRITING MOVEMENT-FLOORPLANE DOUBLE ALTERNATING WRIST FLEX;So;0;L;;;;;N;;;;;
+1D96E;SIGNWRITING MOVEMENT-FLOORPLANE CROSS;So;0;L;;;;;N;;;;;
+1D96F;SIGNWRITING MOVEMENT-FLOORPLANE TRIPLE STRAIGHT MOVEMENT;So;0;L;;;;;N;;;;;
+1D970;SIGNWRITING MOVEMENT-FLOORPLANE TRIPLE WRIST FLEX;So;0;L;;;;;N;;;;;
+1D971;SIGNWRITING MOVEMENT-FLOORPLANE TRIPLE ALTERNATING MOVEMENT;So;0;L;;;;;N;;;;;
+1D972;SIGNWRITING MOVEMENT-FLOORPLANE TRIPLE ALTERNATING WRIST FLEX;So;0;L;;;;;N;;;;;
+1D973;SIGNWRITING MOVEMENT-FLOORPLANE BEND;So;0;L;;;;;N;;;;;
+1D974;SIGNWRITING MOVEMENT-FLOORPLANE CORNER SMALL;So;0;L;;;;;N;;;;;
+1D975;SIGNWRITING MOVEMENT-FLOORPLANE CORNER MEDIUM;So;0;L;;;;;N;;;;;
+1D976;SIGNWRITING MOVEMENT-FLOORPLANE CORNER LARGE;So;0;L;;;;;N;;;;;
+1D977;SIGNWRITING MOVEMENT-FLOORPLANE CHECK;So;0;L;;;;;N;;;;;
+1D978;SIGNWRITING MOVEMENT-FLOORPLANE BOX SMALL;So;0;L;;;;;N;;;;;
+1D979;SIGNWRITING MOVEMENT-FLOORPLANE BOX MEDIUM;So;0;L;;;;;N;;;;;
+1D97A;SIGNWRITING MOVEMENT-FLOORPLANE BOX LARGE;So;0;L;;;;;N;;;;;
+1D97B;SIGNWRITING MOVEMENT-FLOORPLANE ZIGZAG SMALL;So;0;L;;;;;N;;;;;
+1D97C;SIGNWRITING MOVEMENT-FLOORPLANE ZIGZAG MEDIUM;So;0;L;;;;;N;;;;;
+1D97D;SIGNWRITING MOVEMENT-FLOORPLANE ZIGZAG LARGE;So;0;L;;;;;N;;;;;
+1D97E;SIGNWRITING MOVEMENT-FLOORPLANE PEAKS SMALL;So;0;L;;;;;N;;;;;
+1D97F;SIGNWRITING MOVEMENT-FLOORPLANE PEAKS MEDIUM;So;0;L;;;;;N;;;;;
+1D980;SIGNWRITING MOVEMENT-FLOORPLANE PEAKS LARGE;So;0;L;;;;;N;;;;;
+1D981;SIGNWRITING TRAVEL-FLOORPLANE ROTATION-FLOORPLANE SINGLE;So;0;L;;;;;N;;;;;
+1D982;SIGNWRITING TRAVEL-FLOORPLANE ROTATION-FLOORPLANE DOUBLE;So;0;L;;;;;N;;;;;
+1D983;SIGNWRITING TRAVEL-FLOORPLANE ROTATION-FLOORPLANE ALTERNATING;So;0;L;;;;;N;;;;;
+1D984;SIGNWRITING TRAVEL-FLOORPLANE ROTATION-WALLPLANE SINGLE;So;0;L;;;;;N;;;;;
+1D985;SIGNWRITING TRAVEL-FLOORPLANE ROTATION-WALLPLANE DOUBLE;So;0;L;;;;;N;;;;;
+1D986;SIGNWRITING TRAVEL-FLOORPLANE ROTATION-WALLPLANE ALTERNATING;So;0;L;;;;;N;;;;;
+1D987;SIGNWRITING TRAVEL-FLOORPLANE SHAKING;So;0;L;;;;;N;;;;;
+1D988;SIGNWRITING MOVEMENT-WALLPLANE CURVE QUARTER SMALL;So;0;L;;;;;N;;;;;
+1D989;SIGNWRITING MOVEMENT-WALLPLANE CURVE QUARTER MEDIUM;So;0;L;;;;;N;;;;;
+1D98A;SIGNWRITING MOVEMENT-WALLPLANE CURVE QUARTER LARGE;So;0;L;;;;;N;;;;;
+1D98B;SIGNWRITING MOVEMENT-WALLPLANE CURVE QUARTER LARGEST;So;0;L;;;;;N;;;;;
+1D98C;SIGNWRITING MOVEMENT-WALLPLANE CURVE HALF-CIRCLE SMALL;So;0;L;;;;;N;;;;;
+1D98D;SIGNWRITING MOVEMENT-WALLPLANE CURVE HALF-CIRCLE MEDIUM;So;0;L;;;;;N;;;;;
+1D98E;SIGNWRITING MOVEMENT-WALLPLANE CURVE HALF-CIRCLE LARGE;So;0;L;;;;;N;;;;;
+1D98F;SIGNWRITING MOVEMENT-WALLPLANE CURVE HALF-CIRCLE LARGEST;So;0;L;;;;;N;;;;;
+1D990;SIGNWRITING MOVEMENT-WALLPLANE CURVE THREE-QUARTER CIRCLE SMALL;So;0;L;;;;;N;;;;;
+1D991;SIGNWRITING MOVEMENT-WALLPLANE CURVE THREE-QUARTER CIRCLE MEDIUM;So;0;L;;;;;N;;;;;
+1D992;SIGNWRITING MOVEMENT-WALLPLANE HUMP SMALL;So;0;L;;;;;N;;;;;
+1D993;SIGNWRITING MOVEMENT-WALLPLANE HUMP MEDIUM;So;0;L;;;;;N;;;;;
+1D994;SIGNWRITING MOVEMENT-WALLPLANE HUMP LARGE;So;0;L;;;;;N;;;;;
+1D995;SIGNWRITING MOVEMENT-WALLPLANE LOOP SMALL;So;0;L;;;;;N;;;;;
+1D996;SIGNWRITING MOVEMENT-WALLPLANE LOOP MEDIUM;So;0;L;;;;;N;;;;;
+1D997;SIGNWRITING MOVEMENT-WALLPLANE LOOP LARGE;So;0;L;;;;;N;;;;;
+1D998;SIGNWRITING MOVEMENT-WALLPLANE LOOP SMALL DOUBLE;So;0;L;;;;;N;;;;;
+1D999;SIGNWRITING MOVEMENT-WALLPLANE WAVE CURVE DOUBLE SMALL;So;0;L;;;;;N;;;;;
+1D99A;SIGNWRITING MOVEMENT-WALLPLANE WAVE CURVE DOUBLE MEDIUM;So;0;L;;;;;N;;;;;
+1D99B;SIGNWRITING MOVEMENT-WALLPLANE WAVE CURVE DOUBLE LARGE;So;0;L;;;;;N;;;;;
+1D99C;SIGNWRITING MOVEMENT-WALLPLANE WAVE CURVE TRIPLE SMALL;So;0;L;;;;;N;;;;;
+1D99D;SIGNWRITING MOVEMENT-WALLPLANE WAVE CURVE TRIPLE MEDIUM;So;0;L;;;;;N;;;;;
+1D99E;SIGNWRITING MOVEMENT-WALLPLANE WAVE CURVE TRIPLE LARGE;So;0;L;;;;;N;;;;;
+1D99F;SIGNWRITING MOVEMENT-WALLPLANE CURVE THEN STRAIGHT;So;0;L;;;;;N;;;;;
+1D9A0;SIGNWRITING MOVEMENT-WALLPLANE CURVED CROSS SMALL;So;0;L;;;;;N;;;;;
+1D9A1;SIGNWRITING MOVEMENT-WALLPLANE CURVED CROSS MEDIUM;So;0;L;;;;;N;;;;;
+1D9A2;SIGNWRITING ROTATION-WALLPLANE SINGLE;So;0;L;;;;;N;;;;;
+1D9A3;SIGNWRITING ROTATION-WALLPLANE DOUBLE;So;0;L;;;;;N;;;;;
+1D9A4;SIGNWRITING ROTATION-WALLPLANE ALTERNATE;So;0;L;;;;;N;;;;;
+1D9A5;SIGNWRITING MOVEMENT-WALLPLANE SHAKING;So;0;L;;;;;N;;;;;
+1D9A6;SIGNWRITING MOVEMENT-WALLPLANE CURVE HITTING FRONT WALL;So;0;L;;;;;N;;;;;
+1D9A7;SIGNWRITING MOVEMENT-WALLPLANE HUMP HITTING FRONT WALL;So;0;L;;;;;N;;;;;
+1D9A8;SIGNWRITING MOVEMENT-WALLPLANE LOOP HITTING FRONT WALL;So;0;L;;;;;N;;;;;
+1D9A9;SIGNWRITING MOVEMENT-WALLPLANE WAVE HITTING FRONT WALL;So;0;L;;;;;N;;;;;
+1D9AA;SIGNWRITING ROTATION-WALLPLANE SINGLE HITTING FRONT WALL;So;0;L;;;;;N;;;;;
+1D9AB;SIGNWRITING ROTATION-WALLPLANE DOUBLE HITTING FRONT WALL;So;0;L;;;;;N;;;;;
+1D9AC;SIGNWRITING ROTATION-WALLPLANE ALTERNATING HITTING FRONT WALL;So;0;L;;;;;N;;;;;
+1D9AD;SIGNWRITING MOVEMENT-WALLPLANE CURVE HITTING CHEST;So;0;L;;;;;N;;;;;
+1D9AE;SIGNWRITING MOVEMENT-WALLPLANE HUMP HITTING CHEST;So;0;L;;;;;N;;;;;
+1D9AF;SIGNWRITING MOVEMENT-WALLPLANE LOOP HITTING CHEST;So;0;L;;;;;N;;;;;
+1D9B0;SIGNWRITING MOVEMENT-WALLPLANE WAVE HITTING CHEST;So;0;L;;;;;N;;;;;
+1D9B1;SIGNWRITING ROTATION-WALLPLANE SINGLE HITTING CHEST;So;0;L;;;;;N;;;;;
+1D9B2;SIGNWRITING ROTATION-WALLPLANE DOUBLE HITTING CHEST;So;0;L;;;;;N;;;;;
+1D9B3;SIGNWRITING ROTATION-WALLPLANE ALTERNATING HITTING CHEST;So;0;L;;;;;N;;;;;
+1D9B4;SIGNWRITING MOVEMENT-WALLPLANE WAVE DIAGONAL PATH SMALL;So;0;L;;;;;N;;;;;
+1D9B5;SIGNWRITING MOVEMENT-WALLPLANE WAVE DIAGONAL PATH MEDIUM;So;0;L;;;;;N;;;;;
+1D9B6;SIGNWRITING MOVEMENT-WALLPLANE WAVE DIAGONAL PATH LARGE;So;0;L;;;;;N;;;;;
+1D9B7;SIGNWRITING MOVEMENT-FLOORPLANE CURVE HITTING CEILING SMALL;So;0;L;;;;;N;;;;;
+1D9B8;SIGNWRITING MOVEMENT-FLOORPLANE CURVE HITTING CEILING LARGE;So;0;L;;;;;N;;;;;
+1D9B9;SIGNWRITING MOVEMENT-FLOORPLANE HUMP HITTING CEILING SMALL DOUBLE;So;0;L;;;;;N;;;;;
+1D9BA;SIGNWRITING MOVEMENT-FLOORPLANE HUMP HITTING CEILING LARGE DOUBLE;So;0;L;;;;;N;;;;;
+1D9BB;SIGNWRITING MOVEMENT-FLOORPLANE HUMP HITTING CEILING SMALL TRIPLE;So;0;L;;;;;N;;;;;
+1D9BC;SIGNWRITING MOVEMENT-FLOORPLANE HUMP HITTING CEILING LARGE TRIPLE;So;0;L;;;;;N;;;;;
+1D9BD;SIGNWRITING MOVEMENT-FLOORPLANE LOOP HITTING CEILING SMALL SINGLE;So;0;L;;;;;N;;;;;
+1D9BE;SIGNWRITING MOVEMENT-FLOORPLANE LOOP HITTING CEILING LARGE SINGLE;So;0;L;;;;;N;;;;;
+1D9BF;SIGNWRITING MOVEMENT-FLOORPLANE LOOP HITTING CEILING SMALL DOUBLE;So;0;L;;;;;N;;;;;
+1D9C0;SIGNWRITING MOVEMENT-FLOORPLANE LOOP HITTING CEILING LARGE DOUBLE;So;0;L;;;;;N;;;;;
+1D9C1;SIGNWRITING MOVEMENT-FLOORPLANE WAVE HITTING CEILING SMALL;So;0;L;;;;;N;;;;;
+1D9C2;SIGNWRITING MOVEMENT-FLOORPLANE WAVE HITTING CEILING LARGE;So;0;L;;;;;N;;;;;
+1D9C3;SIGNWRITING ROTATION-FLOORPLANE SINGLE HITTING CEILING;So;0;L;;;;;N;;;;;
+1D9C4;SIGNWRITING ROTATION-FLOORPLANE DOUBLE HITTING CEILING;So;0;L;;;;;N;;;;;
+1D9C5;SIGNWRITING ROTATION-FLOORPLANE ALTERNATING HITTING CEILING;So;0;L;;;;;N;;;;;
+1D9C6;SIGNWRITING MOVEMENT-FLOORPLANE CURVE HITTING FLOOR SMALL;So;0;L;;;;;N;;;;;
+1D9C7;SIGNWRITING MOVEMENT-FLOORPLANE CURVE HITTING FLOOR LARGE;So;0;L;;;;;N;;;;;
+1D9C8;SIGNWRITING MOVEMENT-FLOORPLANE HUMP HITTING FLOOR SMALL DOUBLE;So;0;L;;;;;N;;;;;
+1D9C9;SIGNWRITING MOVEMENT-FLOORPLANE HUMP HITTING FLOOR LARGE DOUBLE;So;0;L;;;;;N;;;;;
+1D9CA;SIGNWRITING MOVEMENT-FLOORPLANE HUMP HITTING FLOOR TRIPLE SMALL TRIPLE;So;0;L;;;;;N;;;;;
+1D9CB;SIGNWRITING MOVEMENT-FLOORPLANE HUMP HITTING FLOOR TRIPLE LARGE TRIPLE;So;0;L;;;;;N;;;;;
+1D9CC;SIGNWRITING MOVEMENT-FLOORPLANE LOOP HITTING FLOOR SMALL SINGLE;So;0;L;;;;;N;;;;;
+1D9CD;SIGNWRITING MOVEMENT-FLOORPLANE LOOP HITTING FLOOR LARGE SINGLE;So;0;L;;;;;N;;;;;
+1D9CE;SIGNWRITING MOVEMENT-FLOORPLANE LOOP HITTING FLOOR SMALL DOUBLE;So;0;L;;;;;N;;;;;
+1D9CF;SIGNWRITING MOVEMENT-FLOORPLANE LOOP HITTING FLOOR LARGE DOUBLE;So;0;L;;;;;N;;;;;
+1D9D0;SIGNWRITING MOVEMENT-FLOORPLANE WAVE HITTING FLOOR SMALL;So;0;L;;;;;N;;;;;
+1D9D1;SIGNWRITING MOVEMENT-FLOORPLANE WAVE HITTING FLOOR LARGE;So;0;L;;;;;N;;;;;
+1D9D2;SIGNWRITING ROTATION-FLOORPLANE SINGLE HITTING FLOOR;So;0;L;;;;;N;;;;;
+1D9D3;SIGNWRITING ROTATION-FLOORPLANE DOUBLE HITTING FLOOR;So;0;L;;;;;N;;;;;
+1D9D4;SIGNWRITING ROTATION-FLOORPLANE ALTERNATING HITTING FLOOR;So;0;L;;;;;N;;;;;
+1D9D5;SIGNWRITING MOVEMENT-FLOORPLANE CURVE SMALL;So;0;L;;;;;N;;;;;
+1D9D6;SIGNWRITING MOVEMENT-FLOORPLANE CURVE MEDIUM;So;0;L;;;;;N;;;;;
+1D9D7;SIGNWRITING MOVEMENT-FLOORPLANE CURVE LARGE;So;0;L;;;;;N;;;;;
+1D9D8;SIGNWRITING MOVEMENT-FLOORPLANE CURVE LARGEST;So;0;L;;;;;N;;;;;
+1D9D9;SIGNWRITING MOVEMENT-FLOORPLANE CURVE COMBINED;So;0;L;;;;;N;;;;;
+1D9DA;SIGNWRITING MOVEMENT-FLOORPLANE HUMP SMALL;So;0;L;;;;;N;;;;;
+1D9DB;SIGNWRITING MOVEMENT-FLOORPLANE LOOP SMALL;So;0;L;;;;;N;;;;;
+1D9DC;SIGNWRITING MOVEMENT-FLOORPLANE WAVE SNAKE;So;0;L;;;;;N;;;;;
+1D9DD;SIGNWRITING MOVEMENT-FLOORPLANE WAVE SMALL;So;0;L;;;;;N;;;;;
+1D9DE;SIGNWRITING MOVEMENT-FLOORPLANE WAVE LARGE;So;0;L;;;;;N;;;;;
+1D9DF;SIGNWRITING ROTATION-FLOORPLANE SINGLE;So;0;L;;;;;N;;;;;
+1D9E0;SIGNWRITING ROTATION-FLOORPLANE DOUBLE;So;0;L;;;;;N;;;;;
+1D9E1;SIGNWRITING ROTATION-FLOORPLANE ALTERNATING;So;0;L;;;;;N;;;;;
+1D9E2;SIGNWRITING MOVEMENT-FLOORPLANE SHAKING PARALLEL;So;0;L;;;;;N;;;;;
+1D9E3;SIGNWRITING MOVEMENT-WALLPLANE ARM CIRCLE SMALL SINGLE;So;0;L;;;;;N;;;;;
+1D9E4;SIGNWRITING MOVEMENT-WALLPLANE ARM CIRCLE MEDIUM SINGLE;So;0;L;;;;;N;;;;;
+1D9E5;SIGNWRITING MOVEMENT-WALLPLANE ARM CIRCLE SMALL DOUBLE;So;0;L;;;;;N;;;;;
+1D9E6;SIGNWRITING MOVEMENT-WALLPLANE ARM CIRCLE MEDIUM DOUBLE;So;0;L;;;;;N;;;;;
+1D9E7;SIGNWRITING MOVEMENT-FLOORPLANE ARM CIRCLE HITTING WALL SMALL SINGLE;So;0;L;;;;;N;;;;;
+1D9E8;SIGNWRITING MOVEMENT-FLOORPLANE ARM CIRCLE HITTING WALL MEDIUM SINGLE;So;0;L;;;;;N;;;;;
+1D9E9;SIGNWRITING MOVEMENT-FLOORPLANE ARM CIRCLE HITTING WALL LARGE SINGLE;So;0;L;;;;;N;;;;;
+1D9EA;SIGNWRITING MOVEMENT-FLOORPLANE ARM CIRCLE HITTING WALL SMALL DOUBLE;So;0;L;;;;;N;;;;;
+1D9EB;SIGNWRITING MOVEMENT-FLOORPLANE ARM CIRCLE HITTING WALL MEDIUM DOUBLE;So;0;L;;;;;N;;;;;
+1D9EC;SIGNWRITING MOVEMENT-FLOORPLANE ARM CIRCLE HITTING WALL LARGE DOUBLE;So;0;L;;;;;N;;;;;
+1D9ED;SIGNWRITING MOVEMENT-WALLPLANE WRIST CIRCLE FRONT SINGLE;So;0;L;;;;;N;;;;;
+1D9EE;SIGNWRITING MOVEMENT-WALLPLANE WRIST CIRCLE FRONT DOUBLE;So;0;L;;;;;N;;;;;
+1D9EF;SIGNWRITING MOVEMENT-FLOORPLANE WRIST CIRCLE HITTING WALL SINGLE;So;0;L;;;;;N;;;;;
+1D9F0;SIGNWRITING MOVEMENT-FLOORPLANE WRIST CIRCLE HITTING WALL DOUBLE;So;0;L;;;;;N;;;;;
+1D9F1;SIGNWRITING MOVEMENT-WALLPLANE FINGER CIRCLES SINGLE;So;0;L;;;;;N;;;;;
+1D9F2;SIGNWRITING MOVEMENT-WALLPLANE FINGER CIRCLES DOUBLE;So;0;L;;;;;N;;;;;
+1D9F3;SIGNWRITING MOVEMENT-FLOORPLANE FINGER CIRCLES HITTING WALL SINGLE;So;0;L;;;;;N;;;;;
+1D9F4;SIGNWRITING MOVEMENT-FLOORPLANE FINGER CIRCLES HITTING WALL DOUBLE;So;0;L;;;;;N;;;;;
+1D9F5;SIGNWRITING DYNAMIC ARROWHEAD SMALL;So;0;L;;;;;N;;;;;
+1D9F6;SIGNWRITING DYNAMIC ARROWHEAD LARGE;So;0;L;;;;;N;;;;;
+1D9F7;SIGNWRITING DYNAMIC FAST;So;0;L;;;;;N;;;;;
+1D9F8;SIGNWRITING DYNAMIC SLOW;So;0;L;;;;;N;;;;;
+1D9F9;SIGNWRITING DYNAMIC TENSE;So;0;L;;;;;N;;;;;
+1D9FA;SIGNWRITING DYNAMIC RELAXED;So;0;L;;;;;N;;;;;
+1D9FB;SIGNWRITING DYNAMIC SIMULTANEOUS;So;0;L;;;;;N;;;;;
+1D9FC;SIGNWRITING DYNAMIC SIMULTANEOUS ALTERNATING;So;0;L;;;;;N;;;;;
+1D9FD;SIGNWRITING DYNAMIC EVERY OTHER TIME;So;0;L;;;;;N;;;;;
+1D9FE;SIGNWRITING DYNAMIC GRADUAL;So;0;L;;;;;N;;;;;
+1D9FF;SIGNWRITING HEAD;So;0;L;;;;;N;;;;;
+1DA00;SIGNWRITING HEAD RIM;Mn;0;NSM;;;;;N;;;;;
+1DA01;SIGNWRITING HEAD MOVEMENT-WALLPLANE STRAIGHT;Mn;0;NSM;;;;;N;;;;;
+1DA02;SIGNWRITING HEAD MOVEMENT-WALLPLANE TILT;Mn;0;NSM;;;;;N;;;;;
+1DA03;SIGNWRITING HEAD MOVEMENT-FLOORPLANE STRAIGHT;Mn;0;NSM;;;;;N;;;;;
+1DA04;SIGNWRITING HEAD MOVEMENT-WALLPLANE CURVE;Mn;0;NSM;;;;;N;;;;;
+1DA05;SIGNWRITING HEAD MOVEMENT-FLOORPLANE CURVE;Mn;0;NSM;;;;;N;;;;;
+1DA06;SIGNWRITING HEAD MOVEMENT CIRCLE;Mn;0;NSM;;;;;N;;;;;
+1DA07;SIGNWRITING FACE DIRECTION POSITION NOSE FORWARD TILTING;Mn;0;NSM;;;;;N;;;;;
+1DA08;SIGNWRITING FACE DIRECTION POSITION NOSE UP OR DOWN;Mn;0;NSM;;;;;N;;;;;
+1DA09;SIGNWRITING FACE DIRECTION POSITION NOSE UP OR DOWN TILTING;Mn;0;NSM;;;;;N;;;;;
+1DA0A;SIGNWRITING EYEBROWS STRAIGHT UP;Mn;0;NSM;;;;;N;;;;;
+1DA0B;SIGNWRITING EYEBROWS STRAIGHT NEUTRAL;Mn;0;NSM;;;;;N;;;;;
+1DA0C;SIGNWRITING EYEBROWS STRAIGHT DOWN;Mn;0;NSM;;;;;N;;;;;
+1DA0D;SIGNWRITING DREAMY EYEBROWS NEUTRAL DOWN;Mn;0;NSM;;;;;N;;;;;
+1DA0E;SIGNWRITING DREAMY EYEBROWS DOWN NEUTRAL;Mn;0;NSM;;;;;N;;;;;
+1DA0F;SIGNWRITING DREAMY EYEBROWS UP NEUTRAL;Mn;0;NSM;;;;;N;;;;;
+1DA10;SIGNWRITING DREAMY EYEBROWS NEUTRAL UP;Mn;0;NSM;;;;;N;;;;;
+1DA11;SIGNWRITING FOREHEAD NEUTRAL;Mn;0;NSM;;;;;N;;;;;
+1DA12;SIGNWRITING FOREHEAD CONTACT;Mn;0;NSM;;;;;N;;;;;
+1DA13;SIGNWRITING FOREHEAD WRINKLED;Mn;0;NSM;;;;;N;;;;;
+1DA14;SIGNWRITING EYES OPEN;Mn;0;NSM;;;;;N;;;;;
+1DA15;SIGNWRITING EYES SQUEEZED;Mn;0;NSM;;;;;N;;;;;
+1DA16;SIGNWRITING EYES CLOSED;Mn;0;NSM;;;;;N;;;;;
+1DA17;SIGNWRITING EYE BLINK SINGLE;Mn;0;NSM;;;;;N;;;;;
+1DA18;SIGNWRITING EYE BLINK MULTIPLE;Mn;0;NSM;;;;;N;;;;;
+1DA19;SIGNWRITING EYES HALF OPEN;Mn;0;NSM;;;;;N;;;;;
+1DA1A;SIGNWRITING EYES WIDE OPEN;Mn;0;NSM;;;;;N;;;;;
+1DA1B;SIGNWRITING EYES HALF CLOSED;Mn;0;NSM;;;;;N;;;;;
+1DA1C;SIGNWRITING EYES WIDENING MOVEMENT;Mn;0;NSM;;;;;N;;;;;
+1DA1D;SIGNWRITING EYE WINK;Mn;0;NSM;;;;;N;;;;;
+1DA1E;SIGNWRITING EYELASHES UP;Mn;0;NSM;;;;;N;;;;;
+1DA1F;SIGNWRITING EYELASHES DOWN;Mn;0;NSM;;;;;N;;;;;
+1DA20;SIGNWRITING EYELASHES FLUTTERING;Mn;0;NSM;;;;;N;;;;;
+1DA21;SIGNWRITING EYEGAZE-WALLPLANE STRAIGHT;Mn;0;NSM;;;;;N;;;;;
+1DA22;SIGNWRITING EYEGAZE-WALLPLANE STRAIGHT DOUBLE;Mn;0;NSM;;;;;N;;;;;
+1DA23;SIGNWRITING EYEGAZE-WALLPLANE STRAIGHT ALTERNATING;Mn;0;NSM;;;;;N;;;;;
+1DA24;SIGNWRITING EYEGAZE-FLOORPLANE STRAIGHT;Mn;0;NSM;;;;;N;;;;;
+1DA25;SIGNWRITING EYEGAZE-FLOORPLANE STRAIGHT DOUBLE;Mn;0;NSM;;;;;N;;;;;
+1DA26;SIGNWRITING EYEGAZE-FLOORPLANE STRAIGHT ALTERNATING;Mn;0;NSM;;;;;N;;;;;
+1DA27;SIGNWRITING EYEGAZE-WALLPLANE CURVED;Mn;0;NSM;;;;;N;;;;;
+1DA28;SIGNWRITING EYEGAZE-FLOORPLANE CURVED;Mn;0;NSM;;;;;N;;;;;
+1DA29;SIGNWRITING EYEGAZE-WALLPLANE CIRCLING;Mn;0;NSM;;;;;N;;;;;
+1DA2A;SIGNWRITING CHEEKS PUFFED;Mn;0;NSM;;;;;N;;;;;
+1DA2B;SIGNWRITING CHEEKS NEUTRAL;Mn;0;NSM;;;;;N;;;;;
+1DA2C;SIGNWRITING CHEEKS SUCKED;Mn;0;NSM;;;;;N;;;;;
+1DA2D;SIGNWRITING TENSE CHEEKS HIGH;Mn;0;NSM;;;;;N;;;;;
+1DA2E;SIGNWRITING TENSE CHEEKS MIDDLE;Mn;0;NSM;;;;;N;;;;;
+1DA2F;SIGNWRITING TENSE CHEEKS LOW;Mn;0;NSM;;;;;N;;;;;
+1DA30;SIGNWRITING EARS;Mn;0;NSM;;;;;N;;;;;
+1DA31;SIGNWRITING NOSE NEUTRAL;Mn;0;NSM;;;;;N;;;;;
+1DA32;SIGNWRITING NOSE CONTACT;Mn;0;NSM;;;;;N;;;;;
+1DA33;SIGNWRITING NOSE WRINKLES;Mn;0;NSM;;;;;N;;;;;
+1DA34;SIGNWRITING NOSE WIGGLES;Mn;0;NSM;;;;;N;;;;;
+1DA35;SIGNWRITING AIR BLOWING OUT;Mn;0;NSM;;;;;N;;;;;
+1DA36;SIGNWRITING AIR SUCKING IN;Mn;0;NSM;;;;;N;;;;;
+1DA37;SIGNWRITING AIR BLOW SMALL ROTATIONS;So;0;L;;;;;N;;;;;
+1DA38;SIGNWRITING AIR SUCK SMALL ROTATIONS;So;0;L;;;;;N;;;;;
+1DA39;SIGNWRITING BREATH INHALE;So;0;L;;;;;N;;;;;
+1DA3A;SIGNWRITING BREATH EXHALE;So;0;L;;;;;N;;;;;
+1DA3B;SIGNWRITING MOUTH CLOSED NEUTRAL;Mn;0;NSM;;;;;N;;;;;
+1DA3C;SIGNWRITING MOUTH CLOSED FORWARD;Mn;0;NSM;;;;;N;;;;;
+1DA3D;SIGNWRITING MOUTH CLOSED CONTACT;Mn;0;NSM;;;;;N;;;;;
+1DA3E;SIGNWRITING MOUTH SMILE;Mn;0;NSM;;;;;N;;;;;
+1DA3F;SIGNWRITING MOUTH SMILE WRINKLED;Mn;0;NSM;;;;;N;;;;;
+1DA40;SIGNWRITING MOUTH SMILE OPEN;Mn;0;NSM;;;;;N;;;;;
+1DA41;SIGNWRITING MOUTH FROWN;Mn;0;NSM;;;;;N;;;;;
+1DA42;SIGNWRITING MOUTH FROWN WRINKLED;Mn;0;NSM;;;;;N;;;;;
+1DA43;SIGNWRITING MOUTH FROWN OPEN;Mn;0;NSM;;;;;N;;;;;
+1DA44;SIGNWRITING MOUTH OPEN CIRCLE;Mn;0;NSM;;;;;N;;;;;
+1DA45;SIGNWRITING MOUTH OPEN FORWARD;Mn;0;NSM;;;;;N;;;;;
+1DA46;SIGNWRITING MOUTH OPEN WRINKLED;Mn;0;NSM;;;;;N;;;;;
+1DA47;SIGNWRITING MOUTH OPEN OVAL;Mn;0;NSM;;;;;N;;;;;
+1DA48;SIGNWRITING MOUTH OPEN OVAL WRINKLED;Mn;0;NSM;;;;;N;;;;;
+1DA49;SIGNWRITING MOUTH OPEN OVAL YAWN;Mn;0;NSM;;;;;N;;;;;
+1DA4A;SIGNWRITING MOUTH OPEN RECTANGLE;Mn;0;NSM;;;;;N;;;;;
+1DA4B;SIGNWRITING MOUTH OPEN RECTANGLE WRINKLED;Mn;0;NSM;;;;;N;;;;;
+1DA4C;SIGNWRITING MOUTH OPEN RECTANGLE YAWN;Mn;0;NSM;;;;;N;;;;;
+1DA4D;SIGNWRITING MOUTH KISS;Mn;0;NSM;;;;;N;;;;;
+1DA4E;SIGNWRITING MOUTH KISS FORWARD;Mn;0;NSM;;;;;N;;;;;
+1DA4F;SIGNWRITING MOUTH KISS WRINKLED;Mn;0;NSM;;;;;N;;;;;
+1DA50;SIGNWRITING MOUTH TENSE;Mn;0;NSM;;;;;N;;;;;
+1DA51;SIGNWRITING MOUTH TENSE FORWARD;Mn;0;NSM;;;;;N;;;;;
+1DA52;SIGNWRITING MOUTH TENSE SUCKED;Mn;0;NSM;;;;;N;;;;;
+1DA53;SIGNWRITING LIPS PRESSED TOGETHER;Mn;0;NSM;;;;;N;;;;;
+1DA54;SIGNWRITING LIP LOWER OVER UPPER;Mn;0;NSM;;;;;N;;;;;
+1DA55;SIGNWRITING LIP UPPER OVER LOWER;Mn;0;NSM;;;;;N;;;;;
+1DA56;SIGNWRITING MOUTH CORNERS;Mn;0;NSM;;;;;N;;;;;
+1DA57;SIGNWRITING MOUTH WRINKLES SINGLE;Mn;0;NSM;;;;;N;;;;;
+1DA58;SIGNWRITING MOUTH WRINKLES DOUBLE;Mn;0;NSM;;;;;N;;;;;
+1DA59;SIGNWRITING TONGUE STICKING OUT FAR;Mn;0;NSM;;;;;N;;;;;
+1DA5A;SIGNWRITING TONGUE LICKING LIPS;Mn;0;NSM;;;;;N;;;;;
+1DA5B;SIGNWRITING TONGUE TIP BETWEEN LIPS;Mn;0;NSM;;;;;N;;;;;
+1DA5C;SIGNWRITING TONGUE TIP TOUCHING INSIDE MOUTH;Mn;0;NSM;;;;;N;;;;;
+1DA5D;SIGNWRITING TONGUE INSIDE MOUTH RELAXED;Mn;0;NSM;;;;;N;;;;;
+1DA5E;SIGNWRITING TONGUE MOVES AGAINST CHEEK;Mn;0;NSM;;;;;N;;;;;
+1DA5F;SIGNWRITING TONGUE CENTRE STICKING OUT;Mn;0;NSM;;;;;N;;;;;
+1DA60;SIGNWRITING TONGUE CENTRE INSIDE MOUTH;Mn;0;NSM;;;;;N;;;;;
+1DA61;SIGNWRITING TEETH;Mn;0;NSM;;;;;N;;;;;
+1DA62;SIGNWRITING TEETH MOVEMENT;Mn;0;NSM;;;;;N;;;;;
+1DA63;SIGNWRITING TEETH ON TONGUE;Mn;0;NSM;;;;;N;;;;;
+1DA64;SIGNWRITING TEETH ON TONGUE MOVEMENT;Mn;0;NSM;;;;;N;;;;;
+1DA65;SIGNWRITING TEETH ON LIPS;Mn;0;NSM;;;;;N;;;;;
+1DA66;SIGNWRITING TEETH ON LIPS MOVEMENT;Mn;0;NSM;;;;;N;;;;;
+1DA67;SIGNWRITING TEETH BITE LIPS;Mn;0;NSM;;;;;N;;;;;
+1DA68;SIGNWRITING MOVEMENT-WALLPLANE JAW;Mn;0;NSM;;;;;N;;;;;
+1DA69;SIGNWRITING MOVEMENT-FLOORPLANE JAW;Mn;0;NSM;;;;;N;;;;;
+1DA6A;SIGNWRITING NECK;Mn;0;NSM;;;;;N;;;;;
+1DA6B;SIGNWRITING HAIR;Mn;0;NSM;;;;;N;;;;;
+1DA6C;SIGNWRITING EXCITEMENT;Mn;0;NSM;;;;;N;;;;;
+1DA6D;SIGNWRITING SHOULDER HIP SPINE;So;0;L;;;;;N;;;;;
+1DA6E;SIGNWRITING SHOULDER HIP POSITIONS;So;0;L;;;;;N;;;;;
+1DA6F;SIGNWRITING WALLPLANE SHOULDER HIP MOVE;So;0;L;;;;;N;;;;;
+1DA70;SIGNWRITING FLOORPLANE SHOULDER HIP MOVE;So;0;L;;;;;N;;;;;
+1DA71;SIGNWRITING SHOULDER TILTING FROM WAIST;So;0;L;;;;;N;;;;;
+1DA72;SIGNWRITING TORSO-WALLPLANE STRAIGHT STRETCH;So;0;L;;;;;N;;;;;
+1DA73;SIGNWRITING TORSO-WALLPLANE CURVED BEND;So;0;L;;;;;N;;;;;
+1DA74;SIGNWRITING TORSO-FLOORPLANE TWISTING;So;0;L;;;;;N;;;;;
+1DA75;SIGNWRITING UPPER BODY TILTING FROM HIP JOINTS;Mn;0;NSM;;;;;N;;;;;
+1DA76;SIGNWRITING LIMB COMBINATION;So;0;L;;;;;N;;;;;
+1DA77;SIGNWRITING LIMB LENGTH-1;So;0;L;;;;;N;;;;;
+1DA78;SIGNWRITING LIMB LENGTH-2;So;0;L;;;;;N;;;;;
+1DA79;SIGNWRITING LIMB LENGTH-3;So;0;L;;;;;N;;;;;
+1DA7A;SIGNWRITING LIMB LENGTH-4;So;0;L;;;;;N;;;;;
+1DA7B;SIGNWRITING LIMB LENGTH-5;So;0;L;;;;;N;;;;;
+1DA7C;SIGNWRITING LIMB LENGTH-6;So;0;L;;;;;N;;;;;
+1DA7D;SIGNWRITING LIMB LENGTH-7;So;0;L;;;;;N;;;;;
+1DA7E;SIGNWRITING FINGER;So;0;L;;;;;N;;;;;
+1DA7F;SIGNWRITING LOCATION-WALLPLANE SPACE;So;0;L;;;;;N;;;;;
+1DA80;SIGNWRITING LOCATION-FLOORPLANE SPACE;So;0;L;;;;;N;;;;;
+1DA81;SIGNWRITING LOCATION HEIGHT;So;0;L;;;;;N;;;;;
+1DA82;SIGNWRITING LOCATION WIDTH;So;0;L;;;;;N;;;;;
+1DA83;SIGNWRITING LOCATION DEPTH;So;0;L;;;;;N;;;;;
+1DA84;SIGNWRITING LOCATION HEAD NECK;Mn;0;NSM;;;;;N;;;;;
+1DA85;SIGNWRITING LOCATION TORSO;So;0;L;;;;;N;;;;;
+1DA86;SIGNWRITING LOCATION LIMBS DIGITS;So;0;L;;;;;N;;;;;
+1DA87;SIGNWRITING COMMA;Po;0;L;;;;;N;;;;;
+1DA88;SIGNWRITING FULL STOP;Po;0;L;;;;;N;;;;;
+1DA89;SIGNWRITING SEMICOLON;Po;0;L;;;;;N;;;;;
+1DA8A;SIGNWRITING COLON;Po;0;L;;;;;N;;;;;
+1DA8B;SIGNWRITING PARENTHESIS;Po;0;L;;;;;N;;;;;
+1DA9B;SIGNWRITING FILL MODIFIER-2;Mn;0;NSM;;;;;N;;;;;
+1DA9C;SIGNWRITING FILL MODIFIER-3;Mn;0;NSM;;;;;N;;;;;
+1DA9D;SIGNWRITING FILL MODIFIER-4;Mn;0;NSM;;;;;N;;;;;
+1DA9E;SIGNWRITING FILL MODIFIER-5;Mn;0;NSM;;;;;N;;;;;
+1DA9F;SIGNWRITING FILL MODIFIER-6;Mn;0;NSM;;;;;N;;;;;
+1DAA1;SIGNWRITING ROTATION MODIFIER-2;Mn;0;NSM;;;;;N;;;;;
+1DAA2;SIGNWRITING ROTATION MODIFIER-3;Mn;0;NSM;;;;;N;;;;;
+1DAA3;SIGNWRITING ROTATION MODIFIER-4;Mn;0;NSM;;;;;N;;;;;
+1DAA4;SIGNWRITING ROTATION MODIFIER-5;Mn;0;NSM;;;;;N;;;;;
+1DAA5;SIGNWRITING ROTATION MODIFIER-6;Mn;0;NSM;;;;;N;;;;;
+1DAA6;SIGNWRITING ROTATION MODIFIER-7;Mn;0;NSM;;;;;N;;;;;
+1DAA7;SIGNWRITING ROTATION MODIFIER-8;Mn;0;NSM;;;;;N;;;;;
+1DAA8;SIGNWRITING ROTATION MODIFIER-9;Mn;0;NSM;;;;;N;;;;;
+1DAA9;SIGNWRITING ROTATION MODIFIER-10;Mn;0;NSM;;;;;N;;;;;
+1DAAA;SIGNWRITING ROTATION MODIFIER-11;Mn;0;NSM;;;;;N;;;;;
+1DAAB;SIGNWRITING ROTATION MODIFIER-12;Mn;0;NSM;;;;;N;;;;;
+1DAAC;SIGNWRITING ROTATION MODIFIER-13;Mn;0;NSM;;;;;N;;;;;
+1DAAD;SIGNWRITING ROTATION MODIFIER-14;Mn;0;NSM;;;;;N;;;;;
+1DAAE;SIGNWRITING ROTATION MODIFIER-15;Mn;0;NSM;;;;;N;;;;;
+1DAAF;SIGNWRITING ROTATION MODIFIER-16;Mn;0;NSM;;;;;N;;;;;
+1E000;COMBINING GLAGOLITIC LETTER AZU;Mn;230;NSM;;;;;N;;;;;
+1E001;COMBINING GLAGOLITIC LETTER BUKY;Mn;230;NSM;;;;;N;;;;;
+1E002;COMBINING GLAGOLITIC LETTER VEDE;Mn;230;NSM;;;;;N;;;;;
+1E003;COMBINING GLAGOLITIC LETTER GLAGOLI;Mn;230;NSM;;;;;N;;;;;
+1E004;COMBINING GLAGOLITIC LETTER DOBRO;Mn;230;NSM;;;;;N;;;;;
+1E005;COMBINING GLAGOLITIC LETTER YESTU;Mn;230;NSM;;;;;N;;;;;
+1E006;COMBINING GLAGOLITIC LETTER ZHIVETE;Mn;230;NSM;;;;;N;;;;;
+1E008;COMBINING GLAGOLITIC LETTER ZEMLJA;Mn;230;NSM;;;;;N;;;;;
+1E009;COMBINING GLAGOLITIC LETTER IZHE;Mn;230;NSM;;;;;N;;;;;
+1E00A;COMBINING GLAGOLITIC LETTER INITIAL IZHE;Mn;230;NSM;;;;;N;;;;;
+1E00B;COMBINING GLAGOLITIC LETTER I;Mn;230;NSM;;;;;N;;;;;
+1E00C;COMBINING GLAGOLITIC LETTER DJERVI;Mn;230;NSM;;;;;N;;;;;
+1E00D;COMBINING GLAGOLITIC LETTER KAKO;Mn;230;NSM;;;;;N;;;;;
+1E00E;COMBINING GLAGOLITIC LETTER LJUDIJE;Mn;230;NSM;;;;;N;;;;;
+1E00F;COMBINING GLAGOLITIC LETTER MYSLITE;Mn;230;NSM;;;;;N;;;;;
+1E010;COMBINING GLAGOLITIC LETTER NASHI;Mn;230;NSM;;;;;N;;;;;
+1E011;COMBINING GLAGOLITIC LETTER ONU;Mn;230;NSM;;;;;N;;;;;
+1E012;COMBINING GLAGOLITIC LETTER POKOJI;Mn;230;NSM;;;;;N;;;;;
+1E013;COMBINING GLAGOLITIC LETTER RITSI;Mn;230;NSM;;;;;N;;;;;
+1E014;COMBINING GLAGOLITIC LETTER SLOVO;Mn;230;NSM;;;;;N;;;;;
+1E015;COMBINING GLAGOLITIC LETTER TVRIDO;Mn;230;NSM;;;;;N;;;;;
+1E016;COMBINING GLAGOLITIC LETTER UKU;Mn;230;NSM;;;;;N;;;;;
+1E017;COMBINING GLAGOLITIC LETTER FRITU;Mn;230;NSM;;;;;N;;;;;
+1E018;COMBINING GLAGOLITIC LETTER HERU;Mn;230;NSM;;;;;N;;;;;
+1E01B;COMBINING GLAGOLITIC LETTER SHTA;Mn;230;NSM;;;;;N;;;;;
+1E01C;COMBINING GLAGOLITIC LETTER TSI;Mn;230;NSM;;;;;N;;;;;
+1E01D;COMBINING GLAGOLITIC LETTER CHRIVI;Mn;230;NSM;;;;;N;;;;;
+1E01E;COMBINING GLAGOLITIC LETTER SHA;Mn;230;NSM;;;;;N;;;;;
+1E01F;COMBINING GLAGOLITIC LETTER YERU;Mn;230;NSM;;;;;N;;;;;
+1E020;COMBINING GLAGOLITIC LETTER YERI;Mn;230;NSM;;;;;N;;;;;
+1E021;COMBINING GLAGOLITIC LETTER YATI;Mn;230;NSM;;;;;N;;;;;
+1E023;COMBINING GLAGOLITIC LETTER YU;Mn;230;NSM;;;;;N;;;;;
+1E024;COMBINING GLAGOLITIC LETTER SMALL YUS;Mn;230;NSM;;;;;N;;;;;
+1E026;COMBINING GLAGOLITIC LETTER YO;Mn;230;NSM;;;;;N;;;;;
+1E027;COMBINING GLAGOLITIC LETTER IOTATED SMALL YUS;Mn;230;NSM;;;;;N;;;;;
+1E028;COMBINING GLAGOLITIC LETTER BIG YUS;Mn;230;NSM;;;;;N;;;;;
+1E029;COMBINING GLAGOLITIC LETTER IOTATED BIG YUS;Mn;230;NSM;;;;;N;;;;;
+1E02A;COMBINING GLAGOLITIC LETTER FITA;Mn;230;NSM;;;;;N;;;;;
+1E800;MENDE KIKAKUI SYLLABLE M001 KI;Lo;0;R;;;;;N;;;;;
+1E801;MENDE KIKAKUI SYLLABLE M002 KA;Lo;0;R;;;;;N;;;;;
+1E802;MENDE KIKAKUI SYLLABLE M003 KU;Lo;0;R;;;;;N;;;;;
+1E803;MENDE KIKAKUI SYLLABLE M065 KEE;Lo;0;R;;;;;N;;;;;
+1E804;MENDE KIKAKUI SYLLABLE M095 KE;Lo;0;R;;;;;N;;;;;
+1E805;MENDE KIKAKUI SYLLABLE M076 KOO;Lo;0;R;;;;;N;;;;;
+1E806;MENDE KIKAKUI SYLLABLE M048 KO;Lo;0;R;;;;;N;;;;;
+1E807;MENDE KIKAKUI SYLLABLE M179 KUA;Lo;0;R;;;;;N;;;;;
+1E808;MENDE KIKAKUI SYLLABLE M004 WI;Lo;0;R;;;;;N;;;;;
+1E809;MENDE KIKAKUI SYLLABLE M005 WA;Lo;0;R;;;;;N;;;;;
+1E80A;MENDE KIKAKUI SYLLABLE M006 WU;Lo;0;R;;;;;N;;;;;
+1E80B;MENDE KIKAKUI SYLLABLE M126 WEE;Lo;0;R;;;;;N;;;;;
+1E80C;MENDE KIKAKUI SYLLABLE M118 WE;Lo;0;R;;;;;N;;;;;
+1E80D;MENDE KIKAKUI SYLLABLE M114 WOO;Lo;0;R;;;;;N;;;;;
+1E80E;MENDE KIKAKUI SYLLABLE M045 WO;Lo;0;R;;;;;N;;;;;
+1E80F;MENDE KIKAKUI SYLLABLE M194 WUI;Lo;0;R;;;;;N;;;;;
+1E810;MENDE KIKAKUI SYLLABLE M143 WEI;Lo;0;R;;;;;N;;;;;
+1E811;MENDE KIKAKUI SYLLABLE M061 WVI;Lo;0;R;;;;;N;;;;;
+1E812;MENDE KIKAKUI SYLLABLE M049 WVA;Lo;0;R;;;;;N;;;;;
+1E813;MENDE KIKAKUI SYLLABLE M139 WVE;Lo;0;R;;;;;N;;;;;
+1E814;MENDE KIKAKUI SYLLABLE M007 MIN;Lo;0;R;;;;;N;;;;;
+1E815;MENDE KIKAKUI SYLLABLE M008 MAN;Lo;0;R;;;;;N;;;;;
+1E816;MENDE KIKAKUI SYLLABLE M009 MUN;Lo;0;R;;;;;N;;;;;
+1E817;MENDE KIKAKUI SYLLABLE M059 MEN;Lo;0;R;;;;;N;;;;;
+1E818;MENDE KIKAKUI SYLLABLE M094 MON;Lo;0;R;;;;;N;;;;;
+1E819;MENDE KIKAKUI SYLLABLE M154 MUAN;Lo;0;R;;;;;N;;;;;
+1E81A;MENDE KIKAKUI SYLLABLE M189 MUEN;Lo;0;R;;;;;N;;;;;
+1E81B;MENDE KIKAKUI SYLLABLE M010 BI;Lo;0;R;;;;;N;;;;;
+1E81C;MENDE KIKAKUI SYLLABLE M011 BA;Lo;0;R;;;;;N;;;;;
+1E81D;MENDE KIKAKUI SYLLABLE M012 BU;Lo;0;R;;;;;N;;;;;
+1E81E;MENDE KIKAKUI SYLLABLE M150 BEE;Lo;0;R;;;;;N;;;;;
+1E81F;MENDE KIKAKUI SYLLABLE M097 BE;Lo;0;R;;;;;N;;;;;
+1E820;MENDE KIKAKUI SYLLABLE M103 BOO;Lo;0;R;;;;;N;;;;;
+1E821;MENDE KIKAKUI SYLLABLE M138 BO;Lo;0;R;;;;;N;;;;;
+1E822;MENDE KIKAKUI SYLLABLE M013 I;Lo;0;R;;;;;N;;;;;
+1E823;MENDE KIKAKUI SYLLABLE M014 A;Lo;0;R;;;;;N;;;;;
+1E824;MENDE KIKAKUI SYLLABLE M015 U;Lo;0;R;;;;;N;;;;;
+1E825;MENDE KIKAKUI SYLLABLE M163 EE;Lo;0;R;;;;;N;;;;;
+1E826;MENDE KIKAKUI SYLLABLE M100 E;Lo;0;R;;;;;N;;;;;
+1E827;MENDE KIKAKUI SYLLABLE M165 OO;Lo;0;R;;;;;N;;;;;
+1E828;MENDE KIKAKUI SYLLABLE M147 O;Lo;0;R;;;;;N;;;;;
+1E829;MENDE KIKAKUI SYLLABLE M137 EI;Lo;0;R;;;;;N;;;;;
+1E82A;MENDE KIKAKUI SYLLABLE M131 IN;Lo;0;R;;;;;N;;;;;
+1E82B;MENDE KIKAKUI SYLLABLE M135 IN;Lo;0;R;;;;;N;;;;;
+1E82C;MENDE KIKAKUI SYLLABLE M195 AN;Lo;0;R;;;;;N;;;;;
+1E82D;MENDE KIKAKUI SYLLABLE M178 EN;Lo;0;R;;;;;N;;;;;
+1E82E;MENDE KIKAKUI SYLLABLE M019 SI;Lo;0;R;;;;;N;;;;;
+1E82F;MENDE KIKAKUI SYLLABLE M020 SA;Lo;0;R;;;;;N;;;;;
+1E830;MENDE KIKAKUI SYLLABLE M021 SU;Lo;0;R;;;;;N;;;;;
+1E831;MENDE KIKAKUI SYLLABLE M162 SEE;Lo;0;R;;;;;N;;;;;
+1E832;MENDE KIKAKUI SYLLABLE M116 SE;Lo;0;R;;;;;N;;;;;
+1E833;MENDE KIKAKUI SYLLABLE M136 SOO;Lo;0;R;;;;;N;;;;;
+1E834;MENDE KIKAKUI SYLLABLE M079 SO;Lo;0;R;;;;;N;;;;;
+1E835;MENDE KIKAKUI SYLLABLE M196 SIA;Lo;0;R;;;;;N;;;;;
+1E836;MENDE KIKAKUI SYLLABLE M025 LI;Lo;0;R;;;;;N;;;;;
+1E837;MENDE KIKAKUI SYLLABLE M026 LA;Lo;0;R;;;;;N;;;;;
+1E838;MENDE KIKAKUI SYLLABLE M027 LU;Lo;0;R;;;;;N;;;;;
+1E839;MENDE KIKAKUI SYLLABLE M084 LEE;Lo;0;R;;;;;N;;;;;
+1E83A;MENDE KIKAKUI SYLLABLE M073 LE;Lo;0;R;;;;;N;;;;;
+1E83B;MENDE KIKAKUI SYLLABLE M054 LOO;Lo;0;R;;;;;N;;;;;
+1E83C;MENDE KIKAKUI SYLLABLE M153 LO;Lo;0;R;;;;;N;;;;;
+1E83D;MENDE KIKAKUI SYLLABLE M110 LONG LE;Lo;0;R;;;;;N;;;;;
+1E83E;MENDE KIKAKUI SYLLABLE M016 DI;Lo;0;R;;;;;N;;;;;
+1E83F;MENDE KIKAKUI SYLLABLE M017 DA;Lo;0;R;;;;;N;;;;;
+1E840;MENDE KIKAKUI SYLLABLE M018 DU;Lo;0;R;;;;;N;;;;;
+1E841;MENDE KIKAKUI SYLLABLE M089 DEE;Lo;0;R;;;;;N;;;;;
+1E842;MENDE KIKAKUI SYLLABLE M180 DOO;Lo;0;R;;;;;N;;;;;
+1E843;MENDE KIKAKUI SYLLABLE M181 DO;Lo;0;R;;;;;N;;;;;
+1E844;MENDE KIKAKUI SYLLABLE M022 TI;Lo;0;R;;;;;N;;;;;
+1E845;MENDE KIKAKUI SYLLABLE M023 TA;Lo;0;R;;;;;N;;;;;
+1E846;MENDE KIKAKUI SYLLABLE M024 TU;Lo;0;R;;;;;N;;;;;
+1E847;MENDE KIKAKUI SYLLABLE M091 TEE;Lo;0;R;;;;;N;;;;;
+1E848;MENDE KIKAKUI SYLLABLE M055 TE;Lo;0;R;;;;;N;;;;;
+1E849;MENDE KIKAKUI SYLLABLE M104 TOO;Lo;0;R;;;;;N;;;;;
+1E84A;MENDE KIKAKUI SYLLABLE M069 TO;Lo;0;R;;;;;N;;;;;
+1E84B;MENDE KIKAKUI SYLLABLE M028 JI;Lo;0;R;;;;;N;;;;;
+1E84C;MENDE KIKAKUI SYLLABLE M029 JA;Lo;0;R;;;;;N;;;;;
+1E84D;MENDE KIKAKUI SYLLABLE M030 JU;Lo;0;R;;;;;N;;;;;
+1E84E;MENDE KIKAKUI SYLLABLE M157 JEE;Lo;0;R;;;;;N;;;;;
+1E84F;MENDE KIKAKUI SYLLABLE M113 JE;Lo;0;R;;;;;N;;;;;
+1E850;MENDE KIKAKUI SYLLABLE M160 JOO;Lo;0;R;;;;;N;;;;;
+1E851;MENDE KIKAKUI SYLLABLE M063 JO;Lo;0;R;;;;;N;;;;;
+1E852;MENDE KIKAKUI SYLLABLE M175 LONG JO;Lo;0;R;;;;;N;;;;;
+1E853;MENDE KIKAKUI SYLLABLE M031 YI;Lo;0;R;;;;;N;;;;;
+1E854;MENDE KIKAKUI SYLLABLE M032 YA;Lo;0;R;;;;;N;;;;;
+1E855;MENDE KIKAKUI SYLLABLE M033 YU;Lo;0;R;;;;;N;;;;;
+1E856;MENDE KIKAKUI SYLLABLE M109 YEE;Lo;0;R;;;;;N;;;;;
+1E857;MENDE KIKAKUI SYLLABLE M080 YE;Lo;0;R;;;;;N;;;;;
+1E858;MENDE KIKAKUI SYLLABLE M141 YOO;Lo;0;R;;;;;N;;;;;
+1E859;MENDE KIKAKUI SYLLABLE M121 YO;Lo;0;R;;;;;N;;;;;
+1E85A;MENDE KIKAKUI SYLLABLE M034 FI;Lo;0;R;;;;;N;;;;;
+1E85B;MENDE KIKAKUI SYLLABLE M035 FA;Lo;0;R;;;;;N;;;;;
+1E85C;MENDE KIKAKUI SYLLABLE M036 FU;Lo;0;R;;;;;N;;;;;
+1E85D;MENDE KIKAKUI SYLLABLE M078 FEE;Lo;0;R;;;;;N;;;;;
+1E85E;MENDE KIKAKUI SYLLABLE M075 FE;Lo;0;R;;;;;N;;;;;
+1E85F;MENDE KIKAKUI SYLLABLE M133 FOO;Lo;0;R;;;;;N;;;;;
+1E860;MENDE KIKAKUI SYLLABLE M088 FO;Lo;0;R;;;;;N;;;;;
+1E861;MENDE KIKAKUI SYLLABLE M197 FUA;Lo;0;R;;;;;N;;;;;
+1E862;MENDE KIKAKUI SYLLABLE M101 FAN;Lo;0;R;;;;;N;;;;;
+1E863;MENDE KIKAKUI SYLLABLE M037 NIN;Lo;0;R;;;;;N;;;;;
+1E864;MENDE KIKAKUI SYLLABLE M038 NAN;Lo;0;R;;;;;N;;;;;
+1E865;MENDE KIKAKUI SYLLABLE M039 NUN;Lo;0;R;;;;;N;;;;;
+1E866;MENDE KIKAKUI SYLLABLE M117 NEN;Lo;0;R;;;;;N;;;;;
+1E867;MENDE KIKAKUI SYLLABLE M169 NON;Lo;0;R;;;;;N;;;;;
+1E868;MENDE KIKAKUI SYLLABLE M176 HI;Lo;0;R;;;;;N;;;;;
+1E869;MENDE KIKAKUI SYLLABLE M041 HA;Lo;0;R;;;;;N;;;;;
+1E86A;MENDE KIKAKUI SYLLABLE M186 HU;Lo;0;R;;;;;N;;;;;
+1E86B;MENDE KIKAKUI SYLLABLE M040 HEE;Lo;0;R;;;;;N;;;;;
+1E86C;MENDE KIKAKUI SYLLABLE M096 HE;Lo;0;R;;;;;N;;;;;
+1E86D;MENDE KIKAKUI SYLLABLE M042 HOO;Lo;0;R;;;;;N;;;;;
+1E86E;MENDE KIKAKUI SYLLABLE M140 HO;Lo;0;R;;;;;N;;;;;
+1E86F;MENDE KIKAKUI SYLLABLE M083 HEEI;Lo;0;R;;;;;N;;;;;
+1E870;MENDE KIKAKUI SYLLABLE M128 HOOU;Lo;0;R;;;;;N;;;;;
+1E871;MENDE KIKAKUI SYLLABLE M053 HIN;Lo;0;R;;;;;N;;;;;
+1E872;MENDE KIKAKUI SYLLABLE M130 HAN;Lo;0;R;;;;;N;;;;;
+1E873;MENDE KIKAKUI SYLLABLE M087 HUN;Lo;0;R;;;;;N;;;;;
+1E874;MENDE KIKAKUI SYLLABLE M052 HEN;Lo;0;R;;;;;N;;;;;
+1E875;MENDE KIKAKUI SYLLABLE M193 HON;Lo;0;R;;;;;N;;;;;
+1E876;MENDE KIKAKUI SYLLABLE M046 HUAN;Lo;0;R;;;;;N;;;;;
+1E877;MENDE KIKAKUI SYLLABLE M090 NGGI;Lo;0;R;;;;;N;;;;;
+1E878;MENDE KIKAKUI SYLLABLE M043 NGGA;Lo;0;R;;;;;N;;;;;
+1E879;MENDE KIKAKUI SYLLABLE M082 NGGU;Lo;0;R;;;;;N;;;;;
+1E87A;MENDE KIKAKUI SYLLABLE M115 NGGEE;Lo;0;R;;;;;N;;;;;
+1E87B;MENDE KIKAKUI SYLLABLE M146 NGGE;Lo;0;R;;;;;N;;;;;
+1E87C;MENDE KIKAKUI SYLLABLE M156 NGGOO;Lo;0;R;;;;;N;;;;;
+1E87D;MENDE KIKAKUI SYLLABLE M120 NGGO;Lo;0;R;;;;;N;;;;;
+1E87E;MENDE KIKAKUI SYLLABLE M159 NGGAA;Lo;0;R;;;;;N;;;;;
+1E87F;MENDE KIKAKUI SYLLABLE M127 NGGUA;Lo;0;R;;;;;N;;;;;
+1E880;MENDE KIKAKUI SYLLABLE M086 LONG NGGE;Lo;0;R;;;;;N;;;;;
+1E881;MENDE KIKAKUI SYLLABLE M106 LONG NGGOO;Lo;0;R;;;;;N;;;;;
+1E882;MENDE KIKAKUI SYLLABLE M183 LONG NGGO;Lo;0;R;;;;;N;;;;;
+1E883;MENDE KIKAKUI SYLLABLE M155 GI;Lo;0;R;;;;;N;;;;;
+1E884;MENDE KIKAKUI SYLLABLE M111 GA;Lo;0;R;;;;;N;;;;;
+1E885;MENDE KIKAKUI SYLLABLE M168 GU;Lo;0;R;;;;;N;;;;;
+1E886;MENDE KIKAKUI SYLLABLE M190 GEE;Lo;0;R;;;;;N;;;;;
+1E887;MENDE KIKAKUI SYLLABLE M166 GUEI;Lo;0;R;;;;;N;;;;;
+1E888;MENDE KIKAKUI SYLLABLE M167 GUAN;Lo;0;R;;;;;N;;;;;
+1E889;MENDE KIKAKUI SYLLABLE M184 NGEN;Lo;0;R;;;;;N;;;;;
+1E88A;MENDE KIKAKUI SYLLABLE M057 NGON;Lo;0;R;;;;;N;;;;;
+1E88B;MENDE KIKAKUI SYLLABLE M177 NGUAN;Lo;0;R;;;;;N;;;;;
+1E88C;MENDE KIKAKUI SYLLABLE M068 PI;Lo;0;R;;;;;N;;;;;
+1E88D;MENDE KIKAKUI SYLLABLE M099 PA;Lo;0;R;;;;;N;;;;;
+1E88E;MENDE KIKAKUI SYLLABLE M050 PU;Lo;0;R;;;;;N;;;;;
+1E88F;MENDE KIKAKUI SYLLABLE M081 PEE;Lo;0;R;;;;;N;;;;;
+1E890;MENDE KIKAKUI SYLLABLE M051 PE;Lo;0;R;;;;;N;;;;;
+1E891;MENDE KIKAKUI SYLLABLE M102 POO;Lo;0;R;;;;;N;;;;;
+1E892;MENDE KIKAKUI SYLLABLE M066 PO;Lo;0;R;;;;;N;;;;;
+1E893;MENDE KIKAKUI SYLLABLE M145 MBI;Lo;0;R;;;;;N;;;;;
+1E894;MENDE KIKAKUI SYLLABLE M062 MBA;Lo;0;R;;;;;N;;;;;
+1E895;MENDE KIKAKUI SYLLABLE M122 MBU;Lo;0;R;;;;;N;;;;;
+1E896;MENDE KIKAKUI SYLLABLE M047 MBEE;Lo;0;R;;;;;N;;;;;
+1E897;MENDE KIKAKUI SYLLABLE M188 MBEE;Lo;0;R;;;;;N;;;;;
+1E898;MENDE KIKAKUI SYLLABLE M072 MBE;Lo;0;R;;;;;N;;;;;
+1E899;MENDE KIKAKUI SYLLABLE M172 MBOO;Lo;0;R;;;;;N;;;;;
+1E89A;MENDE KIKAKUI SYLLABLE M174 MBO;Lo;0;R;;;;;N;;;;;
+1E89B;MENDE KIKAKUI SYLLABLE M187 MBUU;Lo;0;R;;;;;N;;;;;
+1E89C;MENDE KIKAKUI SYLLABLE M161 LONG MBE;Lo;0;R;;;;;N;;;;;
+1E89D;MENDE KIKAKUI SYLLABLE M105 LONG MBOO;Lo;0;R;;;;;N;;;;;
+1E89E;MENDE KIKAKUI SYLLABLE M142 LONG MBO;Lo;0;R;;;;;N;;;;;
+1E89F;MENDE KIKAKUI SYLLABLE M132 KPI;Lo;0;R;;;;;N;;;;;
+1E8A0;MENDE KIKAKUI SYLLABLE M092 KPA;Lo;0;R;;;;;N;;;;;
+1E8A1;MENDE KIKAKUI SYLLABLE M074 KPU;Lo;0;R;;;;;N;;;;;
+1E8A2;MENDE KIKAKUI SYLLABLE M044 KPEE;Lo;0;R;;;;;N;;;;;
+1E8A3;MENDE KIKAKUI SYLLABLE M108 KPE;Lo;0;R;;;;;N;;;;;
+1E8A4;MENDE KIKAKUI SYLLABLE M112 KPOO;Lo;0;R;;;;;N;;;;;
+1E8A5;MENDE KIKAKUI SYLLABLE M158 KPO;Lo;0;R;;;;;N;;;;;
+1E8A6;MENDE KIKAKUI SYLLABLE M124 GBI;Lo;0;R;;;;;N;;;;;
+1E8A7;MENDE KIKAKUI SYLLABLE M056 GBA;Lo;0;R;;;;;N;;;;;
+1E8A8;MENDE KIKAKUI SYLLABLE M148 GBU;Lo;0;R;;;;;N;;;;;
+1E8A9;MENDE KIKAKUI SYLLABLE M093 GBEE;Lo;0;R;;;;;N;;;;;
+1E8AA;MENDE KIKAKUI SYLLABLE M107 GBE;Lo;0;R;;;;;N;;;;;
+1E8AB;MENDE KIKAKUI SYLLABLE M071 GBOO;Lo;0;R;;;;;N;;;;;
+1E8AC;MENDE KIKAKUI SYLLABLE M070 GBO;Lo;0;R;;;;;N;;;;;
+1E8AD;MENDE KIKAKUI SYLLABLE M171 RA;Lo;0;R;;;;;N;;;;;
+1E8AE;MENDE KIKAKUI SYLLABLE M123 NDI;Lo;0;R;;;;;N;;;;;
+1E8AF;MENDE KIKAKUI SYLLABLE M129 NDA;Lo;0;R;;;;;N;;;;;
+1E8B0;MENDE KIKAKUI SYLLABLE M125 NDU;Lo;0;R;;;;;N;;;;;
+1E8B1;MENDE KIKAKUI SYLLABLE M191 NDEE;Lo;0;R;;;;;N;;;;;
+1E8B2;MENDE KIKAKUI SYLLABLE M119 NDE;Lo;0;R;;;;;N;;;;;
+1E8B3;MENDE KIKAKUI SYLLABLE M067 NDOO;Lo;0;R;;;;;N;;;;;
+1E8B4;MENDE KIKAKUI SYLLABLE M064 NDO;Lo;0;R;;;;;N;;;;;
+1E8B5;MENDE KIKAKUI SYLLABLE M152 NJA;Lo;0;R;;;;;N;;;;;
+1E8B6;MENDE KIKAKUI SYLLABLE M192 NJU;Lo;0;R;;;;;N;;;;;
+1E8B7;MENDE KIKAKUI SYLLABLE M149 NJEE;Lo;0;R;;;;;N;;;;;
+1E8B8;MENDE KIKAKUI SYLLABLE M134 NJOO;Lo;0;R;;;;;N;;;;;
+1E8B9;MENDE KIKAKUI SYLLABLE M182 VI;Lo;0;R;;;;;N;;;;;
+1E8BA;MENDE KIKAKUI SYLLABLE M185 VA;Lo;0;R;;;;;N;;;;;
+1E8BB;MENDE KIKAKUI SYLLABLE M151 VU;Lo;0;R;;;;;N;;;;;
+1E8BC;MENDE KIKAKUI SYLLABLE M173 VEE;Lo;0;R;;;;;N;;;;;
+1E8BD;MENDE KIKAKUI SYLLABLE M085 VE;Lo;0;R;;;;;N;;;;;
+1E8BE;MENDE KIKAKUI SYLLABLE M144 VOO;Lo;0;R;;;;;N;;;;;
+1E8BF;MENDE KIKAKUI SYLLABLE M077 VO;Lo;0;R;;;;;N;;;;;
+1E8C0;MENDE KIKAKUI SYLLABLE M164 NYIN;Lo;0;R;;;;;N;;;;;
+1E8C1;MENDE KIKAKUI SYLLABLE M058 NYAN;Lo;0;R;;;;;N;;;;;
+1E8C2;MENDE KIKAKUI SYLLABLE M170 NYUN;Lo;0;R;;;;;N;;;;;
+1E8C3;MENDE KIKAKUI SYLLABLE M098 NYEN;Lo;0;R;;;;;N;;;;;
+1E8C4;MENDE KIKAKUI SYLLABLE M060 NYON;Lo;0;R;;;;;N;;;;;
+1E8C7;MENDE KIKAKUI DIGIT ONE;No;0;R;;;;1;N;;;;;
+1E8C8;MENDE KIKAKUI DIGIT TWO;No;0;R;;;;2;N;;;;;
+1E8C9;MENDE KIKAKUI DIGIT THREE;No;0;R;;;;3;N;;;;;
+1E8CA;MENDE KIKAKUI DIGIT FOUR;No;0;R;;;;4;N;;;;;
+1E8CB;MENDE KIKAKUI DIGIT FIVE;No;0;R;;;;5;N;;;;;
+1E8CC;MENDE KIKAKUI DIGIT SIX;No;0;R;;;;6;N;;;;;
+1E8CD;MENDE KIKAKUI DIGIT SEVEN;No;0;R;;;;7;N;;;;;
+1E8CE;MENDE KIKAKUI DIGIT EIGHT;No;0;R;;;;8;N;;;;;
+1E8CF;MENDE KIKAKUI DIGIT NINE;No;0;R;;;;9;N;;;;;
+1E8D0;MENDE KIKAKUI COMBINING NUMBER TEENS;Mn;220;NSM;;;;;N;;;;;
+1E8D1;MENDE KIKAKUI COMBINING NUMBER TENS;Mn;220;NSM;;;;;N;;;;;
+1E8D2;MENDE KIKAKUI COMBINING NUMBER HUNDREDS;Mn;220;NSM;;;;;N;;;;;
+1E8D3;MENDE KIKAKUI COMBINING NUMBER THOUSANDS;Mn;220;NSM;;;;;N;;;;;
+1E8D4;MENDE KIKAKUI COMBINING NUMBER TEN THOUSANDS;Mn;220;NSM;;;;;N;;;;;
+1E8D5;MENDE KIKAKUI COMBINING NUMBER HUNDRED THOUSANDS;Mn;220;NSM;;;;;N;;;;;
+1E8D6;MENDE KIKAKUI COMBINING NUMBER MILLIONS;Mn;220;NSM;;;;;N;;;;;
+1E900;ADLAM CAPITAL LETTER ALIF;Lu;0;R;;;;;N;;;;1E922;
+1E901;ADLAM CAPITAL LETTER DAALI;Lu;0;R;;;;;N;;;;1E923;
+1E902;ADLAM CAPITAL LETTER LAAM;Lu;0;R;;;;;N;;;;1E924;
+1E903;ADLAM CAPITAL LETTER MIIM;Lu;0;R;;;;;N;;;;1E925;
+1E904;ADLAM CAPITAL LETTER BA;Lu;0;R;;;;;N;;;;1E926;
+1E905;ADLAM CAPITAL LETTER SINNYIIYHE;Lu;0;R;;;;;N;;;;1E927;
+1E906;ADLAM CAPITAL LETTER PE;Lu;0;R;;;;;N;;;;1E928;
+1E907;ADLAM CAPITAL LETTER BHE;Lu;0;R;;;;;N;;;;1E929;
+1E908;ADLAM CAPITAL LETTER RA;Lu;0;R;;;;;N;;;;1E92A;
+1E909;ADLAM CAPITAL LETTER E;Lu;0;R;;;;;N;;;;1E92B;
+1E90A;ADLAM CAPITAL LETTER FA;Lu;0;R;;;;;N;;;;1E92C;
+1E90B;ADLAM CAPITAL LETTER I;Lu;0;R;;;;;N;;;;1E92D;
+1E90C;ADLAM CAPITAL LETTER O;Lu;0;R;;;;;N;;;;1E92E;
+1E90D;ADLAM CAPITAL LETTER DHA;Lu;0;R;;;;;N;;;;1E92F;
+1E90E;ADLAM CAPITAL LETTER YHE;Lu;0;R;;;;;N;;;;1E930;
+1E90F;ADLAM CAPITAL LETTER WAW;Lu;0;R;;;;;N;;;;1E931;
+1E910;ADLAM CAPITAL LETTER NUN;Lu;0;R;;;;;N;;;;1E932;
+1E911;ADLAM CAPITAL LETTER KAF;Lu;0;R;;;;;N;;;;1E933;
+1E912;ADLAM CAPITAL LETTER YA;Lu;0;R;;;;;N;;;;1E934;
+1E913;ADLAM CAPITAL LETTER U;Lu;0;R;;;;;N;;;;1E935;
+1E914;ADLAM CAPITAL LETTER JIIM;Lu;0;R;;;;;N;;;;1E936;
+1E915;ADLAM CAPITAL LETTER CHI;Lu;0;R;;;;;N;;;;1E937;
+1E916;ADLAM CAPITAL LETTER HA;Lu;0;R;;;;;N;;;;1E938;
+1E917;ADLAM CAPITAL LETTER QAAF;Lu;0;R;;;;;N;;;;1E939;
+1E918;ADLAM CAPITAL LETTER GA;Lu;0;R;;;;;N;;;;1E93A;
+1E919;ADLAM CAPITAL LETTER NYA;Lu;0;R;;;;;N;;;;1E93B;
+1E91A;ADLAM CAPITAL LETTER TU;Lu;0;R;;;;;N;;;;1E93C;
+1E91B;ADLAM CAPITAL LETTER NHA;Lu;0;R;;;;;N;;;;1E93D;
+1E91C;ADLAM CAPITAL LETTER VA;Lu;0;R;;;;;N;;;;1E93E;
+1E91D;ADLAM CAPITAL LETTER KHA;Lu;0;R;;;;;N;;;;1E93F;
+1E91E;ADLAM CAPITAL LETTER GBE;Lu;0;R;;;;;N;;;;1E940;
+1E91F;ADLAM CAPITAL LETTER ZAL;Lu;0;R;;;;;N;;;;1E941;
+1E920;ADLAM CAPITAL LETTER KPO;Lu;0;R;;;;;N;;;;1E942;
+1E921;ADLAM CAPITAL LETTER SHA;Lu;0;R;;;;;N;;;;1E943;
+1E922;ADLAM SMALL LETTER ALIF;Ll;0;R;;;;;N;;;1E900;;1E900
+1E923;ADLAM SMALL LETTER DAALI;Ll;0;R;;;;;N;;;1E901;;1E901
+1E924;ADLAM SMALL LETTER LAAM;Ll;0;R;;;;;N;;;1E902;;1E902
+1E925;ADLAM SMALL LETTER MIIM;Ll;0;R;;;;;N;;;1E903;;1E903
+1E926;ADLAM SMALL LETTER BA;Ll;0;R;;;;;N;;;1E904;;1E904
+1E927;ADLAM SMALL LETTER SINNYIIYHE;Ll;0;R;;;;;N;;;1E905;;1E905
+1E928;ADLAM SMALL LETTER PE;Ll;0;R;;;;;N;;;1E906;;1E906
+1E929;ADLAM SMALL LETTER BHE;Ll;0;R;;;;;N;;;1E907;;1E907
+1E92A;ADLAM SMALL LETTER RA;Ll;0;R;;;;;N;;;1E908;;1E908
+1E92B;ADLAM SMALL LETTER E;Ll;0;R;;;;;N;;;1E909;;1E909
+1E92C;ADLAM SMALL LETTER FA;Ll;0;R;;;;;N;;;1E90A;;1E90A
+1E92D;ADLAM SMALL LETTER I;Ll;0;R;;;;;N;;;1E90B;;1E90B
+1E92E;ADLAM SMALL LETTER O;Ll;0;R;;;;;N;;;1E90C;;1E90C
+1E92F;ADLAM SMALL LETTER DHA;Ll;0;R;;;;;N;;;1E90D;;1E90D
+1E930;ADLAM SMALL LETTER YHE;Ll;0;R;;;;;N;;;1E90E;;1E90E
+1E931;ADLAM SMALL LETTER WAW;Ll;0;R;;;;;N;;;1E90F;;1E90F
+1E932;ADLAM SMALL LETTER NUN;Ll;0;R;;;;;N;;;1E910;;1E910
+1E933;ADLAM SMALL LETTER KAF;Ll;0;R;;;;;N;;;1E911;;1E911
+1E934;ADLAM SMALL LETTER YA;Ll;0;R;;;;;N;;;1E912;;1E912
+1E935;ADLAM SMALL LETTER U;Ll;0;R;;;;;N;;;1E913;;1E913
+1E936;ADLAM SMALL LETTER JIIM;Ll;0;R;;;;;N;;;1E914;;1E914
+1E937;ADLAM SMALL LETTER CHI;Ll;0;R;;;;;N;;;1E915;;1E915
+1E938;ADLAM SMALL LETTER HA;Ll;0;R;;;;;N;;;1E916;;1E916
+1E939;ADLAM SMALL LETTER QAAF;Ll;0;R;;;;;N;;;1E917;;1E917
+1E93A;ADLAM SMALL LETTER GA;Ll;0;R;;;;;N;;;1E918;;1E918
+1E93B;ADLAM SMALL LETTER NYA;Ll;0;R;;;;;N;;;1E919;;1E919
+1E93C;ADLAM SMALL LETTER TU;Ll;0;R;;;;;N;;;1E91A;;1E91A
+1E93D;ADLAM SMALL LETTER NHA;Ll;0;R;;;;;N;;;1E91B;;1E91B
+1E93E;ADLAM SMALL LETTER VA;Ll;0;R;;;;;N;;;1E91C;;1E91C
+1E93F;ADLAM SMALL LETTER KHA;Ll;0;R;;;;;N;;;1E91D;;1E91D
+1E940;ADLAM SMALL LETTER GBE;Ll;0;R;;;;;N;;;1E91E;;1E91E
+1E941;ADLAM SMALL LETTER ZAL;Ll;0;R;;;;;N;;;1E91F;;1E91F
+1E942;ADLAM SMALL LETTER KPO;Ll;0;R;;;;;N;;;1E920;;1E920
+1E943;ADLAM SMALL LETTER SHA;Ll;0;R;;;;;N;;;1E921;;1E921
+1E944;ADLAM ALIF LENGTHENER;Mn;230;NSM;;;;;N;;;;;
+1E945;ADLAM VOWEL LENGTHENER;Mn;230;NSM;;;;;N;;;;;
+1E946;ADLAM GEMINATION MARK;Mn;230;NSM;;;;;N;;;;;
+1E947;ADLAM HAMZA;Mn;230;NSM;;;;;N;;;;;
+1E948;ADLAM CONSONANT MODIFIER;Mn;230;NSM;;;;;N;;;;;
+1E949;ADLAM GEMINATE CONSONANT MODIFIER;Mn;230;NSM;;;;;N;;;;;
+1E94A;ADLAM NUKTA;Mn;7;NSM;;;;;N;;;;;
+1E950;ADLAM DIGIT ZERO;Nd;0;R;;0;0;0;N;;;;;
+1E951;ADLAM DIGIT ONE;Nd;0;R;;1;1;1;N;;;;;
+1E952;ADLAM DIGIT TWO;Nd;0;R;;2;2;2;N;;;;;
+1E953;ADLAM DIGIT THREE;Nd;0;R;;3;3;3;N;;;;;
+1E954;ADLAM DIGIT FOUR;Nd;0;R;;4;4;4;N;;;;;
+1E955;ADLAM DIGIT FIVE;Nd;0;R;;5;5;5;N;;;;;
+1E956;ADLAM DIGIT SIX;Nd;0;R;;6;6;6;N;;;;;
+1E957;ADLAM DIGIT SEVEN;Nd;0;R;;7;7;7;N;;;;;
+1E958;ADLAM DIGIT EIGHT;Nd;0;R;;8;8;8;N;;;;;
+1E959;ADLAM DIGIT NINE;Nd;0;R;;9;9;9;N;;;;;
+1E95E;ADLAM INITIAL EXCLAMATION MARK;Po;0;R;;;;;N;;;;;
+1E95F;ADLAM INITIAL QUESTION MARK;Po;0;R;;;;;N;;;;;
+1EE00;ARABIC MATHEMATICAL ALEF;Lo;0;AL; 0627;;;;N;;;;;
+1EE01;ARABIC MATHEMATICAL BEH;Lo;0;AL; 0628;;;;N;;;;;
+1EE02;ARABIC MATHEMATICAL JEEM;Lo;0;AL; 062C;;;;N;;;;;
+1EE03;ARABIC MATHEMATICAL DAL;Lo;0;AL; 062F;;;;N;;;;;
+1EE05;ARABIC MATHEMATICAL WAW;Lo;0;AL; 0648;;;;N;;;;;
+1EE06;ARABIC MATHEMATICAL ZAIN;Lo;0;AL; 0632;;;;N;;;;;
+1EE07;ARABIC MATHEMATICAL HAH;Lo;0;AL; 062D;;;;N;;;;;
+1EE08;ARABIC MATHEMATICAL TAH;Lo;0;AL; 0637;;;;N;;;;;
+1EE09;ARABIC MATHEMATICAL YEH;Lo;0;AL; 064A;;;;N;;;;;
+1EE0A;ARABIC MATHEMATICAL KAF;Lo;0;AL; 0643;;;;N;;;;;
+1EE0B;ARABIC MATHEMATICAL LAM;Lo;0;AL; 0644;;;;N;;;;;
+1EE0C;ARABIC MATHEMATICAL MEEM;Lo;0;AL; 0645;;;;N;;;;;
+1EE0D;ARABIC MATHEMATICAL NOON;Lo;0;AL; 0646;;;;N;;;;;
+1EE0E;ARABIC MATHEMATICAL SEEN;Lo;0;AL; 0633;;;;N;;;;;
+1EE0F;ARABIC MATHEMATICAL AIN;Lo;0;AL; 0639;;;;N;;;;;
+1EE10;ARABIC MATHEMATICAL FEH;Lo;0;AL; 0641;;;;N;;;;;
+1EE11;ARABIC MATHEMATICAL SAD;Lo;0;AL; 0635;;;;N;;;;;
+1EE12;ARABIC MATHEMATICAL QAF;Lo;0;AL; 0642;;;;N;;;;;
+1EE13;ARABIC MATHEMATICAL REH;Lo;0;AL; 0631;;;;N;;;;;
+1EE14;ARABIC MATHEMATICAL SHEEN;Lo;0;AL; 0634;;;;N;;;;;
+1EE15;ARABIC MATHEMATICAL TEH;Lo;0;AL; 062A;;;;N;;;;;
+1EE16;ARABIC MATHEMATICAL THEH;Lo;0;AL; 062B;;;;N;;;;;
+1EE17;ARABIC MATHEMATICAL KHAH;Lo;0;AL; 062E;;;;N;;;;;
+1EE18;ARABIC MATHEMATICAL THAL;Lo;0;AL; 0630;;;;N;;;;;
+1EE19;ARABIC MATHEMATICAL DAD;Lo;0;AL; 0636;;;;N;;;;;
+1EE1A;ARABIC MATHEMATICAL ZAH;Lo;0;AL; 0638;;;;N;;;;;
+1EE1B;ARABIC MATHEMATICAL GHAIN;Lo;0;AL; 063A;;;;N;;;;;
+1EE1C;ARABIC MATHEMATICAL DOTLESS BEH;Lo;0;AL; 066E;;;;N;;;;;
+1EE1D;ARABIC MATHEMATICAL DOTLESS NOON;Lo;0;AL; 06BA;;;;N;;;;;
+1EE1E;ARABIC MATHEMATICAL DOTLESS FEH;Lo;0;AL; 06A1;;;;N;;;;;
+1EE1F;ARABIC MATHEMATICAL DOTLESS QAF;Lo;0;AL; 066F;;;;N;;;;;
+1EE21;ARABIC MATHEMATICAL INITIAL BEH;Lo;0;AL; 0628;;;;N;;;;;
+1EE22;ARABIC MATHEMATICAL INITIAL JEEM;Lo;0;AL; 062C;;;;N;;;;;
+1EE24;ARABIC MATHEMATICAL INITIAL HEH;Lo;0;AL; 0647;;;;N;;;;;
+1EE27;ARABIC MATHEMATICAL INITIAL HAH;Lo;0;AL; 062D;;;;N;;;;;
+1EE29;ARABIC MATHEMATICAL INITIAL YEH;Lo;0;AL; 064A;;;;N;;;;;
+1EE2A;ARABIC MATHEMATICAL INITIAL KAF;Lo;0;AL; 0643;;;;N;;;;;
+1EE2B;ARABIC MATHEMATICAL INITIAL LAM;Lo;0;AL; 0644;;;;N;;;;;
+1EE2C;ARABIC MATHEMATICAL INITIAL MEEM;Lo;0;AL; 0645;;;;N;;;;;
+1EE2D;ARABIC MATHEMATICAL INITIAL NOON;Lo;0;AL; 0646;;;;N;;;;;
+1EE2E;ARABIC MATHEMATICAL INITIAL SEEN;Lo;0;AL; 0633;;;;N;;;;;
+1EE2F;ARABIC MATHEMATICAL INITIAL AIN;Lo;0;AL; 0639;;;;N;;;;;
+1EE30;ARABIC MATHEMATICAL INITIAL FEH;Lo;0;AL; 0641;;;;N;;;;;
+1EE31;ARABIC MATHEMATICAL INITIAL SAD;Lo;0;AL; 0635;;;;N;;;;;
+1EE32;ARABIC MATHEMATICAL INITIAL QAF;Lo;0;AL; 0642;;;;N;;;;;
+1EE34;ARABIC MATHEMATICAL INITIAL SHEEN;Lo;0;AL; 0634;;;;N;;;;;
+1EE35;ARABIC MATHEMATICAL INITIAL TEH;Lo;0;AL; 062A;;;;N;;;;;
+1EE36;ARABIC MATHEMATICAL INITIAL THEH;Lo;0;AL; 062B;;;;N;;;;;
+1EE37;ARABIC MATHEMATICAL INITIAL KHAH;Lo;0;AL; 062E;;;;N;;;;;
+1EE39;ARABIC MATHEMATICAL INITIAL DAD;Lo;0;AL; 0636;;;;N;;;;;
+1EE3B;ARABIC MATHEMATICAL INITIAL GHAIN;Lo;0;AL; 063A;;;;N;;;;;
+1EE42;ARABIC MATHEMATICAL TAILED JEEM;Lo;0;AL; 062C;;;;N;;;;;
+1EE47;ARABIC MATHEMATICAL TAILED HAH;Lo;0;AL; 062D;;;;N;;;;;
+1EE49;ARABIC MATHEMATICAL TAILED YEH;Lo;0;AL; 064A;;;;N;;;;;
+1EE4B;ARABIC MATHEMATICAL TAILED LAM;Lo;0;AL; 0644;;;;N;;;;;
+1EE4D;ARABIC MATHEMATICAL TAILED NOON;Lo;0;AL; 0646;;;;N;;;;;
+1EE4E;ARABIC MATHEMATICAL TAILED SEEN;Lo;0;AL; 0633;;;;N;;;;;
+1EE4F;ARABIC MATHEMATICAL TAILED AIN;Lo;0;AL; 0639;;;;N;;;;;
+1EE51;ARABIC MATHEMATICAL TAILED SAD;Lo;0;AL; 0635;;;;N;;;;;
+1EE52;ARABIC MATHEMATICAL TAILED QAF;Lo;0;AL; 0642;;;;N;;;;;
+1EE54;ARABIC MATHEMATICAL TAILED SHEEN;Lo;0;AL; 0634;;;;N;;;;;
+1EE57;ARABIC MATHEMATICAL TAILED KHAH;Lo;0;AL; 062E;;;;N;;;;;
+1EE59;ARABIC MATHEMATICAL TAILED DAD;Lo;0;AL; 0636;;;;N;;;;;
+1EE5B;ARABIC MATHEMATICAL TAILED GHAIN;Lo;0;AL; 063A;;;;N;;;;;
+1EE5D;ARABIC MATHEMATICAL TAILED DOTLESS NOON;Lo;0;AL; 06BA;;;;N;;;;;
+1EE5F;ARABIC MATHEMATICAL TAILED DOTLESS QAF;Lo;0;AL; 066F;;;;N;;;;;
+1EE61;ARABIC MATHEMATICAL STRETCHED BEH;Lo;0;AL; 0628;;;;N;;;;;
+1EE62;ARABIC MATHEMATICAL STRETCHED JEEM;Lo;0;AL; 062C;;;;N;;;;;
+1EE64;ARABIC MATHEMATICAL STRETCHED HEH;Lo;0;AL; 0647;;;;N;;;;;
+1EE67;ARABIC MATHEMATICAL STRETCHED HAH;Lo;0;AL; 062D;;;;N;;;;;
+1EE68;ARABIC MATHEMATICAL STRETCHED TAH;Lo;0;AL; 0637;;;;N;;;;;
+1EE69;ARABIC MATHEMATICAL STRETCHED YEH;Lo;0;AL; 064A;;;;N;;;;;
+1EE6A;ARABIC MATHEMATICAL STRETCHED KAF;Lo;0;AL; 0643;;;;N;;;;;
+1EE6C;ARABIC MATHEMATICAL STRETCHED MEEM;Lo;0;AL; 0645;;;;N;;;;;
+1EE6D;ARABIC MATHEMATICAL STRETCHED NOON;Lo;0;AL; 0646;;;;N;;;;;
+1EE6E;ARABIC MATHEMATICAL STRETCHED SEEN;Lo;0;AL; 0633;;;;N;;;;;
+1EE6F;ARABIC MATHEMATICAL STRETCHED AIN;Lo;0;AL; 0639;;;;N;;;;;
+1EE70;ARABIC MATHEMATICAL STRETCHED FEH;Lo;0;AL; 0641;;;;N;;;;;
+1EE71;ARABIC MATHEMATICAL STRETCHED SAD;Lo;0;AL; 0635;;;;N;;;;;
+1EE72;ARABIC MATHEMATICAL STRETCHED QAF;Lo;0;AL; 0642;;;;N;;;;;
+1EE74;ARABIC MATHEMATICAL STRETCHED SHEEN;Lo;0;AL; 0634;;;;N;;;;;
+1EE75;ARABIC MATHEMATICAL STRETCHED TEH;Lo;0;AL; 062A;;;;N;;;;;
+1EE76;ARABIC MATHEMATICAL STRETCHED THEH;Lo;0;AL; 062B;;;;N;;;;;
+1EE77;ARABIC MATHEMATICAL STRETCHED KHAH;Lo;0;AL; 062E;;;;N;;;;;
+1EE79;ARABIC MATHEMATICAL STRETCHED DAD;Lo;0;AL; 0636;;;;N;;;;;
+1EE7A;ARABIC MATHEMATICAL STRETCHED ZAH;Lo;0;AL; 0638;;;;N;;;;;
+1EE7B;ARABIC MATHEMATICAL STRETCHED GHAIN;Lo;0;AL; 063A;;;;N;;;;;
+1EE7C;ARABIC MATHEMATICAL STRETCHED DOTLESS BEH;Lo;0;AL; 066E;;;;N;;;;;
+1EE7E;ARABIC MATHEMATICAL STRETCHED DOTLESS FEH;Lo;0;AL; 06A1;;;;N;;;;;
+1EE80;ARABIC MATHEMATICAL LOOPED ALEF;Lo;0;AL; 0627;;;;N;;;;;
+1EE81;ARABIC MATHEMATICAL LOOPED BEH;Lo;0;AL; 0628;;;;N;;;;;
+1EE82;ARABIC MATHEMATICAL LOOPED JEEM;Lo;0;AL; 062C;;;;N;;;;;
+1EE83;ARABIC MATHEMATICAL LOOPED DAL;Lo;0;AL; 062F;;;;N;;;;;
+1EE84;ARABIC MATHEMATICAL LOOPED HEH;Lo;0;AL; 0647;;;;N;;;;;
+1EE85;ARABIC MATHEMATICAL LOOPED WAW;Lo;0;AL; 0648;;;;N;;;;;
+1EE86;ARABIC MATHEMATICAL LOOPED ZAIN;Lo;0;AL; 0632;;;;N;;;;;
+1EE87;ARABIC MATHEMATICAL LOOPED HAH;Lo;0;AL; 062D;;;;N;;;;;
+1EE88;ARABIC MATHEMATICAL LOOPED TAH;Lo;0;AL; 0637;;;;N;;;;;
+1EE89;ARABIC MATHEMATICAL LOOPED YEH;Lo;0;AL; 064A;;;;N;;;;;
+1EE8B;ARABIC MATHEMATICAL LOOPED LAM;Lo;0;AL; 0644;;;;N;;;;;
+1EE8C;ARABIC MATHEMATICAL LOOPED MEEM;Lo;0;AL; 0645;;;;N;;;;;
+1EE8D;ARABIC MATHEMATICAL LOOPED NOON;Lo;0;AL; 0646;;;;N;;;;;
+1EE8E;ARABIC MATHEMATICAL LOOPED SEEN;Lo;0;AL; 0633;;;;N;;;;;
+1EE8F;ARABIC MATHEMATICAL LOOPED AIN;Lo;0;AL; 0639;;;;N;;;;;
+1EE90;ARABIC MATHEMATICAL LOOPED FEH;Lo;0;AL; 0641;;;;N;;;;;
+1EE91;ARABIC MATHEMATICAL LOOPED SAD;Lo;0;AL; 0635;;;;N;;;;;
+1EE92;ARABIC MATHEMATICAL LOOPED QAF;Lo;0;AL; 0642;;;;N;;;;;
+1EE93;ARABIC MATHEMATICAL LOOPED REH;Lo;0;AL; 0631;;;;N;;;;;
+1EE94;ARABIC MATHEMATICAL LOOPED SHEEN;Lo;0;AL; 0634;;;;N;;;;;
+1EE95;ARABIC MATHEMATICAL LOOPED TEH;Lo;0;AL; 062A;;;;N;;;;;
+1EE96;ARABIC MATHEMATICAL LOOPED THEH;Lo;0;AL; 062B;;;;N;;;;;
+1EE97;ARABIC MATHEMATICAL LOOPED KHAH;Lo;0;AL; 062E;;;;N;;;;;
+1EE98;ARABIC MATHEMATICAL LOOPED THAL;Lo;0;AL; 0630;;;;N;;;;;
+1EE99;ARABIC MATHEMATICAL LOOPED DAD;Lo;0;AL; 0636;;;;N;;;;;
+1EE9A;ARABIC MATHEMATICAL LOOPED ZAH;Lo;0;AL; 0638;;;;N;;;;;
+1EE9B;ARABIC MATHEMATICAL LOOPED GHAIN;Lo;0;AL; 063A;;;;N;;;;;
+1EEA1;ARABIC MATHEMATICAL DOUBLE-STRUCK BEH;Lo;0;AL; 0628;;;;N;;;;;
+1EEA2;ARABIC MATHEMATICAL DOUBLE-STRUCK JEEM;Lo;0;AL; 062C;;;;N;;;;;
+1EEA3;ARABIC MATHEMATICAL DOUBLE-STRUCK DAL;Lo;0;AL; 062F;;;;N;;;;;
+1EEA5;ARABIC MATHEMATICAL DOUBLE-STRUCK WAW;Lo;0;AL; 0648;;;;N;;;;;
+1EEA6;ARABIC MATHEMATICAL DOUBLE-STRUCK ZAIN;Lo;0;AL; 0632;;;;N;;;;;
+1EEA7;ARABIC MATHEMATICAL DOUBLE-STRUCK HAH;Lo;0;AL; 062D;;;;N;;;;;
+1EEA8;ARABIC MATHEMATICAL DOUBLE-STRUCK TAH;Lo;0;AL; 0637;;;;N;;;;;
+1EEA9;ARABIC MATHEMATICAL DOUBLE-STRUCK YEH;Lo;0;AL; 064A;;;;N;;;;;
+1EEAB;ARABIC MATHEMATICAL DOUBLE-STRUCK LAM;Lo;0;AL; 0644;;;;N;;;;;
+1EEAC;ARABIC MATHEMATICAL DOUBLE-STRUCK MEEM;Lo;0;AL; 0645;;;;N;;;;;
+1EEAD;ARABIC MATHEMATICAL DOUBLE-STRUCK NOON;Lo;0;AL; 0646;;;;N;;;;;
+1EEAE;ARABIC MATHEMATICAL DOUBLE-STRUCK SEEN;Lo;0;AL; 0633;;;;N;;;;;
+1EEAF;ARABIC MATHEMATICAL DOUBLE-STRUCK AIN;Lo;0;AL; 0639;;;;N;;;;;
+1EEB0;ARABIC MATHEMATICAL DOUBLE-STRUCK FEH;Lo;0;AL; 0641;;;;N;;;;;
+1EEB1;ARABIC MATHEMATICAL DOUBLE-STRUCK SAD;Lo;0;AL; 0635;;;;N;;;;;
+1EEB2;ARABIC MATHEMATICAL DOUBLE-STRUCK QAF;Lo;0;AL; 0642;;;;N;;;;;
+1EEB3;ARABIC MATHEMATICAL DOUBLE-STRUCK REH;Lo;0;AL; 0631;;;;N;;;;;
+1EEB4;ARABIC MATHEMATICAL DOUBLE-STRUCK SHEEN;Lo;0;AL; 0634;;;;N;;;;;
+1EEB5;ARABIC MATHEMATICAL DOUBLE-STRUCK TEH;Lo;0;AL; 062A;;;;N;;;;;
+1EEB6;ARABIC MATHEMATICAL DOUBLE-STRUCK THEH;Lo;0;AL; 062B;;;;N;;;;;
+1EEB7;ARABIC MATHEMATICAL DOUBLE-STRUCK KHAH;Lo;0;AL; 062E;;;;N;;;;;
+1EEB8;ARABIC MATHEMATICAL DOUBLE-STRUCK THAL;Lo;0;AL; 0630;;;;N;;;;;
+1EEB9;ARABIC MATHEMATICAL DOUBLE-STRUCK DAD;Lo;0;AL; 0636;;;;N;;;;;
+1EEBA;ARABIC MATHEMATICAL DOUBLE-STRUCK ZAH;Lo;0;AL; 0638;;;;N;;;;;
+1EEBB;ARABIC MATHEMATICAL DOUBLE-STRUCK GHAIN;Lo;0;AL; 063A;;;;N;;;;;
+1EEF0;ARABIC MATHEMATICAL OPERATOR MEEM WITH HAH WITH TATWEEL;Sm;0;ON;;;;;N;;;;;
+1EEF1;ARABIC MATHEMATICAL OPERATOR HAH WITH DAL;Sm;0;ON;;;;;N;;;;;
+1F000;MAHJONG TILE EAST WIND;So;0;ON;;;;;N;;;;;
+1F001;MAHJONG TILE SOUTH WIND;So;0;ON;;;;;N;;;;;
+1F002;MAHJONG TILE WEST WIND;So;0;ON;;;;;N;;;;;
+1F003;MAHJONG TILE NORTH WIND;So;0;ON;;;;;N;;;;;
+1F004;MAHJONG TILE RED DRAGON;So;0;ON;;;;;N;;;;;
+1F005;MAHJONG TILE GREEN DRAGON;So;0;ON;;;;;N;;;;;
+1F006;MAHJONG TILE WHITE DRAGON;So;0;ON;;;;;N;;;;;
+1F007;MAHJONG TILE ONE OF CHARACTERS;So;0;ON;;;;;N;;;;;
+1F008;MAHJONG TILE TWO OF CHARACTERS;So;0;ON;;;;;N;;;;;
+1F009;MAHJONG TILE THREE OF CHARACTERS;So;0;ON;;;;;N;;;;;
+1F00A;MAHJONG TILE FOUR OF CHARACTERS;So;0;ON;;;;;N;;;;;
+1F00B;MAHJONG TILE FIVE OF CHARACTERS;So;0;ON;;;;;N;;;;;
+1F00C;MAHJONG TILE SIX OF CHARACTERS;So;0;ON;;;;;N;;;;;
+1F00D;MAHJONG TILE SEVEN OF CHARACTERS;So;0;ON;;;;;N;;;;;
+1F00E;MAHJONG TILE EIGHT OF CHARACTERS;So;0;ON;;;;;N;;;;;
+1F00F;MAHJONG TILE NINE OF CHARACTERS;So;0;ON;;;;;N;;;;;
+1F010;MAHJONG TILE ONE OF BAMBOOS;So;0;ON;;;;;N;;;;;
+1F011;MAHJONG TILE TWO OF BAMBOOS;So;0;ON;;;;;N;;;;;
+1F012;MAHJONG TILE THREE OF BAMBOOS;So;0;ON;;;;;N;;;;;
+1F013;MAHJONG TILE FOUR OF BAMBOOS;So;0;ON;;;;;N;;;;;
+1F014;MAHJONG TILE FIVE OF BAMBOOS;So;0;ON;;;;;N;;;;;
+1F015;MAHJONG TILE SIX OF BAMBOOS;So;0;ON;;;;;N;;;;;
+1F016;MAHJONG TILE SEVEN OF BAMBOOS;So;0;ON;;;;;N;;;;;
+1F017;MAHJONG TILE EIGHT OF BAMBOOS;So;0;ON;;;;;N;;;;;
+1F018;MAHJONG TILE NINE OF BAMBOOS;So;0;ON;;;;;N;;;;;
+1F019;MAHJONG TILE ONE OF CIRCLES;So;0;ON;;;;;N;;;;;
+1F01A;MAHJONG TILE TWO OF CIRCLES;So;0;ON;;;;;N;;;;;
+1F01B;MAHJONG TILE THREE OF CIRCLES;So;0;ON;;;;;N;;;;;
+1F01C;MAHJONG TILE FOUR OF CIRCLES;So;0;ON;;;;;N;;;;;
+1F01D;MAHJONG TILE FIVE OF CIRCLES;So;0;ON;;;;;N;;;;;
+1F01E;MAHJONG TILE SIX OF CIRCLES;So;0;ON;;;;;N;;;;;
+1F01F;MAHJONG TILE SEVEN OF CIRCLES;So;0;ON;;;;;N;;;;;
+1F020;MAHJONG TILE EIGHT OF CIRCLES;So;0;ON;;;;;N;;;;;
+1F021;MAHJONG TILE NINE OF CIRCLES;So;0;ON;;;;;N;;;;;
+1F022;MAHJONG TILE PLUM;So;0;ON;;;;;N;;;;;
+1F023;MAHJONG TILE ORCHID;So;0;ON;;;;;N;;;;;
+1F024;MAHJONG TILE BAMBOO;So;0;ON;;;;;N;;;;;
+1F025;MAHJONG TILE CHRYSANTHEMUM;So;0;ON;;;;;N;;;;;
+1F026;MAHJONG TILE SPRING;So;0;ON;;;;;N;;;;;
+1F027;MAHJONG TILE SUMMER;So;0;ON;;;;;N;;;;;
+1F028;MAHJONG TILE AUTUMN;So;0;ON;;;;;N;;;;;
+1F029;MAHJONG TILE WINTER;So;0;ON;;;;;N;;;;;
+1F02A;MAHJONG TILE JOKER;So;0;ON;;;;;N;;;;;
+1F02B;MAHJONG TILE BACK;So;0;ON;;;;;N;;;;;
+1F030;DOMINO TILE HORIZONTAL BACK;So;0;ON;;;;;N;;;;;
+1F031;DOMINO TILE HORIZONTAL-00-00;So;0;ON;;;;;N;;;;;
+1F032;DOMINO TILE HORIZONTAL-00-01;So;0;ON;;;;;N;;;;;
+1F033;DOMINO TILE HORIZONTAL-00-02;So;0;ON;;;;;N;;;;;
+1F034;DOMINO TILE HORIZONTAL-00-03;So;0;ON;;;;;N;;;;;
+1F035;DOMINO TILE HORIZONTAL-00-04;So;0;ON;;;;;N;;;;;
+1F036;DOMINO TILE HORIZONTAL-00-05;So;0;ON;;;;;N;;;;;
+1F037;DOMINO TILE HORIZONTAL-00-06;So;0;ON;;;;;N;;;;;
+1F038;DOMINO TILE HORIZONTAL-01-00;So;0;ON;;;;;N;;;;;
+1F039;DOMINO TILE HORIZONTAL-01-01;So;0;ON;;;;;N;;;;;
+1F03A;DOMINO TILE HORIZONTAL-01-02;So;0;ON;;;;;N;;;;;
+1F03B;DOMINO TILE HORIZONTAL-01-03;So;0;ON;;;;;N;;;;;
+1F03C;DOMINO TILE HORIZONTAL-01-04;So;0;ON;;;;;N;;;;;
+1F03D;DOMINO TILE HORIZONTAL-01-05;So;0;ON;;;;;N;;;;;
+1F03E;DOMINO TILE HORIZONTAL-01-06;So;0;ON;;;;;N;;;;;
+1F03F;DOMINO TILE HORIZONTAL-02-00;So;0;ON;;;;;N;;;;;
+1F040;DOMINO TILE HORIZONTAL-02-01;So;0;ON;;;;;N;;;;;
+1F041;DOMINO TILE HORIZONTAL-02-02;So;0;ON;;;;;N;;;;;
+1F042;DOMINO TILE HORIZONTAL-02-03;So;0;ON;;;;;N;;;;;
+1F043;DOMINO TILE HORIZONTAL-02-04;So;0;ON;;;;;N;;;;;
+1F044;DOMINO TILE HORIZONTAL-02-05;So;0;ON;;;;;N;;;;;
+1F045;DOMINO TILE HORIZONTAL-02-06;So;0;ON;;;;;N;;;;;
+1F046;DOMINO TILE HORIZONTAL-03-00;So;0;ON;;;;;N;;;;;
+1F047;DOMINO TILE HORIZONTAL-03-01;So;0;ON;;;;;N;;;;;
+1F048;DOMINO TILE HORIZONTAL-03-02;So;0;ON;;;;;N;;;;;
+1F049;DOMINO TILE HORIZONTAL-03-03;So;0;ON;;;;;N;;;;;
+1F04A;DOMINO TILE HORIZONTAL-03-04;So;0;ON;;;;;N;;;;;
+1F04B;DOMINO TILE HORIZONTAL-03-05;So;0;ON;;;;;N;;;;;
+1F04C;DOMINO TILE HORIZONTAL-03-06;So;0;ON;;;;;N;;;;;
+1F04D;DOMINO TILE HORIZONTAL-04-00;So;0;ON;;;;;N;;;;;
+1F04E;DOMINO TILE HORIZONTAL-04-01;So;0;ON;;;;;N;;;;;
+1F04F;DOMINO TILE HORIZONTAL-04-02;So;0;ON;;;;;N;;;;;
+1F050;DOMINO TILE HORIZONTAL-04-03;So;0;ON;;;;;N;;;;;
+1F051;DOMINO TILE HORIZONTAL-04-04;So;0;ON;;;;;N;;;;;
+1F052;DOMINO TILE HORIZONTAL-04-05;So;0;ON;;;;;N;;;;;
+1F053;DOMINO TILE HORIZONTAL-04-06;So;0;ON;;;;;N;;;;;
+1F054;DOMINO TILE HORIZONTAL-05-00;So;0;ON;;;;;N;;;;;
+1F055;DOMINO TILE HORIZONTAL-05-01;So;0;ON;;;;;N;;;;;
+1F056;DOMINO TILE HORIZONTAL-05-02;So;0;ON;;;;;N;;;;;
+1F057;DOMINO TILE HORIZONTAL-05-03;So;0;ON;;;;;N;;;;;
+1F058;DOMINO TILE HORIZONTAL-05-04;So;0;ON;;;;;N;;;;;
+1F059;DOMINO TILE HORIZONTAL-05-05;So;0;ON;;;;;N;;;;;
+1F05A;DOMINO TILE HORIZONTAL-05-06;So;0;ON;;;;;N;;;;;
+1F05B;DOMINO TILE HORIZONTAL-06-00;So;0;ON;;;;;N;;;;;
+1F05C;DOMINO TILE HORIZONTAL-06-01;So;0;ON;;;;;N;;;;;
+1F05D;DOMINO TILE HORIZONTAL-06-02;So;0;ON;;;;;N;;;;;
+1F05E;DOMINO TILE HORIZONTAL-06-03;So;0;ON;;;;;N;;;;;
+1F05F;DOMINO TILE HORIZONTAL-06-04;So;0;ON;;;;;N;;;;;
+1F060;DOMINO TILE HORIZONTAL-06-05;So;0;ON;;;;;N;;;;;
+1F061;DOMINO TILE HORIZONTAL-06-06;So;0;ON;;;;;N;;;;;
+1F062;DOMINO TILE VERTICAL BACK;So;0;ON;;;;;N;;;;;
+1F063;DOMINO TILE VERTICAL-00-00;So;0;ON;;;;;N;;;;;
+1F064;DOMINO TILE VERTICAL-00-01;So;0;ON;;;;;N;;;;;
+1F065;DOMINO TILE VERTICAL-00-02;So;0;ON;;;;;N;;;;;
+1F066;DOMINO TILE VERTICAL-00-03;So;0;ON;;;;;N;;;;;
+1F067;DOMINO TILE VERTICAL-00-04;So;0;ON;;;;;N;;;;;
+1F068;DOMINO TILE VERTICAL-00-05;So;0;ON;;;;;N;;;;;
+1F069;DOMINO TILE VERTICAL-00-06;So;0;ON;;;;;N;;;;;
+1F06A;DOMINO TILE VERTICAL-01-00;So;0;ON;;;;;N;;;;;
+1F06B;DOMINO TILE VERTICAL-01-01;So;0;ON;;;;;N;;;;;
+1F06C;DOMINO TILE VERTICAL-01-02;So;0;ON;;;;;N;;;;;
+1F06D;DOMINO TILE VERTICAL-01-03;So;0;ON;;;;;N;;;;;
+1F06E;DOMINO TILE VERTICAL-01-04;So;0;ON;;;;;N;;;;;
+1F06F;DOMINO TILE VERTICAL-01-05;So;0;ON;;;;;N;;;;;
+1F070;DOMINO TILE VERTICAL-01-06;So;0;ON;;;;;N;;;;;
+1F071;DOMINO TILE VERTICAL-02-00;So;0;ON;;;;;N;;;;;
+1F072;DOMINO TILE VERTICAL-02-01;So;0;ON;;;;;N;;;;;
+1F073;DOMINO TILE VERTICAL-02-02;So;0;ON;;;;;N;;;;;
+1F074;DOMINO TILE VERTICAL-02-03;So;0;ON;;;;;N;;;;;
+1F075;DOMINO TILE VERTICAL-02-04;So;0;ON;;;;;N;;;;;
+1F076;DOMINO TILE VERTICAL-02-05;So;0;ON;;;;;N;;;;;
+1F077;DOMINO TILE VERTICAL-02-06;So;0;ON;;;;;N;;;;;
+1F078;DOMINO TILE VERTICAL-03-00;So;0;ON;;;;;N;;;;;
+1F079;DOMINO TILE VERTICAL-03-01;So;0;ON;;;;;N;;;;;
+1F07A;DOMINO TILE VERTICAL-03-02;So;0;ON;;;;;N;;;;;
+1F07B;DOMINO TILE VERTICAL-03-03;So;0;ON;;;;;N;;;;;
+1F07C;DOMINO TILE VERTICAL-03-04;So;0;ON;;;;;N;;;;;
+1F07D;DOMINO TILE VERTICAL-03-05;So;0;ON;;;;;N;;;;;
+1F07E;DOMINO TILE VERTICAL-03-06;So;0;ON;;;;;N;;;;;
+1F07F;DOMINO TILE VERTICAL-04-00;So;0;ON;;;;;N;;;;;
+1F080;DOMINO TILE VERTICAL-04-01;So;0;ON;;;;;N;;;;;
+1F081;DOMINO TILE VERTICAL-04-02;So;0;ON;;;;;N;;;;;
+1F082;DOMINO TILE VERTICAL-04-03;So;0;ON;;;;;N;;;;;
+1F083;DOMINO TILE VERTICAL-04-04;So;0;ON;;;;;N;;;;;
+1F084;DOMINO TILE VERTICAL-04-05;So;0;ON;;;;;N;;;;;
+1F085;DOMINO TILE VERTICAL-04-06;So;0;ON;;;;;N;;;;;
+1F086;DOMINO TILE VERTICAL-05-00;So;0;ON;;;;;N;;;;;
+1F087;DOMINO TILE VERTICAL-05-01;So;0;ON;;;;;N;;;;;
+1F088;DOMINO TILE VERTICAL-05-02;So;0;ON;;;;;N;;;;;
+1F089;DOMINO TILE VERTICAL-05-03;So;0;ON;;;;;N;;;;;
+1F08A;DOMINO TILE VERTICAL-05-04;So;0;ON;;;;;N;;;;;
+1F08B;DOMINO TILE VERTICAL-05-05;So;0;ON;;;;;N;;;;;
+1F08C;DOMINO TILE VERTICAL-05-06;So;0;ON;;;;;N;;;;;
+1F08D;DOMINO TILE VERTICAL-06-00;So;0;ON;;;;;N;;;;;
+1F08E;DOMINO TILE VERTICAL-06-01;So;0;ON;;;;;N;;;;;
+1F08F;DOMINO TILE VERTICAL-06-02;So;0;ON;;;;;N;;;;;
+1F090;DOMINO TILE VERTICAL-06-03;So;0;ON;;;;;N;;;;;
+1F091;DOMINO TILE VERTICAL-06-04;So;0;ON;;;;;N;;;;;
+1F092;DOMINO TILE VERTICAL-06-05;So;0;ON;;;;;N;;;;;
+1F093;DOMINO TILE VERTICAL-06-06;So;0;ON;;;;;N;;;;;
+1F0A0;PLAYING CARD BACK;So;0;ON;;;;;N;;;;;
+1F0A1;PLAYING CARD ACE OF SPADES;So;0;ON;;;;;N;;;;;
+1F0A2;PLAYING CARD TWO OF SPADES;So;0;ON;;;;;N;;;;;
+1F0A3;PLAYING CARD THREE OF SPADES;So;0;ON;;;;;N;;;;;
+1F0A4;PLAYING CARD FOUR OF SPADES;So;0;ON;;;;;N;;;;;
+1F0A5;PLAYING CARD FIVE OF SPADES;So;0;ON;;;;;N;;;;;
+1F0A6;PLAYING CARD SIX OF SPADES;So;0;ON;;;;;N;;;;;
+1F0A7;PLAYING CARD SEVEN OF SPADES;So;0;ON;;;;;N;;;;;
+1F0A8;PLAYING CARD EIGHT OF SPADES;So;0;ON;;;;;N;;;;;
+1F0A9;PLAYING CARD NINE OF SPADES;So;0;ON;;;;;N;;;;;
+1F0AA;PLAYING CARD TEN OF SPADES;So;0;ON;;;;;N;;;;;
+1F0AB;PLAYING CARD JACK OF SPADES;So;0;ON;;;;;N;;;;;
+1F0AC;PLAYING CARD KNIGHT OF SPADES;So;0;ON;;;;;N;;;;;
+1F0AD;PLAYING CARD QUEEN OF SPADES;So;0;ON;;;;;N;;;;;
+1F0AE;PLAYING CARD KING OF SPADES;So;0;ON;;;;;N;;;;;
+1F0B1;PLAYING CARD ACE OF HEARTS;So;0;ON;;;;;N;;;;;
+1F0B2;PLAYING CARD TWO OF HEARTS;So;0;ON;;;;;N;;;;;
+1F0B3;PLAYING CARD THREE OF HEARTS;So;0;ON;;;;;N;;;;;
+1F0B4;PLAYING CARD FOUR OF HEARTS;So;0;ON;;;;;N;;;;;
+1F0B5;PLAYING CARD FIVE OF HEARTS;So;0;ON;;;;;N;;;;;
+1F0B6;PLAYING CARD SIX OF HEARTS;So;0;ON;;;;;N;;;;;
+1F0B7;PLAYING CARD SEVEN OF HEARTS;So;0;ON;;;;;N;;;;;
+1F0B8;PLAYING CARD EIGHT OF HEARTS;So;0;ON;;;;;N;;;;;
+1F0B9;PLAYING CARD NINE OF HEARTS;So;0;ON;;;;;N;;;;;
+1F0BA;PLAYING CARD TEN OF HEARTS;So;0;ON;;;;;N;;;;;
+1F0BB;PLAYING CARD JACK OF HEARTS;So;0;ON;;;;;N;;;;;
+1F0BC;PLAYING CARD KNIGHT OF HEARTS;So;0;ON;;;;;N;;;;;
+1F0BD;PLAYING CARD QUEEN OF HEARTS;So;0;ON;;;;;N;;;;;
+1F0BE;PLAYING CARD KING OF HEARTS;So;0;ON;;;;;N;;;;;
+1F0BF;PLAYING CARD RED JOKER;So;0;ON;;;;;N;;;;;
+1F0C1;PLAYING CARD ACE OF DIAMONDS;So;0;ON;;;;;N;;;;;
+1F0C2;PLAYING CARD TWO OF DIAMONDS;So;0;ON;;;;;N;;;;;
+1F0C3;PLAYING CARD THREE OF DIAMONDS;So;0;ON;;;;;N;;;;;
+1F0C4;PLAYING CARD FOUR OF DIAMONDS;So;0;ON;;;;;N;;;;;
+1F0C5;PLAYING CARD FIVE OF DIAMONDS;So;0;ON;;;;;N;;;;;
+1F0C6;PLAYING CARD SIX OF DIAMONDS;So;0;ON;;;;;N;;;;;
+1F0C7;PLAYING CARD SEVEN OF DIAMONDS;So;0;ON;;;;;N;;;;;
+1F0C8;PLAYING CARD EIGHT OF DIAMONDS;So;0;ON;;;;;N;;;;;
+1F0C9;PLAYING CARD NINE OF DIAMONDS;So;0;ON;;;;;N;;;;;
+1F0CA;PLAYING CARD TEN OF DIAMONDS;So;0;ON;;;;;N;;;;;
+1F0CB;PLAYING CARD JACK OF DIAMONDS;So;0;ON;;;;;N;;;;;
+1F0CC;PLAYING CARD KNIGHT OF DIAMONDS;So;0;ON;;;;;N;;;;;
+1F0CD;PLAYING CARD QUEEN OF DIAMONDS;So;0;ON;;;;;N;;;;;
+1F0CE;PLAYING CARD KING OF DIAMONDS;So;0;ON;;;;;N;;;;;
+1F0CF;PLAYING CARD BLACK JOKER;So;0;ON;;;;;N;;;;;
+1F0D1;PLAYING CARD ACE OF CLUBS;So;0;ON;;;;;N;;;;;
+1F0D2;PLAYING CARD TWO OF CLUBS;So;0;ON;;;;;N;;;;;
+1F0D3;PLAYING CARD THREE OF CLUBS;So;0;ON;;;;;N;;;;;
+1F0D4;PLAYING CARD FOUR OF CLUBS;So;0;ON;;;;;N;;;;;
+1F0D5;PLAYING CARD FIVE OF CLUBS;So;0;ON;;;;;N;;;;;
+1F0D6;PLAYING CARD SIX OF CLUBS;So;0;ON;;;;;N;;;;;
+1F0D7;PLAYING CARD SEVEN OF CLUBS;So;0;ON;;;;;N;;;;;
+1F0D8;PLAYING CARD EIGHT OF CLUBS;So;0;ON;;;;;N;;;;;
+1F0D9;PLAYING CARD NINE OF CLUBS;So;0;ON;;;;;N;;;;;
+1F0DA;PLAYING CARD TEN OF CLUBS;So;0;ON;;;;;N;;;;;
+1F0DB;PLAYING CARD JACK OF CLUBS;So;0;ON;;;;;N;;;;;
+1F0DC;PLAYING CARD KNIGHT OF CLUBS;So;0;ON;;;;;N;;;;;
+1F0DD;PLAYING CARD QUEEN OF CLUBS;So;0;ON;;;;;N;;;;;
+1F0DE;PLAYING CARD KING OF CLUBS;So;0;ON;;;;;N;;;;;
+1F0DF;PLAYING CARD WHITE JOKER;So;0;ON;;;;;N;;;;;
+1F0E0;PLAYING CARD FOOL;So;0;ON;;;;;N;;;;;
+1F0E1;PLAYING CARD TRUMP-1;So;0;ON;;;;;N;;;;;
+1F0E2;PLAYING CARD TRUMP-2;So;0;ON;;;;;N;;;;;
+1F0E3;PLAYING CARD TRUMP-3;So;0;ON;;;;;N;;;;;
+1F0E4;PLAYING CARD TRUMP-4;So;0;ON;;;;;N;;;;;
+1F0E5;PLAYING CARD TRUMP-5;So;0;ON;;;;;N;;;;;
+1F0E6;PLAYING CARD TRUMP-6;So;0;ON;;;;;N;;;;;
+1F0E7;PLAYING CARD TRUMP-7;So;0;ON;;;;;N;;;;;
+1F0E8;PLAYING CARD TRUMP-8;So;0;ON;;;;;N;;;;;
+1F0E9;PLAYING CARD TRUMP-9;So;0;ON;;;;;N;;;;;
+1F0EA;PLAYING CARD TRUMP-10;So;0;ON;;;;;N;;;;;
+1F0EB;PLAYING CARD TRUMP-11;So;0;ON;;;;;N;;;;;
+1F0EC;PLAYING CARD TRUMP-12;So;0;ON;;;;;N;;;;;
+1F0ED;PLAYING CARD TRUMP-13;So;0;ON;;;;;N;;;;;
+1F0EE;PLAYING CARD TRUMP-14;So;0;ON;;;;;N;;;;;
+1F0EF;PLAYING CARD TRUMP-15;So;0;ON;;;;;N;;;;;
+1F0F0;PLAYING CARD TRUMP-16;So;0;ON;;;;;N;;;;;
+1F0F1;PLAYING CARD TRUMP-17;So;0;ON;;;;;N;;;;;
+1F0F2;PLAYING CARD TRUMP-18;So;0;ON;;;;;N;;;;;
+1F0F3;PLAYING CARD TRUMP-19;So;0;ON;;;;;N;;;;;
+1F0F4;PLAYING CARD TRUMP-20;So;0;ON;;;;;N;;;;;
+1F0F5;PLAYING CARD TRUMP-21;So;0;ON;;;;;N;;;;;
+1F100;DIGIT ZERO FULL STOP;No;0;EN;<compat> 0030 002E;;0;0;N;;;;;
+1F101;DIGIT ZERO COMMA;No;0;EN;<compat> 0030 002C;;0;0;N;;;;;
+1F102;DIGIT ONE COMMA;No;0;EN;<compat> 0031 002C;;1;1;N;;;;;
+1F103;DIGIT TWO COMMA;No;0;EN;<compat> 0032 002C;;2;2;N;;;;;
+1F104;DIGIT THREE COMMA;No;0;EN;<compat> 0033 002C;;3;3;N;;;;;
+1F105;DIGIT FOUR COMMA;No;0;EN;<compat> 0034 002C;;4;4;N;;;;;
+1F106;DIGIT FIVE COMMA;No;0;EN;<compat> 0035 002C;;5;5;N;;;;;
+1F107;DIGIT SIX COMMA;No;0;EN;<compat> 0036 002C;;6;6;N;;;;;
+1F108;DIGIT SEVEN COMMA;No;0;EN;<compat> 0037 002C;;7;7;N;;;;;
+1F109;DIGIT EIGHT COMMA;No;0;EN;<compat> 0038 002C;;8;8;N;;;;;
+1F10A;DIGIT NINE COMMA;No;0;EN;<compat> 0039 002C;;9;9;N;;;;;
+1F10B;DINGBAT CIRCLED SANS-SERIF DIGIT ZERO;No;0;ON;;;;0;N;;;;;
+1F10C;DINGBAT NEGATIVE CIRCLED SANS-SERIF DIGIT ZERO;No;0;ON;;;;0;N;;;;;
+1F110;PARENTHESIZED LATIN CAPITAL LETTER A;So;0;L;<compat> 0028 0041 0029;;;;N;;;;;
+1F111;PARENTHESIZED LATIN CAPITAL LETTER B;So;0;L;<compat> 0028 0042 0029;;;;N;;;;;
+1F112;PARENTHESIZED LATIN CAPITAL LETTER C;So;0;L;<compat> 0028 0043 0029;;;;N;;;;;
+1F113;PARENTHESIZED LATIN CAPITAL LETTER D;So;0;L;<compat> 0028 0044 0029;;;;N;;;;;
+1F114;PARENTHESIZED LATIN CAPITAL LETTER E;So;0;L;<compat> 0028 0045 0029;;;;N;;;;;
+1F115;PARENTHESIZED LATIN CAPITAL LETTER F;So;0;L;<compat> 0028 0046 0029;;;;N;;;;;
+1F116;PARENTHESIZED LATIN CAPITAL LETTER G;So;0;L;<compat> 0028 0047 0029;;;;N;;;;;
+1F117;PARENTHESIZED LATIN CAPITAL LETTER H;So;0;L;<compat> 0028 0048 0029;;;;N;;;;;
+1F118;PARENTHESIZED LATIN CAPITAL LETTER I;So;0;L;<compat> 0028 0049 0029;;;;N;;;;;
+1F119;PARENTHESIZED LATIN CAPITAL LETTER J;So;0;L;<compat> 0028 004A 0029;;;;N;;;;;
+1F11A;PARENTHESIZED LATIN CAPITAL LETTER K;So;0;L;<compat> 0028 004B 0029;;;;N;;;;;
+1F11B;PARENTHESIZED LATIN CAPITAL LETTER L;So;0;L;<compat> 0028 004C 0029;;;;N;;;;;
+1F11C;PARENTHESIZED LATIN CAPITAL LETTER M;So;0;L;<compat> 0028 004D 0029;;;;N;;;;;
+1F11D;PARENTHESIZED LATIN CAPITAL LETTER N;So;0;L;<compat> 0028 004E 0029;;;;N;;;;;
+1F11E;PARENTHESIZED LATIN CAPITAL LETTER O;So;0;L;<compat> 0028 004F 0029;;;;N;;;;;
+1F11F;PARENTHESIZED LATIN CAPITAL LETTER P;So;0;L;<compat> 0028 0050 0029;;;;N;;;;;
+1F120;PARENTHESIZED LATIN CAPITAL LETTER Q;So;0;L;<compat> 0028 0051 0029;;;;N;;;;;
+1F121;PARENTHESIZED LATIN CAPITAL LETTER R;So;0;L;<compat> 0028 0052 0029;;;;N;;;;;
+1F122;PARENTHESIZED LATIN CAPITAL LETTER S;So;0;L;<compat> 0028 0053 0029;;;;N;;;;;
+1F123;PARENTHESIZED LATIN CAPITAL LETTER T;So;0;L;<compat> 0028 0054 0029;;;;N;;;;;
+1F124;PARENTHESIZED LATIN CAPITAL LETTER U;So;0;L;<compat> 0028 0055 0029;;;;N;;;;;
+1F125;PARENTHESIZED LATIN CAPITAL LETTER V;So;0;L;<compat> 0028 0056 0029;;;;N;;;;;
+1F126;PARENTHESIZED LATIN CAPITAL LETTER W;So;0;L;<compat> 0028 0057 0029;;;;N;;;;;
+1F127;PARENTHESIZED LATIN CAPITAL LETTER X;So;0;L;<compat> 0028 0058 0029;;;;N;;;;;
+1F128;PARENTHESIZED LATIN CAPITAL LETTER Y;So;0;L;<compat> 0028 0059 0029;;;;N;;;;;
+1F129;PARENTHESIZED LATIN CAPITAL LETTER Z;So;0;L;<compat> 0028 005A 0029;;;;N;;;;;
+1F12A;TORTOISE SHELL BRACKETED LATIN CAPITAL LETTER S;So;0;L;<compat> 3014 0053 3015;;;;N;;;;;
+1F12B;CIRCLED ITALIC LATIN CAPITAL LETTER C;So;0;L;<circle> 0043;;;;N;;;;;
+1F12C;CIRCLED ITALIC LATIN CAPITAL LETTER R;So;0;L;<circle> 0052;;;;N;;;;;
+1F12D;CIRCLED CD;So;0;L;<circle> 0043 0044;;;;N;;;;;
+1F12E;CIRCLED WZ;So;0;L;<circle> 0057 005A;;;;N;;;;;
+1F130;SQUARED LATIN CAPITAL LETTER A;So;0;L;<square> 0041;;;;N;;;;;
+1F131;SQUARED LATIN CAPITAL LETTER B;So;0;L;<square> 0042;;;;N;;;;;
+1F132;SQUARED LATIN CAPITAL LETTER C;So;0;L;<square> 0043;;;;N;;;;;
+1F133;SQUARED LATIN CAPITAL LETTER D;So;0;L;<square> 0044;;;;N;;;;;
+1F134;SQUARED LATIN CAPITAL LETTER E;So;0;L;<square> 0045;;;;N;;;;;
+1F135;SQUARED LATIN CAPITAL LETTER F;So;0;L;<square> 0046;;;;N;;;;;
+1F136;SQUARED LATIN CAPITAL LETTER G;So;0;L;<square> 0047;;;;N;;;;;
+1F137;SQUARED LATIN CAPITAL LETTER H;So;0;L;<square> 0048;;;;N;;;;;
+1F138;SQUARED LATIN CAPITAL LETTER I;So;0;L;<square> 0049;;;;N;;;;;
+1F139;SQUARED LATIN CAPITAL LETTER J;So;0;L;<square> 004A;;;;N;;;;;
+1F13A;SQUARED LATIN CAPITAL LETTER K;So;0;L;<square> 004B;;;;N;;;;;
+1F13B;SQUARED LATIN CAPITAL LETTER L;So;0;L;<square> 004C;;;;N;;;;;
+1F13C;SQUARED LATIN CAPITAL LETTER M;So;0;L;<square> 004D;;;;N;;;;;
+1F13D;SQUARED LATIN CAPITAL LETTER N;So;0;L;<square> 004E;;;;N;;;;;
+1F13E;SQUARED LATIN CAPITAL LETTER O;So;0;L;<square> 004F;;;;N;;;;;
+1F13F;SQUARED LATIN CAPITAL LETTER P;So;0;L;<square> 0050;;;;N;;;;;
+1F140;SQUARED LATIN CAPITAL LETTER Q;So;0;L;<square> 0051;;;;N;;;;;
+1F141;SQUARED LATIN CAPITAL LETTER R;So;0;L;<square> 0052;;;;N;;;;;
+1F142;SQUARED LATIN CAPITAL LETTER S;So;0;L;<square> 0053;;;;N;;;;;
+1F143;SQUARED LATIN CAPITAL LETTER T;So;0;L;<square> 0054;;;;N;;;;;
+1F144;SQUARED LATIN CAPITAL LETTER U;So;0;L;<square> 0055;;;;N;;;;;
+1F145;SQUARED LATIN CAPITAL LETTER V;So;0;L;<square> 0056;;;;N;;;;;
+1F146;SQUARED LATIN CAPITAL LETTER W;So;0;L;<square> 0057;;;;N;;;;;
+1F147;SQUARED LATIN CAPITAL LETTER X;So;0;L;<square> 0058;;;;N;;;;;
+1F148;SQUARED LATIN CAPITAL LETTER Y;So;0;L;<square> 0059;;;;N;;;;;
+1F149;SQUARED LATIN CAPITAL LETTER Z;So;0;L;<square> 005A;;;;N;;;;;
+1F14A;SQUARED HV;So;0;L;<square> 0048 0056;;;;N;;;;;
+1F14B;SQUARED MV;So;0;L;<square> 004D 0056;;;;N;;;;;
+1F14C;SQUARED SD;So;0;L;<square> 0053 0044;;;;N;;;;;
+1F14D;SQUARED SS;So;0;L;<square> 0053 0053;;;;N;;;;;
+1F14E;SQUARED PPV;So;0;L;<square> 0050 0050 0056;;;;N;;;;;
+1F14F;SQUARED WC;So;0;L;<square> 0057 0043;;;;N;;;;;
+1F150;NEGATIVE CIRCLED LATIN CAPITAL LETTER A;So;0;L;;;;;N;;;;;
+1F151;NEGATIVE CIRCLED LATIN CAPITAL LETTER B;So;0;L;;;;;N;;;;;
+1F152;NEGATIVE CIRCLED LATIN CAPITAL LETTER C;So;0;L;;;;;N;;;;;
+1F153;NEGATIVE CIRCLED LATIN CAPITAL LETTER D;So;0;L;;;;;N;;;;;
+1F154;NEGATIVE CIRCLED LATIN CAPITAL LETTER E;So;0;L;;;;;N;;;;;
+1F155;NEGATIVE CIRCLED LATIN CAPITAL LETTER F;So;0;L;;;;;N;;;;;
+1F156;NEGATIVE CIRCLED LATIN CAPITAL LETTER G;So;0;L;;;;;N;;;;;
+1F157;NEGATIVE CIRCLED LATIN CAPITAL LETTER H;So;0;L;;;;;N;;;;;
+1F158;NEGATIVE CIRCLED LATIN CAPITAL LETTER I;So;0;L;;;;;N;;;;;
+1F159;NEGATIVE CIRCLED LATIN CAPITAL LETTER J;So;0;L;;;;;N;;;;;
+1F15A;NEGATIVE CIRCLED LATIN CAPITAL LETTER K;So;0;L;;;;;N;;;;;
+1F15B;NEGATIVE CIRCLED LATIN CAPITAL LETTER L;So;0;L;;;;;N;;;;;
+1F15C;NEGATIVE CIRCLED LATIN CAPITAL LETTER M;So;0;L;;;;;N;;;;;
+1F15D;NEGATIVE CIRCLED LATIN CAPITAL LETTER N;So;0;L;;;;;N;;;;;
+1F15E;NEGATIVE CIRCLED LATIN CAPITAL LETTER O;So;0;L;;;;;N;;;;;
+1F15F;NEGATIVE CIRCLED LATIN CAPITAL LETTER P;So;0;L;;;;;N;;;;;
+1F160;NEGATIVE CIRCLED LATIN CAPITAL LETTER Q;So;0;L;;;;;N;;;;;
+1F161;NEGATIVE CIRCLED LATIN CAPITAL LETTER R;So;0;L;;;;;N;;;;;
+1F162;NEGATIVE CIRCLED LATIN CAPITAL LETTER S;So;0;L;;;;;N;;;;;
+1F163;NEGATIVE CIRCLED LATIN CAPITAL LETTER T;So;0;L;;;;;N;;;;;
+1F164;NEGATIVE CIRCLED LATIN CAPITAL LETTER U;So;0;L;;;;;N;;;;;
+1F165;NEGATIVE CIRCLED LATIN CAPITAL LETTER V;So;0;L;;;;;N;;;;;
+1F166;NEGATIVE CIRCLED LATIN CAPITAL LETTER W;So;0;L;;;;;N;;;;;
+1F167;NEGATIVE CIRCLED LATIN CAPITAL LETTER X;So;0;L;;;;;N;;;;;
+1F168;NEGATIVE CIRCLED LATIN CAPITAL LETTER Y;So;0;L;;;;;N;;;;;
+1F169;NEGATIVE CIRCLED LATIN CAPITAL LETTER Z;So;0;L;;;;;N;;;;;
+1F16A;RAISED MC SIGN;So;0;ON;<super> 004D 0043;;;;N;;;;;
+1F16B;RAISED MD SIGN;So;0;ON;<super> 004D 0044;;;;N;;;;;
+1F170;NEGATIVE SQUARED LATIN CAPITAL LETTER A;So;0;L;;;;;N;;;;;
+1F171;NEGATIVE SQUARED LATIN CAPITAL LETTER B;So;0;L;;;;;N;;;;;
+1F172;NEGATIVE SQUARED LATIN CAPITAL LETTER C;So;0;L;;;;;N;;;;;
+1F173;NEGATIVE SQUARED LATIN CAPITAL LETTER D;So;0;L;;;;;N;;;;;
+1F174;NEGATIVE SQUARED LATIN CAPITAL LETTER E;So;0;L;;;;;N;;;;;
+1F175;NEGATIVE SQUARED LATIN CAPITAL LETTER F;So;0;L;;;;;N;;;;;
+1F176;NEGATIVE SQUARED LATIN CAPITAL LETTER G;So;0;L;;;;;N;;;;;
+1F177;NEGATIVE SQUARED LATIN CAPITAL LETTER H;So;0;L;;;;;N;;;;;
+1F178;NEGATIVE SQUARED LATIN CAPITAL LETTER I;So;0;L;;;;;N;;;;;
+1F179;NEGATIVE SQUARED LATIN CAPITAL LETTER J;So;0;L;;;;;N;;;;;
+1F17A;NEGATIVE SQUARED LATIN CAPITAL LETTER K;So;0;L;;;;;N;;;;;
+1F17B;NEGATIVE SQUARED LATIN CAPITAL LETTER L;So;0;L;;;;;N;;;;;
+1F17C;NEGATIVE SQUARED LATIN CAPITAL LETTER M;So;0;L;;;;;N;;;;;
+1F17D;NEGATIVE SQUARED LATIN CAPITAL LETTER N;So;0;L;;;;;N;;;;;
+1F17E;NEGATIVE SQUARED LATIN CAPITAL LETTER O;So;0;L;;;;;N;;;;;
+1F17F;NEGATIVE SQUARED LATIN CAPITAL LETTER P;So;0;L;;;;;N;;;;;
+1F180;NEGATIVE SQUARED LATIN CAPITAL LETTER Q;So;0;L;;;;;N;;;;;
+1F181;NEGATIVE SQUARED LATIN CAPITAL LETTER R;So;0;L;;;;;N;;;;;
+1F182;NEGATIVE SQUARED LATIN CAPITAL LETTER S;So;0;L;;;;;N;;;;;
+1F183;NEGATIVE SQUARED LATIN CAPITAL LETTER T;So;0;L;;;;;N;;;;;
+1F184;NEGATIVE SQUARED LATIN CAPITAL LETTER U;So;0;L;;;;;N;;;;;
+1F185;NEGATIVE SQUARED LATIN CAPITAL LETTER V;So;0;L;;;;;N;;;;;
+1F186;NEGATIVE SQUARED LATIN CAPITAL LETTER W;So;0;L;;;;;N;;;;;
+1F187;NEGATIVE SQUARED LATIN CAPITAL LETTER X;So;0;L;;;;;N;;;;;
+1F188;NEGATIVE SQUARED LATIN CAPITAL LETTER Y;So;0;L;;;;;N;;;;;
+1F189;NEGATIVE SQUARED LATIN CAPITAL LETTER Z;So;0;L;;;;;N;;;;;
+1F18A;CROSSED NEGATIVE SQUARED LATIN CAPITAL LETTER P;So;0;L;;;;;N;;;;;
+1F18B;NEGATIVE SQUARED IC;So;0;L;;;;;N;;;;;
+1F18C;NEGATIVE SQUARED PA;So;0;L;;;;;N;;;;;
+1F18D;NEGATIVE SQUARED SA;So;0;L;;;;;N;;;;;
+1F18E;NEGATIVE SQUARED AB;So;0;L;;;;;N;;;;;
+1F18F;NEGATIVE SQUARED WC;So;0;L;;;;;N;;;;;
+1F190;SQUARE DJ;So;0;L;<square> 0044 004A;;;;N;;;;;
+1F191;SQUARED CL;So;0;L;;;;;N;;;;;
+1F192;SQUARED COOL;So;0;L;;;;;N;;;;;
+1F193;SQUARED FREE;So;0;L;;;;;N;;;;;
+1F194;SQUARED ID;So;0;L;;;;;N;;;;;
+1F195;SQUARED NEW;So;0;L;;;;;N;;;;;
+1F196;SQUARED NG;So;0;L;;;;;N;;;;;
+1F197;SQUARED OK;So;0;L;;;;;N;;;;;
+1F198;SQUARED SOS;So;0;L;;;;;N;;;;;
+1F199;SQUARED UP WITH EXCLAMATION MARK;So;0;L;;;;;N;;;;;
+1F19A;SQUARED VS;So;0;L;;;;;N;;;;;
+1F19B;SQUARED THREE D;So;0;L;;;;;N;;;;;
+1F19C;SQUARED SECOND SCREEN;So;0;L;;;;;N;;;;;
+1F19D;SQUARED TWO K;So;0;L;;;;;N;;;;;
+1F19E;SQUARED FOUR K;So;0;L;;;;;N;;;;;
+1F19F;SQUARED EIGHT K;So;0;L;;;;;N;;;;;
+1F1A0;SQUARED FIVE POINT ONE;So;0;L;;;;;N;;;;;
+1F1A1;SQUARED SEVEN POINT ONE;So;0;L;;;;;N;;;;;
+1F1A2;SQUARED TWENTY-TWO POINT TWO;So;0;L;;;;;N;;;;;
+1F1A3;SQUARED SIXTY P;So;0;L;;;;;N;;;;;
+1F1A4;SQUARED ONE HUNDRED TWENTY P;So;0;L;;;;;N;;;;;
+1F1A5;SQUARED LATIN SMALL LETTER D;So;0;L;;;;;N;;;;;
+1F1A6;SQUARED HC;So;0;L;;;;;N;;;;;
+1F1A7;SQUARED HDR;So;0;L;;;;;N;;;;;
+1F1A8;SQUARED HI-RES;So;0;L;;;;;N;;;;;
+1F1A9;SQUARED LOSSLESS;So;0;L;;;;;N;;;;;
+1F1AA;SQUARED SHV;So;0;L;;;;;N;;;;;
+1F1AB;SQUARED UHD;So;0;L;;;;;N;;;;;
+1F1AC;SQUARED VOD;So;0;L;;;;;N;;;;;
+1F1E6;REGIONAL INDICATOR SYMBOL LETTER A;So;0;L;;;;;N;;;;;
+1F1E7;REGIONAL INDICATOR SYMBOL LETTER B;So;0;L;;;;;N;;;;;
+1F1E8;REGIONAL INDICATOR SYMBOL LETTER C;So;0;L;;;;;N;;;;;
+1F1E9;REGIONAL INDICATOR SYMBOL LETTER D;So;0;L;;;;;N;;;;;
+1F1EA;REGIONAL INDICATOR SYMBOL LETTER E;So;0;L;;;;;N;;;;;
+1F1EB;REGIONAL INDICATOR SYMBOL LETTER F;So;0;L;;;;;N;;;;;
+1F1EC;REGIONAL INDICATOR SYMBOL LETTER G;So;0;L;;;;;N;;;;;
+1F1ED;REGIONAL INDICATOR SYMBOL LETTER H;So;0;L;;;;;N;;;;;
+1F1EE;REGIONAL INDICATOR SYMBOL LETTER I;So;0;L;;;;;N;;;;;
+1F1EF;REGIONAL INDICATOR SYMBOL LETTER J;So;0;L;;;;;N;;;;;
+1F1F0;REGIONAL INDICATOR SYMBOL LETTER K;So;0;L;;;;;N;;;;;
+1F1F1;REGIONAL INDICATOR SYMBOL LETTER L;So;0;L;;;;;N;;;;;
+1F1F2;REGIONAL INDICATOR SYMBOL LETTER M;So;0;L;;;;;N;;;;;
+1F1F3;REGIONAL INDICATOR SYMBOL LETTER N;So;0;L;;;;;N;;;;;
+1F1F4;REGIONAL INDICATOR SYMBOL LETTER O;So;0;L;;;;;N;;;;;
+1F1F5;REGIONAL INDICATOR SYMBOL LETTER P;So;0;L;;;;;N;;;;;
+1F1F6;REGIONAL INDICATOR SYMBOL LETTER Q;So;0;L;;;;;N;;;;;
+1F1F7;REGIONAL INDICATOR SYMBOL LETTER R;So;0;L;;;;;N;;;;;
+1F1F8;REGIONAL INDICATOR SYMBOL LETTER S;So;0;L;;;;;N;;;;;
+1F1F9;REGIONAL INDICATOR SYMBOL LETTER T;So;0;L;;;;;N;;;;;
+1F1FA;REGIONAL INDICATOR SYMBOL LETTER U;So;0;L;;;;;N;;;;;
+1F1FB;REGIONAL INDICATOR SYMBOL LETTER V;So;0;L;;;;;N;;;;;
+1F1FC;REGIONAL INDICATOR SYMBOL LETTER W;So;0;L;;;;;N;;;;;
+1F1FD;REGIONAL INDICATOR SYMBOL LETTER X;So;0;L;;;;;N;;;;;
+1F1FE;REGIONAL INDICATOR SYMBOL LETTER Y;So;0;L;;;;;N;;;;;
+1F1FF;REGIONAL INDICATOR SYMBOL LETTER Z;So;0;L;;;;;N;;;;;
+1F200;SQUARE HIRAGANA HOKA;So;0;L;<square> 307B 304B;;;;N;;;;;
+1F201;SQUARED KATAKANA KOKO;So;0;L;<square> 30B3 30B3;;;;N;;;;;
+1F202;SQUARED KATAKANA SA;So;0;L;<square> 30B5;;;;N;;;;;
+1F210;SQUARED CJK UNIFIED IDEOGRAPH-624B;So;0;L;<square> 624B;;;;N;;;;;
+1F211;SQUARED CJK UNIFIED IDEOGRAPH-5B57;So;0;L;<square> 5B57;;;;N;;;;;
+1F212;SQUARED CJK UNIFIED IDEOGRAPH-53CC;So;0;L;<square> 53CC;;;;N;;;;;
+1F213;SQUARED KATAKANA DE;So;0;L;<square> 30C7;;;;N;;;;;
+1F214;SQUARED CJK UNIFIED IDEOGRAPH-4E8C;So;0;L;<square> 4E8C;;;;N;;;;;
+1F215;SQUARED CJK UNIFIED IDEOGRAPH-591A;So;0;L;<square> 591A;;;;N;;;;;
+1F216;SQUARED CJK UNIFIED IDEOGRAPH-89E3;So;0;L;<square> 89E3;;;;N;;;;;
+1F217;SQUARED CJK UNIFIED IDEOGRAPH-5929;So;0;L;<square> 5929;;;;N;;;;;
+1F218;SQUARED CJK UNIFIED IDEOGRAPH-4EA4;So;0;L;<square> 4EA4;;;;N;;;;;
+1F219;SQUARED CJK UNIFIED IDEOGRAPH-6620;So;0;L;<square> 6620;;;;N;;;;;
+1F21A;SQUARED CJK UNIFIED IDEOGRAPH-7121;So;0;L;<square> 7121;;;;N;;;;;
+1F21B;SQUARED CJK UNIFIED IDEOGRAPH-6599;So;0;L;<square> 6599;;;;N;;;;;
+1F21C;SQUARED CJK UNIFIED IDEOGRAPH-524D;So;0;L;<square> 524D;;;;N;;;;;
+1F21D;SQUARED CJK UNIFIED IDEOGRAPH-5F8C;So;0;L;<square> 5F8C;;;;N;;;;;
+1F21E;SQUARED CJK UNIFIED IDEOGRAPH-518D;So;0;L;<square> 518D;;;;N;;;;;
+1F21F;SQUARED CJK UNIFIED IDEOGRAPH-65B0;So;0;L;<square> 65B0;;;;N;;;;;
+1F220;SQUARED CJK UNIFIED IDEOGRAPH-521D;So;0;L;<square> 521D;;;;N;;;;;
+1F221;SQUARED CJK UNIFIED IDEOGRAPH-7D42;So;0;L;<square> 7D42;;;;N;;;;;
+1F222;SQUARED CJK UNIFIED IDEOGRAPH-751F;So;0;L;<square> 751F;;;;N;;;;;
+1F223;SQUARED CJK UNIFIED IDEOGRAPH-8CA9;So;0;L;<square> 8CA9;;;;N;;;;;
+1F224;SQUARED CJK UNIFIED IDEOGRAPH-58F0;So;0;L;<square> 58F0;;;;N;;;;;
+1F225;SQUARED CJK UNIFIED IDEOGRAPH-5439;So;0;L;<square> 5439;;;;N;;;;;
+1F226;SQUARED CJK UNIFIED IDEOGRAPH-6F14;So;0;L;<square> 6F14;;;;N;;;;;
+1F227;SQUARED CJK UNIFIED IDEOGRAPH-6295;So;0;L;<square> 6295;;;;N;;;;;
+1F228;SQUARED CJK UNIFIED IDEOGRAPH-6355;So;0;L;<square> 6355;;;;N;;;;;
+1F229;SQUARED CJK UNIFIED IDEOGRAPH-4E00;So;0;L;<square> 4E00;;;;N;;;;;
+1F22A;SQUARED CJK UNIFIED IDEOGRAPH-4E09;So;0;L;<square> 4E09;;;;N;;;;;
+1F22B;SQUARED CJK UNIFIED IDEOGRAPH-904A;So;0;L;<square> 904A;;;;N;;;;;
+1F22C;SQUARED CJK UNIFIED IDEOGRAPH-5DE6;So;0;L;<square> 5DE6;;;;N;;;;;
+1F22D;SQUARED CJK UNIFIED IDEOGRAPH-4E2D;So;0;L;<square> 4E2D;;;;N;;;;;
+1F22E;SQUARED CJK UNIFIED IDEOGRAPH-53F3;So;0;L;<square> 53F3;;;;N;;;;;
+1F22F;SQUARED CJK UNIFIED IDEOGRAPH-6307;So;0;L;<square> 6307;;;;N;;;;;
+1F230;SQUARED CJK UNIFIED IDEOGRAPH-8D70;So;0;L;<square> 8D70;;;;N;;;;;
+1F231;SQUARED CJK UNIFIED IDEOGRAPH-6253;So;0;L;<square> 6253;;;;N;;;;;
+1F232;SQUARED CJK UNIFIED IDEOGRAPH-7981;So;0;L;<square> 7981;;;;N;;;;;
+1F233;SQUARED CJK UNIFIED IDEOGRAPH-7A7A;So;0;L;<square> 7A7A;;;;N;;;;;
+1F234;SQUARED CJK UNIFIED IDEOGRAPH-5408;So;0;L;<square> 5408;;;;N;;;;;
+1F235;SQUARED CJK UNIFIED IDEOGRAPH-6E80;So;0;L;<square> 6E80;;;;N;;;;;
+1F236;SQUARED CJK UNIFIED IDEOGRAPH-6709;So;0;L;<square> 6709;;;;N;;;;;
+1F237;SQUARED CJK UNIFIED IDEOGRAPH-6708;So;0;L;<square> 6708;;;;N;;;;;
+1F238;SQUARED CJK UNIFIED IDEOGRAPH-7533;So;0;L;<square> 7533;;;;N;;;;;
+1F239;SQUARED CJK UNIFIED IDEOGRAPH-5272;So;0;L;<square> 5272;;;;N;;;;;
+1F23A;SQUARED CJK UNIFIED IDEOGRAPH-55B6;So;0;L;<square> 55B6;;;;N;;;;;
+1F23B;SQUARED CJK UNIFIED IDEOGRAPH-914D;So;0;L;<square> 914D;;;;N;;;;;
+1F240;TORTOISE SHELL BRACKETED CJK UNIFIED IDEOGRAPH-672C;So;0;L;<compat> 3014 672C 3015;;;;N;;;;;
+1F241;TORTOISE SHELL BRACKETED CJK UNIFIED IDEOGRAPH-4E09;So;0;L;<compat> 3014 4E09 3015;;;;N;;;;;
+1F242;TORTOISE SHELL BRACKETED CJK UNIFIED IDEOGRAPH-4E8C;So;0;L;<compat> 3014 4E8C 3015;;;;N;;;;;
+1F243;TORTOISE SHELL BRACKETED CJK UNIFIED IDEOGRAPH-5B89;So;0;L;<compat> 3014 5B89 3015;;;;N;;;;;
+1F244;TORTOISE SHELL BRACKETED CJK UNIFIED IDEOGRAPH-70B9;So;0;L;<compat> 3014 70B9 3015;;;;N;;;;;
+1F245;TORTOISE SHELL BRACKETED CJK UNIFIED IDEOGRAPH-6253;So;0;L;<compat> 3014 6253 3015;;;;N;;;;;
+1F246;TORTOISE SHELL BRACKETED CJK UNIFIED IDEOGRAPH-76D7;So;0;L;<compat> 3014 76D7 3015;;;;N;;;;;
+1F247;TORTOISE SHELL BRACKETED CJK UNIFIED IDEOGRAPH-52DD;So;0;L;<compat> 3014 52DD 3015;;;;N;;;;;
+1F248;TORTOISE SHELL BRACKETED CJK UNIFIED IDEOGRAPH-6557;So;0;L;<compat> 3014 6557 3015;;;;N;;;;;
+1F250;CIRCLED IDEOGRAPH ADVANTAGE;So;0;L;<circle> 5F97;;;;N;;;;;
+1F251;CIRCLED IDEOGRAPH ACCEPT;So;0;L;<circle> 53EF;;;;N;;;;;
+1F260;ROUNDED SYMBOL FOR FU;So;0;ON;;;;;N;;;;;
+1F261;ROUNDED SYMBOL FOR LU;So;0;ON;;;;;N;;;;;
+1F262;ROUNDED SYMBOL FOR SHOU;So;0;ON;;;;;N;;;;;
+1F263;ROUNDED SYMBOL FOR XI;So;0;ON;;;;;N;;;;;
+1F264;ROUNDED SYMBOL FOR SHUANGXI;So;0;ON;;;;;N;;;;;
+1F265;ROUNDED SYMBOL FOR CAI;So;0;ON;;;;;N;;;;;
+1F300;CYCLONE;So;0;ON;;;;;N;;;;;
+1F301;FOGGY;So;0;ON;;;;;N;;;;;
+1F302;CLOSED UMBRELLA;So;0;ON;;;;;N;;;;;
+1F303;NIGHT WITH STARS;So;0;ON;;;;;N;;;;;
+1F304;SUNRISE OVER MOUNTAINS;So;0;ON;;;;;N;;;;;
+1F305;SUNRISE;So;0;ON;;;;;N;;;;;
+1F306;CITYSCAPE AT DUSK;So;0;ON;;;;;N;;;;;
+1F307;SUNSET OVER BUILDINGS;So;0;ON;;;;;N;;;;;
+1F308;RAINBOW;So;0;ON;;;;;N;;;;;
+1F309;BRIDGE AT NIGHT;So;0;ON;;;;;N;;;;;
+1F30A;WATER WAVE;So;0;ON;;;;;N;;;;;
+1F30B;VOLCANO;So;0;ON;;;;;N;;;;;
+1F30C;MILKY WAY;So;0;ON;;;;;N;;;;;
+1F30D;EARTH GLOBE EUROPE-AFRICA;So;0;ON;;;;;N;;;;;
+1F30E;EARTH GLOBE AMERICAS;So;0;ON;;;;;N;;;;;
+1F30F;EARTH GLOBE ASIA-AUSTRALIA;So;0;ON;;;;;N;;;;;
+1F310;GLOBE WITH MERIDIANS;So;0;ON;;;;;N;;;;;
+1F311;NEW MOON SYMBOL;So;0;ON;;;;;N;;;;;
+1F312;WAXING CRESCENT MOON SYMBOL;So;0;ON;;;;;N;;;;;
+1F313;FIRST QUARTER MOON SYMBOL;So;0;ON;;;;;N;;;;;
+1F314;WAXING GIBBOUS MOON SYMBOL;So;0;ON;;;;;N;;;;;
+1F315;FULL MOON SYMBOL;So;0;ON;;;;;N;;;;;
+1F316;WANING GIBBOUS MOON SYMBOL;So;0;ON;;;;;N;;;;;
+1F317;LAST QUARTER MOON SYMBOL;So;0;ON;;;;;N;;;;;
+1F318;WANING CRESCENT MOON SYMBOL;So;0;ON;;;;;N;;;;;
+1F319;CRESCENT MOON;So;0;ON;;;;;N;;;;;
+1F31A;NEW MOON WITH FACE;So;0;ON;;;;;N;;;;;
+1F31B;FIRST QUARTER MOON WITH FACE;So;0;ON;;;;;N;;;;;
+1F31C;LAST QUARTER MOON WITH FACE;So;0;ON;;;;;N;;;;;
+1F31D;FULL MOON WITH FACE;So;0;ON;;;;;N;;;;;
+1F31E;SUN WITH FACE;So;0;ON;;;;;N;;;;;
+1F31F;GLOWING STAR;So;0;ON;;;;;N;;;;;
+1F320;SHOOTING STAR;So;0;ON;;;;;N;;;;;
+1F321;THERMOMETER;So;0;ON;;;;;N;;;;;
+1F322;BLACK DROPLET;So;0;ON;;;;;N;;;;;
+1F323;WHITE SUN;So;0;ON;;;;;N;;;;;
+1F324;WHITE SUN WITH SMALL CLOUD;So;0;ON;;;;;N;;;;;
+1F325;WHITE SUN BEHIND CLOUD;So;0;ON;;;;;N;;;;;
+1F326;WHITE SUN BEHIND CLOUD WITH RAIN;So;0;ON;;;;;N;;;;;
+1F327;CLOUD WITH RAIN;So;0;ON;;;;;N;;;;;
+1F328;CLOUD WITH SNOW;So;0;ON;;;;;N;;;;;
+1F329;CLOUD WITH LIGHTNING;So;0;ON;;;;;N;;;;;
+1F32A;CLOUD WITH TORNADO;So;0;ON;;;;;N;;;;;
+1F32B;FOG;So;0;ON;;;;;N;;;;;
+1F32C;WIND BLOWING FACE;So;0;ON;;;;;N;;;;;
+1F32D;HOT DOG;So;0;ON;;;;;N;;;;;
+1F32E;TACO;So;0;ON;;;;;N;;;;;
+1F32F;BURRITO;So;0;ON;;;;;N;;;;;
+1F330;CHESTNUT;So;0;ON;;;;;N;;;;;
+1F331;SEEDLING;So;0;ON;;;;;N;;;;;
+1F332;EVERGREEN TREE;So;0;ON;;;;;N;;;;;
+1F333;DECIDUOUS TREE;So;0;ON;;;;;N;;;;;
+1F334;PALM TREE;So;0;ON;;;;;N;;;;;
+1F335;CACTUS;So;0;ON;;;;;N;;;;;
+1F336;HOT PEPPER;So;0;ON;;;;;N;;;;;
+1F337;TULIP;So;0;ON;;;;;N;;;;;
+1F338;CHERRY BLOSSOM;So;0;ON;;;;;N;;;;;
+1F339;ROSE;So;0;ON;;;;;N;;;;;
+1F33A;HIBISCUS;So;0;ON;;;;;N;;;;;
+1F33B;SUNFLOWER;So;0;ON;;;;;N;;;;;
+1F33C;BLOSSOM;So;0;ON;;;;;N;;;;;
+1F33D;EAR OF MAIZE;So;0;ON;;;;;N;;;;;
+1F33E;EAR OF RICE;So;0;ON;;;;;N;;;;;
+1F33F;HERB;So;0;ON;;;;;N;;;;;
+1F340;FOUR LEAF CLOVER;So;0;ON;;;;;N;;;;;
+1F341;MAPLE LEAF;So;0;ON;;;;;N;;;;;
+1F342;FALLEN LEAF;So;0;ON;;;;;N;;;;;
+1F343;LEAF FLUTTERING IN WIND;So;0;ON;;;;;N;;;;;
+1F344;MUSHROOM;So;0;ON;;;;;N;;;;;
+1F345;TOMATO;So;0;ON;;;;;N;;;;;
+1F346;AUBERGINE;So;0;ON;;;;;N;;;;;
+1F347;GRAPES;So;0;ON;;;;;N;;;;;
+1F348;MELON;So;0;ON;;;;;N;;;;;
+1F349;WATERMELON;So;0;ON;;;;;N;;;;;
+1F34A;TANGERINE;So;0;ON;;;;;N;;;;;
+1F34B;LEMON;So;0;ON;;;;;N;;;;;
+1F34C;BANANA;So;0;ON;;;;;N;;;;;
+1F34D;PINEAPPLE;So;0;ON;;;;;N;;;;;
+1F34E;RED APPLE;So;0;ON;;;;;N;;;;;
+1F34F;GREEN APPLE;So;0;ON;;;;;N;;;;;
+1F350;PEAR;So;0;ON;;;;;N;;;;;
+1F351;PEACH;So;0;ON;;;;;N;;;;;
+1F352;CHERRIES;So;0;ON;;;;;N;;;;;
+1F353;STRAWBERRY;So;0;ON;;;;;N;;;;;
+1F354;HAMBURGER;So;0;ON;;;;;N;;;;;
+1F355;SLICE OF PIZZA;So;0;ON;;;;;N;;;;;
+1F356;MEAT ON BONE;So;0;ON;;;;;N;;;;;
+1F357;POULTRY LEG;So;0;ON;;;;;N;;;;;
+1F358;RICE CRACKER;So;0;ON;;;;;N;;;;;
+1F359;RICE BALL;So;0;ON;;;;;N;;;;;
+1F35A;COOKED RICE;So;0;ON;;;;;N;;;;;
+1F35B;CURRY AND RICE;So;0;ON;;;;;N;;;;;
+1F35C;STEAMING BOWL;So;0;ON;;;;;N;;;;;
+1F35D;SPAGHETTI;So;0;ON;;;;;N;;;;;
+1F35E;BREAD;So;0;ON;;;;;N;;;;;
+1F35F;FRENCH FRIES;So;0;ON;;;;;N;;;;;
+1F360;ROASTED SWEET POTATO;So;0;ON;;;;;N;;;;;
+1F361;DANGO;So;0;ON;;;;;N;;;;;
+1F362;ODEN;So;0;ON;;;;;N;;;;;
+1F363;SUSHI;So;0;ON;;;;;N;;;;;
+1F364;FRIED SHRIMP;So;0;ON;;;;;N;;;;;
+1F365;FISH CAKE WITH SWIRL DESIGN;So;0;ON;;;;;N;;;;;
+1F366;SOFT ICE CREAM;So;0;ON;;;;;N;;;;;
+1F367;SHAVED ICE;So;0;ON;;;;;N;;;;;
+1F368;ICE CREAM;So;0;ON;;;;;N;;;;;
+1F369;DOUGHNUT;So;0;ON;;;;;N;;;;;
+1F36A;COOKIE;So;0;ON;;;;;N;;;;;
+1F36B;CHOCOLATE BAR;So;0;ON;;;;;N;;;;;
+1F36C;CANDY;So;0;ON;;;;;N;;;;;
+1F36D;LOLLIPOP;So;0;ON;;;;;N;;;;;
+1F36E;CUSTARD;So;0;ON;;;;;N;;;;;
+1F36F;HONEY POT;So;0;ON;;;;;N;;;;;
+1F370;SHORTCAKE;So;0;ON;;;;;N;;;;;
+1F371;BENTO BOX;So;0;ON;;;;;N;;;;;
+1F372;POT OF FOOD;So;0;ON;;;;;N;;;;;
+1F373;COOKING;So;0;ON;;;;;N;;;;;
+1F374;FORK AND KNIFE;So;0;ON;;;;;N;;;;;
+1F375;TEACUP WITHOUT HANDLE;So;0;ON;;;;;N;;;;;
+1F376;SAKE BOTTLE AND CUP;So;0;ON;;;;;N;;;;;
+1F377;WINE GLASS;So;0;ON;;;;;N;;;;;
+1F378;COCKTAIL GLASS;So;0;ON;;;;;N;;;;;
+1F379;TROPICAL DRINK;So;0;ON;;;;;N;;;;;
+1F37A;BEER MUG;So;0;ON;;;;;N;;;;;
+1F37B;CLINKING BEER MUGS;So;0;ON;;;;;N;;;;;
+1F37C;BABY BOTTLE;So;0;ON;;;;;N;;;;;
+1F37D;FORK AND KNIFE WITH PLATE;So;0;ON;;;;;N;;;;;
+1F37E;BOTTLE WITH POPPING CORK;So;0;ON;;;;;N;;;;;
+1F37F;POPCORN;So;0;ON;;;;;N;;;;;
+1F380;RIBBON;So;0;ON;;;;;N;;;;;
+1F381;WRAPPED PRESENT;So;0;ON;;;;;N;;;;;
+1F382;BIRTHDAY CAKE;So;0;ON;;;;;N;;;;;
+1F383;JACK-O-LANTERN;So;0;ON;;;;;N;;;;;
+1F384;CHRISTMAS TREE;So;0;ON;;;;;N;;;;;
+1F385;FATHER CHRISTMAS;So;0;ON;;;;;N;;;;;
+1F386;FIREWORKS;So;0;ON;;;;;N;;;;;
+1F387;FIREWORK SPARKLER;So;0;ON;;;;;N;;;;;
+1F388;BALLOON;So;0;ON;;;;;N;;;;;
+1F389;PARTY POPPER;So;0;ON;;;;;N;;;;;
+1F38A;CONFETTI BALL;So;0;ON;;;;;N;;;;;
+1F38B;TANABATA TREE;So;0;ON;;;;;N;;;;;
+1F38C;CROSSED FLAGS;So;0;ON;;;;;N;;;;;
+1F38D;PINE DECORATION;So;0;ON;;;;;N;;;;;
+1F38E;JAPANESE DOLLS;So;0;ON;;;;;N;;;;;
+1F38F;CARP STREAMER;So;0;ON;;;;;N;;;;;
+1F390;WIND CHIME;So;0;ON;;;;;N;;;;;
+1F391;MOON VIEWING CEREMONY;So;0;ON;;;;;N;;;;;
+1F392;SCHOOL SATCHEL;So;0;ON;;;;;N;;;;;
+1F393;GRADUATION CAP;So;0;ON;;;;;N;;;;;
+1F394;HEART WITH TIP ON THE LEFT;So;0;ON;;;;;N;;;;;
+1F395;BOUQUET OF FLOWERS;So;0;ON;;;;;N;;;;;
+1F396;MILITARY MEDAL;So;0;ON;;;;;N;;;;;
+1F397;REMINDER RIBBON;So;0;ON;;;;;N;;;;;
+1F398;MUSICAL KEYBOARD WITH JACKS;So;0;ON;;;;;N;;;;;
+1F399;STUDIO MICROPHONE;So;0;ON;;;;;N;;;;;
+1F39A;LEVEL SLIDER;So;0;ON;;;;;N;;;;;
+1F39B;CONTROL KNOBS;So;0;ON;;;;;N;;;;;
+1F39C;BEAMED ASCENDING MUSICAL NOTES;So;0;ON;;;;;N;;;;;
+1F39D;BEAMED DESCENDING MUSICAL NOTES;So;0;ON;;;;;N;;;;;
+1F39E;FILM FRAMES;So;0;ON;;;;;N;;;;;
+1F39F;ADMISSION TICKETS;So;0;ON;;;;;N;;;;;
+1F3A0;CAROUSEL HORSE;So;0;ON;;;;;N;;;;;
+1F3A1;FERRIS WHEEL;So;0;ON;;;;;N;;;;;
+1F3A2;ROLLER COASTER;So;0;ON;;;;;N;;;;;
+1F3A3;FISHING POLE AND FISH;So;0;ON;;;;;N;;;;;
+1F3A4;MICROPHONE;So;0;ON;;;;;N;;;;;
+1F3A5;MOVIE CAMERA;So;0;ON;;;;;N;;;;;
+1F3A6;CINEMA;So;0;ON;;;;;N;;;;;
+1F3A7;HEADPHONE;So;0;ON;;;;;N;;;;;
+1F3A8;ARTIST PALETTE;So;0;ON;;;;;N;;;;;
+1F3A9;TOP HAT;So;0;ON;;;;;N;;;;;
+1F3AA;CIRCUS TENT;So;0;ON;;;;;N;;;;;
+1F3AB;TICKET;So;0;ON;;;;;N;;;;;
+1F3AC;CLAPPER BOARD;So;0;ON;;;;;N;;;;;
+1F3AD;PERFORMING ARTS;So;0;ON;;;;;N;;;;;
+1F3AE;VIDEO GAME;So;0;ON;;;;;N;;;;;
+1F3AF;DIRECT HIT;So;0;ON;;;;;N;;;;;
+1F3B0;SLOT MACHINE;So;0;ON;;;;;N;;;;;
+1F3B1;BILLIARDS;So;0;ON;;;;;N;;;;;
+1F3B2;GAME DIE;So;0;ON;;;;;N;;;;;
+1F3B3;BOWLING;So;0;ON;;;;;N;;;;;
+1F3B4;FLOWER PLAYING CARDS;So;0;ON;;;;;N;;;;;
+1F3B5;MUSICAL NOTE;So;0;ON;;;;;N;;;;;
+1F3B6;MULTIPLE MUSICAL NOTES;So;0;ON;;;;;N;;;;;
+1F3B7;SAXOPHONE;So;0;ON;;;;;N;;;;;
+1F3B8;GUITAR;So;0;ON;;;;;N;;;;;
+1F3B9;MUSICAL KEYBOARD;So;0;ON;;;;;N;;;;;
+1F3BA;TRUMPET;So;0;ON;;;;;N;;;;;
+1F3BB;VIOLIN;So;0;ON;;;;;N;;;;;
+1F3BC;MUSICAL SCORE;So;0;ON;;;;;N;;;;;
+1F3BD;RUNNING SHIRT WITH SASH;So;0;ON;;;;;N;;;;;
+1F3BE;TENNIS RACQUET AND BALL;So;0;ON;;;;;N;;;;;
+1F3BF;SKI AND SKI BOOT;So;0;ON;;;;;N;;;;;
+1F3C0;BASKETBALL AND HOOP;So;0;ON;;;;;N;;;;;
+1F3C1;CHEQUERED FLAG;So;0;ON;;;;;N;;;;;
+1F3C2;SNOWBOARDER;So;0;ON;;;;;N;;;;;
+1F3C3;RUNNER;So;0;ON;;;;;N;;;;;
+1F3C4;SURFER;So;0;ON;;;;;N;;;;;
+1F3C5;SPORTS MEDAL;So;0;ON;;;;;N;;;;;
+1F3C6;TROPHY;So;0;ON;;;;;N;;;;;
+1F3C7;HORSE RACING;So;0;ON;;;;;N;;;;;
+1F3C8;AMERICAN FOOTBALL;So;0;ON;;;;;N;;;;;
+1F3C9;RUGBY FOOTBALL;So;0;ON;;;;;N;;;;;
+1F3CA;SWIMMER;So;0;ON;;;;;N;;;;;
+1F3CB;WEIGHT LIFTER;So;0;ON;;;;;N;;;;;
+1F3CC;GOLFER;So;0;ON;;;;;N;;;;;
+1F3CD;RACING MOTORCYCLE;So;0;ON;;;;;N;;;;;
+1F3CE;RACING CAR;So;0;ON;;;;;N;;;;;
+1F3CF;CRICKET BAT AND BALL;So;0;ON;;;;;N;;;;;
+1F3D0;VOLLEYBALL;So;0;ON;;;;;N;;;;;
+1F3D1;FIELD HOCKEY STICK AND BALL;So;0;ON;;;;;N;;;;;
+1F3D2;ICE HOCKEY STICK AND PUCK;So;0;ON;;;;;N;;;;;
+1F3D3;TABLE TENNIS PADDLE AND BALL;So;0;ON;;;;;N;;;;;
+1F3D4;SNOW CAPPED MOUNTAIN;So;0;ON;;;;;N;;;;;
+1F3D5;CAMPING;So;0;ON;;;;;N;;;;;
+1F3D6;BEACH WITH UMBRELLA;So;0;ON;;;;;N;;;;;
+1F3D7;BUILDING CONSTRUCTION;So;0;ON;;;;;N;;;;;
+1F3D8;HOUSE BUILDINGS;So;0;ON;;;;;N;;;;;
+1F3D9;CITYSCAPE;So;0;ON;;;;;N;;;;;
+1F3DA;DERELICT HOUSE BUILDING;So;0;ON;;;;;N;;;;;
+1F3DB;CLASSICAL BUILDING;So;0;ON;;;;;N;;;;;
+1F3DC;DESERT;So;0;ON;;;;;N;;;;;
+1F3DD;DESERT ISLAND;So;0;ON;;;;;N;;;;;
+1F3DE;NATIONAL PARK;So;0;ON;;;;;N;;;;;
+1F3DF;STADIUM;So;0;ON;;;;;N;;;;;
+1F3E0;HOUSE BUILDING;So;0;ON;;;;;N;;;;;
+1F3E1;HOUSE WITH GARDEN;So;0;ON;;;;;N;;;;;
+1F3E2;OFFICE BUILDING;So;0;ON;;;;;N;;;;;
+1F3E3;JAPANESE POST OFFICE;So;0;ON;;;;;N;;;;;
+1F3E4;EUROPEAN POST OFFICE;So;0;ON;;;;;N;;;;;
+1F3E5;HOSPITAL;So;0;ON;;;;;N;;;;;
+1F3E6;BANK;So;0;ON;;;;;N;;;;;
+1F3E7;AUTOMATED TELLER MACHINE;So;0;ON;;;;;N;;;;;
+1F3E8;HOTEL;So;0;ON;;;;;N;;;;;
+1F3E9;LOVE HOTEL;So;0;ON;;;;;N;;;;;
+1F3EA;CONVENIENCE STORE;So;0;ON;;;;;N;;;;;
+1F3EB;SCHOOL;So;0;ON;;;;;N;;;;;
+1F3EC;DEPARTMENT STORE;So;0;ON;;;;;N;;;;;
+1F3ED;FACTORY;So;0;ON;;;;;N;;;;;
+1F3EE;IZAKAYA LANTERN;So;0;ON;;;;;N;;;;;
+1F3EF;JAPANESE CASTLE;So;0;ON;;;;;N;;;;;
+1F3F0;EUROPEAN CASTLE;So;0;ON;;;;;N;;;;;
+1F3F1;WHITE PENNANT;So;0;ON;;;;;N;;;;;
+1F3F2;BLACK PENNANT;So;0;ON;;;;;N;;;;;
+1F3F3;WAVING WHITE FLAG;So;0;ON;;;;;N;;;;;
+1F3F4;WAVING BLACK FLAG;So;0;ON;;;;;N;;;;;
+1F3F5;ROSETTE;So;0;ON;;;;;N;;;;;
+1F3F6;BLACK ROSETTE;So;0;ON;;;;;N;;;;;
+1F3F7;LABEL;So;0;ON;;;;;N;;;;;
+1F3F8;BADMINTON RACQUET AND SHUTTLECOCK;So;0;ON;;;;;N;;;;;
+1F3F9;BOW AND ARROW;So;0;ON;;;;;N;;;;;
+1F3FA;AMPHORA;So;0;ON;;;;;N;;;;;
+1F3FB;EMOJI MODIFIER FITZPATRICK TYPE-1-2;Sk;0;ON;;;;;N;;;;;
+1F3FC;EMOJI MODIFIER FITZPATRICK TYPE-3;Sk;0;ON;;;;;N;;;;;
+1F3FD;EMOJI MODIFIER FITZPATRICK TYPE-4;Sk;0;ON;;;;;N;;;;;
+1F3FE;EMOJI MODIFIER FITZPATRICK TYPE-5;Sk;0;ON;;;;;N;;;;;
+1F3FF;EMOJI MODIFIER FITZPATRICK TYPE-6;Sk;0;ON;;;;;N;;;;;
+1F400;RAT;So;0;ON;;;;;N;;;;;
+1F401;MOUSE;So;0;ON;;;;;N;;;;;
+1F402;OX;So;0;ON;;;;;N;;;;;
+1F403;WATER BUFFALO;So;0;ON;;;;;N;;;;;
+1F404;COW;So;0;ON;;;;;N;;;;;
+1F405;TIGER;So;0;ON;;;;;N;;;;;
+1F406;LEOPARD;So;0;ON;;;;;N;;;;;
+1F407;RABBIT;So;0;ON;;;;;N;;;;;
+1F408;CAT;So;0;ON;;;;;N;;;;;
+1F409;DRAGON;So;0;ON;;;;;N;;;;;
+1F40A;CROCODILE;So;0;ON;;;;;N;;;;;
+1F40B;WHALE;So;0;ON;;;;;N;;;;;
+1F40C;SNAIL;So;0;ON;;;;;N;;;;;
+1F40D;SNAKE;So;0;ON;;;;;N;;;;;
+1F40E;HORSE;So;0;ON;;;;;N;;;;;
+1F40F;RAM;So;0;ON;;;;;N;;;;;
+1F410;GOAT;So;0;ON;;;;;N;;;;;
+1F411;SHEEP;So;0;ON;;;;;N;;;;;
+1F412;MONKEY;So;0;ON;;;;;N;;;;;
+1F413;ROOSTER;So;0;ON;;;;;N;;;;;
+1F414;CHICKEN;So;0;ON;;;;;N;;;;;
+1F415;DOG;So;0;ON;;;;;N;;;;;
+1F416;PIG;So;0;ON;;;;;N;;;;;
+1F417;BOAR;So;0;ON;;;;;N;;;;;
+1F418;ELEPHANT;So;0;ON;;;;;N;;;;;
+1F419;OCTOPUS;So;0;ON;;;;;N;;;;;
+1F41A;SPIRAL SHELL;So;0;ON;;;;;N;;;;;
+1F41B;BUG;So;0;ON;;;;;N;;;;;
+1F41C;ANT;So;0;ON;;;;;N;;;;;
+1F41D;HONEYBEE;So;0;ON;;;;;N;;;;;
+1F41E;LADY BEETLE;So;0;ON;;;;;N;;;;;
+1F41F;FISH;So;0;ON;;;;;N;;;;;
+1F420;TROPICAL FISH;So;0;ON;;;;;N;;;;;
+1F421;BLOWFISH;So;0;ON;;;;;N;;;;;
+1F422;TURTLE;So;0;ON;;;;;N;;;;;
+1F423;HATCHING CHICK;So;0;ON;;;;;N;;;;;
+1F424;BABY CHICK;So;0;ON;;;;;N;;;;;
+1F425;FRONT-FACING BABY CHICK;So;0;ON;;;;;N;;;;;
+1F426;BIRD;So;0;ON;;;;;N;;;;;
+1F427;PENGUIN;So;0;ON;;;;;N;;;;;
+1F428;KOALA;So;0;ON;;;;;N;;;;;
+1F429;POODLE;So;0;ON;;;;;N;;;;;
+1F42A;DROMEDARY CAMEL;So;0;ON;;;;;N;;;;;
+1F42B;BACTRIAN CAMEL;So;0;ON;;;;;N;;;;;
+1F42C;DOLPHIN;So;0;ON;;;;;N;;;;;
+1F42D;MOUSE FACE;So;0;ON;;;;;N;;;;;
+1F42E;COW FACE;So;0;ON;;;;;N;;;;;
+1F42F;TIGER FACE;So;0;ON;;;;;N;;;;;
+1F430;RABBIT FACE;So;0;ON;;;;;N;;;;;
+1F431;CAT FACE;So;0;ON;;;;;N;;;;;
+1F432;DRAGON FACE;So;0;ON;;;;;N;;;;;
+1F433;SPOUTING WHALE;So;0;ON;;;;;N;;;;;
+1F434;HORSE FACE;So;0;ON;;;;;N;;;;;
+1F435;MONKEY FACE;So;0;ON;;;;;N;;;;;
+1F436;DOG FACE;So;0;ON;;;;;N;;;;;
+1F437;PIG FACE;So;0;ON;;;;;N;;;;;
+1F438;FROG FACE;So;0;ON;;;;;N;;;;;
+1F439;HAMSTER FACE;So;0;ON;;;;;N;;;;;
+1F43A;WOLF FACE;So;0;ON;;;;;N;;;;;
+1F43B;BEAR FACE;So;0;ON;;;;;N;;;;;
+1F43C;PANDA FACE;So;0;ON;;;;;N;;;;;
+1F43D;PIG NOSE;So;0;ON;;;;;N;;;;;
+1F43E;PAW PRINTS;So;0;ON;;;;;N;;;;;
+1F43F;CHIPMUNK;So;0;ON;;;;;N;;;;;
+1F440;EYES;So;0;ON;;;;;N;;;;;
+1F441;EYE;So;0;ON;;;;;N;;;;;
+1F442;EAR;So;0;ON;;;;;N;;;;;
+1F443;NOSE;So;0;ON;;;;;N;;;;;
+1F444;MOUTH;So;0;ON;;;;;N;;;;;
+1F445;TONGUE;So;0;ON;;;;;N;;;;;
+1F446;WHITE UP POINTING BACKHAND INDEX;So;0;ON;;;;;N;;;;;
+1F447;WHITE DOWN POINTING BACKHAND INDEX;So;0;ON;;;;;N;;;;;
+1F448;WHITE LEFT POINTING BACKHAND INDEX;So;0;ON;;;;;N;;;;;
+1F449;WHITE RIGHT POINTING BACKHAND INDEX;So;0;ON;;;;;N;;;;;
+1F44A;FISTED HAND SIGN;So;0;ON;;;;;N;;;;;
+1F44B;WAVING HAND SIGN;So;0;ON;;;;;N;;;;;
+1F44C;OK HAND SIGN;So;0;ON;;;;;N;;;;;
+1F44D;THUMBS UP SIGN;So;0;ON;;;;;N;;;;;
+1F44E;THUMBS DOWN SIGN;So;0;ON;;;;;N;;;;;
+1F44F;CLAPPING HANDS SIGN;So;0;ON;;;;;N;;;;;
+1F450;OPEN HANDS SIGN;So;0;ON;;;;;N;;;;;
+1F451;CROWN;So;0;ON;;;;;N;;;;;
+1F452;WOMANS HAT;So;0;ON;;;;;N;;;;;
+1F453;EYEGLASSES;So;0;ON;;;;;N;;;;;
+1F454;NECKTIE;So;0;ON;;;;;N;;;;;
+1F455;T-SHIRT;So;0;ON;;;;;N;;;;;
+1F456;JEANS;So;0;ON;;;;;N;;;;;
+1F457;DRESS;So;0;ON;;;;;N;;;;;
+1F458;KIMONO;So;0;ON;;;;;N;;;;;
+1F459;BIKINI;So;0;ON;;;;;N;;;;;
+1F45A;WOMANS CLOTHES;So;0;ON;;;;;N;;;;;
+1F45B;PURSE;So;0;ON;;;;;N;;;;;
+1F45C;HANDBAG;So;0;ON;;;;;N;;;;;
+1F45D;POUCH;So;0;ON;;;;;N;;;;;
+1F45E;MANS SHOE;So;0;ON;;;;;N;;;;;
+1F45F;ATHLETIC SHOE;So;0;ON;;;;;N;;;;;
+1F460;HIGH-HEELED SHOE;So;0;ON;;;;;N;;;;;
+1F461;WOMANS SANDAL;So;0;ON;;;;;N;;;;;
+1F462;WOMANS BOOTS;So;0;ON;;;;;N;;;;;
+1F463;FOOTPRINTS;So;0;ON;;;;;N;;;;;
+1F464;BUST IN SILHOUETTE;So;0;ON;;;;;N;;;;;
+1F465;BUSTS IN SILHOUETTE;So;0;ON;;;;;N;;;;;
+1F466;BOY;So;0;ON;;;;;N;;;;;
+1F467;GIRL;So;0;ON;;;;;N;;;;;
+1F468;MAN;So;0;ON;;;;;N;;;;;
+1F469;WOMAN;So;0;ON;;;;;N;;;;;
+1F46A;FAMILY;So;0;ON;;;;;N;;;;;
+1F46B;MAN AND WOMAN HOLDING HANDS;So;0;ON;;;;;N;;;;;
+1F46C;TWO MEN HOLDING HANDS;So;0;ON;;;;;N;;;;;
+1F46D;TWO WOMEN HOLDING HANDS;So;0;ON;;;;;N;;;;;
+1F46E;POLICE OFFICER;So;0;ON;;;;;N;;;;;
+1F46F;WOMAN WITH BUNNY EARS;So;0;ON;;;;;N;;;;;
+1F470;BRIDE WITH VEIL;So;0;ON;;;;;N;;;;;
+1F471;PERSON WITH BLOND HAIR;So;0;ON;;;;;N;;;;;
+1F472;MAN WITH GUA PI MAO;So;0;ON;;;;;N;;;;;
+1F473;MAN WITH TURBAN;So;0;ON;;;;;N;;;;;
+1F474;OLDER MAN;So;0;ON;;;;;N;;;;;
+1F475;OLDER WOMAN;So;0;ON;;;;;N;;;;;
+1F476;BABY;So;0;ON;;;;;N;;;;;
+1F477;CONSTRUCTION WORKER;So;0;ON;;;;;N;;;;;
+1F478;PRINCESS;So;0;ON;;;;;N;;;;;
+1F479;JAPANESE OGRE;So;0;ON;;;;;N;;;;;
+1F47A;JAPANESE GOBLIN;So;0;ON;;;;;N;;;;;
+1F47B;GHOST;So;0;ON;;;;;N;;;;;
+1F47C;BABY ANGEL;So;0;ON;;;;;N;;;;;
+1F47D;EXTRATERRESTRIAL ALIEN;So;0;ON;;;;;N;;;;;
+1F47E;ALIEN MONSTER;So;0;ON;;;;;N;;;;;
+1F47F;IMP;So;0;ON;;;;;N;;;;;
+1F480;SKULL;So;0;ON;;;;;N;;;;;
+1F481;INFORMATION DESK PERSON;So;0;ON;;;;;N;;;;;
+1F482;GUARDSMAN;So;0;ON;;;;;N;;;;;
+1F483;DANCER;So;0;ON;;;;;N;;;;;
+1F484;LIPSTICK;So;0;ON;;;;;N;;;;;
+1F485;NAIL POLISH;So;0;ON;;;;;N;;;;;
+1F486;FACE MASSAGE;So;0;ON;;;;;N;;;;;
+1F487;HAIRCUT;So;0;ON;;;;;N;;;;;
+1F488;BARBER POLE;So;0;ON;;;;;N;;;;;
+1F489;SYRINGE;So;0;ON;;;;;N;;;;;
+1F48A;PILL;So;0;ON;;;;;N;;;;;
+1F48B;KISS MARK;So;0;ON;;;;;N;;;;;
+1F48C;LOVE LETTER;So;0;ON;;;;;N;;;;;
+1F48D;RING;So;0;ON;;;;;N;;;;;
+1F48E;GEM STONE;So;0;ON;;;;;N;;;;;
+1F48F;KISS;So;0;ON;;;;;N;;;;;
+1F490;BOUQUET;So;0;ON;;;;;N;;;;;
+1F491;COUPLE WITH HEART;So;0;ON;;;;;N;;;;;
+1F492;WEDDING;So;0;ON;;;;;N;;;;;
+1F493;BEATING HEART;So;0;ON;;;;;N;;;;;
+1F494;BROKEN HEART;So;0;ON;;;;;N;;;;;
+1F495;TWO HEARTS;So;0;ON;;;;;N;;;;;
+1F496;SPARKLING HEART;So;0;ON;;;;;N;;;;;
+1F497;GROWING HEART;So;0;ON;;;;;N;;;;;
+1F498;HEART WITH ARROW;So;0;ON;;;;;N;;;;;
+1F499;BLUE HEART;So;0;ON;;;;;N;;;;;
+1F49A;GREEN HEART;So;0;ON;;;;;N;;;;;
+1F49B;YELLOW HEART;So;0;ON;;;;;N;;;;;
+1F49C;PURPLE HEART;So;0;ON;;;;;N;;;;;
+1F49D;HEART WITH RIBBON;So;0;ON;;;;;N;;;;;
+1F49E;REVOLVING HEARTS;So;0;ON;;;;;N;;;;;
+1F49F;HEART DECORATION;So;0;ON;;;;;N;;;;;
+1F4A0;DIAMOND SHAPE WITH A DOT INSIDE;So;0;ON;;;;;N;;;;;
+1F4A1;ELECTRIC LIGHT BULB;So;0;ON;;;;;N;;;;;
+1F4A2;ANGER SYMBOL;So;0;ON;;;;;N;;;;;
+1F4A3;BOMB;So;0;ON;;;;;N;;;;;
+1F4A4;SLEEPING SYMBOL;So;0;ON;;;;;N;;;;;
+1F4A5;COLLISION SYMBOL;So;0;ON;;;;;N;;;;;
+1F4A6;SPLASHING SWEAT SYMBOL;So;0;ON;;;;;N;;;;;
+1F4A7;DROPLET;So;0;ON;;;;;N;;;;;
+1F4A8;DASH SYMBOL;So;0;ON;;;;;N;;;;;
+1F4A9;PILE OF POO;So;0;ON;;;;;N;;;;;
+1F4AA;FLEXED BICEPS;So;0;ON;;;;;N;;;;;
+1F4AB;DIZZY SYMBOL;So;0;ON;;;;;N;;;;;
+1F4AC;SPEECH BALLOON;So;0;ON;;;;;N;;;;;
+1F4AD;THOUGHT BALLOON;So;0;ON;;;;;N;;;;;
+1F4AE;WHITE FLOWER;So;0;ON;;;;;N;;;;;
+1F4AF;HUNDRED POINTS SYMBOL;So;0;ON;;;;;N;;;;;
+1F4B0;MONEY BAG;So;0;ON;;;;;N;;;;;
+1F4B1;CURRENCY EXCHANGE;So;0;ON;;;;;N;;;;;
+1F4B2;HEAVY DOLLAR SIGN;So;0;ON;;;;;N;;;;;
+1F4B3;CREDIT CARD;So;0;ON;;;;;N;;;;;
+1F4B4;BANKNOTE WITH YEN SIGN;So;0;ON;;;;;N;;;;;
+1F4B5;BANKNOTE WITH DOLLAR SIGN;So;0;ON;;;;;N;;;;;
+1F4B6;BANKNOTE WITH EURO SIGN;So;0;ON;;;;;N;;;;;
+1F4B7;BANKNOTE WITH POUND SIGN;So;0;ON;;;;;N;;;;;
+1F4B8;MONEY WITH WINGS;So;0;ON;;;;;N;;;;;
+1F4B9;CHART WITH UPWARDS TREND AND YEN SIGN;So;0;ON;;;;;N;;;;;
+1F4BA;SEAT;So;0;ON;;;;;N;;;;;
+1F4BB;PERSONAL COMPUTER;So;0;ON;;;;;N;;;;;
+1F4BC;BRIEFCASE;So;0;ON;;;;;N;;;;;
+1F4BD;MINIDISC;So;0;ON;;;;;N;;;;;
+1F4BE;FLOPPY DISK;So;0;ON;;;;;N;;;;;
+1F4BF;OPTICAL DISC;So;0;ON;;;;;N;;;;;
+1F4C0;DVD;So;0;ON;;;;;N;;;;;
+1F4C1;FILE FOLDER;So;0;ON;;;;;N;;;;;
+1F4C2;OPEN FILE FOLDER;So;0;ON;;;;;N;;;;;
+1F4C3;PAGE WITH CURL;So;0;ON;;;;;N;;;;;
+1F4C4;PAGE FACING UP;So;0;ON;;;;;N;;;;;
+1F4C5;CALENDAR;So;0;ON;;;;;N;;;;;
+1F4C6;TEAR-OFF CALENDAR;So;0;ON;;;;;N;;;;;
+1F4C7;CARD INDEX;So;0;ON;;;;;N;;;;;
+1F4C8;CHART WITH UPWARDS TREND;So;0;ON;;;;;N;;;;;
+1F4C9;CHART WITH DOWNWARDS TREND;So;0;ON;;;;;N;;;;;
+1F4CA;BAR CHART;So;0;ON;;;;;N;;;;;
+1F4CB;CLIPBOARD;So;0;ON;;;;;N;;;;;
+1F4CC;PUSHPIN;So;0;ON;;;;;N;;;;;
+1F4CD;ROUND PUSHPIN;So;0;ON;;;;;N;;;;;
+1F4CE;PAPERCLIP;So;0;ON;;;;;N;;;;;
+1F4CF;STRAIGHT RULER;So;0;ON;;;;;N;;;;;
+1F4D0;TRIANGULAR RULER;So;0;ON;;;;;N;;;;;
+1F4D1;BOOKMARK TABS;So;0;ON;;;;;N;;;;;
+1F4D2;LEDGER;So;0;ON;;;;;N;;;;;
+1F4D3;NOTEBOOK;So;0;ON;;;;;N;;;;;
+1F4D4;NOTEBOOK WITH DECORATIVE COVER;So;0;ON;;;;;N;;;;;
+1F4D5;CLOSED BOOK;So;0;ON;;;;;N;;;;;
+1F4D6;OPEN BOOK;So;0;ON;;;;;N;;;;;
+1F4D7;GREEN BOOK;So;0;ON;;;;;N;;;;;
+1F4D8;BLUE BOOK;So;0;ON;;;;;N;;;;;
+1F4D9;ORANGE BOOK;So;0;ON;;;;;N;;;;;
+1F4DA;BOOKS;So;0;ON;;;;;N;;;;;
+1F4DB;NAME BADGE;So;0;ON;;;;;N;;;;;
+1F4DC;SCROLL;So;0;ON;;;;;N;;;;;
+1F4DD;MEMO;So;0;ON;;;;;N;;;;;
+1F4DE;TELEPHONE RECEIVER;So;0;ON;;;;;N;;;;;
+1F4DF;PAGER;So;0;ON;;;;;N;;;;;
+1F4E0;FAX MACHINE;So;0;ON;;;;;N;;;;;
+1F4E1;SATELLITE ANTENNA;So;0;ON;;;;;N;;;;;
+1F4E2;PUBLIC ADDRESS LOUDSPEAKER;So;0;ON;;;;;N;;;;;
+1F4E3;CHEERING MEGAPHONE;So;0;ON;;;;;N;;;;;
+1F4E4;OUTBOX TRAY;So;0;ON;;;;;N;;;;;
+1F4E5;INBOX TRAY;So;0;ON;;;;;N;;;;;
+1F4E6;PACKAGE;So;0;ON;;;;;N;;;;;
+1F4E7;E-MAIL SYMBOL;So;0;ON;;;;;N;;;;;
+1F4E8;INCOMING ENVELOPE;So;0;ON;;;;;N;;;;;
+1F4E9;ENVELOPE WITH DOWNWARDS ARROW ABOVE;So;0;ON;;;;;N;;;;;
+1F4EA;CLOSED MAILBOX WITH LOWERED FLAG;So;0;ON;;;;;N;;;;;
+1F4EB;CLOSED MAILBOX WITH RAISED FLAG;So;0;ON;;;;;N;;;;;
+1F4EC;OPEN MAILBOX WITH RAISED FLAG;So;0;ON;;;;;N;;;;;
+1F4ED;OPEN MAILBOX WITH LOWERED FLAG;So;0;ON;;;;;N;;;;;
+1F4EE;POSTBOX;So;0;ON;;;;;N;;;;;
+1F4EF;POSTAL HORN;So;0;ON;;;;;N;;;;;
+1F4F0;NEWSPAPER;So;0;ON;;;;;N;;;;;
+1F4F1;MOBILE PHONE;So;0;ON;;;;;N;;;;;
+1F4F2;MOBILE PHONE WITH RIGHTWARDS ARROW AT LEFT;So;0;ON;;;;;N;;;;;
+1F4F3;VIBRATION MODE;So;0;ON;;;;;N;;;;;
+1F4F4;MOBILE PHONE OFF;So;0;ON;;;;;N;;;;;
+1F4F5;NO MOBILE PHONES;So;0;ON;;;;;N;;;;;
+1F4F6;ANTENNA WITH BARS;So;0;ON;;;;;N;;;;;
+1F4F7;CAMERA;So;0;ON;;;;;N;;;;;
+1F4F8;CAMERA WITH FLASH;So;0;ON;;;;;N;;;;;
+1F4F9;VIDEO CAMERA;So;0;ON;;;;;N;;;;;
+1F4FA;TELEVISION;So;0;ON;;;;;N;;;;;
+1F4FB;RADIO;So;0;ON;;;;;N;;;;;
+1F4FC;VIDEOCASSETTE;So;0;ON;;;;;N;;;;;
+1F4FD;FILM PROJECTOR;So;0;ON;;;;;N;;;;;
+1F4FE;PORTABLE STEREO;So;0;ON;;;;;N;;;;;
+1F4FF;PRAYER BEADS;So;0;ON;;;;;N;;;;;
+1F500;TWISTED RIGHTWARDS ARROWS;So;0;ON;;;;;N;;;;;
+1F501;CLOCKWISE RIGHTWARDS AND LEFTWARDS OPEN CIRCLE ARROWS;So;0;ON;;;;;N;;;;;
+1F502;CLOCKWISE RIGHTWARDS AND LEFTWARDS OPEN CIRCLE ARROWS WITH CIRCLED ONE OVERLAY;So;0;ON;;;;;N;;;;;
+1F503;CLOCKWISE DOWNWARDS AND UPWARDS OPEN CIRCLE ARROWS;So;0;ON;;;;;N;;;;;
+1F504;ANTICLOCKWISE DOWNWARDS AND UPWARDS OPEN CIRCLE ARROWS;So;0;ON;;;;;N;;;;;
+1F505;LOW BRIGHTNESS SYMBOL;So;0;ON;;;;;N;;;;;
+1F506;HIGH BRIGHTNESS SYMBOL;So;0;ON;;;;;N;;;;;
+1F507;SPEAKER WITH CANCELLATION STROKE;So;0;ON;;;;;N;;;;;
+1F508;SPEAKER;So;0;ON;;;;;N;;;;;
+1F509;SPEAKER WITH ONE SOUND WAVE;So;0;ON;;;;;N;;;;;
+1F50A;SPEAKER WITH THREE SOUND WAVES;So;0;ON;;;;;N;;;;;
+1F50B;BATTERY;So;0;ON;;;;;N;;;;;
+1F50C;ELECTRIC PLUG;So;0;ON;;;;;N;;;;;
+1F50D;LEFT-POINTING MAGNIFYING GLASS;So;0;ON;;;;;N;;;;;
+1F50E;RIGHT-POINTING MAGNIFYING GLASS;So;0;ON;;;;;N;;;;;
+1F50F;LOCK WITH INK PEN;So;0;ON;;;;;N;;;;;
+1F510;CLOSED LOCK WITH KEY;So;0;ON;;;;;N;;;;;
+1F511;KEY;So;0;ON;;;;;N;;;;;
+1F512;LOCK;So;0;ON;;;;;N;;;;;
+1F513;OPEN LOCK;So;0;ON;;;;;N;;;;;
+1F514;BELL;So;0;ON;;;;;N;;;;;
+1F515;BELL WITH CANCELLATION STROKE;So;0;ON;;;;;N;;;;;
+1F516;BOOKMARK;So;0;ON;;;;;N;;;;;
+1F517;LINK SYMBOL;So;0;ON;;;;;N;;;;;
+1F518;RADIO BUTTON;So;0;ON;;;;;N;;;;;
+1F519;BACK WITH LEFTWARDS ARROW ABOVE;So;0;ON;;;;;N;;;;;
+1F51A;END WITH LEFTWARDS ARROW ABOVE;So;0;ON;;;;;N;;;;;
+1F51B;ON WITH EXCLAMATION MARK WITH LEFT RIGHT ARROW ABOVE;So;0;ON;;;;;N;;;;;
+1F51C;SOON WITH RIGHTWARDS ARROW ABOVE;So;0;ON;;;;;N;;;;;
+1F51D;TOP WITH UPWARDS ARROW ABOVE;So;0;ON;;;;;N;;;;;
+1F51E;NO ONE UNDER EIGHTEEN SYMBOL;So;0;ON;;;;;N;;;;;
+1F51F;KEYCAP TEN;So;0;ON;;;;;N;;;;;
+1F520;INPUT SYMBOL FOR LATIN CAPITAL LETTERS;So;0;ON;;;;;N;;;;;
+1F521;INPUT SYMBOL FOR LATIN SMALL LETTERS;So;0;ON;;;;;N;;;;;
+1F522;INPUT SYMBOL FOR NUMBERS;So;0;ON;;;;;N;;;;;
+1F523;INPUT SYMBOL FOR SYMBOLS;So;0;ON;;;;;N;;;;;
+1F524;INPUT SYMBOL FOR LATIN LETTERS;So;0;ON;;;;;N;;;;;
+1F525;FIRE;So;0;ON;;;;;N;;;;;
+1F526;ELECTRIC TORCH;So;0;ON;;;;;N;;;;;
+1F527;WRENCH;So;0;ON;;;;;N;;;;;
+1F528;HAMMER;So;0;ON;;;;;N;;;;;
+1F529;NUT AND BOLT;So;0;ON;;;;;N;;;;;
+1F52A;HOCHO;So;0;ON;;;;;N;;;;;
+1F52B;PISTOL;So;0;ON;;;;;N;;;;;
+1F52C;MICROSCOPE;So;0;ON;;;;;N;;;;;
+1F52D;TELESCOPE;So;0;ON;;;;;N;;;;;
+1F52E;CRYSTAL BALL;So;0;ON;;;;;N;;;;;
+1F52F;SIX POINTED STAR WITH MIDDLE DOT;So;0;ON;;;;;N;;;;;
+1F530;JAPANESE SYMBOL FOR BEGINNER;So;0;ON;;;;;N;;;;;
+1F531;TRIDENT EMBLEM;So;0;ON;;;;;N;;;;;
+1F532;BLACK SQUARE BUTTON;So;0;ON;;;;;N;;;;;
+1F533;WHITE SQUARE BUTTON;So;0;ON;;;;;N;;;;;
+1F534;LARGE RED CIRCLE;So;0;ON;;;;;N;;;;;
+1F535;LARGE BLUE CIRCLE;So;0;ON;;;;;N;;;;;
+1F536;LARGE ORANGE DIAMOND;So;0;ON;;;;;N;;;;;
+1F537;LARGE BLUE DIAMOND;So;0;ON;;;;;N;;;;;
+1F538;SMALL ORANGE DIAMOND;So;0;ON;;;;;N;;;;;
+1F539;SMALL BLUE DIAMOND;So;0;ON;;;;;N;;;;;
+1F53A;UP-POINTING RED TRIANGLE;So;0;ON;;;;;N;;;;;
+1F53B;DOWN-POINTING RED TRIANGLE;So;0;ON;;;;;N;;;;;
+1F53C;UP-POINTING SMALL RED TRIANGLE;So;0;ON;;;;;N;;;;;
+1F53D;DOWN-POINTING SMALL RED TRIANGLE;So;0;ON;;;;;N;;;;;
+1F53E;LOWER RIGHT SHADOWED WHITE CIRCLE;So;0;ON;;;;;N;;;;;
+1F53F;UPPER RIGHT SHADOWED WHITE CIRCLE;So;0;ON;;;;;N;;;;;
+1F540;CIRCLED CROSS POMMEE;So;0;ON;;;;;N;;;;;
+1F541;CROSS POMMEE WITH HALF-CIRCLE BELOW;So;0;ON;;;;;N;;;;;
+1F542;CROSS POMMEE;So;0;ON;;;;;N;;;;;
+1F543;NOTCHED LEFT SEMICIRCLE WITH THREE DOTS;So;0;ON;;;;;N;;;;;
+1F544;NOTCHED RIGHT SEMICIRCLE WITH THREE DOTS;So;0;ON;;;;;N;;;;;
+1F545;SYMBOL FOR MARKS CHAPTER;So;0;ON;;;;;N;;;;;
+1F546;WHITE LATIN CROSS;So;0;ON;;;;;N;;;;;
+1F547;HEAVY LATIN CROSS;So;0;ON;;;;;N;;;;;
+1F548;CELTIC CROSS;So;0;ON;;;;;N;;;;;
+1F549;OM SYMBOL;So;0;ON;;;;;N;;;;;
+1F54A;DOVE OF PEACE;So;0;ON;;;;;N;;;;;
+1F54B;KAABA;So;0;ON;;;;;N;;;;;
+1F54C;MOSQUE;So;0;ON;;;;;N;;;;;
+1F54D;SYNAGOGUE;So;0;ON;;;;;N;;;;;
+1F54E;MENORAH WITH NINE BRANCHES;So;0;ON;;;;;N;;;;;
+1F54F;BOWL OF HYGIEIA;So;0;ON;;;;;N;;;;;
+1F550;CLOCK FACE ONE OCLOCK;So;0;ON;;;;;N;;;;;
+1F551;CLOCK FACE TWO OCLOCK;So;0;ON;;;;;N;;;;;
+1F552;CLOCK FACE THREE OCLOCK;So;0;ON;;;;;N;;;;;
+1F553;CLOCK FACE FOUR OCLOCK;So;0;ON;;;;;N;;;;;
+1F554;CLOCK FACE FIVE OCLOCK;So;0;ON;;;;;N;;;;;
+1F555;CLOCK FACE SIX OCLOCK;So;0;ON;;;;;N;;;;;
+1F556;CLOCK FACE SEVEN OCLOCK;So;0;ON;;;;;N;;;;;
+1F557;CLOCK FACE EIGHT OCLOCK;So;0;ON;;;;;N;;;;;
+1F558;CLOCK FACE NINE OCLOCK;So;0;ON;;;;;N;;;;;
+1F559;CLOCK FACE TEN OCLOCK;So;0;ON;;;;;N;;;;;
+1F55A;CLOCK FACE ELEVEN OCLOCK;So;0;ON;;;;;N;;;;;
+1F55B;CLOCK FACE TWELVE OCLOCK;So;0;ON;;;;;N;;;;;
+1F55C;CLOCK FACE ONE-THIRTY;So;0;ON;;;;;N;;;;;
+1F55D;CLOCK FACE TWO-THIRTY;So;0;ON;;;;;N;;;;;
+1F55E;CLOCK FACE THREE-THIRTY;So;0;ON;;;;;N;;;;;
+1F55F;CLOCK FACE FOUR-THIRTY;So;0;ON;;;;;N;;;;;
+1F560;CLOCK FACE FIVE-THIRTY;So;0;ON;;;;;N;;;;;
+1F561;CLOCK FACE SIX-THIRTY;So;0;ON;;;;;N;;;;;
+1F562;CLOCK FACE SEVEN-THIRTY;So;0;ON;;;;;N;;;;;
+1F563;CLOCK FACE EIGHT-THIRTY;So;0;ON;;;;;N;;;;;
+1F564;CLOCK FACE NINE-THIRTY;So;0;ON;;;;;N;;;;;
+1F565;CLOCK FACE TEN-THIRTY;So;0;ON;;;;;N;;;;;
+1F566;CLOCK FACE ELEVEN-THIRTY;So;0;ON;;;;;N;;;;;
+1F567;CLOCK FACE TWELVE-THIRTY;So;0;ON;;;;;N;;;;;
+1F568;RIGHT SPEAKER;So;0;ON;;;;;N;;;;;
+1F569;RIGHT SPEAKER WITH ONE SOUND WAVE;So;0;ON;;;;;N;;;;;
+1F56A;RIGHT SPEAKER WITH THREE SOUND WAVES;So;0;ON;;;;;N;;;;;
+1F56B;BULLHORN;So;0;ON;;;;;N;;;;;
+1F56C;BULLHORN WITH SOUND WAVES;So;0;ON;;;;;N;;;;;
+1F56D;RINGING BELL;So;0;ON;;;;;N;;;;;
+1F56E;BOOK;So;0;ON;;;;;N;;;;;
+1F56F;CANDLE;So;0;ON;;;;;N;;;;;
+1F570;MANTELPIECE CLOCK;So;0;ON;;;;;N;;;;;
+1F571;BLACK SKULL AND CROSSBONES;So;0;ON;;;;;N;;;;;
+1F572;NO PIRACY;So;0;ON;;;;;N;;;;;
+1F573;HOLE;So;0;ON;;;;;N;;;;;
+1F574;MAN IN BUSINESS SUIT LEVITATING;So;0;ON;;;;;N;;;;;
+1F575;SLEUTH OR SPY;So;0;ON;;;;;N;;;;;
+1F576;DARK SUNGLASSES;So;0;ON;;;;;N;;;;;
+1F577;SPIDER;So;0;ON;;;;;N;;;;;
+1F578;SPIDER WEB;So;0;ON;;;;;N;;;;;
+1F579;JOYSTICK;So;0;ON;;;;;N;;;;;
+1F57A;MAN DANCING;So;0;ON;;;;;N;;;;;
+1F57B;LEFT HAND TELEPHONE RECEIVER;So;0;ON;;;;;N;;;;;
+1F57C;TELEPHONE RECEIVER WITH PAGE;So;0;ON;;;;;N;;;;;
+1F57D;RIGHT HAND TELEPHONE RECEIVER;So;0;ON;;;;;N;;;;;
+1F57E;WHITE TOUCHTONE TELEPHONE;So;0;ON;;;;;N;;;;;
+1F57F;BLACK TOUCHTONE TELEPHONE;So;0;ON;;;;;N;;;;;
+1F580;TELEPHONE ON TOP OF MODEM;So;0;ON;;;;;N;;;;;
+1F581;CLAMSHELL MOBILE PHONE;So;0;ON;;;;;N;;;;;
+1F582;BACK OF ENVELOPE;So;0;ON;;;;;N;;;;;
+1F583;STAMPED ENVELOPE;So;0;ON;;;;;N;;;;;
+1F584;ENVELOPE WITH LIGHTNING;So;0;ON;;;;;N;;;;;
+1F585;FLYING ENVELOPE;So;0;ON;;;;;N;;;;;
+1F586;PEN OVER STAMPED ENVELOPE;So;0;ON;;;;;N;;;;;
+1F587;LINKED PAPERCLIPS;So;0;ON;;;;;N;;;;;
+1F588;BLACK PUSHPIN;So;0;ON;;;;;N;;;;;
+1F589;LOWER LEFT PENCIL;So;0;ON;;;;;N;;;;;
+1F58A;LOWER LEFT BALLPOINT PEN;So;0;ON;;;;;N;;;;;
+1F58B;LOWER LEFT FOUNTAIN PEN;So;0;ON;;;;;N;;;;;
+1F58C;LOWER LEFT PAINTBRUSH;So;0;ON;;;;;N;;;;;
+1F58D;LOWER LEFT CRAYON;So;0;ON;;;;;N;;;;;
+1F58E;LEFT WRITING HAND;So;0;ON;;;;;N;;;;;
+1F58F;TURNED OK HAND SIGN;So;0;ON;;;;;N;;;;;
+1F590;RAISED HAND WITH FINGERS SPLAYED;So;0;ON;;;;;N;;;;;
+1F591;REVERSED RAISED HAND WITH FINGERS SPLAYED;So;0;ON;;;;;N;;;;;
+1F592;REVERSED THUMBS UP SIGN;So;0;ON;;;;;N;;;;;
+1F593;REVERSED THUMBS DOWN SIGN;So;0;ON;;;;;N;;;;;
+1F594;REVERSED VICTORY HAND;So;0;ON;;;;;N;;;;;
+1F595;REVERSED HAND WITH MIDDLE FINGER EXTENDED;So;0;ON;;;;;N;;;;;
+1F596;RAISED HAND WITH PART BETWEEN MIDDLE AND RING FINGERS;So;0;ON;;;;;N;;;;;
+1F597;WHITE DOWN POINTING LEFT HAND INDEX;So;0;ON;;;;;N;;;;;
+1F598;SIDEWAYS WHITE LEFT POINTING INDEX;So;0;ON;;;;;N;;;;;
+1F599;SIDEWAYS WHITE RIGHT POINTING INDEX;So;0;ON;;;;;N;;;;;
+1F59A;SIDEWAYS BLACK LEFT POINTING INDEX;So;0;ON;;;;;N;;;;;
+1F59B;SIDEWAYS BLACK RIGHT POINTING INDEX;So;0;ON;;;;;N;;;;;
+1F59C;BLACK LEFT POINTING BACKHAND INDEX;So;0;ON;;;;;N;;;;;
+1F59D;BLACK RIGHT POINTING BACKHAND INDEX;So;0;ON;;;;;N;;;;;
+1F59E;SIDEWAYS WHITE UP POINTING INDEX;So;0;ON;;;;;N;;;;;
+1F59F;SIDEWAYS WHITE DOWN POINTING INDEX;So;0;ON;;;;;N;;;;;
+1F5A0;SIDEWAYS BLACK UP POINTING INDEX;So;0;ON;;;;;N;;;;;
+1F5A1;SIDEWAYS BLACK DOWN POINTING INDEX;So;0;ON;;;;;N;;;;;
+1F5A2;BLACK UP POINTING BACKHAND INDEX;So;0;ON;;;;;N;;;;;
+1F5A3;BLACK DOWN POINTING BACKHAND INDEX;So;0;ON;;;;;N;;;;;
+1F5A4;BLACK HEART;So;0;ON;;;;;N;;;;;
+1F5A5;DESKTOP COMPUTER;So;0;ON;;;;;N;;;;;
+1F5A6;KEYBOARD AND MOUSE;So;0;ON;;;;;N;;;;;
+1F5A7;THREE NETWORKED COMPUTERS;So;0;ON;;;;;N;;;;;
+1F5A8;PRINTER;So;0;ON;;;;;N;;;;;
+1F5A9;POCKET CALCULATOR;So;0;ON;;;;;N;;;;;
+1F5AA;BLACK HARD SHELL FLOPPY DISK;So;0;ON;;;;;N;;;;;
+1F5AB;WHITE HARD SHELL FLOPPY DISK;So;0;ON;;;;;N;;;;;
+1F5AC;SOFT SHELL FLOPPY DISK;So;0;ON;;;;;N;;;;;
+1F5AD;TAPE CARTRIDGE;So;0;ON;;;;;N;;;;;
+1F5AE;WIRED KEYBOARD;So;0;ON;;;;;N;;;;;
+1F5AF;ONE BUTTON MOUSE;So;0;ON;;;;;N;;;;;
+1F5B0;TWO BUTTON MOUSE;So;0;ON;;;;;N;;;;;
+1F5B1;THREE BUTTON MOUSE;So;0;ON;;;;;N;;;;;
+1F5B2;TRACKBALL;So;0;ON;;;;;N;;;;;
+1F5B3;OLD PERSONAL COMPUTER;So;0;ON;;;;;N;;;;;
+1F5B4;HARD DISK;So;0;ON;;;;;N;;;;;
+1F5B5;SCREEN;So;0;ON;;;;;N;;;;;
+1F5B6;PRINTER ICON;So;0;ON;;;;;N;;;;;
+1F5B7;FAX ICON;So;0;ON;;;;;N;;;;;
+1F5B8;OPTICAL DISC ICON;So;0;ON;;;;;N;;;;;
+1F5B9;DOCUMENT WITH TEXT;So;0;ON;;;;;N;;;;;
+1F5BA;DOCUMENT WITH TEXT AND PICTURE;So;0;ON;;;;;N;;;;;
+1F5BB;DOCUMENT WITH PICTURE;So;0;ON;;;;;N;;;;;
+1F5BC;FRAME WITH PICTURE;So;0;ON;;;;;N;;;;;
+1F5BD;FRAME WITH TILES;So;0;ON;;;;;N;;;;;
+1F5BE;FRAME WITH AN X;So;0;ON;;;;;N;;;;;
+1F5BF;BLACK FOLDER;So;0;ON;;;;;N;;;;;
+1F5C0;FOLDER;So;0;ON;;;;;N;;;;;
+1F5C1;OPEN FOLDER;So;0;ON;;;;;N;;;;;
+1F5C2;CARD INDEX DIVIDERS;So;0;ON;;;;;N;;;;;
+1F5C3;CARD FILE BOX;So;0;ON;;;;;N;;;;;
+1F5C4;FILE CABINET;So;0;ON;;;;;N;;;;;
+1F5C5;EMPTY NOTE;So;0;ON;;;;;N;;;;;
+1F5C6;EMPTY NOTE PAGE;So;0;ON;;;;;N;;;;;
+1F5C7;EMPTY NOTE PAD;So;0;ON;;;;;N;;;;;
+1F5C8;NOTE;So;0;ON;;;;;N;;;;;
+1F5C9;NOTE PAGE;So;0;ON;;;;;N;;;;;
+1F5CA;NOTE PAD;So;0;ON;;;;;N;;;;;
+1F5CB;EMPTY DOCUMENT;So;0;ON;;;;;N;;;;;
+1F5CC;EMPTY PAGE;So;0;ON;;;;;N;;;;;
+1F5CD;EMPTY PAGES;So;0;ON;;;;;N;;;;;
+1F5CE;DOCUMENT;So;0;ON;;;;;N;;;;;
+1F5CF;PAGE;So;0;ON;;;;;N;;;;;
+1F5D0;PAGES;So;0;ON;;;;;N;;;;;
+1F5D1;WASTEBASKET;So;0;ON;;;;;N;;;;;
+1F5D2;SPIRAL NOTE PAD;So;0;ON;;;;;N;;;;;
+1F5D3;SPIRAL CALENDAR PAD;So;0;ON;;;;;N;;;;;
+1F5D4;DESKTOP WINDOW;So;0;ON;;;;;N;;;;;
+1F5D5;MINIMIZE;So;0;ON;;;;;N;;;;;
+1F5D6;MAXIMIZE;So;0;ON;;;;;N;;;;;
+1F5D7;OVERLAP;So;0;ON;;;;;N;;;;;
+1F5D8;CLOCKWISE RIGHT AND LEFT SEMICIRCLE ARROWS;So;0;ON;;;;;N;;;;;
+1F5D9;CANCELLATION X;So;0;ON;;;;;N;;;;;
+1F5DA;INCREASE FONT SIZE SYMBOL;So;0;ON;;;;;N;;;;;
+1F5DB;DECREASE FONT SIZE SYMBOL;So;0;ON;;;;;N;;;;;
+1F5DC;COMPRESSION;So;0;ON;;;;;N;;;;;
+1F5DD;OLD KEY;So;0;ON;;;;;N;;;;;
+1F5DE;ROLLED-UP NEWSPAPER;So;0;ON;;;;;N;;;;;
+1F5DF;PAGE WITH CIRCLED TEXT;So;0;ON;;;;;N;;;;;
+1F5E0;STOCK CHART;So;0;ON;;;;;N;;;;;
+1F5E1;DAGGER KNIFE;So;0;ON;;;;;N;;;;;
+1F5E2;LIPS;So;0;ON;;;;;N;;;;;
+1F5E3;SPEAKING HEAD IN SILHOUETTE;So;0;ON;;;;;N;;;;;
+1F5E4;THREE RAYS ABOVE;So;0;ON;;;;;N;;;;;
+1F5E5;THREE RAYS BELOW;So;0;ON;;;;;N;;;;;
+1F5E6;THREE RAYS LEFT;So;0;ON;;;;;N;;;;;
+1F5E7;THREE RAYS RIGHT;So;0;ON;;;;;N;;;;;
+1F5E8;LEFT SPEECH BUBBLE;So;0;ON;;;;;N;;;;;
+1F5E9;RIGHT SPEECH BUBBLE;So;0;ON;;;;;N;;;;;
+1F5EA;TWO SPEECH BUBBLES;So;0;ON;;;;;N;;;;;
+1F5EB;THREE SPEECH BUBBLES;So;0;ON;;;;;N;;;;;
+1F5EC;LEFT THOUGHT BUBBLE;So;0;ON;;;;;N;;;;;
+1F5ED;RIGHT THOUGHT BUBBLE;So;0;ON;;;;;N;;;;;
+1F5EE;LEFT ANGER BUBBLE;So;0;ON;;;;;N;;;;;
+1F5EF;RIGHT ANGER BUBBLE;So;0;ON;;;;;N;;;;;
+1F5F0;MOOD BUBBLE;So;0;ON;;;;;N;;;;;
+1F5F1;LIGHTNING MOOD BUBBLE;So;0;ON;;;;;N;;;;;
+1F5F2;LIGHTNING MOOD;So;0;ON;;;;;N;;;;;
+1F5F3;BALLOT BOX WITH BALLOT;So;0;ON;;;;;N;;;;;
+1F5F4;BALLOT SCRIPT X;So;0;ON;;;;;N;;;;;
+1F5F5;BALLOT BOX WITH SCRIPT X;So;0;ON;;;;;N;;;;;
+1F5F6;BALLOT BOLD SCRIPT X;So;0;ON;;;;;N;;;;;
+1F5F7;BALLOT BOX WITH BOLD SCRIPT X;So;0;ON;;;;;N;;;;;
+1F5F8;LIGHT CHECK MARK;So;0;ON;;;;;N;;;;;
+1F5F9;BALLOT BOX WITH BOLD CHECK;So;0;ON;;;;;N;;;;;
+1F5FA;WORLD MAP;So;0;ON;;;;;N;;;;;
+1F5FB;MOUNT FUJI;So;0;ON;;;;;N;;;;;
+1F5FC;TOKYO TOWER;So;0;ON;;;;;N;;;;;
+1F5FD;STATUE OF LIBERTY;So;0;ON;;;;;N;;;;;
+1F5FE;SILHOUETTE OF JAPAN;So;0;ON;;;;;N;;;;;
+1F5FF;MOYAI;So;0;ON;;;;;N;;;;;
+1F600;GRINNING FACE;So;0;ON;;;;;N;;;;;
+1F601;GRINNING FACE WITH SMILING EYES;So;0;ON;;;;;N;;;;;
+1F602;FACE WITH TEARS OF JOY;So;0;ON;;;;;N;;;;;
+1F603;SMILING FACE WITH OPEN MOUTH;So;0;ON;;;;;N;;;;;
+1F604;SMILING FACE WITH OPEN MOUTH AND SMILING EYES;So;0;ON;;;;;N;;;;;
+1F605;SMILING FACE WITH OPEN MOUTH AND COLD SWEAT;So;0;ON;;;;;N;;;;;
+1F606;SMILING FACE WITH OPEN MOUTH AND TIGHTLY-CLOSED EYES;So;0;ON;;;;;N;;;;;
+1F607;SMILING FACE WITH HALO;So;0;ON;;;;;N;;;;;
+1F608;SMILING FACE WITH HORNS;So;0;ON;;;;;N;;;;;
+1F609;WINKING FACE;So;0;ON;;;;;N;;;;;
+1F60A;SMILING FACE WITH SMILING EYES;So;0;ON;;;;;N;;;;;
+1F60B;FACE SAVOURING DELICIOUS FOOD;So;0;ON;;;;;N;;;;;
+1F60C;RELIEVED FACE;So;0;ON;;;;;N;;;;;
+1F60D;SMILING FACE WITH HEART-SHAPED EYES;So;0;ON;;;;;N;;;;;
+1F60E;SMILING FACE WITH SUNGLASSES;So;0;ON;;;;;N;;;;;
+1F60F;SMIRKING FACE;So;0;ON;;;;;N;;;;;
+1F610;NEUTRAL FACE;So;0;ON;;;;;N;;;;;
+1F611;EXPRESSIONLESS FACE;So;0;ON;;;;;N;;;;;
+1F612;UNAMUSED FACE;So;0;ON;;;;;N;;;;;
+1F613;FACE WITH COLD SWEAT;So;0;ON;;;;;N;;;;;
+1F614;PENSIVE FACE;So;0;ON;;;;;N;;;;;
+1F615;CONFUSED FACE;So;0;ON;;;;;N;;;;;
+1F616;CONFOUNDED FACE;So;0;ON;;;;;N;;;;;
+1F617;KISSING FACE;So;0;ON;;;;;N;;;;;
+1F618;FACE THROWING A KISS;So;0;ON;;;;;N;;;;;
+1F619;KISSING FACE WITH SMILING EYES;So;0;ON;;;;;N;;;;;
+1F61A;KISSING FACE WITH CLOSED EYES;So;0;ON;;;;;N;;;;;
+1F61B;FACE WITH STUCK-OUT TONGUE;So;0;ON;;;;;N;;;;;
+1F61C;FACE WITH STUCK-OUT TONGUE AND WINKING EYE;So;0;ON;;;;;N;;;;;
+1F61D;FACE WITH STUCK-OUT TONGUE AND TIGHTLY-CLOSED EYES;So;0;ON;;;;;N;;;;;
+1F61E;DISAPPOINTED FACE;So;0;ON;;;;;N;;;;;
+1F61F;WORRIED FACE;So;0;ON;;;;;N;;;;;
+1F620;ANGRY FACE;So;0;ON;;;;;N;;;;;
+1F621;POUTING FACE;So;0;ON;;;;;N;;;;;
+1F622;CRYING FACE;So;0;ON;;;;;N;;;;;
+1F623;PERSEVERING FACE;So;0;ON;;;;;N;;;;;
+1F624;FACE WITH LOOK OF TRIUMPH;So;0;ON;;;;;N;;;;;
+1F625;DISAPPOINTED BUT RELIEVED FACE;So;0;ON;;;;;N;;;;;
+1F626;FROWNING FACE WITH OPEN MOUTH;So;0;ON;;;;;N;;;;;
+1F627;ANGUISHED FACE;So;0;ON;;;;;N;;;;;
+1F628;FEARFUL FACE;So;0;ON;;;;;N;;;;;
+1F629;WEARY FACE;So;0;ON;;;;;N;;;;;
+1F62A;SLEEPY FACE;So;0;ON;;;;;N;;;;;
+1F62B;TIRED FACE;So;0;ON;;;;;N;;;;;
+1F62C;GRIMACING FACE;So;0;ON;;;;;N;;;;;
+1F62D;LOUDLY CRYING FACE;So;0;ON;;;;;N;;;;;
+1F62E;FACE WITH OPEN MOUTH;So;0;ON;;;;;N;;;;;
+1F62F;HUSHED FACE;So;0;ON;;;;;N;;;;;
+1F630;FACE WITH OPEN MOUTH AND COLD SWEAT;So;0;ON;;;;;N;;;;;
+1F631;FACE SCREAMING IN FEAR;So;0;ON;;;;;N;;;;;
+1F632;ASTONISHED FACE;So;0;ON;;;;;N;;;;;
+1F633;FLUSHED FACE;So;0;ON;;;;;N;;;;;
+1F634;SLEEPING FACE;So;0;ON;;;;;N;;;;;
+1F635;DIZZY FACE;So;0;ON;;;;;N;;;;;
+1F636;FACE WITHOUT MOUTH;So;0;ON;;;;;N;;;;;
+1F637;FACE WITH MEDICAL MASK;So;0;ON;;;;;N;;;;;
+1F638;GRINNING CAT FACE WITH SMILING EYES;So;0;ON;;;;;N;;;;;
+1F639;CAT FACE WITH TEARS OF JOY;So;0;ON;;;;;N;;;;;
+1F63A;SMILING CAT FACE WITH OPEN MOUTH;So;0;ON;;;;;N;;;;;
+1F63B;SMILING CAT FACE WITH HEART-SHAPED EYES;So;0;ON;;;;;N;;;;;
+1F63C;CAT FACE WITH WRY SMILE;So;0;ON;;;;;N;;;;;
+1F63D;KISSING CAT FACE WITH CLOSED EYES;So;0;ON;;;;;N;;;;;
+1F63E;POUTING CAT FACE;So;0;ON;;;;;N;;;;;
+1F63F;CRYING CAT FACE;So;0;ON;;;;;N;;;;;
+1F640;WEARY CAT FACE;So;0;ON;;;;;N;;;;;
+1F641;SLIGHTLY FROWNING FACE;So;0;ON;;;;;N;;;;;
+1F642;SLIGHTLY SMILING FACE;So;0;ON;;;;;N;;;;;
+1F643;UPSIDE-DOWN FACE;So;0;ON;;;;;N;;;;;
+1F644;FACE WITH ROLLING EYES;So;0;ON;;;;;N;;;;;
+1F645;FACE WITH NO GOOD GESTURE;So;0;ON;;;;;N;;;;;
+1F646;FACE WITH OK GESTURE;So;0;ON;;;;;N;;;;;
+1F647;PERSON BOWING DEEPLY;So;0;ON;;;;;N;;;;;
+1F648;SEE-NO-EVIL MONKEY;So;0;ON;;;;;N;;;;;
+1F649;HEAR-NO-EVIL MONKEY;So;0;ON;;;;;N;;;;;
+1F64A;SPEAK-NO-EVIL MONKEY;So;0;ON;;;;;N;;;;;
+1F64B;HAPPY PERSON RAISING ONE HAND;So;0;ON;;;;;N;;;;;
+1F64C;PERSON RAISING BOTH HANDS IN CELEBRATION;So;0;ON;;;;;N;;;;;
+1F64D;PERSON FROWNING;So;0;ON;;;;;N;;;;;
+1F64E;PERSON WITH POUTING FACE;So;0;ON;;;;;N;;;;;
+1F64F;PERSON WITH FOLDED HANDS;So;0;ON;;;;;N;;;;;
+1F650;NORTH WEST POINTING LEAF;So;0;ON;;;;;N;;;;;
+1F651;SOUTH WEST POINTING LEAF;So;0;ON;;;;;N;;;;;
+1F652;NORTH EAST POINTING LEAF;So;0;ON;;;;;N;;;;;
+1F653;SOUTH EAST POINTING LEAF;So;0;ON;;;;;N;;;;;
+1F654;TURNED NORTH WEST POINTING LEAF;So;0;ON;;;;;N;;;;;
+1F655;TURNED SOUTH WEST POINTING LEAF;So;0;ON;;;;;N;;;;;
+1F656;TURNED NORTH EAST POINTING LEAF;So;0;ON;;;;;N;;;;;
+1F657;TURNED SOUTH EAST POINTING LEAF;So;0;ON;;;;;N;;;;;
+1F658;NORTH WEST POINTING VINE LEAF;So;0;ON;;;;;N;;;;;
+1F659;SOUTH WEST POINTING VINE LEAF;So;0;ON;;;;;N;;;;;
+1F65A;NORTH EAST POINTING VINE LEAF;So;0;ON;;;;;N;;;;;
+1F65B;SOUTH EAST POINTING VINE LEAF;So;0;ON;;;;;N;;;;;
+1F65C;HEAVY NORTH WEST POINTING VINE LEAF;So;0;ON;;;;;N;;;;;
+1F65D;HEAVY SOUTH WEST POINTING VINE LEAF;So;0;ON;;;;;N;;;;;
+1F65E;HEAVY NORTH EAST POINTING VINE LEAF;So;0;ON;;;;;N;;;;;
+1F65F;HEAVY SOUTH EAST POINTING VINE LEAF;So;0;ON;;;;;N;;;;;
+1F660;NORTH WEST POINTING BUD;So;0;ON;;;;;N;;;;;
+1F661;SOUTH WEST POINTING BUD;So;0;ON;;;;;N;;;;;
+1F662;NORTH EAST POINTING BUD;So;0;ON;;;;;N;;;;;
+1F663;SOUTH EAST POINTING BUD;So;0;ON;;;;;N;;;;;
+1F664;HEAVY NORTH WEST POINTING BUD;So;0;ON;;;;;N;;;;;
+1F665;HEAVY SOUTH WEST POINTING BUD;So;0;ON;;;;;N;;;;;
+1F666;HEAVY NORTH EAST POINTING BUD;So;0;ON;;;;;N;;;;;
+1F667;HEAVY SOUTH EAST POINTING BUD;So;0;ON;;;;;N;;;;;
+1F668;HOLLOW QUILT SQUARE ORNAMENT;So;0;ON;;;;;N;;;;;
+1F669;HOLLOW QUILT SQUARE ORNAMENT IN BLACK SQUARE;So;0;ON;;;;;N;;;;;
+1F66A;SOLID QUILT SQUARE ORNAMENT;So;0;ON;;;;;N;;;;;
+1F66B;SOLID QUILT SQUARE ORNAMENT IN BLACK SQUARE;So;0;ON;;;;;N;;;;;
+1F66C;LEFTWARDS ROCKET;So;0;ON;;;;;N;;;;;
+1F66D;UPWARDS ROCKET;So;0;ON;;;;;N;;;;;
+1F66E;RIGHTWARDS ROCKET;So;0;ON;;;;;N;;;;;
+1F66F;DOWNWARDS ROCKET;So;0;ON;;;;;N;;;;;
+1F670;SCRIPT LIGATURE ET ORNAMENT;So;0;ON;;;;;N;;;;;
+1F671;HEAVY SCRIPT LIGATURE ET ORNAMENT;So;0;ON;;;;;N;;;;;
+1F672;LIGATURE OPEN ET ORNAMENT;So;0;ON;;;;;N;;;;;
+1F673;HEAVY LIGATURE OPEN ET ORNAMENT;So;0;ON;;;;;N;;;;;
+1F674;HEAVY AMPERSAND ORNAMENT;So;0;ON;;;;;N;;;;;
+1F675;SWASH AMPERSAND ORNAMENT;So;0;ON;;;;;N;;;;;
+1F676;SANS-SERIF HEAVY DOUBLE TURNED COMMA QUOTATION MARK ORNAMENT;So;0;ON;;;;;N;;;;;
+1F677;SANS-SERIF HEAVY DOUBLE COMMA QUOTATION MARK ORNAMENT;So;0;ON;;;;;N;;;;;
+1F678;SANS-SERIF HEAVY LOW DOUBLE COMMA QUOTATION MARK ORNAMENT;So;0;ON;;;;;N;;;;;
+1F679;HEAVY INTERROBANG ORNAMENT;So;0;ON;;;;;N;;;;;
+1F67A;SANS-SERIF INTERROBANG ORNAMENT;So;0;ON;;;;;N;;;;;
+1F67B;HEAVY SANS-SERIF INTERROBANG ORNAMENT;So;0;ON;;;;;N;;;;;
+1F67C;VERY HEAVY SOLIDUS;So;0;ON;;;;;N;;;;;
+1F67D;VERY HEAVY REVERSE SOLIDUS;So;0;ON;;;;;N;;;;;
+1F67E;CHECKER BOARD;So;0;ON;;;;;N;;;;;
+1F67F;REVERSE CHECKER BOARD;So;0;ON;;;;;N;;;;;
+1F680;ROCKET;So;0;ON;;;;;N;;;;;
+1F681;HELICOPTER;So;0;ON;;;;;N;;;;;
+1F682;STEAM LOCOMOTIVE;So;0;ON;;;;;N;;;;;
+1F683;RAILWAY CAR;So;0;ON;;;;;N;;;;;
+1F684;HIGH-SPEED TRAIN;So;0;ON;;;;;N;;;;;
+1F685;HIGH-SPEED TRAIN WITH BULLET NOSE;So;0;ON;;;;;N;;;;;
+1F686;TRAIN;So;0;ON;;;;;N;;;;;
+1F687;METRO;So;0;ON;;;;;N;;;;;
+1F688;LIGHT RAIL;So;0;ON;;;;;N;;;;;
+1F689;STATION;So;0;ON;;;;;N;;;;;
+1F68A;TRAM;So;0;ON;;;;;N;;;;;
+1F68B;TRAM CAR;So;0;ON;;;;;N;;;;;
+1F68C;BUS;So;0;ON;;;;;N;;;;;
+1F68D;ONCOMING BUS;So;0;ON;;;;;N;;;;;
+1F68E;TROLLEYBUS;So;0;ON;;;;;N;;;;;
+1F68F;BUS STOP;So;0;ON;;;;;N;;;;;
+1F690;MINIBUS;So;0;ON;;;;;N;;;;;
+1F691;AMBULANCE;So;0;ON;;;;;N;;;;;
+1F692;FIRE ENGINE;So;0;ON;;;;;N;;;;;
+1F693;POLICE CAR;So;0;ON;;;;;N;;;;;
+1F694;ONCOMING POLICE CAR;So;0;ON;;;;;N;;;;;
+1F695;TAXI;So;0;ON;;;;;N;;;;;
+1F696;ONCOMING TAXI;So;0;ON;;;;;N;;;;;
+1F697;AUTOMOBILE;So;0;ON;;;;;N;;;;;
+1F698;ONCOMING AUTOMOBILE;So;0;ON;;;;;N;;;;;
+1F699;RECREATIONAL VEHICLE;So;0;ON;;;;;N;;;;;
+1F69A;DELIVERY TRUCK;So;0;ON;;;;;N;;;;;
+1F69B;ARTICULATED LORRY;So;0;ON;;;;;N;;;;;
+1F69C;TRACTOR;So;0;ON;;;;;N;;;;;
+1F69D;MONORAIL;So;0;ON;;;;;N;;;;;
+1F69E;MOUNTAIN RAILWAY;So;0;ON;;;;;N;;;;;
+1F69F;SUSPENSION RAILWAY;So;0;ON;;;;;N;;;;;
+1F6A0;MOUNTAIN CABLEWAY;So;0;ON;;;;;N;;;;;
+1F6A1;AERIAL TRAMWAY;So;0;ON;;;;;N;;;;;
+1F6A2;SHIP;So;0;ON;;;;;N;;;;;
+1F6A3;ROWBOAT;So;0;ON;;;;;N;;;;;
+1F6A4;SPEEDBOAT;So;0;ON;;;;;N;;;;;
+1F6A5;HORIZONTAL TRAFFIC LIGHT;So;0;ON;;;;;N;;;;;
+1F6A6;VERTICAL TRAFFIC LIGHT;So;0;ON;;;;;N;;;;;
+1F6A7;CONSTRUCTION SIGN;So;0;ON;;;;;N;;;;;
+1F6A8;POLICE CARS REVOLVING LIGHT;So;0;ON;;;;;N;;;;;
+1F6A9;TRIANGULAR FLAG ON POST;So;0;ON;;;;;N;;;;;
+1F6AA;DOOR;So;0;ON;;;;;N;;;;;
+1F6AB;NO ENTRY SIGN;So;0;ON;;;;;N;;;;;
+1F6AC;SMOKING SYMBOL;So;0;ON;;;;;N;;;;;
+1F6AD;NO SMOKING SYMBOL;So;0;ON;;;;;N;;;;;
+1F6AE;PUT LITTER IN ITS PLACE SYMBOL;So;0;ON;;;;;N;;;;;
+1F6AF;DO NOT LITTER SYMBOL;So;0;ON;;;;;N;;;;;
+1F6B0;POTABLE WATER SYMBOL;So;0;ON;;;;;N;;;;;
+1F6B1;NON-POTABLE WATER SYMBOL;So;0;ON;;;;;N;;;;;
+1F6B2;BICYCLE;So;0;ON;;;;;N;;;;;
+1F6B3;NO BICYCLES;So;0;ON;;;;;N;;;;;
+1F6B4;BICYCLIST;So;0;ON;;;;;N;;;;;
+1F6B5;MOUNTAIN BICYCLIST;So;0;ON;;;;;N;;;;;
+1F6B6;PEDESTRIAN;So;0;ON;;;;;N;;;;;
+1F6B7;NO PEDESTRIANS;So;0;ON;;;;;N;;;;;
+1F6B8;CHILDREN CROSSING;So;0;ON;;;;;N;;;;;
+1F6B9;MENS SYMBOL;So;0;ON;;;;;N;;;;;
+1F6BA;WOMENS SYMBOL;So;0;ON;;;;;N;;;;;
+1F6BB;RESTROOM;So;0;ON;;;;;N;;;;;
+1F6BC;BABY SYMBOL;So;0;ON;;;;;N;;;;;
+1F6BD;TOILET;So;0;ON;;;;;N;;;;;
+1F6BE;WATER CLOSET;So;0;ON;;;;;N;;;;;
+1F6BF;SHOWER;So;0;ON;;;;;N;;;;;
+1F6C0;BATH;So;0;ON;;;;;N;;;;;
+1F6C1;BATHTUB;So;0;ON;;;;;N;;;;;
+1F6C2;PASSPORT CONTROL;So;0;ON;;;;;N;;;;;
+1F6C3;CUSTOMS;So;0;ON;;;;;N;;;;;
+1F6C4;BAGGAGE CLAIM;So;0;ON;;;;;N;;;;;
+1F6C5;LEFT LUGGAGE;So;0;ON;;;;;N;;;;;
+1F6C6;TRIANGLE WITH ROUNDED CORNERS;So;0;ON;;;;;N;;;;;
+1F6C7;PROHIBITED SIGN;So;0;ON;;;;;N;;;;;
+1F6C8;CIRCLED INFORMATION SOURCE;So;0;ON;;;;;N;;;;;
+1F6C9;BOYS SYMBOL;So;0;ON;;;;;N;;;;;
+1F6CA;GIRLS SYMBOL;So;0;ON;;;;;N;;;;;
+1F6CB;COUCH AND LAMP;So;0;ON;;;;;N;;;;;
+1F6CC;SLEEPING ACCOMMODATION;So;0;ON;;;;;N;;;;;
+1F6CD;SHOPPING BAGS;So;0;ON;;;;;N;;;;;
+1F6CE;BELLHOP BELL;So;0;ON;;;;;N;;;;;
+1F6CF;BED;So;0;ON;;;;;N;;;;;
+1F6D0;PLACE OF WORSHIP;So;0;ON;;;;;N;;;;;
+1F6D1;OCTAGONAL SIGN;So;0;ON;;;;;N;;;;;
+1F6D2;SHOPPING TROLLEY;So;0;ON;;;;;N;;;;;
+1F6D3;STUPA;So;0;ON;;;;;N;;;;;
+1F6D4;PAGODA;So;0;ON;;;;;N;;;;;
+1F6E0;HAMMER AND WRENCH;So;0;ON;;;;;N;;;;;
+1F6E1;SHIELD;So;0;ON;;;;;N;;;;;
+1F6E2;OIL DRUM;So;0;ON;;;;;N;;;;;
+1F6E3;MOTORWAY;So;0;ON;;;;;N;;;;;
+1F6E4;RAILWAY TRACK;So;0;ON;;;;;N;;;;;
+1F6E5;MOTOR BOAT;So;0;ON;;;;;N;;;;;
+1F6E6;UP-POINTING MILITARY AIRPLANE;So;0;ON;;;;;N;;;;;
+1F6E7;UP-POINTING AIRPLANE;So;0;ON;;;;;N;;;;;
+1F6E8;UP-POINTING SMALL AIRPLANE;So;0;ON;;;;;N;;;;;
+1F6E9;SMALL AIRPLANE;So;0;ON;;;;;N;;;;;
+1F6EA;NORTHEAST-POINTING AIRPLANE;So;0;ON;;;;;N;;;;;
+1F6EB;AIRPLANE DEPARTURE;So;0;ON;;;;;N;;;;;
+1F6EC;AIRPLANE ARRIVING;So;0;ON;;;;;N;;;;;
+1F6F0;SATELLITE;So;0;ON;;;;;N;;;;;
+1F6F1;ONCOMING FIRE ENGINE;So;0;ON;;;;;N;;;;;
+1F6F2;DIESEL LOCOMOTIVE;So;0;ON;;;;;N;;;;;
+1F6F3;PASSENGER SHIP;So;0;ON;;;;;N;;;;;
+1F6F4;SCOOTER;So;0;ON;;;;;N;;;;;
+1F6F5;MOTOR SCOOTER;So;0;ON;;;;;N;;;;;
+1F6F6;CANOE;So;0;ON;;;;;N;;;;;
+1F6F7;SLED;So;0;ON;;;;;N;;;;;
+1F6F8;FLYING SAUCER;So;0;ON;;;;;N;;;;;
+1F700;ALCHEMICAL SYMBOL FOR QUINTESSENCE;So;0;ON;;;;;N;;;;;
+1F701;ALCHEMICAL SYMBOL FOR AIR;So;0;ON;;;;;N;;;;;
+1F702;ALCHEMICAL SYMBOL FOR FIRE;So;0;ON;;;;;N;;;;;
+1F703;ALCHEMICAL SYMBOL FOR EARTH;So;0;ON;;;;;N;;;;;
+1F704;ALCHEMICAL SYMBOL FOR WATER;So;0;ON;;;;;N;;;;;
+1F705;ALCHEMICAL SYMBOL FOR AQUAFORTIS;So;0;ON;;;;;N;;;;;
+1F706;ALCHEMICAL SYMBOL FOR AQUA REGIA;So;0;ON;;;;;N;;;;;
+1F707;ALCHEMICAL SYMBOL FOR AQUA REGIA-2;So;0;ON;;;;;N;;;;;
+1F708;ALCHEMICAL SYMBOL FOR AQUA VITAE;So;0;ON;;;;;N;;;;;
+1F709;ALCHEMICAL SYMBOL FOR AQUA VITAE-2;So;0;ON;;;;;N;;;;;
+1F70A;ALCHEMICAL SYMBOL FOR VINEGAR;So;0;ON;;;;;N;;;;;
+1F70B;ALCHEMICAL SYMBOL FOR VINEGAR-2;So;0;ON;;;;;N;;;;;
+1F70C;ALCHEMICAL SYMBOL FOR VINEGAR-3;So;0;ON;;;;;N;;;;;
+1F70D;ALCHEMICAL SYMBOL FOR SULFUR;So;0;ON;;;;;N;;;;;
+1F70E;ALCHEMICAL SYMBOL FOR PHILOSOPHERS SULFUR;So;0;ON;;;;;N;;;;;
+1F70F;ALCHEMICAL SYMBOL FOR BLACK SULFUR;So;0;ON;;;;;N;;;;;
+1F710;ALCHEMICAL SYMBOL FOR MERCURY SUBLIMATE;So;0;ON;;;;;N;;;;;
+1F711;ALCHEMICAL SYMBOL FOR MERCURY SUBLIMATE-2;So;0;ON;;;;;N;;;;;
+1F712;ALCHEMICAL SYMBOL FOR MERCURY SUBLIMATE-3;So;0;ON;;;;;N;;;;;
+1F713;ALCHEMICAL SYMBOL FOR CINNABAR;So;0;ON;;;;;N;;;;;
+1F714;ALCHEMICAL SYMBOL FOR SALT;So;0;ON;;;;;N;;;;;
+1F715;ALCHEMICAL SYMBOL FOR NITRE;So;0;ON;;;;;N;;;;;
+1F716;ALCHEMICAL SYMBOL FOR VITRIOL;So;0;ON;;;;;N;;;;;
+1F717;ALCHEMICAL SYMBOL FOR VITRIOL-2;So;0;ON;;;;;N;;;;;
+1F718;ALCHEMICAL SYMBOL FOR ROCK SALT;So;0;ON;;;;;N;;;;;
+1F719;ALCHEMICAL SYMBOL FOR ROCK SALT-2;So;0;ON;;;;;N;;;;;
+1F71A;ALCHEMICAL SYMBOL FOR GOLD;So;0;ON;;;;;N;;;;;
+1F71B;ALCHEMICAL SYMBOL FOR SILVER;So;0;ON;;;;;N;;;;;
+1F71C;ALCHEMICAL SYMBOL FOR IRON ORE;So;0;ON;;;;;N;;;;;
+1F71D;ALCHEMICAL SYMBOL FOR IRON ORE-2;So;0;ON;;;;;N;;;;;
+1F71E;ALCHEMICAL SYMBOL FOR CROCUS OF IRON;So;0;ON;;;;;N;;;;;
+1F71F;ALCHEMICAL SYMBOL FOR REGULUS OF IRON;So;0;ON;;;;;N;;;;;
+1F720;ALCHEMICAL SYMBOL FOR COPPER ORE;So;0;ON;;;;;N;;;;;
+1F721;ALCHEMICAL SYMBOL FOR IRON-COPPER ORE;So;0;ON;;;;;N;;;;;
+1F722;ALCHEMICAL SYMBOL FOR SUBLIMATE OF COPPER;So;0;ON;;;;;N;;;;;
+1F723;ALCHEMICAL SYMBOL FOR CROCUS OF COPPER;So;0;ON;;;;;N;;;;;
+1F724;ALCHEMICAL SYMBOL FOR CROCUS OF COPPER-2;So;0;ON;;;;;N;;;;;
+1F725;ALCHEMICAL SYMBOL FOR COPPER ANTIMONIATE;So;0;ON;;;;;N;;;;;
+1F726;ALCHEMICAL SYMBOL FOR SALT OF COPPER ANTIMONIATE;So;0;ON;;;;;N;;;;;
+1F727;ALCHEMICAL SYMBOL FOR SUBLIMATE OF SALT OF COPPER;So;0;ON;;;;;N;;;;;
+1F728;ALCHEMICAL SYMBOL FOR VERDIGRIS;So;0;ON;;;;;N;;;;;
+1F729;ALCHEMICAL SYMBOL FOR TIN ORE;So;0;ON;;;;;N;;;;;
+1F72A;ALCHEMICAL SYMBOL FOR LEAD ORE;So;0;ON;;;;;N;;;;;
+1F72B;ALCHEMICAL SYMBOL FOR ANTIMONY ORE;So;0;ON;;;;;N;;;;;
+1F72C;ALCHEMICAL SYMBOL FOR SUBLIMATE OF ANTIMONY;So;0;ON;;;;;N;;;;;
+1F72D;ALCHEMICAL SYMBOL FOR SALT OF ANTIMONY;So;0;ON;;;;;N;;;;;
+1F72E;ALCHEMICAL SYMBOL FOR SUBLIMATE OF SALT OF ANTIMONY;So;0;ON;;;;;N;;;;;
+1F72F;ALCHEMICAL SYMBOL FOR VINEGAR OF ANTIMONY;So;0;ON;;;;;N;;;;;
+1F730;ALCHEMICAL SYMBOL FOR REGULUS OF ANTIMONY;So;0;ON;;;;;N;;;;;
+1F731;ALCHEMICAL SYMBOL FOR REGULUS OF ANTIMONY-2;So;0;ON;;;;;N;;;;;
+1F732;ALCHEMICAL SYMBOL FOR REGULUS;So;0;ON;;;;;N;;;;;
+1F733;ALCHEMICAL SYMBOL FOR REGULUS-2;So;0;ON;;;;;N;;;;;
+1F734;ALCHEMICAL SYMBOL FOR REGULUS-3;So;0;ON;;;;;N;;;;;
+1F735;ALCHEMICAL SYMBOL FOR REGULUS-4;So;0;ON;;;;;N;;;;;
+1F736;ALCHEMICAL SYMBOL FOR ALKALI;So;0;ON;;;;;N;;;;;
+1F737;ALCHEMICAL SYMBOL FOR ALKALI-2;So;0;ON;;;;;N;;;;;
+1F738;ALCHEMICAL SYMBOL FOR MARCASITE;So;0;ON;;;;;N;;;;;
+1F739;ALCHEMICAL SYMBOL FOR SAL-AMMONIAC;So;0;ON;;;;;N;;;;;
+1F73A;ALCHEMICAL SYMBOL FOR ARSENIC;So;0;ON;;;;;N;;;;;
+1F73B;ALCHEMICAL SYMBOL FOR REALGAR;So;0;ON;;;;;N;;;;;
+1F73C;ALCHEMICAL SYMBOL FOR REALGAR-2;So;0;ON;;;;;N;;;;;
+1F73D;ALCHEMICAL SYMBOL FOR AURIPIGMENT;So;0;ON;;;;;N;;;;;
+1F73E;ALCHEMICAL SYMBOL FOR BISMUTH ORE;So;0;ON;;;;;N;;;;;
+1F73F;ALCHEMICAL SYMBOL FOR TARTAR;So;0;ON;;;;;N;;;;;
+1F740;ALCHEMICAL SYMBOL FOR TARTAR-2;So;0;ON;;;;;N;;;;;
+1F741;ALCHEMICAL SYMBOL FOR QUICK LIME;So;0;ON;;;;;N;;;;;
+1F742;ALCHEMICAL SYMBOL FOR BORAX;So;0;ON;;;;;N;;;;;
+1F743;ALCHEMICAL SYMBOL FOR BORAX-2;So;0;ON;;;;;N;;;;;
+1F744;ALCHEMICAL SYMBOL FOR BORAX-3;So;0;ON;;;;;N;;;;;
+1F745;ALCHEMICAL SYMBOL FOR ALUM;So;0;ON;;;;;N;;;;;
+1F746;ALCHEMICAL SYMBOL FOR OIL;So;0;ON;;;;;N;;;;;
+1F747;ALCHEMICAL SYMBOL FOR SPIRIT;So;0;ON;;;;;N;;;;;
+1F748;ALCHEMICAL SYMBOL FOR TINCTURE;So;0;ON;;;;;N;;;;;
+1F749;ALCHEMICAL SYMBOL FOR GUM;So;0;ON;;;;;N;;;;;
+1F74A;ALCHEMICAL SYMBOL FOR WAX;So;0;ON;;;;;N;;;;;
+1F74B;ALCHEMICAL SYMBOL FOR POWDER;So;0;ON;;;;;N;;;;;
+1F74C;ALCHEMICAL SYMBOL FOR CALX;So;0;ON;;;;;N;;;;;
+1F74D;ALCHEMICAL SYMBOL FOR TUTTY;So;0;ON;;;;;N;;;;;
+1F74E;ALCHEMICAL SYMBOL FOR CAPUT MORTUUM;So;0;ON;;;;;N;;;;;
+1F74F;ALCHEMICAL SYMBOL FOR SCEPTER OF JOVE;So;0;ON;;;;;N;;;;;
+1F750;ALCHEMICAL SYMBOL FOR CADUCEUS;So;0;ON;;;;;N;;;;;
+1F751;ALCHEMICAL SYMBOL FOR TRIDENT;So;0;ON;;;;;N;;;;;
+1F752;ALCHEMICAL SYMBOL FOR STARRED TRIDENT;So;0;ON;;;;;N;;;;;
+1F753;ALCHEMICAL SYMBOL FOR LODESTONE;So;0;ON;;;;;N;;;;;
+1F754;ALCHEMICAL SYMBOL FOR SOAP;So;0;ON;;;;;N;;;;;
+1F755;ALCHEMICAL SYMBOL FOR URINE;So;0;ON;;;;;N;;;;;
+1F756;ALCHEMICAL SYMBOL FOR HORSE DUNG;So;0;ON;;;;;N;;;;;
+1F757;ALCHEMICAL SYMBOL FOR ASHES;So;0;ON;;;;;N;;;;;
+1F758;ALCHEMICAL SYMBOL FOR POT ASHES;So;0;ON;;;;;N;;;;;
+1F759;ALCHEMICAL SYMBOL FOR BRICK;So;0;ON;;;;;N;;;;;
+1F75A;ALCHEMICAL SYMBOL FOR POWDERED BRICK;So;0;ON;;;;;N;;;;;
+1F75B;ALCHEMICAL SYMBOL FOR AMALGAM;So;0;ON;;;;;N;;;;;
+1F75C;ALCHEMICAL SYMBOL FOR STRATUM SUPER STRATUM;So;0;ON;;;;;N;;;;;
+1F75D;ALCHEMICAL SYMBOL FOR STRATUM SUPER STRATUM-2;So;0;ON;;;;;N;;;;;
+1F75E;ALCHEMICAL SYMBOL FOR SUBLIMATION;So;0;ON;;;;;N;;;;;
+1F75F;ALCHEMICAL SYMBOL FOR PRECIPITATE;So;0;ON;;;;;N;;;;;
+1F760;ALCHEMICAL SYMBOL FOR DISTILL;So;0;ON;;;;;N;;;;;
+1F761;ALCHEMICAL SYMBOL FOR DISSOLVE;So;0;ON;;;;;N;;;;;
+1F762;ALCHEMICAL SYMBOL FOR DISSOLVE-2;So;0;ON;;;;;N;;;;;
+1F763;ALCHEMICAL SYMBOL FOR PURIFY;So;0;ON;;;;;N;;;;;
+1F764;ALCHEMICAL SYMBOL FOR PUTREFACTION;So;0;ON;;;;;N;;;;;
+1F765;ALCHEMICAL SYMBOL FOR CRUCIBLE;So;0;ON;;;;;N;;;;;
+1F766;ALCHEMICAL SYMBOL FOR CRUCIBLE-2;So;0;ON;;;;;N;;;;;
+1F767;ALCHEMICAL SYMBOL FOR CRUCIBLE-3;So;0;ON;;;;;N;;;;;
+1F768;ALCHEMICAL SYMBOL FOR CRUCIBLE-4;So;0;ON;;;;;N;;;;;
+1F769;ALCHEMICAL SYMBOL FOR CRUCIBLE-5;So;0;ON;;;;;N;;;;;
+1F76A;ALCHEMICAL SYMBOL FOR ALEMBIC;So;0;ON;;;;;N;;;;;
+1F76B;ALCHEMICAL SYMBOL FOR BATH OF MARY;So;0;ON;;;;;N;;;;;
+1F76C;ALCHEMICAL SYMBOL FOR BATH OF VAPOURS;So;0;ON;;;;;N;;;;;
+1F76D;ALCHEMICAL SYMBOL FOR RETORT;So;0;ON;;;;;N;;;;;
+1F76E;ALCHEMICAL SYMBOL FOR HOUR;So;0;ON;;;;;N;;;;;
+1F76F;ALCHEMICAL SYMBOL FOR NIGHT;So;0;ON;;;;;N;;;;;
+1F770;ALCHEMICAL SYMBOL FOR DAY-NIGHT;So;0;ON;;;;;N;;;;;
+1F771;ALCHEMICAL SYMBOL FOR MONTH;So;0;ON;;;;;N;;;;;
+1F772;ALCHEMICAL SYMBOL FOR HALF DRAM;So;0;ON;;;;;N;;;;;
+1F773;ALCHEMICAL SYMBOL FOR HALF OUNCE;So;0;ON;;;;;N;;;;;
+1F780;BLACK LEFT-POINTING ISOSCELES RIGHT TRIANGLE;So;0;ON;;;;;N;;;;;
+1F781;BLACK UP-POINTING ISOSCELES RIGHT TRIANGLE;So;0;ON;;;;;N;;;;;
+1F782;BLACK RIGHT-POINTING ISOSCELES RIGHT TRIANGLE;So;0;ON;;;;;N;;;;;
+1F783;BLACK DOWN-POINTING ISOSCELES RIGHT TRIANGLE;So;0;ON;;;;;N;;;;;
+1F784;BLACK SLIGHTLY SMALL CIRCLE;So;0;ON;;;;;N;;;;;
+1F785;MEDIUM BOLD WHITE CIRCLE;So;0;ON;;;;;N;;;;;
+1F786;BOLD WHITE CIRCLE;So;0;ON;;;;;N;;;;;
+1F787;HEAVY WHITE CIRCLE;So;0;ON;;;;;N;;;;;
+1F788;VERY HEAVY WHITE CIRCLE;So;0;ON;;;;;N;;;;;
+1F789;EXTREMELY HEAVY WHITE CIRCLE;So;0;ON;;;;;N;;;;;
+1F78A;WHITE CIRCLE CONTAINING BLACK SMALL CIRCLE;So;0;ON;;;;;N;;;;;
+1F78B;ROUND TARGET;So;0;ON;;;;;N;;;;;
+1F78C;BLACK TINY SQUARE;So;0;ON;;;;;N;;;;;
+1F78D;BLACK SLIGHTLY SMALL SQUARE;So;0;ON;;;;;N;;;;;
+1F78E;LIGHT WHITE SQUARE;So;0;ON;;;;;N;;;;;
+1F78F;MEDIUM WHITE SQUARE;So;0;ON;;;;;N;;;;;
+1F790;BOLD WHITE SQUARE;So;0;ON;;;;;N;;;;;
+1F791;HEAVY WHITE SQUARE;So;0;ON;;;;;N;;;;;
+1F792;VERY HEAVY WHITE SQUARE;So;0;ON;;;;;N;;;;;
+1F793;EXTREMELY HEAVY WHITE SQUARE;So;0;ON;;;;;N;;;;;
+1F794;WHITE SQUARE CONTAINING BLACK VERY SMALL SQUARE;So;0;ON;;;;;N;;;;;
+1F795;WHITE SQUARE CONTAINING BLACK MEDIUM SQUARE;So;0;ON;;;;;N;;;;;
+1F796;SQUARE TARGET;So;0;ON;;;;;N;;;;;
+1F797;BLACK TINY DIAMOND;So;0;ON;;;;;N;;;;;
+1F798;BLACK VERY SMALL DIAMOND;So;0;ON;;;;;N;;;;;
+1F799;BLACK MEDIUM SMALL DIAMOND;So;0;ON;;;;;N;;;;;
+1F79A;WHITE DIAMOND CONTAINING BLACK VERY SMALL DIAMOND;So;0;ON;;;;;N;;;;;
+1F79B;WHITE DIAMOND CONTAINING BLACK MEDIUM DIAMOND;So;0;ON;;;;;N;;;;;
+1F79C;DIAMOND TARGET;So;0;ON;;;;;N;;;;;
+1F79D;BLACK TINY LOZENGE;So;0;ON;;;;;N;;;;;
+1F79E;BLACK VERY SMALL LOZENGE;So;0;ON;;;;;N;;;;;
+1F79F;BLACK MEDIUM SMALL LOZENGE;So;0;ON;;;;;N;;;;;
+1F7A0;WHITE LOZENGE CONTAINING BLACK SMALL LOZENGE;So;0;ON;;;;;N;;;;;
+1F7A1;THIN GREEK CROSS;So;0;ON;;;;;N;;;;;
+1F7A2;LIGHT GREEK CROSS;So;0;ON;;;;;N;;;;;
+1F7A3;MEDIUM GREEK CROSS;So;0;ON;;;;;N;;;;;
+1F7A4;BOLD GREEK CROSS;So;0;ON;;;;;N;;;;;
+1F7A5;VERY BOLD GREEK CROSS;So;0;ON;;;;;N;;;;;
+1F7A6;VERY HEAVY GREEK CROSS;So;0;ON;;;;;N;;;;;
+1F7A7;EXTREMELY HEAVY GREEK CROSS;So;0;ON;;;;;N;;;;;
+1F7A8;THIN SALTIRE;So;0;ON;;;;;N;;;;;
+1F7A9;LIGHT SALTIRE;So;0;ON;;;;;N;;;;;
+1F7AA;MEDIUM SALTIRE;So;0;ON;;;;;N;;;;;
+1F7AB;BOLD SALTIRE;So;0;ON;;;;;N;;;;;
+1F7AC;HEAVY SALTIRE;So;0;ON;;;;;N;;;;;
+1F7AD;VERY HEAVY SALTIRE;So;0;ON;;;;;N;;;;;
+1F7AE;EXTREMELY HEAVY SALTIRE;So;0;ON;;;;;N;;;;;
+1F7AF;LIGHT FIVE SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7B0;MEDIUM FIVE SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7B1;BOLD FIVE SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7B2;HEAVY FIVE SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7B3;VERY HEAVY FIVE SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7B4;EXTREMELY HEAVY FIVE SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7B5;LIGHT SIX SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7B6;MEDIUM SIX SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7B7;BOLD SIX SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7B8;HEAVY SIX SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7B9;VERY HEAVY SIX SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7BA;EXTREMELY HEAVY SIX SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7BB;LIGHT EIGHT SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7BC;MEDIUM EIGHT SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7BD;BOLD EIGHT SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7BE;HEAVY EIGHT SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7BF;VERY HEAVY EIGHT SPOKED ASTERISK;So;0;ON;;;;;N;;;;;
+1F7C0;LIGHT THREE POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+1F7C1;MEDIUM THREE POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+1F7C2;THREE POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+1F7C3;MEDIUM THREE POINTED PINWHEEL STAR;So;0;ON;;;;;N;;;;;
+1F7C4;LIGHT FOUR POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+1F7C5;MEDIUM FOUR POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+1F7C6;FOUR POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+1F7C7;MEDIUM FOUR POINTED PINWHEEL STAR;So;0;ON;;;;;N;;;;;
+1F7C8;REVERSE LIGHT FOUR POINTED PINWHEEL STAR;So;0;ON;;;;;N;;;;;
+1F7C9;LIGHT FIVE POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+1F7CA;HEAVY FIVE POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+1F7CB;MEDIUM SIX POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+1F7CC;HEAVY SIX POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+1F7CD;SIX POINTED PINWHEEL STAR;So;0;ON;;;;;N;;;;;
+1F7CE;MEDIUM EIGHT POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+1F7CF;HEAVY EIGHT POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+1F7D0;VERY HEAVY EIGHT POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+1F7D1;HEAVY EIGHT POINTED PINWHEEL STAR;So;0;ON;;;;;N;;;;;
+1F7D2;LIGHT TWELVE POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+1F7D3;HEAVY TWELVE POINTED BLACK STAR;So;0;ON;;;;;N;;;;;
+1F7D4;HEAVY TWELVE POINTED PINWHEEL STAR;So;0;ON;;;;;N;;;;;
+1F800;LEFTWARDS ARROW WITH SMALL TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F801;UPWARDS ARROW WITH SMALL TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F802;RIGHTWARDS ARROW WITH SMALL TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F803;DOWNWARDS ARROW WITH SMALL TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F804;LEFTWARDS ARROW WITH MEDIUM TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F805;UPWARDS ARROW WITH MEDIUM TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F806;RIGHTWARDS ARROW WITH MEDIUM TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F807;DOWNWARDS ARROW WITH MEDIUM TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F808;LEFTWARDS ARROW WITH LARGE TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F809;UPWARDS ARROW WITH LARGE TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F80A;RIGHTWARDS ARROW WITH LARGE TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F80B;DOWNWARDS ARROW WITH LARGE TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F810;LEFTWARDS ARROW WITH SMALL EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F811;UPWARDS ARROW WITH SMALL EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F812;RIGHTWARDS ARROW WITH SMALL EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F813;DOWNWARDS ARROW WITH SMALL EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F814;LEFTWARDS ARROW WITH EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F815;UPWARDS ARROW WITH EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F816;RIGHTWARDS ARROW WITH EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F817;DOWNWARDS ARROW WITH EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F818;HEAVY LEFTWARDS ARROW WITH EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F819;HEAVY UPWARDS ARROW WITH EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F81A;HEAVY RIGHTWARDS ARROW WITH EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F81B;HEAVY DOWNWARDS ARROW WITH EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F81C;HEAVY LEFTWARDS ARROW WITH LARGE EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F81D;HEAVY UPWARDS ARROW WITH LARGE EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F81E;HEAVY RIGHTWARDS ARROW WITH LARGE EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F81F;HEAVY DOWNWARDS ARROW WITH LARGE EQUILATERAL ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F820;LEFTWARDS TRIANGLE-HEADED ARROW WITH NARROW SHAFT;So;0;ON;;;;;N;;;;;
+1F821;UPWARDS TRIANGLE-HEADED ARROW WITH NARROW SHAFT;So;0;ON;;;;;N;;;;;
+1F822;RIGHTWARDS TRIANGLE-HEADED ARROW WITH NARROW SHAFT;So;0;ON;;;;;N;;;;;
+1F823;DOWNWARDS TRIANGLE-HEADED ARROW WITH NARROW SHAFT;So;0;ON;;;;;N;;;;;
+1F824;LEFTWARDS TRIANGLE-HEADED ARROW WITH MEDIUM SHAFT;So;0;ON;;;;;N;;;;;
+1F825;UPWARDS TRIANGLE-HEADED ARROW WITH MEDIUM SHAFT;So;0;ON;;;;;N;;;;;
+1F826;RIGHTWARDS TRIANGLE-HEADED ARROW WITH MEDIUM SHAFT;So;0;ON;;;;;N;;;;;
+1F827;DOWNWARDS TRIANGLE-HEADED ARROW WITH MEDIUM SHAFT;So;0;ON;;;;;N;;;;;
+1F828;LEFTWARDS TRIANGLE-HEADED ARROW WITH BOLD SHAFT;So;0;ON;;;;;N;;;;;
+1F829;UPWARDS TRIANGLE-HEADED ARROW WITH BOLD SHAFT;So;0;ON;;;;;N;;;;;
+1F82A;RIGHTWARDS TRIANGLE-HEADED ARROW WITH BOLD SHAFT;So;0;ON;;;;;N;;;;;
+1F82B;DOWNWARDS TRIANGLE-HEADED ARROW WITH BOLD SHAFT;So;0;ON;;;;;N;;;;;
+1F82C;LEFTWARDS TRIANGLE-HEADED ARROW WITH HEAVY SHAFT;So;0;ON;;;;;N;;;;;
+1F82D;UPWARDS TRIANGLE-HEADED ARROW WITH HEAVY SHAFT;So;0;ON;;;;;N;;;;;
+1F82E;RIGHTWARDS TRIANGLE-HEADED ARROW WITH HEAVY SHAFT;So;0;ON;;;;;N;;;;;
+1F82F;DOWNWARDS TRIANGLE-HEADED ARROW WITH HEAVY SHAFT;So;0;ON;;;;;N;;;;;
+1F830;LEFTWARDS TRIANGLE-HEADED ARROW WITH VERY HEAVY SHAFT;So;0;ON;;;;;N;;;;;
+1F831;UPWARDS TRIANGLE-HEADED ARROW WITH VERY HEAVY SHAFT;So;0;ON;;;;;N;;;;;
+1F832;RIGHTWARDS TRIANGLE-HEADED ARROW WITH VERY HEAVY SHAFT;So;0;ON;;;;;N;;;;;
+1F833;DOWNWARDS TRIANGLE-HEADED ARROW WITH VERY HEAVY SHAFT;So;0;ON;;;;;N;;;;;
+1F834;LEFTWARDS FINGER-POST ARROW;So;0;ON;;;;;N;;;;;
+1F835;UPWARDS FINGER-POST ARROW;So;0;ON;;;;;N;;;;;
+1F836;RIGHTWARDS FINGER-POST ARROW;So;0;ON;;;;;N;;;;;
+1F837;DOWNWARDS FINGER-POST ARROW;So;0;ON;;;;;N;;;;;
+1F838;LEFTWARDS SQUARED ARROW;So;0;ON;;;;;N;;;;;
+1F839;UPWARDS SQUARED ARROW;So;0;ON;;;;;N;;;;;
+1F83A;RIGHTWARDS SQUARED ARROW;So;0;ON;;;;;N;;;;;
+1F83B;DOWNWARDS SQUARED ARROW;So;0;ON;;;;;N;;;;;
+1F83C;LEFTWARDS COMPRESSED ARROW;So;0;ON;;;;;N;;;;;
+1F83D;UPWARDS COMPRESSED ARROW;So;0;ON;;;;;N;;;;;
+1F83E;RIGHTWARDS COMPRESSED ARROW;So;0;ON;;;;;N;;;;;
+1F83F;DOWNWARDS COMPRESSED ARROW;So;0;ON;;;;;N;;;;;
+1F840;LEFTWARDS HEAVY COMPRESSED ARROW;So;0;ON;;;;;N;;;;;
+1F841;UPWARDS HEAVY COMPRESSED ARROW;So;0;ON;;;;;N;;;;;
+1F842;RIGHTWARDS HEAVY COMPRESSED ARROW;So;0;ON;;;;;N;;;;;
+1F843;DOWNWARDS HEAVY COMPRESSED ARROW;So;0;ON;;;;;N;;;;;
+1F844;LEFTWARDS HEAVY ARROW;So;0;ON;;;;;N;;;;;
+1F845;UPWARDS HEAVY ARROW;So;0;ON;;;;;N;;;;;
+1F846;RIGHTWARDS HEAVY ARROW;So;0;ON;;;;;N;;;;;
+1F847;DOWNWARDS HEAVY ARROW;So;0;ON;;;;;N;;;;;
+1F850;LEFTWARDS SANS-SERIF ARROW;So;0;ON;;;;;N;;;;;
+1F851;UPWARDS SANS-SERIF ARROW;So;0;ON;;;;;N;;;;;
+1F852;RIGHTWARDS SANS-SERIF ARROW;So;0;ON;;;;;N;;;;;
+1F853;DOWNWARDS SANS-SERIF ARROW;So;0;ON;;;;;N;;;;;
+1F854;NORTH WEST SANS-SERIF ARROW;So;0;ON;;;;;N;;;;;
+1F855;NORTH EAST SANS-SERIF ARROW;So;0;ON;;;;;N;;;;;
+1F856;SOUTH EAST SANS-SERIF ARROW;So;0;ON;;;;;N;;;;;
+1F857;SOUTH WEST SANS-SERIF ARROW;So;0;ON;;;;;N;;;;;
+1F858;LEFT RIGHT SANS-SERIF ARROW;So;0;ON;;;;;N;;;;;
+1F859;UP DOWN SANS-SERIF ARROW;So;0;ON;;;;;N;;;;;
+1F860;WIDE-HEADED LEFTWARDS LIGHT BARB ARROW;So;0;ON;;;;;N;;;;;
+1F861;WIDE-HEADED UPWARDS LIGHT BARB ARROW;So;0;ON;;;;;N;;;;;
+1F862;WIDE-HEADED RIGHTWARDS LIGHT BARB ARROW;So;0;ON;;;;;N;;;;;
+1F863;WIDE-HEADED DOWNWARDS LIGHT BARB ARROW;So;0;ON;;;;;N;;;;;
+1F864;WIDE-HEADED NORTH WEST LIGHT BARB ARROW;So;0;ON;;;;;N;;;;;
+1F865;WIDE-HEADED NORTH EAST LIGHT BARB ARROW;So;0;ON;;;;;N;;;;;
+1F866;WIDE-HEADED SOUTH EAST LIGHT BARB ARROW;So;0;ON;;;;;N;;;;;
+1F867;WIDE-HEADED SOUTH WEST LIGHT BARB ARROW;So;0;ON;;;;;N;;;;;
+1F868;WIDE-HEADED LEFTWARDS BARB ARROW;So;0;ON;;;;;N;;;;;
+1F869;WIDE-HEADED UPWARDS BARB ARROW;So;0;ON;;;;;N;;;;;
+1F86A;WIDE-HEADED RIGHTWARDS BARB ARROW;So;0;ON;;;;;N;;;;;
+1F86B;WIDE-HEADED DOWNWARDS BARB ARROW;So;0;ON;;;;;N;;;;;
+1F86C;WIDE-HEADED NORTH WEST BARB ARROW;So;0;ON;;;;;N;;;;;
+1F86D;WIDE-HEADED NORTH EAST BARB ARROW;So;0;ON;;;;;N;;;;;
+1F86E;WIDE-HEADED SOUTH EAST BARB ARROW;So;0;ON;;;;;N;;;;;
+1F86F;WIDE-HEADED SOUTH WEST BARB ARROW;So;0;ON;;;;;N;;;;;
+1F870;WIDE-HEADED LEFTWARDS MEDIUM BARB ARROW;So;0;ON;;;;;N;;;;;
+1F871;WIDE-HEADED UPWARDS MEDIUM BARB ARROW;So;0;ON;;;;;N;;;;;
+1F872;WIDE-HEADED RIGHTWARDS MEDIUM BARB ARROW;So;0;ON;;;;;N;;;;;
+1F873;WIDE-HEADED DOWNWARDS MEDIUM BARB ARROW;So;0;ON;;;;;N;;;;;
+1F874;WIDE-HEADED NORTH WEST MEDIUM BARB ARROW;So;0;ON;;;;;N;;;;;
+1F875;WIDE-HEADED NORTH EAST MEDIUM BARB ARROW;So;0;ON;;;;;N;;;;;
+1F876;WIDE-HEADED SOUTH EAST MEDIUM BARB ARROW;So;0;ON;;;;;N;;;;;
+1F877;WIDE-HEADED SOUTH WEST MEDIUM BARB ARROW;So;0;ON;;;;;N;;;;;
+1F878;WIDE-HEADED LEFTWARDS HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F879;WIDE-HEADED UPWARDS HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F87A;WIDE-HEADED RIGHTWARDS HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F87B;WIDE-HEADED DOWNWARDS HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F87C;WIDE-HEADED NORTH WEST HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F87D;WIDE-HEADED NORTH EAST HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F87E;WIDE-HEADED SOUTH EAST HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F87F;WIDE-HEADED SOUTH WEST HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F880;WIDE-HEADED LEFTWARDS VERY HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F881;WIDE-HEADED UPWARDS VERY HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F882;WIDE-HEADED RIGHTWARDS VERY HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F883;WIDE-HEADED DOWNWARDS VERY HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F884;WIDE-HEADED NORTH WEST VERY HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F885;WIDE-HEADED NORTH EAST VERY HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F886;WIDE-HEADED SOUTH EAST VERY HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F887;WIDE-HEADED SOUTH WEST VERY HEAVY BARB ARROW;So;0;ON;;;;;N;;;;;
+1F890;LEFTWARDS TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F891;UPWARDS TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F892;RIGHTWARDS TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F893;DOWNWARDS TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F894;LEFTWARDS WHITE ARROW WITHIN TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F895;UPWARDS WHITE ARROW WITHIN TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F896;RIGHTWARDS WHITE ARROW WITHIN TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F897;DOWNWARDS WHITE ARROW WITHIN TRIANGLE ARROWHEAD;So;0;ON;;;;;N;;;;;
+1F898;LEFTWARDS ARROW WITH NOTCHED TAIL;So;0;ON;;;;;N;;;;;
+1F899;UPWARDS ARROW WITH NOTCHED TAIL;So;0;ON;;;;;N;;;;;
+1F89A;RIGHTWARDS ARROW WITH NOTCHED TAIL;So;0;ON;;;;;N;;;;;
+1F89B;DOWNWARDS ARROW WITH NOTCHED TAIL;So;0;ON;;;;;N;;;;;
+1F89C;HEAVY ARROW SHAFT WIDTH ONE;So;0;ON;;;;;N;;;;;
+1F89D;HEAVY ARROW SHAFT WIDTH TWO THIRDS;So;0;ON;;;;;N;;;;;
+1F89E;HEAVY ARROW SHAFT WIDTH ONE HALF;So;0;ON;;;;;N;;;;;
+1F89F;HEAVY ARROW SHAFT WIDTH ONE THIRD;So;0;ON;;;;;N;;;;;
+1F8A0;LEFTWARDS BOTTOM-SHADED WHITE ARROW;So;0;ON;;;;;N;;;;;
+1F8A1;RIGHTWARDS BOTTOM SHADED WHITE ARROW;So;0;ON;;;;;N;;;;;
+1F8A2;LEFTWARDS TOP SHADED WHITE ARROW;So;0;ON;;;;;N;;;;;
+1F8A3;RIGHTWARDS TOP SHADED WHITE ARROW;So;0;ON;;;;;N;;;;;
+1F8A4;LEFTWARDS LEFT-SHADED WHITE ARROW;So;0;ON;;;;;N;;;;;
+1F8A5;RIGHTWARDS RIGHT-SHADED WHITE ARROW;So;0;ON;;;;;N;;;;;
+1F8A6;LEFTWARDS RIGHT-SHADED WHITE ARROW;So;0;ON;;;;;N;;;;;
+1F8A7;RIGHTWARDS LEFT-SHADED WHITE ARROW;So;0;ON;;;;;N;;;;;
+1F8A8;LEFTWARDS BACK-TILTED SHADOWED WHITE ARROW;So;0;ON;;;;;N;;;;;
+1F8A9;RIGHTWARDS BACK-TILTED SHADOWED WHITE ARROW;So;0;ON;;;;;N;;;;;
+1F8AA;LEFTWARDS FRONT-TILTED SHADOWED WHITE ARROW;So;0;ON;;;;;N;;;;;
+1F8AB;RIGHTWARDS FRONT-TILTED SHADOWED WHITE ARROW;So;0;ON;;;;;N;;;;;
+1F8AC;WHITE ARROW SHAFT WIDTH ONE;So;0;ON;;;;;N;;;;;
+1F8AD;WHITE ARROW SHAFT WIDTH TWO THIRDS;So;0;ON;;;;;N;;;;;
+1F900;CIRCLED CROSS FORMEE WITH FOUR DOTS;So;0;ON;;;;;N;;;;;
+1F901;CIRCLED CROSS FORMEE WITH TWO DOTS;So;0;ON;;;;;N;;;;;
+1F902;CIRCLED CROSS FORMEE;So;0;ON;;;;;N;;;;;
+1F903;LEFT HALF CIRCLE WITH FOUR DOTS;So;0;ON;;;;;N;;;;;
+1F904;LEFT HALF CIRCLE WITH THREE DOTS;So;0;ON;;;;;N;;;;;
+1F905;LEFT HALF CIRCLE WITH TWO DOTS;So;0;ON;;;;;N;;;;;
+1F906;LEFT HALF CIRCLE WITH DOT;So;0;ON;;;;;N;;;;;
+1F907;LEFT HALF CIRCLE;So;0;ON;;;;;N;;;;;
+1F908;DOWNWARD FACING HOOK;So;0;ON;;;;;N;;;;;
+1F909;DOWNWARD FACING NOTCHED HOOK;So;0;ON;;;;;N;;;;;
+1F90A;DOWNWARD FACING HOOK WITH DOT;So;0;ON;;;;;N;;;;;
+1F90B;DOWNWARD FACING NOTCHED HOOK WITH DOT;So;0;ON;;;;;N;;;;;
+1F910;ZIPPER-MOUTH FACE;So;0;ON;;;;;N;;;;;
+1F911;MONEY-MOUTH FACE;So;0;ON;;;;;N;;;;;
+1F912;FACE WITH THERMOMETER;So;0;ON;;;;;N;;;;;
+1F913;NERD FACE;So;0;ON;;;;;N;;;;;
+1F914;THINKING FACE;So;0;ON;;;;;N;;;;;
+1F915;FACE WITH HEAD-BANDAGE;So;0;ON;;;;;N;;;;;
+1F916;ROBOT FACE;So;0;ON;;;;;N;;;;;
+1F917;HUGGING FACE;So;0;ON;;;;;N;;;;;
+1F918;SIGN OF THE HORNS;So;0;ON;;;;;N;;;;;
+1F919;CALL ME HAND;So;0;ON;;;;;N;;;;;
+1F91A;RAISED BACK OF HAND;So;0;ON;;;;;N;;;;;
+1F91B;LEFT-FACING FIST;So;0;ON;;;;;N;;;;;
+1F91C;RIGHT-FACING FIST;So;0;ON;;;;;N;;;;;
+1F91D;HANDSHAKE;So;0;ON;;;;;N;;;;;
+1F91E;HAND WITH INDEX AND MIDDLE FINGERS CROSSED;So;0;ON;;;;;N;;;;;
+1F91F;I LOVE YOU HAND SIGN;So;0;ON;;;;;N;;;;;
+1F920;FACE WITH COWBOY HAT;So;0;ON;;;;;N;;;;;
+1F921;CLOWN FACE;So;0;ON;;;;;N;;;;;
+1F922;NAUSEATED FACE;So;0;ON;;;;;N;;;;;
+1F923;ROLLING ON THE FLOOR LAUGHING;So;0;ON;;;;;N;;;;;
+1F924;DROOLING FACE;So;0;ON;;;;;N;;;;;
+1F925;LYING FACE;So;0;ON;;;;;N;;;;;
+1F926;FACE PALM;So;0;ON;;;;;N;;;;;
+1F927;SNEEZING FACE;So;0;ON;;;;;N;;;;;
+1F928;FACE WITH ONE EYEBROW RAISED;So;0;ON;;;;;N;;;;;
+1F929;GRINNING FACE WITH STAR EYES;So;0;ON;;;;;N;;;;;
+1F92A;GRINNING FACE WITH ONE LARGE AND ONE SMALL EYE;So;0;ON;;;;;N;;;;;
+1F92B;FACE WITH FINGER COVERING CLOSED LIPS;So;0;ON;;;;;N;;;;;
+1F92C;SERIOUS FACE WITH SYMBOLS COVERING MOUTH;So;0;ON;;;;;N;;;;;
+1F92D;SMILING FACE WITH SMILING EYES AND HAND COVERING MOUTH;So;0;ON;;;;;N;;;;;
+1F92E;FACE WITH OPEN MOUTH VOMITING;So;0;ON;;;;;N;;;;;
+1F92F;SHOCKED FACE WITH EXPLODING HEAD;So;0;ON;;;;;N;;;;;
+1F930;PREGNANT WOMAN;So;0;ON;;;;;N;;;;;
+1F931;BREAST-FEEDING;So;0;ON;;;;;N;;;;;
+1F932;PALMS UP TOGETHER;So;0;ON;;;;;N;;;;;
+1F933;SELFIE;So;0;ON;;;;;N;;;;;
+1F934;PRINCE;So;0;ON;;;;;N;;;;;
+1F935;MAN IN TUXEDO;So;0;ON;;;;;N;;;;;
+1F936;MOTHER CHRISTMAS;So;0;ON;;;;;N;;;;;
+1F937;SHRUG;So;0;ON;;;;;N;;;;;
+1F938;PERSON DOING CARTWHEEL;So;0;ON;;;;;N;;;;;
+1F939;JUGGLING;So;0;ON;;;;;N;;;;;
+1F93A;FENCER;So;0;ON;;;;;N;;;;;
+1F93B;MODERN PENTATHLON;So;0;ON;;;;;N;;;;;
+1F93C;WRESTLERS;So;0;ON;;;;;N;;;;;
+1F93D;WATER POLO;So;0;ON;;;;;N;;;;;
+1F93E;HANDBALL;So;0;ON;;;;;N;;;;;
+1F940;WILTED FLOWER;So;0;ON;;;;;N;;;;;
+1F941;DRUM WITH DRUMSTICKS;So;0;ON;;;;;N;;;;;
+1F942;CLINKING GLASSES;So;0;ON;;;;;N;;;;;
+1F943;TUMBLER GLASS;So;0;ON;;;;;N;;;;;
+1F944;SPOON;So;0;ON;;;;;N;;;;;
+1F945;GOAL NET;So;0;ON;;;;;N;;;;;
+1F946;RIFLE;So;0;ON;;;;;N;;;;;
+1F947;FIRST PLACE MEDAL;So;0;ON;;;;;N;;;;;
+1F948;SECOND PLACE MEDAL;So;0;ON;;;;;N;;;;;
+1F949;THIRD PLACE MEDAL;So;0;ON;;;;;N;;;;;
+1F94A;BOXING GLOVE;So;0;ON;;;;;N;;;;;
+1F94B;MARTIAL ARTS UNIFORM;So;0;ON;;;;;N;;;;;
+1F94C;CURLING STONE;So;0;ON;;;;;N;;;;;
+1F950;CROISSANT;So;0;ON;;;;;N;;;;;
+1F951;AVOCADO;So;0;ON;;;;;N;;;;;
+1F952;CUCUMBER;So;0;ON;;;;;N;;;;;
+1F953;BACON;So;0;ON;;;;;N;;;;;
+1F954;POTATO;So;0;ON;;;;;N;;;;;
+1F955;CARROT;So;0;ON;;;;;N;;;;;
+1F956;BAGUETTE BREAD;So;0;ON;;;;;N;;;;;
+1F957;GREEN SALAD;So;0;ON;;;;;N;;;;;
+1F958;SHALLOW PAN OF FOOD;So;0;ON;;;;;N;;;;;
+1F959;STUFFED FLATBREAD;So;0;ON;;;;;N;;;;;
+1F95A;EGG;So;0;ON;;;;;N;;;;;
+1F95B;GLASS OF MILK;So;0;ON;;;;;N;;;;;
+1F95C;PEANUTS;So;0;ON;;;;;N;;;;;
+1F95D;KIWIFRUIT;So;0;ON;;;;;N;;;;;
+1F95E;PANCAKES;So;0;ON;;;;;N;;;;;
+1F95F;DUMPLING;So;0;ON;;;;;N;;;;;
+1F960;FORTUNE COOKIE;So;0;ON;;;;;N;;;;;
+1F961;TAKEOUT BOX;So;0;ON;;;;;N;;;;;
+1F962;CHOPSTICKS;So;0;ON;;;;;N;;;;;
+1F963;BOWL WITH SPOON;So;0;ON;;;;;N;;;;;
+1F964;CUP WITH STRAW;So;0;ON;;;;;N;;;;;
+1F965;COCONUT;So;0;ON;;;;;N;;;;;
+1F966;BROCCOLI;So;0;ON;;;;;N;;;;;
+1F967;PIE;So;0;ON;;;;;N;;;;;
+1F968;PRETZEL;So;0;ON;;;;;N;;;;;
+1F969;CUT OF MEAT;So;0;ON;;;;;N;;;;;
+1F96A;SANDWICH;So;0;ON;;;;;N;;;;;
+1F96B;CANNED FOOD;So;0;ON;;;;;N;;;;;
+1F980;CRAB;So;0;ON;;;;;N;;;;;
+1F981;LION FACE;So;0;ON;;;;;N;;;;;
+1F982;SCORPION;So;0;ON;;;;;N;;;;;
+1F983;TURKEY;So;0;ON;;;;;N;;;;;
+1F984;UNICORN FACE;So;0;ON;;;;;N;;;;;
+1F985;EAGLE;So;0;ON;;;;;N;;;;;
+1F986;DUCK;So;0;ON;;;;;N;;;;;
+1F987;BAT;So;0;ON;;;;;N;;;;;
+1F988;SHARK;So;0;ON;;;;;N;;;;;
+1F989;OWL;So;0;ON;;;;;N;;;;;
+1F98A;FOX FACE;So;0;ON;;;;;N;;;;;
+1F98B;BUTTERFLY;So;0;ON;;;;;N;;;;;
+1F98C;DEER;So;0;ON;;;;;N;;;;;
+1F98D;GORILLA;So;0;ON;;;;;N;;;;;
+1F98E;LIZARD;So;0;ON;;;;;N;;;;;
+1F98F;RHINOCEROS;So;0;ON;;;;;N;;;;;
+1F990;SHRIMP;So;0;ON;;;;;N;;;;;
+1F991;SQUID;So;0;ON;;;;;N;;;;;
+1F992;GIRAFFE FACE;So;0;ON;;;;;N;;;;;
+1F993;ZEBRA FACE;So;0;ON;;;;;N;;;;;
+1F994;HEDGEHOG;So;0;ON;;;;;N;;;;;
+1F995;SAUROPOD;So;0;ON;;;;;N;;;;;
+1F996;T-REX;So;0;ON;;;;;N;;;;;
+1F997;CRICKET;So;0;ON;;;;;N;;;;;
+1F9C0;CHEESE WEDGE;So;0;ON;;;;;N;;;;;
+1F9D0;FACE WITH MONOCLE;So;0;ON;;;;;N;;;;;
+1F9D1;ADULT;So;0;ON;;;;;N;;;;;
+1F9D2;CHILD;So;0;ON;;;;;N;;;;;
+1F9D3;OLDER ADULT;So;0;ON;;;;;N;;;;;
+1F9D4;BEARDED PERSON;So;0;ON;;;;;N;;;;;
+1F9D5;PERSON WITH HEADSCARF;So;0;ON;;;;;N;;;;;
+1F9D6;PERSON IN STEAMY ROOM;So;0;ON;;;;;N;;;;;
+1F9D7;PERSON CLIMBING;So;0;ON;;;;;N;;;;;
+1F9D8;PERSON IN LOTUS POSITION;So;0;ON;;;;;N;;;;;
+1F9D9;MAGE;So;0;ON;;;;;N;;;;;
+1F9DA;FAIRY;So;0;ON;;;;;N;;;;;
+1F9DB;VAMPIRE;So;0;ON;;;;;N;;;;;
+1F9DC;MERPERSON;So;0;ON;;;;;N;;;;;
+1F9DD;ELF;So;0;ON;;;;;N;;;;;
+1F9DE;GENIE;So;0;ON;;;;;N;;;;;
+1F9DF;ZOMBIE;So;0;ON;;;;;N;;;;;
+1F9E0;BRAIN;So;0;ON;;;;;N;;;;;
+1F9E1;ORANGE HEART;So;0;ON;;;;;N;;;;;
+1F9E2;BILLED CAP;So;0;ON;;;;;N;;;;;
+1F9E3;SCARF;So;0;ON;;;;;N;;;;;
+1F9E4;GLOVES;So;0;ON;;;;;N;;;;;
+1F9E5;COAT;So;0;ON;;;;;N;;;;;
+1F9E6;SOCKS;So;0;ON;;;;;N;;;;;
+20000;<CJK Ideograph Extension B, First>;Lo;0;L;;;;;N;;;;;
+2A6D6;<CJK Ideograph Extension B, Last>;Lo;0;L;;;;;N;;;;;
+2A700;<CJK Ideograph Extension C, First>;Lo;0;L;;;;;N;;;;;
+2B734;<CJK Ideograph Extension C, Last>;Lo;0;L;;;;;N;;;;;
+2B740;<CJK Ideograph Extension D, First>;Lo;0;L;;;;;N;;;;;
+2B81D;<CJK Ideograph Extension D, Last>;Lo;0;L;;;;;N;;;;;
+2B820;<CJK Ideograph Extension E, First>;Lo;0;L;;;;;N;;;;;
+2CEA1;<CJK Ideograph Extension E, Last>;Lo;0;L;;;;;N;;;;;
+2CEB0;<CJK Ideograph Extension F, First>;Lo;0;L;;;;;N;;;;;
+2EBE0;<CJK Ideograph Extension F, Last>;Lo;0;L;;;;;N;;;;;
+2F800;CJK COMPATIBILITY IDEOGRAPH-2F800;Lo;0;L;4E3D;;;;N;;;;;
+2F801;CJK COMPATIBILITY IDEOGRAPH-2F801;Lo;0;L;4E38;;;;N;;;;;
+2F802;CJK COMPATIBILITY IDEOGRAPH-2F802;Lo;0;L;4E41;;;;N;;;;;
+2F803;CJK COMPATIBILITY IDEOGRAPH-2F803;Lo;0;L;20122;;;;N;;;;;
+2F804;CJK COMPATIBILITY IDEOGRAPH-2F804;Lo;0;L;4F60;;;;N;;;;;
+2F805;CJK COMPATIBILITY IDEOGRAPH-2F805;Lo;0;L;4FAE;;;;N;;;;;
+2F806;CJK COMPATIBILITY IDEOGRAPH-2F806;Lo;0;L;4FBB;;;;N;;;;;
+2F807;CJK COMPATIBILITY IDEOGRAPH-2F807;Lo;0;L;5002;;;;N;;;;;
+2F808;CJK COMPATIBILITY IDEOGRAPH-2F808;Lo;0;L;507A;;;;N;;;;;
+2F809;CJK COMPATIBILITY IDEOGRAPH-2F809;Lo;0;L;5099;;;;N;;;;;
+2F80A;CJK COMPATIBILITY IDEOGRAPH-2F80A;Lo;0;L;50E7;;;;N;;;;;
+2F80B;CJK COMPATIBILITY IDEOGRAPH-2F80B;Lo;0;L;50CF;;;;N;;;;;
+2F80C;CJK COMPATIBILITY IDEOGRAPH-2F80C;Lo;0;L;349E;;;;N;;;;;
+2F80D;CJK COMPATIBILITY IDEOGRAPH-2F80D;Lo;0;L;2063A;;;;N;;;;;
+2F80E;CJK COMPATIBILITY IDEOGRAPH-2F80E;Lo;0;L;514D;;;;N;;;;;
+2F80F;CJK COMPATIBILITY IDEOGRAPH-2F80F;Lo;0;L;5154;;;;N;;;;;
+2F810;CJK COMPATIBILITY IDEOGRAPH-2F810;Lo;0;L;5164;;;;N;;;;;
+2F811;CJK COMPATIBILITY IDEOGRAPH-2F811;Lo;0;L;5177;;;;N;;;;;
+2F812;CJK COMPATIBILITY IDEOGRAPH-2F812;Lo;0;L;2051C;;;;N;;;;;
+2F813;CJK COMPATIBILITY IDEOGRAPH-2F813;Lo;0;L;34B9;;;;N;;;;;
+2F814;CJK COMPATIBILITY IDEOGRAPH-2F814;Lo;0;L;5167;;;;N;;;;;
+2F815;CJK COMPATIBILITY IDEOGRAPH-2F815;Lo;0;L;518D;;;;N;;;;;
+2F816;CJK COMPATIBILITY IDEOGRAPH-2F816;Lo;0;L;2054B;;;;N;;;;;
+2F817;CJK COMPATIBILITY IDEOGRAPH-2F817;Lo;0;L;5197;;;;N;;;;;
+2F818;CJK COMPATIBILITY IDEOGRAPH-2F818;Lo;0;L;51A4;;;;N;;;;;
+2F819;CJK COMPATIBILITY IDEOGRAPH-2F819;Lo;0;L;4ECC;;;;N;;;;;
+2F81A;CJK COMPATIBILITY IDEOGRAPH-2F81A;Lo;0;L;51AC;;;;N;;;;;
+2F81B;CJK COMPATIBILITY IDEOGRAPH-2F81B;Lo;0;L;51B5;;;;N;;;;;
+2F81C;CJK COMPATIBILITY IDEOGRAPH-2F81C;Lo;0;L;291DF;;;;N;;;;;
+2F81D;CJK COMPATIBILITY IDEOGRAPH-2F81D;Lo;0;L;51F5;;;;N;;;;;
+2F81E;CJK COMPATIBILITY IDEOGRAPH-2F81E;Lo;0;L;5203;;;;N;;;;;
+2F81F;CJK COMPATIBILITY IDEOGRAPH-2F81F;Lo;0;L;34DF;;;;N;;;;;
+2F820;CJK COMPATIBILITY IDEOGRAPH-2F820;Lo;0;L;523B;;;;N;;;;;
+2F821;CJK COMPATIBILITY IDEOGRAPH-2F821;Lo;0;L;5246;;;;N;;;;;
+2F822;CJK COMPATIBILITY IDEOGRAPH-2F822;Lo;0;L;5272;;;;N;;;;;
+2F823;CJK COMPATIBILITY IDEOGRAPH-2F823;Lo;0;L;5277;;;;N;;;;;
+2F824;CJK COMPATIBILITY IDEOGRAPH-2F824;Lo;0;L;3515;;;;N;;;;;
+2F825;CJK COMPATIBILITY IDEOGRAPH-2F825;Lo;0;L;52C7;;;;N;;;;;
+2F826;CJK COMPATIBILITY IDEOGRAPH-2F826;Lo;0;L;52C9;;;;N;;;;;
+2F827;CJK COMPATIBILITY IDEOGRAPH-2F827;Lo;0;L;52E4;;;;N;;;;;
+2F828;CJK COMPATIBILITY IDEOGRAPH-2F828;Lo;0;L;52FA;;;;N;;;;;
+2F829;CJK COMPATIBILITY IDEOGRAPH-2F829;Lo;0;L;5305;;;;N;;;;;
+2F82A;CJK COMPATIBILITY IDEOGRAPH-2F82A;Lo;0;L;5306;;;;N;;;;;
+2F82B;CJK COMPATIBILITY IDEOGRAPH-2F82B;Lo;0;L;5317;;;;N;;;;;
+2F82C;CJK COMPATIBILITY IDEOGRAPH-2F82C;Lo;0;L;5349;;;;N;;;;;
+2F82D;CJK COMPATIBILITY IDEOGRAPH-2F82D;Lo;0;L;5351;;;;N;;;;;
+2F82E;CJK COMPATIBILITY IDEOGRAPH-2F82E;Lo;0;L;535A;;;;N;;;;;
+2F82F;CJK COMPATIBILITY IDEOGRAPH-2F82F;Lo;0;L;5373;;;;N;;;;;
+2F830;CJK COMPATIBILITY IDEOGRAPH-2F830;Lo;0;L;537D;;;;N;;;;;
+2F831;CJK COMPATIBILITY IDEOGRAPH-2F831;Lo;0;L;537F;;;;N;;;;;
+2F832;CJK COMPATIBILITY IDEOGRAPH-2F832;Lo;0;L;537F;;;;N;;;;;
+2F833;CJK COMPATIBILITY IDEOGRAPH-2F833;Lo;0;L;537F;;;;N;;;;;
+2F834;CJK COMPATIBILITY IDEOGRAPH-2F834;Lo;0;L;20A2C;;;;N;;;;;
+2F835;CJK COMPATIBILITY IDEOGRAPH-2F835;Lo;0;L;7070;;;;N;;;;;
+2F836;CJK COMPATIBILITY IDEOGRAPH-2F836;Lo;0;L;53CA;;;;N;;;;;
+2F837;CJK COMPATIBILITY IDEOGRAPH-2F837;Lo;0;L;53DF;;;;N;;;;;
+2F838;CJK COMPATIBILITY IDEOGRAPH-2F838;Lo;0;L;20B63;;;;N;;;;;
+2F839;CJK COMPATIBILITY IDEOGRAPH-2F839;Lo;0;L;53EB;;;;N;;;;;
+2F83A;CJK COMPATIBILITY IDEOGRAPH-2F83A;Lo;0;L;53F1;;;;N;;;;;
+2F83B;CJK COMPATIBILITY IDEOGRAPH-2F83B;Lo;0;L;5406;;;;N;;;;;
+2F83C;CJK COMPATIBILITY IDEOGRAPH-2F83C;Lo;0;L;549E;;;;N;;;;;
+2F83D;CJK COMPATIBILITY IDEOGRAPH-2F83D;Lo;0;L;5438;;;;N;;;;;
+2F83E;CJK COMPATIBILITY IDEOGRAPH-2F83E;Lo;0;L;5448;;;;N;;;;;
+2F83F;CJK COMPATIBILITY IDEOGRAPH-2F83F;Lo;0;L;5468;;;;N;;;;;
+2F840;CJK COMPATIBILITY IDEOGRAPH-2F840;Lo;0;L;54A2;;;;N;;;;;
+2F841;CJK COMPATIBILITY IDEOGRAPH-2F841;Lo;0;L;54F6;;;;N;;;;;
+2F842;CJK COMPATIBILITY IDEOGRAPH-2F842;Lo;0;L;5510;;;;N;;;;;
+2F843;CJK COMPATIBILITY IDEOGRAPH-2F843;Lo;0;L;5553;;;;N;;;;;
+2F844;CJK COMPATIBILITY IDEOGRAPH-2F844;Lo;0;L;5563;;;;N;;;;;
+2F845;CJK COMPATIBILITY IDEOGRAPH-2F845;Lo;0;L;5584;;;;N;;;;;
+2F846;CJK COMPATIBILITY IDEOGRAPH-2F846;Lo;0;L;5584;;;;N;;;;;
+2F847;CJK COMPATIBILITY IDEOGRAPH-2F847;Lo;0;L;5599;;;;N;;;;;
+2F848;CJK COMPATIBILITY IDEOGRAPH-2F848;Lo;0;L;55AB;;;;N;;;;;
+2F849;CJK COMPATIBILITY IDEOGRAPH-2F849;Lo;0;L;55B3;;;;N;;;;;
+2F84A;CJK COMPATIBILITY IDEOGRAPH-2F84A;Lo;0;L;55C2;;;;N;;;;;
+2F84B;CJK COMPATIBILITY IDEOGRAPH-2F84B;Lo;0;L;5716;;;;N;;;;;
+2F84C;CJK COMPATIBILITY IDEOGRAPH-2F84C;Lo;0;L;5606;;;;N;;;;;
+2F84D;CJK COMPATIBILITY IDEOGRAPH-2F84D;Lo;0;L;5717;;;;N;;;;;
+2F84E;CJK COMPATIBILITY IDEOGRAPH-2F84E;Lo;0;L;5651;;;;N;;;;;
+2F84F;CJK COMPATIBILITY IDEOGRAPH-2F84F;Lo;0;L;5674;;;;N;;;;;
+2F850;CJK COMPATIBILITY IDEOGRAPH-2F850;Lo;0;L;5207;;;;N;;;;;
+2F851;CJK COMPATIBILITY IDEOGRAPH-2F851;Lo;0;L;58EE;;;;N;;;;;
+2F852;CJK COMPATIBILITY IDEOGRAPH-2F852;Lo;0;L;57CE;;;;N;;;;;
+2F853;CJK COMPATIBILITY IDEOGRAPH-2F853;Lo;0;L;57F4;;;;N;;;;;
+2F854;CJK COMPATIBILITY IDEOGRAPH-2F854;Lo;0;L;580D;;;;N;;;;;
+2F855;CJK COMPATIBILITY IDEOGRAPH-2F855;Lo;0;L;578B;;;;N;;;;;
+2F856;CJK COMPATIBILITY IDEOGRAPH-2F856;Lo;0;L;5832;;;;N;;;;;
+2F857;CJK COMPATIBILITY IDEOGRAPH-2F857;Lo;0;L;5831;;;;N;;;;;
+2F858;CJK COMPATIBILITY IDEOGRAPH-2F858;Lo;0;L;58AC;;;;N;;;;;
+2F859;CJK COMPATIBILITY IDEOGRAPH-2F859;Lo;0;L;214E4;;;;N;;;;;
+2F85A;CJK COMPATIBILITY IDEOGRAPH-2F85A;Lo;0;L;58F2;;;;N;;;;;
+2F85B;CJK COMPATIBILITY IDEOGRAPH-2F85B;Lo;0;L;58F7;;;;N;;;;;
+2F85C;CJK COMPATIBILITY IDEOGRAPH-2F85C;Lo;0;L;5906;;;;N;;;;;
+2F85D;CJK COMPATIBILITY IDEOGRAPH-2F85D;Lo;0;L;591A;;;;N;;;;;
+2F85E;CJK COMPATIBILITY IDEOGRAPH-2F85E;Lo;0;L;5922;;;;N;;;;;
+2F85F;CJK COMPATIBILITY IDEOGRAPH-2F85F;Lo;0;L;5962;;;;N;;;;;
+2F860;CJK COMPATIBILITY IDEOGRAPH-2F860;Lo;0;L;216A8;;;;N;;;;;
+2F861;CJK COMPATIBILITY IDEOGRAPH-2F861;Lo;0;L;216EA;;;;N;;;;;
+2F862;CJK COMPATIBILITY IDEOGRAPH-2F862;Lo;0;L;59EC;;;;N;;;;;
+2F863;CJK COMPATIBILITY IDEOGRAPH-2F863;Lo;0;L;5A1B;;;;N;;;;;
+2F864;CJK COMPATIBILITY IDEOGRAPH-2F864;Lo;0;L;5A27;;;;N;;;;;
+2F865;CJK COMPATIBILITY IDEOGRAPH-2F865;Lo;0;L;59D8;;;;N;;;;;
+2F866;CJK COMPATIBILITY IDEOGRAPH-2F866;Lo;0;L;5A66;;;;N;;;;;
+2F867;CJK COMPATIBILITY IDEOGRAPH-2F867;Lo;0;L;36EE;;;;N;;;;;
+2F868;CJK COMPATIBILITY IDEOGRAPH-2F868;Lo;0;L;36FC;;;;N;;;;;
+2F869;CJK COMPATIBILITY IDEOGRAPH-2F869;Lo;0;L;5B08;;;;N;;;;;
+2F86A;CJK COMPATIBILITY IDEOGRAPH-2F86A;Lo;0;L;5B3E;;;;N;;;;;
+2F86B;CJK COMPATIBILITY IDEOGRAPH-2F86B;Lo;0;L;5B3E;;;;N;;;;;
+2F86C;CJK COMPATIBILITY IDEOGRAPH-2F86C;Lo;0;L;219C8;;;;N;;;;;
+2F86D;CJK COMPATIBILITY IDEOGRAPH-2F86D;Lo;0;L;5BC3;;;;N;;;;;
+2F86E;CJK COMPATIBILITY IDEOGRAPH-2F86E;Lo;0;L;5BD8;;;;N;;;;;
+2F86F;CJK COMPATIBILITY IDEOGRAPH-2F86F;Lo;0;L;5BE7;;;;N;;;;;
+2F870;CJK COMPATIBILITY IDEOGRAPH-2F870;Lo;0;L;5BF3;;;;N;;;;;
+2F871;CJK COMPATIBILITY IDEOGRAPH-2F871;Lo;0;L;21B18;;;;N;;;;;
+2F872;CJK COMPATIBILITY IDEOGRAPH-2F872;Lo;0;L;5BFF;;;;N;;;;;
+2F873;CJK COMPATIBILITY IDEOGRAPH-2F873;Lo;0;L;5C06;;;;N;;;;;
+2F874;CJK COMPATIBILITY IDEOGRAPH-2F874;Lo;0;L;5F53;;;;N;;;;;
+2F875;CJK COMPATIBILITY IDEOGRAPH-2F875;Lo;0;L;5C22;;;;N;;;;;
+2F876;CJK COMPATIBILITY IDEOGRAPH-2F876;Lo;0;L;3781;;;;N;;;;;
+2F877;CJK COMPATIBILITY IDEOGRAPH-2F877;Lo;0;L;5C60;;;;N;;;;;
+2F878;CJK COMPATIBILITY IDEOGRAPH-2F878;Lo;0;L;5C6E;;;;N;;;;;
+2F879;CJK COMPATIBILITY IDEOGRAPH-2F879;Lo;0;L;5CC0;;;;N;;;;;
+2F87A;CJK COMPATIBILITY IDEOGRAPH-2F87A;Lo;0;L;5C8D;;;;N;;;;;
+2F87B;CJK COMPATIBILITY IDEOGRAPH-2F87B;Lo;0;L;21DE4;;;;N;;;;;
+2F87C;CJK COMPATIBILITY IDEOGRAPH-2F87C;Lo;0;L;5D43;;;;N;;;;;
+2F87D;CJK COMPATIBILITY IDEOGRAPH-2F87D;Lo;0;L;21DE6;;;;N;;;;;
+2F87E;CJK COMPATIBILITY IDEOGRAPH-2F87E;Lo;0;L;5D6E;;;;N;;;;;
+2F87F;CJK COMPATIBILITY IDEOGRAPH-2F87F;Lo;0;L;5D6B;;;;N;;;;;
+2F880;CJK COMPATIBILITY IDEOGRAPH-2F880;Lo;0;L;5D7C;;;;N;;;;;
+2F881;CJK COMPATIBILITY IDEOGRAPH-2F881;Lo;0;L;5DE1;;;;N;;;;;
+2F882;CJK COMPATIBILITY IDEOGRAPH-2F882;Lo;0;L;5DE2;;;;N;;;;;
+2F883;CJK COMPATIBILITY IDEOGRAPH-2F883;Lo;0;L;382F;;;;N;;;;;
+2F884;CJK COMPATIBILITY IDEOGRAPH-2F884;Lo;0;L;5DFD;;;;N;;;;;
+2F885;CJK COMPATIBILITY IDEOGRAPH-2F885;Lo;0;L;5E28;;;;N;;;;;
+2F886;CJK COMPATIBILITY IDEOGRAPH-2F886;Lo;0;L;5E3D;;;;N;;;;;
+2F887;CJK COMPATIBILITY IDEOGRAPH-2F887;Lo;0;L;5E69;;;;N;;;;;
+2F888;CJK COMPATIBILITY IDEOGRAPH-2F888;Lo;0;L;3862;;;;N;;;;;
+2F889;CJK COMPATIBILITY IDEOGRAPH-2F889;Lo;0;L;22183;;;;N;;;;;
+2F88A;CJK COMPATIBILITY IDEOGRAPH-2F88A;Lo;0;L;387C;;;;N;;;;;
+2F88B;CJK COMPATIBILITY IDEOGRAPH-2F88B;Lo;0;L;5EB0;;;;N;;;;;
+2F88C;CJK COMPATIBILITY IDEOGRAPH-2F88C;Lo;0;L;5EB3;;;;N;;;;;
+2F88D;CJK COMPATIBILITY IDEOGRAPH-2F88D;Lo;0;L;5EB6;;;;N;;;;;
+2F88E;CJK COMPATIBILITY IDEOGRAPH-2F88E;Lo;0;L;5ECA;;;;N;;;;;
+2F88F;CJK COMPATIBILITY IDEOGRAPH-2F88F;Lo;0;L;2A392;;;;N;;;;;
+2F890;CJK COMPATIBILITY IDEOGRAPH-2F890;Lo;0;L;5EFE;;;9;N;;;;;
+2F891;CJK COMPATIBILITY IDEOGRAPH-2F891;Lo;0;L;22331;;;;N;;;;;
+2F892;CJK COMPATIBILITY IDEOGRAPH-2F892;Lo;0;L;22331;;;;N;;;;;
+2F893;CJK COMPATIBILITY IDEOGRAPH-2F893;Lo;0;L;8201;;;;N;;;;;
+2F894;CJK COMPATIBILITY IDEOGRAPH-2F894;Lo;0;L;5F22;;;;N;;;;;
+2F895;CJK COMPATIBILITY IDEOGRAPH-2F895;Lo;0;L;5F22;;;;N;;;;;
+2F896;CJK COMPATIBILITY IDEOGRAPH-2F896;Lo;0;L;38C7;;;;N;;;;;
+2F897;CJK COMPATIBILITY IDEOGRAPH-2F897;Lo;0;L;232B8;;;;N;;;;;
+2F898;CJK COMPATIBILITY IDEOGRAPH-2F898;Lo;0;L;261DA;;;;N;;;;;
+2F899;CJK COMPATIBILITY IDEOGRAPH-2F899;Lo;0;L;5F62;;;;N;;;;;
+2F89A;CJK COMPATIBILITY IDEOGRAPH-2F89A;Lo;0;L;5F6B;;;;N;;;;;
+2F89B;CJK COMPATIBILITY IDEOGRAPH-2F89B;Lo;0;L;38E3;;;;N;;;;;
+2F89C;CJK COMPATIBILITY IDEOGRAPH-2F89C;Lo;0;L;5F9A;;;;N;;;;;
+2F89D;CJK COMPATIBILITY IDEOGRAPH-2F89D;Lo;0;L;5FCD;;;;N;;;;;
+2F89E;CJK COMPATIBILITY IDEOGRAPH-2F89E;Lo;0;L;5FD7;;;;N;;;;;
+2F89F;CJK COMPATIBILITY IDEOGRAPH-2F89F;Lo;0;L;5FF9;;;;N;;;;;
+2F8A0;CJK COMPATIBILITY IDEOGRAPH-2F8A0;Lo;0;L;6081;;;;N;;;;;
+2F8A1;CJK COMPATIBILITY IDEOGRAPH-2F8A1;Lo;0;L;393A;;;;N;;;;;
+2F8A2;CJK COMPATIBILITY IDEOGRAPH-2F8A2;Lo;0;L;391C;;;;N;;;;;
+2F8A3;CJK COMPATIBILITY IDEOGRAPH-2F8A3;Lo;0;L;6094;;;;N;;;;;
+2F8A4;CJK COMPATIBILITY IDEOGRAPH-2F8A4;Lo;0;L;226D4;;;;N;;;;;
+2F8A5;CJK COMPATIBILITY IDEOGRAPH-2F8A5;Lo;0;L;60C7;;;;N;;;;;
+2F8A6;CJK COMPATIBILITY IDEOGRAPH-2F8A6;Lo;0;L;6148;;;;N;;;;;
+2F8A7;CJK COMPATIBILITY IDEOGRAPH-2F8A7;Lo;0;L;614C;;;;N;;;;;
+2F8A8;CJK COMPATIBILITY IDEOGRAPH-2F8A8;Lo;0;L;614E;;;;N;;;;;
+2F8A9;CJK COMPATIBILITY IDEOGRAPH-2F8A9;Lo;0;L;614C;;;;N;;;;;
+2F8AA;CJK COMPATIBILITY IDEOGRAPH-2F8AA;Lo;0;L;617A;;;;N;;;;;
+2F8AB;CJK COMPATIBILITY IDEOGRAPH-2F8AB;Lo;0;L;618E;;;;N;;;;;
+2F8AC;CJK COMPATIBILITY IDEOGRAPH-2F8AC;Lo;0;L;61B2;;;;N;;;;;
+2F8AD;CJK COMPATIBILITY IDEOGRAPH-2F8AD;Lo;0;L;61A4;;;;N;;;;;
+2F8AE;CJK COMPATIBILITY IDEOGRAPH-2F8AE;Lo;0;L;61AF;;;;N;;;;;
+2F8AF;CJK COMPATIBILITY IDEOGRAPH-2F8AF;Lo;0;L;61DE;;;;N;;;;;
+2F8B0;CJK COMPATIBILITY IDEOGRAPH-2F8B0;Lo;0;L;61F2;;;;N;;;;;
+2F8B1;CJK COMPATIBILITY IDEOGRAPH-2F8B1;Lo;0;L;61F6;;;;N;;;;;
+2F8B2;CJK COMPATIBILITY IDEOGRAPH-2F8B2;Lo;0;L;6210;;;;N;;;;;
+2F8B3;CJK COMPATIBILITY IDEOGRAPH-2F8B3;Lo;0;L;621B;;;;N;;;;;
+2F8B4;CJK COMPATIBILITY IDEOGRAPH-2F8B4;Lo;0;L;625D;;;;N;;;;;
+2F8B5;CJK COMPATIBILITY IDEOGRAPH-2F8B5;Lo;0;L;62B1;;;;N;;;;;
+2F8B6;CJK COMPATIBILITY IDEOGRAPH-2F8B6;Lo;0;L;62D4;;;;N;;;;;
+2F8B7;CJK COMPATIBILITY IDEOGRAPH-2F8B7;Lo;0;L;6350;;;;N;;;;;
+2F8B8;CJK COMPATIBILITY IDEOGRAPH-2F8B8;Lo;0;L;22B0C;;;;N;;;;;
+2F8B9;CJK COMPATIBILITY IDEOGRAPH-2F8B9;Lo;0;L;633D;;;;N;;;;;
+2F8BA;CJK COMPATIBILITY IDEOGRAPH-2F8BA;Lo;0;L;62FC;;;;N;;;;;
+2F8BB;CJK COMPATIBILITY IDEOGRAPH-2F8BB;Lo;0;L;6368;;;;N;;;;;
+2F8BC;CJK COMPATIBILITY IDEOGRAPH-2F8BC;Lo;0;L;6383;;;;N;;;;;
+2F8BD;CJK COMPATIBILITY IDEOGRAPH-2F8BD;Lo;0;L;63E4;;;;N;;;;;
+2F8BE;CJK COMPATIBILITY IDEOGRAPH-2F8BE;Lo;0;L;22BF1;;;;N;;;;;
+2F8BF;CJK COMPATIBILITY IDEOGRAPH-2F8BF;Lo;0;L;6422;;;;N;;;;;
+2F8C0;CJK COMPATIBILITY IDEOGRAPH-2F8C0;Lo;0;L;63C5;;;;N;;;;;
+2F8C1;CJK COMPATIBILITY IDEOGRAPH-2F8C1;Lo;0;L;63A9;;;;N;;;;;
+2F8C2;CJK COMPATIBILITY IDEOGRAPH-2F8C2;Lo;0;L;3A2E;;;;N;;;;;
+2F8C3;CJK COMPATIBILITY IDEOGRAPH-2F8C3;Lo;0;L;6469;;;;N;;;;;
+2F8C4;CJK COMPATIBILITY IDEOGRAPH-2F8C4;Lo;0;L;647E;;;;N;;;;;
+2F8C5;CJK COMPATIBILITY IDEOGRAPH-2F8C5;Lo;0;L;649D;;;;N;;;;;
+2F8C6;CJK COMPATIBILITY IDEOGRAPH-2F8C6;Lo;0;L;6477;;;;N;;;;;
+2F8C7;CJK COMPATIBILITY IDEOGRAPH-2F8C7;Lo;0;L;3A6C;;;;N;;;;;
+2F8C8;CJK COMPATIBILITY IDEOGRAPH-2F8C8;Lo;0;L;654F;;;;N;;;;;
+2F8C9;CJK COMPATIBILITY IDEOGRAPH-2F8C9;Lo;0;L;656C;;;;N;;;;;
+2F8CA;CJK COMPATIBILITY IDEOGRAPH-2F8CA;Lo;0;L;2300A;;;;N;;;;;
+2F8CB;CJK COMPATIBILITY IDEOGRAPH-2F8CB;Lo;0;L;65E3;;;;N;;;;;
+2F8CC;CJK COMPATIBILITY IDEOGRAPH-2F8CC;Lo;0;L;66F8;;;;N;;;;;
+2F8CD;CJK COMPATIBILITY IDEOGRAPH-2F8CD;Lo;0;L;6649;;;;N;;;;;
+2F8CE;CJK COMPATIBILITY IDEOGRAPH-2F8CE;Lo;0;L;3B19;;;;N;;;;;
+2F8CF;CJK COMPATIBILITY IDEOGRAPH-2F8CF;Lo;0;L;6691;;;;N;;;;;
+2F8D0;CJK COMPATIBILITY IDEOGRAPH-2F8D0;Lo;0;L;3B08;;;;N;;;;;
+2F8D1;CJK COMPATIBILITY IDEOGRAPH-2F8D1;Lo;0;L;3AE4;;;;N;;;;;
+2F8D2;CJK COMPATIBILITY IDEOGRAPH-2F8D2;Lo;0;L;5192;;;;N;;;;;
+2F8D3;CJK COMPATIBILITY IDEOGRAPH-2F8D3;Lo;0;L;5195;;;;N;;;;;
+2F8D4;CJK COMPATIBILITY IDEOGRAPH-2F8D4;Lo;0;L;6700;;;;N;;;;;
+2F8D5;CJK COMPATIBILITY IDEOGRAPH-2F8D5;Lo;0;L;669C;;;;N;;;;;
+2F8D6;CJK COMPATIBILITY IDEOGRAPH-2F8D6;Lo;0;L;80AD;;;;N;;;;;
+2F8D7;CJK COMPATIBILITY IDEOGRAPH-2F8D7;Lo;0;L;43D9;;;;N;;;;;
+2F8D8;CJK COMPATIBILITY IDEOGRAPH-2F8D8;Lo;0;L;6717;;;;N;;;;;
+2F8D9;CJK COMPATIBILITY IDEOGRAPH-2F8D9;Lo;0;L;671B;;;;N;;;;;
+2F8DA;CJK COMPATIBILITY IDEOGRAPH-2F8DA;Lo;0;L;6721;;;;N;;;;;
+2F8DB;CJK COMPATIBILITY IDEOGRAPH-2F8DB;Lo;0;L;675E;;;;N;;;;;
+2F8DC;CJK COMPATIBILITY IDEOGRAPH-2F8DC;Lo;0;L;6753;;;;N;;;;;
+2F8DD;CJK COMPATIBILITY IDEOGRAPH-2F8DD;Lo;0;L;233C3;;;;N;;;;;
+2F8DE;CJK COMPATIBILITY IDEOGRAPH-2F8DE;Lo;0;L;3B49;;;;N;;;;;
+2F8DF;CJK COMPATIBILITY IDEOGRAPH-2F8DF;Lo;0;L;67FA;;;;N;;;;;
+2F8E0;CJK COMPATIBILITY IDEOGRAPH-2F8E0;Lo;0;L;6785;;;;N;;;;;
+2F8E1;CJK COMPATIBILITY IDEOGRAPH-2F8E1;Lo;0;L;6852;;;;N;;;;;
+2F8E2;CJK COMPATIBILITY IDEOGRAPH-2F8E2;Lo;0;L;6885;;;;N;;;;;
+2F8E3;CJK COMPATIBILITY IDEOGRAPH-2F8E3;Lo;0;L;2346D;;;;N;;;;;
+2F8E4;CJK COMPATIBILITY IDEOGRAPH-2F8E4;Lo;0;L;688E;;;;N;;;;;
+2F8E5;CJK COMPATIBILITY IDEOGRAPH-2F8E5;Lo;0;L;681F;;;;N;;;;;
+2F8E6;CJK COMPATIBILITY IDEOGRAPH-2F8E6;Lo;0;L;6914;;;;N;;;;;
+2F8E7;CJK COMPATIBILITY IDEOGRAPH-2F8E7;Lo;0;L;3B9D;;;;N;;;;;
+2F8E8;CJK COMPATIBILITY IDEOGRAPH-2F8E8;Lo;0;L;6942;;;;N;;;;;
+2F8E9;CJK COMPATIBILITY IDEOGRAPH-2F8E9;Lo;0;L;69A3;;;;N;;;;;
+2F8EA;CJK COMPATIBILITY IDEOGRAPH-2F8EA;Lo;0;L;69EA;;;;N;;;;;
+2F8EB;CJK COMPATIBILITY IDEOGRAPH-2F8EB;Lo;0;L;6AA8;;;;N;;;;;
+2F8EC;CJK COMPATIBILITY IDEOGRAPH-2F8EC;Lo;0;L;236A3;;;;N;;;;;
+2F8ED;CJK COMPATIBILITY IDEOGRAPH-2F8ED;Lo;0;L;6ADB;;;;N;;;;;
+2F8EE;CJK COMPATIBILITY IDEOGRAPH-2F8EE;Lo;0;L;3C18;;;;N;;;;;
+2F8EF;CJK COMPATIBILITY IDEOGRAPH-2F8EF;Lo;0;L;6B21;;;;N;;;;;
+2F8F0;CJK COMPATIBILITY IDEOGRAPH-2F8F0;Lo;0;L;238A7;;;;N;;;;;
+2F8F1;CJK COMPATIBILITY IDEOGRAPH-2F8F1;Lo;0;L;6B54;;;;N;;;;;
+2F8F2;CJK COMPATIBILITY IDEOGRAPH-2F8F2;Lo;0;L;3C4E;;;;N;;;;;
+2F8F3;CJK COMPATIBILITY IDEOGRAPH-2F8F3;Lo;0;L;6B72;;;;N;;;;;
+2F8F4;CJK COMPATIBILITY IDEOGRAPH-2F8F4;Lo;0;L;6B9F;;;;N;;;;;
+2F8F5;CJK COMPATIBILITY IDEOGRAPH-2F8F5;Lo;0;L;6BBA;;;;N;;;;;
+2F8F6;CJK COMPATIBILITY IDEOGRAPH-2F8F6;Lo;0;L;6BBB;;;;N;;;;;
+2F8F7;CJK COMPATIBILITY IDEOGRAPH-2F8F7;Lo;0;L;23A8D;;;;N;;;;;
+2F8F8;CJK COMPATIBILITY IDEOGRAPH-2F8F8;Lo;0;L;21D0B;;;;N;;;;;
+2F8F9;CJK COMPATIBILITY IDEOGRAPH-2F8F9;Lo;0;L;23AFA;;;;N;;;;;
+2F8FA;CJK COMPATIBILITY IDEOGRAPH-2F8FA;Lo;0;L;6C4E;;;;N;;;;;
+2F8FB;CJK COMPATIBILITY IDEOGRAPH-2F8FB;Lo;0;L;23CBC;;;;N;;;;;
+2F8FC;CJK COMPATIBILITY IDEOGRAPH-2F8FC;Lo;0;L;6CBF;;;;N;;;;;
+2F8FD;CJK COMPATIBILITY IDEOGRAPH-2F8FD;Lo;0;L;6CCD;;;;N;;;;;
+2F8FE;CJK COMPATIBILITY IDEOGRAPH-2F8FE;Lo;0;L;6C67;;;;N;;;;;
+2F8FF;CJK COMPATIBILITY IDEOGRAPH-2F8FF;Lo;0;L;6D16;;;;N;;;;;
+2F900;CJK COMPATIBILITY IDEOGRAPH-2F900;Lo;0;L;6D3E;;;;N;;;;;
+2F901;CJK COMPATIBILITY IDEOGRAPH-2F901;Lo;0;L;6D77;;;;N;;;;;
+2F902;CJK COMPATIBILITY IDEOGRAPH-2F902;Lo;0;L;6D41;;;;N;;;;;
+2F903;CJK COMPATIBILITY IDEOGRAPH-2F903;Lo;0;L;6D69;;;;N;;;;;
+2F904;CJK COMPATIBILITY IDEOGRAPH-2F904;Lo;0;L;6D78;;;;N;;;;;
+2F905;CJK COMPATIBILITY IDEOGRAPH-2F905;Lo;0;L;6D85;;;;N;;;;;
+2F906;CJK COMPATIBILITY IDEOGRAPH-2F906;Lo;0;L;23D1E;;;;N;;;;;
+2F907;CJK COMPATIBILITY IDEOGRAPH-2F907;Lo;0;L;6D34;;;;N;;;;;
+2F908;CJK COMPATIBILITY IDEOGRAPH-2F908;Lo;0;L;6E2F;;;;N;;;;;
+2F909;CJK COMPATIBILITY IDEOGRAPH-2F909;Lo;0;L;6E6E;;;;N;;;;;
+2F90A;CJK COMPATIBILITY IDEOGRAPH-2F90A;Lo;0;L;3D33;;;;N;;;;;
+2F90B;CJK COMPATIBILITY IDEOGRAPH-2F90B;Lo;0;L;6ECB;;;;N;;;;;
+2F90C;CJK COMPATIBILITY IDEOGRAPH-2F90C;Lo;0;L;6EC7;;;;N;;;;;
+2F90D;CJK COMPATIBILITY IDEOGRAPH-2F90D;Lo;0;L;23ED1;;;;N;;;;;
+2F90E;CJK COMPATIBILITY IDEOGRAPH-2F90E;Lo;0;L;6DF9;;;;N;;;;;
+2F90F;CJK COMPATIBILITY IDEOGRAPH-2F90F;Lo;0;L;6F6E;;;;N;;;;;
+2F910;CJK COMPATIBILITY IDEOGRAPH-2F910;Lo;0;L;23F5E;;;;N;;;;;
+2F911;CJK COMPATIBILITY IDEOGRAPH-2F911;Lo;0;L;23F8E;;;;N;;;;;
+2F912;CJK COMPATIBILITY IDEOGRAPH-2F912;Lo;0;L;6FC6;;;;N;;;;;
+2F913;CJK COMPATIBILITY IDEOGRAPH-2F913;Lo;0;L;7039;;;;N;;;;;
+2F914;CJK COMPATIBILITY IDEOGRAPH-2F914;Lo;0;L;701E;;;;N;;;;;
+2F915;CJK COMPATIBILITY IDEOGRAPH-2F915;Lo;0;L;701B;;;;N;;;;;
+2F916;CJK COMPATIBILITY IDEOGRAPH-2F916;Lo;0;L;3D96;;;;N;;;;;
+2F917;CJK COMPATIBILITY IDEOGRAPH-2F917;Lo;0;L;704A;;;;N;;;;;
+2F918;CJK COMPATIBILITY IDEOGRAPH-2F918;Lo;0;L;707D;;;;N;;;;;
+2F919;CJK COMPATIBILITY IDEOGRAPH-2F919;Lo;0;L;7077;;;;N;;;;;
+2F91A;CJK COMPATIBILITY IDEOGRAPH-2F91A;Lo;0;L;70AD;;;;N;;;;;
+2F91B;CJK COMPATIBILITY IDEOGRAPH-2F91B;Lo;0;L;20525;;;;N;;;;;
+2F91C;CJK COMPATIBILITY IDEOGRAPH-2F91C;Lo;0;L;7145;;;;N;;;;;
+2F91D;CJK COMPATIBILITY IDEOGRAPH-2F91D;Lo;0;L;24263;;;;N;;;;;
+2F91E;CJK COMPATIBILITY IDEOGRAPH-2F91E;Lo;0;L;719C;;;;N;;;;;
+2F91F;CJK COMPATIBILITY IDEOGRAPH-2F91F;Lo;0;L;243AB;;;;N;;;;;
+2F920;CJK COMPATIBILITY IDEOGRAPH-2F920;Lo;0;L;7228;;;;N;;;;;
+2F921;CJK COMPATIBILITY IDEOGRAPH-2F921;Lo;0;L;7235;;;;N;;;;;
+2F922;CJK COMPATIBILITY IDEOGRAPH-2F922;Lo;0;L;7250;;;;N;;;;;
+2F923;CJK COMPATIBILITY IDEOGRAPH-2F923;Lo;0;L;24608;;;;N;;;;;
+2F924;CJK COMPATIBILITY IDEOGRAPH-2F924;Lo;0;L;7280;;;;N;;;;;
+2F925;CJK COMPATIBILITY IDEOGRAPH-2F925;Lo;0;L;7295;;;;N;;;;;
+2F926;CJK COMPATIBILITY IDEOGRAPH-2F926;Lo;0;L;24735;;;;N;;;;;
+2F927;CJK COMPATIBILITY IDEOGRAPH-2F927;Lo;0;L;24814;;;;N;;;;;
+2F928;CJK COMPATIBILITY IDEOGRAPH-2F928;Lo;0;L;737A;;;;N;;;;;
+2F929;CJK COMPATIBILITY IDEOGRAPH-2F929;Lo;0;L;738B;;;;N;;;;;
+2F92A;CJK COMPATIBILITY IDEOGRAPH-2F92A;Lo;0;L;3EAC;;;;N;;;;;
+2F92B;CJK COMPATIBILITY IDEOGRAPH-2F92B;Lo;0;L;73A5;;;;N;;;;;
+2F92C;CJK COMPATIBILITY IDEOGRAPH-2F92C;Lo;0;L;3EB8;;;;N;;;;;
+2F92D;CJK COMPATIBILITY IDEOGRAPH-2F92D;Lo;0;L;3EB8;;;;N;;;;;
+2F92E;CJK COMPATIBILITY IDEOGRAPH-2F92E;Lo;0;L;7447;;;;N;;;;;
+2F92F;CJK COMPATIBILITY IDEOGRAPH-2F92F;Lo;0;L;745C;;;;N;;;;;
+2F930;CJK COMPATIBILITY IDEOGRAPH-2F930;Lo;0;L;7471;;;;N;;;;;
+2F931;CJK COMPATIBILITY IDEOGRAPH-2F931;Lo;0;L;7485;;;;N;;;;;
+2F932;CJK COMPATIBILITY IDEOGRAPH-2F932;Lo;0;L;74CA;;;;N;;;;;
+2F933;CJK COMPATIBILITY IDEOGRAPH-2F933;Lo;0;L;3F1B;;;;N;;;;;
+2F934;CJK COMPATIBILITY IDEOGRAPH-2F934;Lo;0;L;7524;;;;N;;;;;
+2F935;CJK COMPATIBILITY IDEOGRAPH-2F935;Lo;0;L;24C36;;;;N;;;;;
+2F936;CJK COMPATIBILITY IDEOGRAPH-2F936;Lo;0;L;753E;;;;N;;;;;
+2F937;CJK COMPATIBILITY IDEOGRAPH-2F937;Lo;0;L;24C92;;;;N;;;;;
+2F938;CJK COMPATIBILITY IDEOGRAPH-2F938;Lo;0;L;7570;;;;N;;;;;
+2F939;CJK COMPATIBILITY IDEOGRAPH-2F939;Lo;0;L;2219F;;;;N;;;;;
+2F93A;CJK COMPATIBILITY IDEOGRAPH-2F93A;Lo;0;L;7610;;;;N;;;;;
+2F93B;CJK COMPATIBILITY IDEOGRAPH-2F93B;Lo;0;L;24FA1;;;;N;;;;;
+2F93C;CJK COMPATIBILITY IDEOGRAPH-2F93C;Lo;0;L;24FB8;;;;N;;;;;
+2F93D;CJK COMPATIBILITY IDEOGRAPH-2F93D;Lo;0;L;25044;;;;N;;;;;
+2F93E;CJK COMPATIBILITY IDEOGRAPH-2F93E;Lo;0;L;3FFC;;;;N;;;;;
+2F93F;CJK COMPATIBILITY IDEOGRAPH-2F93F;Lo;0;L;4008;;;;N;;;;;
+2F940;CJK COMPATIBILITY IDEOGRAPH-2F940;Lo;0;L;76F4;;;;N;;;;;
+2F941;CJK COMPATIBILITY IDEOGRAPH-2F941;Lo;0;L;250F3;;;;N;;;;;
+2F942;CJK COMPATIBILITY IDEOGRAPH-2F942;Lo;0;L;250F2;;;;N;;;;;
+2F943;CJK COMPATIBILITY IDEOGRAPH-2F943;Lo;0;L;25119;;;;N;;;;;
+2F944;CJK COMPATIBILITY IDEOGRAPH-2F944;Lo;0;L;25133;;;;N;;;;;
+2F945;CJK COMPATIBILITY IDEOGRAPH-2F945;Lo;0;L;771E;;;;N;;;;;
+2F946;CJK COMPATIBILITY IDEOGRAPH-2F946;Lo;0;L;771F;;;;N;;;;;
+2F947;CJK COMPATIBILITY IDEOGRAPH-2F947;Lo;0;L;771F;;;;N;;;;;
+2F948;CJK COMPATIBILITY IDEOGRAPH-2F948;Lo;0;L;774A;;;;N;;;;;
+2F949;CJK COMPATIBILITY IDEOGRAPH-2F949;Lo;0;L;4039;;;;N;;;;;
+2F94A;CJK COMPATIBILITY IDEOGRAPH-2F94A;Lo;0;L;778B;;;;N;;;;;
+2F94B;CJK COMPATIBILITY IDEOGRAPH-2F94B;Lo;0;L;4046;;;;N;;;;;
+2F94C;CJK COMPATIBILITY IDEOGRAPH-2F94C;Lo;0;L;4096;;;;N;;;;;
+2F94D;CJK COMPATIBILITY IDEOGRAPH-2F94D;Lo;0;L;2541D;;;;N;;;;;
+2F94E;CJK COMPATIBILITY IDEOGRAPH-2F94E;Lo;0;L;784E;;;;N;;;;;
+2F94F;CJK COMPATIBILITY IDEOGRAPH-2F94F;Lo;0;L;788C;;;;N;;;;;
+2F950;CJK COMPATIBILITY IDEOGRAPH-2F950;Lo;0;L;78CC;;;;N;;;;;
+2F951;CJK COMPATIBILITY IDEOGRAPH-2F951;Lo;0;L;40E3;;;;N;;;;;
+2F952;CJK COMPATIBILITY IDEOGRAPH-2F952;Lo;0;L;25626;;;;N;;;;;
+2F953;CJK COMPATIBILITY IDEOGRAPH-2F953;Lo;0;L;7956;;;;N;;;;;
+2F954;CJK COMPATIBILITY IDEOGRAPH-2F954;Lo;0;L;2569A;;;;N;;;;;
+2F955;CJK COMPATIBILITY IDEOGRAPH-2F955;Lo;0;L;256C5;;;;N;;;;;
+2F956;CJK COMPATIBILITY IDEOGRAPH-2F956;Lo;0;L;798F;;;;N;;;;;
+2F957;CJK COMPATIBILITY IDEOGRAPH-2F957;Lo;0;L;79EB;;;;N;;;;;
+2F958;CJK COMPATIBILITY IDEOGRAPH-2F958;Lo;0;L;412F;;;;N;;;;;
+2F959;CJK COMPATIBILITY IDEOGRAPH-2F959;Lo;0;L;7A40;;;;N;;;;;
+2F95A;CJK COMPATIBILITY IDEOGRAPH-2F95A;Lo;0;L;7A4A;;;;N;;;;;
+2F95B;CJK COMPATIBILITY IDEOGRAPH-2F95B;Lo;0;L;7A4F;;;;N;;;;;
+2F95C;CJK COMPATIBILITY IDEOGRAPH-2F95C;Lo;0;L;2597C;;;;N;;;;;
+2F95D;CJK COMPATIBILITY IDEOGRAPH-2F95D;Lo;0;L;25AA7;;;;N;;;;;
+2F95E;CJK COMPATIBILITY IDEOGRAPH-2F95E;Lo;0;L;25AA7;;;;N;;;;;
+2F95F;CJK COMPATIBILITY IDEOGRAPH-2F95F;Lo;0;L;7AEE;;;;N;;;;;
+2F960;CJK COMPATIBILITY IDEOGRAPH-2F960;Lo;0;L;4202;;;;N;;;;;
+2F961;CJK COMPATIBILITY IDEOGRAPH-2F961;Lo;0;L;25BAB;;;;N;;;;;
+2F962;CJK COMPATIBILITY IDEOGRAPH-2F962;Lo;0;L;7BC6;;;;N;;;;;
+2F963;CJK COMPATIBILITY IDEOGRAPH-2F963;Lo;0;L;7BC9;;;;N;;;;;
+2F964;CJK COMPATIBILITY IDEOGRAPH-2F964;Lo;0;L;4227;;;;N;;;;;
+2F965;CJK COMPATIBILITY IDEOGRAPH-2F965;Lo;0;L;25C80;;;;N;;;;;
+2F966;CJK COMPATIBILITY IDEOGRAPH-2F966;Lo;0;L;7CD2;;;;N;;;;;
+2F967;CJK COMPATIBILITY IDEOGRAPH-2F967;Lo;0;L;42A0;;;;N;;;;;
+2F968;CJK COMPATIBILITY IDEOGRAPH-2F968;Lo;0;L;7CE8;;;;N;;;;;
+2F969;CJK COMPATIBILITY IDEOGRAPH-2F969;Lo;0;L;7CE3;;;;N;;;;;
+2F96A;CJK COMPATIBILITY IDEOGRAPH-2F96A;Lo;0;L;7D00;;;;N;;;;;
+2F96B;CJK COMPATIBILITY IDEOGRAPH-2F96B;Lo;0;L;25F86;;;;N;;;;;
+2F96C;CJK COMPATIBILITY IDEOGRAPH-2F96C;Lo;0;L;7D63;;;;N;;;;;
+2F96D;CJK COMPATIBILITY IDEOGRAPH-2F96D;Lo;0;L;4301;;;;N;;;;;
+2F96E;CJK COMPATIBILITY IDEOGRAPH-2F96E;Lo;0;L;7DC7;;;;N;;;;;
+2F96F;CJK COMPATIBILITY IDEOGRAPH-2F96F;Lo;0;L;7E02;;;;N;;;;;
+2F970;CJK COMPATIBILITY IDEOGRAPH-2F970;Lo;0;L;7E45;;;;N;;;;;
+2F971;CJK COMPATIBILITY IDEOGRAPH-2F971;Lo;0;L;4334;;;;N;;;;;
+2F972;CJK COMPATIBILITY IDEOGRAPH-2F972;Lo;0;L;26228;;;;N;;;;;
+2F973;CJK COMPATIBILITY IDEOGRAPH-2F973;Lo;0;L;26247;;;;N;;;;;
+2F974;CJK COMPATIBILITY IDEOGRAPH-2F974;Lo;0;L;4359;;;;N;;;;;
+2F975;CJK COMPATIBILITY IDEOGRAPH-2F975;Lo;0;L;262D9;;;;N;;;;;
+2F976;CJK COMPATIBILITY IDEOGRAPH-2F976;Lo;0;L;7F7A;;;;N;;;;;
+2F977;CJK COMPATIBILITY IDEOGRAPH-2F977;Lo;0;L;2633E;;;;N;;;;;
+2F978;CJK COMPATIBILITY IDEOGRAPH-2F978;Lo;0;L;7F95;;;;N;;;;;
+2F979;CJK COMPATIBILITY IDEOGRAPH-2F979;Lo;0;L;7FFA;;;;N;;;;;
+2F97A;CJK COMPATIBILITY IDEOGRAPH-2F97A;Lo;0;L;8005;;;;N;;;;;
+2F97B;CJK COMPATIBILITY IDEOGRAPH-2F97B;Lo;0;L;264DA;;;;N;;;;;
+2F97C;CJK COMPATIBILITY IDEOGRAPH-2F97C;Lo;0;L;26523;;;;N;;;;;
+2F97D;CJK COMPATIBILITY IDEOGRAPH-2F97D;Lo;0;L;8060;;;;N;;;;;
+2F97E;CJK COMPATIBILITY IDEOGRAPH-2F97E;Lo;0;L;265A8;;;;N;;;;;
+2F97F;CJK COMPATIBILITY IDEOGRAPH-2F97F;Lo;0;L;8070;;;;N;;;;;
+2F980;CJK COMPATIBILITY IDEOGRAPH-2F980;Lo;0;L;2335F;;;;N;;;;;
+2F981;CJK COMPATIBILITY IDEOGRAPH-2F981;Lo;0;L;43D5;;;;N;;;;;
+2F982;CJK COMPATIBILITY IDEOGRAPH-2F982;Lo;0;L;80B2;;;;N;;;;;
+2F983;CJK COMPATIBILITY IDEOGRAPH-2F983;Lo;0;L;8103;;;;N;;;;;
+2F984;CJK COMPATIBILITY IDEOGRAPH-2F984;Lo;0;L;440B;;;;N;;;;;
+2F985;CJK COMPATIBILITY IDEOGRAPH-2F985;Lo;0;L;813E;;;;N;;;;;
+2F986;CJK COMPATIBILITY IDEOGRAPH-2F986;Lo;0;L;5AB5;;;;N;;;;;
+2F987;CJK COMPATIBILITY IDEOGRAPH-2F987;Lo;0;L;267A7;;;;N;;;;;
+2F988;CJK COMPATIBILITY IDEOGRAPH-2F988;Lo;0;L;267B5;;;;N;;;;;
+2F989;CJK COMPATIBILITY IDEOGRAPH-2F989;Lo;0;L;23393;;;;N;;;;;
+2F98A;CJK COMPATIBILITY IDEOGRAPH-2F98A;Lo;0;L;2339C;;;;N;;;;;
+2F98B;CJK COMPATIBILITY IDEOGRAPH-2F98B;Lo;0;L;8201;;;;N;;;;;
+2F98C;CJK COMPATIBILITY IDEOGRAPH-2F98C;Lo;0;L;8204;;;;N;;;;;
+2F98D;CJK COMPATIBILITY IDEOGRAPH-2F98D;Lo;0;L;8F9E;;;;N;;;;;
+2F98E;CJK COMPATIBILITY IDEOGRAPH-2F98E;Lo;0;L;446B;;;;N;;;;;
+2F98F;CJK COMPATIBILITY IDEOGRAPH-2F98F;Lo;0;L;8291;;;;N;;;;;
+2F990;CJK COMPATIBILITY IDEOGRAPH-2F990;Lo;0;L;828B;;;;N;;;;;
+2F991;CJK COMPATIBILITY IDEOGRAPH-2F991;Lo;0;L;829D;;;;N;;;;;
+2F992;CJK COMPATIBILITY IDEOGRAPH-2F992;Lo;0;L;52B3;;;;N;;;;;
+2F993;CJK COMPATIBILITY IDEOGRAPH-2F993;Lo;0;L;82B1;;;;N;;;;;
+2F994;CJK COMPATIBILITY IDEOGRAPH-2F994;Lo;0;L;82B3;;;;N;;;;;
+2F995;CJK COMPATIBILITY IDEOGRAPH-2F995;Lo;0;L;82BD;;;;N;;;;;
+2F996;CJK COMPATIBILITY IDEOGRAPH-2F996;Lo;0;L;82E6;;;;N;;;;;
+2F997;CJK COMPATIBILITY IDEOGRAPH-2F997;Lo;0;L;26B3C;;;;N;;;;;
+2F998;CJK COMPATIBILITY IDEOGRAPH-2F998;Lo;0;L;82E5;;;;N;;;;;
+2F999;CJK COMPATIBILITY IDEOGRAPH-2F999;Lo;0;L;831D;;;;N;;;;;
+2F99A;CJK COMPATIBILITY IDEOGRAPH-2F99A;Lo;0;L;8363;;;;N;;;;;
+2F99B;CJK COMPATIBILITY IDEOGRAPH-2F99B;Lo;0;L;83AD;;;;N;;;;;
+2F99C;CJK COMPATIBILITY IDEOGRAPH-2F99C;Lo;0;L;8323;;;;N;;;;;
+2F99D;CJK COMPATIBILITY IDEOGRAPH-2F99D;Lo;0;L;83BD;;;;N;;;;;
+2F99E;CJK COMPATIBILITY IDEOGRAPH-2F99E;Lo;0;L;83E7;;;;N;;;;;
+2F99F;CJK COMPATIBILITY IDEOGRAPH-2F99F;Lo;0;L;8457;;;;N;;;;;
+2F9A0;CJK COMPATIBILITY IDEOGRAPH-2F9A0;Lo;0;L;8353;;;;N;;;;;
+2F9A1;CJK COMPATIBILITY IDEOGRAPH-2F9A1;Lo;0;L;83CA;;;;N;;;;;
+2F9A2;CJK COMPATIBILITY IDEOGRAPH-2F9A2;Lo;0;L;83CC;;;;N;;;;;
+2F9A3;CJK COMPATIBILITY IDEOGRAPH-2F9A3;Lo;0;L;83DC;;;;N;;;;;
+2F9A4;CJK COMPATIBILITY IDEOGRAPH-2F9A4;Lo;0;L;26C36;;;;N;;;;;
+2F9A5;CJK COMPATIBILITY IDEOGRAPH-2F9A5;Lo;0;L;26D6B;;;;N;;;;;
+2F9A6;CJK COMPATIBILITY IDEOGRAPH-2F9A6;Lo;0;L;26CD5;;;;N;;;;;
+2F9A7;CJK COMPATIBILITY IDEOGRAPH-2F9A7;Lo;0;L;452B;;;;N;;;;;
+2F9A8;CJK COMPATIBILITY IDEOGRAPH-2F9A8;Lo;0;L;84F1;;;;N;;;;;
+2F9A9;CJK COMPATIBILITY IDEOGRAPH-2F9A9;Lo;0;L;84F3;;;;N;;;;;
+2F9AA;CJK COMPATIBILITY IDEOGRAPH-2F9AA;Lo;0;L;8516;;;;N;;;;;
+2F9AB;CJK COMPATIBILITY IDEOGRAPH-2F9AB;Lo;0;L;273CA;;;;N;;;;;
+2F9AC;CJK COMPATIBILITY IDEOGRAPH-2F9AC;Lo;0;L;8564;;;;N;;;;;
+2F9AD;CJK COMPATIBILITY IDEOGRAPH-2F9AD;Lo;0;L;26F2C;;;;N;;;;;
+2F9AE;CJK COMPATIBILITY IDEOGRAPH-2F9AE;Lo;0;L;455D;;;;N;;;;;
+2F9AF;CJK COMPATIBILITY IDEOGRAPH-2F9AF;Lo;0;L;4561;;;;N;;;;;
+2F9B0;CJK COMPATIBILITY IDEOGRAPH-2F9B0;Lo;0;L;26FB1;;;;N;;;;;
+2F9B1;CJK COMPATIBILITY IDEOGRAPH-2F9B1;Lo;0;L;270D2;;;;N;;;;;
+2F9B2;CJK COMPATIBILITY IDEOGRAPH-2F9B2;Lo;0;L;456B;;;;N;;;;;
+2F9B3;CJK COMPATIBILITY IDEOGRAPH-2F9B3;Lo;0;L;8650;;;;N;;;;;
+2F9B4;CJK COMPATIBILITY IDEOGRAPH-2F9B4;Lo;0;L;865C;;;;N;;;;;
+2F9B5;CJK COMPATIBILITY IDEOGRAPH-2F9B5;Lo;0;L;8667;;;;N;;;;;
+2F9B6;CJK COMPATIBILITY IDEOGRAPH-2F9B6;Lo;0;L;8669;;;;N;;;;;
+2F9B7;CJK COMPATIBILITY IDEOGRAPH-2F9B7;Lo;0;L;86A9;;;;N;;;;;
+2F9B8;CJK COMPATIBILITY IDEOGRAPH-2F9B8;Lo;0;L;8688;;;;N;;;;;
+2F9B9;CJK COMPATIBILITY IDEOGRAPH-2F9B9;Lo;0;L;870E;;;;N;;;;;
+2F9BA;CJK COMPATIBILITY IDEOGRAPH-2F9BA;Lo;0;L;86E2;;;;N;;;;;
+2F9BB;CJK COMPATIBILITY IDEOGRAPH-2F9BB;Lo;0;L;8779;;;;N;;;;;
+2F9BC;CJK COMPATIBILITY IDEOGRAPH-2F9BC;Lo;0;L;8728;;;;N;;;;;
+2F9BD;CJK COMPATIBILITY IDEOGRAPH-2F9BD;Lo;0;L;876B;;;;N;;;;;
+2F9BE;CJK COMPATIBILITY IDEOGRAPH-2F9BE;Lo;0;L;8786;;;;N;;;;;
+2F9BF;CJK COMPATIBILITY IDEOGRAPH-2F9BF;Lo;0;L;45D7;;;;N;;;;;
+2F9C0;CJK COMPATIBILITY IDEOGRAPH-2F9C0;Lo;0;L;87E1;;;;N;;;;;
+2F9C1;CJK COMPATIBILITY IDEOGRAPH-2F9C1;Lo;0;L;8801;;;;N;;;;;
+2F9C2;CJK COMPATIBILITY IDEOGRAPH-2F9C2;Lo;0;L;45F9;;;;N;;;;;
+2F9C3;CJK COMPATIBILITY IDEOGRAPH-2F9C3;Lo;0;L;8860;;;;N;;;;;
+2F9C4;CJK COMPATIBILITY IDEOGRAPH-2F9C4;Lo;0;L;8863;;;;N;;;;;
+2F9C5;CJK COMPATIBILITY IDEOGRAPH-2F9C5;Lo;0;L;27667;;;;N;;;;;
+2F9C6;CJK COMPATIBILITY IDEOGRAPH-2F9C6;Lo;0;L;88D7;;;;N;;;;;
+2F9C7;CJK COMPATIBILITY IDEOGRAPH-2F9C7;Lo;0;L;88DE;;;;N;;;;;
+2F9C8;CJK COMPATIBILITY IDEOGRAPH-2F9C8;Lo;0;L;4635;;;;N;;;;;
+2F9C9;CJK COMPATIBILITY IDEOGRAPH-2F9C9;Lo;0;L;88FA;;;;N;;;;;
+2F9CA;CJK COMPATIBILITY IDEOGRAPH-2F9CA;Lo;0;L;34BB;;;;N;;;;;
+2F9CB;CJK COMPATIBILITY IDEOGRAPH-2F9CB;Lo;0;L;278AE;;;;N;;;;;
+2F9CC;CJK COMPATIBILITY IDEOGRAPH-2F9CC;Lo;0;L;27966;;;;N;;;;;
+2F9CD;CJK COMPATIBILITY IDEOGRAPH-2F9CD;Lo;0;L;46BE;;;;N;;;;;
+2F9CE;CJK COMPATIBILITY IDEOGRAPH-2F9CE;Lo;0;L;46C7;;;;N;;;;;
+2F9CF;CJK COMPATIBILITY IDEOGRAPH-2F9CF;Lo;0;L;8AA0;;;;N;;;;;
+2F9D0;CJK COMPATIBILITY IDEOGRAPH-2F9D0;Lo;0;L;8AED;;;;N;;;;;
+2F9D1;CJK COMPATIBILITY IDEOGRAPH-2F9D1;Lo;0;L;8B8A;;;;N;;;;;
+2F9D2;CJK COMPATIBILITY IDEOGRAPH-2F9D2;Lo;0;L;8C55;;;;N;;;;;
+2F9D3;CJK COMPATIBILITY IDEOGRAPH-2F9D3;Lo;0;L;27CA8;;;;N;;;;;
+2F9D4;CJK COMPATIBILITY IDEOGRAPH-2F9D4;Lo;0;L;8CAB;;;;N;;;;;
+2F9D5;CJK COMPATIBILITY IDEOGRAPH-2F9D5;Lo;0;L;8CC1;;;;N;;;;;
+2F9D6;CJK COMPATIBILITY IDEOGRAPH-2F9D6;Lo;0;L;8D1B;;;;N;;;;;
+2F9D7;CJK COMPATIBILITY IDEOGRAPH-2F9D7;Lo;0;L;8D77;;;;N;;;;;
+2F9D8;CJK COMPATIBILITY IDEOGRAPH-2F9D8;Lo;0;L;27F2F;;;;N;;;;;
+2F9D9;CJK COMPATIBILITY IDEOGRAPH-2F9D9;Lo;0;L;20804;;;;N;;;;;
+2F9DA;CJK COMPATIBILITY IDEOGRAPH-2F9DA;Lo;0;L;8DCB;;;;N;;;;;
+2F9DB;CJK COMPATIBILITY IDEOGRAPH-2F9DB;Lo;0;L;8DBC;;;;N;;;;;
+2F9DC;CJK COMPATIBILITY IDEOGRAPH-2F9DC;Lo;0;L;8DF0;;;;N;;;;;
+2F9DD;CJK COMPATIBILITY IDEOGRAPH-2F9DD;Lo;0;L;208DE;;;;N;;;;;
+2F9DE;CJK COMPATIBILITY IDEOGRAPH-2F9DE;Lo;0;L;8ED4;;;;N;;;;;
+2F9DF;CJK COMPATIBILITY IDEOGRAPH-2F9DF;Lo;0;L;8F38;;;;N;;;;;
+2F9E0;CJK COMPATIBILITY IDEOGRAPH-2F9E0;Lo;0;L;285D2;;;;N;;;;;
+2F9E1;CJK COMPATIBILITY IDEOGRAPH-2F9E1;Lo;0;L;285ED;;;;N;;;;;
+2F9E2;CJK COMPATIBILITY IDEOGRAPH-2F9E2;Lo;0;L;9094;;;;N;;;;;
+2F9E3;CJK COMPATIBILITY IDEOGRAPH-2F9E3;Lo;0;L;90F1;;;;N;;;;;
+2F9E4;CJK COMPATIBILITY IDEOGRAPH-2F9E4;Lo;0;L;9111;;;;N;;;;;
+2F9E5;CJK COMPATIBILITY IDEOGRAPH-2F9E5;Lo;0;L;2872E;;;;N;;;;;
+2F9E6;CJK COMPATIBILITY IDEOGRAPH-2F9E6;Lo;0;L;911B;;;;N;;;;;
+2F9E7;CJK COMPATIBILITY IDEOGRAPH-2F9E7;Lo;0;L;9238;;;;N;;;;;
+2F9E8;CJK COMPATIBILITY IDEOGRAPH-2F9E8;Lo;0;L;92D7;;;;N;;;;;
+2F9E9;CJK COMPATIBILITY IDEOGRAPH-2F9E9;Lo;0;L;92D8;;;;N;;;;;
+2F9EA;CJK COMPATIBILITY IDEOGRAPH-2F9EA;Lo;0;L;927C;;;;N;;;;;
+2F9EB;CJK COMPATIBILITY IDEOGRAPH-2F9EB;Lo;0;L;93F9;;;;N;;;;;
+2F9EC;CJK COMPATIBILITY IDEOGRAPH-2F9EC;Lo;0;L;9415;;;;N;;;;;
+2F9ED;CJK COMPATIBILITY IDEOGRAPH-2F9ED;Lo;0;L;28BFA;;;;N;;;;;
+2F9EE;CJK COMPATIBILITY IDEOGRAPH-2F9EE;Lo;0;L;958B;;;;N;;;;;
+2F9EF;CJK COMPATIBILITY IDEOGRAPH-2F9EF;Lo;0;L;4995;;;;N;;;;;
+2F9F0;CJK COMPATIBILITY IDEOGRAPH-2F9F0;Lo;0;L;95B7;;;;N;;;;;
+2F9F1;CJK COMPATIBILITY IDEOGRAPH-2F9F1;Lo;0;L;28D77;;;;N;;;;;
+2F9F2;CJK COMPATIBILITY IDEOGRAPH-2F9F2;Lo;0;L;49E6;;;;N;;;;;
+2F9F3;CJK COMPATIBILITY IDEOGRAPH-2F9F3;Lo;0;L;96C3;;;;N;;;;;
+2F9F4;CJK COMPATIBILITY IDEOGRAPH-2F9F4;Lo;0;L;5DB2;;;;N;;;;;
+2F9F5;CJK COMPATIBILITY IDEOGRAPH-2F9F5;Lo;0;L;9723;;;;N;;;;;
+2F9F6;CJK COMPATIBILITY IDEOGRAPH-2F9F6;Lo;0;L;29145;;;;N;;;;;
+2F9F7;CJK COMPATIBILITY IDEOGRAPH-2F9F7;Lo;0;L;2921A;;;;N;;;;;
+2F9F8;CJK COMPATIBILITY IDEOGRAPH-2F9F8;Lo;0;L;4A6E;;;;N;;;;;
+2F9F9;CJK COMPATIBILITY IDEOGRAPH-2F9F9;Lo;0;L;4A76;;;;N;;;;;
+2F9FA;CJK COMPATIBILITY IDEOGRAPH-2F9FA;Lo;0;L;97E0;;;;N;;;;;
+2F9FB;CJK COMPATIBILITY IDEOGRAPH-2F9FB;Lo;0;L;2940A;;;;N;;;;;
+2F9FC;CJK COMPATIBILITY IDEOGRAPH-2F9FC;Lo;0;L;4AB2;;;;N;;;;;
+2F9FD;CJK COMPATIBILITY IDEOGRAPH-2F9FD;Lo;0;L;29496;;;;N;;;;;
+2F9FE;CJK COMPATIBILITY IDEOGRAPH-2F9FE;Lo;0;L;980B;;;;N;;;;;
+2F9FF;CJK COMPATIBILITY IDEOGRAPH-2F9FF;Lo;0;L;980B;;;;N;;;;;
+2FA00;CJK COMPATIBILITY IDEOGRAPH-2FA00;Lo;0;L;9829;;;;N;;;;;
+2FA01;CJK COMPATIBILITY IDEOGRAPH-2FA01;Lo;0;L;295B6;;;;N;;;;;
+2FA02;CJK COMPATIBILITY IDEOGRAPH-2FA02;Lo;0;L;98E2;;;;N;;;;;
+2FA03;CJK COMPATIBILITY IDEOGRAPH-2FA03;Lo;0;L;4B33;;;;N;;;;;
+2FA04;CJK COMPATIBILITY IDEOGRAPH-2FA04;Lo;0;L;9929;;;;N;;;;;
+2FA05;CJK COMPATIBILITY IDEOGRAPH-2FA05;Lo;0;L;99A7;;;;N;;;;;
+2FA06;CJK COMPATIBILITY IDEOGRAPH-2FA06;Lo;0;L;99C2;;;;N;;;;;
+2FA07;CJK COMPATIBILITY IDEOGRAPH-2FA07;Lo;0;L;99FE;;;;N;;;;;
+2FA08;CJK COMPATIBILITY IDEOGRAPH-2FA08;Lo;0;L;4BCE;;;;N;;;;;
+2FA09;CJK COMPATIBILITY IDEOGRAPH-2FA09;Lo;0;L;29B30;;;;N;;;;;
+2FA0A;CJK COMPATIBILITY IDEOGRAPH-2FA0A;Lo;0;L;9B12;;;;N;;;;;
+2FA0B;CJK COMPATIBILITY IDEOGRAPH-2FA0B;Lo;0;L;9C40;;;;N;;;;;
+2FA0C;CJK COMPATIBILITY IDEOGRAPH-2FA0C;Lo;0;L;9CFD;;;;N;;;;;
+2FA0D;CJK COMPATIBILITY IDEOGRAPH-2FA0D;Lo;0;L;4CCE;;;;N;;;;;
+2FA0E;CJK COMPATIBILITY IDEOGRAPH-2FA0E;Lo;0;L;4CED;;;;N;;;;;
+2FA0F;CJK COMPATIBILITY IDEOGRAPH-2FA0F;Lo;0;L;9D67;;;;N;;;;;
+2FA10;CJK COMPATIBILITY IDEOGRAPH-2FA10;Lo;0;L;2A0CE;;;;N;;;;;
+2FA11;CJK COMPATIBILITY IDEOGRAPH-2FA11;Lo;0;L;4CF8;;;;N;;;;;
+2FA12;CJK COMPATIBILITY IDEOGRAPH-2FA12;Lo;0;L;2A105;;;;N;;;;;
+2FA13;CJK COMPATIBILITY IDEOGRAPH-2FA13;Lo;0;L;2A20E;;;;N;;;;;
+2FA14;CJK COMPATIBILITY IDEOGRAPH-2FA14;Lo;0;L;2A291;;;;N;;;;;
+2FA15;CJK COMPATIBILITY IDEOGRAPH-2FA15;Lo;0;L;9EBB;;;;N;;;;;
+2FA16;CJK COMPATIBILITY IDEOGRAPH-2FA16;Lo;0;L;4D56;;;;N;;;;;
+2FA17;CJK COMPATIBILITY IDEOGRAPH-2FA17;Lo;0;L;9EF9;;;;N;;;;;
+2FA18;CJK COMPATIBILITY IDEOGRAPH-2FA18;Lo;0;L;9EFE;;;;N;;;;;
+2FA19;CJK COMPATIBILITY IDEOGRAPH-2FA19;Lo;0;L;9F05;;;;N;;;;;
+2FA1A;CJK COMPATIBILITY IDEOGRAPH-2FA1A;Lo;0;L;9F0F;;;;N;;;;;
+2FA1B;CJK COMPATIBILITY IDEOGRAPH-2FA1B;Lo;0;L;9F16;;;;N;;;;;
+2FA1C;CJK COMPATIBILITY IDEOGRAPH-2FA1C;Lo;0;L;9F3B;;;;N;;;;;
+2FA1D;CJK COMPATIBILITY IDEOGRAPH-2FA1D;Lo;0;L;2A600;;;;N;;;;;
+E0001;LANGUAGE TAG;Cf;0;BN;;;;;N;;;;;
+E0020;TAG SPACE;Cf;0;BN;;;;;N;;;;;
+E0021;TAG EXCLAMATION MARK;Cf;0;BN;;;;;N;;;;;
+E0022;TAG QUOTATION MARK;Cf;0;BN;;;;;N;;;;;
+E0023;TAG NUMBER SIGN;Cf;0;BN;;;;;N;;;;;
+E0024;TAG DOLLAR SIGN;Cf;0;BN;;;;;N;;;;;
+E0025;TAG PERCENT SIGN;Cf;0;BN;;;;;N;;;;;
+E0026;TAG AMPERSAND;Cf;0;BN;;;;;N;;;;;
+E0027;TAG APOSTROPHE;Cf;0;BN;;;;;N;;;;;
+E0028;TAG LEFT PARENTHESIS;Cf;0;BN;;;;;N;;;;;
+E0029;TAG RIGHT PARENTHESIS;Cf;0;BN;;;;;N;;;;;
+E002A;TAG ASTERISK;Cf;0;BN;;;;;N;;;;;
+E002B;TAG PLUS SIGN;Cf;0;BN;;;;;N;;;;;
+E002C;TAG COMMA;Cf;0;BN;;;;;N;;;;;
+E002D;TAG HYPHEN-MINUS;Cf;0;BN;;;;;N;;;;;
+E002E;TAG FULL STOP;Cf;0;BN;;;;;N;;;;;
+E002F;TAG SOLIDUS;Cf;0;BN;;;;;N;;;;;
+E0030;TAG DIGIT ZERO;Cf;0;BN;;;;;N;;;;;
+E0031;TAG DIGIT ONE;Cf;0;BN;;;;;N;;;;;
+E0032;TAG DIGIT TWO;Cf;0;BN;;;;;N;;;;;
+E0033;TAG DIGIT THREE;Cf;0;BN;;;;;N;;;;;
+E0034;TAG DIGIT FOUR;Cf;0;BN;;;;;N;;;;;
+E0035;TAG DIGIT FIVE;Cf;0;BN;;;;;N;;;;;
+E0036;TAG DIGIT SIX;Cf;0;BN;;;;;N;;;;;
+E0037;TAG DIGIT SEVEN;Cf;0;BN;;;;;N;;;;;
+E0038;TAG DIGIT EIGHT;Cf;0;BN;;;;;N;;;;;
+E0039;TAG DIGIT NINE;Cf;0;BN;;;;;N;;;;;
+E003A;TAG COLON;Cf;0;BN;;;;;N;;;;;
+E003B;TAG SEMICOLON;Cf;0;BN;;;;;N;;;;;
+E003C;TAG LESS-THAN SIGN;Cf;0;BN;;;;;N;;;;;
+E003D;TAG EQUALS SIGN;Cf;0;BN;;;;;N;;;;;
+E003E;TAG GREATER-THAN SIGN;Cf;0;BN;;;;;N;;;;;
+E003F;TAG QUESTION MARK;Cf;0;BN;;;;;N;;;;;
+E0040;TAG COMMERCIAL AT;Cf;0;BN;;;;;N;;;;;
+E0041;TAG LATIN CAPITAL LETTER A;Cf;0;BN;;;;;N;;;;;
+E0042;TAG LATIN CAPITAL LETTER B;Cf;0;BN;;;;;N;;;;;
+E0043;TAG LATIN CAPITAL LETTER C;Cf;0;BN;;;;;N;;;;;
+E0044;TAG LATIN CAPITAL LETTER D;Cf;0;BN;;;;;N;;;;;
+E0045;TAG LATIN CAPITAL LETTER E;Cf;0;BN;;;;;N;;;;;
+E0046;TAG LATIN CAPITAL LETTER F;Cf;0;BN;;;;;N;;;;;
+E0047;TAG LATIN CAPITAL LETTER G;Cf;0;BN;;;;;N;;;;;
+E0048;TAG LATIN CAPITAL LETTER H;Cf;0;BN;;;;;N;;;;;
+E0049;TAG LATIN CAPITAL LETTER I;Cf;0;BN;;;;;N;;;;;
+E004A;TAG LATIN CAPITAL LETTER J;Cf;0;BN;;;;;N;;;;;
+E004B;TAG LATIN CAPITAL LETTER K;Cf;0;BN;;;;;N;;;;;
+E004C;TAG LATIN CAPITAL LETTER L;Cf;0;BN;;;;;N;;;;;
+E004D;TAG LATIN CAPITAL LETTER M;Cf;0;BN;;;;;N;;;;;
+E004E;TAG LATIN CAPITAL LETTER N;Cf;0;BN;;;;;N;;;;;
+E004F;TAG LATIN CAPITAL LETTER O;Cf;0;BN;;;;;N;;;;;
+E0050;TAG LATIN CAPITAL LETTER P;Cf;0;BN;;;;;N;;;;;
+E0051;TAG LATIN CAPITAL LETTER Q;Cf;0;BN;;;;;N;;;;;
+E0052;TAG LATIN CAPITAL LETTER R;Cf;0;BN;;;;;N;;;;;
+E0053;TAG LATIN CAPITAL LETTER S;Cf;0;BN;;;;;N;;;;;
+E0054;TAG LATIN CAPITAL LETTER T;Cf;0;BN;;;;;N;;;;;
+E0055;TAG LATIN CAPITAL LETTER U;Cf;0;BN;;;;;N;;;;;
+E0056;TAG LATIN CAPITAL LETTER V;Cf;0;BN;;;;;N;;;;;
+E0057;TAG LATIN CAPITAL LETTER W;Cf;0;BN;;;;;N;;;;;
+E0058;TAG LATIN CAPITAL LETTER X;Cf;0;BN;;;;;N;;;;;
+E0059;TAG LATIN CAPITAL LETTER Y;Cf;0;BN;;;;;N;;;;;
+E005A;TAG LATIN CAPITAL LETTER Z;Cf;0;BN;;;;;N;;;;;
+E005B;TAG LEFT SQUARE BRACKET;Cf;0;BN;;;;;N;;;;;
+E005C;TAG REVERSE SOLIDUS;Cf;0;BN;;;;;N;;;;;
+E005D;TAG RIGHT SQUARE BRACKET;Cf;0;BN;;;;;N;;;;;
+E005E;TAG CIRCUMFLEX ACCENT;Cf;0;BN;;;;;N;;;;;
+E005F;TAG LOW LINE;Cf;0;BN;;;;;N;;;;;
+E0060;TAG GRAVE ACCENT;Cf;0;BN;;;;;N;;;;;
+E0061;TAG LATIN SMALL LETTER A;Cf;0;BN;;;;;N;;;;;
+E0062;TAG LATIN SMALL LETTER B;Cf;0;BN;;;;;N;;;;;
+E0063;TAG LATIN SMALL LETTER C;Cf;0;BN;;;;;N;;;;;
+E0064;TAG LATIN SMALL LETTER D;Cf;0;BN;;;;;N;;;;;
+E0065;TAG LATIN SMALL LETTER E;Cf;0;BN;;;;;N;;;;;
+E0066;TAG LATIN SMALL LETTER F;Cf;0;BN;;;;;N;;;;;
+E0067;TAG LATIN SMALL LETTER G;Cf;0;BN;;;;;N;;;;;
+E0068;TAG LATIN SMALL LETTER H;Cf;0;BN;;;;;N;;;;;
+E0069;TAG LATIN SMALL LETTER I;Cf;0;BN;;;;;N;;;;;
+E006A;TAG LATIN SMALL LETTER J;Cf;0;BN;;;;;N;;;;;
+E006B;TAG LATIN SMALL LETTER K;Cf;0;BN;;;;;N;;;;;
+E006C;TAG LATIN SMALL LETTER L;Cf;0;BN;;;;;N;;;;;
+E006D;TAG LATIN SMALL LETTER M;Cf;0;BN;;;;;N;;;;;
+E006E;TAG LATIN SMALL LETTER N;Cf;0;BN;;;;;N;;;;;
+E006F;TAG LATIN SMALL LETTER O;Cf;0;BN;;;;;N;;;;;
+E0070;TAG LATIN SMALL LETTER P;Cf;0;BN;;;;;N;;;;;
+E0071;TAG LATIN SMALL LETTER Q;Cf;0;BN;;;;;N;;;;;
+E0072;TAG LATIN SMALL LETTER R;Cf;0;BN;;;;;N;;;;;
+E0073;TAG LATIN SMALL LETTER S;Cf;0;BN;;;;;N;;;;;
+E0074;TAG LATIN SMALL LETTER T;Cf;0;BN;;;;;N;;;;;
+E0075;TAG LATIN SMALL LETTER U;Cf;0;BN;;;;;N;;;;;
+E0076;TAG LATIN SMALL LETTER V;Cf;0;BN;;;;;N;;;;;
+E0077;TAG LATIN SMALL LETTER W;Cf;0;BN;;;;;N;;;;;
+E0078;TAG LATIN SMALL LETTER X;Cf;0;BN;;;;;N;;;;;
+E0079;TAG LATIN SMALL LETTER Y;Cf;0;BN;;;;;N;;;;;
+E007A;TAG LATIN SMALL LETTER Z;Cf;0;BN;;;;;N;;;;;
+E007B;TAG LEFT CURLY BRACKET;Cf;0;BN;;;;;N;;;;;
+E007C;TAG VERTICAL LINE;Cf;0;BN;;;;;N;;;;;
+E007D;TAG RIGHT CURLY BRACKET;Cf;0;BN;;;;;N;;;;;
+E007E;TAG TILDE;Cf;0;BN;;;;;N;;;;;
+E007F;CANCEL TAG;Cf;0;BN;;;;;N;;;;;
+E0100;VARIATION SELECTOR-17;Mn;0;NSM;;;;;N;;;;;
+E0101;VARIATION SELECTOR-18;Mn;0;NSM;;;;;N;;;;;
+E0102;VARIATION SELECTOR-19;Mn;0;NSM;;;;;N;;;;;
+E0103;VARIATION SELECTOR-20;Mn;0;NSM;;;;;N;;;;;
+E0104;VARIATION SELECTOR-21;Mn;0;NSM;;;;;N;;;;;
+E0105;VARIATION SELECTOR-22;Mn;0;NSM;;;;;N;;;;;
+E0106;VARIATION SELECTOR-23;Mn;0;NSM;;;;;N;;;;;
+E0107;VARIATION SELECTOR-24;Mn;0;NSM;;;;;N;;;;;
+E0108;VARIATION SELECTOR-25;Mn;0;NSM;;;;;N;;;;;
+E0109;VARIATION SELECTOR-26;Mn;0;NSM;;;;;N;;;;;
+E010A;VARIATION SELECTOR-27;Mn;0;NSM;;;;;N;;;;;
+E010B;VARIATION SELECTOR-28;Mn;0;NSM;;;;;N;;;;;
+E010C;VARIATION SELECTOR-29;Mn;0;NSM;;;;;N;;;;;
+E010D;VARIATION SELECTOR-30;Mn;0;NSM;;;;;N;;;;;
+E010E;VARIATION SELECTOR-31;Mn;0;NSM;;;;;N;;;;;
+E010F;VARIATION SELECTOR-32;Mn;0;NSM;;;;;N;;;;;
+E0110;VARIATION SELECTOR-33;Mn;0;NSM;;;;;N;;;;;
+E0111;VARIATION SELECTOR-34;Mn;0;NSM;;;;;N;;;;;
+E0112;VARIATION SELECTOR-35;Mn;0;NSM;;;;;N;;;;;
+E0113;VARIATION SELECTOR-36;Mn;0;NSM;;;;;N;;;;;
+E0114;VARIATION SELECTOR-37;Mn;0;NSM;;;;;N;;;;;
+E0115;VARIATION SELECTOR-38;Mn;0;NSM;;;;;N;;;;;
+E0116;VARIATION SELECTOR-39;Mn;0;NSM;;;;;N;;;;;
+E0117;VARIATION SELECTOR-40;Mn;0;NSM;;;;;N;;;;;
+E0118;VARIATION SELECTOR-41;Mn;0;NSM;;;;;N;;;;;
+E0119;VARIATION SELECTOR-42;Mn;0;NSM;;;;;N;;;;;
+E011A;VARIATION SELECTOR-43;Mn;0;NSM;;;;;N;;;;;
+E011B;VARIATION SELECTOR-44;Mn;0;NSM;;;;;N;;;;;
+E011C;VARIATION SELECTOR-45;Mn;0;NSM;;;;;N;;;;;
+E011D;VARIATION SELECTOR-46;Mn;0;NSM;;;;;N;;;;;
+E011E;VARIATION SELECTOR-47;Mn;0;NSM;;;;;N;;;;;
+E011F;VARIATION SELECTOR-48;Mn;0;NSM;;;;;N;;;;;
+E0120;VARIATION SELECTOR-49;Mn;0;NSM;;;;;N;;;;;
+E0121;VARIATION SELECTOR-50;Mn;0;NSM;;;;;N;;;;;
+E0122;VARIATION SELECTOR-51;Mn;0;NSM;;;;;N;;;;;
+E0123;VARIATION SELECTOR-52;Mn;0;NSM;;;;;N;;;;;
+E0124;VARIATION SELECTOR-53;Mn;0;NSM;;;;;N;;;;;
+E0125;VARIATION SELECTOR-54;Mn;0;NSM;;;;;N;;;;;
+E0126;VARIATION SELECTOR-55;Mn;0;NSM;;;;;N;;;;;
+E0127;VARIATION SELECTOR-56;Mn;0;NSM;;;;;N;;;;;
+E0128;VARIATION SELECTOR-57;Mn;0;NSM;;;;;N;;;;;
+E0129;VARIATION SELECTOR-58;Mn;0;NSM;;;;;N;;;;;
+E012A;VARIATION SELECTOR-59;Mn;0;NSM;;;;;N;;;;;
+E012B;VARIATION SELECTOR-60;Mn;0;NSM;;;;;N;;;;;
+E012C;VARIATION SELECTOR-61;Mn;0;NSM;;;;;N;;;;;
+E012D;VARIATION SELECTOR-62;Mn;0;NSM;;;;;N;;;;;
+E012E;VARIATION SELECTOR-63;Mn;0;NSM;;;;;N;;;;;
+E012F;VARIATION SELECTOR-64;Mn;0;NSM;;;;;N;;;;;
+E0130;VARIATION SELECTOR-65;Mn;0;NSM;;;;;N;;;;;
+E0131;VARIATION SELECTOR-66;Mn;0;NSM;;;;;N;;;;;
+E0132;VARIATION SELECTOR-67;Mn;0;NSM;;;;;N;;;;;
+E0133;VARIATION SELECTOR-68;Mn;0;NSM;;;;;N;;;;;
+E0134;VARIATION SELECTOR-69;Mn;0;NSM;;;;;N;;;;;
+E0135;VARIATION SELECTOR-70;Mn;0;NSM;;;;;N;;;;;
+E0136;VARIATION SELECTOR-71;Mn;0;NSM;;;;;N;;;;;
+E0137;VARIATION SELECTOR-72;Mn;0;NSM;;;;;N;;;;;
+E0138;VARIATION SELECTOR-73;Mn;0;NSM;;;;;N;;;;;
+E0139;VARIATION SELECTOR-74;Mn;0;NSM;;;;;N;;;;;
+E013A;VARIATION SELECTOR-75;Mn;0;NSM;;;;;N;;;;;
+E013B;VARIATION SELECTOR-76;Mn;0;NSM;;;;;N;;;;;
+E013C;VARIATION SELECTOR-77;Mn;0;NSM;;;;;N;;;;;
+E013D;VARIATION SELECTOR-78;Mn;0;NSM;;;;;N;;;;;
+E013E;VARIATION SELECTOR-79;Mn;0;NSM;;;;;N;;;;;
+E013F;VARIATION SELECTOR-80;Mn;0;NSM;;;;;N;;;;;
+E0140;VARIATION SELECTOR-81;Mn;0;NSM;;;;;N;;;;;
+E0141;VARIATION SELECTOR-82;Mn;0;NSM;;;;;N;;;;;
+E0142;VARIATION SELECTOR-83;Mn;0;NSM;;;;;N;;;;;
+E0143;VARIATION SELECTOR-84;Mn;0;NSM;;;;;N;;;;;
+E0144;VARIATION SELECTOR-85;Mn;0;NSM;;;;;N;;;;;
+E0145;VARIATION SELECTOR-86;Mn;0;NSM;;;;;N;;;;;
+E0146;VARIATION SELECTOR-87;Mn;0;NSM;;;;;N;;;;;
+E0147;VARIATION SELECTOR-88;Mn;0;NSM;;;;;N;;;;;
+E0148;VARIATION SELECTOR-89;Mn;0;NSM;;;;;N;;;;;
+E0149;VARIATION SELECTOR-90;Mn;0;NSM;;;;;N;;;;;
+E014A;VARIATION SELECTOR-91;Mn;0;NSM;;;;;N;;;;;
+E014B;VARIATION SELECTOR-92;Mn;0;NSM;;;;;N;;;;;
+E014C;VARIATION SELECTOR-93;Mn;0;NSM;;;;;N;;;;;
+E014D;VARIATION SELECTOR-94;Mn;0;NSM;;;;;N;;;;;
+E014E;VARIATION SELECTOR-95;Mn;0;NSM;;;;;N;;;;;
+E014F;VARIATION SELECTOR-96;Mn;0;NSM;;;;;N;;;;;
+E0150;VARIATION SELECTOR-97;Mn;0;NSM;;;;;N;;;;;
+E0151;VARIATION SELECTOR-98;Mn;0;NSM;;;;;N;;;;;
+E0152;VARIATION SELECTOR-99;Mn;0;NSM;;;;;N;;;;;
+E0153;VARIATION SELECTOR-100;Mn;0;NSM;;;;;N;;;;;
+E0154;VARIATION SELECTOR-101;Mn;0;NSM;;;;;N;;;;;
+E0155;VARIATION SELECTOR-102;Mn;0;NSM;;;;;N;;;;;
+E0156;VARIATION SELECTOR-103;Mn;0;NSM;;;;;N;;;;;
+E0157;VARIATION SELECTOR-104;Mn;0;NSM;;;;;N;;;;;
+E0158;VARIATION SELECTOR-105;Mn;0;NSM;;;;;N;;;;;
+E0159;VARIATION SELECTOR-106;Mn;0;NSM;;;;;N;;;;;
+E015A;VARIATION SELECTOR-107;Mn;0;NSM;;;;;N;;;;;
+E015B;VARIATION SELECTOR-108;Mn;0;NSM;;;;;N;;;;;
+E015C;VARIATION SELECTOR-109;Mn;0;NSM;;;;;N;;;;;
+E015D;VARIATION SELECTOR-110;Mn;0;NSM;;;;;N;;;;;
+E015E;VARIATION SELECTOR-111;Mn;0;NSM;;;;;N;;;;;
+E015F;VARIATION SELECTOR-112;Mn;0;NSM;;;;;N;;;;;
+E0160;VARIATION SELECTOR-113;Mn;0;NSM;;;;;N;;;;;
+E0161;VARIATION SELECTOR-114;Mn;0;NSM;;;;;N;;;;;
+E0162;VARIATION SELECTOR-115;Mn;0;NSM;;;;;N;;;;;
+E0163;VARIATION SELECTOR-116;Mn;0;NSM;;;;;N;;;;;
+E0164;VARIATION SELECTOR-117;Mn;0;NSM;;;;;N;;;;;
+E0165;VARIATION SELECTOR-118;Mn;0;NSM;;;;;N;;;;;
+E0166;VARIATION SELECTOR-119;Mn;0;NSM;;;;;N;;;;;
+E0167;VARIATION SELECTOR-120;Mn;0;NSM;;;;;N;;;;;
+E0168;VARIATION SELECTOR-121;Mn;0;NSM;;;;;N;;;;;
+E0169;VARIATION SELECTOR-122;Mn;0;NSM;;;;;N;;;;;
+E016A;VARIATION SELECTOR-123;Mn;0;NSM;;;;;N;;;;;
+E016B;VARIATION SELECTOR-124;Mn;0;NSM;;;;;N;;;;;
+E016C;VARIATION SELECTOR-125;Mn;0;NSM;;;;;N;;;;;
+E016D;VARIATION SELECTOR-126;Mn;0;NSM;;;;;N;;;;;
+E016E;VARIATION SELECTOR-127;Mn;0;NSM;;;;;N;;;;;
+E016F;VARIATION SELECTOR-128;Mn;0;NSM;;;;;N;;;;;
+E0170;VARIATION SELECTOR-129;Mn;0;NSM;;;;;N;;;;;
+E0171;VARIATION SELECTOR-130;Mn;0;NSM;;;;;N;;;;;
+E0172;VARIATION SELECTOR-131;Mn;0;NSM;;;;;N;;;;;
+E0173;VARIATION SELECTOR-132;Mn;0;NSM;;;;;N;;;;;
+E0174;VARIATION SELECTOR-133;Mn;0;NSM;;;;;N;;;;;
+E0175;VARIATION SELECTOR-134;Mn;0;NSM;;;;;N;;;;;
+E0176;VARIATION SELECTOR-135;Mn;0;NSM;;;;;N;;;;;
+E0177;VARIATION SELECTOR-136;Mn;0;NSM;;;;;N;;;;;
+E0178;VARIATION SELECTOR-137;Mn;0;NSM;;;;;N;;;;;
+E0179;VARIATION SELECTOR-138;Mn;0;NSM;;;;;N;;;;;
+E017A;VARIATION SELECTOR-139;Mn;0;NSM;;;;;N;;;;;
+E017B;VARIATION SELECTOR-140;Mn;0;NSM;;;;;N;;;;;
+E017C;VARIATION SELECTOR-141;Mn;0;NSM;;;;;N;;;;;
+E017D;VARIATION SELECTOR-142;Mn;0;NSM;;;;;N;;;;;
+E017E;VARIATION SELECTOR-143;Mn;0;NSM;;;;;N;;;;;
+E017F;VARIATION SELECTOR-144;Mn;0;NSM;;;;;N;;;;;
+E0180;VARIATION SELECTOR-145;Mn;0;NSM;;;;;N;;;;;
+E0181;VARIATION SELECTOR-146;Mn;0;NSM;;;;;N;;;;;
+E0182;VARIATION SELECTOR-147;Mn;0;NSM;;;;;N;;;;;
+E0183;VARIATION SELECTOR-148;Mn;0;NSM;;;;;N;;;;;
+E0184;VARIATION SELECTOR-149;Mn;0;NSM;;;;;N;;;;;
+E0185;VARIATION SELECTOR-150;Mn;0;NSM;;;;;N;;;;;
+E0186;VARIATION SELECTOR-151;Mn;0;NSM;;;;;N;;;;;
+E0187;VARIATION SELECTOR-152;Mn;0;NSM;;;;;N;;;;;
+E0188;VARIATION SELECTOR-153;Mn;0;NSM;;;;;N;;;;;
+E0189;VARIATION SELECTOR-154;Mn;0;NSM;;;;;N;;;;;
+E018A;VARIATION SELECTOR-155;Mn;0;NSM;;;;;N;;;;;
+E018B;VARIATION SELECTOR-156;Mn;0;NSM;;;;;N;;;;;
+E018C;VARIATION SELECTOR-157;Mn;0;NSM;;;;;N;;;;;
+E018D;VARIATION SELECTOR-158;Mn;0;NSM;;;;;N;;;;;
+E018E;VARIATION SELECTOR-159;Mn;0;NSM;;;;;N;;;;;
+E018F;VARIATION SELECTOR-160;Mn;0;NSM;;;;;N;;;;;
+E0190;VARIATION SELECTOR-161;Mn;0;NSM;;;;;N;;;;;
+E0191;VARIATION SELECTOR-162;Mn;0;NSM;;;;;N;;;;;
+E0192;VARIATION SELECTOR-163;Mn;0;NSM;;;;;N;;;;;
+E0193;VARIATION SELECTOR-164;Mn;0;NSM;;;;;N;;;;;
+E0194;VARIATION SELECTOR-165;Mn;0;NSM;;;;;N;;;;;
+E0195;VARIATION SELECTOR-166;Mn;0;NSM;;;;;N;;;;;
+E0196;VARIATION SELECTOR-167;Mn;0;NSM;;;;;N;;;;;
+E0197;VARIATION SELECTOR-168;Mn;0;NSM;;;;;N;;;;;
+E0198;VARIATION SELECTOR-169;Mn;0;NSM;;;;;N;;;;;
+E0199;VARIATION SELECTOR-170;Mn;0;NSM;;;;;N;;;;;
+E019A;VARIATION SELECTOR-171;Mn;0;NSM;;;;;N;;;;;
+E019B;VARIATION SELECTOR-172;Mn;0;NSM;;;;;N;;;;;
+E019C;VARIATION SELECTOR-173;Mn;0;NSM;;;;;N;;;;;
+E019D;VARIATION SELECTOR-174;Mn;0;NSM;;;;;N;;;;;
+E019E;VARIATION SELECTOR-175;Mn;0;NSM;;;;;N;;;;;
+E019F;VARIATION SELECTOR-176;Mn;0;NSM;;;;;N;;;;;
+E01A0;VARIATION SELECTOR-177;Mn;0;NSM;;;;;N;;;;;
+E01A1;VARIATION SELECTOR-178;Mn;0;NSM;;;;;N;;;;;
+E01A2;VARIATION SELECTOR-179;Mn;0;NSM;;;;;N;;;;;
+E01A3;VARIATION SELECTOR-180;Mn;0;NSM;;;;;N;;;;;
+E01A4;VARIATION SELECTOR-181;Mn;0;NSM;;;;;N;;;;;
+E01A5;VARIATION SELECTOR-182;Mn;0;NSM;;;;;N;;;;;
+E01A6;VARIATION SELECTOR-183;Mn;0;NSM;;;;;N;;;;;
+E01A7;VARIATION SELECTOR-184;Mn;0;NSM;;;;;N;;;;;
+E01A8;VARIATION SELECTOR-185;Mn;0;NSM;;;;;N;;;;;
+E01A9;VARIATION SELECTOR-186;Mn;0;NSM;;;;;N;;;;;
+E01AA;VARIATION SELECTOR-187;Mn;0;NSM;;;;;N;;;;;
+E01AB;VARIATION SELECTOR-188;Mn;0;NSM;;;;;N;;;;;
+E01AC;VARIATION SELECTOR-189;Mn;0;NSM;;;;;N;;;;;
+E01AD;VARIATION SELECTOR-190;Mn;0;NSM;;;;;N;;;;;
+E01AE;VARIATION SELECTOR-191;Mn;0;NSM;;;;;N;;;;;
+E01AF;VARIATION SELECTOR-192;Mn;0;NSM;;;;;N;;;;;
+E01B0;VARIATION SELECTOR-193;Mn;0;NSM;;;;;N;;;;;
+E01B1;VARIATION SELECTOR-194;Mn;0;NSM;;;;;N;;;;;
+E01B2;VARIATION SELECTOR-195;Mn;0;NSM;;;;;N;;;;;
+E01B3;VARIATION SELECTOR-196;Mn;0;NSM;;;;;N;;;;;
+E01B4;VARIATION SELECTOR-197;Mn;0;NSM;;;;;N;;;;;
+E01B5;VARIATION SELECTOR-198;Mn;0;NSM;;;;;N;;;;;
+E01B6;VARIATION SELECTOR-199;Mn;0;NSM;;;;;N;;;;;
+E01B7;VARIATION SELECTOR-200;Mn;0;NSM;;;;;N;;;;;
+E01B8;VARIATION SELECTOR-201;Mn;0;NSM;;;;;N;;;;;
+E01B9;VARIATION SELECTOR-202;Mn;0;NSM;;;;;N;;;;;
+E01BA;VARIATION SELECTOR-203;Mn;0;NSM;;;;;N;;;;;
+E01BB;VARIATION SELECTOR-204;Mn;0;NSM;;;;;N;;;;;
+E01BC;VARIATION SELECTOR-205;Mn;0;NSM;;;;;N;;;;;
+E01BD;VARIATION SELECTOR-206;Mn;0;NSM;;;;;N;;;;;
+E01BE;VARIATION SELECTOR-207;Mn;0;NSM;;;;;N;;;;;
+E01BF;VARIATION SELECTOR-208;Mn;0;NSM;;;;;N;;;;;
+E01C0;VARIATION SELECTOR-209;Mn;0;NSM;;;;;N;;;;;
+E01C1;VARIATION SELECTOR-210;Mn;0;NSM;;;;;N;;;;;
+E01C2;VARIATION SELECTOR-211;Mn;0;NSM;;;;;N;;;;;
+E01C3;VARIATION SELECTOR-212;Mn;0;NSM;;;;;N;;;;;
+E01C4;VARIATION SELECTOR-213;Mn;0;NSM;;;;;N;;;;;
+E01C5;VARIATION SELECTOR-214;Mn;0;NSM;;;;;N;;;;;
+E01C6;VARIATION SELECTOR-215;Mn;0;NSM;;;;;N;;;;;
+E01C7;VARIATION SELECTOR-216;Mn;0;NSM;;;;;N;;;;;
+E01C8;VARIATION SELECTOR-217;Mn;0;NSM;;;;;N;;;;;
+E01C9;VARIATION SELECTOR-218;Mn;0;NSM;;;;;N;;;;;
+E01CA;VARIATION SELECTOR-219;Mn;0;NSM;;;;;N;;;;;
+E01CB;VARIATION SELECTOR-220;Mn;0;NSM;;;;;N;;;;;
+E01CC;VARIATION SELECTOR-221;Mn;0;NSM;;;;;N;;;;;
+E01CD;VARIATION SELECTOR-222;Mn;0;NSM;;;;;N;;;;;
+E01CE;VARIATION SELECTOR-223;Mn;0;NSM;;;;;N;;;;;
+E01CF;VARIATION SELECTOR-224;Mn;0;NSM;;;;;N;;;;;
+E01D0;VARIATION SELECTOR-225;Mn;0;NSM;;;;;N;;;;;
+E01D1;VARIATION SELECTOR-226;Mn;0;NSM;;;;;N;;;;;
+E01D2;VARIATION SELECTOR-227;Mn;0;NSM;;;;;N;;;;;
+E01D3;VARIATION SELECTOR-228;Mn;0;NSM;;;;;N;;;;;
+E01D4;VARIATION SELECTOR-229;Mn;0;NSM;;;;;N;;;;;
+E01D5;VARIATION SELECTOR-230;Mn;0;NSM;;;;;N;;;;;
+E01D6;VARIATION SELECTOR-231;Mn;0;NSM;;;;;N;;;;;
+E01D7;VARIATION SELECTOR-232;Mn;0;NSM;;;;;N;;;;;
+E01D8;VARIATION SELECTOR-233;Mn;0;NSM;;;;;N;;;;;
+E01D9;VARIATION SELECTOR-234;Mn;0;NSM;;;;;N;;;;;
+E01DA;VARIATION SELECTOR-235;Mn;0;NSM;;;;;N;;;;;
+E01DB;VARIATION SELECTOR-236;Mn;0;NSM;;;;;N;;;;;
+E01DC;VARIATION SELECTOR-237;Mn;0;NSM;;;;;N;;;;;
+E01DD;VARIATION SELECTOR-238;Mn;0;NSM;;;;;N;;;;;
+E01DE;VARIATION SELECTOR-239;Mn;0;NSM;;;;;N;;;;;
+E01DF;VARIATION SELECTOR-240;Mn;0;NSM;;;;;N;;;;;
+E01E0;VARIATION SELECTOR-241;Mn;0;NSM;;;;;N;;;;;
+E01E1;VARIATION SELECTOR-242;Mn;0;NSM;;;;;N;;;;;
+E01E2;VARIATION SELECTOR-243;Mn;0;NSM;;;;;N;;;;;
+E01E3;VARIATION SELECTOR-244;Mn;0;NSM;;;;;N;;;;;
+E01E4;VARIATION SELECTOR-245;Mn;0;NSM;;;;;N;;;;;
+E01E5;VARIATION SELECTOR-246;Mn;0;NSM;;;;;N;;;;;
+E01E6;VARIATION SELECTOR-247;Mn;0;NSM;;;;;N;;;;;
+E01E7;VARIATION SELECTOR-248;Mn;0;NSM;;;;;N;;;;;
+E01E8;VARIATION SELECTOR-249;Mn;0;NSM;;;;;N;;;;;
+E01E9;VARIATION SELECTOR-250;Mn;0;NSM;;;;;N;;;;;
+E01EA;VARIATION SELECTOR-251;Mn;0;NSM;;;;;N;;;;;
+E01EB;VARIATION SELECTOR-252;Mn;0;NSM;;;;;N;;;;;
+E01EC;VARIATION SELECTOR-253;Mn;0;NSM;;;;;N;;;;;
+E01ED;VARIATION SELECTOR-254;Mn;0;NSM;;;;;N;;;;;
+E01EE;VARIATION SELECTOR-255;Mn;0;NSM;;;;;N;;;;;
+E01EF;VARIATION SELECTOR-256;Mn;0;NSM;;;;;N;;;;;
+F0000;<Plane 15 Private Use, First>;Co;0;L;;;;;N;;;;;
+FFFFD;<Plane 15 Private Use, Last>;Co;0;L;;;;;N;;;;;
+100000;<Plane 16 Private Use, First>;Co;0;L;;;;;N;;;;;
+10FFFD;<Plane 16 Private Use, Last>;Co;0;L;;;;;N;;;;;

_service:tar_scm:slang-2.3.2.tar.bz2/utf8/tools/mktables Added

@@ -0,0 +1,638 @@
+#!/usr/bin/env slsh
+% The unicode database contains 15 fields
+
+private define usage ()
+{
+ () = fprintf (stderr, "Usage: %s UnicodeData.txt EastAsianWidth.txt\n", __argv0);
+ exit (1);
+}
+
+if (__argc != 3)
+ usage ();
+
+private variable Unicode_Data_File = __argv1;
+private variable East_Asian_File = __argv2;
+
+private define make_char_def_table (num)
+{
+ variable s = struct
+ {
+	code_point,
+	char_name,
+	general_cat,
+	combining_class,
+	bidirectional_cat,
+	char_decomp_map,
+	decimal_digit_val,
+	digit_val,
+	numeric_val,
+	is_mirrored,
+	unicode1_name,
+	iso10646_comment,
+	uppercase_mapping,
+	lowercase_mapping,
+	titlecase_mapping,
+	east_asian_prop,
+ };
+
+ s.code_point = Int32_Typenum; s.code_point* = 0:num-1;
+ s.char_name = String_Typenum; s.char_name* = "";
+ s.general_cat = String_Typenum; s.general_cat* = "";
+ s.combining_class = String_Typenum; s.combining_class* = "";
+ s.bidirectional_cat = String_Typenum; s.bidirectional_cat* = "";
+ s.char_decomp_map = String_Typenum; s.char_decomp_map* = "";
+ s.decimal_digit_val = String_Typenum;
+ s.digit_val = String_Typenum;
+ s.numeric_val = String_Typenum;
+ s.is_mirrored = Char_Typenum;
+ s.unicode1_name = String_Typenum;
+ s.iso10646_comment = String_Typenum;
+ s.lowercase_mapping = Int32_Typenum;
+ s.uppercase_mapping = Int32_Typenum;
+ s.titlecase_mapping = Int32_Typenum;
+ s.east_asian_prop = String_Typenum; s.east_asian_prop* = "";
+ return s;
+}
+
+private define fixup_ranges (starts, stops, s)
+{
+ variable nranges = length (starts);
+
+ foreach (get_struct_field_names (s))
+ {
+	variable field_name = ();
+
+	if (field_name == "code_point")
+	 continue;
+
+	variable field = get_struct_field (s, field_name);
+	_for (0, nranges-1, 1)
+	 {
+	 variable i = ();
+	 variable start = startsi;
+	 variable stop = stopsi;
+
+	 fieldstart+1:stop-1 = fieldstart;
+	 }
+ }
+}
+
+private define hexstr_to_int (s)
+{
+ return integer (strcat ("0x0", strtrim (s)));
+}
+
+private define read_file (file)
+{
+ variable lines = fgetslines (fopen (file, "r"));
+
+ % Get the code point of the last line since it determines the number of
+ % code points
+ variable num = 1+hexstr_to_int (strchop (lines-1, ';', 0)0);
+
+ variable s = make_char_def_table (num);
+ variable is_range = Char_Typenum;
+ variable i, j;
+
+ foreach (lines)
+ {
+	variable line = ();
+	variable fields = strchop (line, ';', 0);
+
+	if (fields2 == "Cs")
+	 continue;		 % surrogate
+
+	i = hexstr_to_int (fields0);
+
+	variable field = fields1;
+	s.char_namei = field;
+	% A range is specified if the field is of the form <xxx, First>
+	% or <xxx, Last>
+	if (field0 == '<')
+	 {
+	 if (string_match (field, ", First>$", 1))
+	 is_range i = 1;
+	 else if (string_match (field, ", Last>$", 1))
+	 is_rangei = -1;
+	 }
+
+	s.general_cati = fields2;
+	s.combining_classi = fields3;
+	s.bidirectional_cati = fields4;
+	s.char_decomp_mapi = fields5;
+	s.decimal_digit_vali = fields6;
+	s.digit_vali = fields7;
+	s.numeric_vali = fields8;
+	s.is_mirroredi = (fields9 == "Y");
+	s.unicode1_namei = fields10;
+	s.iso10646_commenti = fields11;
+	s.uppercase_mappingi = hexstr_to_int (fields12);
+	s.lowercase_mappingi = hexstr_to_int (fields13);
+	s.titlecase_mappingi = hexstr_to_int (fields14);
+ }
+
+ i = where (is_range == 1);
+ if (length (i))
+ {
+	j = where (is_range == -1);
+	if (length (i) != length (j))
+	 verror ("First and Last ranges do not match");
+
+	fixup_ranges (i, j, s);
+ }
+
+ i = where (s.lowercase_mapping == 0);
+ s.lowercase_mappingi = s.code_pointi;
+ i = where (s.uppercase_mapping == 0);
+ s.uppercase_mappingi = s.code_pointi;
+ i = where (s.titlecase_mapping == 0);
+ s.titlecase_mappingi = s.code_pointi;
+
+ return s;
+}
+
+private define read_east_asian_file (s, file)
+{
+ foreach (fopen (file, "r")) using ("line")
+ {
+	variable line = ();
+	if (line0 == '#')
+	 continue;
+	line = strtrim (line);
+	!if (strlen (line))
+	 continue;
+	variable code, prop;
+	variable fields = strtok (line, "; ");
+	code = fields0;
+	if (is_substr (code, ".."))
+	 {
+	 code = strtok (code, ".");
+	 variable code_start = hexstr_to_int (code0);
+	 variable code_stop = hexstr_to_int (code1);
+	 prop = fields1;
+	 _for (code_start, code_stop, 1)
+	 {
+		 code = ();
+		 s.east_asian_propcode = prop;
+	 }
+	 continue;
+	 }
+	code = hexstr_to_int (code);
+	s.east_asian_propcode = fields1;
+ }
+}
+
+private variable LOWER	= 0x0001;
+private variable UPPER	= 0x0002;
+private variable ALPHA	= 0x0004;
+private variable XDIGIT	= 0x0008;
+private variable SPACE	= 0x0010;
+private variable BLANK	= 0x0020;
+private variable CNTRL	= 0x0040;
+private variable PRINT	= 0x0080;
+
+private variable DIGIT	= 0x0100;
+private variable GRAPH	= 0x0200;
+private variable ALNUM	= 0x0400;
+private variable PUNCT	= 0x0800;
+private variable ASCII	= 0x1000;
+
+private variable Classification_C_Table_Type = "_pSLuint16_Type";
+private variable Classification_C_Table_Format = "0x%04X";
+
+private define init_file (file)
+{
+ variable fp = fopen (file, "w");
+
+ () = fprintf (fp, "/* This file was automatically created by %s */\n", __argv0);
+
+ return fp;
+}
+
+private define check_data_type (datatype, s, what, table_name)
+{
+ variable min_val, max_val;
+
+ switch (datatype)
+ {
+ case "char":
+	min_val = -128; max_val = 127;
+ }
+ {
+	case "unsigned char":
+	min_val = 0; max_val = 255;
+ }
+ {
+ case "_pSLint16_Type":
+	min_val = -32768; max_val = 32767;
+ }
+ {
+ case "_pSLuint16_Type":
+	min_val = 0; max_val = 0xFFFF;
+ }
+ {
+ case "_pSLint32_Type":
+	min_val = -2147483648;
+	max_val = 0x7FFFFFFF;
+ }
+ {
+ case "_pSLuint32_Type":
+	min_val = 0; max_val = 0xFFFFFFFFUL;
+ }
+ {
+ case "bit":
+	return;
+ }
+ {
+	() = fprintf (stderr, "check_data_type: %s not supported\n", datatype);
+	return;
+ }
+
+ variable i = wherenot (min_val <= what <= max_val);
+ if (length (i) == 0)
+ return;
+
+ () = fprintf (stderr, "***WARNING: table for %s needs a larger type for char 0x%04X\n", table_name, s.code_pointi0);
+}
+
+private define write_toxxx_table (fp, s, what, datatype,
+				 table_name, format, shift_bits,
+				 greater_than_max_value)
+{
+ variable ch = s.code_point;
+ variable use_bitmap = 0;
+ variable i, j, k;
+ variable bits_per_value;
+
+ check_data_type (datatype, s, what, table_name);
+
+ if (datatype == "bit")
+ {
+	variable max_what = max(what);
+	bits_per_value = -1;
+	variable shift_bits_offset = 4;
+	foreach (1,2,4,8) % 7, 3, 1, 0
+	 {
+	 i = ();
+	 shift_bits_offset--;
+	 if (max_what >= (1 shl i))
+		 continue;
+
+	 bits_per_value = i;
+	 break;
+	 }
+
+	if (bits_per_value == -1)
+	 verror ("bit data type cannot represent this object\n");
+
+	datatype = "unsigned char";
+	use_bitmap = 1;
+ }
+
+ if (use_bitmap)
+ {
+	variable num_values_per_8bits = 8/bits_per_value;
+	ch = ch/num_values_per_8bits;
+ }
+
+ % Take advantage of the sparseness of the table. To this end, write
+ % N tables with nentries per table.
+ variable nentries = (1 shl shift_bits);
+ variable ntables = max(ch)/nentries + 1;
+
+ variable data = Int_Typentables * nentries;
+
+ if (use_bitmap)
+ {
+	i = length(what)/num_values_per_8bits;
+	if (i * num_values_per_8bits < length(what))
+	 i++;
+
+	if (greater_than_max_value)
+	 {
+	 vmessage ("Padding table: num_values_per_8bits = %d", num_values_per_8bits);
+	 variable new_what = @Array_Type(_typeof(what), i*num_values_per_8bits);
+	 new_what0:length(what)-1 = what;
+	 new_whatlength(what): = greater_than_max_value;
+	 what = new_what;
+	 }
+	variable bitmap = UChar_Typei;
+
+	% Fillout the bitmap with the correct values for characters beyond the
+	% tabulated range.
+
+	variable bit = 0;
+	_for (0, num_values_per_8bits-1, 1)
+	 {
+	 variable b = ();
+	 variable values = whatb::num_values_per_8bits;
+	 _for (0, bits_per_value-1, 1)
+	 {
+		 k = ();
+		 i = where (values & (1 shl k));
+		 bitmapi |= (1 shl bit);
+		 bit++;
+	 }
+	 }
+	what = bitmap;
+ }
+
+ data0:max(ch) = what;
+
+ variable unique_tables = Array_Typentables;
+ variable tables = Int_Typentables;
+
+ variable num_unique = 0;
+ unique_tables0 = 1:nentries*0;
+ num_unique = 1;
+
+ _for (0, ntables-1, 1)
+ {
+	i = ();
+	variable table = datanentries*i + 0:nentries-1;
+
+	j = 0;
+	while (j < num_unique)
+	 {
+	 if (0 == length (where (unique_tablesj != table)))
+	 break;
+	 j++;
+	 }
+
+	tablesi = j;
+	if (j == num_unique)
+	 {
+	 unique_tablesnum_unique = table;
+	 num_unique++;
+	 }
+ }
+
+ % How many tables do we really need?
+ i = where (tables != 0);
+ ntables = 1 + i-1;
+
+ if (typeof (fp) == String_Type)
+ fp = init_file (fp);
+
+ variable bitmap_multiplier = 1;
+ if (use_bitmap)
+ bitmap_multiplier = num_values_per_8bits;
+
+ variable table_lookup_name = sprintf ("SL_%s_LOOKUP", strup(table_name));
+ variable max_char_name = sprintf ("SL_%s_MAX_CHAR", strup(table_name));
+ variable assign_lookup_name = sprintf ("SL_%s_ALOOKUP", strup(table_name));
+
+ table_name = sprintf ("_pSLwc_%s_Table", table_name);
+
+ () = fprintf (fp, "#define %s 0x%Xul\n\n", max_char_name,
+		 bitmap_multiplier * ntables * nentries);
+
+ if (use_bitmap == 0)
+ {
+	() = fprintf (fp, "#define %s(x) \\\n", table_lookup_name);
+	() = fprintf (fp, " (((unsigned)(x)>=%s)?%d:(%s(unsigned)(x)>>%d(unsigned)(x)&0x%X))\n\n",
+		 max_char_name, greater_than_max_value, table_name, shift_bits, nentries-1);
+ }
+ else if (num_values_per_8bits == 8) % boolean (0 or 1)
+ {
+	()=fprintf(fp, "#define %s(y,x) \\\n", assign_lookup_name);
+	()=fprintf(fp, "{ \\\n");
+	()=fprintf(fp, " const %s *_t; \\\n", datatype);
+	()=fprintf(fp, " (y) = (((unsigned)(x) < %s) \\\n", max_char_name);
+	()=fprintf(fp, "	 && (NULL != (_t = %s(unsigned)(x)>>%d)) \\\n",
+		 table_name, shift_bits_offset + shift_bits);
+	()=fprintf(fp, "	 && (_t(unsigned)((x)>>%d)&0x%X & (%d << ((x)&%d)))); \\\n",
+		 shift_bits_offset, nentries - 1, int(2^bits_per_value-1), num_values_per_8bits-1);
+	()=fprintf(fp, "}\n");
+ }
+ else % bit mapped with num_values_per_8bits = 1,2, or 4
+ {
+	()=fprintf(fp, "#define %s(y,x) \\\n", assign_lookup_name);
+	()=fprintf(fp, "{ \\\n");
+	()=fprintf(fp, " const %s *_t; \\\n", datatype);
+	()=fprintf(fp, " (y) = (((unsigned)(x) < %s) \\\n", max_char_name);
+	()=fprintf(fp, "	 && (NULL != (_t = %s(unsigned)(x)>>%d)) \\\n",
+		 table_name, shift_bits_offset + shift_bits);
+	()=fprintf(fp, "	 ? ((_t(unsigned)((x)>>%d)&0x%X>>(%d*((x)&%d)))&%d) : %d); \\\n",
+		 shift_bits_offset, nentries - 1, bits_per_value,
+		 num_values_per_8bits-1, int(2^bits_per_value-1),
+		 greater_than_max_value);
+	()=fprintf(fp, "}\n");
+ }
+
+ () = fprintf (fp, "extern const %s *%s%d;\n\n", datatype, table_name, ntables);
+
+ () = fprintf (fp, "#ifdef DEFINE%s\n", strup (table_name));
+
+ format = format, format, format, format, format, format, format, format;
+ format = strcat (" /*0x%02X-0x%02X*/ ", strjoin (format, ", "));
+
+ _for (0, num_unique-1, 1)
+ {
+	i = ();
+	if ((i == 0) and use_bitmap)
+	 continue;
+
+	() = fprintf (fp, "static const %s Table_%02d%d =\n{\n",
+		 datatype, i, nentries);
+
+	table = unique_tablesi;
+	_for (0, nentries-1, 8)
+	 {
+	 j = ();
+	 if (j)
+	 () = fputs (",\n", fp);
+	 () = fprintf (fp, format,
+			 j, (j+7),
+			 tablej, tablej+1, tablej+2, tablej+3,
+			 tablej+4, tablej+5, tablej+6, tablej+7);
+	 }
+	() = fputs ("\n};\n\n", fp);
+ }
+
+ () = fprintf (fp, "const %s *%s%d =\n{", datatype, table_name, ntables);
+ i = 0;
+ while (i < ntables)
+ {
+	if (i) () = fputs (",", fp);
+
+	!if (i mod 6)
+	 () = fputs ("\n", fp);
+
+	if (use_bitmap and (tablesi == 0))
+	 () = fprintf (fp, " NULL");
+	else
+	 () = fprintf (fp, " Table_%02d", tablesi);
+
+	i++;
+ }
+ () = fputs ("\n};\n", fp);
+ () = fprintf (fp, "#endif /* DEFINE%s */\n", strup(table_name));
+
+ () = fclose (fp);
+
+ variable size;
+
+ if (is_substr (datatype, "char"))
+ size = 1;
+ else if (is_substr (datatype, "short"))
+ size = 2;
+ else size = 4;
+
+ if (use_bitmap == 0)
+ {
+	vmessage ("Estimated table size: %d bytes",
+		 4*ntables + size*nentries*num_unique);
+ }
+ else
+ {
+	vmessage ("Estimated table size: %d bytes",
+		 4*ntables + size*nentries*(num_unique-1));
+ }
+}
+
+private define make_char_classes (s)
+{
+ variable i;
+ variable code_point = s.code_point;
+ variable gcat0 = int (s.general_cat);
+ variable char_classes = UShort_Typelength(code_point);
+#iftrue
+ % LOWER
+ i = where (((code_point == s.lowercase_mapping)
+	 and (code_point != s.uppercase_mapping)));
+ char_classesi |= LOWER;
+
+ % UPPER
+ i = where (((code_point == s.uppercase_mapping)
+	 or (code_point == s.titlecase_mapping))
+	 and (code_point != s.lowercase_mapping));
+ char_classesi |= UPPER;
+#endif
+ % LOWER
+ i = where ((s.general_cat == "Ll") and (0 == (char_classes & UPPER)));
+ char_classesi |= LOWER;
+
+ % UPPER
+ i = where ((s.general_cat == "Lu") and (0 == (char_classes & LOWER)));
+ char_classesi |= UPPER;
+
+ % ALPHA
+ i = where ((char_classes & (UPPER|LOWER)) or (gcat0 == 'L'));
+ char_classesi |= ALPHA;
+
+ % XDIGIT
+ i = where (((code_point >= '0') and (code_point <= '9'))
+	 or ((code_point >= 'A') and (code_point <= 'F'))
+	 or ((code_point >= 'a') and (code_point <= 'f')));
+ char_classesi |= XDIGIT;
+
+ % SPACE, BLANK
+ char_classes' ' |= SPACE|BLANK;
+ char_classes'\t' |= SPACE|BLANK;
+ char_classes'\n' |= SPACE;
+ char_classes'\r' |= SPACE;
+ char_classes'\f' |= SPACE;
+ char_classes'\v' |= SPACE;
+ % char_classes where (s.bidirectional_cat == "WS") |= SPACE;
+ i = where ((gcat0 == 'Z')
+	 and not array_map (Int_Type, &is_substr, s.char_decomp_map, "<noBreak>"));
+ char_classes i |= SPACE;
+
+ % CNTRL
+ char_classeswhere(s.char_name == "<control>") |= CNTRL;
+
+ % PRINT
+ char_classeswhere((s.char_name != "") and not (char_classes & CNTRL))
+ |= PRINT;
+
+ % DIGIT
+ i = where ((char_classes & XDIGIT) and not (char_classes & ALPHA));
+ char_classesi |= DIGIT;
+
+ % GRAPH
+ char_classeswhere ((char_classes & PRINT) and not (char_classes & SPACE))
+ |= GRAPH;
+
+ % ALNUM
+ char_classeswhere (char_classes & (ALPHA|DIGIT)) |= ALNUM;
+
+ % PUNCT
+ char_classeswhere ((char_classes & GRAPH) and not (char_classes & ALNUM))
+ |= PUNCT;
+
+ % ASCII
+ char_classeswhere (code_point < 0x80) |= ASCII;
+ return char_classes;
+}
+
+private define write_char_classes (file, s, char_classes)
+{
+ variable fp = init_file (file);
+ () = fprintf (fp, "#define SLCHARCLASS_LOWER\t0x%04X\n", LOWER);
+ () = fprintf (fp, "#define SLCHARCLASS_UPPER\t0x%04X\n", UPPER);
+ () = fprintf (fp, "#define SLCHARCLASS_ALPHA\t0x%04X\n", ALPHA);
+ () = fprintf (fp, "#define SLCHARCLASS_XDIGIT\t0x%04X\n", XDIGIT);
+ () = fprintf (fp, "#define SLCHARCLASS_SPACE\t0x%04X\n", SPACE);
+ () = fprintf (fp, "#define SLCHARCLASS_BLANK\t0x%04X\n", BLANK);
+ () = fprintf (fp, "#define SLCHARCLASS_CNTRL\t0x%04X\n", CNTRL);
+ () = fprintf (fp, "#define SLCHARCLASS_PRINT\t0x%04X\n", PRINT);
+ () = fprintf (fp, "#define SLCHARCLASS_DIGIT\t0x%04X\n", DIGIT);
+ () = fprintf (fp, "#define SLCHARCLASS_GRAPH\t0x%04X\n", GRAPH);
+ () = fprintf (fp, "#define SLCHARCLASS_ALNUM\t0x%04X\n", ALNUM);
+ () = fprintf (fp, "#define SLCHARCLASS_PUNCT\t0x%04X\n", PUNCT);
+ () = fprintf (fp, "#define SLCHARCLASS_ASCII\t0x%04X\n", ASCII);
+ () = fprintf (fp, "\n\n");
+ write_toxxx_table (fp, s, char_classes, Classification_C_Table_Type,
+		 "Classification", Classification_C_Table_Format, 8, 0);
+}
+
+private define main ()
+{
+ variable s = read_file (Unicode_Data_File);
+ read_east_asian_file (s, East_Asian_File);
+
+ variable char_classes = make_char_classes (s);
+ variable ch = s.code_point;
+ variable is_combining = ((s.general_cat == "Mn") or (s.general_cat == "Me"));
+ % Note: "Mc" (combining, yet spacing) is omitted here since I do
+ % not know what that means.
+
+ % Apparantly Hangul (Conjoining Jamo) characters 0x1160 - 0x11FF
+ % _behave_ like combining characters, but are not flagged as such in
+ % the database.
+ is_combining0x1160:0x11FF = 1;
+#ifnfalse
+ variable width = UChar_Typelength(ch);
+ width* = 1;
+ widthwhere (s.east_asian_prop == "W") = 2;
+ widthwhere (s.east_asian_prop == "F") = 2;
+ widthwhere (s.east_asian_prop == "A") = 3; % ambiguous
+
+ widthwhere (s.general_cat == "Cf") = 0;
+ width0xAD = 3;		 % SOFT-HYPHEN -- mark is as ambiguous
+
+ widthwhere(is_combining) = 0;
+ %widthwhere (s.bidirectional_cat == "NSM") = 0;
+ widthwhere (0 == array_map (Int_Type, &strncmp, s.char_name,
+				"ZERO WIDTH", 10))
+ = 0;
+
+ width0x80:0x9F = 4;	 % displayed as <xx> by SLsmg
+
+ write_toxxx_table ("slwcwidth.h", s, width, "bit",
+		 "Width", "0x%02X", 8, 1);
+#endif
+ write_toxxx_table ("slcombin.h", s,
+		 is_combining,
+		 "bit", "Combining", "0x%02X", 6, 0);
+ write_toxxx_table ("sllower.h", s, s.lowercase_mapping-ch, "_pSLint32_Type",
+		 "Tolower", "% 5d", 7, 0);
+ variable tmp = s.lowercase_mapping-ch;
+ write_toxxx_table ("slupper.h", s, s.uppercase_mapping-ch, "_pSLint32_Type",
+		 "Toupper", "% 5d", 7, 0);
+ write_char_classes ("slischar.h", s, char_classes);
+
+}
+
+main();

_service:tar_scm:slang.yaml Added